From f1fe7c9c7160ee700a464cbe54545955fa03d801 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 23 Jul 2025 01:55:23 +0200
Subject: [PATCH 001/175] feat(web): validation of the token address for
 ERC20/721/1155 types

---
 web/src/context/NewDisputeContext.tsx         |   1 +
 web/src/hooks/useTokenAddressValidation.ts    | 220 ++++++++++++++++++
 .../Resolver/NavigationButtons/NextButton.tsx |  16 +-
 web/src/pages/Resolver/Parameters/Court.tsx   | 149 +++++++++++-
 4 files changed, 380 insertions(+), 6 deletions(-)
 create mode 100644 web/src/hooks/useTokenAddressValidation.ts

diff --git a/web/src/context/NewDisputeContext.tsx b/web/src/context/NewDisputeContext.tsx
index 52abb696d..5fc109cef 100644
--- a/web/src/context/NewDisputeContext.tsx
+++ b/web/src/context/NewDisputeContext.tsx
@@ -61,6 +61,7 @@ export interface IGatedDisputeData {
   isERC1155: boolean;
   tokenGate: string;
   tokenId: string;
+  isTokenGateValid?: boolean | null; // null = not validated, false = invalid, true = valid
 }
 
 // Placeholder
diff --git a/web/src/hooks/useTokenAddressValidation.ts b/web/src/hooks/useTokenAddressValidation.ts
new file mode 100644
index 000000000..10275025b
--- /dev/null
+++ b/web/src/hooks/useTokenAddressValidation.ts
@@ -0,0 +1,220 @@
+import { useEffect, useState, useMemo } from "react";
+
+import { useQuery } from "@tanstack/react-query";
+import { getContract, isAddress } from "viem";
+import { usePublicClient, useChainId } from "wagmi";
+
+import { isUndefined } from "utils/index";
+
+const ERC1155_ABI = [
+  {
+    inputs: [
+      {
+        internalType: "address",
+        name: "account",
+        type: "address",
+      },
+      {
+        internalType: "uint256",
+        name: "id",
+        type: "uint256",
+      },
+    ],
+    name: "balanceOf",
+    outputs: [
+      {
+        internalType: "uint256",
+        name: "",
+        type: "uint256",
+      },
+    ],
+    stateMutability: "view",
+    type: "function",
+  },
+] as const;
+
+const ERC20_ERC721_ABI = [
+  {
+    inputs: [
+      {
+        internalType: "address",
+        name: "account",
+        type: "address",
+      },
+    ],
+    name: "balanceOf",
+    outputs: [
+      {
+        internalType: "uint256",
+        name: "",
+        type: "uint256",
+      },
+    ],
+    stateMutability: "view",
+    type: "function",
+  },
+] as const;
+
+interface UseTokenValidationParams {
+  address?: string;
+  enabled?: boolean;
+}
+
+interface TokenValidationResult {
+  isValidating: boolean;
+  isValid: boolean | null;
+  error: string | null;
+}
+
+/**
+ * Hook to validate if an address is a valid ERC20 or ERC721 token by attempting to call balanceOf(address)
+ * @param address The address to validate
+ * @param enabled Whether validation should be enabled
+ * @returns Validation state including loading, result, and error
+ */
+export const useERC20ERC721Validation = ({
+  address,
+  enabled = true,
+}: UseTokenValidationParams): TokenValidationResult => {
+  return useTokenValidation({
+    address,
+    enabled,
+    abi: ERC20_ERC721_ABI,
+    contractCall: (contract) => contract.read.balanceOf(["0x0000000000000000000000000000000000000000"]),
+    tokenType: "ERC-20 or ERC-721",
+  });
+};
+
+/**
+ * Hook to validate if an address is a valid ERC1155 token by attempting to call balanceOf(address, tokenId)
+ * @param address The address to validate
+ * @param enabled Whether validation should be enabled
+ * @returns Validation state including loading, result, and error
+ */
+export const useERC1155Validation = ({ address, enabled = true }: UseTokenValidationParams): TokenValidationResult => {
+  return useTokenValidation({
+    address,
+    enabled,
+    abi: ERC1155_ABI,
+    contractCall: (contract) => contract.read.balanceOf(["0x0000000000000000000000000000000000000000", 0]),
+    tokenType: "ERC-1155",
+  });
+};
+
+/**
+ * Generic hook for token contract validation
+ */
+const useTokenValidation = ({
+  address,
+  enabled = true,
+  abi,
+  contractCall,
+  tokenType,
+}: UseTokenValidationParams & {
+  abi: readonly any[];
+  contractCall: (contract: any) => Promise<any>;
+  tokenType: string;
+}): TokenValidationResult => {
+  const publicClient = usePublicClient();
+  const chainId = useChainId();
+  const [debouncedAddress, setDebouncedAddress] = useState<string>();
+
+  // Debounce address changes to avoid excessive network calls
+  useEffect(() => {
+    const timer = setTimeout(() => {
+      setDebouncedAddress(address);
+    }, 500);
+
+    return () => clearTimeout(timer);
+  }, [address]);
+
+  // Early validation - check format
+  const isValidFormat = useMemo(() => {
+    if (!debouncedAddress || debouncedAddress.trim() === "") return null;
+    return isAddress(debouncedAddress);
+  }, [debouncedAddress]);
+
+  // Contract validation query
+  const {
+    data: isValidContract,
+    isLoading,
+    error,
+  } = useQuery({
+    queryKey: [`${tokenType}-validation`, chainId, debouncedAddress],
+    enabled:
+      enabled &&
+      !isUndefined(publicClient) &&
+      !isUndefined(debouncedAddress) &&
+      debouncedAddress.trim() !== "" &&
+      isValidFormat === true,
+    staleTime: 300000, // Cache for 5 minutes
+    retry: 1, // Only retry once to fail faster
+    retryDelay: 1000, // Short retry delay
+    queryFn: async () => {
+      if (!publicClient || !debouncedAddress) {
+        throw new Error("Missing required dependencies");
+      }
+
+      try {
+        const contract = getContract({
+          address: debouncedAddress as `0x${string}`,
+          abi,
+          client: publicClient,
+        });
+
+        // Execute the contract call specific to the token type
+        await contractCall(contract);
+
+        return true;
+      } catch {
+        throw new Error(`Address does not implement ${tokenType} interface`);
+      }
+    },
+  });
+
+  // Determine final validation state
+  const isValid = useMemo(() => {
+    if (!debouncedAddress || debouncedAddress.trim() === "") {
+      return null;
+    }
+
+    if (isValidFormat === false) {
+      return false;
+    }
+
+    if (isLoading) {
+      return null; // Still validating
+    }
+
+    return isValidContract === true;
+  }, [debouncedAddress, isValidFormat, isLoading, isValidContract]);
+
+  const validationError = useMemo(() => {
+    if (!debouncedAddress || debouncedAddress.trim() === "") {
+      return null;
+    }
+
+    if (isValidFormat === false) {
+      return "Invalid Ethereum address format";
+    }
+
+    if (error) {
+      const errorMessage = error instanceof Error ? error.message : "Unknown error";
+      if (errorMessage.includes("not a contract")) {
+        return "Address is not a contract";
+      }
+      if (errorMessage.includes(`does not implement ${tokenType}`)) {
+        return `Not a valid ${tokenType} token address`;
+      }
+      return "Network error - please try again";
+    }
+
+    return null;
+  }, [debouncedAddress, isValidFormat, error, tokenType]);
+
+  return {
+    isValidating: isLoading && enabled && !!debouncedAddress,
+    isValid,
+    error: validationError,
+  };
+};
diff --git a/web/src/pages/Resolver/NavigationButtons/NextButton.tsx b/web/src/pages/Resolver/NavigationButtons/NextButton.tsx
index e6d51f8bf..2530281bd 100644
--- a/web/src/pages/Resolver/NavigationButtons/NextButton.tsx
+++ b/web/src/pages/Resolver/NavigationButtons/NextButton.tsx
@@ -4,7 +4,8 @@ import { useLocation, useNavigate } from "react-router-dom";
 
 import { Button } from "@kleros/ui-components-library";
 
-import { useNewDisputeContext } from "context/NewDisputeContext";
+import { IGatedDisputeData, useNewDisputeContext } from "context/NewDisputeContext";
+
 import { isEmpty } from "src/utils";
 
 interface INextButton {
@@ -16,6 +17,17 @@ const NextButton: React.FC<INextButton> = ({ nextRoute }) => {
   const { disputeData, isPolicyUploading } = useNewDisputeContext();
   const location = useLocation();
 
+  // Check gated dispute kit validation status
+  const isGatedTokenValid = React.useMemo(() => {
+    if (!disputeData.disputeKitData || disputeData.disputeKitData.type !== "gated") return true;
+
+    const gatedData = disputeData.disputeKitData as IGatedDisputeData;
+    if (!gatedData?.tokenGate?.trim()) return true; // No token address provided, so valid
+
+    // If token address is provided, it must be validated as valid ERC20
+    return gatedData.isTokenGateValid === true;
+  }, [disputeData.disputeKitData]);
+
   //checks if each answer is filled in
   const areVotingOptionsFilled =
     disputeData.question !== "" &&
@@ -29,7 +41,7 @@ const NextButton: React.FC<INextButton> = ({ nextRoute }) => {
   const isButtonDisabled =
     (location.pathname.includes("/resolver/title") && !disputeData.title) ||
     (location.pathname.includes("/resolver/description") && !disputeData.description) ||
-    (location.pathname.includes("/resolver/court") && !disputeData.courtId) ||
+    (location.pathname.includes("/resolver/court") && (!disputeData.courtId || !isGatedTokenValid)) ||
     (location.pathname.includes("/resolver/jurors") && !disputeData.arbitrationCost) ||
     (location.pathname.includes("/resolver/voting-options") && !areVotingOptionsFilled) ||
     (location.pathname.includes("/resolver/notable-persons") && !areAliasesValidOrEmpty) ||
diff --git a/web/src/pages/Resolver/Parameters/Court.tsx b/web/src/pages/Resolver/Parameters/Court.tsx
index b82fbb133..805213253 100644
--- a/web/src/pages/Resolver/Parameters/Court.tsx
+++ b/web/src/pages/Resolver/Parameters/Court.tsx
@@ -1,4 +1,4 @@
-import React, { useMemo } from "react";
+import React, { useMemo, useEffect } from "react";
 import styled, { css } from "styled-components";
 
 import { AlertMessage, Checkbox, DropdownCascader, DropdownSelect, Field } from "@kleros/ui-components-library";
@@ -7,6 +7,7 @@ import { DisputeKits } from "consts/index";
 import { IGatedDisputeData, useNewDisputeContext } from "context/NewDisputeContext";
 import { rootCourtToItems, useCourtTree } from "hooks/queries/useCourtTree";
 import { useDisputeKitAddressesAll } from "hooks/useDisputeKitAddresses";
+import { useERC20ERC721Validation, useERC1155Validation } from "hooks/useTokenAddressValidation";
 import { isUndefined } from "utils/index";
 
 import { useSupportedDisputeKits } from "queries/useSupportedDisputeKits";
@@ -86,6 +87,86 @@ const StyledCheckbox = styled(Checkbox)`
   )}
 `;
 
+const ValidationContainer = styled.div`
+  width: 84vw;
+  display: flex;
+  align-items: left;
+  gap: 8px;
+  margin-top: 8px;
+  ${landscapeStyle(
+    () => css`
+      width: ${responsiveSize(442, 700, 900)};
+    `
+  )}
+`;
+
+const ValidationIcon = styled.div<{ $isValid?: boolean | null; $isValidating?: boolean }>`
+  width: 16px;
+  height: 16px;
+  border-radius: 50%;
+  display: flex;
+  align-items: center;
+  justify-content: center;
+  font-size: 12px;
+
+  ${({ $isValidating, $isValid }) => {
+    if ($isValidating) {
+      return css`
+        border: 2px solid #ccc;
+        border-top-color: #007bff;
+        animation: spin 1s linear infinite;
+
+        @keyframes spin {
+          to {
+            transform: rotate(360deg);
+          }
+        }
+      `;
+    }
+
+    if ($isValid === true) {
+      return css`
+        background-color: #28a745;
+        color: white;
+        &::after {
+          content: "✓";
+        }
+      `;
+    }
+
+    if ($isValid === false) {
+      return css`
+        background-color: #dc3545;
+        color: white;
+        &::after {
+          content: "✗";
+        }
+      `;
+    }
+
+    return css`
+      display: none;
+    `;
+  }}
+`;
+
+const ValidationMessage = styled.small<{ $isError?: boolean }>`
+  color: ${({ $isError }) => ($isError ? "#dc3545" : "#28a745")};
+  font-size: 14px;
+  font-style: italic;
+  font-weight: normal;
+`;
+
+const StyledFieldWithValidation = styled(StyledField)<{ $isValid?: boolean | null }>`
+  > input {
+    border-color: ${({ $isValid }) => {
+      if ($isValid === true) return "#28a745";
+      if ($isValid === false) return "#dc3545";
+      return "inherit";
+    }};
+  }
+`;
+
 const Court: React.FC = () => {
   const { disputeData, setDisputeData } = useNewDisputeContext();
   const { data: courtTree } = useCourtTree();
@@ -120,6 +201,47 @@ const Court: React.FC = () => {
     return options?.gated ?? false;
   }, [disputeKitOptions, selectedDisputeKitId]);
 
+  // Token validation for token gate address (conditional based on ERC1155 checkbox)
+  const tokenGateAddress = (disputeData.disputeKitData as IGatedDisputeData)?.tokenGate ?? "";
+  const isERC1155 = (disputeData.disputeKitData as IGatedDisputeData)?.isERC1155 ?? false;
+  const validationEnabled = isGatedDisputeKit && !!tokenGateAddress.trim();
+
+  const {
+    isValidating: isValidatingERC20,
+    isValid: isValidERC20,
+    error: validationErrorERC20,
+  } = useERC20ERC721Validation({
+    address: tokenGateAddress,
+    enabled: validationEnabled && !isERC1155,
+  });
+
+  const {
+    isValidating: isValidatingERC1155,
+    isValid: isValidERC1155,
+    error: validationErrorERC1155,
+  } = useERC1155Validation({
+    address: tokenGateAddress,
+    enabled: validationEnabled && isERC1155,
+  });
+
+  // Combine validation results based on token type
+  const isValidating = isERC1155 ? isValidatingERC1155 : isValidatingERC20;
+  const isValidToken = isERC1155 ? isValidERC1155 : isValidERC20;
+  const validationError = isERC1155 ? validationErrorERC1155 : validationErrorERC20;
+
+  // Update validation state in dispute context
+  useEffect(() => {
+    if (isGatedDisputeKit && disputeData.disputeKitData) {
+      const currentData = disputeData.disputeKitData as IGatedDisputeData;
+      if (currentData.isTokenGateValid !== isValidToken) {
+        setDisputeData({
+          ...disputeData,
+          disputeKitData: { ...currentData, isTokenGateValid: isValidToken },
+        });
+      }
+    }
+  }, [isValidToken, isGatedDisputeKit, disputeData, setDisputeData]);
+
   const handleCourtChange = (courtId: string) => {
     if (disputeData.courtId !== courtId) {
       setDisputeData({ ...disputeData, courtId, disputeKitId: undefined });
@@ -144,7 +266,11 @@ const Court: React.FC = () => {
     const currentData = disputeData.disputeKitData as IGatedDisputeData;
     setDisputeData({
       ...disputeData,
-      disputeKitData: { ...currentData, tokenGate: event.target.value },
+      disputeKitData: {
+        ...currentData,
+        tokenGate: event.target.value,
+        isTokenGateValid: null, // Reset validation state when address changes
+      },
     });
   };
 
@@ -152,7 +278,11 @@ const Court: React.FC = () => {
     const currentData = disputeData.disputeKitData as IGatedDisputeData;
     setDisputeData({
       ...disputeData,
-      disputeKitData: { ...currentData, isERC1155: event.target.checked },
+      disputeKitData: {
+        ...currentData,
+        isERC1155: event.target.checked,
+        isTokenGateValid: null, // Reset validation state when token type changes
+      },
     });
   };
 
@@ -187,12 +317,23 @@ const Court: React.FC = () => {
       )}
       {isGatedDisputeKit && (
         <>
-          <StyledField
+          <StyledFieldWithValidation
             dir="auto"
             onChange={handleTokenAddressChange}
             value={(disputeData.disputeKitData as IGatedDisputeData)?.tokenGate ?? ""}
             placeholder="Eg. 0xda10009cbd5d07dd0cecc66161fc93d7c9000da1"
+            $isValid={isValidToken}
           />
+          {tokenGateAddress.trim() !== "" && (
+            <ValidationContainer>
+              <ValidationIcon $isValidating={isValidating} $isValid={isValidToken} />
+              <ValidationMessage $isError={!!validationError}>
+                {isValidating && `Validating ${isERC1155 ? "ERC-1155" : "ERC-20 or ERC-721"} token...`}
+                {validationError && validationError}
+                {isValidToken === true && `Valid ${isERC1155 ? "ERC-1155" : "ERC-20 or ERC-721"} token`}
+              </ValidationMessage>
+            </ValidationContainer>
+          )}
           <StyledCheckbox
             onChange={handleERC1155TokenChange}
             checked={(disputeData.disputeKitData as IGatedDisputeData)?.isERC1155 ?? false}

From 4594536c5f9ed5fbfe489dfb9dbef6d23766d8e2 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Tue, 5 Aug 2025 13:23:03 +0100
Subject: [PATCH 002/175] chore: changed contracts viem dependency as peer
 dependency

---
 contracts/package.json | 11 +++++++++--
 1 file changed, 9 insertions(+), 2 deletions(-)

diff --git a/contracts/package.json b/contracts/package.json
index fc719eb7f..239c1665c 100644
--- a/contracts/package.json
+++ b/contracts/package.json
@@ -121,7 +121,7 @@
     "@types/mocha": "^10.0.10",
     "@types/node": "^20.17.6",
     "@types/sinon": "^17.0.4",
-    "@wagmi/cli": "^2.2.0",
+    "@wagmi/cli": "^2.3.2",
     "abitype": "^0.10.3",
     "chai": "^4.5.0",
     "dotenv": "^16.6.1",
@@ -157,7 +157,14 @@
     "@kleros/vea-contracts": "^0.6.0",
     "@openzeppelin/contracts": "^5.4.0",
     "@shutter-network/shutter-sdk": "0.0.2",
-    "isomorphic-fetch": "^3.0.0",
+    "isomorphic-fetch": "^3.0.0"
+  },
+  "peerDependencies": {
     "viem": "^2.24.1"
+  },
+  "peerDependenciesMeta": {
+    "viem": {
+      "optional": false
+    }
   }
 }

From 5a81f9ecf9e4d182284fcf1a99f5aaadda81fbef Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Tue, 5 Aug 2025 13:24:53 +0100
Subject: [PATCH 003/175] feat: dispute kit helper

---
 contracts/deployments/disputeKitsViem.ts | 85 ++++++++++++++++++++++++
 contracts/deployments/index.ts           |  3 +
 contracts/scripts/getDisputeKits.ts      | 33 +++++++++
 3 files changed, 121 insertions(+)
 create mode 100644 contracts/deployments/disputeKitsViem.ts
 create mode 100644 contracts/scripts/getDisputeKits.ts

diff --git a/contracts/deployments/disputeKitsViem.ts b/contracts/deployments/disputeKitsViem.ts
new file mode 100644
index 000000000..45ae23998
--- /dev/null
+++ b/contracts/deployments/disputeKitsViem.ts
@@ -0,0 +1,85 @@
+import { getContracts } from "./contractsViem";
+import { Abi, AbiEvent, getAbiItem, PublicClient } from "viem";
+import { DeploymentName } from "./utils";
+
+export type DisputeKitContracts = ReturnType<typeof getContracts>;
+export type DisputeKit =
+  | NonNullable<DisputeKitContracts["disputeKitClassic"]>
+  | NonNullable<DisputeKitContracts["disputeKitShutter"]>
+  | NonNullable<DisputeKitContracts["disputeKitGated"]>
+  | NonNullable<DisputeKitContracts["disputeKitGatedShutter"]>
+  | null;
+export type DisputeKitInfos = {
+  address: `0x${string}`;
+  contract: DisputeKit;
+  isGated: boolean;
+  isShutter: boolean;
+};
+export type DisputeKitByIds = Record<string, DisputeKitInfos>;
+
+const fetchDisputeKits = async (client: PublicClient, klerosCoreAddress: `0x${string}`, klerosCoreAbi: Abi) => {
+  const DisputeKitCreated = getAbiItem({
+    abi: klerosCoreAbi,
+    name: "DisputeKitCreated",
+  }) as AbiEvent;
+  const logs = await client.getLogs({
+    address: klerosCoreAddress,
+    event: DisputeKitCreated,
+    fromBlock: 0n,
+    toBlock: "latest",
+  });
+  return Object.fromEntries(
+    logs
+      .filter((log) => {
+        const args = log.args as Record<string, unknown>;
+        return "_disputeKitID" in args && "_disputeKitAddress" in args;
+      })
+      .map((log) => {
+        const { _disputeKitID, _disputeKitAddress } = log.args as {
+          _disputeKitID: bigint;
+          _disputeKitAddress: string;
+        };
+        return {
+          disputeKitID: _disputeKitID,
+          disputeKitAddress: _disputeKitAddress,
+        };
+      })
+      .map(({ disputeKitID, disputeKitAddress }) => [disputeKitID!.toString(), disputeKitAddress as `0x${string}`])
+  );
+};
+
+export const getDisputeKits = async (client: PublicClient, deployment: DeploymentName): Promise<DisputeKitByIds> => {
+  const { klerosCore, disputeKitClassic, disputeKitShutter, disputeKitGated, disputeKitGatedShutter } = getContracts({
+    publicClient: client,
+    deployment: deployment,
+  });
+
+  const isDefined = <T>(kit: T): kit is NonNullable<T> => kit != null;
+  const disputeKitContracts = [disputeKitClassic, disputeKitShutter, disputeKitGated, disputeKitGatedShutter].filter(
+    isDefined
+  );
+  const shutterEnabled = [disputeKitShutter, disputeKitGatedShutter].filter(isDefined);
+  const gatedEnabled = [disputeKitGated, disputeKitGatedShutter].filter(isDefined);
+
+  const disputeKitMap = await fetchDisputeKits(client, klerosCore.address, klerosCore.abi);
+
+  return Object.fromEntries(
+    Object.entries(disputeKitMap).map(([disputeKitID, address]) => {
+      const contract =
+        disputeKitContracts.find((contract) => contract.address.toLowerCase() === address.toLowerCase()) ?? null;
+      return [
+        disputeKitID,
+        {
+          address,
+          contract: contract satisfies DisputeKit,
+          isGated: contract
+            ? gatedEnabled.some((gated) => contract.address.toLowerCase() === gated.address.toLowerCase())
+            : false,
+          isShutter: contract
+            ? shutterEnabled.some((shutter) => contract.address.toLowerCase() === shutter.address.toLowerCase())
+            : false,
+        },
+      ];
+    })
+  );
+};
diff --git a/contracts/deployments/index.ts b/contracts/deployments/index.ts
index 3479c5edf..c94968751 100644
--- a/contracts/deployments/index.ts
+++ b/contracts/deployments/index.ts
@@ -17,3 +17,6 @@ export * from "./utils";
 // Contracts getters
 export { getContracts as getContractsEthers } from "./contractsEthers";
 export { getContracts as getContractsViem } from "./contractsViem";
+
+// Dispute kits getters
+export { getDisputeKits as getDisputeKitsViem, type DisputeKitByIds, type DisputeKitInfos } from "./disputeKitsViem";
diff --git a/contracts/scripts/getDisputeKits.ts b/contracts/scripts/getDisputeKits.ts
new file mode 100644
index 000000000..32f2b18eb
--- /dev/null
+++ b/contracts/scripts/getDisputeKits.ts
@@ -0,0 +1,33 @@
+import { getDisputeKits } from "../deployments/disputeKitsViem";
+import { createPublicClient, http } from "viem";
+import { arbitrumSepolia } from "viem/chains";
+
+const rpc = process.env.ARBITRUM_SEPOLIA_RPC;
+if (!rpc) {
+  throw new Error("ARBITRUM_SEPOLIA_RPC is not set");
+}
+
+const client = createPublicClient({
+  chain: arbitrumSepolia,
+  transport: http(rpc),
+});
+
+async function main() {
+  try {
+    console.log("Fetching DisputeKitCreated events...");
+    const disputeKitResult = await getDisputeKits(client, "devnet");
+    console.log(disputeKitResult);
+  } catch (error) {
+    console.error("Error fetching events:", error);
+    throw error;
+  }
+}
+
+if (require.main === module) {
+  main()
+    .then(() => process.exit(0))
+    .catch((error) => {
+      console.error(error);
+      process.exit(1);
+    });
+}

From 4c2277baabaa898fbf8af75b91448472241f069c Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Tue, 5 Aug 2025 13:29:23 +0100
Subject: [PATCH 004/175] chore: override viem resolution from viem@npm:2.x to
 npm:^2.23.2 because of @wagmi/cli

---
 package.json |   3 +-
 yarn.lock    | 367 +++++++++++++++++++++++++++++++++++++++++++++++----
 2 files changed, 345 insertions(+), 25 deletions(-)

diff --git a/package.json b/package.json
index 6c9deb2d4..01e9468a1 100644
--- a/package.json
+++ b/package.json
@@ -77,7 +77,8 @@
     "elliptic@npm:6.5.4": "npm:6.6.1",
     "word-wrap@npm:~1.2.3": "npm:1.2.5",
     "@codemirror/state": "npm:6.5.2",
-    "undici@npm:7.3.0": "npm:7.5.0"
+    "undici@npm:7.3.0": "npm:7.5.0",
+    "viem@npm:2.x": "npm:^2.23.2"
   },
   "scripts": {
     "check-prerequisites": "scripts/check-prerequisites.sh",
diff --git a/yarn.lock b/yarn.lock
index 166200247..0b2eacdf0 100644
--- a/yarn.lock
+++ b/yarn.lock
@@ -3065,6 +3065,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@esbuild/aix-ppc64@npm:0.25.8":
+  version: 0.25.8
+  resolution: "@esbuild/aix-ppc64@npm:0.25.8"
+  conditions: os=aix & cpu=ppc64
+  languageName: node
+  linkType: hard
+
 "@esbuild/android-arm64@npm:0.19.12":
   version: 0.19.12
   resolution: "@esbuild/android-arm64@npm:0.19.12"
@@ -3079,6 +3086,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@esbuild/android-arm64@npm:0.25.8":
+  version: 0.25.8
+  resolution: "@esbuild/android-arm64@npm:0.25.8"
+  conditions: os=android & cpu=arm64
+  languageName: node
+  linkType: hard
+
 "@esbuild/android-arm@npm:0.19.12":
   version: 0.19.12
   resolution: "@esbuild/android-arm@npm:0.19.12"
@@ -3093,6 +3107,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@esbuild/android-arm@npm:0.25.8":
+  version: 0.25.8
+  resolution: "@esbuild/android-arm@npm:0.25.8"
+  conditions: os=android & cpu=arm
+  languageName: node
+  linkType: hard
+
 "@esbuild/android-x64@npm:0.19.12":
   version: 0.19.12
   resolution: "@esbuild/android-x64@npm:0.19.12"
@@ -3107,6 +3128,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@esbuild/android-x64@npm:0.25.8":
+  version: 0.25.8
+  resolution: "@esbuild/android-x64@npm:0.25.8"
+  conditions: os=android & cpu=x64
+  languageName: node
+  linkType: hard
+
 "@esbuild/darwin-arm64@npm:0.19.12":
   version: 0.19.12
   resolution: "@esbuild/darwin-arm64@npm:0.19.12"
@@ -3121,6 +3149,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@esbuild/darwin-arm64@npm:0.25.8":
+  version: 0.25.8
+  resolution: "@esbuild/darwin-arm64@npm:0.25.8"
+  conditions: os=darwin & cpu=arm64
+  languageName: node
+  linkType: hard
+
 "@esbuild/darwin-x64@npm:0.19.12":
   version: 0.19.12
   resolution: "@esbuild/darwin-x64@npm:0.19.12"
@@ -3135,6 +3170,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@esbuild/darwin-x64@npm:0.25.8":
+  version: 0.25.8
+  resolution: "@esbuild/darwin-x64@npm:0.25.8"
+  conditions: os=darwin & cpu=x64
+  languageName: node
+  linkType: hard
+
 "@esbuild/freebsd-arm64@npm:0.19.12":
   version: 0.19.12
   resolution: "@esbuild/freebsd-arm64@npm:0.19.12"
@@ -3149,6 +3191,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@esbuild/freebsd-arm64@npm:0.25.8":
+  version: 0.25.8
+  resolution: "@esbuild/freebsd-arm64@npm:0.25.8"
+  conditions: os=freebsd & cpu=arm64
+  languageName: node
+  linkType: hard
+
 "@esbuild/freebsd-x64@npm:0.19.12":
   version: 0.19.12
   resolution: "@esbuild/freebsd-x64@npm:0.19.12"
@@ -3163,6 +3212,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@esbuild/freebsd-x64@npm:0.25.8":
+  version: 0.25.8
+  resolution: "@esbuild/freebsd-x64@npm:0.25.8"
+  conditions: os=freebsd & cpu=x64
+  languageName: node
+  linkType: hard
+
 "@esbuild/linux-arm64@npm:0.19.12":
   version: 0.19.12
   resolution: "@esbuild/linux-arm64@npm:0.19.12"
@@ -3177,6 +3233,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@esbuild/linux-arm64@npm:0.25.8":
+  version: 0.25.8
+  resolution: "@esbuild/linux-arm64@npm:0.25.8"
+  conditions: os=linux & cpu=arm64
+  languageName: node
+  linkType: hard
+
 "@esbuild/linux-arm@npm:0.19.12":
   version: 0.19.12
   resolution: "@esbuild/linux-arm@npm:0.19.12"
@@ -3191,6 +3254,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@esbuild/linux-arm@npm:0.25.8":
+  version: 0.25.8
+  resolution: "@esbuild/linux-arm@npm:0.25.8"
+  conditions: os=linux & cpu=arm
+  languageName: node
+  linkType: hard
+
 "@esbuild/linux-ia32@npm:0.19.12":
   version: 0.19.12
   resolution: "@esbuild/linux-ia32@npm:0.19.12"
@@ -3205,6 +3275,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@esbuild/linux-ia32@npm:0.25.8":
+  version: 0.25.8
+  resolution: "@esbuild/linux-ia32@npm:0.25.8"
+  conditions: os=linux & cpu=ia32
+  languageName: node
+  linkType: hard
+
 "@esbuild/linux-loong64@npm:0.19.12":
   version: 0.19.12
   resolution: "@esbuild/linux-loong64@npm:0.19.12"
@@ -3219,6 +3296,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@esbuild/linux-loong64@npm:0.25.8":
+  version: 0.25.8
+  resolution: "@esbuild/linux-loong64@npm:0.25.8"
+  conditions: os=linux & cpu=loong64
+  languageName: node
+  linkType: hard
+
 "@esbuild/linux-mips64el@npm:0.19.12":
   version: 0.19.12
   resolution: "@esbuild/linux-mips64el@npm:0.19.12"
@@ -3233,6 +3317,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@esbuild/linux-mips64el@npm:0.25.8":
+  version: 0.25.8
+  resolution: "@esbuild/linux-mips64el@npm:0.25.8"
+  conditions: os=linux & cpu=mips64el
+  languageName: node
+  linkType: hard
+
 "@esbuild/linux-ppc64@npm:0.19.12":
   version: 0.19.12
   resolution: "@esbuild/linux-ppc64@npm:0.19.12"
@@ -3247,6 +3338,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@esbuild/linux-ppc64@npm:0.25.8":
+  version: 0.25.8
+  resolution: "@esbuild/linux-ppc64@npm:0.25.8"
+  conditions: os=linux & cpu=ppc64
+  languageName: node
+  linkType: hard
+
 "@esbuild/linux-riscv64@npm:0.19.12":
   version: 0.19.12
   resolution: "@esbuild/linux-riscv64@npm:0.19.12"
@@ -3261,6 +3359,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@esbuild/linux-riscv64@npm:0.25.8":
+  version: 0.25.8
+  resolution: "@esbuild/linux-riscv64@npm:0.25.8"
+  conditions: os=linux & cpu=riscv64
+  languageName: node
+  linkType: hard
+
 "@esbuild/linux-s390x@npm:0.19.12":
   version: 0.19.12
   resolution: "@esbuild/linux-s390x@npm:0.19.12"
@@ -3275,6 +3380,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@esbuild/linux-s390x@npm:0.25.8":
+  version: 0.25.8
+  resolution: "@esbuild/linux-s390x@npm:0.25.8"
+  conditions: os=linux & cpu=s390x
+  languageName: node
+  linkType: hard
+
 "@esbuild/linux-x64@npm:0.19.12":
   version: 0.19.12
   resolution: "@esbuild/linux-x64@npm:0.19.12"
@@ -3289,6 +3401,20 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@esbuild/linux-x64@npm:0.25.8":
+  version: 0.25.8
+  resolution: "@esbuild/linux-x64@npm:0.25.8"
+  conditions: os=linux & cpu=x64
+  languageName: node
+  linkType: hard
+
+"@esbuild/netbsd-arm64@npm:0.25.8":
+  version: 0.25.8
+  resolution: "@esbuild/netbsd-arm64@npm:0.25.8"
+  conditions: os=netbsd & cpu=arm64
+  languageName: node
+  linkType: hard
+
 "@esbuild/netbsd-x64@npm:0.19.12":
   version: 0.19.12
   resolution: "@esbuild/netbsd-x64@npm:0.19.12"
@@ -3303,6 +3429,20 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@esbuild/netbsd-x64@npm:0.25.8":
+  version: 0.25.8
+  resolution: "@esbuild/netbsd-x64@npm:0.25.8"
+  conditions: os=netbsd & cpu=x64
+  languageName: node
+  linkType: hard
+
+"@esbuild/openbsd-arm64@npm:0.25.8":
+  version: 0.25.8
+  resolution: "@esbuild/openbsd-arm64@npm:0.25.8"
+  conditions: os=openbsd & cpu=arm64
+  languageName: node
+  linkType: hard
+
 "@esbuild/openbsd-x64@npm:0.19.12":
   version: 0.19.12
   resolution: "@esbuild/openbsd-x64@npm:0.19.12"
@@ -3317,6 +3457,20 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@esbuild/openbsd-x64@npm:0.25.8":
+  version: 0.25.8
+  resolution: "@esbuild/openbsd-x64@npm:0.25.8"
+  conditions: os=openbsd & cpu=x64
+  languageName: node
+  linkType: hard
+
+"@esbuild/openharmony-arm64@npm:0.25.8":
+  version: 0.25.8
+  resolution: "@esbuild/openharmony-arm64@npm:0.25.8"
+  conditions: os=openharmony & cpu=arm64
+  languageName: node
+  linkType: hard
+
 "@esbuild/sunos-x64@npm:0.19.12":
   version: 0.19.12
   resolution: "@esbuild/sunos-x64@npm:0.19.12"
@@ -3331,6 +3485,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@esbuild/sunos-x64@npm:0.25.8":
+  version: 0.25.8
+  resolution: "@esbuild/sunos-x64@npm:0.25.8"
+  conditions: os=sunos & cpu=x64
+  languageName: node
+  linkType: hard
+
 "@esbuild/win32-arm64@npm:0.19.12":
   version: 0.19.12
   resolution: "@esbuild/win32-arm64@npm:0.19.12"
@@ -3345,6 +3506,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@esbuild/win32-arm64@npm:0.25.8":
+  version: 0.25.8
+  resolution: "@esbuild/win32-arm64@npm:0.25.8"
+  conditions: os=win32 & cpu=arm64
+  languageName: node
+  linkType: hard
+
 "@esbuild/win32-ia32@npm:0.19.12":
   version: 0.19.12
   resolution: "@esbuild/win32-ia32@npm:0.19.12"
@@ -3359,6 +3527,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@esbuild/win32-ia32@npm:0.25.8":
+  version: 0.25.8
+  resolution: "@esbuild/win32-ia32@npm:0.25.8"
+  conditions: os=win32 & cpu=ia32
+  languageName: node
+  linkType: hard
+
 "@esbuild/win32-x64@npm:0.19.12":
   version: 0.19.12
   resolution: "@esbuild/win32-x64@npm:0.19.12"
@@ -3373,6 +3548,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@esbuild/win32-x64@npm:0.25.8":
+  version: 0.25.8
+  resolution: "@esbuild/win32-x64@npm:0.25.8"
+  conditions: os=win32 & cpu=x64
+  languageName: node
+  linkType: hard
+
 "@eslint-community/eslint-utils@npm:^4.2.0, @eslint-community/eslint-utils@npm:^4.4.0":
   version: 4.4.0
   resolution: "@eslint-community/eslint-utils@npm:4.4.0"
@@ -5955,7 +6137,7 @@ __metadata:
     "@types/mocha": "npm:^10.0.10"
     "@types/node": "npm:^20.17.6"
     "@types/sinon": "npm:^17.0.4"
-    "@wagmi/cli": "npm:^2.2.0"
+    "@wagmi/cli": "npm:^2.3.2"
     abitype: "npm:^0.10.3"
     chai: "npm:^4.5.0"
     dotenv: "npm:^16.6.1"
@@ -5986,7 +6168,11 @@ __metadata:
     ts-node: "npm:^10.9.2"
     typechain: "npm:^8.3.2"
     typescript: "npm:^5.6.3"
-    viem: "npm:^2.24.1"
+  peerDependencies:
+    viem: ^2.24.1
+  peerDependenciesMeta:
+    viem:
+      optional: false
   languageName: unknown
   linkType: soft
 
@@ -10999,6 +11185,39 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@wagmi/cli@npm:^2.3.2":
+  version: 2.3.2
+  resolution: "@wagmi/cli@npm:2.3.2"
+  dependencies:
+    abitype: "npm:^1.0.4"
+    bundle-require: "npm:^5.1.0"
+    cac: "npm:^6.7.14"
+    change-case: "npm:^5.4.4"
+    chokidar: "npm:4.0.1"
+    dedent: "npm:^0.7.0"
+    dotenv: "npm:^16.3.1"
+    dotenv-expand: "npm:^10.0.0"
+    esbuild: "npm:~0.25.4"
+    escalade: "npm:3.2.0"
+    fdir: "npm:^6.1.1"
+    nanospinner: "npm:1.2.2"
+    pathe: "npm:^1.1.2"
+    picocolors: "npm:^1.0.0"
+    picomatch: "npm:^3.0.0"
+    prettier: "npm:^3.0.3"
+    viem: "npm:2.x"
+    zod: "npm:^3.22.2"
+  peerDependencies:
+    typescript: ">=5.0.4"
+  peerDependenciesMeta:
+    typescript:
+      optional: true
+  bin:
+    wagmi: dist/esm/cli.js
+  checksum: 10/85c6b1d4960c6d080d067f7dbac34e6a27d822690d33ef6c131b7714f6be13c5e04b2dd506fce38992ee6183ebe0fb48160e30f4cf901a27ccf34fd1b2dae529
+  languageName: node
+  linkType: hard
+
 "@wagmi/connectors@npm:5.7.11, @wagmi/connectors@npm:>=5.7.11, @wagmi/connectors@npm:^5.7.11":
   version: 5.7.11
   resolution: "@wagmi/connectors@npm:5.7.11"
@@ -13621,6 +13840,17 @@ __metadata:
   languageName: node
   linkType: hard
 
+"bundle-require@npm:^5.1.0":
+  version: 5.1.0
+  resolution: "bundle-require@npm:5.1.0"
+  dependencies:
+    load-tsconfig: "npm:^0.2.3"
+  peerDependencies:
+    esbuild: ">=0.18"
+  checksum: 10/735e0220055b9bdac20bea48ec1e10dc3a205232c889ef54767900bebdc721959c4ccb221e4ea434d7ddcd693a8a4445c3d0598e4040ee313ce0ac3aae3e6178
+  languageName: node
+  linkType: hard
+
 "busboy@npm:1.6.0, busboy@npm:^1.6.0":
   version: 1.6.0
   resolution: "busboy@npm:1.6.0"
@@ -17150,6 +17380,95 @@ __metadata:
   languageName: node
   linkType: hard
 
+"esbuild@npm:~0.25.4":
+  version: 0.25.8
+  resolution: "esbuild@npm:0.25.8"
+  dependencies:
+    "@esbuild/aix-ppc64": "npm:0.25.8"
+    "@esbuild/android-arm": "npm:0.25.8"
+    "@esbuild/android-arm64": "npm:0.25.8"
+    "@esbuild/android-x64": "npm:0.25.8"
+    "@esbuild/darwin-arm64": "npm:0.25.8"
+    "@esbuild/darwin-x64": "npm:0.25.8"
+    "@esbuild/freebsd-arm64": "npm:0.25.8"
+    "@esbuild/freebsd-x64": "npm:0.25.8"
+    "@esbuild/linux-arm": "npm:0.25.8"
+    "@esbuild/linux-arm64": "npm:0.25.8"
+    "@esbuild/linux-ia32": "npm:0.25.8"
+    "@esbuild/linux-loong64": "npm:0.25.8"
+    "@esbuild/linux-mips64el": "npm:0.25.8"
+    "@esbuild/linux-ppc64": "npm:0.25.8"
+    "@esbuild/linux-riscv64": "npm:0.25.8"
+    "@esbuild/linux-s390x": "npm:0.25.8"
+    "@esbuild/linux-x64": "npm:0.25.8"
+    "@esbuild/netbsd-arm64": "npm:0.25.8"
+    "@esbuild/netbsd-x64": "npm:0.25.8"
+    "@esbuild/openbsd-arm64": "npm:0.25.8"
+    "@esbuild/openbsd-x64": "npm:0.25.8"
+    "@esbuild/openharmony-arm64": "npm:0.25.8"
+    "@esbuild/sunos-x64": "npm:0.25.8"
+    "@esbuild/win32-arm64": "npm:0.25.8"
+    "@esbuild/win32-ia32": "npm:0.25.8"
+    "@esbuild/win32-x64": "npm:0.25.8"
+  dependenciesMeta:
+    "@esbuild/aix-ppc64":
+      optional: true
+    "@esbuild/android-arm":
+      optional: true
+    "@esbuild/android-arm64":
+      optional: true
+    "@esbuild/android-x64":
+      optional: true
+    "@esbuild/darwin-arm64":
+      optional: true
+    "@esbuild/darwin-x64":
+      optional: true
+    "@esbuild/freebsd-arm64":
+      optional: true
+    "@esbuild/freebsd-x64":
+      optional: true
+    "@esbuild/linux-arm":
+      optional: true
+    "@esbuild/linux-arm64":
+      optional: true
+    "@esbuild/linux-ia32":
+      optional: true
+    "@esbuild/linux-loong64":
+      optional: true
+    "@esbuild/linux-mips64el":
+      optional: true
+    "@esbuild/linux-ppc64":
+      optional: true
+    "@esbuild/linux-riscv64":
+      optional: true
+    "@esbuild/linux-s390x":
+      optional: true
+    "@esbuild/linux-x64":
+      optional: true
+    "@esbuild/netbsd-arm64":
+      optional: true
+    "@esbuild/netbsd-x64":
+      optional: true
+    "@esbuild/openbsd-arm64":
+      optional: true
+    "@esbuild/openbsd-x64":
+      optional: true
+    "@esbuild/openharmony-arm64":
+      optional: true
+    "@esbuild/sunos-x64":
+      optional: true
+    "@esbuild/win32-arm64":
+      optional: true
+    "@esbuild/win32-ia32":
+      optional: true
+    "@esbuild/win32-x64":
+      optional: true
+  bin:
+    esbuild: bin/esbuild
+  checksum: 10/9897411732768e652d90fa5dfadae965e8f420d24e5f23fa0604331a1441769e2c7ee4e41ca53e926f1fb51a53af52e01fc9070fdc1a4edf3e9ec9208ee41273
+  languageName: node
+  linkType: hard
+
 "escalade@npm:3.2.0":
   version: 3.2.0
   resolution: "escalade@npm:3.2.0"
@@ -33829,28 +34148,6 @@ __metadata:
   languageName: node
   linkType: hard
 
-"viem@npm:2.x, viem@npm:^2.1.1":
-  version: 2.21.50
-  resolution: "viem@npm:2.21.50"
-  dependencies:
-    "@noble/curves": "npm:1.6.0"
-    "@noble/hashes": "npm:1.5.0"
-    "@scure/bip32": "npm:1.5.0"
-    "@scure/bip39": "npm:1.4.0"
-    abitype: "npm:1.0.6"
-    isows: "npm:1.0.6"
-    ox: "npm:0.1.2"
-    webauthn-p256: "npm:0.0.10"
-    ws: "npm:8.18.0"
-  peerDependencies:
-    typescript: ">=5.0.4"
-  peerDependenciesMeta:
-    typescript:
-      optional: true
-  checksum: 10/6525c7dfa679d48759d50a31751b1d608f055e4396506c4f48550b81655b75b53978bd2dbe39099ac200f549c7429261d3478810dbd63b36df6a0afd77f69931
-  languageName: node
-  linkType: hard
-
 "viem@npm:>=2.23.11, viem@npm:^2.22.21, viem@npm:^2.23.10, viem@npm:^2.24.1":
   version: 2.24.1
   resolution: "viem@npm:2.24.1"
@@ -33872,6 +34169,28 @@ __metadata:
   languageName: node
   linkType: hard
 
+"viem@npm:^2.1.1":
+  version: 2.21.50
+  resolution: "viem@npm:2.21.50"
+  dependencies:
+    "@noble/curves": "npm:1.6.0"
+    "@noble/hashes": "npm:1.5.0"
+    "@scure/bip32": "npm:1.5.0"
+    "@scure/bip39": "npm:1.4.0"
+    abitype: "npm:1.0.6"
+    isows: "npm:1.0.6"
+    ox: "npm:0.1.2"
+    webauthn-p256: "npm:0.0.10"
+    ws: "npm:8.18.0"
+  peerDependencies:
+    typescript: ">=5.0.4"
+  peerDependenciesMeta:
+    typescript:
+      optional: true
+  checksum: 10/6525c7dfa679d48759d50a31751b1d608f055e4396506c4f48550b81655b75b53978bd2dbe39099ac200f549c7429261d3478810dbd63b36df6a0afd77f69931
+  languageName: node
+  linkType: hard
+
 "viem@npm:^2.21.59":
   version: 2.22.17
   resolution: "viem@npm:2.22.17"

From efb2aadc10d903026ce8bef2ae351c1d3c16c8be Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Tue, 5 Aug 2025 13:35:42 +0100
Subject: [PATCH 005/175] chore: changelog

---
 contracts/CHANGELOG.md | 13 ++++++++++++-
 1 file changed, 12 insertions(+), 1 deletion(-)

diff --git a/contracts/CHANGELOG.md b/contracts/CHANGELOG.md
index 2e571aa14..bad94a295 100644
--- a/contracts/CHANGELOG.md
+++ b/contracts/CHANGELOG.md
@@ -4,7 +4,17 @@ All notable changes to this package will be documented in this file.
 
 The format is based on [Common Changelog](https://common-changelog.org/).
 
-## [0.11.0] - 2025-08-01
+## [0.12.0] - 2025-08-05
+
+### Changed
+
+- **Breaking:** Make `viem` a peer dependency, it should be provided by the consuming package ([`4594536`](https://github.com/kleros/kleros-v2/commit/4594536c))
+
+### Added
+
+- Add helper function `getDisputeKitsViem` to retrieve a deployment's available dispute kit infos including their capabilities (`isShutter`, `isGated`) ([`5a81f9e`](https://github.com/kleros/kleros-v2/commit/5a81f9ec))
+
+## [0.11.0] - 2025-08-02
 
 ### Changed
 
@@ -107,6 +117,7 @@ The format is based on [Common Changelog](https://common-changelog.org/).
 
 ## [0.8.1] - 2025-04-10
 
+[0.12.0]: https://github.com/kleros/kleros-v2/releases/tag/@kleros%2Fkleros-v2-contracts@0.12.0
 [0.11.0]: https://github.com/kleros/kleros-v2/releases/tag/@kleros%2Fkleros-v2-contracts@0.11.0
 [0.10.0]: https://github.com/kleros/kleros-v2/releases/tag/@kleros%2Fkleros-v2-contracts@0.10.0
 [0.9.4]: https://github.com/kleros/kleros-v2/releases/tag/@kleros%2Fkleros-v2-contracts@0.9.4

From e3ed3c95030d2f23e6307942020f11521fd60767 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Tue, 5 Aug 2025 14:02:14 +0100
Subject: [PATCH 006/175] chore: published @kleros/kleros-v2-contracts@0.12.0

---
 contracts/package.json | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/contracts/package.json b/contracts/package.json
index 239c1665c..0015dd220 100644
--- a/contracts/package.json
+++ b/contracts/package.json
@@ -1,6 +1,6 @@
 {
   "name": "@kleros/kleros-v2-contracts",
-  "version": "0.11.0",
+  "version": "0.12.0",
   "description": "Smart contracts for Kleros version 2",
   "main": "./cjs/deployments/index.js",
   "module": "./esm/deployments/index.js",

From c99b0c9e702f65f9682956a26ab6baa50fd1730d Mon Sep 17 00:00:00 2001
From: Harman-singh-waraich <Waraichharman68@gmail.com>
Date: Tue, 5 Aug 2025 20:32:54 +0530
Subject: [PATCH 007/175] chore: refactors

---
 web/src/hooks/useTokenAddressValidation.ts  |  7 +------
 web/src/pages/Resolver/Parameters/Court.tsx | 18 +++++++++---------
 2 files changed, 10 insertions(+), 15 deletions(-)

diff --git a/web/src/hooks/useTokenAddressValidation.ts b/web/src/hooks/useTokenAddressValidation.ts
index 10275025b..e3233ef80 100644
--- a/web/src/hooks/useTokenAddressValidation.ts
+++ b/web/src/hooks/useTokenAddressValidation.ts
@@ -141,12 +141,7 @@ const useTokenValidation = ({
     error,
   } = useQuery({
     queryKey: [`${tokenType}-validation`, chainId, debouncedAddress],
-    enabled:
-      enabled &&
-      !isUndefined(publicClient) &&
-      !isUndefined(debouncedAddress) &&
-      debouncedAddress.trim() !== "" &&
-      isValidFormat === true,
+    enabled: enabled && !isUndefined(publicClient) && Boolean(isValidFormat),
     staleTime: 300000, // Cache for 5 minutes
     retry: 1, // Only retry once to fail faster
     retryDelay: 1000, // Short retry delay
diff --git a/web/src/pages/Resolver/Parameters/Court.tsx b/web/src/pages/Resolver/Parameters/Court.tsx
index 805213253..4e0756c19 100644
--- a/web/src/pages/Resolver/Parameters/Court.tsx
+++ b/web/src/pages/Resolver/Parameters/Court.tsx
@@ -112,8 +112,8 @@ const ValidationIcon = styled.div<{ $isValid?: boolean | null; $isValidating?: b
   ${({ $isValidating, $isValid }) => {
     if ($isValidating) {
       return css`
-        border: 2px solid #ccc;
-        border-top-color: #007bff;
+        border: 2px solid ${({ theme }) => theme.stroke};
+        border-top-color: ${({ theme }) => theme.primaryBlue};
         animation: spin 1s linear infinite;
 
         @keyframes spin {
@@ -126,7 +126,7 @@ const ValidationIcon = styled.div<{ $isValid?: boolean | null; $isValidating?: b
 
     if ($isValid === true) {
       return css`
-        background-color: #28a745;
+        background-color: ${({ theme }) => theme.success};
         color: white;
         &::after {
           content: "✓";
@@ -136,7 +136,7 @@ const ValidationIcon = styled.div<{ $isValid?: boolean | null; $isValidating?: b
 
     if ($isValid === false) {
       return css`
-        background-color: #dc3545;
+        background-color: ${({ theme }) => theme.error};
         color: white;
         &::after {
           content: "✗";
@@ -151,7 +151,7 @@ const ValidationIcon = styled.div<{ $isValid?: boolean | null; $isValidating?: b
 `;
 
 const ValidationMessage = styled.small<{ $isError?: boolean }>`
-  color: ${({ $isError }) => ($isError ? "#dc3545" : "#28a745")};
+  color: ${({ $isError, theme }) => ($isError ? theme.error : theme.success)};
   font-size: 14px;
   font-style: italic;
   font-weight: normal;
@@ -159,9 +159,9 @@ const ValidationMessage = styled.small<{ $isError?: boolean }>`
 
 const StyledFieldWithValidation = styled(StyledField)<{ $isValid?: boolean | null }>`
   > input {
-    border-color: ${({ $isValid }) => {
-      if ($isValid === true) return "#28a745";
-      if ($isValid === false) return "#dc3545";
+    border-color: ${({ $isValid, theme }) => {
+      if ($isValid === true) return theme.success;
+      if ($isValid === false) return theme.error;
       return "inherit";
     }};
   }
@@ -327,7 +327,7 @@ const Court: React.FC = () => {
           {tokenGateAddress.trim() !== "" && (
             <ValidationContainer>
               <ValidationIcon $isValidating={isValidating} $isValid={isValidToken} />
-              <ValidationMessage $isError={!!validationError}>
+              <ValidationMessage $isError={Boolean(validationError)}>
                 {isValidating && `Validating ${isERC1155 ? "ERC-1155" : "ERC-20 or ERC-721"} token...`}
                 {validationError && validationError}
                 {isValidToken === true && `Valid ${isERC1155 ? "ERC-1155" : "ERC-20 or ERC-721"} token`}

From 7c74b70f7408570a295c85ae207f66017c1ca05a Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 6 Aug 2025 00:13:57 +0100
Subject: [PATCH 008/175] fix: validation should fail if token gate address is
 empty

---
 web/src/pages/Resolver/NavigationButtons/NextButton.tsx | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/web/src/pages/Resolver/NavigationButtons/NextButton.tsx b/web/src/pages/Resolver/NavigationButtons/NextButton.tsx
index 2530281bd..61d7e9228 100644
--- a/web/src/pages/Resolver/NavigationButtons/NextButton.tsx
+++ b/web/src/pages/Resolver/NavigationButtons/NextButton.tsx
@@ -22,7 +22,7 @@ const NextButton: React.FC<INextButton> = ({ nextRoute }) => {
     if (!disputeData.disputeKitData || disputeData.disputeKitData.type !== "gated") return true;
 
     const gatedData = disputeData.disputeKitData as IGatedDisputeData;
-    if (!gatedData?.tokenGate?.trim()) return true; // No token address provided, so valid
+    if (!gatedData?.tokenGate?.trim()) return false; // No token address provided, so invalid
 
     // If token address is provided, it must be validated as valid ERC20
     return gatedData.isTokenGateValid === true;

From d78e2128efe196213e9ccac10104cbb5322b15cd Mon Sep 17 00:00:00 2001
From: TurbanCoder <51452848+tractorss@users.noreply.github.com>
Date: Wed, 6 Aug 2025 13:09:59 +0530
Subject: [PATCH 009/175] Update web/src/pages/Resolver/Parameters/Court.tsx

Co-authored-by: coderabbitai[bot] <136622811+coderabbitai[bot]@users.noreply.github.com>
---
 web/src/pages/Resolver/Parameters/Court.tsx | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/web/src/pages/Resolver/Parameters/Court.tsx b/web/src/pages/Resolver/Parameters/Court.tsx
index 4e0756c19..b74b22073 100644
--- a/web/src/pages/Resolver/Parameters/Court.tsx
+++ b/web/src/pages/Resolver/Parameters/Court.tsx
@@ -240,7 +240,7 @@ const Court: React.FC = () => {
         });
       }
     }
-  }, [isValidToken, isGatedDisputeKit, disputeData, setDisputeData]);
+  }, [isValidToken, isGatedDisputeKit, disputeData.disputeKitData, setDisputeData]);
 
   const handleCourtChange = (courtId: string) => {
     if (disputeData.courtId !== courtId) {

From 77c85494c78ff3522fb3ebc535c3a562a18a5043 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 7 Aug 2025 13:21:58 +0100
Subject: [PATCH 010/175] chore: enabled Hardhat viaIR compilation with solc
 v0.8.30, bumped hardhat

---
 contracts/hardhat.config.ts |  6 +++---
 contracts/package.json      |  2 +-
 yarn.lock                   | 23 +++++++----------------
 3 files changed, 11 insertions(+), 20 deletions(-)

diff --git a/contracts/hardhat.config.ts b/contracts/hardhat.config.ts
index 75379d0b9..12dcc321f 100644
--- a/contracts/hardhat.config.ts
+++ b/contracts/hardhat.config.ts
@@ -26,9 +26,9 @@ const config: HardhatUserConfig = {
   solidity: {
     compilers: [
       {
-        version: "0.8.28",
+        version: "0.8.30",
         settings: {
-          // viaIR: true,
+          viaIR: true,
           optimizer: {
             enabled: true,
             runs: 100,
@@ -44,7 +44,7 @@ const config: HardhatUserConfig = {
         // For Vea
         version: "0.8.24",
         settings: {
-          // viaIR: true,
+          viaIR: true,
           optimizer: {
             enabled: true,
             runs: 100,
diff --git a/contracts/package.json b/contracts/package.json
index 0015dd220..c255d5639 100644
--- a/contracts/package.json
+++ b/contracts/package.json
@@ -131,7 +131,7 @@
     "gluegun": "^5.2.0",
     "graphql": "^16.9.0",
     "graphql-request": "^7.1.2",
-    "hardhat": "2.25.0",
+    "hardhat": "2.26.2",
     "hardhat-contract-sizer": "^2.10.0",
     "hardhat-deploy": "^1.0.4",
     "hardhat-deploy-ethers": "^0.4.2",
diff --git a/yarn.lock b/yarn.lock
index 0b2eacdf0..e6a9c8cf1 100644
--- a/yarn.lock
+++ b/yarn.lock
@@ -6147,7 +6147,7 @@ __metadata:
     gluegun: "npm:^5.2.0"
     graphql: "npm:^16.9.0"
     graphql-request: "npm:^7.1.2"
-    hardhat: "npm:2.25.0"
+    hardhat: "npm:2.26.2"
     hardhat-contract-sizer: "npm:^2.10.0"
     hardhat-deploy: "npm:^1.0.4"
     hardhat-deploy-ethers: "npm:^0.4.2"
@@ -7655,7 +7655,7 @@ __metadata:
   languageName: node
   linkType: hard
 
-"@nomicfoundation/edr@npm:^0.11.1":
+"@nomicfoundation/edr@npm:^0.11.3":
   version: 0.11.3
   resolution: "@nomicfoundation/edr@npm:0.11.3"
   dependencies:
@@ -10277,13 +10277,6 @@ __metadata:
   languageName: node
   linkType: hard
 
-"@types/lru-cache@npm:^5.1.0":
-  version: 5.1.1
-  resolution: "@types/lru-cache@npm:5.1.1"
-  checksum: 10/0afadefc983306684a8ef95b6337a0d9e3f687e7e89e1f1f3f2e1ce3fbab5b018bb84cf277d781f871175a2c8f0176762b69e58b6f4296ee1b816cea94d5ef06
-  languageName: node
-  linkType: hard
-
 "@types/mdast@npm:^3.0.0":
   version: 3.0.15
   resolution: "@types/mdast@npm:3.0.15"
@@ -20259,17 +20252,15 @@ __metadata:
   languageName: node
   linkType: hard
 
-"hardhat@npm:2.25.0":
-  version: 2.25.0
-  resolution: "hardhat@npm:2.25.0"
+"hardhat@npm:2.26.2":
+  version: 2.26.2
+  resolution: "hardhat@npm:2.26.2"
   dependencies:
     "@ethereumjs/util": "npm:^9.1.0"
     "@ethersproject/abi": "npm:^5.1.2"
-    "@nomicfoundation/edr": "npm:^0.11.1"
+    "@nomicfoundation/edr": "npm:^0.11.3"
     "@nomicfoundation/solidity-analyzer": "npm:^0.1.0"
     "@sentry/node": "npm:^5.18.1"
-    "@types/bn.js": "npm:^5.1.0"
-    "@types/lru-cache": "npm:^5.1.0"
     adm-zip: "npm:^0.4.16"
     aggregate-error: "npm:^3.0.0"
     ansi-escapes: "npm:^4.3.0"
@@ -20314,7 +20305,7 @@ __metadata:
       optional: true
   bin:
     hardhat: internal/cli/bootstrap.js
-  checksum: 10/b74e83cf8b48e782dd9b7db0d640bcd68fe303c9e269686f9aa4ddcdd7b80e1ca932907003fd42fda005f38d486e4e59726b0f38fd8bf0b981e5810abcc907db
+  checksum: 10/ef9f5f232264ed45a406a7053ccce71e67b0ce084de2de6fa2c24ff0bb1ec0d7b69f61769b3ac94a50445709b25bcf0d8ee135e1509e53331a3fea44d01cbb63
   languageName: node
   linkType: hard
 

From e41ee562f40732ede9ab0ff1595544499f777924 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 7 Aug 2025 14:47:07 +0100
Subject: [PATCH 011/175] chore: viaIR compilation enabled for Foundry with
 explicit solc v0.8.30

bumped @kleros/vea-contracts to v0.7.0
---
 contracts/foundry.toml      | 13 +++++++++++--
 contracts/hardhat.config.ts | 18 +-----------------
 contracts/package.json      |  2 +-
 yarn.lock                   | 10 +++++-----
 4 files changed, 18 insertions(+), 25 deletions(-)

diff --git a/contracts/foundry.toml b/contracts/foundry.toml
index a8c6351ec..00b0c68b8 100644
--- a/contracts/foundry.toml
+++ b/contracts/foundry.toml
@@ -1,15 +1,24 @@
 
 [profile.default]
+solc = "0.8.30"
+via_ir = true
+optimizer = true
+optimizer_runs = 500
+optimizer_details = { yulDetails = { stackAllocation = true } }
+additional_compiler_profiles = [
+    { name = "tests", via_ir = false }
+]
+compilation_restrictions = [
+    { paths = "test/foundry/KlerosCore.t.sol", via_ir = false },
+]
 src = 'src'
 out = 'out'
 libs = ['../node_modules', 'lib']
 
 [rpc_endpoints]
 arbitrumSepolia = "https://sepolia-rollup.arbitrum.io/rpc"
-arbitrumGoerli = "https://goerli-rollup.arbitrum.io/rpc"
 arbitrum = "https://arb1.arbitrum.io/rpc"
 sepolia = "https://sepolia.infura.io/v3/${INFURA_API_KEY}"
-goerli = "https://goerli.infura.io/v3/${INFURA_API_KEY}"
 mainnet = "https://mainnet.infura.io/v3/${INFURA_API_KEY}"
 chiado = "https://rpc.chiado.gnosis.gateway.fm"
 gnosischain = "https://rpc.gnosis.gateway.fm"
diff --git a/contracts/hardhat.config.ts b/contracts/hardhat.config.ts
index 12dcc321f..be54c9fcb 100644
--- a/contracts/hardhat.config.ts
+++ b/contracts/hardhat.config.ts
@@ -31,23 +31,7 @@ const config: HardhatUserConfig = {
           viaIR: true,
           optimizer: {
             enabled: true,
-            runs: 100,
-          },
-          outputSelection: {
-            "*": {
-              "*": ["storageLayout"],
-            },
-          },
-        },
-      },
-      {
-        // For Vea
-        version: "0.8.24",
-        settings: {
-          viaIR: true,
-          optimizer: {
-            enabled: true,
-            runs: 100,
+            runs: 10000,
           },
           outputSelection: {
             "*": {
diff --git a/contracts/package.json b/contracts/package.json
index c255d5639..0bca4e700 100644
--- a/contracts/package.json
+++ b/contracts/package.json
@@ -154,7 +154,7 @@
   },
   "dependencies": {
     "@chainlink/contracts": "^1.4.0",
-    "@kleros/vea-contracts": "^0.6.0",
+    "@kleros/vea-contracts": "^0.7.0",
     "@openzeppelin/contracts": "^5.4.0",
     "@shutter-network/shutter-sdk": "0.0.2",
     "isomorphic-fetch": "^3.0.0"
diff --git a/yarn.lock b/yarn.lock
index e6a9c8cf1..c2cb4f2d5 100644
--- a/yarn.lock
+++ b/yarn.lock
@@ -6123,7 +6123,7 @@ __metadata:
     "@kleros/kleros-v2-eslint-config": "workspace:^"
     "@kleros/kleros-v2-prettier-config": "workspace:^"
     "@kleros/kleros-v2-tsconfig": "workspace:^"
-    "@kleros/vea-contracts": "npm:^0.6.0"
+    "@kleros/vea-contracts": "npm:^0.7.0"
     "@logtail/pino": "npm:^0.5.0"
     "@nomicfoundation/hardhat-chai-matchers": "npm:^2.1.0"
     "@nomicfoundation/hardhat-ethers": "npm:^3.1.0"
@@ -6402,10 +6402,10 @@ __metadata:
   languageName: node
   linkType: hard
 
-"@kleros/vea-contracts@npm:^0.6.0":
-  version: 0.6.0
-  resolution: "@kleros/vea-contracts@npm:0.6.0"
-  checksum: 10/1dafd94620d3392c2e00e09e7d1ca923007143f8625b4b584411a7b49404ae5630e870d3e260685964d37ccb9c4c4ab406523b8ec4dd9f89bcf6099a4f5976ec
+"@kleros/vea-contracts@npm:^0.7.0":
+  version: 0.7.0
+  resolution: "@kleros/vea-contracts@npm:0.7.0"
+  checksum: 10/bba12886020cd4bfce39938de56edf2b56472627871ef91b10b721de655e5c20f632a8cb57679927d868375218007898b12033d769b7d33cd3f18447ca093896
   languageName: node
   linkType: hard
 

From 2d94bfdd1710638354e1aa31e2b1c13b822dda0e Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 7 Aug 2025 15:00:09 +0100
Subject: [PATCH 012/175] chore: changelog

---
 contracts/CHANGELOG.md | 10 ++++++++++
 1 file changed, 10 insertions(+)

diff --git a/contracts/CHANGELOG.md b/contracts/CHANGELOG.md
index bad94a295..bfdfafd76 100644
--- a/contracts/CHANGELOG.md
+++ b/contracts/CHANGELOG.md
@@ -4,6 +4,15 @@ All notable changes to this package will be documented in this file.
 
 The format is based on [Common Changelog](https://common-changelog.org/).
 
+## [0.13.0] - 2025-08-07 (Not published yet)
+
+### Changed
+
+- Set the Hardhat Solidity version to v0.8.30 and enable the IR pipeline ([#2069](https://github.com/kleros/kleros-v2/issues/2069))
+- Set the Foundry Solidity version to v0.8.30 and enable the IR pipeline ([#2073](https://github.com/kleros/kleros-v2/issues/2073))
+- Bump `hardhat` to v2.26.2 ([#2069](https://github.com/kleros/kleros-v2/issues/2069))
+- Bump `@kleros/vea-contracts` to v0.7.0 ([#2073](https://github.com/kleros/kleros-v2/issues/2073))
+
 ## [0.12.0] - 2025-08-05
 
 ### Changed
@@ -117,6 +126,7 @@ The format is based on [Common Changelog](https://common-changelog.org/).
 
 ## [0.8.1] - 2025-04-10
 
+[0.13.0]: https://github.com/kleros/kleros-v2/releases/tag/@kleros%2Fkleros-v2-contracts@0.13.0
 [0.12.0]: https://github.com/kleros/kleros-v2/releases/tag/@kleros%2Fkleros-v2-contracts@0.12.0
 [0.11.0]: https://github.com/kleros/kleros-v2/releases/tag/@kleros%2Fkleros-v2-contracts@0.11.0
 [0.10.0]: https://github.com/kleros/kleros-v2/releases/tag/@kleros%2Fkleros-v2-contracts@0.10.0

From bfe11a728bf8791fa3cde72d3b1c7970482c4af3 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 24 Jul 2025 20:54:58 +0200
Subject: [PATCH 013/175] feat: rng fallback

---
 contracts/deploy/00-chainlink-rng.ts          |   2 +
 .../deploy/00-home-chain-arbitration-neo.ts   |  22 +--
 contracts/deploy/00-home-chain-arbitration.ts |  13 +-
 contracts/deploy/00-home-chain-resolver.ts    |   1 -
 contracts/deploy/00-rng.ts                    |  11 +-
 .../deploy/change-sortition-module-rng.ts     |   8 +-
 contracts/src/arbitration/SortitionModule.sol |   8 +-
 .../src/arbitration/SortitionModuleBase.sol   |  26 +--
 .../src/arbitration/SortitionModuleNeo.sol    |   8 +-
 contracts/src/rng/BlockhashRNG.sol            | 122 +++++++++---
 contracts/src/rng/ChainlinkRNG.sol            |  40 ++--
 contracts/src/rng/IRNG.sol                    |  13 ++
 contracts/src/rng/IncrementalNG.sol           |  17 +-
 contracts/src/rng/RNG.sol                     |  14 --
 contracts/src/rng/RNGWithFallback.sol         | 184 ++++++++++++++++++
 contracts/src/rng/RandomizerRNG.sol           |  33 ++--
 .../test/arbitration/dispute-kit-gated.ts     |   7 +-
 contracts/test/arbitration/draw.ts            |   7 +-
 contracts/test/arbitration/staking-neo.ts     |  19 +-
 contracts/test/arbitration/staking.ts         |  21 +-
 contracts/test/foundry/KlerosCore.t.sol       |  86 ++++----
 contracts/test/integration/index.ts           |   5 +-
 contracts/test/proxy/index.ts                 |   2 +-
 contracts/test/rng/index.ts                   | 100 ++++++----
 cspell.json                                   |   1 +
 25 files changed, 503 insertions(+), 267 deletions(-)
 create mode 100644 contracts/src/rng/IRNG.sol
 delete mode 100644 contracts/src/rng/RNG.sol
 create mode 100644 contracts/src/rng/RNGWithFallback.sol

diff --git a/contracts/deploy/00-chainlink-rng.ts b/contracts/deploy/00-chainlink-rng.ts
index 1062fe936..a811f642b 100644
--- a/contracts/deploy/00-chainlink-rng.ts
+++ b/contracts/deploy/00-chainlink-rng.ts
@@ -70,6 +70,8 @@ const deployRng: DeployFunction = async (hre: HardhatRuntimeEnvironment) => {
     ],
     log: true,
   });
+
+  console.log("Register this Chainlink consumer here: http://vrf.chain.link/");
 };
 
 deployRng.tags = ["ChainlinkRNG"];
diff --git a/contracts/deploy/00-home-chain-arbitration-neo.ts b/contracts/deploy/00-home-chain-arbitration-neo.ts
index 45a6a7d15..8d291d570 100644
--- a/contracts/deploy/00-home-chain-arbitration-neo.ts
+++ b/contracts/deploy/00-home-chain-arbitration-neo.ts
@@ -12,7 +12,6 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
   const { ethers, deployments, getNamedAccounts, getChainId } = hre;
   const { deploy } = deployments;
   const { ZeroAddress } = hre.ethers;
-  const RNG_LOOKAHEAD = 20;
 
   // fallback to hardhat node signers on local network
   const deployer = (await getNamedAccounts()).deployer ?? (await hre.ethers.getSigners())[0].address;
@@ -50,16 +49,7 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
   const maxTotalStaked = PNK(2_000_000);
   const sortitionModule = await deployUpgradable(deployments, "SortitionModuleNeo", {
     from: deployer,
-    args: [
-      deployer,
-      klerosCoreAddress,
-      minStakingTime,
-      maxFreezingTime,
-      rng.target,
-      RNG_LOOKAHEAD,
-      maxStakePerJuror,
-      maxTotalStaked,
-    ],
+    args: [deployer, klerosCoreAddress, minStakingTime, maxFreezingTime, rng.target, maxStakePerJuror, maxTotalStaked],
     log: true,
   }); // nonce (implementation), nonce+1 (proxy)
 
@@ -94,11 +84,11 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
     await disputeKitContract.changeCore(klerosCore.address);
   }
 
-  // rng.changeSortitionModule() only if necessary
-  const rngSortitionModule = await rng.sortitionModule();
-  if (rngSortitionModule !== sortitionModule.address) {
-    console.log(`rng.changeSortitionModule(${sortitionModule.address})`);
-    await rng.changeSortitionModule(sortitionModule.address);
+  // rng.changeConsumer() only if necessary
+  const rngConsumer = await rng.consumer();
+  if (rngConsumer !== sortitionModule.address) {
+    console.log(`rng.changeConsumer(${sortitionModule.address})`);
+    await rng.changeConsumer(sortitionModule.address);
   }
 
   const core = (await hre.ethers.getContract("KlerosCoreNeo")) as KlerosCoreNeo;
diff --git a/contracts/deploy/00-home-chain-arbitration.ts b/contracts/deploy/00-home-chain-arbitration.ts
index c22a1b960..80e1bd506 100644
--- a/contracts/deploy/00-home-chain-arbitration.ts
+++ b/contracts/deploy/00-home-chain-arbitration.ts
@@ -12,7 +12,6 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
   const { ethers, deployments, getNamedAccounts, getChainId } = hre;
   const { deploy } = deployments;
   const { ZeroAddress } = hre.ethers;
-  const RNG_LOOKAHEAD = 20;
 
   // fallback to hardhat node signers on local network
   const deployer = (await getNamedAccounts()).deployer ?? (await hre.ethers.getSigners())[0].address;
@@ -53,7 +52,7 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
   const rng = (await ethers.getContract("ChainlinkRNG")) as ChainlinkRNG;
   const sortitionModule = await deployUpgradable(deployments, "SortitionModule", {
     from: deployer,
-    args: [deployer, klerosCoreAddress, minStakingTime, maxFreezingTime, rng.target, RNG_LOOKAHEAD],
+    args: [deployer, klerosCoreAddress, minStakingTime, maxFreezingTime, rng.target],
     log: true,
   }); // nonce (implementation), nonce+1 (proxy)
 
@@ -87,11 +86,11 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
     await disputeKitContract.changeCore(klerosCore.address);
   }
 
-  // rng.changeSortitionModule() only if necessary
-  const rngSortitionModule = await rng.sortitionModule();
-  if (rngSortitionModule !== sortitionModule.address) {
-    console.log(`rng.changeSortitionModule(${sortitionModule.address})`);
-    await rng.changeSortitionModule(sortitionModule.address);
+  // rng.changeConsumer() only if necessary
+  const rngConsumer = await rng.consumer();
+  if (rngConsumer !== sortitionModule.address) {
+    console.log(`rng.changeConsumer(${sortitionModule.address})`);
+    await rng.changeConsumer(sortitionModule.address);
   }
 
   const core = (await hre.ethers.getContract("KlerosCore")) as KlerosCore;
diff --git a/contracts/deploy/00-home-chain-resolver.ts b/contracts/deploy/00-home-chain-resolver.ts
index d7d2186ef..5aa5e7b20 100644
--- a/contracts/deploy/00-home-chain-resolver.ts
+++ b/contracts/deploy/00-home-chain-resolver.ts
@@ -1,7 +1,6 @@
 import { HardhatRuntimeEnvironment } from "hardhat/types";
 import { DeployFunction } from "hardhat-deploy/types";
 import { HomeChains, isSkipped } from "./utils";
-import { deployUpgradable } from "./utils/deployUpgradable";
 
 const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment) => {
   const { deployments, getNamedAccounts, getChainId } = hre;
diff --git a/contracts/deploy/00-rng.ts b/contracts/deploy/00-rng.ts
index 2489406c1..5eedf19b2 100644
--- a/contracts/deploy/00-rng.ts
+++ b/contracts/deploy/00-rng.ts
@@ -2,13 +2,12 @@ import { HardhatRuntimeEnvironment } from "hardhat/types";
 import { DeployFunction } from "hardhat-deploy/types";
 import { SortitionModule } from "../typechain-types";
 import { HomeChains, isMainnet, isSkipped } from "./utils";
-import { deployUpgradable } from "./utils/deployUpgradable";
 import { getContractOrDeploy } from "./utils/getContractOrDeploy";
 
 const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment) => {
   const { deployments, getNamedAccounts, getChainId, ethers } = hre;
   const { deploy } = deployments;
-  const RNG_LOOKAHEAD = 20;
+  const RNG_LOOKAHEAD_TIME = 30 * 60; // 30 minutes in seconds
 
   // fallback to hardhat node signers on local network
   const deployer = (await getNamedAccounts()).deployer ?? (await hre.ethers.getSigners())[0].address;
@@ -32,11 +31,15 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
 
   const rng2 = await deploy("BlockHashRNG", {
     from: deployer,
-    args: [],
+    args: [
+      deployer, // governor
+      sortitionModule.target, // consumer
+      RNG_LOOKAHEAD_TIME,
+    ],
     log: true,
   });
 
-  await sortitionModule.changeRandomNumberGenerator(rng2.address, RNG_LOOKAHEAD);
+  await sortitionModule.changeRandomNumberGenerator(rng2.address);
 };
 
 deployArbitration.tags = ["RNG"];
diff --git a/contracts/deploy/change-sortition-module-rng.ts b/contracts/deploy/change-sortition-module-rng.ts
index a9573e6be..2b5e72435 100644
--- a/contracts/deploy/change-sortition-module-rng.ts
+++ b/contracts/deploy/change-sortition-module-rng.ts
@@ -23,11 +23,11 @@ const task: DeployFunction = async (hre: HardhatRuntimeEnvironment) => {
     sortitionModule = await ethers.getContract<SortitionModule>("SortitionModule");
   }
 
-  console.log(`chainlinkRng.changeSortitionModule(${sortitionModule.target})`);
-  await chainlinkRng.changeSortitionModule(sortitionModule.target);
+  console.log(`chainlinkRng.changeConsumer(${sortitionModule.target})`);
+  await chainlinkRng.changeConsumer(sortitionModule.target);
 
-  console.log(`sortitionModule.changeRandomNumberGenerator(${chainlinkRng.target}, 0)`);
-  await sortitionModule.changeRandomNumberGenerator(chainlinkRng.target, 0);
+  console.log(`sortitionModule.changeRandomNumberGenerator(${chainlinkRng.target})`);
+  await sortitionModule.changeRandomNumberGenerator(chainlinkRng.target);
 };
 
 task.tags = ["ChangeSortitionModuleRNG"];
diff --git a/contracts/src/arbitration/SortitionModule.sol b/contracts/src/arbitration/SortitionModule.sol
index cb4f14c58..7e881264b 100644
--- a/contracts/src/arbitration/SortitionModule.sol
+++ b/contracts/src/arbitration/SortitionModule.sol
@@ -2,7 +2,7 @@
 
 pragma solidity ^0.8.24;
 
-import {SortitionModuleBase, KlerosCore, RNG} from "./SortitionModuleBase.sol";
+import {SortitionModuleBase, KlerosCore, IRNG} from "./SortitionModuleBase.sol";
 
 /// @title SortitionModule
 /// @dev A factory of trees that keeps track of staked values for sortition.
@@ -24,16 +24,14 @@ contract SortitionModule is SortitionModuleBase {
     /// @param _minStakingTime Minimal time to stake
     /// @param _maxDrawingTime Time after which the drawing phase can be switched
     /// @param _rng The random number generator.
-    /// @param _rngLookahead Lookahead value for rng.
     function initialize(
         address _governor,
         KlerosCore _core,
         uint256 _minStakingTime,
         uint256 _maxDrawingTime,
-        RNG _rng,
-        uint256 _rngLookahead
+        IRNG _rng
     ) external reinitializer(1) {
-        __SortitionModuleBase_initialize(_governor, _core, _minStakingTime, _maxDrawingTime, _rng, _rngLookahead);
+        __SortitionModuleBase_initialize(_governor, _core, _minStakingTime, _maxDrawingTime, _rng);
     }
 
     function initialize4() external reinitializer(4) {
diff --git a/contracts/src/arbitration/SortitionModuleBase.sol b/contracts/src/arbitration/SortitionModuleBase.sol
index 577d9fd22..c554c9c9c 100644
--- a/contracts/src/arbitration/SortitionModuleBase.sol
+++ b/contracts/src/arbitration/SortitionModuleBase.sol
@@ -7,7 +7,7 @@ import {ISortitionModule} from "./interfaces/ISortitionModule.sol";
 import {IDisputeKit} from "./interfaces/IDisputeKit.sol";
 import {Initializable} from "../proxy/Initializable.sol";
 import {UUPSProxiable} from "../proxy/UUPSProxiable.sol";
-import {RNG} from "../rng/RNG.sol";
+import {IRNG} from "../rng/IRNG.sol";
 import "../libraries/Constants.sol";
 
 /// @title SortitionModuleBase
@@ -50,11 +50,9 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
     uint256 public minStakingTime; // The time after which the phase can be switched to Drawing if there are open disputes.
     uint256 public maxDrawingTime; // The time after which the phase can be switched back to Staking.
     uint256 public lastPhaseChange; // The last time the phase was changed.
-    uint256 public randomNumberRequestBlock; // Number of the block when RNG request was made.
     uint256 public disputesWithoutJurors; // The number of disputes that have not finished drawing jurors.
-    RNG public rng; // The random number generator.
+    IRNG public rng; // The random number generator.
     uint256 public randomNumber; // Random number returned by RNG.
-    uint256 public rngLookahead; // Minimal block distance between requesting and obtaining a random number.
     uint256 public delayedStakeWriteIndex; // The index of the last `delayedStake` item that was written to the array. 0 index is skipped.
     uint256 public delayedStakeReadIndex; // The index of the next `delayedStake` item that should be processed. Starts at 1 because 0 index is skipped.
     mapping(bytes32 treeHash => SortitionSumTree) sortitionSumTrees; // The mapping trees by keys.
@@ -104,8 +102,7 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
         KlerosCore _core,
         uint256 _minStakingTime,
         uint256 _maxDrawingTime,
-        RNG _rng,
-        uint256 _rngLookahead
+        IRNG _rng
     ) internal onlyInitializing {
         governor = _governor;
         core = _core;
@@ -113,7 +110,6 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
         maxDrawingTime = _maxDrawingTime;
         lastPhaseChange = block.timestamp;
         rng = _rng;
-        rngLookahead = _rngLookahead;
         delayedStakeReadIndex = 1;
     }
 
@@ -153,15 +149,12 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
         maxDrawingTime = _maxDrawingTime;
     }
 
-    /// @dev Changes the `_rng` and `_rngLookahead` storage variables.
-    /// @param _rng The new value for the `RNGenerator` storage variable.
-    /// @param _rngLookahead The new value for the `rngLookahead` storage variable.
-    function changeRandomNumberGenerator(RNG _rng, uint256 _rngLookahead) external onlyByGovernor {
+    /// @dev Changes the `rng` storage variable.
+    /// @param _rng The new random number generator.
+    function changeRandomNumberGenerator(IRNG _rng) external onlyByGovernor {
         rng = _rng;
-        rngLookahead = _rngLookahead;
         if (phase == Phase.generating) {
-            rng.requestRandomness(block.number + rngLookahead);
-            randomNumberRequestBlock = block.number;
+            rng.requestRandomness();
         }
     }
 
@@ -176,11 +169,10 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
                 "The minimum staking time has not passed yet."
             );
             require(disputesWithoutJurors > 0, "There are no disputes that need jurors.");
-            rng.requestRandomness(block.number + rngLookahead);
-            randomNumberRequestBlock = block.number;
+            rng.requestRandomness();
             phase = Phase.generating;
         } else if (phase == Phase.generating) {
-            randomNumber = rng.receiveRandomness(randomNumberRequestBlock + rngLookahead);
+            randomNumber = rng.receiveRandomness();
             require(randomNumber != 0, "Random number is not ready yet");
             phase = Phase.drawing;
         } else if (phase == Phase.drawing) {
diff --git a/contracts/src/arbitration/SortitionModuleNeo.sol b/contracts/src/arbitration/SortitionModuleNeo.sol
index b966c9379..9758882fe 100644
--- a/contracts/src/arbitration/SortitionModuleNeo.sol
+++ b/contracts/src/arbitration/SortitionModuleNeo.sol
@@ -2,7 +2,7 @@
 
 pragma solidity ^0.8.24;
 
-import {SortitionModuleBase, KlerosCore, RNG, StakingResult} from "./SortitionModuleBase.sol";
+import {SortitionModuleBase, KlerosCore, IRNG, StakingResult} from "./SortitionModuleBase.sol";
 
 /// @title SortitionModuleNeo
 /// @dev A factory of trees that keeps track of staked values for sortition.
@@ -32,7 +32,6 @@ contract SortitionModuleNeo is SortitionModuleBase {
     /// @param _minStakingTime Minimal time to stake
     /// @param _maxDrawingTime Time after which the drawing phase can be switched
     /// @param _rng The random number generator.
-    /// @param _rngLookahead Lookahead value for rng.
     /// @param _maxStakePerJuror The maximum amount of PNK a juror can stake in a court.
     /// @param _maxTotalStaked The maximum amount of PNK that can be staked in all courts.
     function initialize(
@@ -40,12 +39,11 @@ contract SortitionModuleNeo is SortitionModuleBase {
         KlerosCore _core,
         uint256 _minStakingTime,
         uint256 _maxDrawingTime,
-        RNG _rng,
-        uint256 _rngLookahead,
+        IRNG _rng,
         uint256 _maxStakePerJuror,
         uint256 _maxTotalStaked
     ) external reinitializer(2) {
-        __SortitionModuleBase_initialize(_governor, _core, _minStakingTime, _maxDrawingTime, _rng, _rngLookahead);
+        __SortitionModuleBase_initialize(_governor, _core, _minStakingTime, _maxDrawingTime, _rng);
         maxStakePerJuror = _maxStakePerJuror;
         maxTotalStaked = _maxTotalStaked;
     }
diff --git a/contracts/src/rng/BlockhashRNG.sol b/contracts/src/rng/BlockhashRNG.sol
index 4421b4301..8568de34e 100644
--- a/contracts/src/rng/BlockhashRNG.sol
+++ b/contracts/src/rng/BlockhashRNG.sol
@@ -2,43 +2,119 @@
 
 pragma solidity ^0.8.24;
 
-import "./RNG.sol";
+import "./IRNG.sol";
 
 /// @title Random Number Generator using blockhash with fallback.
-/// @author Clément Lesaege - <clement@lesaege.com>
 /// @dev
 ///  Random Number Generator returning the blockhash with a fallback behaviour.
-///  In case no one called it within the 256 blocks, it returns the previous blockhash.
-///  This contract must be used when returning 0 is a worse failure mode than returning another blockhash.
-///  Allows saving the random number for use in the future. It allows the contract to still access the blockhash even after 256 blocks.
-contract BlockHashRNG is RNG {
-    mapping(uint256 block => uint256 number) public randomNumbers; // randomNumbers[block] is the random number for this block, 0 otherwise.
+///  On L2 like Arbitrum block production is sporadic so block timestamp is more reliable than block number.
+///  Returns 0 when no random number is available.
+///  Allows saving the random number for use in the future. It allows the contract to retrieve the blockhash even after the time window.
+contract BlockHashRNG is IRNG {
+    // ************************************* //
+    // *             Storage               * //
+    // ************************************* //
+
+    address public governor; // The address that can withdraw funds.
+    address public consumer; // The address that can request random numbers.
+    uint256 public immutable lookaheadTime; // Minimal time in seconds between requesting and obtaining a random number.
+    uint256 public requestTimestamp; // Timestamp of the current request
+    mapping(uint256 timestamp => uint256 number) public randomNumbers; // randomNumbers[timestamp] is the random number for this timestamp, 0 otherwise.
+
+    // ************************************* //
+    // *        Function Modifiers         * //
+    // ************************************* //
+
+    modifier onlyByGovernor() {
+        require(governor == msg.sender, "Governor only");
+        _;
+    }
+
+    modifier onlyByConsumer() {
+        require(consumer == msg.sender, "Consumer only");
+        _;
+    }
+
+    // ************************************* //
+    // *            Constructor            * //
+    // ************************************* //
+
+    /// @dev Constructor.
+    /// @param _governor The Governor of the contract.
+    /// @param _consumer The address that can request random numbers.
+    /// @param _lookaheadTime The time lookahead in seconds for the random number.
+    constructor(address _governor, address _consumer, uint256 _lookaheadTime) {
+        governor = _governor;
+        consumer = _consumer;
+        lookaheadTime = _lookaheadTime;
+    }
+
+    // ************************************* //
+    // *             Governance            * //
+    // ************************************* //
+
+    /// @dev Changes the governor of the contract.
+    /// @param _governor The new governor.
+    function changeGovernor(address _governor) external onlyByGovernor {
+        governor = _governor;
+    }
+
+    /// @dev Changes the consumer of the RNG.
+    /// @param _consumer The new consumer.
+    function changeConsumer(address _consumer) external onlyByGovernor {
+        consumer = _consumer;
+    }
+
+    // ************************************* //
+    // *         State Modifiers           * //
+    // ************************************* //
 
     /// @dev Request a random number.
-    /// @param _block Block the random number is linked to.
-    function requestRandomness(uint256 _block) external override {
-        // nop
+    function requestRandomness() external override onlyByConsumer {
+        requestTimestamp = block.timestamp;
     }
 
     /// @dev Return the random number. If it has not been saved and is still computable compute it.
-    /// @param _block Block the random number is linked to.
     /// @return randomNumber The random number or 0 if it is not ready or has not been requested.
-    function receiveRandomness(uint256 _block) external override returns (uint256 randomNumber) {
-        randomNumber = randomNumbers[_block];
+    function receiveRandomness() external override onlyByConsumer returns (uint256 randomNumber) {
+        if (requestTimestamp == 0) return 0; // No request made
+
+        uint256 expectedTimestamp = requestTimestamp + lookaheadTime;
+
+        // Check if enough time has passed
+        if (block.timestamp < expectedTimestamp) {
+            return 0; // Not ready yet
+        }
+
+        // Check if we already have a saved random number for this timestamp window
+        randomNumber = randomNumbers[expectedTimestamp];
         if (randomNumber != 0) {
             return randomNumber;
         }
 
-        if (_block < block.number) {
-            // The random number is not already set and can be.
-            if (blockhash(_block) != 0x0) {
-                // Normal case.
-                randomNumber = uint256(blockhash(_block));
-            } else {
-                // The contract was not called in time. Fallback to returning previous blockhash.
-                randomNumber = uint256(blockhash(block.number - 1));
-            }
+        // Use last block hash for randomness
+        randomNumber = uint256(blockhash(block.number - 1));
+        if (randomNumber != 0) {
+            randomNumbers[expectedTimestamp] = randomNumber;
         }
-        randomNumbers[_block] = randomNumber;
+        return randomNumber;
+    }
+
+    // ************************************* //
+    // *             View Functions        * //
+    // ************************************* //
+
+    /// @dev Check if randomness is ready to be received.
+    /// @return ready True if randomness can be received.
+    function isRandomnessReady() external view returns (bool ready) {
+        if (requestTimestamp == 0) return false;
+        return block.timestamp >= requestTimestamp + lookaheadTime;
+    }
+
+    /// @dev Get the timestamp when randomness will be ready.
+    /// @return readyTimestamp The timestamp when randomness will be available.
+    function getRandomnessReadyTimestamp() external view returns (uint256 readyTimestamp) {
+        if (requestTimestamp == 0) return 0;
+        return requestTimestamp + lookaheadTime;
     }
 }
diff --git a/contracts/src/rng/ChainlinkRNG.sol b/contracts/src/rng/ChainlinkRNG.sol
index b829177c3..fe5a9ff19 100644
--- a/contracts/src/rng/ChainlinkRNG.sol
+++ b/contracts/src/rng/ChainlinkRNG.sol
@@ -5,17 +5,17 @@ pragma solidity ^0.8.24;
 import {VRFConsumerBaseV2Plus, IVRFCoordinatorV2Plus} from "@chainlink/contracts/src/v0.8/vrf/dev/VRFConsumerBaseV2Plus.sol";
 import {VRFV2PlusClient} from "@chainlink/contracts/src/v0.8/vrf/dev/libraries/VRFV2PlusClient.sol";
 
-import "./RNG.sol";
+import "./IRNG.sol";
 
 /// @title Random Number Generator that uses Chainlink VRF v2.5
 /// https://blog.chain.link/introducing-vrf-v2-5/
-contract ChainlinkRNG is RNG, VRFConsumerBaseV2Plus {
+contract ChainlinkRNG is IRNG, VRFConsumerBaseV2Plus {
     // ************************************* //
     // *             Storage               * //
     // ************************************* //
 
     address public governor; // The address that can withdraw funds.
-    address public sortitionModule; // The address of the SortitionModule.
+    address public consumer; // The address that can request random numbers.
     bytes32 public keyHash; // The gas lane key hash value - Defines the maximum gas price you are willing to pay for a request in wei (ID of the off-chain VRF job).
     uint256 public subscriptionId; // The unique identifier of the subscription used for funding requests.
     uint16 public requestConfirmations; // How many confirmations the Chainlink node should wait before responding.
@@ -29,13 +29,13 @@ contract ChainlinkRNG is RNG, VRFConsumerBaseV2Plus {
     // ************************************* //
 
     /// @dev Emitted when a request is sent to the VRF Coordinator
-    /// @param requestId The ID of the request
-    event RequestSent(uint256 indexed requestId);
+    /// @param _requestId The ID of the request
+    event RequestSent(uint256 indexed _requestId);
 
     /// Emitted when a request has been fulfilled.
-    /// @param requestId The ID of the request
-    /// @param randomWord The random value answering the request.
-    event RequestFulfilled(uint256 indexed requestId, uint256 randomWord);
+    /// @param _requestId The ID of the request
+    /// @param _randomWord The random value answering the request.
+    event RequestFulfilled(uint256 indexed _requestId, uint256 _randomWord);
 
     // ************************************* //
     // *        Function Modifiers         * //
@@ -46,8 +46,8 @@ contract ChainlinkRNG is RNG, VRFConsumerBaseV2Plus {
         _;
     }
 
-    modifier onlyBySortitionModule() {
-        require(sortitionModule == msg.sender, "SortitionModule only");
+    modifier onlyByConsumer() {
+        require(consumer == msg.sender, "Consumer only");
         _;
     }
 
@@ -57,7 +57,7 @@ contract ChainlinkRNG is RNG, VRFConsumerBaseV2Plus {
 
     /// @dev Constructor, initializing the implementation to reduce attack surface.
     /// @param _governor The Governor of the contract.
-    /// @param _sortitionModule The address of the SortitionModule contract.
+    /// @param _consumer The address that can request random numbers.
     /// @param _vrfCoordinator The address of the VRFCoordinator contract.
     /// @param _keyHash The gas lane key hash value - Defines the maximum gas price you are willing to pay for a request in wei (ID of the off-chain VRF job).
     /// @param _subscriptionId The unique identifier of the subscription used for funding requests.
@@ -66,7 +66,7 @@ contract ChainlinkRNG is RNG, VRFConsumerBaseV2Plus {
     /// @dev https://docs.chain.link/vrf/v2-5/subscription/get-a-random-number
     constructor(
         address _governor,
-        address _sortitionModule,
+        address _consumer,
         address _vrfCoordinator,
         bytes32 _keyHash,
         uint256 _subscriptionId,
@@ -74,7 +74,7 @@ contract ChainlinkRNG is RNG, VRFConsumerBaseV2Plus {
         uint32 _callbackGasLimit
     ) VRFConsumerBaseV2Plus(_vrfCoordinator) {
         governor = _governor;
-        sortitionModule = _sortitionModule;
+        consumer = _consumer;
         keyHash = _keyHash;
         subscriptionId = _subscriptionId;
         requestConfirmations = _requestConfirmations;
@@ -91,10 +91,10 @@ contract ChainlinkRNG is RNG, VRFConsumerBaseV2Plus {
         governor = _governor;
     }
 
-    /// @dev Changes the sortition module of the contract.
-    /// @param _sortitionModule The new sortition module.
-    function changeSortitionModule(address _sortitionModule) external onlyByGovernor {
-        sortitionModule = _sortitionModule;
+    /// @dev Changes the consumer of the RNG.
+    /// @param _consumer The new consumer.
+    function changeConsumer(address _consumer) external onlyByGovernor {
+        consumer = _consumer;
     }
 
     /// @dev Changes the VRF Coordinator of the contract.
@@ -132,8 +132,8 @@ contract ChainlinkRNG is RNG, VRFConsumerBaseV2Plus {
     // *         State Modifiers           * //
     // ************************************* //
 
-    /// @dev Request a random number. SortitionModule only.
-    function requestRandomness(uint256 /*_block*/) external override onlyBySortitionModule {
+    /// @dev Request a random number. Consumer only.
+    function requestRandomness() external override onlyByConsumer {
         // Will revert if subscription is not set and funded.
         uint256 requestId = s_vrfCoordinator.requestRandomWords(
             VRFV2PlusClient.RandomWordsRequest({
@@ -167,7 +167,7 @@ contract ChainlinkRNG is RNG, VRFConsumerBaseV2Plus {
 
     /// @dev Return the random number.
     /// @return randomNumber The random number or 0 if it is not ready or has not been requested.
-    function receiveRandomness(uint256 /*_block*/) external view override returns (uint256 randomNumber) {
+    function receiveRandomness() external view override returns (uint256 randomNumber) {
         randomNumber = randomNumbers[lastRequestId];
     }
 }
diff --git a/contracts/src/rng/IRNG.sol b/contracts/src/rng/IRNG.sol
new file mode 100644
index 000000000..a561029a2
--- /dev/null
+++ b/contracts/src/rng/IRNG.sol
@@ -0,0 +1,13 @@
+// SPDX-License-Identifier: MIT
+
+pragma solidity ^0.8.24;
+
+/// @title Random Number Generator interface
+interface IRNG {
+    /// @dev Request a random number.
+    function requestRandomness() external;
+
+    /// @dev Receive the random number.
+    /// @return randomNumber Random Number. If the number is not ready or has not been required 0 instead.
+    function receiveRandomness() external returns (uint256 randomNumber);
+}
diff --git a/contracts/src/rng/IncrementalNG.sol b/contracts/src/rng/IncrementalNG.sol
index aa4b7d840..542090e71 100644
--- a/contracts/src/rng/IncrementalNG.sol
+++ b/contracts/src/rng/IncrementalNG.sol
@@ -1,13 +1,12 @@
 // SPDX-License-Identifier: MIT
 
-/// @title Incremental Number Generator
-/// @author JayBuidl <jb@kleros.io>
-/// @dev A Random Number Generator which returns a number incremented by 1 each time. Useful as a fallback method.
-
 pragma solidity ^0.8.24;
-import "./RNG.sol";
+import "./IRNG.sol";
 
-contract IncrementalNG is RNG {
+/// @title Incremental Number Generator
+/// @dev A Random Number Generator which returns a number incremented by 1 each time.
+/// For testing purposes.
+contract IncrementalNG is IRNG {
     uint256 public number;
 
     constructor(uint256 _start) {
@@ -15,15 +14,13 @@ contract IncrementalNG is RNG {
     }
 
     /// @dev Request a random number.
-    /// @param _block Block the random number is linked to.
-    function requestRandomness(uint256 _block) external override {
+    function requestRandomness() external override {
         // nop
     }
 
     /// @dev Get the "random number" (which is always the same).
-    /// @param _block Block the random number is linked to.
     /// @return randomNumber The random number or 0 if it is not ready or has not been requested.
-    function receiveRandomness(uint256 _block) external override returns (uint256 randomNumber) {
+    function receiveRandomness() external override returns (uint256 randomNumber) {
         unchecked {
             return number++;
         }
diff --git a/contracts/src/rng/RNG.sol b/contracts/src/rng/RNG.sol
deleted file mode 100644
index 5142aa0e5..000000000
--- a/contracts/src/rng/RNG.sol
+++ /dev/null
@@ -1,14 +0,0 @@
-// SPDX-License-Identifier: MIT
-
-pragma solidity ^0.8.24;
-
-interface RNG {
-    /// @dev Request a random number.
-    /// @param _block Block linked to the request.
-    function requestRandomness(uint256 _block) external;
-
-    /// @dev Receive the random number.
-    /// @param _block Block the random number is linked to.
-    /// @return randomNumber Random Number. If the number is not ready or has not been required 0 instead.
-    function receiveRandomness(uint256 _block) external returns (uint256 randomNumber);
-}
diff --git a/contracts/src/rng/RNGWithFallback.sol b/contracts/src/rng/RNGWithFallback.sol
new file mode 100644
index 000000000..94c2b0e03
--- /dev/null
+++ b/contracts/src/rng/RNGWithFallback.sol
@@ -0,0 +1,184 @@
+// SPDX-License-Identifier: MIT
+pragma solidity ^0.8.24;
+
+import "./IRNG.sol";
+
+/// @title RNG with fallback mechanism
+/// @notice Uses multiple RNG implementations with automatic fallback if default RNG does not respond passed a timeout.
+contract RNGWithFallback is IRNG {
+    uint256 public constant DEFAULT_RNG = 0;
+
+    // ************************************* //
+    // *             Storage               * //
+    // ************************************* //
+
+    address public governor; // Governor address
+    address public consumer; // Consumer address
+    IRNG[] public rngs; // List of RNG implementations
+    uint256 public fallbackTimeoutSeconds; // Time in seconds to wait before falling back to next RNG
+    uint256 public requestTimestamp; // Timestamp of the current request
+    uint256 public currentRngIndex; // Index of the current RNG
+    bool public isRequesting; // Whether a request is in progress
+
+    // ************************************* //
+    // *              Events               * //
+    // ************************************* //
+
+    event RNGDefaultChanged(address indexed _newDefaultRng);
+    event RNGFallback(uint256 _fromIndex, uint256 _toIndex);
+    event RNGFailure();
+    event RNGFallbackAdded(address indexed _rng);
+    event RNGFallbackRemoved(address indexed _rng);
+    event FallbackTimeoutChanged(uint256 _newTimeout);
+
+    // ************************************* //
+    // *            Constructor            * //
+    // ************************************* //
+
+    /// @param _governor Governor address
+    /// @param _consumer Consumer address
+    /// @param _fallbackTimeoutSeconds Time in seconds to wait before falling back to next RNG
+    /// @param _defaultRng The default RNG
+    constructor(address _governor, address _consumer, uint256 _fallbackTimeoutSeconds, IRNG _defaultRng) {
+        require(address(_defaultRng) != address(0), "Invalid default RNG");
+
+        governor = _governor;
+        consumer = _consumer;
+        fallbackTimeoutSeconds = _fallbackTimeoutSeconds;
+        rngs.push(_defaultRng);
+    }
+
+    // ************************************* //
+    // *        Function Modifiers         * //
+    // ************************************* //
+
+    modifier onlyByGovernor() {
+        require(msg.sender == governor, "Governor only");
+        _;
+    }
+
+    modifier onlyByConsumer() {
+        require(msg.sender == consumer, "Consumer only");
+        _;
+    }
+
+    // ************************************* //
+    // *         State Modifiers          * //
+    // ************************************* //
+
+    /// @dev Request a random number from the default RNG
+    function requestRandomness() external override onlyByConsumer {
+        require(!isRequesting, "Request already in progress");
+        _requestRandomness(DEFAULT_RNG);
+    }
+
+    function _requestRandomness(uint256 _rngIndex) internal {
+        isRequesting = true;
+        requestTimestamp = block.timestamp;
+        currentRngIndex = _rngIndex;
+        rngs[_rngIndex].requestRandomness();
+    }
+
+    /// @dev Receive the random number with fallback logic
+    /// @return randomNumber Random Number
+    function receiveRandomness() external override onlyByConsumer returns (uint256 randomNumber) {
+        // Try to get random number from current RNG
+        randomNumber = rngs[currentRngIndex].receiveRandomness();
+
+        // If we got a valid number, clear the request
+        if (randomNumber != 0) {
+            isRequesting = false;
+            return randomNumber;
+        }
+
+        // If the timeout is exceeded, try next RNG
+        if (block.timestamp > requestTimestamp + fallbackTimeoutSeconds) {
+            uint256 nextIndex = currentRngIndex + 1;
+
+            // If we have another RNG to try, switch to it and request again
+            if (nextIndex < rngs.length) {
+                emit RNGFallback(currentRngIndex, nextIndex);
+                currentRngIndex = nextIndex;
+                _requestRandomness(nextIndex);
+            } else {
+                // No more RNGs to try
+                emit RNGFailure();
+            }
+        }
+        return randomNumber;
+    }
+
+    // ************************************* //
+    // *         Governance Functions      * //
+    // ************************************* //
+
+    /// @dev Change the governor
+    /// @param _newGovernor Address of the new governor
+    function changeGovernor(address _newGovernor) external onlyByGovernor {
+        governor = _newGovernor;
+    }
+
+    /// @dev Change the consumer
+    /// @param _consumer Address of the new consumer
+    function changeConsumer(address _consumer) external onlyByGovernor {
+        consumer = _consumer;
+    }
+
+    /// @dev Change the default RNG
+    /// @param _newDefaultRng Address of the new default RNG
+    function changeDefaultRng(IRNG _newDefaultRng) external onlyByGovernor {
+        require(address(_newDefaultRng) != address(0), "Invalid RNG");
+        rngs[DEFAULT_RNG] = _newDefaultRng;
+        emit RNGDefaultChanged(address(_newDefaultRng));
+
+        // Take over any pending request
+        _requestRandomness(DEFAULT_RNG);
+    }
+
+    /// @dev Add a new RNG fallback
+    /// @param _newFallbackRng Address of the new RNG fallback
+    function addRngFallback(IRNG _newFallbackRng) external onlyByGovernor {
+        require(address(_newFallbackRng) != address(0), "Invalid RNG");
+        rngs.push(_newFallbackRng);
+        emit RNGFallbackAdded(address(_newFallbackRng));
+    }
+
+    /// @dev Remove an RNG fallback
+    function removeLastRngFallback() external onlyByGovernor {
+        require(rngs.length > 1, "No fallback RNG");
+
+        // If the removed RNG is the current one, reset the fallback index
+        if (currentRngIndex > rngs.length - 2) {
+            currentRngIndex = DEFAULT_RNG;
+        }
+
+        IRNG removedRng = rngs[rngs.length - 1];
+        rngs.pop();
+        emit RNGFallbackRemoved(address(removedRng));
+    }
+
+    /// @dev Change the fallback timeout
+    /// @param _fallbackTimeoutSeconds New timeout in seconds
+    function changeFallbackTimeout(uint256 _fallbackTimeoutSeconds) external onlyByGovernor {
+        fallbackTimeoutSeconds = _fallbackTimeoutSeconds;
+        emit FallbackTimeoutChanged(_fallbackTimeoutSeconds);
+    }
+
+    /// @dev Emergency reset the RNG.
+    /// Useful for the governor to ensure that re-requesting a random number will not be blocked by a previous request.
+    function emergencyReset() external onlyByGovernor {
+        isRequesting = false;
+        requestTimestamp = 0;
+        currentRngIndex = DEFAULT_RNG;
+    }
+
+    // ************************************* //
+    // *           View Functions          * //
+    // ************************************* //
+
+    /// @dev Get the number of RNGs
+    /// @return Number of RNGs
+    function getRNGsCount() external view returns (uint256) {
+        return rngs.length;
+    }
+}
diff --git a/contracts/src/rng/RandomizerRNG.sol b/contracts/src/rng/RandomizerRNG.sol
index 940c2cf5d..6db56fa3b 100644
--- a/contracts/src/rng/RandomizerRNG.sol
+++ b/contracts/src/rng/RandomizerRNG.sol
@@ -2,18 +2,18 @@
 
 pragma solidity ^0.8.24;
 
-import "./RNG.sol";
+import "./IRNG.sol";
 import "./IRandomizer.sol";
 
 /// @title Random Number Generator that uses Randomizer.ai
 /// https://randomizer.ai/
-contract RandomizerRNG is RNG {
+contract RandomizerRNG is IRNG {
     // ************************************* //
     // *             Storage               * //
     // ************************************* //
 
     address public governor; // The address that can withdraw funds.
-    address public sortitionModule; // The address of the SortitionModule.
+    address public consumer; // The address that can request random numbers.
     IRandomizer public randomizer; // Randomizer address.
     uint256 public callbackGasLimit; // Gas limit for the Randomizer.ai callback.
     uint256 public lastRequestId; // The last request ID.
@@ -41,8 +41,8 @@ contract RandomizerRNG is RNG {
         _;
     }
 
-    modifier onlyBySortitionModule() {
-        require(sortitionModule == msg.sender, "SortitionModule only");
+    modifier onlyByConsumer() {
+        require(consumer == msg.sender, "Consumer only");
         _;
     }
 
@@ -51,11 +51,12 @@ contract RandomizerRNG is RNG {
     // ************************************* //
 
     /// @dev Constructor
-    /// @param _randomizer Randomizer contract.
-    /// @param _governor Governor of the contract.
-    constructor(address _governor, address _sortitionModule, IRandomizer _randomizer) {
+    /// @param _governor The Governor of the contract.
+    /// @param _consumer The address that can request random numbers.
+    /// @param _randomizer The Randomizer.ai oracle contract.
+    constructor(address _governor, address _consumer, IRandomizer _randomizer) {
         governor = _governor;
-        sortitionModule = _sortitionModule;
+        consumer = _consumer;
         randomizer = _randomizer;
         callbackGasLimit = 50000;
     }
@@ -70,10 +71,10 @@ contract RandomizerRNG is RNG {
         governor = _governor;
     }
 
-    /// @dev Changes the sortition module of the contract.
-    /// @param _sortitionModule The new sortition module.
-    function changeSortitionModule(address _sortitionModule) external onlyByGovernor {
-        sortitionModule = _sortitionModule;
+    /// @dev Changes the consumer of the RNG.
+    /// @param _consumer The new consumer.
+    function changeConsumer(address _consumer) external onlyByGovernor {
+        consumer = _consumer;
     }
 
     /// @dev Change the Randomizer callback gas limit.
@@ -98,8 +99,8 @@ contract RandomizerRNG is RNG {
     // *         State Modifiers           * //
     // ************************************* //
 
-    /// @dev Request a random number. SortitionModule only.
-    function requestRandomness(uint256 /*_block*/) external override onlyBySortitionModule {
+    /// @dev Request a random number. Consumer only.
+    function requestRandomness() external override onlyByConsumer {
         uint256 requestId = randomizer.request(callbackGasLimit);
         lastRequestId = requestId;
         emit RequestSent(requestId);
@@ -120,7 +121,7 @@ contract RandomizerRNG is RNG {
 
     /// @dev Return the random number.
     /// @return randomNumber The random number or 0 if it is not ready or has not been requested.
-    function receiveRandomness(uint256 /*_block*/) external view override returns (uint256 randomNumber) {
+    function receiveRandomness() external view override returns (uint256 randomNumber) {
         randomNumber = randomNumbers[lastRequestId];
     }
 }
diff --git a/contracts/test/arbitration/dispute-kit-gated.ts b/contracts/test/arbitration/dispute-kit-gated.ts
index daa78ce0c..aa8c504db 100644
--- a/contracts/test/arbitration/dispute-kit-gated.ts
+++ b/contracts/test/arbitration/dispute-kit-gated.ts
@@ -61,7 +61,7 @@ describe("DisputeKitGated", async () => {
     });
     rng = (await ethers.getContract("IncrementalNG")) as IncrementalNG;
 
-    await sortitionModule.changeRandomNumberGenerator(rng.target, 20).then((tx) => tx.wait());
+    await sortitionModule.changeRandomNumberGenerator(rng.target).then((tx) => tx.wait());
 
     const hre = require("hardhat");
     await deployERC721(hre, deployer, "TestERC721", "Nft721");
@@ -141,11 +141,6 @@ describe("DisputeKitGated", async () => {
     await network.provider.send("evm_mine");
     await sortitionModule.passPhase().then((tx) => tx.wait()); // Staking -> Generating
 
-    const lookahead = await sortitionModule.rngLookahead();
-    for (let index = 0; index < lookahead; index++) {
-      await network.provider.send("evm_mine");
-    }
-
     await sortitionModule.passPhase().then((tx) => tx.wait()); // Generating -> Drawing
     return core.draw(disputeId, 70, { gasLimit: 10000000 });
   };
diff --git a/contracts/test/arbitration/draw.ts b/contracts/test/arbitration/draw.ts
index 12790fdb5..4d2882a57 100644
--- a/contracts/test/arbitration/draw.ts
+++ b/contracts/test/arbitration/draw.ts
@@ -81,7 +81,7 @@ describe("Draw Benchmark", async () => {
     });
     rng = (await ethers.getContract("IncrementalNG")) as IncrementalNG;
 
-    await sortitionModule.changeRandomNumberGenerator(rng.target, 20).then((tx) => tx.wait());
+    await sortitionModule.changeRandomNumberGenerator(rng.target).then((tx) => tx.wait());
 
     // CourtId 2 = CHILD_COURT
     const minStake = 3n * 10n ** 20n; // 300 PNK
@@ -174,11 +174,6 @@ describe("Draw Benchmark", async () => {
     await network.provider.send("evm_mine");
     await sortitionModule.passPhase().then((tx) => tx.wait()); // Staking -> Generating
 
-    const lookahead = await sortitionModule.rngLookahead();
-    for (let index = 0; index < lookahead; index++) {
-      await network.provider.send("evm_mine");
-    }
-
     await sortitionModule.passPhase().then((tx) => tx.wait()); // Generating -> Drawing
     await expectFromDraw(core.draw(0, 20, { gasLimit: 1000000 }));
 
diff --git a/contracts/test/arbitration/staking-neo.ts b/contracts/test/arbitration/staking-neo.ts
index 85b0dc884..ffbdc55fa 100644
--- a/contracts/test/arbitration/staking-neo.ts
+++ b/contracts/test/arbitration/staking-neo.ts
@@ -56,13 +56,13 @@ describe("Staking", async () => {
       fallbackToGlobal: true,
       keepExistingDeployments: false,
     });
-    pnk = (await ethers.getContract("PNK")) as PNK;
-    core = (await ethers.getContract("KlerosCoreNeo")) as KlerosCoreNeo;
-    sortition = (await ethers.getContract("SortitionModuleNeo")) as SortitionModuleNeo;
-    rng = (await ethers.getContract("ChainlinkRNG")) as ChainlinkRNG;
-    vrfCoordinator = (await ethers.getContract("ChainlinkVRFCoordinator")) as ChainlinkVRFCoordinatorV2Mock;
-    resolver = (await ethers.getContract("DisputeResolverNeo")) as DisputeResolver;
-    nft = (await ethers.getContract("KlerosV2NeoEarlyUser")) as TestERC721;
+    pnk = await ethers.getContract<PNK>("PNK");
+    core = await ethers.getContract<KlerosCoreNeo>("KlerosCoreNeo");
+    sortition = await ethers.getContract<SortitionModuleNeo>("SortitionModuleNeo");
+    rng = await ethers.getContract<ChainlinkRNG>("ChainlinkRNG");
+    vrfCoordinator = await ethers.getContract<ChainlinkVRFCoordinatorV2Mock>("ChainlinkVRFCoordinator");
+    resolver = await ethers.getContract<DisputeResolver>("DisputeResolverNeo");
+    nft = await ethers.getContract<TestERC721>("KlerosV2NeoEarlyUser");
 
     // Juror signer setup and funding
     const { firstWallet } = await getNamedAccounts();
@@ -105,10 +105,7 @@ describe("Staking", async () => {
   const drawFromGeneratingPhase = async () => {
     expect(await sortition.phase()).to.be.equal(1); // Generating
 
-    const lookahead = await sortition.rngLookahead();
-    for (let index = 0; index < lookahead; index++) {
-      await network.provider.send("evm_mine");
-    }
+    await network.provider.send("evm_mine");
 
     await vrfCoordinator.fulfillRandomWords(1, rng.target, []);
     await sortition.passPhase(); // Generating -> Drawing
diff --git a/contracts/test/arbitration/staking.ts b/contracts/test/arbitration/staking.ts
index 4d0262c22..d27a5f10e 100644
--- a/contracts/test/arbitration/staking.ts
+++ b/contracts/test/arbitration/staking.ts
@@ -27,11 +27,11 @@ describe("Staking", async () => {
       fallbackToGlobal: true,
       keepExistingDeployments: false,
     });
-    pnk = (await ethers.getContract("PNK")) as PNK;
-    core = (await ethers.getContract("KlerosCore")) as KlerosCore;
-    sortition = (await ethers.getContract("SortitionModule")) as SortitionModule;
-    rng = (await ethers.getContract("ChainlinkRNG")) as ChainlinkRNG;
-    vrfCoordinator = (await ethers.getContract("ChainlinkVRFCoordinator")) as ChainlinkVRFCoordinatorV2Mock;
+    pnk = await ethers.getContract<PNK>("PNK");
+    core = await ethers.getContract<KlerosCore>("KlerosCore");
+    sortition = await ethers.getContract<SortitionModule>("SortitionModule");
+    rng = await ethers.getContract<ChainlinkRNG>("ChainlinkRNG");
+    vrfCoordinator = await ethers.getContract<ChainlinkVRFCoordinatorV2Mock>("ChainlinkVRFCoordinator");
   };
 
   describe("When outside the Staking phase", async () => {
@@ -53,11 +53,8 @@ describe("Staking", async () => {
       await network.provider.send("evm_increaseTime", [2000]); // Wait for minStakingTime
       await network.provider.send("evm_mine");
 
-      const lookahead = await sortition.rngLookahead();
       await sortition.passPhase(); // Staking -> Generating
-      for (let index = 0; index < lookahead; index++) {
-        await network.provider.send("evm_mine");
-      }
+      await network.provider.send("evm_mine");
 
       balanceBefore = await pnk.balanceOf(deployer);
     };
@@ -393,11 +390,9 @@ describe("Staking", async () => {
       await network.provider.send("evm_increaseTime", [2000]); // Wait for minStakingTime
       await network.provider.send("evm_mine");
 
-      const lookahead = await sortition.rngLookahead();
       await sortition.passPhase(); // Staking -> Generating
-      for (let index = 0; index < lookahead; index++) {
-        await network.provider.send("evm_mine");
-      }
+      await network.provider.send("evm_mine");
+
       await vrfCoordinator.fulfillRandomWords(1, rng.target, []);
       await sortition.passPhase(); // Generating -> Drawing
 
diff --git a/contracts/test/foundry/KlerosCore.t.sol b/contracts/test/foundry/KlerosCore.t.sol
index 20f8555a7..b7bb3d73d 100644
--- a/contracts/test/foundry/KlerosCore.t.sol
+++ b/contracts/test/foundry/KlerosCore.t.sol
@@ -53,7 +53,7 @@ contract KlerosCoreTest is Test {
 
     uint256 minStakingTime;
     uint256 maxDrawingTime;
-    uint256 rngLookahead;
+    uint256 rngLookahead; // Time in seconds
 
     string templateData;
     string templateDataMappings;
@@ -63,7 +63,6 @@ contract KlerosCoreTest is Test {
         SortitionModuleMock smLogic = new SortitionModuleMock();
         DisputeKitClassic dkLogic = new DisputeKitClassic();
         DisputeTemplateRegistry registryLogic = new DisputeTemplateRegistry();
-        rng = new BlockHashRNG();
         pinakion = new PNK();
         feeToken = new TestERC20("Test", "TST");
         wNative = new TestERC20("wrapped ETH", "wETH");
@@ -93,9 +92,11 @@ contract KlerosCoreTest is Test {
         sortitionExtraData = abi.encode(uint256(5));
         minStakingTime = 18;
         maxDrawingTime = 24;
-        rngLookahead = 20;
         hiddenVotes = false;
 
+        rngLookahead = 600;
+        rng = new BlockHashRNG(msg.sender, address(sortitionModule), rngLookahead);
+
         UUPSProxy proxyCore = new UUPSProxy(address(coreLogic), "");
 
         bytes memory initDataDk = abi.encodeWithSignature(
@@ -109,17 +110,18 @@ contract KlerosCoreTest is Test {
         disputeKit = DisputeKitClassic(address(proxyDk));
 
         bytes memory initDataSm = abi.encodeWithSignature(
-            "initialize(address,address,uint256,uint256,address,uint256)",
+            "initialize(address,address,uint256,uint256,address)",
             governor,
             address(proxyCore),
             minStakingTime,
             maxDrawingTime,
-            rng,
-            rngLookahead
+            rng
         );
 
         UUPSProxy proxySm = new UUPSProxy(address(smLogic), initDataSm);
         sortitionModule = SortitionModuleMock(address(proxySm));
+        vm.prank(governor);
+        rng.changeConsumer(address(sortitionModule));
 
         core = KlerosCoreMock(address(proxyCore));
         core.initialize(
@@ -239,11 +241,9 @@ contract KlerosCoreTest is Test {
         assertEq(sortitionModule.minStakingTime(), 18, "Wrong minStakingTime");
         assertEq(sortitionModule.maxDrawingTime(), 24, "Wrong maxDrawingTime");
         assertEq(sortitionModule.lastPhaseChange(), block.timestamp, "Wrong lastPhaseChange");
-        assertEq(sortitionModule.randomNumberRequestBlock(), 0, "randomNumberRequestBlock should be 0");
         assertEq(sortitionModule.disputesWithoutJurors(), 0, "disputesWithoutJurors should be 0");
         assertEq(address(sortitionModule.rng()), address(rng), "Wrong RNG address");
         assertEq(sortitionModule.randomNumber(), 0, "randomNumber should be 0");
-        assertEq(sortitionModule.rngLookahead(), 20, "Wrong rngLookahead");
         assertEq(sortitionModule.delayedStakeWriteIndex(), 0, "delayedStakeWriteIndex should be 0");
         assertEq(sortitionModule.delayedStakeReadIndex(), 1, "Wrong delayedStakeReadIndex");
 
@@ -260,7 +260,6 @@ contract KlerosCoreTest is Test {
         KlerosCoreMock coreLogic = new KlerosCoreMock();
         SortitionModuleMock smLogic = new SortitionModuleMock();
         DisputeKitClassic dkLogic = new DisputeKitClassic();
-        rng = new BlockHashRNG();
         pinakion = new PNK();
 
         governor = msg.sender;
@@ -280,9 +279,11 @@ contract KlerosCoreTest is Test {
         sortitionExtraData = abi.encode(uint256(5));
         minStakingTime = 18;
         maxDrawingTime = 24;
-        rngLookahead = 20;
         hiddenVotes = false;
 
+        rngLookahead = 20;
+        rng = new BlockHashRNG(msg.sender, address(sortitionModule), rngLookahead);
+
         UUPSProxy proxyCore = new UUPSProxy(address(coreLogic), "");
 
         bytes memory initDataDk = abi.encodeWithSignature(
@@ -296,17 +297,18 @@ contract KlerosCoreTest is Test {
         disputeKit = DisputeKitClassic(address(proxyDk));
 
         bytes memory initDataSm = abi.encodeWithSignature(
-            "initialize(address,address,uint256,uint256,address,uint256)",
+            "initialize(address,address,uint256,uint256,address)",
             governor,
             address(proxyCore),
             minStakingTime,
             maxDrawingTime,
-            rng,
-            rngLookahead
+            rng
         );
 
         UUPSProxy proxySm = new UUPSProxy(address(smLogic), initDataSm);
         sortitionModule = SortitionModuleMock(address(proxySm));
+        vm.prank(governor);
+        rng.changeConsumer(address(sortitionModule));
 
         core = KlerosCoreMock(address(proxyCore));
         vm.expectEmit(true, true, true, true);
@@ -1015,7 +1017,7 @@ contract KlerosCoreTest is Test {
         assertEq(sortitionModule.disputesWithoutJurors(), 1, "Wrong disputesWithoutJurors count");
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
 
         assertEq(pinakion.balanceOf(address(core)), 1000, "Wrong token balance of the core");
@@ -1062,7 +1064,7 @@ contract KlerosCoreTest is Test {
         arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
 
         assertEq(pinakion.balanceOf(address(core)), 2000, "Wrong token balance of the core");
@@ -1089,7 +1091,7 @@ contract KlerosCoreTest is Test {
         arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
 
         uint256 disputeID = 0;
@@ -1145,7 +1147,7 @@ contract KlerosCoreTest is Test {
         arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
         uint256 disputeID = 0;
         core.draw(disputeID, DEFAULT_NB_OF_JURORS);
@@ -1433,7 +1435,7 @@ contract KlerosCoreTest is Test {
         arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
 
         vm.expectEmit(true, true, true, true);
@@ -1512,7 +1514,7 @@ contract KlerosCoreTest is Test {
         arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action"); // Dispute uses general court by default
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
 
         (uint96 courtID, , , , ) = core.disputes(disputeID);
@@ -1555,7 +1557,7 @@ contract KlerosCoreTest is Test {
         arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
         core.draw(disputeID, DEFAULT_NB_OF_JURORS);
 
@@ -1665,7 +1667,7 @@ contract KlerosCoreTest is Test {
         arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
         core.draw(disputeID, DEFAULT_NB_OF_JURORS);
 
@@ -1690,7 +1692,7 @@ contract KlerosCoreTest is Test {
         arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
 
         core.draw(disputeID, DEFAULT_NB_OF_JURORS - 1); // Draw less to check the require later
@@ -1801,7 +1803,7 @@ contract KlerosCoreTest is Test {
         arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
         core.draw(disputeID, DEFAULT_NB_OF_JURORS);
 
@@ -1828,7 +1830,7 @@ contract KlerosCoreTest is Test {
         arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
         core.draw(disputeID, DEFAULT_NB_OF_JURORS);
 
@@ -1869,7 +1871,7 @@ contract KlerosCoreTest is Test {
         arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
         core.draw(disputeID, DEFAULT_NB_OF_JURORS);
 
@@ -1918,7 +1920,7 @@ contract KlerosCoreTest is Test {
         arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
 
         core.draw(disputeID, DEFAULT_NB_OF_JURORS);
@@ -2008,7 +2010,7 @@ contract KlerosCoreTest is Test {
         arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
 
         core.draw(disputeID, DEFAULT_NB_OF_JURORS);
@@ -2052,7 +2054,7 @@ contract KlerosCoreTest is Test {
         arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
 
         core.draw(disputeID, DEFAULT_NB_OF_JURORS);
@@ -2153,7 +2155,7 @@ contract KlerosCoreTest is Test {
         arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
 
         KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 0);
@@ -2231,7 +2233,7 @@ contract KlerosCoreTest is Test {
         arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
 
         core.draw(disputeID, DEFAULT_NB_OF_JURORS);
@@ -2265,7 +2267,7 @@ contract KlerosCoreTest is Test {
         arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
 
         // Split the stakers' votes. The first staker will get VoteID 0 and the second will take the rest.
@@ -2277,7 +2279,7 @@ contract KlerosCoreTest is Test {
         core.setStake(GENERAL_COURT, 20000);
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
 
         core.draw(disputeID, 2); // Assign leftover votes to staker2
@@ -2383,7 +2385,7 @@ contract KlerosCoreTest is Test {
         arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
 
         core.draw(disputeID, DEFAULT_NB_OF_JURORS);
@@ -2458,7 +2460,7 @@ contract KlerosCoreTest is Test {
         arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
 
         core.draw(disputeID, DEFAULT_NB_OF_JURORS);
@@ -2504,7 +2506,7 @@ contract KlerosCoreTest is Test {
         arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
 
         core.draw(disputeID, DEFAULT_NB_OF_JURORS);
@@ -2559,7 +2561,7 @@ contract KlerosCoreTest is Test {
         arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
 
         core.draw(disputeID, DEFAULT_NB_OF_JURORS);
@@ -2649,7 +2651,7 @@ contract KlerosCoreTest is Test {
         core.setStake(GENERAL_COURT, 20000);
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
 
         core.draw(disputeID, DEFAULT_NB_OF_JURORS);
@@ -2703,7 +2705,7 @@ contract KlerosCoreTest is Test {
         core.setStake(GENERAL_COURT, 20000);
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
 
         core.draw(disputeID, DEFAULT_NB_OF_JURORS);
@@ -2742,7 +2744,7 @@ contract KlerosCoreTest is Test {
         arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
 
         core.draw(disputeID, DEFAULT_NB_OF_JURORS);
@@ -2796,7 +2798,7 @@ contract KlerosCoreTest is Test {
         arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
 
         core.draw(disputeID, DEFAULT_NB_OF_JURORS);
@@ -2839,7 +2841,7 @@ contract KlerosCoreTest is Test {
         arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
 
         core.draw(disputeID, DEFAULT_NB_OF_JURORS);
@@ -2938,7 +2940,7 @@ contract KlerosCoreTest is Test {
 
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
 
         KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 0);
diff --git a/contracts/test/integration/index.ts b/contracts/test/integration/index.ts
index 395b9ed8e..5b4b7ea9a 100644
--- a/contracts/test/integration/index.ts
+++ b/contracts/test/integration/index.ts
@@ -9,8 +9,6 @@ import {
   HomeGateway,
   VeaMock,
   DisputeKitClassic,
-  RandomizerRNG,
-  RandomizerMock,
   SortitionModule,
   ChainlinkRNG,
   ChainlinkVRFCoordinatorV2Mock,
@@ -161,7 +159,6 @@ describe("Integration tests", async () => {
     console.log("KC phase: %d", await sortitionModule.phase());
 
     await sortitionModule.passPhase(); // Staking -> Generating
-    await mineBlocks(ethers.getNumber(await sortitionModule.rngLookahead())); // Wait for finality
     expect(await sortitionModule.phase()).to.equal(Phase.generating);
     console.log("KC phase: %d", await sortitionModule.phase());
     await vrfCoordinator.fulfillRandomWords(1, rng.target, []);
@@ -206,6 +203,6 @@ describe("Integration tests", async () => {
   };
 });
 
-const logJurorBalance = async (result) => {
+const logJurorBalance = async (result: { totalStaked: bigint; totalLocked: bigint }) => {
   console.log("staked=%s, locked=%s", ethers.formatUnits(result.totalStaked), ethers.formatUnits(result.totalLocked));
 };
diff --git a/contracts/test/proxy/index.ts b/contracts/test/proxy/index.ts
index 6b66a27fb..410753f97 100644
--- a/contracts/test/proxy/index.ts
+++ b/contracts/test/proxy/index.ts
@@ -4,7 +4,7 @@ import { DeployResult } from "hardhat-deploy/types";
 import { HardhatEthersSigner } from "@nomicfoundation/hardhat-ethers/signers";
 import { deployUpgradable } from "../../deploy/utils/deployUpgradable";
 import { UpgradedByInheritanceV1, UpgradedByInheritanceV2 } from "../../typechain-types";
-import { UpgradedByRewrite as UpgradedByRewriteV1 } from "../../typechain-types/src/proxy/mock/by-rewrite";
+import { UpgradedByRewrite as UpgradedByRewriteV1 } from "../../typechain-types/src/proxy/mock/by-rewrite/UpgradedByRewrite.sol";
 import { UpgradedByRewrite as UpgradedByRewriteV2 } from "../../typechain-types/src/proxy/mock/by-rewrite/UpgradedByRewriteV2.sol";
 
 let deployer: HardhatEthersSigner;
diff --git a/contracts/test/rng/index.ts b/contracts/test/rng/index.ts
index 3d4906721..5e74b4a3a 100644
--- a/contracts/test/rng/index.ts
+++ b/contracts/test/rng/index.ts
@@ -21,13 +21,13 @@ describe("IncrementalNG", async () => {
   });
 
   it("Should return a number incrementing each time", async () => {
-    expect(await rng.receiveRandomness.staticCall(689376)).to.equal(initialNg);
-    await rng.receiveRandomness(29543).then((tx) => tx.wait());
-    expect(await rng.receiveRandomness.staticCall(5894382)).to.equal(initialNg + 1);
-    await rng.receiveRandomness(0).then((tx) => tx.wait());
-    expect(await rng.receiveRandomness.staticCall(3465)).to.equal(initialNg + 2);
-    await rng.receiveRandomness(2n ** 255n).then((tx) => tx.wait());
-    expect(await rng.receiveRandomness.staticCall(0)).to.equal(initialNg + 3);
+    expect(await rng.receiveRandomness.staticCall()).to.equal(initialNg);
+    await rng.receiveRandomness().then((tx) => tx.wait());
+    expect(await rng.receiveRandomness.staticCall()).to.equal(initialNg + 1);
+    await rng.receiveRandomness().then((tx) => tx.wait());
+    expect(await rng.receiveRandomness.staticCall()).to.equal(initialNg + 2);
+    await rng.receiveRandomness().then((tx) => tx.wait());
+    expect(await rng.receiveRandomness.staticCall()).to.equal(initialNg + 3);
   });
 });
 
@@ -35,26 +35,48 @@ describe("BlockHashRNG", async () => {
   let rng: BlockHashRNG;
 
   beforeEach("Setup", async () => {
-    const rngFactory = await ethers.getContractFactory("BlockHashRNG");
-    rng = (await rngFactory.deploy()) as BlockHashRNG;
+    const [deployer] = await ethers.getSigners();
+    await deployments.delete("BlockHashRNG");
+    await deployments.deploy("BlockHashRNG", {
+      from: deployer.address,
+      args: [deployer.address, deployer.address, 10], // governor, consumer, lookaheadTime (seconds)
+    });
+    rng = await ethers.getContract<BlockHashRNG>("BlockHashRNG");
   });
 
-  it("Should return a non-zero number for a block number in the past", async () => {
-    const tx = await rng.receiveRandomness(5);
-    const trace = await network.provider.send("debug_traceTransaction", [tx.hash]);
-    await tx.wait();
-    const [rn] = abiCoder.decode(["uint"], ethers.getBytes(`${trace.returnValue}`));
-    expect(rn).to.not.equal(0);
-    await tx.wait();
+  it("Should return a non-zero number after requesting and waiting", async () => {
+    // First request randomness
+    await rng.requestRandomness();
+
+    // Check that it's not ready yet
+    expect(await rng.isRandomnessReady()).to.be.false;
+
+    // Advance time by 10 seconds (the lookahead time)
+    await network.provider.send("evm_increaseTime", [10]);
+    await network.provider.send("evm_mine");
+
+    // Now it should be ready
+    expect(await rng.isRandomnessReady()).to.be.true;
+
+    // Get the random number
+    const randomNumber = await rng.receiveRandomness.staticCall();
+    expect(randomNumber).to.not.equal(0);
   });
 
-  it("Should return zero for a block number in the future", async () => {
-    const tx = await rng.receiveRandomness(9876543210);
-    const trace = await network.provider.send("debug_traceTransaction", [tx.hash]);
-    await tx.wait();
-    const [rn] = abiCoder.decode(["uint"], ethers.getBytes(`${trace.returnValue}`));
-    expect(rn).to.equal(0);
-    await tx.wait();
+  it("Should return 0 if randomness not requested", async () => {
+    const randomNumber = await rng.receiveRandomness.staticCall();
+    expect(randomNumber).to.equal(0);
+  });
+
+  it("Should return 0 if not enough time has passed", async () => {
+    await rng.requestRandomness();
+
+    // Don't advance time enough
+    await network.provider.send("evm_increaseTime", [5]); // Only 5 seconds
+    await network.provider.send("evm_mine");
+
+    const randomNumber = await rng.receiveRandomness.staticCall();
+    expect(randomNumber).to.equal(0);
   });
 });
 
@@ -73,39 +95,33 @@ describe("ChainlinkRNG", async () => {
 
   it("Should return a non-zero random number", async () => {
     const requestId = 1;
-    const expectedRn = BigInt(
-      ethers.keccak256(ethers.AbiCoder.defaultAbiCoder().encode(["uint256", "uint256"], [requestId, 0]))
-    );
+    const expectedRn = BigInt(ethers.keccak256(abiCoder.encode(["uint256", "uint256"], [requestId, 0])));
 
-    let tx = await rng.requestRandomness(0);
+    let tx = await rng.requestRandomness();
     await expect(tx).to.emit(rng, "RequestSent").withArgs(requestId);
 
     tx = await vrfCoordinator.fulfillRandomWords(requestId, rng.target, []);
     await expect(tx).to.emit(rng, "RequestFulfilled").withArgs(requestId, expectedRn);
 
-    const rn = await rng.receiveRandomness(0);
+    const rn = await rng.receiveRandomness();
     expect(rn).to.equal(expectedRn);
     await tx.wait();
   });
 
   it("Should return only the last random number when multiple requests are made", async () => {
     // First request
-    let tx = await rng.requestRandomness(0);
+    let tx = await rng.requestRandomness();
     const requestId1 = 1;
     await expect(tx).to.emit(rng, "RequestSent").withArgs(requestId1);
 
     // Second request
-    tx = await rng.requestRandomness(0);
+    tx = await rng.requestRandomness();
     const requestId2 = 2;
     await expect(tx).to.emit(rng, "RequestSent").withArgs(requestId2);
 
     // Generate expected random numbers
-    const expectedRn1 = BigInt(
-      ethers.keccak256(ethers.AbiCoder.defaultAbiCoder().encode(["uint256", "uint256"], [requestId1, 0]))
-    );
-    const expectedRn2 = BigInt(
-      ethers.keccak256(ethers.AbiCoder.defaultAbiCoder().encode(["uint256", "uint256"], [requestId2, 0]))
-    );
+    const expectedRn1 = BigInt(ethers.keccak256(abiCoder.encode(["uint256", "uint256"], [requestId1, 0])));
+    const expectedRn2 = BigInt(ethers.keccak256(abiCoder.encode(["uint256", "uint256"], [requestId2, 0])));
     expect(expectedRn1).to.not.equal(expectedRn2, "Random numbers should be different");
 
     // Fulfill first request
@@ -117,7 +133,7 @@ describe("ChainlinkRNG", async () => {
     await expect(tx).to.emit(rng, "RequestFulfilled").withArgs(requestId2, expectedRn2);
 
     // Should return only the last random number
-    const rn = await rng.receiveRandomness(0);
+    const rn = await rng.receiveRandomness();
     expect(rn).to.equal(expectedRn2);
     await tx.wait();
   });
@@ -141,25 +157,25 @@ describe("RandomizerRNG", async () => {
     const expectedRn = BigInt(ethers.hexlify(randomBytes));
     const requestId = 1;
 
-    let tx = await rng.requestRandomness(0);
+    let tx = await rng.requestRandomness();
     await expect(tx).to.emit(rng, "RequestSent").withArgs(requestId);
 
     tx = await randomizer.relay(rng.target, requestId, randomBytes);
     await expect(tx).to.emit(rng, "RequestFulfilled").withArgs(requestId, expectedRn);
 
-    const rn = await rng.receiveRandomness(0);
+    const rn = await rng.receiveRandomness();
     expect(rn).to.equal(expectedRn);
     await tx.wait();
   });
 
   it("Should return only the last random number when multiple requests are made", async () => {
     // First request
-    let tx = await rng.requestRandomness(0);
+    let tx = await rng.requestRandomness();
     const requestId1 = 1;
     await expect(tx).to.emit(rng, "RequestSent").withArgs(requestId1);
 
     // Second request
-    tx = await rng.requestRandomness(0);
+    tx = await rng.requestRandomness();
     const requestId2 = 2;
     await expect(tx).to.emit(rng, "RequestSent").withArgs(requestId2);
 
@@ -180,7 +196,7 @@ describe("RandomizerRNG", async () => {
     await expect(tx).to.emit(rng, "RequestFulfilled").withArgs(requestId2, expectedRn2);
 
     // Should return only the last random number
-    const rn = await rng.receiveRandomness(0);
+    const rn = await rng.receiveRandomness();
     expect(rn).to.equal(expectedRn2);
     await tx.wait();
   });
diff --git a/cspell.json b/cspell.json
index 0ab3e541c..0fa6dc52c 100644
--- a/cspell.json
+++ b/cspell.json
@@ -35,6 +35,7 @@
     "IERC",
     "Initializable",
     "ipfs",
+    "IRNG",
     "kleros",
     "linguo",
     "Numberish",

From 63ecf4a2f421549c6e6003c8c87ccfb906aab891 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 24 Jul 2025 21:02:25 +0200
Subject: [PATCH 014/175] fix: re-added removed variables to preserve storage
 layout, marked as deprecated for later removal

---
 contracts/src/arbitration/SortitionModuleBase.sol | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/contracts/src/arbitration/SortitionModuleBase.sol b/contracts/src/arbitration/SortitionModuleBase.sol
index c554c9c9c..7692740cc 100644
--- a/contracts/src/arbitration/SortitionModuleBase.sol
+++ b/contracts/src/arbitration/SortitionModuleBase.sol
@@ -50,9 +50,11 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
     uint256 public minStakingTime; // The time after which the phase can be switched to Drawing if there are open disputes.
     uint256 public maxDrawingTime; // The time after which the phase can be switched back to Staking.
     uint256 public lastPhaseChange; // The last time the phase was changed.
+    uint256 public randomNumberRequestBlock; // DEPRECATED: to be removed in the next redeploy
     uint256 public disputesWithoutJurors; // The number of disputes that have not finished drawing jurors.
     IRNG public rng; // The random number generator.
     uint256 public randomNumber; // Random number returned by RNG.
+    uint256 public rngLookahead; // DEPRECATED: to be removed in the next redeploy
     uint256 public delayedStakeWriteIndex; // The index of the last `delayedStake` item that was written to the array. 0 index is skipped.
     uint256 public delayedStakeReadIndex; // The index of the next `delayedStake` item that should be processed. Starts at 1 because 0 index is skipped.
     mapping(bytes32 treeHash => SortitionSumTree) sortitionSumTrees; // The mapping trees by keys.

From 937fb976be4f285e0ac5c6d8044165f83940e2bf Mon Sep 17 00:00:00 2001
From: unknownunknown1 <danil@kleros.io>
Date: Wed, 6 Aug 2025 16:18:27 +1000
Subject: [PATCH 015/175] feat(RNG): fallback contract update

---
 contracts/src/rng/BlockhashRNG.sol      |   6 +-
 contracts/src/rng/RNGWithFallback.sol   | 106 ++++--------------------
 contracts/test/foundry/KlerosCore.t.sol |   4 +-
 3 files changed, 19 insertions(+), 97 deletions(-)

diff --git a/contracts/src/rng/BlockhashRNG.sol b/contracts/src/rng/BlockhashRNG.sol
index 8568de34e..9070d0751 100644
--- a/contracts/src/rng/BlockhashRNG.sol
+++ b/contracts/src/rng/BlockhashRNG.sol
@@ -77,7 +77,7 @@ contract BlockHashRNG is IRNG {
     /// @dev Return the random number. If it has not been saved and is still computable compute it.
     /// @return randomNumber The random number or 0 if it is not ready or has not been requested.
     function receiveRandomness() external override onlyByConsumer returns (uint256 randomNumber) {
-        if (requestTimestamp == 0) return 0; // No request made
+        if (requestTimestamp == 0) return 0; // No requests were made yet.
 
         uint256 expectedTimestamp = requestTimestamp + lookaheadTime;
 
@@ -107,14 +107,14 @@ contract BlockHashRNG is IRNG {
     /// @dev Check if randomness is ready to be received.
     /// @return ready True if randomness can be received.
     function isRandomnessReady() external view returns (bool ready) {
-        if (requestTimestamp == 0) return false;
+        if (requestTimestamp == 0) return false; // No requests were made yet.
         return block.timestamp >= requestTimestamp + lookaheadTime;
     }
 
     /// @dev Get the timestamp when randomness will be ready.
     /// @return readyTimestamp The timestamp when randomness will be available.
     function getRandomnessReadyTimestamp() external view returns (uint256 readyTimestamp) {
-        if (requestTimestamp == 0) return 0;
+        if (requestTimestamp == 0) return 0; // No requests were made yet.
         return requestTimestamp + lookaheadTime;
     }
 }
diff --git a/contracts/src/rng/RNGWithFallback.sol b/contracts/src/rng/RNGWithFallback.sol
index 94c2b0e03..95b635cef 100644
--- a/contracts/src/rng/RNGWithFallback.sol
+++ b/contracts/src/rng/RNGWithFallback.sol
@@ -6,29 +6,21 @@ import "./IRNG.sol";
 /// @title RNG with fallback mechanism
 /// @notice Uses multiple RNG implementations with automatic fallback if default RNG does not respond passed a timeout.
 contract RNGWithFallback is IRNG {
-    uint256 public constant DEFAULT_RNG = 0;
-
     // ************************************* //
     // *             Storage               * //
     // ************************************* //
 
+    IRNG public immutable rng; // RNG address.
     address public governor; // Governor address
     address public consumer; // Consumer address
-    IRNG[] public rngs; // List of RNG implementations
     uint256 public fallbackTimeoutSeconds; // Time in seconds to wait before falling back to next RNG
     uint256 public requestTimestamp; // Timestamp of the current request
-    uint256 public currentRngIndex; // Index of the current RNG
-    bool public isRequesting; // Whether a request is in progress
 
     // ************************************* //
     // *              Events               * //
     // ************************************* //
 
-    event RNGDefaultChanged(address indexed _newDefaultRng);
-    event RNGFallback(uint256 _fromIndex, uint256 _toIndex);
-    event RNGFailure();
-    event RNGFallbackAdded(address indexed _rng);
-    event RNGFallbackRemoved(address indexed _rng);
+    event RNGFallback();
     event FallbackTimeoutChanged(uint256 _newTimeout);
 
     // ************************************* //
@@ -38,14 +30,14 @@ contract RNGWithFallback is IRNG {
     /// @param _governor Governor address
     /// @param _consumer Consumer address
     /// @param _fallbackTimeoutSeconds Time in seconds to wait before falling back to next RNG
-    /// @param _defaultRng The default RNG
-    constructor(address _governor, address _consumer, uint256 _fallbackTimeoutSeconds, IRNG _defaultRng) {
-        require(address(_defaultRng) != address(0), "Invalid default RNG");
+    /// @param _rng The RNG address (e.g. Chainlink)
+    constructor(address _governor, address _consumer, uint256 _fallbackTimeoutSeconds, IRNG _rng) {
+        require(address(_rng) != address(0), "Invalid default RNG");
 
         governor = _governor;
         consumer = _consumer;
         fallbackTimeoutSeconds = _fallbackTimeoutSeconds;
-        rngs.push(_defaultRng);
+        rng = _rng;
     }
 
     // ************************************* //
@@ -66,44 +58,25 @@ contract RNGWithFallback is IRNG {
     // *         State Modifiers          * //
     // ************************************* //
 
-    /// @dev Request a random number from the default RNG
+    /// @dev Request a random number from the RNG
     function requestRandomness() external override onlyByConsumer {
-        require(!isRequesting, "Request already in progress");
-        _requestRandomness(DEFAULT_RNG);
-    }
-
-    function _requestRandomness(uint256 _rngIndex) internal {
-        isRequesting = true;
         requestTimestamp = block.timestamp;
-        currentRngIndex = _rngIndex;
-        rngs[_rngIndex].requestRandomness();
+        rng.requestRandomness();
     }
 
     /// @dev Receive the random number with fallback logic
     /// @return randomNumber Random Number
     function receiveRandomness() external override onlyByConsumer returns (uint256 randomNumber) {
-        // Try to get random number from current RNG
-        randomNumber = rngs[currentRngIndex].receiveRandomness();
+        // Try to get random number from the RNG contract
+        randomNumber = rng.receiveRandomness();
 
         // If we got a valid number, clear the request
         if (randomNumber != 0) {
-            isRequesting = false;
             return randomNumber;
-        }
-
-        // If the timeout is exceeded, try next RNG
-        if (block.timestamp > requestTimestamp + fallbackTimeoutSeconds) {
-            uint256 nextIndex = currentRngIndex + 1;
-
-            // If we have another RNG to try, switch to it and request again
-            if (nextIndex < rngs.length) {
-                emit RNGFallback(currentRngIndex, nextIndex);
-                currentRngIndex = nextIndex;
-                _requestRandomness(nextIndex);
-            } else {
-                // No more RNGs to try
-                emit RNGFailure();
-            }
+        } else if (block.timestamp > requestTimestamp + fallbackTimeoutSeconds) {
+            // If the timeout is exceeded, try the fallback
+            randomNumber = uint256(blockhash(block.number - 1));
+            emit RNGFallback();
         }
         return randomNumber;
     }
@@ -124,61 +97,10 @@ contract RNGWithFallback is IRNG {
         consumer = _consumer;
     }
 
-    /// @dev Change the default RNG
-    /// @param _newDefaultRng Address of the new default RNG
-    function changeDefaultRng(IRNG _newDefaultRng) external onlyByGovernor {
-        require(address(_newDefaultRng) != address(0), "Invalid RNG");
-        rngs[DEFAULT_RNG] = _newDefaultRng;
-        emit RNGDefaultChanged(address(_newDefaultRng));
-
-        // Take over any pending request
-        _requestRandomness(DEFAULT_RNG);
-    }
-
-    /// @dev Add a new RNG fallback
-    /// @param _newFallbackRng Address of the new RNG fallback
-    function addRngFallback(IRNG _newFallbackRng) external onlyByGovernor {
-        require(address(_newFallbackRng) != address(0), "Invalid RNG");
-        rngs.push(_newFallbackRng);
-        emit RNGFallbackAdded(address(_newFallbackRng));
-    }
-
-    /// @dev Remove an RNG fallback
-    function removeLastRngFallback() external onlyByGovernor {
-        require(rngs.length > 1, "No fallback RNG");
-
-        // If the removed RNG is the current one, reset the fallback index
-        if (currentRngIndex > rngs.length - 2) {
-            currentRngIndex = DEFAULT_RNG;
-        }
-
-        IRNG removedRng = rngs[rngs.length - 1];
-        rngs.pop();
-        emit RNGFallbackRemoved(address(removedRng));
-    }
-
     /// @dev Change the fallback timeout
     /// @param _fallbackTimeoutSeconds New timeout in seconds
     function changeFallbackTimeout(uint256 _fallbackTimeoutSeconds) external onlyByGovernor {
         fallbackTimeoutSeconds = _fallbackTimeoutSeconds;
         emit FallbackTimeoutChanged(_fallbackTimeoutSeconds);
     }
-
-    /// @dev Emergency reset the RNG.
-    /// Useful for the governor to ensure that re-requesting a random number will not be blocked by a previous request.
-    function emergencyReset() external onlyByGovernor {
-        isRequesting = false;
-        requestTimestamp = 0;
-        currentRngIndex = DEFAULT_RNG;
-    }
-
-    // ************************************* //
-    // *           View Functions          * //
-    // ************************************* //
-
-    /// @dev Get the number of RNGs
-    /// @return Number of RNGs
-    function getRNGsCount() external view returns (uint256) {
-        return rngs.length;
-    }
 }
diff --git a/contracts/test/foundry/KlerosCore.t.sol b/contracts/test/foundry/KlerosCore.t.sol
index b7bb3d73d..692beb009 100644
--- a/contracts/test/foundry/KlerosCore.t.sol
+++ b/contracts/test/foundry/KlerosCore.t.sol
@@ -94,7 +94,7 @@ contract KlerosCoreTest is Test {
         maxDrawingTime = 24;
         hiddenVotes = false;
 
-        rngLookahead = 600;
+        rngLookahead = 30;
         rng = new BlockHashRNG(msg.sender, address(sortitionModule), rngLookahead);
 
         UUPSProxy proxyCore = new UUPSProxy(address(coreLogic), "");
@@ -1471,7 +1471,7 @@ contract KlerosCoreTest is Test {
         arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
         vm.warp(block.timestamp + minStakingTime);
         sortitionModule.passPhase(); // Generating
-        vm.roll(block.number + rngLookahead + 1);
+        vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
 
         core.draw(disputeID, DEFAULT_NB_OF_JURORS); // No one is staked so check that the empty addresses are not drawn.

From 752b64a2655b08cdaa376e04ca5d64e9d6df4e6e Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 6 Aug 2025 03:06:07 +0100
Subject: [PATCH 016/175] feat: court llms.txt, adding header `X-Robots-Tag:
 llms-txt`

---
 web/netlify.toml        | 5 +++++
 web/src/public/llms.txt | 9 +++++++++
 2 files changed, 14 insertions(+)
 create mode 100644 web/src/public/llms.txt

diff --git a/web/netlify.toml b/web/netlify.toml
index 8cf55aefd..3f6682c22 100644
--- a/web/netlify.toml
+++ b/web/netlify.toml
@@ -9,3 +9,8 @@ YARN_ENABLE_GLOBAL_CACHE = "true"
 
 [functions]
 directory = "web/netlify/functions/"
+
+[[headers]]
+  for = "/*"
+  [headers.values]
+    X-Robots-Tag = "llms-txt"
\ No newline at end of file
diff --git a/web/src/public/llms.txt b/web/src/public/llms.txt
new file mode 100644
index 000000000..00c5825f0
--- /dev/null
+++ b/web/src/public/llms.txt
@@ -0,0 +1,9 @@
+# v2.kleros.builders llms.txt
+
+> Facilitates decentralized arbitration by allowing users to create, manage, and resolve dispute cases through crowdsourced juror consensus, rewarding jurors with cryptocurrency for coherent votes on disputes on the blockchain-based Kleros platform.
+
+- [Kleros Dispute Dashboard](https://v2.kleros.builders): Dashboard for managing and viewing decentralized dispute cases, jurors, and court statistics on Kleros platform.
+- [Kleros Dispute Cases](https://v2.kleros.builders/#/cases/display/1/desc/all): Provide a platform for viewing and managing decentralized dispute resolution cases.
+- [Kleros Decentralized Courts](https://v2.kleros.builders/#/courts): Facilitate decentralized dispute resolution by allowing users to stake tokens, participate as jurors, and view court cases.
+- [Kleros Jurors Leaderboard](https://v2.kleros.builders/#/jurors/1/desc/all): Display ranking and statistics of jurors based on coherent voting and rewards in the Kleros decentralized arbitration system.
+- [Get PNK Token](https://v2.kleros.builders/#/get-pnk): Facilitates cross-chain swaps of PNK tokens typically between the Ethereum and Arbitrum networks.

From 4a72da5ee666bf63b3987c04e7bac02c674aa463 Mon Sep 17 00:00:00 2001
From: kemuru <102478601+kemuru@users.noreply.github.com>
Date: Thu, 7 Aug 2025 21:17:33 +0200
Subject: [PATCH 017/175] fix: shutter flash

---
 web/src/hooks/useVotingContext.tsx              | 12 ++++++++++--
 .../Cases/CaseDetails/Voting/Shutter/index.tsx  | 17 ++++++++++++-----
 2 files changed, 22 insertions(+), 7 deletions(-)

diff --git a/web/src/hooks/useVotingContext.tsx b/web/src/hooks/useVotingContext.tsx
index fa92bf09c..456520cd0 100644
--- a/web/src/hooks/useVotingContext.tsx
+++ b/web/src/hooks/useVotingContext.tsx
@@ -35,7 +35,7 @@ export const VotingContextProvider: React.FC<{ children: React.ReactNode }> = ({
   const { data: drawData, isLoading } = useDrawQuery(address?.toLowerCase(), id, disputeData?.dispute?.currentRound.id);
   const roundId = disputeData?.dispute?.currentRoundIndex;
   const voteId = drawData?.draws?.[0]?.voteIDNum;
-  const { data: hasVoted } = useReadDisputeKitClassicIsVoteActive({
+  const { data: hasVotedClassic } = useReadDisputeKitClassicIsVoteActive({
     query: {
       enabled: !isUndefined(roundId) && !isUndefined(voteId),
       refetchInterval: REFETCH_INTERVAL,
@@ -44,12 +44,20 @@ export const VotingContextProvider: React.FC<{ children: React.ReactNode }> = ({
   });
 
   const wasDrawn = useMemo(() => !isUndefined(drawData) && drawData.draws.length > 0, [drawData]);
-  const isHiddenVotes = useMemo(() => disputeData?.dispute?.court.hiddenVotes, [disputeData]);
+  const isHiddenVotes = useMemo(() => disputeData?.dispute?.court.hiddenVotes ?? false, [disputeData]);
   const isCommitPeriod = useMemo(() => disputeData?.dispute?.period === "commit", [disputeData]);
   const isVotingPeriod = useMemo(() => disputeData?.dispute?.period === "vote", [disputeData]);
 
   const commited = useMemo(() => !isUndefined(drawData) && drawData?.draws?.[0]?.vote?.commited, [drawData]);
   const commit = useMemo(() => drawData?.draws?.[0]?.vote?.commit, [drawData]);
+
+  const hasVoted = useMemo(() => {
+    if (isHiddenVotes && isCommitPeriod) {
+      return commited;
+    }
+    return hasVotedClassic;
+  }, [isHiddenVotes, isCommitPeriod, commited, hasVotedClassic]);
+
   return (
     <VotingContext.Provider
       value={useMemo(
diff --git a/web/src/pages/Cases/CaseDetails/Voting/Shutter/index.tsx b/web/src/pages/Cases/CaseDetails/Voting/Shutter/index.tsx
index d2821108e..7291efb3d 100644
--- a/web/src/pages/Cases/CaseDetails/Voting/Shutter/index.tsx
+++ b/web/src/pages/Cases/CaseDetails/Voting/Shutter/index.tsx
@@ -26,11 +26,18 @@ const Shutter: React.FC<IShutter> = ({ arbitrable, setIsOpen, dispute, currentPe
   const { isCommitPeriod, isVotingPeriod, commited } = useVotingContext();
   const voteIDs = useMemo(() => drawData?.draws?.map((draw) => draw.voteIDNum) as string[], [drawData]);
 
-  return id && isCommitPeriod && !commited ? (
-    <ShutterCommit {...{ arbitrable, setIsOpen, voteIDs, refetch, dispute, currentPeriodIndex, isGated }} />
-  ) : id && isVotingPeriod ? (
-    <Reveal {...{ setIsOpen, voteIDs, isGated }} />
-  ) : null;
+  const shouldShowCommit = id && isCommitPeriod && !commited;
+  const shouldShowReveal = id && isVotingPeriod;
+
+  if (shouldShowCommit) {
+    return <ShutterCommit {...{ arbitrable, setIsOpen, voteIDs, refetch, dispute, currentPeriodIndex, isGated }} />;
+  }
+
+  if (shouldShowReveal) {
+    return <Reveal {...{ setIsOpen, voteIDs, isGated }} />;
+  }
+
+  return null;
 };
 
 export default Shutter;

From d3a1293d940187f126dc387edca06c31ce234498 Mon Sep 17 00:00:00 2001
From: kemuru <102478601+kemuru@users.noreply.github.com>
Date: Fri, 8 Aug 2025 01:22:33 +0200
Subject: [PATCH 018/175] chore: better return structure

---
 .../Cases/CaseDetails/Voting/Shutter/index.tsx  | 17 ++++++++---------
 1 file changed, 8 insertions(+), 9 deletions(-)

diff --git a/web/src/pages/Cases/CaseDetails/Voting/Shutter/index.tsx b/web/src/pages/Cases/CaseDetails/Voting/Shutter/index.tsx
index 7291efb3d..3000b2872 100644
--- a/web/src/pages/Cases/CaseDetails/Voting/Shutter/index.tsx
+++ b/web/src/pages/Cases/CaseDetails/Voting/Shutter/index.tsx
@@ -29,15 +29,14 @@ const Shutter: React.FC<IShutter> = ({ arbitrable, setIsOpen, dispute, currentPe
   const shouldShowCommit = id && isCommitPeriod && !commited;
   const shouldShowReveal = id && isVotingPeriod;
 
-  if (shouldShowCommit) {
-    return <ShutterCommit {...{ arbitrable, setIsOpen, voteIDs, refetch, dispute, currentPeriodIndex, isGated }} />;
-  }
-
-  if (shouldShowReveal) {
-    return <Reveal {...{ setIsOpen, voteIDs, isGated }} />;
-  }
-
-  return null;
+  return (
+    <>
+      {shouldShowCommit && (
+        <ShutterCommit {...{ arbitrable, setIsOpen, voteIDs, refetch, dispute, currentPeriodIndex, isGated }} />
+      )}
+      {shouldShowReveal && <Reveal {...{ setIsOpen, voteIDs, isGated }} />}
+    </>
+  );
 };
 
 export default Shutter;

From 9d3ba90b245a84ab917b29ef273a19f25eaf39de Mon Sep 17 00:00:00 2001
From: kemuru <102478601+kemuru@users.noreply.github.com>
Date: Fri, 8 Aug 2025 02:05:12 +0200
Subject: [PATCH 019/175] fix: usevotingcontext dynamic disputekit hook calling

---
 web/src/hooks/useVotingContext.tsx | 77 +++++++++++++++++++++++++-----
 1 file changed, 64 insertions(+), 13 deletions(-)

diff --git a/web/src/hooks/useVotingContext.tsx b/web/src/hooks/useVotingContext.tsx
index 456520cd0..4b216807a 100644
--- a/web/src/hooks/useVotingContext.tsx
+++ b/web/src/hooks/useVotingContext.tsx
@@ -3,10 +3,16 @@ import React, { useContext, createContext, useMemo } from "react";
 import { useParams } from "react-router-dom";
 import { useAccount } from "wagmi";
 
-import { REFETCH_INTERVAL } from "consts/index";
-import { useReadDisputeKitClassicIsVoteActive } from "hooks/contracts/generated";
+import { REFETCH_INTERVAL, DisputeKits } from "consts/index";
+import {
+  useReadDisputeKitClassicIsVoteActive,
+  useReadDisputeKitShutterIsVoteActive,
+  useReadDisputeKitGatedIsVoteActive,
+  useReadDisputeKitGatedShutterIsVoteActive,
+} from "hooks/contracts/generated";
 import { useDisputeDetailsQuery } from "hooks/queries/useDisputeDetailsQuery";
 import { useDrawQuery } from "hooks/queries/useDrawQuery";
+import { useDisputeKitAddresses } from "hooks/useDisputeKitAddresses";
 import { isUndefined } from "utils/index";
 
 interface IVotingContext {
@@ -35,14 +41,67 @@ export const VotingContextProvider: React.FC<{ children: React.ReactNode }> = ({
   const { data: drawData, isLoading } = useDrawQuery(address?.toLowerCase(), id, disputeData?.dispute?.currentRound.id);
   const roundId = disputeData?.dispute?.currentRoundIndex;
   const voteId = drawData?.draws?.[0]?.voteIDNum;
-  const { data: hasVotedClassic } = useReadDisputeKitClassicIsVoteActive({
+
+  const disputeKitAddress = disputeData?.dispute?.currentRound?.disputeKit?.address;
+  const { disputeKitName } = useDisputeKitAddresses({ disputeKitAddress });
+
+  const hookArgs = [BigInt(id ?? 0), roundId, voteId] as const;
+  const isEnabled = !isUndefined(roundId) && !isUndefined(voteId);
+
+  // Only call the hook for the specific dispute kit type
+  const classicVoteResult = useReadDisputeKitClassicIsVoteActive({
+    query: {
+      enabled: isEnabled && disputeKitName === DisputeKits.Classic,
+      refetchInterval: REFETCH_INTERVAL,
+    },
+    args: hookArgs,
+  });
+
+  const shutterVoteResult = useReadDisputeKitShutterIsVoteActive({
+    query: {
+      enabled: isEnabled && disputeKitName === DisputeKits.Shutter,
+      refetchInterval: REFETCH_INTERVAL,
+    },
+    args: hookArgs,
+  });
+
+  const gatedVoteResult = useReadDisputeKitGatedIsVoteActive({
     query: {
-      enabled: !isUndefined(roundId) && !isUndefined(voteId),
+      enabled: isEnabled && disputeKitName === DisputeKits.Gated,
       refetchInterval: REFETCH_INTERVAL,
     },
-    args: [BigInt(id ?? 0), roundId, voteId],
+    args: hookArgs,
   });
 
+  const gatedShutterVoteResult = useReadDisputeKitGatedShutterIsVoteActive({
+    query: {
+      enabled: isEnabled && disputeKitName === DisputeKits.GatedShutter,
+      refetchInterval: REFETCH_INTERVAL,
+    },
+    args: hookArgs,
+  });
+
+  const hasVoted = useMemo(() => {
+    switch (disputeKitName) {
+      case DisputeKits.Classic:
+        return classicVoteResult.data;
+      case DisputeKits.Shutter:
+        return shutterVoteResult.data;
+      case DisputeKits.Gated:
+        return gatedVoteResult.data;
+      case DisputeKits.GatedShutter:
+        return gatedShutterVoteResult.data;
+      default:
+        return undefined;
+    }
+  }, [
+    disputeKitName,
+    classicVoteResult.data,
+    shutterVoteResult.data,
+    gatedVoteResult.data,
+    gatedShutterVoteResult.data,
+  ]);
+
   const wasDrawn = useMemo(() => !isUndefined(drawData) && drawData.draws.length > 0, [drawData]);
   const isHiddenVotes = useMemo(() => disputeData?.dispute?.court.hiddenVotes ?? false, [disputeData]);
   const isCommitPeriod = useMemo(() => disputeData?.dispute?.period === "commit", [disputeData]);
@@ -50,14 +109,6 @@ export const VotingContextProvider: React.FC<{ children: React.ReactNode }> = ({
 
   const commited = useMemo(() => !isUndefined(drawData) && drawData?.draws?.[0]?.vote?.commited, [drawData]);
   const commit = useMemo(() => drawData?.draws?.[0]?.vote?.commit, [drawData]);
-
-  const hasVoted = useMemo(() => {
-    if (isHiddenVotes && isCommitPeriod) {
-      return commited;
-    }
-    return hasVotedClassic;
-  }, [isHiddenVotes, isCommitPeriod, commited, hasVotedClassic]);
-
   return (
     <VotingContext.Provider
       value={useMemo(

From 3080c8f14e6c7b040dd53daa4d438bfa62176a88 Mon Sep 17 00:00:00 2001
From: kemuru <102478601+kemuru@users.noreply.github.com>
Date: Fri, 8 Aug 2025 02:09:36 +0200
Subject: [PATCH 020/175] chore: comment tweaking

---
 web/src/hooks/useVotingContext.tsx | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/web/src/hooks/useVotingContext.tsx b/web/src/hooks/useVotingContext.tsx
index 4b216807a..59abeb2f7 100644
--- a/web/src/hooks/useVotingContext.tsx
+++ b/web/src/hooks/useVotingContext.tsx
@@ -48,7 +48,7 @@ export const VotingContextProvider: React.FC<{ children: React.ReactNode }> = ({
   const hookArgs = [BigInt(id ?? 0), roundId, voteId] as const;
   const isEnabled = !isUndefined(roundId) && !isUndefined(voteId);
 
-  // Only call the hook for the specific dispute kit type
+  // Add a hook call for each DisputeKit
   const classicVoteResult = useReadDisputeKitClassicIsVoteActive({
     query: {
       enabled: isEnabled && disputeKitName === DisputeKits.Classic,
@@ -81,6 +81,7 @@ export const VotingContextProvider: React.FC<{ children: React.ReactNode }> = ({
     args: hookArgs,
   });
 
+  // Add a return for each DisputeKit
   const hasVoted = useMemo(() => {
     switch (disputeKitName) {
       case DisputeKits.Classic:

From a8942cd8d135194388cb9aadb8fbaf4bee073cc2 Mon Sep 17 00:00:00 2001
From: kemuru <102478601+kemuru@users.noreply.github.com>
Date: Sat, 9 Aug 2025 22:10:47 +0200
Subject: [PATCH 021/175] fix: add shutter api check

---
 web/src/pages/Cases/CaseDetails/Voting/Shutter/Commit.tsx | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/web/src/pages/Cases/CaseDetails/Voting/Shutter/Commit.tsx b/web/src/pages/Cases/CaseDetails/Voting/Shutter/Commit.tsx
index db7172f74..437bfb3c2 100644
--- a/web/src/pages/Cases/CaseDetails/Voting/Shutter/Commit.tsx
+++ b/web/src/pages/Cases/CaseDetails/Voting/Shutter/Commit.tsx
@@ -85,6 +85,10 @@ const Commit: React.FC<ICommit> = ({
 
   const handleCommit = useCallback(
     async (choice: bigint) => {
+      if (!import.meta.env.REACT_APP_SHUTTER_API) {
+        console.error("REACT_APP_SHUTTER_API environment variable is not set");
+        throw new Error("Cannot commit vote: REACT_APP_SHUTTER_API environment variable is required but not set");
+      }
       const message = { message: saltKey };
       const rawSalt = !isUndefined(signingAccount)
         ? await signingAccount.signMessage(message)

From 89848eaddcd22b8d3a9ac2d66f95ac2613ba9b1b Mon Sep 17 00:00:00 2001
From: kemuru <102478601+kemuru@users.noreply.github.com>
Date: Sat, 9 Aug 2025 22:14:15 +0200
Subject: [PATCH 022/175] chore: check that its not empty too just in case

---
 web/src/pages/Cases/CaseDetails/Voting/Shutter/Commit.tsx | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/web/src/pages/Cases/CaseDetails/Voting/Shutter/Commit.tsx b/web/src/pages/Cases/CaseDetails/Voting/Shutter/Commit.tsx
index 437bfb3c2..28363514f 100644
--- a/web/src/pages/Cases/CaseDetails/Voting/Shutter/Commit.tsx
+++ b/web/src/pages/Cases/CaseDetails/Voting/Shutter/Commit.tsx
@@ -85,8 +85,8 @@ const Commit: React.FC<ICommit> = ({
 
   const handleCommit = useCallback(
     async (choice: bigint) => {
-      if (!import.meta.env.REACT_APP_SHUTTER_API) {
-        console.error("REACT_APP_SHUTTER_API environment variable is not set");
+      if (!import.meta.env.REACT_APP_SHUTTER_API || import.meta.env.REACT_APP_SHUTTER_API.trim() === "") {
+        console.error("REACT_APP_SHUTTER_API environment variable is not set or is empty");
         throw new Error("Cannot commit vote: REACT_APP_SHUTTER_API environment variable is required but not set");
       }
       const message = { message: saltKey };

From b8628bb6df64053f419a14ce1f2325ed644b82e0 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Mon, 11 Aug 2025 22:58:49 +0100
Subject: [PATCH 023/175] fix: coverage script breaking after enabling viaIR

---
 contracts/.solcover.js        | 1 +
 contracts/hardhat.config.ts   | 2 +-
 contracts/scripts/coverage.sh | 1 +
 3 files changed, 3 insertions(+), 1 deletion(-)

diff --git a/contracts/.solcover.js b/contracts/.solcover.js
index d9911ce98..46bc39e3c 100644
--- a/contracts/.solcover.js
+++ b/contracts/.solcover.js
@@ -7,6 +7,7 @@ const shell = require("shelljs");
 module.exports = {
   istanbulReporter: ["lcov"],
   configureYulOptimizer: true,
+  irMinimum: true,
   onCompileComplete: async function (_config) {
     await run("typechain");
   },
diff --git a/contracts/hardhat.config.ts b/contracts/hardhat.config.ts
index be54c9fcb..dc1cce1c6 100644
--- a/contracts/hardhat.config.ts
+++ b/contracts/hardhat.config.ts
@@ -28,7 +28,7 @@ const config: HardhatUserConfig = {
       {
         version: "0.8.30",
         settings: {
-          viaIR: true,
+          viaIR: process.env.VIA_IR !== "false", // Defaults to true
           optimizer: {
             enabled: true,
             runs: 10000,
diff --git a/contracts/scripts/coverage.sh b/contracts/scripts/coverage.sh
index c228fbae5..9a1fc24eb 100755
--- a/contracts/scripts/coverage.sh
+++ b/contracts/scripts/coverage.sh
@@ -21,6 +21,7 @@ fi
 # Generate the Hardhat coverage report
 yarn clean
 echo "Building contracts with Hardhat..."
+export VIA_IR=false
 yarn build
 echo "Running Hardhat coverage..."
 yarn hardhat coverage --solcoverjs ./.solcover.js --temp artifacts --show-stack-traces --testfiles "test/**/*.ts"

From d10251b3088479c456255044a13e9593566810bb Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Tue, 12 Aug 2025 01:36:13 +0100
Subject: [PATCH 024/175] chore: interfaces pragma set to any 0.8 solc version

---
 contracts/src/arbitration/interfaces/IArbitrableV2.sol         | 2 +-
 contracts/src/arbitration/interfaces/IArbitratorV2.sol         | 2 +-
 contracts/src/arbitration/interfaces/IDisputeKit.sol           | 2 +-
 .../src/arbitration/interfaces/IDisputeTemplateRegistry.sol    | 2 +-
 contracts/src/arbitration/interfaces/IEvidence.sol             | 2 +-
 contracts/src/arbitration/interfaces/ISortitionModule.sol      | 3 ++-
 contracts/src/gateway/interfaces/IForeignGateway.sol           | 2 +-
 contracts/src/gateway/interfaces/IHomeGateway.sol              | 2 +-
 contracts/src/rng/IRandomizer.sol                              | 2 +-
 contracts/src/rng/RNG.sol                                      | 2 +-
 10 files changed, 11 insertions(+), 10 deletions(-)

diff --git a/contracts/src/arbitration/interfaces/IArbitrableV2.sol b/contracts/src/arbitration/interfaces/IArbitrableV2.sol
index cba10115e..22dac6e4a 100644
--- a/contracts/src/arbitration/interfaces/IArbitrableV2.sol
+++ b/contracts/src/arbitration/interfaces/IArbitrableV2.sol
@@ -1,6 +1,6 @@
 // SPDX-License-Identifier: MIT
 
-pragma solidity ^0.8.24;
+pragma solidity >=0.8.0 <0.9.0;
 
 import "./IArbitratorV2.sol";
 
diff --git a/contracts/src/arbitration/interfaces/IArbitratorV2.sol b/contracts/src/arbitration/interfaces/IArbitratorV2.sol
index e2e76badb..9559c81b3 100644
--- a/contracts/src/arbitration/interfaces/IArbitratorV2.sol
+++ b/contracts/src/arbitration/interfaces/IArbitratorV2.sol
@@ -1,6 +1,6 @@
 // SPDX-License-Identifier: MIT
 
-pragma solidity ^0.8.24;
+pragma solidity >=0.8.0 <0.9.0;
 
 import "@openzeppelin/contracts/token/ERC20/IERC20.sol";
 import "./IArbitrableV2.sol";
diff --git a/contracts/src/arbitration/interfaces/IDisputeKit.sol b/contracts/src/arbitration/interfaces/IDisputeKit.sol
index 4c8f458cc..423f38e3e 100644
--- a/contracts/src/arbitration/interfaces/IDisputeKit.sol
+++ b/contracts/src/arbitration/interfaces/IDisputeKit.sol
@@ -1,6 +1,6 @@
 // SPDX-License-Identifier: MIT
 
-pragma solidity ^0.8.24;
+pragma solidity >=0.8.0 <0.9.0;
 
 import "./IArbitratorV2.sol";
 
diff --git a/contracts/src/arbitration/interfaces/IDisputeTemplateRegistry.sol b/contracts/src/arbitration/interfaces/IDisputeTemplateRegistry.sol
index 3ce9d522d..23e09f8d5 100644
--- a/contracts/src/arbitration/interfaces/IDisputeTemplateRegistry.sol
+++ b/contracts/src/arbitration/interfaces/IDisputeTemplateRegistry.sol
@@ -1,6 +1,6 @@
 // SPDX-License-Identifier: MIT
 
-pragma solidity ^0.8.24;
+pragma solidity >=0.8.0 <0.9.0;
 
 /// @title IDisputeTemplate
 /// @notice Dispute Template interface.
diff --git a/contracts/src/arbitration/interfaces/IEvidence.sol b/contracts/src/arbitration/interfaces/IEvidence.sol
index 0be6082b5..a7683186a 100644
--- a/contracts/src/arbitration/interfaces/IEvidence.sol
+++ b/contracts/src/arbitration/interfaces/IEvidence.sol
@@ -1,6 +1,6 @@
 // SPDX-License-Identifier: MIT
 
-pragma solidity ^0.8.24;
+pragma solidity >=0.8.0 <0.9.0;
 
 /// @title IEvidence
 interface IEvidence {
diff --git a/contracts/src/arbitration/interfaces/ISortitionModule.sol b/contracts/src/arbitration/interfaces/ISortitionModule.sol
index 183fc331a..5cf10e6ae 100644
--- a/contracts/src/arbitration/interfaces/ISortitionModule.sol
+++ b/contracts/src/arbitration/interfaces/ISortitionModule.sol
@@ -1,5 +1,6 @@
 // SPDX-License-Identifier: MIT
-pragma solidity ^0.8.24;
+
+pragma solidity >=0.8.0 <0.9.0;
 
 import "../../libraries/Constants.sol";
 
diff --git a/contracts/src/gateway/interfaces/IForeignGateway.sol b/contracts/src/gateway/interfaces/IForeignGateway.sol
index 7bdbe0f13..49f51e5de 100644
--- a/contracts/src/gateway/interfaces/IForeignGateway.sol
+++ b/contracts/src/gateway/interfaces/IForeignGateway.sol
@@ -1,6 +1,6 @@
 // SPDX-License-Identifier: MIT
 
-pragma solidity ^0.8.24;
+pragma solidity >=0.8.0 <0.9.0;
 
 import "../../arbitration/interfaces/IArbitratorV2.sol";
 import "@kleros/vea-contracts/src/interfaces/gateways/IReceiverGateway.sol";
diff --git a/contracts/src/gateway/interfaces/IHomeGateway.sol b/contracts/src/gateway/interfaces/IHomeGateway.sol
index 2ccc00ac7..b80f194d6 100644
--- a/contracts/src/gateway/interfaces/IHomeGateway.sol
+++ b/contracts/src/gateway/interfaces/IHomeGateway.sol
@@ -1,6 +1,6 @@
 // SPDX-License-Identifier: MIT
 
-pragma solidity ^0.8.24;
+pragma solidity >=0.8.0 <0.9.0;
 
 import "@openzeppelin/contracts/token/ERC20/IERC20.sol";
 import "@kleros/vea-contracts/src/interfaces/gateways/ISenderGateway.sol";
diff --git a/contracts/src/rng/IRandomizer.sol b/contracts/src/rng/IRandomizer.sol
index ea549ffa4..6a6296f82 100644
--- a/contracts/src/rng/IRandomizer.sol
+++ b/contracts/src/rng/IRandomizer.sol
@@ -1,6 +1,6 @@
 // SPDX-License-Identifier: MIT
 
-pragma solidity ^0.8.24;
+pragma solidity >=0.8.0 <0.9.0;
 
 // Randomizer protocol interface
 interface IRandomizer {
diff --git a/contracts/src/rng/RNG.sol b/contracts/src/rng/RNG.sol
index 5142aa0e5..391da0075 100644
--- a/contracts/src/rng/RNG.sol
+++ b/contracts/src/rng/RNG.sol
@@ -1,6 +1,6 @@
 // SPDX-License-Identifier: MIT
 
-pragma solidity ^0.8.24;
+pragma solidity >=0.8.0 <0.9.0;
 
 interface RNG {
     /// @dev Request a random number.

From 41e899801b26d32f61a103d245a413962f31b0c7 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Tue, 12 Aug 2025 02:08:36 +0100
Subject: [PATCH 025/175] chore: changelog

---
 contracts/CHANGELOG.md | 1 +
 1 file changed, 1 insertion(+)

diff --git a/contracts/CHANGELOG.md b/contracts/CHANGELOG.md
index bfdfafd76..800208b3e 100644
--- a/contracts/CHANGELOG.md
+++ b/contracts/CHANGELOG.md
@@ -10,6 +10,7 @@ The format is based on [Common Changelog](https://common-changelog.org/).
 
 - Set the Hardhat Solidity version to v0.8.30 and enable the IR pipeline ([#2069](https://github.com/kleros/kleros-v2/issues/2069))
 - Set the Foundry Solidity version to v0.8.30 and enable the IR pipeline ([#2073](https://github.com/kleros/kleros-v2/issues/2073))
+- Widen the allowed solc version to any v0.8.x for the interfaces only ([#2083](https://github.com/kleros/kleros-v2/issues/2083))
 - Bump `hardhat` to v2.26.2 ([#2069](https://github.com/kleros/kleros-v2/issues/2069))
 - Bump `@kleros/vea-contracts` to v0.7.0 ([#2073](https://github.com/kleros/kleros-v2/issues/2073))
 

From da7eea1215abaff9460b0b616412bae27e60c360 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Tue, 12 Aug 2025 02:56:50 +0100
Subject: [PATCH 026/175] refactor: minor improvement

---
 contracts/src/rng/IRNG.sol            |  2 +-
 contracts/src/rng/RNGWithFallback.sol | 53 +++++++++++++--------------
 2 files changed, 26 insertions(+), 29 deletions(-)

diff --git a/contracts/src/rng/IRNG.sol b/contracts/src/rng/IRNG.sol
index 0a854484b..152c1f15b 100644
--- a/contracts/src/rng/IRNG.sol
+++ b/contracts/src/rng/IRNG.sol
@@ -8,6 +8,6 @@ interface IRNG {
     function requestRandomness() external;
 
     /// @dev Receive the random number.
-    /// @return randomNumber Random Number. If the number is not ready or has not been required 0 instead.
+    /// @return randomNumber Random number or 0 if not available
     function receiveRandomness() external returns (uint256 randomNumber);
 }
diff --git a/contracts/src/rng/RNGWithFallback.sol b/contracts/src/rng/RNGWithFallback.sol
index 95b635cef..3bd8daed7 100644
--- a/contracts/src/rng/RNGWithFallback.sol
+++ b/contracts/src/rng/RNGWithFallback.sol
@@ -4,7 +4,7 @@ pragma solidity ^0.8.24;
 import "./IRNG.sol";
 
 /// @title RNG with fallback mechanism
-/// @notice Uses multiple RNG implementations with automatic fallback if default RNG does not respond passed a timeout.
+/// @notice Uses a primary RNG implementation with automatic fallback to a Blockhash RNG if the primary RNG does not respond passed a timeout.
 contract RNGWithFallback is IRNG {
     // ************************************* //
     // *             Storage               * //
@@ -54,33 +54,6 @@ contract RNGWithFallback is IRNG {
         _;
     }
 
-    // ************************************* //
-    // *         State Modifiers          * //
-    // ************************************* //
-
-    /// @dev Request a random number from the RNG
-    function requestRandomness() external override onlyByConsumer {
-        requestTimestamp = block.timestamp;
-        rng.requestRandomness();
-    }
-
-    /// @dev Receive the random number with fallback logic
-    /// @return randomNumber Random Number
-    function receiveRandomness() external override onlyByConsumer returns (uint256 randomNumber) {
-        // Try to get random number from the RNG contract
-        randomNumber = rng.receiveRandomness();
-
-        // If we got a valid number, clear the request
-        if (randomNumber != 0) {
-            return randomNumber;
-        } else if (block.timestamp > requestTimestamp + fallbackTimeoutSeconds) {
-            // If the timeout is exceeded, try the fallback
-            randomNumber = uint256(blockhash(block.number - 1));
-            emit RNGFallback();
-        }
-        return randomNumber;
-    }
-
     // ************************************* //
     // *         Governance Functions      * //
     // ************************************* //
@@ -103,4 +76,28 @@ contract RNGWithFallback is IRNG {
         fallbackTimeoutSeconds = _fallbackTimeoutSeconds;
         emit FallbackTimeoutChanged(_fallbackTimeoutSeconds);
     }
+
+    // ************************************* //
+    // *         State Modifiers          * //
+    // ************************************* //
+
+    /// @dev Request a random number from the primary RNG
+    /// @dev The consumer is trusted not to make concurrent requests.
+    function requestRandomness() external override onlyByConsumer {
+        requestTimestamp = block.timestamp;
+        rng.requestRandomness();
+    }
+
+    /// @dev Receive the random number from the primary RNG with fallback to the blockhash RNG if the primary RNG does not respond passed a timeout.
+    /// @return randomNumber Random number or 0 if not available
+    function receiveRandomness() external override onlyByConsumer returns (uint256 randomNumber) {
+        randomNumber = rng.receiveRandomness();
+
+        // If we didn't get a random number and the timeout is exceeded, try the fallback
+        if (randomNumber == 0 && block.timestamp > requestTimestamp + fallbackTimeoutSeconds) {
+            randomNumber = uint256(blockhash(block.number - 1));
+            emit RNGFallback();
+        }
+        return randomNumber;
+    }
 }

From a8f34152e4c329c054c2efc6cff6353006134589 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Tue, 12 Aug 2025 03:48:50 +0100
Subject: [PATCH 027/175] chore: deployment script support for RNGWithFallback

---
 contracts/deploy/00-ethereum-pnk.ts           | 31 ------------
 .../deploy/00-home-chain-arbitration-neo.ts   | 22 +++++---
 contracts/deploy/00-home-chain-arbitration.ts | 16 +++---
 contracts/deploy/00-home-chain-pnk-faucet.ts  | 36 -------------
 contracts/deploy/00-home-chain-resolver.ts    |  3 +-
 ...0-chainlink-rng.ts => 00-rng-chainlink.ts} | 33 ++++++++++--
 ...randomizer-rng.ts => 00-rng-randomizer.ts} | 32 ++++++++++--
 contracts/deploy/00-rng.ts                    | 50 -------------------
 ... => change-arbitrable-dispute-template.ts} |  0
 contracts/test/rng/index.ts                   | 11 +++-
 10 files changed, 91 insertions(+), 143 deletions(-)
 delete mode 100644 contracts/deploy/00-ethereum-pnk.ts
 delete mode 100644 contracts/deploy/00-home-chain-pnk-faucet.ts
 rename contracts/deploy/{00-chainlink-rng.ts => 00-rng-chainlink.ts} (76%)
 rename contracts/deploy/{00-randomizer-rng.ts => 00-rng-randomizer.ts} (54%)
 delete mode 100644 contracts/deploy/00-rng.ts
 rename contracts/deploy/{05-arbitrable-dispute-template.ts => change-arbitrable-dispute-template.ts} (100%)

diff --git a/contracts/deploy/00-ethereum-pnk.ts b/contracts/deploy/00-ethereum-pnk.ts
deleted file mode 100644
index 85c674fb7..000000000
--- a/contracts/deploy/00-ethereum-pnk.ts
+++ /dev/null
@@ -1,31 +0,0 @@
-import { HardhatRuntimeEnvironment } from "hardhat/types";
-import { DeployFunction } from "hardhat-deploy/types";
-import { ForeignChains, HardhatChain, isSkipped } from "./utils";
-
-enum Chains {
-  SEPOLIA = ForeignChains.ETHEREUM_SEPOLIA,
-  HARDHAT = HardhatChain.HARDHAT,
-}
-
-const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment) => {
-  const { deployments, getNamedAccounts, getChainId } = hre;
-  const { deploy } = deployments;
-
-  // fallback to hardhat node signers on local network
-  const deployer = (await getNamedAccounts()).deployer ?? (await hre.ethers.getSigners())[0].address;
-  const chainId = Number(await getChainId());
-  console.log("deploying to %s with deployer %s", Chains[chainId], deployer);
-
-  await deploy("PinakionV2", {
-    from: deployer,
-    args: [],
-    log: true,
-  });
-};
-
-deployArbitration.tags = ["Pinakion"];
-deployArbitration.skip = async ({ network }) => {
-  return isSkipped(network, !Chains[network.config.chainId ?? 0]);
-};
-
-export default deployArbitration;
diff --git a/contracts/deploy/00-home-chain-arbitration-neo.ts b/contracts/deploy/00-home-chain-arbitration-neo.ts
index 8d291d570..68672b841 100644
--- a/contracts/deploy/00-home-chain-arbitration-neo.ts
+++ b/contracts/deploy/00-home-chain-arbitration-neo.ts
@@ -6,7 +6,7 @@ import { changeCurrencyRate } from "./utils/klerosCoreHelper";
 import { HomeChains, isSkipped, isDevnet, PNK, ETH } from "./utils";
 import { getContractOrDeploy, getContractOrDeployUpgradable } from "./utils/getContractOrDeploy";
 import { deployERC20AndFaucet, deployERC721 } from "./utils/deployTokens";
-import { ChainlinkRNG, DisputeKitClassic, KlerosCoreNeo } from "../typechain-types";
+import { ChainlinkRNG, DisputeKitClassic, KlerosCoreNeo, RNGWithFallback } from "../typechain-types";
 
 const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment) => {
   const { ethers, deployments, getNamedAccounts, getChainId } = hre;
@@ -44,12 +44,20 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
   const devnet = isDevnet(hre.network);
   const minStakingTime = devnet ? 180 : 1800;
   const maxFreezingTime = devnet ? 600 : 1800;
-  const rng = (await ethers.getContract("ChainlinkRNG")) as ChainlinkRNG;
+  const rngWithFallback = await ethers.getContract<RNGWithFallback>("RNGWithFallback");
   const maxStakePerJuror = PNK(2_000);
   const maxTotalStaked = PNK(2_000_000);
   const sortitionModule = await deployUpgradable(deployments, "SortitionModuleNeo", {
     from: deployer,
-    args: [deployer, klerosCoreAddress, minStakingTime, maxFreezingTime, rng.target, maxStakePerJuror, maxTotalStaked],
+    args: [
+      deployer,
+      klerosCoreAddress,
+      minStakingTime,
+      maxFreezingTime,
+      rngWithFallback.target,
+      maxStakePerJuror,
+      maxTotalStaked,
+    ],
     log: true,
   }); // nonce (implementation), nonce+1 (proxy)
 
@@ -84,11 +92,11 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
     await disputeKitContract.changeCore(klerosCore.address);
   }
 
-  // rng.changeConsumer() only if necessary
-  const rngConsumer = await rng.consumer();
+  // rngWithFallback.changeConsumer() only if necessary
+  const rngConsumer = await rngWithFallback.consumer();
   if (rngConsumer !== sortitionModule.address) {
-    console.log(`rng.changeConsumer(${sortitionModule.address})`);
-    await rng.changeConsumer(sortitionModule.address);
+    console.log(`rngWithFallback.changeConsumer(${sortitionModule.address})`);
+    await rngWithFallback.changeConsumer(sortitionModule.address);
   }
 
   const core = (await hre.ethers.getContract("KlerosCoreNeo")) as KlerosCoreNeo;
diff --git a/contracts/deploy/00-home-chain-arbitration.ts b/contracts/deploy/00-home-chain-arbitration.ts
index 80e1bd506..6bd763a88 100644
--- a/contracts/deploy/00-home-chain-arbitration.ts
+++ b/contracts/deploy/00-home-chain-arbitration.ts
@@ -6,7 +6,7 @@ import { changeCurrencyRate } from "./utils/klerosCoreHelper";
 import { HomeChains, isSkipped, isDevnet, PNK, ETH, Courts } from "./utils";
 import { getContractOrDeploy, getContractOrDeployUpgradable } from "./utils/getContractOrDeploy";
 import { deployERC20AndFaucet } from "./utils/deployTokens";
-import { ChainlinkRNG, DisputeKitClassic, KlerosCore } from "../typechain-types";
+import { ChainlinkRNG, DisputeKitClassic, KlerosCore, RNGWithFallback } from "../typechain-types";
 
 const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment) => {
   const { ethers, deployments, getNamedAccounts, getChainId } = hre;
@@ -49,10 +49,10 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
   const devnet = isDevnet(hre.network);
   const minStakingTime = devnet ? 180 : 1800;
   const maxFreezingTime = devnet ? 600 : 1800;
-  const rng = (await ethers.getContract("ChainlinkRNG")) as ChainlinkRNG;
+  const rngWithFallback = await ethers.getContract<RNGWithFallback>("RNGWithFallback");
   const sortitionModule = await deployUpgradable(deployments, "SortitionModule", {
     from: deployer,
-    args: [deployer, klerosCoreAddress, minStakingTime, maxFreezingTime, rng.target],
+    args: [deployer, klerosCoreAddress, minStakingTime, maxFreezingTime, rngWithFallback.target],
     log: true,
   }); // nonce (implementation), nonce+1 (proxy)
 
@@ -79,18 +79,18 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
   }); // nonce+2 (implementation), nonce+3 (proxy)
 
   // disputeKit.changeCore() only if necessary
-  const disputeKitContract = (await ethers.getContract("DisputeKitClassic")) as DisputeKitClassic;
+  const disputeKitContract = await ethers.getContract<DisputeKitClassic>("DisputeKitClassic");
   const currentCore = await disputeKitContract.core();
   if (currentCore !== klerosCore.address) {
     console.log(`disputeKit.changeCore(${klerosCore.address})`);
     await disputeKitContract.changeCore(klerosCore.address);
   }
 
-  // rng.changeConsumer() only if necessary
-  const rngConsumer = await rng.consumer();
+  // rngWithFallback.changeConsumer() only if necessary
+  const rngConsumer = await rngWithFallback.consumer();
   if (rngConsumer !== sortitionModule.address) {
-    console.log(`rng.changeConsumer(${sortitionModule.address})`);
-    await rng.changeConsumer(sortitionModule.address);
+    console.log(`rngWithFallback.changeConsumer(${sortitionModule.address})`);
+    await rngWithFallback.changeConsumer(sortitionModule.address);
   }
 
   const core = (await hre.ethers.getContract("KlerosCore")) as KlerosCore;
diff --git a/contracts/deploy/00-home-chain-pnk-faucet.ts b/contracts/deploy/00-home-chain-pnk-faucet.ts
deleted file mode 100644
index e10eb93bf..000000000
--- a/contracts/deploy/00-home-chain-pnk-faucet.ts
+++ /dev/null
@@ -1,36 +0,0 @@
-import { HardhatRuntimeEnvironment } from "hardhat/types";
-import { DeployFunction } from "hardhat-deploy/types";
-import { HomeChains, isSkipped } from "./utils";
-
-const pnkByChain = new Map<HomeChains, string>([
-  [HomeChains.ARBITRUM_ONE, "0x330bD769382cFc6d50175903434CCC8D206DCAE5"],
-  [HomeChains.ARBITRUM_SEPOLIA, "INSERT ARBITRUM SEPOLIA PNK TOKEN ADDRESS HERE"],
-]);
-
-const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment) => {
-  const { deployments, getNamedAccounts, getChainId } = hre;
-  const { deploy, execute } = deployments;
-
-  // fallback to hardhat node signers on local network
-  const deployer = (await getNamedAccounts()).deployer ?? (await hre.ethers.getSigners())[0].address;
-  const chainId = Number(await getChainId());
-  console.log("deploying to %s with deployer %s", HomeChains[chainId], deployer);
-
-  const pnkAddress = pnkByChain.get(chainId);
-  if (pnkAddress) {
-    await deploy("PNKFaucet", {
-      from: deployer,
-      contract: "Faucet",
-      args: [pnkAddress],
-      log: true,
-    });
-    await execute("PNKFaucet", { from: deployer, log: true }, "changeAmount", hre.ethers.parseUnits("10000", "ether"));
-  }
-};
-
-deployArbitration.tags = ["PnkFaucet"];
-deployArbitration.skip = async ({ network }) => {
-  return isSkipped(network, !HomeChains[network.config.chainId ?? 0]);
-};
-
-export default deployArbitration;
diff --git a/contracts/deploy/00-home-chain-resolver.ts b/contracts/deploy/00-home-chain-resolver.ts
index 5aa5e7b20..64d3431f6 100644
--- a/contracts/deploy/00-home-chain-resolver.ts
+++ b/contracts/deploy/00-home-chain-resolver.ts
@@ -1,6 +1,7 @@
 import { HardhatRuntimeEnvironment } from "hardhat/types";
 import { DeployFunction } from "hardhat-deploy/types";
 import { HomeChains, isSkipped } from "./utils";
+import { getContractOrDeploy } from "./utils/getContractOrDeploy";
 
 const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment) => {
   const { deployments, getNamedAccounts, getChainId } = hre;
@@ -14,7 +15,7 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
   const klerosCore = await deployments.get("KlerosCore");
   const disputeTemplateRegistry = await deployments.get("DisputeTemplateRegistry");
 
-  await deploy("DisputeResolver", {
+  await getContractOrDeploy(hre, "DisputeResolver", {
     from: deployer,
     args: [klerosCore.address, disputeTemplateRegistry.address],
     log: true,
diff --git a/contracts/deploy/00-chainlink-rng.ts b/contracts/deploy/00-rng-chainlink.ts
similarity index 76%
rename from contracts/deploy/00-chainlink-rng.ts
rename to contracts/deploy/00-rng-chainlink.ts
index a811f642b..78a1c5e87 100644
--- a/contracts/deploy/00-chainlink-rng.ts
+++ b/contracts/deploy/00-rng-chainlink.ts
@@ -2,10 +2,10 @@ import { HardhatRuntimeEnvironment } from "hardhat/types";
 import { DeployFunction } from "hardhat-deploy/types";
 import { HomeChains, isSkipped } from "./utils";
 import { getContractOrDeploy } from "./utils/getContractOrDeploy";
+import { RNGWithFallback } from "../typechain-types";
 
 const deployRng: DeployFunction = async (hre: HardhatRuntimeEnvironment) => {
-  const { deployments, getNamedAccounts, getChainId } = hre;
-  const { deploy } = deployments;
+  const { getNamedAccounts, getChainId, ethers } = hre;
 
   // fallback to hardhat node signers on local network
   const deployer = (await getNamedAccounts()).deployer ?? (await hre.ethers.getSigners())[0].address;
@@ -57,11 +57,16 @@ const deployRng: DeployFunction = async (hre: HardhatRuntimeEnvironment) => {
   const requestConfirmations = 200; // between 1 and 200 L2 blocks
   const callbackGasLimit = 100000;
 
-  await deploy("ChainlinkRNG", {
+  const oldRng = await ethers.getContractOrNull("ChainlinkRNG");
+  if (!oldRng) {
+    console.log("Register this Chainlink consumer here: http://vrf.chain.link/");
+  }
+
+  const rng = await getContractOrDeploy(hre, "ChainlinkRNG", {
     from: deployer,
     args: [
       deployer,
-      deployer, // The consumer is configured as the SortitionModule later
+      deployer, // The consumer is configured as the RNGWithFallback later
       ChainlinkVRFCoordinator.target,
       keyHash,
       subscriptionId,
@@ -71,7 +76,25 @@ const deployRng: DeployFunction = async (hre: HardhatRuntimeEnvironment) => {
     log: true,
   });
 
-  console.log("Register this Chainlink consumer here: http://vrf.chain.link/");
+  const fallbackTimeoutSeconds = 30 * 60; // 30 minutes
+  await getContractOrDeploy(hre, "RNGWithFallback", {
+    from: deployer,
+    args: [
+      deployer,
+      deployer, // The consumer is configured as the SortitionModule later
+      fallbackTimeoutSeconds,
+      rng.target,
+    ],
+    log: true,
+  });
+
+  // rng.changeConsumer() only if necessary
+  const rngWithFallback = await ethers.getContract<RNGWithFallback>("RNGWithFallback");
+  const rngConsumer = await rng.consumer();
+  if (rngConsumer !== rngWithFallback.target) {
+    console.log(`rng.changeConsumer(${rngWithFallback.target})`);
+    await rng.changeConsumer(rngWithFallback.target);
+  }
 };
 
 deployRng.tags = ["ChainlinkRNG"];
diff --git a/contracts/deploy/00-randomizer-rng.ts b/contracts/deploy/00-rng-randomizer.ts
similarity index 54%
rename from contracts/deploy/00-randomizer-rng.ts
rename to contracts/deploy/00-rng-randomizer.ts
index c28dc3cda..8413b39f6 100644
--- a/contracts/deploy/00-randomizer-rng.ts
+++ b/contracts/deploy/00-rng-randomizer.ts
@@ -2,10 +2,10 @@ import { HardhatRuntimeEnvironment } from "hardhat/types";
 import { DeployFunction } from "hardhat-deploy/types";
 import { HomeChains, isSkipped } from "./utils";
 import { getContractOrDeploy } from "./utils/getContractOrDeploy";
+import { RNGWithFallback } from "../typechain-types";
 
 const deployRng: DeployFunction = async (hre: HardhatRuntimeEnvironment) => {
-  const { deployments, getNamedAccounts, getChainId } = hre;
-  const { deploy } = deployments;
+  const { getNamedAccounts, getChainId, ethers } = hre;
 
   // fallback to hardhat node signers on local network
   const deployer = (await getNamedAccounts()).deployer ?? (await hre.ethers.getSigners())[0].address;
@@ -20,11 +20,35 @@ const deployRng: DeployFunction = async (hre: HardhatRuntimeEnvironment) => {
     log: true,
   });
 
-  await getContractOrDeploy(hre, "RandomizerRNG", {
+  const rng = await getContractOrDeploy(hre, "RandomizerRNG", {
     from: deployer,
-    args: [deployer, deployer, randomizerOracle.target], // The consumer is configured as the SortitionModule later
+    args: [
+      deployer,
+      deployer, // The consumer is configured as the RNGWithFallback later
+      randomizerOracle.target,
+    ],
     log: true,
   });
+
+  const fallbackTimeoutSeconds = 30 * 60; // 30 minutes
+  await getContractOrDeploy(hre, "RNGWithFallback", {
+    from: deployer,
+    args: [
+      deployer,
+      deployer, // The consumer is configured as the SortitionModule later
+      fallbackTimeoutSeconds,
+      rng.target,
+    ],
+    log: true,
+  });
+
+  // rng.changeConsumer() only if necessary
+  const rngWithFallback = await ethers.getContract<RNGWithFallback>("RNGWithFallback");
+  const rngConsumer = await rng.consumer();
+  if (rngConsumer !== rngWithFallback.target) {
+    console.log(`rng.changeConsumer(${rngWithFallback.target})`);
+    await rng.changeConsumer(rngWithFallback.target);
+  }
 };
 
 deployRng.tags = ["RandomizerRNG"];
diff --git a/contracts/deploy/00-rng.ts b/contracts/deploy/00-rng.ts
deleted file mode 100644
index 5eedf19b2..000000000
--- a/contracts/deploy/00-rng.ts
+++ /dev/null
@@ -1,50 +0,0 @@
-import { HardhatRuntimeEnvironment } from "hardhat/types";
-import { DeployFunction } from "hardhat-deploy/types";
-import { SortitionModule } from "../typechain-types";
-import { HomeChains, isMainnet, isSkipped } from "./utils";
-import { getContractOrDeploy } from "./utils/getContractOrDeploy";
-
-const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment) => {
-  const { deployments, getNamedAccounts, getChainId, ethers } = hre;
-  const { deploy } = deployments;
-  const RNG_LOOKAHEAD_TIME = 30 * 60; // 30 minutes in seconds
-
-  // fallback to hardhat node signers on local network
-  const deployer = (await getNamedAccounts()).deployer ?? (await hre.ethers.getSigners())[0].address;
-  const chainId = Number(await getChainId());
-  console.log("deploying to %s with deployer %s", HomeChains[chainId], deployer);
-
-  const sortitionModule = (await ethers.getContract("SortitionModuleNeo")) as SortitionModule;
-
-  const randomizerOracle = await getContractOrDeploy(hre, "RandomizerOracle", {
-    from: deployer,
-    contract: "RandomizerMock",
-    args: [],
-    log: true,
-  });
-
-  const rng1 = await deploy("RandomizerRNG", {
-    from: deployer,
-    args: [deployer, sortitionModule.target, randomizerOracle.address],
-    log: true,
-  });
-
-  const rng2 = await deploy("BlockHashRNG", {
-    from: deployer,
-    args: [
-      deployer, // governor
-      sortitionModule.target, // consumer
-      RNG_LOOKAHEAD_TIME,
-    ],
-    log: true,
-  });
-
-  await sortitionModule.changeRandomNumberGenerator(rng2.address);
-};
-
-deployArbitration.tags = ["RNG"];
-deployArbitration.skip = async ({ network }) => {
-  return isSkipped(network, isMainnet(network));
-};
-
-export default deployArbitration;
diff --git a/contracts/deploy/05-arbitrable-dispute-template.ts b/contracts/deploy/change-arbitrable-dispute-template.ts
similarity index 100%
rename from contracts/deploy/05-arbitrable-dispute-template.ts
rename to contracts/deploy/change-arbitrable-dispute-template.ts
diff --git a/contracts/test/rng/index.ts b/contracts/test/rng/index.ts
index 5e74b4a3a..3bb50fd7c 100644
--- a/contracts/test/rng/index.ts
+++ b/contracts/test/rng/index.ts
@@ -1,5 +1,5 @@
 import { expect } from "chai";
-import { deployments, ethers, network } from "hardhat";
+import { deployments, ethers, getNamedAccounts, network } from "hardhat";
 import {
   IncrementalNG,
   BlockHashRNG,
@@ -11,6 +11,7 @@ import {
 
 const initialNg = 424242;
 const abiCoder = ethers.AbiCoder.defaultAbiCoder();
+let deployer: string;
 
 describe("IncrementalNG", async () => {
   let rng: IncrementalNG;
@@ -85,12 +86,16 @@ describe("ChainlinkRNG", async () => {
   let vrfCoordinator: ChainlinkVRFCoordinatorV2Mock;
 
   beforeEach("Setup", async () => {
+    ({ deployer } = await getNamedAccounts());
+
     await deployments.fixture(["ChainlinkRNG"], {
       fallbackToGlobal: true,
       keepExistingDeployments: false,
     });
     rng = (await ethers.getContract("ChainlinkRNG")) as ChainlinkRNG;
     vrfCoordinator = (await ethers.getContract("ChainlinkVRFCoordinator")) as ChainlinkVRFCoordinatorV2Mock;
+
+    await rng.changeConsumer(deployer);
   });
 
   it("Should return a non-zero random number", async () => {
@@ -144,12 +149,16 @@ describe("RandomizerRNG", async () => {
   let randomizer: RandomizerMock;
 
   beforeEach("Setup", async () => {
+    ({ deployer } = await getNamedAccounts());
+
     await deployments.fixture(["RandomizerRNG"], {
       fallbackToGlobal: true,
       keepExistingDeployments: false,
     });
     rng = (await ethers.getContract("RandomizerRNG")) as RandomizerRNG;
     randomizer = (await ethers.getContract("RandomizerOracle")) as RandomizerMock;
+
+    await rng.changeConsumer(deployer);
   });
 
   it("Should return a non-zero random number", async () => {

From 78b31699e707aa7f9c6c4be7aa542b78b5220cb0 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Tue, 12 Aug 2025 17:56:24 +0100
Subject: [PATCH 028/175] docs: metrics for upcoming audit

---
 contracts/audit/METRICS.md           | 681 +++++++++++++++++++++++++++
 contracts/scripts/generateMetrics.sh |  23 +
 2 files changed, 704 insertions(+)
 create mode 100644 contracts/audit/METRICS.md
 create mode 100755 contracts/scripts/generateMetrics.sh

diff --git a/contracts/audit/METRICS.md b/contracts/audit/METRICS.md
new file mode 100644
index 000000000..1a1a40ea3
--- /dev/null
+++ b/contracts/audit/METRICS.md
@@ -0,0 +1,681 @@
+[<img width="200" alt="get in touch with Consensys Diligence" src="https://user-images.githubusercontent.com/2865694/56826101-91dcf380-685b-11e9-937c-af49c2510aa0.png">](https://consensys.io/diligence)<br/>
+<sup>
+[[ 🌐 ](https://consensys.io/diligence) [ 📩 ](mailto:diligence@consensys.net) [ 🔥 ](https://consensys.io/diligence/tools/)]
+</sup><br/><br/>
+
+# Solidity Metrics for 'CLI'
+
+## Table of contents
+
+- [Scope](#t-scope)
+  - [Source Units in Scope](#t-source-Units-in-Scope)
+    - [Deployable Logic Contracts](#t-deployable-contracts)
+  - [Out of Scope](#t-out-of-scope)
+    - [Excluded Source Units](#t-out-of-scope-excluded-source-units)
+    - [Duplicate Source Units](#t-out-of-scope-duplicate-source-units)
+    - [Doppelganger Contracts](#t-out-of-scope-doppelganger-contracts)
+- [Report Overview](#t-report)
+  - [Risk Summary](#t-risk)
+  - [Source Lines](#t-source-lines)
+  - [Inline Documentation](#t-inline-documentation)
+  - [Components](#t-components)
+  - [Exposed Functions](#t-exposed-functions)
+  - [StateVariables](#t-statevariables)
+  - [Capabilities](#t-capabilities)
+  - [Dependencies](#t-package-imports)
+  - [Totals](#t-totals)
+
+## <span id=t-scope>Scope</span>
+
+This section lists files that are in scope for the metrics report.
+
+- **Project:** `'CLI'`
+- **Included Files:**
+  - ``
+- **Excluded Paths:**
+  - ``
+- **File Limit:** `undefined`
+
+  - **Exclude File list Limit:** `undefined`
+
+- **Workspace Repository:** `unknown` (`undefined`@`undefined`)
+
+### <span id=t-source-Units-in-Scope>Source Units in Scope</span>
+
+Source Units Analyzed: **`31`**<br>
+Source Units in Scope: **`31`** (**100%**)
+
+| Type     | File                                                      | Logic Contracts | Interfaces | Lines    | nLines   | nSLOC    | Comment Lines | Complex. Score | Capabilities                                                                                                                                                                                                                                                                                     |
+| -------- | --------------------------------------------------------- | --------------- | ---------- | -------- | -------- | -------- | ------------- | -------------- | ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ |
+| 📝       | src/arbitration/KlerosCore.sol                            | 1               | \*\*\*\*   | 75       | 63       | 28       | 26            | 13             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
+| 🎨       | src/arbitration/KlerosCoreBase.sol                        | 1               | \*\*\*\*   | 1211     | 1162     | 809      | 286           | 449            | **<abbr title='Uses Assembly'>🖥</abbr><abbr title='Payable Functions'>💰</abbr>**                                                                                                                                                                                                               |
+| 📝       | src/arbitration/KlerosCoreNeo.sol                         | 1               | \*\*\*\*   | 142      | 124      | 55       | 51            | 36             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
+| 📝       | src/arbitration/PolicyRegistry.sol                        | 1               | \*\*\*\*   | 88       | 88       | 30       | 41            | 24             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
+| 📝       | src/arbitration/SortitionModule.sol                       | 1               | \*\*\*\*   | 50       | 44       | 15       | 20            | 13             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
+| 🎨       | src/arbitration/SortitionModuleBase.sol                   | 1               | \*\*\*\*   | 689      | 645      | 393      | 205           | 300            | **<abbr title='Uses Assembly'>🖥</abbr><abbr title='Uses Hash-Functions'>🧮</abbr>**                                                                                                                                                                                                             |
+| 📝       | src/arbitration/SortitionModuleNeo.sol                    | 1               | \*\*\*\*   | 103      | 91       | 48       | 28            | 31             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
+| 📝       | src/arbitration/arbitrables/DisputeResolver.sol           | 1               | \*\*\*\*   | 149      | 134      | 72       | 50            | 43             | **<abbr title='Payable Functions'>💰</abbr>**                                                                                                                                                                                                                                                    |
+| 📝       | src/arbitration/DisputeTemplateRegistry.sol               | 1               | \*\*\*\*   | 83       | 79       | 30       | 33            | 25             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
+| 📝       | src/arbitration/dispute-kits/DisputeKitClassic.sol        | 1               | \*\*\*\*   | 46       | 46       | 16       | 21            | 13             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
+| 🎨       | src/arbitration/dispute-kits/DisputeKitClassicBase.sol    | 1               | \*\*\*\*   | 713      | 632      | 365      | 225           | 192            | **<abbr title='Payable Functions'>💰</abbr><abbr title='Uses Hash-Functions'>🧮</abbr>**                                                                                                                                                                                                         |
+| 📝🔍     | src/arbitration/dispute-kits/DisputeKitGated.sol          | 1               | 2          | 117      | 99       | 39       | 51            | 57             | **<abbr title='Uses Assembly'>🖥</abbr><abbr title='doppelganger(IBalanceHolderERC1155)'>🔆</abbr>**                                                                                                                                                                                             |
+| 📝🔍     | src/arbitration/dispute-kits/DisputeKitGatedShutter.sol   | 1               | 2          | 194      | 159      | 59       | 84            | 69             | **<abbr title='Uses Assembly'>🖥</abbr><abbr title='Uses Hash-Functions'>🧮</abbr><abbr title='doppelganger(IBalanceHolderERC1155)'>🔆</abbr>**                                                                                                                                                  |
+| 📝       | src/arbitration/dispute-kits/DisputeKitShutter.sol        | 1               | \*\*\*\*   | 123      | 107      | 36       | 54            | 27             | **<abbr title='Uses Hash-Functions'>🧮</abbr>**                                                                                                                                                                                                                                                  |
+| 📝🔍     | src/arbitration/dispute-kits/DisputeKitSybilResistant.sol | 1               | 1          | 76       | 58       | 20       | 33            | 16             | **<abbr title='doppelganger(IProofOfHumanity)'>🔆</abbr>**                                                                                                                                                                                                                                       |
+| 📝       | src/arbitration/evidence/EvidenceModule.sol               | 1               | \*\*\*\*   | 70       | 70       | 26       | 30            | 21             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
+| 🔍       | src/arbitration/interfaces/IArbitrableV2.sol              | \*\*\*\*        | 1          | 40       | 39       | 12       | 22            | 3              | \*\*\*\*                                                                                                                                                                                                                                                                                         |
+| 🔍       | src/arbitration/interfaces/IArbitratorV2.sol              | \*\*\*\*        | 1          | 83       | 44       | 9        | 50            | 14             | **<abbr title='Payable Functions'>💰</abbr>**                                                                                                                                                                                                                                                    |
+| 🔍       | src/arbitration/interfaces/IDisputeKit.sol                | \*\*\*\*        | 1          | 128      | 39       | 11       | 60            | 23             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
+| 🔍       | src/arbitration/interfaces/IDisputeTemplateRegistry.sol   | \*\*\*\*        | 1          | 25       | 20       | 9        | 8             | 3              | \*\*\*\*                                                                                                                                                                                                                                                                                         |
+| 🔍       | src/arbitration/interfaces/IEvidence.sol                  | \*\*\*\*        | 1          | 12       | 12       | 4        | 6             | 1              | \*\*\*\*                                                                                                                                                                                                                                                                                         |
+| 🔍       | src/arbitration/interfaces/ISortitionModule.sol           | \*\*\*\*        | 1          | 63       | 16       | 10       | 4             | 33             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
+|          | src/libraries/Constants.sol                               | \*\*\*\*        | \*\*\*\*   | 39       | 39       | 26       | 13            | 2              | \*\*\*\*                                                                                                                                                                                                                                                                                         |
+| 📚       | src/libraries/SafeERC20.sol                               | 1               | \*\*\*\*   | 47       | 47       | 18       | 24            | 12             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
+| 📚🔍     | src/libraries/SafeSend.sol                                | 1               | 1          | 24       | 19       | 9        | 7             | 15             | **<abbr title='Payable Functions'>💰</abbr><abbr title='Initiates ETH Value Transfer'>📤</abbr>**                                                                                                                                                                                                |
+| 📝       | src/rng/RNGWithFallback.sol                               | 1               | \*\*\*\*   | 103      | 103      | 48       | 41            | 35             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
+| 📝       | src/rng/ChainlinkRNG.sol                                  | 1               | \*\*\*\*   | 173      | 173      | 85       | 70            | 50             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
+| 🔍       | src/rng/IRNG.sol                                          | \*\*\*\*        | 1          | 13       | 8        | 3        | 5             | 5              | \*\*\*\*                                                                                                                                                                                                                                                                                         |
+| 🎨       | src/proxy/UUPSProxiable.sol                               | 1               | \*\*\*\*   | 140      | 122      | 44       | 71            | 46             | **<abbr title='Uses Assembly'>🖥</abbr><abbr title='Payable Functions'>💰</abbr><abbr title='DelegateCall'>👥</abbr><abbr title='TryCatch Blocks'>♻️</abbr>**                                                                                                                                    |
+| 📝       | src/proxy/UUPSProxy.sol                                   | 1               | \*\*\*\*   | 90       | 90       | 38       | 37            | 65             | **<abbr title='Uses Assembly'>🖥</abbr><abbr title='Payable Functions'>💰</abbr><abbr title='DelegateCall'>👥</abbr>**                                                                                                                                                                           |
+| 🎨       | src/proxy/Initializable.sol                               | 1               | \*\*\*\*   | 215      | 215      | 70       | 128           | 31             | **<abbr title='Uses Assembly'>🖥</abbr>**                                                                                                                                                                                                                                                        |
+| 📝📚🔍🎨 | **Totals**                                                | **23**          | **13**     | **5124** | **4587** | **2437** | **1784**      | **1667**       | **<abbr title='Uses Assembly'>🖥</abbr><abbr title='Payable Functions'>💰</abbr><abbr title='Initiates ETH Value Transfer'>📤</abbr><abbr title='DelegateCall'>👥</abbr><abbr title='Uses Hash-Functions'>🧮</abbr><abbr title='doppelganger'>🔆</abbr><abbr title='TryCatch Blocks'>♻️</abbr>** |
+
+<sub>
+Legend: <a onclick="toggleVisibility('table-legend', this)">[➕]</a>
+<div id="table-legend" style="display:none">
+
+<ul>
+<li> <b>Lines</b>: total lines of the source unit </li>
+<li> <b>nLines</b>: normalized lines of the source unit (e.g. normalizes functions spanning multiple lines) </li>
+<li> <b>nSLOC</b>: normalized source lines of code (only source-code lines; no comments, no blank lines) </li>
+<li> <b>Comment Lines</b>: lines containing single or block comments </li>
+<li> <b>Complexity Score</b>: a custom complexity score derived from code statements that are known to introduce code complexity (branches, loops, calls, external interfaces, ...) </li>
+</ul>
+
+</div>
+</sub>
+
+##### <span id=t-deployable-contracts>Deployable Logic Contracts</span>
+
+Total: 16
+
+- 📝 `KlerosCore`
+- 📝 `KlerosCoreNeo`
+- 📝 `PolicyRegistry`
+- 📝 `SortitionModule`
+- 📝 `SortitionModuleNeo`
+- <a onclick="toggleVisibility('deployables', this)">[➕]</a>
+<div id="deployables" style="display:none">
+<ul>
+<li> 📝 <code>DisputeResolver</code></li>
+<li> 📝 <code>DisputeTemplateRegistry</code></li>
+<li> 📝 <code>DisputeKitClassic</code></li>
+<li> 📝 <code>DisputeKitGated</code></li>
+<li> 📝 <code>DisputeKitGatedShutter</code></li>
+<li> 📝 <code>DisputeKitShutter</code></li>
+<li> 📝 <code>DisputeKitSybilResistant</code></li>
+<li> 📝 <code>EvidenceModule</code></li>
+<li> 📝 <code>RNGWithFallback</code></li>
+<li> 📝 <code>ChainlinkRNG</code></li>
+<li> 📝 <code>UUPSProxy</code></li>
+</ul>
+</div>
+
+#### <span id=t-out-of-scope>Out of Scope</span>
+
+##### <span id=t-out-of-scope-excluded-source-units>Excluded Source Units</span>
+
+Source Units Excluded: **`0`**
+
+<a onclick="toggleVisibility('excluded-files', this)">[➕]</a>
+
+<div id="excluded-files" style="display:none">
+| File   |
+| ------ |
+| None |
+
+</div>
+
+##### <span id=t-out-of-scope-duplicate-source-units>Duplicate Source Units</span>
+
+Duplicate Source Units Excluded: **`0`**
+
+<a onclick="toggleVisibility('duplicate-files', this)">[➕]</a>
+
+<div id="duplicate-files" style="display:none">
+| File   |
+| ------ |
+| None |
+
+</div>
+
+##### <span id=t-out-of-scope-doppelganger-contracts>Doppelganger Contracts</span>
+
+Doppelganger Contracts: **`3`**
+
+<a onclick="toggleVisibility('doppelganger-contracts', this)">[➕]</a>
+
+<div id="doppelganger-contracts" style="display:none">
+| File   | Contract | Doppelganger |
+| ------ | -------- | ------------ |
+| src/arbitration/dispute-kits/DisputeKitGated.sol | IBalanceHolderERC1155 | (fuzzy) [0](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.5.0/contracts/introspection/IERC1820Implementer.sol), [1](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.2.0/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [2](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.2.2-solc-0.7/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [3](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.3.0/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [4](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.3.0-solc-0.7/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [5](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.4.0/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [6](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.4.0-solc-0.7/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [7](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [8](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0-beta.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [9](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0-rc.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [10](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.1.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [11](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.1.0-rc.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [12](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.2.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [13](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0/contracts/introspection/IERC1820Implementer.sol), [14](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.0/contracts/drafts/IERC1820Implementer.sol), [15](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.1/contracts/drafts/IERC1820Implementer.sol), [16](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.2/contracts/introspection/IERC1820Implementer.sol), [17](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.3/contracts/introspection/IERC1820Implementer.sol), [18](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0/contracts/introspection/IERC1820Implementer.sol), [19](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.0/contracts/introspection/IERC1820Implementer.sol), [20](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.1/contracts/introspection/IERC1820Implementer.sol), [21](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.2/contracts/introspection/IERC1820Implementer.sol), [22](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.0/contracts/introspection/IERC1820Implementer.sol), [23](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [24](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.1/contracts/introspection/IERC1820Implementer.sol), [25](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0/contracts/introspection/IERC1820Implementer.sol), [26](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-beta.0/contracts/introspection/IERC1820Implementer.sol), [27](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [28](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-rc.1/contracts/introspection/IERC1820Implementer.sol), [29](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.1/contracts/introspection/IERC1820Implementer.sol), [30](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.2/contracts/introspection/IERC1820Implementer.sol), [31](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.1.0/contracts/introspection/IERC1820Implementer.sol), [32](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.1.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [33](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.0/contracts/introspection/IERC1820Implementer.sol), [34](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [35](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.1-solc-0.7/contracts/introspection/IERC1820Implementer.sol), [36](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.2-solc-0.7/contracts/introspection/IERC1820Implementer.sol) |
+| src/arbitration/dispute-kits/DisputeKitGatedShutter.sol | IBalanceHolderERC1155 | (fuzzy) [0](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.5.0/contracts/introspection/IERC1820Implementer.sol), [1](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.2.0/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [2](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.2.2-solc-0.7/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [3](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.3.0/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [4](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.3.0-solc-0.7/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [5](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.4.0/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [6](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.4.0-solc-0.7/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [7](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [8](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0-beta.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [9](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0-rc.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [10](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.1.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [11](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.1.0-rc.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [12](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.2.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [13](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0/contracts/introspection/IERC1820Implementer.sol), [14](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.0/contracts/drafts/IERC1820Implementer.sol), [15](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.1/contracts/drafts/IERC1820Implementer.sol), [16](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.2/contracts/introspection/IERC1820Implementer.sol), [17](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.3/contracts/introspection/IERC1820Implementer.sol), [18](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0/contracts/introspection/IERC1820Implementer.sol), [19](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.0/contracts/introspection/IERC1820Implementer.sol), [20](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.1/contracts/introspection/IERC1820Implementer.sol), [21](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.2/contracts/introspection/IERC1820Implementer.sol), [22](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.0/contracts/introspection/IERC1820Implementer.sol), [23](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [24](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.1/contracts/introspection/IERC1820Implementer.sol), [25](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0/contracts/introspection/IERC1820Implementer.sol), [26](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-beta.0/contracts/introspection/IERC1820Implementer.sol), [27](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [28](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-rc.1/contracts/introspection/IERC1820Implementer.sol), [29](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.1/contracts/introspection/IERC1820Implementer.sol), [30](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.2/contracts/introspection/IERC1820Implementer.sol), [31](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.1.0/contracts/introspection/IERC1820Implementer.sol), [32](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.1.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [33](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.0/contracts/introspection/IERC1820Implementer.sol), [34](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [35](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.1-solc-0.7/contracts/introspection/IERC1820Implementer.sol), [36](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.2-solc-0.7/contracts/introspection/IERC1820Implementer.sol) |
+| src/arbitration/dispute-kits/DisputeKitSybilResistant.sol | IProofOfHumanity | (fuzzy) [0](https://github.com/smartcontractkit/chainlink/blob/explorer-v0.8.5/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [1](https://github.com/smartcontractkit/chainlink/blob/upgrade/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [2](https://github.com/smartcontractkit/chainlink/blob/v.0.8.12/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [3](https://github.com/smartcontractkit/chainlink/blob/v0.8.12/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [4](https://github.com/smartcontractkit/chainlink/blob/v0.8.13/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [5](https://github.com/smartcontractkit/chainlink/blob/v0.8.14/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [6](https://github.com/smartcontractkit/chainlink/blob/v0.8.15/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [7](https://github.com/smartcontractkit/chainlink/blob/v0.8.16/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [8](https://github.com/smartcontractkit/chainlink/blob/v0.8.17/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [9](https://github.com/smartcontractkit/chainlink/blob/v0.8.18/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [10](https://github.com/smartcontractkit/chainlink/blob/v0.9.0/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [11](https://github.com/smartcontractkit/chainlink/blob/v0.9.2/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [12](https://github.com/smartcontractkit/chainlink/blob/v0.9.3/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [13](https://github.com/smartcontractkit/chainlink/blob/v0.9.4/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [14](https://github.com/smartcontractkit/chainlink/blob/v0.9.5/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [15](https://github.com/smartcontractkit/chainlink/blob/v0.9.6/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [16](https://github.com/smartcontractkit/chainlink/blob/v0.9.7/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [17](https://github.com/smartcontractkit/chainlink/blob/v0.9.8/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [18](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.0.0/contracts/introspection/IERC165.sol), [19](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.0.1/contracts/introspection/IERC165.sol), [20](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.0.2/contracts/introspection/IERC165.sol), [21](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.1.2/contracts/introspection/IERC165.sol), [22](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.1.3/contracts/introspection/IERC165.sol), [23](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.2.1/contracts/introspection/IERC165.sol), [24](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.2.2/contracts/introspection/IERC165.sol), [25](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.2.3/contracts/introspection/IERC165.sol), [26](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.5.0/contracts/introspection/IERC165.sol), [27](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.2.0/contracts/introspection/IERC165Upgradeable.sol), [28](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.2.2-solc-0.7/contracts/introspection/IERC165Upgradeable.sol), [29](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.3.0/contracts/introspection/IERC165Upgradeable.sol), [30](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.3.0-solc-0.7/contracts/introspection/IERC165Upgradeable.sol), [31](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.4.0/contracts/introspection/IERC165Upgradeable.sol), [32](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.4.0-solc-0.7/contracts/introspection/IERC165Upgradeable.sol), [33](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0/contracts/utils/introspection/IERC165Upgradeable.sol), [34](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0-beta.0/contracts/utils/introspection/IERC165Upgradeable.sol), [35](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0-rc.0/contracts/utils/introspection/IERC165Upgradeable.sol), [36](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.1.0/contracts/utils/introspection/IERC165Upgradeable.sol), [37](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.1.0-rc.0/contracts/utils/introspection/IERC165Upgradeable.sol), [38](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.2.0/contracts/utils/introspection/IERC165Upgradeable.sol), [39](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.0.0/contracts/introspection/IERC165.sol), [40](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.0.0-rc.1/contracts/introspection/IERC165.sol), [41](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.0.0-rc.2/contracts/introspection/IERC165.sol), [42](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.0.0-rc.3/contracts/introspection/IERC165.sol), [43](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.0.0-rc.4/contracts/introspection/IERC165.sol), [44](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.0.1/contracts/introspection/IERC165.sol), [45](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.1.0-rc.1/contracts/introspection/IERC165.sol), [46](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.1.0-rc.2/contracts/introspection/IERC165.sol), [47](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.1.1/contracts/introspection/IERC165.sol), [48](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.1.2/contracts/introspection/IERC165.sol), [49](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.1.3/contracts/introspection/IERC165.sol), [50](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.2.0/contracts/introspection/IERC165.sol), [51](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.2.0-rc.1/contracts/introspection/IERC165.sol), [52](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0/contracts/introspection/IERC165.sol), [53](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.0/contracts/introspection/IERC165.sol), [54](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.1/contracts/introspection/IERC165.sol), [55](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.2/contracts/introspection/IERC165.sol), [56](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.3/contracts/introspection/IERC165.sol), [57](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0/contracts/introspection/IERC165.sol), [58](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.0/contracts/introspection/IERC165.sol), [59](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.1/contracts/introspection/IERC165.sol), [60](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.2/contracts/introspection/IERC165.sol), [61](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.0/contracts/introspection/IERC165.sol), [62](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.0-rc.0/contracts/introspection/IERC165.sol), [63](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.1/contracts/introspection/IERC165.sol), [64](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0/contracts/introspection/IERC165.sol), [65](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-beta.0/contracts/introspection/IERC165.sol), [66](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-rc.0/contracts/introspection/IERC165.sol), [67](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-rc.1/contracts/introspection/IERC165.sol), [68](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.1/contracts/introspection/IERC165.sol), [69](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.2/contracts/introspection/IERC165.sol), [70](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.1.0/contracts/introspection/IERC165.sol), [71](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.1.0-rc.0/contracts/introspection/IERC165.sol), [72](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.0/contracts/introspection/IERC165.sol), [73](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.0-rc.0/contracts/introspection/IERC165.sol), [74](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.1-solc-0.7/contracts/introspection/IERC165.sol), [75](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.2-solc-0.7/contracts/introspection/IERC165.sol) |
+
+</div>
+
+## <span id=t-report>Report</span>
+
+### Overview
+
+The analysis finished with **`0`** errors and **`0`** duplicate files.
+
+#### <span id=t-risk>Risk</span>
+
+<div class="wrapper" style="max-width: 512px; margin: auto">
+			<canvas id="chart-risk-summary"></canvas>
+</div>
+
+#### <span id=t-source-lines>Source Lines (sloc vs. nsloc)</span>
+
+<div class="wrapper" style="max-width: 512px; margin: auto">
+    <canvas id="chart-nsloc-total"></canvas>
+</div>
+
+#### <span id=t-inline-documentation>Inline Documentation</span>
+
+- **Comment-to-Source Ratio:** On average there are`1.59` code lines per comment (lower=better).
+- **ToDo's:** `2`
+
+#### <span id=t-components>Components</span>
+
+| 📝Contracts | 📚Libraries | 🔍Interfaces | 🎨Abstract |
+| ----------- | ----------- | ------------ | ---------- |
+| 16          | 2           | 13           | 5          |
+
+#### <span id=t-exposed-functions>Exposed Functions</span>
+
+This section lists functions that are explicitly declared public or payable. Please note that getter methods for public stateVars are not included.
+
+| 🌐Public | 💰Payable |
+| -------- | --------- |
+| 192      | 10        |
+
+| External | Internal | Private | Pure | View |
+| -------- | -------- | ------- | ---- | ---- |
+| 175      | 217      | 2       | 13   | 80   |
+
+#### <span id=t-statevariables>StateVariables</span>
+
+| Total | 🌐Public |
+| ----- | -------- |
+| 87    | 80       |
+
+#### <span id=t-capabilities>Capabilities</span>
+
+| Solidity Versions observed     | 🧪 Experimental Features | 💰 Can Receive Funds | 🖥 Uses Assembly           | 💣 Has Destroyable Contracts |
+| ------------------------------ | ------------------------ | -------------------- | -------------------------- | ---------------------------- |
+| `^0.8.24`<br/>`>=0.8.0 <0.9.0` |                          | `yes`                | `yes` <br/>(12 asm blocks) | \*\*\*\*                     |
+
+| 📤 Transfers ETH | ⚡ Low-Level Calls | 👥 DelegateCall | 🧮 Uses Hash Functions | 🔖 ECRecover | 🌀 New/Create/Create2 |
+| ---------------- | ------------------ | --------------- | ---------------------- | ------------ | --------------------- |
+| `yes`            | \*\*\*\*           | `yes`           | `yes`                  | \*\*\*\*     | \*\*\*\*              |
+
+| ♻️ TryCatch | Σ Unchecked |
+| ----------- | ----------- |
+| `yes`       | \*\*\*\*    |
+
+#### <span id=t-package-imports>Dependencies / External Imports</span>
+
+| Dependency / Import Path                                            | Count |
+| ------------------------------------------------------------------- | ----- |
+| @chainlink/contracts/src/v0.8/vrf/dev/VRFConsumerBaseV2Plus.sol     | 1     |
+| @chainlink/contracts/src/v0.8/vrf/dev/libraries/VRFV2PlusClient.sol | 1     |
+| @openzeppelin/contracts/token/ERC20/IERC20.sol                      | 3     |
+| @openzeppelin/contracts/token/ERC721/IERC721.sol                    | 1     |
+
+#### <span id=t-totals>Totals</span>
+
+##### Summary
+
+<div class="wrapper" style="max-width: 90%; margin: auto">
+    <canvas id="chart-num-bar"></canvas>
+</div>
+
+##### AST Node Statistics
+
+###### Function Calls
+
+<div class="wrapper" style="max-width: 90%; margin: auto">
+    <canvas id="chart-num-bar-ast-funccalls"></canvas>
+</div>
+
+###### Assembly Calls
+
+<div class="wrapper" style="max-width: 90%; margin: auto">
+    <canvas id="chart-num-bar-ast-asmcalls"></canvas>
+</div>
+
+###### AST Total
+
+<div class="wrapper" style="max-width: 90%; margin: auto">
+    <canvas id="chart-num-bar-ast"></canvas>
+</div>
+
+##### Inheritance Graph
+
+<a onclick="toggleVisibility('surya-inherit', this)">[➕]</a>
+
+<div id="surya-inherit" style="display:none">
+<div class="wrapper" style="max-width: 512px; margin: auto">
+    <div id="surya-inheritance" style="text-align: center;"></div>
+</div>
+</div>
+
+##### CallGraph
+
+<a onclick="toggleVisibility('surya-call', this)">[➕]</a>
+
+<div id="surya-call" style="display:none">
+<div class="wrapper" style="max-width: 512px; margin: auto">
+    <div id="surya-callgraph" style="text-align: center;"></div>
+</div>
+</div>
+
+###### Contract Summary
+
+<a onclick="toggleVisibility('surya-mdreport', this)">[➕]</a>
+
+<div id="surya-mdreport" style="display:none">
+
+Files Description Table
+
+| File Name                                                 | SHA-1 Hash                               |
+| --------------------------------------------------------- | ---------------------------------------- |
+| src/arbitration/KlerosCore.sol                            | 5362842ab3a88870e8b3b42cd7cf7a2058240483 |
+| src/arbitration/KlerosCoreBase.sol                        | fe829c80ad434e185151a8b5d299a585f576c619 |
+| src/arbitration/KlerosCoreNeo.sol                         | 0260ef7a9309d5c73c4c9b1a3f5c7653904f79c7 |
+| src/arbitration/PolicyRegistry.sol                        | c36299120ac7318dd29e4ab86f50b0447d87af96 |
+| src/arbitration/SortitionModule.sol                       | c1c1b2dd061590cd6c7eee41767e5c3fb898d506 |
+| src/arbitration/SortitionModuleBase.sol                   | 7b1037fcdfffc58bf3522f70ed128cad4915e032 |
+| src/arbitration/SortitionModuleNeo.sol                    | 8570ebeff10d723ce33b75e077dffb6fcf6e2f08 |
+| src/arbitration/arbitrables/DisputeResolver.sol           | 7dad21f0219e0a1b698859205bbf31b07abfdc7c |
+| src/arbitration/DisputeTemplateRegistry.sol               | c31e000957b979dc513d8b123253adb9edce50c7 |
+| src/arbitration/dispute-kits/DisputeKitClassic.sol        | 32bcb287571a3c4a861659be31a1ee2dc6ea6784 |
+| src/arbitration/dispute-kits/DisputeKitClassicBase.sol    | 7c0b04f3e73c0a10a29abfa78f78220e4e43f983 |
+| src/arbitration/dispute-kits/DisputeKitGated.sol          | e5f7f2ecd65f5e279c7b55e9edbe6f4cfc5fd632 |
+| src/arbitration/dispute-kits/DisputeKitGatedShutter.sol   | abb7f1ac20fa60db95d97fea6e9396b108d40924 |
+| src/arbitration/dispute-kits/DisputeKitShutter.sol        | 3720b60db303b866eacbb3dee529a638eaf6782e |
+| src/arbitration/dispute-kits/DisputeKitSybilResistant.sol | 69158bf07e78b3cb9892a5fd6cfc768181989a7f |
+| src/arbitration/evidence/EvidenceModule.sol               | 45845f3d5ad5548a30698105061bc0e64fd7718f |
+| src/arbitration/interfaces/IArbitrableV2.sol              | ce54b7140a6109b2d919cea38ff94ac2ad775398 |
+| src/arbitration/interfaces/IArbitratorV2.sol              | 4e0baa0ff6155737540105f9fdb5b54ba2905d2c |
+| src/arbitration/interfaces/IDisputeKit.sol                | f21b52ed28a905b3073adaf68961938200cfd644 |
+| src/arbitration/interfaces/IDisputeTemplateRegistry.sol   | 8d0351ebeee1ebd8603af9cf50c2ab62f6e8fecb |
+| src/arbitration/interfaces/IEvidence.sol                  | 12ee130f67f5d38afbcc810129b030cf7f58f058 |
+| src/arbitration/interfaces/ISortitionModule.sol           | 2c6d74752298263f7c649e3feecfb9a03c87a16a |
+| src/libraries/Constants.sol                               | 4d1d44dbeeda03f47a646e9552873d26acf4254d |
+| src/libraries/SafeERC20.sol                               | 68e49603280eab2b68eabc554dc310ff3313a64c |
+| src/libraries/SafeSend.sol                                | 9d282cf6456950471debec28103fcb99638fa83d |
+| src/rng/RNGWithFallback.sol                               | 9729dbce3e1dd5981073df38ac31fe356aae0027 |
+| src/rng/ChainlinkRNG.sol                                  | ce0d145807bc7b5b59b0e29ba468d9b0c0dc0314 |
+| src/rng/IRNG.sol                                          | d701581ef4910cdde9dbc3006dd0229cc3ea6012 |
+| src/proxy/UUPSProxiable.sol                               | 80d46ace20ea4c9c6a0cbc1093d6e88eb19aeb12 |
+| src/proxy/UUPSProxy.sol                                   | 18a2a570a8ef2ec5f02d59bd1c03a176203e8ccf |
+| src/proxy/Initializable.sol                               | 7079462341810d12b0c0ea93845d053bdcbdabff |
+
+Contracts Description Table
+
+|           Contract           |                  Type                   |                         Bases                          |                |                                        |
+| :--------------------------: | :-------------------------------------: | :----------------------------------------------------: | :------------: | :------------------------------------: |
+|              └               |            **Function Name**            |                     **Visibility**                     | **Mutability** |             **Modifiers**              |
+|                              |                                         |                                                        |                |                                        |
+|        **KlerosCore**        |             Implementation              |                     KlerosCoreBase                     |                |                                        |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
+|              └               |               initialize                |                      External ❗️                       |       🛑       |             reinitializer              |
+|              └               |              reinitialize               |                      External ❗️                       |       🛑       |             reinitializer              |
+|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByGovernor             |
+|                              |                                         |                                                        |                |                                        |
+|      **KlerosCoreBase**      |             Implementation              |      IArbitratorV2, Initializable, UUPSProxiable       |                |                                        |
+|              └               |      \_\_KlerosCoreBase_initialize      |                      Internal 🔒                       |       🛑       |            onlyInitializing            |
+|              └               |                  pause                  |                      External ❗️                       |       🛑       | onlyByGuardianOrGovernor whenNotPaused |
+|              └               |                 unpause                 |                      External ❗️                       |       🛑       |       onlyByGovernor whenPaused        |
+|              └               |         executeGovernorProposal         |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |             changeGovernor              |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |             changeGuardian              |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |             changePinakion              |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |      changeJurorProsecutionModule       |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |          changeSortitionModule          |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |            addNewDisputeKit             |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |               createCourt               |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |          changeCourtParameters          |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |            enableDisputeKits            |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |         changeAcceptedFeeTokens         |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |           changeCurrencyRates           |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |                setStake                 |                      External ❗️                       |       🛑       |             whenNotPaused              |
+|              └               |        setStakeBySortitionModule        |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |        transferBySortitionModule        |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |              createDispute              |                      External ❗️                       |       💵       |                  NO❗️                  |
+|              └               |              createDispute              |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |             \_createDispute             |                      Internal 🔒                       |       🛑       |                                        |
+|              └               |               passPeriod                |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |                  draw                   |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |                 appeal                  |                      External ❗️                       |       💵       |                  NO❗️                  |
+|              └               |                 execute                 |                      External ❗️                       |       🛑       |             whenNotPaused              |
+|              └               |           \_executePenalties            |                      Internal 🔒                       |       🛑       |                                        |
+|              └               |            \_executeRewards             |                      Internal 🔒                       |       🛑       |                                        |
+|              └               |              executeRuling              |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |             arbitrationCost             |                       Public ❗️                        |                |                  NO❗️                  |
+|              └               |             arbitrationCost             |                       Public ❗️                        |                |                  NO❗️                  |
+|              └               |               appealCost                |                       Public ❗️                        |                |                  NO❗️                  |
+|              └               |              appealPeriod               |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |              currentRuling              |                       Public ❗️                        |                |                  NO❗️                  |
+|              └               |              getRoundInfo               |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |          getPnkAtStakePerJuror          |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |            getNumberOfRounds            |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |               isSupported               |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |            getTimesPerPeriod            |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |            getNumberOfVotes             |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |           isDisputeKitJumping           |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |          getDisputeKitsLength           |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |         convertEthToTokenAmount         |                       Public ❗️                        |                |                  NO❗️                  |
+|              └               |           \_transferFeeToken            |                      Internal 🔒                       |       🛑       |                                        |
+|              └               |            \_applyCoherence             |                      Internal 🔒                       |                |                                        |
+|              └               |          \_calculatePnkAtStake          |                      Internal 🔒                       |                |                                        |
+|              └               |           \_enableDisputeKit            |                      Internal 🔒                       |       🛑       |                                        |
+|              └               |               \_setStake                |                      Internal 🔒                       |       🛑       |                                        |
+|              └               |             \_stakingFailed             |                      Internal 🔒                       |                |                                        |
+|              └               | \_extraDataToCourtIDMinJurorsDisputeKit |                      Internal 🔒                       |                |                                        |
+|                              |                                         |                                                        |                |                                        |
+|      **KlerosCoreNeo**       |             Implementation              |                     KlerosCoreBase                     |                |                                        |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
+|              └               |               initialize                |                      External ❗️                       |       🛑       |             reinitializer              |
+|              └               |              reinitialize               |                      External ❗️                       |       🛑       |             reinitializer              |
+|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByGovernor             |
+|              └               |             changeJurorNft              |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |        changeArbitrableWhitelist        |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |                setStake                 |                      External ❗️                       |       🛑       |             whenNotPaused              |
+|              └               |             \_createDispute             |                      Internal 🔒                       |       🛑       |                                        |
+|              └               |             \_stakingFailed             |                      Internal 🔒                       |                |                                        |
+|                              |                                         |                                                        |                |                                        |
+|      **PolicyRegistry**      |             Implementation              |              UUPSProxiable, Initializable              |                |                                        |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
+|              └               |               initialize                |                      External ❗️                       |       🛑       |             reinitializer              |
+|              └               |               initialize2               |                      External ❗️                       |       🛑       |             reinitializer              |
+|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByGovernor             |
+|              └               |             changeGovernor              |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |                setPolicy                |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|                              |                                         |                                                        |                |                                        |
+|     **SortitionModule**      |             Implementation              |                  SortitionModuleBase                   |                |                                        |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
+|              └               |               initialize                |                      External ❗️                       |       🛑       |             reinitializer              |
+|              └               |               initialize4               |                      External ❗️                       |       🛑       |             reinitializer              |
+|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByGovernor             |
+|                              |                                         |                                                        |                |                                        |
+|   **SortitionModuleBase**    |             Implementation              |     ISortitionModule, Initializable, UUPSProxiable     |                |                                        |
+|              └               |   \_\_SortitionModuleBase_initialize    |                      Internal 🔒                       |       🛑       |            onlyInitializing            |
+|              └               |             changeGovernor              |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |          changeMinStakingTime           |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |          changeMaxDrawingTime           |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |       changeRandomNumberGenerator       |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |                passPhase                |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |               createTree                |                      External ❗️                       |       🛑       |               onlyByCore               |
+|              └               |          executeDelayedStakes           |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |            createDisputeHook            |                      External ❗️                       |       🛑       |               onlyByCore               |
+|              └               |              postDrawHook               |                      External ❗️                       |       🛑       |               onlyByCore               |
+|              └               |           notifyRandomNumber            |                       Public ❗️                        |       🛑       |                  NO❗️                  |
+|              └               |              validateStake              |                      External ❗️                       |       🛑       |               onlyByCore               |
+|              └               |             \_validateStake             |                      Internal 🔒                       |       🛑       |                                        |
+|              └               |                setStake                 |                      External ❗️                       |       🛑       |               onlyByCore               |
+|              └               |               \_setStake                |                      Internal 🔒                       |       🛑       |                                        |
+|              └               |                lockStake                |                      External ❗️                       |       🛑       |               onlyByCore               |
+|              └               |               unlockStake               |                      External ❗️                       |       🛑       |               onlyByCore               |
+|              └               |              penalizeStake              |                      External ❗️                       |       🛑       |               onlyByCore               |
+|              └               |            setJurorInactive             |                      External ❗️                       |       🛑       |               onlyByCore               |
+|              └               |           withdrawLeftoverPNK           |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |                  draw                   |                       Public ❗️                        |                |                  NO❗️                  |
+|              └               |                 stakeOf                 |                       Public ❗️                        |                |                  NO❗️                  |
+|              └               |                 stakeOf                 |                       Public ❗️                        |                |                  NO❗️                  |
+|              └               |             getJurorBalance             |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |            getJurorCourtIDs             |                       Public ❗️                        |                |                  NO❗️                  |
+|              └               |              isJurorStaked              |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |           getJurorLeftoverPNK           |                       Public ❗️                        |                |                  NO❗️                  |
+|              └               |             \_updateParents             |                       Private 🔐                       |       🛑       |                                        |
+|              └               |         \_stakePathIDToAccount          |                      Internal 🔒                       |                |                                        |
+|              └               |           \_extraDataToTreeK            |                      Internal 🔒                       |                |                                        |
+|              └               |                  \_set                  |                      Internal 🔒                       |       🛑       |                                        |
+|              └               |    \_accountAndCourtIDToStakePathID     |                      Internal 🔒                       |                |                                        |
+|                              |                                         |                                                        |                |                                        |
+|    **SortitionModuleNeo**    |             Implementation              |                  SortitionModuleBase                   |                |                                        |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
+|              └               |               initialize                |                      External ❗️                       |       🛑       |             reinitializer              |
+|              └               |               initialize4               |                      External ❗️                       |       🛑       |             reinitializer              |
+|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByGovernor             |
+|              └               |         changeMaxStakePerJuror          |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |          changeMaxTotalStaked           |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |             \_validateStake             |                      Internal 🔒                       |       🛑       |               onlyByCore               |
+|                              |                                         |                                                        |                |                                        |
+|     **DisputeResolver**      |             Implementation              |                     IArbitrableV2                      |                |                                        |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
+|              └               |             changeGovernor              |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |            changeArbitrator             |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |         changeTemplateRegistry          |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |        createDisputeForTemplate         |                      External ❗️                       |       💵       |                  NO❗️                  |
+|              └               |       createDisputeForTemplateUri       |                      External ❗️                       |       💵       |                  NO❗️                  |
+|              └               |                  rule                   |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |             \_createDispute             |                      Internal 🔒                       |       🛑       |                                        |
+|                              |                                         |                                                        |                |                                        |
+| **DisputeTemplateRegistry**  |             Implementation              | IDisputeTemplateRegistry, UUPSProxiable, Initializable |                |                                        |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
+|              └               |               initialize                |                      External ❗️                       |       🛑       |             reinitializer              |
+|              └               |               initialize2               |                      External ❗️                       |       🛑       |             reinitializer              |
+|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByGovernor             |
+|              └               |             changeGovernor              |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |           setDisputeTemplate            |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|                              |                                         |                                                        |                |                                        |
+|    **DisputeKitClassic**     |             Implementation              |                 DisputeKitClassicBase                  |                |                                        |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
+|              └               |               initialize                |                      External ❗️                       |       🛑       |             reinitializer              |
+|              └               |              reinitialize               |                      External ❗️                       |       🛑       |             reinitializer              |
+|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByGovernor             |
+|                              |                                         |                                                        |                |                                        |
+|  **DisputeKitClassicBase**   |             Implementation              |       IDisputeKit, Initializable, UUPSProxiable        |                |                                        |
+|              └               |  \_\_DisputeKitClassicBase_initialize   |                      Internal 🔒                       |       🛑       |            onlyInitializing            |
+|              └               |         executeGovernorProposal         |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |             changeGovernor              |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |               changeCore                |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |              createDispute              |                      External ❗️                       |       🛑       |               onlyByCore               |
+|              └               |                  draw                   |                      External ❗️                       |       🛑       |          onlyByCore notJumped          |
+|              └               |               castCommit                |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |              \_castCommit               |                      Internal 🔒                       |       🛑       |               notJumped                |
+|              └               |                castVote                 |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |               \_castVote                |                      Internal 🔒                       |       🛑       |               notJumped                |
+|              └               |               fundAppeal                |                      External ❗️                       |       💵       |               notJumped                |
+|              └               |         withdrawFeesAndRewards          |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |                hashVote                 |                       Public ❗️                        |                |                  NO❗️                  |
+|              └               |            getFundedChoices             |                       Public ❗️                        |                |                  NO❗️                  |
+|              └               |              currentRuling              |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |          getDegreeOfCoherence           |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |            getCoherentCount             |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |            areCommitsAllCast            |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |             areVotesAllCast             |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |             isAppealFunded              |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |              isVoteActive               |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |              getRoundInfo               |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |            getNumberOfRounds            |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |         getLocalDisputeRoundID          |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |               getVoteInfo               |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |             \_postDrawCheck             |                      Internal 🔒                       |                |                                        |
+|                              |                                         |                                                        |                |                                        |
+|      **IBalanceHolder**      |                Interface                |                                                        |                |                                        |
+|              └               |                balanceOf                |                      External ❗️                       |                |                  NO❗️                  |
+|                              |                                         |                                                        |                |                                        |
+|  **IBalanceHolderERC1155**   |                Interface                |                                                        |                |                                        |
+|              └               |                balanceOf                |                      External ❗️                       |                |                  NO❗️                  |
+|                              |                                         |                                                        |                |                                        |
+|     **DisputeKitGated**      |             Implementation              |                 DisputeKitClassicBase                  |                |                                        |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
+|              └               |               initialize                |                      External ❗️                       |       🛑       |             reinitializer              |
+|              └               |              reinitialize               |                      External ❗️                       |       🛑       |             reinitializer              |
+|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByGovernor             |
+|              └               |          extraDataToTokenInfo           |                       Public ❗️                        |                |                  NO❗️                  |
+|              └               |             \_postDrawCheck             |                      Internal 🔒                       |                |                                        |
+|                              |                                         |                                                        |                |                                        |
+|      **IBalanceHolder**      |                Interface                |                                                        |                |                                        |
+|              └               |                balanceOf                |                      External ❗️                       |                |                  NO❗️                  |
+|                              |                                         |                                                        |                |                                        |
+|  **IBalanceHolderERC1155**   |                Interface                |                                                        |                |                                        |
+|              └               |                balanceOf                |                      External ❗️                       |                |                  NO❗️                  |
+|                              |                                         |                                                        |                |                                        |
+|  **DisputeKitGatedShutter**  |             Implementation              |                 DisputeKitClassicBase                  |                |                                        |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
+|              └               |               initialize                |                      External ❗️                       |       🛑       |             reinitializer              |
+|              └               |              reinitialize               |                      External ❗️                       |       🛑       |             reinitializer              |
+|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByGovernor             |
+|              └               |            castCommitShutter            |                      External ❗️                       |       🛑       |               notJumped                |
+|              └               |             castVoteShutter             |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |                hashVote                 |                       Public ❗️                        |                |                  NO❗️                  |
+|              └               |         \_extraDataToTokenInfo          |                      Internal 🔒                       |                |                                        |
+|              └               |             \_postDrawCheck             |                      Internal 🔒                       |                |                                        |
+|                              |                                         |                                                        |                |                                        |
+|    **DisputeKitShutter**     |             Implementation              |                 DisputeKitClassicBase                  |                |                                        |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
+|              └               |               initialize                |                      External ❗️                       |       🛑       |             reinitializer              |
+|              └               |              reinitialize               |                      External ❗️                       |       🛑       |             reinitializer              |
+|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByGovernor             |
+|              └               |            castCommitShutter            |                      External ❗️                       |       🛑       |               notJumped                |
+|              └               |             castVoteShutter             |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |                hashVote                 |                       Public ❗️                        |                |                  NO❗️                  |
+|                              |                                         |                                                        |                |                                        |
+|     **IProofOfHumanity**     |                Interface                |                                                        |                |                                        |
+|              └               |              isRegistered               |                      External ❗️                       |                |                  NO❗️                  |
+|                              |                                         |                                                        |                |                                        |
+| **DisputeKitSybilResistant** |             Implementation              |                 DisputeKitClassicBase                  |                |                                        |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
+|              └               |               initialize                |                      External ❗️                       |       🛑       |             reinitializer              |
+|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByGovernor             |
+|              └               |             \_postDrawCheck             |                      Internal 🔒                       |                |                                        |
+|                              |                                         |                                                        |                |                                        |
+|      **EvidenceModule**      |             Implementation              |        IEvidence, Initializable, UUPSProxiable         |                |                                        |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
+|              └               |               initialize                |                      External ❗️                       |       🛑       |             reinitializer              |
+|              └               |               initialize2               |                      External ❗️                       |       🛑       |             reinitializer              |
+|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByGovernor             |
+|              └               |             submitEvidence              |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|                              |                                         |                                                        |                |                                        |
+|      **IArbitrableV2**       |                Interface                |                                                        |                |                                        |
+|              └               |                  rule                   |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|                              |                                         |                                                        |                |                                        |
+|      **IArbitratorV2**       |                Interface                |                                                        |                |                                        |
+|              └               |              createDispute              |                      External ❗️                       |       💵       |                  NO❗️                  |
+|              └               |              createDispute              |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |             arbitrationCost             |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |             arbitrationCost             |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |              currentRuling              |                      External ❗️                       |                |                  NO❗️                  |
+|                              |                                         |                                                        |                |                                        |
+|       **IDisputeKit**        |                Interface                |                                                        |                |                                        |
+|              └               |              createDispute              |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |                  draw                   |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |              currentRuling              |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |          getDegreeOfCoherence           |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |            getCoherentCount             |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |            areCommitsAllCast            |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |             areVotesAllCast             |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |             isAppealFunded              |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |              isVoteActive               |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |              getRoundInfo               |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |               getVoteInfo               |                      External ❗️                       |                |                  NO❗️                  |
+|                              |                                         |                                                        |                |                                        |
+| **IDisputeTemplateRegistry** |                Interface                |                                                        |                |                                        |
+|              └               |           setDisputeTemplate            |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|                              |                                         |                                                        |                |                                        |
+|        **IEvidence**         |                Interface                |                                                        |                |                                        |
+|                              |                                         |                                                        |                |                                        |
+|     **ISortitionModule**     |                Interface                |                                                        |                |                                        |
+|              └               |               createTree                |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |              validateStake              |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |                setStake                 |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |            setJurorInactive             |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |                lockStake                |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |               unlockStake               |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |              penalizeStake              |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |           notifyRandomNumber            |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |                  draw                   |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |             getJurorBalance             |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |            getJurorCourtIDs             |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |              isJurorStaked              |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |           getJurorLeftoverPNK           |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |            createDisputeHook            |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |              postDrawHook               |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |           withdrawLeftoverPNK           |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|                              |                                         |                                                        |                |                                        |
+|        **SafeERC20**         |                 Library                 |                                                        |                |                                        |
+|              └               |            increaseAllowance            |                      Internal 🔒                       |       🛑       |                                        |
+|              └               |              safeTransfer               |                      Internal 🔒                       |       🛑       |                                        |
+|              └               |            safeTransferFrom             |                      Internal 🔒                       |       🛑       |                                        |
+|                              |                                         |                                                        |                |                                        |
+|         **WethLike**         |                Interface                |                                                        |                |                                        |
+|              └               |                 deposit                 |                      External ❗️                       |       💵       |                  NO❗️                  |
+|              └               |                transfer                 |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|                              |                                         |                                                        |                |                                        |
+|         **SafeSend**         |                 Library                 |                                                        |                |                                        |
+|              └               |                safeSend                 |                      Internal 🔒                       |       🛑       |                                        |
+|                              |                                         |                                                        |                |                                        |
+|     **RNGWithFallback**      |             Implementation              |                          IRNG                          |                |                                        |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
+|              └               |             changeGovernor              |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |             changeConsumer              |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |          changeFallbackTimeout          |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |            requestRandomness            |                      External ❗️                       |       🛑       |             onlyByConsumer             |
+|              └               |            receiveRandomness            |                      External ❗️                       |       🛑       |             onlyByConsumer             |
+|                              |                                         |                                                        |                |                                        |
+|       **ChainlinkRNG**       |             Implementation              |              IRNG, VRFConsumerBaseV2Plus               |                |                                        |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |         VRFConsumerBaseV2Plus          |
+|              └               |             changeGovernor              |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |             changeConsumer              |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |          changeVrfCoordinator           |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |              changeKeyHash              |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |          changeSubscriptionId           |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |       changeRequestConfirmations        |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |         changeCallbackGasLimit          |                      External ❗️                       |       🛑       |             onlyByGovernor             |
+|              └               |            requestRandomness            |                      External ❗️                       |       🛑       |             onlyByConsumer             |
+|              └               |           fulfillRandomWords            |                      Internal 🔒                       |       🛑       |                                        |
+|              └               |            receiveRandomness            |                      External ❗️                       |                |                  NO❗️                  |
+|                              |                                         |                                                        |                |                                        |
+|           **IRNG**           |                Interface                |                                                        |                |                                        |
+|              └               |            requestRandomness            |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|              └               |            receiveRandomness            |                      External ❗️                       |       🛑       |                  NO❗️                  |
+|                              |                                         |                                                        |                |                                        |
+|      **UUPSProxiable**       |             Implementation              |                                                        |                |                                        |
+|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |       🛑       |                                        |
+|              └               |            upgradeToAndCall             |                       Public ❗️                        |       💵       |                  NO❗️                  |
+|              └               |              proxiableUUID              |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |                 version                 |                      External ❗️                       |                |                  NO❗️                  |
+|              └               |           \_getImplementation           |                      Internal 🔒                       |                |                                        |
+|                              |                                         |                                                        |                |                                        |
+|        **UUPSProxy**         |             Implementation              |                                                        |                |                                        |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
+|              └               |               \_delegate                |                      Internal 🔒                       |       🛑       |                                        |
+|              └               |           \_getImplementation           |                      Internal 🔒                       |                |                                        |
+|              └               |               <Fallback>                |                      External ❗️                       |       💵       |                  NO❗️                  |
+|              └               |             <Receive Ether>             |                      External ❗️                       |       💵       |                  NO❗️                  |
+|                              |                                         |                                                        |                |                                        |
+|      **Initializable**       |             Implementation              |                                                        |                |                                        |
+|              └               |           \_checkInitializing           |                      Internal 🔒                       |                |                                        |
+|              └               |          \_disableInitializers          |                      Internal 🔒                       |       🛑       |                                        |
+|              └               |         \_getInitializedVersion         |                      Internal 🔒                       |                |                                        |
+|              └               |            \_isInitializing             |                      Internal 🔒                       |                |                                        |
+|              └               |        \_getInitializableStorage        |                       Private 🔐                       |                |                                        |
+
+Legend
+
+| Symbol | Meaning                   |
+| :----: | ------------------------- |
+|   🛑   | Function can modify state |
+|   💵   | Function is payable       |
+
+</div>
+____
+<sub>
+Thinking about smart contract security? We can provide training, ongoing advice, and smart contract auditing. [Contact us](https://consensys.io/diligence/contact/).
+</sub>
diff --git a/contracts/scripts/generateMetrics.sh b/contracts/scripts/generateMetrics.sh
new file mode 100755
index 000000000..4e7bea4be
--- /dev/null
+++ b/contracts/scripts/generateMetrics.sh
@@ -0,0 +1,23 @@
+#!/usr/bin/env bash
+
+SCRIPT_DIR="$( cd "$( dirname "${BASH_SOURCE[0]}" )" >/dev/null 2>&1 && pwd )"
+
+SOURCE_DIR="src"
+
+yarn dlx solidity-code-metrics \
+    "$SOURCE_DIR"/arbitration/KlerosCore* \
+    "$SOURCE_DIR"/arbitration/PolicyRegistry.sol \
+    "$SOURCE_DIR"/arbitration/SortitionModule* \
+    "$SOURCE_DIR"/arbitration/arbitrables/DisputeResolver.sol \
+    "$SOURCE_DIR"/arbitration/DisputeTemplateRegistry.sol \
+    "$SOURCE_DIR"/arbitration/dispute-kits/* \
+    "$SOURCE_DIR"/arbitration/evidence/EvidenceModule.sol \
+    "$SOURCE_DIR"/arbitration/interfaces/* \
+    "$SOURCE_DIR"/libraries/Constants.sol \
+    "$SOURCE_DIR"/libraries/Safe* \
+    "$SOURCE_DIR"/rng/RNGWithFallback.sol \
+    "$SOURCE_DIR"/rng/ChainlinkRNG.sol \
+    "$SOURCE_DIR"/rng/IRNG.sol \
+    "$SOURCE_DIR"/proxy/UUPSProx* \
+    "$SOURCE_DIR"/proxy/Initializable.sol \
+>METRICS.md

From 738ef2c60ae34a5f192c129721ea29db3b9d352d Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Tue, 12 Aug 2025 17:58:05 +0100
Subject: [PATCH 029/175] docs: metrics for upcoming audit

---
 contracts/audit/METRICS.html | 209524 ++++++++++++++++++++++++++++++++
 1 file changed, 209524 insertions(+)
 create mode 100644 contracts/audit/METRICS.html

diff --git a/contracts/audit/METRICS.html b/contracts/audit/METRICS.html
new file mode 100644
index 000000000..df48b7b11
--- /dev/null
+++ b/contracts/audit/METRICS.html
@@ -0,0 +1,209524 @@
+<html lang="en-US">
+  <head>
+    <meta charset="UTF-8" />
+    <meta name="description" content="ConsenSys Diligence - Solidity Metrics Report" />
+    <meta name="author" content="tintinweb.solidity-metrics" />
+    <meta name="url" content="https://marketplace.visualstudio.com/items?itemName=tintinweb.solidity-metrics" />
+    <meta name="robots" content="noindex" />
+
+    <title>Solidity Metrics</title>
+    <script>
+      function toggleVisibility(id, anchor) {
+        if (document.getElementById(id).style.display == "none") {
+          document.getElementById(id).style.display = "block";
+          anchor.text = "[➖]";
+        } else {
+          document.getElementById(id).style.display = "none";
+          anchor.text = "[➕]";
+        }
+      }
+    </script>
+    <style>
+      /*
+Copyright (c) 2017 Chris Patuzzo
+https://twitter.com/chrispatuzzo
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+*/
+
+      body {
+        font-family: Helvetica, arial, sans-serif;
+        font-size: 14px;
+        line-height: 1.3;
+        padding-top: 10px;
+        padding-bottom: 10px;
+        background-color: white;
+        padding: 30px;
+        color: #333;
+      }
+
+      body > *:first-child {
+        margin-top: 0 !important;
+      }
+
+      body > *:last-child {
+        margin-bottom: 0 !important;
+      }
+
+      a {
+        color: #4183c4;
+        text-decoration: none;
+      }
+
+      a.absent {
+        color: #cc0000;
+      }
+
+      a.anchor {
+        display: block;
+        padding-left: 30px;
+        margin-left: -30px;
+        cursor: pointer;
+        position: absolute;
+        top: 0;
+        left: 0;
+        bottom: 0;
+      }
+
+      h1,
+      h2,
+      h3,
+      h4,
+      h5,
+      h6 {
+        margin: 20px 0 10px;
+        padding: 0;
+        font-weight: bold;
+        -webkit-font-smoothing: antialiased;
+        cursor: text;
+        position: relative;
+      }
+
+      h2:first-child,
+      h1:first-child,
+      h1:first-child + h2,
+      h3:first-child,
+      h4:first-child,
+      h5:first-child,
+      h6:first-child {
+        margin-top: 0;
+        padding-top: 0;
+      }
+
+      h1:hover a.anchor,
+      h2:hover a.anchor,
+      h3:hover a.anchor,
+      h4:hover a.anchor,
+      h5:hover a.anchor,
+      h6:hover a.anchor {
+        text-decoration: none;
+      }
+
+      h1 tt,
+      h1 code {
+        font-size: inherit;
+      }
+
+      h2 tt,
+      h2 code {
+        font-size: inherit;
+      }
+
+      h3 tt,
+      h3 code {
+        font-size: inherit;
+      }
+
+      h4 tt,
+      h4 code {
+        font-size: inherit;
+      }
+
+      h5 tt,
+      h5 code {
+        font-size: inherit;
+      }
+
+      h6 tt,
+      h6 code {
+        font-size: inherit;
+      }
+
+      h1 {
+        font-size: 28px;
+        color: black;
+      }
+
+      h2 {
+        font-size: 24px;
+        border-bottom: 1px solid #cccccc;
+        color: black;
+      }
+
+      h3 {
+        font-size: 18px;
+      }
+
+      h4 {
+        font-size: 16px;
+      }
+
+      h5 {
+        font-size: 14px;
+      }
+
+      h6 {
+        color: #777777;
+        font-size: 14px;
+      }
+
+      p,
+      blockquote,
+      ul,
+      ol,
+      dl,
+      li,
+      table,
+      pre {
+        margin: 15px 0;
+      }
+
+      hr {
+        border: 1px solid;
+        color: #cccccc;
+        padding: 0;
+      }
+
+      body > h2:first-child {
+        margin-top: 0;
+        padding-top: 0;
+      }
+
+      body > h1:first-child {
+        margin-top: 0;
+        padding-top: 0;
+      }
+
+      body > h1:first-child + h2 {
+        margin-top: 0;
+        padding-top: 0;
+      }
+
+      body > h3:first-child,
+      body > h4:first-child,
+      body > h5:first-child,
+      body > h6:first-child {
+        margin-top: 0;
+        padding-top: 0;
+      }
+
+      a:first-child h1,
+      a:first-child h2,
+      a:first-child h3,
+      a:first-child h4,
+      a:first-child h5,
+      a:first-child h6 {
+        margin-top: 0;
+        padding-top: 0;
+      }
+
+      h1 p,
+      h2 p,
+      h3 p,
+      h4 p,
+      h5 p,
+      h6 p {
+        margin-top: 0;
+      }
+
+      li p.first {
+        display: inline-block;
+      }
+
+      ul,
+      ol {
+        padding-left: 30px;
+      }
+
+      ul :first-child,
+      ol :first-child {
+        margin-top: 0;
+      }
+
+      ul :last-child,
+      ol :last-child {
+        margin-bottom: 0;
+      }
+
+      dl {
+        padding: 0;
+      }
+
+      dl dt {
+        font-size: 14px;
+        font-weight: bold;
+        font-style: italic;
+        padding: 0;
+        margin: 15px 0 5px;
+      }
+
+      dl dt:first-child {
+        padding: 0;
+      }
+
+      dl dt > :first-child {
+        margin-top: 0;
+      }
+
+      dl dt > :last-child {
+        margin-bottom: 0;
+      }
+
+      dl dd {
+        margin: 0 0 15px;
+        padding: 0 15px;
+      }
+
+      dl dd > :first-child {
+        margin-top: 0;
+      }
+
+      dl dd > :last-child {
+        margin-bottom: 0;
+      }
+
+      blockquote {
+        border-left: 4px solid #dddddd;
+        padding: 0 15px;
+        color: #777777;
+      }
+
+      blockquote > :first-child {
+        margin-top: 0;
+      }
+
+      blockquote > :last-child {
+        margin-bottom: 0;
+      }
+
+      table {
+        padding: 0;
+      }
+      table tr {
+        border-top: 1px solid #cccccc;
+        background-color: white;
+        margin: 0;
+        padding: 0;
+      }
+
+      table tr:nth-child(2n) {
+        background-color: #f8f8f8;
+      }
+
+      table tr th {
+        font-weight: bold;
+        border: 1px solid #cccccc;
+        text-align: left;
+        margin: 0;
+        padding: 6px 13px;
+      }
+
+      table tr td {
+        border: 1px solid #cccccc;
+        text-align: left;
+        margin: 0;
+        padding: 6px 13px;
+      }
+
+      table tr th :first-child,
+      table tr td :first-child {
+        margin-top: 0;
+      }
+
+      table tr th :last-child,
+      table tr td :last-child {
+        margin-bottom: 0;
+      }
+
+      img {
+        max-width: 100%;
+      }
+
+      span.frame {
+        display: block;
+        overflow: hidden;
+      }
+
+      span.frame > span {
+        border: 1px solid #dddddd;
+        display: block;
+        float: left;
+        overflow: hidden;
+        margin: 13px 0 0;
+        padding: 7px;
+        width: auto;
+      }
+
+      span.frame span img {
+        display: block;
+        float: left;
+      }
+
+      span.frame span span {
+        clear: both;
+        color: #333333;
+        display: block;
+        padding: 5px 0 0;
+      }
+
+      span.align-center {
+        display: block;
+        overflow: hidden;
+        clear: both;
+      }
+
+      span.align-center > span {
+        display: block;
+        overflow: hidden;
+        margin: 13px auto 0;
+        text-align: center;
+      }
+
+      span.align-center span img {
+        margin: 0 auto;
+        text-align: center;
+      }
+
+      span.align-right {
+        display: block;
+        overflow: hidden;
+        clear: both;
+      }
+
+      span.align-right > span {
+        display: block;
+        overflow: hidden;
+        margin: 13px 0 0;
+        text-align: right;
+      }
+
+      span.align-right span img {
+        margin: 0;
+        text-align: right;
+      }
+
+      span.float-left {
+        display: block;
+        margin-right: 13px;
+        overflow: hidden;
+        float: left;
+      }
+
+      span.float-left span {
+        margin: 13px 0 0;
+      }
+
+      span.float-right {
+        display: block;
+        margin-left: 13px;
+        overflow: hidden;
+        float: right;
+      }
+
+      span.float-right > span {
+        display: block;
+        overflow: hidden;
+        margin: 13px auto 0;
+        text-align: right;
+      }
+
+      code,
+      tt {
+        margin: 0 2px;
+        padding: 0 5px;
+        white-space: nowrap;
+        border: 1px solid #eaeaea;
+        background-color: #f8f8f8;
+        border-radius: 3px;
+      }
+
+      pre code {
+        margin: 0;
+        padding: 0;
+        white-space: pre;
+        border: none;
+        background: transparent;
+      }
+
+      .highlight pre {
+        background-color: #f8f8f8;
+        border: 1px solid #cccccc;
+        font-size: 13px;
+        line-height: 19px;
+        overflow: auto;
+        padding: 6px 10px;
+        border-radius: 3px;
+      }
+
+      pre {
+        background-color: #f8f8f8;
+        border: 1px solid #cccccc;
+        font-size: 13px;
+        line-height: 19px;
+        overflow: auto;
+        padding: 6px 10px;
+        border-radius: 3px;
+      }
+
+      pre code,
+      pre tt {
+        background-color: transparent;
+        border: none;
+      }
+    </style>
+    <script>
+      /*!
+       * Chart.js v2.8.0
+       * https://www.chartjs.org
+       * (c) 2019 Chart.js Contributors
+       * Released under the MIT License
+       */
+      !(function (t, e) {
+        "object" == typeof exports && "undefined" != typeof module
+          ? (module.exports = e())
+          : "function" == typeof define && define.amd
+            ? define(e)
+            : (t.Chart = e());
+      })(this, function () {
+        "use strict";
+        var t = {
+          rgb2hsl: e,
+          rgb2hsv: i,
+          rgb2hwb: n,
+          rgb2cmyk: a,
+          rgb2keyword: o,
+          rgb2xyz: s,
+          rgb2lab: l,
+          rgb2lch: function (t) {
+            return v(l(t));
+          },
+          hsl2rgb: u,
+          hsl2hsv: function (t) {
+            var e = t[0],
+              i = t[1] / 100,
+              n = t[2] / 100;
+            if (0 === n) return [0, 0, 0];
+            return [e, 100 * ((2 * (i *= (n *= 2) <= 1 ? n : 2 - n)) / (n + i)), 100 * ((n + i) / 2)];
+          },
+          hsl2hwb: function (t) {
+            return n(u(t));
+          },
+          hsl2cmyk: function (t) {
+            return a(u(t));
+          },
+          hsl2keyword: function (t) {
+            return o(u(t));
+          },
+          hsv2rgb: d,
+          hsv2hsl: function (t) {
+            var e,
+              i,
+              n = t[0],
+              a = t[1] / 100,
+              r = t[2] / 100;
+            return (e = a * r), [n, 100 * (e = (e /= (i = (2 - a) * r) <= 1 ? i : 2 - i) || 0), 100 * (i /= 2)];
+          },
+          hsv2hwb: function (t) {
+            return n(d(t));
+          },
+          hsv2cmyk: function (t) {
+            return a(d(t));
+          },
+          hsv2keyword: function (t) {
+            return o(d(t));
+          },
+          hwb2rgb: h,
+          hwb2hsl: function (t) {
+            return e(h(t));
+          },
+          hwb2hsv: function (t) {
+            return i(h(t));
+          },
+          hwb2cmyk: function (t) {
+            return a(h(t));
+          },
+          hwb2keyword: function (t) {
+            return o(h(t));
+          },
+          cmyk2rgb: c,
+          cmyk2hsl: function (t) {
+            return e(c(t));
+          },
+          cmyk2hsv: function (t) {
+            return i(c(t));
+          },
+          cmyk2hwb: function (t) {
+            return n(c(t));
+          },
+          cmyk2keyword: function (t) {
+            return o(c(t));
+          },
+          keyword2rgb: _,
+          keyword2hsl: function (t) {
+            return e(_(t));
+          },
+          keyword2hsv: function (t) {
+            return i(_(t));
+          },
+          keyword2hwb: function (t) {
+            return n(_(t));
+          },
+          keyword2cmyk: function (t) {
+            return a(_(t));
+          },
+          keyword2lab: function (t) {
+            return l(_(t));
+          },
+          keyword2xyz: function (t) {
+            return s(_(t));
+          },
+          xyz2rgb: f,
+          xyz2lab: m,
+          xyz2lch: function (t) {
+            return v(m(t));
+          },
+          lab2xyz: p,
+          lab2rgb: y,
+          lab2lch: v,
+          lch2lab: x,
+          lch2xyz: function (t) {
+            return p(x(t));
+          },
+          lch2rgb: function (t) {
+            return y(x(t));
+          },
+        };
+        function e(t) {
+          var e,
+            i,
+            n = t[0] / 255,
+            a = t[1] / 255,
+            r = t[2] / 255,
+            o = Math.min(n, a, r),
+            s = Math.max(n, a, r),
+            l = s - o;
+          return (
+            s == o
+              ? (e = 0)
+              : n == s
+                ? (e = (a - r) / l)
+                : a == s
+                  ? (e = 2 + (r - n) / l)
+                  : r == s && (e = 4 + (n - a) / l),
+            (e = Math.min(60 * e, 360)) < 0 && (e += 360),
+            (i = (o + s) / 2),
+            [e, 100 * (s == o ? 0 : i <= 0.5 ? l / (s + o) : l / (2 - s - o)), 100 * i]
+          );
+        }
+        function i(t) {
+          var e,
+            i,
+            n = t[0],
+            a = t[1],
+            r = t[2],
+            o = Math.min(n, a, r),
+            s = Math.max(n, a, r),
+            l = s - o;
+          return (
+            (i = 0 == s ? 0 : ((l / s) * 1e3) / 10),
+            s == o
+              ? (e = 0)
+              : n == s
+                ? (e = (a - r) / l)
+                : a == s
+                  ? (e = 2 + (r - n) / l)
+                  : r == s && (e = 4 + (n - a) / l),
+            (e = Math.min(60 * e, 360)) < 0 && (e += 360),
+            [e, i, ((s / 255) * 1e3) / 10]
+          );
+        }
+        function n(t) {
+          var i = t[0],
+            n = t[1],
+            a = t[2];
+          return [
+            e(t)[0],
+            100 * ((1 / 255) * Math.min(i, Math.min(n, a))),
+            100 * (a = 1 - (1 / 255) * Math.max(i, Math.max(n, a))),
+          ];
+        }
+        function a(t) {
+          var e,
+            i = t[0] / 255,
+            n = t[1] / 255,
+            a = t[2] / 255;
+          return [
+            100 * ((1 - i - (e = Math.min(1 - i, 1 - n, 1 - a))) / (1 - e) || 0),
+            100 * ((1 - n - e) / (1 - e) || 0),
+            100 * ((1 - a - e) / (1 - e) || 0),
+            100 * e,
+          ];
+        }
+        function o(t) {
+          return w[JSON.stringify(t)];
+        }
+        function s(t) {
+          var e = t[0] / 255,
+            i = t[1] / 255,
+            n = t[2] / 255;
+          return [
+            100 *
+              (0.4124 * (e = e > 0.04045 ? Math.pow((e + 0.055) / 1.055, 2.4) : e / 12.92) +
+                0.3576 * (i = i > 0.04045 ? Math.pow((i + 0.055) / 1.055, 2.4) : i / 12.92) +
+                0.1805 * (n = n > 0.04045 ? Math.pow((n + 0.055) / 1.055, 2.4) : n / 12.92)),
+            100 * (0.2126 * e + 0.7152 * i + 0.0722 * n),
+            100 * (0.0193 * e + 0.1192 * i + 0.9505 * n),
+          ];
+        }
+        function l(t) {
+          var e = s(t),
+            i = e[0],
+            n = e[1],
+            a = e[2];
+          return (
+            (n /= 100),
+            (a /= 108.883),
+            (i = (i /= 95.047) > 0.008856 ? Math.pow(i, 1 / 3) : 7.787 * i + 16 / 116),
+            [
+              116 * (n = n > 0.008856 ? Math.pow(n, 1 / 3) : 7.787 * n + 16 / 116) - 16,
+              500 * (i - n),
+              200 * (n - (a = a > 0.008856 ? Math.pow(a, 1 / 3) : 7.787 * a + 16 / 116)),
+            ]
+          );
+        }
+        function u(t) {
+          var e,
+            i,
+            n,
+            a,
+            r,
+            o = t[0] / 360,
+            s = t[1] / 100,
+            l = t[2] / 100;
+          if (0 == s) return [(r = 255 * l), r, r];
+          (e = 2 * l - (i = l < 0.5 ? l * (1 + s) : l + s - l * s)), (a = [0, 0, 0]);
+          for (var u = 0; u < 3; u++)
+            (n = o + (1 / 3) * -(u - 1)) < 0 && n++,
+              n > 1 && n--,
+              (r = 6 * n < 1 ? e + 6 * (i - e) * n : 2 * n < 1 ? i : 3 * n < 2 ? e + (i - e) * (2 / 3 - n) * 6 : e),
+              (a[u] = 255 * r);
+          return a;
+        }
+        function d(t) {
+          var e = t[0] / 60,
+            i = t[1] / 100,
+            n = t[2] / 100,
+            a = Math.floor(e) % 6,
+            r = e - Math.floor(e),
+            o = 255 * n * (1 - i),
+            s = 255 * n * (1 - i * r),
+            l = 255 * n * (1 - i * (1 - r));
+          n *= 255;
+          switch (a) {
+            case 0:
+              return [n, l, o];
+            case 1:
+              return [s, n, o];
+            case 2:
+              return [o, n, l];
+            case 3:
+              return [o, s, n];
+            case 4:
+              return [l, o, n];
+            case 5:
+              return [n, o, s];
+          }
+        }
+        function h(t) {
+          var e,
+            i,
+            n,
+            a,
+            o = t[0] / 360,
+            s = t[1] / 100,
+            l = t[2] / 100,
+            u = s + l;
+          switch (
+            (u > 1 && ((s /= u), (l /= u)),
+            (n = 6 * o - (e = Math.floor(6 * o))),
+            0 != (1 & e) && (n = 1 - n),
+            (a = s + n * ((i = 1 - l) - s)),
+            e)
+          ) {
+            default:
+            case 6:
+            case 0:
+              (r = i), (g = a), (b = s);
+              break;
+            case 1:
+              (r = a), (g = i), (b = s);
+              break;
+            case 2:
+              (r = s), (g = i), (b = a);
+              break;
+            case 3:
+              (r = s), (g = a), (b = i);
+              break;
+            case 4:
+              (r = a), (g = s), (b = i);
+              break;
+            case 5:
+              (r = i), (g = s), (b = a);
+          }
+          return [255 * r, 255 * g, 255 * b];
+        }
+        function c(t) {
+          var e = t[0] / 100,
+            i = t[1] / 100,
+            n = t[2] / 100,
+            a = t[3] / 100;
+          return [
+            255 * (1 - Math.min(1, e * (1 - a) + a)),
+            255 * (1 - Math.min(1, i * (1 - a) + a)),
+            255 * (1 - Math.min(1, n * (1 - a) + a)),
+          ];
+        }
+        function f(t) {
+          var e,
+            i,
+            n,
+            a = t[0] / 100,
+            r = t[1] / 100,
+            o = t[2] / 100;
+          return (
+            (i = -0.9689 * a + 1.8758 * r + 0.0415 * o),
+            (n = 0.0557 * a + -0.204 * r + 1.057 * o),
+            (e =
+              (e = 3.2406 * a + -1.5372 * r + -0.4986 * o) > 0.0031308
+                ? 1.055 * Math.pow(e, 1 / 2.4) - 0.055
+                : (e *= 12.92)),
+            (i = i > 0.0031308 ? 1.055 * Math.pow(i, 1 / 2.4) - 0.055 : (i *= 12.92)),
+            (n = n > 0.0031308 ? 1.055 * Math.pow(n, 1 / 2.4) - 0.055 : (n *= 12.92)),
+            [
+              255 * (e = Math.min(Math.max(0, e), 1)),
+              255 * (i = Math.min(Math.max(0, i), 1)),
+              255 * (n = Math.min(Math.max(0, n), 1)),
+            ]
+          );
+        }
+        function m(t) {
+          var e = t[0],
+            i = t[1],
+            n = t[2];
+          return (
+            (i /= 100),
+            (n /= 108.883),
+            (e = (e /= 95.047) > 0.008856 ? Math.pow(e, 1 / 3) : 7.787 * e + 16 / 116),
+            [
+              116 * (i = i > 0.008856 ? Math.pow(i, 1 / 3) : 7.787 * i + 16 / 116) - 16,
+              500 * (e - i),
+              200 * (i - (n = n > 0.008856 ? Math.pow(n, 1 / 3) : 7.787 * n + 16 / 116)),
+            ]
+          );
+        }
+        function p(t) {
+          var e,
+            i,
+            n,
+            a,
+            r = t[0],
+            o = t[1],
+            s = t[2];
+          return (
+            r <= 8
+              ? (a = ((i = (100 * r) / 903.3) / 100) * 7.787 + 16 / 116)
+              : ((i = 100 * Math.pow((r + 16) / 116, 3)), (a = Math.pow(i / 100, 1 / 3))),
+            [
+              (e =
+                e / 95.047 <= 0.008856
+                  ? (e = (95.047 * (o / 500 + a - 16 / 116)) / 7.787)
+                  : 95.047 * Math.pow(o / 500 + a, 3)),
+              i,
+              (n =
+                n / 108.883 <= 0.008859
+                  ? (n = (108.883 * (a - s / 200 - 16 / 116)) / 7.787)
+                  : 108.883 * Math.pow(a - s / 200, 3)),
+            ]
+          );
+        }
+        function v(t) {
+          var e,
+            i = t[0],
+            n = t[1],
+            a = t[2];
+          return (e = (360 * Math.atan2(a, n)) / 2 / Math.PI) < 0 && (e += 360), [i, Math.sqrt(n * n + a * a), e];
+        }
+        function y(t) {
+          return f(p(t));
+        }
+        function x(t) {
+          var e,
+            i = t[0],
+            n = t[1];
+          return (e = (t[2] / 360) * 2 * Math.PI), [i, n * Math.cos(e), n * Math.sin(e)];
+        }
+        function _(t) {
+          return k[t];
+        }
+        var k = {
+            aliceblue: [240, 248, 255],
+            antiquewhite: [250, 235, 215],
+            aqua: [0, 255, 255],
+            aquamarine: [127, 255, 212],
+            azure: [240, 255, 255],
+            beige: [245, 245, 220],
+            bisque: [255, 228, 196],
+            black: [0, 0, 0],
+            blanchedalmond: [255, 235, 205],
+            blue: [0, 0, 255],
+            blueviolet: [138, 43, 226],
+            brown: [165, 42, 42],
+            burlywood: [222, 184, 135],
+            cadetblue: [95, 158, 160],
+            chartreuse: [127, 255, 0],
+            chocolate: [210, 105, 30],
+            coral: [255, 127, 80],
+            cornflowerblue: [100, 149, 237],
+            cornsilk: [255, 248, 220],
+            crimson: [220, 20, 60],
+            cyan: [0, 255, 255],
+            darkblue: [0, 0, 139],
+            darkcyan: [0, 139, 139],
+            darkgoldenrod: [184, 134, 11],
+            darkgray: [169, 169, 169],
+            darkgreen: [0, 100, 0],
+            darkgrey: [169, 169, 169],
+            darkkhaki: [189, 183, 107],
+            darkmagenta: [139, 0, 139],
+            darkolivegreen: [85, 107, 47],
+            darkorange: [255, 140, 0],
+            darkorchid: [153, 50, 204],
+            darkred: [139, 0, 0],
+            darksalmon: [233, 150, 122],
+            darkseagreen: [143, 188, 143],
+            darkslateblue: [72, 61, 139],
+            darkslategray: [47, 79, 79],
+            darkslategrey: [47, 79, 79],
+            darkturquoise: [0, 206, 209],
+            darkviolet: [148, 0, 211],
+            deeppink: [255, 20, 147],
+            deepskyblue: [0, 191, 255],
+            dimgray: [105, 105, 105],
+            dimgrey: [105, 105, 105],
+            dodgerblue: [30, 144, 255],
+            firebrick: [178, 34, 34],
+            floralwhite: [255, 250, 240],
+            forestgreen: [34, 139, 34],
+            fuchsia: [255, 0, 255],
+            gainsboro: [220, 220, 220],
+            ghostwhite: [248, 248, 255],
+            gold: [255, 215, 0],
+            goldenrod: [218, 165, 32],
+            gray: [128, 128, 128],
+            green: [0, 128, 0],
+            greenyellow: [173, 255, 47],
+            grey: [128, 128, 128],
+            honeydew: [240, 255, 240],
+            hotpink: [255, 105, 180],
+            indianred: [205, 92, 92],
+            indigo: [75, 0, 130],
+            ivory: [255, 255, 240],
+            khaki: [240, 230, 140],
+            lavender: [230, 230, 250],
+            lavenderblush: [255, 240, 245],
+            lawngreen: [124, 252, 0],
+            lemonchiffon: [255, 250, 205],
+            lightblue: [173, 216, 230],
+            lightcoral: [240, 128, 128],
+            lightcyan: [224, 255, 255],
+            lightgoldenrodyellow: [250, 250, 210],
+            lightgray: [211, 211, 211],
+            lightgreen: [144, 238, 144],
+            lightgrey: [211, 211, 211],
+            lightpink: [255, 182, 193],
+            lightsalmon: [255, 160, 122],
+            lightseagreen: [32, 178, 170],
+            lightskyblue: [135, 206, 250],
+            lightslategray: [119, 136, 153],
+            lightslategrey: [119, 136, 153],
+            lightsteelblue: [176, 196, 222],
+            lightyellow: [255, 255, 224],
+            lime: [0, 255, 0],
+            limegreen: [50, 205, 50],
+            linen: [250, 240, 230],
+            magenta: [255, 0, 255],
+            maroon: [128, 0, 0],
+            mediumaquamarine: [102, 205, 170],
+            mediumblue: [0, 0, 205],
+            mediumorchid: [186, 85, 211],
+            mediumpurple: [147, 112, 219],
+            mediumseagreen: [60, 179, 113],
+            mediumslateblue: [123, 104, 238],
+            mediumspringgreen: [0, 250, 154],
+            mediumturquoise: [72, 209, 204],
+            mediumvioletred: [199, 21, 133],
+            midnightblue: [25, 25, 112],
+            mintcream: [245, 255, 250],
+            mistyrose: [255, 228, 225],
+            moccasin: [255, 228, 181],
+            navajowhite: [255, 222, 173],
+            navy: [0, 0, 128],
+            oldlace: [253, 245, 230],
+            olive: [128, 128, 0],
+            olivedrab: [107, 142, 35],
+            orange: [255, 165, 0],
+            orangered: [255, 69, 0],
+            orchid: [218, 112, 214],
+            palegoldenrod: [238, 232, 170],
+            palegreen: [152, 251, 152],
+            paleturquoise: [175, 238, 238],
+            palevioletred: [219, 112, 147],
+            papayawhip: [255, 239, 213],
+            peachpuff: [255, 218, 185],
+            peru: [205, 133, 63],
+            pink: [255, 192, 203],
+            plum: [221, 160, 221],
+            powderblue: [176, 224, 230],
+            purple: [128, 0, 128],
+            rebeccapurple: [102, 51, 153],
+            red: [255, 0, 0],
+            rosybrown: [188, 143, 143],
+            royalblue: [65, 105, 225],
+            saddlebrown: [139, 69, 19],
+            salmon: [250, 128, 114],
+            sandybrown: [244, 164, 96],
+            seagreen: [46, 139, 87],
+            seashell: [255, 245, 238],
+            sienna: [160, 82, 45],
+            silver: [192, 192, 192],
+            skyblue: [135, 206, 235],
+            slateblue: [106, 90, 205],
+            slategray: [112, 128, 144],
+            slategrey: [112, 128, 144],
+            snow: [255, 250, 250],
+            springgreen: [0, 255, 127],
+            steelblue: [70, 130, 180],
+            tan: [210, 180, 140],
+            teal: [0, 128, 128],
+            thistle: [216, 191, 216],
+            tomato: [255, 99, 71],
+            turquoise: [64, 224, 208],
+            violet: [238, 130, 238],
+            wheat: [245, 222, 179],
+            white: [255, 255, 255],
+            whitesmoke: [245, 245, 245],
+            yellow: [255, 255, 0],
+            yellowgreen: [154, 205, 50],
+          },
+          w = {};
+        for (var M in k) w[JSON.stringify(k[M])] = M;
+        var S = function () {
+          return new O();
+        };
+        for (var D in t) {
+          S[D + "Raw"] = (function (e) {
+            return function (i) {
+              return "number" == typeof i && (i = Array.prototype.slice.call(arguments)), t[e](i);
+            };
+          })(D);
+          var C = /(\w+)2(\w+)/.exec(D),
+            P = C[1],
+            T = C[2];
+          (S[P] = S[P] || {})[T] = S[D] = (function (e) {
+            return function (i) {
+              "number" == typeof i && (i = Array.prototype.slice.call(arguments));
+              var n = t[e](i);
+              if ("string" == typeof n || void 0 === n) return n;
+              for (var a = 0; a < n.length; a++) n[a] = Math.round(n[a]);
+              return n;
+            };
+          })(D);
+        }
+        var O = function () {
+          this.convs = {};
+        };
+        (O.prototype.routeSpace = function (t, e) {
+          var i = e[0];
+          return void 0 === i
+            ? this.getValues(t)
+            : ("number" == typeof i && (i = Array.prototype.slice.call(e)), this.setValues(t, i));
+        }),
+          (O.prototype.setValues = function (t, e) {
+            return (this.space = t), (this.convs = {}), (this.convs[t] = e), this;
+          }),
+          (O.prototype.getValues = function (t) {
+            var e = this.convs[t];
+            if (!e) {
+              var i = this.space,
+                n = this.convs[i];
+              (e = S[i][t](n)), (this.convs[t] = e);
+            }
+            return e;
+          }),
+          ["rgb", "hsl", "hsv", "cmyk", "keyword"].forEach(function (t) {
+            O.prototype[t] = function (e) {
+              return this.routeSpace(t, arguments);
+            };
+          });
+        var I = S,
+          A = {
+            aliceblue: [240, 248, 255],
+            antiquewhite: [250, 235, 215],
+            aqua: [0, 255, 255],
+            aquamarine: [127, 255, 212],
+            azure: [240, 255, 255],
+            beige: [245, 245, 220],
+            bisque: [255, 228, 196],
+            black: [0, 0, 0],
+            blanchedalmond: [255, 235, 205],
+            blue: [0, 0, 255],
+            blueviolet: [138, 43, 226],
+            brown: [165, 42, 42],
+            burlywood: [222, 184, 135],
+            cadetblue: [95, 158, 160],
+            chartreuse: [127, 255, 0],
+            chocolate: [210, 105, 30],
+            coral: [255, 127, 80],
+            cornflowerblue: [100, 149, 237],
+            cornsilk: [255, 248, 220],
+            crimson: [220, 20, 60],
+            cyan: [0, 255, 255],
+            darkblue: [0, 0, 139],
+            darkcyan: [0, 139, 139],
+            darkgoldenrod: [184, 134, 11],
+            darkgray: [169, 169, 169],
+            darkgreen: [0, 100, 0],
+            darkgrey: [169, 169, 169],
+            darkkhaki: [189, 183, 107],
+            darkmagenta: [139, 0, 139],
+            darkolivegreen: [85, 107, 47],
+            darkorange: [255, 140, 0],
+            darkorchid: [153, 50, 204],
+            darkred: [139, 0, 0],
+            darksalmon: [233, 150, 122],
+            darkseagreen: [143, 188, 143],
+            darkslateblue: [72, 61, 139],
+            darkslategray: [47, 79, 79],
+            darkslategrey: [47, 79, 79],
+            darkturquoise: [0, 206, 209],
+            darkviolet: [148, 0, 211],
+            deeppink: [255, 20, 147],
+            deepskyblue: [0, 191, 255],
+            dimgray: [105, 105, 105],
+            dimgrey: [105, 105, 105],
+            dodgerblue: [30, 144, 255],
+            firebrick: [178, 34, 34],
+            floralwhite: [255, 250, 240],
+            forestgreen: [34, 139, 34],
+            fuchsia: [255, 0, 255],
+            gainsboro: [220, 220, 220],
+            ghostwhite: [248, 248, 255],
+            gold: [255, 215, 0],
+            goldenrod: [218, 165, 32],
+            gray: [128, 128, 128],
+            green: [0, 128, 0],
+            greenyellow: [173, 255, 47],
+            grey: [128, 128, 128],
+            honeydew: [240, 255, 240],
+            hotpink: [255, 105, 180],
+            indianred: [205, 92, 92],
+            indigo: [75, 0, 130],
+            ivory: [255, 255, 240],
+            khaki: [240, 230, 140],
+            lavender: [230, 230, 250],
+            lavenderblush: [255, 240, 245],
+            lawngreen: [124, 252, 0],
+            lemonchiffon: [255, 250, 205],
+            lightblue: [173, 216, 230],
+            lightcoral: [240, 128, 128],
+            lightcyan: [224, 255, 255],
+            lightgoldenrodyellow: [250, 250, 210],
+            lightgray: [211, 211, 211],
+            lightgreen: [144, 238, 144],
+            lightgrey: [211, 211, 211],
+            lightpink: [255, 182, 193],
+            lightsalmon: [255, 160, 122],
+            lightseagreen: [32, 178, 170],
+            lightskyblue: [135, 206, 250],
+            lightslategray: [119, 136, 153],
+            lightslategrey: [119, 136, 153],
+            lightsteelblue: [176, 196, 222],
+            lightyellow: [255, 255, 224],
+            lime: [0, 255, 0],
+            limegreen: [50, 205, 50],
+            linen: [250, 240, 230],
+            magenta: [255, 0, 255],
+            maroon: [128, 0, 0],
+            mediumaquamarine: [102, 205, 170],
+            mediumblue: [0, 0, 205],
+            mediumorchid: [186, 85, 211],
+            mediumpurple: [147, 112, 219],
+            mediumseagreen: [60, 179, 113],
+            mediumslateblue: [123, 104, 238],
+            mediumspringgreen: [0, 250, 154],
+            mediumturquoise: [72, 209, 204],
+            mediumvioletred: [199, 21, 133],
+            midnightblue: [25, 25, 112],
+            mintcream: [245, 255, 250],
+            mistyrose: [255, 228, 225],
+            moccasin: [255, 228, 181],
+            navajowhite: [255, 222, 173],
+            navy: [0, 0, 128],
+            oldlace: [253, 245, 230],
+            olive: [128, 128, 0],
+            olivedrab: [107, 142, 35],
+            orange: [255, 165, 0],
+            orangered: [255, 69, 0],
+            orchid: [218, 112, 214],
+            palegoldenrod: [238, 232, 170],
+            palegreen: [152, 251, 152],
+            paleturquoise: [175, 238, 238],
+            palevioletred: [219, 112, 147],
+            papayawhip: [255, 239, 213],
+            peachpuff: [255, 218, 185],
+            peru: [205, 133, 63],
+            pink: [255, 192, 203],
+            plum: [221, 160, 221],
+            powderblue: [176, 224, 230],
+            purple: [128, 0, 128],
+            rebeccapurple: [102, 51, 153],
+            red: [255, 0, 0],
+            rosybrown: [188, 143, 143],
+            royalblue: [65, 105, 225],
+            saddlebrown: [139, 69, 19],
+            salmon: [250, 128, 114],
+            sandybrown: [244, 164, 96],
+            seagreen: [46, 139, 87],
+            seashell: [255, 245, 238],
+            sienna: [160, 82, 45],
+            silver: [192, 192, 192],
+            skyblue: [135, 206, 235],
+            slateblue: [106, 90, 205],
+            slategray: [112, 128, 144],
+            slategrey: [112, 128, 144],
+            snow: [255, 250, 250],
+            springgreen: [0, 255, 127],
+            steelblue: [70, 130, 180],
+            tan: [210, 180, 140],
+            teal: [0, 128, 128],
+            thistle: [216, 191, 216],
+            tomato: [255, 99, 71],
+            turquoise: [64, 224, 208],
+            violet: [238, 130, 238],
+            wheat: [245, 222, 179],
+            white: [255, 255, 255],
+            whitesmoke: [245, 245, 245],
+            yellow: [255, 255, 0],
+            yellowgreen: [154, 205, 50],
+          },
+          F = {
+            getRgba: R,
+            getHsla: L,
+            getRgb: function (t) {
+              var e = R(t);
+              return e && e.slice(0, 3);
+            },
+            getHsl: function (t) {
+              var e = L(t);
+              return e && e.slice(0, 3);
+            },
+            getHwb: W,
+            getAlpha: function (t) {
+              var e = R(t);
+              if (e) return e[3];
+              if ((e = L(t))) return e[3];
+              if ((e = W(t))) return e[3];
+            },
+            hexString: function (t, e) {
+              var e = void 0 !== e && 3 === t.length ? e : t[3];
+              return "#" + H(t[0]) + H(t[1]) + H(t[2]) + (e >= 0 && e < 1 ? H(Math.round(255 * e)) : "");
+            },
+            rgbString: function (t, e) {
+              if (e < 1 || (t[3] && t[3] < 1)) return Y(t, e);
+              return "rgb(" + t[0] + ", " + t[1] + ", " + t[2] + ")";
+            },
+            rgbaString: Y,
+            percentString: function (t, e) {
+              if (e < 1 || (t[3] && t[3] < 1)) return N(t, e);
+              var i = Math.round((t[0] / 255) * 100),
+                n = Math.round((t[1] / 255) * 100),
+                a = Math.round((t[2] / 255) * 100);
+              return "rgb(" + i + "%, " + n + "%, " + a + "%)";
+            },
+            percentaString: N,
+            hslString: function (t, e) {
+              if (e < 1 || (t[3] && t[3] < 1)) return z(t, e);
+              return "hsl(" + t[0] + ", " + t[1] + "%, " + t[2] + "%)";
+            },
+            hslaString: z,
+            hwbString: function (t, e) {
+              void 0 === e && (e = void 0 !== t[3] ? t[3] : 1);
+              return "hwb(" + t[0] + ", " + t[1] + "%, " + t[2] + "%" + (void 0 !== e && 1 !== e ? ", " + e : "") + ")";
+            },
+            keyword: function (t) {
+              return E[t.slice(0, 3)];
+            },
+          };
+        function R(t) {
+          if (t) {
+            var e = [0, 0, 0],
+              i = 1,
+              n = t.match(/^#([a-fA-F0-9]{3,4})$/i),
+              a = "";
+            if (n) {
+              a = (n = n[1])[3];
+              for (var r = 0; r < e.length; r++) e[r] = parseInt(n[r] + n[r], 16);
+              a && (i = Math.round((parseInt(a + a, 16) / 255) * 100) / 100);
+            } else if ((n = t.match(/^#([a-fA-F0-9]{6}([a-fA-F0-9]{2})?)$/i))) {
+              (a = n[2]), (n = n[1]);
+              for (r = 0; r < e.length; r++) e[r] = parseInt(n.slice(2 * r, 2 * r + 2), 16);
+              a && (i = Math.round((parseInt(a, 16) / 255) * 100) / 100);
+            } else if (
+              (n = t.match(/^rgba?\(\s*([+-]?\d+)\s*,\s*([+-]?\d+)\s*,\s*([+-]?\d+)\s*(?:,\s*([+-]?[\d\.]+)\s*)?\)$/i))
+            ) {
+              for (r = 0; r < e.length; r++) e[r] = parseInt(n[r + 1]);
+              i = parseFloat(n[4]);
+            } else if (
+              (n = t.match(
+                /^rgba?\(\s*([+-]?[\d\.]+)\%\s*,\s*([+-]?[\d\.]+)\%\s*,\s*([+-]?[\d\.]+)\%\s*(?:,\s*([+-]?[\d\.]+)\s*)?\)$/i
+              ))
+            ) {
+              for (r = 0; r < e.length; r++) e[r] = Math.round(2.55 * parseFloat(n[r + 1]));
+              i = parseFloat(n[4]);
+            } else if ((n = t.match(/(\w+)/))) {
+              if ("transparent" == n[1]) return [0, 0, 0, 0];
+              if (!(e = A[n[1]])) return;
+            }
+            for (r = 0; r < e.length; r++) e[r] = V(e[r], 0, 255);
+            return (i = i || 0 == i ? V(i, 0, 1) : 1), (e[3] = i), e;
+          }
+        }
+        function L(t) {
+          if (t) {
+            var e = t.match(
+              /^hsla?\(\s*([+-]?\d+)(?:deg)?\s*,\s*([+-]?[\d\.]+)%\s*,\s*([+-]?[\d\.]+)%\s*(?:,\s*([+-]?[\d\.]+)\s*)?\)/
+            );
+            if (e) {
+              var i = parseFloat(e[4]);
+              return [
+                V(parseInt(e[1]), 0, 360),
+                V(parseFloat(e[2]), 0, 100),
+                V(parseFloat(e[3]), 0, 100),
+                V(isNaN(i) ? 1 : i, 0, 1),
+              ];
+            }
+          }
+        }
+        function W(t) {
+          if (t) {
+            var e = t.match(
+              /^hwb\(\s*([+-]?\d+)(?:deg)?\s*,\s*([+-]?[\d\.]+)%\s*,\s*([+-]?[\d\.]+)%\s*(?:,\s*([+-]?[\d\.]+)\s*)?\)/
+            );
+            if (e) {
+              var i = parseFloat(e[4]);
+              return [
+                V(parseInt(e[1]), 0, 360),
+                V(parseFloat(e[2]), 0, 100),
+                V(parseFloat(e[3]), 0, 100),
+                V(isNaN(i) ? 1 : i, 0, 1),
+              ];
+            }
+          }
+        }
+        function Y(t, e) {
+          return (
+            void 0 === e && (e = void 0 !== t[3] ? t[3] : 1),
+            "rgba(" + t[0] + ", " + t[1] + ", " + t[2] + ", " + e + ")"
+          );
+        }
+        function N(t, e) {
+          return (
+            "rgba(" +
+            Math.round((t[0] / 255) * 100) +
+            "%, " +
+            Math.round((t[1] / 255) * 100) +
+            "%, " +
+            Math.round((t[2] / 255) * 100) +
+            "%, " +
+            (e || t[3] || 1) +
+            ")"
+          );
+        }
+        function z(t, e) {
+          return (
+            void 0 === e && (e = void 0 !== t[3] ? t[3] : 1),
+            "hsla(" + t[0] + ", " + t[1] + "%, " + t[2] + "%, " + e + ")"
+          );
+        }
+        function V(t, e, i) {
+          return Math.min(Math.max(e, t), i);
+        }
+        function H(t) {
+          var e = t.toString(16).toUpperCase();
+          return e.length < 2 ? "0" + e : e;
+        }
+        var E = {};
+        for (var B in A) E[A[B]] = B;
+        var j = function (t) {
+          return t instanceof j
+            ? t
+            : this instanceof j
+              ? ((this.valid = !1),
+                (this.values = {
+                  rgb: [0, 0, 0],
+                  hsl: [0, 0, 0],
+                  hsv: [0, 0, 0],
+                  hwb: [0, 0, 0],
+                  cmyk: [0, 0, 0, 0],
+                  alpha: 1,
+                }),
+                void ("string" == typeof t
+                  ? (e = F.getRgba(t))
+                    ? this.setValues("rgb", e)
+                    : (e = F.getHsla(t))
+                      ? this.setValues("hsl", e)
+                      : (e = F.getHwb(t)) && this.setValues("hwb", e)
+                  : "object" == typeof t &&
+                    (void 0 !== (e = t).r || void 0 !== e.red
+                      ? this.setValues("rgb", e)
+                      : void 0 !== e.l || void 0 !== e.lightness
+                        ? this.setValues("hsl", e)
+                        : void 0 !== e.v || void 0 !== e.value
+                          ? this.setValues("hsv", e)
+                          : void 0 !== e.w || void 0 !== e.whiteness
+                            ? this.setValues("hwb", e)
+                            : (void 0 === e.c && void 0 === e.cyan) || this.setValues("cmyk", e))))
+              : new j(t);
+          var e;
+        };
+        (j.prototype = {
+          isValid: function () {
+            return this.valid;
+          },
+          rgb: function () {
+            return this.setSpace("rgb", arguments);
+          },
+          hsl: function () {
+            return this.setSpace("hsl", arguments);
+          },
+          hsv: function () {
+            return this.setSpace("hsv", arguments);
+          },
+          hwb: function () {
+            return this.setSpace("hwb", arguments);
+          },
+          cmyk: function () {
+            return this.setSpace("cmyk", arguments);
+          },
+          rgbArray: function () {
+            return this.values.rgb;
+          },
+          hslArray: function () {
+            return this.values.hsl;
+          },
+          hsvArray: function () {
+            return this.values.hsv;
+          },
+          hwbArray: function () {
+            var t = this.values;
+            return 1 !== t.alpha ? t.hwb.concat([t.alpha]) : t.hwb;
+          },
+          cmykArray: function () {
+            return this.values.cmyk;
+          },
+          rgbaArray: function () {
+            var t = this.values;
+            return t.rgb.concat([t.alpha]);
+          },
+          hslaArray: function () {
+            var t = this.values;
+            return t.hsl.concat([t.alpha]);
+          },
+          alpha: function (t) {
+            return void 0 === t ? this.values.alpha : (this.setValues("alpha", t), this);
+          },
+          red: function (t) {
+            return this.setChannel("rgb", 0, t);
+          },
+          green: function (t) {
+            return this.setChannel("rgb", 1, t);
+          },
+          blue: function (t) {
+            return this.setChannel("rgb", 2, t);
+          },
+          hue: function (t) {
+            return t && (t = (t %= 360) < 0 ? 360 + t : t), this.setChannel("hsl", 0, t);
+          },
+          saturation: function (t) {
+            return this.setChannel("hsl", 1, t);
+          },
+          lightness: function (t) {
+            return this.setChannel("hsl", 2, t);
+          },
+          saturationv: function (t) {
+            return this.setChannel("hsv", 1, t);
+          },
+          whiteness: function (t) {
+            return this.setChannel("hwb", 1, t);
+          },
+          blackness: function (t) {
+            return this.setChannel("hwb", 2, t);
+          },
+          value: function (t) {
+            return this.setChannel("hsv", 2, t);
+          },
+          cyan: function (t) {
+            return this.setChannel("cmyk", 0, t);
+          },
+          magenta: function (t) {
+            return this.setChannel("cmyk", 1, t);
+          },
+          yellow: function (t) {
+            return this.setChannel("cmyk", 2, t);
+          },
+          black: function (t) {
+            return this.setChannel("cmyk", 3, t);
+          },
+          hexString: function () {
+            return F.hexString(this.values.rgb);
+          },
+          rgbString: function () {
+            return F.rgbString(this.values.rgb, this.values.alpha);
+          },
+          rgbaString: function () {
+            return F.rgbaString(this.values.rgb, this.values.alpha);
+          },
+          percentString: function () {
+            return F.percentString(this.values.rgb, this.values.alpha);
+          },
+          hslString: function () {
+            return F.hslString(this.values.hsl, this.values.alpha);
+          },
+          hslaString: function () {
+            return F.hslaString(this.values.hsl, this.values.alpha);
+          },
+          hwbString: function () {
+            return F.hwbString(this.values.hwb, this.values.alpha);
+          },
+          keyword: function () {
+            return F.keyword(this.values.rgb, this.values.alpha);
+          },
+          rgbNumber: function () {
+            var t = this.values.rgb;
+            return (t[0] << 16) | (t[1] << 8) | t[2];
+          },
+          luminosity: function () {
+            for (var t = this.values.rgb, e = [], i = 0; i < t.length; i++) {
+              var n = t[i] / 255;
+              e[i] = n <= 0.03928 ? n / 12.92 : Math.pow((n + 0.055) / 1.055, 2.4);
+            }
+            return 0.2126 * e[0] + 0.7152 * e[1] + 0.0722 * e[2];
+          },
+          contrast: function (t) {
+            var e = this.luminosity(),
+              i = t.luminosity();
+            return e > i ? (e + 0.05) / (i + 0.05) : (i + 0.05) / (e + 0.05);
+          },
+          level: function (t) {
+            var e = this.contrast(t);
+            return e >= 7.1 ? "AAA" : e >= 4.5 ? "AA" : "";
+          },
+          dark: function () {
+            var t = this.values.rgb;
+            return (299 * t[0] + 587 * t[1] + 114 * t[2]) / 1e3 < 128;
+          },
+          light: function () {
+            return !this.dark();
+          },
+          negate: function () {
+            for (var t = [], e = 0; e < 3; e++) t[e] = 255 - this.values.rgb[e];
+            return this.setValues("rgb", t), this;
+          },
+          lighten: function (t) {
+            var e = this.values.hsl;
+            return (e[2] += e[2] * t), this.setValues("hsl", e), this;
+          },
+          darken: function (t) {
+            var e = this.values.hsl;
+            return (e[2] -= e[2] * t), this.setValues("hsl", e), this;
+          },
+          saturate: function (t) {
+            var e = this.values.hsl;
+            return (e[1] += e[1] * t), this.setValues("hsl", e), this;
+          },
+          desaturate: function (t) {
+            var e = this.values.hsl;
+            return (e[1] -= e[1] * t), this.setValues("hsl", e), this;
+          },
+          whiten: function (t) {
+            var e = this.values.hwb;
+            return (e[1] += e[1] * t), this.setValues("hwb", e), this;
+          },
+          blacken: function (t) {
+            var e = this.values.hwb;
+            return (e[2] += e[2] * t), this.setValues("hwb", e), this;
+          },
+          greyscale: function () {
+            var t = this.values.rgb,
+              e = 0.3 * t[0] + 0.59 * t[1] + 0.11 * t[2];
+            return this.setValues("rgb", [e, e, e]), this;
+          },
+          clearer: function (t) {
+            var e = this.values.alpha;
+            return this.setValues("alpha", e - e * t), this;
+          },
+          opaquer: function (t) {
+            var e = this.values.alpha;
+            return this.setValues("alpha", e + e * t), this;
+          },
+          rotate: function (t) {
+            var e = this.values.hsl,
+              i = (e[0] + t) % 360;
+            return (e[0] = i < 0 ? 360 + i : i), this.setValues("hsl", e), this;
+          },
+          mix: function (t, e) {
+            var i = t,
+              n = void 0 === e ? 0.5 : e,
+              a = 2 * n - 1,
+              r = this.alpha() - i.alpha(),
+              o = ((a * r == -1 ? a : (a + r) / (1 + a * r)) + 1) / 2,
+              s = 1 - o;
+            return this.rgb(
+              o * this.red() + s * i.red(),
+              o * this.green() + s * i.green(),
+              o * this.blue() + s * i.blue()
+            ).alpha(this.alpha() * n + i.alpha() * (1 - n));
+          },
+          toJSON: function () {
+            return this.rgb();
+          },
+          clone: function () {
+            var t,
+              e,
+              i = new j(),
+              n = this.values,
+              a = i.values;
+            for (var r in n)
+              n.hasOwnProperty(r) &&
+                ((t = n[r]),
+                "[object Array]" === (e = {}.toString.call(t))
+                  ? (a[r] = t.slice(0))
+                  : "[object Number]" === e
+                    ? (a[r] = t)
+                    : console.error("unexpected color value:", t));
+            return i;
+          },
+        }),
+          (j.prototype.spaces = {
+            rgb: ["red", "green", "blue"],
+            hsl: ["hue", "saturation", "lightness"],
+            hsv: ["hue", "saturation", "value"],
+            hwb: ["hue", "whiteness", "blackness"],
+            cmyk: ["cyan", "magenta", "yellow", "black"],
+          }),
+          (j.prototype.maxes = {
+            rgb: [255, 255, 255],
+            hsl: [360, 100, 100],
+            hsv: [360, 100, 100],
+            hwb: [360, 100, 100],
+            cmyk: [100, 100, 100, 100],
+          }),
+          (j.prototype.getValues = function (t) {
+            for (var e = this.values, i = {}, n = 0; n < t.length; n++) i[t.charAt(n)] = e[t][n];
+            return 1 !== e.alpha && (i.a = e.alpha), i;
+          }),
+          (j.prototype.setValues = function (t, e) {
+            var i,
+              n,
+              a = this.values,
+              r = this.spaces,
+              o = this.maxes,
+              s = 1;
+            if (((this.valid = !0), "alpha" === t)) s = e;
+            else if (e.length) (a[t] = e.slice(0, t.length)), (s = e[t.length]);
+            else if (void 0 !== e[t.charAt(0)]) {
+              for (i = 0; i < t.length; i++) a[t][i] = e[t.charAt(i)];
+              s = e.a;
+            } else if (void 0 !== e[r[t][0]]) {
+              var l = r[t];
+              for (i = 0; i < t.length; i++) a[t][i] = e[l[i]];
+              s = e.alpha;
+            }
+            if (((a.alpha = Math.max(0, Math.min(1, void 0 === s ? a.alpha : s))), "alpha" === t)) return !1;
+            for (i = 0; i < t.length; i++) (n = Math.max(0, Math.min(o[t][i], a[t][i]))), (a[t][i] = Math.round(n));
+            for (var u in r) u !== t && (a[u] = I[t][u](a[t]));
+            return !0;
+          }),
+          (j.prototype.setSpace = function (t, e) {
+            var i = e[0];
+            return void 0 === i
+              ? this.getValues(t)
+              : ("number" == typeof i && (i = Array.prototype.slice.call(e)), this.setValues(t, i), this);
+          }),
+          (j.prototype.setChannel = function (t, e, i) {
+            var n = this.values[t];
+            return void 0 === i ? n[e] : i === n[e] ? this : ((n[e] = i), this.setValues(t, n), this);
+          }),
+          "undefined" != typeof window && (window.Color = j);
+        var U,
+          G = j,
+          q = {
+            noop: function () {},
+            uid:
+              ((U = 0),
+              function () {
+                return U++;
+              }),
+            isNullOrUndef: function (t) {
+              return null == t;
+            },
+            isArray: function (t) {
+              if (Array.isArray && Array.isArray(t)) return !0;
+              var e = Object.prototype.toString.call(t);
+              return "[object" === e.substr(0, 7) && "Array]" === e.substr(-6);
+            },
+            isObject: function (t) {
+              return null !== t && "[object Object]" === Object.prototype.toString.call(t);
+            },
+            isFinite: function (t) {
+              return ("number" == typeof t || t instanceof Number) && isFinite(t);
+            },
+            valueOrDefault: function (t, e) {
+              return void 0 === t ? e : t;
+            },
+            valueAtIndexOrDefault: function (t, e, i) {
+              return q.valueOrDefault(q.isArray(t) ? t[e] : t, i);
+            },
+            callback: function (t, e, i) {
+              if (t && "function" == typeof t.call) return t.apply(i, e);
+            },
+            each: function (t, e, i, n) {
+              var a, r, o;
+              if (q.isArray(t))
+                if (((r = t.length), n)) for (a = r - 1; a >= 0; a--) e.call(i, t[a], a);
+                else for (a = 0; a < r; a++) e.call(i, t[a], a);
+              else if (q.isObject(t)) for (r = (o = Object.keys(t)).length, a = 0; a < r; a++) e.call(i, t[o[a]], o[a]);
+            },
+            arrayEquals: function (t, e) {
+              var i, n, a, r;
+              if (!t || !e || t.length !== e.length) return !1;
+              for (i = 0, n = t.length; i < n; ++i)
+                if (((a = t[i]), (r = e[i]), a instanceof Array && r instanceof Array)) {
+                  if (!q.arrayEquals(a, r)) return !1;
+                } else if (a !== r) return !1;
+              return !0;
+            },
+            clone: function (t) {
+              if (q.isArray(t)) return t.map(q.clone);
+              if (q.isObject(t)) {
+                for (var e = {}, i = Object.keys(t), n = i.length, a = 0; a < n; ++a) e[i[a]] = q.clone(t[i[a]]);
+                return e;
+              }
+              return t;
+            },
+            _merger: function (t, e, i, n) {
+              var a = e[t],
+                r = i[t];
+              q.isObject(a) && q.isObject(r) ? q.merge(a, r, n) : (e[t] = q.clone(r));
+            },
+            _mergerIf: function (t, e, i) {
+              var n = e[t],
+                a = i[t];
+              q.isObject(n) && q.isObject(a) ? q.mergeIf(n, a) : e.hasOwnProperty(t) || (e[t] = q.clone(a));
+            },
+            merge: function (t, e, i) {
+              var n,
+                a,
+                r,
+                o,
+                s,
+                l = q.isArray(e) ? e : [e],
+                u = l.length;
+              if (!q.isObject(t)) return t;
+              for (n = (i = i || {}).merger || q._merger, a = 0; a < u; ++a)
+                if (((e = l[a]), q.isObject(e)))
+                  for (s = 0, o = (r = Object.keys(e)).length; s < o; ++s) n(r[s], t, e, i);
+              return t;
+            },
+            mergeIf: function (t, e) {
+              return q.merge(t, e, { merger: q._mergerIf });
+            },
+            extend: function (t) {
+              for (
+                var e = function (e, i) {
+                    t[i] = e;
+                  },
+                  i = 1,
+                  n = arguments.length;
+                i < n;
+                ++i
+              )
+                q.each(arguments[i], e);
+              return t;
+            },
+            inherits: function (t) {
+              var e = this,
+                i =
+                  t && t.hasOwnProperty("constructor")
+                    ? t.constructor
+                    : function () {
+                        return e.apply(this, arguments);
+                      },
+                n = function () {
+                  this.constructor = i;
+                };
+              return (
+                (n.prototype = e.prototype),
+                (i.prototype = new n()),
+                (i.extend = q.inherits),
+                t && q.extend(i.prototype, t),
+                (i.__super__ = e.prototype),
+                i
+              );
+            },
+          },
+          Z = q;
+        (q.callCallback = q.callback),
+          (q.indexOf = function (t, e, i) {
+            return Array.prototype.indexOf.call(t, e, i);
+          }),
+          (q.getValueOrDefault = q.valueOrDefault),
+          (q.getValueAtIndexOrDefault = q.valueAtIndexOrDefault);
+        var $ = {
+            linear: function (t) {
+              return t;
+            },
+            easeInQuad: function (t) {
+              return t * t;
+            },
+            easeOutQuad: function (t) {
+              return -t * (t - 2);
+            },
+            easeInOutQuad: function (t) {
+              return (t /= 0.5) < 1 ? 0.5 * t * t : -0.5 * (--t * (t - 2) - 1);
+            },
+            easeInCubic: function (t) {
+              return t * t * t;
+            },
+            easeOutCubic: function (t) {
+              return (t -= 1) * t * t + 1;
+            },
+            easeInOutCubic: function (t) {
+              return (t /= 0.5) < 1 ? 0.5 * t * t * t : 0.5 * ((t -= 2) * t * t + 2);
+            },
+            easeInQuart: function (t) {
+              return t * t * t * t;
+            },
+            easeOutQuart: function (t) {
+              return -((t -= 1) * t * t * t - 1);
+            },
+            easeInOutQuart: function (t) {
+              return (t /= 0.5) < 1 ? 0.5 * t * t * t * t : -0.5 * ((t -= 2) * t * t * t - 2);
+            },
+            easeInQuint: function (t) {
+              return t * t * t * t * t;
+            },
+            easeOutQuint: function (t) {
+              return (t -= 1) * t * t * t * t + 1;
+            },
+            easeInOutQuint: function (t) {
+              return (t /= 0.5) < 1 ? 0.5 * t * t * t * t * t : 0.5 * ((t -= 2) * t * t * t * t + 2);
+            },
+            easeInSine: function (t) {
+              return 1 - Math.cos(t * (Math.PI / 2));
+            },
+            easeOutSine: function (t) {
+              return Math.sin(t * (Math.PI / 2));
+            },
+            easeInOutSine: function (t) {
+              return -0.5 * (Math.cos(Math.PI * t) - 1);
+            },
+            easeInExpo: function (t) {
+              return 0 === t ? 0 : Math.pow(2, 10 * (t - 1));
+            },
+            easeOutExpo: function (t) {
+              return 1 === t ? 1 : 1 - Math.pow(2, -10 * t);
+            },
+            easeInOutExpo: function (t) {
+              return 0 === t
+                ? 0
+                : 1 === t
+                  ? 1
+                  : (t /= 0.5) < 1
+                    ? 0.5 * Math.pow(2, 10 * (t - 1))
+                    : 0.5 * (2 - Math.pow(2, -10 * --t));
+            },
+            easeInCirc: function (t) {
+              return t >= 1 ? t : -(Math.sqrt(1 - t * t) - 1);
+            },
+            easeOutCirc: function (t) {
+              return Math.sqrt(1 - (t -= 1) * t);
+            },
+            easeInOutCirc: function (t) {
+              return (t /= 0.5) < 1 ? -0.5 * (Math.sqrt(1 - t * t) - 1) : 0.5 * (Math.sqrt(1 - (t -= 2) * t) + 1);
+            },
+            easeInElastic: function (t) {
+              var e = 1.70158,
+                i = 0,
+                n = 1;
+              return 0 === t
+                ? 0
+                : 1 === t
+                  ? 1
+                  : (i || (i = 0.3),
+                    n < 1 ? ((n = 1), (e = i / 4)) : (e = (i / (2 * Math.PI)) * Math.asin(1 / n)),
+                    -n * Math.pow(2, 10 * (t -= 1)) * Math.sin(((t - e) * (2 * Math.PI)) / i));
+            },
+            easeOutElastic: function (t) {
+              var e = 1.70158,
+                i = 0,
+                n = 1;
+              return 0 === t
+                ? 0
+                : 1 === t
+                  ? 1
+                  : (i || (i = 0.3),
+                    n < 1 ? ((n = 1), (e = i / 4)) : (e = (i / (2 * Math.PI)) * Math.asin(1 / n)),
+                    n * Math.pow(2, -10 * t) * Math.sin(((t - e) * (2 * Math.PI)) / i) + 1);
+            },
+            easeInOutElastic: function (t) {
+              var e = 1.70158,
+                i = 0,
+                n = 1;
+              return 0 === t
+                ? 0
+                : 2 == (t /= 0.5)
+                  ? 1
+                  : (i || (i = 0.45),
+                    n < 1 ? ((n = 1), (e = i / 4)) : (e = (i / (2 * Math.PI)) * Math.asin(1 / n)),
+                    t < 1
+                      ? n * Math.pow(2, 10 * (t -= 1)) * Math.sin(((t - e) * (2 * Math.PI)) / i) * -0.5
+                      : n * Math.pow(2, -10 * (t -= 1)) * Math.sin(((t - e) * (2 * Math.PI)) / i) * 0.5 + 1);
+            },
+            easeInBack: function (t) {
+              var e = 1.70158;
+              return t * t * ((e + 1) * t - e);
+            },
+            easeOutBack: function (t) {
+              var e = 1.70158;
+              return (t -= 1) * t * ((e + 1) * t + e) + 1;
+            },
+            easeInOutBack: function (t) {
+              var e = 1.70158;
+              return (t /= 0.5) < 1
+                ? t * t * ((1 + (e *= 1.525)) * t - e) * 0.5
+                : 0.5 * ((t -= 2) * t * ((1 + (e *= 1.525)) * t + e) + 2);
+            },
+            easeInBounce: function (t) {
+              return 1 - $.easeOutBounce(1 - t);
+            },
+            easeOutBounce: function (t) {
+              return t < 1 / 2.75
+                ? 7.5625 * t * t
+                : t < 2 / 2.75
+                  ? 7.5625 * (t -= 1.5 / 2.75) * t + 0.75
+                  : t < 2.5 / 2.75
+                    ? 7.5625 * (t -= 2.25 / 2.75) * t + 0.9375
+                    : 7.5625 * (t -= 2.625 / 2.75) * t + 0.984375;
+            },
+            easeInOutBounce: function (t) {
+              return t < 0.5 ? 0.5 * $.easeInBounce(2 * t) : 0.5 * $.easeOutBounce(2 * t - 1) + 0.5;
+            },
+          },
+          X = { effects: $ };
+        Z.easingEffects = $;
+        var K = Math.PI,
+          J = K / 180,
+          Q = 2 * K,
+          tt = K / 2,
+          et = K / 4,
+          it = (2 * K) / 3,
+          nt = {
+            clear: function (t) {
+              t.ctx.clearRect(0, 0, t.width, t.height);
+            },
+            roundedRect: function (t, e, i, n, a, r) {
+              if (r) {
+                var o = Math.min(r, a / 2, n / 2),
+                  s = e + o,
+                  l = i + o,
+                  u = e + n - o,
+                  d = i + a - o;
+                t.moveTo(e, l),
+                  s < u && l < d
+                    ? (t.arc(s, l, o, -K, -tt), t.arc(u, l, o, -tt, 0), t.arc(u, d, o, 0, tt), t.arc(s, d, o, tt, K))
+                    : s < u
+                      ? (t.moveTo(s, i), t.arc(u, l, o, -tt, tt), t.arc(s, l, o, tt, K + tt))
+                      : l < d
+                        ? (t.arc(s, l, o, -K, 0), t.arc(s, d, o, 0, K))
+                        : t.arc(s, l, o, -K, K),
+                  t.closePath(),
+                  t.moveTo(e, i);
+              } else t.rect(e, i, n, a);
+            },
+            drawPoint: function (t, e, i, n, a, r) {
+              var o,
+                s,
+                l,
+                u,
+                d,
+                h = (r || 0) * J;
+              if (
+                !e ||
+                "object" != typeof e ||
+                ("[object HTMLImageElement]" !== (o = e.toString()) && "[object HTMLCanvasElement]" !== o)
+              ) {
+                if (!(isNaN(i) || i <= 0)) {
+                  switch ((t.beginPath(), e)) {
+                    default:
+                      t.arc(n, a, i, 0, Q), t.closePath();
+                      break;
+                    case "triangle":
+                      t.moveTo(n + Math.sin(h) * i, a - Math.cos(h) * i),
+                        (h += it),
+                        t.lineTo(n + Math.sin(h) * i, a - Math.cos(h) * i),
+                        (h += it),
+                        t.lineTo(n + Math.sin(h) * i, a - Math.cos(h) * i),
+                        t.closePath();
+                      break;
+                    case "rectRounded":
+                      (u = i - (d = 0.516 * i)),
+                        (s = Math.cos(h + et) * u),
+                        (l = Math.sin(h + et) * u),
+                        t.arc(n - s, a - l, d, h - K, h - tt),
+                        t.arc(n + l, a - s, d, h - tt, h),
+                        t.arc(n + s, a + l, d, h, h + tt),
+                        t.arc(n - l, a + s, d, h + tt, h + K),
+                        t.closePath();
+                      break;
+                    case "rect":
+                      if (!r) {
+                        (u = Math.SQRT1_2 * i), t.rect(n - u, a - u, 2 * u, 2 * u);
+                        break;
+                      }
+                      h += et;
+                    case "rectRot":
+                      (s = Math.cos(h) * i),
+                        (l = Math.sin(h) * i),
+                        t.moveTo(n - s, a - l),
+                        t.lineTo(n + l, a - s),
+                        t.lineTo(n + s, a + l),
+                        t.lineTo(n - l, a + s),
+                        t.closePath();
+                      break;
+                    case "crossRot":
+                      h += et;
+                    case "cross":
+                      (s = Math.cos(h) * i),
+                        (l = Math.sin(h) * i),
+                        t.moveTo(n - s, a - l),
+                        t.lineTo(n + s, a + l),
+                        t.moveTo(n + l, a - s),
+                        t.lineTo(n - l, a + s);
+                      break;
+                    case "star":
+                      (s = Math.cos(h) * i),
+                        (l = Math.sin(h) * i),
+                        t.moveTo(n - s, a - l),
+                        t.lineTo(n + s, a + l),
+                        t.moveTo(n + l, a - s),
+                        t.lineTo(n - l, a + s),
+                        (h += et),
+                        (s = Math.cos(h) * i),
+                        (l = Math.sin(h) * i),
+                        t.moveTo(n - s, a - l),
+                        t.lineTo(n + s, a + l),
+                        t.moveTo(n + l, a - s),
+                        t.lineTo(n - l, a + s);
+                      break;
+                    case "line":
+                      (s = Math.cos(h) * i), (l = Math.sin(h) * i), t.moveTo(n - s, a - l), t.lineTo(n + s, a + l);
+                      break;
+                    case "dash":
+                      t.moveTo(n, a), t.lineTo(n + Math.cos(h) * i, a + Math.sin(h) * i);
+                  }
+                  t.fill(), t.stroke();
+                }
+              } else t.drawImage(e, n - e.width / 2, a - e.height / 2, e.width, e.height);
+            },
+            _isPointInArea: function (t, e) {
+              return t.x > e.left - 1e-6 && t.x < e.right + 1e-6 && t.y > e.top - 1e-6 && t.y < e.bottom + 1e-6;
+            },
+            clipArea: function (t, e) {
+              t.save(), t.beginPath(), t.rect(e.left, e.top, e.right - e.left, e.bottom - e.top), t.clip();
+            },
+            unclipArea: function (t) {
+              t.restore();
+            },
+            lineTo: function (t, e, i, n) {
+              var a = i.steppedLine;
+              if (a) {
+                if ("middle" === a) {
+                  var r = (e.x + i.x) / 2;
+                  t.lineTo(r, n ? i.y : e.y), t.lineTo(r, n ? e.y : i.y);
+                } else ("after" === a && !n) || ("after" !== a && n) ? t.lineTo(e.x, i.y) : t.lineTo(i.x, e.y);
+                t.lineTo(i.x, i.y);
+              } else
+                i.tension
+                  ? t.bezierCurveTo(
+                      n ? e.controlPointPreviousX : e.controlPointNextX,
+                      n ? e.controlPointPreviousY : e.controlPointNextY,
+                      n ? i.controlPointNextX : i.controlPointPreviousX,
+                      n ? i.controlPointNextY : i.controlPointPreviousY,
+                      i.x,
+                      i.y
+                    )
+                  : t.lineTo(i.x, i.y);
+            },
+          },
+          at = nt;
+        (Z.clear = nt.clear),
+          (Z.drawRoundedRectangle = function (t) {
+            t.beginPath(), nt.roundedRect.apply(nt, arguments);
+          });
+        var rt = {
+          _set: function (t, e) {
+            return Z.merge(this[t] || (this[t] = {}), e);
+          },
+        };
+        rt._set("global", {
+          defaultColor: "rgba(0,0,0,0.1)",
+          defaultFontColor: "#666",
+          defaultFontFamily: "'Helvetica Neue', 'Helvetica', 'Arial', sans-serif",
+          defaultFontSize: 12,
+          defaultFontStyle: "normal",
+          defaultLineHeight: 1.2,
+          showLines: !0,
+        });
+        var ot = rt,
+          st = Z.valueOrDefault;
+        var lt = {
+            toLineHeight: function (t, e) {
+              var i = ("" + t).match(/^(normal|(\d+(?:\.\d+)?)(px|em|%)?)$/);
+              if (!i || "normal" === i[1]) return 1.2 * e;
+              switch (((t = +i[2]), i[3])) {
+                case "px":
+                  return t;
+                case "%":
+                  t /= 100;
+              }
+              return e * t;
+            },
+            toPadding: function (t) {
+              var e, i, n, a;
+              return (
+                Z.isObject(t)
+                  ? ((e = +t.top || 0), (i = +t.right || 0), (n = +t.bottom || 0), (a = +t.left || 0))
+                  : (e = i = n = a = +t || 0),
+                { top: e, right: i, bottom: n, left: a, height: e + n, width: a + i }
+              );
+            },
+            _parseFont: function (t) {
+              var e = ot.global,
+                i = st(t.fontSize, e.defaultFontSize),
+                n = {
+                  family: st(t.fontFamily, e.defaultFontFamily),
+                  lineHeight: Z.options.toLineHeight(st(t.lineHeight, e.defaultLineHeight), i),
+                  size: i,
+                  style: st(t.fontStyle, e.defaultFontStyle),
+                  weight: null,
+                  string: "",
+                };
+              return (
+                (n.string = (function (t) {
+                  return !t || Z.isNullOrUndef(t.size) || Z.isNullOrUndef(t.family)
+                    ? null
+                    : (t.style ? t.style + " " : "") + (t.weight ? t.weight + " " : "") + t.size + "px " + t.family;
+                })(n)),
+                n
+              );
+            },
+            resolve: function (t, e, i) {
+              var n, a, r;
+              for (n = 0, a = t.length; n < a; ++n)
+                if (
+                  void 0 !== (r = t[n]) &&
+                  (void 0 !== e && "function" == typeof r && (r = r(e)),
+                  void 0 !== i && Z.isArray(r) && (r = r[i]),
+                  void 0 !== r)
+                )
+                  return r;
+            },
+          },
+          ut = Z,
+          dt = X,
+          ht = at,
+          ct = lt;
+        (ut.easing = dt), (ut.canvas = ht), (ut.options = ct);
+        var ft = function (t) {
+          ut.extend(this, t), this.initialize.apply(this, arguments);
+        };
+        ut.extend(ft.prototype, {
+          initialize: function () {
+            this.hidden = !1;
+          },
+          pivot: function () {
+            var t = this;
+            return t._view || (t._view = ut.clone(t._model)), (t._start = {}), t;
+          },
+          transition: function (t) {
+            var e = this,
+              i = e._model,
+              n = e._start,
+              a = e._view;
+            return i && 1 !== t
+              ? (a || (a = e._view = {}),
+                n || (n = e._start = {}),
+                (function (t, e, i, n) {
+                  var a,
+                    r,
+                    o,
+                    s,
+                    l,
+                    u,
+                    d,
+                    h,
+                    c,
+                    f = Object.keys(i);
+                  for (a = 0, r = f.length; a < r; ++a)
+                    if (((u = i[(o = f[a])]), e.hasOwnProperty(o) || (e[o] = u), (s = e[o]) !== u && "_" !== o[0])) {
+                      if ((t.hasOwnProperty(o) || (t[o] = s), (d = typeof u) == typeof (l = t[o])))
+                        if ("string" === d) {
+                          if ((h = G(l)).valid && (c = G(u)).valid) {
+                            e[o] = c.mix(h, n).rgbString();
+                            continue;
+                          }
+                        } else if (ut.isFinite(l) && ut.isFinite(u)) {
+                          e[o] = l + (u - l) * n;
+                          continue;
+                        }
+                      e[o] = u;
+                    }
+                })(n, a, i, t),
+                e)
+              : ((e._view = i), (e._start = null), e);
+          },
+          tooltipPosition: function () {
+            return { x: this._model.x, y: this._model.y };
+          },
+          hasValue: function () {
+            return ut.isNumber(this._model.x) && ut.isNumber(this._model.y);
+          },
+        }),
+          (ft.extend = ut.inherits);
+        var gt = ft,
+          mt = gt.extend({
+            chart: null,
+            currentStep: 0,
+            numSteps: 60,
+            easing: "",
+            render: null,
+            onAnimationProgress: null,
+            onAnimationComplete: null,
+          }),
+          pt = mt;
+        Object.defineProperty(mt.prototype, "animationObject", {
+          get: function () {
+            return this;
+          },
+        }),
+          Object.defineProperty(mt.prototype, "chartInstance", {
+            get: function () {
+              return this.chart;
+            },
+            set: function (t) {
+              this.chart = t;
+            },
+          }),
+          ot._set("global", {
+            animation: { duration: 1e3, easing: "easeOutQuart", onProgress: ut.noop, onComplete: ut.noop },
+          });
+        var vt = {
+            animations: [],
+            request: null,
+            addAnimation: function (t, e, i, n) {
+              var a,
+                r,
+                o = this.animations;
+              for (
+                e.chart = t, e.startTime = Date.now(), e.duration = i, n || (t.animating = !0), a = 0, r = o.length;
+                a < r;
+                ++a
+              )
+                if (o[a].chart === t) return void (o[a] = e);
+              o.push(e), 1 === o.length && this.requestAnimationFrame();
+            },
+            cancelAnimation: function (t) {
+              var e = ut.findIndex(this.animations, function (e) {
+                return e.chart === t;
+              });
+              -1 !== e && (this.animations.splice(e, 1), (t.animating = !1));
+            },
+            requestAnimationFrame: function () {
+              var t = this;
+              null === t.request &&
+                (t.request = ut.requestAnimFrame.call(window, function () {
+                  (t.request = null), t.startDigest();
+                }));
+            },
+            startDigest: function () {
+              this.advance(), this.animations.length > 0 && this.requestAnimationFrame();
+            },
+            advance: function () {
+              for (var t, e, i, n, a = this.animations, r = 0; r < a.length; )
+                (e = (t = a[r]).chart),
+                  (i = t.numSteps),
+                  (n = Math.floor(((Date.now() - t.startTime) / t.duration) * i) + 1),
+                  (t.currentStep = Math.min(n, i)),
+                  ut.callback(t.render, [e, t], e),
+                  ut.callback(t.onAnimationProgress, [t], e),
+                  t.currentStep >= i
+                    ? (ut.callback(t.onAnimationComplete, [t], e), (e.animating = !1), a.splice(r, 1))
+                    : ++r;
+            },
+          },
+          yt = ut.options.resolve,
+          bt = ["push", "pop", "shift", "splice", "unshift"];
+        function xt(t, e) {
+          var i = t._chartjs;
+          if (i) {
+            var n = i.listeners,
+              a = n.indexOf(e);
+            -1 !== a && n.splice(a, 1),
+              n.length > 0 ||
+                (bt.forEach(function (e) {
+                  delete t[e];
+                }),
+                delete t._chartjs);
+          }
+        }
+        var _t = function (t, e) {
+          this.initialize(t, e);
+        };
+        ut.extend(_t.prototype, {
+          datasetElementType: null,
+          dataElementType: null,
+          initialize: function (t, e) {
+            (this.chart = t), (this.index = e), this.linkScales(), this.addElements();
+          },
+          updateIndex: function (t) {
+            this.index = t;
+          },
+          linkScales: function () {
+            var t = this,
+              e = t.getMeta(),
+              i = t.getDataset();
+            (null !== e.xAxisID && e.xAxisID in t.chart.scales) ||
+              (e.xAxisID = i.xAxisID || t.chart.options.scales.xAxes[0].id),
+              (null !== e.yAxisID && e.yAxisID in t.chart.scales) ||
+                (e.yAxisID = i.yAxisID || t.chart.options.scales.yAxes[0].id);
+          },
+          getDataset: function () {
+            return this.chart.data.datasets[this.index];
+          },
+          getMeta: function () {
+            return this.chart.getDatasetMeta(this.index);
+          },
+          getScaleForId: function (t) {
+            return this.chart.scales[t];
+          },
+          _getValueScaleId: function () {
+            return this.getMeta().yAxisID;
+          },
+          _getIndexScaleId: function () {
+            return this.getMeta().xAxisID;
+          },
+          _getValueScale: function () {
+            return this.getScaleForId(this._getValueScaleId());
+          },
+          _getIndexScale: function () {
+            return this.getScaleForId(this._getIndexScaleId());
+          },
+          reset: function () {
+            this.update(!0);
+          },
+          destroy: function () {
+            this._data && xt(this._data, this);
+          },
+          createMetaDataset: function () {
+            var t = this.datasetElementType;
+            return t && new t({ _chart: this.chart, _datasetIndex: this.index });
+          },
+          createMetaData: function (t) {
+            var e = this.dataElementType;
+            return e && new e({ _chart: this.chart, _datasetIndex: this.index, _index: t });
+          },
+          addElements: function () {
+            var t,
+              e,
+              i = this.getMeta(),
+              n = this.getDataset().data || [],
+              a = i.data;
+            for (t = 0, e = n.length; t < e; ++t) a[t] = a[t] || this.createMetaData(t);
+            i.dataset = i.dataset || this.createMetaDataset();
+          },
+          addElementAndReset: function (t) {
+            var e = this.createMetaData(t);
+            this.getMeta().data.splice(t, 0, e), this.updateElement(e, t, !0);
+          },
+          buildOrUpdateElements: function () {
+            var t,
+              e,
+              i = this,
+              n = i.getDataset(),
+              a = n.data || (n.data = []);
+            i._data !== a &&
+              (i._data && xt(i._data, i),
+              a &&
+                Object.isExtensible(a) &&
+                ((e = i),
+                (t = a)._chartjs
+                  ? t._chartjs.listeners.push(e)
+                  : (Object.defineProperty(t, "_chartjs", {
+                      configurable: !0,
+                      enumerable: !1,
+                      value: { listeners: [e] },
+                    }),
+                    bt.forEach(function (e) {
+                      var i = "onData" + e.charAt(0).toUpperCase() + e.slice(1),
+                        n = t[e];
+                      Object.defineProperty(t, e, {
+                        configurable: !0,
+                        enumerable: !1,
+                        value: function () {
+                          var e = Array.prototype.slice.call(arguments),
+                            a = n.apply(this, e);
+                          return (
+                            ut.each(t._chartjs.listeners, function (t) {
+                              "function" == typeof t[i] && t[i].apply(t, e);
+                            }),
+                            a
+                          );
+                        },
+                      });
+                    }))),
+              (i._data = a)),
+              i.resyncElements();
+          },
+          update: ut.noop,
+          transition: function (t) {
+            for (var e = this.getMeta(), i = e.data || [], n = i.length, a = 0; a < n; ++a) i[a].transition(t);
+            e.dataset && e.dataset.transition(t);
+          },
+          draw: function () {
+            var t = this.getMeta(),
+              e = t.data || [],
+              i = e.length,
+              n = 0;
+            for (t.dataset && t.dataset.draw(); n < i; ++n) e[n].draw();
+          },
+          removeHoverStyle: function (t) {
+            ut.merge(t._model, t.$previousStyle || {}), delete t.$previousStyle;
+          },
+          setHoverStyle: function (t) {
+            var e = this.chart.data.datasets[t._datasetIndex],
+              i = t._index,
+              n = t.custom || {},
+              a = t._model,
+              r = ut.getHoverColor;
+            (t.$previousStyle = {
+              backgroundColor: a.backgroundColor,
+              borderColor: a.borderColor,
+              borderWidth: a.borderWidth,
+            }),
+              (a.backgroundColor = yt(
+                [n.hoverBackgroundColor, e.hoverBackgroundColor, r(a.backgroundColor)],
+                void 0,
+                i
+              )),
+              (a.borderColor = yt([n.hoverBorderColor, e.hoverBorderColor, r(a.borderColor)], void 0, i)),
+              (a.borderWidth = yt([n.hoverBorderWidth, e.hoverBorderWidth, a.borderWidth], void 0, i));
+          },
+          resyncElements: function () {
+            var t = this.getMeta(),
+              e = this.getDataset().data,
+              i = t.data.length,
+              n = e.length;
+            n < i ? t.data.splice(n, i - n) : n > i && this.insertElements(i, n - i);
+          },
+          insertElements: function (t, e) {
+            for (var i = 0; i < e; ++i) this.addElementAndReset(t + i);
+          },
+          onDataPush: function () {
+            var t = arguments.length;
+            this.insertElements(this.getDataset().data.length - t, t);
+          },
+          onDataPop: function () {
+            this.getMeta().data.pop();
+          },
+          onDataShift: function () {
+            this.getMeta().data.shift();
+          },
+          onDataSplice: function (t, e) {
+            this.getMeta().data.splice(t, e), this.insertElements(t, arguments.length - 2);
+          },
+          onDataUnshift: function () {
+            this.insertElements(0, arguments.length);
+          },
+        }),
+          (_t.extend = ut.inherits);
+        var kt = _t;
+        ot._set("global", {
+          elements: {
+            arc: {
+              backgroundColor: ot.global.defaultColor,
+              borderColor: "#fff",
+              borderWidth: 2,
+              borderAlign: "center",
+            },
+          },
+        });
+        var wt = gt.extend({
+            inLabelRange: function (t) {
+              var e = this._view;
+              return !!e && Math.pow(t - e.x, 2) < Math.pow(e.radius + e.hoverRadius, 2);
+            },
+            inRange: function (t, e) {
+              var i = this._view;
+              if (i) {
+                for (
+                  var n = ut.getAngleFromPoint(i, { x: t, y: e }),
+                    a = n.angle,
+                    r = n.distance,
+                    o = i.startAngle,
+                    s = i.endAngle;
+                  s < o;
+
+                )
+                  s += 2 * Math.PI;
+                for (; a > s; ) a -= 2 * Math.PI;
+                for (; a < o; ) a += 2 * Math.PI;
+                var l = a >= o && a <= s,
+                  u = r >= i.innerRadius && r <= i.outerRadius;
+                return l && u;
+              }
+              return !1;
+            },
+            getCenterPoint: function () {
+              var t = this._view,
+                e = (t.startAngle + t.endAngle) / 2,
+                i = (t.innerRadius + t.outerRadius) / 2;
+              return { x: t.x + Math.cos(e) * i, y: t.y + Math.sin(e) * i };
+            },
+            getArea: function () {
+              var t = this._view;
+              return (
+                Math.PI *
+                ((t.endAngle - t.startAngle) / (2 * Math.PI)) *
+                (Math.pow(t.outerRadius, 2) - Math.pow(t.innerRadius, 2))
+              );
+            },
+            tooltipPosition: function () {
+              var t = this._view,
+                e = t.startAngle + (t.endAngle - t.startAngle) / 2,
+                i = (t.outerRadius - t.innerRadius) / 2 + t.innerRadius;
+              return { x: t.x + Math.cos(e) * i, y: t.y + Math.sin(e) * i };
+            },
+            draw: function () {
+              var t,
+                e = this._chart.ctx,
+                i = this._view,
+                n = i.startAngle,
+                a = i.endAngle,
+                r = "inner" === i.borderAlign ? 0.33 : 0;
+              e.save(),
+                e.beginPath(),
+                e.arc(i.x, i.y, Math.max(i.outerRadius - r, 0), n, a),
+                e.arc(i.x, i.y, i.innerRadius, a, n, !0),
+                e.closePath(),
+                (e.fillStyle = i.backgroundColor),
+                e.fill(),
+                i.borderWidth &&
+                  ("inner" === i.borderAlign
+                    ? (e.beginPath(),
+                      (t = r / i.outerRadius),
+                      e.arc(i.x, i.y, i.outerRadius, n - t, a + t),
+                      i.innerRadius > r
+                        ? ((t = r / i.innerRadius), e.arc(i.x, i.y, i.innerRadius - r, a + t, n - t, !0))
+                        : e.arc(i.x, i.y, r, a + Math.PI / 2, n - Math.PI / 2),
+                      e.closePath(),
+                      e.clip(),
+                      e.beginPath(),
+                      e.arc(i.x, i.y, i.outerRadius, n, a),
+                      e.arc(i.x, i.y, i.innerRadius, a, n, !0),
+                      e.closePath(),
+                      (e.lineWidth = 2 * i.borderWidth),
+                      (e.lineJoin = "round"))
+                    : ((e.lineWidth = i.borderWidth), (e.lineJoin = "bevel")),
+                  (e.strokeStyle = i.borderColor),
+                  e.stroke()),
+                e.restore();
+            },
+          }),
+          Mt = ut.valueOrDefault,
+          St = ot.global.defaultColor;
+        ot._set("global", {
+          elements: {
+            line: {
+              tension: 0.4,
+              backgroundColor: St,
+              borderWidth: 3,
+              borderColor: St,
+              borderCapStyle: "butt",
+              borderDash: [],
+              borderDashOffset: 0,
+              borderJoinStyle: "miter",
+              capBezierPoints: !0,
+              fill: !0,
+            },
+          },
+        });
+        var Dt = gt.extend({
+            draw: function () {
+              var t,
+                e,
+                i,
+                n,
+                a = this._view,
+                r = this._chart.ctx,
+                o = a.spanGaps,
+                s = this._children.slice(),
+                l = ot.global,
+                u = l.elements.line,
+                d = -1;
+              for (
+                this._loop && s.length && s.push(s[0]),
+                  r.save(),
+                  r.lineCap = a.borderCapStyle || u.borderCapStyle,
+                  r.setLineDash && r.setLineDash(a.borderDash || u.borderDash),
+                  r.lineDashOffset = Mt(a.borderDashOffset, u.borderDashOffset),
+                  r.lineJoin = a.borderJoinStyle || u.borderJoinStyle,
+                  r.lineWidth = Mt(a.borderWidth, u.borderWidth),
+                  r.strokeStyle = a.borderColor || l.defaultColor,
+                  r.beginPath(),
+                  d = -1,
+                  t = 0;
+                t < s.length;
+                ++t
+              )
+                (e = s[t]),
+                  (i = ut.previousItem(s, t)),
+                  (n = e._view),
+                  0 === t
+                    ? n.skip || (r.moveTo(n.x, n.y), (d = t))
+                    : ((i = -1 === d ? i : s[d]),
+                      n.skip ||
+                        ((d !== t - 1 && !o) || -1 === d ? r.moveTo(n.x, n.y) : ut.canvas.lineTo(r, i._view, e._view),
+                        (d = t)));
+              r.stroke(), r.restore();
+            },
+          }),
+          Ct = ut.valueOrDefault,
+          Pt = ot.global.defaultColor;
+        function Tt(t) {
+          var e = this._view;
+          return !!e && Math.abs(t - e.x) < e.radius + e.hitRadius;
+        }
+        ot._set("global", {
+          elements: {
+            point: {
+              radius: 3,
+              pointStyle: "circle",
+              backgroundColor: Pt,
+              borderColor: Pt,
+              borderWidth: 1,
+              hitRadius: 1,
+              hoverRadius: 4,
+              hoverBorderWidth: 1,
+            },
+          },
+        });
+        var Ot = gt.extend({
+            inRange: function (t, e) {
+              var i = this._view;
+              return !!i && Math.pow(t - i.x, 2) + Math.pow(e - i.y, 2) < Math.pow(i.hitRadius + i.radius, 2);
+            },
+            inLabelRange: Tt,
+            inXRange: Tt,
+            inYRange: function (t) {
+              var e = this._view;
+              return !!e && Math.abs(t - e.y) < e.radius + e.hitRadius;
+            },
+            getCenterPoint: function () {
+              var t = this._view;
+              return { x: t.x, y: t.y };
+            },
+            getArea: function () {
+              return Math.PI * Math.pow(this._view.radius, 2);
+            },
+            tooltipPosition: function () {
+              var t = this._view;
+              return { x: t.x, y: t.y, padding: t.radius + t.borderWidth };
+            },
+            draw: function (t) {
+              var e = this._view,
+                i = this._chart.ctx,
+                n = e.pointStyle,
+                a = e.rotation,
+                r = e.radius,
+                o = e.x,
+                s = e.y,
+                l = ot.global,
+                u = l.defaultColor;
+              e.skip ||
+                ((void 0 === t || ut.canvas._isPointInArea(e, t)) &&
+                  ((i.strokeStyle = e.borderColor || u),
+                  (i.lineWidth = Ct(e.borderWidth, l.elements.point.borderWidth)),
+                  (i.fillStyle = e.backgroundColor || u),
+                  ut.canvas.drawPoint(i, n, r, o, s, a)));
+            },
+          }),
+          It = ot.global.defaultColor;
+        function At(t) {
+          return t && void 0 !== t.width;
+        }
+        function Ft(t) {
+          var e, i, n, a, r;
+          return (
+            At(t)
+              ? ((r = t.width / 2),
+                (e = t.x - r),
+                (i = t.x + r),
+                (n = Math.min(t.y, t.base)),
+                (a = Math.max(t.y, t.base)))
+              : ((r = t.height / 2),
+                (e = Math.min(t.x, t.base)),
+                (i = Math.max(t.x, t.base)),
+                (n = t.y - r),
+                (a = t.y + r)),
+            { left: e, top: n, right: i, bottom: a }
+          );
+        }
+        function Rt(t, e, i) {
+          return t === e ? i : t === i ? e : t;
+        }
+        function Lt(t, e, i) {
+          var n,
+            a,
+            r,
+            o,
+            s = t.borderWidth,
+            l = (function (t) {
+              var e = t.borderSkipped,
+                i = {};
+              return e
+                ? (t.horizontal
+                    ? t.base > t.x && (e = Rt(e, "left", "right"))
+                    : t.base < t.y && (e = Rt(e, "bottom", "top")),
+                  (i[e] = !0),
+                  i)
+                : i;
+            })(t);
+          return (
+            ut.isObject(s)
+              ? ((n = +s.top || 0), (a = +s.right || 0), (r = +s.bottom || 0), (o = +s.left || 0))
+              : (n = a = r = o = +s || 0),
+            {
+              t: l.top || n < 0 ? 0 : n > i ? i : n,
+              r: l.right || a < 0 ? 0 : a > e ? e : a,
+              b: l.bottom || r < 0 ? 0 : r > i ? i : r,
+              l: l.left || o < 0 ? 0 : o > e ? e : o,
+            }
+          );
+        }
+        function Wt(t, e, i) {
+          var n = null === e,
+            a = null === i,
+            r = !(!t || (n && a)) && Ft(t);
+          return r && (n || (e >= r.left && e <= r.right)) && (a || (i >= r.top && i <= r.bottom));
+        }
+        ot._set("global", {
+          elements: { rectangle: { backgroundColor: It, borderColor: It, borderSkipped: "bottom", borderWidth: 0 } },
+        });
+        var Yt = gt.extend({
+            draw: function () {
+              var t = this._chart.ctx,
+                e = this._view,
+                i = (function (t) {
+                  var e = Ft(t),
+                    i = e.right - e.left,
+                    n = e.bottom - e.top,
+                    a = Lt(t, i / 2, n / 2);
+                  return {
+                    outer: { x: e.left, y: e.top, w: i, h: n },
+                    inner: { x: e.left + a.l, y: e.top + a.t, w: i - a.l - a.r, h: n - a.t - a.b },
+                  };
+                })(e),
+                n = i.outer,
+                a = i.inner;
+              (t.fillStyle = e.backgroundColor),
+                t.fillRect(n.x, n.y, n.w, n.h),
+                (n.w === a.w && n.h === a.h) ||
+                  (t.save(),
+                  t.beginPath(),
+                  t.rect(n.x, n.y, n.w, n.h),
+                  t.clip(),
+                  (t.fillStyle = e.borderColor),
+                  t.rect(a.x, a.y, a.w, a.h),
+                  t.fill("evenodd"),
+                  t.restore());
+            },
+            height: function () {
+              var t = this._view;
+              return t.base - t.y;
+            },
+            inRange: function (t, e) {
+              return Wt(this._view, t, e);
+            },
+            inLabelRange: function (t, e) {
+              var i = this._view;
+              return At(i) ? Wt(i, t, null) : Wt(i, null, e);
+            },
+            inXRange: function (t) {
+              return Wt(this._view, t, null);
+            },
+            inYRange: function (t) {
+              return Wt(this._view, null, t);
+            },
+            getCenterPoint: function () {
+              var t,
+                e,
+                i = this._view;
+              return (
+                At(i) ? ((t = i.x), (e = (i.y + i.base) / 2)) : ((t = (i.x + i.base) / 2), (e = i.y)), { x: t, y: e }
+              );
+            },
+            getArea: function () {
+              var t = this._view;
+              return At(t) ? t.width * Math.abs(t.y - t.base) : t.height * Math.abs(t.x - t.base);
+            },
+            tooltipPosition: function () {
+              var t = this._view;
+              return { x: t.x, y: t.y };
+            },
+          }),
+          Nt = {},
+          zt = wt,
+          Vt = Dt,
+          Ht = Ot,
+          Et = Yt;
+        (Nt.Arc = zt), (Nt.Line = Vt), (Nt.Point = Ht), (Nt.Rectangle = Et);
+        var Bt = ut.options.resolve;
+        ot._set("bar", {
+          hover: { mode: "label" },
+          scales: {
+            xAxes: [
+              {
+                type: "category",
+                categoryPercentage: 0.8,
+                barPercentage: 0.9,
+                offset: !0,
+                gridLines: { offsetGridLines: !0 },
+              },
+            ],
+            yAxes: [{ type: "linear" }],
+          },
+        });
+        var jt = kt.extend({
+            dataElementType: Nt.Rectangle,
+            initialize: function () {
+              var t;
+              kt.prototype.initialize.apply(this, arguments),
+                ((t = this.getMeta()).stack = this.getDataset().stack),
+                (t.bar = !0);
+            },
+            update: function (t) {
+              var e,
+                i,
+                n = this.getMeta().data;
+              for (this._ruler = this.getRuler(), e = 0, i = n.length; e < i; ++e) this.updateElement(n[e], e, t);
+            },
+            updateElement: function (t, e, i) {
+              var n = this,
+                a = n.getMeta(),
+                r = n.getDataset(),
+                o = n._resolveElementOptions(t, e);
+              (t._xScale = n.getScaleForId(a.xAxisID)),
+                (t._yScale = n.getScaleForId(a.yAxisID)),
+                (t._datasetIndex = n.index),
+                (t._index = e),
+                (t._model = {
+                  backgroundColor: o.backgroundColor,
+                  borderColor: o.borderColor,
+                  borderSkipped: o.borderSkipped,
+                  borderWidth: o.borderWidth,
+                  datasetLabel: r.label,
+                  label: n.chart.data.labels[e],
+                }),
+                n._updateElementGeometry(t, e, i),
+                t.pivot();
+            },
+            _updateElementGeometry: function (t, e, i) {
+              var n = this,
+                a = t._model,
+                r = n._getValueScale(),
+                o = r.getBasePixel(),
+                s = r.isHorizontal(),
+                l = n._ruler || n.getRuler(),
+                u = n.calculateBarValuePixels(n.index, e),
+                d = n.calculateBarIndexPixels(n.index, e, l);
+              (a.horizontal = s),
+                (a.base = i ? o : u.base),
+                (a.x = s ? (i ? o : u.head) : d.center),
+                (a.y = s ? d.center : i ? o : u.head),
+                (a.height = s ? d.size : void 0),
+                (a.width = s ? void 0 : d.size);
+            },
+            _getStacks: function (t) {
+              var e,
+                i,
+                n = this.chart,
+                a = this._getIndexScale().options.stacked,
+                r = void 0 === t ? n.data.datasets.length : t + 1,
+                o = [];
+              for (e = 0; e < r; ++e)
+                (i = n.getDatasetMeta(e)).bar &&
+                  n.isDatasetVisible(e) &&
+                  (!1 === a ||
+                    (!0 === a && -1 === o.indexOf(i.stack)) ||
+                    (void 0 === a && (void 0 === i.stack || -1 === o.indexOf(i.stack)))) &&
+                  o.push(i.stack);
+              return o;
+            },
+            getStackCount: function () {
+              return this._getStacks().length;
+            },
+            getStackIndex: function (t, e) {
+              var i = this._getStacks(t),
+                n = void 0 !== e ? i.indexOf(e) : -1;
+              return -1 === n ? i.length - 1 : n;
+            },
+            getRuler: function () {
+              var t,
+                e,
+                i = this._getIndexScale(),
+                n = this.getStackCount(),
+                a = this.index,
+                r = i.isHorizontal(),
+                o = r ? i.left : i.top,
+                s = o + (r ? i.width : i.height),
+                l = [];
+              for (t = 0, e = this.getMeta().data.length; t < e; ++t) l.push(i.getPixelForValue(null, t, a));
+              return {
+                min: ut.isNullOrUndef(i.options.barThickness)
+                  ? (function (t, e) {
+                      var i,
+                        n,
+                        a,
+                        r,
+                        o = t.isHorizontal() ? t.width : t.height,
+                        s = t.getTicks();
+                      for (a = 1, r = e.length; a < r; ++a) o = Math.min(o, Math.abs(e[a] - e[a - 1]));
+                      for (a = 0, r = s.length; a < r; ++a)
+                        (n = t.getPixelForTick(a)), (o = a > 0 ? Math.min(o, n - i) : o), (i = n);
+                      return o;
+                    })(i, l)
+                  : -1,
+                pixels: l,
+                start: o,
+                end: s,
+                stackCount: n,
+                scale: i,
+              };
+            },
+            calculateBarValuePixels: function (t, e) {
+              var i,
+                n,
+                a,
+                r,
+                o,
+                s,
+                l = this.chart,
+                u = this.getMeta(),
+                d = this._getValueScale(),
+                h = d.isHorizontal(),
+                c = l.data.datasets,
+                f = +d.getRightValue(c[t].data[e]),
+                g = d.options.minBarLength,
+                m = d.options.stacked,
+                p = u.stack,
+                v = 0;
+              if (m || (void 0 === m && void 0 !== p))
+                for (i = 0; i < t; ++i)
+                  (n = l.getDatasetMeta(i)).bar &&
+                    n.stack === p &&
+                    n.controller._getValueScaleId() === d.id &&
+                    l.isDatasetVisible(i) &&
+                    ((a = +d.getRightValue(c[i].data[e])), ((f < 0 && a < 0) || (f >= 0 && a > 0)) && (v += a));
+              return (
+                (r = d.getPixelForValue(v)),
+                (s = (o = d.getPixelForValue(v + f)) - r),
+                void 0 !== g && Math.abs(s) < g && ((s = g), (o = (f >= 0 && !h) || (f < 0 && h) ? r - g : r + g)),
+                { size: s, base: r, head: o, center: o + s / 2 }
+              );
+            },
+            calculateBarIndexPixels: function (t, e, i) {
+              var n = i.scale.options,
+                a =
+                  "flex" === n.barThickness
+                    ? (function (t, e, i) {
+                        var n,
+                          a = e.pixels,
+                          r = a[t],
+                          o = t > 0 ? a[t - 1] : null,
+                          s = t < a.length - 1 ? a[t + 1] : null,
+                          l = i.categoryPercentage;
+                        return (
+                          null === o && (o = r - (null === s ? e.end - e.start : s - r)),
+                          null === s && (s = r + r - o),
+                          (n = r - ((r - Math.min(o, s)) / 2) * l),
+                          { chunk: ((Math.abs(s - o) / 2) * l) / e.stackCount, ratio: i.barPercentage, start: n }
+                        );
+                      })(e, i, n)
+                    : (function (t, e, i) {
+                        var n,
+                          a,
+                          r = i.barThickness,
+                          o = e.stackCount,
+                          s = e.pixels[t];
+                        return (
+                          ut.isNullOrUndef(r)
+                            ? ((n = e.min * i.categoryPercentage), (a = i.barPercentage))
+                            : ((n = r * o), (a = 1)),
+                          { chunk: n / o, ratio: a, start: s - n / 2 }
+                        );
+                      })(e, i, n),
+                r = this.getStackIndex(t, this.getMeta().stack),
+                o = a.start + a.chunk * r + a.chunk / 2,
+                s = Math.min(ut.valueOrDefault(n.maxBarThickness, 1 / 0), a.chunk * a.ratio);
+              return { base: o - s / 2, head: o + s / 2, center: o, size: s };
+            },
+            draw: function () {
+              var t = this.chart,
+                e = this._getValueScale(),
+                i = this.getMeta().data,
+                n = this.getDataset(),
+                a = i.length,
+                r = 0;
+              for (ut.canvas.clipArea(t.ctx, t.chartArea); r < a; ++r) isNaN(e.getRightValue(n.data[r])) || i[r].draw();
+              ut.canvas.unclipArea(t.ctx);
+            },
+            _resolveElementOptions: function (t, e) {
+              var i,
+                n,
+                a,
+                r = this.chart,
+                o = r.data.datasets[this.index],
+                s = t.custom || {},
+                l = r.options.elements.rectangle,
+                u = {},
+                d = { chart: r, dataIndex: e, dataset: o, datasetIndex: this.index },
+                h = ["backgroundColor", "borderColor", "borderSkipped", "borderWidth"];
+              for (i = 0, n = h.length; i < n; ++i) u[(a = h[i])] = Bt([s[a], o[a], l[a]], d, e);
+              return u;
+            },
+          }),
+          Ut = ut.valueOrDefault,
+          Gt = ut.options.resolve;
+        ot._set("bubble", {
+          hover: { mode: "single" },
+          scales: {
+            xAxes: [{ type: "linear", position: "bottom", id: "x-axis-0" }],
+            yAxes: [{ type: "linear", position: "left", id: "y-axis-0" }],
+          },
+          tooltips: {
+            callbacks: {
+              title: function () {
+                return "";
+              },
+              label: function (t, e) {
+                var i = e.datasets[t.datasetIndex].label || "",
+                  n = e.datasets[t.datasetIndex].data[t.index];
+                return i + ": (" + t.xLabel + ", " + t.yLabel + ", " + n.r + ")";
+              },
+            },
+          },
+        });
+        var qt = kt.extend({
+            dataElementType: Nt.Point,
+            update: function (t) {
+              var e = this,
+                i = e.getMeta().data;
+              ut.each(i, function (i, n) {
+                e.updateElement(i, n, t);
+              });
+            },
+            updateElement: function (t, e, i) {
+              var n = this,
+                a = n.getMeta(),
+                r = t.custom || {},
+                o = n.getScaleForId(a.xAxisID),
+                s = n.getScaleForId(a.yAxisID),
+                l = n._resolveElementOptions(t, e),
+                u = n.getDataset().data[e],
+                d = n.index,
+                h = i ? o.getPixelForDecimal(0.5) : o.getPixelForValue("object" == typeof u ? u : NaN, e, d),
+                c = i ? s.getBasePixel() : s.getPixelForValue(u, e, d);
+              (t._xScale = o),
+                (t._yScale = s),
+                (t._options = l),
+                (t._datasetIndex = d),
+                (t._index = e),
+                (t._model = {
+                  backgroundColor: l.backgroundColor,
+                  borderColor: l.borderColor,
+                  borderWidth: l.borderWidth,
+                  hitRadius: l.hitRadius,
+                  pointStyle: l.pointStyle,
+                  rotation: l.rotation,
+                  radius: i ? 0 : l.radius,
+                  skip: r.skip || isNaN(h) || isNaN(c),
+                  x: h,
+                  y: c,
+                }),
+                t.pivot();
+            },
+            setHoverStyle: function (t) {
+              var e = t._model,
+                i = t._options,
+                n = ut.getHoverColor;
+              (t.$previousStyle = {
+                backgroundColor: e.backgroundColor,
+                borderColor: e.borderColor,
+                borderWidth: e.borderWidth,
+                radius: e.radius,
+              }),
+                (e.backgroundColor = Ut(i.hoverBackgroundColor, n(i.backgroundColor))),
+                (e.borderColor = Ut(i.hoverBorderColor, n(i.borderColor))),
+                (e.borderWidth = Ut(i.hoverBorderWidth, i.borderWidth)),
+                (e.radius = i.radius + i.hoverRadius);
+            },
+            _resolveElementOptions: function (t, e) {
+              var i,
+                n,
+                a,
+                r = this.chart,
+                o = r.data.datasets[this.index],
+                s = t.custom || {},
+                l = r.options.elements.point,
+                u = o.data[e],
+                d = {},
+                h = { chart: r, dataIndex: e, dataset: o, datasetIndex: this.index },
+                c = [
+                  "backgroundColor",
+                  "borderColor",
+                  "borderWidth",
+                  "hoverBackgroundColor",
+                  "hoverBorderColor",
+                  "hoverBorderWidth",
+                  "hoverRadius",
+                  "hitRadius",
+                  "pointStyle",
+                  "rotation",
+                ];
+              for (i = 0, n = c.length; i < n; ++i) d[(a = c[i])] = Gt([s[a], o[a], l[a]], h, e);
+              return (d.radius = Gt([s.radius, u ? u.r : void 0, o.radius, l.radius], h, e)), d;
+            },
+          }),
+          Zt = ut.options.resolve,
+          $t = ut.valueOrDefault;
+        ot._set("doughnut", {
+          animation: { animateRotate: !0, animateScale: !1 },
+          hover: { mode: "single" },
+          legendCallback: function (t) {
+            var e = [];
+            e.push('<ul class="' + t.id + '-legend">');
+            var i = t.data,
+              n = i.datasets,
+              a = i.labels;
+            if (n.length)
+              for (var r = 0; r < n[0].data.length; ++r)
+                e.push('<li><span style="background-color:' + n[0].backgroundColor[r] + '"></span>'),
+                  a[r] && e.push(a[r]),
+                  e.push("</li>");
+            return e.push("</ul>"), e.join("");
+          },
+          legend: {
+            labels: {
+              generateLabels: function (t) {
+                var e = t.data;
+                return e.labels.length && e.datasets.length
+                  ? e.labels.map(function (i, n) {
+                      var a = t.getDatasetMeta(0),
+                        r = e.datasets[0],
+                        o = a.data[n],
+                        s = (o && o.custom) || {},
+                        l = t.options.elements.arc;
+                      return {
+                        text: i,
+                        fillStyle: Zt([s.backgroundColor, r.backgroundColor, l.backgroundColor], void 0, n),
+                        strokeStyle: Zt([s.borderColor, r.borderColor, l.borderColor], void 0, n),
+                        lineWidth: Zt([s.borderWidth, r.borderWidth, l.borderWidth], void 0, n),
+                        hidden: isNaN(r.data[n]) || a.data[n].hidden,
+                        index: n,
+                      };
+                    })
+                  : [];
+              },
+            },
+            onClick: function (t, e) {
+              var i,
+                n,
+                a,
+                r = e.index,
+                o = this.chart;
+              for (i = 0, n = (o.data.datasets || []).length; i < n; ++i)
+                (a = o.getDatasetMeta(i)).data[r] && (a.data[r].hidden = !a.data[r].hidden);
+              o.update();
+            },
+          },
+          cutoutPercentage: 50,
+          rotation: -0.5 * Math.PI,
+          circumference: 2 * Math.PI,
+          tooltips: {
+            callbacks: {
+              title: function () {
+                return "";
+              },
+              label: function (t, e) {
+                var i = e.labels[t.index],
+                  n = ": " + e.datasets[t.datasetIndex].data[t.index];
+                return ut.isArray(i) ? ((i = i.slice())[0] += n) : (i += n), i;
+              },
+            },
+          },
+        });
+        var Xt = kt.extend({
+          dataElementType: Nt.Arc,
+          linkScales: ut.noop,
+          getRingIndex: function (t) {
+            for (var e = 0, i = 0; i < t; ++i) this.chart.isDatasetVisible(i) && ++e;
+            return e;
+          },
+          update: function (t) {
+            var e,
+              i,
+              n = this,
+              a = n.chart,
+              r = a.chartArea,
+              o = a.options,
+              s = r.right - r.left,
+              l = r.bottom - r.top,
+              u = Math.min(s, l),
+              d = { x: 0, y: 0 },
+              h = n.getMeta(),
+              c = h.data,
+              f = o.cutoutPercentage,
+              g = o.circumference,
+              m = n._getRingWeight(n.index);
+            if (g < 2 * Math.PI) {
+              var p = o.rotation % (2 * Math.PI),
+                v = (p += 2 * Math.PI * (p >= Math.PI ? -1 : p < -Math.PI ? 1 : 0)) + g,
+                y = { x: Math.cos(p), y: Math.sin(p) },
+                b = { x: Math.cos(v), y: Math.sin(v) },
+                x = (p <= 0 && v >= 0) || (p <= 2 * Math.PI && 2 * Math.PI <= v),
+                _ = (p <= 0.5 * Math.PI && 0.5 * Math.PI <= v) || (p <= 2.5 * Math.PI && 2.5 * Math.PI <= v),
+                k = (p <= -Math.PI && -Math.PI <= v) || (p <= Math.PI && Math.PI <= v),
+                w = (p <= 0.5 * -Math.PI && 0.5 * -Math.PI <= v) || (p <= 1.5 * Math.PI && 1.5 * Math.PI <= v),
+                M = f / 100,
+                S = {
+                  x: k ? -1 : Math.min(y.x * (y.x < 0 ? 1 : M), b.x * (b.x < 0 ? 1 : M)),
+                  y: w ? -1 : Math.min(y.y * (y.y < 0 ? 1 : M), b.y * (b.y < 0 ? 1 : M)),
+                },
+                D = {
+                  x: x ? 1 : Math.max(y.x * (y.x > 0 ? 1 : M), b.x * (b.x > 0 ? 1 : M)),
+                  y: _ ? 1 : Math.max(y.y * (y.y > 0 ? 1 : M), b.y * (b.y > 0 ? 1 : M)),
+                },
+                C = { width: 0.5 * (D.x - S.x), height: 0.5 * (D.y - S.y) };
+              (u = Math.min(s / C.width, l / C.height)), (d = { x: -0.5 * (D.x + S.x), y: -0.5 * (D.y + S.y) });
+            }
+            for (e = 0, i = c.length; e < i; ++e) c[e]._options = n._resolveElementOptions(c[e], e);
+            for (
+              a.borderWidth = n.getMaxBorderWidth(),
+                a.outerRadius = Math.max((u - a.borderWidth) / 2, 0),
+                a.innerRadius = Math.max(f ? (a.outerRadius / 100) * f : 0, 0),
+                a.radiusLength = (a.outerRadius - a.innerRadius) / (n._getVisibleDatasetWeightTotal() || 1),
+                a.offsetX = d.x * a.outerRadius,
+                a.offsetY = d.y * a.outerRadius,
+                h.total = n.calculateTotal(),
+                n.outerRadius = a.outerRadius - a.radiusLength * n._getRingWeightOffset(n.index),
+                n.innerRadius = Math.max(n.outerRadius - a.radiusLength * m, 0),
+                e = 0,
+                i = c.length;
+              e < i;
+              ++e
+            )
+              n.updateElement(c[e], e, t);
+          },
+          updateElement: function (t, e, i) {
+            var n = this,
+              a = n.chart,
+              r = a.chartArea,
+              o = a.options,
+              s = o.animation,
+              l = (r.left + r.right) / 2,
+              u = (r.top + r.bottom) / 2,
+              d = o.rotation,
+              h = o.rotation,
+              c = n.getDataset(),
+              f =
+                i && s.animateRotate
+                  ? 0
+                  : t.hidden
+                    ? 0
+                    : n.calculateCircumference(c.data[e]) * (o.circumference / (2 * Math.PI)),
+              g = i && s.animateScale ? 0 : n.innerRadius,
+              m = i && s.animateScale ? 0 : n.outerRadius,
+              p = t._options || {};
+            ut.extend(t, {
+              _datasetIndex: n.index,
+              _index: e,
+              _model: {
+                backgroundColor: p.backgroundColor,
+                borderColor: p.borderColor,
+                borderWidth: p.borderWidth,
+                borderAlign: p.borderAlign,
+                x: l + a.offsetX,
+                y: u + a.offsetY,
+                startAngle: d,
+                endAngle: h,
+                circumference: f,
+                outerRadius: m,
+                innerRadius: g,
+                label: ut.valueAtIndexOrDefault(c.label, e, a.data.labels[e]),
+              },
+            });
+            var v = t._model;
+            (i && s.animateRotate) ||
+              ((v.startAngle = 0 === e ? o.rotation : n.getMeta().data[e - 1]._model.endAngle),
+              (v.endAngle = v.startAngle + v.circumference)),
+              t.pivot();
+          },
+          calculateTotal: function () {
+            var t,
+              e = this.getDataset(),
+              i = this.getMeta(),
+              n = 0;
+            return (
+              ut.each(i.data, function (i, a) {
+                (t = e.data[a]), isNaN(t) || i.hidden || (n += Math.abs(t));
+              }),
+              n
+            );
+          },
+          calculateCircumference: function (t) {
+            var e = this.getMeta().total;
+            return e > 0 && !isNaN(t) ? 2 * Math.PI * (Math.abs(t) / e) : 0;
+          },
+          getMaxBorderWidth: function (t) {
+            var e,
+              i,
+              n,
+              a,
+              r,
+              o,
+              s,
+              l,
+              u = 0,
+              d = this.chart;
+            if (!t)
+              for (e = 0, i = d.data.datasets.length; e < i; ++e)
+                if (d.isDatasetVisible(e)) {
+                  (t = (n = d.getDatasetMeta(e)).data), e !== this.index && (r = n.controller);
+                  break;
+                }
+            if (!t) return 0;
+            for (e = 0, i = t.length; e < i; ++e)
+              (a = t[e]),
+                "inner" !== (o = r ? r._resolveElementOptions(a, e) : a._options).borderAlign &&
+                  ((s = o.borderWidth), (u = (l = o.hoverBorderWidth) > (u = s > u ? s : u) ? l : u));
+            return u;
+          },
+          setHoverStyle: function (t) {
+            var e = t._model,
+              i = t._options,
+              n = ut.getHoverColor;
+            (t.$previousStyle = {
+              backgroundColor: e.backgroundColor,
+              borderColor: e.borderColor,
+              borderWidth: e.borderWidth,
+            }),
+              (e.backgroundColor = $t(i.hoverBackgroundColor, n(i.backgroundColor))),
+              (e.borderColor = $t(i.hoverBorderColor, n(i.borderColor))),
+              (e.borderWidth = $t(i.hoverBorderWidth, i.borderWidth));
+          },
+          _resolveElementOptions: function (t, e) {
+            var i,
+              n,
+              a,
+              r = this.chart,
+              o = this.getDataset(),
+              s = t.custom || {},
+              l = r.options.elements.arc,
+              u = {},
+              d = { chart: r, dataIndex: e, dataset: o, datasetIndex: this.index },
+              h = [
+                "backgroundColor",
+                "borderColor",
+                "borderWidth",
+                "borderAlign",
+                "hoverBackgroundColor",
+                "hoverBorderColor",
+                "hoverBorderWidth",
+              ];
+            for (i = 0, n = h.length; i < n; ++i) u[(a = h[i])] = Zt([s[a], o[a], l[a]], d, e);
+            return u;
+          },
+          _getRingWeightOffset: function (t) {
+            for (var e = 0, i = 0; i < t; ++i) this.chart.isDatasetVisible(i) && (e += this._getRingWeight(i));
+            return e;
+          },
+          _getRingWeight: function (t) {
+            return Math.max($t(this.chart.data.datasets[t].weight, 1), 0);
+          },
+          _getVisibleDatasetWeightTotal: function () {
+            return this._getRingWeightOffset(this.chart.data.datasets.length);
+          },
+        });
+        ot._set("horizontalBar", {
+          hover: { mode: "index", axis: "y" },
+          scales: {
+            xAxes: [{ type: "linear", position: "bottom" }],
+            yAxes: [
+              {
+                type: "category",
+                position: "left",
+                categoryPercentage: 0.8,
+                barPercentage: 0.9,
+                offset: !0,
+                gridLines: { offsetGridLines: !0 },
+              },
+            ],
+          },
+          elements: { rectangle: { borderSkipped: "left" } },
+          tooltips: { mode: "index", axis: "y" },
+        });
+        var Kt = jt.extend({
+            _getValueScaleId: function () {
+              return this.getMeta().xAxisID;
+            },
+            _getIndexScaleId: function () {
+              return this.getMeta().yAxisID;
+            },
+          }),
+          Jt = ut.valueOrDefault,
+          Qt = ut.options.resolve,
+          te = ut.canvas._isPointInArea;
+        function ee(t, e) {
+          return Jt(t.showLine, e.showLines);
+        }
+        ot._set("line", {
+          showLines: !0,
+          spanGaps: !1,
+          hover: { mode: "label" },
+          scales: { xAxes: [{ type: "category", id: "x-axis-0" }], yAxes: [{ type: "linear", id: "y-axis-0" }] },
+        });
+        var ie = kt.extend({
+            datasetElementType: Nt.Line,
+            dataElementType: Nt.Point,
+            update: function (t) {
+              var e,
+                i,
+                n = this,
+                a = n.getMeta(),
+                r = a.dataset,
+                o = a.data || [],
+                s = n.getScaleForId(a.yAxisID),
+                l = n.getDataset(),
+                u = ee(l, n.chart.options);
+              for (
+                u &&
+                  (void 0 !== l.tension && void 0 === l.lineTension && (l.lineTension = l.tension),
+                  (r._scale = s),
+                  (r._datasetIndex = n.index),
+                  (r._children = o),
+                  (r._model = n._resolveLineOptions(r)),
+                  r.pivot()),
+                  e = 0,
+                  i = o.length;
+                e < i;
+                ++e
+              )
+                n.updateElement(o[e], e, t);
+              for (u && 0 !== r._model.tension && n.updateBezierControlPoints(), e = 0, i = o.length; e < i; ++e)
+                o[e].pivot();
+            },
+            updateElement: function (t, e, i) {
+              var n,
+                a,
+                r = this,
+                o = r.getMeta(),
+                s = t.custom || {},
+                l = r.getDataset(),
+                u = r.index,
+                d = l.data[e],
+                h = r.getScaleForId(o.yAxisID),
+                c = r.getScaleForId(o.xAxisID),
+                f = o.dataset._model,
+                g = r._resolvePointOptions(t, e);
+              (n = c.getPixelForValue("object" == typeof d ? d : NaN, e, u)),
+                (a = i ? h.getBasePixel() : r.calculatePointY(d, e, u)),
+                (t._xScale = c),
+                (t._yScale = h),
+                (t._options = g),
+                (t._datasetIndex = u),
+                (t._index = e),
+                (t._model = {
+                  x: n,
+                  y: a,
+                  skip: s.skip || isNaN(n) || isNaN(a),
+                  radius: g.radius,
+                  pointStyle: g.pointStyle,
+                  rotation: g.rotation,
+                  backgroundColor: g.backgroundColor,
+                  borderColor: g.borderColor,
+                  borderWidth: g.borderWidth,
+                  tension: Jt(s.tension, f ? f.tension : 0),
+                  steppedLine: !!f && f.steppedLine,
+                  hitRadius: g.hitRadius,
+                });
+            },
+            _resolvePointOptions: function (t, e) {
+              var i,
+                n,
+                a,
+                r = this.chart,
+                o = r.data.datasets[this.index],
+                s = t.custom || {},
+                l = r.options.elements.point,
+                u = {},
+                d = { chart: r, dataIndex: e, dataset: o, datasetIndex: this.index },
+                h = {
+                  backgroundColor: "pointBackgroundColor",
+                  borderColor: "pointBorderColor",
+                  borderWidth: "pointBorderWidth",
+                  hitRadius: "pointHitRadius",
+                  hoverBackgroundColor: "pointHoverBackgroundColor",
+                  hoverBorderColor: "pointHoverBorderColor",
+                  hoverBorderWidth: "pointHoverBorderWidth",
+                  hoverRadius: "pointHoverRadius",
+                  pointStyle: "pointStyle",
+                  radius: "pointRadius",
+                  rotation: "pointRotation",
+                },
+                c = Object.keys(h);
+              for (i = 0, n = c.length; i < n; ++i) u[(a = c[i])] = Qt([s[a], o[h[a]], o[a], l[a]], d, e);
+              return u;
+            },
+            _resolveLineOptions: function (t) {
+              var e,
+                i,
+                n,
+                a = this.chart,
+                r = a.data.datasets[this.index],
+                o = t.custom || {},
+                s = a.options,
+                l = s.elements.line,
+                u = {},
+                d = [
+                  "backgroundColor",
+                  "borderWidth",
+                  "borderColor",
+                  "borderCapStyle",
+                  "borderDash",
+                  "borderDashOffset",
+                  "borderJoinStyle",
+                  "fill",
+                  "cubicInterpolationMode",
+                ];
+              for (e = 0, i = d.length; e < i; ++e) u[(n = d[e])] = Qt([o[n], r[n], l[n]]);
+              return (
+                (u.spanGaps = Jt(r.spanGaps, s.spanGaps)),
+                (u.tension = Jt(r.lineTension, l.tension)),
+                (u.steppedLine = Qt([o.steppedLine, r.steppedLine, l.stepped])),
+                u
+              );
+            },
+            calculatePointY: function (t, e, i) {
+              var n,
+                a,
+                r,
+                o = this.chart,
+                s = this.getMeta(),
+                l = this.getScaleForId(s.yAxisID),
+                u = 0,
+                d = 0;
+              if (l.options.stacked) {
+                for (n = 0; n < i; n++)
+                  if (
+                    ((a = o.data.datasets[n]),
+                    "line" === (r = o.getDatasetMeta(n)).type && r.yAxisID === l.id && o.isDatasetVisible(n))
+                  ) {
+                    var h = Number(l.getRightValue(a.data[e]));
+                    h < 0 ? (d += h || 0) : (u += h || 0);
+                  }
+                var c = Number(l.getRightValue(t));
+                return c < 0 ? l.getPixelForValue(d + c) : l.getPixelForValue(u + c);
+              }
+              return l.getPixelForValue(t);
+            },
+            updateBezierControlPoints: function () {
+              var t,
+                e,
+                i,
+                n,
+                a = this.chart,
+                r = this.getMeta(),
+                o = r.dataset._model,
+                s = a.chartArea,
+                l = r.data || [];
+              function u(t, e, i) {
+                return Math.max(Math.min(t, i), e);
+              }
+              if (
+                (o.spanGaps &&
+                  (l = l.filter(function (t) {
+                    return !t._model.skip;
+                  })),
+                "monotone" === o.cubicInterpolationMode)
+              )
+                ut.splineCurveMonotone(l);
+              else
+                for (t = 0, e = l.length; t < e; ++t)
+                  (i = l[t]._model),
+                    (n = ut.splineCurve(ut.previousItem(l, t)._model, i, ut.nextItem(l, t)._model, o.tension)),
+                    (i.controlPointPreviousX = n.previous.x),
+                    (i.controlPointPreviousY = n.previous.y),
+                    (i.controlPointNextX = n.next.x),
+                    (i.controlPointNextY = n.next.y);
+              if (a.options.elements.line.capBezierPoints)
+                for (t = 0, e = l.length; t < e; ++t)
+                  (i = l[t]._model),
+                    te(i, s) &&
+                      (t > 0 &&
+                        te(l[t - 1]._model, s) &&
+                        ((i.controlPointPreviousX = u(i.controlPointPreviousX, s.left, s.right)),
+                        (i.controlPointPreviousY = u(i.controlPointPreviousY, s.top, s.bottom))),
+                      t < l.length - 1 &&
+                        te(l[t + 1]._model, s) &&
+                        ((i.controlPointNextX = u(i.controlPointNextX, s.left, s.right)),
+                        (i.controlPointNextY = u(i.controlPointNextY, s.top, s.bottom))));
+            },
+            draw: function () {
+              var t,
+                e = this.chart,
+                i = this.getMeta(),
+                n = i.data || [],
+                a = e.chartArea,
+                r = n.length,
+                o = 0;
+              for (
+                ee(this.getDataset(), e.options) &&
+                ((t = (i.dataset._model.borderWidth || 0) / 2),
+                ut.canvas.clipArea(e.ctx, { left: a.left, right: a.right, top: a.top - t, bottom: a.bottom + t }),
+                i.dataset.draw(),
+                ut.canvas.unclipArea(e.ctx));
+                o < r;
+                ++o
+              )
+                n[o].draw(a);
+            },
+            setHoverStyle: function (t) {
+              var e = t._model,
+                i = t._options,
+                n = ut.getHoverColor;
+              (t.$previousStyle = {
+                backgroundColor: e.backgroundColor,
+                borderColor: e.borderColor,
+                borderWidth: e.borderWidth,
+                radius: e.radius,
+              }),
+                (e.backgroundColor = Jt(i.hoverBackgroundColor, n(i.backgroundColor))),
+                (e.borderColor = Jt(i.hoverBorderColor, n(i.borderColor))),
+                (e.borderWidth = Jt(i.hoverBorderWidth, i.borderWidth)),
+                (e.radius = Jt(i.hoverRadius, i.radius));
+            },
+          }),
+          ne = ut.options.resolve;
+        ot._set("polarArea", {
+          scale: {
+            type: "radialLinear",
+            angleLines: { display: !1 },
+            gridLines: { circular: !0 },
+            pointLabels: { display: !1 },
+            ticks: { beginAtZero: !0 },
+          },
+          animation: { animateRotate: !0, animateScale: !0 },
+          startAngle: -0.5 * Math.PI,
+          legendCallback: function (t) {
+            var e = [];
+            e.push('<ul class="' + t.id + '-legend">');
+            var i = t.data,
+              n = i.datasets,
+              a = i.labels;
+            if (n.length)
+              for (var r = 0; r < n[0].data.length; ++r)
+                e.push('<li><span style="background-color:' + n[0].backgroundColor[r] + '"></span>'),
+                  a[r] && e.push(a[r]),
+                  e.push("</li>");
+            return e.push("</ul>"), e.join("");
+          },
+          legend: {
+            labels: {
+              generateLabels: function (t) {
+                var e = t.data;
+                return e.labels.length && e.datasets.length
+                  ? e.labels.map(function (i, n) {
+                      var a = t.getDatasetMeta(0),
+                        r = e.datasets[0],
+                        o = a.data[n].custom || {},
+                        s = t.options.elements.arc;
+                      return {
+                        text: i,
+                        fillStyle: ne([o.backgroundColor, r.backgroundColor, s.backgroundColor], void 0, n),
+                        strokeStyle: ne([o.borderColor, r.borderColor, s.borderColor], void 0, n),
+                        lineWidth: ne([o.borderWidth, r.borderWidth, s.borderWidth], void 0, n),
+                        hidden: isNaN(r.data[n]) || a.data[n].hidden,
+                        index: n,
+                      };
+                    })
+                  : [];
+              },
+            },
+            onClick: function (t, e) {
+              var i,
+                n,
+                a,
+                r = e.index,
+                o = this.chart;
+              for (i = 0, n = (o.data.datasets || []).length; i < n; ++i)
+                (a = o.getDatasetMeta(i)).data[r].hidden = !a.data[r].hidden;
+              o.update();
+            },
+          },
+          tooltips: {
+            callbacks: {
+              title: function () {
+                return "";
+              },
+              label: function (t, e) {
+                return e.labels[t.index] + ": " + t.yLabel;
+              },
+            },
+          },
+        });
+        var ae = kt.extend({
+          dataElementType: Nt.Arc,
+          linkScales: ut.noop,
+          update: function (t) {
+            var e,
+              i,
+              n,
+              a = this,
+              r = a.getDataset(),
+              o = a.getMeta(),
+              s = a.chart.options.startAngle || 0,
+              l = (a._starts = []),
+              u = (a._angles = []),
+              d = o.data;
+            for (a._updateRadius(), o.count = a.countVisibleElements(), e = 0, i = r.data.length; e < i; e++)
+              (l[e] = s), (n = a._computeAngle(e)), (u[e] = n), (s += n);
+            for (e = 0, i = d.length; e < i; ++e)
+              (d[e]._options = a._resolveElementOptions(d[e], e)), a.updateElement(d[e], e, t);
+          },
+          _updateRadius: function () {
+            var t = this,
+              e = t.chart,
+              i = e.chartArea,
+              n = e.options,
+              a = Math.min(i.right - i.left, i.bottom - i.top);
+            (e.outerRadius = Math.max(a / 2, 0)),
+              (e.innerRadius = Math.max(n.cutoutPercentage ? (e.outerRadius / 100) * n.cutoutPercentage : 1, 0)),
+              (e.radiusLength = (e.outerRadius - e.innerRadius) / e.getVisibleDatasetCount()),
+              (t.outerRadius = e.outerRadius - e.radiusLength * t.index),
+              (t.innerRadius = t.outerRadius - e.radiusLength);
+          },
+          updateElement: function (t, e, i) {
+            var n = this,
+              a = n.chart,
+              r = n.getDataset(),
+              o = a.options,
+              s = o.animation,
+              l = a.scale,
+              u = a.data.labels,
+              d = l.xCenter,
+              h = l.yCenter,
+              c = o.startAngle,
+              f = t.hidden ? 0 : l.getDistanceFromCenterForValue(r.data[e]),
+              g = n._starts[e],
+              m = g + (t.hidden ? 0 : n._angles[e]),
+              p = s.animateScale ? 0 : l.getDistanceFromCenterForValue(r.data[e]),
+              v = t._options || {};
+            ut.extend(t, {
+              _datasetIndex: n.index,
+              _index: e,
+              _scale: l,
+              _model: {
+                backgroundColor: v.backgroundColor,
+                borderColor: v.borderColor,
+                borderWidth: v.borderWidth,
+                borderAlign: v.borderAlign,
+                x: d,
+                y: h,
+                innerRadius: 0,
+                outerRadius: i ? p : f,
+                startAngle: i && s.animateRotate ? c : g,
+                endAngle: i && s.animateRotate ? c : m,
+                label: ut.valueAtIndexOrDefault(u, e, u[e]),
+              },
+            }),
+              t.pivot();
+          },
+          countVisibleElements: function () {
+            var t = this.getDataset(),
+              e = this.getMeta(),
+              i = 0;
+            return (
+              ut.each(e.data, function (e, n) {
+                isNaN(t.data[n]) || e.hidden || i++;
+              }),
+              i
+            );
+          },
+          setHoverStyle: function (t) {
+            var e = t._model,
+              i = t._options,
+              n = ut.getHoverColor,
+              a = ut.valueOrDefault;
+            (t.$previousStyle = {
+              backgroundColor: e.backgroundColor,
+              borderColor: e.borderColor,
+              borderWidth: e.borderWidth,
+            }),
+              (e.backgroundColor = a(i.hoverBackgroundColor, n(i.backgroundColor))),
+              (e.borderColor = a(i.hoverBorderColor, n(i.borderColor))),
+              (e.borderWidth = a(i.hoverBorderWidth, i.borderWidth));
+          },
+          _resolveElementOptions: function (t, e) {
+            var i,
+              n,
+              a,
+              r = this.chart,
+              o = this.getDataset(),
+              s = t.custom || {},
+              l = r.options.elements.arc,
+              u = {},
+              d = { chart: r, dataIndex: e, dataset: o, datasetIndex: this.index },
+              h = [
+                "backgroundColor",
+                "borderColor",
+                "borderWidth",
+                "borderAlign",
+                "hoverBackgroundColor",
+                "hoverBorderColor",
+                "hoverBorderWidth",
+              ];
+            for (i = 0, n = h.length; i < n; ++i) u[(a = h[i])] = ne([s[a], o[a], l[a]], d, e);
+            return u;
+          },
+          _computeAngle: function (t) {
+            var e = this,
+              i = this.getMeta().count,
+              n = e.getDataset(),
+              a = e.getMeta();
+            if (isNaN(n.data[t]) || a.data[t].hidden) return 0;
+            var r = { chart: e.chart, dataIndex: t, dataset: n, datasetIndex: e.index };
+            return ne([e.chart.options.elements.arc.angle, (2 * Math.PI) / i], r, t);
+          },
+        });
+        ot._set("pie", ut.clone(ot.doughnut)), ot._set("pie", { cutoutPercentage: 0 });
+        var re = Xt,
+          oe = ut.valueOrDefault,
+          se = ut.options.resolve;
+        ot._set("radar", { scale: { type: "radialLinear" }, elements: { line: { tension: 0 } } });
+        var le = kt.extend({
+          datasetElementType: Nt.Line,
+          dataElementType: Nt.Point,
+          linkScales: ut.noop,
+          update: function (t) {
+            var e,
+              i,
+              n = this,
+              a = n.getMeta(),
+              r = a.dataset,
+              o = a.data || [],
+              s = n.chart.scale,
+              l = n.getDataset();
+            for (
+              void 0 !== l.tension && void 0 === l.lineTension && (l.lineTension = l.tension),
+                r._scale = s,
+                r._datasetIndex = n.index,
+                r._children = o,
+                r._loop = !0,
+                r._model = n._resolveLineOptions(r),
+                r.pivot(),
+                e = 0,
+                i = o.length;
+              e < i;
+              ++e
+            )
+              n.updateElement(o[e], e, t);
+            for (n.updateBezierControlPoints(), e = 0, i = o.length; e < i; ++e) o[e].pivot();
+          },
+          updateElement: function (t, e, i) {
+            var n = this,
+              a = t.custom || {},
+              r = n.getDataset(),
+              o = n.chart.scale,
+              s = o.getPointPositionForValue(e, r.data[e]),
+              l = n._resolvePointOptions(t, e),
+              u = n.getMeta().dataset._model,
+              d = i ? o.xCenter : s.x,
+              h = i ? o.yCenter : s.y;
+            (t._scale = o),
+              (t._options = l),
+              (t._datasetIndex = n.index),
+              (t._index = e),
+              (t._model = {
+                x: d,
+                y: h,
+                skip: a.skip || isNaN(d) || isNaN(h),
+                radius: l.radius,
+                pointStyle: l.pointStyle,
+                rotation: l.rotation,
+                backgroundColor: l.backgroundColor,
+                borderColor: l.borderColor,
+                borderWidth: l.borderWidth,
+                tension: oe(a.tension, u ? u.tension : 0),
+                hitRadius: l.hitRadius,
+              });
+          },
+          _resolvePointOptions: function (t, e) {
+            var i,
+              n,
+              a,
+              r = this.chart,
+              o = r.data.datasets[this.index],
+              s = t.custom || {},
+              l = r.options.elements.point,
+              u = {},
+              d = { chart: r, dataIndex: e, dataset: o, datasetIndex: this.index },
+              h = {
+                backgroundColor: "pointBackgroundColor",
+                borderColor: "pointBorderColor",
+                borderWidth: "pointBorderWidth",
+                hitRadius: "pointHitRadius",
+                hoverBackgroundColor: "pointHoverBackgroundColor",
+                hoverBorderColor: "pointHoverBorderColor",
+                hoverBorderWidth: "pointHoverBorderWidth",
+                hoverRadius: "pointHoverRadius",
+                pointStyle: "pointStyle",
+                radius: "pointRadius",
+                rotation: "pointRotation",
+              },
+              c = Object.keys(h);
+            for (i = 0, n = c.length; i < n; ++i) u[(a = c[i])] = se([s[a], o[h[a]], o[a], l[a]], d, e);
+            return u;
+          },
+          _resolveLineOptions: function (t) {
+            var e,
+              i,
+              n,
+              a = this.chart,
+              r = a.data.datasets[this.index],
+              o = t.custom || {},
+              s = a.options.elements.line,
+              l = {},
+              u = [
+                "backgroundColor",
+                "borderWidth",
+                "borderColor",
+                "borderCapStyle",
+                "borderDash",
+                "borderDashOffset",
+                "borderJoinStyle",
+                "fill",
+              ];
+            for (e = 0, i = u.length; e < i; ++e) l[(n = u[e])] = se([o[n], r[n], s[n]]);
+            return (l.tension = oe(r.lineTension, s.tension)), l;
+          },
+          updateBezierControlPoints: function () {
+            var t,
+              e,
+              i,
+              n,
+              a = this.getMeta(),
+              r = this.chart.chartArea,
+              o = a.data || [];
+            function s(t, e, i) {
+              return Math.max(Math.min(t, i), e);
+            }
+            for (t = 0, e = o.length; t < e; ++t)
+              (i = o[t]._model),
+                (n = ut.splineCurve(ut.previousItem(o, t, !0)._model, i, ut.nextItem(o, t, !0)._model, i.tension)),
+                (i.controlPointPreviousX = s(n.previous.x, r.left, r.right)),
+                (i.controlPointPreviousY = s(n.previous.y, r.top, r.bottom)),
+                (i.controlPointNextX = s(n.next.x, r.left, r.right)),
+                (i.controlPointNextY = s(n.next.y, r.top, r.bottom));
+          },
+          setHoverStyle: function (t) {
+            var e = t._model,
+              i = t._options,
+              n = ut.getHoverColor;
+            (t.$previousStyle = {
+              backgroundColor: e.backgroundColor,
+              borderColor: e.borderColor,
+              borderWidth: e.borderWidth,
+              radius: e.radius,
+            }),
+              (e.backgroundColor = oe(i.hoverBackgroundColor, n(i.backgroundColor))),
+              (e.borderColor = oe(i.hoverBorderColor, n(i.borderColor))),
+              (e.borderWidth = oe(i.hoverBorderWidth, i.borderWidth)),
+              (e.radius = oe(i.hoverRadius, i.radius));
+          },
+        });
+        ot._set("scatter", {
+          hover: { mode: "single" },
+          scales: {
+            xAxes: [{ id: "x-axis-1", type: "linear", position: "bottom" }],
+            yAxes: [{ id: "y-axis-1", type: "linear", position: "left" }],
+          },
+          showLines: !1,
+          tooltips: {
+            callbacks: {
+              title: function () {
+                return "";
+              },
+              label: function (t) {
+                return "(" + t.xLabel + ", " + t.yLabel + ")";
+              },
+            },
+          },
+        });
+        var ue = {
+          bar: jt,
+          bubble: qt,
+          doughnut: Xt,
+          horizontalBar: Kt,
+          line: ie,
+          polarArea: ae,
+          pie: re,
+          radar: le,
+          scatter: ie,
+        };
+        function de(t, e) {
+          return t.native ? { x: t.x, y: t.y } : ut.getRelativePosition(t, e);
+        }
+        function he(t, e) {
+          var i, n, a, r, o;
+          for (n = 0, r = t.data.datasets.length; n < r; ++n)
+            if (t.isDatasetVisible(n))
+              for (a = 0, o = (i = t.getDatasetMeta(n)).data.length; a < o; ++a) {
+                var s = i.data[a];
+                s._view.skip || e(s);
+              }
+        }
+        function ce(t, e) {
+          var i = [];
+          return (
+            he(t, function (t) {
+              t.inRange(e.x, e.y) && i.push(t);
+            }),
+            i
+          );
+        }
+        function fe(t, e, i, n) {
+          var a = Number.POSITIVE_INFINITY,
+            r = [];
+          return (
+            he(t, function (t) {
+              if (!i || t.inRange(e.x, e.y)) {
+                var o = t.getCenterPoint(),
+                  s = n(e, o);
+                s < a ? ((r = [t]), (a = s)) : s === a && r.push(t);
+              }
+            }),
+            r
+          );
+        }
+        function ge(t) {
+          var e = -1 !== t.indexOf("x"),
+            i = -1 !== t.indexOf("y");
+          return function (t, n) {
+            var a = e ? Math.abs(t.x - n.x) : 0,
+              r = i ? Math.abs(t.y - n.y) : 0;
+            return Math.sqrt(Math.pow(a, 2) + Math.pow(r, 2));
+          };
+        }
+        function me(t, e, i) {
+          var n = de(e, t);
+          i.axis = i.axis || "x";
+          var a = ge(i.axis),
+            r = i.intersect ? ce(t, n) : fe(t, n, !1, a),
+            o = [];
+          return r.length
+            ? (t.data.datasets.forEach(function (e, i) {
+                if (t.isDatasetVisible(i)) {
+                  var n = t.getDatasetMeta(i).data[r[0]._index];
+                  n && !n._view.skip && o.push(n);
+                }
+              }),
+              o)
+            : [];
+        }
+        var pe = {
+          modes: {
+            single: function (t, e) {
+              var i = de(e, t),
+                n = [];
+              return (
+                he(t, function (t) {
+                  if (t.inRange(i.x, i.y)) return n.push(t), n;
+                }),
+                n.slice(0, 1)
+              );
+            },
+            label: me,
+            index: me,
+            dataset: function (t, e, i) {
+              var n = de(e, t);
+              i.axis = i.axis || "xy";
+              var a = ge(i.axis),
+                r = i.intersect ? ce(t, n) : fe(t, n, !1, a);
+              return r.length > 0 && (r = t.getDatasetMeta(r[0]._datasetIndex).data), r;
+            },
+            "x-axis": function (t, e) {
+              return me(t, e, { intersect: !1 });
+            },
+            point: function (t, e) {
+              return ce(t, de(e, t));
+            },
+            nearest: function (t, e, i) {
+              var n = de(e, t);
+              i.axis = i.axis || "xy";
+              var a = ge(i.axis);
+              return fe(t, n, i.intersect, a);
+            },
+            x: function (t, e, i) {
+              var n = de(e, t),
+                a = [],
+                r = !1;
+              return (
+                he(t, function (t) {
+                  t.inXRange(n.x) && a.push(t), t.inRange(n.x, n.y) && (r = !0);
+                }),
+                i.intersect && !r && (a = []),
+                a
+              );
+            },
+            y: function (t, e, i) {
+              var n = de(e, t),
+                a = [],
+                r = !1;
+              return (
+                he(t, function (t) {
+                  t.inYRange(n.y) && a.push(t), t.inRange(n.x, n.y) && (r = !0);
+                }),
+                i.intersect && !r && (a = []),
+                a
+              );
+            },
+          },
+        };
+        function ve(t, e) {
+          return ut.where(t, function (t) {
+            return t.position === e;
+          });
+        }
+        function ye(t, e) {
+          t.forEach(function (t, e) {
+            return (t._tmpIndex_ = e), t;
+          }),
+            t.sort(function (t, i) {
+              var n = e ? i : t,
+                a = e ? t : i;
+              return n.weight === a.weight ? n._tmpIndex_ - a._tmpIndex_ : n.weight - a.weight;
+            }),
+            t.forEach(function (t) {
+              delete t._tmpIndex_;
+            });
+        }
+        function be(t, e) {
+          ut.each(t, function (t) {
+            e[t.position] += t.isHorizontal() ? t.height : t.width;
+          });
+        }
+        ot._set("global", { layout: { padding: { top: 0, right: 0, bottom: 0, left: 0 } } });
+        var xe = {
+          defaults: {},
+          addBox: function (t, e) {
+            t.boxes || (t.boxes = []),
+              (e.fullWidth = e.fullWidth || !1),
+              (e.position = e.position || "top"),
+              (e.weight = e.weight || 0),
+              t.boxes.push(e);
+          },
+          removeBox: function (t, e) {
+            var i = t.boxes ? t.boxes.indexOf(e) : -1;
+            -1 !== i && t.boxes.splice(i, 1);
+          },
+          configure: function (t, e, i) {
+            for (var n, a = ["fullWidth", "position", "weight"], r = a.length, o = 0; o < r; ++o)
+              (n = a[o]), i.hasOwnProperty(n) && (e[n] = i[n]);
+          },
+          update: function (t, e, i) {
+            if (t) {
+              var n = t.options.layout || {},
+                a = ut.options.toPadding(n.padding),
+                r = a.left,
+                o = a.right,
+                s = a.top,
+                l = a.bottom,
+                u = ve(t.boxes, "left"),
+                d = ve(t.boxes, "right"),
+                h = ve(t.boxes, "top"),
+                c = ve(t.boxes, "bottom"),
+                f = ve(t.boxes, "chartArea");
+              ye(u, !0), ye(d, !1), ye(h, !0), ye(c, !1);
+              var g,
+                m = u.concat(d),
+                p = h.concat(c),
+                v = m.concat(p),
+                y = e - r - o,
+                b = i - s - l,
+                x = (e - y / 2) / m.length,
+                _ = y,
+                k = b,
+                w = { top: s, left: r, bottom: l, right: o },
+                M = [];
+              ut.each(v, function (t) {
+                var e,
+                  i = t.isHorizontal();
+                i
+                  ? ((e = t.update(t.fullWidth ? y : _, b / 2)), (k -= e.height))
+                  : ((e = t.update(x, k)), (_ -= e.width)),
+                  M.push({ horizontal: i, width: e.width, box: t });
+              }),
+                (g = (function (t) {
+                  var e = 0,
+                    i = 0,
+                    n = 0,
+                    a = 0;
+                  return (
+                    ut.each(t, function (t) {
+                      if (t.getPadding) {
+                        var r = t.getPadding();
+                        (e = Math.max(e, r.top)),
+                          (i = Math.max(i, r.left)),
+                          (n = Math.max(n, r.bottom)),
+                          (a = Math.max(a, r.right));
+                      }
+                    }),
+                    { top: e, left: i, bottom: n, right: a }
+                  );
+                })(v)),
+                ut.each(m, I),
+                be(m, w),
+                ut.each(p, I),
+                be(p, w),
+                ut.each(m, function (t) {
+                  var e = ut.findNextWhere(M, function (e) {
+                      return e.box === t;
+                    }),
+                    i = { left: 0, right: 0, top: w.top, bottom: w.bottom };
+                  e && t.update(e.width, k, i);
+                }),
+                be(v, (w = { top: s, left: r, bottom: l, right: o }));
+              var S = Math.max(g.left - w.left, 0);
+              (w.left += S), (w.right += Math.max(g.right - w.right, 0));
+              var D = Math.max(g.top - w.top, 0);
+              (w.top += D), (w.bottom += Math.max(g.bottom - w.bottom, 0));
+              var C = i - w.top - w.bottom,
+                P = e - w.left - w.right;
+              (P === _ && C === k) ||
+                (ut.each(m, function (t) {
+                  t.height = C;
+                }),
+                ut.each(p, function (t) {
+                  t.fullWidth || (t.width = P);
+                }),
+                (k = C),
+                (_ = P));
+              var T = r + S,
+                O = s + D;
+              ut.each(u.concat(h), A),
+                (T += _),
+                (O += k),
+                ut.each(d, A),
+                ut.each(c, A),
+                (t.chartArea = { left: w.left, top: w.top, right: w.left + _, bottom: w.top + k }),
+                ut.each(f, function (e) {
+                  (e.left = t.chartArea.left),
+                    (e.top = t.chartArea.top),
+                    (e.right = t.chartArea.right),
+                    (e.bottom = t.chartArea.bottom),
+                    e.update(_, k);
+                });
+            }
+            function I(t) {
+              var e = ut.findNextWhere(M, function (e) {
+                return e.box === t;
+              });
+              if (e)
+                if (e.horizontal) {
+                  var i = { left: Math.max(w.left, g.left), right: Math.max(w.right, g.right), top: 0, bottom: 0 };
+                  t.update(t.fullWidth ? y : _, b / 2, i);
+                } else t.update(e.width, k);
+            }
+            function A(t) {
+              t.isHorizontal()
+                ? ((t.left = t.fullWidth ? r : w.left),
+                  (t.right = t.fullWidth ? e - o : w.left + _),
+                  (t.top = O),
+                  (t.bottom = O + t.height),
+                  (O = t.bottom))
+                : ((t.left = T), (t.right = T + t.width), (t.top = w.top), (t.bottom = w.top + k), (T = t.right));
+            }
+          },
+        };
+        "undefined" != typeof window
+          ? window
+          : "undefined" != typeof global
+            ? global
+            : "undefined" != typeof self && self;
+        function _e() {
+          throw new Error("Dynamic requires are not currently supported by rollup-plugin-commonjs");
+        }
+        var ke,
+          we =
+            ((ke = Object.freeze({
+              default:
+                "@keyframes chartjs-render-animation{from{opacity:.99}to{opacity:1}}.chartjs-render-monitor{animation:chartjs-render-animation 1ms}.chartjs-size-monitor,.chartjs-size-monitor-expand,.chartjs-size-monitor-shrink{position:absolute;direction:ltr;left:0;top:0;right:0;bottom:0;overflow:hidden;pointer-events:none;visibility:hidden;z-index:-1}.chartjs-size-monitor-expand>div{position:absolute;width:1000000px;height:1000000px;left:0;top:0}.chartjs-size-monitor-shrink>div{position:absolute;width:200%;height:200%;left:0;top:0}",
+            })) &&
+              ke.default) ||
+            ke,
+          Me = "$chartjs",
+          Se = "chartjs-size-monitor",
+          De = "chartjs-render-monitor",
+          Ce = "chartjs-render-animation",
+          Pe = ["animationstart", "webkitAnimationStart"],
+          Te = {
+            touchstart: "mousedown",
+            touchmove: "mousemove",
+            touchend: "mouseup",
+            pointerenter: "mouseenter",
+            pointerdown: "mousedown",
+            pointermove: "mousemove",
+            pointerup: "mouseup",
+            pointerleave: "mouseout",
+            pointerout: "mouseout",
+          };
+        function Oe(t, e) {
+          var i = ut.getStyle(t, e),
+            n = i && i.match(/^(\d+)(\.\d+)?px$/);
+          return n ? Number(n[1]) : void 0;
+        }
+        var Ie = !!(function () {
+          var t = !1;
+          try {
+            var e = Object.defineProperty({}, "passive", {
+              get: function () {
+                t = !0;
+              },
+            });
+            window.addEventListener("e", null, e);
+          } catch (t) {}
+          return t;
+        })() && { passive: !0 };
+        function Ae(t, e, i) {
+          t.addEventListener(e, i, Ie);
+        }
+        function Fe(t, e, i) {
+          t.removeEventListener(e, i, Ie);
+        }
+        function Re(t, e, i, n, a) {
+          return { type: t, chart: e, native: a || null, x: void 0 !== i ? i : null, y: void 0 !== n ? n : null };
+        }
+        function Le(t) {
+          var e = document.createElement("div");
+          return (e.className = t || ""), e;
+        }
+        function We(t, e, i) {
+          var n,
+            a,
+            r,
+            o,
+            s = t[Me] || (t[Me] = {}),
+            l = (s.resizer = (function (t) {
+              var e = Le(Se),
+                i = Le(Se + "-expand"),
+                n = Le(Se + "-shrink");
+              i.appendChild(Le()),
+                n.appendChild(Le()),
+                e.appendChild(i),
+                e.appendChild(n),
+                (e._reset = function () {
+                  (i.scrollLeft = 1e6), (i.scrollTop = 1e6), (n.scrollLeft = 1e6), (n.scrollTop = 1e6);
+                });
+              var a = function () {
+                e._reset(), t();
+              };
+              return Ae(i, "scroll", a.bind(i, "expand")), Ae(n, "scroll", a.bind(n, "shrink")), e;
+            })(
+              ((n = function () {
+                if (s.resizer) {
+                  var n = i.options.maintainAspectRatio && t.parentNode,
+                    a = n ? n.clientWidth : 0;
+                  e(Re("resize", i)), n && n.clientWidth < a && i.canvas && e(Re("resize", i));
+                }
+              }),
+              (r = !1),
+              (o = []),
+              function () {
+                (o = Array.prototype.slice.call(arguments)),
+                  (a = a || this),
+                  r ||
+                    ((r = !0),
+                    ut.requestAnimFrame.call(window, function () {
+                      (r = !1), n.apply(a, o);
+                    }));
+              })
+            ));
+          !(function (t, e) {
+            var i = t[Me] || (t[Me] = {}),
+              n = (i.renderProxy = function (t) {
+                t.animationName === Ce && e();
+              });
+            ut.each(Pe, function (e) {
+              Ae(t, e, n);
+            }),
+              (i.reflow = !!t.offsetParent),
+              t.classList.add(De);
+          })(t, function () {
+            if (s.resizer) {
+              var e = t.parentNode;
+              e && e !== l.parentNode && e.insertBefore(l, e.firstChild), l._reset();
+            }
+          });
+        }
+        function Ye(t) {
+          var e = t[Me] || {},
+            i = e.resizer;
+          delete e.resizer,
+            (function (t) {
+              var e = t[Me] || {},
+                i = e.renderProxy;
+              i &&
+                (ut.each(Pe, function (e) {
+                  Fe(t, e, i);
+                }),
+                delete e.renderProxy),
+                t.classList.remove(De);
+            })(t),
+            i && i.parentNode && i.parentNode.removeChild(i);
+        }
+        var Ne = {
+          disableCSSInjection: !1,
+          _enabled: "undefined" != typeof window && "undefined" != typeof document,
+          _ensureLoaded: function () {
+            var t, e, i;
+            this._loaded ||
+              ((this._loaded = !0),
+              this.disableCSSInjection ||
+                ((e = we),
+                (i = (t = this)._style || document.createElement("style")),
+                t._style ||
+                  ((t._style = i),
+                  (e = "/* Chart.js */\n" + e),
+                  i.setAttribute("type", "text/css"),
+                  document.getElementsByTagName("head")[0].appendChild(i)),
+                i.appendChild(document.createTextNode(e))));
+          },
+          acquireContext: function (t, e) {
+            "string" == typeof t ? (t = document.getElementById(t)) : t.length && (t = t[0]),
+              t && t.canvas && (t = t.canvas);
+            var i = t && t.getContext && t.getContext("2d");
+            return (
+              this._ensureLoaded(),
+              i && i.canvas === t
+                ? ((function (t, e) {
+                    var i = t.style,
+                      n = t.getAttribute("height"),
+                      a = t.getAttribute("width");
+                    if (
+                      ((t[Me] = {
+                        initial: {
+                          height: n,
+                          width: a,
+                          style: { display: i.display, height: i.height, width: i.width },
+                        },
+                      }),
+                      (i.display = i.display || "block"),
+                      null === a || "" === a)
+                    ) {
+                      var r = Oe(t, "width");
+                      void 0 !== r && (t.width = r);
+                    }
+                    if (null === n || "" === n)
+                      if ("" === t.style.height) t.height = t.width / (e.options.aspectRatio || 2);
+                      else {
+                        var o = Oe(t, "height");
+                        void 0 !== r && (t.height = o);
+                      }
+                  })(t, e),
+                  i)
+                : null
+            );
+          },
+          releaseContext: function (t) {
+            var e = t.canvas;
+            if (e[Me]) {
+              var i = e[Me].initial;
+              ["height", "width"].forEach(function (t) {
+                var n = i[t];
+                ut.isNullOrUndef(n) ? e.removeAttribute(t) : e.setAttribute(t, n);
+              }),
+                ut.each(i.style || {}, function (t, i) {
+                  e.style[i] = t;
+                }),
+                (e.width = e.width),
+                delete e[Me];
+            }
+          },
+          addEventListener: function (t, e, i) {
+            var n = t.canvas;
+            if ("resize" !== e) {
+              var a = i[Me] || (i[Me] = {});
+              Ae(
+                n,
+                e,
+                ((a.proxies || (a.proxies = {}))[t.id + "_" + e] = function (e) {
+                  i(
+                    (function (t, e) {
+                      var i = Te[t.type] || t.type,
+                        n = ut.getRelativePosition(t, e);
+                      return Re(i, e, n.x, n.y, t);
+                    })(e, t)
+                  );
+                })
+              );
+            } else We(n, i, t);
+          },
+          removeEventListener: function (t, e, i) {
+            var n = t.canvas;
+            if ("resize" !== e) {
+              var a = ((i[Me] || {}).proxies || {})[t.id + "_" + e];
+              a && Fe(n, e, a);
+            } else Ye(n);
+          },
+        };
+        (ut.addEvent = Ae), (ut.removeEvent = Fe);
+        var ze = Ne._enabled
+            ? Ne
+            : {
+                acquireContext: function (t) {
+                  return t && t.canvas && (t = t.canvas), (t && t.getContext("2d")) || null;
+                },
+              },
+          Ve = ut.extend(
+            {
+              initialize: function () {},
+              acquireContext: function () {},
+              releaseContext: function () {},
+              addEventListener: function () {},
+              removeEventListener: function () {},
+            },
+            ze
+          );
+        ot._set("global", { plugins: {} });
+        var He = {
+            _plugins: [],
+            _cacheId: 0,
+            register: function (t) {
+              var e = this._plugins;
+              [].concat(t).forEach(function (t) {
+                -1 === e.indexOf(t) && e.push(t);
+              }),
+                this._cacheId++;
+            },
+            unregister: function (t) {
+              var e = this._plugins;
+              [].concat(t).forEach(function (t) {
+                var i = e.indexOf(t);
+                -1 !== i && e.splice(i, 1);
+              }),
+                this._cacheId++;
+            },
+            clear: function () {
+              (this._plugins = []), this._cacheId++;
+            },
+            count: function () {
+              return this._plugins.length;
+            },
+            getAll: function () {
+              return this._plugins;
+            },
+            notify: function (t, e, i) {
+              var n,
+                a,
+                r,
+                o,
+                s,
+                l = this.descriptors(t),
+                u = l.length;
+              for (n = 0; n < u; ++n)
+                if (
+                  "function" == typeof (s = (r = (a = l[n]).plugin)[e]) &&
+                  ((o = [t].concat(i || [])).push(a.options), !1 === s.apply(r, o))
+                )
+                  return !1;
+              return !0;
+            },
+            descriptors: function (t) {
+              var e = t.$plugins || (t.$plugins = {});
+              if (e.id === this._cacheId) return e.descriptors;
+              var i = [],
+                n = [],
+                a = (t && t.config) || {},
+                r = (a.options && a.options.plugins) || {};
+              return (
+                this._plugins.concat(a.plugins || []).forEach(function (t) {
+                  if (-1 === i.indexOf(t)) {
+                    var e = t.id,
+                      a = r[e];
+                    !1 !== a &&
+                      (!0 === a && (a = ut.clone(ot.global.plugins[e])),
+                      i.push(t),
+                      n.push({ plugin: t, options: a || {} }));
+                  }
+                }),
+                (e.descriptors = n),
+                (e.id = this._cacheId),
+                n
+              );
+            },
+            _invalidate: function (t) {
+              delete t.$plugins;
+            },
+          },
+          Ee = {
+            constructors: {},
+            defaults: {},
+            registerScaleType: function (t, e, i) {
+              (this.constructors[t] = e), (this.defaults[t] = ut.clone(i));
+            },
+            getScaleConstructor: function (t) {
+              return this.constructors.hasOwnProperty(t) ? this.constructors[t] : void 0;
+            },
+            getScaleDefaults: function (t) {
+              return this.defaults.hasOwnProperty(t) ? ut.merge({}, [ot.scale, this.defaults[t]]) : {};
+            },
+            updateScaleDefaults: function (t, e) {
+              this.defaults.hasOwnProperty(t) && (this.defaults[t] = ut.extend(this.defaults[t], e));
+            },
+            addScalesToLayout: function (t) {
+              ut.each(t.scales, function (e) {
+                (e.fullWidth = e.options.fullWidth),
+                  (e.position = e.options.position),
+                  (e.weight = e.options.weight),
+                  xe.addBox(t, e);
+              });
+            },
+          },
+          Be = ut.valueOrDefault;
+        ot._set("global", {
+          tooltips: {
+            enabled: !0,
+            custom: null,
+            mode: "nearest",
+            position: "average",
+            intersect: !0,
+            backgroundColor: "rgba(0,0,0,0.8)",
+            titleFontStyle: "bold",
+            titleSpacing: 2,
+            titleMarginBottom: 6,
+            titleFontColor: "#fff",
+            titleAlign: "left",
+            bodySpacing: 2,
+            bodyFontColor: "#fff",
+            bodyAlign: "left",
+            footerFontStyle: "bold",
+            footerSpacing: 2,
+            footerMarginTop: 6,
+            footerFontColor: "#fff",
+            footerAlign: "left",
+            yPadding: 6,
+            xPadding: 6,
+            caretPadding: 2,
+            caretSize: 5,
+            cornerRadius: 6,
+            multiKeyBackground: "#fff",
+            displayColors: !0,
+            borderColor: "rgba(0,0,0,0)",
+            borderWidth: 0,
+            callbacks: {
+              beforeTitle: ut.noop,
+              title: function (t, e) {
+                var i = "",
+                  n = e.labels,
+                  a = n ? n.length : 0;
+                if (t.length > 0) {
+                  var r = t[0];
+                  r.label ? (i = r.label) : r.xLabel ? (i = r.xLabel) : a > 0 && r.index < a && (i = n[r.index]);
+                }
+                return i;
+              },
+              afterTitle: ut.noop,
+              beforeBody: ut.noop,
+              beforeLabel: ut.noop,
+              label: function (t, e) {
+                var i = e.datasets[t.datasetIndex].label || "";
+                return i && (i += ": "), ut.isNullOrUndef(t.value) ? (i += t.yLabel) : (i += t.value), i;
+              },
+              labelColor: function (t, e) {
+                var i = e.getDatasetMeta(t.datasetIndex).data[t.index]._view;
+                return { borderColor: i.borderColor, backgroundColor: i.backgroundColor };
+              },
+              labelTextColor: function () {
+                return this._options.bodyFontColor;
+              },
+              afterLabel: ut.noop,
+              afterBody: ut.noop,
+              beforeFooter: ut.noop,
+              footer: ut.noop,
+              afterFooter: ut.noop,
+            },
+          },
+        });
+        var je = {
+          average: function (t) {
+            if (!t.length) return !1;
+            var e,
+              i,
+              n = 0,
+              a = 0,
+              r = 0;
+            for (e = 0, i = t.length; e < i; ++e) {
+              var o = t[e];
+              if (o && o.hasValue()) {
+                var s = o.tooltipPosition();
+                (n += s.x), (a += s.y), ++r;
+              }
+            }
+            return { x: n / r, y: a / r };
+          },
+          nearest: function (t, e) {
+            var i,
+              n,
+              a,
+              r = e.x,
+              o = e.y,
+              s = Number.POSITIVE_INFINITY;
+            for (i = 0, n = t.length; i < n; ++i) {
+              var l = t[i];
+              if (l && l.hasValue()) {
+                var u = l.getCenterPoint(),
+                  d = ut.distanceBetweenPoints(e, u);
+                d < s && ((s = d), (a = l));
+              }
+            }
+            if (a) {
+              var h = a.tooltipPosition();
+              (r = h.x), (o = h.y);
+            }
+            return { x: r, y: o };
+          },
+        };
+        function Ue(t, e) {
+          return e && (ut.isArray(e) ? Array.prototype.push.apply(t, e) : t.push(e)), t;
+        }
+        function Ge(t) {
+          return ("string" == typeof t || t instanceof String) && t.indexOf("\n") > -1 ? t.split("\n") : t;
+        }
+        function qe(t) {
+          var e = ot.global;
+          return {
+            xPadding: t.xPadding,
+            yPadding: t.yPadding,
+            xAlign: t.xAlign,
+            yAlign: t.yAlign,
+            bodyFontColor: t.bodyFontColor,
+            _bodyFontFamily: Be(t.bodyFontFamily, e.defaultFontFamily),
+            _bodyFontStyle: Be(t.bodyFontStyle, e.defaultFontStyle),
+            _bodyAlign: t.bodyAlign,
+            bodyFontSize: Be(t.bodyFontSize, e.defaultFontSize),
+            bodySpacing: t.bodySpacing,
+            titleFontColor: t.titleFontColor,
+            _titleFontFamily: Be(t.titleFontFamily, e.defaultFontFamily),
+            _titleFontStyle: Be(t.titleFontStyle, e.defaultFontStyle),
+            titleFontSize: Be(t.titleFontSize, e.defaultFontSize),
+            _titleAlign: t.titleAlign,
+            titleSpacing: t.titleSpacing,
+            titleMarginBottom: t.titleMarginBottom,
+            footerFontColor: t.footerFontColor,
+            _footerFontFamily: Be(t.footerFontFamily, e.defaultFontFamily),
+            _footerFontStyle: Be(t.footerFontStyle, e.defaultFontStyle),
+            footerFontSize: Be(t.footerFontSize, e.defaultFontSize),
+            _footerAlign: t.footerAlign,
+            footerSpacing: t.footerSpacing,
+            footerMarginTop: t.footerMarginTop,
+            caretSize: t.caretSize,
+            cornerRadius: t.cornerRadius,
+            backgroundColor: t.backgroundColor,
+            opacity: 0,
+            legendColorBackground: t.multiKeyBackground,
+            displayColors: t.displayColors,
+            borderColor: t.borderColor,
+            borderWidth: t.borderWidth,
+          };
+        }
+        function Ze(t, e) {
+          return "center" === e ? t.x + t.width / 2 : "right" === e ? t.x + t.width - t.xPadding : t.x + t.xPadding;
+        }
+        function $e(t) {
+          return Ue([], Ge(t));
+        }
+        var Xe = gt.extend({
+            initialize: function () {
+              (this._model = qe(this._options)), (this._lastActive = []);
+            },
+            getTitle: function () {
+              var t = this._options.callbacks,
+                e = t.beforeTitle.apply(this, arguments),
+                i = t.title.apply(this, arguments),
+                n = t.afterTitle.apply(this, arguments),
+                a = [];
+              return (a = Ue(a, Ge(e))), (a = Ue(a, Ge(i))), (a = Ue(a, Ge(n)));
+            },
+            getBeforeBody: function () {
+              return $e(this._options.callbacks.beforeBody.apply(this, arguments));
+            },
+            getBody: function (t, e) {
+              var i = this,
+                n = i._options.callbacks,
+                a = [];
+              return (
+                ut.each(t, function (t) {
+                  var r = { before: [], lines: [], after: [] };
+                  Ue(r.before, Ge(n.beforeLabel.call(i, t, e))),
+                    Ue(r.lines, n.label.call(i, t, e)),
+                    Ue(r.after, Ge(n.afterLabel.call(i, t, e))),
+                    a.push(r);
+                }),
+                a
+              );
+            },
+            getAfterBody: function () {
+              return $e(this._options.callbacks.afterBody.apply(this, arguments));
+            },
+            getFooter: function () {
+              var t = this._options.callbacks,
+                e = t.beforeFooter.apply(this, arguments),
+                i = t.footer.apply(this, arguments),
+                n = t.afterFooter.apply(this, arguments),
+                a = [];
+              return (a = Ue(a, Ge(e))), (a = Ue(a, Ge(i))), (a = Ue(a, Ge(n)));
+            },
+            update: function (t) {
+              var e,
+                i,
+                n,
+                a,
+                r,
+                o,
+                s,
+                l,
+                u,
+                d,
+                h = this,
+                c = h._options,
+                f = h._model,
+                g = (h._model = qe(c)),
+                m = h._active,
+                p = h._data,
+                v = { xAlign: f.xAlign, yAlign: f.yAlign },
+                y = { x: f.x, y: f.y },
+                b = { width: f.width, height: f.height },
+                x = { x: f.caretX, y: f.caretY };
+              if (m.length) {
+                g.opacity = 1;
+                var _ = [],
+                  k = [];
+                x = je[c.position].call(h, m, h._eventPosition);
+                var w = [];
+                for (e = 0, i = m.length; e < i; ++e)
+                  w.push(
+                    ((n = m[e]),
+                    (a = void 0),
+                    (r = void 0),
+                    (o = void 0),
+                    (s = void 0),
+                    (l = void 0),
+                    (u = void 0),
+                    (d = void 0),
+                    (a = n._xScale),
+                    (r = n._yScale || n._scale),
+                    (o = n._index),
+                    (s = n._datasetIndex),
+                    (l = n._chart.getDatasetMeta(s).controller),
+                    (u = l._getIndexScale()),
+                    (d = l._getValueScale()),
+                    {
+                      xLabel: a ? a.getLabelForIndex(o, s) : "",
+                      yLabel: r ? r.getLabelForIndex(o, s) : "",
+                      label: u ? "" + u.getLabelForIndex(o, s) : "",
+                      value: d ? "" + d.getLabelForIndex(o, s) : "",
+                      index: o,
+                      datasetIndex: s,
+                      x: n._model.x,
+                      y: n._model.y,
+                    })
+                  );
+                c.filter &&
+                  (w = w.filter(function (t) {
+                    return c.filter(t, p);
+                  })),
+                  c.itemSort &&
+                    (w = w.sort(function (t, e) {
+                      return c.itemSort(t, e, p);
+                    })),
+                  ut.each(w, function (t) {
+                    _.push(c.callbacks.labelColor.call(h, t, h._chart)),
+                      k.push(c.callbacks.labelTextColor.call(h, t, h._chart));
+                  }),
+                  (g.title = h.getTitle(w, p)),
+                  (g.beforeBody = h.getBeforeBody(w, p)),
+                  (g.body = h.getBody(w, p)),
+                  (g.afterBody = h.getAfterBody(w, p)),
+                  (g.footer = h.getFooter(w, p)),
+                  (g.x = x.x),
+                  (g.y = x.y),
+                  (g.caretPadding = c.caretPadding),
+                  (g.labelColors = _),
+                  (g.labelTextColors = k),
+                  (g.dataPoints = w),
+                  (b = (function (t, e) {
+                    var i = t._chart.ctx,
+                      n = 2 * e.yPadding,
+                      a = 0,
+                      r = e.body,
+                      o = r.reduce(function (t, e) {
+                        return t + e.before.length + e.lines.length + e.after.length;
+                      }, 0);
+                    o += e.beforeBody.length + e.afterBody.length;
+                    var s = e.title.length,
+                      l = e.footer.length,
+                      u = e.titleFontSize,
+                      d = e.bodyFontSize,
+                      h = e.footerFontSize;
+                    (n += s * u),
+                      (n += s ? (s - 1) * e.titleSpacing : 0),
+                      (n += s ? e.titleMarginBottom : 0),
+                      (n += o * d),
+                      (n += o ? (o - 1) * e.bodySpacing : 0),
+                      (n += l ? e.footerMarginTop : 0),
+                      (n += l * h),
+                      (n += l ? (l - 1) * e.footerSpacing : 0);
+                    var c = 0,
+                      f = function (t) {
+                        a = Math.max(a, i.measureText(t).width + c);
+                      };
+                    return (
+                      (i.font = ut.fontString(u, e._titleFontStyle, e._titleFontFamily)),
+                      ut.each(e.title, f),
+                      (i.font = ut.fontString(d, e._bodyFontStyle, e._bodyFontFamily)),
+                      ut.each(e.beforeBody.concat(e.afterBody), f),
+                      (c = e.displayColors ? d + 2 : 0),
+                      ut.each(r, function (t) {
+                        ut.each(t.before, f), ut.each(t.lines, f), ut.each(t.after, f);
+                      }),
+                      (c = 0),
+                      (i.font = ut.fontString(h, e._footerFontStyle, e._footerFontFamily)),
+                      ut.each(e.footer, f),
+                      { width: (a += 2 * e.xPadding), height: n }
+                    );
+                  })(this, g)),
+                  (y = (function (t, e, i, n) {
+                    var a = t.x,
+                      r = t.y,
+                      o = t.caretSize,
+                      s = t.caretPadding,
+                      l = t.cornerRadius,
+                      u = i.xAlign,
+                      d = i.yAlign,
+                      h = o + s,
+                      c = l + s;
+                    return (
+                      "right" === u
+                        ? (a -= e.width)
+                        : "center" === u &&
+                          ((a -= e.width / 2) + e.width > n.width && (a = n.width - e.width), a < 0 && (a = 0)),
+                      "top" === d ? (r += h) : (r -= "bottom" === d ? e.height + h : e.height / 2),
+                      "center" === d
+                        ? "left" === u
+                          ? (a += h)
+                          : "right" === u && (a -= h)
+                        : "left" === u
+                          ? (a -= c)
+                          : "right" === u && (a += c),
+                      { x: a, y: r }
+                    );
+                  })(
+                    g,
+                    b,
+                    (v = (function (t, e) {
+                      var i,
+                        n,
+                        a,
+                        r,
+                        o,
+                        s = t._model,
+                        l = t._chart,
+                        u = t._chart.chartArea,
+                        d = "center",
+                        h = "center";
+                      s.y < e.height ? (h = "top") : s.y > l.height - e.height && (h = "bottom");
+                      var c = (u.left + u.right) / 2,
+                        f = (u.top + u.bottom) / 2;
+                      "center" === h
+                        ? ((i = function (t) {
+                            return t <= c;
+                          }),
+                          (n = function (t) {
+                            return t > c;
+                          }))
+                        : ((i = function (t) {
+                            return t <= e.width / 2;
+                          }),
+                          (n = function (t) {
+                            return t >= l.width - e.width / 2;
+                          })),
+                        (a = function (t) {
+                          return t + e.width + s.caretSize + s.caretPadding > l.width;
+                        }),
+                        (r = function (t) {
+                          return t - e.width - s.caretSize - s.caretPadding < 0;
+                        }),
+                        (o = function (t) {
+                          return t <= f ? "top" : "bottom";
+                        }),
+                        i(s.x)
+                          ? ((d = "left"), a(s.x) && ((d = "center"), (h = o(s.y))))
+                          : n(s.x) && ((d = "right"), r(s.x) && ((d = "center"), (h = o(s.y))));
+                      var g = t._options;
+                      return { xAlign: g.xAlign ? g.xAlign : d, yAlign: g.yAlign ? g.yAlign : h };
+                    })(this, b)),
+                    h._chart
+                  ));
+              } else g.opacity = 0;
+              return (
+                (g.xAlign = v.xAlign),
+                (g.yAlign = v.yAlign),
+                (g.x = y.x),
+                (g.y = y.y),
+                (g.width = b.width),
+                (g.height = b.height),
+                (g.caretX = x.x),
+                (g.caretY = x.y),
+                (h._model = g),
+                t && c.custom && c.custom.call(h, g),
+                h
+              );
+            },
+            drawCaret: function (t, e) {
+              var i = this._chart.ctx,
+                n = this._view,
+                a = this.getCaretPosition(t, e, n);
+              i.lineTo(a.x1, a.y1), i.lineTo(a.x2, a.y2), i.lineTo(a.x3, a.y3);
+            },
+            getCaretPosition: function (t, e, i) {
+              var n,
+                a,
+                r,
+                o,
+                s,
+                l,
+                u = i.caretSize,
+                d = i.cornerRadius,
+                h = i.xAlign,
+                c = i.yAlign,
+                f = t.x,
+                g = t.y,
+                m = e.width,
+                p = e.height;
+              if ("center" === c)
+                (s = g + p / 2),
+                  "left" === h
+                    ? ((a = (n = f) - u), (r = n), (o = s + u), (l = s - u))
+                    : ((a = (n = f + m) + u), (r = n), (o = s - u), (l = s + u));
+              else if (
+                ("left" === h
+                  ? ((n = (a = f + d + u) - u), (r = a + u))
+                  : "right" === h
+                    ? ((n = (a = f + m - d - u) - u), (r = a + u))
+                    : ((n = (a = i.caretX) - u), (r = a + u)),
+                "top" === c)
+              )
+                (s = (o = g) - u), (l = o);
+              else {
+                (s = (o = g + p) + u), (l = o);
+                var v = r;
+                (r = n), (n = v);
+              }
+              return { x1: n, x2: a, x3: r, y1: o, y2: s, y3: l };
+            },
+            drawTitle: function (t, e, i) {
+              var n = e.title;
+              if (n.length) {
+                (t.x = Ze(e, e._titleAlign)), (i.textAlign = e._titleAlign), (i.textBaseline = "top");
+                var a,
+                  r,
+                  o = e.titleFontSize,
+                  s = e.titleSpacing;
+                for (
+                  i.fillStyle = e.titleFontColor,
+                    i.font = ut.fontString(o, e._titleFontStyle, e._titleFontFamily),
+                    a = 0,
+                    r = n.length;
+                  a < r;
+                  ++a
+                )
+                  i.fillText(n[a], t.x, t.y), (t.y += o + s), a + 1 === n.length && (t.y += e.titleMarginBottom - s);
+              }
+            },
+            drawBody: function (t, e, i) {
+              var n,
+                a = e.bodyFontSize,
+                r = e.bodySpacing,
+                o = e._bodyAlign,
+                s = e.body,
+                l = e.displayColors,
+                u = e.labelColors,
+                d = 0,
+                h = l ? Ze(e, "left") : 0;
+              (i.textAlign = o),
+                (i.textBaseline = "top"),
+                (i.font = ut.fontString(a, e._bodyFontStyle, e._bodyFontFamily)),
+                (t.x = Ze(e, o));
+              var c = function (e) {
+                i.fillText(e, t.x + d, t.y), (t.y += a + r);
+              };
+              (i.fillStyle = e.bodyFontColor),
+                ut.each(e.beforeBody, c),
+                (d = l && "right" !== o ? ("center" === o ? a / 2 + 1 : a + 2) : 0),
+                ut.each(s, function (r, o) {
+                  (n = e.labelTextColors[o]),
+                    (i.fillStyle = n),
+                    ut.each(r.before, c),
+                    ut.each(r.lines, function (r) {
+                      l &&
+                        ((i.fillStyle = e.legendColorBackground),
+                        i.fillRect(h, t.y, a, a),
+                        (i.lineWidth = 1),
+                        (i.strokeStyle = u[o].borderColor),
+                        i.strokeRect(h, t.y, a, a),
+                        (i.fillStyle = u[o].backgroundColor),
+                        i.fillRect(h + 1, t.y + 1, a - 2, a - 2),
+                        (i.fillStyle = n)),
+                        c(r);
+                    }),
+                    ut.each(r.after, c);
+                }),
+                (d = 0),
+                ut.each(e.afterBody, c),
+                (t.y -= r);
+            },
+            drawFooter: function (t, e, i) {
+              var n = e.footer;
+              n.length &&
+                ((t.x = Ze(e, e._footerAlign)),
+                (t.y += e.footerMarginTop),
+                (i.textAlign = e._footerAlign),
+                (i.textBaseline = "top"),
+                (i.fillStyle = e.footerFontColor),
+                (i.font = ut.fontString(e.footerFontSize, e._footerFontStyle, e._footerFontFamily)),
+                ut.each(n, function (n) {
+                  i.fillText(n, t.x, t.y), (t.y += e.footerFontSize + e.footerSpacing);
+                }));
+            },
+            drawBackground: function (t, e, i, n) {
+              (i.fillStyle = e.backgroundColor), (i.strokeStyle = e.borderColor), (i.lineWidth = e.borderWidth);
+              var a = e.xAlign,
+                r = e.yAlign,
+                o = t.x,
+                s = t.y,
+                l = n.width,
+                u = n.height,
+                d = e.cornerRadius;
+              i.beginPath(),
+                i.moveTo(o + d, s),
+                "top" === r && this.drawCaret(t, n),
+                i.lineTo(o + l - d, s),
+                i.quadraticCurveTo(o + l, s, o + l, s + d),
+                "center" === r && "right" === a && this.drawCaret(t, n),
+                i.lineTo(o + l, s + u - d),
+                i.quadraticCurveTo(o + l, s + u, o + l - d, s + u),
+                "bottom" === r && this.drawCaret(t, n),
+                i.lineTo(o + d, s + u),
+                i.quadraticCurveTo(o, s + u, o, s + u - d),
+                "center" === r && "left" === a && this.drawCaret(t, n),
+                i.lineTo(o, s + d),
+                i.quadraticCurveTo(o, s, o + d, s),
+                i.closePath(),
+                i.fill(),
+                e.borderWidth > 0 && i.stroke();
+            },
+            draw: function () {
+              var t = this._chart.ctx,
+                e = this._view;
+              if (0 !== e.opacity) {
+                var i = { width: e.width, height: e.height },
+                  n = { x: e.x, y: e.y },
+                  a = Math.abs(e.opacity < 0.001) ? 0 : e.opacity,
+                  r = e.title.length || e.beforeBody.length || e.body.length || e.afterBody.length || e.footer.length;
+                this._options.enabled &&
+                  r &&
+                  (t.save(),
+                  (t.globalAlpha = a),
+                  this.drawBackground(n, e, t, i),
+                  (n.y += e.yPadding),
+                  this.drawTitle(n, e, t),
+                  this.drawBody(n, e, t),
+                  this.drawFooter(n, e, t),
+                  t.restore());
+              }
+            },
+            handleEvent: function (t) {
+              var e,
+                i = this,
+                n = i._options;
+              return (
+                (i._lastActive = i._lastActive || []),
+                "mouseout" === t.type
+                  ? (i._active = [])
+                  : (i._active = i._chart.getElementsAtEventForMode(t, n.mode, n)),
+                (e = !ut.arrayEquals(i._active, i._lastActive)) &&
+                  ((i._lastActive = i._active),
+                  (n.enabled || n.custom) && ((i._eventPosition = { x: t.x, y: t.y }), i.update(!0), i.pivot())),
+                e
+              );
+            },
+          }),
+          Ke = je,
+          Je = Xe;
+        Je.positioners = Ke;
+        var Qe = ut.valueOrDefault;
+        function ti() {
+          return ut.merge({}, [].slice.call(arguments), {
+            merger: function (t, e, i, n) {
+              if ("xAxes" === t || "yAxes" === t) {
+                var a,
+                  r,
+                  o,
+                  s = i[t].length;
+                for (e[t] || (e[t] = []), a = 0; a < s; ++a)
+                  (o = i[t][a]),
+                    (r = Qe(o.type, "xAxes" === t ? "category" : "linear")),
+                    a >= e[t].length && e[t].push({}),
+                    !e[t][a].type || (o.type && o.type !== e[t][a].type)
+                      ? ut.merge(e[t][a], [Ee.getScaleDefaults(r), o])
+                      : ut.merge(e[t][a], o);
+              } else ut._merger(t, e, i, n);
+            },
+          });
+        }
+        function ei() {
+          return ut.merge({}, [].slice.call(arguments), {
+            merger: function (t, e, i, n) {
+              var a = e[t] || {},
+                r = i[t];
+              "scales" === t
+                ? (e[t] = ti(a, r))
+                : "scale" === t
+                  ? (e[t] = ut.merge(a, [Ee.getScaleDefaults(r.type), r]))
+                  : ut._merger(t, e, i, n);
+            },
+          });
+        }
+        function ii(t) {
+          return "top" === t || "bottom" === t;
+        }
+        ot._set("global", {
+          elements: {},
+          events: ["mousemove", "mouseout", "click", "touchstart", "touchmove"],
+          hover: { onHover: null, mode: "nearest", intersect: !0, animationDuration: 400 },
+          onClick: null,
+          maintainAspectRatio: !0,
+          responsive: !0,
+          responsiveAnimationDuration: 0,
+        });
+        var ni = function (t, e) {
+          return this.construct(t, e), this;
+        };
+        ut.extend(ni.prototype, {
+          construct: function (t, e) {
+            var i = this;
+            e = (function (t) {
+              var e = ((t = t || {}).data = t.data || {});
+              return (
+                (e.datasets = e.datasets || []),
+                (e.labels = e.labels || []),
+                (t.options = ei(ot.global, ot[t.type], t.options || {})),
+                t
+              );
+            })(e);
+            var n = Ve.acquireContext(t, e),
+              a = n && n.canvas,
+              r = a && a.height,
+              o = a && a.width;
+            (i.id = ut.uid()),
+              (i.ctx = n),
+              (i.canvas = a),
+              (i.config = e),
+              (i.width = o),
+              (i.height = r),
+              (i.aspectRatio = r ? o / r : null),
+              (i.options = e.options),
+              (i._bufferedRender = !1),
+              (i.chart = i),
+              (i.controller = i),
+              (ni.instances[i.id] = i),
+              Object.defineProperty(i, "data", {
+                get: function () {
+                  return i.config.data;
+                },
+                set: function (t) {
+                  i.config.data = t;
+                },
+              }),
+              n && a
+                ? (i.initialize(), i.update())
+                : console.error("Failed to create chart: can't acquire context from the given item");
+          },
+          initialize: function () {
+            var t = this;
+            return (
+              He.notify(t, "beforeInit"),
+              ut.retinaScale(t, t.options.devicePixelRatio),
+              t.bindEvents(),
+              t.options.responsive && t.resize(!0),
+              t.ensureScalesHaveIDs(),
+              t.buildOrUpdateScales(),
+              t.initToolTip(),
+              He.notify(t, "afterInit"),
+              t
+            );
+          },
+          clear: function () {
+            return ut.canvas.clear(this), this;
+          },
+          stop: function () {
+            return vt.cancelAnimation(this), this;
+          },
+          resize: function (t) {
+            var e = this,
+              i = e.options,
+              n = e.canvas,
+              a = (i.maintainAspectRatio && e.aspectRatio) || null,
+              r = Math.max(0, Math.floor(ut.getMaximumWidth(n))),
+              o = Math.max(0, Math.floor(a ? r / a : ut.getMaximumHeight(n)));
+            if (
+              (e.width !== r || e.height !== o) &&
+              ((n.width = e.width = r),
+              (n.height = e.height = o),
+              (n.style.width = r + "px"),
+              (n.style.height = o + "px"),
+              ut.retinaScale(e, i.devicePixelRatio),
+              !t)
+            ) {
+              var s = { width: r, height: o };
+              He.notify(e, "resize", [s]),
+                i.onResize && i.onResize(e, s),
+                e.stop(),
+                e.update({ duration: i.responsiveAnimationDuration });
+            }
+          },
+          ensureScalesHaveIDs: function () {
+            var t = this.options,
+              e = t.scales || {},
+              i = t.scale;
+            ut.each(e.xAxes, function (t, e) {
+              t.id = t.id || "x-axis-" + e;
+            }),
+              ut.each(e.yAxes, function (t, e) {
+                t.id = t.id || "y-axis-" + e;
+              }),
+              i && (i.id = i.id || "scale");
+          },
+          buildOrUpdateScales: function () {
+            var t = this,
+              e = t.options,
+              i = t.scales || {},
+              n = [],
+              a = Object.keys(i).reduce(function (t, e) {
+                return (t[e] = !1), t;
+              }, {});
+            e.scales &&
+              (n = n.concat(
+                (e.scales.xAxes || []).map(function (t) {
+                  return { options: t, dtype: "category", dposition: "bottom" };
+                }),
+                (e.scales.yAxes || []).map(function (t) {
+                  return { options: t, dtype: "linear", dposition: "left" };
+                })
+              )),
+              e.scale && n.push({ options: e.scale, dtype: "radialLinear", isDefault: !0, dposition: "chartArea" }),
+              ut.each(n, function (e) {
+                var n = e.options,
+                  r = n.id,
+                  o = Qe(n.type, e.dtype);
+                ii(n.position) !== ii(e.dposition) && (n.position = e.dposition), (a[r] = !0);
+                var s = null;
+                if (r in i && i[r].type === o) ((s = i[r]).options = n), (s.ctx = t.ctx), (s.chart = t);
+                else {
+                  var l = Ee.getScaleConstructor(o);
+                  if (!l) return;
+                  (s = new l({ id: r, type: o, options: n, ctx: t.ctx, chart: t })), (i[s.id] = s);
+                }
+                s.mergeTicksOptions(), e.isDefault && (t.scale = s);
+              }),
+              ut.each(a, function (t, e) {
+                t || delete i[e];
+              }),
+              (t.scales = i),
+              Ee.addScalesToLayout(this);
+          },
+          buildOrUpdateControllers: function () {
+            var t = this,
+              e = [];
+            return (
+              ut.each(
+                t.data.datasets,
+                function (i, n) {
+                  var a = t.getDatasetMeta(n),
+                    r = i.type || t.config.type;
+                  if (
+                    (a.type && a.type !== r && (t.destroyDatasetMeta(n), (a = t.getDatasetMeta(n))),
+                    (a.type = r),
+                    a.controller)
+                  )
+                    a.controller.updateIndex(n), a.controller.linkScales();
+                  else {
+                    var o = ue[a.type];
+                    if (void 0 === o) throw new Error('"' + a.type + '" is not a chart type.');
+                    (a.controller = new o(t, n)), e.push(a.controller);
+                  }
+                },
+                t
+              ),
+              e
+            );
+          },
+          resetElements: function () {
+            var t = this;
+            ut.each(
+              t.data.datasets,
+              function (e, i) {
+                t.getDatasetMeta(i).controller.reset();
+              },
+              t
+            );
+          },
+          reset: function () {
+            this.resetElements(), this.tooltip.initialize();
+          },
+          update: function (t) {
+            var e,
+              i,
+              n = this;
+            if (
+              ((t && "object" == typeof t) || (t = { duration: t, lazy: arguments[1] }),
+              (i = (e = n).options),
+              ut.each(e.scales, function (t) {
+                xe.removeBox(e, t);
+              }),
+              (i = ei(ot.global, ot[e.config.type], i)),
+              (e.options = e.config.options = i),
+              e.ensureScalesHaveIDs(),
+              e.buildOrUpdateScales(),
+              (e.tooltip._options = i.tooltips),
+              e.tooltip.initialize(),
+              He._invalidate(n),
+              !1 !== He.notify(n, "beforeUpdate"))
+            ) {
+              n.tooltip._data = n.data;
+              var a = n.buildOrUpdateControllers();
+              ut.each(
+                n.data.datasets,
+                function (t, e) {
+                  n.getDatasetMeta(e).controller.buildOrUpdateElements();
+                },
+                n
+              ),
+                n.updateLayout(),
+                n.options.animation &&
+                  n.options.animation.duration &&
+                  ut.each(a, function (t) {
+                    t.reset();
+                  }),
+                n.updateDatasets(),
+                n.tooltip.initialize(),
+                (n.lastActive = []),
+                He.notify(n, "afterUpdate"),
+                n._bufferedRender
+                  ? (n._bufferedRequest = { duration: t.duration, easing: t.easing, lazy: t.lazy })
+                  : n.render(t);
+            }
+          },
+          updateLayout: function () {
+            !1 !== He.notify(this, "beforeLayout") &&
+              (xe.update(this, this.width, this.height),
+              He.notify(this, "afterScaleUpdate"),
+              He.notify(this, "afterLayout"));
+          },
+          updateDatasets: function () {
+            if (!1 !== He.notify(this, "beforeDatasetsUpdate")) {
+              for (var t = 0, e = this.data.datasets.length; t < e; ++t) this.updateDataset(t);
+              He.notify(this, "afterDatasetsUpdate");
+            }
+          },
+          updateDataset: function (t) {
+            var e = this.getDatasetMeta(t),
+              i = { meta: e, index: t };
+            !1 !== He.notify(this, "beforeDatasetUpdate", [i]) &&
+              (e.controller.update(), He.notify(this, "afterDatasetUpdate", [i]));
+          },
+          render: function (t) {
+            var e = this;
+            (t && "object" == typeof t) || (t = { duration: t, lazy: arguments[1] });
+            var i = e.options.animation,
+              n = Qe(t.duration, i && i.duration),
+              a = t.lazy;
+            if (!1 !== He.notify(e, "beforeRender")) {
+              var r = function (t) {
+                He.notify(e, "afterRender"), ut.callback(i && i.onComplete, [t], e);
+              };
+              if (i && n) {
+                var o = new pt({
+                  numSteps: n / 16.66,
+                  easing: t.easing || i.easing,
+                  render: function (t, e) {
+                    var i = ut.easing.effects[e.easing],
+                      n = e.currentStep,
+                      a = n / e.numSteps;
+                    t.draw(i(a), a, n);
+                  },
+                  onAnimationProgress: i.onProgress,
+                  onAnimationComplete: r,
+                });
+                vt.addAnimation(e, o, n, a);
+              } else e.draw(), r(new pt({ numSteps: 0, chart: e }));
+              return e;
+            }
+          },
+          draw: function (t) {
+            var e = this;
+            e.clear(),
+              ut.isNullOrUndef(t) && (t = 1),
+              e.transition(t),
+              e.width <= 0 ||
+                e.height <= 0 ||
+                (!1 !== He.notify(e, "beforeDraw", [t]) &&
+                  (ut.each(
+                    e.boxes,
+                    function (t) {
+                      t.draw(e.chartArea);
+                    },
+                    e
+                  ),
+                  e.drawDatasets(t),
+                  e._drawTooltip(t),
+                  He.notify(e, "afterDraw", [t])));
+          },
+          transition: function (t) {
+            for (var e = 0, i = (this.data.datasets || []).length; e < i; ++e)
+              this.isDatasetVisible(e) && this.getDatasetMeta(e).controller.transition(t);
+            this.tooltip.transition(t);
+          },
+          drawDatasets: function (t) {
+            var e = this;
+            if (!1 !== He.notify(e, "beforeDatasetsDraw", [t])) {
+              for (var i = (e.data.datasets || []).length - 1; i >= 0; --i)
+                e.isDatasetVisible(i) && e.drawDataset(i, t);
+              He.notify(e, "afterDatasetsDraw", [t]);
+            }
+          },
+          drawDataset: function (t, e) {
+            var i = this.getDatasetMeta(t),
+              n = { meta: i, index: t, easingValue: e };
+            !1 !== He.notify(this, "beforeDatasetDraw", [n]) &&
+              (i.controller.draw(e), He.notify(this, "afterDatasetDraw", [n]));
+          },
+          _drawTooltip: function (t) {
+            var e = this.tooltip,
+              i = { tooltip: e, easingValue: t };
+            !1 !== He.notify(this, "beforeTooltipDraw", [i]) && (e.draw(), He.notify(this, "afterTooltipDraw", [i]));
+          },
+          getElementAtEvent: function (t) {
+            return pe.modes.single(this, t);
+          },
+          getElementsAtEvent: function (t) {
+            return pe.modes.label(this, t, { intersect: !0 });
+          },
+          getElementsAtXAxis: function (t) {
+            return pe.modes["x-axis"](this, t, { intersect: !0 });
+          },
+          getElementsAtEventForMode: function (t, e, i) {
+            var n = pe.modes[e];
+            return "function" == typeof n ? n(this, t, i) : [];
+          },
+          getDatasetAtEvent: function (t) {
+            return pe.modes.dataset(this, t, { intersect: !0 });
+          },
+          getDatasetMeta: function (t) {
+            var e = this.data.datasets[t];
+            e._meta || (e._meta = {});
+            var i = e._meta[this.id];
+            return (
+              i ||
+                (i = e._meta[this.id] =
+                  {
+                    type: null,
+                    data: [],
+                    dataset: null,
+                    controller: null,
+                    hidden: null,
+                    xAxisID: null,
+                    yAxisID: null,
+                  }),
+              i
+            );
+          },
+          getVisibleDatasetCount: function () {
+            for (var t = 0, e = 0, i = this.data.datasets.length; e < i; ++e) this.isDatasetVisible(e) && t++;
+            return t;
+          },
+          isDatasetVisible: function (t) {
+            var e = this.getDatasetMeta(t);
+            return "boolean" == typeof e.hidden ? !e.hidden : !this.data.datasets[t].hidden;
+          },
+          generateLegend: function () {
+            return this.options.legendCallback(this);
+          },
+          destroyDatasetMeta: function (t) {
+            var e = this.id,
+              i = this.data.datasets[t],
+              n = i._meta && i._meta[e];
+            n && (n.controller.destroy(), delete i._meta[e]);
+          },
+          destroy: function () {
+            var t,
+              e,
+              i = this,
+              n = i.canvas;
+            for (i.stop(), t = 0, e = i.data.datasets.length; t < e; ++t) i.destroyDatasetMeta(t);
+            n && (i.unbindEvents(), ut.canvas.clear(i), Ve.releaseContext(i.ctx), (i.canvas = null), (i.ctx = null)),
+              He.notify(i, "destroy"),
+              delete ni.instances[i.id];
+          },
+          toBase64Image: function () {
+            return this.canvas.toDataURL.apply(this.canvas, arguments);
+          },
+          initToolTip: function () {
+            var t = this;
+            t.tooltip = new Je({ _chart: t, _chartInstance: t, _data: t.data, _options: t.options.tooltips }, t);
+          },
+          bindEvents: function () {
+            var t = this,
+              e = (t._listeners = {}),
+              i = function () {
+                t.eventHandler.apply(t, arguments);
+              };
+            ut.each(t.options.events, function (n) {
+              Ve.addEventListener(t, n, i), (e[n] = i);
+            }),
+              t.options.responsive &&
+                ((i = function () {
+                  t.resize();
+                }),
+                Ve.addEventListener(t, "resize", i),
+                (e.resize = i));
+          },
+          unbindEvents: function () {
+            var t = this,
+              e = t._listeners;
+            e &&
+              (delete t._listeners,
+              ut.each(e, function (e, i) {
+                Ve.removeEventListener(t, i, e);
+              }));
+          },
+          updateHoverStyle: function (t, e, i) {
+            var n,
+              a,
+              r,
+              o = i ? "setHoverStyle" : "removeHoverStyle";
+            for (a = 0, r = t.length; a < r; ++a) (n = t[a]) && this.getDatasetMeta(n._datasetIndex).controller[o](n);
+          },
+          eventHandler: function (t) {
+            var e = this,
+              i = e.tooltip;
+            if (!1 !== He.notify(e, "beforeEvent", [t])) {
+              (e._bufferedRender = !0), (e._bufferedRequest = null);
+              var n = e.handleEvent(t);
+              i && (n = i._start ? i.handleEvent(t) : n | i.handleEvent(t)), He.notify(e, "afterEvent", [t]);
+              var a = e._bufferedRequest;
+              return (
+                a
+                  ? e.render(a)
+                  : n &&
+                    !e.animating &&
+                    (e.stop(), e.render({ duration: e.options.hover.animationDuration, lazy: !0 })),
+                (e._bufferedRender = !1),
+                (e._bufferedRequest = null),
+                e
+              );
+            }
+          },
+          handleEvent: function (t) {
+            var e,
+              i = this,
+              n = i.options || {},
+              a = n.hover;
+            return (
+              (i.lastActive = i.lastActive || []),
+              "mouseout" === t.type ? (i.active = []) : (i.active = i.getElementsAtEventForMode(t, a.mode, a)),
+              ut.callback(n.onHover || n.hover.onHover, [t.native, i.active], i),
+              ("mouseup" !== t.type && "click" !== t.type) || (n.onClick && n.onClick.call(i, t.native, i.active)),
+              i.lastActive.length && i.updateHoverStyle(i.lastActive, a.mode, !1),
+              i.active.length && a.mode && i.updateHoverStyle(i.active, a.mode, !0),
+              (e = !ut.arrayEquals(i.active, i.lastActive)),
+              (i.lastActive = i.active),
+              e
+            );
+          },
+        }),
+          (ni.instances = {});
+        var ai = ni;
+        (ni.Controller = ni), (ni.types = {}), (ut.configMerge = ei), (ut.scaleMerge = ti);
+        function ri() {
+          throw new Error(
+            "This method is not implemented: either no adapter can be found or an incomplete integration was provided."
+          );
+        }
+        function oi(t) {
+          this.options = t || {};
+        }
+        ut.extend(oi.prototype, {
+          formats: ri,
+          parse: ri,
+          format: ri,
+          add: ri,
+          diff: ri,
+          startOf: ri,
+          endOf: ri,
+          _create: function (t) {
+            return t;
+          },
+        }),
+          (oi.override = function (t) {
+            ut.extend(oi.prototype, t);
+          });
+        var si = { _date: oi },
+          li = {
+            formatters: {
+              values: function (t) {
+                return ut.isArray(t) ? t : "" + t;
+              },
+              linear: function (t, e, i) {
+                var n = i.length > 3 ? i[2] - i[1] : i[1] - i[0];
+                Math.abs(n) > 1 && t !== Math.floor(t) && (n = t - Math.floor(t));
+                var a = ut.log10(Math.abs(n)),
+                  r = "";
+                if (0 !== t)
+                  if (Math.max(Math.abs(i[0]), Math.abs(i[i.length - 1])) < 1e-4) {
+                    var o = ut.log10(Math.abs(t));
+                    r = t.toExponential(Math.floor(o) - Math.floor(a));
+                  } else {
+                    var s = -1 * Math.floor(a);
+                    (s = Math.max(Math.min(s, 20), 0)), (r = t.toFixed(s));
+                  }
+                else r = "0";
+                return r;
+              },
+              logarithmic: function (t, e, i) {
+                var n = t / Math.pow(10, Math.floor(ut.log10(t)));
+                return 0 === t
+                  ? "0"
+                  : 1 === n || 2 === n || 5 === n || 0 === e || e === i.length - 1
+                    ? t.toExponential()
+                    : "";
+              },
+            },
+          },
+          ui = ut.valueOrDefault,
+          di = ut.valueAtIndexOrDefault;
+        function hi(t) {
+          var e,
+            i,
+            n = [];
+          for (e = 0, i = t.length; e < i; ++e) n.push(t[e].label);
+          return n;
+        }
+        function ci(t, e, i) {
+          return ut.isArray(e) ? ut.longestText(t, i, e) : t.measureText(e).width;
+        }
+        ot._set("scale", {
+          display: !0,
+          position: "left",
+          offset: !1,
+          gridLines: {
+            display: !0,
+            color: "rgba(0, 0, 0, 0.1)",
+            lineWidth: 1,
+            drawBorder: !0,
+            drawOnChartArea: !0,
+            drawTicks: !0,
+            tickMarkLength: 10,
+            zeroLineWidth: 1,
+            zeroLineColor: "rgba(0,0,0,0.25)",
+            zeroLineBorderDash: [],
+            zeroLineBorderDashOffset: 0,
+            offsetGridLines: !1,
+            borderDash: [],
+            borderDashOffset: 0,
+          },
+          scaleLabel: { display: !1, labelString: "", padding: { top: 4, bottom: 4 } },
+          ticks: {
+            beginAtZero: !1,
+            minRotation: 0,
+            maxRotation: 50,
+            mirror: !1,
+            padding: 0,
+            reverse: !1,
+            display: !0,
+            autoSkip: !0,
+            autoSkipPadding: 0,
+            labelOffset: 0,
+            callback: li.formatters.values,
+            minor: {},
+            major: {},
+          },
+        });
+        var fi = gt.extend({
+            getPadding: function () {
+              return {
+                left: this.paddingLeft || 0,
+                top: this.paddingTop || 0,
+                right: this.paddingRight || 0,
+                bottom: this.paddingBottom || 0,
+              };
+            },
+            getTicks: function () {
+              return this._ticks;
+            },
+            mergeTicksOptions: function () {
+              var t = this.options.ticks;
+              for (var e in (!1 === t.minor && (t.minor = { display: !1 }),
+              !1 === t.major && (t.major = { display: !1 }),
+              t))
+                "major" !== e &&
+                  "minor" !== e &&
+                  (void 0 === t.minor[e] && (t.minor[e] = t[e]), void 0 === t.major[e] && (t.major[e] = t[e]));
+            },
+            beforeUpdate: function () {
+              ut.callback(this.options.beforeUpdate, [this]);
+            },
+            update: function (t, e, i) {
+              var n,
+                a,
+                r,
+                o,
+                s,
+                l,
+                u = this;
+              for (
+                u.beforeUpdate(),
+                  u.maxWidth = t,
+                  u.maxHeight = e,
+                  u.margins = ut.extend({ left: 0, right: 0, top: 0, bottom: 0 }, i),
+                  u._maxLabelLines = 0,
+                  u.longestLabelWidth = 0,
+                  u.longestTextCache = u.longestTextCache || {},
+                  u.beforeSetDimensions(),
+                  u.setDimensions(),
+                  u.afterSetDimensions(),
+                  u.beforeDataLimits(),
+                  u.determineDataLimits(),
+                  u.afterDataLimits(),
+                  u.beforeBuildTicks(),
+                  s = u.buildTicks() || [],
+                  s = u.afterBuildTicks(s) || s,
+                  u.beforeTickToLabelConversion(),
+                  r = u.convertTicksToLabels(s) || u.ticks,
+                  u.afterTickToLabelConversion(),
+                  u.ticks = r,
+                  n = 0,
+                  a = r.length;
+                n < a;
+                ++n
+              )
+                (o = r[n]), (l = s[n]) ? (l.label = o) : s.push((l = { label: o, major: !1 }));
+              return (
+                (u._ticks = s),
+                u.beforeCalculateTickRotation(),
+                u.calculateTickRotation(),
+                u.afterCalculateTickRotation(),
+                u.beforeFit(),
+                u.fit(),
+                u.afterFit(),
+                u.afterUpdate(),
+                u.minSize
+              );
+            },
+            afterUpdate: function () {
+              ut.callback(this.options.afterUpdate, [this]);
+            },
+            beforeSetDimensions: function () {
+              ut.callback(this.options.beforeSetDimensions, [this]);
+            },
+            setDimensions: function () {
+              var t = this;
+              t.isHorizontal()
+                ? ((t.width = t.maxWidth), (t.left = 0), (t.right = t.width))
+                : ((t.height = t.maxHeight), (t.top = 0), (t.bottom = t.height)),
+                (t.paddingLeft = 0),
+                (t.paddingTop = 0),
+                (t.paddingRight = 0),
+                (t.paddingBottom = 0);
+            },
+            afterSetDimensions: function () {
+              ut.callback(this.options.afterSetDimensions, [this]);
+            },
+            beforeDataLimits: function () {
+              ut.callback(this.options.beforeDataLimits, [this]);
+            },
+            determineDataLimits: ut.noop,
+            afterDataLimits: function () {
+              ut.callback(this.options.afterDataLimits, [this]);
+            },
+            beforeBuildTicks: function () {
+              ut.callback(this.options.beforeBuildTicks, [this]);
+            },
+            buildTicks: ut.noop,
+            afterBuildTicks: function (t) {
+              var e = this;
+              return ut.isArray(t) && t.length
+                ? ut.callback(e.options.afterBuildTicks, [e, t])
+                : ((e.ticks = ut.callback(e.options.afterBuildTicks, [e, e.ticks]) || e.ticks), t);
+            },
+            beforeTickToLabelConversion: function () {
+              ut.callback(this.options.beforeTickToLabelConversion, [this]);
+            },
+            convertTicksToLabels: function () {
+              var t = this.options.ticks;
+              this.ticks = this.ticks.map(t.userCallback || t.callback, this);
+            },
+            afterTickToLabelConversion: function () {
+              ut.callback(this.options.afterTickToLabelConversion, [this]);
+            },
+            beforeCalculateTickRotation: function () {
+              ut.callback(this.options.beforeCalculateTickRotation, [this]);
+            },
+            calculateTickRotation: function () {
+              var t = this,
+                e = t.ctx,
+                i = t.options.ticks,
+                n = hi(t._ticks),
+                a = ut.options._parseFont(i);
+              e.font = a.string;
+              var r = i.minRotation || 0;
+              if (n.length && t.options.display && t.isHorizontal())
+                for (
+                  var o,
+                    s = ut.longestText(e, a.string, n, t.longestTextCache),
+                    l = s,
+                    u = t.getPixelForTick(1) - t.getPixelForTick(0) - 6;
+                  l > u && r < i.maxRotation;
+
+                ) {
+                  var d = ut.toRadians(r);
+                  if (((o = Math.cos(d)), Math.sin(d) * s > t.maxHeight)) {
+                    r--;
+                    break;
+                  }
+                  r++, (l = o * s);
+                }
+              t.labelRotation = r;
+            },
+            afterCalculateTickRotation: function () {
+              ut.callback(this.options.afterCalculateTickRotation, [this]);
+            },
+            beforeFit: function () {
+              ut.callback(this.options.beforeFit, [this]);
+            },
+            fit: function () {
+              var t = this,
+                e = (t.minSize = { width: 0, height: 0 }),
+                i = hi(t._ticks),
+                n = t.options,
+                a = n.ticks,
+                r = n.scaleLabel,
+                o = n.gridLines,
+                s = t._isVisible(),
+                l = n.position,
+                u = t.isHorizontal(),
+                d = ut.options._parseFont,
+                h = d(a),
+                c = n.gridLines.tickMarkLength;
+              if (
+                ((e.width = u
+                  ? t.isFullWidth()
+                    ? t.maxWidth - t.margins.left - t.margins.right
+                    : t.maxWidth
+                  : s && o.drawTicks
+                    ? c
+                    : 0),
+                (e.height = u ? (s && o.drawTicks ? c : 0) : t.maxHeight),
+                r.display && s)
+              ) {
+                var f = d(r),
+                  g = ut.options.toPadding(r.padding),
+                  m = f.lineHeight + g.height;
+                u ? (e.height += m) : (e.width += m);
+              }
+              if (a.display && s) {
+                var p = ut.longestText(t.ctx, h.string, i, t.longestTextCache),
+                  v = ut.numberOfLabelLines(i),
+                  y = 0.5 * h.size,
+                  b = t.options.ticks.padding;
+                if (((t._maxLabelLines = v), (t.longestLabelWidth = p), u)) {
+                  var x = ut.toRadians(t.labelRotation),
+                    _ = Math.cos(x),
+                    k = Math.sin(x) * p + h.lineHeight * v + y;
+                  (e.height = Math.min(t.maxHeight, e.height + k + b)), (t.ctx.font = h.string);
+                  var w,
+                    M,
+                    S = ci(t.ctx, i[0], h.string),
+                    D = ci(t.ctx, i[i.length - 1], h.string),
+                    C = t.getPixelForTick(0) - t.left,
+                    P = t.right - t.getPixelForTick(i.length - 1);
+                  0 !== t.labelRotation
+                    ? ((w = "bottom" === l ? _ * S : _ * y), (M = "bottom" === l ? _ * y : _ * D))
+                    : ((w = S / 2), (M = D / 2)),
+                    (t.paddingLeft = Math.max(w - C, 0) + 3),
+                    (t.paddingRight = Math.max(M - P, 0) + 3);
+                } else
+                  a.mirror ? (p = 0) : (p += b + y),
+                    (e.width = Math.min(t.maxWidth, e.width + p)),
+                    (t.paddingTop = h.size / 2),
+                    (t.paddingBottom = h.size / 2);
+              }
+              t.handleMargins(), (t.width = e.width), (t.height = e.height);
+            },
+            handleMargins: function () {
+              var t = this;
+              t.margins &&
+                ((t.paddingLeft = Math.max(t.paddingLeft - t.margins.left, 0)),
+                (t.paddingTop = Math.max(t.paddingTop - t.margins.top, 0)),
+                (t.paddingRight = Math.max(t.paddingRight - t.margins.right, 0)),
+                (t.paddingBottom = Math.max(t.paddingBottom - t.margins.bottom, 0)));
+            },
+            afterFit: function () {
+              ut.callback(this.options.afterFit, [this]);
+            },
+            isHorizontal: function () {
+              return "top" === this.options.position || "bottom" === this.options.position;
+            },
+            isFullWidth: function () {
+              return this.options.fullWidth;
+            },
+            getRightValue: function (t) {
+              if (ut.isNullOrUndef(t)) return NaN;
+              if (("number" == typeof t || t instanceof Number) && !isFinite(t)) return NaN;
+              if (t)
+                if (this.isHorizontal()) {
+                  if (void 0 !== t.x) return this.getRightValue(t.x);
+                } else if (void 0 !== t.y) return this.getRightValue(t.y);
+              return t;
+            },
+            getLabelForIndex: ut.noop,
+            getPixelForValue: ut.noop,
+            getValueForPixel: ut.noop,
+            getPixelForTick: function (t) {
+              var e = this,
+                i = e.options.offset;
+              if (e.isHorizontal()) {
+                var n = (e.width - (e.paddingLeft + e.paddingRight)) / Math.max(e._ticks.length - (i ? 0 : 1), 1),
+                  a = n * t + e.paddingLeft;
+                i && (a += n / 2);
+                var r = e.left + a;
+                return (r += e.isFullWidth() ? e.margins.left : 0);
+              }
+              var o = e.height - (e.paddingTop + e.paddingBottom);
+              return e.top + t * (o / (e._ticks.length - 1));
+            },
+            getPixelForDecimal: function (t) {
+              var e = this;
+              if (e.isHorizontal()) {
+                var i = (e.width - (e.paddingLeft + e.paddingRight)) * t + e.paddingLeft,
+                  n = e.left + i;
+                return (n += e.isFullWidth() ? e.margins.left : 0);
+              }
+              return e.top + t * e.height;
+            },
+            getBasePixel: function () {
+              return this.getPixelForValue(this.getBaseValue());
+            },
+            getBaseValue: function () {
+              var t = this.min,
+                e = this.max;
+              return this.beginAtZero ? 0 : t < 0 && e < 0 ? e : t > 0 && e > 0 ? t : 0;
+            },
+            _autoSkip: function (t) {
+              var e,
+                i,
+                n = this,
+                a = n.isHorizontal(),
+                r = n.options.ticks.minor,
+                o = t.length,
+                s = !1,
+                l = r.maxTicksLimit,
+                u = n._tickSize() * (o - 1),
+                d = a ? n.width - (n.paddingLeft + n.paddingRight) : n.height - (n.paddingTop + n.PaddingBottom),
+                h = [];
+              for (
+                u > d && (s = 1 + Math.floor(u / d)), o > l && (s = Math.max(s, 1 + Math.floor(o / l))), e = 0;
+                e < o;
+                e++
+              )
+                (i = t[e]), s > 1 && e % s > 0 && delete i.label, h.push(i);
+              return h;
+            },
+            _tickSize: function () {
+              var t = this,
+                e = t.isHorizontal(),
+                i = t.options.ticks.minor,
+                n = ut.toRadians(t.labelRotation),
+                a = Math.abs(Math.cos(n)),
+                r = Math.abs(Math.sin(n)),
+                o = i.autoSkipPadding || 0,
+                s = t.longestLabelWidth + o || 0,
+                l = ut.options._parseFont(i),
+                u = t._maxLabelLines * l.lineHeight + o || 0;
+              return e ? (u * a > s * r ? s / a : u / r) : u * r < s * a ? u / a : s / r;
+            },
+            _isVisible: function () {
+              var t,
+                e,
+                i,
+                n = this.chart,
+                a = this.options.display;
+              if ("auto" !== a) return !!a;
+              for (t = 0, e = n.data.datasets.length; t < e; ++t)
+                if (n.isDatasetVisible(t) && ((i = n.getDatasetMeta(t)).xAxisID === this.id || i.yAxisID === this.id))
+                  return !0;
+              return !1;
+            },
+            draw: function (t) {
+              var e = this,
+                i = e.options;
+              if (e._isVisible()) {
+                var n,
+                  a,
+                  r,
+                  o = e.chart,
+                  s = e.ctx,
+                  l = ot.global.defaultFontColor,
+                  u = i.ticks.minor,
+                  d = i.ticks.major || u,
+                  h = i.gridLines,
+                  c = i.scaleLabel,
+                  f = i.position,
+                  g = 0 !== e.labelRotation,
+                  m = u.mirror,
+                  p = e.isHorizontal(),
+                  v = ut.options._parseFont,
+                  y = u.display && u.autoSkip ? e._autoSkip(e.getTicks()) : e.getTicks(),
+                  b = ui(u.fontColor, l),
+                  x = v(u),
+                  _ = x.lineHeight,
+                  k = ui(d.fontColor, l),
+                  w = v(d),
+                  M = u.padding,
+                  S = u.labelOffset,
+                  D = h.drawTicks ? h.tickMarkLength : 0,
+                  C = ui(c.fontColor, l),
+                  P = v(c),
+                  T = ut.options.toPadding(c.padding),
+                  O = ut.toRadians(e.labelRotation),
+                  I = [],
+                  A = h.drawBorder ? di(h.lineWidth, 0, 0) : 0,
+                  F = ut._alignPixel;
+                "top" === f
+                  ? ((n = F(o, e.bottom, A)), (a = e.bottom - D), (r = n - A / 2))
+                  : "bottom" === f
+                    ? ((n = F(o, e.top, A)), (a = n + A / 2), (r = e.top + D))
+                    : "left" === f
+                      ? ((n = F(o, e.right, A)), (a = e.right - D), (r = n - A / 2))
+                      : ((n = F(o, e.left, A)), (a = n + A / 2), (r = e.left + D));
+                if (
+                  (ut.each(y, function (n, s) {
+                    if (!ut.isNullOrUndef(n.label)) {
+                      var l,
+                        u,
+                        d,
+                        c,
+                        v,
+                        y,
+                        b,
+                        x,
+                        k,
+                        w,
+                        C,
+                        P,
+                        T,
+                        R,
+                        L,
+                        W,
+                        Y = n.label;
+                      s === e.zeroLineIndex && i.offset === h.offsetGridLines
+                        ? ((l = h.zeroLineWidth),
+                          (u = h.zeroLineColor),
+                          (d = h.zeroLineBorderDash || []),
+                          (c = h.zeroLineBorderDashOffset || 0))
+                        : ((l = di(h.lineWidth, s)),
+                          (u = di(h.color, s)),
+                          (d = h.borderDash || []),
+                          (c = h.borderDashOffset || 0));
+                      var N = ut.isArray(Y) ? Y.length : 1,
+                        z = (function (t, e, i) {
+                          var n = t.getPixelForTick(e);
+                          return (
+                            i &&
+                              (1 === t.getTicks().length
+                                ? (n -= t.isHorizontal()
+                                    ? Math.max(n - t.left, t.right - n)
+                                    : Math.max(n - t.top, t.bottom - n))
+                                : (n -= 0 === e ? (t.getPixelForTick(1) - n) / 2 : (n - t.getPixelForTick(e - 1)) / 2)),
+                            n
+                          );
+                        })(e, s, h.offsetGridLines);
+                      if (p) {
+                        var V = D + M;
+                        z < e.left - 1e-7 && (u = "rgba(0,0,0,0)"),
+                          (v = b = k = C = F(o, z, l)),
+                          (y = a),
+                          (x = r),
+                          (T = e.getPixelForTick(s) + S),
+                          "top" === f
+                            ? ((w = F(o, t.top, A) + A / 2),
+                              (P = t.bottom),
+                              (L = ((g ? 1 : 0.5) - N) * _),
+                              (W = g ? "left" : "center"),
+                              (R = e.bottom - V))
+                            : ((w = t.top),
+                              (P = F(o, t.bottom, A) - A / 2),
+                              (L = (g ? 0 : 0.5) * _),
+                              (W = g ? "right" : "center"),
+                              (R = e.top + V));
+                      } else {
+                        var H = (m ? 0 : D) + M;
+                        z < e.top - 1e-7 && (u = "rgba(0,0,0,0)"),
+                          (v = a),
+                          (b = r),
+                          (y = x = w = P = F(o, z, l)),
+                          (R = e.getPixelForTick(s) + S),
+                          (L = ((1 - N) * _) / 2),
+                          "left" === f
+                            ? ((k = F(o, t.left, A) + A / 2),
+                              (C = t.right),
+                              (W = m ? "left" : "right"),
+                              (T = e.right - H))
+                            : ((k = t.left),
+                              (C = F(o, t.right, A) - A / 2),
+                              (W = m ? "right" : "left"),
+                              (T = e.left + H));
+                      }
+                      I.push({
+                        tx1: v,
+                        ty1: y,
+                        tx2: b,
+                        ty2: x,
+                        x1: k,
+                        y1: w,
+                        x2: C,
+                        y2: P,
+                        labelX: T,
+                        labelY: R,
+                        glWidth: l,
+                        glColor: u,
+                        glBorderDash: d,
+                        glBorderDashOffset: c,
+                        rotation: -1 * O,
+                        label: Y,
+                        major: n.major,
+                        textOffset: L,
+                        textAlign: W,
+                      });
+                    }
+                  }),
+                  ut.each(I, function (t) {
+                    var e = t.glWidth,
+                      i = t.glColor;
+                    if (
+                      (h.display &&
+                        e &&
+                        i &&
+                        (s.save(),
+                        (s.lineWidth = e),
+                        (s.strokeStyle = i),
+                        s.setLineDash && (s.setLineDash(t.glBorderDash), (s.lineDashOffset = t.glBorderDashOffset)),
+                        s.beginPath(),
+                        h.drawTicks && (s.moveTo(t.tx1, t.ty1), s.lineTo(t.tx2, t.ty2)),
+                        h.drawOnChartArea && (s.moveTo(t.x1, t.y1), s.lineTo(t.x2, t.y2)),
+                        s.stroke(),
+                        s.restore()),
+                      u.display)
+                    ) {
+                      s.save(),
+                        s.translate(t.labelX, t.labelY),
+                        s.rotate(t.rotation),
+                        (s.font = t.major ? w.string : x.string),
+                        (s.fillStyle = t.major ? k : b),
+                        (s.textBaseline = "middle"),
+                        (s.textAlign = t.textAlign);
+                      var n = t.label,
+                        a = t.textOffset;
+                      if (ut.isArray(n)) for (var r = 0; r < n.length; ++r) s.fillText("" + n[r], 0, a), (a += _);
+                      else s.fillText(n, 0, a);
+                      s.restore();
+                    }
+                  }),
+                  c.display)
+                ) {
+                  var R,
+                    L,
+                    W = 0,
+                    Y = P.lineHeight / 2;
+                  if (p)
+                    (R = e.left + (e.right - e.left) / 2),
+                      (L = "bottom" === f ? e.bottom - Y - T.bottom : e.top + Y + T.top);
+                  else {
+                    var N = "left" === f;
+                    (R = N ? e.left + Y + T.top : e.right - Y - T.top),
+                      (L = e.top + (e.bottom - e.top) / 2),
+                      (W = N ? -0.5 * Math.PI : 0.5 * Math.PI);
+                  }
+                  s.save(),
+                    s.translate(R, L),
+                    s.rotate(W),
+                    (s.textAlign = "center"),
+                    (s.textBaseline = "middle"),
+                    (s.fillStyle = C),
+                    (s.font = P.string),
+                    s.fillText(c.labelString, 0, 0),
+                    s.restore();
+                }
+                if (A) {
+                  var z,
+                    V,
+                    H,
+                    E,
+                    B = A,
+                    j = di(h.lineWidth, y.length - 1, 0);
+                  p
+                    ? ((z = F(o, e.left, B) - B / 2), (V = F(o, e.right, j) + j / 2), (H = E = n))
+                    : ((H = F(o, e.top, B) - B / 2), (E = F(o, e.bottom, j) + j / 2), (z = V = n)),
+                    (s.lineWidth = A),
+                    (s.strokeStyle = di(h.color, 0)),
+                    s.beginPath(),
+                    s.moveTo(z, H),
+                    s.lineTo(V, E),
+                    s.stroke();
+                }
+              }
+            },
+          }),
+          gi = fi.extend({
+            getLabels: function () {
+              var t = this.chart.data;
+              return this.options.labels || (this.isHorizontal() ? t.xLabels : t.yLabels) || t.labels;
+            },
+            determineDataLimits: function () {
+              var t,
+                e = this,
+                i = e.getLabels();
+              (e.minIndex = 0),
+                (e.maxIndex = i.length - 1),
+                void 0 !== e.options.ticks.min &&
+                  ((t = i.indexOf(e.options.ticks.min)), (e.minIndex = -1 !== t ? t : e.minIndex)),
+                void 0 !== e.options.ticks.max &&
+                  ((t = i.indexOf(e.options.ticks.max)), (e.maxIndex = -1 !== t ? t : e.maxIndex)),
+                (e.min = i[e.minIndex]),
+                (e.max = i[e.maxIndex]);
+            },
+            buildTicks: function () {
+              var t = this,
+                e = t.getLabels();
+              t.ticks = 0 === t.minIndex && t.maxIndex === e.length - 1 ? e : e.slice(t.minIndex, t.maxIndex + 1);
+            },
+            getLabelForIndex: function (t, e) {
+              var i = this,
+                n = i.chart;
+              return n.getDatasetMeta(e).controller._getValueScaleId() === i.id
+                ? i.getRightValue(n.data.datasets[e].data[t])
+                : i.ticks[t - i.minIndex];
+            },
+            getPixelForValue: function (t, e) {
+              var i,
+                n = this,
+                a = n.options.offset,
+                r = Math.max(n.maxIndex + 1 - n.minIndex - (a ? 0 : 1), 1);
+              if ((null != t && (i = n.isHorizontal() ? t.x : t.y), void 0 !== i || (void 0 !== t && isNaN(e)))) {
+                t = i || t;
+                var o = n.getLabels().indexOf(t);
+                e = -1 !== o ? o : e;
+              }
+              if (n.isHorizontal()) {
+                var s = n.width / r,
+                  l = s * (e - n.minIndex);
+                return a && (l += s / 2), n.left + l;
+              }
+              var u = n.height / r,
+                d = u * (e - n.minIndex);
+              return a && (d += u / 2), n.top + d;
+            },
+            getPixelForTick: function (t) {
+              return this.getPixelForValue(this.ticks[t], t + this.minIndex, null);
+            },
+            getValueForPixel: function (t) {
+              var e = this,
+                i = e.options.offset,
+                n = Math.max(e._ticks.length - (i ? 0 : 1), 1),
+                a = e.isHorizontal(),
+                r = (a ? e.width : e.height) / n;
+              return (t -= a ? e.left : e.top), i && (t -= r / 2), (t <= 0 ? 0 : Math.round(t / r)) + e.minIndex;
+            },
+            getBasePixel: function () {
+              return this.bottom;
+            },
+          }),
+          mi = { position: "bottom" };
+        gi._defaults = mi;
+        var pi = ut.noop,
+          vi = ut.isNullOrUndef;
+        var yi = fi.extend({
+            getRightValue: function (t) {
+              return "string" == typeof t ? +t : fi.prototype.getRightValue.call(this, t);
+            },
+            handleTickRangeOptions: function () {
+              var t = this,
+                e = t.options.ticks;
+              if (e.beginAtZero) {
+                var i = ut.sign(t.min),
+                  n = ut.sign(t.max);
+                i < 0 && n < 0 ? (t.max = 0) : i > 0 && n > 0 && (t.min = 0);
+              }
+              var a = void 0 !== e.min || void 0 !== e.suggestedMin,
+                r = void 0 !== e.max || void 0 !== e.suggestedMax;
+              void 0 !== e.min
+                ? (t.min = e.min)
+                : void 0 !== e.suggestedMin &&
+                  (null === t.min ? (t.min = e.suggestedMin) : (t.min = Math.min(t.min, e.suggestedMin))),
+                void 0 !== e.max
+                  ? (t.max = e.max)
+                  : void 0 !== e.suggestedMax &&
+                    (null === t.max ? (t.max = e.suggestedMax) : (t.max = Math.max(t.max, e.suggestedMax))),
+                a !== r && t.min >= t.max && (a ? (t.max = t.min + 1) : (t.min = t.max - 1)),
+                t.min === t.max && (t.max++, e.beginAtZero || t.min--);
+            },
+            getTickLimit: function () {
+              var t,
+                e = this.options.ticks,
+                i = e.stepSize,
+                n = e.maxTicksLimit;
+              return (
+                i
+                  ? (t = Math.ceil(this.max / i) - Math.floor(this.min / i) + 1)
+                  : ((t = this._computeTickLimit()), (n = n || 11)),
+                n && (t = Math.min(n, t)),
+                t
+              );
+            },
+            _computeTickLimit: function () {
+              return Number.POSITIVE_INFINITY;
+            },
+            handleDirectionalChanges: pi,
+            buildTicks: function () {
+              var t = this,
+                e = t.options.ticks,
+                i = t.getTickLimit(),
+                n = {
+                  maxTicks: (i = Math.max(2, i)),
+                  min: e.min,
+                  max: e.max,
+                  precision: e.precision,
+                  stepSize: ut.valueOrDefault(e.fixedStepSize, e.stepSize),
+                },
+                a = (t.ticks = (function (t, e) {
+                  var i,
+                    n,
+                    a,
+                    r,
+                    o = [],
+                    s = t.stepSize,
+                    l = s || 1,
+                    u = t.maxTicks - 1,
+                    d = t.min,
+                    h = t.max,
+                    c = t.precision,
+                    f = e.min,
+                    g = e.max,
+                    m = ut.niceNum((g - f) / u / l) * l;
+                  if (m < 1e-14 && vi(d) && vi(h)) return [f, g];
+                  (r = Math.ceil(g / m) - Math.floor(f / m)) > u && (m = ut.niceNum((r * m) / u / l) * l),
+                    s || vi(c)
+                      ? (i = Math.pow(10, ut._decimalPlaces(m)))
+                      : ((i = Math.pow(10, c)), (m = Math.ceil(m * i) / i)),
+                    (n = Math.floor(f / m) * m),
+                    (a = Math.ceil(g / m) * m),
+                    s &&
+                      (!vi(d) && ut.almostWhole(d / m, m / 1e3) && (n = d),
+                      !vi(h) && ut.almostWhole(h / m, m / 1e3) && (a = h)),
+                    (r = (a - n) / m),
+                    (r = ut.almostEquals(r, Math.round(r), m / 1e3) ? Math.round(r) : Math.ceil(r)),
+                    (n = Math.round(n * i) / i),
+                    (a = Math.round(a * i) / i),
+                    o.push(vi(d) ? n : d);
+                  for (var p = 1; p < r; ++p) o.push(Math.round((n + p * m) * i) / i);
+                  return o.push(vi(h) ? a : h), o;
+                })(n, t));
+              t.handleDirectionalChanges(),
+                (t.max = ut.max(a)),
+                (t.min = ut.min(a)),
+                e.reverse ? (a.reverse(), (t.start = t.max), (t.end = t.min)) : ((t.start = t.min), (t.end = t.max));
+            },
+            convertTicksToLabels: function () {
+              var t = this;
+              (t.ticksAsNumbers = t.ticks.slice()),
+                (t.zeroLineIndex = t.ticks.indexOf(0)),
+                fi.prototype.convertTicksToLabels.call(t);
+            },
+          }),
+          bi = { position: "left", ticks: { callback: li.formatters.linear } },
+          xi = yi.extend({
+            determineDataLimits: function () {
+              var t = this,
+                e = t.options,
+                i = t.chart,
+                n = i.data.datasets,
+                a = t.isHorizontal();
+              function r(e) {
+                return a ? e.xAxisID === t.id : e.yAxisID === t.id;
+              }
+              (t.min = null), (t.max = null);
+              var o = e.stacked;
+              if (
+                (void 0 === o &&
+                  ut.each(n, function (t, e) {
+                    if (!o) {
+                      var n = i.getDatasetMeta(e);
+                      i.isDatasetVisible(e) && r(n) && void 0 !== n.stack && (o = !0);
+                    }
+                  }),
+                e.stacked || o)
+              ) {
+                var s = {};
+                ut.each(n, function (n, a) {
+                  var o = i.getDatasetMeta(a),
+                    l = [o.type, void 0 === e.stacked && void 0 === o.stack ? a : "", o.stack].join(".");
+                  void 0 === s[l] && (s[l] = { positiveValues: [], negativeValues: [] });
+                  var u = s[l].positiveValues,
+                    d = s[l].negativeValues;
+                  i.isDatasetVisible(a) &&
+                    r(o) &&
+                    ut.each(n.data, function (i, n) {
+                      var a = +t.getRightValue(i);
+                      isNaN(a) ||
+                        o.data[n].hidden ||
+                        ((u[n] = u[n] || 0),
+                        (d[n] = d[n] || 0),
+                        e.relativePoints ? (u[n] = 100) : a < 0 ? (d[n] += a) : (u[n] += a));
+                    });
+                }),
+                  ut.each(s, function (e) {
+                    var i = e.positiveValues.concat(e.negativeValues),
+                      n = ut.min(i),
+                      a = ut.max(i);
+                    (t.min = null === t.min ? n : Math.min(t.min, n)),
+                      (t.max = null === t.max ? a : Math.max(t.max, a));
+                  });
+              } else
+                ut.each(n, function (e, n) {
+                  var a = i.getDatasetMeta(n);
+                  i.isDatasetVisible(n) &&
+                    r(a) &&
+                    ut.each(e.data, function (e, i) {
+                      var n = +t.getRightValue(e);
+                      isNaN(n) ||
+                        a.data[i].hidden ||
+                        (null === t.min ? (t.min = n) : n < t.min && (t.min = n),
+                        null === t.max ? (t.max = n) : n > t.max && (t.max = n));
+                    });
+                });
+              (t.min = isFinite(t.min) && !isNaN(t.min) ? t.min : 0),
+                (t.max = isFinite(t.max) && !isNaN(t.max) ? t.max : 1),
+                this.handleTickRangeOptions();
+            },
+            _computeTickLimit: function () {
+              var t;
+              return this.isHorizontal()
+                ? Math.ceil(this.width / 40)
+                : ((t = ut.options._parseFont(this.options.ticks)), Math.ceil(this.height / t.lineHeight));
+            },
+            handleDirectionalChanges: function () {
+              this.isHorizontal() || this.ticks.reverse();
+            },
+            getLabelForIndex: function (t, e) {
+              return +this.getRightValue(this.chart.data.datasets[e].data[t]);
+            },
+            getPixelForValue: function (t) {
+              var e = this,
+                i = e.start,
+                n = +e.getRightValue(t),
+                a = e.end - i;
+              return e.isHorizontal() ? e.left + (e.width / a) * (n - i) : e.bottom - (e.height / a) * (n - i);
+            },
+            getValueForPixel: function (t) {
+              var e = this,
+                i = e.isHorizontal(),
+                n = i ? e.width : e.height,
+                a = (i ? t - e.left : e.bottom - t) / n;
+              return e.start + (e.end - e.start) * a;
+            },
+            getPixelForTick: function (t) {
+              return this.getPixelForValue(this.ticksAsNumbers[t]);
+            },
+          }),
+          _i = bi;
+        xi._defaults = _i;
+        var ki = ut.valueOrDefault;
+        var wi = { position: "left", ticks: { callback: li.formatters.logarithmic } };
+        function Mi(t, e) {
+          return ut.isFinite(t) && t >= 0 ? t : e;
+        }
+        var Si = fi.extend({
+            determineDataLimits: function () {
+              var t = this,
+                e = t.options,
+                i = t.chart,
+                n = i.data.datasets,
+                a = t.isHorizontal();
+              function r(e) {
+                return a ? e.xAxisID === t.id : e.yAxisID === t.id;
+              }
+              (t.min = null), (t.max = null), (t.minNotZero = null);
+              var o = e.stacked;
+              if (
+                (void 0 === o &&
+                  ut.each(n, function (t, e) {
+                    if (!o) {
+                      var n = i.getDatasetMeta(e);
+                      i.isDatasetVisible(e) && r(n) && void 0 !== n.stack && (o = !0);
+                    }
+                  }),
+                e.stacked || o)
+              ) {
+                var s = {};
+                ut.each(n, function (n, a) {
+                  var o = i.getDatasetMeta(a),
+                    l = [o.type, void 0 === e.stacked && void 0 === o.stack ? a : "", o.stack].join(".");
+                  i.isDatasetVisible(a) &&
+                    r(o) &&
+                    (void 0 === s[l] && (s[l] = []),
+                    ut.each(n.data, function (e, i) {
+                      var n = s[l],
+                        a = +t.getRightValue(e);
+                      isNaN(a) || o.data[i].hidden || a < 0 || ((n[i] = n[i] || 0), (n[i] += a));
+                    }));
+                }),
+                  ut.each(s, function (e) {
+                    if (e.length > 0) {
+                      var i = ut.min(e),
+                        n = ut.max(e);
+                      (t.min = null === t.min ? i : Math.min(t.min, i)),
+                        (t.max = null === t.max ? n : Math.max(t.max, n));
+                    }
+                  });
+              } else
+                ut.each(n, function (e, n) {
+                  var a = i.getDatasetMeta(n);
+                  i.isDatasetVisible(n) &&
+                    r(a) &&
+                    ut.each(e.data, function (e, i) {
+                      var n = +t.getRightValue(e);
+                      isNaN(n) ||
+                        a.data[i].hidden ||
+                        n < 0 ||
+                        (null === t.min ? (t.min = n) : n < t.min && (t.min = n),
+                        null === t.max ? (t.max = n) : n > t.max && (t.max = n),
+                        0 !== n && (null === t.minNotZero || n < t.minNotZero) && (t.minNotZero = n));
+                    });
+                });
+              this.handleTickRangeOptions();
+            },
+            handleTickRangeOptions: function () {
+              var t = this,
+                e = t.options.ticks;
+              (t.min = Mi(e.min, t.min)),
+                (t.max = Mi(e.max, t.max)),
+                t.min === t.max &&
+                  (0 !== t.min && null !== t.min
+                    ? ((t.min = Math.pow(10, Math.floor(ut.log10(t.min)) - 1)),
+                      (t.max = Math.pow(10, Math.floor(ut.log10(t.max)) + 1)))
+                    : ((t.min = 1), (t.max = 10))),
+                null === t.min && (t.min = Math.pow(10, Math.floor(ut.log10(t.max)) - 1)),
+                null === t.max && (t.max = 0 !== t.min ? Math.pow(10, Math.floor(ut.log10(t.min)) + 1) : 10),
+                null === t.minNotZero &&
+                  (t.min > 0
+                    ? (t.minNotZero = t.min)
+                    : t.max < 1
+                      ? (t.minNotZero = Math.pow(10, Math.floor(ut.log10(t.max))))
+                      : (t.minNotZero = 1));
+            },
+            buildTicks: function () {
+              var t = this,
+                e = t.options.ticks,
+                i = !t.isHorizontal(),
+                n = { min: Mi(e.min), max: Mi(e.max) },
+                a = (t.ticks = (function (t, e) {
+                  var i,
+                    n,
+                    a = [],
+                    r = ki(t.min, Math.pow(10, Math.floor(ut.log10(e.min)))),
+                    o = Math.floor(ut.log10(e.max)),
+                    s = Math.ceil(e.max / Math.pow(10, o));
+                  0 === r
+                    ? ((i = Math.floor(ut.log10(e.minNotZero))),
+                      (n = Math.floor(e.minNotZero / Math.pow(10, i))),
+                      a.push(r),
+                      (r = n * Math.pow(10, i)))
+                    : ((i = Math.floor(ut.log10(r))), (n = Math.floor(r / Math.pow(10, i))));
+                  var l = i < 0 ? Math.pow(10, Math.abs(i)) : 1;
+                  do {
+                    a.push(r),
+                      10 == ++n && ((n = 1), (l = ++i >= 0 ? 1 : l)),
+                      (r = Math.round(n * Math.pow(10, i) * l) / l);
+                  } while (i < o || (i === o && n < s));
+                  var u = ki(t.max, r);
+                  return a.push(u), a;
+                })(n, t));
+              (t.max = ut.max(a)),
+                (t.min = ut.min(a)),
+                e.reverse ? ((i = !i), (t.start = t.max), (t.end = t.min)) : ((t.start = t.min), (t.end = t.max)),
+                i && a.reverse();
+            },
+            convertTicksToLabels: function () {
+              (this.tickValues = this.ticks.slice()), fi.prototype.convertTicksToLabels.call(this);
+            },
+            getLabelForIndex: function (t, e) {
+              return +this.getRightValue(this.chart.data.datasets[e].data[t]);
+            },
+            getPixelForTick: function (t) {
+              return this.getPixelForValue(this.tickValues[t]);
+            },
+            _getFirstTickValue: function (t) {
+              var e = Math.floor(ut.log10(t));
+              return Math.floor(t / Math.pow(10, e)) * Math.pow(10, e);
+            },
+            getPixelForValue: function (t) {
+              var e,
+                i,
+                n,
+                a,
+                r,
+                o = this,
+                s = o.options.ticks,
+                l = s.reverse,
+                u = ut.log10,
+                d = o._getFirstTickValue(o.minNotZero),
+                h = 0;
+              return (
+                (t = +o.getRightValue(t)),
+                l ? ((n = o.end), (a = o.start), (r = -1)) : ((n = o.start), (a = o.end), (r = 1)),
+                o.isHorizontal()
+                  ? ((e = o.width), (i = l ? o.right : o.left))
+                  : ((e = o.height), (r *= -1), (i = l ? o.top : o.bottom)),
+                t !== n &&
+                  (0 === n && ((e -= h = ki(s.fontSize, ot.global.defaultFontSize)), (n = d)),
+                  0 !== t && (h += (e / (u(a) - u(n))) * (u(t) - u(n))),
+                  (i += r * h)),
+                i
+              );
+            },
+            getValueForPixel: function (t) {
+              var e,
+                i,
+                n,
+                a,
+                r = this,
+                o = r.options.ticks,
+                s = o.reverse,
+                l = ut.log10,
+                u = r._getFirstTickValue(r.minNotZero);
+              if (
+                (s ? ((i = r.end), (n = r.start)) : ((i = r.start), (n = r.end)),
+                r.isHorizontal()
+                  ? ((e = r.width), (a = s ? r.right - t : t - r.left))
+                  : ((e = r.height), (a = s ? t - r.top : r.bottom - t)),
+                a !== i)
+              ) {
+                if (0 === i) {
+                  var d = ki(o.fontSize, ot.global.defaultFontSize);
+                  (a -= d), (e -= d), (i = u);
+                }
+                (a *= l(n) - l(i)), (a /= e), (a = Math.pow(10, l(i) + a));
+              }
+              return a;
+            },
+          }),
+          Di = wi;
+        Si._defaults = Di;
+        var Ci = ut.valueOrDefault,
+          Pi = ut.valueAtIndexOrDefault,
+          Ti = ut.options.resolve,
+          Oi = {
+            display: !0,
+            animate: !0,
+            position: "chartArea",
+            angleLines: { display: !0, color: "rgba(0, 0, 0, 0.1)", lineWidth: 1, borderDash: [], borderDashOffset: 0 },
+            gridLines: { circular: !1 },
+            ticks: {
+              showLabelBackdrop: !0,
+              backdropColor: "rgba(255,255,255,0.75)",
+              backdropPaddingY: 2,
+              backdropPaddingX: 2,
+              callback: li.formatters.linear,
+            },
+            pointLabels: {
+              display: !0,
+              fontSize: 10,
+              callback: function (t) {
+                return t;
+              },
+            },
+          };
+        function Ii(t) {
+          var e = t.options;
+          return e.angleLines.display || e.pointLabels.display ? t.chart.data.labels.length : 0;
+        }
+        function Ai(t) {
+          var e = t.ticks;
+          return e.display && t.display ? Ci(e.fontSize, ot.global.defaultFontSize) + 2 * e.backdropPaddingY : 0;
+        }
+        function Fi(t, e, i, n, a) {
+          return t === n || t === a
+            ? { start: e - i / 2, end: e + i / 2 }
+            : t < n || t > a
+              ? { start: e - i, end: e }
+              : { start: e, end: e + i };
+        }
+        function Ri(t) {
+          return 0 === t || 180 === t ? "center" : t < 180 ? "left" : "right";
+        }
+        function Li(t, e, i, n) {
+          var a,
+            r,
+            o = i.y + n / 2;
+          if (ut.isArray(e)) for (a = 0, r = e.length; a < r; ++a) t.fillText(e[a], i.x, o), (o += n);
+          else t.fillText(e, i.x, o);
+        }
+        function Wi(t, e, i) {
+          90 === t || 270 === t ? (i.y -= e.h / 2) : (t > 270 || t < 90) && (i.y -= e.h);
+        }
+        function Yi(t) {
+          return ut.isNumber(t) ? t : 0;
+        }
+        var Ni = yi.extend({
+            setDimensions: function () {
+              var t = this;
+              (t.width = t.maxWidth),
+                (t.height = t.maxHeight),
+                (t.paddingTop = Ai(t.options) / 2),
+                (t.xCenter = Math.floor(t.width / 2)),
+                (t.yCenter = Math.floor((t.height - t.paddingTop) / 2)),
+                (t.drawingArea = Math.min(t.height - t.paddingTop, t.width) / 2);
+            },
+            determineDataLimits: function () {
+              var t = this,
+                e = t.chart,
+                i = Number.POSITIVE_INFINITY,
+                n = Number.NEGATIVE_INFINITY;
+              ut.each(e.data.datasets, function (a, r) {
+                if (e.isDatasetVisible(r)) {
+                  var o = e.getDatasetMeta(r);
+                  ut.each(a.data, function (e, a) {
+                    var r = +t.getRightValue(e);
+                    isNaN(r) || o.data[a].hidden || ((i = Math.min(r, i)), (n = Math.max(r, n)));
+                  });
+                }
+              }),
+                (t.min = i === Number.POSITIVE_INFINITY ? 0 : i),
+                (t.max = n === Number.NEGATIVE_INFINITY ? 0 : n),
+                t.handleTickRangeOptions();
+            },
+            _computeTickLimit: function () {
+              return Math.ceil(this.drawingArea / Ai(this.options));
+            },
+            convertTicksToLabels: function () {
+              var t = this;
+              yi.prototype.convertTicksToLabels.call(t),
+                (t.pointLabels = t.chart.data.labels.map(t.options.pointLabels.callback, t));
+            },
+            getLabelForIndex: function (t, e) {
+              return +this.getRightValue(this.chart.data.datasets[e].data[t]);
+            },
+            fit: function () {
+              var t = this.options;
+              t.display && t.pointLabels.display
+                ? (function (t) {
+                    var e,
+                      i,
+                      n,
+                      a = ut.options._parseFont(t.options.pointLabels),
+                      r = { l: 0, r: t.width, t: 0, b: t.height - t.paddingTop },
+                      o = {};
+                    (t.ctx.font = a.string), (t._pointLabelSizes = []);
+                    var s,
+                      l,
+                      u,
+                      d = Ii(t);
+                    for (e = 0; e < d; e++) {
+                      (n = t.getPointPosition(e, t.drawingArea + 5)),
+                        (s = t.ctx),
+                        (l = a.lineHeight),
+                        (u = t.pointLabels[e] || ""),
+                        (i = ut.isArray(u)
+                          ? { w: ut.longestText(s, s.font, u), h: u.length * l }
+                          : { w: s.measureText(u).width, h: l }),
+                        (t._pointLabelSizes[e] = i);
+                      var h = t.getIndexAngle(e),
+                        c = ut.toDegrees(h) % 360,
+                        f = Fi(c, n.x, i.w, 0, 180),
+                        g = Fi(c, n.y, i.h, 90, 270);
+                      f.start < r.l && ((r.l = f.start), (o.l = h)),
+                        f.end > r.r && ((r.r = f.end), (o.r = h)),
+                        g.start < r.t && ((r.t = g.start), (o.t = h)),
+                        g.end > r.b && ((r.b = g.end), (o.b = h));
+                    }
+                    t.setReductions(t.drawingArea, r, o);
+                  })(this)
+                : this.setCenterPoint(0, 0, 0, 0);
+            },
+            setReductions: function (t, e, i) {
+              var n = this,
+                a = e.l / Math.sin(i.l),
+                r = Math.max(e.r - n.width, 0) / Math.sin(i.r),
+                o = -e.t / Math.cos(i.t),
+                s = -Math.max(e.b - (n.height - n.paddingTop), 0) / Math.cos(i.b);
+              (a = Yi(a)),
+                (r = Yi(r)),
+                (o = Yi(o)),
+                (s = Yi(s)),
+                (n.drawingArea = Math.min(Math.floor(t - (a + r) / 2), Math.floor(t - (o + s) / 2))),
+                n.setCenterPoint(a, r, o, s);
+            },
+            setCenterPoint: function (t, e, i, n) {
+              var a = this,
+                r = a.width - e - a.drawingArea,
+                o = t + a.drawingArea,
+                s = i + a.drawingArea,
+                l = a.height - a.paddingTop - n - a.drawingArea;
+              (a.xCenter = Math.floor((o + r) / 2 + a.left)),
+                (a.yCenter = Math.floor((s + l) / 2 + a.top + a.paddingTop));
+            },
+            getIndexAngle: function (t) {
+              return (
+                t * ((2 * Math.PI) / Ii(this)) +
+                ((this.chart.options && this.chart.options.startAngle ? this.chart.options.startAngle : 0) *
+                  Math.PI *
+                  2) /
+                  360
+              );
+            },
+            getDistanceFromCenterForValue: function (t) {
+              var e = this;
+              if (null === t) return 0;
+              var i = e.drawingArea / (e.max - e.min);
+              return e.options.ticks.reverse ? (e.max - t) * i : (t - e.min) * i;
+            },
+            getPointPosition: function (t, e) {
+              var i = this.getIndexAngle(t) - Math.PI / 2;
+              return { x: Math.cos(i) * e + this.xCenter, y: Math.sin(i) * e + this.yCenter };
+            },
+            getPointPositionForValue: function (t, e) {
+              return this.getPointPosition(t, this.getDistanceFromCenterForValue(e));
+            },
+            getBasePosition: function () {
+              var t = this.min,
+                e = this.max;
+              return this.getPointPositionForValue(
+                0,
+                this.beginAtZero ? 0 : t < 0 && e < 0 ? e : t > 0 && e > 0 ? t : 0
+              );
+            },
+            draw: function () {
+              var t = this,
+                e = t.options,
+                i = e.gridLines,
+                n = e.ticks;
+              if (e.display) {
+                var a = t.ctx,
+                  r = this.getIndexAngle(0),
+                  o = ut.options._parseFont(n);
+                (e.angleLines.display || e.pointLabels.display) &&
+                  (function (t) {
+                    var e = t.ctx,
+                      i = t.options,
+                      n = i.angleLines,
+                      a = i.gridLines,
+                      r = i.pointLabels,
+                      o = Ci(n.lineWidth, a.lineWidth),
+                      s = Ci(n.color, a.color),
+                      l = Ai(i);
+                    e.save(),
+                      (e.lineWidth = o),
+                      (e.strokeStyle = s),
+                      e.setLineDash &&
+                        (e.setLineDash(Ti([n.borderDash, a.borderDash, []])),
+                        (e.lineDashOffset = Ti([n.borderDashOffset, a.borderDashOffset, 0])));
+                    var u = t.getDistanceFromCenterForValue(i.ticks.reverse ? t.min : t.max),
+                      d = ut.options._parseFont(r);
+                    (e.font = d.string), (e.textBaseline = "middle");
+                    for (var h = Ii(t) - 1; h >= 0; h--) {
+                      if (n.display && o && s) {
+                        var c = t.getPointPosition(h, u);
+                        e.beginPath(), e.moveTo(t.xCenter, t.yCenter), e.lineTo(c.x, c.y), e.stroke();
+                      }
+                      if (r.display) {
+                        var f = 0 === h ? l / 2 : 0,
+                          g = t.getPointPosition(h, u + f + 5),
+                          m = Pi(r.fontColor, h, ot.global.defaultFontColor);
+                        e.fillStyle = m;
+                        var p = t.getIndexAngle(h),
+                          v = ut.toDegrees(p);
+                        (e.textAlign = Ri(v)),
+                          Wi(v, t._pointLabelSizes[h], g),
+                          Li(e, t.pointLabels[h] || "", g, d.lineHeight);
+                      }
+                    }
+                    e.restore();
+                  })(t),
+                  ut.each(t.ticks, function (e, s) {
+                    if (s > 0 || n.reverse) {
+                      var l = t.getDistanceFromCenterForValue(t.ticksAsNumbers[s]);
+                      if (
+                        (i.display &&
+                          0 !== s &&
+                          (function (t, e, i, n) {
+                            var a,
+                              r = t.ctx,
+                              o = e.circular,
+                              s = Ii(t),
+                              l = Pi(e.color, n - 1),
+                              u = Pi(e.lineWidth, n - 1);
+                            if ((o || s) && l && u) {
+                              if (
+                                (r.save(),
+                                (r.strokeStyle = l),
+                                (r.lineWidth = u),
+                                r.setLineDash &&
+                                  (r.setLineDash(e.borderDash || []), (r.lineDashOffset = e.borderDashOffset || 0)),
+                                r.beginPath(),
+                                o)
+                              )
+                                r.arc(t.xCenter, t.yCenter, i, 0, 2 * Math.PI);
+                              else {
+                                (a = t.getPointPosition(0, i)), r.moveTo(a.x, a.y);
+                                for (var d = 1; d < s; d++) (a = t.getPointPosition(d, i)), r.lineTo(a.x, a.y);
+                              }
+                              r.closePath(), r.stroke(), r.restore();
+                            }
+                          })(t, i, l, s),
+                        n.display)
+                      ) {
+                        var u = Ci(n.fontColor, ot.global.defaultFontColor);
+                        if (
+                          ((a.font = o.string),
+                          a.save(),
+                          a.translate(t.xCenter, t.yCenter),
+                          a.rotate(r),
+                          n.showLabelBackdrop)
+                        ) {
+                          var d = a.measureText(e).width;
+                          (a.fillStyle = n.backdropColor),
+                            a.fillRect(
+                              -d / 2 - n.backdropPaddingX,
+                              -l - o.size / 2 - n.backdropPaddingY,
+                              d + 2 * n.backdropPaddingX,
+                              o.size + 2 * n.backdropPaddingY
+                            );
+                        }
+                        (a.textAlign = "center"),
+                          (a.textBaseline = "middle"),
+                          (a.fillStyle = u),
+                          a.fillText(e, 0, -l),
+                          a.restore();
+                      }
+                    }
+                  });
+              }
+            },
+          }),
+          zi = Oi;
+        Ni._defaults = zi;
+        var Vi = ut.valueOrDefault,
+          Hi = Number.MIN_SAFE_INTEGER || -9007199254740991,
+          Ei = Number.MAX_SAFE_INTEGER || 9007199254740991,
+          Bi = {
+            millisecond: { common: !0, size: 1, steps: [1, 2, 5, 10, 20, 50, 100, 250, 500] },
+            second: { common: !0, size: 1e3, steps: [1, 2, 5, 10, 15, 30] },
+            minute: { common: !0, size: 6e4, steps: [1, 2, 5, 10, 15, 30] },
+            hour: { common: !0, size: 36e5, steps: [1, 2, 3, 6, 12] },
+            day: { common: !0, size: 864e5, steps: [1, 2, 5] },
+            week: { common: !1, size: 6048e5, steps: [1, 2, 3, 4] },
+            month: { common: !0, size: 2628e6, steps: [1, 2, 3] },
+            quarter: { common: !1, size: 7884e6, steps: [1, 2, 3, 4] },
+            year: { common: !0, size: 3154e7 },
+          },
+          ji = Object.keys(Bi);
+        function Ui(t, e) {
+          return t - e;
+        }
+        function Gi(t) {
+          var e,
+            i,
+            n,
+            a = {},
+            r = [];
+          for (e = 0, i = t.length; e < i; ++e) a[(n = t[e])] || ((a[n] = !0), r.push(n));
+          return r;
+        }
+        function qi(t, e, i, n) {
+          var a = (function (t, e, i) {
+              for (var n, a, r, o = 0, s = t.length - 1; o >= 0 && o <= s; ) {
+                if (((a = t[(n = (o + s) >> 1) - 1] || null), (r = t[n]), !a)) return { lo: null, hi: r };
+                if (r[e] < i) o = n + 1;
+                else {
+                  if (!(a[e] > i)) return { lo: a, hi: r };
+                  s = n - 1;
+                }
+              }
+              return { lo: r, hi: null };
+            })(t, e, i),
+            r = a.lo ? (a.hi ? a.lo : t[t.length - 2]) : t[0],
+            o = a.lo ? (a.hi ? a.hi : t[t.length - 1]) : t[1],
+            s = o[e] - r[e],
+            l = s ? (i - r[e]) / s : 0,
+            u = (o[n] - r[n]) * l;
+          return r[n] + u;
+        }
+        function Zi(t, e) {
+          var i = t._adapter,
+            n = t.options.time,
+            a = n.parser,
+            r = a || n.format,
+            o = e;
+          return (
+            "function" == typeof a && (o = a(o)),
+            ut.isFinite(o) || (o = "string" == typeof r ? i.parse(o, r) : i.parse(o)),
+            null !== o ? +o : (a || "function" != typeof r || ((o = r(e)), ut.isFinite(o) || (o = i.parse(o))), o)
+          );
+        }
+        function $i(t, e) {
+          if (ut.isNullOrUndef(e)) return null;
+          var i = t.options.time,
+            n = Zi(t, t.getRightValue(e));
+          return null === n ? n : (i.round && (n = +t._adapter.startOf(n, i.round)), n);
+        }
+        function Xi(t) {
+          for (var e = ji.indexOf(t) + 1, i = ji.length; e < i; ++e) if (Bi[ji[e]].common) return ji[e];
+        }
+        function Ki(t, e, i, n) {
+          var a,
+            r = t._adapter,
+            o = t.options,
+            s = o.time,
+            l =
+              s.unit ||
+              (function (t, e, i, n) {
+                var a,
+                  r,
+                  o,
+                  s = ji.length;
+                for (a = ji.indexOf(t); a < s - 1; ++a)
+                  if (
+                    ((o = (r = Bi[ji[a]]).steps ? r.steps[r.steps.length - 1] : Ei),
+                    r.common && Math.ceil((i - e) / (o * r.size)) <= n)
+                  )
+                    return ji[a];
+                return ji[s - 1];
+              })(s.minUnit, e, i, n),
+            u = Xi(l),
+            d = Vi(s.stepSize, s.unitStepSize),
+            h = "week" === l && s.isoWeekday,
+            c = o.ticks.major.enabled,
+            f = Bi[l],
+            g = e,
+            m = i,
+            p = [];
+          for (
+            d ||
+              (d = (function (t, e, i, n) {
+                var a,
+                  r,
+                  o,
+                  s = e - t,
+                  l = Bi[i],
+                  u = l.size,
+                  d = l.steps;
+                if (!d) return Math.ceil(s / (n * u));
+                for (a = 0, r = d.length; a < r && ((o = d[a]), !(Math.ceil(s / (u * o)) <= n)); ++a);
+                return o;
+              })(e, i, l, n)),
+              h && ((g = +r.startOf(g, "isoWeek", h)), (m = +r.startOf(m, "isoWeek", h))),
+              g = +r.startOf(g, h ? "day" : l),
+              (m = +r.startOf(m, h ? "day" : l)) < i && (m = +r.add(m, 1, l)),
+              a = g,
+              c && u && !h && !s.round && ((a = +r.startOf(a, u)), (a = +r.add(a, ~~((g - a) / (f.size * d)) * d, l)));
+            a < m;
+            a = +r.add(a, d, l)
+          )
+            p.push(+a);
+          return p.push(+a), p;
+        }
+        var Ji = fi.extend({
+            initialize: function () {
+              this.mergeTicksOptions(), fi.prototype.initialize.call(this);
+            },
+            update: function () {
+              var t = this.options,
+                e = t.time || (t.time = {}),
+                i = (this._adapter = new si._date(t.adapters.date));
+              return (
+                e.format && console.warn("options.time.format is deprecated and replaced by options.time.parser."),
+                ut.mergeIf(e.displayFormats, i.formats()),
+                fi.prototype.update.apply(this, arguments)
+              );
+            },
+            getRightValue: function (t) {
+              return t && void 0 !== t.t && (t = t.t), fi.prototype.getRightValue.call(this, t);
+            },
+            determineDataLimits: function () {
+              var t,
+                e,
+                i,
+                n,
+                a,
+                r,
+                o = this,
+                s = o.chart,
+                l = o._adapter,
+                u = o.options.time,
+                d = u.unit || "day",
+                h = Ei,
+                c = Hi,
+                f = [],
+                g = [],
+                m = [],
+                p = s.data.labels || [];
+              for (t = 0, i = p.length; t < i; ++t) m.push($i(o, p[t]));
+              for (t = 0, i = (s.data.datasets || []).length; t < i; ++t)
+                if (s.isDatasetVisible(t))
+                  if (((a = s.data.datasets[t].data), ut.isObject(a[0])))
+                    for (g[t] = [], e = 0, n = a.length; e < n; ++e) (r = $i(o, a[e])), f.push(r), (g[t][e] = r);
+                  else {
+                    for (e = 0, n = m.length; e < n; ++e) f.push(m[e]);
+                    g[t] = m.slice(0);
+                  }
+                else g[t] = [];
+              m.length && ((m = Gi(m).sort(Ui)), (h = Math.min(h, m[0])), (c = Math.max(c, m[m.length - 1]))),
+                f.length && ((f = Gi(f).sort(Ui)), (h = Math.min(h, f[0])), (c = Math.max(c, f[f.length - 1]))),
+                (h = $i(o, u.min) || h),
+                (c = $i(o, u.max) || c),
+                (h = h === Ei ? +l.startOf(Date.now(), d) : h),
+                (c = c === Hi ? +l.endOf(Date.now(), d) + 1 : c),
+                (o.min = Math.min(h, c)),
+                (o.max = Math.max(h + 1, c)),
+                (o._horizontal = o.isHorizontal()),
+                (o._table = []),
+                (o._timestamps = { data: f, datasets: g, labels: m });
+            },
+            buildTicks: function () {
+              var t,
+                e,
+                i,
+                n = this,
+                a = n.min,
+                r = n.max,
+                o = n.options,
+                s = o.time,
+                l = [],
+                u = [];
+              switch (o.ticks.source) {
+                case "data":
+                  l = n._timestamps.data;
+                  break;
+                case "labels":
+                  l = n._timestamps.labels;
+                  break;
+                case "auto":
+                default:
+                  l = Ki(n, a, r, n.getLabelCapacity(a));
+              }
+              for (
+                "ticks" === o.bounds && l.length && ((a = l[0]), (r = l[l.length - 1])),
+                  a = $i(n, s.min) || a,
+                  r = $i(n, s.max) || r,
+                  t = 0,
+                  e = l.length;
+                t < e;
+                ++t
+              )
+                (i = l[t]) >= a && i <= r && u.push(i);
+              return (
+                (n.min = a),
+                (n.max = r),
+                (n._unit =
+                  s.unit ||
+                  (function (t, e, i, n, a) {
+                    var r, o;
+                    for (r = ji.length - 1; r >= ji.indexOf(i); r--)
+                      if (((o = ji[r]), Bi[o].common && t._adapter.diff(a, n, o) >= e.length)) return o;
+                    return ji[i ? ji.indexOf(i) : 0];
+                  })(n, u, s.minUnit, n.min, n.max)),
+                (n._majorUnit = Xi(n._unit)),
+                (n._table = (function (t, e, i, n) {
+                  if ("linear" === n || !t.length)
+                    return [
+                      { time: e, pos: 0 },
+                      { time: i, pos: 1 },
+                    ];
+                  var a,
+                    r,
+                    o,
+                    s,
+                    l,
+                    u = [],
+                    d = [e];
+                  for (a = 0, r = t.length; a < r; ++a) (s = t[a]) > e && s < i && d.push(s);
+                  for (d.push(i), a = 0, r = d.length; a < r; ++a)
+                    (l = d[a + 1]),
+                      (o = d[a - 1]),
+                      (s = d[a]),
+                      (void 0 !== o && void 0 !== l && Math.round((l + o) / 2) === s) ||
+                        u.push({ time: s, pos: a / (r - 1) });
+                  return u;
+                })(n._timestamps.data, a, r, o.distribution)),
+                (n._offsets = (function (t, e, i, n, a) {
+                  var r,
+                    o,
+                    s = 0,
+                    l = 0;
+                  return (
+                    a.offset &&
+                      e.length &&
+                      (a.time.min ||
+                        ((r = qi(t, "time", e[0], "pos")),
+                        (s = 1 === e.length ? 1 - r : (qi(t, "time", e[1], "pos") - r) / 2)),
+                      a.time.max ||
+                        ((o = qi(t, "time", e[e.length - 1], "pos")),
+                        (l = 1 === e.length ? o : (o - qi(t, "time", e[e.length - 2], "pos")) / 2))),
+                    { start: s, end: l }
+                  );
+                })(n._table, u, 0, 0, o)),
+                o.ticks.reverse && u.reverse(),
+                (function (t, e, i) {
+                  var n,
+                    a,
+                    r,
+                    o,
+                    s = [];
+                  for (n = 0, a = e.length; n < a; ++n)
+                    (r = e[n]), (o = !!i && r === +t._adapter.startOf(r, i)), s.push({ value: r, major: o });
+                  return s;
+                })(n, u, n._majorUnit)
+              );
+            },
+            getLabelForIndex: function (t, e) {
+              var i = this,
+                n = i._adapter,
+                a = i.chart.data,
+                r = i.options.time,
+                o = a.labels && t < a.labels.length ? a.labels[t] : "",
+                s = a.datasets[e].data[t];
+              return (
+                ut.isObject(s) && (o = i.getRightValue(s)),
+                r.tooltipFormat
+                  ? n.format(Zi(i, o), r.tooltipFormat)
+                  : "string" == typeof o
+                    ? o
+                    : n.format(Zi(i, o), r.displayFormats.datetime)
+              );
+            },
+            tickFormatFunction: function (t, e, i, n) {
+              var a = this._adapter,
+                r = this.options,
+                o = r.time.displayFormats,
+                s = o[this._unit],
+                l = this._majorUnit,
+                u = o[l],
+                d = +a.startOf(t, l),
+                h = r.ticks.major,
+                c = h.enabled && l && u && t === d,
+                f = a.format(t, n || (c ? u : s)),
+                g = c ? h : r.ticks.minor,
+                m = Vi(g.callback, g.userCallback);
+              return m ? m(f, e, i) : f;
+            },
+            convertTicksToLabels: function (t) {
+              var e,
+                i,
+                n = [];
+              for (e = 0, i = t.length; e < i; ++e) n.push(this.tickFormatFunction(t[e].value, e, t));
+              return n;
+            },
+            getPixelForOffset: function (t) {
+              var e = this,
+                i = e.options.ticks.reverse,
+                n = e._horizontal ? e.width : e.height,
+                a = e._horizontal ? (i ? e.right : e.left) : i ? e.bottom : e.top,
+                r = qi(e._table, "time", t, "pos"),
+                o = (n * (e._offsets.start + r)) / (e._offsets.start + 1 + e._offsets.end);
+              return i ? a - o : a + o;
+            },
+            getPixelForValue: function (t, e, i) {
+              var n = null;
+              if (
+                (void 0 !== e && void 0 !== i && (n = this._timestamps.datasets[i][e]),
+                null === n && (n = $i(this, t)),
+                null !== n)
+              )
+                return this.getPixelForOffset(n);
+            },
+            getPixelForTick: function (t) {
+              var e = this.getTicks();
+              return t >= 0 && t < e.length ? this.getPixelForOffset(e[t].value) : null;
+            },
+            getValueForPixel: function (t) {
+              var e = this,
+                i = e._horizontal ? e.width : e.height,
+                n = e._horizontal ? e.left : e.top,
+                a = (i ? (t - n) / i : 0) * (e._offsets.start + 1 + e._offsets.start) - e._offsets.end,
+                r = qi(e._table, "pos", a, "time");
+              return e._adapter._create(r);
+            },
+            getLabelWidth: function (t) {
+              var e = this.options.ticks,
+                i = this.ctx.measureText(t).width,
+                n = ut.toRadians(e.maxRotation),
+                a = Math.cos(n),
+                r = Math.sin(n);
+              return i * a + Vi(e.fontSize, ot.global.defaultFontSize) * r;
+            },
+            getLabelCapacity: function (t) {
+              var e = this,
+                i = e.options.time.displayFormats.millisecond,
+                n = e.tickFormatFunction(t, 0, [], i),
+                a = e.getLabelWidth(n),
+                r = e.isHorizontal() ? e.width : e.height,
+                o = Math.floor(r / a);
+              return o > 0 ? o : 1;
+            },
+          }),
+          Qi = {
+            position: "bottom",
+            distribution: "linear",
+            bounds: "data",
+            adapters: {},
+            time: {
+              parser: !1,
+              format: !1,
+              unit: !1,
+              round: !1,
+              displayFormat: !1,
+              isoWeekday: !1,
+              minUnit: "millisecond",
+              displayFormats: {},
+            },
+            ticks: { autoSkip: !1, source: "auto", major: { enabled: !1 } },
+          };
+        Ji._defaults = Qi;
+        var tn,
+          en = { category: gi, linear: xi, logarithmic: Si, radialLinear: Ni, time: Ji },
+          nn =
+            ((function (t, e) {
+              t.exports = (function () {
+                var e, i;
+                function n() {
+                  return e.apply(null, arguments);
+                }
+                function a(t) {
+                  return t instanceof Array || "[object Array]" === Object.prototype.toString.call(t);
+                }
+                function r(t) {
+                  return null != t && "[object Object]" === Object.prototype.toString.call(t);
+                }
+                function o(t) {
+                  return void 0 === t;
+                }
+                function s(t) {
+                  return "number" == typeof t || "[object Number]" === Object.prototype.toString.call(t);
+                }
+                function l(t) {
+                  return t instanceof Date || "[object Date]" === Object.prototype.toString.call(t);
+                }
+                function u(t, e) {
+                  var i,
+                    n = [];
+                  for (i = 0; i < t.length; ++i) n.push(e(t[i], i));
+                  return n;
+                }
+                function d(t, e) {
+                  return Object.prototype.hasOwnProperty.call(t, e);
+                }
+                function h(t, e) {
+                  for (var i in e) d(e, i) && (t[i] = e[i]);
+                  return d(e, "toString") && (t.toString = e.toString), d(e, "valueOf") && (t.valueOf = e.valueOf), t;
+                }
+                function c(t, e, i, n) {
+                  return Oe(t, e, i, n, !0).utc();
+                }
+                function f(t) {
+                  return (
+                    null == t._pf &&
+                      (t._pf = {
+                        empty: !1,
+                        unusedTokens: [],
+                        unusedInput: [],
+                        overflow: -2,
+                        charsLeftOver: 0,
+                        nullInput: !1,
+                        invalidMonth: null,
+                        invalidFormat: !1,
+                        userInvalidated: !1,
+                        iso: !1,
+                        parsedDateParts: [],
+                        meridiem: null,
+                        rfc2822: !1,
+                        weekdayMismatch: !1,
+                      }),
+                    t._pf
+                  );
+                }
+                function g(t) {
+                  if (null == t._isValid) {
+                    var e = f(t),
+                      n = i.call(e.parsedDateParts, function (t) {
+                        return null != t;
+                      }),
+                      a =
+                        !isNaN(t._d.getTime()) &&
+                        e.overflow < 0 &&
+                        !e.empty &&
+                        !e.invalidMonth &&
+                        !e.invalidWeekday &&
+                        !e.weekdayMismatch &&
+                        !e.nullInput &&
+                        !e.invalidFormat &&
+                        !e.userInvalidated &&
+                        (!e.meridiem || (e.meridiem && n));
+                    if (
+                      (t._strict &&
+                        (a = a && 0 === e.charsLeftOver && 0 === e.unusedTokens.length && void 0 === e.bigHour),
+                      null != Object.isFrozen && Object.isFrozen(t))
+                    )
+                      return a;
+                    t._isValid = a;
+                  }
+                  return t._isValid;
+                }
+                function m(t) {
+                  var e = c(NaN);
+                  return null != t ? h(f(e), t) : (f(e).userInvalidated = !0), e;
+                }
+                i = Array.prototype.some
+                  ? Array.prototype.some
+                  : function (t) {
+                      for (var e = Object(this), i = e.length >>> 0, n = 0; n < i; n++)
+                        if (n in e && t.call(this, e[n], n, e)) return !0;
+                      return !1;
+                    };
+                var p = (n.momentProperties = []);
+                function v(t, e) {
+                  var i, n, a;
+                  if (
+                    (o(e._isAMomentObject) || (t._isAMomentObject = e._isAMomentObject),
+                    o(e._i) || (t._i = e._i),
+                    o(e._f) || (t._f = e._f),
+                    o(e._l) || (t._l = e._l),
+                    o(e._strict) || (t._strict = e._strict),
+                    o(e._tzm) || (t._tzm = e._tzm),
+                    o(e._isUTC) || (t._isUTC = e._isUTC),
+                    o(e._offset) || (t._offset = e._offset),
+                    o(e._pf) || (t._pf = f(e)),
+                    o(e._locale) || (t._locale = e._locale),
+                    p.length > 0)
+                  )
+                    for (i = 0; i < p.length; i++) (n = p[i]), o((a = e[n])) || (t[n] = a);
+                  return t;
+                }
+                var y = !1;
+                function b(t) {
+                  v(this, t),
+                    (this._d = new Date(null != t._d ? t._d.getTime() : NaN)),
+                    this.isValid() || (this._d = new Date(NaN)),
+                    !1 === y && ((y = !0), n.updateOffset(this), (y = !1));
+                }
+                function x(t) {
+                  return t instanceof b || (null != t && null != t._isAMomentObject);
+                }
+                function _(t) {
+                  return t < 0 ? Math.ceil(t) || 0 : Math.floor(t);
+                }
+                function k(t) {
+                  var e = +t,
+                    i = 0;
+                  return 0 !== e && isFinite(e) && (i = _(e)), i;
+                }
+                function w(t, e, i) {
+                  var n,
+                    a = Math.min(t.length, e.length),
+                    r = Math.abs(t.length - e.length),
+                    o = 0;
+                  for (n = 0; n < a; n++) ((i && t[n] !== e[n]) || (!i && k(t[n]) !== k(e[n]))) && o++;
+                  return o + r;
+                }
+                function M(t) {
+                  !1 === n.suppressDeprecationWarnings &&
+                    "undefined" != typeof console &&
+                    console.warn &&
+                    console.warn("Deprecation warning: " + t);
+                }
+                function S(t, e) {
+                  var i = !0;
+                  return h(function () {
+                    if ((null != n.deprecationHandler && n.deprecationHandler(null, t), i)) {
+                      for (var a, r = [], o = 0; o < arguments.length; o++) {
+                        if (((a = ""), "object" == typeof arguments[o])) {
+                          for (var s in ((a += "\n[" + o + "] "), arguments[0])) a += s + ": " + arguments[0][s] + ", ";
+                          a = a.slice(0, -2);
+                        } else a = arguments[o];
+                        r.push(a);
+                      }
+                      M(t + "\nArguments: " + Array.prototype.slice.call(r).join("") + "\n" + new Error().stack),
+                        (i = !1);
+                    }
+                    return e.apply(this, arguments);
+                  }, e);
+                }
+                var D,
+                  C = {};
+                function P(t, e) {
+                  null != n.deprecationHandler && n.deprecationHandler(t, e), C[t] || (M(e), (C[t] = !0));
+                }
+                function T(t) {
+                  return t instanceof Function || "[object Function]" === Object.prototype.toString.call(t);
+                }
+                function O(t, e) {
+                  var i,
+                    n = h({}, t);
+                  for (i in e)
+                    d(e, i) &&
+                      (r(t[i]) && r(e[i])
+                        ? ((n[i] = {}), h(n[i], t[i]), h(n[i], e[i]))
+                        : null != e[i]
+                          ? (n[i] = e[i])
+                          : delete n[i]);
+                  for (i in t) d(t, i) && !d(e, i) && r(t[i]) && (n[i] = h({}, n[i]));
+                  return n;
+                }
+                function I(t) {
+                  null != t && this.set(t);
+                }
+                (n.suppressDeprecationWarnings = !1),
+                  (n.deprecationHandler = null),
+                  (D = Object.keys
+                    ? Object.keys
+                    : function (t) {
+                        var e,
+                          i = [];
+                        for (e in t) d(t, e) && i.push(e);
+                        return i;
+                      });
+                var A = {};
+                function F(t, e) {
+                  var i = t.toLowerCase();
+                  A[i] = A[i + "s"] = A[e] = t;
+                }
+                function R(t) {
+                  return "string" == typeof t ? A[t] || A[t.toLowerCase()] : void 0;
+                }
+                function L(t) {
+                  var e,
+                    i,
+                    n = {};
+                  for (i in t) d(t, i) && (e = R(i)) && (n[e] = t[i]);
+                  return n;
+                }
+                var W = {};
+                function Y(t, e) {
+                  W[t] = e;
+                }
+                function N(t, e, i) {
+                  var n = "" + Math.abs(t),
+                    a = e - n.length,
+                    r = t >= 0;
+                  return (r ? (i ? "+" : "") : "-") + Math.pow(10, Math.max(0, a)).toString().substr(1) + n;
+                }
+                var z =
+                    /(\[[^\[]*\])|(\\)?([Hh]mm(ss)?|Mo|MM?M?M?|Do|DDDo|DD?D?D?|ddd?d?|do?|w[o|w]?|W[o|W]?|Qo?|YYYYYY|YYYYY|YYYY|YY|gg(ggg?)?|GG(GGG?)?|e|E|a|A|hh?|HH?|kk?|mm?|ss?|S{1,9}|x|X|zz?|ZZ?|.)/g,
+                  V = /(\[[^\[]*\])|(\\)?(LTS|LT|LL?L?L?|l{1,4})/g,
+                  H = {},
+                  E = {};
+                function B(t, e, i, n) {
+                  var a = n;
+                  "string" == typeof n &&
+                    (a = function () {
+                      return this[n]();
+                    }),
+                    t && (E[t] = a),
+                    e &&
+                      (E[e[0]] = function () {
+                        return N(a.apply(this, arguments), e[1], e[2]);
+                      }),
+                    i &&
+                      (E[i] = function () {
+                        return this.localeData().ordinal(a.apply(this, arguments), t);
+                      });
+                }
+                function j(t, e) {
+                  return t.isValid()
+                    ? ((e = U(e, t.localeData())),
+                      (H[e] =
+                        H[e] ||
+                        (function (t) {
+                          var e,
+                            i,
+                            n,
+                            a = t.match(z);
+                          for (e = 0, i = a.length; e < i; e++)
+                            E[a[e]]
+                              ? (a[e] = E[a[e]])
+                              : (a[e] = (n = a[e]).match(/\[[\s\S]/)
+                                  ? n.replace(/^\[|\]$/g, "")
+                                  : n.replace(/\\/g, ""));
+                          return function (e) {
+                            var n,
+                              r = "";
+                            for (n = 0; n < i; n++) r += T(a[n]) ? a[n].call(e, t) : a[n];
+                            return r;
+                          };
+                        })(e)),
+                      H[e](t))
+                    : t.localeData().invalidDate();
+                }
+                function U(t, e) {
+                  var i = 5;
+                  function n(t) {
+                    return e.longDateFormat(t) || t;
+                  }
+                  for (V.lastIndex = 0; i >= 0 && V.test(t); ) (t = t.replace(V, n)), (V.lastIndex = 0), (i -= 1);
+                  return t;
+                }
+                var G = /\d/,
+                  q = /\d\d/,
+                  Z = /\d{3}/,
+                  $ = /\d{4}/,
+                  X = /[+-]?\d{6}/,
+                  K = /\d\d?/,
+                  J = /\d\d\d\d?/,
+                  Q = /\d\d\d\d\d\d?/,
+                  tt = /\d{1,3}/,
+                  et = /\d{1,4}/,
+                  it = /[+-]?\d{1,6}/,
+                  nt = /\d+/,
+                  at = /[+-]?\d+/,
+                  rt = /Z|[+-]\d\d:?\d\d/gi,
+                  ot = /Z|[+-]\d\d(?::?\d\d)?/gi,
+                  st =
+                    /[0-9]{0,256}['a-z\u00A0-\u05FF\u0700-\uD7FF\uF900-\uFDCF\uFDF0-\uFF07\uFF10-\uFFEF]{1,256}|[\u0600-\u06FF\/]{1,256}(\s*?[\u0600-\u06FF]{1,256}){1,2}/i,
+                  lt = {};
+                function ut(t, e, i) {
+                  lt[t] = T(e)
+                    ? e
+                    : function (t, n) {
+                        return t && i ? i : e;
+                      };
+                }
+                function dt(t, e) {
+                  return d(lt, t)
+                    ? lt[t](e._strict, e._locale)
+                    : new RegExp(
+                        ht(
+                          t.replace("\\", "").replace(/\\(\[)|\\(\])|\[([^\]\[]*)\]|\\(.)/g, function (t, e, i, n, a) {
+                            return e || i || n || a;
+                          })
+                        )
+                      );
+                }
+                function ht(t) {
+                  return t.replace(/[-\/\\^$*+?.()|[\]{}]/g, "\\<!--/*** %%static_metrics%% ***/-->");
+                }
+                var ct = {};
+                function ft(t, e) {
+                  var i,
+                    n = e;
+                  for (
+                    "string" == typeof t && (t = [t]),
+                      s(e) &&
+                        (n = function (t, i) {
+                          i[e] = k(t);
+                        }),
+                      i = 0;
+                    i < t.length;
+                    i++
+                  )
+                    ct[t[i]] = n;
+                }
+                function gt(t, e) {
+                  ft(t, function (t, i, n, a) {
+                    (n._w = n._w || {}), e(t, n._w, n, a);
+                  });
+                }
+                function mt(t, e, i) {
+                  null != e && d(ct, t) && ct[t](e, i._a, i, t);
+                }
+                var pt = 0,
+                  vt = 1,
+                  yt = 2,
+                  bt = 3,
+                  xt = 4,
+                  _t = 5,
+                  kt = 6,
+                  wt = 7,
+                  Mt = 8;
+                function St(t) {
+                  return Dt(t) ? 366 : 365;
+                }
+                function Dt(t) {
+                  return (t % 4 == 0 && t % 100 != 0) || t % 400 == 0;
+                }
+                B("Y", 0, 0, function () {
+                  var t = this.year();
+                  return t <= 9999 ? "" + t : "+" + t;
+                }),
+                  B(0, ["YY", 2], 0, function () {
+                    return this.year() % 100;
+                  }),
+                  B(0, ["YYYY", 4], 0, "year"),
+                  B(0, ["YYYYY", 5], 0, "year"),
+                  B(0, ["YYYYYY", 6, !0], 0, "year"),
+                  F("year", "y"),
+                  Y("year", 1),
+                  ut("Y", at),
+                  ut("YY", K, q),
+                  ut("YYYY", et, $),
+                  ut("YYYYY", it, X),
+                  ut("YYYYYY", it, X),
+                  ft(["YYYYY", "YYYYYY"], pt),
+                  ft("YYYY", function (t, e) {
+                    e[pt] = 2 === t.length ? n.parseTwoDigitYear(t) : k(t);
+                  }),
+                  ft("YY", function (t, e) {
+                    e[pt] = n.parseTwoDigitYear(t);
+                  }),
+                  ft("Y", function (t, e) {
+                    e[pt] = parseInt(t, 10);
+                  }),
+                  (n.parseTwoDigitYear = function (t) {
+                    return k(t) + (k(t) > 68 ? 1900 : 2e3);
+                  });
+                var Ct,
+                  Pt = Tt("FullYear", !0);
+                function Tt(t, e) {
+                  return function (i) {
+                    return null != i ? (It(this, t, i), n.updateOffset(this, e), this) : Ot(this, t);
+                  };
+                }
+                function Ot(t, e) {
+                  return t.isValid() ? t._d["get" + (t._isUTC ? "UTC" : "") + e]() : NaN;
+                }
+                function It(t, e, i) {
+                  t.isValid() &&
+                    !isNaN(i) &&
+                    ("FullYear" === e && Dt(t.year()) && 1 === t.month() && 29 === t.date()
+                      ? t._d["set" + (t._isUTC ? "UTC" : "") + e](i, t.month(), At(i, t.month()))
+                      : t._d["set" + (t._isUTC ? "UTC" : "") + e](i));
+                }
+                function At(t, e) {
+                  if (isNaN(t) || isNaN(e)) return NaN;
+                  var i,
+                    n = ((e % (i = 12)) + i) % i;
+                  return (t += (e - n) / 12), 1 === n ? (Dt(t) ? 29 : 28) : 31 - ((n % 7) % 2);
+                }
+                (Ct = Array.prototype.indexOf
+                  ? Array.prototype.indexOf
+                  : function (t) {
+                      var e;
+                      for (e = 0; e < this.length; ++e) if (this[e] === t) return e;
+                      return -1;
+                    }),
+                  B("M", ["MM", 2], "Mo", function () {
+                    return this.month() + 1;
+                  }),
+                  B("MMM", 0, 0, function (t) {
+                    return this.localeData().monthsShort(this, t);
+                  }),
+                  B("MMMM", 0, 0, function (t) {
+                    return this.localeData().months(this, t);
+                  }),
+                  F("month", "M"),
+                  Y("month", 8),
+                  ut("M", K),
+                  ut("MM", K, q),
+                  ut("MMM", function (t, e) {
+                    return e.monthsShortRegex(t);
+                  }),
+                  ut("MMMM", function (t, e) {
+                    return e.monthsRegex(t);
+                  }),
+                  ft(["M", "MM"], function (t, e) {
+                    e[vt] = k(t) - 1;
+                  }),
+                  ft(["MMM", "MMMM"], function (t, e, i, n) {
+                    var a = i._locale.monthsParse(t, n, i._strict);
+                    null != a ? (e[vt] = a) : (f(i).invalidMonth = t);
+                  });
+                var Ft = /D[oD]?(\[[^\[\]]*\]|\s)+MMMM?/,
+                  Rt = "January_February_March_April_May_June_July_August_September_October_November_December".split(
+                    "_"
+                  ),
+                  Lt = "Jan_Feb_Mar_Apr_May_Jun_Jul_Aug_Sep_Oct_Nov_Dec".split("_");
+                function Wt(t, e) {
+                  var i;
+                  if (!t.isValid()) return t;
+                  if ("string" == typeof e)
+                    if (/^\d+$/.test(e)) e = k(e);
+                    else if (!s((e = t.localeData().monthsParse(e)))) return t;
+                  return (
+                    (i = Math.min(t.date(), At(t.year(), e))), t._d["set" + (t._isUTC ? "UTC" : "") + "Month"](e, i), t
+                  );
+                }
+                function Yt(t) {
+                  return null != t ? (Wt(this, t), n.updateOffset(this, !0), this) : Ot(this, "Month");
+                }
+                var Nt = st,
+                  zt = st;
+                function Vt() {
+                  function t(t, e) {
+                    return e.length - t.length;
+                  }
+                  var e,
+                    i,
+                    n = [],
+                    a = [],
+                    r = [];
+                  for (e = 0; e < 12; e++)
+                    (i = c([2e3, e])),
+                      n.push(this.monthsShort(i, "")),
+                      a.push(this.months(i, "")),
+                      r.push(this.months(i, "")),
+                      r.push(this.monthsShort(i, ""));
+                  for (n.sort(t), a.sort(t), r.sort(t), e = 0; e < 12; e++) (n[e] = ht(n[e])), (a[e] = ht(a[e]));
+                  for (e = 0; e < 24; e++) r[e] = ht(r[e]);
+                  (this._monthsRegex = new RegExp("^(" + r.join("|") + ")", "i")),
+                    (this._monthsShortRegex = this._monthsRegex),
+                    (this._monthsStrictRegex = new RegExp("^(" + a.join("|") + ")", "i")),
+                    (this._monthsShortStrictRegex = new RegExp("^(" + n.join("|") + ")", "i"));
+                }
+                function Ht(t) {
+                  var e;
+                  if (t < 100 && t >= 0) {
+                    var i = Array.prototype.slice.call(arguments);
+                    (i[0] = t + 400),
+                      (e = new Date(Date.UTC.apply(null, i))),
+                      isFinite(e.getUTCFullYear()) && e.setUTCFullYear(t);
+                  } else e = new Date(Date.UTC.apply(null, arguments));
+                  return e;
+                }
+                function Et(t, e, i) {
+                  var n = 7 + e - i,
+                    a = (7 + Ht(t, 0, n).getUTCDay() - e) % 7;
+                  return -a + n - 1;
+                }
+                function Bt(t, e, i, n, a) {
+                  var r,
+                    o,
+                    s = (7 + i - n) % 7,
+                    l = Et(t, n, a),
+                    u = 1 + 7 * (e - 1) + s + l;
+                  return (
+                    u <= 0
+                      ? (o = St((r = t - 1)) + u)
+                      : u > St(t)
+                        ? ((r = t + 1), (o = u - St(t)))
+                        : ((r = t), (o = u)),
+                    { year: r, dayOfYear: o }
+                  );
+                }
+                function jt(t, e, i) {
+                  var n,
+                    a,
+                    r = Et(t.year(), e, i),
+                    o = Math.floor((t.dayOfYear() - r - 1) / 7) + 1;
+                  return (
+                    o < 1
+                      ? ((a = t.year() - 1), (n = o + Ut(a, e, i)))
+                      : o > Ut(t.year(), e, i)
+                        ? ((n = o - Ut(t.year(), e, i)), (a = t.year() + 1))
+                        : ((a = t.year()), (n = o)),
+                    { week: n, year: a }
+                  );
+                }
+                function Ut(t, e, i) {
+                  var n = Et(t, e, i),
+                    a = Et(t + 1, e, i);
+                  return (St(t) - n + a) / 7;
+                }
+                function Gt(t, e) {
+                  return t.slice(e, 7).concat(t.slice(0, e));
+                }
+                B("w", ["ww", 2], "wo", "week"),
+                  B("W", ["WW", 2], "Wo", "isoWeek"),
+                  F("week", "w"),
+                  F("isoWeek", "W"),
+                  Y("week", 5),
+                  Y("isoWeek", 5),
+                  ut("w", K),
+                  ut("ww", K, q),
+                  ut("W", K),
+                  ut("WW", K, q),
+                  gt(["w", "ww", "W", "WW"], function (t, e, i, n) {
+                    e[n.substr(0, 1)] = k(t);
+                  }),
+                  B("d", 0, "do", "day"),
+                  B("dd", 0, 0, function (t) {
+                    return this.localeData().weekdaysMin(this, t);
+                  }),
+                  B("ddd", 0, 0, function (t) {
+                    return this.localeData().weekdaysShort(this, t);
+                  }),
+                  B("dddd", 0, 0, function (t) {
+                    return this.localeData().weekdays(this, t);
+                  }),
+                  B("e", 0, 0, "weekday"),
+                  B("E", 0, 0, "isoWeekday"),
+                  F("day", "d"),
+                  F("weekday", "e"),
+                  F("isoWeekday", "E"),
+                  Y("day", 11),
+                  Y("weekday", 11),
+                  Y("isoWeekday", 11),
+                  ut("d", K),
+                  ut("e", K),
+                  ut("E", K),
+                  ut("dd", function (t, e) {
+                    return e.weekdaysMinRegex(t);
+                  }),
+                  ut("ddd", function (t, e) {
+                    return e.weekdaysShortRegex(t);
+                  }),
+                  ut("dddd", function (t, e) {
+                    return e.weekdaysRegex(t);
+                  }),
+                  gt(["dd", "ddd", "dddd"], function (t, e, i, n) {
+                    var a = i._locale.weekdaysParse(t, n, i._strict);
+                    null != a ? (e.d = a) : (f(i).invalidWeekday = t);
+                  }),
+                  gt(["d", "e", "E"], function (t, e, i, n) {
+                    e[n] = k(t);
+                  });
+                var qt = "Sunday_Monday_Tuesday_Wednesday_Thursday_Friday_Saturday".split("_"),
+                  Zt = "Sun_Mon_Tue_Wed_Thu_Fri_Sat".split("_"),
+                  $t = "Su_Mo_Tu_We_Th_Fr_Sa".split("_"),
+                  Xt = st,
+                  Kt = st,
+                  Jt = st;
+                function Qt() {
+                  function t(t, e) {
+                    return e.length - t.length;
+                  }
+                  var e,
+                    i,
+                    n,
+                    a,
+                    r,
+                    o = [],
+                    s = [],
+                    l = [],
+                    u = [];
+                  for (e = 0; e < 7; e++)
+                    (i = c([2e3, 1]).day(e)),
+                      (n = this.weekdaysMin(i, "")),
+                      (a = this.weekdaysShort(i, "")),
+                      (r = this.weekdays(i, "")),
+                      o.push(n),
+                      s.push(a),
+                      l.push(r),
+                      u.push(n),
+                      u.push(a),
+                      u.push(r);
+                  for (o.sort(t), s.sort(t), l.sort(t), u.sort(t), e = 0; e < 7; e++)
+                    (s[e] = ht(s[e])), (l[e] = ht(l[e])), (u[e] = ht(u[e]));
+                  (this._weekdaysRegex = new RegExp("^(" + u.join("|") + ")", "i")),
+                    (this._weekdaysShortRegex = this._weekdaysRegex),
+                    (this._weekdaysMinRegex = this._weekdaysRegex),
+                    (this._weekdaysStrictRegex = new RegExp("^(" + l.join("|") + ")", "i")),
+                    (this._weekdaysShortStrictRegex = new RegExp("^(" + s.join("|") + ")", "i")),
+                    (this._weekdaysMinStrictRegex = new RegExp("^(" + o.join("|") + ")", "i"));
+                }
+                function te() {
+                  return this.hours() % 12 || 12;
+                }
+                function ee(t, e) {
+                  B(t, 0, 0, function () {
+                    return this.localeData().meridiem(this.hours(), this.minutes(), e);
+                  });
+                }
+                function ie(t, e) {
+                  return e._meridiemParse;
+                }
+                B("H", ["HH", 2], 0, "hour"),
+                  B("h", ["hh", 2], 0, te),
+                  B("k", ["kk", 2], 0, function () {
+                    return this.hours() || 24;
+                  }),
+                  B("hmm", 0, 0, function () {
+                    return "" + te.apply(this) + N(this.minutes(), 2);
+                  }),
+                  B("hmmss", 0, 0, function () {
+                    return "" + te.apply(this) + N(this.minutes(), 2) + N(this.seconds(), 2);
+                  }),
+                  B("Hmm", 0, 0, function () {
+                    return "" + this.hours() + N(this.minutes(), 2);
+                  }),
+                  B("Hmmss", 0, 0, function () {
+                    return "" + this.hours() + N(this.minutes(), 2) + N(this.seconds(), 2);
+                  }),
+                  ee("a", !0),
+                  ee("A", !1),
+                  F("hour", "h"),
+                  Y("hour", 13),
+                  ut("a", ie),
+                  ut("A", ie),
+                  ut("H", K),
+                  ut("h", K),
+                  ut("k", K),
+                  ut("HH", K, q),
+                  ut("hh", K, q),
+                  ut("kk", K, q),
+                  ut("hmm", J),
+                  ut("hmmss", Q),
+                  ut("Hmm", J),
+                  ut("Hmmss", Q),
+                  ft(["H", "HH"], bt),
+                  ft(["k", "kk"], function (t, e, i) {
+                    var n = k(t);
+                    e[bt] = 24 === n ? 0 : n;
+                  }),
+                  ft(["a", "A"], function (t, e, i) {
+                    (i._isPm = i._locale.isPM(t)), (i._meridiem = t);
+                  }),
+                  ft(["h", "hh"], function (t, e, i) {
+                    (e[bt] = k(t)), (f(i).bigHour = !0);
+                  }),
+                  ft("hmm", function (t, e, i) {
+                    var n = t.length - 2;
+                    (e[bt] = k(t.substr(0, n))), (e[xt] = k(t.substr(n))), (f(i).bigHour = !0);
+                  }),
+                  ft("hmmss", function (t, e, i) {
+                    var n = t.length - 4,
+                      a = t.length - 2;
+                    (e[bt] = k(t.substr(0, n))),
+                      (e[xt] = k(t.substr(n, 2))),
+                      (e[_t] = k(t.substr(a))),
+                      (f(i).bigHour = !0);
+                  }),
+                  ft("Hmm", function (t, e, i) {
+                    var n = t.length - 2;
+                    (e[bt] = k(t.substr(0, n))), (e[xt] = k(t.substr(n)));
+                  }),
+                  ft("Hmmss", function (t, e, i) {
+                    var n = t.length - 4,
+                      a = t.length - 2;
+                    (e[bt] = k(t.substr(0, n))), (e[xt] = k(t.substr(n, 2))), (e[_t] = k(t.substr(a)));
+                  });
+                var ne,
+                  ae = Tt("Hours", !0),
+                  re = {
+                    calendar: {
+                      sameDay: "[Today at] LT",
+                      nextDay: "[Tomorrow at] LT",
+                      nextWeek: "dddd [at] LT",
+                      lastDay: "[Yesterday at] LT",
+                      lastWeek: "[Last] dddd [at] LT",
+                      sameElse: "L",
+                    },
+                    longDateFormat: {
+                      LTS: "h:mm:ss A",
+                      LT: "h:mm A",
+                      L: "MM/DD/YYYY",
+                      LL: "MMMM D, YYYY",
+                      LLL: "MMMM D, YYYY h:mm A",
+                      LLLL: "dddd, MMMM D, YYYY h:mm A",
+                    },
+                    invalidDate: "Invalid date",
+                    ordinal: "%d",
+                    dayOfMonthOrdinalParse: /\d{1,2}/,
+                    relativeTime: {
+                      future: "in %s",
+                      past: "%s ago",
+                      s: "a few seconds",
+                      ss: "%d seconds",
+                      m: "a minute",
+                      mm: "%d minutes",
+                      h: "an hour",
+                      hh: "%d hours",
+                      d: "a day",
+                      dd: "%d days",
+                      M: "a month",
+                      MM: "%d months",
+                      y: "a year",
+                      yy: "%d years",
+                    },
+                    months: Rt,
+                    monthsShort: Lt,
+                    week: { dow: 0, doy: 6 },
+                    weekdays: qt,
+                    weekdaysMin: $t,
+                    weekdaysShort: Zt,
+                    meridiemParse: /[ap]\.?m?\.?/i,
+                  },
+                  oe = {},
+                  se = {};
+                function le(t) {
+                  return t ? t.toLowerCase().replace("_", "-") : t;
+                }
+                function ue(e) {
+                  var i = null;
+                  if (!oe[e] && t && t.exports)
+                    try {
+                      i = ne._abbr;
+                      var n = _e;
+                      n("./locale/" + e), de(i);
+                    } catch (t) {}
+                  return oe[e];
+                }
+                function de(t, e) {
+                  var i;
+                  return (
+                    t &&
+                      ((i = o(e) ? ce(t) : he(t, e))
+                        ? (ne = i)
+                        : "undefined" != typeof console &&
+                          console.warn &&
+                          console.warn("Locale " + t + " not found. Did you forget to load it?")),
+                    ne._abbr
+                  );
+                }
+                function he(t, e) {
+                  if (null !== e) {
+                    var i,
+                      n = re;
+                    if (((e.abbr = t), null != oe[t]))
+                      P(
+                        "defineLocaleOverride",
+                        "use moment.updateLocale(localeName, config) to change an existing locale. moment.defineLocale(localeName, config) should only be used for creating a new locale See http://momentjs.com/guides/#/warnings/define-locale/ for more info."
+                      ),
+                        (n = oe[t]._config);
+                    else if (null != e.parentLocale)
+                      if (null != oe[e.parentLocale]) n = oe[e.parentLocale]._config;
+                      else {
+                        if (null == (i = ue(e.parentLocale)))
+                          return (
+                            se[e.parentLocale] || (se[e.parentLocale] = []),
+                            se[e.parentLocale].push({ name: t, config: e }),
+                            null
+                          );
+                        n = i._config;
+                      }
+                    return (
+                      (oe[t] = new I(O(n, e))),
+                      se[t] &&
+                        se[t].forEach(function (t) {
+                          he(t.name, t.config);
+                        }),
+                      de(t),
+                      oe[t]
+                    );
+                  }
+                  return delete oe[t], null;
+                }
+                function ce(t) {
+                  var e;
+                  if ((t && t._locale && t._locale._abbr && (t = t._locale._abbr), !t)) return ne;
+                  if (!a(t)) {
+                    if ((e = ue(t))) return e;
+                    t = [t];
+                  }
+                  return (function (t) {
+                    for (var e, i, n, a, r = 0; r < t.length; ) {
+                      for (
+                        a = le(t[r]).split("-"), e = a.length, i = (i = le(t[r + 1])) ? i.split("-") : null;
+                        e > 0;
+
+                      ) {
+                        if ((n = ue(a.slice(0, e).join("-")))) return n;
+                        if (i && i.length >= e && w(a, i, !0) >= e - 1) break;
+                        e--;
+                      }
+                      r++;
+                    }
+                    return ne;
+                  })(t);
+                }
+                function fe(t) {
+                  var e,
+                    i = t._a;
+                  return (
+                    i &&
+                      -2 === f(t).overflow &&
+                      ((e =
+                        i[vt] < 0 || i[vt] > 11
+                          ? vt
+                          : i[yt] < 1 || i[yt] > At(i[pt], i[vt])
+                            ? yt
+                            : i[bt] < 0 || i[bt] > 24 || (24 === i[bt] && (0 !== i[xt] || 0 !== i[_t] || 0 !== i[kt]))
+                              ? bt
+                              : i[xt] < 0 || i[xt] > 59
+                                ? xt
+                                : i[_t] < 0 || i[_t] > 59
+                                  ? _t
+                                  : i[kt] < 0 || i[kt] > 999
+                                    ? kt
+                                    : -1),
+                      f(t)._overflowDayOfYear && (e < pt || e > yt) && (e = yt),
+                      f(t)._overflowWeeks && -1 === e && (e = wt),
+                      f(t)._overflowWeekday && -1 === e && (e = Mt),
+                      (f(t).overflow = e)),
+                    t
+                  );
+                }
+                function ge(t, e, i) {
+                  return null != t ? t : null != e ? e : i;
+                }
+                function me(t) {
+                  var e,
+                    i,
+                    a,
+                    r,
+                    o,
+                    s = [];
+                  if (!t._d) {
+                    for (
+                      a = (function (t) {
+                        var e = new Date(n.now());
+                        return t._useUTC
+                          ? [e.getUTCFullYear(), e.getUTCMonth(), e.getUTCDate()]
+                          : [e.getFullYear(), e.getMonth(), e.getDate()];
+                      })(t),
+                        t._w &&
+                          null == t._a[yt] &&
+                          null == t._a[vt] &&
+                          (function (t) {
+                            var e, i, n, a, r, o, s, l;
+                            if (null != (e = t._w).GG || null != e.W || null != e.E)
+                              (r = 1),
+                                (o = 4),
+                                (i = ge(e.GG, t._a[pt], jt(Ie(), 1, 4).year)),
+                                (n = ge(e.W, 1)),
+                                ((a = ge(e.E, 1)) < 1 || a > 7) && (l = !0);
+                            else {
+                              (r = t._locale._week.dow), (o = t._locale._week.doy);
+                              var u = jt(Ie(), r, o);
+                              (i = ge(e.gg, t._a[pt], u.year)),
+                                (n = ge(e.w, u.week)),
+                                null != e.d
+                                  ? ((a = e.d) < 0 || a > 6) && (l = !0)
+                                  : null != e.e
+                                    ? ((a = e.e + r), (e.e < 0 || e.e > 6) && (l = !0))
+                                    : (a = r);
+                            }
+                            n < 1 || n > Ut(i, r, o)
+                              ? (f(t)._overflowWeeks = !0)
+                              : null != l
+                                ? (f(t)._overflowWeekday = !0)
+                                : ((s = Bt(i, n, a, r, o)), (t._a[pt] = s.year), (t._dayOfYear = s.dayOfYear));
+                          })(t),
+                        null != t._dayOfYear &&
+                          ((o = ge(t._a[pt], a[pt])),
+                          (t._dayOfYear > St(o) || 0 === t._dayOfYear) && (f(t)._overflowDayOfYear = !0),
+                          (i = Ht(o, 0, t._dayOfYear)),
+                          (t._a[vt] = i.getUTCMonth()),
+                          (t._a[yt] = i.getUTCDate())),
+                        e = 0;
+                      e < 3 && null == t._a[e];
+                      ++e
+                    )
+                      t._a[e] = s[e] = a[e];
+                    for (; e < 7; e++) t._a[e] = s[e] = null == t._a[e] ? (2 === e ? 1 : 0) : t._a[e];
+                    24 === t._a[bt] &&
+                      0 === t._a[xt] &&
+                      0 === t._a[_t] &&
+                      0 === t._a[kt] &&
+                      ((t._nextDay = !0), (t._a[bt] = 0)),
+                      (t._d = (
+                        t._useUTC
+                          ? Ht
+                          : function (t, e, i, n, a, r, o) {
+                              var s;
+                              return (
+                                t < 100 && t >= 0
+                                  ? ((s = new Date(t + 400, e, i, n, a, r, o)),
+                                    isFinite(s.getFullYear()) && s.setFullYear(t))
+                                  : (s = new Date(t, e, i, n, a, r, o)),
+                                s
+                              );
+                            }
+                      ).apply(null, s)),
+                      (r = t._useUTC ? t._d.getUTCDay() : t._d.getDay()),
+                      null != t._tzm && t._d.setUTCMinutes(t._d.getUTCMinutes() - t._tzm),
+                      t._nextDay && (t._a[bt] = 24),
+                      t._w && void 0 !== t._w.d && t._w.d !== r && (f(t).weekdayMismatch = !0);
+                  }
+                }
+                var pe =
+                    /^\s*((?:[+-]\d{6}|\d{4})-(?:\d\d-\d\d|W\d\d-\d|W\d\d|\d\d\d|\d\d))(?:(T| )(\d\d(?::\d\d(?::\d\d(?:[.,]\d+)?)?)?)([\+\-]\d\d(?::?\d\d)?|\s*Z)?)?$/,
+                  ve =
+                    /^\s*((?:[+-]\d{6}|\d{4})(?:\d\d\d\d|W\d\d\d|W\d\d|\d\d\d|\d\d))(?:(T| )(\d\d(?:\d\d(?:\d\d(?:[.,]\d+)?)?)?)([\+\-]\d\d(?::?\d\d)?|\s*Z)?)?$/,
+                  ye = /Z|[+-]\d\d(?::?\d\d)?/,
+                  be = [
+                    ["YYYYYY-MM-DD", /[+-]\d{6}-\d\d-\d\d/],
+                    ["YYYY-MM-DD", /\d{4}-\d\d-\d\d/],
+                    ["GGGG-[W]WW-E", /\d{4}-W\d\d-\d/],
+                    ["GGGG-[W]WW", /\d{4}-W\d\d/, !1],
+                    ["YYYY-DDD", /\d{4}-\d{3}/],
+                    ["YYYY-MM", /\d{4}-\d\d/, !1],
+                    ["YYYYYYMMDD", /[+-]\d{10}/],
+                    ["YYYYMMDD", /\d{8}/],
+                    ["GGGG[W]WWE", /\d{4}W\d{3}/],
+                    ["GGGG[W]WW", /\d{4}W\d{2}/, !1],
+                    ["YYYYDDD", /\d{7}/],
+                  ],
+                  xe = [
+                    ["HH:mm:ss.SSSS", /\d\d:\d\d:\d\d\.\d+/],
+                    ["HH:mm:ss,SSSS", /\d\d:\d\d:\d\d,\d+/],
+                    ["HH:mm:ss", /\d\d:\d\d:\d\d/],
+                    ["HH:mm", /\d\d:\d\d/],
+                    ["HHmmss.SSSS", /\d\d\d\d\d\d\.\d+/],
+                    ["HHmmss,SSSS", /\d\d\d\d\d\d,\d+/],
+                    ["HHmmss", /\d\d\d\d\d\d/],
+                    ["HHmm", /\d\d\d\d/],
+                    ["HH", /\d\d/],
+                  ],
+                  ke = /^\/?Date\((\-?\d+)/i;
+                function we(t) {
+                  var e,
+                    i,
+                    n,
+                    a,
+                    r,
+                    o,
+                    s = t._i,
+                    l = pe.exec(s) || ve.exec(s);
+                  if (l) {
+                    for (f(t).iso = !0, e = 0, i = be.length; e < i; e++)
+                      if (be[e][1].exec(l[1])) {
+                        (a = be[e][0]), (n = !1 !== be[e][2]);
+                        break;
+                      }
+                    if (null == a) return void (t._isValid = !1);
+                    if (l[3]) {
+                      for (e = 0, i = xe.length; e < i; e++)
+                        if (xe[e][1].exec(l[3])) {
+                          r = (l[2] || " ") + xe[e][0];
+                          break;
+                        }
+                      if (null == r) return void (t._isValid = !1);
+                    }
+                    if (!n && null != r) return void (t._isValid = !1);
+                    if (l[4]) {
+                      if (!ye.exec(l[4])) return void (t._isValid = !1);
+                      o = "Z";
+                    }
+                    (t._f = a + (r || "") + (o || "")), Pe(t);
+                  } else t._isValid = !1;
+                }
+                var Me =
+                  /^(?:(Mon|Tue|Wed|Thu|Fri|Sat|Sun),?\s)?(\d{1,2})\s(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)\s(\d{2,4})\s(\d\d):(\d\d)(?::(\d\d))?\s(?:(UT|GMT|[ECMP][SD]T)|([Zz])|([+-]\d{4}))$/;
+                function Se(t) {
+                  var e = parseInt(t, 10);
+                  return e <= 49 ? 2e3 + e : e <= 999 ? 1900 + e : e;
+                }
+                var De = {
+                  UT: 0,
+                  GMT: 0,
+                  EDT: -240,
+                  EST: -300,
+                  CDT: -300,
+                  CST: -360,
+                  MDT: -360,
+                  MST: -420,
+                  PDT: -420,
+                  PST: -480,
+                };
+                function Ce(t) {
+                  var e,
+                    i,
+                    n,
+                    a,
+                    r,
+                    o,
+                    s,
+                    l = Me.exec(
+                      t._i
+                        .replace(/\([^)]*\)|[\n\t]/g, " ")
+                        .replace(/(\s\s+)/g, " ")
+                        .replace(/^\s\s*/, "")
+                        .replace(/\s\s*$/, "")
+                    );
+                  if (l) {
+                    var u =
+                      ((e = l[4]),
+                      (i = l[3]),
+                      (n = l[2]),
+                      (a = l[5]),
+                      (r = l[6]),
+                      (o = l[7]),
+                      (s = [Se(e), Lt.indexOf(i), parseInt(n, 10), parseInt(a, 10), parseInt(r, 10)]),
+                      o && s.push(parseInt(o, 10)),
+                      s);
+                    if (
+                      !(function (t, e, i) {
+                        if (t) {
+                          var n = Zt.indexOf(t),
+                            a = new Date(e[0], e[1], e[2]).getDay();
+                          if (n !== a) return (f(i).weekdayMismatch = !0), (i._isValid = !1), !1;
+                        }
+                        return !0;
+                      })(l[1], u, t)
+                    )
+                      return;
+                    (t._a = u),
+                      (t._tzm = (function (t, e, i) {
+                        if (t) return De[t];
+                        if (e) return 0;
+                        var n = parseInt(i, 10),
+                          a = n % 100,
+                          r = (n - a) / 100;
+                        return 60 * r + a;
+                      })(l[8], l[9], l[10])),
+                      (t._d = Ht.apply(null, t._a)),
+                      t._d.setUTCMinutes(t._d.getUTCMinutes() - t._tzm),
+                      (f(t).rfc2822 = !0);
+                  } else t._isValid = !1;
+                }
+                function Pe(t) {
+                  if (t._f !== n.ISO_8601)
+                    if (t._f !== n.RFC_2822) {
+                      (t._a = []), (f(t).empty = !0);
+                      var e,
+                        i,
+                        a,
+                        r,
+                        o,
+                        s = "" + t._i,
+                        l = s.length,
+                        u = 0;
+                      for (a = U(t._f, t._locale).match(z) || [], e = 0; e < a.length; e++)
+                        (r = a[e]),
+                          (i = (s.match(dt(r, t)) || [])[0]) &&
+                            ((o = s.substr(0, s.indexOf(i))).length > 0 && f(t).unusedInput.push(o),
+                            (s = s.slice(s.indexOf(i) + i.length)),
+                            (u += i.length)),
+                          E[r]
+                            ? (i ? (f(t).empty = !1) : f(t).unusedTokens.push(r), mt(r, i, t))
+                            : t._strict && !i && f(t).unusedTokens.push(r);
+                      (f(t).charsLeftOver = l - u),
+                        s.length > 0 && f(t).unusedInput.push(s),
+                        t._a[bt] <= 12 && !0 === f(t).bigHour && t._a[bt] > 0 && (f(t).bigHour = void 0),
+                        (f(t).parsedDateParts = t._a.slice(0)),
+                        (f(t).meridiem = t._meridiem),
+                        (t._a[bt] =
+                          ((d = t._locale),
+                          (h = t._a[bt]),
+                          null == (c = t._meridiem)
+                            ? h
+                            : null != d.meridiemHour
+                              ? d.meridiemHour(h, c)
+                              : null != d.isPM
+                                ? ((g = d.isPM(c)) && h < 12 && (h += 12), g || 12 !== h || (h = 0), h)
+                                : h)),
+                        me(t),
+                        fe(t);
+                    } else Ce(t);
+                  else we(t);
+                  var d, h, c, g;
+                }
+                function Te(t) {
+                  var e = t._i,
+                    i = t._f;
+                  return (
+                    (t._locale = t._locale || ce(t._l)),
+                    null === e || (void 0 === i && "" === e)
+                      ? m({ nullInput: !0 })
+                      : ("string" == typeof e && (t._i = e = t._locale.preparse(e)),
+                        x(e)
+                          ? new b(fe(e))
+                          : (l(e)
+                              ? (t._d = e)
+                              : a(i)
+                                ? (function (t) {
+                                    var e, i, n, a, r;
+                                    if (0 === t._f.length)
+                                      return (f(t).invalidFormat = !0), void (t._d = new Date(NaN));
+                                    for (a = 0; a < t._f.length; a++)
+                                      (r = 0),
+                                        (e = v({}, t)),
+                                        null != t._useUTC && (e._useUTC = t._useUTC),
+                                        (e._f = t._f[a]),
+                                        Pe(e),
+                                        g(e) &&
+                                          ((r += f(e).charsLeftOver),
+                                          (r += 10 * f(e).unusedTokens.length),
+                                          (f(e).score = r),
+                                          (null == n || r < n) && ((n = r), (i = e)));
+                                    h(t, i || e);
+                                  })(t)
+                                : i
+                                  ? Pe(t)
+                                  : (function (t) {
+                                      var e = t._i;
+                                      o(e)
+                                        ? (t._d = new Date(n.now()))
+                                        : l(e)
+                                          ? (t._d = new Date(e.valueOf()))
+                                          : "string" == typeof e
+                                            ? (function (t) {
+                                                var e = ke.exec(t._i);
+                                                null === e
+                                                  ? (we(t),
+                                                    !1 === t._isValid &&
+                                                      (delete t._isValid,
+                                                      Ce(t),
+                                                      !1 === t._isValid &&
+                                                        (delete t._isValid, n.createFromInputFallback(t))))
+                                                  : (t._d = new Date(+e[1]));
+                                              })(t)
+                                            : a(e)
+                                              ? ((t._a = u(e.slice(0), function (t) {
+                                                  return parseInt(t, 10);
+                                                })),
+                                                me(t))
+                                              : r(e)
+                                                ? (function (t) {
+                                                    if (!t._d) {
+                                                      var e = L(t._i);
+                                                      (t._a = u(
+                                                        [
+                                                          e.year,
+                                                          e.month,
+                                                          e.day || e.date,
+                                                          e.hour,
+                                                          e.minute,
+                                                          e.second,
+                                                          e.millisecond,
+                                                        ],
+                                                        function (t) {
+                                                          return t && parseInt(t, 10);
+                                                        }
+                                                      )),
+                                                        me(t);
+                                                    }
+                                                  })(t)
+                                                : s(e)
+                                                  ? (t._d = new Date(e))
+                                                  : n.createFromInputFallback(t);
+                                    })(t),
+                            g(t) || (t._d = null),
+                            t))
+                  );
+                }
+                function Oe(t, e, i, n, o) {
+                  var s,
+                    l = {};
+                  return (
+                    (!0 !== i && !1 !== i) || ((n = i), (i = void 0)),
+                    ((r(t) &&
+                      (function (t) {
+                        if (Object.getOwnPropertyNames) return 0 === Object.getOwnPropertyNames(t).length;
+                        var e;
+                        for (e in t) if (t.hasOwnProperty(e)) return !1;
+                        return !0;
+                      })(t)) ||
+                      (a(t) && 0 === t.length)) &&
+                      (t = void 0),
+                    (l._isAMomentObject = !0),
+                    (l._useUTC = l._isUTC = o),
+                    (l._l = i),
+                    (l._i = t),
+                    (l._f = e),
+                    (l._strict = n),
+                    (s = new b(fe(Te(l))))._nextDay && (s.add(1, "d"), (s._nextDay = void 0)),
+                    s
+                  );
+                }
+                function Ie(t, e, i, n) {
+                  return Oe(t, e, i, n, !1);
+                }
+                (n.createFromInputFallback = S(
+                  "value provided is not in a recognized RFC2822 or ISO format. moment construction falls back to js Date(), which is not reliable across all browsers and versions. Non RFC2822/ISO date formats are discouraged and will be removed in an upcoming major release. Please refer to http://momentjs.com/guides/#/warnings/js-date/ for more info.",
+                  function (t) {
+                    t._d = new Date(t._i + (t._useUTC ? " UTC" : ""));
+                  }
+                )),
+                  (n.ISO_8601 = function () {}),
+                  (n.RFC_2822 = function () {});
+                var Ae = S(
+                    "moment().min is deprecated, use moment.max instead. http://momentjs.com/guides/#/warnings/min-max/",
+                    function () {
+                      var t = Ie.apply(null, arguments);
+                      return this.isValid() && t.isValid() ? (t < this ? this : t) : m();
+                    }
+                  ),
+                  Fe = S(
+                    "moment().max is deprecated, use moment.min instead. http://momentjs.com/guides/#/warnings/min-max/",
+                    function () {
+                      var t = Ie.apply(null, arguments);
+                      return this.isValid() && t.isValid() ? (t > this ? this : t) : m();
+                    }
+                  );
+                function Re(t, e) {
+                  var i, n;
+                  if ((1 === e.length && a(e[0]) && (e = e[0]), !e.length)) return Ie();
+                  for (i = e[0], n = 1; n < e.length; ++n) (e[n].isValid() && !e[n][t](i)) || (i = e[n]);
+                  return i;
+                }
+                var Le = ["year", "quarter", "month", "week", "day", "hour", "minute", "second", "millisecond"];
+                function We(t) {
+                  var e = L(t),
+                    i = e.year || 0,
+                    n = e.quarter || 0,
+                    a = e.month || 0,
+                    r = e.week || e.isoWeek || 0,
+                    o = e.day || 0,
+                    s = e.hour || 0,
+                    l = e.minute || 0,
+                    u = e.second || 0,
+                    d = e.millisecond || 0;
+                  (this._isValid = (function (t) {
+                    for (var e in t) if (-1 === Ct.call(Le, e) || (null != t[e] && isNaN(t[e]))) return !1;
+                    for (var i = !1, n = 0; n < Le.length; ++n)
+                      if (t[Le[n]]) {
+                        if (i) return !1;
+                        parseFloat(t[Le[n]]) !== k(t[Le[n]]) && (i = !0);
+                      }
+                    return !0;
+                  })(e)),
+                    (this._milliseconds = +d + 1e3 * u + 6e4 * l + 1e3 * s * 60 * 60),
+                    (this._days = +o + 7 * r),
+                    (this._months = +a + 3 * n + 12 * i),
+                    (this._data = {}),
+                    (this._locale = ce()),
+                    this._bubble();
+                }
+                function Ye(t) {
+                  return t instanceof We;
+                }
+                function Ne(t) {
+                  return t < 0 ? -1 * Math.round(-1 * t) : Math.round(t);
+                }
+                function ze(t, e) {
+                  B(t, 0, 0, function () {
+                    var t = this.utcOffset(),
+                      i = "+";
+                    return t < 0 && ((t = -t), (i = "-")), i + N(~~(t / 60), 2) + e + N(~~t % 60, 2);
+                  });
+                }
+                ze("Z", ":"),
+                  ze("ZZ", ""),
+                  ut("Z", ot),
+                  ut("ZZ", ot),
+                  ft(["Z", "ZZ"], function (t, e, i) {
+                    (i._useUTC = !0), (i._tzm = He(ot, t));
+                  });
+                var Ve = /([\+\-]|\d\d)/gi;
+                function He(t, e) {
+                  var i = (e || "").match(t);
+                  if (null === i) return null;
+                  var n = i[i.length - 1] || [],
+                    a = (n + "").match(Ve) || ["-", 0, 0],
+                    r = 60 * a[1] + k(a[2]);
+                  return 0 === r ? 0 : "+" === a[0] ? r : -r;
+                }
+                function Ee(t, e) {
+                  var i, a;
+                  return e._isUTC
+                    ? ((i = e.clone()),
+                      (a = (x(t) || l(t) ? t.valueOf() : Ie(t).valueOf()) - i.valueOf()),
+                      i._d.setTime(i._d.valueOf() + a),
+                      n.updateOffset(i, !1),
+                      i)
+                    : Ie(t).local();
+                }
+                function Be(t) {
+                  return 15 * -Math.round(t._d.getTimezoneOffset() / 15);
+                }
+                function je() {
+                  return !!this.isValid() && this._isUTC && 0 === this._offset;
+                }
+                n.updateOffset = function () {};
+                var Ue = /^(\-|\+)?(?:(\d*)[. ])?(\d+)\:(\d+)(?:\:(\d+)(\.\d*)?)?$/,
+                  Ge =
+                    /^(-|\+)?P(?:([-+]?[0-9,.]*)Y)?(?:([-+]?[0-9,.]*)M)?(?:([-+]?[0-9,.]*)W)?(?:([-+]?[0-9,.]*)D)?(?:T(?:([-+]?[0-9,.]*)H)?(?:([-+]?[0-9,.]*)M)?(?:([-+]?[0-9,.]*)S)?)?$/;
+                function qe(t, e) {
+                  var i,
+                    n,
+                    a,
+                    r,
+                    o,
+                    l,
+                    u = t,
+                    h = null;
+                  return (
+                    Ye(t)
+                      ? (u = { ms: t._milliseconds, d: t._days, M: t._months })
+                      : s(t)
+                        ? ((u = {}), e ? (u[e] = t) : (u.milliseconds = t))
+                        : (h = Ue.exec(t))
+                          ? ((i = "-" === h[1] ? -1 : 1),
+                            (u = {
+                              y: 0,
+                              d: k(h[yt]) * i,
+                              h: k(h[bt]) * i,
+                              m: k(h[xt]) * i,
+                              s: k(h[_t]) * i,
+                              ms: k(Ne(1e3 * h[kt])) * i,
+                            }))
+                          : (h = Ge.exec(t))
+                            ? ((i = "-" === h[1] ? -1 : 1),
+                              (u = {
+                                y: Ze(h[2], i),
+                                M: Ze(h[3], i),
+                                w: Ze(h[4], i),
+                                d: Ze(h[5], i),
+                                h: Ze(h[6], i),
+                                m: Ze(h[7], i),
+                                s: Ze(h[8], i),
+                              }))
+                            : null == u
+                              ? (u = {})
+                              : "object" == typeof u &&
+                                ("from" in u || "to" in u) &&
+                                ((r = Ie(u.from)),
+                                (o = Ie(u.to)),
+                                (a =
+                                  r.isValid() && o.isValid()
+                                    ? ((o = Ee(o, r)),
+                                      r.isBefore(o)
+                                        ? (l = $e(r, o))
+                                        : (((l = $e(o, r)).milliseconds = -l.milliseconds), (l.months = -l.months)),
+                                      l)
+                                    : { milliseconds: 0, months: 0 }),
+                                ((u = {}).ms = a.milliseconds),
+                                (u.M = a.months)),
+                    (n = new We(u)),
+                    Ye(t) && d(t, "_locale") && (n._locale = t._locale),
+                    n
+                  );
+                }
+                function Ze(t, e) {
+                  var i = t && parseFloat(t.replace(",", "."));
+                  return (isNaN(i) ? 0 : i) * e;
+                }
+                function $e(t, e) {
+                  var i = {};
+                  return (
+                    (i.months = e.month() - t.month() + 12 * (e.year() - t.year())),
+                    t.clone().add(i.months, "M").isAfter(e) && --i.months,
+                    (i.milliseconds = +e - +t.clone().add(i.months, "M")),
+                    i
+                  );
+                }
+                function Xe(t, e) {
+                  return function (i, n) {
+                    var a;
+                    return (
+                      null === n ||
+                        isNaN(+n) ||
+                        (P(
+                          e,
+                          "moment()." +
+                            e +
+                            "(period, number) is deprecated. Please use moment()." +
+                            e +
+                            "(number, period). See http://momentjs.com/guides/#/warnings/add-inverted-param/ for more info."
+                        ),
+                        (a = i),
+                        (i = n),
+                        (n = a)),
+                      Ke(this, qe((i = "string" == typeof i ? +i : i), n), t),
+                      this
+                    );
+                  };
+                }
+                function Ke(t, e, i, a) {
+                  var r = e._milliseconds,
+                    o = Ne(e._days),
+                    s = Ne(e._months);
+                  t.isValid() &&
+                    ((a = null == a || a),
+                    s && Wt(t, Ot(t, "Month") + s * i),
+                    o && It(t, "Date", Ot(t, "Date") + o * i),
+                    r && t._d.setTime(t._d.valueOf() + r * i),
+                    a && n.updateOffset(t, o || s));
+                }
+                (qe.fn = We.prototype),
+                  (qe.invalid = function () {
+                    return qe(NaN);
+                  });
+                var Je = Xe(1, "add"),
+                  Qe = Xe(-1, "subtract");
+                function ti(t, e) {
+                  var i,
+                    n,
+                    a = 12 * (e.year() - t.year()) + (e.month() - t.month()),
+                    r = t.clone().add(a, "months");
+                  return (
+                    e - r < 0
+                      ? ((i = t.clone().add(a - 1, "months")), (n = (e - r) / (r - i)))
+                      : ((i = t.clone().add(a + 1, "months")), (n = (e - r) / (i - r))),
+                    -(a + n) || 0
+                  );
+                }
+                function ei(t) {
+                  var e;
+                  return void 0 === t ? this._locale._abbr : (null != (e = ce(t)) && (this._locale = e), this);
+                }
+                (n.defaultFormat = "YYYY-MM-DDTHH:mm:ssZ"), (n.defaultFormatUtc = "YYYY-MM-DDTHH:mm:ss[Z]");
+                var ii = S(
+                  "moment().lang() is deprecated. Instead, use moment().localeData() to get the language configuration. Use moment().locale() to change languages.",
+                  function (t) {
+                    return void 0 === t ? this.localeData() : this.locale(t);
+                  }
+                );
+                function ni() {
+                  return this._locale;
+                }
+                var ai = 1e3,
+                  ri = 60 * ai,
+                  oi = 60 * ri,
+                  si = 3506328 * oi;
+                function li(t, e) {
+                  return ((t % e) + e) % e;
+                }
+                function ui(t, e, i) {
+                  return t < 100 && t >= 0 ? new Date(t + 400, e, i) - si : new Date(t, e, i).valueOf();
+                }
+                function di(t, e, i) {
+                  return t < 100 && t >= 0 ? Date.UTC(t + 400, e, i) - si : Date.UTC(t, e, i);
+                }
+                function hi(t, e) {
+                  B(0, [t, t.length], 0, e);
+                }
+                function ci(t, e, i, n, a) {
+                  var r;
+                  return null == t
+                    ? jt(this, n, a).year
+                    : ((r = Ut(t, n, a)),
+                      e > r && (e = r),
+                      function (t, e, i, n, a) {
+                        var r = Bt(t, e, i, n, a),
+                          o = Ht(r.year, 0, r.dayOfYear);
+                        return (
+                          this.year(o.getUTCFullYear()), this.month(o.getUTCMonth()), this.date(o.getUTCDate()), this
+                        );
+                      }.call(this, t, e, i, n, a));
+                }
+                B(0, ["gg", 2], 0, function () {
+                  return this.weekYear() % 100;
+                }),
+                  B(0, ["GG", 2], 0, function () {
+                    return this.isoWeekYear() % 100;
+                  }),
+                  hi("gggg", "weekYear"),
+                  hi("ggggg", "weekYear"),
+                  hi("GGGG", "isoWeekYear"),
+                  hi("GGGGG", "isoWeekYear"),
+                  F("weekYear", "gg"),
+                  F("isoWeekYear", "GG"),
+                  Y("weekYear", 1),
+                  Y("isoWeekYear", 1),
+                  ut("G", at),
+                  ut("g", at),
+                  ut("GG", K, q),
+                  ut("gg", K, q),
+                  ut("GGGG", et, $),
+                  ut("gggg", et, $),
+                  ut("GGGGG", it, X),
+                  ut("ggggg", it, X),
+                  gt(["gggg", "ggggg", "GGGG", "GGGGG"], function (t, e, i, n) {
+                    e[n.substr(0, 2)] = k(t);
+                  }),
+                  gt(["gg", "GG"], function (t, e, i, a) {
+                    e[a] = n.parseTwoDigitYear(t);
+                  }),
+                  B("Q", 0, "Qo", "quarter"),
+                  F("quarter", "Q"),
+                  Y("quarter", 7),
+                  ut("Q", G),
+                  ft("Q", function (t, e) {
+                    e[vt] = 3 * (k(t) - 1);
+                  }),
+                  B("D", ["DD", 2], "Do", "date"),
+                  F("date", "D"),
+                  Y("date", 9),
+                  ut("D", K),
+                  ut("DD", K, q),
+                  ut("Do", function (t, e) {
+                    return t ? e._dayOfMonthOrdinalParse || e._ordinalParse : e._dayOfMonthOrdinalParseLenient;
+                  }),
+                  ft(["D", "DD"], yt),
+                  ft("Do", function (t, e) {
+                    e[yt] = k(t.match(K)[0]);
+                  });
+                var fi = Tt("Date", !0);
+                B("DDD", ["DDDD", 3], "DDDo", "dayOfYear"),
+                  F("dayOfYear", "DDD"),
+                  Y("dayOfYear", 4),
+                  ut("DDD", tt),
+                  ut("DDDD", Z),
+                  ft(["DDD", "DDDD"], function (t, e, i) {
+                    i._dayOfYear = k(t);
+                  }),
+                  B("m", ["mm", 2], 0, "minute"),
+                  F("minute", "m"),
+                  Y("minute", 14),
+                  ut("m", K),
+                  ut("mm", K, q),
+                  ft(["m", "mm"], xt);
+                var gi = Tt("Minutes", !1);
+                B("s", ["ss", 2], 0, "second"),
+                  F("second", "s"),
+                  Y("second", 15),
+                  ut("s", K),
+                  ut("ss", K, q),
+                  ft(["s", "ss"], _t);
+                var mi,
+                  pi = Tt("Seconds", !1);
+                for (
+                  B("S", 0, 0, function () {
+                    return ~~(this.millisecond() / 100);
+                  }),
+                    B(0, ["SS", 2], 0, function () {
+                      return ~~(this.millisecond() / 10);
+                    }),
+                    B(0, ["SSS", 3], 0, "millisecond"),
+                    B(0, ["SSSS", 4], 0, function () {
+                      return 10 * this.millisecond();
+                    }),
+                    B(0, ["SSSSS", 5], 0, function () {
+                      return 100 * this.millisecond();
+                    }),
+                    B(0, ["SSSSSS", 6], 0, function () {
+                      return 1e3 * this.millisecond();
+                    }),
+                    B(0, ["SSSSSSS", 7], 0, function () {
+                      return 1e4 * this.millisecond();
+                    }),
+                    B(0, ["SSSSSSSS", 8], 0, function () {
+                      return 1e5 * this.millisecond();
+                    }),
+                    B(0, ["SSSSSSSSS", 9], 0, function () {
+                      return 1e6 * this.millisecond();
+                    }),
+                    F("millisecond", "ms"),
+                    Y("millisecond", 16),
+                    ut("S", tt, G),
+                    ut("SS", tt, q),
+                    ut("SSS", tt, Z),
+                    mi = "SSSS";
+                  mi.length <= 9;
+                  mi += "S"
+                )
+                  ut(mi, nt);
+                function vi(t, e) {
+                  e[kt] = k(1e3 * ("0." + t));
+                }
+                for (mi = "S"; mi.length <= 9; mi += "S") ft(mi, vi);
+                var yi = Tt("Milliseconds", !1);
+                B("z", 0, 0, "zoneAbbr"), B("zz", 0, 0, "zoneName");
+                var bi = b.prototype;
+                function xi(t) {
+                  return t;
+                }
+                (bi.add = Je),
+                  (bi.calendar = function (t, e) {
+                    var i = t || Ie(),
+                      a = Ee(i, this).startOf("day"),
+                      r = n.calendarFormat(this, a) || "sameElse",
+                      o = e && (T(e[r]) ? e[r].call(this, i) : e[r]);
+                    return this.format(o || this.localeData().calendar(r, this, Ie(i)));
+                  }),
+                  (bi.clone = function () {
+                    return new b(this);
+                  }),
+                  (bi.diff = function (t, e, i) {
+                    var n, a, r;
+                    if (!this.isValid()) return NaN;
+                    if (!(n = Ee(t, this)).isValid()) return NaN;
+                    switch (((a = 6e4 * (n.utcOffset() - this.utcOffset())), (e = R(e)))) {
+                      case "year":
+                        r = ti(this, n) / 12;
+                        break;
+                      case "month":
+                        r = ti(this, n);
+                        break;
+                      case "quarter":
+                        r = ti(this, n) / 3;
+                        break;
+                      case "second":
+                        r = (this - n) / 1e3;
+                        break;
+                      case "minute":
+                        r = (this - n) / 6e4;
+                        break;
+                      case "hour":
+                        r = (this - n) / 36e5;
+                        break;
+                      case "day":
+                        r = (this - n - a) / 864e5;
+                        break;
+                      case "week":
+                        r = (this - n - a) / 6048e5;
+                        break;
+                      default:
+                        r = this - n;
+                    }
+                    return i ? r : _(r);
+                  }),
+                  (bi.endOf = function (t) {
+                    var e;
+                    if (void 0 === (t = R(t)) || "millisecond" === t || !this.isValid()) return this;
+                    var i = this._isUTC ? di : ui;
+                    switch (t) {
+                      case "year":
+                        e = i(this.year() + 1, 0, 1) - 1;
+                        break;
+                      case "quarter":
+                        e = i(this.year(), this.month() - (this.month() % 3) + 3, 1) - 1;
+                        break;
+                      case "month":
+                        e = i(this.year(), this.month() + 1, 1) - 1;
+                        break;
+                      case "week":
+                        e = i(this.year(), this.month(), this.date() - this.weekday() + 7) - 1;
+                        break;
+                      case "isoWeek":
+                        e = i(this.year(), this.month(), this.date() - (this.isoWeekday() - 1) + 7) - 1;
+                        break;
+                      case "day":
+                      case "date":
+                        e = i(this.year(), this.month(), this.date() + 1) - 1;
+                        break;
+                      case "hour":
+                        (e = this._d.valueOf()), (e += oi - li(e + (this._isUTC ? 0 : this.utcOffset() * ri), oi) - 1);
+                        break;
+                      case "minute":
+                        (e = this._d.valueOf()), (e += ri - li(e, ri) - 1);
+                        break;
+                      case "second":
+                        (e = this._d.valueOf()), (e += ai - li(e, ai) - 1);
+                    }
+                    return this._d.setTime(e), n.updateOffset(this, !0), this;
+                  }),
+                  (bi.format = function (t) {
+                    t || (t = this.isUtc() ? n.defaultFormatUtc : n.defaultFormat);
+                    var e = j(this, t);
+                    return this.localeData().postformat(e);
+                  }),
+                  (bi.from = function (t, e) {
+                    return this.isValid() && ((x(t) && t.isValid()) || Ie(t).isValid())
+                      ? qe({ to: this, from: t }).locale(this.locale()).humanize(!e)
+                      : this.localeData().invalidDate();
+                  }),
+                  (bi.fromNow = function (t) {
+                    return this.from(Ie(), t);
+                  }),
+                  (bi.to = function (t, e) {
+                    return this.isValid() && ((x(t) && t.isValid()) || Ie(t).isValid())
+                      ? qe({ from: this, to: t }).locale(this.locale()).humanize(!e)
+                      : this.localeData().invalidDate();
+                  }),
+                  (bi.toNow = function (t) {
+                    return this.to(Ie(), t);
+                  }),
+                  (bi.get = function (t) {
+                    return T(this[(t = R(t))]) ? this[t]() : this;
+                  }),
+                  (bi.invalidAt = function () {
+                    return f(this).overflow;
+                  }),
+                  (bi.isAfter = function (t, e) {
+                    var i = x(t) ? t : Ie(t);
+                    return (
+                      !(!this.isValid() || !i.isValid()) &&
+                      ("millisecond" === (e = R(e) || "millisecond")
+                        ? this.valueOf() > i.valueOf()
+                        : i.valueOf() < this.clone().startOf(e).valueOf())
+                    );
+                  }),
+                  (bi.isBefore = function (t, e) {
+                    var i = x(t) ? t : Ie(t);
+                    return (
+                      !(!this.isValid() || !i.isValid()) &&
+                      ("millisecond" === (e = R(e) || "millisecond")
+                        ? this.valueOf() < i.valueOf()
+                        : this.clone().endOf(e).valueOf() < i.valueOf())
+                    );
+                  }),
+                  (bi.isBetween = function (t, e, i, n) {
+                    var a = x(t) ? t : Ie(t),
+                      r = x(e) ? e : Ie(e);
+                    return (
+                      !!(this.isValid() && a.isValid() && r.isValid()) &&
+                      ("(" === (n = n || "()")[0] ? this.isAfter(a, i) : !this.isBefore(a, i)) &&
+                      (")" === n[1] ? this.isBefore(r, i) : !this.isAfter(r, i))
+                    );
+                  }),
+                  (bi.isSame = function (t, e) {
+                    var i,
+                      n = x(t) ? t : Ie(t);
+                    return (
+                      !(!this.isValid() || !n.isValid()) &&
+                      ("millisecond" === (e = R(e) || "millisecond")
+                        ? this.valueOf() === n.valueOf()
+                        : ((i = n.valueOf()),
+                          this.clone().startOf(e).valueOf() <= i && i <= this.clone().endOf(e).valueOf()))
+                    );
+                  }),
+                  (bi.isSameOrAfter = function (t, e) {
+                    return this.isSame(t, e) || this.isAfter(t, e);
+                  }),
+                  (bi.isSameOrBefore = function (t, e) {
+                    return this.isSame(t, e) || this.isBefore(t, e);
+                  }),
+                  (bi.isValid = function () {
+                    return g(this);
+                  }),
+                  (bi.lang = ii),
+                  (bi.locale = ei),
+                  (bi.localeData = ni),
+                  (bi.max = Fe),
+                  (bi.min = Ae),
+                  (bi.parsingFlags = function () {
+                    return h({}, f(this));
+                  }),
+                  (bi.set = function (t, e) {
+                    if ("object" == typeof t)
+                      for (
+                        var i = (function (t) {
+                            var e = [];
+                            for (var i in t) e.push({ unit: i, priority: W[i] });
+                            return (
+                              e.sort(function (t, e) {
+                                return t.priority - e.priority;
+                              }),
+                              e
+                            );
+                          })((t = L(t))),
+                          n = 0;
+                        n < i.length;
+                        n++
+                      )
+                        this[i[n].unit](t[i[n].unit]);
+                    else if (T(this[(t = R(t))])) return this[t](e);
+                    return this;
+                  }),
+                  (bi.startOf = function (t) {
+                    var e;
+                    if (void 0 === (t = R(t)) || "millisecond" === t || !this.isValid()) return this;
+                    var i = this._isUTC ? di : ui;
+                    switch (t) {
+                      case "year":
+                        e = i(this.year(), 0, 1);
+                        break;
+                      case "quarter":
+                        e = i(this.year(), this.month() - (this.month() % 3), 1);
+                        break;
+                      case "month":
+                        e = i(this.year(), this.month(), 1);
+                        break;
+                      case "week":
+                        e = i(this.year(), this.month(), this.date() - this.weekday());
+                        break;
+                      case "isoWeek":
+                        e = i(this.year(), this.month(), this.date() - (this.isoWeekday() - 1));
+                        break;
+                      case "day":
+                      case "date":
+                        e = i(this.year(), this.month(), this.date());
+                        break;
+                      case "hour":
+                        (e = this._d.valueOf()), (e -= li(e + (this._isUTC ? 0 : this.utcOffset() * ri), oi));
+                        break;
+                      case "minute":
+                        (e = this._d.valueOf()), (e -= li(e, ri));
+                        break;
+                      case "second":
+                        (e = this._d.valueOf()), (e -= li(e, ai));
+                    }
+                    return this._d.setTime(e), n.updateOffset(this, !0), this;
+                  }),
+                  (bi.subtract = Qe),
+                  (bi.toArray = function () {
+                    var t = this;
+                    return [t.year(), t.month(), t.date(), t.hour(), t.minute(), t.second(), t.millisecond()];
+                  }),
+                  (bi.toObject = function () {
+                    var t = this;
+                    return {
+                      years: t.year(),
+                      months: t.month(),
+                      date: t.date(),
+                      hours: t.hours(),
+                      minutes: t.minutes(),
+                      seconds: t.seconds(),
+                      milliseconds: t.milliseconds(),
+                    };
+                  }),
+                  (bi.toDate = function () {
+                    return new Date(this.valueOf());
+                  }),
+                  (bi.toISOString = function (t) {
+                    if (!this.isValid()) return null;
+                    var e = !0 !== t,
+                      i = e ? this.clone().utc() : this;
+                    return i.year() < 0 || i.year() > 9999
+                      ? j(i, e ? "YYYYYY-MM-DD[T]HH:mm:ss.SSS[Z]" : "YYYYYY-MM-DD[T]HH:mm:ss.SSSZ")
+                      : T(Date.prototype.toISOString)
+                        ? e
+                          ? this.toDate().toISOString()
+                          : new Date(this.valueOf() + 60 * this.utcOffset() * 1e3).toISOString().replace("Z", j(i, "Z"))
+                        : j(i, e ? "YYYY-MM-DD[T]HH:mm:ss.SSS[Z]" : "YYYY-MM-DD[T]HH:mm:ss.SSSZ");
+                  }),
+                  (bi.inspect = function () {
+                    if (!this.isValid()) return "moment.invalid(/* " + this._i + " */)";
+                    var t = "moment",
+                      e = "";
+                    this.isLocal() || ((t = 0 === this.utcOffset() ? "moment.utc" : "moment.parseZone"), (e = "Z"));
+                    var i = "[" + t + '("]',
+                      n = 0 <= this.year() && this.year() <= 9999 ? "YYYY" : "YYYYYY",
+                      a = e + '[")]';
+                    return this.format(i + n + "-MM-DD[T]HH:mm:ss.SSS" + a);
+                  }),
+                  (bi.toJSON = function () {
+                    return this.isValid() ? this.toISOString() : null;
+                  }),
+                  (bi.toString = function () {
+                    return this.clone().locale("en").format("ddd MMM DD YYYY HH:mm:ss [GMT]ZZ");
+                  }),
+                  (bi.unix = function () {
+                    return Math.floor(this.valueOf() / 1e3);
+                  }),
+                  (bi.valueOf = function () {
+                    return this._d.valueOf() - 6e4 * (this._offset || 0);
+                  }),
+                  (bi.creationData = function () {
+                    return {
+                      input: this._i,
+                      format: this._f,
+                      locale: this._locale,
+                      isUTC: this._isUTC,
+                      strict: this._strict,
+                    };
+                  }),
+                  (bi.year = Pt),
+                  (bi.isLeapYear = function () {
+                    return Dt(this.year());
+                  }),
+                  (bi.weekYear = function (t) {
+                    return ci.call(
+                      this,
+                      t,
+                      this.week(),
+                      this.weekday(),
+                      this.localeData()._week.dow,
+                      this.localeData()._week.doy
+                    );
+                  }),
+                  (bi.isoWeekYear = function (t) {
+                    return ci.call(this, t, this.isoWeek(), this.isoWeekday(), 1, 4);
+                  }),
+                  (bi.quarter = bi.quarters =
+                    function (t) {
+                      return null == t
+                        ? Math.ceil((this.month() + 1) / 3)
+                        : this.month(3 * (t - 1) + (this.month() % 3));
+                    }),
+                  (bi.month = Yt),
+                  (bi.daysInMonth = function () {
+                    return At(this.year(), this.month());
+                  }),
+                  (bi.week = bi.weeks =
+                    function (t) {
+                      var e = this.localeData().week(this);
+                      return null == t ? e : this.add(7 * (t - e), "d");
+                    }),
+                  (bi.isoWeek = bi.isoWeeks =
+                    function (t) {
+                      var e = jt(this, 1, 4).week;
+                      return null == t ? e : this.add(7 * (t - e), "d");
+                    }),
+                  (bi.weeksInYear = function () {
+                    var t = this.localeData()._week;
+                    return Ut(this.year(), t.dow, t.doy);
+                  }),
+                  (bi.isoWeeksInYear = function () {
+                    return Ut(this.year(), 1, 4);
+                  }),
+                  (bi.date = fi),
+                  (bi.day = bi.days =
+                    function (t) {
+                      if (!this.isValid()) return null != t ? this : NaN;
+                      var e = this._isUTC ? this._d.getUTCDay() : this._d.getDay();
+                      return null != t
+                        ? ((t = (function (t, e) {
+                            return "string" != typeof t
+                              ? t
+                              : isNaN(t)
+                                ? "number" == typeof (t = e.weekdaysParse(t))
+                                  ? t
+                                  : null
+                                : parseInt(t, 10);
+                          })(t, this.localeData())),
+                          this.add(t - e, "d"))
+                        : e;
+                    }),
+                  (bi.weekday = function (t) {
+                    if (!this.isValid()) return null != t ? this : NaN;
+                    var e = (this.day() + 7 - this.localeData()._week.dow) % 7;
+                    return null == t ? e : this.add(t - e, "d");
+                  }),
+                  (bi.isoWeekday = function (t) {
+                    if (!this.isValid()) return null != t ? this : NaN;
+                    if (null != t) {
+                      var e = (function (t, e) {
+                        return "string" == typeof t ? e.weekdaysParse(t) % 7 || 7 : isNaN(t) ? null : t;
+                      })(t, this.localeData());
+                      return this.day(this.day() % 7 ? e : e - 7);
+                    }
+                    return this.day() || 7;
+                  }),
+                  (bi.dayOfYear = function (t) {
+                    var e = Math.round((this.clone().startOf("day") - this.clone().startOf("year")) / 864e5) + 1;
+                    return null == t ? e : this.add(t - e, "d");
+                  }),
+                  (bi.hour = bi.hours = ae),
+                  (bi.minute = bi.minutes = gi),
+                  (bi.second = bi.seconds = pi),
+                  (bi.millisecond = bi.milliseconds = yi),
+                  (bi.utcOffset = function (t, e, i) {
+                    var a,
+                      r = this._offset || 0;
+                    if (!this.isValid()) return null != t ? this : NaN;
+                    if (null != t) {
+                      if ("string" == typeof t) {
+                        if (null === (t = He(ot, t))) return this;
+                      } else Math.abs(t) < 16 && !i && (t *= 60);
+                      return (
+                        !this._isUTC && e && (a = Be(this)),
+                        (this._offset = t),
+                        (this._isUTC = !0),
+                        null != a && this.add(a, "m"),
+                        r !== t &&
+                          (!e || this._changeInProgress
+                            ? Ke(this, qe(t - r, "m"), 1, !1)
+                            : this._changeInProgress ||
+                              ((this._changeInProgress = !0),
+                              n.updateOffset(this, !0),
+                              (this._changeInProgress = null))),
+                        this
+                      );
+                    }
+                    return this._isUTC ? r : Be(this);
+                  }),
+                  (bi.utc = function (t) {
+                    return this.utcOffset(0, t);
+                  }),
+                  (bi.local = function (t) {
+                    return (
+                      this._isUTC && (this.utcOffset(0, t), (this._isUTC = !1), t && this.subtract(Be(this), "m")), this
+                    );
+                  }),
+                  (bi.parseZone = function () {
+                    if (null != this._tzm) this.utcOffset(this._tzm, !1, !0);
+                    else if ("string" == typeof this._i) {
+                      var t = He(rt, this._i);
+                      null != t ? this.utcOffset(t) : this.utcOffset(0, !0);
+                    }
+                    return this;
+                  }),
+                  (bi.hasAlignedHourOffset = function (t) {
+                    return !!this.isValid() && ((t = t ? Ie(t).utcOffset() : 0), (this.utcOffset() - t) % 60 == 0);
+                  }),
+                  (bi.isDST = function () {
+                    return (
+                      this.utcOffset() > this.clone().month(0).utcOffset() ||
+                      this.utcOffset() > this.clone().month(5).utcOffset()
+                    );
+                  }),
+                  (bi.isLocal = function () {
+                    return !!this.isValid() && !this._isUTC;
+                  }),
+                  (bi.isUtcOffset = function () {
+                    return !!this.isValid() && this._isUTC;
+                  }),
+                  (bi.isUtc = je),
+                  (bi.isUTC = je),
+                  (bi.zoneAbbr = function () {
+                    return this._isUTC ? "UTC" : "";
+                  }),
+                  (bi.zoneName = function () {
+                    return this._isUTC ? "Coordinated Universal Time" : "";
+                  }),
+                  (bi.dates = S("dates accessor is deprecated. Use date instead.", fi)),
+                  (bi.months = S("months accessor is deprecated. Use month instead", Yt)),
+                  (bi.years = S("years accessor is deprecated. Use year instead", Pt)),
+                  (bi.zone = S(
+                    "moment().zone is deprecated, use moment().utcOffset instead. http://momentjs.com/guides/#/warnings/zone/",
+                    function (t, e) {
+                      return null != t
+                        ? ("string" != typeof t && (t = -t), this.utcOffset(t, e), this)
+                        : -this.utcOffset();
+                    }
+                  )),
+                  (bi.isDSTShifted = S(
+                    "isDSTShifted is deprecated. See http://momentjs.com/guides/#/warnings/dst-shifted/ for more information",
+                    function () {
+                      if (!o(this._isDSTShifted)) return this._isDSTShifted;
+                      var t = {};
+                      if ((v(t, this), (t = Te(t))._a)) {
+                        var e = t._isUTC ? c(t._a) : Ie(t._a);
+                        this._isDSTShifted = this.isValid() && w(t._a, e.toArray()) > 0;
+                      } else this._isDSTShifted = !1;
+                      return this._isDSTShifted;
+                    }
+                  ));
+                var _i = I.prototype;
+                function ki(t, e, i, n) {
+                  var a = ce(),
+                    r = c().set(n, e);
+                  return a[i](r, t);
+                }
+                function wi(t, e, i) {
+                  if ((s(t) && ((e = t), (t = void 0)), (t = t || ""), null != e)) return ki(t, e, i, "month");
+                  var n,
+                    a = [];
+                  for (n = 0; n < 12; n++) a[n] = ki(t, n, i, "month");
+                  return a;
+                }
+                function Mi(t, e, i, n) {
+                  "boolean" == typeof t
+                    ? (s(e) && ((i = e), (e = void 0)), (e = e || ""))
+                    : ((i = e = t), (t = !1), s(e) && ((i = e), (e = void 0)), (e = e || ""));
+                  var a,
+                    r = ce(),
+                    o = t ? r._week.dow : 0;
+                  if (null != i) return ki(e, (i + o) % 7, n, "day");
+                  var l = [];
+                  for (a = 0; a < 7; a++) l[a] = ki(e, (a + o) % 7, n, "day");
+                  return l;
+                }
+                (_i.calendar = function (t, e, i) {
+                  var n = this._calendar[t] || this._calendar.sameElse;
+                  return T(n) ? n.call(e, i) : n;
+                }),
+                  (_i.longDateFormat = function (t) {
+                    var e = this._longDateFormat[t],
+                      i = this._longDateFormat[t.toUpperCase()];
+                    return e || !i
+                      ? e
+                      : ((this._longDateFormat[t] = i.replace(/MMMM|MM|DD|dddd/g, function (t) {
+                          return t.slice(1);
+                        })),
+                        this._longDateFormat[t]);
+                  }),
+                  (_i.invalidDate = function () {
+                    return this._invalidDate;
+                  }),
+                  (_i.ordinal = function (t) {
+                    return this._ordinal.replace("%d", t);
+                  }),
+                  (_i.preparse = xi),
+                  (_i.postformat = xi),
+                  (_i.relativeTime = function (t, e, i, n) {
+                    var a = this._relativeTime[i];
+                    return T(a) ? a(t, e, i, n) : a.replace(/%d/i, t);
+                  }),
+                  (_i.pastFuture = function (t, e) {
+                    var i = this._relativeTime[t > 0 ? "future" : "past"];
+                    return T(i) ? i(e) : i.replace(/%s/i, e);
+                  }),
+                  (_i.set = function (t) {
+                    var e, i;
+                    for (i in t) T((e = t[i])) ? (this[i] = e) : (this["_" + i] = e);
+                    (this._config = t),
+                      (this._dayOfMonthOrdinalParseLenient = new RegExp(
+                        (this._dayOfMonthOrdinalParse.source || this._ordinalParse.source) + "|" + /\d{1,2}/.source
+                      ));
+                  }),
+                  (_i.months = function (t, e) {
+                    return t
+                      ? a(this._months)
+                        ? this._months[t.month()]
+                        : this._months[(this._months.isFormat || Ft).test(e) ? "format" : "standalone"][t.month()]
+                      : a(this._months)
+                        ? this._months
+                        : this._months.standalone;
+                  }),
+                  (_i.monthsShort = function (t, e) {
+                    return t
+                      ? a(this._monthsShort)
+                        ? this._monthsShort[t.month()]
+                        : this._monthsShort[Ft.test(e) ? "format" : "standalone"][t.month()]
+                      : a(this._monthsShort)
+                        ? this._monthsShort
+                        : this._monthsShort.standalone;
+                  }),
+                  (_i.monthsParse = function (t, e, i) {
+                    var n, a, r;
+                    if (this._monthsParseExact)
+                      return function (t, e, i) {
+                        var n,
+                          a,
+                          r,
+                          o = t.toLocaleLowerCase();
+                        if (!this._monthsParse)
+                          for (
+                            this._monthsParse = [], this._longMonthsParse = [], this._shortMonthsParse = [], n = 0;
+                            n < 12;
+                            ++n
+                          )
+                            (r = c([2e3, n])),
+                              (this._shortMonthsParse[n] = this.monthsShort(r, "").toLocaleLowerCase()),
+                              (this._longMonthsParse[n] = this.months(r, "").toLocaleLowerCase());
+                        return i
+                          ? "MMM" === e
+                            ? -1 !== (a = Ct.call(this._shortMonthsParse, o))
+                              ? a
+                              : null
+                            : -1 !== (a = Ct.call(this._longMonthsParse, o))
+                              ? a
+                              : null
+                          : "MMM" === e
+                            ? -1 !== (a = Ct.call(this._shortMonthsParse, o))
+                              ? a
+                              : -1 !== (a = Ct.call(this._longMonthsParse, o))
+                                ? a
+                                : null
+                            : -1 !== (a = Ct.call(this._longMonthsParse, o))
+                              ? a
+                              : -1 !== (a = Ct.call(this._shortMonthsParse, o))
+                                ? a
+                                : null;
+                      }.call(this, t, e, i);
+                    for (
+                      this._monthsParse ||
+                        ((this._monthsParse = []), (this._longMonthsParse = []), (this._shortMonthsParse = [])),
+                        n = 0;
+                      n < 12;
+                      n++
+                    ) {
+                      if (
+                        ((a = c([2e3, n])),
+                        i &&
+                          !this._longMonthsParse[n] &&
+                          ((this._longMonthsParse[n] = new RegExp(
+                            "^" + this.months(a, "").replace(".", "") + "$",
+                            "i"
+                          )),
+                          (this._shortMonthsParse[n] = new RegExp(
+                            "^" + this.monthsShort(a, "").replace(".", "") + "$",
+                            "i"
+                          ))),
+                        i ||
+                          this._monthsParse[n] ||
+                          ((r = "^" + this.months(a, "") + "|^" + this.monthsShort(a, "")),
+                          (this._monthsParse[n] = new RegExp(r.replace(".", ""), "i"))),
+                        i && "MMMM" === e && this._longMonthsParse[n].test(t))
+                      )
+                        return n;
+                      if (i && "MMM" === e && this._shortMonthsParse[n].test(t)) return n;
+                      if (!i && this._monthsParse[n].test(t)) return n;
+                    }
+                  }),
+                  (_i.monthsRegex = function (t) {
+                    return this._monthsParseExact
+                      ? (d(this, "_monthsRegex") || Vt.call(this), t ? this._monthsStrictRegex : this._monthsRegex)
+                      : (d(this, "_monthsRegex") || (this._monthsRegex = zt),
+                        this._monthsStrictRegex && t ? this._monthsStrictRegex : this._monthsRegex);
+                  }),
+                  (_i.monthsShortRegex = function (t) {
+                    return this._monthsParseExact
+                      ? (d(this, "_monthsRegex") || Vt.call(this),
+                        t ? this._monthsShortStrictRegex : this._monthsShortRegex)
+                      : (d(this, "_monthsShortRegex") || (this._monthsShortRegex = Nt),
+                        this._monthsShortStrictRegex && t ? this._monthsShortStrictRegex : this._monthsShortRegex);
+                  }),
+                  (_i.week = function (t) {
+                    return jt(t, this._week.dow, this._week.doy).week;
+                  }),
+                  (_i.firstDayOfYear = function () {
+                    return this._week.doy;
+                  }),
+                  (_i.firstDayOfWeek = function () {
+                    return this._week.dow;
+                  }),
+                  (_i.weekdays = function (t, e) {
+                    var i = a(this._weekdays)
+                      ? this._weekdays
+                      : this._weekdays[t && !0 !== t && this._weekdays.isFormat.test(e) ? "format" : "standalone"];
+                    return !0 === t ? Gt(i, this._week.dow) : t ? i[t.day()] : i;
+                  }),
+                  (_i.weekdaysMin = function (t) {
+                    return !0 === t
+                      ? Gt(this._weekdaysMin, this._week.dow)
+                      : t
+                        ? this._weekdaysMin[t.day()]
+                        : this._weekdaysMin;
+                  }),
+                  (_i.weekdaysShort = function (t) {
+                    return !0 === t
+                      ? Gt(this._weekdaysShort, this._week.dow)
+                      : t
+                        ? this._weekdaysShort[t.day()]
+                        : this._weekdaysShort;
+                  }),
+                  (_i.weekdaysParse = function (t, e, i) {
+                    var n, a, r;
+                    if (this._weekdaysParseExact)
+                      return function (t, e, i) {
+                        var n,
+                          a,
+                          r,
+                          o = t.toLocaleLowerCase();
+                        if (!this._weekdaysParse)
+                          for (
+                            this._weekdaysParse = [], this._shortWeekdaysParse = [], this._minWeekdaysParse = [], n = 0;
+                            n < 7;
+                            ++n
+                          )
+                            (r = c([2e3, 1]).day(n)),
+                              (this._minWeekdaysParse[n] = this.weekdaysMin(r, "").toLocaleLowerCase()),
+                              (this._shortWeekdaysParse[n] = this.weekdaysShort(r, "").toLocaleLowerCase()),
+                              (this._weekdaysParse[n] = this.weekdays(r, "").toLocaleLowerCase());
+                        return i
+                          ? "dddd" === e
+                            ? -1 !== (a = Ct.call(this._weekdaysParse, o))
+                              ? a
+                              : null
+                            : "ddd" === e
+                              ? -1 !== (a = Ct.call(this._shortWeekdaysParse, o))
+                                ? a
+                                : null
+                              : -1 !== (a = Ct.call(this._minWeekdaysParse, o))
+                                ? a
+                                : null
+                          : "dddd" === e
+                            ? -1 !== (a = Ct.call(this._weekdaysParse, o))
+                              ? a
+                              : -1 !== (a = Ct.call(this._shortWeekdaysParse, o))
+                                ? a
+                                : -1 !== (a = Ct.call(this._minWeekdaysParse, o))
+                                  ? a
+                                  : null
+                            : "ddd" === e
+                              ? -1 !== (a = Ct.call(this._shortWeekdaysParse, o))
+                                ? a
+                                : -1 !== (a = Ct.call(this._weekdaysParse, o))
+                                  ? a
+                                  : -1 !== (a = Ct.call(this._minWeekdaysParse, o))
+                                    ? a
+                                    : null
+                              : -1 !== (a = Ct.call(this._minWeekdaysParse, o))
+                                ? a
+                                : -1 !== (a = Ct.call(this._weekdaysParse, o))
+                                  ? a
+                                  : -1 !== (a = Ct.call(this._shortWeekdaysParse, o))
+                                    ? a
+                                    : null;
+                      }.call(this, t, e, i);
+                    for (
+                      this._weekdaysParse ||
+                        ((this._weekdaysParse = []),
+                        (this._minWeekdaysParse = []),
+                        (this._shortWeekdaysParse = []),
+                        (this._fullWeekdaysParse = [])),
+                        n = 0;
+                      n < 7;
+                      n++
+                    ) {
+                      if (
+                        ((a = c([2e3, 1]).day(n)),
+                        i &&
+                          !this._fullWeekdaysParse[n] &&
+                          ((this._fullWeekdaysParse[n] = new RegExp(
+                            "^" + this.weekdays(a, "").replace(".", "\\.?") + "$",
+                            "i"
+                          )),
+                          (this._shortWeekdaysParse[n] = new RegExp(
+                            "^" + this.weekdaysShort(a, "").replace(".", "\\.?") + "$",
+                            "i"
+                          )),
+                          (this._minWeekdaysParse[n] = new RegExp(
+                            "^" + this.weekdaysMin(a, "").replace(".", "\\.?") + "$",
+                            "i"
+                          ))),
+                        this._weekdaysParse[n] ||
+                          ((r =
+                            "^" +
+                            this.weekdays(a, "") +
+                            "|^" +
+                            this.weekdaysShort(a, "") +
+                            "|^" +
+                            this.weekdaysMin(a, "")),
+                          (this._weekdaysParse[n] = new RegExp(r.replace(".", ""), "i"))),
+                        i && "dddd" === e && this._fullWeekdaysParse[n].test(t))
+                      )
+                        return n;
+                      if (i && "ddd" === e && this._shortWeekdaysParse[n].test(t)) return n;
+                      if (i && "dd" === e && this._minWeekdaysParse[n].test(t)) return n;
+                      if (!i && this._weekdaysParse[n].test(t)) return n;
+                    }
+                  }),
+                  (_i.weekdaysRegex = function (t) {
+                    return this._weekdaysParseExact
+                      ? (d(this, "_weekdaysRegex") || Qt.call(this),
+                        t ? this._weekdaysStrictRegex : this._weekdaysRegex)
+                      : (d(this, "_weekdaysRegex") || (this._weekdaysRegex = Xt),
+                        this._weekdaysStrictRegex && t ? this._weekdaysStrictRegex : this._weekdaysRegex);
+                  }),
+                  (_i.weekdaysShortRegex = function (t) {
+                    return this._weekdaysParseExact
+                      ? (d(this, "_weekdaysRegex") || Qt.call(this),
+                        t ? this._weekdaysShortStrictRegex : this._weekdaysShortRegex)
+                      : (d(this, "_weekdaysShortRegex") || (this._weekdaysShortRegex = Kt),
+                        this._weekdaysShortStrictRegex && t
+                          ? this._weekdaysShortStrictRegex
+                          : this._weekdaysShortRegex);
+                  }),
+                  (_i.weekdaysMinRegex = function (t) {
+                    return this._weekdaysParseExact
+                      ? (d(this, "_weekdaysRegex") || Qt.call(this),
+                        t ? this._weekdaysMinStrictRegex : this._weekdaysMinRegex)
+                      : (d(this, "_weekdaysMinRegex") || (this._weekdaysMinRegex = Jt),
+                        this._weekdaysMinStrictRegex && t ? this._weekdaysMinStrictRegex : this._weekdaysMinRegex);
+                  }),
+                  (_i.isPM = function (t) {
+                    return "p" === (t + "").toLowerCase().charAt(0);
+                  }),
+                  (_i.meridiem = function (t, e, i) {
+                    return t > 11 ? (i ? "pm" : "PM") : i ? "am" : "AM";
+                  }),
+                  de("en", {
+                    dayOfMonthOrdinalParse: /\d{1,2}(th|st|nd|rd)/,
+                    ordinal: function (t) {
+                      var e = t % 10,
+                        i = 1 === k((t % 100) / 10) ? "th" : 1 === e ? "st" : 2 === e ? "nd" : 3 === e ? "rd" : "th";
+                      return t + i;
+                    },
+                  }),
+                  (n.lang = S("moment.lang is deprecated. Use moment.locale instead.", de)),
+                  (n.langData = S("moment.langData is deprecated. Use moment.localeData instead.", ce));
+                var Si = Math.abs;
+                function Di(t, e, i, n) {
+                  var a = qe(e, i);
+                  return (
+                    (t._milliseconds += n * a._milliseconds),
+                    (t._days += n * a._days),
+                    (t._months += n * a._months),
+                    t._bubble()
+                  );
+                }
+                function Ci(t) {
+                  return t < 0 ? Math.floor(t) : Math.ceil(t);
+                }
+                function Pi(t) {
+                  return (4800 * t) / 146097;
+                }
+                function Ti(t) {
+                  return (146097 * t) / 4800;
+                }
+                function Oi(t) {
+                  return function () {
+                    return this.as(t);
+                  };
+                }
+                var Ii = Oi("ms"),
+                  Ai = Oi("s"),
+                  Fi = Oi("m"),
+                  Ri = Oi("h"),
+                  Li = Oi("d"),
+                  Wi = Oi("w"),
+                  Yi = Oi("M"),
+                  Ni = Oi("Q"),
+                  zi = Oi("y");
+                function Vi(t) {
+                  return function () {
+                    return this.isValid() ? this._data[t] : NaN;
+                  };
+                }
+                var Hi = Vi("milliseconds"),
+                  Ei = Vi("seconds"),
+                  Bi = Vi("minutes"),
+                  ji = Vi("hours"),
+                  Ui = Vi("days"),
+                  Gi = Vi("months"),
+                  qi = Vi("years"),
+                  Zi = Math.round,
+                  $i = { ss: 44, s: 45, m: 45, h: 22, d: 26, M: 11 },
+                  Xi = Math.abs;
+                function Ki(t) {
+                  return (t > 0) - (t < 0) || +t;
+                }
+                function Ji() {
+                  if (!this.isValid()) return this.localeData().invalidDate();
+                  var t,
+                    e,
+                    i = Xi(this._milliseconds) / 1e3,
+                    n = Xi(this._days),
+                    a = Xi(this._months);
+                  (t = _(i / 60)), (e = _(t / 60)), (i %= 60), (t %= 60);
+                  var r = _(a / 12),
+                    o = (a %= 12),
+                    s = n,
+                    l = e,
+                    u = t,
+                    d = i ? i.toFixed(3).replace(/\.?0+$/, "") : "",
+                    h = this.asSeconds();
+                  if (!h) return "P0D";
+                  var c = h < 0 ? "-" : "",
+                    f = Ki(this._months) !== Ki(h) ? "-" : "",
+                    g = Ki(this._days) !== Ki(h) ? "-" : "",
+                    m = Ki(this._milliseconds) !== Ki(h) ? "-" : "";
+                  return (
+                    c +
+                    "P" +
+                    (r ? f + r + "Y" : "") +
+                    (o ? f + o + "M" : "") +
+                    (s ? g + s + "D" : "") +
+                    (l || u || d ? "T" : "") +
+                    (l ? m + l + "H" : "") +
+                    (u ? m + u + "M" : "") +
+                    (d ? m + d + "S" : "")
+                  );
+                }
+                var Qi = We.prototype;
+                return (
+                  (Qi.isValid = function () {
+                    return this._isValid;
+                  }),
+                  (Qi.abs = function () {
+                    var t = this._data;
+                    return (
+                      (this._milliseconds = Si(this._milliseconds)),
+                      (this._days = Si(this._days)),
+                      (this._months = Si(this._months)),
+                      (t.milliseconds = Si(t.milliseconds)),
+                      (t.seconds = Si(t.seconds)),
+                      (t.minutes = Si(t.minutes)),
+                      (t.hours = Si(t.hours)),
+                      (t.months = Si(t.months)),
+                      (t.years = Si(t.years)),
+                      this
+                    );
+                  }),
+                  (Qi.add = function (t, e) {
+                    return Di(this, t, e, 1);
+                  }),
+                  (Qi.subtract = function (t, e) {
+                    return Di(this, t, e, -1);
+                  }),
+                  (Qi.as = function (t) {
+                    if (!this.isValid()) return NaN;
+                    var e,
+                      i,
+                      n = this._milliseconds;
+                    if ("month" === (t = R(t)) || "quarter" === t || "year" === t)
+                      switch (((e = this._days + n / 864e5), (i = this._months + Pi(e)), t)) {
+                        case "month":
+                          return i;
+                        case "quarter":
+                          return i / 3;
+                        case "year":
+                          return i / 12;
+                      }
+                    else
+                      switch (((e = this._days + Math.round(Ti(this._months))), t)) {
+                        case "week":
+                          return e / 7 + n / 6048e5;
+                        case "day":
+                          return e + n / 864e5;
+                        case "hour":
+                          return 24 * e + n / 36e5;
+                        case "minute":
+                          return 1440 * e + n / 6e4;
+                        case "second":
+                          return 86400 * e + n / 1e3;
+                        case "millisecond":
+                          return Math.floor(864e5 * e) + n;
+                        default:
+                          throw new Error("Unknown unit " + t);
+                      }
+                  }),
+                  (Qi.asMilliseconds = Ii),
+                  (Qi.asSeconds = Ai),
+                  (Qi.asMinutes = Fi),
+                  (Qi.asHours = Ri),
+                  (Qi.asDays = Li),
+                  (Qi.asWeeks = Wi),
+                  (Qi.asMonths = Yi),
+                  (Qi.asQuarters = Ni),
+                  (Qi.asYears = zi),
+                  (Qi.valueOf = function () {
+                    return this.isValid()
+                      ? this._milliseconds +
+                          864e5 * this._days +
+                          (this._months % 12) * 2592e6 +
+                          31536e6 * k(this._months / 12)
+                      : NaN;
+                  }),
+                  (Qi._bubble = function () {
+                    var t,
+                      e,
+                      i,
+                      n,
+                      a,
+                      r = this._milliseconds,
+                      o = this._days,
+                      s = this._months,
+                      l = this._data;
+                    return (
+                      (r >= 0 && o >= 0 && s >= 0) ||
+                        (r <= 0 && o <= 0 && s <= 0) ||
+                        ((r += 864e5 * Ci(Ti(s) + o)), (o = 0), (s = 0)),
+                      (l.milliseconds = r % 1e3),
+                      (t = _(r / 1e3)),
+                      (l.seconds = t % 60),
+                      (e = _(t / 60)),
+                      (l.minutes = e % 60),
+                      (i = _(e / 60)),
+                      (l.hours = i % 24),
+                      (o += _(i / 24)),
+                      (a = _(Pi(o))),
+                      (s += a),
+                      (o -= Ci(Ti(a))),
+                      (n = _(s / 12)),
+                      (s %= 12),
+                      (l.days = o),
+                      (l.months = s),
+                      (l.years = n),
+                      this
+                    );
+                  }),
+                  (Qi.clone = function () {
+                    return qe(this);
+                  }),
+                  (Qi.get = function (t) {
+                    return (t = R(t)), this.isValid() ? this[t + "s"]() : NaN;
+                  }),
+                  (Qi.milliseconds = Hi),
+                  (Qi.seconds = Ei),
+                  (Qi.minutes = Bi),
+                  (Qi.hours = ji),
+                  (Qi.days = Ui),
+                  (Qi.weeks = function () {
+                    return _(this.days() / 7);
+                  }),
+                  (Qi.months = Gi),
+                  (Qi.years = qi),
+                  (Qi.humanize = function (t) {
+                    if (!this.isValid()) return this.localeData().invalidDate();
+                    var e = this.localeData(),
+                      i = (function (t, e, i) {
+                        var n = qe(t).abs(),
+                          a = Zi(n.as("s")),
+                          r = Zi(n.as("m")),
+                          o = Zi(n.as("h")),
+                          s = Zi(n.as("d")),
+                          l = Zi(n.as("M")),
+                          u = Zi(n.as("y")),
+                          d = (a <= $i.ss && ["s", a]) ||
+                            (a < $i.s && ["ss", a]) ||
+                            (r <= 1 && ["m"]) ||
+                            (r < $i.m && ["mm", r]) ||
+                            (o <= 1 && ["h"]) ||
+                            (o < $i.h && ["hh", o]) ||
+                            (s <= 1 && ["d"]) ||
+                            (s < $i.d && ["dd", s]) ||
+                            (l <= 1 && ["M"]) ||
+                            (l < $i.M && ["MM", l]) ||
+                            (u <= 1 && ["y"]) || ["yy", u];
+                        return (
+                          (d[2] = e),
+                          (d[3] = +t > 0),
+                          (d[4] = i),
+                          function (t, e, i, n, a) {
+                            return a.relativeTime(e || 1, !!i, t, n);
+                          }.apply(null, d)
+                        );
+                      })(this, !t, e);
+                    return t && (i = e.pastFuture(+this, i)), e.postformat(i);
+                  }),
+                  (Qi.toISOString = Ji),
+                  (Qi.toString = Ji),
+                  (Qi.toJSON = Ji),
+                  (Qi.locale = ei),
+                  (Qi.localeData = ni),
+                  (Qi.toIsoString = S(
+                    "toIsoString() is deprecated. Please use toISOString() instead (notice the capitals)",
+                    Ji
+                  )),
+                  (Qi.lang = ii),
+                  B("X", 0, 0, "unix"),
+                  B("x", 0, 0, "valueOf"),
+                  ut("x", at),
+                  ut("X", /[+-]?\d+(\.\d{1,3})?/),
+                  ft("X", function (t, e, i) {
+                    i._d = new Date(1e3 * parseFloat(t, 10));
+                  }),
+                  ft("x", function (t, e, i) {
+                    i._d = new Date(k(t));
+                  }),
+                  (n.version = "2.24.0"),
+                  (e = Ie),
+                  (n.fn = bi),
+                  (n.min = function () {
+                    return Re("isBefore", [].slice.call(arguments, 0));
+                  }),
+                  (n.max = function () {
+                    return Re("isAfter", [].slice.call(arguments, 0));
+                  }),
+                  (n.now = function () {
+                    return Date.now ? Date.now() : +new Date();
+                  }),
+                  (n.utc = c),
+                  (n.unix = function (t) {
+                    return Ie(1e3 * t);
+                  }),
+                  (n.months = function (t, e) {
+                    return wi(t, e, "months");
+                  }),
+                  (n.isDate = l),
+                  (n.locale = de),
+                  (n.invalid = m),
+                  (n.duration = qe),
+                  (n.isMoment = x),
+                  (n.weekdays = function (t, e, i) {
+                    return Mi(t, e, i, "weekdays");
+                  }),
+                  (n.parseZone = function () {
+                    return Ie.apply(null, arguments).parseZone();
+                  }),
+                  (n.localeData = ce),
+                  (n.isDuration = Ye),
+                  (n.monthsShort = function (t, e) {
+                    return wi(t, e, "monthsShort");
+                  }),
+                  (n.weekdaysMin = function (t, e, i) {
+                    return Mi(t, e, i, "weekdaysMin");
+                  }),
+                  (n.defineLocale = he),
+                  (n.updateLocale = function (t, e) {
+                    if (null != e) {
+                      var i,
+                        n,
+                        a = re;
+                      null != (n = ue(t)) && (a = n._config),
+                        (e = O(a, e)),
+                        ((i = new I(e)).parentLocale = oe[t]),
+                        (oe[t] = i),
+                        de(t);
+                    } else
+                      null != oe[t] &&
+                        (null != oe[t].parentLocale ? (oe[t] = oe[t].parentLocale) : null != oe[t] && delete oe[t]);
+                    return oe[t];
+                  }),
+                  (n.locales = function () {
+                    return D(oe);
+                  }),
+                  (n.weekdaysShort = function (t, e, i) {
+                    return Mi(t, e, i, "weekdaysShort");
+                  }),
+                  (n.normalizeUnits = R),
+                  (n.relativeTimeRounding = function (t) {
+                    return void 0 === t ? Zi : "function" == typeof t && ((Zi = t), !0);
+                  }),
+                  (n.relativeTimeThreshold = function (t, e) {
+                    return void 0 !== $i[t] && (void 0 === e ? $i[t] : (($i[t] = e), "s" === t && ($i.ss = e - 1), !0));
+                  }),
+                  (n.calendarFormat = function (t, e) {
+                    var i = t.diff(e, "days", !0);
+                    return i < -6
+                      ? "sameElse"
+                      : i < -1
+                        ? "lastWeek"
+                        : i < 0
+                          ? "lastDay"
+                          : i < 1
+                            ? "sameDay"
+                            : i < 2
+                              ? "nextDay"
+                              : i < 7
+                                ? "nextWeek"
+                                : "sameElse";
+                  }),
+                  (n.prototype = bi),
+                  (n.HTML5_FMT = {
+                    DATETIME_LOCAL: "YYYY-MM-DDTHH:mm",
+                    DATETIME_LOCAL_SECONDS: "YYYY-MM-DDTHH:mm:ss",
+                    DATETIME_LOCAL_MS: "YYYY-MM-DDTHH:mm:ss.SSS",
+                    DATE: "YYYY-MM-DD",
+                    TIME: "HH:mm",
+                    TIME_SECONDS: "HH:mm:ss",
+                    TIME_MS: "HH:mm:ss.SSS",
+                    WEEK: "GGGG-[W]WW",
+                    MONTH: "YYYY-MM",
+                  }),
+                  n
+                );
+              })();
+            })((tn = { exports: {} }), tn.exports),
+            tn.exports),
+          an = {
+            datetime: "MMM D, YYYY, h:mm:ss a",
+            millisecond: "h:mm:ss.SSS a",
+            second: "h:mm:ss a",
+            minute: "h:mm a",
+            hour: "hA",
+            day: "MMM D",
+            week: "ll",
+            month: "MMM YYYY",
+            quarter: "[Q]Q - YYYY",
+            year: "YYYY",
+          };
+        si._date.override(
+          "function" == typeof nn
+            ? {
+                _id: "moment",
+                formats: function () {
+                  return an;
+                },
+                parse: function (t, e) {
+                  return (
+                    "string" == typeof t && "string" == typeof e ? (t = nn(t, e)) : t instanceof nn || (t = nn(t)),
+                    t.isValid() ? t.valueOf() : null
+                  );
+                },
+                format: function (t, e) {
+                  return nn(t).format(e);
+                },
+                add: function (t, e, i) {
+                  return nn(t).add(e, i).valueOf();
+                },
+                diff: function (t, e, i) {
+                  return nn.duration(nn(t).diff(nn(e))).as(i);
+                },
+                startOf: function (t, e, i) {
+                  return (t = nn(t)), "isoWeek" === e ? t.isoWeekday(i).valueOf() : t.startOf(e).valueOf();
+                },
+                endOf: function (t, e) {
+                  return nn(t).endOf(e).valueOf();
+                },
+                _create: function (t) {
+                  return nn(t);
+                },
+              }
+            : {}
+        ),
+          ot._set("global", { plugins: { filler: { propagate: !0 } } });
+        var rn = {
+          dataset: function (t) {
+            var e = t.fill,
+              i = t.chart,
+              n = i.getDatasetMeta(e),
+              a = (n && i.isDatasetVisible(e) && n.dataset._children) || [],
+              r = a.length || 0;
+            return r
+              ? function (t, e) {
+                  return (e < r && a[e]._view) || null;
+                }
+              : null;
+          },
+          boundary: function (t) {
+            var e = t.boundary,
+              i = e ? e.x : null,
+              n = e ? e.y : null;
+            return function (t) {
+              return { x: null === i ? t.x : i, y: null === n ? t.y : n };
+            };
+          },
+        };
+        function on(t, e, i) {
+          var n,
+            a = t._model || {},
+            r = a.fill;
+          if ((void 0 === r && (r = !!a.backgroundColor), !1 === r || null === r)) return !1;
+          if (!0 === r) return "origin";
+          if (((n = parseFloat(r, 10)), isFinite(n) && Math.floor(n) === n))
+            return ("-" !== r[0] && "+" !== r[0]) || (n = e + n), !(n === e || n < 0 || n >= i) && n;
+          switch (r) {
+            case "bottom":
+              return "start";
+            case "top":
+              return "end";
+            case "zero":
+              return "origin";
+            case "origin":
+            case "start":
+            case "end":
+              return r;
+            default:
+              return !1;
+          }
+        }
+        function sn(t) {
+          var e,
+            i = t.el._model || {},
+            n = t.el._scale || {},
+            a = t.fill,
+            r = null;
+          if (isFinite(a)) return null;
+          if (
+            ("start" === a
+              ? (r = void 0 === i.scaleBottom ? n.bottom : i.scaleBottom)
+              : "end" === a
+                ? (r = void 0 === i.scaleTop ? n.top : i.scaleTop)
+                : void 0 !== i.scaleZero
+                  ? (r = i.scaleZero)
+                  : n.getBasePosition
+                    ? (r = n.getBasePosition())
+                    : n.getBasePixel && (r = n.getBasePixel()),
+            null != r)
+          ) {
+            if (void 0 !== r.x && void 0 !== r.y) return r;
+            if (ut.isFinite(r)) return { x: (e = n.isHorizontal()) ? r : null, y: e ? null : r };
+          }
+          return null;
+        }
+        function ln(t, e, i) {
+          var n,
+            a = t[e].fill,
+            r = [e];
+          if (!i) return a;
+          for (; !1 !== a && -1 === r.indexOf(a); ) {
+            if (!isFinite(a)) return a;
+            if (!(n = t[a])) return !1;
+            if (n.visible) return a;
+            r.push(a), (a = n.fill);
+          }
+          return !1;
+        }
+        function un(t) {
+          var e = t.fill,
+            i = "dataset";
+          return !1 === e ? null : (isFinite(e) || (i = "boundary"), rn[i](t));
+        }
+        function dn(t) {
+          return t && !t.skip;
+        }
+        function hn(t, e, i, n, a) {
+          var r;
+          if (n && a) {
+            for (t.moveTo(e[0].x, e[0].y), r = 1; r < n; ++r) ut.canvas.lineTo(t, e[r - 1], e[r]);
+            for (t.lineTo(i[a - 1].x, i[a - 1].y), r = a - 1; r > 0; --r) ut.canvas.lineTo(t, i[r], i[r - 1], !0);
+          }
+        }
+        var cn = {
+            id: "filler",
+            afterDatasetsUpdate: function (t, e) {
+              var i,
+                n,
+                a,
+                r,
+                o = (t.data.datasets || []).length,
+                s = e.propagate,
+                l = [];
+              for (n = 0; n < o; ++n)
+                (r = null),
+                  (a = (i = t.getDatasetMeta(n)).dataset) &&
+                    a._model &&
+                    a instanceof Nt.Line &&
+                    (r = { visible: t.isDatasetVisible(n), fill: on(a, n, o), chart: t, el: a }),
+                  (i.$filler = r),
+                  l.push(r);
+              for (n = 0; n < o; ++n) (r = l[n]) && ((r.fill = ln(l, n, s)), (r.boundary = sn(r)), (r.mapper = un(r)));
+            },
+            beforeDatasetDraw: function (t, e) {
+              var i = e.meta.$filler;
+              if (i) {
+                var n = t.ctx,
+                  a = i.el,
+                  r = a._view,
+                  o = a._children || [],
+                  s = i.mapper,
+                  l = r.backgroundColor || ot.global.defaultColor;
+                s &&
+                  l &&
+                  o.length &&
+                  (ut.canvas.clipArea(n, t.chartArea),
+                  (function (t, e, i, n, a, r) {
+                    var o,
+                      s,
+                      l,
+                      u,
+                      d,
+                      h,
+                      c,
+                      f = e.length,
+                      g = n.spanGaps,
+                      m = [],
+                      p = [],
+                      v = 0,
+                      y = 0;
+                    for (t.beginPath(), o = 0, s = f + !!r; o < s; ++o)
+                      (d = i((u = e[(l = o % f)]._view), l, n)),
+                        (h = dn(u)),
+                        (c = dn(d)),
+                        h && c
+                          ? ((v = m.push(u)), (y = p.push(d)))
+                          : v &&
+                            y &&
+                            (g
+                              ? (h && m.push(u), c && p.push(d))
+                              : (hn(t, m, p, v, y), (v = y = 0), (m = []), (p = [])));
+                    hn(t, m, p, v, y), t.closePath(), (t.fillStyle = a), t.fill();
+                  })(n, o, s, r, l, a._loop),
+                  ut.canvas.unclipArea(n));
+              }
+            },
+          },
+          fn = ut.noop,
+          gn = ut.valueOrDefault;
+        function mn(t, e) {
+          return t.usePointStyle && t.boxWidth > e ? e : t.boxWidth;
+        }
+        ot._set("global", {
+          legend: {
+            display: !0,
+            position: "top",
+            fullWidth: !0,
+            reverse: !1,
+            weight: 1e3,
+            onClick: function (t, e) {
+              var i = e.datasetIndex,
+                n = this.chart,
+                a = n.getDatasetMeta(i);
+              (a.hidden = null === a.hidden ? !n.data.datasets[i].hidden : null), n.update();
+            },
+            onHover: null,
+            onLeave: null,
+            labels: {
+              boxWidth: 40,
+              padding: 10,
+              generateLabels: function (t) {
+                var e = t.data;
+                return ut.isArray(e.datasets)
+                  ? e.datasets.map(function (e, i) {
+                      return {
+                        text: e.label,
+                        fillStyle: ut.isArray(e.backgroundColor) ? e.backgroundColor[0] : e.backgroundColor,
+                        hidden: !t.isDatasetVisible(i),
+                        lineCap: e.borderCapStyle,
+                        lineDash: e.borderDash,
+                        lineDashOffset: e.borderDashOffset,
+                        lineJoin: e.borderJoinStyle,
+                        lineWidth: e.borderWidth,
+                        strokeStyle: e.borderColor,
+                        pointStyle: e.pointStyle,
+                        datasetIndex: i,
+                      };
+                    }, this)
+                  : [];
+              },
+            },
+          },
+          legendCallback: function (t) {
+            var e = [];
+            e.push('<ul class="' + t.id + '-legend">');
+            for (var i = 0; i < t.data.datasets.length; i++)
+              e.push('<li><span style="background-color:' + t.data.datasets[i].backgroundColor + '"></span>'),
+                t.data.datasets[i].label && e.push(t.data.datasets[i].label),
+                e.push("</li>");
+            return e.push("</ul>"), e.join("");
+          },
+        });
+        var pn = gt.extend({
+          initialize: function (t) {
+            ut.extend(this, t), (this.legendHitBoxes = []), (this._hoveredItem = null), (this.doughnutMode = !1);
+          },
+          beforeUpdate: fn,
+          update: function (t, e, i) {
+            var n = this;
+            return (
+              n.beforeUpdate(),
+              (n.maxWidth = t),
+              (n.maxHeight = e),
+              (n.margins = i),
+              n.beforeSetDimensions(),
+              n.setDimensions(),
+              n.afterSetDimensions(),
+              n.beforeBuildLabels(),
+              n.buildLabels(),
+              n.afterBuildLabels(),
+              n.beforeFit(),
+              n.fit(),
+              n.afterFit(),
+              n.afterUpdate(),
+              n.minSize
+            );
+          },
+          afterUpdate: fn,
+          beforeSetDimensions: fn,
+          setDimensions: function () {
+            var t = this;
+            t.isHorizontal()
+              ? ((t.width = t.maxWidth), (t.left = 0), (t.right = t.width))
+              : ((t.height = t.maxHeight), (t.top = 0), (t.bottom = t.height)),
+              (t.paddingLeft = 0),
+              (t.paddingTop = 0),
+              (t.paddingRight = 0),
+              (t.paddingBottom = 0),
+              (t.minSize = { width: 0, height: 0 });
+          },
+          afterSetDimensions: fn,
+          beforeBuildLabels: fn,
+          buildLabels: function () {
+            var t = this,
+              e = t.options.labels || {},
+              i = ut.callback(e.generateLabels, [t.chart], t) || [];
+            e.filter &&
+              (i = i.filter(function (i) {
+                return e.filter(i, t.chart.data);
+              })),
+              t.options.reverse && i.reverse(),
+              (t.legendItems = i);
+          },
+          afterBuildLabels: fn,
+          beforeFit: fn,
+          fit: function () {
+            var t = this,
+              e = t.options,
+              i = e.labels,
+              n = e.display,
+              a = t.ctx,
+              r = ut.options._parseFont(i),
+              o = r.size,
+              s = (t.legendHitBoxes = []),
+              l = t.minSize,
+              u = t.isHorizontal();
+            if (
+              (u
+                ? ((l.width = t.maxWidth), (l.height = n ? 10 : 0))
+                : ((l.width = n ? 10 : 0), (l.height = t.maxHeight)),
+              n)
+            )
+              if (((a.font = r.string), u)) {
+                var d = (t.lineWidths = [0]),
+                  h = 0;
+                (a.textAlign = "left"),
+                  (a.textBaseline = "top"),
+                  ut.each(t.legendItems, function (t, e) {
+                    var n = mn(i, o) + o / 2 + a.measureText(t.text).width;
+                    (0 === e || d[d.length - 1] + n + i.padding > l.width) &&
+                      ((h += o + i.padding), (d[d.length - (e > 0 ? 0 : 1)] = i.padding)),
+                      (s[e] = { left: 0, top: 0, width: n, height: o }),
+                      (d[d.length - 1] += n + i.padding);
+                  }),
+                  (l.height += h);
+              } else {
+                var c = i.padding,
+                  f = (t.columnWidths = []),
+                  g = i.padding,
+                  m = 0,
+                  p = 0,
+                  v = o + c;
+                ut.each(t.legendItems, function (t, e) {
+                  var n = mn(i, o) + o / 2 + a.measureText(t.text).width;
+                  e > 0 && p + v > l.height - c && ((g += m + i.padding), f.push(m), (m = 0), (p = 0)),
+                    (m = Math.max(m, n)),
+                    (p += v),
+                    (s[e] = { left: 0, top: 0, width: n, height: o });
+                }),
+                  (g += m),
+                  f.push(m),
+                  (l.width += g);
+              }
+            (t.width = l.width), (t.height = l.height);
+          },
+          afterFit: fn,
+          isHorizontal: function () {
+            return "top" === this.options.position || "bottom" === this.options.position;
+          },
+          draw: function () {
+            var t = this,
+              e = t.options,
+              i = e.labels,
+              n = ot.global,
+              a = n.defaultColor,
+              r = n.elements.line,
+              o = t.width,
+              s = t.lineWidths;
+            if (e.display) {
+              var l,
+                u = t.ctx,
+                d = gn(i.fontColor, n.defaultFontColor),
+                h = ut.options._parseFont(i),
+                c = h.size;
+              (u.textAlign = "left"),
+                (u.textBaseline = "middle"),
+                (u.lineWidth = 0.5),
+                (u.strokeStyle = d),
+                (u.fillStyle = d),
+                (u.font = h.string);
+              var f = mn(i, c),
+                g = t.legendHitBoxes,
+                m = t.isHorizontal();
+              l = m
+                ? { x: t.left + (o - s[0]) / 2 + i.padding, y: t.top + i.padding, line: 0 }
+                : { x: t.left + i.padding, y: t.top + i.padding, line: 0 };
+              var p = c + i.padding;
+              ut.each(t.legendItems, function (n, d) {
+                var h = u.measureText(n.text).width,
+                  v = f + c / 2 + h,
+                  y = l.x,
+                  b = l.y;
+                m
+                  ? d > 0 &&
+                    y + v + i.padding > t.left + t.minSize.width &&
+                    ((b = l.y += p), l.line++, (y = l.x = t.left + (o - s[l.line]) / 2 + i.padding))
+                  : d > 0 &&
+                    b + p > t.top + t.minSize.height &&
+                    ((y = l.x = y + t.columnWidths[l.line] + i.padding), (b = l.y = t.top + i.padding), l.line++),
+                  (function (t, i, n) {
+                    if (!(isNaN(f) || f <= 0)) {
+                      u.save();
+                      var o = gn(n.lineWidth, r.borderWidth);
+                      if (
+                        ((u.fillStyle = gn(n.fillStyle, a)),
+                        (u.lineCap = gn(n.lineCap, r.borderCapStyle)),
+                        (u.lineDashOffset = gn(n.lineDashOffset, r.borderDashOffset)),
+                        (u.lineJoin = gn(n.lineJoin, r.borderJoinStyle)),
+                        (u.lineWidth = o),
+                        (u.strokeStyle = gn(n.strokeStyle, a)),
+                        u.setLineDash && u.setLineDash(gn(n.lineDash, r.borderDash)),
+                        e.labels && e.labels.usePointStyle)
+                      ) {
+                        var s = (f * Math.SQRT2) / 2,
+                          l = t + f / 2,
+                          d = i + c / 2;
+                        ut.canvas.drawPoint(u, n.pointStyle, s, l, d);
+                      } else 0 !== o && u.strokeRect(t, i, f, c), u.fillRect(t, i, f, c);
+                      u.restore();
+                    }
+                  })(y, b, n),
+                  (g[d].left = y),
+                  (g[d].top = b),
+                  (function (t, e, i, n) {
+                    var a = c / 2,
+                      r = f + a + t,
+                      o = e + a;
+                    u.fillText(i.text, r, o),
+                      i.hidden && (u.beginPath(), (u.lineWidth = 2), u.moveTo(r, o), u.lineTo(r + n, o), u.stroke());
+                  })(y, b, n, h),
+                  m ? (l.x += v + i.padding) : (l.y += p);
+              });
+            }
+          },
+          _getLegendItemAt: function (t, e) {
+            var i,
+              n,
+              a,
+              r = this;
+            if (t >= r.left && t <= r.right && e >= r.top && e <= r.bottom)
+              for (a = r.legendHitBoxes, i = 0; i < a.length; ++i)
+                if (t >= (n = a[i]).left && t <= n.left + n.width && e >= n.top && e <= n.top + n.height)
+                  return r.legendItems[i];
+            return null;
+          },
+          handleEvent: function (t) {
+            var e,
+              i = this,
+              n = i.options,
+              a = "mouseup" === t.type ? "click" : t.type;
+            if ("mousemove" === a) {
+              if (!n.onHover && !n.onLeave) return;
+            } else {
+              if ("click" !== a) return;
+              if (!n.onClick) return;
+            }
+            (e = i._getLegendItemAt(t.x, t.y)),
+              "click" === a
+                ? e && n.onClick && n.onClick.call(i, t.native, e)
+                : (n.onLeave &&
+                    e !== i._hoveredItem &&
+                    (i._hoveredItem && n.onLeave.call(i, t.native, i._hoveredItem), (i._hoveredItem = e)),
+                  n.onHover && e && n.onHover.call(i, t.native, e));
+          },
+        });
+        function vn(t, e) {
+          var i = new pn({ ctx: t.ctx, options: e, chart: t });
+          xe.configure(t, i, e), xe.addBox(t, i), (t.legend = i);
+        }
+        var yn = {
+            id: "legend",
+            _element: pn,
+            beforeInit: function (t) {
+              var e = t.options.legend;
+              e && vn(t, e);
+            },
+            beforeUpdate: function (t) {
+              var e = t.options.legend,
+                i = t.legend;
+              e
+                ? (ut.mergeIf(e, ot.global.legend), i ? (xe.configure(t, i, e), (i.options = e)) : vn(t, e))
+                : i && (xe.removeBox(t, i), delete t.legend);
+            },
+            afterEvent: function (t, e) {
+              var i = t.legend;
+              i && i.handleEvent(e);
+            },
+          },
+          bn = ut.noop;
+        ot._set("global", {
+          title: { display: !1, fontStyle: "bold", fullWidth: !0, padding: 10, position: "top", text: "", weight: 2e3 },
+        });
+        var xn = gt.extend({
+          initialize: function (t) {
+            ut.extend(this, t), (this.legendHitBoxes = []);
+          },
+          beforeUpdate: bn,
+          update: function (t, e, i) {
+            var n = this;
+            return (
+              n.beforeUpdate(),
+              (n.maxWidth = t),
+              (n.maxHeight = e),
+              (n.margins = i),
+              n.beforeSetDimensions(),
+              n.setDimensions(),
+              n.afterSetDimensions(),
+              n.beforeBuildLabels(),
+              n.buildLabels(),
+              n.afterBuildLabels(),
+              n.beforeFit(),
+              n.fit(),
+              n.afterFit(),
+              n.afterUpdate(),
+              n.minSize
+            );
+          },
+          afterUpdate: bn,
+          beforeSetDimensions: bn,
+          setDimensions: function () {
+            var t = this;
+            t.isHorizontal()
+              ? ((t.width = t.maxWidth), (t.left = 0), (t.right = t.width))
+              : ((t.height = t.maxHeight), (t.top = 0), (t.bottom = t.height)),
+              (t.paddingLeft = 0),
+              (t.paddingTop = 0),
+              (t.paddingRight = 0),
+              (t.paddingBottom = 0),
+              (t.minSize = { width: 0, height: 0 });
+          },
+          afterSetDimensions: bn,
+          beforeBuildLabels: bn,
+          buildLabels: bn,
+          afterBuildLabels: bn,
+          beforeFit: bn,
+          fit: function () {
+            var t = this,
+              e = t.options,
+              i = e.display,
+              n = t.minSize,
+              a = ut.isArray(e.text) ? e.text.length : 1,
+              r = ut.options._parseFont(e),
+              o = i ? a * r.lineHeight + 2 * e.padding : 0;
+            t.isHorizontal() ? ((n.width = t.maxWidth), (n.height = o)) : ((n.width = o), (n.height = t.maxHeight)),
+              (t.width = n.width),
+              (t.height = n.height);
+          },
+          afterFit: bn,
+          isHorizontal: function () {
+            var t = this.options.position;
+            return "top" === t || "bottom" === t;
+          },
+          draw: function () {
+            var t = this,
+              e = t.ctx,
+              i = t.options;
+            if (i.display) {
+              var n,
+                a,
+                r,
+                o = ut.options._parseFont(i),
+                s = o.lineHeight,
+                l = s / 2 + i.padding,
+                u = 0,
+                d = t.top,
+                h = t.left,
+                c = t.bottom,
+                f = t.right;
+              (e.fillStyle = ut.valueOrDefault(i.fontColor, ot.global.defaultFontColor)),
+                (e.font = o.string),
+                t.isHorizontal()
+                  ? ((a = h + (f - h) / 2), (r = d + l), (n = f - h))
+                  : ((a = "left" === i.position ? h + l : f - l),
+                    (r = d + (c - d) / 2),
+                    (n = c - d),
+                    (u = Math.PI * ("left" === i.position ? -0.5 : 0.5))),
+                e.save(),
+                e.translate(a, r),
+                e.rotate(u),
+                (e.textAlign = "center"),
+                (e.textBaseline = "middle");
+              var g = i.text;
+              if (ut.isArray(g)) for (var m = 0, p = 0; p < g.length; ++p) e.fillText(g[p], 0, m, n), (m += s);
+              else e.fillText(g, 0, 0, n);
+              e.restore();
+            }
+          },
+        });
+        function _n(t, e) {
+          var i = new xn({ ctx: t.ctx, options: e, chart: t });
+          xe.configure(t, i, e), xe.addBox(t, i), (t.titleBlock = i);
+        }
+        var kn = {},
+          wn = cn,
+          Mn = yn,
+          Sn = {
+            id: "title",
+            _element: xn,
+            beforeInit: function (t) {
+              var e = t.options.title;
+              e && _n(t, e);
+            },
+            beforeUpdate: function (t) {
+              var e = t.options.title,
+                i = t.titleBlock;
+              e
+                ? (ut.mergeIf(e, ot.global.title), i ? (xe.configure(t, i, e), (i.options = e)) : _n(t, e))
+                : i && (xe.removeBox(t, i), delete t.titleBlock);
+            },
+          };
+        for (var Dn in ((kn.filler = wn),
+        (kn.legend = Mn),
+        (kn.title = Sn),
+        (ai.helpers = ut),
+        (function () {
+          function t(t, e, i) {
+            var n;
+            return (
+              "string" == typeof t
+                ? ((n = parseInt(t, 10)), -1 !== t.indexOf("%") && (n = (n / 100) * e.parentNode[i]))
+                : (n = t),
+              n
+            );
+          }
+          function e(t) {
+            return null != t && "none" !== t;
+          }
+          function i(i, n, a) {
+            var r = document.defaultView,
+              o = ut._getParentNode(i),
+              s = r.getComputedStyle(i)[n],
+              l = r.getComputedStyle(o)[n],
+              u = e(s),
+              d = e(l),
+              h = Number.POSITIVE_INFINITY;
+            return u || d ? Math.min(u ? t(s, i, a) : h, d ? t(l, o, a) : h) : "none";
+          }
+          (ut.where = function (t, e) {
+            if (ut.isArray(t) && Array.prototype.filter) return t.filter(e);
+            var i = [];
+            return (
+              ut.each(t, function (t) {
+                e(t) && i.push(t);
+              }),
+              i
+            );
+          }),
+            (ut.findIndex = Array.prototype.findIndex
+              ? function (t, e, i) {
+                  return t.findIndex(e, i);
+                }
+              : function (t, e, i) {
+                  i = void 0 === i ? t : i;
+                  for (var n = 0, a = t.length; n < a; ++n) if (e.call(i, t[n], n, t)) return n;
+                  return -1;
+                }),
+            (ut.findNextWhere = function (t, e, i) {
+              ut.isNullOrUndef(i) && (i = -1);
+              for (var n = i + 1; n < t.length; n++) {
+                var a = t[n];
+                if (e(a)) return a;
+              }
+            }),
+            (ut.findPreviousWhere = function (t, e, i) {
+              ut.isNullOrUndef(i) && (i = t.length);
+              for (var n = i - 1; n >= 0; n--) {
+                var a = t[n];
+                if (e(a)) return a;
+              }
+            }),
+            (ut.isNumber = function (t) {
+              return !isNaN(parseFloat(t)) && isFinite(t);
+            }),
+            (ut.almostEquals = function (t, e, i) {
+              return Math.abs(t - e) < i;
+            }),
+            (ut.almostWhole = function (t, e) {
+              var i = Math.round(t);
+              return i - e < t && i + e > t;
+            }),
+            (ut.max = function (t) {
+              return t.reduce(function (t, e) {
+                return isNaN(e) ? t : Math.max(t, e);
+              }, Number.NEGATIVE_INFINITY);
+            }),
+            (ut.min = function (t) {
+              return t.reduce(function (t, e) {
+                return isNaN(e) ? t : Math.min(t, e);
+              }, Number.POSITIVE_INFINITY);
+            }),
+            (ut.sign = Math.sign
+              ? function (t) {
+                  return Math.sign(t);
+                }
+              : function (t) {
+                  return 0 == (t = +t) || isNaN(t) ? t : t > 0 ? 1 : -1;
+                }),
+            (ut.log10 = Math.log10
+              ? function (t) {
+                  return Math.log10(t);
+                }
+              : function (t) {
+                  var e = Math.log(t) * Math.LOG10E,
+                    i = Math.round(e);
+                  return t === Math.pow(10, i) ? i : e;
+                }),
+            (ut.toRadians = function (t) {
+              return t * (Math.PI / 180);
+            }),
+            (ut.toDegrees = function (t) {
+              return t * (180 / Math.PI);
+            }),
+            (ut._decimalPlaces = function (t) {
+              if (ut.isFinite(t)) {
+                for (var e = 1, i = 0; Math.round(t * e) / e !== t; ) (e *= 10), i++;
+                return i;
+              }
+            }),
+            (ut.getAngleFromPoint = function (t, e) {
+              var i = e.x - t.x,
+                n = e.y - t.y,
+                a = Math.sqrt(i * i + n * n),
+                r = Math.atan2(n, i);
+              return r < -0.5 * Math.PI && (r += 2 * Math.PI), { angle: r, distance: a };
+            }),
+            (ut.distanceBetweenPoints = function (t, e) {
+              return Math.sqrt(Math.pow(e.x - t.x, 2) + Math.pow(e.y - t.y, 2));
+            }),
+            (ut.aliasPixel = function (t) {
+              return t % 2 == 0 ? 0 : 0.5;
+            }),
+            (ut._alignPixel = function (t, e, i) {
+              var n = t.currentDevicePixelRatio,
+                a = i / 2;
+              return Math.round((e - a) * n) / n + a;
+            }),
+            (ut.splineCurve = function (t, e, i, n) {
+              var a = t.skip ? e : t,
+                r = e,
+                o = i.skip ? e : i,
+                s = Math.sqrt(Math.pow(r.x - a.x, 2) + Math.pow(r.y - a.y, 2)),
+                l = Math.sqrt(Math.pow(o.x - r.x, 2) + Math.pow(o.y - r.y, 2)),
+                u = s / (s + l),
+                d = l / (s + l),
+                h = n * (u = isNaN(u) ? 0 : u),
+                c = n * (d = isNaN(d) ? 0 : d);
+              return {
+                previous: { x: r.x - h * (o.x - a.x), y: r.y - h * (o.y - a.y) },
+                next: { x: r.x + c * (o.x - a.x), y: r.y + c * (o.y - a.y) },
+              };
+            }),
+            (ut.EPSILON = Number.EPSILON || 1e-14),
+            (ut.splineCurveMonotone = function (t) {
+              var e,
+                i,
+                n,
+                a,
+                r,
+                o,
+                s,
+                l,
+                u,
+                d = (t || []).map(function (t) {
+                  return { model: t._model, deltaK: 0, mK: 0 };
+                }),
+                h = d.length;
+              for (e = 0; e < h; ++e)
+                if (!(n = d[e]).model.skip) {
+                  if (((i = e > 0 ? d[e - 1] : null), (a = e < h - 1 ? d[e + 1] : null) && !a.model.skip)) {
+                    var c = a.model.x - n.model.x;
+                    n.deltaK = 0 !== c ? (a.model.y - n.model.y) / c : 0;
+                  }
+                  !i || i.model.skip
+                    ? (n.mK = n.deltaK)
+                    : !a || a.model.skip
+                      ? (n.mK = i.deltaK)
+                      : this.sign(i.deltaK) !== this.sign(n.deltaK)
+                        ? (n.mK = 0)
+                        : (n.mK = (i.deltaK + n.deltaK) / 2);
+                }
+              for (e = 0; e < h - 1; ++e)
+                (n = d[e]),
+                  (a = d[e + 1]),
+                  n.model.skip ||
+                    a.model.skip ||
+                    (ut.almostEquals(n.deltaK, 0, this.EPSILON)
+                      ? (n.mK = a.mK = 0)
+                      : ((r = n.mK / n.deltaK),
+                        (o = a.mK / n.deltaK),
+                        (l = Math.pow(r, 2) + Math.pow(o, 2)) <= 9 ||
+                          ((s = 3 / Math.sqrt(l)), (n.mK = r * s * n.deltaK), (a.mK = o * s * n.deltaK))));
+              for (e = 0; e < h; ++e)
+                (n = d[e]).model.skip ||
+                  ((i = e > 0 ? d[e - 1] : null),
+                  (a = e < h - 1 ? d[e + 1] : null),
+                  i &&
+                    !i.model.skip &&
+                    ((u = (n.model.x - i.model.x) / 3),
+                    (n.model.controlPointPreviousX = n.model.x - u),
+                    (n.model.controlPointPreviousY = n.model.y - u * n.mK)),
+                  a &&
+                    !a.model.skip &&
+                    ((u = (a.model.x - n.model.x) / 3),
+                    (n.model.controlPointNextX = n.model.x + u),
+                    (n.model.controlPointNextY = n.model.y + u * n.mK)));
+            }),
+            (ut.nextItem = function (t, e, i) {
+              return i ? (e >= t.length - 1 ? t[0] : t[e + 1]) : e >= t.length - 1 ? t[t.length - 1] : t[e + 1];
+            }),
+            (ut.previousItem = function (t, e, i) {
+              return i ? (e <= 0 ? t[t.length - 1] : t[e - 1]) : e <= 0 ? t[0] : t[e - 1];
+            }),
+            (ut.niceNum = function (t, e) {
+              var i = Math.floor(ut.log10(t)),
+                n = t / Math.pow(10, i);
+              return (
+                (e ? (n < 1.5 ? 1 : n < 3 ? 2 : n < 7 ? 5 : 10) : n <= 1 ? 1 : n <= 2 ? 2 : n <= 5 ? 5 : 10) *
+                Math.pow(10, i)
+              );
+            }),
+            (ut.requestAnimFrame =
+              "undefined" == typeof window
+                ? function (t) {
+                    t();
+                  }
+                : window.requestAnimationFrame ||
+                  window.webkitRequestAnimationFrame ||
+                  window.mozRequestAnimationFrame ||
+                  window.oRequestAnimationFrame ||
+                  window.msRequestAnimationFrame ||
+                  function (t) {
+                    return window.setTimeout(t, 1e3 / 60);
+                  }),
+            (ut.getRelativePosition = function (t, e) {
+              var i,
+                n,
+                a = t.originalEvent || t,
+                r = t.target || t.srcElement,
+                o = r.getBoundingClientRect(),
+                s = a.touches;
+              s && s.length > 0 ? ((i = s[0].clientX), (n = s[0].clientY)) : ((i = a.clientX), (n = a.clientY));
+              var l = parseFloat(ut.getStyle(r, "padding-left")),
+                u = parseFloat(ut.getStyle(r, "padding-top")),
+                d = parseFloat(ut.getStyle(r, "padding-right")),
+                h = parseFloat(ut.getStyle(r, "padding-bottom")),
+                c = o.right - o.left - l - d,
+                f = o.bottom - o.top - u - h;
+              return {
+                x: (i = Math.round((((i - o.left - l) / c) * r.width) / e.currentDevicePixelRatio)),
+                y: (n = Math.round((((n - o.top - u) / f) * r.height) / e.currentDevicePixelRatio)),
+              };
+            }),
+            (ut.getConstraintWidth = function (t) {
+              return i(t, "max-width", "clientWidth");
+            }),
+            (ut.getConstraintHeight = function (t) {
+              return i(t, "max-height", "clientHeight");
+            }),
+            (ut._calculatePadding = function (t, e, i) {
+              return (e = ut.getStyle(t, e)).indexOf("%") > -1 ? (i * parseInt(e, 10)) / 100 : parseInt(e, 10);
+            }),
+            (ut._getParentNode = function (t) {
+              var e = t.parentNode;
+              return e && "[object ShadowRoot]" === e.toString() && (e = e.host), e;
+            }),
+            (ut.getMaximumWidth = function (t) {
+              var e = ut._getParentNode(t);
+              if (!e) return t.clientWidth;
+              var i = e.clientWidth,
+                n = i - ut._calculatePadding(e, "padding-left", i) - ut._calculatePadding(e, "padding-right", i),
+                a = ut.getConstraintWidth(t);
+              return isNaN(a) ? n : Math.min(n, a);
+            }),
+            (ut.getMaximumHeight = function (t) {
+              var e = ut._getParentNode(t);
+              if (!e) return t.clientHeight;
+              var i = e.clientHeight,
+                n = i - ut._calculatePadding(e, "padding-top", i) - ut._calculatePadding(e, "padding-bottom", i),
+                a = ut.getConstraintHeight(t);
+              return isNaN(a) ? n : Math.min(n, a);
+            }),
+            (ut.getStyle = function (t, e) {
+              return t.currentStyle
+                ? t.currentStyle[e]
+                : document.defaultView.getComputedStyle(t, null).getPropertyValue(e);
+            }),
+            (ut.retinaScale = function (t, e) {
+              var i = (t.currentDevicePixelRatio = e || ("undefined" != typeof window && window.devicePixelRatio) || 1);
+              if (1 !== i) {
+                var n = t.canvas,
+                  a = t.height,
+                  r = t.width;
+                (n.height = a * i),
+                  (n.width = r * i),
+                  t.ctx.scale(i, i),
+                  n.style.height || n.style.width || ((n.style.height = a + "px"), (n.style.width = r + "px"));
+              }
+            }),
+            (ut.fontString = function (t, e, i) {
+              return e + " " + t + "px " + i;
+            }),
+            (ut.longestText = function (t, e, i, n) {
+              var a = ((n = n || {}).data = n.data || {}),
+                r = (n.garbageCollect = n.garbageCollect || []);
+              n.font !== e && ((a = n.data = {}), (r = n.garbageCollect = []), (n.font = e)), (t.font = e);
+              var o = 0;
+              ut.each(i, function (e) {
+                null != e && !0 !== ut.isArray(e)
+                  ? (o = ut.measureText(t, a, r, o, e))
+                  : ut.isArray(e) &&
+                    ut.each(e, function (e) {
+                      null == e || ut.isArray(e) || (o = ut.measureText(t, a, r, o, e));
+                    });
+              });
+              var s = r.length / 2;
+              if (s > i.length) {
+                for (var l = 0; l < s; l++) delete a[r[l]];
+                r.splice(0, s);
+              }
+              return o;
+            }),
+            (ut.measureText = function (t, e, i, n, a) {
+              var r = e[a];
+              return r || ((r = e[a] = t.measureText(a).width), i.push(a)), r > n && (n = r), n;
+            }),
+            (ut.numberOfLabelLines = function (t) {
+              var e = 1;
+              return (
+                ut.each(t, function (t) {
+                  ut.isArray(t) && t.length > e && (e = t.length);
+                }),
+                e
+              );
+            }),
+            (ut.color = G
+              ? function (t) {
+                  return t instanceof CanvasGradient && (t = ot.global.defaultColor), G(t);
+                }
+              : function (t) {
+                  return console.error("Color.js not found!"), t;
+                }),
+            (ut.getHoverColor = function (t) {
+              return t instanceof CanvasPattern || t instanceof CanvasGradient
+                ? t
+                : ut.color(t).saturate(0.5).darken(0.1).rgbString();
+            });
+        })(),
+        (ai._adapters = si),
+        (ai.Animation = pt),
+        (ai.animationService = vt),
+        (ai.controllers = ue),
+        (ai.DatasetController = kt),
+        (ai.defaults = ot),
+        (ai.Element = gt),
+        (ai.elements = Nt),
+        (ai.Interaction = pe),
+        (ai.layouts = xe),
+        (ai.platform = Ve),
+        (ai.plugins = He),
+        (ai.Scale = fi),
+        (ai.scaleService = Ee),
+        (ai.Ticks = li),
+        (ai.Tooltip = Je),
+        ai.helpers.each(en, function (t, e) {
+          ai.scaleService.registerScaleType(e, t, t._defaults);
+        }),
+        kn))
+          kn.hasOwnProperty(Dn) && ai.plugins.register(kn[Dn]);
+        ai.platform.initialize();
+        var Cn = ai;
+        return (
+          "undefined" != typeof window && (window.Chart = ai),
+          (ai.Chart = ai),
+          (ai.Legend = kn.legend._element),
+          (ai.Title = kn.title._element),
+          (ai.pluginService = ai.plugins),
+          (ai.PluginBase = ai.Element.extend({})),
+          (ai.canvasHelpers = ai.helpers.canvas),
+          (ai.layoutService = ai.layouts),
+          (ai.LinearScaleBase = yi),
+          ai.helpers.each(["Bar", "Bubble", "Doughnut", "Line", "PolarArea", "Radar", "Scatter"], function (t) {
+            ai[t] = function (e, i) {
+              return new ai(e, ai.helpers.merge(i || {}, { type: t.charAt(0).toLowerCase() + t.slice(1) }));
+            };
+          }),
+          Cn
+        );
+      });
+    </script>
+    <script>
+      /*
+       * @license
+       * chartjs-plugin-colorschemes
+       * https://github.com/nagix/chartjs-plugin-colorschemes/
+       * Version: 0.3.0
+       *
+       * Copyright 2019 Akihiko Kusanagi
+       * Released under the MIT license
+       * https://github.com/nagix/chartjs-plugin-colorschemes/blob/master/LICENSE.md
+       */
+      !(function (f, e) {
+        "object" == typeof exports && "undefined" != typeof module
+          ? (module.exports = e(require("chart.js")))
+          : "function" == typeof define && define.amd
+            ? define(["chart.js"], e)
+            : (f["chartjs-plugin-colorschemes"] = e(f.Chart));
+      })(this, function (f) {
+        "use strict";
+        f = f && f.hasOwnProperty("default") ? f.default : f;
+        var o = {
+            brewer: {
+              YlGn3: ["#f7fcb9", "#addd8e", "#31a354"],
+              YlGn4: ["#ffffcc", "#c2e699", "#78c679", "#238443"],
+              YlGn5: ["#ffffcc", "#c2e699", "#78c679", "#31a354", "#006837"],
+              YlGn6: ["#ffffcc", "#d9f0a3", "#addd8e", "#78c679", "#31a354", "#006837"],
+              YlGn7: ["#ffffcc", "#d9f0a3", "#addd8e", "#78c679", "#41ab5d", "#238443", "#005a32"],
+              YlGn8: ["#ffffe5", "#f7fcb9", "#d9f0a3", "#addd8e", "#78c679", "#41ab5d", "#238443", "#005a32"],
+              YlGn9: [
+                "#ffffe5",
+                "#f7fcb9",
+                "#d9f0a3",
+                "#addd8e",
+                "#78c679",
+                "#41ab5d",
+                "#238443",
+                "#006837",
+                "#004529",
+              ],
+              YlGnBu3: ["#edf8b1", "#7fcdbb", "#2c7fb8"],
+              YlGnBu4: ["#ffffcc", "#a1dab4", "#41b6c4", "#225ea8"],
+              YlGnBu5: ["#ffffcc", "#a1dab4", "#41b6c4", "#2c7fb8", "#253494"],
+              YlGnBu6: ["#ffffcc", "#c7e9b4", "#7fcdbb", "#41b6c4", "#2c7fb8", "#253494"],
+              YlGnBu7: ["#ffffcc", "#c7e9b4", "#7fcdbb", "#41b6c4", "#1d91c0", "#225ea8", "#0c2c84"],
+              YlGnBu8: ["#ffffd9", "#edf8b1", "#c7e9b4", "#7fcdbb", "#41b6c4", "#1d91c0", "#225ea8", "#0c2c84"],
+              YlGnBu9: [
+                "#ffffd9",
+                "#edf8b1",
+                "#c7e9b4",
+                "#7fcdbb",
+                "#41b6c4",
+                "#1d91c0",
+                "#225ea8",
+                "#253494",
+                "#081d58",
+              ],
+              GnBu3: ["#e0f3db", "#a8ddb5", "#43a2ca"],
+              GnBu4: ["#f0f9e8", "#bae4bc", "#7bccc4", "#2b8cbe"],
+              GnBu5: ["#f0f9e8", "#bae4bc", "#7bccc4", "#43a2ca", "#0868ac"],
+              GnBu6: ["#f0f9e8", "#ccebc5", "#a8ddb5", "#7bccc4", "#43a2ca", "#0868ac"],
+              GnBu7: ["#f0f9e8", "#ccebc5", "#a8ddb5", "#7bccc4", "#4eb3d3", "#2b8cbe", "#08589e"],
+              GnBu8: ["#f7fcf0", "#e0f3db", "#ccebc5", "#a8ddb5", "#7bccc4", "#4eb3d3", "#2b8cbe", "#08589e"],
+              GnBu9: [
+                "#f7fcf0",
+                "#e0f3db",
+                "#ccebc5",
+                "#a8ddb5",
+                "#7bccc4",
+                "#4eb3d3",
+                "#2b8cbe",
+                "#0868ac",
+                "#084081",
+              ],
+              BuGn3: ["#e5f5f9", "#99d8c9", "#2ca25f"],
+              BuGn4: ["#edf8fb", "#b2e2e2", "#66c2a4", "#238b45"],
+              BuGn5: ["#edf8fb", "#b2e2e2", "#66c2a4", "#2ca25f", "#006d2c"],
+              BuGn6: ["#edf8fb", "#ccece6", "#99d8c9", "#66c2a4", "#2ca25f", "#006d2c"],
+              BuGn7: ["#edf8fb", "#ccece6", "#99d8c9", "#66c2a4", "#41ae76", "#238b45", "#005824"],
+              BuGn8: ["#f7fcfd", "#e5f5f9", "#ccece6", "#99d8c9", "#66c2a4", "#41ae76", "#238b45", "#005824"],
+              BuGn9: [
+                "#f7fcfd",
+                "#e5f5f9",
+                "#ccece6",
+                "#99d8c9",
+                "#66c2a4",
+                "#41ae76",
+                "#238b45",
+                "#006d2c",
+                "#00441b",
+              ],
+              PuBuGn3: ["#ece2f0", "#a6bddb", "#1c9099"],
+              PuBuGn4: ["#f6eff7", "#bdc9e1", "#67a9cf", "#02818a"],
+              PuBuGn5: ["#f6eff7", "#bdc9e1", "#67a9cf", "#1c9099", "#016c59"],
+              PuBuGn6: ["#f6eff7", "#d0d1e6", "#a6bddb", "#67a9cf", "#1c9099", "#016c59"],
+              PuBuGn7: ["#f6eff7", "#d0d1e6", "#a6bddb", "#67a9cf", "#3690c0", "#02818a", "#016450"],
+              PuBuGn8: ["#fff7fb", "#ece2f0", "#d0d1e6", "#a6bddb", "#67a9cf", "#3690c0", "#02818a", "#016450"],
+              PuBuGn9: [
+                "#fff7fb",
+                "#ece2f0",
+                "#d0d1e6",
+                "#a6bddb",
+                "#67a9cf",
+                "#3690c0",
+                "#02818a",
+                "#016c59",
+                "#014636",
+              ],
+              PuBu3: ["#ece7f2", "#a6bddb", "#2b8cbe"],
+              PuBu4: ["#f1eef6", "#bdc9e1", "#74a9cf", "#0570b0"],
+              PuBu5: ["#f1eef6", "#bdc9e1", "#74a9cf", "#2b8cbe", "#045a8d"],
+              PuBu6: ["#f1eef6", "#d0d1e6", "#a6bddb", "#74a9cf", "#2b8cbe", "#045a8d"],
+              PuBu7: ["#f1eef6", "#d0d1e6", "#a6bddb", "#74a9cf", "#3690c0", "#0570b0", "#034e7b"],
+              PuBu8: ["#fff7fb", "#ece7f2", "#d0d1e6", "#a6bddb", "#74a9cf", "#3690c0", "#0570b0", "#034e7b"],
+              PuBu9: [
+                "#fff7fb",
+                "#ece7f2",
+                "#d0d1e6",
+                "#a6bddb",
+                "#74a9cf",
+                "#3690c0",
+                "#0570b0",
+                "#045a8d",
+                "#023858",
+              ],
+              BuPu3: ["#e0ecf4", "#9ebcda", "#8856a7"],
+              BuPu4: ["#edf8fb", "#b3cde3", "#8c96c6", "#88419d"],
+              BuPu5: ["#edf8fb", "#b3cde3", "#8c96c6", "#8856a7", "#810f7c"],
+              BuPu6: ["#edf8fb", "#bfd3e6", "#9ebcda", "#8c96c6", "#8856a7", "#810f7c"],
+              BuPu7: ["#edf8fb", "#bfd3e6", "#9ebcda", "#8c96c6", "#8c6bb1", "#88419d", "#6e016b"],
+              BuPu8: ["#f7fcfd", "#e0ecf4", "#bfd3e6", "#9ebcda", "#8c96c6", "#8c6bb1", "#88419d", "#6e016b"],
+              BuPu9: [
+                "#f7fcfd",
+                "#e0ecf4",
+                "#bfd3e6",
+                "#9ebcda",
+                "#8c96c6",
+                "#8c6bb1",
+                "#88419d",
+                "#810f7c",
+                "#4d004b",
+              ],
+              RdPu3: ["#fde0dd", "#fa9fb5", "#c51b8a"],
+              RdPu4: ["#feebe2", "#fbb4b9", "#f768a1", "#ae017e"],
+              RdPu5: ["#feebe2", "#fbb4b9", "#f768a1", "#c51b8a", "#7a0177"],
+              RdPu6: ["#feebe2", "#fcc5c0", "#fa9fb5", "#f768a1", "#c51b8a", "#7a0177"],
+              RdPu7: ["#feebe2", "#fcc5c0", "#fa9fb5", "#f768a1", "#dd3497", "#ae017e", "#7a0177"],
+              RdPu8: ["#fff7f3", "#fde0dd", "#fcc5c0", "#fa9fb5", "#f768a1", "#dd3497", "#ae017e", "#7a0177"],
+              RdPu9: [
+                "#fff7f3",
+                "#fde0dd",
+                "#fcc5c0",
+                "#fa9fb5",
+                "#f768a1",
+                "#dd3497",
+                "#ae017e",
+                "#7a0177",
+                "#49006a",
+              ],
+              PuRd3: ["#e7e1ef", "#c994c7", "#dd1c77"],
+              PuRd4: ["#f1eef6", "#d7b5d8", "#df65b0", "#ce1256"],
+              PuRd5: ["#f1eef6", "#d7b5d8", "#df65b0", "#dd1c77", "#980043"],
+              PuRd6: ["#f1eef6", "#d4b9da", "#c994c7", "#df65b0", "#dd1c77", "#980043"],
+              PuRd7: ["#f1eef6", "#d4b9da", "#c994c7", "#df65b0", "#e7298a", "#ce1256", "#91003f"],
+              PuRd8: ["#f7f4f9", "#e7e1ef", "#d4b9da", "#c994c7", "#df65b0", "#e7298a", "#ce1256", "#91003f"],
+              PuRd9: [
+                "#f7f4f9",
+                "#e7e1ef",
+                "#d4b9da",
+                "#c994c7",
+                "#df65b0",
+                "#e7298a",
+                "#ce1256",
+                "#980043",
+                "#67001f",
+              ],
+              OrRd3: ["#fee8c8", "#fdbb84", "#e34a33"],
+              OrRd4: ["#fef0d9", "#fdcc8a", "#fc8d59", "#d7301f"],
+              OrRd5: ["#fef0d9", "#fdcc8a", "#fc8d59", "#e34a33", "#b30000"],
+              OrRd6: ["#fef0d9", "#fdd49e", "#fdbb84", "#fc8d59", "#e34a33", "#b30000"],
+              OrRd7: ["#fef0d9", "#fdd49e", "#fdbb84", "#fc8d59", "#ef6548", "#d7301f", "#990000"],
+              OrRd8: ["#fff7ec", "#fee8c8", "#fdd49e", "#fdbb84", "#fc8d59", "#ef6548", "#d7301f", "#990000"],
+              OrRd9: [
+                "#fff7ec",
+                "#fee8c8",
+                "#fdd49e",
+                "#fdbb84",
+                "#fc8d59",
+                "#ef6548",
+                "#d7301f",
+                "#b30000",
+                "#7f0000",
+              ],
+              YlOrRd3: ["#ffeda0", "#feb24c", "#f03b20"],
+              YlOrRd4: ["#ffffb2", "#fecc5c", "#fd8d3c", "#e31a1c"],
+              YlOrRd5: ["#ffffb2", "#fecc5c", "#fd8d3c", "#f03b20", "#bd0026"],
+              YlOrRd6: ["#ffffb2", "#fed976", "#feb24c", "#fd8d3c", "#f03b20", "#bd0026"],
+              YlOrRd7: ["#ffffb2", "#fed976", "#feb24c", "#fd8d3c", "#fc4e2a", "#e31a1c", "#b10026"],
+              YlOrRd8: ["#ffffcc", "#ffeda0", "#fed976", "#feb24c", "#fd8d3c", "#fc4e2a", "#e31a1c", "#b10026"],
+              YlOrRd9: [
+                "#ffffcc",
+                "#ffeda0",
+                "#fed976",
+                "#feb24c",
+                "#fd8d3c",
+                "#fc4e2a",
+                "#e31a1c",
+                "#bd0026",
+                "#800026",
+              ],
+              YlOrBr3: ["#fff7bc", "#fec44f", "#d95f0e"],
+              YlOrBr4: ["#ffffd4", "#fed98e", "#fe9929", "#cc4c02"],
+              YlOrBr5: ["#ffffd4", "#fed98e", "#fe9929", "#d95f0e", "#993404"],
+              YlOrBr6: ["#ffffd4", "#fee391", "#fec44f", "#fe9929", "#d95f0e", "#993404"],
+              YlOrBr7: ["#ffffd4", "#fee391", "#fec44f", "#fe9929", "#ec7014", "#cc4c02", "#8c2d04"],
+              YlOrBr8: ["#ffffe5", "#fff7bc", "#fee391", "#fec44f", "#fe9929", "#ec7014", "#cc4c02", "#8c2d04"],
+              YlOrBr9: [
+                "#ffffe5",
+                "#fff7bc",
+                "#fee391",
+                "#fec44f",
+                "#fe9929",
+                "#ec7014",
+                "#cc4c02",
+                "#993404",
+                "#662506",
+              ],
+              Purples3: ["#efedf5", "#bcbddc", "#756bb1"],
+              Purples4: ["#f2f0f7", "#cbc9e2", "#9e9ac8", "#6a51a3"],
+              Purples5: ["#f2f0f7", "#cbc9e2", "#9e9ac8", "#756bb1", "#54278f"],
+              Purples6: ["#f2f0f7", "#dadaeb", "#bcbddc", "#9e9ac8", "#756bb1", "#54278f"],
+              Purples7: ["#f2f0f7", "#dadaeb", "#bcbddc", "#9e9ac8", "#807dba", "#6a51a3", "#4a1486"],
+              Purples8: ["#fcfbfd", "#efedf5", "#dadaeb", "#bcbddc", "#9e9ac8", "#807dba", "#6a51a3", "#4a1486"],
+              Purples9: [
+                "#fcfbfd",
+                "#efedf5",
+                "#dadaeb",
+                "#bcbddc",
+                "#9e9ac8",
+                "#807dba",
+                "#6a51a3",
+                "#54278f",
+                "#3f007d",
+              ],
+              Blues3: ["#deebf7", "#9ecae1", "#3182bd"],
+              Blues4: ["#eff3ff", "#bdd7e7", "#6baed6", "#2171b5"],
+              Blues5: ["#eff3ff", "#bdd7e7", "#6baed6", "#3182bd", "#08519c"],
+              Blues6: ["#eff3ff", "#c6dbef", "#9ecae1", "#6baed6", "#3182bd", "#08519c"],
+              Blues7: ["#eff3ff", "#c6dbef", "#9ecae1", "#6baed6", "#4292c6", "#2171b5", "#084594"],
+              Blues8: ["#f7fbff", "#deebf7", "#c6dbef", "#9ecae1", "#6baed6", "#4292c6", "#2171b5", "#084594"],
+              Blues9: [
+                "#f7fbff",
+                "#deebf7",
+                "#c6dbef",
+                "#9ecae1",
+                "#6baed6",
+                "#4292c6",
+                "#2171b5",
+                "#08519c",
+                "#08306b",
+              ],
+              Greens3: ["#e5f5e0", "#a1d99b", "#31a354"],
+              Greens4: ["#edf8e9", "#bae4b3", "#74c476", "#238b45"],
+              Greens5: ["#edf8e9", "#bae4b3", "#74c476", "#31a354", "#006d2c"],
+              Greens6: ["#edf8e9", "#c7e9c0", "#a1d99b", "#74c476", "#31a354", "#006d2c"],
+              Greens7: ["#edf8e9", "#c7e9c0", "#a1d99b", "#74c476", "#41ab5d", "#238b45", "#005a32"],
+              Greens8: ["#f7fcf5", "#e5f5e0", "#c7e9c0", "#a1d99b", "#74c476", "#41ab5d", "#238b45", "#005a32"],
+              Greens9: [
+                "#f7fcf5",
+                "#e5f5e0",
+                "#c7e9c0",
+                "#a1d99b",
+                "#74c476",
+                "#41ab5d",
+                "#238b45",
+                "#006d2c",
+                "#00441b",
+              ],
+              Oranges3: ["#fee6ce", "#fdae6b", "#e6550d"],
+              Oranges4: ["#feedde", "#fdbe85", "#fd8d3c", "#d94701"],
+              Oranges5: ["#feedde", "#fdbe85", "#fd8d3c", "#e6550d", "#a63603"],
+              Oranges6: ["#feedde", "#fdd0a2", "#fdae6b", "#fd8d3c", "#e6550d", "#a63603"],
+              Oranges7: ["#feedde", "#fdd0a2", "#fdae6b", "#fd8d3c", "#f16913", "#d94801", "#8c2d04"],
+              Oranges8: ["#fff5eb", "#fee6ce", "#fdd0a2", "#fdae6b", "#fd8d3c", "#f16913", "#d94801", "#8c2d04"],
+              Oranges9: [
+                "#fff5eb",
+                "#fee6ce",
+                "#fdd0a2",
+                "#fdae6b",
+                "#fd8d3c",
+                "#f16913",
+                "#d94801",
+                "#a63603",
+                "#7f2704",
+              ],
+              Reds3: ["#fee0d2", "#fc9272", "#de2d26"],
+              Reds4: ["#fee5d9", "#fcae91", "#fb6a4a", "#cb181d"],
+              Reds5: ["#fee5d9", "#fcae91", "#fb6a4a", "#de2d26", "#a50f15"],
+              Reds6: ["#fee5d9", "#fcbba1", "#fc9272", "#fb6a4a", "#de2d26", "#a50f15"],
+              Reds7: ["#fee5d9", "#fcbba1", "#fc9272", "#fb6a4a", "#ef3b2c", "#cb181d", "#99000d"],
+              Reds8: ["#fff5f0", "#fee0d2", "#fcbba1", "#fc9272", "#fb6a4a", "#ef3b2c", "#cb181d", "#99000d"],
+              Reds9: [
+                "#fff5f0",
+                "#fee0d2",
+                "#fcbba1",
+                "#fc9272",
+                "#fb6a4a",
+                "#ef3b2c",
+                "#cb181d",
+                "#a50f15",
+                "#67000d",
+              ],
+              Greys3: ["#f0f0f0", "#bdbdbd", "#636363"],
+              Greys4: ["#f7f7f7", "#cccccc", "#969696", "#525252"],
+              Greys5: ["#f7f7f7", "#cccccc", "#969696", "#636363", "#252525"],
+              Greys6: ["#f7f7f7", "#d9d9d9", "#bdbdbd", "#969696", "#636363", "#252525"],
+              Greys7: ["#f7f7f7", "#d9d9d9", "#bdbdbd", "#969696", "#737373", "#525252", "#252525"],
+              Greys8: ["#ffffff", "#f0f0f0", "#d9d9d9", "#bdbdbd", "#969696", "#737373", "#525252", "#252525"],
+              Greys9: [
+                "#ffffff",
+                "#f0f0f0",
+                "#d9d9d9",
+                "#bdbdbd",
+                "#969696",
+                "#737373",
+                "#525252",
+                "#252525",
+                "#000000",
+              ],
+              PuOr3: ["#f1a340", "#f7f7f7", "#998ec3"],
+              PuOr4: ["#e66101", "#fdb863", "#b2abd2", "#5e3c99"],
+              PuOr5: ["#e66101", "#fdb863", "#f7f7f7", "#b2abd2", "#5e3c99"],
+              PuOr6: ["#b35806", "#f1a340", "#fee0b6", "#d8daeb", "#998ec3", "#542788"],
+              PuOr7: ["#b35806", "#f1a340", "#fee0b6", "#f7f7f7", "#d8daeb", "#998ec3", "#542788"],
+              PuOr8: ["#b35806", "#e08214", "#fdb863", "#fee0b6", "#d8daeb", "#b2abd2", "#8073ac", "#542788"],
+              PuOr9: [
+                "#b35806",
+                "#e08214",
+                "#fdb863",
+                "#fee0b6",
+                "#f7f7f7",
+                "#d8daeb",
+                "#b2abd2",
+                "#8073ac",
+                "#542788",
+              ],
+              PuOr10: [
+                "#7f3b08",
+                "#b35806",
+                "#e08214",
+                "#fdb863",
+                "#fee0b6",
+                "#d8daeb",
+                "#b2abd2",
+                "#8073ac",
+                "#542788",
+                "#2d004b",
+              ],
+              PuOr11: [
+                "#7f3b08",
+                "#b35806",
+                "#e08214",
+                "#fdb863",
+                "#fee0b6",
+                "#f7f7f7",
+                "#d8daeb",
+                "#b2abd2",
+                "#8073ac",
+                "#542788",
+                "#2d004b",
+              ],
+              BrBG3: ["#d8b365", "#f5f5f5", "#5ab4ac"],
+              BrBG4: ["#a6611a", "#dfc27d", "#80cdc1", "#018571"],
+              BrBG5: ["#a6611a", "#dfc27d", "#f5f5f5", "#80cdc1", "#018571"],
+              BrBG6: ["#8c510a", "#d8b365", "#f6e8c3", "#c7eae5", "#5ab4ac", "#01665e"],
+              BrBG7: ["#8c510a", "#d8b365", "#f6e8c3", "#f5f5f5", "#c7eae5", "#5ab4ac", "#01665e"],
+              BrBG8: ["#8c510a", "#bf812d", "#dfc27d", "#f6e8c3", "#c7eae5", "#80cdc1", "#35978f", "#01665e"],
+              BrBG9: [
+                "#8c510a",
+                "#bf812d",
+                "#dfc27d",
+                "#f6e8c3",
+                "#f5f5f5",
+                "#c7eae5",
+                "#80cdc1",
+                "#35978f",
+                "#01665e",
+              ],
+              BrBG10: [
+                "#543005",
+                "#8c510a",
+                "#bf812d",
+                "#dfc27d",
+                "#f6e8c3",
+                "#c7eae5",
+                "#80cdc1",
+                "#35978f",
+                "#01665e",
+                "#003c30",
+              ],
+              BrBG11: [
+                "#543005",
+                "#8c510a",
+                "#bf812d",
+                "#dfc27d",
+                "#f6e8c3",
+                "#f5f5f5",
+                "#c7eae5",
+                "#80cdc1",
+                "#35978f",
+                "#01665e",
+                "#003c30",
+              ],
+              PRGn3: ["#af8dc3", "#f7f7f7", "#7fbf7b"],
+              PRGn4: ["#7b3294", "#c2a5cf", "#a6dba0", "#008837"],
+              PRGn5: ["#7b3294", "#c2a5cf", "#f7f7f7", "#a6dba0", "#008837"],
+              PRGn6: ["#762a83", "#af8dc3", "#e7d4e8", "#d9f0d3", "#7fbf7b", "#1b7837"],
+              PRGn7: ["#762a83", "#af8dc3", "#e7d4e8", "#f7f7f7", "#d9f0d3", "#7fbf7b", "#1b7837"],
+              PRGn8: ["#762a83", "#9970ab", "#c2a5cf", "#e7d4e8", "#d9f0d3", "#a6dba0", "#5aae61", "#1b7837"],
+              PRGn9: [
+                "#762a83",
+                "#9970ab",
+                "#c2a5cf",
+                "#e7d4e8",
+                "#f7f7f7",
+                "#d9f0d3",
+                "#a6dba0",
+                "#5aae61",
+                "#1b7837",
+              ],
+              PRGn10: [
+                "#40004b",
+                "#762a83",
+                "#9970ab",
+                "#c2a5cf",
+                "#e7d4e8",
+                "#d9f0d3",
+                "#a6dba0",
+                "#5aae61",
+                "#1b7837",
+                "#00441b",
+              ],
+              PRGn11: [
+                "#40004b",
+                "#762a83",
+                "#9970ab",
+                "#c2a5cf",
+                "#e7d4e8",
+                "#f7f7f7",
+                "#d9f0d3",
+                "#a6dba0",
+                "#5aae61",
+                "#1b7837",
+                "#00441b",
+              ],
+              PiYG3: ["#e9a3c9", "#f7f7f7", "#a1d76a"],
+              PiYG4: ["#d01c8b", "#f1b6da", "#b8e186", "#4dac26"],
+              PiYG5: ["#d01c8b", "#f1b6da", "#f7f7f7", "#b8e186", "#4dac26"],
+              PiYG6: ["#c51b7d", "#e9a3c9", "#fde0ef", "#e6f5d0", "#a1d76a", "#4d9221"],
+              PiYG7: ["#c51b7d", "#e9a3c9", "#fde0ef", "#f7f7f7", "#e6f5d0", "#a1d76a", "#4d9221"],
+              PiYG8: ["#c51b7d", "#de77ae", "#f1b6da", "#fde0ef", "#e6f5d0", "#b8e186", "#7fbc41", "#4d9221"],
+              PiYG9: [
+                "#c51b7d",
+                "#de77ae",
+                "#f1b6da",
+                "#fde0ef",
+                "#f7f7f7",
+                "#e6f5d0",
+                "#b8e186",
+                "#7fbc41",
+                "#4d9221",
+              ],
+              PiYG10: [
+                "#8e0152",
+                "#c51b7d",
+                "#de77ae",
+                "#f1b6da",
+                "#fde0ef",
+                "#e6f5d0",
+                "#b8e186",
+                "#7fbc41",
+                "#4d9221",
+                "#276419",
+              ],
+              PiYG11: [
+                "#8e0152",
+                "#c51b7d",
+                "#de77ae",
+                "#f1b6da",
+                "#fde0ef",
+                "#f7f7f7",
+                "#e6f5d0",
+                "#b8e186",
+                "#7fbc41",
+                "#4d9221",
+                "#276419",
+              ],
+              RdBu3: ["#ef8a62", "#f7f7f7", "#67a9cf"],
+              RdBu4: ["#ca0020", "#f4a582", "#92c5de", "#0571b0"],
+              RdBu5: ["#ca0020", "#f4a582", "#f7f7f7", "#92c5de", "#0571b0"],
+              RdBu6: ["#b2182b", "#ef8a62", "#fddbc7", "#d1e5f0", "#67a9cf", "#2166ac"],
+              RdBu7: ["#b2182b", "#ef8a62", "#fddbc7", "#f7f7f7", "#d1e5f0", "#67a9cf", "#2166ac"],
+              RdBu8: ["#b2182b", "#d6604d", "#f4a582", "#fddbc7", "#d1e5f0", "#92c5de", "#4393c3", "#2166ac"],
+              RdBu9: [
+                "#b2182b",
+                "#d6604d",
+                "#f4a582",
+                "#fddbc7",
+                "#f7f7f7",
+                "#d1e5f0",
+                "#92c5de",
+                "#4393c3",
+                "#2166ac",
+              ],
+              RdBu10: [
+                "#67001f",
+                "#b2182b",
+                "#d6604d",
+                "#f4a582",
+                "#fddbc7",
+                "#d1e5f0",
+                "#92c5de",
+                "#4393c3",
+                "#2166ac",
+                "#053061",
+              ],
+              RdBu11: [
+                "#67001f",
+                "#b2182b",
+                "#d6604d",
+                "#f4a582",
+                "#fddbc7",
+                "#f7f7f7",
+                "#d1e5f0",
+                "#92c5de",
+                "#4393c3",
+                "#2166ac",
+                "#053061",
+              ],
+              RdGy3: ["#ef8a62", "#ffffff", "#999999"],
+              RdGy4: ["#ca0020", "#f4a582", "#bababa", "#404040"],
+              RdGy5: ["#ca0020", "#f4a582", "#ffffff", "#bababa", "#404040"],
+              RdGy6: ["#b2182b", "#ef8a62", "#fddbc7", "#e0e0e0", "#999999", "#4d4d4d"],
+              RdGy7: ["#b2182b", "#ef8a62", "#fddbc7", "#ffffff", "#e0e0e0", "#999999", "#4d4d4d"],
+              RdGy8: ["#b2182b", "#d6604d", "#f4a582", "#fddbc7", "#e0e0e0", "#bababa", "#878787", "#4d4d4d"],
+              RdGy9: [
+                "#b2182b",
+                "#d6604d",
+                "#f4a582",
+                "#fddbc7",
+                "#ffffff",
+                "#e0e0e0",
+                "#bababa",
+                "#878787",
+                "#4d4d4d",
+              ],
+              RdGy10: [
+                "#67001f",
+                "#b2182b",
+                "#d6604d",
+                "#f4a582",
+                "#fddbc7",
+                "#e0e0e0",
+                "#bababa",
+                "#878787",
+                "#4d4d4d",
+                "#1a1a1a",
+              ],
+              RdGy11: [
+                "#67001f",
+                "#b2182b",
+                "#d6604d",
+                "#f4a582",
+                "#fddbc7",
+                "#ffffff",
+                "#e0e0e0",
+                "#bababa",
+                "#878787",
+                "#4d4d4d",
+                "#1a1a1a",
+              ],
+              RdYlBu3: ["#fc8d59", "#ffffbf", "#91bfdb"],
+              RdYlBu4: ["#d7191c", "#fdae61", "#abd9e9", "#2c7bb6"],
+              RdYlBu5: ["#d7191c", "#fdae61", "#ffffbf", "#abd9e9", "#2c7bb6"],
+              RdYlBu6: ["#d73027", "#fc8d59", "#fee090", "#e0f3f8", "#91bfdb", "#4575b4"],
+              RdYlBu7: ["#d73027", "#fc8d59", "#fee090", "#ffffbf", "#e0f3f8", "#91bfdb", "#4575b4"],
+              RdYlBu8: ["#d73027", "#f46d43", "#fdae61", "#fee090", "#e0f3f8", "#abd9e9", "#74add1", "#4575b4"],
+              RdYlBu9: [
+                "#d73027",
+                "#f46d43",
+                "#fdae61",
+                "#fee090",
+                "#ffffbf",
+                "#e0f3f8",
+                "#abd9e9",
+                "#74add1",
+                "#4575b4",
+              ],
+              RdYlBu10: [
+                "#a50026",
+                "#d73027",
+                "#f46d43",
+                "#fdae61",
+                "#fee090",
+                "#e0f3f8",
+                "#abd9e9",
+                "#74add1",
+                "#4575b4",
+                "#313695",
+              ],
+              RdYlBu11: [
+                "#a50026",
+                "#d73027",
+                "#f46d43",
+                "#fdae61",
+                "#fee090",
+                "#ffffbf",
+                "#e0f3f8",
+                "#abd9e9",
+                "#74add1",
+                "#4575b4",
+                "#313695",
+              ],
+              Spectral3: ["#fc8d59", "#ffffbf", "#99d594"],
+              Spectral4: ["#d7191c", "#fdae61", "#abdda4", "#2b83ba"],
+              Spectral5: ["#d7191c", "#fdae61", "#ffffbf", "#abdda4", "#2b83ba"],
+              Spectral6: ["#d53e4f", "#fc8d59", "#fee08b", "#e6f598", "#99d594", "#3288bd"],
+              Spectral7: ["#d53e4f", "#fc8d59", "#fee08b", "#ffffbf", "#e6f598", "#99d594", "#3288bd"],
+              Spectral8: ["#d53e4f", "#f46d43", "#fdae61", "#fee08b", "#e6f598", "#abdda4", "#66c2a5", "#3288bd"],
+              Spectral9: [
+                "#d53e4f",
+                "#f46d43",
+                "#fdae61",
+                "#fee08b",
+                "#ffffbf",
+                "#e6f598",
+                "#abdda4",
+                "#66c2a5",
+                "#3288bd",
+              ],
+              Spectral10: [
+                "#9e0142",
+                "#d53e4f",
+                "#f46d43",
+                "#fdae61",
+                "#fee08b",
+                "#e6f598",
+                "#abdda4",
+                "#66c2a5",
+                "#3288bd",
+                "#5e4fa2",
+              ],
+              Spectral11: [
+                "#9e0142",
+                "#d53e4f",
+                "#f46d43",
+                "#fdae61",
+                "#fee08b",
+                "#ffffbf",
+                "#e6f598",
+                "#abdda4",
+                "#66c2a5",
+                "#3288bd",
+                "#5e4fa2",
+              ],
+              RdYlGn3: ["#fc8d59", "#ffffbf", "#91cf60"],
+              RdYlGn4: ["#d7191c", "#fdae61", "#a6d96a", "#1a9641"],
+              RdYlGn5: ["#d7191c", "#fdae61", "#ffffbf", "#a6d96a", "#1a9641"],
+              RdYlGn6: ["#d73027", "#fc8d59", "#fee08b", "#d9ef8b", "#91cf60", "#1a9850"],
+              RdYlGn7: ["#d73027", "#fc8d59", "#fee08b", "#ffffbf", "#d9ef8b", "#91cf60", "#1a9850"],
+              RdYlGn8: ["#d73027", "#f46d43", "#fdae61", "#fee08b", "#d9ef8b", "#a6d96a", "#66bd63", "#1a9850"],
+              RdYlGn9: [
+                "#d73027",
+                "#f46d43",
+                "#fdae61",
+                "#fee08b",
+                "#ffffbf",
+                "#d9ef8b",
+                "#a6d96a",
+                "#66bd63",
+                "#1a9850",
+              ],
+              RdYlGn10: [
+                "#a50026",
+                "#d73027",
+                "#f46d43",
+                "#fdae61",
+                "#fee08b",
+                "#d9ef8b",
+                "#a6d96a",
+                "#66bd63",
+                "#1a9850",
+                "#006837",
+              ],
+              RdYlGn11: [
+                "#a50026",
+                "#d73027",
+                "#f46d43",
+                "#fdae61",
+                "#fee08b",
+                "#ffffbf",
+                "#d9ef8b",
+                "#a6d96a",
+                "#66bd63",
+                "#1a9850",
+                "#006837",
+              ],
+              Accent3: ["#7fc97f", "#beaed4", "#fdc086"],
+              Accent4: ["#7fc97f", "#beaed4", "#fdc086", "#ffff99"],
+              Accent5: ["#7fc97f", "#beaed4", "#fdc086", "#ffff99", "#386cb0"],
+              Accent6: ["#7fc97f", "#beaed4", "#fdc086", "#ffff99", "#386cb0", "#f0027f"],
+              Accent7: ["#7fc97f", "#beaed4", "#fdc086", "#ffff99", "#386cb0", "#f0027f", "#bf5b17"],
+              Accent8: ["#7fc97f", "#beaed4", "#fdc086", "#ffff99", "#386cb0", "#f0027f", "#bf5b17", "#666666"],
+              "Dark2-3": ["#1b9e77", "#d95f02", "#7570b3"],
+              "Dark2-4": ["#1b9e77", "#d95f02", "#7570b3", "#e7298a"],
+              "Dark2-5": ["#1b9e77", "#d95f02", "#7570b3", "#e7298a", "#66a61e"],
+              "Dark2-6": ["#1b9e77", "#d95f02", "#7570b3", "#e7298a", "#66a61e", "#e6ab02"],
+              "Dark2-7": ["#1b9e77", "#d95f02", "#7570b3", "#e7298a", "#66a61e", "#e6ab02", "#a6761d"],
+              "Dark2-8": ["#1b9e77", "#d95f02", "#7570b3", "#e7298a", "#66a61e", "#e6ab02", "#a6761d", "#666666"],
+              Paired3: ["#a6cee3", "#1f78b4", "#b2df8a"],
+              Paired4: ["#a6cee3", "#1f78b4", "#b2df8a", "#33a02c"],
+              Paired5: ["#a6cee3", "#1f78b4", "#b2df8a", "#33a02c", "#fb9a99"],
+              Paired6: ["#a6cee3", "#1f78b4", "#b2df8a", "#33a02c", "#fb9a99", "#e31a1c"],
+              Paired7: ["#a6cee3", "#1f78b4", "#b2df8a", "#33a02c", "#fb9a99", "#e31a1c", "#fdbf6f"],
+              Paired8: ["#a6cee3", "#1f78b4", "#b2df8a", "#33a02c", "#fb9a99", "#e31a1c", "#fdbf6f", "#ff7f00"],
+              Paired9: [
+                "#a6cee3",
+                "#1f78b4",
+                "#b2df8a",
+                "#33a02c",
+                "#fb9a99",
+                "#e31a1c",
+                "#fdbf6f",
+                "#ff7f00",
+                "#cab2d6",
+              ],
+              Paired10: [
+                "#a6cee3",
+                "#1f78b4",
+                "#b2df8a",
+                "#33a02c",
+                "#fb9a99",
+                "#e31a1c",
+                "#fdbf6f",
+                "#ff7f00",
+                "#cab2d6",
+                "#6a3d9a",
+              ],
+              Paired11: [
+                "#a6cee3",
+                "#1f78b4",
+                "#b2df8a",
+                "#33a02c",
+                "#fb9a99",
+                "#e31a1c",
+                "#fdbf6f",
+                "#ff7f00",
+                "#cab2d6",
+                "#6a3d9a",
+                "#ffff99",
+              ],
+              Paired12: [
+                "#a6cee3",
+                "#1f78b4",
+                "#b2df8a",
+                "#33a02c",
+                "#fb9a99",
+                "#e31a1c",
+                "#fdbf6f",
+                "#ff7f00",
+                "#cab2d6",
+                "#6a3d9a",
+                "#ffff99",
+                "#b15928",
+              ],
+              "Pastel1-3": ["#fbb4ae", "#b3cde3", "#ccebc5"],
+              "Pastel1-4": ["#fbb4ae", "#b3cde3", "#ccebc5", "#decbe4"],
+              "Pastel1-5": ["#fbb4ae", "#b3cde3", "#ccebc5", "#decbe4", "#fed9a6"],
+              "Pastel1-6": ["#fbb4ae", "#b3cde3", "#ccebc5", "#decbe4", "#fed9a6", "#ffffcc"],
+              "Pastel1-7": ["#fbb4ae", "#b3cde3", "#ccebc5", "#decbe4", "#fed9a6", "#ffffcc", "#e5d8bd"],
+              "Pastel1-8": ["#fbb4ae", "#b3cde3", "#ccebc5", "#decbe4", "#fed9a6", "#ffffcc", "#e5d8bd", "#fddaec"],
+              "Pastel1-9": [
+                "#fbb4ae",
+                "#b3cde3",
+                "#ccebc5",
+                "#decbe4",
+                "#fed9a6",
+                "#ffffcc",
+                "#e5d8bd",
+                "#fddaec",
+                "#f2f2f2",
+              ],
+              "Pastel2-3": ["#b3e2cd", "#fdcdac", "#cbd5e8"],
+              "Pastel2-4": ["#b3e2cd", "#fdcdac", "#cbd5e8", "#f4cae4"],
+              "Pastel2-5": ["#b3e2cd", "#fdcdac", "#cbd5e8", "#f4cae4", "#e6f5c9"],
+              "Pastel2-6": ["#b3e2cd", "#fdcdac", "#cbd5e8", "#f4cae4", "#e6f5c9", "#fff2ae"],
+              "Pastel2-7": ["#b3e2cd", "#fdcdac", "#cbd5e8", "#f4cae4", "#e6f5c9", "#fff2ae", "#f1e2cc"],
+              "Pastel2-8": ["#b3e2cd", "#fdcdac", "#cbd5e8", "#f4cae4", "#e6f5c9", "#fff2ae", "#f1e2cc", "#cccccc"],
+              "Set1-3": ["#e41a1c", "#377eb8", "#4daf4a"],
+              "Set1-4": ["#e41a1c", "#377eb8", "#4daf4a", "#984ea3"],
+              "Set1-5": ["#e41a1c", "#377eb8", "#4daf4a", "#984ea3", "#ff7f00"],
+              "Set1-6": ["#e41a1c", "#377eb8", "#4daf4a", "#984ea3", "#ff7f00", "#ffff33"],
+              "Set1-7": ["#e41a1c", "#377eb8", "#4daf4a", "#984ea3", "#ff7f00", "#ffff33", "#a65628"],
+              "Set1-8": ["#e41a1c", "#377eb8", "#4daf4a", "#984ea3", "#ff7f00", "#ffff33", "#a65628", "#f781bf"],
+              "Set1-9": [
+                "#e41a1c",
+                "#377eb8",
+                "#4daf4a",
+                "#984ea3",
+                "#ff7f00",
+                "#ffff33",
+                "#a65628",
+                "#f781bf",
+                "#999999",
+              ],
+              "Set2-3": ["#66c2a5", "#fc8d62", "#8da0cb"],
+              "Set2-4": ["#66c2a5", "#fc8d62", "#8da0cb", "#e78ac3"],
+              "Set2-5": ["#66c2a5", "#fc8d62", "#8da0cb", "#e78ac3", "#a6d854"],
+              "Set2-6": ["#66c2a5", "#fc8d62", "#8da0cb", "#e78ac3", "#a6d854", "#ffd92f"],
+              "Set2-7": ["#66c2a5", "#fc8d62", "#8da0cb", "#e78ac3", "#a6d854", "#ffd92f", "#e5c494"],
+              "Set2-8": ["#66c2a5", "#fc8d62", "#8da0cb", "#e78ac3", "#a6d854", "#ffd92f", "#e5c494", "#b3b3b3"],
+              "Set3-3": ["#8dd3c7", "#ffffb3", "#bebada"],
+              "Set3-4": ["#8dd3c7", "#ffffb3", "#bebada", "#fb8072"],
+              "Set3-5": ["#8dd3c7", "#ffffb3", "#bebada", "#fb8072", "#80b1d3"],
+              "Set3-6": ["#8dd3c7", "#ffffb3", "#bebada", "#fb8072", "#80b1d3", "#fdb462"],
+              "Set3-7": ["#8dd3c7", "#ffffb3", "#bebada", "#fb8072", "#80b1d3", "#fdb462", "#b3de69"],
+              "Set3-8": ["#8dd3c7", "#ffffb3", "#bebada", "#fb8072", "#80b1d3", "#fdb462", "#b3de69", "#fccde5"],
+              "Set3-9": [
+                "#8dd3c7",
+                "#ffffb3",
+                "#bebada",
+                "#fb8072",
+                "#80b1d3",
+                "#fdb462",
+                "#b3de69",
+                "#fccde5",
+                "#d9d9d9",
+              ],
+              "Set3-10": [
+                "#8dd3c7",
+                "#ffffb3",
+                "#bebada",
+                "#fb8072",
+                "#80b1d3",
+                "#fdb462",
+                "#b3de69",
+                "#fccde5",
+                "#d9d9d9",
+                "#bc80bd",
+              ],
+              "Set3-11": [
+                "#8dd3c7",
+                "#ffffb3",
+                "#bebada",
+                "#fb8072",
+                "#80b1d3",
+                "#fdb462",
+                "#b3de69",
+                "#fccde5",
+                "#d9d9d9",
+                "#bc80bd",
+                "#ccebc5",
+              ],
+              "Set3-12": [
+                "#8dd3c7",
+                "#ffffb3",
+                "#bebada",
+                "#fb8072",
+                "#80b1d3",
+                "#fdb462",
+                "#b3de69",
+                "#fccde5",
+                "#d9d9d9",
+                "#bc80bd",
+                "#ccebc5",
+                "#ffed6f",
+              ],
+            },
+            office: {
+              Adjacency6: ["#a9a57c", "#9cbebd", "#d2cb6c", "#95a39d", "#c89f5d", "#b1a089"],
+              Advantage6: ["#663366", "#330f42", "#666699", "#999966", "#f7901e", "#a3a101"],
+              Angles6: ["#797b7e", "#f96a1b", "#08a1d9", "#7c984a", "#c2ad8d", "#506e94"],
+              Apex6: ["#ceb966", "#9cb084", "#6bb1c9", "#6585cf", "#7e6bc9", "#a379bb"],
+              Apothecary6: ["#93a299", "#cf543f", "#b5ae53", "#848058", "#e8b54d", "#786c71"],
+              Aspect6: ["#f07f09", "#9f2936", "#1b587c", "#4e8542", "#604878", "#c19859"],
+              Atlas6: ["#f81b02", "#fc7715", "#afbf41", "#50c49f", "#3b95c4", "#b560d4"],
+              Austin6: ["#94c600", "#71685a", "#ff6700", "#909465", "#956b43", "#fea022"],
+              Badge6: ["#f8b323", "#656a59", "#46b2b5", "#8caa7e", "#d36f68", "#826276"],
+              Banded6: ["#ffc000", "#a5d028", "#08cc78", "#f24099", "#828288", "#f56617"],
+              Basis6: ["#f09415", "#c1b56b", "#4baf73", "#5aa6c0", "#d17df9", "#fa7e5c"],
+              Berlin6: ["#a6b727", "#df5327", "#fe9e00", "#418ab3", "#d7d447", "#818183"],
+              BlackTie6: ["#6f6f74", "#a7b789", "#beae98", "#92a9b9", "#9c8265", "#8d6974"],
+              Blue6: ["#0f6fc6", "#009dd9", "#0bd0d9", "#10cf9b", "#7cca62", "#a5c249"],
+              BlueGreen6: ["#3494ba", "#58b6c0", "#75bda7", "#7a8c8e", "#84acb6", "#2683c6"],
+              BlueII6: ["#1cade4", "#2683c6", "#27ced7", "#42ba97", "#3e8853", "#62a39f"],
+              BlueRed6: ["#4a66ac", "#629dd1", "#297fd5", "#7f8fa9", "#5aa2ae", "#9d90a0"],
+              BlueWarm6: ["#4a66ac", "#629dd1", "#297fd5", "#7f8fa9", "#5aa2ae", "#9d90a0"],
+              Breeze6: ["#2c7c9f", "#244a58", "#e2751d", "#ffb400", "#7eb606", "#c00000"],
+              Capital6: ["#4b5a60", "#9c5238", "#504539", "#c1ad79", "#667559", "#bad6ad"],
+              Celestial6: ["#ac3ec1", "#477bd1", "#46b298", "#90ba4c", "#dd9d31", "#e25247"],
+              Circuit6: ["#9acd4c", "#faa93a", "#d35940", "#b258d3", "#63a0cc", "#8ac4a7"],
+              Civic6: ["#d16349", "#ccb400", "#8cadae", "#8c7b70", "#8fb08c", "#d19049"],
+              Clarity6: ["#93a299", "#ad8f67", "#726056", "#4c5a6a", "#808da0", "#79463d"],
+              Codex6: ["#990000", "#efab16", "#78ac35", "#35aca2", "#4083cf", "#0d335e"],
+              Composite6: ["#98c723", "#59b0b9", "#deae00", "#b77bb4", "#e0773c", "#a98d63"],
+              Concourse6: ["#2da2bf", "#da1f28", "#eb641b", "#39639d", "#474b78", "#7d3c4a"],
+              Couture6: ["#9e8e5c", "#a09781", "#85776d", "#aeafa9", "#8d878b", "#6b6149"],
+              Crop6: ["#8c8d86", "#e6c069", "#897b61", "#8dab8e", "#77a2bb", "#e28394"],
+              Damask6: ["#9ec544", "#50bea3", "#4a9ccc", "#9a66ca", "#c54f71", "#de9c3c"],
+              Depth6: ["#41aebd", "#97e9d5", "#a2cf49", "#608f3d", "#f4de3a", "#fcb11c"],
+              Dividend6: ["#4d1434", "#903163", "#b2324b", "#969fa7", "#66b1ce", "#40619d"],
+              Droplet6: ["#2fa3ee", "#4bcaad", "#86c157", "#d99c3f", "#ce6633", "#a35dd1"],
+              Elemental6: ["#629dd1", "#297fd5", "#7f8fa9", "#4a66ac", "#5aa2ae", "#9d90a0"],
+              Equity6: ["#d34817", "#9b2d1f", "#a28e6a", "#956251", "#918485", "#855d5d"],
+              Essential6: ["#7a7a7a", "#f5c201", "#526db0", "#989aac", "#dc5924", "#b4b392"],
+              Excel16: [
+                "#9999ff",
+                "#993366",
+                "#ffffcc",
+                "#ccffff",
+                "#660066",
+                "#ff8080",
+                "#0066cc",
+                "#ccccff",
+                "#000080",
+                "#ff00ff",
+                "#ffff00",
+                "#0000ff",
+                "#800080",
+                "#800000",
+                "#008080",
+                "#0000ff",
+              ],
+              Executive6: ["#6076b4", "#9c5252", "#e68422", "#846648", "#63891f", "#758085"],
+              Exhibit6: ["#3399ff", "#69ffff", "#ccff33", "#3333ff", "#9933ff", "#ff33ff"],
+              Expo6: ["#fbc01e", "#efe1a2", "#fa8716", "#be0204", "#640f10", "#7e13e3"],
+              Facet6: ["#90c226", "#54a021", "#e6b91e", "#e76618", "#c42f1a", "#918655"],
+              Feathered6: ["#606372", "#79a8a4", "#b2ad8f", "#ad8082", "#dec18c", "#92a185"],
+              Flow6: ["#0f6fc6", "#009dd9", "#0bd0d9", "#10cf9b", "#7cca62", "#a5c249"],
+              Focus6: ["#ffb91d", "#f97817", "#6de304", "#ff0000", "#732bea", "#c913ad"],
+              Folio6: ["#294171", "#748cbc", "#8e887c", "#834736", "#5a1705", "#a0a16a"],
+              Formal6: ["#907f76", "#a46645", "#cd9c47", "#9a92cd", "#7d639b", "#733678"],
+              Forte6: ["#c70f0c", "#dd6b0d", "#faa700", "#93e50d", "#17c7ba", "#0a96e4"],
+              Foundry6: ["#72a376", "#b0ccb0", "#a8cdd7", "#c0beaf", "#cec597", "#e8b7b7"],
+              Frame6: ["#40bad2", "#fab900", "#90bb23", "#ee7008", "#1ab39f", "#d5393d"],
+              Gallery6: ["#b71e42", "#de478e", "#bc72f0", "#795faf", "#586ea6", "#6892a0"],
+              Genesis6: ["#80b606", "#e29f1d", "#2397e2", "#35aca2", "#5430bb", "#8d34e0"],
+              Grayscale6: ["#dddddd", "#b2b2b2", "#969696", "#808080", "#5f5f5f", "#4d4d4d"],
+              Green6: ["#549e39", "#8ab833", "#c0cf3a", "#029676", "#4ab5c4", "#0989b1"],
+              GreenYellow6: ["#99cb38", "#63a537", "#37a76f", "#44c1a3", "#4eb3cf", "#51c3f9"],
+              Grid6: ["#c66951", "#bf974d", "#928b70", "#87706b", "#94734e", "#6f777d"],
+              Habitat6: ["#f8c000", "#f88600", "#f83500", "#8b723d", "#818b3d", "#586215"],
+              Hardcover6: ["#873624", "#d6862d", "#d0be40", "#877f6c", "#972109", "#aeb795"],
+              Headlines6: ["#439eb7", "#e28b55", "#dcb64d", "#4ca198", "#835b82", "#645135"],
+              Horizon6: ["#7e97ad", "#cc8e60", "#7a6a60", "#b4936d", "#67787b", "#9d936f"],
+              Infusion6: ["#8c73d0", "#c2e8c4", "#c5a6e8", "#b45ec7", "#9fdafb", "#95c5b0"],
+              Inkwell6: ["#860908", "#4a0505", "#7a500a", "#c47810", "#827752", "#b5bb83"],
+              Inspiration6: ["#749805", "#bacc82", "#6e9ec2", "#2046a5", "#5039c6", "#7411d0"],
+              Integral6: ["#1cade4", "#2683c6", "#27ced7", "#42ba97", "#3e8853", "#62a39f"],
+              Ion6: ["#b01513", "#ea6312", "#e6b729", "#6aac90", "#5f9c9d", "#9e5e9b"],
+              IonBoardroom6: ["#b31166", "#e33d6f", "#e45f3c", "#e9943a", "#9b6bf2", "#d53dd0"],
+              Kilter6: ["#76c5ef", "#fea022", "#ff6700", "#70a525", "#a5d848", "#20768c"],
+              Madison6: ["#a1d68b", "#5ec795", "#4dadcf", "#cdb756", "#e29c36", "#8ec0c1"],
+              MainEvent6: ["#b80e0f", "#a6987d", "#7f9a71", "#64969f", "#9b75b2", "#80737a"],
+              Marquee6: ["#418ab3", "#a6b727", "#f69200", "#838383", "#fec306", "#df5327"],
+              Median6: ["#94b6d2", "#dd8047", "#a5ab81", "#d8b25c", "#7ba79d", "#968c8c"],
+              Mesh6: ["#6f6f6f", "#bfbfa5", "#dcd084", "#e7bf5f", "#e9a039", "#cf7133"],
+              Metail6: ["#6283ad", "#324966", "#5b9ea4", "#1d5b57", "#1b4430", "#2f3c35"],
+              Metro6: ["#7fd13b", "#ea157a", "#feb80a", "#00addc", "#738ac8", "#1ab39f"],
+              Metropolitan6: ["#50b4c8", "#a8b97f", "#9b9256", "#657689", "#7a855d", "#84ac9d"],
+              Module6: ["#f0ad00", "#60b5cc", "#e66c7d", "#6bb76d", "#e88651", "#c64847"],
+              NewsPrint6: ["#ad0101", "#726056", "#ac956e", "#808da9", "#424e5b", "#730e00"],
+              Office6: ["#5b9bd5", "#ed7d31", "#a5a5a5", "#ffc000", "#4472c4", "#70ad47"],
+              "Office2007-2010-6": ["#4f81bd", "#c0504d", "#9bbb59", "#8064a2", "#4bacc6", "#f79646"],
+              Opulent6: ["#b83d68", "#ac66bb", "#de6c36", "#f9b639", "#cf6da4", "#fa8d3d"],
+              Orange6: ["#e48312", "#bd582c", "#865640", "#9b8357", "#c2bc80", "#94a088"],
+              OrangeRed6: ["#d34817", "#9b2d1f", "#a28e6a", "#956251", "#918485", "#855d5d"],
+              Orbit6: ["#f2d908", "#9de61e", "#0d8be6", "#c61b1b", "#e26f08", "#8d35d1"],
+              Organic6: ["#83992a", "#3c9770", "#44709d", "#a23c33", "#d97828", "#deb340"],
+              Oriel6: ["#fe8637", "#7598d9", "#b32c16", "#f5cd2d", "#aebad5", "#777c84"],
+              Origin6: ["#727ca3", "#9fb8cd", "#d2da7a", "#fada7a", "#b88472", "#8e736a"],
+              Paper6: ["#a5b592", "#f3a447", "#e7bc29", "#d092a7", "#9c85c0", "#809ec2"],
+              Parallax6: ["#30acec", "#80c34f", "#e29d3e", "#d64a3b", "#d64787", "#a666e1"],
+              Parcel6: ["#f6a21d", "#9bafb5", "#c96731", "#9ca383", "#87795d", "#a0988c"],
+              Perception6: ["#a2c816", "#e07602", "#e4c402", "#7dc1ef", "#21449b", "#a2b170"],
+              Perspective6: ["#838d9b", "#d2610c", "#80716a", "#94147c", "#5d5ad2", "#6f6c7d"],
+              Pixel6: ["#ff7f01", "#f1b015", "#fbec85", "#d2c2f1", "#da5af4", "#9d09d1"],
+              Plaza6: ["#990000", "#580101", "#e94a00", "#eb8f00", "#a4a4a4", "#666666"],
+              Precedent6: ["#993232", "#9b6c34", "#736c5d", "#c9972b", "#c95f2b", "#8f7a05"],
+              Pushpin6: ["#fda023", "#aa2b1e", "#71685c", "#64a73b", "#eb5605", "#b9ca1a"],
+              Quotable6: ["#00c6bb", "#6feba0", "#b6df5e", "#efb251", "#ef755f", "#ed515c"],
+              Red6: ["#a5300f", "#d55816", "#e19825", "#b19c7d", "#7f5f52", "#b27d49"],
+              RedOrange6: ["#e84c22", "#ffbd47", "#b64926", "#ff8427", "#cc9900", "#b22600"],
+              RedViolet6: ["#e32d91", "#c830cc", "#4ea6dc", "#4775e7", "#8971e1", "#d54773"],
+              Retrospect6: ["#e48312", "#bd582c", "#865640", "#9b8357", "#c2bc80", "#94a088"],
+              Revolution6: ["#0c5986", "#ddf53d", "#508709", "#bf5e00", "#9c0001", "#660075"],
+              Saddle6: ["#c6b178", "#9c5b14", "#71b2bc", "#78aa5d", "#867099", "#4c6f75"],
+              Savon6: ["#1cade4", "#2683c6", "#27ced7", "#42ba97", "#3e8853", "#62a39f"],
+              Sketchbook6: ["#a63212", "#e68230", "#9bb05e", "#6b9bc7", "#4e66b2", "#8976ac"],
+              Sky6: ["#073779", "#8fd9fb", "#ffcc00", "#eb6615", "#c76402", "#b523b4"],
+              Slate6: ["#bc451b", "#d3ba68", "#bb8640", "#ad9277", "#a55a43", "#ad9d7b"],
+              Slice6: ["#052f61", "#a50e82", "#14967c", "#6a9e1f", "#e87d37", "#c62324"],
+              Slipstream6: ["#4e67c8", "#5eccf3", "#a7ea52", "#5dceaf", "#ff8021", "#f14124"],
+              SOHO6: ["#61625e", "#964d2c", "#66553e", "#848058", "#afa14b", "#ad7d4d"],
+              Solstice6: ["#3891a7", "#feb80a", "#c32d2e", "#84aa33", "#964305", "#475a8d"],
+              Spectrum6: ["#990000", "#ff6600", "#ffba00", "#99cc00", "#528a02", "#333333"],
+              Story6: ["#1d86cd", "#732e9a", "#b50b1b", "#e8950e", "#55992b", "#2c9c89"],
+              Studio6: ["#f7901e", "#fec60b", "#9fe62f", "#4ea5d1", "#1c4596", "#542d90"],
+              Summer6: ["#51a6c2", "#51c2a9", "#7ec251", "#e1dc53", "#b54721", "#a16bb1"],
+              Technic6: ["#6ea0b0", "#ccaf0a", "#8d89a4", "#748560", "#9e9273", "#7e848d"],
+              Thatch6: ["#759aa5", "#cfc60d", "#99987f", "#90ac97", "#ffad1c", "#b9ab6f"],
+              Tradition6: ["#6b4a0b", "#790a14", "#908342", "#423e5c", "#641345", "#748a2f"],
+              Travelogue6: ["#b74d21", "#a32323", "#4576a3", "#615d9a", "#67924b", "#bf7b1b"],
+              Trek6: ["#f0a22e", "#a5644e", "#b58b80", "#c3986d", "#a19574", "#c17529"],
+              Twilight6: ["#e8bc4a", "#83c1c6", "#e78d35", "#909ce1", "#839c41", "#cc5439"],
+              Urban6: ["#53548a", "#438086", "#a04da3", "#c4652d", "#8b5d3d", "#5c92b5"],
+              UrbanPop6: ["#86ce24", "#00a2e6", "#fac810", "#7d8f8c", "#d06b20", "#958b8b"],
+              VaporTrail6: ["#df2e28", "#fe801a", "#e9bf35", "#81bb42", "#32c7a9", "#4a9bdc"],
+              Venture6: ["#9eb060", "#d09a08", "#f2ec86", "#824f1c", "#511818", "#553876"],
+              Verve6: ["#ff388c", "#e40059", "#9c007f", "#68007f", "#005bd3", "#00349e"],
+              View6: ["#6f6f74", "#92a9b9", "#a7b789", "#b9a489", "#8d6374", "#9b7362"],
+              Violet6: ["#ad84c6", "#8784c7", "#5d739a", "#6997af", "#84acb6", "#6f8183"],
+              VioletII6: ["#92278f", "#9b57d3", "#755dd9", "#665eb8", "#45a5ed", "#5982db"],
+              Waveform6: ["#31b6fd", "#4584d3", "#5bd078", "#a5d028", "#f5c040", "#05e0db"],
+              Wisp6: ["#a53010", "#de7e18", "#9f8351", "#728653", "#92aa4c", "#6aac91"],
+              WoodType6: ["#d34817", "#9b2d1f", "#a28e6a", "#956251", "#918485", "#855d5d"],
+              Yellow6: ["#ffca08", "#f8931d", "#ce8d3e", "#ec7016", "#e64823", "#9c6a6a"],
+              YellowOrange6: ["#f0a22e", "#a5644e", "#b58b80", "#c3986d", "#a19574", "#c17529"],
+            },
+            tableau: {
+              Tableau10: [
+                "#4E79A7",
+                "#F28E2B",
+                "#E15759",
+                "#76B7B2",
+                "#59A14F",
+                "#EDC948",
+                "#B07AA1",
+                "#FF9DA7",
+                "#9C755F",
+                "#BAB0AC",
+              ],
+              Tableau20: [
+                "#4E79A7",
+                "#A0CBE8",
+                "#F28E2B",
+                "#FFBE7D",
+                "#59A14F",
+                "#8CD17D",
+                "#B6992D",
+                "#F1CE63",
+                "#499894",
+                "#86BCB6",
+                "#E15759",
+                "#FF9D9A",
+                "#79706E",
+                "#BAB0AC",
+                "#D37295",
+                "#FABFD2",
+                "#B07AA1",
+                "#D4A6C8",
+                "#9D7660",
+                "#D7B5A6",
+              ],
+              ColorBlind10: [
+                "#1170aa",
+                "#fc7d0b",
+                "#a3acb9",
+                "#57606c",
+                "#5fa2ce",
+                "#c85200",
+                "#7b848f",
+                "#a3cce9",
+                "#ffbc79",
+                "#c8d0d9",
+              ],
+              SeattleGrays5: ["#767f8b", "#b3b7b8", "#5c6068", "#d3d3d3", "#989ca3"],
+              Traffic9: [
+                "#b60a1c",
+                "#e39802",
+                "#309143",
+                "#e03531",
+                "#f0bd27",
+                "#51b364",
+                "#ff684c",
+                "#ffda66",
+                "#8ace7e",
+              ],
+              MillerStone11: [
+                "#4f6980",
+                "#849db1",
+                "#a2ceaa",
+                "#638b66",
+                "#bfbb60",
+                "#f47942",
+                "#fbb04e",
+                "#b66353",
+                "#d7ce9f",
+                "#b9aa97",
+                "#7e756d",
+              ],
+              SuperfishelStone10: [
+                "#6388b4",
+                "#ffae34",
+                "#ef6f6a",
+                "#8cc2ca",
+                "#55ad89",
+                "#c3bc3f",
+                "#bb7693",
+                "#baa094",
+                "#a9b5ae",
+                "#767676",
+              ],
+              NurielStone9: [
+                "#8175aa",
+                "#6fb899",
+                "#31a1b3",
+                "#ccb22b",
+                "#a39fc9",
+                "#94d0c0",
+                "#959c9e",
+                "#027b8e",
+                "#9f8f12",
+              ],
+              JewelBright9: [
+                "#eb1e2c",
+                "#fd6f30",
+                "#f9a729",
+                "#f9d23c",
+                "#5fbb68",
+                "#64cdcc",
+                "#91dcea",
+                "#a4a4d5",
+                "#bbc9e5",
+              ],
+              Summer8: ["#bfb202", "#b9ca5d", "#cf3e53", "#f1788d", "#00a2b3", "#97cfd0", "#f3a546", "#f7c480"],
+              Winter10: [
+                "#90728f",
+                "#b9a0b4",
+                "#9d983d",
+                "#cecb76",
+                "#e15759",
+                "#ff9888",
+                "#6b6b6b",
+                "#bab2ae",
+                "#aa8780",
+                "#dab6af",
+              ],
+              GreenOrangeTeal12: [
+                "#4e9f50",
+                "#87d180",
+                "#ef8a0c",
+                "#fcc66d",
+                "#3ca8bc",
+                "#98d9e4",
+                "#94a323",
+                "#c3ce3d",
+                "#a08400",
+                "#f7d42a",
+                "#26897e",
+                "#8dbfa8",
+              ],
+              RedBlueBrown12: [
+                "#466f9d",
+                "#91b3d7",
+                "#ed444a",
+                "#feb5a2",
+                "#9d7660",
+                "#d7b5a6",
+                "#3896c4",
+                "#a0d4ee",
+                "#ba7e45",
+                "#39b87f",
+                "#c8133b",
+                "#ea8783",
+              ],
+              PurplePinkGray12: [
+                "#8074a8",
+                "#c6c1f0",
+                "#c46487",
+                "#ffbed1",
+                "#9c9290",
+                "#c5bfbe",
+                "#9b93c9",
+                "#ddb5d5",
+                "#7c7270",
+                "#f498b6",
+                "#b173a0",
+                "#c799bc",
+              ],
+              HueCircle19: [
+                "#1ba3c6",
+                "#2cb5c0",
+                "#30bcad",
+                "#21B087",
+                "#33a65c",
+                "#57a337",
+                "#a2b627",
+                "#d5bb21",
+                "#f8b620",
+                "#f89217",
+                "#f06719",
+                "#e03426",
+                "#f64971",
+                "#fc719e",
+                "#eb73b3",
+                "#ce69be",
+                "#a26dc2",
+                "#7873c0",
+                "#4f7cba",
+              ],
+              OrangeBlue7: ["#9e3d22", "#d45b21", "#f69035", "#d9d5c9", "#77acd3", "#4f81af", "#2b5c8a"],
+              RedGreen7: ["#a3123a", "#e33f43", "#f8816b", "#ced7c3", "#73ba67", "#44914e", "#24693d"],
+              GreenBlue7: ["#24693d", "#45934d", "#75bc69", "#c9dad2", "#77a9cf", "#4e7fab", "#2a5783"],
+              RedBlue7: ["#a90c38", "#e03b42", "#f87f69", "#dfd4d1", "#7eaed3", "#5383af", "#2e5a87"],
+              RedBlack7: ["#ae123a", "#e33e43", "#f8816b", "#d9d9d9", "#a0a7a8", "#707c83", "#49525e"],
+              GoldPurple7: ["#ad9024", "#c1a33b", "#d4b95e", "#e3d8cf", "#d4a3c3", "#c189b0", "#ac7299"],
+              RedGreenGold7: ["#be2a3e", "#e25f48", "#f88f4d", "#f4d166", "#90b960", "#4b9b5f", "#22763f"],
+              SunsetSunrise7: ["#33608c", "#9768a5", "#e7718a", "#f6ba57", "#ed7846", "#d54c45", "#b81840"],
+              OrangeBlueWhite7: ["#9e3d22", "#e36621", "#fcad52", "#ffffff", "#95c5e1", "#5b8fbc", "#2b5c8a"],
+              RedGreenWhite7: ["#ae123a", "#ee574d", "#fdac9e", "#ffffff", "#91d183", "#539e52", "#24693d"],
+              GreenBlueWhite7: ["#24693d", "#529c51", "#8fd180", "#ffffff", "#95c1dd", "#598ab5", "#2a5783"],
+              RedBlueWhite7: ["#a90c38", "#ec534b", "#feaa9a", "#ffffff", "#9ac4e1", "#5c8db8", "#2e5a87"],
+              RedBlackWhite7: ["#ae123a", "#ee574d", "#fdac9d", "#ffffff", "#bdc0bf", "#7d888d", "#49525e"],
+              OrangeBlueLight7: ["#ffcc9e", "#f9d4b6", "#f0dccd", "#e5e5e5", "#dae1ea", "#cfdcef", "#c4d8f3"],
+              Temperature7: ["#529985", "#6c9e6e", "#99b059", "#dbcf47", "#ebc24b", "#e3a14f", "#c26b51"],
+              BlueGreen7: ["#feffd9", "#f2fabf", "#dff3b2", "#c4eab1", "#94d6b7", "#69c5be", "#41b7c4"],
+              BlueLight7: ["#e5e5e5", "#e0e3e8", "#dbe1ea", "#d5dfec", "#d0dcef", "#cadaf1", "#c4d8f3"],
+              OrangeLight7: ["#e5e5e5", "#ebe1d9", "#f0ddcd", "#f5d9c2", "#f9d4b6", "#fdd0aa", "#ffcc9e"],
+              Blue20: [
+                "#b9ddf1",
+                "#afd6ed",
+                "#a5cfe9",
+                "#9bc7e4",
+                "#92c0df",
+                "#89b8da",
+                "#80b0d5",
+                "#79aacf",
+                "#72a3c9",
+                "#6a9bc3",
+                "#6394be",
+                "#5b8cb8",
+                "#5485b2",
+                "#4e7fac",
+                "#4878a6",
+                "#437a9f",
+                "#3d6a98",
+                "#376491",
+                "#305d8a",
+                "#2a5783",
+              ],
+              Orange20: [
+                "#ffc685",
+                "#fcbe75",
+                "#f9b665",
+                "#f7ae54",
+                "#f5a645",
+                "#f59c3c",
+                "#f49234",
+                "#f2882d",
+                "#f07e27",
+                "#ee7422",
+                "#e96b20",
+                "#e36420",
+                "#db5e20",
+                "#d25921",
+                "#ca5422",
+                "#c14f22",
+                "#b84b23",
+                "#af4623",
+                "#a64122",
+                "#9e3d22",
+              ],
+              Green20: [
+                "#b3e0a6",
+                "#a5db96",
+                "#98d687",
+                "#8ed07f",
+                "#85ca77",
+                "#7dc370",
+                "#75bc69",
+                "#6eb663",
+                "#67af5c",
+                "#61a956",
+                "#59a253",
+                "#519c51",
+                "#49964f",
+                "#428f4d",
+                "#398949",
+                "#308344",
+                "#2b7c40",
+                "#27763d",
+                "#256f3d",
+                "#24693d",
+              ],
+              Red20: [
+                "#ffbeb2",
+                "#feb4a6",
+                "#fdab9b",
+                "#fca290",
+                "#fb9984",
+                "#fa8f79",
+                "#f9856e",
+                "#f77b66",
+                "#f5715d",
+                "#f36754",
+                "#f05c4d",
+                "#ec5049",
+                "#e74545",
+                "#e13b42",
+                "#da323f",
+                "#d3293d",
+                "#ca223c",
+                "#c11a3b",
+                "#b8163a",
+                "#ae123a",
+              ],
+              Purple20: [
+                "#eec9e5",
+                "#eac1df",
+                "#e6b9d9",
+                "#e0b2d2",
+                "#daabcb",
+                "#d5a4c4",
+                "#cf9dbe",
+                "#ca96b8",
+                "#c48fb2",
+                "#be89ac",
+                "#b882a6",
+                "#b27ba1",
+                "#aa759d",
+                "#a27099",
+                "#9a6a96",
+                "#926591",
+                "#8c5f86",
+                "#865986",
+                "#81537f",
+                "#7c4d79",
+              ],
+              Brown20: [
+                "#eedbbd",
+                "#ecd2ad",
+                "#ebc994",
+                "#eac085",
+                "#e8b777",
+                "#e5ae6c",
+                "#e2a562",
+                "#de9d5a",
+                "#d99455",
+                "#d38c54",
+                "#ce8451",
+                "#c9784d",
+                "#c47247",
+                "#c16941",
+                "#bd6036",
+                "#b85636",
+                "#b34d34",
+                "#ad4433",
+                "#a63d32",
+                "#9f3632",
+              ],
+              Gray20: [
+                "#d5d5d5",
+                "#cdcecd",
+                "#c5c7c6",
+                "#bcbfbe",
+                "#b4b7b7",
+                "#acb0b1",
+                "#a4a9ab",
+                "#9ca3a4",
+                "#939c9e",
+                "#8b9598",
+                "#848e93",
+                "#7c878d",
+                "#758087",
+                "#6e7a81",
+                "#67737c",
+                "#616c77",
+                "#5b6570",
+                "#555f6a",
+                "#4f5864",
+                "#49525e",
+              ],
+              GrayWarm20: [
+                "#dcd4d0",
+                "#d4ccc8",
+                "#cdc4c0",
+                "#c5bdb9",
+                "#beb6b2",
+                "#b7afab",
+                "#b0a7a4",
+                "#a9a09d",
+                "#a29996",
+                "#9b938f",
+                "#948c88",
+                "#8d8481",
+                "#867e7b",
+                "#807774",
+                "#79706e",
+                "#736967",
+                "#6c6260",
+                "#665c51",
+                "#5f5654",
+                "#59504e",
+              ],
+              BlueTeal20: [
+                "#bce4d8",
+                "#aedcd5",
+                "#a1d5d2",
+                "#95cecf",
+                "#89c8cc",
+                "#7ec1ca",
+                "#72bac6",
+                "#66b2c2",
+                "#59acbe",
+                "#4ba5ba",
+                "#419eb6",
+                "#3b96b2",
+                "#358ead",
+                "#3586a7",
+                "#347ea1",
+                "#32779b",
+                "#316f96",
+                "#2f6790",
+                "#2d608a",
+                "#2c5985",
+              ],
+              OrangeGold20: [
+                "#f4d166",
+                "#f6c760",
+                "#f8bc58",
+                "#f8b252",
+                "#f7a84a",
+                "#f69e41",
+                "#f49538",
+                "#f38b2f",
+                "#f28026",
+                "#f0751e",
+                "#eb6c1c",
+                "#e4641e",
+                "#de5d1f",
+                "#d75521",
+                "#cf4f22",
+                "#c64a22",
+                "#bc4623",
+                "#b24223",
+                "#a83e24",
+                "#9e3a26",
+              ],
+              GreenGold20: [
+                "#f4d166",
+                "#e3cd62",
+                "#d3c95f",
+                "#c3c55d",
+                "#b2c25b",
+                "#a3bd5a",
+                "#93b958",
+                "#84b457",
+                "#76af56",
+                "#67a956",
+                "#5aa355",
+                "#4f9e53",
+                "#479751",
+                "#40914f",
+                "#3a8a4d",
+                "#34844a",
+                "#2d7d45",
+                "#257740",
+                "#1c713b",
+                "#146c36",
+              ],
+              RedGold21: [
+                "#f4d166",
+                "#f5c75f",
+                "#f6bc58",
+                "#f7b254",
+                "#f9a750",
+                "#fa9d4f",
+                "#fa9d4f",
+                "#fb934d",
+                "#f7894b",
+                "#f47f4a",
+                "#f0774a",
+                "#eb6349",
+                "#e66549",
+                "#e15c48",
+                "#dc5447",
+                "#d64c45",
+                "#d04344",
+                "#ca3a42",
+                "#c43141",
+                "#bd273f",
+                "#b71d3e",
+              ],
+              Classic10: [
+                "#1f77b4",
+                "#ff7f0e",
+                "#2ca02c",
+                "#d62728",
+                "#9467bd",
+                "#8c564b",
+                "#e377c2",
+                "#7f7f7f",
+                "#bcbd22",
+                "#17becf",
+              ],
+              ClassicMedium10: [
+                "#729ece",
+                "#ff9e4a",
+                "#67bf5c",
+                "#ed665d",
+                "#ad8bc9",
+                "#a8786e",
+                "#ed97ca",
+                "#a2a2a2",
+                "#cdcc5d",
+                "#6dccda",
+              ],
+              ClassicLight10: [
+                "#aec7e8",
+                "#ffbb78",
+                "#98df8a",
+                "#ff9896",
+                "#c5b0d5",
+                "#c49c94",
+                "#f7b6d2",
+                "#c7c7c7",
+                "#dbdb8d",
+                "#9edae5",
+              ],
+              Classic20: [
+                "#1f77b4",
+                "#aec7e8",
+                "#ff7f0e",
+                "#ffbb78",
+                "#2ca02c",
+                "#98df8a",
+                "#d62728",
+                "#ff9896",
+                "#9467bd",
+                "#c5b0d5",
+                "#8c564b",
+                "#c49c94",
+                "#e377c2",
+                "#f7b6d2",
+                "#7f7f7f",
+                "#c7c7c7",
+                "#bcbd22",
+                "#dbdb8d",
+                "#17becf",
+                "#9edae5",
+              ],
+              ClassicGray5: ["#60636a", "#a5acaf", "#414451", "#8f8782", "#cfcfcf"],
+              ClassicColorBlind10: [
+                "#006ba4",
+                "#ff800e",
+                "#ababab",
+                "#595959",
+                "#5f9ed1",
+                "#c85200",
+                "#898989",
+                "#a2c8ec",
+                "#ffbc79",
+                "#cfcfcf",
+              ],
+              ClassicTrafficLight9: [
+                "#b10318",
+                "#dba13a",
+                "#309343",
+                "#d82526",
+                "#ffc156",
+                "#69b764",
+                "#f26c64",
+                "#ffdd71",
+                "#9fcd99",
+              ],
+              ClassicPurpleGray6: ["#7b66d2", "#dc5fbd", "#94917b", "#995688", "#d098ee", "#d7d5c5"],
+              ClassicPurpleGray12: [
+                "#7b66d2",
+                "#a699e8",
+                "#dc5fbd",
+                "#ffc0da",
+                "#5f5a41",
+                "#b4b19b",
+                "#995688",
+                "#d898ba",
+                "#ab6ad5",
+                "#d098ee",
+                "#8b7c6e",
+                "#dbd4c5",
+              ],
+              ClassicGreenOrange6: ["#32a251", "#ff7f0f", "#3cb7cc", "#ffd94a", "#39737c", "#b85a0d"],
+              ClassicGreenOrange12: [
+                "#32a251",
+                "#acd98d",
+                "#ff7f0f",
+                "#ffb977",
+                "#3cb7cc",
+                "#98d9e4",
+                "#b85a0d",
+                "#ffd94a",
+                "#39737c",
+                "#86b4a9",
+                "#82853b",
+                "#ccc94d",
+              ],
+              ClassicBlueRed6: ["#2c69b0", "#f02720", "#ac613c", "#6ba3d6", "#ea6b73", "#e9c39b"],
+              ClassicBlueRed12: [
+                "#2c69b0",
+                "#b5c8e2",
+                "#f02720",
+                "#ffb6b0",
+                "#ac613c",
+                "#e9c39b",
+                "#6ba3d6",
+                "#b5dffd",
+                "#ac8763",
+                "#ddc9b4",
+                "#bd0a36",
+                "#f4737a",
+              ],
+              ClassicCyclic13: [
+                "#1f83b4",
+                "#12a2a8",
+                "#2ca030",
+                "#78a641",
+                "#bcbd22",
+                "#ffbf50",
+                "#ffaa0e",
+                "#ff7f0e",
+                "#d63a3a",
+                "#c7519c",
+                "#ba43b4",
+                "#8a60b0",
+                "#6f63bb",
+              ],
+              ClassicGreen7: ["#bccfb4", "#94bb83", "#69a761", "#339444", "#27823b", "#1a7232", "#09622a"],
+              ClassicGray13: [
+                "#c3c3c3",
+                "#b2b2b2",
+                "#a2a2a2",
+                "#929292",
+                "#838383",
+                "#747474",
+                "#666666",
+                "#585858",
+                "#4b4b4b",
+                "#3f3f3f",
+                "#333333",
+                "#282828",
+                "#1e1e1e",
+              ],
+              ClassicBlue7: ["#b4d4da", "#7bc8e2", "#67add4", "#3a87b7", "#1c73b1", "#1c5998", "#26456e"],
+              ClassicRed9: [
+                "#eac0bd",
+                "#f89a90",
+                "#f57667",
+                "#e35745",
+                "#d8392c",
+                "#cf1719",
+                "#c21417",
+                "#b10c1d",
+                "#9c0824",
+              ],
+              ClassicOrange7: ["#f0c294", "#fdab67", "#fd8938", "#f06511", "#d74401", "#a33202", "#7b3014"],
+              ClassicAreaRed11: [
+                "#f5cac7",
+                "#fbb3ab",
+                "#fd9c8f",
+                "#fe8b7a",
+                "#fd7864",
+                "#f46b55",
+                "#ea5e45",
+                "#e04e35",
+                "#d43e25",
+                "#c92b14",
+                "#bd1100",
+              ],
+              ClassicAreaGreen11: [
+                "#dbe8b4",
+                "#c3e394",
+                "#acdc7a",
+                "#9ad26d",
+                "#8ac765",
+                "#7abc5f",
+                "#6cae59",
+                "#60a24d",
+                "#569735",
+                "#4a8c1c",
+                "#3c8200",
+              ],
+              ClassicAreaBrown11: [
+                "#f3e0c2",
+                "#f6d29c",
+                "#f7c577",
+                "#f0b763",
+                "#e4aa63",
+                "#d89c63",
+                "#cc8f63",
+                "#c08262",
+                "#bb7359",
+                "#bb6348",
+                "#bb5137",
+              ],
+              ClassicRedGreen11: [
+                "#9c0824",
+                "#bd1316",
+                "#d11719",
+                "#df513f",
+                "#fc8375",
+                "#cacaca",
+                "#a2c18f",
+                "#69a761",
+                "#2f8e41",
+                "#1e7735",
+                "#09622a",
+              ],
+              ClassicRedBlue11: [
+                "#9c0824",
+                "#bd1316",
+                "#d11719",
+                "#df513f",
+                "#fc8375",
+                "#cacaca",
+                "#67add4",
+                "#3a87b7",
+                "#1c73b1",
+                "#1c5998",
+                "#26456e",
+              ],
+              ClassicRedBlack11: [
+                "#9c0824",
+                "#bd1316",
+                "#d11719",
+                "#df513f",
+                "#fc8375",
+                "#cacaca",
+                "#9b9b9b",
+                "#777777",
+                "#565656",
+                "#383838",
+                "#1e1e1e",
+              ],
+              ClassicAreaRedGreen21: [
+                "#bd1100",
+                "#c82912",
+                "#d23a21",
+                "#dc4930",
+                "#e6583e",
+                "#ef654d",
+                "#f7705b",
+                "#fd7e6b",
+                "#fe8e7e",
+                "#fca294",
+                "#e9dabe",
+                "#c7e298",
+                "#b1de7f",
+                "#a0d571",
+                "#90cb68",
+                "#82c162",
+                "#75b65d",
+                "#69aa56",
+                "#5ea049",
+                "#559633",
+                "#4a8c1c",
+              ],
+              ClassicOrangeBlue13: [
+                "#7b3014",
+                "#a33202",
+                "#d74401",
+                "#f06511",
+                "#fd8938",
+                "#fdab67",
+                "#cacaca",
+                "#7bc8e2",
+                "#67add4",
+                "#3a87b7",
+                "#1c73b1",
+                "#1c5998",
+                "#26456e",
+              ],
+              ClassicGreenBlue11: [
+                "#09622a",
+                "#1e7735",
+                "#2f8e41",
+                "#69a761",
+                "#a2c18f",
+                "#cacaca",
+                "#67add4",
+                "#3a87b7",
+                "#1c73b1",
+                "#1c5998",
+                "#26456e",
+              ],
+              ClassicRedWhiteGreen11: [
+                "#9c0824",
+                "#b41f27",
+                "#cc312b",
+                "#e86753",
+                "#fcb4a5",
+                "#ffffff",
+                "#b9d7b7",
+                "#74af72",
+                "#428f49",
+                "#297839",
+                "#09622a",
+              ],
+              ClassicRedWhiteBlack11: [
+                "#9c0824",
+                "#b41f27",
+                "#cc312b",
+                "#e86753",
+                "#fcb4a5",
+                "#ffffff",
+                "#bfbfbf",
+                "#838383",
+                "#575757",
+                "#393939",
+                "#1e1e1e",
+              ],
+              ClassicOrangeWhiteBlue11: [
+                "#7b3014",
+                "#a84415",
+                "#d85a13",
+                "#fb8547",
+                "#ffc2a1",
+                "#ffffff",
+                "#b7cde2",
+                "#6a9ec5",
+                "#3679a8",
+                "#2e5f8a",
+                "#26456e",
+              ],
+              ClassicRedWhiteBlackLight10: [
+                "#ffc2c5",
+                "#ffd1d3",
+                "#ffe0e1",
+                "#fff0f0",
+                "#ffffff",
+                "#f3f3f3",
+                "#e8e8e8",
+                "#dddddd",
+                "#d1d1d1",
+                "#c6c6c6",
+              ],
+              ClassicOrangeWhiteBlueLight11: [
+                "#ffcc9e",
+                "#ffd6b1",
+                "#ffe0c5",
+                "#ffead8",
+                "#fff5eb",
+                "#ffffff",
+                "#f3f7fd",
+                "#e8effa",
+                "#dce8f8",
+                "#d0e0f6",
+                "#c4d8f3",
+              ],
+              ClassicRedWhiteGreenLight11: [
+                "#ffb2b6",
+                "#ffc2c5",
+                "#ffd1d3",
+                "#ffe0e1",
+                "#fff0f0",
+                "#ffffff",
+                "#f1faed",
+                "#e3f5db",
+                "#d5f0ca",
+                "#c6ebb8",
+                "#b7e6a7",
+              ],
+              ClassicRedGreenLight11: [
+                "#ffb2b6",
+                "#fcbdc0",
+                "#f8c7c9",
+                "#f2d1d2",
+                "#ecdbdc",
+                "#e5e5e5",
+                "#dde6d9",
+                "#d4e6cc",
+                "#cae6c0",
+                "#c1e6b4",
+                "#b7e6a7",
+              ],
+            },
+          },
+          n = f.helpers,
+          c = 2 === f.DatasetController.prototype.removeHoverStyle.length;
+        f.defaults.global.plugins.colorschemes = { scheme: "brewer.Paired12", fillAlpha: 0.5, reverse: !1 };
+        var e = {
+          id: "colorschemes",
+          beforeUpdate: function (d, c) {
+            var a,
+              b,
+              r,
+              l,
+              f = c.scheme.split("."),
+              e = o[f[0]];
+            return (
+              e &&
+                ((a = e[f[1]]),
+                (b = a.length),
+                a &&
+                  d.config.data.datasets.forEach(function (f, e) {
+                    switch (
+                      ((r = e % b), (l = a[c.reverse ? b - r - 1 : r]), (f.colorschemes = {}), f.type || d.config.type)
+                    ) {
+                      case "line":
+                      case "radar":
+                      case "scatter":
+                        void 0 === f.backgroundColor &&
+                          ((f.backgroundColor = n.color(l).alpha(c.fillAlpha).rgbString()),
+                          (f.colorschemes.backgroundColor = !0)),
+                          void 0 === f.borderColor && ((f.borderColor = l), (f.colorschemes.borderColor = !0)),
+                          void 0 === f.pointBackgroundColor &&
+                            ((f.pointBackgroundColor = n.color(l).alpha(c.fillAlpha).rgbString()),
+                            (f.colorschemes.pointBackgroundColor = !0)),
+                          void 0 === f.pointBorderColor &&
+                            ((f.pointBorderColor = l), (f.colorschemes.pointBorderColor = !0));
+                        break;
+                      case "doughnut":
+                      case "pie":
+                        void 0 === f.backgroundColor &&
+                          ((f.backgroundColor = f.data.map(function (f, e) {
+                            return (r = e % b), a[c.reverse ? b - r - 1 : r];
+                          })),
+                          (f.colorschemes.backgroundColor = !0));
+                        break;
+                      default:
+                        void 0 === f.backgroundColor &&
+                          ((f.backgroundColor = l), (f.colorschemes.backgroundColor = !0));
+                    }
+                  })),
+              !0
+            );
+          },
+          afterUpdate: function (f) {
+            f.config.data.datasets.forEach(function (f) {
+              f.colorschemes &&
+                (f.colorschemes.backgroundColor && delete f.backgroundColor,
+                f.colorschemes.borderColor && delete f.borderColor,
+                f.colorschemes.pointBackgroundColor && delete f.pointBackgroundColor,
+                f.colorschemes.pointBorderColor && delete f.pointBorderColor,
+                delete f.colorschemes);
+            });
+          },
+          beforeEvent: function (f, e, d) {
+            return c && this.beforeUpdate(f, d), !0;
+          },
+          afterEvent: function (f) {
+            c && this.afterUpdate(f);
+          },
+        };
+        return (f.colorschemes = o), f.plugins.register(e), e;
+      });
+    </script>
+    <script>
+      /*! showdown v 1.9.1 - 02-11-2019 */
+      (function () {
+        function e(e) {
+          "use strict";
+          var r = {
+            omitExtraWLInCodeBlocks: {
+              defaultValue: !1,
+              describe: "Omit the default extra whiteline added to code blocks",
+              type: "boolean",
+            },
+            noHeaderId: { defaultValue: !1, describe: "Turn on/off generated header id", type: "boolean" },
+            prefixHeaderId: {
+              defaultValue: !1,
+              describe:
+                "Add a prefix to the generated header ids. Passing a string will prefix that string to the header id. Setting to true will add a generic 'section-' prefix",
+              type: "string",
+            },
+            rawPrefixHeaderId: {
+              defaultValue: !1,
+              describe:
+                'Setting this option to true will prevent showdown from modifying the prefix. This might result in malformed IDs (if, for instance, the " char is used in the prefix)',
+              type: "boolean",
+            },
+            ghCompatibleHeaderId: {
+              defaultValue: !1,
+              describe:
+                "Generate header ids compatible with github style (spaces are replaced with dashes, a bunch of non alphanumeric chars are removed)",
+              type: "boolean",
+            },
+            rawHeaderId: {
+              defaultValue: !1,
+              describe:
+                "Remove only spaces, ' and \" from generated header ids (including prefixes), replacing them with dashes (-). WARNING: This might result in malformed ids",
+              type: "boolean",
+            },
+            headerLevelStart: { defaultValue: !1, describe: "The header blocks level start", type: "integer" },
+            parseImgDimensions: { defaultValue: !1, describe: "Turn on/off image dimension parsing", type: "boolean" },
+            simplifiedAutoLink: { defaultValue: !1, describe: "Turn on/off GFM autolink style", type: "boolean" },
+            excludeTrailingPunctuationFromURLs: {
+              defaultValue: !1,
+              describe: "Excludes trailing punctuation from links generated with autoLinking",
+              type: "boolean",
+            },
+            literalMidWordUnderscores: {
+              defaultValue: !1,
+              describe: "Parse midword underscores as literal underscores",
+              type: "boolean",
+            },
+            literalMidWordAsterisks: {
+              defaultValue: !1,
+              describe: "Parse midword asterisks as literal asterisks",
+              type: "boolean",
+            },
+            strikethrough: { defaultValue: !1, describe: "Turn on/off strikethrough support", type: "boolean" },
+            tables: { defaultValue: !1, describe: "Turn on/off tables support", type: "boolean" },
+            tablesHeaderId: { defaultValue: !1, describe: "Add an id to table headers", type: "boolean" },
+            ghCodeBlocks: { defaultValue: !0, describe: "Turn on/off GFM fenced code blocks support", type: "boolean" },
+            tasklists: { defaultValue: !1, describe: "Turn on/off GFM tasklist support", type: "boolean" },
+            smoothLivePreview: {
+              defaultValue: !1,
+              describe: "Prevents weird effects in live previews due to incomplete input",
+              type: "boolean",
+            },
+            smartIndentationFix: {
+              defaultValue: !1,
+              description: "Tries to smartly fix indentation in es6 strings",
+              type: "boolean",
+            },
+            disableForced4SpacesIndentedSublists: {
+              defaultValue: !1,
+              description: "Disables the requirement of indenting nested sublists by 4 spaces",
+              type: "boolean",
+            },
+            simpleLineBreaks: {
+              defaultValue: !1,
+              description: "Parses simple line breaks as <br> (GFM Style)",
+              type: "boolean",
+            },
+            requireSpaceBeforeHeadingText: {
+              defaultValue: !1,
+              description: "Makes adding a space between `#` and the header text mandatory (GFM Style)",
+              type: "boolean",
+            },
+            ghMentions: { defaultValue: !1, description: "Enables github @mentions", type: "boolean" },
+            ghMentionsLink: {
+              defaultValue: "https://github.com/{u}",
+              description: "Changes the link generated by @mentions. Only applies if ghMentions option is enabled.",
+              type: "string",
+            },
+            encodeEmails: {
+              defaultValue: !0,
+              description:
+                "Encode e-mail addresses through the use of Character Entities, transforming ASCII e-mail addresses into its equivalent decimal entities",
+              type: "boolean",
+            },
+            openLinksInNewWindow: { defaultValue: !1, description: "Open all links in new windows", type: "boolean" },
+            backslashEscapesHTMLTags: {
+              defaultValue: !1,
+              description: "Support for HTML Tag escaping. ex: <div>foo</div>",
+              type: "boolean",
+            },
+            emoji: {
+              defaultValue: !1,
+              description: "Enable emoji support. Ex: `this is a :smile: emoji`",
+              type: "boolean",
+            },
+            underline: {
+              defaultValue: !1,
+              description:
+                "Enable support for underline. Syntax is double or triple underscores: `__underline word__`. With this option enabled, underscores no longer parses into `<em>` and `<strong>`",
+              type: "boolean",
+            },
+            completeHTMLDocument: {
+              defaultValue: !1,
+              description: "Outputs a complete html document, including `<html>`, `<head>` and `<body>` tags",
+              type: "boolean",
+            },
+            metadata: {
+              defaultValue: !1,
+              description:
+                "Enable support for document metadata (defined at the top of the document between `«««` and `»»»` or between `---` and `---`).",
+              type: "boolean",
+            },
+            splitAdjacentBlockquotes: {
+              defaultValue: !1,
+              description: "Split adjacent blockquote blocks",
+              type: "boolean",
+            },
+          };
+          if (!1 === e) return JSON.parse(JSON.stringify(r));
+          var t = {};
+          for (var a in r) r.hasOwnProperty(a) && (t[a] = r[a].defaultValue);
+          return t;
+        }
+        function r(e, r) {
+          "use strict";
+          var t = r ? "Error in " + r + " extension->" : "Error in unnamed extension",
+            n = { valid: !0, error: "" };
+          a.helper.isArray(e) || (e = [e]);
+          for (var s = 0; s < e.length; ++s) {
+            var o = t + " sub-extension " + s + ": ",
+              i = e[s];
+            if ("object" != typeof i)
+              return (n.valid = !1), (n.error = o + "must be an object, but " + typeof i + " given"), n;
+            if (!a.helper.isString(i.type))
+              return (
+                (n.valid = !1), (n.error = o + 'property "type" must be a string, but ' + typeof i.type + " given"), n
+              );
+            var l = (i.type = i.type.toLowerCase());
+            if (
+              ("language" === l && (l = i.type = "lang"),
+              "html" === l && (l = i.type = "output"),
+              "lang" !== l && "output" !== l && "listener" !== l)
+            )
+              return (
+                (n.valid = !1),
+                (n.error =
+                  o + "type " + l + ' is not recognized. Valid values: "lang/language", "output/html" or "listener"'),
+                n
+              );
+            if ("listener" === l) {
+              if (a.helper.isUndefined(i.listeners))
+                return (
+                  (n.valid = !1),
+                  (n.error = o + '. Extensions of type "listener" must have a property called "listeners"'),
+                  n
+                );
+            } else if (a.helper.isUndefined(i.filter) && a.helper.isUndefined(i.regex))
+              return (
+                (n.valid = !1),
+                (n.error = o + l + ' extensions must define either a "regex" property or a "filter" method'),
+                n
+              );
+            if (i.listeners) {
+              if ("object" != typeof i.listeners)
+                return (
+                  (n.valid = !1),
+                  (n.error = o + '"listeners" property must be an object but ' + typeof i.listeners + " given"),
+                  n
+                );
+              for (var c in i.listeners)
+                if (i.listeners.hasOwnProperty(c) && "function" != typeof i.listeners[c])
+                  return (
+                    (n.valid = !1),
+                    (n.error =
+                      o +
+                      '"listeners" property must be an hash of [event name]: [callback]. listeners.' +
+                      c +
+                      " must be a function but " +
+                      typeof i.listeners[c] +
+                      " given"),
+                    n
+                  );
+            }
+            if (i.filter) {
+              if ("function" != typeof i.filter)
+                return (
+                  (n.valid = !1), (n.error = o + '"filter" must be a function, but ' + typeof i.filter + " given"), n
+                );
+            } else if (i.regex) {
+              if ((a.helper.isString(i.regex) && (i.regex = new RegExp(i.regex, "g")), !(i.regex instanceof RegExp)))
+                return (
+                  (n.valid = !1),
+                  (n.error =
+                    o +
+                    '"regex" property must either be a string or a RegExp object, but ' +
+                    typeof i.regex +
+                    " given"),
+                  n
+                );
+              if (a.helper.isUndefined(i.replace))
+                return (
+                  (n.valid = !1), (n.error = o + '"regex" extensions must implement a replace string or function'), n
+                );
+            }
+          }
+          return n;
+        }
+        function t(e, r) {
+          "use strict";
+          return "¨E" + r.charCodeAt(0) + "E";
+        }
+        var a = {},
+          n = {},
+          s = {},
+          o = e(!0),
+          i = "vanilla",
+          l = {
+            github: {
+              omitExtraWLInCodeBlocks: !0,
+              simplifiedAutoLink: !0,
+              excludeTrailingPunctuationFromURLs: !0,
+              literalMidWordUnderscores: !0,
+              strikethrough: !0,
+              tables: !0,
+              tablesHeaderId: !0,
+              ghCodeBlocks: !0,
+              tasklists: !0,
+              disableForced4SpacesIndentedSublists: !0,
+              simpleLineBreaks: !0,
+              requireSpaceBeforeHeadingText: !0,
+              ghCompatibleHeaderId: !0,
+              ghMentions: !0,
+              backslashEscapesHTMLTags: !0,
+              emoji: !0,
+              splitAdjacentBlockquotes: !0,
+            },
+            original: { noHeaderId: !0, ghCodeBlocks: !1 },
+            ghost: {
+              omitExtraWLInCodeBlocks: !0,
+              parseImgDimensions: !0,
+              simplifiedAutoLink: !0,
+              excludeTrailingPunctuationFromURLs: !0,
+              literalMidWordUnderscores: !0,
+              strikethrough: !0,
+              tables: !0,
+              tablesHeaderId: !0,
+              ghCodeBlocks: !0,
+              tasklists: !0,
+              smoothLivePreview: !0,
+              simpleLineBreaks: !0,
+              requireSpaceBeforeHeadingText: !0,
+              ghMentions: !1,
+              encodeEmails: !0,
+            },
+            vanilla: e(!0),
+            allOn: (function () {
+              "use strict";
+              var r = e(!0),
+                t = {};
+              for (var a in r) r.hasOwnProperty(a) && (t[a] = !0);
+              return t;
+            })(),
+          };
+        (a.helper = {}),
+          (a.extensions = {}),
+          (a.setOption = function (e, r) {
+            "use strict";
+            return (o[e] = r), this;
+          }),
+          (a.getOption = function (e) {
+            "use strict";
+            return o[e];
+          }),
+          (a.getOptions = function () {
+            "use strict";
+            return o;
+          }),
+          (a.resetOptions = function () {
+            "use strict";
+            o = e(!0);
+          }),
+          (a.setFlavor = function (e) {
+            "use strict";
+            if (!l.hasOwnProperty(e)) throw Error(e + " flavor was not found");
+            a.resetOptions();
+            var r = l[e];
+            i = e;
+            for (var t in r) r.hasOwnProperty(t) && (o[t] = r[t]);
+          }),
+          (a.getFlavor = function () {
+            "use strict";
+            return i;
+          }),
+          (a.getFlavorOptions = function (e) {
+            "use strict";
+            if (l.hasOwnProperty(e)) return l[e];
+          }),
+          (a.getDefaultOptions = function (r) {
+            "use strict";
+            return e(r);
+          }),
+          (a.subParser = function (e, r) {
+            "use strict";
+            if (a.helper.isString(e)) {
+              if (void 0 === r) {
+                if (n.hasOwnProperty(e)) return n[e];
+                throw Error("SubParser named " + e + " not registered!");
+              }
+              n[e] = r;
+            }
+          }),
+          (a.extension = function (e, t) {
+            "use strict";
+            if (!a.helper.isString(e)) throw Error("Extension 'name' must be a string");
+            if (((e = a.helper.stdExtName(e)), a.helper.isUndefined(t))) {
+              if (!s.hasOwnProperty(e)) throw Error("Extension named " + e + " is not registered!");
+              return s[e];
+            }
+            "function" == typeof t && (t = t()), a.helper.isArray(t) || (t = [t]);
+            var n = r(t, e);
+            if (!n.valid) throw Error(n.error);
+            s[e] = t;
+          }),
+          (a.getAllExtensions = function () {
+            "use strict";
+            return s;
+          }),
+          (a.removeExtension = function (e) {
+            "use strict";
+            delete s[e];
+          }),
+          (a.resetExtensions = function () {
+            "use strict";
+            s = {};
+          }),
+          (a.validateExtension = function (e) {
+            "use strict";
+            var t = r(e, null);
+            return !!t.valid || (console.warn(t.error), !1);
+          }),
+          a.hasOwnProperty("helper") || (a.helper = {}),
+          (a.helper.isString = function (e) {
+            "use strict";
+            return "string" == typeof e || e instanceof String;
+          }),
+          (a.helper.isFunction = function (e) {
+            "use strict";
+            return e && "[object Function]" === {}.toString.call(e);
+          }),
+          (a.helper.isArray = function (e) {
+            "use strict";
+            return Array.isArray(e);
+          }),
+          (a.helper.isUndefined = function (e) {
+            "use strict";
+            return void 0 === e;
+          }),
+          (a.helper.forEach = function (e, r) {
+            "use strict";
+            if (a.helper.isUndefined(e)) throw new Error("obj param is required");
+            if (a.helper.isUndefined(r)) throw new Error("callback param is required");
+            if (!a.helper.isFunction(r)) throw new Error("callback param must be a function/closure");
+            if ("function" == typeof e.forEach) e.forEach(r);
+            else if (a.helper.isArray(e)) for (var t = 0; t < e.length; t++) r(e[t], t, e);
+            else {
+              if ("object" != typeof e) throw new Error("obj does not seem to be an array or an iterable object");
+              for (var n in e) e.hasOwnProperty(n) && r(e[n], n, e);
+            }
+          }),
+          (a.helper.stdExtName = function (e) {
+            "use strict";
+            return e
+              .replace(/[_?*+\/\\.^-]/g, "")
+              .replace(/\s/g, "")
+              .toLowerCase();
+          }),
+          (a.helper.escapeCharactersCallback = t),
+          (a.helper.escapeCharacters = function (e, r, a) {
+            "use strict";
+            var n = "([" + r.replace(/([\[\]\\])/g, "\\$1") + "])";
+            a && (n = "\\\\" + n);
+            var s = new RegExp(n, "g");
+            return (e = e.replace(s, t));
+          }),
+          (a.helper.unescapeHTMLEntities = function (e) {
+            "use strict";
+            return e
+              .replace(/&quot;/g, '"')
+              .replace(/&lt;/g, "<")
+              .replace(/&gt;/g, ">")
+              .replace(/&amp;/g, "&");
+          });
+        var c = function (e, r, t, a) {
+          "use strict";
+          var n,
+            s,
+            o,
+            i,
+            l,
+            c = a || "",
+            u = c.indexOf("g") > -1,
+            d = new RegExp(r + "|" + t, "g" + c.replace(/g/g, "")),
+            p = new RegExp(r, c.replace(/g/g, "")),
+            h = [];
+          do {
+            for (n = 0; (o = d.exec(e)); )
+              if (p.test(o[0])) n++ || (i = (s = d.lastIndex) - o[0].length);
+              else if (n && !--n) {
+                l = o.index + o[0].length;
+                var _ = {
+                  left: { start: i, end: s },
+                  match: { start: s, end: o.index },
+                  right: { start: o.index, end: l },
+                  wholeMatch: { start: i, end: l },
+                };
+                if ((h.push(_), !u)) return h;
+              }
+          } while (n && (d.lastIndex = s));
+          return h;
+        };
+        (a.helper.matchRecursiveRegExp = function (e, r, t, a) {
+          "use strict";
+          for (var n = c(e, r, t, a), s = [], o = 0; o < n.length; ++o)
+            s.push([
+              e.slice(n[o].wholeMatch.start, n[o].wholeMatch.end),
+              e.slice(n[o].match.start, n[o].match.end),
+              e.slice(n[o].left.start, n[o].left.end),
+              e.slice(n[o].right.start, n[o].right.end),
+            ]);
+          return s;
+        }),
+          (a.helper.replaceRecursiveRegExp = function (e, r, t, n, s) {
+            "use strict";
+            if (!a.helper.isFunction(r)) {
+              var o = r;
+              r = function () {
+                return o;
+              };
+            }
+            var i = c(e, t, n, s),
+              l = e,
+              u = i.length;
+            if (u > 0) {
+              var d = [];
+              0 !== i[0].wholeMatch.start && d.push(e.slice(0, i[0].wholeMatch.start));
+              for (var p = 0; p < u; ++p)
+                d.push(
+                  r(
+                    e.slice(i[p].wholeMatch.start, i[p].wholeMatch.end),
+                    e.slice(i[p].match.start, i[p].match.end),
+                    e.slice(i[p].left.start, i[p].left.end),
+                    e.slice(i[p].right.start, i[p].right.end)
+                  )
+                ),
+                  p < u - 1 && d.push(e.slice(i[p].wholeMatch.end, i[p + 1].wholeMatch.start));
+              i[u - 1].wholeMatch.end < e.length && d.push(e.slice(i[u - 1].wholeMatch.end)), (l = d.join(""));
+            }
+            return l;
+          }),
+          (a.helper.regexIndexOf = function (e, r, t) {
+            "use strict";
+            if (!a.helper.isString(e))
+              throw "InvalidArgumentError: first parameter of showdown.helper.regexIndexOf function must be a string";
+            if (r instanceof RegExp == !1)
+              throw "InvalidArgumentError: second parameter of showdown.helper.regexIndexOf function must be an instance of RegExp";
+            var n = e.substring(t || 0).search(r);
+            return n >= 0 ? n + (t || 0) : n;
+          }),
+          (a.helper.splitAtIndex = function (e, r) {
+            "use strict";
+            if (!a.helper.isString(e))
+              throw "InvalidArgumentError: first parameter of showdown.helper.regexIndexOf function must be a string";
+            return [e.substring(0, r), e.substring(r)];
+          }),
+          (a.helper.encodeEmailAddress = function (e) {
+            "use strict";
+            var r = [
+              function (e) {
+                return "&#" + e.charCodeAt(0) + ";";
+              },
+              function (e) {
+                return "&#x" + e.charCodeAt(0).toString(16) + ";";
+              },
+              function (e) {
+                return e;
+              },
+            ];
+            return (e = e.replace(/./g, function (e) {
+              if ("@" === e) e = r[Math.floor(2 * Math.random())](e);
+              else {
+                var t = Math.random();
+                e = t > 0.9 ? r[2](e) : t > 0.45 ? r[1](e) : r[0](e);
+              }
+              return e;
+            }));
+          }),
+          (a.helper.padEnd = function (e, r, t) {
+            "use strict";
+            return (
+              (r >>= 0),
+              (t = String(t || " ")),
+              e.length > r
+                ? String(e)
+                : ((r -= e.length) > t.length && (t += t.repeat(r / t.length)), String(e) + t.slice(0, r))
+            );
+          }),
+          "undefined" == typeof console &&
+            (console = {
+              warn: function (e) {
+                "use strict";
+                alert(e);
+              },
+              log: function (e) {
+                "use strict";
+                alert(e);
+              },
+              error: function (e) {
+                "use strict";
+                throw e;
+              },
+            }),
+          (a.helper.regexes = { asteriskDashAndColon: /([*_:~])/g }),
+          (a.helper.emojis = {
+            "+1": "👍",
+            "-1": "👎",
+            100: "💯",
+            1234: "🔢",
+            "1st_place_medal": "🥇",
+            "2nd_place_medal": "🥈",
+            "3rd_place_medal": "🥉",
+            "8ball": "🎱",
+            a: "🅰️",
+            ab: "🆎",
+            abc: "🔤",
+            abcd: "🔡",
+            accept: "🉑",
+            aerial_tramway: "🚡",
+            airplane: "✈️",
+            alarm_clock: "⏰",
+            alembic: "⚗️",
+            alien: "👽",
+            ambulance: "🚑",
+            amphora: "🏺",
+            anchor: "⚓️",
+            angel: "👼",
+            anger: "💢",
+            angry: "😠",
+            anguished: "😧",
+            ant: "🐜",
+            apple: "🍎",
+            aquarius: "♒️",
+            aries: "♈️",
+            arrow_backward: "◀️",
+            arrow_double_down: "⏬",
+            arrow_double_up: "⏫",
+            arrow_down: "⬇️",
+            arrow_down_small: "🔽",
+            arrow_forward: "▶️",
+            arrow_heading_down: "⤵️",
+            arrow_heading_up: "⤴️",
+            arrow_left: "⬅️",
+            arrow_lower_left: "↙️",
+            arrow_lower_right: "↘️",
+            arrow_right: "➡️",
+            arrow_right_hook: "↪️",
+            arrow_up: "⬆️",
+            arrow_up_down: "↕️",
+            arrow_up_small: "🔼",
+            arrow_upper_left: "↖️",
+            arrow_upper_right: "↗️",
+            arrows_clockwise: "🔃",
+            arrows_counterclockwise: "🔄",
+            art: "🎨",
+            articulated_lorry: "🚛",
+            artificial_satellite: "🛰",
+            astonished: "😲",
+            athletic_shoe: "👟",
+            atm: "🏧",
+            atom_symbol: "⚛️",
+            avocado: "🥑",
+            b: "🅱️",
+            baby: "👶",
+            baby_bottle: "🍼",
+            baby_chick: "🐤",
+            baby_symbol: "🚼",
+            back: "🔙",
+            bacon: "🥓",
+            badminton: "🏸",
+            baggage_claim: "🛄",
+            baguette_bread: "🥖",
+            balance_scale: "⚖️",
+            balloon: "🎈",
+            ballot_box: "🗳",
+            ballot_box_with_check: "☑️",
+            bamboo: "🎍",
+            banana: "🍌",
+            bangbang: "‼️",
+            bank: "🏦",
+            bar_chart: "📊",
+            barber: "💈",
+            baseball: "⚾️",
+            basketball: "🏀",
+            basketball_man: "⛹️",
+            basketball_woman: "⛹️&zwj;♀️",
+            bat: "🦇",
+            bath: "🛀",
+            bathtub: "🛁",
+            battery: "🔋",
+            beach_umbrella: "🏖",
+            bear: "🐻",
+            bed: "🛏",
+            bee: "🐝",
+            beer: "🍺",
+            beers: "🍻",
+            beetle: "🐞",
+            beginner: "🔰",
+            bell: "🔔",
+            bellhop_bell: "🛎",
+            bento: "🍱",
+            biking_man: "🚴",
+            bike: "🚲",
+            biking_woman: "🚴&zwj;♀️",
+            bikini: "👙",
+            biohazard: "☣️",
+            bird: "🐦",
+            birthday: "🎂",
+            black_circle: "⚫️",
+            black_flag: "🏴",
+            black_heart: "🖤",
+            black_joker: "🃏",
+            black_large_square: "⬛️",
+            black_medium_small_square: "◾️",
+            black_medium_square: "◼️",
+            black_nib: "✒️",
+            black_small_square: "▪️",
+            black_square_button: "🔲",
+            blonde_man: "👱",
+            blonde_woman: "👱&zwj;♀️",
+            blossom: "🌼",
+            blowfish: "🐡",
+            blue_book: "📘",
+            blue_car: "🚙",
+            blue_heart: "💙",
+            blush: "😊",
+            boar: "🐗",
+            boat: "⛵️",
+            bomb: "💣",
+            book: "📖",
+            bookmark: "🔖",
+            bookmark_tabs: "📑",
+            books: "📚",
+            boom: "💥",
+            boot: "👢",
+            bouquet: "💐",
+            bowing_man: "🙇",
+            bow_and_arrow: "🏹",
+            bowing_woman: "🙇&zwj;♀️",
+            bowling: "🎳",
+            boxing_glove: "🥊",
+            boy: "👦",
+            bread: "🍞",
+            bride_with_veil: "👰",
+            bridge_at_night: "🌉",
+            briefcase: "💼",
+            broken_heart: "💔",
+            bug: "🐛",
+            building_construction: "🏗",
+            bulb: "💡",
+            bullettrain_front: "🚅",
+            bullettrain_side: "🚄",
+            burrito: "🌯",
+            bus: "🚌",
+            business_suit_levitating: "🕴",
+            busstop: "🚏",
+            bust_in_silhouette: "👤",
+            busts_in_silhouette: "👥",
+            butterfly: "🦋",
+            cactus: "🌵",
+            cake: "🍰",
+            calendar: "📆",
+            call_me_hand: "🤙",
+            calling: "📲",
+            camel: "🐫",
+            camera: "📷",
+            camera_flash: "📸",
+            camping: "🏕",
+            cancer: "♋️",
+            candle: "🕯",
+            candy: "🍬",
+            canoe: "🛶",
+            capital_abcd: "🔠",
+            capricorn: "♑️",
+            car: "🚗",
+            card_file_box: "🗃",
+            card_index: "📇",
+            card_index_dividers: "🗂",
+            carousel_horse: "🎠",
+            carrot: "🥕",
+            cat: "🐱",
+            cat2: "🐈",
+            cd: "💿",
+            chains: "⛓",
+            champagne: "🍾",
+            chart: "💹",
+            chart_with_downwards_trend: "📉",
+            chart_with_upwards_trend: "📈",
+            checkered_flag: "🏁",
+            cheese: "🧀",
+            cherries: "🍒",
+            cherry_blossom: "🌸",
+            chestnut: "🌰",
+            chicken: "🐔",
+            children_crossing: "🚸",
+            chipmunk: "🐿",
+            chocolate_bar: "🍫",
+            christmas_tree: "🎄",
+            church: "⛪️",
+            cinema: "🎦",
+            circus_tent: "🎪",
+            city_sunrise: "🌇",
+            city_sunset: "🌆",
+            cityscape: "🏙",
+            cl: "🆑",
+            clamp: "🗜",
+            clap: "👏",
+            clapper: "🎬",
+            classical_building: "🏛",
+            clinking_glasses: "🥂",
+            clipboard: "📋",
+            clock1: "🕐",
+            clock10: "🕙",
+            clock1030: "🕥",
+            clock11: "🕚",
+            clock1130: "🕦",
+            clock12: "🕛",
+            clock1230: "🕧",
+            clock130: "🕜",
+            clock2: "🕑",
+            clock230: "🕝",
+            clock3: "🕒",
+            clock330: "🕞",
+            clock4: "🕓",
+            clock430: "🕟",
+            clock5: "🕔",
+            clock530: "🕠",
+            clock6: "🕕",
+            clock630: "🕡",
+            clock7: "🕖",
+            clock730: "🕢",
+            clock8: "🕗",
+            clock830: "🕣",
+            clock9: "🕘",
+            clock930: "🕤",
+            closed_book: "📕",
+            closed_lock_with_key: "🔐",
+            closed_umbrella: "🌂",
+            cloud: "☁️",
+            cloud_with_lightning: "🌩",
+            cloud_with_lightning_and_rain: "⛈",
+            cloud_with_rain: "🌧",
+            cloud_with_snow: "🌨",
+            clown_face: "🤡",
+            clubs: "♣️",
+            cocktail: "🍸",
+            coffee: "☕️",
+            coffin: "⚰️",
+            cold_sweat: "😰",
+            comet: "☄️",
+            computer: "💻",
+            computer_mouse: "🖱",
+            confetti_ball: "🎊",
+            confounded: "😖",
+            confused: "😕",
+            congratulations: "㊗️",
+            construction: "🚧",
+            construction_worker_man: "👷",
+            construction_worker_woman: "👷&zwj;♀️",
+            control_knobs: "🎛",
+            convenience_store: "🏪",
+            cookie: "🍪",
+            cool: "🆒",
+            policeman: "👮",
+            copyright: "©️",
+            corn: "🌽",
+            couch_and_lamp: "🛋",
+            couple: "👫",
+            couple_with_heart_woman_man: "💑",
+            couple_with_heart_man_man: "👨&zwj;❤️&zwj;👨",
+            couple_with_heart_woman_woman: "👩&zwj;❤️&zwj;👩",
+            couplekiss_man_man: "👨&zwj;❤️&zwj;💋&zwj;👨",
+            couplekiss_man_woman: "💏",
+            couplekiss_woman_woman: "👩&zwj;❤️&zwj;💋&zwj;👩",
+            cow: "🐮",
+            cow2: "🐄",
+            cowboy_hat_face: "🤠",
+            crab: "🦀",
+            crayon: "🖍",
+            credit_card: "💳",
+            crescent_moon: "🌙",
+            cricket: "🏏",
+            crocodile: "🐊",
+            croissant: "🥐",
+            crossed_fingers: "🤞",
+            crossed_flags: "🎌",
+            crossed_swords: "⚔️",
+            crown: "👑",
+            cry: "😢",
+            crying_cat_face: "😿",
+            crystal_ball: "🔮",
+            cucumber: "🥒",
+            cupid: "💘",
+            curly_loop: "➰",
+            currency_exchange: "💱",
+            curry: "🍛",
+            custard: "🍮",
+            customs: "🛃",
+            cyclone: "🌀",
+            dagger: "🗡",
+            dancer: "💃",
+            dancing_women: "👯",
+            dancing_men: "👯&zwj;♂️",
+            dango: "🍡",
+            dark_sunglasses: "🕶",
+            dart: "🎯",
+            dash: "💨",
+            date: "📅",
+            deciduous_tree: "🌳",
+            deer: "🦌",
+            department_store: "🏬",
+            derelict_house: "🏚",
+            desert: "🏜",
+            desert_island: "🏝",
+            desktop_computer: "🖥",
+            male_detective: "🕵️",
+            diamond_shape_with_a_dot_inside: "💠",
+            diamonds: "♦️",
+            disappointed: "😞",
+            disappointed_relieved: "😥",
+            dizzy: "💫",
+            dizzy_face: "😵",
+            do_not_litter: "🚯",
+            dog: "🐶",
+            dog2: "🐕",
+            dollar: "💵",
+            dolls: "🎎",
+            dolphin: "🐬",
+            door: "🚪",
+            doughnut: "🍩",
+            dove: "🕊",
+            dragon: "🐉",
+            dragon_face: "🐲",
+            dress: "👗",
+            dromedary_camel: "🐪",
+            drooling_face: "🤤",
+            droplet: "💧",
+            drum: "🥁",
+            duck: "🦆",
+            dvd: "📀",
+            "e-mail": "📧",
+            eagle: "🦅",
+            ear: "👂",
+            ear_of_rice: "🌾",
+            earth_africa: "🌍",
+            earth_americas: "🌎",
+            earth_asia: "🌏",
+            egg: "🥚",
+            eggplant: "🍆",
+            eight_pointed_black_star: "✴️",
+            eight_spoked_asterisk: "✳️",
+            electric_plug: "🔌",
+            elephant: "🐘",
+            email: "✉️",
+            end: "🔚",
+            envelope_with_arrow: "📩",
+            euro: "💶",
+            european_castle: "🏰",
+            european_post_office: "🏤",
+            evergreen_tree: "🌲",
+            exclamation: "❗️",
+            expressionless: "😑",
+            eye: "👁",
+            eye_speech_bubble: "👁&zwj;🗨",
+            eyeglasses: "👓",
+            eyes: "👀",
+            face_with_head_bandage: "🤕",
+            face_with_thermometer: "🤒",
+            fist_oncoming: "👊",
+            factory: "🏭",
+            fallen_leaf: "🍂",
+            family_man_woman_boy: "👪",
+            family_man_boy: "👨&zwj;👦",
+            family_man_boy_boy: "👨&zwj;👦&zwj;👦",
+            family_man_girl: "👨&zwj;👧",
+            family_man_girl_boy: "👨&zwj;👧&zwj;👦",
+            family_man_girl_girl: "👨&zwj;👧&zwj;👧",
+            family_man_man_boy: "👨&zwj;👨&zwj;👦",
+            family_man_man_boy_boy: "👨&zwj;👨&zwj;👦&zwj;👦",
+            family_man_man_girl: "👨&zwj;👨&zwj;👧",
+            family_man_man_girl_boy: "👨&zwj;👨&zwj;👧&zwj;👦",
+            family_man_man_girl_girl: "👨&zwj;👨&zwj;👧&zwj;👧",
+            family_man_woman_boy_boy: "👨&zwj;👩&zwj;👦&zwj;👦",
+            family_man_woman_girl: "👨&zwj;👩&zwj;👧",
+            family_man_woman_girl_boy: "👨&zwj;👩&zwj;👧&zwj;👦",
+            family_man_woman_girl_girl: "👨&zwj;👩&zwj;👧&zwj;👧",
+            family_woman_boy: "👩&zwj;👦",
+            family_woman_boy_boy: "👩&zwj;👦&zwj;👦",
+            family_woman_girl: "👩&zwj;👧",
+            family_woman_girl_boy: "👩&zwj;👧&zwj;👦",
+            family_woman_girl_girl: "👩&zwj;👧&zwj;👧",
+            family_woman_woman_boy: "👩&zwj;👩&zwj;👦",
+            family_woman_woman_boy_boy: "👩&zwj;👩&zwj;👦&zwj;👦",
+            family_woman_woman_girl: "👩&zwj;👩&zwj;👧",
+            family_woman_woman_girl_boy: "👩&zwj;👩&zwj;👧&zwj;👦",
+            family_woman_woman_girl_girl: "👩&zwj;👩&zwj;👧&zwj;👧",
+            fast_forward: "⏩",
+            fax: "📠",
+            fearful: "😨",
+            feet: "🐾",
+            female_detective: "🕵️&zwj;♀️",
+            ferris_wheel: "🎡",
+            ferry: "⛴",
+            field_hockey: "🏑",
+            file_cabinet: "🗄",
+            file_folder: "📁",
+            film_projector: "📽",
+            film_strip: "🎞",
+            fire: "🔥",
+            fire_engine: "🚒",
+            fireworks: "🎆",
+            first_quarter_moon: "🌓",
+            first_quarter_moon_with_face: "🌛",
+            fish: "🐟",
+            fish_cake: "🍥",
+            fishing_pole_and_fish: "🎣",
+            fist_raised: "✊",
+            fist_left: "🤛",
+            fist_right: "🤜",
+            flags: "🎏",
+            flashlight: "🔦",
+            fleur_de_lis: "⚜️",
+            flight_arrival: "🛬",
+            flight_departure: "🛫",
+            floppy_disk: "💾",
+            flower_playing_cards: "🎴",
+            flushed: "😳",
+            fog: "🌫",
+            foggy: "🌁",
+            football: "🏈",
+            footprints: "👣",
+            fork_and_knife: "🍴",
+            fountain: "⛲️",
+            fountain_pen: "🖋",
+            four_leaf_clover: "🍀",
+            fox_face: "🦊",
+            framed_picture: "🖼",
+            free: "🆓",
+            fried_egg: "🍳",
+            fried_shrimp: "🍤",
+            fries: "🍟",
+            frog: "🐸",
+            frowning: "😦",
+            frowning_face: "☹️",
+            frowning_man: "🙍&zwj;♂️",
+            frowning_woman: "🙍",
+            middle_finger: "🖕",
+            fuelpump: "⛽️",
+            full_moon: "🌕",
+            full_moon_with_face: "🌝",
+            funeral_urn: "⚱️",
+            game_die: "🎲",
+            gear: "⚙️",
+            gem: "💎",
+            gemini: "♊️",
+            ghost: "👻",
+            gift: "🎁",
+            gift_heart: "💝",
+            girl: "👧",
+            globe_with_meridians: "🌐",
+            goal_net: "🥅",
+            goat: "🐐",
+            golf: "⛳️",
+            golfing_man: "🏌️",
+            golfing_woman: "🏌️&zwj;♀️",
+            gorilla: "🦍",
+            grapes: "🍇",
+            green_apple: "🍏",
+            green_book: "📗",
+            green_heart: "💚",
+            green_salad: "🥗",
+            grey_exclamation: "❕",
+            grey_question: "❔",
+            grimacing: "😬",
+            grin: "😁",
+            grinning: "😀",
+            guardsman: "💂",
+            guardswoman: "💂&zwj;♀️",
+            guitar: "🎸",
+            gun: "🔫",
+            haircut_woman: "💇",
+            haircut_man: "💇&zwj;♂️",
+            hamburger: "🍔",
+            hammer: "🔨",
+            hammer_and_pick: "⚒",
+            hammer_and_wrench: "🛠",
+            hamster: "🐹",
+            hand: "✋",
+            handbag: "👜",
+            handshake: "🤝",
+            hankey: "💩",
+            hatched_chick: "🐥",
+            hatching_chick: "🐣",
+            headphones: "🎧",
+            hear_no_evil: "🙉",
+            heart: "❤️",
+            heart_decoration: "💟",
+            heart_eyes: "😍",
+            heart_eyes_cat: "😻",
+            heartbeat: "💓",
+            heartpulse: "💗",
+            hearts: "♥️",
+            heavy_check_mark: "✔️",
+            heavy_division_sign: "➗",
+            heavy_dollar_sign: "💲",
+            heavy_heart_exclamation: "❣️",
+            heavy_minus_sign: "➖",
+            heavy_multiplication_x: "✖️",
+            heavy_plus_sign: "➕",
+            helicopter: "🚁",
+            herb: "🌿",
+            hibiscus: "🌺",
+            high_brightness: "🔆",
+            high_heel: "👠",
+            hocho: "🔪",
+            hole: "🕳",
+            honey_pot: "🍯",
+            horse: "🐴",
+            horse_racing: "🏇",
+            hospital: "🏥",
+            hot_pepper: "🌶",
+            hotdog: "🌭",
+            hotel: "🏨",
+            hotsprings: "♨️",
+            hourglass: "⌛️",
+            hourglass_flowing_sand: "⏳",
+            house: "🏠",
+            house_with_garden: "🏡",
+            houses: "🏘",
+            hugs: "🤗",
+            hushed: "😯",
+            ice_cream: "🍨",
+            ice_hockey: "🏒",
+            ice_skate: "⛸",
+            icecream: "🍦",
+            id: "🆔",
+            ideograph_advantage: "🉐",
+            imp: "👿",
+            inbox_tray: "📥",
+            incoming_envelope: "📨",
+            tipping_hand_woman: "💁",
+            information_source: "ℹ️",
+            innocent: "😇",
+            interrobang: "⁉️",
+            iphone: "📱",
+            izakaya_lantern: "🏮",
+            jack_o_lantern: "🎃",
+            japan: "🗾",
+            japanese_castle: "🏯",
+            japanese_goblin: "👺",
+            japanese_ogre: "👹",
+            jeans: "👖",
+            joy: "😂",
+            joy_cat: "😹",
+            joystick: "🕹",
+            kaaba: "🕋",
+            key: "🔑",
+            keyboard: "⌨️",
+            keycap_ten: "🔟",
+            kick_scooter: "🛴",
+            kimono: "👘",
+            kiss: "💋",
+            kissing: "😗",
+            kissing_cat: "😽",
+            kissing_closed_eyes: "😚",
+            kissing_heart: "😘",
+            kissing_smiling_eyes: "😙",
+            kiwi_fruit: "🥝",
+            koala: "🐨",
+            koko: "🈁",
+            label: "🏷",
+            large_blue_circle: "🔵",
+            large_blue_diamond: "🔷",
+            large_orange_diamond: "🔶",
+            last_quarter_moon: "🌗",
+            last_quarter_moon_with_face: "🌜",
+            latin_cross: "✝️",
+            laughing: "😆",
+            leaves: "🍃",
+            ledger: "📒",
+            left_luggage: "🛅",
+            left_right_arrow: "↔️",
+            leftwards_arrow_with_hook: "↩️",
+            lemon: "🍋",
+            leo: "♌️",
+            leopard: "🐆",
+            level_slider: "🎚",
+            libra: "♎️",
+            light_rail: "🚈",
+            link: "🔗",
+            lion: "🦁",
+            lips: "👄",
+            lipstick: "💄",
+            lizard: "🦎",
+            lock: "🔒",
+            lock_with_ink_pen: "🔏",
+            lollipop: "🍭",
+            loop: "➿",
+            loud_sound: "🔊",
+            loudspeaker: "📢",
+            love_hotel: "🏩",
+            love_letter: "💌",
+            low_brightness: "🔅",
+            lying_face: "🤥",
+            m: "Ⓜ️",
+            mag: "🔍",
+            mag_right: "🔎",
+            mahjong: "🀄️",
+            mailbox: "📫",
+            mailbox_closed: "📪",
+            mailbox_with_mail: "📬",
+            mailbox_with_no_mail: "📭",
+            man: "👨",
+            man_artist: "👨&zwj;🎨",
+            man_astronaut: "👨&zwj;🚀",
+            man_cartwheeling: "🤸&zwj;♂️",
+            man_cook: "👨&zwj;🍳",
+            man_dancing: "🕺",
+            man_facepalming: "🤦&zwj;♂️",
+            man_factory_worker: "👨&zwj;🏭",
+            man_farmer: "👨&zwj;🌾",
+            man_firefighter: "👨&zwj;🚒",
+            man_health_worker: "👨&zwj;⚕️",
+            man_in_tuxedo: "🤵",
+            man_judge: "👨&zwj;⚖️",
+            man_juggling: "🤹&zwj;♂️",
+            man_mechanic: "👨&zwj;🔧",
+            man_office_worker: "👨&zwj;💼",
+            man_pilot: "👨&zwj;✈️",
+            man_playing_handball: "🤾&zwj;♂️",
+            man_playing_water_polo: "🤽&zwj;♂️",
+            man_scientist: "👨&zwj;🔬",
+            man_shrugging: "🤷&zwj;♂️",
+            man_singer: "👨&zwj;🎤",
+            man_student: "👨&zwj;🎓",
+            man_teacher: "👨&zwj;🏫",
+            man_technologist: "👨&zwj;💻",
+            man_with_gua_pi_mao: "👲",
+            man_with_turban: "👳",
+            tangerine: "🍊",
+            mans_shoe: "👞",
+            mantelpiece_clock: "🕰",
+            maple_leaf: "🍁",
+            martial_arts_uniform: "🥋",
+            mask: "😷",
+            massage_woman: "💆",
+            massage_man: "💆&zwj;♂️",
+            meat_on_bone: "🍖",
+            medal_military: "🎖",
+            medal_sports: "🏅",
+            mega: "📣",
+            melon: "🍈",
+            memo: "📝",
+            men_wrestling: "🤼&zwj;♂️",
+            menorah: "🕎",
+            mens: "🚹",
+            metal: "🤘",
+            metro: "🚇",
+            microphone: "🎤",
+            microscope: "🔬",
+            milk_glass: "🥛",
+            milky_way: "🌌",
+            minibus: "🚐",
+            minidisc: "💽",
+            mobile_phone_off: "📴",
+            money_mouth_face: "🤑",
+            money_with_wings: "💸",
+            moneybag: "💰",
+            monkey: "🐒",
+            monkey_face: "🐵",
+            monorail: "🚝",
+            moon: "🌔",
+            mortar_board: "🎓",
+            mosque: "🕌",
+            motor_boat: "🛥",
+            motor_scooter: "🛵",
+            motorcycle: "🏍",
+            motorway: "🛣",
+            mount_fuji: "🗻",
+            mountain: "⛰",
+            mountain_biking_man: "🚵",
+            mountain_biking_woman: "🚵&zwj;♀️",
+            mountain_cableway: "🚠",
+            mountain_railway: "🚞",
+            mountain_snow: "🏔",
+            mouse: "🐭",
+            mouse2: "🐁",
+            movie_camera: "🎥",
+            moyai: "🗿",
+            mrs_claus: "🤶",
+            muscle: "💪",
+            mushroom: "🍄",
+            musical_keyboard: "🎹",
+            musical_note: "🎵",
+            musical_score: "🎼",
+            mute: "🔇",
+            nail_care: "💅",
+            name_badge: "📛",
+            national_park: "🏞",
+            nauseated_face: "🤢",
+            necktie: "👔",
+            negative_squared_cross_mark: "❎",
+            nerd_face: "🤓",
+            neutral_face: "😐",
+            new: "🆕",
+            new_moon: "🌑",
+            new_moon_with_face: "🌚",
+            newspaper: "📰",
+            newspaper_roll: "🗞",
+            next_track_button: "⏭",
+            ng: "🆖",
+            no_good_man: "🙅&zwj;♂️",
+            no_good_woman: "🙅",
+            night_with_stars: "🌃",
+            no_bell: "🔕",
+            no_bicycles: "🚳",
+            no_entry: "⛔️",
+            no_entry_sign: "🚫",
+            no_mobile_phones: "📵",
+            no_mouth: "😶",
+            no_pedestrians: "🚷",
+            no_smoking: "🚭",
+            "non-potable_water": "🚱",
+            nose: "👃",
+            notebook: "📓",
+            notebook_with_decorative_cover: "📔",
+            notes: "🎶",
+            nut_and_bolt: "🔩",
+            o: "⭕️",
+            o2: "🅾️",
+            ocean: "🌊",
+            octopus: "🐙",
+            oden: "🍢",
+            office: "🏢",
+            oil_drum: "🛢",
+            ok: "🆗",
+            ok_hand: "👌",
+            ok_man: "🙆&zwj;♂️",
+            ok_woman: "🙆",
+            old_key: "🗝",
+            older_man: "👴",
+            older_woman: "👵",
+            om: "🕉",
+            on: "🔛",
+            oncoming_automobile: "🚘",
+            oncoming_bus: "🚍",
+            oncoming_police_car: "🚔",
+            oncoming_taxi: "🚖",
+            open_file_folder: "📂",
+            open_hands: "👐",
+            open_mouth: "😮",
+            open_umbrella: "☂️",
+            ophiuchus: "⛎",
+            orange_book: "📙",
+            orthodox_cross: "☦️",
+            outbox_tray: "📤",
+            owl: "🦉",
+            ox: "🐂",
+            package: "📦",
+            page_facing_up: "📄",
+            page_with_curl: "📃",
+            pager: "📟",
+            paintbrush: "🖌",
+            palm_tree: "🌴",
+            pancakes: "🥞",
+            panda_face: "🐼",
+            paperclip: "📎",
+            paperclips: "🖇",
+            parasol_on_ground: "⛱",
+            parking: "🅿️",
+            part_alternation_mark: "〽️",
+            partly_sunny: "⛅️",
+            passenger_ship: "🛳",
+            passport_control: "🛂",
+            pause_button: "⏸",
+            peace_symbol: "☮️",
+            peach: "🍑",
+            peanuts: "🥜",
+            pear: "🍐",
+            pen: "🖊",
+            pencil2: "✏️",
+            penguin: "🐧",
+            pensive: "😔",
+            performing_arts: "🎭",
+            persevere: "😣",
+            person_fencing: "🤺",
+            pouting_woman: "🙎",
+            phone: "☎️",
+            pick: "⛏",
+            pig: "🐷",
+            pig2: "🐖",
+            pig_nose: "🐽",
+            pill: "💊",
+            pineapple: "🍍",
+            ping_pong: "🏓",
+            pisces: "♓️",
+            pizza: "🍕",
+            place_of_worship: "🛐",
+            plate_with_cutlery: "🍽",
+            play_or_pause_button: "⏯",
+            point_down: "👇",
+            point_left: "👈",
+            point_right: "👉",
+            point_up: "☝️",
+            point_up_2: "👆",
+            police_car: "🚓",
+            policewoman: "👮&zwj;♀️",
+            poodle: "🐩",
+            popcorn: "🍿",
+            post_office: "🏣",
+            postal_horn: "📯",
+            postbox: "📮",
+            potable_water: "🚰",
+            potato: "🥔",
+            pouch: "👝",
+            poultry_leg: "🍗",
+            pound: "💷",
+            rage: "😡",
+            pouting_cat: "😾",
+            pouting_man: "🙎&zwj;♂️",
+            pray: "🙏",
+            prayer_beads: "📿",
+            pregnant_woman: "🤰",
+            previous_track_button: "⏮",
+            prince: "🤴",
+            princess: "👸",
+            printer: "🖨",
+            purple_heart: "💜",
+            purse: "👛",
+            pushpin: "📌",
+            put_litter_in_its_place: "🚮",
+            question: "❓",
+            rabbit: "🐰",
+            rabbit2: "🐇",
+            racehorse: "🐎",
+            racing_car: "🏎",
+            radio: "📻",
+            radio_button: "🔘",
+            radioactive: "☢️",
+            railway_car: "🚃",
+            railway_track: "🛤",
+            rainbow: "🌈",
+            rainbow_flag: "🏳️&zwj;🌈",
+            raised_back_of_hand: "🤚",
+            raised_hand_with_fingers_splayed: "🖐",
+            raised_hands: "🙌",
+            raising_hand_woman: "🙋",
+            raising_hand_man: "🙋&zwj;♂️",
+            ram: "🐏",
+            ramen: "🍜",
+            rat: "🐀",
+            record_button: "⏺",
+            recycle: "♻️",
+            red_circle: "🔴",
+            registered: "®️",
+            relaxed: "☺️",
+            relieved: "😌",
+            reminder_ribbon: "🎗",
+            repeat: "🔁",
+            repeat_one: "🔂",
+            rescue_worker_helmet: "⛑",
+            restroom: "🚻",
+            revolving_hearts: "💞",
+            rewind: "⏪",
+            rhinoceros: "🦏",
+            ribbon: "🎀",
+            rice: "🍚",
+            rice_ball: "🍙",
+            rice_cracker: "🍘",
+            rice_scene: "🎑",
+            right_anger_bubble: "🗯",
+            ring: "💍",
+            robot: "🤖",
+            rocket: "🚀",
+            rofl: "🤣",
+            roll_eyes: "🙄",
+            roller_coaster: "🎢",
+            rooster: "🐓",
+            rose: "🌹",
+            rosette: "🏵",
+            rotating_light: "🚨",
+            round_pushpin: "📍",
+            rowing_man: "🚣",
+            rowing_woman: "🚣&zwj;♀️",
+            rugby_football: "🏉",
+            running_man: "🏃",
+            running_shirt_with_sash: "🎽",
+            running_woman: "🏃&zwj;♀️",
+            sa: "🈂️",
+            sagittarius: "♐️",
+            sake: "🍶",
+            sandal: "👡",
+            santa: "🎅",
+            satellite: "📡",
+            saxophone: "🎷",
+            school: "🏫",
+            school_satchel: "🎒",
+            scissors: "✂️",
+            scorpion: "🦂",
+            scorpius: "♏️",
+            scream: "😱",
+            scream_cat: "🙀",
+            scroll: "📜",
+            seat: "💺",
+            secret: "㊙️",
+            see_no_evil: "🙈",
+            seedling: "🌱",
+            selfie: "🤳",
+            shallow_pan_of_food: "🥘",
+            shamrock: "☘️",
+            shark: "🦈",
+            shaved_ice: "🍧",
+            sheep: "🐑",
+            shell: "🐚",
+            shield: "🛡",
+            shinto_shrine: "⛩",
+            ship: "🚢",
+            shirt: "👕",
+            shopping: "🛍",
+            shopping_cart: "🛒",
+            shower: "🚿",
+            shrimp: "🦐",
+            signal_strength: "📶",
+            six_pointed_star: "🔯",
+            ski: "🎿",
+            skier: "⛷",
+            skull: "💀",
+            skull_and_crossbones: "☠️",
+            sleeping: "😴",
+            sleeping_bed: "🛌",
+            sleepy: "😪",
+            slightly_frowning_face: "🙁",
+            slightly_smiling_face: "🙂",
+            slot_machine: "🎰",
+            small_airplane: "🛩",
+            small_blue_diamond: "🔹",
+            small_orange_diamond: "🔸",
+            small_red_triangle: "🔺",
+            small_red_triangle_down: "🔻",
+            smile: "😄",
+            smile_cat: "😸",
+            smiley: "😃",
+            smiley_cat: "😺",
+            smiling_imp: "😈",
+            smirk: "😏",
+            smirk_cat: "😼",
+            smoking: "🚬",
+            snail: "🐌",
+            snake: "🐍",
+            sneezing_face: "🤧",
+            snowboarder: "🏂",
+            snowflake: "❄️",
+            snowman: "⛄️",
+            snowman_with_snow: "☃️",
+            sob: "😭",
+            soccer: "⚽️",
+            soon: "🔜",
+            sos: "🆘",
+            sound: "🔉",
+            space_invader: "👾",
+            spades: "♠️",
+            spaghetti: "🍝",
+            sparkle: "❇️",
+            sparkler: "🎇",
+            sparkles: "✨",
+            sparkling_heart: "💖",
+            speak_no_evil: "🙊",
+            speaker: "🔈",
+            speaking_head: "🗣",
+            speech_balloon: "💬",
+            speedboat: "🚤",
+            spider: "🕷",
+            spider_web: "🕸",
+            spiral_calendar: "🗓",
+            spiral_notepad: "🗒",
+            spoon: "🥄",
+            squid: "🦑",
+            stadium: "🏟",
+            star: "⭐️",
+            star2: "🌟",
+            star_and_crescent: "☪️",
+            star_of_david: "✡️",
+            stars: "🌠",
+            station: "🚉",
+            statue_of_liberty: "🗽",
+            steam_locomotive: "🚂",
+            stew: "🍲",
+            stop_button: "⏹",
+            stop_sign: "🛑",
+            stopwatch: "⏱",
+            straight_ruler: "📏",
+            strawberry: "🍓",
+            stuck_out_tongue: "😛",
+            stuck_out_tongue_closed_eyes: "😝",
+            stuck_out_tongue_winking_eye: "😜",
+            studio_microphone: "🎙",
+            stuffed_flatbread: "🥙",
+            sun_behind_large_cloud: "🌥",
+            sun_behind_rain_cloud: "🌦",
+            sun_behind_small_cloud: "🌤",
+            sun_with_face: "🌞",
+            sunflower: "🌻",
+            sunglasses: "😎",
+            sunny: "☀️",
+            sunrise: "🌅",
+            sunrise_over_mountains: "🌄",
+            surfing_man: "🏄",
+            surfing_woman: "🏄&zwj;♀️",
+            sushi: "🍣",
+            suspension_railway: "🚟",
+            sweat: "😓",
+            sweat_drops: "💦",
+            sweat_smile: "😅",
+            sweet_potato: "🍠",
+            swimming_man: "🏊",
+            swimming_woman: "🏊&zwj;♀️",
+            symbols: "🔣",
+            synagogue: "🕍",
+            syringe: "💉",
+            taco: "🌮",
+            tada: "🎉",
+            tanabata_tree: "🎋",
+            taurus: "♉️",
+            taxi: "🚕",
+            tea: "🍵",
+            telephone_receiver: "📞",
+            telescope: "🔭",
+            tennis: "🎾",
+            tent: "⛺️",
+            thermometer: "🌡",
+            thinking: "🤔",
+            thought_balloon: "💭",
+            ticket: "🎫",
+            tickets: "🎟",
+            tiger: "🐯",
+            tiger2: "🐅",
+            timer_clock: "⏲",
+            tipping_hand_man: "💁&zwj;♂️",
+            tired_face: "😫",
+            tm: "™️",
+            toilet: "🚽",
+            tokyo_tower: "🗼",
+            tomato: "🍅",
+            tongue: "👅",
+            top: "🔝",
+            tophat: "🎩",
+            tornado: "🌪",
+            trackball: "🖲",
+            tractor: "🚜",
+            traffic_light: "🚥",
+            train: "🚋",
+            train2: "🚆",
+            tram: "🚊",
+            triangular_flag_on_post: "🚩",
+            triangular_ruler: "📐",
+            trident: "🔱",
+            triumph: "😤",
+            trolleybus: "🚎",
+            trophy: "🏆",
+            tropical_drink: "🍹",
+            tropical_fish: "🐠",
+            truck: "🚚",
+            trumpet: "🎺",
+            tulip: "🌷",
+            tumbler_glass: "🥃",
+            turkey: "🦃",
+            turtle: "🐢",
+            tv: "📺",
+            twisted_rightwards_arrows: "🔀",
+            two_hearts: "💕",
+            two_men_holding_hands: "👬",
+            two_women_holding_hands: "👭",
+            u5272: "🈹",
+            u5408: "🈴",
+            u55b6: "🈺",
+            u6307: "🈯️",
+            u6708: "🈷️",
+            u6709: "🈶",
+            u6e80: "🈵",
+            u7121: "🈚️",
+            u7533: "🈸",
+            u7981: "🈲",
+            u7a7a: "🈳",
+            umbrella: "☔️",
+            unamused: "😒",
+            underage: "🔞",
+            unicorn: "🦄",
+            unlock: "🔓",
+            up: "🆙",
+            upside_down_face: "🙃",
+            v: "✌️",
+            vertical_traffic_light: "🚦",
+            vhs: "📼",
+            vibration_mode: "📳",
+            video_camera: "📹",
+            video_game: "🎮",
+            violin: "🎻",
+            virgo: "♍️",
+            volcano: "🌋",
+            volleyball: "🏐",
+            vs: "🆚",
+            vulcan_salute: "🖖",
+            walking_man: "🚶",
+            walking_woman: "🚶&zwj;♀️",
+            waning_crescent_moon: "🌘",
+            waning_gibbous_moon: "🌖",
+            warning: "⚠️",
+            wastebasket: "🗑",
+            watch: "⌚️",
+            water_buffalo: "🐃",
+            watermelon: "🍉",
+            wave: "👋",
+            wavy_dash: "〰️",
+            waxing_crescent_moon: "🌒",
+            wc: "🚾",
+            weary: "😩",
+            wedding: "💒",
+            weight_lifting_man: "🏋️",
+            weight_lifting_woman: "🏋️&zwj;♀️",
+            whale: "🐳",
+            whale2: "🐋",
+            wheel_of_dharma: "☸️",
+            wheelchair: "♿️",
+            white_check_mark: "✅",
+            white_circle: "⚪️",
+            white_flag: "🏳️",
+            white_flower: "💮",
+            white_large_square: "⬜️",
+            white_medium_small_square: "◽️",
+            white_medium_square: "◻️",
+            white_small_square: "▫️",
+            white_square_button: "🔳",
+            wilted_flower: "🥀",
+            wind_chime: "🎐",
+            wind_face: "🌬",
+            wine_glass: "🍷",
+            wink: "😉",
+            wolf: "🐺",
+            woman: "👩",
+            woman_artist: "👩&zwj;🎨",
+            woman_astronaut: "👩&zwj;🚀",
+            woman_cartwheeling: "🤸&zwj;♀️",
+            woman_cook: "👩&zwj;🍳",
+            woman_facepalming: "🤦&zwj;♀️",
+            woman_factory_worker: "👩&zwj;🏭",
+            woman_farmer: "👩&zwj;🌾",
+            woman_firefighter: "👩&zwj;🚒",
+            woman_health_worker: "👩&zwj;⚕️",
+            woman_judge: "👩&zwj;⚖️",
+            woman_juggling: "🤹&zwj;♀️",
+            woman_mechanic: "👩&zwj;🔧",
+            woman_office_worker: "👩&zwj;💼",
+            woman_pilot: "👩&zwj;✈️",
+            woman_playing_handball: "🤾&zwj;♀️",
+            woman_playing_water_polo: "🤽&zwj;♀️",
+            woman_scientist: "👩&zwj;🔬",
+            woman_shrugging: "🤷&zwj;♀️",
+            woman_singer: "👩&zwj;🎤",
+            woman_student: "👩&zwj;🎓",
+            woman_teacher: "👩&zwj;🏫",
+            woman_technologist: "👩&zwj;💻",
+            woman_with_turban: "👳&zwj;♀️",
+            womans_clothes: "👚",
+            womans_hat: "👒",
+            women_wrestling: "🤼&zwj;♀️",
+            womens: "🚺",
+            world_map: "🗺",
+            worried: "😟",
+            wrench: "🔧",
+            writing_hand: "✍️",
+            x: "❌",
+            yellow_heart: "💛",
+            yen: "💴",
+            yin_yang: "☯️",
+            yum: "😋",
+            zap: "⚡️",
+            zipper_mouth_face: "🤐",
+            zzz: "💤",
+            octocat:
+              '<img alt=":octocat:" height="20" width="20" align="absmiddle" src="https://assets-cdn.github.com/images/icons/emoji/octocat.png">',
+            showdown:
+              "<span style=\"font-family: 'Anonymous Pro', monospace; text-decoration: underline; text-decoration-style: dashed; text-decoration-color: #3e8b8a;text-underline-position: under;\">S</span>",
+          }),
+          (a.Converter = function (e) {
+            "use strict";
+            function t(e, t) {
+              if (((t = t || null), a.helper.isString(e))) {
+                if (((e = a.helper.stdExtName(e)), (t = e), a.extensions[e]))
+                  return (
+                    console.warn(
+                      "DEPRECATION WARNING: " +
+                        e +
+                        " is an old extension that uses a deprecated loading method.Please inform the developer that the extension should be updated!"
+                    ),
+                    void (function (e, t) {
+                      "function" == typeof e && (e = e(new a.Converter()));
+                      a.helper.isArray(e) || (e = [e]);
+                      var n = r(e, t);
+                      if (!n.valid) throw Error(n.error);
+                      for (var s = 0; s < e.length; ++s)
+                        switch (e[s].type) {
+                          case "lang":
+                            u.push(e[s]);
+                            break;
+                          case "output":
+                            d.push(e[s]);
+                            break;
+                          default:
+                            throw Error("Extension loader error: Type unrecognized!!!");
+                        }
+                    })(a.extensions[e], e)
+                  );
+                if (a.helper.isUndefined(s[e]))
+                  throw Error(
+                    'Extension "' + e + '" could not be loaded. It was either not found or is not a valid extension.'
+                  );
+                e = s[e];
+              }
+              "function" == typeof e && (e = e()), a.helper.isArray(e) || (e = [e]);
+              var o = r(e, t);
+              if (!o.valid) throw Error(o.error);
+              for (var i = 0; i < e.length; ++i) {
+                switch (e[i].type) {
+                  case "lang":
+                    u.push(e[i]);
+                    break;
+                  case "output":
+                    d.push(e[i]);
+                }
+                if (e[i].hasOwnProperty("listeners"))
+                  for (var l in e[i].listeners) e[i].listeners.hasOwnProperty(l) && n(l, e[i].listeners[l]);
+              }
+            }
+            function n(e, r) {
+              if (!a.helper.isString(e))
+                throw Error(
+                  "Invalid argument in converter.listen() method: name must be a string, but " + typeof e + " given"
+                );
+              if ("function" != typeof r)
+                throw Error(
+                  "Invalid argument in converter.listen() method: callback must be a function, but " +
+                    typeof r +
+                    " given"
+                );
+              p.hasOwnProperty(e) || (p[e] = []), p[e].push(r);
+            }
+            var c = {},
+              u = [],
+              d = [],
+              p = {},
+              h = i,
+              _ = { parsed: {}, raw: "", format: "" };
+            !(function () {
+              e = e || {};
+              for (var r in o) o.hasOwnProperty(r) && (c[r] = o[r]);
+              if ("object" != typeof e)
+                throw Error(
+                  "Converter expects the passed parameter to be an object, but " + typeof e + " was passed instead."
+                );
+              for (var n in e) e.hasOwnProperty(n) && (c[n] = e[n]);
+              c.extensions && a.helper.forEach(c.extensions, t);
+            })(),
+              (this._dispatch = function (e, r, t, a) {
+                if (p.hasOwnProperty(e))
+                  for (var n = 0; n < p[e].length; ++n) {
+                    var s = p[e][n](e, r, this, t, a);
+                    s && void 0 !== s && (r = s);
+                  }
+                return r;
+              }),
+              (this.listen = function (e, r) {
+                return n(e, r), this;
+              }),
+              (this.makeHtml = function (e) {
+                if (!e) return e;
+                var r = {
+                  gHtmlBlocks: [],
+                  gHtmlMdBlocks: [],
+                  gHtmlSpans: [],
+                  gUrls: {},
+                  gTitles: {},
+                  gDimensions: {},
+                  gListLevel: 0,
+                  hashLinkCounts: {},
+                  langExtensions: u,
+                  outputModifiers: d,
+                  converter: this,
+                  ghCodeBlocks: [],
+                  metadata: { parsed: {}, raw: "", format: "" },
+                };
+                return (
+                  (e = e.replace(/¨/g, "¨T")),
+                  (e = e.replace(/\$/g, "¨D")),
+                  (e = e.replace(/\r\n/g, "\n")),
+                  (e = e.replace(/\r/g, "\n")),
+                  (e = e.replace(/\u00A0/g, "&nbsp;")),
+                  c.smartIndentationFix &&
+                    (e = (function (e) {
+                      var r = e.match(/^\s*/)[0].length,
+                        t = new RegExp("^\\s{0," + r + "}", "gm");
+                      return e.replace(t, "");
+                    })(e)),
+                  (e = "\n\n" + e + "\n\n"),
+                  (e = a.subParser("detab")(e, c, r)),
+                  (e = e.replace(/^[ \t]+$/gm, "")),
+                  a.helper.forEach(u, function (t) {
+                    e = a.subParser("runExtension")(t, e, c, r);
+                  }),
+                  (e = a.subParser("metadata")(e, c, r)),
+                  (e = a.subParser("hashPreCodeTags")(e, c, r)),
+                  (e = a.subParser("githubCodeBlocks")(e, c, r)),
+                  (e = a.subParser("hashHTMLBlocks")(e, c, r)),
+                  (e = a.subParser("hashCodeTags")(e, c, r)),
+                  (e = a.subParser("stripLinkDefinitions")(e, c, r)),
+                  (e = a.subParser("blockGamut")(e, c, r)),
+                  (e = a.subParser("unhashHTMLSpans")(e, c, r)),
+                  (e = a.subParser("unescapeSpecialChars")(e, c, r)),
+                  (e = e.replace(/¨D/g, "$")),
+                  (e = e.replace(/¨T/g, "¨")),
+                  (e = a.subParser("completeHTMLDocument")(e, c, r)),
+                  a.helper.forEach(d, function (t) {
+                    e = a.subParser("runExtension")(t, e, c, r);
+                  }),
+                  (_ = r.metadata),
+                  e
+                );
+              }),
+              (this.makeMarkdown = this.makeMd =
+                function (e, r) {
+                  function t(e) {
+                    for (var r = 0; r < e.childNodes.length; ++r) {
+                      var a = e.childNodes[r];
+                      3 === a.nodeType
+                        ? /\S/.test(a.nodeValue)
+                          ? ((a.nodeValue = a.nodeValue.split("\n").join(" ")),
+                            (a.nodeValue = a.nodeValue.replace(/(\s)+/g, "$1")))
+                          : (e.removeChild(a), --r)
+                        : 1 === a.nodeType && t(a);
+                    }
+                  }
+                  if (
+                    ((e = e.replace(/\r\n/g, "\n")),
+                    (e = e.replace(/\r/g, "\n")),
+                    (e = e.replace(/>[ \t]+</, ">¨NBSP;<")),
+                    !r)
+                  ) {
+                    if (!window || !window.document)
+                      throw new Error(
+                        "HTMLParser is undefined. If in a webworker or nodejs environment, you need to provide a WHATWG DOM and HTML such as JSDOM"
+                      );
+                    r = window.document;
+                  }
+                  var n = r.createElement("div");
+                  n.innerHTML = e;
+                  var s = {
+                    preList: (function (e) {
+                      for (var r = e.querySelectorAll("pre"), t = [], n = 0; n < r.length; ++n)
+                        if (1 === r[n].childElementCount && "code" === r[n].firstChild.tagName.toLowerCase()) {
+                          var s = r[n].firstChild.innerHTML.trim(),
+                            o = r[n].firstChild.getAttribute("data-language") || "";
+                          if ("" === o)
+                            for (var i = r[n].firstChild.className.split(" "), l = 0; l < i.length; ++l) {
+                              var c = i[l].match(/^language-(.+)$/);
+                              if (null !== c) {
+                                o = c[1];
+                                break;
+                              }
+                            }
+                          (s = a.helper.unescapeHTMLEntities(s)),
+                            t.push(s),
+                            (r[n].outerHTML =
+                              '<precode language="' + o + '" precodenum="' + n.toString() + '"></precode>');
+                        } else t.push(r[n].innerHTML), (r[n].innerHTML = ""), r[n].setAttribute("prenum", n.toString());
+                      return t;
+                    })(n),
+                  };
+                  t(n);
+                  for (var o = n.childNodes, i = "", l = 0; l < o.length; l++)
+                    i += a.subParser("makeMarkdown.node")(o[l], s);
+                  return i;
+                }),
+              (this.setOption = function (e, r) {
+                c[e] = r;
+              }),
+              (this.getOption = function (e) {
+                return c[e];
+              }),
+              (this.getOptions = function () {
+                return c;
+              }),
+              (this.addExtension = function (e, r) {
+                t(e, (r = r || null));
+              }),
+              (this.useExtension = function (e) {
+                t(e);
+              }),
+              (this.setFlavor = function (e) {
+                if (!l.hasOwnProperty(e)) throw Error(e + " flavor was not found");
+                var r = l[e];
+                h = e;
+                for (var t in r) r.hasOwnProperty(t) && (c[t] = r[t]);
+              }),
+              (this.getFlavor = function () {
+                return h;
+              }),
+              (this.removeExtension = function (e) {
+                a.helper.isArray(e) || (e = [e]);
+                for (var r = 0; r < e.length; ++r) {
+                  for (var t = e[r], n = 0; n < u.length; ++n) u[n] === t && u[n].splice(n, 1);
+                  for (; 0 < d.length; ++n) d[0] === t && d[0].splice(n, 1);
+                }
+              }),
+              (this.getAllExtensions = function () {
+                return { language: u, output: d };
+              }),
+              (this.getMetadata = function (e) {
+                return e ? _.raw : _.parsed;
+              }),
+              (this.getMetadataFormat = function () {
+                return _.format;
+              }),
+              (this._setMetadataPair = function (e, r) {
+                _.parsed[e] = r;
+              }),
+              (this._setMetadataFormat = function (e) {
+                _.format = e;
+              }),
+              (this._setMetadataRaw = function (e) {
+                _.raw = e;
+              });
+          }),
+          a.subParser("anchors", function (e, r, t) {
+            "use strict";
+            var n = function (e, n, s, o, i, l, c) {
+              if (
+                (a.helper.isUndefined(c) && (c = ""),
+                (s = s.toLowerCase()),
+                e.search(/\(<?\s*>? ?(['"].*['"])?\)$/m) > -1)
+              )
+                o = "";
+              else if (!o) {
+                if ((s || (s = n.toLowerCase().replace(/ ?\n/g, " ")), (o = "#" + s), a.helper.isUndefined(t.gUrls[s])))
+                  return e;
+                (o = t.gUrls[s]), a.helper.isUndefined(t.gTitles[s]) || (c = t.gTitles[s]);
+              }
+              var u =
+                '<a href="' +
+                (o = o.replace(a.helper.regexes.asteriskDashAndColon, a.helper.escapeCharactersCallback)) +
+                '"';
+              return (
+                "" !== c &&
+                  null !== c &&
+                  (u +=
+                    ' title="' +
+                    (c = (c = c.replace(/"/g, "&quot;")).replace(
+                      a.helper.regexes.asteriskDashAndColon,
+                      a.helper.escapeCharactersCallback
+                    )) +
+                    '"'),
+                r.openLinksInNewWindow && !/^#/.test(o) && (u += ' rel="noopener noreferrer" target="¨E95Eblank"'),
+                (u += ">" + n + "</a>")
+              );
+            };
+            return (
+              (e = (e = t.converter._dispatch("anchors.before", e, r, t)).replace(
+                /\[((?:\[[^\]]*]|[^\[\]])*)] ?(?:\n *)?\[(.*?)]()()()()/g,
+                n
+              )),
+              (e = e.replace(
+                /\[((?:\[[^\]]*]|[^\[\]])*)]()[ \t]*\([ \t]?<([^>]*)>(?:[ \t]*((["'])([^"]*?)\5))?[ \t]?\)/g,
+                n
+              )),
+              (e = e.replace(
+                /\[((?:\[[^\]]*]|[^\[\]])*)]()[ \t]*\([ \t]?<?([\S]+?(?:\([\S]*?\)[\S]*?)?)>?(?:[ \t]*((["'])([^"]*?)\5))?[ \t]?\)/g,
+                n
+              )),
+              (e = e.replace(/\[([^\[\]]+)]()()()()()/g, n)),
+              r.ghMentions &&
+                (e = e.replace(/(^|\s)(\\)?(@([a-z\d]+(?:[a-z\d.-]+?[a-z\d]+)*))/gim, function (e, t, n, s, o) {
+                  if ("\\" === n) return t + s;
+                  if (!a.helper.isString(r.ghMentionsLink)) throw new Error("ghMentionsLink option must be a string");
+                  var i = r.ghMentionsLink.replace(/\{u}/g, o),
+                    l = "";
+                  return (
+                    r.openLinksInNewWindow && (l = ' rel="noopener noreferrer" target="¨E95Eblank"'),
+                    t + '<a href="' + i + '"' + l + ">" + s + "</a>"
+                  );
+                })),
+              (e = t.converter._dispatch("anchors.after", e, r, t))
+            );
+          });
+        var u = /([*~_]+|\b)(((https?|ftp|dict):\/\/|www\.)[^'">\s]+?\.[^'">\s]+?)()(\1)?(?=\s|$)(?!["<>])/gi,
+          d = /([*~_]+|\b)(((https?|ftp|dict):\/\/|www\.)[^'">\s]+\.[^'">\s]+?)([.!?,()\[\]])?(\1)?(?=\s|$)(?!["<>])/gi,
+          p = /()<(((https?|ftp|dict):\/\/|www\.)[^'">\s]+)()>()/gi,
+          h = /(^|\s)(?:mailto:)?([A-Za-z0-9!#$%&'*+-/=?^_`{|}~.]+@[-a-z0-9]+(\.[-a-z0-9]+)*\.[a-z]+)(?=$|\s)/gim,
+          _ = /<()(?:mailto:)?([-.\w]+@[-a-z0-9]+(\.[-a-z0-9]+)*\.[a-z]+)>/gi,
+          g = function (e) {
+            "use strict";
+            return function (r, t, n, s, o, i, l) {
+              var c = (n = n.replace(a.helper.regexes.asteriskDashAndColon, a.helper.escapeCharactersCallback)),
+                u = "",
+                d = "",
+                p = t || "",
+                h = l || "";
+              return (
+                /^www\./i.test(n) && (n = n.replace(/^www\./i, "http://www.")),
+                e.excludeTrailingPunctuationFromURLs && i && (u = i),
+                e.openLinksInNewWindow && (d = ' rel="noopener noreferrer" target="¨E95Eblank"'),
+                p + '<a href="' + n + '"' + d + ">" + c + "</a>" + u + h
+              );
+            };
+          },
+          m = function (e, r) {
+            "use strict";
+            return function (t, n, s) {
+              var o = "mailto:";
+              return (
+                (n = n || ""),
+                (s = a.subParser("unescapeSpecialChars")(s, e, r)),
+                e.encodeEmails
+                  ? ((o = a.helper.encodeEmailAddress(o + s)), (s = a.helper.encodeEmailAddress(s)))
+                  : (o += s),
+                n + '<a href="' + o + '">' + s + "</a>"
+              );
+            };
+          };
+        a.subParser("autoLinks", function (e, r, t) {
+          "use strict";
+          return (
+            (e = t.converter._dispatch("autoLinks.before", e, r, t)),
+            (e = e.replace(p, g(r))),
+            (e = e.replace(_, m(r, t))),
+            (e = t.converter._dispatch("autoLinks.after", e, r, t))
+          );
+        }),
+          a.subParser("simplifiedAutoLinks", function (e, r, t) {
+            "use strict";
+            return r.simplifiedAutoLink
+              ? ((e = t.converter._dispatch("simplifiedAutoLinks.before", e, r, t)),
+                (e = r.excludeTrailingPunctuationFromURLs ? e.replace(d, g(r)) : e.replace(u, g(r))),
+                (e = e.replace(h, m(r, t))),
+                (e = t.converter._dispatch("simplifiedAutoLinks.after", e, r, t)))
+              : e;
+          }),
+          a.subParser("blockGamut", function (e, r, t) {
+            "use strict";
+            return (
+              (e = t.converter._dispatch("blockGamut.before", e, r, t)),
+              (e = a.subParser("blockQuotes")(e, r, t)),
+              (e = a.subParser("headers")(e, r, t)),
+              (e = a.subParser("horizontalRule")(e, r, t)),
+              (e = a.subParser("lists")(e, r, t)),
+              (e = a.subParser("codeBlocks")(e, r, t)),
+              (e = a.subParser("tables")(e, r, t)),
+              (e = a.subParser("hashHTMLBlocks")(e, r, t)),
+              (e = a.subParser("paragraphs")(e, r, t)),
+              (e = t.converter._dispatch("blockGamut.after", e, r, t))
+            );
+          }),
+          a.subParser("blockQuotes", function (e, r, t) {
+            "use strict";
+            (e = t.converter._dispatch("blockQuotes.before", e, r, t)), (e += "\n\n");
+            var n = /(^ {0,3}>[ \t]?.+\n(.+\n)*\n*)+/gm;
+            return (
+              r.splitAdjacentBlockquotes && (n = /^ {0,3}>[\s\S]*?(?:\n\n)/gm),
+              (e = e.replace(n, function (e) {
+                return (
+                  (e = e.replace(/^[ \t]*>[ \t]?/gm, "")),
+                  (e = e.replace(/¨0/g, "")),
+                  (e = e.replace(/^[ \t]+$/gm, "")),
+                  (e = a.subParser("githubCodeBlocks")(e, r, t)),
+                  (e = a.subParser("blockGamut")(e, r, t)),
+                  (e = e.replace(/(^|\n)/g, "$1  ")),
+                  (e = e.replace(/(\s*<pre>[^\r]+?<\/pre>)/gm, function (e, r) {
+                    var t = r;
+                    return (t = t.replace(/^  /gm, "¨0")), (t = t.replace(/¨0/g, ""));
+                  })),
+                  a.subParser("hashBlock")("<blockquote>\n" + e + "\n</blockquote>", r, t)
+                );
+              })),
+              (e = t.converter._dispatch("blockQuotes.after", e, r, t))
+            );
+          }),
+          a.subParser("codeBlocks", function (e, r, t) {
+            "use strict";
+            e = t.converter._dispatch("codeBlocks.before", e, r, t);
+            return (
+              (e = (e += "¨0").replace(
+                /(?:\n\n|^)((?:(?:[ ]{4}|\t).*\n+)+)(\n*[ ]{0,3}[^ \t\n]|(?=¨0))/g,
+                function (e, n, s) {
+                  var o = n,
+                    i = s,
+                    l = "\n";
+                  return (
+                    (o = a.subParser("outdent")(o, r, t)),
+                    (o = a.subParser("encodeCode")(o, r, t)),
+                    (o = a.subParser("detab")(o, r, t)),
+                    (o = o.replace(/^\n+/g, "")),
+                    (o = o.replace(/\n+$/g, "")),
+                    r.omitExtraWLInCodeBlocks && (l = ""),
+                    (o = "<pre><code>" + o + l + "</code></pre>"),
+                    a.subParser("hashBlock")(o, r, t) + i
+                  );
+                }
+              )),
+              (e = e.replace(/¨0/, "")),
+              (e = t.converter._dispatch("codeBlocks.after", e, r, t))
+            );
+          }),
+          a.subParser("codeSpans", function (e, r, t) {
+            "use strict";
+            return (
+              void 0 === (e = t.converter._dispatch("codeSpans.before", e, r, t)) && (e = ""),
+              (e = e.replace(/(^|[^\\])(`+)([^\r]*?[^`])\2(?!`)/gm, function (e, n, s, o) {
+                var i = o;
+                return (
+                  (i = i.replace(/^([ \t]*)/g, "")),
+                  (i = i.replace(/[ \t]*$/g, "")),
+                  (i = a.subParser("encodeCode")(i, r, t)),
+                  (i = n + "<code>" + i + "</code>"),
+                  (i = a.subParser("hashHTMLSpans")(i, r, t))
+                );
+              })),
+              (e = t.converter._dispatch("codeSpans.after", e, r, t))
+            );
+          }),
+          a.subParser("completeHTMLDocument", function (e, r, t) {
+            "use strict";
+            if (!r.completeHTMLDocument) return e;
+            e = t.converter._dispatch("completeHTMLDocument.before", e, r, t);
+            var a = "html",
+              n = "<!DOCTYPE HTML>\n",
+              s = "",
+              o = '<meta charset="utf-8">\n',
+              i = "",
+              l = "";
+            void 0 !== t.metadata.parsed.doctype &&
+              ((n = "<!DOCTYPE " + t.metadata.parsed.doctype + ">\n"),
+              ("html" !== (a = t.metadata.parsed.doctype.toString().toLowerCase()) && "html5" !== a) ||
+                (o = '<meta charset="utf-8">'));
+            for (var c in t.metadata.parsed)
+              if (t.metadata.parsed.hasOwnProperty(c))
+                switch (c.toLowerCase()) {
+                  case "doctype":
+                    break;
+                  case "title":
+                    s = "<title>" + t.metadata.parsed.title + "</title>\n";
+                    break;
+                  case "charset":
+                    o =
+                      "html" === a || "html5" === a
+                        ? '<meta charset="' + t.metadata.parsed.charset + '">\n'
+                        : '<meta name="charset" content="' + t.metadata.parsed.charset + '">\n';
+                    break;
+                  case "language":
+                  case "lang":
+                    (i = ' lang="' + t.metadata.parsed[c] + '"'),
+                      (l += '<meta name="' + c + '" content="' + t.metadata.parsed[c] + '">\n');
+                    break;
+                  default:
+                    l += '<meta name="' + c + '" content="' + t.metadata.parsed[c] + '">\n';
+                }
+            return (
+              (e = n + "<html" + i + ">\n<head>\n" + s + o + l + "</head>\n<body>\n" + e.trim() + "\n</body>\n</html>"),
+              (e = t.converter._dispatch("completeHTMLDocument.after", e, r, t))
+            );
+          }),
+          a.subParser("detab", function (e, r, t) {
+            "use strict";
+            return (
+              (e = t.converter._dispatch("detab.before", e, r, t)),
+              (e = e.replace(/\t(?=\t)/g, "    ")),
+              (e = e.replace(/\t/g, "¨A¨B")),
+              (e = e.replace(/¨B(.+?)¨A/g, function (e, r) {
+                for (var t = r, a = 4 - (t.length % 4), n = 0; n < a; n++) t += " ";
+                return t;
+              })),
+              (e = e.replace(/¨A/g, "    ")),
+              (e = e.replace(/¨B/g, "")),
+              (e = t.converter._dispatch("detab.after", e, r, t))
+            );
+          }),
+          a.subParser("ellipsis", function (e, r, t) {
+            "use strict";
+            return (
+              (e = t.converter._dispatch("ellipsis.before", e, r, t)),
+              (e = e.replace(/\.\.\./g, "…")),
+              (e = t.converter._dispatch("ellipsis.after", e, r, t))
+            );
+          }),
+          a.subParser("emoji", function (e, r, t) {
+            "use strict";
+            if (!r.emoji) return e;
+            return (
+              (e = (e = t.converter._dispatch("emoji.before", e, r, t)).replace(/:([\S]+?):/g, function (e, r) {
+                return a.helper.emojis.hasOwnProperty(r) ? a.helper.emojis[r] : e;
+              })),
+              (e = t.converter._dispatch("emoji.after", e, r, t))
+            );
+          }),
+          a.subParser("encodeAmpsAndAngles", function (e, r, t) {
+            "use strict";
+            return (
+              (e = t.converter._dispatch("encodeAmpsAndAngles.before", e, r, t)),
+              (e = e.replace(/&(?!#?[xX]?(?:[0-9a-fA-F]+|\w+);)/g, "&amp;")),
+              (e = e.replace(/<(?![a-z\/?$!])/gi, "&lt;")),
+              (e = e.replace(/</g, "&lt;")),
+              (e = e.replace(/>/g, "&gt;")),
+              (e = t.converter._dispatch("encodeAmpsAndAngles.after", e, r, t))
+            );
+          }),
+          a.subParser("encodeBackslashEscapes", function (e, r, t) {
+            "use strict";
+            return (
+              (e = t.converter._dispatch("encodeBackslashEscapes.before", e, r, t)),
+              (e = e.replace(/\\(\\)/g, a.helper.escapeCharactersCallback)),
+              (e = e.replace(/\\([`*_{}\[\]()>#+.!~=|-])/g, a.helper.escapeCharactersCallback)),
+              (e = t.converter._dispatch("encodeBackslashEscapes.after", e, r, t))
+            );
+          }),
+          a.subParser("encodeCode", function (e, r, t) {
+            "use strict";
+            return (
+              (e = t.converter._dispatch("encodeCode.before", e, r, t)),
+              (e = e
+                .replace(/&/g, "&amp;")
+                .replace(/</g, "&lt;")
+                .replace(/>/g, "&gt;")
+                .replace(/([*_{}\[\]\\=~-])/g, a.helper.escapeCharactersCallback)),
+              (e = t.converter._dispatch("encodeCode.after", e, r, t))
+            );
+          }),
+          a.subParser("escapeSpecialCharsWithinTagAttributes", function (e, r, t) {
+            "use strict";
+            return (
+              (e = (e = t.converter._dispatch("escapeSpecialCharsWithinTagAttributes.before", e, r, t)).replace(
+                /<\/?[a-z\d_:-]+(?:[\s]+[\s\S]+?)?>/gi,
+                function (e) {
+                  return e
+                    .replace(/(.)<\/?code>(?=.)/g, "$1`")
+                    .replace(/([\\`*_~=|])/g, a.helper.escapeCharactersCallback);
+                }
+              )),
+              (e = e.replace(/<!(--(?:(?:[^>-]|-[^>])(?:[^-]|-[^-])*)--)>/gi, function (e) {
+                return e.replace(/([\\`*_~=|])/g, a.helper.escapeCharactersCallback);
+              })),
+              (e = t.converter._dispatch("escapeSpecialCharsWithinTagAttributes.after", e, r, t))
+            );
+          }),
+          a.subParser("githubCodeBlocks", function (e, r, t) {
+            "use strict";
+            return r.ghCodeBlocks
+              ? ((e = t.converter._dispatch("githubCodeBlocks.before", e, r, t)),
+                (e += "¨0"),
+                (e = e.replace(
+                  /(?:^|\n)(?: {0,3})(```+|~~~+)(?: *)([^\s`~]*)\n([\s\S]*?)\n(?: {0,3})\1/g,
+                  function (e, n, s, o) {
+                    var i = r.omitExtraWLInCodeBlocks ? "" : "\n";
+                    return (
+                      (o = a.subParser("encodeCode")(o, r, t)),
+                      (o = a.subParser("detab")(o, r, t)),
+                      (o = o.replace(/^\n+/g, "")),
+                      (o = o.replace(/\n+$/g, "")),
+                      (o =
+                        "<pre><code" +
+                        (s ? ' class="' + s + " language-" + s + '"' : "") +
+                        ">" +
+                        o +
+                        i +
+                        "</code></pre>"),
+                      (o = a.subParser("hashBlock")(o, r, t)),
+                      "\n\n¨G" + (t.ghCodeBlocks.push({ text: e, codeblock: o }) - 1) + "G\n\n"
+                    );
+                  }
+                )),
+                (e = e.replace(/¨0/, "")),
+                t.converter._dispatch("githubCodeBlocks.after", e, r, t))
+              : e;
+          }),
+          a.subParser("hashBlock", function (e, r, t) {
+            "use strict";
+            return (
+              (e = t.converter._dispatch("hashBlock.before", e, r, t)),
+              (e = e.replace(/(^\n+|\n+$)/g, "")),
+              (e = "\n\n¨K" + (t.gHtmlBlocks.push(e) - 1) + "K\n\n"),
+              (e = t.converter._dispatch("hashBlock.after", e, r, t))
+            );
+          }),
+          a.subParser("hashCodeTags", function (e, r, t) {
+            "use strict";
+            e = t.converter._dispatch("hashCodeTags.before", e, r, t);
+            return (
+              (e = a.helper.replaceRecursiveRegExp(
+                e,
+                function (e, n, s, o) {
+                  var i = s + a.subParser("encodeCode")(n, r, t) + o;
+                  return "¨C" + (t.gHtmlSpans.push(i) - 1) + "C";
+                },
+                "<code\\b[^>]*>",
+                "</code>",
+                "gim"
+              )),
+              (e = t.converter._dispatch("hashCodeTags.after", e, r, t))
+            );
+          }),
+          a.subParser("hashElement", function (e, r, t) {
+            "use strict";
+            return function (e, r) {
+              var a = r;
+              return (
+                (a = a.replace(/\n\n/g, "\n")),
+                (a = a.replace(/^\n/, "")),
+                (a = a.replace(/\n+$/g, "")),
+                (a = "\n\n¨K" + (t.gHtmlBlocks.push(a) - 1) + "K\n\n")
+              );
+            };
+          }),
+          a.subParser("hashHTMLBlocks", function (e, r, t) {
+            "use strict";
+            e = t.converter._dispatch("hashHTMLBlocks.before", e, r, t);
+            var n = [
+                "pre",
+                "div",
+                "h1",
+                "h2",
+                "h3",
+                "h4",
+                "h5",
+                "h6",
+                "blockquote",
+                "table",
+                "dl",
+                "ol",
+                "ul",
+                "script",
+                "noscript",
+                "form",
+                "fieldset",
+                "iframe",
+                "math",
+                "style",
+                "section",
+                "header",
+                "footer",
+                "nav",
+                "article",
+                "aside",
+                "address",
+                "audio",
+                "canvas",
+                "figure",
+                "hgroup",
+                "output",
+                "video",
+                "p",
+              ],
+              s = function (e, r, a, n) {
+                var s = e;
+                return (
+                  -1 !== a.search(/\bmarkdown\b/) && (s = a + t.converter.makeHtml(r) + n),
+                  "\n\n¨K" + (t.gHtmlBlocks.push(s) - 1) + "K\n\n"
+                );
+              };
+            r.backslashEscapesHTMLTags &&
+              (e = e.replace(/\\<(\/?[^>]+?)>/g, function (e, r) {
+                return "&lt;" + r + "&gt;";
+              }));
+            for (var o = 0; o < n.length; ++o)
+              for (
+                var i,
+                  l = new RegExp("^ {0,3}(<" + n[o] + "\\b[^>]*>)", "im"),
+                  c = "<" + n[o] + "\\b[^>]*>",
+                  u = "</" + n[o] + ">";
+                -1 !== (i = a.helper.regexIndexOf(e, l));
+
+              ) {
+                var d = a.helper.splitAtIndex(e, i),
+                  p = a.helper.replaceRecursiveRegExp(d[1], s, c, u, "im");
+                if (p === d[1]) break;
+                e = d[0].concat(p);
+              }
+            return (
+              (e = e.replace(/(\n {0,3}(<(hr)\b([^<>])*?\/?>)[ \t]*(?=\n{2,}))/g, a.subParser("hashElement")(e, r, t))),
+              (e = a.helper.replaceRecursiveRegExp(
+                e,
+                function (e) {
+                  return "\n\n¨K" + (t.gHtmlBlocks.push(e) - 1) + "K\n\n";
+                },
+                "^ {0,3}\x3c!--",
+                "--\x3e",
+                "gm"
+              )),
+              (e = e.replace(
+                /(?:\n\n)( {0,3}(?:<([?%])[^\r]*?\2>)[ \t]*(?=\n{2,}))/g,
+                a.subParser("hashElement")(e, r, t)
+              )),
+              (e = t.converter._dispatch("hashHTMLBlocks.after", e, r, t))
+            );
+          }),
+          a.subParser("hashHTMLSpans", function (e, r, t) {
+            "use strict";
+            function a(e) {
+              return "¨C" + (t.gHtmlSpans.push(e) - 1) + "C";
+            }
+            return (
+              (e = t.converter._dispatch("hashHTMLSpans.before", e, r, t)),
+              (e = e.replace(/<[^>]+?\/>/gi, function (e) {
+                return a(e);
+              })),
+              (e = e.replace(/<([^>]+?)>[\s\S]*?<\/\1>/g, function (e) {
+                return a(e);
+              })),
+              (e = e.replace(/<([^>]+?)\s[^>]+?>[\s\S]*?<\/\1>/g, function (e) {
+                return a(e);
+              })),
+              (e = e.replace(/<[^>]+?>/gi, function (e) {
+                return a(e);
+              })),
+              (e = t.converter._dispatch("hashHTMLSpans.after", e, r, t))
+            );
+          }),
+          a.subParser("unhashHTMLSpans", function (e, r, t) {
+            "use strict";
+            e = t.converter._dispatch("unhashHTMLSpans.before", e, r, t);
+            for (var a = 0; a < t.gHtmlSpans.length; ++a) {
+              for (var n = t.gHtmlSpans[a], s = 0; /¨C(\d+)C/.test(n); ) {
+                var o = RegExp.$1;
+                if (((n = n.replace("¨C" + o + "C", t.gHtmlSpans[o])), 10 === s)) {
+                  console.error("maximum nesting of 10 spans reached!!!");
+                  break;
+                }
+                ++s;
+              }
+              e = e.replace("¨C" + a + "C", n);
+            }
+            return (e = t.converter._dispatch("unhashHTMLSpans.after", e, r, t));
+          }),
+          a.subParser("hashPreCodeTags", function (e, r, t) {
+            "use strict";
+            e = t.converter._dispatch("hashPreCodeTags.before", e, r, t);
+            return (
+              (e = a.helper.replaceRecursiveRegExp(
+                e,
+                function (e, n, s, o) {
+                  var i = s + a.subParser("encodeCode")(n, r, t) + o;
+                  return "\n\n¨G" + (t.ghCodeBlocks.push({ text: e, codeblock: i }) - 1) + "G\n\n";
+                },
+                "^ {0,3}<pre\\b[^>]*>\\s*<code\\b[^>]*>",
+                "^ {0,3}</code>\\s*</pre>",
+                "gim"
+              )),
+              (e = t.converter._dispatch("hashPreCodeTags.after", e, r, t))
+            );
+          }),
+          a.subParser("headers", function (e, r, t) {
+            "use strict";
+            function n(e) {
+              var n, s;
+              if (r.customizedHeaderId) {
+                var o = e.match(/\{([^{]+?)}\s*$/);
+                o && o[1] && (e = o[1]);
+              }
+              return (
+                (n = e),
+                (s = a.helper.isString(r.prefixHeaderId)
+                  ? r.prefixHeaderId
+                  : !0 === r.prefixHeaderId
+                    ? "section-"
+                    : ""),
+                r.rawPrefixHeaderId || (n = s + n),
+                (n = r.ghCompatibleHeaderId
+                  ? n
+                      .replace(/ /g, "-")
+                      .replace(/&amp;/g, "")
+                      .replace(/¨T/g, "")
+                      .replace(/¨D/g, "")
+                      .replace(/[&+$,\/:;=?@"#{}|^¨~\[\]`\\*)(%.!'<>]/g, "")
+                      .toLowerCase()
+                  : r.rawHeaderId
+                    ? n
+                        .replace(/ /g, "-")
+                        .replace(/&amp;/g, "&")
+                        .replace(/¨T/g, "¨")
+                        .replace(/¨D/g, "$")
+                        .replace(/["']/g, "-")
+                        .toLowerCase()
+                    : n.replace(/[^\w]/g, "").toLowerCase()),
+                r.rawPrefixHeaderId && (n = s + n),
+                t.hashLinkCounts[n] ? (n = n + "-" + t.hashLinkCounts[n]++) : (t.hashLinkCounts[n] = 1),
+                n
+              );
+            }
+            e = t.converter._dispatch("headers.before", e, r, t);
+            var s = isNaN(parseInt(r.headerLevelStart)) ? 1 : parseInt(r.headerLevelStart),
+              o = r.smoothLivePreview ? /^(.+)[ \t]*\n={2,}[ \t]*\n+/gm : /^(.+)[ \t]*\n=+[ \t]*\n+/gm,
+              i = r.smoothLivePreview ? /^(.+)[ \t]*\n-{2,}[ \t]*\n+/gm : /^(.+)[ \t]*\n-+[ \t]*\n+/gm;
+            e = (e = e.replace(o, function (e, o) {
+              var i = a.subParser("spanGamut")(o, r, t),
+                l = r.noHeaderId ? "" : ' id="' + n(o) + '"',
+                c = "<h" + s + l + ">" + i + "</h" + s + ">";
+              return a.subParser("hashBlock")(c, r, t);
+            })).replace(i, function (e, o) {
+              var i = a.subParser("spanGamut")(o, r, t),
+                l = r.noHeaderId ? "" : ' id="' + n(o) + '"',
+                c = s + 1,
+                u = "<h" + c + l + ">" + i + "</h" + c + ">";
+              return a.subParser("hashBlock")(u, r, t);
+            });
+            var l = r.requireSpaceBeforeHeadingText
+              ? /^(#{1,6})[ \t]+(.+?)[ \t]*#*\n+/gm
+              : /^(#{1,6})[ \t]*(.+?)[ \t]*#*\n+/gm;
+            return (
+              (e = e.replace(l, function (e, o, i) {
+                var l = i;
+                r.customizedHeaderId && (l = i.replace(/\s?\{([^{]+?)}\s*$/, ""));
+                var c = a.subParser("spanGamut")(l, r, t),
+                  u = r.noHeaderId ? "" : ' id="' + n(i) + '"',
+                  d = s - 1 + o.length,
+                  p = "<h" + d + u + ">" + c + "</h" + d + ">";
+                return a.subParser("hashBlock")(p, r, t);
+              })),
+              (e = t.converter._dispatch("headers.after", e, r, t))
+            );
+          }),
+          a.subParser("horizontalRule", function (e, r, t) {
+            "use strict";
+            e = t.converter._dispatch("horizontalRule.before", e, r, t);
+            var n = a.subParser("hashBlock")("<hr />", r, t);
+            return (
+              (e = e.replace(/^ {0,2}( ?-){3,}[ \t]*$/gm, n)),
+              (e = e.replace(/^ {0,2}( ?\*){3,}[ \t]*$/gm, n)),
+              (e = e.replace(/^ {0,2}( ?_){3,}[ \t]*$/gm, n)),
+              (e = t.converter._dispatch("horizontalRule.after", e, r, t))
+            );
+          }),
+          a.subParser("images", function (e, r, t) {
+            "use strict";
+            function n(e, r, n, s, o, i, l, c) {
+              var u = t.gUrls,
+                d = t.gTitles,
+                p = t.gDimensions;
+              if (((n = n.toLowerCase()), c || (c = ""), e.search(/\(<?\s*>? ?(['"].*['"])?\)$/m) > -1)) s = "";
+              else if ("" === s || null === s) {
+                if (
+                  (("" !== n && null !== n) || (n = r.toLowerCase().replace(/ ?\n/g, " ")),
+                  (s = "#" + n),
+                  a.helper.isUndefined(u[n]))
+                )
+                  return e;
+                (s = u[n]),
+                  a.helper.isUndefined(d[n]) || (c = d[n]),
+                  a.helper.isUndefined(p[n]) || ((o = p[n].width), (i = p[n].height));
+              }
+              r = r
+                .replace(/"/g, "&quot;")
+                .replace(a.helper.regexes.asteriskDashAndColon, a.helper.escapeCharactersCallback);
+              var h =
+                '<img src="' +
+                (s = s.replace(a.helper.regexes.asteriskDashAndColon, a.helper.escapeCharactersCallback)) +
+                '" alt="' +
+                r +
+                '"';
+              return (
+                c &&
+                  a.helper.isString(c) &&
+                  (h +=
+                    ' title="' +
+                    (c = c
+                      .replace(/"/g, "&quot;")
+                      .replace(a.helper.regexes.asteriskDashAndColon, a.helper.escapeCharactersCallback)) +
+                    '"'),
+                o &&
+                  i &&
+                  ((h += ' width="' + (o = "*" === o ? "auto" : o) + '"'),
+                  (h += ' height="' + (i = "*" === i ? "auto" : i) + '"')),
+                (h += " />")
+              );
+            }
+            return (
+              (e = (e = t.converter._dispatch("images.before", e, r, t)).replace(
+                /!\[([^\]]*?)] ?(?:\n *)?\[([\s\S]*?)]()()()()()/g,
+                n
+              )),
+              (e = e.replace(
+                /!\[([^\]]*?)][ \t]*()\([ \t]?<?(data:.+?\/.+?;base64,[A-Za-z0-9+/=\n]+?)>?(?: =([*\d]+[A-Za-z%]{0,4})x([*\d]+[A-Za-z%]{0,4}))?[ \t]*(?:(["'])([^"]*?)\6)?[ \t]?\)/g,
+                function (e, r, t, a, s, o, i, l) {
+                  return (a = a.replace(/\s/g, "")), n(e, r, t, a, s, o, 0, l);
+                }
+              )),
+              (e = e.replace(
+                /!\[([^\]]*?)][ \t]*()\([ \t]?<([^>]*)>(?: =([*\d]+[A-Za-z%]{0,4})x([*\d]+[A-Za-z%]{0,4}))?[ \t]*(?:(?:(["'])([^"]*?)\6))?[ \t]?\)/g,
+                n
+              )),
+              (e = e.replace(
+                /!\[([^\]]*?)][ \t]*()\([ \t]?<?([\S]+?(?:\([\S]*?\)[\S]*?)?)>?(?: =([*\d]+[A-Za-z%]{0,4})x([*\d]+[A-Za-z%]{0,4}))?[ \t]*(?:(["'])([^"]*?)\6)?[ \t]?\)/g,
+                n
+              )),
+              (e = e.replace(/!\[([^\[\]]+)]()()()()()/g, n)),
+              (e = t.converter._dispatch("images.after", e, r, t))
+            );
+          }),
+          a.subParser("italicsAndBold", function (e, r, t) {
+            "use strict";
+            function a(e, r, t) {
+              return r + e + t;
+            }
+            return (
+              (e = t.converter._dispatch("italicsAndBold.before", e, r, t)),
+              (e = r.literalMidWordUnderscores
+                ? (e = (e = e.replace(/\b___(\S[\s\S]*?)___\b/g, function (e, r) {
+                    return a(r, "<strong><em>", "</em></strong>");
+                  })).replace(/\b__(\S[\s\S]*?)__\b/g, function (e, r) {
+                    return a(r, "<strong>", "</strong>");
+                  })).replace(/\b_(\S[\s\S]*?)_\b/g, function (e, r) {
+                    return a(r, "<em>", "</em>");
+                  })
+                : (e = (e = e.replace(/___(\S[\s\S]*?)___/g, function (e, r) {
+                    return /\S$/.test(r) ? a(r, "<strong><em>", "</em></strong>") : e;
+                  })).replace(/__(\S[\s\S]*?)__/g, function (e, r) {
+                    return /\S$/.test(r) ? a(r, "<strong>", "</strong>") : e;
+                  })).replace(/_([^\s_][\s\S]*?)_/g, function (e, r) {
+                    return /\S$/.test(r) ? a(r, "<em>", "</em>") : e;
+                  })),
+              (e = r.literalMidWordAsterisks
+                ? (e = (e = e.replace(/([^*]|^)\B\*\*\*(\S[\s\S]*?)\*\*\*\B(?!\*)/g, function (e, r, t) {
+                    return a(t, r + "<strong><em>", "</em></strong>");
+                  })).replace(/([^*]|^)\B\*\*(\S[\s\S]*?)\*\*\B(?!\*)/g, function (e, r, t) {
+                    return a(t, r + "<strong>", "</strong>");
+                  })).replace(/([^*]|^)\B\*(\S[\s\S]*?)\*\B(?!\*)/g, function (e, r, t) {
+                    return a(t, r + "<em>", "</em>");
+                  })
+                : (e = (e = e.replace(/\*\*\*(\S[\s\S]*?)\*\*\*/g, function (e, r) {
+                    return /\S$/.test(r) ? a(r, "<strong><em>", "</em></strong>") : e;
+                  })).replace(/\*\*(\S[\s\S]*?)\*\*/g, function (e, r) {
+                    return /\S$/.test(r) ? a(r, "<strong>", "</strong>") : e;
+                  })).replace(/\*([^\s*][\s\S]*?)\*/g, function (e, r) {
+                    return /\S$/.test(r) ? a(r, "<em>", "</em>") : e;
+                  })),
+              (e = t.converter._dispatch("italicsAndBold.after", e, r, t))
+            );
+          }),
+          a.subParser("lists", function (e, r, t) {
+            "use strict";
+            function n(e, n) {
+              t.gListLevel++, (e = e.replace(/\n{2,}$/, "\n"));
+              var s =
+                  /(\n)?(^ {0,3})([*+-]|\d+[.])[ \t]+((\[(x|X| )?])?[ \t]*[^\r]+?(\n{1,2}))(?=\n*(¨0| {0,3}([*+-]|\d+[.])[ \t]+))/gm,
+                o = /\n[ \t]*\n(?!¨0)/.test((e += "¨0"));
+              return (
+                r.disableForced4SpacesIndentedSublists &&
+                  (s =
+                    /(\n)?(^ {0,3})([*+-]|\d+[.])[ \t]+((\[(x|X| )?])?[ \t]*[^\r]+?(\n{1,2}))(?=\n*(¨0|\2([*+-]|\d+[.])[ \t]+))/gm),
+                (e = e.replace(s, function (e, n, s, i, l, c, u) {
+                  u = u && "" !== u.trim();
+                  var d = a.subParser("outdent")(l, r, t),
+                    p = "";
+                  return (
+                    c &&
+                      r.tasklists &&
+                      ((p = ' class="task-list-item" style="list-style-type: none;"'),
+                      (d = d.replace(/^[ \t]*\[(x|X| )?]/m, function () {
+                        var e =
+                          '<input type="checkbox" disabled style="margin: 0px 0.35em 0.25em -1.6em; vertical-align: middle;"';
+                        return u && (e += " checked"), (e += ">");
+                      }))),
+                    (d = d.replace(/^([-*+]|\d\.)[ \t]+[\S\n ]*/g, function (e) {
+                      return "¨A" + e;
+                    })),
+                    n || d.search(/\n{2,}/) > -1
+                      ? ((d = a.subParser("githubCodeBlocks")(d, r, t)), (d = a.subParser("blockGamut")(d, r, t)))
+                      : ((d = (d = a.subParser("lists")(d, r, t)).replace(/\n$/, "")),
+                        (d = (d = a.subParser("hashHTMLBlocks")(d, r, t)).replace(/\n\n+/g, "\n\n")),
+                        (d = o ? a.subParser("paragraphs")(d, r, t) : a.subParser("spanGamut")(d, r, t))),
+                    (d = d.replace("¨A", "")),
+                    (d = "<li" + p + ">" + d + "</li>\n")
+                  );
+                })),
+                (e = e.replace(/¨0/g, "")),
+                t.gListLevel--,
+                n && (e = e.replace(/\s+$/, "")),
+                e
+              );
+            }
+            function s(e, r) {
+              if ("ol" === r) {
+                var t = e.match(/^ *(\d+)\./);
+                if (t && "1" !== t[1]) return ' start="' + t[1] + '"';
+              }
+              return "";
+            }
+            function o(e, t, a) {
+              var o = r.disableForced4SpacesIndentedSublists ? /^ ?\d+\.[ \t]/gm : /^ {0,3}\d+\.[ \t]/gm,
+                i = r.disableForced4SpacesIndentedSublists ? /^ ?[*+-][ \t]/gm : /^ {0,3}[*+-][ \t]/gm,
+                l = "ul" === t ? o : i,
+                c = "";
+              if (-1 !== e.search(l))
+                !(function r(u) {
+                  var d = u.search(l),
+                    p = s(e, t);
+                  -1 !== d
+                    ? ((c += "\n\n<" + t + p + ">\n" + n(u.slice(0, d), !!a) + "</" + t + ">\n"),
+                      (l = "ul" === (t = "ul" === t ? "ol" : "ul") ? o : i),
+                      r(u.slice(d)))
+                    : (c += "\n\n<" + t + p + ">\n" + n(u, !!a) + "</" + t + ">\n");
+                })(e);
+              else {
+                var u = s(e, t);
+                c = "\n\n<" + t + u + ">\n" + n(e, !!a) + "</" + t + ">\n";
+              }
+              return c;
+            }
+            return (
+              (e = t.converter._dispatch("lists.before", e, r, t)),
+              (e += "¨0"),
+              (e = t.gListLevel
+                ? e.replace(
+                    /^(( {0,3}([*+-]|\d+[.])[ \t]+)[^\r]+?(¨0|\n{2,}(?=\S)(?![ \t]*(?:[*+-]|\d+[.])[ \t]+)))/gm,
+                    function (e, r, t) {
+                      return o(r, t.search(/[*+-]/g) > -1 ? "ul" : "ol", !0);
+                    }
+                  )
+                : e.replace(
+                    /(\n\n|^\n?)(( {0,3}([*+-]|\d+[.])[ \t]+)[^\r]+?(¨0|\n{2,}(?=\S)(?![ \t]*(?:[*+-]|\d+[.])[ \t]+)))/gm,
+                    function (e, r, t, a) {
+                      return o(t, a.search(/[*+-]/g) > -1 ? "ul" : "ol", !1);
+                    }
+                  )),
+              (e = e.replace(/¨0/, "")),
+              (e = t.converter._dispatch("lists.after", e, r, t))
+            );
+          }),
+          a.subParser("metadata", function (e, r, t) {
+            "use strict";
+            function a(e) {
+              (t.metadata.raw = e),
+                (e = (e = e.replace(/&/g, "&amp;").replace(/"/g, "&quot;")).replace(/\n {4}/g, " ")).replace(
+                  /^([\S ]+): +([\s\S]+?)$/gm,
+                  function (e, r, a) {
+                    return (t.metadata.parsed[r] = a), "";
+                  }
+                );
+            }
+            return r.metadata
+              ? ((e = t.converter._dispatch("metadata.before", e, r, t)),
+                (e = e.replace(/^\s*«««+(\S*?)\n([\s\S]+?)\n»»»+\n/, function (e, r, t) {
+                  return a(t), "¨M";
+                })),
+                (e = e.replace(/^\s*---+(\S*?)\n([\s\S]+?)\n---+\n/, function (e, r, n) {
+                  return r && (t.metadata.format = r), a(n), "¨M";
+                })),
+                (e = e.replace(/¨M/g, "")),
+                (e = t.converter._dispatch("metadata.after", e, r, t)))
+              : e;
+          }),
+          a.subParser("outdent", function (e, r, t) {
+            "use strict";
+            return (
+              (e = t.converter._dispatch("outdent.before", e, r, t)),
+              (e = e.replace(/^(\t|[ ]{1,4})/gm, "¨0")),
+              (e = e.replace(/¨0/g, "")),
+              (e = t.converter._dispatch("outdent.after", e, r, t))
+            );
+          }),
+          a.subParser("paragraphs", function (e, r, t) {
+            "use strict";
+            for (
+              var n = (e = (e = (e = t.converter._dispatch("paragraphs.before", e, r, t)).replace(/^\n+/g, "")).replace(
+                  /\n+$/g,
+                  ""
+                )).split(/\n{2,}/g),
+                s = [],
+                o = n.length,
+                i = 0;
+              i < o;
+              i++
+            ) {
+              var l = n[i];
+              l.search(/¨(K|G)(\d+)\1/g) >= 0
+                ? s.push(l)
+                : l.search(/\S/) >= 0 &&
+                  ((l = (l = a.subParser("spanGamut")(l, r, t)).replace(/^([ \t]*)/g, "<p>")),
+                  (l += "</p>"),
+                  s.push(l));
+            }
+            for (o = s.length, i = 0; i < o; i++) {
+              for (var c = "", u = s[i], d = !1; /¨(K|G)(\d+)\1/.test(u); ) {
+                var p = RegExp.$1,
+                  h = RegExp.$2;
+                (c = (c =
+                  "K" === p
+                    ? t.gHtmlBlocks[h]
+                    : d
+                      ? a.subParser("encodeCode")(t.ghCodeBlocks[h].text, r, t)
+                      : t.ghCodeBlocks[h].codeblock).replace(/\$/g, "$$")),
+                  (u = u.replace(/(\n\n)?¨(K|G)\d+\2(\n\n)?/, c)),
+                  /^<pre\b[^>]*>\s*<code\b[^>]*>/.test(u) && (d = !0);
+              }
+              s[i] = u;
+            }
+            return (
+              (e = s.join("\n")),
+              (e = e.replace(/^\n+/g, "")),
+              (e = e.replace(/\n+$/g, "")),
+              t.converter._dispatch("paragraphs.after", e, r, t)
+            );
+          }),
+          a.subParser("runExtension", function (e, r, t, a) {
+            "use strict";
+            if (e.filter) r = e.filter(r, a.converter, t);
+            else if (e.regex) {
+              var n = e.regex;
+              n instanceof RegExp || (n = new RegExp(n, "g")), (r = r.replace(n, e.replace));
+            }
+            return r;
+          }),
+          a.subParser("spanGamut", function (e, r, t) {
+            "use strict";
+            return (
+              (e = t.converter._dispatch("spanGamut.before", e, r, t)),
+              (e = a.subParser("codeSpans")(e, r, t)),
+              (e = a.subParser("escapeSpecialCharsWithinTagAttributes")(e, r, t)),
+              (e = a.subParser("encodeBackslashEscapes")(e, r, t)),
+              (e = a.subParser("images")(e, r, t)),
+              (e = a.subParser("anchors")(e, r, t)),
+              (e = a.subParser("autoLinks")(e, r, t)),
+              (e = a.subParser("simplifiedAutoLinks")(e, r, t)),
+              (e = a.subParser("emoji")(e, r, t)),
+              (e = a.subParser("underline")(e, r, t)),
+              (e = a.subParser("italicsAndBold")(e, r, t)),
+              (e = a.subParser("strikethrough")(e, r, t)),
+              (e = a.subParser("ellipsis")(e, r, t)),
+              (e = a.subParser("hashHTMLSpans")(e, r, t)),
+              (e = a.subParser("encodeAmpsAndAngles")(e, r, t)),
+              r.simpleLineBreaks
+                ? /\n\n¨K/.test(e) || (e = e.replace(/\n+/g, "<br />\n"))
+                : (e = e.replace(/  +\n/g, "<br />\n")),
+              (e = t.converter._dispatch("spanGamut.after", e, r, t))
+            );
+          }),
+          a.subParser("strikethrough", function (e, r, t) {
+            "use strict";
+            return (
+              r.strikethrough &&
+                ((e = (e = t.converter._dispatch("strikethrough.before", e, r, t)).replace(
+                  /(?:~){2}([\s\S]+?)(?:~){2}/g,
+                  function (e, n) {
+                    return (function (e) {
+                      return (
+                        r.simplifiedAutoLink && (e = a.subParser("simplifiedAutoLinks")(e, r, t)),
+                        "<del>" + e + "</del>"
+                      );
+                    })(n);
+                  }
+                )),
+                (e = t.converter._dispatch("strikethrough.after", e, r, t))),
+              e
+            );
+          }),
+          a.subParser("stripLinkDefinitions", function (e, r, t) {
+            "use strict";
+            var n = function (e, n, s, o, i, l, c) {
+              return (
+                (n = n.toLowerCase()),
+                s.match(/^data:.+?\/.+?;base64,/)
+                  ? (t.gUrls[n] = s.replace(/\s/g, ""))
+                  : (t.gUrls[n] = a.subParser("encodeAmpsAndAngles")(s, r, t)),
+                l
+                  ? l + c
+                  : (c && (t.gTitles[n] = c.replace(/"|'/g, "&quot;")),
+                    r.parseImgDimensions && o && i && (t.gDimensions[n] = { width: o, height: i }),
+                    "")
+              );
+            };
+            return (
+              (e = (e += "¨0").replace(
+                /^ {0,3}\[(.+)]:[ \t]*\n?[ \t]*<?(data:.+?\/.+?;base64,[A-Za-z0-9+/=\n]+?)>?(?: =([*\d]+[A-Za-z%]{0,4})x([*\d]+[A-Za-z%]{0,4}))?[ \t]*\n?[ \t]*(?:(\n*)["|'(](.+?)["|')][ \t]*)?(?:\n\n|(?=¨0)|(?=\n\[))/gm,
+                n
+              )),
+              (e = e.replace(
+                /^ {0,3}\[(.+)]:[ \t]*\n?[ \t]*<?([^>\s]+)>?(?: =([*\d]+[A-Za-z%]{0,4})x([*\d]+[A-Za-z%]{0,4}))?[ \t]*\n?[ \t]*(?:(\n*)["|'(](.+?)["|')][ \t]*)?(?:\n+|(?=¨0))/gm,
+                n
+              )),
+              (e = e.replace(/¨0/, ""))
+            );
+          }),
+          a.subParser("tables", function (e, r, t) {
+            "use strict";
+            function n(e) {
+              return /^:[ \t]*--*$/.test(e)
+                ? ' style="text-align:left;"'
+                : /^--*[ \t]*:[ \t]*$/.test(e)
+                  ? ' style="text-align:right;"'
+                  : /^:[ \t]*--*[ \t]*:$/.test(e)
+                    ? ' style="text-align:center;"'
+                    : "";
+            }
+            function s(e, n) {
+              var s = "";
+              return (
+                (e = e.trim()),
+                (r.tablesHeaderId || r.tableHeaderId) && (s = ' id="' + e.replace(/ /g, "_").toLowerCase() + '"'),
+                (e = a.subParser("spanGamut")(e, r, t)),
+                "<th" + s + n + ">" + e + "</th>\n"
+              );
+            }
+            function o(e, n) {
+              return "<td" + n + ">" + a.subParser("spanGamut")(e, r, t) + "</td>\n";
+            }
+            function i(e) {
+              var i,
+                l = e.split("\n");
+              for (i = 0; i < l.length; ++i)
+                /^ {0,3}\|/.test(l[i]) && (l[i] = l[i].replace(/^ {0,3}\|/, "")),
+                  /\|[ \t]*$/.test(l[i]) && (l[i] = l[i].replace(/\|[ \t]*$/, "")),
+                  (l[i] = a.subParser("codeSpans")(l[i], r, t));
+              var c = l[0].split("|").map(function (e) {
+                  return e.trim();
+                }),
+                u = l[1].split("|").map(function (e) {
+                  return e.trim();
+                }),
+                d = [],
+                p = [],
+                h = [],
+                _ = [];
+              for (l.shift(), l.shift(), i = 0; i < l.length; ++i)
+                "" !== l[i].trim() &&
+                  d.push(
+                    l[i].split("|").map(function (e) {
+                      return e.trim();
+                    })
+                  );
+              if (c.length < u.length) return e;
+              for (i = 0; i < u.length; ++i) h.push(n(u[i]));
+              for (i = 0; i < c.length; ++i) a.helper.isUndefined(h[i]) && (h[i] = ""), p.push(s(c[i], h[i]));
+              for (i = 0; i < d.length; ++i) {
+                for (var g = [], m = 0; m < p.length; ++m) a.helper.isUndefined(d[i][m]), g.push(o(d[i][m], h[m]));
+                _.push(g);
+              }
+              return (function (e, r) {
+                for (var t = "<table>\n<thead>\n<tr>\n", a = e.length, n = 0; n < a; ++n) t += e[n];
+                for (t += "</tr>\n</thead>\n<tbody>\n", n = 0; n < r.length; ++n) {
+                  t += "<tr>\n";
+                  for (var s = 0; s < a; ++s) t += r[n][s];
+                  t += "</tr>\n";
+                }
+                return (t += "</tbody>\n</table>\n");
+              })(p, _);
+            }
+            if (!r.tables) return e;
+            return (
+              (e = t.converter._dispatch("tables.before", e, r, t)),
+              (e = e.replace(/\\(\|)/g, a.helper.escapeCharactersCallback)),
+              (e = e.replace(
+                /^ {0,3}\|?.+\|.+\n {0,3}\|?[ \t]*:?[ \t]*(?:[-=]){2,}[ \t]*:?[ \t]*\|[ \t]*:?[ \t]*(?:[-=]){2,}[\s\S]+?(?:\n\n|¨0)/gm,
+                i
+              )),
+              (e = e.replace(
+                /^ {0,3}\|.+\|[ \t]*\n {0,3}\|[ \t]*:?[ \t]*(?:[-=]){2,}[ \t]*:?[ \t]*\|[ \t]*\n( {0,3}\|.+\|[ \t]*\n)*(?:\n|¨0)/gm,
+                i
+              )),
+              (e = t.converter._dispatch("tables.after", e, r, t))
+            );
+          }),
+          a.subParser("underline", function (e, r, t) {
+            "use strict";
+            return r.underline
+              ? ((e = t.converter._dispatch("underline.before", e, r, t)),
+                (e = r.literalMidWordUnderscores
+                  ? (e = e.replace(/\b___(\S[\s\S]*?)___\b/g, function (e, r) {
+                      return "<u>" + r + "</u>";
+                    })).replace(/\b__(\S[\s\S]*?)__\b/g, function (e, r) {
+                      return "<u>" + r + "</u>";
+                    })
+                  : (e = e.replace(/___(\S[\s\S]*?)___/g, function (e, r) {
+                      return /\S$/.test(r) ? "<u>" + r + "</u>" : e;
+                    })).replace(/__(\S[\s\S]*?)__/g, function (e, r) {
+                      return /\S$/.test(r) ? "<u>" + r + "</u>" : e;
+                    })),
+                (e = e.replace(/(_)/g, a.helper.escapeCharactersCallback)),
+                (e = t.converter._dispatch("underline.after", e, r, t)))
+              : e;
+          }),
+          a.subParser("unescapeSpecialChars", function (e, r, t) {
+            "use strict";
+            return (
+              (e = t.converter._dispatch("unescapeSpecialChars.before", e, r, t)),
+              (e = e.replace(/¨E(\d+)E/g, function (e, r) {
+                var t = parseInt(r);
+                return String.fromCharCode(t);
+              })),
+              (e = t.converter._dispatch("unescapeSpecialChars.after", e, r, t))
+            );
+          }),
+          a.subParser("makeMarkdown.blockquote", function (e, r) {
+            "use strict";
+            var t = "";
+            if (e.hasChildNodes())
+              for (var n = e.childNodes, s = n.length, o = 0; o < s; ++o) {
+                var i = a.subParser("makeMarkdown.node")(n[o], r);
+                "" !== i && (t += i);
+              }
+            return (t = t.trim()), (t = "> " + t.split("\n").join("\n> "));
+          }),
+          a.subParser("makeMarkdown.codeBlock", function (e, r) {
+            "use strict";
+            var t = e.getAttribute("language"),
+              a = e.getAttribute("precodenum");
+            return "```" + t + "\n" + r.preList[a] + "\n```";
+          }),
+          a.subParser("makeMarkdown.codeSpan", function (e) {
+            "use strict";
+            return "`" + e.innerHTML + "`";
+          }),
+          a.subParser("makeMarkdown.emphasis", function (e, r) {
+            "use strict";
+            var t = "";
+            if (e.hasChildNodes()) {
+              t += "*";
+              for (var n = e.childNodes, s = n.length, o = 0; o < s; ++o)
+                t += a.subParser("makeMarkdown.node")(n[o], r);
+              t += "*";
+            }
+            return t;
+          }),
+          a.subParser("makeMarkdown.header", function (e, r, t) {
+            "use strict";
+            var n = new Array(t + 1).join("#"),
+              s = "";
+            if (e.hasChildNodes()) {
+              s = n + " ";
+              for (var o = e.childNodes, i = o.length, l = 0; l < i; ++l)
+                s += a.subParser("makeMarkdown.node")(o[l], r);
+            }
+            return s;
+          }),
+          a.subParser("makeMarkdown.hr", function () {
+            "use strict";
+            return "---";
+          }),
+          a.subParser("makeMarkdown.image", function (e) {
+            "use strict";
+            var r = "";
+            return (
+              e.hasAttribute("src") &&
+                ((r += "![" + e.getAttribute("alt") + "]("),
+                (r += "<" + e.getAttribute("src") + ">"),
+                e.hasAttribute("width") &&
+                  e.hasAttribute("height") &&
+                  (r += " =" + e.getAttribute("width") + "x" + e.getAttribute("height")),
+                e.hasAttribute("title") && (r += ' "' + e.getAttribute("title") + '"'),
+                (r += ")")),
+              r
+            );
+          }),
+          a.subParser("makeMarkdown.links", function (e, r) {
+            "use strict";
+            var t = "";
+            if (e.hasChildNodes() && e.hasAttribute("href")) {
+              var n = e.childNodes,
+                s = n.length;
+              t = "[";
+              for (var o = 0; o < s; ++o) t += a.subParser("makeMarkdown.node")(n[o], r);
+              (t += "]("),
+                (t += "<" + e.getAttribute("href") + ">"),
+                e.hasAttribute("title") && (t += ' "' + e.getAttribute("title") + '"'),
+                (t += ")");
+            }
+            return t;
+          }),
+          a.subParser("makeMarkdown.list", function (e, r, t) {
+            "use strict";
+            var n = "";
+            if (!e.hasChildNodes()) return "";
+            for (var s = e.childNodes, o = s.length, i = e.getAttribute("start") || 1, l = 0; l < o; ++l)
+              if (void 0 !== s[l].tagName && "li" === s[l].tagName.toLowerCase()) {
+                (n += ("ol" === t ? i.toString() + ". " : "- ") + a.subParser("makeMarkdown.listItem")(s[l], r)), ++i;
+              }
+            return (n += "\n\x3c!-- --\x3e\n").trim();
+          }),
+          a.subParser("makeMarkdown.listItem", function (e, r) {
+            "use strict";
+            for (var t = "", n = e.childNodes, s = n.length, o = 0; o < s; ++o)
+              t += a.subParser("makeMarkdown.node")(n[o], r);
+            return (
+              /\n$/.test(t)
+                ? (t = t
+                    .split("\n")
+                    .join("\n    ")
+                    .replace(/^ {4}$/gm, "")
+                    .replace(/\n\n+/g, "\n\n"))
+                : (t += "\n"),
+              t
+            );
+          }),
+          a.subParser("makeMarkdown.node", function (e, r, t) {
+            "use strict";
+            t = t || !1;
+            var n = "";
+            if (3 === e.nodeType) return a.subParser("makeMarkdown.txt")(e, r);
+            if (8 === e.nodeType) return "\x3c!--" + e.data + "--\x3e\n\n";
+            if (1 !== e.nodeType) return "";
+            switch (e.tagName.toLowerCase()) {
+              case "h1":
+                t || (n = a.subParser("makeMarkdown.header")(e, r, 1) + "\n\n");
+                break;
+              case "h2":
+                t || (n = a.subParser("makeMarkdown.header")(e, r, 2) + "\n\n");
+                break;
+              case "h3":
+                t || (n = a.subParser("makeMarkdown.header")(e, r, 3) + "\n\n");
+                break;
+              case "h4":
+                t || (n = a.subParser("makeMarkdown.header")(e, r, 4) + "\n\n");
+                break;
+              case "h5":
+                t || (n = a.subParser("makeMarkdown.header")(e, r, 5) + "\n\n");
+                break;
+              case "h6":
+                t || (n = a.subParser("makeMarkdown.header")(e, r, 6) + "\n\n");
+                break;
+              case "p":
+                t || (n = a.subParser("makeMarkdown.paragraph")(e, r) + "\n\n");
+                break;
+              case "blockquote":
+                t || (n = a.subParser("makeMarkdown.blockquote")(e, r) + "\n\n");
+                break;
+              case "hr":
+                t || (n = a.subParser("makeMarkdown.hr")(e, r) + "\n\n");
+                break;
+              case "ol":
+                t || (n = a.subParser("makeMarkdown.list")(e, r, "ol") + "\n\n");
+                break;
+              case "ul":
+                t || (n = a.subParser("makeMarkdown.list")(e, r, "ul") + "\n\n");
+                break;
+              case "precode":
+                t || (n = a.subParser("makeMarkdown.codeBlock")(e, r) + "\n\n");
+                break;
+              case "pre":
+                t || (n = a.subParser("makeMarkdown.pre")(e, r) + "\n\n");
+                break;
+              case "table":
+                t || (n = a.subParser("makeMarkdown.table")(e, r) + "\n\n");
+                break;
+              case "code":
+                n = a.subParser("makeMarkdown.codeSpan")(e, r);
+                break;
+              case "em":
+              case "i":
+                n = a.subParser("makeMarkdown.emphasis")(e, r);
+                break;
+              case "strong":
+              case "b":
+                n = a.subParser("makeMarkdown.strong")(e, r);
+                break;
+              case "del":
+                n = a.subParser("makeMarkdown.strikethrough")(e, r);
+                break;
+              case "a":
+                n = a.subParser("makeMarkdown.links")(e, r);
+                break;
+              case "img":
+                n = a.subParser("makeMarkdown.image")(e, r);
+                break;
+              default:
+                n = e.outerHTML + "\n\n";
+            }
+            return n;
+          }),
+          a.subParser("makeMarkdown.paragraph", function (e, r) {
+            "use strict";
+            var t = "";
+            if (e.hasChildNodes())
+              for (var n = e.childNodes, s = n.length, o = 0; o < s; ++o)
+                t += a.subParser("makeMarkdown.node")(n[o], r);
+            return (t = t.trim());
+          }),
+          a.subParser("makeMarkdown.pre", function (e, r) {
+            "use strict";
+            var t = e.getAttribute("prenum");
+            return "<pre>" + r.preList[t] + "</pre>";
+          }),
+          a.subParser("makeMarkdown.strikethrough", function (e, r) {
+            "use strict";
+            var t = "";
+            if (e.hasChildNodes()) {
+              t += "~~";
+              for (var n = e.childNodes, s = n.length, o = 0; o < s; ++o)
+                t += a.subParser("makeMarkdown.node")(n[o], r);
+              t += "~~";
+            }
+            return t;
+          }),
+          a.subParser("makeMarkdown.strong", function (e, r) {
+            "use strict";
+            var t = "";
+            if (e.hasChildNodes()) {
+              t += "**";
+              for (var n = e.childNodes, s = n.length, o = 0; o < s; ++o)
+                t += a.subParser("makeMarkdown.node")(n[o], r);
+              t += "**";
+            }
+            return t;
+          }),
+          a.subParser("makeMarkdown.table", function (e, r) {
+            "use strict";
+            var t,
+              n,
+              s = "",
+              o = [[], []],
+              i = e.querySelectorAll("thead>tr>th"),
+              l = e.querySelectorAll("tbody>tr");
+            for (t = 0; t < i.length; ++t) {
+              var c = a.subParser("makeMarkdown.tableCell")(i[t], r),
+                u = "---";
+              if (i[t].hasAttribute("style")) {
+                switch (i[t].getAttribute("style").toLowerCase().replace(/\s/g, "")) {
+                  case "text-align:left;":
+                    u = ":---";
+                    break;
+                  case "text-align:right;":
+                    u = "---:";
+                    break;
+                  case "text-align:center;":
+                    u = ":---:";
+                }
+              }
+              (o[0][t] = c.trim()), (o[1][t] = u);
+            }
+            for (t = 0; t < l.length; ++t) {
+              var d = o.push([]) - 1,
+                p = l[t].getElementsByTagName("td");
+              for (n = 0; n < i.length; ++n) {
+                var h = " ";
+                void 0 !== p[n] && (h = a.subParser("makeMarkdown.tableCell")(p[n], r)), o[d].push(h);
+              }
+            }
+            var _ = 3;
+            for (t = 0; t < o.length; ++t)
+              for (n = 0; n < o[t].length; ++n) {
+                var g = o[t][n].length;
+                g > _ && (_ = g);
+              }
+            for (t = 0; t < o.length; ++t) {
+              for (n = 0; n < o[t].length; ++n)
+                1 === t
+                  ? ":" === o[t][n].slice(-1)
+                    ? (o[t][n] = a.helper.padEnd(o[t][n].slice(-1), _ - 1, "-") + ":")
+                    : (o[t][n] = a.helper.padEnd(o[t][n], _, "-"))
+                  : (o[t][n] = a.helper.padEnd(o[t][n], _));
+              s += "| " + o[t].join(" | ") + " |\n";
+            }
+            return s.trim();
+          }),
+          a.subParser("makeMarkdown.tableCell", function (e, r) {
+            "use strict";
+            var t = "";
+            if (!e.hasChildNodes()) return "";
+            for (var n = e.childNodes, s = n.length, o = 0; o < s; ++o)
+              t += a.subParser("makeMarkdown.node")(n[o], r, !0);
+            return t.trim();
+          }),
+          a.subParser("makeMarkdown.txt", function (e) {
+            "use strict";
+            var r = e.nodeValue;
+            return (
+              (r = r.replace(/ +/g, " ")),
+              (r = r.replace(/¨NBSP;/g, " ")),
+              (r = a.helper.unescapeHTMLEntities(r)),
+              (r = r.replace(/([*_~|`])/g, "\\$1")),
+              (r = r.replace(/^(\s*)>/g, "\\$1>")),
+              (r = r.replace(/^#/gm, "\\#")),
+              (r = r.replace(/^(\s*)([-=]{3,})(\s*)$/, "$1\\$2$3")),
+              (r = r.replace(/^( {0,3}\d+)\./gm, "$1\\.")),
+              (r = r.replace(/^( {0,3})([+-])/gm, "$1\\$2")),
+              (r = r.replace(/]([\s]*)\(/g, "\\]$1\\(")),
+              (r = r.replace(/^ {0,3}\[([\S \t]*?)]:/gm, "\\[$1]:"))
+            );
+          });
+        "function" == typeof define && define.amd
+          ? define(function () {
+              "use strict";
+              return a;
+            })
+          : "undefined" != typeof module && module.exports
+            ? (module.exports = a)
+            : (this.showdown = a);
+      }).call(this);
+      //# sourceMappingURL=showdown.min.js.map
+    </script>
+    <script>
+      /*! showdown-table 17-06-2015 */
+
+      !(function () {
+        "use strict";
+        var a = function (a) {
+          var b,
+            c = {},
+            d = "text-align:left;";
+          return (
+            (c.th = function (a) {
+              if ("" === a.trim()) return "";
+              var b = a.trim().replace(/ /g, "_").toLowerCase();
+              return '<th id="' + b + '" style="' + d + '">' + a + "</th>";
+            }),
+            (c.td = function (b) {
+              return '<td style="' + d + '">' + a.makeHtml(b) + "</td>";
+            }),
+            (c.ths = function () {
+              var a = "",
+                b = 0,
+                d = [].slice.apply(arguments);
+              for (b; b < d.length; b += 1) a += c.th(d[b]) + "\n";
+              return a;
+            }),
+            (c.tds = function () {
+              var a = "",
+                b = 0,
+                d = [].slice.apply(arguments);
+              for (b; b < d.length; b += 1) a += c.td(d[b]) + "\n";
+              return a;
+            }),
+            (c.thead = function () {
+              var a,
+                b = [].slice.apply(arguments);
+              return (
+                (a = "<thead>\n"), (a += "<tr>\n"), (a += c.ths.apply(this, b)), (a += "</tr>\n"), (a += "</thead>\n")
+              );
+            }),
+            (c.tr = function () {
+              var a,
+                b = [].slice.apply(arguments);
+              return (a = "<tr>\n"), (a += c.tds.apply(this, b)), (a += "</tr>\n");
+            }),
+            (b = function (a) {
+              var b,
+                d,
+                e = 0,
+                f = a.split("\n"),
+                g = [];
+              for (e; e < f.length; e += 1) {
+                if (((b = f[e]), b.trim().match(/^[|].*[|]$/))) {
+                  b = b.trim();
+                  var h = [];
+                  if (
+                    (h.push("<table>"),
+                    (d = b.substring(1, b.length - 1).split("|")),
+                    h.push(c.thead.apply(this, d)),
+                    (b = f[++e]),
+                    b.trim().match(/^[|][-=|: ]+[|]$/))
+                  ) {
+                    for (b = f[++e], h.push("<tbody>"); b.trim().match(/^[|].*[|]$/); )
+                      (b = b.trim()), h.push(c.tr.apply(this, b.substring(1, b.length - 1).split("|"))), (b = f[++e]);
+                    h.push("</tbody>"), h.push("</table>"), g.push(h.join("\n"));
+                    continue;
+                  }
+                  b = f[--e];
+                }
+                g.push(b);
+              }
+              return g.join("\n");
+            }),
+            [{ type: "lang", filter: b }]
+          );
+        };
+        "undefined" != typeof window &&
+          window.showdown &&
+          window.showdown.extensions &&
+          (window.showdown.extensions.table = a),
+          "undefined" != typeof module && (module.exports = a);
+      })();
+      //# sourceMappingURL=showdown-table.min.js.map
+    </script>
+    <script>
+      /*
+Viz.js 1.8.2 (Graphviz 2.40.1, Expat 2.2.5, Emscripten 1.37.33)
+Copyright (c) 2014-2018 Michael Daines
+Licensed under MIT license
+
+This distribution contains other software in object code form:
+
+Graphviz
+Licensed under Eclipse Public License - v 1.0
+http://www.graphviz.org
+
+Expat
+Copyright (c) 1998, 1999, 2000 Thai Open Source Software Center Ltd and Clark Cooper
+Copyright (c) 2001, 2002, 2003, 2004, 2005, 2006 Expat maintainers.
+Licensed under MIT license
+http://www.libexpat.org
+
+zlib
+Copyright (C) 1995-2013 Jean-loup Gailly and Mark Adler
+http://www.zlib.net/zlib_license.html
+*/
+      (function (global) {
+        var Module = function (Module) {
+          Module = Module || {};
+          var Module = typeof Module !== "undefined" ? Module : {};
+          var moduleOverrides = {};
+          var key;
+          for (key in Module) {
+            if (Module.hasOwnProperty(key)) {
+              moduleOverrides[key] = Module[key];
+            }
+          }
+          Module["arguments"] = [];
+          Module["thisProgram"] = "./this.program";
+          Module["quit"] = function (status, toThrow) {
+            throw toThrow;
+          };
+          Module["preRun"] = [];
+          Module["postRun"] = [];
+          var ENVIRONMENT_IS_WEB = false;
+          var ENVIRONMENT_IS_WORKER = false;
+          var ENVIRONMENT_IS_NODE = false;
+          var ENVIRONMENT_IS_SHELL = false;
+          if (Module["ENVIRONMENT"]) {
+            if (Module["ENVIRONMENT"] === "WEB") {
+              ENVIRONMENT_IS_WEB = true;
+            } else if (Module["ENVIRONMENT"] === "WORKER") {
+              ENVIRONMENT_IS_WORKER = true;
+            } else if (Module["ENVIRONMENT"] === "NODE") {
+              ENVIRONMENT_IS_NODE = true;
+            } else if (Module["ENVIRONMENT"] === "SHELL") {
+              ENVIRONMENT_IS_SHELL = true;
+            } else {
+              throw new Error("Module['ENVIRONMENT'] value is not valid. must be one of: WEB|WORKER|NODE|SHELL.");
+            }
+          } else {
+            ENVIRONMENT_IS_WEB = typeof window === "object";
+            ENVIRONMENT_IS_WORKER = typeof importScripts === "function";
+            ENVIRONMENT_IS_NODE =
+              typeof process === "object" &&
+              typeof require === "function" &&
+              !ENVIRONMENT_IS_WEB &&
+              !ENVIRONMENT_IS_WORKER;
+            ENVIRONMENT_IS_SHELL = !ENVIRONMENT_IS_WEB && !ENVIRONMENT_IS_NODE && !ENVIRONMENT_IS_WORKER;
+          }
+          if (ENVIRONMENT_IS_NODE) {
+            var nodeFS;
+            var nodePath;
+            Module["read"] = function shell_read(filename, binary) {
+              var ret;
+              ret = tryParseAsDataURI(filename);
+              if (!ret) {
+                if (!nodeFS) nodeFS = require("fs");
+                if (!nodePath) nodePath = require("path");
+                filename = nodePath["normalize"](filename);
+                ret = nodeFS["readFileSync"](filename);
+              }
+              return binary ? ret : ret.toString();
+            };
+            Module["readBinary"] = function readBinary(filename) {
+              var ret = Module["read"](filename, true);
+              if (!ret.buffer) {
+                ret = new Uint8Array(ret);
+              }
+              assert(ret.buffer);
+              return ret;
+            };
+            if (process["argv"].length > 1) {
+              Module["thisProgram"] = process["argv"][1].replace(/\\/g, "/");
+            }
+            Module["arguments"] = process["argv"].slice(2);
+            if (typeof module !== "undefined") {
+              module["exports"] = Module;
+            }
+            process["on"]("uncaughtException", function (ex) {
+              if (!(ex instanceof ExitStatus)) {
+                throw ex;
+              }
+            });
+            process["on"]("unhandledRejection", function (reason, p) {
+              process["exit"](1);
+            });
+            Module["inspect"] = function () {
+              return "[Emscripten Module object]";
+            };
+          } else if (ENVIRONMENT_IS_SHELL) {
+            if (typeof read != "undefined") {
+              Module["read"] = function shell_read(f) {
+                var data = tryParseAsDataURI(f);
+                if (data) {
+                  return intArrayToString(data);
+                }
+                return read(f);
+              };
+            }
+            Module["readBinary"] = function readBinary(f) {
+              var data;
+              data = tryParseAsDataURI(f);
+              if (data) {
+                return data;
+              }
+              if (typeof readbuffer === "function") {
+                return new Uint8Array(readbuffer(f));
+              }
+              data = read(f, "binary");
+              assert(typeof data === "object");
+              return data;
+            };
+            if (typeof scriptArgs != "undefined") {
+              Module["arguments"] = scriptArgs;
+            } else if (typeof arguments != "undefined") {
+              Module["arguments"] = arguments;
+            }
+            if (typeof quit === "function") {
+              Module["quit"] = function (status, toThrow) {
+                quit(status);
+              };
+            }
+          } else if (ENVIRONMENT_IS_WEB || ENVIRONMENT_IS_WORKER) {
+            Module["read"] = function shell_read(url) {
+              try {
+                var xhr = new XMLHttpRequest();
+                xhr.open("GET", url, false);
+                xhr.send(null);
+                return xhr.responseText;
+              } catch (err) {
+                var data = tryParseAsDataURI(url);
+                if (data) {
+                  return intArrayToString(data);
+                }
+                throw err;
+              }
+            };
+            if (ENVIRONMENT_IS_WORKER) {
+              Module["readBinary"] = function readBinary(url) {
+                try {
+                  var xhr = new XMLHttpRequest();
+                  xhr.open("GET", url, false);
+                  xhr.responseType = "arraybuffer";
+                  xhr.send(null);
+                  return new Uint8Array(xhr.response);
+                } catch (err) {
+                  var data = tryParseAsDataURI(url);
+                  if (data) {
+                    return data;
+                  }
+                  throw err;
+                }
+              };
+            }
+            Module["readAsync"] = function readAsync(url, onload, onerror) {
+              var xhr = new XMLHttpRequest();
+              xhr.open("GET", url, true);
+              xhr.responseType = "arraybuffer";
+              xhr.onload = function xhr_onload() {
+                if (xhr.status == 200 || (xhr.status == 0 && xhr.response)) {
+                  onload(xhr.response);
+                  return;
+                }
+                var data = tryParseAsDataURI(url);
+                if (data) {
+                  onload(data.buffer);
+                  return;
+                }
+                onerror();
+              };
+              xhr.onerror = onerror;
+              xhr.send(null);
+            };
+            if (typeof arguments != "undefined") {
+              Module["arguments"] = arguments;
+            }
+            Module["setWindowTitle"] = function (title) {
+              document.title = title;
+            };
+          }
+          Module["print"] = typeof console !== "undefined" ? console.log : typeof print !== "undefined" ? print : null;
+          Module["printErr"] =
+            typeof printErr !== "undefined"
+              ? printErr
+              : (typeof console !== "undefined" && console.warn) || Module["print"];
+          Module.print = Module["print"];
+          Module.printErr = Module["printErr"];
+          for (key in moduleOverrides) {
+            if (moduleOverrides.hasOwnProperty(key)) {
+              Module[key] = moduleOverrides[key];
+            }
+          }
+          moduleOverrides = undefined;
+          var STACK_ALIGN = 16;
+          function staticAlloc(size) {
+            assert(!staticSealed);
+            var ret = STATICTOP;
+            STATICTOP = (STATICTOP + size + 15) & -16;
+            return ret;
+          }
+          function dynamicAlloc(size) {
+            assert(DYNAMICTOP_PTR);
+            var ret = HEAP32[DYNAMICTOP_PTR >> 2];
+            var end = (ret + size + 15) & -16;
+            HEAP32[DYNAMICTOP_PTR >> 2] = end;
+            if (end >= TOTAL_MEMORY) {
+              var success = enlargeMemory();
+              if (!success) {
+                HEAP32[DYNAMICTOP_PTR >> 2] = ret;
+                return 0;
+              }
+            }
+            return ret;
+          }
+          function alignMemory(size, factor) {
+            if (!factor) factor = STACK_ALIGN;
+            var ret = (size = Math.ceil(size / factor) * factor);
+            return ret;
+          }
+          function getNativeTypeSize(type) {
+            switch (type) {
+              case "i1":
+              case "i8":
+                return 1;
+              case "i16":
+                return 2;
+              case "i32":
+                return 4;
+              case "i64":
+                return 8;
+              case "float":
+                return 4;
+              case "double":
+                return 8;
+              default: {
+                if (type[type.length - 1] === "*") {
+                  return 4;
+                } else if (type[0] === "i") {
+                  var bits = parseInt(type.substr(1));
+                  assert(bits % 8 === 0);
+                  return bits / 8;
+                } else {
+                  return 0;
+                }
+              }
+            }
+          }
+          function warnOnce(text) {
+            if (!warnOnce.shown) warnOnce.shown = {};
+            if (!warnOnce.shown[text]) {
+              warnOnce.shown[text] = 1;
+              Module.printErr(text);
+            }
+          }
+          var functionPointers = new Array(0);
+          var funcWrappers = {};
+          function dynCall(sig, ptr, args) {
+            if (args && args.length) {
+              return Module["dynCall_" + sig].apply(null, [ptr].concat(args));
+            } else {
+              return Module["dynCall_" + sig].call(null, ptr);
+            }
+          }
+          var GLOBAL_BASE = 8;
+          var ABORT = 0;
+          var EXITSTATUS = 0;
+          function assert(condition, text) {
+            if (!condition) {
+              abort("Assertion failed: " + text);
+            }
+          }
+          function getCFunc(ident) {
+            var func = Module["_" + ident];
+            assert(func, "Cannot call unknown function " + ident + ", make sure it is exported");
+            return func;
+          }
+          var JSfuncs = {
+            stackSave: function () {
+              stackSave();
+            },
+            stackRestore: function () {
+              stackRestore();
+            },
+            arrayToC: function (arr) {
+              var ret = stackAlloc(arr.length);
+              writeArrayToMemory(arr, ret);
+              return ret;
+            },
+            stringToC: function (str) {
+              var ret = 0;
+              if (str !== null && str !== undefined && str !== 0) {
+                var len = (str.length << 2) + 1;
+                ret = stackAlloc(len);
+                stringToUTF8(str, ret, len);
+              }
+              return ret;
+            },
+          };
+          var toC = { string: JSfuncs["stringToC"], array: JSfuncs["arrayToC"] };
+          function ccall(ident, returnType, argTypes, args, opts) {
+            var func = getCFunc(ident);
+            var cArgs = [];
+            var stack = 0;
+            if (args) {
+              for (var i = 0; i < args.length; i++) {
+                var converter = toC[argTypes[i]];
+                if (converter) {
+                  if (stack === 0) stack = stackSave();
+                  cArgs[i] = converter(args[i]);
+                } else {
+                  cArgs[i] = args[i];
+                }
+              }
+            }
+            var ret = func.apply(null, cArgs);
+            if (returnType === "string") ret = Pointer_stringify(ret);
+            if (stack !== 0) {
+              stackRestore(stack);
+            }
+            return ret;
+          }
+          function setValue(ptr, value, type, noSafe) {
+            type = type || "i8";
+            if (type.charAt(type.length - 1) === "*") type = "i32";
+            switch (type) {
+              case "i1":
+                HEAP8[ptr >> 0] = value;
+                break;
+              case "i8":
+                HEAP8[ptr >> 0] = value;
+                break;
+              case "i16":
+                HEAP16[ptr >> 1] = value;
+                break;
+              case "i32":
+                HEAP32[ptr >> 2] = value;
+                break;
+              case "i64":
+                (tempI64 = [
+                  value >>> 0,
+                  ((tempDouble = value),
+                  +Math_abs(tempDouble) >= +1
+                    ? tempDouble > +0
+                      ? (Math_min(+Math_floor(tempDouble / +4294967296), +4294967295) | 0) >>> 0
+                      : ~~+Math_ceil((tempDouble - +(~~tempDouble >>> 0)) / +4294967296) >>> 0
+                    : 0),
+                ]),
+                  (HEAP32[ptr >> 2] = tempI64[0]),
+                  (HEAP32[(ptr + 4) >> 2] = tempI64[1]);
+                break;
+              case "float":
+                HEAPF32[ptr >> 2] = value;
+                break;
+              case "double":
+                HEAPF64[ptr >> 3] = value;
+                break;
+              default:
+                abort("invalid type for setValue: " + type);
+            }
+          }
+          var ALLOC_STATIC = 2;
+          var ALLOC_NONE = 4;
+          function allocate(slab, types, allocator, ptr) {
+            var zeroinit, size;
+            if (typeof slab === "number") {
+              zeroinit = true;
+              size = slab;
+            } else {
+              zeroinit = false;
+              size = slab.length;
+            }
+            var singleType = typeof types === "string" ? types : null;
+            var ret;
+            if (allocator == ALLOC_NONE) {
+              ret = ptr;
+            } else {
+              ret = [typeof _malloc === "function" ? _malloc : staticAlloc, stackAlloc, staticAlloc, dynamicAlloc][
+                allocator === undefined ? ALLOC_STATIC : allocator
+              ](Math.max(size, singleType ? 1 : types.length));
+            }
+            if (zeroinit) {
+              var stop;
+              ptr = ret;
+              assert((ret & 3) == 0);
+              stop = ret + (size & ~3);
+              for (; ptr < stop; ptr += 4) {
+                HEAP32[ptr >> 2] = 0;
+              }
+              stop = ret + size;
+              while (ptr < stop) {
+                HEAP8[ptr++ >> 0] = 0;
+              }
+              return ret;
+            }
+            if (singleType === "i8") {
+              if (slab.subarray || slab.slice) {
+                HEAPU8.set(slab, ret);
+              } else {
+                HEAPU8.set(new Uint8Array(slab), ret);
+              }
+              return ret;
+            }
+            var i = 0,
+              type,
+              typeSize,
+              previousType;
+            while (i < size) {
+              var curr = slab[i];
+              type = singleType || types[i];
+              if (type === 0) {
+                i++;
+                continue;
+              }
+              if (type == "i64") type = "i32";
+              setValue(ret + i, curr, type);
+              if (previousType !== type) {
+                typeSize = getNativeTypeSize(type);
+                previousType = type;
+              }
+              i += typeSize;
+            }
+            return ret;
+          }
+          function Pointer_stringify(ptr, length) {
+            if (length === 0 || !ptr) return "";
+            var hasUtf = 0;
+            var t;
+            var i = 0;
+            while (1) {
+              t = HEAPU8[(ptr + i) >> 0];
+              hasUtf |= t;
+              if (t == 0 && !length) break;
+              i++;
+              if (length && i == length) break;
+            }
+            if (!length) length = i;
+            var ret = "";
+            if (hasUtf < 128) {
+              var MAX_CHUNK = 1024;
+              var curr;
+              while (length > 0) {
+                curr = String.fromCharCode.apply(String, HEAPU8.subarray(ptr, ptr + Math.min(length, MAX_CHUNK)));
+                ret = ret ? ret + curr : curr;
+                ptr += MAX_CHUNK;
+                length -= MAX_CHUNK;
+              }
+              return ret;
+            }
+            return UTF8ToString(ptr);
+          }
+          var UTF8Decoder = typeof TextDecoder !== "undefined" ? new TextDecoder("utf8") : undefined;
+          function UTF8ArrayToString(u8Array, idx) {
+            var endPtr = idx;
+            while (u8Array[endPtr]) ++endPtr;
+            if (endPtr - idx > 16 && u8Array.subarray && UTF8Decoder) {
+              return UTF8Decoder.decode(u8Array.subarray(idx, endPtr));
+            } else {
+              var u0, u1, u2, u3, u4, u5;
+              var str = "";
+              while (1) {
+                u0 = u8Array[idx++];
+                if (!u0) return str;
+                if (!(u0 & 128)) {
+                  str += String.fromCharCode(u0);
+                  continue;
+                }
+                u1 = u8Array[idx++] & 63;
+                if ((u0 & 224) == 192) {
+                  str += String.fromCharCode(((u0 & 31) << 6) | u1);
+                  continue;
+                }
+                u2 = u8Array[idx++] & 63;
+                if ((u0 & 240) == 224) {
+                  u0 = ((u0 & 15) << 12) | (u1 << 6) | u2;
+                } else {
+                  u3 = u8Array[idx++] & 63;
+                  if ((u0 & 248) == 240) {
+                    u0 = ((u0 & 7) << 18) | (u1 << 12) | (u2 << 6) | u3;
+                  } else {
+                    u4 = u8Array[idx++] & 63;
+                    if ((u0 & 252) == 248) {
+                      u0 = ((u0 & 3) << 24) | (u1 << 18) | (u2 << 12) | (u3 << 6) | u4;
+                    } else {
+                      u5 = u8Array[idx++] & 63;
+                      u0 = ((u0 & 1) << 30) | (u1 << 24) | (u2 << 18) | (u3 << 12) | (u4 << 6) | u5;
+                    }
+                  }
+                }
+                if (u0 < 65536) {
+                  str += String.fromCharCode(u0);
+                } else {
+                  var ch = u0 - 65536;
+                  str += String.fromCharCode(55296 | (ch >> 10), 56320 | (ch & 1023));
+                }
+              }
+            }
+          }
+          function UTF8ToString(ptr) {
+            return UTF8ArrayToString(HEAPU8, ptr);
+          }
+          function stringToUTF8Array(str, outU8Array, outIdx, maxBytesToWrite) {
+            if (!(maxBytesToWrite > 0)) return 0;
+            var startIdx = outIdx;
+            var endIdx = outIdx + maxBytesToWrite - 1;
+            for (var i = 0; i < str.length; ++i) {
+              var u = str.charCodeAt(i);
+              if (u >= 55296 && u <= 57343) u = (65536 + ((u & 1023) << 10)) | (str.charCodeAt(++i) & 1023);
+              if (u <= 127) {
+                if (outIdx >= endIdx) break;
+                outU8Array[outIdx++] = u;
+              } else if (u <= 2047) {
+                if (outIdx + 1 >= endIdx) break;
+                outU8Array[outIdx++] = 192 | (u >> 6);
+                outU8Array[outIdx++] = 128 | (u & 63);
+              } else if (u <= 65535) {
+                if (outIdx + 2 >= endIdx) break;
+                outU8Array[outIdx++] = 224 | (u >> 12);
+                outU8Array[outIdx++] = 128 | ((u >> 6) & 63);
+                outU8Array[outIdx++] = 128 | (u & 63);
+              } else if (u <= 2097151) {
+                if (outIdx + 3 >= endIdx) break;
+                outU8Array[outIdx++] = 240 | (u >> 18);
+                outU8Array[outIdx++] = 128 | ((u >> 12) & 63);
+                outU8Array[outIdx++] = 128 | ((u >> 6) & 63);
+                outU8Array[outIdx++] = 128 | (u & 63);
+              } else if (u <= 67108863) {
+                if (outIdx + 4 >= endIdx) break;
+                outU8Array[outIdx++] = 248 | (u >> 24);
+                outU8Array[outIdx++] = 128 | ((u >> 18) & 63);
+                outU8Array[outIdx++] = 128 | ((u >> 12) & 63);
+                outU8Array[outIdx++] = 128 | ((u >> 6) & 63);
+                outU8Array[outIdx++] = 128 | (u & 63);
+              } else {
+                if (outIdx + 5 >= endIdx) break;
+                outU8Array[outIdx++] = 252 | (u >> 30);
+                outU8Array[outIdx++] = 128 | ((u >> 24) & 63);
+                outU8Array[outIdx++] = 128 | ((u >> 18) & 63);
+                outU8Array[outIdx++] = 128 | ((u >> 12) & 63);
+                outU8Array[outIdx++] = 128 | ((u >> 6) & 63);
+                outU8Array[outIdx++] = 128 | (u & 63);
+              }
+            }
+            outU8Array[outIdx] = 0;
+            return outIdx - startIdx;
+          }
+          function stringToUTF8(str, outPtr, maxBytesToWrite) {
+            return stringToUTF8Array(str, HEAPU8, outPtr, maxBytesToWrite);
+          }
+          function lengthBytesUTF8(str) {
+            var len = 0;
+            for (var i = 0; i < str.length; ++i) {
+              var u = str.charCodeAt(i);
+              if (u >= 55296 && u <= 57343) u = (65536 + ((u & 1023) << 10)) | (str.charCodeAt(++i) & 1023);
+              if (u <= 127) {
+                ++len;
+              } else if (u <= 2047) {
+                len += 2;
+              } else if (u <= 65535) {
+                len += 3;
+              } else if (u <= 2097151) {
+                len += 4;
+              } else if (u <= 67108863) {
+                len += 5;
+              } else {
+                len += 6;
+              }
+            }
+            return len;
+          }
+          var UTF16Decoder = typeof TextDecoder !== "undefined" ? new TextDecoder("utf-16le") : undefined;
+          function allocateUTF8(str) {
+            var size = lengthBytesUTF8(str) + 1;
+            var ret = _malloc(size);
+            if (ret) stringToUTF8Array(str, HEAP8, ret, size);
+            return ret;
+          }
+          function demangle(func) {
+            return func;
+          }
+          function demangleAll(text) {
+            var regex = /__Z[\w\d_]+/g;
+            return text.replace(regex, function (x) {
+              var y = demangle(x);
+              return x === y ? x : x + " [" + y + "]";
+            });
+          }
+          function jsStackTrace() {
+            var err = new Error();
+            if (!err.stack) {
+              try {
+                throw new Error(0);
+              } catch (e) {
+                err = e;
+              }
+              if (!err.stack) {
+                return "(no stack trace available)";
+              }
+            }
+            return err.stack.toString();
+          }
+          function stackTrace() {
+            var js = jsStackTrace();
+            if (Module["extraStackTrace"]) js += "\n" + Module["extraStackTrace"]();
+            return demangleAll(js);
+          }
+          var PAGE_SIZE = 16384;
+          var buffer, HEAP8, HEAPU8, HEAP16, HEAPU16, HEAP32, HEAPU32, HEAPF32, HEAPF64;
+          function updateGlobalBufferViews() {
+            Module["HEAP8"] = HEAP8 = new Int8Array(buffer);
+            Module["HEAP16"] = HEAP16 = new Int16Array(buffer);
+            Module["HEAP32"] = HEAP32 = new Int32Array(buffer);
+            Module["HEAPU8"] = HEAPU8 = new Uint8Array(buffer);
+            Module["HEAPU16"] = HEAPU16 = new Uint16Array(buffer);
+            Module["HEAPU32"] = HEAPU32 = new Uint32Array(buffer);
+            Module["HEAPF32"] = HEAPF32 = new Float32Array(buffer);
+            Module["HEAPF64"] = HEAPF64 = new Float64Array(buffer);
+          }
+          var STATIC_BASE, STATICTOP, staticSealed;
+          var STACK_BASE, STACKTOP, STACK_MAX;
+          var DYNAMIC_BASE, DYNAMICTOP_PTR;
+          STATIC_BASE = STATICTOP = STACK_BASE = STACKTOP = STACK_MAX = DYNAMIC_BASE = DYNAMICTOP_PTR = 0;
+          staticSealed = false;
+          function abortOnCannotGrowMemory() {
+            abort(
+              "Cannot enlarge memory arrays. Either (1) compile with  -s TOTAL_MEMORY=X  with X higher than the current value " +
+                TOTAL_MEMORY +
+                ", (2) compile with  -s ALLOW_MEMORY_GROWTH=1  which allows increasing the size at runtime but prevents some optimizations, (3) set Module.TOTAL_MEMORY to a higher value before the program runs, or (4) if you want malloc to return NULL (0) instead of this abort, compile with  -s ABORTING_MALLOC=0 "
+            );
+          }
+          function enlargeMemory() {
+            abortOnCannotGrowMemory();
+          }
+          var TOTAL_STACK = Module["TOTAL_STACK"] || 5242880;
+          var TOTAL_MEMORY = Module["TOTAL_MEMORY"] || 16777216;
+          if (TOTAL_MEMORY < TOTAL_STACK)
+            Module.printErr(
+              "TOTAL_MEMORY should be larger than TOTAL_STACK, was " +
+                TOTAL_MEMORY +
+                "! (TOTAL_STACK=" +
+                TOTAL_STACK +
+                ")"
+            );
+          if (Module["buffer"]) {
+            buffer = Module["buffer"];
+          } else {
+            {
+              buffer = new ArrayBuffer(TOTAL_MEMORY);
+            }
+            Module["buffer"] = buffer;
+          }
+          updateGlobalBufferViews();
+          function getTotalMemory() {
+            return TOTAL_MEMORY;
+          }
+          HEAP32[0] = 1668509029;
+          HEAP16[1] = 25459;
+          if (HEAPU8[2] !== 115 || HEAPU8[3] !== 99) throw "Runtime error: expected the system to be little-endian!";
+          function callRuntimeCallbacks(callbacks) {
+            while (callbacks.length > 0) {
+              var callback = callbacks.shift();
+              if (typeof callback == "function") {
+                callback();
+                continue;
+              }
+              var func = callback.func;
+              if (typeof func === "number") {
+                if (callback.arg === undefined) {
+                  Module["dynCall_v"](func);
+                } else {
+                  Module["dynCall_vi"](func, callback.arg);
+                }
+              } else {
+                func(callback.arg === undefined ? null : callback.arg);
+              }
+            }
+          }
+          var __ATPRERUN__ = [];
+          var __ATINIT__ = [];
+          var __ATMAIN__ = [];
+          var __ATEXIT__ = [];
+          var __ATPOSTRUN__ = [];
+          var runtimeInitialized = false;
+          var runtimeExited = false;
+          function preRun() {
+            if (Module["preRun"]) {
+              if (typeof Module["preRun"] == "function") Module["preRun"] = [Module["preRun"]];
+              while (Module["preRun"].length) {
+                addOnPreRun(Module["preRun"].shift());
+              }
+            }
+            callRuntimeCallbacks(__ATPRERUN__);
+          }
+          function ensureInitRuntime() {
+            if (runtimeInitialized) return;
+            runtimeInitialized = true;
+            callRuntimeCallbacks(__ATINIT__);
+          }
+          function preMain() {
+            callRuntimeCallbacks(__ATMAIN__);
+          }
+          function exitRuntime() {
+            callRuntimeCallbacks(__ATEXIT__);
+            runtimeExited = true;
+          }
+          function postRun() {
+            if (Module["postRun"]) {
+              if (typeof Module["postRun"] == "function") Module["postRun"] = [Module["postRun"]];
+              while (Module["postRun"].length) {
+                addOnPostRun(Module["postRun"].shift());
+              }
+            }
+            callRuntimeCallbacks(__ATPOSTRUN__);
+          }
+          function addOnPreRun(cb) {
+            __ATPRERUN__.unshift(cb);
+          }
+          function addOnPostRun(cb) {
+            __ATPOSTRUN__.unshift(cb);
+          }
+          function writeArrayToMemory(array, buffer) {
+            HEAP8.set(array, buffer);
+          }
+          function writeAsciiToMemory(str, buffer, dontAddNull) {
+            for (var i = 0; i < str.length; ++i) {
+              HEAP8[buffer++ >> 0] = str.charCodeAt(i);
+            }
+            if (!dontAddNull) HEAP8[buffer >> 0] = 0;
+          }
+          if (!Math["imul"] || Math["imul"](4294967295, 5) !== -5)
+            Math["imul"] = function imul(a, b) {
+              var ah = a >>> 16;
+              var al = a & 65535;
+              var bh = b >>> 16;
+              var bl = b & 65535;
+              return (al * bl + ((ah * bl + al * bh) << 16)) | 0;
+            };
+          Math.imul = Math["imul"];
+          if (!Math["clz32"])
+            Math["clz32"] = function (x) {
+              x = x >>> 0;
+              for (var i = 0; i < 32; i++) {
+                if (x & (1 << (31 - i))) return i;
+              }
+              return 32;
+            };
+          Math.clz32 = Math["clz32"];
+          if (!Math["trunc"])
+            Math["trunc"] = function (x) {
+              return x < 0 ? Math.ceil(x) : Math.floor(x);
+            };
+          Math.trunc = Math["trunc"];
+          var Math_abs = Math.abs;
+          var Math_cos = Math.cos;
+          var Math_sin = Math.sin;
+          var Math_tan = Math.tan;
+          var Math_acos = Math.acos;
+          var Math_asin = Math.asin;
+          var Math_atan = Math.atan;
+          var Math_atan2 = Math.atan2;
+          var Math_exp = Math.exp;
+          var Math_log = Math.log;
+          var Math_sqrt = Math.sqrt;
+          var Math_ceil = Math.ceil;
+          var Math_floor = Math.floor;
+          var Math_pow = Math.pow;
+          var Math_imul = Math.imul;
+          var Math_fround = Math.fround;
+          var Math_round = Math.round;
+          var Math_min = Math.min;
+          var Math_max = Math.max;
+          var Math_clz32 = Math.clz32;
+          var Math_trunc = Math.trunc;
+          var runDependencies = 0;
+          var runDependencyWatcher = null;
+          var dependenciesFulfilled = null;
+          function getUniqueRunDependency(id) {
+            return id;
+          }
+          function addRunDependency(id) {
+            runDependencies++;
+            if (Module["monitorRunDependencies"]) {
+              Module["monitorRunDependencies"](runDependencies);
+            }
+          }
+          function removeRunDependency(id) {
+            runDependencies--;
+            if (Module["monitorRunDependencies"]) {
+              Module["monitorRunDependencies"](runDependencies);
+            }
+            if (runDependencies == 0) {
+              if (runDependencyWatcher !== null) {
+                clearInterval(runDependencyWatcher);
+                runDependencyWatcher = null;
+              }
+              if (dependenciesFulfilled) {
+                var callback = dependenciesFulfilled;
+                dependenciesFulfilled = null;
+                callback();
+              }
+            }
+          }
+          Module["preloadedImages"] = {};
+          Module["preloadedAudios"] = {};
+          var memoryInitializer = null;
+          var dataURIPrefix = "data:application/octet-stream;base64,";
+          function isDataURI(filename) {
+            return String.prototype.startsWith
+              ? filename.startsWith(dataURIPrefix)
+              : filename.indexOf(dataURIPrefix) === 0;
+          }
+          var ASM_CONSTS = [
+            function ($0, $1) {
+              var path = Pointer_stringify($0);
+              var data = Pointer_stringify($1);
+              FS.createPath("/", PATH.dirname(path));
+              FS.writeFile(PATH.join("/", path), data);
+            },
+          ];
+          function _emscripten_asm_const_iii(code, a0, a1) {
+            return ASM_CONSTS[code](a0, a1);
+          }
+          STATIC_BASE = GLOBAL_BASE;
+          STATICTOP = STATIC_BASE + 197232;
+          __ATINIT__.push();
+          memoryInitializer =
+            "data:application/octet-stream;base64,AAAAAAAA8D8AAAAAAADwPwAAAAAAAPA/AAAAAAAA8D8AAAAAAADwPwAAAAAAAPA/AAAAAAAA8D8AAAAAAADwPwAAAAAAAPA/AAAAAAAA8D8AAAAAAADwPwAAAAAAAPA/ACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABQAAAAAAAAAAIMEAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABSQAAAAAAAAFJAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFJAAAAAAAAAUkAAIMEAAAAAAAAAAAAAAAAAAAAAAAAAAAAFAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABSQAAAAAAAAFJAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFJAAAAAAAAAUkACEAAAAAAAAAAAAAAAABBAoC8AAAgAAAABAAAAAAAAAAIQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAICWQAAAAAAAgJZABJDDAAAAAAAAAAAAAAAQQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAWEAAAAAAAABYQAAADAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABYQAAAAAAAAFhAAAAAAAAAAAAAAAAAAAAQQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAUkAAAAAAAABSQAAgAwIAAAAAAAAAAAAAEEAAAAAAAAAAAAAAAAAAAAAAYAAAAAAAAAAAAAAAAABCQAAAAAAAAEJAAAAAAAAgg0AAAAAAAMCIQAAAAAAAAFJAAAAAAAAAUkAAAAAAAAAAAAAAAAAAAEJAAAAAAAAAQkAAAAAAACCDQAAAAAAAwIhAAAAAAAAAUkAAAAAAAABSQACwwQAAAAAAAAAAAAAAEEBANgAAkwAAAAEAAAAAAAAAQAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFJAAAAAAAAAUkAAEAACAAAAAAAAAAAAABBAAAAAAAAAAAAFAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABYQAAAAAAAAFhAALDBAAAAAAAAAAAAAAAAABw6AAAQAAAAAQAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAWEAAAAAAAABYQEAgPgMAAAAAAAAAAAAAEEAkOwAAegAAAAEAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFJAAAAAAAAAUkAAAAAAAAAAAAAAAAAAABBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABSQAAAAAAAAFJA////////73/////////vf////////+//////////7/8AAAAAAAD4PzMzMzMzM9M/PAAAAAAAAACamZmZmZmpPwEAAAAAAAAAAQAAAAAAAAAAAAAAAADwPwEAAAAAAAAAAgAAAAAAAAAAAAAAAADwPwIAAAAAAAAAAwAAAAAAAAAAAAAAAADgPwMAAAAAAAAABAAAAAAAAAAAAAAAAADwPwQAAAAAAAAABQAAAAAAAAAzMzMzMzPzPwUAAAAAAAAABgAAAAAAAACamZmZmZnpPwYAAAAAAAAABwAAAAAAAAAAAAAAAADwPwcAAAAAAAAACAAAAAAAAAAAAAAAAADgPwgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAEAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAABAAAAAAAAAAAAAAAAAAAAMzMzMzMz078AAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAADAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAgEZAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAmpmZmZmZ2b8AAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAzMzMzMzPjPwAAAAAAAAAAAAAAAAEAAAAFAAAAAAAAAAAAAAAAAAAAexSuR+F65L8AAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAFAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAGAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAHAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAMAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAUAAAAAAAAAAAEAAAATAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABr4VQAAAQAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAIAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAMAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAADAAAAAAAAAAAAAAAAgGZAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAgGZAmpmZmZmZ2b8AAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAFAAAAAAAAAAAAAAAAgGZAexSuR+F65L8AAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAgEZAAAAAAAAAAAAAAAAAAAAAABgAAAAAAAAAAQAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAQAAAAEAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABgAAAAAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAYAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAcAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAkAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABEAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABIAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABMAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABQAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABUAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAoAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAwAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA0AAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA4AAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA8AAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABYAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABgAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABcAAAAAAAAAAAEAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABkAAAAAAAAAAAEAAAAKAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADwVQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAPC/AAAAAAAAAQAAAAAAAAAAAAAAAAAAANA/AAAAAAAA0D8AAAAAAADQPwAAAAAAANA/AAAAAAAA0D8AAAAAAADQPwAAAAAAANA/AAAAAAAA0D8AAAAAAADQPwAAAAAAANA/AAAAAAAA0D8AAAAAAADQPwAAAAAAANA/AAAAAAAA0D8AAAAAAADQPwAAAAAAANA/AAAAAAAA0D8AAAAAAADQPwAAAAAAANA/AAAAAAAA0D8AAAAAAADQPwAAAAAAANA/AAAAAAAA0D8AAAAAAADQPwAAAAAAANA/AAAAAAAA0D8AAAAAAADQPwAAAAAAANA/AAAAAAAA0D8AAAAAAADQPwAAAAAAANA/AAAAAAAA0D8AAAAAAADQP1ioNc07TtU/JXUCmggb2j8AAAAAAADgPwAAAAAAAOA/LNSa5h2n6j9q3nGKjuToP1ioNc07TtU/WKg1zTtO1T9YqDXNO07VPwAAAAAAAOA/XdxGA3gL4j8AAAAAAADQP1ioNc07TtU/AAAAAAAA0D/TvOMUHcnRPwAAAAAAAOA/AAAAAAAA4D8AAAAAAADgPwAAAAAAAOA/AAAAAAAA4D8AAAAAAADgPwAAAAAAAOA/AAAAAAAA4D8AAAAAAADgPwAAAAAAAOA/07zjFB3J0T/TvOMUHcnRP13cRgN4C+I/XdxGA3gL4j9d3EYDeAviPw1xrIvbaNw/ZF3cRgN47T/Sb18HzhnnPxB6Nqs+V+U/EHo2qz5X5T/Sb18HzhnnP3gLJCh+jOM/tRX7y+7J4T/Sb18HzhnnP9JvXwfOGec/WKg1zTtO1T+IhVrTvOPYP9JvXwfOGec/eAskKH6M4z/EQq1p3nHsP9JvXwfOGec/0m9fB84Z5z+1FfvL7snhP9JvXwfOGec/EHo2qz5X5T+1FfvL7snhP3gLJCh+jOM/0m9fB84Z5z/Sb18HzhnnP4Y41sVtNO4/0m9fB84Z5z/Sb18HzhnnP3gLJCh+jOM/WKg1zTtO1T/TvOMUHcnRP1ioNc07TtU/pgpGJXUC3j8AAAAAAADgP1ioNc07TtU/DXGsi9to3D8AAAAAAADgPw1xrIvbaNw/AAAAAAAA4D8NcayL22jcP1ioNc07TtU/AAAAAAAA4D8AAAAAAADgP9O84xQdydE/07zjFB3J0T8AAAAAAADgP9O84xQdydE/at5xio7k6D8AAAAAAADgPwAAAAAAAOA/AAAAAAAA4D8AAAAAAADgP1ioNc07TtU/iIVa07zj2D/TvOMUHcnRPwAAAAAAAOA/AAAAAAAA4D/Sb18HzhnnPwAAAAAAAOA/AAAAAAAA4D8NcayL22jcP/RsVn2utt4/ETY8vVKWyT/0bFZ9rrbePzsBTYQNT+E/AAAAAAAA0D8AAAAAAADQPwAAAAAAANA/AAAAAAAA0D8AAAAAAADQPwAAAAAAANA/AAAAAAAA0D8AAAAAAADQPwAAAAAAANA/AAAAAAAA0D8AAAAAAADQPwAAAAAAANA/AAAAAAAA0D8AAAAAAADQPwAAAAAAANA/AAAAAAAA0D8AAAAAAADQPwAAAAAAANA/AAAAAAAA0D8AAAAAAADQPwAAAAAAANA/AAAAAAAA0D8AAAAAAADQPwAAAAAAANA/AAAAAAAA0D8AAAAAAADQPwAAAAAAANA/AAAAAAAA0D8AAAAAAADQPwAAAAAAANA/AAAAAAAA0D8AAAAAAADQPwAAAAAAANA/AAAAAAAA0D9YqDXNO07VPwAAAAAAAOA/AAAAAAAA4D8+6Nms+lzFPwAAAAAAAOA/AAAAAAAA4D8AAAAAAADgPwAAAAAAAOA/gnNGlPYGxz8NcayL22jcPwAAAAAAAOA/WKg1zTtO1T9YqDXNO07VP7UV+8vuyeE/tRX7y+7J4T8AAAAAAADQPwAAAAAAAOA/AAAAAAAA4D8AAAAAAADgPwAAAAAAANA/AAAAAAAA0D8H8BZIUPzcP6K0N/jCZNY/WKg1zTtO1T8NcayL22jcPw1xrIvbaNw/AAAAAAAA4D8AAAAAAADwPwAAAAAAAPA/AAAAAAAA0D8NcayL22jcPwAAAAAAANA/WKg1zTtO1T9YqDXNO07VP1ioNc07TtU/WKg1zTtO1T9YqDXNO07VP1ioNc07TtU/WKg1zTtO1T9YqDXNO07VPwAAAAAAANA/WKg1zTtO1T9YqDXNO07VPwAAAAAAANA/WKg1zTtO1T9YqDXNO07VP1ioNc07TtU/AAAAAAAA8D8AAAAAAADQPwAAAAAAANA/AAAAAAAA0D8AAAAAAADQPwAAAAAAANA/AAAAAAAA0D8AAAAAAADQPwAAAAAAANA/AAAAAAAA0D8AAAAAAADQPwAAAAAAANA/AAAAAAAA0D8AAAAAAADQPwAAAAAAANA/AAAAAAAA0D8AAAAAAADQP8RCrWnecew/AAAAAAAA0D9/2T15WKjRPwAAAAAAANA/AAAAAAAA0D8AAAAAAADQPwAAAAAAANA/eAskKH6M4z/Sb18HzhnnP8RCrWnecew/E/JBz2bV0z8AAAAAAADQPwAAAAAAANA/AAAAAAAA0D8AAAAAAADQPwAAAAAAANA/EHo2qz5X5T8AAAAAAADQPwAAAAAAANA/AAAAAAAA0D/TvOMUHcnRPwAAAAAAANA/AAAAAAAA0D/TvOMUHcnRPwAAAAAAAOA/0m9fB84Z5z8AAAAAAADgPwAAAAAAANA/AAAAAAAA0D8AAAAAAADQPwAAAAAAANA/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z9R2ht8YTLjP1HaG3xhMuM/UdobfGEy4z/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP/RsVn2uttY/tRX7y+7J4T+1FfvL7snhP8RCrWnecew/EHo2qz5X5T/129eBc0bMP1ioNc07TtU/WKg1zTtO1T+IhVrTvOPYPwFNhA1Pr+I/07zjFB3J0T9YqDXNO07VP9O84xQdydE/07zjFB3J0T+1FfvL7snhP7UV+8vuyeE/tRX7y+7J4T+1FfvL7snhP7UV+8vuyeE/tRX7y+7J4T+1FfvL7snhP7UV+8vuyeE/tRX7y+7J4T+1FfvL7snhP9O84xQdydE/07zjFB3J0T8BTYQNT6/iPwFNhA1Pr+I/AU2EDU+v4j+1FfvL7snhP8xdS8gHPfA/EHo2qz5X5T8QejarPlflP9JvXwfOGec/0m9fB84Z5z8QejarPlflP3gLJCh+jOM/at5xio7k6D/Sb18HzhnnP9O84xQdydE/AAAAAAAA4D8QejarPlflP7UV+8vuyeE/LNSa5h2n6j/Sb18HzhnnP2recYqO5Og/EHo2qz5X5T9q3nGKjuToP9JvXwfOGec/EHo2qz5X5T94CyQofozjP9JvXwfOGec/EHo2qz5X5T+GONbFbTTuPxB6Nqs+V+U/EHo2qz5X5T94CyQofozjP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP6YKRiV1At4/tRX7y+7J4T9Iv30dOGfMP7UV+8vuyeE/tRX7y+7J4T8AAAAAAADgP7UV+8vuyeE/tRX7y+7J4T/TvOMUHcnRP7UV+8vuyeE/tRX7y+7J4T9Iv30dOGfMP0i/fR04Z8w/AAAAAAAA4D9Iv30dOGfMPyzUmuYdp+o/tRX7y+7J4T+1FfvL7snhP7UV+8vuyeE/tRX7y+7J4T9YqDXNO07VPwAAAAAAAOA/07zjFB3J0T+1FfvL7snhPwAAAAAAAOA/0m9fB84Z5z8AAAAAAADgPwAAAAAAAOA/AAAAAAAA4D8Cmggbnl7VP+C+DpwzotA/ApoIG55e1T8BTYQNT6/iP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/WKg1zTtO1T+1FfvL7snhP7UV+8vuyeE/PujZrPpcxT+1FfvL7snhP7UV+8vuyeE/tRX7y+7J4T+1FfvL7snhPx04Z0Rpb8g/WKg1zTtO1T+1FfvL7snhP1ioNc07TtU/WKg1zTtO1T8AAAAAAADgPwAAAAAAAOA/07zjFB3J0T+1FfvL7snhP7UV+8vuyeE/tRX7y+7J4T/TvOMUHcnRP9O84xQdydE/5x2n6Egu4T+itDf4wmTWP0i/fR04Z8w/WKg1zTtO1T9YqDXNO07VP7UV+8vuyeE/AAAAAAAA8D8AAAAAAADwP9O84xQdydE/eAskKH6M4z/TvOMUHcnRP1ioNc07TtU/WKg1zTtO1T9YqDXNO07VP1ioNc07TtU/WKg1zTtO1T9YqDXNO07VP1ioNc07TtU/WKg1zTtO1T/TvOMUHcnRP1ioNc07TtU/WKg1zTtO1T/TvOMUHcnRP1ioNc07TtU/WKg1zTtO1T9YqDXNO07VPwAAAAAAAPA/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/07zjFB3J0T8AAAAAAADwP9O84xQdydE/6pWyDHGs1z/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP7UV+8vuyeE/at5xio7k6D8AAAAAAADwP5jdk4eFWtc/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP8RCrWnecew/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP9O84xQdydE/SL99HThnzD94CyQofozjP4Y41sVtNO4/eAskKH6M4z/TvOMUHcnRP9O84xQdydE/07zjFB3J0T/TvOMUHcnRP1GgT+RJ0g5AtMh2vp86NcA6It+l1CXVv/OCPkeaLoo/n+V5cHfW+b9+/RAbLJzmP5bs2AjE68w/zc6idyrg0D+w479AECDtv62h1F5E29g/O6F85lGWdj/TbnD5eoR7P4HMzqJ3KuS/0a3X9KCgyD9q3zcZsD+EP77KkBle/4Q/HJYGflTDxL+lSSno9uIjQKnZA63AkME/CMSQQZNpiT/6RJ4kXTPQvwHwmTYtwl4/DZx9L8+Ulz+JtfgUAOOJP+WpWEY0y7G/jwDJz6Fnpr9ctcb7zLSIP02kj1Q6s5A/5scEoWHWoL/HaWccE/eCvyp/a+UtcFy/5FdiVAiadT/R8YdVcgS3P5XUCWgiPDPAZCMQr+t3EMCnIarwZ3jHP9r/AGvVrsE/TihEwCFU97+qSIWxhSD1P51oVyHlJ/Y/TS7GwDqOzT9Zayi1F9HcvwM/qmG/J8w/pkdTPZl/2j+2gTtQpzyuP1FM3gAz37m/9XaV/9oLpj/UpTW8D/aUPx+tILws3JA/KCzxgLLJI0AjWuFMAoq3P0ijZVGWKX8/u7SG98Gekz8XqHtTR32gvyErruBtlIs/M3PchNYetb+geISJ9fyPP2k1JO6x9JG/uM0zel6/aj+SPq2iPzTNv36w58ZPPpi/ByObUC3HpD8+GMJ7WLmRvy18fa1LjcY/AAAAQPsh+T8AAAAALUR0PgAAAICYRvg8AAAAYFHMeDsAAACAgxvwOQAAAEAgJXo4AAAAgCKC4zYAAAAAHfNpNQAAAAAAAPC/vAQBAOgqAAADAAAAEC0AAAMAAADoLwAAAwAAALAwAAADAAAAADIAAAMAAAB4NQAAAwAAALQ4AAADAAAAxC4AAAMAAAB8OQAAAwAAAIQ6AAADAAAAED8AAAMAAAA0PQAAAAAAANQsAAAAAAAAwC8AAAAAAAAQMAAAAAAAANgxAAAAAAAAKDIAAAAAAACMOAAAAAAAAGAuAAAAAAAAVDkAAAAAAABcOgAAAAAAAOg+AAAAAAAADD0AAAQAAAA4PwAAAAAAAAAAAAAAAAAAAAAAAAEAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAUAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAACAAAAAQAAAAEAAAADAAAAAAAAAAAAAAAI2QIAGNkCACjZAgA42QIASNkCAFjZAgBo2QIAeNkCABjZAgAY2QIAWNkCAFjZAgAfAAAAPwAAAH8AAAAAAAAAooUBAAEAAACoKwAAaAAAAAQAAADVCAEAAQAAACAsAACIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAcAUBAAEAAAAAAAAA4AAAAAAAAAB4BQEAAQAAAAAAAADgAAAAAQAAAH8FAQABAAAAAAAAAKgAAAACAAAAiQUBAAEAAAAAAAAA4AAAAAMAAACTBQEAAQAAAAAAAADgAAAABAAAAKEFAQABAAAAAAAAAOAAAAAFAAAAqwUBAAEAAAAAAAAA4AAAAAYAAAC4BQEAAQAAAAAAAADgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAYAAAAHAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAA/////wAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA2ggBAAEAAADELQAAGAEAAAEAAADfCAEAAQAAAMQtAAAYAQAAAgAAAOUIAQABAAAAxC0AABgBAAADAAAA7ggBAAEAAADELQAAGAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAPgIAQABAAAAAAAAAHABAAABAAAAAgkBAAEAAAAAAAAAcAEAAAIAAAANCQEAAQAAAAAAAAA4AQAAAwAAABsJAQABAAAAAAAAADgBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAkAAAAAAAAAAAAAAAoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACwAAAAwAAAANAAAADgAAAAAAAAAAAAAAAAAAAAAAAAAFAAAAAQAAAAYAAAACAAAAAgAAAAcAAAACAAAAAAAAAGIYAgBnAQIA+AICADgJAgAvEAIAbhQCAO4XAgD/FwIAAAAAAGIJAQABAAAAKC8AAKgBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABmCQEAAQAAAAAAAADIAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAbgkBAAEAAAA4MAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADwAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAKYKAQABAAAAAAAAACACAAACAAAAsAoBAAEAAAAAAAAAWAIAAAAAAAC5CgEAAQAAAAAAAABYAgAAAwAAAMIKAQABAAAAAAAAAFgCAAAAAAAAzAoBAAEAAAAAAAAAIAIAAAMAAADYCgEAAQAAAAAAAAAgAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABEAAAASAAAAAAAAAAAAAAATAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABQAAAAVAAAAFgAAABcAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAMAAAAJAAAAAwAAAAMAAAAKAAAABAAAAAAAAABiGAIAZwECADgJAgD4AgIAbhQCAC8QAgD/FwIA7hcCAAAAAAAAAAAAlQwBAP////88MQAAkAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAJgMAQD/////AAAAALACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACojQEAAQAAAFAyAADoAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAYAAAAGQAAABoAAAAAAAAABAAAAAAAAAAbAAAAHAAAAB0AAAAeAAAAAAAAAAAAAAAAAAAAAAAAAB8AAAAgAAAAIQAAACIAAAACAAAAAAAAAAAAAAAAAAAACwAAAAAAAAAMAAAABQAAAAQAAAANAAAABQAAAAMAAACVEAEAoxABALkQAQDz+QIAxxABANYQAQDbEAEA+RABAPP5AgALEQEAOxEBAPP5AgBZEQEAgREBAI8RAQC+EQEA8hEBAAMSAQAoEgEASxIBAFESAQBtEgEAihIBAKUSAQDGEgEA4BIBAAITAQAhEwEARxMBAF8TAQB/EwEAnBMBAMATAQDMEwEA8/kCANcTAQD9EwEAIRQBAEcUAQDz+QIAfRQBAJUUAQCiFAEA0RQBAMwTAQDz+QIA3hQBAOcUAQAIFQEAQxUBAI4VAQDiFQEABBYBABkWAQAwFgEARhYBAF4WAQDz+QIAdBYBAI8WAQCzFgEA1xYBAPwWAQDz+QIAHRcBADcXAQBJFwEAVhcBAGMXAQB3FwEAhhcBAI4XAQCjFwEAsRcBAO8XAQD6FwEAzBMBAPP5AgAAGAEADBgBABsYAQBLEgEA8/kCAC4YAQBXGAEAdRgBAIUYAQCWGAEAnRgBAKwYAQC8GAEAABkBAAcZAQBLEgEA8/kCABEZAQA9GQEASBkBAFEZAQBaGQEAaxkBAHwZAQCQGQEAzBMBAPP5AgCcGQEArBkBALoZAQDIGQEA1RkBAOIZAQD4GQEAARoBABAaAQAdGgEALhoBAMwTAQDz+QIAORoBAFgaAQDz+QIAahoBAHkaAQCpGgEAsxoBAMAaAQDNGgEA2hoBAOcaAQDqGgEA8/kCAO4aAQDz+QIAERsBAEIbAQBxGwEAiBsBAKMbAQC+GwEAzBMBAPP5AgDaGwEA8/kCAAIcAQAOHAEAIRwBADQcAQBJHAEAXhwBAGIcAQBLEgEA8/kCAG4cAQDz+QIAfhwBAIwcAQCYHAEApRwBAMUcAQDbHAEA8/kCAO8cAQA4HQEAfh0BAK4dAQDhHQEA6B0BAA8eAQA2HgEA8/kCADseAQAAAAAAAAAAAPBHAQABAAAAAAAAAAgDAAABAAAArx4BAAEAAAAAAAAACAMAAAIAAADpRwEAAQAAAAAAAABAAwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAjAAAAAAAAACQAAAAlAAAABgAAACYAAAAnAAAAKAAAACkAAAAqAAAAAAAAAAAAAAAAAAAAAAAAACsAAAAsAAAALQAAAC4AAAAEAAAALwAAAAAAAAAAAAAADgAAAAAAAAAPAAAABwAAAAUAAAAQAAAABgAAAAAAAAB/AAIAiQACAHkxAQDOAAIACQECACsBAgAxAQIAYhgCAFgBAgBnAQIAhAECAI8BAgCxAQIA5wECAB0CAgBYAgIAjgICALACAgC/AgIA8AICAPgCAgA/JQEASCUBABUDAgBRJQEAXwMCAFolAQBpAwIAYyUBAHMDAgDCAwIA/QMCAG8lAQA4BAIAQwQCAIgEAgCWBAIA4AQCAO4EAgD8BAIABwUCADgFAgB4BQIAgAUCAIgFAgDDBQIA+QUCAAUGAgB+MQEAEQYCABsGAgAmBgIAQwYCAHkGAgA4CQIAWgkCAGYJAgAlDAIAVgwCAIIMAgC4DAIAxQwCAOcMAgAJDQIAEg0CAFwNAgBmDQIAqw0CAOENAgDsDQIAcQ4CAIYOAgB3JQEAkA4CAJoOAgDQDgIAEA8CAB4PAgByDwIAgQ8CAJAPAgDfDwIAhjEBAB8QAgApEAIALxACAFsQAgCCEAIAkxACAJ4QAgDjEAIAKBECADcRAgBHEQIAWRECAGkRAgB5EQIAhhECAJARAgDGEQIAzxECAA8SAgAiEgIAizEBACoSAgBgEgIAhxICAL0SAgDkEgIA8hICACgTAgByEwIAvBMCAMcTAgD9EwIAAhQCAB8UAgA8FAIARxQCAG4UAgCGFAIAvBQCAPIUAgD+FAIAJRUCADAVAgBhFQIAkhUCAHg8AQC5FQIA5RUCABsWAgBRFgIAWxYCAHgWAgC4FgIA7hYCAJExAQAGFwIAMhcCAFkXAgCPFwIAzBcCAO4XAgD0FwIA/xcCACYYAgAAAAAAq40BAAEAAADINQAAeAMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAMdIAQABAAAAAAAAAJgDAAAAAAAAAAAAAAAAAAAAAAAAAAAAADAAAAAAAAAAMQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAMgAAAAAAAAAzAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAARAAAAAAAAABIAAAAIAAAABgAAABMAAAAHAAAAAAAAAAAAAACtJgEAAQAAANw4AADQAwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsCYBAAEAAAAAAAAA8AMAAAAAAAAAAAAAAAAAAAAAAAAAAAAANAAAAAAAAAA1AAAANgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABQAAADcAAAAAAAAAAAAAABQAAAAAAAAAFQAAAAkAAAAHAAAAFgAAAAgAAAAAAAAAeTEBAGIYAgBnAQIAfjEBAHkGAgA4CQIAhjEBAFsQAgAPEgIAizEBAEcUAgBuFAIAeDwBAJExAQDuFwIA/xcCAAAAAACWMQEAAQAAAKQ5AAAoBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAmjEBAAEAAAAAAAAASAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAOAAAAAAAAAA5AAAAOgAAAAoAAAA7AAAAPAAAAD0AAAA+AAAAPwAAAAAAAAAAAAAAAAAAAAAAAABAAAAAQQAAAEIAAABDAAAAAAAAAAAAAAAAAAAAAAAAABcAAAAAAAAAGAAAAAsAAAAIAAAAGQAAAAkAAAAAAAAAzgACAA47AQBiGAIAZwECAIQBAgAZOwEAHzsBACo7AQAxOwEAjwECAOcBAgA5OwEAPzsBAEo7AQCOAgIAsAICAPgCAgBROwEAXwMCAHMDAgD9AwIAWzsBAIgEAgCWBAIA4AQCAGY7AQDuBAIAbjsBAHc7AQCFOwEAjzsBAMMFAgCYOwEABQYCACYGAgBDBgIAnjsBAIoGAgC1BgIA3gYCAAEHAgAqBwIATQcCAHYHAgCZBwIAwgcCAOUHAgAOCAIAMQgCAFoIAgB9CAIApggCAMkIAgDyCAIAFQkCADgJAgClOwEAWgkCALE7AQCCDAIA5wwCAKsNAgC+OwEAkA8CAMs7AQAfEAIALxACANU7AQBbEAIAghACAJMQAgDkOwEA9jsBAJ4QAgAoEQIANxECAEcRAgBZEQIAaRECAAY8AQARPAEAHDwBAHkRAgAPEgIAFBICACE8AQAqPAEAMzwBAEM8AQBKPAEAYBICAIcSAgC9EgIA8hICAAIUAgAfFAIAUjwBAG4UAgBZPAEA/hQCAGI8AQAwFQIAajwBAJIVAgB4PAEAuRUCAOUVAgB/PAEAeBYCALgWAgCJPAEA7hYCAAYXAgBZFwIAkzwBAKE8AQCPFwIAlhcCAMwXAgDuFwIA/xcCACYYAgAAAAAAszwBAAEAAACsOgAAgAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALc8AQABAAAAAAAAAKAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAARAAAAEUAAAAAAAAAAAAAAEYAAABHAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAaAAAAAAAAABsAAAAMAAAACQAAABwAAAAKAAAAAAAAAEFCAACwoQEAQUkAAIqhAQBBUgAAXaEBAEFYAADFoQEAQiAAAAGkAQBCSQAAEqQBAENCAABKogEAQ08AADiiAQBDWAAAV6IBAEggAAB7ogEASEIAAIWiAQBISQAAEaMBAEhYAACUogEASGIAAMWiAQBIaQAA+KIBAEhyAACqogEASHgAANuiAQBJIAAAI6QBAEtCAADcoQEAS0kAACSiAQBLUgAAEKIBAEtYAAD9oQEATkIAACOjAQBOSQAAaqMBAE5SAACCowEATlgAAE6jAQBQQQAA46MBAFBCAACfowEAUEkAANOjAQBQWAAAv6MBAFIgAADapQEAUyAAAPKjAQBaRAAAYKQBAAAAAAAAAAAAAQAAAAAAAABdRwEA/////1w9AADYBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAYUcBAP////8AAAAA+AQAAAAAAAAAAAAAAAAAAAAAAAAAAAAADwAAAGlHAQABAAAAIEMAAAAAAAAQAAAAcUcBAAEAAAAgQwAAAAAAABEAAAB5RwEAAQAAACBDAAAAAAAAEQAAAIJHAQABAAAAIEMAAAAAAAARAAAAikcBAAEAAAAgQwAAAAAAABMAAACSRwEAAQAAACRDAAAAAAAAFAAAAJpHAQABAAAAJEMAAAAAAAAVAAAAokcBAAEAAAAkQwAAAAAAABUAAACrRwEAAQAAACRDAAAAAAAAFQAAALNHAQABAAAAJEMAAAAAAAAWAAAAu0cBAAEAAAAoQwAAAAAAABcAAADERwEAAQAAAChDAAAAAAAAGAAAAM1HAQABAAAAKEMAAAAAAAAYAAAA10cBAAEAAAAoQwAAAAAAABgAAADgRwEAAQAAAChDAAAAAAAAGQAAAOlHAQABAAAALEMAAAAAAAAZAAAA8EcBAAEAAAAsQwAAAAAAABoAAAD2RwEAAQAAADBDAAAAAAAACgAAAP9HAQABAAAANEMAAAAAAAALAAAAB0gBAAEAAAA0QwAAAAAAAAwAAAAPSAEAAQAAADRDAAAAAAAADAAAABhIAQABAAAANEMAAAAAAAAMAAAAIEgBAAEAAAA0QwAAAAAAAA4AAAAoSAEAAQAAADRDAAAAAAAADgAAAC9IAQABAAAANEMAAAAAAAANAAAAN0gBAAEAAAA0QwAAAAAAAAUAAAA/SAEAAQAAADRDAAAAAAAABgAAAEdIAQABAAAANEMAAAAAAAAHAAAAT0gBAAEAAAA0QwAAAAAAAAcAAABYSAEAAQAAADRDAAAAAAAABwAAAGBIAQABAAAANEMAAAAAAAAJAAAAaEgBAAEAAAA0QwAAAAAAAAkAAABvSAEAAQAAADRDAAAAAAAACAAAAHdIAQABAAAANEMAAAAAAAAAAAAAf0gBAAEAAAA4QwAAAAAAAAEAAACISAEAAQAAADhDAAAAAAAAAgAAAJFIAQABAAAAOEMAAAAAAAACAAAAm0gBAAEAAAA4QwAAAAAAAAIAAACkSAEAAQAAADhDAAAAAAAABAAAAK1IAQABAAAAOEMAAAAAAAAEAAAAtUgBAAEAAAA4QwAAAAAAAAMAAAC+SAEAAQAAADhDAAAAAAAAEgAAAMdIAQABAAAAIEMAAAAAAAAbAAAAz0gBAAEAAAA8QwAAAAAAABwAAADXSAEAAQAAADxDAAAAAAAAHQAAAN9IAQABAAAAPEMAAAAAAAAdAAAA6EgBAAEAAAA8QwAAAAAAAB0AAADwSAEAAQAAADxDAAAAAAAAHgAAAPhIAQABAAAAQEMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA0AAAAOAAAADwAAABAAAAARAAAAEgAAABMAAAAUAAAAFQAAAGNMAQBMQwAAAQAAAGhDAAAAAAAAAAAAAEgAAABJAAAAAQAAAAAAAACihQEAAAAAAFxDAABkQwAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAgAAAAAAAAABAAAAAQAAAAEAAAABAAAAAgAAAAIAAAABAAAAAgAAAAQAAAAYAQAAMAEAALAAAACIVAEAjVQBAJFUAQCYVAEAnFQBAAAAAAABAAAAAgAAAAMAAAAEAAAABQAAAAAAAAAdAAAAAAAAAAAAAAAeAAAAAAAAAAAAAAAfAAAAAAAAAAAAAACRWQEAKEQAAAEAAACARAAAAAAAAAAAAABKAAAASwAAAEwAAABNAAAATgAAAE8AAABQAAAAUQAAAFIAAABTAAAAVAAAAEsAAABVAAAASwAAAFYAAABXAAAAWAAAAFkAAAAAAAAAnlkBAAAAAAA4RAAAKNsCAAEAAACkWQEAAAAAAEBEAAAo2wIAAgAAAKhZAQAAAAAASEQAACjbAgADAAAArVkBAAAAAABQRAAAKNsCAAQAAACzWQEAAAAAAFhEAAAo2wIABQAAALlZAQAAAAAAcEQAACjbAgAGAAAAw1kBAAAAAAB4RAAAKNsCAAcAAADJWQEAAAAAAGBEAAAo2wIABwAAAM1ZAQAAAAAAYEQAACjbAgAHAAAA0lkBAAAAAABoRAAAKNsCAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAADAAAAAAAAAAAQAAACAAAAABAAAAAAAAAAAAAAAAAAAAAwAAAAQAAAAAAAAAPGcBAFRnAQBzZwEAkGcBAK9nAQC2ZwEAv2cBADxnAQBBZwEASGcBAE1nAQDeZgEA8GYBAP5mAQAMZwEAGmcBACFnAQAwZwEAPGcBAAAAAADz+QIAAAAAAB0SAgABAAAA+GkBAAcAAAC8aQEAAwAAAMYlAgAFAAAAAGoBAA8AAACQjQEACAAAAJCNAQAQAAAACGoBAAQAAAAIagEAEQAAAA1qAQAFAAAADWoBAAIAAAATagEABgAAABpqAQAEAAAAJmoBAAcAAAAuagEABwAAAD5qAQAFAAAARGoBAAgAAABbagEACAAAAERqAQAJAAAAZGoBAAcAAABsagEACgAAAIZqAQAHAAAAjmoBAAsAAACoagEABgAAAK9qAQAMAAAAzWoBAAkAAACvagEADQAAANdqAQAIAAAA4GoBAA4AAAABawEACAAAAAprAQASAAAAK2sBAAUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAEAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAIAAAADAAAAAIAAAAAAAAAAwAAAAAAAAAAAAAAAAAAAAgAAAAEAAAAAAAAAAMAAAAhAAAABAAAAAAAAAAAAAAAAAAAAAgAAAAEAAAAAAAAAAQAAAAiAAAABQAAAAAAAAAAAAAAAAAAAAUAAABAAAAAiEcAAJhHAAAGAAAABAAAAKRHAAAGAAAACAAAAAYAAAAEAAAArEcAAAAEAAAIAAAA/////wAAAAAAAAAAIwAAAAAAAAAAAAAAAAAAAAAAAAA1AAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAGAAAAAAAAAAcAAAAAAAAAAAAAAAAAAAD/////AAAAAAAAAAAGAAAAAAAAAAcAAAAAAAAAAAAAAAAAAAAYAAAAAAAAAAAAAAAIAAAAAAAAAAcAAAAAAAAAAAAAAAAAAAD/////AAAAAAAAAAAIAAAAAAAAAAcAAAAAAAAAAAAAAAAAAAAcAAAAAAAAAAAAAAAJAAAAAAAAAAcAAAAAAAAACQAAAAsAAAAIAAAACgAAADBJAAC0SAAAGEkAAAEAAAABAAAACgAAABYAAAALAAAAWgAAACQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAwAAAAAAAAABwAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAA0AAAAAAAAABwAAAAAAAAAHAAAAAgAAAAUAAAAIAAAAAAAAAAAAAAAGAAAAAwAAAA4AAAALAAAAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAADwAAAAAAAAAHAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAlAAAAEAAAAAAAAAAHAAAAAAAAAAgAAAAIAAAAAAAAAAAAAAAmAAAAAAAAAAAAAAAAAAAAAAAAABAAAAD/////AAAAAAAAAAAnAAAAAAAAAAAAAAAHAAAAAAAAAAEAAAAAAAAAAQAAAAEAAAABAAAAAQAAAAEAAAABAAAAAQAAAAEAAAACAAAAAwAAAAEAAAABAAAAAgAAAAEAAAABAAAAAQAAAAEAAAABAAAAAQAAAAEAAAABAAAAAQAAAAEAAAABAAAAAQAAAAEAAAABAAAAAQAAAAEAAAABAAAAAQAAAAIAAAABAAAABAAAAAUAAAABAAAAAQAAAAEAAAABAAAAAQAAAAEAAAAGAAAAAQAAAAEAAAAHAAAACAAAAAkAAAAKAAAACgAAAAoAAAAKAAAACgAAAAoAAAAKAAAACgAAAAoAAAAKAAAAAQAAAAEAAAALAAAAAQAAAAwAAAABAAAADQAAAA4AAAAPAAAAEAAAABEAAAASAAAAEwAAABQAAAAVAAAAFgAAABMAAAATAAAAEwAAABMAAAAXAAAAGAAAABkAAAATAAAAGgAAABsAAAAcAAAAHQAAABMAAAATAAAAEwAAABMAAAATAAAAAQAAAB4AAAABAAAAAQAAABMAAAABAAAAHwAAACAAAAAhAAAAIgAAACMAAAATAAAAJAAAACUAAAAmAAAAEwAAABMAAAATAAAAEwAAACcAAAAoAAAAKQAAABMAAAAqAAAAKwAAACwAAAAtAAAAEwAAABMAAAATAAAAEwAAABMAAAABAAAAAQAAAAEAAAABAAAAAQAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAALgAAABMAAAATAAAAEwAAAC8AAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAADAAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAEwAAABMAAAATAAAAAAAAAAEAAAABAAAAAgAAAAMAAAABAAAABAAAAAEAAAAFAAAAAQAAAAYAAAAHAAAABwAAAAEAAAAGAAAABgAAAAYAAAAGAAAABgAAAAYAAAAGAAAABgAAAAYAAAAGAAAABgAAAAYAAAAGAAAABgAAAAYAAAAGAAAAAwAAAAYAAAAGAAAABgAAAAYAAAAGAAAABgAAAAYAAAAGAAAABgAAAAYAAAAGAAAABgAAAAYAAAAGAAAABgAAAAYAAAAGAAAABgAAAIAAAAB5swEAWrMBACB8AQCGswEAfrMBAIyzAQAAAAAAJoABAC+AAQA2gAEARIABAHqyAQCiswEAS4ABAFKAAQABAAAACAAAAP////8AAAAAAAAAACgAAAAAAAAAAAAAAAAAAAAAAAAA8IEBAAgAAAADAAAA+YEBAP2BAQALAAAABgAAAKiNAQAJggEAAgAAAAEAAAAMggEAEIIBAAQAAAACAAAAFYIBABmCAQAEAAAABAAAAB6CAQAjggEABQAAAAUAAAApggEALYIBAAQAAAAHAAAAMoIBADaCAQAFAAAACQAAADyCAQBAggEABAAAAAoAAABFggEASoIBAAQAAAAMAAAAT4IBAOKGAQAAAAAAAQAAAOqGAQABAAAAAAAAAHWyAQABAAAAAQAAAB0SAgAAAAAAAAAAAAAAAAAAAAAAAAAAAMuFAQAxAAAAAAAAAAAAAACjrQEAEAAAAEUeAgCAAAAAxIUBAEAAAAAOoAEAEAAAAMaFAQBAAAAAAAAAAAAAAACShQEAAQAAAJmFAQACAAAAnoUBAAMAAADMpgEABAAAADCdAQAFAAAAooUBAAYAAAAdEgIACAAAAKaFAQAhAAAAqoUBACIAAACuhQEAIgAAALKFAQABAAAAt4UBAAcAAAC9hQEAJwAAAAAAAAAAAAAAAQAAAAAAAAAAAAAA/////wAAAAApAAAAAAAAAAAAAAAAAAAAAAAAAP2KAQAEiwEAAAAAAKWNAQCojQEAq40BAAAAAAAAAAAAAQAAAAIAAAD/////aI0BAG6NAQAdEgIAAAAAAGQAAABlAAAAZgAAAGQAAAAIAAAACAAAAAAAAAAAAAAAKgAAABEAAAAAAAAAAAAAAAAAAAAIAAAACAAAAAAAAAAJAAAAKwAAABEAAAAAAAAAAAAAAAAAAAAIAAAA/////wAAAAAAAAAALAAAAAAAAAAAAAAAAAAAAAAAAADMpgEAYFUAAIAGAAAAAAAA+ZwBAGBVAACwBgAAAAAAANKlAQBgVQAA4AYAAAAAAAABnQEAYFUAAOAGAAAAAAAABp0BAGBVAAAQBwAAAAAAAA2dAQB4VQAAEAcAAAAAAAATnQEAYFUAAEAHAAAAAAAAF50BAGBVAABwBwAAAAAAAB0SAgBgVQAAoAcAAAAAAAAgnQEAYFUAAKAHAAAAAAAAKp0BAGBVAABQBgAAAAAAADCdAQBgVQAA0AcAAAAAAAA4nQEAYFUAAAAIAAAAAAAAQp0BAGBVAAAwCAAAAAAAAFCdAQBgVQAAYAgAAAAAAABWnQEAYFUAAJAIAAAAAAAAX50BAGBVAADACAAAAAAAAGedAQBgVQAA8AgAAAAAAABwnQEAYFUAACAJAAAAAAAAeJ0BAGBVAABQCQAAAAAAAH2dAQBgVQAAgAkAAAAAAACBnQEAYFUAALAJAAAAAAAAiJ0BAGBVAADgCQAAAAAAAI6dAQBgVQAAEAoAAAAAAACYnQEAkFUAAEAKAAAAAAAAoZ0BAGBVAACABgAAAAAAAKadAQBgVQAAgAYAAAAAAACwnQEAYFUAAHAKAAAAAAAAt50BAGBVAACgCgAAAAAAAMSdAQBgVQAA0AoAAAAAAADSnQEAYFUAAAALAAAAAAAA4J0BAGBVAAAwCwAAAAAAAOydAQBgVQAAYAsAAAAAAAD5nQEAYFUAAJALAAAAAAAAAp4BAGBVAADACwAAAAAAAAyeAQBgVQAA8AsAAAAAAAAVngEAYFUAACAMAAAAAAAAHZ4BAGBVAABQDAAAAAAAACWeAQBgVQAAgAwAAAAAAAAungEAYFUAALAMAAAAAAAAMp4BAGBVAADgDAAAAAAAAD2eAQBgVQAAEA0AAAAAAABBngEAYFUAAEANAAAAAAAAS54BAGBVAABwDQAAAAAAAFSeAQBgVQAAoA0AAAAAAABcngEAYFUAANANAAAAAAAAaZ4BAGBVAAAADgAAAAAAAHWeAQBgVQAAMA4AAAAAAACAngEAYFUAAGAOAAAAAAAAkJ4BAGBVAACQDgAAAAAAAJ6eAQBgVQAAwA4AAAAAAACtngEAYFUAAPAOAAAAAAAAt54BAGBVAAAgDwAAAAAAAMCeAQBgVQAAUA8AAAAAAADKngEAYFUAAIAPAAAAAAAA1J4BAGBVAACwDwAAAAAAANueAQBgVQAA4A8AAAAAAADingEAYFUAABAQAAAAAAAA7J4BAKhVAAAAAAAAAAAAAPOeAQCoVQAAAAAAAAAAAADVnAEAwFUAAAAAAAAAAAAA+54BANhVAABAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAABbAAAAXAAAABcAAAAEAAAAAgAAAAwAAABdAAAAXAAAABcAAAAFAAAAAAAAAA0AAABbAAAAXAAAABcAAAAEAAAAAgAAAAwAAABeAAAAXwAAABgAAAAGAAAAAwAAAA4AAABgAAAAYQAAABcAAAAHAAAAAAAAAA8AAABbAAAAXAAAABcAAAAIAAAAAgAAAAwAAAAQAAAAEQAAABIAAAATAAAA/Z8BAASgAQAAAAAADKABAA6gAQB/HgIAEKABAAwAAAAEAAAABgAAAAIAAAADAAAAAQAAAAkAAAAIAAAACwAAAAwAAAANAAAADgAAAA8AAAAQAAAAEQAAABIAAAAVAAAAFgAAABcAAAAYAAAAGQAAABoAAAAbAAAAHAAAAB8AAAAgAAAAIQAAACIAAAAjAAAAJAAAACUAAAAmAAAAKQAAACoAAAArAAAALAAAAC0AAAAuAAAALwAAADAAAAAzAAAANAAAADUAAAA2AAAANwAAADgAAAA5AAAAOgAAAD0AAAA+AAAAPwAAAEAAAABBAAAAQgAAAEMAAABEAAAARwAAAEgAAABJAAAASgAAAEsAAABMAAAATQAAAE4AAABRAAAAUgAAAFMAAABUAAAAVQAAAFYAAABXAAAAWAAAAF2hAQBtoQEAeqEBAAAAAAAAAAAABAAAAH+hAQAAAAAAAAAAAIqhAQBtoQEAeqEBAAAAAAChoQEABQAAAH+hAQAAAAAAqaEBALChAQBtoQEAwKEBAAAAAAAAAAAABgAAAH+hAQDrsQEAAAAAAMWhAQBtoQEAwKEBAAAAAAChoQEABwAAAH+hAQDrsQEAqaEBANyhAQDpoQEAwKEBAAAAAAAAAAAACgAAAPehAQDrsQEAAAAAAP2hAQDpoQEAwKEBAAAAAACpoQEACwAAAPehAQDrsQEAqaEBABCiAQDpoQEAHqIBAAAAAAAAAAAACAAAAPehAQAAAAAAAAAAACSiAQDpoQEAHqIBAAAAAACpoQEACQAAAPehAQAAAAAAqaEBADiiAQA4ogEAAAAAAAAAAAAAAAAADAAAAECiAQAAAAAAAAAAAEqiAQA4ogEA67EBAAAAAAAAAAAADgAAAECiAQDrsQEAAAAAAFeiAQA4ogEA67EBAAAAAAChoQEADwAAAECiAQDrsQEAqaEBAGuiAQA4ogEAAAAAAAAAAAChoQEADQAAAECiAQAAAAAAqaEBAHuiAQB7ogEAAAAAAAAAAAAAAAAAEAAAAH+hAQAAAAAAAAAAAIWiAQB7ogEA67EBAAAAAAAAAAAAEgAAAH+hAQDrsQEAAAAAAJSiAQB7ogEA67EBAAAAAAChoQEAEwAAAH+hAQDrsQEAqaEBAKqiAQB7ogEAAAAAALuiAQAAAAAAFAAAAH+hAQAAAAAAAAAAAMWiAQB7ogEA67EBALuiAQAAAAAAFgAAAH+hAQDrsQEAAAAAANuiAQB7ogEA67EBALuiAQChoQEAFwAAAH+hAQDrsQEAqaEBAPiiAQB7ogEAAAAAALuiAQChoQEAFQAAAH+hAQAAAAAAqaEBABGjAQB7ogEAAAAAAAAAAAChoQEAEQAAAH+hAQAAAAAAqaEBACOjAQA5owEA67EBAAAAAAAAAAAAGgAAAPehAQDrsQEAAAAAAE6jAQA5owEA67EBAAAAAACpoQEAGwAAAPehAQDrsQEAqaEBAGqjAQA5owEAAAAAAAAAAACpoQEAGQAAAPehAQAAAAAAqaEBAIKjAQA5owEAmaMBAAAAAAAAAAAAGAAAAPehAQAAAAAAAAAAAJ+jAQCtowEA67EBAAAAAAAAAAAAHgAAAPehAQDrsQEAAAAAAL+jAQCtowEA67EBAAAAAACpoQEAHwAAAPehAQDrsQEAqaEBANOjAQCtowEAAAAAAAAAAACpoQEAHQAAAPehAQAAAAAAqaEBAOOjAQCtowEAmaMBAAAAAAAAAAAAHAAAAPehAQAAAAAAAAAAAPKjAQDyowEAAAAAAAAAAAAAAAAAIAAAAPmjAQAAAAAAAAAAAAGkAQAMpAEA67EBAAAAAAAAAAAAAgAAAPehAQDrsQEAAAAAABKkAQAMpAEA67EBAAAAAACpoQEAAwAAAPehAQDrsQEAqaEBACOkAQAMpAEAAAAAAAAAAACpoQEAAQAAAPehAQAAAAAAqaEBANqlAQAMpAEAAAAAAAAAAAAAAAAAAAAAAPehAQAAAAAAAAAAADCkAQBKpAEAWaQBAAAAAACpoQEAIQAAAPehAQAAAAAAqaEBAGCkAQBtpAEAAAAAAAAAAAAAAAAAIgAAAPmjAQAAAAAAAAAAAAgAAAAEAAAAAAAAAAoAAAAtAAAAEgAAAAAAAAAAAAAAAAAAAAgAAAD/////AAAAAAAAAAAuAAAAAAAAAAAAAAAAAAAAAAAAAAmnAQDGAAAAD6cBAMEAAAAWpwEAwgAAABynAQDAAAAAI6cBAJEDAAAppwEAxQAAAC+nAQDDAAAANqcBAMQAAAA7pwEAkgMAAECnAQDHAAAAR6cBAKcDAABLpwEAISAAAFKnAQCUAwAAWKcBANAAAABcpwEAyQAAAGOnAQDKAAAAaacBAMgAAABwpwEAlQMAAHinAQCXAwAAfKcBAMsAAACBpwEAkwMAAIenAQDNAAAAjqcBAM4AAACUpwEAzAAAAJunAQCZAwAAoKcBAM8AAAClpwEAmgMAAKunAQCbAwAAsqcBAJwDAAC1pwEA0QAAALynAQCdAwAAv6cBAFIBAADFpwEA0wAAAMynAQDUAAAA0qcBANIAAADZpwEAqQMAAN+nAQCfAwAA56cBANgAAADupwEA1QAAAPWnAQDWAAAA+qcBAKYDAAD+pwEAoAMAAAGoAQAzIAAAB6gBAKgDAAALqAEAoQMAAA+oAQBgAQAAFqgBAKMDAAAcqAEA3gAAACKoAQCkAwAAJqgBAJgDAAAsqAEA2gAAADOoAQDbAAAAOagBANkAAABAqAEApQMAAEioAQDcAAAATagBAJ4DAABQqAEA3QAAAFeoAQB4AQAAXKgBAJYDAABhqAEA4QAAAGioAQDiAAAAbqgBALQAAAB0qAEA5gAAAHqoAQDgAAAAgagBADUhAACJqAEAsQMAAI+oAQAmAAAAk6gBACciAACXqAEAICIAAJuoAQDlAAAAoagBAEgiAACnqAEA4wAAAK6oAQDkAAAAs6gBAB4gAAC5qAEAsgMAAL6oAQCmAAAAxagBACIgAADKqAEAKSIAAM6oAQDnAAAA1agBALgAAADbqAEAogAAAOCoAQDHAwAA5KgBAMYCAADpqAEAYyYAAO+oAQBFIgAA9KgBAKkAAAD5qAEAtSEAAP+oAQAqIgAAA6kBAKQAAAAKqQEA0yEAAA+pAQAgIAAAFqkBAJMhAAAbqQEAsAAAAB+pAQC0AwAAJakBAGYmAAArqQEA9wAAADKpAQDpAAAAOakBAOoAAAA/qQEA6AAAAEapAQAFIgAATKkBAAMgAABRqQEAAiAAAFapAQC1AwAAXqkBAGEiAABkqQEAtwMAAGipAQDwAAAAbKkBAOsAAABxqQEArCAAAHapAQADIgAAfKkBAJIBAACBqQEAACIAAIipAQC9AAAAj6kBALwAAACWqQEAvgAAAJ2pAQBEIAAAo6kBALMDAACpqQEAZSIAAKypAQA+AAAAr6kBANQhAAC0qQEAlCEAALmpAQBlJgAAwKkBACYgAADHqQEA7QAAAM6pAQDuAAAA1KkBAKEAAADaqQEA7AAAAOGpAQARIQAA56kBAB4iAADtqQEAKyIAAPGpAQC5AwAA9qkBAL8AAAD9qQEACCIAAAKqAQDvAAAAB6oBALoDAAANqgEA0CEAABKqAQC7AwAAGaoBACkjAAAeqgEAqwAAACSqAQCQIQAAKaoBAAgjAAAvqgEAHCAAADWqAQBkIgAAOKoBAAojAAA/qgEAFyIAAEaqAQDKJQAASqoBAA4gAABOqgEAOSAAAFWqAQAYIAAAW6oBADwAAABeqgEArwAAAGOqAQAUIAAAaaoBALUAAABvqgEAtwAAAEazAQASIgAAdqoBALwDAAB5qgEAByIAAH+qAQCgAAAAhKoBABMgAACKqgEAYCIAAI2qAQALIgAAkKoBAKwAAACUqgEACSIAAJqqAQCEIgAAn6oBAPEAAACmqgEAvQMAAKmqAQDzAAAAsKoBAPQAAAC2qgEAUwEAALyqAQDyAAAAw6oBAD4gAADJqgEAyQMAAM+qAQC/AwAA16oBAJUiAADdqgEAKCIAAOCqAQCqAAAA5aoBALoAAADqqgEA+AAAAPGqAQD1AAAA+KoBAJciAAD/qgEA9gAAAASrAQC2AAAACasBAAIiAAAOqwEAMCAAABWrAQClIgAAGqsBAMYDAAAeqwEAwAMAACGrAQDWAwAAJasBALEAAAAsqwEAowAAADKrAQAyIAAAOKsBAA8iAAA9qwEAHSIAAEKrAQDIAwAARqsBACIAAABLqwEA0iEAAFCrAQAaIgAAVqsBACojAABbqwEAuwAAAGGrAQCSIQAAZqsBAAkjAABsqwEAHSAAAHKrAQAcIQAAd6sBAK4AAAB7qwEACyMAAIKrAQDBAwAAhqsBAA8gAACKqwEAOiAAAJGrAQAZIAAAl6sBABogAACdqwEAYQEAAKSrAQDFIgAAqasBAKcAAACuqwEArQAAALKrAQDDAwAAuKsBAMIDAAC/qwEAPCIAAMOrAQBgJgAAyqsBAIIiAADOqwEAhiIAANOrAQARIgAA16sBAIMiAADbqwEAuQAAAOCrAQCyAAAA5asBALMAAADqqwEAhyIAAO+rAQDfAAAA9asBAMQDAAD5qwEANCIAAACsAQC4AwAABqwBANEDAAAPrAEACSAAABasAQD+AAAAHKwBANwCAAAirAEA1wAAACisAQAiIQAALqwBANEhAAAzrAEA+gAAADqsAQCRIQAAP6wBAPsAAABFrAEA+QAAAEysAQCoAAAAUKwBANIDAABWrAEAxQMAAF6sAQD8AAAAY6wBABghAABqrAEAvgMAAG2sAQD9AAAAdKwBAKUAAAB4rAEA/wAAAH2sAQC2AwAAgqwBAA0gAACGrAEADCAAAAcAAAAIAAAAAQEAAAgAAAAIAAAAAAAAAAAAAAAvAAAAEwAAAAAAAAAAAAAAAAAAAAgAAAAQAAAAAAAAAAAAAAAwAAAAFAAAAAAAAAAAAAAAAAAAAAazAQAJAAAACLMBAAoAAAANswEACgAAABWzAQALAAAAG7MBAAsAAAAkswEADAAAACezAQAMAAAALbMBAA0AAAAyswEADQAAADqzAQAOAAAAP7MBAA4AAABGswEADwAAAEyzAQAPAAAAWLMBABAAAABiAAAAMQAAADIAAAAUAAAAMwAAAGMAAAA0AAAAFQAAADUAAAAIAAAABAAAAP////8AAAAAAAAAABUAAAAAAAAAAAAAAAAAAACjtAEAVV3Jf8l//wCutAEAuy3Uvq7U/wC5tAEAFHf9/cCG/wDEtAEAVV3Jf8l//wDPtAEAuy3Uvq7U/wDatAEAFHf9/cCG/wDltAEAKmb///+Z/wDwtAEAVV3Jf8l//wD7tAEAuy3Uvq7U/wAGtQEAFHf9/cCG/wARtQEAKmb///+Z/wActQEAl62wOGyw/wAntQEAVV3Jf8l//wAytQEAuy3Uvq7U/wA9tQEAFHf9/cCG/wBItQEAKmb///+Z/wBTtQEAl62wOGyw/wBetQEA6Pzw8AJ//wBptQEAVV3Jf8l//wB0tQEAuy3Uvq7U/wB/tQEAFHf9/cCG/wCKtQEAKmb///+Z/wCVtQEAl62wOGyw/wCgtQEA6Pzw8AJ//wCrtQEAEeC/v1sX/wC2tQEAVV3Jf8l//wDBtQEAuy3Uvq7U/wDMtQEAFHf9/cCG/wDXtQEAKmb///+Z/wDitQEAl62wOGyw/wDttQEA6Pzw8AJ//wD4tQEAEeC/v1sX/wADtgEAAABmZmZm/wAOtgEAkxn33uv3/wAYtgEAjkvhnsrh/wAitgEAkby9MYK9/wAstgEAnxD/7/P//wA2tgEAjy7nvdfn/wBAtgEAj3/Wa67W/wBKtgEAk9C1IXG1/wBUtgEAnxD/7/P//wBetgEAjy7nvdfn/wBotgEAj3/Wa67W/wBytgEAkby9MYK9/wB8tgEAlfGcCFGc/wCGtgEAnxD/7/P//wCQtgEAlCvvxtvv/wCatgEAjkvhnsrh/wCktgEAj3/Wa67W/wCutgEAkby9MYK9/wC4tgEAlfGcCFGc/wDCtgEAnxD/7/P//wDMtgEAlCvvxtvv/wDWtgEAjkvhnsrh/wDgtgEAj3/Wa67W/wDqtgEAkKnGQpLG/wD0tgEAk9C1IXG1/wD+tgEAl/GUCEWU/wAItwEAlAj/9/v//wAStwEAkxn33uv3/wActwEAlCvvxtvv/wAmtwEAjkvhnsrh/wAwtwEAj3/Wa67W/wA6twEAkKnGQpLG/wBEtwEAk9C1IXG1/wBOtwEAl/GUCEWU/wBYtwEAlAj/9/v//wBitwEAkxn33uv3/wBstwEAlCvvxtvv/wB2twEAjkvhnsrh/wCAtwEAj3/Wa67W/wCKtwEAkKnGQpLG/wCUtwEAk9C1IXG1/wCetwEAlfGcCFGc/wCotwEAmOtrCDBr/wCytwEAF+9UVDAF/wC8twEAd/88ADww/wDHtwEAF+yMjFEK/wDRtwEAGMK/v4Et/wDbtwEAHXDf38J9/wDltwEAHjT29ujD/wDvtwEAeSbqx+rl/wD5twEAeF/NgM3B/wADuAEAfKWXNZeP/wANuAEAfPxmAWZe/wAXuAEAF+9UVDAF/wAhuAEAfPxmAWZe/wAsuAEAd/88ADww/wA3uAEAF+yMjFEK/wBBuAEAGMK/v4Et/wBLuAEAHXDf38J9/wBVuAEAHjT29ujD/wBfuAEAAAD19fX1/wBpuAEAeSbqx+rl/wBzuAEAeF/NgM3B/wB9uAEAfKWXNZeP/wCHuAEAHIfY2LNl/wCQuAEAAAD19fX1/wCZuAEAe3+0WrSs/wCiuAEAFdempmEa/wCruAEAHXDf38J9/wC0uAEAeF/NgM3B/wC9uAEAef2FAYVx/wDGuAEAFdempmEa/wDPuAEAHXDf38J9/wDYuAEAAAD19fX1/wDhuAEAeF/NgM3B/wDquAEAef2FAYVx/wDzuAEAF+yMjFEK/wD8uAEAHIfY2LNl/wAFuQEAHjT29ujD/wAOuQEAeSbqx+rl/wAXuQEAe3+0WrSs/wAguQEAfPxmAWZe/wApuQEAF+yMjFEK/wAyuQEAHIfY2LNl/wA7uQEAHjT29ujD/wBEuQEAAAD19fX1/wBNuQEAeSbqx+rl/wBWuQEAe3+0WrSs/wBfuQEAfPxmAWZe/wBouQEAF+yMjFEK/wBxuQEAGMK/v4Et/wB6uQEAHXDf38J9/wCDuQEAHjT29ujD/wCMuQEAeSbqx+rl/wCVuQEAeF/NgM3B/wCeuQEAfKWXNZeP/wCnuQEAfPxmAWZe/wCwuQEAF+yMjFEK/wC5uQEAGMK/v4Et/wDCuQEAHXDf38J9/wDLuQEAHjT29ujD/wDUuQEAAAD19fX1/wDduQEAeSbqx+rl/wDmuQEAeF/NgM3B/wDvuQEAfKWXNZeP/wD4uQEAfPxmAWZe/wABugEAhxT55fX5/wAKugEAdUrYmdjJ/wATugEAZ7miLKJf/wAcugEAiA777fj7/wAlugEAfzbisuLi/wAuugEAcXjCZsKk/wA3ugEAYr6LI4tF/wBAugEAiA777fj7/wBJugEAfzbisuLi/wBSugEAcXjCZsKk/wBbugEAZ7miLKJf/wBkugEAZv9tAG0s/wBtugEAiA777fj7/wB2ugEAdyLszOzm/wB/ugEAdUrYmdjJ/wCIugEAcXjCZsKk/wCRugEAZ7miLKJf/wCaugEAZv9tAG0s/wCjugEAiA777fj7/wCsugEAdyLszOzm/wC1ugEAdUrYmdjJ/wC+ugEAcXjCZsKk/wDHugEAaZ+uQa52/wDQugEAYr6LI4tF/wDZugEAZv9YAFgk/wDiugEAhgb99/z9/wDrugEAhxT55fX5/wD0ugEAdyLszOzm/wD9ugEAdUrYmdjJ/wAGuwEAcXjCZsKk/wAPuwEAaZ+uQa52/wAYuwEAYr6LI4tF/wAhuwEAZv9YAFgk/wAquwEAhgb99/z9/wAzuwEAhxT55fX5/wA8uwEAdyLszOzm/wBFuwEAdUrYmdjJ/wBOuwEAcXjCZsKk/wBXuwEAaZ+uQa52/wBguwEAYr6LI4tF/wBpuwEAZv9tAG0s/wByuwEAZf9EAEQb/wB7uwEAkBT04Oz0/wCEuwEAlEbanrza/wCNuwEAxHuniFan/wCWuwEAiA777fj7/wCfuwEAkjXjs83j/wCouwEAokrGjJbG/wCxuwEAypWdiEGd/wC6uwEAiA777fj7/wDDuwEAkjXjs83j/wDMuwEAokrGjJbG/wDVuwEAxHuniFan/wDeuwEA1uGBgQ98/wDnuwEAiA777fj7/wDwuwEAlCvmv9Pm/wD5uwEAlEbanrza/wACvAEAokrGjJbG/wALvAEAxHuniFan/wAUvAEA1uGBgQ98/wAdvAEAiA777fj7/wAmvAEAlCvmv9Pm/wAvvAEAlEbanrza/wA4vAEAokrGjJbG/wBBvAEAvmSxjGux/wBKvAEAypWdiEGd/wBTvAEA1fxubgFr/wBcvAEAhgb99/z9/wBlvAEAkBT04Oz0/wBuvAEAlCvmv9Pm/wB3vAEAlEbanrza/wCAvAEAokrGjJbG/wCJvAEAvmSxjGux/wCSvAEAypWdiEGd/wCbvAEA1fxubgFr/wCkvAEAhgb99/z9/wCtvAEAkBT04Oz0/wC2vAEAlCvmv9Pm/wC/vAEAlEbanrza/wDIvAEAokrGjJbG/wDRvAEAvmSxjGux/wDavAEAypWdiEGd/wDjvAEA1uGBgQ98/wDsvAEA1f9NTQBL/wD1vAEActOeG553/wD/vAEAEvzZ2V8C/wAJvQEArV+zdXCz/wATvQEActOeG553/wAdvQEAEvzZ2V8C/wAnvQEArV+zdXCz/wAxvQEA6dHn5ymK/wA7vQEActOeG553/wBFvQEAEvzZ2V8C/wBPvQEArV+zdXCz/wBZvQEA6dHn5ymK/wBjvQEAPtCmZqYe/wBtvQEActOeG553/wB3vQEAEvzZ2V8C/wCBvQEArV+zdXCz/wCLvQEA6dHn5ymK/wCVvQEAPtCmZqYe/wCfvQEAH/zm5qsC/wCpvQEActOeG553/wCzvQEAEvzZ2V8C/wC9vQEArV+zdXCz/wDHvQEA6dHn5ymK/wDRvQEAPtCmZqYe/wDbvQEAH/zm5qsC/wDlvQEAG9KmpnYd/wDvvQEActOeG553/wD5vQEAEvzZ2V8C/wADvgEArV+zdXCz/wANvgEA6dHn5ymK/wAXvgEAPtCmZqYe/wAhvgEAH/zm5qsC/wArvgEAG9KmpnYd/wA1vgEAAABmZmZm/wA/vgEATBnz4PPb/wBIvgEAXz3dqN21/wBRvgEAjKrKQ6LK/wBavgEAQRH58Pno/wBjvgEAVy7kuuS8/wBsvgEAe2XMe8zE/wB1vgEAjcW+K4y+/wB+vgEAQRH58Pno/wCHvgEAVy7kuuS8/wCQvgEAe2XMe8zE/wCZvgEAjKrKQ6LK/wCivgEAkfOsCGis/wCrvgEAQRH58Pno/wC0vgEATSnrzOvF/wC9vgEAXz3dqN21/wDGvgEAe2XMe8zE/wDPvgEAjKrKQ6LK/wDYvgEAkfOsCGis/wDhvgEAQRH58Pno/wDqvgEATSnrzOvF/wDzvgEAXz3dqN21/wD8vgEAe2XMe8zE/wAFvwEAiaDTTrPT/wAOvwEAjcW+K4y+/wAXvwEAk/KeCFie/wAgvwEAPAz89/zw/wApvwEATBnz4PPb/wAyvwEATSnrzOvF/wA7vwEAXz3dqN21/wBEvwEAe2XMe8zE/wBNvwEAiaDTTrPT/wBWvwEAjcW+K4y+/wBfvwEAk/KeCFie/wBovwEAPAz89/zw/wBxvwEATBnz4PPb/wB6vwEATSnrzOvF/wCDvwEAXz3dqN21/wCMvwEAe2XMe8zE/wCVvwEAiaDTTrPT/wCevwEAjcW+K4y+/wCnvwEAkfOsCGis/wCwvwEAlu+BCECB/wC5vwEAShX15fXg/wDEvwEAUEjZodmb/wDPvwEAYrKjMaNU/wDavwEASQ/47fjp/wDlvwEATjbkuuSz/wDwvwEAVmjEdMR2/wD7vwEAYr6LI4tF/wAGwAEASQ/47fjp/wARwAEATjbkuuSz/wAcwAEAVmjEdMR2/wAnwAEAYrKjMaNU/wAywAEAZv9tAG0s/wA9wAEASQ/47fjp/wBIwAEATSzpx+nA/wBTwAEAUEjZodmb/wBewAEAVmjEdMR2/wBpwAEAYrKjMaNU/wB0wAEAZv9tAG0s/wB/wAEASQ/47fjp/wCKwAEATSzpx+nA/wCVwAEAUEjZodmb/wCgwAEAVmjEdMR2/wCrwAEAYJ6rQatd/wC2wAEAYr6LI4tF/wDBwAEAbP9aAFoy/wDMwAEASAf89/z1/wDXwAEAShX15fXg/wDiwAEATSzpx+nA/wDtwAEAUEjZodmb/wD4wAEAVmjEdMR2/wADwQEAYJ6rQatd/wAOwQEAYr6LI4tF/wAZwQEAbP9aAFoy/wAkwQEASAf89/z1/wAvwQEAShX15fXg/wA6wQEATSzpx+nA/wBFwQEAUEjZodmb/wBQwQEAVmjEdMR2/wBbwQEAYJ6rQatd/wBmwQEAYr6LI4tF/wBxwQEAZv9tAG0s/wB8wQEAZf9EAEQb/wCHwQEAAADw8PDw/wCRwQEAAAC9vb29/wCbwQEAAABjY2Nj/wClwQEAAAD39/f3/wCvwQEAAADMzMzM/wC5wQEAAACWlpaW/wDDwQEAAABSUlJS/wDNwQEAAAD39/f3/wDXwQEAAADMzMzM/wDhwQEAAACWlpaW/wDrwQEAAABjY2Nj/wD1wQEAAAAlJSUl/wD/wQEAAAD39/f3/wAJwgEAAADZ2dnZ/wATwgEAAAC9vb29/wAdwgEAAACWlpaW/wAnwgEAAABjY2Nj/wAxwgEAAAAlJSUl/wA7wgEAAAD39/f3/wBFwgEAAADZ2dnZ/wBPwgEAAAC9vb29/wBZwgEAAACWlpaW/wBjwgEAAABzc3Nz/wBtwgEAAABSUlJS/wB3wgEAAAAlJSUl/wCBwgEAAAD//////wCLwgEAAADw8PDw/wCVwgEAAADZ2dnZ/wCfwgEAAAC9vb29/wCpwgEAAACWlpaW/wCzwgEAAABzc3Nz/wC9wgEAAABSUlJS/wDHwgEAAAAlJSUl/wDRwgEAAAD//////wDbwgEAAADw8PDw/wDlwgEAAADZ2dnZ/wDvwgEAAAC9vb29/wD5wgEAAACWlpaW/wADwwEAAABzc3Nz/wANwwEAAABSUlJS/wAXwwEAAAAlJSUl/wAhwwEAAAAAAAAA/wArwwEAFTD+/ubO/wA3wwEAE5P9/a5r/wBDwwEADvDm5lUN/wBPwwEAEyD+/u3e/wBbwwEAFHj9/b6F/wBnwwEAEcL9/Y08/wBzwwEADf3Z2UcB/wB/wwEAEyD+/u3e/wCLwwEAFHj9/b6F/wCXwwEAEcL9/Y08/wCjwwEADvDm5lUN/wCvwwEADfqmpjYD/wC7wwEAEyD+/u3e/wDHwwEAFVv9/dCi/wDTwwEAE5P9/a5r/wDfwwEAEcL9/Y08/wDrwwEADvDm5lUN/wD3wwEADfqmpjYD/wADxAEAEyD+/u3e/wAPxAEAFVv9/dCi/wAbxAEAE5P9/a5r/wAnxAEAEcL9/Y08/wAzxAEAEOrx8WkT/wA/xAEADf3Z2UgB/wBLxAEADPeMjC0E/wBXxAEAFRT///Xr/wBjxAEAFTD+/ubO/wBvxAEAFVv9/dCi/wB7xAEAE5P9/a5r/wCHxAEAEcL9/Y08/wCTxAEAEOrx8WkT/wCfxAEADf3Z2UgB/wCrxAEADPeMjC0E/wC3xAEAFRT///Xr/wDDxAEAFTD+/ubO/wDPxAEAFVv9/dCi/wDbxAEAE5P9/a5r/wDnxAEAEcL9/Y08/wDzxAEAEOrx8WkT/wD/xAEADf3Z2UgB/wALxQEADfqmpjYD/wAXxQEADPZ/fycE/wAjxQEAGTb+/ujI/wAsxQEAE3n9/buE/wA1xQEABcXj40oz/wA+xQEAGiX+/vDZ/wBHxQEAGHP9/cyK/wBQxQEADaT8/I1Z/wBZxQEAA9rX1zAf/wBixQEAGiX+/vDZ/wBrxQEAGHP9/cyK/wB0xQEADaT8/I1Z/wB9xQEABcXj40oz/wCGxQEAAP+zswAA/wCPxQEAGiX+/vDZ/wCYxQEAGF/9/dSe/wChxQEAE3n9/buE/wCqxQEADaT8/I1Z/wCzxQEABcXj40oz/wC8xQEAAP+zswAA/wDFxQEAGiX+/vDZ/wDOxQEAGF/9/dSe/wDXxQEAE3n9/buE/wDgxQEADaT8/I1Z/wDpxQEAB7Lv72VI/wDyxQEAA9rX1zAf/wD7xQEAAP+ZmQAA/wAExgEAGBL///fs/wANxgEAGTb+/ujI/wAWxgEAGF/9/dSe/wAfxgEAE3n9/buE/wAoxgEADaT8/I1Z/wAxxgEAB7Lv72VI/wA6xgEAA9rX1zAf/wBDxgEAAP+ZmQAA/wBMxgEAGBL///fs/wBVxgEAGTb+/ujI/wBexgEAGF/9/dSe/wBnxgEAE3n9/buE/wBwxgEADaT8/I1Z/wB5xgEAB7Lv72VI/wCCxgEAA9rX1zAf/wCLxgEAAP+zswAA/wCUxgEAAP9/fwAA/wCdxgEAjkTjps7j/wCpxgEAvpmaaj2a/wC2xgEAkNO0H3i0/wDCxgEAQWHfst+K/wDOxgEAUrigM6As/wDaxgEAAGP7+5qZ/wDmxgEA/uHj4xoc/wDyxgEAF4/9/b9v/wD+xgEAFf///38A/wAKxwEAxirWyrLW/wAWxwEAjkTjps7j/wAixwEAvpmaaj2a/wAvxwEAKmb///+Z/wA8xwEAkNO0H3i0/wBIxwEAQWHfst+K/wBUxwEAUrigM6As/wBgxwEAAGP7+5qZ/wBsxwEA/uHj4xoc/wB4xwEAF4/9/b9v/wCExwEAFf///38A/wCQxwEAxirWyrLW/wCcxwEAjkTjps7j/wCoxwEAvpmaaj2a/wC1xwEAKmb///+Z/wDCxwEAD8WxsVko/wDPxwEAkNO0H3i0/wDbxwEAQWHfst+K/wDnxwEAUrigM6As/wDzxwEAAGP7+5qZ/wD/xwEA/uHj4xoc/wALyAEAF4/9/b9v/wAXyAEAFf///38A/wAjyAEAxirWyrLW/wAvyAEAjkTjps7j/wA6yAEAkNO0H3i0/wBFyAEAQWHfst+K/wBQyAEAjkTjps7j/wBbyAEAkNO0H3i0/wBmyAEAQWHfst+K/wBxyAEAUrigM6As/wB8yAEAjkTjps7j/wCHyAEAkNO0H3i0/wCSyAEAQWHfst+K/wCdyAEAUrigM6As/wCoyAEAAGP7+5qZ/wCzyAEAjkTjps7j/wC+yAEAkNO0H3i0/wDJyAEAQWHfst+K/wDUyAEAUrigM6As/wDfyAEAAGP7+5qZ/wDqyAEA/uHj4xoc/wD1yAEAjkTjps7j/wAAyQEAkNO0H3i0/wALyQEAQWHfst+K/wAWyQEAUrigM6As/wAhyQEAAGP7+5qZ/wAsyQEA/uHj4xoc/wA3yQEAF4/9/b9v/wBCyQEAjkTjps7j/wBNyQEAkNO0H3i0/wBYyQEAQWHfst+K/wBjyQEAUrigM6As/wBuyQEAAGP7+5qZ/wB5yQEA/uHj4xoc/wCEyQEAF4/9/b9v/wCPyQEAFf///38A/wCayQEAjkTjps7j/wClyQEAkNO0H3i0/wCwyQEAQWHfst+K/wC7yQEAUrigM6As/wDGyQEAAGP7+5qZ/wDRyQEA/uHj4xoc/wDcyQEAF4/9/b9v/wDnyQEAFf///38A/wDyyQEAxirWyrLW/wD9yQEAA077+7Su/wAJygEAkjXjs83j/wAVygEATSnrzOvF/wAhygEAA077+7Su/wAtygEAkjXjs83j/wA5ygEATSnrzOvF/wBFygEAyhvk3svk/wBRygEAA077+7Su/wBdygEAkjXjs83j/wBpygEATSnrzOvF/wB1ygEAyhvk3svk/wCBygEAGFj+/tmm/wCNygEAA077+7Su/wCZygEAkjXjs83j/wClygEATSnrzOvF/wCxygEAyhvk3svk/wC9ygEAGFj+/tmm/wDJygEAKjL////M/wDVygEAA077+7Su/wDhygEAkjXjs83j/wDtygEATSnrzOvF/wD5ygEAyhvk3svk/wAFywEAGFj+/tmm/wARywEAKjL////M/wAdywEAHCzl5di9/wApywEAA077+7Su/wA1ywEAkjXjs83j/wBBywEATSnrzOvF/wBNywEAyhvk3svk/wBZywEAGFj+/tmm/wBlywEAKjL////M/wBxywEAHCzl5di9/wB9ywEA6SP9/drs/wCJywEAA077+7Su/wCVywEAkjXjs83j/wChywEATSnrzOvF/wCtywEAyhvk3svk/wC5ywEAGFj+/tmm/wDFywEAKjL////M/wDRywEAHCzl5di9/wDdywEA6SP9/drs/wDpywEAAADy8vLy/wD1ywEAbDXis+LN/wABzAEAEVH9/c2s/wANzAEAmx/oy9Xo/wAZzAEAbDXis+LN/wAlzAEAEVH9/c2s/wAxzAEAmx/oy9Xo/wA9zAEA5Cv09Mrk/wBJzAEAbDXis+LN/wBVzAEAEVH9/c2s/wBhzAEAmx/oy9Xo/wBtzAEA5Cv09Mrk/wB5zAEAOC315vXJ/wCFzAEAbDXis+LN/wCRzAEAEVH9/c2s/wCdzAEAmx/oy9Xo/wCpzAEA5Cv09Mrk/wC1zAEAOC315vXJ/wDBzAEAI1H///Ku/wDNzAEAbDXis+LN/wDZzAEAEVH9/c2s/wDlzAEAmx/oy9Xo/wDxzAEA5Cv09Mrk/wD9zAEAOC315vXJ/wAJzQEAI1H///Ku/wAVzQEAGSfx8eLM/wAhzQEAbDXis+LN/wAtzQEAEVH9/c2s/wA5zQEAmx/oy9Xo/wBFzQEA5Cv09Mrk/wBRzQEAOC315vXJ/wBdzQEAI1H///Ku/wBpzQEAGSfx8eLM/wB1zQEAAADMzMzM/wCBzQEA5v2OjgFS/wCLzQEATb9kJ2QZ/wCWzQEA5tzFxRt9/wCgzQEA6Hbe3neu/wCqzQEA5T7x8bba/wC0zQEA6R39/eDv/wC+zQEAOyb15vXQ/wDIzQEAPWfhuOGG/wDSzQEAP6a8f7xB/wDczQEARMWSTZIh/wDmzQEA5v2OjgFS/wDwzQEARMWSTZIh/wD7zQEATb9kJ2QZ/wAGzgEA5tzFxRt9/wAQzgEA6Hbe3neu/wAazgEA5T7x8bba/wAkzgEA6R39/eDv/wAuzgEAAAD39/f3/wA4zgEAOyb15vXQ/wBCzgEAPWfhuOGG/wBMzgEAP6a8f7xB/wBWzgEA50zp6aPJ/wBfzgEAAAD39/f3/wBozgEAP4HXoddq/wBxzgEA5NzQ0ByL/wB6zgEA5T7x8bba/wCDzgEAPWfhuOGG/wCMzgEASMasTawm/wCVzgEA5NzQ0ByL/wCezgEA5T7x8bba/wCnzgEAAAD39/f3/wCwzgEAPWfhuOGG/wC5zgEASMasTawm/wDCzgEA5tzFxRt9/wDLzgEA50zp6aPJ/wDUzgEA6R39/eDv/wDdzgEAOyb15vXQ/wDmzgEAP4HXoddq/wDvzgEARMWSTZIh/wD4zgEA5tzFxRt9/wABzwEA50zp6aPJ/wAKzwEA6R39/eDv/wATzwEAAAD39/f3/wAczwEAOyb15vXQ/wAlzwEAP4HXoddq/wAuzwEARMWSTZIh/wA3zwEA5tzFxRt9/wBAzwEA6Hbe3neu/wBJzwEA5T7x8bba/wBSzwEA6R39/eDv/wBbzwEAOyb15vXQ/wBkzwEAPWfhuOGG/wBtzwEAP6a8f7xB/wB2zwEARMWSTZIh/wB/zwEA5tzFxRt9/wCIzwEA6Hbe3neu/wCRzwEA5T7x8bba/wCazwEA6R39/eDv/wCjzwEAAAD39/f3/wCszwEAOyb15vXQ/wC1zwEAPWfhuOGG/wC+zwEAP6a8f7xB/wDHzwEARMWSTZIh/wDQzwEAzv9LQABL/wDazwEAZf9EAEQb/wDlzwEAzq2DdiqD/wDvzwEAx1ermXCr/wD5zwEAxzPPwqXP/wAD0AEA0hXo59To/wAN0AEATB7w2fDT/wAX0AEAUETbptug/wAh0AEAWHuuWq5h/wAr0AEAYcV4G3g3/wA10AEAzv9LQABL/wA/0AEAYcV4G3g3/wBK0AEAZf9EAEQb/wBV0AEAzq2DdiqD/wBf0AEAx1ermXCr/wBp0AEAxzPPwqXP/wBz0AEA0hXo59To/wB90AEAAAD39/f3/wCH0AEATB7w2fDT/wCR0AEAUETbptug/wCb0AEAWHuuWq5h/wCl0AEAxEbDr43D/wCu0AEAAAD39/f3/wC30AEAUlq/f797/wDA0AEAyaiUezKU/wDJ0AEAxzPPwqXP/wDS0AEAUETbptug/wDb0AEAZv+IAIg3/wDk0AEAyaiUezKU/wDt0AEAxzPPwqXP/wD20AEAAAD39/f3/wD/0AEAUETbptug/wAI0QEAZv+IAIg3/wAR0QEAzq2DdiqD/wAa0QEAxEbDr43D/wAj0QEA0hXo59To/wAs0QEATB7w2fDT/wA10QEAUlq/f797/wA+0QEAYcV4G3g3/wBH0QEAzq2DdiqD/wBQ0QEAxEbDr43D/wBZ0QEA0hXo59To/wBi0QEAAAD39/f3/wBr0QEATB7w2fDT/wB00QEAUlq/f797/wB90QEAYcV4G3g3/wCG0QEAzq2DdiqD/wCP0QEAx1ermXCr/wCY0QEAxzPPwqXP/wCh0QEA0hXo59To/wCq0QEATB7w2fDT/wCz0QEAUETbptug/wC80QEAWHuuWq5h/wDF0QEAYcV4G3g3/wDO0QEAzq2DdiqD/wDX0QEAx1ermXCr/wDg0QEAxzPPwqXP/wDp0QEA0hXo59To/wDy0QEAAAD39/f3/wD70QEATB7w2fDT/wAE0gEAUETbptug/wAN0gEAWHuuWq5h/wAW0gEAYcV4G3g3/wAf0gEAvQvy7Ofy/wAo0gEAlz3bpr3b/wAx0gEAjcW+K4y+/wA60gEAuQj28e72/wBD0gEAmyjhvcnh/wBM0gEAkXDPdKnP/wBV0gEAj/ewBXCw/wBe0gEAuQj28e72/wBn0gEAmyjhvcnh/wBw0gEAkXDPdKnP/wB50gEAjcW+K4y+/wCC0gEAj/eNBFqN/wCL0gEAuQj28e72/wCU0gEAqBjm0NHm/wCd0gEAlz3bpr3b/wCm0gEAkXDPdKnP/wCv0gEAjcW+K4y+/wC40gEAj/eNBFqN/wDB0gEAuQj28e72/wDK0gEAqBjm0NHm/wDT0gEAlz3bpr3b/wDc0gEAkXDPdKnP/wDl0gEAjrfANpDA/wDu0gEAj/ewBXCw/wD30gEAj/h7A057/wAA0wEA6Qj///f7/wAJ0wEAvQvy7Ofy/wAS0wEAqBjm0NHm/wAb0wEAlz3bpr3b/wAk0wEAkXDPdKnP/wAt0wEAjrfANpDA/wA20wEAj/ewBXCw/wA/0wEAj/h7A057/wBI0wEA6Qj///f7/wBR0wEAvQvy7Ofy/wBa0wEAqBjm0NHm/wBj0wEAlz3bpr3b/wBs0wEAkXDPdKnP/wB10wEAjrfANpDA/wB+0wEAj/ewBXCw/wCH0wEAj/eNBFqN/wCQ0wEAj/lYAjhY/wCZ0wEAyA7w7OLw/wCk0wEAlz3bpr3b/wCv0wEAgtCZHJCZ/wC60wEAzwj39u/3/wDF0wEAmyjhvcnh/wDQ0wEAj4DPZ6nP/wDb0wEAgvuKAoGK/wDm0wEAzwj39u/3/wDx0wEAmyjhvcnh/wD80wEAj4DPZ6nP/wAH1AEAgtCZHJCZ/wAS1AEAd/xsAWxZ/wAd1AEAzwj39u/3/wAo1AEAqBjm0NHm/wAz1AEAlz3bpr3b/wA+1AEAj4DPZ6nP/wBJ1AEAgtCZHJCZ/wBU1AEAd/xsAWxZ/wBf1AEAzwj39u/3/wBq1AEAqBjm0NHm/wB11AEAlz3bpr3b/wCA1AEAj4DPZ6nP/wCL1AEAjrfANpDA/wCW1AEAgvuKAoGK/wCh1AEAdvxkAWRQ/wCs1AEA6Qj///f7/wC31AEAyA7w7OLw/wDC1AEAqBjm0NHm/wDN1AEAlz3bpr3b/wDY1AEAj4DPZ6nP/wDj1AEAjrfANpDA/wDu1AEAgvuKAoGK/wD51AEAdvxkAWRQ/wAE1QEA6Qj///f7/wAP1QEAyA7w7OLw/wAa1QEAqBjm0NHm/wAl1QEAlz3bpr3b/wAw1QEAj4DPZ6nP/wA71QEAjrfANpDA/wBG1QEAgvuKAoGK/wBR1QEAd/xsAWxZ/wBc1QEAdftGAUY2/wBn1QEAEu5/fzsI/wBx1QEAw/9LLQBL/wB81QEAFPazs1gG/wCG1QEAFujg4IIU/wCQ1QEAF5v9/bhj/wCa1QEAGEj+/uC2/wCk1QEApRTr2Nrr/wCu1QEAsS/SsqvS/wC41QEAs1SsgHOs/wDC1QEAvbWIVCeI/wDM1QEAEu5/fzsI/wDW1QEAvbWIVCeI/wDh1QEAw/9LLQBL/wDs1QEAFPazs1gG/wD21QEAFujg4IIU/wAA1gEAF5v9/bhj/wAK1gEAGEj+/uC2/wAU1gEAAAD39/f3/wAe1gEApRTr2Nrr/wAo1gEAsS/SsqvS/wAy1gEAs1SsgHOs/wA81gEAF7vx8aNA/wBF1gEAAAD39/f3/wBO1gEAskXDmY7D/wBX1gEAEf3m5mEB/wBg1gEAF5v9/bhj/wBp1gEAsS/SsqvS/wBy1gEAuZuZXjyZ/wB71gEAEf3m5mEB/wCE1gEAF5v9/bhj/wCN1gEAAAD39/f3/wCW1gEAsS/SsqvS/wCf1gEAuZuZXjyZ/wCo1gEAFPazs1gG/wCx1gEAF7vx8aNA/wC61gEAGEj+/uC2/wDD1gEApRTr2Nrr/wDM1gEAskXDmY7D/wDV1gEAvbWIVCeI/wDe1gEAFPazs1gG/wDn1gEAF7vx8aNA/wDw1gEAGEj+/uC2/wD51gEAAAD39/f3/wAC1wEApRTr2Nrr/wAL1wEAskXDmY7D/wAU1wEAvbWIVCeI/wAd1wEAFPazs1gG/wAm1wEAFujg4IIU/wAv1wEAF5v9/bhj/wA41wEAGEj+/uC2/wBB1wEApRTr2Nrr/wBK1wEAsS/SsqvS/wBT1wEAs1SsgHOs/wBc1wEAvbWIVCeI/wBl1wEAFPazs1gG/wBu1wEAFujg4IIU/wB31wEAF5v9/bhj/wCA1wEAGEj+/uC2/wCJ1wEAAAD39/f3/wCS1wEApRTr2Nrr/wCb1wEAsS/SsqvS/wCk1wEAs1SsgHOs/wCt1wEAvbWIVCeI/wC21wEAvA7v5+Hv/wC/1wEA1kPJyZTH/wDI1wEA6t7d3Rx3/wDR1wEAuQj28e72/wDa1wEA0ynY17XY/wDj1wEA5Ivf32Ww/wDs1wEA7+jOzhJW/wD11wEAuQj28e72/wD+1wEA0ynY17XY/wAH2AEA5Ivf32Ww/wAQ2AEA6t7d3Rx3/wAZ2AEA7P+YmABD/wAi2AEAuQj28e72/wAr2AEAzCba1Lna/wA02AEA1kPJyZTH/wA92AEA5Ivf32Ww/wBG2AEA6t7d3Rx3/wBP2AEA7P+YmABD/wBY2AEAuQj28e72/wBh2AEAzCba1Lna/wBq2AEA1kPJyZTH/wBz2AEA5Ivf32Ww/wB82AEA6dHn5ymK/wCF2AEA7+jOzhJW/wCO2AEA7P+RkQA//wCX2AEAwwX59/T5/wCg2AEAvA7v5+Hv/wCp2AEAzCba1Lna/wCy2AEA1kPJyZTH/wC72AEA5Ivf32Ww/wDE2AEA6dHn5ymK/wDN2AEA7+jOzhJW/wDW2AEA7P+RkQA//wDf2AEAwwX59/T5/wDo2AEAvA7v5+Hv/wDx2AEAzCba1Lna/wD62AEA1kPJyZTH/wAD2QEA5Ivf32Ww/wAM2QEA6dHn5ymK/wAV2QEA7+jOzhJW/wAe2QEA7P+YmABD/wAn2QEA8v9nZwAf/wAw2QEAtAj17+31/wA82QEAqCXcvL3c/wBI2QEAsGSxdWux/wBU2QEAtgf38vD3/wBg2QEArRziy8ni/wBs2QEArTrInprI/wB42QEAtoCjalGj/wCE2QEAtgf38vD3/wCQ2QEArRziy8ni/wCc2QEArTrInprI/wCo2QEAsGSxdWux/wC02QEAvLmPVCeP/wDA2QEAtgf38vD3/wDM2QEAqhLr2trr/wDY2QEAqCXcvL3c/wDk2QEArTrInprI/wDw2QEAsGSxdWux/wD82QEAvLmPVCeP/wAI2gEAtgf38vD3/wAU2gEAqhLr2trr/wAg2gEAqCXcvL3c/wAs2gEArTrInprI/wA42gEArFO6gH26/wBE2gEAtoCjalGj/wBQ2gEAvtiGShSG/wBc2gEAvwL9/Pv9/wBo2gEAtAj17+31/wB02gEAqhLr2trr/wCA2gEAqCXcvL3c/wCM2gEArTrInprI/wCY2gEArFO6gH26/wCk2gEAtoCjalGj/wCw2gEAvtiGShSG/wC82gEAvwL9/Pv9/wDI2gEAtAj17+31/wDU2gEAqhLr2trr/wDg2gEAqCXcvL3c/wDs2gEArTrInprI/wD42gEArFO6gH26/wAE2wEAtoCjalGj/wAQ2wEAvLmPVCeP/wAc2wEAv/99PwB9/wAo2wEA8v9nZwAf/wAy2wEAlvFhBTBh/wA92wEA+dyyshgr/wBH2wEABaPW1mBN/wBR2wEADXf09KWC/wBb2wEADzb9/dvH/wBl2wEAjiDw0eXw/wBv2wEAjVfeksXe/wB52wEAj6fDQ5PD/wCD2wEAlM6sIWas/wCN2wEA8v9nZwAf/wCX2wEAlM6sIWas/wCi2wEAlvFhBTBh/wCt2wEA+dyyshgr/wC32wEABaPW1mBN/wDB2wEADXf09KWC/wDL2wEADzb9/dvH/wDV2wEAAAD39/f3/wDf2wEAjiDw0eXw/wDp2wEAjVfeksXe/wDz2wEAj6fDQ5PD/wD92wEADJbv74pi/wAG3AEAAAD39/f3/wAP3AEAj4DPZ6nP/wAY3AEA+P/KygAg/wAh3AEADXf09KWC/wAq3AEAjVfeksXe/wAz3AEAj/ewBXGw/wA83AEA+P/KygAg/wBF3AEADXf09KWC/wBO3AEAAAD39/f3/wBX3AEAjVfeksXe/wBg3AEAj/ewBXGw/wBp3AEA+dyyshgr/wBy3AEADJbv74pi/wB73AEADzb9/dvH/wCE3AEAjiDw0eXw/wCN3AEAj4DPZ6nP/wCW3AEAlM6sIWas/wCf3AEA+dyyshgr/wCo3AEADJbv74pi/wCx3AEADzb9/dvH/wC63AEAAAD39/f3/wDD3AEAjiDw0eXw/wDM3AEAj4DPZ6nP/wDV3AEAlM6sIWas/wDe3AEA+dyyshgr/wDn3AEABaPW1mBN/wDw3AEADXf09KWC/wD53AEADzb9/dvH/wAC3QEAjiDw0eXw/wAL3QEAjVfeksXe/wAU3QEAj6fDQ5PD/wAd3QEAlM6sIWas/wAm3QEA+dyyshgr/wAv3QEABaPW1mBN/wA43QEADXf09KWC/wBB3QEADzb9/dvH/wBK3QEAAAD39/f3/wBT3QEAjiDw0eXw/wBc3QEAjVfeksXe/wBl3QEAj6fDQ5PD/wBu3QEAlM6sIWas/wB33QEA8v9nZwAf/wCB3QEAAAAaGhoa/wCM3QEA+dyyshgr/wCW3QEABaPW1mBN/wCg3QEADXf09KWC/wCq3QEADzb9/dvH/wC03QEAAADg4ODg/wC+3QEAAAC6urq6/wDI3QEAAACHh4eH/wDS3QEAAABNTU1N/wDc3QEA8v9nZwAf/wDm3QEAAABNTU1N/wDx3QEAAAAaGhoa/wD83QEA+dyyshgr/wAG3gEABaPW1mBN/wAQ3gEADXf09KWC/wAa3gEADzb9/dvH/wAk3gEAAAD//////wAu3gEAAADg4ODg/wA43gEAAAC6urq6/wBC3gEAAACHh4eH/wBM3gEADJbv74pi/wBV3gEAAAD//////wBe3gEAAACZmZmZ/wBn3gEA+P/KygAg/wBw3gEADXf09KWC/wB53gEAAAC6urq6/wCC3gEAAABAQEBA/wCL3gEA+P/KygAg/wCU3gEADXf09KWC/wCd3gEAAAD//////wCm3gEAAAC6urq6/wCv3gEAAABAQEBA/wC43gEA+dyyshgr/wDB3gEADJbv74pi/wDK3gEADzb9/dvH/wDT3gEAAADg4ODg/wDc3gEAAACZmZmZ/wDl3gEAAABNTU1N/wDu3gEA+dyyshgr/wD33gEADJbv74pi/wAA3wEADzb9/dvH/wAJ3wEAAAD//////wAS3wEAAADg4ODg/wAb3wEAAACZmZmZ/wAk3wEAAABNTU1N/wAt3wEA+dyyshgr/wA23wEABaPW1mBN/wA/3wEADXf09KWC/wBI3wEADzb9/dvH/wBR3wEAAADg4ODg/wBa3wEAAAC6urq6/wBj3wEAAACHh4eH/wBs3wEAAABNTU1N/wB13wEA+dyyshgr/wB+3wEABaPW1mBN/wCH3wEADXf09KWC/wCQ3wEADzb9/dvH/wCZ3wEAAAD//////wCi3wEAAADg4ODg/wCr3wEAAAC6urq6/wC03wEAAACHh4eH/wC93wEAAABNTU1N/wDG3wEAAyD9/eDd/wDP3wEA9Fz6+p+1/wDY3wEA49zFxRuK/wDh3wEADRz+/uvi/wDq3wEA/Ej7+7S5/wDz3wEA7pP392ih/wD83wEA4P2urgF+/wAF4AEADRz+/uvi/wAO4AEA/Ej7+7S5/wAX4AEA7pP392ih/wAg4AEA49zFxRuK/wAp4AEA1fx6egF3/wAy4AEADRz+/uvi/wA74AEAAzz8/MXA/wBE4AEA9Fz6+p+1/wBN4AEA7pP392ih/wBW4AEA49zFxRuK/wBf4AEA1fx6egF3/wBo4AEADRz+/uvi/wBx4AEAAzz8/MXA/wB64AEA9Fz6+p+1/wCD4AEA7pP392ih/wCM4AEA5sPd3TSX/wCV4AEA4P2urgF+/wCe4AEA1fx6egF3/wCn4AEADgz///fz/wCw4AEAAyD9/eDd/wC54AEAAzz8/MXA/wDC4AEA9Fz6+p+1/wDL4AEA7pP392ih/wDU4AEA5sPd3TSX/wDd4AEA4P2urgF+/wDm4AEA1fx6egF3/wDv4AEADgz///fz/wD44AEAAyD9/eDd/wAB4QEAAzz8/MXA/wAK4QEA9Fz6+p+1/wAT4QEA7pP392ih/wAc4QEA5sPd3TSX/wAl4QEA4P2urgF+/wAu4QEA1fx6egF3/wA34QEAx/9qSQBq/wBA4QEA9f+lpQAm/wBM4QEAp6uVMTaV/wBZ4QEAAtDX1zAn/wBl4QEACrj09G1D/wBx4QEAFJ39/a5h/wB94QEAHm7+/uCQ/wCJ4QEAiBj44PP4/wCV4QEAikPpq9np/wCh4QEAj3HRdK3R/wCt4QEAl520RXW0/wC54QEA9f+lpQAm/wDF4QEAl520RXW0/wDS4QEAp6uVMTaV/wDf4QEAAtDX1zAn/wDr4QEACrj09G1D/wD34QEAFJ39/a5h/wAD4gEAHm7+/uCQ/wAP4gEAKkD///+//wAb4gEAiBj44PP4/wAn4gEAikPpq9np/wAz4gEAj3HRdK3R/wA/4gEADaT8/I1Z/wBK4gEAKkD///+//wBV4gEAj1bbkb/b/wBg4gEA/uHX1xkc/wBr4gEAFJ39/a5h/wB24gEAikPpq9np/wCB4gEAkcG2LHu2/wCM4gEA/uHX1xkc/wCX4gEAFJ39/a5h/wCi4gEAKkD///+//wCt4gEAikPpq9np/wC44gEAkcG2LHu2/wDD4gEAAtDX1zAn/wDO4gEADaT8/I1Z/wDZ4gEAHm7+/uCQ/wDk4gEAiBj44PP4/wDv4gEAj1bbkb/b/wD64gEAl520RXW0/wAF4wEAAtDX1zAn/wAQ4wEADaT8/I1Z/wAb4wEAHm7+/uCQ/wAm4wEAKkD///+//wAx4wEAiBj44PP4/wA84wEAj1bbkb/b/wBH4wEAl520RXW0/wBS4wEAAtDX1zAn/wBd4wEACrj09G1D/wBo4wEAFJ39/a5h/wBz4wEAHm7+/uCQ/wB+4wEAiBj44PP4/wCJ4wEAikPpq9np/wCU4wEAj3HRdK3R/wCf4wEAl520RXW0/wCq4wEAAtDX1zAn/wC14wEACrj09G1D/wDA4wEAFJ39/a5h/wDL4wEAHm7+/uCQ/wDW4wEAKkD///+//wDh4wEAiBj44PP4/wDs4wEAikPpq9np/wD34wEAj3HRdK3R/wAC5AEAl520RXW0/wAN5AEA9f+lpQAm/wAZ5AEAa/9oAGg3/wAm5AEAAtDX1zAn/wAy5AEACrj09G1D/wA+5AEAFJ39/a5h/wBK5AEAH3P+/uCL/wBW5AEAM2rv2e+L/wBi5AEAPoLZptlq/wBu5AEAU3m9Zr1j/wB65AEAZ9OYGphQ/wCG5AEA9f+lpQAm/wCS5AEAZ9OYGphQ/wCf5AEAa/9oAGg3/wCs5AEAAtDX1zAn/wC45AEACrj09G1D/wDE5AEAFJ39/a5h/wDQ5AEAH3P+/uCL/wDc5AEAKkD///+//wDo5AEAM2rv2e+L/wD05AEAPoLZptlq/wAA5QEAU3m9Zr1j/wAM5QEADaT8/I1Z/wAX5QEAKkD///+//wAi5QEAQojPkc9g/wAt5QEA/uHX1xkc/wA45QEAFJ39/a5h/wBD5QEAPoLZptlq/wBO5QEAYtKWGpZB/wBZ5QEA/uHX1xkc/wBk5QEAFJ39/a5h/wBv5QEAKkD///+//wB65QEAPoLZptlq/wCF5QEAYtKWGpZB/wCQ5QEAAtDX1zAn/wCb5QEADaT8/I1Z/wCm5QEAH3P+/uCL/wCx5QEAM2rv2e+L/wC85QEAQojPkc9g/wDH5QEAZ9OYGphQ/wDS5QEAAtDX1zAn/wDd5QEADaT8/I1Z/wDo5QEAH3P+/uCL/wDz5QEAKkD///+//wD+5QEAM2rv2e+L/wAJ5gEAQojPkc9g/wAU5gEAZ9OYGphQ/wAf5gEAAtDX1zAn/wAq5gEACrj09G1D/wA15gEAFJ39/a5h/wBA5gEAH3P+/uCL/wBL5gEAM2rv2e+L/wBW5gEAPoLZptlq/wBh5gEAU3m9Zr1j/wBs5gEAZ9OYGphQ/wB35gEAAtDX1zAn/wCC5gEACrj09G1D/wCN5gEAFJ39/a5h/wCY5gEAH3P+/uCL/wCj5gEAKkD///+//wCu5gEAM2rv2e+L/wC55gEAPoLZptlq/wDE5gEAU3m9Zr1j/wDP5gEAZ9OYGphQ/wDa5gEADSz+/uDS/wDj5gEACYv8/JJy/wDs5gEAAdPe3i0m/wD15gEADSX+/uXZ/wD+5gEAC2z8/K6R/wAH5wEAB7P7+2pK/wAQ5wEA/eDLyxgd/wAZ5wEADSX+/uXZ/wAi5wEAC2z8/K6R/wAr5wEAB7P7+2pK/wA05wEAAdPe3i0m/wA95wEA/eelpQ8V/wBG5wEADSX+/uXZ/wBP5wEADFz8/Luh/wBY5wEACYv8/JJy/wBh5wEAB7P7+2pK/wBq5wEAAdPe3i0m/wBz5wEA/eelpQ8V/wB85wEADSX+/uXZ/wCF5wEADFz8/Luh/wCO5wEACYv8/JJy/wCX5wEAB7P7+2pK/wCg5wEAA9Dv7zss/wCp5wEA/eDLyxgd/wCy5wEA+/+ZmQAN/wC75wEADg////Xw/wDE5wEADSz+/uDS/wDN5wEADFz8/Luh/wDW5wEACYv8/JJy/wDf5wEAB7P7+2pK/wDo5wEAA9Dv7zss/wDx5wEA/eDLyxgd/wD65wEA+/+ZmQAN/wAD6AEADg////Xw/wAM6AEADSz+/uDS/wAV6AEADFz8/Luh/wAe6AEACYv8/JJy/wAn6AEAB7P7+2pK/wAw6AEAA9Dv7zss/wA56AEA/eDLyxgd/wBC6AEA/eelpQ8V/wBL6AEA+f9nZwAN/wBU6AEA/uHk5Boc/wBd6AEAkrK4N364/wBm6AEAU5OvTa9K/wBv6AEA/uHk5Boc/wB46AEAkrK4N364/wCB6AEAU5OvTa9K/wCK6AEAz4SjmE6j/wCT6AEA/uHk5Boc/wCc6AEAkrK4N364/wCl6AEAU5OvTa9K/wCu6AEAz4SjmE6j/wC36AEAFf///38A/wDA6AEA/uHk5Boc/wDJ6AEAkrK4N364/wDS6AEAU5OvTa9K/wDb6AEAz4SjmE6j/wDk6AEAFf///38A/wDt6AEAKsz///8z/wD26AEA/uHk5Boc/wD/6AEAkrK4N364/wAI6QEAU5OvTa9K/wAR6QEAz4SjmE6j/wAa6QEAFf///38A/wAj6QEAKsz///8z/wAs6QEAD8GmplYo/wA16QEA/uHk5Boc/wA+6QEAkrK4N364/wBH6QEAU5OvTa9K/wBQ6QEAz4SjmE6j/wBZ6QEAFf///38A/wBi6QEAKsz///8z/wBr6QEAD8GmplYo/wB06QEA6Hn394G//wB96QEA/uHk5Boc/wCG6QEAkrK4N364/wCP6QEAU5OvTa9K/wCY6QEAz4SjmE6j/wCh6QEAFf///38A/wCq6QEAKsz///8z/wCz6QEAD8GmplYo/wC86QEA6Hn394G//wDF6QEAAACZmZmZ/wDO6QEAcnjCZsKl/wDX6QEAC5v8/I1i/wDg6QEAnE3LjaDL/wDp6QEAcnjCZsKl/wDy6QEAC5v8/I1i/wD76QEAnE3LjaDL/wAE6gEA5Gbn54rD/wAN6gEAcnjCZsKl/wAW6gEAC5v8/I1i/wAf6gEAnE3LjaDL/wAo6gEA5Gbn54rD/wAx6gEAOpvYpthU/wA66gEAcnjCZsKl/wBD6gEAC5v8/I1i/wBM6gEAnE3LjaDL/wBV6gEA5Gbn54rD/wBe6gEAOpvYpthU/wBn6gEAItD//9kv/wBw6gEAcnjCZsKl/wB56gEAC5v8/I1i/wCC6gEAnE3LjaDL/wCL6gEA5Gbn54rD/wCU6gEAOpvYpthU/wCd6gEAItD//9kv/wCm6gEAGVrl5cSU/wCv6gEAcnjCZsKl/wC46gEAC5v8/I1i/wDB6gEAnE3LjaDL/wDK6gEA5Gbn54rD/wDT6gEAOpvYpthU/wDc6gEAItD//9kv/wDl6gEAGVrl5cSU/wDu6gEAAACzs7Oz/wD36gEAeFTTjdPH/wAB6wEA01K9vIC9/wAM6wEAKkz///+z/wAW6wEAryXavrra/wAg6wEABIv7+4By/wAq6wEAkGTTgLHT/wA06wEAFpz9/bRi/wA+6wEAOobes95p/wBI6wEA6S/8/M3l/wBS6wEAAADZ2dnZ/wBc6wEAeFTTjdPH/wBm6wEA01K9vIC9/wBx6wEATSnrzOvF/wB86wEAKkz///+z/wCG6wEAryXavrra/wCQ6wEABIv7+4By/wCa6wEAkGTTgLHT/wCk6wEAFpz9/bRi/wCu6wEAOobes95p/wC46wEA6S/8/M3l/wDC6wEAAADZ2dnZ/wDM6wEAeFTTjdPH/wDW6wEA01K9vIC9/wDh6wEATSnrzOvF/wDs6wEAJZD//+1v/wD36wEAKkz///+z/wAB7AEAryXavrra/wAL7AEABIv7+4By/wAV7AEAkGTTgLHT/wAf7AEAFpz9/bRi/wAp7AEAOobes95p/wAz7AEA6S/8/M3l/wA97AEAAADZ2dnZ/wBH7AEAeFTTjdPH/wBQ7AEAKkz///+z/wBZ7AEAryXavrra/wBi7AEAeFTTjdPH/wBr7AEAKkz///+z/wB07AEAryXavrra/wB97AEABIv7+4By/wCG7AEAeFTTjdPH/wCP7AEAKkz///+z/wCY7AEAryXavrra/wCh7AEABIv7+4By/wCq7AEAkGTTgLHT/wCz7AEAeFTTjdPH/wC87AEAKkz///+z/wDF7AEAryXavrra/wDO7AEABIv7+4By/wDX7AEAkGTTgLHT/wDg7AEAFpz9/bRi/wDp7AEAeFTTjdPH/wDy7AEAKkz///+z/wD77AEAryXavrra/wAE7QEABIv7+4By/wAN7QEAkGTTgLHT/wAW7QEAFpz9/bRi/wAf7QEAOobes95p/wAo7QEAeFTTjdPH/wAx7QEAKkz///+z/wA67QEAryXavrra/wBD7QEABIv7+4By/wBM7QEAkGTTgLHT/wBV7QEAFpz9/bRi/wBe7QEAOobes95p/wBn7QEA6S/8/M3l/wBw7QEAeFTTjdPH/wB57QEAKkz///+z/wCC7QEAryXavrra/wCL7QEABIv7+4By/wCU7QEAkGTTgLHT/wCd7QEAFpz9/bRi/wCm7QEAOobes95p/wCv7QEA6S/8/M3l/wC47QEAAADZ2dnZ/wDB7QEA7f2engFC/wDP7QEAsYKiXk+i/wDe7QEA+rTV1T5P/wDs7QEACrj09G1D/wD67QEAFJ39/a5h/wAI7gEAH3P+/uCL/wAW7gEAMWD15vWY/wAk7gEAT0Hdq92k/wAy7gEAcnjCZsKl/wBA7gEAj7u9Moi9/wBO7gEA7f2engFC/wBc7gEAj7u9Moi9/wBr7gEAsYKiXk+i/wB67gEA+rTV1T5P/wCI7gEACrj09G1D/wCW7gEAFJ39/a5h/wCk7gEAH3P+/uCL/wCy7gEAKkD///+//wDA7gEAMWD15vWY/wDO7gEAT0Hdq92k/wDc7gEAcnjCZsKl/wDq7gEADaT8/I1Z/wD37gEAKkD///+//wAE7wEAUU3VmdWU/wAR7wEA/uHX1xkc/wAe7wEAFJ39/a5h/wAr7wEAT0Hdq92k/wA47wEAj8S6K4O6/wBF7wEA/uHX1xkc/wBS7wEAFJ39/a5h/wBf7wEAKkD///+//wBs7wEAT0Hdq92k/wB57wEAj8S6K4O6/wCG7wEA+rTV1T5P/wCT7wEADaT8/I1Z/wCg7wEAH3P+/uCL/wCt7wEAMWD15vWY/wC67wEAUU3VmdWU/wDH7wEAj7u9Moi9/wDU7wEA+rTV1T5P/wDh7wEADaT8/I1Z/wDu7wEAH3P+/uCL/wD77wEAKkD///+//wAI8AEAMWD15vWY/wAV8AEAUU3VmdWU/wAi8AEAj7u9Moi9/wAv8AEA+rTV1T5P/wA88AEACrj09G1D/wBJ8AEAFJ39/a5h/wBW8AEAH3P+/uCL/wBj8AEAMWD15vWY/wBw8AEAT0Hdq92k/wB98AEAcnjCZsKl/wCK8AEAj7u9Moi9/wCX8AEA+rTV1T5P/wCk8AEACrj09G1D/wCx8AEAFJ39/a5h/wC+8AEAH3P+/uCL/wDL8AEAKkD///+//wDY8AEAMWD15vWY/wDl8AEAT0Hdq92k/wDy8AEAcnjCZsKl/wD/8AEAj7u9Moi9/wAM8QEAkw//8Pj//wAb8QEAGCP6+uvX/wAt8QEAf///AP///wA38QEAcYD/f//U/wBH8QEAfw//8P///wBS8QEAKhr19fXc/wBd8QEAFzr//+TE/wBp8QEAAAAAAAAA/wB08QEAGTH//+vN/wCI8QEAqv//AAD//wCS8QEAwM7iiivi/wCi8QEAAL6lpSoq/wCt8QEAF2Pe3riH/wC88QEAgGegX56g/wDL8QEAP///f/8A/wDb8QEAEdrS0mke/wDq8QEAC6///39Q/wD18QEAmpPtZJXt/wAJ8gEAISL///jc/wAX8gEA9ufc3BQ8/wAk8gEAf///AP///wAu8gEAqv+LAACL/wA88gEAf/+LAIuL/wBK8gEAHu+4uIYL/wBd8gEAAACpqamp/wBr8gEAVf9kAGQA/wB68gEAAACpqamp/wCI8gEAJ269vbdr/wCX8gEA1P+LiwCL/wCo8gEAOo5rVWsv/wC88gEAF////4wA/wDM8gEAxsDMmTLM/wDc8gEAAP+LiwAA/wDp8gEACnnp6ZZ6/wD58gEAVT28j7yP/wAL8wEAr4+LSD2L/wAe8wEAf2dPL09P/wAx8wEAf2dPL09P/wBE8wEAgP/RAM7R/wBX8wEAx//TlADT/wBn8wEA6Ov//xST/wB18wEAiv//AL///wCG8wEAAABpaWlp/wCT8wEAAABpaWlp/wCg8wEAlOH/HpD//wCw8wEAAM6ysiIi/wC/8wEAHA////rw/wDQ8wEAVcCLIosi/wDh8wEA1P///wD//wDu8wEAAADc3Nzc/wD98wEAqgf/+Pj//wAN9AEAI////9cA/wAX9AEAHtna2qUg/wAm9AEAAACAgICA/wAw9AEAVf+AAIAA/wA79AEAO9D/rf8v/wBM9AEAAACAgICA/wBW9AEAVQ//8P/w/wBk9AEA6Zb//2m0/wBx9AEAAIzNzVxc/wCA9AEAwv+CSwCC/wCM9AEAKg/////w/wCX9AEAJmrw8OaM/wCi9AEAqhT65ub6/wCw9AEA8A////D1/wDD9AEAQP/8fPwA/wDS9AEAJjH///rN/wDk9AEAiT/mrdjm/wDz9AEAAHfw8ICA/wAD9QEAfx//4P///wAS9QEAKij6+vrS/wAs9QEAAADT09PT/wA79QEAVWTukO6Q/wBL9QEAAADT09PT/wBa9QEA+En//7bB/wBp9QEADIT//6B6/wB69QEAfdGyILKq/wCN9QEAj3X6h876/wCf9QEAlDiZd4iZ/wCz9QEAlDiZd4iZ/wDH9QEAlzTesMTe/wDb9QEAKh/////g/wDs9QEAVf//AP8A/wD29QEAVcDNMs0y/wAF9gEAFRT6+vDm/wAQ9gEA1P///wD//wAd9gEAAP+AgAAA/wAp9gEAcYDNZs2q/wA/9gEAqv/NAADN/wBP9gEAzJjTulXT/wBh9gEAt3zbk3Db/wBz9gEAZ6mzPLNx/wCH9gEAsI/ue2ju/wCc9gEAb//6APqa/wCz9gEAfafRSNHM/wDI9gEA5OTHxxWF/wDd9gEAqsZwGRlw/wDv9gEAagn/9f/6/wD+9gEABB7//+Th/wAN9wEAGkn//+S1/wAb9wEAGVH//96t/wAs9wEAqv+AAACA/wA29wEAGxf9/fXm/wBD9wEAKv+AgIAA/wBO9wEAOMCOa44j/wBd9wEAG////6UA/wBp9wEAC////0UA/wB49wEA1nva2nDW/wCE9wEAJkju7uiq/wCX9wEAVWT7mPuY/wCm9wEAf0Pur+7u/wC59wEA8Xzb23CT/wDM9wEAGin//+/V/wDc9wEAFEb//9q5/wDr9wEAFLDNzYU//wD19wEA9z///8DL/wD/9wEA1Ebd3aDd/wAJ+AEAhDvmsODm/wAZ+AEA1P+AgACA/wAl+AEAAP///wAA/wAu+AEAAD28vI+P/wA9+AEAn7XhQWnh/wBM+AEAEdyLi0UT/wBd+AEABIr6+oBy/wBp+AEAE5r09KRg/wB5+AEAZ6qLLotX/wCH+AEAERD///Xu/wCV+AEADbegoFIt/wCh+AEAAADAwMDA/wCt+AEAi2zrh87r/wC6+AEAr4/NalrN/wDJ+AEAlDiQcICQ/wDY+AEAlDiQcICQ/wDn+AEAAAX///r6/wDx+AEAav//AP9//wAC+QEAkpu0RoK0/wAR+QEAGFTS0rSM/wAa+QEAf/+AAICA/wAk+QEA1B3Y2L/Y/wAx+QEABrj//2NH/wA9+QEAe7bgQODQ/wBM+QEA1HPu7oLu/wBY+QEAG0T19d6z/wBj+QEAAAD//////wBu+QEAAAD19fX1/wB++QEAKv////8A/wCK+QEAOMDNms0y/wCb+QEALUP89/y5/wCk+QEARFvdrd2O/wCt+QEAYrKjMaNU/wC2+QEAKjL////M/wC/+QEAPlXmwuaZ/wDI+QEAVWTGeMZ5/wDR+QEAY7uEI4RD/wDa+QEAKjL////M/wDj+QEAPlXmwuaZ/wDs+QEAVWTGeMZ5/wD1+QEAYrKjMaNU/wD++QEAa/9oAGg3/wAH+gEAKjL////M/wAQ+gEAN1Hw2fCj/wAZ+gEARFvdrd2O/wAi+gEAVWTGeMZ5/wAr+gEAYrKjMaNU/wA0+gEAa/9oAGg3/wA9+gEAKjL////M/wBG+gEAN1Hw2fCj/wBP+gEARFvdrd2O/wBY+gEAVWTGeMZ5/wBh+gEAYJ6rQatd/wBq+gEAY7uEI4RD/wBz+gEAbP9aAFoy/wB8+gEAKhn////l/wCF+gEALUP89/y5/wCO+gEAN1Hw2fCj/wCX+gEARFvdrd2O/wCg+gEAVWTGeMZ5/wCp+gEAYJ6rQatd/wCy+gEAY7uEI4RD/wC7+gEAbP9aAFoy/wDE+gEAKhn////l/wDN+gEALUP89/y5/wDW+gEAN1Hw2fCj/wDf+gEARFvdrd2O/wDo+gEAVWTGeMZ5/wDx+gEAYJ6rQatd/wD6+gEAY7uEI4RD/wAD+wEAa/9oAGg3/wAM+wEAbv9FAEUp/wAV+wEAMUn47fix/wAg+wEAdWHNf827/wAr+wEAkMK4LH+4/wA2+wEAKjL////M/wBB+wEAY0Laodq0/wBM+wEAhKrEQbbE/wBX+wEAlsuoIl6o/wBi+wEAKjL////M/wBt+wEAY0Laodq0/wB4+wEAhKrEQbbE/wCD+wEAkMK4LH+4/wCO+wEApL+UJTSU/wCZ+wEAKjL////M/wCk+wEARTrpx+m0/wCv+wEAdWHNf827/wC6+wEAhKrEQbbE/wDF+wEAkMK4LH+4/wDQ+wEApL+UJTSU/wDb+wEAKjL////M/wDm+wEARTrpx+m0/wDx+wEAdWHNf827/wD8+wEAhKrEQbbE/wAH/AEAi9jAHZHA/wAS/AEAlsuoIl6o/wAd/AEAnueEDCyE/wAo/AEAKib////Z/wAz/AEAMUn47fix/wA+/AEARTrpx+m0/wBJ/AEAdWHNf827/wBU/AEAhKrEQbbE/wBf/AEAi9jAHZHA/wBq/AEAlsuoIl6o/wB1/AEAnueEDCyE/wCA/AEAKib////Z/wCL/AEAMUn47fix/wCW/AEARTrpx+m0/wCh/AEAdWHNf827/wCs/AEAhKrEQbbE/wC3/AEAi9jAHZHA/wDC/AEAlsuoIl6o/wDN/AEApL+UJTSU/wDY/AEAnudYCB1Y/wDj/AEAJUL///e8/wDu/AEAHK/+/sRP/wD5/AEAEO7Z2V8O/wAE/QEAKir////U/wAP/QEAHHD+/tmO/wAa/QEAFtX+/pkp/wAl/QEAD/zMzEwC/wAw/QEAKir////U/wA7/QEAHHD+/tmO/wBG/QEAFtX+/pkp/wBR/QEAEO7Z2V8O/wBc/QEADfiZmTQE/wBn/QEAKir////U/wBy/QEAH23+/uOR/wB9/QEAHK/+/sRP/wCI/QEAFtX+/pkp/wCT/QEAEO7Z2V8O/wCe/QEADfiZmTQE/wCp/QEAKir////U/wC0/QEAH23+/uOR/wC//QEAHK/+/sRP/wDK/QEAFtX+/pkp/wDV/QEAEuns7HAU/wDg/QEAD/zMzEwC/wDr/QEADPeMjC0E/wD2/QEAKhn////l/wAB/gEAJUL///e8/wAM/gEAH23+/uOR/wAX/gEAHK/+/sRP/wAi/gEAFtX+/pkp/wAt/gEAEuns7HAU/wA4/gEAD/zMzEwC/wBD/gEADPeMjC0E/wBO/gEAKhn////l/wBZ/gEAJUL///e8/wBk/gEAH23+/uOR/wBv/gEAHK/+/sRP/wB6/gEAFtX+/pkp/wCF/gEAEuns7HAU/wCQ/gEAD/zMzEwC/wCb/gEADfiZmTQE/wCm/gEADfBmZiUG/wCx/gEAIl///+2g/wC8/gEAGLL+/rJM/wDH/gEABd3w8Dsg/wDS/gEAKk3///+y/wDd/gEAHaL+/sxc/wDo/gEAEcL9/Y08/wDz/gEA/uHj4xoc/wD+/gEAKk3///+y/wAJ/wEAHaL+/sxc/wAU/wEAEcL9/Y08/wAf/wEABd3w8Dsg/wAq/wEA9v+9vQAm/wA1/wEAKk3///+y/wBA/wEAHoj+/tl2/wBL/wEAGLL+/rJM/wBW/wEAEcL9/Y08/wBh/wEABd3w8Dsg/wBs/wEA9v+9vQAm/wB3/wEAKk3///+y/wCC/wEAHoj+/tl2/wCN/wEAGLL+/rJM/wCY/wEAEcL9/Y08/wCj/wEAB9T8/E4q/wCu/wEA/uHj4xoc/wC5/wEA9f+xsQAm/wDE/wEAKjL////M/wDP/wEAIl///+2g/wDa/wEAHoj+/tl2/wDl/wEAGLL+/rJM/wDw/wEAEcL9/Y08/wD7/wEAB9T8/E4q/wAGAAIA/uHj4xoc/wARAAIA9f+xsQAm/wAcAAIAKjL////M/wAnAAIAIl///+2g/wAyAAIAHoj+/tl2/wA9AAIAGLL+/rJM/wBIAAIAEcL9/Y08/wBTAAIAB9T8/E4q/wBeAAIA/uHj4xoc/wBpAAIA9v+9vQAm/wB0AAIA8v+AgAAm/wB/AAIAkw//8Pj//wCJAAIAGCP6+uvX/wCWAAIAFyT//+/b/wCkAAIAFyTu7t/M/wCyAAIAFyTNzcCw/wDAAAIAGCKLi4N4/wDOAAIAcYD/f//U/wDZAAIAcYD/f//U/wDlAAIAcYDudu7G/wDxAAIAcYDNZs2q/wD9AAIAcYCLRYt0/wAJAQIAfw//8P///wAPAQIAfw//8P///wAWAQIAfw/u4O7u/wAdAQIAfw7Nwc3N/wAkAQIAfw6Lg4uL/wArAQIAKhr19fXc/wAxAQIAFzr//+TE/wA4AQIAFzr//+TE/wBAAQIAFzru7tW3/wBIAQIAFjrNzbee/wBQAQIAFzqLi31r/wBiGAIAAAAAAAAA/wBYAQIAGTH//+vN/wBnAQIAqv//AAD//wBsAQIAqv//AAD//wByAQIAqv/uAADu/wB4AQIAqv/NAADN/wB+AQIAqv+LAACL/wCEAQIAwM7iiivi/wCPAQIAAL6lpSoq/wCVAQIAAL///0BA/wCcAQIAAL/u7js7/wCjAQIAAL/NzTMz/wCqAQIAAL6LiyMj/wCxAQIAF2Pe3riH/wC7AQIAF2T//9Ob/wDGAQIAF2Pu7sWR/wDRAQIAF2PNzap9/wDcAQIAF2OLi3NV/wDnAQIAgGegX56g/wDxAQIAg2f/mPX//wD8AQIAg2bujuXu/wAHAgIAg2fNesXN/wASAgIAg2aLU4aL/wAdAgIAP///f/8A/wAoAgIAP///f/8A/wA0AgIAP//udu4A/wBAAgIAP//NZs0A/wBMAgIAP/+LRYsA/wBYAgIAEdrS0mke/wBiAgIAEdv//38k/wBtAgIAEdvu7nYh/wB4AgIAEdrNzWYd/wCDAgIAEdyLi0UT/wCOAgIAC6///39Q/wCUAgIAB6n//3JW/wCbAgIABqnu7mpQ/wCiAgIABqnNzVtF/wCpAgIABqiLiz4v/wCwAgIAmpPtZJXt/wC/AgIAISL///jc/wDIAgIAISL///jc/wDSAgIAIiPu7ujN/wDcAgIAIiLNzcix/wDmAgIAIyKLi4h4/wDwAgIA9ufc3BQ8/wD4AgIAf///AP///wD9AgIAf///AP///wADAwIAf//uAO7u/wAJAwIAf//NAM3N/wAPAwIAf/+LAIuL/wAVAwIAHu+4uIYL/wAjAwIAHvD//7kP/wAyAwIAHvDu7q0O/wBBAwIAHvDNzZUM/wBQAwIAHvCLi2UI/wBfAwIAVf9kAGQA/wBpAwIAJ269vbdr/wBzAwIAOo5rVWsv/wCCAwIAOo//yv9w/wCSAwIAOo/uvO5o/wCiAwIAOo/Nos1a/wCyAwIAOo+Lbos9/wDCAwIAF////4wA/wDNAwIAFf///38A/wDZAwIAFf/u7nYA/wDlAwIAFf/NzWYA/wDxAwIAFf+Li0UA/wD9AwIAxsDMmTLM/wAIBAIAxsH/vz7//wAUBAIAxsDusjru/wAgBAIAxsDNmjLN/wAsBAIAxsCLaCKL/wA4BAIACnnp6ZZ6/wBDBAIAVT28j7yP/wBQBAIAVT7/wf/B/wBeBAIAVT7utO60/wBsBAIAVT7Nm82b/wB6BAIAVT6LaYtp/wCIBAIAr4+LSD2L/wCWBAIAf2dPL09P/wCkBAIAf2j/l////wCzBAIAf2fuje7u/wDCBAIAf2jNec3N/wDRBAIAf2iLUouL/wDgBAIAf2dPL09P/wDuBAIAgP/RAM7R/wD8BAIAx//TlADT/wAHBQIA6Ov//xST/wAQBQIA6Ov//xST/wAaBQIA6Ovu7hKJ/wAkBQIA6OvNzRB2/wAuBQIA5+yLiwpQ/wA4BQIAiv//AL///wBEBQIAiv//AL///wBRBQIAiv/uALLu/wBeBQIAiv/NAJrN/wBrBQIAiv+LAGiL/wB4BQIAAABpaWlp/wCABQIAAABpaWlp/wCIBQIAlOH/HpD//wCTBQIAlOH/HpD//wCfBQIAlOHuHIbu/wCrBQIAlOHNGHTN/wC3BQIAlOGLEE6L/wDDBQIAAM6ysiIi/wDNBQIAAM///zAw/wDYBQIAAM/u7iws/wDjBQIAAM/NzSYm/wDuBQIAAM+Lixoa/wD5BQIAHA////rw/wAFBgIAVcCLIosi/wARBgIAAADc3Nzc/wAbBgIAqgf/+Pj//wAmBgIAI////9cA/wArBgIAI////9cA/wAxBgIAI//u7skA/wA3BgIAI//Nza0A/wA9BgIAI/+Li3UA/wBDBgIAHtna2qUg/wBNBgIAHtr//8El/wBYBgIAHtru7rQi/wBjBgIAHtrNzZsd/wBuBgIAHtqLi2kU/wB5BgIAAADAwMDA/wB+BgIAAAAAAAAA/wCEBgIAAAADAwMD/wCKBgIAAAAaGhoa/wCRBgIAAAD//////wCZBgIAAAAcHBwc/wCgBgIAAAAfHx8f/wCnBgIAAAAhISEh/wCuBgIAAAAkJCQk/wC1BgIAAAAmJiYm/wC8BgIAAAApKSkp/wDDBgIAAAArKysr/wDKBgIAAAAuLi4u/wDRBgIAAAAwMDAw/wDYBgIAAAAFBQUF/wDeBgIAAAAzMzMz/wDlBgIAAAA2NjY2/wDsBgIAAAA4ODg4/wDzBgIAAAA7Ozs7/wD6BgIAAAA9PT09/wABBwIAAABAQEBA/wAIBwIAAABCQkJC/wAPBwIAAABFRUVF/wAWBwIAAABHR0dH/wAdBwIAAABKSkpK/wAkBwIAAAAICAgI/wAqBwIAAABNTU1N/wAxBwIAAABPT09P/wA4BwIAAABSUlJS/wA/BwIAAABUVFRU/wBGBwIAAABXV1dX/wBNBwIAAABZWVlZ/wBUBwIAAABcXFxc/wBbBwIAAABeXl5e/wBiBwIAAABhYWFh/wBpBwIAAABjY2Nj/wBwBwIAAAAKCgoK/wB2BwIAAABmZmZm/wB9BwIAAABpaWlp/wCEBwIAAABra2tr/wCLBwIAAABubm5u/wCSBwIAAABwcHBw/wCZBwIAAABzc3Nz/wCgBwIAAAB1dXV1/wCnBwIAAAB4eHh4/wCuBwIAAAB6enp6/wC1BwIAAAB9fX19/wC8BwIAAAANDQ0N/wDCBwIAAAB/f39//wDJBwIAAACCgoKC/wDQBwIAAACFhYWF/wDXBwIAAACHh4eH/wDeBwIAAACKioqK/wDlBwIAAACMjIyM/wDsBwIAAACPj4+P/wDzBwIAAACRkZGR/wD6BwIAAACUlJSU/wABCAIAAACWlpaW/wAICAIAAAAPDw8P/wAOCAIAAACZmZmZ/wAVCAIAAACcnJyc/wAcCAIAAACenp6e/wAjCAIAAAChoaGh/wAqCAIAAACjo6Oj/wAxCAIAAACmpqam/wA4CAIAAACoqKio/wA/CAIAAACrq6ur/wBGCAIAAACtra2t/wBNCAIAAACwsLCw/wBUCAIAAAASEhIS/wBaCAIAAACzs7Oz/wBhCAIAAAC1tbW1/wBoCAIAAAC4uLi4/wBvCAIAAAC6urq6/wB2CAIAAAC9vb29/wB9CAIAAAC/v7+//wCECAIAAADCwsLC/wCLCAIAAADExMTE/wCSCAIAAADHx8fH/wCZCAIAAADJycnJ/wCgCAIAAAAUFBQU/wCmCAIAAADMzMzM/wCtCAIAAADPz8/P/wC0CAIAAADR0dHR/wC7CAIAAADU1NTU/wDCCAIAAADW1tbW/wDJCAIAAADZ2dnZ/wDQCAIAAADb29vb/wDXCAIAAADe3t7e/wDeCAIAAADg4ODg/wDlCAIAAADj4+Pj/wDsCAIAAAAXFxcX/wDyCAIAAADl5eXl/wD5CAIAAADo6Ojo/wAACQIAAADr6+vr/wAHCQIAAADt7e3t/wAOCQIAAADw8PDw/wAVCQIAAADy8vLy/wAcCQIAAAD19fX1/wAjCQIAAAD39/f3/wAqCQIAAAD6+vr6/wAxCQIAAAD8/Pz8/wA4CQIAVf//AP8A/wA+CQIAVf//AP8A/wBFCQIAVf/uAO4A/wBMCQIAVf/NAM0A/wBTCQIAVf+LAIsA/wBaCQIAO9D/rf8v/wBmCQIAAADAwMDA/wBrCQIAAAAAAAAA/wBxCQIAAAADAwMD/wB3CQIAAAAaGhoa/wB+CQIAAAD//////wCGCQIAAAAcHBwc/wCNCQIAAAAfHx8f/wCUCQIAAAAhISEh/wCbCQIAAAAkJCQk/wCiCQIAAAAmJiYm/wCpCQIAAAApKSkp/wCwCQIAAAArKysr/wC3CQIAAAAuLi4u/wC+CQIAAAAwMDAw/wDFCQIAAAAFBQUF/wDLCQIAAAAzMzMz/wDSCQIAAAA2NjY2/wDZCQIAAAA4ODg4/wDgCQIAAAA7Ozs7/wDnCQIAAAA9PT09/wDuCQIAAABAQEBA/wD1CQIAAABCQkJC/wD8CQIAAABFRUVF/wADCgIAAABHR0dH/wAKCgIAAABKSkpK/wARCgIAAAAICAgI/wAXCgIAAABNTU1N/wAeCgIAAABPT09P/wAlCgIAAABSUlJS/wAsCgIAAABUVFRU/wAzCgIAAABXV1dX/wA6CgIAAABZWVlZ/wBBCgIAAABcXFxc/wBICgIAAABeXl5e/wBPCgIAAABhYWFh/wBWCgIAAABjY2Nj/wBdCgIAAAAKCgoK/wBjCgIAAABmZmZm/wBqCgIAAABpaWlp/wBxCgIAAABra2tr/wB4CgIAAABubm5u/wB/CgIAAABwcHBw/wCGCgIAAABzc3Nz/wCNCgIAAAB1dXV1/wCUCgIAAAB4eHh4/wCbCgIAAAB6enp6/wCiCgIAAAB9fX19/wCpCgIAAAANDQ0N/wCvCgIAAAB/f39//wC2CgIAAACCgoKC/wC9CgIAAACFhYWF/wDECgIAAACHh4eH/wDLCgIAAACKioqK/wDSCgIAAACMjIyM/wDZCgIAAACPj4+P/wDgCgIAAACRkZGR/wDnCgIAAACUlJSU/wDuCgIAAACWlpaW/wD1CgIAAAAPDw8P/wD7CgIAAACZmZmZ/wACCwIAAACcnJyc/wAJCwIAAACenp6e/wAQCwIAAAChoaGh/wAXCwIAAACjo6Oj/wAeCwIAAACmpqam/wAlCwIAAACoqKio/wAsCwIAAACrq6ur/wAzCwIAAACtra2t/wA6CwIAAACwsLCw/wBBCwIAAAASEhIS/wBHCwIAAACzs7Oz/wBOCwIAAAC1tbW1/wBVCwIAAAC4uLi4/wBcCwIAAAC6urq6/wBjCwIAAAC9vb29/wBqCwIAAAC/v7+//wBxCwIAAADCwsLC/wB4CwIAAADExMTE/wB/CwIAAADHx8fH/wCGCwIAAADJycnJ/wCNCwIAAAAUFBQU/wCTCwIAAADMzMzM/wCaCwIAAADPz8/P/wChCwIAAADR0dHR/wCoCwIAAADU1NTU/wCvCwIAAADW1tbW/wC2CwIAAADZ2dnZ/wC9CwIAAADb29vb/wDECwIAAADe3t7e/wDLCwIAAADg4ODg/wDSCwIAAADj4+Pj/wDZCwIAAAAXFxcX/wDfCwIAAADl5eXl/wDmCwIAAADo6Ojo/wDtCwIAAADr6+vr/wD0CwIAAADt7e3t/wD7CwIAAADw8PDw/wACDAIAAADy8vLy/wAJDAIAAAD19fX1/wAQDAIAAAD39/f3/wAXDAIAAAD6+vr6/wAeDAIAAAD8/Pz8/wAlDAIAVQ//8P/w/wAuDAIAVQ//8P/w/wA4DAIAVQ/u4O7g/wBCDAIAVQ7Nwc3B/wBMDAIAVQ6Lg4uD/wBWDAIA6Zb//2m0/wBeDAIA6pH//260/wBnDAIA643u7mqn/wBwDAIA7IfNzWCQ/wB5DAIA6pSLizpi/wCCDAIAAIzNzVxc/wCMDAIAAJT//2pq/wCXDAIAAJTu7mNj/wCiDAIAAJXNzVVV/wCtDAIAAJSLizo6/wC4DAIAwv+CSwCC/wC/DAIAKgD////+AADFDAIAKg/////w/wDLDAIAKg/////w/wDSDAIAKg/u7u7g/wDZDAIAKg7Nzc3B/wDgDAIAKg6Li4uD/wDnDAIAJmrw8OaM/wDtDAIAJ3D///aP/wD0DAIAJ3Du7uaF/wD7DAIAJ2/NzcZz/wACDQIAJ2+Li4ZO/wAJDQIAqhT65ub6/wASDQIA8A////D1/wAgDQIA8A////D1/wAvDQIA7w/u7uDl/wA+DQIA8A7NzcHF/wBNDQIA7w6Li4OG/wBcDQIAQP/8fPwA/wBmDQIAJjH///rN/wBzDQIAJjH///rN/wCBDQIAJTLu7um//wCPDQIAJjHNzcml/wCdDQIAJzGLi4lw/wCrDQIAiT/mrdjm/wC1DQIAikD/v+///wDADQIAikDust/u/wDLDQIAij/NmsDN/wDWDQIAiUCLaIOL/wDhDQIAAHfw8ICA/wDsDQIAfx//4P///wD2DQIAfx//4P///wABDgIAfx/u0e7u/wAMDgIAfx/NtM3N/wAXDgIAfx+LeouL/wAiDgIAI3Pu7t2C/wAxDgIAI3T//+yL/wBBDgIAI3Pu7tyC/wBRDgIAI3PNzb5w/wBhDgIAI3OLi4FM/wBxDgIAKij6+vrS/wCGDgIAAADT09PT/wCQDgIAAADT09PT/wCaDgIA+En//7bB/wCkDgIA+VH//665/wCvDgIA+FHu7qKt/wC6DgIA+VDNzYyV/wDFDgIA+VCLi19l/wDQDgIADIT//6B6/wDcDgIADIT//6B6/wDpDgIAC4Tu7pVy/wD2DgIADIXNzYFi/wADDwIADIWLi1dC/wAQDwIAfdGyILKq/wAeDwIAj3X6h876/wArDwIAj0//sOL//wA5DwIAj0/upNPu/wBHDwIAjk/NjbbN/wBVDwIAj06LYHuL/wBjDwIAr4//hHD//wByDwIAlDiZd4iZ/wCBDwIAlDiZd4iZ/wCQDwIAlzTesMTe/wCfDwIAlzX/yuH//wCvDwIAlzXuvNLu/wC/DwIAlzXNorXN/wDPDwIAljWLbnuL/wDfDwIAKh/////g/wDrDwIAKh/////g/wD4DwIAKh/u7u7R/wAFEAIAKh/Nzc20/wASEAIAKh+Li4t6/wAfEAIAVcDNMs0y/wApEAIAFRT6+vDm/wAvEAIA1P///wD//wA3EAIA1P///wD//wBAEAIA1P/u7gDu/wBJEAIA1P/NzQDN/wBSEAIA1P+LiwCL/wBbEAIA77mwsDBg/wBiEAIA5Mv//zSz/wBqEAIA5Mvu7jCn/wByEAIA5MzNzSmQ/wB6EAIA5MuLixxi/wCCEAIAcYDNZs2q/wCTEAIAqv/NAADN/wCeEAIAzJjTulXT/wCrEAIAy5n/4Gb//wC5EAIAy5nu0V/u/wDHEAIAy5nNtFLN/wDVEAIAy5qLejeL/wDjEAIAt3zbk3Db/wDwEAIAt33/q4L//wD+EAIAt33un3nu/wAMEQIAt33NiWjN/wAaEQIAt3yLXUeL/wAoEQIAZ6mzPLNx/wA3EQIAsI/ue2ju/wBHEQIAb//6APqa/wBZEQIAfafRSNHM/wBpEQIA5OTHxxWF/wB5EQIAqsZwGRlw/wCGEQIAagn/9f/6/wCQEQIABB7//+Th/wCaEQIABB7//+Th/wClEQIABB7u7tXS/wCwEQIAAx3Nzbe1/wC7EQIABR2Li317/wDGEQIAGkn//+S1/wDPEQIAGVH//96t/wDbEQIAGVH//96t/wDoEQIAGVLu7s+h/wD1EQIAGVLNzbOL/wACEgIAGVKLi3le/wAPEgIAqv+AAACA/wAUEgIAqv+AAACA/wAdEgIAKgD////+AAAiEgIAGxf9/fXm/wAqEgIAOMCOa44j/wA0EgIAOMH/wP8+/wA/EgIAOMDus+46/wBKEgIAOMDNms0y/wBVEgIAOMCLaYsi/wBgEgIAG////6UA/wBnEgIAG////6UA/wBvEgIAG//u7poA/wB3EgIAG//NzYUA/wB/EgIAG/+Li1oA/wCHEgIAC////0UA/wCREgIAC////0UA/wCcEgIAC//u7kAA/wCnEgIAC//NzTcA/wCyEgIAC/+LiyUA/wC9EgIA1nva2nDW/wDEEgIA1nz//4P6/wDMEgIA1nzu7nrp/wDUEgIA1nzNzWnJ/wDcEgIA1XyLi0eJ/wDkEgIAJkju7uiq/wDyEgIAVWT7mPuY/wD8EgIAVWX/mv+a/wAHEwIAVWTukO6Q/wASEwIAVWTNfM18/wAdEwIAVWSLVItU/wAoEwIAf0Pur+7u/wA2EwIAf0T/u////wBFEwIAf0Turu7u/wBUEwIAf0TNls3N/wBjEwIAf0OLZouL/wByEwIA8Xzb23CT/wCAEwIA8X3//4Kr/wCPEwIA8X3u7nmf/wCeEwIA8X3NzWiJ/wCtEwIA8XyLi0dd/wC8EwIAGin//+/V/wDHEwIAFEb//9q5/wDREwIAFEb//9q5/wDcEwIAE0Xu7sut/wDnEwIAE0XNza+V/wDyEwIAFEWLi3dl/wD9EwIAFLDNzYU//wACFAIA9z///8DL/wAHFAIA9Un//7XF/wANFAIA9Unu7qm4/wATFAIA9UrNzZGe/wAZFAIA9UmLi2Ns/wAfFAIA1Ebd3aDd/wAkFAIA1ET//7v//wAqFAIA1ETu7q7u/wAwFAIA1ETNzZbN/wA2FAIA1EOLi2aL/wA8FAIAhDvmsODm/wBHFAIAxN3woCDw/wBOFAIAv8//mzD//wBWFAIAwM/ukSzu/wBeFAIAwM/NfSbN/wBmFAIAwM+LVRqL/wBuFAIAAP///wAA/wByFAIAAP///wAA/wB3FAIAAP/u7gAA/wB8FAIAAP/NzQAA/wCBFAIAAP+LiwAA/wCGFAIAAD28vI+P/wCQFAIAAD7//8HB/wCbFAIAAD7u7rS0/wCmFAIAAD7NzZub/wCxFAIAAD6Li2lp/wC8FAIAn7XhQWnh/wDGFAIAn7f/SHb//wDRFAIAn7fuQ27u/wDcFAIAn7bNOl/N/wDnFAIAn7eLJ0CL/wDyFAIAEdyLi0UT/wD+FAIABIr6+oBy/wAFFQIACZb//4xp/wANFQIACZbu7oJi/wAVFQIACZbNzXBU/wAdFQIACZaLi0w5/wAlFQIAE5r09KRg/wAwFQIAZ6qLLotX/wA5FQIAZ6v/VP+f/wBDFQIAZ6vuTu6U/wBNFQIAZ6vNQ82A/wBXFQIAZ6qLLotX/wBhFQIAERD///Xu/wBqFQIAERD///Xu/wB0FQIAEhHu7uXe/wB+FQIAEhHNzcW//wCIFQIAEhCLi4aC/wCSFQIADbegoFIt/wCZFQIADbj//4JH/wChFQIADbju7nlC/wCpFQIADbjNzWg5/wCxFQIADbmLi0cm/wC5FQIAi2zrh87r/wDBFQIAkHj/h87//wDKFQIAkHjufsDu/wDTFQIAkHjNbKbN/wDcFQIAkXeLSnCL/wDlFQIAr4/NalrN/wDvFQIAr5D/g2///wD6FQIAr5Duemfu/wAFFgIAr5DNaVnN/wAQFgIAr5CLRzyL/wAbFgIAlDiQcICQ/wAlFgIAlTj/xuL//wAwFgIAlTjuudPu/wA7FgIAlDnNn7bN/wBGFgIAlTiLbHuL/wBRFgIAlDiQcICQ/wBbFgIAAAX///r6/wBgFgIAAAX///r6/wBmFgIAAAXu7unp/wBsFgIAAATNzcnJ/wByFgIAAAOLi4mJ/wB4FgIAav//AP9//wCEFgIAav//AP9//wCRFgIAav/uAO52/wCeFgIAav/NAM1m/wCrFgIAav+LAItF/wC4FgIAkpu0RoK0/wDCFgIAkpz/Y7j//wDNFgIAkpzuXKzu/wDYFgIAkpzNT5TN/wDjFgIAk5uLNmSL/wDuFgIAGFTS0rSM/wDyFgIAFLD//6VP/wD3FgIAFLDu7ppJ/wD8FgIAFLDNzYU//wABFwIAFLCLi1or/wAGFwIA1B3Y2L/Y/wAOFwIA1B7//+H//wAXFwIA1B7u7tLu/wAgFwIA1B3NzbXN/wApFwIA1B2Li3uL/wAyFwIABrj//2NH/wA5FwIABrj//2NH/wBBFwIABrju7lxC/wBJFwIABrjNzU85/wBRFwIABrmLizYm/wCjGAIAKgD////+AABZFwIAe7bgQODQ/wBjFwIAgf//APX//wBuFwIAgf/uAOXu/wB5FwIAgf/NAMXN/wCEFwIAgf+LAIaL/wCPFwIA1HPu7oLu/wCWFwIA49fQ0CCQ/wCgFwIA68H//z6W/wCrFwIA68Du7jqM/wC2FwIA68DNzTJ4/wDBFwIA68CLiyJS/wDMFwIAG0T19d6z/wDSFwIAG0X//+e6/wDZFwIAG0Tu7tiu/wDgFwIAG0TNzbqW/wDnFwIAG0OLi35m/wDuFwIAAAD//////wD0FwIAAAD19fX1/wD/FwIAKv////8A/wAGGAIAKv////8A/wAOGAIAKv/u7u4A/wAWGAIAKv/Nzc0A/wAeGAIAKv+Li4sA/wAmGAIAOMDNms0y/wCaHAIAfywCALYYAgC4GAIAuhgCALwYAgC+GAIAwBgCAMIYAgDEGAIAxhgCAMkYAgDMGAIAzxgCANIYAgDVGAIA2BgCANsYAgDeGAIA4RgCAOQYAgAAAAAABAAAAAQAAAALAAAANgAAABYAAAAAAAAAAAAAAAAAAAAIAAAAEAAAABgAAAAAAAAAAAAAABcAAAAAAAAAAAAAAAAAAAAIAAAAEAAAABgAAAAAAAAAAAAAABgAAAAAAAAAAAAAAAAAAAAIAAAABAAAAAAAAAAAAAAANwAAAAAAAAAAAAAAAAAAAAAAAAAIAAAABAAAAAAAAAAAAAAAOAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAOAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAOAAAAAAAAAAAAAAAAAAAAAAAAADGJQIACQAAAMwlAgAKAAAA1SUCAAsAAAAXJgIADAAAAB0mAgANAAAAIiYCAA4AAADVJQIADwAAAKomAgAQAAAAsSYCABEAAAC5JgIAEgAAAMAmAgATAAAAzCYCABQAAAAXJgIAFQAAANgmAgAWAAAA4CYCABcAAADqJgIAGAAAAPgmAgAZAAAA/yYCABoAAAAEJwIAGwAAAAcnAgAcAAAADCcCAB0AAAAUJwIAHgAAABonAgAfAAAAICcCACAAAAAnJwIAIQAAAC0nAgAhAAAANScCACIAAAA8JwIAIwAAANUlAgAkAAAAsSYCABEAAAC5JgIAEgAAADMpAgAlAAAAwCYCABMAAADMJgIAFAAAABcmAgAVAAAAPikCACYAAADgJgIAFwAAAOomAgAYAAAA+CYCABkAAAD/JgIAGgAAAAQnAgAbAAAABycCABwAAABGKQIAJwAAABQnAgAeAAAAGicCAB8AAAAgJwIAIAAAACcnAgAhAAAALScCACEAAAA1JwIAIgAAADwnAgAjAAAAGQAAABoAAAAbAAAAHAAAAB0AAAAeAAAAHwAAACgAAAApAAAAIAAAACoAAAAMAAAAGQAAACEAAAAEAAAABQAAAAEAAAAAAAAAAAAAAAAAAAAAFQoAAAkAAAAAAAAAAAAAAAAAAAAAAAAVEAwTHB4DDR8gISIjGxoRGRkZGRkZGRkZGRYSAg4LDxwYGBgYGBgWFhYWFhYWFhYWFhYWFhYWFhYWFhQcBBwWHBgYGBgYGBYWFhYWFhYWFhYWFhYWFhYWFhYWHCQcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwWHBwcHBwcHBwcHBYcGhwcFhwcHBwcFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYcFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhwWFhYWFhYWFgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA//////////////////////////////////////////8AAAAAAAAABP7//4f+//8HAAAAAAAAAAD//3////9///////////N//v3//////3///////////w/g/////zH8////AAAAAAAAAP//////////////AQD4AwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQNf///v/////f39U/f8PAP7f///////////+3/////8DAP///////58Z////zz8DAAAAAAAA/v///38C/v///38AAAAAAAAAAAD///8HBwAAAAAA/v//B/4HAAAAAP7//////////3z/fy8AYAAAAOD///////8jAAAA/wMAAADgn/n///3FAwAAALADAAMA4If5///9bQMAAABeAAAcAOCv+////e0jAAAAAAEAAADgn/n///3NIwAAALADAAAA4Mc91hjHvwMAAAAAAAAAAODf/f///e8DAAAAAAMAAADg3/3///3vAwAAAEADAAAA4N/9///9/wMAAAAAAwAAAAAAAAAAAAAAAAAAAAAAAAD+/////38NAD8AAAAAAAAAliXw/q5sDSAfAAAAAAAAAAAAAAAAAAAA//7///8DAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD/////PwD/////fwDt2gcAAAAAUAFQMYKrYiwAAAAAQADJgPUHAAAAAAgBAv////////////////////////8P//////////////8D//8/P/////8/P/+q////P////////99f3B/PD/8f3B8AAAAAQEwAAAAAAAAAAAAABwAAAAAAAAAAAAAAAAAAAIAAAAD+AwAA/v///////////x8A/v////////////8H4P////8fAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD//////////////////////////z8AAAAAAAAAAAAAAP//////////////////////////DwAAAAAAAAAAAAAAAAAAAABg/wf+//+H/v//BwAAAAAAAIAA//9/////f/////8AAAAAAAAA//////////////8BAPgDAAMAAAAAAP//////////PwAAAAMAAADA1///+/////9/f1T9/w8A/t////////////7f/////3sA////////nxn////PPwMAAAAAAAD+////fwL+////fwD+//v//7sWAP///wcHAAAAAAD+//8H//8HAP8D////////////fP9/7///Pf8D7v////////P/Px7/z/8AAO6f+f///cXTnzmAsM//AwDkh/n///1t04c5AF7A/x8A7q/7///97fO/OwAAwf8AAO6f+f///c3zjznAsMP/AADsxz3WGMe/w8c9gACA/wAA7t/9///978PfPWAAw/8AAOzf/f///e/D3z1gQMP/AADs3/3///3/w889gADD/wAAAAAAAAAAAAAAAAAAAAAAAP7/////f/8H/3//AwAAAACWJfD+rmz/O18//wMAAAAAAAAAA/8DoML//v///wP+/98Pv/7/P/4CAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAP8fAgAAAKAAAAD+/z4A/v///////////x9m/v////////////93GQAAABoAAAAbAAAAHAAAAB0AAAAeAAAAHwAAACgAAAApAAAAIAAAACoAAAAMAAAAGQAAACEAAAAGAAAABwAAAAEAAAABAAAAAAAAAAAAAAAAFQoAABUAAAAAAAAAAAAAAAAAAAAAAAAVEAwTHB4DDR8gISIjGxoRGRkZGRkZGRkZGRYSAg4LDxwYGBgYGBgWFhYWFhYWFhYWFhYWFhYWFhYWFhQcBBwWHBgYGBgYGBYWFhYWFhYWFhYWFhYWFhYWFhYWHCQcHBwICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgIBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUGBgYGBgYGBgYGBgYGBgYGBwcHBwcAAAAAAAAAAAABASsAAAAsAAAALQAAAC4AAAAvAAAALQAAADAAAAAxAAAAMgAAABkAAAAaAAAAGwAAABwAAAAdAAAAHgAAAB8AAAAoAAAAKQAAACAAAAAqAAAADAAAABkAAAAhAAAABgAAAAcAAAABAAAAAQAAAAAAAAAAAAAAABUKAAAJAAAAAAAAAAAAAAAAAAAAAAAAFRAMExweAw0fICEiIxsaERkZGRkZGRkZGRkWEgIOCw8cGBgYGBgYFhYWFhYWFhYWFhYWFhYWFhYWFhYUHAQcFhwYGBgYGBgWFhYWFhYWFhYWFhYWFhYWFhYWFhwkHBwcCAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBgYGBgYGBgYGBgYGBgYGBgcHBwcHAAAAAAAAAAAAAQErAAAALAAAAC0AAAAuAAAALwAAAC0AAAAwAAAAMQAAADIAAAAA3QAAYOYAANjkAADM5wAAzOcAADjpAADY5AAAGQAAABoAAAAbAAAAHAAAAB0AAAAeAAAAHwAAACgAAAApAAAAIAAAACoAAAAMAAAAGQAAACEAAAAIAAAABQAAAAEAAAABAAAAAAAAAAAAAAAAFQoAAAkAAAAAAAAAAAAAAAAAAAAAAAAVEAwTHB4DDR8gISIjGxoRGRkZGRkZGRkZGRYSAg4LDxwYGBgYGBgWFhYWFhYWFhYWFhYWFhYWFhYWFhQcBBwWHBgYGBgYGBYWFhYWFhYWFhYWFhYWFhYWFhYWHCQcHBwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACIAAAAjAAAAJAAAACUAAAAmAAAAJwAAACgAAAAzAAAANAAAACkAAAA1AAAADQAAABoAAAAqAAAACQAAAAoAAAACAAAAAAAAAAAAAAAAAAAAABUKAAAJAAAAAAAAAAAAAAAAAAAAAAAAFRAMExweAw0fICEiIxsaERkZGRkZGRkZGRkWEgIOCw8cGBgYGBgYFhYWFhYWFhYWFhYWFhYWFhYWFhYUHAQcFhwYGBgYGBgWFhYWFhYWFhYWFhYWFhYWFhYWFhwkHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcFhwcHBwcHBwcHBwWHBocHBYcHBwcHBYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWHBYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYcFhYWFhYWFhYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAArAAAALAAAAC0AAAAuAAAALwAAADAAAAAxAAAANgAAADcAAAAyAAAAOAAAAA4AAAAbAAAAMwAAAAsAAAAMAAAAAgAAAAABAAAAAAAAAAAAAAAVCgAACQAAAAAAAAAAAAAAAAAAAAAAABUQDBMcHgMNHyAhIiMbGhEZGRkZGRkZGRkZFhICDgsPHBgYGBgYGBYWFhYWFhYWFhYWFhYWFhYWFhYWFBwEHBYcGBgYGBgYFhYWFhYWFhYWFhYWFhYWFhYWFhYcJBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBYcHBwcHBwcHBwcFhwaHBwWHBwcHBwWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhwWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWHBYWFhYWFhYWAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAz40BALIzAgBTjgEAuzMCAMIzAgDLMwIAGQAAABoAAAAbAAAAHAAAAB0AAAAeAAAAHwAAACgAAAApAAAAIAAAACoAAAAMAAAAGQAAACEAAAAGAAAABwAAAAEAAAABAAAAAAAAAAAAAAAAFQoAABUAAAAAAAAAAAAAAAAAAAAAAAAVEAwTHB4DDR8gISIjGxoRGRkZGRkZGRkZGRcSAg4LDxwYGBgYGBgWFhYWFhYWFhYWFhYWFhYWFhYWFhQcBBwWHBgYGBgYGBYWFhYWFhYWFhYWFhYWFhYWFhYWHCQcHBwICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgIBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUGBgYGBgYGBgYGBgYGBgYGBwcHBwcAAAAAAAAAAAABASsAAAAsAAAALQAAAC4AAAAvAAAALQAAADAAAAAxAAAAMgAAAETsAACw7QAAHO8AAIjwAACI8AAA9PEAABzvAAAZAAAAGgAAABsAAAAcAAAAHQAAAB4AAAAfAAAAKAAAACkAAAAgAAAAKgAAAAwAAAAZAAAAIQAAAAQAAAAFAAAAAQAAAAAAAAAAAAAAAAAAAAAVCgAACQAAAAAAAAAAAAAAAAAAAAAAABUQDBMcHgMNHyAhIiMbGhEZGRkZGRkZGRkZFxICDgsPHBgYGBgYGBYWFhYWFhYWFhYWFhYWFhYWFhYWFBwEHBYcGBgYGBgYFhYWFhYWFhYWFhYWFhYWFhYWFhYcJBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBYcHBwcHBwcHBwcFhwaHBwWHBwcHBwWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhwWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWHBYWFhYWFhYWAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAGQAAABoAAAAbAAAAHAAAAB0AAAAeAAAAHwAAACgAAAApAAAAIAAAACoAAAAMAAAAGQAAACEAAAAIAAAABQAAAAEAAAABAAAAAAAAAAAAAAAAFQoAAAkAAAAAAAAAAAAAAAAAAAAAAAAVEAwTHB4DDR8gISIjGxoRGRkZGRkZGRkZGRcSAg4LDxwYGBgYGBgWFhYWFhYWFhYWFhYWFhYWFhYWFhQcBBwWHBgYGBgYGBYWFhYWFhYWFhYWFhYWFhYWFhYWHCQcHBwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABkAAAAaAAAAGwAAABwAAAAdAAAAHgAAAB8AAAAoAAAAKQAAACAAAAAqAAAADAAAABkAAAAhAAAABgAAAAcAAAABAAAAAQAAAAAAAAAAAAAAABUKAAAJAAAAAAAAAAAAAAAAAAAAAAAAFRAMExweAw0fICEiIxsaERkZGRkZGRkZGRkXEgIOCw8cGBgYGBgYFhYWFhYWFhYWFhYWFhYWFhYWFhYUHAQcFhwYGBgYGBgWFhYWFhYWFhYWFhYWFhYWFhYWFhwkHBwcCAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBQUFBgYGBgYGBgYGBgYGBgYGBgcHBwcHAAAAAAAAAAAAAQErAAAALAAAAC0AAAAuAAAALwAAAC0AAAAwAAAAMQAAADIAAAAiAAAAIwAAACQAAAAlAAAAJgAAACcAAAAoAAAAMwAAADQAAAApAAAANQAAAA0AAAAaAAAAKgAAAAkAAAAKAAAAAgAAAAAAAAAAAAAAAAAAAAAVCgAACQAAAAAAAAAAAAAAAAAAAAAAABUQDBMcHgMNHyAhIiMbGhEZGRkZGRkZGRkZFxICDgsPHBgYGBgYGBYWFhYWFhYWFhYWFhYWFhYWFhYWFBwEHBYcGBgYGBgYFhYWFhYWFhYWFhYWFhYWFhYWFhYcJBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBYcHBwcHBwcHBwcFhwaHBwWHBwcHBwWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhwWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWHBYWFhYWFhYWAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAKwAAACwAAAAtAAAALgAAAC8AAAAwAAAAMQAAADYAAAA3AAAAMgAAADgAAAAOAAAAGwAAADMAAAALAAAADAAAAAIAAAAAAQAAAAAAAAAAAAAAFQoAAAkAAAAAAAAAAAAAAAAAAAAAAAAVEAwTHB4DDR8gISIjGxoRGRkZGRkZGRkZGRcSAg4LDxwYGBgYGBgWFhYWFhYWFhYWFhYWFhYWFhYWFhQcBBwWHBgYGBgYGBYWFhYWFhYWFhYWFhYWFhYWFhYWHCQcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwcHBwWHBwcHBwcHBwcHBYcGhwcFhwcHBwcFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYcFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhwWFhYWFhYWFgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAF00AgBjNAIAZjQCAGw0AgAGNAIAczQCAHw0AgCENAIAnPMAABQAAABDLlVURi04AAAAAAAAAAAAAAAAAN4SBJUAAAAA////////////////AgAAwAMAAMAEAADABQAAwAYAAMAHAADACAAAwAkAAMAKAADACwAAwAwAAMANAADADgAAwA8AAMAQAADAEQAAwBIAAMATAADAFAAAwBUAAMAWAADAFwAAwBgAAMAZAADAGgAAwBsAAMAcAADAHQAAwB4AAMAfAADAAAAAswEAAMMCAADDAwAAwwQAAMMFAADDBgAAwwcAAMMIAADDCQAAwwoAAMMLAADDDAAAww0AANMOAADDDwAAwwAADLsBAAzDAgAMwwMADMMEAAzTgPQAAAkAAAAAAAAAAAAAABEAAAAAAAAAAAAAAAAAAAAAAAAADwAAAAAAAAAQAAAA/PkCAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD/////AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA9QAABQAAAAAAAAAAAAAAEQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEQAAABAAAAAE/gIAAAQAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAACv////8AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD1AACE9QAABQAAAAAAAAAAAAAAEQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEgAAABAAAAAMAgMAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAAAAA//////8AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAmOgCAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADAAAABAAAAAQAAAAGAAAAg/miAERObgD8KRUA0VcnAN009QBi28AAPJmVAEGQQwBjUf4Au96rALdhxQA6biQA0k1CAEkG4AAJ6i4AHJLRAOsd/gApsRwA6D6nAPU1ggBEuy4AnOmEALQmcABBfl8A1pE5AFODOQCc9DkAi1+EACj5vQD4HzsA3v+XAA+YBQARL+8AClqLAG0fbQDPfjYACcsnAEZPtwCeZj8ALepfALondQDl68cAPXvxAPc5BwCSUooA+2vqAB+xXwAIXY0AMANWAHv8RgDwq2sAILzPADb0mgDjqR0AXmGRAAgb5gCFmWUAoBRfAI1AaACA2P8AJ3NNAAYGMQDKVhUAyahzAHviYABrjMAAIAAAAAkAAAAKAAAADQAAAAsAAAAMAAAAhQAAAAAgAAABIAAAAiAAAAMgAAAEIAAABSAAAAYgAAAIIAAACSAAAAogAAAoIAAAKSAAAF8gAAAAMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAP//////AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAKAAAAZAAAAOgDAAAQJwAAoIYBAEBCDwCAlpgAAOH1BV9wiQD/CS8PdAAAAP1XAgBuAAAA/1cCAHIAAAABWAIAZgAAAANYAgBhAAAABVgCAGUAAAAHWAIAdwAAAAlYAgBXAAAAFlgCAHMAAAAkWAIAUwAAADBYAgBkAAAAPVgCAEQAAABJWAIAAAAAAAAAAAAAAAAAAAAEAAQAGwAbACAAIAAjACEACgACABYACQAhACEAIQAVABwAAQAUABQAFAAUABQAFAAUAAgABAAFABsAAgAXABsAIAAfAB4AHQAJABMAAAAVABIAFQADAAcAFQAVABQAFAAUABQAFAAUABQAFAAIAAQABQAFAAYAGwAaABgAGQAgAAcAFQAUABQAFAAUABQAFAALABQADQAUAAwAFAAUABQADgAUABQAFAAQABQADwAUABEAAAAAAAAArgAuAC8AMwA1ADAANwCqANsA2wDbANsAAAA9AIcANwA3ANsA2wAAACgANQAuADIALwBiAAAAAABHAAAAAADbAFEAAADbANsA2wAAANsAhABVANsAggDbAAAAgQDbAAAAPgBCAEEASABEAFIAWwAAAAAAXgBfANsAAADbANsA2wAAAAAAewBJAFcAUgBaAFoAXQAAAF8AAABfAAAAZQBdAF8AAABdAG4AagAAAGkAAABuAAAA2wCTAJoAoQCoAKsAcACxALgAvwDGAM0A0wAAAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAMABAAHAAMABAAFAAUABgAGAAgABwAHABEAFgASABEAEgAIAAgADwAPABcADwAYAA8AGQAaABoAHgAWADQAHgAFADIABgAiACIAMwAXABgANQAZABoAGgAqADYAKgA0ADcAMgBFADsAPAAzADsAPABGADUARwBIAEwANgAiAEkASgA3AEUATgBQAGIAUQBSAFQARgBHAFUASABMAFYASQBKAFgAWgBOAEQAUABRAFIAVAA4AC8ALABVACkAVgAbABAAWABaAF0AXQBdAF0AXQBdAF0AXgBeAF4AXgBeAF4AXgBfAF8AXwBfAF8AXwBfAGAACQBgAGAAYABgAGAAYQBhAGMAAgBjAGMAYwBjAGMAZAAAAGQAAABkAGQAZABlAAAAZQBlAGUAZQBlAGYAZgAAAGYAZgBmAGYAZwAAAGcAZwBnAGcAaAAAAGgAaABoAGgAaABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAAAAXAABAF0AXQBeAF4AXwBfAFwAXABcAFwAXABgAFwAXABcAGEAXABcAGIAYgBiAGIAYgBiAGIAYwBkAGUAZgBmAFwAXABnAFwAXABcAGAAXABcAGEAXABhAFwAaABhAFwAYgBiAGIAYgBiAGIAYgBiAGMAZABlAGUAXABmAFwAXABcAGcAaABhAGIAYgBiAGIAYgBiAGIAYgBiAGIAYgBiAGIAYgBiAGIAYgBiAGIAYgBiAGIAYgAAAFwAXABcAFwAXABcAFwAXABcAFwAXABcAAAACgALAAwADQAOAAoADwAQABEAEgATAAoAFAAVABUAFQAWABcAFQAYABUAFQAZABUAFQAVABoAFQAVAAoAFQAVABUAFgAXABgAFQAVABkAFQAVABUAGgAVABUAFQAVABsADAAMACQAHgAeACAAIQAgACEAJAAlACYALQAyAC8ALgAqACUAJgAoACkAMwAqADQAKwA1ADYANwA8ADIARwA9ACIARQAiAD8AQABGADMANABIADUANgA3AC8ASQAqAEcASgBFAEwAXAA8AEYAXAA9AE0ASABOAE8AUgBJAEEAUABRAEoATABTAFQAMQBVAFYAVwBNAE4AWABPAFIAWQBQAFEAWgBbAFMARABUAFUAVgBXAEsARAAsAFgALABZADgALABaAFsAHQAdAB0AHQAdAB0AHQAfAB8AHwAfAB8AHwAfACMAIwAjACMAIwAjACMAJwBcACcAJwAnACcAJwAwADAAOQAcADkAOQA5ADkAOQA6AFwAOgBcADoAOgA6ADsAXAA7ADsAOwA7ADsAPgA+AFwAPgA+AD4APgBCAFwAQgBCAEIAQgBDAFwAQwBDAEMAQwBDAAkAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwACACu/9EACgCu/67/CwCu/67/rv+u/67/rv+u/67/BQDRAK7/0QDRANEA0QDRANEA0QDRAK7/+/+u/w4A7P+u/67/rv+u/9EA0QDRANEA0QANACUADABCABAAUAATAG0AewAUAJgADwCmAMMArv+u/67/rv+u/67/rv+u/67/rv+u/67/rv+u/67/rv+u/67/rv+u/67/rv+u/67/FwCu/3cArv8HAC4Arv8mAK7/FwARACMArv8NAK7/rv+u/67/OgCu/67/NQCu/67/rv8oAK7/BwCu/zsARQCu/0gArv+u/67/rv+u/67/rv/8/+gA9v///xoAAAAnAAEAMgCu/67/AgAkAAMALwCu/67/rv+u/67//v+UAK7/CQAbAK7/vP+u/67/r/+u/67/rv+u/67/rv+u/wAAAAAAAG3m7N4FAAsASQAxAVMAfwEwAWkAeAH/AIEBUwKCAYMBhAGFAYYBVAKHAYgBiQFWAooBVwKLAYwBjgHdAY8BWQKQAVsCkQGSAZMBYAKUAWMClgFpApcBaAKYAZkBnAFvAp0BcgKfAXUCpgGAAqcBqAGpAYMCrAGtAa4BiAKvAbABsQGKArIBiwK3AZICuAG5AbwBvQHEAcYBxAHFAcUBxgHHAckBxwHIAcgByQHKAcwBygHLAcsBzAHxAfMB8QHyAfIB8wH0AfUB9gGVAfcBvwEgAp4BhgOsA4gDrQOJA64DigOvA4wDzAOOA80DjwPOA5kDRQOZA74fowPCA/cD+AP6A/sDYB6bHp4e3wBZH1EfWx9TH10fVR9fH1cfvB+zH8wfwx/sH+Uf/B/zHzoCZSw7AjwCPQKaAT4CZixBAkICQwKAAUQCiQJFAowC9AO4A/kD8gP9A3sD/gN8A/8DfQPABM8EJiHJAyohawArIeUAMiFOIYMhhCFgLGEsYixrAmMsfR1kLH0CbSxRAm4scQJvLFACcCxSAnIscyx1LHYsfiw/An8sQALyLPMsfad5HYunjKeNp2UCqqdmAscQJy3NEC0tdgN3A5wDtQCSA9ADmAPRA6YD1QOgA9YDmgPwA6ED8QOVA/UDzwPXAwAAAABBACAawAAgHwABAS8yAQEFOQEBD0oBAS15AQEFcAMBA5EDIBGjAyAJAARQEBAEICBgBAEhigQBNcEEAQ3QBAE/FAUBEzEFMCagAQEFswEBA80BAQ/eAQER+AEBJyICARHYAwEXAB4BlaAeAV8IH/gIGB/4Bigf+Ag4H/gISB/4Bmgf+AiIH/gImB/4CKgf+Ai4H/gCuh+2AsgfqgTYH/gC2h+cAugf+ALqH5AC+B+AAvofggJGAgEJEAUBA2AhEBAALDAvZywBBYAsAWPrLAEDQKYBLYCmARcipwENMqcBPXmnAQN+pwEJkKcBA6CnAQkh/yAaAAAAAHsgdmFyIHBhdGggPSBQb2ludGVyX3N0cmluZ2lmeSgkMCk7IHZhciBkYXRhID0gUG9pbnRlcl9zdHJpbmdpZnkoJDEpOyBGUy5jcmVhdGVQYXRoKCIvIiwgUEFUSC5kaXJuYW1lKHBhdGgpKTsgRlMud3JpdGVGaWxlKFBBVEguam9pbigiLyIsIHBhdGgpLCBkYXRhKTsgfQBjb3JlAHhkb3R2ZXJzaW9uADEuNwAxLjQAMS4yAF9sZHJhd18AX2hkcmF3XwBfdGRyYXdfAF9obGRyYXdfAF90bGRyYXdfAHhkb3QgdmVyc2lvbiAiJXMiIHRvbyBsb25nACAlZCAAJS4wMmYAJXMlZCAtACMlMDJ4JTAyeCUwMnglMDJ4AHNldGxpbmV3aWR0aCgAJS4zZgBTIABDIAAyIABFIABlIABGIAB0ICV1IABUIABkb3Q6ZG90AGd2OmRvdABjYW5vbjpkb3QAcGxhaW46ZG90AHBsYWluLWV4dDpkb3QAeGRvdDp4ZG90AHhkb3QxLjI6eGRvdAB4ZG90MS40Onhkb3QASSAAIl9zdWJncmFwaF9jbnQiOiAlZAAiX2d2aWQiOiAlZAAiZWRnZXMiOiBbCgAiX2d2aWQiOiAlZCwKACJ0YWlsIjogJWQsCgAiaGVhZCI6ICVkACJvYmplY3RzIjogWwoAIm5vZGVzIjogWwoAIm5hbWUiOiAiJXMiAFwiAFwvAFxiAFxmAFxuAFxyAFx0ACJzdWJncmFwaHMiOiBbCgAiJXMiOiAAIiVzIgBDb3VsZCBub3QgcGFyc2UgeGRvdCAiJXMiCgBbCgAib3AiOiAiJWMiLAoAInJlY3QiOiBbJS4wM2YsJS4wM2YsJS4wM2YsJS4wM2ZdCgAib3AiOiAiTCIsCgAib3AiOiAiVCIsCgAicHQiOiBbJS4wM2YsJS4wM2ZdLAoAImFsaWduIjogIiVjIiwKACJ3aWR0aCI6ICUuMDNmLAoAInRleHQiOiAiJXMiCgAiZ3JhZCI6ICJub25lIiwKACJjb2xvciI6ICIlcyIKACJncmFkIjogImxpbmVhciIsCgAiZ3JhZCI6ICJyYWRpYWwiLAoAIm9wIjogIkYiLAoAInNpemUiOiAlLjAzZiwKACJmYWNlIjogIiVzIgoAIm9wIjogIlMiLAoAInN0eWxlIjogIiVzIgoAIm9wIjogInQiLAoAImZvbnRjaGFyIjogJWQKACJwMCI6IFslLjAzZiwlLjAzZiwlLjAzZl0sCgAicDEiOiBbJS4wM2YsJS4wM2YsJS4wM2ZdLAoAInN0b3BzIjogWwB7ImZyYWMiOiAlLjAzZiwgImNvbG9yIjogIiVzIn0AXQoAInAwIjogWyUuMDNmLCUuMDNmXSwKACJwMSI6IFslLjAzZiwlLjAzZl0sCgAicG9pbnRzIjogWwBbJS4wM2YsJS4wM2ZdAGRyYXdfAGxkcmF3XwBoZHJhd18AdGRyYXdfAGhsZHJhd18AdGxkcmF3XwAiZGlyZWN0ZWQiOiAlcywKACJzdHJpY3QiOiAlcwBEdXBsaWNhdGUgY2x1c3RlciBuYW1lICIlcyIKAHhkb3QAanNvbgBqc29uMABkb3RfanNvbgB4ZG90X2pzb24AanNvbjpqc29uAGpzb24wOmpzb24AZG90X2pzb246anNvbgB4ZG90X2pzb246anNvbgBuID49IDQAZ3ZyZW5kZXJfY29yZV9maWcuYwBmaWdfYmV6aWVyAGZpZ19yZXNvbHZlX2NvbG9yAGZpZwBmaWc6ZmlnAG1hcAByZWN0ICVzICVkLCVkICVkLCVkCgBjaXJjbGUgJXMgJWQsJWQsJWQKAHBvbHkgJXMAICVkLCVkAGd2cmVuZGVyX2NvcmVfbWFwLmMAbWFwX291dHB1dF9zaGFwZQByZWN0YW5nbGUgKCVkLCVkKSAoJWQsJWQpICVzICVzCgA8YXJlYSBzaGFwZT0iY2lyY2xlIgA8YXJlYSBzaGFwZT0icmVjdCIAPGFyZWEgc2hhcGU9InBvbHkiACBocmVmPSIAIHRpdGxlPSIAIGFsdD0iIgAgY29vcmRzPSIAJWQsJWQsJWQAJWQsJWQsJWQsJWQAJWQsJWQALCVkLCVkACI+CgA8L21hcD4KAGJhc2UgcmVmZXJlcgoAZGVmYXVsdCAAPG1hcCBpZD0iACIgbmFtZT0iAGlzbWFwOm1hcABjbWFwOm1hcABpbWFwOm1hcABjbWFweDptYXAAaW1hcF9ucDptYXAAY21hcHhfbnA6bWFwACMgJXMKACVkICVkICVkICVkICVkICVkICVkICVkICVkICUuMWYgJWQgJWQgJWQgJWQgJWQgJWQKACVkICVkICVkICVkICVkICVkICVkICVkICVkICUuMWYgJWQgJWQgJWQgJWQKACVkICVkICVkICVkICVkICVkICVkICVkICVkICUuM2YgJWQgJS40ZiAlZCAlZCAlZCAlZCAlZCAlZCAlZCAlZAoAJWQgJWQgIyUwMnglMDJ4JTAyeAoAZ3ZyZW5kZXJfY29yZV9tcC5jAG1wX3Jlc29sdmVfY29sb3IAJWQgJWQgJWQgJWQgJWQgJWQgJS4xZiAlLjRmICVkICUuMWYgJS4xZiAlZCAlZCAlc1wwMDEKACMgZW5kIG9mIEZJRyBmaWxlCgAjRklHIDMuMgoAIyBHZW5lcmF0ZWQgYnkgJXMgdmVyc2lvbiAlcyAoJXMpCgAjIFRpdGxlOiAlcwoAIyBQYWdlczogJWQKAFBvcnRyYWl0CgBDZW50ZXIKAEluY2hlcwoATGV0dGVyCgAxMDAuMDAKAFNpbmdsZQoALTIKADEyMDAAIDIKAG1wAG1wOm1wACBdICAlZCB0cnVlICVzCgAgXSAgJWQgZmFsc2UgJXMKACBzZXRsaW5ld2lkdGgKACVzIABzZXRoc2IAJS41ZyAlLjVnICUuNWcgJXNjb2xvcgoAJSAAbmV3cGF0aCAAIG1vdmV0bwoAIGxpbmV0bwoAc3Ryb2tlCgAgY3VydmV0bwoAY2xvc2VwYXRoIGZpbGwKAGNsb3NlcGF0aCBzdHJva2UKACBlbGxpcHNlX3BhdGggZmlsbAoAIGVsbGlwc2VfcGF0aCBzdHJva2UKACAvJXMgc2V0X2ZvbnQKACBtb3ZldG8gACAlcyBhbGlnbmVkdGV4dAoAWyAvUmVjdCBbIAAgXQoAICAvQm9yZGVyIFsgMCAwIDAgXQogIC9BY3Rpb24gPDwgL1N1YnR5cGUgL1VSSSAvVVJJICVzID4+CiAgL1N1YnR5cGUgL0xpbmsKL0FOTiBwZGZtYXJrCgBnc2F2ZQoAJSUgJXMKADAgMCAwIGVkZ2Vjb2xvcgoAZW5kcGFnZQpzaG93cGFnZQpncmVzdG9yZQoAJSVQYWdlVHJhaWxlcgoAJSUlJUVuZFBhZ2U6ICVkCgAlJSUlUGFnZTogJWQgJWQKACUlJSVQYWdlQm91bmRpbmdCb3g6ICVkICVkICVkICVkCgBMYW5kc2NhcGUAUG9ydHJhaXQAJSUlJVBhZ2VPcmllbnRhdGlvbjogJXMKADw8IC9QYWdlU2l6ZSBbJWQgJWRdID4+IHNldHBhZ2VkZXZpY2UKACVkICVkICVkIGJlZ2lucGFnZQoAZ3NhdmUKJWQgJWQgJWQgJWQgYm94cHJpbSBjbGlwIG5ld3BhdGgKACVnICVnIHNldF9zY2FsZSAlZCByb3RhdGUgJWcgJWcgdHJhbnNsYXRlCgBjYW52YXMgc2l6ZSAoJWQsJWQpIGV4Y2VlZHMgUERGIGxpbWl0ICglZCkKCShzdWdnZXN0IHNldHRpbmcgYSBib3VuZGluZyBib3ggc2l6ZSwgc2VlIGRvdCgxKSkKAFsgL0Nyb3BCb3ggWyVkICVkICVkICVkXSAvUEFHRVMgcGRmbWFyawoAJWQgJWQgc2V0bGF5ZXIKACUlJSVUaXRsZTogJXMKACUlUGFnZXM6IChhdGVuZCkKACUlUGFnZXM6IDEKACUlQm91bmRpbmdCb3g6IChhdGVuZCkKACUlJSVCb3VuZGluZ0JveDogJWQgJWQgJWQgJWQKACUlRW5kQ29tbWVudHMKc2F2ZQoAc2V0dXBMYXRpbjEKAFsge0NhdGFsb2d9IDw8IC9VUkkgPDwgL0Jhc2UgJXMgPj4gPj4KL1BVVCBwZGZtYXJrCgAlJUJlZ2luUHJvbG9nAC9Eb3REaWN0IDIwMCBkaWN0IGRlZgBEb3REaWN0IGJlZ2luAC9zZXR1cExhdGluMSB7AG1hcmsAL0VuY29kaW5nVmVjdG9yIDI1NiBhcnJheSBkZWYAIEVuY29kaW5nVmVjdG9yIDAASVNPTGF0aW4xRW5jb2RpbmcgMCAyNTUgZ2V0aW50ZXJ2YWwgcHV0aW50ZXJ2YWwARW5jb2RpbmdWZWN0b3IgNDUgL2h5cGhlbiBwdXQAJSBTZXQgdXAgSVNPIExhdGluIDEgY2hhcmFjdGVyIGVuY29kaW5nAC9zdGFybmV0SVNPIHsAICAgICAgICBkdXAgZHVwIGZpbmRmb250IGR1cCBsZW5ndGggZGljdCBiZWdpbgAgICAgICAgIHsgMSBpbmRleCAvRklEIG5lIHsgZGVmIH17IHBvcCBwb3AgfSBpZmVsc2UAICAgICAgICB9IGZvcmFsbAAgICAgICAgIC9FbmNvZGluZyBFbmNvZGluZ1ZlY3RvciBkZWYAICAgICAgICBjdXJyZW50ZGljdCBlbmQgZGVmaW5lZm9udAB9IGRlZgAvVGltZXMtUm9tYW4gc3Rhcm5ldElTTyBkZWYAL1RpbWVzLUl0YWxpYyBzdGFybmV0SVNPIGRlZgAvVGltZXMtQm9sZCBzdGFybmV0SVNPIGRlZgAvVGltZXMtQm9sZEl0YWxpYyBzdGFybmV0SVNPIGRlZgAvSGVsdmV0aWNhIHN0YXJuZXRJU08gZGVmAC9IZWx2ZXRpY2EtT2JsaXF1ZSBzdGFybmV0SVNPIGRlZgAvSGVsdmV0aWNhLUJvbGQgc3Rhcm5ldElTTyBkZWYAL0hlbHZldGljYS1Cb2xkT2JsaXF1ZSBzdGFybmV0SVNPIGRlZgAvQ291cmllciBzdGFybmV0SVNPIGRlZgAvQ291cmllci1PYmxpcXVlIHN0YXJuZXRJU08gZGVmAC9Db3VyaWVyLUJvbGQgc3Rhcm5ldElTTyBkZWYAL0NvdXJpZXItQm9sZE9ibGlxdWUgc3Rhcm5ldElTTyBkZWYAY2xlYXJ0b21hcmsAfSBiaW5kIGRlZgAlJUJlZ2luUmVzb3VyY2U6IHByb2NzZXQgZ3JhcGh2aXogMCAwAC9jb29yZC1mb250LWZhbWlseSAvVGltZXMtUm9tYW4gZGVmAC9kZWZhdWx0LWZvbnQtZmFtaWx5IC9UaW1lcy1Sb21hbiBkZWYAL2Nvb3JkZm9udCBjb29yZC1mb250LWZhbWlseSBmaW5kZm9udCA4IHNjYWxlZm9udCBkZWYAL0ludlNjYWxlRmFjdG9yIDEuMCBkZWYAL3NldF9zY2FsZSB7ACAgICAgICBkdXAgMSBleGNoIGRpdiAvSW52U2NhbGVGYWN0b3IgZXhjaCBkZWYAICAgICAgIHNjYWxlACUgc3R5bGVzAC9zb2xpZCB7IFtdIDAgc2V0ZGFzaCB9IGJpbmQgZGVmAC9kYXNoZWQgeyBbOSBJbnZTY2FsZUZhY3RvciBtdWwgZHVwIF0gMCBzZXRkYXNoIH0gYmluZCBkZWYAL2RvdHRlZCB7IFsxIEludlNjYWxlRmFjdG9yIG11bCA2IEludlNjYWxlRmFjdG9yIG11bF0gMCBzZXRkYXNoIH0gYmluZCBkZWYAL2ludmlzIHsvZmlsbCB7bmV3cGF0aH0gZGVmIC9zdHJva2Uge25ld3BhdGh9IGRlZiAvc2hvdyB7cG9wIG5ld3BhdGh9IGRlZn0gYmluZCBkZWYAL2JvbGQgeyAyIHNldGxpbmV3aWR0aCB9IGJpbmQgZGVmAC9maWxsZWQgeyB9IGJpbmQgZGVmAC91bmZpbGxlZCB7IH0gYmluZCBkZWYAL3JvdW5kZWQgeyB9IGJpbmQgZGVmAC9kaWFnb25hbHMgeyB9IGJpbmQgZGVmAC90YXBlcmVkIHsgfSBiaW5kIGRlZgAlIGhvb2tzIGZvciBzZXR0aW5nIGNvbG9yIAAvbm9kZWNvbG9yIHsgc2V0aHNiY29sb3IgfSBiaW5kIGRlZgAvZWRnZWNvbG9yIHsgc2V0aHNiY29sb3IgfSBiaW5kIGRlZgAvZ3JhcGhjb2xvciB7IHNldGhzYmNvbG9yIH0gYmluZCBkZWYAL25vcGNvbG9yIHtwb3AgcG9wIHBvcH0gYmluZCBkZWYAL2JlZ2lucGFnZSB7CSUgaSBqIG5wYWdlcwAJL25wYWdlcyBleGNoIGRlZgAJL2ogZXhjaCBkZWYACS9pIGV4Y2ggZGVmAAkvc3RyIDEwIHN0cmluZyBkZWYACW5wYWdlcyAxIGd0IHsACQlnc2F2ZQAJCQljb29yZGZvbnQgc2V0Zm9udAAJCQkwIDAgbW92ZXRvAAkJCShcKCkgc2hvdyBpIHN0ciBjdnMgc2hvdyAoLCkgc2hvdyBqIHN0ciBjdnMgc2hvdyAoXCkpIHNob3cACQlncmVzdG9yZQAJfSBpZgAvc2V0X2ZvbnQgewAJZmluZGZvbnQgZXhjaAAJc2NhbGVmb250IHNldGZvbnQAJSBkcmF3IHRleHQgZml0dGVkIHRvIGl0cyBleHBlY3RlZCB3aWR0aAAvYWxpZ25lZHRleHQgewkJCSUgd2lkdGggdGV4dAAJL3RleHQgZXhjaCBkZWYACS93aWR0aCBleGNoIGRlZgAJZ3NhdmUACQl3aWR0aCAwIGd0IHsACQkJW10gMCBzZXRkYXNoAAkJCXRleHQgc3RyaW5nd2lkdGggcG9wIHdpZHRoIGV4Y2ggc3ViIHRleHQgbGVuZ3RoIGRpdiAwIHRleHQgYXNob3cACQl9IGlmAAlncmVzdG9yZQAvYm94cHJpbSB7CQkJCSUgeGNvcm5lciB5Y29ybmVyIHhzaXplIHlzaXplAAkJNCAyIHJvbGwACQltb3ZldG8ACQkyIGNvcHkACQlleGNoIDAgcmxpbmV0bwAJCTAgZXhjaCBybGluZXRvAAkJcG9wIG5lZyAwIHJsaW5ldG8ACQljbG9zZXBhdGgAL2VsbGlwc2VfcGF0aCB7AAkvcnkgZXhjaCBkZWYACS9yeCBleGNoIGRlZgAJL3kgZXhjaCBkZWYACS94IGV4Y2ggZGVmAAltYXRyaXggY3VycmVudG1hdHJpeAAJbmV3cGF0aAAJeCB5IHRyYW5zbGF0ZQAJcnggcnkgc2NhbGUACTAgMCAxIDAgMzYwIGFyYwAJc2V0bWF0cml4AC9lbmRwYWdlIHsgc2hvd3BhZ2UgfSBiaW5kIGRlZgAvc2hvd3BhZ2UgeyB9IGRlZgAvbGF5ZXJjb2xvcnNlcQAJWwklIGxheWVyIGNvbG9yIHNlcXVlbmNlIC0gZGFya2VzdCB0byBsaWdodGVzdAAJCVswIDAgMF0ACQlbLjIgLjggLjhdAAkJWy40IC44IC44XQAJCVsuNiAuOCAuOF0ACQlbLjggLjggLjhdAAldAGRlZgAvbGF5ZXJsZW4gbGF5ZXJjb2xvcnNlcSBsZW5ndGggZGVmAC9zZXRsYXllciB7L21heGxheWVyIGV4Y2ggZGVmIC9jdXJsYXllciBleGNoIGRlZgAJbGF5ZXJjb2xvcnNlcSBjdXJsYXllciAxIHN1YiBsYXllcmxlbiBtb2QgZ2V0AAlhbG9hZCBwb3Agc2V0aHNiY29sb3IACS9ub2RlY29sb3Ige25vcGNvbG9yfSBkZWYACS9lZGdlY29sb3Ige25vcGNvbG9yfSBkZWYACS9ncmFwaGNvbG9yIHtub3Bjb2xvcn0gZGVmAC9vbmxheWVyIHsgY3VybGF5ZXIgbmUge2ludmlzfSBpZiB9IGRlZgAvb25sYXllcnMgewAJL215dXBwZXIgZXhjaCBkZWYACS9teWxvd2VyIGV4Y2ggZGVmAAljdXJsYXllciBteWxvd2VyIGx0AAljdXJsYXllciBteXVwcGVyIGd0AAlvcgAJe2ludmlzfSBpZgAvY3VybGF5ZXIgMCBkZWYAJSVFbmRSZXNvdXJjZQAlJUVuZFByb2xvZwAlJUJlZ2luU2V0dXAAMTQgZGVmYXVsdC1mb250LWZhbWlseSBzZXRfZm9udAAlIC9hcnJvd2xlbmd0aCAxMCBkZWYAJSAvYXJyb3d3aWR0aCA1IGRlZgAlIG1ha2Ugc3VyZSBwZGZtYXJrIGlzIGhhcm1sZXNzIGZvciBQUy1pbnRlcnByZXRlcnMgb3RoZXIgdGhhbiBEaXN0aWxsZXIAL3BkZm1hcmsgd2hlcmUge3BvcH0ge3VzZXJkaWN0IC9wZGZtYXJrIC9jbGVhcnRvbWFyayBsb2FkIHB1dH0gaWZlbHNlACUgbWFrZSAnPDwnIGFuZCAnPj4nIHNhZmUgb24gUFMgTGV2ZWwgMSBkZXZpY2VzAC9sYW5ndWFnZWxldmVsIHdoZXJlIHtwb3AgbGFuZ3VhZ2VsZXZlbH17MX0gaWZlbHNlADIgbHQgewAgICAgdXNlcmRpY3QgKDw8KSBjdm4gKFspIGN2biBsb2FkIHB1dAAgICAgdXNlcmRpY3QgKD4+KSBjdm4gKFspIGN2biBsb2FkIHB1dAB9IGlmACUlRW5kU2V0dXAAJSVUcmFpbGVyCgAlJSUlUGFnZXM6ICVkCgBlbmQKcmVzdG9yZQoAJSVFT0YKACUhUFMtQWRvYmUtMy4wACBFUFNGLTMuMAoAJSUlJUNyZWF0b3I6ICVzIHZlcnNpb24gJXMgKCVzKQoAcHMyOnBzADwhLS0gADxwb2x5bGluZQAgcG9pbnRzPSIAIi8+CgAgZmlsbD0iAHVybCgjbF8lZCkAdXJsKCNyXyVkKQAiIGZpbGwtb3BhY2l0eT0iJWYAIiBzdHJva2U9IgAiIHN0cm9rZS13aWR0aD0iACIgc3Ryb2tlLWRhc2hhcnJheT0iJXMANSwyADEsNQAiIHN0cm9rZS1vcGFjaXR5PSIlZgBndnJlbmRlcl9jb3JlX3N2Zy5jAHN2Z19wcmludF9jb2xvcgA8cGF0aAAgaWQ9IgBfcCIgACBkPSIAJWMAPGRlZnM+CjxyYWRpYWxHcmFkaWVudCBpZD0icl8lZCIgY3g9IjUwJSUiIGN5PSI1MCUlIiByPSI3NSUlIiBmeD0iJWQlJSIgZnk9IiVkJSUiPgoAPHN0b3Agb2Zmc2V0PSIwIiBzdHlsZT0ic3RvcC1jb2xvcjoAO3N0b3Atb3BhY2l0eToAMS4AOyIvPgoAPHN0b3Agb2Zmc2V0PSIxIiBzdHlsZT0ic3RvcC1jb2xvcjoAOyIvPgo8L3JhZGlhbEdyYWRpZW50Pgo8L2RlZnM+CgA8ZGVmcz4KPGxpbmVhckdyYWRpZW50IGlkPSJsXyVkIiBncmFkaWVudFVuaXRzPSJ1c2VyU3BhY2VPblVzZSIgAHgxPSIAIiB5MT0iACIgeDI9IgAiIHkyPSIAIiA+CgA8c3RvcCBvZmZzZXQ9IiUuMDNmIiBzdHlsZT0ic3RvcC1jb2xvcjoAOyIvPgo8L2xpbmVhckdyYWRpZW50Pgo8L2RlZnM+CgA8cG9seWdvbgA8ZWxsaXBzZQAgY3g9IgAiIGN5PSIAIiByeD0iACIgcnk9IgA8dGV4dAAgdGV4dC1hbmNob3I9InN0YXJ0IgAgdGV4dC1hbmNob3I9ImVuZCIAIHRleHQtYW5jaG9yPSJtaWRkbGUiACB4PSIAIiB5PSIAIGZvbnQtZmFtaWx5PSIlcwAsJXMAIGZvbnQtd2VpZ2h0PSIlcyIAIGZvbnQtc3RyZXRjaD0iJXMiACBmb250LXN0eWxlPSIlcyIAIGZvbnQtZmFtaWx5PSIlcyIAIGZvbnQtd2VpZ2h0PSJib2xkIgAgZm9udC1zdHlsZT0iaXRhbGljIgAgdGV4dC1kZWNvcmF0aW9uPSIAJXNvdmVybGluZQAlc2xpbmUtdGhyb3VnaAAgYmFzZWxpbmUtc2hpZnQ9InN1cGVyIgAgYmFzZWxpbmUtc2hpZnQ9InN1YiIAIGZvbnQtc2l6ZT0iJS4yZiIAIGZpbGw9IiVzIgAgZmlsbD0iIyUwMnglMDJ4JTAyeCIAc3ZnX3RleHRzcGFuAD4APHRleHRQYXRoIHhsaW5rOmhyZWY9IiMlc19wIiBzdGFydE9mZnNldD0iNTAlJSI+ADx0c3BhbiB4PSIwIiBkeT0iACI+ADwvdHNwYW4+PC90ZXh0UGF0aD4APC90ZXh0PgoAPC9nPgoAPGcAIGlkPSJhXwAgeGxpbms6aHJlZj0iACB4bGluazp0aXRsZT0iACB0YXJnZXQ9IgA8dGl0bGU+ADwvdGl0bGU+CgA8ZyBpZD0iAF8lcwAiIGNsYXNzPSIlcwBjbGFzcwAgdHJhbnNmb3JtPSJzY2FsZSgAKSByb3RhdGUoJWQpIHRyYW5zbGF0ZSgAKSI+CgA8L3N2Zz4KADwhLS0AIFBhZ2VzOiAlZCAtLT4KADxzdmcgd2lkdGg9IiVkcHQiIGhlaWdodD0iJWRwdCIKACB2aWV3Qm94PSIlLjJmICUuMmYgJS4yZiAlLjJmIgAgeG1sbnM9Imh0dHA6Ly93d3cudzMub3JnLzIwMDAvc3ZnIgAgeG1sbnM6eGxpbms9Imh0dHA6Ly93d3cudzMub3JnLzE5OTkveGxpbmsiADw/eG1sIHZlcnNpb249IjEuMCIgZW5jb2Rpbmc9IlVURi04IiBzdGFuZGFsb25lPSJubyI/PgoAc3R5bGVzaGVldAA8P3htbC1zdHlsZXNoZWV0IGhyZWY9IgAiIHR5cGU9InRleHQvY3NzIj8+CgA8IURPQ1RZUEUgc3ZnIFBVQkxJQyAiLS8vVzNDLy9EVEQgU1ZHIDEuMS8vRU4iCgAgImh0dHA6Ly93d3cudzMub3JnL0dyYXBoaWNzL1NWRy8xLjEvRFREL3N2ZzExLmR0ZCI+CgA8IS0tIEdlbmVyYXRlZCBieSAAZGFya2JsdWUAZGFya2N5YW4AZGFya2dyYXkAZGFya2dyZXkAZGFya21hZ2VudGEAZGFya3JlZABsaWdodGdyZWVuACMgACBjcmVhdGUgbGluZSAAIC1maWxsIAAgLWRhc2ggNQAgLWRhc2ggMgBndnJlbmRlcl9jb3JlX3RrLmMAdGtnZW5fcHJpbnRfdGFncwBncmFwaCBsYWJlbAAgLXRhZ3MgeyVkJXMlcH0AdGtnZW5fcHJpbnRfY29sb3IAJGMAIC13aWR0aCAAIC1zbW9vdGggYmV6aWVyIAAgY3JlYXRlIHBvbHlnb24gACAtb3V0bGluZSAAIGNyZWF0ZSBvdmFsIAAgY3JlYXRlIHRleHQgACAtdGV4dCB7AH0AIC1mb250IHsAICVkfQAgLWFuY2hvciB3ACAtYW5jaG9yIGUAIwAgVGl0bGU6IAAgUGFnZXM6ICVkCgAjIEdlbmVyYXRlZCBieSAAKQoAdGsAdGs6dGsAICAgICAgPCEtLSAAIC0tPgoARXJyb3IgZHVyaW5nIGNvbnZlcnNpb24gdG8gIlVURi04Ii4gIFF1aXRpbmcuCgAgPHY6c2hhcGUgc3R5bGU9InBvc2l0aW9uOmFic29sdXRlOyAAIHdpZHRoOiAlZDsgaGVpZ2h0OiAlZCIgZmlsbGVkPSJmYWxzZSI+ADx2OnBhdGggdj0iACBtIAAlLjBmLCUuMGYgACBsIAAgZSAAIi8+ADwvdjpzaGFwZT4KADx2OnN0cm9rZSBjb2xvcj0iACIgd2VpZ2h0PSIlLjBmcHQAIiBkYXNoc3R5bGU9ImRhc2gAIiBkYXNoc3R5bGU9ImRvdAAiIC8+ACMlMDJ4JTAyeCUwMngAZ3ZyZW5kZXJfY29yZV92bWwuYwB2bWxfcHJpbnRfY29sb3IAIHdpZHRoOiAlZDsgaGVpZ2h0OiAlZCIAID4APHY6cGF0aCAgdj0iAC8+PC92OnNoYXBlPgoAbSAAJXMlLjBmLCUuMGYgAGMgACBmaWxsZWQ9InRydWUiIGZpbGxjb2xvcj0iACIgACBmaWxsZWQ9ImZhbHNlIiAAJS4wZiAlLjBmIABsIAB4IGUgIi8+ACAgPHY6b3ZhbCBzdHlsZT0icG9zaXRpb246YWJzb2x1dGU7ACBsZWZ0OiAlLjJmOyB0b3A6ICUuMmY7ACB3aWR0aDogJS4yZjsgaGVpZ2h0OiAlLjJmIgA8L3Y6b3ZhbD4KADx2OnJlY3Qgc3R5bGU9InBvc2l0aW9uOmFic29sdXRlOyAAIHN0cm9rZWQ9ImZhbHNlIiBmaWxsZWQ9ImZhbHNlIj4KADx2OnRleHRib3ggaW5zZXQ9IjAsMCwwLDAiIHN0eWxlPSJwb3NpdGlvbjphYnNvbHV0ZTsgdi10ZXh0LXdyYXBwaW5nOidmYWxzZSc7cGFkZGluZzonMCc7AGZvbnQtZmFtaWx5OiAnJXMnOwBmb250LXdlaWdodDogJXM7AGZvbnQtc3RyZXRjaDogJXM7AGZvbnQtc3R5bGU6ICVzOwAgZm9udC1zaXplOiAlLjJmcHQ7AGNvbG9yOiVzOwBjb2xvcjojJTAyeCUwMnglMDJ4OwB2bWxfdGV4dHNwYW4AIj48Y2VudGVyPgA8L2NlbnRlcj48L3Y6dGV4dGJveD4KADwvdjpyZWN0PgoAPC9hPgoAPGEAIGhyZWY9IiVzIgAgdGl0bGU9IiVzIgAgdGFyZ2V0PSIlcyIAPgoAPC92Omdyb3VwPgoAPC9ESVY+CgA8RElWIGlkPSdfVk1MMl8nIHN0eWxlPSJwb3NpdGlvbjpyZWxhdGl2ZTt2aXNpYmlsaXR5OmhpZGRlbiI+CgA8IS0tIGluc2VydCBhbnkgb3RoZXIgaHRtbCBjb250ZW50IGhlcmUgLS0+CgA8RElWIGlkPSdfbm90Vk1MMV8nIHN0eWxlPSJwb3NpdGlvbjpyZWxhdGl2ZTsiPgoAPCEtLSB0aGlzIHNob3VsZCBvbmx5IGRpc3BsYXkgb24gTk9OLUlFIGJyb3dzZXJzIC0tPgoAPEgyPlNvcnJ5LCB0aGlzIGRpYWdyYW0gd2lsbCBvbmx5IGRpc3BsYXkgY29ycmVjdGx5IG9uIEludGVybmV0IEV4cGxvcmVyIDUgKGFuZCB1cCkgYnJvd3NlcnMuPC9IMj4KADxESVYgaWQ9J19ub3RWTUwyXycgc3R5bGU9InBvc2l0aW9uOnJlbGF0aXZlOyI+CgA8IS0tIGluc2VydCBhbnkgb3RoZXIgTk9OLUlFIGh0bWwgY29udGVudCBoZXJlIC0tPgoAPC9CT0RZPgo8L0hUTUw+CgA8SEVBRD4APE1FVEEgaHR0cC1lcXVpdj0iQ29udGVudC1UeXBlIiBjb250ZW50PSJ0ZXh0L2h0bWw7IGNoYXJzZXQ9VVRGLTgiPgoAPFRJVExFPgA8L1RJVExFPgA8IS0tIFBhZ2VzOiAlZCAtLT4KACAgIDxTQ1JJUFQgTEFOR1VBR0U9J0phdmFzY3JpcHQnPgoAICAgZnVuY3Rpb24gYnJvd3NlcmNoZWNrKCkKACAgIHsKACAgICAgIHZhciB1YSA9IHdpbmRvdy5uYXZpZ2F0b3IudXNlckFnZW50CgAgICAgICB2YXIgbXNpZSA9IHVhLmluZGV4T2YgKCAnTVNJRSAnICkKACAgICAgIHZhciBpZXZlcnM7CgAgICAgICB2YXIgaXRlbTsKACAgICAgIHZhciBWTUx5ZXM9bmV3IEFycmF5KCdfVk1MMV8nLCdfVk1MMl8nKTsKACAgICAgIHZhciBWTUxubz1uZXcgQXJyYXkoJ19ub3RWTUwxXycsJ19ub3RWTUwyXycpOwoAICAgICAgaWYgKCBtc2llID4gMCApeyAgICAgIC8vIElmIEludGVybmV0IEV4cGxvcmVyLCByZXR1cm4gdmVyc2lvbiBudW1iZXIKACAgICAgICAgIGlldmVycz0gcGFyc2VJbnQgKHVhLnN1YnN0cmluZyAobXNpZSs1LCB1YS5pbmRleE9mICgnLicsIG1zaWUgKSkpCgAgICAgICB9CgAgICAgICBpZiAoaWV2ZXJzPj01KXsKACAgICAgICBmb3IgKHggaW4gVk1MeWVzKXsKACAgICAgICAgIGl0ZW0gPSBkb2N1bWVudC5nZXRFbGVtZW50QnlJZChWTUx5ZXNbeF0pOwoAICAgICAgICAgaWYgKGl0ZW0pIHsKACAgICAgICAgICAgaXRlbS5zdHlsZS52aXNpYmlsaXR5PSd2aXNpYmxlJzsKACAgICAgICAgIH0KACAgICAgICB9CgAgICAgICAgZm9yICh4IGluIFZNTG5vKXsKACAgICAgICAgIGl0ZW0gPSBkb2N1bWVudC5nZXRFbGVtZW50QnlJZChWTUxub1t4XSk7CgAgICAgICAgICAgIGl0ZW0uc3R5bGUudmlzaWJpbGl0eT0naGlkZGVuJzsKACAgICAgfWVsc2V7CgAgICAgIH0KACAgIH0KACAgIDwvU0NSSVBUPgoAPC9IRUFEPgA8Qk9EWSBvbmxvYWQ9J2Jyb3dzZXJjaGVjaygpOyc+CgA8RElWIGlkPSdfVk1MMV8nIHN0eWxlPSJwb3NpdGlvbjpyZWxhdGl2ZTsgZGlzcGxheTppbmxpbmU7IHZpc2liaWxpdHk6aGlkZGVuACB3aWR0aDogJWRwdDsgaGVpZ2h0OiAlZHB0Ij4KADxTVFlMRT4KAHZcOiogeyBiZWhhdmlvcjogdXJsKCNkZWZhdWx0I1ZNTCk7ZGlzcGxheTppbmxpbmUtYmxvY2t9CgA8L1NUWUxFPgoAPHhtbDpuYW1lc3BhY2UgbnM9InVybjpzY2hlbWFzLW1pY3Jvc29mdC1jb206dm1sIiBwcmVmaXg9InYiIC8+CgAgPHY6Z3JvdXAgc3R5bGU9InBvc2l0aW9uOnJlbGF0aXZlOyAAIHdpZHRoOiAlZHB0OyBoZWlnaHQ6ICVkcHQiACBjb29yZG9yaWdpbj0iMCwwIiBjb29yZHNpemU9IiVkLCVkIiA+ADxIVE1MPgoACjwhLS0gR2VuZXJhdGVkIGJ5IAAgdmVyc2lvbiAAICgAKQotLT4KAGFxdWEAZnVjaHNpYQBsaW1lAG9saXZlAHRlYWwAdm1sAHZtbDp2bWwALy8qKiogY29tbWVudDogJXMKAC8vKioqIHBvbHlsaW5lCgBzY2FsZSAgICA8JTkuM2YsICU5LjNmLCAlOS4zZj4KAHJvdGF0ZSAgIDwlOS4zZiwgJTkuM2YsICU5LjNmPgoAdHJhbnNsYXRlPCU5LjNmLCAlOS4zZiwgJTkuM2Y+CgBzcGhlcmVfc3dlZXAgewogICAgJXMKICAgICVkLAoAbGluZWFyX3NwbGluZQA8JTkuM2YsICU5LjNmLCAlOS4zZj4sICUuM2YKACVzICAgICVzACAgICB0b2xlcmFuY2UgMC4wMQogICAgJXMgICAgJXMgICAgJXMgICAgJXN9CgAlcyVzACVzIHRyYW5zbWl0ICUuM2YAUmVkAEdyZWVuAEJsdWUAcmdiPCU5LjNmLCAlOS4zZiwgJTkuM2Y+IHRyYW5zbWl0ICUuM2YAb29wcywgaW50ZXJuYWwgZXJyb3I6IHVuaGFuZGxlZCBjb2xvciB0eXBlPSVkICVzCgBndnJlbmRlcl9jb3JlX3Bvdi5jAHBvdl9jb2xvcl9hc19zdHIAcGlnbWVudCB7IGNvbG9yICVzIH0KAHBvdiByZW5kZXJlcjplbCAtICVzCgAvLyoqKiBiZXppZXIKAGJfc3BsaW5lACAgICAgICAgdG9sZXJhbmNlIDAuMDEKICAgICVzICAgICVzICAgICVzICAgICVzfQoALy8qKiogcG9seWdvbgoAICAgIHRvbGVyYW5jZSAwLjEKICAgICVzICAgICVzICAgICVzICAgICVzfQoAcG9seWdvbiB7ICVkLAoAPCU5LjNmLCAlOS4zZiwgJTkuM2Y+ACVzCiAgICAlcwAKICAgICVzICAgICVzICAgICVzICAgICVzfQoALy8qKiogZWxsaXBzZQoAdG9ydXMgeyAlLjNmLCAlLjNmCiAgICAlcyAgICAlcyAgICAlcyAgICAlc30KAHNwaGVyZSB7PCU5LjNmLCAlOS4zZiwgJTkuM2Y+LCAxLjAKICAgICVzICAgICVzICAgICVzICAgICVzfQoALy8qKiogdGV4dHNwYW46ICVzLCBmb250c2l6ZSA9ICUuM2YsIGZvbnRuYW1lID0gJXMKAHNjYWxlICUuM2YKAHRleHQgewogICAgdHRmICIlcyIsCiAgICAiJXMiLCAlLjNmLCAlLjNmCiAgICAlcyAgICAlcyAgICAlcyAgICAlcyAgICAlc30KACAgICBub19zaGFkb3cKAC8vKioqIGVuZF9lZGdlCgAvLyoqKiBiZWdpbl9lZGdlCgAvLyoqKiBlbmRfbm9kZQoALy8qKiogYmVnaW5fbm9kZTogJXMKAC8vKioqIGVuZF9jbHVzdGVyCgAvLyoqKiBiZWdpbl9jbHVzdGVyCgAvLyoqKiBlbmRfcGFnZQoALy8qKiogYmVnaW5fcGFnZQoALy8qKiogZW5kX2xheWVyCgAvLyoqKiBiZWdpbl9sYXllcjogJXMsICVkLyVkCgAvLyoqKiBlbmRfZ3JhcGgKAC8vKioqIGJlZ2luX2dyYXBoICVzCgBjYW1lcmEgeyBsb2NhdGlvbiA8JS4zZiAsICUuM2YgLCAlLjNmPgogICAgICAgICBsb29rX2F0ICA8JS4zZiAsICUuM2YgLCAlLjNmPgogICAgICAgICByaWdodCB4ICogaW1hZ2Vfd2lkdGggLyBpbWFnZV9oZWlnaHQKICAgICAgICAgYW5nbGUgJS4zZgp9CgAvL3NreQpwbGFuZSB7IDwwLCAxLCAwPiwgMSBob2xsb3cKICAgIHRleHR1cmUgewogICAgICAgIHBpZ21lbnQgeyBib3pvIHR1cmJ1bGVuY2UgMC45NQogICAgICAgICAgICBjb2xvcl9tYXAgewogICAgICAgICAgICAgICAgWzAuMDAgcmdiIDwwLjA1LCAwLjIwLCAwLjUwPl0KICAgICAgICAgICAgICAgIFswLjUwIHJnYiA8MC4wNSwgMC4yMCwgMC41MD5dCiAgICAgICAgICAgICAgICBbMC43NSByZ2IgPDEuMDAsIDEuMDAsIDEuMDA+XQogICAgICAgICAgICAgICAgWzAuNzUgcmdiIDwwLjI1LCAwLjI1LCAwLjI1Pl0KICAgICAgICAgICAgICAgIFsxLjAwIHJnYiA8MC41MCwgMC41MCwgMC41MD5dCiAgICAgICAgICAgIH0KICAgICAgICAgICAgc2NhbGUgPDEuMDAsIDEuMDAsIDEuNTA+ICogMi41MAogICAgICAgICAgICB0cmFuc2xhdGUgPDAuMDAsIDAuMDAsIDAuMDA+CiAgICAgICAgfQogICAgICAgIGZpbmlzaCB7IGFtYmllbnQgMSBkaWZmdXNlIDAgfQogICAgfQogICAgc2NhbGUgMTAwMDAKfQovL21pc3QKZm9nIHsgZm9nX3R5cGUgMgogICAgZGlzdGFuY2UgNTAKICAgIGNvbG9yIHJnYiA8MS4wMCwgMS4wMCwgMS4wMD4gKiAwLjc1CiAgICBmb2dfb2Zmc2V0IDAuMTAKICAgIGZvZ19hbHQgMS41MAogICAgdHVyYnVsZW5jZSAxLjc1Cn0KLy9nbmQKcGxhbmUgeyA8MC4wMCwgMS4wMCwgMC4wMD4sIDAKICAgIHRleHR1cmUgewogICAgICAgIHBpZ21lbnR7IGNvbG9yIHJnYiA8MC4yNSwgMC40NSwgMC4wMD4gfQogICAgICAgIG5vcm1hbCB7IGJ1bXBzIDAuNzUgc2NhbGUgMC4wMSB9CiAgICAgICAgZmluaXNoIHsgcGhvbmcgMC4xMCB9CiAgICB9Cn0KAGxpZ2h0X3NvdXJjZSB7IDwxNTAwLDMwMDAsLTI1MDA+IGNvbG9yIFdoaXRlIH0KACN2ZXJzaW9uIDMuNjsKAGdsb2JhbF9zZXR0aW5ncyB7IGFzc3VtZWRfZ2FtbWEgMS4wIH0KACNkZWZhdWx0IHsgZmluaXNoIHsgYW1iaWVudCAwLjEgZGlmZnVzZSAwLjkgfSB9CgAjaW5jbHVkZSAiY29sb3JzLmluYyIKI2luY2x1ZGUgInRleHR1cmVzLmluYyIKI2luY2x1ZGUgInNoYXBlcy5pbmMiCgAjZGVjbGFyZSAlcyA9ICVzOwoAQmxhY2sAV2hpdGUAYmFrZXJzY2hvYwBicmFzcwBicmlnaHRnb2xkAGJyb256ZQBicm9uemUyAGNsZWFyAGNvb2xjb3BwZXIAY29wcGVyAGRhcmticm93bgBkYXJrcHVycGxlAGRhcmt0YW4AZGFya3dvb2QAZGtncmVlbmNvcHBlcgBkdXN0eXJvc2UAZmVsZHNwYXIAZmxlc2gAZ3JheTA1AGdyZWVuY29wcGVyAGh1bnRlcnNncmVlbgBsaWdodF9wdXJwbGUAbGlnaHR3b29kAG1hbmRhcmlub3JhbmdlAG1lZGl1bWZvcmVzdGdyZWVuAG1lZGl1bWdvbGRlbnJvZABtZWRpdW13b29kAG1lZF9wdXJwbGUAbWljYQBuZW9uYmx1ZQBuZW9ucGluawBuZXdtaWRuaWdodGJsdWUAbmV3dGFuAG9sZGdvbGQAcXVhcnR6AHJpY2hibHVlAHNjYXJsZXQAc2VtaVN3ZWV0Q2hvYwBzaWx2ZXIAc3BpY3lwaW5rAHN1bW1lcnNreQB2ZXJ5ZGFya2Jyb3duAHZlcnlfbGlnaHRfcHVycGxlAHBvdgBwb3Y6cG92ACVzICVzCgAuXCIgACAlZCAlZAAgJXMKACAlZABmaWxsIABlbGxpcHNlIGF0dHJzJWQgJXN3aWQgJS41ZiBodCAlLjVmIGF0ICglLjVmLCUuNWYpOwoALmZ0ICVzCgAucHMgJWQqXG4oU0Z1LyUuMGZ1CgAiJXMiIGF0ICglLjVmLCUuNWYpOwoAJTAzbwAlcyVzIGlzIG5vdCBhIHRyb2ZmIGZvbnQKAGRvdCBwaWMgcGx1Z2luOiAAUgBdCi5QRQoALlBTICUuNWYgJS41ZgoAJXMgdG8gY2hhbmdlIGRyYXdpbmcgc2l6ZSwgbXVsdGlwbHkgdGhlIHdpZHRoIGFuZCBoZWlnaHQgb24gdGhlIC5QUyBsaW5lIGFib3ZlIGFuZCB0aGUgbnVtYmVyIG9uIHRoZSB0d28gbGluZXMgYmVsb3cgKHJvdW5kZWQgdG8gdGhlIG5lYXJlc3QgaW50ZWdlcikgYnkgYSBzY2FsZSBmYWN0b3IKAC5uciBTRiAlLjBmCnNjYWxldGhpY2tuZXNzID0gJS4wZgoAJXMgZG9uJ3QgY2hhbmdlIGFueXRoaW5nIGJlbG93IHRoaXMgbGluZSBpbiB0aGlzIGRyYXdpbmcKACVzIG5vbi1mYXRhbCBydW4tdGltZSBwaWMgdmVyc2lvbiBkZXRlcm1pbmF0aW9uLCB2ZXJzaW9uIDIKAGJveHJhZD0yLjAgJXMgd2lsbCBiZSByZXNldCB0byAwLjAgYnkgZ3BpYyBvbmx5CgBzY2FsZT0xLjAgJXMgcmVxdWlyZWQgZm9yIGNvbXBhcmlzb25zCgAlcyBib3hyYWQgaXMgbm93IDAuMCBpbiBncGljLCBlbHNlIGl0IHJlbWFpbnMgMi4wCgAlcyBkYXNod2lkIGlzIDAuMSBpbiAxMHRoIEVkaXRpb24sIDAuMDUgaW4gRFdCIDIgYW5kIGluIGdwaWMKACVzIGZpbGx2YWwgaXMgMC4zIGluIDEwdGggRWRpdGlvbiAoZmlsbCAwIG1lYW5zIGJsYWNrKSwgMC41IGluIGdwaWMgKGZpbGwgMCBtZWFucyB3aGl0ZSksIHVuZGVmaW5lZCBpbiBEV0IgMgoAJXMgZmlsbCBoYXMgbm8gbWVhbmluZyBpbiBEV0IgMiwgZ3BpYyBjYW4gdXNlIGZpbGwgb3IgZmlsbGVkLCAxMHRoIEVkaXRpb24gdXNlcyBmaWxsIG9ubHkKACVzIERXQiAyIGRvZXNuJ3QgdXNlIGZpbGwgYW5kIGRvZXNuJ3QgZGVmaW5lIGZpbGx2YWwKACVzIHJlc2V0IHdvcmtzIGluIGdwaWMgYW5kIDEwdGggZWRpdGlvbiwgYnV0IGlzbid0IGRlZmluZWQgaW4gRFdCIDIKACVzIERXQiAyIGNvbXBhdGliaWxpdHkgZGVmaW5pdGlvbnMKAGlmIGJveHJhZCA+IDEuMCAmJiBkYXNod2lkIDwgMC4wNzUgdGhlbiBYCglmaWxsdmFsID0gMTsKCWRlZmluZSBmaWxsIFkgWTsKCWRlZmluZSBzb2xpZCBZIFk7CglkZWZpbmUgcmVzZXQgWSBzY2FsZT0xLjAgWTsKWAoAcmVzZXQgJXMgc2V0IHRvIGtub3duIHN0YXRlCgAlcyBHTlUgcGljIHZzLiAxMHRoIEVkaXRpb24gZFwoZSd0ZW50ZQoAaWYgZmlsbHZhbCA+IDAuNCB0aGVuIFgKCWRlZmluZSBzZXRmaWxsdmFsIFkgZmlsbHZhbCA9IDEgLSBZOwoJZGVmaW5lIGJvbGQgWSB0aGlja25lc3MgMiBZOwoACSVzIGlmIHlvdSB1c2UgZ3BpYyBhbmQgaXQgYmFyZnMgb24gZW5jb3VudGVyaW5nICJzb2xpZCIsCgAJJXMJaW5zdGFsbCBhIG1vcmUgcmVjZW50IHZlcnNpb24gb2YgZ3BpYyBvciBzd2l0Y2ggdG8gRFdCIG9yIDEwdGggRWRpdGlvbiBwaWM7CgAJJXMJc29ycnksIHRoZSBncm9mZiBmb2xrcyBjaGFuZ2VkIGdwaWM7IHNlbmQgYW55IGNvbXBsYWludCB0byB0aGVtOwoAWCBlbHNlIFoKCWRlZmluZSBzZXRmaWxsdmFsIFkgZmlsbHZhbCA9IFk7CglkZWZpbmUgYm9sZCBZIFk7CglkZWZpbmUgZmlsbGVkIFkgZmlsbCBZOwpaCgAlcyBhcnJvd2hlYWQgaGFzIG5vIG1lYW5pbmcgaW4gRFdCIDIsIGFycm93aGVhZCA9IDcgbWFrZXMgZmlsbGVkIGFycm93aGVhZHMgaW4gZ3BpYyBhbmQgaW4gMTB0aCBFZGl0aW9uCgAlcyBhcnJvd2hlYWQgaXMgdW5kZWZpbmVkIGluIERXQiAyLCBpbml0aWFsbHkgMSBpbiBncGljLCAyIGluIDEwdGggRWRpdGlvbgoAYXJyb3doZWFkID0gNyAlcyBub3QgdXNlZCBieSBncmFwaHZpegoAJXMgR05VIHBpYyBzdXBwb3J0cyBhIGJveHJhZCB2YXJpYWJsZSB0byBkcmF3IGJveGVzIHdpdGggcm91bmRlZCBjb3JuZXJzOyBEV0IgYW5kIDEwdGggRWQuIGRvIG5vdAoAYm94cmFkID0gMCAlcyBubyByb3VuZGVkIGNvcm5lcnMgaW4gZ3JhcGh2aXoKACVzIEdOVSBwaWMgc3VwcG9ydHMgYSBsaW5ldGhpY2sgdmFyaWFibGUgdG8gc2V0IGxpbmUgdGhpY2tuZXNzOyBEV0IgYW5kIDEwdGggRWQuIGRvIG5vdAoAbGluZXRoaWNrID0gMDsgb2xkbGluZXRoaWNrID0gbGluZXRoaWNrCgAlcyAuUFMgdy9vIGFyZ3MgY2F1c2VzIEdOVSBwaWMgdG8gc2NhbGUgZHJhd2luZyB0byBmaXQgOC41eDExIHBhcGVyOyBEV0IgZG9lcyBub3QKACVzIG1heHBzaHQgYW5kIG1heHBzd2lkIGhhdmUgbm8gbWVhbmluZyBpbiBEV0IgMi4wLCBzZXQgcGFnZSBib3VuZGFyaWVzIGluIGdwaWMgYW5kIGluIDEwdGggRWRpdGlvbgoAJXMgbWF4cHNodCBhbmQgbWF4cHN3aWQgYXJlIHByZWRlZmluZWQgdG8gMTEuMCBhbmQgOC41IGluIGdwaWMKAG1heHBzaHQgPSAlZgptYXhwc3dpZCA9ICVmCgBEb3Q6IFsKAGRlZmluZSBhdHRyczAgJSUgJSU7IGRlZmluZSB1bmZpbGxlZCAlJSAlJTsgZGVmaW5lIHJvdW5kZWQgJSUgJSU7IGRlZmluZSBkaWFnb25hbHMgJSUgJSUKACVzJXMgdW5zdXBwb3J0ZWQKACVzIHJlc3RvcmUgcG9pbnQgc2l6ZSBhbmQgZm9udAoucHMgXG4oLlMKLmZ0IFxuKERGCgAlcyBDcmVhdG9yOiAlcyB2ZXJzaW9uICVzICglcykKACVzIFRpdGxlOiAlcwoAJXMgc2F2ZSBwb2ludCBzaXplIGFuZCBmb250Ci5uciAuUyBcbigucwoubnIgREYgXG4oLmYKAHBpYwBwaWM6cGljAHBuZzpzdmcAZ2lmOnN2ZwBqcGVnOnN2ZwBqcGU6c3ZnAGpwZzpzdmcAcG5nOmZpZwBnaWY6ZmlnAGpwZWc6ZmlnAGpwZTpmaWcAanBnOmZpZwBwbmc6dnJtbABnaWY6dnJtbABqcGVnOnZybWwAanBlOnZybWwAanBnOnZybWwAZXBzOnBzAHBzOnBzAChsaWIpOnBzAHBuZzptYXAAZ2lmOm1hcABqcGVnOm1hcABqcGU6bWFwAGpwZzptYXAAcHM6bWFwAGVwczptYXAAc3ZnOm1hcABwbmc6ZG90AGdpZjpkb3QAanBlZzpkb3QAanBlOmRvdABqcGc6ZG90AHBzOmRvdABlcHM6ZG90AHN2Zzpkb3QAcG5nOnhkb3QAZ2lmOnhkb3QAanBlZzp4ZG90AGpwZTp4ZG90AGpwZzp4ZG90AHBzOnhkb3QAZXBzOnhkb3QAc3ZnOnhkb3QAc3ZnOnN2ZwBwbmc6dm1sAGdpZjp2bWwAanBlZzp2bWwAanBlOnZtbABqcGc6dm1sAGdpZjp0awBpbWFnZSBjcmVhdGUgcGhvdG8gInBob3RvXyVzIiAtZmlsZSAiJXMiCgAkYyBjcmVhdGUgaW1hZ2UgJS4yZiAlLjJmIC1pbWFnZSAicGhvdG9fJXMiCgA8djppbWFnZSBzcmM9IiVzIiBzdHlsZT0iIHBvc2l0aW9uOmFic29sdXRlOyB3aWR0aDolLjJmOyBoZWlnaHQ6JS4yZjsgbGVmdDolLjJmIDsgdG9wOiUuMmYiACAvPgoAZ3Zsb2FkaW1hZ2VfY29yZS5jAGNvcmVfbG9hZGltYWdlX3BzbGliAFsgACVnICVnIABdICAlZCB0cnVlICVzCgBdICAlZCBmYWxzZSAlcwoAY29yZV9sb2FkaW1hZ2VfcHMAZ3NhdmUgJWcgJWcgdHJhbnNsYXRlIG5ld3BhdGgKAHVzZXJfc2hhcGVfJWQKAGdyZXN0b3JlCgBjb3JlX2xvYWRpbWFnZV92cm1sAFNoYXBlIHsKACAgYXBwZWFyYW5jZSBBcHBlYXJhbmNlIHsKACAgICBtYXRlcmlhbCBNYXRlcmlhbCB7CgAgICAgICBhbWJpZW50SW50ZW5zaXR5IDAuMzMKACAgICAgICAgZGlmZnVzZUNvbG9yIDEgMSAxCgAgICAgfQoAICAgIHRleHR1cmUgSW1hZ2VUZXh0dXJlIHsgdXJsICIlcyIgfQoAICB9CgBjb3JlX2xvYWRpbWFnZV9maWcAJWQgJWQgJWQgJWQgJWQgJWQgJWQgJWQgJWQgJS4xZiAlZCAlZCAlZCAlZCAlZCAlZAogJWQgJXMKACAlZCAlZCAlZCAlZCAlZCAlZCAlZCAlZCAlZCAlZAoAY29yZV9sb2FkaW1hZ2Vfc3ZnADxpbWFnZSB4bGluazpocmVmPSIAIiB3aWR0aD0iJWdweCIgaGVpZ2h0PSIlZ3B4IiBwcmVzZXJ2ZUFzcGVjdFJhdGlvPSJ4TWlkWU1pZCBtZWV0IiB4PSIlZyIgeT0iJWciACB0cmFuc2Zvcm09InJvdGF0ZSglZCAlZyAlZykiACIgd2lkdGg9IiVncHgiIGhlaWdodD0iJWdweCIgcHJlc2VydmVBc3BlY3RSYXRpbz0ieE1pbllNaW4gbWVldCIgeD0iJWciIHk9IiVnIgAvPgoAZG90X2xheW91dABwaGFzZQBkb3QgZG9lcyBub3Qgc3VwcG9ydCB0aGUgYXNwZWN0IGF0dHJpYnV0ZSBmb3IgZGlzY29ubmVjdGVkIGdyYXBocyBvciBncmFwaHMgd2l0aCBjbHVzdGVycwoAY29tcG91bmQAdiA9PSBuAGRvdGluaXQuYwByZW1vdmVfZnJvbV9yYW5rAG9yZGVyAGVkZ2UgbGFiZWxzIHdpdGggc3BsaW5lcz1jdXJ2ZWQgbm90IHN1cHBvcnRlZCBpbiBkb3QgLSB1c2UgeGxhYmVscwoARURfbGFiZWwoZmUpAGRvdHNwbGluZXMuYwBfZG90X3NwbGluZXMAZmxhdCBlZGdlIGJldHdlZW4gYWRqYWNlbnQgbm9kZXMgb25lIG9mIHdoaWNoIGhhcyBhIHJlY29yZCBzaGFwZSAtIHJlcGxhY2UgcmVjb3JkcyB3aXRoIEhUTUwtbGlrZSBsYWJlbHMKACAgRWRnZSAlcyAlcyAlcwoAeHh4ADEwMDAwAHslc30AYXV4ZwBsYWJlbF9mbG9hdABmaXhlZAAobCA9IEVEX2xhYmVsKGZlKSkAc2V0RWRnZUxhYmVsUG9zAGUgIT0gTlVMTABmYXN0Z3IuYwBkZWxldGVfZmFzdF9lZGdlAG4gIT0gTkRfbmV4dChuKQBmYXN0X25vZGUAdSAhPSB2AGZhc3Rfbm9kZWFwcABORF9uZXh0KHYpID09IE5VTEwAZmluZF9mYXN0X25vZGUoZywgbikAZGVsZXRlX2Zhc3Rfbm9kZQBkZWxldGVfZmxhdF9lZGdlAG1lcmdlX29uZXdheSBnbGl0Y2gKAG1lcmdlX29uZXdheQBzYWZlX2RlbGV0ZV9mYXN0X2VkZ2UAbGcAY29tcABjbnQgPT0gc3oAbWluY3Jvc3MuYwBmaXhMYWJlbE9yZGVyAHJlbWluY3Jvc3MAbWluY3Jvc3MgJXM6ICVkIGNyb3NzaW5ncywgJS4yZiBzZWNzLgoAdgBuZWlnaGJvcgAocnYgPT0gMCkgfHwgKE5EX29yZGVyKHJ2KS1ORF9vcmRlcih2KSkqZGlyID4gMABjb25zdHJhaW5pbmdfZmxhdF9lZGdlKGcsdixlKSA9PSBGQUxTRQBmbGF0X3Jlb3JkZXIATkRfcmFuayh2KSA9PSByAHBvc3RvcmRlcgBmbGF0aW5kZXgoYWdoZWFkKGUpKSA8IE0tPm5yb3dzAGZsYXRfc2VhcmNoAGZsYXRpbmRleChhZ3RhaWwoZSkpIDwgTS0+bmNvbHMAb3V0AG9yZGVyaW5nICclcycgbm90IHJlY29nbml6ZWQuCgBvcmRlcmluZyAnJXMnIG5vdCByZWNvZ25pemVkIGZvciBub2RlICclcycuCgBtZXJnZTI6IGdyYXBoICVzLCByYW5rICVkIGhhcyBvbmx5ICVkIDwgJWQgbm9kZXMKAG1pbmNyb3NzOiBwYXNzICVkIGl0ZXIgJWQgdHJ5aW5nICVkIGN1cl9jcm9zcyAlZCBiZXN0X2Nyb3NzICVkCgBORF9vcmRlcih2KSA8IE5EX29yZGVyKHcpAGJhbGFuY2UAdHJhbnNwb3NlX3N0ZXAAc3VycHJpc2UKAGluc3RhbGxfaW5fcmFuaywgbGluZSAlZDogJXMgJXMgcmFuayAlZCBpID0gJWQgYW4gPSAwCgBHRF9yYW5rKGcpW3JdLm4gPD0gR0RfcmFuayhnKVtyXS5hbgBpbnN0YWxsX2luX3JhbmsAaW5zdGFsbF9pbl9yYW5rLCBsaW5lICVkOiBORF9vcmRlciglcykgWyVkXSA+IEdEX3JhbmsoUm9vdClbJWRdLmFuIFslZF0KAGluc3RhbGxfaW5fcmFuaywgbGluZSAlZDogcmFuayAlZCBub3QgaW4gcmFuayByYW5nZSBbJWQsJWRdCgBpbnN0YWxsX2luX3JhbmssIGxpbmUgJWQ6IEdEX3JhbmsoZylbJWRdLnYgKyBORF9vcmRlciglcykgWyVkXSA+IEdEX3JhbmsoZylbJWRdLmF2ICsgR0RfcmFuayhSb290KVslZF0uYW4gWyVkXQoAX25ld19yYW5rAG1jbGltaXQAcmFuayhnLCAyLCBuc2l0ZXIyKGcpKSA9PSAwAHBvc2l0aW9uLmMAZG90X3Bvc2l0aW9uAEFSPSUwLjRsZgkgQXJlYT0gJTAuNGxmCQBEdW1teT0lZAoAR29pbmcgdG8gYXBwbHkgYW5vdGhlciBleHBhbnNpb24uCgBuZXh0I2l0ZXI9JWQKAGhwAGNvbm5lY3RHcmFwaABFZGdlIGxlbmd0aCAlZiBsYXJnZXIgdGhhbiBtYXhpbXVtICV1IGFsbG93ZWQuCkNoZWNrIGZvciBvdmVyd2lkZSBub2RlKHMpLgoAbnNsaW1pdABjb250YWluX25vZGVzIGNsdXN0ICVzIHJhbmsgJWQgbWlzc2luZyBub2RlCgBuc2xpbWl0MQBuZXdyYW5rAE1heHJhbmsgPSAlZCwgbWlucmFuayA9ICVkCgBsZWFkZXIgIT0gTlVMTAByYW5rLmMAY2x1c3Rlcl9sZWFkZXIAKE5EX1VGX3NpemUobikgPD0gMSkgfHwgKG4gPT0gbGVhZGVyKQBhZ2hlYWQoZSkgPT0gVUZfZmluZChhZ2hlYWQoZSkpAG1pbm1heF9lZGdlcwBhZ3RhaWwoZSkgPT0gVUZfZmluZChhZ3RhaWwoZSkpAHJhbmsAc2FtZQBtaW4Ac291cmNlAG1heABzaW5rAGxldmVsIGFzc2lnbm1lbnQgY29uc3RyYWludHMAbGV2ZWwgZ3JhcGggcmVjAH9yb290AH90b3AAf2JvdABjb21wYWN0AF93ZWFrXyVkAHJhbmtpbmc6IGZhaWx1cmUgdG8gY3JlYXRlIHN0cm9uZyBjb25zdHJhaW50IGVkZ2UgYmV0d2VlbiBub2RlcyAlcyBhbmQgJXMKACVzIGhhcyB1bnJlY29nbml6ZWQgcmFuaz0lcwBsZXZlbCBlZGdlIHJlYwBsZXZlbCBub2RlIHJlYwBzYW1laGVhZABzYW1ldGFpbAB0b28gbWFueSAoPiAlZCkgc2FtZXtoZWFkLHRhaWx9IGdyb3VwcyBmb3Igbm9kZSAlcwoAY29tYmlBUiA9ICVsZgoAJWxmLCVkAHRoZSBhc3BlY3QgYXR0cmlidXRlIGhhcyBiZWVuIGRpc2FibGVkIGR1ZSB0byBpbXBsZW1lbnRhdGlvbiBmbGF3cyAtIGF0dHJpYnV0ZSBpZ25vcmVkLgoARURfdG9fdmlydChlKSA9PSBOVUxMAGNsYXNzMi5jAG1lcmdlX2NoYWluAEVEX3RvX3ZpcnQob3JpZykgPT0gTlVMTABtYWtlX2NoYWluAEVEX3RvX3ZpcnQob3JpZykgIT0gTlVMTABORF9yYW5rKGZyb20pIDwgTkRfcmFuayh0bykAY2x1c3Rlci5jAG1hcF9wYXRoACVzIHdhcyBhbHJlYWR5IGluIGEgcmFua3NldCwgZGVsZXRlZCBmcm9tIGNsdXN0ZXIgJXMKAGxoZWFkAGx0YWlsACVzIC0+ICVzOiBzcGxpbmUgc2l6ZSA+IDEgbm90IHN1cHBvcnRlZAoAJXMgLT4gJXM6IGhlYWQgbm90IGluc2lkZSBoZWFkIGNsdXN0ZXIgJXMKACVzIC0+ICVzOiB0YWlsIGlzIGluc2lkZSBoZWFkIGNsdXN0ZXIgJXMKAGJlei0+c2ZsYWcAY29tcG91bmQuYwBtYWtlQ29tcG91bmRFZGdlAGJlei0+ZWZsYWcAJXMgLT4gJXM6IHRhaWwgbm90IGluc2lkZSB0YWlsIGNsdXN0ZXIgJXMKACVzIC0+ICVzOiBoZWFkIGlzIGluc2lkZSB0YWlsIGNsdXN0ZXIgJXMKAHNlZ21lbnQgWyVzLCVzXSBkb2VzIG5vdCBpbnRlcnNlY3QgYm94IGxsPSVzLHVyPSVzCgBib3hJbnRlcnNlY3RmACglLjVnLCUuNWcpAGNsdXN0ZXIgbmFtZWQgJXMgbm90IGZvdW5kCgBjb25jZW50cmF0ZT10cnVlIG1heSBub3Qgd29yayBjb3JyZWN0bHkuCgByZWJ1aWx0ZF92bGlzdHM6IHJhbmsgbGVhZCAlcyBub3QgaW4gb3JkZXIgJWQgb2YgcmFuayAlZAoAZGVnZW5lcmF0ZSBjb25jZW50cmF0ZWQgcmFuayAlcywlZAoATkRfaW4ocmlnaHQpLnNpemUgKyBORF9vdXQocmlnaHQpLnNpemUgPT0gMABjb25jLmMAbWVyZ2V2aXJ0dWFsAGRvdDogT3V0IG9mIG1lbW9yeQoATkRfb3V0KHYpLnNpemUgPT0gMgBmbGF0LmMAc2V0Ym91bmRzAEdEX21pbnJhbmsoZykgPT0gMABhYm9taW5hdGlvbgBuZWF0b19sYXlvdXQAbmVhdG8AZmRwAHNmZHAAdHdvcGkAY2lyY28AcGF0Y2h3b3JrAG9zYWdlAG5vcABub3AxAG5vcDIAJWxmLCVsZiwlbGYlYwBub2RlICVzLCBwb3NpdGlvbiAlcywgZXhwZWN0ZWQgdHdvIGRvdWJsZXMKAG5vdHJhbnNsYXRlAG5vZGUgJXMgaW4gZ3JhcGggJXMgaGFzIG5vIHBvc2l0aW9uCgBzLCVsZiwlbGYlbgAgZSwlbGYsJWxmJW4AcG9zIGF0dHJpYnV0ZSBmb3IgZWRnZSAoJXMsJXMpIGRvZXNuJ3QgaGF2ZSAzbisxIHBvaW50cwoAJWxmLCVsZiVuAHN5bnRheCBlcnJvciBpbiBwb3MgYXR0cmlidXRlIGZvciBlZGdlICglcywlcykKACVsZiwlbGYsJWxmLCVsZgBzdGFydABzZWxmAHJhbmRvbQBub2RlIHBvc2l0aW9ucyBhcmUgaWdub3JlZCB1bmxlc3Mgc3RhcnQ9cmFuZG9tCgBhcyByZXF1aXJlZCBieSB0aGUgLW4gZmxhZwoAX25lYXRvX2NjAGdyYXBoICVzIGlzIGRpc2Nvbm5lY3RlZC4gSGVuY2UsIHRoZSBjaXJjdWl0IG1vZGVsCgBBbHRlcm5hdGl2ZWx5LCBjb25zaWRlciBydW5uaW5nIG5lYXRvIHVzaW5nIC1HcGFjaz10cnVlIG9yIGRlY29tcG9zaW5nCgB0aGUgZ3JhcGggaW50byBjb25uZWN0ZWQgY29tcG9uZW50cy4KAFNvbHZpbmcgbW9kZWwgJWQgaXRlcmF0aW9ucyAlZCB0b2wgJWYKAE5EX2lkKG5wKSA9PSBpAG5lYXRvaW5pdC5jAG1ha2VHcmFwaERhdGEAZiA8IGdyYXBoW2pdLm5lZGdlcwBkZnNDeWNsZQBtb2RlbCAlZCBzbWFydF9pbml0ICVkIHN0cmVzc3d0ICVkIGl0ZXJhdGlvbnMgJWQgdG9sICVmCgBjb252ZXJ0IGdyYXBoOiAAbWFqb3JpemF0aW9uCgAlZCBub2RlcyAlLjJmIHNlYwoAbGV2ZWxzZ2FwAGxheW91dCBhYm9ydGVkCgBzdHJlc3N3dAAlcyBhdHRyaWJ1dGUgdmFsdWUgbXVzdCBiZSAxIG9yIDIgLSBpZ25vcmluZwoAbW9kZWwAY2lyY3VpdABzdWJzZXQAc2hvcnRwYXRoAG1kcwBlZGdlcyBpbiBncmFwaCAlcyBoYXZlIG5vIGxlbiBhdHRyaWJ1dGUuIEhlbmNlLCB0aGUgbWRzIG1vZGVsCgBpcyBpbmFwcHJvcHJpYXRlLiBSZXZlcnRpbmcgdG8gdGhlIHNob3J0ZXN0IHBhdGggbW9kZWwuCgBVbmtub3duIHZhbHVlICVzIGZvciBhdHRyaWJ1dGUgIm1vZGVsIiBpbiBncmFwaCAlcyAtIGlnbm9yZWQKAG1vZGUAS0sAbWFqb3IAaGllcgBJbGxlZ2FsIHZhbHVlICVzIGZvciBhdHRyaWJ1dGUgIm1vZGUiIGluIGdyYXBoICVzIC0gaWdub3JlZAoAbWFrZVNwbGluZTogZmFpbGVkIHRvIG1ha2Ugc3BsaW5lIGVkZ2UgKCVzLCVzKQoAc3BsaW5lICVzICVzCgBiID09IG4AbmVhdG9zcGxpbmVzLmMAbWFrZV9iYXJyaWVycwB0aGUgYm91bmRpbmcgYm94ZXMgb2Ygc29tZSBub2RlcyB0b3VjaCAtIGZhbGxpbmcgYmFjayB0byBzdHJhaWdodCBsaW5lIGVkZ2VzCgBzb21lIG5vZGVzIHdpdGggbWFyZ2luICglLjAyZiwlLjAyZikgdG91Y2ggLSBmYWxsaW5nIGJhY2sgdG8gc3RyYWlnaHQgbGluZSBlZGdlcwoAcG9seWxpbmVzAGxpbmUgc2VnbWVudHMAb3J0aG9nb25hbCBsaW5lcwBDcmVhdGluZyBlZGdlcyB1c2luZyAlcwoAcG9seWxpbmUgJXMgJXMKAG1kc01vZGVsOiBkZWx0YSA9ICVmCgBTZXR0aW5nIHVwIHN0cmVzcyBmdW5jdGlvbgBTb2x2aW5nIG1vZGVsOiAACmZpbmFsIGUgPSAlZiAlZCBpdGVyYXRpb25zICUuMmYgc2VjCgBEYW1waW5nAGRlZmF1bHRkaXN0ACBpbiAlcyAtIHNldHRpbmcgdG8gJS4wMmYKAGJhZCBlZGdlIGxlbiAiJXMiAFNldHRpbmcgaW5pdGlhbCBwb3NpdGlvbnMKAHN0YXJ0PSVzIG5vdCBzdXBwb3J0ZWQgd2l0aCBtb2RlPXNlbGYgLSBpZ25vcmVkCgBTZXR0aW5nIHVwIHNwcmluZyBtb2RlbDogACUuMmYgc2VjCgAKZmluYWwgZSA9ICVmACEAICVkJXMgaXRlcmF0aW9ucyAlLjJmIHNlYwoATWF4LiBpdGVyYXRpb25zICglZCkgcmVhY2hlZCBvbiBncmFwaCAlcwoAJXMgJS4zZgoAJS4zZiAATkRfaGVhcGluZGV4KHYpIDwgMABzdHVmZi5jAG5lYXRvX2VucXVldWUAQ2FsY3VsYXRpbmcgc2hvcnRlc3QgcGF0aHM6IABzcGVjaWZpZWQgcm9vdCBub2RlICIlcyIgd2FzIG5vdCBmb3VuZC4AVXNpbmcgZGVmYXVsdCBjYWxjdWxhdGlvbiBmb3Igcm9vdCBub2RlCgByZXBvc2l0aW9uICVzCgAlcyA6ICVmICVmCgAlcyA6ICVmICVmICVmICVmCgAgIABHcmFwaCAlcyBoYXMgYXJyYXkgcGFja2luZyB3aXRoIHVzZXIgdmFsdWVzIGJ1dCBubyAic29ydHYiIGF0dHJpYnV0ZXMgYXJlIGRlZmluZWQuAHBpbgBXYXJuaW5nOiBub2RlICVzLCBwb3NpdGlvbiAlcywgZXhwZWN0ZWQgdHdvIGZsb2F0cwoAY29vcmRzAGxheW91dCAlcwoAZW5kICVzCgBpZHggPT0gc3oAbGF5b3V0LmMAZXhwYW5kQ2x1c3RlcgBpID09IGRlZwBnZXRFZGdlTGlzdABfZGdfJWQAZGVyaXZlIGdyYXBoICVzIG9mICVzCgBub2RlICIlcyIgaXMgY29udGFpbmVkIGluIHR3byBub24tY29tcGFyYWJsZSBjbHVzdGVycyAiJXMiIGFuZCAiJXMiCgBfcG9ydF8lc18lc18lc18lbGQAX3BvcnRfJXNfKCVkKV8oJWQpXyVsZAAlbGYsJWxmLCVsZiwlbGYlYwBncmFwaCAlcywgY29vcmQgJXMsIGV4cGVjdGVkIGZvdXIgZG91YmxlcwoAc3BsaW5lcyBhbmQgY2x1c3RlciBlZGdlcyBub3Qgc3VwcG9ydGVkIC0gdXNpbmcgbGluZSBzZWdtZW50cwoAbWF4aXRlcgBUMABmZHAgZG9lcyBub3Qgc3VwcG9ydCBzdGFydD1zZWxmIC0gaWdub3JpbmcKAHhMYXlvdXQgADk6cHJpc20AdHJpZXMgPSAlZCwgbW9kZSA9ICVzCgBkZXJpdmVkAGluZm8Ac2ZkcCBvbmx5IHN1cHBvcnRzIHN0YXJ0PXJhbmRvbQoASwByZXB1bHNpdmVmb3JjZQBsZXZlbHMAc21vb3RoaW5nAHF1YWR0cmVlAGJlYXV0aWZ5AG92ZXJsYXBfc2hyaW5rAHJvdGF0aW9uAGxhYmVsX3NjaGVtZQBsYWJlbF9zY2hlbWUgPSAlZCA+IDQgOiBpZ25vcmluZwoAZmFzdABhdmdfZGlzdABncmFwaF9kaXN0AHBvd2VyX2Rpc3QAc3ByaW5nAGRpbWVuAGRpbQBzcHJpbmdfZWxlY3RyaWNhbF9jb250cm9sOgoAICByZXB1bHNpdmUgYW5kIGF0dHJhY3RpdmUgZXhwb25lbnRzOiAlLjAzZiAlLjAzZgoAICByYW5kb20gc3RhcnQgJWQgc2VlZCAlZAoAICBLIDogJS4wM2YgQyA6ICUuMDNmCgAgIG1heCBsZXZlbHMgJWQgY29hcnNlbl9zY2hlbWUgJWQgY29hcnNlbl9ub2RlICVkCgAgIHF1YWR0cmVlIHNpemUgJWQgbWF4X2xldmVsICVkCgAgIEJhcm5lcy1IdXR0IGNvbnN0YW50ICUuMDNmIHRvbGVyYW5jZSAgJS4wM2YgbWF4aXRlciAlZAoAICBjb29saW5nICUuMDNmIHN0ZXAgc2l6ZSAgJS4wM2YgYWRhcHRpdmUgJWQKACAgYmVhdXRpZnlfbGVhdmVzICVkIG5vZGUgd2VpZ2h0cyAlZCByb3RhdGlvbiAlLjAzZgoAICBzbW9vdGhpbmcgJXMgb3ZlcmxhcCAlZCBpbml0aWFsX3NjYWxpbmcgJS4wM2YgZG9fc2hyaW5raW5nICVkCgAgIG9jdHJlZSBzY2hlbWUgJXMgbWV0aG9kICVzCgAgIGVkZ2VfbGFiZWxpbmdfc2NoZW1lICVkCgBTUFJJTkdfRUxFQ1RSSUNBTABTUFJJTkdfTUFYRU5UAFNUUkVTU19NQVhFTlQAU1RSRVNTX0FQUFJPWABTVFJFU1MAVU5JRk9STV9TVFJFU1MARlVMTF9TVFJFU1MATk9ORQBOT1JNQUwARkFTVABIWUJSSUQAU1RSRVNTX01BSk9SSVpBVElPTl9HUkFQSF9ESVNUAFNUUkVTU19NQUpPUklaQVRJT05fQVZHX0RJU1QAU1RSRVNTX01BSk9SSVpBVElPTl9QT1dFUl9ESVNUAFNQUklORwBUUklBTkdMRQBSTkcADSAgICAgICAgICAgICAgICBpdGVyID0gJWQsIHN0ZXAgPSAlZiBGbm9ybSA9ICVmIG56ID0gJWQgIEsgPSAlZiAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAAc3ByaW5nX2VsZWN0cmljYWxfZW1iZWRkaW5nX3Nsb3cAZG1lYW4gPSAlZiwgcmhvID0gJWYKAHNlbmQgcmFuZG9tIGNvb3JkaW5hdGVzCgBzY2FsaW5nIGZhY3RvciA9ICVmCgBRVUFEX1RSRUVfSFlCUklELCBzaXplIGxhcmdlciB0aGFuICVkLCBzd2l0Y2ggdG8gZmFzdCBxdWFkdHJlZQBjdHJsLT5vdmVybGFwPSVkCgAlZCAlZAoAdW5pZm9ybV9zdHJlc3MuYwBVbmlmb3JtU3RyZXNzU21vb3RoZXJfbmV3AFNwYXJzZU1hdHJpeF9pc19zeW1tZXRyaWMoQiwgRkFMU0UpAHVuaWZvcm1fc3RyZXNzAHxlZGdlbGFiZWx8AGxlbgBub3JtYWxpemUAb3ZlcmxhcABPdmVybGFwIHZhbHVlICIlcyIgdW5zdXBwb3J0ZWQgLSBpZ25vcmVkCgBVbnJlY29nbml6ZWQgb3ZlcmxhcCB2YWx1ZSAiJXMiIC0gdXNpbmcgZmFsc2UKAFZvcm9ub2kAb3ZlcmxhcDogJXMgdmFsdWUgJWQgc2NhbGluZyAlLjA0ZgoAb3ZlcmxhcF9zY2FsaW5nAHZvcm9ub2kAc2NhbGluZwB2cHNjAGlwc2VwAG9zY2FsZQBvbGQgc2NhbGluZwBzY2FsZXh5AHggYW5kIHkgc2NhbGluZwBvcnRobwBvcnRob2dvbmFsIGNvbnN0cmFpbnRzAG9ydGhvX3l4AG9ydGhveHkAeHkgb3J0aG9nb25hbCBjb25zdHJhaW50cwBvcnRob3l4AHl4IG9ydGhvZ29uYWwgY29uc3RyYWludHMAcG9ydGhvAHBzZXVkby1vcnRob2dvbmFsIGNvbnN0cmFpbnRzAHBvcnRob195eABwb3J0aG94eQB4eSBwc2V1ZG8tb3J0aG9nb25hbCBjb25zdHJhaW50cwBwb3J0aG95eAB5eCBwc2V1ZG8tb3J0aG9nb25hbCBjb25zdHJhaW50cwBwcmlzbQBBZGp1c3RpbmcgJXMgdXNpbmcgJXMKAFVuaGFuZGxlZCBhZGp1c3Qgb3B0aW9uICVzCgBOdW1iZXIgb2YgaXRlcmF0aW9ucyA9ICVkCgBOdW1iZXIgb2YgaW5jcmVhc2VzID0gJWQKAG92ZXJsYXAgWyVkXSA6ICVkCgB2b3JvX21hcmdpbgBzZXAAZXNlcABOb2RlIHNlcGFyYXRpb246IGFkZD0lZCAoJWYsJWYpCgAlZiwlZgBzY2FsZSA9ICglLjAzZiwlLjAzZikKAEVkZ2Ugc2VwYXJhdGlvbjogYWRkPSVkICglZiwlZikKAENhbGN1bGF0aW5nIGNpcmN1aXQgbW9kZWwAY29uanVnYXRlX2dyYWRpZW50OiB1bmV4cGVjdGVkIGxlbmd0aCAwIHZlY3RvcgoAQ2FsY3VsYXRpbmcgc3Vic2V0IG1vZGVsAGdyYXBoIGlzIGRpc2Nvbm5lY3RlZC4gSGVuY2UsIHRoZSBjaXJjdWl0IG1vZGVsCgBpcyB1bmRlZmluZWQuIFJldmVydGluZyB0byB0aGUgc2hvcnRlc3QgcGF0aCBtb2RlbC4KAENhbGN1bGF0aW5nIE1EUyBtb2RlbABDYWxjdWxhdGluZyBzaG9ydGVzdCBwYXRocwA6ICUuMmYgc2VjCgBTZXR0aW5nIGluaXRpYWwgcG9zaXRpb25zADogJS4yZiBzZWMAY2cAZGVsdGEgPD0gMHhGRkZGAGNvbnN0cmFpbnQuYwBta05Db25zdHJhaW50RwB2ZwBjb21wcmVzcyAlZyAKAHNjYWxlIGJ5ICVnLCVnIAoAYmVzdGNvc3QgPCBIVUdFX1ZBTABjb21wdXRlU2NhbGVYWQBHcmFwaHZpeiBidWlsdCB3aXRob3V0IGFueSB0cmlhbmd1bGF0aW9uIGxpYnJhcnkKAGRlbGF1bmF5X3RyaWFuZ3VsYXRpb246ICVzCgBkZWxhdW5heV90cmk6ICVzCgB0cnlpbmcgdG8gZGVsZXRlIGEgbm9uLWxpbmUKAAppbnRlcnNlY3Rpb24gYXQgJS4zZiAlLjNmCgBzZWcjJWQgOiAoJS4zZiwgJS4zZikgKCUuM2YsICUuM2YpCgByZW1vdmVfb3ZlcmxhcDogR3JhcGh2aXogbm90IGJ1aWx0IHdpdGggdHJpYW5ndWxhdGlvbiBsaWJyYXJ5CgBtYWtlQWRkUG9seTogdW5rbm93biBzaGFwZSB0eXBlICVzCgBtYWtlUG9seTogdW5rbm93biBzaGFwZSB0eXBlICVzCgB4IT1OVUxMAHNtYXJ0X2luaV94LmMASU1EU19naXZlbl9kaW0AaWxsLWNvbmRpdGlvbmVkAHJvb3QgPSAlcyBtYXggc3RlcHMgdG8gcm9vdCA9ICVkCgB0d29waTogdXNlIG9mIHdlaWdodD0wIGNyZWF0ZXMgZGlzY29ubmVjdGVkIGNvbXBvbmVudC4KAFJhbmsgc2VwYXJhdGlvbiA9IAAlLjAzbGYgAGFyZWEAaW5zZXQAJXMgY29vcmQgJS41ZyAlLjVnIGh0ICVmIHdpZHRoICVmCgAlLjAzZgByZWMgJWYgJWYgJWYgJWYKACVmIC0gJWYgJWYgJWYgJWYgPSAlZiAoJWYgJWYgJWYgJWYpCgB0cnlpbmcgdG8gYWRkIHRvIHJlY3QgeyVmICsvLSAlZiwgJWYgKy8tICVmfQoAdG90YWwgYWRkZWQgc28gZmFyID0gJWQKAGFkZGluZyAlZCBpdGVtcywgdG90YWwgYXJlYSA9ICVmLCB3ID0gJWYsIGFyZWEvdz0lZgoAY29tcG91bmRFZGdlczogY291bGQgbm90IGNvbnN0cnVjdCBvYnN0YWNsZXMgLSBmYWxsaW5nIGJhY2sgdG8gc3RyYWlnaHQgbGluZSBlZGdlcwoAY29tcG91bmRFZGdlczogbm9kZXMgdG91Y2ggLSBmYWxsaW5nIGJhY2sgdG8gc3RyYWlnaHQgbGluZSBlZGdlcwoAcGFjayB2YWx1ZSAlZCBpcyBzbWFsbGVyIHRoYW4gZXNlcCAoJS4wM2YsJS4wM2YpCgBzZXAgdmFsdWUgKCUuMDNmLCUuMDNmKSBpcyBzbWFsbGVyIHRoYW4gZXNlcCAoJS4wM2YsJS4wM2YpCgBjYyVzXyVkAGNjJXMrJWQAY19jbnQgPT0gMABjb21wLmMAZmluZENDb21wAGdyaWQoJWQsJWQpOiAlcwoAd2d0ID4gMABRdWFkVHJlZS5jAFF1YWRUcmVlX3JlcHVsc2l2ZV9mb3JjZV9hY2N1bXVsYXRlAHF0Mi0+biA+IDAAcXQxLT5uID4gMCAmJiBxdDItPm4gPiAwAFF1YWRUcmVlX3JlcHVsc2l2ZV9mb3JjZV9pbnRlcmFjdABkaXN0ID4gMAAhKHEtPmwpAFF1YWRUcmVlX2FkZF9pbnRlcm5hbABpaSA8IDE8PGRpbSAmJiBpaSA+PSAwAHEtPnF0c1tpaV0AcS0+biA9PSAxACEocS0+cXRzKQBxLT5sAHdpZHRoID4gMABRdWFkVHJlZV9uZXcAQS0+Zm9ybWF0ID09IEZPUk1BVF9DU1IAU3BhcnNlTWF0cml4LmMAU3BhcnNlTWF0cml4X3RyYW5zcG9zZQBBICYmIEIAU3BhcnNlTWF0cml4X2FkZABBLT5mb3JtYXQgPT0gQi0+Zm9ybWF0ICYmIEEtPmZvcm1hdCA9PSBGT1JNQVRfQ1NSAEEtPnR5cGUgPT0gQi0+dHlwZQBTcGFyc2VNYXRyaXhfaXNfc3ltbWV0cmljAEEtPmZvcm1hdCA9PSBGT1JNQVRfQ09PUkQAU3BhcnNlTWF0cml4X2Zyb21fY29vcmRpbmF0ZV9mb3JtYXQAbSA+IDAgJiYgbiA+IDAgJiYgbnogPj0gMABTcGFyc2VNYXRyaXhfZnJvbV9jb29yZGluYXRlX2FycmF5c19pbnRlcm5hbABBAGphW21hc2tbamFbal1dXSA9PSBqYVtqXQBTcGFyc2VNYXRyaXhfc3VtX3JlcGVhdF9lbnRyaWVzAGlkIDwgbiooeW1heC15bWluKzEpAGphW21hc2tbaWRdXSA9PSBqYVtqXQBTcGFyc2VNYXRyaXhfbXVsdGlwbHlfZGVuc2UyAEEtPnR5cGUgPT0gTUFUUklYX1RZUEVfUkVBTABTcGFyc2VNYXRyaXhfbXVsdGlwbHlfdmVjdG9yAEEtPnR5cGUgPT0gTUFUUklYX1RZUEVfUkVBTCB8fCBBLT50eXBlID09IE1BVFJJWF9UWVBFX0lOVEVHRVIAU3BhcnNlTWF0cml4X211bHRpcGx5X2RlbnNlMQBTcGFyc2VNYXRyaXhfbXVsdGlwbHkAamNbbWFza1tqYltrXV1dID09IGpiW2tdAFNwYXJzZU1hdHJpeF9tdWx0aXBseTMAamRbbWFza1tqY1trXV1dID09IGpjW2tdAFNwYXJzZU1hdHJpeF9jb29yZGluYXRlX2Zvcm1fYWRkX2VudHJpZXMAU3BhcnNlTWF0cml4X2RpdmlkZV9yb3dfYnlfZGVncmVlAG4gPiAxAGdlbmVyYWwuYwBpcmFuZABvbmVibG9jawBtaW5kaXN0AGFydGljdWxhdGlvbl9wb3MAcm9vdABQcmlvcml0eVF1ZXVlLmMAUHJpb3JpdHlRdWV1ZV9wdXNoAGdhaW4gPD0gcS0+bmdhaW4AU3BhcnNlTWF0cml4X2lzX3N5bW1ldHJpYyhBLCBGQUxTRSkAcG9zdF9wcm9jZXNzLmMAaWRlYWxfZGlzdGFuY2VfbWF0cml4AGxlbiA+IDAAU3RyZXNzTWFqb3JpemF0aW9uU21vb3RoZXIyX25ldwBueiA+IDAAaWRlYWxfZGlzdF9zY2hlbWUgdmFsdWUgd3JvbmcAU3BhcnNlTWF0cml4X2lzX3N5bW1ldHJpYyhBLCBGQUxTRSkgJiYgQS0+dHlwZSA9PSBNQVRSSVhfVFlQRV9SRUFMAFNwYXJzZVN0cmVzc01ham9yaXphdGlvblNtb290aGVyX25ldwBpZGlhZyA+PSAwAFN0cmVzc01ham9yaXphdGlvblNtb290aGVyX3Ntb290aAAoIWpjbikgJiYgKCF2YWwpAGdldF9lZGdlX2xhYmVsX21hdHJpeABUcmlhbmdsZVNtb290aGVyX25ldwBqZGlhZyA+PSAwAFNwcmluZ1Ntb290aGVyX25ldwAhZmxhZwBTcHJpbmdTbW9vdGhlcl9zbW9vdGgAbmVpZ2hiPSVkCgByb290ID0gJXMKAF9ibG9ja18lZABzLT5zeiA+IDAAYmxvY2t0cmVlLmMAcG9wAGFjdHVhbABub2RlbGlzdC5jAGluc2VydE5vZGVsaXN0AF9zcGFuXyVkAF9jbG9uZV8lZABpcABkZWdsaXN0LmMAcmVtb3ZlRGVnbGlzdABFcnJvcgBXYXJuaW5nACVzOiAAdXNlcm91dDogY291bGQgbm90IGFsbG9jYXRlIG1lbW9yeQoAX0FHX3N0cmRhdGEAX0FHX2RhdGFkaWN0AGFnZGljdG9mOiB1bmtub3duIGtpbmQgJWQKACVjJWxkAG1lbW9yeSBhbGxvY2F0aW9uIGZhaWx1cmUAYWdkZWxldGUgb24gd3JvbmcgZ3JhcGgAX0FHX3BlbmRpbmcAYWdyZWNvcmRfY2FsbGJhY2sgb2YgYSBiYWQgb2JqZWN0AHBlbmQgZGljdG9mIGEgYmFkIG9iamVjdABtb3ZlIHRvIGZyb250IGxvY2sgaW5jb25zaXN0ZW5jeQBcXABmYXRhbCBmbGV4IHNjYW5uZXIgaW50ZXJuYWwgZXJyb3ItLW5vIGFjdGlvbiBmb3VuZAAlcwoAZmF0YWwgZmxleCBzY2FubmVyIGludGVybmFsIGVycm9yLS1lbmQgb2YgYnVmZmVyIG1pc3NlZABmYXRhbCBlcnJvciAtIHNjYW5uZXIgaW5wdXQgYnVmZmVyIG92ZXJmbG93AG91dCBvZiBkeW5hbWljIG1lbW9yeSBpbiBhYWdfZ2V0X25leHRfYnVmZmVyKCkAaW5wdXQAc3ludGF4IGFtYmlndWl0eSAtIGJhZGx5IGRlbGltaXRlZCBudW1iZXIgJwAnIGluIGxpbmUgJWQgb2YgACBzcGxpdHMgaW50byB0d28gdG9rZW5zCgAlcwBsaW5lACVkICUxWyJdJW4Ab3V0IG9mIGR5bmFtaWMgbWVtb3J5IGluIGFhZ19jcmVhdGVfYnVmZmVyKCkAb3V0IG9mIGR5bmFtaWMgbWVtb3J5IGluIGFhZ2Vuc3VyZV9idWZmZXJfc3RhY2soKQA6IAAgaW4gbGluZSAlZAAgbmVhciAnACBzY2FubmluZyBhIHF1b3RlZCBzdHJpbmcgKG1pc3NpbmcgZW5kcXVvdGU/IGxvbmdlciB0aGFuICVkPykAClN0cmluZyBzdGFydGluZzoiACBzY2FubmluZyBhIEhUTUwgc3RyaW5nIChtaXNzaW5nICc+Jz8gYmFkIG5lc3Rpbmc/IGxvbmdlciB0aGFuICVkPykAClN0cmluZyBzdGFydGluZzo8ACBzY2FubmluZyBhIC8qLi4uKi8gY29tbWVudCAobWlzc2luZyAnKi8/IGxvbmdlciB0aGFuICVkPykAZmxleCBzY2FubmVyIHB1c2gtYmFjayBvdmVyZmxvdwAiIgBzdHJpY3QAbGluZWxlbmd0aAA7CgAgW2tleT0AXQAgWwAsCgA9AF8lbGRfU1VTUEVDVABkaQBzdHJpY3QgAHsKAF07CgAS7u4UCQPu/u7u7gHu7u4B7u4K/u4TGRXuEwHu7u7uCxHu7u7u7u7u7u4B7u4WCQEBHQ8X7u4aFxvu7hzu7u7uARn77u7uAe4Q7u4e7u7u7gACAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgIXEQICAgICAgICAgICAgISEAITAgIWAgICAgICAgICAgICAgICAgICAgICAgICAgIUAhUCAgICAgICAgICAgICAgICAgICAgICAgICAgICAg4CDwICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgIBAgMEBQYHCAkKCwwNCwMEBQ8HAwwNBgwNDgwNGhUWAAEAAwcOBg8IDA0SEyoQEQkQLzARMhcTDRQSLhIUQRMyEyxAKkIZLEJGIgwNDiMPCRARChARyRARLUVG/AEG9g8H9iQCEBEvMDZNTigmOzwqNjE5PT8vOkDYRDA+JTdDNUsrOElMAAMJAAAAAQ4CCwwIIyQlNjs9AA0QEhsWHBInMiIXMx48Bgc1BQ8RFBgpABMpAAAAAAA3FSgdHgAhJjQfMD4ZLAAbACAaKgArOi4vADE4OS0AAgIBAAMDAQABAAEBAQACAQEAAgIDAQEAAAUAAQMBAwUDAQEBAQIAAQAEAgACAQEDAgEAAwIBAAEBAAEBAQMAGBkZGRobHBwdHR4eHx8gICEhIiIjJCQmJyUlKCgpKSkqKisrKywsLS0uLy8wMTEyMzQ2NTc3Nzg4ODk5Ojru7v/u7u7u7u4fIO4A7+7u7gzu7u4IDe7u7vju7u7u7u717v8DCAQhBQsSEycUFRYpMkEXGBkaLDM0QkdIG0ocHS4eTx8ga2V5AGF0dHJpYnV0ZSBtYWNyb3Mgbm90IGltcGxlbWVudGVkACVzOiVzAENvdWxkIG5vdCBvcGVuICIlcyIgZm9yIHdyaXRpbmcgOiAlcwoATm8gbGlieiBzdXBwb3J0LgoALiVkAG5vbmFtZS5ndgBndndyaXRlX25vX3ogcHJvYmxlbSAlZAoAbWVtb3J5IGFsbG9jYXRpb24gZmFpbHVyZQoATm8gbGlieiBzdXBwb3J0CgBndnByaW50ZjogJXMKAC05OTk5OTk5OTk5OTk5OTkuOTkAZ3JhcGh2aXoAMi40MC4xADIwMTYxMjI1LjAzMDQAcmVuZGVyAGRldmljZQBsb2FkaW1hZ2UAZHluYW1pYyBsb2FkaW5nIG5vdCBhdmFpbGFibGUKAFVzaW5nICVzOiAlczolcwoAZ3Z1c2Vyc2hhcGUuYwBndnVzZXJzaGFwZV9maW5kAGd2dXNlcnNoYXBlX2ZpbGVfYWNjZXNzAEZpbGVuYW1lICIlcyIgaXMgdW5zYWZlCgAlcyB3aGlsZSBvcGVuaW5nICVzCgB1cy0+ZgBndnVzZXJzaGFwZV9vcGVuACIlcyIgd2FzIG5vdCBmb3VuZCBhcyBhIGZpbGUgb3IgYXMgYSBzaGFwZSBsaWJyYXJ5IG1lbWJlcgoAL01lZGlhQm94AChbYS16XVthLXpBLVpdKik9IihbXiJdKikiAGNhbm5vdCBjb21waWxlIHJlZ3VsYXIgZXhwcmVzc2lvbiAlcwAlbGYlMnMAcHQAdmlld0JveAAlbGYgJWxmICVsZiAlbGYAaW4AcHgAcGMAIgBjbQBtbQAlJUJvdW5kaW5nQm94OgAB0NHS09TV1tfY2QA8c3ZnAFdFQlAAd2VicAAobGliKQCJUE5HDQoaCgBwbmcAJSFQUy1BZG9iZS0AQk0AYm1wAEdJRjgAZ2lmAP/Y/+AAanBlZwAlUERGLQBwZGYAxdDTxgBlcHMAPD94bWwAeG1sAFJJRkYAcmlmZgAAAAEAAGljbwAlZCAlZCAlZCAlZABMYXlvdXQgd2FzIG5vdCBkb25lCgBmYWlsdXJlIG1hbGxvYydpbmcgZm9yIHJlc3VsdCBzdHJpbmcAZ2M6IE91dCBvZiBtZW1vcnkKAF9jY18Ab3JpZwBvcABjY29tcHMuYwBtYXBDbHVzdABjY2dyYXBoaW5mbwBjY2dub2RlaW5mbwAoJTRsZCkgJTdsZCBub2RlcyAlN2xkIGVkZ2VzCgAgICAgICAgJTdkIG5vZGVzICU3ZCBlZGdlcyAlN2xkIGNvbXBvbmVudHMgJXMKAGRnAEVycm9yOiBub2RlICIlcyIgYmVsb25ncyB0byB0d28gbm9uLW5lc3RlZCBjbHVzdGVycyAiJXMiIGFuZCAiJXMiCgBzb3J0dgByb3cgbWFqb3IAY29sdW1uIG1ham9yAGFycmF5IHBhY2tpbmc6ICVzICVkIHJvd3MgJWQgY29sdW1ucwoAYmJbJXNdICUuNWcgJS41ZyAlLjVnICUuNWcKAHN0ZXAgc2l6ZSA9ICVkCgBwb3NbJWRdICVkICVkCgBjYyAoJWQgY2VsbHMpIGF0ICglZCwlZCkgKCVkLCVkKQoAY2MgKCVkIGNlbGxzKSBhdCAoJWQsJWQpCgAlcyBuby4gY2VsbHMgJWQgVyAlZCBIICVkCgAgICVkICVkIGNlbGwKAGxpYnBhY2s6IGRpc2MgPSAlZiAoIDwgMCkKAFBhY2tpbmc6IGNvbXB1dGUgZ3JpZCBzaXplCgBhICVmIGIgJWYgYyAlZiBkICVmIHIgJWYKAHJvb3QgJWQgKCVmKSAlZCAoJWYpCgAgcjEgJWYgcjIgJWYKAHBpbmZvAHBhY2suYwBnZXRQYWNrSW5mbwAgIG1hcmdpbiAlZAoAcGFja21vZGUAcGFyc2VQYWNrTW9kZUluZm8AYXJyYXkAYXNwZWN0ACVmAHBhY2sgaW5mbzoKACAgbW9kZSAgICVzCgAgIGFzcGVjdCAlZgoAICBzaXplICAgJWQKACAgZmxhZ3MgICVkCgB1bmRlZmluZWQAcGFjawBBcnJvdyB0eXBlICIlcyIgdW5rbm93biAtIGlnbm9yaW5nCgBub3JtYWwAY3JvdwB0ZWUAZG90AGludgB2ZWUAcGVuAG1wdHkAY3VydmUAaWN1cnZlAGwAaGFsZgBpbnZlbXB0eQBfYmFja2dyb3VuZABfZHJhd18AQ291bGQgbm90IHBhcnNlICJfYmFja2dyb3VuZCIgYXR0cmlidXRlIGluIGdyYXBoICVzCgAgICIlcyIKAG5vIG1lbW9yeSBmcm9tIHptYWxsb2MoKQoAb2JqAGVtaXQuYwBwb3Bfb2JqX3N0YXRlAGNsdXN0ACVsZABwYWdlJWQsJWRfAFRvdGFsIHNpemUgPiAxIGluICIlcyIgY29sb3Igc3BlYyAASWxsZWdhbCBsZW5ndGggdmFsdWUgaW4gIiVzIiBjb2xvciBhdHRyaWJ1dGUgAGxucmNvbG9yc2NoZW1lAGVtaXRfZWRnZV9sYWJlbAAlcy0lcwBmb3J3YXJkAGJhY2sAIC0+IAAgLS0gAGluIGVkZ2UgJXMlcyVzCgBsYWJlbGFsaWduZWQAZWRnZWhyZWYAZWRnZVVSTABsYWJlbGhyZWYAbGFiZWxVUkwAdGFpbGhyZWYAdGFpbFVSTABoZWFkaHJlZgBoZWFkVVJMAGVkZ2V0YXJnZXQAbGFiZWx0YXJnZXQAdGFpbHRhcmdldABoZWFkdGFyZ2V0AGVkZ2V0b29sdGlwAGxhYmVsdG9vbHRpcAB0YWlsdG9vbHRpcABoZWFkdG9vbHRpcAABbmVzdGluZyBub3QgYWxsb3dlZCBpbiBzdHlsZTogJXMKAHVubWF0Y2hlZCAnKScgaW4gc3R5bGU6ICVzCgB0cnVuY2F0aW5nIHN0eWxlICclcycKAHVubWF0Y2hlZCAnKCcgaW4gc3R5bGU6ICVzCgBhbGwAaW4gY2x1c3RlciAlcwoATW9yZSB0aGFuIDIgY29sb3JzIHNwZWNpZmllZCBmb3IgYSBncmFkaWVudCAtIGlnbm9yaW5nIHJlbWFpbmluZwoAZ3JhZGllbnQgcGVuIGNvbG9ycyBub3QgeWV0IHN1cHBvcnRlZC4KAEltYWdlcyB1bnN1cHBvcnRlZCBpbiAiYmFja2dyb3VuZCIgYXR0cmlidXRlCgBsYXllcnMgbm90IHN1cHBvcnRlZCBpbiAlcyBvdXRwdXQKAExheW91dCB3YXMgbm90IGRvbmUuICBNaXNzaW5nIGxheW91dCBwbHVnaW5zPyAKAGd2UmVuZGVySm9icyAlczogJS4yZiBzZWNzLgoAbGF5b3V0IHdhcyBub3QgZG9uZQoAcmVuZGVyZXIgZm9yICVzIGlzIHVuYXZhaWxhYmxlCgBwYWdlZGlyPSVzIGlnbm9yZWQKAHZpZXdwb3J0ACVsZiwlbGYsJWxmLCclW14nXScAJWxmLCVsZiwlbGYsJVteLF0lcwAlbGYsJWxmLCVsZiwlbGYsJWxmAG91dHB1dG9yZGVyAG9kZXNmaXJzdABkZ2VzZmlyc3QAbGF5ZXJzAGxheWVyc2VsZWN0AFRoZSBsYXllcnNlbGVjdCBhdHRyaWJ1dGUgIiVzIiBkb2VzIG5vdCBtYXRjaCBhbnkgbGF5ZXIgc3BlY2lmZWQgYnkgdGhlIGxheWVycyBhdHRyaWJ1dGUgLSBpZ25vcmVkLgoAbGF5ZXJzZXAAOgkgAGxheWVybGlzdHNlcAAsAFRoZSBjaGFyYWN0ZXIgJyVjJyBhcHBlYXJzIGluIGJvdGggdGhlIGxheWVyc2VwIGFuZCBsYXllcmxpc3RzZXAgYXR0cmlidXRlcyAtIGxheWVybGlzdHNlcCBpZ25vcmVkLgoAcGFkAEJMAHBhZ2VkaXIAc29saWQAAHNldGxpbmV3aWR0aAAxAABzcGwtPnNpemUgPiAwAGluaXRfc3BsaW5lc19iYgBiei5zaXplID4gMABiZXppZXJfYmIAYnouc2l6ZSAlIDMgPT0gMQAlbGYAZm9udHBhdGgARE9URk9OVFBBVEgAR0RGT05UUEFUSABpbWFnZXBhdGgAcXVhbnR1bQByYW5rZGlyAExSAEJUAFJMAG5vZGVzZXAAcmFua3NlcABlcXVhbGx5AHNob3dib3hlcwBmb250bmFtZXMAc2l6ZQBwYWdlAGNlbnRlcgByb3RhdGUAb3JpZW50YXRpb24AbGFuZHNjYXBlAGNsdXN0ZXJyYW5rAGNvbmNlbnRyYXRlAGRwaQByZXNvbHV0aW9uAG9yZGVyaW5nAGZpbGxjb2xvcgBmb250c2l6ZQBmb250bmFtZQBmb250Y29sb3IAeGxhYmVsAHBlbndpZHRoAHBlcmlwaGVyaWVzAHNrZXcAZGlzdG9ydGlvbgBub2p1c3RpZnkAbGF5ZXIAZ3JvdXAAY29tbWVudAB2ZXJ0aWNlcwB6AHdlaWdodABsYWJlbGZsb2F0AGRpcgBhcnJvd2hlYWQAYXJyb3d0YWlsAGhlYWRsYWJlbAB0YWlsbGFiZWwAbGFiZWxmb250c2l6ZQBsYWJlbGZvbnRuYW1lAGxhYmVsZm9udGNvbG9yAGxhYmVsZGlzdGFuY2UAbGFiZWxhbmdsZQBtaW5sZW4AZGVjb3JhdGUAYXJyb3dzaXplAGNvbnN0cmFpbnQAdGFpbGNsaXAAaGVhZGNsaXAAbGFiZWxqdXN0AGxvY2FsAGdsb2JhbAAlbGYsJWxmJWMAJWxmJWMAcmF0aW8AYXV0bwBjb21wcmVzcwBleHBhbmQAZmlsbABnZABwcwBzdmcAY2hhcnNldAB1dGYtOABsYXRpbi0xAGxhdGluMQBsMQBJU08tODg1OS0xAElTT184ODU5LTEASVNPODg1OS0xAElTTy1JUi0xMDAAYmlnLTUAYmlnNQB1dGY4AFVuc3VwcG9ydGVkIGNoYXJzZXQgIiVzIiAtIGFzc3VtaW5nIHV0Zi04CgBVbnN1cHBvcnRlZCBjaGFyc2V0IHZhbHVlICVkCgBVVEYtOABCSUctNQBpbiBsYWJlbCBvZiBncmFwaCAlcwoAaW4gbGFiZWwgb2Ygbm9kZSAlcwoAaW4gbGFiZWwgb2YgZWRnZSAlcyAlcyAlcwoAa2luZCA9PSBMVF9OT05FAGxhYmVscy5jAG1ha2VfbGFiZWwAXEwAXEcAXEUAXEgAXFQAJiMxMzsAJiMxMDsAJnF1b3Q7ACYjMTYwOwAmYW1wOwAmZ3Q7ACYjMzk7ACYjNDU7ACZsdDsAJXMgJWQgbm9kZXMgJWQgZWRnZXMgbWF4aXRlcj0lZCBiYWxhbmNlPSVkCgBuZXR3b3JrIHNpbXBsZXg6IAAlZCAAJXMlZCBub2RlcyAlZCBlZGdlcyAlZCBpdGVyICUuMmYgc2VjCgB1cGRhdGU6IG1pc21hdGNoZWQgbGNhIGluIHRyZWV1cGRhdGVzCgBUcmVlX2VkZ2Uuc2l6ZSA9PSBOX25vZGVzIC0gMQBucy5jAGZlYXNpYmxlX3RyZWUAIVRSRUVfRURHRShlKQBtZXJnZV90cmVlcwAocjAtPmhlYXBfaW5kZXggPiAtMSkgfHwgKHIxLT5oZWFwX2luZGV4ID4gLTEpAFNUc2V0VW5pb24Aci0+aGVhcF9pbmRleCA+PSAwAGFkZF90cmVlX2VkZ2U6IG1pc3NpbmcgdHJlZSBlZGdlCgBhZGRfdHJlZV9lZGdlOiBlbXB0eSBvdXRlZGdlIGxpc3QKAGFkZF90cmVlX2VkZ2U6IGVtcHR5IGluZWRnZSBsaXN0CgB0cm91YmxlIGluIGluaXRfcmFuawoACSVzICVkCgBzZWFyY2hzaXplAGdyYXBoIAAgAG5vZGUgAHN0b3AKACUuNWcAcG9zAHJlY3RzAHhscABscABoZWFkX2xwAHRhaWxfbHAAbHdpZHRoAGxoZWlnaHQAYmIAJS41ZywlLjVnLCUuNWcALCUuNWcAJS41ZywlLjVnAHNhbXBsZXBvaW50cwAlLjVnICUuNWcAcywlLjVnLCUuNWcgAGUsJS41ZywlLjVnIAAlLjVnLCUuNWcsJS41ZywlLjVnACUuMmYAJS41ZywlLjVnLCUuNWcsJS41ZyAAL3BhdGhib3ggewogICAgL1ggZXhjaCBuZWcgJS41ZyBzdWIgZGVmCiAgICAvWSBleGNoICUuNWcgc3ViIGRlZgogICAgL3ggZXhjaCBuZWcgJS41ZyBzdWIgZGVmCiAgICAveSBleGNoICUuNWcgc3ViIGRlZgogICAgbmV3cGF0aCB4IHkgbW92ZXRvCiAgICBYIHkgbGluZXRvCiAgICBYIFkgbGluZXRvCiAgICB4IFkgbGluZXRvCiAgICBjbG9zZXBhdGggc3Ryb2tlCn0gZGVmCgAvcGF0aGJveCB7CiAgICAvWSBleGNoICUuNWcgc3ViIGRlZgogICAgL1ggZXhjaCAlLjVnIHN1YiBkZWYKICAgIC95IGV4Y2ggJS41ZyBzdWIgZGVmCiAgICAveCBleGNoICUuNWcgc3ViIGRlZgogICAgbmV3cGF0aCB4IHkgbW92ZXRvCiAgICBYIHkgbGluZXRvCiAgICBYIFkgbGluZXRvCiAgICB4IFkgbGluZXRvCiAgICBjbG9zZXBhdGggc3Ryb2tlCiB9IGRlZgovZGJnc3RhcnQgeyBnc2F2ZSAlLjVnICUuNWcgdHJhbnNsYXRlIH0gZGVmCi9hcnJvd2xlbmd0aCAxMCBkZWYKL2Fycm93d2lkdGggYXJyb3dsZW5ndGggMiBkaXYgZGVmCi9hcnJvd2hlYWQgewogICAgZ3NhdmUKICAgIHJvdGF0ZQogICAgY3VycmVudHBvaW50CiAgICBuZXdwYXRoCiAgICBtb3ZldG8KICAgIGFycm93bGVuZ3RoIGFycm93d2lkdGggMiBkaXYgcmxpbmV0bwogICAgMCBhcnJvd3dpZHRoIG5lZyBybGluZXRvCiAgICBjbG9zZXBhdGggZmlsbAogICAgZ3Jlc3RvcmUKfSBiaW5kIGRlZgovbWFrZWFycm93IHsKICAgIGN1cnJlbnRwb2ludCBleGNoIHBvcCBzdWIgZXhjaCBjdXJyZW50cG9pbnQgcG9wIHN1YiBhdGFuCiAgICBhcnJvd2hlYWQKfSBiaW5kIGRlZgovcG9pbnQgeyAgICBuZXdwYXRoICAgIDIgMCAzNjAgYXJjIGZpbGx9IGRlZi9tYWtldmVjIHsKICAgIC9ZIGV4Y2ggZGVmCiAgICAvWCBleGNoIGRlZgogICAgL3kgZXhjaCBkZWYKICAgIC94IGV4Y2ggZGVmCiAgICBuZXdwYXRoIHggeSBtb3ZldG8KICAgIFggWSBsaW5ldG8gc3Ryb2tlCiAgICBYIFkgbW92ZXRvCiAgICB4IHkgbWFrZWFycm93Cn0gZGVmCgBsb3N0ICVzICVzIGVkZ2UKAG5vIHBvc2l0aW9uIGZvciBlZGdlIHdpdGggbGFiZWwgJXMAbm8gcG9zaXRpb24gZm9yIGVkZ2Ugd2l0aCB0YWlsIGxhYmVsICVzAG5vIHBvc2l0aW9uIGZvciBlZGdlIHdpdGggaGVhZCBsYWJlbCAlcwBubyBwb3NpdGlvbiBmb3IgZWRnZSB3aXRoIHhsYWJlbCAlcwBmb3JjZWxhYmVscwAlZCBvdXQgb2YgJWQgbGFiZWxzIHBvc2l0aW9uZWQuCgAlZCBvdXQgb2YgJWQgZXh0ZXJpb3IgbGFiZWxzIHBvc2l0aW9uZWQuCgAlZCBvYmpzICVkIHhsYWJlbHMgZm9yY2U9JWQgYmI9KCUuMDJmLCUuMDJmKSAoJS4wMmYsJS4wMmYpCgBvYmplY3RzCgAgWyVkXSAoJS4wMmYsJS4wMmYpICglLjAyZiwlLjAyZikgJXAgIiVzIgoAeGxhYmVscwoAIFslZF0gJXAgc2V0ICVkICglLjAyZiwlLjAyZikgKCUuMDJmLCUuMDJmKSAlcwoAc2hhcGVmaWxlIG5vdCBzZXQgb3Igbm90IGZvdW5kIGZvciBlcHNmIG5vZGUgJXMKAGNvdWxkbid0IG9wZW4gZXBzZiBmaWxlICVzCgAlJSUlQm91bmRpbmdCb3g6ICVkICVkICVkICVkAHJlYWQAQm91bmRpbmdCb3ggbm90IGZvdW5kIGluIGVwc2YgZmlsZSAlcwoAY2FuJ3QgZmluZCBsaWJyYXJ5IGZpbGUgJXMKAGNhbid0IG9wZW4gbGlicmFyeSBmaWxlICVzCgBFT0YAQkVHSU4ARU5EAFRSQUlMRVIAL3VzZXJfc2hhcGVfJWQgewoAJSVCZWdpbkRvY3VtZW50OgoAJSVFbmREb2N1bWVudAoAfSBiaW5kIGRlZgoAVVRGLTggaW5wdXQgdXNlcyBub24tTGF0aW4xIGNoYXJhY3RlcnMgd2hpY2ggY2Fubm90IGJlIGhhbmRsZWQgYnkgdGhpcyBQb3N0U2NyaXB0IGRyaXZlcgoAY2Fubm90IHJlLWFsbG9jYXRlIHBzCgByb3V0ZXNwbGluZXNpbml0OiBjYW5ub3QgYWxsb2NhdGUgcHMKAHJvdXRlc3BsaW5lczogJWQgZWRnZXMsICVkIGJveGVzICUuMmYgc2VjCgBpbiByb3V0ZXNwbGluZXMsIGNhbm5vdCBmaW5kIE5PUk1BTCBlZGdlCgBpbiByb3V0ZXNwbGluZXMsIGlsbGVnYWwgdmFsdWVzIG9mIHByZXYgJWQgYW5kIG5leHQgJWQsIGxpbmUgJWQKAGluIHJvdXRlc3BsaW5lcywgZWRnZSBpcyBhIGxvb3AgYXQgJXMKAGluIHJvdXRlc3BsaW5lcywgUHNob3J0ZXN0cGF0aCBmYWlsZWQKAGluIHJvdXRlc3BsaW5lcywgUHJvdXRlc3BsaW5lIGZhaWxlZAoAVW5hYmxlIHRvIHJlY2xhaW0gYm94IHNwYWNlIGluIHNwbGluZSByb3V0aW5nIGZvciBlZGdlICIlcyIgLT4gIiVzIi4gU29tZXRoaW5nIGlzIHByb2JhYmx5IHNlcmlvdXNseSB3cm9uZy4KAGluIGNoZWNrcGF0aCwgYm94IDAgaGFzIExMIGNvb3JkID4gVVIgY29vcmQKAGluIGNoZWNrcGF0aCwgYm94ICVkIGhhcyBMTCBjb29yZCA+IFVSIGNvb3JkCgBpbiBjaGVja3BhdGgsIGJveGVzICVkIGFuZCAlZCBkb24ndCB0b3VjaAoAaW4gY2hlY2twYXRoLCBzdGFydCBwb3J0IG5vdCBpbiBmaXJzdCBib3gKAGluIGNoZWNrcGF0aCwgZW5kIHBvcnQgbm90IGluIGxhc3QgYm94CgAlZCBib3hlczoKACVkICglLjVnLCAlLjVnKSwgKCUuNWcsICUuNWcpCgBjb25zdHJhaW5lZABub3QgY29uc3RyYWluZWQAc3RhcnQgcG9ydDogKCUuNWcsICUuNWcpLCB0YW5nZW50IGFuZ2xlOiAlLjVnLCAlcwoAZW5kIHBvcnQ6ICglLjVnLCAlLjVnKSwgdGFuZ2VudCBhbmdsZTogJS41ZywgJXMKAHNpZGVzID09IDQAc2hhcGVzLmMAcm91bmRfY29ybmVycwBiYWQgbGFiZWwgZm9ybWF0ICVzCgBcTgBtYXJnaW4AJWxmLCVsZgByZWd1bGFyAGN1c3RvbQBzaGFwZWZpbGUAPG5pbD4ATm8gb3IgaW1wcm9wZXIgc2hhcGVmaWxlPSIlcyIgZm9yIG5vZGUgIiVzIgoATm8gb3IgaW1wcm9wZXIgaW1hZ2U9IiVzIiBmb3Igbm9kZSAiJXMiCgBsYWJlbGxvYwBub2RlICclcycsIGdyYXBoICclcycgc2l6ZSB0b28gc21hbGwgZm9yIGxhYmVsCgBlcHNmAHVzaW5nICVzIGZvciB1bmtub3duIHNoYXBlICVzCgBwb2x5Z29uAG92YWwAY2lyY2xlAHBvaW50AGVnZwB0cmlhbmdsZQBwbGFpbnRleHQAcGxhaW4AZGlhbW9uZAB0cmFwZXppdW0AcGFyYWxsZWxvZ3JhbQBob3VzZQBwZW50YWdvbgBoZXhhZ29uAHNlcHRhZ29uAG9jdGFnb24Abm90ZQB0YWIAZm9sZGVyAGJveDNkAGNvbXBvbmVudABjeWxpbmRlcgByZWN0AHJlY3RhbmdsZQBzcXVhcmUAZG91YmxlY2lyY2xlAGRvdWJsZW9jdGFnb24AdHJpcGxlb2N0YWdvbgBpbnZ0cmlhbmdsZQBpbnZ0cmFwZXppdW0AaW52aG91c2UAdW5kZXJsaW5lAE1kaWFtb25kAE1zcXVhcmUATWNpcmNsZQBwcm9tb3RlcgBjZHMAdGVybWluYXRvcgB1dHIAaW5zdWxhdG9yAHJpYm9zaXRlAHJuYXN0YWIAcHJvdGVhc2VzaXRlAHByb3RlaW5zdGFiAHByaW1lcnNpdGUAcmVzdHJpY3Rpb25zaXRlAGZpdmVwb3ZlcmhhbmcAdGhyZWVwb3ZlcmhhbmcAbm92ZXJoYW5nAGFzc2VtYmx5AHNpZ25hdHVyZQBycHJvbW90ZXIAbGFycm93AHJhcnJvdwBscHJvbW90ZXIAcmVjb3JkAE1yZWNvcmQAc3RhcgAjODA4MDgwACNmY2ZjZmMAIzMwMzAzMAAjZThlOGU4ACNlMGUwZTAAI2YwZjBmMAAjMTAxMDEwACNmOGY4ZjgAaW4gbm9kZSAlcwoAcm91bmRlZABkaWFnb25hbHMAcmFkaWFsAHN0cmlwZWQAd2VkZ2VkAF8Abm9kZSAlcywgcG9ydCAlcywgdW5yZWNvZ25pemVkIGNvbXBhc3MgcG9pbnQgJyVzJyAtIGlnbm9yZWQKAG5vZGUgJXMsIHBvcnQgJXMgdW5yZWNvZ25pemVkCgAlLjVnICUuNWcgdHJhbnNsYXRlIG5ld3BhdGggdXNlcl9zaGFwZV8lZAoAaW52aXMAAGZpbGxlZAAAcwBlAHcAc3BsaW5lcy5jAGJlZ2lucGF0aABQLT5lbmQudGhldGEgPCAyICogTV9QSQBlbmRwYXRoAG1ha2VTZWxmRWRnZQBnZXRzcGxpbmVwb2ludHM6IG5vIHNwbGluZSBwb2ludHMgYXZhaWxhYmxlIGZvciBlZGdlICglcywlcykKAHBvbHlsaW5lTWlkcG9pbnQAc3Bhbi0+Zm9udAB0ZXh0c3Bhbi5jAHRleHRzcGFuX3NpemUAZm9udC0+bmFtZQBmb250bmFtZTogIiVzIiByZXNvbHZlZCB0bzogJXMKAGZvbnRuYW1lOiB1bmFibGUgdG8gcmVzb2x2ZSAiJXMiCgBjb3VyAGFyaWFsAGhlbHZldGljYQBbaW50ZXJuYWwgdGltZXNdAFtpbnRlcm5hbCBjb3VyaWVyXQBbaW50ZXJuYWwgYXJpYWxdAEF2YW50R2FyZGUtQm9vawBVUlcgR290aGljIEwAYm9vawBzYW5zLVNlcmlmAEF2YW50R2FyZGUtQm9va09ibGlxdWUAb2JsaXF1ZQBpdGFsaWMAQXZhbnRHYXJkZS1EZW1pAGRlbWkAQXZhbnRHYXJkZS1EZW1pT2JsaXF1ZQBCb29rbWFuLURlbWkAVVJXIEJvb2ttYW4gTABzZXJpZgBCb29rbWFuLURlbWlJdGFsaWMAQm9va21hbi1MaWdodABsaWdodABCb29rbWFuLUxpZ2h0SXRhbGljAENvdXJpZXIAbW9ub3NwYWNlAENvdXJpZXItQm9sZABDb3VyaWVyLUJvbGRPYmxpcXVlAENvdXJpZXItT2JsaXF1ZQBIZWx2ZXRpY2EASGVsdmV0aWNhLUJvbGQASGVsdmV0aWNhLUJvbGRPYmxpcXVlAEhlbHZldGljYS1OYXJyb3cAY29uZGVuc2VkAEhlbHZldGljYS1OYXJyb3ctQm9sZABIZWx2ZXRpY2EtTmFycm93LUJvbGRPYmxpcXVlAEhlbHZldGljYS1OYXJyb3ctT2JsaXF1ZQBIZWx2ZXRpY2EtT2JsaXF1ZQBOZXdDZW50dXJ5U2NobGJrLUJvbGQAQ2VudHVyeSBTY2hvb2xib29rIEwATmV3Q2VudHVyeVNjaGxiay1Cb2xkSXRhbGljAE5ld0NlbnR1cnlTY2hsYmstSXRhbGljAE5ld0NlbnR1cnlTY2hsYmstUm9tYW4Acm9tYW4AUGFsYXRpbm8tQm9sZABQYWxhdGlubyBMaW5vdHlwZQBQYWxhdGluby1Cb2xkSXRhbGljAFBhbGF0aW5vLUl0YWxpYwBQYWxhdGluby1Sb21hbgBTeW1ib2wAZmFudGFzeQBUaW1lcy1Cb2xkAFRpbWVzAFRpbWVzLUJvbGRJdGFsaWMAVGltZXMtSXRhbGljAFphcGZDaGFuY2VyeS1NZWRpdW1JdGFsaWMAVVJXIENoYW5jZXJ5IEwAbWVkaXVtAFphcGZEaW5nYmF0cwBEaW5nYmF0cwBpbnB1dHNjYWxlAG5vAHRydWUAeWVzAHV0aWxzLmMAdSA9PSBVRl9maW5kKHUpAFVGX3NldG5hbWUAAWZpbGUgbG9hZGluZyBpcyBkaXNhYmxlZCBiZWNhdXNlIHRoZSBlbnZpcm9ubWVudCBjb250YWlucyBTRVJWRVJfTkFNRT0iJXMiCmFuZCB0aGUgR1ZfRklMRV9QQVRIIHZhcmlhYmxlIGlzIHVuc2V0IG9yIGVtcHR5LgoAUGF0aCBwcm92aWRlZCB0byBmaWxlOiAiJXMiIGhhcyBiZWVuIGlnbm9yZWQgYmVjYXVzZSBmaWxlcyBhcmUgb25seSBwZXJtaXR0ZWQgdG8gYmUgbG9hZGVkIGZyb20gdGhlIGRpcmVjdG9yaWVzIGluICIlcyIgd2hlbiBydW5uaW5nIGluIGFuIGh0dHAgc2VydmVyLgoAJXMlcyVzAC8AOgBlbGxpcHNlAFRpbWVzLVJvbWFuAGNsdXN0ZXIAX19jbHVzdGVybm9kZXMAY2x1c3RlciBjeWNsZSAlcyAtLSAlcyBub3Qgc3VwcG9ydGVkCgB0YWlsIGNsdXN0ZXIgJXMgaW5zaWRlIGhlYWQgY2x1c3RlciAlcwoAaGVhZCBjbHVzdGVyICVzIGluc2lkZSB0YWlsIGNsdXN0ZXIgJXMKAHRhaWwgbm9kZSAlcyBpbnNpZGUgaGVhZCBjbHVzdGVyICVzCgBoZWFkIG5vZGUgJXMgaW5zaWRlIHRhaWwgY2x1c3RlciAlcwoAX18AbGFiZWwAc2hhcGUAYm94AFR3byBjbHVzdGVycyBuYW1lZCAlcyAtIHRoZSBzZWNvbmQgd2lsbCBiZSBpZ25vcmVkCgBtYXBOAEFFbGlnAEFhY3V0ZQBBY2lyYwBBZ3JhdmUAQWxwaGEAQXJpbmcAQXRpbGRlAEF1bWwAQmV0YQBDY2VkaWwAQ2hpAERhZ2dlcgBEZWx0YQBFVEgARWFjdXRlAEVjaXJjAEVncmF2ZQBFcHNpbG9uAEV0YQBFdW1sAEdhbW1hAElhY3V0ZQBJY2lyYwBJZ3JhdmUASW90YQBJdW1sAEthcHBhAExhbWJkYQBNdQBOdGlsZGUATnUAT0VsaWcAT2FjdXRlAE9jaXJjAE9ncmF2ZQBPbWVnYQBPbWljcm9uAE9zbGFzaABPdGlsZGUAT3VtbABQaGkAUGkAUHJpbWUAUHNpAFJobwBTY2Fyb24AU2lnbWEAVEhPUk4AVGF1AFRoZXRhAFVhY3V0ZQBVY2lyYwBVZ3JhdmUAVXBzaWxvbgBVdW1sAFhpAFlhY3V0ZQBZdW1sAFpldGEAYWFjdXRlAGFjaXJjAGFjdXRlAGFlbGlnAGFncmF2ZQBhbGVmc3ltAGFscGhhAGFtcABhbmQAYW5nAGFyaW5nAGFzeW1wAGF0aWxkZQBhdW1sAGJkcXVvAGJldGEAYnJ2YmFyAGJ1bGwAY2FwAGNjZWRpbABjZWRpbABjZW50AGNoaQBjaXJjAGNsdWJzAGNvbmcAY29weQBjcmFycgBjdXAAY3VycmVuAGRBcnIAZGFnZ2VyAGRhcnIAZGVnAGRlbHRhAGRpYW1zAGRpdmlkZQBlYWN1dGUAZWNpcmMAZWdyYXZlAGVtcHR5AGVtc3AAZW5zcABlcHNpbG9uAGVxdWl2AGV0YQBldGgAZXVtbABldXJvAGV4aXN0AGZub2YAZm9yYWxsAGZyYWMxMgBmcmFjMTQAZnJhYzM0AGZyYXNsAGdhbW1hAGdlAGd0AGhBcnIAaGFycgBoZWFydHMAaGVsbGlwAGlhY3V0ZQBpY2lyYwBpZXhjbABpZ3JhdmUAaW1hZ2UAaW5maW4AaW50AGlvdGEAaXF1ZXN0AGlzaW4AaXVtbABrYXBwYQBsQXJyAGxhbWJkYQBsYW5nAGxhcXVvAGxhcnIAbGNlaWwAbGRxdW8AbGUAbGZsb29yAGxvd2FzdABsb3oAbHJtAGxzYXF1bwBsc3F1bwBsdABtYWNyAG1kYXNoAG1pY3JvAG1pZGRvdABtdQBuYWJsYQBuYnNwAG5kYXNoAG5lAG5pAG5vdABub3RpbgBuc3ViAG50aWxkZQBudQBvYWN1dGUAb2NpcmMAb2VsaWcAb2dyYXZlAG9saW5lAG9tZWdhAG9taWNyb24Ab3BsdXMAb3IAb3JkZgBvcmRtAG9zbGFzaABvdGlsZGUAb3RpbWVzAG91bWwAcGFyYQBwYXJ0AHBlcm1pbABwZXJwAHBoaQBwaQBwaXYAcGx1c21uAHBvdW5kAHByaW1lAHByb2QAcHJvcABwc2kAcXVvdAByQXJyAHJhZGljAHJhbmcAcmFxdW8AcmFycgByY2VpbAByZHF1bwByZWFsAHJlZwByZmxvb3IAcmhvAHJsbQByc2FxdW8AcnNxdW8Ac2JxdW8Ac2Nhcm9uAHNkb3QAc2VjdABzaHkAc2lnbWEAc2lnbWFmAHNpbQBzcGFkZXMAc3ViAHN1YmUAc3VtAHN1cABzdXAxAHN1cDIAc3VwMwBzdXBlAHN6bGlnAHRhdQB0aGVyZTQAdGhldGEAdGhldGFzeW0AdGhpbnNwAHRob3JuAHRpbGRlAHRpbWVzAHRyYWRlAHVBcnIAdWFjdXRlAHVhcnIAdWNpcmMAdWdyYXZlAHVtbAB1cHNpaAB1cHNpbG9uAHV1bWwAd2VpZXJwAHhpAHlhY3V0ZQB5ZW4AeXVtbAB6ZXRhAHp3agB6d25qAFVURjggY29kZXMgPiA0IGJ5dGVzIGFyZSBub3QgY3VycmVudGx5IHN1cHBvcnRlZCAoZ3JhcGggJXMpIC0gdHJlYXRlZCBhcyBMYXRpbi0xLiBQZXJoYXBzICItR2NoYXJzZXQ9bGF0aW4xIiBpcyBuZWVkZWQ/CgBJbnZhbGlkICVkLWJ5dGUgVVRGOCBmb3VuZCBpbiBpbnB1dCBvZiBncmFwaCAlcyAtIHRyZWF0ZWQgYXMgTGF0aW4tMS4gUGVyaGFwcyAiLUdjaGFyc2V0PWxhdGluMSIgaXMgbmVlZGVkPwoAYnouc2l6ZQBvdmVybGFwX2JlemllcgB1cnZlZABvbXBvdW5kAGFsc2UAaW5lAG9uZQBvAHJ0aG8Ab2x5bGluZQBwbGluZQBydWUAZXMAVW5rbm93biAic3BsaW5lcyIgdmFsdWU6ICIlcyIgLSBpZ25vcmVkCgBzcGxpbmVzAG9kYgBPcnRob2dvbmFsIGVkZ2VzIGRvIG5vdCBjdXJyZW50bHkgaGFuZGxlIGVkZ2UgbGFiZWxzLiBUcnkgdXNpbmcgeGxhYmVscy4KAG9ydGhvICVzICVzCgBjaGFuaQBvcnRoby5jAGNoYW5TZWFyY2gAY3AAJSUhUFMtQWRvYmUtMi4wCiUlJSVCb3VuZGluZ0JveDogKGF0ZW5kKQovcG9pbnQgewogIC9ZIGV4Y2ggZGVmCiAgL1ggZXhjaCBkZWYKICBuZXdwYXRoCiAgWCBZIDMgMCAzNjAgYXJjIGZpbGwKfSBkZWYKL2NlbGwgewogIC9ZIGV4Y2ggZGVmCiAgL1ggZXhjaCBkZWYKICAveSBleGNoIGRlZgogIC94IGV4Y2ggZGVmCiAgbmV3cGF0aAogIHggeSBtb3ZldG8KICB4IFkgbGluZXRvCiAgWCBZIGxpbmV0bwogIFggeSBsaW5ldG8KICBjbG9zZXBhdGggc3Ryb2tlCn0gZGVmCi9ub2RlIHsKIC91IGV4Y2ggZGVmCiAvciBleGNoIGRlZgogL2QgZXhjaCBkZWYKIC9sIGV4Y2ggZGVmCiBuZXdwYXRoIGwgZCBtb3ZldG8KIHIgZCBsaW5ldG8gciB1IGxpbmV0byBsIHUgbGluZXRvCiBjbG9zZXBhdGggZmlsbAp9IGRlZgoKACVkICVkIHRyYW5zbGF0ZQoAMC44IDAuOCAwLjggc2V0cmdiY29sb3IKAHNob3dwYWdlCiUlJSVUcmFpbGVyCiUlJSVCb3VuZGluZ0JveDogJWQgJWQgJWQgJWQKAG5ld3BhdGggJWQgJWQgbW92ZXRvCgAlZCAlZCBsaW5ldG8KACVkICVkIGxpbmV0byBzdHJva2UKAGNoYW5uZWwgJWQgKCVmLCVmKQoAIC0+CgAgICAgIAAoKCVmLCVmKSwoJWYsJWYpKSAlcyAlcwBCX1JJR0hUAEJfRE9XTgBCX0xFRlQAQl9VUABCX05PREUAc2VnAG5leHRfc2VnAGRlY2lkZV9wb2ludABpbmNvbXBhcmFibGUgc2VnbWVudHMgISEgLS0gQWJvcnRpbmcKAHMxLT5jb21tX2Nvb3JkPT1zMi0+Y29tbV9jb29yZABpc19wYXJhbGxlbABncmFwaCBHIHsKACBub2RlW3NoYXBlPXBvaW50XQoAICAlZCBbcG9zPSIlZCwlZCJdCgAgICVkIC0tICVkW2xlbj0iJWYiXQoAfQoAY29sb3IgJXMAJXMgaXMgbm90IGEga25vd24gY29sb3IuCgBlcnJvciBpbiBjb2x4bGF0ZSgpCgBzb2xpZABpbnZpc2libGUAYm9sZABzZXRsaW5ld2lkdGgAZmlsbGVkAHVuZmlsbGVkAHRhcGVyZWQAZ3ZyZW5kZXJfc2V0X3N0eWxlOiB1bnN1cHBvcnRlZCBzdHlsZSAlcyAtIGlnbm9yaW5nCgBndnJlbmRlci5jAGd2cmVuZGVyX3VzZXJzaGFwZQBuYW1lAG5hbWVbMF0AYm90aABsYXlvdXQATGF5b3V0IHR5cGU6ICIlcyIgbm90IHJlY29nbml6ZWQuIFVzZSBvbmUgb2Y6JXMKAGpvYgBndmxvYWRpbWFnZS5jAGd2bG9hZGltYWdlAHVzAHVzLT5uYW1lAHVzLT5uYW1lWzBdAE5vIGxvYWRpbWFnZSBwbHVnaW4gZm9yICIlcyIKAFEATGVmdABLUF9MZWZ0AFJpZ2h0AEtQX1JpZ2h0AFVwAEtQX1VwAERvd24AS1BfRG93bgBwbHVzAEtQX0FkZABtaW51cwBLUF9TdWJ0cmFjdABGAGVkZ2UAdGFpbHBvcnQAaGVhZHBvcnQAa2V5AFVSTABub2RlAGRpZ3JhcGgAZ3JhcGgAc3ViZ3JhcGgAX0xUWF9saWJyYXJ5AHRleHRsYXlvdXQAb2JqcC0+bGJsAHhsYWJlbHMuYwB4bGFkanVzdAB4bGludGVyc2VjdGlvbnMAbHAgIT0gY2xwAGdldGludHJzeGkAb2JqcDEtPnN6LnggPT0gMCAmJiBvYmpwMS0+c3oueSA9PSAwAGxibGVuY2xvc2luZwB2cAB4bGhkeHVubG9hZABzaXplPT1mcmVlZAByZWN0LmJvdW5kYXJ5WzJdIDwgSU5UX01BWABvYmpwbHBta3MAcmVjdC5ib3VuZGFyeVszXSA8IElOVF9NQVgAb3V0IG9mIG1lbW9yeQoAIyUyeCUyeCUyeCUyeAAlbGYlbGYlbGYAL2FjY2VudDMvMQAvYWNjZW50My8yAC9hY2NlbnQzLzMAL2FjY2VudDQvMQAvYWNjZW50NC8yAC9hY2NlbnQ0LzMAL2FjY2VudDQvNAAvYWNjZW50NS8xAC9hY2NlbnQ1LzIAL2FjY2VudDUvMwAvYWNjZW50NS80AC9hY2NlbnQ1LzUAL2FjY2VudDYvMQAvYWNjZW50Ni8yAC9hY2NlbnQ2LzMAL2FjY2VudDYvNAAvYWNjZW50Ni81AC9hY2NlbnQ2LzYAL2FjY2VudDcvMQAvYWNjZW50Ny8yAC9hY2NlbnQ3LzMAL2FjY2VudDcvNAAvYWNjZW50Ny81AC9hY2NlbnQ3LzYAL2FjY2VudDcvNwAvYWNjZW50OC8xAC9hY2NlbnQ4LzIAL2FjY2VudDgvMwAvYWNjZW50OC80AC9hY2NlbnQ4LzUAL2FjY2VudDgvNgAvYWNjZW50OC83AC9hY2NlbnQ4LzgAL2JsdWVzMy8xAC9ibHVlczMvMgAvYmx1ZXMzLzMAL2JsdWVzNC8xAC9ibHVlczQvMgAvYmx1ZXM0LzMAL2JsdWVzNC80AC9ibHVlczUvMQAvYmx1ZXM1LzIAL2JsdWVzNS8zAC9ibHVlczUvNAAvYmx1ZXM1LzUAL2JsdWVzNi8xAC9ibHVlczYvMgAvYmx1ZXM2LzMAL2JsdWVzNi80AC9ibHVlczYvNQAvYmx1ZXM2LzYAL2JsdWVzNy8xAC9ibHVlczcvMgAvYmx1ZXM3LzMAL2JsdWVzNy80AC9ibHVlczcvNQAvYmx1ZXM3LzYAL2JsdWVzNy83AC9ibHVlczgvMQAvYmx1ZXM4LzIAL2JsdWVzOC8zAC9ibHVlczgvNAAvYmx1ZXM4LzUAL2JsdWVzOC82AC9ibHVlczgvNwAvYmx1ZXM4LzgAL2JsdWVzOS8xAC9ibHVlczkvMgAvYmx1ZXM5LzMAL2JsdWVzOS80AC9ibHVlczkvNQAvYmx1ZXM5LzYAL2JsdWVzOS83AC9ibHVlczkvOAAvYmx1ZXM5LzkAL2JyYmcxMC8xAC9icmJnMTAvMTAAL2JyYmcxMC8yAC9icmJnMTAvMwAvYnJiZzEwLzQAL2JyYmcxMC81AC9icmJnMTAvNgAvYnJiZzEwLzcAL2JyYmcxMC84AC9icmJnMTAvOQAvYnJiZzExLzEAL2JyYmcxMS8xMAAvYnJiZzExLzExAC9icmJnMTEvMgAvYnJiZzExLzMAL2JyYmcxMS80AC9icmJnMTEvNQAvYnJiZzExLzYAL2JyYmcxMS83AC9icmJnMTEvOAAvYnJiZzExLzkAL2JyYmczLzEAL2JyYmczLzIAL2JyYmczLzMAL2JyYmc0LzEAL2JyYmc0LzIAL2JyYmc0LzMAL2JyYmc0LzQAL2JyYmc1LzEAL2JyYmc1LzIAL2JyYmc1LzMAL2JyYmc1LzQAL2JyYmc1LzUAL2JyYmc2LzEAL2JyYmc2LzIAL2JyYmc2LzMAL2JyYmc2LzQAL2JyYmc2LzUAL2JyYmc2LzYAL2JyYmc3LzEAL2JyYmc3LzIAL2JyYmc3LzMAL2JyYmc3LzQAL2JyYmc3LzUAL2JyYmc3LzYAL2JyYmc3LzcAL2JyYmc4LzEAL2JyYmc4LzIAL2JyYmc4LzMAL2JyYmc4LzQAL2JyYmc4LzUAL2JyYmc4LzYAL2JyYmc4LzcAL2JyYmc4LzgAL2JyYmc5LzEAL2JyYmc5LzIAL2JyYmc5LzMAL2JyYmc5LzQAL2JyYmc5LzUAL2JyYmc5LzYAL2JyYmc5LzcAL2JyYmc5LzgAL2JyYmc5LzkAL2J1Z24zLzEAL2J1Z24zLzIAL2J1Z24zLzMAL2J1Z240LzEAL2J1Z240LzIAL2J1Z240LzMAL2J1Z240LzQAL2J1Z241LzEAL2J1Z241LzIAL2J1Z241LzMAL2J1Z241LzQAL2J1Z241LzUAL2J1Z242LzEAL2J1Z242LzIAL2J1Z242LzMAL2J1Z242LzQAL2J1Z242LzUAL2J1Z242LzYAL2J1Z243LzEAL2J1Z243LzIAL2J1Z243LzMAL2J1Z243LzQAL2J1Z243LzUAL2J1Z243LzYAL2J1Z243LzcAL2J1Z244LzEAL2J1Z244LzIAL2J1Z244LzMAL2J1Z244LzQAL2J1Z244LzUAL2J1Z244LzYAL2J1Z244LzcAL2J1Z244LzgAL2J1Z245LzEAL2J1Z245LzIAL2J1Z245LzMAL2J1Z245LzQAL2J1Z245LzUAL2J1Z245LzYAL2J1Z245LzcAL2J1Z245LzgAL2J1Z245LzkAL2J1cHUzLzEAL2J1cHUzLzIAL2J1cHUzLzMAL2J1cHU0LzEAL2J1cHU0LzIAL2J1cHU0LzMAL2J1cHU0LzQAL2J1cHU1LzEAL2J1cHU1LzIAL2J1cHU1LzMAL2J1cHU1LzQAL2J1cHU1LzUAL2J1cHU2LzEAL2J1cHU2LzIAL2J1cHU2LzMAL2J1cHU2LzQAL2J1cHU2LzUAL2J1cHU2LzYAL2J1cHU3LzEAL2J1cHU3LzIAL2J1cHU3LzMAL2J1cHU3LzQAL2J1cHU3LzUAL2J1cHU3LzYAL2J1cHU3LzcAL2J1cHU4LzEAL2J1cHU4LzIAL2J1cHU4LzMAL2J1cHU4LzQAL2J1cHU4LzUAL2J1cHU4LzYAL2J1cHU4LzcAL2J1cHU4LzgAL2J1cHU5LzEAL2J1cHU5LzIAL2J1cHU5LzMAL2J1cHU5LzQAL2J1cHU5LzUAL2J1cHU5LzYAL2J1cHU5LzcAL2J1cHU5LzgAL2J1cHU5LzkAL2RhcmsyMy8xAC9kYXJrMjMvMgAvZGFyazIzLzMAL2RhcmsyNC8xAC9kYXJrMjQvMgAvZGFyazI0LzMAL2RhcmsyNC80AC9kYXJrMjUvMQAvZGFyazI1LzIAL2RhcmsyNS8zAC9kYXJrMjUvNAAvZGFyazI1LzUAL2RhcmsyNi8xAC9kYXJrMjYvMgAvZGFyazI2LzMAL2RhcmsyNi80AC9kYXJrMjYvNQAvZGFyazI2LzYAL2RhcmsyNy8xAC9kYXJrMjcvMgAvZGFyazI3LzMAL2RhcmsyNy80AC9kYXJrMjcvNQAvZGFyazI3LzYAL2RhcmsyNy83AC9kYXJrMjgvMQAvZGFyazI4LzIAL2RhcmsyOC8zAC9kYXJrMjgvNAAvZGFyazI4LzUAL2RhcmsyOC82AC9kYXJrMjgvNwAvZGFyazI4LzgAL2duYnUzLzEAL2duYnUzLzIAL2duYnUzLzMAL2duYnU0LzEAL2duYnU0LzIAL2duYnU0LzMAL2duYnU0LzQAL2duYnU1LzEAL2duYnU1LzIAL2duYnU1LzMAL2duYnU1LzQAL2duYnU1LzUAL2duYnU2LzEAL2duYnU2LzIAL2duYnU2LzMAL2duYnU2LzQAL2duYnU2LzUAL2duYnU2LzYAL2duYnU3LzEAL2duYnU3LzIAL2duYnU3LzMAL2duYnU3LzQAL2duYnU3LzUAL2duYnU3LzYAL2duYnU3LzcAL2duYnU4LzEAL2duYnU4LzIAL2duYnU4LzMAL2duYnU4LzQAL2duYnU4LzUAL2duYnU4LzYAL2duYnU4LzcAL2duYnU4LzgAL2duYnU5LzEAL2duYnU5LzIAL2duYnU5LzMAL2duYnU5LzQAL2duYnU5LzUAL2duYnU5LzYAL2duYnU5LzcAL2duYnU5LzgAL2duYnU5LzkAL2dyZWVuczMvMQAvZ3JlZW5zMy8yAC9ncmVlbnMzLzMAL2dyZWVuczQvMQAvZ3JlZW5zNC8yAC9ncmVlbnM0LzMAL2dyZWVuczQvNAAvZ3JlZW5zNS8xAC9ncmVlbnM1LzIAL2dyZWVuczUvMwAvZ3JlZW5zNS80AC9ncmVlbnM1LzUAL2dyZWVuczYvMQAvZ3JlZW5zNi8yAC9ncmVlbnM2LzMAL2dyZWVuczYvNAAvZ3JlZW5zNi81AC9ncmVlbnM2LzYAL2dyZWVuczcvMQAvZ3JlZW5zNy8yAC9ncmVlbnM3LzMAL2dyZWVuczcvNAAvZ3JlZW5zNy81AC9ncmVlbnM3LzYAL2dyZWVuczcvNwAvZ3JlZW5zOC8xAC9ncmVlbnM4LzIAL2dyZWVuczgvMwAvZ3JlZW5zOC80AC9ncmVlbnM4LzUAL2dyZWVuczgvNgAvZ3JlZW5zOC83AC9ncmVlbnM4LzgAL2dyZWVuczkvMQAvZ3JlZW5zOS8yAC9ncmVlbnM5LzMAL2dyZWVuczkvNAAvZ3JlZW5zOS81AC9ncmVlbnM5LzYAL2dyZWVuczkvNwAvZ3JlZW5zOS84AC9ncmVlbnM5LzkAL2dyZXlzMy8xAC9ncmV5czMvMgAvZ3JleXMzLzMAL2dyZXlzNC8xAC9ncmV5czQvMgAvZ3JleXM0LzMAL2dyZXlzNC80AC9ncmV5czUvMQAvZ3JleXM1LzIAL2dyZXlzNS8zAC9ncmV5czUvNAAvZ3JleXM1LzUAL2dyZXlzNi8xAC9ncmV5czYvMgAvZ3JleXM2LzMAL2dyZXlzNi80AC9ncmV5czYvNQAvZ3JleXM2LzYAL2dyZXlzNy8xAC9ncmV5czcvMgAvZ3JleXM3LzMAL2dyZXlzNy80AC9ncmV5czcvNQAvZ3JleXM3LzYAL2dyZXlzNy83AC9ncmV5czgvMQAvZ3JleXM4LzIAL2dyZXlzOC8zAC9ncmV5czgvNAAvZ3JleXM4LzUAL2dyZXlzOC82AC9ncmV5czgvNwAvZ3JleXM4LzgAL2dyZXlzOS8xAC9ncmV5czkvMgAvZ3JleXM5LzMAL2dyZXlzOS80AC9ncmV5czkvNQAvZ3JleXM5LzYAL2dyZXlzOS83AC9ncmV5czkvOAAvZ3JleXM5LzkAL29yYW5nZXMzLzEAL29yYW5nZXMzLzIAL29yYW5nZXMzLzMAL29yYW5nZXM0LzEAL29yYW5nZXM0LzIAL29yYW5nZXM0LzMAL29yYW5nZXM0LzQAL29yYW5nZXM1LzEAL29yYW5nZXM1LzIAL29yYW5nZXM1LzMAL29yYW5nZXM1LzQAL29yYW5nZXM1LzUAL29yYW5nZXM2LzEAL29yYW5nZXM2LzIAL29yYW5nZXM2LzMAL29yYW5nZXM2LzQAL29yYW5nZXM2LzUAL29yYW5nZXM2LzYAL29yYW5nZXM3LzEAL29yYW5nZXM3LzIAL29yYW5nZXM3LzMAL29yYW5nZXM3LzQAL29yYW5nZXM3LzUAL29yYW5nZXM3LzYAL29yYW5nZXM3LzcAL29yYW5nZXM4LzEAL29yYW5nZXM4LzIAL29yYW5nZXM4LzMAL29yYW5nZXM4LzQAL29yYW5nZXM4LzUAL29yYW5nZXM4LzYAL29yYW5nZXM4LzcAL29yYW5nZXM4LzgAL29yYW5nZXM5LzEAL29yYW5nZXM5LzIAL29yYW5nZXM5LzMAL29yYW5nZXM5LzQAL29yYW5nZXM5LzUAL29yYW5nZXM5LzYAL29yYW5nZXM5LzcAL29yYW5nZXM5LzgAL29yYW5nZXM5LzkAL29ycmQzLzEAL29ycmQzLzIAL29ycmQzLzMAL29ycmQ0LzEAL29ycmQ0LzIAL29ycmQ0LzMAL29ycmQ0LzQAL29ycmQ1LzEAL29ycmQ1LzIAL29ycmQ1LzMAL29ycmQ1LzQAL29ycmQ1LzUAL29ycmQ2LzEAL29ycmQ2LzIAL29ycmQ2LzMAL29ycmQ2LzQAL29ycmQ2LzUAL29ycmQ2LzYAL29ycmQ3LzEAL29ycmQ3LzIAL29ycmQ3LzMAL29ycmQ3LzQAL29ycmQ3LzUAL29ycmQ3LzYAL29ycmQ3LzcAL29ycmQ4LzEAL29ycmQ4LzIAL29ycmQ4LzMAL29ycmQ4LzQAL29ycmQ4LzUAL29ycmQ4LzYAL29ycmQ4LzcAL29ycmQ4LzgAL29ycmQ5LzEAL29ycmQ5LzIAL29ycmQ5LzMAL29ycmQ5LzQAL29ycmQ5LzUAL29ycmQ5LzYAL29ycmQ5LzcAL29ycmQ5LzgAL29ycmQ5LzkAL3BhaXJlZDEwLzEAL3BhaXJlZDEwLzEwAC9wYWlyZWQxMC8yAC9wYWlyZWQxMC8zAC9wYWlyZWQxMC80AC9wYWlyZWQxMC81AC9wYWlyZWQxMC82AC9wYWlyZWQxMC83AC9wYWlyZWQxMC84AC9wYWlyZWQxMC85AC9wYWlyZWQxMS8xAC9wYWlyZWQxMS8xMAAvcGFpcmVkMTEvMTEAL3BhaXJlZDExLzIAL3BhaXJlZDExLzMAL3BhaXJlZDExLzQAL3BhaXJlZDExLzUAL3BhaXJlZDExLzYAL3BhaXJlZDExLzcAL3BhaXJlZDExLzgAL3BhaXJlZDExLzkAL3BhaXJlZDEyLzEAL3BhaXJlZDEyLzEwAC9wYWlyZWQxMi8xMQAvcGFpcmVkMTIvMTIAL3BhaXJlZDEyLzIAL3BhaXJlZDEyLzMAL3BhaXJlZDEyLzQAL3BhaXJlZDEyLzUAL3BhaXJlZDEyLzYAL3BhaXJlZDEyLzcAL3BhaXJlZDEyLzgAL3BhaXJlZDEyLzkAL3BhaXJlZDMvMQAvcGFpcmVkMy8yAC9wYWlyZWQzLzMAL3BhaXJlZDQvMQAvcGFpcmVkNC8yAC9wYWlyZWQ0LzMAL3BhaXJlZDQvNAAvcGFpcmVkNS8xAC9wYWlyZWQ1LzIAL3BhaXJlZDUvMwAvcGFpcmVkNS80AC9wYWlyZWQ1LzUAL3BhaXJlZDYvMQAvcGFpcmVkNi8yAC9wYWlyZWQ2LzMAL3BhaXJlZDYvNAAvcGFpcmVkNi81AC9wYWlyZWQ2LzYAL3BhaXJlZDcvMQAvcGFpcmVkNy8yAC9wYWlyZWQ3LzMAL3BhaXJlZDcvNAAvcGFpcmVkNy81AC9wYWlyZWQ3LzYAL3BhaXJlZDcvNwAvcGFpcmVkOC8xAC9wYWlyZWQ4LzIAL3BhaXJlZDgvMwAvcGFpcmVkOC80AC9wYWlyZWQ4LzUAL3BhaXJlZDgvNgAvcGFpcmVkOC83AC9wYWlyZWQ4LzgAL3BhaXJlZDkvMQAvcGFpcmVkOS8yAC9wYWlyZWQ5LzMAL3BhaXJlZDkvNAAvcGFpcmVkOS81AC9wYWlyZWQ5LzYAL3BhaXJlZDkvNwAvcGFpcmVkOS84AC9wYWlyZWQ5LzkAL3Bhc3RlbDEzLzEAL3Bhc3RlbDEzLzIAL3Bhc3RlbDEzLzMAL3Bhc3RlbDE0LzEAL3Bhc3RlbDE0LzIAL3Bhc3RlbDE0LzMAL3Bhc3RlbDE0LzQAL3Bhc3RlbDE1LzEAL3Bhc3RlbDE1LzIAL3Bhc3RlbDE1LzMAL3Bhc3RlbDE1LzQAL3Bhc3RlbDE1LzUAL3Bhc3RlbDE2LzEAL3Bhc3RlbDE2LzIAL3Bhc3RlbDE2LzMAL3Bhc3RlbDE2LzQAL3Bhc3RlbDE2LzUAL3Bhc3RlbDE2LzYAL3Bhc3RlbDE3LzEAL3Bhc3RlbDE3LzIAL3Bhc3RlbDE3LzMAL3Bhc3RlbDE3LzQAL3Bhc3RlbDE3LzUAL3Bhc3RlbDE3LzYAL3Bhc3RlbDE3LzcAL3Bhc3RlbDE4LzEAL3Bhc3RlbDE4LzIAL3Bhc3RlbDE4LzMAL3Bhc3RlbDE4LzQAL3Bhc3RlbDE4LzUAL3Bhc3RlbDE4LzYAL3Bhc3RlbDE4LzcAL3Bhc3RlbDE4LzgAL3Bhc3RlbDE5LzEAL3Bhc3RlbDE5LzIAL3Bhc3RlbDE5LzMAL3Bhc3RlbDE5LzQAL3Bhc3RlbDE5LzUAL3Bhc3RlbDE5LzYAL3Bhc3RlbDE5LzcAL3Bhc3RlbDE5LzgAL3Bhc3RlbDE5LzkAL3Bhc3RlbDIzLzEAL3Bhc3RlbDIzLzIAL3Bhc3RlbDIzLzMAL3Bhc3RlbDI0LzEAL3Bhc3RlbDI0LzIAL3Bhc3RlbDI0LzMAL3Bhc3RlbDI0LzQAL3Bhc3RlbDI1LzEAL3Bhc3RlbDI1LzIAL3Bhc3RlbDI1LzMAL3Bhc3RlbDI1LzQAL3Bhc3RlbDI1LzUAL3Bhc3RlbDI2LzEAL3Bhc3RlbDI2LzIAL3Bhc3RlbDI2LzMAL3Bhc3RlbDI2LzQAL3Bhc3RlbDI2LzUAL3Bhc3RlbDI2LzYAL3Bhc3RlbDI3LzEAL3Bhc3RlbDI3LzIAL3Bhc3RlbDI3LzMAL3Bhc3RlbDI3LzQAL3Bhc3RlbDI3LzUAL3Bhc3RlbDI3LzYAL3Bhc3RlbDI3LzcAL3Bhc3RlbDI4LzEAL3Bhc3RlbDI4LzIAL3Bhc3RlbDI4LzMAL3Bhc3RlbDI4LzQAL3Bhc3RlbDI4LzUAL3Bhc3RlbDI4LzYAL3Bhc3RlbDI4LzcAL3Bhc3RlbDI4LzgAL3BpeWcxMC8xAC9waXlnMTAvMTAAL3BpeWcxMC8yAC9waXlnMTAvMwAvcGl5ZzEwLzQAL3BpeWcxMC81AC9waXlnMTAvNgAvcGl5ZzEwLzcAL3BpeWcxMC84AC9waXlnMTAvOQAvcGl5ZzExLzEAL3BpeWcxMS8xMAAvcGl5ZzExLzExAC9waXlnMTEvMgAvcGl5ZzExLzMAL3BpeWcxMS80AC9waXlnMTEvNQAvcGl5ZzExLzYAL3BpeWcxMS83AC9waXlnMTEvOAAvcGl5ZzExLzkAL3BpeWczLzEAL3BpeWczLzIAL3BpeWczLzMAL3BpeWc0LzEAL3BpeWc0LzIAL3BpeWc0LzMAL3BpeWc0LzQAL3BpeWc1LzEAL3BpeWc1LzIAL3BpeWc1LzMAL3BpeWc1LzQAL3BpeWc1LzUAL3BpeWc2LzEAL3BpeWc2LzIAL3BpeWc2LzMAL3BpeWc2LzQAL3BpeWc2LzUAL3BpeWc2LzYAL3BpeWc3LzEAL3BpeWc3LzIAL3BpeWc3LzMAL3BpeWc3LzQAL3BpeWc3LzUAL3BpeWc3LzYAL3BpeWc3LzcAL3BpeWc4LzEAL3BpeWc4LzIAL3BpeWc4LzMAL3BpeWc4LzQAL3BpeWc4LzUAL3BpeWc4LzYAL3BpeWc4LzcAL3BpeWc4LzgAL3BpeWc5LzEAL3BpeWc5LzIAL3BpeWc5LzMAL3BpeWc5LzQAL3BpeWc5LzUAL3BpeWc5LzYAL3BpeWc5LzcAL3BpeWc5LzgAL3BpeWc5LzkAL3ByZ24xMC8xAC9wcmduMTAvMTAAL3ByZ24xMC8yAC9wcmduMTAvMwAvcHJnbjEwLzQAL3ByZ24xMC81AC9wcmduMTAvNgAvcHJnbjEwLzcAL3ByZ24xMC84AC9wcmduMTAvOQAvcHJnbjExLzEAL3ByZ24xMS8xMAAvcHJnbjExLzExAC9wcmduMTEvMgAvcHJnbjExLzMAL3ByZ24xMS80AC9wcmduMTEvNQAvcHJnbjExLzYAL3ByZ24xMS83AC9wcmduMTEvOAAvcHJnbjExLzkAL3ByZ24zLzEAL3ByZ24zLzIAL3ByZ24zLzMAL3ByZ240LzEAL3ByZ240LzIAL3ByZ240LzMAL3ByZ240LzQAL3ByZ241LzEAL3ByZ241LzIAL3ByZ241LzMAL3ByZ241LzQAL3ByZ241LzUAL3ByZ242LzEAL3ByZ242LzIAL3ByZ242LzMAL3ByZ242LzQAL3ByZ242LzUAL3ByZ242LzYAL3ByZ243LzEAL3ByZ243LzIAL3ByZ243LzMAL3ByZ243LzQAL3ByZ243LzUAL3ByZ243LzYAL3ByZ243LzcAL3ByZ244LzEAL3ByZ244LzIAL3ByZ244LzMAL3ByZ244LzQAL3ByZ244LzUAL3ByZ244LzYAL3ByZ244LzcAL3ByZ244LzgAL3ByZ245LzEAL3ByZ245LzIAL3ByZ245LzMAL3ByZ245LzQAL3ByZ245LzUAL3ByZ245LzYAL3ByZ245LzcAL3ByZ245LzgAL3ByZ245LzkAL3B1YnUzLzEAL3B1YnUzLzIAL3B1YnUzLzMAL3B1YnU0LzEAL3B1YnU0LzIAL3B1YnU0LzMAL3B1YnU0LzQAL3B1YnU1LzEAL3B1YnU1LzIAL3B1YnU1LzMAL3B1YnU1LzQAL3B1YnU1LzUAL3B1YnU2LzEAL3B1YnU2LzIAL3B1YnU2LzMAL3B1YnU2LzQAL3B1YnU2LzUAL3B1YnU2LzYAL3B1YnU3LzEAL3B1YnU3LzIAL3B1YnU3LzMAL3B1YnU3LzQAL3B1YnU3LzUAL3B1YnU3LzYAL3B1YnU3LzcAL3B1YnU4LzEAL3B1YnU4LzIAL3B1YnU4LzMAL3B1YnU4LzQAL3B1YnU4LzUAL3B1YnU4LzYAL3B1YnU4LzcAL3B1YnU4LzgAL3B1YnU5LzEAL3B1YnU5LzIAL3B1YnU5LzMAL3B1YnU5LzQAL3B1YnU5LzUAL3B1YnU5LzYAL3B1YnU5LzcAL3B1YnU5LzgAL3B1YnU5LzkAL3B1YnVnbjMvMQAvcHVidWduMy8yAC9wdWJ1Z24zLzMAL3B1YnVnbjQvMQAvcHVidWduNC8yAC9wdWJ1Z240LzMAL3B1YnVnbjQvNAAvcHVidWduNS8xAC9wdWJ1Z241LzIAL3B1YnVnbjUvMwAvcHVidWduNS80AC9wdWJ1Z241LzUAL3B1YnVnbjYvMQAvcHVidWduNi8yAC9wdWJ1Z242LzMAL3B1YnVnbjYvNAAvcHVidWduNi81AC9wdWJ1Z242LzYAL3B1YnVnbjcvMQAvcHVidWduNy8yAC9wdWJ1Z243LzMAL3B1YnVnbjcvNAAvcHVidWduNy81AC9wdWJ1Z243LzYAL3B1YnVnbjcvNwAvcHVidWduOC8xAC9wdWJ1Z244LzIAL3B1YnVnbjgvMwAvcHVidWduOC80AC9wdWJ1Z244LzUAL3B1YnVnbjgvNgAvcHVidWduOC83AC9wdWJ1Z244LzgAL3B1YnVnbjkvMQAvcHVidWduOS8yAC9wdWJ1Z245LzMAL3B1YnVnbjkvNAAvcHVidWduOS81AC9wdWJ1Z245LzYAL3B1YnVnbjkvNwAvcHVidWduOS84AC9wdWJ1Z245LzkAL3B1b3IxMC8xAC9wdW9yMTAvMTAAL3B1b3IxMC8yAC9wdW9yMTAvMwAvcHVvcjEwLzQAL3B1b3IxMC81AC9wdW9yMTAvNgAvcHVvcjEwLzcAL3B1b3IxMC84AC9wdW9yMTAvOQAvcHVvcjExLzEAL3B1b3IxMS8xMAAvcHVvcjExLzExAC9wdW9yMTEvMgAvcHVvcjExLzMAL3B1b3IxMS80AC9wdW9yMTEvNQAvcHVvcjExLzYAL3B1b3IxMS83AC9wdW9yMTEvOAAvcHVvcjExLzkAL3B1b3IzLzEAL3B1b3IzLzIAL3B1b3IzLzMAL3B1b3I0LzEAL3B1b3I0LzIAL3B1b3I0LzMAL3B1b3I0LzQAL3B1b3I1LzEAL3B1b3I1LzIAL3B1b3I1LzMAL3B1b3I1LzQAL3B1b3I1LzUAL3B1b3I2LzEAL3B1b3I2LzIAL3B1b3I2LzMAL3B1b3I2LzQAL3B1b3I2LzUAL3B1b3I2LzYAL3B1b3I3LzEAL3B1b3I3LzIAL3B1b3I3LzMAL3B1b3I3LzQAL3B1b3I3LzUAL3B1b3I3LzYAL3B1b3I3LzcAL3B1b3I4LzEAL3B1b3I4LzIAL3B1b3I4LzMAL3B1b3I4LzQAL3B1b3I4LzUAL3B1b3I4LzYAL3B1b3I4LzcAL3B1b3I4LzgAL3B1b3I5LzEAL3B1b3I5LzIAL3B1b3I5LzMAL3B1b3I5LzQAL3B1b3I5LzUAL3B1b3I5LzYAL3B1b3I5LzcAL3B1b3I5LzgAL3B1b3I5LzkAL3B1cmQzLzEAL3B1cmQzLzIAL3B1cmQzLzMAL3B1cmQ0LzEAL3B1cmQ0LzIAL3B1cmQ0LzMAL3B1cmQ0LzQAL3B1cmQ1LzEAL3B1cmQ1LzIAL3B1cmQ1LzMAL3B1cmQ1LzQAL3B1cmQ1LzUAL3B1cmQ2LzEAL3B1cmQ2LzIAL3B1cmQ2LzMAL3B1cmQ2LzQAL3B1cmQ2LzUAL3B1cmQ2LzYAL3B1cmQ3LzEAL3B1cmQ3LzIAL3B1cmQ3LzMAL3B1cmQ3LzQAL3B1cmQ3LzUAL3B1cmQ3LzYAL3B1cmQ3LzcAL3B1cmQ4LzEAL3B1cmQ4LzIAL3B1cmQ4LzMAL3B1cmQ4LzQAL3B1cmQ4LzUAL3B1cmQ4LzYAL3B1cmQ4LzcAL3B1cmQ4LzgAL3B1cmQ5LzEAL3B1cmQ5LzIAL3B1cmQ5LzMAL3B1cmQ5LzQAL3B1cmQ5LzUAL3B1cmQ5LzYAL3B1cmQ5LzcAL3B1cmQ5LzgAL3B1cmQ5LzkAL3B1cnBsZXMzLzEAL3B1cnBsZXMzLzIAL3B1cnBsZXMzLzMAL3B1cnBsZXM0LzEAL3B1cnBsZXM0LzIAL3B1cnBsZXM0LzMAL3B1cnBsZXM0LzQAL3B1cnBsZXM1LzEAL3B1cnBsZXM1LzIAL3B1cnBsZXM1LzMAL3B1cnBsZXM1LzQAL3B1cnBsZXM1LzUAL3B1cnBsZXM2LzEAL3B1cnBsZXM2LzIAL3B1cnBsZXM2LzMAL3B1cnBsZXM2LzQAL3B1cnBsZXM2LzUAL3B1cnBsZXM2LzYAL3B1cnBsZXM3LzEAL3B1cnBsZXM3LzIAL3B1cnBsZXM3LzMAL3B1cnBsZXM3LzQAL3B1cnBsZXM3LzUAL3B1cnBsZXM3LzYAL3B1cnBsZXM3LzcAL3B1cnBsZXM4LzEAL3B1cnBsZXM4LzIAL3B1cnBsZXM4LzMAL3B1cnBsZXM4LzQAL3B1cnBsZXM4LzUAL3B1cnBsZXM4LzYAL3B1cnBsZXM4LzcAL3B1cnBsZXM4LzgAL3B1cnBsZXM5LzEAL3B1cnBsZXM5LzIAL3B1cnBsZXM5LzMAL3B1cnBsZXM5LzQAL3B1cnBsZXM5LzUAL3B1cnBsZXM5LzYAL3B1cnBsZXM5LzcAL3B1cnBsZXM5LzgAL3B1cnBsZXM5LzkAL3JkYnUxMC8xAC9yZGJ1MTAvMTAAL3JkYnUxMC8yAC9yZGJ1MTAvMwAvcmRidTEwLzQAL3JkYnUxMC81AC9yZGJ1MTAvNgAvcmRidTEwLzcAL3JkYnUxMC84AC9yZGJ1MTAvOQAvcmRidTExLzEAL3JkYnUxMS8xMAAvcmRidTExLzExAC9yZGJ1MTEvMgAvcmRidTExLzMAL3JkYnUxMS80AC9yZGJ1MTEvNQAvcmRidTExLzYAL3JkYnUxMS83AC9yZGJ1MTEvOAAvcmRidTExLzkAL3JkYnUzLzEAL3JkYnUzLzIAL3JkYnUzLzMAL3JkYnU0LzEAL3JkYnU0LzIAL3JkYnU0LzMAL3JkYnU0LzQAL3JkYnU1LzEAL3JkYnU1LzIAL3JkYnU1LzMAL3JkYnU1LzQAL3JkYnU1LzUAL3JkYnU2LzEAL3JkYnU2LzIAL3JkYnU2LzMAL3JkYnU2LzQAL3JkYnU2LzUAL3JkYnU2LzYAL3JkYnU3LzEAL3JkYnU3LzIAL3JkYnU3LzMAL3JkYnU3LzQAL3JkYnU3LzUAL3JkYnU3LzYAL3JkYnU3LzcAL3JkYnU4LzEAL3JkYnU4LzIAL3JkYnU4LzMAL3JkYnU4LzQAL3JkYnU4LzUAL3JkYnU4LzYAL3JkYnU4LzcAL3JkYnU4LzgAL3JkYnU5LzEAL3JkYnU5LzIAL3JkYnU5LzMAL3JkYnU5LzQAL3JkYnU5LzUAL3JkYnU5LzYAL3JkYnU5LzcAL3JkYnU5LzgAL3JkYnU5LzkAL3JkZ3kxMC8xAC9yZGd5MTAvMTAAL3JkZ3kxMC8yAC9yZGd5MTAvMwAvcmRneTEwLzQAL3JkZ3kxMC81AC9yZGd5MTAvNgAvcmRneTEwLzcAL3JkZ3kxMC84AC9yZGd5MTAvOQAvcmRneTExLzEAL3JkZ3kxMS8xMAAvcmRneTExLzExAC9yZGd5MTEvMgAvcmRneTExLzMAL3JkZ3kxMS80AC9yZGd5MTEvNQAvcmRneTExLzYAL3JkZ3kxMS83AC9yZGd5MTEvOAAvcmRneTExLzkAL3JkZ3kzLzEAL3JkZ3kzLzIAL3JkZ3kzLzMAL3JkZ3k0LzEAL3JkZ3k0LzIAL3JkZ3k0LzMAL3JkZ3k0LzQAL3JkZ3k1LzEAL3JkZ3k1LzIAL3JkZ3k1LzMAL3JkZ3k1LzQAL3JkZ3k1LzUAL3JkZ3k2LzEAL3JkZ3k2LzIAL3JkZ3k2LzMAL3JkZ3k2LzQAL3JkZ3k2LzUAL3JkZ3k2LzYAL3JkZ3k3LzEAL3JkZ3k3LzIAL3JkZ3k3LzMAL3JkZ3k3LzQAL3JkZ3k3LzUAL3JkZ3k3LzYAL3JkZ3k3LzcAL3JkZ3k4LzEAL3JkZ3k4LzIAL3JkZ3k4LzMAL3JkZ3k4LzQAL3JkZ3k4LzUAL3JkZ3k4LzYAL3JkZ3k4LzcAL3JkZ3k4LzgAL3JkZ3k5LzEAL3JkZ3k5LzIAL3JkZ3k5LzMAL3JkZ3k5LzQAL3JkZ3k5LzUAL3JkZ3k5LzYAL3JkZ3k5LzcAL3JkZ3k5LzgAL3JkZ3k5LzkAL3JkcHUzLzEAL3JkcHUzLzIAL3JkcHUzLzMAL3JkcHU0LzEAL3JkcHU0LzIAL3JkcHU0LzMAL3JkcHU0LzQAL3JkcHU1LzEAL3JkcHU1LzIAL3JkcHU1LzMAL3JkcHU1LzQAL3JkcHU1LzUAL3JkcHU2LzEAL3JkcHU2LzIAL3JkcHU2LzMAL3JkcHU2LzQAL3JkcHU2LzUAL3JkcHU2LzYAL3JkcHU3LzEAL3JkcHU3LzIAL3JkcHU3LzMAL3JkcHU3LzQAL3JkcHU3LzUAL3JkcHU3LzYAL3JkcHU3LzcAL3JkcHU4LzEAL3JkcHU4LzIAL3JkcHU4LzMAL3JkcHU4LzQAL3JkcHU4LzUAL3JkcHU4LzYAL3JkcHU4LzcAL3JkcHU4LzgAL3JkcHU5LzEAL3JkcHU5LzIAL3JkcHU5LzMAL3JkcHU5LzQAL3JkcHU5LzUAL3JkcHU5LzYAL3JkcHU5LzcAL3JkcHU5LzgAL3JkcHU5LzkAL3JkeWxidTEwLzEAL3JkeWxidTEwLzEwAC9yZHlsYnUxMC8yAC9yZHlsYnUxMC8zAC9yZHlsYnUxMC80AC9yZHlsYnUxMC81AC9yZHlsYnUxMC82AC9yZHlsYnUxMC83AC9yZHlsYnUxMC84AC9yZHlsYnUxMC85AC9yZHlsYnUxMS8xAC9yZHlsYnUxMS8xMAAvcmR5bGJ1MTEvMTEAL3JkeWxidTExLzIAL3JkeWxidTExLzMAL3JkeWxidTExLzQAL3JkeWxidTExLzUAL3JkeWxidTExLzYAL3JkeWxidTExLzcAL3JkeWxidTExLzgAL3JkeWxidTExLzkAL3JkeWxidTMvMQAvcmR5bGJ1My8yAC9yZHlsYnUzLzMAL3JkeWxidTQvMQAvcmR5bGJ1NC8yAC9yZHlsYnU0LzMAL3JkeWxidTQvNAAvcmR5bGJ1NS8xAC9yZHlsYnU1LzIAL3JkeWxidTUvMwAvcmR5bGJ1NS80AC9yZHlsYnU1LzUAL3JkeWxidTYvMQAvcmR5bGJ1Ni8yAC9yZHlsYnU2LzMAL3JkeWxidTYvNAAvcmR5bGJ1Ni81AC9yZHlsYnU2LzYAL3JkeWxidTcvMQAvcmR5bGJ1Ny8yAC9yZHlsYnU3LzMAL3JkeWxidTcvNAAvcmR5bGJ1Ny81AC9yZHlsYnU3LzYAL3JkeWxidTcvNwAvcmR5bGJ1OC8xAC9yZHlsYnU4LzIAL3JkeWxidTgvMwAvcmR5bGJ1OC80AC9yZHlsYnU4LzUAL3JkeWxidTgvNgAvcmR5bGJ1OC83AC9yZHlsYnU4LzgAL3JkeWxidTkvMQAvcmR5bGJ1OS8yAC9yZHlsYnU5LzMAL3JkeWxidTkvNAAvcmR5bGJ1OS81AC9yZHlsYnU5LzYAL3JkeWxidTkvNwAvcmR5bGJ1OS84AC9yZHlsYnU5LzkAL3JkeWxnbjEwLzEAL3JkeWxnbjEwLzEwAC9yZHlsZ24xMC8yAC9yZHlsZ24xMC8zAC9yZHlsZ24xMC80AC9yZHlsZ24xMC81AC9yZHlsZ24xMC82AC9yZHlsZ24xMC83AC9yZHlsZ24xMC84AC9yZHlsZ24xMC85AC9yZHlsZ24xMS8xAC9yZHlsZ24xMS8xMAAvcmR5bGduMTEvMTEAL3JkeWxnbjExLzIAL3JkeWxnbjExLzMAL3JkeWxnbjExLzQAL3JkeWxnbjExLzUAL3JkeWxnbjExLzYAL3JkeWxnbjExLzcAL3JkeWxnbjExLzgAL3JkeWxnbjExLzkAL3JkeWxnbjMvMQAvcmR5bGduMy8yAC9yZHlsZ24zLzMAL3JkeWxnbjQvMQAvcmR5bGduNC8yAC9yZHlsZ240LzMAL3JkeWxnbjQvNAAvcmR5bGduNS8xAC9yZHlsZ241LzIAL3JkeWxnbjUvMwAvcmR5bGduNS80AC9yZHlsZ241LzUAL3JkeWxnbjYvMQAvcmR5bGduNi8yAC9yZHlsZ242LzMAL3JkeWxnbjYvNAAvcmR5bGduNi81AC9yZHlsZ242LzYAL3JkeWxnbjcvMQAvcmR5bGduNy8yAC9yZHlsZ243LzMAL3JkeWxnbjcvNAAvcmR5bGduNy81AC9yZHlsZ243LzYAL3JkeWxnbjcvNwAvcmR5bGduOC8xAC9yZHlsZ244LzIAL3JkeWxnbjgvMwAvcmR5bGduOC80AC9yZHlsZ244LzUAL3JkeWxnbjgvNgAvcmR5bGduOC83AC9yZHlsZ244LzgAL3JkeWxnbjkvMQAvcmR5bGduOS8yAC9yZHlsZ245LzMAL3JkeWxnbjkvNAAvcmR5bGduOS81AC9yZHlsZ245LzYAL3JkeWxnbjkvNwAvcmR5bGduOS84AC9yZHlsZ245LzkAL3JlZHMzLzEAL3JlZHMzLzIAL3JlZHMzLzMAL3JlZHM0LzEAL3JlZHM0LzIAL3JlZHM0LzMAL3JlZHM0LzQAL3JlZHM1LzEAL3JlZHM1LzIAL3JlZHM1LzMAL3JlZHM1LzQAL3JlZHM1LzUAL3JlZHM2LzEAL3JlZHM2LzIAL3JlZHM2LzMAL3JlZHM2LzQAL3JlZHM2LzUAL3JlZHM2LzYAL3JlZHM3LzEAL3JlZHM3LzIAL3JlZHM3LzMAL3JlZHM3LzQAL3JlZHM3LzUAL3JlZHM3LzYAL3JlZHM3LzcAL3JlZHM4LzEAL3JlZHM4LzIAL3JlZHM4LzMAL3JlZHM4LzQAL3JlZHM4LzUAL3JlZHM4LzYAL3JlZHM4LzcAL3JlZHM4LzgAL3JlZHM5LzEAL3JlZHM5LzIAL3JlZHM5LzMAL3JlZHM5LzQAL3JlZHM5LzUAL3JlZHM5LzYAL3JlZHM5LzcAL3JlZHM5LzgAL3JlZHM5LzkAL3NldDEzLzEAL3NldDEzLzIAL3NldDEzLzMAL3NldDE0LzEAL3NldDE0LzIAL3NldDE0LzMAL3NldDE0LzQAL3NldDE1LzEAL3NldDE1LzIAL3NldDE1LzMAL3NldDE1LzQAL3NldDE1LzUAL3NldDE2LzEAL3NldDE2LzIAL3NldDE2LzMAL3NldDE2LzQAL3NldDE2LzUAL3NldDE2LzYAL3NldDE3LzEAL3NldDE3LzIAL3NldDE3LzMAL3NldDE3LzQAL3NldDE3LzUAL3NldDE3LzYAL3NldDE3LzcAL3NldDE4LzEAL3NldDE4LzIAL3NldDE4LzMAL3NldDE4LzQAL3NldDE4LzUAL3NldDE4LzYAL3NldDE4LzcAL3NldDE4LzgAL3NldDE5LzEAL3NldDE5LzIAL3NldDE5LzMAL3NldDE5LzQAL3NldDE5LzUAL3NldDE5LzYAL3NldDE5LzcAL3NldDE5LzgAL3NldDE5LzkAL3NldDIzLzEAL3NldDIzLzIAL3NldDIzLzMAL3NldDI0LzEAL3NldDI0LzIAL3NldDI0LzMAL3NldDI0LzQAL3NldDI1LzEAL3NldDI1LzIAL3NldDI1LzMAL3NldDI1LzQAL3NldDI1LzUAL3NldDI2LzEAL3NldDI2LzIAL3NldDI2LzMAL3NldDI2LzQAL3NldDI2LzUAL3NldDI2LzYAL3NldDI3LzEAL3NldDI3LzIAL3NldDI3LzMAL3NldDI3LzQAL3NldDI3LzUAL3NldDI3LzYAL3NldDI3LzcAL3NldDI4LzEAL3NldDI4LzIAL3NldDI4LzMAL3NldDI4LzQAL3NldDI4LzUAL3NldDI4LzYAL3NldDI4LzcAL3NldDI4LzgAL3NldDMxMC8xAC9zZXQzMTAvMTAAL3NldDMxMC8yAC9zZXQzMTAvMwAvc2V0MzEwLzQAL3NldDMxMC81AC9zZXQzMTAvNgAvc2V0MzEwLzcAL3NldDMxMC84AC9zZXQzMTAvOQAvc2V0MzExLzEAL3NldDMxMS8xMAAvc2V0MzExLzExAC9zZXQzMTEvMgAvc2V0MzExLzMAL3NldDMxMS80AC9zZXQzMTEvNQAvc2V0MzExLzYAL3NldDMxMS83AC9zZXQzMTEvOAAvc2V0MzExLzkAL3NldDMxMi8xAC9zZXQzMTIvMTAAL3NldDMxMi8xMQAvc2V0MzEyLzEyAC9zZXQzMTIvMgAvc2V0MzEyLzMAL3NldDMxMi80AC9zZXQzMTIvNQAvc2V0MzEyLzYAL3NldDMxMi83AC9zZXQzMTIvOAAvc2V0MzEyLzkAL3NldDMzLzEAL3NldDMzLzIAL3NldDMzLzMAL3NldDM0LzEAL3NldDM0LzIAL3NldDM0LzMAL3NldDM0LzQAL3NldDM1LzEAL3NldDM1LzIAL3NldDM1LzMAL3NldDM1LzQAL3NldDM1LzUAL3NldDM2LzEAL3NldDM2LzIAL3NldDM2LzMAL3NldDM2LzQAL3NldDM2LzUAL3NldDM2LzYAL3NldDM3LzEAL3NldDM3LzIAL3NldDM3LzMAL3NldDM3LzQAL3NldDM3LzUAL3NldDM3LzYAL3NldDM3LzcAL3NldDM4LzEAL3NldDM4LzIAL3NldDM4LzMAL3NldDM4LzQAL3NldDM4LzUAL3NldDM4LzYAL3NldDM4LzcAL3NldDM4LzgAL3NldDM5LzEAL3NldDM5LzIAL3NldDM5LzMAL3NldDM5LzQAL3NldDM5LzUAL3NldDM5LzYAL3NldDM5LzcAL3NldDM5LzgAL3NldDM5LzkAL3NwZWN0cmFsMTAvMQAvc3BlY3RyYWwxMC8xMAAvc3BlY3RyYWwxMC8yAC9zcGVjdHJhbDEwLzMAL3NwZWN0cmFsMTAvNAAvc3BlY3RyYWwxMC81AC9zcGVjdHJhbDEwLzYAL3NwZWN0cmFsMTAvNwAvc3BlY3RyYWwxMC84AC9zcGVjdHJhbDEwLzkAL3NwZWN0cmFsMTEvMQAvc3BlY3RyYWwxMS8xMAAvc3BlY3RyYWwxMS8xMQAvc3BlY3RyYWwxMS8yAC9zcGVjdHJhbDExLzMAL3NwZWN0cmFsMTEvNAAvc3BlY3RyYWwxMS81AC9zcGVjdHJhbDExLzYAL3NwZWN0cmFsMTEvNwAvc3BlY3RyYWwxMS84AC9zcGVjdHJhbDExLzkAL3NwZWN0cmFsMy8xAC9zcGVjdHJhbDMvMgAvc3BlY3RyYWwzLzMAL3NwZWN0cmFsNC8xAC9zcGVjdHJhbDQvMgAvc3BlY3RyYWw0LzMAL3NwZWN0cmFsNC80AC9zcGVjdHJhbDUvMQAvc3BlY3RyYWw1LzIAL3NwZWN0cmFsNS8zAC9zcGVjdHJhbDUvNAAvc3BlY3RyYWw1LzUAL3NwZWN0cmFsNi8xAC9zcGVjdHJhbDYvMgAvc3BlY3RyYWw2LzMAL3NwZWN0cmFsNi80AC9zcGVjdHJhbDYvNQAvc3BlY3RyYWw2LzYAL3NwZWN0cmFsNy8xAC9zcGVjdHJhbDcvMgAvc3BlY3RyYWw3LzMAL3NwZWN0cmFsNy80AC9zcGVjdHJhbDcvNQAvc3BlY3RyYWw3LzYAL3NwZWN0cmFsNy83AC9zcGVjdHJhbDgvMQAvc3BlY3RyYWw4LzIAL3NwZWN0cmFsOC8zAC9zcGVjdHJhbDgvNAAvc3BlY3RyYWw4LzUAL3NwZWN0cmFsOC82AC9zcGVjdHJhbDgvNwAvc3BlY3RyYWw4LzgAL3NwZWN0cmFsOS8xAC9zcGVjdHJhbDkvMgAvc3BlY3RyYWw5LzMAL3NwZWN0cmFsOS80AC9zcGVjdHJhbDkvNQAvc3BlY3RyYWw5LzYAL3NwZWN0cmFsOS83AC9zcGVjdHJhbDkvOAAvc3BlY3RyYWw5LzkAL3N2Zy9hbGljZWJsdWUAL3N2Zy9hbnRpcXVld2hpdGUAL3N2Zy9hcXVhAC9zdmcvYXF1YW1hcmluZQAvc3ZnL2F6dXJlAC9zdmcvYmVpZ2UAL3N2Zy9iaXNxdWUAL3N2Zy9ibGFjawAvc3ZnL2JsYW5jaGVkYWxtb25kAC9zdmcvYmx1ZQAvc3ZnL2JsdWV2aW9sZXQAL3N2Zy9icm93bgAvc3ZnL2J1cmx5d29vZAAvc3ZnL2NhZGV0Ymx1ZQAvc3ZnL2NoYXJ0cmV1c2UAL3N2Zy9jaG9jb2xhdGUAL3N2Zy9jb3JhbAAvc3ZnL2Nvcm5mbG93ZXJibHVlAC9zdmcvY29ybnNpbGsAL3N2Zy9jcmltc29uAC9zdmcvY3lhbgAvc3ZnL2RhcmtibHVlAC9zdmcvZGFya2N5YW4AL3N2Zy9kYXJrZ29sZGVucm9kAC9zdmcvZGFya2dyYXkAL3N2Zy9kYXJrZ3JlZW4AL3N2Zy9kYXJrZ3JleQAvc3ZnL2RhcmtraGFraQAvc3ZnL2RhcmttYWdlbnRhAC9zdmcvZGFya29saXZlZ3JlZW4AL3N2Zy9kYXJrb3JhbmdlAC9zdmcvZGFya29yY2hpZAAvc3ZnL2RhcmtyZWQAL3N2Zy9kYXJrc2FsbW9uAC9zdmcvZGFya3NlYWdyZWVuAC9zdmcvZGFya3NsYXRlYmx1ZQAvc3ZnL2RhcmtzbGF0ZWdyYXkAL3N2Zy9kYXJrc2xhdGVncmV5AC9zdmcvZGFya3R1cnF1b2lzZQAvc3ZnL2Rhcmt2aW9sZXQAL3N2Zy9kZWVwcGluawAvc3ZnL2RlZXBza3libHVlAC9zdmcvZGltZ3JheQAvc3ZnL2RpbWdyZXkAL3N2Zy9kb2RnZXJibHVlAC9zdmcvZmlyZWJyaWNrAC9zdmcvZmxvcmFsd2hpdGUAL3N2Zy9mb3Jlc3RncmVlbgAvc3ZnL2Z1Y2hzaWEAL3N2Zy9nYWluc2Jvcm8AL3N2Zy9naG9zdHdoaXRlAC9zdmcvZ29sZAAvc3ZnL2dvbGRlbnJvZAAvc3ZnL2dyYXkAL3N2Zy9ncmVlbgAvc3ZnL2dyZWVueWVsbG93AC9zdmcvZ3JleQAvc3ZnL2hvbmV5ZGV3AC9zdmcvaG90cGluawAvc3ZnL2luZGlhbnJlZAAvc3ZnL2luZGlnbwAvc3ZnL2l2b3J5AC9zdmcva2hha2kAL3N2Zy9sYXZlbmRlcgAvc3ZnL2xhdmVuZGVyYmx1c2gAL3N2Zy9sYXduZ3JlZW4AL3N2Zy9sZW1vbmNoaWZmb24AL3N2Zy9saWdodGJsdWUAL3N2Zy9saWdodGNvcmFsAC9zdmcvbGlnaHRjeWFuAC9zdmcvbGlnaHRnb2xkZW5yb2R5ZWxsb3cAL3N2Zy9saWdodGdyYXkAL3N2Zy9saWdodGdyZWVuAC9zdmcvbGlnaHRncmV5AC9zdmcvbGlnaHRwaW5rAC9zdmcvbGlnaHRzYWxtb24AL3N2Zy9saWdodHNlYWdyZWVuAC9zdmcvbGlnaHRza3libHVlAC9zdmcvbGlnaHRzbGF0ZWdyYXkAL3N2Zy9saWdodHNsYXRlZ3JleQAvc3ZnL2xpZ2h0c3RlZWxibHVlAC9zdmcvbGlnaHR5ZWxsb3cAL3N2Zy9saW1lAC9zdmcvbGltZWdyZWVuAC9zdmcvbGluZW4AL3N2Zy9tYWdlbnRhAC9zdmcvbWFyb29uAC9zdmcvbWVkaXVtYXF1YW1hcmluZQAvc3ZnL21lZGl1bWJsdWUAL3N2Zy9tZWRpdW1vcmNoaWQAL3N2Zy9tZWRpdW1wdXJwbGUAL3N2Zy9tZWRpdW1zZWFncmVlbgAvc3ZnL21lZGl1bXNsYXRlYmx1ZQAvc3ZnL21lZGl1bXNwcmluZ2dyZWVuAC9zdmcvbWVkaXVtdHVycXVvaXNlAC9zdmcvbWVkaXVtdmlvbGV0cmVkAC9zdmcvbWlkbmlnaHRibHVlAC9zdmcvbWludGNyZWFtAC9zdmcvbWlzdHlyb3NlAC9zdmcvbW9jY2FzaW4AL3N2Zy9uYXZham93aGl0ZQAvc3ZnL25hdnkAL3N2Zy9vbGRsYWNlAC9zdmcvb2xpdmUAL3N2Zy9vbGl2ZWRyYWIAL3N2Zy9vcmFuZ2UAL3N2Zy9vcmFuZ2VyZWQAL3N2Zy9vcmNoaWQAL3N2Zy9wYWxlZ29sZGVucm9kAC9zdmcvcGFsZWdyZWVuAC9zdmcvcGFsZXR1cnF1b2lzZQAvc3ZnL3BhbGV2aW9sZXRyZWQAL3N2Zy9wYXBheWF3aGlwAC9zdmcvcGVhY2hwdWZmAC9zdmcvcGVydQAvc3ZnL3BpbmsAL3N2Zy9wbHVtAC9zdmcvcG93ZGVyYmx1ZQAvc3ZnL3B1cnBsZQAvc3ZnL3JlZAAvc3ZnL3Jvc3licm93bgAvc3ZnL3JveWFsYmx1ZQAvc3ZnL3NhZGRsZWJyb3duAC9zdmcvc2FsbW9uAC9zdmcvc2FuZHlicm93bgAvc3ZnL3NlYWdyZWVuAC9zdmcvc2Vhc2hlbGwAL3N2Zy9zaWVubmEAL3N2Zy9zaWx2ZXIAL3N2Zy9za3libHVlAC9zdmcvc2xhdGVibHVlAC9zdmcvc2xhdGVncmF5AC9zdmcvc2xhdGVncmV5AC9zdmcvc25vdwAvc3ZnL3NwcmluZ2dyZWVuAC9zdmcvc3RlZWxibHVlAC9zdmcvdGFuAC9zdmcvdGVhbAAvc3ZnL3RoaXN0bGUAL3N2Zy90b21hdG8AL3N2Zy90dXJxdW9pc2UAL3N2Zy92aW9sZXQAL3N2Zy93aGVhdAAvc3ZnL3doaXRlAC9zdmcvd2hpdGVzbW9rZQAvc3ZnL3llbGxvdwAvc3ZnL3llbGxvd2dyZWVuAC95bGduMy8xAC95bGduMy8yAC95bGduMy8zAC95bGduNC8xAC95bGduNC8yAC95bGduNC8zAC95bGduNC80AC95bGduNS8xAC95bGduNS8yAC95bGduNS8zAC95bGduNS80AC95bGduNS81AC95bGduNi8xAC95bGduNi8yAC95bGduNi8zAC95bGduNi80AC95bGduNi81AC95bGduNi82AC95bGduNy8xAC95bGduNy8yAC95bGduNy8zAC95bGduNy80AC95bGduNy81AC95bGduNy82AC95bGduNy83AC95bGduOC8xAC95bGduOC8yAC95bGduOC8zAC95bGduOC80AC95bGduOC81AC95bGduOC82AC95bGduOC83AC95bGduOC84AC95bGduOS8xAC95bGduOS8yAC95bGduOS8zAC95bGduOS80AC95bGduOS81AC95bGduOS82AC95bGduOS83AC95bGduOS84AC95bGduOS85AC95bGduYnUzLzEAL3lsZ25idTMvMgAveWxnbmJ1My8zAC95bGduYnU0LzEAL3lsZ25idTQvMgAveWxnbmJ1NC8zAC95bGduYnU0LzQAL3lsZ25idTUvMQAveWxnbmJ1NS8yAC95bGduYnU1LzMAL3lsZ25idTUvNAAveWxnbmJ1NS81AC95bGduYnU2LzEAL3lsZ25idTYvMgAveWxnbmJ1Ni8zAC95bGduYnU2LzQAL3lsZ25idTYvNQAveWxnbmJ1Ni82AC95bGduYnU3LzEAL3lsZ25idTcvMgAveWxnbmJ1Ny8zAC95bGduYnU3LzQAL3lsZ25idTcvNQAveWxnbmJ1Ny82AC95bGduYnU3LzcAL3lsZ25idTgvMQAveWxnbmJ1OC8yAC95bGduYnU4LzMAL3lsZ25idTgvNAAveWxnbmJ1OC81AC95bGduYnU4LzYAL3lsZ25idTgvNwAveWxnbmJ1OC84AC95bGduYnU5LzEAL3lsZ25idTkvMgAveWxnbmJ1OS8zAC95bGduYnU5LzQAL3lsZ25idTkvNQAveWxnbmJ1OS82AC95bGduYnU5LzcAL3lsZ25idTkvOAAveWxnbmJ1OS85AC95bG9yYnIzLzEAL3lsb3JicjMvMgAveWxvcmJyMy8zAC95bG9yYnI0LzEAL3lsb3JicjQvMgAveWxvcmJyNC8zAC95bG9yYnI0LzQAL3lsb3JicjUvMQAveWxvcmJyNS8yAC95bG9yYnI1LzMAL3lsb3JicjUvNAAveWxvcmJyNS81AC95bG9yYnI2LzEAL3lsb3JicjYvMgAveWxvcmJyNi8zAC95bG9yYnI2LzQAL3lsb3JicjYvNQAveWxvcmJyNi82AC95bG9yYnI3LzEAL3lsb3JicjcvMgAveWxvcmJyNy8zAC95bG9yYnI3LzQAL3lsb3JicjcvNQAveWxvcmJyNy82AC95bG9yYnI3LzcAL3lsb3JicjgvMQAveWxvcmJyOC8yAC95bG9yYnI4LzMAL3lsb3JicjgvNAAveWxvcmJyOC81AC95bG9yYnI4LzYAL3lsb3JicjgvNwAveWxvcmJyOC84AC95bG9yYnI5LzEAL3lsb3JicjkvMgAveWxvcmJyOS8zAC95bG9yYnI5LzQAL3lsb3JicjkvNQAveWxvcmJyOS82AC95bG9yYnI5LzcAL3lsb3JicjkvOAAveWxvcmJyOS85AC95bG9ycmQzLzEAL3lsb3JyZDMvMgAveWxvcnJkMy8zAC95bG9ycmQ0LzEAL3lsb3JyZDQvMgAveWxvcnJkNC8zAC95bG9ycmQ0LzQAL3lsb3JyZDUvMQAveWxvcnJkNS8yAC95bG9ycmQ1LzMAL3lsb3JyZDUvNAAveWxvcnJkNS81AC95bG9ycmQ2LzEAL3lsb3JyZDYvMgAveWxvcnJkNi8zAC95bG9ycmQ2LzQAL3lsb3JyZDYvNQAveWxvcnJkNi82AC95bG9ycmQ3LzEAL3lsb3JyZDcvMgAveWxvcnJkNy8zAC95bG9ycmQ3LzQAL3lsb3JyZDcvNQAveWxvcnJkNy82AC95bG9ycmQ3LzcAL3lsb3JyZDgvMQAveWxvcnJkOC8yAC95bG9ycmQ4LzMAL3lsb3JyZDgvNAAveWxvcnJkOC81AC95bG9ycmQ4LzYAL3lsb3JyZDgvNwAveWxvcnJkOC84AC95bG9ycmQ5LzEAL3lsb3JyZDkvMgAveWxvcnJkOS8zAC95bG9ycmQ5LzQAL3lsb3JyZDkvNQAveWxvcnJkOS82AC95bG9ycmQ5LzcAL3lsb3JyZDkvOAAveWxvcnJkOS85AGFsaWNlYmx1ZQBhbnRpcXVld2hpdGUAYW50aXF1ZXdoaXRlMQBhbnRpcXVld2hpdGUyAGFudGlxdWV3aGl0ZTMAYW50aXF1ZXdoaXRlNABhcXVhbWFyaW5lAGFxdWFtYXJpbmUxAGFxdWFtYXJpbmUyAGFxdWFtYXJpbmUzAGFxdWFtYXJpbmU0AGF6dXJlAGF6dXJlMQBhenVyZTIAYXp1cmUzAGF6dXJlNABiZWlnZQBiaXNxdWUAYmlzcXVlMQBiaXNxdWUyAGJpc3F1ZTMAYmlzcXVlNABibGFuY2hlZGFsbW9uZABibHVlAGJsdWUxAGJsdWUyAGJsdWUzAGJsdWU0AGJsdWV2aW9sZXQAYnJvd24AYnJvd24xAGJyb3duMgBicm93bjMAYnJvd240AGJ1cmx5d29vZABidXJseXdvb2QxAGJ1cmx5d29vZDIAYnVybHl3b29kMwBidXJseXdvb2Q0AGNhZGV0Ymx1ZQBjYWRldGJsdWUxAGNhZGV0Ymx1ZTIAY2FkZXRibHVlMwBjYWRldGJsdWU0AGNoYXJ0cmV1c2UAY2hhcnRyZXVzZTEAY2hhcnRyZXVzZTIAY2hhcnRyZXVzZTMAY2hhcnRyZXVzZTQAY2hvY29sYXRlAGNob2NvbGF0ZTEAY2hvY29sYXRlMgBjaG9jb2xhdGUzAGNob2NvbGF0ZTQAY29yYWwAY29yYWwxAGNvcmFsMgBjb3JhbDMAY29yYWw0AGNvcm5mbG93ZXJibHVlAGNvcm5zaWxrAGNvcm5zaWxrMQBjb3Juc2lsazIAY29ybnNpbGszAGNvcm5zaWxrNABjcmltc29uAGN5YW4AY3lhbjEAY3lhbjIAY3lhbjMAY3lhbjQAZGFya2dvbGRlbnJvZABkYXJrZ29sZGVucm9kMQBkYXJrZ29sZGVucm9kMgBkYXJrZ29sZGVucm9kMwBkYXJrZ29sZGVucm9kNABkYXJrZ3JlZW4AZGFya2toYWtpAGRhcmtvbGl2ZWdyZWVuAGRhcmtvbGl2ZWdyZWVuMQBkYXJrb2xpdmVncmVlbjIAZGFya29saXZlZ3JlZW4zAGRhcmtvbGl2ZWdyZWVuNABkYXJrb3JhbmdlAGRhcmtvcmFuZ2UxAGRhcmtvcmFuZ2UyAGRhcmtvcmFuZ2UzAGRhcmtvcmFuZ2U0AGRhcmtvcmNoaWQAZGFya29yY2hpZDEAZGFya29yY2hpZDIAZGFya29yY2hpZDMAZGFya29yY2hpZDQAZGFya3NhbG1vbgBkYXJrc2VhZ3JlZW4AZGFya3NlYWdyZWVuMQBkYXJrc2VhZ3JlZW4yAGRhcmtzZWFncmVlbjMAZGFya3NlYWdyZWVuNABkYXJrc2xhdGVibHVlAGRhcmtzbGF0ZWdyYXkAZGFya3NsYXRlZ3JheTEAZGFya3NsYXRlZ3JheTIAZGFya3NsYXRlZ3JheTMAZGFya3NsYXRlZ3JheTQAZGFya3NsYXRlZ3JleQBkYXJrdHVycXVvaXNlAGRhcmt2aW9sZXQAZGVlcHBpbmsAZGVlcHBpbmsxAGRlZXBwaW5rMgBkZWVwcGluazMAZGVlcHBpbms0AGRlZXBza3libHVlAGRlZXBza3libHVlMQBkZWVwc2t5Ymx1ZTIAZGVlcHNreWJsdWUzAGRlZXBza3libHVlNABkaW1ncmF5AGRpbWdyZXkAZG9kZ2VyYmx1ZQBkb2RnZXJibHVlMQBkb2RnZXJibHVlMgBkb2RnZXJibHVlMwBkb2RnZXJibHVlNABmaXJlYnJpY2sAZmlyZWJyaWNrMQBmaXJlYnJpY2syAGZpcmVicmljazMAZmlyZWJyaWNrNABmbG9yYWx3aGl0ZQBmb3Jlc3RncmVlbgBnYWluc2Jvcm8AZ2hvc3R3aGl0ZQBnb2xkAGdvbGQxAGdvbGQyAGdvbGQzAGdvbGQ0AGdvbGRlbnJvZABnb2xkZW5yb2QxAGdvbGRlbnJvZDIAZ29sZGVucm9kMwBnb2xkZW5yb2Q0AGdyYXkAZ3JheTAAZ3JheTEAZ3JheTEwAGdyYXkxMDAAZ3JheTExAGdyYXkxMgBncmF5MTMAZ3JheTE0AGdyYXkxNQBncmF5MTYAZ3JheTE3AGdyYXkxOABncmF5MTkAZ3JheTIAZ3JheTIwAGdyYXkyMQBncmF5MjIAZ3JheTIzAGdyYXkyNABncmF5MjUAZ3JheTI2AGdyYXkyNwBncmF5MjgAZ3JheTI5AGdyYXkzAGdyYXkzMABncmF5MzEAZ3JheTMyAGdyYXkzMwBncmF5MzQAZ3JheTM1AGdyYXkzNgBncmF5MzcAZ3JheTM4AGdyYXkzOQBncmF5NABncmF5NDAAZ3JheTQxAGdyYXk0MgBncmF5NDMAZ3JheTQ0AGdyYXk0NQBncmF5NDYAZ3JheTQ3AGdyYXk0OABncmF5NDkAZ3JheTUAZ3JheTUwAGdyYXk1MQBncmF5NTIAZ3JheTUzAGdyYXk1NABncmF5NTUAZ3JheTU2AGdyYXk1NwBncmF5NTgAZ3JheTU5AGdyYXk2AGdyYXk2MABncmF5NjEAZ3JheTYyAGdyYXk2MwBncmF5NjQAZ3JheTY1AGdyYXk2NgBncmF5NjcAZ3JheTY4AGdyYXk2OQBncmF5NwBncmF5NzAAZ3JheTcxAGdyYXk3MgBncmF5NzMAZ3JheTc0AGdyYXk3NQBncmF5NzYAZ3JheTc3AGdyYXk3OABncmF5NzkAZ3JheTgAZ3JheTgwAGdyYXk4MQBncmF5ODIAZ3JheTgzAGdyYXk4NABncmF5ODUAZ3JheTg2AGdyYXk4NwBncmF5ODgAZ3JheTg5AGdyYXk5AGdyYXk5MABncmF5OTEAZ3JheTkyAGdyYXk5MwBncmF5OTQAZ3JheTk1AGdyYXk5NgBncmF5OTcAZ3JheTk4AGdyYXk5OQBncmVlbgBncmVlbjEAZ3JlZW4yAGdyZWVuMwBncmVlbjQAZ3JlZW55ZWxsb3cAZ3JleQBncmV5MABncmV5MQBncmV5MTAAZ3JleTEwMABncmV5MTEAZ3JleTEyAGdyZXkxMwBncmV5MTQAZ3JleTE1AGdyZXkxNgBncmV5MTcAZ3JleTE4AGdyZXkxOQBncmV5MgBncmV5MjAAZ3JleTIxAGdyZXkyMgBncmV5MjMAZ3JleTI0AGdyZXkyNQBncmV5MjYAZ3JleTI3AGdyZXkyOABncmV5MjkAZ3JleTMAZ3JleTMwAGdyZXkzMQBncmV5MzIAZ3JleTMzAGdyZXkzNABncmV5MzUAZ3JleTM2AGdyZXkzNwBncmV5MzgAZ3JleTM5AGdyZXk0AGdyZXk0MABncmV5NDEAZ3JleTQyAGdyZXk0MwBncmV5NDQAZ3JleTQ1AGdyZXk0NgBncmV5NDcAZ3JleTQ4AGdyZXk0OQBncmV5NQBncmV5NTAAZ3JleTUxAGdyZXk1MgBncmV5NTMAZ3JleTU0AGdyZXk1NQBncmV5NTYAZ3JleTU3AGdyZXk1OABncmV5NTkAZ3JleTYAZ3JleTYwAGdyZXk2MQBncmV5NjIAZ3JleTYzAGdyZXk2NABncmV5NjUAZ3JleTY2AGdyZXk2NwBncmV5NjgAZ3JleTY5AGdyZXk3AGdyZXk3MABncmV5NzEAZ3JleTcyAGdyZXk3MwBncmV5NzQAZ3JleTc1AGdyZXk3NgBncmV5NzcAZ3JleTc4AGdyZXk3OQBncmV5OABncmV5ODAAZ3JleTgxAGdyZXk4MgBncmV5ODMAZ3JleTg0AGdyZXk4NQBncmV5ODYAZ3JleTg3AGdyZXk4OABncmV5ODkAZ3JleTkAZ3JleTkwAGdyZXk5MQBncmV5OTIAZ3JleTkzAGdyZXk5NABncmV5OTUAZ3JleTk2AGdyZXk5NwBncmV5OTgAZ3JleTk5AGhvbmV5ZGV3AGhvbmV5ZGV3MQBob25leWRldzIAaG9uZXlkZXczAGhvbmV5ZGV3NABob3RwaW5rAGhvdHBpbmsxAGhvdHBpbmsyAGhvdHBpbmszAGhvdHBpbms0AGluZGlhbnJlZABpbmRpYW5yZWQxAGluZGlhbnJlZDIAaW5kaWFucmVkMwBpbmRpYW5yZWQ0AGluZGlnbwBpbnZpcwBpdm9yeQBpdm9yeTEAaXZvcnkyAGl2b3J5MwBpdm9yeTQAa2hha2kAa2hha2kxAGtoYWtpMgBraGFraTMAa2hha2k0AGxhdmVuZGVyAGxhdmVuZGVyYmx1c2gAbGF2ZW5kZXJibHVzaDEAbGF2ZW5kZXJibHVzaDIAbGF2ZW5kZXJibHVzaDMAbGF2ZW5kZXJibHVzaDQAbGF3bmdyZWVuAGxlbW9uY2hpZmZvbgBsZW1vbmNoaWZmb24xAGxlbW9uY2hpZmZvbjIAbGVtb25jaGlmZm9uMwBsZW1vbmNoaWZmb240AGxpZ2h0Ymx1ZQBsaWdodGJsdWUxAGxpZ2h0Ymx1ZTIAbGlnaHRibHVlMwBsaWdodGJsdWU0AGxpZ2h0Y29yYWwAbGlnaHRjeWFuAGxpZ2h0Y3lhbjEAbGlnaHRjeWFuMgBsaWdodGN5YW4zAGxpZ2h0Y3lhbjQAbGlnaHRnb2xkZW5yb2QAbGlnaHRnb2xkZW5yb2QxAGxpZ2h0Z29sZGVucm9kMgBsaWdodGdvbGRlbnJvZDMAbGlnaHRnb2xkZW5yb2Q0AGxpZ2h0Z29sZGVucm9keWVsbG93AGxpZ2h0Z3JheQBsaWdodGdyZXkAbGlnaHRwaW5rAGxpZ2h0cGluazEAbGlnaHRwaW5rMgBsaWdodHBpbmszAGxpZ2h0cGluazQAbGlnaHRzYWxtb24AbGlnaHRzYWxtb24xAGxpZ2h0c2FsbW9uMgBsaWdodHNhbG1vbjMAbGlnaHRzYWxtb240AGxpZ2h0c2VhZ3JlZW4AbGlnaHRza3libHVlAGxpZ2h0c2t5Ymx1ZTEAbGlnaHRza3libHVlMgBsaWdodHNreWJsdWUzAGxpZ2h0c2t5Ymx1ZTQAbGlnaHRzbGF0ZWJsdWUAbGlnaHRzbGF0ZWdyYXkAbGlnaHRzbGF0ZWdyZXkAbGlnaHRzdGVlbGJsdWUAbGlnaHRzdGVlbGJsdWUxAGxpZ2h0c3RlZWxibHVlMgBsaWdodHN0ZWVsYmx1ZTMAbGlnaHRzdGVlbGJsdWU0AGxpZ2h0eWVsbG93AGxpZ2h0eWVsbG93MQBsaWdodHllbGxvdzIAbGlnaHR5ZWxsb3czAGxpZ2h0eWVsbG93NABsaW1lZ3JlZW4AbGluZW4AbWFnZW50YQBtYWdlbnRhMQBtYWdlbnRhMgBtYWdlbnRhMwBtYWdlbnRhNABtYXJvb24AbWFyb29uMQBtYXJvb24yAG1hcm9vbjMAbWFyb29uNABtZWRpdW1hcXVhbWFyaW5lAG1lZGl1bWJsdWUAbWVkaXVtb3JjaGlkAG1lZGl1bW9yY2hpZDEAbWVkaXVtb3JjaGlkMgBtZWRpdW1vcmNoaWQzAG1lZGl1bW9yY2hpZDQAbWVkaXVtcHVycGxlAG1lZGl1bXB1cnBsZTEAbWVkaXVtcHVycGxlMgBtZWRpdW1wdXJwbGUzAG1lZGl1bXB1cnBsZTQAbWVkaXVtc2VhZ3JlZW4AbWVkaXVtc2xhdGVibHVlAG1lZGl1bXNwcmluZ2dyZWVuAG1lZGl1bXR1cnF1b2lzZQBtZWRpdW12aW9sZXRyZWQAbWlkbmlnaHRibHVlAG1pbnRjcmVhbQBtaXN0eXJvc2UAbWlzdHlyb3NlMQBtaXN0eXJvc2UyAG1pc3R5cm9zZTMAbWlzdHlyb3NlNABtb2NjYXNpbgBuYXZham93aGl0ZQBuYXZham93aGl0ZTEAbmF2YWpvd2hpdGUyAG5hdmFqb3doaXRlMwBuYXZham93aGl0ZTQAbmF2eQBuYXZ5Ymx1ZQBub25lAG9sZGxhY2UAb2xpdmVkcmFiAG9saXZlZHJhYjEAb2xpdmVkcmFiMgBvbGl2ZWRyYWIzAG9saXZlZHJhYjQAb3JhbmdlAG9yYW5nZTEAb3JhbmdlMgBvcmFuZ2UzAG9yYW5nZTQAb3JhbmdlcmVkAG9yYW5nZXJlZDEAb3JhbmdlcmVkMgBvcmFuZ2VyZWQzAG9yYW5nZXJlZDQAb3JjaGlkAG9yY2hpZDEAb3JjaGlkMgBvcmNoaWQzAG9yY2hpZDQAcGFsZWdvbGRlbnJvZABwYWxlZ3JlZW4AcGFsZWdyZWVuMQBwYWxlZ3JlZW4yAHBhbGVncmVlbjMAcGFsZWdyZWVuNABwYWxldHVycXVvaXNlAHBhbGV0dXJxdW9pc2UxAHBhbGV0dXJxdW9pc2UyAHBhbGV0dXJxdW9pc2UzAHBhbGV0dXJxdW9pc2U0AHBhbGV2aW9sZXRyZWQAcGFsZXZpb2xldHJlZDEAcGFsZXZpb2xldHJlZDIAcGFsZXZpb2xldHJlZDMAcGFsZXZpb2xldHJlZDQAcGFwYXlhd2hpcABwZWFjaHB1ZmYAcGVhY2hwdWZmMQBwZWFjaHB1ZmYyAHBlYWNocHVmZjMAcGVhY2hwdWZmNABwZXJ1AHBpbmsAcGluazEAcGluazIAcGluazMAcGluazQAcGx1bQBwbHVtMQBwbHVtMgBwbHVtMwBwbHVtNABwb3dkZXJibHVlAHB1cnBsZQBwdXJwbGUxAHB1cnBsZTIAcHVycGxlMwBwdXJwbGU0AHJlZAByZWQxAHJlZDIAcmVkMwByZWQ0AHJvc3licm93bgByb3N5YnJvd24xAHJvc3licm93bjIAcm9zeWJyb3duMwByb3N5YnJvd240AHJveWFsYmx1ZQByb3lhbGJsdWUxAHJveWFsYmx1ZTIAcm95YWxibHVlMwByb3lhbGJsdWU0AHNhZGRsZWJyb3duAHNhbG1vbgBzYWxtb24xAHNhbG1vbjIAc2FsbW9uMwBzYWxtb240AHNhbmR5YnJvd24Ac2VhZ3JlZW4Ac2VhZ3JlZW4xAHNlYWdyZWVuMgBzZWFncmVlbjMAc2VhZ3JlZW40AHNlYXNoZWxsAHNlYXNoZWxsMQBzZWFzaGVsbDIAc2Vhc2hlbGwzAHNlYXNoZWxsNABzaWVubmEAc2llbm5hMQBzaWVubmEyAHNpZW5uYTMAc2llbm5hNABza3libHVlAHNreWJsdWUxAHNreWJsdWUyAHNreWJsdWUzAHNreWJsdWU0AHNsYXRlYmx1ZQBzbGF0ZWJsdWUxAHNsYXRlYmx1ZTIAc2xhdGVibHVlMwBzbGF0ZWJsdWU0AHNsYXRlZ3JheQBzbGF0ZWdyYXkxAHNsYXRlZ3JheTIAc2xhdGVncmF5MwBzbGF0ZWdyYXk0AHNsYXRlZ3JleQBzbm93AHNub3cxAHNub3cyAHNub3czAHNub3c0AHNwcmluZ2dyZWVuAHNwcmluZ2dyZWVuMQBzcHJpbmdncmVlbjIAc3ByaW5nZ3JlZW4zAHNwcmluZ2dyZWVuNABzdGVlbGJsdWUAc3RlZWxibHVlMQBzdGVlbGJsdWUyAHN0ZWVsYmx1ZTMAc3RlZWxibHVlNAB0YW4AdGFuMQB0YW4yAHRhbjMAdGFuNAB0aGlzdGxlAHRoaXN0bGUxAHRoaXN0bGUyAHRoaXN0bGUzAHRoaXN0bGU0AHRvbWF0bwB0b21hdG8xAHRvbWF0bzIAdG9tYXRvMwB0b21hdG80AHR1cnF1b2lzZQB0dXJxdW9pc2UxAHR1cnF1b2lzZTIAdHVycXVvaXNlMwB0dXJxdW9pc2U0AHZpb2xldAB2aW9sZXRyZWQAdmlvbGV0cmVkMQB2aW9sZXRyZWQyAHZpb2xldHJlZDMAdmlvbGV0cmVkNAB3aGVhdAB3aGVhdDEAd2hlYXQyAHdoZWF0MwB3aGVhdDQAd2hpdGUAd2hpdGVzbW9rZQB5ZWxsb3cAeWVsbG93MQB5ZWxsb3cyAHllbGxvdzMAeWVsbG93NAB5ZWxsb3dncmVlbgBsYWNrAGhpdGUAaWdodGdyZXkAWDExLwAvJXMvJXMAaW1hZ2VzY2FsZQBmYWxzZQBibGFjawBkb3R0ZWQAZGFzaGVkAGNwLT5zcmMAaHRtbHRhYmxlLmMAZW1pdF9odG1sX2ltZwBjcC0+c3JjWzBdAHRyYW5zcGFyZW50AF8lZAAlZAAyADMANAA1ADYANwA4ADkAMTAAMTEAMTIAMTMAMTQAMTUAMTYAMTcAMTgAMTkAMjAAQWdub2RlaW5mb190AEFnZWRnZWluZm9fdAByb3dnAGNvbGcAQWdyYXBoaW5mb190AGRlbHggPj0gMABwb3NfaHRtbF90YmwAZGVseSA+PSAwAHRhYmxlIHNpemUgdG9vIHNtYWxsIGZvciBjb250ZW50CgBmaXhlZCB0YWJsZSBzaXplIHdpdGggdW5zcGVjaWZpZWQgd2lkdGggb3IgaGVpZ2h0CgBjZWxsIHNpemUgdG9vIHNtYWxsIGZvciBjb250ZW50CgBmaXhlZCBjZWxsIHNpemUgd2l0aCB1bnNwZWNpZmllZCB3aWR0aCBvciBoZWlnaHQKAE5vIG9yIGltcHJvcGVyIGltYWdlIGZpbGU9IiVzIgoAcGVuY29sb3IALT4AZlBRLmMAUFFjaGVjawBIZWFwIG92ZXJmbG93CgAlIVBTLUFkb2JlLTIuMAovbm9kZSB7CiAgL1kgZXhjaCBkZWYKICAvWCBleGNoIGRlZgogIC95IGV4Y2ggZGVmCiAgL3ggZXhjaCBkZWYKICBuZXdwYXRoCiAgeCB5IG1vdmV0bwogIHggWSBsaW5ldG8KICBYIFkgbGluZXRvCiAgWCB5IGxpbmV0bwogIGNsb3NlcGF0aCBmaWxsCn0gZGVmCi9jZWxsIHsKICAvWSBleGNoIGRlZgogIC9YIGV4Y2ggZGVmCiAgL3kgZXhjaCBkZWYKICAveCBleGNoIGRlZgogIG5ld3BhdGgKICB4IHkgbW92ZXRvCiAgeCBZIGxpbmV0bwogIFggWSBsaW5ldG8KICBYIHkgbGluZXRvCiAgY2xvc2VwYXRoIHN0cm9rZQp9IGRlZgoAc2hvd3BhZ2UKAGZhaWxlZCBhdCBub2RlICVkWzBdCgBucC0+Y2VsbHNbMF0AbWF6ZS5jAGNoa1NncmFwaABmYWlsZWQgYXQgbm9kZSAlZFsxXQoAbnAtPmNlbGxzWzFdAGRpdGVtcwBmaW5kU1ZlcnQAJSUlJVBhZ2U6IDEgMQolJSUlUGFnZUJvdW5kaW5nQm94OiAlZCAlZCAlZCAlZAoAJWYgJWYgdHJhbnNsYXRlCgAwIDAgMSBzZXRyZ2Jjb2xvcgoAJWYgJWYgJWYgJWYgbm9kZQoAMCAwIDAgc2V0cmdiY29sb3IKACVmICVmICVmICVmIGNlbGwKADEgMCAwIHNldHJnYmNvbG9yCgB1bmV4cGVjdGVkIGNhc2UgaW4gbG9jYXRlX2VuZHBvaW50CgAwAHRyYXBlem9pZC5jAGxvY2F0ZV9lbmRwb2ludABhZGRfc2VnbWVudDogZXJyb3IKAG5ld25vZGU6IFF1ZXJ5LXRhYmxlIG92ZXJmbG93CgBuZXdub2RlAG5ld3RyYXA6IFRyYXBlem9pZC10YWJsZSBvdmVyZmxvdyAlZAoAbmV3dHJhcABpbmRleC5jAFJUcmVlU2VhcmNoAG4tPmxldmVsID49IDAAUlRyZWVJbnNlcnQAbGV2ZWwgPj0gMCAmJiBsZXZlbCA8PSAoKm4pLT5sZXZlbAByLT5ib3VuZGFyeVtpXSA8PSByLT5ib3VuZGFyeVtOVU1ESU1TICsgaV0AciAmJiBuICYmIG5ldwBSVHJlZUluc2VydDIAbGV2ZWwgPj0gMCAmJiBsZXZlbCA8PSBuLT5sZXZlbABGQUxTRQBub2RlLmMATm9kZUNvdmVyAHIgJiYgbgBQaWNrQnJhbmNoAEFkZEJyYW5jaABpIDwgTk9ERUNBUkQAbmV3AG4gJiYgaSA+PSAwICYmIGkgPCBOT0RFQ0FSRABEaXNjb25CcmFuY2gAcgByZWN0YW5nbGUuYwBSZWN0QXJlYQByICYmIHJyAENvbWJpbmVSZWN0AHIgJiYgcwBPdmVybGFwAG4Ac3BsaXQucS5jAFNwbGl0Tm9kZQBiAG4tPmNvdW50ICsgKCpubiktPmNvdW50ID09IE5PREVDQVJEICsgMQBMb2FkTm9kZXMAcQBwAHJ0cC0+c3BsaXQuUGFydGl0aW9uc1swXS5wYXJ0aXRpb25baV0gPT0gMCB8fCBydHAtPnNwbGl0LlBhcnRpdGlvbnNbMF0ucGFydGl0aW9uW2ldID09IDEAcnRwLT5zcGxpdC5QYXJ0aXRpb25zWzBdLmNvdW50WzBdICsgcnRwLT5zcGxpdC5QYXJ0aXRpb25zWzBdLmNvdW50WzFdID09IE5PREVDQVJEICsgMQBNZXRob2RaZXJvAHJ0cC0+c3BsaXQuUGFydGl0aW9uc1swXS5jb3VudFswXSA+PSBydHAtPk1pbkZpbGwgJiYgcnRwLT5zcGxpdC5QYXJ0aXRpb25zWzBdLmNvdW50WzFdID49IHJ0cC0+TWluRmlsbAAhcnRwLT5zcGxpdC5QYXJ0aXRpb25zWzBdLnRha2VuW2ldAENsYXNzaWZ5AEdldEJyYW5jaGVzAG4tPmJyYW5jaFtpXS5jaGlsZAAAAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAQIDBAUGBwgJCgsMDQ4PEBESExQVFhcYGRobHB0eHyAhIiMkJSYnKAICAgICAhAMWQEAH1AIAwcSExRXFhcIC2kMHwoFDA4pESsPLRAvMCAyBjQ1GxwdHgsMISIjJCUmJygMGBkXBAobHBogKgohIiMkJSYnKAwKDlMKLFgxWFhYWFhYDBscDy5YMyEiIyQlJicoGxz/U///ISIjJCUmJygM//8F////CRT//////wwbHP8QFRYhIiMkJSYnKBsc/////yEiIyQlJicoDP8SExQRFhf///////8MGxz///8SISIjJCUmJygbHP////8hIiMkJSYnKAz///////8T////////DBsc/////yEiIyQlJicoGxz/////ISIjJCUmJygSExQVFhcYGf///////////yMkJSYnGxITFBYXIjZoAR84ViEgAhsbG14bGzc5cDbSwk8EPCJHIj8iRCIiWCJlIiIFBl9gOQQHCAkKCwwNDgRmZ11qbQUGb1g7cQcICQoLDA0OBHI8W3M+YUYbEhMUFhcEBQY/QWJJBwgJCgsMDQ4FBgBcAAAHCAkKCwwNDgQAAE8AAABTQgAAAAAABAUGAERUVQcICQoLDA0OBQYAAAAABwgJCgsMDQ4EACosLkcxMwAAAAAAAAQFBgAAAEoHCAkKCwwNDgUGAAAAAAcICQoLDA0OBAAAAAAAAEwAAAAAAAAEBQYAAAAABwgJCgsMDQ4FBgAAAAAHCAkKCwwNDikrLS8wMjQ1AAAAAAAAAAAAKSstMDIABC8AJCMAEhQWGhweIBgABQcvLy8ALy8AAAkIKAAAASICBgAAAAAACAAAAAAAAAAAAAAAAAAlAyYTCikVCyoXDi0ZERsMKx0NLB8PIRAAMwAwAC9DADEALwA1LidCMkEAOjgAPDRFADYAQAAAPwBENzs5PQACAwMBAQIBAQEDAwMDAwMDAwEBAQEBAQEBAQEBAQEBAQECAQECAAYBAwMDAwMBAAECAwAEAQIDAAQABAAEAAMCAQIBAgFTeW50YXggZXJyb3I6IG5vbi1zcGFjZSBzdHJpbmcgdXNlZCBiZWZvcmUgPFRBQkxFPgBTeW50YXggZXJyb3I6IG5vbi1zcGFjZSBzdHJpbmcgdXNlZCBhZnRlciA8L1RBQkxFPgAAKSoqKissLC0tLS0tLS0tLS0uLzAxMjM0NTY3ODk6Ozw9Pj4/P0FAQkJCQkJCQ0NERERGRUdHR0lISkhLSExITU1OTk9P/wMPEBEjOiQ9JUAVQyZFJ0gYSxlNGigcTh0eUFFSWVpsa25jZFdpbWVtb3J5IGV4aGF1c3RlZAAlcyBpbiBsaW5lICVkIAoALi4uICVzIC4uLgoAVEFCTEUAVFIAVEgAVEQASFRNTABGT05UAEIAVQBPAEkAU1VQAFNVQgBTAEJSAEhSAFZSAElNRwBVbmtub3duIEhUTUwgZWxlbWVudCA8JXM+IG9uIGxpbmUgJWQgCgA8SU1HPgBJbGxlZ2FsIGF0dHJpYnV0ZSAlcyBpbiAlcyAtIGlnbm9yZWQKAHNjYWxlAHNyYwA8QlI+AGFsaWduAElHSFQARUZUAEVOVEVSAElsbGVnYWwgdmFsdWUgJXMgZm9yIEFMSUdOIC0gaWdub3JlZAoAPEZPTlQ+AGNvbG9yAGZhY2UAcG9pbnQtc2l6ZQBQT0lOVC1TSVpFAEltcHJvcGVyICVzIHZhbHVlICVzIC0gaWdub3JlZAAlcyB2YWx1ZSAlcyA+ICVkIC0gdG9vIGxhcmdlIC0gaWdub3JlZAAlcyB2YWx1ZSAlcyA8ICVkIC0gdG9vIHNtYWxsIC0gaWdub3JlZAA8VEQ+AGJhbGlnbgBiZ2NvbG9yAGJvcmRlcgBjZWxscGFkZGluZwBjZWxsc3BhY2luZwBjb2xzcGFuAGZpeGVkc2l6ZQBncmFkaWVudGFuZ2xlAGhlaWdodABocmVmAGlkAHBvcnQAcm93c3BhbgBzaWRlcwBzdHlsZQB0YXJnZXQAdGl0bGUAdG9vbHRpcAB2YWxpZ24Ad2lkdGgAV0lEVEgAT1RUT00AT1AASURETEUASWxsZWdhbCB2YWx1ZSAlcyBmb3IgVkFMSUdOIC0gaWdub3JlZAoAICwAT1VOREVEAEFESUFMAElsbGVnYWwgdmFsdWUgJXMgZm9yIFNUWUxFIC0gaWdub3JlZAoAU09MSUQASU5WSVNJQkxFAElOVklTAERPVFRFRABEQVNIRUQAVW5yZWNvZ25pemVkIGNoYXJhY3RlciAnJWMnICglZCkgaW4gc2lkZXMgYXR0cmlidXRlCgBST1dTUEFOAFJPV1NQQU4gdmFsdWUgY2Fubm90IGJlIDAgLSBpZ25vcmVkCgBIRUlHSFQAR1JBRElFTlRBTkdMRQBSVUUAQUxTRQBJbGxlZ2FsIHZhbHVlICVzIGZvciBGSVhFRFNJWkUgLSBpZ25vcmVkCgBDT0xTUEFOAENPTFNQQU4gdmFsdWUgY2Fubm90IGJlIDAgLSBpZ25vcmVkCgBDRUxMU1BBQ0lORwBDRUxMUEFERElORwBCT1JERVIASWxsZWdhbCB2YWx1ZSAlcyBmb3IgQkFMSUdOIGluIFREIC0gaWdub3JlZAoARVhUAElsbGVnYWwgdmFsdWUgJXMgZm9yIEFMSUdOIGluIFREIC0gaWdub3JlZAoAPFRBQkxFPgBjZWxsYm9yZGVyAGNvbHVtbnMAcm93cwBVbmtub3duIHZhbHVlICVzIGZvciBST1dTIC0gaWdub3JlZAoAVW5rbm93biB2YWx1ZSAlcyBmb3IgQ09MVU1OUyAtIGlnbm9yZWQKAENFTExTQk9SREVSADxIVE1MPgA8L0hUTUw+AC0tAExhYmVsIGNsb3NlZCBiZWZvcmUgZW5kIG9mIEhUTUwgZWxlbWVudAoAVW5jbG9zZWQgY29tbWVudAoAaiA9PSAwAGN2dC5jAFBvYnNwYXRoAHJvdXRlLmMAbGlicGF0aC8lczolZDogJXMKAHNob3J0ZXN0LmMAc291cmNlIHBvaW50IG5vdCBpbiBhbnkgdHJpYW5nbGUAZGVzdGluYXRpb24gcG9pbnQgbm90IGluIGFueSB0cmlhbmdsZQBjYW5ub3QgZmluZCB0cmlhbmdsZSBwYXRoAGNhbm5vdCBtYWxsb2Mgb3BzAGNhbm5vdCByZWFsbG9jIG9wcwB0cmlhbmd1bGF0aW9uIGZhaWxlZABjYW5ub3QgbWFsbG9jIHRyaXMAY2Fubm90IHJlYWxsb2MgdHJpcwBjYW5ub3QgbWFsbG9jIGRxLnBubHMAY2Fubm90IHJlYWxsb2MgZHEucG5scwBjYW5ub3QgbWFsbG9jIHBubHMAY2Fubm90IG1hbGxvYyBwbmxwcwBjYW5ub3QgcmVhbGxvYyBwbmxzAGNhbm5vdCByZWFsbG9jIHBubHBzAENEQVRBAElEAElEUkVGAElEUkVGUwBFTlRJVFkARU5USVRJRVMATk1UT0tFTgBOTVRPS0VOUwBOT1RBVElPTigAKAB8AGh0dHA6Ly93d3cudzMub3JnL1hNTC8xOTk4L25hbWVzcGFjZQBodHRwOi8vd3d3LnczLm9yZy8yMDAwL3htbG5zLwB4bWw9aHR0cDovL3d3dy53My5vcmcvWE1MLzE5OTgvbmFtZXNwYWNlAC9kZXYvdXJhbmRvbQBmYWxsYmFjayg0KQBnZXR0aW1lb2ZkYXlfcmVzID09IDAAeG1scGFyc2UuYwBnYXRoZXJfdGltZV9lbnRyb3B5AEVYUEFUX0VOVFJPUFlfREVCVUcAMQBFbnRyb3B5OiAlcyAtLT4gMHglMCpseCAoJWx1IGJ5dGVzKQoAaW52YWxpZCBhcmd1bWVudABwcmVmaXggbXVzdCBub3QgYmUgYm91bmQgdG8gb25lIG9mIHRoZSByZXNlcnZlZCBuYW1lc3BhY2UgbmFtZXMAcmVzZXJ2ZWQgcHJlZml4ICh4bWxucykgbXVzdCBub3QgYmUgZGVjbGFyZWQgb3IgdW5kZWNsYXJlZAByZXNlcnZlZCBwcmVmaXggKHhtbCkgbXVzdCBub3QgYmUgdW5kZWNsYXJlZCBvciBib3VuZCB0byBhbm90aGVyIG5hbWVzcGFjZSBuYW1lAGNhbm5vdCBzdXNwZW5kIGluIGV4dGVybmFsIHBhcmFtZXRlciBlbnRpdHkAcGFyc2luZyBmaW5pc2hlZABwYXJzaW5nIGFib3J0ZWQAcGFyc2VyIG5vdCBzdXNwZW5kZWQAcGFyc2VyIHN1c3BlbmRlZABpbGxlZ2FsIGNoYXJhY3RlcihzKSBpbiBwdWJsaWMgaWQAdGV4dCBkZWNsYXJhdGlvbiBub3Qgd2VsbC1mb3JtZWQAWE1MIGRlY2xhcmF0aW9uIG5vdCB3ZWxsLWZvcm1lZABpbmNvbXBsZXRlIG1hcmt1cCBpbiBwYXJhbWV0ZXIgZW50aXR5AG11c3Qgbm90IHVuZGVjbGFyZSBwcmVmaXgAdW5ib3VuZCBwcmVmaXgAY2Fubm90IGNoYW5nZSBzZXR0aW5nIG9uY2UgcGFyc2luZyBoYXMgYmVndW4AcmVxdWVzdGVkIGZlYXR1cmUgcmVxdWlyZXMgWE1MX0RURCBzdXBwb3J0IGluIEV4cGF0AGVudGl0eSBkZWNsYXJlZCBpbiBwYXJhbWV0ZXIgZW50aXR5AHVuZXhwZWN0ZWQgcGFyc2VyIHN0YXRlIC0gcGxlYXNlIHNlbmQgYSBidWcgcmVwb3J0AGRvY3VtZW50IGlzIG5vdCBzdGFuZGFsb25lAGVycm9yIGluIHByb2Nlc3NpbmcgZXh0ZXJuYWwgZW50aXR5IHJlZmVyZW5jZQB1bmNsb3NlZCBDREFUQSBzZWN0aW9uAGVuY29kaW5nIHNwZWNpZmllZCBpbiBYTUwgZGVjbGFyYXRpb24gaXMgaW5jb3JyZWN0AHVua25vd24gZW5jb2RpbmcAWE1MIG9yIHRleHQgZGVjbGFyYXRpb24gbm90IGF0IHN0YXJ0IG9mIGVudGl0eQByZWZlcmVuY2UgdG8gZXh0ZXJuYWwgZW50aXR5IGluIGF0dHJpYnV0ZQByZWZlcmVuY2UgdG8gYmluYXJ5IGVudGl0eQByZWZlcmVuY2UgdG8gaW52YWxpZCBjaGFyYWN0ZXIgbnVtYmVyAGFzeW5jaHJvbm91cyBlbnRpdHkAcmVjdXJzaXZlIGVudGl0eSByZWZlcmVuY2UAdW5kZWZpbmVkIGVudGl0eQBpbGxlZ2FsIHBhcmFtZXRlciBlbnRpdHkgcmVmZXJlbmNlAGp1bmsgYWZ0ZXIgZG9jdW1lbnQgZWxlbWVudABkdXBsaWNhdGUgYXR0cmlidXRlAG1pc21hdGNoZWQgdGFnAHBhcnRpYWwgY2hhcmFjdGVyAHVuY2xvc2VkIHRva2VuAG5vdCB3ZWxsLWZvcm1lZCAoaW52YWxpZCB0b2tlbikAbm8gZWxlbWVudCBmb3VuZABzeW50YXggZXJyb3IAb3V0IG9mIG1lbW9yeQACAwQFBgcIAAAJCgsMDQ4PEBEAAAAAAAAAAAAAAAASEwAUAAAAAAAAAAAAAAAAAAAVFgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEXAAAAAAAAAAAAAAAAAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBARgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAGQMaGxwdHgAAHyAhIiMkJRARAAAAAAAAAAAAAAAAEhMmFAAAAAAAAAAAAAAAAAAAJxYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBFwAAAAAAAAAAAAAAAAEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAENEQVRBW1VTLUFTQ0lJAFVURi0xNgBVVEYtMTZCRQBVVEYtMTZMRQB2ZXJzaW9uAGVuY29kaW5nAHN0YW5kYWxvbmUARE9DVFlQRQBTWVNURU0AUFVCTElDAEVOVElUWQBBVFRMSVNUAEVMRU1FTlQATk9UQVRJT04ASU5DTFVERQBJR05PUkUARU1QVFkAQU5ZAFBDREFUQQBJTVBMSUVEAFJFUVVJUkVEAEZJWEVEAENEQVRBAElEAElEUkVGAElEUkVGUwBFTlRJVElFUwBOTVRPS0VOAE5NVE9LRU5TAE5EQVRBAFQhIhkNAQIDEUscDBAECx0SHidobm9wcWIgBQYPExQVGggWBygkFxgJCg4bHyUjg4J9JiorPD0+P0NHSk1YWVpbXF1eX2BhY2RlZmdpamtscnN0eXp7fABJbGxlZ2FsIGJ5dGUgc2VxdWVuY2UARG9tYWluIGVycm9yAFJlc3VsdCBub3QgcmVwcmVzZW50YWJsZQBOb3QgYSB0dHkAUGVybWlzc2lvbiBkZW5pZWQAT3BlcmF0aW9uIG5vdCBwZXJtaXR0ZWQATm8gc3VjaCBmaWxlIG9yIGRpcmVjdG9yeQBObyBzdWNoIHByb2Nlc3MARmlsZSBleGlzdHMAVmFsdWUgdG9vIGxhcmdlIGZvciBkYXRhIHR5cGUATm8gc3BhY2UgbGVmdCBvbiBkZXZpY2UAT3V0IG9mIG1lbW9yeQBSZXNvdXJjZSBidXN5AEludGVycnVwdGVkIHN5c3RlbSBjYWxsAFJlc291cmNlIHRlbXBvcmFyaWx5IHVuYXZhaWxhYmxlAEludmFsaWQgc2VlawBDcm9zcy1kZXZpY2UgbGluawBSZWFkLW9ubHkgZmlsZSBzeXN0ZW0ARGlyZWN0b3J5IG5vdCBlbXB0eQBDb25uZWN0aW9uIHJlc2V0IGJ5IHBlZXIAT3BlcmF0aW9uIHRpbWVkIG91dABDb25uZWN0aW9uIHJlZnVzZWQASG9zdCBpcyBkb3duAEhvc3QgaXMgdW5yZWFjaGFibGUAQWRkcmVzcyBpbiB1c2UAQnJva2VuIHBpcGUASS9PIGVycm9yAE5vIHN1Y2ggZGV2aWNlIG9yIGFkZHJlc3MAQmxvY2sgZGV2aWNlIHJlcXVpcmVkAE5vIHN1Y2ggZGV2aWNlAE5vdCBhIGRpcmVjdG9yeQBJcyBhIGRpcmVjdG9yeQBUZXh0IGZpbGUgYnVzeQBFeGVjIGZvcm1hdCBlcnJvcgBJbnZhbGlkIGFyZ3VtZW50AEFyZ3VtZW50IGxpc3QgdG9vIGxvbmcAU3ltYm9saWMgbGluayBsb29wAEZpbGVuYW1lIHRvbyBsb25nAFRvbyBtYW55IG9wZW4gZmlsZXMgaW4gc3lzdGVtAE5vIGZpbGUgZGVzY3JpcHRvcnMgYXZhaWxhYmxlAEJhZCBmaWxlIGRlc2NyaXB0b3IATm8gY2hpbGQgcHJvY2VzcwBCYWQgYWRkcmVzcwBGaWxlIHRvbyBsYXJnZQBUb28gbWFueSBsaW5rcwBObyBsb2NrcyBhdmFpbGFibGUAUmVzb3VyY2UgZGVhZGxvY2sgd291bGQgb2NjdXIAU3RhdGUgbm90IHJlY292ZXJhYmxlAFByZXZpb3VzIG93bmVyIGRpZWQAT3BlcmF0aW9uIGNhbmNlbGVkAEZ1bmN0aW9uIG5vdCBpbXBsZW1lbnRlZABObyBtZXNzYWdlIG9mIGRlc2lyZWQgdHlwZQBJZGVudGlmaWVyIHJlbW92ZWQARGV2aWNlIG5vdCBhIHN0cmVhbQBObyBkYXRhIGF2YWlsYWJsZQBEZXZpY2UgdGltZW91dABPdXQgb2Ygc3RyZWFtcyByZXNvdXJjZXMATGluayBoYXMgYmVlbiBzZXZlcmVkAFByb3RvY29sIGVycm9yAEJhZCBtZXNzYWdlAEZpbGUgZGVzY3JpcHRvciBpbiBiYWQgc3RhdGUATm90IGEgc29ja2V0AERlc3RpbmF0aW9uIGFkZHJlc3MgcmVxdWlyZWQATWVzc2FnZSB0b28gbGFyZ2UAUHJvdG9jb2wgd3JvbmcgdHlwZSBmb3Igc29ja2V0AFByb3RvY29sIG5vdCBhdmFpbGFibGUAUHJvdG9jb2wgbm90IHN1cHBvcnRlZABTb2NrZXQgdHlwZSBub3Qgc3VwcG9ydGVkAE5vdCBzdXBwb3J0ZWQAUHJvdG9jb2wgZmFtaWx5IG5vdCBzdXBwb3J0ZWQAQWRkcmVzcyBmYW1pbHkgbm90IHN1cHBvcnRlZCBieSBwcm90b2NvbABBZGRyZXNzIG5vdCBhdmFpbGFibGUATmV0d29yayBpcyBkb3duAE5ldHdvcmsgdW5yZWFjaGFibGUAQ29ubmVjdGlvbiByZXNldCBieSBuZXR3b3JrAENvbm5lY3Rpb24gYWJvcnRlZABObyBidWZmZXIgc3BhY2UgYXZhaWxhYmxlAFNvY2tldCBpcyBjb25uZWN0ZWQAU29ja2V0IG5vdCBjb25uZWN0ZWQAQ2Fubm90IHNlbmQgYWZ0ZXIgc29ja2V0IHNodXRkb3duAE9wZXJhdGlvbiBhbHJlYWR5IGluIHByb2dyZXNzAE9wZXJhdGlvbiBpbiBwcm9ncmVzcwBTdGFsZSBmaWxlIGhhbmRsZQBSZW1vdGUgSS9PIGVycm9yAFF1b3RhIGV4Y2VlZGVkAE5vIG1lZGl1bSBmb3VuZABXcm9uZyBtZWRpdW0gdHlwZQBObyBlcnJvciBpbmZvcm1hdGlvbgAAEhATFBUWFxgZGhscHR4fICEQECIjECQlJicoKSorECwtLhEvMBERMRERETIzNDU2Nzg5ERAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBA6EBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBA7EDw9Pj9AQRAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBBCEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBBDEBBEEEVGRxBIEEkQEBAQSktMTRAQThBPUBAQEBBREBAQEBAQEBAQEBAQEFIQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEFMQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBBUVVZXEBBYWRAQEBAQEBAQEBAQEBAQEBAQEBAQEBBaEFtcXV5fYGFiEBAQEBAQEBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAP//////////////////////////////////////////AAAAAP7/APwBAAD4AQAAeAAAAAD/+9/7AACAAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA8APz/4K//////////////3///////IECwAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAPwDAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAPwAAAAAAIb+////AEBJAAAAAAAYAN//AMgAAAAAAAAAAQA8AAAAAAAAAAAAAAAAEOABHgBg/78AAAAAAAD/BwAAAAAAAAAAAAAAAAAAAAAAAAD4zwMAAAADACD/fwAAAE4AAAAAAAAAAAAAAAAAAAAAAPwAAAAAAAAAAAAQACAeADAAAQAAAAAAAAAAEAAgAAAAAPwPAAAAAAAAABAAIAAAAAAAAAAAAAAAAAAQACAAAAAAAwAAAAAAAAAAEAAgAAAAAP0AAAAAAAAAAAAAIAAAAAD/BwAAAAAAAAAAACAAAAAAAP8AAAAAAAAAEAAgAAAAAAAAAAAAAAAAAAAAIAAAAAA/AgAAAAAAAAAAAAQAAAAAEAAAAAAAAIAAgMDfAAwAAAAAAAAAAAAAAAAAHwAAAAAAAP7///8A/P//AAAAAAAAAAD8AAAAAAAAwP/f/wcAAAAAAAAAAAAAgAYA/AAAGD4AAIC/AMwAAAAAAAAAAAAAAAgAAAAAAAAAAAAAAGD///8fAAD/AwAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAGAAAAEAABgAAAAAAAAAAAA4AAAAABAAAABwAAAAAAAAAAAAAAAAAAAAMAAA/n8vAAD/A/9/AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA4xAAAAAAAAAAAAAAAAAAAAAAAAxP////8AAADAAAAAAAAAAAABAOCfAAAAAH8/AAAAAAAAAAAAAAAAAAAAABAAEAAA/P///x8AAAAAAAwAAAAAAABAAAzwAAAAAAAAwPgAAAAAAAAAwAAAAAAAAAAA/wD///8hEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD/////fwAA8AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAoAPgAOAA4ABggPj////8//////9/H/zxf/9/AAD///8DAAD/////AQB7A9DBr0IADB+8//8AAAAAAAL//////////////////////////////////////////////////////////w8A/////38AAAD/BwAA/////////////z8AAAAAAAD8///+/////////////////////////////////////////////////////x//AwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAOCHA/4AAAAAAAAAAAAAAAAAAAGAAAAAAAAAAAAAAAAAAAAAAP//////f/8PAAAAAAAAAAD////7/////////////w8A//////////////////////////////////8/AAAA/w8e////AfzB4AAAAAAAAAAAAAAAHgEAAAAAAAAAAAAACAAAAAAAAAAAAAAAAAAAAAAAAP//AAAAAP////8PAAAA////f////////////////////////////////////38AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD//////////wAAAAAAAAAAAAAAAAAAAAAAAP///////38AAAAAAADAAOAAAAAAAAAAAAAAAIAPcAAAAAAAAAAAAAAAAAAA/wD//38AAwAAAAAAAAAAAAAAAAYAAAAAAAAAAAAAAAAAAEQIAAAAD/8DAAAAAAAA8AAAAAAAAAAAABDAAAD//wMHAAAAAAD4AAAAAAiAAAAAAAAAAAAAAAgA/z8AwAAAAAAAAAAAAAAAAAAAAPAAAIALAAAAAAAAAIACAADAAABDAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAOAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAgAAAAAAAAAAAAAAAAAAAAD8/wMAAAAAAAAAAAAAAAAAAMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADD///8DfwD/////9/9/DwAAAAAAAAAAAAAAAAAAAAAAgP7/APwBAAD4AQAA+D8AAAAAAAAAAAAAAAAAAAB/fwAwh///////j/8AAAAAAADg//8H/w8AAAAAAAD//////z8AAAAADwAAAAAAAAAAAAAAAAAAgAAAAAAAAAEAAAAAAAAAAAAAAAAAAACA/wAAAAAAAAAAAAAAAAAAAAAAAAAAAADAjwAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAh/8A/wEAAADgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD+AAAA/wAAAP8AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA////fwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAMA//P8/AAAAAwAAAAAAAP4DAAAAAAAAAAAAAAAAABgADwAAAAAAAAAAAAAAAAAAAOEBAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA8AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAcAAAAAAAAAAAAAAAAA////////////////////////////////////////PwD/////f/7///////////////////////////8/AAAAAP//////////PwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA/////////////38A//8DAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAAIAAAACAAAIAAAACAAAIAAAACAAAAAAgAAAAIAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAwD//////w////////////////8PAP9//n/+//7/AAAAAP8H////f/////////8P//////8HAAAAAAAAAADA////BwD//////wf/AQMAAAAAAAAAAAAAAAAAAAAAAAAAAAD/////AQC///////////8f//8PAP/////fBwAA//8BAP////////9//f////////////////////////////8e/////////z8PAP///wAAAAAAAAAAAAAAAAAAAAAAAPj//////////+H/AAAAAAAA//////////8/AAAAAAAAAP//////////////////DwAAAAAAAAAAAAAAAAAAAAAA/////////////////////////////////////////////////////////////////wABAgMEBQYHCAn/////////CgsMDQ4PEBESExQVFhcYGRobHB0eHyAhIiP///////8KCwwNDg8QERITFBUWFxgZGhscHR4fICEiI/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////8AAQIEBwMGBQASERMUFRYXGBkaGxwdHh8gIREiIyQRJSYnKCkqKywRLS4vEBAwEBAQEBAQEDEyMxA0NRAQERERERERERERERERERERERERERERERERETYRERERERERERERERERERERERERERERERERERERERERERERERERERERERERERERERERERERERERERERERERERERERERERERERERERERERERERE3ERERETgROTo7PD0+ERERERERERERERERERERERERERERERERERERERERERERERERERERERERET8QEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBARQEERQkNERUZHSEkQEBBKS0xNThAQEE9QEBAQEFEQEBAQEBAQEBARERFSUxAQEBAQEBAQEBAQEREREVQQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAREVUQEBAQVhAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBBXEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBBYWVpbEBAQEBAQEBAQEBAQEBAQEBAQEBAQEFwQEBAQEBAQEBAQEBAQEBAQEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA//////////////////////////////////////////8AAAAAAAAAAP7//wf+//8HAAAAAAAEIAT//3////9//////////////////////////////////8P/AwAfUAAAAAAAAAAAAAAgAAAAAADfPEDX///7////////////v///////////////////////A/z/////////////////////////AP7///9/Av7/////AAAAAAD/v7YA////BwcAAAD/B//////////+/8P////////////////vH/7h/58AAP///////wDg////////////////AwD//////wcwBP////z/HwAA////AQAAAAAAAAAA/R8AAAAAAADwA/9//////////+//3+H/z//+/u6f+f///cXjn1mAsM//AwDuh/n///1tw4cZAl7A/z8A7r/7///97eO/GwEAz/8AAO6f+f///e3jnxnAsM//AgDsxz3WGMf/w8cdgQDA/wAA7t/9///97+PfHWADz/8AAOzf/f///e/j3x1gQM//BgDs3/3/////599dgADP/wD87P9//P//+y9/gF//AAAMAP7/////f/8HPyD/AwAAAACWJfD+ruz/O18g//MAAAAAAQAAAP8DAAD//v///x/+/wP///7///8fAAAAAAAAAAD///////9/+f8D///nwf//f0D/M/////+/IP//////9////////////z1/Pf//////Pf////89fz3/f/////////89//////////+HAAAAAP//AAD/////////////HwD+//////////////////////////////////////////////////////////+f///+//8H////////////xwEA/98PAP//DwD//w8A/98NAP///////8///wGAEP8DAAAAAP8D//////////////8A//////8H//////////8/AP///x//D/8BwP////8/HwD//////w////8D/wMAAAAA////D/////////9//v8fAP8D/wOAAAAAAAAAAAAAAAD////////v/+8P/wMAAAAA///////z////////v/8DAP///////z8A/+P//////z8AAAAAAAAAAAAAAAAA3m8A////////////////////////////////AAAAAAAAAAD//z8//////z8//6r///8/////////31/cH88P/x/cHwAAAAAAAAAAAAAAAAAAAoAAAP8fAAAAAAAAAAAAAAAAhPwvPlC9//PgQwAA//////8BAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAwP///////wMAAP//////f///////f/////////////////////8feAwA/////78g/////////4AAAP//fwB/f39/f39/f/////8AAAAAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAOAAAAD+Az4f/v///////////3/g/v/////////////34P////8//v////////////9/AAD///8HAAAAAAAA////////////////////////////////PwAAAAAAAAAAAP////////////////////////////////8fAAAAAAAA//////////////////////8fAAAAAAAAAAD//////z//H////w8AAP//////f/CP////gP////////////8AAAAAgP/8////////////////eQ8A/wcAAAAAAAAAAAD/u/f///8AAAD///////8PAP//////////DwD/AwAA/Aj//////wf/////BwD///8f////////9/8AgP8DAAAAAP///////38A/z//A///fwT/////////fwUAADj//zwAfn5+AH9/AAAAAAAAAAAAAAAAAAAAAAAA//////8H/wP//////////////////////////w8A//9/+P//////D/////////////////8//////////////////wMAAAAAfwD44P/9f1/b/////////////////wMAAAD4////////////////PwAA///////////8////////AAAAAAD/DwAAAAAAAAAAAAAAAAAA3/////////////////////8fAAD/A/7//wf+//8HwP////////////9//Pz8HAAAAAD/7///f///t/8//z8AAAAA////////////////////BwAAAAAAAAAA////////HwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAP///x////////8BAAAAAAD///9/AAD///8HAAAAAAAA////P/////8P/z4AAAAAAP////////////////////////8//wMAAAAAAAAAAAAAP/3/////v5H//z8AAAAAAAAAAAAAAAAAAAAAAAAAAAD//z8A////AwAAAAAAAAAA/////////8AAAAAAAAAAAG/w7/7//w8AAAAAAP///x8AAAAAAAAAAAAAAAAAAAAA////////PwD//z8A//8HAAAAAAAAAAAAAAAAAAAAAAD///////////8BAAAAAAAAAAAAAAAAAAAAAAAAAAAAAP//////////PwAAAMD/AAD8////////AQAA////Af8D////////x/8AAAAAAAAAAP//////////HgD/AwAAAAAAAAAAAAAAAAAAAAAAAAAA////////PwD/AwAAAAAAAP////////////////9/AAAAAAAAAAAAAAAAAAAAAAAA////////////////BwAAAAAAAAAAAAAAAAAAAAAAAAD//////38AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAP////////8BAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA//////////8fAP//////fwAA+P8AAAAAAAAAAAAAAAADAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAP/////////////f///////////fZN7/6+//////////v+ff3////3tf/P3//////////////////////////////////////////////////////z/////9///3////9///3////9///3////9//////f////3///fP////////7////5b+9wqE6paqlvf3Xv/7/w/u+/8PAAAAAAAAAABMQ19BTEwATENfQ1RZUEUAAAAATENfTlVNRVJJQwAATENfVElNRQAAAAAATENfQ09MTEFURQAATENfTU9ORVRBUlkATENfTUVTU0FHRVMATEFORwBDLlVURi04AFBPU0lYAE1VU0xfTE9DUEFUSAARAAoAERERAAAAAAUAAAAAAAAJAAAAAAsAAAAAAAAAABEADwoREREDCgcAARMJCwsAAAkGCwAACwAGEQAAABEREQAAAAAAAAAAAAAAAAAAAAALAAAAAAAAAAARAAoKERERAAoAAAIACQsAAAAJAAsAAAsAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADAAAAAAAAAAAAAAADAAAAAAMAAAAAAkMAAAAAAAMAAAMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA4AAAAAAAAAAAAAAA0AAAAEDQAAAAAJDgAAAAAADgAADgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAPAAAAAA8AAAAACRAAAAAAABAAABAAABIAAAASEhIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEgAAABISEgAAAAAAAAkAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsAAAAAAAAAAAAAAAoAAAAACgAAAAAJCwAAAAAACwAACwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAMAAAAAAAAAAAAAAAMAAAAAAwAAAAACQwAAAAAAAwAAAwAAC0rICAgMFgweAAobnVsbCkALTBYKzBYIDBYLTB4KzB4IDB4AGluZgBJTkYATkFOADAxMjM0NTY3ODlBQkNERUYuAGFsbnVtAGFscGhhAGJsYW5rAGNudHJsAGRpZ2l0AGdyYXBoAGxvd2VyAHByaW50AHB1bmN0AHNwYWNlAHVwcGVyAHhkaWdpdABDLlVURi04AAAAAAAAAAAAQwAvcHJvYy9zZWxmL2ZkLwByd2EAaW5maW5pdHkAbmFuAAkACgANAAwABwAbAFtbOmFsbnVtOl1fXQBbXls6YWxudW06XV9dAFtbOnNwYWNlOl1dAFteWzpzcGFjZTpdXQBbWzpkaWdpdDpdXQBbXls6ZGlnaXQ6XV0AL3RtcC90bXBmaWxlX1hYWFhYWAB3Kw==";
+          var tempDoublePtr = STATICTOP;
+          STATICTOP += 16;
+          function ___assert_fail(condition, filename, line, func) {
+            abort(
+              "Assertion failed: " +
+                Pointer_stringify(condition) +
+                ", at: " +
+                [
+                  filename ? Pointer_stringify(filename) : "unknown filename",
+                  line,
+                  func ? Pointer_stringify(func) : "unknown function",
+                ]
+            );
+          }
+          function _emscripten_get_now() {
+            abort();
+          }
+          function _emscripten_get_now_is_monotonic() {
+            return (
+              ENVIRONMENT_IS_NODE ||
+              typeof dateNow !== "undefined" ||
+              ((ENVIRONMENT_IS_WEB || ENVIRONMENT_IS_WORKER) && self["performance"] && self["performance"]["now"])
+            );
+          }
+          var ERRNO_CODES = {
+            EPERM: 1,
+            ENOENT: 2,
+            ESRCH: 3,
+            EINTR: 4,
+            EIO: 5,
+            ENXIO: 6,
+            E2BIG: 7,
+            ENOEXEC: 8,
+            EBADF: 9,
+            ECHILD: 10,
+            EAGAIN: 11,
+            EWOULDBLOCK: 11,
+            ENOMEM: 12,
+            EACCES: 13,
+            EFAULT: 14,
+            ENOTBLK: 15,
+            EBUSY: 16,
+            EEXIST: 17,
+            EXDEV: 18,
+            ENODEV: 19,
+            ENOTDIR: 20,
+            EISDIR: 21,
+            EINVAL: 22,
+            ENFILE: 23,
+            EMFILE: 24,
+            ENOTTY: 25,
+            ETXTBSY: 26,
+            EFBIG: 27,
+            ENOSPC: 28,
+            ESPIPE: 29,
+            EROFS: 30,
+            EMLINK: 31,
+            EPIPE: 32,
+            EDOM: 33,
+            ERANGE: 34,
+            ENOMSG: 42,
+            EIDRM: 43,
+            ECHRNG: 44,
+            EL2NSYNC: 45,
+            EL3HLT: 46,
+            EL3RST: 47,
+            ELNRNG: 48,
+            EUNATCH: 49,
+            ENOCSI: 50,
+            EL2HLT: 51,
+            EDEADLK: 35,
+            ENOLCK: 37,
+            EBADE: 52,
+            EBADR: 53,
+            EXFULL: 54,
+            ENOANO: 55,
+            EBADRQC: 56,
+            EBADSLT: 57,
+            EDEADLOCK: 35,
+            EBFONT: 59,
+            ENOSTR: 60,
+            ENODATA: 61,
+            ETIME: 62,
+            ENOSR: 63,
+            ENONET: 64,
+            ENOPKG: 65,
+            EREMOTE: 66,
+            ENOLINK: 67,
+            EADV: 68,
+            ESRMNT: 69,
+            ECOMM: 70,
+            EPROTO: 71,
+            EMULTIHOP: 72,
+            EDOTDOT: 73,
+            EBADMSG: 74,
+            ENOTUNIQ: 76,
+            EBADFD: 77,
+            EREMCHG: 78,
+            ELIBACC: 79,
+            ELIBBAD: 80,
+            ELIBSCN: 81,
+            ELIBMAX: 82,
+            ELIBEXEC: 83,
+            ENOSYS: 38,
+            ENOTEMPTY: 39,
+            ENAMETOOLONG: 36,
+            ELOOP: 40,
+            EOPNOTSUPP: 95,
+            EPFNOSUPPORT: 96,
+            ECONNRESET: 104,
+            ENOBUFS: 105,
+            EAFNOSUPPORT: 97,
+            EPROTOTYPE: 91,
+            ENOTSOCK: 88,
+            ENOPROTOOPT: 92,
+            ESHUTDOWN: 108,
+            ECONNREFUSED: 111,
+            EADDRINUSE: 98,
+            ECONNABORTED: 103,
+            ENETUNREACH: 101,
+            ENETDOWN: 100,
+            ETIMEDOUT: 110,
+            EHOSTDOWN: 112,
+            EHOSTUNREACH: 113,
+            EINPROGRESS: 115,
+            EALREADY: 114,
+            EDESTADDRREQ: 89,
+            EMSGSIZE: 90,
+            EPROTONOSUPPORT: 93,
+            ESOCKTNOSUPPORT: 94,
+            EADDRNOTAVAIL: 99,
+            ENETRESET: 102,
+            EISCONN: 106,
+            ENOTCONN: 107,
+            ETOOMANYREFS: 109,
+            EUSERS: 87,
+            EDQUOT: 122,
+            ESTALE: 116,
+            ENOTSUP: 95,
+            ENOMEDIUM: 123,
+            EILSEQ: 84,
+            EOVERFLOW: 75,
+            ECANCELED: 125,
+            ENOTRECOVERABLE: 131,
+            EOWNERDEAD: 130,
+            ESTRPIPE: 86,
+          };
+          function ___setErrNo(value) {
+            if (Module["___errno_location"]) HEAP32[Module["___errno_location"]() >> 2] = value;
+            return value;
+          }
+          function _clock_gettime(clk_id, tp) {
+            var now;
+            if (clk_id === 0) {
+              now = Date.now();
+            } else if (clk_id === 1 && _emscripten_get_now_is_monotonic()) {
+              now = _emscripten_get_now();
+            } else {
+              ___setErrNo(ERRNO_CODES.EINVAL);
+              return -1;
+            }
+            HEAP32[tp >> 2] = (now / 1e3) | 0;
+            HEAP32[(tp + 4) >> 2] = ((now % 1e3) * 1e3 * 1e3) | 0;
+            return 0;
+          }
+          function ___clock_gettime() {
+            return _clock_gettime.apply(null, arguments);
+          }
+          function ___lock() {}
+          function ___map_file(pathname, size) {
+            ___setErrNo(ERRNO_CODES.EPERM);
+            return -1;
+          }
+          var ERRNO_MESSAGES = {
+            0: "Success",
+            1: "Not super-user",
+            2: "No such file or directory",
+            3: "No such process",
+            4: "Interrupted system call",
+            5: "I/O error",
+            6: "No such device or address",
+            7: "Arg list too long",
+            8: "Exec format error",
+            9: "Bad file number",
+            10: "No children",
+            11: "No more processes",
+            12: "Not enough core",
+            13: "Permission denied",
+            14: "Bad address",
+            15: "Block device required",
+            16: "Mount device busy",
+            17: "File exists",
+            18: "Cross-device link",
+            19: "No such device",
+            20: "Not a directory",
+            21: "Is a directory",
+            22: "Invalid argument",
+            23: "Too many open files in system",
+            24: "Too many open files",
+            25: "Not a typewriter",
+            26: "Text file busy",
+            27: "File too large",
+            28: "No space left on device",
+            29: "Illegal seek",
+            30: "Read only file system",
+            31: "Too many links",
+            32: "Broken pipe",
+            33: "Math arg out of domain of func",
+            34: "Math result not representable",
+            35: "File locking deadlock error",
+            36: "File or path name too long",
+            37: "No record locks available",
+            38: "Function not implemented",
+            39: "Directory not empty",
+            40: "Too many symbolic links",
+            42: "No message of desired type",
+            43: "Identifier removed",
+            44: "Channel number out of range",
+            45: "Level 2 not synchronized",
+            46: "Level 3 halted",
+            47: "Level 3 reset",
+            48: "Link number out of range",
+            49: "Protocol driver not attached",
+            50: "No CSI structure available",
+            51: "Level 2 halted",
+            52: "Invalid exchange",
+            53: "Invalid request descriptor",
+            54: "Exchange full",
+            55: "No anode",
+            56: "Invalid request code",
+            57: "Invalid slot",
+            59: "Bad font file fmt",
+            60: "Device not a stream",
+            61: "No data (for no delay io)",
+            62: "Timer expired",
+            63: "Out of streams resources",
+            64: "Machine is not on the network",
+            65: "Package not installed",
+            66: "The object is remote",
+            67: "The link has been severed",
+            68: "Advertise error",
+            69: "Srmount error",
+            70: "Communication error on send",
+            71: "Protocol error",
+            72: "Multihop attempted",
+            73: "Cross mount point (not really error)",
+            74: "Trying to read unreadable message",
+            75: "Value too large for defined data type",
+            76: "Given log. name not unique",
+            77: "f.d. invalid for this operation",
+            78: "Remote address changed",
+            79: "Can   access a needed shared lib",
+            80: "Accessing a corrupted shared lib",
+            81: ".lib section in a.out corrupted",
+            82: "Attempting to link in too many libs",
+            83: "Attempting to exec a shared library",
+            84: "Illegal byte sequence",
+            86: "Streams pipe error",
+            87: "Too many users",
+            88: "Socket operation on non-socket",
+            89: "Destination address required",
+            90: "Message too long",
+            91: "Protocol wrong type for socket",
+            92: "Protocol not available",
+            93: "Unknown protocol",
+            94: "Socket type not supported",
+            95: "Not supported",
+            96: "Protocol family not supported",
+            97: "Address family not supported by protocol family",
+            98: "Address already in use",
+            99: "Address not available",
+            100: "Network interface is not configured",
+            101: "Network is unreachable",
+            102: "Connection reset by network",
+            103: "Connection aborted",
+            104: "Connection reset by peer",
+            105: "No buffer space available",
+            106: "Socket is already connected",
+            107: "Socket is not connected",
+            108: "Can't send after socket shutdown",
+            109: "Too many references",
+            110: "Connection timed out",
+            111: "Connection refused",
+            112: "Host is down",
+            113: "Host is unreachable",
+            114: "Socket already connected",
+            115: "Connection already in progress",
+            116: "Stale file handle",
+            122: "Quota exceeded",
+            123: "No medium (in tape drive)",
+            125: "Operation canceled",
+            130: "Previous owner died",
+            131: "State not recoverable",
+          };
+          var PATH = {
+            splitPath: function (filename) {
+              var splitPathRe = /^(\/?|)([\s\S]*?)((?:\.{1,2}|[^\/]+?|)(\.[^.\/]*|))(?:[\/]*)$/;
+              return splitPathRe.exec(filename).slice(1);
+            },
+            normalizeArray: function (parts, allowAboveRoot) {
+              var up = 0;
+              for (var i = parts.length - 1; i >= 0; i--) {
+                var last = parts[i];
+                if (last === ".") {
+                  parts.splice(i, 1);
+                } else if (last === "..") {
+                  parts.splice(i, 1);
+                  up++;
+                } else if (up) {
+                  parts.splice(i, 1);
+                  up--;
+                }
+              }
+              if (allowAboveRoot) {
+                for (; up; up--) {
+                  parts.unshift("..");
+                }
+              }
+              return parts;
+            },
+            normalize: function (path) {
+              var isAbsolute = path.charAt(0) === "/",
+                trailingSlash = path.substr(-1) === "/";
+              path = PATH.normalizeArray(
+                path.split("/").filter(function (p) {
+                  return !!p;
+                }),
+                !isAbsolute
+              ).join("/");
+              if (!path && !isAbsolute) {
+                path = ".";
+              }
+              if (path && trailingSlash) {
+                path += "/";
+              }
+              return (isAbsolute ? "/" : "") + path;
+            },
+            dirname: function (path) {
+              var result = PATH.splitPath(path),
+                root = result[0],
+                dir = result[1];
+              if (!root && !dir) {
+                return ".";
+              }
+              if (dir) {
+                dir = dir.substr(0, dir.length - 1);
+              }
+              return root + dir;
+            },
+            basename: function (path) {
+              if (path === "/") return "/";
+              var lastSlash = path.lastIndexOf("/");
+              if (lastSlash === -1) return path;
+              return path.substr(lastSlash + 1);
+            },
+            extname: function (path) {
+              return PATH.splitPath(path)[3];
+            },
+            join: function () {
+              var paths = Array.prototype.slice.call(arguments, 0);
+              return PATH.normalize(paths.join("/"));
+            },
+            join2: function (l, r) {
+              return PATH.normalize(l + "/" + r);
+            },
+            resolve: function () {
+              var resolvedPath = "",
+                resolvedAbsolute = false;
+              for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {
+                var path = i >= 0 ? arguments[i] : FS.cwd();
+                if (typeof path !== "string") {
+                  throw new TypeError("Arguments to path.resolve must be strings");
+                } else if (!path) {
+                  return "";
+                }
+                resolvedPath = path + "/" + resolvedPath;
+                resolvedAbsolute = path.charAt(0) === "/";
+              }
+              resolvedPath = PATH.normalizeArray(
+                resolvedPath.split("/").filter(function (p) {
+                  return !!p;
+                }),
+                !resolvedAbsolute
+              ).join("/");
+              return (resolvedAbsolute ? "/" : "") + resolvedPath || ".";
+            },
+            relative: function (from, to) {
+              from = PATH.resolve(from).substr(1);
+              to = PATH.resolve(to).substr(1);
+              function trim(arr) {
+                var start = 0;
+                for (; start < arr.length; start++) {
+                  if (arr[start] !== "") break;
+                }
+                var end = arr.length - 1;
+                for (; end >= 0; end--) {
+                  if (arr[end] !== "") break;
+                }
+                if (start > end) return [];
+                return arr.slice(start, end - start + 1);
+              }
+              var fromParts = trim(from.split("/"));
+              var toParts = trim(to.split("/"));
+              var length = Math.min(fromParts.length, toParts.length);
+              var samePartsLength = length;
+              for (var i = 0; i < length; i++) {
+                if (fromParts[i] !== toParts[i]) {
+                  samePartsLength = i;
+                  break;
+                }
+              }
+              var outputParts = [];
+              for (var i = samePartsLength; i < fromParts.length; i++) {
+                outputParts.push("..");
+              }
+              outputParts = outputParts.concat(toParts.slice(samePartsLength));
+              return outputParts.join("/");
+            },
+          };
+          var TTY = {
+            ttys: [],
+            init: function () {},
+            shutdown: function () {},
+            register: function (dev, ops) {
+              TTY.ttys[dev] = { input: [], output: [], ops: ops };
+              FS.registerDevice(dev, TTY.stream_ops);
+            },
+            stream_ops: {
+              open: function (stream) {
+                var tty = TTY.ttys[stream.node.rdev];
+                if (!tty) {
+                  throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+                }
+                stream.tty = tty;
+                stream.seekable = false;
+              },
+              close: function (stream) {
+                stream.tty.ops.flush(stream.tty);
+              },
+              flush: function (stream) {
+                stream.tty.ops.flush(stream.tty);
+              },
+              read: function (stream, buffer, offset, length, pos) {
+                if (!stream.tty || !stream.tty.ops.get_char) {
+                  throw new FS.ErrnoError(ERRNO_CODES.ENXIO);
+                }
+                var bytesRead = 0;
+                for (var i = 0; i < length; i++) {
+                  var result;
+                  try {
+                    result = stream.tty.ops.get_char(stream.tty);
+                  } catch (e) {
+                    throw new FS.ErrnoError(ERRNO_CODES.EIO);
+                  }
+                  if (result === undefined && bytesRead === 0) {
+                    throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+                  }
+                  if (result === null || result === undefined) break;
+                  bytesRead++;
+                  buffer[offset + i] = result;
+                }
+                if (bytesRead) {
+                  stream.node.timestamp = Date.now();
+                }
+                return bytesRead;
+              },
+              write: function (stream, buffer, offset, length, pos) {
+                if (!stream.tty || !stream.tty.ops.put_char) {
+                  throw new FS.ErrnoError(ERRNO_CODES.ENXIO);
+                }
+                for (var i = 0; i < length; i++) {
+                  try {
+                    stream.tty.ops.put_char(stream.tty, buffer[offset + i]);
+                  } catch (e) {
+                    throw new FS.ErrnoError(ERRNO_CODES.EIO);
+                  }
+                }
+                if (length) {
+                  stream.node.timestamp = Date.now();
+                }
+                return i;
+              },
+            },
+            default_tty_ops: {
+              get_char: function (tty) {
+                if (!tty.input.length) {
+                  var result = null;
+                  if (ENVIRONMENT_IS_NODE) {
+                    var BUFSIZE = 256;
+                    var buf = new Buffer(BUFSIZE);
+                    var bytesRead = 0;
+                    var isPosixPlatform = process.platform != "win32";
+                    var fd = process.stdin.fd;
+                    if (isPosixPlatform) {
+                      var usingDevice = false;
+                      try {
+                        fd = fs.openSync("/dev/stdin", "r");
+                        usingDevice = true;
+                      } catch (e) {}
+                    }
+                    try {
+                      bytesRead = fs.readSync(fd, buf, 0, BUFSIZE, null);
+                    } catch (e) {
+                      if (e.toString().indexOf("EOF") != -1) bytesRead = 0;
+                      else throw e;
+                    }
+                    if (usingDevice) {
+                      fs.closeSync(fd);
+                    }
+                    if (bytesRead > 0) {
+                      result = buf.slice(0, bytesRead).toString("utf-8");
+                    } else {
+                      result = null;
+                    }
+                  } else if (typeof window != "undefined" && typeof window.prompt == "function") {
+                    result = window.prompt("Input: ");
+                    if (result !== null) {
+                      result += "\n";
+                    }
+                  } else if (typeof readline == "function") {
+                    result = readline();
+                    if (result !== null) {
+                      result += "\n";
+                    }
+                  }
+                  if (!result) {
+                    return null;
+                  }
+                  tty.input = intArrayFromString(result, true);
+                }
+                return tty.input.shift();
+              },
+              put_char: function (tty, val) {
+                if (val === null || val === 10) {
+                  Module["print"](UTF8ArrayToString(tty.output, 0));
+                  tty.output = [];
+                } else {
+                  if (val != 0) tty.output.push(val);
+                }
+              },
+              flush: function (tty) {
+                if (tty.output && tty.output.length > 0) {
+                  Module["print"](UTF8ArrayToString(tty.output, 0));
+                  tty.output = [];
+                }
+              },
+            },
+            default_tty1_ops: {
+              put_char: function (tty, val) {
+                if (val === null || val === 10) {
+                  Module["printErr"](UTF8ArrayToString(tty.output, 0));
+                  tty.output = [];
+                } else {
+                  if (val != 0) tty.output.push(val);
+                }
+              },
+              flush: function (tty) {
+                if (tty.output && tty.output.length > 0) {
+                  Module["printErr"](UTF8ArrayToString(tty.output, 0));
+                  tty.output = [];
+                }
+              },
+            },
+          };
+          var MEMFS = {
+            ops_table: null,
+            mount: function (mount) {
+              return MEMFS.createNode(null, "/", 16384 | 511, 0);
+            },
+            createNode: function (parent, name, mode, dev) {
+              if (FS.isBlkdev(mode) || FS.isFIFO(mode)) {
+                throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+              }
+              if (!MEMFS.ops_table) {
+                MEMFS.ops_table = {
+                  dir: {
+                    node: {
+                      getattr: MEMFS.node_ops.getattr,
+                      setattr: MEMFS.node_ops.setattr,
+                      lookup: MEMFS.node_ops.lookup,
+                      mknod: MEMFS.node_ops.mknod,
+                      rename: MEMFS.node_ops.rename,
+                      unlink: MEMFS.node_ops.unlink,
+                      rmdir: MEMFS.node_ops.rmdir,
+                      readdir: MEMFS.node_ops.readdir,
+                      symlink: MEMFS.node_ops.symlink,
+                    },
+                    stream: { llseek: MEMFS.stream_ops.llseek },
+                  },
+                  file: {
+                    node: { getattr: MEMFS.node_ops.getattr, setattr: MEMFS.node_ops.setattr },
+                    stream: {
+                      llseek: MEMFS.stream_ops.llseek,
+                      read: MEMFS.stream_ops.read,
+                      write: MEMFS.stream_ops.write,
+                      allocate: MEMFS.stream_ops.allocate,
+                      mmap: MEMFS.stream_ops.mmap,
+                      msync: MEMFS.stream_ops.msync,
+                    },
+                  },
+                  link: {
+                    node: {
+                      getattr: MEMFS.node_ops.getattr,
+                      setattr: MEMFS.node_ops.setattr,
+                      readlink: MEMFS.node_ops.readlink,
+                    },
+                    stream: {},
+                  },
+                  chrdev: {
+                    node: { getattr: MEMFS.node_ops.getattr, setattr: MEMFS.node_ops.setattr },
+                    stream: FS.chrdev_stream_ops,
+                  },
+                };
+              }
+              var node = FS.createNode(parent, name, mode, dev);
+              if (FS.isDir(node.mode)) {
+                node.node_ops = MEMFS.ops_table.dir.node;
+                node.stream_ops = MEMFS.ops_table.dir.stream;
+                node.contents = {};
+              } else if (FS.isFile(node.mode)) {
+                node.node_ops = MEMFS.ops_table.file.node;
+                node.stream_ops = MEMFS.ops_table.file.stream;
+                node.usedBytes = 0;
+                node.contents = null;
+              } else if (FS.isLink(node.mode)) {
+                node.node_ops = MEMFS.ops_table.link.node;
+                node.stream_ops = MEMFS.ops_table.link.stream;
+              } else if (FS.isChrdev(node.mode)) {
+                node.node_ops = MEMFS.ops_table.chrdev.node;
+                node.stream_ops = MEMFS.ops_table.chrdev.stream;
+              }
+              node.timestamp = Date.now();
+              if (parent) {
+                parent.contents[name] = node;
+              }
+              return node;
+            },
+            getFileDataAsRegularArray: function (node) {
+              if (node.contents && node.contents.subarray) {
+                var arr = [];
+                for (var i = 0; i < node.usedBytes; ++i) arr.push(node.contents[i]);
+                return arr;
+              }
+              return node.contents;
+            },
+            getFileDataAsTypedArray: function (node) {
+              if (!node.contents) return new Uint8Array();
+              if (node.contents.subarray) return node.contents.subarray(0, node.usedBytes);
+              return new Uint8Array(node.contents);
+            },
+            expandFileStorage: function (node, newCapacity) {
+              if (node.contents && node.contents.subarray && newCapacity > node.contents.length) {
+                node.contents = MEMFS.getFileDataAsRegularArray(node);
+                node.usedBytes = node.contents.length;
+              }
+              if (!node.contents || node.contents.subarray) {
+                var prevCapacity = node.contents ? node.contents.length : 0;
+                if (prevCapacity >= newCapacity) return;
+                var CAPACITY_DOUBLING_MAX = 1024 * 1024;
+                newCapacity = Math.max(
+                  newCapacity,
+                  (prevCapacity * (prevCapacity < CAPACITY_DOUBLING_MAX ? 2 : 1.125)) | 0
+                );
+                if (prevCapacity != 0) newCapacity = Math.max(newCapacity, 256);
+                var oldContents = node.contents;
+                node.contents = new Uint8Array(newCapacity);
+                if (node.usedBytes > 0) node.contents.set(oldContents.subarray(0, node.usedBytes), 0);
+                return;
+              }
+              if (!node.contents && newCapacity > 0) node.contents = [];
+              while (node.contents.length < newCapacity) node.contents.push(0);
+            },
+            resizeFileStorage: function (node, newSize) {
+              if (node.usedBytes == newSize) return;
+              if (newSize == 0) {
+                node.contents = null;
+                node.usedBytes = 0;
+                return;
+              }
+              if (!node.contents || node.contents.subarray) {
+                var oldContents = node.contents;
+                node.contents = new Uint8Array(new ArrayBuffer(newSize));
+                if (oldContents) {
+                  node.contents.set(oldContents.subarray(0, Math.min(newSize, node.usedBytes)));
+                }
+                node.usedBytes = newSize;
+                return;
+              }
+              if (!node.contents) node.contents = [];
+              if (node.contents.length > newSize) node.contents.length = newSize;
+              else while (node.contents.length < newSize) node.contents.push(0);
+              node.usedBytes = newSize;
+            },
+            node_ops: {
+              getattr: function (node) {
+                var attr = {};
+                attr.dev = FS.isChrdev(node.mode) ? node.id : 1;
+                attr.ino = node.id;
+                attr.mode = node.mode;
+                attr.nlink = 1;
+                attr.uid = 0;
+                attr.gid = 0;
+                attr.rdev = node.rdev;
+                if (FS.isDir(node.mode)) {
+                  attr.size = 4096;
+                } else if (FS.isFile(node.mode)) {
+                  attr.size = node.usedBytes;
+                } else if (FS.isLink(node.mode)) {
+                  attr.size = node.link.length;
+                } else {
+                  attr.size = 0;
+                }
+                attr.atime = new Date(node.timestamp);
+                attr.mtime = new Date(node.timestamp);
+                attr.ctime = new Date(node.timestamp);
+                attr.blksize = 4096;
+                attr.blocks = Math.ceil(attr.size / attr.blksize);
+                return attr;
+              },
+              setattr: function (node, attr) {
+                if (attr.mode !== undefined) {
+                  node.mode = attr.mode;
+                }
+                if (attr.timestamp !== undefined) {
+                  node.timestamp = attr.timestamp;
+                }
+                if (attr.size !== undefined) {
+                  MEMFS.resizeFileStorage(node, attr.size);
+                }
+              },
+              lookup: function (parent, name) {
+                throw FS.genericErrors[ERRNO_CODES.ENOENT];
+              },
+              mknod: function (parent, name, mode, dev) {
+                return MEMFS.createNode(parent, name, mode, dev);
+              },
+              rename: function (old_node, new_dir, new_name) {
+                if (FS.isDir(old_node.mode)) {
+                  var new_node;
+                  try {
+                    new_node = FS.lookupNode(new_dir, new_name);
+                  } catch (e) {}
+                  if (new_node) {
+                    for (var i in new_node.contents) {
+                      throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+                    }
+                  }
+                }
+                delete old_node.parent.contents[old_node.name];
+                old_node.name = new_name;
+                new_dir.contents[new_name] = old_node;
+                old_node.parent = new_dir;
+              },
+              unlink: function (parent, name) {
+                delete parent.contents[name];
+              },
+              rmdir: function (parent, name) {
+                var node = FS.lookupNode(parent, name);
+                for (var i in node.contents) {
+                  throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+                }
+                delete parent.contents[name];
+              },
+              readdir: function (node) {
+                var entries = [".", ".."];
+                for (var key in node.contents) {
+                  if (!node.contents.hasOwnProperty(key)) {
+                    continue;
+                  }
+                  entries.push(key);
+                }
+                return entries;
+              },
+              symlink: function (parent, newname, oldpath) {
+                var node = MEMFS.createNode(parent, newname, 511 | 40960, 0);
+                node.link = oldpath;
+                return node;
+              },
+              readlink: function (node) {
+                if (!FS.isLink(node.mode)) {
+                  throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+                }
+                return node.link;
+              },
+            },
+            stream_ops: {
+              read: function (stream, buffer, offset, length, position) {
+                var contents = stream.node.contents;
+                if (position >= stream.node.usedBytes) return 0;
+                var size = Math.min(stream.node.usedBytes - position, length);
+                assert(size >= 0);
+                if (size > 8 && contents.subarray) {
+                  buffer.set(contents.subarray(position, position + size), offset);
+                } else {
+                  for (var i = 0; i < size; i++) buffer[offset + i] = contents[position + i];
+                }
+                return size;
+              },
+              write: function (stream, buffer, offset, length, position, canOwn) {
+                if (!length) return 0;
+                var node = stream.node;
+                node.timestamp = Date.now();
+                if (buffer.subarray && (!node.contents || node.contents.subarray)) {
+                  if (canOwn) {
+                    node.contents = buffer.subarray(offset, offset + length);
+                    node.usedBytes = length;
+                    return length;
+                  } else if (node.usedBytes === 0 && position === 0) {
+                    node.contents = new Uint8Array(buffer.subarray(offset, offset + length));
+                    node.usedBytes = length;
+                    return length;
+                  } else if (position + length <= node.usedBytes) {
+                    node.contents.set(buffer.subarray(offset, offset + length), position);
+                    return length;
+                  }
+                }
+                MEMFS.expandFileStorage(node, position + length);
+                if (node.contents.subarray && buffer.subarray)
+                  node.contents.set(buffer.subarray(offset, offset + length), position);
+                else {
+                  for (var i = 0; i < length; i++) {
+                    node.contents[position + i] = buffer[offset + i];
+                  }
+                }
+                node.usedBytes = Math.max(node.usedBytes, position + length);
+                return length;
+              },
+              llseek: function (stream, offset, whence) {
+                var position = offset;
+                if (whence === 1) {
+                  position += stream.position;
+                } else if (whence === 2) {
+                  if (FS.isFile(stream.node.mode)) {
+                    position += stream.node.usedBytes;
+                  }
+                }
+                if (position < 0) {
+                  throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+                }
+                return position;
+              },
+              allocate: function (stream, offset, length) {
+                MEMFS.expandFileStorage(stream.node, offset + length);
+                stream.node.usedBytes = Math.max(stream.node.usedBytes, offset + length);
+              },
+              mmap: function (stream, buffer, offset, length, position, prot, flags) {
+                if (!FS.isFile(stream.node.mode)) {
+                  throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+                }
+                var ptr;
+                var allocated;
+                var contents = stream.node.contents;
+                if (!(flags & 2) && (contents.buffer === buffer || contents.buffer === buffer.buffer)) {
+                  allocated = false;
+                  ptr = contents.byteOffset;
+                } else {
+                  if (position > 0 || position + length < stream.node.usedBytes) {
+                    if (contents.subarray) {
+                      contents = contents.subarray(position, position + length);
+                    } else {
+                      contents = Array.prototype.slice.call(contents, position, position + length);
+                    }
+                  }
+                  allocated = true;
+                  ptr = _malloc(length);
+                  if (!ptr) {
+                    throw new FS.ErrnoError(ERRNO_CODES.ENOMEM);
+                  }
+                  buffer.set(contents, ptr);
+                }
+                return { ptr: ptr, allocated: allocated };
+              },
+              msync: function (stream, buffer, offset, length, mmapFlags) {
+                if (!FS.isFile(stream.node.mode)) {
+                  throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+                }
+                if (mmapFlags & 2) {
+                  return 0;
+                }
+                var bytesWritten = MEMFS.stream_ops.write(stream, buffer, 0, length, offset, false);
+                return 0;
+              },
+            },
+          };
+          var IDBFS = {
+            dbs: {},
+            indexedDB: function () {
+              if (typeof indexedDB !== "undefined") return indexedDB;
+              var ret = null;
+              if (typeof window === "object")
+                ret = window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
+              assert(ret, "IDBFS used, but indexedDB not supported");
+              return ret;
+            },
+            DB_VERSION: 21,
+            DB_STORE_NAME: "FILE_DATA",
+            mount: function (mount) {
+              return MEMFS.mount.apply(null, arguments);
+            },
+            syncfs: function (mount, populate, callback) {
+              IDBFS.getLocalSet(mount, function (err, local) {
+                if (err) return callback(err);
+                IDBFS.getRemoteSet(mount, function (err, remote) {
+                  if (err) return callback(err);
+                  var src = populate ? remote : local;
+                  var dst = populate ? local : remote;
+                  IDBFS.reconcile(src, dst, callback);
+                });
+              });
+            },
+            getDB: function (name, callback) {
+              var db = IDBFS.dbs[name];
+              if (db) {
+                return callback(null, db);
+              }
+              var req;
+              try {
+                req = IDBFS.indexedDB().open(name, IDBFS.DB_VERSION);
+              } catch (e) {
+                return callback(e);
+              }
+              if (!req) {
+                return callback("Unable to connect to IndexedDB");
+              }
+              req.onupgradeneeded = function (e) {
+                var db = e.target.result;
+                var transaction = e.target.transaction;
+                var fileStore;
+                if (db.objectStoreNames.contains(IDBFS.DB_STORE_NAME)) {
+                  fileStore = transaction.objectStore(IDBFS.DB_STORE_NAME);
+                } else {
+                  fileStore = db.createObjectStore(IDBFS.DB_STORE_NAME);
+                }
+                if (!fileStore.indexNames.contains("timestamp")) {
+                  fileStore.createIndex("timestamp", "timestamp", { unique: false });
+                }
+              };
+              req.onsuccess = function () {
+                db = req.result;
+                IDBFS.dbs[name] = db;
+                callback(null, db);
+              };
+              req.onerror = function (e) {
+                callback(this.error);
+                e.preventDefault();
+              };
+            },
+            getLocalSet: function (mount, callback) {
+              var entries = {};
+              function isRealDir(p) {
+                return p !== "." && p !== "..";
+              }
+              function toAbsolute(root) {
+                return function (p) {
+                  return PATH.join2(root, p);
+                };
+              }
+              var check = FS.readdir(mount.mountpoint).filter(isRealDir).map(toAbsolute(mount.mountpoint));
+              while (check.length) {
+                var path = check.pop();
+                var stat;
+                try {
+                  stat = FS.stat(path);
+                } catch (e) {
+                  return callback(e);
+                }
+                if (FS.isDir(stat.mode)) {
+                  check.push.apply(check, FS.readdir(path).filter(isRealDir).map(toAbsolute(path)));
+                }
+                entries[path] = { timestamp: stat.mtime };
+              }
+              return callback(null, { type: "local", entries: entries });
+            },
+            getRemoteSet: function (mount, callback) {
+              var entries = {};
+              IDBFS.getDB(mount.mountpoint, function (err, db) {
+                if (err) return callback(err);
+                try {
+                  var transaction = db.transaction([IDBFS.DB_STORE_NAME], "readonly");
+                  transaction.onerror = function (e) {
+                    callback(this.error);
+                    e.preventDefault();
+                  };
+                  var store = transaction.objectStore(IDBFS.DB_STORE_NAME);
+                  var index = store.index("timestamp");
+                  index.openKeyCursor().onsuccess = function (event) {
+                    var cursor = event.target.result;
+                    if (!cursor) {
+                      return callback(null, { type: "remote", db: db, entries: entries });
+                    }
+                    entries[cursor.primaryKey] = { timestamp: cursor.key };
+                    cursor.continue();
+                  };
+                } catch (e) {
+                  return callback(e);
+                }
+              });
+            },
+            loadLocalEntry: function (path, callback) {
+              var stat, node;
+              try {
+                var lookup = FS.lookupPath(path);
+                node = lookup.node;
+                stat = FS.stat(path);
+              } catch (e) {
+                return callback(e);
+              }
+              if (FS.isDir(stat.mode)) {
+                return callback(null, { timestamp: stat.mtime, mode: stat.mode });
+              } else if (FS.isFile(stat.mode)) {
+                node.contents = MEMFS.getFileDataAsTypedArray(node);
+                return callback(null, { timestamp: stat.mtime, mode: stat.mode, contents: node.contents });
+              } else {
+                return callback(new Error("node type not supported"));
+              }
+            },
+            storeLocalEntry: function (path, entry, callback) {
+              try {
+                if (FS.isDir(entry.mode)) {
+                  FS.mkdir(path, entry.mode);
+                } else if (FS.isFile(entry.mode)) {
+                  FS.writeFile(path, entry.contents, { canOwn: true });
+                } else {
+                  return callback(new Error("node type not supported"));
+                }
+                FS.chmod(path, entry.mode);
+                FS.utime(path, entry.timestamp, entry.timestamp);
+              } catch (e) {
+                return callback(e);
+              }
+              callback(null);
+            },
+            removeLocalEntry: function (path, callback) {
+              try {
+                var lookup = FS.lookupPath(path);
+                var stat = FS.stat(path);
+                if (FS.isDir(stat.mode)) {
+                  FS.rmdir(path);
+                } else if (FS.isFile(stat.mode)) {
+                  FS.unlink(path);
+                }
+              } catch (e) {
+                return callback(e);
+              }
+              callback(null);
+            },
+            loadRemoteEntry: function (store, path, callback) {
+              var req = store.get(path);
+              req.onsuccess = function (event) {
+                callback(null, event.target.result);
+              };
+              req.onerror = function (e) {
+                callback(this.error);
+                e.preventDefault();
+              };
+            },
+            storeRemoteEntry: function (store, path, entry, callback) {
+              var req = store.put(entry, path);
+              req.onsuccess = function () {
+                callback(null);
+              };
+              req.onerror = function (e) {
+                callback(this.error);
+                e.preventDefault();
+              };
+            },
+            removeRemoteEntry: function (store, path, callback) {
+              var req = store.delete(path);
+              req.onsuccess = function () {
+                callback(null);
+              };
+              req.onerror = function (e) {
+                callback(this.error);
+                e.preventDefault();
+              };
+            },
+            reconcile: function (src, dst, callback) {
+              var total = 0;
+              var create = [];
+              Object.keys(src.entries).forEach(function (key) {
+                var e = src.entries[key];
+                var e2 = dst.entries[key];
+                if (!e2 || e.timestamp > e2.timestamp) {
+                  create.push(key);
+                  total++;
+                }
+              });
+              var remove = [];
+              Object.keys(dst.entries).forEach(function (key) {
+                var e = dst.entries[key];
+                var e2 = src.entries[key];
+                if (!e2) {
+                  remove.push(key);
+                  total++;
+                }
+              });
+              if (!total) {
+                return callback(null);
+              }
+              var completed = 0;
+              var db = src.type === "remote" ? src.db : dst.db;
+              var transaction = db.transaction([IDBFS.DB_STORE_NAME], "readwrite");
+              var store = transaction.objectStore(IDBFS.DB_STORE_NAME);
+              function done(err) {
+                if (err) {
+                  if (!done.errored) {
+                    done.errored = true;
+                    return callback(err);
+                  }
+                  return;
+                }
+                if (++completed >= total) {
+                  return callback(null);
+                }
+              }
+              transaction.onerror = function (e) {
+                done(this.error);
+                e.preventDefault();
+              };
+              create.sort().forEach(function (path) {
+                if (dst.type === "local") {
+                  IDBFS.loadRemoteEntry(store, path, function (err, entry) {
+                    if (err) return done(err);
+                    IDBFS.storeLocalEntry(path, entry, done);
+                  });
+                } else {
+                  IDBFS.loadLocalEntry(path, function (err, entry) {
+                    if (err) return done(err);
+                    IDBFS.storeRemoteEntry(store, path, entry, done);
+                  });
+                }
+              });
+              remove
+                .sort()
+                .reverse()
+                .forEach(function (path) {
+                  if (dst.type === "local") {
+                    IDBFS.removeLocalEntry(path, done);
+                  } else {
+                    IDBFS.removeRemoteEntry(store, path, done);
+                  }
+                });
+            },
+          };
+          var NODEFS = {
+            isWindows: false,
+            staticInit: function () {
+              NODEFS.isWindows = !!process.platform.match(/^win/);
+              var flags = process["binding"]("constants");
+              if (flags["fs"]) {
+                flags = flags["fs"];
+              }
+              NODEFS.flagsForNodeMap = {
+                1024: flags["O_APPEND"],
+                64: flags["O_CREAT"],
+                128: flags["O_EXCL"],
+                0: flags["O_RDONLY"],
+                2: flags["O_RDWR"],
+                4096: flags["O_SYNC"],
+                512: flags["O_TRUNC"],
+                1: flags["O_WRONLY"],
+              };
+            },
+            bufferFrom: function (arrayBuffer) {
+              return Buffer.alloc ? Buffer.from(arrayBuffer) : new Buffer(arrayBuffer);
+            },
+            mount: function (mount) {
+              assert(ENVIRONMENT_IS_NODE);
+              return NODEFS.createNode(null, "/", NODEFS.getMode(mount.opts.root), 0);
+            },
+            createNode: function (parent, name, mode, dev) {
+              if (!FS.isDir(mode) && !FS.isFile(mode) && !FS.isLink(mode)) {
+                throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+              }
+              var node = FS.createNode(parent, name, mode);
+              node.node_ops = NODEFS.node_ops;
+              node.stream_ops = NODEFS.stream_ops;
+              return node;
+            },
+            getMode: function (path) {
+              var stat;
+              try {
+                stat = fs.lstatSync(path);
+                if (NODEFS.isWindows) {
+                  stat.mode = stat.mode | ((stat.mode & 292) >> 2);
+                }
+              } catch (e) {
+                if (!e.code) throw e;
+                throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+              }
+              return stat.mode;
+            },
+            realPath: function (node) {
+              var parts = [];
+              while (node.parent !== node) {
+                parts.push(node.name);
+                node = node.parent;
+              }
+              parts.push(node.mount.opts.root);
+              parts.reverse();
+              return PATH.join.apply(null, parts);
+            },
+            flagsForNode: function (flags) {
+              flags &= ~2097152;
+              flags &= ~2048;
+              flags &= ~32768;
+              flags &= ~524288;
+              var newFlags = 0;
+              for (var k in NODEFS.flagsForNodeMap) {
+                if (flags & k) {
+                  newFlags |= NODEFS.flagsForNodeMap[k];
+                  flags ^= k;
+                }
+              }
+              if (!flags) {
+                return newFlags;
+              } else {
+                throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+              }
+            },
+            node_ops: {
+              getattr: function (node) {
+                var path = NODEFS.realPath(node);
+                var stat;
+                try {
+                  stat = fs.lstatSync(path);
+                } catch (e) {
+                  if (!e.code) throw e;
+                  throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+                }
+                if (NODEFS.isWindows && !stat.blksize) {
+                  stat.blksize = 4096;
+                }
+                if (NODEFS.isWindows && !stat.blocks) {
+                  stat.blocks = ((stat.size + stat.blksize - 1) / stat.blksize) | 0;
+                }
+                return {
+                  dev: stat.dev,
+                  ino: stat.ino,
+                  mode: stat.mode,
+                  nlink: stat.nlink,
+                  uid: stat.uid,
+                  gid: stat.gid,
+                  rdev: stat.rdev,
+                  size: stat.size,
+                  atime: stat.atime,
+                  mtime: stat.mtime,
+                  ctime: stat.ctime,
+                  blksize: stat.blksize,
+                  blocks: stat.blocks,
+                };
+              },
+              setattr: function (node, attr) {
+                var path = NODEFS.realPath(node);
+                try {
+                  if (attr.mode !== undefined) {
+                    fs.chmodSync(path, attr.mode);
+                    node.mode = attr.mode;
+                  }
+                  if (attr.timestamp !== undefined) {
+                    var date = new Date(attr.timestamp);
+                    fs.utimesSync(path, date, date);
+                  }
+                  if (attr.size !== undefined) {
+                    fs.truncateSync(path, attr.size);
+                  }
+                } catch (e) {
+                  if (!e.code) throw e;
+                  throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+                }
+              },
+              lookup: function (parent, name) {
+                var path = PATH.join2(NODEFS.realPath(parent), name);
+                var mode = NODEFS.getMode(path);
+                return NODEFS.createNode(parent, name, mode);
+              },
+              mknod: function (parent, name, mode, dev) {
+                var node = NODEFS.createNode(parent, name, mode, dev);
+                var path = NODEFS.realPath(node);
+                try {
+                  if (FS.isDir(node.mode)) {
+                    fs.mkdirSync(path, node.mode);
+                  } else {
+                    fs.writeFileSync(path, "", { mode: node.mode });
+                  }
+                } catch (e) {
+                  if (!e.code) throw e;
+                  throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+                }
+                return node;
+              },
+              rename: function (oldNode, newDir, newName) {
+                var oldPath = NODEFS.realPath(oldNode);
+                var newPath = PATH.join2(NODEFS.realPath(newDir), newName);
+                try {
+                  fs.renameSync(oldPath, newPath);
+                } catch (e) {
+                  if (!e.code) throw e;
+                  throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+                }
+              },
+              unlink: function (parent, name) {
+                var path = PATH.join2(NODEFS.realPath(parent), name);
+                try {
+                  fs.unlinkSync(path);
+                } catch (e) {
+                  if (!e.code) throw e;
+                  throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+                }
+              },
+              rmdir: function (parent, name) {
+                var path = PATH.join2(NODEFS.realPath(parent), name);
+                try {
+                  fs.rmdirSync(path);
+                } catch (e) {
+                  if (!e.code) throw e;
+                  throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+                }
+              },
+              readdir: function (node) {
+                var path = NODEFS.realPath(node);
+                try {
+                  return fs.readdirSync(path);
+                } catch (e) {
+                  if (!e.code) throw e;
+                  throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+                }
+              },
+              symlink: function (parent, newName, oldPath) {
+                var newPath = PATH.join2(NODEFS.realPath(parent), newName);
+                try {
+                  fs.symlinkSync(oldPath, newPath);
+                } catch (e) {
+                  if (!e.code) throw e;
+                  throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+                }
+              },
+              readlink: function (node) {
+                var path = NODEFS.realPath(node);
+                try {
+                  path = fs.readlinkSync(path);
+                  path = NODEJS_PATH.relative(NODEJS_PATH.resolve(node.mount.opts.root), path);
+                  return path;
+                } catch (e) {
+                  if (!e.code) throw e;
+                  throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+                }
+              },
+            },
+            stream_ops: {
+              open: function (stream) {
+                var path = NODEFS.realPath(stream.node);
+                try {
+                  if (FS.isFile(stream.node.mode)) {
+                    stream.nfd = fs.openSync(path, NODEFS.flagsForNode(stream.flags));
+                  }
+                } catch (e) {
+                  if (!e.code) throw e;
+                  throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+                }
+              },
+              close: function (stream) {
+                try {
+                  if (FS.isFile(stream.node.mode) && stream.nfd) {
+                    fs.closeSync(stream.nfd);
+                  }
+                } catch (e) {
+                  if (!e.code) throw e;
+                  throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+                }
+              },
+              read: function (stream, buffer, offset, length, position) {
+                if (length === 0) return 0;
+                try {
+                  return fs.readSync(stream.nfd, NODEFS.bufferFrom(buffer.buffer), offset, length, position);
+                } catch (e) {
+                  throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+                }
+              },
+              write: function (stream, buffer, offset, length, position) {
+                try {
+                  return fs.writeSync(stream.nfd, NODEFS.bufferFrom(buffer.buffer), offset, length, position);
+                } catch (e) {
+                  throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+                }
+              },
+              llseek: function (stream, offset, whence) {
+                var position = offset;
+                if (whence === 1) {
+                  position += stream.position;
+                } else if (whence === 2) {
+                  if (FS.isFile(stream.node.mode)) {
+                    try {
+                      var stat = fs.fstatSync(stream.nfd);
+                      position += stat.size;
+                    } catch (e) {
+                      throw new FS.ErrnoError(ERRNO_CODES[e.code]);
+                    }
+                  }
+                }
+                if (position < 0) {
+                  throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+                }
+                return position;
+              },
+            },
+          };
+          var WORKERFS = {
+            DIR_MODE: 16895,
+            FILE_MODE: 33279,
+            reader: null,
+            mount: function (mount) {
+              assert(ENVIRONMENT_IS_WORKER);
+              if (!WORKERFS.reader) WORKERFS.reader = new FileReaderSync();
+              var root = WORKERFS.createNode(null, "/", WORKERFS.DIR_MODE, 0);
+              var createdParents = {};
+              function ensureParent(path) {
+                var parts = path.split("/");
+                var parent = root;
+                for (var i = 0; i < parts.length - 1; i++) {
+                  var curr = parts.slice(0, i + 1).join("/");
+                  if (!createdParents[curr]) {
+                    createdParents[curr] = WORKERFS.createNode(parent, parts[i], WORKERFS.DIR_MODE, 0);
+                  }
+                  parent = createdParents[curr];
+                }
+                return parent;
+              }
+              function base(path) {
+                var parts = path.split("/");
+                return parts[parts.length - 1];
+              }
+              Array.prototype.forEach.call(mount.opts["files"] || [], function (file) {
+                WORKERFS.createNode(
+                  ensureParent(file.name),
+                  base(file.name),
+                  WORKERFS.FILE_MODE,
+                  0,
+                  file,
+                  file.lastModifiedDate
+                );
+              });
+              (mount.opts["blobs"] || []).forEach(function (obj) {
+                WORKERFS.createNode(ensureParent(obj["name"]), base(obj["name"]), WORKERFS.FILE_MODE, 0, obj["data"]);
+              });
+              (mount.opts["packages"] || []).forEach(function (pack) {
+                pack["metadata"].files.forEach(function (file) {
+                  var name = file.filename.substr(1);
+                  WORKERFS.createNode(
+                    ensureParent(name),
+                    base(name),
+                    WORKERFS.FILE_MODE,
+                    0,
+                    pack["blob"].slice(file.start, file.end)
+                  );
+                });
+              });
+              return root;
+            },
+            createNode: function (parent, name, mode, dev, contents, mtime) {
+              var node = FS.createNode(parent, name, mode);
+              node.mode = mode;
+              node.node_ops = WORKERFS.node_ops;
+              node.stream_ops = WORKERFS.stream_ops;
+              node.timestamp = (mtime || new Date()).getTime();
+              assert(WORKERFS.FILE_MODE !== WORKERFS.DIR_MODE);
+              if (mode === WORKERFS.FILE_MODE) {
+                node.size = contents.size;
+                node.contents = contents;
+              } else {
+                node.size = 4096;
+                node.contents = {};
+              }
+              if (parent) {
+                parent.contents[name] = node;
+              }
+              return node;
+            },
+            node_ops: {
+              getattr: function (node) {
+                return {
+                  dev: 1,
+                  ino: undefined,
+                  mode: node.mode,
+                  nlink: 1,
+                  uid: 0,
+                  gid: 0,
+                  rdev: undefined,
+                  size: node.size,
+                  atime: new Date(node.timestamp),
+                  mtime: new Date(node.timestamp),
+                  ctime: new Date(node.timestamp),
+                  blksize: 4096,
+                  blocks: Math.ceil(node.size / 4096),
+                };
+              },
+              setattr: function (node, attr) {
+                if (attr.mode !== undefined) {
+                  node.mode = attr.mode;
+                }
+                if (attr.timestamp !== undefined) {
+                  node.timestamp = attr.timestamp;
+                }
+              },
+              lookup: function (parent, name) {
+                throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
+              },
+              mknod: function (parent, name, mode, dev) {
+                throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+              },
+              rename: function (oldNode, newDir, newName) {
+                throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+              },
+              unlink: function (parent, name) {
+                throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+              },
+              rmdir: function (parent, name) {
+                throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+              },
+              readdir: function (node) {
+                var entries = [".", ".."];
+                for (var key in node.contents) {
+                  if (!node.contents.hasOwnProperty(key)) {
+                    continue;
+                  }
+                  entries.push(key);
+                }
+                return entries;
+              },
+              symlink: function (parent, newName, oldPath) {
+                throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+              },
+              readlink: function (node) {
+                throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+              },
+            },
+            stream_ops: {
+              read: function (stream, buffer, offset, length, position) {
+                if (position >= stream.node.size) return 0;
+                var chunk = stream.node.contents.slice(position, position + length);
+                var ab = WORKERFS.reader.readAsArrayBuffer(chunk);
+                buffer.set(new Uint8Array(ab), offset);
+                return chunk.size;
+              },
+              write: function (stream, buffer, offset, length, position) {
+                throw new FS.ErrnoError(ERRNO_CODES.EIO);
+              },
+              llseek: function (stream, offset, whence) {
+                var position = offset;
+                if (whence === 1) {
+                  position += stream.position;
+                } else if (whence === 2) {
+                  if (FS.isFile(stream.node.mode)) {
+                    position += stream.node.size;
+                  }
+                }
+                if (position < 0) {
+                  throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+                }
+                return position;
+              },
+            },
+          };
+          STATICTOP += 16;
+          STATICTOP += 16;
+          STATICTOP += 16;
+          var FS = {
+            root: null,
+            mounts: [],
+            devices: {},
+            streams: [],
+            nextInode: 1,
+            nameTable: null,
+            currentPath: "/",
+            initialized: false,
+            ignorePermissions: true,
+            trackingDelegate: {},
+            tracking: { openFlags: { READ: 1, WRITE: 2 } },
+            ErrnoError: null,
+            genericErrors: {},
+            filesystems: null,
+            syncFSRequests: 0,
+            handleFSError: function (e) {
+              if (!(e instanceof FS.ErrnoError)) throw e + " : " + stackTrace();
+              return ___setErrNo(e.errno);
+            },
+            lookupPath: function (path, opts) {
+              path = PATH.resolve(FS.cwd(), path);
+              opts = opts || {};
+              if (!path) return { path: "", node: null };
+              var defaults = { follow_mount: true, recurse_count: 0 };
+              for (var key in defaults) {
+                if (opts[key] === undefined) {
+                  opts[key] = defaults[key];
+                }
+              }
+              if (opts.recurse_count > 8) {
+                throw new FS.ErrnoError(ERRNO_CODES.ELOOP);
+              }
+              var parts = PATH.normalizeArray(
+                path.split("/").filter(function (p) {
+                  return !!p;
+                }),
+                false
+              );
+              var current = FS.root;
+              var current_path = "/";
+              for (var i = 0; i < parts.length; i++) {
+                var islast = i === parts.length - 1;
+                if (islast && opts.parent) {
+                  break;
+                }
+                current = FS.lookupNode(current, parts[i]);
+                current_path = PATH.join2(current_path, parts[i]);
+                if (FS.isMountpoint(current)) {
+                  if (!islast || (islast && opts.follow_mount)) {
+                    current = current.mounted.root;
+                  }
+                }
+                if (!islast || opts.follow) {
+                  var count = 0;
+                  while (FS.isLink(current.mode)) {
+                    var link = FS.readlink(current_path);
+                    current_path = PATH.resolve(PATH.dirname(current_path), link);
+                    var lookup = FS.lookupPath(current_path, { recurse_count: opts.recurse_count });
+                    current = lookup.node;
+                    if (count++ > 40) {
+                      throw new FS.ErrnoError(ERRNO_CODES.ELOOP);
+                    }
+                  }
+                }
+              }
+              return { path: current_path, node: current };
+            },
+            getPath: function (node) {
+              var path;
+              while (true) {
+                if (FS.isRoot(node)) {
+                  var mount = node.mount.mountpoint;
+                  if (!path) return mount;
+                  return mount[mount.length - 1] !== "/" ? mount + "/" + path : mount + path;
+                }
+                path = path ? node.name + "/" + path : node.name;
+                node = node.parent;
+              }
+            },
+            hashName: function (parentid, name) {
+              var hash = 0;
+              for (var i = 0; i < name.length; i++) {
+                hash = ((hash << 5) - hash + name.charCodeAt(i)) | 0;
+              }
+              return ((parentid + hash) >>> 0) % FS.nameTable.length;
+            },
+            hashAddNode: function (node) {
+              var hash = FS.hashName(node.parent.id, node.name);
+              node.name_next = FS.nameTable[hash];
+              FS.nameTable[hash] = node;
+            },
+            hashRemoveNode: function (node) {
+              var hash = FS.hashName(node.parent.id, node.name);
+              if (FS.nameTable[hash] === node) {
+                FS.nameTable[hash] = node.name_next;
+              } else {
+                var current = FS.nameTable[hash];
+                while (current) {
+                  if (current.name_next === node) {
+                    current.name_next = node.name_next;
+                    break;
+                  }
+                  current = current.name_next;
+                }
+              }
+            },
+            lookupNode: function (parent, name) {
+              var err = FS.mayLookup(parent);
+              if (err) {
+                throw new FS.ErrnoError(err, parent);
+              }
+              var hash = FS.hashName(parent.id, name);
+              for (var node = FS.nameTable[hash]; node; node = node.name_next) {
+                var nodeName = node.name;
+                if (node.parent.id === parent.id && nodeName === name) {
+                  return node;
+                }
+              }
+              return FS.lookup(parent, name);
+            },
+            createNode: function (parent, name, mode, rdev) {
+              if (!FS.FSNode) {
+                FS.FSNode = function (parent, name, mode, rdev) {
+                  if (!parent) {
+                    parent = this;
+                  }
+                  this.parent = parent;
+                  this.mount = parent.mount;
+                  this.mounted = null;
+                  this.id = FS.nextInode++;
+                  this.name = name;
+                  this.mode = mode;
+                  this.node_ops = {};
+                  this.stream_ops = {};
+                  this.rdev = rdev;
+                };
+                FS.FSNode.prototype = {};
+                var readMode = 292 | 73;
+                var writeMode = 146;
+                Object.defineProperties(FS.FSNode.prototype, {
+                  read: {
+                    get: function () {
+                      return (this.mode & readMode) === readMode;
+                    },
+                    set: function (val) {
+                      val ? (this.mode |= readMode) : (this.mode &= ~readMode);
+                    },
+                  },
+                  write: {
+                    get: function () {
+                      return (this.mode & writeMode) === writeMode;
+                    },
+                    set: function (val) {
+                      val ? (this.mode |= writeMode) : (this.mode &= ~writeMode);
+                    },
+                  },
+                  isFolder: {
+                    get: function () {
+                      return FS.isDir(this.mode);
+                    },
+                  },
+                  isDevice: {
+                    get: function () {
+                      return FS.isChrdev(this.mode);
+                    },
+                  },
+                });
+              }
+              var node = new FS.FSNode(parent, name, mode, rdev);
+              FS.hashAddNode(node);
+              return node;
+            },
+            destroyNode: function (node) {
+              FS.hashRemoveNode(node);
+            },
+            isRoot: function (node) {
+              return node === node.parent;
+            },
+            isMountpoint: function (node) {
+              return !!node.mounted;
+            },
+            isFile: function (mode) {
+              return (mode & 61440) === 32768;
+            },
+            isDir: function (mode) {
+              return (mode & 61440) === 16384;
+            },
+            isLink: function (mode) {
+              return (mode & 61440) === 40960;
+            },
+            isChrdev: function (mode) {
+              return (mode & 61440) === 8192;
+            },
+            isBlkdev: function (mode) {
+              return (mode & 61440) === 24576;
+            },
+            isFIFO: function (mode) {
+              return (mode & 61440) === 4096;
+            },
+            isSocket: function (mode) {
+              return (mode & 49152) === 49152;
+            },
+            flagModes: {
+              r: 0,
+              rs: 1052672,
+              "r+": 2,
+              w: 577,
+              wx: 705,
+              xw: 705,
+              "w+": 578,
+              "wx+": 706,
+              "xw+": 706,
+              a: 1089,
+              ax: 1217,
+              xa: 1217,
+              "a+": 1090,
+              "ax+": 1218,
+              "xa+": 1218,
+            },
+            modeStringToFlags: function (str) {
+              var flags = FS.flagModes[str];
+              if (typeof flags === "undefined") {
+                throw new Error("Unknown file open mode: " + str);
+              }
+              return flags;
+            },
+            flagsToPermissionString: function (flag) {
+              var perms = ["r", "w", "rw"][flag & 3];
+              if (flag & 512) {
+                perms += "w";
+              }
+              return perms;
+            },
+            nodePermissions: function (node, perms) {
+              if (FS.ignorePermissions) {
+                return 0;
+              }
+              if (perms.indexOf("r") !== -1 && !(node.mode & 292)) {
+                return ERRNO_CODES.EACCES;
+              } else if (perms.indexOf("w") !== -1 && !(node.mode & 146)) {
+                return ERRNO_CODES.EACCES;
+              } else if (perms.indexOf("x") !== -1 && !(node.mode & 73)) {
+                return ERRNO_CODES.EACCES;
+              }
+              return 0;
+            },
+            mayLookup: function (dir) {
+              var err = FS.nodePermissions(dir, "x");
+              if (err) return err;
+              if (!dir.node_ops.lookup) return ERRNO_CODES.EACCES;
+              return 0;
+            },
+            mayCreate: function (dir, name) {
+              try {
+                var node = FS.lookupNode(dir, name);
+                return ERRNO_CODES.EEXIST;
+              } catch (e) {}
+              return FS.nodePermissions(dir, "wx");
+            },
+            mayDelete: function (dir, name, isdir) {
+              var node;
+              try {
+                node = FS.lookupNode(dir, name);
+              } catch (e) {
+                return e.errno;
+              }
+              var err = FS.nodePermissions(dir, "wx");
+              if (err) {
+                return err;
+              }
+              if (isdir) {
+                if (!FS.isDir(node.mode)) {
+                  return ERRNO_CODES.ENOTDIR;
+                }
+                if (FS.isRoot(node) || FS.getPath(node) === FS.cwd()) {
+                  return ERRNO_CODES.EBUSY;
+                }
+              } else {
+                if (FS.isDir(node.mode)) {
+                  return ERRNO_CODES.EISDIR;
+                }
+              }
+              return 0;
+            },
+            mayOpen: function (node, flags) {
+              if (!node) {
+                return ERRNO_CODES.ENOENT;
+              }
+              if (FS.isLink(node.mode)) {
+                return ERRNO_CODES.ELOOP;
+              } else if (FS.isDir(node.mode)) {
+                if (FS.flagsToPermissionString(flags) !== "r" || flags & 512) {
+                  return ERRNO_CODES.EISDIR;
+                }
+              }
+              return FS.nodePermissions(node, FS.flagsToPermissionString(flags));
+            },
+            MAX_OPEN_FDS: 4096,
+            nextfd: function (fd_start, fd_end) {
+              fd_start = fd_start || 0;
+              fd_end = fd_end || FS.MAX_OPEN_FDS;
+              for (var fd = fd_start; fd <= fd_end; fd++) {
+                if (!FS.streams[fd]) {
+                  return fd;
+                }
+              }
+              throw new FS.ErrnoError(ERRNO_CODES.EMFILE);
+            },
+            getStream: function (fd) {
+              return FS.streams[fd];
+            },
+            createStream: function (stream, fd_start, fd_end) {
+              if (!FS.FSStream) {
+                FS.FSStream = function () {};
+                FS.FSStream.prototype = {};
+                Object.defineProperties(FS.FSStream.prototype, {
+                  object: {
+                    get: function () {
+                      return this.node;
+                    },
+                    set: function (val) {
+                      this.node = val;
+                    },
+                  },
+                  isRead: {
+                    get: function () {
+                      return (this.flags & 2097155) !== 1;
+                    },
+                  },
+                  isWrite: {
+                    get: function () {
+                      return (this.flags & 2097155) !== 0;
+                    },
+                  },
+                  isAppend: {
+                    get: function () {
+                      return this.flags & 1024;
+                    },
+                  },
+                });
+              }
+              var newStream = new FS.FSStream();
+              for (var p in stream) {
+                newStream[p] = stream[p];
+              }
+              stream = newStream;
+              var fd = FS.nextfd(fd_start, fd_end);
+              stream.fd = fd;
+              FS.streams[fd] = stream;
+              return stream;
+            },
+            closeStream: function (fd) {
+              FS.streams[fd] = null;
+            },
+            chrdev_stream_ops: {
+              open: function (stream) {
+                var device = FS.getDevice(stream.node.rdev);
+                stream.stream_ops = device.stream_ops;
+                if (stream.stream_ops.open) {
+                  stream.stream_ops.open(stream);
+                }
+              },
+              llseek: function () {
+                throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+              },
+            },
+            major: function (dev) {
+              return dev >> 8;
+            },
+            minor: function (dev) {
+              return dev & 255;
+            },
+            makedev: function (ma, mi) {
+              return (ma << 8) | mi;
+            },
+            registerDevice: function (dev, ops) {
+              FS.devices[dev] = { stream_ops: ops };
+            },
+            getDevice: function (dev) {
+              return FS.devices[dev];
+            },
+            getMounts: function (mount) {
+              var mounts = [];
+              var check = [mount];
+              while (check.length) {
+                var m = check.pop();
+                mounts.push(m);
+                check.push.apply(check, m.mounts);
+              }
+              return mounts;
+            },
+            syncfs: function (populate, callback) {
+              if (typeof populate === "function") {
+                callback = populate;
+                populate = false;
+              }
+              FS.syncFSRequests++;
+              if (FS.syncFSRequests > 1) {
+                console.log(
+                  "warning: " +
+                    FS.syncFSRequests +
+                    " FS.syncfs operations in flight at once, probably just doing extra work"
+                );
+              }
+              var mounts = FS.getMounts(FS.root.mount);
+              var completed = 0;
+              function doCallback(err) {
+                assert(FS.syncFSRequests > 0);
+                FS.syncFSRequests--;
+                return callback(err);
+              }
+              function done(err) {
+                if (err) {
+                  if (!done.errored) {
+                    done.errored = true;
+                    return doCallback(err);
+                  }
+                  return;
+                }
+                if (++completed >= mounts.length) {
+                  doCallback(null);
+                }
+              }
+              mounts.forEach(function (mount) {
+                if (!mount.type.syncfs) {
+                  return done(null);
+                }
+                mount.type.syncfs(mount, populate, done);
+              });
+            },
+            mount: function (type, opts, mountpoint) {
+              var root = mountpoint === "/";
+              var pseudo = !mountpoint;
+              var node;
+              if (root && FS.root) {
+                throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+              } else if (!root && !pseudo) {
+                var lookup = FS.lookupPath(mountpoint, { follow_mount: false });
+                mountpoint = lookup.path;
+                node = lookup.node;
+                if (FS.isMountpoint(node)) {
+                  throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+                }
+                if (!FS.isDir(node.mode)) {
+                  throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+                }
+              }
+              var mount = { type: type, opts: opts, mountpoint: mountpoint, mounts: [] };
+              var mountRoot = type.mount(mount);
+              mountRoot.mount = mount;
+              mount.root = mountRoot;
+              if (root) {
+                FS.root = mountRoot;
+              } else if (node) {
+                node.mounted = mount;
+                if (node.mount) {
+                  node.mount.mounts.push(mount);
+                }
+              }
+              return mountRoot;
+            },
+            unmount: function (mountpoint) {
+              var lookup = FS.lookupPath(mountpoint, { follow_mount: false });
+              if (!FS.isMountpoint(lookup.node)) {
+                throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+              }
+              var node = lookup.node;
+              var mount = node.mounted;
+              var mounts = FS.getMounts(mount);
+              Object.keys(FS.nameTable).forEach(function (hash) {
+                var current = FS.nameTable[hash];
+                while (current) {
+                  var next = current.name_next;
+                  if (mounts.indexOf(current.mount) !== -1) {
+                    FS.destroyNode(current);
+                  }
+                  current = next;
+                }
+              });
+              node.mounted = null;
+              var idx = node.mount.mounts.indexOf(mount);
+              assert(idx !== -1);
+              node.mount.mounts.splice(idx, 1);
+            },
+            lookup: function (parent, name) {
+              return parent.node_ops.lookup(parent, name);
+            },
+            mknod: function (path, mode, dev) {
+              var lookup = FS.lookupPath(path, { parent: true });
+              var parent = lookup.node;
+              var name = PATH.basename(path);
+              if (!name || name === "." || name === "..") {
+                throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+              }
+              var err = FS.mayCreate(parent, name);
+              if (err) {
+                throw new FS.ErrnoError(err);
+              }
+              if (!parent.node_ops.mknod) {
+                throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+              }
+              return parent.node_ops.mknod(parent, name, mode, dev);
+            },
+            create: function (path, mode) {
+              mode = mode !== undefined ? mode : 438;
+              mode &= 4095;
+              mode |= 32768;
+              return FS.mknod(path, mode, 0);
+            },
+            mkdir: function (path, mode) {
+              mode = mode !== undefined ? mode : 511;
+              mode &= 511 | 512;
+              mode |= 16384;
+              return FS.mknod(path, mode, 0);
+            },
+            mkdirTree: function (path, mode) {
+              var dirs = path.split("/");
+              var d = "";
+              for (var i = 0; i < dirs.length; ++i) {
+                if (!dirs[i]) continue;
+                d += "/" + dirs[i];
+                try {
+                  FS.mkdir(d, mode);
+                } catch (e) {
+                  if (e.errno != ERRNO_CODES.EEXIST) throw e;
+                }
+              }
+            },
+            mkdev: function (path, mode, dev) {
+              if (typeof dev === "undefined") {
+                dev = mode;
+                mode = 438;
+              }
+              mode |= 8192;
+              return FS.mknod(path, mode, dev);
+            },
+            symlink: function (oldpath, newpath) {
+              if (!PATH.resolve(oldpath)) {
+                throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
+              }
+              var lookup = FS.lookupPath(newpath, { parent: true });
+              var parent = lookup.node;
+              if (!parent) {
+                throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
+              }
+              var newname = PATH.basename(newpath);
+              var err = FS.mayCreate(parent, newname);
+              if (err) {
+                throw new FS.ErrnoError(err);
+              }
+              if (!parent.node_ops.symlink) {
+                throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+              }
+              return parent.node_ops.symlink(parent, newname, oldpath);
+            },
+            rename: function (old_path, new_path) {
+              var old_dirname = PATH.dirname(old_path);
+              var new_dirname = PATH.dirname(new_path);
+              var old_name = PATH.basename(old_path);
+              var new_name = PATH.basename(new_path);
+              var lookup, old_dir, new_dir;
+              try {
+                lookup = FS.lookupPath(old_path, { parent: true });
+                old_dir = lookup.node;
+                lookup = FS.lookupPath(new_path, { parent: true });
+                new_dir = lookup.node;
+              } catch (e) {
+                throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+              }
+              if (!old_dir || !new_dir) throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
+              if (old_dir.mount !== new_dir.mount) {
+                throw new FS.ErrnoError(ERRNO_CODES.EXDEV);
+              }
+              var old_node = FS.lookupNode(old_dir, old_name);
+              var relative = PATH.relative(old_path, new_dirname);
+              if (relative.charAt(0) !== ".") {
+                throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+              }
+              relative = PATH.relative(new_path, old_dirname);
+              if (relative.charAt(0) !== ".") {
+                throw new FS.ErrnoError(ERRNO_CODES.ENOTEMPTY);
+              }
+              var new_node;
+              try {
+                new_node = FS.lookupNode(new_dir, new_name);
+              } catch (e) {}
+              if (old_node === new_node) {
+                return;
+              }
+              var isdir = FS.isDir(old_node.mode);
+              var err = FS.mayDelete(old_dir, old_name, isdir);
+              if (err) {
+                throw new FS.ErrnoError(err);
+              }
+              err = new_node ? FS.mayDelete(new_dir, new_name, isdir) : FS.mayCreate(new_dir, new_name);
+              if (err) {
+                throw new FS.ErrnoError(err);
+              }
+              if (!old_dir.node_ops.rename) {
+                throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+              }
+              if (FS.isMountpoint(old_node) || (new_node && FS.isMountpoint(new_node))) {
+                throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+              }
+              if (new_dir !== old_dir) {
+                err = FS.nodePermissions(old_dir, "w");
+                if (err) {
+                  throw new FS.ErrnoError(err);
+                }
+              }
+              try {
+                if (FS.trackingDelegate["willMovePath"]) {
+                  FS.trackingDelegate["willMovePath"](old_path, new_path);
+                }
+              } catch (e) {
+                console.log(
+                  "FS.trackingDelegate['willMovePath']('" +
+                    old_path +
+                    "', '" +
+                    new_path +
+                    "') threw an exception: " +
+                    e.message
+                );
+              }
+              FS.hashRemoveNode(old_node);
+              try {
+                old_dir.node_ops.rename(old_node, new_dir, new_name);
+              } catch (e) {
+                throw e;
+              } finally {
+                FS.hashAddNode(old_node);
+              }
+              try {
+                if (FS.trackingDelegate["onMovePath"]) FS.trackingDelegate["onMovePath"](old_path, new_path);
+              } catch (e) {
+                console.log(
+                  "FS.trackingDelegate['onMovePath']('" +
+                    old_path +
+                    "', '" +
+                    new_path +
+                    "') threw an exception: " +
+                    e.message
+                );
+              }
+            },
+            rmdir: function (path) {
+              var lookup = FS.lookupPath(path, { parent: true });
+              var parent = lookup.node;
+              var name = PATH.basename(path);
+              var node = FS.lookupNode(parent, name);
+              var err = FS.mayDelete(parent, name, true);
+              if (err) {
+                throw new FS.ErrnoError(err);
+              }
+              if (!parent.node_ops.rmdir) {
+                throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+              }
+              if (FS.isMountpoint(node)) {
+                throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+              }
+              try {
+                if (FS.trackingDelegate["willDeletePath"]) {
+                  FS.trackingDelegate["willDeletePath"](path);
+                }
+              } catch (e) {
+                console.log("FS.trackingDelegate['willDeletePath']('" + path + "') threw an exception: " + e.message);
+              }
+              parent.node_ops.rmdir(parent, name);
+              FS.destroyNode(node);
+              try {
+                if (FS.trackingDelegate["onDeletePath"]) FS.trackingDelegate["onDeletePath"](path);
+              } catch (e) {
+                console.log("FS.trackingDelegate['onDeletePath']('" + path + "') threw an exception: " + e.message);
+              }
+            },
+            readdir: function (path) {
+              var lookup = FS.lookupPath(path, { follow: true });
+              var node = lookup.node;
+              if (!node.node_ops.readdir) {
+                throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+              }
+              return node.node_ops.readdir(node);
+            },
+            unlink: function (path) {
+              var lookup = FS.lookupPath(path, { parent: true });
+              var parent = lookup.node;
+              var name = PATH.basename(path);
+              var node = FS.lookupNode(parent, name);
+              var err = FS.mayDelete(parent, name, false);
+              if (err) {
+                throw new FS.ErrnoError(err);
+              }
+              if (!parent.node_ops.unlink) {
+                throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+              }
+              if (FS.isMountpoint(node)) {
+                throw new FS.ErrnoError(ERRNO_CODES.EBUSY);
+              }
+              try {
+                if (FS.trackingDelegate["willDeletePath"]) {
+                  FS.trackingDelegate["willDeletePath"](path);
+                }
+              } catch (e) {
+                console.log("FS.trackingDelegate['willDeletePath']('" + path + "') threw an exception: " + e.message);
+              }
+              parent.node_ops.unlink(parent, name);
+              FS.destroyNode(node);
+              try {
+                if (FS.trackingDelegate["onDeletePath"]) FS.trackingDelegate["onDeletePath"](path);
+              } catch (e) {
+                console.log("FS.trackingDelegate['onDeletePath']('" + path + "') threw an exception: " + e.message);
+              }
+            },
+            readlink: function (path) {
+              var lookup = FS.lookupPath(path);
+              var link = lookup.node;
+              if (!link) {
+                throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
+              }
+              if (!link.node_ops.readlink) {
+                throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+              }
+              return PATH.resolve(FS.getPath(link.parent), link.node_ops.readlink(link));
+            },
+            stat: function (path, dontFollow) {
+              var lookup = FS.lookupPath(path, { follow: !dontFollow });
+              var node = lookup.node;
+              if (!node) {
+                throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
+              }
+              if (!node.node_ops.getattr) {
+                throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+              }
+              return node.node_ops.getattr(node);
+            },
+            lstat: function (path) {
+              return FS.stat(path, true);
+            },
+            chmod: function (path, mode, dontFollow) {
+              var node;
+              if (typeof path === "string") {
+                var lookup = FS.lookupPath(path, { follow: !dontFollow });
+                node = lookup.node;
+              } else {
+                node = path;
+              }
+              if (!node.node_ops.setattr) {
+                throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+              }
+              node.node_ops.setattr(node, { mode: (mode & 4095) | (node.mode & ~4095), timestamp: Date.now() });
+            },
+            lchmod: function (path, mode) {
+              FS.chmod(path, mode, true);
+            },
+            fchmod: function (fd, mode) {
+              var stream = FS.getStream(fd);
+              if (!stream) {
+                throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+              }
+              FS.chmod(stream.node, mode);
+            },
+            chown: function (path, uid, gid, dontFollow) {
+              var node;
+              if (typeof path === "string") {
+                var lookup = FS.lookupPath(path, { follow: !dontFollow });
+                node = lookup.node;
+              } else {
+                node = path;
+              }
+              if (!node.node_ops.setattr) {
+                throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+              }
+              node.node_ops.setattr(node, { timestamp: Date.now() });
+            },
+            lchown: function (path, uid, gid) {
+              FS.chown(path, uid, gid, true);
+            },
+            fchown: function (fd, uid, gid) {
+              var stream = FS.getStream(fd);
+              if (!stream) {
+                throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+              }
+              FS.chown(stream.node, uid, gid);
+            },
+            truncate: function (path, len) {
+              if (len < 0) {
+                throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+              }
+              var node;
+              if (typeof path === "string") {
+                var lookup = FS.lookupPath(path, { follow: true });
+                node = lookup.node;
+              } else {
+                node = path;
+              }
+              if (!node.node_ops.setattr) {
+                throw new FS.ErrnoError(ERRNO_CODES.EPERM);
+              }
+              if (FS.isDir(node.mode)) {
+                throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+              }
+              if (!FS.isFile(node.mode)) {
+                throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+              }
+              var err = FS.nodePermissions(node, "w");
+              if (err) {
+                throw new FS.ErrnoError(err);
+              }
+              node.node_ops.setattr(node, { size: len, timestamp: Date.now() });
+            },
+            ftruncate: function (fd, len) {
+              var stream = FS.getStream(fd);
+              if (!stream) {
+                throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+              }
+              if ((stream.flags & 2097155) === 0) {
+                throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+              }
+              FS.truncate(stream.node, len);
+            },
+            utime: function (path, atime, mtime) {
+              var lookup = FS.lookupPath(path, { follow: true });
+              var node = lookup.node;
+              node.node_ops.setattr(node, { timestamp: Math.max(atime, mtime) });
+            },
+            open: function (path, flags, mode, fd_start, fd_end) {
+              if (path === "") {
+                throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
+              }
+              flags = typeof flags === "string" ? FS.modeStringToFlags(flags) : flags;
+              mode = typeof mode === "undefined" ? 438 : mode;
+              if (flags & 64) {
+                mode = (mode & 4095) | 32768;
+              } else {
+                mode = 0;
+              }
+              var node;
+              if (typeof path === "object") {
+                node = path;
+              } else {
+                path = PATH.normalize(path);
+                try {
+                  var lookup = FS.lookupPath(path, { follow: !(flags & 131072) });
+                  node = lookup.node;
+                } catch (e) {}
+              }
+              var created = false;
+              if (flags & 64) {
+                if (node) {
+                  if (flags & 128) {
+                    throw new FS.ErrnoError(ERRNO_CODES.EEXIST);
+                  }
+                } else {
+                  node = FS.mknod(path, mode, 0);
+                  created = true;
+                }
+              }
+              if (!node) {
+                throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
+              }
+              if (FS.isChrdev(node.mode)) {
+                flags &= ~512;
+              }
+              if (flags & 65536 && !FS.isDir(node.mode)) {
+                throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+              }
+              if (!created) {
+                var err = FS.mayOpen(node, flags);
+                if (err) {
+                  throw new FS.ErrnoError(err);
+                }
+              }
+              if (flags & 512) {
+                FS.truncate(node, 0);
+              }
+              flags &= ~(128 | 512);
+              var stream = FS.createStream(
+                {
+                  node: node,
+                  path: FS.getPath(node),
+                  flags: flags,
+                  seekable: true,
+                  position: 0,
+                  stream_ops: node.stream_ops,
+                  ungotten: [],
+                  error: false,
+                },
+                fd_start,
+                fd_end
+              );
+              if (stream.stream_ops.open) {
+                stream.stream_ops.open(stream);
+              }
+              if (Module["logReadFiles"] && !(flags & 1)) {
+                if (!FS.readFiles) FS.readFiles = {};
+                if (!(path in FS.readFiles)) {
+                  FS.readFiles[path] = 1;
+                  Module["printErr"]("read file: " + path);
+                }
+              }
+              try {
+                if (FS.trackingDelegate["onOpenFile"]) {
+                  var trackingFlags = 0;
+                  if ((flags & 2097155) !== 1) {
+                    trackingFlags |= FS.tracking.openFlags.READ;
+                  }
+                  if ((flags & 2097155) !== 0) {
+                    trackingFlags |= FS.tracking.openFlags.WRITE;
+                  }
+                  FS.trackingDelegate["onOpenFile"](path, trackingFlags);
+                }
+              } catch (e) {
+                console.log(
+                  "FS.trackingDelegate['onOpenFile']('" + path + "', flags) threw an exception: " + e.message
+                );
+              }
+              return stream;
+            },
+            close: function (stream) {
+              if (stream.getdents) stream.getdents = null;
+              try {
+                if (stream.stream_ops.close) {
+                  stream.stream_ops.close(stream);
+                }
+              } catch (e) {
+                throw e;
+              } finally {
+                FS.closeStream(stream.fd);
+              }
+            },
+            llseek: function (stream, offset, whence) {
+              if (!stream.seekable || !stream.stream_ops.llseek) {
+                throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+              }
+              stream.position = stream.stream_ops.llseek(stream, offset, whence);
+              stream.ungotten = [];
+              return stream.position;
+            },
+            read: function (stream, buffer, offset, length, position) {
+              if (length < 0 || position < 0) {
+                throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+              }
+              if ((stream.flags & 2097155) === 1) {
+                throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+              }
+              if (FS.isDir(stream.node.mode)) {
+                throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+              }
+              if (!stream.stream_ops.read) {
+                throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+              }
+              var seeking = typeof position !== "undefined";
+              if (!seeking) {
+                position = stream.position;
+              } else if (!stream.seekable) {
+                throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+              }
+              var bytesRead = stream.stream_ops.read(stream, buffer, offset, length, position);
+              if (!seeking) stream.position += bytesRead;
+              return bytesRead;
+            },
+            write: function (stream, buffer, offset, length, position, canOwn) {
+              if (length < 0 || position < 0) {
+                throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+              }
+              if ((stream.flags & 2097155) === 0) {
+                throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+              }
+              if (FS.isDir(stream.node.mode)) {
+                throw new FS.ErrnoError(ERRNO_CODES.EISDIR);
+              }
+              if (!stream.stream_ops.write) {
+                throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+              }
+              if (stream.flags & 1024) {
+                FS.llseek(stream, 0, 2);
+              }
+              var seeking = typeof position !== "undefined";
+              if (!seeking) {
+                position = stream.position;
+              } else if (!stream.seekable) {
+                throw new FS.ErrnoError(ERRNO_CODES.ESPIPE);
+              }
+              var bytesWritten = stream.stream_ops.write(stream, buffer, offset, length, position, canOwn);
+              if (!seeking) stream.position += bytesWritten;
+              try {
+                if (stream.path && FS.trackingDelegate["onWriteToFile"])
+                  FS.trackingDelegate["onWriteToFile"](stream.path);
+              } catch (e) {
+                console.log("FS.trackingDelegate['onWriteToFile']('" + path + "') threw an exception: " + e.message);
+              }
+              return bytesWritten;
+            },
+            allocate: function (stream, offset, length) {
+              if (offset < 0 || length <= 0) {
+                throw new FS.ErrnoError(ERRNO_CODES.EINVAL);
+              }
+              if ((stream.flags & 2097155) === 0) {
+                throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+              }
+              if (!FS.isFile(stream.node.mode) && !FS.isDir(stream.node.mode)) {
+                throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+              }
+              if (!stream.stream_ops.allocate) {
+                throw new FS.ErrnoError(ERRNO_CODES.EOPNOTSUPP);
+              }
+              stream.stream_ops.allocate(stream, offset, length);
+            },
+            mmap: function (stream, buffer, offset, length, position, prot, flags) {
+              if ((stream.flags & 2097155) === 1) {
+                throw new FS.ErrnoError(ERRNO_CODES.EACCES);
+              }
+              if (!stream.stream_ops.mmap) {
+                throw new FS.ErrnoError(ERRNO_CODES.ENODEV);
+              }
+              return stream.stream_ops.mmap(stream, buffer, offset, length, position, prot, flags);
+            },
+            msync: function (stream, buffer, offset, length, mmapFlags) {
+              if (!stream || !stream.stream_ops.msync) {
+                return 0;
+              }
+              return stream.stream_ops.msync(stream, buffer, offset, length, mmapFlags);
+            },
+            munmap: function (stream) {
+              return 0;
+            },
+            ioctl: function (stream, cmd, arg) {
+              if (!stream.stream_ops.ioctl) {
+                throw new FS.ErrnoError(ERRNO_CODES.ENOTTY);
+              }
+              return stream.stream_ops.ioctl(stream, cmd, arg);
+            },
+            readFile: function (path, opts) {
+              opts = opts || {};
+              opts.flags = opts.flags || "r";
+              opts.encoding = opts.encoding || "binary";
+              if (opts.encoding !== "utf8" && opts.encoding !== "binary") {
+                throw new Error('Invalid encoding type "' + opts.encoding + '"');
+              }
+              var ret;
+              var stream = FS.open(path, opts.flags);
+              var stat = FS.stat(path);
+              var length = stat.size;
+              var buf = new Uint8Array(length);
+              FS.read(stream, buf, 0, length, 0);
+              if (opts.encoding === "utf8") {
+                ret = UTF8ArrayToString(buf, 0);
+              } else if (opts.encoding === "binary") {
+                ret = buf;
+              }
+              FS.close(stream);
+              return ret;
+            },
+            writeFile: function (path, data, opts) {
+              opts = opts || {};
+              opts.flags = opts.flags || "w";
+              var stream = FS.open(path, opts.flags, opts.mode);
+              if (typeof data === "string") {
+                var buf = new Uint8Array(lengthBytesUTF8(data) + 1);
+                var actualNumBytes = stringToUTF8Array(data, buf, 0, buf.length);
+                FS.write(stream, buf, 0, actualNumBytes, undefined, opts.canOwn);
+              } else if (ArrayBuffer.isView(data)) {
+                FS.write(stream, data, 0, data.byteLength, undefined, opts.canOwn);
+              } else {
+                throw new Error("Unsupported data type");
+              }
+              FS.close(stream);
+            },
+            cwd: function () {
+              return FS.currentPath;
+            },
+            chdir: function (path) {
+              var lookup = FS.lookupPath(path, { follow: true });
+              if (lookup.node === null) {
+                throw new FS.ErrnoError(ERRNO_CODES.ENOENT);
+              }
+              if (!FS.isDir(lookup.node.mode)) {
+                throw new FS.ErrnoError(ERRNO_CODES.ENOTDIR);
+              }
+              var err = FS.nodePermissions(lookup.node, "x");
+              if (err) {
+                throw new FS.ErrnoError(err);
+              }
+              FS.currentPath = lookup.path;
+            },
+            createDefaultDirectories: function () {
+              FS.mkdir("/tmp");
+              FS.mkdir("/home");
+              FS.mkdir("/home/web_user");
+            },
+            createDefaultDevices: function () {
+              FS.mkdir("/dev");
+              FS.registerDevice(FS.makedev(1, 3), {
+                read: function () {
+                  return 0;
+                },
+                write: function (stream, buffer, offset, length, pos) {
+                  return length;
+                },
+              });
+              FS.mkdev("/dev/null", FS.makedev(1, 3));
+              TTY.register(FS.makedev(5, 0), TTY.default_tty_ops);
+              TTY.register(FS.makedev(6, 0), TTY.default_tty1_ops);
+              FS.mkdev("/dev/tty", FS.makedev(5, 0));
+              FS.mkdev("/dev/tty1", FS.makedev(6, 0));
+              var random_device;
+              if (typeof crypto !== "undefined") {
+                var randomBuffer = new Uint8Array(1);
+                random_device = function () {
+                  crypto.getRandomValues(randomBuffer);
+                  return randomBuffer[0];
+                };
+              } else if (ENVIRONMENT_IS_NODE) {
+                random_device = function () {
+                  return require("crypto")["randomBytes"](1)[0];
+                };
+              } else {
+                random_device = function () {
+                  return (Math.random() * 256) | 0;
+                };
+              }
+              FS.createDevice("/dev", "random", random_device);
+              FS.createDevice("/dev", "urandom", random_device);
+              FS.mkdir("/dev/shm");
+              FS.mkdir("/dev/shm/tmp");
+            },
+            createSpecialDirectories: function () {
+              FS.mkdir("/proc");
+              FS.mkdir("/proc/self");
+              FS.mkdir("/proc/self/fd");
+              FS.mount(
+                {
+                  mount: function () {
+                    var node = FS.createNode("/proc/self", "fd", 16384 | 511, 73);
+                    node.node_ops = {
+                      lookup: function (parent, name) {
+                        var fd = +name;
+                        var stream = FS.getStream(fd);
+                        if (!stream) throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+                        var ret = {
+                          parent: null,
+                          mount: { mountpoint: "fake" },
+                          node_ops: {
+                            readlink: function () {
+                              return stream.path;
+                            },
+                          },
+                        };
+                        ret.parent = ret;
+                        return ret;
+                      },
+                    };
+                    return node;
+                  },
+                },
+                {},
+                "/proc/self/fd"
+              );
+            },
+            createStandardStreams: function () {
+              if (Module["stdin"]) {
+                FS.createDevice("/dev", "stdin", Module["stdin"]);
+              } else {
+                FS.symlink("/dev/tty", "/dev/stdin");
+              }
+              if (Module["stdout"]) {
+                FS.createDevice("/dev", "stdout", null, Module["stdout"]);
+              } else {
+                FS.symlink("/dev/tty", "/dev/stdout");
+              }
+              if (Module["stderr"]) {
+                FS.createDevice("/dev", "stderr", null, Module["stderr"]);
+              } else {
+                FS.symlink("/dev/tty1", "/dev/stderr");
+              }
+              var stdin = FS.open("/dev/stdin", "r");
+              assert(stdin.fd === 0, "invalid handle for stdin (" + stdin.fd + ")");
+              var stdout = FS.open("/dev/stdout", "w");
+              assert(stdout.fd === 1, "invalid handle for stdout (" + stdout.fd + ")");
+              var stderr = FS.open("/dev/stderr", "w");
+              assert(stderr.fd === 2, "invalid handle for stderr (" + stderr.fd + ")");
+            },
+            ensureErrnoError: function () {
+              if (FS.ErrnoError) return;
+              FS.ErrnoError = function ErrnoError(errno, node) {
+                this.node = node;
+                this.setErrno = function (errno) {
+                  this.errno = errno;
+                  for (var key in ERRNO_CODES) {
+                    if (ERRNO_CODES[key] === errno) {
+                      this.code = key;
+                      break;
+                    }
+                  }
+                };
+                this.setErrno(errno);
+                this.message = ERRNO_MESSAGES[errno];
+                if (this.stack) Object.defineProperty(this, "stack", { value: new Error().stack, writable: true });
+              };
+              FS.ErrnoError.prototype = new Error();
+              FS.ErrnoError.prototype.constructor = FS.ErrnoError;
+              [ERRNO_CODES.ENOENT].forEach(function (code) {
+                FS.genericErrors[code] = new FS.ErrnoError(code);
+                FS.genericErrors[code].stack = "<generic error, no stack>";
+              });
+            },
+            staticInit: function () {
+              FS.ensureErrnoError();
+              FS.nameTable = new Array(4096);
+              FS.mount(MEMFS, {}, "/");
+              FS.createDefaultDirectories();
+              FS.createDefaultDevices();
+              FS.createSpecialDirectories();
+              FS.filesystems = { MEMFS: MEMFS, IDBFS: IDBFS, NODEFS: NODEFS, WORKERFS: WORKERFS };
+            },
+            init: function (input, output, error) {
+              assert(
+                !FS.init.initialized,
+                "FS.init was previously called. If you want to initialize later with custom parameters, remove any earlier calls (note that one is automatically added to the generated code)"
+              );
+              FS.init.initialized = true;
+              FS.ensureErrnoError();
+              Module["stdin"] = input || Module["stdin"];
+              Module["stdout"] = output || Module["stdout"];
+              Module["stderr"] = error || Module["stderr"];
+              FS.createStandardStreams();
+            },
+            quit: function () {
+              FS.init.initialized = false;
+              var fflush = Module["_fflush"];
+              if (fflush) fflush(0);
+              for (var i = 0; i < FS.streams.length; i++) {
+                var stream = FS.streams[i];
+                if (!stream) {
+                  continue;
+                }
+                FS.close(stream);
+              }
+            },
+            getMode: function (canRead, canWrite) {
+              var mode = 0;
+              if (canRead) mode |= 292 | 73;
+              if (canWrite) mode |= 146;
+              return mode;
+            },
+            joinPath: function (parts, forceRelative) {
+              var path = PATH.join.apply(null, parts);
+              if (forceRelative && path[0] == "/") path = path.substr(1);
+              return path;
+            },
+            absolutePath: function (relative, base) {
+              return PATH.resolve(base, relative);
+            },
+            standardizePath: function (path) {
+              return PATH.normalize(path);
+            },
+            findObject: function (path, dontResolveLastLink) {
+              var ret = FS.analyzePath(path, dontResolveLastLink);
+              if (ret.exists) {
+                return ret.object;
+              } else {
+                ___setErrNo(ret.error);
+                return null;
+              }
+            },
+            analyzePath: function (path, dontResolveLastLink) {
+              try {
+                var lookup = FS.lookupPath(path, { follow: !dontResolveLastLink });
+                path = lookup.path;
+              } catch (e) {}
+              var ret = {
+                isRoot: false,
+                exists: false,
+                error: 0,
+                name: null,
+                path: null,
+                object: null,
+                parentExists: false,
+                parentPath: null,
+                parentObject: null,
+              };
+              try {
+                var lookup = FS.lookupPath(path, { parent: true });
+                ret.parentExists = true;
+                ret.parentPath = lookup.path;
+                ret.parentObject = lookup.node;
+                ret.name = PATH.basename(path);
+                lookup = FS.lookupPath(path, { follow: !dontResolveLastLink });
+                ret.exists = true;
+                ret.path = lookup.path;
+                ret.object = lookup.node;
+                ret.name = lookup.node.name;
+                ret.isRoot = lookup.path === "/";
+              } catch (e) {
+                ret.error = e.errno;
+              }
+              return ret;
+            },
+            createFolder: function (parent, name, canRead, canWrite) {
+              var path = PATH.join2(typeof parent === "string" ? parent : FS.getPath(parent), name);
+              var mode = FS.getMode(canRead, canWrite);
+              return FS.mkdir(path, mode);
+            },
+            createPath: function (parent, path, canRead, canWrite) {
+              parent = typeof parent === "string" ? parent : FS.getPath(parent);
+              var parts = path.split("/").reverse();
+              while (parts.length) {
+                var part = parts.pop();
+                if (!part) continue;
+                var current = PATH.join2(parent, part);
+                try {
+                  FS.mkdir(current);
+                } catch (e) {}
+                parent = current;
+              }
+              return current;
+            },
+            createFile: function (parent, name, properties, canRead, canWrite) {
+              var path = PATH.join2(typeof parent === "string" ? parent : FS.getPath(parent), name);
+              var mode = FS.getMode(canRead, canWrite);
+              return FS.create(path, mode);
+            },
+            createDataFile: function (parent, name, data, canRead, canWrite, canOwn) {
+              var path = name ? PATH.join2(typeof parent === "string" ? parent : FS.getPath(parent), name) : parent;
+              var mode = FS.getMode(canRead, canWrite);
+              var node = FS.create(path, mode);
+              if (data) {
+                if (typeof data === "string") {
+                  var arr = new Array(data.length);
+                  for (var i = 0, len = data.length; i < len; ++i) arr[i] = data.charCodeAt(i);
+                  data = arr;
+                }
+                FS.chmod(node, mode | 146);
+                var stream = FS.open(node, "w");
+                FS.write(stream, data, 0, data.length, 0, canOwn);
+                FS.close(stream);
+                FS.chmod(node, mode);
+              }
+              return node;
+            },
+            createDevice: function (parent, name, input, output) {
+              var path = PATH.join2(typeof parent === "string" ? parent : FS.getPath(parent), name);
+              var mode = FS.getMode(!!input, !!output);
+              if (!FS.createDevice.major) FS.createDevice.major = 64;
+              var dev = FS.makedev(FS.createDevice.major++, 0);
+              FS.registerDevice(dev, {
+                open: function (stream) {
+                  stream.seekable = false;
+                },
+                close: function (stream) {
+                  if (output && output.buffer && output.buffer.length) {
+                    output(10);
+                  }
+                },
+                read: function (stream, buffer, offset, length, pos) {
+                  var bytesRead = 0;
+                  for (var i = 0; i < length; i++) {
+                    var result;
+                    try {
+                      result = input();
+                    } catch (e) {
+                      throw new FS.ErrnoError(ERRNO_CODES.EIO);
+                    }
+                    if (result === undefined && bytesRead === 0) {
+                      throw new FS.ErrnoError(ERRNO_CODES.EAGAIN);
+                    }
+                    if (result === null || result === undefined) break;
+                    bytesRead++;
+                    buffer[offset + i] = result;
+                  }
+                  if (bytesRead) {
+                    stream.node.timestamp = Date.now();
+                  }
+                  return bytesRead;
+                },
+                write: function (stream, buffer, offset, length, pos) {
+                  for (var i = 0; i < length; i++) {
+                    try {
+                      output(buffer[offset + i]);
+                    } catch (e) {
+                      throw new FS.ErrnoError(ERRNO_CODES.EIO);
+                    }
+                  }
+                  if (length) {
+                    stream.node.timestamp = Date.now();
+                  }
+                  return i;
+                },
+              });
+              return FS.mkdev(path, mode, dev);
+            },
+            createLink: function (parent, name, target, canRead, canWrite) {
+              var path = PATH.join2(typeof parent === "string" ? parent : FS.getPath(parent), name);
+              return FS.symlink(target, path);
+            },
+            forceLoadFile: function (obj) {
+              if (obj.isDevice || obj.isFolder || obj.link || obj.contents) return true;
+              var success = true;
+              if (typeof XMLHttpRequest !== "undefined") {
+                throw new Error(
+                  "Lazy loading should have been performed (contents set) in createLazyFile, but it was not. Lazy loading only works in web workers. Use --embed-file or --preload-file in emcc on the main thread."
+                );
+              } else if (Module["read"]) {
+                try {
+                  obj.contents = intArrayFromString(Module["read"](obj.url), true);
+                  obj.usedBytes = obj.contents.length;
+                } catch (e) {
+                  success = false;
+                }
+              } else {
+                throw new Error("Cannot load without read() or XMLHttpRequest.");
+              }
+              if (!success) ___setErrNo(ERRNO_CODES.EIO);
+              return success;
+            },
+            createLazyFile: function (parent, name, url, canRead, canWrite) {
+              function LazyUint8Array() {
+                this.lengthKnown = false;
+                this.chunks = [];
+              }
+              LazyUint8Array.prototype.get = function LazyUint8Array_get(idx) {
+                if (idx > this.length - 1 || idx < 0) {
+                  return undefined;
+                }
+                var chunkOffset = idx % this.chunkSize;
+                var chunkNum = (idx / this.chunkSize) | 0;
+                return this.getter(chunkNum)[chunkOffset];
+              };
+              LazyUint8Array.prototype.setDataGetter = function LazyUint8Array_setDataGetter(getter) {
+                this.getter = getter;
+              };
+              LazyUint8Array.prototype.cacheLength = function LazyUint8Array_cacheLength() {
+                var xhr = new XMLHttpRequest();
+                xhr.open("HEAD", url, false);
+                xhr.send(null);
+                if (!((xhr.status >= 200 && xhr.status < 300) || xhr.status === 304))
+                  throw new Error("Couldn't load " + url + ". Status: " + xhr.status);
+                var datalength = Number(xhr.getResponseHeader("Content-length"));
+                var header;
+                var hasByteServing = (header = xhr.getResponseHeader("Accept-Ranges")) && header === "bytes";
+                var usesGzip = (header = xhr.getResponseHeader("Content-Encoding")) && header === "gzip";
+                var chunkSize = 1024 * 1024;
+                if (!hasByteServing) chunkSize = datalength;
+                var doXHR = function (from, to) {
+                  if (from > to) throw new Error("invalid range (" + from + ", " + to + ") or no bytes requested!");
+                  if (to > datalength - 1)
+                    throw new Error("only " + datalength + " bytes available! programmer error!");
+                  var xhr = new XMLHttpRequest();
+                  xhr.open("GET", url, false);
+                  if (datalength !== chunkSize) xhr.setRequestHeader("Range", "bytes=" + from + "-" + to);
+                  if (typeof Uint8Array != "undefined") xhr.responseType = "arraybuffer";
+                  if (xhr.overrideMimeType) {
+                    xhr.overrideMimeType("text/plain; charset=x-user-defined");
+                  }
+                  xhr.send(null);
+                  if (!((xhr.status >= 200 && xhr.status < 300) || xhr.status === 304))
+                    throw new Error("Couldn't load " + url + ". Status: " + xhr.status);
+                  if (xhr.response !== undefined) {
+                    return new Uint8Array(xhr.response || []);
+                  } else {
+                    return intArrayFromString(xhr.responseText || "", true);
+                  }
+                };
+                var lazyArray = this;
+                lazyArray.setDataGetter(function (chunkNum) {
+                  var start = chunkNum * chunkSize;
+                  var end = (chunkNum + 1) * chunkSize - 1;
+                  end = Math.min(end, datalength - 1);
+                  if (typeof lazyArray.chunks[chunkNum] === "undefined") {
+                    lazyArray.chunks[chunkNum] = doXHR(start, end);
+                  }
+                  if (typeof lazyArray.chunks[chunkNum] === "undefined") throw new Error("doXHR failed!");
+                  return lazyArray.chunks[chunkNum];
+                });
+                if (usesGzip || !datalength) {
+                  chunkSize = datalength = 1;
+                  datalength = this.getter(0).length;
+                  chunkSize = datalength;
+                  console.log("LazyFiles on gzip forces download of the whole file when length is accessed");
+                }
+                this._length = datalength;
+                this._chunkSize = chunkSize;
+                this.lengthKnown = true;
+              };
+              if (typeof XMLHttpRequest !== "undefined") {
+                if (!ENVIRONMENT_IS_WORKER)
+                  throw "Cannot do synchronous binary XHRs outside webworkers in modern browsers. Use --embed-file or --preload-file in emcc";
+                var lazyArray = new LazyUint8Array();
+                Object.defineProperties(lazyArray, {
+                  length: {
+                    get: function () {
+                      if (!this.lengthKnown) {
+                        this.cacheLength();
+                      }
+                      return this._length;
+                    },
+                  },
+                  chunkSize: {
+                    get: function () {
+                      if (!this.lengthKnown) {
+                        this.cacheLength();
+                      }
+                      return this._chunkSize;
+                    },
+                  },
+                });
+                var properties = { isDevice: false, contents: lazyArray };
+              } else {
+                var properties = { isDevice: false, url: url };
+              }
+              var node = FS.createFile(parent, name, properties, canRead, canWrite);
+              if (properties.contents) {
+                node.contents = properties.contents;
+              } else if (properties.url) {
+                node.contents = null;
+                node.url = properties.url;
+              }
+              Object.defineProperties(node, {
+                usedBytes: {
+                  get: function () {
+                    return this.contents.length;
+                  },
+                },
+              });
+              var stream_ops = {};
+              var keys = Object.keys(node.stream_ops);
+              keys.forEach(function (key) {
+                var fn = node.stream_ops[key];
+                stream_ops[key] = function forceLoadLazyFile() {
+                  if (!FS.forceLoadFile(node)) {
+                    throw new FS.ErrnoError(ERRNO_CODES.EIO);
+                  }
+                  return fn.apply(null, arguments);
+                };
+              });
+              stream_ops.read = function stream_ops_read(stream, buffer, offset, length, position) {
+                if (!FS.forceLoadFile(node)) {
+                  throw new FS.ErrnoError(ERRNO_CODES.EIO);
+                }
+                var contents = stream.node.contents;
+                if (position >= contents.length) return 0;
+                var size = Math.min(contents.length - position, length);
+                assert(size >= 0);
+                if (contents.slice) {
+                  for (var i = 0; i < size; i++) {
+                    buffer[offset + i] = contents[position + i];
+                  }
+                } else {
+                  for (var i = 0; i < size; i++) {
+                    buffer[offset + i] = contents.get(position + i);
+                  }
+                }
+                return size;
+              };
+              node.stream_ops = stream_ops;
+              return node;
+            },
+            createPreloadedFile: function (
+              parent,
+              name,
+              url,
+              canRead,
+              canWrite,
+              onload,
+              onerror,
+              dontCreateFile,
+              canOwn,
+              preFinish
+            ) {
+              Browser.init();
+              var fullname = name ? PATH.resolve(PATH.join2(parent, name)) : parent;
+              var dep = getUniqueRunDependency("cp " + fullname);
+              function processData(byteArray) {
+                function finish(byteArray) {
+                  if (preFinish) preFinish();
+                  if (!dontCreateFile) {
+                    FS.createDataFile(parent, name, byteArray, canRead, canWrite, canOwn);
+                  }
+                  if (onload) onload();
+                  removeRunDependency(dep);
+                }
+                var handled = false;
+                Module["preloadPlugins"].forEach(function (plugin) {
+                  if (handled) return;
+                  if (plugin["canHandle"](fullname)) {
+                    plugin["handle"](byteArray, fullname, finish, function () {
+                      if (onerror) onerror();
+                      removeRunDependency(dep);
+                    });
+                    handled = true;
+                  }
+                });
+                if (!handled) finish(byteArray);
+              }
+              addRunDependency(dep);
+              if (typeof url == "string") {
+                Browser.asyncLoad(
+                  url,
+                  function (byteArray) {
+                    processData(byteArray);
+                  },
+                  onerror
+                );
+              } else {
+                processData(url);
+              }
+            },
+            indexedDB: function () {
+              return window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
+            },
+            DB_NAME: function () {
+              return "EM_FS_" + window.location.pathname;
+            },
+            DB_VERSION: 20,
+            DB_STORE_NAME: "FILE_DATA",
+            saveFilesToDB: function (paths, onload, onerror) {
+              onload = onload || function () {};
+              onerror = onerror || function () {};
+              var indexedDB = FS.indexedDB();
+              try {
+                var openRequest = indexedDB.open(FS.DB_NAME(), FS.DB_VERSION);
+              } catch (e) {
+                return onerror(e);
+              }
+              openRequest.onupgradeneeded = function openRequest_onupgradeneeded() {
+                console.log("creating db");
+                var db = openRequest.result;
+                db.createObjectStore(FS.DB_STORE_NAME);
+              };
+              openRequest.onsuccess = function openRequest_onsuccess() {
+                var db = openRequest.result;
+                var transaction = db.transaction([FS.DB_STORE_NAME], "readwrite");
+                var files = transaction.objectStore(FS.DB_STORE_NAME);
+                var ok = 0,
+                  fail = 0,
+                  total = paths.length;
+                function finish() {
+                  if (fail == 0) onload();
+                  else onerror();
+                }
+                paths.forEach(function (path) {
+                  var putRequest = files.put(FS.analyzePath(path).object.contents, path);
+                  putRequest.onsuccess = function putRequest_onsuccess() {
+                    ok++;
+                    if (ok + fail == total) finish();
+                  };
+                  putRequest.onerror = function putRequest_onerror() {
+                    fail++;
+                    if (ok + fail == total) finish();
+                  };
+                });
+                transaction.onerror = onerror;
+              };
+              openRequest.onerror = onerror;
+            },
+            loadFilesFromDB: function (paths, onload, onerror) {
+              onload = onload || function () {};
+              onerror = onerror || function () {};
+              var indexedDB = FS.indexedDB();
+              try {
+                var openRequest = indexedDB.open(FS.DB_NAME(), FS.DB_VERSION);
+              } catch (e) {
+                return onerror(e);
+              }
+              openRequest.onupgradeneeded = onerror;
+              openRequest.onsuccess = function openRequest_onsuccess() {
+                var db = openRequest.result;
+                try {
+                  var transaction = db.transaction([FS.DB_STORE_NAME], "readonly");
+                } catch (e) {
+                  onerror(e);
+                  return;
+                }
+                var files = transaction.objectStore(FS.DB_STORE_NAME);
+                var ok = 0,
+                  fail = 0,
+                  total = paths.length;
+                function finish() {
+                  if (fail == 0) onload();
+                  else onerror();
+                }
+                paths.forEach(function (path) {
+                  var getRequest = files.get(path);
+                  getRequest.onsuccess = function getRequest_onsuccess() {
+                    if (FS.analyzePath(path).exists) {
+                      FS.unlink(path);
+                    }
+                    FS.createDataFile(PATH.dirname(path), PATH.basename(path), getRequest.result, true, true, true);
+                    ok++;
+                    if (ok + fail == total) finish();
+                  };
+                  getRequest.onerror = function getRequest_onerror() {
+                    fail++;
+                    if (ok + fail == total) finish();
+                  };
+                });
+                transaction.onerror = onerror;
+              };
+              openRequest.onerror = onerror;
+            },
+          };
+          var SYSCALLS = {
+            DEFAULT_POLLMASK: 5,
+            mappings: {},
+            umask: 511,
+            calculateAt: function (dirfd, path) {
+              if (path[0] !== "/") {
+                var dir;
+                if (dirfd === -100) {
+                  dir = FS.cwd();
+                } else {
+                  var dirstream = FS.getStream(dirfd);
+                  if (!dirstream) throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+                  dir = dirstream.path;
+                }
+                path = PATH.join2(dir, path);
+              }
+              return path;
+            },
+            doStat: function (func, path, buf) {
+              try {
+                var stat = func(path);
+              } catch (e) {
+                if (e && e.node && PATH.normalize(path) !== PATH.normalize(FS.getPath(e.node))) {
+                  return -ERRNO_CODES.ENOTDIR;
+                }
+                throw e;
+              }
+              HEAP32[buf >> 2] = stat.dev;
+              HEAP32[(buf + 4) >> 2] = 0;
+              HEAP32[(buf + 8) >> 2] = stat.ino;
+              HEAP32[(buf + 12) >> 2] = stat.mode;
+              HEAP32[(buf + 16) >> 2] = stat.nlink;
+              HEAP32[(buf + 20) >> 2] = stat.uid;
+              HEAP32[(buf + 24) >> 2] = stat.gid;
+              HEAP32[(buf + 28) >> 2] = stat.rdev;
+              HEAP32[(buf + 32) >> 2] = 0;
+              HEAP32[(buf + 36) >> 2] = stat.size;
+              HEAP32[(buf + 40) >> 2] = 4096;
+              HEAP32[(buf + 44) >> 2] = stat.blocks;
+              HEAP32[(buf + 48) >> 2] = (stat.atime.getTime() / 1e3) | 0;
+              HEAP32[(buf + 52) >> 2] = 0;
+              HEAP32[(buf + 56) >> 2] = (stat.mtime.getTime() / 1e3) | 0;
+              HEAP32[(buf + 60) >> 2] = 0;
+              HEAP32[(buf + 64) >> 2] = (stat.ctime.getTime() / 1e3) | 0;
+              HEAP32[(buf + 68) >> 2] = 0;
+              HEAP32[(buf + 72) >> 2] = stat.ino;
+              return 0;
+            },
+            doMsync: function (addr, stream, len, flags) {
+              var buffer = new Uint8Array(HEAPU8.subarray(addr, addr + len));
+              FS.msync(stream, buffer, 0, len, flags);
+            },
+            doMkdir: function (path, mode) {
+              path = PATH.normalize(path);
+              if (path[path.length - 1] === "/") path = path.substr(0, path.length - 1);
+              FS.mkdir(path, mode, 0);
+              return 0;
+            },
+            doMknod: function (path, mode, dev) {
+              switch (mode & 61440) {
+                case 32768:
+                case 8192:
+                case 24576:
+                case 4096:
+                case 49152:
+                  break;
+                default:
+                  return -ERRNO_CODES.EINVAL;
+              }
+              FS.mknod(path, mode, dev);
+              return 0;
+            },
+            doReadlink: function (path, buf, bufsize) {
+              if (bufsize <= 0) return -ERRNO_CODES.EINVAL;
+              var ret = FS.readlink(path);
+              var len = Math.min(bufsize, lengthBytesUTF8(ret));
+              var endChar = HEAP8[buf + len];
+              stringToUTF8(ret, buf, bufsize + 1);
+              HEAP8[buf + len] = endChar;
+              return len;
+            },
+            doAccess: function (path, amode) {
+              if (amode & ~7) {
+                return -ERRNO_CODES.EINVAL;
+              }
+              var node;
+              var lookup = FS.lookupPath(path, { follow: true });
+              node = lookup.node;
+              var perms = "";
+              if (amode & 4) perms += "r";
+              if (amode & 2) perms += "w";
+              if (amode & 1) perms += "x";
+              if (perms && FS.nodePermissions(node, perms)) {
+                return -ERRNO_CODES.EACCES;
+              }
+              return 0;
+            },
+            doDup: function (path, flags, suggestFD) {
+              var suggest = FS.getStream(suggestFD);
+              if (suggest) FS.close(suggest);
+              return FS.open(path, flags, 0, suggestFD, suggestFD).fd;
+            },
+            doReadv: function (stream, iov, iovcnt, offset) {
+              var ret = 0;
+              for (var i = 0; i < iovcnt; i++) {
+                var ptr = HEAP32[(iov + i * 8) >> 2];
+                var len = HEAP32[(iov + (i * 8 + 4)) >> 2];
+                var curr = FS.read(stream, HEAP8, ptr, len, offset);
+                if (curr < 0) return -1;
+                ret += curr;
+                if (curr < len) break;
+              }
+              return ret;
+            },
+            doWritev: function (stream, iov, iovcnt, offset) {
+              var ret = 0;
+              for (var i = 0; i < iovcnt; i++) {
+                var ptr = HEAP32[(iov + i * 8) >> 2];
+                var len = HEAP32[(iov + (i * 8 + 4)) >> 2];
+                var curr = FS.write(stream, HEAP8, ptr, len, offset);
+                if (curr < 0) return -1;
+                ret += curr;
+              }
+              return ret;
+            },
+            varargs: 0,
+            get: function (varargs) {
+              SYSCALLS.varargs += 4;
+              var ret = HEAP32[(SYSCALLS.varargs - 4) >> 2];
+              return ret;
+            },
+            getStr: function () {
+              var ret = Pointer_stringify(SYSCALLS.get());
+              return ret;
+            },
+            getStreamFromFD: function () {
+              var stream = FS.getStream(SYSCALLS.get());
+              if (!stream) throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+              return stream;
+            },
+            getSocketFromFD: function () {
+              var socket = SOCKFS.getSocket(SYSCALLS.get());
+              if (!socket) throw new FS.ErrnoError(ERRNO_CODES.EBADF);
+              return socket;
+            },
+            getSocketAddress: function (allowNull) {
+              var addrp = SYSCALLS.get(),
+                addrlen = SYSCALLS.get();
+              if (allowNull && addrp === 0) return null;
+              var info = __read_sockaddr(addrp, addrlen);
+              if (info.errno) throw new FS.ErrnoError(info.errno);
+              info.addr = DNS.lookup_addr(info.addr) || info.addr;
+              return info;
+            },
+            get64: function () {
+              var low = SYSCALLS.get(),
+                high = SYSCALLS.get();
+              if (low >= 0) assert(high === 0);
+              else assert(high === -1);
+              return low;
+            },
+            getZero: function () {
+              assert(SYSCALLS.get() === 0);
+            },
+          };
+          function ___syscall10(which, varargs) {
+            SYSCALLS.varargs = varargs;
+            try {
+              var path = SYSCALLS.getStr();
+              FS.unlink(path);
+              return 0;
+            } catch (e) {
+              if (typeof FS === "undefined" || !(e instanceof FS.ErrnoError)) abort(e);
+              return -e.errno;
+            }
+          }
+          function ___syscall140(which, varargs) {
+            SYSCALLS.varargs = varargs;
+            try {
+              var stream = SYSCALLS.getStreamFromFD(),
+                offset_high = SYSCALLS.get(),
+                offset_low = SYSCALLS.get(),
+                result = SYSCALLS.get(),
+                whence = SYSCALLS.get();
+              var offset = offset_low;
+              FS.llseek(stream, offset, whence);
+              HEAP32[result >> 2] = stream.position;
+              if (stream.getdents && offset === 0 && whence === 0) stream.getdents = null;
+              return 0;
+            } catch (e) {
+              if (typeof FS === "undefined" || !(e instanceof FS.ErrnoError)) abort(e);
+              return -e.errno;
+            }
+          }
+          function ___syscall145(which, varargs) {
+            SYSCALLS.varargs = varargs;
+            try {
+              var stream = SYSCALLS.getStreamFromFD(),
+                iov = SYSCALLS.get(),
+                iovcnt = SYSCALLS.get();
+              return SYSCALLS.doReadv(stream, iov, iovcnt);
+            } catch (e) {
+              if (typeof FS === "undefined" || !(e instanceof FS.ErrnoError)) abort(e);
+              return -e.errno;
+            }
+          }
+          function ___syscall146(which, varargs) {
+            SYSCALLS.varargs = varargs;
+            try {
+              var stream = SYSCALLS.getStreamFromFD(),
+                iov = SYSCALLS.get(),
+                iovcnt = SYSCALLS.get();
+              return SYSCALLS.doWritev(stream, iov, iovcnt);
+            } catch (e) {
+              if (typeof FS === "undefined" || !(e instanceof FS.ErrnoError)) abort(e);
+              return -e.errno;
+            }
+          }
+          function ___syscall192(which, varargs) {
+            SYSCALLS.varargs = varargs;
+            try {
+              var addr = SYSCALLS.get(),
+                len = SYSCALLS.get(),
+                prot = SYSCALLS.get(),
+                flags = SYSCALLS.get(),
+                fd = SYSCALLS.get(),
+                off = SYSCALLS.get();
+              off <<= 12;
+              var ptr;
+              var allocated = false;
+              if (fd === -1) {
+                ptr = _memalign(PAGE_SIZE, len);
+                if (!ptr) return -ERRNO_CODES.ENOMEM;
+                _memset(ptr, 0, len);
+                allocated = true;
+              } else {
+                var info = FS.getStream(fd);
+                if (!info) return -ERRNO_CODES.EBADF;
+                var res = FS.mmap(info, HEAPU8, addr, len, off, prot, flags);
+                ptr = res.ptr;
+                allocated = res.allocated;
+              }
+              SYSCALLS.mappings[ptr] = { malloc: ptr, len: len, allocated: allocated, fd: fd, flags: flags };
+              return ptr;
+            } catch (e) {
+              if (typeof FS === "undefined" || !(e instanceof FS.ErrnoError)) abort(e);
+              return -e.errno;
+            }
+          }
+          function ___syscall195(which, varargs) {
+            SYSCALLS.varargs = varargs;
+            try {
+              var path = SYSCALLS.getStr(),
+                buf = SYSCALLS.get();
+              return SYSCALLS.doStat(FS.stat, path, buf);
+            } catch (e) {
+              if (typeof FS === "undefined" || !(e instanceof FS.ErrnoError)) abort(e);
+              return -e.errno;
+            }
+          }
+          function ___syscall197(which, varargs) {
+            SYSCALLS.varargs = varargs;
+            try {
+              var stream = SYSCALLS.getStreamFromFD(),
+                buf = SYSCALLS.get();
+              return SYSCALLS.doStat(FS.stat, stream.path, buf);
+            } catch (e) {
+              if (typeof FS === "undefined" || !(e instanceof FS.ErrnoError)) abort(e);
+              return -e.errno;
+            }
+          }
+          var PROCINFO = { ppid: 1, pid: 42, sid: 42, pgid: 42 };
+          function ___syscall20(which, varargs) {
+            SYSCALLS.varargs = varargs;
+            try {
+              return PROCINFO.pid;
+            } catch (e) {
+              if (typeof FS === "undefined" || !(e instanceof FS.ErrnoError)) abort(e);
+              return -e.errno;
+            }
+          }
+          function ___syscall221(which, varargs) {
+            SYSCALLS.varargs = varargs;
+            try {
+              var stream = SYSCALLS.getStreamFromFD(),
+                cmd = SYSCALLS.get();
+              switch (cmd) {
+                case 0: {
+                  var arg = SYSCALLS.get();
+                  if (arg < 0) {
+                    return -ERRNO_CODES.EINVAL;
+                  }
+                  var newStream;
+                  newStream = FS.open(stream.path, stream.flags, 0, arg);
+                  return newStream.fd;
+                }
+                case 1:
+                case 2:
+                  return 0;
+                case 3:
+                  return stream.flags;
+                case 4: {
+                  var arg = SYSCALLS.get();
+                  stream.flags |= arg;
+                  return 0;
+                }
+                case 12:
+                case 12: {
+                  var arg = SYSCALLS.get();
+                  var offset = 0;
+                  HEAP16[(arg + offset) >> 1] = 2;
+                  return 0;
+                }
+                case 13:
+                case 14:
+                case 13:
+                case 14:
+                  return 0;
+                case 16:
+                case 8:
+                  return -ERRNO_CODES.EINVAL;
+                case 9:
+                  ___setErrNo(ERRNO_CODES.EINVAL);
+                  return -1;
+                default: {
+                  return -ERRNO_CODES.EINVAL;
+                }
+              }
+            } catch (e) {
+              if (typeof FS === "undefined" || !(e instanceof FS.ErrnoError)) abort(e);
+              return -e.errno;
+            }
+          }
+          function ___syscall3(which, varargs) {
+            SYSCALLS.varargs = varargs;
+            try {
+              var stream = SYSCALLS.getStreamFromFD(),
+                buf = SYSCALLS.get(),
+                count = SYSCALLS.get();
+              return FS.read(stream, HEAP8, buf, count);
+            } catch (e) {
+              if (typeof FS === "undefined" || !(e instanceof FS.ErrnoError)) abort(e);
+              return -e.errno;
+            }
+          }
+          function ___syscall33(which, varargs) {
+            SYSCALLS.varargs = varargs;
+            try {
+              var path = SYSCALLS.getStr(),
+                amode = SYSCALLS.get();
+              return SYSCALLS.doAccess(path, amode);
+            } catch (e) {
+              if (typeof FS === "undefined" || !(e instanceof FS.ErrnoError)) abort(e);
+              return -e.errno;
+            }
+          }
+          function ___syscall5(which, varargs) {
+            SYSCALLS.varargs = varargs;
+            try {
+              var pathname = SYSCALLS.getStr(),
+                flags = SYSCALLS.get(),
+                mode = SYSCALLS.get();
+              var stream = FS.open(pathname, flags, mode);
+              return stream.fd;
+            } catch (e) {
+              if (typeof FS === "undefined" || !(e instanceof FS.ErrnoError)) abort(e);
+              return -e.errno;
+            }
+          }
+          function ___syscall54(which, varargs) {
+            SYSCALLS.varargs = varargs;
+            try {
+              var stream = SYSCALLS.getStreamFromFD(),
+                op = SYSCALLS.get();
+              switch (op) {
+                case 21509:
+                case 21505: {
+                  if (!stream.tty) return -ERRNO_CODES.ENOTTY;
+                  return 0;
+                }
+                case 21510:
+                case 21511:
+                case 21512:
+                case 21506:
+                case 21507:
+                case 21508: {
+                  if (!stream.tty) return -ERRNO_CODES.ENOTTY;
+                  return 0;
+                }
+                case 21519: {
+                  if (!stream.tty) return -ERRNO_CODES.ENOTTY;
+                  var argp = SYSCALLS.get();
+                  HEAP32[argp >> 2] = 0;
+                  return 0;
+                }
+                case 21520: {
+                  if (!stream.tty) return -ERRNO_CODES.ENOTTY;
+                  return -ERRNO_CODES.EINVAL;
+                }
+                case 21531: {
+                  var argp = SYSCALLS.get();
+                  return FS.ioctl(stream, op, argp);
+                }
+                case 21523: {
+                  if (!stream.tty) return -ERRNO_CODES.ENOTTY;
+                  return 0;
+                }
+                default:
+                  abort("bad ioctl syscall " + op);
+              }
+            } catch (e) {
+              if (typeof FS === "undefined" || !(e instanceof FS.ErrnoError)) abort(e);
+              return -e.errno;
+            }
+          }
+          function ___syscall6(which, varargs) {
+            SYSCALLS.varargs = varargs;
+            try {
+              var stream = SYSCALLS.getStreamFromFD();
+              FS.close(stream);
+              return 0;
+            } catch (e) {
+              if (typeof FS === "undefined" || !(e instanceof FS.ErrnoError)) abort(e);
+              return -e.errno;
+            }
+          }
+          function ___syscall91(which, varargs) {
+            SYSCALLS.varargs = varargs;
+            try {
+              var addr = SYSCALLS.get(),
+                len = SYSCALLS.get();
+              var info = SYSCALLS.mappings[addr];
+              if (!info) return 0;
+              if (len === info.len) {
+                var stream = FS.getStream(info.fd);
+                SYSCALLS.doMsync(addr, stream, len, info.flags);
+                FS.munmap(stream);
+                SYSCALLS.mappings[addr] = null;
+                if (info.allocated) {
+                  _free(info.malloc);
+                }
+              }
+              return 0;
+            } catch (e) {
+              if (typeof FS === "undefined" || !(e instanceof FS.ErrnoError)) abort(e);
+              return -e.errno;
+            }
+          }
+          var cttz_i8 = allocate(
+            [
+              8, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 5, 0, 1,
+              0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 6, 0, 1, 0, 2, 0,
+              1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 5, 0, 1, 0, 2, 0, 1, 0, 3,
+              0, 1, 0, 2, 0, 1, 0, 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 7, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0,
+              2, 0, 1, 0, 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1,
+              0, 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 6, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4, 0,
+              1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4, 0, 1, 0, 2,
+              0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
+            ],
+            "i8",
+            ALLOC_STATIC
+          );
+          function ___unlock() {}
+          function __exit(status) {
+            Module["exit"](status);
+          }
+          function _exit(status) {
+            __exit(status);
+          }
+          var _environ = STATICTOP;
+          STATICTOP += 16;
+          function ___buildEnvironment(env) {
+            var MAX_ENV_VALUES = 64;
+            var TOTAL_ENV_SIZE = 1024;
+            var poolPtr;
+            var envPtr;
+            if (!___buildEnvironment.called) {
+              ___buildEnvironment.called = true;
+              ENV["USER"] = ENV["LOGNAME"] = "web_user";
+              ENV["PATH"] = "/";
+              ENV["PWD"] = "/";
+              ENV["HOME"] = "/home/web_user";
+              ENV["LANG"] = "C.UTF-8";
+              ENV["_"] = Module["thisProgram"];
+              poolPtr = staticAlloc(TOTAL_ENV_SIZE);
+              envPtr = staticAlloc(MAX_ENV_VALUES * 4);
+              HEAP32[envPtr >> 2] = poolPtr;
+              HEAP32[_environ >> 2] = envPtr;
+            } else {
+              envPtr = HEAP32[_environ >> 2];
+              poolPtr = HEAP32[envPtr >> 2];
+            }
+            var strings = [];
+            var totalSize = 0;
+            for (var key in env) {
+              if (typeof env[key] === "string") {
+                var line = key + "=" + env[key];
+                strings.push(line);
+                totalSize += line.length;
+              }
+            }
+            if (totalSize > TOTAL_ENV_SIZE) {
+              throw new Error("Environment size exceeded TOTAL_ENV_SIZE!");
+            }
+            var ptrSize = 4;
+            for (var i = 0; i < strings.length; i++) {
+              var line = strings[i];
+              writeAsciiToMemory(line, poolPtr);
+              HEAP32[(envPtr + i * ptrSize) >> 2] = poolPtr;
+              poolPtr += line.length + 1;
+            }
+            HEAP32[(envPtr + strings.length * ptrSize) >> 2] = 0;
+          }
+          var ENV = {};
+          function _getenv(name) {
+            if (name === 0) return 0;
+            name = Pointer_stringify(name);
+            if (!ENV.hasOwnProperty(name)) return 0;
+            if (_getenv.ret) _free(_getenv.ret);
+            _getenv.ret = allocateUTF8(ENV[name]);
+            return _getenv.ret;
+          }
+          function _gettimeofday(ptr) {
+            var now = Date.now();
+            HEAP32[ptr >> 2] = (now / 1e3) | 0;
+            HEAP32[(ptr + 4) >> 2] = ((now % 1e3) * 1e3) | 0;
+            return 0;
+          }
+          var _llvm_ceil_f64 = Math_ceil;
+          var _llvm_fabs_f32 = Math_abs;
+          var _llvm_fabs_f64 = Math_abs;
+          var _llvm_floor_f64 = Math_floor;
+          var _llvm_pow_f64 = Math_pow;
+          var _llvm_sqrt_f32 = Math_sqrt;
+          var _llvm_sqrt_f64 = Math_sqrt;
+          function _llvm_trap() {
+            abort("trap!");
+          }
+          function _longjmp(env, value) {
+            Module["setThrew"](env, value || 1);
+            throw "longjmp";
+          }
+          function _emscripten_memcpy_big(dest, src, num) {
+            HEAPU8.set(HEAPU8.subarray(src, src + num), dest);
+            return dest;
+          }
+          function _setenv(envname, envval, overwrite) {
+            if (envname === 0) {
+              ___setErrNo(ERRNO_CODES.EINVAL);
+              return -1;
+            }
+            var name = Pointer_stringify(envname);
+            var val = Pointer_stringify(envval);
+            if (name === "" || name.indexOf("=") !== -1) {
+              ___setErrNo(ERRNO_CODES.EINVAL);
+              return -1;
+            }
+            if (ENV.hasOwnProperty(name) && !overwrite) return 0;
+            ENV[name] = val;
+            ___buildEnvironment(ENV);
+            return 0;
+          }
+          function _time(ptr) {
+            var ret = (Date.now() / 1e3) | 0;
+            if (ptr) {
+              HEAP32[ptr >> 2] = ret;
+            }
+            return ret;
+          }
+          function _times(buffer) {
+            if (buffer !== 0) {
+              _memset(buffer, 0, 16);
+            }
+            return 0;
+          }
+          if (ENVIRONMENT_IS_NODE) {
+            _emscripten_get_now = function _emscripten_get_now_actual() {
+              var t = process["hrtime"]();
+              return t[0] * 1e3 + t[1] / 1e6;
+            };
+          } else if (typeof dateNow !== "undefined") {
+            _emscripten_get_now = dateNow;
+          } else if (
+            typeof self === "object" &&
+            self["performance"] &&
+            typeof self["performance"]["now"] === "function"
+          ) {
+            _emscripten_get_now = function () {
+              return self["performance"]["now"]();
+            };
+          } else if (typeof performance === "object" && typeof performance["now"] === "function") {
+            _emscripten_get_now = function () {
+              return performance["now"]();
+            };
+          } else {
+            _emscripten_get_now = Date.now;
+          }
+          FS.staticInit();
+          __ATINIT__.unshift(function () {
+            if (!Module["noFSInit"] && !FS.init.initialized) FS.init();
+          });
+          __ATMAIN__.push(function () {
+            FS.ignorePermissions = false;
+          });
+          __ATEXIT__.push(function () {
+            FS.quit();
+          });
+          __ATINIT__.unshift(function () {
+            TTY.init();
+          });
+          __ATEXIT__.push(function () {
+            TTY.shutdown();
+          });
+          if (ENVIRONMENT_IS_NODE) {
+            var fs = require("fs");
+            var NODEJS_PATH = require("path");
+            NODEFS.staticInit();
+          }
+          ___buildEnvironment(ENV);
+          DYNAMICTOP_PTR = staticAlloc(4);
+          STACK_BASE = STACKTOP = alignMemory(STATICTOP);
+          STACK_MAX = STACK_BASE + TOTAL_STACK;
+          DYNAMIC_BASE = alignMemory(STACK_MAX);
+          HEAP32[DYNAMICTOP_PTR >> 2] = DYNAMIC_BASE;
+          staticSealed = true;
+          var ASSERTIONS = false;
+          function intArrayFromString(stringy, dontAddNull, length) {
+            var len = length > 0 ? length : lengthBytesUTF8(stringy) + 1;
+            var u8array = new Array(len);
+            var numBytesWritten = stringToUTF8Array(stringy, u8array, 0, u8array.length);
+            if (dontAddNull) u8array.length = numBytesWritten;
+            return u8array;
+          }
+          function intArrayToString(array) {
+            var ret = [];
+            for (var i = 0; i < array.length; i++) {
+              var chr = array[i];
+              if (chr > 255) {
+                if (ASSERTIONS) {
+                  assert(
+                    false,
+                    "Character code " +
+                      chr +
+                      " (" +
+                      String.fromCharCode(chr) +
+                      ")  at offset " +
+                      i +
+                      " not in 0x00-0xFF."
+                  );
+                }
+                chr &= 255;
+              }
+              ret.push(String.fromCharCode(chr));
+            }
+            return ret.join("");
+          }
+          var decodeBase64 =
+            typeof atob === "function"
+              ? atob
+              : function (input) {
+                  var keyStr = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
+                  var output = "";
+                  var chr1, chr2, chr3;
+                  var enc1, enc2, enc3, enc4;
+                  var i = 0;
+                  input = input.replace(/[^A-Za-z0-9\+\/\=]/g, "");
+                  do {
+                    enc1 = keyStr.indexOf(input.charAt(i++));
+                    enc2 = keyStr.indexOf(input.charAt(i++));
+                    enc3 = keyStr.indexOf(input.charAt(i++));
+                    enc4 = keyStr.indexOf(input.charAt(i++));
+                    chr1 = (enc1 << 2) | (enc2 >> 4);
+                    chr2 = ((enc2 & 15) << 4) | (enc3 >> 2);
+                    chr3 = ((enc3 & 3) << 6) | enc4;
+                    output = output + String.fromCharCode(chr1);
+                    if (enc3 !== 64) {
+                      output = output + String.fromCharCode(chr2);
+                    }
+                    if (enc4 !== 64) {
+                      output = output + String.fromCharCode(chr3);
+                    }
+                  } while (i < input.length);
+                  return output;
+                };
+          function intArrayFromBase64(s) {
+            if (typeof ENVIRONMENT_IS_NODE === "boolean" && ENVIRONMENT_IS_NODE) {
+              var buf;
+              try {
+                buf = Buffer.from(s, "base64");
+              } catch (_) {
+                buf = new Buffer(s, "base64");
+              }
+              return new Uint8Array(buf.buffer, buf.byteOffset, buf.byteLength);
+            }
+            try {
+              var decoded = decodeBase64(s);
+              var bytes = new Uint8Array(decoded.length);
+              for (var i = 0; i < decoded.length; ++i) {
+                bytes[i] = decoded.charCodeAt(i);
+              }
+              return bytes;
+            } catch (_) {
+              throw new Error("Converting base64 string to bytes failed.");
+            }
+          }
+          function tryParseAsDataURI(filename) {
+            if (!isDataURI(filename)) {
+              return;
+            }
+            return intArrayFromBase64(filename.slice(dataURIPrefix.length));
+          }
+          function invoke_d(index) {
+            try {
+              return Module["dynCall_d"](index);
+            } catch (e) {
+              if (typeof e !== "number" && e !== "longjmp") throw e;
+              Module["setThrew"](1, 0);
+            }
+          }
+          function invoke_dddd(index, a1, a2, a3) {
+            try {
+              return Module["dynCall_dddd"](index, a1, a2, a3);
+            } catch (e) {
+              if (typeof e !== "number" && e !== "longjmp") throw e;
+              Module["setThrew"](1, 0);
+            }
+          }
+          function invoke_di(index, a1) {
+            try {
+              return Module["dynCall_di"](index, a1);
+            } catch (e) {
+              if (typeof e !== "number" && e !== "longjmp") throw e;
+              Module["setThrew"](1, 0);
+            }
+          }
+          function invoke_i(index) {
+            try {
+              return Module["dynCall_i"](index);
+            } catch (e) {
+              if (typeof e !== "number" && e !== "longjmp") throw e;
+              Module["setThrew"](1, 0);
+            }
+          }
+          function invoke_ii(index, a1) {
+            try {
+              return Module["dynCall_ii"](index, a1);
+            } catch (e) {
+              if (typeof e !== "number" && e !== "longjmp") throw e;
+              Module["setThrew"](1, 0);
+            }
+          }
+          function invoke_iii(index, a1, a2) {
+            try {
+              return Module["dynCall_iii"](index, a1, a2);
+            } catch (e) {
+              if (typeof e !== "number" && e !== "longjmp") throw e;
+              Module["setThrew"](1, 0);
+            }
+          }
+          function invoke_iiidd(index, a1, a2, a3, a4) {
+            try {
+              return Module["dynCall_iiidd"](index, a1, a2, a3, a4);
+            } catch (e) {
+              if (typeof e !== "number" && e !== "longjmp") throw e;
+              Module["setThrew"](1, 0);
+            }
+          }
+          function invoke_iiii(index, a1, a2, a3) {
+            try {
+              return Module["dynCall_iiii"](index, a1, a2, a3);
+            } catch (e) {
+              if (typeof e !== "number" && e !== "longjmp") throw e;
+              Module["setThrew"](1, 0);
+            }
+          }
+          function invoke_iiiii(index, a1, a2, a3, a4) {
+            try {
+              return Module["dynCall_iiiii"](index, a1, a2, a3, a4);
+            } catch (e) {
+              if (typeof e !== "number" && e !== "longjmp") throw e;
+              Module["setThrew"](1, 0);
+            }
+          }
+          function invoke_iiiiii(index, a1, a2, a3, a4, a5) {
+            try {
+              return Module["dynCall_iiiiii"](index, a1, a2, a3, a4, a5);
+            } catch (e) {
+              if (typeof e !== "number" && e !== "longjmp") throw e;
+              Module["setThrew"](1, 0);
+            }
+          }
+          function invoke_iiiiiii(index, a1, a2, a3, a4, a5, a6) {
+            try {
+              return Module["dynCall_iiiiiii"](index, a1, a2, a3, a4, a5, a6);
+            } catch (e) {
+              if (typeof e !== "number" && e !== "longjmp") throw e;
+              Module["setThrew"](1, 0);
+            }
+          }
+          function invoke_iiiiiiiiiii(index, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10) {
+            try {
+              return Module["dynCall_iiiiiiiiiii"](index, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10);
+            } catch (e) {
+              if (typeof e !== "number" && e !== "longjmp") throw e;
+              Module["setThrew"](1, 0);
+            }
+          }
+          function invoke_v(index) {
+            try {
+              Module["dynCall_v"](index);
+            } catch (e) {
+              if (typeof e !== "number" && e !== "longjmp") throw e;
+              Module["setThrew"](1, 0);
+            }
+          }
+          function invoke_vi(index, a1) {
+            try {
+              Module["dynCall_vi"](index, a1);
+            } catch (e) {
+              if (typeof e !== "number" && e !== "longjmp") throw e;
+              Module["setThrew"](1, 0);
+            }
+          }
+          function invoke_vii(index, a1, a2) {
+            try {
+              Module["dynCall_vii"](index, a1, a2);
+            } catch (e) {
+              if (typeof e !== "number" && e !== "longjmp") throw e;
+              Module["setThrew"](1, 0);
+            }
+          }
+          function invoke_viii(index, a1, a2, a3) {
+            try {
+              Module["dynCall_viii"](index, a1, a2, a3);
+            } catch (e) {
+              if (typeof e !== "number" && e !== "longjmp") throw e;
+              Module["setThrew"](1, 0);
+            }
+          }
+          function invoke_viiiddi(index, a1, a2, a3, a4, a5, a6) {
+            try {
+              Module["dynCall_viiiddi"](index, a1, a2, a3, a4, a5, a6);
+            } catch (e) {
+              if (typeof e !== "number" && e !== "longjmp") throw e;
+              Module["setThrew"](1, 0);
+            }
+          }
+          function invoke_viiii(index, a1, a2, a3, a4) {
+            try {
+              Module["dynCall_viiii"](index, a1, a2, a3, a4);
+            } catch (e) {
+              if (typeof e !== "number" && e !== "longjmp") throw e;
+              Module["setThrew"](1, 0);
+            }
+          }
+          function invoke_viiiii(index, a1, a2, a3, a4, a5) {
+            try {
+              Module["dynCall_viiiii"](index, a1, a2, a3, a4, a5);
+            } catch (e) {
+              if (typeof e !== "number" && e !== "longjmp") throw e;
+              Module["setThrew"](1, 0);
+            }
+          }
+          function invoke_viiiiii(index, a1, a2, a3, a4, a5, a6) {
+            try {
+              Module["dynCall_viiiiii"](index, a1, a2, a3, a4, a5, a6);
+            } catch (e) {
+              if (typeof e !== "number" && e !== "longjmp") throw e;
+              Module["setThrew"](1, 0);
+            }
+          }
+          function invoke_viiiiiiiii(index, a1, a2, a3, a4, a5, a6, a7, a8, a9) {
+            try {
+              Module["dynCall_viiiiiiiii"](index, a1, a2, a3, a4, a5, a6, a7, a8, a9);
+            } catch (e) {
+              if (typeof e !== "number" && e !== "longjmp") throw e;
+              Module["setThrew"](1, 0);
+            }
+          }
+          Module.asmGlobalArg = {
+            Math: Math,
+            Int8Array: Int8Array,
+            Int16Array: Int16Array,
+            Int32Array: Int32Array,
+            Uint8Array: Uint8Array,
+            Uint16Array: Uint16Array,
+            Uint32Array: Uint32Array,
+            Float32Array: Float32Array,
+            Float64Array: Float64Array,
+            NaN: NaN,
+            Infinity: Infinity,
+          };
+          Module.asmLibraryArg = {
+            abort: abort,
+            assert: assert,
+            enlargeMemory: enlargeMemory,
+            getTotalMemory: getTotalMemory,
+            abortOnCannotGrowMemory: abortOnCannotGrowMemory,
+            invoke_d: invoke_d,
+            invoke_dddd: invoke_dddd,
+            invoke_di: invoke_di,
+            invoke_i: invoke_i,
+            invoke_ii: invoke_ii,
+            invoke_iii: invoke_iii,
+            invoke_iiidd: invoke_iiidd,
+            invoke_iiii: invoke_iiii,
+            invoke_iiiii: invoke_iiiii,
+            invoke_iiiiii: invoke_iiiiii,
+            invoke_iiiiiii: invoke_iiiiiii,
+            invoke_iiiiiiiiiii: invoke_iiiiiiiiiii,
+            invoke_v: invoke_v,
+            invoke_vi: invoke_vi,
+            invoke_vii: invoke_vii,
+            invoke_viii: invoke_viii,
+            invoke_viiiddi: invoke_viiiddi,
+            invoke_viiii: invoke_viiii,
+            invoke_viiiii: invoke_viiiii,
+            invoke_viiiiii: invoke_viiiiii,
+            invoke_viiiiiiiii: invoke_viiiiiiiii,
+            ___assert_fail: ___assert_fail,
+            ___buildEnvironment: ___buildEnvironment,
+            ___clock_gettime: ___clock_gettime,
+            ___lock: ___lock,
+            ___map_file: ___map_file,
+            ___setErrNo: ___setErrNo,
+            ___syscall10: ___syscall10,
+            ___syscall140: ___syscall140,
+            ___syscall145: ___syscall145,
+            ___syscall146: ___syscall146,
+            ___syscall192: ___syscall192,
+            ___syscall195: ___syscall195,
+            ___syscall197: ___syscall197,
+            ___syscall20: ___syscall20,
+            ___syscall221: ___syscall221,
+            ___syscall3: ___syscall3,
+            ___syscall33: ___syscall33,
+            ___syscall5: ___syscall5,
+            ___syscall54: ___syscall54,
+            ___syscall6: ___syscall6,
+            ___syscall91: ___syscall91,
+            ___unlock: ___unlock,
+            __exit: __exit,
+            _clock_gettime: _clock_gettime,
+            _emscripten_asm_const_iii: _emscripten_asm_const_iii,
+            _emscripten_get_now: _emscripten_get_now,
+            _emscripten_get_now_is_monotonic: _emscripten_get_now_is_monotonic,
+            _emscripten_memcpy_big: _emscripten_memcpy_big,
+            _exit: _exit,
+            _getenv: _getenv,
+            _gettimeofday: _gettimeofday,
+            _llvm_ceil_f64: _llvm_ceil_f64,
+            _llvm_fabs_f32: _llvm_fabs_f32,
+            _llvm_fabs_f64: _llvm_fabs_f64,
+            _llvm_floor_f64: _llvm_floor_f64,
+            _llvm_pow_f64: _llvm_pow_f64,
+            _llvm_sqrt_f32: _llvm_sqrt_f32,
+            _llvm_sqrt_f64: _llvm_sqrt_f64,
+            _llvm_trap: _llvm_trap,
+            _longjmp: _longjmp,
+            _setenv: _setenv,
+            _time: _time,
+            _times: _times,
+            DYNAMICTOP_PTR: DYNAMICTOP_PTR,
+            tempDoublePtr: tempDoublePtr,
+            ABORT: ABORT,
+            STACKTOP: STACKTOP,
+            STACK_MAX: STACK_MAX,
+            cttz_i8: cttz_i8,
+          }; // EMSCRIPTEN_START_ASM
+          var asm = /** @suppress {uselessCode} */ (function (global, env, buffer) {
+            "use asm";
+            var a = new global.Int8Array(buffer);
+            var b = new global.Int16Array(buffer);
+            var c = new global.Int32Array(buffer);
+            var d = new global.Uint8Array(buffer);
+            var e = new global.Uint16Array(buffer);
+            var f = new global.Uint32Array(buffer);
+            var g = new global.Float32Array(buffer);
+            var h = new global.Float64Array(buffer);
+            var i = env.DYNAMICTOP_PTR | 0;
+            var j = env.tempDoublePtr | 0;
+            var k = env.ABORT | 0;
+            var l = env.STACKTOP | 0;
+            var m = env.STACK_MAX | 0;
+            var n = env.cttz_i8 | 0;
+            var o = 0;
+            var p = 0;
+            var q = 0;
+            var r = 0;
+            var s = global.NaN,
+              t = global.Infinity;
+            var u = 0,
+              v = 0,
+              w = 0,
+              x = 0,
+              y = 0.0;
+            var z = 0;
+            var A = global.Math.floor;
+            var B = global.Math.abs;
+            var C = global.Math.sqrt;
+            var D = global.Math.pow;
+            var E = global.Math.cos;
+            var F = global.Math.sin;
+            var G = global.Math.tan;
+            var H = global.Math.acos;
+            var I = global.Math.asin;
+            var J = global.Math.atan;
+            var K = global.Math.atan2;
+            var L = global.Math.exp;
+            var M = global.Math.log;
+            var N = global.Math.ceil;
+            var O = global.Math.imul;
+            var P = global.Math.min;
+            var Q = global.Math.max;
+            var R = global.Math.clz32;
+            var S = env.abort;
+            var T = env.assert;
+            var U = env.enlargeMemory;
+            var V = env.getTotalMemory;
+            var W = env.abortOnCannotGrowMemory;
+            var X = env.invoke_d;
+            var Y = env.invoke_dddd;
+            var Z = env.invoke_di;
+            var _ = env.invoke_i;
+            var $ = env.invoke_ii;
+            var aa = env.invoke_iii;
+            var ba = env.invoke_iiidd;
+            var ca = env.invoke_iiii;
+            var da = env.invoke_iiiii;
+            var ea = env.invoke_iiiiii;
+            var fa = env.invoke_iiiiiii;
+            var ga = env.invoke_iiiiiiiiiii;
+            var ha = env.invoke_v;
+            var ia = env.invoke_vi;
+            var ja = env.invoke_vii;
+            var ka = env.invoke_viii;
+            var la = env.invoke_viiiddi;
+            var ma = env.invoke_viiii;
+            var na = env.invoke_viiiii;
+            var oa = env.invoke_viiiiii;
+            var pa = env.invoke_viiiiiiiii;
+            var qa = env.___assert_fail;
+            var ra = env.___buildEnvironment;
+            var sa = env.___clock_gettime;
+            var ta = env.___lock;
+            var ua = env.___map_file;
+            var va = env.___setErrNo;
+            var wa = env.___syscall10;
+            var xa = env.___syscall140;
+            var ya = env.___syscall145;
+            var za = env.___syscall146;
+            var Aa = env.___syscall192;
+            var Ba = env.___syscall195;
+            var Ca = env.___syscall197;
+            var Da = env.___syscall20;
+            var Ea = env.___syscall221;
+            var Fa = env.___syscall3;
+            var Ga = env.___syscall33;
+            var Ha = env.___syscall5;
+            var Ia = env.___syscall54;
+            var Ja = env.___syscall6;
+            var Ka = env.___syscall91;
+            var La = env.___unlock;
+            var Ma = env.__exit;
+            var Na = env._clock_gettime;
+            var Oa = env._emscripten_asm_const_iii;
+            var Pa = env._emscripten_get_now;
+            var Qa = env._emscripten_get_now_is_monotonic;
+            var Ra = env._emscripten_memcpy_big;
+            var Sa = env._exit;
+            var Ta = env._getenv;
+            var Ua = env._gettimeofday;
+            var Va = env._llvm_ceil_f64;
+            var Wa = env._llvm_fabs_f32;
+            var Xa = env._llvm_fabs_f64;
+            var Ya = env._llvm_floor_f64;
+            var Za = env._llvm_pow_f64;
+            var _a = env._llvm_sqrt_f32;
+            var $a = env._llvm_sqrt_f64;
+            var ab = env._llvm_trap;
+            var bb = env._longjmp;
+            var cb = env._setenv;
+            var db = env._time;
+            var eb = env._times;
+            var fb = 0.0;
+            // EMSCRIPTEN_START_FUNCS
+            function rQ(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                A = 0;
+              y = l;
+              l = (l + 16) | 0;
+              j = (y + 8) | 0;
+              x = 4;
+              w = T1(40) | 0;
+              c[w >> 2] = 0;
+              s = y;
+              o = 0;
+              e = $(29, b | 0) | 0;
+              f = o;
+              o = 0;
+              if (((f | 0) != 0) & ((p | 0) != 0)) {
+                g = V6(c[f >> 2] | 0, w | 0, x | 0) | 0;
+                if (!g) bb(f | 0, p | 0);
+                z = p;
+              } else g = -1;
+              a: do
+                if ((g | 0) != 1) {
+                  o = 0;
+                  v = $(23, (e << 3) | 0) | 0;
+                  f = o;
+                  o = 0;
+                  if (((f | 0) != 0) & ((p | 0) != 0)) {
+                    e = V6(c[f >> 2] | 0, w | 0, x | 0) | 0;
+                    if (!e) bb(f | 0, p | 0);
+                    z = p;
+                  } else e = -1;
+                  if ((e | 0) != 1) {
+                    if (!(a[194954] | 0)) t = 0;
+                    else {
+                      o = 0;
+                      e = _(3) | 0;
+                      f = o;
+                      o = 0;
+                      if (((f | 0) != 0) & ((p | 0) != 0)) {
+                        g = V6(c[f >> 2] | 0, w | 0, x | 0) | 0;
+                        if (!g) bb(f | 0, p | 0);
+                        z = p;
+                      } else g = -1;
+                      if ((g | 0) == 1) {
+                        n = 0;
+                        k = 0;
+                        m = 0;
+                        j = 0;
+                        i = 0;
+                        d = v;
+                        h = v;
+                        e = z;
+                        g = 0;
+                        u = 74;
+                        break;
+                      }
+                      t = e;
+                    }
+                    o = 0;
+                    e = aa(97, b | 0, 110064) | 0;
+                    f = o;
+                    o = 0;
+                    if (((f | 0) != 0) & ((p | 0) != 0)) {
+                      g = V6(c[f >> 2] | 0, w | 0, x | 0) | 0;
+                      if (!g) bb(f | 0, p | 0);
+                      z = p;
+                    } else g = -1;
+                    if ((g | 0) != 1) {
+                      c[47323] = 0;
+                      b: do
+                        if (e | 0 ? ((i = a[e >> 0] | 0), (i << 24) >> 24) : 0) {
+                          h = e;
+                          f = i;
+                          g = 0;
+                          while (1) {
+                            i = (h + 1) | 0;
+                            if (!((f << 24) >> 24)) break b;
+                            switch (((f << 24) >> 24) | 0) {
+                              case 99: {
+                                e = 8;
+                                u = 16;
+                                break;
+                              }
+                              case 105: {
+                                e = 18;
+                                u = 16;
+                                break;
+                              }
+                              case 109: {
+                                e = 1;
+                                u = 16;
+                                break;
+                              }
+                              case 114: {
+                                e = 4;
+                                u = 16;
+                                break;
+                              }
+                              case 115: {
+                                e = 2;
+                                u = 16;
+                                break;
+                              }
+                              default:
+                                e = g;
+                            }
+                            if ((u | 0) == 16) {
+                              u = 0;
+                              e = g | e;
+                              c[47323] = e;
+                            }
+                            h = i;
+                            f = a[i >> 0] | 0;
+                            g = e;
+                          }
+                        }
+                      while (0);
+                      if (d | 0) {
+                        o = 0;
+                        ca(20, 0, 110068, j | 0) | 0;
+                        e = o;
+                        o = 0;
+                        if (((e | 0) != 0) & ((p | 0) != 0)) {
+                          f = V6(c[e >> 2] | 0, w | 0, x | 0) | 0;
+                          if (!f) bb(e | 0, p | 0);
+                          z = p;
+                        } else f = -1;
+                        if ((f | 0) == 1) {
+                          n = 0;
+                          k = t;
+                          m = 0;
+                          j = 0;
+                          i = 0;
+                          d = v;
+                          h = v;
+                          e = z;
+                          g = 0;
+                          u = 74;
+                          break;
+                        }
+                      }
+                      o = 0;
+                      r = aa(98, b | 0, 0) | 0;
+                      e = o;
+                      o = 0;
+                      if (((e | 0) != 0) & ((p | 0) != 0)) {
+                        f = V6(c[e >> 2] | 0, w | 0, x | 0) | 0;
+                        if (!f) bb(e | 0, p | 0);
+                        z = p;
+                      } else f = -1;
+                      if ((f | 0) != 1) {
+                        m = c[(r + 16) >> 2] | 0;
+                        if ((c[47323] & 2) | 0) {
+                          o = 0;
+                          ja(26, c[15712] | 0, m | 0);
+                          e = o;
+                          o = 0;
+                          if (((e | 0) != 0) & ((p | 0) != 0)) {
+                            f = V6(c[e >> 2] | 0, w | 0, x | 0) | 0;
+                            if (!f) bb(e | 0, p | 0);
+                            z = p;
+                          } else f = -1;
+                          if ((f | 0) == 1) {
+                            n = 0;
+                            k = t;
+                            m = 0;
+                            j = 0;
+                            i = r;
+                            d = v;
+                            h = v;
+                            e = z;
+                            g = 0;
+                            u = 74;
+                            break;
+                          }
+                        }
+                        o = 0;
+                        g = $(25, b | 0) | 0;
+                        e = o;
+                        o = 0;
+                        if (((e | 0) != 0) & ((p | 0) != 0)) {
+                          f = V6(c[e >> 2] | 0, w | 0, x | 0) | 0;
+                          if (!f) bb(e | 0, p | 0);
+                          z = p;
+                        } else f = -1;
+                        if ((f | 0) != 1) {
+                          n = 0;
+                          while (1) {
+                            if (!g) break;
+                            o = 0;
+                            e = aa(99, b | 0, g | 0) | 0;
+                            f = o;
+                            o = 0;
+                            if (((f | 0) != 0) & ((p | 0) != 0)) {
+                              h = V6(c[f >> 2] | 0, w | 0, x | 0) | 0;
+                              if (!h) bb(f | 0, p | 0);
+                              z = p;
+                            } else h = -1;
+                            if ((h | 0) == 1) {
+                              k = t;
+                              m = 0;
+                              j = 0;
+                              i = r;
+                              d = v;
+                              h = v;
+                              e = z;
+                              g = 0;
+                              u = 74;
+                              break a;
+                            }
+                            i = n;
+                            while (1) {
+                              if (!e) break;
+                              if (!((c[47134] | 0) == 2 ? (c[((c[(e + 16) >> 2] | 0) + 8) >> 2] | 0) != 0 : 0)) u = 32;
+                              c: do
+                                if ((u | 0) == 32) {
+                                  u = 0;
+                                  do
+                                    if (a[194954] | 0) {
+                                      k = c[e >> 2] & 3;
+                                      j = (c[c[(((k | 0) == 3 ? e : (e + 48) | 0) + 40) >> 2] >> 2] | 0) >>> 4;
+                                      k = (c[c[(((k | 0) == 2 ? e : (e + -48) | 0) + 40) >> 2] >> 2] | 0) >>> 4;
+                                      if (j >>> 0 > k >>> 0) {
+                                        o = 0;
+                                        f = ca(34, t | 0, k | 0, j | 0) | 0;
+                                        h = o;
+                                        o = 0;
+                                        if (((h | 0) != 0) & ((p | 0) != 0)) {
+                                          d = V6(c[h >> 2] | 0, w | 0, x | 0) | 0;
+                                          if (!d) bb(h | 0, p | 0);
+                                          z = p;
+                                        } else d = -1;
+                                        if ((d | 0) == 1) {
+                                          k = t;
+                                          m = 0;
+                                          j = 0;
+                                          i = r;
+                                          d = v;
+                                          h = v;
+                                          e = z;
+                                          g = 0;
+                                          u = 74;
+                                          break a;
+                                        }
+                                        if (f | 0) break c;
+                                        o = 0;
+                                        ka(64, t | 0, k | 0, j | 0);
+                                        f = o;
+                                        o = 0;
+                                        if (((f | 0) != 0) & ((p | 0) != 0)) {
+                                          h = V6(c[f >> 2] | 0, w | 0, x | 0) | 0;
+                                          if (!h) bb(f | 0, p | 0);
+                                          z = p;
+                                        } else h = -1;
+                                        if ((h | 0) == 1) {
+                                          k = t;
+                                          m = 0;
+                                          j = 0;
+                                          i = r;
+                                          d = v;
+                                          h = v;
+                                          e = z;
+                                          g = 0;
+                                          u = 74;
+                                          break a;
+                                        }
+                                        break;
+                                      } else {
+                                        o = 0;
+                                        f = ca(34, t | 0, j | 0, k | 0) | 0;
+                                        h = o;
+                                        o = 0;
+                                        if (((h | 0) != 0) & ((p | 0) != 0)) {
+                                          d = V6(c[h >> 2] | 0, w | 0, x | 0) | 0;
+                                          if (!d) bb(h | 0, p | 0);
+                                          z = p;
+                                        } else d = -1;
+                                        if ((d | 0) == 1) {
+                                          k = t;
+                                          m = 0;
+                                          j = 0;
+                                          i = r;
+                                          d = v;
+                                          h = v;
+                                          e = z;
+                                          g = 0;
+                                          u = 74;
+                                          break a;
+                                        }
+                                        if (f | 0) break c;
+                                        o = 0;
+                                        ka(64, t | 0, j | 0, k | 0);
+                                        f = o;
+                                        o = 0;
+                                        if (((f | 0) != 0) & ((p | 0) != 0)) {
+                                          h = V6(c[f >> 2] | 0, w | 0, x | 0) | 0;
+                                          if (!h) bb(f | 0, p | 0);
+                                          z = p;
+                                        } else h = -1;
+                                        if ((h | 0) == 1) {
+                                          k = t;
+                                          m = 0;
+                                          j = 0;
+                                          i = r;
+                                          d = v;
+                                          h = v;
+                                          e = z;
+                                          g = 0;
+                                          u = 74;
+                                          break a;
+                                        }
+                                        break;
+                                      }
+                                    }
+                                  while (0);
+                                  c[(v + (i << 3) + 4) >> 2] = e;
+                                  o = 0;
+                                  d = $(30, e | 0) | 0;
+                                  f = o;
+                                  o = 0;
+                                  if (((f | 0) != 0) & ((p | 0) != 0)) {
+                                    h = V6(c[f >> 2] | 0, w | 0, x | 0) | 0;
+                                    if (!h) bb(f | 0, p | 0);
+                                    z = p;
+                                  } else h = -1;
+                                  if ((h | 0) == 1) {
+                                    k = t;
+                                    m = 0;
+                                    j = 0;
+                                    i = r;
+                                    d = v;
+                                    h = v;
+                                    e = z;
+                                    g = 0;
+                                    u = 74;
+                                    break a;
+                                  }
+                                  c[(v + (i << 3)) >> 2] = d;
+                                  i = (i + 1) | 0;
+                                }
+                              while (0);
+                              o = 0;
+                              e = aa(100, b | 0, e | 0) | 0;
+                              f = o;
+                              o = 0;
+                              if (((f | 0) != 0) & ((p | 0) != 0)) {
+                                h = V6(c[f >> 2] | 0, w | 0, x | 0) | 0;
+                                if (!h) bb(f | 0, p | 0);
+                                z = p;
+                              } else h = -1;
+                              if ((h | 0) == 1) {
+                                k = t;
+                                m = 0;
+                                j = 0;
+                                i = r;
+                                d = v;
+                                h = v;
+                                e = z;
+                                g = 0;
+                                u = 74;
+                                break a;
+                              }
+                            }
+                            o = 0;
+                            g = aa(86, b | 0, g | 0) | 0;
+                            e = o;
+                            o = 0;
+                            if (((e | 0) != 0) & ((p | 0) != 0)) {
+                              f = V6(c[e >> 2] | 0, w | 0, x | 0) | 0;
+                              if (!f) bb(e | 0, p | 0);
+                              z = p;
+                            } else f = -1;
+                            if ((f | 0) == 1) {
+                              k = t;
+                              m = 0;
+                              j = 0;
+                              i = r;
+                              d = v;
+                              h = v;
+                              e = z;
+                              g = 0;
+                              u = 74;
+                              break a;
+                            }
+                            n = i;
+                          }
+                          o = 0;
+                          j = $(31, (n << 3) | 0) | 0;
+                          e = o;
+                          o = 0;
+                          if (((e | 0) != 0) & ((p | 0) != 0)) {
+                            f = V6(c[e >> 2] | 0, w | 0, x | 0) | 0;
+                            if (!f) bb(e | 0, p | 0);
+                            z = p;
+                          } else f = -1;
+                          if ((f | 0) != 1) {
+                            o = 0;
+                            ma(28, v | 0, n | 0, 8, 101);
+                            e = o;
+                            o = 0;
+                            if (((e | 0) != 0) & ((p | 0) != 0)) {
+                              f = V6(c[e >> 2] | 0, w | 0, x | 0) | 0;
+                              if (!f) bb(e | 0, p | 0);
+                              z = p;
+                            } else f = -1;
+                            if ((f | 0) != 1) {
+                              g = c[m >> 2] | 0;
+                              o = 0;
+                              ia(110, (g + 2) | 0);
+                              e = o;
+                              o = 0;
+                              if (((e | 0) != 0) & ((p | 0) != 0)) {
+                                f = V6(c[e >> 2] | 0, w | 0, x | 0) | 0;
+                                if (!f) bb(e | 0, p | 0);
+                                z = p;
+                              } else f = -1;
+                              if ((f | 0) != 1) {
+                                i = c[(m + 16) >> 2] | 0;
+                                d = (i + ((g * 40) | 0)) | 0;
+                                i = (i + ((((g + 1) | 0) * 40) | 0)) | 0;
+                                q = c[15712] | 0;
+                                h = 0;
+                                while (1) {
+                                  if ((h | 0) >= (n | 0)) break;
+                                  if ((h | 0) > 0 ? (c[47323] & 16) | 0 : 0) {
+                                    o = 0;
+                                    ja(26, q | 0, m | 0);
+                                    e = o;
+                                    o = 0;
+                                    if (((e | 0) != 0) & ((p | 0) != 0)) {
+                                      f = V6(c[e >> 2] | 0, w | 0, x | 0) | 0;
+                                      if (!f) bb(e | 0, p | 0);
+                                      z = p;
+                                    } else f = -1;
+                                    if ((f | 0) == 1) {
+                                      k = t;
+                                      m = j;
+                                      i = r;
+                                      d = v;
+                                      h = v;
+                                      e = z;
+                                      g = q;
+                                      u = 74;
+                                      break a;
+                                    }
+                                  }
+                                  e = c[(v + (h << 3) + 4) >> 2] | 0;
+                                  k = c[e >> 2] & 3;
+                                  g =
+                                    c[
+                                      ((c[((c[(((k | 0) == 3 ? e : (e + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                                        112) >>
+                                        2
+                                    ] | 0;
+                                  e =
+                                    c[
+                                      ((c[((c[(((k | 0) == 2 ? e : (e + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                                        112) >>
+                                        2
+                                    ] | 0;
+                                  if ((g | 0) == (e | 0)) {
+                                    o = 0;
+                                    ma(29, m | 0, g | 0, i | 0, d | 0);
+                                    e = o;
+                                    o = 0;
+                                    if (((e | 0) != 0) & ((p | 0) != 0)) {
+                                      f = V6(c[e >> 2] | 0, w | 0, x | 0) | 0;
+                                      if (!f) bb(e | 0, p | 0);
+                                      z = p;
+                                    } else f = -1;
+                                    if ((f | 0) == 1) {
+                                      k = t;
+                                      m = j;
+                                      i = r;
+                                      d = v;
+                                      h = v;
+                                      e = z;
+                                      g = q;
+                                      u = 74;
+                                      break a;
+                                    }
+                                  } else {
+                                    o = 0;
+                                    ka(65, m | 0, e | 0, i | 0);
+                                    e = o;
+                                    o = 0;
+                                    if (((e | 0) != 0) & ((p | 0) != 0)) {
+                                      f = V6(c[e >> 2] | 0, w | 0, x | 0) | 0;
+                                      if (!f) bb(e | 0, p | 0);
+                                      z = p;
+                                    } else f = -1;
+                                    if ((f | 0) == 1) {
+                                      k = t;
+                                      m = j;
+                                      i = r;
+                                      d = v;
+                                      h = v;
+                                      e = z;
+                                      g = q;
+                                      u = 74;
+                                      break a;
+                                    }
+                                    o = 0;
+                                    ka(65, m | 0, g | 0, d | 0);
+                                    e = o;
+                                    o = 0;
+                                    if (((e | 0) != 0) & ((p | 0) != 0)) {
+                                      f = V6(c[e >> 2] | 0, w | 0, x | 0) | 0;
+                                      if (!f) bb(e | 0, p | 0);
+                                      z = p;
+                                    } else f = -1;
+                                    if ((f | 0) == 1) {
+                                      k = t;
+                                      m = j;
+                                      i = r;
+                                      d = v;
+                                      h = v;
+                                      e = z;
+                                      g = q;
+                                      u = 74;
+                                      break a;
+                                    }
+                                  }
+                                  o = 0;
+                                  e = ca(35, m | 0, i | 0, d | 0) | 0;
+                                  f = o;
+                                  o = 0;
+                                  if (((f | 0) != 0) & ((p | 0) != 0)) {
+                                    g = V6(c[f >> 2] | 0, w | 0, x | 0) | 0;
+                                    if (!g) bb(f | 0, p | 0);
+                                    z = p;
+                                  } else g = -1;
+                                  if ((g | 0) == 1) {
+                                    k = t;
+                                    m = j;
+                                    i = r;
+                                    d = v;
+                                    h = v;
+                                    e = z;
+                                    g = q;
+                                    u = 74;
+                                    break a;
+                                  }
+                                  if (e | 0) {
+                                    k = t;
+                                    m = j;
+                                    i = r;
+                                    d = v;
+                                    h = v;
+                                    break a;
+                                  }
+                                  e = (j + (h << 3)) | 0;
+                                  o = 0;
+                                  ma(30, s | 0, m | 0, d | 0, i | 0);
+                                  f = o;
+                                  o = 0;
+                                  if (((f | 0) != 0) & ((p | 0) != 0)) {
+                                    g = V6(c[f >> 2] | 0, w | 0, x | 0) | 0;
+                                    if (!g) bb(f | 0, p | 0);
+                                    z = p;
+                                  } else g = -1;
+                                  if ((g | 0) == 1) {
+                                    k = t;
+                                    m = j;
+                                    i = r;
+                                    d = v;
+                                    h = v;
+                                    e = z;
+                                    g = q;
+                                    u = 74;
+                                    break a;
+                                  }
+                                  g = s;
+                                  k = c[(g + 4) >> 2] | 0;
+                                  c[e >> 2] = c[g >> 2];
+                                  c[(e + 4) >> 2] = k;
+                                  o = 0;
+                                  ia(111, m | 0);
+                                  e = o;
+                                  o = 0;
+                                  if (((e | 0) != 0) & ((p | 0) != 0)) {
+                                    f = V6(c[e >> 2] | 0, w | 0, x | 0) | 0;
+                                    if (!f) bb(e | 0, p | 0);
+                                    z = p;
+                                  } else f = -1;
+                                  if ((f | 0) == 1) {
+                                    k = t;
+                                    m = j;
+                                    i = r;
+                                    d = v;
+                                    h = v;
+                                    e = z;
+                                    g = q;
+                                    u = 74;
+                                    break a;
+                                  }
+                                  h = (h + 1) | 0;
+                                }
+                                o = 0;
+                                ha(8);
+                                e = o;
+                                o = 0;
+                                if (((e | 0) != 0) & ((p | 0) != 0)) {
+                                  f = V6(c[e >> 2] | 0, w | 0, x | 0) | 0;
+                                  if (!f) bb(e | 0, p | 0);
+                                  z = p;
+                                } else f = -1;
+                                if ((f | 0) != 1) {
+                                  o = 0;
+                                  e = $(32, r | 0) | 0;
+                                  f = o;
+                                  o = 0;
+                                  if (((f | 0) != 0) & ((p | 0) != 0)) {
+                                    g = V6(c[f >> 2] | 0, w | 0, x | 0) | 0;
+                                    if (!g) bb(f | 0, p | 0);
+                                    z = p;
+                                  } else g = -1;
+                                  if ((g | 0) != 1) {
+                                    c[(r + 20) >> 2] = e;
+                                    o = 0;
+                                    e = $(33, r | 0) | 0;
+                                    f = o;
+                                    o = 0;
+                                    if (((f | 0) != 0) & ((p | 0) != 0)) {
+                                      g = V6(c[f >> 2] | 0, w | 0, x | 0) | 0;
+                                      if (!g) bb(f | 0, p | 0);
+                                      z = p;
+                                    } else g = -1;
+                                    if ((g | 0) != 1) {
+                                      c[(r + 24) >> 2] = e;
+                                      o = 0;
+                                      ka(66, n | 0, j | 0, r | 0);
+                                      e = o;
+                                      o = 0;
+                                      if (((e | 0) != 0) & ((p | 0) != 0)) {
+                                        f = V6(c[e >> 2] | 0, w | 0, x | 0) | 0;
+                                        if (!f) bb(e | 0, p | 0);
+                                        z = p;
+                                      } else f = -1;
+                                      if ((f | 0) != 1) {
+                                        w = U6(189296, 1, w | 0, x | 0) | 0;
+                                        x = z;
+                                        o = 0;
+                                        e = o;
+                                        o = 0;
+                                        if (((e | 0) != 0) & ((p | 0) != 0)) {
+                                          f = V6(c[e >> 2] | 0, w | 0, x | 0) | 0;
+                                          if (!f) bb(e | 0, p | 0);
+                                          z = p;
+                                        } else f = -1;
+                                        if ((f | 0) != 1) {
+                                          k = t;
+                                          m = j;
+                                          i = r;
+                                          d = v;
+                                          h = v;
+                                          e = 0;
+                                          g = q;
+                                          u = 74;
+                                        } else {
+                                          k = t;
+                                          m = j;
+                                          i = r;
+                                          d = v;
+                                          h = v;
+                                          e = z;
+                                          g = q;
+                                          u = 74;
+                                        }
+                                      } else {
+                                        k = t;
+                                        m = j;
+                                        i = r;
+                                        d = v;
+                                        h = v;
+                                        e = z;
+                                        g = q;
+                                        u = 74;
+                                      }
+                                    } else {
+                                      k = t;
+                                      m = j;
+                                      i = r;
+                                      d = v;
+                                      h = v;
+                                      e = z;
+                                      g = q;
+                                      u = 74;
+                                    }
+                                  } else {
+                                    k = t;
+                                    m = j;
+                                    i = r;
+                                    d = v;
+                                    h = v;
+                                    e = z;
+                                    g = q;
+                                    u = 74;
+                                  }
+                                } else {
+                                  k = t;
+                                  m = j;
+                                  i = r;
+                                  d = v;
+                                  h = v;
+                                  e = z;
+                                  g = q;
+                                  u = 74;
+                                }
+                              } else {
+                                k = t;
+                                m = j;
+                                i = r;
+                                d = v;
+                                h = v;
+                                e = z;
+                                g = 0;
+                                u = 74;
+                              }
+                            } else {
+                              k = t;
+                              m = j;
+                              i = r;
+                              d = v;
+                              h = v;
+                              e = z;
+                              g = 0;
+                              u = 74;
+                            }
+                          } else {
+                            k = t;
+                            m = 0;
+                            i = r;
+                            d = v;
+                            h = v;
+                            e = z;
+                            g = 0;
+                            u = 74;
+                          }
+                        } else {
+                          n = 0;
+                          k = t;
+                          m = 0;
+                          j = 0;
+                          i = r;
+                          d = v;
+                          h = v;
+                          e = z;
+                          g = 0;
+                          u = 74;
+                        }
+                      } else {
+                        n = 0;
+                        k = t;
+                        m = 0;
+                        j = 0;
+                        i = r;
+                        d = v;
+                        h = v;
+                        e = z;
+                        g = 0;
+                        u = 74;
+                      }
+                    } else {
+                      n = 0;
+                      k = t;
+                      m = 0;
+                      j = 0;
+                      i = 0;
+                      d = v;
+                      h = v;
+                      e = z;
+                      g = 0;
+                      u = 74;
+                    }
+                  } else {
+                    n = 0;
+                    k = 0;
+                    m = 0;
+                    j = 0;
+                    i = 0;
+                    d = 0;
+                    h = v;
+                    e = z;
+                    g = 0;
+                    u = 74;
+                  }
+                } else {
+                  n = 0;
+                  k = 0;
+                  m = 0;
+                  j = 0;
+                  i = 0;
+                  d = 0;
+                  h = 0;
+                  e = z;
+                  g = 0;
+                  u = 74;
+                }
+              while (0);
+              d: while (1) {
+                if ((u | 0) == 74) {
+                  u = 0;
+                  if (e | 0) {
+                    q = g;
+                    continue;
+                  }
+                  o = 0;
+                  ia(112, i | 0);
+                  e = o;
+                  o = 0;
+                  if (((e | 0) != 0) & ((p | 0) != 0)) {
+                    f = V6(c[e >> 2] | 0, w | 0, x | 0) | 0;
+                    if (!f) bb(e | 0, p | 0);
+                    z = p;
+                  } else f = -1;
+                  if ((f | 0) == 1) {
+                    A = g;
+                    f = h;
+                    q = d;
+                    r = i;
+                    s = j;
+                    t = m;
+                    v = k;
+                    u = n;
+                    e = z;
+                    g = A;
+                    h = f;
+                    d = q;
+                    i = r;
+                    j = s;
+                    m = t;
+                    k = v;
+                    n = u;
+                    u = 74;
+                    continue;
+                  }
+                  if ((c[47323] & 4) | 0) {
+                    o = 0;
+                    na(8, g | 0, i | 0, n | 0, m | 0, d | 0);
+                    e = o;
+                    o = 0;
+                    if (((e | 0) != 0) & ((p | 0) != 0)) {
+                      f = V6(c[e >> 2] | 0, w | 0, x | 0) | 0;
+                      if (!f) bb(e | 0, p | 0);
+                      z = p;
+                    } else f = -1;
+                    if ((f | 0) == 1) {
+                      f = g;
+                      q = h;
+                      r = d;
+                      s = i;
+                      t = j;
+                      v = m;
+                      A = k;
+                      u = n;
+                      e = z;
+                      g = f;
+                      h = q;
+                      d = r;
+                      i = s;
+                      j = t;
+                      m = v;
+                      k = A;
+                      n = u;
+                      u = 74;
+                      continue;
+                    }
+                  }
+                  o = 0;
+                  oa(10, b | 0, i | 0, n | 0, m | 0, d | 0, 0);
+                  e = o;
+                  o = 0;
+                  if (((e | 0) != 0) & ((p | 0) != 0)) {
+                    f = V6(c[e >> 2] | 0, w | 0, x | 0) | 0;
+                    if (!f) bb(e | 0, p | 0);
+                    z = p;
+                  } else f = -1;
+                  if ((f | 0) == 1) {
+                    f = g;
+                    q = h;
+                    r = d;
+                    s = i;
+                    t = j;
+                    v = m;
+                    A = k;
+                    u = n;
+                    e = z;
+                    g = f;
+                    h = q;
+                    d = r;
+                    i = s;
+                    j = t;
+                    m = v;
+                    k = A;
+                    n = u;
+                    u = 74;
+                    continue;
+                  }
+                  q = g;
+                }
+                if (!(a[194954] | 0)) e = 0;
+                else {
+                  o = 0;
+                  ia(113, k | 0);
+                  e = o;
+                  o = 0;
+                  if (((e | 0) != 0) & ((p | 0) != 0)) {
+                    f = V6(c[e >> 2] | 0, w | 0, x | 0) | 0;
+                    if (!f) bb(e | 0, p | 0);
+                    z = p;
+                  } else f = -1;
+                  if ((f | 0) == 1) {
+                    e = z;
+                    g = q;
+                    u = 74;
+                    continue;
+                  }
+                  e = 0;
+                }
+                while (1) {
+                  if ((e | 0) >= (n | 0)) break;
+                  o = 0;
+                  ia(105, c[(m + (e << 3) + 4) >> 2] | 0);
+                  f = o;
+                  o = 0;
+                  if (((f | 0) != 0) & ((p | 0) != 0)) {
+                    g = V6(c[f >> 2] | 0, w | 0, x | 0) | 0;
+                    if (!g) bb(f | 0, p | 0);
+                    z = p;
+                  } else g = -1;
+                  if ((g | 0) == 1) {
+                    e = z;
+                    g = q;
+                    u = 74;
+                    continue d;
+                  }
+                  e = (e + 1) | 0;
+                }
+                o = 0;
+                ia(105, j | 0);
+                e = o;
+                o = 0;
+                if (((e | 0) != 0) & ((p | 0) != 0)) {
+                  f = V6(c[e >> 2] | 0, w | 0, x | 0) | 0;
+                  if (!f) bb(e | 0, p | 0);
+                  z = p;
+                } else f = -1;
+                if ((f | 0) == 1) {
+                  e = z;
+                  g = q;
+                  u = 74;
+                  continue;
+                }
+                o = 0;
+                ia(114, i | 0);
+                e = o;
+                o = 0;
+                if (((e | 0) != 0) & ((p | 0) != 0)) {
+                  f = V6(c[e >> 2] | 0, w | 0, x | 0) | 0;
+                  if (!f) bb(e | 0, p | 0);
+                  z = p;
+                } else f = -1;
+                if ((f | 0) == 1) {
+                  e = z;
+                  g = q;
+                  u = 74;
+                  continue;
+                }
+                o = 0;
+                ia(105, h | 0);
+                e = o;
+                o = 0;
+                if (((e | 0) != 0) & ((p | 0) != 0)) {
+                  f = V6(c[e >> 2] | 0, w | 0, x | 0) | 0;
+                  if (!f) bb(e | 0, p | 0);
+                  z = p;
+                } else f = -1;
+                if ((f | 0) == 1) {
+                  e = z;
+                  g = q;
+                  u = 74;
+                } else break;
+              }
+              U1(w | 0);
+              l = y;
+              return;
+            }
+            function sQ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0.0;
+              q = l;
+              l = (l + 64) | 0;
+              p = (q + 32) | 0;
+              o = (q + 16) | 0;
+              j = q;
+              k = (q + 48) | 0;
+              T4(110935, a) | 0;
+              T4(110946, a) | 0;
+              m = (b + 16) | 0;
+              n = (j + 8) | 0;
+              i = (k + 4) | 0;
+              g = 0;
+              while (1) {
+                if ((g | 0) >= (c[b >> 2] | 0)) break;
+                d = c[m >> 2] | 0;
+                e = c[(d + ((g * 40) | 0) + 20) >> 2] | 0;
+                f = c[(d + ((g * 40) | 0) + 24) >> 2] | 0;
+                if ((e | 0) == (f | 0)) {
+                  lR(j, e);
+                  d = ~~+h[j >> 3];
+                  e = ~~+h[n >> 3];
+                } else {
+                  nR(k, ((c[e >> 2] & 1) | 0) == 0 ? e : f, (d + ((g * 40) | 0)) | 0);
+                  d = c[k >> 2] | 0;
+                  e = c[i >> 2] | 0;
+                }
+                c[o >> 2] = g;
+                c[(o + 4) >> 2] = d;
+                c[(o + 8) >> 2] = e;
+                w4(a, 110966, o) | 0;
+                g = (g + 1) | 0;
+              }
+              f = (b + 4) | 0;
+              e = (b + 20) | 0;
+              d = 0;
+              while (1) {
+                if ((d | 0) >= (c[f >> 2] | 0)) break;
+                o = c[e >> 2] | 0;
+                b = c[(o + ((d * 24) | 0) + 16) >> 2] | 0;
+                r = +h[(o + ((d * 24) | 0)) >> 3];
+                c[p >> 2] = c[(o + ((d * 24) | 0) + 12) >> 2];
+                c[(p + 4) >> 2] = b;
+                h[(p + 8) >> 3] = r;
+                w4(a, 110986, p) | 0;
+                d = (d + 1) | 0;
+              }
+              T4(111008, a) | 0;
+              l = q;
+              return;
+            }
+            function tQ(a) {
+              a = a | 0;
+              var b = 0.0,
+                d = 0.0,
+                e = 0,
+                f = 0;
+              f = c[a >> 2] & 3;
+              e = c[((c[(((f | 0) == 3 ? a : (a + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0;
+              a = c[((c[(((f | 0) == 2 ? a : (a + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0;
+              b = +h[(e + 16) >> 3] - +h[(a + 16) >> 3];
+              d = +h[(e + 24) >> 3] - +h[(a + 24) >> 3];
+              return ~~(d * d + b * b) | 0;
+            }
+            function uQ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return ((c[a >> 2] | 0) - (c[b >> 2] | 0)) | 0;
+            }
+            function vQ(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              n = l;
+              l = (l + 32) | 0;
+              j = n;
+              lR((n + 16) | 0, d);
+              k = (d + 32) | 0;
+              m = (d + 36) | 0;
+              g = 0;
+              while (1) {
+                if ((g | 0) >= (c[k >> 2] | 0)) break;
+                h = c[((c[m >> 2] | 0) + (g << 2)) >> 2] | 0;
+                do
+                  if (!(a[(h + 36) >> 0] | 0)) {
+                    i = c[(h + 20) >> 2] | 0;
+                    if ((i | 0) == (d | 0)) {
+                      jR(j, h, c[(h + 24) >> 2] | 0);
+                      ER(b, f, h, 0.0) | 0;
+                      break;
+                    } else {
+                      jR(j, h, i);
+                      ER(b, e, h, 0.0) | 0;
+                      break;
+                    }
+                  }
+                while (0);
+                g = (g + 1) | 0;
+              }
+              c[b >> 2] = (c[b >> 2] | 0) + 2;
+              l = n;
+              return;
+            }
+            function wQ(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 32) | 0;
+              h = k;
+              lR((k + 16) | 0, b);
+              i = (b + 32) | 0;
+              j = (b + 36) | 0;
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (c[i >> 2] | 0)) break;
+                g = c[((c[j >> 2] | 0) + (f << 2)) >> 2] | 0;
+                e = c[(g + 20) >> 2] | 0;
+                if ((e | 0) == (b | 0)) e = c[(g + 24) >> 2] | 0;
+                jR(h, g, e);
+                ER(a, d, g, 0.0) | 0;
+                f = (f + 1) | 0;
+              }
+              c[a >> 2] = (c[a >> 2] | 0) + 1;
+              c[(d + 24) >> 2] = b;
+              c[(d + 20) >> 2] = b;
+              l = k;
+              return;
+            }
+            function xQ(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0,
+                k = 0.0,
+                m = 0.0,
+                n = 0,
+                o = 0.0,
+                p = 0.0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0.0,
+                x = 0.0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0;
+              H = l;
+              l = (l + 128) | 0;
+              C = (H + 64) | 0;
+              n = (H + 48) | 0;
+              D = (H + 32) | 0;
+              E = (H + 16) | 0;
+              F = H;
+              g = 0;
+              i = e;
+              while (1) {
+                if (!i) break;
+                g = (g + 1) | 0;
+                i = c[(i + 8) >> 2] | 0;
+              }
+              B = JK((((g * 56) | 0) + -112) | 0) | 0;
+              c[(C + 52) >> 2] = 0;
+              c[(C + 48) >> 2] = 0;
+              A = (e + 8) | 0;
+              e = c[A >> 2] | 0;
+              i = c[(e + 8) >> 2] | 0;
+              g = c[(e + 20) >> 2] | 0;
+              if (c[g >> 2] & 1) g = c[(e + 24) >> 2] | 0;
+              jR(n, e, g);
+              j = e;
+              q = e;
+              p = 0.0;
+              o = +h[n >> 3];
+              z = 0;
+              m = 0.0;
+              x = +h[(n + 8) >> 3];
+              while (1) {
+                y = (i + 8) | 0;
+                if (!(c[y >> 2] | 0)) break;
+                v = kR(j, i) | 0;
+                cV(d, v, c[(q + 12) >> 2] | 0);
+                t = (q + 36) | 0;
+                u = (i + 36) | 0;
+                if ((a[t >> 0] | 0) == (a[u >> 0] | 0))
+                  if ((c[y >> 2] | 0) == (f | 0)) {
+                    jR(E, i, v);
+                    e = E;
+                    G = 12;
+                  } else {
+                    j = q;
+                    e = z;
+                    k = x;
+                  }
+                else {
+                  lR(D, v);
+                  e = D;
+                  G = 12;
+                }
+                if ((G | 0) == 12) {
+                  G = 0;
+                  w = +h[e >> 3];
+                  k = +h[(e + 8) >> 3];
+                  e = a[t >> 0] | 0;
+                  s = (e << 24) >> 24 == 0;
+                  r = (q | 0) == (c[A >> 2] | 0);
+                  if (s) {
+                    if (!(a[u >> 0] | 0)) e = 0;
+                    else e = (c[(i + 20) >> 2] | 0) == (v | 0) ? 4 : 2;
+                    n = (v + 48) | 0;
+                    q = (g + 48) | 0;
+                    j = (g + 40) | 0;
+                    g = r ? 0 : p > o ? 4 : 2;
+                  } else {
+                    if ((e << 24) >> 24 == (a[u >> 0] | 0)) e = 0;
+                    else e = (c[(i + 20) >> 2] | 0) == (v | 0) ? 1 : 3;
+                    n = (v + 40) | 0;
+                    q = (g + 40) | 0;
+                    j = (g + 48) | 0;
+                    g = r ? 0 : m > x ? 1 : 3;
+                  }
+                  mR(C, s & 1, +h[j >> 3], +h[q >> 3], +h[n >> 3], g, e);
+                  q = (z + 1) | 0;
+                  g = (B + ((z * 56) | 0)) | 0;
+                  e = C;
+                  j = (g + 56) | 0;
+                  do {
+                    c[g >> 2] = c[e >> 2];
+                    g = (g + 4) | 0;
+                    e = (e + 4) | 0;
+                  } while ((g | 0) < (j | 0));
+                  if ((a[t >> 0] | 0) != (a[u >> 0] | 0) ? (c[y >> 2] | 0) == (f | 0) : 0) {
+                    jR(F, i, v);
+                    n = (a[u >> 0] | 0) == 0;
+                    e = (v + 40) | 0;
+                    g = (v + 48) | 0;
+                    p = +h[(n ? g : e) >> 3];
+                    mR(C, n & 1, +h[(n ? e : g) >> 3], p, p, n ? (o > w ? 4 : 2) : x > k ? 1 : 3, 0);
+                    n = (z + 2) | 0;
+                    g = (B + ((q * 56) | 0)) | 0;
+                    e = C;
+                    j = (g + 56) | 0;
+                    do {
+                      c[g >> 2] = c[e >> 2];
+                      g = (g + 4) | 0;
+                      e = (e + 4) | 0;
+                    } while ((g | 0) < (j | 0));
+                    g = v;
+                    j = i;
+                    p = o;
+                    o = w;
+                    e = n;
+                    m = x;
+                  } else {
+                    g = v;
+                    j = i;
+                    p = o;
+                    o = w;
+                    e = q;
+                    m = x;
+                  }
+                }
+                v = i;
+                i = c[y >> 2] | 0;
+                q = j;
+                z = e;
+                x = k;
+                j = v;
+              }
+              i = W1(B, (z * 56) | 0) | 0;
+              e = (z + -1) | 0;
+              g = 0;
+              while (1) {
+                if ((g | 0) >= (z | 0)) break;
+                if ((g | 0) > 0) c[(i + ((g * 56) | 0) + 48) >> 2] = i + ((((g + -1) | 0) * 56) | 0);
+                if ((g | 0) < (e | 0)) {
+                  G = (g + 1) | 0;
+                  c[(i + ((g * 56) | 0) + 52) >> 2] = i + ((G * 56) | 0);
+                  g = G;
+                  continue;
+                } else {
+                  g = (g + 1) | 0;
+                  continue;
+                }
+              }
+              c[b >> 2] = z;
+              c[(b + 4) >> 2] = i;
+              l = H;
+              return;
+            }
+            function yQ(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              j = Vz(25692, c[4581] | 0) | 0;
+              k = (a + 8) | 0;
+              i = 0;
+              while (1) {
+                if ((i | 0) >= (c[a >> 2] | 0)) break;
+                b = ((c[k >> 2] | 0) + ((i * 72) | 0)) | 0;
+                if (!(c[b >> 2] & 4)) {
+                  while (1) {
+                    d = c[((c[(b + 36) >> 2] | 0) + 8) >> 2] | 0;
+                    if (!d) break;
+                    d = c[(d + 20) >> 2] | 0;
+                    if (!d) break;
+                    if (!(c[d >> 2] & 1)) b = d;
+                    else break;
+                  }
+                  g = JK(40) | 0;
+                  c[(g + 36) >> 2] = b;
+                  h[(g + 8) >> 3] = +h[(b + 40) >> 3];
+                  f = b;
+                  d = c[b >> 2] | 0;
+                  while (1) {
+                    c[f >> 2] = d | 4;
+                    d = c[c[(f + 36) >> 2] >> 2] | 0;
+                    if (!d) break;
+                    e = c[(d + 24) >> 2] | 0;
+                    if (!e) break;
+                    d = c[e >> 2] | 0;
+                    if ((d & 1) | 0) break;
+                    else f = e;
+                  }
+                  h[(g + 16) >> 3] = +h[(f + 56) >> 3];
+                  eR(j, g, +h[(b + 48) >> 3]);
+                }
+                i = (i + 1) | 0;
+              }
+              return j | 0;
+            }
+            function zQ(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              j = Vz(25692, c[4581] | 0) | 0;
+              k = (a + 8) | 0;
+              i = 0;
+              while (1) {
+                if ((i | 0) >= (c[a >> 2] | 0)) break;
+                b = ((c[k >> 2] | 0) + ((i * 72) | 0)) | 0;
+                if (!(c[b >> 2] & 2)) {
+                  while (1) {
+                    d = c[((c[(b + 36) >> 2] | 0) + 12) >> 2] | 0;
+                    if (!d) break;
+                    d = c[(d + 20) >> 2] | 0;
+                    if (!d) break;
+                    if (!(c[d >> 2] & 1)) b = d;
+                    else break;
+                  }
+                  g = JK(40) | 0;
+                  c[(g + 36) >> 2] = b;
+                  h[(g + 8) >> 3] = +h[(b + 48) >> 3];
+                  f = b;
+                  d = c[b >> 2] | 0;
+                  while (1) {
+                    c[f >> 2] = d | 2;
+                    d = c[((c[(f + 36) >> 2] | 0) + 4) >> 2] | 0;
+                    if (!d) break;
+                    e = c[(d + 24) >> 2] | 0;
+                    if (!e) break;
+                    d = c[e >> 2] | 0;
+                    if ((d & 1) | 0) break;
+                    else f = e;
+                  }
+                  h[(g + 16) >> 3] = +h[(f + 64) >> 3];
+                  eR(j, g, +h[(b + 40) >> 3]);
+                }
+                i = (i + 1) | 0;
+              }
+              return j | 0;
+            }
+            function AQ(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              j = (e + 20) | 0;
+              i = (e + 24) | 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (b | 0)) break;
+                g = c[(d + (e << 3)) >> 2] | 0;
+                h = c[(d + (e << 3) + 4) >> 2] | 0;
+                f = 0;
+                while (1) {
+                  if ((f | 0) >= (g | 0)) break;
+                  k = (h + ((f * 56) | 0)) | 0;
+                  dR(JQ(c[((a[k >> 0] | 0) == 0 ? j : i) >> 2] | 0, k) | 0, k);
+                  f = (f + 1) | 0;
+                }
+                e = (e + 1) | 0;
+              }
+              return;
+            }
+            function BQ(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              d = (a + 20) | 0;
+              LQ(c[d >> 2] | 0);
+              b = (a + 24) | 0;
+              LQ(c[b >> 2] | 0);
+              MQ(c[d >> 2] | 0);
+              MQ(c[b >> 2] | 0);
+              NQ(c[d >> 2] | 0, a);
+              NQ(c[b >> 2] | 0, a);
+              OQ(c[d >> 2] | 0);
+              OQ(c[b >> 2] | 0);
+              return;
+            }
+            function CQ(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0.0,
+                B = 0.0,
+                C = 0.0,
+                D = 0,
+                E = 0.0;
+              z = l;
+              l = (l + 224) | 0;
+              n = (z + 176) | 0;
+              m = (z + 208) | 0;
+              x = (z + 160) | 0;
+              y = (z + 128) | 0;
+              k = (z + 96) | 0;
+              t = (z + 64) | 0;
+              u = z;
+              o = (z + 32) | 0;
+              v = (u + 8) | 0;
+              h[v >> 3] = 1797693134862315708145274.0e284;
+              h[u >> 3] = 1797693134862315708145274.0e284;
+              w = (u + 24) | 0;
+              h[w >> 3] = -1797693134862315708145274.0e284;
+              p = (u + 16) | 0;
+              h[p >> 3] = -1797693134862315708145274.0e284;
+              T4(110183, a) | 0;
+              c[n >> 2] = 10;
+              c[(n + 4) >> 2] = 10;
+              w4(a, 110589, n) | 0;
+              T4(138265, a) | 0;
+              i = (b + 4) | 0;
+              j = (b + 12) | 0;
+              q = (t + 8) | 0;
+              r = (t + 16) | 0;
+              s = (t + 24) | 0;
+              g = 0;
+              while (1) {
+                if ((g | 0) >= (c[i >> 2] | 0)) break;
+                D = ((c[j >> 2] | 0) + ((g * 72) | 0) + 40) | 0;
+                c[t >> 2] = c[D >> 2];
+                c[(t + 4) >> 2] = c[(D + 4) >> 2];
+                c[(t + 8) >> 2] = c[(D + 8) >> 2];
+                c[(t + 12) >> 2] = c[(D + 12) >> 2];
+                c[(t + 16) >> 2] = c[(D + 16) >> 2];
+                c[(t + 20) >> 2] = c[(D + 20) >> 2];
+                c[(t + 24) >> 2] = c[(D + 24) >> 2];
+                c[(t + 28) >> 2] = c[(D + 28) >> 2];
+                C = +h[q >> 3];
+                B = +h[r >> 3];
+                A = +h[s >> 3];
+                h[k >> 3] = +h[t >> 3];
+                h[(k + 8) >> 3] = C;
+                h[(k + 16) >> 3] = B;
+                h[(k + 24) >> 3] = A;
+                w4(a, 138284, k) | 0;
+                g = (g + 1) | 0;
+              }
+              g = 0;
+              while (1) {
+                if ((g | 0) >= (d | 0)) break;
+                D = c[(f + (g << 3) + 4) >> 2] | 0;
+                k = (e + (g << 3)) | 0;
+                c[m >> 2] = c[k >> 2];
+                c[(m + 4) >> 2] = c[(k + 4) >> 2];
+                c[n >> 2] = c[u >> 2];
+                c[(n + 4) >> 2] = c[(u + 4) >> 2];
+                c[(n + 8) >> 2] = c[(u + 8) >> 2];
+                c[(n + 12) >> 2] = c[(u + 12) >> 2];
+                c[(n + 16) >> 2] = c[(u + 16) >> 2];
+                c[(n + 20) >> 2] = c[(u + 20) >> 2];
+                c[(n + 24) >> 2] = c[(u + 24) >> 2];
+                c[(n + 28) >> 2] = c[(u + 28) >> 2];
+                KQ(o, a, D, m, b, n);
+                c[u >> 2] = c[o >> 2];
+                c[(u + 4) >> 2] = c[(o + 4) >> 2];
+                c[(u + 8) >> 2] = c[(o + 8) >> 2];
+                c[(u + 12) >> 2] = c[(o + 12) >> 2];
+                c[(u + 16) >> 2] = c[(o + 16) >> 2];
+                c[(u + 20) >> 2] = c[(o + 20) >> 2];
+                c[(u + 24) >> 2] = c[(o + 24) >> 2];
+                c[(u + 28) >> 2] = c[(o + 28) >> 2];
+                g = (g + 1) | 0;
+              }
+              T4(110606, a) | 0;
+              i = (b + 8) | 0;
+              g = 0;
+              while (1) {
+                if ((g | 0) >= (c[b >> 2] | 0)) break;
+                D = ((c[i >> 2] | 0) + ((g * 72) | 0) + 40) | 0;
+                c[t >> 2] = c[D >> 2];
+                c[(t + 4) >> 2] = c[(D + 4) >> 2];
+                c[(t + 8) >> 2] = c[(D + 8) >> 2];
+                c[(t + 12) >> 2] = c[(D + 12) >> 2];
+                c[(t + 16) >> 2] = c[(D + 16) >> 2];
+                c[(t + 20) >> 2] = c[(D + 20) >> 2];
+                c[(t + 24) >> 2] = c[(D + 24) >> 2];
+                c[(t + 28) >> 2] = c[(D + 28) >> 2];
+                E = +h[t >> 3];
+                A = +h[q >> 3];
+                B = +h[r >> 3];
+                C = +h[s >> 3];
+                h[y >> 3] = E;
+                h[(y + 8) >> 3] = A;
+                h[(y + 16) >> 3] = B;
+                h[(y + 24) >> 3] = C;
+                w4(a, 138321, y) | 0;
+                h[u >> 3] = +h[(+h[u >> 3] < E ? u : t) >> 3];
+                h[v >> 3] = +h[((+h[v >> 3] < A ? u : t) + 8) >> 3];
+                h[p >> 3] = +h[((+h[p >> 3] > B ? u : t) + 16) >> 3];
+                h[w >> 3] = +h[((+h[w >> 3] > C ? u : t) + 24) >> 3];
+                g = (g + 1) | 0;
+              }
+              v = ~~(+h[v >> 3] + 10.0);
+              y = ~~(+h[p >> 3] + 10.0);
+              D = ~~(+h[w >> 3] + 10.0);
+              c[x >> 2] = ~~(+h[u >> 3] + 10.0);
+              c[(x + 4) >> 2] = v;
+              c[(x + 8) >> 2] = y;
+              c[(x + 12) >> 2] = D;
+              w4(a, 110631, x) | 0;
+              l = z;
+              return;
+            }
+            function DQ(b, d, e, f, g, i) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              var j = 0.0,
+                k = 0.0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                O = 0,
+                P = 0,
+                Q = 0;
+              N = l;
+              l = (l + 112) | 0;
+              F = (N + 88) | 0;
+              E = (N + 72) | 0;
+              M = (N + 32) | 0;
+              I = (N + 16) | 0;
+              J = N;
+              K = (N + 56) | 0;
+              L = (N + 40) | 0;
+              G = c[15712] | 0;
+              w = (i | 0) == 0;
+              x = (J + 8) | 0;
+              y = (I + 8) | 0;
+              v = 0;
+              m = 0;
+              n = 0;
+              o = 0;
+              p = 0;
+              i = 0;
+              while (1) {
+                if ((v | 0) >= (e | 0)) break;
+                z = c[(g + (v << 3) + 4) >> 2] | 0;
+                A = (z + 48) | 0;
+                u = ((c[((c[((((c[z >> 2] & 3) | 0) == 3 ? z : A) + 40) >> 2] | 0) + 16) >> 2] | 0) + 16) | 0;
+                B = (z + 16) | 0;
+                C = ((c[B >> 2] | 0) + 16) | 0;
+                c[E >> 2] = c[u >> 2];
+                c[(E + 4) >> 2] = c[(u + 4) >> 2];
+                c[(E + 8) >> 2] = c[(u + 8) >> 2];
+                c[(E + 12) >> 2] = c[(u + 12) >> 2];
+                c[F >> 2] = c[C >> 2];
+                c[(F + 4) >> 2] = c[(C + 4) >> 2];
+                c[(F + 8) >> 2] = c[(C + 8) >> 2];
+                c[(F + 12) >> 2] = c[(C + 12) >> 2];
+                EQ(K, E, F);
+                c[I >> 2] = c[K >> 2];
+                c[(I + 4) >> 2] = c[(K + 4) >> 2];
+                c[(I + 8) >> 2] = c[(K + 8) >> 2];
+                c[(I + 12) >> 2] = c[(K + 12) >> 2];
+                C = (z + -48) | 0;
+                u = ((c[((c[((((c[z >> 2] & 3) | 0) == 2 ? z : C) + 40) >> 2] | 0) + 16) >> 2] | 0) + 16) | 0;
+                t = ((c[B >> 2] | 0) + 56) | 0;
+                c[E >> 2] = c[u >> 2];
+                c[(E + 4) >> 2] = c[(u + 4) >> 2];
+                c[(E + 8) >> 2] = c[(u + 8) >> 2];
+                c[(E + 12) >> 2] = c[(u + 12) >> 2];
+                c[F >> 2] = c[t >> 2];
+                c[(F + 4) >> 2] = c[(t + 4) >> 2];
+                c[(F + 8) >> 2] = c[(t + 8) >> 2];
+                c[(F + 12) >> 2] = c[(t + 12) >> 2];
+                EQ(L, E, F);
+                c[J >> 2] = c[L >> 2];
+                c[(J + 4) >> 2] = c[(L + 4) >> 2];
+                c[(J + 8) >> 2] = c[(L + 8) >> 2];
+                c[(J + 12) >> 2] = c[(L + 12) >> 2];
+                t = c[(f + (v << 3)) >> 2] | 0;
+                u = c[(f + (v << 3) + 4) >> 2] | 0;
+                s = (t * 3) | 0;
+                D = (s + 1) | 0;
+                if ((s | 0) >= (n | 0)) {
+                  if (m | 0) U1(i);
+                  p = KK(D << 4) | 0;
+                  m = p;
+                  n = D;
+                  o = p;
+                  i = p;
+                }
+                if (!(a[u >> 0] | 0)) {
+                  k = +(GQ(u, d) | 0);
+                  j = +h[I >> 3];
+                } else {
+                  j = +FQ(u, d);
+                  k = +h[y >> 3];
+                }
+                r = (m + 16) | 0;
+                h[(m + 16) >> 3] = j;
+                h[(m + 24) >> 3] = k;
+                c[p >> 2] = c[r >> 2];
+                c[(p + 4) >> 2] = c[(r + 4) >> 2];
+                c[(p + 8) >> 2] = c[(r + 8) >> 2];
+                c[(p + 12) >> 2] = c[(r + 12) >> 2];
+                r = 1;
+                q = u;
+                s = 2;
+                while (1) {
+                  if ((r | 0) >= (t | 0)) break;
+                  q = (u + ((r * 56) | 0)) | 0;
+                  if (!(a[q >> 0] | 0)) k = +(GQ(q, d) | 0);
+                  else j = +FQ(q, d);
+                  O = (m + ((s + 2) << 4)) | 0;
+                  Q = (m + ((s + 1) << 4)) | 0;
+                  P = (m + (s << 4)) | 0;
+                  h[P >> 3] = j;
+                  h[(m + (s << 4) + 8) >> 3] = k;
+                  c[Q >> 2] = c[P >> 2];
+                  c[(Q + 4) >> 2] = c[(P + 4) >> 2];
+                  c[(Q + 8) >> 2] = c[(P + 8) >> 2];
+                  c[(Q + 12) >> 2] = c[(P + 12) >> 2];
+                  c[O >> 2] = c[P >> 2];
+                  c[(O + 4) >> 2] = c[(P + 4) >> 2];
+                  c[(O + 8) >> 2] = c[(P + 8) >> 2];
+                  c[(O + 12) >> 2] = c[(P + 12) >> 2];
+                  r = (r + 1) | 0;
+                  s = (s + 3) | 0;
+                }
+                if (!(a[q >> 0] | 0)) {
+                  k = +(GQ(q, d) | 0);
+                  j = +h[J >> 3];
+                } else {
+                  j = +FQ(q, d);
+                  k = +h[x >> 3];
+                }
+                Q = (m + (s << 4)) | 0;
+                O = (s + 1) | 0;
+                P = (m + (O << 4)) | 0;
+                h[P >> 3] = j;
+                h[(m + (O << 4) + 8) >> 3] = k;
+                c[Q >> 2] = c[P >> 2];
+                c[(Q + 4) >> 2] = c[(P + 4) >> 2];
+                c[(Q + 8) >> 2] = c[(P + 8) >> 2];
+                c[(Q + 12) >> 2] = c[(P + 12) >> 2];
+                if (0 > 1) {
+                  P = KB(c[((((c[z >> 2] & 3) | 0) == 3 ? z : A) + 40) >> 2] | 0) | 0;
+                  Q = KB(c[((((c[z >> 2] & 3) | 0) == 2 ? z : C) + 40) >> 2] | 0) | 0;
+                  c[M >> 2] = P;
+                  c[(M + 4) >> 2] = Q;
+                  w4(G, 110142, M) | 0;
+                }
+                dO(z, c[((((c[z >> 2] & 3) | 0) == 2 ? z : C) + 40) >> 2] | 0, m, D, 25680);
+                if ((!w ? ((H = c[((c[B >> 2] | 0) + 96) >> 2] | 0), H | 0) : 0) ? (a[(H + 81) >> 0] | 0) == 0 : 0) {
+                  c[E >> 2] = c[I >> 2];
+                  c[(E + 4) >> 2] = c[(I + 4) >> 2];
+                  c[(E + 8) >> 2] = c[(I + 8) >> 2];
+                  c[(E + 12) >> 2] = c[(I + 12) >> 2];
+                  c[F >> 2] = c[J >> 2];
+                  c[(F + 4) >> 2] = c[(J + 4) >> 2];
+                  c[(F + 8) >> 2] = c[(J + 8) >> 2];
+                  c[(F + 12) >> 2] = c[(J + 12) >> 2];
+                  yO(b, z, E, F);
+                }
+                v = (v + 1) | 0;
+              }
+              U1(o);
+              l = N;
+              return;
+            }
+            function EQ(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              h[b >> 3] = +h[b >> 3] + +h[d >> 3];
+              e = (b + 8) | 0;
+              h[e >> 3] = +h[e >> 3] + +h[(d + 8) >> 3];
+              c[a >> 2] = c[b >> 2];
+              c[(a + 4) >> 2] = c[(b + 4) >> 2];
+              c[(a + 8) >> 2] = c[(b + 8) >> 2];
+              c[(a + 12) >> 2] = c[(b + 12) >> 2];
+              return;
+            }
+            function FQ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0;
+              b = JQ(c[(b + 24) >> 2] | 0, a) | 0;
+              e = c[(b + 36) >> 2] | 0;
+              d = +h[(e + 40) >> 3];
+              return +((+h[(e + 56) >> 3] - d) * (+(c[(a + 44) >> 2] | 0) / +(((c[(b + 24) >> 2] | 0) + 1) | 0)) + d);
+            }
+            function GQ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0;
+              e = JQ(c[(b + 20) >> 2] | 0, a) | 0;
+              b = c[(e + 36) >> 2] | 0;
+              d = +h[(b + 48) >> 3];
+              return (
+                ~~(
+                  (1.0 - +(c[(a + 44) >> 2] | 0) / +(((c[(e + 24) >> 2] | 0) + 1) | 0)) * (+h[(b + 64) >> 3] - d) +
+                  d
+                ) | 0
+              );
+            }
+            function HQ(a) {
+              a = a | 0;
+              return 0;
+            }
+            function IQ(a) {
+              a = a | 0;
+              return 0;
+            }
+            function JQ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              a = nb[c[a >> 2] & 63](a, (b + 8) | 0, 512) | 0;
+              if (!a) qa(110155, 110161, 423, 110169);
+              a = c[(a + 16) >> 2] | 0;
+              a = nb[c[a >> 2] & 63](a, (b + 16) | 0, 512) | 0;
+              if (!a) qa(110180, 110161, 425, 110169);
+              else return a | 0;
+              return 0;
+            }
+            function KQ(b, d, e, f, g, i) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              var j = 0,
+                k = 0.0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0.0,
+                q = 0.0,
+                r = 0.0,
+                s = 0.0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0.0,
+                C = 0.0,
+                D = 0.0;
+              z = l;
+              l = (l + 32) | 0;
+              y = (z + 16) | 0;
+              u = (z + 8) | 0;
+              m = z;
+              j =
+                c[
+                  ((c[((c[((((c[e >> 2] & 3) | 0) == 3 ? e : (e + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 112) >> 2
+                ] | 0;
+              t = c[(f + 4) >> 2] | 0;
+              if (!(a[t >> 0] | 0)) {
+                k = +h[(j + 56) >> 3];
+                s = +h[(j + 40) >> 3];
+                j = GQ(t, g) | 0;
+                k = (s + k) * 0.5;
+              } else {
+                k = +h[(j + 64) >> 3];
+                s = +h[(j + 48) >> 3];
+                j = ~~((s + k) * 0.5);
+                k = +FQ(t, g);
+              }
+              A = ~~k;
+              p = +h[i >> 3];
+              r = +(A | 0);
+              p = p < r ? p : r;
+              h[i >> 3] = p;
+              v = (i + 8) | 0;
+              q = +h[v >> 3];
+              s = +(j | 0);
+              q = q < s ? q : s;
+              h[v >> 3] = q;
+              w = (i + 16) | 0;
+              k = +h[w >> 3];
+              r = k > r ? k : r;
+              h[w >> 3] = r;
+              x = (i + 24) | 0;
+              k = +h[x >> 3];
+              s = k > s ? k : s;
+              h[x >> 3] = s;
+              c[m >> 2] = A;
+              c[(m + 4) >> 2] = j;
+              w4(d, 110682, m) | 0;
+              o = c[f >> 2] | 0;
+              m = t;
+              n = 1;
+              f = A;
+              while (1) {
+                if ((n | 0) >= (o | 0)) break;
+                m = (t + ((n * 56) | 0)) | 0;
+                if (!(a[m >> 0] | 0)) j = GQ(m, g) | 0;
+                else f = ~~+FQ(m, g);
+                B = +(f | 0);
+                D = p < B ? p : B;
+                h[i >> 3] = D;
+                k = +(j | 0);
+                C = q < k ? q : k;
+                h[v >> 3] = C;
+                B = r > B ? r : B;
+                h[w >> 3] = B;
+                k = s > k ? s : k;
+                h[x >> 3] = k;
+                c[u >> 2] = f;
+                c[(u + 4) >> 2] = j;
+                w4(d, 110704, u) | 0;
+                n = (n + 1) | 0;
+                p = D;
+                q = C;
+                r = B;
+                s = k;
+              }
+              j =
+                c[
+                  ((c[((c[((((c[e >> 2] & 3) | 0) == 2 ? e : (e + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 112) >>
+                    2
+                ] | 0;
+              if (!(a[m >> 0] | 0)) {
+                k = +h[(j + 56) >> 3];
+                D = +h[(j + 40) >> 3];
+                j = GQ(m, g) | 0;
+                k = (D + k) * 0.5;
+              } else {
+                k = +h[(j + 64) >> 3];
+                D = +h[(j + 48) >> 3];
+                j = ~~((D + k) * 0.5);
+                k = +FQ(m, g);
+              }
+              A = ~~k;
+              C = +(A | 0);
+              h[i >> 3] = p < C ? p : C;
+              D = +(j | 0);
+              h[v >> 3] = q < D ? q : D;
+              h[w >> 3] = r > C ? r : C;
+              h[x >> 3] = s > D ? s : D;
+              c[y >> 2] = A;
+              c[(y + 4) >> 2] = j;
+              w4(d, 110718, y) | 0;
+              c[b >> 2] = c[i >> 2];
+              c[(b + 4) >> 2] = c[(i + 4) >> 2];
+              c[(b + 8) >> 2] = c[(i + 8) >> 2];
+              c[(b + 12) >> 2] = c[(i + 12) >> 2];
+              c[(b + 16) >> 2] = c[(i + 16) >> 2];
+              c[(b + 20) >> 2] = c[(i + 20) >> 2];
+              c[(b + 24) >> 2] = c[(i + 24) >> 2];
+              c[(b + 28) >> 2] = c[(i + 28) >> 2];
+              l = z;
+              return;
+            }
+            function LQ(a) {
+              a = a | 0;
+              var b = 0;
+              a = Tz(a) | 0;
+              while (1) {
+                if (!a) break;
+                b = Tz(c[(a + 16) >> 2] | 0) | 0;
+                while (1) {
+                  if (!b) break;
+                  c[(b + 32) >> 2] = oR(c[(b + 24) >> 2] | 0) | 0;
+                  b = c[b >> 2] | 0;
+                }
+                a = c[a >> 2] | 0;
+              }
+              return;
+            }
+            function MQ(a) {
+              a = a | 0;
+              var b = 0;
+              a = Tz(a) | 0;
+              while (1) {
+                if (!a) break;
+                b = Tz(c[(a + 16) >> 2] | 0) | 0;
+                while (1) {
+                  if (!b) break;
+                  if (c[(b + 24) >> 2] | 0) cR(b);
+                  b = c[b >> 2] | 0;
+                }
+                a = c[a >> 2] | 0;
+              }
+              return;
+            }
+            function NQ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = Tz(a) | 0;
+              while (1) {
+                if (!d) break;
+                a = Tz(c[(d + 16) >> 2] | 0) | 0;
+                while (1) {
+                  if (!a) break;
+                  SQ(a, b);
+                  a = c[a >> 2] | 0;
+                }
+                d = c[d >> 2] | 0;
+              }
+              return;
+            }
+            function OQ(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0;
+              e = Tz(a) | 0;
+              while (1) {
+                if (!e) break;
+                i = (e + 8) | 0;
+                f = Tz(c[(e + 16) >> 2] | 0) | 0;
+                while (1) {
+                  if (!f) break;
+                  a = (f + 24) | 0;
+                  a: do
+                    if (c[a >> 2] | 0) {
+                      if ((c[47323] & 8) | 0) PQ(f, ~~+h[i >> 3]);
+                      g = (f + 32) | 0;
+                      tR(c[g >> 2] | 0);
+                      b = c[a >> 2] | 0;
+                      d = (f + 28) | 0;
+                      a = 0;
+                      while (1) {
+                        if ((a | 0) >= (b | 0)) break a;
+                        c[((c[((c[d >> 2] | 0) + (a << 2)) >> 2] | 0) + 44) >> 2] =
+                          (c[((c[((c[g >> 2] | 0) + 4) >> 2] | 0) + ((a * 12) | 0) + 4) >> 2] | 0) + 1;
+                        a = (a + 1) | 0;
+                      }
+                    }
+                  while (0);
+                  f = c[f >> 2] | 0;
+                }
+                e = c[e >> 2] | 0;
+              }
+              return;
+            }
+            function PQ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0.0,
+                m = 0.0;
+              j = l;
+              l = (l + 32) | 0;
+              d = j;
+              g = (a + 24) | 0;
+              a: do
+                if ((c[g >> 2] | 0) >= 2) {
+                  i = c[15712] | 0;
+                  m = +h[(a + 8) >> 3];
+                  k = +h[(a + 16) >> 3];
+                  c[d >> 2] = b;
+                  h[(d + 8) >> 3] = m;
+                  h[(d + 16) >> 3] = k;
+                  w4(i, 110739, d) | 0;
+                  f = (a + 32) | 0;
+                  a = (a + 28) | 0;
+                  b = 0;
+                  while (1) {
+                    if ((b | 0) >= (c[g >> 2] | 0)) break a;
+                    e = c[((c[((c[f >> 2] | 0) + 4) >> 2] | 0) + ((b * 12) | 0) + 8) >> 2] | 0;
+                    b: do
+                      if (Xz(e) | 0) {
+                        QQ(i, c[((c[a >> 2] | 0) + (b << 2)) >> 2] | 0);
+                        T4(110759, i) | 0;
+                        d = nb[c[e >> 2] & 63](e, 0, 128) | 0;
+                        while (1) {
+                          if (!d) break b;
+                          T4(110764, i) | 0;
+                          QQ(i, c[((c[a >> 2] | 0) + (c[d >> 2] << 2)) >> 2] | 0);
+                          T4(153599, i) | 0;
+                          d = nb[c[e >> 2] & 63](e, d, 8) | 0;
+                        }
+                      }
+                    while (0);
+                    b = (b + 1) | 0;
+                  }
+                }
+              while (0);
+              l = j;
+              return;
+            }
+            function QQ(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0.0,
+                m = 0.0;
+              g = l;
+              l = (l + 80) | 0;
+              f = (g + 40) | 0;
+              e = g;
+              if (!(a[d >> 0] | 0)) {
+                m = +h[(d + 16) >> 3];
+                j = +h[(d + 8) >> 3];
+                k = +h[(d + 24) >> 3];
+                i = RQ(c[(d + 32) >> 2] | 0) | 0;
+                e = RQ(c[(d + 36) >> 2] | 0) | 0;
+                h[f >> 3] = m;
+                h[(f + 8) >> 3] = j;
+                h[(f + 16) >> 3] = k;
+                h[(f + 24) >> 3] = j;
+                c[(f + 32) >> 2] = i;
+                c[(f + 36) >> 2] = e;
+                w4(b, 110770, f) | 0;
+              } else {
+                k = +h[(d + 8) >> 3];
+                j = +h[(d + 16) >> 3];
+                m = +h[(d + 24) >> 3];
+                f = RQ(c[(d + 32) >> 2] | 0) | 0;
+                i = RQ(c[(d + 36) >> 2] | 0) | 0;
+                h[e >> 3] = k;
+                h[(e + 8) >> 3] = j;
+                h[(e + 16) >> 3] = k;
+                h[(e + 24) >> 3] = m;
+                c[(e + 32) >> 2] = f;
+                c[(e + 36) >> 2] = i;
+                w4(b, 110770, e) | 0;
+              }
+              l = g;
+              return;
+            }
+            function RQ(a) {
+              a = a | 0;
+              switch (a | 0) {
+                case 0: {
+                  a = 110821;
+                  break;
+                }
+                case 1: {
+                  a = 110816;
+                  break;
+                }
+                case 2: {
+                  a = 110809;
+                  break;
+                }
+                case 3: {
+                  a = 110802;
+                  break;
+                }
+                case 4: {
+                  a = 110794;
+                  break;
+                }
+                default:
+                  a = 0;
+              }
+              return a | 0;
+            }
+            function SQ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0;
+              w = l;
+              l = (l + 16) | 0;
+              r = (w + 8) | 0;
+              t = w;
+              u = c[(a + 32) >> 2] | 0;
+              v = c[(a + 28) >> 2] | 0;
+              p = (a + 24) | 0;
+              m = (r + 4) | 0;
+              n = (t + 4) | 0;
+              j = 0;
+              a = c[p >> 2] | 0;
+              a: while (1) {
+                q = (j + 1) | 0;
+                if ((q | 0) >= (a | 0)) break;
+                o = (v + (j << 2)) | 0;
+                k = q;
+                while (1) {
+                  if ((k | 0) >= (a | 0)) {
+                    j = q;
+                    continue a;
+                  }
+                  b: do
+                    if (
+                      ((sR(u, j, k) | 0) == 0 ? (sR(u, k, j) | 0) == 0 : 0)
+                        ? ((s = (v + (k << 2)) | 0), TQ(c[o >> 2] | 0, c[s >> 2] | 0) | 0)
+                        : 0
+                    ) {
+                      f = c[o >> 2] | 0;
+                      a = c[(f + 48) >> 2] | 0;
+                      i = c[s >> 2] | 0;
+                      d = c[(i + 48) >> 2] | 0;
+                      e = (d | 0) == 0;
+                      if (a)
+                        if (e) a = 1;
+                        else a = +h[(a + 8) >> 3] != +h[(d + 8) >> 3];
+                      else a = e ^ 1;
+                      g = a & 1;
+                      UQ(r, f, i, 0, g);
+                      a = c[r >> 2] | 0;
+                      i = c[m >> 2] | 0;
+                      f = g ^ 1;
+                      UQ(t, c[o >> 2] | 0, c[s >> 2] | 0, 1, f);
+                      d = c[t >> 2] | 0;
+                      e = c[n >> 2] | 0;
+                      switch (i | 0) {
+                        case -1: {
+                          VQ(c[s >> 2] | 0, c[o >> 2] | 0, g, 0, a, b);
+                          VQ(c[s >> 2] | 0, c[o >> 2] | 0, f, 1, d, b);
+                          if ((e | 0) != 1) break b;
+                          WQ(c[o >> 2] | 0, c[s >> 2] | 0, f, b);
+                          break b;
+                        }
+                        case 0:
+                          switch (e | 0) {
+                            case -1: {
+                              VQ(c[s >> 2] | 0, c[o >> 2] | 0, g, 0, a, b);
+                              VQ(c[s >> 2] | 0, c[o >> 2] | 0, f, 1, d, b);
+                              break b;
+                            }
+                            case 0: {
+                              VQ(c[o >> 2] | 0, c[s >> 2] | 0, 0, g, a, b);
+                              VQ(c[o >> 2] | 0, c[s >> 2] | 0, 1, f, d, b);
+                              break b;
+                            }
+                            case 1: {
+                              VQ(c[o >> 2] | 0, c[s >> 2] | 0, 0, g, a, b);
+                              VQ(c[o >> 2] | 0, c[s >> 2] | 0, 1, f, d, b);
+                              break b;
+                            }
+                            default:
+                              break b;
+                          }
+                        case 1: {
+                          VQ(c[o >> 2] | 0, c[s >> 2] | 0, 0, g, a, b);
+                          VQ(c[o >> 2] | 0, c[s >> 2] | 0, 1, f, d, b);
+                          if ((e | 0) != -1) break b;
+                          WQ(c[o >> 2] | 0, c[s >> 2] | 0, f, b);
+                          break b;
+                        }
+                        default:
+                          break b;
+                      }
+                    }
+                  while (0);
+                  k = (k + 1) | 0;
+                  a = c[p >> 2] | 0;
+                }
+              }
+              l = w;
+              return;
+            }
+            function TQ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if (!(+h[(a + 8) >> 3] == +h[(b + 8) >> 3])) qa(110892, 110161, 843, 110923);
+              if (
+                (+h[(a + 16) >> 3] == +h[(b + 16) >> 3] ? +h[(a + 24) >> 3] == +h[(b + 24) >> 3] : 0)
+                  ? (c[(a + 32) >> 2] | 0) == (c[(b + 32) >> 2] | 0)
+                  : 0
+              )
+                a = ((c[(a + 36) >> 2] | 0) == (c[(b + 36) >> 2] | 0)) & 1;
+              else a = 0;
+              return a | 0;
+            }
+            function UQ(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0;
+              g = 0;
+              while (1) {
+                b = XQ(b, e) | 0;
+                if (!b) {
+                  h = 0;
+                  break;
+                }
+                d = XQ(d, f) | 0;
+                if (!d) {
+                  i = 6;
+                  break;
+                }
+                if (!(TQ(b, d) | 0)) {
+                  i = 7;
+                  break;
+                }
+                g = (g + 1) | 0;
+              }
+              if ((i | 0) == 6) qa(138394, 110161, 871, 110841);
+              else if ((i | 0) == 7) h = ZQ(b, YQ(b, d) | 0, (g + 1) | 0, (1 - e) | 0) | 0;
+              c[a >> 2] = g;
+              c[(a + 4) >> 2] = h;
+              return;
+            }
+            function VQ(b, d, e, f, g, i) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              var j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              o = (i + 20) | 0;
+              n = (i + 24) | 0;
+              i = JQ(c[((a[b >> 0] | 0) == 0 ? o : n) >> 2] | 0, b) | 0;
+              qR(c[(i + 32) >> 2] | 0, c[(b + 40) >> 2] | 0, c[(d + 40) >> 2] | 0);
+              k = 1;
+              while (1) {
+                if ((k | 0) > (g | 0)) break;
+                l = XQ(b, e) | 0;
+                m = XQ(d, f) | 0;
+                do
+                  if (!(a[b >> 0] | 0)) {
+                    j = JQ(c[n >> 2] | 0, l) | 0;
+                    if (+h[(l + 8) >> 3] == +h[(b + 16) >> 3]) {
+                      p = (c[(b + 32) >> 2] | 0) == 1;
+                      i = (sR(c[(i + 32) >> 2] | 0, c[(b + 40) >> 2] | 0, c[(d + 40) >> 2] | 0) | 0) != 0;
+                      b = c[(j + 32) >> 2] | 0;
+                      if (p)
+                        if (i) {
+                          qR(b, c[(m + 40) >> 2] | 0, c[(l + 40) >> 2] | 0);
+                          i = j;
+                          break;
+                        } else {
+                          qR(b, c[(l + 40) >> 2] | 0, c[(m + 40) >> 2] | 0);
+                          i = j;
+                          break;
+                        }
+                      else if (i) {
+                        qR(b, c[(l + 40) >> 2] | 0, c[(m + 40) >> 2] | 0);
+                        i = j;
+                        break;
+                      } else {
+                        qR(b, c[(m + 40) >> 2] | 0, c[(l + 40) >> 2] | 0);
+                        i = j;
+                        break;
+                      }
+                    } else {
+                      p = (c[(b + 36) >> 2] | 0) == 1;
+                      i = (sR(c[(i + 32) >> 2] | 0, c[(b + 40) >> 2] | 0, c[(d + 40) >> 2] | 0) | 0) != 0;
+                      b = c[(j + 32) >> 2] | 0;
+                      if (p)
+                        if (i) {
+                          qR(b, c[(l + 40) >> 2] | 0, c[(m + 40) >> 2] | 0);
+                          i = j;
+                          break;
+                        } else {
+                          qR(b, c[(m + 40) >> 2] | 0, c[(l + 40) >> 2] | 0);
+                          i = j;
+                          break;
+                        }
+                      else if (i) {
+                        qR(b, c[(m + 40) >> 2] | 0, c[(l + 40) >> 2] | 0);
+                        i = j;
+                        break;
+                      } else {
+                        qR(b, c[(l + 40) >> 2] | 0, c[(m + 40) >> 2] | 0);
+                        i = j;
+                        break;
+                      }
+                    }
+                  } else {
+                    j = JQ(c[o >> 2] | 0, l) | 0;
+                    if (+h[(l + 8) >> 3] == +h[(b + 16) >> 3]) {
+                      p = (c[(b + 32) >> 2] | 0) == 2;
+                      i = (sR(c[(i + 32) >> 2] | 0, c[(b + 40) >> 2] | 0, c[(d + 40) >> 2] | 0) | 0) != 0;
+                      b = c[(j + 32) >> 2] | 0;
+                      if (p)
+                        if (i) {
+                          qR(b, c[(l + 40) >> 2] | 0, c[(m + 40) >> 2] | 0);
+                          i = j;
+                          break;
+                        } else {
+                          qR(b, c[(m + 40) >> 2] | 0, c[(l + 40) >> 2] | 0);
+                          i = j;
+                          break;
+                        }
+                      else if (i) {
+                        qR(b, c[(m + 40) >> 2] | 0, c[(l + 40) >> 2] | 0);
+                        i = j;
+                        break;
+                      } else {
+                        qR(b, c[(l + 40) >> 2] | 0, c[(m + 40) >> 2] | 0);
+                        i = j;
+                        break;
+                      }
+                    } else {
+                      p = (c[(b + 36) >> 2] | 0) == 2;
+                      i = (sR(c[(i + 32) >> 2] | 0, c[(b + 40) >> 2] | 0, c[(d + 40) >> 2] | 0) | 0) != 0;
+                      b = c[(j + 32) >> 2] | 0;
+                      if (p)
+                        if (i) {
+                          qR(b, c[(m + 40) >> 2] | 0, c[(l + 40) >> 2] | 0);
+                          i = j;
+                          break;
+                        } else {
+                          qR(b, c[(l + 40) >> 2] | 0, c[(m + 40) >> 2] | 0);
+                          i = j;
+                          break;
+                        }
+                      else if (i) {
+                        qR(b, c[(l + 40) >> 2] | 0, c[(m + 40) >> 2] | 0);
+                        i = j;
+                        break;
+                      } else {
+                        qR(b, c[(m + 40) >> 2] | 0, c[(l + 40) >> 2] | 0);
+                        i = j;
+                        break;
+                      }
+                    }
+                  }
+                while (0);
+                b = l;
+                d = m;
+                k = (k + 1) | 0;
+              }
+              return;
+            }
+            function WQ(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0;
+              while (1) {
+                if (!(TQ(b, d) | 0)) break;
+                g = XQ(b, 1) | 0;
+                d = XQ(d, e) | 0;
+                b = g;
+              }
+              g = c[((JQ(c[((a[b >> 0] | 0) == 0 ? (f + 20) | 0 : (f + 24) | 0) >> 2] | 0, b) | 0) + 32) >> 2] | 0;
+              rR(g, c[(b + 40) >> 2] | 0, c[(d + 40) >> 2] | 0);
+              return;
+            }
+            function XQ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if (!a) qa(110828, 110161, 798, 110832);
+              else return c[((b | 0) == 0 ? (a + 48) | 0 : (a + 52) | 0) >> 2] | 0;
+              return 0;
+            }
+            function YQ(b, c) {
+              b = b | 0;
+              c = c | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              f = l;
+              l = (l + 16) | 0;
+              e = f;
+              d = a[b >> 0] | 0;
+              if ((d << 24) >> 24 == (a[c >> 0] | 0) ? !(+h[(b + 8) >> 3] != +h[(c + 8) >> 3]) : 0) {
+                if (!((d << 24) >> 24)) b = _Q(b, c, 3, 1) | 0;
+                else b = _Q(b, c, 4, 2) | 0;
+                l = f;
+                return b | 0;
+              }
+              gA(1, 110854, e) | 0;
+              bb(189296, 1);
+              return 0;
+            }
+            function ZQ(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0;
+              j = 1;
+              while (1) {
+                if ((j | 0) > (e | 0)) break;
+                i = XQ(b, f) | 0;
+                g = +h[(i + 8) >> 3] == +h[(b + 16) >> 3];
+                do
+                  if (!(a[b >> 0] | 0))
+                    if (g) {
+                      g = (c[(b + 32) >> 2] | 0) == 1;
+                      break;
+                    } else {
+                      g = (c[(b + 36) >> 2] | 0) == 3;
+                      break;
+                    }
+                  else if (g) {
+                    g = (c[(b + 32) >> 2] | 0) == 4;
+                    break;
+                  } else {
+                    g = (c[(b + 36) >> 2] | 0) == 2;
+                    break;
+                  }
+                while (0);
+                b = i;
+                j = (j + 1) | 0;
+                d = g ? (0 - d) | 0 : d;
+              }
+              return d | 0;
+            }
+            function _Q(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              j = +h[(a + 24) >> 3];
+              k = +h[(b + 16) >> 3];
+              do
+                if (!(j < k) ? ((g = +h[(a + 16) >> 3]), (i = +h[(b + 24) >> 3]), !(g > i)) : 0) {
+                  if ((k < j) & (g < k)) {
+                    b = $Q(a, b, d, e) | 0;
+                    break;
+                  }
+                  if ((k < g) & (g < i)) {
+                    b = (0 - ($Q(b, a, d, e) | 0)) | 0;
+                    break;
+                  }
+                  if (!(g == k))
+                    if (j == k) {
+                      d = c[(a + 36) >> 2] | 0;
+                      return ((d | 0) == (c[(b + 32) >> 2] | 0) ? 0 : (d | 0) == (e | 0) ? 1 : -1) | 0;
+                    } else {
+                      d = c[(a + 32) >> 2] | 0;
+                      b = (d | 0) == (c[(b + 36) >> 2] | 0) ? 0 : (d | 0) == (e | 0) ? 1 : -1;
+                      break;
+                    }
+                  if (!(j == i))
+                    if (j < i) {
+                      o = (c[(a + 36) >> 2] | 0) == (d | 0);
+                      d = bR(c[(b + 32) >> 2] | 0, c[(a + 32) >> 2] | 0, d, e) | 0;
+                      return (o ? d : (0 - d) | 0) | 0;
+                    } else {
+                      o = (c[(b + 36) >> 2] | 0) == (e | 0);
+                      b = bR(c[(a + 32) >> 2] | 0, c[(b + 32) >> 2] | 0, d, e) | 0;
+                      b = o ? b : (0 - b) | 0;
+                      break;
+                    }
+                  o = c[(a + 32) >> 2] | 0;
+                  n = c[(b + 32) >> 2] | 0;
+                  if ((o | 0) == (n | 0)) {
+                    b = c[(b + 36) >> 2] | 0;
+                    if ((c[(a + 36) >> 2] | 0) == (b | 0)) {
+                      b = 0;
+                      break;
+                    }
+                  } else b = c[(b + 36) >> 2] | 0;
+                  m = (n | 0) == (d | 0);
+                  if ((n | 0) == (b | 0)) {
+                    if (m) {
+                      b = 1;
+                      break;
+                    }
+                    if ((n | 0) == (e | 0)) {
+                      b = -1;
+                      break;
+                    }
+                    if ((o | 0) != (d | 0) ? (c[(a + 36) >> 2] | 0) != (d | 0) : 0) {
+                      b = 1;
+                      break;
+                    }
+                    if ((o | 0) != (e | 0) ? (c[(a + 36) >> 2] | 0) != (e | 0) : 0) {
+                      b = -1;
+                      break;
+                    }
+                    b = 0;
+                    break;
+                  }
+                  f = (b | 0) == (e | 0);
+                  if (m & f) {
+                    b = (c[(a + 36) >> 2] | 0) == (e | 0);
+                    if ((o | 0) == (d | 0)) {
+                      if (!b) {
+                        b = -1;
+                        break;
+                      }
+                    } else if (b) {
+                      b = 1;
+                      break;
+                    }
+                    b = 0;
+                    break;
+                  }
+                  l = (b | 0) == (d | 0);
+                  if (((n | 0) == (e | 0)) & l) {
+                    b = (o | 0) == (e | 0);
+                    if ((c[(a + 36) >> 2] | 0) == (d | 0)) {
+                      if (!b) {
+                        b = -1;
+                        break;
+                      }
+                    } else if (b) {
+                      b = 1;
+                      break;
+                    }
+                    b = 0;
+                    break;
+                  }
+                  if (!n) {
+                    if (l) {
+                      b = aR(o, c[(a + 36) >> 2] | 0, d) | 0;
+                      break;
+                    }
+                    if (f) {
+                      b = (0 - (aR(o, c[(a + 36) >> 2] | 0, e) | 0)) | 0;
+                      break;
+                    }
+                  }
+                  f = c[(a + 36) >> 2] | 0;
+                  if (m & ((b | 0) == 0)) {
+                    b = aR(f, o, d) | 0;
+                    break;
+                  } else {
+                    b = (0 - (aR(f, o, e) | 0)) | 0;
+                    break;
+                  }
+                } else b = 0;
+              while (0);
+              return b | 0;
+            }
+            function $Q(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0.0,
+                j = 0.0;
+              i = +h[(a + 24) >> 3];
+              j = +h[(b + 24) >> 3];
+              do
+                if (i < j) {
+                  a = c[(a + 36) >> 2] | 0;
+                  if ((a | 0) == (d | 0) ? (c[(b + 32) >> 2] | 0) == (e | 0) : 0) {
+                    a = -1;
+                    break;
+                  }
+                  if ((a | 0) == (e | 0) ? (c[(b + 32) >> 2] | 0) == (d | 0) : 0) {
+                    a = 1;
+                    break;
+                  }
+                  a = 0;
+                } else {
+                  f = c[(b + 32) >> 2] | 0;
+                  g = (f | 0) == (e | 0);
+                  if (i == j)
+                    if (g) {
+                      a = bR(c[(a + 36) >> 2] | 0, c[(b + 36) >> 2] | 0, d, e) | 0;
+                      break;
+                    } else {
+                      a = (0 - (bR(c[(b + 36) >> 2] | 0, c[(a + 36) >> 2] | 0, d, e) | 0)) | 0;
+                      break;
+                    }
+                  if (g ? (c[(b + 36) >> 2] | 0) == (e | 0) : 0) {
+                    a = -1;
+                    break;
+                  }
+                  if ((f | 0) == (d | 0) ? (c[(b + 36) >> 2] | 0) == (d | 0) : 0) {
+                    a = 1;
+                    break;
+                  }
+                  a = 0;
+                }
+              while (0);
+              return a | 0;
+            }
+            function aR(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              return ((a | 0) == (c | 0) ? (((b | 0) == (c | 0)) << 31) >> 31 : 1) | 0;
+            }
+            function bR(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              if ((a | 0) == (d | 0)) {
+                b = (a | 0) == 0;
+                if (b) return 0;
+                else b = b & 1;
+              }
+              return (((((a | 0) != 0) | ((b | 0) != (c | 0))) << 31) >> 31) | 0;
+            }
+            function cR(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              g = c[(a + 28) >> 2] | 0;
+              h = c[(a + 24) >> 2] | 0;
+              d = c[(a + 32) >> 2] | 0;
+              a = 0;
+              a: while (1) {
+                e = (a + 1) | 0;
+                if ((e | 0) >= (h | 0)) break;
+                f = (g + (a << 2)) | 0;
+                b = e;
+                while (1) {
+                  if ((b | 0) == (h | 0)) {
+                    a = e;
+                    continue a;
+                  }
+                  switch (YQ(c[f >> 2] | 0, c[(g + (b << 2)) >> 2] | 0) | 0) {
+                    case 1: {
+                      qR(d, a, b);
+                      break;
+                    }
+                    case -1: {
+                      qR(d, b, a);
+                      break;
+                    }
+                    default: {
+                    }
+                  }
+                  b = (b + 1) | 0;
+                }
+              }
+              return;
+            }
+            function dR(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              f = (a + 24) | 0;
+              e = c[f >> 2] | 0;
+              d = (e + 1) | 0;
+              c[f >> 2] = d;
+              c[(b + 40) >> 2] = e;
+              e = (a + 28) | 0;
+              a = c[e >> 2] | 0;
+              if (!a) a = KK(d << 2) | 0;
+              else a = MK(a, d << 2) | 0;
+              c[e >> 2] = a;
+              c[(a + (((c[f >> 2] | 0) + -1) << 2)) >> 2] = b;
+              return;
+            }
+            function eR(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = +d;
+              var e = 0,
+                f = 0,
+                g = 0;
+              g = l;
+              l = (l + 16) | 0;
+              f = g;
+              h[f >> 3] = d;
+              e = nb[c[a >> 2] & 63](a, f, 512) | 0;
+              if (!e) {
+                e = JK(24) | 0;
+                h[(e + 8) >> 3] = +h[f >> 3];
+                c[(e + 16) >> 2] = Vz(25728, c[4581] | 0) | 0;
+                nb[c[a >> 2] & 63](a, e, 1) | 0;
+              }
+              f = c[(e + 16) >> 2] | 0;
+              nb[c[f >> 2] & 63](f, b, 1) | 0;
+              l = g;
+              return;
+            }
+            function fR(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              pR(c[(b + 32) >> 2] | 0);
+              U1(c[(b + 28) >> 2] | 0);
+              U1(b);
+              return;
+            }
+            function gR(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0;
+              e = +h[b >> 3];
+              f = +h[c >> 3];
+              if (!(e > f))
+                if (e < f) a = (!(+h[(b + 8) >> 3] >= +h[(c + 8) >> 3]) << 31) >> 31;
+                else a = 0;
+              else a = !(+h[(b + 8) >> 3] <= +h[(c + 8) >> 3]) & 1;
+              return a | 0;
+            }
+            function hR(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              Rz(c[(b + 16) >> 2] | 0) | 0;
+              U1(b);
+              return;
+            }
+            function iR(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0;
+              f = +h[b >> 3];
+              e = +h[c >> 3];
+              return (f > e ? 1 : ((f < e) << 31) >> 31) | 0;
+            }
+            function jR(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0.0,
+                g = 0.0,
+                i = 0,
+                j = 0;
+              i = (a[(d + 36) >> 0] | 0) != 0;
+              j = (e + 40) | 0;
+              do
+                if ((c[(d + 24) >> 2] | 0) == (e | 0)) {
+                  f = +h[j >> 3];
+                  if (i) {
+                    g = (+h[(e + 64) >> 3] + +h[(e + 48) >> 3]) * 0.5;
+                    break;
+                  } else {
+                    g = +h[(e + 48) >> 3];
+                    f = (+h[(e + 56) >> 3] + f) * 0.5;
+                    break;
+                  }
+                } else if (i) {
+                  g = (+h[(e + 64) >> 3] + +h[(e + 48) >> 3]) * 0.5;
+                  f = +h[(e + 56) >> 3];
+                  break;
+                } else {
+                  g = +h[(e + 64) >> 3];
+                  f = (+h[(e + 56) >> 3] + +h[j >> 3]) * 0.5;
+                  break;
+                }
+              while (0);
+              h[b >> 3] = f;
+              h[(b + 8) >> 3] = g;
+              return;
+            }
+            function kR(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = c[(a + 20) >> 2] | 0;
+              if ((d | 0) != (c[(b + 20) >> 2] | 0) ? (d | 0) != (c[(b + 24) >> 2] | 0) : 0) d = c[(a + 24) >> 2] | 0;
+              return d | 0;
+            }
+            function lR(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0;
+              c = (+h[(b + 64) >> 3] + +h[(b + 48) >> 3]) * 0.5;
+              h[a >> 3] = (+h[(b + 56) >> 3] + +h[(b + 40) >> 3]) * 0.5;
+              h[(a + 8) >> 3] = c;
+              return;
+            }
+            function mR(b, d, e, f, g, i, j) {
+              b = b | 0;
+              d = d | 0;
+              e = +e;
+              f = +f;
+              g = +g;
+              i = i | 0;
+              j = j | 0;
+              var k = 0,
+                l = 0;
+              a[b >> 0] = d;
+              h[(b + 8) >> 3] = e;
+              if (f < g) {
+                k = 0;
+                l = i;
+                d = j;
+                e = f;
+                f = g;
+              } else {
+                k = 1;
+                l = j;
+                d = i;
+                e = g;
+              }
+              h[(b + 24) >> 3] = f;
+              h[(b + 16) >> 3] = e;
+              c[(b + 36) >> 2] = d;
+              c[(b + 32) >> 2] = l;
+              a[(b + 1) >> 0] = k;
+              return;
+            }
+            function nR(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              e = c[(b + 36) >> 2] | 0;
+              do
+                if ((c[(e + 4) >> 2] | 0) != (d | 0)) {
+                  if ((c[(e + 12) >> 2] | 0) == (d | 0)) {
+                    e = ~~((+h[(b + 56) >> 3] + +h[(b + 40) >> 3]) * 0.5);
+                    d = ~~+h[(b + 48) >> 3];
+                    break;
+                  }
+                  if ((c[(e + 8) >> 2] | 0) == (d | 0)) {
+                    e = ~~+h[(b + 40) >> 3];
+                    d = ~~((+h[(b + 64) >> 3] + +h[(b + 48) >> 3]) * 0.5);
+                    break;
+                  }
+                  if ((c[e >> 2] | 0) == (d | 0)) {
+                    e = ~~+h[(b + 56) >> 3];
+                    d = ~~((+h[(b + 64) >> 3] + +h[(b + 48) >> 3]) * 0.5);
+                  } else {
+                    e = 0;
+                    d = 0;
+                  }
+                } else {
+                  e = ~~((+h[(b + 56) >> 3] + +h[(b + 40) >> 3]) * 0.5);
+                  d = ~~+h[(b + 64) >> 3];
+                }
+              while (0);
+              c[a >> 2] = e;
+              c[(a + 4) >> 2] = d;
+              return;
+            }
+            function oR(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              d = JK(8) | 0;
+              c[d >> 2] = a;
+              e = (d + 4) | 0;
+              c[e >> 2] = JK((a * 12) | 0) | 0;
+              b = 0;
+              while (1) {
+                if ((b | 0) >= (a | 0)) break;
+                g = PU() | 0;
+                f = c[e >> 2] | 0;
+                c[(f + ((b * 12) | 0) + 8) >> 2] = g;
+                c[(f + ((b * 12) | 0)) >> 2] = 0;
+                b = (b + 1) | 0;
+              }
+              return d | 0;
+            }
+            function pR(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              d = (a + 4) | 0;
+              b = 0;
+              while (1) {
+                e = c[d >> 2] | 0;
+                if ((b | 0) >= (c[a >> 2] | 0)) break;
+                Rz(c[(e + ((b * 12) | 0) + 8) >> 2] | 0) | 0;
+                b = (b + 1) | 0;
+              }
+              U1(e);
+              U1(a);
+              return;
+            }
+            function qR(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = l;
+              l = (l + 16) | 0;
+              f = e;
+              c[f >> 2] = d;
+              d = c[((c[(a + 4) >> 2] | 0) + ((b * 12) | 0) + 8) >> 2] | 0;
+              nb[c[d >> 2] & 63](d, f, 1) | 0;
+              l = e;
+              return;
+            }
+            function rR(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              e = l;
+              l = (l + 16) | 0;
+              f = e;
+              c[f >> 2] = d;
+              a = (a + 4) | 0;
+              g = c[((c[a >> 2] | 0) + ((b * 12) | 0) + 8) >> 2] | 0;
+              nb[c[g >> 2] & 63](g, f, 2) | 0;
+              c[f >> 2] = b;
+              d = c[((c[a >> 2] | 0) + ((d * 12) | 0) + 8) >> 2] | 0;
+              nb[c[d >> 2] & 63](d, f, 2) | 0;
+              l = e;
+              return;
+            }
+            function sR(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = l;
+              l = (l + 16) | 0;
+              f = e;
+              c[f >> 2] = d;
+              d = c[((c[(a + 4) >> 2] | 0) + ((b * 12) | 0) + 8) >> 2] | 0;
+              d = ((nb[c[d >> 2] & 63](d, f, 512) | 0) != 0) & 1;
+              l = e;
+              return d | 0;
+            }
+            function tR(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              b = c[a >> 2] | 0;
+              switch (b | 0) {
+                case 0:
+                  break;
+                case 1: {
+                  c[((c[(a + 4) >> 2] | 0) + 4) >> 2] = 0;
+                  break;
+                }
+                default: {
+                  e = uR(b) | 0;
+                  f = (a + 4) | 0;
+                  d = 0;
+                  b = 0;
+                  while (1) {
+                    if ((d | 0) >= (c[a >> 2] | 0)) {
+                      b = 0;
+                      break;
+                    }
+                    if (!(c[((c[f >> 2] | 0) + ((d * 12) | 0)) >> 2] | 0)) b = vR(a, d, b, e) | 0;
+                    d = (d + 1) | 0;
+                  }
+                  while (1) {
+                    d = wR(e) | 0;
+                    if ((d | 0) <= -1) break;
+                    c[((c[f >> 2] | 0) + ((d * 12) | 0) + 4) >> 2] = b;
+                    b = (b + 1) | 0;
+                  }
+                  xR(e);
+                }
+              }
+              return;
+            }
+            function uR(a) {
+              a = a | 0;
+              var b = 0;
+              b = JK(8) | 0;
+              c[(b + 4) >> 2] = JK(a << 2) | 0;
+              c[b >> 2] = -1;
+              return b | 0;
+            }
+            function vR(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              i = (a + 4) | 0;
+              g = c[i >> 2] | 0;
+              j = (g + ((b * 12) | 0)) | 0;
+              c[j >> 2] = 1;
+              g = c[(g + ((b * 12) | 0) + 8) >> 2] | 0;
+              h = (g + 4) | 0;
+              d = (d + 1) | 0;
+              g = Tz(g) | 0;
+              while (1) {
+                if (!g) break;
+                f = c[((c[h >> 2] | 0) + 8) >> 2] | 0;
+                if ((f | 0) < 0) f = c[(g + 8) >> 2] | 0;
+                else f = (g + (0 - f)) | 0;
+                f = c[f >> 2] | 0;
+                if (!(c[((c[i >> 2] | 0) + ((f * 12) | 0)) >> 2] | 0)) d = vR(a, f, d, e) | 0;
+                g = c[g >> 2] | 0;
+              }
+              c[j >> 2] = 2;
+              yR(e, b);
+              return (d + 1) | 0;
+            }
+            function wR(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = c[a >> 2] | 0;
+              if ((b | 0) == -1) a = -1;
+              else {
+                d = c[((c[(a + 4) >> 2] | 0) + (b << 2)) >> 2] | 0;
+                c[a >> 2] = b + -1;
+                a = d;
+              }
+              return a | 0;
+            }
+            function xR(a) {
+              a = a | 0;
+              U1(c[(a + 4) >> 2] | 0);
+              U1(a);
+              return;
+            }
+            function yR(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = ((c[a >> 2] | 0) + 1) | 0;
+              c[a >> 2] = d;
+              c[((c[(a + 4) >> 2] | 0) + (d << 2)) >> 2] = b;
+              return;
+            }
+            function zR(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              e = c[a >> 2] | 0;
+              c[(a + 8) >> 2] = e;
+              c[(a + 12) >> 2] = c[(a + 4) >> 2];
+              d = (a + 16) | 0;
+              a = 0;
+              while (1) {
+                if ((a | 0) >= (e | 0)) break;
+                f = c[d >> 2] | 0;
+                b[(f + ((a * 40) | 0) + 18) >> 1] = b[(f + ((a * 40) | 0) + 16) >> 1] | 0;
+                a = (a + 1) | 0;
+              }
+              return;
+            }
+            function AR(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              d = c[(a + 8) >> 2] | 0;
+              c[a >> 2] = d;
+              c[(a + 4) >> 2] = c[(a + 12) >> 2];
+              e = (a + 16) | 0;
+              a = 0;
+              while (1) {
+                if ((a | 0) >= (d | 0)) break;
+                f = c[e >> 2] | 0;
+                b[(f + ((a * 40) | 0) + 16) >> 1] = b[(f + ((a * 40) | 0) + 18) >> 1] | 0;
+                a = (a + 1) | 0;
+              }
+              d = (d + 2) | 0;
+              while (1) {
+                if ((a | 0) >= (d | 0)) break;
+                b[((c[e >> 2] | 0) + ((a * 40) | 0) + 16) >> 1] = 0;
+                a = (a + 1) | 0;
+              }
+              return;
+            }
+            function BR(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              d = JK(((((c[a >> 2] | 0) * 6) | 0) + (b << 1)) << 2) | 0;
+              c[(a + 20) >> 2] = JK(((((((c[a >> 2] | 0) * 3) | 0) + b) | 0) * 24) | 0) | 0;
+              e = c[a >> 2] | 0;
+              f = (a + 16) | 0;
+              a = 0;
+              while (1) {
+                if ((a | 0) >= (e | 0)) break;
+                c[((c[f >> 2] | 0) + ((a * 40) | 0) + 28) >> 2] = d;
+                d = (d + 24) | 0;
+                a = (a + 1) | 0;
+              }
+              e = (e + 2) | 0;
+              while (1) {
+                if ((a | 0) >= (e | 0)) break;
+                c[((c[f >> 2] | 0) + ((a * 40) | 0) + 28) >> 2] = d;
+                d = (d + (b << 2)) | 0;
+                a = (a + 1) | 0;
+              }
+              return;
+            }
+            function CR(a) {
+              a = a | 0;
+              var b = 0;
+              b = JK(24) | 0;
+              c[b >> 2] = 0;
+              c[(b + 16) >> 2] = JK((a * 40) | 0) | 0;
+              return b | 0;
+            }
+            function DR(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              d = c[(a + 16) >> 2] | 0;
+              b = c[a >> 2] | 0;
+              c[(d + ((b * 40) | 0) + 32) >> 2] = b;
+              c[a >> 2] = b + 1;
+              return (d + ((b * 40) | 0)) | 0;
+            }
+            function ER(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = +e;
+              var f = 0,
+                g = 0;
+              g = (a + 4) | 0;
+              f = c[g >> 2] | 0;
+              c[g >> 2] = f + 1;
+              g = c[(a + 20) >> 2] | 0;
+              a = (g + ((f * 24) | 0)) | 0;
+              c[(g + ((f * 24) | 0) + 12) >> 2] = c[(b + 32) >> 2];
+              c[(g + ((f * 24) | 0) + 16) >> 2] = c[(d + 32) >> 2];
+              h[a >> 3] = e;
+              c[(g + ((f * 24) | 0) + 8) >> 2] = 0;
+              FR(b, f);
+              FR(d, f);
+              return a | 0;
+            }
+            function FR(a, d) {
+              a = a | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = (a + 16) | 0;
+              f = b[e >> 1] | 0;
+              c[((c[(a + 28) >> 2] | 0) + (((f << 16) >> 16) << 2)) >> 2] = d;
+              b[e >> 1] = ((f + 1) << 16) >> 16;
+              return;
+            }
+            function GR(a) {
+              a = a | 0;
+              var b = 0;
+              b = (a + 16) | 0;
+              U1(c[((c[b >> 2] | 0) + 28) >> 2] | 0);
+              U1(c[b >> 2] | 0);
+              U1(c[(a + 20) >> 2] | 0);
+              U1(a);
+              return;
+            }
+            function HR(a, d, e) {
+              a = a | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0;
+              g = c[a >> 2] | 0;
+              i = (a + 16) | 0;
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (g | 0)) break;
+                c[((c[i >> 2] | 0) + ((f * 40) | 0)) >> 2] = -2147483648;
+                f = (f + 1) | 0;
+              }
+              XU();
+              a: do
+                if (!(_U(d) | 0)) {
+                  c[(d + 8) >> 2] = 0;
+                  c[d >> 2] = 0;
+                  d = (a + 20) | 0;
+                  b: while (1) {
+                    g = aV() | 0;
+                    if (!g) {
+                      f = 0;
+                      break a;
+                    }
+                    c[g >> 2] = 0 - (c[g >> 2] | 0);
+                    if ((g | 0) == (e | 0)) {
+                      f = 0;
+                      break a;
+                    }
+                    i = (g + 16) | 0;
+                    j = (g + 28) | 0;
+                    f = 0;
+                    while (1) {
+                      if ((f | 0) >= (b[i >> 1] | 0)) continue b;
+                      k = ((c[d >> 2] | 0) + (((c[((c[j >> 2] | 0) + (f << 2)) >> 2] | 0) * 24) | 0)) | 0;
+                      l = IR(a, k, g) | 0;
+                      m = c[l >> 2] | 0;
+                      do
+                        if ((m | 0) < 0) {
+                          n = ~~-(+h[k >> 3] + +(c[g >> 2] | 0));
+                          if ((m | 0) == -2147483648) {
+                            c[l >> 2] = n;
+                            if (_U(l) | 0) {
+                              f = 1;
+                              break a;
+                            }
+                            c[(l + 8) >> 2] = g;
+                            c[(l + 12) >> 2] = k;
+                            break;
+                          } else {
+                            if ((m | 0) >= (n | 0)) break;
+                            bV(l, n);
+                            c[(l + 8) >> 2] = g;
+                            c[(l + 12) >> 2] = k;
+                            break;
+                          }
+                        }
+                      while (0);
+                      f = (f + 1) | 0;
+                    }
+                  }
+                } else f = 1;
+              while (0);
+              return f | 0;
+            }
+            function IR(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              e = c[(b + 12) >> 2] | 0;
+              if ((e | 0) == (c[(d + 32) >> 2] | 0)) e = c[(b + 16) >> 2] | 0;
+              return ((c[(a + 16) >> 2] | 0) + ((e * 40) | 0)) | 0;
+            }
+            function JR(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              g = c[a >> 2] | 0;
+              LF(g, 3, b) | 0;
+              b = c[(g + 92) >> 2] | 0;
+              do
+                if (b) {
+                  d = c[(b + 16) >> 2] | 0;
+                  h = c[(d + 12) >> 2] | 0;
+                  c[(a + 76) >> 2] = h;
+                  e = c[(d + 16) >> 2] | 0;
+                  c[(a + 84) >> 2] = e;
+                  f = (a + 80) | 0;
+                  c[f >> 2] = c[d >> 2];
+                  c[(a + 88) >> 2] = c[(b + 4) >> 2];
+                  d = (a + 152) | 0;
+                  e = c[d >> 2] | c[e >> 2];
+                  c[d >> 2] = e;
+                  b = c[(g + 80) >> 2] | 0;
+                  if (!b) {
+                    c[(a + 60) >> 2] = 0;
+                    b = 999;
+                    break;
+                  } else {
+                    g = c[(b + 16) >> 2] | 0;
+                    c[(a + 60) >> 2] = c[(g + 12) >> 2];
+                    i = c[(g + 16) >> 2] | 0;
+                    c[(a + 68) >> 2] = i;
+                    c[(a + 72) >> 2] = c[(b + 4) >> 2];
+                    c[d >> 2] = e | c[i >> 2];
+                    c[(a + 64) >> 2] = c[((h | 0) == 0 ? f : g) >> 2];
+                    b = 300;
+                    break;
+                  }
+                } else b = 999;
+              while (0);
+              return b | 0;
+            }
+            function KR(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = c[(a + 60) >> 2] | 0;
+              if (!(kF(a) | 0))
+                if ((b | 0) != 0 ? ((d = c[b >> 2] | 0), (d | 0) != 0) : 0) {
+                  tb[d & 127](a);
+                  a = 0;
+                } else a = 0;
+              else a = 1;
+              return a | 0;
+            }
+            function LR(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = c[(a + 60) >> 2] | 0;
+              if (b | 0 ? ((d = c[(b + 4) >> 2] | 0), d | 0) : 0) tb[d & 127](a);
+              c[((c[a >> 2] | 0) + 24) >> 2] = 0;
+              sF(a);
+              return;
+            }
+            function MR(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0;
+              e = +h[(b + 504) >> 3];
+              f = +h[(b + 512) >> 3];
+              i = +h[(b + 352) >> 3];
+              if (!(c[(b + 360) >> 2] | 0)) {
+                g = +h[d >> 3] + e;
+                d = (d + 8) | 0;
+                e = f;
+              } else g = -(f + +h[(d + 8) >> 3]);
+              f = +h[(b + 528) >> 3] * i * (+h[d >> 3] + e);
+              h[a >> 3] = +h[(b + 520) >> 3] * i * g;
+              h[(a + 8) >> 3] = f;
+              return;
+            }
+            function NR(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0;
+              f = +h[(a + 504) >> 3];
+              g = +h[(a + 512) >> 3];
+              i = +h[(a + 352) >> 3];
+              j = +h[(a + 520) >> 3] * i;
+              i = +h[(a + 528) >> 3] * i;
+              a: do
+                if (!(c[(a + 360) >> 2] | 0)) {
+                  a = 0;
+                  while (1) {
+                    if ((a | 0) >= (e | 0)) break a;
+                    h[(d + (a << 4)) >> 3] = (+h[(b + (a << 4)) >> 3] + f) * j;
+                    h[(d + (a << 4) + 8) >> 3] = (+h[(b + (a << 4) + 8) >> 3] + g) * i;
+                    a = (a + 1) | 0;
+                  }
+                } else {
+                  a = 0;
+                  while (1) {
+                    if ((a | 0) >= (e | 0)) break a;
+                    k = -(j * (+h[(b + (a << 4) + 8) >> 3] + g));
+                    h[(d + (a << 4) + 8) >> 3] = (+h[(b + (a << 4)) >> 3] + f) * i;
+                    h[(d + (a << 4)) >> 3] = k;
+                    a = (a + 1) | 0;
+                  }
+                }
+              while (0);
+              return d | 0;
+            }
+            function OR(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              b = c[(a + 60) >> 2] | 0;
+              if (b | 0 ? ((d = c[(b + 8) >> 2] | 0), d | 0) : 0) tb[d & 127](a);
+              return;
+            }
+            function PR(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = c[(a + 60) >> 2] | 0;
+              if (b | 0 ? ((d = c[(b + 12) >> 2] | 0), d | 0) : 0) tb[d & 127](a);
+              rF(a);
+              return;
+            }
+            function QR(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = c[(a + 60) >> 2] | 0;
+              if (b | 0 ? ((d = c[(b + 24) >> 2] | 0), d | 0) : 0) tb[d & 127](a);
+              return;
+            }
+            function RR(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = c[(a + 60) >> 2] | 0;
+              if (b | 0 ? ((d = c[(b + 28) >> 2] | 0), d | 0) : 0) tb[d & 127](a);
+              return;
+            }
+            function SR(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = c[(a + 60) >> 2] | 0;
+              if (b | 0 ? ((d = c[(b + 16) >> 2] | 0), d | 0) : 0) {
+                b = c[(a + 160) >> 2] | 0;
+                xb[d & 31](a, c[((c[((c[a >> 2] | 0) + 308) >> 2] | 0) + (b << 2)) >> 2] | 0, b, c[(a + 156) >> 2] | 0);
+              }
+              return;
+            }
+            function TR(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = c[(a + 60) >> 2] | 0;
+              if (b | 0 ? ((d = c[(b + 20) >> 2] | 0), d | 0) : 0) tb[d & 127](a);
+              return;
+            }
+            function UR(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              b = c[(a + 60) >> 2] | 0;
+              if (b | 0 ? ((d = c[(b + 32) >> 2] | 0), d | 0) : 0) tb[d & 127](a);
+              return;
+            }
+            function VR(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              b = c[(a + 60) >> 2] | 0;
+              if (b | 0 ? ((d = c[(b + 36) >> 2] | 0), d | 0) : 0) tb[d & 127](a);
+              return;
+            }
+            function WR(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = c[(a + 60) >> 2] | 0;
+              if (b | 0 ? ((d = c[(b + 40) >> 2] | 0), d | 0) : 0) tb[d & 127](a);
+              return;
+            }
+            function XR(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = c[(a + 60) >> 2] | 0;
+              if (b | 0 ? ((d = c[(b + 44) >> 2] | 0), d | 0) : 0) tb[d & 127](a);
+              return;
+            }
+            function YR(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = c[(a + 60) >> 2] | 0;
+              if (b | 0 ? ((d = c[(b + 48) >> 2] | 0), d | 0) : 0) tb[d & 127](a);
+              return;
+            }
+            function ZR(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = c[(a + 60) >> 2] | 0;
+              if (b | 0 ? ((d = c[(b + 52) >> 2] | 0), d | 0) : 0) tb[d & 127](a);
+              return;
+            }
+            function _R(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              b = c[(a + 60) >> 2] | 0;
+              if (b | 0 ? ((d = c[(b + 56) >> 2] | 0), d | 0) : 0) tb[d & 127](a);
+              return;
+            }
+            function $R(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = c[(a + 60) >> 2] | 0;
+              if (b | 0 ? ((d = c[(b + 60) >> 2] | 0), d | 0) : 0) tb[d & 127](a);
+              return;
+            }
+            function aS(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              b = c[(a + 60) >> 2] | 0;
+              if (b | 0 ? ((d = c[(b + 64) >> 2] | 0), d | 0) : 0) tb[d & 127](a);
+              return;
+            }
+            function bS(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = c[(a + 60) >> 2] | 0;
+              if (b | 0 ? ((d = c[(b + 68) >> 2] | 0), d | 0) : 0) tb[d & 127](a);
+              return;
+            }
+            function cS(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0;
+              g = c[(a + 60) >> 2] | 0;
+              if (g | 0 ? ((h = c[(g + 72) >> 2] | 0), h | 0) : 0) yb[h & 15](a, b, d, e, f);
+              return;
+            }
+            function dS(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = c[(a + 60) >> 2] | 0;
+              if (b | 0 ? ((d = c[(b + 76) >> 2] | 0), d | 0) : 0) tb[d & 127](a);
+              return;
+            }
+            function eS(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = c[(a + 60) >> 2] | 0;
+              if (d | 0 ? ((e = c[(d + 80) >> 2] | 0), e | 0) : 0) ub[e & 63](a, b);
+              return;
+            }
+            function fS(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = c[(a + 60) >> 2] | 0;
+              if (b | 0 ? ((d = c[(b + 84) >> 2] | 0), d | 0) : 0) tb[d & 127](a);
+              return;
+            }
+            function gS(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              k = l;
+              l = (l + 48) | 0;
+              f = (k + 32) | 0;
+              h = k;
+              i = (k + 16) | 0;
+              j = c[(b + 60) >> 2] | 0;
+              m = c[e >> 2] | 0;
+              do
+                if (m | 0 ? a[m >> 0] | 0 : 0) {
+                  m = c[(b + 16) >> 2] | 0;
+                  if (m | 0 ? (c[(m + 144) >> 2] | 0) == 0 : 0) break;
+                  if (!(c[(b + 152) >> 2] & 8192)) {
+                    c[f >> 2] = c[d >> 2];
+                    c[(f + 4) >> 2] = c[(d + 4) >> 2];
+                    c[(f + 8) >> 2] = c[(d + 8) >> 2];
+                    c[(f + 12) >> 2] = c[(d + 12) >> 2];
+                    MR(i, b, f);
+                    c[h >> 2] = c[i >> 2];
+                    c[(h + 4) >> 2] = c[(i + 4) >> 2];
+                    c[(h + 8) >> 2] = c[(i + 8) >> 2];
+                    c[(h + 12) >> 2] = c[(i + 12) >> 2];
+                  } else {
+                    c[h >> 2] = c[d >> 2];
+                    c[(h + 4) >> 2] = c[(d + 4) >> 2];
+                    c[(h + 8) >> 2] = c[(d + 8) >> 2];
+                    c[(h + 12) >> 2] = c[(d + 12) >> 2];
+                  }
+                  if (j | 0 ? ((g = c[(j + 88) >> 2] | 0), g | 0) : 0) {
+                    c[f >> 2] = c[h >> 2];
+                    c[(f + 4) >> 2] = c[(h + 4) >> 2];
+                    c[(f + 8) >> 2] = c[(h + 8) >> 2];
+                    c[(f + 12) >> 2] = c[(h + 12) >> 2];
+                    vb[g & 127](b, f, e);
+                  }
+                }
+              while (0);
+              l = k;
+              return;
+            }
+            function hS(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              f = c[(b + 60) >> 2] | 0;
+              g = ((c[(b + 16) >> 2] | 0) + 16) | 0;
+              i = R2(d, 58) | 0;
+              h = (i | 0) != 0;
+              if (h) a[i >> 0] = 0;
+              if (f | 0 ? (iS(c[(b + 68) >> 2] | 0, d, g), (e = c[(f + 92) >> 2] | 0), e | 0) : 0) ub[e & 63](b, g);
+              if (h) a[i >> 0] = 58;
+              return;
+            }
+            function iS(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 32) | 0;
+              g = (k + 16) | 0;
+              j = (k + 8) | 0;
+              i = k;
+              c[d >> 2] = b;
+              c[(d + 32) >> 2] = 5;
+              e = zT(b) | 0;
+              f = c[(a + 16) >> 2] | 0;
+              if (!((f | 0) != 0 ? (u5(e, f, c[(a + 20) >> 2] | 0, 4, 102) | 0) != 0 : 0)) h = 3;
+              a: do
+                if ((h | 0) == 3) {
+                  switch (AT(b, d, c[(a + 24) >> 2] | 0) | 0) {
+                    case 0:
+                      break a;
+                    case 1:
+                      break;
+                    default: {
+                      gA(1, 111046, g) | 0;
+                      break a;
+                    }
+                  }
+                  a = KK(((l2(b) | 0) + 16) | 0) | 0;
+                  c[i >> 2] = b;
+                  m4(a, 111011, i) | 0;
+                  if (PJ(a) | 0) {
+                    c[j >> 2] = b;
+                    gA(0, 111020, j) | 0;
+                  }
+                  U1(a);
+                }
+              while (0);
+              l = k;
+              return;
+            }
+            function jS(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              f = c[(b + 60) >> 2] | 0;
+              g = ((c[(b + 16) >> 2] | 0) + 56) | 0;
+              i = R2(d, 58) | 0;
+              h = (i | 0) != 0;
+              if (h) a[i >> 0] = 0;
+              if (f | 0 ? (iS(c[(b + 68) >> 2] | 0, d, g), (e = c[(f + 92) >> 2] | 0), e | 0) : 0) ub[e & 63](b, g);
+              if (h) a[i >> 0] = 58;
+              return;
+            }
+            function kS(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = +e;
+              var f = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              h = c[(a + 60) >> 2] | 0;
+              i = (a + 16) | 0;
+              j = ((c[i >> 2] | 0) + 96) | 0;
+              if (h | 0 ? (iS(c[(a + 68) >> 2] | 0, b, j), (f = c[(h + 92) >> 2] | 0), f | 0) : 0) ub[f & 63](a, j);
+              j = c[i >> 2] | 0;
+              c[(j + 136) >> 2] = d;
+              g[(j + 140) >> 2] = e;
+              return;
+            }
+            function lS(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              m = l;
+              l = (l + 16) | 0;
+              k = m;
+              j = c[(b + 60) >> 2] | 0;
+              b = c[(b + 16) >> 2] | 0;
+              c[(b + 160) >> 2] = d;
+              a: do
+                if (((d | 0) != 0) & ((j | 0) != 0)) {
+                  j = (b + 144) | 0;
+                  i = (b + 152) | 0;
+                  g = (b + 148) | 0;
+                  b = d;
+                  b: while (1) {
+                    f = (b + 4) | 0;
+                    b = c[b >> 2] | 0;
+                    if (!b) break a;
+                    c: do
+                      switch (a[b >> 0] | 0) {
+                        case 115: {
+                          if (!(s2(b, 111067) | 0)) {
+                            c[j >> 2] = 3;
+                            b = f;
+                            continue b;
+                          }
+                          if (!(s2(b, 111088) | 0)) {
+                            e = 115;
+                            while (1) {
+                              d = (b + 1) | 0;
+                              if (!((e << 24) >> 24)) break;
+                              b = d;
+                              e = a[d >> 0] | 0;
+                            }
+                            h[i >> 3] = +r5(d);
+                            b = f;
+                            continue b;
+                          }
+                          break;
+                        }
+                        case 100: {
+                          if (!(s2(b, 137327) | 0)) {
+                            c[j >> 2] = 1;
+                            b = f;
+                            continue b;
+                          }
+                          if (!(s2(b, 137320) | 0)) {
+                            c[j >> 2] = 2;
+                            b = f;
+                            continue b;
+                          }
+                          break;
+                        }
+                        case 105: {
+                          if (s2(b, 134335) | 0 ? s2(b, 111073) | 0 : 0) break c;
+                          c[j >> 2] = 0;
+                          b = f;
+                          continue b;
+                        }
+                        case 98: {
+                          if (!(s2(b, 111083) | 0)) {
+                            h[i >> 3] = 2.0;
+                            b = f;
+                            continue b;
+                          }
+                          break;
+                        }
+                        case 102: {
+                          if (!(s2(b, 111101) | 0)) {
+                            c[g >> 2] = 1;
+                            b = f;
+                            continue b;
+                          }
+                          break;
+                        }
+                        case 117: {
+                          if (!(s2(b, 111108) | 0)) {
+                            c[g >> 2] = 0;
+                            b = f;
+                            continue b;
+                          }
+                          break;
+                        }
+                        case 116: {
+                          if (!(s2(b, 111117) | 0)) {
+                            b = f;
+                            continue b;
+                          }
+                          break;
+                        }
+                        default: {
+                        }
+                      }
+                    while (0);
+                    c[k >> 2] = b;
+                    gA(0, 111125, k) | 0;
+                    b = f;
+                  }
+                }
+              while (0);
+              l = m;
+              return;
+            }
+            function mS(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 32) | 0;
+              g = j;
+              d = c[(a + 60) >> 2] | 0;
+              if (
+                (d | 0 ? ((i = (d + 96) | 0), (f = c[i >> 2] | 0), f | 0) : 0)
+                  ? c[((c[(a + 16) >> 2] | 0) + 144) >> 2] | 0
+                  : 0
+              ) {
+                d = (b + 16) | 0;
+                h[g >> 3] = (+h[d >> 3] + +h[b >> 3]) * 0.5;
+                h[(g + 8) >> 3] = (+h[(b + 24) >> 3] + +h[(b + 8) >> 3]) * 0.5;
+                b = (g + 16) | 0;
+                c[b >> 2] = c[d >> 2];
+                c[(b + 4) >> 2] = c[(d + 4) >> 2];
+                c[(b + 8) >> 2] = c[(d + 8) >> 2];
+                c[(b + 12) >> 2] = c[(d + 12) >> 2];
+                if (!(c[(a + 152) >> 2] & 8192)) {
+                  NR(a, g, g, 2) | 0;
+                  f = c[i >> 2] | 0;
+                }
+                vb[f & 127](a, g, e);
+              }
+              l = j;
+              return;
+            }
+            function nS(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              o = l;
+              l = (l + 48) | 0;
+              m = o;
+              f = c[(a + 60) >> 2] | 0;
+              if (
+                (f | 0 ? ((n = (f + 100) | 0), c[n >> 2] | 0) : 0)
+                  ? ((k = (a + 16) | 0), (j = c[k >> 2] | 0), c[(j + 144) >> 2] | 0)
+                  : 0
+              ) {
+                if (!(e & 4)) {
+                  f = e;
+                  g = 0;
+                } else {
+                  f = e & -5;
+                  e = (j + 16) | 0;
+                  g = m;
+                  h = e;
+                  i = (g + 40) | 0;
+                  do {
+                    c[g >> 2] = c[h >> 2];
+                    g = (g + 4) | 0;
+                    h = (h + 4) | 0;
+                  } while ((g | 0) < (i | 0));
+                  g = e;
+                  h = (j + 56) | 0;
+                  i = (g + 40) | 0;
+                  do {
+                    c[g >> 2] = c[h >> 2];
+                    g = (g + 4) | 0;
+                    h = (h + 4) | 0;
+                  } while ((g | 0) < (i | 0));
+                  g = 1;
+                }
+                if (!(c[(a + 152) >> 2] & 8192)) {
+                  e = (d + 10) | 0;
+                  if ((c[47363] | 0) < (d | 0)) {
+                    c[47363] = e;
+                    e = MK(c[47364] | 0, e << 4) | 0;
+                    c[47364] = e;
+                  } else e = c[47364] | 0;
+                  NR(a, b, e, d) | 0;
+                  xb[c[n >> 2] & 31](a, e, d, f);
+                } else xb[c[n >> 2] & 31](a, b, d, f);
+                if (g | 0) {
+                  g = ((c[k >> 2] | 0) + 16) | 0;
+                  h = m;
+                  i = (g + 40) | 0;
+                  do {
+                    c[g >> 2] = c[h >> 2];
+                    g = (g + 4) | 0;
+                    h = (h + 4) | 0;
+                  } while ((g | 0) < (i | 0));
+                }
+              }
+              l = o;
+              return;
+            }
+            function oS(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              e = l;
+              l = (l + 64) | 0;
+              f = e;
+              c[f >> 2] = c[b >> 2];
+              c[(f + 4) >> 2] = c[(b + 4) >> 2];
+              c[(f + 8) >> 2] = c[(b + 8) >> 2];
+              c[(f + 12) >> 2] = c[(b + 12) >> 2];
+              g = (f + 32) | 0;
+              b = (b + 16) | 0;
+              c[g >> 2] = c[b >> 2];
+              c[(g + 4) >> 2] = c[(b + 4) >> 2];
+              c[(g + 8) >> 2] = c[(b + 8) >> 2];
+              c[(g + 12) >> 2] = c[(b + 12) >> 2];
+              h[(f + 16) >> 3] = +h[f >> 3];
+              h[(f + 24) >> 3] = +h[(f + 40) >> 3];
+              h[(f + 48) >> 3] = +h[g >> 3];
+              h[(f + 56) >> 3] = +h[(f + 8) >> 3];
+              nS(a, f, 4, d);
+              l = e;
+              return;
+            }
+            function pS(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0;
+              i = c[(a + 60) >> 2] | 0;
+              do
+                if (
+                  (i | 0 ? ((j = (i + 104) | 0), (h = c[j >> 2] | 0), h | 0) : 0)
+                    ? c[((c[(a + 16) >> 2] | 0) + 144) >> 2] | 0
+                    : 0
+                ) {
+                  if ((c[(a + 152) >> 2] & 8192) | 0) {
+                    zb[h & 15](a, b, d, e, f, g & 255);
+                    break;
+                  }
+                  h = (d + 10) | 0;
+                  if ((c[47363] | 0) < (d | 0)) {
+                    c[47363] = h;
+                    h = MK(c[47364] | 0, h << 4) | 0;
+                    c[47364] = h;
+                  } else h = c[47364] | 0;
+                  NR(a, b, h, d) | 0;
+                  zb[c[j >> 2] & 15](a, h, d, e, f, g & 255);
+                }
+              while (0);
+              return;
+            }
+            function qS(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              e = c[(a + 60) >> 2] | 0;
+              do
+                if (
+                  (e | 0 ? ((g = (e + 108) | 0), (f = c[g >> 2] | 0), f | 0) : 0)
+                    ? c[((c[(a + 16) >> 2] | 0) + 144) >> 2] | 0
+                    : 0
+                ) {
+                  if ((c[(a + 152) >> 2] & 8192) | 0) {
+                    vb[f & 127](a, b, d);
+                    break;
+                  }
+                  e = (d + 10) | 0;
+                  if ((c[47363] | 0) < (d | 0)) {
+                    c[47363] = e;
+                    e = MK(c[47364] | 0, e << 4) | 0;
+                    c[47364] = e;
+                  } else e = c[47364] | 0;
+                  NR(a, b, e, d) | 0;
+                  vb[c[g >> 2] & 127](a, e, d);
+                }
+              while (0);
+              return;
+            }
+            function rS(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = c[(b + 60) >> 2] | 0;
+              if ((d | 0 ? !(((e | 0) == 0) | ((a[d >> 0] | 0) == 0)) : 0) ? ((f = c[(e + 112) >> 2] | 0), f | 0) : 0)
+                ub[f & 63](b, d);
+              return;
+            }
+            function sS(b, d, e, f, g, i) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              var j = 0.0,
+                k = 0.0,
+                m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0,
+                r = 0.0,
+                s = 0,
+                t = 0.0,
+                u = 0.0,
+                v = 0.0,
+                w = 0.0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0;
+              F = l;
+              l = (l + 112) | 0;
+              B = (F + 64) | 0;
+              E = F;
+              n = (F + 96) | 0;
+              x = (F + 48) | 0;
+              y = (F + 32) | 0;
+              C = c[(b + 60) >> 2] | 0;
+              if (!b) qa(111282, 111178, 691, 111189);
+              if (!d) qa(111208, 111178, 692, 111189);
+              if (!(a[d >> 0] | 0)) qa(111213, 111178, 693, 111189);
+              D = NF(d) | 0;
+              if (!D) {
+                if (((C | 0) != 0) & ((iN(d) | 0) != 0) ? ((m = c[(C + 116) >> 2] | 0), m | 0) : 0)
+                  yb[m & 15](b, d, e, f, g & 255);
+              } else {
+                s = (b + 432) | 0;
+                c[B >> 2] = c[s >> 2];
+                c[(B + 4) >> 2] = c[(s + 4) >> 2];
+                c[(B + 8) >> 2] = c[(s + 8) >> 2];
+                c[(B + 12) >> 2] = c[(s + 12) >> 2];
+                QF(n, D, B);
+                s = c[n >> 2] | 0;
+                m = c[(n + 4) >> 2] | 0;
+                if (!(((s | 0) < 1) & ((m | 0) < 1))) {
+                  n = (E + 16) | 0;
+                  c[n >> 2] = c[e >> 2];
+                  c[(n + 4) >> 2] = c[(e + 4) >> 2];
+                  c[(n + 8) >> 2] = c[(e + 8) >> 2];
+                  c[(n + 12) >> 2] = c[(e + 12) >> 2];
+                  c[E >> 2] = c[e >> 2];
+                  c[(E + 4) >> 2] = c[(e + 4) >> 2];
+                  c[(E + 8) >> 2] = c[(e + 8) >> 2];
+                  c[(E + 12) >> 2] = c[(e + 12) >> 2];
+                  z = (E + 8) | 0;
+                  A = (E + 24) | 0;
+                  d = 1;
+                  while (1) {
+                    if ((d | 0) >= (f | 0)) break;
+                    G = (e + (d << 4)) | 0;
+                    v = +h[G >> 3];
+                    h[E >> 3] = +h[(+h[E >> 3] < v ? E : G) >> 3];
+                    w = +h[(e + (d << 4) + 8) >> 3];
+                    h[z >> 3] = +h[((+h[z >> 3] < w ? E : G) + 8) >> 3];
+                    h[n >> 3] = +h[(+h[n >> 3] > v ? n : G) >> 3];
+                    h[A >> 3] = +h[((+h[A >> 3] > w ? n : G) + 8) >> 3];
+                    d = (d + 1) | 0;
+                  }
+                  k = +h[n >> 3];
+                  j = +h[E >> 3];
+                  t = k - j;
+                  u = +h[A >> 3];
+                  v = +h[z >> 3];
+                  w = u - v;
+                  o = +(m | 0);
+                  p = +(s | 0);
+                  q = t / p;
+                  r = w / o;
+                  a: do
+                    switch (tS(i) | 0) {
+                      case 1:
+                        if (q < r) {
+                          p = q * p;
+                          o = q * o;
+                          break a;
+                        } else {
+                          p = r * p;
+                          o = r * o;
+                          break a;
+                        }
+                      case 2: {
+                        p = q * p;
+                        break;
+                      }
+                      case 3: {
+                        o = r * o;
+                        break;
+                      }
+                      case 4: {
+                        p = q * p;
+                        o = r * o;
+                        break;
+                      }
+                      default: {
+                      }
+                    }
+                  while (0);
+                  if (p < t) {
+                    t = (t - p) * 0.5;
+                    j = j + t;
+                    h[E >> 3] = j;
+                    k = k - t;
+                    h[n >> 3] = k;
+                  }
+                  if (o < w) {
+                    w = (w - o) * 0.5;
+                    h[z >> 3] = v + w;
+                    h[A >> 3] = u - w;
+                  }
+                  if (!(c[(b + 152) >> 2] & 8192)) {
+                    c[B >> 2] = c[E >> 2];
+                    c[(B + 4) >> 2] = c[(E + 4) >> 2];
+                    c[(B + 8) >> 2] = c[(E + 8) >> 2];
+                    c[(B + 12) >> 2] = c[(E + 12) >> 2];
+                    MR(x, b, B);
+                    c[E >> 2] = c[x >> 2];
+                    c[(E + 4) >> 2] = c[(x + 4) >> 2];
+                    c[(E + 8) >> 2] = c[(x + 8) >> 2];
+                    c[(E + 12) >> 2] = c[(x + 12) >> 2];
+                    c[B >> 2] = c[n >> 2];
+                    c[(B + 4) >> 2] = c[(n + 4) >> 2];
+                    c[(B + 8) >> 2] = c[(n + 8) >> 2];
+                    c[(B + 12) >> 2] = c[(n + 12) >> 2];
+                    MR(y, b, B);
+                    c[n >> 2] = c[y >> 2];
+                    c[(n + 4) >> 2] = c[(y + 4) >> 2];
+                    c[(n + 8) >> 2] = c[(y + 8) >> 2];
+                    c[(n + 12) >> 2] = c[(y + 12) >> 2];
+                    k = +h[n >> 3];
+                    j = +h[E >> 3];
+                  }
+                  if (j > k) {
+                    h[E >> 3] = k;
+                    h[n >> 3] = j;
+                  }
+                  j = +h[z >> 3];
+                  k = +h[A >> 3];
+                  if (j > k) {
+                    h[z >> 3] = k;
+                    h[A >> 3] = j;
+                  }
+                  if (C | 0) {
+                    G = c[(b + 72) >> 2] | 0;
+                    c[B >> 2] = c[E >> 2];
+                    c[(B + 4) >> 2] = c[(E + 4) >> 2];
+                    c[(B + 8) >> 2] = c[(E + 8) >> 2];
+                    c[(B + 12) >> 2] = c[(E + 12) >> 2];
+                    c[(B + 16) >> 2] = c[(E + 16) >> 2];
+                    c[(B + 20) >> 2] = c[(E + 20) >> 2];
+                    c[(B + 24) >> 2] = c[(E + 24) >> 2];
+                    c[(B + 28) >> 2] = c[(E + 28) >> 2];
+                    xS(b, D, B, g, G);
+                  }
+                }
+              }
+              l = F;
+              return;
+            }
+            function tS(b) {
+              b = b | 0;
+              if (a[b >> 0] | 0)
+                if (c3(b, 141116) | 0)
+                  if (c3(b, 141048) | 0)
+                    if (!(c3(b, 111221) | 0)) b = 4;
+                    else b = (((dP(b) | 0) << 24) >> 24 != 0) & 1;
+                  else b = 3;
+                else b = 2;
+              else b = 0;
+              return b | 0;
+            }
+            function uS(a, b) {
+              a = a | 0;
+              b = +b;
+              if (c[(a + 60) >> 2] | 0) h[((c[(a + 16) >> 2] | 0) + 152) >> 3] = b;
+              return;
+            }
+            function vS(a, b) {
+              a = a | 0;
+              b = b | 0;
+              b = LF(a, 1, b) | 0;
+              if (!b) b = 999;
+              else {
+                b = c[(b + 16) >> 2] | 0;
+                c[(a + 184) >> 2] = c[(b + 4) >> 2];
+                c[(a + 172) >> 2] = c[(b + 12) >> 2];
+                c[(a + 176) >> 2] = c[b >> 2];
+                c[(a + 180) >> 2] = c[(b + 16) >> 2];
+                b = 300;
+              }
+              return b | 0;
+            }
+            function wS(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 16) | 0;
+              f = i;
+              TC(b, 137483, 280, 1) | 0;
+              g = (b + 16) | 0;
+              c[((c[g >> 2] | 0) + 144) >> 2] = a;
+              if ((yC(b) | 0) != (b | 0)) c[((c[((yC(b) | 0) + 16) >> 2] | 0) + 144) >> 2] = a;
+              e = QA(b, 111226) | 0;
+              d = (a + 172) | 0;
+              if ((e | 0) != 0 ? ((c[d >> 2] = 0), (vS(a, e) | 0) == 999) : 0) {
+                d = MF(a, 1, e) | 0;
+                c[f >> 2] = e;
+                c[(f + 4) >> 2] = d;
+                gA(1, 111233, f) | 0;
+                d = -1;
+              } else {
+                e = c[d >> 2] | 0;
+                if (!e) d = -1;
+                else {
+                  RJ(1);
+                  qK(b, c[c[(a + 180) >> 2] >> 2] & 1);
+                  d = c[((c[g >> 2] | 0) + 8) >> 2] | 0;
+                  c[((c[((yC(b) | 0) + 16) >> 2] | 0) + 8) >> 2] = d;
+                  _N();
+                  d = c[e >> 2] | 0;
+                  if (d | 0 ? (tb[d & 127](b), (h = c[(e + 4) >> 2] | 0), h | 0) : 0)
+                    c[((c[g >> 2] | 0) + 148) >> 2] = h;
+                  RJ(0);
+                  d = 0;
+                }
+              }
+              l = i;
+              return d | 0;
+            }
+            function xS(b, d, e, f, g) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              n = l;
+              l = (l + 176) | 0;
+              k = (n + 8) | 0;
+              j = n;
+              h = (n + 40) | 0;
+              if (!b) qa(111282, 111286, 52, 111300);
+              if (!d) qa(111312, 111286, 53, 111300);
+              i = c[(d + 8) >> 2] | 0;
+              if (!i) qa(111315, 111286, 54, 111300);
+              if (!(a[i >> 0] | 0)) qa(111324, 111286, 55, 111300);
+              r3(h, c[(d + 28) >> 2] | 0) | 0;
+              i = (h + (l2(h) | 0)) | 0;
+              a[i >> 0] = 58;
+              a[(i + 1) >> 0] = 0;
+              F4(h, g) | 0;
+              if ((yS(b, h) | 0) == 999) {
+                c[j >> 2] = h;
+                gA(0, 111336, j) | 0;
+              }
+              g = c[(b + 92) >> 2] | 0;
+              if (g | 0 ? ((m = c[g >> 2] | 0), m | 0) : 0) {
+                c[k >> 2] = c[e >> 2];
+                c[(k + 4) >> 2] = c[(e + 4) >> 2];
+                c[(k + 8) >> 2] = c[(e + 8) >> 2];
+                c[(k + 12) >> 2] = c[(e + 12) >> 2];
+                c[(k + 16) >> 2] = c[(e + 16) >> 2];
+                c[(k + 20) >> 2] = c[(e + 20) >> 2];
+                c[(k + 24) >> 2] = c[(e + 24) >> 2];
+                c[(k + 28) >> 2] = c[(e + 28) >> 2];
+                xb[m & 31](b, d, k, f);
+              }
+              l = n;
+              return;
+            }
+            function yS(a, b) {
+              a = a | 0;
+              b = b | 0;
+              b = LF(c[a >> 2] | 0, 4, b) | 0;
+              if (!b) b = 999;
+              else {
+                b = c[(b + 16) >> 2] | 0;
+                c[(a + 92) >> 2] = c[(b + 12) >> 2];
+                c[(a + 96) >> 2] = c[b >> 2];
+                b = 300;
+              }
+              return b | 0;
+            }
+            function zS(a) {
+              a = a | 0;
+              return 1;
+            }
+            function AS(b) {
+              b = b | 0;
+              var c = 0;
+              a[(b + 536) >> 0] = 0;
+              c = (b + 336) | 0;
+              h[c >> 3] = +h[c >> 3] + 10.0 / +h[(b + 352) >> 3];
+              a[(b + 537) >> 0] = 1;
+              return 0;
+            }
+            function BS(b) {
+              b = b | 0;
+              var c = 0;
+              a[(b + 536) >> 0] = 0;
+              c = (b + 336) | 0;
+              h[c >> 3] = +h[c >> 3] - 10.0 / +h[(b + 352) >> 3];
+              a[(b + 537) >> 0] = 1;
+              return 0;
+            }
+            function CS(b) {
+              b = b | 0;
+              var c = 0;
+              a[(b + 536) >> 0] = 0;
+              c = (b + 344) | 0;
+              h[c >> 3] = +h[c >> 3] - 10.0 / +h[(b + 352) >> 3];
+              a[(b + 537) >> 0] = 1;
+              return 0;
+            }
+            function DS(b) {
+              b = b | 0;
+              var c = 0;
+              a[(b + 536) >> 0] = 0;
+              c = (b + 344) | 0;
+              h[c >> 3] = +h[c >> 3] + 10.0 / +h[(b + 352) >> 3];
+              a[(b + 537) >> 0] = 1;
+              return 0;
+            }
+            function ES(b) {
+              b = b | 0;
+              var c = 0;
+              a[(b + 536) >> 0] = 0;
+              c = (b + 352) | 0;
+              h[c >> 3] = +h[c >> 3] * 1.1;
+              a[(b + 537) >> 0] = 1;
+              return 0;
+            }
+            function FS(b) {
+              b = b | 0;
+              var c = 0;
+              a[(b + 536) >> 0] = 0;
+              c = (b + 352) | 0;
+              h[c >> 3] = +h[c >> 3] * 0.9090909090909091;
+              a[(b + 537) >> 0] = 1;
+              return 0;
+            }
+            function GS(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0.0;
+              e = (b + 536) | 0;
+              d = (a[e >> 0] | 0) == 0;
+              a[e >> 0] = d & 1;
+              if (d) {
+                d = c[(b + 448) >> 2] | 0;
+                e = c[(b + 452) >> 2] | 0;
+                i = +(d >>> 0);
+                g = +(e >>> 0);
+                f = i / +(d | 0) < g / +(e | 0);
+                h[(b + 352) >> 3] = (f ? i : g) / +((f ? d : e) | 0);
+                e = (b + 336) | 0;
+                c[e >> 2] = 0;
+                c[(e + 4) >> 2] = 0;
+                c[(e + 8) >> 2] = 0;
+                c[(e + 12) >> 2] = 0;
+                a[(b + 537) >> 0] = 1;
+              }
+              return 0;
+            }
+            function HS(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = c[((c[b >> 2] | 0) + 168) >> 2] | 0;
+              e = (b + 580) | 0;
+              if (!(c[e >> 2] | 0)) {
+                c[e >> 2] = d;
+                e = ((c[(d + 16) >> 2] | 0) + 112) | 0;
+                a[e >> 0] = a[e >> 0] | 2;
+                XS(b, d);
+              }
+              sI(b, d);
+              a[(b + 540) >> 0] = 1;
+              return;
+            }
+            function IS(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 16) | 0;
+              f = k;
+              switch (d | 0) {
+                case 1: {
+                  c[f >> 2] = c[e >> 2];
+                  c[(f + 4) >> 2] = c[(e + 4) >> 2];
+                  c[(f + 8) >> 2] = c[(e + 8) >> 2];
+                  c[(f + 12) >> 2] = c[(e + 12) >> 2];
+                  QS(b, f);
+                  WS(b);
+                  a[(b + 538) >> 0] = 1;
+                  a[(b + 541) >> 0] = 1;
+                  j = 13;
+                  break;
+                }
+                case 2: {
+                  a[(b + 538) >> 0] = 1;
+                  a[(b + 541) >> 0] = 2;
+                  j = 13;
+                  break;
+                }
+                case 3: {
+                  c[f >> 2] = c[e >> 2];
+                  c[(f + 4) >> 2] = c[(e + 4) >> 2];
+                  c[(f + 8) >> 2] = c[(e + 8) >> 2];
+                  c[(f + 12) >> 2] = c[(e + 12) >> 2];
+                  QS(b, f);
+                  a[(b + 538) >> 0] = 1;
+                  a[(b + 541) >> 0] = 3;
+                  j = 13;
+                  break;
+                }
+                case 4: {
+                  a[(b + 536) >> 0] = 0;
+                  if (!(c[(b + 360) >> 2] | 0)) {
+                    f = (b + 352) | 0;
+                    i = +h[f >> 3];
+                    d = (b + 336) | 0;
+                    h[d >> 3] =
+                      ((+h[e >> 3] - +((c[(b + 448) >> 2] | 0) >>> 0) * 0.5) * 0.10000000000000009) /
+                        (+h[(b + 520) >> 3] * i) +
+                      +h[d >> 3];
+                    g = +h[(e + 8) >> 3] - +((c[(b + 452) >> 2] | 0) >>> 0) * 0.5;
+                    d = (b + 528) | 0;
+                  } else {
+                    f = (b + 352) | 0;
+                    i = +h[f >> 3];
+                    d = (b + 336) | 0;
+                    h[d >> 3] =
+                      +h[d >> 3] -
+                      ((+h[(e + 8) >> 3] - +((c[(b + 452) >> 2] | 0) >>> 0) * 0.5) * 0.10000000000000009) /
+                        (+h[(b + 528) >> 3] * i);
+                    g = +h[e >> 3] - +((c[(b + 448) >> 2] | 0) >>> 0) * 0.5;
+                    d = (b + 520) | 0;
+                  }
+                  j = (b + 344) | 0;
+                  h[j >> 3] = (g * 0.10000000000000009) / (+h[d >> 3] * i) + +h[j >> 3];
+                  h[f >> 3] = i * 1.1;
+                  j = 13;
+                  break;
+                }
+                case 5: {
+                  a[(b + 536) >> 0] = 0;
+                  j = (b + 352) | 0;
+                  i = +h[j >> 3] * 0.9090909090909091;
+                  h[j >> 3] = i;
+                  if (!(c[(b + 360) >> 2] | 0)) {
+                    f = (b + 336) | 0;
+                    h[f >> 3] =
+                      +h[f >> 3] -
+                      ((+h[e >> 3] - +((c[(b + 448) >> 2] | 0) >>> 0) * 0.5) * 0.10000000000000009) /
+                        (+h[(b + 520) >> 3] * i);
+                    g = +h[(e + 8) >> 3] - +((c[(b + 452) >> 2] | 0) >>> 0) * 0.5;
+                    f = (b + 528) | 0;
+                  } else {
+                    f = (b + 336) | 0;
+                    h[f >> 3] =
+                      ((+h[(e + 8) >> 3] - +((c[(b + 452) >> 2] | 0) >>> 0) * 0.5) * 0.10000000000000009) /
+                        (+h[(b + 528) >> 3] * i) +
+                      +h[f >> 3];
+                    g = +h[e >> 3] - +((c[(b + 448) >> 2] | 0) >>> 0) * 0.5;
+                    f = (b + 520) | 0;
+                  }
+                  j = (b + 344) | 0;
+                  h[j >> 3] = +h[j >> 3] - (g * 0.10000000000000009) / (+h[f >> 3] * i);
+                  j = 13;
+                  break;
+                }
+                default: {
+                }
+              }
+              if ((j | 0) == 13) a[(b + 537) >> 0] = 1;
+              b = (b + 560) | 0;
+              c[b >> 2] = c[e >> 2];
+              c[(b + 4) >> 2] = c[(e + 4) >> 2];
+              c[(b + 8) >> 2] = c[(e + 8) >> 2];
+              c[(b + 12) >> 2] = c[(e + 12) >> 2];
+              l = k;
+              return;
+            }
+            function JS(b, c, d) {
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              a[(b + 538) >> 0] = 0;
+              a[(b + 541) >> 0] = 0;
+              return;
+            }
+            function KS(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                g = 0.0,
+                i = 0,
+                j = 0.0,
+                k = 0;
+              k = l;
+              l = (l + 16) | 0;
+              e = k;
+              i = (b + 560) | 0;
+              j = (+h[d >> 3] - +h[i >> 3]) / +h[(b + 520) >> 3];
+              g = (+h[(d + 8) >> 3] - +h[(b + 568) >> 3]) / +h[(b + 528) >> 3];
+              if (!((+B(+j) < 0.0001) & (+B(+g) < 0.0001))) {
+                switch (a[(b + 541) >> 0] | 0) {
+                  case 0: {
+                    c[e >> 2] = c[d >> 2];
+                    c[(e + 4) >> 2] = c[(d + 4) >> 2];
+                    c[(e + 8) >> 2] = c[(d + 8) >> 2];
+                    c[(e + 12) >> 2] = c[(d + 12) >> 2];
+                    QS(b, e);
+                    break;
+                  }
+                  case 2: {
+                    f = +h[(b + 352) >> 3];
+                    if (!(c[(b + 360) >> 2] | 0)) {
+                      e = (b + 336) | 0;
+                      h[e >> 3] = +h[e >> 3] - j / f;
+                      e = (b + 344) | 0;
+                      h[e >> 3] = +h[e >> 3] - g / f;
+                    } else {
+                      e = (b + 336) | 0;
+                      h[e >> 3] = +h[e >> 3] - g / f;
+                      e = (b + 344) | 0;
+                      h[e >> 3] = +h[e >> 3] + j / f;
+                    }
+                    a[(b + 537) >> 0] = 1;
+                    break;
+                  }
+                  default: {
+                  }
+                }
+                c[i >> 2] = c[d >> 2];
+                c[(i + 4) >> 2] = c[(d + 4) >> 2];
+                c[(i + 8) >> 2] = c[(d + 8) >> 2];
+                c[(i + 12) >> 2] = c[(d + 12) >> 2];
+              }
+              l = k;
+              return;
+            }
+            function LS(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              return;
+            }
+            function MS(a) {
+              a = a | 0;
+              return;
+            }
+            function NS(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              j = c[b >> 2] | 0;
+              if (d) {
+                d = $4(d, 138821) | 0;
+                if (d | 0) {
+                  i = jF(d, 0) | 0;
+                  I4(d) | 0;
+                  f = 5;
+                }
+              } else {
+                i = jF(c[15647] | 0, 0) | 0;
+                f = 5;
+              }
+              if ((f | 0) == 5 ? i | 0 : 0) {
+                g = (j + 168) | 0;
+                d = c[g >> 2] | 0;
+                if (d | 0) {
+                  f = c[(j + 172) >> 2] | 0;
+                  if ((f | 0) != 0 ? ((h = c[(f + 4) >> 2] | 0), (h | 0) != 0) : 0) {
+                    tb[h & 127](d);
+                    d = c[g >> 2] | 0;
+                  }
+                  vK(d);
+                  sB(c[g >> 2] | 0) | 0;
+                }
+                YC(i, 0, 137483, 280, 1);
+                YC(i, 1, 137447, 304, 1);
+                YC(i, 2, 137460, 176, 1);
+                c[g >> 2] = i;
+                c[((c[(i + 16) >> 2] | 0) + 144) >> 2] = j;
+                if ((nG(j, i, e) | 0) != -1) {
+                  c[(b + 580) >> 2] = 0;
+                  c[(b + 576) >> 2] = 0;
+                  a[(b + 537) >> 0] = 1;
+                }
+              }
+              return;
+            }
+            function OS(a, b) {
+              a = a | 0;
+              b = b | 0;
+              a = c[a >> 2] | 0;
+              nG(a, c[(a + 168) >> 2] | 0, b) | 0;
+              return;
+            }
+            function PS(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              g = c[a >> 2] | 0;
+              f = (g + 160) | 0;
+              e = c[f >> 2] | 0;
+              if ((e | 0) != 0 ? (c[(g + 164) >> 2] | 0) == 0 : 0) {
+                i = (g + 192) | 0;
+                h = c[i >> 2] | 0;
+                c[f >> 2] = 0;
+                c[i >> 2] = 0;
+                f = h;
+              } else {
+                f = 0;
+                e = 0;
+              }
+              pG(g, c[(g + 168) >> 2] | 0, b, d) | 0;
+              if (e | 0) {
+                i = c[a >> 2] | 0;
+                c[(i + 160) >> 2] = e;
+                c[(i + 192) >> 2] = f;
+              }
+              return;
+            }
+            function QS(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                m = 0;
+              f = l;
+              l = (l + 80) | 0;
+              e = (f + 48) | 0;
+              g = f;
+              m = (f + 32) | 0;
+              c[e >> 2] = c[d >> 2];
+              c[(e + 4) >> 2] = c[(d + 4) >> 2];
+              c[(e + 8) >> 2] = c[(d + 8) >> 2];
+              c[(e + 12) >> 2] = c[(d + 12) >> 2];
+              RS(m, b, e);
+              k = +h[m >> 3];
+              j = +h[(m + 8) >> 3];
+              i = 1.0 / +h[(b + 352) >> 3];
+              h[(g + 16) >> 3] = i + k;
+              h[(g + 24) >> 3] = i + j;
+              h[g >> 3] = k - i;
+              h[(g + 8) >> 3] = j - i;
+              d = c[((c[b >> 2] | 0) + 168) >> 2] | 0;
+              c[e >> 2] = c[g >> 2];
+              c[(e + 4) >> 2] = c[(g + 4) >> 2];
+              c[(e + 8) >> 2] = c[(g + 8) >> 2];
+              c[(e + 12) >> 2] = c[(g + 12) >> 2];
+              c[(e + 16) >> 2] = c[(g + 16) >> 2];
+              c[(e + 20) >> 2] = c[(g + 20) >> 2];
+              c[(e + 24) >> 2] = c[(g + 24) >> 2];
+              c[(e + 28) >> 2] = c[(g + 28) >> 2];
+              d = SS(d, e) | 0;
+              e = (b + 576) | 0;
+              if ((d | 0) != (c[e >> 2] | 0)) {
+                TS(b);
+                c[e >> 2] = d;
+                US(b);
+                a[(b + 537) >> 0] = 1;
+              }
+              l = f;
+              return;
+            }
+            function RS(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0,
+                g = 0.0,
+                i = 0;
+              if (!(c[(b + 360) >> 2] | 0)) {
+                e = +h[(b + 352) >> 3];
+                f = +h[(d + 8) >> 3];
+                g = e;
+                i = (b + 528) | 0;
+                e = +h[d >> 3] / (+h[(b + 520) >> 3] * e) - +h[(b + 504) >> 3];
+              } else {
+                e = +h[(b + 352) >> 3];
+                f = -+h[d >> 3];
+                g = e;
+                i = (b + 520) | 0;
+                e = +h[(d + 8) >> 3] / (+h[(b + 528) >> 3] * e) - +h[(b + 504) >> 3];
+              }
+              g = f / (+h[i >> 3] * g) - +h[(b + 512) >> 3];
+              h[a >> 3] = e;
+              h[(a + 8) >> 3] = g;
+              return;
+            }
+            function SS(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              g = l;
+              l = (l + 32) | 0;
+              f = g;
+              e = jC(a) | 0;
+              a: while (1) {
+                if (!e) {
+                  e = 9;
+                  break;
+                }
+                d = XA(a, e) | 0;
+                while (1) {
+                  if (!d) break;
+                  c[f >> 2] = c[b >> 2];
+                  c[(f + 4) >> 2] = c[(b + 4) >> 2];
+                  c[(f + 8) >> 2] = c[(b + 8) >> 2];
+                  c[(f + 12) >> 2] = c[(b + 12) >> 2];
+                  c[(f + 16) >> 2] = c[(b + 16) >> 2];
+                  c[(f + 20) >> 2] = c[(b + 20) >> 2];
+                  c[(f + 24) >> 2] = c[(b + 24) >> 2];
+                  c[(f + 28) >> 2] = c[(b + 28) >> 2];
+                  if (((jQ(d, f) | 0) << 24) >> 24) {
+                    e = 6;
+                    break a;
+                  }
+                  d = ZA(a, d) | 0;
+                }
+                e = kC(a, e) | 0;
+              }
+              do
+                if ((e | 0) != 6)
+                  if ((e | 0) == 9) {
+                    d = lC(a) | 0;
+                    while (1) {
+                      if (!d) break;
+                      c[f >> 2] = c[b >> 2];
+                      c[(f + 4) >> 2] = c[(b + 4) >> 2];
+                      c[(f + 8) >> 2] = c[(b + 8) >> 2];
+                      c[(f + 12) >> 2] = c[(b + 12) >> 2];
+                      c[(f + 16) >> 2] = c[(b + 16) >> 2];
+                      c[(f + 20) >> 2] = c[(b + 20) >> 2];
+                      c[(f + 24) >> 2] = c[(b + 24) >> 2];
+                      c[(f + 28) >> 2] = c[(b + 28) >> 2];
+                      if (((gQ(d, f) | 0) << 24) >> 24) {
+                        e = 12;
+                        break;
+                      }
+                      d = mC(a, d) | 0;
+                    }
+                    if ((e | 0) == 12) break;
+                    c[f >> 2] = c[b >> 2];
+                    c[(f + 4) >> 2] = c[(b + 4) >> 2];
+                    c[(f + 8) >> 2] = c[(b + 8) >> 2];
+                    c[(f + 12) >> 2] = c[(b + 12) >> 2];
+                    c[(f + 16) >> 2] = c[(b + 16) >> 2];
+                    c[(f + 20) >> 2] = c[(b + 20) >> 2];
+                    c[(f + 24) >> 2] = c[(b + 24) >> 2];
+                    c[(f + 28) >> 2] = c[(b + 28) >> 2];
+                    d = VS(a, f) | 0;
+                    if (!d) {
+                      d = a;
+                      break;
+                    } else break;
+                  }
+              while (0);
+              l = g;
+              return d | 0;
+            }
+            function TS(b) {
+              b = b | 0;
+              var d = 0;
+              d = c[(b + 576) >> 2] | 0;
+              a: do
+                if (d | 0)
+                  switch (IC(d) | 0) {
+                    case 0: {
+                      d = ((c[(d + 16) >> 2] | 0) + 112) | 0;
+                      a[d >> 0] = a[d >> 0] & -2;
+                      break a;
+                    }
+                    case 1: {
+                      d = ((c[(d + 16) >> 2] | 0) + 117) | 0;
+                      a[d >> 0] = a[d >> 0] & -2;
+                      break a;
+                    }
+                    case 2: {
+                      d = ((c[(d + 16) >> 2] | 0) + 115) | 0;
+                      a[d >> 0] = a[d >> 0] & -2;
+                      break a;
+                    }
+                    default:
+                      break a;
+                  }
+              while (0);
+              c[(b + 584) >> 2] = 0;
+              return;
+            }
+            function US(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              e = (b + 584) | 0;
+              d = c[e >> 2] | 0;
+              if (d | 0) {
+                U1(d);
+                c[e >> 2] = 0;
+              }
+              d = c[(b + 576) >> 2] | 0;
+              a: do
+                if (d | 0)
+                  switch (IC(d) | 0) {
+                    case 0: {
+                      b = ((c[(d + 16) >> 2] | 0) + 112) | 0;
+                      a[b >> 0] = a[b >> 0] | 1;
+                      b = GA(d, 0, 141101, 0) | 0;
+                      if (!b) break a;
+                      c[e >> 2] = EK(RA(d, b) | 0, d) | 0;
+                      break a;
+                    }
+                    case 1: {
+                      b = ((c[(d + 16) >> 2] | 0) + 117) | 0;
+                      a[b >> 0] = a[b >> 0] | 1;
+                      b = GA(xC(d) | 0, 1, 141101, 0) | 0;
+                      if (!b) break a;
+                      c[e >> 2] = EK(RA(d, b) | 0, d) | 0;
+                      break a;
+                    }
+                    case 2: {
+                      b = ((c[(d + 16) >> 2] | 0) + 115) | 0;
+                      a[b >> 0] = a[b >> 0] | 1;
+                      b =
+                        GA(xC(c[((((c[d >> 2] & 3) | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0) | 0, 2, 141101, 0) |
+                        0;
+                      if (!b) break a;
+                      c[e >> 2] = EK(RA(d, b) | 0, d) | 0;
+                      break a;
+                    }
+                    default:
+                      break a;
+                  }
+              while (0);
+              return;
+            }
+            function VS(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0.0,
+                o = 0.0;
+              m = l;
+              l = (l + 32) | 0;
+              e = m;
+              g = c[(a + 16) >> 2] | 0;
+              i = c[(g + 180) >> 2] | 0;
+              j = (g + 184) | 0;
+              d = 1;
+              while (1) {
+                if ((d | 0) > (i | 0)) {
+                  k = 4;
+                  break;
+                }
+                f = c[((c[j >> 2] | 0) + (d << 2)) >> 2] | 0;
+                c[e >> 2] = c[b >> 2];
+                c[(e + 4) >> 2] = c[(b + 4) >> 2];
+                c[(e + 8) >> 2] = c[(b + 8) >> 2];
+                c[(e + 12) >> 2] = c[(b + 12) >> 2];
+                c[(e + 16) >> 2] = c[(b + 16) >> 2];
+                c[(e + 20) >> 2] = c[(b + 20) >> 2];
+                c[(e + 24) >> 2] = c[(b + 24) >> 2];
+                c[(e + 28) >> 2] = c[(b + 28) >> 2];
+                f = VS(f, e) | 0;
+                if (!f) d = (d + 1) | 0;
+                else {
+                  a = f;
+                  break;
+                }
+              }
+              do
+                if ((k | 0) == 4) {
+                  o = +h[(g + 24) >> 3];
+                  n = +h[(g + 40) >> 3];
+                  if (
+                    (
+                      (+h[(b + 16) >> 3] >= +h[(g + 16) >> 3] ? +h[(g + 32) >> 3] >= +h[b >> 3] : 0)
+                        ? +h[(b + 24) >> 3] >= o
+                        : 0
+                    )
+                      ? n >= +h[(b + 8) >> 3]
+                      : 0
+                  )
+                    break;
+                  a = 0;
+                }
+              while (0);
+              l = m;
+              return a | 0;
+            }
+            function WS(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              f = (b + 580) | 0;
+              d = c[f >> 2] | 0;
+              a: do
+                if (d | 0)
+                  switch (IC(d) | 0) {
+                    case 0: {
+                      e = ((c[(d + 16) >> 2] | 0) + 112) | 0;
+                      a[e >> 0] = (a[e >> 0] & -7) | 4;
+                      break a;
+                    }
+                    case 1: {
+                      e = ((c[(d + 16) >> 2] | 0) + 117) | 0;
+                      a[e >> 0] = (a[e >> 0] & -7) | 4;
+                      break a;
+                    }
+                    case 2: {
+                      e = ((c[(d + 16) >> 2] | 0) + 115) | 0;
+                      a[e >> 0] = (a[e >> 0] & -7) | 4;
+                      break a;
+                    }
+                    default:
+                      break a;
+                  }
+              while (0);
+              d = (b + 588) | 0;
+              e = c[d >> 2] | 0;
+              if (e | 0) {
+                U1(e);
+                c[d >> 2] = 0;
+              }
+              d = c[(b + 576) >> 2] | 0;
+              c[f >> 2] = d;
+              b: do
+                if (d | 0)
+                  switch (IC(d) | 0) {
+                    case 0: {
+                      f = ((c[(d + 16) >> 2] | 0) + 112) | 0;
+                      a[f >> 0] = a[f >> 0] | 2;
+                      XS(b, d);
+                      break b;
+                    }
+                    case 1: {
+                      f = ((c[(d + 16) >> 2] | 0) + 117) | 0;
+                      a[f >> 0] = a[f >> 0] | 2;
+                      YS(b, d);
+                      break b;
+                    }
+                    case 2: {
+                      f = ((c[(d + 16) >> 2] | 0) + 115) | 0;
+                      a[f >> 0] = a[f >> 0] | 2;
+                      ZS(b, d);
+                      break b;
+                    }
+                    default:
+                      break b;
+                  }
+              while (0);
+              return;
+            }
+            function XS(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              d = (a + 592) | 0;
+              do
+                if ((yC(b) | 0) == (b | 0))
+                  if (!(xB(b) | 0)) {
+                    GF(d, 0, 111494);
+                    break;
+                  } else {
+                    GF(d, 0, 111486);
+                    break;
+                  }
+                else GF(d, 0, 111500);
+              while (0);
+              GF(d, 1, KB(b) | 0);
+              c[(a + 596) >> 2] = 2;
+              f = (a + 604) | 0;
+              d = 0;
+              e = 2;
+              while (1) {
+                d = LA(b, 0, d) | 0;
+                if (!d) break;
+                GF(f, e, c[(d + 8) >> 2] | 0);
+                GF(f, (e + 1) | 0, RA(b, d) | 0);
+                GF(f, (e + 2) | 0, 0);
+                e = (e + 3) | 0;
+              }
+              c[(a + 608) >> 2] = e;
+              d = GA(b, 0, 141055, 0) | 0;
+              if (!d) {
+                d = GA(b, 0, 111477, 0) | 0;
+                if (d | 0) g = 11;
+              } else g = 11;
+              if ((g | 0) == 11) c[(a + 588) >> 2] = EK(RA(b, d) | 0, b) | 0;
+              return;
+            }
+            function YS(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              f = (a + 592) | 0;
+              GF(f, 0, 111481);
+              GF(f, 1, KB(b) | 0);
+              c[(a + 596) >> 2] = 2;
+              f = (a + 604) | 0;
+              g = yC(xC(b) | 0) | 0;
+              e = 2;
+              d = 0;
+              while (1) {
+                d = LA(g, 1, d) | 0;
+                if (!d) break;
+                GF(f, e, c[(d + 8) >> 2] | 0);
+                GF(f, e | 1, RA(b, d) | 0);
+                e = (e + 2) | 0;
+              }
+              c[(a + 608) >> 2] = e;
+              d = GA(xC(b) | 0, 1, 141055, 0) | 0;
+              if (!d) {
+                d = GA(xC(b) | 0, 1, 111477, 0) | 0;
+                if (d | 0) h = 6;
+              } else h = 6;
+              if ((h | 0) == 6) c[(a + 588) >> 2] = EK(RA(b, d) | 0, b) | 0;
+              return;
+            }
+            function ZS(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              h = (a + 592) | 0;
+              GF(h, 0, 111450);
+              k = (b + 48) | 0;
+              GF(h, 1, KB(c[((((c[b >> 2] & 3) | 0) == 3 ? b : k) + 40) >> 2] | 0) | 0);
+              k = (xB(xC(c[((((c[b >> 2] & 3) | 0) == 3 ? b : k) + 40) >> 2] | 0) | 0) | 0) != 0;
+              GF(h, 3, k ? 137738 : 141747);
+              k = (b + -48) | 0;
+              GF(h, 4, KB(c[((((c[b >> 2] & 3) | 0) == 2 ? b : k) + 40) >> 2] | 0) | 0);
+              c[(a + 596) >> 2] = 7;
+              i = (a + 604) | 0;
+              j = yC(xC(c[((((c[b >> 2] & 3) | 0) == 2 ? b : k) + 40) >> 2] | 0) | 0) | 0;
+              g = 7;
+              d = 0;
+              a: while (1) {
+                while (1) {
+                  d = LA(j, 2, d) | 0;
+                  if (!d) break a;
+                  e = (d + 8) | 0;
+                  f = c[e >> 2] | 0;
+                  if (!(s2(f, 111455) | 0)) {
+                    l = 5;
+                    break;
+                  }
+                  if (!(s2(f, 111464) | 0)) {
+                    l = 7;
+                    break;
+                  }
+                  if (s2(f, 111473) | 0) break;
+                  GF(h, 6, RA(b, d) | 0);
+                }
+                if ((l | 0) == 5) {
+                  l = 0;
+                  GF(h, 2, RA(b, d) | 0);
+                } else if ((l | 0) == 7) {
+                  l = 0;
+                  GF(h, 5, RA(b, d) | 0);
+                }
+                GF(i, g, c[e >> 2] | 0);
+                GF(i, (g + 1) | 0, RA(b, d) | 0);
+                g = (g + 2) | 0;
+              }
+              c[(a + 608) >> 2] = g;
+              d = GA(xC(c[((((c[b >> 2] & 3) | 0) == 2 ? b : k) + 40) >> 2] | 0) | 0, 2, 141055, 0) | 0;
+              if (!d) {
+                d = GA(xC(c[((((c[b >> 2] & 3) | 0) == 2 ? b : k) + 40) >> 2] | 0) | 0, 2, 111477, 0) | 0;
+                if (d | 0) l = 13;
+              } else l = 13;
+              if ((l | 0) == 13) c[(a + 588) >> 2] = EK(RA(b, d) | 0, b) | 0;
+              return;
+            }
+            function _S(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              g = $S(a, b, c[d >> 2] | 0) | 0;
+              d = c[(d + 4) >> 2] | 0;
+              while (1) {
+                f = c[(d + 4) >> 2] | 0;
+                if (!f) break;
+                b = 0;
+                while (1) {
+                  e = c[(f + ((b * 20) | 0) + 4) >> 2] | 0;
+                  if (!e) break;
+                  JF(a, c[d >> 2] | 0, e, c[(f + ((b * 20) | 0) + 8) >> 2] | 0, g, (f + ((b * 20) | 0)) | 0) | 0;
+                  b = (b + 1) | 0;
+                }
+                d = (d + 8) | 0;
+              }
+              return;
+            }
+            function $S(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              e = KK(12) | 0;
+              if (!b) b = 0;
+              else b = D4(b) | 0;
+              c[(e + 4) >> 2] = b;
+              c[(e + 8) >> 2] = D4(d) | 0;
+              d = (a + 100) | 0;
+              c[e >> 2] = c[d >> 2];
+              c[d >> 2] = e;
+              return e | 0;
+            }
+            function aT(b, c) {
+              b = b | 0;
+              c = c | 0;
+              bT(b);
+              a[(b + 44) >> 0] = 0;
+              cT(b) | 0;
+              PO(b) | 0;
+              return;
+            }
+            function bT(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = c[(b + 32) >> 2] | 0;
+              a: do
+                if (d | 0)
+                  while (1) {
+                    e = c[d >> 2] | 0;
+                    if (!e) break a;
+                    if ((a[e >> 0] | 0) == 103 ? d4(e, 111509) | 0 : 0) _S(b, 0, c[(d + 4) >> 2] | 0);
+                    d = (d + 8) | 0;
+                  }
+              while (0);
+              return;
+            }
+            function cT(a) {
+              a = a | 0;
+              var b = 0;
+              b = LF(a, 2, 111522) | 0;
+              if (!b) a = 999;
+              else {
+                c[(a + 148) >> 2] = c[((c[(b + 16) >> 2] | 0) + 12) >> 2];
+                a = 300;
+              }
+              return a | 0;
+            }
+            function dT(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              a = c[(a + 148) >> 2] | 0;
+              if ((a | 0) != 0 ? ((e = c[a >> 2] | 0), (e | 0) != 0) : 0) a = lb[e & 127](b, d) | 0;
+              else a = 0;
+              return a | 0;
+            }
+            function eT(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              return ((c[b >> 2] | 0) - (c[d >> 2] | 0)) | 0;
+            }
+            function fT(a) {
+              a = a | 0;
+              var b = 0.0,
+                d = 0.0;
+              a = c[(a + 16) >> 2] | 0;
+              d = +h[(a + 16) >> 3];
+              b = +h[(a + 24) >> 3];
+              return ((gT(~~(d > b ? d : b) >>> 0) | 0) + 1) | 0;
+            }
+            function gT(a) {
+              a = a | 0;
+              var b = 0,
+                c = 0;
+              if (!a) a = -1;
+              else {
+                c = a >>> 0 > 65535;
+                a = c ? a >>> 16 : a;
+                c = c ? 16 : 0;
+                b = a >>> 0 > 255;
+                a = b ? a >>> 8 : a;
+                c = b ? c | 8 : c;
+                b = a >>> 0 > 15;
+                a = b ? a >>> 4 : a;
+                c = b ? c | 4 : c;
+                b = a >>> 0 > 3;
+                a = ((b ? c | 2 : c) + (((b ? a >>> 2 : a) >>> 0 > 1) & 1)) | 0;
+              }
+              return a | 0;
+            }
+            function hT(b, d, e, f, g) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0.0,
+                j = 0.0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0;
+              r = l;
+              l = (l + 32) | 0;
+              q = r;
+              p = iT(b, d, e, f, g) | 0;
+              e = jT(p) | 0;
+              if ((e | 0) >= 0) {
+                n = (q + 16) | 0;
+                o = (q + 24) | 0;
+                m = (q + 8) | 0;
+                k = (g + 32) | 0;
+                e = 0;
+                g = 0;
+                while (1) {
+                  if ((g | 0) >= (d | 0)) break;
+                  f = (b + ((g * 40) | 0) + 32) | 0;
+                  do
+                    if (c[f >> 2] | 0) {
+                      kT(q, p, (b + ((g * 40) | 0)) | 0);
+                      i = +h[n >> 3];
+                      j = +h[o >> 3];
+                      if (!(c[q >> 2] | 0)) {
+                        a[((c[f >> 2] | 0) + 36) >> 0] = 1;
+                        break;
+                      }
+                      if (+h[m >> 3] == 0.0) {
+                        f = c[f >> 2] | 0;
+                        h[(f + 16) >> 3] = i;
+                        h[(f + 24) >> 3] = j;
+                        a[(f + 36) >> 0] = 1;
+                        break;
+                      }
+                      if ((a[k >> 0] | 0) == 1) {
+                        f = c[f >> 2] | 0;
+                        h[(f + 16) >> 3] = i;
+                        h[(f + 24) >> 3] = j;
+                        a[(f + 36) >> 0] = 1;
+                      } else e = 1;
+                    }
+                  while (0);
+                  g = (g + 1) | 0;
+                }
+                lT(p);
+              }
+              l = r;
+              return e | 0;
+            }
+            function iT(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              g = JK(28) | 0;
+              j = Vz(25912, c[4584] | 0) | 0;
+              h = (g + 20) | 0;
+              c[h >> 2] = j;
+              do
+                if (j) {
+                  j = TV() | 0;
+                  c[(g + 24) >> 2] = j;
+                  if (!j) {
+                    U4(111740, 14, 1, c[15712] | 0) | 0;
+                    i = 6;
+                    break;
+                  } else {
+                    c[g >> 2] = a;
+                    c[(g + 4) >> 2] = b;
+                    c[(g + 8) >> 2] = d;
+                    c[(g + 12) >> 2] = e;
+                    c[(g + 16) >> 2] = f;
+                    break;
+                  }
+                } else {
+                  U4(111740, 14, 1, c[15712] | 0) | 0;
+                  i = 6;
+                }
+              while (0);
+              if ((i | 0) == 6) {
+                a = c[h >> 2] | 0;
+                if (a | 0) Rz(a) | 0;
+                a = c[(g + 24) >> 2] | 0;
+                if (a | 0) VV(a) | 0;
+                U1(g);
+                g = 0;
+              }
+              return g | 0;
+            }
+            function jT(a) {
+              a = a | 0;
+              var b = 0;
+              b = uT(a) | 0;
+              if ((b | 0) >= 0) {
+                vT(a);
+                wT(a);
+                b = Rz(c[(a + 20) >> 2] | 0) | 0;
+              }
+              return b | 0;
+            }
+            function kT(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0,
+                g = 0,
+                i = 0.0,
+                j = 0,
+                k = 0.0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0.0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0.0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0.0,
+                L = 0,
+                M = 0;
+              M = l;
+              l = (l + 464) | 0;
+              J = (M + 416) | 0;
+              L = (M + 400) | 0;
+              G = (M + 384) | 0;
+              m = (M + 352) | 0;
+              n = (M + 320) | 0;
+              o = (M + 288) | 0;
+              p = (M + 256) | 0;
+              r = (M + 224) | 0;
+              s = (M + 192) | 0;
+              t = (M + 160) | 0;
+              u = (M + 128) | 0;
+              v = (M + 96) | 0;
+              x = (M + 64) | 0;
+              y = (M + 32) | 0;
+              H = M;
+              z = c[(d + 32) >> 2] | 0;
+              e = +h[z >> 3];
+              C = (d + 16) | 0;
+              A = (e * 2.0 + +h[C >> 3]) * 0.125;
+              D = (z + 8) | 0;
+              I = (d + 24) | 0;
+              i = +h[I >> 3];
+              K = (+h[D >> 3] * 2.0 + i) * 0.5;
+              if (!z) qa(111533, 111543, 445, 111553);
+              f = J;
+              g = (f + 36) | 0;
+              do {
+                c[f >> 2] = 0;
+                f = (f + 4) | 0;
+              } while ((f | 0) < (g | 0));
+              B = (z + 16) | 0;
+              h[B >> 3] = +h[d >> 3] - e;
+              E = (d + 8) | 0;
+              F = (z + 24) | 0;
+              h[F >> 3] = i + +h[E >> 3];
+              mT(m, b, d, J);
+              j = c[m >> 2] | 0;
+              f = c[(m + 4) >> 2] | 0;
+              e = +h[(m + 8) >> 3];
+              m = (m + 16) | 0;
+              c[L >> 2] = c[m >> 2];
+              c[(L + 4) >> 2] = c[(m + 4) >> 2];
+              c[(L + 8) >> 2] = c[(m + 8) >> 2];
+              c[(L + 12) >> 2] = c[(m + 12) >> 2];
+              a: do
+                if (!j) {
+                  c[a >> 2] = 0;
+                  c[(a + 4) >> 2] = f;
+                  h[(a + 8) >> 3] = e;
+                  a = (a + 16) | 0;
+                  c[a >> 2] = c[L >> 2];
+                  c[(a + 4) >> 2] = c[(L + 4) >> 2];
+                  c[(a + 8) >> 2] = c[(L + 8) >> 2];
+                  c[(a + 12) >> 2] = c[(L + 12) >> 2];
+                } else {
+                  h[F >> 3] = +h[E >> 3];
+                  mT(n, b, d, J);
+                  g = c[n >> 2] | 0;
+                  m = c[(n + 4) >> 2] | 0;
+                  i = +h[(n + 8) >> 3];
+                  n = (n + 16) | 0;
+                  c[G >> 2] = c[n >> 2];
+                  c[(G + 4) >> 2] = c[(n + 4) >> 2];
+                  c[(G + 8) >> 2] = c[(n + 8) >> 2];
+                  c[(G + 12) >> 2] = c[(n + 12) >> 2];
+                  if (!g) {
+                    c[a >> 2] = 0;
+                    c[(a + 4) >> 2] = m;
+                    h[(a + 8) >> 3] = i;
+                    a = (a + 16) | 0;
+                    c[a >> 2] = c[G >> 2];
+                    c[(a + 4) >> 2] = c[(G + 4) >> 2];
+                    c[(a + 8) >> 2] = c[(G + 8) >> 2];
+                    c[(a + 12) >> 2] = c[(G + 12) >> 2];
+                    break;
+                  }
+                  if (i < e) {
+                    c[L >> 2] = c[G >> 2];
+                    c[(L + 4) >> 2] = c[(G + 4) >> 2];
+                    c[(L + 8) >> 2] = c[(G + 8) >> 2];
+                    c[(L + 12) >> 2] = c[(G + 12) >> 2];
+                    f = m;
+                    e = i;
+                  } else g = j;
+                  h[F >> 3] = +h[E >> 3] - +h[D >> 3];
+                  mT(o, b, d, J);
+                  m = c[o >> 2] | 0;
+                  j = c[(o + 4) >> 2] | 0;
+                  i = +h[(o + 8) >> 3];
+                  o = (o + 16) | 0;
+                  c[G >> 2] = c[o >> 2];
+                  c[(G + 4) >> 2] = c[(o + 4) >> 2];
+                  c[(G + 8) >> 2] = c[(o + 8) >> 2];
+                  c[(G + 12) >> 2] = c[(o + 12) >> 2];
+                  if (!m) {
+                    c[a >> 2] = 0;
+                    c[(a + 4) >> 2] = j;
+                    h[(a + 8) >> 3] = i;
+                    a = (a + 16) | 0;
+                    c[a >> 2] = c[G >> 2];
+                    c[(a + 4) >> 2] = c[(G + 4) >> 2];
+                    c[(a + 8) >> 2] = c[(G + 8) >> 2];
+                    c[(a + 12) >> 2] = c[(G + 12) >> 2];
+                    break;
+                  }
+                  if (i < e) {
+                    c[L >> 2] = c[G >> 2];
+                    c[(L + 4) >> 2] = c[(G + 4) >> 2];
+                    c[(L + 8) >> 2] = c[(G + 8) >> 2];
+                    c[(L + 12) >> 2] = c[(G + 12) >> 2];
+                    f = j;
+                    e = i;
+                  } else m = g;
+                  h[B >> 3] = +h[d >> 3];
+                  h[F >> 3] = +h[I >> 3] + +h[E >> 3];
+                  mT(p, b, d, J);
+                  g = c[p >> 2] | 0;
+                  j = c[(p + 4) >> 2] | 0;
+                  i = +h[(p + 8) >> 3];
+                  p = (p + 16) | 0;
+                  c[G >> 2] = c[p >> 2];
+                  c[(G + 4) >> 2] = c[(p + 4) >> 2];
+                  c[(G + 8) >> 2] = c[(p + 8) >> 2];
+                  c[(G + 12) >> 2] = c[(p + 12) >> 2];
+                  if (!g) {
+                    c[a >> 2] = 0;
+                    c[(a + 4) >> 2] = j;
+                    h[(a + 8) >> 3] = i;
+                    a = (a + 16) | 0;
+                    c[a >> 2] = c[G >> 2];
+                    c[(a + 4) >> 2] = c[(G + 4) >> 2];
+                    c[(a + 8) >> 2] = c[(G + 8) >> 2];
+                    c[(a + 12) >> 2] = c[(G + 12) >> 2];
+                    break;
+                  }
+                  if (i < e) {
+                    c[L >> 2] = c[G >> 2];
+                    c[(L + 4) >> 2] = c[(G + 4) >> 2];
+                    c[(L + 8) >> 2] = c[(G + 8) >> 2];
+                    c[(L + 12) >> 2] = c[(G + 12) >> 2];
+                    m = g;
+                    f = j;
+                    e = i;
+                  }
+                  h[F >> 3] = +h[E >> 3] - +h[D >> 3];
+                  mT(r, b, d, J);
+                  g = c[r >> 2] | 0;
+                  j = c[(r + 4) >> 2] | 0;
+                  i = +h[(r + 8) >> 3];
+                  r = (r + 16) | 0;
+                  c[G >> 2] = c[r >> 2];
+                  c[(G + 4) >> 2] = c[(r + 4) >> 2];
+                  c[(G + 8) >> 2] = c[(r + 8) >> 2];
+                  c[(G + 12) >> 2] = c[(r + 12) >> 2];
+                  if (!g) {
+                    c[a >> 2] = 0;
+                    c[(a + 4) >> 2] = j;
+                    h[(a + 8) >> 3] = i;
+                    a = (a + 16) | 0;
+                    c[a >> 2] = c[G >> 2];
+                    c[(a + 4) >> 2] = c[(G + 4) >> 2];
+                    c[(a + 8) >> 2] = c[(G + 8) >> 2];
+                    c[(a + 12) >> 2] = c[(G + 12) >> 2];
+                    break;
+                  }
+                  if (i < e) {
+                    c[L >> 2] = c[G >> 2];
+                    c[(L + 4) >> 2] = c[(G + 4) >> 2];
+                    c[(L + 8) >> 2] = c[(G + 8) >> 2];
+                    c[(L + 12) >> 2] = c[(G + 12) >> 2];
+                    m = g;
+                    f = j;
+                    e = i;
+                  }
+                  h[B >> 3] = +h[C >> 3] + +h[d >> 3];
+                  h[F >> 3] = +h[I >> 3] + +h[E >> 3];
+                  mT(s, b, d, J);
+                  g = c[s >> 2] | 0;
+                  j = c[(s + 4) >> 2] | 0;
+                  i = +h[(s + 8) >> 3];
+                  s = (s + 16) | 0;
+                  c[G >> 2] = c[s >> 2];
+                  c[(G + 4) >> 2] = c[(s + 4) >> 2];
+                  c[(G + 8) >> 2] = c[(s + 8) >> 2];
+                  c[(G + 12) >> 2] = c[(s + 12) >> 2];
+                  if (!g) {
+                    c[a >> 2] = 0;
+                    c[(a + 4) >> 2] = j;
+                    h[(a + 8) >> 3] = i;
+                    a = (a + 16) | 0;
+                    c[a >> 2] = c[G >> 2];
+                    c[(a + 4) >> 2] = c[(G + 4) >> 2];
+                    c[(a + 8) >> 2] = c[(G + 8) >> 2];
+                    c[(a + 12) >> 2] = c[(G + 12) >> 2];
+                    break;
+                  }
+                  if (i < e) {
+                    c[L >> 2] = c[G >> 2];
+                    c[(L + 4) >> 2] = c[(G + 4) >> 2];
+                    c[(L + 8) >> 2] = c[(G + 8) >> 2];
+                    c[(L + 12) >> 2] = c[(G + 12) >> 2];
+                    m = g;
+                    f = j;
+                    e = i;
+                  }
+                  h[F >> 3] = +h[E >> 3];
+                  mT(t, b, d, J);
+                  g = c[t >> 2] | 0;
+                  j = c[(t + 4) >> 2] | 0;
+                  i = +h[(t + 8) >> 3];
+                  t = (t + 16) | 0;
+                  c[G >> 2] = c[t >> 2];
+                  c[(G + 4) >> 2] = c[(t + 4) >> 2];
+                  c[(G + 8) >> 2] = c[(t + 8) >> 2];
+                  c[(G + 12) >> 2] = c[(t + 12) >> 2];
+                  if (!g) {
+                    c[a >> 2] = 0;
+                    c[(a + 4) >> 2] = j;
+                    h[(a + 8) >> 3] = i;
+                    a = (a + 16) | 0;
+                    c[a >> 2] = c[G >> 2];
+                    c[(a + 4) >> 2] = c[(G + 4) >> 2];
+                    c[(a + 8) >> 2] = c[(G + 8) >> 2];
+                    c[(a + 12) >> 2] = c[(G + 12) >> 2];
+                    break;
+                  }
+                  if (i < e) {
+                    c[L >> 2] = c[G >> 2];
+                    c[(L + 4) >> 2] = c[(G + 4) >> 2];
+                    c[(L + 8) >> 2] = c[(G + 8) >> 2];
+                    c[(L + 12) >> 2] = c[(G + 12) >> 2];
+                    m = g;
+                    f = j;
+                    e = i;
+                  }
+                  h[F >> 3] = +h[E >> 3] - +h[D >> 3];
+                  mT(u, b, d, J);
+                  g = c[u >> 2] | 0;
+                  j = c[(u + 4) >> 2] | 0;
+                  i = +h[(u + 8) >> 3];
+                  u = (u + 16) | 0;
+                  c[G >> 2] = c[u >> 2];
+                  c[(G + 4) >> 2] = c[(u + 4) >> 2];
+                  c[(G + 8) >> 2] = c[(u + 8) >> 2];
+                  c[(G + 12) >> 2] = c[(u + 12) >> 2];
+                  if (!g) {
+                    c[a >> 2] = 0;
+                    c[(a + 4) >> 2] = j;
+                    h[(a + 8) >> 3] = i;
+                    a = (a + 16) | 0;
+                    c[a >> 2] = c[G >> 2];
+                    c[(a + 4) >> 2] = c[(G + 4) >> 2];
+                    c[(a + 8) >> 2] = c[(G + 8) >> 2];
+                    c[(a + 12) >> 2] = c[(G + 12) >> 2];
+                    break;
+                  }
+                  if (i < e) {
+                    c[L >> 2] = c[G >> 2];
+                    c[(L + 4) >> 2] = c[(G + 4) >> 2];
+                    c[(L + 8) >> 2] = c[(G + 8) >> 2];
+                    c[(L + 12) >> 2] = c[(G + 12) >> 2];
+                    f = j;
+                    e = i;
+                  } else g = m;
+                  j = (c[(J + 28) >> 2] | 0) == 0;
+                  do
+                    if (!(c[(J + 24) >> 2] | 0))
+                      if (j) {
+                        if (c[(J + 32) >> 2] | 0) {
+                          w = 38;
+                          break;
+                        }
+                        if (!(((c[(J + 12) >> 2] | 0) == 0) & ((c[J >> 2] | 0) == 0))) w = 38;
+                      } else w = 46;
+                    else if (j) w = 38;
+                    else w = 46;
+                  while (0);
+                  b: do
+                    if ((w | 0) == 38)
+                      if (!(c[(J + 32) >> 2] | 0)) {
+                        h[B >> 3] = +h[d >> 3] - +h[z >> 3];
+                        p = (v + 4) | 0;
+                        r = (v + 8) | 0;
+                        s = (v + 16) | 0;
+                        m = F;
+                        j = E;
+                        i = +h[I >> 3];
+                        c: while (1) {
+                          while (1) {
+                            h[m >> 3] = +h[j >> 3] + i;
+                            if (!(+h[B >> 3] <= +h[C >> 3] + +h[d >> 3])) {
+                              w = 46;
+                              break b;
+                            }
+                            mT(v, b, d, J);
+                            n = c[v >> 2] | 0;
+                            o = c[p >> 2] | 0;
+                            k = +h[r >> 3];
+                            c[G >> 2] = c[s >> 2];
+                            c[(G + 4) >> 2] = c[(s + 4) >> 2];
+                            c[(G + 8) >> 2] = c[(s + 8) >> 2];
+                            c[(G + 12) >> 2] = c[(s + 12) >> 2];
+                            if (!n) break c;
+                            if (k < e) break;
+                            else {
+                              m = B;
+                              j = B;
+                              i = A;
+                            }
+                          }
+                          c[L >> 2] = c[G >> 2];
+                          c[(L + 4) >> 2] = c[(G + 4) >> 2];
+                          c[(L + 8) >> 2] = c[(G + 8) >> 2];
+                          c[(L + 12) >> 2] = c[(G + 12) >> 2];
+                          m = B;
+                          j = B;
+                          i = A;
+                          g = n;
+                          f = o;
+                          e = k;
+                        }
+                        c[a >> 2] = 0;
+                        c[(a + 4) >> 2] = o;
+                        h[(a + 8) >> 3] = k;
+                        a = (a + 16) | 0;
+                        c[a >> 2] = c[G >> 2];
+                        c[(a + 4) >> 2] = c[(G + 4) >> 2];
+                        c[(a + 8) >> 2] = c[(G + 8) >> 2];
+                        c[(a + 12) >> 2] = c[(G + 12) >> 2];
+                        break a;
+                      } else w = 46;
+                  while (0);
+                  d: do
+                    if ((w | 0) == 46)
+                      if (((c[(J + 12) >> 2] | 0) == 0) & ((c[J >> 2] | 0) == 0)) {
+                        h[B >> 3] = +h[d >> 3] - +h[z >> 3];
+                        k = +h[E >> 3];
+                        n = (x + 4) | 0;
+                        o = (x + 8) | 0;
+                        p = (x + 16) | 0;
+                        i = k;
+                        k = +h[I >> 3] + k;
+                        while (1) {
+                          h[F >> 3] = k;
+                          if (!(k >= i - +h[D >> 3])) break d;
+                          mT(x, b, d, J);
+                          j = c[x >> 2] | 0;
+                          m = c[n >> 2] | 0;
+                          i = +h[o >> 3];
+                          c[G >> 2] = c[p >> 2];
+                          c[(G + 4) >> 2] = c[(p + 4) >> 2];
+                          c[(G + 8) >> 2] = c[(p + 8) >> 2];
+                          c[(G + 12) >> 2] = c[(p + 12) >> 2];
+                          if (!j) break;
+                          if (i < e) {
+                            c[L >> 2] = c[G >> 2];
+                            c[(L + 4) >> 2] = c[(G + 4) >> 2];
+                            c[(L + 8) >> 2] = c[(G + 8) >> 2];
+                            c[(L + 12) >> 2] = c[(G + 12) >> 2];
+                            g = j;
+                            f = m;
+                            e = i;
+                          }
+                          i = +h[E >> 3];
+                          k = +h[F >> 3] - K;
+                        }
+                        c[a >> 2] = 0;
+                        c[(a + 4) >> 2] = m;
+                        h[(a + 8) >> 3] = i;
+                        a = (a + 16) | 0;
+                        c[a >> 2] = c[G >> 2];
+                        c[(a + 4) >> 2] = c[(G + 4) >> 2];
+                        c[(a + 8) >> 2] = c[(G + 8) >> 2];
+                        c[(a + 12) >> 2] = c[(G + 12) >> 2];
+                        break a;
+                      }
+                  while (0);
+                  i = +h[d >> 3];
+                  k = +h[C >> 3] + i;
+                  h[B >> 3] = k;
+                  q = +h[D >> 3];
+                  h[F >> 3] = +h[E >> 3] - q;
+                  j = c[(J + 4) >> 2] | 0;
+                  do
+                    if (!(c[(J + 8) >> 2] | 0)) {
+                      m = c[J >> 2] | 0;
+                      if (!(((j | 0) == 0) & ((m | 0) == 0))) {
+                        w = 59;
+                        break;
+                      }
+                      if (c[(J + 20) >> 2] | 0) {
+                        j = 0;
+                        m = 0;
+                        w = 59;
+                        break;
+                      }
+                      if (c[(J + 32) >> 2] | 0) {
+                        j = 0;
+                        m = 0;
+                        w = 59;
+                      }
+                    } else {
+                      m = c[J >> 2] | 0;
+                      w = 59;
+                    }
+                  while (0);
+                  e: do
+                    if ((w | 0) == 59) {
+                      f: do
+                        if (((j | 0) == 0) & ((m | 0) == 0)) {
+                          h[B >> 3] = k;
+                          p = (y + 4) | 0;
+                          r = (y + 8) | 0;
+                          s = (y + 16) | 0;
+                          m = F;
+                          j = E;
+                          i = q;
+                          g: while (1) {
+                            while (1) {
+                              h[m >> 3] = +h[j >> 3] - i;
+                              i = +h[d >> 3];
+                              if (!(+h[B >> 3] >= i - +h[z >> 3])) break f;
+                              mT(y, b, d, J);
+                              n = c[y >> 2] | 0;
+                              o = c[p >> 2] | 0;
+                              k = +h[r >> 3];
+                              c[G >> 2] = c[s >> 2];
+                              c[(G + 4) >> 2] = c[(s + 4) >> 2];
+                              c[(G + 8) >> 2] = c[(s + 8) >> 2];
+                              c[(G + 12) >> 2] = c[(s + 12) >> 2];
+                              if (!n) break g;
+                              if (k < e) break;
+                              else {
+                                m = B;
+                                j = B;
+                                i = A;
+                              }
+                            }
+                            c[L >> 2] = c[G >> 2];
+                            c[(L + 4) >> 2] = c[(G + 4) >> 2];
+                            c[(L + 8) >> 2] = c[(G + 8) >> 2];
+                            c[(L + 12) >> 2] = c[(G + 12) >> 2];
+                            m = B;
+                            j = B;
+                            i = A;
+                            g = n;
+                            f = o;
+                            e = k;
+                          }
+                          c[a >> 2] = 0;
+                          c[(a + 4) >> 2] = o;
+                          h[(a + 8) >> 3] = k;
+                          a = (a + 16) | 0;
+                          c[a >> 2] = c[G >> 2];
+                          c[(a + 4) >> 2] = c[(G + 4) >> 2];
+                          c[(a + 8) >> 2] = c[(G + 8) >> 2];
+                          c[(a + 12) >> 2] = c[(G + 12) >> 2];
+                          break a;
+                        }
+                      while (0);
+                      if (c[(J + 20) >> 2] | 0) break;
+                      if (c[(J + 32) >> 2] | 0) break;
+                      h[B >> 3] = +h[C >> 3] + i;
+                      i = +h[E >> 3];
+                      n = (H + 4) | 0;
+                      o = (H + 8) | 0;
+                      p = (H + 16) | 0;
+                      k = i;
+                      i = i - +h[D >> 3];
+                      while (1) {
+                        h[F >> 3] = i;
+                        if (!(i <= +h[I >> 3] + k)) break e;
+                        mT(H, b, d, J);
+                        j = c[H >> 2] | 0;
+                        m = c[n >> 2] | 0;
+                        i = +h[o >> 3];
+                        c[G >> 2] = c[p >> 2];
+                        c[(G + 4) >> 2] = c[(p + 4) >> 2];
+                        c[(G + 8) >> 2] = c[(p + 8) >> 2];
+                        c[(G + 12) >> 2] = c[(p + 12) >> 2];
+                        if (!j) break;
+                        if (i < e) {
+                          c[L >> 2] = c[G >> 2];
+                          c[(L + 4) >> 2] = c[(G + 4) >> 2];
+                          c[(L + 8) >> 2] = c[(G + 8) >> 2];
+                          c[(L + 12) >> 2] = c[(G + 12) >> 2];
+                          g = j;
+                          f = m;
+                          e = i;
+                        }
+                        k = +h[E >> 3];
+                        i = +h[F >> 3] + K;
+                      }
+                      c[a >> 2] = 0;
+                      c[(a + 4) >> 2] = m;
+                      h[(a + 8) >> 3] = i;
+                      a = (a + 16) | 0;
+                      c[a >> 2] = c[G >> 2];
+                      c[(a + 4) >> 2] = c[(G + 4) >> 2];
+                      c[(a + 8) >> 2] = c[(G + 8) >> 2];
+                      c[(a + 12) >> 2] = c[(G + 12) >> 2];
+                      break a;
+                    }
+                  while (0);
+                  c[a >> 2] = g;
+                  c[(a + 4) >> 2] = f;
+                  h[(a + 8) >> 3] = e;
+                  a = (a + 16) | 0;
+                  c[a >> 2] = c[L >> 2];
+                  c[(a + 4) >> 2] = c[(L + 4) >> 2];
+                  c[(a + 8) >> 2] = c[(L + 8) >> 2];
+                  c[(a + 12) >> 2] = c[(L + 12) >> 2];
+                }
+              while (0);
+              l = M;
+              return;
+            }
+            function lT(a) {
+              a = a | 0;
+              VV(c[(a + 24) >> 2] | 0) | 0;
+              U1(a);
+              return;
+            }
+            function mT(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0.0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0.0,
+                s = 0,
+                t = 0;
+              t = l;
+              l = (l + 48) | 0;
+              q = (t + 32) | 0;
+              s = (t + 16) | 0;
+              p = t;
+              g = c[(e + 32) >> 2] | 0;
+              if (!g) qa(111533, 111543, 382, 111562);
+              o = (g + 16) | 0;
+              c[p >> 2] = c[o >> 2];
+              c[(p + 4) >> 2] = c[(o + 4) >> 2];
+              c[(p + 8) >> 2] = c[(o + 8) >> 2];
+              c[(p + 12) >> 2] = c[(o + 12) >> 2];
+              o = (d + 4) | 0;
+              m = 0;
+              g = 0;
+              while (1) {
+                if ((m | 0) >= (c[o >> 2] | 0)) break;
+                j = c[d >> 2] | 0;
+                k = (j + ((m * 40) | 0)) | 0;
+                do
+                  if ((k | 0) != (e | 0)) {
+                    if (+h[(j + ((m * 40) | 0) + 16) >> 3] > 0.0 ? +h[(j + ((m * 40) | 0) + 24) >> 3] > 0.0 : 0) break;
+                    g = (g + (((nT(e, k) | 0) != 0) & 1)) | 0;
+                  }
+                while (0);
+                m = (m + 1) | 0;
+              }
+              oT(e, q);
+              m = c[(d + 24) >> 2] | 0;
+              m = XV(m, c[m >> 2] | 0, q) | 0;
+              if (!m) {
+                c[b >> 2] = g;
+                h[(b + 8) >> 3] = 0.0;
+                s = (b + 16) | 0;
+                c[s >> 2] = c[p >> 2];
+                c[(s + 4) >> 2] = c[(p + 4) >> 2];
+                c[(s + 8) >> 2] = c[(p + 8) >> 2];
+                c[(s + 12) >> 2] = c[(p + 12) >> 2];
+              } else {
+                k = m;
+                i = 0.0;
+                while (1) {
+                  if (!k) break;
+                  j = c[((c[(k + 4) >> 2] | 0) + 16) >> 2] | 0;
+                  if ((j | 0) != (e | 0)) {
+                    pT(j, s);
+                    n = +qT(q, s);
+                    if (n > 0.0) {
+                      g = (g + 1) | 0;
+                      i = +rT(e, j, q, n, f) + i;
+                    }
+                    d = c[(j + 32) >> 2] | 0;
+                    if (((d | 0) != 0 ? (a[(d + 36) >> 0] | 0) != 0 : 0) ? (oT(j, s), (r = +qT(q, s)), r > 0.0) : 0) {
+                      g = (g + 1) | 0;
+                      i = +sT(e, j, q, r, f) + i;
+                    }
+                  }
+                  k = c[k >> 2] | 0;
+                }
+                SV(m);
+                c[b >> 2] = g;
+                h[(b + 8) >> 3] = i;
+                s = (b + 16) | 0;
+                c[s >> 2] = c[p >> 2];
+                c[(s + 4) >> 2] = c[(p + 4) >> 2];
+                c[(s + 8) >> 2] = c[(p + 8) >> 2];
+                c[(s + 12) >> 2] = c[(p + 12) >> 2];
+              }
+              l = t;
+              return;
+            }
+            function nT(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0.0,
+                g = 0.0;
+              a = c[(a + 32) >> 2] | 0;
+              if (+h[(b + 16) >> 3] == 0.0 ? +h[(b + 24) >> 3] == 0.0 : 0) {
+                if (
+                  (((a | 0) != 0 ? ((d = +h[b >> 3]), (e = +h[(a + 16) >> 3]), d > e) : 0) ? d < +h[a >> 3] + e : 0)
+                    ? ((f = +h[(b + 8) >> 3]), (g = +h[(a + 24) >> 3]), f > g)
+                    : 0
+                )
+                  a = (f < +h[(a + 8) >> 3] + g) & 1;
+                else a = 0;
+                return a | 0;
+              }
+              qa(111599, 111543, 219, 111636);
+              return 0;
+            }
+            function oT(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0.0;
+              a = c[(a + 32) >> 2] | 0;
+              e = +h[(a + 16) >> 3];
+              c[b >> 2] = ~~e;
+              d = +h[(a + 24) >> 3];
+              c[(b + 4) >> 2] = ~~d;
+              c[(b + 8) >> 2] = ~~(+h[a >> 3] + e);
+              c[(b + 12) >> 2] = ~~(+h[(a + 8) >> 3] + d);
+              return;
+            }
+            function pT(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0.0;
+              e = +h[a >> 3];
+              c[b >> 2] = ~~e;
+              d = +h[(a + 8) >> 3];
+              c[(b + 4) >> 2] = ~~d;
+              c[(b + 8) >> 2] = ~~(+h[(a + 16) >> 3] + e);
+              c[(b + 12) >> 2] = ~~(+h[(a + 24) >> 3] + d);
+              return;
+            }
+            function qT(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              i = c[(a + 8) >> 2] | 0;
+              j = c[b >> 2] | 0;
+              if (
+                (
+                  ((i | 0) >= (j | 0) ? ((k = c[a >> 2] | 0), (l = c[(b + 8) >> 2] | 0), (k | 0) <= (l | 0)) : 0)
+                    ? ((e = c[(a + 12) >> 2] | 0), (f = c[(b + 4) >> 2] | 0), (e | 0) >= (f | 0))
+                    : 0
+                )
+                  ? ((g = c[(a + 4) >> 2] | 0), (h = c[(b + 12) >> 2] | 0), (g | 0) <= (h | 0))
+                  : 0
+              )
+                d =
+                  (+(c[(((e | 0) < (h | 0) ? a : b) + 12) >> 2] | 0) -
+                    +(c[(((g | 0) > (f | 0) ? a : b) + 4) >> 2] | 0)) *
+                  (+(c[(((i | 0) < (l | 0) ? a : b) + 8) >> 2] | 0) - +(c[((k | 0) > (j | 0) ? a : b) >> 2] | 0));
+              else d = 0.0;
+              return +d;
+            }
+            function rT(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = +e;
+              f = f | 0;
+              var g = 0.0,
+                h = 0.0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 16) | 0;
+              i = j;
+              a = tT(a, b) | 0;
+              f = (f + (((a | 0) < 0 ? 5 : a) << 2)) | 0;
+              a = c[f >> 2] | 0;
+              if (!a) {
+                c[f >> 2] = b;
+                g = e;
+              } else {
+                pT(a, i);
+                g = +qT(d, i);
+                g = g > e ? g : 0.0;
+                a = c[f >> 2] | 0;
+                if ((c[(a + 32) >> 2] | 0) != 0 ? (oT(a, i), (h = +qT(d, i)), h > e) : 0) g = h > g ? h : g;
+                if (!(g > 0.0)) {
+                  c[f >> 2] = b;
+                  g = e;
+                }
+              }
+              l = j;
+              return +g;
+            }
+            function sT(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = +e;
+              f = f | 0;
+              var g = 0.0,
+                h = 0.0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 16) | 0;
+              i = j;
+              a = tT(a, b) | 0;
+              f = (f + (((a | 0) < 0 ? 5 : a) << 2)) | 0;
+              a = c[f >> 2] | 0;
+              if (!a) {
+                c[f >> 2] = b;
+                g = e;
+              } else {
+                pT(a, i);
+                g = +qT(d, i);
+                g = g > e ? g : 0.0;
+                a = c[f >> 2] | 0;
+                if ((c[(a + 32) >> 2] | 0) != 0 ? (oT(a, i), (h = +qT(d, i)), h > e) : 0) g = h > g ? h : g;
+                if (!(g > 0.0)) {
+                  c[f >> 2] = b;
+                  g = e;
+                }
+              }
+              l = j;
+              return +g;
+            }
+            function tT(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0;
+              e = c[(b + 32) >> 2] | 0;
+              f = c[(d + 32) >> 2] | 0;
+              if ((e | 0) == (f | 0)) qa(111578, 111543, 276, 111588);
+              do
+                if ((a[(e + 36) >> 0] | 0) != 0 ? (a[(f + 36) >> 0] | 0) != 0 : 0) {
+                  j = +h[b >> 3];
+                  if (j == 0.0 ? +h[(b + 8) >> 3] == 0.0 : 0) {
+                    e = -1;
+                    break;
+                  }
+                  k = +h[d >> 3];
+                  i = +h[(d + 8) >> 3];
+                  if (!((k == 0.0) & (i == 0.0))) {
+                    g = +h[(b + 8) >> 3];
+                    if (i < g) {
+                      if (k < j) {
+                        e = 0;
+                        break;
+                      }
+                      e = k > j ? 2 : 1;
+                      break;
+                    }
+                    e = k < j;
+                    if (i > g) {
+                      if (e) {
+                        e = 6;
+                        break;
+                      }
+                      e = k > j ? 8 : 7;
+                      break;
+                    }
+                    if (!e)
+                      if (k > j) e = 5;
+                      else e = -1;
+                    else e = 3;
+                  } else e = -1;
+                } else e = -1;
+              while (0);
+              return e | 0;
+            }
+            function uT(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              k = l;
+              l = (l + 32) | 0;
+              d = (k + 24) | 0;
+              e = (k + 16) | 0;
+              f = k;
+              g = fT(a) | 0;
+              h = (a + 4) | 0;
+              i = (e + 4) | 0;
+              j = (a + 20) | 0;
+              b = 0;
+              while (1) {
+                if ((b | 0) >= (c[h >> 2] | 0)) {
+                  b = 0;
+                  break;
+                }
+                m = JK(32) | 0;
+                o = ((c[a >> 2] | 0) + ((b * 40) | 0)) | 0;
+                n = (m + 12) | 0;
+                c[(m + 28) >> 2] = o;
+                xT(f, o);
+                c[n >> 2] = c[f >> 2];
+                c[(n + 4) >> 2] = c[(f + 4) >> 2];
+                c[(n + 8) >> 2] = c[(f + 8) >> 2];
+                c[(n + 12) >> 2] = c[(f + 12) >> 2];
+                n = c[n >> 2] | 0;
+                c[e >> 2] = (((((c[(m + 20) >> 2] | 0) - n) | 0) / 2) | 0) + n;
+                n = c[(m + 16) >> 2] | 0;
+                c[i >> 2] = (((((c[(m + 24) >> 2] | 0) - n) | 0) / 2) | 0) + n;
+                c[d >> 2] = c[e >> 2];
+                c[(d + 4) >> 2] = c[(e + 4) >> 2];
+                c[(m + 8) >> 2] = yT(d, g) | 0;
+                n = c[j >> 2] | 0;
+                if (!(nb[c[n >> 2] & 63](n, m, 1) | 0)) {
+                  b = -1;
+                  break;
+                } else b = (b + 1) | 0;
+              }
+              l = k;
+              return b | 0;
+            }
+            function vT(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              d = (a + 20) | 0;
+              e = c[d >> 2] | 0;
+              b = (a + 24) | 0;
+              a = nb[c[e >> 2] & 63](e, 0, 128) | 0;
+              while (1) {
+                if (!a) break;
+                e = c[b >> 2] | 0;
+                YV(e, (a + 12) | 0, c[(a + 28) >> 2] | 0, e, 0) | 0;
+                e = c[d >> 2] | 0;
+                a = nb[c[e >> 2] & 63](e, a, 8) | 0;
+              }
+              return;
+            }
+            function wT(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              e = (a + 20) | 0;
+              f = Xz(c[e >> 2] | 0) | 0;
+              d = 0;
+              while (1) {
+                if (!(Xz(c[e >> 2] | 0) | 0)) break;
+                g = c[e >> 2] | 0;
+                a = c[((c[(g + 8) >> 2] | 0) + 4) >> 2] | 0;
+                if (!a) {
+                  h = 8;
+                  break;
+                }
+                b = c[((c[(g + 4) >> 2] | 0) + 8) >> 2] | 0;
+                if ((b | 0) < 0) a = c[(a + 8) >> 2] | 0;
+                else a = (a + (0 - b)) | 0;
+                if (!a) {
+                  h = 8;
+                  break;
+                }
+                nb[c[g >> 2] & 63](g, a, 4096) | 0;
+                U1(a);
+                d = (d + 1) | 0;
+              }
+              if ((h | 0) == 8) qa(111649, 111543, 616, 111652);
+              if ((f | 0) == (d | 0)) return;
+              else qa(111664, 111543, 623, 111652);
+            }
+            function xT(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0.0,
+                f = 0.0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0.0;
+              d = c[(b + 32) >> 2] | 0;
+              if (!d) {
+                e = 0.0;
+                f = 0.0;
+              } else {
+                e = +h[d >> 3];
+                f = +h[(d + 8) >> 3];
+              }
+              l = +h[b >> 3];
+              k = ~~+A(+(l - e));
+              g = +h[(b + 8) >> 3];
+              j = ~~+A(+(g - f));
+              i = ~~+N(+(l + e + +h[(b + 16) >> 3]));
+              if ((i | 0) == 2147483647) qa(111676, 111543, 264, 111703);
+              d = ~~+N(+(g + f + +h[(b + 24) >> 3]));
+              if ((d | 0) == 2147483647) qa(111713, 111543, 266, 111703);
+              else {
+                c[a >> 2] = k;
+                c[(a + 4) >> 2] = j;
+                c[(a + 8) >> 2] = i;
+                c[(a + 12) >> 2] = d;
+                return;
+              }
+            }
+            function yT(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              f = 0;
+              e = c[a >> 2] | 0;
+              d = c[(a + 4) >> 2] | 0;
+              while (1) {
+                a = (b + -1) | 0;
+                if ((b | 0) <= 0) break;
+                i = (e >>> a) & 1;
+                b = (d >>> a) & 1;
+                g = (b + -1) | 0;
+                h = g & (e ^ d);
+                g = g & (0 - i);
+                f = (i << 1) | (f << 2) | (i ^ b);
+                b = a;
+                e = h ^ e ^ g;
+                d = h ^ d ^ g;
+              }
+              return f | 0;
+            }
+            function zT(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              d = l2(b) | 0;
+              if (d >>> 0 >= (c[47365] | 0) >>> 0) {
+                d = (d + 11) | 0;
+                c[47365] = d;
+                d = MK(c[47366] | 0, d) | 0;
+                c[47366] = d;
+                if (!d) d = 0;
+                else e = 4;
+              } else {
+                d = c[47366] | 0;
+                e = 4;
+              }
+              if ((e | 0) == 4) {
+                g = d;
+                while (1) {
+                  e = a[b >> 0] | 0;
+                  if (!((e << 24) >> 24)) break;
+                  f = e & 255;
+                  if (e3(f) | 0) e = (d3(f) | 0) & 255;
+                  a[g >> 0] = e;
+                  g = (g + 1) | 0;
+                  b = (b + 1) | 0;
+                }
+                a[g >> 0] = 0;
+              }
+              return d | 0;
+            }
+            function AT(b, e, f) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0.0,
+                i = 0,
+                j = 0.0,
+                k = 0.0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0.0;
+              F = l;
+              l = (l + 144) | 0;
+              s = (F + 96) | 0;
+              p = (F + 80) | 0;
+              v = (F + 124) | 0;
+              t = (F + 72) | 0;
+              w = (F + 64) | 0;
+              x = (F + 56) | 0;
+              C = (F + 48) | 0;
+              D = (F + 40) | 0;
+              E = (F + 32) | 0;
+              y = (F + 24) | 0;
+              z = (F + 16) | 0;
+              A = (F + 8) | 0;
+              B = F;
+              i = (F + 120) | 0;
+              m = (F + 116) | 0;
+              n = (F + 112) | 0;
+              o = (F + 108) | 0;
+              c[(e + 32) >> 2] = f;
+              r = b;
+              while (1)
+                if ((a[r >> 0] | 0) == 32) r = (r + 1) | 0;
+                else break;
+              c[o >> 2] = 255;
+              b = a[r >> 0] | 0;
+              a: do
+                if ((b << 24) >> 24 == 35) {
+                  c[p >> 2] = i;
+                  c[(p + 4) >> 2] = m;
+                  c[(p + 8) >> 2] = n;
+                  c[(p + 12) >> 2] = o;
+                  if ((b5(r, 111755, p) | 0) <= 2) {
+                    b = a[r >> 0] | 0;
+                    q = 12;
+                    break;
+                  }
+                  switch (f | 0) {
+                    case 0: {
+                      G = +((c[i >> 2] | 0) >>> 0) * 0.00392156862745098;
+                      h[C >> 3] = G;
+                      g = +((c[m >> 2] | 0) >>> 0) * 0.00392156862745098;
+                      h[D >> 3] = g;
+                      j = +((c[n >> 2] | 0) >>> 0) * 0.00392156862745098;
+                      h[E >> 3] = j;
+                      k = +((c[o >> 2] | 0) >>> 0) * 0.00392156862745098;
+                      BT(G, g, j, t, w, x);
+                      h[e >> 3] = +h[t >> 3];
+                      h[(e + 8) >> 3] = +h[w >> 3];
+                      h[(e + 16) >> 3] = +h[x >> 3];
+                      h[(e + 24) >> 3] = k;
+                      b = 0;
+                      break a;
+                    }
+                    case 1: {
+                      a[e >> 0] = c[i >> 2];
+                      a[(e + 1) >> 0] = c[m >> 2];
+                      a[(e + 2) >> 0] = c[n >> 2];
+                      a[(e + 3) >> 0] = c[o >> 2];
+                      b = 0;
+                      break a;
+                    }
+                    case 3: {
+                      j = +((c[i >> 2] | 0) >>> 0) * 0.00392156862745098;
+                      h[C >> 3] = j;
+                      k = +((c[m >> 2] | 0) >>> 0) * 0.00392156862745098;
+                      h[D >> 3] = k;
+                      G = +((c[n >> 2] | 0) >>> 0) * 0.00392156862745098;
+                      h[E >> 3] = G;
+                      CT(j, k, G, y, z, A, B);
+                      a[e >> 0] = ~~+h[y >> 3] * 255;
+                      a[(e + 1) >> 0] = ~~+h[z >> 3] * 255;
+                      a[(e + 2) >> 0] = ~~+h[A >> 3] * 255;
+                      a[(e + 3) >> 0] = ~~+h[B >> 3] * 255;
+                      b = 0;
+                      break a;
+                    }
+                    case 2: {
+                      c[e >> 2] = (((((c[i >> 2] | 0) * 65535) | 0) >>> 0) / 255) | 0;
+                      c[(e + 4) >> 2] = (((((c[m >> 2] | 0) * 65535) | 0) >>> 0) / 255) | 0;
+                      c[(e + 8) >> 2] = (((((c[n >> 2] | 0) * 65535) | 0) >>> 0) / 255) | 0;
+                      c[(e + 12) >> 2] = (((((c[o >> 2] | 0) * 65535) | 0) >>> 0) / 255) | 0;
+                      b = 0;
+                      break a;
+                    }
+                    case 4: {
+                      h[e >> 3] = +((c[i >> 2] | 0) >>> 0) * 0.00392156862745098;
+                      h[(e + 8) >> 3] = +((c[m >> 2] | 0) >>> 0) * 0.00392156862745098;
+                      h[(e + 16) >> 3] = +((c[n >> 2] | 0) >>> 0) * 0.00392156862745098;
+                      h[(e + 24) >> 3] = +((c[o >> 2] | 0) >>> 0) * 0.00392156862745098;
+                      b = 0;
+                      break a;
+                    }
+                    default: {
+                      b = 0;
+                      break a;
+                    }
+                  }
+                } else q = 12;
+              while (0);
+              b: do
+                if ((q | 0) == 12) {
+                  if (!((b << 24) >> 24 != 46 ? (((b & 255) + -48) | 0) >>> 0 >= 10 : 0)) {
+                    b = l2(r) | 0;
+                    if (b >>> 0 >= (c[47367] | 0) >>> 0) {
+                      b = (b + 11) | 0;
+                      c[47367] = b;
+                      b = MK(c[47368] | 0, b) | 0;
+                      c[47368] = b;
+                      if (!b) {
+                        b = -1;
+                        break;
+                      }
+                    } else b = c[47368] | 0;
+                    m = b;
+                    i = r;
+                    c: while (1) {
+                      n = (i + 1) | 0;
+                      i = a[i >> 0] | 0;
+                      switch ((i << 24) >> 24) {
+                        case 0:
+                          break c;
+                        case 44: {
+                          i = 32;
+                          break;
+                        }
+                        default: {
+                        }
+                      }
+                      a[m >> 0] = i;
+                      m = (m + 1) | 0;
+                      i = n;
+                    }
+                    a[m >> 0] = 0;
+                    c[s >> 2] = t;
+                    c[(s + 4) >> 2] = w;
+                    c[(s + 8) >> 2] = x;
+                    if ((b5(b, 111769, s) | 0) == 3) {
+                      k = +h[t >> 3];
+                      k = k < 1.0 ? k : 1.0;
+                      k = k > 0.0 ? k : 0.0;
+                      h[t >> 3] = k;
+                      j = +h[w >> 3];
+                      j = j < 1.0 ? j : 1.0;
+                      j = j > 0.0 ? j : 0.0;
+                      h[w >> 3] = j;
+                      g = +h[x >> 3];
+                      g = g < 1.0 ? g : 1.0;
+                      g = g > 0.0 ? g : 0.0;
+                      h[x >> 3] = g;
+                      switch (f | 0) {
+                        case 0: {
+                          h[e >> 3] = k;
+                          h[(e + 8) >> 3] = j;
+                          h[(e + 16) >> 3] = g;
+                          h[(e + 24) >> 3] = 1.0;
+                          b = 0;
+                          break b;
+                        }
+                        case 1: {
+                          DT(k, j, g, C, D, E);
+                          a[e >> 0] = ~~(+h[C >> 3] * 255.0);
+                          a[(e + 1) >> 0] = ~~(+h[D >> 3] * 255.0);
+                          a[(e + 2) >> 0] = ~~(+h[E >> 3] * 255.0);
+                          a[(e + 3) >> 0] = -1;
+                          b = 0;
+                          break b;
+                        }
+                        case 3: {
+                          DT(k, j, g, C, D, E);
+                          CT(+h[C >> 3], +h[D >> 3], +h[E >> 3], y, z, A, B);
+                          a[e >> 0] = ~~+h[y >> 3] * 255;
+                          a[(e + 1) >> 0] = ~~+h[z >> 3] * 255;
+                          a[(e + 2) >> 0] = ~~+h[A >> 3] * 255;
+                          a[(e + 3) >> 0] = ~~+h[B >> 3] * 255;
+                          b = 0;
+                          break b;
+                        }
+                        case 2: {
+                          DT(k, j, g, C, D, E);
+                          c[e >> 2] = ~~(+h[C >> 3] * 65535.0);
+                          c[(e + 4) >> 2] = ~~(+h[D >> 3] * 65535.0);
+                          c[(e + 8) >> 2] = ~~(+h[E >> 3] * 65535.0);
+                          c[(e + 12) >> 2] = 65535;
+                          b = 0;
+                          break b;
+                        }
+                        case 4: {
+                          DT(k, j, g, C, D, E);
+                          h[e >> 3] = +h[C >> 3];
+                          h[(e + 8) >> 3] = +h[D >> 3];
+                          h[(e + 16) >> 3] = +h[E >> 3];
+                          h[(e + 24) >> 3] = 1.0;
+                          b = 0;
+                          break b;
+                        }
+                        default: {
+                          b = 0;
+                          break b;
+                        }
+                      }
+                    }
+                  }
+                  i = ET(r) | 0;
+                  c[v >> 2] = i;
+                  if (!i) b = -1;
+                  else {
+                    b = c[47369] | 0;
+                    if (
+                      !(((b | 0) != 0 ? ((u = c[b >> 2] | 0), (a[u >> 0] | 0) == (a[i >> 0] | 0)) : 0)
+                        ? (s2(u, i) | 0) == 0
+                        : 0)
+                    ) {
+                      b = u5(v, 25948, 2491, 12, 103) | 0;
+                      c[47369] = b;
+                      if (!b)
+                        switch (f | 0) {
+                          case 0: {
+                            c[e >> 2] = 0;
+                            c[(e + 4) >> 2] = 0;
+                            c[(e + 8) >> 2] = 0;
+                            c[(e + 12) >> 2] = 0;
+                            c[(e + 16) >> 2] = 0;
+                            c[(e + 20) >> 2] = 0;
+                            h[(e + 24) >> 3] = 1.0;
+                            b = 1;
+                            break b;
+                          }
+                          case 1: {
+                            a[(e + 2) >> 0] = 0;
+                            a[(e + 1) >> 0] = 0;
+                            a[e >> 0] = 0;
+                            a[(e + 3) >> 0] = -1;
+                            b = 1;
+                            break b;
+                          }
+                          case 3: {
+                            c[e >> 2] = 0;
+                            b = 1;
+                            break b;
+                          }
+                          case 2: {
+                            c[(e + 8) >> 2] = 0;
+                            c[(e + 4) >> 2] = 0;
+                            c[e >> 2] = 0;
+                            c[(e + 12) >> 2] = 65535;
+                            b = 1;
+                            break b;
+                          }
+                          case 4: {
+                            c[e >> 2] = 0;
+                            c[(e + 4) >> 2] = 0;
+                            c[(e + 8) >> 2] = 0;
+                            c[(e + 12) >> 2] = 0;
+                            c[(e + 16) >> 2] = 0;
+                            c[(e + 20) >> 2] = 0;
+                            h[(e + 24) >> 3] = 1.0;
+                            b = 1;
+                            break b;
+                          }
+                          default: {
+                            b = 1;
+                            break b;
+                          }
+                        }
+                    }
+                    switch (f | 0) {
+                      case 0: {
+                        h[e >> 3] = +(d[(b + 4) >> 0] | 0) * 0.00392156862745098;
+                        h[(e + 8) >> 3] = +(d[(b + 5) >> 0] | 0) * 0.00392156862745098;
+                        h[(e + 16) >> 3] = +(d[(b + 6) >> 0] | 0) * 0.00392156862745098;
+                        h[(e + 24) >> 3] = +(d[(b + 10) >> 0] | 0) * 0.00392156862745098;
+                        b = 0;
+                        break b;
+                      }
+                      case 1: {
+                        a[e >> 0] = a[(b + 7) >> 0] | 0;
+                        a[(e + 1) >> 0] = a[(b + 8) >> 0] | 0;
+                        a[(e + 2) >> 0] = a[(b + 9) >> 0] | 0;
+                        a[(e + 3) >> 0] = a[(b + 10) >> 0] | 0;
+                        b = 0;
+                        break b;
+                      }
+                      case 3: {
+                        j = +(d[(b + 7) >> 0] | 0) * 0.00392156862745098;
+                        h[C >> 3] = j;
+                        k = +(d[(b + 8) >> 0] | 0) * 0.00392156862745098;
+                        h[D >> 3] = k;
+                        G = +(d[(b + 9) >> 0] | 0) * 0.00392156862745098;
+                        h[E >> 3] = G;
+                        CT(j, k, G, y, z, A, B);
+                        a[e >> 0] = ~~+h[y >> 3] * 255;
+                        a[(e + 1) >> 0] = ~~+h[z >> 3] * 255;
+                        a[(e + 2) >> 0] = ~~+h[A >> 3] * 255;
+                        a[(e + 3) >> 0] = ~~+h[B >> 3] * 255;
+                        b = 0;
+                        break b;
+                      }
+                      case 2: {
+                        c[e >> 2] = (d[(b + 7) >> 0] | 0) * 257;
+                        c[(e + 4) >> 2] = (d[(b + 8) >> 0] | 0) * 257;
+                        c[(e + 8) >> 2] = (d[(b + 9) >> 0] | 0) * 257;
+                        c[(e + 12) >> 2] = (d[(b + 10) >> 0] | 0) * 257;
+                        b = 0;
+                        break b;
+                      }
+                      case 4: {
+                        h[e >> 3] = +(d[(b + 7) >> 0] | 0) * 0.00392156862745098;
+                        h[(e + 8) >> 3] = +(d[(b + 8) >> 0] | 0) * 0.00392156862745098;
+                        h[(e + 16) >> 3] = +(d[(b + 9) >> 0] | 0) * 0.00392156862745098;
+                        h[(e + 24) >> 3] = +(d[(b + 10) >> 0] | 0) * 0.00392156862745098;
+                        b = 0;
+                        break b;
+                      }
+                      default: {
+                        b = 0;
+                        break b;
+                      }
+                    }
+                  }
+                }
+              while (0);
+              l = F;
+              return b | 0;
+            }
+            function BT(a, b, c, d, e, f) {
+              a = +a;
+              b = +b;
+              c = +c;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                l = 0.0,
+                m = 0.0;
+              i = b < c ? b : c;
+              m = b > c ? b : c;
+              m = m < a ? a : m;
+              i = m - (i > a ? a : i);
+              g = i / m;
+              if (m > 0.0)
+                if (g > 0.0) {
+                  j = (m - a) / i;
+                  k = (m - b) / i;
+                  l = (m - c) / i;
+                  do
+                    if (!(m == a)) {
+                      if (m == b) {
+                        a = j + 2.0 - l;
+                        break;
+                      }
+                      if (m == c) a = k + 4.0 - j;
+                      else a = 0.0;
+                    } else a = (b - c) / i;
+                  while (0);
+                  a = a * 60.0;
+                  if (a < 0.0) a = a + 360.0;
+                } else a = 0.0;
+              else {
+                g = 0.0;
+                a = 0.0;
+              }
+              h[d >> 3] = a * 0.002777777777777778;
+              h[f >> 3] = m;
+              h[e >> 3] = g;
+              return;
+            }
+            function CT(a, b, c, d, e, f, g) {
+              a = +a;
+              b = +b;
+              c = +c;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h[d >> 3] = 1.0 - a;
+              h[e >> 3] = 1.0 - b;
+              h[f >> 3] = 1.0 - c;
+              b = +h[d >> 3];
+              c = +h[e >> 3];
+              c = b < c ? b : c;
+              h[g >> 3] = c;
+              b = +h[f >> 3];
+              c = b < c ? b : c;
+              h[g >> 3] = c;
+              h[d >> 3] = +h[d >> 3] - c;
+              h[e >> 3] = +h[e >> 3] - +h[g >> 3];
+              h[f >> 3] = +h[f >> 3] - +h[g >> 3];
+              return;
+            }
+            function DT(a, b, c, d, e, f) {
+              a = +a;
+              b = +b;
+              c = +c;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0,
+                l = 0;
+              a: do
+                if (!(b <= 0.0)) {
+                  i = !(a >= 1.0) ? a * 6.0 : 0.0;
+                  l = ~~i;
+                  i = i - +(l | 0);
+                  a = (1.0 - b) * c;
+                  j = (1.0 - i * b) * c;
+                  b = (1.0 - (1.0 - i) * b) * c;
+                  switch (l | 0) {
+                    case 0: {
+                      g = a;
+                      i = b;
+                      a = c;
+                      k = 8;
+                      break a;
+                    }
+                    case 1: {
+                      g = a;
+                      i = c;
+                      a = j;
+                      k = 8;
+                      break a;
+                    }
+                    case 2: {
+                      g = b;
+                      i = c;
+                      k = 8;
+                      break a;
+                    }
+                    case 3: {
+                      g = c;
+                      i = j;
+                      k = 8;
+                      break a;
+                    }
+                    case 4: {
+                      g = c;
+                      i = a;
+                      a = b;
+                      k = 8;
+                      break a;
+                    }
+                    case 5: {
+                      g = j;
+                      i = a;
+                      a = c;
+                      k = 8;
+                      break a;
+                    }
+                    default:
+                      break a;
+                  }
+                } else {
+                  g = c;
+                  i = c;
+                  a = c;
+                  k = 8;
+                }
+              while (0);
+              if ((k | 0) == 8) {
+                h[d >> 3] = a;
+                h[e >> 3] = i;
+                h[f >> 3] = g;
+              }
+              return;
+            }
+            function ET(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = a[b >> 0] | 0;
+              if (
+                (
+                  (
+                    (d << 24) >> 24 != 98
+                      ? ((e = (b + 1) | 0), !(((d << 24) >> 24 == 119) | ((Q2(e, 137266, 4) | 0) == 0)))
+                      : 0
+                  )
+                    ? !(((d << 24) >> 24 == 108) | ((Q2(e, 137271, 4) | 0) == 0))
+                    : 0
+                )
+                  ? (Q2(e, 137276, 8) | 0) != 0
+                  : 0
+              ) {
+                do
+                  if ((d << 24) >> 24 == 47) {
+                    d = R2(e, 47) | 0;
+                    if (!d) b = e;
+                    else {
+                      if ((a[e >> 0] | 0) != 47) {
+                        e = (j3(137285, e, 4) | 0) == 0;
+                        b = e ? (d + 1) | 0 : b;
+                        break;
+                      }
+                      d = c[47370] | 0;
+                      if ((d | 0 ? a[d >> 0] | 0 : 0) ? j3(137285, d, 3) | 0 : 0) {
+                        b = GT(d, (b + 2) | 0) | 0;
+                        break;
+                      }
+                      b = (b + 2) | 0;
+                    }
+                  } else {
+                    d = c[47370] | 0;
+                    if (((d | 0) != 0 ? (a[d >> 0] | 0) != 0 : 0) ? (j3(137285, d, 3) | 0) != 0 : 0) b = GT(d, b) | 0;
+                  }
+                while (0);
+                b = zT(b) | 0;
+              }
+              return b | 0;
+            }
+            function FT(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return c3(c[a >> 2] | 0, c[b >> 2] | 0) | 0;
+            }
+            function GT(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              f = l;
+              l = (l + 16) | 0;
+              e = f;
+              g = l2(a) | 0;
+              g = ((l2(b) | 0) + g) | 0;
+              d = (g + 13) | 0;
+              if (((g + 3) | 0) >>> 0 < (c[47371] | 0) >>> 0) d = c[47372] | 0;
+              else {
+                c[47371] = d;
+                d = MK(c[47372] | 0, d) | 0;
+                c[47372] = d;
+              }
+              c[e >> 2] = a;
+              c[(e + 4) >> 2] = b;
+              m4(d, 137290, e) | 0;
+              l = f;
+              return c[47372] | 0;
+            }
+            function HT(a) {
+              a = a | 0;
+              c[47370] = a;
+              return;
+            }
+            function IT(a, b, c, d, e) {
+              a = a | 0;
+              b = +b;
+              c = +c;
+              d = +d;
+              e = +e;
+              var f = 0,
+                g = 0;
+              f = l;
+              l = (l + 208) | 0;
+              g = f;
+              JT(g, +h[a >> 3], +h[(a + 8) >> 3], b, c, d, e);
+              a = KT(g) | 0;
+              l = f;
+              return a | 0;
+            }
+            function JT(a, b, c, d, e, f, g) {
+              a = a | 0;
+              b = +b;
+              c = +c;
+              d = +d;
+              e = +e;
+              f = +f;
+              g = +g;
+              var i = 0,
+                j = 0;
+              h[a >> 3] = b;
+              h[(a + 8) >> 3] = c;
+              j = (a + 16) | 0;
+              h[j >> 3] = d;
+              i = (a + 24) | 0;
+              h[i >> 3] = e;
+              h[(a + 32) >> 3] = 0.0;
+              c = +K(+(+F(+f) / e), +(+E(+f) / d));
+              h[(a + 56) >> 3] = c;
+              e = +K(+(+F(+g) / e), +(+E(+g) / d));
+              h[(a + 40) >> 3] = 1.0;
+              h[(a + 48) >> 3] = 0.0;
+              e = e - +A(+((e - c) * 0.15915494309189535)) * 6.283185307179586;
+              h[(a + 64) >> 3] = (g - f > 3.141592653589793) & (e - c < 3.141592653589793) ? e + 6.283185307179586 : e;
+              QT(a);
+              RT(a);
+              ST(a);
+              g = +h[j >> 3];
+              g = (g - +h[i >> 3]) / g;
+              h[(a + 168) >> 3] = g;
+              h[(a + 176) >> 3] = (2.0 - g) * g;
+              g = 1.0 - g;
+              h[(a + 184) >> 3] = g;
+              h[(a + 192) >> 3] = g * g;
+              return;
+            }
+            function KT(a) {
+              a = a | 0;
+              var b = 0,
+                c = 0.0,
+                d = 0,
+                e = 0.0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0.0,
+                o = 0.0,
+                p = 0,
+                q = 0,
+                r = 0.0,
+                s = 0.0,
+                t = 0.0,
+                u = 0.0,
+                v = 0.0,
+                w = 0.0,
+                x = 0.0,
+                y = 0.0,
+                z = 0.0;
+              q = JK(8) | 0;
+              f = +h[(a + 56) >> 3];
+              e = +h[(a + 64) >> 3] - f;
+              p = 1;
+              b = 0;
+              while (1) {
+                o = e / +(p | 0);
+                if (!(((b << 24) >> 24 == 0) & ((p | 0) < 1024))) break;
+                a: do
+                  if (!(o <= 1.5707963267948966)) b = 0;
+                  else {
+                    c = f;
+                    d = 0;
+                    b = 1;
+                    while (1) {
+                      if (!(((b << 24) >> 24 != 0) & ((d | 0) < (p | 0)))) break a;
+                      n = c + o;
+                      b = (+LT(a, c, n) <= 1.0e-5) & 1;
+                      c = n;
+                      d = (d + 1) | 0;
+                    }
+                  }
+                while (0);
+                p = p << 1;
+              }
+              i = +E(+f);
+              u = +F(+f);
+              d = (a + 16) | 0;
+              s = +h[d >> 3];
+              v = s * i;
+              j = (a + 24) | 0;
+              c = +h[j >> 3];
+              g = c * u;
+              i = c * i;
+              c = +h[a >> 3];
+              k = (a + 40) | 0;
+              t = +h[k >> 3];
+              l = (a + 48) | 0;
+              r = +h[l >> 3];
+              e = t * v + c - r * g;
+              m = (a + 8) | 0;
+              n = +h[m >> 3];
+              g = r * v + t * g + n;
+              s = -(u * s);
+              MT(q, c, n);
+              NT(q, e, g);
+              n = +G(+(o * 0.5));
+              n = +F(+o) * 0.3333333333333333 * (+C(+(n * n * 3.0 + 4.0)) + -1.0);
+              c = f;
+              f = g;
+              g = r * s + t * i;
+              i = t * s - r * i;
+              b = 0;
+              while (1) {
+                if ((b | 0) >= (p | 0)) break;
+                r = c + o;
+                u = +E(+r);
+                v = +F(+r);
+                x = +h[d >> 3];
+                z = x * u;
+                w = +h[j >> 3];
+                t = w * v;
+                u = w * u;
+                w = +h[k >> 3];
+                y = +h[l >> 3];
+                s = w * z + +h[a >> 3] - y * t;
+                t = y * z + w * t + +h[m >> 3];
+                x = -(v * x);
+                v = w * x - y * u;
+                u = y * x + w * u;
+                OT(q, e + i * n, f + g * n, s - v * n, t - u * n, s, t);
+                c = r;
+                e = s;
+                f = t;
+                g = u;
+                i = v;
+                b = (b + 1) | 0;
+              }
+              PT(q);
+              return q | 0;
+            }
+            function LT(a, b, c) {
+              a = a | 0;
+              b = +b;
+              c = +c;
+              var d = 0.0,
+                e = 0.0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0;
+              d = c + b;
+              i = +h[(a + 16) >> 3];
+              e = +h[(a + 24) >> 3] / i;
+              g = +E(+d);
+              f = +E(+(d * 2.0));
+              d = +E(+(d * 3.0));
+              a = e < 0.25 ? 10392 : 10648;
+              return +(
+                (((e * 0.001 + 4.98) * e + 0.207) / (e + 0.0067)) *
+                i *
+                +L(
+                  +(
+                    (((+h[(a + 32) >> 3] * e + +h[(a + 40) >> 3]) * e + +h[(a + 48) >> 3]) / (+h[(a + 56) >> 3] + e)) *
+                      g +
+                    ((+h[a >> 3] * e + +h[(a + 8) >> 3]) * e + +h[(a + 16) >> 3]) / (+h[(a + 24) >> 3] + e) +
+                    (((+h[(a + 64) >> 3] * e + +h[(a + 72) >> 3]) * e + +h[(a + 80) >> 3]) / (+h[(a + 88) >> 3] + e)) *
+                      f +
+                    (((+h[(a + 96) >> 3] * e + +h[(a + 104) >> 3]) * e + +h[(a + 112) >> 3]) /
+                      (+h[(a + 120) >> 3] + e)) *
+                      d +
+                    ((((+h[(a + 160) >> 3] * e + +h[(a + 168) >> 3]) * e + +h[(a + 176) >> 3]) /
+                      (+h[(a + 184) >> 3] + e)) *
+                      g +
+                      ((+h[(a + 128) >> 3] * e + +h[(a + 136) >> 3]) * e + +h[(a + 144) >> 3]) /
+                        (+h[(a + 152) >> 3] + e) +
+                      (((+h[(a + 192) >> 3] * e + +h[(a + 200) >> 3]) * e + +h[(a + 208) >> 3]) /
+                        (+h[(a + 216) >> 3] + e)) *
+                        f +
+                      (((+h[(a + 224) >> 3] * e + +h[(a + 232) >> 3]) * e + +h[(a + 240) >> 3]) /
+                        (+h[(a + 248) >> 3] + e)) *
+                        d) *
+                      (c - b)
+                  )
+                )
+              );
+            }
+            function MT(a, b, d) {
+              a = a | 0;
+              b = +b;
+              d = +d;
+              var e = 0;
+              c[47373] = 100;
+              e = JK(1600) | 0;
+              c[a >> 2] = e;
+              h[e >> 3] = b;
+              h[(e + 8) >> 3] = d;
+              c[(a + 4) >> 2] = 1;
+              return;
+            }
+            function NT(a, b, d) {
+              a = a | 0;
+              b = +b;
+              d = +d;
+              var e = 0,
+                f = 0;
+              f = c[a >> 2] | 0;
+              e = ((c[(a + 4) >> 2] | 0) + -1) | 0;
+              OT(a, +h[(f + (e << 4)) >> 3], +h[(f + (e << 4) + 8) >> 3], b, d, b, d);
+              return;
+            }
+            function OT(a, b, d, e, f, g, i) {
+              a = a | 0;
+              b = +b;
+              d = +d;
+              e = +e;
+              f = +f;
+              g = +g;
+              i = +i;
+              var j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              l = (a + 4) | 0;
+              j = c[l >> 2] | 0;
+              k = c[47373] | 0;
+              if (((j + 3) | 0) < (k | 0)) a = c[a >> 2] | 0;
+              else {
+                c[47373] = k << 1;
+                j = W1(c[a >> 2] | 0, k << 5) | 0;
+                c[a >> 2] = j;
+                a = j;
+                j = c[l >> 2] | 0;
+              }
+              h[(a + (j << 4)) >> 3] = b;
+              m = (j + 1) | 0;
+              h[(a + (j << 4) + 8) >> 3] = d;
+              h[(a + (m << 4)) >> 3] = e;
+              k = (j + 2) | 0;
+              h[(a + (m << 4) + 8) >> 3] = f;
+              h[(a + (k << 4)) >> 3] = g;
+              c[l >> 2] = j + 3;
+              h[(a + (k << 4) + 8) >> 3] = i;
+              return;
+            }
+            function PT(a) {
+              a = a | 0;
+              var b = 0;
+              b = c[a >> 2] | 0;
+              NT(a, +h[b >> 3], +h[(b + 8) >> 3]);
+              c[a >> 2] = W1(c[a >> 2] | 0, c[(a + 4) >> 2] << 4) | 0;
+              c[47373] = 0;
+              return;
+            }
+            function QT(a) {
+              a = a | 0;
+              var b = 0.0,
+                c = 0.0,
+                d = 0.0,
+                e = 0.0;
+              d = +h[(a + 16) >> 3];
+              b = +h[(a + 24) >> 3];
+              b = +C(+(d * d - b * b));
+              d = b * +h[(a + 40) >> 3];
+              b = b * +h[(a + 48) >> 3];
+              e = +h[a >> 3];
+              h[(a + 104) >> 3] = e - d;
+              c = +h[(a + 8) >> 3];
+              h[(a + 112) >> 3] = c - b;
+              h[(a + 120) >> 3] = e + d;
+              h[(a + 128) >> 3] = c + b;
+              return;
+            }
+            function RT(a) {
+              a = a | 0;
+              var b = 0.0,
+                c = 0.0,
+                d = 0.0,
+                e = 0.0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0;
+              d = +h[(a + 16) >> 3];
+              i = +h[(a + 56) >> 3];
+              j = +E(+i) * d;
+              b = +h[(a + 24) >> 3];
+              i = +F(+i) * b;
+              g = +h[(a + 64) >> 3];
+              d = +E(+g) * d;
+              b = +F(+g) * b;
+              g = +h[a >> 3];
+              c = +h[(a + 40) >> 3];
+              e = +h[(a + 48) >> 3];
+              h[(a + 72) >> 3] = c * j + g - e * i;
+              f = +h[(a + 8) >> 3];
+              h[(a + 80) >> 3] = e * j + f + c * i;
+              h[(a + 88) >> 3] = g + c * d - e * b;
+              h[(a + 96) >> 3] = f + e * d + c * b;
+              return;
+            }
+            function ST(a) {
+              a = a | 0;
+              var b = 0.0,
+                c = 0.0,
+                d = 0.0,
+                e = 0.0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                l = 0.0,
+                m = 0.0,
+                n = 0;
+              k = +h[(a + 24) >> 3];
+              l = +h[(a + 16) >> 3];
+              e = k / l;
+              m = +h[(a + 48) >> 3];
+              n = +B(+m) < 0.1;
+              j = +h[(a + 40) >> 3];
+              do
+                if (n) {
+                  b = m / j;
+                  c = +J(+(b * e));
+                  d = -c;
+                  if (j < 0.0) {
+                    b = +J(+(b / e));
+                    e = d;
+                    d = 3.141592653589793 - c;
+                    c = 4.71238898038469 - b;
+                    b = 1.5707963267948966 - b;
+                    break;
+                  } else {
+                    b = +J(+(b / e));
+                    e = -3.141592653589793 - c;
+                    c = 1.5707963267948966 - b;
+                    b = -1.5707963267948966 - b;
+                    break;
+                  }
+                } else {
+                  b = j / m;
+                  c = +J(+(b / e));
+                  d = c + 1.5707963267948966;
+                  if (m < 0.0) {
+                    b = +J(+(b * e));
+                    e = c + -1.5707963267948966;
+                    c = b + 3.141592653589793;
+                    break;
+                  } else {
+                    b = +J(+(b * e));
+                    e = d;
+                    d = c + 4.71238898038469;
+                    c = b;
+                    b = b + -3.141592653589793;
+                    break;
+                  }
+                }
+              while (0);
+              g = +h[(a + 56) >> 3];
+              e = e - +A(+((e - g) * 0.15915494309189535)) * 6.283185307179586;
+              b = b - +A(+((b - g) * 0.15915494309189535)) * 6.283185307179586;
+              f = d - +A(+((d - g) * 0.15915494309189535)) * 6.283185307179586;
+              g = c - +A(+((c - g) * 0.15915494309189535)) * 6.283185307179586;
+              i = +h[(a + 64) >> 3];
+              if (!(e <= i)) {
+                e = +h[(a + 72) >> 3];
+                c = +h[(a + 88) >> 3];
+                c = e < c ? e : c;
+              } else c = +E(+e) * l * j + +h[a >> 3] - k * +F(+e) * m;
+              h[(a + 136) >> 3] = c;
+              if (!(b <= i)) {
+                e = +h[(a + 80) >> 3];
+                d = +h[(a + 96) >> 3];
+                d = e < d ? e : d;
+              } else d = +E(+b) * l * m + +h[(a + 8) >> 3] + +F(+b) * k * j;
+              h[(a + 144) >> 3] = d;
+              if (!(f <= i)) {
+                f = +h[(a + 72) >> 3];
+                b = +h[(a + 88) >> 3];
+                b = f > b ? f : b;
+              } else b = +E(+f) * l * j + +h[a >> 3] - k * +F(+f) * m;
+              h[(a + 152) >> 3] = b - c;
+              if (!(g <= i)) {
+                m = +h[(a + 80) >> 3];
+                b = +h[(a + 96) >> 3];
+                b = m > b ? m : b;
+              } else b = +E(+g) * l * m + +h[(a + 8) >> 3] + +F(+g) * k * j;
+              h[(a + 160) >> 3] = b - d;
+              return;
+            }
+            function TT(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0.0,
+                m = 0,
+                n = 0;
+              n = l;
+              l = (l + 80) | 0;
+              m = n;
+              UT(b);
+              k = +h[(e + 56) >> 3];
+              g = +h[(e + 64) >> 3];
+              switch (a[(e + 80) >> 0] | 0) {
+                case 116: {
+                  g = (+h[(e + 48) >> 3] - +VT(d)) * 0.5 + g;
+                  f = 4;
+                  break;
+                }
+                case 98: {
+                  g = g - (+h[(e + 48) >> 3] - +VT(d)) * 0.5;
+                  f = 4;
+                  break;
+                }
+                default: {
+                }
+              }
+              if ((f | 0) == 4) g = g + -1.0;
+              h[m >> 3] = k;
+              h[(m + 8) >> 3] = g;
+              c[(m + 20) >> 2] = c[(e + 8) >> 2];
+              c[(m + 16) >> 2] = c[(e + 4) >> 2];
+              h[(m + 32) >> 3] = +h[(e + 16) >> 3];
+              j = (b + 16) | 0;
+              f = QA(c[((c[j >> 2] | 0) + 8) >> 2] | 0, 137297) | 0;
+              e = (m + 56) | 0;
+              c[e >> 2] = f;
+              i = (m + 60) | 0;
+              c[i >> 2] = c[((c[j >> 2] | 0) + 212) >> 2];
+              j = (m + 64) | 0;
+              a[j >> 0] = 0;
+              if (!((f | 0) != 0 ? (a[f >> 0] | 0) != 0 : 0)) c[e >> 2] = 137308;
+              if ((a[(d + 4) >> 0] | 0) == 1) {
+                e = c[d >> 2] | 0;
+                lS(b, c[((c[b >> 2] | 0) + 336) >> 2] | 0);
+                f = c[(e + 24) >> 2] | 0;
+                if (!f) hS(b, 137314);
+                else hS(b, f);
+                XT(b, e, m);
+                if (a[j >> 0] | 0) U1(c[i >> 2] | 0);
+              } else WT(b, c[d >> 2] | 0, m);
+              YT(b);
+              l = n;
+              return;
+            }
+            function UT(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              d = aI(a) | 0;
+              e = c[d >> 2] | 0;
+              a = c[(e + 4) >> 2] | 0;
+              c[(d + 4) >> 2] = a;
+              c[(d + 12) >> 2] = c[(e + 12) >> 2];
+              switch (a | 0) {
+                case 2: {
+                  a = (e + 8) | 0;
+                  f = 6;
+                  break;
+                }
+                case 0: {
+                  a = (e + 8) | 0;
+                  f = 6;
+                  break;
+                }
+                case 1: {
+                  a = (e + 8) | 0;
+                  f = 6;
+                  break;
+                }
+                case 3: {
+                  a = (e + 8) | 0;
+                  f = 6;
+                  break;
+                }
+                default: {
+                }
+              }
+              if ((f | 0) == 6) c[(d + 8) >> 2] = c[a >> 2];
+              c[(d + 208) >> 2] = c[(e + 208) >> 2];
+              c[(d + 228) >> 2] = c[(e + 228) >> 2];
+              c[(d + 244) >> 2] = c[(e + 244) >> 2];
+              f = (d + 260) | 0;
+              b[f >> 1] = (b[f >> 1] & -2) | (b[(e + 260) >> 1] & 1);
+              return;
+            }
+            function VT(b) {
+              b = b | 0;
+              var d = 0.0,
+                e = 0,
+                f = 0;
+              switch (a[(b + 4) >> 0] | 0) {
+                case 1: {
+                  e = c[b >> 2] | 0;
+                  b = (e + 72) | 0;
+                  e = (e + 56) | 0;
+                  f = 5;
+                  break;
+                }
+                case 3: {
+                  e = c[b >> 2] | 0;
+                  b = (e + 24) | 0;
+                  e = (e + 8) | 0;
+                  f = 5;
+                  break;
+                }
+                case 2: {
+                  e = c[b >> 2] | 0;
+                  b = (e + 32) | 0;
+                  e = (e + 16) | 0;
+                  f = 5;
+                  break;
+                }
+                default:
+                  d = 0.0;
+              }
+              if ((f | 0) == 5) d = +h[b >> 3] - +h[e >> 3];
+              return +d;
+            }
+            function WT(d, e, f) {
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0.0,
+                q = 0,
+                r = 0,
+                s = 0;
+              n = l;
+              l = (l + 96) | 0;
+              j = (n + 64) | 0;
+              i = (n + 32) | 0;
+              g = (n + 16) | 0;
+              k = n;
+              m = b[(e + 4) >> 1] | 0;
+              if ((m << 16) >> 16 >= 1) {
+                r = (e + 8) | 0;
+                p = +h[(e + 24) >> 3];
+                o = +h[r >> 3];
+                h[k >> 3] = (o + p) * 0.5 + +h[f >> 3];
+                h[(k + 8) >> 3] = (+h[(e + 16) >> 3] + +h[(e + 32) >> 3]) * 0.5 + +h[(f + 8) >> 3];
+                q = c[e >> 2] | 0;
+                s = (f + 16) | 0;
+                f = a[(e + 6) >> 0] | 0;
+                c[g >> 2] = c[k >> 2];
+                c[(g + 4) >> 2] = c[(k + 4) >> 2];
+                c[(g + 8) >> 2] = c[(k + 8) >> 2];
+                c[(g + 12) >> 2] = c[(k + 12) >> 2];
+                c[i >> 2] = c[s >> 2];
+                c[(i + 4) >> 2] = c[(s + 4) >> 2];
+                c[(i + 8) >> 2] = c[(s + 8) >> 2];
+                c[(i + 12) >> 2] = c[(s + 12) >> 2];
+                c[(i + 16) >> 2] = c[(s + 16) >> 2];
+                c[(i + 20) >> 2] = c[(s + 20) >> 2];
+                c[(i + 24) >> 2] = c[(s + 24) >> 2];
+                c[(i + 28) >> 2] = c[(s + 28) >> 2];
+                c[j >> 2] = c[r >> 2];
+                c[(j + 4) >> 2] = c[(r + 4) >> 2];
+                c[(j + 8) >> 2] = c[(r + 8) >> 2];
+                c[(j + 12) >> 2] = c[(r + 12) >> 2];
+                c[(j + 16) >> 2] = c[(r + 16) >> 2];
+                c[(j + 20) >> 2] = c[(r + 20) >> 2];
+                c[(j + 24) >> 2] = c[(r + 24) >> 2];
+                c[(j + 28) >> 2] = c[(r + 28) >> 2];
+                iU(d, (m << 16) >> 16, q, g, (p - o) * 0.5, i, j, f);
+              }
+              l = n;
+              return;
+            }
+            function XT(e, f, g) {
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0.0,
+                n = 0.0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0;
+              y = l;
+              l = (l + 176) | 0;
+              t = (y + 96) | 0;
+              v = (y + 64) | 0;
+              w = (y + 136) | 0;
+              p = y;
+              q = (y + 128) | 0;
+              r = (f + 48) | 0;
+              c[v >> 2] = c[r >> 2];
+              c[(v + 4) >> 2] = c[(r + 4) >> 2];
+              c[(v + 8) >> 2] = c[(r + 8) >> 2];
+              c[(v + 12) >> 2] = c[(r + 12) >> 2];
+              c[(v + 16) >> 2] = c[(r + 16) >> 2];
+              c[(v + 20) >> 2] = c[(r + 20) >> 2];
+              c[(v + 24) >> 2] = c[(r + 24) >> 2];
+              c[(v + 28) >> 2] = c[(r + 28) >> 2];
+              m = +h[g >> 3];
+              n = +h[(g + 8) >> 3];
+              r = (f + 84) | 0;
+              i = c[r >> 2] | 0;
+              if (!(c[f >> 2] | 0)) x = (c[(f + 8) >> 2] | 0) != 0;
+              else x = 1;
+              u = (f + 108) | 0;
+              j = c[u >> 2] | 0;
+              if (j | 0) ZT(g, j, 186544);
+              h[v >> 3] = +h[v >> 3] + m;
+              s = (v + 16) | 0;
+              h[s >> 3] = +h[s >> 3] + m;
+              s = (v + 8) | 0;
+              h[s >> 3] = +h[s >> 3] + n;
+              s = (v + 24) | 0;
+              h[s >> 3] = +h[s >> 3] + n;
+              if (x ? ((c[(e + 152) >> 2] & 4) | 0) == 0 : 0) {
+                c[t >> 2] = c[v >> 2];
+                c[(t + 4) >> 2] = c[(v + 4) >> 2];
+                c[(t + 8) >> 2] = c[(v + 8) >> 2];
+                c[(t + 12) >> 2] = c[(v + 12) >> 2];
+                c[(t + 16) >> 2] = c[(v + 16) >> 2];
+                c[(t + 20) >> 2] = c[(v + 20) >> 2];
+                c[(t + 24) >> 2] = c[(v + 24) >> 2];
+                c[(t + 28) >> 2] = c[(v + 28) >> 2];
+                s = _T(e, g, f, t, w) | 0;
+              } else s = 0;
+              o = (f + 42) | 0;
+              j = b[o >> 1] | 0;
+              if (!(j & 32)) {
+                k = c[(f + 20) >> 2] | 0;
+                if (k) {
+                  j = $T(e, k, c[(f + 28) >> 2] | 0, j & 65535, q) | 0;
+                  if (!(b[o >> 1] & 4)) {
+                    c[t >> 2] = c[v >> 2];
+                    c[(t + 4) >> 2] = c[(v + 4) >> 2];
+                    c[(t + 8) >> 2] = c[(v + 8) >> 2];
+                    c[(t + 12) >> 2] = c[(v + 12) >> 2];
+                    c[(t + 16) >> 2] = c[(v + 16) >> 2];
+                    c[(t + 20) >> 2] = c[(v + 20) >> 2];
+                    c[(t + 24) >> 2] = c[(v + 24) >> 2];
+                    c[(t + 28) >> 2] = c[(v + 28) >> 2];
+                    oS(e, t, j);
+                  } else {
+                    o = d[(f + 33) >> 0] | 0;
+                    c[t >> 2] = c[v >> 2];
+                    c[(t + 4) >> 2] = c[(v + 4) >> 2];
+                    c[(t + 8) >> 2] = c[(v + 8) >> 2];
+                    c[(t + 12) >> 2] = c[(v + 12) >> 2];
+                    c[(t + 16) >> 2] = c[(v + 16) >> 2];
+                    c[(t + 20) >> 2] = c[(v + 20) >> 2];
+                    c[(t + 24) >> 2] = c[(v + 24) >> 2];
+                    c[(t + 28) >> 2] = c[(v + 28) >> 2];
+                    TM(e, aU(p, t, o) | 0, 4, 4, j);
+                  }
+                  U1(c[q >> 2] | 0);
+                }
+                while (1) {
+                  j = c[i >> 2] | 0;
+                  if (!j) break;
+                  bU(e, j, g);
+                  i = (i + 4) | 0;
+                }
+                i = c[r >> 2] | 0;
+                uS(e, 1.0);
+                j = (f + 24) | 0;
+                while (1) {
+                  k = (i + 4) | 0;
+                  i = c[i >> 2] | 0;
+                  if (!i) break;
+                  if (!(a[(i + 100) >> 0] | 0)) {
+                    i = k;
+                    continue;
+                  }
+                  cU(e, i, g, c[j >> 2] | 0, c[k >> 2] | 0);
+                  i = k;
+                }
+                if (a[(f + 33) >> 0] | 0) {
+                  c[t >> 2] = c[v >> 2];
+                  c[(t + 4) >> 2] = c[(v + 4) >> 2];
+                  c[(t + 8) >> 2] = c[(v + 8) >> 2];
+                  c[(t + 12) >> 2] = c[(v + 12) >> 2];
+                  c[(t + 16) >> 2] = c[(v + 16) >> 2];
+                  c[(t + 20) >> 2] = c[(v + 20) >> 2];
+                  c[(t + 24) >> 2] = c[(v + 24) >> 2];
+                  c[(t + 28) >> 2] = c[(v + 28) >> 2];
+                  dU(e, f, t);
+                }
+              }
+              if (s | 0) eU(e, w);
+              if (
+                (x ? (c[(e + 152) >> 2] & 4) | 0 : 0)
+                  ? ((c[t >> 2] = c[v >> 2]),
+                    (c[(t + 4) >> 2] = c[(v + 4) >> 2]),
+                    (c[(t + 8) >> 2] = c[(v + 8) >> 2]),
+                    (c[(t + 12) >> 2] = c[(v + 12) >> 2]),
+                    (c[(t + 16) >> 2] = c[(v + 16) >> 2]),
+                    (c[(t + 20) >> 2] = c[(v + 20) >> 2]),
+                    (c[(t + 24) >> 2] = c[(v + 24) >> 2]),
+                    (c[(t + 28) >> 2] = c[(v + 28) >> 2]),
+                    _T(e, g, f, t, w) | 0)
+                  : 0
+              )
+                eU(e, w);
+              if (c[u >> 2] | 0) fU(g, 186544);
+              l = y;
+              return;
+            }
+            function YT(a) {
+              a = a | 0;
+              var b = 0;
+              b = c[(a + 16) >> 2] | 0;
+              c[(b + 208) >> 2] = 0;
+              c[(b + 228) >> 2] = 0;
+              c[(b + 244) >> 2] = 0;
+              c[(b + 212) >> 2] = 0;
+              bI(a);
+              return;
+            }
+            function ZT(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0,
+                g = 0,
+                i = 0;
+              i = (a + 16) | 0;
+              f = c[i >> 2] | 0;
+              if (f | 0) {
+                if (!(c[b >> 2] | 0)) {
+                  f = 0;
+                  g = d;
+                } else {
+                  c[d >> 2] = f;
+                  f = c[b >> 2] | 0;
+                  g = i;
+                }
+                c[g >> 2] = f;
+              }
+              f = c[(a + 20) >> 2] | 0;
+              if (f | 0) {
+                g = (b + 4) | 0;
+                if (!(c[g >> 2] | 0)) {
+                  f = 0;
+                  g = d;
+                } else {
+                  c[(d + 4) >> 2] = f;
+                  f = c[g >> 2] | 0;
+                  g = i;
+                }
+                c[(g + 4) >> 2] = f;
+              }
+              e = +h[(a + 32) >> 3];
+              if (e >= 0.0) {
+                f = (b + 16) | 0;
+                if (!(+h[f >> 3] >= 0.0)) e = -1.0;
+                else {
+                  h[(d + 16) >> 3] = e;
+                  e = +h[f >> 3];
+                  d = i;
+                }
+                h[(d + 16) >> 3] = e;
+              }
+              return;
+            }
+            function _T(d, e, f, g, h) {
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0;
+              u = l;
+              l = (l + 224) | 0;
+              n = (u + 8) | 0;
+              k = u;
+              t = (u + 40) | 0;
+              j = (u + 184) | 0;
+              i = (u + 56) | 0;
+              m = c[(d + 16) >> 2] | 0;
+              o = (m + 208) | 0;
+              c[h >> 2] = c[o >> 2];
+              p = (m + 228) | 0;
+              c[(h + 4) >> 2] = c[p >> 2];
+              q = (m + 244) | 0;
+              c[(h + 8) >> 2] = c[q >> 2];
+              r = (m + 212) | 0;
+              c[(h + 12) >> 2] = c[r >> 2];
+              s = (m + 260) | 0;
+              a[(h + 16) >> 0] = ((((b[s >> 1] << 15) & 65535) << 16) >> 16) >> 15;
+              h = c[(f + 16) >> 2] | 0;
+              if ((h | 0) != 0 ? (a[h >> 0] | 0) != 0 : 0) i = 0;
+              else {
+                kA(t, 128, i);
+                i = (e + 60) | 0;
+                h = c[i >> 2] | 0;
+                if (!h) {
+                  h = D4(dI(d, c[(m + 8) >> 2] | 0, t) | 0) | 0;
+                  c[i >> 2] = h;
+                  a[(e + 64) >> 0] = 1;
+                }
+                nA(t, h) | 0;
+                i = c[47374] | 0;
+                c[47374] = i + 1;
+                c[k >> 2] = i;
+                m4(j, 137391, k) | 0;
+                nA(t, j) | 0;
+                i = (t + 4) | 0;
+                h = c[i >> 2] | 0;
+                if (h >>> 0 >= (c[(t + 8) >> 2] | 0) >>> 0) {
+                  lA(t, 1) | 0;
+                  h = c[i >> 2] | 0;
+                }
+                a[h >> 0] = 0;
+                h = c[t >> 2] | 0;
+                c[i >> 2] = h;
+                i = 1;
+              }
+              h = cI(d, 0, c[f >> 2] | 0, c[(f + 12) >> 2] | 0, c[(f + 8) >> 2] | 0, h, c[(m + 8) >> 2] | 0) | 0;
+              if (i) oA(t);
+              do
+                if (h | 0) {
+                  if ((c[o >> 2] | 0) == 0 ? (b[s >> 1] & 1) == 0 : 0) break;
+                  c[n >> 2] = c[g >> 2];
+                  c[(n + 4) >> 2] = c[(g + 4) >> 2];
+                  c[(n + 8) >> 2] = c[(g + 8) >> 2];
+                  c[(n + 12) >> 2] = c[(g + 12) >> 2];
+                  c[(n + 16) >> 2] = c[(g + 16) >> 2];
+                  c[(n + 20) >> 2] = c[(g + 20) >> 2];
+                  c[(n + 24) >> 2] = c[(g + 24) >> 2];
+                  c[(n + 28) >> 2] = c[(g + 28) >> 2];
+                  kI(d, n);
+                  cS(d, c[o >> 2] | 0, c[p >> 2] | 0, c[q >> 2] | 0, c[r >> 2] | 0);
+                }
+              while (0);
+              l = u;
+              return h | 0;
+            }
+            function $T(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var h = 0.0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 16) | 0;
+              i = j;
+              if (!(((JJ(b, f, i) | 0) << 24) >> 24)) {
+                jS(a, b);
+                b = 1;
+              } else {
+                jS(a, c[f >> 2] | 0);
+                b = c[(f + 4) >> 2] | 0;
+                h = +g[i >> 2];
+                if (!b) kS(a, 137314, d, h);
+                else kS(a, b, d, h);
+                b = ((e >>> 1) & 1) | 2;
+              }
+              hS(a, 137379);
+              l = j;
+              return b | 0;
+            }
+            function aU(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0;
+              c[a >> 2] = c[b >> 2];
+              c[(a + 4) >> 2] = c[(b + 4) >> 2];
+              c[(a + 8) >> 2] = c[(b + 8) >> 2];
+              c[(a + 12) >> 2] = c[(b + 12) >> 2];
+              e = (a + 32) | 0;
+              b = (b + 16) | 0;
+              c[e >> 2] = c[b >> 2];
+              c[(e + 4) >> 2] = c[(b + 4) >> 2];
+              c[(e + 8) >> 2] = c[(b + 8) >> 2];
+              c[(e + 12) >> 2] = c[(b + 12) >> 2];
+              if ((d | 0) > 1) {
+                j = +(d | 0) * 0.5;
+                i = +h[a >> 3] + j;
+                h[a >> 3] = i;
+                d = (a + 8) | 0;
+                g = +h[d >> 3] + j;
+                h[d >> 3] = g;
+                f = +h[e >> 3] - j;
+                h[e >> 3] = f;
+                e = (a + 40) | 0;
+                j = +h[e >> 3] - j;
+                h[e >> 3] = j;
+              } else {
+                f = +h[e >> 3];
+                g = +h[(a + 8) >> 3];
+                i = +h[a >> 3];
+                j = +h[(a + 40) >> 3];
+              }
+              h[(a + 16) >> 3] = f;
+              h[(a + 24) >> 3] = g;
+              h[(a + 48) >> 3] = i;
+              h[(a + 56) >> 3] = j;
+              return a | 0;
+            }
+            function bU(e, f, g) {
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0.0,
+                k = 0.0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0;
+              v = l;
+              l = (l + 176) | 0;
+              r = (v + 96) | 0;
+              s = (v + 136) | 0;
+              t = (v + 64) | 0;
+              p = v;
+              q = (v + 128) | 0;
+              u = (f + 48) | 0;
+              c[t >> 2] = c[u >> 2];
+              c[(t + 4) >> 2] = c[(u + 4) >> 2];
+              c[(t + 8) >> 2] = c[(u + 8) >> 2];
+              c[(t + 12) >> 2] = c[(u + 12) >> 2];
+              c[(t + 16) >> 2] = c[(u + 16) >> 2];
+              c[(t + 20) >> 2] = c[(u + 20) >> 2];
+              c[(t + 24) >> 2] = c[(u + 24) >> 2];
+              c[(t + 28) >> 2] = c[(u + 28) >> 2];
+              j = +h[g >> 3];
+              k = +h[(g + 8) >> 3];
+              if (!(c[f >> 2] | 0)) u = (c[(f + 8) >> 2] | 0) != 0;
+              else u = 1;
+              h[t >> 3] = +h[t >> 3] + j;
+              o = (t + 16) | 0;
+              h[o >> 3] = +h[o >> 3] + j;
+              o = (t + 8) | 0;
+              h[o >> 3] = +h[o >> 3] + k;
+              o = (t + 24) | 0;
+              h[o >> 3] = +h[o >> 3] + k;
+              if (u ? ((c[(e + 152) >> 2] & 4) | 0) == 0 : 0) {
+                c[r >> 2] = c[t >> 2];
+                c[(r + 4) >> 2] = c[(t + 4) >> 2];
+                c[(r + 8) >> 2] = c[(t + 8) >> 2];
+                c[(r + 12) >> 2] = c[(t + 12) >> 2];
+                c[(r + 16) >> 2] = c[(t + 16) >> 2];
+                c[(r + 20) >> 2] = c[(t + 20) >> 2];
+                c[(r + 24) >> 2] = c[(t + 24) >> 2];
+                c[(r + 28) >> 2] = c[(t + 28) >> 2];
+                o = _T(e, g, f, r, s) | 0;
+              } else o = 0;
+              n = (f + 42) | 0;
+              i = b[n >> 1] | 0;
+              a: do
+                if (!(i & 32)) {
+                  m = c[(f + 20) >> 2] | 0;
+                  if (m | 0) {
+                    i = $T(e, m, c[(f + 28) >> 2] | 0, i & 65535, q) | 0;
+                    if (!(b[n >> 1] & 4)) {
+                      c[r >> 2] = c[t >> 2];
+                      c[(r + 4) >> 2] = c[(t + 4) >> 2];
+                      c[(r + 8) >> 2] = c[(t + 8) >> 2];
+                      c[(r + 12) >> 2] = c[(t + 12) >> 2];
+                      c[(r + 16) >> 2] = c[(t + 16) >> 2];
+                      c[(r + 20) >> 2] = c[(t + 20) >> 2];
+                      c[(r + 24) >> 2] = c[(t + 24) >> 2];
+                      c[(r + 28) >> 2] = c[(t + 28) >> 2];
+                      oS(e, r, i);
+                    } else {
+                      n = d[(f + 33) >> 0] | 0;
+                      c[r >> 2] = c[t >> 2];
+                      c[(r + 4) >> 2] = c[(t + 4) >> 2];
+                      c[(r + 8) >> 2] = c[(t + 8) >> 2];
+                      c[(r + 12) >> 2] = c[(t + 12) >> 2];
+                      c[(r + 16) >> 2] = c[(t + 16) >> 2];
+                      c[(r + 20) >> 2] = c[(t + 20) >> 2];
+                      c[(r + 24) >> 2] = c[(t + 24) >> 2];
+                      c[(r + 28) >> 2] = c[(t + 28) >> 2];
+                      TM(e, aU(p, r, n) | 0, 4, 4, i);
+                    }
+                    U1(c[q >> 2] | 0);
+                  }
+                  if (a[(f + 33) >> 0] | 0) {
+                    c[r >> 2] = c[t >> 2];
+                    c[(r + 4) >> 2] = c[(t + 4) >> 2];
+                    c[(r + 8) >> 2] = c[(t + 8) >> 2];
+                    c[(r + 12) >> 2] = c[(t + 12) >> 2];
+                    c[(r + 16) >> 2] = c[(t + 16) >> 2];
+                    c[(r + 20) >> 2] = c[(t + 20) >> 2];
+                    c[(r + 24) >> 2] = c[(t + 24) >> 2];
+                    c[(r + 28) >> 2] = c[(t + 28) >> 2];
+                    dU(e, f, r);
+                  }
+                  i = (f + 88) | 0;
+                  switch (a[(f + 92) >> 0] | 0) {
+                    case 1: {
+                      XT(e, c[i >> 2] | 0, g);
+                      break a;
+                    }
+                    case 3: {
+                      hU(e, c[i >> 2] | 0, g);
+                      break a;
+                    }
+                    default: {
+                      WT(e, c[i >> 2] | 0, g);
+                      break a;
+                    }
+                  }
+                }
+              while (0);
+              if (o | 0) eU(e, s);
+              if (
+                (u ? (c[(e + 152) >> 2] & 4) | 0 : 0)
+                  ? ((c[r >> 2] = c[t >> 2]),
+                    (c[(r + 4) >> 2] = c[(t + 4) >> 2]),
+                    (c[(r + 8) >> 2] = c[(t + 8) >> 2]),
+                    (c[(r + 12) >> 2] = c[(t + 12) >> 2]),
+                    (c[(r + 16) >> 2] = c[(t + 16) >> 2]),
+                    (c[(r + 20) >> 2] = c[(t + 20) >> 2]),
+                    (c[(r + 24) >> 2] = c[(t + 24) >> 2]),
+                    (c[(r + 28) >> 2] = c[(t + 28) >> 2]),
+                    _T(e, g, f, r, s) | 0)
+                  : 0
+              )
+                eU(e, s);
+              l = v;
+              return;
+            }
+            function cU(f, g, i, j, k) {
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              j = j | 0;
+              k = k | 0;
+              var m = 0.0,
+                n = 0,
+                o = 0.0,
+                p = 0.0,
+                q = 0,
+                r = 0.0,
+                s = 0.0,
+                t = 0.0,
+                u = 0.0,
+                v = 0,
+                w = 0,
+                x = 0.0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0;
+              A = l;
+              l = (l + 32) | 0;
+              y = (A + 16) | 0;
+              z = A;
+              r = +h[i >> 3];
+              x = +h[(i + 8) >> 3];
+              q = (j | 0) == 0 ? 137314 : j;
+              jS(f, q);
+              hS(f, q);
+              t = +h[(g + 48) >> 3];
+              o = +h[(g + 56) >> 3];
+              u = +h[(g + 64) >> 3];
+              p = +h[(g + 72) >> 3];
+              s = t + r;
+              r = u + r;
+              x = o + x;
+              q = (g + 100) | 0;
+              i = a[q >> 0] | 0;
+              if (
+                (i & 1) != 0
+                  ? ((n = c[(g + 96) >> 2] | 0),
+                    (((e[(g + 80) >> 1] | 0) + (e[(g + 84) >> 1] | 0)) | 0) < (c[(n + 104) >> 2] | 0))
+                  : 0
+              ) {
+                i = b[(g + 86) >> 1] | 0;
+                do
+                  if ((i << 16) >> 16)
+                    if ((((e[(g + 82) >> 1] | 0) + (i & 65535)) | 0) == (c[(n + 100) >> 2] | 0)) {
+                      B = a[(n + 32) >> 0] | 0;
+                      C = (((B << 24) >> 24) / 2) | 0;
+                      j = (((C << 24) >> 24) + (d[(n + 33) >> 0] | 0)) | 0;
+                      i = j;
+                      j = j & 255;
+                      m = x - +((C << 24) >> 24);
+                      n = B;
+                      break;
+                    } else {
+                      n = a[(n + 32) >> 0] | 0;
+                      i = 0;
+                      j = (((((n << 24) >> 24) / 2) | 0) << 24) >> 24;
+                      m = x;
+                      break;
+                    }
+                  else {
+                    C = a[(n + 32) >> 0] | 0;
+                    j = (((((C << 24) >> 24) / 2) | 0) << 24) >> 24;
+                    i = (j + (d[(n + 33) >> 0] | 0)) | 0;
+                    m = x;
+                    n = C;
+                  }
+                while (0);
+                h[(z + 8) >> 3] = m - +(j | 0);
+                h[z >> 3] = r + +((((((n << 24) >> 24) / 2) | 0) << 24) >> 24);
+                c[y >> 2] = c[z >> 2];
+                c[(y + 4) >> 2] = c[(z + 4) >> 2];
+                c[(y + 8) >> 2] = c[(z + 8) >> 2];
+                c[(y + 12) >> 2] = c[(z + 12) >> 2];
+                gU(f, y, 0.0, p - o + +((i & 255) | 0) + +((n << 24) >> 24));
+                i = a[q >> 0] | 0;
+              }
+              if (
+                i & 2
+                  ? ((v = b[(g + 86) >> 1] | 0),
+                    (w = c[(g + 96) >> 2] | 0),
+                    (((e[(g + 82) >> 1] | 0) + (v & 65535)) | 0) < (c[(w + 100) >> 2] | 0))
+                  : 0
+              ) {
+                i = b[(g + 84) >> 1] | 0;
+                do
+                  if (!((i << 16) >> 16)) {
+                    i = a[(w + 32) >> 0] | 0;
+                    C = (((i << 24) >> 24) / 2) | 0;
+                    n = (((C << 24) >> 24) + (d[(w + 33) >> 0] | 0)) | 0;
+                    j = n & 255;
+                    n = n & 255;
+                    m = +((C << 24) >> 24);
+                    h[z >> 3] = s - m - +(n | 0);
+                    if ((c[(w + 104) >> 2] | 0) == (e[(g + 80) >> 1] | 0)) {
+                      j = (n << 1) & 255;
+                      break;
+                    }
+                    if ((k | 0) != 0 ? (b[(k + 86) >> 1] | 0) != (v << 16) >> 16 : 0)
+                      j = ~~(+(j & 255) - u + +h[(w + 64) >> 3] - m) & 255;
+                  } else {
+                    if ((((e[(g + 80) >> 1] | 0) + (i & 65535)) | 0) == (c[(w + 104) >> 2] | 0)) {
+                      i = a[(w + 32) >> 0] | 0;
+                      C = (((i << 24) >> 24) / 2) | 0;
+                      j = ((C & 255) + (d[(w + 33) >> 0] | 0)) & 255;
+                      h[z >> 3] = s - +((C << 24) >> 24);
+                      break;
+                    }
+                    i = a[(w + 32) >> 0] | 0;
+                    m = +((((((i << 24) >> 24) / 2) | 0) << 24) >> 24);
+                    h[z >> 3] = s - m;
+                    if ((k | 0) != 0 ? (b[(k + 86) >> 1] | 0) != (v << 16) >> 16 : 0)
+                      j = ~~(+h[(w + 64) >> 3] - u - m) & 255;
+                    else j = 0;
+                  }
+                while (0);
+                h[(z + 8) >> 3] = x - +((((((i << 24) >> 24) / 2) | 0) << 24) >> 24);
+                c[y >> 2] = c[z >> 2];
+                c[(y + 4) >> 2] = c[(z + 4) >> 2];
+                c[(y + 8) >> 2] = c[(z + 8) >> 2];
+                c[(y + 12) >> 2] = c[(z + 12) >> 2];
+                gU(f, y, u - t + +(j & 255) + +((i << 24) >> 24), 0.0);
+              }
+              l = A;
+              return;
+            }
+            function dU(e, f, g) {
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0.0;
+              p = l;
+              l = (l + 160) | 0;
+              o = (p + 112) | 0;
+              n = p;
+              j = (p + 144) | 0;
+              m = c[(f + 24) >> 2] | 0;
+              hS(e, (m | 0) == 0 ? 137314 : m);
+              m = (f + 42) | 0;
+              i = b[m >> 1] | 0;
+              if (!(i & 384)) lS(e, c[((c[e >> 2] | 0) + 336) >> 2] | 0);
+              else {
+                c[(j + 4) >> 2] = 0;
+                c[j >> 2] = 0;
+                i = i & 65535;
+                if (!(i & 256)) {
+                  if ((i & 128) | 0) {
+                    i = 137320;
+                    k = 4;
+                  }
+                } else {
+                  i = 137327;
+                  k = 4;
+                }
+                if ((k | 0) == 4) c[j >> 2] = i;
+                lS(e, j);
+              }
+              k = (f + 33) | 0;
+              uS(e, +(d[k >> 0] | 0));
+              a: do
+                if (!(b[m >> 1] & 4)) {
+                  i = b[(f + 36) >> 1] & 15360;
+                  if (!((i << 16) >> 16)) {
+                    i = a[k >> 0] | 0;
+                    if ((i & 255) > 1) {
+                      q = +(i & 255) * 0.5;
+                      h[g >> 3] = +h[g >> 3] + q;
+                      n = (g + 8) | 0;
+                      h[n >> 3] = +h[n >> 3] + q;
+                      n = (g + 16) | 0;
+                      h[n >> 3] = +h[n >> 3] - q;
+                      n = (g + 24) | 0;
+                      h[n >> 3] = +h[n >> 3] - q;
+                    }
+                    c[o >> 2] = c[g >> 2];
+                    c[(o + 4) >> 2] = c[(g + 4) >> 2];
+                    c[(o + 8) >> 2] = c[(g + 8) >> 2];
+                    c[(o + 12) >> 2] = c[(g + 12) >> 2];
+                    c[(o + 16) >> 2] = c[(g + 16) >> 2];
+                    c[(o + 20) >> 2] = c[(g + 20) >> 2];
+                    c[(o + 24) >> 2] = c[(g + 24) >> 2];
+                    c[(o + 28) >> 2] = c[(g + 28) >> 2];
+                    oS(e, o, 0);
+                    break;
+                  }
+                  j = (n + 16) | 0;
+                  m = d[k >> 0] | 0;
+                  c[o >> 2] = c[g >> 2];
+                  c[(o + 4) >> 2] = c[(g + 4) >> 2];
+                  c[(o + 8) >> 2] = c[(g + 8) >> 2];
+                  c[(o + 12) >> 2] = c[(g + 12) >> 2];
+                  c[(o + 16) >> 2] = c[(g + 16) >> 2];
+                  c[(o + 20) >> 2] = c[(g + 20) >> 2];
+                  c[(o + 24) >> 2] = c[(g + 24) >> 2];
+                  c[(o + 28) >> 2] = c[(g + 28) >> 2];
+                  aU(j, o, m) | 0;
+                  do
+                    switch ((((((i & 65535) + -1024) | 0) >>> 10) & 4194303) | 0) {
+                      case 7: {
+                        qS(e, j, 2);
+                        break a;
+                      }
+                      case 3: {
+                        qS(e, (n + 32) | 0, 2);
+                        break a;
+                      }
+                      case 1: {
+                        qS(e, (n + 48) | 0, 2);
+                        break a;
+                      }
+                      case 0: {
+                        g = (n + 64) | 0;
+                        c[n >> 2] = c[g >> 2];
+                        c[(n + 4) >> 2] = c[(g + 4) >> 2];
+                        c[(n + 8) >> 2] = c[(g + 8) >> 2];
+                        c[(n + 12) >> 2] = c[(g + 12) >> 2];
+                        qS(e, n, 2);
+                        break a;
+                      }
+                      case 11: {
+                        qS(e, j, 3);
+                        break a;
+                      }
+                      case 5: {
+                        qS(e, (n + 32) | 0, 3);
+                        break a;
+                      }
+                      case 2: {
+                        g = (n + 80) | 0;
+                        c[g >> 2] = c[j >> 2];
+                        c[(g + 4) >> 2] = c[(j + 4) >> 2];
+                        c[(g + 8) >> 2] = c[(j + 8) >> 2];
+                        c[(g + 12) >> 2] = c[(j + 12) >> 2];
+                        qS(e, (n + 48) | 0, 3);
+                        break a;
+                      }
+                      case 8: {
+                        g = (n + 64) | 0;
+                        c[n >> 2] = c[g >> 2];
+                        c[(n + 4) >> 2] = c[(g + 4) >> 2];
+                        c[(n + 8) >> 2] = c[(g + 8) >> 2];
+                        c[(n + 12) >> 2] = c[(g + 12) >> 2];
+                        qS(e, n, 3);
+                        break a;
+                      }
+                      case 13: {
+                        qS(e, j, 4);
+                        break a;
+                      }
+                      case 6: {
+                        g = (n + 80) | 0;
+                        c[g >> 2] = c[j >> 2];
+                        c[(g + 4) >> 2] = c[(j + 4) >> 2];
+                        c[(g + 8) >> 2] = c[(j + 8) >> 2];
+                        c[(g + 12) >> 2] = c[(j + 12) >> 2];
+                        qS(e, (n + 32) | 0, 4);
+                        break a;
+                      }
+                      case 10: {
+                        g = (n + 80) | 0;
+                        c[g >> 2] = c[j >> 2];
+                        c[(g + 4) >> 2] = c[(j + 4) >> 2];
+                        c[(g + 8) >> 2] = c[(j + 8) >> 2];
+                        c[(g + 12) >> 2] = c[(j + 12) >> 2];
+                        g = (n + 96) | 0;
+                        o = (n + 32) | 0;
+                        c[g >> 2] = c[o >> 2];
+                        c[(g + 4) >> 2] = c[(o + 4) >> 2];
+                        c[(g + 8) >> 2] = c[(o + 8) >> 2];
+                        c[(g + 12) >> 2] = c[(o + 12) >> 2];
+                        qS(e, (n + 48) | 0, 4);
+                        break a;
+                      }
+                      case 12: {
+                        g = (n + 64) | 0;
+                        c[n >> 2] = c[g >> 2];
+                        c[(n + 4) >> 2] = c[(g + 4) >> 2];
+                        c[(n + 8) >> 2] = c[(g + 8) >> 2];
+                        c[(n + 12) >> 2] = c[(g + 12) >> 2];
+                        qS(e, n, 4);
+                        break a;
+                      }
+                      case 9: {
+                        qS(e, j, 2);
+                        qS(e, (n + 48) | 0, 2);
+                        break a;
+                      }
+                      case 4: {
+                        g = (n + 64) | 0;
+                        c[n >> 2] = c[g >> 2];
+                        c[(n + 4) >> 2] = c[(g + 4) >> 2];
+                        c[(n + 8) >> 2] = c[(g + 8) >> 2];
+                        c[(n + 12) >> 2] = c[(g + 12) >> 2];
+                        qS(e, n, 2);
+                        qS(e, (n + 32) | 0, 2);
+                        break a;
+                      }
+                      default:
+                        break a;
+                    }
+                  while (0);
+                } else {
+                  m = d[k >> 0] | 0;
+                  c[o >> 2] = c[g >> 2];
+                  c[(o + 4) >> 2] = c[(g + 4) >> 2];
+                  c[(o + 8) >> 2] = c[(g + 8) >> 2];
+                  c[(o + 12) >> 2] = c[(g + 12) >> 2];
+                  c[(o + 16) >> 2] = c[(g + 16) >> 2];
+                  c[(o + 20) >> 2] = c[(g + 20) >> 2];
+                  c[(o + 24) >> 2] = c[(g + 24) >> 2];
+                  c[(o + 28) >> 2] = c[(g + 28) >> 2];
+                  TM(e, aU(n, o, m) | 0, 4, 4, 0);
+                }
+              while (0);
+              l = p;
+              return;
+            }
+            function eU(d, e) {
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              h = c[(d + 16) >> 2] | 0;
+              f = (h + 208) | 0;
+              if ((c[f >> 2] | 0) == 0 ? (b[(h + 260) >> 1] & 1) == 0 : 0) d = 0;
+              else {
+                dS(d);
+                d = c[f >> 2] | 0;
+              }
+              if ((d | 0) != (c[e >> 2] | 0)) {
+                U1(d);
+                c[f >> 2] = c[e >> 2];
+              }
+              d = (h + 228) | 0;
+              f = c[d >> 2] | 0;
+              g = (e + 4) | 0;
+              if ((f | 0) != (c[g >> 2] | 0)) {
+                U1(f);
+                c[d >> 2] = c[g >> 2];
+              }
+              d = (h + 244) | 0;
+              f = c[d >> 2] | 0;
+              g = (e + 8) | 0;
+              if ((f | 0) != (c[g >> 2] | 0)) {
+                U1(f);
+                c[d >> 2] = c[g >> 2];
+              }
+              d = (h + 212) | 0;
+              f = c[d >> 2] | 0;
+              g = (e + 12) | 0;
+              if ((f | 0) != (c[g >> 2] | 0)) {
+                U1(f);
+                c[d >> 2] = c[g >> 2];
+              }
+              h = (h + 260) | 0;
+              b[h >> 1] = (b[h >> 1] & -2) | (a[(e + 16) >> 0] & 1);
+              return;
+            }
+            function fU(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0;
+              e = c[b >> 2] | 0;
+              if (e | 0) c[(a + 16) >> 2] = e;
+              e = c[(b + 4) >> 2] | 0;
+              if (e | 0) c[(a + 20) >> 2] = e;
+              d = +h[(b + 16) >> 3];
+              if (d >= 0.0) h[(a + 32) >> 3] = d;
+              return;
+            }
+            function gU(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = +d;
+              e = +e;
+              var f = 0,
+                g = 0,
+                i = 0;
+              f = l;
+              l = (l + 64) | 0;
+              g = (f + 32) | 0;
+              i = f;
+              c[i >> 2] = c[b >> 2];
+              c[(i + 4) >> 2] = c[(b + 4) >> 2];
+              c[(i + 8) >> 2] = c[(b + 8) >> 2];
+              c[(i + 12) >> 2] = c[(b + 12) >> 2];
+              h[(i + 16) >> 3] = +h[b >> 3] + d;
+              h[(i + 24) >> 3] = +h[(b + 8) >> 3] + e;
+              c[g >> 2] = c[i >> 2];
+              c[(g + 4) >> 2] = c[(i + 4) >> 2];
+              c[(g + 8) >> 2] = c[(i + 8) >> 2];
+              c[(g + 12) >> 2] = c[(i + 12) >> 2];
+              c[(g + 16) >> 2] = c[(i + 16) >> 2];
+              c[(g + 20) >> 2] = c[(i + 20) >> 2];
+              c[(g + 24) >> 2] = c[(i + 24) >> 2];
+              c[(g + 28) >> 2] = c[(i + 28) >> 2];
+              oS(a, g, 1);
+              l = f;
+              return;
+            }
+            function hU(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0.0,
+                m = 0.0,
+                n = 0.0;
+              i = l;
+              l = (l + 64) | 0;
+              g = i;
+              k = +h[e >> 3];
+              n = k + +h[d >> 3];
+              m = +h[(e + 8) >> 3];
+              j = m + +h[(d + 8) >> 3];
+              k = k + +h[(d + 16) >> 3];
+              m = m + +h[(d + 24) >> 3];
+              h[g >> 3] = k;
+              h[(g + 8) >> 3] = m;
+              h[(g + 32) >> 3] = n;
+              h[(g + 40) >> 3] = j;
+              h[(g + 16) >> 3] = n;
+              h[(g + 24) >> 3] = m;
+              h[(g + 48) >> 3] = k;
+              h[(g + 56) >> 3] = j;
+              f = c[(d + 36) >> 2] | 0;
+              if (!f) f = c[(e + 56) >> 2] | 0;
+              e = c[(d + 32) >> 2] | 0;
+              if (!e) qa(137334, 137342, 623, 137354);
+              if (!(a[e >> 0] | 0)) qa(137368, 137342, 624, 137354);
+              else {
+                sS(b, e, g, 4, 1, f);
+                l = i;
+                return;
+              }
+            }
+            function iU(d, e, f, g, i, j, k, m) {
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = +i;
+              j = j | 0;
+              k = k | 0;
+              m = m | 0;
+              var n = 0.0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0.0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0.0,
+                N = 0.0,
+                O = 0,
+                P = 0,
+                Q = 0,
+                R = 0;
+              R = l;
+              l = (l + 128) | 0;
+              K = (R + 104) | 0;
+              O = (R + 48) | 0;
+              P = (R + 16) | 0;
+              L = R;
+              J = L;
+              c[J >> 2] = 0;
+              c[(J + 4) >> 2] = 0;
+              M = +h[g >> 3];
+              N = M - i;
+              I = M + i;
+              J = (L + 8) | 0;
+              h[J >> 3] = (+h[(k + 24) >> 3] - +h[(k + 8) >> 3]) * 0.5 + +h[(g + 8) >> 3];
+              eS(d, 1);
+              D = (P + 16) | 0;
+              E = (P + 4) | 0;
+              F = (P + 24) | 0;
+              G = (O + 4) | 0;
+              H = (O + 16) | 0;
+              s = (m | 0) == 0;
+              t = (O + 24) | 0;
+              u = (O + 8) | 0;
+              v = (O + 32) | 0;
+              w = (O + 40) | 0;
+              x = (O + 48) | 0;
+              y = (j + 16) | 0;
+              z = (j + 4) | 0;
+              A = (P + 8) | 0;
+              q = 0;
+              while (1) {
+                if ((q | 0) >= (e | 0)) break;
+                switch (a[(f + ((q * 24) | 0) + 6) >> 0] | 0) {
+                  case 108: {
+                    i = N;
+                    break;
+                  }
+                  case 114: {
+                    i = I - +h[(f + ((q * 24) | 0) + 8) >> 3];
+                    break;
+                  }
+                  default:
+                    i = M - +h[(f + ((q * 24) | 0) + 8) >> 3] * 0.5;
+                }
+                h[g >> 3] = i;
+                B = (f + ((q * 24) | 0) + 16) | 0;
+                h[J >> 3] = +h[J >> 3] - +h[B >> 3];
+                C = (f + ((q * 24) | 0) + 4) | 0;
+                p = c[(f + ((q * 24) | 0)) >> 2] | 0;
+                r = 0;
+                while (1) {
+                  if ((r | 0) >= (b[C >> 1] | 0)) break;
+                  o = (p + 4) | 0;
+                  m = c[o >> 2] | 0;
+                  if (m) {
+                    h[D >> 3] = +h[((+h[(m + 16) >> 3] > 0.0 ? m : j) + 16) >> 3];
+                    c[P >> 2] = c[((c[m >> 2] | 0) == 0 ? j : m) >> 2];
+                    k = c[(((c[(m + 4) >> 2] | 0) == 0 ? j : m) + 4) >> 2] | 0;
+                    c[E >> 2] = k;
+                    m = c[(m + 24) >> 2] & 127;
+                    if (!m) Q = 12;
+                    else m = (c[F >> 2] & -128) | m;
+                  } else {
+                    h[D >> 3] = +h[y >> 3];
+                    c[P >> 2] = c[j >> 2];
+                    k = c[z >> 2] | 0;
+                    c[E >> 2] = k;
+                    Q = 12;
+                  }
+                  if ((Q | 0) == 12) {
+                    Q = 0;
+                    m = c[F >> 2] & -128;
+                  }
+                  c[F >> 2] = m;
+                  hS(d, k);
+                  c[O >> 2] = c[p >> 2];
+                  c[G >> 2] = P;
+                  h[H >> 3] = +h[(p + 16) >> 3];
+                  if (s) n = 1.0;
+                  else n = +h[(p + 24) >> 3];
+                  h[t >> 3] = n;
+                  c[A >> 2] = c[((c[o >> 2] | 0) + 8) >> 2];
+                  c[u >> 2] = c[(p + 8) >> 2];
+                  o = (p + 32) | 0;
+                  h[v >> 3] = +h[o >> 3];
+                  h[w >> 3] = +h[B >> 3];
+                  a[x >> 0] = 108;
+                  h[L >> 3] = i;
+                  c[K >> 2] = c[L >> 2];
+                  c[(K + 4) >> 2] = c[(L + 4) >> 2];
+                  c[(K + 8) >> 2] = c[(L + 8) >> 2];
+                  c[(K + 12) >> 2] = c[(L + 12) >> 2];
+                  gS(d, K, O);
+                  n = +h[o >> 3] + i;
+                  h[g >> 3] = n;
+                  p = (p + 56) | 0;
+                  r = (r + 1) | 0;
+                  i = n;
+                }
+                q = (q + 1) | 0;
+              }
+              fS(d);
+              l = R;
+              return;
+            }
+            function jU(a) {
+              a = a | 0;
+              U1(c[a >> 2] | 0);
+              U1(c[(a + 4) >> 2] | 0);
+              U1(c[(a + 8) >> 2] | 0);
+              U1(c[(a + 16) >> 2] | 0);
+              U1(c[(a + 12) >> 2] | 0);
+              U1(c[(a + 20) >> 2] | 0);
+              U1(c[(a + 24) >> 2] | 0);
+              return;
+            }
+            function kU(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              if (a | 0) {
+                j = (a + 4) | 0;
+                e = 0;
+                g = c[a >> 2] | 0;
+                while (1) {
+                  if ((e | 0) >= (b[j >> 1] | 0)) break;
+                  k = (g + 4) | 0;
+                  d = 0;
+                  f = c[g >> 2] | 0;
+                  while (1) {
+                    if ((d | 0) >= (b[k >> 1] | 0)) break;
+                    U1(c[f >> 2] | 0);
+                    h = c[(f + 8) >> 2] | 0;
+                    if (h | 0 ? ((i = c[(f + 12) >> 2] | 0), i | 0) : 0) tb[i & 127](h);
+                    d = (d + 1) | 0;
+                    f = (f + 56) | 0;
+                  }
+                  e = (e + 1) | 0;
+                  g = (g + 24) | 0;
+                }
+                d = c[a >> 2] | 0;
+                if (d | 0) U1(d);
+                U1(a);
+              }
+              return;
+            }
+            function lU(a) {
+              a = a | 0;
+              U1(c[(a + 32) >> 2] | 0);
+              U1(a);
+              return;
+            }
+            function mU(b, d) {
+              b = b | 0;
+              d = d | 0;
+              switch (a[(b + 4) >> 0] | 0) {
+                case 1: {
+                  nU(c[b >> 2] | 0);
+                  break;
+                }
+                case 3: {
+                  lU(c[b >> 2] | 0);
+                  break;
+                }
+                default:
+                  kU(c[b >> 2] | 0);
+              }
+              if (d | 0) U1(b);
+              return;
+            }
+            function nU(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              e = (a + 84) | 0;
+              if ((c[(a + 100) >> 2] | 0) == -1) Rz(c[e >> 2] | 0) | 0;
+              else {
+                b = c[e >> 2] | 0;
+                U1(c[(a + 92) >> 2] | 0);
+                U1(c[(a + 96) >> 2] | 0);
+                while (1) {
+                  d = c[b >> 2] | 0;
+                  if (!d) break;
+                  oU(d);
+                  b = (b + 4) | 0;
+                }
+                U1(c[e >> 2] | 0);
+              }
+              jU(a);
+              U1(a);
+              return;
+            }
+            function oU(a) {
+              a = a | 0;
+              mU((a + 88) | 0, 0);
+              jU(a);
+              U1(a);
+              return;
+            }
+            function pU(b, e, f) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0;
+              b = c[((c[((c[(b + 16) >> 2] | 0) + 104) >> 2] | 0) + 72) >> 2] | 0;
+              if ((a[(b + 4) >> 0] | 0) != 2 ? ((g = qU(c[b >> 2] | 0, e) | 0), (g | 0) != 0) : 0) {
+                c[f >> 2] = d[(g + 35) >> 0];
+                b = (g + 48) | 0;
+              } else b = 0;
+              return b | 0;
+            }
+            function qU(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = c[(a + 4) >> 2] | 0;
+              if (!((d | 0) != 0 ? (c3(d, b) | 0) == 0 : 0)) e = 3;
+              a: do
+                if ((e | 0) == 3) {
+                  d = c[(a + 84) >> 2] | 0;
+                  while (1) {
+                    a = c[d >> 2] | 0;
+                    if (!a) {
+                      a = 0;
+                      break a;
+                    }
+                    a = rU(a, b) | 0;
+                    if (!a) d = (d + 4) | 0;
+                    else break;
+                  }
+                }
+              while (0);
+              return a | 0;
+            }
+            function rU(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              e = c[(b + 4) >> 2] | 0;
+              if (!((e | 0) != 0 ? (c3(e, d) | 0) == 0 : 0))
+                if ((a[(b + 92) >> 0] | 0) == 1) b = qU(c[(b + 88) >> 2] | 0, d) | 0;
+                else b = 0;
+              return b | 0;
+            }
+            function sU(a, b, c, d, e) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              return 0;
+            }
+            function tU(d) {
+              d = d | 0;
+              var f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0;
+              p = (d + 92) | 0;
+              c[p >> 2] = JK(((c[(d + 100) >> 2] << 2) + 4) | 0) | 0;
+              n = JK(((c[(d + 104) >> 2] << 2) + 4) | 0) | 0;
+              c[(d + 96) >> 2] = n;
+              o = (d + 32) | 0;
+              m = c[(d + 84) >> 2] | 0;
+              while (1) {
+                l = c[m >> 2] | 0;
+                if (!l) break;
+                d = b[(l + 82) >> 1] | 0;
+                f = +h[(l + 72) >> 3];
+                if ((d << 16) >> 16 == 1) i = ~~f;
+                else {
+                  i = ~~((f - +(O(((a[o >> 0] | 0) + -1) | 0, ((d & 65535) + -1) | 0) | 0)) / +(d & 65535));
+                  i = (i | 0) > 1 ? i : 1;
+                }
+                j = b[(l + 80) >> 1] | 0;
+                f = +h[(l + 64) >> 3];
+                if ((j << 16) >> 16 == 1) k = ~~f;
+                else {
+                  k = ~~((f - +(O(((a[o >> 0] | 0) + -1) | 0, ((j & 65535) + -1) | 0) | 0)) / +(j & 65535));
+                  k = (k | 0) > 1 ? k : 1;
+                }
+                q = e[(l + 86) >> 1] | 0;
+                g = ((d & 65535) + q) | 0;
+                d = q;
+                while (1) {
+                  if ((d | 0) >= (g | 0)) break;
+                  q = ((c[p >> 2] | 0) + (d << 2)) | 0;
+                  r = c[q >> 2] | 0;
+                  c[q >> 2] = (r | 0) > (i | 0) ? r : i;
+                  d = (d + 1) | 0;
+                }
+                d = e[(l + 84) >> 1] | 0;
+                g = ((j & 65535) + d) | 0;
+                while (1) {
+                  if ((d | 0) >= (g | 0)) break;
+                  r = (n + (d << 2)) | 0;
+                  q = c[r >> 2] | 0;
+                  c[r >> 2] = (q | 0) > (k | 0) ? q : k;
+                  d = (d + 1) | 0;
+                }
+                m = (m + 4) | 0;
+              }
+              return;
+            }
+            function uU(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              d = l;
+              l = (l + 16) | 0;
+              b = d;
+              if (a >>> 0 < 21) a = c[(55840 + (a << 2)) >> 2] | 0;
+              else {
+                c[b >> 2] = a;
+                m4(194959, 137395, b) | 0;
+                a = 194959;
+              }
+              l = d;
+              return a | 0;
+            }
+            function vU(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              k = (a + 104) | 0;
+              l = (a + 100) | 0;
+              j = (d + 16) | 0;
+              f = 0;
+              g = 0;
+              while (1) {
+                if ((f | 0) > (c[k >> 2] | 0)) break;
+                i = tC(d, uU(f) | 0, 1) | 0;
+                TC(i, 137447, 304, 1) | 0;
+                m = (i + 16) | 0;
+                c[((c[m >> 2] | 0) + 176) >> 2] = 0;
+                o = JK(((c[l >> 2] << 2) + 4) | 0) | 0;
+                n = c[m >> 2] | 0;
+                c[(n + 172) >> 2] = o;
+                c[(n + 184) >> 2] = 0;
+                n = JK(((c[l >> 2] << 2) + 4) | 0) | 0;
+                c[((c[m >> 2] | 0) + 180) >> 2] = n;
+                if (!g) c[((c[j >> 2] | 0) + 192) >> 2] = i;
+                else c[((c[(g + 16) >> 2] | 0) + 164) >> 2] = i;
+                f = (f + 1) | 0;
+                g = i;
+              }
+              j = (b + 16) | 0;
+              f = 0;
+              g = 0;
+              while (1) {
+                if ((f | 0) > (c[l >> 2] | 0)) break;
+                i = tC(b, uU(f) | 0, 1) | 0;
+                TC(i, 137447, 304, 1) | 0;
+                o = (i + 16) | 0;
+                c[((c[o >> 2] | 0) + 176) >> 2] = 0;
+                m = JK(((c[k >> 2] << 2) + 4) | 0) | 0;
+                n = c[o >> 2] | 0;
+                c[(n + 172) >> 2] = m;
+                c[(n + 184) >> 2] = 0;
+                n = JK(((c[k >> 2] << 2) + 4) | 0) | 0;
+                c[((c[o >> 2] | 0) + 180) >> 2] = n;
+                if (!g) c[((c[j >> 2] | 0) + 192) >> 2] = i;
+                else c[((c[(g + 16) >> 2] | 0) + 164) >> 2] = i;
+                f = (f + 1) | 0;
+                g = i;
+              }
+              f = c[(a + 84) >> 2] | 0;
+              while (1) {
+                g = c[f >> 2] | 0;
+                if (!g) break;
+                o = (g + 84) | 0;
+                n = tC(d, uU(e[o >> 1] | 0) | 0, 0) | 0;
+                o = tC(d, uU(((e[(g + 80) >> 1] | 0) + (e[o >> 1] | 0)) | 0) | 0, 0) | 0;
+                wU(d, n, o, ~~+h[(g + 64) >> 3]);
+                o = (g + 86) | 0;
+                n = tC(b, uU(e[o >> 1] | 0) | 0, 0) | 0;
+                o = tC(b, uU(((e[(g + 82) >> 1] | 0) + (e[o >> 1] | 0)) | 0) | 0, 0) | 0;
+                wU(b, n, o, ~~+h[(g + 72) >> 3]);
+                f = (f + 4) | 0;
+              }
+              xU(d);
+              xU(b);
+              return;
+            }
+            function wU(a, d, f, g) {
+              a = a | 0;
+              d = d | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0;
+              h = iB(a, d, f, 0, 0) | 0;
+              if (!h) {
+                i = iB(a, d, f, 0, 1) | 0;
+                TC(i, 137460, 176, 1) | 0;
+                b[((c[(i + 16) >> 2] | 0) + 170) >> 1] = g;
+                d = (d + 16) | 0;
+                a = c[d >> 2] | 0;
+                h = c[(a + 180) >> 2] | 0;
+                if (!h) a = KK(((c[(a + 184) >> 2] << 2) + 8) | 0) | 0;
+                else a = MK(h, ((c[(a + 184) >> 2] << 2) + 8) | 0) | 0;
+                g = c[d >> 2] | 0;
+                c[(g + 180) >> 2] = a;
+                g = (g + 184) | 0;
+                h = c[g >> 2] | 0;
+                c[g >> 2] = h + 1;
+                c[(a + (h << 2)) >> 2] = i;
+                d = c[d >> 2] | 0;
+                c[((c[(d + 180) >> 2] | 0) + (c[(d + 184) >> 2] << 2)) >> 2] = 0;
+                d = (f + 16) | 0;
+                a = c[d >> 2] | 0;
+                h = c[(a + 172) >> 2] | 0;
+                if (!h) a = KK(((c[(a + 176) >> 2] << 2) + 8) | 0) | 0;
+                else a = MK(h, ((c[(a + 176) >> 2] << 2) + 8) | 0) | 0;
+                g = c[d >> 2] | 0;
+                c[(g + 172) >> 2] = a;
+                g = (g + 176) | 0;
+                f = c[g >> 2] | 0;
+                c[g >> 2] = f + 1;
+                c[(a + (f << 2)) >> 2] = i;
+                i = c[d >> 2] | 0;
+                c[((c[(i + 172) >> 2] | 0) + (c[(i + 176) >> 2] << 2)) >> 2] = 0;
+              } else {
+                i = ((c[(h + 16) >> 2] | 0) + 170) | 0;
+                f = e[i >> 1] | 0;
+                b[i >> 1] = (f | 0) > (g | 0) ? f : g;
+              }
+              return;
+            }
+            function xU(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              d = c[((c[(a + 16) >> 2] | 0) + 192) >> 2] | 0;
+              while (1) {
+                f = (d + 16) | 0;
+                h = c[((c[f >> 2] | 0) + 164) >> 2] | 0;
+                if (!h) break;
+                if (iB(a, d, h, 0, 0) | 0) {
+                  d = h;
+                  continue;
+                }
+                g = iB(a, d, h, 0, 1) | 0;
+                TC(g, 137460, 176, 1) | 0;
+                b[((c[(g + 16) >> 2] | 0) + 170) >> 1] = 0;
+                d = c[f >> 2] | 0;
+                e = c[(d + 180) >> 2] | 0;
+                if (!e) d = KK(((c[(d + 184) >> 2] << 2) + 8) | 0) | 0;
+                else d = MK(e, ((c[(d + 184) >> 2] << 2) + 8) | 0) | 0;
+                i = c[f >> 2] | 0;
+                c[(i + 180) >> 2] = d;
+                i = (i + 184) | 0;
+                e = c[i >> 2] | 0;
+                c[i >> 2] = e + 1;
+                c[(d + (e << 2)) >> 2] = g;
+                f = c[f >> 2] | 0;
+                c[((c[(f + 180) >> 2] | 0) + (c[(f + 184) >> 2] << 2)) >> 2] = 0;
+                f = (h + 16) | 0;
+                d = c[f >> 2] | 0;
+                e = c[(d + 172) >> 2] | 0;
+                if (!e) d = KK(((c[(d + 176) >> 2] << 2) + 8) | 0) | 0;
+                else d = MK(e, ((c[(d + 176) >> 2] << 2) + 8) | 0) | 0;
+                e = c[f >> 2] | 0;
+                c[(e + 172) >> 2] = d;
+                e = (e + 176) | 0;
+                i = c[e >> 2] | 0;
+                c[e >> 2] = i + 1;
+                c[(d + (i << 2)) >> 2] = g;
+                d = c[f >> 2] | 0;
+                c[((c[(d + 172) >> 2] | 0) + (c[(d + 176) >> 2] << 2)) >> 2] = 0;
+                d = h;
+              }
+              return;
+            }
+            function yU(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              g = (a + 92) | 0;
+              e = 0;
+              f = 0;
+              b = c[((c[((c[(b + 16) >> 2] | 0) + 192) >> 2] | 0) + 16) >> 2] | 0;
+              while (1) {
+                b = c[(b + 164) >> 2] | 0;
+                if (!b) break;
+                b = c[(b + 16) >> 2] | 0;
+                h = (b + 232) | 0;
+                c[((c[g >> 2] | 0) + (f << 2)) >> 2] = (c[h >> 2] | 0) - e;
+                e = c[h >> 2] | 0;
+                f = (f + 1) | 0;
+              }
+              a = (a + 96) | 0;
+              e = 0;
+              f = 0;
+              b = c[((c[((c[(d + 16) >> 2] | 0) + 192) >> 2] | 0) + 16) >> 2] | 0;
+              while (1) {
+                b = c[(b + 164) >> 2] | 0;
+                if (!b) break;
+                b = c[(b + 16) >> 2] | 0;
+                h = (b + 232) | 0;
+                c[((c[a >> 2] | 0) + (f << 2)) >> 2] = (c[h >> 2] | 0) - e;
+                e = c[h >> 2] | 0;
+                f = (f + 1) | 0;
+              }
+              return;
+            }
+            function zU(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 16) | 0;
+              g = (h + 4) | 0;
+              d = h;
+              c[d >> 2] = c[4647];
+              e = c[(b + 100) >> 2] | 0;
+              if ((e | 0) != 1 ? ((f = (b + 104) | 0), (c[f >> 2] | 0) != 1) : 0) {
+                c[(b + 92) >> 2] = JK(((e << 2) + 4) | 0) | 0;
+                c[(b + 96) >> 2] = JK(((c[f >> 2] << 2) + 4) | 0) | 0;
+                a[g >> 0] = a[d >> 0] | 0;
+                a[(g + 1) >> 0] = a[(d + 1) >> 0] | 0;
+                a[(g + 2) >> 0] = a[(d + 2) >> 0] | 0;
+                a[(g + 3) >> 0] = a[(d + 3) >> 0] | 0;
+                f = oB(137473, g, 0) | 0;
+                a[g >> 0] = a[d >> 0] | 0;
+                a[(g + 1) >> 0] = a[(d + 1) >> 0] | 0;
+                a[(g + 2) >> 0] = a[(d + 2) >> 0] | 0;
+                a[(g + 3) >> 0] = a[(d + 3) >> 0] | 0;
+                g = oB(137478, g, 0) | 0;
+                TC(f, 137483, 280, 1) | 0;
+                TC(g, 137483, 280, 1) | 0;
+                vU(b, f, g);
+                uL(f, 2, 2147483647) | 0;
+                uL(g, 2, 2147483647) | 0;
+                yU(b, f, g);
+                AU(f, g);
+              } else tU(b);
+              l = h;
+              return;
+            }
+            function AU(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              d = ((c[(b + 16) >> 2] | 0) + 192) | 0;
+              while (1) {
+                d = c[d >> 2] | 0;
+                if (!d) break;
+                f = (d + 16) | 0;
+                d = c[f >> 2] | 0;
+                e = c[(d + 172) >> 2] | 0;
+                if (e) {
+                  U1(e);
+                  d = c[f >> 2] | 0;
+                }
+                e = c[(d + 180) >> 2] | 0;
+                if (e) {
+                  U1(e);
+                  d = c[f >> 2] | 0;
+                }
+                d = (d + 164) | 0;
+              }
+              sB(a) | 0;
+              sB(b) | 0;
+              return;
+            }
+            function BU(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0.0,
+                r = 0.0;
+              p = l;
+              l = (l + 272) | 0;
+              n = (p + 104) | 0;
+              o = (p + 136) | 0;
+              j = (p + 72) | 0;
+              k = p;
+              g = (p + 144) | 0;
+              c[(k + 48) >> 2] = b;
+              switch (IC(b) | 0) {
+                case 0: {
+                  e = c[(b + 60) >> 2] | 0;
+                  break;
+                }
+                case 1: {
+                  e = xC(b) | 0;
+                  break;
+                }
+                case 2: {
+                  e = xC(c[((((c[b >> 2] & 3) | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0) | 0;
+                  break;
+                }
+                default: {
+                }
+              }
+              i = (k + 52) | 0;
+              c[i >> 2] = e;
+              m = c[(e + 60) >> 2] | 0;
+              h[(k + 32) >> 3] = +h[(d + 16) >> 3];
+              c[(k + 16) >> 2] = c[(d + 4) >> 2];
+              c[(k + 20) >> 2] = c[(d + 8) >> 2];
+              c[(k + 40) >> 2] = 0;
+              f = LW(c[d >> 2] | 0, o, k) | 0;
+              if (!f) {
+                kA(n, 128, g);
+                a[(d + 82) >> 0] = 0;
+                e = D4(CU(b, n) | 0) | 0;
+                c[d >> 2] = e;
+                if ((c[(d + 12) >> 2] | 0) == 1) e = eQ(e) | 0;
+                else e = bQ(e, c[i >> 2] | 0) | 0;
+                U1(c[d >> 2] | 0);
+                c[d >> 2] = e;
+                xK(c[((c[(m + 16) >> 2] | 0) + 144) >> 2] | 0, d);
+                oA(n);
+                e = c[o >> 2] | 0;
+              } else {
+                e = (f + 4) | 0;
+                if ((a[e >> 0] | 0) == 1) {
+                  if ((c[((c[f >> 2] | 0) + 24) >> 2] | 0) == 0 ? DU(b) | 0 : 0) {
+                    i = D4(DU(b) | 0) | 0;
+                    c[((c[f >> 2] | 0) + 24) >> 2] = i;
+                  }
+                  m = EU(m, c[f >> 2] | 0, 0, k) | 0;
+                  c[o >> 2] = c[o >> 2] | m;
+                  m = c[f >> 2] | 0;
+                  r = +h[(m + 64) >> 3] * 0.5;
+                  q = +h[(m + 72) >> 3] * 0.5;
+                  FU(j, -r, -q, r, q);
+                  m = c[f >> 2] | 0;
+                  c[n >> 2] = c[j >> 2];
+                  c[(n + 4) >> 2] = c[(j + 4) >> 2];
+                  c[(n + 8) >> 2] = c[(j + 8) >> 2];
+                  c[(n + 12) >> 2] = c[(j + 12) >> 2];
+                  c[(n + 16) >> 2] = c[(j + 16) >> 2];
+                  c[(n + 20) >> 2] = c[(j + 20) >> 2];
+                  c[(n + 24) >> 2] = c[(j + 24) >> 2];
+                  c[(n + 28) >> 2] = c[(j + 28) >> 2];
+                  GU(m, n, 15);
+                } else {
+                  HU(c[((c[(m + 16) >> 2] | 0) + 144) >> 2] | 0, c[f >> 2] | 0, k);
+                  n = c[f >> 2] | 0;
+                  q = +h[(n + 24) >> 3] * 0.5;
+                  r = +h[(n + 32) >> 3] * 0.5;
+                  FU(j, -q, -r, q, r);
+                  n = ((c[f >> 2] | 0) + 8) | 0;
+                  c[n >> 2] = c[j >> 2];
+                  c[(n + 4) >> 2] = c[(j + 4) >> 2];
+                  c[(n + 8) >> 2] = c[(j + 8) >> 2];
+                  c[(n + 12) >> 2] = c[(j + 12) >> 2];
+                  c[(n + 16) >> 2] = c[(j + 16) >> 2];
+                  c[(n + 20) >> 2] = c[(j + 20) >> 2];
+                  c[(n + 24) >> 2] = c[(j + 24) >> 2];
+                  c[(n + 28) >> 2] = c[(j + 28) >> 2];
+                }
+                h[(d + 24) >> 3] = +h[(j + 16) >> 3] - +h[j >> 3];
+                h[(d + 32) >> 3] = +h[(j + 24) >> 3] - +h[(j + 8) >> 3];
+                c[(d + 72) >> 2] = f;
+                if ((a[e >> 0] | 0) == 1) {
+                  U1(c[d >> 2] | 0);
+                  c[d >> 2] = D4(141611) | 0;
+                }
+                e = c[o >> 2] | 0;
+              }
+              l = p;
+              return e | 0;
+            }
+            function CU(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              a: do
+                switch (IC(b) | 0) {
+                  case 0: {
+                    nA(d, KB(b) | 0) | 0;
+                    break;
+                  }
+                  case 1: {
+                    nA(d, KB(b) | 0) | 0;
+                    break;
+                  }
+                  case 2: {
+                    nA(d, KB(c[((((c[b >> 2] & 3) | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0) | 0) | 0;
+                    e = (b + -48) | 0;
+                    nA(d, KB(c[((((c[b >> 2] & 3) | 0) == 2 ? b : e) + 40) >> 2] | 0) | 0) | 0;
+                    if (!(xB(xC(c[((((c[b >> 2] & 3) | 0) == 2 ? b : e) + 40) >> 2] | 0) | 0) | 0)) {
+                      nA(d, 141747) | 0;
+                      break a;
+                    } else {
+                      nA(d, 137738) | 0;
+                      break a;
+                    }
+                  }
+                  default: {
+                  }
+                }
+              while (0);
+              e = (d + 4) | 0;
+              b = c[e >> 2] | 0;
+              if (b >>> 0 >= (c[(d + 8) >> 2] | 0) >>> 0) {
+                lA(d, 1) | 0;
+                b = c[e >> 2] | 0;
+              }
+              a[b >> 0] = 0;
+              d = c[d >> 2] | 0;
+              c[e >> 2] = d;
+              return d | 0;
+            }
+            function DU(b) {
+              b = b | 0;
+              var c = 0,
+                d = 0;
+              c = QA(b, 137729) | 0;
+              if (!((c | 0) != 0 ? (a[c >> 0] | 0) != 0 : 0)) d = 3;
+              do
+                if ((d | 0) == 3) {
+                  c = QA(b, 140823) | 0;
+                  if (c | 0 ? a[c >> 0] | 0 : 0) break;
+                  c = 0;
+                }
+              while (0);
+              return c | 0;
+            }
+            function EU(f, g, i, j) {
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              j = j | 0;
+              var k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0;
+              w = l;
+              l = (l + 16) | 0;
+              u = (w + 8) | 0;
+              t = w;
+              v = (g + 108) | 0;
+              k = c[v >> 2] | 0;
+              if (k | 0) ZT(j, k, 186576);
+              c[(g + 80) >> 2] = i;
+              k = LU(f, g, j) | 0;
+              r = (g + 36) | 0;
+              f = b[r >> 1] | 0;
+              if (!(f & 128)) a[(g + 32) >> 0] = 2;
+              i = (g + 33) | 0;
+              if (!(f & 32)) a[i >> 0] = 1;
+              zU(g);
+              n = c[(g + 104) >> 2] | 0;
+              p = a[(g + 32) >> 0] | 0;
+              f = O((n + 1) | 0, p) | 0;
+              o = d[i >> 0] << 1;
+              q = c[(g + 100) >> 2] | 0;
+              p = O((q + 1) | 0, p) | 0;
+              m = (g + 96) | 0;
+              f = (o + f) | 0;
+              i = 0;
+              while (1) {
+                if ((i | 0) >= (n | 0)) break;
+                f = ((c[((c[m >> 2] | 0) + (i << 2)) >> 2] | 0) + f) | 0;
+                i = (i + 1) | 0;
+              }
+              n = (g + 92) | 0;
+              i = (p + o) | 0;
+              m = 0;
+              while (1) {
+                if ((m | 0) >= (q | 0)) break;
+                i = ((c[((c[n >> 2] | 0) + (m << 2)) >> 2] | 0) + i) | 0;
+                m = (m + 1) | 0;
+              }
+              n = (g + 38) | 0;
+              do
+                if (b[r >> 1] & 1) {
+                  r = b[n >> 1] | 0;
+                  m = r & 65535;
+                  if ((r << 16) >> 16 ? ((s = b[(g + 40) >> 1] | 0), (s << 16) >> 16) : 0) {
+                    if (!(((f | 0) > (m | 0)) | ((i | 0) > ((s & 65535) | 0)))) {
+                      i = 0;
+                      f = 0;
+                      break;
+                    }
+                    gA(0, 137529, t) | 0;
+                    k = 1;
+                    i = 0;
+                    f = 0;
+                    break;
+                  }
+                  gA(0, 137563, u) | 0;
+                  k = 1;
+                }
+              while (0);
+              u = e[n >> 1] | 0;
+              h[(g + 64) >> 3] = +(((f | 0) > (u | 0) ? f : u) | 0);
+              u = e[(g + 40) >> 1] | 0;
+              h[(g + 72) >> 3] = +(((i | 0) > (u | 0) ? i : u) | 0);
+              if (c[v >> 2] | 0) fU(j, 186576);
+              l = w;
+              return k | 0;
+            }
+            function FU(a, b, c, d, e) {
+              a = a | 0;
+              b = +b;
+              c = +c;
+              d = +d;
+              e = +e;
+              h[a >> 3] = b;
+              h[(a + 8) >> 3] = c;
+              h[(a + 16) >> 3] = d;
+              h[(a + 24) >> 3] = e;
+              return;
+            }
+            function GU(e, f, g) {
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0.0,
+                n = 0.0,
+                o = 0,
+                p = 0,
+                q = 0.0,
+                r = 0.0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0.0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0.0,
+                K = 0;
+              I = l;
+              l = (l + 64) | 0;
+              G = (I + 32) | 0;
+              H = I;
+              E = c[(e + 84) >> 2] | 0;
+              k = c[(e + 80) >> 2] | 0;
+              if ((k | 0 ? ((i = c[(k + 24) >> 2] | 0), i | 0) : 0) ? ((j = (e + 24) | 0), (c[j >> 2] | 0) == 0) : 0)
+                c[j >> 2] = D4(i) | 0;
+              F = (e + 48) | 0;
+              i = (f + 16) | 0;
+              n = +h[i >> 3];
+              m = +h[f >> 3];
+              k = ~~(n - m - +(~~+h[(e + 64) >> 3] | 0));
+              if ((k | 0) <= -1) qa(137496, 137342, 1761, 137506);
+              o = (f + 24) | 0;
+              y = +h[o >> 3];
+              p = (f + 8) | 0;
+              q = +h[p >> 3];
+              r = +(~~+h[(e + 72) >> 3] | 0);
+              s = ~~(y - q - r);
+              if ((s | 0) <= -1) qa(137519, 137342, 1764, 137506);
+              t = b[(e + 36) >> 1] | 0;
+              j = t & 65535;
+              a: do
+                if (j & 1) {
+                  b: do
+                    if ((k | 0) > 0)
+                      switch (j & 6) {
+                        case 4: {
+                          h[i >> 3] = m + r;
+                          break b;
+                        }
+                        case 2: {
+                          J = +(k | 0);
+                          h[i >> 3] = n + J;
+                          m = m + J;
+                          h[f >> 3] = m;
+                          break b;
+                        }
+                        default: {
+                          J = +((k >>> 1) | 0);
+                          m = m + J;
+                          h[f >> 3] = m;
+                          h[i >> 3] = n - J;
+                          break b;
+                        }
+                      }
+                  while (0);
+                  if ((s | 0) > 0)
+                    switch (t & 24) {
+                      case 16: {
+                        y = q + r;
+                        h[o >> 3] = y;
+                        s = 0;
+                        i = 0;
+                        break a;
+                      }
+                      case 8: {
+                        J = +(s | 0);
+                        y = y + J;
+                        h[o >> 3] = y;
+                        h[p >> 3] = q + J;
+                        s = 0;
+                        i = 0;
+                        break a;
+                      }
+                      default: {
+                        J = +((s >>> 1) | 0);
+                        h[p >> 3] = q + J;
+                        y = y - J;
+                        h[o >> 3] = y;
+                        s = 0;
+                        i = 0;
+                        break a;
+                      }
+                    }
+                  else {
+                    s = 0;
+                    i = 0;
+                  }
+                } else i = k;
+              while (0);
+              n = +(d[(e + 33) >> 0] | 0);
+              C = (e + 32) | 0;
+              u = a[C >> 0] | 0;
+              q = +((u << 24) >> 24);
+              D = (e + 104) | 0;
+              k = c[D >> 2] | 0;
+              t = ((i | 0) / (k | 0)) | 0;
+              o = (i - (O(t, k) | 0)) | 0;
+              o = ~~(((o | 0) > -1 ? 0.5 : -0.5) + +(o | 0));
+              B = (e + 96) | 0;
+              p = (u << 24) >> 24;
+              i = ~~(m + n + q);
+              j = 0;
+              while (1) {
+                if ((j | 0) > (k | 0)) break;
+                A = ((c[B >> 2] | 0) + (j << 2)) | 0;
+                k = c[A >> 2] | 0;
+                c[A >> 2] = i;
+                i = (i + t + (((j | 0) < (o | 0)) & 1) + k + p) | 0;
+                j = (j + 1) | 0;
+                k = c[D >> 2] | 0;
+              }
+              A = (e + 100) | 0;
+              k = c[A >> 2] | 0;
+              t = ((s | 0) / (k | 0)) | 0;
+              p = (s - (O(t, k) | 0)) | 0;
+              p = ~~(((p | 0) > -1 ? 0.5 : -0.5) + +(p | 0));
+              z = (e + 92) | 0;
+              o = (u << 24) >> 24;
+              i = ~~(y - n - q);
+              j = 0;
+              while (1) {
+                if ((j | 0) > (k | 0)) break;
+                x = ((c[z >> 2] | 0) + (j << 2)) | 0;
+                k = c[x >> 2] | 0;
+                c[x >> 2] = i;
+                i = (i - t + ((((j | 0) < (p | 0)) << 31) >> 31) - k - o) | 0;
+                j = (j + 1) | 0;
+                k = c[A >> 2] | 0;
+              }
+              u = (g | 0) == 0;
+              v = (H + 16) | 0;
+              w = (H + 24) | 0;
+              x = (H + 8) | 0;
+              i = E;
+              while (1) {
+                o = c[i >> 2] | 0;
+                if (!o) break;
+                k = b[(o + 84) >> 1] | 0;
+                if (u) {
+                  j = 0;
+                  p = b[(o + 80) >> 1] | 0;
+                  s = b[(o + 86) >> 1] | 0;
+                  t = b[(o + 82) >> 1] | 0;
+                } else {
+                  j = (k << 16) >> 16 == 0 ? 8 : 0;
+                  s = b[(o + 86) >> 1] | 0;
+                  j = (s << 16) >> 16 == 0 ? j | 4 : j;
+                  p = b[(o + 80) >> 1] | 0;
+                  t = b[(o + 82) >> 1] | 0;
+                  j =
+                    ((((p & 65535) + (k & 65535)) | 0) == (c[D >> 2] | 0) ? j | 2 : j) |
+                    ((((t & 65535) + (s & 65535)) | 0) == (c[A >> 2] | 0));
+                }
+                K = c[B >> 2] | 0;
+                k = k & 65535;
+                h[H >> 3] = +(c[(K + (k << 2)) >> 2] | 0);
+                E = a[C >> 0] | 0;
+                h[v >> 3] = +(((c[(K + (((p & 65535) + k) << 2)) >> 2] | 0) - E) | 0);
+                p = c[z >> 2] | 0;
+                h[w >> 3] = +(c[(p + ((s & 65535) << 2)) >> 2] | 0);
+                h[x >> 3] = +(((c[(p + (((t & 65535) + (s & 65535)) << 2)) >> 2] | 0) + E) | 0);
+                c[G >> 2] = c[H >> 2];
+                c[(G + 4) >> 2] = c[(H + 4) >> 2];
+                c[(G + 8) >> 2] = c[(H + 8) >> 2];
+                c[(G + 12) >> 2] = c[(H + 12) >> 2];
+                c[(G + 16) >> 2] = c[(H + 16) >> 2];
+                c[(G + 20) >> 2] = c[(H + 20) >> 2];
+                c[(G + 24) >> 2] = c[(H + 24) >> 2];
+                c[(G + 28) >> 2] = c[(H + 28) >> 2];
+                IU(o, G, j & g);
+                i = (i + 4) | 0;
+              }
+              a[(e + 35) >> 0] = g;
+              c[F >> 2] = c[f >> 2];
+              c[(F + 4) >> 2] = c[(f + 4) >> 2];
+              c[(F + 8) >> 2] = c[(f + 8) >> 2];
+              c[(F + 12) >> 2] = c[(f + 12) >> 2];
+              c[(F + 16) >> 2] = c[(f + 16) >> 2];
+              c[(F + 20) >> 2] = c[(f + 20) >> 2];
+              c[(F + 24) >> 2] = c[(f + 24) >> 2];
+              c[(F + 28) >> 2] = c[(f + 28) >> 2];
+              l = I;
+              return;
+            }
+            function HU(d, e, f) {
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0.0,
+                m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0,
+                r = 0,
+                s = 0.0,
+                t = 0.0,
+                u = 0.0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                O = 0,
+                P = 0.0,
+                Q = 0.0,
+                R = 0.0;
+              O = l;
+              l = (l + 112) | 0;
+              H = (O + 48) | 0;
+              I = (O + 16) | 0;
+              J = O;
+              c[I >> 2] = 0;
+              c[(I + 4) >> 2] = 0;
+              c[(I + 8) >> 2] = 0;
+              c[(I + 12) >> 2] = 0;
+              c[(I + 16) >> 2] = 0;
+              c[(I + 20) >> 2] = 0;
+              c[(I + 24) >> 2] = 0;
+              c[(I + 28) >> 2] = 0;
+              K = (e + 4) | 0;
+              L = (f + 16) | 0;
+              M = (f + 32) | 0;
+              N = (I + 16) | 0;
+              r = b[K >> 1] | 0;
+              n = (r << 16) >> 16;
+              g = 0;
+              j = -1.0;
+              m = 0;
+              while (1) {
+                if ((m | 0) >= (n | 0)) {
+                  g = 1;
+                  break;
+                }
+                i = c[e >> 2] | 0;
+                if ((b[(i + ((m * 24) | 0) + 4) >> 1] | 0) > 1) {
+                  g = 0;
+                  break;
+                }
+                i = c[((c[(i + ((m * 24) | 0)) >> 2] | 0) + 4) >> 2] | 0;
+                if (!i) {
+                  k = +h[M >> 3];
+                  h[N >> 3] = k;
+                  i = L;
+                } else {
+                  if ((c[(i + 24) >> 2] & 127) | 0) {
+                    g = 0;
+                    break;
+                  }
+                  k = +h[((+h[(i + 16) >> 3] > 0.0 ? i : L) + 16) >> 3];
+                  h[N >> 3] = k;
+                  i = (c[i >> 2] | 0) == 0 ? L : i;
+                }
+                i = c[i >> 2] | 0;
+                c[I >> 2] = i;
+                if (!(j == -1.0)) {
+                  if (k != j) {
+                    g = 0;
+                    break;
+                  }
+                } else j = k;
+                if (g) {
+                  if (s2(i, g) | 0) {
+                    g = 0;
+                    break;
+                  }
+                } else g = i;
+                m = (m + 1) | 0;
+              }
+              a[(e + 6) >> 0] = g;
+              E = (f + 48) | 0;
+              F = (f + 20) | 0;
+              G = (I + 4) | 0;
+              w = (f + 40) | 0;
+              x = (I + 24) | 0;
+              y = (d + 144) | 0;
+              z = (H + 4) | 0;
+              v = (J + 8) | 0;
+              A = (H + 16) | 0;
+              B = (H + 24) | 0;
+              C = (H + 8) | 0;
+              D = (H + 12) | 0;
+              f = (g | 0) == 0;
+              j = 0.0;
+              s = 0.0;
+              t = 0.0;
+              u = 0.0;
+              n = 0;
+              g = r;
+              while (1) {
+                if ((n | 0) >= (((g << 16) >> 16) | 0)) break;
+                k = 0.0;
+                q = 0.0;
+                m = 0;
+                p = 0.0;
+                j = 0.0;
+                i = c[e >> 2] | 0;
+                while (1) {
+                  if ((m | 0) >= (b[(i + ((n * 24) | 0) + 4) >> 1] | 0)) break;
+                  c[H >> 2] = EK(c[((c[(i + ((n * 24) | 0)) >> 2] | 0) + ((m * 56) | 0)) >> 2] | 0, c[E >> 2] | 0) | 0;
+                  i = ((c[e >> 2] | 0) + ((n * 24) | 0)) | 0;
+                  g = c[((c[i >> 2] | 0) + ((m * 56) | 0) + 4) >> 2] | 0;
+                  if (!g) {
+                    h[N >> 3] = +h[M >> 3];
+                    c[I >> 2] = c[L >> 2];
+                    c[G >> 2] = c[F >> 2];
+                    c[x >> 2] = (c[x >> 2] & -128) | (c[w >> 2] & 127);
+                  } else {
+                    g = c[(g + 24) >> 2] & 127;
+                    if (!g) g = c[w >> 2] & 127;
+                    c[x >> 2] = (c[x >> 2] & -128) | g;
+                    r = c[((c[i >> 2] | 0) + ((m * 56) | 0) + 4) >> 2] | 0;
+                    h[N >> 3] = +h[((+h[(r + 16) >> 3] > 0.0 ? r : L) + 16) >> 3];
+                    c[I >> 2] = c[((c[r >> 2] | 0) == 0 ? L : r) >> 2];
+                    c[G >> 2] = c[(((c[(r + 4) >> 2] | 0) == 0 ? L : r) + 4) >> 2];
+                  }
+                  i = c[y >> 2] | 0;
+                  c[z >> 2] = nb[c[i >> 2] & 63](i, I, 1) | 0;
+                  LO(J, d, H);
+                  Q = +h[J >> 3];
+                  o = +h[v >> 3];
+                  U1(c[((c[((c[e >> 2] | 0) + ((n * 24) | 0)) >> 2] | 0) + ((m * 56) | 0)) >> 2] | 0);
+                  i = c[e >> 2] | 0;
+                  r = c[(i + ((n * 24) | 0)) >> 2] | 0;
+                  c[(r + ((m * 56) | 0)) >> 2] = c[H >> 2];
+                  h[(r + ((m * 56) | 0) + 32) >> 3] = Q;
+                  h[(r + ((m * 56) | 0) + 16) >> 3] = +h[A >> 3];
+                  h[(r + ((m * 56) | 0) + 24) >> 3] = +h[B >> 3];
+                  c[(r + ((m * 56) | 0) + 4) >> 2] = c[z >> 2];
+                  c[(r + ((m * 56) | 0) + 8) >> 2] = c[C >> 2];
+                  c[(r + ((m * 56) | 0) + 12) >> 2] = c[D >> 2];
+                  P = +h[N >> 3];
+                  R = +h[B >> 3];
+                  k = R > k ? R : k;
+                  q = Q + q;
+                  m = (m + 1) | 0;
+                  p = P > p ? P : p;
+                  j = o > j ? o : j;
+                }
+                h[(i + ((n * 24) | 0) + 8) >> 3] = q;
+                g = (n | 0) == 0;
+                do
+                  if (f)
+                    if (g) {
+                      o = p;
+                      k = p - k;
+                      g = i;
+                      break;
+                    } else {
+                      o = p;
+                      k = t - u + p - k;
+                      g = (i + ((n * 24) | 0)) | 0;
+                      break;
+                    }
+                  else {
+                    o = j;
+                    k = g ? p : j;
+                    g = (i + ((n * 24) | 0)) | 0;
+                  }
+                while (0);
+                h[(g + 16) >> 3] = k;
+                s = q > s ? q : s;
+                t = o + t;
+                u = +h[(i + ((n * 24) | 0) + 16) >> 3] + u;
+                n = (n + 1) | 0;
+                g = b[K >> 1] | 0;
+              }
+              h[(e + 24) >> 3] = s;
+              h[(e + 32) >> 3] = (g << 16) >> 16 == 1 ? j : t;
+              l = O;
+              return;
+            }
+            function IU(e, f, g) {
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0.0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0.0,
+                A = 0.0;
+              y = l;
+              l = (l + 64) | 0;
+              v = (y + 32) | 0;
+              x = y;
+              j = (e + 24) | 0;
+              if ((c[j >> 2] | 0) == 0 ? ((i = c[((c[(e + 96) >> 2] | 0) + 24) >> 2] | 0), i | 0) : 0)
+                c[j >> 2] = D4(i) | 0;
+              t = (e + 36) | 0;
+              w = b[t >> 1] | 0;
+              i = w & 65535;
+              a: do
+                if (i & 1) {
+                  k = +h[(e + 64) >> 3];
+                  q = +h[(e + 72) >> 3];
+                  j = (f + 16) | 0;
+                  m = +h[j >> 3];
+                  o = +h[f >> 3];
+                  n = m - o - k;
+                  b: do
+                    if (n > 0.0)
+                      switch (i & 6) {
+                        case 4: {
+                          m = o + k;
+                          h[j >> 3] = m;
+                          k = o;
+                          break b;
+                        }
+                        case 2: {
+                          m = n + m;
+                          h[j >> 3] = m;
+                          k = o + n;
+                          h[f >> 3] = k;
+                          break b;
+                        }
+                        default: {
+                          p = n * 0.5;
+                          k = p + o;
+                          h[f >> 3] = k;
+                          m = m - p;
+                          h[j >> 3] = m;
+                          break b;
+                        }
+                      }
+                    else k = o;
+                  while (0);
+                  i = (f + 24) | 0;
+                  p = +h[i >> 3];
+                  j = (f + 8) | 0;
+                  n = +h[j >> 3];
+                  o = p - n - q;
+                  if (o > 0.0)
+                    switch (w & 24) {
+                      case 16: {
+                        o = n + q;
+                        h[i >> 3] = o;
+                        break a;
+                      }
+                      case 8: {
+                        q = o + p;
+                        h[i >> 3] = q;
+                        n = n + o;
+                        h[j >> 3] = n;
+                        o = q;
+                        break a;
+                      }
+                      default: {
+                        o = o * 0.5;
+                        n = o + n;
+                        h[j >> 3] = n;
+                        o = p - o;
+                        h[i >> 3] = o;
+                        break a;
+                      }
+                    }
+                  else o = p;
+                } else {
+                  k = +h[f >> 3];
+                  n = +h[(f + 8) >> 3];
+                  m = +h[(f + 16) >> 3];
+                  o = +h[(f + 24) >> 3];
+                }
+              while (0);
+              s = (e + 48) | 0;
+              c[s >> 2] = c[f >> 2];
+              c[(s + 4) >> 2] = c[(f + 4) >> 2];
+              c[(s + 8) >> 2] = c[(f + 8) >> 2];
+              c[(s + 12) >> 2] = c[(f + 12) >> 2];
+              c[(s + 16) >> 2] = c[(f + 16) >> 2];
+              c[(s + 20) >> 2] = c[(f + 20) >> 2];
+              c[(s + 24) >> 2] = c[(f + 24) >> 2];
+              c[(s + 28) >> 2] = c[(f + 28) >> 2];
+              a[(e + 35) >> 0] = g;
+              A = +(d[(e + 33) >> 0] | 0);
+              z = +(d[(e + 34) >> 0] | 0);
+              p = k + A + z;
+              h[x >> 3] = p;
+              q = n + A + z;
+              s = (x + 8) | 0;
+              h[s >> 3] = q;
+              n = m - A - z;
+              f = (x + 16) | 0;
+              h[f >> 3] = n;
+              o = o - A - z;
+              r = (x + 24) | 0;
+              h[r >> 3] = o;
+              j = (e + 88) | 0;
+              switch (a[(e + 92) >> 0] | 0) {
+                case 1: {
+                  w = c[j >> 2] | 0;
+                  c[v >> 2] = c[x >> 2];
+                  c[(v + 4) >> 2] = c[(x + 4) >> 2];
+                  c[(v + 8) >> 2] = c[(x + 8) >> 2];
+                  c[(v + 12) >> 2] = c[(x + 12) >> 2];
+                  c[(v + 16) >> 2] = c[(x + 16) >> 2];
+                  c[(v + 20) >> 2] = c[(x + 20) >> 2];
+                  c[(v + 24) >> 2] = c[(x + 24) >> 2];
+                  c[(v + 28) >> 2] = c[(x + 28) >> 2];
+                  GU(w, v, g);
+                  break;
+                }
+                case 3: {
+                  i = c[j >> 2] | 0;
+                  k = +h[(i + 24) >> 3];
+                  m = n - p - +h[(i + 16) >> 3];
+                  c: do
+                    if (m > 0.0)
+                      switch (w & 6) {
+                        case 4: {
+                          h[f >> 3] = n - m;
+                          break c;
+                        }
+                        case 2: {
+                          h[x >> 3] = m + p;
+                          break c;
+                        }
+                        default:
+                          break c;
+                      }
+                  while (0);
+                  k = o - q - k;
+                  d: do
+                    if (k > 0.0)
+                      switch (w & 24) {
+                        case 16: {
+                          h[r >> 3] = o - k;
+                          break d;
+                        }
+                        case 8: {
+                          h[s >> 3] = k + q;
+                          break d;
+                        }
+                        default:
+                          break d;
+                      }
+                  while (0);
+                  c[v >> 2] = c[x >> 2];
+                  c[(v + 4) >> 2] = c[(x + 4) >> 2];
+                  c[(v + 8) >> 2] = c[(x + 8) >> 2];
+                  c[(v + 12) >> 2] = c[(x + 12) >> 2];
+                  c[(v + 16) >> 2] = c[(x + 16) >> 2];
+                  c[(v + 20) >> 2] = c[(x + 20) >> 2];
+                  c[(v + 24) >> 2] = c[(x + 24) >> 2];
+                  c[(v + 28) >> 2] = c[(x + 28) >> 2];
+                  JU(i, v);
+                  break;
+                }
+                default: {
+                  i = c[j >> 2] | 0;
+                  k = +h[(i + 32) >> 3];
+                  m = n - p - +h[(i + 24) >> 3];
+                  e: do
+                    if (m > 0.0 ? ((u = w & 6), (u << 16) >> 16 != 6) : 0)
+                      switch (u & 7) {
+                        case 4: {
+                          h[f >> 3] = n - m;
+                          break e;
+                        }
+                        case 2: {
+                          h[x >> 3] = m + p;
+                          break e;
+                        }
+                        default: {
+                          A = m * 0.5;
+                          h[x >> 3] = A + p;
+                          h[f >> 3] = n - A;
+                          break e;
+                        }
+                      }
+                  while (0);
+                  k = o - q - k;
+                  f: do
+                    if (k > 0.0)
+                      switch (w & 24) {
+                        case 16: {
+                          h[r >> 3] = o - k;
+                          break f;
+                        }
+                        case 8: {
+                          h[s >> 3] = k + q;
+                          break f;
+                        }
+                        default: {
+                          A = k * 0.5;
+                          h[s >> 3] = A + q;
+                          h[r >> 3] = o - A;
+                          break f;
+                        }
+                      }
+                  while (0);
+                  w = (i + 8) | 0;
+                  c[w >> 2] = c[x >> 2];
+                  c[(w + 4) >> 2] = c[(x + 4) >> 2];
+                  c[(w + 8) >> 2] = c[(x + 8) >> 2];
+                  c[(w + 12) >> 2] = c[(x + 12) >> 2];
+                  c[(w + 16) >> 2] = c[(x + 16) >> 2];
+                  c[(w + 20) >> 2] = c[(x + 20) >> 2];
+                  c[(w + 24) >> 2] = c[(x + 24) >> 2];
+                  c[(w + 28) >> 2] = c[(x + 28) >> 2];
+                  x = b[t >> 1] & 768;
+                  KU(c[j >> 2] | 0, (x & 1023) == 512 ? 108 : (x & 1023) == 256 ? 114 : 110);
+                }
+              }
+              l = y;
+              return;
+            }
+            function JU(a, b) {
+              a = a | 0;
+              b = b | 0;
+              c[a >> 2] = c[b >> 2];
+              c[(a + 4) >> 2] = c[(b + 4) >> 2];
+              c[(a + 8) >> 2] = c[(b + 8) >> 2];
+              c[(a + 12) >> 2] = c[(b + 12) >> 2];
+              c[(a + 16) >> 2] = c[(b + 16) >> 2];
+              c[(a + 20) >> 2] = c[(b + 20) >> 2];
+              c[(a + 24) >> 2] = c[(b + 24) >> 2];
+              c[(a + 28) >> 2] = c[(b + 28) >> 2];
+              return;
+            }
+            function KU(d, e) {
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              g = b[(d + 4) >> 1] | 0;
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (g | 0)) break;
+                h = ((c[d >> 2] | 0) + ((f * 24) | 0) + 6) | 0;
+                if (!(a[h >> 0] | 0)) a[h >> 0] = e;
+                f = (f + 1) | 0;
+              }
+              return;
+            }
+            function LU(d, f, g) {
+              d = d | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0;
+              l = (f + 84) | 0;
+              t = c[l >> 2] | 0;
+              u = KL() | 0;
+              v = PU() | 0;
+              i = 0;
+              h = 0;
+              k = Tz(t) | 0;
+              while (1) {
+                if (!k) break;
+                j = Tz(c[(k + 8) >> 2] | 0) | 0;
+                while (1) {
+                  if (!j) break;
+                  j = c[j >> 2] | 0;
+                  i = (i + 1) | 0;
+                }
+                h = (h + 1) | 0;
+                if (a[(k + 12) >> 0] | 0) TU(v, h);
+                k = c[k >> 2] | 0;
+              }
+              h = JK(((i << 2) + 4) | 0) | 0;
+              c[l >> 2] = h;
+              i = 0;
+              j = 0;
+              k = 0;
+              q = 0;
+              r = Tz(t) | 0;
+              while (1) {
+                if (!r) break;
+                s = q & 65535;
+                p = 0;
+                o = Tz(c[(r + 8) >> 2] | 0) | 0;
+                while (1) {
+                  if (!o) break;
+                  n = c[(o + 8) >> 2] | 0;
+                  c[h >> 2] = n;
+                  k = MU(d, n, f, g) | 0 | k;
+                  l = NU(u, q, p, n) | 0;
+                  b[(n + 86) >> 1] = s;
+                  b[(n + 84) >> 1] = l;
+                  l = (l + (e[(n + 80) >> 1] | 0)) | 0;
+                  m = (q + (e[(n + 82) >> 1] | 0)) | 0;
+                  if (UU(v, m) | 0) {
+                    p = (n + 100) | 0;
+                    a[p >> 0] = a[p >> 0] | 2;
+                  }
+                  p = l;
+                  h = (h + 4) | 0;
+                  o = c[o >> 2] | 0;
+                  i = (l | 0) > (i | 0) ? l : i;
+                  j = (m | 0) > (j | 0) ? m : j;
+                }
+                q = (q + 1) | 0;
+                r = c[r >> 2] | 0;
+              }
+              c[(f + 100) >> 2] = j;
+              c[(f + 104) >> 2] = i;
+              Rz(t) | 0;
+              Rz(v) | 0;
+              NL(u);
+              return k | 0;
+            }
+            function MU(f, g, i, j) {
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              j = j | 0;
+              var k = 0.0,
+                m = 0.0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0.0;
+              u = l;
+              l = (l + 16) | 0;
+              t = (u + 8) | 0;
+              s = u;
+              c[(g + 96) >> 2] = i;
+              q = (g + 36) | 0;
+              o = b[q >> 1] | 0;
+              if (!(o & 64)) {
+                if (!(b[(i + 36) >> 1] & 64)) n = 2;
+                else n = a[(i + 34) >> 0] | 0;
+                a[(g + 34) >> 0] = n;
+              }
+              if (!(o & 32)) {
+                n = a[(i + 88) >> 0] | 0;
+                if ((n << 24) >> 24 <= -1)
+                  if (!(b[(i + 36) >> 1] & 32)) n = 1;
+                  else n = a[(i + 33) >> 0] | 0;
+                a[(g + 33) >> 0] = n;
+              }
+              n = (g + 88) | 0;
+              p = (g + 92) | 0;
+              switch (a[p >> 0] | 0) {
+                case 1: {
+                  o = EU(f, c[n >> 2] | 0, g, j) | 0;
+                  i = c[n >> 2] | 0;
+                  n = o;
+                  o = (i + 64) | 0;
+                  i = (i + 72) | 0;
+                  break;
+                }
+                case 3: {
+                  o = OU(c[n >> 2] | 0, j) | 0;
+                  i = c[n >> 2] | 0;
+                  n = o;
+                  o = (i + 16) | 0;
+                  i = (i + 24) | 0;
+                  break;
+                }
+                default: {
+                  HU(c[((c[(f + 16) >> 2] | 0) + 144) >> 2] | 0, c[n >> 2] | 0, j);
+                  i = c[n >> 2] | 0;
+                  n = 0;
+                  o = (i + 24) | 0;
+                  i = (i + 32) | 0;
+                }
+              }
+              k = +((((d[(g + 33) >> 0] | 0) + (d[(g + 34) >> 0] | 0)) << 1) | 0);
+              m = +h[o >> 3] + k;
+              k = +h[i >> 3] + k;
+              i = (g + 38) | 0;
+              do
+                if (b[q >> 1] & 1) {
+                  o = b[i >> 1] | 0;
+                  if ((o << 16) >> 16 ? ((r = b[(g + 40) >> 1] | 0), (r << 16) >> 16) : 0) {
+                    if (!((m > +(o & 65535)) | (k > +(r & 65535)))) {
+                      m = 0.0;
+                      k = 0.0;
+                      break;
+                    }
+                    if ((a[p >> 0] | 0) == 3) {
+                      m = 0.0;
+                      k = 0.0;
+                      break;
+                    }
+                    gA(0, 137614, s) | 0;
+                    n = 1;
+                    m = 0.0;
+                    k = 0.0;
+                    break;
+                  }
+                  gA(0, 137647, t) | 0;
+                  n = 1;
+                }
+              while (0);
+              v = +(e[i >> 1] | 0);
+              h[(g + 64) >> 3] = m > v ? m : v;
+              m = +(e[(g + 40) >> 1] | 0);
+              h[(g + 72) >> 3] = k > m ? k : m;
+              l = u;
+              return n | 0;
+            }
+            function NU(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              j = (d + 80) | 0;
+              i = ((e[j >> 1] | 0) + -1) | 0;
+              h = 0;
+              a: while (1) {
+                f = c;
+                while (1) {
+                  if (h) break a;
+                  g = (i + f) | 0;
+                  while (1) {
+                    if ((g | 0) < (f | 0)) {
+                      c = f;
+                      h = 1;
+                      continue a;
+                    }
+                    if (SL(a, g, b) | 0) break;
+                    g = (g + -1) | 0;
+                  }
+                  f = (g + 1) | 0;
+                }
+              }
+              h = (d + 82) | 0;
+              f = c;
+              while (1) {
+                if ((f | 0) < ((c + (e[j >> 1] | 0)) | 0)) g = b;
+                else break;
+                while (1) {
+                  if ((g | 0) >= (((e[h >> 1] | 0) + b) | 0)) break;
+                  QL(a, f, g);
+                  g = (g + 1) | 0;
+                }
+                f = (f + 1) | 0;
+              }
+              return c | 0;
+            }
+            function OU(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              m = l;
+              l = (l + 16) | 0;
+              j = m;
+              i = (m + 8) | 0;
+              d = (d + 52) | 0;
+              g = (b + 32) | 0;
+              RF(i, c[d >> 2] | 0, c[g >> 2] | 0);
+              k = c[i >> 2] | 0;
+              i = c[(i + 4) >> 2] | 0;
+              if (((i & k) | 0) == -1) {
+                c[j >> 2] = c[g >> 2];
+                gA(1, 137697, j) | 0;
+                d = 1;
+                f = 0.0;
+                e = 0.0;
+              } else {
+                a[((c[((c[d >> 2] | 0) + 16) >> 2] | 0) + 114) >> 0] = 1;
+                d = 0;
+                f = +(i | 0);
+                e = +(k | 0);
+              }
+              c[b >> 2] = 0;
+              c[(b + 4) >> 2] = 0;
+              c[(b + 8) >> 2] = 0;
+              c[(b + 12) >> 2] = 0;
+              h[(b + 16) >> 3] = e;
+              h[(b + 24) >> 3] = f;
+              l = m;
+              return d | 0;
+            }
+            function PU() {
+              return Vz(55924, c[4581] | 0) | 0;
+            }
+            function QU(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              d = JK(12) | 0;
+              c[d >> 2] = c[b >> 2];
+              return d | 0;
+            }
+            function RU(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              U1(b);
+              return;
+            }
+            function SU(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              b = c[b >> 2] | 0;
+              e = c[d >> 2] | 0;
+              return ((b | 0) > (e | 0) ? 1 : (((b | 0) < (e | 0)) << 31) >> 31) | 0;
+            }
+            function TU(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = l;
+              l = (l + 16) | 0;
+              e = d;
+              c[e >> 2] = b;
+              nb[c[a >> 2] & 63](a, e, 1) | 0;
+              l = d;
+              return;
+            }
+            function UU(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = l;
+              l = (l + 16) | 0;
+              e = d;
+              c[e >> 2] = b;
+              b = ((nb[c[a >> 2] & 63](a, e, 512) | 0) != 0) & 1;
+              l = d;
+              return b | 0;
+            }
+            function VU(a) {
+              a = a | 0;
+              var b = 0;
+              if (!(c[47375] | 0)) {
+                b = JK(((a << 2) + 4) | 0) | 0;
+                c[47375] = b;
+                c[b >> 2] = 189504;
+                c[47386] = a;
+              }
+              c[47387] = 0;
+              return;
+            }
+            function WU() {
+              U1(c[47375] | 0);
+              c[47375] = 0;
+              c[47387] = 0;
+              return;
+            }
+            function XU() {
+              c[47387] = 0;
+              return;
+            }
+            function YU() {
+              var a = 0,
+                b = 0,
+                d = 0;
+              b = c[47387] | 0;
+              d = c[47375] | 0;
+              a = 1;
+              while (1) {
+                if ((a | 0) > (b | 0)) {
+                  a = 5;
+                  break;
+                }
+                if ((c[((c[(d + (a << 2)) >> 2] | 0) + 4) >> 2] | 0) == (a | 0)) a = (a + 1) | 0;
+                else {
+                  a = 4;
+                  break;
+                }
+              }
+              if ((a | 0) == 4) qa(138394, 137741, 59, 137747);
+              else if ((a | 0) == 5) return;
+            }
+            function ZU(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              f = c[47375] | 0;
+              g = c[(f + (a << 2)) >> 2] | 0;
+              h = c[g >> 2] | 0;
+              while (1) {
+                b = ((a | 0) / 2) | 0;
+                d = c[(f + (b << 2)) >> 2] | 0;
+                e = (f + (a << 2)) | 0;
+                if ((c[d >> 2] | 0) >= (h | 0)) break;
+                c[e >> 2] = d;
+                c[(d + 4) >> 2] = a;
+                a = b;
+              }
+              c[e >> 2] = g;
+              c[(g + 4) >> 2] = a;
+              return;
+            }
+            function _U(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              d = l;
+              l = (l + 16) | 0;
+              b = c[47387] | 0;
+              if ((b | 0) == (c[47386] | 0)) {
+                gA(1, 137755, d) | 0;
+                a = 1;
+              } else {
+                b = (b + 1) | 0;
+                c[47387] = b;
+                c[((c[47375] | 0) + (b << 2)) >> 2] = a;
+                ZU(b);
+                YU();
+                a = 0;
+              }
+              l = d;
+              return a | 0;
+            }
+            function $U(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              e = c[47375] | 0;
+              f = c[(e + (a << 2)) >> 2] | 0;
+              g = c[f >> 2] | 0;
+              h = c[47387] | 0;
+              i = ((h | 0) / 2) | 0;
+              while (1) {
+                if ((a | 0) > (i | 0)) break;
+                d = a << 1;
+                b = c[(e + (d << 2)) >> 2] | 0;
+                if ((d | 0) < (h | 0)) {
+                  l = d | 1;
+                  j = c[(e + (l << 2)) >> 2] | 0;
+                  k = (c[b >> 2] | 0) < (c[j >> 2] | 0);
+                  d = k ? l : d;
+                  b = k ? j : b;
+                }
+                if ((g | 0) >= (c[b >> 2] | 0)) break;
+                c[(e + (a << 2)) >> 2] = b;
+                c[(b + 4) >> 2] = a;
+                a = d;
+              }
+              c[(e + (a << 2)) >> 2] = f;
+              c[(f + 4) >> 2] = a;
+              return;
+            }
+            function aV() {
+              var a = 0,
+                b = 0,
+                d = 0,
+                e = 0;
+              b = c[47387] | 0;
+              if (!b) a = 0;
+              else {
+                e = c[47375] | 0;
+                d = (e + 4) | 0;
+                a = c[d >> 2] | 0;
+                c[d >> 2] = c[(e + (b << 2)) >> 2];
+                b = (b + -1) | 0;
+                c[47387] = b;
+                if (b | 0) $U(1);
+                YU();
+              }
+              return a | 0;
+            }
+            function bV(a, b) {
+              a = a | 0;
+              b = b | 0;
+              c[a >> 2] = b;
+              ZU(c[(a + 4) >> 2] | 0);
+              YU();
+              return;
+            }
+            function cV(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              m = (b + 16) | 0;
+              j = c[m >> 2] | 0;
+              j =
+                (a[(j + (((c[(e + 12) >> 2] | 0) * 40) | 0) + 36) >> 0] | 0) !=
+                (a[(j + (((c[(e + 16) >> 2] | 0) * 40) | 0) + 36) >> 0] | 0);
+              k = ~~((+h[(d + 64) >> 3] + -3.0 - +h[(d + 48) >> 3]) * 0.5);
+              l = ~~((+h[(d + 56) >> 3] + -3.0 - +h[(d + 40) >> 3]) * 0.5);
+              g = (k | 0) < (l | 0) ? k : l;
+              n = (d + 4) | 0;
+              f = 0;
+              while (1) {
+                b = c[n >> 2] | 0;
+                if ((f | 0) >= (b | 0)) {
+                  g = f;
+                  break;
+                }
+                i = c[(d + 8 + (f << 2)) >> 2] | 0;
+                o = c[m >> 2] | 0;
+                if (
+                  (a[(o + (((c[(i + 12) >> 2] | 0) * 40) | 0) + 36) >> 0] | 0) ==
+                  (a[(o + (((c[(i + 16) >> 2] | 0) * 40) | 0) + 36) >> 0] | 0)
+                ) {
+                  g = f;
+                  break;
+                }
+                dV(i, g);
+                f = (f + 1) | 0;
+              }
+              while (1) {
+                if ((g | 0) >= (b | 0)) break;
+                f = c[(d + 8 + (g << 2)) >> 2] | 0;
+                if (j | ((f | 0) == (e | 0))) {
+                  dV(f, a[((c[m >> 2] | 0) + (((c[(f + 12) >> 2] | 0) * 40) | 0) + 36) >> 0] | 0 ? k : l);
+                  b = c[n >> 2] | 0;
+                }
+                g = (g + 1) | 0;
+              }
+              return;
+            }
+            function dV(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = (a + 8) | 0;
+              e = c[d >> 2] | 0;
+              c[d >> 2] = e + 1;
+              if ((e | 0) >= (b | 0)) {
+                c[d >> 2] = 0;
+                h[a >> 3] = +h[a >> 3] + 16384.0;
+              }
+              return;
+            }
+            function eV(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0.0,
+                z = 0.0,
+                A = 0.0,
+                B = 0.0,
+                C = 0,
+                D = 0,
+                E = 0.0;
+              x = l;
+              l = (l + 112) | 0;
+              u = (x + 64) | 0;
+              t = (x + 96) | 0;
+              m = (x + 32) | 0;
+              v = x;
+              w = JK(28) | 0;
+              b = tB(a) | 0;
+              s = (w + 4) | 0;
+              c[s >> 2] = b;
+              b = JK((b * 72) | 0) | 0;
+              r = (w + 12) | 0;
+              c[r >> 2] = b;
+              e = (v + 8) | 0;
+              h[e >> 3] = 1797693134862315708145274.0e284;
+              h[v >> 3] = 1797693134862315708145274.0e284;
+              f = (v + 24) | 0;
+              h[f >> 3] = -1797693134862315708145274.0e284;
+              g = (v + 16) | 0;
+              h[g >> 3] = -1797693134862315708145274.0e284;
+              i = (m + 16) | 0;
+              j = (m + 8) | 0;
+              k = (m + 24) | 0;
+              d = jC(a) | 0;
+              n = 1797693134862315708145274.0e284;
+              o = 1797693134862315708145274.0e284;
+              p = -1797693134862315708145274.0e284;
+              q = -1797693134862315708145274.0e284;
+              while (1) {
+                if (!d) break;
+                C = (d + 16) | 0;
+                D = c[C >> 2] | 0;
+                z = (+h[(D + 96) >> 3] + +h[(D + 88) >> 3]) * 0.5;
+                z = z < 1.0 ? 1.0 : z;
+                y = +h[(D + 80) >> 3] * 0.5;
+                y = y < 1.0 ? 1.0 : y;
+                E = +h[(D + 16) >> 3];
+                B = E - z;
+                h[m >> 3] = B;
+                z = E + z;
+                h[i >> 3] = z;
+                E = +h[(D + 24) >> 3];
+                A = E - y;
+                h[j >> 3] = A;
+                y = E + y;
+                h[k >> 3] = y;
+                B = +h[(n < B ? v : m) >> 3];
+                h[v >> 3] = B;
+                A = +h[((o < A ? v : m) + 8) >> 3];
+                h[e >> 3] = A;
+                z = +h[((p > z ? v : m) + 16) >> 3];
+                h[g >> 3] = z;
+                y = +h[((q > y ? v : m) + 24) >> 3];
+                h[f >> 3] = y;
+                D = (b + 40) | 0;
+                c[D >> 2] = c[m >> 2];
+                c[(D + 4) >> 2] = c[(m + 4) >> 2];
+                c[(D + 8) >> 2] = c[(m + 8) >> 2];
+                c[(D + 12) >> 2] = c[(m + 12) >> 2];
+                c[(D + 16) >> 2] = c[(m + 16) >> 2];
+                c[(D + 20) >> 2] = c[(m + 20) >> 2];
+                c[(D + 24) >> 2] = c[(m + 24) >> 2];
+                c[(D + 28) >> 2] = c[(m + 28) >> 2];
+                c[b >> 2] = c[b >> 2] | 1;
+                c[((c[C >> 2] | 0) + 112) >> 2] = b;
+                b = (b + 72) | 0;
+                d = kC(a, d) | 0;
+                n = B;
+                o = A;
+                p = z;
+                q = y;
+              }
+              h[v >> 3] = n + -36.0;
+              h[e >> 3] = o + -36.0;
+              h[g >> 3] = p + 36.0;
+              h[f >> 3] = q + 36.0;
+              D = c[r >> 2] | 0;
+              f = c[s >> 2] | 0;
+              c[u >> 2] = c[v >> 2];
+              c[(u + 4) >> 2] = c[(v + 4) >> 2];
+              c[(u + 8) >> 2] = c[(v + 8) >> 2];
+              c[(u + 12) >> 2] = c[(v + 12) >> 2];
+              c[(u + 16) >> 2] = c[(v + 16) >> 2];
+              c[(u + 20) >> 2] = c[(v + 20) >> 2];
+              c[(u + 24) >> 2] = c[(v + 24) >> 2];
+              c[(u + 28) >> 2] = c[(v + 28) >> 2];
+              f = oV(D, f, t, u) | 0;
+              if ((c[47323] & 1) | 0) {
+                r = c[r >> 2] | 0;
+                C = c[s >> 2] | 0;
+                D = c[t >> 2] | 0;
+                c[u >> 2] = c[v >> 2];
+                c[(u + 4) >> 2] = c[(v + 4) >> 2];
+                c[(u + 8) >> 2] = c[(v + 8) >> 2];
+                c[(u + 12) >> 2] = c[(v + 12) >> 2];
+                c[(u + 16) >> 2] = c[(v + 16) >> 2];
+                c[(u + 20) >> 2] = c[(v + 20) >> 2];
+                c[(u + 24) >> 2] = c[(v + 24) >> 2];
+                c[(u + 28) >> 2] = c[(v + 28) >> 2];
+                fV(r, C, u, f, D);
+              }
+              e = (w + 8) | 0;
+              c[e >> 2] = JK(((c[t >> 2] | 0) * 72) | 0) | 0;
+              c[w >> 2] = c[t >> 2];
+              d = c[t >> 2] | 0;
+              b = 0;
+              while (1) {
+                if ((b | 0) >= (d | 0)) break;
+                D = ((c[e >> 2] | 0) + ((b * 72) | 0) + 40) | 0;
+                C = (f + (b << 5)) | 0;
+                c[D >> 2] = c[C >> 2];
+                c[(D + 4) >> 2] = c[(C + 4) >> 2];
+                c[(D + 8) >> 2] = c[(C + 8) >> 2];
+                c[(D + 12) >> 2] = c[(C + 12) >> 2];
+                c[(D + 16) >> 2] = c[(C + 16) >> 2];
+                c[(D + 20) >> 2] = c[(C + 20) >> 2];
+                c[(D + 24) >> 2] = c[(C + 24) >> 2];
+                c[(D + 28) >> 2] = c[(C + 28) >> 2];
+                b = (b + 1) | 0;
+              }
+              U1(f);
+              c[u >> 2] = c[v >> 2];
+              c[(u + 4) >> 2] = c[(v + 4) >> 2];
+              c[(u + 8) >> 2] = c[(v + 8) >> 2];
+              c[(u + 12) >> 2] = c[(v + 12) >> 2];
+              c[(u + 16) >> 2] = c[(v + 16) >> 2];
+              c[(u + 20) >> 2] = c[(v + 20) >> 2];
+              c[(u + 24) >> 2] = c[(v + 24) >> 2];
+              c[(u + 28) >> 2] = c[(v + 28) >> 2];
+              c[(w + 16) >> 2] = gV(w, u) | 0;
+              l = x;
+              return w | 0;
+            }
+            function fV(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0.0,
+                m = 0.0,
+                n = 0.0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0.0,
+                u = 0.0,
+                v = 0.0;
+              q = l;
+              l = (l + 128) | 0;
+              p = (q + 96) | 0;
+              o = (q + 64) | 0;
+              j = (q + 32) | 0;
+              r = (q + 16) | 0;
+              s = q;
+              m = +h[(d + 16) >> 3];
+              n = +h[d >> 3];
+              k = +h[(d + 24) >> 3];
+              g = +h[(d + 8) >> 3];
+              i = c[15712] | 0;
+              T4(137770, i) | 0;
+              c[s >> 2] = 10;
+              c[(s + 4) >> 2] = 10;
+              c[(s + 8) >> 2] = ~~(m + 10.0 - n);
+              c[(s + 12) >> 2] = ~~(k + 10.0 - g);
+              w4(i, 138200, s) | 0;
+              h[r >> 3] = 10.0 - n;
+              h[(r + 8) >> 3] = 10.0 - g;
+              w4(i, 138248, r) | 0;
+              T4(138265, i) | 0;
+              d = 0;
+              while (1) {
+                if ((d | 0) >= (b | 0)) break;
+                v = +h[(a + ((d * 72) | 0) + 48) >> 3];
+                u = +h[(a + ((d * 72) | 0) + 56) >> 3];
+                t = +h[(a + ((d * 72) | 0) + 64) >> 3];
+                h[j >> 3] = +h[(a + ((d * 72) | 0) + 40) >> 3];
+                h[(j + 8) >> 3] = v;
+                h[(j + 16) >> 3] = u;
+                h[(j + 24) >> 3] = t;
+                w4(i, 138284, j) | 0;
+                d = (d + 1) | 0;
+              }
+              T4(138302, i) | 0;
+              d = 0;
+              while (1) {
+                if ((d | 0) >= (f | 0)) break;
+                t = +h[(e + (d << 5) + 8) >> 3];
+                u = +h[(e + (d << 5) + 16) >> 3];
+                v = +h[(e + (d << 5) + 24) >> 3];
+                h[o >> 3] = +h[(e + (d << 5)) >> 3];
+                h[(o + 8) >> 3] = t;
+                h[(o + 16) >> 3] = u;
+                h[(o + 24) >> 3] = v;
+                w4(i, 138321, o) | 0;
+                d = (d + 1) | 0;
+              }
+              T4(138339, i) | 0;
+              h[p >> 3] = n;
+              h[(p + 8) >> 3] = g;
+              h[(p + 16) >> 3] = m;
+              h[(p + 24) >> 3] = k;
+              w4(i, 138321, p) | 0;
+              T4(138086, i) | 0;
+              l = q;
+              return;
+            }
+            function gV(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0.0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0;
+              A = l;
+              l = (l + 32) | 0;
+              t = (A + 16) | 0;
+              k = A;
+              w = c[a >> 2] | 0;
+              y = CR((w << 2) | 2) | 0;
+              z = Vz(55960, c[4581] | 0) | 0;
+              v = Vz(55996, c[4581] | 0) | 0;
+              w = JK(w << 7) | 0;
+              f = JK(c[a >> 2] << 4) | 0;
+              x = (a + 8) | 0;
+              g = (b + 16) | 0;
+              i = (k + 8) | 0;
+              j = (b + 24) | 0;
+              m = (b + 8) | 0;
+              d = 0;
+              while (1) {
+                if ((d | 0) >= (c[a >> 2] | 0)) break;
+                n = c[x >> 2] | 0;
+                o = (n + ((d * 72) | 0)) | 0;
+                c[(n + ((d * 72) | 0) + 32) >> 2] = 4;
+                p = (n + ((d * 72) | 0) + 36) | 0;
+                c[p >> 2] = f + ((d << 2) << 2);
+                q = (n + ((d * 72) | 0) + 40) | 0;
+                e = +h[(n + ((d * 72) | 0) + 56) >> 3];
+                if (e < +h[g >> 3]) {
+                  h[k >> 3] = e;
+                  h[i >> 3] = +h[(n + ((d * 72) | 0) + 48) >> 3];
+                  c[t >> 2] = c[k >> 2];
+                  c[(t + 4) >> 2] = c[(k + 4) >> 2];
+                  c[(t + 8) >> 2] = c[(k + 8) >> 2];
+                  c[(t + 12) >> 2] = c[(k + 12) >> 2];
+                  s = hV(y, z, t, w, 1) | 0;
+                  c[(s + 20) >> 2] = o;
+                  c[c[p >> 2] >> 2] = s;
+                }
+                e = +h[(n + ((d * 72) | 0) + 64) >> 3];
+                if (e < +h[j >> 3]) {
+                  h[k >> 3] = +h[q >> 3];
+                  h[i >> 3] = e;
+                  c[t >> 2] = c[k >> 2];
+                  c[(t + 4) >> 2] = c[(k + 4) >> 2];
+                  c[(t + 8) >> 2] = c[(k + 8) >> 2];
+                  c[(t + 12) >> 2] = c[(k + 12) >> 2];
+                  s = hV(y, v, t, w, 0) | 0;
+                  c[(s + 20) >> 2] = o;
+                  c[((c[p >> 2] | 0) + 4) >> 2] = s;
+                }
+                if (+h[q >> 3] > +h[b >> 3]) {
+                  c[t >> 2] = c[q >> 2];
+                  c[(t + 4) >> 2] = c[(q + 4) >> 2];
+                  c[(t + 8) >> 2] = c[(q + 8) >> 2];
+                  c[(t + 12) >> 2] = c[(q + 12) >> 2];
+                  s = hV(y, z, t, w, 1) | 0;
+                  c[(s + 24) >> 2] = o;
+                  c[((c[p >> 2] | 0) + 8) >> 2] = s;
+                }
+                if (+h[(n + ((d * 72) | 0) + 48) >> 3] > +h[m >> 3]) {
+                  c[t >> 2] = c[q >> 2];
+                  c[(t + 4) >> 2] = c[(q + 4) >> 2];
+                  c[(t + 8) >> 2] = c[(q + 8) >> 2];
+                  c[(t + 12) >> 2] = c[(q + 12) >> 2];
+                  s = hV(y, v, t, w, 0) | 0;
+                  c[(s + 24) >> 2] = o;
+                  c[((c[p >> 2] | 0) + 12) >> 2] = s;
+                }
+                d = (d + 1) | 0;
+              }
+              o = JK(c[y >> 2] << 2) | 0;
+              r = (a + 4) | 0;
+              s = (a + 12) | 0;
+              p = (t + 8) | 0;
+              m = 0;
+              q = 0;
+              n = 0;
+              while (1) {
+                d = c[r >> 2] | 0;
+                if ((n | 0) >= (d | 0)) {
+                  b = 0;
+                  break;
+                }
+                g = c[s >> 2] | 0;
+                i = (g + ((n * 72) | 0)) | 0;
+                j = (g + ((n * 72) | 0) + 36) | 0;
+                c[j >> 2] = o + (m << 2);
+                b = (g + ((n * 72) | 0) + 40) | 0;
+                c[t >> 2] = c[b >> 2];
+                c[(t + 4) >> 2] = c[(b + 4) >> 2];
+                c[(t + 8) >> 2] = c[(b + 8) >> 2];
+                c[(t + 12) >> 2] = c[(b + 12) >> 2];
+                b = (g + ((n * 72) | 0) + 56) | 0;
+                k = (g + ((n * 72) | 0) + 32) | 0;
+                d = nb[c[v >> 2] & 63](v, t, 512) | 0;
+                while (1) {
+                  if (!d) break;
+                  if (!(+h[(d + 8) >> 3] < +h[b >> 3])) break;
+                  C = c[d >> 2] | 0;
+                  B = c[j >> 2] | 0;
+                  f = c[k >> 2] | 0;
+                  c[k >> 2] = f + 1;
+                  c[(B + (f << 2)) >> 2] = C;
+                  c[((c[d >> 2] | 0) + 24) >> 2] = i;
+                  d = nb[c[v >> 2] & 63](v, d, 8) | 0;
+                }
+                f = (g + ((n * 72) | 0) + 64) | 0;
+                d = nb[c[z >> 2] & 63](z, t, 512) | 0;
+                while (1) {
+                  if (!d) {
+                    u = 20;
+                    break;
+                  }
+                  e = +h[f >> 3];
+                  if (!(+h[(d + 16) >> 3] < e)) break;
+                  b = c[d >> 2] | 0;
+                  B = c[j >> 2] | 0;
+                  C = c[k >> 2] | 0;
+                  c[k >> 2] = C + 1;
+                  c[(B + (C << 2)) >> 2] = b;
+                  c[((c[d >> 2] | 0) + 24) >> 2] = i;
+                  d = nb[c[z >> 2] & 63](z, d, 8) | 0;
+                }
+                if ((u | 0) == 20) {
+                  u = 0;
+                  e = +h[f >> 3];
+                }
+                h[p >> 3] = e;
+                b = (g + ((n * 72) | 0) + 56) | 0;
+                d = nb[c[v >> 2] & 63](v, t, 512) | 0;
+                while (1) {
+                  if (!d) {
+                    u = 25;
+                    break;
+                  }
+                  e = +h[b >> 3];
+                  if (!(+h[(d + 8) >> 3] < e)) break;
+                  D = c[d >> 2] | 0;
+                  B = c[j >> 2] | 0;
+                  C = c[k >> 2] | 0;
+                  c[k >> 2] = C + 1;
+                  c[(B + (C << 2)) >> 2] = D;
+                  c[((c[d >> 2] | 0) + 20) >> 2] = i;
+                  d = nb[c[v >> 2] & 63](v, d, 8) | 0;
+                }
+                if ((u | 0) == 25) {
+                  u = 0;
+                  e = +h[b >> 3];
+                }
+                h[t >> 3] = e;
+                h[p >> 3] = +h[(g + ((n * 72) | 0) + 48) >> 3];
+                d = nb[c[z >> 2] & 63](z, t, 512) | 0;
+                while (1) {
+                  if (!d) break;
+                  if (!(+h[(d + 16) >> 3] < +h[f >> 3])) break;
+                  B = c[d >> 2] | 0;
+                  C = c[j >> 2] | 0;
+                  D = c[k >> 2] | 0;
+                  c[k >> 2] = D + 1;
+                  c[(C + (D << 2)) >> 2] = B;
+                  c[((c[d >> 2] | 0) + 20) >> 2] = i;
+                  d = nb[c[z >> 2] & 63](z, d, 8) | 0;
+                }
+                D = c[k >> 2] | 0;
+                m = (D + m) | 0;
+                q = (D | 0) > (q | 0) ? D : q;
+                n = (n + 1) | 0;
+              }
+              while (1) {
+                if ((b | 0) >= (d | 0)) break;
+                iV(((c[s >> 2] | 0) + ((b * 72) | 0)) | 0);
+                b = (b + 1) | 0;
+                d = c[r >> 2] | 0;
+              }
+              d = c[y >> 2] | 0;
+              D = c[(y + 16) >> 2] | 0;
+              c[(D + ((d * 40) | 0) + 32) >> 2] = d;
+              d = (d + 1) | 0;
+              c[(D + ((d * 40) | 0) + 32) >> 2] = d;
+              BR(y, q);
+              d = 0;
+              while (1) {
+                if ((d | 0) >= (c[a >> 2] | 0)) break;
+                jV(((c[x >> 2] | 0) + ((d * 72) | 0)) | 0, y);
+                d = (d + 1) | 0;
+              }
+              Rz(z) | 0;
+              Rz(v) | 0;
+              U1(w);
+              kV(y);
+              zR(y);
+              l = A;
+              return y | 0;
+            }
+            function hV(b, d, e, f, g) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0;
+              h = nb[c[d >> 2] & 63](d, e, 512) | 0;
+              do
+                if (!h) {
+                  b = DR(b) | 0;
+                  if (!f) qa(138183, 138131, 291, 138190);
+                  else {
+                    h = c[(b + 32) >> 2] | 0;
+                    i = (f + (h << 5)) | 0;
+                    f = (f + (h << 5) + 8) | 0;
+                    c[f >> 2] = c[e >> 2];
+                    c[(f + 4) >> 2] = c[(e + 4) >> 2];
+                    c[(f + 8) >> 2] = c[(e + 8) >> 2];
+                    c[(f + 12) >> 2] = c[(e + 12) >> 2];
+                    c[i >> 2] = b;
+                    a[(b + 36) >> 0] = g;
+                    nb[c[d >> 2] & 63](d, i, 1) | 0;
+                    break;
+                  }
+                } else i = h;
+              while (0);
+              return c[i >> 2] | 0;
+            }
+            function iV(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0;
+              a: do
+                if ((+h[(b + 64) >> 3] + -3.0 - +h[(b + 48) >> 3]) * 0.5 < 2.0) {
+                  i = c[(b + 32) >> 2] | 0;
+                  j = (b + 36) | 0;
+                  g = 0;
+                  while (1) {
+                    if ((g | 0) >= (i | 0)) break a;
+                    d = c[((c[j >> 2] | 0) + (g << 2)) >> 2] | 0;
+                    b: do
+                      if (a[(d + 36) >> 0] | 0) {
+                        f = c[(d + 20) >> 2] | 0;
+                        if ((f | 0) == (b | 0)) {
+                          e = c[(d + 24) >> 2] | 0;
+                          d = e;
+                          e = c[e >> 2] | 0;
+                          do {
+                            c[d >> 2] = e | 8;
+                            d = c[c[(d + 36) >> 2] >> 2] | 0;
+                            if (!d) break b;
+                            d = c[(d + 24) >> 2] | 0;
+                            e = c[d >> 2] | 0;
+                          } while (!((e & 1) | 0));
+                        } else {
+                          e = f;
+                          d = c[f >> 2] | 0;
+                          do {
+                            c[e >> 2] = d | 8;
+                            d = c[((c[(e + 36) >> 2] | 0) + 8) >> 2] | 0;
+                            if (!d) break b;
+                            e = c[(d + 20) >> 2] | 0;
+                            d = c[e >> 2] | 0;
+                          } while (!((d & 1) | 0));
+                        }
+                      }
+                    while (0);
+                    g = (g + 1) | 0;
+                  }
+                }
+              while (0);
+              c: do
+                if ((+h[(b + 56) >> 3] + -3.0 - +h[(b + 40) >> 3]) * 0.5 < 2.0) {
+                  i = c[(b + 32) >> 2] | 0;
+                  j = (b + 36) | 0;
+                  g = 0;
+                  while (1) {
+                    if ((g | 0) >= (i | 0)) break c;
+                    d = c[((c[j >> 2] | 0) + (g << 2)) >> 2] | 0;
+                    d: do
+                      if (!(a[(d + 36) >> 0] | 0)) {
+                        f = c[(d + 20) >> 2] | 0;
+                        if ((f | 0) == (b | 0)) {
+                          e = c[(d + 24) >> 2] | 0;
+                          d = e;
+                          e = c[e >> 2] | 0;
+                          do {
+                            c[d >> 2] = e | 16;
+                            d = c[((c[(d + 36) >> 2] | 0) + 4) >> 2] | 0;
+                            if (!d) break d;
+                            d = c[(d + 24) >> 2] | 0;
+                            e = c[d >> 2] | 0;
+                          } while (!((e & 1) | 0));
+                        } else {
+                          e = f;
+                          d = c[f >> 2] | 0;
+                          do {
+                            c[e >> 2] = d | 16;
+                            d = c[((c[(e + 36) >> 2] | 0) + 12) >> 2] | 0;
+                            if (!d) break d;
+                            e = c[(d + 20) >> 2] | 0;
+                            d = c[e >> 2] | 0;
+                          } while (!((d & 1) | 0));
+                        }
+                      }
+                    while (0);
+                    g = (g + 1) | 0;
+                  }
+                }
+              while (0);
+              return;
+            }
+            function jV(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0.0,
+                q = 0;
+              g = +h[(a + 56) >> 3] - +h[(a + 40) >> 3];
+              i = +h[(a + 64) >> 3] - +h[(a + 48) >> 3];
+              f = (i + g) * 0.5 + 500.0;
+              if ((i + -3.0) * 0.5 < 2.0) {
+                l = ((c[a >> 2] & 8) | 0) == 0;
+                f = l ? 16384.0 : f;
+                p = l ? 16384.0 : g;
+              } else p = g;
+              if ((g + -3.0) * 0.5 < 2.0) {
+                l = ((c[a >> 2] & 16) | 0) == 0;
+                i = l ? 16384.0 : i;
+                f = l ? 16384.0 : f;
+              }
+              l = (a + 36) | 0;
+              d = c[l >> 2] | 0;
+              e = c[(d + 8) >> 2] | 0;
+              if ((e | 0) != 0 ? ((j = c[(d + 4) >> 2] | 0), (j | 0) != 0) : 0) {
+                j = ER(b, e, j, f) | 0;
+                e = (a + 4) | 0;
+                d = c[e >> 2] | 0;
+                c[e >> 2] = d + 1;
+                c[(a + 8 + (d << 2)) >> 2] = j;
+                d = c[l >> 2] | 0;
+              }
+              e = c[(d + 4) >> 2] | 0;
+              if ((e | 0) != 0 ? ((k = c[d >> 2] | 0), (k | 0) != 0) : 0) {
+                k = ER(b, e, k, f) | 0;
+                j = (a + 4) | 0;
+                d = c[j >> 2] | 0;
+                c[j >> 2] = d + 1;
+                c[(a + 8 + (d << 2)) >> 2] = k;
+                d = c[l >> 2] | 0;
+              }
+              e = c[(d + 8) >> 2] | 0;
+              if ((e | 0) != 0 ? ((m = c[(d + 12) >> 2] | 0), (m | 0) != 0) : 0) {
+                m = ER(b, e, m, f) | 0;
+                k = (a + 4) | 0;
+                d = c[k >> 2] | 0;
+                c[k >> 2] = d + 1;
+                c[(a + 8 + (d << 2)) >> 2] = m;
+                d = c[l >> 2] | 0;
+              }
+              e = c[(d + 12) >> 2] | 0;
+              if ((e | 0) != 0 ? ((n = c[d >> 2] | 0), (n | 0) != 0) : 0) {
+                n = ER(b, e, n, f) | 0;
+                m = (a + 4) | 0;
+                d = c[m >> 2] | 0;
+                c[m >> 2] = d + 1;
+                c[(a + 8 + (d << 2)) >> 2] = n;
+                d = c[l >> 2] | 0;
+              }
+              e = c[(d + 4) >> 2] | 0;
+              if ((e | 0) != 0 ? ((o = c[(d + 12) >> 2] | 0), (o | 0) != 0) : 0) {
+                o = ER(b, e, o, i) | 0;
+                n = (a + 4) | 0;
+                d = c[n >> 2] | 0;
+                c[n >> 2] = d + 1;
+                c[(a + 8 + (d << 2)) >> 2] = o;
+                d = c[l >> 2] | 0;
+              }
+              e = c[(d + 8) >> 2] | 0;
+              if (e | 0 ? ((q = c[d >> 2] | 0), q | 0) : 0) {
+                b = ER(b, e, q, p) | 0;
+                o = (a + 4) | 0;
+                q = c[o >> 2] | 0;
+                c[o >> 2] = q + 1;
+                c[(a + 8 + (q << 2)) >> 2] = b;
+              }
+              return;
+            }
+            function kV(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 16) | 0;
+              i = (j + 8) | 0;
+              h = j;
+              f = (a + 16) | 0;
+              g = c[15712] | 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (c[a >> 2] | 0)) {
+                  b = 10;
+                  break;
+                }
+                b = c[f >> 2] | 0;
+                d = (b + ((e * 40) | 0) + 20) | 0;
+                if ((c[d >> 2] | 0) == 0 ? ((c[h >> 2] = e), w4(g, 138096, h) | 0, (c[d >> 2] | 0) == 0) : 0) {
+                  b = 5;
+                  break;
+                }
+                b = (b + ((e * 40) | 0) + 24) | 0;
+                if ((c[b >> 2] | 0) == 0 ? ((c[i >> 2] = e), w4(g, 138148, i) | 0, (c[b >> 2] | 0) == 0) : 0) {
+                  b = 8;
+                  break;
+                }
+                e = (e + 1) | 0;
+              }
+              if ((b | 0) == 5) qa(138118, 138131, 311, 138138);
+              else if ((b | 0) == 8) qa(138170, 138131, 313, 138138);
+              else if ((b | 0) == 10) {
+                l = j;
+                return;
+              }
+            }
+            function lV(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0;
+              e = +h[(b + 8) >> 3];
+              f = +h[(c + 8) >> 3];
+              if (!(e > f))
+                if (!(e < f)) {
+                  f = +h[b >> 3];
+                  e = +h[c >> 3];
+                  if (f > e) a = 1;
+                  else a = ((f < e) << 31) >> 31;
+                } else a = -1;
+              else a = 1;
+              return a | 0;
+            }
+            function mV(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0;
+              e = +h[b >> 3];
+              f = +h[c >> 3];
+              if (!(e > f))
+                if (!(e < f)) {
+                  f = +h[(b + 8) >> 3];
+                  e = +h[(c + 8) >> 3];
+                  if (f > e) a = 1;
+                  else a = ((f < e) << 31) >> 31;
+                } else a = -1;
+              else a = 1;
+              return a | 0;
+            }
+            function nV(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              d = (a + 8) | 0;
+              U1(c[((c[d >> 2] | 0) + 36) >> 2] | 0);
+              b = (a + 12) | 0;
+              U1(c[((c[b >> 2] | 0) + 36) >> 2] | 0);
+              U1(c[d >> 2] | 0);
+              U1(c[b >> 2] | 0);
+              GR(c[(a + 16) >> 2] | 0);
+              Rz(c[(a + 20) >> 2] | 0) | 0;
+              Rz(c[(a + 24) >> 2] | 0) | 0;
+              U1(a);
+              return;
+            }
+            function oV(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              p = l;
+              l = (l + 32) | 0;
+              h = p;
+              i = b << 2;
+              f = (i + 4) | 0;
+              i = (i + 5) | 0;
+              o = KK((i * 56) | 0) | 0;
+              i = JK(i << 2) | 0;
+              g = (f * 5) | 1;
+              j = KK((g * 72) | 0) | 0;
+              m = g << 5;
+              k = JK(m) | 0;
+              m = JK(m) | 0;
+              c[h >> 2] = c[e >> 2];
+              c[(h + 4) >> 2] = c[(e + 4) >> 2];
+              c[(h + 8) >> 2] = c[(e + 8) >> 2];
+              c[(h + 12) >> 2] = c[(e + 12) >> 2];
+              c[(h + 16) >> 2] = c[(e + 16) >> 2];
+              c[(h + 20) >> 2] = c[(e + 20) >> 2];
+              c[(h + 24) >> 2] = c[(e + 24) >> 2];
+              c[(h + 28) >> 2] = c[(e + 28) >> 2];
+              pV(a, b, h, o, 0);
+              z5(173);
+              qV(f, i);
+              AV(f, o, i, g, j) | 0;
+              n = rV(f, o, j, 0, k) | 0;
+              c[h >> 2] = c[e >> 2];
+              c[(h + 4) >> 2] = c[(e + 4) >> 2];
+              c[(h + 8) >> 2] = c[(e + 8) >> 2];
+              c[(h + 12) >> 2] = c[(e + 12) >> 2];
+              c[(h + 16) >> 2] = c[(e + 16) >> 2];
+              c[(h + 20) >> 2] = c[(e + 20) >> 2];
+              c[(h + 24) >> 2] = c[(e + 24) >> 2];
+              c[(h + 28) >> 2] = c[(e + 28) >> 2];
+              pV(a, b, h, o, 1);
+              qV(f, i);
+              AV(f, o, i, g, j) | 0;
+              f = rV(f, o, j, 1, m) | 0;
+              g = JK(O(n << 5, f) | 0) | 0;
+              b = 0;
+              a = 0;
+              while (1) {
+                if ((b | 0) >= (f | 0)) break;
+                h = (m + (b << 5)) | 0;
+                e = 0;
+                while (1) {
+                  if ((e | 0) >= (n | 0)) break;
+                  q = (a + (((sV((g + (a << 5)) | 0, h, (k + (e << 5)) | 0) | 0) != 0) & 1)) | 0;
+                  e = (e + 1) | 0;
+                  a = q;
+                }
+                b = (b + 1) | 0;
+              }
+              q = MK(g, a << 5) | 0;
+              U1(o);
+              U1(i);
+              U1(j);
+              U1(k);
+              U1(m);
+              c[d >> 2] = a;
+              l = p;
+              return q | 0;
+            }
+            function pV(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              j = l;
+              l = (l + 96) | 0;
+              h = (j + 64) | 0;
+              i = j;
+              c[h >> 2] = c[d >> 2];
+              c[(h + 4) >> 2] = c[(d + 4) >> 2];
+              c[(h + 8) >> 2] = c[(d + 8) >> 2];
+              c[(h + 12) >> 2] = c[(d + 12) >> 2];
+              c[(h + 16) >> 2] = c[(d + 16) >> 2];
+              c[(h + 20) >> 2] = c[(d + 20) >> 2];
+              c[(h + 24) >> 2] = c[(d + 24) >> 2];
+              c[(h + 28) >> 2] = c[(d + 28) >> 2];
+              yV(h, f, 1, i);
+              d = zV(e, 1, i) | 0;
+              g = 0;
+              while (1) {
+                if ((g | 0) >= (b | 0)) break;
+                k = (a + ((g * 72) | 0) + 40) | 0;
+                c[h >> 2] = c[k >> 2];
+                c[(h + 4) >> 2] = c[(k + 4) >> 2];
+                c[(h + 8) >> 2] = c[(k + 8) >> 2];
+                c[(h + 12) >> 2] = c[(k + 12) >> 2];
+                c[(h + 16) >> 2] = c[(k + 16) >> 2];
+                c[(h + 20) >> 2] = c[(k + 20) >> 2];
+                c[(h + 24) >> 2] = c[(k + 24) >> 2];
+                c[(h + 28) >> 2] = c[(k + 28) >> 2];
+                yV(h, f, 0, i);
+                d = zV(e, d, i) | 0;
+                g = (g + 1) | 0;
+              }
+              l = j;
+              return;
+            }
+            function qV(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              d = 0;
+              while (1) {
+                if ((d | 0) > (a | 0)) break;
+                c[(b + (d << 2)) >> 2] = d;
+                d = (d + 1) | 0;
+              }
+              g = (a + 1) | 0;
+              d = 1;
+              while (1) {
+                if ((d | 0) > (a | 0)) break;
+                h = ~~(+B5() * +((g - d) | 0) + +(d | 0));
+                e = (b + (d << 2)) | 0;
+                f = (b + (h << 2)) | 0;
+                if ((d | 0) != (h | 0)) {
+                  h = c[e >> 2] | 0;
+                  c[e >> 2] = c[f >> 2];
+                  c[f >> 2] = h;
+                }
+                d = (d + 1) | 0;
+              }
+              return;
+            }
+            function rV(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              g = (a * 5) | 0;
+              j = (g + 1) | 0;
+              l = JK(j << 2) | 0;
+              c[47388] = JK(j << 4) | 0;
+              c[47389] = JK((((a * 56) | 0) + 56) | 0) | 0;
+              j = JK(a << 2) | 0;
+              c[47390] = j;
+              k = 0;
+              while (1) {
+                if ((k | 0) > (g | 0)) break;
+                if (tV((d + ((k * 72) | 0)) | 0, b) | 0) break;
+                k = (k + 1) | 0;
+              }
+              h = c[47388] | 0;
+              i = c[47389] | 0;
+              g = 1;
+              while (1) {
+                if ((g | 0) > (a | 0)) break;
+                c[(h + (g << 4) + 8) >> 2] = c[(b + ((g * 56) | 0) + 48) >> 2];
+                m = (b + ((g * 56) | 0) + 44) | 0;
+                c[(h + (g << 4) + 4) >> 2] = c[m >> 2];
+                c[(h + (g << 4)) >> 2] = g;
+                n = (i + ((g * 56) | 0)) | 0;
+                o = (b + ((g * 56) | 0)) | 0;
+                c[n >> 2] = c[o >> 2];
+                c[(n + 4) >> 2] = c[(o + 4) >> 2];
+                c[(n + 8) >> 2] = c[(o + 8) >> 2];
+                c[(n + 12) >> 2] = c[(o + 12) >> 2];
+                c[(i + ((g * 56) | 0) + 16) >> 2] = c[m >> 2];
+                c[(i + ((g * 56) | 0) + 32) >> 2] = g;
+                c[(i + ((g * 56) | 0) + 48) >> 2] = 1;
+                g = (g + 1) | 0;
+              }
+              c[47391] = a;
+              c[47392] = 0;
+              c[j >> 2] = 1;
+              g = c[(d + ((k * 72) | 0) + 40) >> 2] | 0;
+              if ((g | 0) <= 0) {
+                g = c[(d + ((k * 72) | 0) + 48) >> 2] | 0;
+                if ((g | 0) > 0) g = uV(l, f, 0, b, d, 0, k, g, e, 2) | 0;
+                else g = 0;
+              } else g = uV(l, f, 0, b, d, 0, k, g, e, 1) | 0;
+              U1(l);
+              U1(c[47388] | 0);
+              U1(c[47389] | 0);
+              U1(c[47390] | 0);
+              return g | 0;
+            }
+            function sV(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0.0,
+                g = 0.0;
+              g = +h[(+h[b >> 3] > +h[c >> 3] ? b : c) >> 3];
+              f = +h[((+h[(b + 16) >> 3] < +h[(c + 16) >> 3] ? b : c) + 16) >> 3];
+              h[(a + 16) >> 3] = f;
+              h[a >> 3] = g;
+              e = +h[((+h[(b + 8) >> 3] > +h[(c + 8) >> 3] ? b : c) + 8) >> 3];
+              d = +h[((+h[(b + 24) >> 3] < +h[(c + 24) >> 3] ? b : c) + 24) >> 3];
+              h[(a + 24) >> 3] = d;
+              h[(a + 8) >> 3] = e;
+              return (!(g >= f) & !(e >= d) & 1) | 0;
+            }
+            function tV(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0;
+              f = c[(a + 4) >> 2] | 0;
+              do
+                if ((c[(a + 68) >> 2] | 0) != 2 ? !(((f | 0) < 1) | ((c[a >> 2] | 0) < 1)) : 0) {
+                  if (!((c[(a + 40) >> 2] | 0) < 1 ? (c[(a + 44) >> 2] | 0) < 1 : 0)) {
+                    if ((c[(a + 48) >> 2] | 0) >= 1) {
+                      a = 0;
+                      break;
+                    }
+                    if ((c[(a + 52) >> 2] | 0) >= 1) {
+                      a = 0;
+                      break;
+                    }
+                  }
+                  d = +h[(b + ((f * 56) | 0) + 24) >> 3];
+                  e = +h[(b + ((f * 56) | 0) + 8) >> 3];
+                  if (!(d > e + 1.0e-7))
+                    if (d < e + -1.0e-7) a = 0;
+                    else a = (+h[(b + ((f * 56) | 0) + 16) >> 3] > +h[(b + ((f * 56) | 0)) >> 3]) & 1;
+                  else a = 1;
+                } else a = 0;
+              while (0);
+              return a | 0;
+            }
+            function uV(a, b, d, e, f, g, i, j, k, l) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              j = j | 0;
+              k = k | 0;
+              l = l | 0;
+              var m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0.0,
+                J = 0,
+                K = 0.0,
+                L = 0,
+                M = 0,
+                N = 0,
+                O = 0,
+                P = 0;
+              D = (k | 0) == 0;
+              C = i;
+              a: while (1) {
+                y = (f + ((C * 72) | 0)) | 0;
+                if ((C | 0) < 1) break;
+                i = (a + (C << 2)) | 0;
+                if (c[i >> 2] | 0) break;
+                c[i >> 2] = 1;
+                v = (f + ((C * 72) | 0) + 8) | 0;
+                t = (f + ((C * 72) | 0) + 16) | 0;
+                p = +h[t >> 3];
+                w = (f + ((C * 72) | 0) + 24) | 0;
+                x = (f + ((C * 72) | 0) + 32) | 0;
+                o = +h[x >> 3];
+                if (
+                  (
+                    p > o
+                      ? ((A = c[y >> 2] | 0),
+                        (I = +h[(e + ((A * 56) | 0)) >> 3]),
+                        I == +h[(e + ((A * 56) | 0) + 16) >> 3])
+                      : 0
+                  )
+                    ? ((A = c[(f + ((C * 72) | 0) + 4) >> 2] | 0),
+                      (K = +h[(e + ((A * 56) | 0)) >> 3]),
+                      K == +h[(e + ((A * 56) | 0) + 16) >> 3])
+                    : 0
+                ) {
+                  i = (b + (d << 5)) | 0;
+                  if (D) {
+                    h[i >> 3] = I;
+                    q = p;
+                    p = K;
+                  } else {
+                    h[i >> 3] = o;
+                    q = -I;
+                    o = -K;
+                  }
+                  h[(b + (d << 5) + 8) >> 3] = o;
+                  h[(b + (d << 5) + 16) >> 3] = p;
+                  h[(b + (d << 5) + 24) >> 3] = q;
+                  d = (d + 1) | 0;
+                }
+                i = (f + ((C * 72) | 0) + 40) | 0;
+                z = c[i >> 2] | 0;
+                do
+                  if ((z | 0) < 1 ? ((L = (f + ((C * 72) | 0) + 44) | 0), (c[L >> 2] | 0) < 1) : 0) {
+                    i = (f + ((C * 72) | 0) + 48) | 0;
+                    n = (f + ((C * 72) | 0) + 52) | 0;
+                    if ((c[i >> 2] | 0) > 0 ? ((M = c[n >> 2] | 0), (M | 0) > 0) : 0) {
+                      m = c[(f + ((M * 72) | 0)) >> 2] | 0;
+                      l = c[y >> 2] | 0;
+                      if ((M | 0) == (j | 0)) {
+                        l = vV(g, l, m) | 0;
+                        d = uV(a, b, d, e, f, g, c[n >> 2] | 0, C, k, 1) | 0;
+                        g = l;
+                        l = 1;
+                        break;
+                      } else {
+                        l = vV(g, m, l) | 0;
+                        d = uV(a, b, d, e, f, g, c[i >> 2] | 0, C, k, 1) | 0;
+                        g = l;
+                        i = n;
+                        l = 1;
+                        break;
+                      }
+                    }
+                    d = uV(a, b, d, e, f, g, z, C, k, 2) | 0;
+                    d = uV(a, b, d, e, f, g, c[L >> 2] | 0, C, k, 2) | 0;
+                    d = uV(a, b, d, e, f, g, c[i >> 2] | 0, C, k, 1) | 0;
+                    i = n;
+                    l = 1;
+                  } else P = 19;
+                while (0);
+                do
+                  if ((P | 0) == 19) {
+                    P = 0;
+                    A = (f + ((C * 72) | 0) + 48) | 0;
+                    r = c[A >> 2] | 0;
+                    if ((r | 0) < 1 ? ((N = (f + ((C * 72) | 0) + 52) | 0), (c[N >> 2] | 0) < 1) : 0) {
+                      n = (f + ((C * 72) | 0) + 44) | 0;
+                      if ((z | 0) > 0 ? ((O = c[n >> 2] | 0), (O | 0) > 0) : 0) {
+                        m = c[(f + ((C * 72) | 0) + 4) >> 2] | 0;
+                        l = c[(f + ((z * 72) | 0) + 4) >> 2] | 0;
+                        if ((O | 0) == (j | 0)) {
+                          l = vV(g, l, m) | 0;
+                          d = uV(a, b, d, e, f, g, c[n >> 2] | 0, C, k, 2) | 0;
+                          g = l;
+                          l = 2;
+                          break;
+                        } else {
+                          l = vV(g, m, l) | 0;
+                          d = uV(a, b, d, e, f, g, c[i >> 2] | 0, C, k, 2) | 0;
+                          g = l;
+                          i = n;
+                          l = 2;
+                          break;
+                        }
+                      }
+                      d = uV(a, b, d, e, f, g, z, C, k, 2) | 0;
+                      d = uV(a, b, d, e, f, g, c[n >> 2] | 0, C, k, 2) | 0;
+                      d = uV(a, b, d, e, f, g, c[A >> 2] | 0, C, k, 1) | 0;
+                      i = N;
+                      l = 1;
+                      break;
+                    }
+                    u = (f + ((C * 72) | 0) + 44) | 0;
+                    s = c[u >> 2] | 0;
+                    m = (s | 0) > 0;
+                    if ((z | 0) > 0) {
+                      if (m) {
+                        if ((r | 0) > 0 ? ((E = (f + ((C * 72) | 0) + 52) | 0), (F = c[E >> 2] | 0), (F | 0) > 0) : 0) {
+                          n = c[(f + ((F * 72) | 0)) >> 2] | 0;
+                          m = c[(f + ((z * 72) | 0) + 4) >> 2] | 0;
+                          if (!(((l | 0) == 2) & ((F | 0) == (j | 0))) ? !(((l | 0) == 1) & ((s | 0) == (j | 0))) : 0) {
+                            l = vV(g, n, m) | 0;
+                            d = uV(a, b, d, e, f, g, c[i >> 2] | 0, C, k, 2) | 0;
+                            d = uV(a, b, d, e, f, g, c[A >> 2] | 0, C, k, 1) | 0;
+                            d = uV(a, b, d, e, f, l, c[u >> 2] | 0, C, k, 2) | 0;
+                            g = l;
+                            i = E;
+                            l = 1;
+                            break;
+                          }
+                          l = vV(g, m, n) | 0;
+                          d = uV(a, b, d, e, f, g, c[u >> 2] | 0, C, k, 2) | 0;
+                          d = uV(a, b, d, e, f, g, c[E >> 2] | 0, C, k, 1) | 0;
+                          d = uV(a, b, d, e, f, l, c[i >> 2] | 0, C, k, 2) | 0;
+                          g = l;
+                          i = A;
+                          l = 1;
+                          break;
+                        }
+                        m = c[y >> 2] | 0;
+                        if (
+                          +B(+(+h[x >> 3] - +h[(e + ((m * 56) | 0) + 24) >> 3])) <= 1.0e-7
+                            ? +B(+(+h[w >> 3] - +h[(e + ((m * 56) | 0) + 16) >> 3])) <= 1.0e-7
+                            : 0
+                        ) {
+                          n = c[(f + ((z * 72) | 0) + 4) >> 2] | 0;
+                          m = c[(e + ((m * 56) | 0) + 44) >> 2] | 0;
+                          if (((l | 0) == 1) & ((z | 0) == (j | 0))) {
+                            l = vV(g, m, n) | 0;
+                            d = uV(a, b, d, e, f, g, c[i >> 2] | 0, C, k, 2) | 0;
+                            d = uV(a, b, d, e, f, l, c[A >> 2] | 0, C, k, 1) | 0;
+                            d = uV(a, b, d, e, f, l, c[u >> 2] | 0, C, k, 2) | 0;
+                            g = l;
+                            i = (f + ((C * 72) | 0) + 52) | 0;
+                            l = 1;
+                            break;
+                          } else {
+                            l = vV(g, n, m) | 0;
+                            d = uV(a, b, d, e, f, g, c[u >> 2] | 0, C, k, 2) | 0;
+                            d = uV(a, b, d, e, f, g, c[A >> 2] | 0, C, k, 1) | 0;
+                            d = uV(a, b, d, e, f, g, c[(f + ((C * 72) | 0) + 52) >> 2] | 0, C, k, 1) | 0;
+                            g = l;
+                            l = 2;
+                            break;
+                          }
+                        }
+                        n = c[(f + ((C * 72) | 0) + 4) >> 2] | 0;
+                        m = c[(f + ((z * 72) | 0) + 4) >> 2] | 0;
+                        if (((l | 0) == 1) & ((s | 0) == (j | 0))) {
+                          l = vV(g, m, n) | 0;
+                          d = uV(a, b, d, e, f, g, c[u >> 2] | 0, C, k, 2) | 0;
+                          d = uV(a, b, d, e, f, l, c[(f + ((C * 72) | 0) + 52) >> 2] | 0, C, k, 1) | 0;
+                          d = uV(a, b, d, e, f, l, c[A >> 2] | 0, C, k, 1) | 0;
+                          g = l;
+                          l = 2;
+                          break;
+                        } else {
+                          l = vV(g, n, m) | 0;
+                          d = uV(a, b, d, e, f, g, c[i >> 2] | 0, C, k, 2) | 0;
+                          d = uV(a, b, d, e, f, g, c[A >> 2] | 0, C, k, 1) | 0;
+                          d = uV(a, b, d, e, f, g, c[(f + ((C * 72) | 0) + 52) >> 2] | 0, C, k, 1) | 0;
+                          g = l;
+                          i = u;
+                          l = 2;
+                          break;
+                        }
+                      }
+                    } else if (!m) break a;
+                    if ((r | 0) > 0 ? ((G = (f + ((C * 72) | 0) + 52) | 0), (H = c[G >> 2] | 0), (H | 0) > 0) : 0) {
+                      n = c[y >> 2] | 0;
+                      if (
+                        +B(+(+h[t >> 3] - +h[(e + ((n * 56) | 0) + 8) >> 3])) <= 1.0e-7
+                          ? +B(+(+h[v >> 3] - +h[(e + ((n * 56) | 0)) >> 3])) <= 1.0e-7
+                          : 0
+                      ) {
+                        m = c[(f + ((H * 72) | 0)) >> 2] | 0;
+                        if (((l | 0) == 2) & ((r | 0) == (j | 0))) {
+                          l = vV(g, m, n) | 0;
+                          d = uV(a, b, d, e, f, g, c[A >> 2] | 0, C, k, 1) | 0;
+                          d = uV(a, b, d, e, f, l, c[i >> 2] | 0, C, k, 2) | 0;
+                          d = uV(a, b, d, e, f, l, c[(f + ((C * 72) | 0) + 44) >> 2] | 0, C, k, 2) | 0;
+                          g = l;
+                          i = G;
+                          l = 1;
+                          break;
+                        } else {
+                          l = vV(g, n, m) | 0;
+                          d = uV(a, b, d, e, f, g, c[(f + ((C * 72) | 0) + 44) >> 2] | 0, C, k, 2) | 0;
+                          d = uV(a, b, d, e, f, g, c[G >> 2] | 0, C, k, 1) | 0;
+                          d = uV(a, b, d, e, f, g, c[i >> 2] | 0, C, k, 2) | 0;
+                          g = l;
+                          i = A;
+                          l = 1;
+                          break;
+                        }
+                      }
+                      m = c[(f + ((H * 72) | 0)) >> 2] | 0;
+                      n = c[(e + (((c[(f + ((C * 72) | 0) + 4) >> 2] | 0) * 56) | 0) + 44) >> 2] | 0;
+                      if (((l | 0) == 2) & ((H | 0) == (j | 0))) {
+                        l = vV(g, n, m) | 0;
+                        d = uV(a, b, d, e, f, g, c[G >> 2] | 0, C, k, 1) | 0;
+                        d = uV(a, b, d, e, f, l, c[(f + ((C * 72) | 0) + 44) >> 2] | 0, C, k, 2) | 0;
+                        d = uV(a, b, d, e, f, l, c[i >> 2] | 0, C, k, 2) | 0;
+                        g = l;
+                        i = A;
+                        l = 1;
+                        break;
+                      } else {
+                        l = vV(g, m, n) | 0;
+                        d = uV(a, b, d, e, f, g, c[i >> 2] | 0, C, k, 2) | 0;
+                        d = uV(a, b, d, e, f, g, c[A >> 2] | 0, C, k, 1) | 0;
+                        d = uV(a, b, d, e, f, g, c[(f + ((C * 72) | 0) + 44) >> 2] | 0, C, k, 2) | 0;
+                        g = l;
+                        i = G;
+                        l = 1;
+                        break;
+                      }
+                    }
+                    o = +h[t >> 3];
+                    n = c[y >> 2] | 0;
+                    if (
+                      (
+                        (
+                          +B(+(o - +h[(e + ((n * 56) | 0) + 8) >> 3])) <= 1.0e-7
+                            ? +B(+(+h[v >> 3] - +h[(e + ((n * 56) | 0)) >> 3])) <= 1.0e-7
+                            : 0
+                        )
+                          ? ((J = c[(f + ((C * 72) | 0) + 4) >> 2] | 0),
+                            +B(+(+h[x >> 3] - +h[(e + ((J * 56) | 0) + 8) >> 3])) <= 1.0e-7)
+                          : 0
+                      )
+                        ? +B(+(+h[w >> 3] - +h[(e + ((J * 56) | 0)) >> 3])) <= 1.0e-7
+                        : 0
+                    )
+                      if ((l | 0) == 1) {
+                        l = vV(g, n, J) | 0;
+                        d = uV(a, b, d, e, f, g, c[i >> 2] | 0, C, k, 2) | 0;
+                        d = uV(a, b, d, e, f, g, c[(f + ((C * 72) | 0) + 44) >> 2] | 0, C, k, 2) | 0;
+                        d = uV(a, b, d, e, f, l, c[(f + ((C * 72) | 0) + 52) >> 2] | 0, C, k, 1) | 0;
+                        g = l;
+                        i = A;
+                        l = 1;
+                        break;
+                      } else {
+                        l = vV(g, J, n) | 0;
+                        d = uV(a, b, d, e, f, g, c[(f + ((C * 72) | 0) + 52) >> 2] | 0, C, k, 1) | 0;
+                        d = uV(a, b, d, e, f, g, c[A >> 2] | 0, C, k, 1) | 0;
+                        d = uV(a, b, d, e, f, l, c[i >> 2] | 0, C, k, 2) | 0;
+                        g = l;
+                        i = (f + ((C * 72) | 0) + 44) | 0;
+                        l = 2;
+                        break;
+                      }
+                    j = c[(f + ((C * 72) | 0) + 4) >> 2] | 0;
+                    if (
+                      (
+                        (
+                          +B(+(o - +h[(e + ((j * 56) | 0) + 24) >> 3])) <= 1.0e-7
+                            ? +B(+(+h[v >> 3] - +h[(e + ((j * 56) | 0) + 16) >> 3])) <= 1.0e-7
+                            : 0
+                        )
+                          ? +B(+(+h[x >> 3] - +h[(e + ((n * 56) | 0) + 24) >> 3])) <= 1.0e-7
+                          : 0
+                      )
+                        ? +B(+(+h[w >> 3] - +h[(e + ((n * 56) | 0) + 16) >> 3])) <= 1.0e-7
+                        : 0
+                    ) {
+                      m = c[(e + ((j * 56) | 0) + 44) >> 2] | 0;
+                      j = c[(e + ((n * 56) | 0) + 44) >> 2] | 0;
+                      if ((l | 0) == 1) {
+                        l = vV(g, j, m) | 0;
+                        d = uV(a, b, d, e, f, g, c[i >> 2] | 0, C, k, 2) | 0;
+                        d = uV(a, b, d, e, f, g, c[(f + ((C * 72) | 0) + 44) >> 2] | 0, C, k, 2) | 0;
+                        d = uV(a, b, d, e, f, l, c[(f + ((C * 72) | 0) + 52) >> 2] | 0, C, k, 1) | 0;
+                        g = l;
+                        i = A;
+                        l = 1;
+                        break;
+                      } else {
+                        l = vV(g, m, j) | 0;
+                        d = uV(a, b, d, e, f, g, c[(f + ((C * 72) | 0) + 52) >> 2] | 0, C, k, 1) | 0;
+                        d = uV(a, b, d, e, f, g, c[A >> 2] | 0, C, k, 1) | 0;
+                        d = uV(a, b, d, e, f, l, c[i >> 2] | 0, C, k, 2) | 0;
+                        g = l;
+                        i = (f + ((C * 72) | 0) + 44) | 0;
+                        l = 2;
+                        break;
+                      }
+                    }
+                    d = uV(a, b, d, e, f, g, z, C, k, 2) | 0;
+                    d = uV(a, b, d, e, f, g, c[A >> 2] | 0, C, k, 1) | 0;
+                    d = uV(a, b, d, e, f, g, c[(f + ((C * 72) | 0) + 44) >> 2] | 0, C, k, 2) | 0;
+                    i = (f + ((C * 72) | 0) + 52) | 0;
+                    l = 1;
+                  }
+                while (0);
+                j = C;
+                C = c[i >> 2] | 0;
+              }
+              return d | 0;
+            }
+            function vV(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0;
+              f = l;
+              l = (l + 16) | 0;
+              r = (f + 4) | 0;
+              i = f;
+              e = ((c[47392] | 0) + 1) | 0;
+              c[47392] = e;
+              m = c[47389] | 0;
+              wV(b, d, r, i);
+              r = c[r >> 2] | 0;
+              h = c[(m + ((b * 56) | 0) + 32 + (r << 2)) >> 2] | 0;
+              i = c[(m + ((d * 56) | 0) + 32 + (c[i >> 2] << 2)) >> 2] | 0;
+              n = c[47391] | 0;
+              g = (n + 1) | 0;
+              n = (n + 2) | 0;
+              c[47391] = n;
+              q = c[47388] | 0;
+              c[(q + (g << 4)) >> 2] = b;
+              c[(q + (n << 4)) >> 2] = d;
+              o = (q + (h << 4) + 4) | 0;
+              p = (q + (g << 4) + 4) | 0;
+              c[p >> 2] = c[o >> 2];
+              c[(q + (c[o >> 2] << 4) + 8) >> 2] = g;
+              c[(q + (g << 4) + 8) >> 2] = n;
+              c[(q + (n << 4) + 4) >> 2] = g;
+              j = (q + (i << 4) + 8) | 0;
+              c[(q + (n << 4) + 8) >> 2] = c[j >> 2];
+              c[(q + (c[j >> 2] << 4) + 4) >> 2] = n;
+              c[o >> 2] = i;
+              c[j >> 2] = h;
+              j = (m + ((b * 56) | 0) + 48) | 0;
+              o = c[j >> 2] | 0;
+              i = (m + ((d * 56) | 0) + 48) | 0;
+              k = c[i >> 2] | 0;
+              c[(m + ((b * 56) | 0) + 16 + (r << 2)) >> 2] = d;
+              c[(m + ((b * 56) | 0) + 32 + (o << 2)) >> 2] = g;
+              c[(m + ((b * 56) | 0) + 16 + (o << 2)) >> 2] = c[(q + (c[p >> 2] << 4)) >> 2];
+              c[(m + ((d * 56) | 0) + 32 + (k << 2)) >> 2] = n;
+              c[(m + ((d * 56) | 0) + 16 + (k << 2)) >> 2] = b;
+              c[j >> 2] = (c[j >> 2] | 0) + 1;
+              c[i >> 2] = (c[i >> 2] | 0) + 1;
+              d = c[47390] | 0;
+              c[(d + (a << 2)) >> 2] = h;
+              c[(d + (e << 2)) >> 2] = g;
+              l = f;
+              return e | 0;
+            }
+            function wV(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0.0,
+                h = 0,
+                i = 0,
+                j = 0.0,
+                k = 0.0,
+                l = 0,
+                m = 0,
+                n = 0;
+              l = c[47389] | 0;
+              m = (l + ((a * 56) | 0)) | 0;
+              n = (l + ((b * 56) | 0)) | 0;
+              f = 0;
+              g = -4.0;
+              i = 0;
+              while (1) {
+                if ((i | 0) == 4) break;
+                h = c[(l + ((a * 56) | 0) + 16 + (i << 2)) >> 2] | 0;
+                if ((h | 0) >= 1 ? ((j = +xV(m, (l + ((h * 56) | 0)) | 0, n)), j > g) : 0) {
+                  f = i;
+                  g = j;
+                }
+                i = (i + 1) | 0;
+              }
+              c[d >> 2] = f;
+              f = 0;
+              i = 0;
+              g = -4.0;
+              while (1) {
+                if ((i | 0) == 4) break;
+                h = c[(l + ((b * 56) | 0) + 16 + (i << 2)) >> 2] | 0;
+                if ((h | 0) >= 1 ? ((k = +xV(n, (l + ((h * 56) | 0)) | 0, m)), k > g) : 0) {
+                  f = i;
+                  g = k;
+                }
+                i = (i + 1) | 0;
+              }
+              c[e >> 2] = f;
+              return;
+            }
+            function xV(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0;
+              g = +h[a >> 3];
+              i = +h[b >> 3] - g;
+              d = +h[(a + 8) >> 3];
+              f = +h[(b + 8) >> 3] - d;
+              g = +h[c >> 3] - g;
+              d = +h[(c + 8) >> 3] - d;
+              e = d * f + g * i;
+              if (!(d * i - g * f >= 0.0)) d = -e / (+C(+(d * d + g * g)) * +C(+(f * f + i * i))) + -2.0;
+              else d = e / (+C(+(d * d + g * g)) * +C(+(f * f + i * i)));
+              return +d;
+            }
+            function yV(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0.0,
+                l = 0.0;
+              c[e >> 2] = c[a >> 2];
+              c[(e + 4) >> 2] = c[(a + 4) >> 2];
+              c[(e + 8) >> 2] = c[(a + 8) >> 2];
+              c[(e + 12) >> 2] = c[(a + 12) >> 2];
+              i = (e + 32) | 0;
+              j = (a + 16) | 0;
+              c[i >> 2] = c[j >> 2];
+              c[(i + 4) >> 2] = c[(j + 4) >> 2];
+              c[(i + 8) >> 2] = c[(j + 8) >> 2];
+              c[(i + 12) >> 2] = c[(j + 12) >> 2];
+              if (!d) {
+                f = (a + 8) | 0;
+                g = j;
+                i = (a + 24) | 0;
+                d = a;
+              } else {
+                f = (a + 24) | 0;
+                g = a;
+                i = (a + 8) | 0;
+                d = j;
+              }
+              k = +h[g >> 3];
+              l = +h[i >> 3];
+              h[(e + 16) >> 3] = +h[d >> 3];
+              h[(e + 24) >> 3] = l;
+              h[(e + 48) >> 3] = k;
+              h[(e + 56) >> 3] = +h[f >> 3];
+              a: do
+                if (b | 0) {
+                  d = 0;
+                  while (1) {
+                    if ((d | 0) == 4) break a;
+                    j = (e + (d << 4) + 8) | 0;
+                    l = +h[j >> 3];
+                    b = (e + (d << 4)) | 0;
+                    h[j >> 3] = +h[b >> 3];
+                    h[b >> 3] = -l;
+                    d = (d + 1) | 0;
+                  }
+                }
+              while (0);
+              return;
+            }
+            function zV(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0;
+              h = (b + 3) | 0;
+              i = (b + 1) | 0;
+              j = (b + 2) | 0;
+              k = (a + ((b * 56) | 0) + 44) | 0;
+              l = (a + ((h * 56) | 0) + 44) | 0;
+              e = 0;
+              f = b;
+              while (1) {
+                if ((f | 0) > (h | 0)) break;
+                do
+                  if ((f | 0) != (b | 0))
+                    if ((f | 0) == (h | 0)) {
+                      c[l >> 2] = b;
+                      g = j;
+                      break;
+                    } else {
+                      c[(a + ((f * 56) | 0) + 44) >> 2] = f + 1;
+                      g = (f + -1) | 0;
+                      break;
+                    }
+                  else {
+                    c[k >> 2] = i;
+                    g = h;
+                  }
+                while (0);
+                c[(a + ((f * 56) | 0) + 48) >> 2] = g;
+                c[(a + ((f * 56) | 0) + 32) >> 2] = 0;
+                n = (a + ((f * 56) | 0)) | 0;
+                m = (d + (e << 4)) | 0;
+                c[n >> 2] = c[m >> 2];
+                c[(n + 4) >> 2] = c[(m + 4) >> 2];
+                c[(n + 8) >> 2] = c[(m + 8) >> 2];
+                c[(n + 12) >> 2] = c[(m + 12) >> 2];
+                X6((a + ((g * 56) | 0) + 16) | 0, m | 0, 16) | 0;
+                e = (e + 1) | 0;
+                f = (f + 1) | 0;
+              }
+              return (b + 4) | 0;
+            }
+            function AV(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              c[47393] = e << 1;
+              c[47394] = e;
+              k = JK((e * 80) | 0) | 0;
+              c[47395] = 1;
+              c[47396] = 1;
+              Y6(f | 0, 0, (e * 72) | 0) | 0;
+              g = BV(c[(d + 4) >> 2] | 0, b, f, k) | 0;
+              e = 1;
+              while (1) {
+                if ((e | 0) > (a | 0)) break;
+                c[(b + ((e * 56) | 0) + 40) >> 2] = g;
+                c[(b + ((e * 56) | 0) + 36) >> 2] = g;
+                e = (e + 1) | 0;
+              }
+              j = CV(a) | 0;
+              g = 2;
+              i = 1;
+              while (1) {
+                if ((i | 0) > (j | 0)) break;
+                e = DV(a, (i + -1) | 0) | 0;
+                h = DV(a, i) | 0;
+                while (1) {
+                  if ((e | 0) >= (h | 0)) {
+                    e = 1;
+                    break;
+                  }
+                  EV(c[(d + (g << 2)) >> 2] | 0, b, f, k);
+                  e = (e + 1) | 0;
+                  g = (g + 1) | 0;
+                }
+                while (1) {
+                  if ((e | 0) > (a | 0)) break;
+                  FV(e, b, f, k);
+                  e = (e + 1) | 0;
+                }
+                i = (i + 1) | 0;
+              }
+              e = DV(a, j) | 0;
+              while (1) {
+                if ((e | 0) >= (a | 0)) break;
+                EV(c[(d + (g << 2)) >> 2] | 0, b, f, k);
+                g = (g + 1) | 0;
+                e = (e + 1) | 0;
+              }
+              U1(k);
+              return c[47395] | 0;
+            }
+            function BV(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0;
+              f = KV() | 0;
+              c[(e + ((f * 40) | 0)) >> 2] = 2;
+              s = (e + ((f * 40) | 0) + 8) | 0;
+              k = (b + ((a * 56) | 0)) | 0;
+              l = (b + ((a * 56) | 0) + 16) | 0;
+              OV(s, k, l);
+              n = KV() | 0;
+              c[(e + ((f * 40) | 0) + 36) >> 2] = n;
+              c[(e + ((n * 40) | 0)) >> 2] = 3;
+              c[(e + ((n * 40) | 0) + 28) >> 2] = f;
+              j = KV() | 0;
+              c[(e + ((f * 40) | 0) + 32) >> 2] = j;
+              c[(e + ((j * 40) | 0)) >> 2] = 2;
+              r = (e + ((j * 40) | 0) + 8) | 0;
+              PV(r, k, l);
+              c[(e + ((j * 40) | 0) + 28) >> 2] = f;
+              l = KV() | 0;
+              c[(e + ((j * 40) | 0) + 32) >> 2] = l;
+              c[(e + ((l * 40) | 0)) >> 2] = 3;
+              c[(e + ((l * 40) | 0) + 28) >> 2] = j;
+              k = KV() | 0;
+              c[(e + ((j * 40) | 0) + 36) >> 2] = k;
+              c[(e + ((k * 40) | 0)) >> 2] = 1;
+              c[(e + ((k * 40) | 0) + 4) >> 2] = a;
+              c[(e + ((k * 40) | 0) + 28) >> 2] = j;
+              j = KV() | 0;
+              c[(e + ((k * 40) | 0) + 32) >> 2] = j;
+              c[(e + ((j * 40) | 0)) >> 2] = 3;
+              c[(e + ((j * 40) | 0) + 28) >> 2] = k;
+              g = KV() | 0;
+              c[(e + ((k * 40) | 0) + 36) >> 2] = g;
+              c[(e + ((g * 40) | 0)) >> 2] = 3;
+              c[(e + ((g * 40) | 0) + 28) >> 2] = k;
+              k = JV(d) | 0;
+              i = JV(d) | 0;
+              m = JV(d) | 0;
+              o = JV(d) | 0;
+              p = (d + ((k * 72) | 0) + 8) | 0;
+              q = (d + ((i * 72) | 0) + 8) | 0;
+              t = (d + ((o * 72) | 0) + 24) | 0;
+              c[t >> 2] = c[s >> 2];
+              c[(t + 4) >> 2] = c[(s + 4) >> 2];
+              c[(t + 8) >> 2] = c[(s + 8) >> 2];
+              c[(t + 12) >> 2] = c[(s + 12) >> 2];
+              X6(q | 0, s | 0, 16) | 0;
+              c[p >> 2] = c[q >> 2];
+              c[(p + 4) >> 2] = c[(q + 4) >> 2];
+              c[(p + 8) >> 2] = c[(q + 8) >> 2];
+              c[(p + 12) >> 2] = c[(q + 12) >> 2];
+              p = (d + ((k * 72) | 0) + 24) | 0;
+              q = (d + ((i * 72) | 0) + 24) | 0;
+              s = (d + ((m * 72) | 0) + 8) | 0;
+              c[s >> 2] = c[r >> 2];
+              c[(s + 4) >> 2] = c[(r + 4) >> 2];
+              c[(s + 8) >> 2] = c[(r + 8) >> 2];
+              c[(s + 12) >> 2] = c[(r + 12) >> 2];
+              X6(q | 0, r | 0, 16) | 0;
+              c[p >> 2] = c[q >> 2];
+              c[(p + 4) >> 2] = c[(q + 4) >> 2];
+              c[(p + 8) >> 2] = c[(q + 8) >> 2];
+              c[(p + 12) >> 2] = c[(q + 12) >> 2];
+              h[(d + ((o * 72) | 0) + 16) >> 3] = 1073741824.0;
+              h[(d + ((o * 72) | 0) + 8) >> 3] = 1073741824.0;
+              h[(d + ((m * 72) | 0) + 32) >> 3] = -1073741824.0;
+              h[(d + ((m * 72) | 0) + 24) >> 3] = -1073741824.0;
+              c[(d + ((i * 72) | 0)) >> 2] = a;
+              c[(d + ((k * 72) | 0) + 4) >> 2] = a;
+              c[(d + ((i * 72) | 0) + 40) >> 2] = o;
+              c[(d + ((k * 72) | 0) + 40) >> 2] = o;
+              c[(d + ((i * 72) | 0) + 48) >> 2] = m;
+              c[(d + ((k * 72) | 0) + 48) >> 2] = m;
+              c[(d + ((m * 72) | 0) + 40) >> 2] = k;
+              c[(d + ((o * 72) | 0) + 48) >> 2] = k;
+              c[(d + ((m * 72) | 0) + 44) >> 2] = i;
+              c[(d + ((o * 72) | 0) + 52) >> 2] = i;
+              c[(d + ((k * 72) | 0) + 56) >> 2] = j;
+              c[(d + ((i * 72) | 0) + 56) >> 2] = g;
+              c[(d + ((m * 72) | 0) + 56) >> 2] = l;
+              c[(d + ((o * 72) | 0) + 56) >> 2] = n;
+              c[(d + ((i * 72) | 0) + 68) >> 2] = 1;
+              c[(d + ((k * 72) | 0) + 68) >> 2] = 1;
+              c[(d + ((o * 72) | 0) + 68) >> 2] = 1;
+              c[(d + ((m * 72) | 0) + 68) >> 2] = 1;
+              c[(e + ((n * 40) | 0) + 24) >> 2] = o;
+              c[(e + ((l * 40) | 0) + 24) >> 2] = m;
+              c[(e + ((j * 40) | 0) + 24) >> 2] = k;
+              c[(e + ((g * 40) | 0) + 24) >> 2] = i;
+              c[(b + ((a * 56) | 0) + 32) >> 2] = 1;
+              return f | 0;
+            }
+            function CV(a) {
+              a = a | 0;
+              var b = 0.0;
+              b = +(a | 0);
+              a = 0;
+              while (1) {
+                if (!(b >= 1.0)) break;
+                b = +x2(b);
+                a = (a + 1) | 0;
+              }
+              return (a + -1) | 0;
+            }
+            function DV(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0,
+                d = 0.0;
+              d = +(a | 0);
+              c = d;
+              a = 0;
+              while (1) {
+                if ((a | 0) >= (b | 0)) break;
+                c = +x2(c);
+                a = (a + 1) | 0;
+              }
+              return ~~+N(+(d / c)) | 0;
+            }
+            function EV(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0.0,
+                j = 0.0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0.0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                O = 0,
+                P = 0,
+                Q = 0,
+                R = 0,
+                S = 0,
+                T = 0,
+                U = 0,
+                V = 0,
+                W = 0,
+                X = 0;
+              W = l;
+              l = (l + 96) | 0;
+              S = (W + 32) | 0;
+              f = (W + 16) | 0;
+              T = W;
+              s = S;
+              k = (b + ((a * 56) | 0)) | 0;
+              r = (s + 56) | 0;
+              do {
+                c[s >> 2] = c[k >> 2];
+                s = (s + 4) | 0;
+                k = (k + 4) | 0;
+              } while ((s | 0) < (r | 0));
+              U = (S + 16) | 0;
+              V = (S + 24) | 0;
+              i = +h[V >> 3];
+              H = (S + 8) | 0;
+              j = +h[H >> 3];
+              do
+                if (!(i > j + 1.0e-7)) {
+                  if (!(i < j + -1.0e-7) ? +h[U >> 3] > +h[S >> 3] : 0) {
+                    G = 4;
+                    break;
+                  }
+                  G = (IV(a, b, 1) | 0) == 0;
+                  f = c[(S + 36) >> 2] | 0;
+                  if (G) {
+                    n = 0;
+                    G = 7;
+                  } else {
+                    f = GV(S, U, f, b, e) | 0;
+                    G = 20;
+                  }
+                } else G = 4;
+              while (0);
+              if ((G | 0) == 4) {
+                c[f >> 2] = c[S >> 2];
+                c[(f + 4) >> 2] = c[(S + 4) >> 2];
+                c[(f + 8) >> 2] = c[(S + 8) >> 2];
+                c[(f + 12) >> 2] = c[(S + 12) >> 2];
+                c[S >> 2] = c[U >> 2];
+                c[(S + 4) >> 2] = c[(U + 4) >> 2];
+                c[(S + 8) >> 2] = c[(U + 8) >> 2];
+                c[(S + 12) >> 2] = c[(U + 12) >> 2];
+                c[U >> 2] = c[f >> 2];
+                c[(U + 4) >> 2] = c[(f + 4) >> 2];
+                c[(U + 8) >> 2] = c[(f + 8) >> 2];
+                c[(U + 12) >> 2] = c[(f + 12) >> 2];
+                E = (S + 36) | 0;
+                F = c[E >> 2] | 0;
+                G = (S + 40) | 0;
+                f = c[G >> 2] | 0;
+                c[E >> 2] = f;
+                c[G >> 2] = F;
+                if (!(IV(a, b, 2) | 0)) {
+                  n = 1;
+                  G = 7;
+                } else {
+                  f = GV(S, U, f, b, e) | 0;
+                  G = 19;
+                }
+              }
+              if ((G | 0) == 7) {
+                m = GV(S, U, f, b, e) | 0;
+                f = JV(d) | 0;
+                c[(d + ((f * 72) | 0) + 68) >> 2] = 1;
+                s = (d + ((f * 72) | 0)) | 0;
+                k = (d + ((m * 72) | 0)) | 0;
+                r = (s + 72) | 0;
+                do {
+                  c[s >> 2] = c[k >> 2];
+                  s = (s + 4) | 0;
+                  k = (k + 4) | 0;
+                } while ((s | 0) < (r | 0));
+                q = +h[H >> 3];
+                h[(d + ((f * 72) | 0) + 16) >> 3] = q;
+                h[(d + ((m * 72) | 0) + 32) >> 3] = q;
+                q = +h[S >> 3];
+                h[(d + ((f * 72) | 0) + 8) >> 3] = q;
+                h[(d + ((m * 72) | 0) + 24) >> 3] = q;
+                c[(d + ((m * 72) | 0) + 48) >> 2] = f;
+                c[(d + ((m * 72) | 0) + 52) >> 2] = 0;
+                c[(d + ((f * 72) | 0) + 40) >> 2] = m;
+                c[(d + ((f * 72) | 0) + 44) >> 2] = 0;
+                g = c[(d + ((f * 72) | 0) + 48) >> 2] | 0;
+                if ((g | 0) > 0) {
+                  k = (d + ((g * 72) | 0) + 40) | 0;
+                  if ((c[k >> 2] | 0) == (m | 0)) c[k >> 2] = f;
+                  g = (d + ((g * 72) | 0) + 44) | 0;
+                  if ((c[g >> 2] | 0) == (m | 0)) c[g >> 2] = f;
+                }
+                g = c[(d + ((f * 72) | 0) + 52) >> 2] | 0;
+                if ((g | 0) > 0) {
+                  k = (d + ((g * 72) | 0) + 40) | 0;
+                  if ((c[k >> 2] | 0) == (m | 0)) c[k >> 2] = f;
+                  g = (d + ((g * 72) | 0) + 44) | 0;
+                  if ((c[g >> 2] | 0) == (m | 0)) c[g >> 2] = f;
+                }
+                E = KV() | 0;
+                G = KV() | 0;
+                F = (d + ((m * 72) | 0) + 56) | 0;
+                D = c[F >> 2] | 0;
+                c[(e + ((D * 40) | 0)) >> 2] = 2;
+                C = (e + ((D * 40) | 0) + 8) | 0;
+                c[C >> 2] = c[S >> 2];
+                c[(C + 4) >> 2] = c[(S + 4) >> 2];
+                c[(C + 8) >> 2] = c[(S + 8) >> 2];
+                c[(C + 12) >> 2] = c[(S + 12) >> 2];
+                c[(e + ((D * 40) | 0) + 4) >> 2] = a;
+                c[(e + ((D * 40) | 0) + 32) >> 2] = G;
+                c[(e + ((D * 40) | 0) + 36) >> 2] = E;
+                c[(e + ((E * 40) | 0)) >> 2] = 3;
+                c[(e + ((E * 40) | 0) + 24) >> 2] = m;
+                c[(e + ((E * 40) | 0) + 28) >> 2] = D;
+                c[(e + ((G * 40) | 0)) >> 2] = 3;
+                c[(e + ((G * 40) | 0) + 24) >> 2] = f;
+                c[(e + ((G * 40) | 0) + 28) >> 2] = D;
+                c[F >> 2] = E;
+                c[(d + ((f * 72) | 0) + 56) >> 2] = G;
+                if (n) G = 19;
+                else G = 20;
+              }
+              if ((G | 0) == 19)
+                if (!(IV(a, b, 1) | 0)) {
+                  g = 1;
+                  G = 21;
+                } else {
+                  g = 1;
+                  G = 32;
+                }
+              else if ((G | 0) == 20)
+                if (!(IV(a, b, 2) | 0)) {
+                  g = 0;
+                  G = 21;
+                } else {
+                  g = 0;
+                  G = 32;
+                }
+              if ((G | 0) == 21) {
+                o = GV(U, S, c[(S + 40) >> 2] | 0, b, e) | 0;
+                n = JV(d) | 0;
+                c[(d + ((n * 72) | 0) + 68) >> 2] = 1;
+                s = (d + ((n * 72) | 0)) | 0;
+                k = (d + ((o * 72) | 0)) | 0;
+                r = (s + 72) | 0;
+                do {
+                  c[s >> 2] = c[k >> 2];
+                  s = (s + 4) | 0;
+                  k = (k + 4) | 0;
+                } while ((s | 0) < (r | 0));
+                q = +h[V >> 3];
+                h[(d + ((n * 72) | 0) + 16) >> 3] = q;
+                h[(d + ((o * 72) | 0) + 32) >> 3] = q;
+                q = +h[U >> 3];
+                h[(d + ((n * 72) | 0) + 8) >> 3] = q;
+                h[(d + ((o * 72) | 0) + 24) >> 3] = q;
+                c[(d + ((o * 72) | 0) + 48) >> 2] = n;
+                c[(d + ((o * 72) | 0) + 52) >> 2] = 0;
+                c[(d + ((n * 72) | 0) + 40) >> 2] = o;
+                c[(d + ((n * 72) | 0) + 44) >> 2] = 0;
+                k = c[(d + ((n * 72) | 0) + 48) >> 2] | 0;
+                if ((k | 0) > 0) {
+                  m = (d + ((k * 72) | 0) + 40) | 0;
+                  if ((c[m >> 2] | 0) == (o | 0)) c[m >> 2] = n;
+                  k = (d + ((k * 72) | 0) + 44) | 0;
+                  if ((c[k >> 2] | 0) == (o | 0)) c[k >> 2] = n;
+                }
+                k = c[(d + ((n * 72) | 0) + 52) >> 2] | 0;
+                if ((k | 0) > 0) {
+                  m = (d + ((k * 72) | 0) + 40) | 0;
+                  if ((c[m >> 2] | 0) == (o | 0)) c[m >> 2] = n;
+                  k = (d + ((k * 72) | 0) + 44) | 0;
+                  if ((c[k >> 2] | 0) == (o | 0)) c[k >> 2] = n;
+                }
+                D = KV() | 0;
+                F = KV() | 0;
+                E = (d + ((o * 72) | 0) + 56) | 0;
+                C = c[E >> 2] | 0;
+                c[(e + ((C * 40) | 0)) >> 2] = 2;
+                A = (e + ((C * 40) | 0) + 8) | 0;
+                c[A >> 2] = c[U >> 2];
+                c[(A + 4) >> 2] = c[(U + 4) >> 2];
+                c[(A + 8) >> 2] = c[(U + 8) >> 2];
+                c[(A + 12) >> 2] = c[(U + 12) >> 2];
+                c[(e + ((C * 40) | 0) + 4) >> 2] = a;
+                c[(e + ((C * 40) | 0) + 32) >> 2] = F;
+                c[(e + ((C * 40) | 0) + 36) >> 2] = D;
+                c[(e + ((D * 40) | 0)) >> 2] = 3;
+                c[(e + ((D * 40) | 0) + 24) >> 2] = o;
+                c[(e + ((D * 40) | 0) + 28) >> 2] = C;
+                c[(e + ((F * 40) | 0)) >> 2] = 3;
+                c[(e + ((F * 40) | 0) + 24) >> 2] = n;
+                c[(e + ((F * 40) | 0) + 28) >> 2] = C;
+                c[E >> 2] = D;
+                c[(d + ((n * 72) | 0) + 56) >> 2] = F;
+                F = f;
+                f = 0;
+              } else if ((G | 0) == 32) {
+                F = f;
+                o = GV(U, S, c[(S + 40) >> 2] | 0, b, e) | 0;
+                f = 1;
+              }
+              a: do
+                if ((F | 0) > 0) {
+                  D = (d + ((o * 72) | 0) + 24) | 0;
+                  E = (d + ((o * 72) | 0) + 32) | 0;
+                  C = (f | 0) != 0;
+                  y = g ? (b + ((a * 56) | 0) + 48) | 0 : (b + ((a * 56) | 0) + 44) | 0;
+                  z = (T + 8) | 0;
+                  g = 0;
+                  f = 0;
+                  x = F;
+                  b: while (1) {
+                    k = (d + ((x * 72) | 0)) | 0;
+                    v = (d + ((x * 72) | 0) + 24) | 0;
+                    if (!(LV(v, D) | 0)) break a;
+                    m = (d + ((x * 72) | 0) + 56) | 0;
+                    u = c[m >> 2] | 0;
+                    n = KV() | 0;
+                    p = KV() | 0;
+                    c[(e + ((u * 40) | 0)) >> 2] = 1;
+                    c[(e + ((u * 40) | 0) + 4) >> 2] = a;
+                    c[(e + ((u * 40) | 0) + 32) >> 2] = n;
+                    c[(e + ((u * 40) | 0) + 36) >> 2] = p;
+                    c[(e + ((n * 40) | 0)) >> 2] = 3;
+                    c[(e + ((n * 40) | 0) + 24) >> 2] = x;
+                    c[(e + ((n * 40) | 0) + 28) >> 2] = u;
+                    c[(e + ((p * 40) | 0)) >> 2] = 3;
+                    w = JV(d) | 0;
+                    c[(e + ((p * 40) | 0) + 24) >> 2] = w;
+                    A = (d + ((w * 72) | 0)) | 0;
+                    c[(d + ((w * 72) | 0) + 68) >> 2] = 1;
+                    c[(e + ((p * 40) | 0) + 28) >> 2] = u;
+                    g = (x | 0) == (F | 0) ? w : g;
+                    u = (d + ((x * 72) | 0) + 32) | 0;
+                    if (+B(+(+h[u >> 3] - +h[E >> 3])) <= 1.0e-7 ? +B(+(+h[v >> 3] - +h[D >> 3])) <= 1.0e-7 : 0) f = w;
+                    s = A;
+                    r = (s + 72) | 0;
+                    do {
+                      c[s >> 2] = c[k >> 2];
+                      s = (s + 4) | 0;
+                      k = (k + 4) | 0;
+                    } while ((s | 0) < (r | 0));
+                    c[m >> 2] = n;
+                    c[(d + ((w * 72) | 0) + 56) >> 2] = p;
+                    t = (d + ((x * 72) | 0) + 48) | 0;
+                    m = (d + ((x * 72) | 0) + 52) | 0;
+                    k = (c[m >> 2] | 0) < 1;
+                    do
+                      if ((c[t >> 2] | 0) < 1) {
+                        if (k) break b;
+                        s = (d + ((x * 72) | 0) + 40) | 0;
+                        k = c[s >> 2] | 0;
+                        do
+                          if (
+                            (k | 0) > 0 ? ((M = (d + ((x * 72) | 0) + 44) | 0), (N = c[M >> 2] | 0), (N | 0) > 0) : 0
+                          ) {
+                            r = (d + ((x * 72) | 0) + 60) | 0;
+                            k = c[r >> 2] | 0;
+                            if ((k | 0) <= 0) {
+                              c[(d + ((w * 72) | 0) + 40) >> 2] = N;
+                              c[(d + ((w * 72) | 0) + 44) >> 2] = -1;
+                              c[M >> 2] = -1;
+                              c[(d + ((N * 72) | 0) + 48) >> 2] = w;
+                              break;
+                            }
+                            if ((c[(d + ((x * 72) | 0) + 64) >> 2] | 0) == 1) {
+                              c[(d + ((w * 72) | 0) + 40) >> 2] = N;
+                              c[M >> 2] = -1;
+                              c[(d + ((w * 72) | 0) + 44) >> 2] = k;
+                              c[(d + (((c[s >> 2] | 0) * 72) | 0) + 48) >> 2] = x;
+                              p = w;
+                              n = N;
+                            } else {
+                              c[(d + ((w * 72) | 0) + 44) >> 2] = -1;
+                              t = (d + ((w * 72) | 0) + 40) | 0;
+                              c[t >> 2] = c[M >> 2];
+                              n = c[s >> 2] | 0;
+                              c[M >> 2] = n;
+                              c[s >> 2] = k;
+                              c[(d + ((k * 72) | 0) + 48) >> 2] = x;
+                              p = x;
+                              k = c[t >> 2] | 0;
+                            }
+                            c[(d + ((n * 72) | 0) + 48) >> 2] = p;
+                            c[(d + ((k * 72) | 0) + 48) >> 2] = w;
+                            c[(d + ((w * 72) | 0) + 60) >> 2] = 0;
+                            c[r >> 2] = 0;
+                          } else G = 77;
+                        while (0);
+                        do
+                          if ((G | 0) == 77) {
+                            G = 0;
+                            n = (d + ((k * 72) | 0) + 48) | 0;
+                            p = c[n >> 2] | 0;
+                            k = (d + ((k * 72) | 0) + 52) | 0;
+                            if ((p | 0) > 0 ? (c[k >> 2] | 0) > 0 : 0) {
+                              k = c[(d + ((p * 72) | 0) + 4) >> 2] | 0;
+                              if ((k | 0) > 0 ? (HV(k, b, U) | 0) == 0 : 0) {
+                                c[(d + ((w * 72) | 0) + 44) >> 2] = -1;
+                                c[(d + ((x * 72) | 0) + 44) >> 2] = -1;
+                                c[s >> 2] = -1;
+                                c[(d + (((c[(d + ((w * 72) | 0) + 40) >> 2] | 0) * 72) | 0) + 52) >> 2] = w;
+                                break;
+                              }
+                              c[(d + ((x * 72) | 0) + 44) >> 2] = -1;
+                              c[(d + ((w * 72) | 0) + 44) >> 2] = -1;
+                              c[(d + ((w * 72) | 0) + 40) >> 2] = -1;
+                              c[(d + (((c[s >> 2] | 0) * 72) | 0) + 48) >> 2] = x;
+                              break;
+                            }
+                            c[n >> 2] = x;
+                            c[k >> 2] = w;
+                          }
+                        while (0);
+                        if (
+                          +B(+(+h[u >> 3] - +h[E >> 3])) <= 1.0e-7 ? C & (+B(+(+h[v >> 3] - +h[D >> 3])) <= 1.0e-7) : 0
+                        ) {
+                          k = c[y >> 2] | 0;
+                          if ((k | 0) > 0 ? (HV(k, b, S) | 0) != 0 : 0) {
+                            c[(d + (((c[m >> 2] | 0) * 72) | 0) + 40) >> 2] = x;
+                            n = (d + ((w * 72) | 0) + 52) | 0;
+                            k = w;
+                          } else {
+                            c[(d + (((c[(d + ((w * 72) | 0) + 52) >> 2] | 0) * 72) | 0) + 44) >> 2] = w;
+                            n = m;
+                            k = x;
+                          }
+                          c[n >> 2] = -1;
+                          c[(d + ((k * 72) | 0) + 48) >> 2] = -1;
+                          k = c[m >> 2] | 0;
+                          break;
+                        }
+                        k = c[m >> 2] | 0;
+                        m = (d + ((k * 72) | 0) + 40) | 0;
+                        n = c[m >> 2] | 0;
+                        p = (d + ((k * 72) | 0) + 44) | 0;
+                        if ((n | 0) > 0 ? ((O = c[p >> 2] | 0), (P = (n | 0) == (x | 0)), (O | 0) > 0) : 0) {
+                          c[(d + ((k * 72) | 0) + 60) >> 2] = P ? O : n;
+                          c[(d + ((k * 72) | 0) + 64) >> 2] = P ? 1 : 2;
+                        }
+                        c[m >> 2] = x;
+                        c[p >> 2] = w;
+                      } else {
+                        if (!k) {
+                          i = +h[u >> 3];
+                          j = +h[H >> 3];
+                          q = i - j;
+                          if (!(+B(+q) <= 1.0e-7)) {
+                            h[z >> 3] = i;
+                            i = +h[S >> 3];
+                            h[T >> 3] = (+h[U >> 3] - i) * (q / (+h[V >> 3] - j)) + i;
+                            s = (MV(T, v) | 0) != 0;
+                          } else s = +h[v >> 3] > +h[S >> 3];
+                          r = (d + ((x * 72) | 0) + 40) | 0;
+                          k = c[r >> 2] | 0;
+                          do
+                            if (
+                              (k | 0) > 0 ? ((Q = (d + ((x * 72) | 0) + 44) | 0), (R = c[Q >> 2] | 0), (R | 0) > 0) : 0
+                            ) {
+                              p = (d + ((x * 72) | 0) + 60) | 0;
+                              k = c[p >> 2] | 0;
+                              if ((k | 0) <= 0) {
+                                c[(d + ((w * 72) | 0) + 40) >> 2] = R;
+                                c[(d + ((w * 72) | 0) + 44) >> 2] = -1;
+                                c[Q >> 2] = -1;
+                                c[(d + ((R * 72) | 0) + 48) >> 2] = w;
+                                break;
+                              }
+                              if ((c[(d + ((x * 72) | 0) + 64) >> 2] | 0) == 1) {
+                                c[(d + ((w * 72) | 0) + 40) >> 2] = R;
+                                c[Q >> 2] = -1;
+                                c[(d + ((w * 72) | 0) + 44) >> 2] = k;
+                                c[(d + (((c[r >> 2] | 0) * 72) | 0) + 48) >> 2] = x;
+                                n = w;
+                                m = R;
+                              } else {
+                                c[(d + ((w * 72) | 0) + 44) >> 2] = -1;
+                                X = (d + ((w * 72) | 0) + 40) | 0;
+                                c[X >> 2] = c[Q >> 2];
+                                m = c[r >> 2] | 0;
+                                c[Q >> 2] = m;
+                                c[r >> 2] = k;
+                                c[(d + ((k * 72) | 0) + 48) >> 2] = x;
+                                n = x;
+                                k = c[X >> 2] | 0;
+                              }
+                              c[(d + ((m * 72) | 0) + 48) >> 2] = n;
+                              c[(d + ((k * 72) | 0) + 48) >> 2] = w;
+                              c[(d + ((w * 72) | 0) + 60) >> 2] = 0;
+                              c[p >> 2] = 0;
+                            } else G = 106;
+                          while (0);
+                          do
+                            if ((G | 0) == 106) {
+                              G = 0;
+                              m = (d + ((k * 72) | 0) + 48) | 0;
+                              n = c[m >> 2] | 0;
+                              k = (d + ((k * 72) | 0) + 52) | 0;
+                              if ((n | 0) > 0 ? (c[k >> 2] | 0) > 0 : 0) {
+                                k = c[(d + ((n * 72) | 0) + 4) >> 2] | 0;
+                                if ((k | 0) > 0 ? (HV(k, b, U) | 0) == 0 : 0) {
+                                  c[(d + ((w * 72) | 0) + 44) >> 2] = -1;
+                                  c[(d + ((x * 72) | 0) + 44) >> 2] = -1;
+                                  c[r >> 2] = -1;
+                                  c[(d + (((c[(d + ((w * 72) | 0) + 40) >> 2] | 0) * 72) | 0) + 52) >> 2] = w;
+                                  break;
+                                }
+                                c[(d + ((x * 72) | 0) + 44) >> 2] = -1;
+                                c[(d + ((w * 72) | 0) + 44) >> 2] = -1;
+                                c[(d + ((w * 72) | 0) + 40) >> 2] = -1;
+                                c[(d + (((c[r >> 2] | 0) * 72) | 0) + 48) >> 2] = x;
+                                break;
+                              }
+                              c[m >> 2] = x;
+                              c[k >> 2] = w;
+                            }
+                          while (0);
+                          if (
+                            +B(+(+h[u >> 3] - +h[E >> 3])) <= 1.0e-7
+                              ? C & (+B(+(+h[v >> 3] - +h[D >> 3])) <= 1.0e-7)
+                              : 0
+                          ) {
+                            k = c[t >> 2] | 0;
+                            c[(d + ((k * 72) | 0) + 40) >> 2] = x;
+                            c[(d + ((k * 72) | 0) + 44) >> 2] = -1;
+                            k = (d + ((x * 72) | 0) + 52) | 0;
+                            X = c[k >> 2] | 0;
+                            c[(d + ((X * 72) | 0) + 40) >> 2] = w;
+                            c[(d + ((X * 72) | 0) + 44) >> 2] = -1;
+                            c[(d + ((w * 72) | 0) + 48) >> 2] = X;
+                            c[(d + ((w * 72) | 0) + 52) >> 2] = -1;
+                            c[k >> 2] = -1;
+                            k = -1;
+                          } else G = 116;
+                          do
+                            if ((G | 0) == 116) {
+                              G = 0;
+                              k = c[t >> 2] | 0;
+                              c[(d + ((k * 72) | 0) + 40) >> 2] = x;
+                              m = (d + ((k * 72) | 0) + 44) | 0;
+                              if (s) {
+                                c[m >> 2] = w;
+                                X = (d + ((x * 72) | 0) + 52) | 0;
+                                v = c[X >> 2] | 0;
+                                c[(d + ((v * 72) | 0) + 40) >> 2] = w;
+                                c[(d + ((v * 72) | 0) + 44) >> 2] = -1;
+                                c[X >> 2] = -1;
+                                break;
+                              } else {
+                                c[m >> 2] = -1;
+                                k = (d + ((x * 72) | 0) + 52) | 0;
+                                X = c[k >> 2] | 0;
+                                c[(d + ((X * 72) | 0) + 40) >> 2] = x;
+                                c[(d + ((X * 72) | 0) + 44) >> 2] = w;
+                                c[(d + ((w * 72) | 0) + 48) >> 2] = X;
+                                c[(d + ((w * 72) | 0) + 52) >> 2] = -1;
+                                k = c[k >> 2] | 0;
+                                break;
+                              }
+                            }
+                          while (0);
+                          break;
+                        }
+                        s = (d + ((x * 72) | 0) + 40) | 0;
+                        k = c[s >> 2] | 0;
+                        do
+                          if (
+                            (k | 0) > 0 ? ((I = (d + ((x * 72) | 0) + 44) | 0), (J = c[I >> 2] | 0), (J | 0) > 0) : 0
+                          ) {
+                            r = (d + ((x * 72) | 0) + 60) | 0;
+                            k = c[r >> 2] | 0;
+                            if ((k | 0) <= 0) {
+                              c[(d + ((w * 72) | 0) + 40) >> 2] = J;
+                              c[(d + ((w * 72) | 0) + 44) >> 2] = -1;
+                              c[I >> 2] = -1;
+                              c[(d + ((J * 72) | 0) + 48) >> 2] = w;
+                              break;
+                            }
+                            if ((c[(d + ((x * 72) | 0) + 64) >> 2] | 0) == 1) {
+                              c[(d + ((w * 72) | 0) + 40) >> 2] = J;
+                              c[I >> 2] = -1;
+                              c[(d + ((w * 72) | 0) + 44) >> 2] = k;
+                              c[(d + (((c[s >> 2] | 0) * 72) | 0) + 48) >> 2] = x;
+                              p = w;
+                              n = J;
+                            } else {
+                              c[(d + ((w * 72) | 0) + 44) >> 2] = -1;
+                              X = (d + ((w * 72) | 0) + 40) | 0;
+                              c[X >> 2] = c[I >> 2];
+                              n = c[s >> 2] | 0;
+                              c[I >> 2] = n;
+                              c[s >> 2] = k;
+                              c[(d + ((k * 72) | 0) + 48) >> 2] = x;
+                              p = x;
+                              k = c[X >> 2] | 0;
+                            }
+                            c[(d + ((n * 72) | 0) + 48) >> 2] = p;
+                            c[(d + ((k * 72) | 0) + 48) >> 2] = w;
+                            c[(d + ((w * 72) | 0) + 60) >> 2] = 0;
+                            c[r >> 2] = 0;
+                          } else G = 51;
+                        while (0);
+                        do
+                          if ((G | 0) == 51) {
+                            G = 0;
+                            n = (d + ((k * 72) | 0) + 48) | 0;
+                            p = c[n >> 2] | 0;
+                            k = (d + ((k * 72) | 0) + 52) | 0;
+                            if ((p | 0) > 0 ? (c[k >> 2] | 0) > 0 : 0) {
+                              k = c[(d + ((p * 72) | 0) + 4) >> 2] | 0;
+                              if ((k | 0) > 0 ? (HV(k, b, U) | 0) == 0 : 0) {
+                                c[(d + ((w * 72) | 0) + 44) >> 2] = -1;
+                                c[(d + ((x * 72) | 0) + 44) >> 2] = -1;
+                                c[s >> 2] = -1;
+                                c[(d + (((c[(d + ((w * 72) | 0) + 40) >> 2] | 0) * 72) | 0) + 52) >> 2] = w;
+                                break;
+                              }
+                              c[(d + ((x * 72) | 0) + 44) >> 2] = -1;
+                              c[(d + ((w * 72) | 0) + 44) >> 2] = -1;
+                              c[(d + ((w * 72) | 0) + 40) >> 2] = -1;
+                              c[(d + (((c[s >> 2] | 0) * 72) | 0) + 48) >> 2] = x;
+                              break;
+                            }
+                            c[n >> 2] = x;
+                            c[k >> 2] = w;
+                          }
+                        while (0);
+                        if (
+                          +B(+(+h[u >> 3] - +h[E >> 3])) <= 1.0e-7 ? C & (+B(+(+h[v >> 3] - +h[D >> 3])) <= 1.0e-7) : 0
+                        ) {
+                          k = c[y >> 2] | 0;
+                          if ((k | 0) > 0 ? (HV(k, b, S) | 0) != 0 : 0) {
+                            c[(d + (((c[t >> 2] | 0) * 72) | 0) + 40) >> 2] = x;
+                            m = (d + ((w * 72) | 0) + 52) | 0;
+                            k = w;
+                          } else {
+                            c[(d + (((c[(d + ((w * 72) | 0) + 48) >> 2] | 0) * 72) | 0) + 44) >> 2] = w;
+                            k = x;
+                          }
+                          c[m >> 2] = -1;
+                          c[(d + ((k * 72) | 0) + 48) >> 2] = -1;
+                          k = c[t >> 2] | 0;
+                          break;
+                        }
+                        k = c[t >> 2] | 0;
+                        m = (d + ((k * 72) | 0) + 40) | 0;
+                        n = c[m >> 2] | 0;
+                        p = (d + ((k * 72) | 0) + 44) | 0;
+                        if ((n | 0) > 0 ? ((K = c[p >> 2] | 0), (L = (n | 0) == (x | 0)), (K | 0) > 0) : 0) {
+                          c[(d + ((k * 72) | 0) + 60) >> 2] = L ? K : n;
+                          c[(d + ((k * 72) | 0) + 64) >> 2] = L ? 1 : 2;
+                        }
+                        c[m >> 2] = x;
+                        c[p >> 2] = w;
+                      }
+                    while (0);
+                    c[A >> 2] = a;
+                    c[(d + ((x * 72) | 0) + 4) >> 2] = a;
+                    if ((k | 0) > 0) x = k;
+                    else break a;
+                  }
+                  U4(138424, 19, 1, c[15712] | 0) | 0;
+                } else {
+                  g = 0;
+                  f = 0;
+                }
+              while (0);
+              NV(a, F, o, 1, d, e);
+              NV(a, g, f, 2, d, e);
+              c[(b + ((a * 56) | 0) + 32) >> 2] = 1;
+              l = W;
+              return;
+            }
+            function FV(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              if (!(c[(b + ((a * 56) | 0) + 32) >> 2] | 0)) {
+                f = (b + ((a * 56) | 0)) | 0;
+                g = (b + ((a * 56) | 0) + 16) | 0;
+                h = (b + ((a * 56) | 0) + 36) | 0;
+                c[h >> 2] = c[(d + (((GV(f, g, c[h >> 2] | 0, b, e) | 0) * 72) | 0) + 56) >> 2];
+                a = (b + ((a * 56) | 0) + 40) | 0;
+                c[a >> 2] = c[(d + (((GV(g, f, c[a >> 2] | 0, b, e) | 0) * 72) | 0) + 56) >> 2];
+              }
+              return;
+            }
+            function GV(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0.0,
+                i = 0,
+                j = 0.0,
+                k = 0.0,
+                l = 0.0,
+                m = 0.0,
+                n = 0.0,
+                o = 0,
+                p = 0.0,
+                q = 0,
+                r = 0;
+              o = (a + 8) | 0;
+              q = (b + 8) | 0;
+              a: while (1) {
+                b: do
+                  switch (c[(f + ((d * 40) | 0)) >> 2] | 0) {
+                    case 3: {
+                      r = 3;
+                      break a;
+                    }
+                    case 2: {
+                      g = +h[o >> 3];
+                      i = (f + ((d * 40) | 0) + 8) | 0;
+                      j = +h[(f + ((d * 40) | 0) + 16) >> 3];
+                      k = j + 1.0e-7;
+                      do
+                        if (!(g > k)) {
+                          l = j + -1.0e-7;
+                          if (!(g < l) ? +h[a >> 3] > +h[i >> 3] : 0) break;
+                          if (+B(+(g - j)) <= 1.0e-7 ? ((m = +h[i >> 3]), +B(+(+h[a >> 3] - m)) <= 1.0e-7) : 0) {
+                            g = +h[q >> 3];
+                            do
+                              if (!(g > k)) {
+                                if (!(g < l) ? +h[b >> 3] > m : 0) break;
+                                d = (f + ((d * 40) | 0) + 32) | 0;
+                                break b;
+                              }
+                            while (0);
+                            d = (f + ((d * 40) | 0) + 36) | 0;
+                            break b;
+                          }
+                          d = (f + ((d * 40) | 0) + 32) | 0;
+                          break b;
+                        }
+                      while (0);
+                      d = (f + ((d * 40) | 0) + 36) | 0;
+                      break;
+                    }
+                    case 1: {
+                      g = +h[o >> 3];
+                      i = c[(f + ((d * 40) | 0) + 4) >> 2] | 0;
+                      if (
+                        +B(+(g - +h[(e + ((i * 56) | 0) + 8) >> 3])) <= 1.0e-7
+                          ? ((n = +h[a >> 3]), +B(+(n - +h[(e + ((i * 56) | 0)) >> 3])) <= 1.0e-7)
+                          : 0
+                      )
+                        j = n;
+                      else r = 19;
+                      do
+                        if ((r | 0) == 19) {
+                          r = 0;
+                          if (
+                            +B(+(g - +h[(e + ((i * 56) | 0) + 24) >> 3])) <= 1.0e-7
+                              ? ((p = +h[a >> 3]), +B(+(p - +h[(e + ((i * 56) | 0) + 16) >> 3])) <= 1.0e-7)
+                              : 0
+                          ) {
+                            j = p;
+                            break;
+                          }
+                          if (!(HV(i, e, a) | 0)) {
+                            d = (f + ((d * 40) | 0) + 36) | 0;
+                            break b;
+                          } else {
+                            d = (f + ((d * 40) | 0) + 32) | 0;
+                            break b;
+                          }
+                        }
+                      while (0);
+                      if (!(+B(+(g - +h[q >> 3])) <= 1.0e-7))
+                        if (!(HV(i, e, b) | 0)) {
+                          d = (f + ((d * 40) | 0) + 36) | 0;
+                          break b;
+                        } else {
+                          d = (f + ((d * 40) | 0) + 32) | 0;
+                          break b;
+                        }
+                      else if (+h[b >> 3] < j) {
+                        d = (f + ((d * 40) | 0) + 32) | 0;
+                        break b;
+                      } else {
+                        d = (f + ((d * 40) | 0) + 36) | 0;
+                        break b;
+                      }
+                    }
+                    default: {
+                      r = 31;
+                      break a;
+                    }
+                  }
+                while (0);
+                d = c[d >> 2] | 0;
+              }
+              if ((r | 0) == 3) return c[(f + ((d * 40) | 0) + 24) >> 2] | 0;
+              else if ((r | 0) == 31) {
+                U4(138358, 35, 1, c[15712] | 0) | 0;
+                qa(138394, 138396, 349, 138408);
+              }
+              return 0;
+            }
+            function HV(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0.0;
+              f = (b + ((a * 56) | 0) + 16) | 0;
+              g = +h[(b + ((a * 56) | 0) + 24) >> 3];
+              i = (b + ((a * 56) | 0)) | 0;
+              e = +h[(b + ((a * 56) | 0) + 8) >> 3];
+              do
+                if (!(g > e + 1.0e-7)) {
+                  if (!(g < e + -1.0e-7) ? +h[f >> 3] > +h[i >> 3] : 0) {
+                    j = 4;
+                    break;
+                  }
+                  d = +h[(c + 8) >> 3];
+                  if (+B(+(g - d)) <= 1.0e-7) {
+                    d = +h[c >> 3] < +h[f >> 3] ? 1.0 : -1.0;
+                    break;
+                  }
+                  if (!(+B(+(e - d)) <= 1.0e-7)) {
+                    k = +h[f >> 3];
+                    d = (+h[i >> 3] - k) * (d - g) - (+h[c >> 3] - k) * (e - g);
+                    break;
+                  } else {
+                    d = +h[c >> 3] < +h[i >> 3] ? 1.0 : -1.0;
+                    break;
+                  }
+                } else j = 4;
+              while (0);
+              do
+                if ((j | 0) == 4) {
+                  d = +h[(c + 8) >> 3];
+                  if (+B(+(g - d)) <= 1.0e-7) {
+                    d = +h[c >> 3] < +h[f >> 3] ? 1.0 : -1.0;
+                    break;
+                  }
+                  if (!(+B(+(e - d)) <= 1.0e-7)) {
+                    k = +h[i >> 3];
+                    d = (+h[f >> 3] - k) * (d - e) - (+h[c >> 3] - k) * (g - e);
+                    break;
+                  } else {
+                    d = +h[c >> 3] < +h[i >> 3] ? 1.0 : -1.0;
+                    break;
+                  }
+                }
+              while (0);
+              return (d > 0.0) | 0;
+            }
+            function IV(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              return (
+                c[
+                  (b +
+                    (((c[((d | 0) == 1 ? (b + ((a * 56) | 0) + 48) | 0 : (b + ((a * 56) | 0) + 44) | 0) >> 2] | 0) *
+                      56) |
+                      0) +
+                    32) >>
+                    2
+                ] | 0
+              );
+            }
+            function JV(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              e = l;
+              l = (l + 16) | 0;
+              d = e;
+              b = c[47395] | 0;
+              if ((b | 0) < (c[47394] | 0)) {
+                c[(a + ((b * 72) | 0)) >> 2] = -1;
+                c[(a + ((b * 72) | 0) + 4) >> 2] = -1;
+                c[(a + ((b * 72) | 0) + 68) >> 2] = 1;
+                c[47395] = b + 1;
+                l = e;
+                return b | 0;
+              } else {
+                e = c[15712] | 0;
+                c[d >> 2] = b;
+                w4(e, 138483, d) | 0;
+                qa(138394, 138396, 88, 138521);
+              }
+              return 0;
+            }
+            function KV() {
+              var a = 0;
+              a = c[47396] | 0;
+              if ((a | 0) < (c[47393] | 0)) {
+                c[47396] = a + 1;
+                return a | 0;
+              } else {
+                U4(138444, 30, 1, c[15712] | 0) | 0;
+                qa(138394, 138396, 72, 138475);
+              }
+              return 0;
+            }
+            function LV(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0,
+                d = 0.0;
+              c = +h[(a + 8) >> 3];
+              d = +h[(b + 8) >> 3];
+              if (!(c > d + 1.0e-7))
+                if (c < d + -1.0e-7) a = 0;
+                else a = (+h[a >> 3] >= +h[b >> 3]) & 1;
+              else a = 1;
+              return a | 0;
+            }
+            function MV(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0,
+                d = 0.0;
+              c = +h[(a + 8) >> 3];
+              d = +h[(b + 8) >> 3];
+              if (!(c < d + -1.0e-7))
+                if (c > d + 1.0e-7) a = 0;
+                else a = (+h[a >> 3] < +h[b >> 3]) & 1;
+              else a = 1;
+              return a | 0;
+            }
+            function NV(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0;
+              q = (f + ((d * 72) | 0) + 24) | 0;
+              p = (e | 0) == 1;
+              a: while (1) {
+                o = (f + ((b * 72) | 0) + 24) | 0;
+                j = (f + ((b * 72) | 0) + 48) | 0;
+                k = (f + ((b * 72) | 0) + 52) | 0;
+                l = (f + ((b * 72) | 0)) | 0;
+                m = (f + ((b * 72) | 0) + 4) | 0;
+                n = (f + ((b * 72) | 0) + 56) | 0;
+                if ((b | 0) <= 0) break;
+                while (1) {
+                  if (!(LV(o, q) | 0)) break a;
+                  d = c[j >> 2] | 0;
+                  e = (d | 0) > 0;
+                  do
+                    if (p) {
+                      if (e ? (c[(f + ((d * 72) | 0) + 4) >> 2] | 0) == (a | 0) : 0) break;
+                      d = c[k >> 2] | 0;
+                      if ((d | 0) <= 0) {
+                        b = d;
+                        continue a;
+                      }
+                      if ((c[(f + ((d * 72) | 0) + 4) >> 2] | 0) != (a | 0)) {
+                        b = d;
+                        continue a;
+                      }
+                    } else {
+                      if (e ? (c[(f + ((d * 72) | 0)) >> 2] | 0) == (a | 0) : 0) break;
+                      d = c[k >> 2] | 0;
+                      if ((d | 0) <= 0) {
+                        b = d;
+                        continue a;
+                      }
+                      if ((c[(f + ((d * 72) | 0)) >> 2] | 0) != (a | 0)) {
+                        b = d;
+                        continue a;
+                      }
+                    }
+                  while (0);
+                  if ((c[l >> 2] | 0) != (c[(f + ((d * 72) | 0)) >> 2] | 0)) {
+                    b = d;
+                    continue a;
+                  }
+                  if ((c[m >> 2] | 0) != (c[(f + ((d * 72) | 0) + 4) >> 2] | 0)) {
+                    b = d;
+                    continue a;
+                  }
+                  r = c[(f + ((d * 72) | 0) + 56) >> 2] | 0;
+                  e = c[(g + ((r * 40) | 0) + 28) >> 2] | 0;
+                  h = (g + ((e * 40) | 0) + 32) | 0;
+                  i = c[n >> 2] | 0;
+                  if ((c[h >> 2] | 0) == (r | 0)) c[h >> 2] = i;
+                  else c[(g + ((e * 40) | 0) + 36) >> 2] = i;
+                  e = c[(f + ((d * 72) | 0) + 48) >> 2] | 0;
+                  c[j >> 2] = e;
+                  do
+                    if ((e | 0) > 0) {
+                      h = (f + ((e * 72) | 0) + 40) | 0;
+                      if ((c[h >> 2] | 0) == (d | 0)) {
+                        c[h >> 2] = b;
+                        break;
+                      }
+                      e = (f + ((e * 72) | 0) + 44) | 0;
+                      if ((c[e >> 2] | 0) == (d | 0)) c[e >> 2] = b;
+                    }
+                  while (0);
+                  e = c[(f + ((d * 72) | 0) + 52) >> 2] | 0;
+                  c[k >> 2] = e;
+                  do
+                    if ((e | 0) > 0) {
+                      h = (f + ((e * 72) | 0) + 40) | 0;
+                      if ((c[h >> 2] | 0) == (d | 0)) {
+                        c[h >> 2] = b;
+                        break;
+                      }
+                      e = (f + ((e * 72) | 0) + 44) | 0;
+                      if ((c[e >> 2] | 0) == (d | 0)) c[e >> 2] = b;
+                    }
+                  while (0);
+                  r = (f + ((d * 72) | 0) + 24) | 0;
+                  c[o >> 2] = c[r >> 2];
+                  c[(o + 4) >> 2] = c[(r + 4) >> 2];
+                  c[(o + 8) >> 2] = c[(r + 8) >> 2];
+                  c[(o + 12) >> 2] = c[(r + 12) >> 2];
+                  c[(f + ((d * 72) | 0) + 68) >> 2] = 2;
+                }
+              }
+              return;
+            }
+            function OV(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0;
+              e = +h[(b + 8) >> 3];
+              f = +h[(d + 8) >> 3];
+              do
+                if (!(e > f + 1.0e-7)) {
+                  if (!(+B(+(e - f)) <= 1.0e-7)) {
+                    c[a >> 2] = c[d >> 2];
+                    c[(a + 4) >> 2] = c[(d + 4) >> 2];
+                    c[(a + 8) >> 2] = c[(d + 8) >> 2];
+                    c[(a + 12) >> 2] = c[(d + 12) >> 2];
+                    break;
+                  }
+                  if (+h[b >> 3] > +h[d >> 3] + 1.0e-7) {
+                    c[a >> 2] = c[b >> 2];
+                    c[(a + 4) >> 2] = c[(b + 4) >> 2];
+                    c[(a + 8) >> 2] = c[(b + 8) >> 2];
+                    c[(a + 12) >> 2] = c[(b + 12) >> 2];
+                    break;
+                  } else {
+                    c[a >> 2] = c[d >> 2];
+                    c[(a + 4) >> 2] = c[(d + 4) >> 2];
+                    c[(a + 8) >> 2] = c[(d + 8) >> 2];
+                    c[(a + 12) >> 2] = c[(d + 12) >> 2];
+                    break;
+                  }
+                } else {
+                  c[a >> 2] = c[b >> 2];
+                  c[(a + 4) >> 2] = c[(b + 4) >> 2];
+                  c[(a + 8) >> 2] = c[(b + 8) >> 2];
+                  c[(a + 12) >> 2] = c[(b + 12) >> 2];
+                }
+              while (0);
+              return;
+            }
+            function PV(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0;
+              e = +h[(b + 8) >> 3];
+              f = +h[(d + 8) >> 3];
+              do
+                if (!(e < f + -1.0e-7)) {
+                  if (!(+B(+(e - f)) <= 1.0e-7)) {
+                    c[a >> 2] = c[d >> 2];
+                    c[(a + 4) >> 2] = c[(d + 4) >> 2];
+                    c[(a + 8) >> 2] = c[(d + 8) >> 2];
+                    c[(a + 12) >> 2] = c[(d + 12) >> 2];
+                    break;
+                  }
+                  if (+h[b >> 3] < +h[d >> 3]) {
+                    c[a >> 2] = c[b >> 2];
+                    c[(a + 4) >> 2] = c[(b + 4) >> 2];
+                    c[(a + 8) >> 2] = c[(b + 8) >> 2];
+                    c[(a + 12) >> 2] = c[(b + 12) >> 2];
+                    break;
+                  } else {
+                    c[a >> 2] = c[d >> 2];
+                    c[(a + 4) >> 2] = c[(d + 4) >> 2];
+                    c[(a + 8) >> 2] = c[(d + 8) >> 2];
+                    c[(a + 12) >> 2] = c[(d + 12) >> 2];
+                    break;
+                  }
+                } else {
+                  c[a >> 2] = c[b >> 2];
+                  c[(a + 4) >> 2] = c[(b + 4) >> 2];
+                  c[(a + 8) >> 2] = c[(b + 8) >> 2];
+                  c[(a + 12) >> 2] = c[(b + 12) >> 2];
+                }
+              while (0);
+              return;
+            }
+            function QV(a) {
+              a = a | 0;
+              var b = 0;
+              b = JK(8) | 0;
+              if (b | 0) {
+                c[(b + 4) >> 2] = a;
+                c[b >> 2] = 0;
+              }
+              return b | 0;
+            }
+            function RV(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if (b) {
+                b = QV(b) | 0;
+                c[b >> 2] = a;
+                a = b;
+              }
+              return a | 0;
+            }
+            function SV(a) {
+              a = a | 0;
+              var b = 0;
+              do {
+                b = a;
+                a = c[a >> 2] | 0;
+                U1(b);
+              } while ((a | 0) != 0);
+              return;
+            }
+            function TV() {
+              var a = 0;
+              a = JK(1992) | 0;
+              if (a | 0) c[a >> 2] = UV(a) | 0;
+              return a | 0;
+            }
+            function UV(a) {
+              a = a | 0;
+              var b = 0;
+              b = _V(a) | 0;
+              c[(b + 4) >> 2] = 0;
+              a = (a + 1972) | 0;
+              c[a >> 2] = (c[a >> 2] | 0) + 1;
+              return b | 0;
+            }
+            function VV(a) {
+              a = a | 0;
+              WV(a, c[a >> 2] | 0);
+              U1(c[a >> 2] | 0);
+              U1(a);
+              return 0;
+            }
+            function WV(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              g = (a + 1980) | 0;
+              h = (a + 1912) | 0;
+              i = (a + 1936) | 0;
+              a: do
+                if ((c[(b + 4) >> 2] | 0) > 0) {
+                  d = 0;
+                  while (1) {
+                    if ((d | 0) == 64) break a;
+                    e = (b + 8 + ((d * 20) | 0) + 16) | 0;
+                    f = c[e >> 2] | 0;
+                    if (
+                      f | 0
+                        ? (WV(a, f), U1(c[e >> 2] | 0), eW(b, d), (c[g >> 2] = (c[g >> 2] | 0) + -1), c[h >> 2] | 0)
+                        : 0
+                    )
+                      c[i >> 2] = (c[i >> 2] | 0) + 1;
+                    d = (d + 1) | 0;
+                  }
+                } else {
+                  d = 0;
+                  while (1) {
+                    if ((d | 0) == 64) break a;
+                    if (
+                      c[(b + 8 + ((d * 20) | 0) + 16) >> 2] | 0
+                        ? (eW(b, d), (c[g >> 2] = (c[g >> 2] | 0) + -1), c[h >> 2] | 0)
+                        : 0
+                    )
+                      c[i >> 2] = (c[i >> 2] | 0) + 1;
+                    d = (d + 1) | 0;
+                  }
+                }
+              while (0);
+              return;
+            }
+            function XV(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              if (!b) qa(138879, 138529, 194, 138537);
+              e = c[(b + 4) >> 2] | 0;
+              if ((e | 0) <= -1) qa(138549, 138529, 195, 138537);
+              if (!d) qa(138821, 138529, 196, 138537);
+              i = (a + 1952) | 0;
+              c[i >> 2] = (c[i >> 2] | 0) + 1;
+              a: do
+                if ((e | 0) > 0) {
+                  i = 0;
+                  e = 0;
+                  while (1) {
+                    if ((i | 0) == 64) break a;
+                    f = (b + 8 + ((i * 20) | 0) + 16) | 0;
+                    if ((c[f >> 2] | 0) != 0 ? (jW(d, (b + 8 + ((i * 20) | 0)) | 0) | 0) != 0 : 0) {
+                      g = XV(a, c[f >> 2] | 0, d) | 0;
+                      if (!e) e = g;
+                      else {
+                        f = e;
+                        while (1) {
+                          h = c[f >> 2] | 0;
+                          if (!h) break;
+                          else f = h;
+                        }
+                        c[f >> 2] = g;
+                      }
+                    }
+                    i = (i + 1) | 0;
+                  }
+                } else {
+                  g = 0;
+                  e = 0;
+                  while (1) {
+                    if ((g | 0) == 64) break a;
+                    f = (b + 8 + ((g * 20) | 0)) | 0;
+                    if ((c[(b + 8 + ((g * 20) | 0) + 16) >> 2] | 0) != 0 ? (jW(d, f) | 0) != 0 : 0) e = RV(e, f) | 0;
+                    g = (g + 1) | 0;
+                  }
+                }
+              while (0);
+              return e | 0;
+            }
+            function YV(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              p = l;
+              l = (l + 64) | 0;
+              k = (p + 52) | 0;
+              m = (p + 32) | 0;
+              n = (p + 16) | 0;
+              o = p;
+              c[k >> 2] = 0;
+              if (!(((b | 0) != 0) & ((e | 0) != 0))) qa(138735, 138529, 247, 138563);
+              if ((f | 0) > -1 ? ((j = c[e >> 2] | 0), (c[(j + 4) >> 2] | 0) >= (f | 0)) : 0) {
+                g = 0;
+                while (1) {
+                  if ((g | 0) >= 2) break;
+                  if ((c[(b + (g << 2)) >> 2] | 0) > (c[(b + ((g + 2) << 2)) >> 2] | 0)) {
+                    h = 8;
+                    break;
+                  } else g = (g + 1) | 0;
+                }
+                if ((h | 0) == 8) qa(138610, 138529, 250, 138563);
+                i = (a + 1912) | 0;
+                g = (a + 1908) | 0;
+                h = c[g >> 2] | 0;
+                if (c[i >> 2] | 0) {
+                  q = h | 0 ? (a + 1924) | 0 : (a + 1916) | 0;
+                  c[q >> 2] = (c[q >> 2] | 0) + 1;
+                }
+                if (!h) {
+                  q = (a + 1964) | 0;
+                  c[q >> 2] = (c[q >> 2] | 0) + 1;
+                }
+                if (!(ZV(a, b, d, j, k, f) | 0)) g = 0;
+                else {
+                  if (c[i >> 2] | 0) {
+                    q = c[g >> 2] | 0 ? (a + 1948) | 0 : (a + 1944) | 0;
+                    c[q >> 2] = (c[q >> 2] | 0) + 1;
+                  }
+                  g = _V(a) | 0;
+                  q = (a + 1976) | 0;
+                  c[q >> 2] = (c[q >> 2] | 0) + 1;
+                  q = c[e >> 2] | 0;
+                  c[(g + 4) >> 2] = (c[(q + 4) >> 2] | 0) + 1;
+                  bW(n, q);
+                  c[m >> 2] = c[n >> 2];
+                  c[(m + 4) >> 2] = c[(n + 4) >> 2];
+                  c[(m + 8) >> 2] = c[(n + 8) >> 2];
+                  c[(m + 12) >> 2] = c[(n + 12) >> 2];
+                  q = (m + 16) | 0;
+                  c[q >> 2] = c[e >> 2];
+                  dW(a, m, g, 0) | 0;
+                  bW(o, c[k >> 2] | 0);
+                  c[m >> 2] = c[o >> 2];
+                  c[(m + 4) >> 2] = c[(o + 4) >> 2];
+                  c[(m + 8) >> 2] = c[(o + 8) >> 2];
+                  c[(m + 12) >> 2] = c[(o + 12) >> 2];
+                  c[q >> 2] = c[k >> 2];
+                  dW(a, m, g, 0) | 0;
+                  c[e >> 2] = g;
+                  g = (a + 1980) | 0;
+                  c[g >> 2] = (c[g >> 2] | 0) + 2;
+                  g = 1;
+                }
+                l = p;
+                return g | 0;
+              }
+              qa(138575, 138529, 248, 138563);
+              return 0;
+            }
+            function ZV(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              q = l;
+              l = (l + 80) | 0;
+              m = (q + 52) | 0;
+              n = (q + 48) | 0;
+              o = (q + 32) | 0;
+              p = (q + 16) | 0;
+              k = q;
+              c[n >> 2] = 0;
+              if (!(((b | 0) != 0) & ((e | 0) != 0) & ((f | 0) != 0))) qa(138653, 138529, 311, 138667);
+              if ((g | 0) > -1 ? ((i = (e + 4) | 0), (h = c[i >> 2] | 0), (h | 0) >= (g | 0)) : 0) {
+                if (c[(a + 1912) >> 2] | 0) {
+                  h = c[(a + 1908) >> 2] | 0 ? (a + 1948) | 0 : (a + 1944) | 0;
+                  c[h >> 2] = (c[h >> 2] | 0) + 1;
+                  h = c[i >> 2] | 0;
+                }
+                do
+                  if ((h | 0) > (g | 0)) {
+                    i = cW(b, e) | 0;
+                    h = (e + 8 + ((i * 20) | 0) + 16) | 0;
+                    i = (e + 8 + ((i * 20) | 0)) | 0;
+                    if (!(ZV(a, b, d, c[h >> 2] | 0, n, g) | 0)) {
+                      iW(o, b, i);
+                      c[i >> 2] = c[o >> 2];
+                      c[(i + 4) >> 2] = c[(o + 4) >> 2];
+                      c[(i + 8) >> 2] = c[(o + 8) >> 2];
+                      c[(i + 12) >> 2] = c[(o + 12) >> 2];
+                      j = 0;
+                      break;
+                    } else {
+                      bW(p, c[h >> 2] | 0);
+                      c[i >> 2] = c[p >> 2];
+                      c[(i + 4) >> 2] = c[(p + 4) >> 2];
+                      c[(i + 8) >> 2] = c[(p + 8) >> 2];
+                      c[(i + 12) >> 2] = c[(p + 12) >> 2];
+                      j = c[n >> 2] | 0;
+                      c[(m + 16) >> 2] = j;
+                      bW(k, j);
+                      c[m >> 2] = c[k >> 2];
+                      c[(m + 4) >> 2] = c[(k + 4) >> 2];
+                      c[(m + 8) >> 2] = c[(k + 8) >> 2];
+                      c[(m + 12) >> 2] = c[(k + 12) >> 2];
+                      j = (a + 1980) | 0;
+                      c[j >> 2] = (c[j >> 2] | 0) + 1;
+                      j = dW(a, m, e, f) | 0;
+                      break;
+                    }
+                  } else if ((h | 0) == (g | 0)) {
+                    c[m >> 2] = c[b >> 2];
+                    c[(m + 4) >> 2] = c[(b + 4) >> 2];
+                    c[(m + 8) >> 2] = c[(b + 8) >> 2];
+                    c[(m + 12) >> 2] = c[(b + 12) >> 2];
+                    c[(m + 16) >> 2] = d;
+                    j = (a + 1980) | 0;
+                    c[j >> 2] = (c[j >> 2] | 0) + 1;
+                    j = dW(a, m, e, f) | 0;
+                    break;
+                  } else qa(138712, 138529, 341, 138667);
+                while (0);
+                l = q;
+                return j | 0;
+              }
+              qa(138680, 138529, 312, 138667);
+              return 0;
+            }
+            function _V(a) {
+              a = a | 0;
+              a = (a + 1968) | 0;
+              c[a >> 2] = (c[a >> 2] | 0) + 1;
+              a = T1(1288) | 0;
+              $V(a);
+              return a | 0;
+            }
+            function $V(a) {
+              a = a | 0;
+              var b = 0;
+              c[a >> 2] = 0;
+              c[(a + 4) >> 2] = -1;
+              b = 0;
+              while (1) {
+                if ((b | 0) == 64) break;
+                aW((a + 8 + ((b * 20) | 0)) | 0);
+                b = (b + 1) | 0;
+              }
+              return;
+            }
+            function aW(a) {
+              a = a | 0;
+              fW(a);
+              c[(a + 16) >> 2] = 0;
+              return;
+            }
+            function bW(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 32) | 0;
+              g = (i + 16) | 0;
+              h = i;
+              if (!b) qa(138879, 138718, 99, 138725);
+              fW(g);
+              d = 1;
+              f = 0;
+              while (1) {
+                if ((f | 0) == 64) break;
+                do
+                  if (c[(b + 8 + ((f * 20) | 0) + 16) >> 2] | 0) {
+                    e = (b + 8 + ((f * 20) | 0)) | 0;
+                    if (!d) {
+                      iW(h, g, e);
+                      c[g >> 2] = c[h >> 2];
+                      c[(g + 4) >> 2] = c[(h + 4) >> 2];
+                      c[(g + 8) >> 2] = c[(h + 8) >> 2];
+                      c[(g + 12) >> 2] = c[(h + 12) >> 2];
+                      d = 0;
+                      break;
+                    } else {
+                      c[g >> 2] = c[e >> 2];
+                      c[(g + 4) >> 2] = c[(e + 4) >> 2];
+                      c[(g + 8) >> 2] = c[(e + 8) >> 2];
+                      c[(g + 12) >> 2] = c[(e + 12) >> 2];
+                      d = 0;
+                      break;
+                    }
+                  }
+                while (0);
+                f = (f + 1) | 0;
+              }
+              c[a >> 2] = c[g >> 2];
+              c[(a + 4) >> 2] = c[(g + 4) >> 2];
+              c[(a + 8) >> 2] = c[(g + 8) >> 2];
+              c[(a + 12) >> 2] = c[(g + 12) >> 2];
+              l = i;
+              return;
+            }
+            function cW(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              k = l;
+              l = (l + 32) | 0;
+              i = (k + 16) | 0;
+              j = k;
+              if (!(((a | 0) != 0) & ((b | 0) != 0))) qa(138735, 138718, 125, 138742);
+              d = 0;
+              e = 0;
+              f = 0;
+              g = 1;
+              h = 0;
+              while (1) {
+                if ((h | 0) == 64) break;
+                if (c[(b + 8 + ((h * 20) | 0) + 16) >> 2] | 0) {
+                  n = (b + 8 + ((h * 20) | 0)) | 0;
+                  p = hW(n) | 0;
+                  iW(j, a, n);
+                  c[i >> 2] = c[j >> 2];
+                  c[(i + 4) >> 2] = c[(j + 4) >> 2];
+                  c[(i + 8) >> 2] = c[(j + 8) >> 2];
+                  c[(i + 12) >> 2] = c[(j + 12) >> 2];
+                  n = ((hW(i) | 0) - p) | 0;
+                  m = ((g | 0) != 0) | ((n | 0) < (f | 0));
+                  o = m | (((p | 0) < (e | 0)) & ((n | 0) == (f | 0)));
+                  d = o ? h : d;
+                  e = o ? p : e;
+                  f = o ? n : f;
+                  g = m ? 0 : g;
+                }
+                h = (h + 1) | 0;
+              }
+              l = k;
+              return d | 0;
+            }
+            function dW(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              if (!b) qa(138901, 138718, 167, 138753);
+              if (!d) qa(138879, 138718, 168, 138753);
+              do
+                if ((c[d >> 2] | 0) < 64) {
+                  a = 0;
+                  while (1) {
+                    if ((a | 0) >= 64) {
+                      e = 10;
+                      break;
+                    }
+                    if (!(c[(d + 8 + ((a * 20) | 0) + 16) >> 2] | 0)) {
+                      e = 8;
+                      break;
+                    }
+                    a = (a + 1) | 0;
+                  }
+                  if ((e | 0) == 8) {
+                    f = (d + 8 + ((a * 20) | 0)) | 0;
+                    c[f >> 2] = c[b >> 2];
+                    c[(f + 4) >> 2] = c[(b + 4) >> 2];
+                    c[(f + 8) >> 2] = c[(b + 8) >> 2];
+                    c[(f + 12) >> 2] = c[(b + 12) >> 2];
+                    c[(f + 16) >> 2] = c[(b + 16) >> 2];
+                    f = 0;
+                    g = d;
+                    break;
+                  } else if ((e | 0) == 10) qa(138763, 138718, 178, 138753);
+                } else {
+                  if (c[(a + 1912) >> 2] | 0) {
+                    h = c[(a + 1908) >> 2] | 0 ? (a + 1948) | 0 : (a + 1944) | 0;
+                    c[h >> 2] = (c[h >> 2] | 0) + 1;
+                  }
+                  if (!e) qa(138776, 138718, 187, 138753);
+                  else {
+                    kW(a, d, b, e);
+                    f = 1;
+                    g = (c[(d + 4) >> 2] | 0) == 0 ? (a + 1972) | 0 : (a + 1976) | 0;
+                    break;
+                  }
+                }
+              while (0);
+              c[g >> 2] = (c[g >> 2] | 0) + 1;
+              return f | 0;
+            }
+            function eW(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if (!(((a | 0) != 0) & (b >>> 0 < 64))) qa(138780, 138718, 201, 138808);
+              if (!(c[(a + 8 + ((b * 20) | 0) + 16) >> 2] | 0)) qa(139302, 138718, 202, 138808);
+              else {
+                aW((a + 8 + ((b * 20) | 0)) | 0);
+                c[a >> 2] = (c[a >> 2] | 0) + -1;
+                return;
+              }
+            }
+            function fW(a) {
+              a = a | 0;
+              var b = 0;
+              b = 0;
+              while (1) {
+                if ((b | 0) == 4) break;
+                c[(a + (b << 2)) >> 2] = 0;
+                b = (b + 1) | 0;
+              }
+              return;
+            }
+            function gW(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              e = l;
+              l = (l + 16) | 0;
+              d = e;
+              c[d >> 2] = 1;
+              c[(d + 8) >> 2] = -1;
+              b = 1;
+              while (1) {
+                if ((b | 0) == 2) break;
+                c[(d + ((b + 2) << 2)) >> 2] = 0;
+                c[(d + (b << 2)) >> 2] = 0;
+                b = (b + 1) | 0;
+              }
+              c[a >> 2] = c[d >> 2];
+              c[(a + 4) >> 2] = c[(d + 4) >> 2];
+              c[(a + 8) >> 2] = c[(d + 8) >> 2];
+              c[(a + 12) >> 2] = c[(d + 12) >> 2];
+              l = e;
+              return;
+            }
+            function hW(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              if (!a) qa(138821, 138823, 128, 138835);
+              a: do
+                if ((c[a >> 2] | 0) > (c[(a + 8) >> 2] | 0)) b = 0;
+                else {
+                  b = 1;
+                  d = 0;
+                  while (1) {
+                    if ((d | 0) == 2) break a;
+                    e = O(c[(a + ((d + 2) << 2)) >> 2] | 0, b) | 0;
+                    b = (e - (c[(a + (d << 2)) >> 2] | 0)) | 0;
+                    d = (d + 1) | 0;
+                  }
+                }
+              while (0);
+              return b | 0;
+            }
+            function iW(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              g = l;
+              l = (l + 16) | 0;
+              f = g;
+              if (!(((b | 0) != 0) & ((d | 0) != 0))) qa(138844, 138823, 195, 138852);
+              do
+                if ((c[b >> 2] | 0) > (c[(b + 8) >> 2] | 0)) {
+                  c[a >> 2] = c[d >> 2];
+                  c[(a + 4) >> 2] = c[(d + 4) >> 2];
+                  c[(a + 8) >> 2] = c[(d + 8) >> 2];
+                  c[(a + 12) >> 2] = c[(d + 12) >> 2];
+                } else {
+                  if ((c[d >> 2] | 0) > (c[(d + 8) >> 2] | 0)) {
+                    c[a >> 2] = c[b >> 2];
+                    c[(a + 4) >> 2] = c[(b + 4) >> 2];
+                    c[(a + 8) >> 2] = c[(b + 8) >> 2];
+                    c[(a + 12) >> 2] = c[(b + 12) >> 2];
+                    break;
+                  } else e = 0;
+                  while (1) {
+                    if ((e | 0) == 2) break;
+                    j = c[(b + (e << 2)) >> 2] | 0;
+                    h = c[(d + (e << 2)) >> 2] | 0;
+                    c[(f + (e << 2)) >> 2] = (j | 0) < (h | 0) ? j : h;
+                    h = (e + 2) | 0;
+                    j = c[(b + (h << 2)) >> 2] | 0;
+                    i = c[(d + (h << 2)) >> 2] | 0;
+                    c[(f + (h << 2)) >> 2] = (j | 0) > (i | 0) ? j : i;
+                    e = (e + 1) | 0;
+                  }
+                  c[a >> 2] = c[f >> 2];
+                  c[(a + 4) >> 2] = c[(f + 4) >> 2];
+                  c[(a + 8) >> 2] = c[(f + 8) >> 2];
+                  c[(a + 12) >> 2] = c[(f + 12) >> 2];
+                }
+              while (0);
+              l = g;
+              return;
+            }
+            function jW(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              if (((a | 0) != 0) & ((b | 0) != 0)) d = 0;
+              else qa(138864, 138823, 216, 138871);
+              while (1) {
+                if ((d | 0) >= 2) {
+                  d = 1;
+                  break;
+                }
+                e = (d + 2) | 0;
+                if ((c[(a + (d << 2)) >> 2] | 0) > (c[(b + (e << 2)) >> 2] | 0)) {
+                  d = 0;
+                  break;
+                }
+                if ((c[(b + (d << 2)) >> 2] | 0) > (c[(a + (e << 2)) >> 2] | 0)) {
+                  d = 0;
+                  break;
+                } else d = (d + 1) | 0;
+              }
+              return d | 0;
+            }
+            function kW(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              if (!b) qa(138879, 138881, 40, 138891);
+              if (!d) qa(138901, 138881, 41, 138891);
+              j = (a + 1912) | 0;
+              if (c[j >> 2] | 0) {
+                i = c[(a + 1908) >> 2] | 0 ? (a + 1932) | 0 : (a + 1928) | 0;
+                c[i >> 2] = (c[i >> 2] | 0) + 1;
+              }
+              h = (b + 4) | 0;
+              i = c[h >> 2] | 0;
+              lW(a, b, d);
+              d = (a + 1324) | 0;
+              mW(a);
+              f = hW((a + 1852) | 0) | 0;
+              f = ((hW((a + 1868) | 0) | 0) + f) | 0;
+              if (c[j >> 2] | 0 ? ((f | 0) != 0) & ((c[(a + 1908) >> 2] | 0) == 0) : 0) {
+                j = (a + 1960) | 0;
+                g[j >> 2] = +((c[(a + 1320) >> 2] | 0) >>> 0) / +(f | 0) + +g[j >> 2];
+              }
+              j = _V(a) | 0;
+              c[e >> 2] = j;
+              c[h >> 2] = i;
+              c[(j + 4) >> 2] = i;
+              nW(a, b, j, d);
+              if ((((c[c[e >> 2] >> 2] | 0) + (c[b >> 2] | 0)) | 0) == 65) return;
+              else qa(138903, 138881, 86, 138891);
+            }
+            function lW(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              h = l;
+              l = (l + 16) | 0;
+              g = h;
+              if (!b) qa(138879, 138881, 106, 139290);
+              if (!d) qa(138901, 138881, 107, 139290);
+              else e = 0;
+              while (1) {
+                if ((e | 0) >= 64) break;
+                if (!(c[(b + 8 + ((e * 20) | 0) + 16) >> 2] | 0)) {
+                  f = 7;
+                  break;
+                }
+                j = (b + 8 + ((e * 20) | 0)) | 0;
+                i = (a + 4 + ((e * 20) | 0)) | 0;
+                c[i >> 2] = c[j >> 2];
+                c[(i + 4) >> 2] = c[(j + 4) >> 2];
+                c[(i + 8) >> 2] = c[(j + 8) >> 2];
+                c[(i + 12) >> 2] = c[(j + 12) >> 2];
+                c[(i + 16) >> 2] = c[(j + 16) >> 2];
+                e = (e + 1) | 0;
+              }
+              if ((f | 0) == 7) qa(139302, 138881, 111, 139290);
+              e = (a + 4) | 0;
+              j = (a + 1284) | 0;
+              c[j >> 2] = c[d >> 2];
+              c[(j + 4) >> 2] = c[(d + 4) >> 2];
+              c[(j + 8) >> 2] = c[(d + 8) >> 2];
+              c[(j + 12) >> 2] = c[(d + 12) >> 2];
+              c[(j + 16) >> 2] = c[(d + 16) >> 2];
+              d = (a + 1304) | 0;
+              c[d >> 2] = c[e >> 2];
+              c[(d + 4) >> 2] = c[(e + 4) >> 2];
+              c[(d + 8) >> 2] = c[(e + 8) >> 2];
+              c[(d + 12) >> 2] = c[(e + 12) >> 2];
+              e = 1;
+              while (1) {
+                if ((e | 0) == 65) break;
+                iW(g, d, (a + 4 + ((e * 20) | 0)) | 0);
+                c[d >> 2] = c[g >> 2];
+                c[(d + 4) >> 2] = c[(g + 4) >> 2];
+                c[(d + 8) >> 2] = c[(g + 8) >> 2];
+                c[(d + 12) >> 2] = c[(g + 12) >> 2];
+                e = (e + 1) | 0;
+              }
+              c[(a + 1320) >> 2] = hW(d) | 0;
+              $V(b);
+              l = h;
+              return;
+            }
+            function mW(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0;
+              u = l;
+              l = (l + 48) | 0;
+              i = (u + 32) | 0;
+              k = (u + 16) | 0;
+              m = u;
+              oW(a);
+              pW(a);
+              q = (a + 1844) | 0;
+              s = (a + 1848) | 0;
+              t = (a + 1892) | 0;
+              n = (a + 1852) | 0;
+              o = (a + 1884) | 0;
+              p = (a + 1868) | 0;
+              j = (a + 1888) | 0;
+              f = 0;
+              e = 0;
+              while (1) {
+                d = c[q >> 2] | 0;
+                b = c[s >> 2] | 0;
+                if (((b + d) | 0) >= 65) break;
+                h = (65 - (c[t >> 2] | 0)) | 0;
+                if (((d | 0) < (h | 0)) & ((b | 0) < (h | 0))) {
+                  g = -1;
+                  h = 0;
+                } else {
+                  r = 12;
+                  break;
+                }
+                while (1) {
+                  if ((h | 0) == 65) break;
+                  if (!(c[(a + 1584 + (h << 2)) >> 2] | 0)) {
+                    v = (a + 4 + ((h * 20) | 0)) | 0;
+                    iW(k, v, n);
+                    c[i >> 2] = c[k >> 2];
+                    c[(i + 4) >> 2] = c[(k + 4) >> 2];
+                    c[(i + 8) >> 2] = c[(k + 8) >> 2];
+                    c[(i + 12) >> 2] = c[(k + 12) >> 2];
+                    b = hW(i) | 0;
+                    d = c[o >> 2] | 0;
+                    iW(m, v, p);
+                    c[i >> 2] = c[m >> 2];
+                    c[(i + 4) >> 2] = c[(m + 4) >> 2];
+                    c[(i + 8) >> 2] = c[(m + 8) >> 2];
+                    c[(i + 12) >> 2] = c[(m + 12) >> 2];
+                    v = hW(i) | 0;
+                    b = (v - (c[j >> 2] | 0) + (d - b)) | 0;
+                    d = (b | 0) > -1;
+                    b = d ? b : (0 - b) | 0;
+                    d = (d ^ 1) & 1;
+                    if ((b | 0) <= (g | 0))
+                      if ((b | 0) == (g | 0)) {
+                        v = (c[(a + 1844 + (d << 2)) >> 2] | 0) < (c[(a + 1844 + (f << 2)) >> 2] | 0);
+                        b = g;
+                        d = v ? d : f;
+                        e = v ? h : e;
+                      } else {
+                        b = g;
+                        d = f;
+                      }
+                    else e = h;
+                  } else {
+                    b = g;
+                    d = f;
+                  }
+                  g = b;
+                  h = (h + 1) | 0;
+                  f = d;
+                }
+                qW(a, e, f);
+              }
+              if ((r | 0) == 12) {
+                b = ((d | 0) >= ((65 - (c[t >> 2] | 0)) | 0)) & 1;
+                d = 0;
+                while (1) {
+                  if ((d | 0) == 65) break;
+                  if (!(c[(a + 1584 + (d << 2)) >> 2] | 0)) qW(a, d, b);
+                  d = (d + 1) | 0;
+                }
+                d = c[q >> 2] | 0;
+                b = c[s >> 2] | 0;
+              }
+              if (((b + d) | 0) != 65) qa(139046, 138881, 210, 139132);
+              v = c[t >> 2] | 0;
+              if (((d | 0) < (v | 0)) | ((b | 0) < (v | 0))) qa(139143, 138881, 212, 139132);
+              else {
+                l = u;
+                return;
+              }
+            }
+            function nW(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0;
+              if (!b) qa(138879, 138881, 297, 138943);
+              if (!d) qa(138953, 138881, 298, 138943);
+              if (!e) qa(138955, 138881, 299, 138943);
+              else f = 0;
+              while (1) {
+                if ((f | 0) >= 65) {
+                  e = 14;
+                  break;
+                }
+                e = c[(a + 1324 + (f << 2)) >> 2] | 0;
+                if (e >>> 0 >= 2) {
+                  e = 9;
+                  break;
+                }
+                switch (e | 0) {
+                  case 0: {
+                    dW(a, (a + 4 + ((f * 20) | 0)) | 0, b, 0) | 0;
+                    break;
+                  }
+                  case 1: {
+                    dW(a, (a + 4 + ((f * 20) | 0)) | 0, d, 0) | 0;
+                    break;
+                  }
+                  default: {
+                  }
+                }
+                f = (f + 1) | 0;
+              }
+              if ((e | 0) == 9) qa(138957, 138881, 303, 138943);
+              else if ((e | 0) == 14) return;
+            }
+            function oW(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              d = l;
+              l = (l + 16) | 0;
+              e = d;
+              c[(a + 1848) >> 2] = 0;
+              c[(a + 1844) >> 2] = 0;
+              b = (a + 1852) | 0;
+              f = (a + 1868) | 0;
+              gW(e);
+              c[f >> 2] = c[e >> 2];
+              c[(f + 4) >> 2] = c[(e + 4) >> 2];
+              c[(f + 8) >> 2] = c[(e + 8) >> 2];
+              c[(f + 12) >> 2] = c[(e + 12) >> 2];
+              c[b >> 2] = c[e >> 2];
+              c[(b + 4) >> 2] = c[(e + 4) >> 2];
+              c[(b + 8) >> 2] = c[(e + 8) >> 2];
+              c[(b + 12) >> 2] = c[(e + 12) >> 2];
+              c[(a + 1888) >> 2] = 0;
+              c[(a + 1884) >> 2] = 0;
+              b = 0;
+              while (1) {
+                if ((b | 0) == 65) break;
+                c[(a + 1584 + (b << 2)) >> 2] = 0;
+                c[(a + 1324 + (b << 2)) >> 2] = -1;
+                b = (b + 1) | 0;
+              }
+              l = d;
+              return;
+            }
+            function pW(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0;
+              o = l;
+              l = (l + 304) | 0;
+              k = (o + 32) | 0;
+              m = (o + 16) | 0;
+              n = o;
+              b = 0;
+              while (1) {
+                if ((b | 0) == 65) break;
+                c[(k + (b << 2)) >> 2] = hW((a + 4 + ((b * 20) | 0)) | 0) | 0;
+                b = (b + 1) | 0;
+              }
+              b = 0;
+              d = 0;
+              e = 0;
+              g = 0;
+              a: while (1) {
+                if ((g | 0) == 64) break;
+                i = (g + 1) | 0;
+                j = (a + 4 + ((g * 20) | 0)) | 0;
+                h = (k + (g << 2)) | 0;
+                f = i;
+                while (1) {
+                  if ((f | 0) == 65) {
+                    g = i;
+                    continue a;
+                  }
+                  iW(n, j, (a + 4 + ((f * 20) | 0)) | 0);
+                  c[m >> 2] = c[n >> 2];
+                  c[(m + 4) >> 2] = c[(n + 4) >> 2];
+                  c[(m + 8) >> 2] = c[(n + 8) >> 2];
+                  c[(m + 12) >> 2] = c[(n + 12) >> 2];
+                  p = hW(m) | 0;
+                  p = (p - (c[h >> 2] | 0) - (c[(k + (f << 2)) >> 2] | 0)) | 0;
+                  q = p >>> 0 > e >>> 0;
+                  r = q ? f : b;
+                  f = (f + 1) | 0;
+                  b = r;
+                  d = q ? g : d;
+                  e = q ? p : e;
+                }
+              }
+              qW(a, d, 0);
+              qW(a, b, 1);
+              l = o;
+              return;
+            }
+            function qW(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 16) | 0;
+              h = i;
+              e = (a + 1584 + (b << 2)) | 0;
+              if (c[e >> 2] | 0) qa(139246, 138881, 257, 139281);
+              c[(a + 1324 + (b << 2)) >> 2] = d;
+              c[e >> 2] = 1;
+              g = (a + 1844 + (d << 2)) | 0;
+              f = (a + 1852 + (d << 4)) | 0;
+              e = (a + 4 + ((b * 20) | 0)) | 0;
+              if (!(c[g >> 2] | 0)) {
+                c[f >> 2] = c[e >> 2];
+                c[(f + 4) >> 2] = c[(e + 4) >> 2];
+                c[(f + 8) >> 2] = c[(e + 8) >> 2];
+                c[(f + 12) >> 2] = c[(e + 12) >> 2];
+              } else {
+                iW(h, e, f);
+                c[f >> 2] = c[h >> 2];
+                c[(f + 4) >> 2] = c[(h + 4) >> 2];
+                c[(f + 8) >> 2] = c[(h + 8) >> 2];
+                c[(f + 12) >> 2] = c[(h + 12) >> 2];
+              }
+              c[(a + 1884 + (d << 2)) >> 2] = hW(f) | 0;
+              c[g >> 2] = (c[g >> 2] | 0) + 1;
+              l = i;
+              return;
+            }
+            function rW() {
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0;
+              t = l;
+              l = (l + 1200) | 0;
+              r = (t + 800) | 0;
+              g = t;
+              c[47397] = 0;
+              c[47398] = -2;
+              f = r;
+              i = 200;
+              n = g;
+              p = 0;
+              q = 0;
+              o = r;
+              a: while (1) {
+                b[o >> 1] = p;
+                if (((f + (i << 1) + -2) | 0) >>> 0 > o >>> 0) k = i;
+                else {
+                  m = (o - f) >> 1;
+                  e = (m + 1) | 0;
+                  if (i >>> 0 > 9999) {
+                    s = 95;
+                    break;
+                  }
+                  k = i << 1;
+                  k = k >>> 0 < 1e4 ? k : 1e4;
+                  h = T1((k * 6) | 3) | 0;
+                  if (h) {
+                    W6(h | 0, f | 0, (e << 1) | 0) | 0;
+                    i = (h + ((k >>> 1) << 2)) | 0;
+                    W6(i | 0, n | 0, (e << 2) | 0) | 0;
+                    if ((f | 0) == (r | 0)) {
+                      e = 0;
+                      f = h;
+                    } else {
+                      U1(f);
+                      e = 0;
+                      f = h;
+                    }
+                  } else {
+                    e = 4;
+                    i = n;
+                  }
+                  j = (e | 0) == 0;
+                  h = (f + (m << 1)) | 0;
+                  switch ((j ? (((f + (k << 1) + -2) | 0) >>> 0 > h >>> 0 ? 0 : 9) : e) & 15) {
+                    case 9: {
+                      e = 1;
+                      s = 96;
+                      break a;
+                    }
+                    case 4: {
+                      s = 95;
+                      break a;
+                    }
+                    case 0: {
+                      g = j ? (i + (m << 2)) | 0 : g;
+                      n = i;
+                      o = j ? h : o;
+                      break;
+                    }
+                    default: {
+                      e = 0;
+                      break a;
+                    }
+                  }
+                }
+                if ((p | 0) == 31) {
+                  e = 0;
+                  s = 96;
+                  break;
+                }
+                e = b[(65534 + (p << 1)) >> 1] | 0;
+                j = (e << 16) >> 16;
+                do
+                  if ((e << 16) >> 16 != -82) {
+                    h = c[47398] | 0;
+                    if ((h | 0) == -2) {
+                      h = GX() | 0;
+                      c[47398] = h;
+                    }
+                    if ((h | 0) >= 1)
+                      if (h >>> 0 < 296) i = d[(139321 + h) >> 0] | 0;
+                      else i = 2;
+                    else {
+                      c[47398] = 0;
+                      i = 0;
+                    }
+                    h = (i + j) | 0;
+                    if (h >>> 0 <= 271 ? (i | 0) == (a[(139617 + h) >> 0] | 0) : 0) {
+                      p = a[(139889 + h) >> 0] | 0;
+                      e = (p << 24) >> 24;
+                      if ((p << 24) >> 24 < 1) {
+                        h = (0 - e) | 0;
+                        s = 23;
+                        break;
+                      } else {
+                        c[47398] = -2;
+                        g = (g + 4) | 0;
+                        c[g >> 2] = c[47399];
+                        j = (q | 0) == 0 ? 0 : (q + -1) | 0;
+                        h = o;
+                        break;
+                      }
+                    } else s = 22;
+                  } else s = 22;
+                while (0);
+                if ((s | 0) == 22) {
+                  s = 0;
+                  p = a[(140161 + p) >> 0] | 0;
+                  h = p & 255;
+                  if (!((p << 24) >> 24)) {
+                    h = c[47398] | 0;
+                    b: do
+                      switch (q | 0) {
+                        case 0: {
+                          c[47397] = (c[47397] | 0) + 1;
+                          MW(143761);
+                          h = o;
+                          break;
+                        }
+                        case 3:
+                          if ((h | 0) < 1)
+                            if (!h) {
+                              e = 1;
+                              s = 96;
+                              break a;
+                            } else {
+                              h = o;
+                              break b;
+                            }
+                          else {
+                            c[47398] = -2;
+                            h = o;
+                            break b;
+                          }
+                        default:
+                          h = o;
+                      }
+                    while (0);
+                    while (1) {
+                      if ((e << 16) >> 16 == 8) break;
+                      if ((h | 0) == (f | 0)) {
+                        e = 1;
+                        s = 96;
+                        break a;
+                      }
+                      e = (h + -2) | 0;
+                      g = (g + -4) | 0;
+                      h = e;
+                      e = b[(65534 + (b[e >> 1] << 1)) >> 1] | 0;
+                    }
+                    g = (g + 4) | 0;
+                    c[g >> 2] = c[47399];
+                    e = 1;
+                    j = 3;
+                  } else s = 23;
+                }
+                do
+                  if ((s | 0) == 23) {
+                    s = 0;
+                    j = d[(140277 + h) >> 0] | 0;
+                    e = c[(g + ((1 - j) << 2)) >> 2] | 0;
+                    do
+                      switch (h | 0) {
+                        case 4: {
+                          s = 26;
+                          break a;
+                        }
+                        case 2: {
+                          c[47400] = sW(c[(g + -4) >> 2] | 0, 2) | 0;
+                          break;
+                        }
+                        case 3: {
+                          c[47400] = sW(c[(g + -4) >> 2] | 0, 1) | 0;
+                          break;
+                        }
+                        case 5: {
+                          e = uW() | 0;
+                          break;
+                        }
+                        case 8: {
+                          vW(c[47401] | 0);
+                          break;
+                        }
+                        case 9: {
+                          wW(c[g >> 2] | 0);
+                          break;
+                        }
+                        case 18: {
+                          xW(c[g >> 2] | 0);
+                          break;
+                        }
+                        case 19: {
+                          yW();
+                          break;
+                        }
+                        case 20: {
+                          xW(c[g >> 2] | 0);
+                          break;
+                        }
+                        case 21: {
+                          yW();
+                          break;
+                        }
+                        case 22: {
+                          xW(c[g >> 2] | 0);
+                          break;
+                        }
+                        case 23: {
+                          yW();
+                          break;
+                        }
+                        case 24: {
+                          xW(c[g >> 2] | 0);
+                          break;
+                        }
+                        case 25: {
+                          yW();
+                          break;
+                        }
+                        case 26: {
+                          xW(c[g >> 2] | 0);
+                          break;
+                        }
+                        case 27: {
+                          yW();
+                          break;
+                        }
+                        case 28: {
+                          xW(c[g >> 2] | 0);
+                          break;
+                        }
+                        case 29: {
+                          yW();
+                          break;
+                        }
+                        case 30: {
+                          xW(c[g >> 2] | 0);
+                          break;
+                        }
+                        case 31: {
+                          yW();
+                          break;
+                        }
+                        case 32: {
+                          xW(c[g >> 2] | 0);
+                          break;
+                        }
+                        case 33: {
+                          yW();
+                          break;
+                        }
+                        case 34: {
+                          e = c[(g + -4) >> 2] | 0;
+                          break;
+                        }
+                        case 35: {
+                          e = c[g >> 2] | 0;
+                          break;
+                        }
+                        case 38: {
+                          e = c[47401] | 0;
+                          i = c[(e + 4) >> 2] | 0;
+                          if (i >>> 0 >= (c[(e + 8) >> 2] | 0) >>> 0) {
+                            lA(e, 1) | 0;
+                            i = c[47401] | 0;
+                            e = i;
+                            i = c[(i + 4) >> 2] | 0;
+                          }
+                          a[i >> 0] = 0;
+                          p = c[e >> 2] | 0;
+                          c[(e + 4) >> 2] = p;
+                          if (zW(p) | 0) {
+                            s = 51;
+                            break a;
+                          }
+                          c[((c[g >> 2] | 0) + 80) >> 2] = c[47402];
+                          e = Vz(56032, c[4580] | 0) | 0;
+                          c[((c[g >> 2] | 0) + 84) >> 2] = e;
+                          c[47402] = c[g >> 2];
+                          c[((c[g >> 2] | 0) + 108) >> 2] = c[c[47403] >> 2];
+                          e = c[g >> 2] | 0;
+                          break;
+                        }
+                        case 39: {
+                          e = c[47401] | 0;
+                          i = c[(e + 4) >> 2] | 0;
+                          if (i >>> 0 >= (c[(e + 8) >> 2] | 0) >>> 0) {
+                            lA(e, 1) | 0;
+                            i = c[47401] | 0;
+                            e = i;
+                            i = c[(i + 4) >> 2] | 0;
+                          }
+                          a[i >> 0] = 0;
+                          p = c[e >> 2] | 0;
+                          c[(e + 4) >> 2] = p;
+                          if (zW(p) | 0) {
+                            s = 56;
+                            break a;
+                          }
+                          e = c[47402] | 0;
+                          c[47402] = c[(e + 80) >> 2];
+                          break;
+                        }
+                        case 40: {
+                          e = c[g >> 2] | 0;
+                          break;
+                        }
+                        case 41: {
+                          e = c[(g + -4) >> 2] | 0;
+                          break;
+                        }
+                        case 42: {
+                          e = c[(g + -4) >> 2] | 0;
+                          break;
+                        }
+                        case 43: {
+                          e = c[(g + -4) >> 2] | 0;
+                          break;
+                        }
+                        case 44: {
+                          e = c[(g + -4) >> 2] | 0;
+                          break;
+                        }
+                        case 45: {
+                          e = c[(g + -4) >> 2] | 0;
+                          break;
+                        }
+                        case 48: {
+                          e = c[g >> 2] | 0;
+                          break;
+                        }
+                        case 49: {
+                          e = c[g >> 2] | 0;
+                          break;
+                        }
+                        case 50: {
+                          a[((c[(g + -8) >> 2] | 0) + 12) >> 0] = 1;
+                          e = c[g >> 2] | 0;
+                          break;
+                        }
+                        case 51: {
+                          AW();
+                          break;
+                        }
+                        case 52: {
+                          e = BW() | 0;
+                          break;
+                        }
+                        case 53: {
+                          e = c[g >> 2] | 0;
+                          break;
+                        }
+                        case 54: {
+                          e = c[g >> 2] | 0;
+                          break;
+                        }
+                        case 55: {
+                          e = ((c[(g + -8) >> 2] | 0) + 100) | 0;
+                          a[e >> 0] = a[e >> 0] | 1;
+                          e = c[g >> 2] | 0;
+                          break;
+                        }
+                        case 56: {
+                          CW(c[(g + -4) >> 2] | 0, c[g >> 2] | 0, 1);
+                          break;
+                        }
+                        case 57: {
+                          e = c[(g + -12) >> 2] | 0;
+                          break;
+                        }
+                        case 58: {
+                          CW(c[(g + -4) >> 2] | 0, c[g >> 2] | 0, 2);
+                          break;
+                        }
+                        case 59: {
+                          e = c[(g + -12) >> 2] | 0;
+                          break;
+                        }
+                        case 60: {
+                          CW(c[(g + -4) >> 2] | 0, c[g >> 2] | 0, 3);
+                          break;
+                        }
+                        case 61: {
+                          e = c[(g + -12) >> 2] | 0;
+                          break;
+                        }
+                        case 62: {
+                          CW(c[g >> 2] | 0, uW() | 0, 2);
+                          break;
+                        }
+                        case 63: {
+                          e = c[(g + -8) >> 2] | 0;
+                          break;
+                        }
+                        case 64: {
+                          e = c[(g + -4) >> 2] | 0;
+                          break;
+                        }
+                        case 65: {
+                          e = c[g >> 2] | 0;
+                          break;
+                        }
+                        default: {
+                        }
+                      }
+                    while (0);
+                    i = (0 - j) | 0;
+                    p = (g + (i << 2)) | 0;
+                    i = (o + (i << 1)) | 0;
+                    g = (p + 4) | 0;
+                    c[(p + 4) >> 2] = e;
+                    e = ((d[(140449 + h) >> 0] | 0) + -41) | 0;
+                    p = b[i >> 1] | 0;
+                    h = (p + (b[(65766 + (e << 1)) >> 1] | 0)) | 0;
+                    if (h >>> 0 < 272 ? (a[(139617 + h) >> 0] | 0) == (p | 0) : 0) {
+                      e = a[(139889 + h) >> 0] | 0;
+                      j = q;
+                      h = i;
+                      break;
+                    }
+                    e = a[(140519 + e) >> 0] | 0;
+                    j = q;
+                    h = i;
+                  }
+                while (0);
+                i = k;
+                p = e;
+                q = j;
+                o = (h + 2) | 0;
+              }
+              if ((s | 0) == 26) {
+                tW();
+                e = 1;
+                s = 96;
+              } else if ((s | 0) == 51) {
+                MW(140347);
+                tW();
+                e = 1;
+                s = 96;
+              } else if ((s | 0) == 56) {
+                MW(140398);
+                tW();
+                e = 1;
+                s = 96;
+              } else if ((s | 0) == 95) {
+                MW(140558);
+                e = 2;
+                s = 96;
+              }
+              if ((s | 0) == 96) if ((f | 0) != (r | 0)) U1(f);
+              l = t;
+              return e | 0;
+            }
+            function sW(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              e = JK(8) | 0;
+              a[(e + 4) >> 0] = d;
+              c[e >> 2] = b;
+              return e | 0;
+            }
+            function tW() {
+              var a = 0,
+                b = 0;
+              a = c[47402] | 0;
+              b = c[47400] | 0;
+              if (b | 0) {
+                mU(b, 1);
+                c[47400] = 0;
+              }
+              c[14021] = 67;
+              while (1) {
+                if (!a) break;
+                b = c[(a + 80) >> 2] | 0;
+                GW(a);
+                a = b;
+              }
+              c[14021] = 56;
+              c[14030] = 68;
+              b = c[47405] | 0;
+              nb[c[b >> 2] & 63](b, 0, 64) | 0;
+              c[14030] = 56;
+              c[14039] = 69;
+              b = c[47406] | 0;
+              nb[c[b >> 2] & 63](b, 0, 64) | 0;
+              c[14039] = 56;
+              JW();
+              return;
+            }
+            function uW() {
+              var a = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              e = c[47406] | 0;
+              f = JK(40) | 0;
+              if (Xz(c[47405] | 0) | 0) wW(0);
+              a = Xz(e) | 0;
+              b[(f + 4) >> 1] = a;
+              a: do
+                if (!a) a = e;
+                else {
+                  c[f >> 2] = JK((a * 24) | 0) | 0;
+                  a = 0;
+                  d = nb[c[e >> 2] & 63](e, 0, 128) | 0;
+                  while (1) {
+                    if (!d) {
+                      a = e;
+                      break a;
+                    }
+                    g = ((c[f >> 2] | 0) + ((a * 24) | 0)) | 0;
+                    h = (d + 8) | 0;
+                    c[g >> 2] = c[h >> 2];
+                    c[(g + 4) >> 2] = c[(h + 4) >> 2];
+                    c[(g + 8) >> 2] = c[(h + 8) >> 2];
+                    c[(g + 12) >> 2] = c[(h + 12) >> 2];
+                    c[(g + 16) >> 2] = c[(h + 16) >> 2];
+                    c[(g + 20) >> 2] = c[(h + 20) >> 2];
+                    a = (a + 1) | 0;
+                    d = nb[c[e >> 2] & 63](e, d, 8) | 0;
+                  }
+                }
+              while (0);
+              nb[c[a >> 2] & 63](e, 0, 64) | 0;
+              return f | 0;
+            }
+            function vW(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              e = JK(64) | 0;
+              f = (b + 4) | 0;
+              d = c[f >> 2] | 0;
+              if (d >>> 0 >= (c[(b + 8) >> 2] | 0) >>> 0) {
+                lA(b, 1) | 0;
+                d = c[f >> 2] | 0;
+              }
+              a[d >> 0] = 0;
+              b = c[b >> 2] | 0;
+              c[f >> 2] = b;
+              c[(e + 8) >> 2] = D4(b) | 0;
+              c[(e + 12) >> 2] = c[c[47403] >> 2];
+              f = c[47405] | 0;
+              nb[c[f >> 2] & 63](f, e, 1) | 0;
+              return;
+            }
+            function wW(d) {
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              i = JK(32) | 0;
+              j = c[47405] | 0;
+              e = Xz(j) | 0;
+              k = (i + 8) | 0;
+              a[(i + 14) >> 0] = d;
+              a: do
+                if (!e) {
+                  c[k >> 2] = JK(56) | 0;
+                  b[(i + 12) >> 1] = 1;
+                  h = D4(195059) | 0;
+                  k = c[k >> 2] | 0;
+                  c[k >> 2] = h;
+                  c[(k + 4) >> 2] = c[c[47403] >> 2];
+                } else {
+                  b[(i + 12) >> 1] = e;
+                  c[k >> 2] = JK((e * 56) | 0) | 0;
+                  d = 0;
+                  e = Tz(j) | 0;
+                  while (1) {
+                    if (!e) break a;
+                    f = ((c[k >> 2] | 0) + ((d * 56) | 0)) | 0;
+                    g = (e + 8) | 0;
+                    h = (f + 56) | 0;
+                    do {
+                      c[f >> 2] = c[g >> 2];
+                      f = (f + 4) | 0;
+                      g = (g + 4) | 0;
+                    } while ((f | 0) < (h | 0));
+                    d = (d + 1) | 0;
+                    e = c[e >> 2] | 0;
+                  }
+                }
+              while (0);
+              nb[c[j >> 2] & 63](j, 0, 64) | 0;
+              k = c[47406] | 0;
+              nb[c[k >> 2] & 63](k, i, 1) | 0;
+              return;
+            }
+            function xW(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0.0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 32) | 0;
+              g = j;
+              i = JK(8) | 0;
+              f = c[c[47403] >> 2] | 0;
+              c[g >> 2] = c[a >> 2];
+              c[(g + 4) >> 2] = c[(a + 4) >> 2];
+              c[(g + 8) >> 2] = c[(a + 8) >> 2];
+              c[(g + 12) >> 2] = c[(a + 12) >> 2];
+              c[(g + 16) >> 2] = c[(a + 16) >> 2];
+              c[(g + 20) >> 2] = c[(a + 20) >> 2];
+              c[(g + 24) >> 2] = c[(a + 24) >> 2];
+              c[(g + 28) >> 2] = c[(a + 28) >> 2];
+              if (f | 0) {
+                a = (g + 4) | 0;
+                if ((c[a >> 2] | 0) == 0 ? ((b = c[(f + 4) >> 2] | 0), b | 0) : 0) c[a >> 2] = b;
+                a = (g + 16) | 0;
+                if (+h[a >> 3] < 0.0 ? ((d = +h[(f + 16) >> 3]), d >= 0.0) : 0) h[a >> 3] = d;
+                if ((c[g >> 2] | 0) == 0 ? ((e = c[f >> 2] | 0), e | 0) : 0) c[g >> 2] = e;
+                a = c[(f + 24) >> 2] & 127;
+                if (a | 0) {
+                  f = (g + 24) | 0;
+                  e = c[f >> 2] | 0;
+                  c[f >> 2] = (e & 127) | a | (e & -128);
+                }
+              }
+              f = c[((c[47404] | 0) + 144) >> 2] | 0;
+              c[i >> 2] = nb[c[f >> 2] & 63](f, g, 1) | 0;
+              c[(i + 4) >> 2] = c[47403];
+              c[47403] = i;
+              l = j;
+              return;
+            }
+            function yW() {
+              var a = 0,
+                b = 0;
+              b = c[47403] | 0;
+              a = c[(b + 4) >> 2] | 0;
+              U1(b);
+              c[47403] = a;
+              return;
+            }
+            function zW(b) {
+              b = b | 0;
+              var c = 0;
+              while (1) {
+                c = a[b >> 0] | 0;
+                if (!((c << 24) >> 24)) {
+                  b = 0;
+                  break;
+                }
+                if ((c << 24) >> 24 == 32) b = (b + 1) | 0;
+                else {
+                  b = 1;
+                  break;
+                }
+              }
+              return b | 0;
+            }
+            function AW() {
+              var b = 0,
+                d = 0,
+                e = 0;
+              e = Vz(56068, c[4580] | 0) | 0;
+              b = c[47402] | 0;
+              d = JK(16) | 0;
+              c[(d + 8) >> 2] = e;
+              if (a[(b + 112) >> 0] & 2) a[(d + 12) >> 0] = 1;
+              e = c[(b + 84) >> 2] | 0;
+              nb[c[e >> 2] & 63](e, d, 1) | 0;
+              return;
+            }
+            function BW() {
+              var a = 0;
+              a = c[((c[47402] | 0) + 84) >> 2] | 0;
+              return nb[c[a >> 2] & 63](a, 0, 256) | 0;
+            }
+            function CW(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              g = JK(16) | 0;
+              f = c[47402] | 0;
+              h = c[(f + 84) >> 2] | 0;
+              h = c[((nb[c[h >> 2] & 63](h, 0, 256) | 0) + 8) >> 2] | 0;
+              c[(g + 8) >> 2] = b;
+              nb[c[h >> 2] & 63](h, g, 1) | 0;
+              a[(b + 92) >> 0] = e;
+              if (a[(f + 112) >> 0] & 1) a[(b + 100) >> 0] = 1;
+              c[(b + 88) >> 2] = d;
+              return;
+            }
+            function DW(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              U1(b);
+              return;
+            }
+            function EW(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              Rz(c[(b + 8) >> 2] | 0) | 0;
+              U1(b);
+              return;
+            }
+            function FW(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              KW(c[(b + 8) >> 2] | 0);
+              U1(b);
+              return;
+            }
+            function GW(a) {
+              a = a | 0;
+              Rz(c[(a + 84) >> 2] | 0) | 0;
+              jU(a);
+              U1(a);
+              return;
+            }
+            function HW(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              U1(c[(b + 8) >> 2] | 0);
+              U1(b);
+              return;
+            }
+            function IW(a, d, e) {
+              a = a | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              g = (d + 12) | 0;
+              a = b[g >> 1] | 0;
+              if ((a << 16) >> 16) {
+                h = (d + 8) | 0;
+                e = 0;
+                f = c[h >> 2] | 0;
+                while (1) {
+                  if ((e | 0) >= (((a << 16) >> 16) | 0)) break;
+                  U1(c[f >> 2] | 0);
+                  e = (e + 1) | 0;
+                  f = (f + 56) | 0;
+                  a = b[g >> 1] | 0;
+                }
+                U1(c[h >> 2] | 0);
+              }
+              U1(d);
+              return;
+            }
+            function JW() {
+              var a = 0,
+                b = 0;
+              a = c[47403] | 0;
+              while (1) {
+                b = c[(a + 4) >> 2] | 0;
+                if (!b) break;
+                U1(a);
+                a = b;
+              }
+              return;
+            }
+            function KW(b) {
+              b = b | 0;
+              var d = 0;
+              d = (b + 88) | 0;
+              switch (a[(b + 92) >> 0] | 0) {
+                case 1: {
+                  GW(c[d >> 2] | 0);
+                  break;
+                }
+                case 2: {
+                  kU(c[d >> 2] | 0);
+                  break;
+                }
+                default: {
+                }
+              }
+              jU(b);
+              U1(b);
+              return;
+            }
+            function LW(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              f = l;
+              l = (l + 160) | 0;
+              e = (f + 8) | 0;
+              g = f;
+              c[g >> 2] = 0;
+              c[(g + 4) >> 2] = 0;
+              c[47403] = g;
+              c[47402] = 0;
+              c[47400] = 0;
+              c[47404] = c[((c[((c[(d + 52) >> 2] | 0) + 16) >> 2] | 0) + 144) >> 2];
+              c[47405] = Vz(56104, c[4580] | 0) | 0;
+              c[47406] = Vz(56140, c[4580] | 0) | 0;
+              kA(e, 128, (f + 24) | 0);
+              c[47401] = e;
+              if (!(PW(a, e, d) | 0)) {
+                rW() | 0;
+                c[b >> 2] = FX() | 0;
+                a = c[47400] | 0;
+              } else {
+                c[b >> 2] = 2;
+                a = 0;
+              }
+              Rz(c[47405] | 0) | 0;
+              Rz(c[47406] | 0) | 0;
+              c[47405] = 0;
+              c[47406] = 0;
+              c[47403] = 0;
+              oA(e);
+              l = f;
+              return a | 0;
+            }
+            function MW(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              e = l;
+              l = (l + 16) | 0;
+              d = e;
+              if (!(a[189661] | 0)) {
+                a[189661] = 1;
+                f = NW() | 0;
+                c[d >> 2] = b;
+                c[(d + 4) >> 2] = f;
+                gA(1, 140575, d) | 0;
+                OW();
+              }
+              l = e;
+              return;
+            }
+            function NW() {
+              return u_(c[47407] | 0) | 0;
+            }
+            function OW() {
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              f = l;
+              l = (l + 16) | 0;
+              e = f;
+              b = c[47410] | 0;
+              c[(b + 4) >> 2] = c[b >> 2];
+              d = c[47419] | 0;
+              if ((d | 0) > 0) {
+                mA(b, c[47417] | 0, d) | 0;
+                b = c[47410] | 0;
+              }
+              mA(b, c[47416] | 0, c[47418] | 0) | 0;
+              d = c[47410] | 0;
+              b = c[(d + 4) >> 2] | 0;
+              if (b >>> 0 >= (c[(d + 8) >> 2] | 0) >>> 0) {
+                lA(d, 1) | 0;
+                b = c[47410] | 0;
+                d = b;
+                b = c[(b + 4) >> 2] | 0;
+              }
+              c[(d + 4) >> 2] = b + 1;
+              a[b >> 0] = 0;
+              b = c[47410] | 0;
+              d = c[b >> 2] | 0;
+              c[(b + 4) >> 2] = d;
+              c[e >> 2] = d;
+              gA(3, 140591, e) | 0;
+              l = f;
+              return;
+            }
+            function PW(b, e, f) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              c[47410] = e;
+              kA(189644, 128, 0);
+              c[47408] = b;
+              a[189663] = 0;
+              a[189660] = 0;
+              a[189661] = 0;
+              c[47418] = 0;
+              c[47419] = 0;
+              a[189662] = 1;
+              f = (f + 52) | 0;
+              e = UY(wK(d[((c[((c[f >> 2] | 0) + 16) >> 2] | 0) + 115) >> 0] | 0) | 0) | 0;
+              c[47407] = e;
+              h_(e, c[((c[((c[f >> 2] | 0) + 16) >> 2] | 0) + 144) >> 2] | 0);
+              i_(c[47407] | 0, 70, 27);
+              j_(c[47407] | 0, 71);
+              return 0;
+            }
+            function QW(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              do
+                if (!(c3(d, 140603) | 0)) {
+                  c[47399] = UW(e) | 0;
+                  a[189662] = 0;
+                  c[47409] = 286;
+                } else {
+                  if (c3(d, 140609) | 0 ? c3(d, 140612) | 0 : 0) {
+                    if (!(c3(d, 140615) | 0)) {
+                      a[189662] = 1;
+                      c[47399] = VW(e) | 0;
+                      c[47409] = 287;
+                      break;
+                    }
+                    if (!(c3(d, 140623) | 0)) {
+                      c[47399] = WW(b, e, 0) | 0;
+                      c[47409] = 288;
+                      break;
+                    }
+                    if (!(c3(d, 140628) | 0)) {
+                      c[47399] = WW(b, 0, 1) | 0;
+                      c[47409] = 290;
+                      break;
+                    }
+                    if (!(c3(d, 140644) | 0)) {
+                      c[47399] = WW(b, 0, 32) | 0;
+                      c[47409] = 295;
+                      break;
+                    }
+                    if (!(c3(d, 140630) | 0)) {
+                      c[47399] = WW(b, 0, 4) | 0;
+                      c[47409] = 291;
+                      break;
+                    }
+                    if (!(c3(d, 140632) | 0)) {
+                      c[47399] = WW(b, 0, 64) | 0;
+                      c[47409] = 292;
+                      break;
+                    }
+                    if (!(c3(d, 140634) | 0)) {
+                      c[47399] = WW(b, 0, 2) | 0;
+                      c[47409] = 289;
+                      break;
+                    }
+                    if (!(c3(d, 140636) | 0)) {
+                      c[47399] = WW(b, 0, 8) | 0;
+                      c[47409] = 293;
+                      break;
+                    }
+                    if (!(c3(d, 140640) | 0)) {
+                      c[47399] = WW(b, 0, 16) | 0;
+                      c[47409] = 294;
+                      break;
+                    }
+                    if (!(c3(d, 140646) | 0)) {
+                      XW(e);
+                      c[47409] = 283;
+                      break;
+                    }
+                    if (!(c3(d, 140649) | 0)) {
+                      c[47409] = 277;
+                      break;
+                    }
+                    if (!(c3(d, 140652) | 0)) {
+                      c[47409] = 280;
+                      break;
+                    }
+                    if (!(c3(d, 140655) | 0)) {
+                      c[47399] = YW(e) | 0;
+                      c[47409] = 285;
+                      break;
+                    }
+                    if (!(c3(d, 140618) | 0)) {
+                      c[47409] = 262;
+                      break;
+                    } else {
+                      TW(d);
+                      break;
+                    }
+                  }
+                  a[189662] = 0;
+                  c[47409] = 260;
+                }
+              while (0);
+              return;
+            }
+            function RW(b, d) {
+              b = b | 0;
+              d = d | 0;
+              do
+                if (!(c3(d, 140603) | 0)) {
+                  c[47409] = 264;
+                  a[189662] = 1;
+                } else {
+                  if (c3(d, 140609) | 0 ? c3(d, 140612) | 0 : 0) {
+                    if (!(c3(d, 140615) | 0)) {
+                      c[47409] = 265;
+                      a[189662] = 0;
+                      break;
+                    }
+                    if (!(c3(d, 140618) | 0)) {
+                      c[47409] = 263;
+                      break;
+                    }
+                    if (!(c3(d, 140623) | 0)) {
+                      c[47409] = 266;
+                      break;
+                    }
+                    if (!(c3(d, 140628) | 0)) {
+                      c[47409] = 270;
+                      break;
+                    }
+                    if (!(c3(d, 140630) | 0)) {
+                      c[47409] = 271;
+                      break;
+                    }
+                    if (!(c3(d, 140632) | 0)) {
+                      c[47409] = 272;
+                      break;
+                    }
+                    if (!(c3(d, 140634) | 0)) {
+                      c[47409] = 269;
+                      break;
+                    }
+                    if (!(c3(d, 140636) | 0)) {
+                      c[47409] = 273;
+                      break;
+                    }
+                    if (!(c3(d, 140640) | 0)) {
+                      c[47409] = 274;
+                      break;
+                    }
+                    if (!(c3(d, 140644) | 0)) {
+                      c[47409] = 275;
+                      break;
+                    }
+                    if (!(c3(d, 140646) | 0)) {
+                      c[47409] = (c[47409] | 0) == 283 ? 282 : 258;
+                      break;
+                    }
+                    if (!(c3(d, 140649) | 0)) {
+                      c[47409] = (c[47409] | 0) == 277 ? 276 : 278;
+                      break;
+                    }
+                    if (!(c3(d, 140652) | 0)) {
+                      c[47409] = (c[47409] | 0) == 280 ? 279 : 281;
+                      break;
+                    }
+                    if (!(c3(d, 140655) | 0)) {
+                      c[47409] = (c[47409] | 0) == 285 ? 284 : 259;
+                      break;
+                    } else {
+                      TW(d);
+                      break;
+                    }
+                  }
+                  c[47409] = 261;
+                }
+              while (0);
+              return;
+            }
+            function SW(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              if (a[189662] | 0) {
+                b = 0;
+                while (1) {
+                  if (!e) break;
+                  h = (d + 1) | 0;
+                  g = a[d >> 0] | 0;
+                  if ((g & 255) > 31) {
+                    d = c[47410] | 0;
+                    f = c[(d + 4) >> 2] | 0;
+                    if (f >>> 0 >= (c[(d + 8) >> 2] | 0) >>> 0) {
+                      lA(d, 1) | 0;
+                      f = c[47410] | 0;
+                      d = f;
+                      f = c[(f + 4) >> 2] | 0;
+                    }
+                    c[(d + 4) >> 2] = f + 1;
+                    a[f >> 0] = g;
+                    b = (b + 1) | 0;
+                  }
+                  d = h;
+                  e = (e + -1) | 0;
+                }
+                if (b | 0) c[47409] = 267;
+              }
+              return;
+            }
+            function TW(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              d = l;
+              l = (l + 16) | 0;
+              e = d;
+              c[47409] = 268;
+              a[189661] = 1;
+              f = NW() | 0;
+              c[e >> 2] = b;
+              c[(e + 4) >> 2] = f;
+              gA(1, 140659, e) | 0;
+              l = d;
+              return;
+            }
+            function UW(b) {
+              b = b | 0;
+              var d = 0;
+              d = JK(120) | 0;
+              c[(d + 100) >> 2] = -1;
+              a[(d + 88) >> 0] = -1;
+              ZW(d, 56400, 22, b, 141611);
+              return d | 0;
+            }
+            function VW(a) {
+              a = a | 0;
+              var c = 0;
+              c = JK(104) | 0;
+              b[(c + 80) >> 1] = 1;
+              b[(c + 82) >> 1] = 1;
+              ZW(c, 56224, 22, a, 140965);
+              return c | 0;
+            }
+            function WW(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              f = l;
+              l = (l + 32) | 0;
+              e = f;
+              c[e >> 2] = 0;
+              c[(e + 4) >> 2] = 0;
+              c[(e + 8) >> 2] = 0;
+              c[(e + 12) >> 2] = 0;
+              c[(e + 16) >> 2] = 0;
+              c[(e + 20) >> 2] = 0;
+              c[(e + 24) >> 2] = 0;
+              c[(e + 28) >> 2] = 0;
+              h[(e + 16) >> 3] = -1.0;
+              c[(e + 24) >> 2] = d & 127;
+              if (b | 0) ZW(e, 56200, 3, b, 140816);
+              d = c[(a + 144) >> 2] | 0;
+              e = nb[c[d >> 2] & 63](d, e, 1) | 0;
+              l = f;
+              return e | 0;
+            }
+            function XW(a) {
+              a = a | 0;
+              c[47399] = 0;
+              ZW(189596, 56192, 1, a, 140752);
+              return;
+            }
+            function YW(a) {
+              a = a | 0;
+              var b = 0;
+              b = JK(40) | 0;
+              ZW(b, 56176, 2, a, 140698);
+              return b | 0;
+            }
+            function ZW(b, e, f, g, h) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              o = l;
+              l = (l + 16) | 0;
+              n = o;
+              m = (o + 8) | 0;
+              while (1) {
+                k = c[g >> 2] | 0;
+                if (!k) break;
+                i = c[(g + 4) >> 2] | 0;
+                c[m >> 2] = k;
+                j = u5(m, e, f, 8, 104) | 0;
+                if (!j) {
+                  c[n >> 2] = k;
+                  c[(n + 4) >> 2] = h;
+                  gA(0, 140704, n) | 0;
+                  i = 1;
+                } else {
+                  i = lb[c[(j + 4) >> 2] & 127](b, i) | 0;
+                  i = (i | (d[189660] | 0)) & 255;
+                }
+                a[189660] = i;
+                g = (g + 8) | 0;
+              }
+              l = o;
+              return;
+            }
+            function _W(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return c3(c[a >> 2] | 0, c[b >> 2] | 0) | 0;
+            }
+            function $W(a, b) {
+              a = a | 0;
+              b = b | 0;
+              c[(a + 36) >> 2] = D4(b) | 0;
+              return 0;
+            }
+            function aX(a, b) {
+              a = a | 0;
+              b = b | 0;
+              c[(a + 32) >> 2] = D4(b) | 0;
+              return 0;
+            }
+            function bX(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 16) | 0;
+              g = i;
+              f = ((Y3(a[d >> 0] | 0) | 0) << 24) >> 24;
+              switch (f | 0) {
+                case 82: {
+                  e = (d + 1) | 0;
+                  if (!(c3(e, 140763) | 0)) {
+                    c[b >> 2] = 114;
+                    e = 0;
+                  } else h = 5;
+                  break;
+                }
+                case 76: {
+                  h = 6;
+                  break;
+                }
+                default: {
+                  e = (d + 1) | 0;
+                  h = 5;
+                }
+              }
+              do
+                if ((h | 0) == 5)
+                  if (!(c3(e, 140768) | 0)) h = 6;
+                  else {
+                    if ((f | 0) != 67 ? (c3(e, 140772) | 0) == 0 : 0) {
+                      c[g >> 2] = d;
+                      gA(0, 140778, g) | 0;
+                      e = 1;
+                      break;
+                    }
+                    c[b >> 2] = 110;
+                    e = 0;
+                  }
+              while (0);
+              if ((h | 0) == 6) {
+                c[b >> 2] = 108;
+                e = 0;
+              }
+              l = i;
+              return e | 0;
+            }
+            function cX(a, b) {
+              a = a | 0;
+              b = b | 0;
+              c[(a + 4) >> 2] = b;
+              return 0;
+            }
+            function dX(a, b) {
+              a = a | 0;
+              b = b | 0;
+              c[a >> 2] = b;
+              return 0;
+            }
+            function eX(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              e = l;
+              l = (l + 16) | 0;
+              d = e;
+              if (!(fX(b, 140845, 0, 255, d) | 0)) {
+                h[(a + 16) >> 3] = +(c[d >> 2] | 0);
+                a = 0;
+              } else a = 1;
+              l = e;
+              return a | 0;
+            }
+            function fX(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              k = l;
+              l = (l + 48) | 0;
+              j = (k + 24) | 0;
+              i = (k + 8) | 0;
+              h = k;
+              m = (k + 36) | 0;
+              g = y4(a, m, 10) | 0;
+              do
+                if ((c[m >> 2] | 0) != (a | 0)) {
+                  if ((g | 0) > (e | 0)) {
+                    c[i >> 2] = b;
+                    c[(i + 4) >> 2] = a;
+                    c[(i + 8) >> 2] = e;
+                    gA(0, 140887, i) | 0;
+                    a = 1;
+                    break;
+                  }
+                  if ((g | 0) < (d | 0)) {
+                    c[j >> 2] = b;
+                    c[(j + 4) >> 2] = a;
+                    c[(j + 8) >> 2] = d;
+                    gA(0, 140926, j) | 0;
+                    a = 1;
+                    break;
+                  } else {
+                    c[f >> 2] = g;
+                    a = 0;
+                    break;
+                  }
+                } else {
+                  c[h >> 2] = b;
+                  c[(h + 4) >> 2] = a;
+                  gA(0, 140856, h) | 0;
+                  a = 1;
+                }
+              while (0);
+              l = k;
+              return a | 0;
+            }
+            function gX(d, e) {
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 16) | 0;
+              f = h;
+              switch ((((Y3(a[e >> 0] | 0) | 0) << 24) >> 24) | 0) {
+                case 76: {
+                  if (!(c3((e + 1) | 0, 140768) | 0)) {
+                    d = (d + 36) | 0;
+                    b[d >> 1] = b[d >> 1] | 4;
+                    d = 0;
+                  } else g = 9;
+                  break;
+                }
+                case 82: {
+                  if (!(c3((e + 1) | 0, 140763) | 0)) {
+                    d = (d + 36) | 0;
+                    b[d >> 1] = b[d >> 1] | 2;
+                    d = 0;
+                  } else g = 9;
+                  break;
+                }
+                case 84: {
+                  if (!(c3((e + 1) | 0, 141563) | 0)) {
+                    d = (d + 36) | 0;
+                    b[d >> 1] = b[d >> 1] | 6;
+                    d = 0;
+                  } else g = 9;
+                  break;
+                }
+                case 67: {
+                  if (!(c3((e + 1) | 0, 140772) | 0)) d = 0;
+                  else g = 9;
+                  break;
+                }
+                default:
+                  g = 9;
+              }
+              if ((g | 0) == 9) {
+                c[f >> 2] = e;
+                gA(0, 141567, f) | 0;
+                d = 1;
+              }
+              l = h;
+              return d | 0;
+            }
+            function hX(d, e) {
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 16) | 0;
+              f = h;
+              switch ((((Y3(a[e >> 0] | 0) | 0) << 24) >> 24) | 0) {
+                case 76: {
+                  if (!(c3((e + 1) | 0, 140768) | 0)) {
+                    d = (d + 36) | 0;
+                    b[d >> 1] = b[d >> 1] | 512;
+                    d = 0;
+                  } else g = 7;
+                  break;
+                }
+                case 82: {
+                  if (!(c3((e + 1) | 0, 140763) | 0)) {
+                    d = (d + 36) | 0;
+                    b[d >> 1] = b[d >> 1] | 256;
+                    d = 0;
+                  } else g = 7;
+                  break;
+                }
+                case 67: {
+                  if (!(c3((e + 1) | 0, 140772) | 0)) d = 0;
+                  else g = 7;
+                  break;
+                }
+                default:
+                  g = 7;
+              }
+              if ((g | 0) == 7) {
+                c[f >> 2] = e;
+                gA(0, 141518, f) | 0;
+                d = 1;
+              }
+              l = h;
+              return d | 0;
+            }
+            function iX(a, b) {
+              a = a | 0;
+              b = b | 0;
+              c[(a + 20) >> 2] = D4(b) | 0;
+              return 0;
+            }
+            function jX(d, e) {
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              g = l;
+              l = (l + 16) | 0;
+              f = g;
+              if (!(fX(e, 141511, 0, 255, f) | 0)) {
+                a[(d + 33) >> 0] = c[f >> 2];
+                d = (d + 36) | 0;
+                b[d >> 1] = b[d >> 1] | 32;
+                d = 0;
+              } else d = 1;
+              l = g;
+              return d | 0;
+            }
+            function kX(d, e) {
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              g = l;
+              l = (l + 16) | 0;
+              f = g;
+              if (!(fX(e, 141499, 0, 255, f) | 0)) {
+                a[(d + 34) >> 0] = c[f >> 2];
+                d = (d + 36) | 0;
+                b[d >> 1] = b[d >> 1] | 64;
+                d = 0;
+              } else d = 1;
+              l = g;
+              return d | 0;
+            }
+            function lX(d, e) {
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              g = l;
+              l = (l + 16) | 0;
+              f = g;
+              if (!(fX(e, 141487, -128, 127, f) | 0)) {
+                a[(d + 32) >> 0] = c[f >> 2];
+                d = (d + 36) | 0;
+                b[d >> 1] = b[d >> 1] | 128;
+                d = 0;
+              } else d = 1;
+              l = g;
+              return d | 0;
+            }
+            function mX(a, b) {
+              a = a | 0;
+              b = b | 0;
+              c[(a + 24) >> 2] = D4(b) | 0;
+              return 0;
+            }
+            function nX(a, d) {
+              a = a | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              g = l;
+              l = (l + 16) | 0;
+              f = g;
+              e = (g + 4) | 0;
+              do
+                if (!(fX(d, 141442, 0, 65535, e) | 0)) {
+                  d = c[e >> 2] | 0;
+                  if (!d) {
+                    gA(0, 141450, f) | 0;
+                    d = 1;
+                    break;
+                  } else {
+                    b[(a + 80) >> 1] = d;
+                    d = 0;
+                    break;
+                  }
+                } else d = 1;
+              while (0);
+              l = g;
+              return d | 0;
+            }
+            function oX(a, e) {
+              a = a | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 16) | 0;
+              f = h;
+              switch ((((Y3(d[e >> 0] | 0) | 0) << 24) >> 24) | 0) {
+                case 84: {
+                  if (!(c3((e + 1) | 0, 141391) | 0)) {
+                    a = (a + 36) | 0;
+                    b[a >> 1] = b[a >> 1] | 1;
+                    a = 0;
+                  } else g = 5;
+                  break;
+                }
+                case 70: {
+                  if (!(c3((e + 1) | 0, 141395) | 0)) a = 0;
+                  else g = 5;
+                  break;
+                }
+                default:
+                  g = 5;
+              }
+              if ((g | 0) == 5) {
+                c[f >> 2] = e;
+                gA(0, 141400, f) | 0;
+                a = 1;
+              }
+              l = h;
+              return a | 0;
+            }
+            function pX(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              e = l;
+              l = (l + 16) | 0;
+              d = e;
+              if (!(fX(b, 141377, 0, 360, d) | 0)) {
+                c[(a + 28) >> 2] = c[d >> 2] & 65535;
+                a = 0;
+              } else a = 1;
+              l = e;
+              return a | 0;
+            }
+            function qX(a, d) {
+              a = a | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              f = l;
+              l = (l + 16) | 0;
+              e = f;
+              if (!(fX(d, 141370, 0, 65535, e) | 0)) {
+                b[(a + 40) >> 1] = c[e >> 2];
+                a = 0;
+              } else a = 1;
+              l = f;
+              return a | 0;
+            }
+            function rX(a, b) {
+              a = a | 0;
+              b = b | 0;
+              c[a >> 2] = D4(b) | 0;
+              return 0;
+            }
+            function sX(a, b) {
+              a = a | 0;
+              b = b | 0;
+              c[(a + 16) >> 2] = D4(b) | 0;
+              return 0;
+            }
+            function tX(a, b) {
+              a = a | 0;
+              b = b | 0;
+              c[(a + 4) >> 2] = D4(b) | 0;
+              return 0;
+            }
+            function uX(a, d) {
+              a = a | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              g = l;
+              l = (l + 16) | 0;
+              f = g;
+              e = (g + 4) | 0;
+              do
+                if (!(fX(d, 141325, 0, 65535, e) | 0)) {
+                  d = c[e >> 2] | 0;
+                  if (!d) {
+                    gA(0, 141333, f) | 0;
+                    d = 1;
+                    break;
+                  } else {
+                    b[(a + 82) >> 1] = d;
+                    d = 0;
+                    break;
+                  }
+                } else d = 1;
+              while (0);
+              l = g;
+              return d | 0;
+            }
+            function vX(d, e) {
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 16) | 0;
+              i = k;
+              h = 0;
+              a: while (1) {
+                b: while (1) {
+                  g = (e + 1) | 0;
+                  e = a[e >> 0] | 0;
+                  if (!((e << 24) >> 24)) break a;
+                  e = (e << 24) >> 24;
+                  f = ((d3(e) | 0) + -98) | 0;
+                  switch ((f >>> 1) | (f << 31) | 0) {
+                    case 5: {
+                      j = 5;
+                      break b;
+                    }
+                    case 9: {
+                      f = 2048;
+                      break b;
+                    }
+                    case 8: {
+                      j = 6;
+                      break b;
+                    }
+                    case 0: {
+                      j = 7;
+                      break b;
+                    }
+                    default: {
+                    }
+                  }
+                  c[i >> 2] = e;
+                  c[(i + 4) >> 2] = e;
+                  gA(0, 141272, i) | 0;
+                  e = g;
+                }
+                if ((j | 0) == 5) {
+                  j = 0;
+                  f = 1024;
+                } else if ((j | 0) == 6) {
+                  j = 0;
+                  f = 4096;
+                } else if ((j | 0) == 7) {
+                  j = 0;
+                  f = 8192;
+                }
+                e = g;
+                h = h | f;
+              }
+              if ((h << 16) >> 16 != 15360) {
+                j = (d + 36) | 0;
+                b[j >> 1] = b[j >> 1] | h;
+              }
+              l = k;
+              return 0;
+            }
+            function wX(d, e) {
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 16) | 0;
+              j = (k + 8) | 0;
+              i = k;
+              h = D4(e) | 0;
+              g = (d + 42) | 0;
+              f = 0;
+              e = h;
+              while (1) {
+                d = A4(e, 141182) | 0;
+                if (!d) break;
+                if ((((Y3(a[d >> 0] | 0) | 0) & 255) | 0) == 82) {
+                  e = (d + 1) | 0;
+                  if (!(c3(e, 141185) | 0)) {
+                    b[g >> 1] = b[g >> 1] | 4;
+                    d = f;
+                    e = 0;
+                    f = d;
+                    continue;
+                  }
+                  if (!(c3(e, 141192) | 0)) {
+                    b[g >> 1] = b[g >> 1] | 2;
+                    d = f;
+                    e = 0;
+                    f = d;
+                    continue;
+                  } else {
+                    c[i >> 2] = d;
+                    gA(0, 141198, i) | 0;
+                    f = 1;
+                    e = 0;
+                    continue;
+                  }
+                }
+                if (!(c3(d, 141236) | 0)) {
+                  b[g >> 1] = b[g >> 1] & -385;
+                  d = f;
+                  e = 0;
+                  f = d;
+                  continue;
+                }
+                if (c3(d, 141242) | 0 ? c3(d, 141252) | 0 : 0) {
+                  if (!(c3(d, 141258) | 0)) {
+                    b[g >> 1] = b[g >> 1] | 128;
+                    d = f;
+                    e = 0;
+                    f = d;
+                    continue;
+                  }
+                  if (!(c3(d, 141265) | 0)) {
+                    b[g >> 1] = b[g >> 1] | 256;
+                    d = f;
+                    e = 0;
+                    f = d;
+                    continue;
+                  } else {
+                    c[j >> 2] = d;
+                    gA(0, 141198, j) | 0;
+                    f = 1;
+                    e = 0;
+                    continue;
+                  }
+                }
+                b[g >> 1] = b[g >> 1] | 32;
+                d = f;
+                e = 0;
+                f = d;
+              }
+              U1(h);
+              l = k;
+              return f | 0;
+            }
+            function xX(a, b) {
+              a = a | 0;
+              b = b | 0;
+              c[(a + 8) >> 2] = D4(b) | 0;
+              return 0;
+            }
+            function yX(a, b) {
+              a = a | 0;
+              b = b | 0;
+              c[(a + 12) >> 2] = D4(b) | 0;
+              return 0;
+            }
+            function zX(d, e) {
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 16) | 0;
+              f = h;
+              switch ((((Y3(a[e >> 0] | 0) | 0) << 24) >> 24) | 0) {
+                case 66: {
+                  if (!(c3((e + 1) | 0, 141128) | 0)) {
+                    d = (d + 36) | 0;
+                    b[d >> 1] = b[d >> 1] | 16;
+                    d = 0;
+                  } else g = 7;
+                  break;
+                }
+                case 84: {
+                  if (!(c3((e + 1) | 0, 141134) | 0)) {
+                    d = (d + 36) | 0;
+                    b[d >> 1] = b[d >> 1] | 8;
+                    d = 0;
+                  } else g = 7;
+                  break;
+                }
+                case 77: {
+                  if (!(c3((e + 1) | 0, 141137) | 0)) d = 0;
+                  else g = 7;
+                  break;
+                }
+                default:
+                  g = 7;
+              }
+              if ((g | 0) == 7) {
+                c[f >> 2] = e;
+                gA(0, 141143, f) | 0;
+                d = 1;
+              }
+              l = h;
+              return d | 0;
+            }
+            function AX(a, d) {
+              a = a | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              f = l;
+              l = (l + 16) | 0;
+              e = f;
+              if (!(fX(d, 141122, 0, 65535, e) | 0)) {
+                b[(a + 38) >> 1] = c[e >> 2];
+                a = 0;
+              } else a = 1;
+              l = f;
+              return a | 0;
+            }
+            function BX(d, e) {
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 16) | 0;
+              f = h;
+              switch ((((Y3(a[e >> 0] | 0) | 0) << 24) >> 24) | 0) {
+                case 76: {
+                  if (!(c3((e + 1) | 0, 140768) | 0)) {
+                    d = (d + 36) | 0;
+                    b[d >> 1] = b[d >> 1] | 4;
+                    d = 0;
+                  } else g = 7;
+                  break;
+                }
+                case 82: {
+                  if (!(c3((e + 1) | 0, 140763) | 0)) {
+                    d = (d + 36) | 0;
+                    b[d >> 1] = b[d >> 1] | 2;
+                    d = 0;
+                  } else g = 7;
+                  break;
+                }
+                case 67: {
+                  if (!(c3((e + 1) | 0, 140772) | 0)) d = 0;
+                  else g = 7;
+                  break;
+                }
+                default:
+                  g = 7;
+              }
+              if ((g | 0) == 7) {
+                c[f >> 2] = e;
+                gA(0, 140778, f) | 0;
+                d = 1;
+              }
+              l = h;
+              return d | 0;
+            }
+            function CX(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              f = l;
+              l = (l + 16) | 0;
+              e = f;
+              if (!(fX(d, 141720, 0, 127, e) | 0)) {
+                a[(b + 88) >> 0] = c[e >> 2];
+                b = 0;
+              } else b = 1;
+              l = f;
+              return b | 0;
+            }
+            function DX(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              f = l;
+              l = (l + 16) | 0;
+              e = f;
+              if ((a[d >> 0] | 0) == 42) {
+                b = (b + 112) | 0;
+                a[b >> 0] = a[b >> 0] | 1;
+                b = 0;
+              } else {
+                c[e >> 2] = d;
+                gA(0, 141680, e) | 0;
+                b = 1;
+              }
+              l = f;
+              return b | 0;
+            }
+            function EX(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              f = l;
+              l = (l + 16) | 0;
+              e = f;
+              if ((a[d >> 0] | 0) == 42) {
+                b = (b + 112) | 0;
+                a[b >> 0] = a[b >> 0] | 2;
+                b = 0;
+              } else {
+                c[e >> 2] = d;
+                gA(0, 141643, e) | 0;
+                b = 1;
+              }
+              l = f;
+              return b | 0;
+            }
+            function FX() {
+              var b = 0;
+              b = ((a[189661] | a[189660]) << 24) >> 24;
+              _Y(c[47407] | 0);
+              oA(189644);
+              return b | 0;
+            }
+            function GX() {
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 16) | 0;
+              i = j;
+              c[47409] = 0;
+              d = 0;
+              a: do {
+                b: do
+                  switch (a[189663] | 0) {
+                    case 2: {
+                      b = -1;
+                      break a;
+                    }
+                    case 0: {
+                      a[189663] = 1;
+                      h = 6;
+                      b = 141732;
+                      d = 0;
+                      break;
+                    }
+                    default: {
+                      b = c[47408] | 0;
+                      if (!(a[b >> 0] | 0)) {
+                        a[189663] = 2;
+                        h = 7;
+                        b = 141739;
+                        break b;
+                      } else {
+                        d = HX(b) | 0;
+                        h = (d - b) | 0;
+                        break b;
+                      }
+                    }
+                  }
+                while (0);
+                c[47417] = c[47416];
+                c[47419] = c[47418];
+                c[47416] = b;
+                c[47418] = h;
+                e = c[47412] | 0;
+                f = (e - (c[47411] | 0)) | 0;
+                g = c[47407] | 0;
+                if (!f) b = k_(g, b, h, ((h | 0) == 0) & 1) | 0;
+                else {
+                  if (e >>> 0 < (c[47413] | 0) >>> 0) b = e;
+                  else {
+                    lA(189644, 1) | 0;
+                    b = c[47412] | 0;
+                  }
+                  a[b >> 0] = 0;
+                  b = c[47411] | 0;
+                  c[47412] = b;
+                  b = k_(g, b, f, 0) | 0;
+                }
+                if (!(((b | 0) != 0) | ((a[189661] | 0) != 0))) {
+                  g = v_(t_(c[47407] | 0) | 0) | 0;
+                  h = NW() | 0;
+                  c[i >> 2] = g;
+                  c[(i + 4) >> 2] = h;
+                  gA(1, 140575, i) | 0;
+                  OW();
+                  a[189661] = 1;
+                  c[47409] = 268;
+                }
+                if (d | 0) c[47408] = d;
+                b = c[47409] | 0;
+              } while ((b | 0) == 0);
+              l = j;
+              return b | 0;
+            }
+            function HX(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 16) | 0;
+              f = h;
+              d = (b + 1) | 0;
+              e = a[b >> 0] | 0;
+              a: do
+                if ((e << 24) >> 24 == 60) {
+                  e = a[d >> 0] | 0;
+                  if ((e << 24) >> 24 == 33)
+                    if (!(Q2((b + 2) | 0, 141747, 2) | 0)) {
+                      e = IX((b + 4) | 0) | 0;
+                      d = e;
+                      e = a[e >> 0] | 0;
+                      g = 8;
+                    } else {
+                      e = d;
+                      g = 5;
+                    }
+                  else g = 6;
+                  b: while (1)
+                    if ((g | 0) == 5) {
+                      d = e;
+                      e = a[e >> 0] | 0;
+                      g = 6;
+                      continue;
+                    } else if ((g | 0) == 6) {
+                      switch ((e << 24) >> 24) {
+                        case 62:
+                        case 0: {
+                          g = 8;
+                          continue b;
+                        }
+                        default: {
+                        }
+                      }
+                      e = (d + 1) | 0;
+                      g = 5;
+                      continue;
+                    } else if ((g | 0) == 8)
+                      if ((e << 24) >> 24 == 62) {
+                        g = 10;
+                        break;
+                      } else {
+                        g = 9;
+                        break;
+                      }
+                  if ((g | 0) == 9) {
+                    gA(0, 141750, f) | 0;
+                    a[189660] = 1;
+                    break;
+                  } else if ((g | 0) == 10) {
+                    d = (d + 1) | 0;
+                    break;
+                  }
+                } else {
+                  d = b;
+                  b = e;
+                  while (1) {
+                    switch ((b << 24) >> 24) {
+                      case 60:
+                      case 0:
+                        break a;
+                      case 38: {
+                        e = (d + 1) | 0;
+                        if ((a[e >> 0] | 0) == 35) g = 15;
+                        else e = $P(e, 189644) | 0;
+                        break;
+                      }
+                      default:
+                        g = 15;
+                    }
+                    if ((g | 0) == 15) {
+                      g = 0;
+                      e = c[47412] | 0;
+                      if (e >>> 0 >= (c[47413] | 0) >>> 0) {
+                        lA(189644, 1) | 0;
+                        e = c[47412] | 0;
+                      }
+                      c[47412] = e + 1;
+                      a[e >> 0] = b;
+                      e = (d + 1) | 0;
+                    }
+                    d = e;
+                    b = a[e >> 0] | 0;
+                  }
+                }
+              while (0);
+              l = h;
+              return d | 0;
+            }
+            function IX(b) {
+              b = b | 0;
+              var c = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 16) | 0;
+              i = j;
+              f = 1;
+              c = b;
+              a: while (1) {
+                e = (f | 0) == 0;
+                d = c;
+                b: while (1) {
+                  if (e) break a;
+                  g = (d + 1) | 0;
+                  switch (a[d >> 0] | 0) {
+                    case 0: {
+                      c = g;
+                      break a;
+                    }
+                    case 60: {
+                      h = 5;
+                      break b;
+                    }
+                    case 62: {
+                      c = -1;
+                      break b;
+                    }
+                    default:
+                      d = g;
+                  }
+                }
+                if ((h | 0) == 5) {
+                  h = 0;
+                  c = 1;
+                }
+                f = (f + c) | 0;
+                c = g;
+              }
+              d = (c + -1) | 0;
+              do
+                if (a[d >> 0] | 0) {
+                  c = (c + -3) | 0;
+                  if (c >>> 0 >= b >>> 0 ? (Q2(c, 141747, 2) | 0) == 0 : 0) break;
+                  gA(0, 141791, i) | 0;
+                  a[189660] = 1;
+                }
+              while (0);
+              l = j;
+              return d | 0;
+            }
+            function JX(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0;
+              d = T1(28) | 0;
+              if (!d) d = 0;
+              else {
+                e = 0;
+                f = 0;
+                while (1) {
+                  if ((e | 0) >= (b | 0)) break;
+                  r = ((c[((c[(a + (e << 2)) >> 2] | 0) + 4) >> 2] | 0) + f) | 0;
+                  e = (e + 1) | 0;
+                  f = r;
+                }
+                o = (d + 8) | 0;
+                c[o >> 2] = KX(f << 4) | 0;
+                p = (d + 12) | 0;
+                c[p >> 2] = KX(((b << 2) + 4) | 0) | 0;
+                e = f << 2;
+                q = (d + 16) | 0;
+                c[q >> 2] = KX(e) | 0;
+                e = KX(e) | 0;
+                r = (d + 20) | 0;
+                c[r >> 2] = e;
+                c[(d + 4) >> 2] = f;
+                c[d >> 2] = b;
+                f = 0;
+                h = 0;
+                while (1) {
+                  c[((c[p >> 2] | 0) + (h << 2)) >> 2] = f;
+                  if ((h | 0) >= (b | 0)) break;
+                  j = (a + (h << 2)) | 0;
+                  n = c[j >> 2] | 0;
+                  k = c[(n + 4) >> 2] | 0;
+                  l = (f + -1) | 0;
+                  g = 0;
+                  i = f;
+                  m = k;
+                  while (1) {
+                    if ((g | 0) >= (m | 0)) break;
+                    m = ((c[o >> 2] | 0) + (i << 4)) | 0;
+                    e = ((c[n >> 2] | 0) + (g << 4)) | 0;
+                    c[m >> 2] = c[e >> 2];
+                    c[(m + 4) >> 2] = c[(e + 4) >> 2];
+                    c[(m + 8) >> 2] = c[(e + 8) >> 2];
+                    c[(m + 12) >> 2] = c[(e + 12) >> 2];
+                    m = (i + 1) | 0;
+                    c[((c[q >> 2] | 0) + (i << 2)) >> 2] = m;
+                    e = c[r >> 2] | 0;
+                    c[(e + (i << 2)) >> 2] = i + -1;
+                    s = c[j >> 2] | 0;
+                    g = (g + 1) | 0;
+                    i = m;
+                    m = c[(s + 4) >> 2] | 0;
+                    n = s;
+                  }
+                  s = (l + k) | 0;
+                  c[((c[q >> 2] | 0) + (s << 2)) >> 2] = f;
+                  c[(e + (f << 2)) >> 2] = s;
+                  f = i;
+                  h = (h + 1) | 0;
+                }
+                KY(d);
+              }
+              return d | 0;
+            }
+            function KX(a) {
+              a = a | 0;
+              if (!a) a = 0;
+              else a = T1(a) | 0;
+              return a | 0;
+            }
+            function LX(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              U1(c[(a + 8) >> 2] | 0);
+              U1(c[(a + 12) >> 2] | 0);
+              U1(c[(a + 16) >> 2] | 0);
+              U1(c[(a + 20) >> 2] | 0);
+              d = (a + 24) | 0;
+              b = c[d >> 2] | 0;
+              if (b | 0) {
+                U1(c[b >> 2] | 0);
+                U1(c[d >> 2] | 0);
+              }
+              U1(a);
+              return;
+            }
+            function MX(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              p = l;
+              l = (l + 32) | 0;
+              m = (p + 16) | 0;
+              j = p;
+              c[m >> 2] = c[b >> 2];
+              c[(m + 4) >> 2] = c[(b + 4) >> 2];
+              c[(m + 8) >> 2] = c[(b + 8) >> 2];
+              c[(m + 12) >> 2] = c[(b + 12) >> 2];
+              n = RY(a, d, m) | 0;
+              c[m >> 2] = c[e >> 2];
+              c[(m + 4) >> 2] = c[(e + 4) >> 2];
+              c[(m + 8) >> 2] = c[(e + 8) >> 2];
+              c[(m + 12) >> 2] = c[(e + 12) >> 2];
+              o = RY(a, f, m) | 0;
+              c[j >> 2] = c[b >> 2];
+              c[(j + 4) >> 2] = c[(b + 4) >> 2];
+              c[(j + 8) >> 2] = c[(b + 8) >> 2];
+              c[(j + 12) >> 2] = c[(b + 12) >> 2];
+              c[m >> 2] = c[e >> 2];
+              c[(m + 4) >> 2] = c[(e + 4) >> 2];
+              c[(m + 8) >> 2] = c[(e + 8) >> 2];
+              c[(m + 12) >> 2] = c[(e + 12) >> 2];
+              m = AY(j, d, n, m, f, o, a) | 0;
+              d = c[(a + 4) >> 2] | 0;
+              j = (d + 1) | 0;
+              f = 1;
+              h = d;
+              while (1) {
+                h = c[(m + (h << 2)) >> 2] | 0;
+                k = (f + 1) | 0;
+                if ((h | 0) == (j | 0)) break;
+                else f = k;
+              }
+              i = T1(k << 4) | 0;
+              h = (i + (f << 4)) | 0;
+              c[h >> 2] = c[e >> 2];
+              c[(h + 4) >> 2] = c[(e + 4) >> 2];
+              c[(h + 8) >> 2] = c[(e + 8) >> 2];
+              c[(h + 12) >> 2] = c[(e + 12) >> 2];
+              a = (a + 8) | 0;
+              while (1) {
+                d = c[(m + (d << 2)) >> 2] | 0;
+                f = (f + -1) | 0;
+                h = (i + (f << 4)) | 0;
+                if ((d | 0) == (j | 0)) break;
+                e = ((c[a >> 2] | 0) + (d << 4)) | 0;
+                c[h >> 2] = c[e >> 2];
+                c[(h + 4) >> 2] = c[(e + 4) >> 2];
+                c[(h + 8) >> 2] = c[(e + 8) >> 2];
+                c[(h + 12) >> 2] = c[(e + 12) >> 2];
+              }
+              c[h >> 2] = c[b >> 2];
+              c[(h + 4) >> 2] = c[(b + 4) >> 2];
+              c[(h + 8) >> 2] = c[(b + 8) >> 2];
+              c[(h + 12) >> 2] = c[(b + 12) >> 2];
+              if (f | 0) qa(141809, 141816, 148, 141822);
+              if (n | 0) U1(n);
+              if (o | 0) U1(o);
+              c[(g + 4) >> 2] = k;
+              c[g >> 2] = i;
+              U1(m);
+              l = p;
+              return 1;
+            }
+            function NX(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              j = l;
+              l = (l + 48) | 0;
+              h = (j + 32) | 0;
+              g = (j + 16) | 0;
+              f = j;
+              i = c[a >> 2] | 0;
+              d = c[(a + 4) >> 2] | 0;
+              e = (d + -1) | 0;
+              a = 0;
+              while (1) {
+                if ((a | 0) >= (d | 0)) {
+                  a = 1;
+                  break;
+                }
+                m = (i + ((((e + a) | 0) % (d | 0) | 0) << 4)) | 0;
+                k = (i + (a << 4)) | 0;
+                c[f >> 2] = c[m >> 2];
+                c[(f + 4) >> 2] = c[(m + 4) >> 2];
+                c[(f + 8) >> 2] = c[(m + 8) >> 2];
+                c[(f + 12) >> 2] = c[(m + 12) >> 2];
+                c[g >> 2] = c[k >> 2];
+                c[(g + 4) >> 2] = c[(k + 4) >> 2];
+                c[(g + 8) >> 2] = c[(k + 8) >> 2];
+                c[(g + 12) >> 2] = c[(k + 12) >> 2];
+                c[h >> 2] = c[b >> 2];
+                c[(h + 4) >> 2] = c[(b + 4) >> 2];
+                c[(h + 8) >> 2] = c[(b + 8) >> 2];
+                c[(h + 12) >> 2] = c[(b + 12) >> 2];
+                if ((GY(f, g, h) | 0) == 1) {
+                  a = 0;
+                  break;
+                } else a = (a + 1) | 0;
+              }
+              l = j;
+              return a | 0;
+            }
+            function OX(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0;
+              u = l;
+              l = (l + 64) | 0;
+              m = (u + 48) | 0;
+              k = (u + 32) | 0;
+              s = 4;
+              j = T1(40) | 0;
+              c[j >> 2] = 0;
+              n = (u + 16) | 0;
+              q = u;
+              r = c[d >> 2] | 0;
+              i = c[(d + 4) >> 2] | 0;
+              s = U6(189680, 1, j | 0, s | 0) | 0;
+              j = z;
+              o = 0;
+              d = o;
+              o = 0;
+              if (((d | 0) != 0) & ((p | 0) != 0)) {
+                g = V6(c[d >> 2] | 0, s | 0, j | 0) | 0;
+                if (!g) bb(d | 0, p | 0);
+                z = p;
+              } else g = -1;
+              if ((g | 0) == 1) d = z;
+              else d = 0;
+              while (1) {
+                if (d | 0) {
+                  d = -1;
+                  break;
+                }
+                o = 0;
+                c[m >> 2] = c[e >> 2];
+                c[(m + 4) >> 2] = c[(e + 4) >> 2];
+                c[(m + 8) >> 2] = c[(e + 8) >> 2];
+                c[(m + 12) >> 2] = c[(e + 12) >> 2];
+                ja(28, n | 0, m | 0);
+                d = o;
+                o = 0;
+                if (((d | 0) != 0) & ((p | 0) != 0)) {
+                  g = V6(c[d >> 2] | 0, s | 0, j | 0) | 0;
+                  if (!g) bb(d | 0, p | 0);
+                  z = p;
+                } else g = -1;
+                if ((g | 0) == 1) {
+                  d = z;
+                  continue;
+                }
+                c[e >> 2] = c[n >> 2];
+                c[(e + 4) >> 2] = c[(n + 4) >> 2];
+                c[(e + 8) >> 2] = c[(n + 8) >> 2];
+                c[(e + 12) >> 2] = c[(n + 12) >> 2];
+                h = (e + 16) | 0;
+                o = 0;
+                c[m >> 2] = c[h >> 2];
+                c[(m + 4) >> 2] = c[(h + 4) >> 2];
+                c[(m + 8) >> 2] = c[(h + 8) >> 2];
+                c[(m + 12) >> 2] = c[(h + 12) >> 2];
+                ja(28, q | 0, m | 0);
+                d = o;
+                o = 0;
+                if (((d | 0) != 0) & ((p | 0) != 0)) {
+                  g = V6(c[d >> 2] | 0, s | 0, j | 0) | 0;
+                  if (!g) bb(d | 0, p | 0);
+                  z = p;
+                } else g = -1;
+                if ((g | 0) == 1) {
+                  d = z;
+                  continue;
+                }
+                c[h >> 2] = c[q >> 2];
+                c[(h + 4) >> 2] = c[(q + 4) >> 2];
+                c[(h + 8) >> 2] = c[(q + 8) >> 2];
+                c[(h + 12) >> 2] = c[(q + 12) >> 2];
+                c[47459] = 0;
+                o = 0;
+                ia(115, 4);
+                d = o;
+                o = 0;
+                if (((d | 0) != 0) & ((p | 0) != 0)) {
+                  g = V6(c[d >> 2] | 0, s | 0, j | 0) | 0;
+                  if (!g) bb(d | 0, p | 0);
+                  z = p;
+                } else g = -1;
+                if ((g | 0) == 1) {
+                  d = z;
+                  continue;
+                }
+                g = c[47460] | 0;
+                d = c[47459] | 0;
+                c[47459] = d + 1;
+                d = (g + (d << 4)) | 0;
+                c[d >> 2] = c[r >> 2];
+                c[(d + 4) >> 2] = c[(r + 4) >> 2];
+                c[(d + 8) >> 2] = c[(r + 8) >> 2];
+                c[(d + 12) >> 2] = c[(r + 12) >> 2];
+                o = 0;
+                c[k >> 2] = c[e >> 2];
+                c[(k + 4) >> 2] = c[(e + 4) >> 2];
+                c[(k + 8) >> 2] = c[(e + 8) >> 2];
+                c[(k + 12) >> 2] = c[(e + 12) >> 2];
+                c[m >> 2] = c[h >> 2];
+                c[(m + 4) >> 2] = c[(h + 4) >> 2];
+                c[(m + 8) >> 2] = c[(h + 8) >> 2];
+                c[(m + 12) >> 2] = c[(h + 12) >> 2];
+                d = fa(1, a | 0, b | 0, r | 0, i | 0, k | 0, m | 0) | 0;
+                g = o;
+                o = 0;
+                if (((g | 0) != 0) & ((p | 0) != 0)) {
+                  h = V6(c[g >> 2] | 0, s | 0, j | 0) | 0;
+                  if (!h) bb(g | 0, p | 0);
+                  z = p;
+                } else h = -1;
+                if ((h | 0) == 1) d = z;
+                else {
+                  t = 8;
+                  break;
+                }
+              }
+              if ((t | 0) == 8)
+                if ((d | 0) == -1) d = -1;
+                else {
+                  c[(f + 4) >> 2] = c[47459];
+                  c[f >> 2] = c[47460];
+                  d = 0;
+                }
+              U1(s | 0);
+              l = u;
+              return d | 0;
+            }
+            function PX(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0;
+              d = +h[b >> 3];
+              e = (b + 8) | 0;
+              f = +h[e >> 3];
+              i = f * f + d * d;
+              g = +C(+i);
+              if (i > 1.0e-6) {
+                h[b >> 3] = d / g;
+                h[e >> 3] = f / g;
+              }
+              c[a >> 2] = c[b >> 2];
+              c[(a + 4) >> 2] = c[(b + 4) >> 2];
+              c[(a + 8) >> 2] = c[(b + 8) >> 2];
+              c[(a + 12) >> 2] = c[(b + 12) >> 2];
+              return;
+            }
+            function QX(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              f = l;
+              l = (l + 32) | 0;
+              e = (f + 16) | 0;
+              d = f;
+              if ((c[47463] | 0) < (a | 0)) {
+                b = c[47460] | 0;
+                if (!b) {
+                  e = T1(a << 4) | 0;
+                  c[47460] = e;
+                  if (!e) {
+                    e = c[15712] | 0;
+                    c[d >> 2] = 141831;
+                    c[(d + 4) >> 2] = 531;
+                    c[(d + 8) >> 2] = 141966;
+                    w4(e, 141839, d) | 0;
+                    bb(189680, 1);
+                  }
+                } else {
+                  d = W1(b, a << 4) | 0;
+                  c[47460] = d;
+                  if (!d) {
+                    d = c[15712] | 0;
+                    c[e >> 2] = 141831;
+                    c[(e + 4) >> 2] = 537;
+                    c[(e + 8) >> 2] = 141984;
+                    w4(d, 141839, e) | 0;
+                    bb(189680, 1);
+                  }
+                }
+                c[47463] = a;
+              }
+              l = f;
+              return;
+            }
+            function RX(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0.0,
+                k = 0,
+                m = 0.0,
+                n = 0,
+                o = 0.0,
+                p = 0.0,
+                q = 0,
+                r = 0.0,
+                s = 0.0,
+                t = 0.0,
+                u = 0.0,
+                v = 0.0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                O = 0,
+                P = 0,
+                Q = 0,
+                R = 0,
+                S = 0,
+                T = 0.0,
+                U = 0.0,
+                V = 0.0,
+                W = 0.0;
+              R = l;
+              l = (l + 336) | 0;
+              J = (R + 320) | 0;
+              I = (R + 304) | 0;
+              w = (R + 144) | 0;
+              q = (R + 128) | 0;
+              G = (R + 112) | 0;
+              H = (R + 96) | 0;
+              Q = (R + 80) | 0;
+              A = (R + 64) | 0;
+              C = (R + 48) | 0;
+              K = (R + 32) | 0;
+              L = (R + 16) | 0;
+              M = R;
+              x = (R + 288) | 0;
+              y = (R + 272) | 0;
+              z = (R + 256) | 0;
+              B = (R + 240) | 0;
+              D = (R + 224) | 0;
+              E = (R + 208) | 0;
+              N = (R + 192) | 0;
+              O = (R + 176) | 0;
+              P = (R + 160) | 0;
+              i = c[47462] | 0;
+              do
+                if ((c[47461] | 0) < (e | 0)) {
+                  if (!i) {
+                    i = T1((e * 40) | 0) | 0;
+                    c[47462] = i;
+                    if (!i) {
+                      i = -1;
+                      break;
+                    }
+                  } else {
+                    i = W1(i, (e * 40) | 0) | 0;
+                    c[47462] = i;
+                    if (!i) {
+                      i = -1;
+                      break;
+                    }
+                  }
+                  c[47461] = e;
+                  k = 6;
+                } else k = 6;
+              while (0);
+              if ((k | 0) == 6) {
+                h[i >> 3] = 0.0;
+                k = 1;
+                j = 0.0;
+                while (1) {
+                  if ((k | 0) >= (e | 0)) break;
+                  n = (d + (k << 4)) | 0;
+                  F = (d + ((k + -1) << 4)) | 0;
+                  c[I >> 2] = c[n >> 2];
+                  c[(I + 4) >> 2] = c[(n + 4) >> 2];
+                  c[(I + 8) >> 2] = c[(n + 8) >> 2];
+                  c[(I + 12) >> 2] = c[(n + 12) >> 2];
+                  c[J >> 2] = c[F >> 2];
+                  c[(J + 4) >> 2] = c[(F + 4) >> 2];
+                  c[(J + 8) >> 2] = c[(F + 8) >> 2];
+                  c[(J + 12) >> 2] = c[(F + 12) >> 2];
+                  v = +SX(I, J) + j;
+                  h[(i + ((k * 40) | 0)) >> 3] = v;
+                  k = (k + 1) | 0;
+                  j = v;
+                }
+                F = (e + -1) | 0;
+                n = (i + ((F * 40) | 0)) | 0;
+                k = 1;
+                while (1) {
+                  if ((k | 0) >= (e | 0)) break;
+                  S = (i + ((k * 40) | 0)) | 0;
+                  h[S >> 3] = +h[S >> 3] / +h[n >> 3];
+                  k = (k + 1) | 0;
+                }
+                k = 0;
+                while (1) {
+                  if ((k | 0) >= (e | 0)) break;
+                  S = (i + ((k * 40) | 0) + 8) | 0;
+                  n = (i + ((k * 40) | 0)) | 0;
+                  v = +TX(+h[n >> 3]);
+                  c[J >> 2] = c[f >> 2];
+                  c[(J + 4) >> 2] = c[(f + 4) >> 2];
+                  c[(J + 8) >> 2] = c[(f + 8) >> 2];
+                  c[(J + 12) >> 2] = c[(f + 12) >> 2];
+                  UX(x, J, v);
+                  c[S >> 2] = c[x >> 2];
+                  c[(S + 4) >> 2] = c[(x + 4) >> 2];
+                  c[(S + 8) >> 2] = c[(x + 8) >> 2];
+                  c[(S + 12) >> 2] = c[(x + 12) >> 2];
+                  S = (i + ((k * 40) | 0) + 24) | 0;
+                  v = +VX(+h[n >> 3]);
+                  c[J >> 2] = c[g >> 2];
+                  c[(J + 4) >> 2] = c[(g + 4) >> 2];
+                  c[(J + 8) >> 2] = c[(g + 8) >> 2];
+                  c[(J + 12) >> 2] = c[(g + 12) >> 2];
+                  UX(y, J, v);
+                  c[S >> 2] = c[y >> 2];
+                  c[(S + 4) >> 2] = c[(y + 4) >> 2];
+                  c[(S + 8) >> 2] = c[(y + 8) >> 2];
+                  c[(S + 12) >> 2] = c[(y + 12) >> 2];
+                  k = (k + 1) | 0;
+                }
+                c[I >> 2] = c[f >> 2];
+                c[(I + 4) >> 2] = c[(f + 4) >> 2];
+                c[(I + 8) >> 2] = c[(f + 8) >> 2];
+                c[(I + 12) >> 2] = c[(f + 12) >> 2];
+                c[J >> 2] = c[g >> 2];
+                c[(J + 4) >> 2] = c[(g + 4) >> 2];
+                c[(J + 8) >> 2] = c[(g + 8) >> 2];
+                c[(J + 12) >> 2] = c[(g + 12) >> 2];
+                WX(d, e, i, I, J, G, A, H, C);
+                c[q >> 2] = c[G >> 2];
+                c[(q + 4) >> 2] = c[(G + 4) >> 2];
+                c[(q + 8) >> 2] = c[(G + 8) >> 2];
+                c[(q + 12) >> 2] = c[(G + 12) >> 2];
+                c[w >> 2] = c[A >> 2];
+                c[(w + 4) >> 2] = c[(A + 4) >> 2];
+                c[(w + 8) >> 2] = c[(A + 8) >> 2];
+                c[(w + 12) >> 2] = c[(A + 12) >> 2];
+                c[I >> 2] = c[H >> 2];
+                c[(I + 4) >> 2] = c[(H + 4) >> 2];
+                c[(I + 8) >> 2] = c[(H + 8) >> 2];
+                c[(I + 12) >> 2] = c[(H + 12) >> 2];
+                c[J >> 2] = c[C >> 2];
+                c[(J + 4) >> 2] = c[(C + 4) >> 2];
+                c[(J + 8) >> 2] = c[(C + 8) >> 2];
+                c[(J + 12) >> 2] = c[(C + 12) >> 2];
+                if (!(XX(a, b, q, w, I, J, d, e) | 0)) {
+                  c[J >> 2] = c[A >> 2];
+                  c[(J + 4) >> 2] = c[(A + 4) >> 2];
+                  c[(J + 8) >> 2] = c[(A + 8) >> 2];
+                  c[(J + 12) >> 2] = c[(A + 12) >> 2];
+                  UX(z, J, 0.3333333333333333);
+                  c[I >> 2] = c[G >> 2];
+                  c[(I + 4) >> 2] = c[(G + 4) >> 2];
+                  c[(I + 8) >> 2] = c[(G + 8) >> 2];
+                  c[(I + 12) >> 2] = c[(G + 12) >> 2];
+                  c[J >> 2] = c[z >> 2];
+                  c[(J + 4) >> 2] = c[(z + 4) >> 2];
+                  c[(J + 8) >> 2] = c[(z + 8) >> 2];
+                  c[(J + 12) >> 2] = c[(z + 12) >> 2];
+                  YX(B, I, J);
+                  v = +h[B >> 3];
+                  u = +h[(B + 8) >> 3];
+                  c[J >> 2] = c[C >> 2];
+                  c[(J + 4) >> 2] = c[(C + 4) >> 2];
+                  c[(J + 8) >> 2] = c[(C + 8) >> 2];
+                  c[(J + 12) >> 2] = c[(C + 12) >> 2];
+                  UX(D, J, 0.3333333333333333);
+                  c[I >> 2] = c[H >> 2];
+                  c[(I + 4) >> 2] = c[(H + 4) >> 2];
+                  c[(I + 8) >> 2] = c[(H + 8) >> 2];
+                  c[(I + 12) >> 2] = c[(H + 12) >> 2];
+                  c[J >> 2] = c[D >> 2];
+                  c[(J + 4) >> 2] = c[(D + 4) >> 2];
+                  c[(J + 8) >> 2] = c[(D + 8) >> 2];
+                  c[(J + 12) >> 2] = c[(D + 12) >> 2];
+                  ZX(E, I, J);
+                  t = +h[E >> 3];
+                  p = +h[(E + 8) >> 3];
+                  q = c[47462] | 0;
+                  r = +h[G >> 3];
+                  s = +h[H >> 3];
+                  o = +h[(G + 8) >> 3];
+                  m = +h[(H + 8) >> 3];
+                  n = (Q + 8) | 0;
+                  i = -1;
+                  j = -1.0;
+                  k = 1;
+                  while (1) {
+                    if ((k | 0) >= (F | 0)) break;
+                    T = +h[(q + ((k * 40) | 0)) >> 3];
+                    U = +_X(T);
+                    V = +TX(T);
+                    W = +VX(T);
+                    T = +$X(T);
+                    h[Q >> 3] = V * v + r * U + W * t + s * T;
+                    h[n >> 3] = W * p + V * u + o * U + m * T;
+                    S = (d + (k << 4)) | 0;
+                    c[I >> 2] = c[Q >> 2];
+                    c[(I + 4) >> 2] = c[(Q + 4) >> 2];
+                    c[(I + 8) >> 2] = c[(Q + 8) >> 2];
+                    c[(I + 12) >> 2] = c[(Q + 12) >> 2];
+                    c[J >> 2] = c[S >> 2];
+                    c[(J + 4) >> 2] = c[(S + 4) >> 2];
+                    c[(J + 8) >> 2] = c[(S + 8) >> 2];
+                    c[(J + 12) >> 2] = c[(S + 12) >> 2];
+                    T = +SX(I, J);
+                    S = T > j;
+                    i = S ? k : i;
+                    j = S ? T : j;
+                    k = (k + 1) | 0;
+                  }
+                  S = (d + (i << 4)) | 0;
+                  Q = (d + ((i + -1) << 4)) | 0;
+                  c[I >> 2] = c[S >> 2];
+                  c[(I + 4) >> 2] = c[(S + 4) >> 2];
+                  c[(I + 8) >> 2] = c[(S + 8) >> 2];
+                  c[(I + 12) >> 2] = c[(S + 12) >> 2];
+                  c[J >> 2] = c[Q >> 2];
+                  c[(J + 4) >> 2] = c[(Q + 4) >> 2];
+                  c[(J + 8) >> 2] = c[(Q + 8) >> 2];
+                  c[(J + 12) >> 2] = c[(Q + 12) >> 2];
+                  ZX(N, I, J);
+                  c[J >> 2] = c[N >> 2];
+                  c[(J + 4) >> 2] = c[(N + 4) >> 2];
+                  c[(J + 8) >> 2] = c[(N + 8) >> 2];
+                  c[(J + 12) >> 2] = c[(N + 12) >> 2];
+                  PX(L, J);
+                  Q = (i + 1) | 0;
+                  N = (d + (Q << 4)) | 0;
+                  c[I >> 2] = c[N >> 2];
+                  c[(I + 4) >> 2] = c[(N + 4) >> 2];
+                  c[(I + 8) >> 2] = c[(N + 8) >> 2];
+                  c[(I + 12) >> 2] = c[(N + 12) >> 2];
+                  c[J >> 2] = c[S >> 2];
+                  c[(J + 4) >> 2] = c[(S + 4) >> 2];
+                  c[(J + 8) >> 2] = c[(S + 8) >> 2];
+                  c[(J + 12) >> 2] = c[(S + 12) >> 2];
+                  ZX(O, I, J);
+                  c[J >> 2] = c[O >> 2];
+                  c[(J + 4) >> 2] = c[(O + 4) >> 2];
+                  c[(J + 8) >> 2] = c[(O + 8) >> 2];
+                  c[(J + 12) >> 2] = c[(O + 12) >> 2];
+                  PX(M, J);
+                  c[I >> 2] = c[L >> 2];
+                  c[(I + 4) >> 2] = c[(L + 4) >> 2];
+                  c[(I + 8) >> 2] = c[(L + 8) >> 2];
+                  c[(I + 12) >> 2] = c[(L + 12) >> 2];
+                  c[J >> 2] = c[M >> 2];
+                  c[(J + 4) >> 2] = c[(M + 4) >> 2];
+                  c[(J + 8) >> 2] = c[(M + 8) >> 2];
+                  c[(J + 12) >> 2] = c[(M + 12) >> 2];
+                  YX(P, I, J);
+                  c[J >> 2] = c[P >> 2];
+                  c[(J + 4) >> 2] = c[(P + 4) >> 2];
+                  c[(J + 8) >> 2] = c[(P + 8) >> 2];
+                  c[(J + 12) >> 2] = c[(P + 12) >> 2];
+                  PX(K, J);
+                  c[I >> 2] = c[f >> 2];
+                  c[(I + 4) >> 2] = c[(f + 4) >> 2];
+                  c[(I + 8) >> 2] = c[(f + 8) >> 2];
+                  c[(I + 12) >> 2] = c[(f + 12) >> 2];
+                  c[J >> 2] = c[K >> 2];
+                  c[(J + 4) >> 2] = c[(K + 4) >> 2];
+                  c[(J + 8) >> 2] = c[(K + 8) >> 2];
+                  c[(J + 12) >> 2] = c[(K + 12) >> 2];
+                  RX(a, b, d, Q, I, J) | 0;
+                  c[I >> 2] = c[K >> 2];
+                  c[(I + 4) >> 2] = c[(K + 4) >> 2];
+                  c[(I + 8) >> 2] = c[(K + 8) >> 2];
+                  c[(I + 12) >> 2] = c[(K + 12) >> 2];
+                  c[J >> 2] = c[g >> 2];
+                  c[(J + 4) >> 2] = c[(g + 4) >> 2];
+                  c[(J + 8) >> 2] = c[(g + 8) >> 2];
+                  c[(J + 12) >> 2] = c[(g + 12) >> 2];
+                  RX(a, b, S, (e - i) | 0, I, J) | 0;
+                  i = 0;
+                } else i = 0;
+              }
+              l = R;
+              return i | 0;
+            }
+            function SX(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0,
+                d = 0.0;
+              c = +h[b >> 3] - +h[a >> 3];
+              d = +h[(b + 8) >> 3] - +h[(a + 8) >> 3];
+              return +(+C(+(d * d + c * c)));
+            }
+            function TX(a) {
+              a = +a;
+              var b = 0.0;
+              b = 1.0 - a;
+              return +(b * b * (a * 3.0));
+            }
+            function UX(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = +d;
+              var e = 0;
+              h[b >> 3] = +h[b >> 3] * d;
+              e = (b + 8) | 0;
+              h[e >> 3] = +h[e >> 3] * d;
+              c[a >> 2] = c[b >> 2];
+              c[(a + 4) >> 2] = c[(b + 4) >> 2];
+              c[(a + 8) >> 2] = c[(b + 8) >> 2];
+              c[(a + 12) >> 2] = c[(b + 12) >> 2];
+              return;
+            }
+            function VX(a) {
+              a = +a;
+              return +(a * a * 3.0 * (1.0 - a));
+            }
+            function WX(a, b, d, e, f, g, i, j, k) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              j = j | 0;
+              k = k | 0;
+              var m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0.0,
+                x = 0.0,
+                y = 0.0,
+                z = 0.0,
+                A = 0.0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0.0,
+                I = 0.0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0;
+              G = l;
+              l = (l + 128) | 0;
+              B = (G + 112) | 0;
+              v = (G + 80) | 0;
+              u = G;
+              r = (G + 96) | 0;
+              s = (G + 64) | 0;
+              t = (G + 48) | 0;
+              C = (G + 32) | 0;
+              D = (G + 16) | 0;
+              E = (a + ((b + -1) << 4)) | 0;
+              q = 0;
+              w = 0.0;
+              x = 0.0;
+              y = 0.0;
+              z = 0.0;
+              A = 0.0;
+              while (1) {
+                if ((q | 0) >= (b | 0)) break;
+                K = (d + ((q * 40) | 0) + 8) | 0;
+                c[v >> 2] = c[K >> 2];
+                c[(v + 4) >> 2] = c[(K + 4) >> 2];
+                c[(v + 8) >> 2] = c[(K + 8) >> 2];
+                c[(v + 12) >> 2] = c[(K + 12) >> 2];
+                c[B >> 2] = c[K >> 2];
+                c[(B + 4) >> 2] = c[(K + 4) >> 2];
+                c[(B + 8) >> 2] = c[(K + 8) >> 2];
+                c[(B + 12) >> 2] = c[(K + 12) >> 2];
+                H = +fY(v, B) + x;
+                J = (d + ((q * 40) | 0) + 24) | 0;
+                c[v >> 2] = c[K >> 2];
+                c[(v + 4) >> 2] = c[(K + 4) >> 2];
+                c[(v + 8) >> 2] = c[(K + 8) >> 2];
+                c[(v + 12) >> 2] = c[(K + 12) >> 2];
+                c[B >> 2] = c[J >> 2];
+                c[(B + 4) >> 2] = c[(J + 4) >> 2];
+                c[(B + 8) >> 2] = c[(J + 8) >> 2];
+                c[(B + 12) >> 2] = c[(J + 12) >> 2];
+                p = +fY(v, B) + A;
+                c[v >> 2] = c[J >> 2];
+                c[(v + 4) >> 2] = c[(J + 4) >> 2];
+                c[(v + 8) >> 2] = c[(J + 8) >> 2];
+                c[(v + 12) >> 2] = c[(J + 12) >> 2];
+                c[B >> 2] = c[J >> 2];
+                c[(B + 4) >> 2] = c[(J + 4) >> 2];
+                c[(B + 8) >> 2] = c[(J + 8) >> 2];
+                c[(B + 12) >> 2] = c[(J + 12) >> 2];
+                o = +fY(v, B) + y;
+                L = (a + (q << 4)) | 0;
+                M = (d + ((q * 40) | 0)) | 0;
+                I = +gY(+h[M >> 3]);
+                c[B >> 2] = c[a >> 2];
+                c[(B + 4) >> 2] = c[(a + 4) >> 2];
+                c[(B + 8) >> 2] = c[(a + 8) >> 2];
+                c[(B + 12) >> 2] = c[(a + 12) >> 2];
+                UX(s, B, I);
+                I = +hY(+h[M >> 3]);
+                c[B >> 2] = c[E >> 2];
+                c[(B + 4) >> 2] = c[(E + 4) >> 2];
+                c[(B + 8) >> 2] = c[(E + 8) >> 2];
+                c[(B + 12) >> 2] = c[(E + 12) >> 2];
+                UX(t, B, I);
+                c[v >> 2] = c[s >> 2];
+                c[(v + 4) >> 2] = c[(s + 4) >> 2];
+                c[(v + 8) >> 2] = c[(s + 8) >> 2];
+                c[(v + 12) >> 2] = c[(s + 12) >> 2];
+                c[B >> 2] = c[t >> 2];
+                c[(B + 4) >> 2] = c[(t + 4) >> 2];
+                c[(B + 8) >> 2] = c[(t + 8) >> 2];
+                c[(B + 12) >> 2] = c[(t + 12) >> 2];
+                YX(r, v, B);
+                c[v >> 2] = c[L >> 2];
+                c[(v + 4) >> 2] = c[(L + 4) >> 2];
+                c[(v + 8) >> 2] = c[(L + 8) >> 2];
+                c[(v + 12) >> 2] = c[(L + 12) >> 2];
+                c[B >> 2] = c[r >> 2];
+                c[(B + 4) >> 2] = c[(r + 4) >> 2];
+                c[(B + 8) >> 2] = c[(r + 8) >> 2];
+                c[(B + 12) >> 2] = c[(r + 12) >> 2];
+                ZX(u, v, B);
+                c[v >> 2] = c[K >> 2];
+                c[(v + 4) >> 2] = c[(K + 4) >> 2];
+                c[(v + 8) >> 2] = c[(K + 8) >> 2];
+                c[(v + 12) >> 2] = c[(K + 12) >> 2];
+                c[B >> 2] = c[u >> 2];
+                c[(B + 4) >> 2] = c[(u + 4) >> 2];
+                c[(B + 8) >> 2] = c[(u + 8) >> 2];
+                c[(B + 12) >> 2] = c[(u + 12) >> 2];
+                I = +fY(v, B) + w;
+                c[v >> 2] = c[J >> 2];
+                c[(v + 4) >> 2] = c[(J + 4) >> 2];
+                c[(v + 8) >> 2] = c[(J + 8) >> 2];
+                c[(v + 12) >> 2] = c[(J + 12) >> 2];
+                c[B >> 2] = c[u >> 2];
+                c[(B + 4) >> 2] = c[(u + 4) >> 2];
+                c[(B + 8) >> 2] = c[(u + 8) >> 2];
+                c[(B + 12) >> 2] = c[(u + 12) >> 2];
+                q = (q + 1) | 0;
+                w = I;
+                x = H;
+                y = o;
+                z = +fY(v, B) + z;
+                A = p;
+              }
+              o = y * x - A * A;
+              p = o >= 0.0 ? o : -o;
+              if (
+                !(p >= 1.0e-6
+                  ? ((m = (y * w - A * z) / o), (n = (x * z - A * w) / o), !((p < 1.0e-6) | (m <= 0.0) | (n <= 0.0)))
+                  : 0)
+              )
+                F = 6;
+              if ((F | 0) == 6) {
+                c[v >> 2] = c[a >> 2];
+                c[(v + 4) >> 2] = c[(a + 4) >> 2];
+                c[(v + 8) >> 2] = c[(a + 8) >> 2];
+                c[(v + 12) >> 2] = c[(a + 12) >> 2];
+                c[B >> 2] = c[E >> 2];
+                c[(B + 4) >> 2] = c[(E + 4) >> 2];
+                c[(B + 8) >> 2] = c[(E + 8) >> 2];
+                c[(B + 12) >> 2] = c[(E + 12) >> 2];
+                m = +SX(v, B) * 0.3333333333333333;
+                n = m;
+              }
+              c[g >> 2] = c[a >> 2];
+              c[(g + 4) >> 2] = c[(a + 4) >> 2];
+              c[(g + 8) >> 2] = c[(a + 8) >> 2];
+              c[(g + 12) >> 2] = c[(a + 12) >> 2];
+              c[B >> 2] = c[e >> 2];
+              c[(B + 4) >> 2] = c[(e + 4) >> 2];
+              c[(B + 8) >> 2] = c[(e + 8) >> 2];
+              c[(B + 12) >> 2] = c[(e + 12) >> 2];
+              UX(C, B, m);
+              c[i >> 2] = c[C >> 2];
+              c[(i + 4) >> 2] = c[(C + 4) >> 2];
+              c[(i + 8) >> 2] = c[(C + 8) >> 2];
+              c[(i + 12) >> 2] = c[(C + 12) >> 2];
+              c[j >> 2] = c[E >> 2];
+              c[(j + 4) >> 2] = c[(E + 4) >> 2];
+              c[(j + 8) >> 2] = c[(E + 8) >> 2];
+              c[(j + 12) >> 2] = c[(E + 12) >> 2];
+              c[B >> 2] = c[f >> 2];
+              c[(B + 4) >> 2] = c[(f + 4) >> 2];
+              c[(B + 8) >> 2] = c[(f + 8) >> 2];
+              c[(B + 12) >> 2] = c[(f + 12) >> 2];
+              UX(D, B, n);
+              c[k >> 2] = c[D >> 2];
+              c[(k + 4) >> 2] = c[(D + 4) >> 2];
+              c[(k + 8) >> 2] = c[(D + 8) >> 2];
+              c[(k + 12) >> 2] = c[(D + 12) >> 2];
+              l = G;
+              return;
+            }
+            function XX(a, b, d, e, f, g, i, j) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              j = j | 0;
+              var k = 0.0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0,
+                r = 0.0,
+                s = 0.0,
+                t = 0,
+                u = 0.0,
+                v = 0,
+                w = 0.0,
+                x = 0,
+                y = 0.0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0.0,
+                E = 0;
+              C = l;
+              l = (l + 64) | 0;
+              B = C;
+              z = (j | 0) == 2;
+              y = +h[d >> 3];
+              u = +h[(d + 8) >> 3];
+              v = (B + 8) | 0;
+              w = +h[e >> 3];
+              x = (B + 16) | 0;
+              p = +h[(e + 8) >> 3];
+              q = (B + 24) | 0;
+              r = +h[f >> 3];
+              s = +h[g >> 3];
+              t = (B + 32) | 0;
+              o = +h[(f + 8) >> 3];
+              n = +h[(g + 8) >> 3];
+              e = (B + 40) | 0;
+              f = (B + 48) | 0;
+              g = (B + 56) | 0;
+              d = 1;
+              k = 4.0;
+              m = 4.0;
+              while (1) {
+                h[B >> 3] = y;
+                h[v >> 3] = u;
+                D = m * 0.3333333333333333;
+                h[x >> 3] = D * w + y;
+                h[q >> 3] = D * p + u;
+                D = k * 0.3333333333333333;
+                h[t >> 3] = r - D * s;
+                h[e >> 3] = o - D * n;
+                h[f >> 3] = r;
+                h[g >> 3] = o;
+                if (d ? ((D = +aY(B, 4)), D < +aY(i, j) + -0.001) : 0) {
+                  d = 0;
+                  break;
+                }
+                if (bY(a, b, B) | 0) {
+                  A = 5;
+                  break;
+                }
+                if ((m == 0.0) & (k == 0.0)) {
+                  A = 9;
+                  break;
+                }
+                E = m > 0.01;
+                d = 0;
+                k = E ? k * 0.5 : 0.0;
+                m = E ? m * 0.5 : 0.0;
+              }
+              a: do
+                if ((A | 0) == 5) {
+                  QX(((c[47459] | 0) + 4) | 0);
+                  e = c[47460] | 0;
+                  d = 1;
+                  while (1) {
+                    if ((d | 0) == 4) {
+                      d = 1;
+                      break a;
+                    }
+                    E = c[47459] | 0;
+                    h[(e + (E << 4)) >> 3] = +h[(B + (d << 4)) >> 3];
+                    D = +h[(B + (d << 4) + 8) >> 3];
+                    c[47459] = E + 1;
+                    h[(e + (E << 4) + 8) >> 3] = D;
+                    d = (d + 1) | 0;
+                  }
+                } else if ((A | 0) == 9)
+                  if (z) {
+                    QX(((c[47459] | 0) + 4) | 0);
+                    e = c[47460] | 0;
+                    d = 1;
+                    while (1) {
+                      if ((d | 0) == 4) {
+                        d = 1;
+                        break a;
+                      }
+                      E = c[47459] | 0;
+                      h[(e + (E << 4)) >> 3] = +h[(B + (d << 4)) >> 3];
+                      D = +h[(B + (d << 4) + 8) >> 3];
+                      c[47459] = E + 1;
+                      h[(e + (E << 4) + 8) >> 3] = D;
+                      d = (d + 1) | 0;
+                    }
+                  } else d = 0;
+              while (0);
+              l = C;
+              return d | 0;
+            }
+            function YX(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              h[b >> 3] = +h[b >> 3] + +h[d >> 3];
+              e = (b + 8) | 0;
+              h[e >> 3] = +h[e >> 3] + +h[(d + 8) >> 3];
+              c[a >> 2] = c[b >> 2];
+              c[(a + 4) >> 2] = c[(b + 4) >> 2];
+              c[(a + 8) >> 2] = c[(b + 8) >> 2];
+              c[(a + 12) >> 2] = c[(b + 12) >> 2];
+              return;
+            }
+            function ZX(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              h[b >> 3] = +h[b >> 3] - +h[d >> 3];
+              e = (b + 8) | 0;
+              h[e >> 3] = +h[e >> 3] - +h[(d + 8) >> 3];
+              c[a >> 2] = c[b >> 2];
+              c[(a + 4) >> 2] = c[(b + 4) >> 2];
+              c[(a + 8) >> 2] = c[(b + 8) >> 2];
+              c[(a + 12) >> 2] = c[(b + 12) >> 2];
+              return;
+            }
+            function _X(a) {
+              a = +a;
+              a = 1.0 - a;
+              return +(a * a * a);
+            }
+            function $X(a) {
+              a = +a;
+              return +(a * a * a);
+            }
+            function aY(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0,
+                d = 0,
+                e = 0.0,
+                f = 0.0,
+                g = 0;
+              c = 0.0;
+              d = 1;
+              while (1) {
+                if ((d | 0) >= (b | 0)) break;
+                g = (d + -1) | 0;
+                e = +h[(a + (d << 4)) >> 3] - +h[(a + (g << 4)) >> 3];
+                f = +h[(a + (d << 4) + 8) >> 3] - +h[(a + (g << 4) + 8) >> 3];
+                c = +C(+(f * f + e * e)) + c;
+                d = (d + 1) | 0;
+              }
+              return +c;
+            }
+            function bY(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0,
+                r = 0.0,
+                s = 0.0,
+                t = 0,
+                u = 0,
+                v = 0.0,
+                w = 0,
+                x = 0.0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0.0,
+                E = 0.0;
+              C = l;
+              l = (l + 64) | 0;
+              t = (C + 32) | 0;
+              u = C;
+              w = (u + 16) | 0;
+              y = (d + 16) | 0;
+              z = (d + 32) | 0;
+              A = (d + 48) | 0;
+              B = (d + 8) | 0;
+              g = (d + 24) | 0;
+              i = (d + 40) | 0;
+              j = (d + 56) | 0;
+              k = (u + 8) | 0;
+              m = (u + 24) | 0;
+              f = 0;
+              a: while (1) {
+                if ((f | 0) >= (b | 0)) {
+                  e = 1;
+                  break;
+                }
+                n = (a + (f << 5)) | 0;
+                c[u >> 2] = c[n >> 2];
+                c[(u + 4) >> 2] = c[(n + 4) >> 2];
+                c[(u + 8) >> 2] = c[(n + 8) >> 2];
+                c[(u + 12) >> 2] = c[(n + 12) >> 2];
+                n = (a + (f << 5) + 16) | 0;
+                c[w >> 2] = c[n >> 2];
+                c[(w + 4) >> 2] = c[(n + 4) >> 2];
+                c[(w + 8) >> 2] = c[(n + 8) >> 2];
+                c[(w + 12) >> 2] = c[(n + 12) >> 2];
+                n = cY(d, u, t) | 0;
+                b: do
+                  if ((n | 0) != 4) {
+                    o = +h[u >> 3];
+                    p = +h[k >> 3];
+                    q = +h[w >> 3];
+                    r = +h[m >> 3];
+                    e = 0;
+                    while (1) {
+                      if ((e | 0) >= (n | 0)) break b;
+                      s = +h[(t + (e << 3)) >> 3];
+                      if (
+                        (
+                          !((s < 1.0e-6) | (s > 0.999999))
+                            ? ((x = s * s * s),
+                              (E = s * 3.0),
+                              (D = 1.0 - s),
+                              (s = E * s * D),
+                              (v = D * D),
+                              (E = v * E),
+                              (D = v * D),
+                              (v = +h[y >> 3] * E + +h[d >> 3] * D + +h[z >> 3] * s + +h[A >> 3] * x),
+                              (x = +h[g >> 3] * E + +h[B >> 3] * D + +h[i >> 3] * s + +h[j >> 3] * x),
+                              (s = v - o),
+                              (D = x - p),
+                              !(D * D + s * s < 0.001))
+                            : 0
+                        )
+                          ? ((E = v - q), (D = x - r), !(D * D + E * E < 0.001))
+                          : 0
+                      ) {
+                        e = 0;
+                        break a;
+                      }
+                      e = (e + 1) | 0;
+                    }
+                  }
+                while (0);
+                f = (f + 1) | 0;
+              }
+              l = C;
+              return e | 0;
+            }
+            function cY(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0,
+                j = 0.0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0.0,
+                q = 0.0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0;
+              v = l;
+              l = (l + 96) | 0;
+              s = (v + 48) | 0;
+              t = (v + 24) | 0;
+              k = v;
+              u = (v + 80) | 0;
+              p = +h[b >> 3];
+              g = +h[(b + 16) >> 3] - p;
+              q = +h[(b + 8) >> 3];
+              j = +h[(b + 24) >> 3] - q;
+              c[u >> 2] = 0;
+              a: do
+                if (!(g == 0.0)) {
+                  j = j / g;
+                  m = (a + 16) | 0;
+                  n = (a + 32) | 0;
+                  o = (a + 48) | 0;
+                  dY(
+                    +h[(a + 8) >> 3] - +h[a >> 3] * j,
+                    +h[(a + 24) >> 3] - +h[m >> 3] * j,
+                    +h[(a + 40) >> 3] - +h[n >> 3] * j,
+                    +h[(a + 56) >> 3] - +h[o >> 3] * j,
+                    s
+                  );
+                  h[s >> 3] = j * p - q + +h[s >> 3];
+                  e = BY(s, t) | 0;
+                  if ((e | 0) == 4) b = 4;
+                  else {
+                    f = (s + 8) | 0;
+                    i = (s + 16) | 0;
+                    k = (s + 24) | 0;
+                    g = 1.0 / g;
+                    b = 0;
+                    while (1) {
+                      if ((b | 0) >= (e | 0)) break;
+                      j = +h[(t + (b << 3)) >> 3];
+                      if (
+                        (j >= 0.0) & (j <= 1.0)
+                          ? (dY(+h[a >> 3], +h[m >> 3], +h[n >> 3], +h[o >> 3], s),
+                            (q = (+h[s >> 3] - p + ((+h[k >> 3] * j + +h[i >> 3]) * j + +h[f >> 3]) * j) * g),
+                            (q >= 0.0) & (q <= 1.0))
+                          : 0
+                      )
+                        eY(j, d, u);
+                      b = (b + 1) | 0;
+                    }
+                    b = c[u >> 2] | 0;
+                  }
+                } else {
+                  dY(+h[a >> 3], +h[(a + 16) >> 3], +h[(a + 32) >> 3], +h[(a + 48) >> 3], s);
+                  h[s >> 3] = +h[s >> 3] - p;
+                  r = BY(s, t) | 0;
+                  if (!(j == 0.0)) {
+                    if ((r | 0) == 4) {
+                      b = 4;
+                      break;
+                    }
+                    m = (a + 8) | 0;
+                    n = (a + 24) | 0;
+                    o = (a + 40) | 0;
+                    e = (a + 56) | 0;
+                    f = (s + 8) | 0;
+                    i = (s + 16) | 0;
+                    k = (s + 24) | 0;
+                    g = 1.0 / j;
+                    b = 0;
+                    while (1) {
+                      if ((b | 0) >= (r | 0)) break;
+                      j = +h[(t + (b << 3)) >> 3];
+                      if (
+                        (j >= 0.0) & (j <= 1.0)
+                          ? (dY(+h[m >> 3], +h[n >> 3], +h[o >> 3], +h[e >> 3], s),
+                            (p = (+h[s >> 3] - q + ((+h[k >> 3] * j + +h[i >> 3]) * j + +h[f >> 3]) * j) * g),
+                            (p >= 0.0) & (p <= 1.0))
+                          : 0
+                      )
+                        eY(j, d, u);
+                      b = (b + 1) | 0;
+                    }
+                    b = c[u >> 2] | 0;
+                    break;
+                  }
+                  dY(+h[(a + 8) >> 3], +h[(a + 24) >> 3], +h[(a + 40) >> 3], +h[(a + 56) >> 3], s);
+                  h[s >> 3] = +h[s >> 3] - q;
+                  i = BY(s, k) | 0;
+                  b = (i | 0) == 4;
+                  b: do
+                    if ((r | 0) == 4) {
+                      if (b) {
+                        b = 4;
+                        break a;
+                      } else b = 0;
+                      while (1) {
+                        if ((b | 0) >= (i | 0)) break b;
+                        eY(+h[(k + (b << 3)) >> 3], d, u);
+                        b = (b + 1) | 0;
+                      }
+                    } else {
+                      if (b) {
+                        b = 0;
+                        while (1) {
+                          if ((b | 0) >= (r | 0)) break b;
+                          eY(+h[(t + (b << 3)) >> 3], d, u);
+                          b = (b + 1) | 0;
+                        }
+                      } else e = 0;
+                      while (1) {
+                        if ((e | 0) >= (r | 0)) break b;
+                        f = (t + (e << 3)) | 0;
+                        b = 0;
+                        while (1) {
+                          if ((b | 0) >= (i | 0)) break;
+                          g = +h[f >> 3];
+                          if (g == +h[(k + (b << 3)) >> 3]) eY(g, d, u);
+                          b = (b + 1) | 0;
+                        }
+                        e = (e + 1) | 0;
+                      }
+                    }
+                  while (0);
+                  b = c[u >> 2] | 0;
+                }
+              while (0);
+              l = v;
+              return b | 0;
+            }
+            function dY(a, b, c, d, e) {
+              a = +a;
+              b = +b;
+              c = +c;
+              d = +d;
+              e = e | 0;
+              h[(e + 24) >> 3] = d - a + (b - c) * 3.0;
+              h[(e + 16) >> 3] = (c + a) * 3.0 - b * 6.0;
+              h[(e + 8) >> 3] = (b - a) * 3.0;
+              h[e >> 3] = a;
+              return;
+            }
+            function eY(a, b, d) {
+              a = +a;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              if ((a >= 0.0) & (a <= 1.0)) {
+                e = c[d >> 2] | 0;
+                h[(b + (e << 3)) >> 3] = a;
+                c[d >> 2] = e + 1;
+              }
+              return;
+            }
+            function fY(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return +(+h[(b + 8) >> 3] * +h[(a + 8) >> 3] + +h[b >> 3] * +h[a >> 3]);
+            }
+            function gY(a) {
+              a = +a;
+              var b = 0.0;
+              b = 1.0 - a;
+              return +(b * b * (b + a * 3.0));
+            }
+            function hY(a) {
+              a = +a;
+              return +(a * a * ((1.0 - a) * 3.0 + a));
+            }
+            function iY(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0.0;
+              H = l;
+              l = (l + 112) | 0;
+              E = (H + 80) | 0;
+              D = (H + 64) | 0;
+              C = (H + 48) | 0;
+              G = 4;
+              F = T1(40) | 0;
+              c[F >> 2] = 0;
+              w = (H + 32) | 0;
+              x = (H + 16) | 0;
+              y = H;
+              A = (H + 96) | 0;
+              G = U6(189856, 1, F | 0, G | 0) | 0;
+              F = z;
+              o = 0;
+              e = o;
+              o = 0;
+              if (((e | 0) != 0) & ((p | 0) != 0)) {
+                f = V6(c[e >> 2] | 0, G | 0, F | 0) | 0;
+                if (!f) bb(e | 0, p | 0);
+                z = p;
+              } else f = -1;
+              if ((f | 0) == 1) e = z;
+              else e = 0;
+              a: while (1) {
+                if (e | 0) {
+                  e = -2;
+                  break;
+                }
+                g = (a + 4) | 0;
+                o = 0;
+                ia(116, c[g >> 2] | 0);
+                e = o;
+                o = 0;
+                if (((e | 0) != 0) & ((p | 0) != 0)) {
+                  f = V6(c[e >> 2] | 0, G | 0, F | 0) | 0;
+                  if (!f) bb(e | 0, p | 0);
+                  z = p;
+                } else f = -1;
+                if ((f | 0) == 1) {
+                  e = z;
+                  continue;
+                }
+                c[47503] = 0;
+                c[47504] = 0;
+                o = 0;
+                ia(117, (c[g >> 2] << 1) | 0);
+                e = o;
+                o = 0;
+                if (((e | 0) != 0) & ((p | 0) != 0)) {
+                  f = V6(c[e >> 2] | 0, G | 0, F | 0) | 0;
+                  if (!f) bb(e | 0, p | 0);
+                  z = p;
+                } else f = -1;
+                if ((f | 0) == 1) {
+                  e = z;
+                  continue;
+                }
+                m = ((c[47506] | 0) / 2) | 0;
+                c[47507] = m;
+                c[47508] = m + -1;
+                m = c[g >> 2] | 0;
+                g = c[a >> 2] | 0;
+                e = 0;
+                f = -1;
+                i = t;
+                while (1) {
+                  if ((e | 0) >= (m | 0)) break;
+                  I = +h[(g + (e << 4)) >> 3];
+                  v = i > I;
+                  u = v ? e : f;
+                  e = (e + 1) | 0;
+                  f = u;
+                  i = v ? I : i;
+                }
+                v = (g + (f << 4)) | 0;
+                c[x >> 2] = c[v >> 2];
+                c[(x + 4) >> 2] = c[(v + 4) >> 2];
+                c[(x + 8) >> 2] = c[(v + 8) >> 2];
+                c[(x + 12) >> 2] = c[(v + 12) >> 2];
+                v = (g + ((((f | 0) == 0 ? m : f) + -1) << 4)) | 0;
+                c[w >> 2] = c[v >> 2];
+                c[(w + 4) >> 2] = c[(v + 4) >> 2];
+                c[(w + 8) >> 2] = c[(v + 8) >> 2];
+                c[(w + 12) >> 2] = c[(v + 12) >> 2];
+                v = (g + (((f | 0) == ((m + -1) | 0) ? 0 : (f + 1) | 0) << 4)) | 0;
+                c[y >> 2] = c[v >> 2];
+                c[(y + 4) >> 2] = c[(v + 4) >> 2];
+                c[(y + 8) >> 2] = c[(v + 8) >> 2];
+                c[(y + 12) >> 2] = c[(v + 12) >> 2];
+                I = +h[x >> 3];
+                if ((+h[w >> 3] == I ? I == +h[y >> 3] : 0) ? +h[(y + 8) >> 3] > +h[(x + 8) >> 3] : 0) v = 15;
+                else v = 12;
+                b: do
+                  if ((v | 0) == 12) {
+                    v = 0;
+                    o = 0;
+                    e = ca(36, w | 0, x | 0, y | 0) | 0;
+                    f = o;
+                    o = 0;
+                    if (((f | 0) != 0) & ((p | 0) != 0)) {
+                      g = V6(c[f >> 2] | 0, G | 0, F | 0) | 0;
+                      if (!g) bb(f | 0, p | 0);
+                      z = p;
+                    } else g = -1;
+                    if ((g | 0) == 1) {
+                      e = z;
+                      continue a;
+                    }
+                    if ((e | 0) == 1) {
+                      g = c[47510] | 0;
+                      e = c[47511] | 0;
+                      f = 0;
+                      while (1) {
+                        if ((f | 0) >= (m | 0)) break b;
+                        j = c[a >> 2] | 0;
+                        if (
+                          !(((f | 0) > 0 ? ((B = (f + -1) | 0), +h[(j + (f << 4)) >> 3] == +h[(j + (B << 4)) >> 3]) : 0)
+                            ? +h[(j + (f << 4) + 8) >> 3] == +h[(j + (B << 4) + 8) >> 3]
+                            : 0)
+                        ) {
+                          u = c[47503] | 0;
+                          c[(g + (u << 3)) >> 2] = j + (f << 4);
+                          c[(g + (u << 3) + 4) >> 2] = g + (((u | 0) % (m | 0) | 0) << 3);
+                          c[(e + (u << 2)) >> 2] = g + (u << 3);
+                          c[47503] = u + 1;
+                        }
+                        f = (f + 1) | 0;
+                      }
+                    } else v = 15;
+                  }
+                while (0);
+                c: do
+                  if ((v | 0) == 15) {
+                    v = 0;
+                    j = c[47510] | 0;
+                    e = c[47511] | 0;
+                    g = m;
+                    while (1) {
+                      f = (g + -1) | 0;
+                      if ((g | 0) <= 0) break c;
+                      k = c[a >> 2] | 0;
+                      if (
+                        ((g | 0) < (m | 0) ? +h[(k + (f << 4)) >> 3] == +h[(k + (g << 4)) >> 3] : 0)
+                          ? +h[(k + (f << 4) + 8) >> 3] == +h[(k + (g << 4) + 8) >> 3]
+                          : 0
+                      ) {
+                        g = f;
+                        continue;
+                      }
+                      g = c[47503] | 0;
+                      c[(j + (g << 3)) >> 2] = k + (f << 4);
+                      c[(j + (g << 3) + 4) >> 2] = j + (((g | 0) % (m | 0) | 0) << 3);
+                      c[(e + (g << 2)) >> 2] = j + (g << 3);
+                      c[47503] = g + 1;
+                      g = f;
+                    }
+                  }
+                while (0);
+                o = 0;
+                ja(29, e | 0, c[47503] | 0);
+                e = o;
+                o = 0;
+                if (((e | 0) != 0) & ((p | 0) != 0)) {
+                  f = V6(c[e >> 2] | 0, G | 0, F | 0) | 0;
+                  if (!f) bb(e | 0, p | 0);
+                  z = p;
+                } else f = -1;
+                if ((f | 0) == 1) {
+                  e = z;
+                  continue;
+                }
+                j = 0;
+                e = c[47504] | 0;
+                d: while (1) {
+                  if ((j | 0) >= (e | 0)) {
+                    s = 0;
+                    break;
+                  }
+                  k = (j + 1) | 0;
+                  g = k;
+                  while (1) {
+                    if ((g | 0) >= (e | 0)) {
+                      j = k;
+                      continue d;
+                    }
+                    o = 0;
+                    ja(30, j | 0, g | 0);
+                    e = o;
+                    o = 0;
+                    if (((e | 0) != 0) & ((p | 0) != 0)) {
+                      f = V6(c[e >> 2] | 0, G | 0, F | 0) | 0;
+                      if (!f) bb(e | 0, p | 0);
+                      z = p;
+                    } else f = -1;
+                    if ((f | 0) == 1) {
+                      e = z;
+                      continue a;
+                    }
+                    g = (g + 1) | 0;
+                    e = c[47504] | 0;
+                  }
+                }
+                while (1) {
+                  if ((s | 0) >= (e | 0)) break;
+                  o = 0;
+                  f = aa(105, s | 0, b | 0) | 0;
+                  g = o;
+                  o = 0;
+                  if (((g | 0) != 0) & ((p | 0) != 0)) {
+                    j = V6(c[g >> 2] | 0, G | 0, F | 0) | 0;
+                    if (!j) bb(g | 0, p | 0);
+                    z = p;
+                  } else j = -1;
+                  if ((j | 0) == 1) {
+                    e = z;
+                    continue a;
+                  }
+                  if (f | 0) break;
+                  s = (s + 1) | 0;
+                }
+                if ((s | 0) == (e | 0)) {
+                  e = c[15712] | 0;
+                  o = 0;
+                  c[C >> 2] = 141858;
+                  c[(C + 4) >> 2] = 192;
+                  c[(C + 8) >> 2] = 141869;
+                  ca(32, e | 0, 141839, C | 0) | 0;
+                  e = o;
+                  o = 0;
+                  if (((e | 0) != 0) & ((p | 0) != 0)) {
+                    f = V6(c[e >> 2] | 0, G | 0, F | 0) | 0;
+                    if (!f) bb(e | 0, p | 0);
+                    z = p;
+                  } else f = -1;
+                  if ((f | 0) == 1) {
+                    e = z;
+                    continue;
+                  } else {
+                    v = 41;
+                    break;
+                  }
+                }
+                u = (b + 16) | 0;
+                k = 0;
+                while (1) {
+                  if ((k | 0) >= (e | 0)) break;
+                  o = 0;
+                  f = aa(105, k | 0, u | 0) | 0;
+                  g = o;
+                  o = 0;
+                  if (((g | 0) != 0) & ((p | 0) != 0)) {
+                    j = V6(c[g >> 2] | 0, G | 0, F | 0) | 0;
+                    if (!j) bb(g | 0, p | 0);
+                    z = p;
+                  } else j = -1;
+                  if ((j | 0) == 1) {
+                    e = z;
+                    continue a;
+                  }
+                  if (f | 0) break;
+                  k = (k + 1) | 0;
+                }
+                if ((k | 0) == (e | 0)) {
+                  e = c[15712] | 0;
+                  o = 0;
+                  c[D >> 2] = 141858;
+                  c[(D + 4) >> 2] = 200;
+                  c[(D + 8) >> 2] = 141902;
+                  ca(32, e | 0, 141839, D | 0) | 0;
+                  e = o;
+                  o = 0;
+                  if (((e | 0) != 0) & ((p | 0) != 0)) {
+                    f = V6(c[e >> 2] | 0, G | 0, F | 0) | 0;
+                    if (!f) bb(e | 0, p | 0);
+                    z = p;
+                  } else f = -1;
+                  if ((f | 0) == 1) {
+                    e = z;
+                    continue;
+                  } else {
+                    v = 48;
+                    break;
+                  }
+                }
+                o = 0;
+                e = aa(106, s | 0, k | 0) | 0;
+                f = o;
+                o = 0;
+                if (((f | 0) != 0) & ((p | 0) != 0)) {
+                  g = V6(c[f >> 2] | 0, G | 0, F | 0) | 0;
+                  if (!g) bb(f | 0, p | 0);
+                  z = p;
+                } else g = -1;
+                if ((g | 0) == 1) {
+                  e = z;
+                  continue;
+                }
+                if (!e) {
+                  e = c[15712] | 0;
+                  o = 0;
+                  c[E >> 2] = 141858;
+                  c[(E + 4) >> 2] = 207;
+                  c[(E + 8) >> 2] = 141940;
+                  ca(32, e | 0, 141839, E | 0) | 0;
+                  e = o;
+                  o = 0;
+                  if (((e | 0) != 0) & ((p | 0) != 0)) {
+                    f = V6(c[e >> 2] | 0, G | 0, F | 0) | 0;
+                    if (!f) bb(e | 0, p | 0);
+                    z = p;
+                  } else f = -1;
+                  if ((f | 0) == 1) {
+                    e = z;
+                    continue;
+                  }
+                  o = 0;
+                  ia(118, 2);
+                  e = o;
+                  o = 0;
+                  if (((e | 0) != 0) & ((p | 0) != 0)) {
+                    f = V6(c[e >> 2] | 0, G | 0, F | 0) | 0;
+                    if (!f) bb(e | 0, p | 0);
+                    z = p;
+                  } else f = -1;
+                  if ((f | 0) == 1) {
+                    e = z;
+                    continue;
+                  } else {
+                    v = 53;
+                    break;
+                  }
+                }
+                if ((s | 0) == (k | 0)) {
+                  o = 0;
+                  ia(118, 2);
+                  e = o;
+                  o = 0;
+                  if (((e | 0) != 0) & ((p | 0) != 0)) {
+                    f = V6(c[e >> 2] | 0, G | 0, F | 0) | 0;
+                    if (!f) bb(e | 0, p | 0);
+                    z = p;
+                  } else f = -1;
+                  if ((f | 0) == 1) {
+                    e = z;
+                    continue;
+                  } else {
+                    v = 56;
+                    break;
+                  }
+                }
+                c[A >> 2] = b;
+                c[(A + 4) >> 2] = 0;
+                f = (A + 8) | 0;
+                c[f >> 2] = u;
+                c[(A + 12) >> 2] = 0;
+                o = 0;
+                ja(31, 1, A | 0);
+                e = o;
+                o = 0;
+                if (((e | 0) != 0) & ((p | 0) != 0)) {
+                  g = V6(c[e >> 2] | 0, G | 0, F | 0) | 0;
+                  if (!g) bb(e | 0, p | 0);
+                  z = p;
+                } else g = -1;
+                if ((g | 0) == 1) {
+                  e = z;
+                  continue;
+                }
+                c[47509] = c[47507];
+                q = s;
+                e: while (1) {
+                  if ((q | 0) == -1) {
+                    g = f;
+                    e = 0;
+                    break;
+                  }
+                  r = c[47513] | 0;
+                  c[(r + ((q * 52) | 0)) >> 2] = 2;
+                  e = 0;
+                  while (1) {
+                    if ((e | 0) >= 3) {
+                      v = 65;
+                      break;
+                    }
+                    v = c[(r + ((q * 52) | 0) + 4 + (e << 4) + 12) >> 2] | 0;
+                    if (v | 0 ? (c[v >> 2] | 0) == 1 : 0) {
+                      v = 68;
+                      break;
+                    }
+                    e = (e + 1) | 0;
+                  }
+                  if ((v | 0) == 65) {
+                    v = 0;
+                    if ((e | 0) == 3) {
+                      e = c[47505] | 0;
+                      k = c[(e + (c[47508] << 2)) >> 2] | 0;
+                      o = 0;
+                      e = ca(36, u | 0, c[c[(e + (c[47507] << 2)) >> 2] >> 2] | 0, c[k >> 2] | 0) | 0;
+                      g = o;
+                      o = 0;
+                      if (((g | 0) != 0) & ((p | 0) != 0)) {
+                        j = V6(c[g >> 2] | 0, G | 0, F | 0) | 0;
+                        if (!j) bb(g | 0, p | 0);
+                        z = p;
+                      } else j = -1;
+                      if ((j | 0) == 1) {
+                        e = z;
+                        continue a;
+                      }
+                      j = (e | 0) == 1;
+                      n = j ? f : k;
+                      j = j ? k : f;
+                    } else v = 68;
+                  }
+                  if ((v | 0) == 68) {
+                    v = 0;
+                    k = c[(r + ((q * 52) | 0) + 4 + (e << 4)) >> 2] | 0;
+                    m = c[(r + ((q * 52) | 0) + 4 + (e << 4) + 4) >> 2] | 0;
+                    o = 0;
+                    e =
+                      ca(
+                        36,
+                        c[k >> 2] | 0,
+                        c[c[(r + ((q * 52) | 0) + 4 + ((((e + 1) | 0) % 3 | 0) << 4) + 4) >> 2] >> 2] | 0,
+                        c[m >> 2] | 0
+                      ) | 0;
+                    g = o;
+                    o = 0;
+                    if (((g | 0) != 0) & ((p | 0) != 0)) {
+                      j = V6(c[g >> 2] | 0, G | 0, F | 0) | 0;
+                      if (!j) bb(g | 0, p | 0);
+                      z = p;
+                    } else j = -1;
+                    if ((j | 0) == 1) {
+                      e = z;
+                      continue a;
+                    }
+                    j = (e | 0) == 1;
+                    n = j ? k : m;
+                    j = j ? m : k;
+                  }
+                  do
+                    if ((q | 0) == (s | 0)) {
+                      o = 0;
+                      ja(31, 2, j | 0);
+                      e = o;
+                      o = 0;
+                      if (((e | 0) != 0) & ((p | 0) != 0)) {
+                        g = V6(c[e >> 2] | 0, G | 0, F | 0) | 0;
+                        if (!g) bb(e | 0, p | 0);
+                        z = p;
+                      } else g = -1;
+                      if ((g | 0) == 1) {
+                        e = z;
+                        continue a;
+                      }
+                      o = 0;
+                      ja(31, 1, n | 0);
+                      e = o;
+                      o = 0;
+                      if (((e | 0) != 0) & ((p | 0) != 0)) {
+                        g = V6(c[e >> 2] | 0, G | 0, F | 0) | 0;
+                        if (!g) bb(e | 0, p | 0);
+                        z = p;
+                      } else g = -1;
+                      if ((g | 0) == 1) {
+                        e = z;
+                        continue a;
+                      }
+                      e = 0;
+                    } else {
+                      m = c[47505] | 0;
+                      if (
+                        (c[(m + (c[47507] << 2)) >> 2] | 0) != (n | 0)
+                          ? (c[(m + (c[47508] << 2)) >> 2] | 0) != (n | 0)
+                          : 0
+                      ) {
+                        o = 0;
+                        j = $(34, n | 0) | 0;
+                        e = o;
+                        o = 0;
+                        if (((e | 0) != 0) & ((p | 0) != 0)) {
+                          g = V6(c[e >> 2] | 0, G | 0, F | 0) | 0;
+                          if (!g) bb(e | 0, p | 0);
+                          z = p;
+                        } else g = -1;
+                        if ((g | 0) == 1) {
+                          e = z;
+                          continue a;
+                        }
+                        o = 0;
+                        ja(32, 2, j | 0);
+                        e = o;
+                        o = 0;
+                        if (((e | 0) != 0) & ((p | 0) != 0)) {
+                          g = V6(c[e >> 2] | 0, G | 0, F | 0) | 0;
+                          if (!g) bb(e | 0, p | 0);
+                          z = p;
+                        } else g = -1;
+                        if ((g | 0) == 1) {
+                          e = z;
+                          continue a;
+                        }
+                        o = 0;
+                        ja(31, 1, n | 0);
+                        e = o;
+                        o = 0;
+                        if (((e | 0) != 0) & ((p | 0) != 0)) {
+                          g = V6(c[e >> 2] | 0, G | 0, F | 0) | 0;
+                          if (!g) bb(e | 0, p | 0);
+                          z = p;
+                        } else g = -1;
+                        if ((g | 0) == 1) {
+                          e = z;
+                          continue a;
+                        }
+                        if ((j | 0) <= (c[47509] | 0)) {
+                          e = 0;
+                          break;
+                        }
+                        c[47509] = j;
+                        e = 0;
+                        break;
+                      }
+                      o = 0;
+                      k = $(34, j | 0) | 0;
+                      e = o;
+                      o = 0;
+                      if (((e | 0) != 0) & ((p | 0) != 0)) {
+                        g = V6(c[e >> 2] | 0, G | 0, F | 0) | 0;
+                        if (!g) bb(e | 0, p | 0);
+                        z = p;
+                      } else g = -1;
+                      if ((g | 0) == 1) {
+                        e = z;
+                        continue a;
+                      }
+                      o = 0;
+                      ja(32, 1, k | 0);
+                      e = o;
+                      o = 0;
+                      if (((e | 0) != 0) & ((p | 0) != 0)) {
+                        g = V6(c[e >> 2] | 0, G | 0, F | 0) | 0;
+                        if (!g) bb(e | 0, p | 0);
+                        z = p;
+                      } else g = -1;
+                      if ((g | 0) == 1) {
+                        e = z;
+                        continue a;
+                      }
+                      o = 0;
+                      ja(31, 2, j | 0);
+                      e = o;
+                      o = 0;
+                      if (((e | 0) != 0) & ((p | 0) != 0)) {
+                        g = V6(c[e >> 2] | 0, G | 0, F | 0) | 0;
+                        if (!g) bb(e | 0, p | 0);
+                        z = p;
+                      } else g = -1;
+                      if ((g | 0) == 1) {
+                        e = z;
+                        continue a;
+                      }
+                      if ((k | 0) >= (c[47509] | 0)) {
+                        e = 0;
+                        break;
+                      }
+                      c[47509] = k;
+                      e = 0;
+                    }
+                  while (0);
+                  while (1) {
+                    if ((e | 0) >= 3) {
+                      q = -1;
+                      continue e;
+                    }
+                    g = c[(r + ((q * 52) | 0) + 4 + (e << 4) + 12) >> 2] | 0;
+                    if (g | 0 ? (c[g >> 2] | 0) == 1 : 0) break;
+                    e = (e + 1) | 0;
+                  }
+                  q = (((g - (c[47513] | 0)) | 0) / 52) | 0;
+                }
+                while (1) {
+                  if (!g) break;
+                  g = c[(g + 4) >> 2] | 0;
+                  e = (e + 1) | 0;
+                }
+                o = 0;
+                ia(118, e | 0);
+                g = o;
+                o = 0;
+                if (((g | 0) != 0) & ((p | 0) != 0)) {
+                  j = V6(c[g >> 2] | 0, G | 0, F | 0) | 0;
+                  if (!j) bb(g | 0, p | 0);
+                  z = p;
+                } else j = -1;
+                if ((j | 0) == 1) e = z;
+                else {
+                  v = 94;
+                  break;
+                }
+              }
+              if ((v | 0) == 41) e = -1;
+              else if ((v | 0) == 48) e = -1;
+              else if ((v | 0) == 53) {
+                c[(d + 4) >> 2] = 2;
+                e = c[47512] | 0;
+                c[e >> 2] = c[b >> 2];
+                c[(e + 4) >> 2] = c[(b + 4) >> 2];
+                c[(e + 8) >> 2] = c[(b + 8) >> 2];
+                c[(e + 12) >> 2] = c[(b + 12) >> 2];
+                F = (e + 16) | 0;
+                c[F >> 2] = c[u >> 2];
+                c[(F + 4) >> 2] = c[(u + 4) >> 2];
+                c[(F + 8) >> 2] = c[(u + 8) >> 2];
+                c[(F + 12) >> 2] = c[(u + 12) >> 2];
+                c[d >> 2] = e;
+                e = 0;
+              } else if ((v | 0) == 56) {
+                c[(d + 4) >> 2] = 2;
+                e = c[47512] | 0;
+                c[e >> 2] = c[b >> 2];
+                c[(e + 4) >> 2] = c[(b + 4) >> 2];
+                c[(e + 8) >> 2] = c[(b + 8) >> 2];
+                c[(e + 12) >> 2] = c[(b + 12) >> 2];
+                F = (e + 16) | 0;
+                c[F >> 2] = c[u >> 2];
+                c[(F + 4) >> 2] = c[(u + 4) >> 2];
+                c[(F + 8) >> 2] = c[(u + 8) >> 2];
+                c[(F + 12) >> 2] = c[(u + 12) >> 2];
+                c[d >> 2] = e;
+                e = 0;
+              } else if ((v | 0) == 94) {
+                c[(d + 4) >> 2] = e;
+                g = c[47512] | 0;
+                while (1) {
+                  e = (e + -1) | 0;
+                  if (!f) break;
+                  F = (g + (e << 4)) | 0;
+                  E = c[f >> 2] | 0;
+                  c[F >> 2] = c[E >> 2];
+                  c[(F + 4) >> 2] = c[(E + 4) >> 2];
+                  c[(F + 8) >> 2] = c[(E + 8) >> 2];
+                  c[(F + 12) >> 2] = c[(E + 12) >> 2];
+                  f = c[(f + 4) >> 2] | 0;
+                }
+                c[d >> 2] = g;
+                e = 0;
+              }
+              U1(G | 0);
+              l = H;
+              return e | 0;
+            }
+            function jY(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 64) | 0;
+              e = (h + 48) | 0;
+              g = (h + 32) | 0;
+              f = (h + 16) | 0;
+              d = h;
+              if ((c[47516] | 0) < (a | 0)) {
+                b = c[47510] | 0;
+                if (!b) {
+                  g = T1(a << 3) | 0;
+                  c[47510] = g;
+                  if (!g) {
+                    g = c[15712] | 0;
+                    c[d >> 2] = 141858;
+                    c[(d + 4) >> 2] = 523;
+                    c[(d + 8) >> 2] = 142108;
+                    w4(g, 141839, d) | 0;
+                    bb(189856, 1);
+                  }
+                  g = T1(a << 2) | 0;
+                  c[47511] = g;
+                  if (!g) {
+                    g = c[15712] | 0;
+                    c[f >> 2] = 141858;
+                    c[(f + 4) >> 2] = 527;
+                    c[(f + 8) >> 2] = 142127;
+                    w4(g, 141839, f) | 0;
+                    bb(189856, 1);
+                  }
+                } else {
+                  f = W1(b, a << 3) | 0;
+                  c[47510] = f;
+                  if (!f) {
+                    f = c[15712] | 0;
+                    c[g >> 2] = 141858;
+                    c[(g + 4) >> 2] = 533;
+                    c[(g + 8) >> 2] = 142147;
+                    w4(f, 141839, g) | 0;
+                    bb(189856, 1);
+                  }
+                  g = W1(c[47511] | 0, a << 2) | 0;
+                  c[47511] = g;
+                  if (!g) {
+                    g = c[15712] | 0;
+                    c[e >> 2] = 141858;
+                    c[(e + 4) >> 2] = 539;
+                    c[(e + 8) >> 2] = 142167;
+                    w4(g, 141839, e) | 0;
+                    bb(189856, 1);
+                  }
+                }
+                c[47516] = a;
+              }
+              l = h;
+              return;
+            }
+            function kY(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              f = l;
+              l = (l + 32) | 0;
+              e = (f + 16) | 0;
+              d = f;
+              if ((c[47506] | 0) < (a | 0)) {
+                b = c[47505] | 0;
+                if (!b) {
+                  e = T1(a << 2) | 0;
+                  c[47505] = e;
+                  if (!e) {
+                    e = c[15712] | 0;
+                    c[d >> 2] = 141858;
+                    c[(d + 4) >> 2] = 573;
+                    c[(d + 8) >> 2] = 142063;
+                    w4(e, 141839, d) | 0;
+                    bb(189856, 1);
+                  }
+                } else {
+                  d = W1(b, a << 2) | 0;
+                  c[47505] = d;
+                  if (!d) {
+                    d = c[15712] | 0;
+                    c[e >> 2] = 141858;
+                    c[(e + 4) >> 2] = 580;
+                    c[(e + 8) >> 2] = 142085;
+                    w4(d, 141839, e) | 0;
+                    bb(189856, 1);
+                  }
+                }
+                c[47506] = a;
+              }
+              l = f;
+              return;
+            }
+            function lY(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0,
+                e = 0.0;
+              d = +h[(b + 8) >> 3];
+              e = +h[b >> 3];
+              d = (+h[c >> 3] - e) * (+h[(a + 8) >> 3] - d) - (+h[a >> 3] - e) * (+h[(c + 8) >> 3] - d);
+              return (d > 0.0 ? 1 : d < 0.0 ? 2 : 3) | 0;
+            }
+            function mY(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 16) | 0;
+              h = i;
+              a: while (1) {
+                if ((b | 0) > 3) e = 0;
+                else {
+                  b = 9;
+                  break;
+                }
+                while (1) {
+                  if ((e | 0) >= (b | 0)) {
+                    b = 8;
+                    break a;
+                  }
+                  f = (e + 1) | 0;
+                  d = (f | 0) % (b | 0) | 0;
+                  g = ((e + 2) | 0) % (b | 0) | 0;
+                  if (!(uY(e, g, a, b) | 0)) e = f;
+                  else break;
+                }
+                vY(c[(a + (e << 2)) >> 2] | 0, c[(a + (d << 2)) >> 2] | 0, c[(a + (g << 2)) >> 2] | 0);
+                b = (b + -1) | 0;
+                while (1) {
+                  if ((d | 0) >= (b | 0)) continue a;
+                  g = (d + 1) | 0;
+                  c[(a + (d << 2)) >> 2] = c[(a + (g << 2)) >> 2];
+                  d = g;
+                }
+              }
+              if ((b | 0) == 8) {
+                a = c[15712] | 0;
+                c[h >> 2] = 141858;
+                c[(h + 4) >> 2] = 324;
+                c[(h + 8) >> 2] = 142003;
+                w4(a, 141839, h) | 0;
+              } else if ((b | 0) == 9) vY(c[a >> 2] | 0, c[(a + 4) >> 2] | 0, c[(a + 8) >> 2] | 0);
+              l = i;
+              return;
+            }
+            function nY(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              i = c[47513] | 0;
+              j = (i + ((a * 52) | 0)) | 0;
+              k = (i + ((b * 52) | 0)) | 0;
+              g = 0;
+              while (1) {
+                if ((g | 0) == 3) break;
+                l = (i + ((a * 52) | 0) + 4 + (g << 4)) | 0;
+                m = (i + ((a * 52) | 0) + 4 + (g << 4) + 4) | 0;
+                n = (i + ((a * 52) | 0) + 4 + (g << 4) + 12) | 0;
+                f = 0;
+                while (1) {
+                  if ((f | 0) == 3) break;
+                  o = c[c[l >> 2] >> 2] | 0;
+                  h = c[c[(i + ((b * 52) | 0) + 4 + (f << 4)) >> 2] >> 2] | 0;
+                  if ((o | 0) == (h | 0)) {
+                    d = c[c[(i + ((b * 52) | 0) + 4 + (f << 4) + 4) >> 2] >> 2] | 0;
+                    if ((c[c[m >> 2] >> 2] | 0) == (d | 0)) e = 10;
+                    else e = 8;
+                  } else {
+                    d = c[c[(i + ((b * 52) | 0) + 4 + (f << 4) + 4) >> 2] >> 2] | 0;
+                    e = 8;
+                  }
+                  if (((e | 0) == 8 ? ((e = 0), (o | 0) == (d | 0)) : 0) ? (c[c[m >> 2] >> 2] | 0) == (h | 0) : 0)
+                    e = 10;
+                  if ((e | 0) == 10) {
+                    c[n >> 2] = k;
+                    c[(i + ((b * 52) | 0) + 4 + (f << 4) + 12) >> 2] = j;
+                  }
+                  f = (f + 1) | 0;
+                }
+                g = (g + 1) | 0;
+              }
+              return;
+            }
+            function oY(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              f = c[47513] | 0;
+              d = 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) == 3) break;
+                d =
+                  (d +
+                    (((lY(
+                      c[c[(f + ((a * 52) | 0) + 4 + (e << 4)) >> 2] >> 2] | 0,
+                      c[c[(f + ((a * 52) | 0) + 4 + (e << 4) + 4) >> 2] >> 2] | 0,
+                      b
+                    ) |
+                      0) !=
+                      2) &
+                      1)) |
+                  0;
+                e = (e + 1) | 0;
+              }
+              return ((((d | 0) == 3) | ((d | 0) == 0)) & 1) | 0;
+            }
+            function pY(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              d = c[47513] | 0;
+              e = (d + ((a * 52) | 0)) | 0;
+              a: do
+                if (!(c[e >> 2] | 0)) {
+                  c[e >> 2] = 1;
+                  if ((a | 0) == (b | 0)) d = 1;
+                  else {
+                    f = 0;
+                    while (1) {
+                      if ((f | 0) >= 3) break;
+                      e = c[(d + ((a * 52) | 0) + 4 + (f << 4) + 12) >> 2] | 0;
+                      if (e) {
+                        if (pY((((e - d) | 0) / 52) | 0, b) | 0) {
+                          d = 1;
+                          break a;
+                        }
+                        d = c[47513] | 0;
+                      }
+                      f = (f + 1) | 0;
+                    }
+                    c[(d + ((a * 52) | 0)) >> 2] = 0;
+                    d = 0;
+                  }
+                } else d = 0;
+              while (0);
+              return d | 0;
+            }
+            function qY(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              f = l;
+              l = (l + 32) | 0;
+              e = (f + 16) | 0;
+              d = f;
+              if ((c[47514] | 0) < (a | 0)) {
+                b = c[47512] | 0;
+                if (!b) {
+                  e = T1(a << 4) | 0;
+                  c[47512] = e;
+                  if (!e) {
+                    e = c[15712] | 0;
+                    c[d >> 2] = 141858;
+                    c[(d + 4) >> 2] = 593;
+                    c[(d + 8) >> 2] = 141966;
+                    w4(e, 141839, d) | 0;
+                    bb(189856, 1);
+                  }
+                } else {
+                  d = W1(b, a << 4) | 0;
+                  c[47512] = d;
+                  if (!d) {
+                    d = c[15712] | 0;
+                    c[e >> 2] = 141858;
+                    c[(e + 4) >> 2] = 599;
+                    c[(e + 8) >> 2] = 141984;
+                    w4(d, 141839, e) | 0;
+                    bb(189856, 1);
+                  }
+                }
+                c[47514] = a;
+              }
+              l = f;
+              return;
+            }
+            function rY(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              d = c[47508] | 0;
+              e = c[47507] | 0;
+              f = (d | 0) >= (e | 0);
+              if ((a | 0) == 1)
+                if (f) {
+                  c[(b + 4) >> 2] = c[((c[47505] | 0) + (e << 2)) >> 2];
+                  a = 190028;
+                  d = -1;
+                } else {
+                  a = 190028;
+                  d = -1;
+                }
+              else if (f) {
+                c[(b + 4) >> 2] = c[((c[47505] | 0) + (d << 2)) >> 2];
+                a = 190032;
+                d = 1;
+              } else {
+                a = 190032;
+                d = 1;
+              }
+              f = ((c[a >> 2] | 0) + d) | 0;
+              c[a >> 2] = f;
+              c[((c[47505] | 0) + (f << 2)) >> 2] = b;
+              return;
+            }
+            function sY(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              f = c[47509] | 0;
+              g = c[47505] | 0;
+              b = c[47507] | 0;
+              while (1) {
+                if ((b | 0) >= (f | 0)) {
+                  e = 4;
+                  break;
+                }
+                d = (b + 1) | 0;
+                if (
+                  (lY(c[c[(g + (d << 2)) >> 2] >> 2] | 0, c[c[(g + (b << 2)) >> 2] >> 2] | 0, c[a >> 2] | 0) | 0) ==
+                  1
+                )
+                  break;
+                else b = d;
+              }
+              a: do
+                if ((e | 0) == 4) {
+                  b = c[47508] | 0;
+                  while (1) {
+                    if ((b | 0) <= (f | 0)) {
+                      b = f;
+                      break a;
+                    }
+                    d = (b + -1) | 0;
+                    if (
+                      (lY(c[c[(g + (d << 2)) >> 2] >> 2] | 0, c[c[(g + (b << 2)) >> 2] >> 2] | 0, c[a >> 2] | 0) | 0) ==
+                      2
+                    )
+                      break;
+                    else b = d;
+                  }
+                }
+              while (0);
+              return b | 0;
+            }
+            function tY(a, b) {
+              a = a | 0;
+              b = b | 0;
+              c[((a | 0) == 1 ? 190032 : 190028) >> 2] = b;
+              return;
+            }
+            function uY(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              f = c[c[(d + ((((a + -1 + e) | 0) % (e | 0) | 0) << 2)) >> 2] >> 2] | 0;
+              i = c[c[(d + (a << 2)) >> 2] >> 2] | 0;
+              g = c[c[(d + ((((a + 1) | 0) % (e | 0) | 0) << 2)) >> 2] >> 2] | 0;
+              k = (lY(f, i, g) | 0) == 1;
+              j = c[c[(d + (b << 2)) >> 2] >> 2] | 0;
+              if (k)
+                if ((lY(i, j, f) | 0) == 1) {
+                  f = lY(j, i, g) | 0;
+                  g = 1;
+                  h = 5;
+                } else f = 0;
+              else {
+                f = lY(i, j, g) | 0;
+                g = 2;
+                h = 5;
+              }
+              a: do
+                if ((h | 0) == 5)
+                  if ((f | 0) == (g | 0)) {
+                    f = 0;
+                    while (1) {
+                      if ((f | 0) >= (e | 0)) {
+                        f = 1;
+                        break a;
+                      }
+                      g = f;
+                      f = (f + 1) | 0;
+                      h = (f | 0) % (e | 0) | 0;
+                      if (((h | 0) == (b | 0)) | (((g | 0) == (b | 0)) | (((g | 0) == (a | 0)) | ((h | 0) == (a | 0)))))
+                        continue;
+                      if (xY(i, j, c[c[(d + (g << 2)) >> 2] >> 2] | 0, c[c[(d + (h << 2)) >> 2] >> 2] | 0) | 0) {
+                        f = 0;
+                        break;
+                      }
+                    }
+                  } else f = 0;
+              while (0);
+              return f | 0;
+            }
+            function vY(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              e = c[47504] | 0;
+              f = c[47515] | 0;
+              if ((e | 0) < (f | 0)) h = e;
+              else {
+                wY((f + 20) | 0);
+                h = c[47504] | 0;
+              }
+              g = c[47513] | 0;
+              c[47504] = h + 1;
+              f = (g + ((h * 52) | 0)) | 0;
+              c[f >> 2] = 0;
+              c[(g + ((h * 52) | 0) + 4) >> 2] = a;
+              c[(g + ((h * 52) | 0) + 8) >> 2] = b;
+              c[(g + ((h * 52) | 0) + 16) >> 2] = 0;
+              c[(g + ((h * 52) | 0) + 20) >> 2] = b;
+              c[(g + ((h * 52) | 0) + 24) >> 2] = d;
+              c[(g + ((h * 52) | 0) + 32) >> 2] = 0;
+              c[(g + ((h * 52) | 0) + 36) >> 2] = d;
+              c[(g + ((h * 52) | 0) + 40) >> 2] = a;
+              c[(g + ((h * 52) | 0) + 48) >> 2] = 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) == 3) break;
+                c[(g + ((h * 52) | 0) + 4 + (e << 4) + 8) >> 2] = f;
+                e = (e + 1) | 0;
+              }
+              return;
+            }
+            function wY(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              f = l;
+              l = (l + 32) | 0;
+              e = (f + 16) | 0;
+              d = f;
+              if ((c[47515] | 0) < (a | 0)) {
+                b = c[47513] | 0;
+                if (!b) {
+                  e = T1((a * 52) | 0) | 0;
+                  c[47513] = e;
+                  if (!e) {
+                    e = c[15712] | 0;
+                    c[d >> 2] = 141858;
+                    c[(d + 4) >> 2] = 552;
+                    c[(d + 8) >> 2] = 142024;
+                    w4(e, 141839, d) | 0;
+                    bb(189856, 1);
+                  }
+                } else {
+                  d = W1(b, (a * 52) | 0) | 0;
+                  c[47513] = d;
+                  if (!d) {
+                    d = c[15712] | 0;
+                    c[e >> 2] = 141858;
+                    c[(e + 4) >> 2] = 558;
+                    c[(e + 8) >> 2] = 142043;
+                    w4(d, 141839, e) | 0;
+                    bb(189856, 1);
+                  }
+                }
+                c[47515] = a;
+              }
+              l = f;
+              return;
+            }
+            function xY(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              f = lY(a, b, c) | 0;
+              if (
+                (((f | 0) != 3 ? ((g = lY(a, b, d) | 0), (g | 0) != 3) : 0) ? ((h = lY(c, d, a) | 0), (h | 0) != 3) : 0)
+                  ? ((e = lY(c, d, b) | 0), (e | 0) != 3)
+                  : 0
+              )
+                return ((((f | 0) == 1) ^ ((g | 0) == 1)) & (((h | 0) == 1) ^ ((e | 0) == 1)) & 1) | 0;
+              if (((yY(a, b, c) | 0) == 0 ? (yY(a, b, d) | 0) == 0 : 0) ? (yY(c, d, a) | 0) == 0 : 0)
+                return ((yY(c, d, b) | 0) != 0) | 0;
+              return 1;
+            }
+            function yY(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0.0,
+                g = 0.0;
+              e = +h[a >> 3];
+              g = +h[b >> 3] - e;
+              f = +h[(a + 8) >> 3];
+              d = +h[(b + 8) >> 3] - f;
+              e = +h[c >> 3] - e;
+              f = +h[(c + 8) >> 3] - f;
+              if ((lY(a, b, c) | 0) == 3 ? f * d + e * g >= 0.0 : 0) a = (f * f + e * e <= d * d + g * g) & 1;
+              else a = 0;
+              return a | 0;
+            }
+            function zY(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0.0,
+                i = 0,
+                j = 0.0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0.0,
+                q = 0;
+              m = T1(d << 2) | 0;
+              n = T1(((d << 3) + 8) | 0) | 0;
+              o = (n + 8) | 0;
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (d | 0)) break;
+                c[(m + (f << 2)) >> 2] = -1;
+                h[(o + (f << 3)) >> 3] = -2147483647.0;
+                f = (f + 1) | 0;
+              }
+              h[n >> 3] = -2147483648.0;
+              a: while (1) {
+                if ((a | 0) == (b | 0)) break;
+                l = (o + (a << 3)) | 0;
+                j = +h[l >> 3];
+                h[l >> 3] = j == -2147483647.0 ? 0.0 : -j;
+                k = 0;
+                f = -1;
+                while (1) {
+                  if ((k | 0) >= (d | 0)) {
+                    a = f;
+                    continue a;
+                  }
+                  i = (o + (k << 3)) | 0;
+                  g = +h[i >> 3];
+                  if (g < 0.0) {
+                    q = (a | 0) < (k | 0);
+                    p = +h[((c[(e + ((q ? k : a) << 2)) >> 2] | 0) + ((q ? a : k) << 3)) >> 3];
+                    j = -(p + +h[l >> 3]);
+                    if ((p != 0.0) & (g < j)) {
+                      h[i >> 3] = j;
+                      c[(m + (k << 2)) >> 2] = a;
+                      g = j;
+                    }
+                    f = g > +h[(o + (f << 3)) >> 3] ? k : f;
+                  }
+                  k = (k + 1) | 0;
+                }
+              }
+              U1(n);
+              return m | 0;
+            }
+            function AY(a, b, d, e, f, g, h) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              j = l;
+              l = (l + 32) | 0;
+              k = (j + 16) | 0;
+              m = j;
+              i = c[(h + 4) >> 2] | 0;
+              c[m >> 2] = c[a >> 2];
+              c[(m + 4) >> 2] = c[(a + 4) >> 2];
+              c[(m + 8) >> 2] = c[(a + 8) >> 2];
+              c[(m + 12) >> 2] = c[(a + 12) >> 2];
+              c[k >> 2] = c[e >> 2];
+              c[(k + 4) >> 2] = c[(e + 4) >> 2];
+              c[(k + 8) >> 2] = c[(e + 8) >> 2];
+              c[(k + 12) >> 2] = c[(e + 12) >> 2];
+              if (!(TY(m, b, k, f, h) | 0)) {
+                a = c[(h + 24) >> 2] | 0;
+                c[(a + (i << 2)) >> 2] = g;
+                m = (i + 1) | 0;
+                c[(a + (m << 2)) >> 2] = d;
+                a = zY(m, i, (i + 2) | 0, a) | 0;
+              } else {
+                a = T1(((i << 2) + 8) | 0) | 0;
+                m = (i + 1) | 0;
+                c[(a + (i << 2)) >> 2] = m;
+                c[(a + (m << 2)) >> 2] = -1;
+              }
+              l = j;
+              return a | 0;
+            }
+            function BY(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0,
+                d = 0.0,
+                e = 0.0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0;
+              d = +h[(a + 24) >> 3];
+              a: do
+                if ((d < 1.0e-7) & (d > -1.0e-7)) a = CY(a, b) | 0;
+                else {
+                  g = +h[(a + 16) >> 3] / (d * 3.0);
+                  f = +h[(a + 8) >> 3] / d;
+                  e = g * g;
+                  d = g * 2.0 * e - g * f + +h[a >> 3] / d;
+                  e = f * 0.3333333333333333 - e;
+                  e = e * e * 4.0 * e;
+                  f = d * d + e;
+                  if (!(f < 0.0)) {
+                    i = (+C(+f) - d) * 0.5;
+                    e = +E2(i);
+                    d = +E2(-d - i) + e;
+                    h[b >> 3] = d;
+                    if (f > 0.0) a = 1;
+                    else {
+                      d = d * -0.5;
+                      h[(b + 16) >> 3] = d;
+                      a = 1;
+                      c = 7;
+                    }
+                  } else {
+                    i = +K(+(+C(+-f)), +-d);
+                    d = +E2(+C(+-e) * 0.5) * 2.0;
+                    h[b >> 3] = d * +E(+(i * 0.3333333333333333));
+                    h[(b + 8) >> 3] = +E(+((i + 6.283185307179586) * 0.3333333333333333)) * d;
+                    d = +E(+((i + -6.283185307179586) * 0.3333333333333333)) * d;
+                    a = 2;
+                    c = 7;
+                  }
+                  if ((c | 0) == 7) {
+                    h[(b + (a << 3)) >> 3] = d;
+                    a = 3;
+                  }
+                  c = 0;
+                  while (1) {
+                    if ((c | 0) >= (a | 0)) break a;
+                    j = (b + (c << 3)) | 0;
+                    h[j >> 3] = +h[j >> 3] - g;
+                    c = (c + 1) | 0;
+                  }
+                }
+              while (0);
+              return a | 0;
+            }
+            function CY(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0,
+                d = 0.0;
+              c = +h[(a + 16) >> 3];
+              do
+                if (!((c < 1.0e-7) & (c > -1.0e-7))) {
+                  d = +h[(a + 8) >> 3] / (c * 2.0);
+                  c = d * d - +h[a >> 3] / c;
+                  if (!(c < 0.0))
+                    if (c == 0.0) {
+                      h[b >> 3] = -d;
+                      a = 1;
+                      break;
+                    } else {
+                      c = +C(+c) - d;
+                      h[b >> 3] = c;
+                      h[(b + 8) >> 3] = d * -2.0 - c;
+                      a = 2;
+                      break;
+                    }
+                  else a = 0;
+                } else a = DY(a, b) | 0;
+              while (0);
+              return a | 0;
+            }
+            function DY(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0,
+                d = 0.0;
+              d = +h[(a + 8) >> 3];
+              c = +h[a >> 3];
+              if ((d < 1.0e-7) & (d > -1.0e-7)) a = (c < 1.0e-7) & (c > -1.0e-7) ? 4 : 0;
+              else {
+                h[b >> 3] = -c / d;
+                a = 1;
+              }
+              return a | 0;
+            }
+            function EY(a) {
+              a = a | 0;
+              U1(c[a >> 2] | 0);
+              U1(a);
+              return;
+            }
+            function FY(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              e = c[(a + 4) >> 2] | 0;
+              i = (((e * 3) | 0) + -2) | 0;
+              d = c[47518] | 0;
+              if ((i | 0) > (c[47517] | 0)) {
+                if (!d) d = T1(i << 4) | 0;
+                else d = W1(d, i << 4) | 0;
+                c[47518] = d;
+                c[47517] = i;
+                h = d;
+                g = d;
+              } else {
+                h = d;
+                g = d;
+              }
+              f = c[a >> 2] | 0;
+              c[h >> 2] = c[f >> 2];
+              c[(h + 4) >> 2] = c[(f + 4) >> 2];
+              c[(h + 8) >> 2] = c[(f + 8) >> 2];
+              c[(h + 12) >> 2] = c[(f + 12) >> 2];
+              X6((h + 16) | 0, f | 0, 16) | 0;
+              e = (e + -1) | 0;
+              d = 1;
+              a = 2;
+              while (1) {
+                if ((d | 0) >= (e | 0)) break;
+                j = (h + ((a + 2) << 4)) | 0;
+                k = (h + ((a + 1) << 4)) | 0;
+                m = (h + (a << 4)) | 0;
+                l = (f + (d << 4)) | 0;
+                c[m >> 2] = c[l >> 2];
+                c[(m + 4) >> 2] = c[(l + 4) >> 2];
+                c[(m + 8) >> 2] = c[(l + 8) >> 2];
+                c[(m + 12) >> 2] = c[(l + 12) >> 2];
+                X6(k | 0, l | 0, 16) | 0;
+                c[j >> 2] = c[k >> 2];
+                c[(j + 4) >> 2] = c[(k + 4) >> 2];
+                c[(j + 8) >> 2] = c[(k + 8) >> 2];
+                c[(j + 12) >> 2] = c[(k + 12) >> 2];
+                d = (d + 1) | 0;
+                a = (a + 3) | 0;
+              }
+              l = (h + (a << 4)) | 0;
+              m = (f + (d << 4)) | 0;
+              c[l >> 2] = c[m >> 2];
+              c[(l + 4) >> 2] = c[(m + 4) >> 2];
+              c[(l + 8) >> 2] = c[(m + 8) >> 2];
+              c[(l + 12) >> 2] = c[(m + 12) >> 2];
+              X6((h + ((a + 1) << 4)) | 0, m | 0, 16) | 0;
+              c[(b + 4) >> 2] = i;
+              c[b >> 2] = g;
+              return;
+            }
+            function GY(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0,
+                e = 0.0;
+              d = +h[(b + 8) >> 3];
+              e = +h[b >> 3];
+              d = (+h[c >> 3] - e) * (+h[(a + 8) >> 3] - d) - (+h[a >> 3] - e) * (+h[(c + 8) >> 3] - d);
+              return (d > 0.0001 ? 1 : ((d < -0.0001) << 31) >> 31) | 0;
+            }
+            function HY(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0.0;
+              e = +h[a >> 3];
+              f = +h[b >> 3];
+              if (e != f) {
+                d = +h[c >> 3];
+                if (!((e < d) & (d < f)))
+                  if (f < d) a = d < e;
+                  else a = 0;
+                else a = 1;
+              } else {
+                f = +h[(a + 8) >> 3];
+                e = +h[(c + 8) >> 3];
+                d = +h[(b + 8) >> 3];
+                if (!((f < e) & (e < d)))
+                  if (d < e) a = e < f;
+                  else a = 0;
+                else a = 1;
+              }
+              return (a & 1) | 0;
+            }
+            function IY(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              m = l;
+              l = (l + 48) | 0;
+              i = (m + 32) | 0;
+              h = (m + 16) | 0;
+              g = m;
+              c[g >> 2] = c[a >> 2];
+              c[(g + 4) >> 2] = c[(a + 4) >> 2];
+              c[(g + 8) >> 2] = c[(a + 8) >> 2];
+              c[(g + 12) >> 2] = c[(a + 12) >> 2];
+              c[h >> 2] = c[b >> 2];
+              c[(h + 4) >> 2] = c[(b + 4) >> 2];
+              c[(h + 8) >> 2] = c[(b + 8) >> 2];
+              c[(h + 12) >> 2] = c[(b + 12) >> 2];
+              c[i >> 2] = c[d >> 2];
+              c[(i + 4) >> 2] = c[(d + 4) >> 2];
+              c[(i + 8) >> 2] = c[(d + 8) >> 2];
+              c[(i + 12) >> 2] = c[(d + 12) >> 2];
+              j = GY(g, h, i) | 0;
+              if (
+                (j | 0) == 0
+                  ? ((c[g >> 2] = c[a >> 2]),
+                    (c[(g + 4) >> 2] = c[(a + 4) >> 2]),
+                    (c[(g + 8) >> 2] = c[(a + 8) >> 2]),
+                    (c[(g + 12) >> 2] = c[(a + 12) >> 2]),
+                    (c[h >> 2] = c[b >> 2]),
+                    (c[(h + 4) >> 2] = c[(b + 4) >> 2]),
+                    (c[(h + 8) >> 2] = c[(b + 8) >> 2]),
+                    (c[(h + 12) >> 2] = c[(b + 12) >> 2]),
+                    (c[i >> 2] = c[d >> 2]),
+                    (c[(i + 4) >> 2] = c[(d + 4) >> 2]),
+                    (c[(i + 8) >> 2] = c[(d + 8) >> 2]),
+                    (c[(i + 12) >> 2] = c[(d + 12) >> 2]),
+                    (HY(g, h, i) | 0) != 0)
+                  : 0
+              )
+                f = 1;
+              else k = 3;
+              do
+                if ((k | 0) == 3) {
+                  c[g >> 2] = c[a >> 2];
+                  c[(g + 4) >> 2] = c[(a + 4) >> 2];
+                  c[(g + 8) >> 2] = c[(a + 8) >> 2];
+                  c[(g + 12) >> 2] = c[(a + 12) >> 2];
+                  c[h >> 2] = c[b >> 2];
+                  c[(h + 4) >> 2] = c[(b + 4) >> 2];
+                  c[(h + 8) >> 2] = c[(b + 8) >> 2];
+                  c[(h + 12) >> 2] = c[(b + 12) >> 2];
+                  c[i >> 2] = c[e >> 2];
+                  c[(i + 4) >> 2] = c[(e + 4) >> 2];
+                  c[(i + 8) >> 2] = c[(e + 8) >> 2];
+                  c[(i + 12) >> 2] = c[(e + 12) >> 2];
+                  f = GY(g, h, i) | 0;
+                  if (
+                    (f | 0) == 0
+                      ? ((c[g >> 2] = c[a >> 2]),
+                        (c[(g + 4) >> 2] = c[(a + 4) >> 2]),
+                        (c[(g + 8) >> 2] = c[(a + 8) >> 2]),
+                        (c[(g + 12) >> 2] = c[(a + 12) >> 2]),
+                        (c[h >> 2] = c[b >> 2]),
+                        (c[(h + 4) >> 2] = c[(b + 4) >> 2]),
+                        (c[(h + 8) >> 2] = c[(b + 8) >> 2]),
+                        (c[(h + 12) >> 2] = c[(b + 12) >> 2]),
+                        (c[i >> 2] = c[e >> 2]),
+                        (c[(i + 4) >> 2] = c[(e + 4) >> 2]),
+                        (c[(i + 8) >> 2] = c[(e + 8) >> 2]),
+                        (c[(i + 12) >> 2] = c[(e + 12) >> 2]),
+                        HY(g, h, i) | 0)
+                      : 0
+                  ) {
+                    f = 1;
+                    break;
+                  }
+                  c[g >> 2] = c[d >> 2];
+                  c[(g + 4) >> 2] = c[(d + 4) >> 2];
+                  c[(g + 8) >> 2] = c[(d + 8) >> 2];
+                  c[(g + 12) >> 2] = c[(d + 12) >> 2];
+                  c[h >> 2] = c[e >> 2];
+                  c[(h + 4) >> 2] = c[(e + 4) >> 2];
+                  c[(h + 8) >> 2] = c[(e + 8) >> 2];
+                  c[(h + 12) >> 2] = c[(e + 12) >> 2];
+                  c[i >> 2] = c[a >> 2];
+                  c[(i + 4) >> 2] = c[(a + 4) >> 2];
+                  c[(i + 8) >> 2] = c[(a + 8) >> 2];
+                  c[(i + 12) >> 2] = c[(a + 12) >> 2];
+                  a = GY(g, h, i) | 0;
+                  c[g >> 2] = c[d >> 2];
+                  c[(g + 4) >> 2] = c[(d + 4) >> 2];
+                  c[(g + 8) >> 2] = c[(d + 8) >> 2];
+                  c[(g + 12) >> 2] = c[(d + 12) >> 2];
+                  c[h >> 2] = c[e >> 2];
+                  c[(h + 4) >> 2] = c[(e + 4) >> 2];
+                  c[(h + 8) >> 2] = c[(e + 8) >> 2];
+                  c[(h + 12) >> 2] = c[(e + 12) >> 2];
+                  c[i >> 2] = c[b >> 2];
+                  c[(i + 4) >> 2] = c[(b + 4) >> 2];
+                  c[(i + 8) >> 2] = c[(b + 8) >> 2];
+                  c[(i + 12) >> 2] = c[(b + 12) >> 2];
+                  k = (O(f, j) | 0) < 0;
+                  f = (O(GY(g, h, i) | 0, a) | 0) >>> 31;
+                  f = k ? f : 0;
+                }
+              while (0);
+              l = m;
+              return f | 0;
+            }
+            function JY(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0,
+                d = 0.0;
+              c = +h[a >> 3] - +h[b >> 3];
+              d = +h[(a + 8) >> 3] - +h[(b + 8) >> 3];
+              return +(d * d + c * c);
+            }
+            function KY(a) {
+              a = a | 0;
+              c[(a + 24) >> 2] = LY(c[(a + 4) >> 2] | 0) | 0;
+              MY(a);
+              return;
+            }
+            function LY(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              e = (a + 2) | 0;
+              f = T1(e << 2) | 0;
+              b = V1(O(a, a) | 0, 8) | 0;
+              d = 0;
+              while (1) {
+                if ((d | 0) >= (a | 0)) break;
+                c[(f + (d << 2)) >> 2] = b;
+                b = (b + (a << 3)) | 0;
+                d = (d + 1) | 0;
+              }
+              while (1) {
+                if ((a | 0) >= (e | 0)) break;
+                c[(f + (a << 2)) >> 2] = 0;
+                a = (a + 1) | 0;
+              }
+              return f | 0;
+            }
+            function MY(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0.0;
+              p = l;
+              l = (l + 32) | 0;
+              i = (p + 16) | 0;
+              g = p;
+              j = c[(a + 4) >> 2] | 0;
+              m = c[(a + 8) >> 2] | 0;
+              n = c[(a + 16) >> 2] | 0;
+              o = c[(a + 20) >> 2] | 0;
+              d = c[(a + 24) >> 2] | 0;
+              b = 0;
+              while (1) {
+                if ((b | 0) >= (j | 0)) break;
+                q = c[(o + (b << 2)) >> 2] | 0;
+                e = (m + (b << 4)) | 0;
+                f = (m + (q << 4)) | 0;
+                c[g >> 2] = c[e >> 2];
+                c[(g + 4) >> 2] = c[(e + 4) >> 2];
+                c[(g + 8) >> 2] = c[(e + 8) >> 2];
+                c[(g + 12) >> 2] = c[(e + 12) >> 2];
+                c[i >> 2] = c[f >> 2];
+                c[(i + 4) >> 2] = c[(f + 4) >> 2];
+                c[(i + 8) >> 2] = c[(f + 8) >> 2];
+                c[(i + 12) >> 2] = c[(f + 12) >> 2];
+                r = +NY(g, i);
+                f = c[(d + (b << 2)) >> 2] | 0;
+                h[(f + (q << 3)) >> 3] = r;
+                h[((c[(d + (q << 2)) >> 2] | 0) + (b << 3)) >> 3] = r;
+                a = (b + -1) | 0;
+                a = (q | 0) == (a | 0) ? (b + -2) | 0 : a;
+                while (1) {
+                  if ((a | 0) <= -1) break;
+                  if (
+                    (OY(b, a, m, n, o) | 0 ? OY(a, b, m, n, o) | 0 : 0)
+                      ? ((k = (m + (a << 4)) | 0),
+                        (c[g >> 2] = c[e >> 2]),
+                        (c[(g + 4) >> 2] = c[(e + 4) >> 2]),
+                        (c[(g + 8) >> 2] = c[(e + 8) >> 2]),
+                        (c[(g + 12) >> 2] = c[(e + 12) >> 2]),
+                        (c[i >> 2] = c[k >> 2]),
+                        (c[(i + 4) >> 2] = c[(k + 4) >> 2]),
+                        (c[(i + 8) >> 2] = c[(k + 8) >> 2]),
+                        (c[(i + 12) >> 2] = c[(k + 12) >> 2]),
+                        PY(g, i, j, j, j, m, n) | 0)
+                      : 0
+                  ) {
+                    c[g >> 2] = c[e >> 2];
+                    c[(g + 4) >> 2] = c[(e + 4) >> 2];
+                    c[(g + 8) >> 2] = c[(e + 8) >> 2];
+                    c[(g + 12) >> 2] = c[(e + 12) >> 2];
+                    c[i >> 2] = c[k >> 2];
+                    c[(i + 4) >> 2] = c[(k + 4) >> 2];
+                    c[(i + 8) >> 2] = c[(k + 8) >> 2];
+                    c[(i + 12) >> 2] = c[(k + 12) >> 2];
+                    r = +NY(g, i);
+                    h[(f + (a << 3)) >> 3] = r;
+                    h[((c[(d + (a << 2)) >> 2] | 0) + (b << 3)) >> 3] = r;
+                  }
+                  a = (a + -1) | 0;
+                }
+                b = (b + 1) | 0;
+              }
+              l = p;
+              return;
+            }
+            function NY(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0,
+                f = 0,
+                g = 0;
+              e = l;
+              l = (l + 32) | 0;
+              f = (e + 16) | 0;
+              g = e;
+              c[g >> 2] = c[a >> 2];
+              c[(g + 4) >> 2] = c[(a + 4) >> 2];
+              c[(g + 8) >> 2] = c[(a + 8) >> 2];
+              c[(g + 12) >> 2] = c[(a + 12) >> 2];
+              c[f >> 2] = c[b >> 2];
+              c[(f + 4) >> 2] = c[(b + 4) >> 2];
+              c[(f + 8) >> 2] = c[(b + 8) >> 2];
+              c[(f + 12) >> 2] = c[(b + 12) >> 2];
+              d = +C(+(+JY(g, f)));
+              l = e;
+              return +d;
+            }
+            function OY(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              g = l;
+              l = (l + 64) | 0;
+              h = (g + 48) | 0;
+              i = (g + 32) | 0;
+              j = (g + 16) | 0;
+              k = g;
+              n = (d + (c[(f + (a << 2)) >> 2] << 4)) | 0;
+              m = (d + (a << 4)) | 0;
+              e = (d + (c[(e + (a << 2)) >> 2] << 4)) | 0;
+              f = (d + (b << 4)) | 0;
+              c[k >> 2] = c[n >> 2];
+              c[(k + 4) >> 2] = c[(n + 4) >> 2];
+              c[(k + 8) >> 2] = c[(n + 8) >> 2];
+              c[(k + 12) >> 2] = c[(n + 12) >> 2];
+              c[j >> 2] = c[m >> 2];
+              c[(j + 4) >> 2] = c[(m + 4) >> 2];
+              c[(j + 8) >> 2] = c[(m + 8) >> 2];
+              c[(j + 12) >> 2] = c[(m + 12) >> 2];
+              c[i >> 2] = c[e >> 2];
+              c[(i + 4) >> 2] = c[(e + 4) >> 2];
+              c[(i + 8) >> 2] = c[(e + 8) >> 2];
+              c[(i + 12) >> 2] = c[(e + 12) >> 2];
+              c[h >> 2] = c[f >> 2];
+              c[(h + 4) >> 2] = c[(f + 4) >> 2];
+              c[(h + 8) >> 2] = c[(f + 8) >> 2];
+              c[(h + 12) >> 2] = c[(f + 12) >> 2];
+              f = QY(k, j, i, h) | 0;
+              l = g;
+              return f | 0;
+            }
+            function PY(a, b, d, e, f, g, h) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0;
+              p = l;
+              l = (l + 64) | 0;
+              n = (p + 48) | 0;
+              m = (p + 32) | 0;
+              k = (p + 16) | 0;
+              j = p;
+              i = 0;
+              while (1) {
+                if ((i | 0) >= (d | 0)) {
+                  o = 4;
+                  break;
+                }
+                r = (g + (i << 4)) | 0;
+                q = (g + (c[(h + (i << 2)) >> 2] << 4)) | 0;
+                c[j >> 2] = c[a >> 2];
+                c[(j + 4) >> 2] = c[(a + 4) >> 2];
+                c[(j + 8) >> 2] = c[(a + 8) >> 2];
+                c[(j + 12) >> 2] = c[(a + 12) >> 2];
+                c[k >> 2] = c[b >> 2];
+                c[(k + 4) >> 2] = c[(b + 4) >> 2];
+                c[(k + 8) >> 2] = c[(b + 8) >> 2];
+                c[(k + 12) >> 2] = c[(b + 12) >> 2];
+                c[m >> 2] = c[r >> 2];
+                c[(m + 4) >> 2] = c[(r + 4) >> 2];
+                c[(m + 8) >> 2] = c[(r + 8) >> 2];
+                c[(m + 12) >> 2] = c[(r + 12) >> 2];
+                c[n >> 2] = c[q >> 2];
+                c[(n + 4) >> 2] = c[(q + 4) >> 2];
+                c[(n + 8) >> 2] = c[(q + 8) >> 2];
+                c[(n + 12) >> 2] = c[(q + 12) >> 2];
+                if (!(IY(j, k, m, n) | 0)) i = (i + 1) | 0;
+                else {
+                  e = 0;
+                  break;
+                }
+              }
+              a: do
+                if ((o | 0) == 4)
+                  while (1) {
+                    if ((e | 0) >= (f | 0)) {
+                      e = 1;
+                      break a;
+                    }
+                    q = (g + (e << 4)) | 0;
+                    r = (g + (c[(h + (e << 2)) >> 2] << 4)) | 0;
+                    c[j >> 2] = c[a >> 2];
+                    c[(j + 4) >> 2] = c[(a + 4) >> 2];
+                    c[(j + 8) >> 2] = c[(a + 8) >> 2];
+                    c[(j + 12) >> 2] = c[(a + 12) >> 2];
+                    c[k >> 2] = c[b >> 2];
+                    c[(k + 4) >> 2] = c[(b + 4) >> 2];
+                    c[(k + 8) >> 2] = c[(b + 8) >> 2];
+                    c[(k + 12) >> 2] = c[(b + 12) >> 2];
+                    c[m >> 2] = c[q >> 2];
+                    c[(m + 4) >> 2] = c[(q + 4) >> 2];
+                    c[(m + 8) >> 2] = c[(q + 8) >> 2];
+                    c[(m + 12) >> 2] = c[(q + 12) >> 2];
+                    c[n >> 2] = c[r >> 2];
+                    c[(n + 4) >> 2] = c[(r + 4) >> 2];
+                    c[(n + 8) >> 2] = c[(r + 8) >> 2];
+                    c[(n + 12) >> 2] = c[(r + 12) >> 2];
+                    if (!(IY(j, k, m, n) | 0)) {
+                      e = (e + 1) | 0;
+                      o = 4;
+                    } else {
+                      e = 0;
+                      break;
+                    }
+                  }
+              while (0);
+              l = p;
+              return e | 0;
+            }
+            function QY(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              g = l;
+              l = (l + 48) | 0;
+              h = (g + 32) | 0;
+              i = (g + 16) | 0;
+              j = g;
+              c[j >> 2] = c[e >> 2];
+              c[(j + 4) >> 2] = c[(e + 4) >> 2];
+              c[(j + 8) >> 2] = c[(e + 8) >> 2];
+              c[(j + 12) >> 2] = c[(e + 12) >> 2];
+              c[i >> 2] = c[a >> 2];
+              c[(i + 4) >> 2] = c[(a + 4) >> 2];
+              c[(i + 8) >> 2] = c[(a + 8) >> 2];
+              c[(i + 12) >> 2] = c[(a + 12) >> 2];
+              c[h >> 2] = c[b >> 2];
+              c[(h + 4) >> 2] = c[(b + 4) >> 2];
+              c[(h + 8) >> 2] = c[(b + 8) >> 2];
+              c[(h + 12) >> 2] = c[(b + 12) >> 2];
+              f = GY(j, i, h) | 0;
+              c[j >> 2] = c[e >> 2];
+              c[(j + 4) >> 2] = c[(e + 4) >> 2];
+              c[(j + 8) >> 2] = c[(e + 8) >> 2];
+              c[(j + 12) >> 2] = c[(e + 12) >> 2];
+              c[i >> 2] = c[b >> 2];
+              c[(i + 4) >> 2] = c[(b + 4) >> 2];
+              c[(i + 8) >> 2] = c[(b + 8) >> 2];
+              c[(i + 12) >> 2] = c[(b + 12) >> 2];
+              c[h >> 2] = c[d >> 2];
+              c[(h + 4) >> 2] = c[(d + 4) >> 2];
+              c[(h + 8) >> 2] = c[(d + 8) >> 2];
+              c[(h + 12) >> 2] = c[(d + 12) >> 2];
+              e = GY(j, i, h) | 0;
+              c[j >> 2] = c[a >> 2];
+              c[(j + 4) >> 2] = c[(a + 4) >> 2];
+              c[(j + 8) >> 2] = c[(a + 8) >> 2];
+              c[(j + 12) >> 2] = c[(a + 12) >> 2];
+              c[i >> 2] = c[b >> 2];
+              c[(i + 4) >> 2] = c[(b + 4) >> 2];
+              c[(i + 8) >> 2] = c[(b + 8) >> 2];
+              c[(i + 12) >> 2] = c[(b + 12) >> 2];
+              c[h >> 2] = c[d >> 2];
+              c[(h + 4) >> 2] = c[(d + 4) >> 2];
+              c[(h + 8) >> 2] = c[(d + 8) >> 2];
+              c[(h + 12) >> 2] = c[(d + 12) >> 2];
+              d = (GY(j, i, h) | 0) > 0;
+              l = g;
+              return (((d ? e | f : e & f) >>> 31) ^ 1) | 0;
+            }
+            function RY(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0;
+              s = l;
+              l = (l + 80) | 0;
+              j = (s + 64) | 0;
+              i = (s + 48) | 0;
+              g = (s + 32) | 0;
+              k = (s + 16) | 0;
+              o = s;
+              p = c[(a + 4) >> 2] | 0;
+              q = c[(a + 8) >> 2] | 0;
+              r = c[(a + 16) >> 2] | 0;
+              m = c[(a + 20) >> 2] | 0;
+              n = T1(((p << 3) + 16) | 0) | 0;
+              if ((b | 0) == -2222) {
+                c[j >> 2] = c[d >> 2];
+                c[(j + 4) >> 2] = c[(d + 4) >> 2];
+                c[(j + 8) >> 2] = c[(d + 8) >> 2];
+                c[(j + 12) >> 2] = c[(d + 12) >> 2];
+                b = SY(a, j) | 0;
+              }
+              if ((b | 0) > -1) {
+                a = c[(a + 12) >> 2] | 0;
+                f = c[(a + ((b + 1) << 2)) >> 2] | 0;
+                a = c[(a + (b << 2)) >> 2] | 0;
+              } else {
+                f = p;
+                a = p;
+              }
+              b = 0;
+              while (1) {
+                if ((b | 0) >= (a | 0)) {
+                  b = a;
+                  break;
+                }
+                u = (q + (b << 4)) | 0;
+                c[o >> 2] = c[u >> 2];
+                c[(o + 4) >> 2] = c[(u + 4) >> 2];
+                c[(o + 8) >> 2] = c[(u + 8) >> 2];
+                c[(o + 12) >> 2] = c[(u + 12) >> 2];
+                u = (q + (c[(m + (b << 2)) >> 2] << 4)) | 0;
+                t = (q + (c[(r + (b << 2)) >> 2] << 4)) | 0;
+                c[k >> 2] = c[u >> 2];
+                c[(k + 4) >> 2] = c[(u + 4) >> 2];
+                c[(k + 8) >> 2] = c[(u + 8) >> 2];
+                c[(k + 12) >> 2] = c[(u + 12) >> 2];
+                c[g >> 2] = c[o >> 2];
+                c[(g + 4) >> 2] = c[(o + 4) >> 2];
+                c[(g + 8) >> 2] = c[(o + 8) >> 2];
+                c[(g + 12) >> 2] = c[(o + 12) >> 2];
+                c[i >> 2] = c[t >> 2];
+                c[(i + 4) >> 2] = c[(t + 4) >> 2];
+                c[(i + 8) >> 2] = c[(t + 8) >> 2];
+                c[(i + 12) >> 2] = c[(t + 12) >> 2];
+                c[j >> 2] = c[d >> 2];
+                c[(j + 4) >> 2] = c[(d + 4) >> 2];
+                c[(j + 8) >> 2] = c[(d + 8) >> 2];
+                c[(j + 12) >> 2] = c[(d + 12) >> 2];
+                if (
+                  (QY(k, g, i, j) | 0) != 0
+                    ? ((c[i >> 2] = c[d >> 2]),
+                      (c[(i + 4) >> 2] = c[(d + 4) >> 2]),
+                      (c[(i + 8) >> 2] = c[(d + 8) >> 2]),
+                      (c[(i + 12) >> 2] = c[(d + 12) >> 2]),
+                      (c[j >> 2] = c[o >> 2]),
+                      (c[(j + 4) >> 2] = c[(o + 4) >> 2]),
+                      (c[(j + 8) >> 2] = c[(o + 8) >> 2]),
+                      (c[(j + 12) >> 2] = c[(o + 12) >> 2]),
+                      (PY(i, j, a, f, p, q, r) | 0) != 0)
+                    : 0
+                ) {
+                  c[i >> 2] = c[d >> 2];
+                  c[(i + 4) >> 2] = c[(d + 4) >> 2];
+                  c[(i + 8) >> 2] = c[(d + 8) >> 2];
+                  c[(i + 12) >> 2] = c[(d + 12) >> 2];
+                  c[j >> 2] = c[o >> 2];
+                  c[(j + 4) >> 2] = c[(o + 4) >> 2];
+                  c[(j + 8) >> 2] = c[(o + 8) >> 2];
+                  c[(j + 12) >> 2] = c[(o + 12) >> 2];
+                  e = +NY(i, j);
+                } else e = 0.0;
+                h[(n + (b << 3)) >> 3] = e;
+                b = (b + 1) | 0;
+              }
+              while (1) {
+                if ((b | 0) >= (f | 0)) {
+                  b = f;
+                  break;
+                }
+                h[(n + (b << 3)) >> 3] = 0.0;
+                b = (b + 1) | 0;
+              }
+              while (1) {
+                if ((b | 0) >= (p | 0)) break;
+                t = (q + (b << 4)) | 0;
+                c[o >> 2] = c[t >> 2];
+                c[(o + 4) >> 2] = c[(t + 4) >> 2];
+                c[(o + 8) >> 2] = c[(t + 8) >> 2];
+                c[(o + 12) >> 2] = c[(t + 12) >> 2];
+                t = (q + (c[(m + (b << 2)) >> 2] << 4)) | 0;
+                u = (q + (c[(r + (b << 2)) >> 2] << 4)) | 0;
+                c[k >> 2] = c[t >> 2];
+                c[(k + 4) >> 2] = c[(t + 4) >> 2];
+                c[(k + 8) >> 2] = c[(t + 8) >> 2];
+                c[(k + 12) >> 2] = c[(t + 12) >> 2];
+                c[g >> 2] = c[o >> 2];
+                c[(g + 4) >> 2] = c[(o + 4) >> 2];
+                c[(g + 8) >> 2] = c[(o + 8) >> 2];
+                c[(g + 12) >> 2] = c[(o + 12) >> 2];
+                c[i >> 2] = c[u >> 2];
+                c[(i + 4) >> 2] = c[(u + 4) >> 2];
+                c[(i + 8) >> 2] = c[(u + 8) >> 2];
+                c[(i + 12) >> 2] = c[(u + 12) >> 2];
+                c[j >> 2] = c[d >> 2];
+                c[(j + 4) >> 2] = c[(d + 4) >> 2];
+                c[(j + 8) >> 2] = c[(d + 8) >> 2];
+                c[(j + 12) >> 2] = c[(d + 12) >> 2];
+                if (
+                  (QY(k, g, i, j) | 0) != 0
+                    ? ((c[i >> 2] = c[d >> 2]),
+                      (c[(i + 4) >> 2] = c[(d + 4) >> 2]),
+                      (c[(i + 8) >> 2] = c[(d + 8) >> 2]),
+                      (c[(i + 12) >> 2] = c[(d + 12) >> 2]),
+                      (c[j >> 2] = c[o >> 2]),
+                      (c[(j + 4) >> 2] = c[(o + 4) >> 2]),
+                      (c[(j + 8) >> 2] = c[(o + 8) >> 2]),
+                      (c[(j + 12) >> 2] = c[(o + 12) >> 2]),
+                      (PY(i, j, a, f, p, q, r) | 0) != 0)
+                    : 0
+                ) {
+                  c[i >> 2] = c[d >> 2];
+                  c[(i + 4) >> 2] = c[(d + 4) >> 2];
+                  c[(i + 8) >> 2] = c[(d + 8) >> 2];
+                  c[(i + 12) >> 2] = c[(d + 12) >> 2];
+                  c[j >> 2] = c[o >> 2];
+                  c[(j + 4) >> 2] = c[(o + 4) >> 2];
+                  c[(j + 8) >> 2] = c[(o + 8) >> 2];
+                  c[(j + 12) >> 2] = c[(o + 12) >> 2];
+                  e = +NY(i, j);
+                } else e = 0.0;
+                h[(n + (b << 3)) >> 3] = e;
+                b = (b + 1) | 0;
+              }
+              h[(n + (p << 3)) >> 3] = 0.0;
+              h[(n + ((p + 1) << 3)) >> 3] = 0.0;
+              l = s;
+              return n | 0;
+            }
+            function SY(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              m = l;
+              l = (l + 32) | 0;
+              f = (m + 8) | 0;
+              e = m;
+              h = (m + 24) | 0;
+              i = (a + 8) | 0;
+              j = (a + 12) | 0;
+              k = (h + 4) | 0;
+              d = 0;
+              while (1) {
+                if ((d | 0) >= (c[a >> 2] | 0)) {
+                  d = -1111;
+                  break;
+                }
+                o = c[j >> 2] | 0;
+                n = c[(o + (d << 2)) >> 2] | 0;
+                c[h >> 2] = (c[i >> 2] | 0) + (n << 4);
+                g = (d + 1) | 0;
+                c[k >> 2] = (c[(o + (g << 2)) >> 2] | 0) - n;
+                c[e >> 2] = c[h >> 2];
+                c[(e + 4) >> 2] = c[(h + 4) >> 2];
+                c[f >> 2] = c[b >> 2];
+                c[(f + 4) >> 2] = c[(b + 4) >> 2];
+                c[(f + 8) >> 2] = c[(b + 8) >> 2];
+                c[(f + 12) >> 2] = c[(b + 12) >> 2];
+                if (!(NX(e, f) | 0)) d = g;
+                else break;
+              }
+              l = m;
+              return d | 0;
+            }
+            function TY(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0;
+              t = l;
+              l = (l + 64) | 0;
+              n = (t + 48) | 0;
+              m = (t + 32) | 0;
+              p = (t + 16) | 0;
+              o = t;
+              r = c[(f + 4) >> 2] | 0;
+              s = c[(f + 8) >> 2] | 0;
+              q = c[(f + 16) >> 2] | 0;
+              g = (e | 0) < 0;
+              do
+                if ((b | 0) < 0)
+                  if (g) {
+                    g = 0;
+                    i = 0;
+                    f = 0;
+                    h = 0;
+                  } else {
+                    b = c[(f + 12) >> 2] | 0;
+                    f = 0;
+                    h = 0;
+                    i = e;
+                    j = b;
+                    b = (b + (e << 2)) | 0;
+                    k = 9;
+                  }
+                else {
+                  if (g) {
+                    k = c[(f + 12) >> 2] | 0;
+                    f = 0;
+                    h = 0;
+                    i = b;
+                    j = k;
+                    b = (k + (b << 2)) | 0;
+                    k = 9;
+                    break;
+                  }
+                  g = c[(f + 12) >> 2] | 0;
+                  if ((b | 0) > (e | 0)) {
+                    f = c[(g + ((e + 1) << 2)) >> 2] | 0;
+                    h = c[(g + (e << 2)) >> 2] | 0;
+                    i = b;
+                    j = g;
+                    b = (g + (b << 2)) | 0;
+                    k = 9;
+                    break;
+                  } else {
+                    f = c[(g + ((b + 1) << 2)) >> 2] | 0;
+                    h = c[(g + (b << 2)) >> 2] | 0;
+                    i = e;
+                    j = g;
+                    b = (g + (e << 2)) | 0;
+                    k = 9;
+                    break;
+                  }
+                }
+              while (0);
+              if ((k | 0) == 9) {
+                g = c[(j + ((i + 1) << 2)) >> 2] | 0;
+                i = c[b >> 2] | 0;
+              }
+              b = 0;
+              while (1) {
+                if ((b | 0) >= (h | 0)) {
+                  k = 13;
+                  break;
+                }
+                j = (s + (b << 4)) | 0;
+                e = (s + (c[(q + (b << 2)) >> 2] << 4)) | 0;
+                c[o >> 2] = c[a >> 2];
+                c[(o + 4) >> 2] = c[(a + 4) >> 2];
+                c[(o + 8) >> 2] = c[(a + 8) >> 2];
+                c[(o + 12) >> 2] = c[(a + 12) >> 2];
+                c[p >> 2] = c[d >> 2];
+                c[(p + 4) >> 2] = c[(d + 4) >> 2];
+                c[(p + 8) >> 2] = c[(d + 8) >> 2];
+                c[(p + 12) >> 2] = c[(d + 12) >> 2];
+                c[m >> 2] = c[j >> 2];
+                c[(m + 4) >> 2] = c[(j + 4) >> 2];
+                c[(m + 8) >> 2] = c[(j + 8) >> 2];
+                c[(m + 12) >> 2] = c[(j + 12) >> 2];
+                c[n >> 2] = c[e >> 2];
+                c[(n + 4) >> 2] = c[(e + 4) >> 2];
+                c[(n + 8) >> 2] = c[(e + 8) >> 2];
+                c[(n + 12) >> 2] = c[(e + 12) >> 2];
+                if (!(IY(o, p, m, n) | 0)) b = (b + 1) | 0;
+                else {
+                  g = 0;
+                  break;
+                }
+              }
+              a: do
+                if ((k | 0) == 13) {
+                  while (1) {
+                    if ((f | 0) >= (i | 0)) break;
+                    e = (s + (f << 4)) | 0;
+                    k = (s + (c[(q + (f << 2)) >> 2] << 4)) | 0;
+                    c[o >> 2] = c[a >> 2];
+                    c[(o + 4) >> 2] = c[(a + 4) >> 2];
+                    c[(o + 8) >> 2] = c[(a + 8) >> 2];
+                    c[(o + 12) >> 2] = c[(a + 12) >> 2];
+                    c[p >> 2] = c[d >> 2];
+                    c[(p + 4) >> 2] = c[(d + 4) >> 2];
+                    c[(p + 8) >> 2] = c[(d + 8) >> 2];
+                    c[(p + 12) >> 2] = c[(d + 12) >> 2];
+                    c[m >> 2] = c[e >> 2];
+                    c[(m + 4) >> 2] = c[(e + 4) >> 2];
+                    c[(m + 8) >> 2] = c[(e + 8) >> 2];
+                    c[(m + 12) >> 2] = c[(e + 12) >> 2];
+                    c[n >> 2] = c[k >> 2];
+                    c[(n + 4) >> 2] = c[(k + 4) >> 2];
+                    c[(n + 8) >> 2] = c[(k + 8) >> 2];
+                    c[(n + 12) >> 2] = c[(k + 12) >> 2];
+                    if (!(IY(o, p, m, n) | 0)) {
+                      f = (f + 1) | 0;
+                      k = 13;
+                    } else {
+                      g = 0;
+                      break a;
+                    }
+                  }
+                  while (1) {
+                    if ((g | 0) >= (r | 0)) {
+                      g = 1;
+                      break a;
+                    }
+                    e = (s + (g << 4)) | 0;
+                    k = (s + (c[(q + (g << 2)) >> 2] << 4)) | 0;
+                    c[o >> 2] = c[a >> 2];
+                    c[(o + 4) >> 2] = c[(a + 4) >> 2];
+                    c[(o + 8) >> 2] = c[(a + 8) >> 2];
+                    c[(o + 12) >> 2] = c[(a + 12) >> 2];
+                    c[p >> 2] = c[d >> 2];
+                    c[(p + 4) >> 2] = c[(d + 4) >> 2];
+                    c[(p + 8) >> 2] = c[(d + 8) >> 2];
+                    c[(p + 12) >> 2] = c[(d + 12) >> 2];
+                    c[m >> 2] = c[e >> 2];
+                    c[(m + 4) >> 2] = c[(e + 4) >> 2];
+                    c[(m + 8) >> 2] = c[(e + 8) >> 2];
+                    c[(m + 12) >> 2] = c[(e + 12) >> 2];
+                    c[n >> 2] = c[k >> 2];
+                    c[(n + 4) >> 2] = c[(k + 4) >> 2];
+                    c[(n + 8) >> 2] = c[(k + 8) >> 2];
+                    c[(n + 12) >> 2] = c[(k + 12) >> 2];
+                    if (!(IY(o, p, m, n) | 0)) g = (g + 1) | 0;
+                    else {
+                      g = 0;
+                      break;
+                    }
+                  }
+                }
+              while (0);
+              l = t;
+              return g | 0;
+            }
+            function UY(a) {
+              a = a | 0;
+              return VY(a, 0, 0) | 0;
+            }
+            function VY(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              return WY(a, b, c, 0) | 0;
+            }
+            function WY(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              if (!d) {
+                g = T1(496) | 0;
+                if (!g) g = 0;
+                else {
+                  c[(g + 12) >> 2] = 35;
+                  c[(g + 16) >> 2] = 107;
+                  c[(g + 20) >> 2] = 105;
+                  d = 35;
+                  h = 6;
+                }
+              } else {
+                g = kb[c[d >> 2] & 63](496) | 0;
+                if (!g) g = 0;
+                else {
+                  h = c[d >> 2] | 0;
+                  c[(g + 12) >> 2] = h;
+                  c[(g + 16) >> 2] = c[(d + 4) >> 2];
+                  c[(g + 20) >> 2] = c[(d + 8) >> 2];
+                  d = h;
+                  h = 6;
+                }
+              }
+              do
+                if ((h | 0) == 6) {
+                  c[(g + 8) >> 2] = 0;
+                  c[(g + 32) >> 2] = 0;
+                  c[(g + 376) >> 2] = 16;
+                  j = (g + 12) | 0;
+                  i = kb[d & 63](256) | 0;
+                  d = (g + 388) | 0;
+                  c[d >> 2] = i;
+                  if (!i) {
+                    tb[c[(g + 20) >> 2] & 127](g);
+                    g = 0;
+                    break;
+                  }
+                  h = kb[c[j >> 2] & 63](1024) | 0;
+                  i = (g + 44) | 0;
+                  c[i >> 2] = h;
+                  if (!h) {
+                    e = (g + 20) | 0;
+                    tb[c[e >> 2] & 127](c[d >> 2] | 0);
+                    tb[c[e >> 2] & 127](g);
+                    g = 0;
+                    break;
+                  }
+                  c[(g + 48) >> 2] = h + 1024;
+                  if (!f) {
+                    f = XY(j) | 0;
+                    c[(g + 352) >> 2] = f;
+                    if (!f) {
+                      e = (g + 20) | 0;
+                      tb[c[e >> 2] & 127](c[i >> 2] | 0);
+                      tb[c[e >> 2] & 127](c[d >> 2] | 0);
+                      tb[c[e >> 2] & 127](g);
+                      g = 0;
+                      break;
+                    }
+                  } else c[(g + 352) >> 2] = f;
+                  c[(g + 372) >> 2] = 0;
+                  c[(g + 364) >> 2] = 0;
+                  c[(g + 300) >> 2] = 0;
+                  c[(g + 464) >> 2] = 0;
+                  c[(g + 460) >> 2] = 0;
+                  c[(g + 124) >> 2] = 0;
+                  c[(g + 244) >> 2] = 0;
+                  d = (g + 468) | 0;
+                  a[d >> 0] = 33;
+                  h = (g + 232) | 0;
+                  a[h >> 0] = 0;
+                  a[(g + 233) >> 0] = 0;
+                  c[(g + 392) >> 2] = 0;
+                  c[(g + 396) >> 2] = 0;
+                  a[(g + 400) >> 0] = 0;
+                  f = (g + 228) | 0;
+                  c[f >> 2] = 0;
+                  YY((g + 412) | 0, j);
+                  YY((g + 436) | 0, j);
+                  ZY(g, b);
+                  if (b | 0 ? (c[f >> 2] | 0) == 0 : 0) {
+                    _Y(g);
+                    g = 0;
+                    break;
+                  }
+                  if (!e) {
+                    c[(g + 224) >> 2] = i$() | 0;
+                    break;
+                  } else {
+                    a[h >> 0] = 1;
+                    c[(g + 224) >> 2] = O0() | 0;
+                    a[d >> 0] = a[e >> 0] | 0;
+                    break;
+                  }
+                }
+              while (0);
+              return g | 0;
+            }
+            function XY(b) {
+              b = b | 0;
+              var d = 0;
+              d = kb[c[b >> 2] & 63](188) | 0;
+              if (d | 0) {
+                YY((d + 80) | 0, b);
+                YY((d + 104) | 0, b);
+                f_(d, b);
+                f_((d + 20) | 0, b);
+                f_((d + 40) | 0, b);
+                f_((d + 60) | 0, b);
+                a[(d + 131) >> 0] = 0;
+                f_((d + 132) | 0, b);
+                c[(d + 152) >> 2] = 0;
+                c[(d + 156) >> 2] = 0;
+                a[(d + 160) >> 0] = 0;
+                b = (d + 164) | 0;
+                c[b >> 2] = 0;
+                c[(b + 4) >> 2] = 0;
+                c[(b + 8) >> 2] = 0;
+                c[(b + 12) >> 2] = 0;
+                c[(b + 16) >> 2] = 0;
+                c[(b + 20) >> 2] = 0;
+                a[(d + 128) >> 0] = 1;
+                a[(d + 129) >> 0] = 0;
+                a[(d + 130) >> 0] = 0;
+              }
+              return d | 0;
+            }
+            function YY(a, b) {
+              a = a | 0;
+              b = b | 0;
+              c[a >> 2] = 0;
+              c[(a + 4) >> 2] = 0;
+              c[(a + 8) >> 2] = 0;
+              c[(a + 12) >> 2] = 0;
+              c[(a + 16) >> 2] = 0;
+              c[(a + 20) >> 2] = b;
+              return;
+            }
+            function ZY(d, e) {
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              c[(d + 276) >> 2] = 56;
+              V0((d + 252) | 0);
+              if (e | 0) c[(d + 228) >> 2] = gZ(e, (d + 12) | 0) | 0;
+              c[(d + 356) >> 2] = 0;
+              Y$((d + 148) | 0, (d + 144) | 0, 0) | 0;
+              c[d >> 2] = 0;
+              c[(d + 4) >> 2] = 0;
+              e = (d + 116) | 0;
+              g = (d + 52) | 0;
+              h = (g + 64) | 0;
+              do {
+                c[g >> 2] = 0;
+                g = (g + 4) | 0;
+              } while ((g | 0) < (h | 0));
+              c[e >> 2] = d;
+              c[(d + 120) >> 2] = 0;
+              e = (d + 128) | 0;
+              c[e >> 2] = 0;
+              c[(e + 4) >> 2] = 0;
+              c[(e + 8) >> 2] = 0;
+              c[(e + 12) >> 2] = 0;
+              e = c[(d + 8) >> 2] | 0;
+              c[(d + 24) >> 2] = e;
+              c[(d + 28) >> 2] = e;
+              c[(d + 36) >> 2] = 0;
+              c[(d + 40) >> 2] = 0;
+              e = (d + 312) | 0;
+              g = (d + 404) | 0;
+              c[g >> 2] = 0;
+              c[(g + 4) >> 2] = 0;
+              g = (d + 280) | 0;
+              f = (d + 304) | 0;
+              c[g >> 2] = 0;
+              c[(g + 4) >> 2] = 0;
+              c[(g + 8) >> 2] = 0;
+              c[(g + 12) >> 2] = 0;
+              c[(g + 16) >> 2] = 0;
+              g = e;
+              h = (g + 36) | 0;
+              do {
+                c[g >> 2] = 0;
+                g = (g + 4) | 0;
+              } while ((g | 0) < (h | 0));
+              b[(e + 36) >> 1] = 0;
+              a[f >> 0] = 1;
+              c[(d + 308) >> 2] = 0;
+              c[(d + 360) >> 2] = 0;
+              c[(d + 368) >> 2] = 0;
+              c[(d + 380) >> 2] = 0;
+              c[(d + 236) >> 2] = 0;
+              c[(d + 248) >> 2] = 0;
+              c[(d + 240) >> 2] = 0;
+              c[(d + 472) >> 2] = 0;
+              c[(d + 476) >> 2] = 0;
+              a[(d + 484) >> 0] = 0;
+              a[(d + 485) >> 0] = 0;
+              c[(d + 488) >> 2] = 0;
+              c[(d + 492) >> 2] = 0;
+              return;
+            }
+            function _Y(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              if (b | 0) {
+                e = (b + 364) | 0;
+                g = (b + 20) | 0;
+                d = c[(b + 360) >> 2] | 0;
+                while (1) {
+                  if (!d) {
+                    d = c[e >> 2] | 0;
+                    if (!d) break;
+                    c[e >> 2] = 0;
+                  }
+                  h = c[d >> 2] | 0;
+                  tb[c[g >> 2] & 127](c[(d + 36) >> 2] | 0);
+                  $Y(c[(d + 44) >> 2] | 0, b);
+                  tb[c[g >> 2] & 127](d);
+                  d = h;
+                }
+                e = (b + 300) | 0;
+                d = c[(b + 296) >> 2] | 0;
+                while (1) {
+                  if (!d) {
+                    d = c[e >> 2] | 0;
+                    if (!d) break;
+                    c[e >> 2] = 0;
+                  }
+                  h = c[(d + 8) >> 2] | 0;
+                  tb[c[g >> 2] & 127](d);
+                  d = h;
+                }
+                $Y(c[(b + 372) >> 2] | 0, b);
+                $Y(c[(b + 368) >> 2] | 0, b);
+                aZ((b + 412) | 0);
+                aZ((b + 436) | 0);
+                d = (b + 12) | 0;
+                tb[c[g >> 2] & 127](c[(b + 228) >> 2] | 0);
+                if ((a[(b + 484) >> 0] | 0) == 0 ? ((f = c[(b + 352) >> 2] | 0), f | 0) : 0)
+                  bZ(f, ((c[(b + 472) >> 2] | 0) == 0) & 1, d);
+                tb[c[g >> 2] & 127](c[(b + 388) >> 2] | 0);
+                tb[c[g >> 2] & 127](c[(b + 460) >> 2] | 0);
+                tb[c[g >> 2] & 127](c[(b + 8) >> 2] | 0);
+                tb[c[g >> 2] & 127](c[(b + 44) >> 2] | 0);
+                tb[c[g >> 2] & 127](c[(b + 392) >> 2] | 0);
+                tb[c[g >> 2] & 127](c[(b + 236) >> 2] | 0);
+                d = c[(b + 248) >> 2] | 0;
+                if (d | 0) tb[d & 127](c[(b + 240) >> 2] | 0);
+                tb[c[g >> 2] & 127](b);
+              }
+              return;
+            }
+            function $Y(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              b = (b + 20) | 0;
+              while (1) {
+                if (!a) break;
+                d = c[(a + 4) >> 2] | 0;
+                tb[c[b >> 2] & 127](c[(a + 16) >> 2] | 0);
+                tb[c[b >> 2] & 127](a);
+                a = d;
+              }
+              return;
+            }
+            function aZ(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              d = (a + 20) | 0;
+              b = c[a >> 2] | 0;
+              while (1) {
+                if (!b) break;
+                e = c[b >> 2] | 0;
+                tb[c[((c[d >> 2] | 0) + 8) >> 2] & 127](b);
+                b = e;
+              }
+              b = c[(a + 4) >> 2] | 0;
+              while (1) {
+                if (!b) break;
+                e = c[b >> 2] | 0;
+                tb[c[((c[d >> 2] | 0) + 8) >> 2] & 127](b);
+                b = e;
+              }
+              return;
+            }
+            function bZ(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 16) | 0;
+              f = h;
+              g = (a + 20) | 0;
+              cZ(f, g);
+              d = (d + 8) | 0;
+              while (1) {
+                e = dZ(f) | 0;
+                if (!e) break;
+                if (!(c[(e + 16) >> 2] | 0)) continue;
+                tb[c[d >> 2] & 127](c[(e + 20) >> 2] | 0);
+              }
+              eZ(a);
+              eZ((a + 132) | 0);
+              eZ(g);
+              eZ((a + 40) | 0);
+              eZ((a + 60) | 0);
+              aZ((a + 80) | 0);
+              aZ((a + 104) | 0);
+              if ((b << 24) >> 24) {
+                tb[c[d >> 2] & 127](c[(a + 184) >> 2] | 0);
+                tb[c[d >> 2] & 127](c[(a + 164) >> 2] | 0);
+              }
+              tb[c[d >> 2] & 127](a);
+              l = h;
+              return;
+            }
+            function cZ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = c[b >> 2] | 0;
+              c[a >> 2] = d;
+              c[(a + 4) >> 2] = d + (c[(b + 8) >> 2] << 2);
+              return;
+            }
+            function dZ(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              d = c[(a + 4) >> 2] | 0;
+              e = c[a >> 2] | 0;
+              do {
+                if ((e | 0) == (d | 0)) {
+                  b = 0;
+                  break;
+                }
+                b = e;
+                e = (e + 4) | 0;
+                c[a >> 2] = e;
+                b = c[b >> 2] | 0;
+              } while (!(b | 0));
+              return b | 0;
+            }
+            function eZ(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              d = (a + 8) | 0;
+              e = (a + 16) | 0;
+              b = 0;
+              while (1) {
+                f = c[((c[e >> 2] | 0) + 8) >> 2] | 0;
+                g = c[a >> 2] | 0;
+                if (b >>> 0 >= (c[d >> 2] | 0) >>> 0) break;
+                tb[f & 127](c[(g + (b << 2)) >> 2] | 0);
+                b = (b + 1) | 0;
+              }
+              tb[f & 127](g);
+              return;
+            }
+            function fZ(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0;
+              f = hZ(a) | 0;
+              if (!f) {
+                c[(a + 276) >> 2] = 57;
+                f = iZ(a, b, d, e) | 0;
+              }
+              return f | 0;
+            }
+            function gZ(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = 0;
+              do {
+                f = e;
+                e = (e + 1) | 0;
+              } while ((a[(b + f) >> 0] | 0) != 0);
+              d = kb[c[d >> 2] & 63](e) | 0;
+              if (!d) d = 0;
+              else W6(d | 0, b | 0, e | 0) | 0;
+              return d | 0;
+            }
+            function hZ(b) {
+              b = b | 0;
+              var d = 0;
+              d = (b + 228) | 0;
+              if (
+                !(nb[((a[(b + 232) >> 0] << 24) >> 24 ? 38 : 37) & 63]((b + 148) | 0, (b + 144) | 0, c[d >> 2] | 0) | 0)
+              )
+                b = e_(b, c[d >> 2] | 0) | 0;
+              else b = 0;
+              return b | 0;
+            }
+            function iZ(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              g = l;
+              l = (l + 16) | 0;
+              h = g;
+              c[h >> 2] = d;
+              j = (b + 144) | 0;
+              i = c[j >> 2] | 0;
+              i = ob[c[i >> 2] & 127](i, d, e, h) | 0;
+              f = jZ(b, c[j >> 2] | 0, d, e, i, c[h >> 2] | 0, f, ((a[(b + 480) >> 0] | 0) == 0) & 1) | 0;
+              l = g;
+              return f | 0;
+            }
+            function jZ(b, e, f, g, h, i, j, k) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              i = i | 0;
+              j = j | 0;
+              k = k | 0;
+              var m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                O = 0,
+                P = 0,
+                Q = 0,
+                R = 0,
+                S = 0,
+                T = 0,
+                U = 0,
+                V = 0,
+                W = 0,
+                X = 0,
+                Y = 0,
+                Z = 0,
+                _ = 0,
+                $ = 0,
+                aa = 0,
+                ba = 0,
+                ca = 0,
+                da = 0,
+                ea = 0,
+                fa = 0,
+                ga = 0,
+                ha = 0,
+                ia = 0,
+                ja = 0,
+                ka = 0,
+                la = 0,
+                ma = 0,
+                na = 0,
+                oa = 0,
+                pa = 0,
+                qa = 0,
+                ra = 0,
+                sa = 0,
+                ta = 0,
+                ua = 0,
+                va = 0,
+                wa = 0,
+                xa = 0,
+                ya = 0,
+                za = 0,
+                Aa = 0,
+                Ba = 0,
+                Ca = 0,
+                Da = 0,
+                Ea = 0,
+                Fa = 0,
+                Ga = 0;
+              Ga = l;
+              l = (l + 16) | 0;
+              Da = Ga;
+              c[Da >> 2] = i;
+              r = c[(b + 352) >> 2] | 0;
+              s = (b + 144) | 0;
+              if ((c[s >> 2] | 0) == (e | 0)) {
+                p = (b + 284) | 0;
+                q = (b + 288) | 0;
+                na = (b + 296) | 0;
+              } else {
+                na = (b + 296) | 0;
+                q = c[na >> 2] | 0;
+                p = q;
+                q = (q + 4) | 0;
+              }
+              t = (k << 24) >> 24 != 0;
+              pa = (b + 252) | 0;
+              u = (b + 80) | 0;
+              v = (b + 476) | 0;
+              w = (b + 84) | 0;
+              x = (b + 320) | 0;
+              y = (b + 412) | 0;
+              z = (b + 316) | 0;
+              A = (b + 424) | 0;
+              B = (b + 428) | 0;
+              C = (b + 324) | 0;
+              ra = (b + 4) | 0;
+              D = (b + 485) | 0;
+              E = (r + 132) | 0;
+              F = (b + 312) | 0;
+              ta = (r + 129) | 0;
+              G = (r + 128) | 0;
+              H = (r + 80) | 0;
+              I = (r + 92) | 0;
+              J = (r + 96) | 0;
+              K = (b + 136) | 0;
+              L = (b + 88) | 0;
+              M = (b + 488) | 0;
+              va = (b + 112) | 0;
+              wa = (r + 131) | 0;
+              xa = (b + 116) | 0;
+              ya = (r + 130) | 0;
+              za = (b + 108) | 0;
+              Aa = (b + 356) | 0;
+              N = (b + 340) | 0;
+              O = (b + 132) | 0;
+              P = (b + 344) | 0;
+              Q = (b + 348) | 0;
+              R = (b + 328) | 0;
+              S = (b + 349) | 0;
+              T = (b + 420) | 0;
+              U = (r + 120) | 0;
+              V = (r + 116) | 0;
+              W = (b + 92) | 0;
+              X = (b + 472) | 0;
+              Y = (b + 336) | 0;
+              Z = (b + 332) | 0;
+              _ = (b + 96) | 0;
+              $ = (b + 256) | 0;
+              aa = (b + 464) | 0;
+              ba = (b + 460) | 0;
+              ca = (r + 160) | 0;
+              da = (r + 184) | 0;
+              ea = (r + 180) | 0;
+              fa = (r + 164) | 0;
+              ga = (b + 128) | 0;
+              ha = (b + 12) | 0;
+              ia = (b + 16) | 0;
+              ja = (b + 268) | 0;
+              ka = (b + 120) | 0;
+              la = (r + 176) | 0;
+              ma = (r + 168) | 0;
+              o = e;
+              n = f;
+              e = h;
+              a: while (1) {
+                c[p >> 2] = n;
+                f = c[Da >> 2] | 0;
+                c[q >> 2] = f;
+                i = f;
+                b: do
+                  if ((e | 0) < 1) {
+                    if (t & ((e | 0) != 0)) {
+                      m = 7;
+                      break a;
+                    }
+                    switch (e | 0) {
+                      case -1: {
+                        i = 5;
+                        m = 280;
+                        break a;
+                      }
+                      case 0: {
+                        m = 9;
+                        break a;
+                      }
+                      case -2: {
+                        i = 6;
+                        break a;
+                      }
+                      case -4: {
+                        m = 10;
+                        break a;
+                      }
+                      case -15: {
+                        e = 15;
+                        break b;
+                      }
+                      default: {
+                      }
+                    }
+                    c[Da >> 2] = g;
+                    e = (0 - e) | 0;
+                    i = g;
+                  }
+                while (0);
+                h = pb[c[pa >> 2] & 127](pa, e, n, i, o) | 0;
+                c: do
+                  switch (h | 0) {
+                    case 2: {
+                      m = 58;
+                      break a;
+                    }
+                    case -1: {
+                      m = 184;
+                      break a;
+                    }
+                    case 1: {
+                      i = kZ(b, 0, n, c[Da >> 2] | 0) | 0;
+                      if (i | 0) {
+                        m = 280;
+                        break a;
+                      }
+                      i = c[s >> 2] | 0;
+                      break;
+                    }
+                    case 4: {
+                      if (!(c[w >> 2] | 0)) i = 1;
+                      else {
+                        m = lZ(y, o, n, c[Da >> 2] | 0) | 0;
+                        c[z >> 2] = m;
+                        if (!m) {
+                          i = 1;
+                          m = 280;
+                          break a;
+                        }
+                        c[B >> 2] = c[A >> 2];
+                        c[C >> 2] = 0;
+                        i = 0;
+                      }
+                      c[x >> 2] = 0;
+                      m = 274;
+                      break;
+                    }
+                    case 7: {
+                      i = c[w >> 2] | 0;
+                      if (!i) m = 275;
+                      else {
+                        yb[i & 15](c[ra >> 2] | 0, c[z >> 2] | 0, c[x >> 2] | 0, c[C >> 2] | 0, 1);
+                        c[z >> 2] = 0;
+                        mZ(y);
+                        i = o;
+                      }
+                      break;
+                    }
+                    case 57: {
+                      i = kZ(b, 1, n, c[Da >> 2] | 0) | 0;
+                      if (i | 0) {
+                        m = 280;
+                        break a;
+                      }
+                      i = c[s >> 2] | 0;
+                      break;
+                    }
+                    case 6: {
+                      a[D >> 0] = 0;
+                      m = nZ(b, E, 75395, 36) | 0;
+                      c[F >> 2] = m;
+                      if (!m) {
+                        i = 1;
+                        m = 280;
+                        break a;
+                      }
+                      a[ta >> 0] = 1;
+                      if (!(c[w >> 2] | 0)) m = 33;
+                      else {
+                        if (!(ob[c[(o + 52) >> 2] & 127](o, n, c[Da >> 2] | 0, p) | 0)) {
+                          i = 32;
+                          m = 280;
+                          break a;
+                        }
+                        i = c[(o + 64) >> 2] | 0;
+                        i = lZ(y, o, (n + i) | 0, ((c[Da >> 2] | 0) + (0 - i)) | 0) | 0;
+                        if (!i) {
+                          i = 1;
+                          m = 280;
+                          break a;
+                        }
+                        oZ(i);
+                        c[B >> 2] = c[A >> 2];
+                        c[C >> 2] = i;
+                        i = 0;
+                        m = 34;
+                      }
+                      break;
+                    }
+                    case 14: {
+                      m = 33;
+                      break;
+                    }
+                    case 8: {
+                      i = c[z >> 2] | 0;
+                      if (!i) i = 1;
+                      else {
+                        yb[c[w >> 2] & 15](c[ra >> 2] | 0, i, c[x >> 2] | 0, c[C >> 2] | 0, 0);
+                        mZ(y);
+                        i = 0;
+                      }
+                      if (!((c[x >> 2] | 0) == 0 ? !(a[D >> 0] | 0) : 0)) {
+                        f = a[ta >> 0] | 0;
+                        a[ta >> 0] = 1;
+                        do
+                          if (c[M >> 2] | 0 ? c[va >> 2] | 0 : 0) {
+                            h = nZ(b, E, 75395, 36) | 0;
+                            if (!h) {
+                              i = 1;
+                              m = 280;
+                              break a;
+                            }
+                            if (!(a[D >> 0] | 0)) e = (h + 20) | 0;
+                            else {
+                              e = (h + 20) | 0;
+                              c[e >> 2] = c[Aa >> 2];
+                            }
+                            a[wa >> 0] = 0;
+                            if (
+                              !(
+                                pb[c[va >> 2] & 127](
+                                  c[xa >> 2] | 0,
+                                  0,
+                                  c[e >> 2] | 0,
+                                  c[(h + 16) >> 2] | 0,
+                                  c[(h + 24) >> 2] | 0
+                                ) | 0
+                              )
+                            ) {
+                              i = 21;
+                              m = 280;
+                              break a;
+                            }
+                            if (!(a[wa >> 0] | 0)) {
+                              if (c[x >> 2] | 0) break;
+                              a[ta >> 0] = f;
+                              break;
+                            }
+                            if (
+                              ((a[ya >> 0] | 0) == 0 ? ((oa = c[za >> 2] | 0), oa | 0) : 0)
+                                ? (kb[oa & 63](c[ra >> 2] | 0) | 0) == 0
+                                : 0
+                            ) {
+                              i = 22;
+                              m = 280;
+                              break a;
+                            }
+                          }
+                        while (0);
+                        a[D >> 0] = 0;
+                      }
+                      e = c[L >> 2] | 0;
+                      if (!e) m = 274;
+                      else {
+                        tb[e & 127](c[ra >> 2] | 0);
+                        i = o;
+                      }
+                      break;
+                    }
+                    case 34: {
+                      m = qZ(b, o, n, c[Da >> 2] | 0) | 0;
+                      c[N >> 2] = m;
+                      if (!m) {
+                        i = 1;
+                        m = 280;
+                        break a;
+                      } else m = 80;
+                      break;
+                    }
+                    case 22: {
+                      m = rZ(b, o, n, c[Da >> 2] | 0) | 0;
+                      c[P >> 2] = m;
+                      if (!m) {
+                        i = 1;
+                        m = 280;
+                        break a;
+                      }
+                      a[Q >> 0] = 0;
+                      c[R >> 2] = 0;
+                      a[S >> 0] = 0;
+                      m = 80;
+                      break;
+                    }
+                    case 23: {
+                      a[Q >> 0] = 1;
+                      c[R >> 2] = 142188;
+                      m = 80;
+                      break;
+                    }
+                    case 24: {
+                      a[S >> 0] = 1;
+                      c[R >> 2] = 142194;
+                      m = 80;
+                      break;
+                    }
+                    case 25: {
+                      c[R >> 2] = 142197;
+                      m = 80;
+                      break;
+                    }
+                    case 26: {
+                      c[R >> 2] = 142203;
+                      m = 80;
+                      break;
+                    }
+                    case 27: {
+                      c[R >> 2] = 142210;
+                      m = 80;
+                      break;
+                    }
+                    case 28: {
+                      c[R >> 2] = 142217;
+                      m = 80;
+                      break;
+                    }
+                    case 29: {
+                      c[R >> 2] = 142226;
+                      m = 80;
+                      break;
+                    }
+                    case 30: {
+                      c[R >> 2] = 142234;
+                      m = 80;
+                      break;
+                    }
+                    case 32:
+                    case 31: {
+                      if ((a[G >> 0] | 0) != 0 ? (c[O >> 2] | 0) != 0 : 0) {
+                        if (!(sZ(y, (c[R >> 2] | 0) == 0 ? ((h | 0) == 32 ? 142243 : 142253) : 142255) | 0)) {
+                          i = 1;
+                          m = 280;
+                          break a;
+                        }
+                        if (!(tZ(y, o, n, c[Da >> 2] | 0) | 0)) {
+                          i = 1;
+                          m = 280;
+                          break a;
+                        }
+                        c[R >> 2] = c[B >> 2];
+                        i = o;
+                      } else m = 275;
+                      break;
+                    }
+                    case 36:
+                    case 35: {
+                      if (a[G >> 0] | 0) {
+                        if (!(uZ(c[N >> 2] | 0, c[P >> 2] | 0, a[Q >> 0] | 0, a[S >> 0] | 0, 0, b) | 0)) {
+                          i = 1;
+                          m = 280;
+                          break a;
+                        }
+                        if ((c[O >> 2] | 0) != 0 ? ((qa = c[R >> 2] | 0), (qa | 0) != 0) : 0) {
+                          switch (a[qa >> 0] | 0) {
+                            case 40: {
+                              m = 93;
+                              break;
+                            }
+                            case 78: {
+                              if ((a[(qa + 1) >> 0] | 0) == 79) m = 93;
+                              break;
+                            }
+                            default: {
+                            }
+                          }
+                          if ((m | 0) == 93) {
+                            m = 0;
+                            i = c[A >> 2] | 0;
+                            if ((i | 0) == (c[T >> 2] | 0)) {
+                              if (!(((vZ(y) | 0) << 24) >> 24)) {
+                                i = 1;
+                                m = 280;
+                                break a;
+                              }
+                              i = c[A >> 2] | 0;
+                            }
+                            c[A >> 2] = i + 1;
+                            a[i >> 0] = 41;
+                            i = c[A >> 2] | 0;
+                            if ((i | 0) == (c[T >> 2] | 0)) {
+                              if (!(((vZ(y) | 0) << 24) >> 24)) {
+                                i = 1;
+                                m = 280;
+                                break a;
+                              }
+                              i = c[A >> 2] | 0;
+                            }
+                            c[A >> 2] = i + 1;
+                            a[i >> 0] = 0;
+                            c[R >> 2] = c[B >> 2];
+                            c[B >> 2] = c[A >> 2];
+                          }
+                          c[q >> 2] = n;
+                          zb[c[O >> 2] & 15](
+                            c[ra >> 2] | 0,
+                            c[c[N >> 2] >> 2] | 0,
+                            c[c[P >> 2] >> 2] | 0,
+                            c[R >> 2] | 0,
+                            0,
+                            ((h | 0) == 36) & 1
+                          );
+                          mZ(y);
+                          i = o;
+                        } else m = 275;
+                      } else m = 275;
+                      break;
+                    }
+                    case 38:
+                    case 37: {
+                      if (a[G >> 0] | 0) {
+                        i = c[(o + 64) >> 2] | 0;
+                        i = wZ(b, o, a[Q >> 0] | 0, (n + i) | 0, ((c[Da >> 2] | 0) + (0 - i)) | 0, H) | 0;
+                        if (i | 0) {
+                          m = 280;
+                          break a;
+                        }
+                        e = c[J >> 2] | 0;
+                        c[J >> 2] = c[I >> 2];
+                        if (!(uZ(c[N >> 2] | 0, c[P >> 2] | 0, a[Q >> 0] | 0, 0, e, b) | 0)) {
+                          i = 1;
+                          m = 280;
+                          break a;
+                        }
+                        if ((c[O >> 2] | 0) != 0 ? ((sa = c[R >> 2] | 0), (sa | 0) != 0) : 0) {
+                          switch (a[sa >> 0] | 0) {
+                            case 40: {
+                              m = 108;
+                              break;
+                            }
+                            case 78: {
+                              if ((a[(sa + 1) >> 0] | 0) == 79) m = 108;
+                              break;
+                            }
+                            default: {
+                            }
+                          }
+                          if ((m | 0) == 108) {
+                            m = 0;
+                            i = c[A >> 2] | 0;
+                            if ((i | 0) == (c[T >> 2] | 0)) {
+                              if (!(((vZ(y) | 0) << 24) >> 24)) {
+                                i = 1;
+                                m = 280;
+                                break a;
+                              }
+                              i = c[A >> 2] | 0;
+                            }
+                            c[A >> 2] = i + 1;
+                            a[i >> 0] = 41;
+                            i = c[A >> 2] | 0;
+                            if ((i | 0) == (c[T >> 2] | 0)) {
+                              if (!(((vZ(y) | 0) << 24) >> 24)) {
+                                i = 1;
+                                m = 280;
+                                break a;
+                              }
+                              i = c[A >> 2] | 0;
+                            }
+                            c[A >> 2] = i + 1;
+                            a[i >> 0] = 0;
+                            c[R >> 2] = c[B >> 2];
+                            c[B >> 2] = c[A >> 2];
+                          }
+                          c[q >> 2] = n;
+                          zb[c[O >> 2] & 15](
+                            c[ra >> 2] | 0,
+                            c[c[N >> 2] >> 2] | 0,
+                            c[c[P >> 2] >> 2] | 0,
+                            c[R >> 2] | 0,
+                            e,
+                            ((h | 0) == 38) & 1
+                          );
+                          mZ(y);
+                          i = o;
+                        } else m = 275;
+                      } else m = 275;
+                      break;
+                    }
+                    case 12: {
+                      if (a[G >> 0] | 0) {
+                        i = c[(o + 64) >> 2] | 0;
+                        i = xZ(b, o, (n + i) | 0, ((c[Da >> 2] | 0) + (0 - i)) | 0) | 0;
+                        e = c[F >> 2] | 0;
+                        f = c[U >> 2] | 0;
+                        if (e) {
+                          c[(e + 4) >> 2] = f;
+                          c[((c[F >> 2] | 0) + 8) >> 2] = (c[V >> 2] | 0) - (c[U >> 2] | 0);
+                          c[U >> 2] = c[V >> 2];
+                          if (!(c[K >> 2] | 0)) e = 1;
+                          else {
+                            c[q >> 2] = n;
+                            e = c[F >> 2] | 0;
+                            Ab[c[K >> 2] & 0](
+                              c[ra >> 2] | 0,
+                              c[e >> 2] | 0,
+                              d[(e + 33) >> 0] | 0,
+                              c[(e + 4) >> 2] | 0,
+                              c[(e + 8) >> 2] | 0,
+                              c[Aa >> 2] | 0,
+                              0,
+                              0,
+                              0
+                            );
+                            e = 0;
+                          }
+                        } else {
+                          c[V >> 2] = f;
+                          e = 1;
+                        }
+                        if (!i) {
+                          i = e;
+                          m = 274;
+                        } else {
+                          m = 280;
+                          break a;
+                        }
+                      } else m = 275;
+                      break;
+                    }
+                    case 5: {
+                      a[D >> 0] = 0;
+                      a[ta >> 0] = 1;
+                      if (!(c[w >> 2] | 0)) {
+                        c[x >> 2] = 75395;
+                        i = 1;
+                      } else {
+                        m = c[(o + 64) >> 2] | 0;
+                        m = lZ(y, o, (n + m) | 0, ((c[Da >> 2] | 0) + (0 - m)) | 0) | 0;
+                        c[x >> 2] = m;
+                        if (!m) {
+                          i = 1;
+                          m = 280;
+                          break a;
+                        }
+                        c[B >> 2] = c[A >> 2];
+                        i = 0;
+                      }
+                      if (
+                        (((a[ya >> 0] | 0) == 0 ? (c[M >> 2] | 0) == 0 : 0) ? ((ua = c[za >> 2] | 0), ua | 0) : 0)
+                          ? (kb[ua & 63](c[ra >> 2] | 0) | 0) == 0
+                          : 0
+                      ) {
+                        i = 22;
+                        m = 280;
+                        break a;
+                      }
+                      if (!(c[F >> 2] | 0)) {
+                        e = nZ(b, E, 75395, 36) | 0;
+                        c[F >> 2] = e;
+                        if (!e) {
+                          i = 1;
+                          m = 280;
+                          break a;
+                        }
+                        c[(e + 24) >> 2] = 0;
+                        m = 133;
+                      } else m = 133;
+                      break;
+                    }
+                    case 13: {
+                      i = 1;
+                      m = 133;
+                      break;
+                    }
+                    case 15: {
+                      if (((a[G >> 0] | 0) != 0 ? (c[F >> 2] | 0) != 0 : 0) ? (c[K >> 2] | 0) != 0 : 0) {
+                        c[q >> 2] = n;
+                        i = c[F >> 2] | 0;
+                        Ab[c[K >> 2] & 0](
+                          c[ra >> 2] | 0,
+                          c[i >> 2] | 0,
+                          d[(i + 33) >> 0] | 0,
+                          0,
+                          0,
+                          c[(i + 20) >> 2] | 0,
+                          c[(i + 16) >> 2] | 0,
+                          c[(i + 24) >> 2] | 0,
+                          0
+                        );
+                        i = o;
+                      } else m = 275;
+                      break;
+                    }
+                    case 16: {
+                      if ((a[G >> 0] | 0) != 0 ? (c[F >> 2] | 0) != 0 : 0) {
+                        h = lZ(H, o, n, c[Da >> 2] | 0) | 0;
+                        c[((c[F >> 2] | 0) + 28) >> 2] = h;
+                        if (!(c[((c[F >> 2] | 0) + 28) >> 2] | 0)) {
+                          i = 1;
+                          m = 280;
+                          break a;
+                        }
+                        c[J >> 2] = c[I >> 2];
+                        if (c[W >> 2] | 0) {
+                          c[q >> 2] = n;
+                          i = c[F >> 2] | 0;
+                          zb[c[W >> 2] & 15](
+                            c[ra >> 2] | 0,
+                            c[i >> 2] | 0,
+                            c[(i + 20) >> 2] | 0,
+                            c[(i + 16) >> 2] | 0,
+                            c[(i + 24) >> 2] | 0,
+                            c[(i + 28) >> 2] | 0
+                          );
+                          i = o;
+                          break c;
+                        }
+                        if (c[K >> 2] | 0) {
+                          c[q >> 2] = n;
+                          i = c[F >> 2] | 0;
+                          Ab[c[K >> 2] & 0](
+                            c[ra >> 2] | 0,
+                            c[i >> 2] | 0,
+                            0,
+                            0,
+                            0,
+                            c[(i + 20) >> 2] | 0,
+                            c[(i + 16) >> 2] | 0,
+                            c[(i + 24) >> 2] | 0,
+                            c[(i + 28) >> 2] | 0
+                          );
+                          i = o;
+                        } else m = 275;
+                      } else m = 275;
+                      break;
+                    }
+                    case 9: {
+                      if (nb[c[(o + 44) >> 2] & 63](o, n, c[Da >> 2] | 0) | 0) {
+                        c[F >> 2] = 0;
+                        m = 275;
+                        break c;
+                      }
+                      if (!(a[G >> 0] | 0)) {
+                        c[I >> 2] = c[J >> 2];
+                        c[F >> 2] = 0;
+                        m = 275;
+                        break c;
+                      }
+                      i = lZ(H, o, n, c[Da >> 2] | 0) | 0;
+                      if (!i) {
+                        i = 1;
+                        m = 280;
+                        break a;
+                      }
+                      e = nZ(b, r, i, 36) | 0;
+                      c[F >> 2] = e;
+                      if (!e) {
+                        i = 1;
+                        m = 280;
+                        break a;
+                      }
+                      if ((c[e >> 2] | 0) != (i | 0)) {
+                        c[I >> 2] = c[J >> 2];
+                        c[F >> 2] = 0;
+                        m = 275;
+                        break c;
+                      }
+                      c[J >> 2] = c[I >> 2];
+                      c[((c[F >> 2] | 0) + 24) >> 2] = 0;
+                      a[((c[F >> 2] | 0) + 33) >> 0] = 0;
+                      if (!(c[X >> 2] | 0)) i = (c[na >> 2] | 0) != 0;
+                      else i = 1;
+                      a[((c[F >> 2] | 0) + 34) >> 0] = (i ^ 1) & 1;
+                      if (!(c[K >> 2] | 0)) m = 275;
+                      else i = o;
+                      break;
+                    }
+                    case 10: {
+                      if (!(a[G >> 0] | 0)) {
+                        c[I >> 2] = c[J >> 2];
+                        c[F >> 2] = 0;
+                        m = 275;
+                        break c;
+                      }
+                      i = lZ(H, o, n, c[Da >> 2] | 0) | 0;
+                      if (!i) {
+                        i = 1;
+                        m = 280;
+                        break a;
+                      }
+                      e = nZ(b, E, i, 36) | 0;
+                      c[F >> 2] = e;
+                      if (!e) {
+                        i = 1;
+                        m = 280;
+                        break a;
+                      }
+                      if ((c[e >> 2] | 0) != (i | 0)) {
+                        c[I >> 2] = c[J >> 2];
+                        c[F >> 2] = 0;
+                        m = 275;
+                        break c;
+                      }
+                      c[J >> 2] = c[I >> 2];
+                      c[((c[F >> 2] | 0) + 24) >> 2] = 0;
+                      a[((c[F >> 2] | 0) + 33) >> 0] = 1;
+                      if (!(c[X >> 2] | 0)) i = (c[na >> 2] | 0) != 0;
+                      else i = 1;
+                      a[((c[F >> 2] | 0) + 34) >> 0] = (i ^ 1) & 1;
+                      if (!(c[K >> 2] | 0)) m = 275;
+                      else i = o;
+                      break;
+                    }
+                    case 18: {
+                      c[Y >> 2] = 0;
+                      c[Z >> 2] = 0;
+                      if (!(c[_ >> 2] | 0)) m = 275;
+                      else {
+                        n = lZ(y, o, n, c[Da >> 2] | 0) | 0;
+                        c[Z >> 2] = n;
+                        if (!n) {
+                          i = 1;
+                          m = 280;
+                          break a;
+                        }
+                        c[B >> 2] = c[A >> 2];
+                        i = o;
+                      }
+                      break;
+                    }
+                    case 21: {
+                      if (!(ob[c[(o + 52) >> 2] & 127](o, n, c[Da >> 2] | 0, p) | 0)) {
+                        i = 32;
+                        m = 280;
+                        break a;
+                      }
+                      if (!(c[Z >> 2] | 0)) m = 275;
+                      else {
+                        i = c[(o + 64) >> 2] | 0;
+                        i = lZ(y, o, (n + i) | 0, ((c[Da >> 2] | 0) + (0 - i)) | 0) | 0;
+                        if (!i) {
+                          i = 1;
+                          m = 280;
+                          break a;
+                        }
+                        oZ(i);
+                        c[Y >> 2] = i;
+                        c[B >> 2] = c[A >> 2];
+                        i = o;
+                      }
+                      break;
+                    }
+                    case 19: {
+                      if ((c[Z >> 2] | 0) != 0 ? (c[_ >> 2] | 0) != 0 : 0) {
+                        i = c[(o + 64) >> 2] | 0;
+                        i = lZ(y, o, (n + i) | 0, ((c[Da >> 2] | 0) + (0 - i)) | 0) | 0;
+                        if (!i) {
+                          i = 1;
+                          m = 280;
+                          break a;
+                        }
+                        c[q >> 2] = n;
+                        yb[c[_ >> 2] & 15](c[ra >> 2] | 0, c[Z >> 2] | 0, c[Aa >> 2] | 0, i, c[Y >> 2] | 0);
+                        i = 0;
+                      } else i = 1;
+                      mZ(y);
+                      m = 274;
+                      break;
+                    }
+                    case 20: {
+                      if ((c[Y >> 2] | 0) != 0 ? (c[_ >> 2] | 0) != 0 : 0) {
+                        c[q >> 2] = n;
+                        yb[c[_ >> 2] & 15](c[ra >> 2] | 0, c[Z >> 2] | 0, c[Aa >> 2] | 0, 0, c[Y >> 2] | 0);
+                        i = 0;
+                      } else i = 1;
+                      mZ(y);
+                      m = 274;
+                      break;
+                    }
+                    case 58: {
+                      if (c[u >> 2] | 0) yZ(b, o, n, c[Da >> 2] | 0);
+                      i = zZ(b, o, Da, g, j, k) | 0;
+                      if (i | 0) {
+                        m = 280;
+                        break a;
+                      }
+                      if (!(c[Da >> 2] | 0)) {
+                        m = 189;
+                        break a;
+                      } else i = o;
+                      break;
+                    }
+                    case 44: {
+                      i = c[aa >> 2] | 0;
+                      do
+                        if ((c[$ >> 2] | 0) >>> 0 >= i >>> 0) {
+                          if (!i) {
+                            h = c[ha >> 2] | 0;
+                            c[aa >> 2] = 32;
+                            h = kb[h & 63](32) | 0;
+                            c[ba >> 2] = h;
+                            if (!h) {
+                              m = 198;
+                              break a;
+                            } else break;
+                          }
+                          f = c[ia >> 2] | 0;
+                          h = c[ba >> 2] | 0;
+                          i = i << 1;
+                          c[aa >> 2] = i;
+                          i = lb[f & 127](h, i) | 0;
+                          if (!i) {
+                            m = 193;
+                            break a;
+                          }
+                          c[ba >> 2] = i;
+                          i = c[da >> 2] | 0;
+                          if (i | 0) {
+                            i = lb[c[ia >> 2] & 127](i, c[aa >> 2] << 2) | 0;
+                            if (!i) {
+                              i = 1;
+                              m = 280;
+                              break a;
+                            }
+                            c[da >> 2] = i;
+                          }
+                        }
+                      while (0);
+                      a[((c[ba >> 2] | 0) + (c[$ >> 2] | 0)) >> 0] = 0;
+                      if (a[ca >> 0] | 0) {
+                        i = BZ(b) | 0;
+                        if ((i | 0) < 0) {
+                          i = 1;
+                          m = 280;
+                          break a;
+                        }
+                        c[((c[da >> 2] | 0) + (c[ea >> 2] << 2)) >> 2] = i;
+                        c[ea >> 2] = (c[ea >> 2] | 0) + 1;
+                        c[((c[fa >> 2] | 0) + ((i * 28) | 0)) >> 2] = 6;
+                        if (c[ga >> 2] | 0) i = o;
+                        else m = 275;
+                      } else m = 275;
+                      break;
+                    }
+                    case 50: {
+                      i = ((c[ba >> 2] | 0) + (c[$ >> 2] | 0)) | 0;
+                      if ((a[i >> 0] | 0) == 124) {
+                        i = 2;
+                        m = 280;
+                        break a;
+                      }
+                      a[i >> 0] = 44;
+                      if ((a[ca >> 0] | 0) != 0 ? (c[ga >> 2] | 0) != 0 : 0) i = o;
+                      else m = 275;
+                      break;
+                    }
+                    case 49: {
+                      f = c[ba >> 2] | 0;
+                      e = c[$ >> 2] | 0;
+                      i = a[(f + e) >> 0] | 0;
+                      if ((i << 24) >> 24 == 44) {
+                        i = 2;
+                        m = 280;
+                        break a;
+                      }
+                      if (
+                        ((i << 24) >> 24 == 0) & ((a[ca >> 0] | 0) != 0)
+                          ? ((Ba =
+                              ((c[fa >> 2] | 0) +
+                                (((c[((c[da >> 2] | 0) + (((c[ea >> 2] | 0) + -1) << 2)) >> 2] | 0) * 28) | 0)) |
+                              0),
+                            (c[Ba >> 2] | 0) != 3)
+                          : 0
+                      ) {
+                        c[Ba >> 2] = 5;
+                        i = ((c[ga >> 2] | 0) == 0) & 1;
+                        f = c[ba >> 2] | 0;
+                        e = c[$ >> 2] | 0;
+                      } else i = 1;
+                      a[(f + e) >> 0] = 124;
+                      m = 274;
+                      break;
+                    }
+                    case 59:
+                    case 60: {
+                      a[ta >> 0] = 1;
+                      if (c[M >> 2] | 0) {
+                        e = c[(o + 64) >> 2] | 0;
+                        e = lZ(H, o, (n + e) | 0, ((c[Da >> 2] | 0) + (0 - e)) | 0) | 0;
+                        if (!e) {
+                          i = 1;
+                          m = 280;
+                          break a;
+                        }
+                        f = nZ(b, E, e, 0) | 0;
+                        c[I >> 2] = c[J >> 2];
+                        do
+                          if (c[ja >> 2] | 0) {
+                            if (!(a[ya >> 0] | 0)) {
+                              if (a[ta >> 0] | 0) {
+                                m = 219;
+                                break;
+                              }
+                            } else if (c[na >> 2] | 0) {
+                              m = 219;
+                              break;
+                            }
+                            if (!f) {
+                              i = 11;
+                              m = 280;
+                              break a;
+                            }
+                            if (!(a[(f + 34) >> 0] | 0)) {
+                              i = 24;
+                              m = 280;
+                              break a;
+                            }
+                          } else m = 219;
+                        while (0);
+                        if ((m | 0) == 219 ? ((m = 0), (f | 0) == 0) : 0) {
+                          a[G >> 0] = a[ya >> 0] | 0;
+                          if ((h | 0) != 60) {
+                            m = 275;
+                            break c;
+                          }
+                          i = c[ka >> 2] | 0;
+                          if (!i) {
+                            m = 275;
+                            break c;
+                          }
+                          vb[i & 127](c[ra >> 2] | 0, e, 1);
+                          i = o;
+                          break c;
+                        }
+                        i = (f + 32) | 0;
+                        if (a[i >> 0] | 0) {
+                          i = 12;
+                          m = 280;
+                          break a;
+                        }
+                        if (c[(f + 4) >> 2] | 0) {
+                          i = CZ(b, f, ((h | 0) == 60) & 1) | 0;
+                          e = (i | 0) == 0;
+                          if (e) {
+                            i = (e ^ 1) & 1;
+                            m = 274;
+                            break c;
+                          } else {
+                            m = 280;
+                            break a;
+                          }
+                        }
+                        if (!(c[va >> 2] | 0)) {
+                          a[G >> 0] = a[ya >> 0] | 0;
+                          m = 275;
+                          break c;
+                        }
+                        a[wa >> 0] = 0;
+                        a[i >> 0] = 1;
+                        h =
+                          (pb[c[va >> 2] & 127](
+                            c[xa >> 2] | 0,
+                            0,
+                            c[(f + 20) >> 2] | 0,
+                            c[(f + 16) >> 2] | 0,
+                            c[(f + 24) >> 2] | 0
+                          ) |
+                            0) ==
+                          0;
+                        a[i >> 0] = 0;
+                        if (h) {
+                          i = 21;
+                          m = 280;
+                          break a;
+                        }
+                        e = a[ya >> 0] | 0;
+                        if (!(a[wa >> 0] | 0)) {
+                          a[G >> 0] = e;
+                          i = o;
+                          break c;
+                        } else i = 0;
+                      } else {
+                        e = a[ya >> 0] | 0;
+                        a[G >> 0] = e;
+                        i = 1;
+                      }
+                      if (
+                        ((e << 24) >> 24 == 0 ? ((Ca = c[za >> 2] | 0), (Ca | 0) != 0) : 0)
+                          ? (kb[Ca & 63](c[ra >> 2] | 0) | 0) == 0
+                          : 0
+                      ) {
+                        i = 22;
+                        m = 280;
+                        break a;
+                      } else m = 274;
+                      break;
+                    }
+                    case 40: {
+                      if (!(c[ga >> 2] | 0)) m = 275;
+                      else {
+                        n = qZ(b, o, n, c[Da >> 2] | 0) | 0;
+                        c[N >> 2] = n;
+                        if (!n) {
+                          i = 1;
+                          m = 280;
+                          break a;
+                        }
+                        c[ea >> 2] = 0;
+                        c[la >> 2] = 0;
+                        a[ca >> 0] = 1;
+                        i = o;
+                      }
+                      break;
+                    }
+                    case 42:
+                    case 41: {
+                      if (!(a[ca >> 0] | 0)) m = 275;
+                      else {
+                        if (!(c[ga >> 2] | 0)) i = 1;
+                        else {
+                          i = kb[c[ha >> 2] & 63](20) | 0;
+                          if (!i) {
+                            i = 1;
+                            m = 280;
+                            break a;
+                          }
+                          m = (i + 4) | 0;
+                          c[m >> 2] = 0;
+                          c[(m + 4) >> 2] = 0;
+                          c[(m + 8) >> 2] = 0;
+                          c[(m + 12) >> 2] = 0;
+                          c[i >> 2] = (h | 0) == 41 ? 2 : 1;
+                          c[q >> 2] = n;
+                          vb[c[ga >> 2] & 127](c[ra >> 2] | 0, c[c[N >> 2] >> 2] | 0, i);
+                          i = 0;
+                        }
+                        a[ca >> 0] = 0;
+                        m = 274;
+                      }
+                      break;
+                    }
+                    case 43: {
+                      if (
+                        (a[ca >> 0] | 0) != 0
+                          ? ((c[
+                              ((c[fa >> 2] | 0) +
+                                (((c[((c[da >> 2] | 0) + (((c[ea >> 2] | 0) + -1) << 2)) >> 2] | 0) * 28) | 0)) >>
+                                2
+                            ] = 3),
+                            (c[ga >> 2] | 0) != 0)
+                          : 0
+                      )
+                        i = o;
+                      else m = 275;
+                      break;
+                    }
+                    case 51: {
+                      e = 0;
+                      m = 247;
+                      break;
+                    }
+                    case 53: {
+                      e = 1;
+                      m = 247;
+                      break;
+                    }
+                    case 52: {
+                      e = 2;
+                      m = 247;
+                      break;
+                    }
+                    case 54: {
+                      e = 3;
+                      m = 247;
+                      break;
+                    }
+                    case 45: {
+                      f = 0;
+                      m = 258;
+                      break;
+                    }
+                    case 47: {
+                      f = 1;
+                      m = 258;
+                      break;
+                    }
+                    case 46: {
+                      f = 2;
+                      m = 258;
+                      break;
+                    }
+                    case 48: {
+                      f = 3;
+                      m = 258;
+                      break;
+                    }
+                    case 55: {
+                      if (!(EZ(b, o, n, c[Da >> 2] | 0) | 0)) {
+                        i = 1;
+                        m = 280;
+                        break a;
+                      } else i = o;
+                      break;
+                    }
+                    case 56: {
+                      if (!(FZ(b, o, n, c[Da >> 2] | 0) | 0)) {
+                        i = 1;
+                        m = 280;
+                        break a;
+                      } else i = o;
+                      break;
+                    }
+                    case 0: {
+                      if ((e | 0) == 14) i = o;
+                      else m = 275;
+                      break;
+                    }
+                    case 3: {
+                      if (!(c[w >> 2] | 0)) m = 275;
+                      else i = o;
+                      break;
+                    }
+                    case 11: {
+                      if ((a[G >> 0] | 0) != 0 ? (c[K >> 2] | 0) != 0 : 0) i = o;
+                      else m = 275;
+                      break;
+                    }
+                    case 17: {
+                      if (!(c[_ >> 2] | 0)) m = 275;
+                      else i = o;
+                      break;
+                    }
+                    case 33: {
+                      if ((a[G >> 0] | 0) != 0 ? (c[O >> 2] | 0) != 0 : 0) i = o;
+                      else m = 275;
+                      break;
+                    }
+                    case 39: {
+                      if (!(c[ga >> 2] | 0)) m = 275;
+                      else i = o;
+                      break;
+                    }
+                    default:
+                      m = 275;
+                  }
+                while (0);
+                if ((m | 0) == 33)
+                  if (!(ob[c[(o + 52) >> 2] & 127](o, n, c[Da >> 2] | 0, p) | 0)) {
+                    i = 32;
+                    m = 280;
+                    break;
+                  } else {
+                    i = 1;
+                    m = 34;
+                  }
+                else if ((m | 0) == 80) {
+                  m = 0;
+                  if ((a[G >> 0] | 0) != 0 ? (c[O >> 2] | 0) != 0 : 0) i = o;
+                  else m = 275;
+                } else if ((m | 0) == 133) {
+                  m = 0;
+                  if ((a[G >> 0] | 0) != 0 ? (c[F >> 2] | 0) != 0 : 0) {
+                    e = c[(o + 64) >> 2] | 0;
+                    e = lZ(H, o, (n + e) | 0, ((c[Da >> 2] | 0) + (0 - e)) | 0) | 0;
+                    c[((c[F >> 2] | 0) + 16) >> 2] = e;
+                    e = c[F >> 2] | 0;
+                    if (!(c[(e + 16) >> 2] | 0)) {
+                      i = 1;
+                      m = 280;
+                      break;
+                    }
+                    c[(e + 20) >> 2] = c[Aa >> 2];
+                    c[J >> 2] = c[I >> 2];
+                    if (((h | 0) == 13) & ((c[K >> 2] | 0) != 0)) i = o;
+                    else m = 274;
+                  } else m = 274;
+                } else if ((m | 0) == 247) {
+                  m = 0;
+                  if (a[ca >> 0] | 0) {
+                    i = c[Da >> 2] | 0;
+                    if (e) i = (i + (0 - (c[(o + 64) >> 2] | 0))) | 0;
+                    f = BZ(b) | 0;
+                    if ((f | 0) < 0) {
+                      i = 1;
+                      m = 280;
+                      break;
+                    }
+                    c[((c[fa >> 2] | 0) + ((f * 28) | 0)) >> 2] = 4;
+                    c[((c[fa >> 2] | 0) + ((f * 28) | 0) + 4) >> 2] = e;
+                    i = qZ(b, o, n, i) | 0;
+                    if (!i) {
+                      i = 1;
+                      m = 280;
+                      break;
+                    }
+                    e = c[i >> 2] | 0;
+                    c[((c[fa >> 2] | 0) + ((f * 28) | 0) + 8) >> 2] = e;
+                    i = 0;
+                    do {
+                      h = i;
+                      i = (i + 1) | 0;
+                    } while ((a[(e + h) >> 0] | 0) != 0);
+                    c[ma >> 2] = (c[ma >> 2] | 0) + i;
+                    if (c[ga >> 2] | 0) i = o;
+                    else m = 275;
+                  } else m = 275;
+                } else if ((m | 0) == 258)
+                  if (a[ca >> 0] | 0) {
+                    e = (c[ga >> 2] | 0) == 0;
+                    i = e & 1;
+                    m = ((c[ea >> 2] | 0) + -1) | 0;
+                    c[ea >> 2] = m;
+                    c[((c[fa >> 2] | 0) + (((c[((c[da >> 2] | 0) + (m << 2)) >> 2] | 0) * 28) | 0) + 4) >> 2] = f;
+                    if (!(c[ea >> 2] | 0)) {
+                      if (!e) {
+                        e = DZ(b) | 0;
+                        if (!e) {
+                          i = 1;
+                          m = 280;
+                          break;
+                        }
+                        c[q >> 2] = n;
+                        vb[c[ga >> 2] & 127](c[ra >> 2] | 0, c[c[N >> 2] >> 2] | 0, e);
+                      }
+                      a[ca >> 0] = 0;
+                      c[ma >> 2] = 0;
+                      m = 274;
+                    } else m = 274;
+                  } else m = 275;
+                if ((m | 0) == 34) {
+                  m = 0;
+                  if ((a[G >> 0] | 0) != 0 ? (c[F >> 2] | 0) != 0 : 0) {
+                    e = c[(o + 64) >> 2] | 0;
+                    e = lZ(H, o, (n + e) | 0, ((c[Da >> 2] | 0) + (0 - e)) | 0) | 0;
+                    if (!e) {
+                      i = 1;
+                      m = 280;
+                      break;
+                    }
+                    oZ(e);
+                    c[((c[F >> 2] | 0) + 24) >> 2] = e;
+                    c[J >> 2] = c[I >> 2];
+                    if (((h | 0) == 14) & ((c[K >> 2] | 0) != 0)) i = o;
+                    else m = 274;
+                  } else m = 274;
+                }
+                if ((m | 0) == 274) {
+                  m = 0;
+                  if (!((i << 24) >> 24)) i = o;
+                  else m = 275;
+                }
+                if ((m | 0) == 275) {
+                  m = 0;
+                  if (!(c[u >> 2] | 0)) i = o;
+                  else {
+                    yZ(b, o, n, c[Da >> 2] | 0);
+                    i = o;
+                  }
+                }
+                switch (c[v >> 2] | 0) {
+                  case 3: {
+                    m = 278;
+                    break a;
+                  }
+                  case 2: {
+                    i = 35;
+                    m = 280;
+                    break a;
+                  }
+                  default: {
+                  }
+                }
+                e = c[Da >> 2] | 0;
+                o = i;
+                n = e;
+                e = ob[c[i >> 2] & 127](i, e, g, Da) | 0;
+              }
+              d: switch (m | 0) {
+                case 7: {
+                  c[j >> 2] = n;
+                  i = 0;
+                  break;
+                }
+                case 9: {
+                  c[p >> 2] = f;
+                  i = 4;
+                  break;
+                }
+                case 10: {
+                  i = (o | 0) == (c[s >> 2] | 0);
+                  if (!i ? (a[((c[na >> 2] | 0) + 20) >> 0] | 0) == 0 : 0) {
+                    c[j >> 2] = n;
+                    i = 0;
+                    break;
+                  }
+                  if (((a[(b + 484) >> 0] | 0) != 0) | (i ^ 1))
+                    if ((pb[c[pa >> 2] & 127](pa, -4, g, g, o) | 0) == -1) i = 29;
+                    else {
+                      c[j >> 2] = n;
+                      i = 0;
+                    }
+                  else i = 3;
+                  break;
+                }
+                case 58: {
+                  do
+                    if (
+                      (a[D >> 0] | 0 ? ((Ea = a[ta >> 0] | 0), (a[ta >> 0] = 1), c[M >> 2] | 0) : 0)
+                        ? c[va >> 2] | 0
+                        : 0
+                    ) {
+                      i = nZ(b, E, 75395, 36) | 0;
+                      if (!i) {
+                        i = 1;
+                        break d;
+                      }
+                      Da = (i + 20) | 0;
+                      c[Da >> 2] = c[Aa >> 2];
+                      a[wa >> 0] = 0;
+                      if (
+                        !(
+                          pb[c[va >> 2] & 127](
+                            c[xa >> 2] | 0,
+                            0,
+                            c[Da >> 2] | 0,
+                            c[(i + 16) >> 2] | 0,
+                            c[(i + 24) >> 2] | 0
+                          ) | 0
+                        )
+                      ) {
+                        i = 21;
+                        break d;
+                      }
+                      if (!(a[wa >> 0] | 0)) {
+                        a[ta >> 0] = Ea;
+                        break;
+                      }
+                      if (
+                        ((a[ya >> 0] | 0) == 0 ? ((Fa = c[za >> 2] | 0), Fa | 0) : 0)
+                          ? (kb[Fa & 63](c[ra >> 2] | 0) | 0) == 0
+                          : 0
+                      ) {
+                        i = 22;
+                        break d;
+                      }
+                    }
+                  while (0);
+                  c[(b + 276) >> 2] = 58;
+                  i = pZ(b, n, g, j) | 0;
+                  break;
+                }
+                case 184: {
+                  i = (e | 0) == 28 ? 10 : (e | 0) == 12 ? 17 : 2;
+                  break;
+                }
+                case 189: {
+                  c[(b + 276) >> 2] = 59;
+                  i = 0;
+                  break;
+                }
+                case 193: {
+                  c[aa >> 2] = (c[aa >> 2] | 0) >>> 1;
+                  i = 1;
+                  break;
+                }
+                case 198: {
+                  c[aa >> 2] = 0;
+                  i = 1;
+                  break;
+                }
+                case 278: {
+                  c[j >> 2] = c[Da >> 2];
+                  i = 0;
+                  break;
+                }
+                case 280:
+                  break;
+              }
+              l = Ga;
+              return i | 0;
+            }
+            function kZ(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              q = l;
+              l = (l + 32) | 0;
+              p = (q + 16) | 0;
+              m = (q + 12) | 0;
+              i = (q + 8) | 0;
+              j = (q + 4) | 0;
+              k = q;
+              c[p >> 2] = 0;
+              c[m >> 2] = 0;
+              c[i >> 2] = 0;
+              c[k >> 2] = -1;
+              n = (b + 144) | 0;
+              o = (b + 284) | 0;
+              g = (d | 0) != 0;
+              a: do
+                if (rb[((a[(b + 232) >> 0] << 24) >> 24 ? 2 : 1) & 3](d, c[n >> 2] | 0, e, f, o, i, j, p, m, k) | 0) {
+                  if (
+                    ((c[k >> 2] | 0) == 1) & (g ^ 1)
+                      ? ((a[((c[(b + 352) >> 2] | 0) + 130) >> 0] = 1), (h = (b + 488) | 0), (c[h >> 2] | 0) == 1)
+                      : 0
+                  )
+                    c[h >> 2] = 0;
+                  h = (b + 140) | 0;
+                  if (!(c[h >> 2] | 0))
+                    if (!(c[(b + 80) >> 2] | 0)) {
+                      e = 0;
+                      d = 0;
+                    } else {
+                      yZ(b, c[n >> 2] | 0, e, f);
+                      e = 0;
+                      d = 0;
+                    }
+                  else {
+                    d = c[p >> 2] | 0;
+                    if (!d) d = 0;
+                    else {
+                      f = c[n >> 2] | 0;
+                      d = lZ((b + 436) | 0, f, d, (d + (lb[c[(f + 28) >> 2] & 127](f, d) | 0)) | 0) | 0;
+                      if (!d) {
+                        d = 1;
+                        break;
+                      }
+                      c[(b + 452) >> 2] = c[(b + 448) >> 2];
+                    }
+                    g = c[i >> 2] | 0;
+                    if (g) {
+                      i = c[n >> 2] | 0;
+                      g = lZ((b + 436) | 0, i, g, ((c[j >> 2] | 0) + (0 - (c[(i + 64) >> 2] | 0))) | 0) | 0;
+                      if (!g) {
+                        d = 1;
+                        break;
+                      }
+                    } else g = 0;
+                    xb[c[h >> 2] & 31](c[(b + 4) >> 2] | 0, g, d, c[k >> 2] | 0);
+                    e = g;
+                  }
+                  do
+                    if (!(c[(b + 228) >> 2] | 0)) {
+                      g = c[m >> 2] | 0;
+                      h = g;
+                      if (g | 0) {
+                        k = c[(g + 64) >> 2] | 0;
+                        m = c[n >> 2] | 0;
+                        if ((k | 0) == (c[(m + 64) >> 2] | 0) ? ((k | 0) != 2) | ((g | 0) == (m | 0)) : 0) {
+                          c[n >> 2] = h;
+                          break;
+                        }
+                        c[o >> 2] = c[p >> 2];
+                        d = 19;
+                        break a;
+                      }
+                      g = c[p >> 2] | 0;
+                      if (g | 0) {
+                        h = (b + 436) | 0;
+                        if (!d) {
+                          d = c[n >> 2] | 0;
+                          d = lZ(h, d, g, (g + (lb[c[(d + 28) >> 2] & 127](d, g) | 0)) | 0) | 0;
+                          if (!d) {
+                            d = 1;
+                            break a;
+                          }
+                        }
+                        d = e_(b, d) | 0;
+                        mZ(h);
+                        if ((d | 0) != 18) break a;
+                        c[o >> 2] = c[p >> 2];
+                        d = 18;
+                        break a;
+                      }
+                    }
+                  while (0);
+                  if (((d | 0) != 0) | ((e | 0) != 0)) {
+                    mZ((b + 436) | 0);
+                    d = 0;
+                  } else d = 0;
+                } else d = g ? 31 : 30;
+              while (0);
+              l = q;
+              return d | 0;
+            }
+            function lZ(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              do
+                if (!(tZ(b, d, e, f) | 0)) d = 0;
+                else {
+                  e = (b + 12) | 0;
+                  d = c[e >> 2] | 0;
+                  if ((d | 0) == (c[(b + 8) >> 2] | 0)) {
+                    if (!(((vZ(b) | 0) << 24) >> 24)) {
+                      d = 0;
+                      break;
+                    }
+                    d = c[e >> 2] | 0;
+                  }
+                  c[e >> 2] = d + 1;
+                  a[d >> 0] = 0;
+                  d = c[(b + 16) >> 2] | 0;
+                }
+              while (0);
+              return d | 0;
+            }
+            function mZ(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              e = (a + 4) | 0;
+              b = c[e >> 2] | 0;
+              a: do
+                if (!b) {
+                  c[e >> 2] = c[a >> 2];
+                  b = a;
+                } else {
+                  d = c[a >> 2] | 0;
+                  while (1) {
+                    if (!d) {
+                      b = a;
+                      break a;
+                    }
+                    g = c[d >> 2] | 0;
+                    c[d >> 2] = b;
+                    c[e >> 2] = d;
+                    f = d;
+                    d = g;
+                    b = f;
+                  }
+                }
+              while (0);
+              c[b >> 2] = 0;
+              c[(a + 16) >> 2] = 0;
+              c[(a + 12) >> 2] = 0;
+              c[(a + 8) >> 2] = 0;
+              return;
+            }
+            function nZ(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0;
+              w = (e + 8) | 0;
+              a: do
+                if (!(c[w >> 2] | 0))
+                  if (g) {
+                    a[(e + 4) >> 0] = 6;
+                    c[w >> 2] = 64;
+                    h = (e + 16) | 0;
+                    i = kb[c[c[h >> 2] >> 2] & 63](256) | 0;
+                    c[e >> 2] = i;
+                    if (!i) {
+                      c[w >> 2] = 0;
+                      h = 0;
+                      break;
+                    } else {
+                      Y6(i | 0, 0, 256) | 0;
+                      j = c_(b, f) | 0;
+                      j = ((c[w >> 2] | 0) + -1) & j;
+                      i = e;
+                      o = 27;
+                      break;
+                    }
+                  } else h = 0;
+                else {
+                  v = c_(b, f) | 0;
+                  k = c[w >> 2] | 0;
+                  j = (k + -1) | 0;
+                  l = c[e >> 2] | 0;
+                  m = v & (0 - k);
+                  u = (e + 4) | 0;
+                  n = j >>> 2;
+                  i = 0;
+                  j = j & v;
+                  while (1) {
+                    h = c[(l + (j << 2)) >> 2] | 0;
+                    if (!h) break;
+                    if (((d_(f, c[h >> 2] | 0) | 0) << 24) >> 24) break a;
+                    if (!((i << 24) >> 24)) h = (((m >>> (((d[u >> 0] | 0) + -1) | 0)) & n) | 1) & 255;
+                    else h = i;
+                    t = h & 255;
+                    i = h;
+                    j = (j - t + (j >>> 0 < t >>> 0 ? k : 0)) | 0;
+                  }
+                  if (g) {
+                    i = a[u >> 0] | 0;
+                    h = i & 255;
+                    if (!((c[(e + 12) >> 2] | 0) >>> ((h + -1) | 0))) {
+                      h = (e + 16) | 0;
+                      i = e;
+                      o = 27;
+                      break;
+                    }
+                    q = (h + 1) & 255;
+                    j = (i + 1) & 255;
+                    s = 1 << j;
+                    r = (s + -1) | 0;
+                    i = s << 2;
+                    h = (e + 16) | 0;
+                    t = kb[c[c[h >> 2] >> 2] & 63](i) | 0;
+                    if (t) {
+                      Y6(t | 0, 0, i | 0) | 0;
+                      p = (0 - s) | 0;
+                      n = (j + -1) | 0;
+                      o = r >>> 2;
+                      m = 0;
+                      while (1) {
+                        if (m >>> 0 >= (c[w >> 2] | 0) >>> 0) break;
+                        i = c[((c[e >> 2] | 0) + (m << 2)) >> 2] | 0;
+                        if (i | 0) {
+                          i = c_(b, c[i >> 2] | 0) | 0;
+                          k = ((((i & p) >>> n) & o) | 1) & 255;
+                          i = i & r;
+                          j = 0;
+                          while (1) {
+                            l = (t + (i << 2)) | 0;
+                            if (!(c[l >> 2] | 0)) break;
+                            l = (j << 24) >> 24 == 0 ? k : j;
+                            x = l & 255;
+                            i = (i + (i >>> 0 < x >>> 0 ? s : 0) - x) | 0;
+                            j = l;
+                          }
+                          c[l >> 2] = c[((c[e >> 2] | 0) + (m << 2)) >> 2];
+                        }
+                        m = (m + 1) | 0;
+                      }
+                      tb[c[((c[h >> 2] | 0) + 8) >> 2] & 127](c[e >> 2] | 0);
+                      c[e >> 2] = t;
+                      a[u >> 0] = q;
+                      c[w >> 2] = s;
+                      k = ((((v & p) >>> n) & o) | 1) & 255;
+                      i = r & v;
+                      j = 0;
+                      while (1) {
+                        if (!(c[(t + (i << 2)) >> 2] | 0)) {
+                          j = i;
+                          i = e;
+                          o = 27;
+                          break a;
+                        }
+                        x = (j << 24) >> 24 == 0 ? k : j;
+                        w = x & 255;
+                        i = (i + (i >>> 0 < w >>> 0 ? s : 0) - w) | 0;
+                        j = x;
+                      }
+                    } else h = 0;
+                  } else h = 0;
+                }
+              while (0);
+              if ((o | 0) == 27) {
+                h = kb[c[c[h >> 2] >> 2] & 63](g) | 0;
+                c[((c[i >> 2] | 0) + (j << 2)) >> 2] = h;
+                h = c[((c[i >> 2] | 0) + (j << 2)) >> 2] | 0;
+                if (!h) h = 0;
+                else {
+                  Y6(h | 0, 0, g | 0) | 0;
+                  c[c[((c[i >> 2] | 0) + (j << 2)) >> 2] >> 2] = f;
+                  h = (e + 12) | 0;
+                  c[h >> 2] = (c[h >> 2] | 0) + 1;
+                  h = c[((c[i >> 2] | 0) + (j << 2)) >> 2] | 0;
+                }
+              }
+              return h | 0;
+            }
+            function oZ(b) {
+              b = b | 0;
+              var c = 0,
+                d = 0,
+                e = 0;
+              e = b;
+              c = b;
+              while (1) {
+                d = a[e >> 0] | 0;
+                if (!((d << 24) >> 24)) break;
+                switch (((d << 24) >> 24) | 0) {
+                  case 10:
+                  case 13:
+                  case 32: {
+                    if ((c | 0) != (b | 0)) {
+                      if ((a[(c + -1) >> 0] | 0) != 32) {
+                        a[c >> 0] = 32;
+                        c = (c + 1) | 0;
+                      }
+                    } else c = b;
+                    break;
+                  }
+                  default: {
+                    a[c >> 0] = d;
+                    c = (c + 1) | 0;
+                  }
+                }
+                e = (e + 1) | 0;
+              }
+              if ((c | 0) != (b | 0)) {
+                b = (c + -1) | 0;
+                b = (a[b >> 0] | 0) == 32 ? b : c;
+              }
+              a[b >> 0] = 0;
+              return;
+            }
+            function pZ(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              d = IZ(b, 0, c[(b + 144) >> 2] | 0, d, e, f, ((a[(b + 480) >> 0] | 0) == 0) & 1) | 0;
+              if ((d | 0) == 0 ? ((RZ(b) | 0) << 24) >> 24 == 0 : 0) d = 1;
+              return d | 0;
+            }
+            function qZ(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              g = c[(a + 352) >> 2] | 0;
+              b = lZ((g + 80) | 0, b, d, e) | 0;
+              do
+                if ((b | 0) != 0 ? ((f = nZ(a, (g + 20) | 0, b, 24) | 0), (f | 0) != 0) : 0)
+                  if ((c[f >> 2] | 0) == (b | 0)) {
+                    c[(g + 96) >> 2] = c[(g + 92) >> 2];
+                    if (!(TZ(a, f) | 0)) {
+                      f = 0;
+                      break;
+                    }
+                  } else c[(g + 92) >> 2] = c[(g + 96) >> 2];
+                else f = 0;
+              while (0);
+              return f | 0;
+            }
+            function rZ(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0;
+              m = c[(b + 352) >> 2] | 0;
+              k = (m + 80) | 0;
+              n = (m + 92) | 0;
+              h = c[n >> 2] | 0;
+              l = (m + 88) | 0;
+              if ((h | 0) == (c[l >> 2] | 0))
+                if (!(((vZ(k) | 0) << 24) >> 24)) g = 0;
+                else {
+                  h = c[n >> 2] | 0;
+                  i = 4;
+                }
+              else i = 4;
+              a: do
+                if ((i | 0) == 4) {
+                  c[n >> 2] = h + 1;
+                  a[h >> 0] = 0;
+                  d = lZ(k, d, e, f) | 0;
+                  if ((d | 0) != 0 ? ((j = (d + 1) | 0), (g = nZ(b, (m + 40) | 0, j, 12) | 0), (g | 0) != 0) : 0) {
+                    if ((c[g >> 2] | 0) != (j | 0)) {
+                      c[n >> 2] = c[(m + 96) >> 2];
+                      break;
+                    }
+                    h = c[n >> 2] | 0;
+                    i = (m + 96) | 0;
+                    c[i >> 2] = h;
+                    if (a[(b + 232) >> 0] | 0) {
+                      e = a[j >> 0] | 0;
+                      b: do
+                        if ((e << 24) >> 24 == 120)
+                          if (
+                            (
+                              ((a[(d + 2) >> 0] | 0) == 109 ? (a[(d + 3) >> 0] | 0) == 108 : 0)
+                                ? (a[(d + 4) >> 0] | 0) == 110
+                                : 0
+                            )
+                              ? (a[(d + 5) >> 0] | 0) == 115
+                              : 0
+                          ) {
+                            switch (a[(d + 6) >> 0] | 0) {
+                              case 0: {
+                                h = (m + 152) | 0;
+                                break;
+                              }
+                              case 58: {
+                                h = nZ(b, (m + 60) | 0, (d + 7) | 0, 8) | 0;
+                                break;
+                              }
+                              default: {
+                                f = 0;
+                                d = 120;
+                                break b;
+                              }
+                            }
+                            c[(g + 4) >> 2] = h;
+                            a[(g + 9) >> 0] = 1;
+                            break a;
+                          } else {
+                            f = 0;
+                            d = 120;
+                          }
+                        else {
+                          f = 0;
+                          d = e;
+                        }
+                      while (0);
+                      c: while (1) {
+                        switch ((d << 24) >> 24) {
+                          case 0:
+                            break a;
+                          case 58: {
+                            e = 0;
+                            break c;
+                          }
+                          default: {
+                          }
+                        }
+                        d = (f + 1) | 0;
+                        f = d;
+                        d = a[(j + d) >> 0] | 0;
+                      }
+                      while (1) {
+                        d = (h | 0) == (c[l >> 2] | 0);
+                        if ((e | 0) >= (f | 0)) break;
+                        if (d) {
+                          if (!(((vZ(k) | 0) << 24) >> 24)) {
+                            g = 0;
+                            break a;
+                          }
+                          h = c[n >> 2] | 0;
+                        }
+                        d = a[(j + e) >> 0] | 0;
+                        c[n >> 2] = h + 1;
+                        a[h >> 0] = d;
+                        e = (e + 1) | 0;
+                        h = c[n >> 2] | 0;
+                      }
+                      if (d) {
+                        if (!(((vZ(k) | 0) << 24) >> 24)) {
+                          g = 0;
+                          break;
+                        }
+                        h = c[n >> 2] | 0;
+                      }
+                      c[n >> 2] = h + 1;
+                      a[h >> 0] = 0;
+                      h = nZ(b, (m + 60) | 0, c[i >> 2] | 0, 8) | 0;
+                      c[(g + 4) >> 2] = h;
+                      if (h) {
+                        d = c[i >> 2] | 0;
+                        if ((c[h >> 2] | 0) == (d | 0)) {
+                          c[i >> 2] = c[n >> 2];
+                          break;
+                        } else {
+                          c[n >> 2] = d;
+                          break;
+                        }
+                      } else g = 0;
+                    }
+                  } else g = 0;
+                }
+              while (0);
+              return g | 0;
+            }
+            function sZ(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              g = (b + 12) | 0;
+              h = (b + 8) | 0;
+              while (1) {
+                e = a[d >> 0] | 0;
+                if (!((e << 24) >> 24)) {
+                  i = 7;
+                  break;
+                }
+                f = c[g >> 2] | 0;
+                if ((f | 0) == (c[h >> 2] | 0)) {
+                  if (!(((vZ(b) | 0) << 24) >> 24)) {
+                    d = 0;
+                    break;
+                  }
+                  f = c[g >> 2] | 0;
+                  e = a[d >> 0] | 0;
+                }
+                c[g >> 2] = f + 1;
+                a[f >> 0] = e;
+                d = (d + 1) | 0;
+              }
+              if ((i | 0) == 7) d = c[(b + 16) >> 2] | 0;
+              return d | 0;
+            }
+            function tZ(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 16) | 0;
+              h = i;
+              c[h >> 2] = d;
+              g = (a + 12) | 0;
+              if ((c[g >> 2] | 0) == 0 ? ((vZ(a) | 0) << 24) >> 24 == 0 : 0) d = 0;
+              else f = 3;
+              a: do
+                if ((f | 0) == 3) {
+                  d = (b + 56) | 0;
+                  f = (a + 8) | 0;
+                  while (1) {
+                    if ((pb[c[d >> 2] & 127](b, h, e, g, c[f >> 2] | 0) | 0) >>> 0 < 2) break;
+                    if (!(((vZ(a) | 0) << 24) >> 24)) {
+                      d = 0;
+                      break a;
+                    }
+                  }
+                  d = c[(a + 16) >> 2] | 0;
+                }
+              while (0);
+              l = i;
+              return d | 0;
+            }
+            function uZ(b, d, e, f, g, h) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0;
+              i = (f << 24) >> 24 == 0;
+              n = (b + 12) | 0;
+              m = c[n >> 2] | 0;
+              a: do
+                if (!(i & ((g | 0) == 0))) {
+                  j = (b + 20) | 0;
+                  f = 0;
+                  while (1) {
+                    if ((f | 0) >= (m | 0)) break;
+                    if ((c[((c[j >> 2] | 0) + ((f * 12) | 0)) >> 2] | 0) == (d | 0)) {
+                      f = 1;
+                      break a;
+                    } else f = (f + 1) | 0;
+                  }
+                  if ((!i ? ((k = (b + 8) | 0), (c[k >> 2] | 0) == 0) : 0) ? (a[(d + 9) >> 0] | 0) == 0 : 0) {
+                    c[k >> 2] = d;
+                    l = 9;
+                  } else l = 9;
+                } else l = 9;
+              while (0);
+              b: do
+                if ((l | 0) == 9) {
+                  j = (b + 16) | 0;
+                  do
+                    if ((m | 0) == (c[j >> 2] | 0))
+                      if (!m) {
+                        c[j >> 2] = 8;
+                        f = kb[c[(h + 12) >> 2] & 63](96) | 0;
+                        c[(b + 20) >> 2] = f;
+                        if (f | 0) break;
+                        c[j >> 2] = 0;
+                        f = 0;
+                        break b;
+                      } else {
+                        i = (b + 20) | 0;
+                        f = lb[c[(h + 16) >> 2] & 127](c[i >> 2] | 0, (m * 24) | 0) | 0;
+                        if (!f) {
+                          f = 0;
+                          break b;
+                        }
+                        c[j >> 2] = m << 1;
+                        c[i >> 2] = f;
+                        break;
+                      }
+                    else f = c[(b + 20) >> 2] | 0;
+                  while (0);
+                  h = c[n >> 2] | 0;
+                  c[(f + ((h * 12) | 0)) >> 2] = d;
+                  c[(f + ((h * 12) | 0) + 8) >> 2] = g;
+                  a[(f + ((h * 12) | 0) + 4) >> 0] = e;
+                  if (!((e << 24) >> 24)) a[(d + 8) >> 0] = 1;
+                  c[n >> 2] = (c[n >> 2] | 0) + 1;
+                  f = 1;
+                }
+              while (0);
+              return f | 0;
+            }
+            function vZ(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              b = (a + 4) | 0;
+              e = c[b >> 2] | 0;
+              do
+                if (e) {
+                  f = (a + 16) | 0;
+                  g = c[f >> 2] | 0;
+                  if (!g) {
+                    c[a >> 2] = e;
+                    c[b >> 2] = c[e >> 2];
+                    c[e >> 2] = 0;
+                    l = c[a >> 2] | 0;
+                    b = (l + 8) | 0;
+                    c[f >> 2] = b;
+                    c[(a + 8) >> 2] = (c[(l + 4) >> 2] | 0) + (l + 8);
+                    c[(a + 12) >> 2] = b;
+                    b = 1;
+                    break;
+                  }
+                  d = (a + 8) | 0;
+                  if ((((c[d >> 2] | 0) - g) | 0) < (c[(e + 4) >> 2] | 0)) {
+                    k = c[e >> 2] | 0;
+                    c[e >> 2] = c[a >> 2];
+                    l = c[b >> 2] | 0;
+                    c[a >> 2] = l;
+                    c[b >> 2] = k;
+                    b = c[f >> 2] | 0;
+                    W6((l + 8) | 0, b | 0, ((c[d >> 2] | 0) - b) | 0) | 0;
+                    b = c[a >> 2] | 0;
+                    l = (a + 12) | 0;
+                    c[l >> 2] = (c[l >> 2] | 0) - (c[f >> 2] | 0) + (b + 8);
+                    c[f >> 2] = b + 8;
+                    c[d >> 2] = (c[(b + 4) >> 2] | 0) + (b + 8);
+                    b = 1;
+                  } else h = 6;
+                } else h = 6;
+              while (0);
+              a: do
+                if ((h | 0) == 6) {
+                  e = c[a >> 2] | 0;
+                  k = (a + 16) | 0;
+                  do
+                    if (!e) {
+                      i = k;
+                      b = c[k >> 2] | 0;
+                    } else {
+                      j = c[k >> 2] | 0;
+                      b = j;
+                      if ((j | 0) != ((e + 8) | 0)) {
+                        i = k;
+                        break;
+                      }
+                      f = (a + 8) | 0;
+                      g = ((c[f >> 2] | 0) - b) << 1;
+                      h = (a + 12) | 0;
+                      d = ((c[h >> 2] | 0) - b) | 0;
+                      if ((g | 0) < 0) {
+                        b = 0;
+                        break a;
+                      }
+                      b = b_(g) | 0;
+                      if (!b) {
+                        b = 0;
+                        break a;
+                      }
+                      b = lb[c[((c[(a + 20) >> 2] | 0) + 4) >> 2] & 127](e, b) | 0;
+                      if (!b) {
+                        b = 0;
+                        break a;
+                      }
+                      c[a >> 2] = b;
+                      c[(b + 4) >> 2] = g;
+                      b = c[a >> 2] | 0;
+                      c[h >> 2] = b + 8 + d;
+                      c[k >> 2] = b + 8;
+                      c[f >> 2] = b + 8 + g;
+                      b = 1;
+                      break a;
+                    }
+                  while (0);
+                  j = (a + 8) | 0;
+                  b = ((c[j >> 2] | 0) - b) | 0;
+                  if ((b | 0) >= 0) {
+                    if ((b | 0) >= 1024) {
+                      b = b << 1;
+                      if ((b | 0) < 0) {
+                        b = 0;
+                        break;
+                      }
+                    } else b = 1024;
+                    d = b_(b) | 0;
+                    if ((d | 0) != 0 ? ((l = kb[c[c[(a + 20) >> 2] >> 2] & 63](d) | 0), (l | 0) != 0) : 0) {
+                      c[(l + 4) >> 2] = b;
+                      c[l >> 2] = c[a >> 2];
+                      c[a >> 2] = l;
+                      h = (a + 12) | 0;
+                      a = c[h >> 2] | 0;
+                      e = c[k >> 2] | 0;
+                      d = a;
+                      f = e;
+                      if ((a | 0) == (e | 0)) {
+                        g = (l + 8) | 0;
+                        e = f;
+                      } else {
+                        g = (l + 8) | 0;
+                        W6(g | 0, e | 0, (d - f) | 0) | 0;
+                        e = c[i >> 2] | 0;
+                        d = c[h >> 2] | 0;
+                      }
+                      c[h >> 2] = l + 8 + (d - e);
+                      c[k >> 2] = g;
+                      c[j >> 2] = l + 8 + b;
+                      b = 1;
+                    } else b = 0;
+                  } else b = 0;
+                }
+              while (0);
+              return b | 0;
+            }
+            function wZ(b, d, e, f, g, h) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              var i = 0;
+              b = a_(b, d, e, f, g, h) | 0;
+              do
+                if (!b) {
+                  d = (h + 12) | 0;
+                  b = c[d >> 2] | 0;
+                  if (
+                    ((e << 24) >> 24 == 0 ? (c[(h + 16) >> 2] | 0) != (b | 0) : 0)
+                      ? ((i = (b + -1) | 0), (a[i >> 0] | 0) == 32)
+                      : 0
+                  ) {
+                    c[d >> 2] = i;
+                    b = i;
+                  }
+                  if ((b | 0) == (c[(h + 8) >> 2] | 0)) {
+                    if (!(((vZ(h) | 0) << 24) >> 24)) {
+                      b = 1;
+                      break;
+                    }
+                    b = c[d >> 2] | 0;
+                  }
+                  c[d >> 2] = b + 1;
+                  a[b >> 0] = 0;
+                  b = 0;
+                }
+              while (0);
+              return b | 0;
+            }
+            function xZ(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0;
+              H = l;
+              l = (l + 16) | 0;
+              B = H;
+              C = (H + 4) | 0;
+              g = c[(b + 352) >> 2] | 0;
+              D = (g + 104) | 0;
+              F = (b + 272) | 0;
+              E = c[F >> 2] | 0;
+              c[F >> 2] = 1;
+              if ((c[D >> 2] | 0) == 0 ? ((vZ(D) | 0) << 24) >> 24 == 0 : 0) g = 1;
+              else {
+                n = (d + 20) | 0;
+                o = (b + 484) | 0;
+                p = (b + 144) | 0;
+                q = (b + 412) | 0;
+                r = (d + 64) | 0;
+                s = (g + 132) | 0;
+                t = (b + 428) | 0;
+                u = (b + 424) | 0;
+                v = (b + 224) | 0;
+                w = (b + 112) | 0;
+                m = (g + 130) | 0;
+                x = (g + 128) | 0;
+                y = (g + 131) | 0;
+                z = (b + 116) | 0;
+                A = (g + 112) | 0;
+                j = (g + 116) | 0;
+                k = (d + 40) | 0;
+                a: while (1) {
+                  b: do
+                    switch (ob[c[n >> 2] & 127](d, e, f, B) | 0) {
+                      case -4: {
+                        g = 0;
+                        break a;
+                      }
+                      case -1: {
+                        G = 37;
+                        break a;
+                      }
+                      case 0: {
+                        G = 39;
+                        break a;
+                      }
+                      case 28: {
+                        if ((a[o >> 0] | 0) == 0 ? (c[p >> 2] | 0) == (d | 0) : 0) {
+                          G = 19;
+                          break a;
+                        }
+                        g = c[r >> 2] | 0;
+                        g = lZ(q, d, (e + g) | 0, ((c[B >> 2] | 0) + (0 - g)) | 0) | 0;
+                        if (!g) {
+                          g = 1;
+                          break a;
+                        }
+                        h = nZ(b, s, g, 0) | 0;
+                        c[u >> 2] = c[t >> 2];
+                        if (!h) {
+                          G = 9;
+                          break a;
+                        }
+                        i = (h + 32) | 0;
+                        if (a[i >> 0] | 0) {
+                          G = 11;
+                          break a;
+                        }
+                        g = (h + 16) | 0;
+                        if (!(c[g >> 2] | 0)) {
+                          a[i >> 0] = 1;
+                          g = c[(h + 4) >> 2] | 0;
+                          g = xZ(b, c[v >> 2] | 0, g, (g + (c[(h + 8) >> 2] | 0)) | 0) | 0;
+                          a[i >> 0] = 0;
+                          if (!g) break b;
+                          else break a;
+                        }
+                        if (c[w >> 2] | 0) {
+                          a[y >> 0] = 0;
+                          a[i >> 0] = 1;
+                          h =
+                            (pb[c[w >> 2] & 127](
+                              c[z >> 2] | 0,
+                              0,
+                              c[(h + 20) >> 2] | 0,
+                              c[g >> 2] | 0,
+                              c[(h + 24) >> 2] | 0
+                            ) |
+                              0) ==
+                            0;
+                          a[i >> 0] = 0;
+                          if (h) {
+                            g = 21;
+                            break a;
+                          }
+                          if (a[y >> 0] | 0) break b;
+                        }
+                        a[x >> 0] = a[m >> 0] | 0;
+                        break;
+                      }
+                      case 6:
+                      case 9: {
+                        if (!(tZ(D, d, e, c[B >> 2] | 0) | 0)) {
+                          g = 1;
+                          break a;
+                        }
+                        break;
+                      }
+                      case -3: {
+                        c[B >> 2] = e + (c[r >> 2] | 0);
+                        G = 22;
+                        break;
+                      }
+                      case 7: {
+                        G = 22;
+                        break;
+                      }
+                      case 10: {
+                        g = lb[c[k >> 2] & 127](d, e) | 0;
+                        if ((g | 0) < 0) {
+                          G = 27;
+                          break a;
+                        }
+                        h = x_(g, C) | 0;
+                        e = 0;
+                        while (1) {
+                          if ((e | 0) >= (h | 0)) break;
+                          g = c[j >> 2] | 0;
+                          if ((c[A >> 2] | 0) == (g | 0)) {
+                            if (!(((vZ(D) | 0) << 24) >> 24)) {
+                              g = 1;
+                              G = 35;
+                              break a;
+                            }
+                            g = c[j >> 2] | 0;
+                          }
+                          i = a[(C + e) >> 0] | 0;
+                          c[j >> 2] = g + 1;
+                          a[g >> 0] = i;
+                          e = (e + 1) | 0;
+                        }
+                        break;
+                      }
+                      default: {
+                        G = 41;
+                        break a;
+                      }
+                    }
+                  while (0);
+                  if ((G | 0) == 22) {
+                    G = 0;
+                    g = c[j >> 2] | 0;
+                    if ((c[A >> 2] | 0) == (g | 0)) {
+                      if (!(((vZ(D) | 0) << 24) >> 24)) {
+                        g = 1;
+                        break;
+                      }
+                      g = c[j >> 2] | 0;
+                    }
+                    c[j >> 2] = g + 1;
+                    a[g >> 0] = 10;
+                  }
+                  e = c[B >> 2] | 0;
+                }
+                if ((G | 0) == 9) {
+                  a[x >> 0] = a[m >> 0] | 0;
+                  g = 0;
+                } else if ((G | 0) == 11)
+                  if ((c[p >> 2] | 0) == (d | 0)) {
+                    c[(b + 284) >> 2] = e;
+                    g = 12;
+                  } else g = 12;
+                else if ((G | 0) == 19) {
+                  c[(b + 284) >> 2] = e;
+                  g = 10;
+                } else if ((G | 0) == 27)
+                  if ((c[p >> 2] | 0) == (d | 0)) {
+                    c[(b + 284) >> 2] = e;
+                    g = 14;
+                    G = 35;
+                  } else {
+                    g = 14;
+                    G = 35;
+                  }
+                else if ((G | 0) == 37)
+                  if ((c[p >> 2] | 0) == (d | 0)) {
+                    c[(b + 284) >> 2] = e;
+                    g = 4;
+                  } else g = 4;
+                else if ((G | 0) == 39)
+                  if ((c[p >> 2] | 0) == (d | 0)) {
+                    c[(b + 284) >> 2] = c[B >> 2];
+                    g = 4;
+                  } else g = 4;
+                else if ((G | 0) == 41)
+                  if ((c[p >> 2] | 0) == (d | 0)) {
+                    c[(b + 284) >> 2] = e;
+                    g = 23;
+                  } else g = 23;
+                c[F >> 2] = E;
+              }
+              l = H;
+              return g | 0;
+            }
+            function yZ(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              p = l;
+              l = (l + 16) | 0;
+              n = p;
+              o = (p + 4) | 0;
+              c[n >> 2] = e;
+              if (!(a[(d + 68) >> 0] | 0)) {
+                if ((c[(b + 144) >> 2] | 0) == (d | 0)) {
+                  g = (b + 288) | 0;
+                  h = (b + 284) | 0;
+                } else {
+                  h = c[(b + 296) >> 2] | 0;
+                  g = (h + 4) | 0;
+                }
+                i = (b + 44) | 0;
+                j = (d + 56) | 0;
+                k = (b + 48) | 0;
+                m = (b + 80) | 0;
+                e = (b + 4) | 0;
+                do {
+                  c[o >> 2] = c[i >> 2];
+                  b = pb[c[j >> 2] & 127](d, n, f, o, c[k >> 2] | 0) | 0;
+                  c[g >> 2] = c[n >> 2];
+                  q = c[i >> 2] | 0;
+                  vb[c[m >> 2] & 127](c[e >> 2] | 0, q, ((c[o >> 2] | 0) - q) | 0);
+                  c[h >> 2] = c[n >> 2];
+                } while (b >>> 0 > 1);
+              } else vb[c[(b + 80) >> 2] & 127](c[(b + 4) >> 2] | 0, e, (f - e) | 0);
+              l = p;
+              return;
+            }
+            function zZ(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              m = l;
+              l = (l + 16) | 0;
+              j = m;
+              k = c[d >> 2] | 0;
+              if ((c[(a + 144) >> 2] | 0) == (b | 0)) {
+                i = (a + 284) | 0;
+                c[i >> 2] = k;
+                h = (a + 288) | 0;
+              } else {
+                i = c[(a + 296) >> 2] | 0;
+                h = (i + 4) | 0;
+              }
+              c[i >> 2] = k;
+              c[d >> 2] = 0;
+              n = ob[c[(b + 12) >> 2] & 127](b, k, e, j) | 0;
+              e = c[j >> 2] | 0;
+              c[h >> 2] = e;
+              switch (n | 0) {
+                case 42: {
+                  if (c[(a + 80) >> 2] | 0) {
+                    yZ(a, b, k, e);
+                    e = c[j >> 2] | 0;
+                  }
+                  c[d >> 2] = e;
+                  c[f >> 2] = e;
+                  e = (c[(a + 476) >> 2] | 0) == 2 ? 35 : 0;
+                  break;
+                }
+                case 0: {
+                  c[i >> 2] = e;
+                  e = 4;
+                  break;
+                }
+                case -2: {
+                  if (!((g << 24) >> 24)) e = 6;
+                  else {
+                    c[f >> 2] = k;
+                    e = 0;
+                  }
+                  break;
+                }
+                case -4:
+                case -1: {
+                  if (!((g << 24) >> 24)) e = 2;
+                  else {
+                    c[f >> 2] = k;
+                    e = 0;
+                  }
+                  break;
+                }
+                default: {
+                  c[i >> 2] = e;
+                  e = 23;
+                }
+              }
+              l = m;
+              return e | 0;
+            }
+            function AZ(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0;
+              h = l;
+              l = (l + 16) | 0;
+              g = h;
+              c[g >> 2] = d;
+              d = zZ(b, c[(b + 144) >> 2] | 0, g, e, f, ((a[(b + 480) >> 0] | 0) == 0) & 1) | 0;
+              g = c[g >> 2] | 0;
+              if (!(((d | 0) != 0) | ((g | 0) == 0))) {
+                c[(b + 276) >> 2] = 57;
+                d = iZ(b, g, e, f) | 0;
+              }
+              l = h;
+              return d | 0;
+            }
+            function BZ(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              i = c[(a + 352) >> 2] | 0;
+              j = (i + 184) | 0;
+              if (!(c[j >> 2] | 0)) {
+                b = kb[c[(a + 12) >> 2] & 63](c[(a + 464) >> 2] << 2) | 0;
+                c[j >> 2] = b;
+                if (!b) b = -1;
+                else {
+                  c[b >> 2] = 0;
+                  d = 4;
+                }
+              } else d = 4;
+              do
+                if ((d | 0) == 4) {
+                  h = (i + 176) | 0;
+                  b = c[h >> 2] | 0;
+                  g = (i + 172) | 0;
+                  d = c[g >> 2] | 0;
+                  f = (i + 164) | 0;
+                  e = c[f >> 2] | 0;
+                  if (b >>> 0 < d >>> 0) g = e;
+                  else {
+                    if (!e) {
+                      b = kb[c[(a + 12) >> 2] & 63](896) | 0;
+                      if (!b) {
+                        b = -1;
+                        break;
+                      } else {
+                        d = b;
+                        b = 32;
+                      }
+                    } else {
+                      b = lb[c[(a + 16) >> 2] & 127](e, (d * 56) | 0) | 0;
+                      if (!b) {
+                        b = -1;
+                        break;
+                      }
+                      d = b;
+                      b = c[g >> 2] << 1;
+                    }
+                    c[g >> 2] = b;
+                    c[f >> 2] = d;
+                    b = c[h >> 2] | 0;
+                    g = d;
+                  }
+                  c[h >> 2] = b + 1;
+                  d = c[(i + 180) >> 2] | 0;
+                  if (d | 0) {
+                    a = c[((c[j >> 2] | 0) + ((d + -1) << 2)) >> 2] | 0;
+                    f = (g + ((a * 28) | 0) + 16) | 0;
+                    d = c[f >> 2] | 0;
+                    if (d | 0) c[(g + ((d * 28) | 0) + 24) >> 2] = b;
+                    d = (g + ((a * 28) | 0) + 20) | 0;
+                    e = c[d >> 2] | 0;
+                    if (!e) c[(g + ((a * 28) | 0) + 12) >> 2] = b;
+                    c[f >> 2] = b;
+                    c[d >> 2] = e + 1;
+                  }
+                  j = (g + ((b * 28) | 0) + 12) | 0;
+                  c[j >> 2] = 0;
+                  c[(j + 4) >> 2] = 0;
+                  c[(j + 8) >> 2] = 0;
+                  c[(j + 12) >> 2] = 0;
+                }
+              while (0);
+              return b | 0;
+            }
+            function CZ(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              p = l;
+              l = (l + 16) | 0;
+              n = p;
+              o = (b + 300) | 0;
+              f = c[o >> 2] | 0;
+              if (!f) {
+                f = kb[c[(b + 12) >> 2] & 63](24) | 0;
+                if (!f) f = 1;
+                else {
+                  m = f;
+                  g = 4;
+                }
+              } else {
+                c[o >> 2] = c[(f + 8) >> 2];
+                m = f;
+                g = 4;
+              }
+              do
+                if ((g | 0) == 4) {
+                  h = (d + 32) | 0;
+                  a[h >> 0] = 1;
+                  i = (d + 12) | 0;
+                  c[i >> 2] = 0;
+                  j = (b + 296) | 0;
+                  k = (m + 8) | 0;
+                  c[k >> 2] = c[j >> 2];
+                  c[j >> 2] = m;
+                  c[(m + 12) >> 2] = d;
+                  f = (b + 308) | 0;
+                  c[(m + 16) >> 2] = c[f >> 2];
+                  a[(m + 20) >> 0] = e;
+                  c[m >> 2] = 0;
+                  c[(m + 4) >> 2] = 0;
+                  g = c[(d + 4) >> 2] | 0;
+                  e = (g + (c[(d + 8) >> 2] | 0)) | 0;
+                  c[n >> 2] = g;
+                  if (!(a[(d + 33) >> 0] | 0)) f = IZ(b, c[f >> 2] | 0, c[(b + 224) >> 2] | 0, g, e, n, 0) | 0;
+                  else {
+                    d = (b + 224) | 0;
+                    f = c[d >> 2] | 0;
+                    f = ob[c[f >> 2] & 127](f, g, e, n) | 0;
+                    f = jZ(b, c[d >> 2] | 0, g, e, f, c[n >> 2] | 0, n, 0) | 0;
+                  }
+                  if (!f) {
+                    f = c[n >> 2] | 0;
+                    if ((e | 0) != (f | 0) ? (c[(b + 476) >> 2] | 0) == 3 : 0) {
+                      c[i >> 2] = f - g;
+                      c[(b + 276) >> 2] = 60;
+                      f = 0;
+                      break;
+                    }
+                    a[h >> 0] = 0;
+                    c[j >> 2] = c[k >> 2];
+                    c[k >> 2] = c[o >> 2];
+                    c[o >> 2] = m;
+                    f = 0;
+                  }
+                }
+              while (0);
+              l = p;
+              return f | 0;
+            }
+            function DZ(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              g = l;
+              l = (l + 16) | 0;
+              d = (g + 4) | 0;
+              e = g;
+              b = c[(a + 352) >> 2] | 0;
+              f = (b + 176) | 0;
+              b = kb[c[(a + 12) >> 2] & 63](((((c[f >> 2] | 0) * 20) | 0) + (c[(b + 168) >> 2] | 0)) | 0) | 0;
+              if (!b) b = 0;
+              else {
+                c[e >> 2] = b + (((c[f >> 2] | 0) * 20) | 0);
+                c[d >> 2] = b + 20;
+                HZ(a, 0, b, d, e);
+              }
+              l = g;
+              return b | 0;
+            }
+            function EZ(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              j = (a + 64) | 0;
+              if (!(c[j >> 2] | 0))
+                if (!(c[(a + 80) >> 2] | 0)) d = 1;
+                else {
+                  yZ(a, b, d, e);
+                  d = 1;
+                }
+              else {
+                h = (b + 64) | 0;
+                g = (d + (c[h >> 2] << 1)) | 0;
+                d = (g + (lb[c[(b + 28) >> 2] & 127](b, g) | 0)) | 0;
+                f = (a + 412) | 0;
+                g = lZ(f, b, g, d) | 0;
+                if (
+                  (g | 0) != 0
+                    ? ((c[(a + 428) >> 2] = c[(a + 424) >> 2]),
+                      (i = lb[c[(b + 32) >> 2] & 127](b, d) | 0),
+                      (i = lZ(f, b, i, (e + (0 - (c[h >> 2] << 1))) | 0) | 0),
+                      (i | 0) != 0)
+                    : 0
+                ) {
+                  GZ(i);
+                  vb[c[j >> 2] & 127](c[(a + 4) >> 2] | 0, g, i);
+                  mZ(f);
+                  d = 1;
+                } else d = 0;
+              }
+              return d | 0;
+            }
+            function FZ(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              g = (a + 68) | 0;
+              if (!(c[g >> 2] | 0))
+                if (!(c[(a + 80) >> 2] | 0)) b = 1;
+                else {
+                  yZ(a, b, d, e);
+                  b = 1;
+                }
+              else {
+                f = (a + 412) | 0;
+                h = c[(b + 64) >> 2] | 0;
+                b = lZ(f, b, (d + (h << 2)) | 0, (e + (O(h, -3) | 0)) | 0) | 0;
+                if (!b) b = 0;
+                else {
+                  GZ(b);
+                  ub[c[g >> 2] & 63](c[(a + 4) >> 2] | 0, b);
+                  mZ(f);
+                  b = 1;
+                }
+              }
+              return b | 0;
+            }
+            function GZ(b) {
+              b = b | 0;
+              var c = 0,
+                d = 0,
+                e = 0;
+              a: while (1) {
+                switch (a[b >> 0] | 0) {
+                  case 0:
+                    break a;
+                  case 13: {
+                    d = b;
+                    c = 13;
+                    e = 4;
+                    break a;
+                  }
+                  default: {
+                  }
+                }
+                b = (b + 1) | 0;
+              }
+              if ((e | 0) == 4) {
+                while (1) {
+                  if ((c << 24) >> 24 == 13) {
+                    a[d >> 0] = 10;
+                    e = (b + 1) | 0;
+                    b = (a[e >> 0] | 0) == 10 ? (b + 2) | 0 : e;
+                  } else {
+                    a[d >> 0] = c;
+                    b = (b + 1) | 0;
+                  }
+                  d = (d + 1) | 0;
+                  c = a[b >> 0] | 0;
+                  if (!((c << 24) >> 24)) break;
+                  else e = 4;
+                }
+                a[d >> 0] = 0;
+              }
+              return;
+            }
+            function HZ(b, d, e, f, g) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = ((c[(b + 352) >> 2] | 0) + 164) | 0;
+              j = c[((c[k >> 2] | 0) + ((d * 28) | 0)) >> 2] | 0;
+              c[e >> 2] = j;
+              c[(e + 4) >> 2] = c[((c[k >> 2] | 0) + ((d * 28) | 0) + 4) >> 2];
+              if ((j | 0) == 4) {
+                c[(e + 8) >> 2] = c[g >> 2];
+                d = c[((c[k >> 2] | 0) + ((d * 28) | 0) + 8) >> 2] | 0;
+                while (1) {
+                  j = a[d >> 0] | 0;
+                  k = c[g >> 2] | 0;
+                  c[g >> 2] = k + 1;
+                  a[k >> 0] = j;
+                  if (!(a[d >> 0] | 0)) break;
+                  else d = (d + 1) | 0;
+                }
+                c[(e + 12) >> 2] = 0;
+                c[(e + 16) >> 2] = 0;
+              } else {
+                h = c[((c[k >> 2] | 0) + ((d * 28) | 0) + 20) >> 2] | 0;
+                i = (e + 12) | 0;
+                c[i >> 2] = h;
+                j = (e + 16) | 0;
+                c[j >> 2] = c[f >> 2];
+                c[f >> 2] = (c[f >> 2] | 0) + ((h * 20) | 0);
+                d = ((c[k >> 2] | 0) + ((d * 28) | 0) + 12) | 0;
+                h = 0;
+                while (1) {
+                  d = c[d >> 2] | 0;
+                  if (h >>> 0 >= (c[i >> 2] | 0) >>> 0) break;
+                  HZ(b, d, ((c[j >> 2] | 0) + ((h * 20) | 0)) | 0, f, g);
+                  d = ((c[k >> 2] | 0) + ((d * 28) | 0) + 24) | 0;
+                  h = (h + 1) | 0;
+                }
+                c[(e + 8) >> 2] = 0;
+              }
+              return;
+            }
+            function IZ(b, d, e, f, g, h, i) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              i = i | 0;
+              var j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                O = 0,
+                P = 0,
+                Q = 0,
+                R = 0,
+                S = 0,
+                T = 0,
+                U = 0,
+                V = 0,
+                W = 0,
+                X = 0,
+                Y = 0,
+                Z = 0,
+                _ = 0,
+                $ = 0,
+                aa = 0,
+                ba = 0,
+                ca = 0,
+                da = 0,
+                ea = 0,
+                fa = 0,
+                ga = 0,
+                ha = 0,
+                ia = 0,
+                ja = 0,
+                ka = 0,
+                la = 0,
+                ma = 0,
+                na = 0;
+              ma = l;
+              l = (l + 48) | 0;
+              ja = (ma + 28) | 0;
+              ea = (ma + 32) | 0;
+              ka = (ma + 24) | 0;
+              Z = ma;
+              c[ja >> 2] = f;
+              _ = c[(b + 352) >> 2] | 0;
+              if ((c[(b + 144) >> 2] | 0) == (e | 0)) {
+                fa = (b + 284) | 0;
+                Y = (b + 288) | 0;
+              } else {
+                Y = c[(b + 296) >> 2] | 0;
+                fa = Y;
+                Y = (Y + 4) | 0;
+              }
+              c[fa >> 2] = f;
+              t = (e + 4) | 0;
+              ga = (b + 80) | 0;
+              u = (b + 476) | 0;
+              v = (e + 44) | 0;
+              w = (e + 64) | 0;
+              x = (_ + 80) | 0;
+              y = (_ + 96) | 0;
+              z = (_ + 92) | 0;
+              A = (_ + 129) | 0;
+              B = (b + 112) | 0;
+              C = (b + 116) | 0;
+              D = (b + 428) | 0;
+              E = (b + 424) | 0;
+              F = (b + 304) | 0;
+              G = (b + 120) | 0;
+              ha = (b + 4) | 0;
+              H = (_ + 130) | 0;
+              $ = (b + 60) | 0;
+              I = (b + 364) | 0;
+              J = (b + 12) | 0;
+              K = (b + 360) | 0;
+              L = (e + 28) | 0;
+              ia = (b + 308) | 0;
+              aa = (e + 56) | 0;
+              M = (b + 16) | 0;
+              N = (b + 52) | 0;
+              O = (b + 412) | 0;
+              P = (b + 388) | 0;
+              Q = (b + 56) | 0;
+              R = (b + 232) | 0;
+              S = (b + 233) | 0;
+              T = (b + 468) | 0;
+              U = (b + 104) | 0;
+              V = (b + 372) | 0;
+              W = (e + 40) | 0;
+              X = (b + 72) | 0;
+              ba = (e + 68) | 0;
+              ca = (b + 44) | 0;
+              da = (b + 48) | 0;
+              a: while (1) {
+                s = c[ja >> 2] | 0;
+                c[ea >> 2] = s;
+                s = ob[c[t >> 2] & 127](e, s, g, ea) | 0;
+                f = c[ea >> 2] | 0;
+                c[Y >> 2] = f;
+                k = f;
+                b: do
+                  switch (s | 0) {
+                    case -3: {
+                      la = 6;
+                      break a;
+                    }
+                    case -4: {
+                      la = 15;
+                      break a;
+                    }
+                    case 0: {
+                      la = 20;
+                      break a;
+                    }
+                    case -1: {
+                      la = 21;
+                      break a;
+                    }
+                    case -2: {
+                      la = 23;
+                      break a;
+                    }
+                    case 12: {
+                      f = 17;
+                      break a;
+                    }
+                    case -5: {
+                      la = 134;
+                      break a;
+                    }
+                    case 9: {
+                      s = c[w >> 2] | 0;
+                      s = (nb[c[v >> 2] & 63](e, ((c[ja >> 2] | 0) + s) | 0, (k + (0 - s)) | 0) | 0) & 255;
+                      a[ka >> 0] = s;
+                      do
+                        if ((s << 24) >> 24) {
+                          f = c[$ >> 2] | 0;
+                          if (f | 0) {
+                            vb[f & 127](c[ha >> 2] | 0, ka, 1);
+                            break;
+                          }
+                          if (c[ga >> 2] | 0) yZ(b, e, c[ja >> 2] | 0, c[ea >> 2] | 0);
+                        } else {
+                          j = c[w >> 2] | 0;
+                          j = lZ(x, e, ((c[ja >> 2] | 0) + j) | 0, ((c[ea >> 2] | 0) + (0 - j)) | 0) | 0;
+                          if (!j) {
+                            f = 1;
+                            la = 56;
+                            break a;
+                          }
+                          k = nZ(b, _, j, 0) | 0;
+                          c[z >> 2] = c[y >> 2];
+                          if ((a[A >> 0] | 0) != 0 ? (a[H >> 0] | 0) == 0 : 0) {
+                            if (!k) {
+                              f = c[G >> 2] | 0;
+                              if (f | 0) {
+                                vb[f & 127](c[ha >> 2] | 0, j, 0);
+                                break;
+                              }
+                              if (!(c[ga >> 2] | 0)) break;
+                              yZ(b, e, c[ja >> 2] | 0, c[ea >> 2] | 0);
+                              break;
+                            }
+                          } else {
+                            if (!k) {
+                              f = 11;
+                              la = 56;
+                              break a;
+                            }
+                            if (!(a[(k + 34) >> 0] | 0)) {
+                              f = 24;
+                              la = 56;
+                              break a;
+                            }
+                          }
+                          f = (k + 32) | 0;
+                          if (a[f >> 0] | 0) {
+                            f = 12;
+                            la = 56;
+                            break a;
+                          }
+                          if (c[(k + 28) >> 2] | 0) {
+                            f = 15;
+                            la = 56;
+                            break a;
+                          }
+                          if (!(c[(k + 4) >> 2] | 0)) {
+                            if (!(c[B >> 2] | 0)) {
+                              if (!(c[ga >> 2] | 0)) break;
+                              yZ(b, e, c[ja >> 2] | 0, c[ea >> 2] | 0);
+                              break;
+                            }
+                            a[f >> 0] = 1;
+                            j = KZ(b) | 0;
+                            a[f >> 0] = 0;
+                            if (!j) {
+                              f = 1;
+                              la = 56;
+                              break a;
+                            }
+                            if (
+                              !(
+                                pb[c[B >> 2] & 127](
+                                  c[C >> 2] | 0,
+                                  j,
+                                  c[(k + 20) >> 2] | 0,
+                                  c[(k + 16) >> 2] | 0,
+                                  c[(k + 24) >> 2] | 0
+                                ) | 0
+                              )
+                            ) {
+                              f = 21;
+                              la = 56;
+                              break a;
+                            }
+                            c[E >> 2] = c[D >> 2];
+                            break;
+                          }
+                          if (a[F >> 0] | 0) {
+                            f = CZ(b, k, 0) | 0;
+                            if (!f) break;
+                            else {
+                              la = 58;
+                              break a;
+                            }
+                          }
+                          f = c[G >> 2] | 0;
+                          if (!f) {
+                            if (c[ga >> 2] | 0) yZ(b, e, c[ja >> 2] | 0, c[ea >> 2] | 0);
+                          } else vb[f & 127](c[ha >> 2] | 0, c[k >> 2] | 0, 0);
+                          break b;
+                        }
+                      while (0);
+                      break;
+                    }
+                    case 1:
+                    case 2: {
+                      f = c[I >> 2] | 0;
+                      if (!f) {
+                        f = kb[c[J >> 2] & 63](48) | 0;
+                        if (!f) {
+                          f = 1;
+                          la = 75;
+                          break a;
+                        }
+                        j = kb[c[J >> 2] & 63](32) | 0;
+                        c[(f + 36) >> 2] = j;
+                        if (!j) {
+                          la = 63;
+                          break a;
+                        }
+                        c[(f + 40) >> 2] = j + 32;
+                      } else c[I >> 2] = c[f >> 2];
+                      o = (f + 44) | 0;
+                      c[o >> 2] = 0;
+                      c[f >> 2] = c[K >> 2];
+                      c[K >> 2] = f;
+                      s = (f + 12) | 0;
+                      c[(f + 16) >> 2] = 0;
+                      c[(f + 20) >> 2] = 0;
+                      r = ((c[ja >> 2] | 0) + (c[w >> 2] | 0)) | 0;
+                      q = (f + 4) | 0;
+                      c[q >> 2] = r;
+                      p = (f + 8) | 0;
+                      c[p >> 2] = lb[c[L >> 2] & 127](e, r) | 0;
+                      c[ia >> 2] = (c[ia >> 2] | 0) + 1;
+                      q = c[q >> 2] | 0;
+                      p = (q + (c[p >> 2] | 0)) | 0;
+                      c[Z >> 2] = q;
+                      q = (f + 36) | 0;
+                      c[ka >> 2] = c[q >> 2];
+                      r = (f + 40) | 0;
+                      j = c[r >> 2] | 0;
+                      while (1) {
+                        na = pb[c[aa >> 2] & 127](e, Z, p, ka, (j + -1) | 0) | 0;
+                        j = c[ka >> 2] | 0;
+                        m = c[q >> 2] | 0;
+                        k = m;
+                        n = (j - k) | 0;
+                        if ((na | 0) == 1 ? 1 : (c[Z >> 2] | 0) >>> 0 >= p >>> 0) break;
+                        k = ((c[r >> 2] | 0) - k) << 1;
+                        j = lb[c[M >> 2] & 127](m, k) | 0;
+                        if (!j) {
+                          la = 69;
+                          break a;
+                        }
+                        c[q >> 2] = j;
+                        na = (j + k) | 0;
+                        c[r >> 2] = na;
+                        c[ka >> 2] = j + n;
+                        j = na;
+                      }
+                      c[(f + 24) >> 2] = n;
+                      c[s >> 2] = k;
+                      a[j >> 0] = 0;
+                      f = LZ(b, e, c[ja >> 2] | 0, s, o) | 0;
+                      if (f | 0) {
+                        la = 75;
+                        break a;
+                      }
+                      f = c[N >> 2] | 0;
+                      if (!f) {
+                        if (c[ga >> 2] | 0) yZ(b, e, c[ja >> 2] | 0, c[ea >> 2] | 0);
+                      } else vb[f & 127](c[ha >> 2] | 0, c[s >> 2] | 0, c[P >> 2] | 0);
+                      mZ(O);
+                      break;
+                    }
+                    case 3:
+                    case 4: {
+                      na = ((c[ja >> 2] | 0) + (c[w >> 2] | 0)) | 0;
+                      c[ka >> 2] = 0;
+                      na = lZ(O, e, na, (na + (lb[c[L >> 2] & 127](e, na) | 0)) | 0) | 0;
+                      c[Z >> 2] = na;
+                      if (!na) {
+                        f = 1;
+                        la = 89;
+                        break a;
+                      }
+                      c[D >> 2] = c[E >> 2];
+                      f = LZ(b, e, c[ja >> 2] | 0, Z, ka) | 0;
+                      if (f | 0) {
+                        la = 79;
+                        break a;
+                      }
+                      c[D >> 2] = c[E >> 2];
+                      f = c[N >> 2] | 0;
+                      if (!f) j = 1;
+                      else {
+                        vb[f & 127](c[ha >> 2] | 0, c[Z >> 2] | 0, c[P >> 2] | 0);
+                        j = 0;
+                      }
+                      f = c[Q >> 2] | 0;
+                      if (!f) {
+                        if (j | 0 ? c[ga >> 2] | 0 : 0) yZ(b, e, c[ja >> 2] | 0, c[ea >> 2] | 0);
+                      } else {
+                        if (c[N >> 2] | 0) {
+                          c[fa >> 2] = c[Y >> 2];
+                          f = c[Q >> 2] | 0;
+                        }
+                        ub[f & 63](c[ha >> 2] | 0, c[Z >> 2] | 0);
+                      }
+                      mZ(O);
+                      MZ(b, c[ka >> 2] | 0);
+                      if ((c[ia >> 2] | 0) == 0 ? ((c[u >> 2] & -2) | 0) != 2 : 0) {
+                        la = 92;
+                        break a;
+                      }
+                      break;
+                    }
+                    case 5: {
+                      if ((c[ia >> 2] | 0) == (d | 0)) {
+                        f = 13;
+                        break a;
+                      }
+                      n = c[K >> 2] | 0;
+                      c[K >> 2] = c[n >> 2];
+                      c[n >> 2] = c[I >> 2];
+                      c[I >> 2] = n;
+                      f = ((c[ja >> 2] | 0) + (c[w >> 2] << 1)) | 0;
+                      j = lb[c[L >> 2] & 127](e, f) | 0;
+                      if ((j | 0) != (c[(n + 8) >> 2] | 0)) {
+                        la = 96;
+                        break a;
+                      }
+                      if ($3(c[(n + 4) >> 2] | 0, f, j) | 0) {
+                        la = 96;
+                        break a;
+                      }
+                      c[ia >> 2] = (c[ia >> 2] | 0) + -1;
+                      f = c[Q >> 2] | 0;
+                      if (!f) {
+                        if (c[ga >> 2] | 0) yZ(b, e, c[ja >> 2] | 0, c[ea >> 2] | 0);
+                      } else {
+                        j = c[(n + 16) >> 2] | 0;
+                        m = (n + 12) | 0;
+                        if (((j | 0) != 0) & ((a[R >> 0] | 0) != 0)) {
+                          f = ((c[m >> 2] | 0) + (c[(n + 28) >> 2] | 0)) | 0;
+                          while (1) {
+                            k = a[j >> 0] | 0;
+                            if (!((k << 24) >> 24)) break;
+                            a[f >> 0] = k;
+                            f = (f + 1) | 0;
+                            j = (j + 1) | 0;
+                          }
+                          j = c[(n + 20) >> 2] | 0;
+                          c: do
+                            if (((j | 0) != 0) & ((a[S >> 0] | 0) != 0)) {
+                              a[f >> 0] = a[T >> 0] | 0;
+                              while (1) {
+                                f = (f + 1) | 0;
+                                k = a[j >> 0] | 0;
+                                if (!((k << 24) >> 24)) break c;
+                                a[f >> 0] = k;
+                                j = (j + 1) | 0;
+                              }
+                            }
+                          while (0);
+                          a[f >> 0] = 0;
+                          f = c[Q >> 2] | 0;
+                        }
+                        ub[f & 63](c[ha >> 2] | 0, c[m >> 2] | 0);
+                      }
+                      k = (n + 44) | 0;
+                      while (1) {
+                        m = c[k >> 2] | 0;
+                        if (!m) break;
+                        f = c[U >> 2] | 0;
+                        if (!f) {
+                          f = m;
+                          j = m;
+                        } else {
+                          ub[f & 63](c[ha >> 2] | 0, c[c[m >> 2] >> 2] | 0);
+                          f = m;
+                          j = c[k >> 2] | 0;
+                        }
+                        c[k >> 2] = c[(j + 4) >> 2];
+                        c[(m + 4) >> 2] = c[V >> 2];
+                        c[V >> 2] = m;
+                        c[((c[f >> 2] | 0) + 4) >> 2] = c[(m + 8) >> 2];
+                      }
+                      if (!(c[ia >> 2] | 0)) {
+                        la = 117;
+                        break a;
+                      }
+                      break;
+                    }
+                    case 10: {
+                      f = lb[c[W >> 2] & 127](e, c[ja >> 2] | 0) | 0;
+                      if ((f | 0) < 0) {
+                        f = 14;
+                        break a;
+                      }
+                      j = c[$ >> 2] | 0;
+                      if (j | 0) {
+                        s = c[ha >> 2] | 0;
+                        na = x_(f, ka) | 0;
+                        vb[j & 127](s, ka, na);
+                        break b;
+                      }
+                      if (c[ga >> 2] | 0) yZ(b, e, c[ja >> 2] | 0, c[ea >> 2] | 0);
+                      break;
+                    }
+                    case 7: {
+                      f = c[$ >> 2] | 0;
+                      if (f | 0) {
+                        a[ka >> 0] = 10;
+                        vb[f & 127](c[ha >> 2] | 0, ka, 1);
+                        break b;
+                      }
+                      if (c[ga >> 2] | 0) yZ(b, e, c[ja >> 2] | 0, k);
+                      break;
+                    }
+                    case 8: {
+                      f = c[X >> 2] | 0;
+                      if (!f) {
+                        if (c[ga >> 2] | 0) yZ(b, e, c[ja >> 2] | 0, k);
+                      } else tb[f & 127](c[ha >> 2] | 0);
+                      f = OZ(b, e, ea, g, h, i) | 0;
+                      if (f | 0) break a;
+                      if (!(c[ea >> 2] | 0)) {
+                        la = 133;
+                        break a;
+                      }
+                      break;
+                    }
+                    case 6: {
+                      j = c[$ >> 2] | 0;
+                      if (!j) {
+                        if (!(c[ga >> 2] | 0)) break b;
+                        yZ(b, e, c[ja >> 2] | 0, k);
+                        break b;
+                      }
+                      if (!(a[ba >> 0] | 0)) f = k;
+                      else {
+                        na = c[ja >> 2] | 0;
+                        vb[j & 127](c[ha >> 2] | 0, na, (f - na) | 0);
+                        break b;
+                      }
+                      while (1) {
+                        c[ka >> 2] = c[ca >> 2];
+                        na = pb[c[aa >> 2] & 127](e, ja, f, ka, c[da >> 2] | 0) | 0;
+                        c[Y >> 2] = c[ja >> 2];
+                        s = c[ca >> 2] | 0;
+                        vb[j & 127](c[ha >> 2] | 0, s, ((c[ka >> 2] | 0) - s) | 0);
+                        if (na >>> 0 < 2) break;
+                        c[fa >> 2] = c[ja >> 2];
+                        f = c[ea >> 2] | 0;
+                      }
+                      break;
+                    }
+                    case 11: {
+                      if (!(EZ(b, e, c[ja >> 2] | 0, k) | 0)) {
+                        f = 1;
+                        break a;
+                      }
+                      break;
+                    }
+                    case 13: {
+                      if (!(FZ(b, e, c[ja >> 2] | 0, k) | 0)) {
+                        f = 1;
+                        break a;
+                      }
+                      break;
+                    }
+                    default:
+                      if (c[ga >> 2] | 0) yZ(b, e, c[ja >> 2] | 0, k);
+                  }
+                while (0);
+                na = c[ea >> 2] | 0;
+                c[ja >> 2] = na;
+                c[fa >> 2] = na;
+                switch (c[u >> 2] | 0) {
+                  case 2: {
+                    f = 35;
+                    break a;
+                  }
+                  case 3: {
+                    la = 160;
+                    break a;
+                  }
+                  default: {
+                  }
+                }
+              }
+              switch (la | 0) {
+                case 6: {
+                  if ((i << 24) >> 24) {
+                    c[h >> 2] = c[ja >> 2];
+                    f = 0;
+                    break;
+                  }
+                  c[Y >> 2] = g;
+                  f = c[$ >> 2] | 0;
+                  if (!f) {
+                    if (c[ga >> 2] | 0) yZ(b, e, c[ja >> 2] | 0, g);
+                  } else {
+                    a[ka >> 0] = 10;
+                    vb[f & 127](c[ha >> 2] | 0, ka, 1);
+                  }
+                  if (d)
+                    if ((c[ia >> 2] | 0) == (d | 0)) {
+                      c[h >> 2] = g;
+                      f = 0;
+                    } else f = 13;
+                  else f = 3;
+                  break;
+                }
+                case 15: {
+                  if ((i << 24) >> 24) {
+                    c[h >> 2] = c[ja >> 2];
+                    f = 0;
+                    break;
+                  }
+                  if ((d | 0) > 0)
+                    if ((c[ia >> 2] | 0) == (d | 0)) {
+                      c[h >> 2] = c[ja >> 2];
+                      f = 0;
+                    } else f = 13;
+                  else f = 3;
+                  break;
+                }
+                case 20: {
+                  c[fa >> 2] = f;
+                  f = 4;
+                  break;
+                }
+                case 21: {
+                  if (!((i << 24) >> 24)) f = 5;
+                  else {
+                    c[h >> 2] = c[ja >> 2];
+                    f = 0;
+                  }
+                  break;
+                }
+                case 23: {
+                  if (!((i << 24) >> 24)) f = 6;
+                  else {
+                    c[h >> 2] = c[ja >> 2];
+                    f = 0;
+                  }
+                  break;
+                }
+                case 56:
+                  break;
+                case 58:
+                  break;
+                case 63: {
+                  tb[c[(b + 20) >> 2] & 127](f);
+                  f = 1;
+                  la = 75;
+                  break;
+                }
+                case 69: {
+                  f = 1;
+                  la = 75;
+                  break;
+                }
+                case 79: {
+                  MZ(b, c[ka >> 2] | 0);
+                  la = 89;
+                  break;
+                }
+                case 92: {
+                  f = NZ(b, c[ea >> 2] | 0, g, h) | 0;
+                  break;
+                }
+                case 96: {
+                  c[fa >> 2] = f;
+                  f = 7;
+                  break;
+                }
+                case 117: {
+                  f = NZ(b, c[ea >> 2] | 0, g, h) | 0;
+                  break;
+                }
+                case 133: {
+                  c[(b + 276) >> 2] = 61;
+                  f = 0;
+                  break;
+                }
+                case 134: {
+                  if ((i << 24) >> 24) {
+                    c[h >> 2] = c[ja >> 2];
+                    f = 0;
+                    break;
+                  }
+                  f = c[$ >> 2] | 0;
+                  do
+                    if (!f) {
+                      if (c[ga >> 2] | 0) yZ(b, e, c[ja >> 2] | 0, g);
+                    } else if (!(a[ba >> 0] | 0)) {
+                      c[ka >> 2] = c[ca >> 2];
+                      pb[c[aa >> 2] & 127](e, ja, g, ka, c[da >> 2] | 0) | 0;
+                      na = c[ca >> 2] | 0;
+                      vb[c[$ >> 2] & 127](c[ha >> 2] | 0, na, ((c[ka >> 2] | 0) - na) | 0);
+                      break;
+                    } else {
+                      na = c[ja >> 2] | 0;
+                      vb[f & 127](c[ha >> 2] | 0, na, (g - na) | 0);
+                      break;
+                    }
+                  while (0);
+                  if (!d) {
+                    c[fa >> 2] = g;
+                    f = 3;
+                    break;
+                  }
+                  if ((c[ia >> 2] | 0) == (d | 0)) {
+                    c[h >> 2] = g;
+                    f = 0;
+                    break;
+                  } else {
+                    c[fa >> 2] = g;
+                    f = 13;
+                    break;
+                  }
+                }
+                case 160: {
+                  c[h >> 2] = c[ea >> 2];
+                  f = 0;
+                  break;
+                }
+              }
+              l = ma;
+              return f | 0;
+            }
+            function JZ(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0;
+              q = l;
+              l = (l + 16) | 0;
+              p = q;
+              k = (b + 296) | 0;
+              m = c[k >> 2] | 0;
+              do
+                if (m) {
+                  n = c[(m + 12) >> 2] | 0;
+                  h = (n + 4) | 0;
+                  j = c[h >> 2] | 0;
+                  i = (n + 12) | 0;
+                  g = (j + (c[i >> 2] | 0)) | 0;
+                  j = (j + (c[(n + 8) >> 2] | 0)) | 0;
+                  c[p >> 2] = g;
+                  o = (n + 33) | 0;
+                  if (!(a[o >> 0] | 0)) g = IZ(b, c[(m + 16) >> 2] | 0, c[(b + 224) >> 2] | 0, g, j, p, 0) | 0;
+                  else {
+                    s = (b + 224) | 0;
+                    r = c[s >> 2] | 0;
+                    r = ob[c[r >> 2] & 127](r, g, j, p) | 0;
+                    g = jZ(b, c[s >> 2] | 0, g, j, r, c[p >> 2] | 0, p, 0) | 0;
+                  }
+                  if (!g) {
+                    g = c[p >> 2] | 0;
+                    if ((j | 0) != (g | 0) ? (c[(b + 476) >> 2] | 0) == 3 : 0) {
+                      c[i >> 2] = g - (c[h >> 2] | 0);
+                      g = 0;
+                      break;
+                    }
+                    a[(n + 32) >> 0] = 0;
+                    s = (m + 8) | 0;
+                    c[k >> 2] = c[s >> 2];
+                    g = (b + 300) | 0;
+                    c[s >> 2] = c[g >> 2];
+                    c[g >> 2] = m;
+                    g = (b + 276) | 0;
+                    if (!(a[o >> 0] | 0)) {
+                      c[g >> 2] = 58;
+                      g =
+                        IZ(
+                          b,
+                          ((c[(b + 472) >> 2] | 0) != 0) & 1,
+                          c[(b + 144) >> 2] | 0,
+                          d,
+                          e,
+                          f,
+                          ((a[(b + 480) >> 0] | 0) == 0) & 1
+                        ) | 0;
+                      break;
+                    } else {
+                      c[g >> 2] = 57;
+                      s = (b + 144) | 0;
+                      g = c[s >> 2] | 0;
+                      g = ob[c[g >> 2] & 127](g, d, e, p) | 0;
+                      g = jZ(b, c[s >> 2] | 0, d, e, g, c[p >> 2] | 0, f, ((a[(b + 480) >> 0] | 0) == 0) & 1) | 0;
+                      break;
+                    }
+                  }
+                } else g = 23;
+              while (0);
+              l = q;
+              return g | 0;
+            }
+            function KZ(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              q = l;
+              l = (l + 16) | 0;
+              n = q;
+              m = c[(b + 352) >> 2] | 0;
+              h = (m + 156) | 0;
+              o = (b + 412) | 0;
+              p = (b + 424) | 0;
+              a: do
+                if (!(c[h >> 2] | 0)) {
+                  d = 0;
+                  i = (b + 420) | 0;
+                  k = (b + 468) | 0;
+                  j = 12;
+                } else {
+                  d = c[p >> 2] | 0;
+                  i = (b + 420) | 0;
+                  if ((d | 0) == (c[i >> 2] | 0)) {
+                    if (!(((vZ(o) | 0) << 24) >> 24)) {
+                      d = 0;
+                      break;
+                    }
+                    d = c[p >> 2] | 0;
+                  }
+                  c[p >> 2] = d + 1;
+                  a[d >> 0] = 61;
+                  g = (b + 468) | 0;
+                  e = ((c[((c[h >> 2] | 0) + 20) >> 2] | 0) + ((((a[g >> 0] | 0) != 0) << 31) >> 31)) | 0;
+                  f = 0;
+                  while (1) {
+                    if ((f | 0) >= (e | 0)) {
+                      d = 1;
+                      k = g;
+                      j = 12;
+                      break a;
+                    }
+                    d = c[p >> 2] | 0;
+                    if ((d | 0) == (c[i >> 2] | 0)) {
+                      if (!(((vZ(o) | 0) << 24) >> 24)) {
+                        d = 0;
+                        break a;
+                      }
+                      d = c[p >> 2] | 0;
+                    }
+                    k = a[((c[((c[h >> 2] | 0) + 16) >> 2] | 0) + f) >> 0] | 0;
+                    c[p >> 2] = d + 1;
+                    a[d >> 0] = k;
+                    f = (f + 1) | 0;
+                  }
+                }
+              while (0);
+              b: do
+                if ((j | 0) == 12) {
+                  cZ(n, (m + 60) | 0);
+                  c: while (1) {
+                    do {
+                      e = dZ(n) | 0;
+                      if (!e) break c;
+                      h = (e + 4) | 0;
+                    } while (!(c[h >> 2] | 0));
+                    if ((d << 24) >> 24) {
+                      d = c[p >> 2] | 0;
+                      if ((d | 0) == (c[i >> 2] | 0)) {
+                        if (!(((vZ(o) | 0) << 24) >> 24)) {
+                          d = 0;
+                          break b;
+                        }
+                        d = c[p >> 2] | 0;
+                      }
+                      c[p >> 2] = d + 1;
+                      a[d >> 0] = 12;
+                    }
+                    g = c[e >> 2] | 0;
+                    while (1) {
+                      e = a[g >> 0] | 0;
+                      d = c[p >> 2] | 0;
+                      f = (d | 0) == (c[i >> 2] | 0);
+                      if (!((e << 24) >> 24)) break;
+                      if (f) {
+                        if (!(((vZ(o) | 0) << 24) >> 24)) {
+                          d = 0;
+                          break b;
+                        }
+                        d = c[p >> 2] | 0;
+                        e = a[g >> 0] | 0;
+                      }
+                      c[p >> 2] = d + 1;
+                      a[d >> 0] = e;
+                      g = (g + 1) | 0;
+                    }
+                    if (f) {
+                      if (!(((vZ(o) | 0) << 24) >> 24)) {
+                        d = 0;
+                        break b;
+                      }
+                      d = c[p >> 2] | 0;
+                    }
+                    c[p >> 2] = d + 1;
+                    a[d >> 0] = 61;
+                    f = ((c[((c[h >> 2] | 0) + 20) >> 2] | 0) + ((((a[k >> 0] | 0) != 0) << 31) >> 31)) | 0;
+                    e = 0;
+                    while (1) {
+                      if ((e | 0) >= (f | 0)) {
+                        d = 1;
+                        continue c;
+                      }
+                      d = c[p >> 2] | 0;
+                      if ((d | 0) == (c[i >> 2] | 0)) {
+                        if (!(((vZ(o) | 0) << 24) >> 24)) {
+                          d = 0;
+                          break b;
+                        }
+                        d = c[p >> 2] | 0;
+                      }
+                      j = a[((c[((c[h >> 2] | 0) + 16) >> 2] | 0) + e) >> 0] | 0;
+                      c[p >> 2] = d + 1;
+                      a[d >> 0] = j;
+                      e = (e + 1) | 0;
+                    }
+                  }
+                  cZ(n, m);
+                  d: while (1) {
+                    do {
+                      e = dZ(n) | 0;
+                      if (!e) break d;
+                    } while (!(a[(e + 32) >> 0] | 0));
+                    if ((d << 24) >> 24) {
+                      d = c[p >> 2] | 0;
+                      if ((d | 0) == (c[i >> 2] | 0)) {
+                        if (!(((vZ(o) | 0) << 24) >> 24)) {
+                          d = 0;
+                          break b;
+                        }
+                        d = c[p >> 2] | 0;
+                      }
+                      c[p >> 2] = d + 1;
+                      a[d >> 0] = 12;
+                    }
+                    f = c[e >> 2] | 0;
+                    while (1) {
+                      e = a[f >> 0] | 0;
+                      if (!((e << 24) >> 24)) {
+                        d = 1;
+                        continue d;
+                      }
+                      d = c[p >> 2] | 0;
+                      if ((d | 0) == (c[i >> 2] | 0)) {
+                        if (!(((vZ(o) | 0) << 24) >> 24)) {
+                          d = 0;
+                          break b;
+                        }
+                        d = c[p >> 2] | 0;
+                        e = a[f >> 0] | 0;
+                      }
+                      c[p >> 2] = d + 1;
+                      a[d >> 0] = e;
+                      f = (f + 1) | 0;
+                    }
+                  }
+                  d = c[p >> 2] | 0;
+                  if ((d | 0) == (c[i >> 2] | 0)) {
+                    if (!(((vZ(o) | 0) << 24) >> 24)) {
+                      d = 0;
+                      break;
+                    }
+                    d = c[p >> 2] | 0;
+                  }
+                  c[p >> 2] = d + 1;
+                  a[d >> 0] = 0;
+                  d = c[(b + 428) >> 2] | 0;
+                }
+              while (0);
+              l = q;
+              return d | 0;
+            }
+            function LZ(b, e, f, g, h) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                O = 0,
+                P = 0;
+              O = l;
+              l = (l + 80) | 0;
+              K = (O + 16) | 0;
+              L = O;
+              M = c[(b + 352) >> 2] | 0;
+              k = (M + 20) | 0;
+              i = nZ(b, k, c[g >> 2] | 0, 0) | 0;
+              if (!i) {
+                i = SZ((M + 80) | 0, c[g >> 2] | 0) | 0;
+                if ((i | 0) != 0 ? ((j = nZ(b, k, i, 24) | 0), (j | 0) != 0) : 0)
+                  if ((a[(b + 232) >> 0] | 0) != 0 ? (TZ(b, j) | 0) == 0 : 0) i = 1;
+                  else A = 6;
+                else i = 1;
+              } else {
+                j = i;
+                A = 6;
+              }
+              a: do
+                if ((A | 0) == 6) {
+                  x = c[(j + 12) >> 2] | 0;
+                  k = (e + 36) | 0;
+                  m = (b + 376) | 0;
+                  t = (b + 388) | 0;
+                  u = ob[c[k >> 2] & 127](e, f, c[m >> 2] | 0, c[t >> 2] | 0) | 0;
+                  i = (u + x) | 0;
+                  n = c[m >> 2] | 0;
+                  if ((i | 0) > (n | 0)) {
+                    i = (i + 16) | 0;
+                    c[m >> 2] = i;
+                    i = lb[c[(b + 16) >> 2] & 127](c[t >> 2] | 0, i << 4) | 0;
+                    if (!i) {
+                      c[m >> 2] = n;
+                      i = 1;
+                      break;
+                    }
+                    c[t >> 2] = i;
+                    if ((u | 0) > (n | 0)) ob[c[k >> 2] & 127](e, f, u, i) | 0;
+                  }
+                  J = c[t >> 2] | 0;
+                  r = (e + 28) | 0;
+                  H = (b + 412) | 0;
+                  I = (b + 428) | 0;
+                  w = (j + 20) | 0;
+                  q = (b + 424) | 0;
+                  s = 0;
+                  p = 0;
+                  k = 0;
+                  while (1) {
+                    if ((p | 0) >= (u | 0)) break;
+                    o = c[((c[t >> 2] | 0) + (p << 4)) >> 2] | 0;
+                    o = rZ(b, e, o, (o + (lb[c[r >> 2] & 127](e, o) | 0)) | 0) | 0;
+                    if (!o) {
+                      i = 1;
+                      break a;
+                    }
+                    i = ((c[o >> 2] | 0) + -1) | 0;
+                    if (a[i >> 0] | 0) {
+                      A = 15;
+                      break;
+                    }
+                    a[i >> 0] = 1;
+                    f = (s + 1) | 0;
+                    c[(J + (s << 2)) >> 2] = c[o >> 2];
+                    n = c[t >> 2] | 0;
+                    if (a[(n + (p << 4) + 12) >> 0] | 0) {
+                      G = lZ(H, e, c[(n + (p << 4) + 4) >> 2] | 0, c[(n + (p << 4) + 8) >> 2] | 0) | 0;
+                      c[(J + (f << 2)) >> 2] = G;
+                      if (!G) {
+                        i = 1;
+                        break a;
+                      }
+                    } else {
+                      b: do
+                        if (!(a[(o + 8) >> 0] | 0)) i = 1;
+                        else {
+                          i = 0;
+                          while (1) {
+                            if ((i | 0) >= (x | 0)) {
+                              i = 1;
+                              break b;
+                            }
+                            m = c[w >> 2] | 0;
+                            if ((o | 0) == (c[(m + ((i * 12) | 0)) >> 2] | 0)) break;
+                            i = (i + 1) | 0;
+                          }
+                          i = a[(m + ((i * 12) | 0) + 4) >> 0] | 0;
+                        }
+                      while (0);
+                      i = wZ(b, e, i, c[(n + (p << 4) + 4) >> 2] | 0, c[(n + (p << 4) + 8) >> 2] | 0, H) | 0;
+                      if (i | 0) break a;
+                      c[(J + (f << 2)) >> 2] = c[I >> 2];
+                    }
+                    c[I >> 2] = c[q >> 2];
+                    i = c[(o + 4) >> 2] | 0;
+                    do
+                      if (i)
+                        if (a[(o + 9) >> 0] | 0) {
+                          i = UZ(b, i, o, c[(J + (f << 2)) >> 2] | 0, h) | 0;
+                          if (!i) {
+                            i = s;
+                            break;
+                          } else break a;
+                        } else {
+                          a[((c[o >> 2] | 0) + -1) >> 0] = 2;
+                          k = (k + 1) | 0;
+                          i = (s + 2) | 0;
+                          break;
+                        }
+                      else i = (s + 2) | 0;
+                    while (0);
+                    s = i;
+                    p = (p + 1) | 0;
+                  }
+                  if ((A | 0) == 15) {
+                    if ((c[(b + 144) >> 2] | 0) != (e | 0)) {
+                      i = 8;
+                      break;
+                    }
+                    c[(b + 284) >> 2] = c[((c[t >> 2] | 0) + (p << 4)) >> 2];
+                    i = 8;
+                    break;
+                  }
+                  c[(b + 380) >> 2] = s;
+                  i = c[(j + 8) >> 2] | 0;
+                  c: do
+                    if ((i | 0) != 0 ? ((v = c[i >> 2] | 0), (a[(v + -1) >> 0] | 0) != 0) : 0) {
+                      i = 0;
+                      while (1) {
+                        if ((i | 0) >= (s | 0)) {
+                          f = 0;
+                          p = k;
+                          G = s;
+                          break c;
+                        }
+                        if ((c[(J + (i << 2)) >> 2] | 0) == (v | 0)) {
+                          A = 37;
+                          break c;
+                        }
+                        i = (i + 2) | 0;
+                      }
+                    } else {
+                      i = -1;
+                      A = 37;
+                    }
+                  while (0);
+                  if ((A | 0) == 37) {
+                    c[(b + 384) >> 2] = i;
+                    f = 0;
+                    p = k;
+                    G = s;
+                  }
+                  while (1) {
+                    if ((f | 0) >= (x | 0)) break;
+                    i = c[w >> 2] | 0;
+                    n = (i + ((f * 12) | 0)) | 0;
+                    k = c[n >> 2] | 0;
+                    m = ((c[k >> 2] | 0) + -1) | 0;
+                    d: do
+                      if (
+                        (a[m >> 0] | 0) == 0
+                          ? ((y = (i + ((f * 12) | 0) + 8) | 0), (z = c[y >> 2] | 0), (z | 0) != 0)
+                          : 0
+                      ) {
+                        i = c[(k + 4) >> 2] | 0;
+                        do
+                          if (i)
+                            if (a[(k + 9) >> 0] | 0) {
+                              i = UZ(b, i, k, z, h) | 0;
+                              if (!i) {
+                                i = p;
+                                k = G;
+                                break d;
+                              } else break a;
+                            } else {
+                              a[m >> 0] = 2;
+                              i = (p + 1) | 0;
+                              break;
+                            }
+                          else {
+                            a[m >> 0] = 1;
+                            i = p;
+                          }
+                        while (0);
+                        c[(J + (G << 2)) >> 2] = c[c[n >> 2] >> 2];
+                        c[(J + ((G + 1) << 2)) >> 2] = c[y >> 2];
+                        k = (G + 2) | 0;
+                      } else {
+                        i = p;
+                        k = G;
+                      }
+                    while (0);
+                    f = (f + 1) | 0;
+                    p = i;
+                    G = k;
+                  }
+                  c[(J + (G << 2)) >> 2] = 0;
+                  e: do
+                    if (!p) i = 0;
+                    else {
+                      o = (b + 396) | 0;
+                      n = c[o >> 2] | 0;
+                      F = (b + 400) | 0;
+                      f = a[F >> 0] | 0;
+                      i = f & 255;
+                      do
+                        if (!((p << 1) >> i)) {
+                          i = 1 << i;
+                          m = (b + 392) | 0;
+                          if (!n) {
+                            k = i;
+                            A = 55;
+                          } else {
+                            k = i;
+                            i = n;
+                          }
+                        } else {
+                          i = f;
+                          do {
+                            E = i;
+                            i = ((i + 1) << 24) >> 24;
+                          } while (((p >> (E & 255)) | 0) != 0);
+                          i = (i & 255) > 3 ? i : 3;
+                          a[F >> 0] = i;
+                          i = i & 255;
+                          m = (b + 392) | 0;
+                          k = lb[c[(b + 16) >> 2] & 127](c[m >> 2] | 0, 12 << i) | 0;
+                          if (!k) {
+                            a[F >> 0] = f;
+                            i = 1;
+                            break a;
+                          } else {
+                            c[m >> 2] = k;
+                            k = 1 << i;
+                            A = 55;
+                            break;
+                          }
+                        }
+                      while (0);
+                      f: do
+                        if ((A | 0) == 55) {
+                          i = k;
+                          while (1) {
+                            if (!i) {
+                              i = -1;
+                              break f;
+                            }
+                            E = (i + -1) | 0;
+                            c[((c[m >> 2] | 0) + ((E * 12) | 0)) >> 2] = -1;
+                            i = E;
+                          }
+                        }
+                      while (0);
+                      E = (i + -1) | 0;
+                      c[o >> 2] = E;
+                      w = (M + 40) | 0;
+                      x = (b + 424) | 0;
+                      y = (b + 420) | 0;
+                      z = (k + -1) | 0;
+                      A = (0 - k) | 0;
+                      B = z >>> 2;
+                      C = (b + 233) | 0;
+                      D = (b + 468) | 0;
+                      i = 0;
+                      v = p;
+                      g: while (1) {
+                        while (1) {
+                          if ((i | 0) >= (G | 0)) break e;
+                          e = (J + (i << 2)) | 0;
+                          n = c[e >> 2] | 0;
+                          f = (n + -1) | 0;
+                          if ((a[f >> 0] | 0) == 2) break;
+                          a[f >> 0] = 0;
+                          i = (i + 2) | 0;
+                        }
+                        VZ(b, L);
+                        WZ(K, L);
+                        a[f >> 0] = 0;
+                        f = nZ(b, w, n, 0) | 0;
+                        if (!f) {
+                          i = 1;
+                          break;
+                        }
+                        f = c[(f + 4) >> 2] | 0;
+                        if (!f) {
+                          i = 1;
+                          break;
+                        }
+                        u = c[(f + 4) >> 2] | 0;
+                        if (!u) {
+                          i = 27;
+                          break;
+                        }
+                        q = (u + 20) | 0;
+                        r = (u + 16) | 0;
+                        p = 0;
+                        while (1) {
+                          f = c[q >> 2] | 0;
+                          o = c[r >> 2] | 0;
+                          if ((p | 0) >= (f | 0)) break;
+                          o = a[(o + p) >> 0] | 0;
+                          f = c[x >> 2] | 0;
+                          if ((f | 0) == (c[y >> 2] | 0)) {
+                            if (!(((vZ(H) | 0) << 24) >> 24)) {
+                              i = 1;
+                              break g;
+                            }
+                            f = c[x >> 2] | 0;
+                          }
+                          c[x >> 2] = f + 1;
+                          a[f >> 0] = o;
+                          p = (p + 1) | 0;
+                        }
+                        XZ(K, o, f);
+                        do {
+                          t = n;
+                          n = (n + 1) | 0;
+                        } while ((a[t >> 0] | 0) != 58);
+                        XZ(K, n, YZ(n) | 0);
+                        while (1) {
+                          f = c[x >> 2] | 0;
+                          if ((f | 0) == (c[y >> 2] | 0)) {
+                            if (!(((vZ(H) | 0) << 24) >> 24)) {
+                              i = 1;
+                              break g;
+                            }
+                            f = c[x >> 2] | 0;
+                          }
+                          t = a[n >> 0] | 0;
+                          c[x >> 2] = f + 1;
+                          a[f >> 0] = t;
+                          if (!(a[n >> 0] | 0)) break;
+                          else n = (n + 1) | 0;
+                        }
+                        t = ZZ(K) | 0;
+                        q = c[m >> 2] | 0;
+                        r = t & A;
+                        n = 0;
+                        s = z & t;
+                        while (1) {
+                          if ((c[(q + ((s * 12) | 0)) >> 2] | 0) != (E | 0)) break;
+                          if ((c[(q + ((s * 12) | 0) + 4) >> 2] | 0) == (t | 0)) {
+                            f = c[(q + ((s * 12) | 0) + 8) >> 2] | 0;
+                            o = c[I >> 2] | 0;
+                            while (1) {
+                              P = a[o >> 0] | 0;
+                              p = (P << 24) >> 24 == 0;
+                              if (p | ((P << 24) >> 24 != (a[f >> 0] | 0))) break;
+                              f = (f + 1) | 0;
+                              o = (o + 1) | 0;
+                            }
+                            if (p) {
+                              i = 8;
+                              break g;
+                            }
+                          }
+                          if (!((n << 24) >> 24)) n = (((r >>> (((d[F >> 0] | 0) + -1) | 0)) & B) | 1) & 255;
+                          P = n & 255;
+                          s = (s + ((s | 0) < (P | 0) ? k : 0) - P) | 0;
+                        }
+                        if (a[C >> 0] | 0) {
+                          a[((c[x >> 2] | 0) + -1) >> 0] = a[D >> 0] | 0;
+                          f = c[c[u >> 2] >> 2] | 0;
+                          while (1) {
+                            n = c[x >> 2] | 0;
+                            if ((n | 0) == (c[y >> 2] | 0)) {
+                              if (!(((vZ(H) | 0) << 24) >> 24)) {
+                                i = 1;
+                                break g;
+                              }
+                              n = c[x >> 2] | 0;
+                            }
+                            P = a[f >> 0] | 0;
+                            c[x >> 2] = n + 1;
+                            a[n >> 0] = P;
+                            if (!(a[f >> 0] | 0)) break;
+                            else f = (f + 1) | 0;
+                          }
+                        }
+                        P = c[I >> 2] | 0;
+                        c[I >> 2] = c[x >> 2];
+                        c[e >> 2] = P;
+                        c[((c[m >> 2] | 0) + ((s * 12) | 0)) >> 2] = E;
+                        c[((c[m >> 2] | 0) + ((s * 12) | 0) + 4) >> 2] = t;
+                        c[((c[m >> 2] | 0) + ((s * 12) | 0) + 8) >> 2] = P;
+                        v = (v + -1) | 0;
+                        i = (i + 2) | 0;
+                        if (!v) break e;
+                      }
+                      break a;
+                    }
+                  while (0);
+                  while (1) {
+                    if ((i | 0) >= (G | 0)) {
+                      i = h;
+                      break;
+                    }
+                    a[((c[(J + (i << 2)) >> 2] | 0) + -1) >> 0] = 0;
+                    i = (i + 2) | 0;
+                  }
+                  while (1) {
+                    i = c[i >> 2] | 0;
+                    if (!i) break;
+                    a[((c[c[(i + 12) >> 2] >> 2] | 0) + -1) >> 0] = 0;
+                    i = (i + 4) | 0;
+                  }
+                  if (!(a[(b + 232) >> 0] | 0)) i = 0;
+                  else {
+                    i = c[(j + 4) >> 2] | 0;
+                    if (!i) {
+                      i = c[(M + 156) >> 2] | 0;
+                      if (!i) {
+                        i = 0;
+                        break;
+                      }
+                      k = c[g >> 2] | 0;
+                    } else {
+                      i = c[(i + 4) >> 2] | 0;
+                      if (!i) {
+                        i = 27;
+                        break;
+                      }
+                      j = c[g >> 2] | 0;
+                      while (1) {
+                        k = (j + 1) | 0;
+                        if ((a[j >> 0] | 0) == 58) break;
+                        else j = k;
+                      }
+                    }
+                    if ((a[(b + 233) >> 0] | 0) != 0 ? ((N = c[c[i >> 2] >> 2] | 0), (N | 0) != 0) : 0) {
+                      j = 0;
+                      while (1) {
+                        m = (j + 1) | 0;
+                        if (!(a[(N + j) >> 0] | 0)) break;
+                        else j = m;
+                      }
+                    } else m = 0;
+                    c[(g + 4) >> 2] = k;
+                    p = (i + 20) | 0;
+                    c[(g + 16) >> 2] = c[p >> 2];
+                    c[(g + 8) >> 2] = c[c[i >> 2] >> 2];
+                    c[(g + 20) >> 2] = m;
+                    q = 0;
+                    while (1) {
+                      r = (q + 1) | 0;
+                      if (!(a[(k + q) >> 0] | 0)) break;
+                      else q = r;
+                    }
+                    j = c[p >> 2] | 0;
+                    n = (r + m + j) | 0;
+                    f = (i + 24) | 0;
+                    if ((n | 0) > (c[f >> 2] | 0)) {
+                      j = (n + 24) | 0;
+                      o = kb[c[(b + 12) >> 2] & 63](j) | 0;
+                      if (!o) {
+                        i = 1;
+                        break;
+                      }
+                      c[f >> 2] = j;
+                      f = (i + 16) | 0;
+                      W6(o | 0, c[f >> 2] | 0, c[p >> 2] | 0) | 0;
+                      j = (b + 360) | 0;
+                      while (1) {
+                        j = c[j >> 2] | 0;
+                        if (!j) break;
+                        n = (j + 12) | 0;
+                        if ((c[n >> 2] | 0) == (c[f >> 2] | 0)) c[n >> 2] = o;
+                      }
+                      tb[c[(b + 20) >> 2] & 127](c[f >> 2] | 0);
+                      c[f >> 2] = o;
+                      n = o;
+                      j = c[p >> 2] | 0;
+                    } else {
+                      n = (i + 16) | 0;
+                      f = n;
+                      n = c[n >> 2] | 0;
+                    }
+                    j = (n + j) | 0;
+                    W6(j | 0, k | 0, r | 0) | 0;
+                    if (m | 0) {
+                      P = (j + q) | 0;
+                      a[P >> 0] = a[(b + 468) >> 0] | 0;
+                      W6((P + 1) | 0, c[c[i >> 2] >> 2] | 0, m | 0) | 0;
+                    }
+                    c[g >> 2] = c[f >> 2];
+                    i = 0;
+                  }
+                }
+              while (0);
+              l = O;
+              return i | 0;
+            }
+            function MZ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              e = (a + 104) | 0;
+              f = (a + 372) | 0;
+              d = (a + 4) | 0;
+              while (1) {
+                if (!b) break;
+                a = c[e >> 2] | 0;
+                if (!a) a = b;
+                else {
+                  ub[a & 63](c[d >> 2] | 0, c[c[b >> 2] >> 2] | 0);
+                  a = b;
+                }
+                h = (b + 4) | 0;
+                g = c[h >> 2] | 0;
+                c[h >> 2] = c[f >> 2];
+                c[f >> 2] = b;
+                c[((c[a >> 2] | 0) + 4) >> 2] = c[(b + 8) >> 2];
+                b = g;
+              }
+              return;
+            }
+            function NZ(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0;
+              q = l;
+              l = (l + 16) | 0;
+              j = q;
+              c[(b + 276) >> 2] = 62;
+              k = (b + 284) | 0;
+              c[k >> 2] = d;
+              m = (b + 144) | 0;
+              n = (b + 288) | 0;
+              o = (b + 80) | 0;
+              i = (b + 476) | 0;
+              g = d;
+              a: while (1) {
+                c[j >> 2] = 0;
+                r = c[m >> 2] | 0;
+                r = ob[c[r >> 2] & 127](r, g, e, j) | 0;
+                d = c[j >> 2] | 0;
+                c[n >> 2] = d;
+                h = d;
+                switch (r | 0) {
+                  case -15: {
+                    p = 3;
+                    break a;
+                  }
+                  case -4: {
+                    p = 7;
+                    break a;
+                  }
+                  case 0: {
+                    p = 12;
+                    break a;
+                  }
+                  case -1: {
+                    p = 13;
+                    break a;
+                  }
+                  case -2: {
+                    p = 15;
+                    break a;
+                  }
+                  case 15: {
+                    if (c[o >> 2] | 0) yZ(b, c[m >> 2] | 0, g, h);
+                    break;
+                  }
+                  case 11: {
+                    if (!(EZ(b, c[m >> 2] | 0, g, h) | 0)) {
+                      d = 1;
+                      break a;
+                    }
+                    break;
+                  }
+                  case 13: {
+                    if (!(FZ(b, c[m >> 2] | 0, g, h) | 0)) {
+                      d = 1;
+                      break a;
+                    }
+                    break;
+                  }
+                  default: {
+                    d = 9;
+                    break a;
+                  }
+                }
+                d = c[j >> 2] | 0;
+                c[k >> 2] = d;
+                switch (c[i >> 2] | 0) {
+                  case 2: {
+                    d = 35;
+                    break a;
+                  }
+                  case 3: {
+                    p = 18;
+                    break a;
+                  }
+                  default: {
+                  }
+                }
+                g = d;
+              }
+              do
+                if ((p | 0) == 3) {
+                  if (c[o >> 2] | 0) {
+                    yZ(b, c[m >> 2] | 0, g, h);
+                    if ((c[i >> 2] | 0) == 2) {
+                      d = 35;
+                      break;
+                    }
+                    d = c[j >> 2] | 0;
+                  }
+                  c[f >> 2] = d;
+                  d = 0;
+                } else if ((p | 0) == 7) {
+                  c[f >> 2] = g;
+                  d = 0;
+                } else if ((p | 0) == 12) {
+                  c[k >> 2] = d;
+                  d = 4;
+                } else if ((p | 0) == 13)
+                  if (!(a[(b + 480) >> 0] | 0)) {
+                    c[f >> 2] = g;
+                    d = 0;
+                  } else d = 5;
+                else if ((p | 0) == 15)
+                  if (!(a[(b + 480) >> 0] | 0)) {
+                    c[f >> 2] = g;
+                    d = 0;
+                  } else d = 6;
+                else if ((p | 0) == 18) {
+                  c[f >> 2] = d;
+                  d = 0;
+                }
+              while (0);
+              l = q;
+              return d | 0;
+            }
+            function OZ(b, d, e, f, g, h) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0;
+              B = l;
+              l = (l + 16) | 0;
+              y = (B + 8) | 0;
+              z = (B + 4) | 0;
+              x = B;
+              i = c[e >> 2] | 0;
+              c[y >> 2] = i;
+              if ((c[(b + 144) >> 2] | 0) == (d | 0)) {
+                s = (b + 284) | 0;
+                c[s >> 2] = i;
+                t = (b + 288) | 0;
+              } else {
+                t = c[(b + 296) >> 2] | 0;
+                s = t;
+                t = (t + 4) | 0;
+              }
+              c[s >> 2] = i;
+              c[e >> 2] = 0;
+              k = (d + 8) | 0;
+              m = (b + 60) | 0;
+              u = (b + 80) | 0;
+              v = (b + 4) | 0;
+              w = (b + 476) | 0;
+              n = (d + 68) | 0;
+              o = (b + 44) | 0;
+              p = (d + 56) | 0;
+              q = (b + 48) | 0;
+              a: while (1) {
+                j = ob[c[k >> 2] & 127](d, c[y >> 2] | 0, f, z) | 0;
+                i = c[z >> 2] | 0;
+                c[t >> 2] = i;
+                r = i;
+                b: do
+                  switch (j | 0) {
+                    case 40: {
+                      A = 6;
+                      break a;
+                    }
+                    case 0: {
+                      A = 23;
+                      break a;
+                    }
+                    case -2: {
+                      A = 24;
+                      break a;
+                    }
+                    case -4:
+                    case -1: {
+                      A = 26;
+                      break a;
+                    }
+                    case 7: {
+                      i = c[m >> 2] | 0;
+                      if (i | 0) {
+                        a[x >> 0] = 10;
+                        vb[i & 127](c[v >> 2] | 0, x, 1);
+                        break b;
+                      }
+                      if (c[u >> 2] | 0) yZ(b, d, c[y >> 2] | 0, r);
+                      break;
+                    }
+                    case 6: {
+                      j = c[m >> 2] | 0;
+                      if (!j) {
+                        if (!(c[u >> 2] | 0)) break b;
+                        yZ(b, d, c[y >> 2] | 0, r);
+                        break b;
+                      }
+                      if (!(a[n >> 0] | 0)) i = r;
+                      else {
+                        r = c[y >> 2] | 0;
+                        vb[j & 127](c[v >> 2] | 0, r, (i - r) | 0);
+                        break b;
+                      }
+                      while (1) {
+                        c[x >> 2] = c[o >> 2];
+                        r = pb[c[p >> 2] & 127](d, y, i, x, c[q >> 2] | 0) | 0;
+                        c[t >> 2] = c[z >> 2];
+                        i = c[o >> 2] | 0;
+                        vb[j & 127](c[v >> 2] | 0, i, ((c[x >> 2] | 0) - i) | 0);
+                        if (r >>> 0 < 2) break;
+                        c[s >> 2] = c[y >> 2];
+                        i = c[z >> 2] | 0;
+                      }
+                      break;
+                    }
+                    default: {
+                      A = 28;
+                      break a;
+                    }
+                  }
+                while (0);
+                r = c[z >> 2] | 0;
+                c[y >> 2] = r;
+                c[s >> 2] = r;
+                switch (c[w >> 2] | 0) {
+                  case 3: {
+                    A = 30;
+                    break a;
+                  }
+                  case 2: {
+                    i = 35;
+                    break a;
+                  }
+                  default: {
+                  }
+                }
+              }
+              if ((A | 0) == 6) {
+                i = c[(b + 76) >> 2] | 0;
+                if (!i) {
+                  if (c[u >> 2] | 0) yZ(b, d, c[y >> 2] | 0, r);
+                } else tb[i & 127](c[v >> 2] | 0);
+                i = c[z >> 2] | 0;
+                c[e >> 2] = i;
+                c[g >> 2] = i;
+                i = (c[w >> 2] | 0) == 2 ? 35 : 0;
+              } else if ((A | 0) == 23) {
+                c[s >> 2] = i;
+                i = 4;
+              } else if ((A | 0) == 24)
+                if (!((h << 24) >> 24)) i = 6;
+                else {
+                  c[g >> 2] = c[y >> 2];
+                  i = 0;
+                }
+              else if ((A | 0) == 26)
+                if (!((h << 24) >> 24)) i = 20;
+                else {
+                  c[g >> 2] = c[y >> 2];
+                  i = 0;
+                }
+              else if ((A | 0) == 28) {
+                c[s >> 2] = i;
+                i = 23;
+              } else if ((A | 0) == 30) {
+                c[g >> 2] = c[z >> 2];
+                i = 0;
+              }
+              l = B;
+              return i | 0;
+            }
+            function PZ(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0;
+              h = l;
+              l = (l + 16) | 0;
+              g = h;
+              c[g >> 2] = d;
+              d = OZ(b, c[(b + 144) >> 2] | 0, g, e, f, ((a[(b + 480) >> 0] | 0) == 0) & 1) | 0;
+              g = c[g >> 2] | 0;
+              do
+                if (!(((d | 0) != 0) | ((g | 0) == 0))) {
+                  d = (b + 276) | 0;
+                  if (!(c[(b + 472) >> 2] | 0)) {
+                    c[d >> 2] = 58;
+                    d = pZ(b, g, e, f) | 0;
+                    break;
+                  } else {
+                    c[d >> 2] = 63;
+                    d = QZ(b, g, e, f) | 0;
+                    break;
+                  }
+                }
+              while (0);
+              l = h;
+              return d | 0;
+            }
+            function QZ(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              d = IZ(b, 1, c[(b + 144) >> 2] | 0, d, e, f, ((a[(b + 480) >> 0] | 0) == 0) & 1) | 0;
+              if ((d | 0) == 0 ? ((RZ(b) | 0) << 24) >> 24 == 0 : 0) d = 1;
+              return d | 0;
+            }
+            function RZ(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              m = (a + 16) | 0;
+              a = (a + 360) | 0;
+              while (1) {
+                a = c[a >> 2] | 0;
+                if (!a) {
+                  a = 1;
+                  break;
+                }
+                i = ((c[(a + 24) >> 2] | 0) + 1) | 0;
+                j = (a + 36) | 0;
+                f = c[j >> 2] | 0;
+                e = (f + i) | 0;
+                l = (a + 4) | 0;
+                d = c[l >> 2] | 0;
+                if ((d | 0) == (e | 0)) {
+                  a = 1;
+                  break;
+                }
+                k = (a + 8) | 0;
+                b = c[k >> 2] | 0;
+                g = (b + i) | 0;
+                h = (a + 40) | 0;
+                if ((g | 0) > (((c[h >> 2] | 0) - f) | 0)) {
+                  e = lb[c[m >> 2] & 127](f, g) | 0;
+                  if (!e) {
+                    a = 0;
+                    break;
+                  }
+                  b = (a + 12) | 0;
+                  f = c[j >> 2] | 0;
+                  if ((c[b >> 2] | 0) == (f | 0)) c[b >> 2] = e;
+                  b = (a + 16) | 0;
+                  d = c[b >> 2] | 0;
+                  if (d | 0) c[b >> 2] = e + (d - f);
+                  c[j >> 2] = e;
+                  c[h >> 2] = e + g;
+                  e = (e + i) | 0;
+                  d = c[l >> 2] | 0;
+                  b = c[k >> 2] | 0;
+                }
+                W6(e | 0, d | 0, b | 0) | 0;
+                c[l >> 2] = e;
+              }
+              return a | 0;
+            }
+            function SZ(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              f = (b + 12) | 0;
+              g = (b + 8) | 0;
+              while (1) {
+                e = c[f >> 2] | 0;
+                if ((e | 0) == (c[g >> 2] | 0)) {
+                  if (!(((vZ(b) | 0) << 24) >> 24)) {
+                    d = 0;
+                    break;
+                  }
+                  e = c[f >> 2] | 0;
+                }
+                i = a[d >> 0] | 0;
+                c[f >> 2] = e + 1;
+                a[e >> 0] = i;
+                if (!(a[d >> 0] | 0)) {
+                  h = 6;
+                  break;
+                } else d = (d + 1) | 0;
+              }
+              if ((h | 0) == 6) {
+                i = (b + 16) | 0;
+                d = c[i >> 2] | 0;
+                c[i >> 2] = c[f >> 2];
+              }
+              return d | 0;
+            }
+            function TZ(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0;
+              n = c[(b + 352) >> 2] | 0;
+              j = (n + 80) | 0;
+              k = (n + 92) | 0;
+              l = (n + 88) | 0;
+              m = (n + 60) | 0;
+              n = (n + 96) | 0;
+              i = (d + 4) | 0;
+              h = c[d >> 2] | 0;
+              a: while (1) {
+                switch (a[h >> 0] | 0) {
+                  case 0: {
+                    e = 1;
+                    break a;
+                  }
+                  case 58: {
+                    g = c[d >> 2] | 0;
+                    while (1) {
+                      e = c[k >> 2] | 0;
+                      f = (e | 0) == (c[l >> 2] | 0);
+                      if ((g | 0) == (h | 0)) break;
+                      if (f) {
+                        if (!(((vZ(j) | 0) << 24) >> 24)) {
+                          e = 0;
+                          break a;
+                        }
+                        e = c[k >> 2] | 0;
+                      }
+                      f = a[g >> 0] | 0;
+                      c[k >> 2] = e + 1;
+                      a[e >> 0] = f;
+                      g = (g + 1) | 0;
+                    }
+                    if (f) {
+                      if (!(((vZ(j) | 0) << 24) >> 24)) {
+                        e = 0;
+                        break a;
+                      }
+                      e = c[k >> 2] | 0;
+                    }
+                    c[k >> 2] = e + 1;
+                    a[e >> 0] = 0;
+                    e = nZ(b, m, c[n >> 2] | 0, 8) | 0;
+                    if (!e) {
+                      e = 0;
+                      break a;
+                    }
+                    f = c[n >> 2] | 0;
+                    if ((c[e >> 2] | 0) == (f | 0)) c[n >> 2] = c[k >> 2];
+                    else c[k >> 2] = f;
+                    c[i >> 2] = e;
+                    break;
+                  }
+                  default: {
+                  }
+                }
+                h = (h + 1) | 0;
+              }
+              return e | 0;
+            }
+            function UZ(b, d, e, f, g) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              k = a[f >> 0] | 0;
+              i = c[d >> 2] | 0;
+              h = (i | 0) == 0;
+              do
+                if (!((k << 24) >> 24))
+                  if (h) {
+                    m = 0;
+                    j = 11;
+                  } else h = 28;
+                else if (
+                  ((!h ? (a[i >> 0] | 0) == 120 : 0) ? (a[(i + 1) >> 0] | 0) == 109 : 0)
+                    ? (a[(i + 2) >> 0] | 0) == 108
+                    : 0
+                ) {
+                  h = a[(i + 3) >> 0] | 0;
+                  if (((h << 24) >> 24 == 110 ? (a[(i + 4) >> 0] | 0) == 115 : 0) ? (a[(i + 5) >> 0] | 0) == 0 : 0) {
+                    h = 39;
+                    break;
+                  }
+                  m = ((h << 24) >> 24 == 0) & 1;
+                  j = 11;
+                } else {
+                  m = 0;
+                  j = 11;
+                }
+              while (0);
+              a: do
+                if ((j | 0) == 11) {
+                  l = (m << 24) >> 24 != 0;
+                  h = 1;
+                  i = 1;
+                  n = 0;
+                  while (1) {
+                    j = (i << 24) >> 24 != 0;
+                    if (!((k << 24) >> 24)) break;
+                    do
+                      if (j) {
+                        if ((n | 0) <= 36 ? (k << 24) >> 24 == (a[(142257 + n) >> 0] | 0) : 0) break;
+                        i = 0;
+                      } else i = 0;
+                    while (0);
+                    do
+                      if (!(l | ((h << 24) >> 24 == 0))) {
+                        if ((n | 0) <= 29 ? (k << 24) >> 24 == (a[(142294 + n) >> 0] | 0) : 0) break;
+                        h = 0;
+                      }
+                    while (0);
+                    k = (n + 1) | 0;
+                    n = k;
+                    k = a[(f + k) >> 0] | 0;
+                  }
+                  if (((m & 255) | 0) != ((j & ((n | 0) == 36) & 1) | 0)) {
+                    h = l ? 38 : 40;
+                    break;
+                  }
+                  if (!(((h << 24) >> 24 != 0) & ((n | 0) == 29))) {
+                    o = (b + 468) | 0;
+                    n = (n + (((a[o >> 0] | 0) != 0) & 1)) | 0;
+                    h = (b + 372) | 0;
+                    j = c[h >> 2] | 0;
+                    do
+                      if (!j) {
+                        h = (b + 12) | 0;
+                        i = kb[c[h >> 2] & 63](28) | 0;
+                        if (!i) {
+                          h = 1;
+                          break a;
+                        }
+                        j = (n + 24) | 0;
+                        m = kb[c[h >> 2] & 63](j) | 0;
+                        c[(i + 16) >> 2] = m;
+                        if (!m) {
+                          tb[c[(b + 20) >> 2] & 127](i);
+                          h = 1;
+                          break a;
+                        } else {
+                          c[(i + 24) >> 2] = j;
+                          j = i;
+                          break;
+                        }
+                      } else {
+                        i = (j + 24) | 0;
+                        if ((n | 0) > (c[i >> 2] | 0)) {
+                          k = (j + 16) | 0;
+                          l = (n + 24) | 0;
+                          m = lb[c[(b + 16) >> 2] & 127](c[k >> 2] | 0, l) | 0;
+                          if (!m) {
+                            h = 1;
+                            break a;
+                          }
+                          c[k >> 2] = m;
+                          c[i >> 2] = l;
+                        }
+                        c[h >> 2] = c[(j + 4) >> 2];
+                      }
+                    while (0);
+                    c[(j + 20) >> 2] = n;
+                    i = (j + 16) | 0;
+                    W6(c[i >> 2] | 0, f | 0, n | 0) | 0;
+                    h = a[o >> 0] | 0;
+                    if ((h << 24) >> 24) a[((c[i >> 2] | 0) + (n + -1)) >> 0] = h;
+                    c[j >> 2] = d;
+                    c[(j + 12) >> 2] = e;
+                    i = (d + 4) | 0;
+                    c[(j + 8) >> 2] = c[i >> 2];
+                    if ((a[f >> 0] | 0) == 0 ? (((c[(b + 352) >> 2] | 0) + 152) | 0) == (d | 0) : 0) h = 0;
+                    else h = j;
+                    c[i >> 2] = h;
+                    c[(j + 4) >> 2] = c[g >> 2];
+                    c[g >> 2] = j;
+                    if ((e | 0) != 0 ? ((p = c[(b + 100) >> 2] | 0), (p | 0) != 0) : 0) {
+                      vb[p & 127](c[(b + 4) >> 2] | 0, c[d >> 2] | 0, c[i >> 2] | 0 ? f : 0);
+                      h = 0;
+                    } else h = 0;
+                  } else h = 40;
+                }
+              while (0);
+              return h | 0;
+            }
+            function VZ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = b;
+              c[d >> 2] = 0;
+              c[(d + 4) >> 2] = 0;
+              b = (b + 8) | 0;
+              c[b >> 2] = $Z(a) | 0;
+              c[(b + 4) >> 2] = 0;
+              return;
+            }
+            function WZ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              d = b;
+              g = c[(d + 4) >> 2] ^ 1936682341;
+              e = a;
+              c[e >> 2] = c[d >> 2] ^ 1886610805;
+              c[(e + 4) >> 2] = g;
+              e = (b + 8) | 0;
+              g = e;
+              d = c[(g + 4) >> 2] ^ 1685025377;
+              f = (a + 8) | 0;
+              c[f >> 2] = c[g >> 2] ^ 1852075885;
+              c[(f + 4) >> 2] = d;
+              f = b;
+              b = c[(f + 4) >> 2] ^ 1819895653;
+              d = (a + 16) | 0;
+              c[d >> 2] = c[f >> 2] ^ 1852142177;
+              c[(d + 4) >> 2] = b;
+              d = c[(e + 4) >> 2] ^ 1952801890;
+              b = (a + 24) | 0;
+              c[b >> 2] = c[e >> 2] ^ 2037671283;
+              c[(b + 4) >> 2] = d;
+              c[(a + 40) >> 2] = a + 32;
+              b = (a + 48) | 0;
+              c[b >> 2] = 0;
+              c[(b + 4) >> 2] = 0;
+              return;
+            }
+            function XZ(b, e, f) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                A = 0,
+                B = 0;
+              n = (e + f) | 0;
+              o = (b + 40) | 0;
+              p = (b + 40) | 0;
+              q = (b + 32) | 0;
+              r = (b + 33) | 0;
+              s = (b + 34) | 0;
+              t = (b + 35) | 0;
+              h = (b + 36) | 0;
+              i = (b + 37) | 0;
+              j = (b + 38) | 0;
+              k = (b + 39) | 0;
+              l = (b + 24) | 0;
+              m = (b + 48) | 0;
+              f = e;
+              do {
+                while (1) {
+                  g = c[o >> 2] | 0;
+                  if (f >>> 0 >= n >>> 0) {
+                    e = 0;
+                    break;
+                  }
+                  if (g >>> 0 >= p >>> 0) {
+                    e = 1;
+                    break;
+                  }
+                  e = a[f >> 0] | 0;
+                  c[o >> 2] = g + 1;
+                  a[g >> 0] = e;
+                  f = (f + 1) | 0;
+                }
+                if (g >>> 0 < p >>> 0) break;
+                A = d[q >> 0] | 0;
+                B = R6(d[r >> 0] | 0 | 0, 0, 8) | 0;
+                g = z;
+                y = R6(d[s >> 0] | 0 | 0, 0, 16) | 0;
+                g = g | z;
+                w = R6(d[t >> 0] | 0 | 0, 0, 24) | 0;
+                g = g | z | (d[h >> 0] | 0);
+                u = R6(d[i >> 0] | 0 | 0, 0, 40) | 0;
+                g = g | z;
+                x = R6(d[j >> 0] | 0 | 0, 0, 48) | 0;
+                g = g | z;
+                v = R6(d[k >> 0] | 0 | 0, 0, 56) | 0;
+                v = B | A | y | w | u | x | v;
+                g = g | z;
+                x = l;
+                u = g ^ c[(x + 4) >> 2];
+                w = l;
+                c[w >> 2] = v ^ c[x >> 2];
+                c[(w + 4) >> 2] = u;
+                _Z(b, 2);
+                w = b;
+                g = c[(w + 4) >> 2] ^ g;
+                u = b;
+                c[u >> 2] = c[w >> 2] ^ v;
+                c[(u + 4) >> 2] = g;
+                c[o >> 2] = q;
+                u = m;
+                u = J6(c[u >> 2] | 0, c[(u + 4) >> 2] | 0, 8, 0) | 0;
+                g = m;
+                c[g >> 2] = u;
+                c[(g + 4) >> 2] = z;
+              } while (e);
+              return;
+            }
+            function YZ(b) {
+              b = b | 0;
+              var c = 0;
+              c = 0;
+              while (1) {
+                if (!(a[b >> 0] | 0)) break;
+                c = (c + 1) | 0;
+                b = (b + 1) | 0;
+              }
+              return c | 0;
+            }
+            function ZZ(a) {
+              a = a | 0;
+              var b = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              f = (a + 32) | 0;
+              h = ((c[(a + 40) >> 2] | 0) - f) | 0;
+              e = (a + 48) | 0;
+              e = J6(c[e >> 2] | 0, c[(e + 4) >> 2] | 0, h | 0, 0) | 0;
+              e = R6(e | 0, z | 0, 56) | 0;
+              b = z;
+              switch (((h << 24) >> 24) | 0) {
+                case 7: {
+                  e = R6(d[(a + 38) >> 0] | 0 | 0, 0, 48) | 0 | e;
+                  b = z | b;
+                  g = 3;
+                  break;
+                }
+                case 6: {
+                  g = 3;
+                  break;
+                }
+                case 5: {
+                  g = 4;
+                  break;
+                }
+                case 4: {
+                  g = 5;
+                  break;
+                }
+                case 3: {
+                  g = 6;
+                  break;
+                }
+                case 2: {
+                  g = 7;
+                  break;
+                }
+                case 1: {
+                  g = 8;
+                  break;
+                }
+                default: {
+                }
+              }
+              if ((g | 0) == 3) {
+                h = R6(d[(a + 37) >> 0] | 0 | 0, 0, 40) | 0;
+                e = h | e;
+                b = z | b;
+                g = 4;
+              }
+              if ((g | 0) == 4) {
+                b = d[(a + 36) >> 0] | 0 | b;
+                g = 5;
+              }
+              if ((g | 0) == 5) {
+                h = R6(d[(a + 35) >> 0] | 0 | 0, 0, 24) | 0;
+                e = h | e;
+                b = z | b;
+                g = 6;
+              }
+              if ((g | 0) == 6) {
+                h = R6(d[(a + 34) >> 0] | 0 | 0, 0, 16) | 0;
+                e = h | e;
+                b = z | b;
+                g = 7;
+              }
+              if ((g | 0) == 7) {
+                h = R6(d[(a + 33) >> 0] | 0 | 0, 0, 8) | 0;
+                b = z | b;
+                e = h | e;
+                g = 8;
+              }
+              if ((g | 0) == 8) e = e | (d[f >> 0] | 0);
+              h = (a + 24) | 0;
+              i = h;
+              g = c[(i + 4) >> 2] ^ b;
+              f = h;
+              c[f >> 2] = c[i >> 2] ^ e;
+              c[(f + 4) >> 2] = g;
+              _Z(a, 2);
+              f = a;
+              b = c[(f + 4) >> 2] ^ b;
+              g = a;
+              c[g >> 2] = c[f >> 2] ^ e;
+              c[(g + 4) >> 2] = b;
+              g = (a + 16) | 0;
+              b = g;
+              e = c[(b + 4) >> 2] | 0;
+              f = g;
+              c[f >> 2] = c[b >> 2] ^ 255;
+              c[(f + 4) >> 2] = e;
+              _Z(a, 4);
+              f = a;
+              a = (a + 8) | 0;
+              z = c[(a + 4) >> 2] ^ c[(f + 4) >> 2] ^ c[(g + 4) >> 2] ^ c[(h + 4) >> 2];
+              return (c[a >> 2] ^ c[f >> 2] ^ c[g >> 2] ^ c[h >> 2]) | 0;
+            }
+            function _Z(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              e = (a + 8) | 0;
+              f = (a + 24) | 0;
+              g = (a + 16) | 0;
+              d = 0;
+              while (1) {
+                if ((d | 0) >= (b | 0)) break;
+                h = e;
+                n = c[h >> 2] | 0;
+                h = c[(h + 4) >> 2] | 0;
+                o = a;
+                o = J6(c[o >> 2] | 0, c[(o + 4) >> 2] | 0, n | 0, h | 0) | 0;
+                k = z;
+                m = R6(n | 0, h | 0, 13) | 0;
+                l = z;
+                h = Q6(n | 0, h | 0, 51) | 0;
+                h = (m | h) ^ o;
+                l = (l | z) ^ k;
+                m = f;
+                n = c[m >> 2] | 0;
+                m = c[(m + 4) >> 2] | 0;
+                j = g;
+                j = J6(c[j >> 2] | 0, c[(j + 4) >> 2] | 0, n | 0, m | 0) | 0;
+                i = z;
+                q = R6(n | 0, m | 0, 16) | 0;
+                p = z;
+                m = Q6(n | 0, m | 0, 48) | 0;
+                m = (q | m) ^ j;
+                p = (p | z) ^ i;
+                o = J6(k | 0, o | 0, m | 0, p | 0) | 0;
+                k = z;
+                q = a;
+                c[q >> 2] = o;
+                c[(q + 4) >> 2] = k;
+                q = R6(m | 0, p | 0, 21) | 0;
+                n = z;
+                p = Q6(m | 0, p | 0, 43) | 0;
+                m = f;
+                c[m >> 2] = (q | p) ^ o;
+                c[(m + 4) >> 2] = (n | z) ^ k;
+                i = J6(j | 0, i | 0, h | 0, l | 0) | 0;
+                j = z;
+                m = R6(h | 0, l | 0, 17) | 0;
+                k = z;
+                l = Q6(h | 0, l | 0, 47) | 0;
+                h = e;
+                c[h >> 2] = (m | l) ^ i;
+                c[(h + 4) >> 2] = (k | z) ^ j;
+                h = g;
+                c[h >> 2] = j;
+                c[(h + 4) >> 2] = i;
+                d = (d + 1) | 0;
+              }
+              return;
+            }
+            function $Z(a) {
+              a = a | 0;
+              var b = 0;
+              while (1) {
+                b = c[(a + 472) >> 2] | 0;
+                if (!b) break;
+                else a = b;
+              }
+              return c[(a + 492) >> 2] | 0;
+            }
+            function a_(b, d, e, f, g, h) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0;
+              L = l;
+              l = (l + 16) | 0;
+              I = L;
+              J = (L + 4) | 0;
+              K = c[(b + 352) >> 2] | 0;
+              o = (d + 16) | 0;
+              p = (d + 40) | 0;
+              q = (b + 144) | 0;
+              r = (b + 284) | 0;
+              s = (e << 24) >> 24 == 0;
+              t = (h + 12) | 0;
+              v = (h + 16) | 0;
+              w = (h + 8) | 0;
+              x = (d + 44) | 0;
+              y = (d + 64) | 0;
+              z = (b + 436) | 0;
+              A = (b + 452) | 0;
+              B = (b + 448) | 0;
+              C = ((K + 80) | 0) == (h | 0);
+              D = (b + 268) | 0;
+              E = (K + 130) | 0;
+              F = (K + 129) | 0;
+              G = (b + 296) | 0;
+              H = (b + 224) | 0;
+              i = 0;
+              a: while (1) {
+                b: while (1) {
+                  switch (ob[c[o >> 2] & 127](d, f, g, I) | 0) {
+                    case -4: {
+                      i = 0;
+                      n = 61;
+                      break a;
+                    }
+                    case 0: {
+                      n = 4;
+                      break a;
+                    }
+                    case -1: {
+                      n = 6;
+                      break a;
+                    }
+                    case 6: {
+                      n = 21;
+                      break b;
+                    }
+                    case -3: {
+                      n = 22;
+                      break b;
+                    }
+                    case 7:
+                    case 39: {
+                      n = 23;
+                      break b;
+                    }
+                    case 10: {
+                      j = lb[c[p >> 2] & 127](d, f) | 0;
+                      c: do
+                        if ((j | 0) < 0)
+                          if ((c[q >> 2] | 0) == (d | 0)) {
+                            c[r >> 2] = f;
+                            j = 1;
+                            i = 14;
+                          } else {
+                            j = 1;
+                            i = 14;
+                          }
+                        else {
+                          if (s & ((j | 0) == 32)) {
+                            k = c[t >> 2] | 0;
+                            if ((c[v >> 2] | 0) == (k | 0)) {
+                              j = 4;
+                              break;
+                            }
+                            if ((a[(k + -1) >> 0] | 0) == 32) {
+                              j = 4;
+                              break;
+                            }
+                          }
+                          m = x_(j, J) | 0;
+                          k = 0;
+                          while (1) {
+                            if ((k | 0) >= (m | 0)) {
+                              j = 0;
+                              break c;
+                            }
+                            j = c[t >> 2] | 0;
+                            if ((j | 0) == (c[w >> 2] | 0)) {
+                              if (!(((vZ(h) | 0) << 24) >> 24)) {
+                                j = 1;
+                                i = 1;
+                                break c;
+                              }
+                              j = c[t >> 2] | 0;
+                            }
+                            M = a[(J + k) >> 0] | 0;
+                            c[t >> 2] = j + 1;
+                            a[j >> 0] = M;
+                            k = (k + 1) | 0;
+                          }
+                        }
+                      while (0);
+                      switch (j & 7) {
+                        case 4:
+                        case 0:
+                          break b;
+                        default: {
+                        }
+                      }
+                      break;
+                    }
+                    case 9: {
+                      j = c[y >> 2] | 0;
+                      j = (nb[c[x >> 2] & 63](d, (f + j) | 0, ((c[I >> 2] | 0) + (0 - j)) | 0) | 0) & 255;
+                      if ((j << 24) >> 24) {
+                        n = 31;
+                        break b;
+                      }
+                      j = c[y >> 2] | 0;
+                      j = lZ(z, d, (f + j) | 0, ((c[I >> 2] | 0) + (0 - j)) | 0) | 0;
+                      if (!j) {
+                        i = 1;
+                        n = 61;
+                        break a;
+                      }
+                      m = nZ(b, K, j, 0) | 0;
+                      c[B >> 2] = c[A >> 2];
+                      do
+                        if (C) {
+                          if (!(c[D >> 2] | 0))
+                            if (!m) break b;
+                            else break;
+                          if (!(a[E >> 0] | 0)) {
+                            j = (m | 0) != 0;
+                            if (!(a[F >> 0] | 0)) {
+                              n = 45;
+                              break;
+                            } else {
+                              u = j;
+                              n = 47;
+                              break;
+                            }
+                          } else {
+                            j = (m | 0) != 0;
+                            if (!(c[G >> 2] | 0)) {
+                              n = 45;
+                              break;
+                            } else {
+                              u = j;
+                              n = 47;
+                              break;
+                            }
+                          }
+                        } else if (!(a[F >> 0] | 0))
+                          if (!m) {
+                            i = 11;
+                            n = 61;
+                            break a;
+                          } else {
+                            n = 46;
+                            break;
+                          }
+                        else {
+                          j = (m | 0) != 0;
+                          if (!(a[E >> 0] | 0)) {
+                            u = j;
+                            n = 47;
+                            break;
+                          } else {
+                            n = 45;
+                            break;
+                          }
+                        }
+                      while (0);
+                      if ((n | 0) == 45)
+                        if (j) n = 46;
+                        else {
+                          i = 11;
+                          n = 61;
+                          break a;
+                        }
+                      else if ((n | 0) == 47 ? ((n = 0), !u) : 0) break b;
+                      if ((n | 0) == 46 ? ((n = 0), (a[(m + 34) >> 0] | 0) == 0) : 0) {
+                        i = 24;
+                        n = 61;
+                        break a;
+                      }
+                      k = (m + 32) | 0;
+                      if (a[k >> 0] | 0) {
+                        n = 49;
+                        break a;
+                      }
+                      if (c[(m + 28) >> 2] | 0) {
+                        n = 52;
+                        break a;
+                      }
+                      j = c[(m + 4) >> 2] | 0;
+                      if (!j) {
+                        n = 55;
+                        break a;
+                      }
+                      m = (j + (c[(m + 8) >> 2] | 0)) | 0;
+                      a[k >> 0] = 1;
+                      m = a_(b, c[H >> 2] | 0, e, j, m, h) | 0;
+                      a[k >> 0] = 0;
+                      j = (m | 0) == 0;
+                      if (j) break b;
+                      else {
+                        j = (j ^ 1) & 1;
+                        i = m;
+                      }
+                      break;
+                    }
+                    default: {
+                      n = 58;
+                      break a;
+                    }
+                  }
+                  if (j) break a;
+                }
+                if ((n | 0) == 21) {
+                  n = 0;
+                  if (!(tZ(h, d, f, c[I >> 2] | 0) | 0)) {
+                    i = 1;
+                    n = 61;
+                    break;
+                  }
+                } else if ((n | 0) == 22) {
+                  c[I >> 2] = f + (c[y >> 2] | 0);
+                  n = 23;
+                } else if ((n | 0) == 31) {
+                  n = 0;
+                  f = c[t >> 2] | 0;
+                  if ((f | 0) == (c[w >> 2] | 0)) {
+                    if (!(((vZ(h) | 0) << 24) >> 24)) {
+                      i = 1;
+                      n = 61;
+                      break;
+                    }
+                    f = c[t >> 2] | 0;
+                  }
+                  c[t >> 2] = f + 1;
+                  a[f >> 0] = j;
+                }
+                do
+                  if ((n | 0) == 23) {
+                    n = 0;
+                    f = c[t >> 2] | 0;
+                    if (s) {
+                      if ((c[v >> 2] | 0) == (f | 0)) break;
+                      if ((a[(f + -1) >> 0] | 0) == 32) break;
+                    }
+                    if ((f | 0) == (c[w >> 2] | 0)) {
+                      if (!(((vZ(h) | 0) << 24) >> 24)) {
+                        i = 1;
+                        n = 61;
+                        break a;
+                      }
+                      f = c[t >> 2] | 0;
+                    }
+                    c[t >> 2] = f + 1;
+                    a[f >> 0] = 32;
+                  }
+                while (0);
+                f = c[I >> 2] | 0;
+              }
+              if ((n | 0) == 4)
+                if ((c[q >> 2] | 0) == (d | 0)) {
+                  c[r >> 2] = c[I >> 2];
+                  i = 4;
+                  n = 61;
+                } else {
+                  i = 4;
+                  n = 61;
+                }
+              else if ((n | 0) == 6)
+                if ((c[q >> 2] | 0) == (d | 0)) {
+                  c[r >> 2] = f;
+                  i = 4;
+                  n = 61;
+                } else {
+                  i = 4;
+                  n = 61;
+                }
+              else if ((n | 0) == 49)
+                if ((c[q >> 2] | 0) == (d | 0)) {
+                  c[r >> 2] = f;
+                  i = 12;
+                  n = 61;
+                } else {
+                  i = 12;
+                  n = 61;
+                }
+              else if ((n | 0) == 52)
+                if ((c[q >> 2] | 0) == (d | 0)) {
+                  c[r >> 2] = f;
+                  i = 15;
+                  n = 61;
+                } else {
+                  i = 15;
+                  n = 61;
+                }
+              else if ((n | 0) == 55)
+                if ((c[q >> 2] | 0) == (d | 0)) {
+                  c[r >> 2] = f;
+                  i = 16;
+                  n = 61;
+                } else {
+                  i = 16;
+                  n = 61;
+                }
+              else if ((n | 0) == 58)
+                if ((c[q >> 2] | 0) == (d | 0)) {
+                  c[r >> 2] = f;
+                  i = 23;
+                  n = 61;
+                } else {
+                  i = 23;
+                  n = 61;
+                }
+              l = L;
+              return i | 0;
+            }
+            function b_(a) {
+              a = a | 0;
+              var b = 0;
+              b = (a + 8) | 0;
+              return ((a | 0) < 1 ? 0 : (b | 0) > 0 ? b : 0) | 0;
+            }
+            function c_(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0,
+                d = 0,
+                e = 0;
+              c = l;
+              l = (l + 80) | 0;
+              d = (c + 16) | 0;
+              e = c;
+              VZ(a, e);
+              WZ(d, e);
+              XZ(d, b, YZ(b) | 0);
+              b = ZZ(d) | 0;
+              l = c;
+              return b | 0;
+            }
+            function d_(b, c) {
+              b = b | 0;
+              c = c | 0;
+              var d = 0;
+              while (1) {
+                d = a[b >> 0] | 0;
+                if ((d << 24) >> 24 != (a[c >> 0] | 0)) {
+                  c = 0;
+                  break;
+                }
+                if (!((d << 24) >> 24)) {
+                  c = 1;
+                  break;
+                }
+                c = (c + 1) | 0;
+                b = (b + 1) | 0;
+              }
+              return c | 0;
+            }
+            function e_(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 1040) | 0;
+              i = k;
+              f = c[(b + 124) >> 2] | 0;
+              a: do
+                if (!f) e = 18;
+                else {
+                  e = 0;
+                  while (1) {
+                    if ((e | 0) == 256) break;
+                    c[(i + (e << 2)) >> 2] = -1;
+                    e = (e + 1) | 0;
+                  }
+                  g = (i + 1028) | 0;
+                  c[g >> 2] = 0;
+                  j = (i + 1024) | 0;
+                  c[j >> 2] = 0;
+                  h = (i + 1032) | 0;
+                  c[h >> 2] = 0;
+                  do
+                    if (nb[f & 63](c[(b + 244) >> 2] | 0, d, i) | 0) {
+                      f = c[(b + 12) >> 2] | 0;
+                      e = y_() | 0;
+                      e = kb[f & 63](e) | 0;
+                      c[(b + 236) >> 2] = e;
+                      if (!e) {
+                        e = c[h >> 2] | 0;
+                        if (!e) e = 1;
+                        else {
+                          tb[e & 127](c[j >> 2] | 0);
+                          e = 1;
+                        }
+                      } else {
+                        e =
+                          ob[((a[(b + 232) >> 0] << 24) >> 24 ? 65 : 64) & 127](e, i, c[g >> 2] | 0, c[j >> 2] | 0) | 0;
+                        if (!e) break;
+                        c[(b + 240) >> 2] = c[j >> 2];
+                        c[(b + 248) >> 2] = c[h >> 2];
+                        c[(b + 144) >> 2] = e;
+                        e = 0;
+                      }
+                      break a;
+                    }
+                  while (0);
+                  e = c[h >> 2] | 0;
+                  if (e | 0) tb[e & 127](c[j >> 2] | 0);
+                  e = 18;
+                }
+              while (0);
+              l = k;
+              return e | 0;
+            }
+            function f_(b, d) {
+              b = b | 0;
+              d = d | 0;
+              a[(b + 4) >> 0] = 0;
+              c[(b + 8) >> 2] = 0;
+              c[(b + 12) >> 2] = 0;
+              c[b >> 2] = 0;
+              c[(b + 16) >> 2] = d;
+              return;
+            }
+            function g_(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0;
+              l = c[(b + 352) >> 2] | 0;
+              m = (b + 424) | 0;
+              n = (b + 420) | 0;
+              o = (b + 412) | 0;
+              p = (b + 428) | 0;
+              q = (l + 152) | 0;
+              r = (b + 368) | 0;
+              j = (l + 60) | 0;
+              k = (l + 80) | 0;
+              a: while (1) {
+                h = d;
+                b: while (1) {
+                  if (!(a[d >> 0] | 0)) {
+                    d = 1;
+                    break a;
+                  }
+                  f = a[h >> 0] | 0;
+                  switch ((f << 24) >> 24) {
+                    case 0:
+                    case 12: {
+                      s = 5;
+                      break b;
+                    }
+                    case 61:
+                      break b;
+                    default: {
+                    }
+                  }
+                  e = c[m >> 2] | 0;
+                  if ((e | 0) == (c[n >> 2] | 0)) {
+                    if (!(((vZ(o) | 0) << 24) >> 24)) {
+                      d = 0;
+                      break a;
+                    }
+                    e = c[m >> 2] | 0;
+                    f = a[h >> 0] | 0;
+                  }
+                  c[m >> 2] = e + 1;
+                  a[e >> 0] = f;
+                  h = (h + 1) | 0;
+                }
+                if ((s | 0) == 5) {
+                  s = 0;
+                  d = c[m >> 2] | 0;
+                  if ((d | 0) == (c[n >> 2] | 0)) {
+                    if (!(((vZ(o) | 0) << 24) >> 24)) {
+                      d = 0;
+                      break;
+                    }
+                    d = c[m >> 2] | 0;
+                  }
+                  c[m >> 2] = d + 1;
+                  a[d >> 0] = 0;
+                  d = nZ(b, l, c[p >> 2] | 0, 0) | 0;
+                  if (d | 0) a[(d + 32) >> 0] = 1;
+                  d = (a[h >> 0] | 0) == 0 ? h : (h + 1) | 0;
+                  c[m >> 2] = c[p >> 2];
+                  continue;
+                }
+                d = c[m >> 2] | 0;
+                if ((c[p >> 2] | 0) == (d | 0)) f = q;
+                else {
+                  if ((d | 0) == (c[n >> 2] | 0)) {
+                    if (!(((vZ(o) | 0) << 24) >> 24)) {
+                      d = 0;
+                      break;
+                    }
+                    d = c[m >> 2] | 0;
+                  }
+                  c[m >> 2] = d + 1;
+                  a[d >> 0] = 0;
+                  f = nZ(b, j, c[p >> 2] | 0, 8) | 0;
+                  if (!f) {
+                    d = 0;
+                    break;
+                  }
+                  e = c[f >> 2] | 0;
+                  i = c[p >> 2] | 0;
+                  d = i;
+                  if ((e | 0) == (i | 0)) {
+                    i = SZ(k, e) | 0;
+                    c[f >> 2] = i;
+                    if (!i) {
+                      d = 0;
+                      break;
+                    }
+                    d = c[p >> 2] | 0;
+                  }
+                  c[m >> 2] = d;
+                }
+                c: while (1) {
+                  i = (h + 1) | 0;
+                  e = a[i >> 0] | 0;
+                  g = (d | 0) == (c[n >> 2] | 0);
+                  switch ((e << 24) >> 24) {
+                    case 0:
+                    case 12:
+                      break c;
+                    default: {
+                    }
+                  }
+                  if (g) {
+                    if (!(((vZ(o) | 0) << 24) >> 24)) {
+                      d = 0;
+                      break a;
+                    }
+                    d = c[m >> 2] | 0;
+                    e = a[i >> 0] | 0;
+                  }
+                  c[m >> 2] = d + 1;
+                  a[d >> 0] = e;
+                  h = i;
+                  d = c[m >> 2] | 0;
+                }
+                if (g) {
+                  if (!(((vZ(o) | 0) << 24) >> 24)) {
+                    d = 0;
+                    break;
+                  }
+                  d = c[m >> 2] | 0;
+                }
+                c[m >> 2] = d + 1;
+                a[d >> 0] = 0;
+                if (UZ(b, f, 0, c[p >> 2] | 0, r) | 0) {
+                  d = 0;
+                  break;
+                }
+                c[m >> 2] = c[p >> 2];
+                d = (a[i >> 0] | 0) == 0 ? i : (h + 2) | 0;
+              }
+              return d | 0;
+            }
+            function h_(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              if (a | 0 ? ((d = (a + 4) | 0), (e = (c[d >> 2] | 0) == (c[a >> 2] | 0)), (c[a >> 2] = b), e) : 0)
+                c[d >> 2] = b;
+              return;
+            }
+            function i_(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              if (a | 0) {
+                c[(a + 52) >> 2] = b;
+                c[(a + 56) >> 2] = d;
+              }
+              return;
+            }
+            function j_(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if (a | 0) c[(a + 60) >> 2] = b;
+              return;
+            }
+            function k_(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              g = (b | 0) == 0;
+              a: do
+                if (!(g | ((e | 0) < 0)) ? !(((d | 0) == 0) & ((e | 0) != 0)) : 0) {
+                  h = (b + 476) | 0;
+                  switch (c[h >> 2] | 0) {
+                    case 3: {
+                      c[(b + 280) >> 2] = 33;
+                      g = 0;
+                      break a;
+                    }
+                    case 2: {
+                      c[(b + 280) >> 2] = 36;
+                      g = 0;
+                      break a;
+                    }
+                    case 0: {
+                      if ((c[(b + 472) >> 2] | 0) == 0 ? ((l_(b) | 0) << 24) >> 24 == 0 : 0) {
+                        c[(b + 280) >> 2] = 1;
+                        g = 0;
+                        break a;
+                      }
+                      break;
+                    }
+                    default: {
+                    }
+                  }
+                  c[h >> 2] = 1;
+                  if (e | 0) {
+                    g = n_(b, e) | 0;
+                    if (!g) {
+                      g = 0;
+                      break;
+                    }
+                    W6(g | 0, d | 0, e | 0) | 0;
+                    g = o_(b, e, f) | 0;
+                    break;
+                  }
+                  a[(b + 480) >> 0] = f;
+                  if (!f) g = 1;
+                  else {
+                    g = (b + 24) | 0;
+                    j = c[g >> 2] | 0;
+                    d = (b + 292) | 0;
+                    c[d >> 2] = j;
+                    f = c[(b + 28) >> 2] | 0;
+                    c[(b + 40) >> 2] = f;
+                    e = (b + 276) | 0;
+                    f = ob[c[e >> 2] & 127](b, j, f, g) | 0;
+                    c[(b + 280) >> 2] = f;
+                    if (f | 0) {
+                      c[(b + 288) >> 2] = c[(b + 284) >> 2];
+                      c[e >> 2] = 66;
+                      g = 0;
+                      break;
+                    }
+                    switch (c[h >> 2] | 0) {
+                      case 3: {
+                        j = c[(b + 144) >> 2] | 0;
+                        xb[c[(j + 48) >> 2] & 31](j, c[d >> 2] | 0, c[g >> 2] | 0, (b + 404) | 0);
+                        c[d >> 2] = c[g >> 2];
+                        g = 2;
+                        break a;
+                      }
+                      case 1:
+                      case 0: {
+                        c[h >> 2] = 2;
+                        g = 1;
+                        break a;
+                      }
+                      default: {
+                        g = 1;
+                        break a;
+                      }
+                    }
+                  }
+                } else i = 3;
+              while (0);
+              if ((i | 0) == 3)
+                if (g) g = 0;
+                else {
+                  c[(b + 280) >> 2] = 41;
+                  g = 0;
+                }
+              return g | 0;
+            }
+            function l_(b) {
+              b = b | 0;
+              var d = 0;
+              d = (b + 492) | 0;
+              if (!(c[d >> 2] | 0)) c[d >> 2] = p_() | 0;
+              if (!(a[(b + 232) >> 0] | 0)) b = 1;
+              else b = g_(b, 142324) | 0;
+              return b | 0;
+            }
+            function m_(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              return c[(a + 280) >> 2] | 0;
+            }
+            function n_(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              a: do
+                if (!a) d = 0;
+                else {
+                  if ((b | 0) < 0) {
+                    c[(a + 280) >> 2] = 1;
+                    d = 0;
+                    break;
+                  }
+                  switch (c[(a + 476) >> 2] | 0) {
+                    case 3: {
+                      c[(a + 280) >> 2] = 33;
+                      d = 0;
+                      break a;
+                    }
+                    case 2: {
+                      c[(a + 280) >> 2] = 36;
+                      d = 0;
+                      break a;
+                    }
+                    default: {
+                      m = (a + 32) | 0;
+                      j = c[m >> 2] | 0;
+                      n = (a + 28) | 0;
+                      e = c[n >> 2] | 0;
+                      d = e;
+                      if (((j - e) | 0) >= (b | 0)) break a;
+                      p = (a + 24) | 0;
+                      k = c[p >> 2] | 0;
+                      i = (e - k) | 0;
+                      e = (i + b) | 0;
+                      if ((e | 0) < 0) {
+                        c[(a + 280) >> 2] = 1;
+                        d = 0;
+                        break a;
+                      }
+                      l = (a + 8) | 0;
+                      f = c[l >> 2] | 0;
+                      q = f;
+                      g = (k - q) | 0;
+                      h = (g | 0) > 1024;
+                      b = h ? 1024 : g;
+                      e = (b + e) | 0;
+                      do
+                        if ((e | 0) > ((j - q) | 0)) {
+                          d = (j - k) | 0;
+                          d = (d | 0) == 0 ? 1024 : d;
+                          do d = d << 1;
+                          while (((d | 0) < (e | 0)) & ((d | 0) > 0));
+                          if ((d | 0) < 1) {
+                            c[(a + 280) >> 2] = 1;
+                            d = 0;
+                            break a;
+                          }
+                          e = kb[c[(a + 12) >> 2] & 63](d) | 0;
+                          if (!e) {
+                            c[(a + 280) >> 2] = 1;
+                            d = 0;
+                            break a;
+                          }
+                          c[m >> 2] = e + d;
+                          d = c[p >> 2] | 0;
+                          if (!d) {
+                            d = (e + (c[n >> 2] | 0)) | 0;
+                            c[n >> 2] = d;
+                            c[l >> 2] = e;
+                            o = 22;
+                            break;
+                          } else {
+                            q = d;
+                            o = (q - (c[l >> 2] | 0)) | 0;
+                            o = (o | 0) < 1024 ? o : 1024;
+                            W6(e | 0, (d + (0 - o)) | 0, ((c[n >> 2] | 0) - q + o) | 0) | 0;
+                            tb[c[(a + 20) >> 2] & 127](c[l >> 2] | 0);
+                            c[l >> 2] = e;
+                            d = (e + ((c[n >> 2] | 0) - (c[p >> 2] | 0)) + o) | 0;
+                            c[n >> 2] = d;
+                            e = (e + o) | 0;
+                            o = 22;
+                            break;
+                          }
+                        } else if (h) {
+                          e = (g - b) | 0;
+                          X6(f | 0, (f + e) | 0, (b + i) | 0) | 0;
+                          e = (0 - e) | 0;
+                          d = ((c[n >> 2] | 0) + e) | 0;
+                          c[n >> 2] = d;
+                          e = ((c[p >> 2] | 0) + e) | 0;
+                          o = 22;
+                        }
+                      while (0);
+                      if ((o | 0) == 22) c[p >> 2] = e;
+                      c[(a + 288) >> 2] = 0;
+                      c[(a + 284) >> 2] = 0;
+                      c[(a + 292) >> 2] = 0;
+                      break a;
+                    }
+                  }
+                }
+              while (0);
+              return d | 0;
+            }
+            function o_(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              a: do
+                if (!b) d = 0;
+                else {
+                  f = (b + 476) | 0;
+                  switch (c[f >> 2] | 0) {
+                    case 3: {
+                      c[(b + 280) >> 2] = 33;
+                      d = 0;
+                      break a;
+                    }
+                    case 2: {
+                      c[(b + 280) >> 2] = 36;
+                      d = 0;
+                      break a;
+                    }
+                    case 0: {
+                      if ((c[(b + 472) >> 2] | 0) == 0 ? ((l_(b) | 0) << 24) >> 24 == 0 : 0) {
+                        c[(b + 280) >> 2] = 1;
+                        d = 0;
+                        break a;
+                      }
+                      break;
+                    }
+                    default: {
+                    }
+                  }
+                  c[f >> 2] = 1;
+                  g = (b + 24) | 0;
+                  j = c[g >> 2] | 0;
+                  h = (b + 292) | 0;
+                  c[h >> 2] = j;
+                  k = (b + 28) | 0;
+                  i = ((c[k >> 2] | 0) + d) | 0;
+                  c[k >> 2] = i;
+                  c[(b + 40) >> 2] = i;
+                  k = (b + 36) | 0;
+                  c[k >> 2] = (c[k >> 2] | 0) + d;
+                  a[(b + 480) >> 0] = e;
+                  d = (b + 276) | 0;
+                  i = ob[c[d >> 2] & 127](b, j, i, g) | 0;
+                  c[(b + 280) >> 2] = i;
+                  if (i | 0) {
+                    c[(b + 288) >> 2] = c[(b + 284) >> 2];
+                    c[d >> 2] = 66;
+                    d = 0;
+                    break;
+                  }
+                  switch (c[f >> 2] | 0) {
+                    case 3: {
+                      d = 2;
+                      break;
+                    }
+                    case 1:
+                    case 0: {
+                      if (!e) d = 1;
+                      else {
+                        c[f >> 2] = 2;
+                        d = 1;
+                        break a;
+                      }
+                      break;
+                    }
+                    default:
+                      d = 1;
+                  }
+                  k = c[(b + 144) >> 2] | 0;
+                  xb[c[(k + 48) >> 2] & 31](k, c[h >> 2] | 0, c[g >> 2] | 0, (b + 404) | 0);
+                  c[h >> 2] = c[g >> 2];
+                }
+              while (0);
+              return d | 0;
+            }
+            function p_() {
+              var a = 0,
+                b = 0,
+                d = 0;
+              b = l;
+              l = (l + 16) | 0;
+              a = b;
+              if (!(q_(a) | 0)) {
+                d = s_() | 0;
+                d = (X4() | 0) ^ d;
+                c[a >> 2] = d;
+                a = r_(142378, O(d, 2147483647) | 0) | 0;
+              } else a = r_(142365, c[a >> 2] | 0) | 0;
+              l = b;
+              return a | 0;
+            }
+            function q_(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              f = l;
+              l = (l + 16) | 0;
+              e = m2(142365, 0, f) | 0;
+              if ((e | 0) < 0) b = 0;
+              else {
+                b = 0;
+                while (1) {
+                  g = W4(e, (a + b) | 0, (4 - b) | 0) | 0;
+                  d = (g + b) | 0;
+                  if ((g | 0) > 0)
+                    if (d >>> 0 < 4) b = d;
+                    else {
+                      b = 1;
+                      break;
+                    }
+                  if ((c[(d2() | 0) >> 2] | 0) != 4) {
+                    b = 0;
+                    break;
+                  }
+                }
+                l4(e) | 0;
+              }
+              l = f;
+              return b | 0;
+            }
+            function r_(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              f = l;
+              l = (l + 16) | 0;
+              e = f;
+              d = Ta(142443) | 0;
+              if (d | 0 ? (s2(d, 142463) | 0) == 0 : 0) {
+                d = c[15712] | 0;
+                c[e >> 2] = a;
+                c[(e + 4) >> 2] = 8;
+                c[(e + 8) >> 2] = b;
+                c[(e + 12) >> 2] = 4;
+                w4(d, 142465, e) | 0;
+              }
+              l = f;
+              return b | 0;
+            }
+            function s_() {
+              var a = 0,
+                b = 0;
+              b = l;
+              l = (l + 16) | 0;
+              a = b;
+              if (!(Ua(a | 0, 0) | 0)) {
+                l = b;
+                return c[(a + 4) >> 2] | 0;
+              } else qa(142390, 142412, 819, 142423);
+              return 0;
+            }
+            function t_(a) {
+              a = a | 0;
+              if (!a) a = 41;
+              else a = c[(a + 280) >> 2] | 0;
+              return a | 0;
+            }
+            function u_(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              if (!a) a = 0;
+              else {
+                b = (a + 284) | 0;
+                d = c[b >> 2] | 0;
+                if (d | 0 ? ((e = (a + 292) | 0), (f = c[e >> 2] | 0), d >>> 0 >= f >>> 0) : 0) {
+                  g = c[(a + 144) >> 2] | 0;
+                  xb[c[(g + 48) >> 2] & 31](g, f, d, (a + 404) | 0);
+                  c[e >> 2] = c[b >> 2];
+                }
+                a = ((c[(a + 404) >> 2] | 0) + 1) | 0;
+              }
+              return a | 0;
+            }
+            function v_(a) {
+              a = a | 0;
+              do
+                switch (a | 0) {
+                  case 41: {
+                    a = 142502;
+                    break;
+                  }
+                  case 1: {
+                    a = 143774;
+                    break;
+                  }
+                  case 2: {
+                    a = 143761;
+                    break;
+                  }
+                  case 3: {
+                    a = 143744;
+                    break;
+                  }
+                  case 4: {
+                    a = 143712;
+                    break;
+                  }
+                  case 5: {
+                    a = 143697;
+                    break;
+                  }
+                  case 6: {
+                    a = 143679;
+                    break;
+                  }
+                  case 7: {
+                    a = 143664;
+                    break;
+                  }
+                  case 8: {
+                    a = 143644;
+                    break;
+                  }
+                  case 9: {
+                    a = 143616;
+                    break;
+                  }
+                  case 10: {
+                    a = 143581;
+                    break;
+                  }
+                  case 11: {
+                    a = 143564;
+                    break;
+                  }
+                  case 12: {
+                    a = 143537;
+                    break;
+                  }
+                  case 13: {
+                    a = 143517;
+                    break;
+                  }
+                  case 14: {
+                    a = 143479;
+                    break;
+                  }
+                  case 15: {
+                    a = 143452;
+                    break;
+                  }
+                  case 16: {
+                    a = 143410;
+                    break;
+                  }
+                  case 17: {
+                    a = 143363;
+                    break;
+                  }
+                  case 18: {
+                    a = 143346;
+                    break;
+                  }
+                  case 19: {
+                    a = 143295;
+                    break;
+                  }
+                  case 20: {
+                    a = 143272;
+                    break;
+                  }
+                  case 21: {
+                    a = 143226;
+                    break;
+                  }
+                  case 22: {
+                    a = 143199;
+                    break;
+                  }
+                  case 23: {
+                    a = 143148;
+                    break;
+                  }
+                  case 24: {
+                    a = 143112;
+                    break;
+                  }
+                  case 25: {
+                    a = 143060;
+                    break;
+                  }
+                  case 26: {
+                    a = 143015;
+                    break;
+                  }
+                  case 27: {
+                    a = 143e3;
+                    break;
+                  }
+                  case 28: {
+                    a = 142974;
+                    break;
+                  }
+                  case 29: {
+                    a = 142936;
+                    break;
+                  }
+                  case 30: {
+                    a = 142904;
+                    break;
+                  }
+                  case 31: {
+                    a = 142871;
+                    break;
+                  }
+                  case 32: {
+                    a = 142837;
+                    break;
+                  }
+                  case 33: {
+                    a = 142820;
+                    break;
+                  }
+                  case 34: {
+                    a = 142799;
+                    break;
+                  }
+                  case 35: {
+                    a = 142783;
+                    break;
+                  }
+                  case 36: {
+                    a = 142766;
+                    break;
+                  }
+                  case 37: {
+                    a = 142722;
+                    break;
+                  }
+                  case 38: {
+                    a = 142642;
+                    break;
+                  }
+                  case 39: {
+                    a = 142583;
+                    break;
+                  }
+                  case 40: {
+                    a = 142519;
+                    break;
+                  }
+                  default:
+                    a = 0;
+                }
+              while (0);
+              return a | 0;
+            }
+            function w_(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              e = c[b >> 2] | 0;
+              f = 0;
+              a: while (1) {
+                if (e >>> 0 <= a >>> 0) break;
+                h = (e + -1) | 0;
+                g = d[h >> 0] | 0;
+                do
+                  if (((g & 248) | 0) == 240)
+                    if (((f + 1) | 0) >>> 0 > 3) {
+                      i = 5;
+                      break a;
+                    } else f = 0;
+                  else {
+                    if (((g & 240) | 0) == 224)
+                      if (((f + 1) | 0) >>> 0 > 2) {
+                        i = 8;
+                        break a;
+                      } else {
+                        f = 0;
+                        break;
+                      }
+                    if (((g & 224) | 0) == 192)
+                      if (((f + 1) | 0) >>> 0 > 1) {
+                        i = 11;
+                        break a;
+                      } else {
+                        f = 0;
+                        break;
+                      }
+                    else if (!(g & 128)) break a;
+                    else break;
+                  }
+                while (0);
+                e = h;
+                f = (f + 1) | 0;
+              }
+              if ((i | 0) == 5) e = (e + 3) | 0;
+              else if ((i | 0) == 8) e = (e + 2) | 0;
+              else if ((i | 0) == 11) e = (e + 1) | 0;
+              c[b >> 2] = e;
+              return;
+            }
+            function x_(b, c) {
+              b = b | 0;
+              c = c | 0;
+              do
+                if ((b | 0) >= 0) {
+                  if ((b | 0) < 128) {
+                    a[c >> 0] = b;
+                    b = 1;
+                    break;
+                  }
+                  if ((b | 0) < 2048) {
+                    a[c >> 0] = (b >>> 6) | 192;
+                    a[(c + 1) >> 0] = (b & 63) | 128;
+                    b = 2;
+                    break;
+                  }
+                  if ((b | 0) < 65536) {
+                    a[c >> 0] = (b >>> 12) | 224;
+                    a[(c + 1) >> 0] = ((b >>> 6) & 63) | 128;
+                    a[(c + 2) >> 0] = (b & 63) | 128;
+                    b = 3;
+                    break;
+                  }
+                  if ((b | 0) < 1114112) {
+                    a[c >> 0] = (b >>> 18) | 240;
+                    a[(c + 1) >> 0] = ((b >>> 12) & 63) | 128;
+                    a[(c + 2) >> 0] = ((b >>> 6) & 63) | 128;
+                    a[(c + 3) >> 0] = (b & 63) | 128;
+                    b = 4;
+                  } else b = 0;
+                } else b = 0;
+              while (0);
+              return b | 0;
+            }
+            function y_() {
+              return 1908;
+            }
+            function z_(e, f, g, h) {
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              i = 0;
+              while (1) {
+                if ((i | 0) == 364) {
+                  i = 0;
+                  break;
+                }
+                a[(e + i) >> 0] = a[(56576 + i) >> 0] | 0;
+                i = (i + 1) | 0;
+              }
+              a: while (1) {
+                if ((i | 0) >= 128) {
+                  j = 5;
+                  break;
+                }
+                switch (a[(56648 + i) >> 0] | 0) {
+                  case 0:
+                  case 28:
+                    break;
+                  default:
+                    if ((c[(f + (i << 2)) >> 2] | 0) != (i | 0)) {
+                      e = 0;
+                      break a;
+                    }
+                }
+                i = (i + 1) | 0;
+              }
+              b: do
+                if ((j | 0) == 5) {
+                  q = (e + 72) | 0;
+                  m = (e + 372) | 0;
+                  n = (e + 884) | 0;
+                  o = (g | 0) == 0;
+                  l = 0;
+                  while (1) {
+                    if ((l | 0) >= 256) break;
+                    p = c[(f + (l << 2)) >> 2] | 0;
+                    do
+                      if ((p | 0) == -1) {
+                        a[(q + l) >> 0] = 1;
+                        b[(m + (l << 1)) >> 1] = -1;
+                        a[(n + (l << 2)) >> 0] = 1;
+                        a[(n + (l << 2) + 1) >> 0] = 0;
+                      } else {
+                        if ((p | 0) < 0) {
+                          if (o | ((p | 0) < -4)) {
+                            e = 0;
+                            break b;
+                          }
+                          a[(q + l) >> 0] = 3 - p;
+                          a[(n + (l << 2)) >> 0] = 0;
+                          b[(m + (l << 1)) >> 1] = 0;
+                          break;
+                        }
+                        if ((p | 0) < 128) {
+                          i = a[(56648 + p) >> 0] | 0;
+                          switch ((i << 24) >> 24) {
+                            case 0:
+                            case 28:
+                              break;
+                            default:
+                              if ((p | 0) != (l | 0)) {
+                                e = 0;
+                                break b;
+                              }
+                          }
+                          a[(q + l) >> 0] = i;
+                          a[(n + (l << 2)) >> 0] = 1;
+                          a[(n + (l << 2) + 1) >> 0] = p;
+                          b[(m + (l << 1)) >> 1] = (p | 0) == 0 ? -1 : p & 65535;
+                          break;
+                        }
+                        if ((A_(p) | 0) < 0) {
+                          a[(q + l) >> 0] = 0;
+                          b[(m + (l << 1)) >> 1] = -1;
+                          a[(n + (l << 2)) >> 0] = 1;
+                          a[(n + (l << 2) + 1) >> 0] = 0;
+                          break;
+                        }
+                        if ((p | 0) > 65535) {
+                          e = 0;
+                          break b;
+                        }
+                        i = p >>> 8;
+                        j = (p >>> 5) & 7;
+                        k = 1 << (p & 31);
+                        if (!(c[(56940 + (((d[(143788 + i) >> 0] << 3) | j) << 2)) >> 2] & k))
+                          a[(q + l) >> 0] =
+                            (c[(56940 + (((d[(144044 + i) >> 0] << 3) | j) << 2)) >> 2] & k) | 0 ? 26 : 28;
+                        else a[(q + l) >> 0] = 22;
+                        a[(n + (l << 2)) >> 0] = x_(p, (n + (l << 2) + 1) | 0) | 0;
+                        b[(m + (l << 1)) >> 1] = p;
+                      }
+                    while (0);
+                    l = (l + 1) | 0;
+                  }
+                  c[(e + 368) >> 2] = h;
+                  c[(e + 364) >> 2] = g;
+                  if (!o) {
+                    c[(e + 328) >> 2] = 108;
+                    c[(e + 332) >> 2] = 108;
+                    c[(e + 336) >> 2] = 108;
+                    c[(e + 340) >> 2] = 109;
+                    c[(e + 344) >> 2] = 109;
+                    c[(e + 348) >> 2] = 109;
+                    c[(e + 352) >> 2] = 110;
+                    c[(e + 356) >> 2] = 110;
+                    c[(e + 360) >> 2] = 110;
+                  }
+                  c[(e + 56) >> 2] = 13;
+                  c[(e + 60) >> 2] = 14;
+                }
+              while (0);
+              return e | 0;
+            }
+            function A_(b) {
+              b = b | 0;
+              var c = 0;
+              switch ((b >> 8) | 0) {
+                case 223:
+                case 222:
+                case 221:
+                case 220:
+                case 219:
+                case 218:
+                case 217:
+                case 216: {
+                  b = -1;
+                  break;
+                }
+                case 0: {
+                  if (!(a[(56648 + b) >> 0] | 0)) b = -1;
+                  else c = 4;
+                  break;
+                }
+                case 255: {
+                  if ((b | 1 | 0) == 65535) b = -1;
+                  else c = 4;
+                  break;
+                }
+                default:
+                  c = 4;
+              }
+              return b | 0;
+            }
+            function B_(a, b) {
+              a = a | 0;
+              b = b | 0;
+              a = lb[c[(a + 364) >> 2] & 127](c[(a + 368) >> 2] | 0, b) | 0;
+              if (a >>> 0 > 65535) a = 0;
+              else
+                a =
+                  c[(56940 + ((((d[(144044 + (a >>> 8)) >> 0] | 0) << 3) | ((a >>> 5) & 7)) << 2)) >> 2] &
+                  (1 << (a & 31));
+              return a | 0;
+            }
+            function C_(a, b) {
+              a = a | 0;
+              b = b | 0;
+              a = lb[c[(a + 364) >> 2] & 127](c[(a + 368) >> 2] | 0, b) | 0;
+              if (a >>> 0 > 65535) a = 0;
+              else
+                a =
+                  c[(56940 + ((((d[(143788 + (a >>> 8)) >> 0] | 0) << 3) | ((a >>> 5) & 7)) << 2)) >> 2] &
+                  (1 << (a & 31));
+              return a | 0;
+            }
+            function D_(a, b) {
+              a = a | 0;
+              b = b | 0;
+              a = lb[c[(a + 364) >> 2] & 127](c[(a + 368) >> 2] | 0, b) | 0;
+              if (a >>> 0 > 65535) a = 1;
+              else a = (A_(a) | 0) >>> 31;
+              return a | 0;
+            }
+            function E_(b, e, f, g, h) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0;
+              q = l;
+              l = (l + 16) | 0;
+              m = q;
+              n = (b + 364) | 0;
+              o = (b + 884) | 0;
+              p = (b + 368) | 0;
+              k = (b + 72) | 0;
+              while (1) {
+                i = c[e >> 2] | 0;
+                if ((i | 0) == (f | 0)) {
+                  h = 0;
+                  break;
+                }
+                r = d[i >> 0] | 0;
+                j = (o + (r << 2) + 1) | 0;
+                r = a[(o + (r << 2)) >> 0] | 0;
+                b = (r << 24) >> 24;
+                if (!((r << 24) >> 24)) {
+                  b = x_(lb[c[n >> 2] & 127](c[p >> 2] | 0, i) | 0, m) | 0;
+                  if ((b | 0) > ((h - (c[g >> 2] | 0)) | 0)) {
+                    h = 2;
+                    break;
+                  }
+                  i = c[e >> 2] | 0;
+                  j = m;
+                  i = (i + ((d[(k + (d[i >> 0] | 0)) >> 0] | 0) + -3)) | 0;
+                } else {
+                  if (((h - (c[g >> 2] | 0)) | 0) < (b | 0)) {
+                    h = 2;
+                    break;
+                  }
+                  i = (i + 1) | 0;
+                }
+                c[e >> 2] = i;
+                W6(c[g >> 2] | 0, j | 0, b | 0) | 0;
+                c[g >> 2] = (c[g >> 2] | 0) + b;
+              }
+              l = q;
+              return h | 0;
+            }
+            function F_(a, e, f, g, h) {
+              a = a | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              m = (a + 372) | 0;
+              n = (a + 364) | 0;
+              o = (a + 368) | 0;
+              l = (a + 72) | 0;
+              while (1) {
+                k = c[e >> 2] | 0;
+                a = k >>> 0 < f >>> 0;
+                i = c[g >> 2] | 0;
+                if (!(a & (i >>> 0 < h >>> 0))) break;
+                a = b[(m + ((d[k >> 0] | 0) << 1)) >> 1] | 0;
+                if (!((a << 16) >> 16)) {
+                  a = (lb[c[n >> 2] & 127](c[o >> 2] | 0, k) | 0) & 65535;
+                  i = c[e >> 2] | 0;
+                  j = ((d[(l + (d[i >> 0] | 0)) >> 0] | 0) + -3) | 0;
+                } else {
+                  j = 1;
+                  i = k;
+                }
+                c[e >> 2] = i + j;
+                k = c[g >> 2] | 0;
+                c[g >> 2] = k + 2;
+                b[k >> 1] = a;
+              }
+              return (((i | 0) != (h | 0)) | (a ^ 1) ? 0 : 2) | 0;
+            }
+            function G_(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0;
+              a: do
+                if (e >>> 0 < f >>> 0) {
+                  n = (b + 72) | 0;
+                  do
+                    switch (a[(n + (d[e >> 0] | 0)) >> 0] | 0) {
+                      case 12: {
+                        h = f$(12, b, (e + 1) | 0, f, g) | 0;
+                        break a;
+                      }
+                      case 13: {
+                        h = f$(13, b, (e + 1) | 0, f, g) | 0;
+                        break a;
+                      }
+                      case 2: {
+                        h = (e + 1) | 0;
+                        if (((f - h) | 0) <= 0) {
+                          h = -1;
+                          break a;
+                        }
+                        switch (a[(n + (d[h >> 0] | 0)) >> 0] | 0) {
+                          case 16: {
+                            h = g$(b, (e + 2) | 0, f, g) | 0;
+                            break a;
+                          }
+                          case 15: {
+                            h = b$(b, (e + 2) | 0, f, g) | 0;
+                            break a;
+                          }
+                          case 7:
+                          case 6:
+                          case 5:
+                          case 29:
+                          case 24:
+                          case 22: {
+                            c[g >> 2] = e;
+                            h = 29;
+                            break a;
+                          }
+                          default: {
+                            c[g >> 2] = h;
+                            h = 0;
+                            break a;
+                          }
+                        }
+                      }
+                      case 9: {
+                        if (((e + 1) | 0) == (f | 0)) {
+                          c[g >> 2] = f;
+                          h = -15;
+                          break a;
+                        } else k = 3;
+                        break;
+                      }
+                      case 10:
+                      case 21: {
+                        k = 3;
+                        break;
+                      }
+                      case 30: {
+                        h = X_(b, (e + 1) | 0, f, g) | 0;
+                        break a;
+                      }
+                      case 35: {
+                        c[g >> 2] = e + 1;
+                        h = 38;
+                        break a;
+                      }
+                      case 20: {
+                        c[g >> 2] = e + 1;
+                        h = 25;
+                        break a;
+                      }
+                      case 4: {
+                        i = (e + 1) | 0;
+                        h = (f - i) | 0;
+                        if ((h | 0) <= 0) {
+                          h = -26;
+                          break a;
+                        }
+                        if ((a[i >> 0] | 0) == 93) {
+                          if ((h | 0) <= 1) {
+                            h = -1;
+                            break a;
+                          }
+                          if ((a[(e + 2) >> 0] | 0) == 62) {
+                            c[g >> 2] = e + 3;
+                            h = 34;
+                            break a;
+                          }
+                        }
+                        c[g >> 2] = i;
+                        h = 26;
+                        break a;
+                      }
+                      case 31: {
+                        c[g >> 2] = e + 1;
+                        h = 23;
+                        break a;
+                      }
+                      case 32: {
+                        h = (e + 1) | 0;
+                        if (((f - h) | 0) <= 0) {
+                          h = -24;
+                          break a;
+                        }
+                        switch (a[(n + (d[h >> 0] | 0)) >> 0] | 0) {
+                          case 33: {
+                            c[g >> 2] = e + 2;
+                            h = 36;
+                            break a;
+                          }
+                          case 15: {
+                            c[g >> 2] = e + 2;
+                            h = 35;
+                            break a;
+                          }
+                          case 34: {
+                            c[g >> 2] = e + 2;
+                            h = 37;
+                            break a;
+                          }
+                          case 32:
+                          case 36:
+                          case 35:
+                          case 11:
+                          case 21:
+                          case 10:
+                          case 9: {
+                            c[g >> 2] = h;
+                            h = 24;
+                            break a;
+                          }
+                          default: {
+                            c[g >> 2] = h;
+                            h = 0;
+                            break a;
+                          }
+                        }
+                      }
+                      case 36: {
+                        c[g >> 2] = e + 1;
+                        h = 21;
+                        break a;
+                      }
+                      case 11: {
+                        c[g >> 2] = e + 1;
+                        h = 17;
+                        break a;
+                      }
+                      case 19: {
+                        h = h$(b, (e + 1) | 0, f, g) | 0;
+                        break a;
+                      }
+                      case 5: {
+                        if (((f - e) | 0) < 2) {
+                          h = -2;
+                          break a;
+                        }
+                        if (!(lb[c[(b + 340) >> 2] & 127](b, e) | 0))
+                          if (!(lb[c[(b + 328) >> 2] & 127](b, e) | 0)) {
+                            c[g >> 2] = e;
+                            h = 0;
+                            break a;
+                          } else {
+                            h = 19;
+                            i = 2;
+                          }
+                        else {
+                          h = 18;
+                          i = 2;
+                        }
+                        break;
+                      }
+                      case 6: {
+                        if (((f - e) | 0) < 3) {
+                          h = -2;
+                          break a;
+                        }
+                        if (!(lb[c[(b + 344) >> 2] & 127](b, e) | 0))
+                          if (!(lb[c[(b + 332) >> 2] & 127](b, e) | 0)) {
+                            c[g >> 2] = e;
+                            h = 0;
+                            break a;
+                          } else {
+                            h = 19;
+                            i = 3;
+                          }
+                        else {
+                          h = 18;
+                          i = 3;
+                        }
+                        break;
+                      }
+                      case 7: {
+                        if (((f - e) | 0) < 4) {
+                          h = -2;
+                          break a;
+                        }
+                        if (!(lb[c[(b + 348) >> 2] & 127](b, e) | 0))
+                          if (!(lb[c[(b + 336) >> 2] & 127](b, e) | 0)) {
+                            c[g >> 2] = e;
+                            h = 0;
+                            break a;
+                          } else {
+                            h = 19;
+                            i = 4;
+                          }
+                        else {
+                          h = 18;
+                          i = 4;
+                        }
+                        break;
+                      }
+                      case 24:
+                      case 22: {
+                        h = 18;
+                        i = 1;
+                        break;
+                      }
+                      case 23:
+                      case 27:
+                      case 26:
+                      case 25: {
+                        h = 19;
+                        i = 1;
+                        break;
+                      }
+                      default: {
+                        c[g >> 2] = e;
+                        h = 0;
+                        break a;
+                      }
+                    }
+                  while (0);
+                  if ((k | 0) == 3) {
+                    j = f;
+                    i = e;
+                    b: while (1) {
+                      h = i;
+                      i = (i + 1) | 0;
+                      if (((j - i) | 0) <= 0) {
+                        k = 18;
+                        break;
+                      }
+                      switch (a[(n + (d[i >> 0] | 0)) >> 0] | 0) {
+                        case 10:
+                        case 21:
+                          continue b;
+                        case 9:
+                          break;
+                        default: {
+                          k = 17;
+                          break b;
+                        }
+                      }
+                      if (((h + 2) | 0) == (f | 0)) {
+                        k = 17;
+                        break;
+                      }
+                    }
+                    if ((k | 0) == 17) {
+                      c[g >> 2] = i;
+                      h = 15;
+                      break;
+                    } else if ((k | 0) == 18) {
+                      c[g >> 2] = i;
+                      h = 15;
+                      break;
+                    }
+                  }
+                  k = (b + 328) | 0;
+                  l = (b + 332) | 0;
+                  m = (b + 336) | 0;
+                  j = (e + i) | 0;
+                  c: while (1) {
+                    i = (f - j) | 0;
+                    if ((i | 0) <= 0) {
+                      k = 99;
+                      break;
+                    }
+                    switch (a[(n + (d[j >> 0] | 0)) >> 0] | 0) {
+                      case 29: {
+                        k = 56;
+                        break c;
+                      }
+                      case 10:
+                      case 9:
+                      case 21:
+                      case 30:
+                      case 20:
+                      case 36:
+                      case 35:
+                      case 32:
+                      case 11: {
+                        k = 70;
+                        break c;
+                      }
+                      case 34: {
+                        k = 89;
+                        break c;
+                      }
+                      case 33: {
+                        k = 92;
+                        break c;
+                      }
+                      case 15: {
+                        k = 95;
+                        break c;
+                      }
+                      case 27:
+                      case 26:
+                      case 25:
+                      case 24:
+                      case 22: {
+                        e = h;
+                        j = (j + 1) | 0;
+                        h = e;
+                        continue c;
+                      }
+                      case 5: {
+                        if ((i | 0) < 2) {
+                          h = -2;
+                          break a;
+                        }
+                        if (!(lb[c[k >> 2] & 127](b, j) | 0)) {
+                          k = 60;
+                          break c;
+                        }
+                        e = h;
+                        j = (j + 2) | 0;
+                        h = e;
+                        continue c;
+                      }
+                      case 6: {
+                        if ((i | 0) < 3) {
+                          h = -2;
+                          break a;
+                        }
+                        if (!(lb[c[l >> 2] & 127](b, j) | 0)) {
+                          k = 64;
+                          break c;
+                        }
+                        e = h;
+                        j = (j + 3) | 0;
+                        h = e;
+                        continue c;
+                      }
+                      case 7: {
+                        if ((i | 0) < 4) {
+                          h = -2;
+                          break a;
+                        }
+                        if (!(lb[c[m >> 2] & 127](b, j) | 0)) {
+                          k = 68;
+                          break c;
+                        }
+                        e = h;
+                        j = (j + 4) | 0;
+                        h = e;
+                        continue c;
+                      }
+                      case 23: {
+                        i = (j + 1) | 0;
+                        switch (h & 63) {
+                          case 18:
+                            break;
+                          case 41: {
+                            h = 19;
+                            j = i;
+                            continue c;
+                          }
+                          default: {
+                            e = h;
+                            j = i;
+                            h = e;
+                            continue c;
+                          }
+                        }
+                        h = (f - i) | 0;
+                        if ((h | 0) <= 0) {
+                          h = -1;
+                          break a;
+                        }
+                        switch (a[(n + (d[i >> 0] | 0)) >> 0] | 0) {
+                          case 29: {
+                            k = 74;
+                            break c;
+                          }
+                          case 27:
+                          case 26:
+                          case 25:
+                          case 24:
+                          case 22: {
+                            h = 41;
+                            j = (j + 2) | 0;
+                            continue c;
+                          }
+                          case 5: {
+                            if ((h | 0) < 2) {
+                              h = -2;
+                              break a;
+                            }
+                            if (!(lb[c[k >> 2] & 127](b, i) | 0)) {
+                              k = 78;
+                              break c;
+                            }
+                            h = 41;
+                            j = (j + 3) | 0;
+                            continue c;
+                          }
+                          case 6: {
+                            if ((h | 0) < 3) {
+                              h = -2;
+                              break a;
+                            }
+                            if (!(lb[c[l >> 2] & 127](b, i) | 0)) {
+                              k = 82;
+                              break c;
+                            }
+                            h = 41;
+                            j = (j + 4) | 0;
+                            continue c;
+                          }
+                          case 7: {
+                            if ((h | 0) < 4) {
+                              h = -2;
+                              break a;
+                            }
+                            if (!(lb[c[m >> 2] & 127](b, i) | 0)) {
+                              k = 86;
+                              break c;
+                            }
+                            h = 41;
+                            j = (j + 5) | 0;
+                            continue c;
+                          }
+                          default: {
+                            h = 19;
+                            j = i;
+                            continue c;
+                          }
+                        }
+                      }
+                      default: {
+                        k = 98;
+                        break c;
+                      }
+                    }
+                  }
+                  switch (k | 0) {
+                    case 56: {
+                      c[g >> 2] = j;
+                      h = 0;
+                      break a;
+                    }
+                    case 60: {
+                      c[g >> 2] = j;
+                      h = 0;
+                      break a;
+                    }
+                    case 64: {
+                      c[g >> 2] = j;
+                      h = 0;
+                      break a;
+                    }
+                    case 68: {
+                      c[g >> 2] = j;
+                      h = 0;
+                      break a;
+                    }
+                    case 70: {
+                      c[g >> 2] = j;
+                      break a;
+                    }
+                    case 74: {
+                      c[g >> 2] = i;
+                      h = 0;
+                      break a;
+                    }
+                    case 78: {
+                      c[g >> 2] = i;
+                      h = 0;
+                      break a;
+                    }
+                    case 82: {
+                      c[g >> 2] = i;
+                      h = 0;
+                      break a;
+                    }
+                    case 86: {
+                      c[g >> 2] = i;
+                      h = 0;
+                      break a;
+                    }
+                    case 89:
+                      if ((h | 0) == 19) {
+                        c[g >> 2] = j;
+                        h = 0;
+                        break a;
+                      } else {
+                        c[g >> 2] = j + 1;
+                        h = 32;
+                        break a;
+                      }
+                    case 92:
+                      if ((h | 0) == 19) {
+                        c[g >> 2] = j;
+                        h = 0;
+                        break a;
+                      } else {
+                        c[g >> 2] = j + 1;
+                        h = 31;
+                        break a;
+                      }
+                    case 95:
+                      if ((h | 0) == 19) {
+                        c[g >> 2] = j;
+                        h = 0;
+                        break a;
+                      } else {
+                        c[g >> 2] = j + 1;
+                        h = 30;
+                        break a;
+                      }
+                    case 98: {
+                      c[g >> 2] = j;
+                      h = 0;
+                      break a;
+                    }
+                    case 99: {
+                      h = (0 - h) | 0;
+                      break a;
+                    }
+                  }
+                } else h = -4;
+              while (0);
+              return h | 0;
+            }
+            function H_(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              a: do
+                if (e >>> 0 < f >>> 0) {
+                  m = (b + 72) | 0;
+                  b: do
+                    switch (a[(m + (d[e >> 0] | 0)) >> 0] | 0) {
+                      case 2: {
+                        h = __(b, (e + 1) | 0, f, g) | 0;
+                        break a;
+                      }
+                      case 3: {
+                        h = W_(b, (e + 1) | 0, f, g) | 0;
+                        break a;
+                      }
+                      case 9: {
+                        h = (e + 1) | 0;
+                        if (((f - h) | 0) <= 0) {
+                          h = -3;
+                          break a;
+                        }
+                        c[g >> 2] = (a[(m + (d[h >> 0] | 0)) >> 0] | 0) == 10 ? (e + 2) | 0 : h;
+                        h = 7;
+                        break a;
+                      }
+                      case 10: {
+                        c[g >> 2] = e + 1;
+                        h = 7;
+                        break a;
+                      }
+                      case 4: {
+                        i = (e + 1) | 0;
+                        if (((f - i) | 0) <= 0) {
+                          h = -5;
+                          break a;
+                        }
+                        if ((a[i >> 0] | 0) == 93) {
+                          h = (e + 2) | 0;
+                          if (((f - h) | 0) <= 0) {
+                            h = -5;
+                            break a;
+                          }
+                          if ((a[h >> 0] | 0) == 62) {
+                            c[g >> 2] = h;
+                            h = 0;
+                            break a;
+                          } else h = f;
+                        } else h = f;
+                        break;
+                      }
+                      case 5: {
+                        h = f;
+                        if (((h - e) | 0) < 2) {
+                          h = -2;
+                          break a;
+                        }
+                        if (!(lb[c[(b + 352) >> 2] & 127](b, e) | 0)) {
+                          i = (e + 2) | 0;
+                          break b;
+                        } else {
+                          c[g >> 2] = e;
+                          h = 0;
+                          break a;
+                        }
+                      }
+                      case 6: {
+                        h = f;
+                        if (((h - e) | 0) < 3) {
+                          h = -2;
+                          break a;
+                        }
+                        if (!(lb[c[(b + 356) >> 2] & 127](b, e) | 0)) {
+                          i = (e + 3) | 0;
+                          break b;
+                        } else {
+                          c[g >> 2] = e;
+                          h = 0;
+                          break a;
+                        }
+                      }
+                      case 7: {
+                        h = f;
+                        if (((h - e) | 0) < 4) {
+                          h = -2;
+                          break a;
+                        }
+                        if (!(lb[c[(b + 360) >> 2] & 127](b, e) | 0)) {
+                          i = (e + 4) | 0;
+                          break b;
+                        } else {
+                          c[g >> 2] = e;
+                          h = 0;
+                          break a;
+                        }
+                      }
+                      case 8:
+                      case 1:
+                      case 0: {
+                        c[g >> 2] = e;
+                        h = 0;
+                        break a;
+                      }
+                      default: {
+                        i = (e + 1) | 0;
+                        h = f;
+                      }
+                    }
+                  while (0);
+                  j = (b + 352) | 0;
+                  k = (b + 356) | 0;
+                  l = (b + 360) | 0;
+                  c: while (1) {
+                    f = (h - i) | 0;
+                    if ((f | 0) <= 0) {
+                      f = 49;
+                      break;
+                    }
+                    switch (a[(m + (d[i >> 0] | 0)) >> 0] | 0) {
+                      case 10:
+                      case 9:
+                      case 8:
+                      case 1:
+                      case 0:
+                      case 2:
+                      case 3: {
+                        f = 47;
+                        break c;
+                      }
+                      case 5: {
+                        if ((f | 0) < 2) {
+                          f = 32;
+                          break c;
+                        }
+                        if (lb[c[j >> 2] & 127](b, i) | 0) {
+                          f = 32;
+                          break c;
+                        }
+                        i = (i + 2) | 0;
+                        continue c;
+                      }
+                      case 6: {
+                        if ((f | 0) < 3) {
+                          f = 36;
+                          break c;
+                        }
+                        if (lb[c[k >> 2] & 127](b, i) | 0) {
+                          f = 36;
+                          break c;
+                        }
+                        i = (i + 3) | 0;
+                        continue c;
+                      }
+                      case 7: {
+                        if ((f | 0) < 4) {
+                          f = 40;
+                          break c;
+                        }
+                        if (lb[c[l >> 2] & 127](b, i) | 0) {
+                          f = 40;
+                          break c;
+                        }
+                        i = (i + 4) | 0;
+                        continue c;
+                      }
+                      case 4: {
+                        if ((f | 0) <= 1) {
+                          f = 47;
+                          break c;
+                        }
+                        e = (i + 1) | 0;
+                        if ((a[e >> 0] | 0) != 93) {
+                          i = e;
+                          continue c;
+                        }
+                        if ((f | 0) <= 2) {
+                          f = 47;
+                          break c;
+                        }
+                        i = (i + 2) | 0;
+                        if ((a[i >> 0] | 0) == 62) {
+                          f = 46;
+                          break c;
+                        } else {
+                          i = e;
+                          continue c;
+                        }
+                      }
+                      default: {
+                        i = (i + 1) | 0;
+                        continue c;
+                      }
+                    }
+                  }
+                  if ((f | 0) == 32) {
+                    c[g >> 2] = i;
+                    h = 6;
+                    break;
+                  } else if ((f | 0) == 36) {
+                    c[g >> 2] = i;
+                    h = 6;
+                    break;
+                  } else if ((f | 0) == 40) {
+                    c[g >> 2] = i;
+                    h = 6;
+                    break;
+                  } else if ((f | 0) == 46) {
+                    c[g >> 2] = i;
+                    h = 0;
+                    break;
+                  } else if ((f | 0) == 47) {
+                    c[g >> 2] = i;
+                    h = 6;
+                    break;
+                  } else if ((f | 0) == 49) {
+                    c[g >> 2] = i;
+                    h = 6;
+                    break;
+                  }
+                } else h = -4;
+              while (0);
+              return h | 0;
+            }
+            function I_(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              a: do
+                if (e >>> 0 < f >>> 0) {
+                  l = (b + 72) | 0;
+                  b: do
+                    switch (a[(l + (d[e >> 0] | 0)) >> 0] | 0) {
+                      case 4: {
+                        i = (e + 1) | 0;
+                        h = f;
+                        if (((h - i) | 0) <= 0) {
+                          h = -1;
+                          break a;
+                        }
+                        if ((a[i >> 0] | 0) == 93) {
+                          f = (e + 2) | 0;
+                          if (((h - f) | 0) <= 0) {
+                            h = -1;
+                            break a;
+                          }
+                          if ((a[f >> 0] | 0) == 62) {
+                            c[g >> 2] = e + 3;
+                            h = 40;
+                            break a;
+                          }
+                        }
+                        break;
+                      }
+                      case 9: {
+                        h = (e + 1) | 0;
+                        if (((f - h) | 0) <= 0) {
+                          h = -1;
+                          break a;
+                        }
+                        c[g >> 2] = (a[(l + (d[h >> 0] | 0)) >> 0] | 0) == 10 ? (e + 2) | 0 : h;
+                        h = 7;
+                        break a;
+                      }
+                      case 10: {
+                        c[g >> 2] = e + 1;
+                        h = 7;
+                        break a;
+                      }
+                      case 5: {
+                        h = f;
+                        if (((h - e) | 0) < 2) {
+                          h = -2;
+                          break a;
+                        }
+                        if (!(lb[c[(b + 352) >> 2] & 127](b, e) | 0)) {
+                          i = (e + 2) | 0;
+                          break b;
+                        } else {
+                          c[g >> 2] = e;
+                          h = 0;
+                          break a;
+                        }
+                      }
+                      case 6: {
+                        h = f;
+                        if (((h - e) | 0) < 3) {
+                          h = -2;
+                          break a;
+                        }
+                        if (!(lb[c[(b + 356) >> 2] & 127](b, e) | 0)) {
+                          i = (e + 3) | 0;
+                          break b;
+                        } else {
+                          c[g >> 2] = e;
+                          h = 0;
+                          break a;
+                        }
+                      }
+                      case 7: {
+                        h = f;
+                        if (((h - e) | 0) < 4) {
+                          h = -2;
+                          break a;
+                        }
+                        if (!(lb[c[(b + 360) >> 2] & 127](b, e) | 0)) {
+                          i = (e + 4) | 0;
+                          break b;
+                        } else {
+                          c[g >> 2] = e;
+                          h = 0;
+                          break a;
+                        }
+                      }
+                      case 8:
+                      case 1:
+                      case 0: {
+                        c[g >> 2] = e;
+                        h = 0;
+                        break a;
+                      }
+                      default: {
+                        i = (e + 1) | 0;
+                        h = f;
+                      }
+                    }
+                  while (0);
+                  e = (b + 352) | 0;
+                  j = (b + 356) | 0;
+                  k = (b + 360) | 0;
+                  c: while (1) {
+                    f = (h - i) | 0;
+                    if ((f | 0) <= 0) {
+                      f = 39;
+                      break;
+                    }
+                    switch (a[(l + (d[i >> 0] | 0)) >> 0] | 0) {
+                      case 4:
+                      case 10:
+                      case 9:
+                      case 8:
+                      case 1:
+                      case 0: {
+                        f = 37;
+                        break c;
+                      }
+                      case 5: {
+                        if ((f | 0) < 2) {
+                          f = 30;
+                          break c;
+                        }
+                        if (!(lb[c[e >> 2] & 127](b, i) | 0)) f = 2;
+                        else {
+                          f = 30;
+                          break c;
+                        }
+                        break;
+                      }
+                      case 6: {
+                        if ((f | 0) < 3) {
+                          f = 33;
+                          break c;
+                        }
+                        if (!(lb[c[j >> 2] & 127](b, i) | 0)) f = 3;
+                        else {
+                          f = 33;
+                          break c;
+                        }
+                        break;
+                      }
+                      case 7: {
+                        if ((f | 0) < 4) {
+                          f = 36;
+                          break c;
+                        }
+                        if (!(lb[c[k >> 2] & 127](b, i) | 0)) f = 4;
+                        else {
+                          f = 36;
+                          break c;
+                        }
+                        break;
+                      }
+                      default:
+                        f = 1;
+                    }
+                    i = (i + f) | 0;
+                  }
+                  if ((f | 0) == 30) {
+                    c[g >> 2] = i;
+                    h = 6;
+                    break;
+                  } else if ((f | 0) == 33) {
+                    c[g >> 2] = i;
+                    h = 6;
+                    break;
+                  } else if ((f | 0) == 36) {
+                    c[g >> 2] = i;
+                    h = 6;
+                    break;
+                  } else if ((f | 0) == 37) {
+                    c[g >> 2] = i;
+                    h = 6;
+                    break;
+                  } else if ((f | 0) == 39) {
+                    c[g >> 2] = i;
+                    h = 6;
+                    break;
+                  }
+                } else h = -4;
+              while (0);
+              return h | 0;
+            }
+            function Ew(a, b, d, e, f, g, i, j, k) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              j = j | 0;
+              k = k | 0;
+              var l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0;
+              if (!(((a | 0) > -1) & (((b | 0) > 0) & ((d | 0) > 0)))) qa(95162, 94943, 843, 95188);
+              j = zw(b, d, a, i, j, 1) | 0;
+              if (!j) qa(95233, 94943, 847, 95188);
+              u = c[(j + 20) >> 2] | 0;
+              t = c[(j + 24) >> 2] | 0;
+              m = (b + 1) | 0;
+              l = 0;
+              while (1) {
+                if ((l | 0) == (m | 0)) break;
+                c[(u + (l << 2)) >> 2] = 0;
+                l = (l + 1) | 0;
+              }
+              a: do
+                switch (i | 0) {
+                  case 1: {
+                    i = c[(j + 28) >> 2] | 0;
+                    l = 0;
+                    while (1) {
+                      if ((l | 0) >= (a | 0)) {
+                        q = 0;
+                        break;
+                      }
+                      m = c[(e + (l << 2)) >> 2] | 0;
+                      if (!(((m | 0) > -1) & ((m | 0) < (b | 0)))) {
+                        s = 13;
+                        break;
+                      }
+                      r = c[(f + (l << 2)) >> 2] | 0;
+                      if (!(((r | 0) > -1) & ((r | 0) < (d | 0)))) {
+                        s = 13;
+                        break;
+                      }
+                      r = (u + ((m + 1) << 2)) | 0;
+                      c[r >> 2] = (c[r >> 2] | 0) + 1;
+                      l = (l + 1) | 0;
+                    }
+                    if ((s | 0) == 13) qa(138394, 94943, 862, 95188);
+                    while (1) {
+                      if ((q | 0) == (b | 0)) {
+                        l = 0;
+                        break;
+                      }
+                      s = (q + 1) | 0;
+                      d = (u + (s << 2)) | 0;
+                      c[d >> 2] = (c[d >> 2] | 0) + (c[(u + (q << 2)) >> 2] | 0);
+                      q = s;
+                    }
+                    while (1) {
+                      if ((l | 0) == (a | 0)) break;
+                      r = (u + (c[(e + (l << 2)) >> 2] << 2)) | 0;
+                      s = c[r >> 2] | 0;
+                      h[(i + (s << 3)) >> 3] = +h[(g + (l << 3)) >> 3];
+                      d = c[(f + (l << 2)) >> 2] | 0;
+                      c[r >> 2] = s + 1;
+                      c[(t + (s << 2)) >> 2] = d;
+                      l = (l + 1) | 0;
+                    }
+                    while (1) {
+                      if ((b | 0) <= 0) break a;
+                      f = (b + -1) | 0;
+                      c[(u + (b << 2)) >> 2] = c[(u + (f << 2)) >> 2];
+                      b = f;
+                    }
+                  }
+                  case 2: {
+                    i = c[(j + 28) >> 2] | 0;
+                    l = 0;
+                    while (1) {
+                      if ((l | 0) >= (a | 0)) {
+                        r = 0;
+                        break;
+                      }
+                      m = c[(e + (l << 2)) >> 2] | 0;
+                      if (!(((m | 0) > -1) & ((m | 0) < (b | 0)))) {
+                        s = 25;
+                        break;
+                      }
+                      q = c[(f + (l << 2)) >> 2] | 0;
+                      if (!(((q | 0) > -1) & ((q | 0) < (d | 0)))) {
+                        s = 25;
+                        break;
+                      }
+                      q = (u + ((m + 1) << 2)) | 0;
+                      c[q >> 2] = (c[q >> 2] | 0) + 1;
+                      l = (l + 1) | 0;
+                    }
+                    if ((s | 0) == 25) qa(138394, 94943, 880, 95188);
+                    while (1) {
+                      if ((r | 0) == (b | 0)) {
+                        l = 0;
+                        break;
+                      }
+                      s = (r + 1) | 0;
+                      d = (u + (s << 2)) | 0;
+                      c[d >> 2] = (c[d >> 2] | 0) + (c[(u + (r << 2)) >> 2] | 0);
+                      r = s;
+                    }
+                    while (1) {
+                      if ((l | 0) == (a | 0)) break;
+                      r = (u + (c[(e + (l << 2)) >> 2] << 2)) | 0;
+                      s = c[r >> 2] | 0;
+                      d = s << 1;
+                      h[(i + (d << 3)) >> 3] = +h[g >> 3];
+                      h[(i + ((d | 1) << 3)) >> 3] = +h[(g + 8) >> 3];
+                      d = c[(f + (l << 2)) >> 2] | 0;
+                      c[r >> 2] = s + 1;
+                      c[(t + (s << 2)) >> 2] = d;
+                      g = (g + 16) | 0;
+                      l = (l + 1) | 0;
+                    }
+                    while (1) {
+                      if ((b | 0) <= 0) break a;
+                      f = (b + -1) | 0;
+                      c[(u + (b << 2)) >> 2] = c[(u + (f << 2)) >> 2];
+                      b = f;
+                    }
+                  }
+                  case 4: {
+                    i = c[(j + 28) >> 2] | 0;
+                    l = 0;
+                    while (1) {
+                      if ((l | 0) >= (a | 0)) {
+                        p = 0;
+                        break;
+                      }
+                      m = c[(e + (l << 2)) >> 2] | 0;
+                      if (!(((m | 0) > -1) & ((m | 0) < (b | 0)))) {
+                        s = 37;
+                        break;
+                      }
+                      r = c[(f + (l << 2)) >> 2] | 0;
+                      if (!(((r | 0) > -1) & ((r | 0) < (d | 0)))) {
+                        s = 37;
+                        break;
+                      }
+                      r = (u + ((m + 1) << 2)) | 0;
+                      c[r >> 2] = (c[r >> 2] | 0) + 1;
+                      l = (l + 1) | 0;
+                    }
+                    if ((s | 0) == 37) qa(138394, 94943, 899, 95188);
+                    while (1) {
+                      if ((p | 0) == (b | 0)) {
+                        l = 0;
+                        break;
+                      }
+                      s = (p + 1) | 0;
+                      d = (u + (s << 2)) | 0;
+                      c[d >> 2] = (c[d >> 2] | 0) + (c[(u + (p << 2)) >> 2] | 0);
+                      p = s;
+                    }
+                    while (1) {
+                      if ((l | 0) == (a | 0)) break;
+                      r = (e + (l << 2)) | 0;
+                      c[(i + (c[(u + (c[r >> 2] << 2)) >> 2] << 2)) >> 2] = c[(g + (l << 2)) >> 2];
+                      d = c[(f + (l << 2)) >> 2] | 0;
+                      r = (u + (c[r >> 2] << 2)) | 0;
+                      s = c[r >> 2] | 0;
+                      c[r >> 2] = s + 1;
+                      c[(t + (s << 2)) >> 2] = d;
+                      l = (l + 1) | 0;
+                    }
+                    while (1) {
+                      if ((b | 0) <= 0) break a;
+                      f = (b + -1) | 0;
+                      c[(u + (b << 2)) >> 2] = c[(u + (f << 2)) >> 2];
+                      b = f;
+                    }
+                  }
+                  case 8: {
+                    g = 0;
+                    while (1) {
+                      if ((g | 0) >= (a | 0)) {
+                        n = 0;
+                        break;
+                      }
+                      l = c[(e + (g << 2)) >> 2] | 0;
+                      if (!(((l | 0) > -1) & ((l | 0) < (b | 0)))) {
+                        s = 48;
+                        break;
+                      }
+                      r = c[(f + (g << 2)) >> 2] | 0;
+                      if (!(((r | 0) > -1) & ((r | 0) < (d | 0)))) {
+                        s = 48;
+                        break;
+                      }
+                      r = (u + ((l + 1) << 2)) | 0;
+                      c[r >> 2] = (c[r >> 2] | 0) + 1;
+                      g = (g + 1) | 0;
+                    }
+                    if ((s | 0) == 48) qa(138394, 94943, 915, 95188);
+                    while (1) {
+                      if ((n | 0) == (b | 0)) {
+                        g = 0;
+                        break;
+                      }
+                      s = (n + 1) | 0;
+                      d = (u + (s << 2)) | 0;
+                      c[d >> 2] = (c[d >> 2] | 0) + (c[(u + (n << 2)) >> 2] | 0);
+                      n = s;
+                    }
+                    while (1) {
+                      if ((g | 0) == (a | 0)) break;
+                      d = c[(f + (g << 2)) >> 2] | 0;
+                      r = (u + (c[(e + (g << 2)) >> 2] << 2)) | 0;
+                      s = c[r >> 2] | 0;
+                      c[r >> 2] = s + 1;
+                      c[(t + (s << 2)) >> 2] = d;
+                      g = (g + 1) | 0;
+                    }
+                    while (1) {
+                      if ((b | 0) <= 0) break a;
+                      f = (b + -1) | 0;
+                      c[(u + (b << 2)) >> 2] = c[(u + (f << 2)) >> 2];
+                      b = f;
+                    }
+                  }
+                  case 16: {
+                    l = 0;
+                    while (1) {
+                      if ((l | 0) >= (a | 0)) {
+                        o = 0;
+                        break;
+                      }
+                      m = c[(e + (l << 2)) >> 2] | 0;
+                      if (!(((m | 0) > -1) & ((m | 0) < (b | 0)))) {
+                        s = 59;
+                        break;
+                      }
+                      r = c[(f + (l << 2)) >> 2] | 0;
+                      if (!(((r | 0) > -1) & ((r | 0) < (d | 0)))) {
+                        s = 59;
+                        break;
+                      }
+                      r = (u + ((m + 1) << 2)) | 0;
+                      c[r >> 2] = (c[r >> 2] | 0) + 1;
+                      l = (l + 1) | 0;
+                    }
+                    if ((s | 0) == 59) qa(138394, 94943, 930, 95188);
+                    while (1) {
+                      if ((o | 0) == (b | 0)) break;
+                      s = (o + 1) | 0;
+                      d = (u + (s << 2)) | 0;
+                      c[d >> 2] = (c[d >> 2] | 0) + (c[(u + (o << 2)) >> 2] | 0);
+                      o = s;
+                    }
+                    W6(c[(j + 28) >> 2] | 0, g | 0, O(c[(j + 40) >> 2] | 0, a) | 0) | 0;
+                    g = 0;
+                    while (1) {
+                      if ((g | 0) == (a | 0)) break;
+                      d = c[(f + (g << 2)) >> 2] | 0;
+                      r = (u + (c[(e + (g << 2)) >> 2] << 2)) | 0;
+                      s = c[r >> 2] | 0;
+                      c[r >> 2] = s + 1;
+                      c[(t + (s << 2)) >> 2] = d;
+                      g = (g + 1) | 0;
+                    }
+                    while (1) {
+                      if ((b | 0) <= 0) break a;
+                      f = (b + -1) | 0;
+                      c[(u + (b << 2)) >> 2] = c[(u + (f << 2)) >> 2];
+                      b = f;
+                    }
+                  }
+                  default:
+                    qa(138394, 94943, 944, 95188);
+                }
+              while (0);
+              c[u >> 2] = 0;
+              c[(j + 8) >> 2] = a;
+              if (k) j = Fw(j, k) | 0;
+              return j | 0;
+            }
+            function Fw(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0;
+              t = c[(a + 20) >> 2] | 0;
+              u = c[(a + 24) >> 2] | 0;
+              e = c[(a + 16) >> 2] | 0;
+              r = c[(a + 4) >> 2] | 0;
+              a: do
+                if (b) {
+                  m = r << 2;
+                  n = KK(m) | 0;
+                  d = 0;
+                  while (1) {
+                    if ((d | 0) >= (r | 0)) break;
+                    c[(n + (d << 2)) >> 2] = -1;
+                    d = (d + 1) | 0;
+                  }
+                  b: do
+                    switch (e | 0) {
+                      case 1: {
+                        k = c[(a + 28) >> 2] | 0;
+                        f = 0;
+                        e = c[t >> 2] | 0;
+                        d = 0;
+                        c: while (1) {
+                          if ((d | 0) >= (c[a >> 2] | 0)) {
+                            v = f;
+                            w = n;
+                            break b;
+                          }
+                          l = (d + 1) | 0;
+                          m = (t + (l << 2)) | 0;
+                          i = (t + (d << 2)) | 0;
+                          d = f;
+                          while (1) {
+                            b = c[m >> 2] | 0;
+                            if ((e | 0) >= (b | 0)) break;
+                            b = (u + (e << 2)) | 0;
+                            f = c[b >> 2] | 0;
+                            g = c[(n + (f << 2)) >> 2] | 0;
+                            if ((g | 0) < (c[i >> 2] | 0)) {
+                              c[(u + (d << 2)) >> 2] = f;
+                              h[(k + (d << 3)) >> 3] = +h[(k + (e << 3)) >> 3];
+                              c[(n + (c[b >> 2] << 2)) >> 2] = d;
+                              d = (d + 1) | 0;
+                            } else {
+                              if ((c[(u + (g << 2)) >> 2] | 0) != (f | 0)) break c;
+                              s = (k + (g << 3)) | 0;
+                              h[s >> 3] = +h[s >> 3] + +h[(k + (e << 3)) >> 3];
+                            }
+                            e = (e + 1) | 0;
+                          }
+                          c[m >> 2] = d;
+                          f = d;
+                          e = b;
+                          d = l;
+                        }
+                        qa(95235, 94943, 1792, 95260);
+                        break;
+                      }
+                      case 2: {
+                        s = c[(a + 28) >> 2] | 0;
+                        switch (b | 0) {
+                          case 1: {
+                            b = c[t >> 2] | 0;
+                            e = 0;
+                            d = 0;
+                            d: while (1) {
+                              if ((e | 0) >= (c[a >> 2] | 0)) {
+                                v = d;
+                                w = n;
+                                break b;
+                              }
+                              k = (e + 1) | 0;
+                              l = (t + (k << 2)) | 0;
+                              i = (t + (e << 2)) | 0;
+                              while (1) {
+                                e = c[l >> 2] | 0;
+                                if ((b | 0) >= (e | 0)) break;
+                                e = (u + (b << 2)) | 0;
+                                f = c[e >> 2] | 0;
+                                g = c[(n + (f << 2)) >> 2] | 0;
+                                if ((g | 0) < (c[i >> 2] | 0)) {
+                                  c[(u + (d << 2)) >> 2] = f;
+                                  q = b << 1;
+                                  r = d << 1;
+                                  h[(s + (r << 3)) >> 3] = +h[(s + (q << 3)) >> 3];
+                                  h[(s + ((r | 1) << 3)) >> 3] = +h[(s + ((q | 1) << 3)) >> 3];
+                                  c[(n + (c[e >> 2] << 2)) >> 2] = d;
+                                  d = (d + 1) | 0;
+                                } else {
+                                  if ((c[(u + (g << 2)) >> 2] | 0) != (f | 0)) break d;
+                                  q = b << 1;
+                                  r = g << 1;
+                                  p = (s + (r << 3)) | 0;
+                                  h[p >> 3] = +h[p >> 3] + +h[(s + (q << 3)) >> 3];
+                                  r = (s + ((r | 1) << 3)) | 0;
+                                  h[r >> 3] = +h[r >> 3] + +h[(s + ((q | 1) << 3)) >> 3];
+                                }
+                                b = (b + 1) | 0;
+                              }
+                              c[l >> 2] = d;
+                              b = e;
+                              e = k;
+                            }
+                            qa(95235, 94943, 1815, 95260);
+                            break;
+                          }
+                          case 4: {
+                            b = c[t >> 2] | 0;
+                            e = 0;
+                            d = 0;
+                            e: while (1) {
+                              if ((e | 0) >= (c[a >> 2] | 0)) {
+                                v = d;
+                                w = n;
+                                break b;
+                              }
+                              l = (e + 1) | 0;
+                              k = (t + (l << 2)) | 0;
+                              i = (t + (e << 2)) | 0;
+                              while (1) {
+                                e = c[k >> 2] | 0;
+                                if ((b | 0) >= (e | 0)) break;
+                                e = (u + (b << 2)) | 0;
+                                f = c[e >> 2] | 0;
+                                g = c[(n + (f << 2)) >> 2] | 0;
+                                if ((g | 0) < (c[i >> 2] | 0)) {
+                                  c[(u + (d << 2)) >> 2] = f;
+                                  q = b << 1;
+                                  r = d << 1;
+                                  h[(s + (r << 3)) >> 3] = +h[(s + (q << 3)) >> 3];
+                                  h[(s + ((r | 1) << 3)) >> 3] = +h[(s + ((q | 1) << 3)) >> 3];
+                                  c[(n + (c[e >> 2] << 2)) >> 2] = d;
+                                  d = (d + 1) | 0;
+                                } else {
+                                  if ((c[(u + (g << 2)) >> 2] | 0) != (f | 0)) break e;
+                                  q = b << 1;
+                                  r = g << 1;
+                                  p = (s + (r << 3)) | 0;
+                                  h[p >> 3] = +h[p >> 3] + +h[(s + (q << 3)) >> 3];
+                                  h[(s + ((r | 1) << 3)) >> 3] = +h[(s + ((q | 1) << 3)) >> 3];
+                                }
+                                b = (b + 1) | 0;
+                              }
+                              c[k >> 2] = d;
+                              b = e;
+                              e = l;
+                            }
+                            qa(95235, 94943, 1835, 95260);
+                            break;
+                          }
+                          case 2: {
+                            q = ~~+h[(s + 8) >> 3];
+                            i = c[a >> 2] | 0;
+                            e = q;
+                            g = 0;
+                            d = 0;
+                            f: while (1) {
+                              if ((g | 0) >= (i | 0)) break;
+                              k = (g + 1) | 0;
+                              l = c[(t + (k << 2)) >> 2] | 0;
+                              f = d;
+                              b = q;
+                              d = c[(t + (g << 2)) >> 2] | 0;
+                              while (1) {
+                                if ((d | 0) >= (l | 0)) {
+                                  q = b;
+                                  g = k;
+                                  d = f;
+                                  continue f;
+                                }
+                                q = ~~+h[(s + (((f << 1) | 1) << 3)) >> 3];
+                                f = (f + 1) | 0;
+                                e = (e | 0) > (q | 0) ? e : q;
+                                b = (b | 0) < (q | 0) ? b : q;
+                                d = (d + 1) | 0;
+                              }
+                            }
+                            U1(n);
+                            p = (e - q + 1) | 0;
+                            o = KK(O(p, m) | 0) | 0;
+                            p = O(p, r) | 0;
+                            d = 0;
+                            while (1) {
+                              if ((d | 0) >= (p | 0)) break;
+                              c[(o + (d << 2)) >> 2] = -1;
+                              d = (d + 1) | 0;
+                            }
+                            d = 0;
+                            b = c[t >> 2] | 0;
+                            e = 0;
+                            g: while (1) {
+                              if ((e | 0) >= (c[a >> 2] | 0)) {
+                                v = d;
+                                w = o;
+                                break b;
+                              }
+                              m = (e + 1) | 0;
+                              n = (t + (m << 2)) | 0;
+                              l = (t + (e << 2)) | 0;
+                              while (1) {
+                                e = c[n >> 2] | 0;
+                                if ((b | 0) >= (e | 0)) break;
+                                e = c[(u + (b << 2)) >> 2] | 0;
+                                f = b << 1;
+                                j = +h[(s + ((f | 1) << 3)) >> 3];
+                                g = ((O((~~j - q) | 0, r) | 0) + e) | 0;
+                                i = (o + (g << 2)) | 0;
+                                k = c[i >> 2] | 0;
+                                if ((k | 0) < (c[l >> 2] | 0)) {
+                                  c[(u + (d << 2)) >> 2] = e;
+                                  k = d << 1;
+                                  h[(s + (k << 3)) >> 3] = +h[(s + (f << 3)) >> 3];
+                                  h[(s + ((k | 1) << 3)) >> 3] = j;
+                                  c[i >> 2] = d;
+                                  d = (d + 1) | 0;
+                                } else {
+                                  if ((g | 0) >= (p | 0)) {
+                                    d = 55;
+                                    break g;
+                                  }
+                                  if ((c[(u + (k << 2)) >> 2] | 0) != (e | 0)) {
+                                    d = 57;
+                                    break g;
+                                  }
+                                  k = k << 1;
+                                  i = (s + (k << 3)) | 0;
+                                  h[i >> 3] = +h[i >> 3] + +h[(s + (f << 3)) >> 3];
+                                  h[(s + ((k | 1) << 3)) >> 3] = j;
+                                }
+                                b = (b + 1) | 0;
+                              }
+                              c[n >> 2] = d;
+                              b = e;
+                              e = m;
+                            }
+                            if ((d | 0) == 55) qa(95292, 94943, 1869, 95260);
+                            else if ((d | 0) == 57) qa(95313, 94943, 1870, 95260);
+                            break;
+                          }
+                          case 3: {
+                            f = ~~+h[(s + 8) >> 3];
+                            i = c[a >> 2] | 0;
+                            d = f;
+                            e = 0;
+                            g = 0;
+                            h: while (1) {
+                              if ((g | 0) >= (i | 0)) break;
+                              k = (g + 1) | 0;
+                              l = c[(t + (k << 2)) >> 2] | 0;
+                              b = d;
+                              d = c[(t + (g << 2)) >> 2] | 0;
+                              while (1) {
+                                if ((d | 0) >= (l | 0)) {
+                                  d = b;
+                                  g = k;
+                                  continue h;
+                                }
+                                q = ~~+h[(s + ((e << 1) << 3)) >> 3];
+                                b = (b | 0) > (q | 0) ? b : q;
+                                f = (f | 0) > (q | 0) ? f : q;
+                                e = (e + 1) | 0;
+                                d = (d + 1) | 0;
+                              }
+                            }
+                            U1(n);
+                            e = (d - f + 1) | 0;
+                            o = KK(O(e, m) | 0) | 0;
+                            e = O(e, r) | 0;
+                            d = 0;
+                            while (1) {
+                              if ((d | 0) >= (e | 0)) break;
+                              c[(o + (d << 2)) >> 2] = -1;
+                              d = (d + 1) | 0;
+                            }
+                            d = 0;
+                            b = c[t >> 2] | 0;
+                            e = 0;
+                            i: while (1) {
+                              if ((e | 0) >= (c[a >> 2] | 0)) {
+                                v = d;
+                                w = o;
+                                break b;
+                              }
+                              m = (e + 1) | 0;
+                              n = (t + (m << 2)) | 0;
+                              l = (t + (e << 2)) | 0;
+                              while (1) {
+                                e = c[n >> 2] | 0;
+                                if ((b | 0) >= (e | 0)) break;
+                                e = c[(u + (b << 2)) >> 2] | 0;
+                                g = b << 1;
+                                j = +h[(s + (g << 3)) >> 3];
+                                i = (o + (((O((~~j - f) | 0, r) | 0) + e) << 2)) | 0;
+                                k = c[i >> 2] | 0;
+                                if ((k | 0) < (c[l >> 2] | 0)) {
+                                  c[(u + (d << 2)) >> 2] = e;
+                                  q = d << 1;
+                                  h[(s + (q << 3)) >> 3] = j;
+                                  h[(s + ((q | 1) << 3)) >> 3] = +h[(s + ((g | 1) << 3)) >> 3];
+                                  c[i >> 2] = d;
+                                  d = (d + 1) | 0;
+                                } else {
+                                  if ((c[(u + (k << 2)) >> 2] | 0) != (e | 0)) break i;
+                                  q = k << 1;
+                                  h[(s + (q << 3)) >> 3] = j;
+                                  q = (s + ((q | 1) << 3)) | 0;
+                                  h[q >> 3] = +h[q >> 3] + +h[(s + ((g | 1) << 3)) >> 3];
+                                }
+                                b = (b + 1) | 0;
+                              }
+                              c[n >> 2] = d;
+                              b = e;
+                              e = m;
+                            }
+                            qa(95313, 94943, 1905, 95260);
+                            break;
+                          }
+                          default: {
+                            v = 0;
+                            w = n;
+                            break b;
+                          }
+                        }
+                        break;
+                      }
+                      case 4: {
+                        k = c[(a + 28) >> 2] | 0;
+                        e = 0;
+                        d = 0;
+                        b = c[t >> 2] | 0;
+                        j: while (1) {
+                          if ((e | 0) >= (c[a >> 2] | 0)) {
+                            v = d;
+                            w = n;
+                            break b;
+                          }
+                          l = (e + 1) | 0;
+                          m = (t + (l << 2)) | 0;
+                          i = (t + (e << 2)) | 0;
+                          while (1) {
+                            f = c[m >> 2] | 0;
+                            if ((b | 0) >= (f | 0)) break;
+                            e = (u + (b << 2)) | 0;
+                            f = c[e >> 2] | 0;
+                            g = c[(n + (f << 2)) >> 2] | 0;
+                            if ((g | 0) < (c[i >> 2] | 0)) {
+                              c[(u + (d << 2)) >> 2] = f;
+                              c[(k + (d << 2)) >> 2] = c[(k + (b << 2)) >> 2];
+                              c[(n + (c[e >> 2] << 2)) >> 2] = d;
+                              d = (d + 1) | 0;
+                            } else {
+                              if ((c[(u + (g << 2)) >> 2] | 0) != (f | 0)) break j;
+                              s = (k + (g << 2)) | 0;
+                              c[s >> 2] = (c[s >> 2] | 0) + (c[(k + (b << 2)) >> 2] | 0);
+                            }
+                            b = (b + 1) | 0;
+                          }
+                          c[m >> 2] = d;
+                          e = l;
+                          b = f;
+                        }
+                        qa(95235, 94943, 1929, 95260);
+                        break;
+                      }
+                      case 8: {
+                        e = 0;
+                        d = 0;
+                        b = c[t >> 2] | 0;
+                        k: while (1) {
+                          if ((e | 0) >= (c[a >> 2] | 0)) {
+                            v = d;
+                            w = n;
+                            break b;
+                          }
+                          k = (e + 1) | 0;
+                          l = (t + (k << 2)) | 0;
+                          i = (t + (e << 2)) | 0;
+                          while (1) {
+                            f = c[l >> 2] | 0;
+                            if ((b | 0) >= (f | 0)) break;
+                            e = (u + (b << 2)) | 0;
+                            f = c[e >> 2] | 0;
+                            g = c[(n + (f << 2)) >> 2] | 0;
+                            if ((g | 0) >= (c[i >> 2] | 0)) {
+                              if ((c[(u + (g << 2)) >> 2] | 0) != (f | 0)) break k;
+                            } else {
+                              c[(u + (d << 2)) >> 2] = f;
+                              c[(n + (c[e >> 2] << 2)) >> 2] = d;
+                              d = (d + 1) | 0;
+                            }
+                            b = (b + 1) | 0;
+                          }
+                          c[l >> 2] = d;
+                          e = k;
+                          b = f;
+                        }
+                        qa(95235, 94943, 1948, 95260);
+                        break;
+                      }
+                      default: {
+                        a = 0;
+                        break a;
+                      }
+                    }
+                  while (0);
+                  c[(a + 8) >> 2] = v;
+                  U1(w);
+                }
+              while (0);
+              return a | 0;
+            }
+            function Gw(a, b, c, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              if (!d) Hw(a, c, e, g, b, f);
+              else Iw(a, c, e, g, b, f);
+              return;
+            }
+            function Hw(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0.0,
+                u = 0;
+              if ((c[(a + 32) >> 2] | 0) != 1) qa(94919, 94943, 1121, 95483);
+              if ((c[(a + 16) >> 2] | 0) != 1) qa(95364, 94943, 1122, 95483);
+              p = c[(a + 28) >> 2] | 0;
+              q = c[(a + 20) >> 2] | 0;
+              r = c[(a + 24) >> 2] | 0;
+              s = c[a >> 2] | 0;
+              o = c[(a + 4) >> 2] | 0;
+              a = c[d >> 2] | 0;
+              i = (a | 0) != 0;
+              if (!f) {
+                if (!i) a = KK(O(e << 3, s) | 0) | 0;
+                f = 0;
+                a: while (1) {
+                  if ((f | 0) >= (s | 0)) break;
+                  n = O(f, e) | 0;
+                  i = 0;
+                  while (1) {
+                    if ((i | 0) >= (e | 0)) break;
+                    h[(a + ((i + n) << 3)) >> 3] = 0.0;
+                    i = (i + 1) | 0;
+                  }
+                  l = (f + 1) | 0;
+                  m = c[(q + (l << 2)) >> 2] | 0;
+                  i = c[(q + (f << 2)) >> 2] | 0;
+                  while (1) {
+                    if ((i | 0) >= (m | 0)) {
+                      f = l;
+                      continue a;
+                    }
+                    j = (p + (i << 3)) | 0;
+                    k = (r + (i << 2)) | 0;
+                    f = 0;
+                    while (1) {
+                      if ((f | 0) >= (e | 0)) break;
+                      t = +h[(b + (((O(c[k >> 2] | 0, e) | 0) + f) << 3)) >> 3] * +h[j >> 3];
+                      o = (a + ((f + n) << 3)) | 0;
+                      h[o >> 3] = +h[o >> 3] + t;
+                      f = (f + 1) | 0;
+                    }
+                    i = (i + 1) | 0;
+                  }
+                }
+                if (g) Kw(a, s, e);
+              } else {
+                if (!i) a = KK(O(e << 3, o) | 0) | 0;
+                f = O(o, e) | 0;
+                i = 0;
+                while (1) {
+                  if ((i | 0) >= (f | 0)) {
+                    i = 0;
+                    break;
+                  }
+                  h[(a + (i << 3)) >> 3] = 0.0;
+                  i = (i + 1) | 0;
+                }
+                b: while (1) {
+                  if ((i | 0) >= (s | 0)) break;
+                  l = (i + 1) | 0;
+                  m = c[(q + (l << 2)) >> 2] | 0;
+                  n = O(i, e) | 0;
+                  i = c[(q + (i << 2)) >> 2] | 0;
+                  while (1) {
+                    if ((i | 0) >= (m | 0)) {
+                      i = l;
+                      continue b;
+                    }
+                    j = (p + (i << 3)) | 0;
+                    k = (r + (i << 2)) | 0;
+                    f = 0;
+                    while (1) {
+                      if ((f | 0) >= (e | 0)) break;
+                      u = (a + (((O(c[k >> 2] | 0, e) | 0) + f) << 3)) | 0;
+                      h[u >> 3] = +h[u >> 3] + +h[(b + ((f + n) << 3)) >> 3] * +h[j >> 3];
+                      f = (f + 1) | 0;
+                    }
+                    i = (i + 1) | 0;
+                  }
+                }
+                if (g) Kw(a, o, e);
+              }
+              c[d >> 2] = a;
+              return;
+            }
+            function Iw(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              n = l;
+              l = (l + 16) | 0;
+              m = n;
+              if ((c[(a + 32) >> 2] | 0) != 1) qa(94919, 94943, 1163, 95335);
+              if ((c[(a + 16) >> 2] | 0) != 1) qa(95364, 94943, 1164, 95335);
+              h = c[d >> 2] | 0;
+              j = c[a >> 2] | 0;
+              k = c[(a + 4) >> 2] | 0;
+              i = (h | 0) != 0;
+              if (!f) {
+                if (!i) h = KK(O(e << 3, j) | 0) | 0;
+                i = 0;
+                while (1) {
+                  if ((i | 0) >= (e | 0)) break;
+                  c[m >> 2] = h + ((O(i, j) | 0) << 3);
+                  Jw(a, (b + ((O(i, k) | 0) << 3)) | 0, m, 0);
+                  i = (i + 1) | 0;
+                }
+                if (!g) Kw(h, e, j);
+              } else {
+                if (!i) h = KK(O(e << 3, k) | 0) | 0;
+                i = 0;
+                while (1) {
+                  if ((i | 0) >= (e | 0)) break;
+                  c[m >> 2] = h + ((O(i, k) | 0) << 3);
+                  Jw(a, (b + ((O(i, j) | 0) << 3)) | 0, m, f);
+                  i = (i + 1) | 0;
+                }
+                if (!g) Kw(h, e, k);
+              }
+              c[d >> 2] = h;
+              l = n;
+              return;
+            }
+            function Jw(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0.0;
+              if ((c[(a + 32) >> 2] | 0) != 1) qa(94919, 94943, 1222, 95392);
+              i = c[(a + 16) >> 2] | 0;
+              switch (i | 0) {
+                case 4:
+                case 1:
+                  break;
+                default:
+                  qa(95421, 94943, 1223, 95392);
+              }
+              n = c[(a + 20) >> 2] | 0;
+              m = c[(a + 24) >> 2] | 0;
+              o = c[a >> 2] | 0;
+              k = c[(a + 4) >> 2] | 0;
+              j = c[d >> 2] | 0;
+              a: do
+                switch (i | 0) {
+                  case 1: {
+                    l = c[(a + 28) >> 2] | 0;
+                    a = (e | 0) != 0;
+                    f = (j | 0) != 0;
+                    if (!b) {
+                      if (!a) {
+                        if (f) f = j;
+                        else f = KK(o << 3) | 0;
+                        a = 0;
+                        b: while (1) {
+                          if ((a | 0) >= (o | 0)) break a;
+                          i = (f + (a << 3)) | 0;
+                          h[i >> 3] = 0.0;
+                          j = (a + 1) | 0;
+                          e = c[(n + (j << 2)) >> 2] | 0;
+                          a = c[(n + (a << 2)) >> 2] | 0;
+                          g = 0.0;
+                          while (1) {
+                            if ((a | 0) >= (e | 0)) {
+                              a = j;
+                              continue b;
+                            }
+                            p = g + +h[(l + (a << 3)) >> 3];
+                            h[i >> 3] = p;
+                            a = (a + 1) | 0;
+                            g = p;
+                          }
+                        }
+                      }
+                      if (!f) j = KK(k << 3) | 0;
+                      a = 0;
+                      while (1) {
+                        if ((a | 0) >= (k | 0)) {
+                          a = 0;
+                          break;
+                        }
+                        h[(j + (a << 3)) >> 3] = 0.0;
+                        a = (a + 1) | 0;
+                      }
+                      c: while (1) {
+                        if ((a | 0) >= (o | 0)) {
+                          f = j;
+                          break a;
+                        }
+                        f = (a + 1) | 0;
+                        i = c[(n + (f << 2)) >> 2] | 0;
+                        a = c[(n + (a << 2)) >> 2] | 0;
+                        while (1) {
+                          if ((a | 0) >= (i | 0)) {
+                            a = f;
+                            continue c;
+                          }
+                          b = (j + (c[(m + (a << 2)) >> 2] << 3)) | 0;
+                          h[b >> 3] = +h[b >> 3] + +h[(l + (a << 3)) >> 3];
+                          a = (a + 1) | 0;
+                        }
+                      }
+                    } else {
+                      if (!a) {
+                        if (f) f = j;
+                        else f = KK(o << 3) | 0;
+                        a = 0;
+                        d: while (1) {
+                          if ((a | 0) >= (o | 0)) break a;
+                          i = (f + (a << 3)) | 0;
+                          h[i >> 3] = 0.0;
+                          j = (a + 1) | 0;
+                          e = c[(n + (j << 2)) >> 2] | 0;
+                          a = c[(n + (a << 2)) >> 2] | 0;
+                          g = 0.0;
+                          while (1) {
+                            if ((a | 0) >= (e | 0)) {
+                              a = j;
+                              continue d;
+                            }
+                            p = g + +h[(b + (c[(m + (a << 2)) >> 2] << 3)) >> 3] * +h[(l + (a << 3)) >> 3];
+                            h[i >> 3] = p;
+                            a = (a + 1) | 0;
+                            g = p;
+                          }
+                        }
+                      }
+                      if (f) f = j;
+                      else f = KK(k << 3) | 0;
+                      a = 0;
+                      while (1) {
+                        if ((a | 0) >= (k | 0)) {
+                          a = 0;
+                          break;
+                        }
+                        h[(f + (a << 3)) >> 3] = 0.0;
+                        a = (a + 1) | 0;
+                      }
+                      e: while (1) {
+                        if ((a | 0) >= (o | 0)) break a;
+                        i = (a + 1) | 0;
+                        j = c[(n + (i << 2)) >> 2] | 0;
+                        e = (b + (a << 3)) | 0;
+                        a = c[(n + (a << 2)) >> 2] | 0;
+                        while (1) {
+                          if ((a | 0) >= (j | 0)) {
+                            a = i;
+                            continue e;
+                          }
+                          k = (f + (c[(m + (a << 2)) >> 2] << 3)) | 0;
+                          h[k >> 3] = +h[k >> 3] + +h[e >> 3] * +h[(l + (a << 3)) >> 3];
+                          a = (a + 1) | 0;
+                        }
+                      }
+                    }
+                  }
+                  case 4: {
+                    l = c[(a + 28) >> 2] | 0;
+                    a = (e | 0) != 0;
+                    f = (j | 0) != 0;
+                    if (!b) {
+                      if (!a) {
+                        if (f) f = j;
+                        else f = KK(o << 3) | 0;
+                        a = 0;
+                        f: while (1) {
+                          if ((a | 0) >= (o | 0)) break a;
+                          i = (f + (a << 3)) | 0;
+                          h[i >> 3] = 0.0;
+                          j = (a + 1) | 0;
+                          e = c[(n + (j << 2)) >> 2] | 0;
+                          a = c[(n + (a << 2)) >> 2] | 0;
+                          g = 0.0;
+                          while (1) {
+                            if ((a | 0) >= (e | 0)) {
+                              a = j;
+                              continue f;
+                            }
+                            p = g + +(c[(l + (a << 2)) >> 2] | 0);
+                            h[i >> 3] = p;
+                            a = (a + 1) | 0;
+                            g = p;
+                          }
+                        }
+                      }
+                      if (!f) j = KK(k << 3) | 0;
+                      a = 0;
+                      while (1) {
+                        if ((a | 0) >= (k | 0)) {
+                          a = 0;
+                          break;
+                        }
+                        h[(j + (a << 3)) >> 3] = 0.0;
+                        a = (a + 1) | 0;
+                      }
+                      g: while (1) {
+                        if ((a | 0) >= (o | 0)) {
+                          f = j;
+                          break a;
+                        }
+                        f = (a + 1) | 0;
+                        i = c[(n + (f << 2)) >> 2] | 0;
+                        a = c[(n + (a << 2)) >> 2] | 0;
+                        while (1) {
+                          if ((a | 0) >= (i | 0)) {
+                            a = f;
+                            continue g;
+                          }
+                          b = (j + (c[(m + (a << 2)) >> 2] << 3)) | 0;
+                          h[b >> 3] = +h[b >> 3] + +(c[(l + (a << 2)) >> 2] | 0);
+                          a = (a + 1) | 0;
+                        }
+                      }
+                    } else {
+                      if (!a) {
+                        if (f) f = j;
+                        else f = KK(o << 3) | 0;
+                        a = 0;
+                        h: while (1) {
+                          if ((a | 0) >= (o | 0)) break a;
+                          i = (f + (a << 3)) | 0;
+                          h[i >> 3] = 0.0;
+                          j = (a + 1) | 0;
+                          e = c[(n + (j << 2)) >> 2] | 0;
+                          a = c[(n + (a << 2)) >> 2] | 0;
+                          g = 0.0;
+                          while (1) {
+                            if ((a | 0) >= (e | 0)) {
+                              a = j;
+                              continue h;
+                            }
+                            p = g + +h[(b + (c[(m + (a << 2)) >> 2] << 3)) >> 3] * +(c[(l + (a << 2)) >> 2] | 0);
+                            h[i >> 3] = p;
+                            a = (a + 1) | 0;
+                            g = p;
+                          }
+                        }
+                      }
+                      if (f) f = j;
+                      else f = KK(k << 3) | 0;
+                      a = 0;
+                      while (1) {
+                        if ((a | 0) >= (k | 0)) {
+                          a = 0;
+                          break;
+                        }
+                        h[(f + (a << 3)) >> 3] = 0.0;
+                        a = (a + 1) | 0;
+                      }
+                      i: while (1) {
+                        if ((a | 0) >= (o | 0)) break a;
+                        i = (a + 1) | 0;
+                        j = c[(n + (i << 2)) >> 2] | 0;
+                        e = (b + (a << 3)) | 0;
+                        a = c[(n + (a << 2)) >> 2] | 0;
+                        while (1) {
+                          if ((a | 0) >= (j | 0)) {
+                            a = i;
+                            continue i;
+                          }
+                          k = (f + (c[(m + (a << 2)) >> 2] << 3)) | 0;
+                          h[k >> 3] = +h[k >> 3] + +h[e >> 3] * +(c[(l + (a << 2)) >> 2] | 0);
+                          a = (a + 1) | 0;
+                        }
+                      }
+                    }
+                  }
+                  default:
+                    qa(138394, 94943, 1315, 95392);
+                }
+              while (0);
+              c[d >> 2] = f;
+              return;
+            }
+            function Kw(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              d = O(b << 3, c) | 0;
+              f = KK(d) | 0;
+              W6(f | 0, a | 0, d | 0) | 0;
+              d = 0;
+              while (1) {
+                if ((d | 0) >= (b | 0)) break;
+                g = O(d, c) | 0;
+                e = 0;
+                while (1) {
+                  if ((e | 0) >= (c | 0)) break;
+                  h[(a + (((O(e, b) | 0) + d) << 3)) >> 3] = +h[(f + ((e + g) << 3)) >> 3];
+                  e = (e + 1) | 0;
+                }
+                d = (d + 1) | 0;
+              }
+              U1(f);
+              return;
+            }
+            function Lw(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0;
+              x = c[(a + 20) >> 2] | 0;
+              y = c[(a + 24) >> 2] | 0;
+              z = c[(b + 20) >> 2] | 0;
+              A = c[(b + 24) >> 2] | 0;
+              w = c[(a + 32) >> 2] | 0;
+              if (!((w | 0) == 1 ? (w | 0) == (c[(b + 32) >> 2] | 0) : 0)) qa(95005, 94943, 1408, 95512);
+              w = c[a >> 2] | 0;
+              if (
+                (
+                  (c[(a + 4) >> 2] | 0) == (c[b >> 2] | 0)
+                    ? ((n = c[(a + 16) >> 2] | 0), (n | 0) == (c[(b + 16) >> 2] | 0))
+                    : 0
+                )
+                  ? ((m = (b + 4) | 0), (B = KK(c[m >> 2] << 2) | 0), (B | 0) != 0)
+                  : 0
+              ) {
+                d = 0;
+                while (1) {
+                  if ((d | 0) >= (c[m >> 2] | 0)) {
+                    e = 0;
+                    d = 0;
+                    break;
+                  }
+                  c[(B + (d << 2)) >> 2] = -1;
+                  d = (d + 1) | 0;
+                }
+                a: while (1) {
+                  if ((d | 0) >= (w | 0)) break;
+                  j = (d + 1) | 0;
+                  k = (x + (j << 2)) | 0;
+                  l = (-2 - d) | 0;
+                  i = c[(x + (d << 2)) >> 2] | 0;
+                  while (1) {
+                    if ((i | 0) >= (c[k >> 2] | 0)) {
+                      d = j;
+                      continue a;
+                    }
+                    f = c[(y + (i << 2)) >> 2] | 0;
+                    g = (z + ((f + 1) << 2)) | 0;
+                    f = c[(z + (f << 2)) >> 2] | 0;
+                    while (1) {
+                      if ((f | 0) >= (c[g >> 2] | 0)) break;
+                      d = (B + (c[(A + (f << 2)) >> 2] << 2)) | 0;
+                      if ((c[d >> 2] | 0) != (l | 0)) {
+                        c[d >> 2] = l;
+                        e = (e + 1) | 0;
+                      }
+                      f = (f + 1) | 0;
+                    }
+                    i = (i + 1) | 0;
+                  }
+                }
+                d = rw(w, c[m >> 2] | 0, e, n, 1) | 0;
+                b: do
+                  if (!d) d = 0;
+                  else {
+                    t = c[(d + 20) >> 2] | 0;
+                    u = c[(d + 24) >> 2] | 0;
+                    c: do
+                      switch (n | 0) {
+                        case 1: {
+                          r = c[(a + 28) >> 2] | 0;
+                          n = c[(b + 28) >> 2] | 0;
+                          b = c[(d + 28) >> 2] | 0;
+                          c[t >> 2] = 0;
+                          e = 0;
+                          f = 0;
+                          d: while (1) {
+                            if ((e | 0) >= (w | 0)) {
+                              v = f;
+                              break c;
+                            }
+                            o = (e + 1) | 0;
+                            p = (x + (o << 2)) | 0;
+                            q = (t + (e << 2)) | 0;
+                            a = c[(x + (e << 2)) >> 2] | 0;
+                            while (1) {
+                              if ((a | 0) >= (c[p >> 2] | 0)) break;
+                              k = c[(y + (a << 2)) >> 2] | 0;
+                              l = (z + ((k + 1) << 2)) | 0;
+                              m = (r + (a << 3)) | 0;
+                              k = c[(z + (k << 2)) >> 2] | 0;
+                              while (1) {
+                                if ((k | 0) >= (c[l >> 2] | 0)) break;
+                                e = (A + (k << 2)) | 0;
+                                g = c[e >> 2] | 0;
+                                i = (B + (g << 2)) | 0;
+                                j = c[i >> 2] | 0;
+                                if ((j | 0) < (c[q >> 2] | 0)) {
+                                  c[i >> 2] = f;
+                                  c[(u + (f << 2)) >> 2] = c[e >> 2];
+                                  h[(b + (f << 3)) >> 3] = +h[(n + (k << 3)) >> 3] * +h[m >> 3];
+                                  f = (f + 1) | 0;
+                                } else {
+                                  if ((c[(u + (j << 2)) >> 2] | 0) != (g | 0)) break d;
+                                  s = (b + (j << 3)) | 0;
+                                  h[s >> 3] = +h[s >> 3] + +h[(n + (k << 3)) >> 3] * +h[m >> 3];
+                                }
+                                k = (k + 1) | 0;
+                              }
+                              a = (a + 1) | 0;
+                            }
+                            c[(t + (o << 2)) >> 2] = f;
+                            e = o;
+                          }
+                          qa(95534, 94943, 1468, 95512);
+                          break;
+                        }
+                        case 2: {
+                          s = c[(a + 28) >> 2] | 0;
+                          b = c[(b + 28) >> 2] | 0;
+                          o = c[(d + 28) >> 2] | 0;
+                          c[t >> 2] = 0;
+                          e = 0;
+                          f = 0;
+                          e: while (1) {
+                            if ((e | 0) >= (w | 0)) {
+                              v = f;
+                              break c;
+                            }
+                            p = (e + 1) | 0;
+                            q = (x + (p << 2)) | 0;
+                            r = (t + (e << 2)) | 0;
+                            n = c[(x + (e << 2)) >> 2] | 0;
+                            while (1) {
+                              if ((n | 0) >= (c[q >> 2] | 0)) break;
+                              k = c[(y + (n << 2)) >> 2] | 0;
+                              l = (z + ((k + 1) << 2)) | 0;
+                              a = n << 1;
+                              m = (s + (a << 3)) | 0;
+                              a = (s + ((a | 1) << 3)) | 0;
+                              k = c[(z + (k << 2)) >> 2] | 0;
+                              while (1) {
+                                if ((k | 0) >= (c[l >> 2] | 0)) break;
+                                e = (A + (k << 2)) | 0;
+                                g = c[e >> 2] | 0;
+                                i = (B + (g << 2)) | 0;
+                                j = c[i >> 2] | 0;
+                                if ((j | 0) < (c[r >> 2] | 0)) {
+                                  c[i >> 2] = f;
+                                  c[(u + (f << 2)) >> 2] = c[e >> 2];
+                                  i = k << 1;
+                                  g = (b + (i << 3)) | 0;
+                                  i = (b + ((i | 1) << 3)) | 0;
+                                  j = f << 1;
+                                  h[(o + (j << 3)) >> 3] = +h[g >> 3] * +h[m >> 3] - +h[i >> 3] * +h[a >> 3];
+                                  h[(o + ((j | 1) << 3)) >> 3] = +h[g >> 3] * +h[a >> 3] + +h[i >> 3] * +h[m >> 3];
+                                  f = (f + 1) | 0;
+                                } else {
+                                  if ((c[(u + (j << 2)) >> 2] | 0) != (g | 0)) break e;
+                                  i = k << 1;
+                                  g = (b + (i << 3)) | 0;
+                                  i = (b + ((i | 1) << 3)) | 0;
+                                  j = j << 1;
+                                  e = (o + (j << 3)) | 0;
+                                  h[e >> 3] = +h[e >> 3] + +h[g >> 3] * +h[m >> 3] - +h[i >> 3] * +h[a >> 3];
+                                  j = (o + ((j | 1) << 3)) | 0;
+                                  h[j >> 3] = +h[g >> 3] * +h[a >> 3] + +h[i >> 3] * +h[m >> 3] + +h[j >> 3];
+                                }
+                                k = (k + 1) | 0;
+                              }
+                              n = (n + 1) | 0;
+                            }
+                            c[(t + (p << 2)) >> 2] = f;
+                            e = p;
+                          }
+                          qa(95534, 94943, 1497, 95512);
+                          break;
+                        }
+                        case 4: {
+                          r = c[(a + 28) >> 2] | 0;
+                          n = c[(b + 28) >> 2] | 0;
+                          b = c[(d + 28) >> 2] | 0;
+                          c[t >> 2] = 0;
+                          e = 0;
+                          f = 0;
+                          f: while (1) {
+                            if ((f | 0) >= (w | 0)) {
+                              v = e;
+                              break c;
+                            }
+                            o = (f + 1) | 0;
+                            p = (x + (o << 2)) | 0;
+                            q = (t + (f << 2)) | 0;
+                            l = c[(x + (f << 2)) >> 2] | 0;
+                            while (1) {
+                              if ((l | 0) >= (c[p >> 2] | 0)) break;
+                              k = c[(y + (l << 2)) >> 2] | 0;
+                              m = (z + ((k + 1) << 2)) | 0;
+                              a = (r + (l << 2)) | 0;
+                              k = c[(z + (k << 2)) >> 2] | 0;
+                              while (1) {
+                                if ((k | 0) >= (c[m >> 2] | 0)) break;
+                                f = (A + (k << 2)) | 0;
+                                g = c[f >> 2] | 0;
+                                i = (B + (g << 2)) | 0;
+                                j = c[i >> 2] | 0;
+                                if ((j | 0) < (c[q >> 2] | 0)) {
+                                  c[i >> 2] = e;
+                                  c[(u + (e << 2)) >> 2] = c[f >> 2];
+                                  c[(b + (e << 2)) >> 2] = O(c[(n + (k << 2)) >> 2] | 0, c[a >> 2] | 0) | 0;
+                                  e = (e + 1) | 0;
+                                } else {
+                                  if ((c[(u + (j << 2)) >> 2] | 0) != (g | 0)) break f;
+                                  i = O(c[(n + (k << 2)) >> 2] | 0, c[a >> 2] | 0) | 0;
+                                  s = (b + (j << 2)) | 0;
+                                  c[s >> 2] = (c[s >> 2] | 0) + i;
+                                }
+                                k = (k + 1) | 0;
+                              }
+                              l = (l + 1) | 0;
+                            }
+                            c[(t + (o << 2)) >> 2] = e;
+                            f = o;
+                          }
+                          qa(95534, 94943, 1523, 95512);
+                          break;
+                        }
+                        case 8: {
+                          c[t >> 2] = 0;
+                          e = 0;
+                          f = 0;
+                          g: while (1) {
+                            if ((f | 0) >= (w | 0)) {
+                              v = e;
+                              break c;
+                            }
+                            a = (f + 1) | 0;
+                            n = (x + (a << 2)) | 0;
+                            b = (t + (f << 2)) | 0;
+                            l = c[(x + (f << 2)) >> 2] | 0;
+                            while (1) {
+                              if ((l | 0) >= (c[n >> 2] | 0)) break;
+                              k = c[(y + (l << 2)) >> 2] | 0;
+                              m = (z + ((k + 1) << 2)) | 0;
+                              k = c[(z + (k << 2)) >> 2] | 0;
+                              while (1) {
+                                if ((k | 0) >= (c[m >> 2] | 0)) break;
+                                f = (A + (k << 2)) | 0;
+                                g = c[f >> 2] | 0;
+                                i = (B + (g << 2)) | 0;
+                                j = c[i >> 2] | 0;
+                                if ((j | 0) >= (c[b >> 2] | 0)) {
+                                  if ((c[(u + (j << 2)) >> 2] | 0) != (g | 0)) break g;
+                                } else {
+                                  c[i >> 2] = e;
+                                  c[(u + (e << 2)) >> 2] = c[f >> 2];
+                                  e = (e + 1) | 0;
+                                }
+                                k = (k + 1) | 0;
+                              }
+                              l = (l + 1) | 0;
+                            }
+                            c[(t + (a << 2)) >> 2] = e;
+                            f = a;
+                          }
+                          qa(95534, 94943, 1543, 95512);
+                          break;
+                        }
+                        default: {
+                          qw(d);
+                          d = 0;
+                          break b;
+                        }
+                      }
+                    while (0);
+                    c[(d + 8) >> 2] = v;
+                  }
+                while (0);
+                U1(B);
+              } else d = 0;
+              return d | 0;
+            }
+            function Mw(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0.0,
+                K = 0.0,
+                L = 0.0,
+                M = 0.0;
+              F = c[(a + 20) >> 2] | 0;
+              G = c[(a + 24) >> 2] | 0;
+              H = c[(b + 20) >> 2] | 0;
+              B = c[(b + 24) >> 2] | 0;
+              C = c[(d + 20) >> 2] | 0;
+              D = c[(d + 24) >> 2] | 0;
+              E = c[(a + 32) >> 2] | 0;
+              if (!((E | 0) == 1 ? (E | 0) == (c[(b + 32) >> 2] | 0) : 0)) qa(95005, 94943, 1574, 95559);
+              E = c[a >> 2] | 0;
+              if (
+                (
+                  (
+                    ((c[(a + 4) >> 2] | 0) == (c[b >> 2] | 0) ? (c[(b + 4) >> 2] | 0) == (c[d >> 2] | 0) : 0)
+                      ? ((q = c[(a + 16) >> 2] | 0), (q | 0) == (c[(b + 16) >> 2] | 0))
+                      : 0
+                  )
+                    ? (q | 0) == (c[(d + 16) >> 2] | 0)
+                    : 0
+                )
+                  ? ((p = (d + 4) | 0), (I = KK(c[p >> 2] << 2) | 0), (I | 0) != 0)
+                  : 0
+              ) {
+                e = 0;
+                while (1) {
+                  if ((e | 0) >= (c[p >> 2] | 0)) {
+                    f = 0;
+                    e = 0;
+                    break;
+                  }
+                  c[(I + (e << 2)) >> 2] = -1;
+                  e = (e + 1) | 0;
+                }
+                a: while (1) {
+                  if ((e | 0) >= (E | 0)) break;
+                  m = (e + 1) | 0;
+                  n = (F + (m << 2)) | 0;
+                  o = (-2 - e) | 0;
+                  l = c[(F + (e << 2)) >> 2] | 0;
+                  while (1) {
+                    if ((l | 0) >= (c[n >> 2] | 0)) {
+                      e = m;
+                      continue a;
+                    }
+                    j = c[(G + (l << 2)) >> 2] | 0;
+                    k = (H + ((j + 1) << 2)) | 0;
+                    j = c[(H + (j << 2)) >> 2] | 0;
+                    while (1) {
+                      if ((j | 0) >= (c[k >> 2] | 0)) break;
+                      g = c[(B + (j << 2)) >> 2] | 0;
+                      i = (C + ((g + 1) << 2)) | 0;
+                      g = c[(C + (g << 2)) >> 2] | 0;
+                      while (1) {
+                        if ((g | 0) >= (c[i >> 2] | 0)) break;
+                        e = (I + (c[(D + (g << 2)) >> 2] << 2)) | 0;
+                        if ((c[e >> 2] | 0) != (o | 0)) {
+                          c[e >> 2] = o;
+                          f = (f + 1) | 0;
+                        }
+                        g = (g + 1) | 0;
+                      }
+                      j = (j + 1) | 0;
+                    }
+                    l = (l + 1) | 0;
+                  }
+                }
+                e = rw(E, c[p >> 2] | 0, f, q, 1) | 0;
+                b: do
+                  if (!e) e = 0;
+                  else {
+                    y = c[(e + 20) >> 2] | 0;
+                    z = c[(e + 24) >> 2] | 0;
+                    c: do
+                      switch (q | 0) {
+                        case 1: {
+                          v = c[(a + 28) >> 2] | 0;
+                          u = c[(b + 28) >> 2] | 0;
+                          d = c[(d + 28) >> 2] | 0;
+                          r = c[(e + 28) >> 2] | 0;
+                          c[y >> 2] = 0;
+                          f = 0;
+                          g = 0;
+                          d: while (1) {
+                            if ((f | 0) >= (E | 0)) {
+                              A = g;
+                              break c;
+                            }
+                            s = (f + 1) | 0;
+                            t = (F + (s << 2)) | 0;
+                            b = (y + (f << 2)) | 0;
+                            q = c[(F + (f << 2)) >> 2] | 0;
+                            while (1) {
+                              if ((q | 0) >= (c[t >> 2] | 0)) break;
+                              o = c[(G + (q << 2)) >> 2] | 0;
+                              p = (H + ((o + 1) << 2)) | 0;
+                              a = (v + (q << 3)) | 0;
+                              o = c[(H + (o << 2)) >> 2] | 0;
+                              while (1) {
+                                if ((o | 0) >= (c[p >> 2] | 0)) break;
+                                l = c[(B + (o << 2)) >> 2] | 0;
+                                m = (C + ((l + 1) << 2)) | 0;
+                                n = (u + (o << 3)) | 0;
+                                l = c[(C + (l << 2)) >> 2] | 0;
+                                while (1) {
+                                  if ((l | 0) >= (c[m >> 2] | 0)) break;
+                                  f = (D + (l << 2)) | 0;
+                                  i = c[f >> 2] | 0;
+                                  j = (I + (i << 2)) | 0;
+                                  k = c[j >> 2] | 0;
+                                  if ((k | 0) < (c[b >> 2] | 0)) {
+                                    c[j >> 2] = g;
+                                    c[(z + (g << 2)) >> 2] = c[f >> 2];
+                                    h[(r + (g << 3)) >> 3] = +h[n >> 3] * +h[a >> 3] * +h[(d + (l << 3)) >> 3];
+                                    g = (g + 1) | 0;
+                                  } else {
+                                    if ((c[(z + (k << 2)) >> 2] | 0) != (i | 0)) break d;
+                                    x = (r + (k << 3)) | 0;
+                                    h[x >> 3] = +h[x >> 3] + +h[n >> 3] * +h[a >> 3] * +h[(d + (l << 3)) >> 3];
+                                  }
+                                  l = (l + 1) | 0;
+                                }
+                                o = (o + 1) | 0;
+                              }
+                              q = (q + 1) | 0;
+                            }
+                            c[(y + (s << 2)) >> 2] = g;
+                            f = s;
+                          }
+                          qa(95582, 94943, 1642, 95559);
+                          break;
+                        }
+                        case 2: {
+                          x = c[(a + 28) >> 2] | 0;
+                          w = c[(b + 28) >> 2] | 0;
+                          r = c[(d + 28) >> 2] | 0;
+                          s = c[(e + 28) >> 2] | 0;
+                          c[y >> 2] = 0;
+                          f = 0;
+                          g = 0;
+                          e: while (1) {
+                            if ((g | 0) >= (E | 0)) {
+                              A = f;
+                              break c;
+                            }
+                            t = (g + 1) | 0;
+                            u = (F + (t << 2)) | 0;
+                            v = (y + (g << 2)) | 0;
+                            a = c[(F + (g << 2)) >> 2] | 0;
+                            while (1) {
+                              if ((a | 0) >= (c[u >> 2] | 0)) break;
+                              m = c[(G + (a << 2)) >> 2] | 0;
+                              q = (H + ((m + 1) << 2)) | 0;
+                              d = a << 1;
+                              b = (x + (d << 3)) | 0;
+                              d = (x + ((d | 1) << 3)) | 0;
+                              m = c[(H + (m << 2)) >> 2] | 0;
+                              while (1) {
+                                if ((m | 0) >= (c[q >> 2] | 0)) break;
+                                l = c[(B + (m << 2)) >> 2] | 0;
+                                n = (C + ((l + 1) << 2)) | 0;
+                                p = m << 1;
+                                o = (w + (p << 3)) | 0;
+                                p = (w + ((p | 1) << 3)) | 0;
+                                l = c[(C + (l << 2)) >> 2] | 0;
+                                while (1) {
+                                  if ((l | 0) >= (c[n >> 2] | 0)) break;
+                                  g = (D + (l << 2)) | 0;
+                                  i = c[g >> 2] | 0;
+                                  j = (I + (i << 2)) | 0;
+                                  k = c[j >> 2] | 0;
+                                  if ((k | 0) < (c[v >> 2] | 0)) {
+                                    c[j >> 2] = f;
+                                    c[(z + (f << 2)) >> 2] = c[g >> 2];
+                                    K = +h[b >> 3];
+                                    L = +h[o >> 3];
+                                    J = +h[d >> 3];
+                                    M = +h[p >> 3];
+                                    j = l << 1;
+                                    i = (r + (j << 3)) | 0;
+                                    j = (r + ((j | 1) << 3)) | 0;
+                                    k = f << 1;
+                                    h[(s + (k << 3)) >> 3] =
+                                      (L * K - M * J) * +h[i >> 3] - (M * K + J * L) * +h[j >> 3];
+                                    L = +h[b >> 3];
+                                    J = +h[p >> 3];
+                                    K = +h[d >> 3];
+                                    M = +h[o >> 3];
+                                    h[(s + ((k | 1) << 3)) >> 3] =
+                                      (M * K + J * L) * +h[i >> 3] + (M * L - K * J) * +h[j >> 3];
+                                    f = (f + 1) | 0;
+                                  } else {
+                                    if ((c[(z + (k << 2)) >> 2] | 0) != (i | 0)) break e;
+                                    L = +h[b >> 3];
+                                    K = +h[o >> 3];
+                                    M = +h[d >> 3];
+                                    J = +h[p >> 3];
+                                    j = l << 1;
+                                    i = (r + (j << 3)) | 0;
+                                    j = (r + ((j | 1) << 3)) | 0;
+                                    k = k << 1;
+                                    g = (s + (k << 3)) | 0;
+                                    h[g >> 3] =
+                                      +h[g >> 3] + (K * L - J * M) * +h[i >> 3] - (J * L + M * K) * +h[j >> 3];
+                                    K = +h[b >> 3];
+                                    M = +h[p >> 3];
+                                    L = +h[d >> 3];
+                                    J = +h[o >> 3];
+                                    k = (s + ((k | 1) << 3)) | 0;
+                                    h[k >> 3] =
+                                      (J * L + M * K) * +h[i >> 3] + (J * K - L * M) * +h[j >> 3] + +h[k >> 3];
+                                  }
+                                  l = (l + 1) | 0;
+                                }
+                                m = (m + 1) | 0;
+                              }
+                              a = (a + 1) | 0;
+                            }
+                            c[(y + (t << 2)) >> 2] = f;
+                            g = t;
+                          }
+                          qa(95582, 94943, 1674, 95559);
+                          break;
+                        }
+                        case 4: {
+                          v = c[(a + 28) >> 2] | 0;
+                          u = c[(b + 28) >> 2] | 0;
+                          b = c[(d + 28) >> 2] | 0;
+                          d = c[(e + 28) >> 2] | 0;
+                          c[y >> 2] = 0;
+                          f = 0;
+                          g = 0;
+                          f: while (1) {
+                            if ((g | 0) >= (E | 0)) {
+                              A = f;
+                              break c;
+                            }
+                            r = (g + 1) | 0;
+                            s = (F + (r << 2)) | 0;
+                            t = (y + (g << 2)) | 0;
+                            p = c[(F + (g << 2)) >> 2] | 0;
+                            while (1) {
+                              if ((p | 0) >= (c[s >> 2] | 0)) break;
+                              m = c[(G + (p << 2)) >> 2] | 0;
+                              a = (H + ((m + 1) << 2)) | 0;
+                              q = (v + (p << 2)) | 0;
+                              m = c[(H + (m << 2)) >> 2] | 0;
+                              while (1) {
+                                if ((m | 0) >= (c[a >> 2] | 0)) break;
+                                l = c[(B + (m << 2)) >> 2] | 0;
+                                n = (C + ((l + 1) << 2)) | 0;
+                                o = (u + (m << 2)) | 0;
+                                l = c[(C + (l << 2)) >> 2] | 0;
+                                while (1) {
+                                  if ((l | 0) >= (c[n >> 2] | 0)) break;
+                                  g = (D + (l << 2)) | 0;
+                                  i = c[g >> 2] | 0;
+                                  j = (I + (i << 2)) | 0;
+                                  k = c[j >> 2] | 0;
+                                  if ((k | 0) < (c[t >> 2] | 0)) {
+                                    c[j >> 2] = f;
+                                    c[(z + (f << 2)) >> 2] = c[g >> 2];
+                                    w = O(c[o >> 2] | 0, c[q >> 2] | 0) | 0;
+                                    w = O(w, c[(b + (l << 2)) >> 2] | 0) | 0;
+                                    x = (d + (f << 2)) | 0;
+                                    c[x >> 2] = (c[x >> 2] | 0) + w;
+                                    f = (f + 1) | 0;
+                                  } else {
+                                    if ((c[(z + (k << 2)) >> 2] | 0) != (i | 0)) break f;
+                                    w = O(c[o >> 2] | 0, c[q >> 2] | 0) | 0;
+                                    w = O(w, c[(b + (l << 2)) >> 2] | 0) | 0;
+                                    x = (d + (k << 2)) | 0;
+                                    c[x >> 2] = (c[x >> 2] | 0) + w;
+                                  }
+                                  l = (l + 1) | 0;
+                                }
+                                m = (m + 1) | 0;
+                              }
+                              p = (p + 1) | 0;
+                            }
+                            c[(y + (r << 2)) >> 2] = f;
+                            g = r;
+                          }
+                          qa(95582, 94943, 1706, 95559);
+                          break;
+                        }
+                        case 8: {
+                          c[y >> 2] = 0;
+                          f = 0;
+                          g = 0;
+                          g: while (1) {
+                            if ((g | 0) >= (E | 0)) {
+                              A = f;
+                              break c;
+                            }
+                            a = (g + 1) | 0;
+                            q = (F + (a << 2)) | 0;
+                            b = (y + (g << 2)) | 0;
+                            o = c[(F + (g << 2)) >> 2] | 0;
+                            while (1) {
+                              if ((o | 0) >= (c[q >> 2] | 0)) break;
+                              m = c[(G + (o << 2)) >> 2] | 0;
+                              p = (H + ((m + 1) << 2)) | 0;
+                              m = c[(H + (m << 2)) >> 2] | 0;
+                              while (1) {
+                                if ((m | 0) >= (c[p >> 2] | 0)) break;
+                                l = c[(B + (m << 2)) >> 2] | 0;
+                                n = (C + ((l + 1) << 2)) | 0;
+                                l = c[(C + (l << 2)) >> 2] | 0;
+                                while (1) {
+                                  if ((l | 0) >= (c[n >> 2] | 0)) break;
+                                  g = (D + (l << 2)) | 0;
+                                  i = c[g >> 2] | 0;
+                                  j = (I + (i << 2)) | 0;
+                                  k = c[j >> 2] | 0;
+                                  if ((k | 0) >= (c[b >> 2] | 0)) {
+                                    if ((c[(z + (k << 2)) >> 2] | 0) != (i | 0)) break g;
+                                  } else {
+                                    c[j >> 2] = f;
+                                    c[(z + (f << 2)) >> 2] = c[g >> 2];
+                                    f = (f + 1) | 0;
+                                  }
+                                  l = (l + 1) | 0;
+                                }
+                                m = (m + 1) | 0;
+                              }
+                              o = (o + 1) | 0;
+                            }
+                            c[(y + (a << 2)) >> 2] = f;
+                            g = a;
+                          }
+                          qa(95582, 94943, 1729, 95559);
+                          break;
+                        }
+                        default: {
+                          qw(e);
+                          e = 0;
+                          break b;
+                        }
+                      }
+                    while (0);
+                    c[(e + 8) >> 2] = A;
+                  }
+                while (0);
+                U1(I);
+              } else e = 0;
+              return e | 0;
+            }
+            function Nw(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0;
+              if ((c[(a + 32) >> 2] | 0) != 2) qa(95100, 94943, 1971, 95607);
+              if ((b | 0) >= 1) {
+                h = c[(a + 8) >> 2] | 0;
+                g = (h + b) | 0;
+                if ((g | 0) >= (c[(a + 12) >> 2] | 0)) Ow(a, (g + 10) | 0) | 0;
+                i = h << 2;
+                g = b << 2;
+                W6(((c[(a + 20) >> 2] | 0) + i) | 0, d | 0, g | 0) | 0;
+                W6(((c[(a + 24) >> 2] | 0) + i) | 0, e | 0, g | 0) | 0;
+                g = c[(a + 40) >> 2] | 0;
+                if (g | 0) {
+                  i = O(g, b) | 0;
+                  h = O(g, h) | 0;
+                  W6(((c[(a + 28) >> 2] | 0) + h) | 0, f | 0, i | 0) | 0;
+                }
+                f = (a + 4) | 0;
+                h = 0;
+                while (1) {
+                  if ((h | 0) >= (b | 0)) break;
+                  g = c[(d + (h << 2)) >> 2] | 0;
+                  if ((g | 0) >= (c[a >> 2] | 0)) c[a >> 2] = g + 1;
+                  g = c[(e + (h << 2)) >> 2] | 0;
+                  if ((g | 0) >= (c[f >> 2] | 0)) c[f >> 2] = g + 1;
+                  h = (h + 1) | 0;
+                }
+                i = (a + 8) | 0;
+                c[i >> 2] = (c[i >> 2] | 0) + b;
+              }
+              return a | 0;
+            }
+            function Ow(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              if ((c[(a + 32) >> 2] | 0) == 2) {
+                d = (a + 20) | 0;
+                f = b << 2;
+                c[d >> 2] = MK(c[d >> 2] | 0, f) | 0;
+                d = (a + 24) | 0;
+                c[d >> 2] = MK(c[d >> 2] | 0, f) | 0;
+                d = c[(a + 40) >> 2] | 0;
+                if ((d | 0) > 0) {
+                  f = (a + 28) | 0;
+                  e = c[f >> 2] | 0;
+                  d = O(d, b) | 0;
+                  if (!e) d = KK(d) | 0;
+                  else d = MK(e, d) | 0;
+                  c[f >> 2] = d;
+                }
+              } else {
+                d = (a + 24) | 0;
+                c[d >> 2] = MK(c[d >> 2] | 0, b << 2) | 0;
+                d = c[(a + 40) >> 2] | 0;
+                if ((d | 0) > 0) {
+                  f = (a + 28) | 0;
+                  e = c[f >> 2] | 0;
+                  d = O(d, b) | 0;
+                  if (!e) d = KK(d) | 0;
+                  else d = MK(e, d) | 0;
+                  c[f >> 2] = d;
+                }
+              }
+              c[(a + 12) >> 2] = b;
+              return a | 0;
+            }
+            function Pw(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0.0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0;
+              a: do
+                if (!a) a = 0;
+                else {
+                  l = c[(a + 20) >> 2] | 0;
+                  k = c[(a + 24) >> 2] | 0;
+                  b: do
+                    switch (c[(a + 16) >> 2] | 0) {
+                      case 1: {
+                        i = c[(a + 28) >> 2] | 0;
+                        e = c[a >> 2] | 0;
+                        b = 0;
+                        c: while (1) {
+                          if ((b | 0) >= (e | 0)) break b;
+                          f = (b + 1) | 0;
+                          g = c[(l + (f << 2)) >> 2] | 0;
+                          b = c[(l + (b << 2)) >> 2] | 0;
+                          d = 1.0 / +((g - b) | 0);
+                          while (1) {
+                            if ((b | 0) >= (g | 0)) {
+                              b = f;
+                              continue c;
+                            }
+                            k = (i + (b << 3)) | 0;
+                            h[k >> 3] = +h[k >> 3] * d;
+                            b = (b + 1) | 0;
+                          }
+                        }
+                      }
+                      case 2: {
+                        f = c[(a + 28) >> 2] | 0;
+                        g = c[a >> 2] | 0;
+                        b = 0;
+                        d: while (1) {
+                          if ((b | 0) >= (g | 0)) break b;
+                          i = (b + 1) | 0;
+                          j = c[(l + (i << 2)) >> 2] | 0;
+                          e = c[(l + (b << 2)) >> 2] | 0;
+                          d = 1.0 / +((j - e) | 0);
+                          while (1) {
+                            if ((e | 0) >= (j | 0)) {
+                              b = i;
+                              continue d;
+                            }
+                            if ((c[(k + (e << 2)) >> 2] | 0) != (b | 0)) {
+                              m = e << 1;
+                              n = (f + (m << 3)) | 0;
+                              h[n >> 3] = +h[n >> 3] * d;
+                              m = (f + ((m | 1) << 3)) | 0;
+                              h[m >> 3] = +h[m >> 3] * d;
+                            }
+                            e = (e + 1) | 0;
+                          }
+                        }
+                      }
+                      case 4: {
+                        qa(138394, 94943, 2192, 95648);
+                        break;
+                      }
+                      case 8:
+                        break;
+                      default: {
+                        a = 0;
+                        break a;
+                      }
+                    }
+                  while (0);
+                }
+              while (0);
+              return a | 0;
+            }
+            function Qw(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              if (
+                (a | 0) != 0
+                  ? ((b = (a + 8) | 0), (d = c[b >> 2] | 0), (e = c[(a + 4) >> 2] | 0), (e | 0) == (c[a >> 2] | 0))
+                  : 0
+              ) {
+                g = c[(a + 24) >> 2] | 0;
+                a = c[(a + 20) >> 2] | 0;
+                f = rw(e, e, d, 8, 1) | 0;
+                W6(c[(f + 20) >> 2] | 0, a | 0, ((e << 2) + 4) | 0) | 0;
+                W6(c[(f + 24) >> 2] | 0, g | 0, (d << 2) | 0) | 0;
+                c[(f + 8) >> 2] = c[b >> 2];
+                a = vw(f, 1) | 0;
+                qw(f);
+                a = Bw(a) | 0;
+                e = (a + 8) | 0;
+                d = KK(c[e >> 2] << 3) | 0;
+                c[(a + 28) >> 2] = d;
+                e = c[e >> 2] | 0;
+                b = 0;
+                while (1) {
+                  if ((b | 0) >= (e | 0)) break;
+                  h[(d + (b << 3)) >> 3] = 1.0;
+                  b = (b + 1) | 0;
+                }
+                c[(a + 16) >> 2] = 1;
+                c[(a + 40) >> 2] = 8;
+              } else a = 0;
+              return a | 0;
+            }
+            function Rw(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0;
+              p = c[(a + 20) >> 2] | 0;
+              q = c[(a + 24) >> 2] | 0;
+              v = c[(a + 4) >> 2] | 0;
+              n = c[a >> 2] | 0;
+              r = v << 2;
+              s = KK(r) | 0;
+              t = KK((r + 4) | 0) | 0;
+              u = KK(r) | 0;
+              r = KK(r) | 0;
+              o = (t + 4) | 0;
+              a = 0;
+              while (1) {
+                if ((a | 0) >= (v | 0)) break;
+                c[(s + (a << 2)) >> 2] = 0;
+                a = (a + 1) | 0;
+              }
+              c[o >> 2] = v;
+              a = 0;
+              while (1) {
+                if ((a | 0) >= (v | 0)) {
+                  h = 1;
+                  k = 0;
+                  break;
+                }
+                c[(u + (a << 2)) >> 2] = -1;
+                a = (a + 1) | 0;
+              }
+              a: while (1) {
+                if ((k | 0) >= (n | 0)) break;
+                g = (p + (k << 2)) | 0;
+                l = (k + 1) | 0;
+                m = (p + (l << 2)) | 0;
+                a = c[g >> 2] | 0;
+                while (1) {
+                  f = c[m >> 2] | 0;
+                  if ((a | 0) >= (f | 0)) break;
+                  j = (o + (c[(s + (c[(q + (a << 2)) >> 2] << 2)) >> 2] << 2)) | 0;
+                  c[j >> 2] = (c[j >> 2] | 0) + -1;
+                  a = (a + 1) | 0;
+                }
+                a = h;
+                j = c[g >> 2] | 0;
+                while (1) {
+                  if ((j | 0) >= (f | 0)) {
+                    h = a;
+                    k = l;
+                    continue a;
+                  }
+                  h = (q + (j << 2)) | 0;
+                  f = (s + (c[h >> 2] << 2)) | 0;
+                  i = c[f >> 2] | 0;
+                  g = (u + (i << 2)) | 0;
+                  if ((c[g >> 2] | 0) < (k | 0)) {
+                    c[g >> 2] = k;
+                    f = (o + (i << 2)) | 0;
+                    if (!(c[f >> 2] | 0)) {
+                      c[f >> 2] = 1;
+                      g = a;
+                      a = i;
+                      f = (r + (i << 2)) | 0;
+                    } else {
+                      c[(r + (i << 2)) >> 2] = a;
+                      c[(o + (a << 2)) >> 2] = 1;
+                      g = (a + 1) | 0;
+                      f = (s + (c[h >> 2] << 2)) | 0;
+                    }
+                    c[f >> 2] = a;
+                    a = g;
+                  } else {
+                    i = (r + (i << 2)) | 0;
+                    c[f >> 2] = c[i >> 2];
+                    i = (o + (c[i >> 2] << 2)) | 0;
+                    c[i >> 2] = (c[i >> 2] | 0) + 1;
+                  }
+                  j = (j + 1) | 0;
+                  f = c[m >> 2] | 0;
+                }
+              }
+              c[t >> 2] = 0;
+              a = 0;
+              f = 0;
+              while (1) {
+                if ((a | 0) >= (h | 0)) break;
+                p = (a + 1) | 0;
+                o = (t + (p << 2)) | 0;
+                q = ((c[o >> 2] | 0) + f) | 0;
+                c[o >> 2] = q;
+                a = p;
+                f = q;
+              }
+              c[d >> 2] = r;
+              a = 0;
+              while (1) {
+                if ((a | 0) >= (v | 0)) {
+                  a = h;
+                  break;
+                }
+                q = (t + (c[(s + (a << 2)) >> 2] << 2)) | 0;
+                d = c[q >> 2] | 0;
+                c[q >> 2] = d + 1;
+                c[(r + (d << 2)) >> 2] = a;
+                a = (a + 1) | 0;
+              }
+              while (1) {
+                if ((a | 0) <= 0) break;
+                v = (a + -1) | 0;
+                c[(t + (a << 2)) >> 2] = c[(t + (v << 2)) >> 2];
+                a = v;
+              }
+              c[t >> 2] = 0;
+              c[e >> 2] = t;
+              c[b >> 2] = h;
+              U1(u);
+              U1(s);
+              return;
+            }
+            function Sw() {
+              return +(+(x5() | 0) * 4.656612875245797e-10);
+            }
+            function Tw(a) {
+              a = a | 0;
+              if ((a | 0) > 1) return (x5() | 0) % (a | 0) | 0 | 0;
+              else qa(95682, 95688, 58, 95698);
+              return 0;
+            }
+            function Uw(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              a: do
+                if ((a | 0) < 1) b = 0;
+                else {
+                  b = KK(a << 2) | 0;
+                  d = 0;
+                  while (1) {
+                    if ((d | 0) == (a | 0)) break;
+                    c[(b + (d << 2)) >> 2] = d;
+                    d = (d + 1) | 0;
+                  }
+                  while (1) {
+                    if ((a | 0) <= 1) break a;
+                    e = Tw(a) | 0;
+                    d = (a + -1) | 0;
+                    g = (b + (d << 2)) | 0;
+                    f = c[g >> 2] | 0;
+                    e = (b + (e << 2)) | 0;
+                    c[g >> 2] = c[e >> 2];
+                    c[e >> 2] = f;
+                    a = d;
+                  }
+                }
+              while (0);
+              return b | 0;
+            }
+            function Vw(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0,
+                e = 0;
+              d = 0;
+              while (1) {
+                if ((d | 0) >= (a | 0)) break;
+                e = (c + (d << 3)) | 0;
+                h[e >> 3] = +h[(b + (d << 3)) >> 3] - +h[e >> 3];
+                d = (d + 1) | 0;
+              }
+              return c | 0;
+            }
+            function Ww(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0,
+                e = 0.0,
+                f = 0.0;
+              d = 0;
+              e = 0.0;
+              while (1) {
+                if ((d | 0) >= (a | 0)) break;
+                f = +h[(c + (d << 3)) >> 3] * +h[(b + (d << 3)) >> 3] + e;
+                d = (d + 1) | 0;
+                e = f;
+              }
+              return +e;
+            }
+            function Xw(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = +d;
+              var e = 0,
+                f = 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (a | 0)) break;
+                f = (c + (e << 3)) | 0;
+                h[f >> 3] = +h[f >> 3] * d + +h[(b + (e << 3)) >> 3];
+                e = (e + 1) | 0;
+              }
+              return c | 0;
+            }
+            function Yw(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = +d;
+              var e = 0,
+                f = 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (a | 0)) break;
+                f = (b + (e << 3)) | 0;
+                h[f >> 3] = +h[(c + (e << 3)) >> 3] * d + +h[f >> 3];
+                e = (e + 1) | 0;
+              }
+              return b | 0;
+            }
+            function Zw(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0,
+                g = 0.0;
+              f = O(c, b) | 0;
+              d = O(d, b) | 0;
+              e = 0.0;
+              c = 0;
+              while (1) {
+                if ((c | 0) >= (b | 0)) break;
+                g = +h[(a + ((c + f) << 3)) >> 3] - +h[(a + ((c + d) << 3)) >> 3];
+                e = g * g + e;
+                c = (c + 1) | 0;
+              }
+              g = +C(+e);
+              return +(g > 1.0e-15 ? g : 1.0e-15);
+            }
+            function _w(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0,
+                g = 0.0;
+              f = O(c, b) | 0;
+              d = O(d, b) | 0;
+              e = 0.0;
+              c = 0;
+              while (1) {
+                if ((c | 0) >= (b | 0)) break;
+                g = +h[(a + ((c + f) << 3)) >> 3] - +h[(a + ((c + d) << 3)) >> 3];
+                e = g * g + e;
+                c = (c + 1) | 0;
+              }
+              return +(+C(+e));
+            }
+            function $w(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0,
+                e = 0,
+                f = 0.0;
+              d = 0.0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (c | 0)) break;
+                f = +h[(a + (e << 3)) >> 3] - +h[(b + (e << 3)) >> 3];
+                d = f * f + d;
+                e = (e + 1) | 0;
+              }
+              return +(+C(+d));
+            }
+            function ax(a, b, c, d, e, f, g) {
+              a = +a;
+              b = +b;
+              c = +c;
+              d = +d;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0.0,
+                r = 0,
+                s = 0.0;
+              p = l;
+              l = (l + 80) | 0;
+              n = (p + 48) | 0;
+              m = (p + 24) | 0;
+              o = p;
+              i = 0;
+              while (1) {
+                if ((i | 0) >= (f | 0)) {
+                  j = 0;
+                  break;
+                }
+                q = +h[(g + (i << 3)) >> 3];
+                h[(n + (i << 3)) >> 3] = q;
+                h[(m + (i << 3)) >> 3] = q;
+                i = (i + 1) | 0;
+              }
+              while (1) {
+                if ((j | 0) >= (e | 0)) break;
+                k = O(j, f) | 0;
+                i = 0;
+                while (1) {
+                  if ((i | 0) >= (f | 0)) break;
+                  s = +h[(g + ((i + k) << 3)) >> 3];
+                  r = (n + (i << 3)) | 0;
+                  q = +h[r >> 3];
+                  h[r >> 3] = s < q ? s : q;
+                  r = (m + (i << 3)) | 0;
+                  q = +h[r >> 3];
+                  h[r >> 3] = s > q ? s : q;
+                  i = (i + 1) | 0;
+                }
+                j = (j + 1) | 0;
+              }
+              q = +h[m >> 3] - +h[n >> 3];
+              c = q != 0.0 ? (c - a) / q : 1.0;
+              q = +h[(m + 8) >> 3] - +h[(n + 8) >> 3];
+              s = (d - b) / q;
+              c = q != 0.0 ? (c < s ? c : s) : c;
+              h[o >> 3] = a;
+              h[(o + 8) >> 3] = b;
+              h[(o + 16) >> 3] = 0.0;
+              j = 0;
+              while (1) {
+                if ((j | 0) >= (e | 0)) break;
+                k = O(j, f) | 0;
+                i = 0;
+                while (1) {
+                  if ((i | 0) >= (f | 0)) break;
+                  r = (g + ((i + k) << 3)) | 0;
+                  h[r >> 3] = (+h[r >> 3] - +h[(n + (i << 3)) >> 3]) * c + +h[(o + (i << 3)) >> 3];
+                  i = (i + 1) | 0;
+                }
+                j = (j + 1) | 0;
+              }
+              l = p;
+              return;
+            }
+            function bx(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if ((tB(a) | 0) == 1) {
+                a = c[((c[((jC(a) | 0) + 16) >> 2] | 0) + 132) >> 2] | 0;
+                c[a >> 2] = 0;
+                c[(a + 4) >> 2] = 0;
+                c[(a + 8) >> 2] = 0;
+                c[(a + 12) >> 2] = 0;
+              } else {
+                cx(a);
+                if (!(((dP(QA(b, 95704) | 0) | 0) << 24) >> 24)) b = My(a, 186208) | 0;
+                else b = dx(a) | 0;
+                Vy(a, b, 186208);
+                ex(b);
+              }
+              return;
+            }
+            function cx(a) {
+              a = a | 0;
+              var b = 0;
+              b = xC(c[c[((c[((jC(a) | 0) + 16) >> 2] | 0) + 112) >> 2] >> 2] | 0) | 0;
+              a = c[46925] | 0;
+              if ((b | 0) != (a | 0)) {
+                c[46555] = 0;
+                c[46925] = b;
+                c[46926] = GA(b, 0, 95713, 0) | 0;
+                c[46927] = GA(c[46925] | 0, 1, 95721, 0) | 0;
+                c[46928] = GA(c[46925] | 0, 1, 95738, 0) | 0;
+                a = c[46925] | 0;
+              }
+              c[46929] = QA(a, 95738) | 0;
+              Gy(186208);
+              c[46554] = 1;
+              h[23280] = +_O(c[46925] | 0, c[46926] | 0, 1.0, 0.0);
+              c[46556] = c[46927];
+              c[46557] = c[46928];
+              c[46558] = c[46929];
+              return;
+            }
+            function dx(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              f = l;
+              l = (l + 144) | 0;
+              e = f;
+              d = (f + 8) | 0;
+              b = c[46555] | 0;
+              c[46555] = b + 1;
+              c[e >> 2] = b;
+              m4(d, 96234, e) | 0;
+              d = Hy(ND(a, d, 1) | 0) | 0;
+              e = (d + 8) | 0;
+              b = jC(a) | 0;
+              while (1) {
+                if (!b) break;
+                oC(c[e >> 2] | 0, b, 1) | 0;
+                c[((c[((c[(b + 16) >> 2] | 0) + 112) >> 2] | 0) + 12) >> 2] = d;
+                b = kC(a, b) | 0;
+              }
+              l = f;
+              return d | 0;
+            }
+            function ex(a) {
+              a = a | 0;
+              Uy(a);
+              return;
+            }
+            function fx(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = KK(32) | 0;
+              c[d >> 2] = 4;
+              h[(d + 8) >> 3] = 0.75;
+              c[(d + 16) >> 2] = 1073741824;
+              c[(d + 20) >> 2] = 1;
+              c[(d + 24) >> 2] = a;
+              c[(d + 28) >> 2] = b;
+              return d | 0;
+            }
+            function gx(a) {
+              a = a | 0;
+              U1(a);
+              return;
+            }
+            function hx(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              if (!a) return;
+              d = c[(a + 8) >> 2] | 0;
+              do
+                if (d | 0) {
+                  if (c[a >> 2] | 0) {
+                    qw(d);
+                    b = c[(a + 12) >> 2] | 0;
+                    if (!b) break;
+                    qw(b);
+                    break;
+                  }
+                  if (c[(a + 36) >> 2] | 0 ? (qw(d), (b = c[(a + 12) >> 2] | 0), b | 0) : 0) qw(b);
+                }
+              while (0);
+              qw(c[(a + 16) >> 2] | 0);
+              qw(c[(a + 20) >> 2] | 0);
+              b = c[(a + 24) >> 2] | 0;
+              if (b | 0 ? (c[a >> 2] | 0) > 0 : 0) U1(b);
+              hx(c[(a + 28) >> 2] | 0);
+              U1(a);
+              return;
+            }
+            function ix(a, b, d, e, f, g, i, j, k, m) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              j = j | 0;
+              k = k | 0;
+              m = m | 0;
+              var n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0.0,
+                v = 0;
+              v = l;
+              l = (l + 32) | 0;
+              n = (v + 16) | 0;
+              o = (v + 12) | 0;
+              p = (v + 8) | 0;
+              q = (v + 4) | 0;
+              r = v;
+              c[n >> 2] = a;
+              c[o >> 2] = 0;
+              c[p >> 2] = 0;
+              c[q >> 2] = 0;
+              c[r >> 2] = 0;
+              c[i >> 2] = 0;
+              c[j >> 2] = 0;
+              c[b >> 2] = 0;
+              c[g >> 2] = 0;
+              c[e >> 2] = 0;
+              s = (k + 28) | 0;
+              t = (k + 8) | 0;
+              u = +(c[(a + 4) >> 2] | 0);
+              f = d;
+              do {
+                jx(a, n, f, o, 0, r, p, q, k, m);
+                f = c[n >> 2] | 0;
+                if (!f) break;
+                d = c[(f + 4) >> 2] | 0;
+                f = c[i >> 2] | 0;
+                if (!f) {
+                  c[i >> 2] = c[p >> 2];
+                  c[j >> 2] = c[q >> 2];
+                } else {
+                  a = Lw(f, c[p >> 2] | 0) | 0;
+                  qw(c[i >> 2] | 0);
+                  qw(c[p >> 2] | 0);
+                  c[i >> 2] = a;
+                  a = Lw(c[q >> 2] | 0, c[j >> 2] | 0) | 0;
+                  qw(c[j >> 2] | 0);
+                  qw(c[q >> 2] | 0);
+                  c[j >> 2] = a;
+                }
+                f = c[b >> 2] | 0;
+                if (f | 0) qw(f);
+                c[b >> 2] = c[n >> 2];
+                f = c[e >> 2] | 0;
+                if (f | 0) qw(f);
+                f = c[o >> 2] | 0;
+                c[e >> 2] = f;
+                a = c[g >> 2] | 0;
+                if (a) {
+                  U1(a);
+                  f = c[o >> 2] | 0;
+                }
+                c[g >> 2] = c[r >> 2];
+                a = c[n >> 2] | 0;
+                c[r >> 2] = 0;
+                if (!(+h[t >> 3] * u < +(d | 0))) break;
+              } while ((c[s >> 2] | 0) == 1);
+              l = v;
+              return;
+            }
+            function jx(a, b, d, e, f, g, i, j, k, m) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              j = j | 0;
+              k = k | 0;
+              m = m | 0;
+              var n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0.0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0;
+              H = l;
+              l = (l + 32) | 0;
+              D = (H + 28) | 0;
+              q = (H + 24) | 0;
+              B = (H + 20) | 0;
+              E = (H + 16) | 0;
+              o = (H + 12) | 0;
+              F = (H + 8) | 0;
+              G = (H + 4) | 0;
+              v = H;
+              c[D >> 2] = 0;
+              c[q >> 2] = 0;
+              c[E >> 2] = 0;
+              c[F >> 2] = 0;
+              c[G >> 2] = 0;
+              c[b >> 2] = 0;
+              c[e >> 2] = 0;
+              c[i >> 2] = 0;
+              c[j >> 2] = 0;
+              C = c[a >> 2] | 0;
+              p = (k + 24) | 0;
+              c[m >> 2] = c[p >> 2];
+              n = c[p >> 2] | 0;
+              a: do
+                switch (n | 0) {
+                  case 12: {
+                    c[p >> 2] = 3;
+                    c[m >> 2] = 3;
+                    jx(a, b, d, e, f, g, i, j, k, m);
+                    if (
+                      (
+                        (
+                          (c[b >> 2] | 0) == 0
+                            ? ((c[p >> 2] = 4), (c[m >> 2] = 4), jx(a, b, d, e, f, g, i, j, k, m), (c[b >> 2] | 0) == 0)
+                            : 0
+                        )
+                          ? ((c[p >> 2] = 6), (c[m >> 2] = 6), jx(a, b, d, e, f, g, i, j, k, m), (c[b >> 2] | 0) == 0)
+                          : 0
+                      )
+                        ? ((c[p >> 2] = 9), (c[m >> 2] = 9), jx(a, b, d, e, f, g, i, j, k, m), (c[b >> 2] | 0) == 0)
+                        : 0
+                    ) {
+                      c[p >> 2] = 2;
+                      c[m >> 2] = 2;
+                      jx(a, b, d, e, f, g, i, j, k, m);
+                    }
+                    c[p >> 2] = 12;
+                    p = 0;
+                    q = 0;
+                    k = 0;
+                    o = 0;
+                    n = 0;
+                    m = 0;
+                    break;
+                  }
+                  case 9:
+                  case 10: {
+                    d = c[(k + 20) >> 2] | 0;
+                    if ((n | 0) == 9) qx(a, d, E, o, B);
+                    else rx(a, d, E, o, B);
+                    u = c[(a + 20) >> 2] | 0;
+                    v = c[(a + 24) >> 2] | 0;
+                    t = c[o >> 2] | 0;
+                    if (!(c[(k + 28) >> 2] | 0)) {
+                      if ((t | 0) == (C | 0) ? 1 : +h[(k + 8) >> 3] * +(C | 0) < +(t | 0)) {
+                        p = 0;
+                        q = 0;
+                        k = 0;
+                        o = 0;
+                        n = 0;
+                        m = 0;
+                        break a;
+                      }
+                    } else if ((t | 0) == (C | 0)) {
+                      p = 0;
+                      q = 0;
+                      k = 0;
+                      o = 0;
+                      n = 0;
+                      m = 0;
+                      break a;
+                    }
+                    if ((t | 0) >= (c[k >> 2] | 0)) {
+                      z = c[B >> 2] | 0;
+                      y = z << 2;
+                      x = KK(y) | 0;
+                      y = KK(y) | 0;
+                      z = KK(z << 3) | 0;
+                      c[B >> 2] = 0;
+                      s = c[E >> 2] | 0;
+                      r = 0;
+                      o = 0;
+                      b: while (1) {
+                        if ((r | 0) >= (C | 0)) break;
+                        d = (s + (r << 2)) | 0;
+                        if ((c[d >> 2] | 0) != -1) {
+                          c[(x + (o << 2)) >> 2] = r;
+                          c[(y + (c[B >> 2] << 2)) >> 2] = c[d >> 2];
+                          q = c[B >> 2] | 0;
+                          k = (q + 1) | 0;
+                          c[B >> 2] = k;
+                          h[(z + (q << 3)) >> 3] = 1.0;
+                          r = (r + 1) | 0;
+                          o = k;
+                          continue;
+                        }
+                        n = c[(u + (r << 2)) >> 2] | 0;
+                        q = (r + 1) | 0;
+                        k = (u + (q << 2)) | 0;
+                        p = c[k >> 2] | 0;
+                        d = 0;
+                        m = n;
+                        while (1) {
+                          if ((m | 0) >= (p | 0)) break;
+                          d = ((((c[(s + (c[(v + (m << 2)) >> 2] << 2)) >> 2] | 0) >>> 31) ^ 1) + d) | 0;
+                          m = (m + 1) | 0;
+                        }
+                        w = 1.0 / +(d | 0);
+                        d = p;
+                        while (1) {
+                          if ((n | 0) >= (d | 0)) {
+                            r = q;
+                            continue b;
+                          }
+                          m = (v + (n << 2)) | 0;
+                          if ((c[(s + (c[m >> 2] << 2)) >> 2] | 0) > -1) {
+                            c[(x + (o << 2)) >> 2] = r;
+                            c[(y + (c[B >> 2] << 2)) >> 2] = c[(s + (c[m >> 2] << 2)) >> 2];
+                            d = c[B >> 2] | 0;
+                            m = (d + 1) | 0;
+                            c[B >> 2] = m;
+                            h[(z + (d << 3)) >> 3] = w;
+                            d = c[k >> 2] | 0;
+                          } else m = o;
+                          n = (n + 1) | 0;
+                          o = m;
+                        }
+                      }
+                      C = Dw(o, C, t, x, y, z, 1, 8) | 0;
+                      c[i >> 2] = C;
+                      C = pw(C) | 0;
+                      c[j >> 2] = C;
+                      i = Mw(C, a, c[i >> 2] | 0) | 0;
+                      c[b >> 2] = i;
+                      if (!i) {
+                        p = z;
+                        q = y;
+                        k = x;
+                        o = x;
+                        n = y;
+                        m = z;
+                      } else {
+                        Jw(c[j >> 2] | 0, f, g, 0);
+                        p = c[b >> 2] | 0;
+                        q = (p + 36) | 0;
+                        c[q >> 2] = c[q >> 2] | 3;
+                        c[b >> 2] = Bw(p) | 0;
+                        c[e >> 2] = 0;
+                        p = z;
+                        q = y;
+                        k = x;
+                        o = x;
+                        n = y;
+                        m = z;
+                      }
+                    } else {
+                      p = 0;
+                      q = 0;
+                      k = 0;
+                      o = 0;
+                      n = 0;
+                      m = 0;
+                    }
+                    break;
+                  }
+                  case 5: {
+                    A = 26;
+                    break;
+                  }
+                  case 1: {
+                    m = (k + 20) | 0;
+                    nx(a, c[m >> 2] | 0, D, q);
+                    d = c[p >> 2] | 0;
+                    if ((d | 0) == 2) {
+                      d = m;
+                      A = 24;
+                    } else A = 25;
+                    break;
+                  }
+                  case 2: {
+                    d = (k + 20) | 0;
+                    A = 24;
+                    break;
+                  }
+                  case 3: {
+                    kx(a, c[(k + 20) >> 2] | 0, F, G, v);
+                    A = 12;
+                    break;
+                  }
+                  case 4: {
+                    lx(a, c[(k + 20) >> 2] | 0, F, G, v);
+                    A = 12;
+                    break;
+                  }
+                  case 6: {
+                    mx(a, F, G, v);
+                    A = 12;
+                    break;
+                  }
+                  default: {
+                    p = 0;
+                    q = 0;
+                    k = 0;
+                    o = 0;
+                    n = 0;
+                    m = 0;
+                  }
+                }
+              while (0);
+              do
+                if ((A | 0) == 12) {
+                  r = c[v >> 2] | 0;
+                  if (!(c[(k + 28) >> 2] | 0)) {
+                    if ((r | 0) == (C | 0) ? 1 : +h[(k + 8) >> 3] * +(C | 0) < +(r | 0)) {
+                      p = 0;
+                      q = 0;
+                      k = 0;
+                      o = 0;
+                      n = 0;
+                      m = 0;
+                      break;
+                    }
+                  } else if ((r | 0) == (C | 0)) {
+                    p = 0;
+                    q = 0;
+                    k = 0;
+                    o = 0;
+                    n = 0;
+                    m = 0;
+                    break;
+                  }
+                  if ((r | 0) >= (c[k >> 2] | 0)) {
+                    t = C << 2;
+                    s = KK(t) | 0;
+                    t = KK(t) | 0;
+                    u = KK(C << 3) | 0;
+                    c[B >> 2] = 0;
+                    o = c[G >> 2] | 0;
+                    p = c[F >> 2] | 0;
+                    n = 0;
+                    d = 0;
+                    c: while (1) {
+                      if ((n | 0) >= (c[v >> 2] | 0)) break;
+                      q = (n + 1) | 0;
+                      k = (o + (q << 2)) | 0;
+                      m = c[(o + (n << 2)) >> 2] | 0;
+                      while (1) {
+                        if ((m | 0) >= (c[k >> 2] | 0)) {
+                          n = q;
+                          continue c;
+                        }
+                        c[(s + (d << 2)) >> 2] = c[(p + (m << 2)) >> 2];
+                        c[(t + (c[B >> 2] << 2)) >> 2] = n;
+                        y = c[B >> 2] | 0;
+                        z = (y + 1) | 0;
+                        c[B >> 2] = z;
+                        h[(u + (y << 3)) >> 3] = 1.0;
+                        m = (m + 1) | 0;
+                        d = z;
+                      }
+                    }
+                    C = Dw(d, C, r, s, t, u, 1, 8) | 0;
+                    c[i >> 2] = C;
+                    c[j >> 2] = pw(C) | 0;
+                    c[e >> 2] = 0;
+                    i = Mw(c[j >> 2] | 0, a, c[i >> 2] | 0) | 0;
+                    c[b >> 2] = i;
+                    if (!i) {
+                      p = u;
+                      q = t;
+                      k = s;
+                      o = s;
+                      n = t;
+                      m = u;
+                    } else {
+                      Jw(c[j >> 2] | 0, f, g, 0);
+                      c[j >> 2] = Pw(c[j >> 2] | 0) | 0;
+                      p = c[b >> 2] | 0;
+                      q = (p + 36) | 0;
+                      c[q >> 2] = c[q >> 2] | 3;
+                      c[b >> 2] = Bw(p) | 0;
+                      p = u;
+                      q = t;
+                      k = s;
+                      o = s;
+                      n = t;
+                      m = u;
+                    }
+                  } else {
+                    p = 0;
+                    q = 0;
+                    k = 0;
+                    o = 0;
+                    n = 0;
+                    m = 0;
+                  }
+                } else if ((A | 0) == 24) {
+                  ox(a, c[d >> 2] | 0, D, q);
+                  d = c[p >> 2] | 0;
+                  A = 25;
+                }
+              while (0);
+              if ((A | 0) == 25)
+                if ((d | 0) == 5) A = 26;
+                else A = 27;
+              if ((A | 0) == 26) {
+                px(a, c[(k + 20) >> 2] | 0, D, q);
+                A = 27;
+              }
+              do
+                if ((A | 0) == 27) {
+                  d = c[q >> 2] | 0;
+                  if (!(c[(k + 28) >> 2] | 0)) {
+                    if ((d | 0) == (C | 0) ? 1 : +h[(k + 8) >> 3] * +(C | 0) < +(d | 0)) {
+                      p = 0;
+                      q = 0;
+                      k = 0;
+                      o = 0;
+                      n = 0;
+                      m = 0;
+                      break;
+                    }
+                  } else if ((d | 0) == (C | 0)) {
+                    p = 0;
+                    q = 0;
+                    k = 0;
+                    o = 0;
+                    n = 0;
+                    m = 0;
+                    break;
+                  }
+                  if ((d | 0) >= (c[k >> 2] | 0)) {
+                    s = C << 2;
+                    r = KK(s) | 0;
+                    s = KK(s) | 0;
+                    t = KK(C << 3) | 0;
+                    c[B >> 2] = 0;
+                    q = c[D >> 2] | 0;
+                    d = 0;
+                    p = 0;
+                    while (1) {
+                      if ((p | 0) >= (C | 0)) break;
+                      m = (q + (p << 2)) | 0;
+                      n = c[m >> 2] | 0;
+                      if ((n | 0) > -1) {
+                        c[(r + (c[B >> 2] << 2)) >> 2] = p;
+                        c[(s + (c[B >> 2] << 2)) >> 2] = d;
+                        A = c[B >> 2] | 0;
+                        o = (A + 1) | 0;
+                        c[B >> 2] = o;
+                        h[(t + (A << 3)) >> 3] = 1.0;
+                        if ((n | 0) != (p | 0)) {
+                          c[(r + (o << 2)) >> 2] = c[m >> 2];
+                          c[(s + (c[B >> 2] << 2)) >> 2] = d;
+                          A = c[B >> 2] | 0;
+                          c[B >> 2] = A + 1;
+                          h[(t + (A << 3)) >> 3] = 1.0;
+                          c[(q + (c[m >> 2] << 2)) >> 2] = -1;
+                        }
+                        c[m >> 2] = -1;
+                        d = (d + 1) | 0;
+                      }
+                      p = (p + 1) | 0;
+                    }
+                    C = Dw(c[B >> 2] | 0, C, d, r, s, t, 1, 8) | 0;
+                    c[i >> 2] = C;
+                    C = pw(C) | 0;
+                    c[j >> 2] = C;
+                    i = Mw(C, a, c[i >> 2] | 0) | 0;
+                    c[b >> 2] = i;
+                    if (!i) {
+                      p = t;
+                      q = s;
+                      k = r;
+                      o = r;
+                      n = s;
+                      m = t;
+                    } else {
+                      Jw(c[j >> 2] | 0, f, g, 0);
+                      c[j >> 2] = Pw(c[j >> 2] | 0) | 0;
+                      p = c[b >> 2] | 0;
+                      q = (p + 36) | 0;
+                      c[q >> 2] = c[q >> 2] | 3;
+                      c[b >> 2] = Bw(p) | 0;
+                      c[e >> 2] = 0;
+                      p = t;
+                      q = s;
+                      k = r;
+                      o = r;
+                      n = s;
+                      m = t;
+                    }
+                  } else {
+                    p = 0;
+                    q = 0;
+                    k = 0;
+                    o = 0;
+                    n = 0;
+                    m = 0;
+                  }
+                }
+              while (0);
+              d = c[D >> 2] | 0;
+              if (d | 0) U1(d);
+              d = c[E >> 2] | 0;
+              if (d | 0) U1(d);
+              if (k | 0) U1(o);
+              if (q | 0) U1(n);
+              if (p | 0) U1(m);
+              d = c[F >> 2] | 0;
+              if (d | 0) U1(d);
+              d = c[G >> 2] | 0;
+              if (d | 0) U1(d);
+              l = H;
+              return;
+            }
+            function kx(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0;
+              t = c[(a + 20) >> 2] | 0;
+              u = c[(a + 24) >> 2] | 0;
+              w = c[a >> 2] | 0;
+              v = w << 2;
+              c[d >> 2] = KK(v) | 0;
+              c[e >> 2] = KK((v + 4) | 0) | 0;
+              v = KK(v) | 0;
+              g = 0;
+              while (1) {
+                if ((g | 0) >= (w | 0)) break;
+                c[(v + (g << 2)) >> 2] = g;
+                g = (g + 1) | 0;
+              }
+              c[f >> 2] = 0;
+              r = c[e >> 2] | 0;
+              c[r >> 2] = 0;
+              s = c[(a + 28) >> 2] | 0;
+              a: do
+                if (!b) {
+                  g = 0;
+                  a = 0;
+                  b: while (1) {
+                    while (1) {
+                      if ((a | 0) >= (w | 0)) {
+                        a = 0;
+                        j = 0.0;
+                        b = 0;
+                        break b;
+                      }
+                      b = a;
+                      a = (a + 1) | 0;
+                      if ((c[(v + (b << 2)) >> 2] | 0) == -1) continue;
+                      b = c[(t + (b << 2)) >> 2] | 0;
+                      if ((((c[(t + (a << 2)) >> 2] | 0) - b) | 0) == 1) break;
+                    }
+                    l = c[(u + (b << 2)) >> 2] | 0;
+                    c[(v + (l << 2)) >> 2] = -1;
+                    m = c[d >> 2] | 0;
+                    c[(m + (g << 2)) >> 2] = l;
+                    n = (t + ((l + 1) << 2)) | 0;
+                    k = c[(t + (l << 2)) >> 2] | 0;
+                    g = (g + 1) | 0;
+                    while (1) {
+                      if ((k | 0) >= (c[n >> 2] | 0)) break;
+                      b = (u + (k << 2)) | 0;
+                      i = c[b >> 2] | 0;
+                      if (
+                        (l | 0) != (i | 0)
+                          ? (((c[(t + ((i + 1) << 2)) >> 2] | 0) - (c[(t + (i << 2)) >> 2] | 0)) | 0) == 1
+                          : 0
+                      ) {
+                        c[(v + (i << 2)) >> 2] = -1;
+                        c[(m + (g << 2)) >> 2] = c[b >> 2];
+                        g = (g + 1) | 0;
+                      }
+                      k = (k + 1) | 0;
+                    }
+                    b = c[f >> 2] | 0;
+                    i = c[(r + (b << 2)) >> 2] | 0;
+                    if (((g - i) | 0) < 5) {
+                      e = (b + 1) | 0;
+                      c[f >> 2] = e;
+                      c[(r + (e << 2)) >> 2] = g;
+                      continue;
+                    }
+                    i = (i + 1) | 0;
+                    b = (b + 1) | 0;
+                    c[f >> 2] = b;
+                    c[(r + (b << 2)) >> 2] = i;
+                    b = i;
+                    while (1) {
+                      if (!(((i | 0) < (g | 0)) & ((b | 0) < (g | 0)))) continue b;
+                      e = (i + 3) | 0;
+                      e = (g | 0) < (e | 0) ? g : e;
+                      q = ((c[f >> 2] | 0) + 1) | 0;
+                      c[f >> 2] = q;
+                      c[(r + (q << 2)) >> 2] = e;
+                      b = (b + 1) | 0;
+                      i = e;
+                    }
+                  }
+                  c: while (1) {
+                    do {
+                      n = b;
+                      while (1) {
+                        if ((n | 0) >= (w | 0)) {
+                          a = 0;
+                          break c;
+                        }
+                        p = (v + (n << 2)) | 0;
+                        i = c[p >> 2] | 0;
+                        if ((i | 0) != -1) break;
+                        n = (n + 1) | 0;
+                      }
+                      b = (n + 1) | 0;
+                      q = c[(t + (b << 2)) >> 2] | 0;
+                      l = 1;
+                      m = c[(t + (n << 2)) >> 2] | 0;
+                      while (1) {
+                        if ((m | 0) >= (q | 0)) break;
+                        k = c[(u + (m << 2)) >> 2] | 0;
+                        if ((n | 0) != (k | 0) ? (c[(v + (k << 2)) >> 2] | 0) != -1 : 0)
+                          if ((i | 0) != -1) {
+                            o = +h[(s + (m << 3)) >> 3];
+                            if ((l | 0) == 0 ? !(o > j) : 0) l = 0;
+                            else {
+                              l = 0;
+                              a = k;
+                              j = o;
+                            }
+                          } else i = -1;
+                        m = (m + 1) | 0;
+                      }
+                    } while ((l | 0) != 0);
+                    c[(v + (a << 2)) >> 2] = -1;
+                    c[p >> 2] = -1;
+                    q = c[d >> 2] | 0;
+                    c[(q + (g << 2)) >> 2] = n;
+                    e = (g + 2) | 0;
+                    c[(q + ((g + 1) << 2)) >> 2] = a;
+                    q = ((c[f >> 2] | 0) + 1) | 0;
+                    c[f >> 2] = q;
+                    c[(r + (q << 2)) >> 2] = e;
+                    g = e;
+                  }
+                  while (1) {
+                    if ((a | 0) >= (w | 0)) break a;
+                    if ((c[(v + (a << 2)) >> 2] | 0) == (a | 0)) {
+                      u = (g + 1) | 0;
+                      c[((c[d >> 2] | 0) + (g << 2)) >> 2] = a;
+                      g = ((c[f >> 2] | 0) + 1) | 0;
+                      c[f >> 2] = g;
+                      c[(r + (g << 2)) >> 2] = u;
+                      g = u;
+                    }
+                    a = (a + 1) | 0;
+                  }
+                } else {
+                  r = Uw(w) | 0;
+                  n = 0;
+                  g = 0;
+                  while (1) {
+                    if ((n | 0) >= (w | 0)) {
+                      q = 0;
+                      a = 0;
+                      j = 0.0;
+                      break;
+                    }
+                    a = c[(r + (n << 2)) >> 2] | 0;
+                    d: do
+                      if (
+                        (c[(v + (a << 2)) >> 2] | 0) != -1
+                          ? ((p = c[(t + (a << 2)) >> 2] | 0), (((c[(t + ((a + 1) << 2)) >> 2] | 0) - p) | 0) == 1)
+                          : 0
+                      ) {
+                        k = c[(u + (p << 2)) >> 2] | 0;
+                        c[(v + (k << 2)) >> 2] = -1;
+                        l = c[d >> 2] | 0;
+                        c[(l + (g << 2)) >> 2] = k;
+                        m = (t + ((k + 1) << 2)) | 0;
+                        i = c[(t + (k << 2)) >> 2] | 0;
+                        g = (g + 1) | 0;
+                        while (1) {
+                          if ((i | 0) >= (c[m >> 2] | 0)) break;
+                          a = (u + (i << 2)) | 0;
+                          b = c[a >> 2] | 0;
+                          if (
+                            (k | 0) != (b | 0)
+                              ? (((c[(t + ((b + 1) << 2)) >> 2] | 0) - (c[(t + (b << 2)) >> 2] | 0)) | 0) == 1
+                              : 0
+                          ) {
+                            c[(v + (b << 2)) >> 2] = -1;
+                            c[(l + (g << 2)) >> 2] = c[a >> 2];
+                            g = (g + 1) | 0;
+                          }
+                          i = (i + 1) | 0;
+                        }
+                        i = c[e >> 2] | 0;
+                        a = c[f >> 2] | 0;
+                        b = c[(i + (a << 2)) >> 2] | 0;
+                        if (((g - b) | 0) < 5) {
+                          q = (a + 1) | 0;
+                          c[f >> 2] = q;
+                          c[(i + (q << 2)) >> 2] = g;
+                          break;
+                        }
+                        b = (b + 1) | 0;
+                        a = (a + 1) | 0;
+                        c[f >> 2] = a;
+                        c[(i + (a << 2)) >> 2] = b;
+                        a = b;
+                        while (1) {
+                          if (!(((b | 0) < (g | 0)) & ((a | 0) < (g | 0)))) break d;
+                          q = (b + 3) | 0;
+                          q = (g | 0) < (q | 0) ? g : q;
+                          m = ((c[f >> 2] | 0) + 1) | 0;
+                          c[f >> 2] = m;
+                          c[(i + (m << 2)) >> 2] = q;
+                          a = (a + 1) | 0;
+                          b = q;
+                        }
+                      }
+                    while (0);
+                    n = (n + 1) | 0;
+                  }
+                  while (1) {
+                    if ((q | 0) >= (w | 0)) {
+                      a = 0;
+                      break;
+                    }
+                    m = c[(r + (q << 2)) >> 2] | 0;
+                    n = (v + (m << 2)) | 0;
+                    b = c[n >> 2] | 0;
+                    if ((b | 0) != -1) {
+                      p = c[(t + ((m + 1) << 2)) >> 2] | 0;
+                      k = 1;
+                      l = c[(t + (m << 2)) >> 2] | 0;
+                      while (1) {
+                        if ((l | 0) >= (p | 0)) break;
+                        i = c[(u + (l << 2)) >> 2] | 0;
+                        if ((m | 0) != (i | 0) ? (c[(v + (i << 2)) >> 2] | 0) != -1 : 0)
+                          if ((b | 0) != -1) {
+                            o = +h[(s + (l << 3)) >> 3];
+                            if ((k | 0) == 0 ? !(o > j) : 0) k = 0;
+                            else {
+                              k = 0;
+                              a = i;
+                              j = o;
+                            }
+                          } else b = -1;
+                        l = (l + 1) | 0;
+                      }
+                      if (!k) {
+                        c[(v + (a << 2)) >> 2] = -1;
+                        c[n >> 2] = -1;
+                        n = c[d >> 2] | 0;
+                        c[(n + (g << 2)) >> 2] = m;
+                        p = (g + 2) | 0;
+                        c[(n + ((g + 1) << 2)) >> 2] = a;
+                        n = c[e >> 2] | 0;
+                        g = ((c[f >> 2] | 0) + 1) | 0;
+                        c[f >> 2] = g;
+                        c[(n + (g << 2)) >> 2] = p;
+                        g = p;
+                      }
+                    }
+                    q = (q + 1) | 0;
+                  }
+                  while (1) {
+                    if ((a | 0) >= (w | 0)) break;
+                    if ((c[(v + (a << 2)) >> 2] | 0) == (a | 0)) {
+                      u = (g + 1) | 0;
+                      c[((c[d >> 2] | 0) + (g << 2)) >> 2] = a;
+                      t = c[e >> 2] | 0;
+                      g = ((c[f >> 2] | 0) + 1) | 0;
+                      c[f >> 2] = g;
+                      c[(t + (g << 2)) >> 2] = u;
+                      g = u;
+                    }
+                    a = (a + 1) | 0;
+                  }
+                  U1(r);
+                }
+              while (0);
+              U1(v);
+              return;
+            }
+            function lx(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0;
+              A = l;
+              l = (l + 16) | 0;
+              q = (A + 8) | 0;
+              y = (A + 4) | 0;
+              z = A;
+              c[y >> 2] = 0;
+              c[z >> 2] = 0;
+              v = c[(a + 20) >> 2] | 0;
+              u = c[(a + 24) >> 2] | 0;
+              w = c[a >> 2] | 0;
+              x = w << 2;
+              c[d >> 2] = KK(x) | 0;
+              c[e >> 2] = KK((x + 4) | 0) | 0;
+              x = KK(x) | 0;
+              g = 0;
+              while (1) {
+                if ((g | 0) >= (w | 0)) break;
+                c[(x + (g << 2)) >> 2] = g;
+                g = (g + 1) | 0;
+              }
+              Rw(a, q, y, z);
+              c[f >> 2] = 0;
+              s = c[e >> 2] | 0;
+              c[s >> 2] = 0;
+              t = c[(a + 28) >> 2] | 0;
+              g = 0;
+              a = 0;
+              a: while (1) {
+                k = c[q >> 2] | 0;
+                m = c[z >> 2] | 0;
+                do {
+                  if ((a | 0) >= (k | 0)) break a;
+                  n = a;
+                  a = (a + 1) | 0;
+                  p = (m + (a << 2)) | 0;
+                  j = c[p >> 2] | 0;
+                  n = c[(m + (n << 2)) >> 2] | 0;
+                } while (((j - n) | 0) < 2);
+                m = c[y >> 2] | 0;
+                k = c[(s + (c[f >> 2] << 2)) >> 2] | 0;
+                while (1) {
+                  if ((n | 0) >= (j | 0)) break;
+                  r = (m + (n << 2)) | 0;
+                  c[(x + (c[r >> 2] << 2)) >> 2] = -1;
+                  j = (g + 1) | 0;
+                  c[((c[d >> 2] | 0) + (g << 2)) >> 2] = c[r >> 2];
+                  if (((j - k) | 0) > 3) {
+                    g = ((c[f >> 2] | 0) + 1) | 0;
+                    c[f >> 2] = g;
+                    c[(s + (g << 2)) >> 2] = j;
+                    g = j;
+                  } else g = k;
+                  k = g;
+                  n = (n + 1) | 0;
+                  g = j;
+                  j = c[p >> 2] | 0;
+                }
+                if ((g | 0) <= (k | 0)) continue;
+                r = ((c[f >> 2] | 0) + 1) | 0;
+                c[f >> 2] = r;
+                c[(s + (r << 2)) >> 2] = g;
+              }
+              b: do
+                if (!b) {
+                  a = 0;
+                  i = 0.0;
+                  j = 0;
+                  c: while (1) {
+                    do {
+                      b = j;
+                      while (1) {
+                        if ((b | 0) >= (w | 0)) {
+                          a = 0;
+                          break c;
+                        }
+                        q = (x + (b << 2)) | 0;
+                        k = c[q >> 2] | 0;
+                        if ((k | 0) != -1) break;
+                        b = (b + 1) | 0;
+                      }
+                      j = (b + 1) | 0;
+                      r = c[(v + (j << 2)) >> 2] | 0;
+                      n = 1;
+                      p = c[(v + (b << 2)) >> 2] | 0;
+                      while (1) {
+                        if ((p | 0) >= (r | 0)) break;
+                        m = c[(u + (p << 2)) >> 2] | 0;
+                        if ((b | 0) != (m | 0) ? (c[(x + (m << 2)) >> 2] | 0) != -1 : 0)
+                          if ((k | 0) != -1) {
+                            o = +h[(t + (p << 3)) >> 3];
+                            if ((n | 0) == 0 ? !(o > i) : 0) n = 0;
+                            else {
+                              n = 0;
+                              a = m;
+                              i = o;
+                            }
+                          } else k = -1;
+                        p = (p + 1) | 0;
+                      }
+                    } while ((n | 0) != 0);
+                    c[(x + (a << 2)) >> 2] = -1;
+                    c[q >> 2] = -1;
+                    r = c[d >> 2] | 0;
+                    c[(r + (g << 2)) >> 2] = b;
+                    e = (g + 2) | 0;
+                    c[(r + ((g + 1) << 2)) >> 2] = a;
+                    r = ((c[f >> 2] | 0) + 1) | 0;
+                    c[f >> 2] = r;
+                    c[(s + (r << 2)) >> 2] = e;
+                    g = e;
+                  }
+                  while (1) {
+                    if ((a | 0) >= (w | 0)) break b;
+                    if ((c[(x + (a << 2)) >> 2] | 0) == (a | 0)) {
+                      v = (g + 1) | 0;
+                      c[((c[d >> 2] | 0) + (g << 2)) >> 2] = a;
+                      g = ((c[f >> 2] | 0) + 1) | 0;
+                      c[f >> 2] = g;
+                      c[(s + (g << 2)) >> 2] = v;
+                      g = v;
+                    }
+                    a = (a + 1) | 0;
+                  }
+                } else {
+                  s = Uw(w) | 0;
+                  r = 0;
+                  a = 0;
+                  i = 0.0;
+                  while (1) {
+                    if ((r | 0) >= (w | 0)) {
+                      a = 0;
+                      break;
+                    }
+                    p = c[(s + (r << 2)) >> 2] | 0;
+                    b = (x + (p << 2)) | 0;
+                    j = c[b >> 2] | 0;
+                    if ((j | 0) != -1) {
+                      q = c[(v + ((p + 1) << 2)) >> 2] | 0;
+                      m = 1;
+                      n = c[(v + (p << 2)) >> 2] | 0;
+                      while (1) {
+                        if ((n | 0) >= (q | 0)) break;
+                        k = c[(u + (n << 2)) >> 2] | 0;
+                        if ((p | 0) != (k | 0) ? (c[(x + (k << 2)) >> 2] | 0) != -1 : 0)
+                          if ((j | 0) != -1) {
+                            o = +h[(t + (n << 3)) >> 3];
+                            if ((m | 0) == 0 ? !(o > i) : 0) m = 0;
+                            else {
+                              m = 0;
+                              a = k;
+                              i = o;
+                            }
+                          } else j = -1;
+                        n = (n + 1) | 0;
+                      }
+                      if (!m) {
+                        c[(x + (a << 2)) >> 2] = -1;
+                        c[b >> 2] = -1;
+                        b = c[d >> 2] | 0;
+                        c[(b + (g << 2)) >> 2] = p;
+                        q = (g + 2) | 0;
+                        c[(b + ((g + 1) << 2)) >> 2] = a;
+                        b = c[e >> 2] | 0;
+                        g = ((c[f >> 2] | 0) + 1) | 0;
+                        c[f >> 2] = g;
+                        c[(b + (g << 2)) >> 2] = q;
+                        g = q;
+                      }
+                    }
+                    r = (r + 1) | 0;
+                  }
+                  while (1) {
+                    if ((a | 0) >= (w | 0)) break;
+                    if ((c[(x + (a << 2)) >> 2] | 0) == (a | 0)) {
+                      v = (g + 1) | 0;
+                      c[((c[d >> 2] | 0) + (g << 2)) >> 2] = a;
+                      u = c[e >> 2] | 0;
+                      g = ((c[f >> 2] | 0) + 1) | 0;
+                      c[f >> 2] = g;
+                      c[(u + (g << 2)) >> 2] = v;
+                      g = v;
+                    }
+                    a = (a + 1) | 0;
+                  }
+                  U1(s);
+                }
+              while (0);
+              U1(c[y >> 2] | 0);
+              U1(c[z >> 2] | 0);
+              U1(x);
+              l = A;
+              return;
+            }
+            function mx(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0;
+              r = c[(a + 20) >> 2] | 0;
+              s = c[(a + 24) >> 2] | 0;
+              v = c[a >> 2] | 0;
+              u = v << 2;
+              c[b >> 2] = KK(u) | 0;
+              c[d >> 2] = KK((u + 4) | 0) | 0;
+              u = KK(u) | 0;
+              q = KK(v << 4) | 0;
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (v | 0)) break;
+                c[(u + (f << 2)) >> 2] = f;
+                f = (f + 1) | 0;
+              }
+              c[e >> 2] = 0;
+              c[c[d >> 2] >> 2] = 0;
+              p = c[(a + 28) >> 2] | 0;
+              t = Uw(v) | 0;
+              f = 0;
+              m = 0;
+              while (1) {
+                if ((m | 0) >= (v | 0)) {
+                  o = 0;
+                  break;
+                }
+                a = c[(t + (m << 2)) >> 2] | 0;
+                a: do
+                  if (
+                    (c[(u + (a << 2)) >> 2] | 0) != -1
+                      ? ((n = c[(r + (a << 2)) >> 2] | 0), (((c[(r + ((a + 1) << 2)) >> 2] | 0) - n) | 0) == 1)
+                      : 0
+                  ) {
+                    j = c[(s + (n << 2)) >> 2] | 0;
+                    c[(u + (j << 2)) >> 2] = -1;
+                    k = c[b >> 2] | 0;
+                    c[(k + (f << 2)) >> 2] = j;
+                    l = (r + ((j + 1) << 2)) | 0;
+                    i = c[(r + (j << 2)) >> 2] | 0;
+                    f = (f + 1) | 0;
+                    while (1) {
+                      if ((i | 0) >= (c[l >> 2] | 0)) break;
+                      a = (s + (i << 2)) | 0;
+                      g = c[a >> 2] | 0;
+                      if (
+                        (j | 0) != (g | 0)
+                          ? (((c[(r + ((g + 1) << 2)) >> 2] | 0) - (c[(r + (g << 2)) >> 2] | 0)) | 0) == 1
+                          : 0
+                      ) {
+                        c[(u + (g << 2)) >> 2] = -1;
+                        c[(k + (f << 2)) >> 2] = c[a >> 2];
+                        f = (f + 1) | 0;
+                      }
+                      i = (i + 1) | 0;
+                    }
+                    i = c[d >> 2] | 0;
+                    a = c[e >> 2] | 0;
+                    g = c[(i + (a << 2)) >> 2] | 0;
+                    if (((f - g) | 0) < 5) {
+                      o = (a + 1) | 0;
+                      c[e >> 2] = o;
+                      c[(i + (o << 2)) >> 2] = f;
+                      break;
+                    }
+                    g = (g + 1) | 0;
+                    a = (a + 1) | 0;
+                    c[e >> 2] = a;
+                    c[(i + (a << 2)) >> 2] = g;
+                    a = g;
+                    while (1) {
+                      if (!(((g | 0) < (f | 0)) & ((a | 0) < (f | 0)))) break a;
+                      o = (g + 3) | 0;
+                      o = (f | 0) < (o | 0) ? f : o;
+                      l = ((c[e >> 2] | 0) + 1) | 0;
+                      c[e >> 2] = l;
+                      c[(i + (l << 2)) >> 2] = o;
+                      a = (a + 1) | 0;
+                      g = o;
+                    }
+                  }
+                while (0);
+                m = (m + 1) | 0;
+              }
+              while (1) {
+                if ((o | 0) >= (v | 0)) {
+                  a = 0;
+                  break;
+                }
+                m = c[(t + (o << 2)) >> 2] | 0;
+                n = (u + (m << 2)) | 0;
+                a = c[n >> 2] | 0;
+                if ((a | 0) != -1) {
+                  l = c[(r + ((m + 1) << 2)) >> 2] | 0;
+                  g = 0;
+                  k = c[(r + (m << 2)) >> 2] | 0;
+                  while (1) {
+                    if ((k | 0) >= (l | 0)) break;
+                    j = c[(s + (k << 2)) >> 2] | 0;
+                    if ((m | 0) != (j | 0) ? (c[(u + (j << 2)) >> 2] | 0) != -1 : 0) {
+                      i = g << 1;
+                      if ((a | 0) == -1) a = -1;
+                      else {
+                        h[(q + (i << 3)) >> 3] = +(j | 0);
+                        h[(q + ((i | 1) << 3)) >> 3] = +h[(p + (k << 3)) >> 3];
+                        g = (g + 1) | 0;
+                      }
+                    }
+                    k = (k + 1) | 0;
+                  }
+                  if ((g | 0) > 0) {
+                    o4(q, g, 16, 81);
+                    g = (g | 0) < 3 ? g : 3;
+                    a = 0;
+                    while (1) {
+                      if ((a | 0) >= (g | 0)) break;
+                      l = ~~+h[(q + ((a << 1) << 3)) >> 3];
+                      c[(u + (l << 2)) >> 2] = -1;
+                      c[((c[b >> 2] | 0) + (f << 2)) >> 2] = l;
+                      a = (a + 1) | 0;
+                      f = (f + 1) | 0;
+                    }
+                    c[n >> 2] = -1;
+                    n = (f + 1) | 0;
+                    c[((c[b >> 2] | 0) + (f << 2)) >> 2] = m;
+                    m = c[d >> 2] | 0;
+                    f = ((c[e >> 2] | 0) + 1) | 0;
+                    c[e >> 2] = f;
+                    c[(m + (f << 2)) >> 2] = n;
+                    f = n;
+                  }
+                }
+                o = (o + 1) | 0;
+              }
+              while (1) {
+                if ((a | 0) >= (v | 0)) break;
+                if ((c[(u + (a << 2)) >> 2] | 0) == (a | 0)) {
+                  s = (f + 1) | 0;
+                  c[((c[b >> 2] | 0) + (f << 2)) >> 2] = a;
+                  r = c[d >> 2] | 0;
+                  f = ((c[e >> 2] | 0) + 1) | 0;
+                  c[e >> 2] = f;
+                  c[(r + (f << 2)) >> 2] = s;
+                  f = s;
+                }
+                a = (a + 1) | 0;
+              }
+              U1(t);
+              U1(u);
+              return;
+            }
+            function nx(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0;
+              p = c[(a + 20) >> 2] | 0;
+              q = c[(a + 24) >> 2] | 0;
+              r = c[a >> 2] | 0;
+              f = c[(a + 4) >> 2] | 0;
+              k = KK(r << 2) | 0;
+              c[d >> 2] = k;
+              a = 0;
+              while (1) {
+                if ((a | 0) >= (r | 0)) break;
+                c[(k + (a << 2)) >> 2] = a;
+                a = (a + 1) | 0;
+              }
+              c[e >> 2] = f;
+              a: do
+                if (!b) {
+                  f = 0;
+                  b: while (1) {
+                    if ((f | 0) >= (r | 0)) break a;
+                    b = (f + 1) | 0;
+                    g = (p + (b << 2)) | 0;
+                    h = (k + (f << 2)) | 0;
+                    i = (k + (f << 2)) | 0;
+                    a = c[(p + (f << 2)) >> 2] | 0;
+                    while (1) {
+                      if ((a | 0) >= (c[g >> 2] | 0)) {
+                        f = b;
+                        continue b;
+                      }
+                      j = (q + (a << 2)) | 0;
+                      d = c[j >> 2] | 0;
+                      if (
+                        ((f | 0) != (d | 0) ? ((o = (k + (d << 2)) | 0), (c[o >> 2] | 0) == (d | 0)) : 0)
+                          ? (c[h >> 2] | 0) == (f | 0)
+                          : 0
+                      ) {
+                        c[o >> 2] = f;
+                        c[i >> 2] = c[j >> 2];
+                        c[e >> 2] = (c[e >> 2] | 0) + -1;
+                      }
+                      a = (a + 1) | 0;
+                    }
+                  }
+                } else {
+                  b = Uw(r) | 0;
+                  a = 0;
+                  while (1) {
+                    if ((a | 0) >= (r | 0)) break;
+                    g = c[(b + (a << 2)) >> 2] | 0;
+                    h = (p + ((g + 1) << 2)) | 0;
+                    f = c[(p + (g << 2)) >> 2] | 0;
+                    while (1) {
+                      if ((f | 0) >= (c[h >> 2] | 0)) break;
+                      i = (q + (f << 2)) | 0;
+                      j = c[i >> 2] | 0;
+                      if (
+                        (
+                          (g | 0) != (j | 0)
+                            ? ((l = c[d >> 2] | 0), (m = (l + (j << 2)) | 0), (c[m >> 2] | 0) == (j | 0))
+                            : 0
+                        )
+                          ? ((n = (l + (g << 2)) | 0), (c[n >> 2] | 0) == (g | 0))
+                          : 0
+                      ) {
+                        c[m >> 2] = g;
+                        c[n >> 2] = c[i >> 2];
+                        c[e >> 2] = (c[e >> 2] | 0) + -1;
+                      }
+                      f = (f + 1) | 0;
+                    }
+                    a = (a + 1) | 0;
+                  }
+                  U1(b);
+                }
+              while (0);
+              return;
+            }
+            function ox(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0.0,
+                j = 0.0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0;
+              r = c[(a + 20) >> 2] | 0;
+              s = c[(a + 24) >> 2] | 0;
+              t = c[a >> 2] | 0;
+              g = c[(a + 4) >> 2] | 0;
+              o = KK(t << 2) | 0;
+              c[d >> 2] = o;
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (t | 0)) break;
+                c[(o + (f << 2)) >> 2] = f;
+                f = (f + 1) | 0;
+              }
+              c[e >> 2] = g;
+              q = c[(a + 28) >> 2] | 0;
+              a: do
+                if (!b) {
+                  f = 0;
+                  i = 0.0;
+                  k = 0;
+                  while (1) {
+                    if ((k | 0) >= (t | 0)) break a;
+                    l = (k + 1) | 0;
+                    m = c[(r + (l << 2)) >> 2] | 0;
+                    n = (o + (k << 2)) | 0;
+                    g = 1;
+                    b = c[(r + (k << 2)) >> 2] | 0;
+                    while (1) {
+                      if ((b | 0) >= (m | 0)) break;
+                      a = c[(s + (b << 2)) >> 2] | 0;
+                      if (
+                        ((k | 0) != (a | 0) ? (c[(o + (a << 2)) >> 2] | 0) == (a | 0) : 0)
+                          ? (c[n >> 2] | 0) == (k | 0)
+                          : 0
+                      ) {
+                        j = +h[(q + (b << 3)) >> 3];
+                        if ((g | 0) == 0 ? !(j > i) : 0) g = 0;
+                        else {
+                          g = 0;
+                          f = a;
+                          i = j;
+                        }
+                      }
+                      b = (b + 1) | 0;
+                    }
+                    if (g | 0) {
+                      k = l;
+                      continue;
+                    }
+                    c[(o + (f << 2)) >> 2] = k;
+                    c[(o + (k << 2)) >> 2] = f;
+                    c[e >> 2] = (c[e >> 2] | 0) + -1;
+                    k = l;
+                  }
+                } else {
+                  p = Uw(t) | 0;
+                  o = 0;
+                  f = 0;
+                  i = 0.0;
+                  while (1) {
+                    if ((o | 0) >= (t | 0)) break;
+                    k = c[(p + (o << 2)) >> 2] | 0;
+                    l = c[d >> 2] | 0;
+                    m = (l + (k << 2)) | 0;
+                    if ((c[m >> 2] | 0) == (k | 0)) {
+                      n = c[(r + ((k + 1) << 2)) >> 2] | 0;
+                      b = c[(r + (k << 2)) >> 2] | 0;
+                      g = 1;
+                      while (1) {
+                        if ((b | 0) >= (n | 0)) break;
+                        a = c[(s + (b << 2)) >> 2] | 0;
+                        if ((k | 0) != (a | 0) ? (c[(l + (a << 2)) >> 2] | 0) == (a | 0) : 0) {
+                          j = +h[(q + (b << 3)) >> 3];
+                          if ((g | 0) == 0 ? !(j > i) : 0) g = 0;
+                          else {
+                            g = 0;
+                            f = a;
+                            i = j;
+                          }
+                        }
+                        b = (b + 1) | 0;
+                      }
+                      if (!g) {
+                        c[(l + (f << 2)) >> 2] = k;
+                        c[m >> 2] = f;
+                        c[e >> 2] = (c[e >> 2] | 0) + -1;
+                      }
+                    }
+                    o = (o + 1) | 0;
+                  }
+                  U1(p);
+                }
+              while (0);
+              return;
+            }
+            function px(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0.0,
+                j = 0.0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0;
+              s = c[(a + 20) >> 2] | 0;
+              t = c[(a + 24) >> 2] | 0;
+              u = c[a >> 2] | 0;
+              g = c[(a + 4) >> 2] | 0;
+              p = KK(u << 2) | 0;
+              c[d >> 2] = p;
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (u | 0)) break;
+                c[(p + (f << 2)) >> 2] = f;
+                f = (f + 1) | 0;
+              }
+              c[e >> 2] = g;
+              r = c[(a + 28) >> 2] | 0;
+              a: do
+                if (!b) {
+                  f = 0;
+                  i = 0.0;
+                  k = 0;
+                  while (1) {
+                    if ((k | 0) >= (u | 0)) break a;
+                    b = c[(s + (k << 2)) >> 2] | 0;
+                    l = (k + 1) | 0;
+                    m = c[(s + (l << 2)) >> 2] | 0;
+                    n = (p + (k << 2)) | 0;
+                    o = +((m - b) | 0);
+                    g = 1;
+                    while (1) {
+                      if ((b | 0) >= (m | 0)) break;
+                      a = c[(t + (b << 2)) >> 2] | 0;
+                      if (
+                        ((k | 0) != (a | 0) ? (c[(p + (a << 2)) >> 2] | 0) == (a | 0) : 0)
+                          ? (c[n >> 2] | 0) == (k | 0)
+                          : 0
+                      ) {
+                        j =
+                          +h[(r + (b << 3)) >> 3] /
+                          (+(((c[(s + ((a + 1) << 2)) >> 2] | 0) - (c[(s + (a << 2)) >> 2] | 0)) | 0) * o);
+                        if ((g | 0) == 0 ? !(j > i) : 0) g = 0;
+                        else {
+                          g = 0;
+                          f = a;
+                          i = j;
+                        }
+                      }
+                      b = (b + 1) | 0;
+                    }
+                    if (g | 0) {
+                      k = l;
+                      continue;
+                    }
+                    c[(p + (f << 2)) >> 2] = k;
+                    c[(p + (k << 2)) >> 2] = f;
+                    c[e >> 2] = (c[e >> 2] | 0) + -1;
+                    k = l;
+                  }
+                } else {
+                  q = Uw(u) | 0;
+                  p = 0;
+                  f = 0;
+                  i = 0.0;
+                  while (1) {
+                    if ((p | 0) >= (u | 0)) break;
+                    k = c[(q + (p << 2)) >> 2] | 0;
+                    l = c[d >> 2] | 0;
+                    m = (l + (k << 2)) | 0;
+                    if ((c[m >> 2] | 0) == (k | 0)) {
+                      b = c[(s + (k << 2)) >> 2] | 0;
+                      n = c[(s + ((k + 1) << 2)) >> 2] | 0;
+                      o = +((n - b) | 0);
+                      g = 1;
+                      while (1) {
+                        if ((b | 0) >= (n | 0)) break;
+                        a = c[(t + (b << 2)) >> 2] | 0;
+                        if ((k | 0) != (a | 0) ? (c[(l + (a << 2)) >> 2] | 0) == (a | 0) : 0) {
+                          j =
+                            +h[(r + (b << 3)) >> 3] /
+                            (+(((c[(s + ((a + 1) << 2)) >> 2] | 0) - (c[(s + (a << 2)) >> 2] | 0)) | 0) * o);
+                          if ((g | 0) == 0 ? !(j > i) : 0) g = 0;
+                          else {
+                            g = 0;
+                            f = a;
+                            i = j;
+                          }
+                        }
+                        b = (b + 1) | 0;
+                      }
+                      if (!g) {
+                        c[(l + (f << 2)) >> 2] = k;
+                        c[m >> 2] = f;
+                        c[e >> 2] = (c[e >> 2] | 0) + -1;
+                      }
+                    }
+                    p = (p + 1) | 0;
+                  }
+                  U1(q);
+                }
+              while (0);
+              return;
+            }
+            function qx(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0;
+              m = c[(a + 20) >> 2] | 0;
+              n = c[(a + 24) >> 2] | 0;
+              l = c[a >> 2] | 0;
+              j = KK(l << 2) | 0;
+              c[d >> 2] = j;
+              a = 0;
+              while (1) {
+                if ((a | 0) >= (l | 0)) break;
+                c[(j + (a << 2)) >> 2] = -100;
+                a = (a + 1) | 0;
+              }
+              c[e >> 2] = 0;
+              c[f >> 2] = 0;
+              a: do
+                if (!b) {
+                  b = 0;
+                  b: while (1) {
+                    if ((b | 0) >= (l | 0)) break a;
+                    if ((c[(j + (b << 2)) >> 2] | 0) != -100) {
+                      b = (b + 1) | 0;
+                      continue;
+                    }
+                    g = c[e >> 2] | 0;
+                    c[e >> 2] = g + 1;
+                    c[(j + (b << 2)) >> 2] = g;
+                    g = (b + 1) | 0;
+                    h = (m + (g << 2)) | 0;
+                    a = c[(m + (b << 2)) >> 2] | 0;
+                    while (1) {
+                      if ((a | 0) >= (c[h >> 2] | 0)) {
+                        b = g;
+                        continue b;
+                      }
+                      i = c[(n + (a << 2)) >> 2] | 0;
+                      if ((b | 0) != (i | 0)) {
+                        c[(j + (i << 2)) >> 2] = -1;
+                        c[f >> 2] = (c[f >> 2] | 0) + 1;
+                      }
+                      a = (a + 1) | 0;
+                    }
+                  }
+                } else {
+                  i = Uw(l) | 0;
+                  h = 0;
+                  while (1) {
+                    if ((h | 0) >= (l | 0)) break;
+                    j = c[(i + (h << 2)) >> 2] | 0;
+                    k = c[d >> 2] | 0;
+                    a = (k + (j << 2)) | 0;
+                    c: do
+                      if ((c[a >> 2] | 0) == -100) {
+                        b = c[e >> 2] | 0;
+                        c[e >> 2] = b + 1;
+                        c[a >> 2] = b;
+                        b = (m + ((j + 1) << 2)) | 0;
+                        a = c[(m + (j << 2)) >> 2] | 0;
+                        while (1) {
+                          if ((a | 0) >= (c[b >> 2] | 0)) break c;
+                          g = c[(n + (a << 2)) >> 2] | 0;
+                          if ((j | 0) != (g | 0)) {
+                            c[(k + (g << 2)) >> 2] = -1;
+                            c[f >> 2] = (c[f >> 2] | 0) + 1;
+                          }
+                          a = (a + 1) | 0;
+                        }
+                      }
+                    while (0);
+                    h = (h + 1) | 0;
+                  }
+                  U1(i);
+                }
+              while (0);
+              c[f >> 2] = (c[f >> 2] | 0) + (c[e >> 2] | 0);
+              return;
+            }
+            function rx(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              q = l;
+              l = (l + 16) | 0;
+              n = (q + 4) | 0;
+              o = q;
+              p = c[(a + 20) >> 2] | 0;
+              m = c[(a + 24) >> 2] | 0;
+              h = c[a >> 2] | 0;
+              a = KK(h << 2) | 0;
+              c[d >> 2] = a;
+              g = 0;
+              while (1) {
+                c[n >> 2] = g;
+                if ((g | 0) >= (h | 0)) break;
+                c[(a + (g << 2)) >> 2] = -100;
+                g = ((c[n >> 2] | 0) + 1) | 0;
+              }
+              c[e >> 2] = 0;
+              c[f >> 2] = 0;
+              k = xx(h, ((h << 1) + -2) | 0) | 0;
+              a: do
+                if (!b) {
+                  a = 0;
+                  while (1) {
+                    c[n >> 2] = a;
+                    if ((a | 0) >= (h | 0)) break a;
+                    j = (a + 1) | 0;
+                    zx(k, a, ((c[(p + (j << 2)) >> 2] | 0) - (c[(p + (a << 2)) >> 2] | 0)) | 0) | 0;
+                    a = j;
+                  }
+                } else {
+                  g = Uw(h) | 0;
+                  a = 0;
+                  while (1) {
+                    if ((a | 0) >= (h | 0)) break;
+                    j = c[(g + (a << 2)) >> 2] | 0;
+                    c[n >> 2] = j;
+                    zx(k, j, ((c[(p + ((j + 1) << 2)) >> 2] | 0) - (c[(p + (j << 2)) >> 2] | 0)) | 0) | 0;
+                    a = (a + 1) | 0;
+                  }
+                  U1(g);
+                }
+              while (0);
+              b: while (1) {
+                j = (Ax(k, n, o) | 0) == 0;
+                a = c[e >> 2] | 0;
+                if (j) break;
+                c[e >> 2] = a + 1;
+                c[((c[d >> 2] | 0) + (c[n >> 2] << 2)) >> 2] = a;
+                a = c[n >> 2] | 0;
+                j = c[(p + (a << 2)) >> 2] | 0;
+                while (1) {
+                  if ((j | 0) >= (c[(p + ((a + 1) << 2)) >> 2] | 0)) continue b;
+                  i = c[(m + (j << 2)) >> 2] | 0;
+                  if ((a | 0) != (i | 0)) {
+                    c: do
+                      if ((c[((c[d >> 2] | 0) + (i << 2)) >> 2] | 0) == -100) {
+                        Cx(k, i) | 0;
+                        c[((c[d >> 2] | 0) + (i << 2)) >> 2] = -1;
+                        g = (p + ((i + 1) << 2)) | 0;
+                        a = c[(p + (i << 2)) >> 2] | 0;
+                        while (1) {
+                          if ((a | 0) >= (c[g >> 2] | 0)) break c;
+                          b = (m + (a << 2)) | 0;
+                          h = c[b >> 2] | 0;
+                          if ((i | 0) != (h | 0) ? (c[((c[d >> 2] | 0) + (h << 2)) >> 2] | 0) == -100 : 0) {
+                            h = Bx(k, h) | 0;
+                            c[o >> 2] = h;
+                            zx(k, c[b >> 2] | 0, (h + 1) | 0) | 0;
+                          }
+                          a = (a + 1) | 0;
+                        }
+                      }
+                    while (0);
+                    c[f >> 2] = (c[f >> 2] | 0) + 1;
+                    a = c[n >> 2] | 0;
+                  }
+                  j = (j + 1) | 0;
+                }
+              }
+              c[f >> 2] = (c[f >> 2] | 0) + a;
+              yx(k);
+              l = q;
+              return;
+            }
+            function sx(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0,
+                d = 0.0;
+              d = +h[(a + 8) >> 3];
+              c = +h[(b + 8) >> 3];
+              return (d > c ? -1 : (d < c) & 1) | 0;
+            }
+            function tx(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0;
+              if ((ww(a, 0) | 0) != 0 ? (c[(a + 16) >> 2] | 0) == 1 : 0) f = a;
+              else f = Qw(a) | 0;
+              do
+                if (!b) b = 0;
+                else {
+                  if (ww(b, 0) | 0 ? (c[(b + 16) >> 2] | 0) == 1 : 0) break;
+                  b = Aw(b, 0) | 0;
+                }
+              while (0);
+              d = ux(f, b, d) | 0;
+              b = vx(d, e) | 0;
+              if ((f | 0) != (a | 0)) c[(d + 36) >> 2] = 1;
+              return b | 0;
+            }
+            function ux(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              if (!a) a = 0;
+              else {
+                e = KK(44) | 0;
+                c[e >> 2] = 0;
+                c[(e + 4) >> 2] = c[(a + 4) >> 2];
+                c[(e + 8) >> 2] = a;
+                c[(e + 12) >> 2] = b;
+                c[(e + 16) >> 2] = 0;
+                c[(e + 20) >> 2] = 0;
+                c[(e + 24) >> 2] = d;
+                c[(e + 28) >> 2] = 0;
+                c[(e + 32) >> 2] = 0;
+                c[(e + 36) >> 2] = 0;
+                a = e;
+              }
+              return a | 0;
+            }
+            function vx(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 32) | 0;
+              e = (k + 20) | 0;
+              f = (k + 16) | 0;
+              g = (k + 12) | 0;
+              h = (k + 8) | 0;
+              i = (k + 4) | 0;
+              j = k;
+              c[f >> 2] = 0;
+              if (
+                (c[a >> 2] | 0) < (((c[(b + 16) >> 2] | 0) + -1) | 0)
+                  ? (ix(c[(a + 8) >> 2] | 0, i, c[(a + 12) >> 2] | 0, j, 0, f, g, h, b, e), (d = c[i >> 2] | 0), d | 0)
+                  : 0
+              ) {
+                i = c[j >> 2] | 0;
+                j = ux(d, i, c[f >> 2] | 0) | 0;
+                c[(a + 28) >> 2] = j;
+                c[(j + 40) >> 2] = c[e >> 2];
+                c[j >> 2] = (c[a >> 2] | 0) + 1;
+                c[(j + 4) >> 2] = c[d >> 2];
+                c[(j + 8) >> 2] = d;
+                c[(j + 12) >> 2] = i;
+                c[(j + 16) >> 2] = c[g >> 2];
+                c[(a + 20) >> 2] = c[h >> 2];
+                c[(j + 32) >> 2] = a;
+                vx(j, b) | 0;
+              }
+              l = k;
+              return a | 0;
+            }
+            function wx(a) {
+              a = a | 0;
+              var b = 0;
+              while (1) {
+                b = c[(a + 28) >> 2] | 0;
+                if (!b) break;
+                else a = b;
+              }
+              return a | 0;
+            }
+            function xx(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              f = KK(28) | 0;
+              c[f >> 2] = 0;
+              c[(f + 4) >> 2] = a;
+              c[(f + 8) >> 2] = b;
+              c[(f + 12) >> 2] = -1;
+              e = (f + 16) | 0;
+              c[e >> 2] = KK(((b << 2) + 4) | 0) | 0;
+              d = 0;
+              while (1) {
+                if ((d | 0) > (b | 0)) break;
+                c[((c[e >> 2] | 0) + (d << 2)) >> 2] = 0;
+                d = (d + 1) | 0;
+              }
+              b = ((a << 2) + 4) | 0;
+              e = (f + 20) | 0;
+              c[e >> 2] = KK(b) | 0;
+              d = 0;
+              while (1) {
+                if ((d | 0) > (a | 0)) break;
+                c[((c[e >> 2] | 0) + (d << 2)) >> 2] = 0;
+                d = (d + 1) | 0;
+              }
+              b = KK(b) | 0;
+              c[(f + 24) >> 2] = b;
+              d = 0;
+              while (1) {
+                if ((d | 0) > (a | 0)) break;
+                c[(b + (d << 2)) >> 2] = -999;
+                d = (d + 1) | 0;
+              }
+              return f | 0;
+            }
+            function yx(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              if (a | 0) {
+                e = (a + 16) | 0;
+                b = c[e >> 2] | 0;
+                if (b | 0) {
+                  f = (a + 8) | 0;
+                  d = 0;
+                  while (1) {
+                    if ((d | 0) > (c[f >> 2] | 0)) break;
+                    Cy(c[(b + (d << 2)) >> 2] | 0, 105);
+                    d = (d + 1) | 0;
+                    b = c[e >> 2] | 0;
+                  }
+                  U1(b);
+                }
+                b = c[(a + 20) >> 2] | 0;
+                if (b | 0) U1(b);
+                U1(c[(a + 24) >> 2] | 0);
+                U1(a);
+              }
+              return;
+            }
+            function zx(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              g = (a + 8) | 0;
+              j = (a + 20) | 0;
+              i = (a + 24) | 0;
+              k = (a + 16) | 0;
+              if (!a) qa(138953, 95743, 69, 95759);
+              while (1) {
+                if ((c[g >> 2] | 0) < (d | 0)) {
+                  h = 4;
+                  break;
+                }
+                e = ((c[j >> 2] | 0) + (b << 2)) | 0;
+                f = c[e >> 2] | 0;
+                if (!f) break;
+                l = c[((c[i >> 2] | 0) + (b << 2)) >> 2] | 0;
+                c[e >> 2] = 0;
+                c[a >> 2] = (c[a >> 2] | 0) + -1;
+                Fy(f, 105, ((c[k >> 2] | 0) + (l << 2)) | 0);
+              }
+              if ((h | 0) == 4) qa(95778, 95743, 70, 95759);
+              c[a >> 2] = (c[a >> 2] | 0) + 1;
+              e = (a + 12) | 0;
+              if ((c[e >> 2] | 0) < (d | 0)) c[e >> 2] = d;
+              c[((c[i >> 2] | 0) + (b << 2)) >> 2] = d;
+              e = KK(4) | 0;
+              c[e >> 2] = b;
+              f = c[((c[k >> 2] | 0) + (d << 2)) >> 2] | 0;
+              if (!f) e = By(e) | 0;
+              else e = Dy(f, e) | 0;
+              c[((c[j >> 2] | 0) + (b << 2)) >> 2] = e;
+              c[((c[k >> 2] | 0) + (d << 2)) >> 2] = e;
+              return a | 0;
+            }
+            function Ax(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              if ((a | 0) != 0 ? (c[a >> 2] | 0) >= 1 : 0) {
+                f = (a + 12) | 0;
+                e = c[f >> 2] | 0;
+                c[d >> 2] = e;
+                c[a >> 2] = (c[a >> 2] | 0) + -1;
+                d = (a + 16) | 0;
+                g = c[((c[d >> 2] | 0) + (e << 2)) >> 2] | 0;
+                c[b >> 2] = c[(Ey(g) | 0) >> 2];
+                Fy(g, 105, ((c[d >> 2] | 0) + (e << 2)) | 0);
+                d = c[d >> 2] | 0;
+                if (!(c[(d + (e << 2)) >> 2] | 0)) {
+                  while (1) {
+                    if ((e | 0) <= -1) break;
+                    if (c[(d + (e << 2)) >> 2] | 0) break;
+                    e = (e + -1) | 0;
+                  }
+                  c[f >> 2] = e;
+                }
+                e = c[b >> 2] | 0;
+                c[((c[(a + 20) >> 2] | 0) + (e << 2)) >> 2] = 0;
+                c[((c[(a + 24) >> 2] | 0) + (e << 2)) >> 2] = -999;
+                e = 1;
+              } else e = 0;
+              return e | 0;
+            }
+            function Bx(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return c[((c[(a + 24) >> 2] | 0) + (b << 2)) >> 2] | 0;
+            }
+            function Cx(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              if ((a | 0) != 0 ? ((e = c[a >> 2] | 0), (e | 0) >= 1) : 0) {
+                h = (a + 24) | 0;
+                d = c[((c[h >> 2] | 0) + (b << 2)) >> 2] | 0;
+                c[a >> 2] = e + -1;
+                f = (a + 20) | 0;
+                e = (a + 16) | 0;
+                Fy(c[((c[f >> 2] | 0) + (b << 2)) >> 2] | 0, 105, ((c[e >> 2] | 0) + (d << 2)) | 0);
+                a = (a + 12) | 0;
+                if ((d | 0) == (c[a >> 2] | 0) ? ((g = c[e >> 2] | 0), (c[(g + (d << 2)) >> 2] | 0) == 0) : 0) {
+                  while (1) {
+                    if ((d | 0) <= -1) break;
+                    if (c[(g + (d << 2)) >> 2] | 0) break;
+                    d = (d + -1) | 0;
+                  }
+                  c[a >> 2] = d;
+                }
+                c[((c[f >> 2] | 0) + (b << 2)) >> 2] = 0;
+                c[((c[h >> 2] | 0) + (b << 2)) >> 2] = -999;
+                d = 1;
+              } else d = 0;
+              return d | 0;
+            }
+            function Dx(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0.0,
+                l = 0.0,
+                m = 0,
+                n = 0.0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0;
+              if (!(ww(a, 0) | 0)) qa(95795, 95831, 260, 95846);
+              w = xw(a) | 0;
+              x = c[(w + 20) >> 2] | 0;
+              y = c[(w + 24) >> 2] | 0;
+              e = (w + 16) | 0;
+              a = (w + 28) | 0;
+              if ((c[e >> 2] | 0) == 1) v = c[a >> 2] | 0;
+              else {
+                U1(c[a >> 2] | 0);
+                c[e >> 2] = 1;
+                v = KK(c[(w + 8) >> 2] << 3) | 0;
+                c[a >> 2] = v;
+              }
+              r = KK(c[w >> 2] << 2) | 0;
+              a = 0;
+              while (1) {
+                e = c[w >> 2] | 0;
+                if ((a | 0) >= (e | 0)) {
+                  q = 0;
+                  a = e;
+                  break;
+                }
+                c[(r + (a << 2)) >> 2] = -1;
+                a = (a + 1) | 0;
+              }
+              a: while (1) {
+                if ((q | 0) >= (a | 0)) {
+                  g = 0.0;
+                  k = 0.0;
+                  f = 0;
+                  u = 0;
+                  t = a;
+                  break;
+                }
+                p = (q + 1) | 0;
+                i = (x + (p << 2)) | 0;
+                m = (x + (q << 2)) | 0;
+                j = ((c[i >> 2] | 0) - (c[m >> 2] | 0)) | 0;
+                c[(r + (q << 2)) >> 2] = q;
+                e = c[m >> 2] | 0;
+                while (1) {
+                  o = c[i >> 2] | 0;
+                  if ((e | 0) >= (o | 0)) break;
+                  a = c[(y + (e << 2)) >> 2] | 0;
+                  if ((q | 0) != (a | 0)) c[(r + (a << 2)) >> 2] = q;
+                  e = (e + 1) | 0;
+                }
+                n = +(j | 0);
+                e = c[m >> 2] | 0;
+                while (1) {
+                  if ((e | 0) >= (o | 0)) break;
+                  a = c[(y + (e << 2)) >> 2] | 0;
+                  if ((q | 0) != (a | 0)) {
+                    i = c[(x + ((a + 1) << 2)) >> 2] | 0;
+                    a = c[(x + (a << 2)) >> 2] | 0;
+                    l = +((i - a) | 0) + n;
+                    while (1) {
+                      if ((a | 0) >= (i | 0)) break;
+                      l = (c[(r + (c[(y + (a << 2)) >> 2] << 2)) >> 2] | 0) == (q | 0) ? l + -1.0 : l;
+                      a = (a + 1) | 0;
+                    }
+                    h[(v + (e << 3)) >> 3] = l;
+                    if (!(l > 0.0)) {
+                      s = 23;
+                      break a;
+                    }
+                  }
+                  e = (e + 1) | 0;
+                }
+                q = p;
+                a = c[w >> 2] | 0;
+              }
+              if ((s | 0) == 23) qa(95868, 95831, 290, 95846);
+              while (1) {
+                if ((u | 0) >= (t | 0)) break;
+                i = (u + 1) | 0;
+                j = (x + (i << 2)) | 0;
+                e = c[(x + (u << 2)) >> 2] | 0;
+                while (1) {
+                  if ((e | 0) >= (c[j >> 2] | 0)) break;
+                  a = c[(y + (e << 2)) >> 2] | 0;
+                  if ((u | 0) == (a | 0)) a = f;
+                  else {
+                    k = +_w(d, b, u, a) + k;
+                    g = +h[(v + (e << 3)) >> 3] + g;
+                    a = (f + 1) | 0;
+                  }
+                  f = a;
+                  e = (e + 1) | 0;
+                }
+                u = i;
+                t = c[w >> 2] | 0;
+              }
+              n = +(f | 0);
+              g = k / ((g / n) * n);
+              a = 0;
+              b: while (1) {
+                if ((a | 0) >= (t | 0)) break;
+                i = (a + 1) | 0;
+                j = c[(x + (i << 2)) >> 2] | 0;
+                e = c[(x + (a << 2)) >> 2] | 0;
+                while (1) {
+                  if ((e | 0) >= (j | 0)) {
+                    a = i;
+                    continue b;
+                  }
+                  f = (v + (e << 3)) | 0;
+                  if ((a | 0) != (c[(y + (e << 2)) >> 2] | 0)) h[f >> 3] = +h[f >> 3] * g;
+                  e = (e + 1) | 0;
+                }
+              }
+              return w | 0;
+            }
+            function Ex(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = +d;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0,
+                q = 0.0,
+                r = 0.0,
+                s = 0.0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                O = 0,
+                P = 0,
+                Q = 0,
+                R = 0.0,
+                S = 0.0;
+              L = c[a >> 2] | 0;
+              M = c[(a + 20) >> 2] | 0;
+              N = c[(a + 24) >> 2] | 0;
+              if (!(ww(a, 0) | 0)) qa(95795, 95831, 333, 95876);
+              O = Dx(a, b, e) | 0;
+              P = KK(56) | 0;
+              Q = (P + 32) | 0;
+              h[Q >> 3] = 1.0;
+              c[(P + 20) >> 2] = 0;
+              c[(P + 24) >> 2] = 0;
+              h[(P + 40) >> 3] = 0.01;
+              c[(P + 48) >> 2] = ~~+C(+(+(c[a >> 2] | 0)));
+              g = L << 3;
+              I = KK(g) | 0;
+              c[(P + 12) >> 2] = I;
+              a = 0;
+              while (1) {
+                if ((a | 0) >= (L | 0)) break;
+                h[(I + (a << 3)) >> 3] = d;
+                a = (a + 1) | 0;
+              }
+              J = KK(L << 2) | 0;
+              H = KK(g) | 0;
+              j = 0;
+              while (1) {
+                if ((j | 0) >= (L | 0)) {
+                  n = 0;
+                  break;
+                }
+                k = (H + (j << 3)) | 0;
+                h[k >> 3] = 0.0;
+                l = (j + 1) | 0;
+                m = (M + (l << 2)) | 0;
+                i = c[(M + (j << 2)) >> 2] | 0;
+                a = 0;
+                d = 0.0;
+                while (1) {
+                  if ((i | 0) >= (c[m >> 2] | 0)) break;
+                  g = c[(N + (i << 2)) >> 2] | 0;
+                  if ((j | 0) != (g | 0)) {
+                    d = +_w(e, b, j, g);
+                    d = +h[k >> 3] + d;
+                    h[k >> 3] = d;
+                    a = (a + 1) | 0;
+                  }
+                  i = (i + 1) | 0;
+                }
+                if ((a | 0) <= 0) {
+                  p = 14;
+                  break;
+                }
+                h[k >> 3] = d / +(a | 0);
+                j = l;
+              }
+              if ((p | 0) == 14) qa(95908, 95831, 358, 95876);
+              while (1) {
+                if ((n | 0) >= (L | 0)) {
+                  a = 0;
+                  l = 0;
+                  break;
+                }
+                c[(J + (n << 2)) >> 2] = -1;
+                n = (n + 1) | 0;
+              }
+              a: while (1) {
+                if ((l | 0) >= (L | 0)) break;
+                c[(J + (l << 2)) >> 2] = l;
+                j = (M + (l << 2)) | 0;
+                m = (l + 1) | 0;
+                n = (M + (m << 2)) | 0;
+                i = c[j >> 2] | 0;
+                while (1) {
+                  g = c[n >> 2] | 0;
+                  if ((i | 0) >= (g | 0)) break;
+                  g = (J + (c[(N + (i << 2)) >> 2] << 2)) | 0;
+                  if ((c[g >> 2] | 0) != (l | 0)) {
+                    c[g >> 2] = l;
+                    a = (a + 1) | 0;
+                  }
+                  i = (i + 1) | 0;
+                }
+                k = c[j >> 2] | 0;
+                while (1) {
+                  if ((k | 0) >= (g | 0)) {
+                    l = m;
+                    continue a;
+                  }
+                  i = c[(N + (k << 2)) >> 2] | 0;
+                  j = (M + ((i + 1) << 2)) | 0;
+                  i = c[(M + (i << 2)) >> 2] | 0;
+                  while (1) {
+                    if ((i | 0) >= (c[j >> 2] | 0)) break;
+                    g = (J + (c[(N + (i << 2)) >> 2] << 2)) | 0;
+                    if ((c[g >> 2] | 0) != (l | 0)) {
+                      c[g >> 2] = l;
+                      a = (a + 1) | 0;
+                    }
+                    i = (i + 1) | 0;
+                  }
+                  k = (k + 1) | 0;
+                  g = c[n >> 2] | 0;
+                }
+              }
+              g = (a + L) | 0;
+              F = (P + 4) | 0;
+              c[F >> 2] = rw(L, L, g, 1, 1) | 0;
+              g = rw(L, L, g, 1, 1) | 0;
+              G = (P + 8) | 0;
+              c[G >> 2] = g;
+              a = c[F >> 2] | 0;
+              do
+                if (!(((g | 0) == 0) | ((a | 0) == 0))) {
+                  B = c[(a + 20) >> 2] | 0;
+                  A = c[(a + 24) >> 2] | 0;
+                  y = c[(a + 28) >> 2] | 0;
+                  E = c[(g + 28) >> 2] | 0;
+                  z = c[(g + 20) >> 2] | 0;
+                  t = c[(g + 24) >> 2] | 0;
+                  c[z >> 2] = 0;
+                  c[B >> 2] = 0;
+                  d = 0.0;
+                  o = 0.0;
+                  p = 0;
+                  i = 0;
+                  b: while (1) {
+                    if ((p | 0) >= (L | 0)) {
+                      p = 58;
+                      break;
+                    }
+                    u = (p + L) | 0;
+                    c[(J + (p << 2)) >> 2] = u;
+                    k = (M + (p << 2)) | 0;
+                    v = (p + 1) | 0;
+                    w = (M + (v << 2)) | 0;
+                    x = (H + (p << 3)) | 0;
+                    q = 0.0;
+                    r = 0.0;
+                    j = c[k >> 2] | 0;
+                    while (1) {
+                      a = c[w >> 2] | 0;
+                      if ((j | 0) >= (a | 0)) break;
+                      g = c[(N + (j << 2)) >> 2] | 0;
+                      a = (J + (g << 2)) | 0;
+                      if ((c[a >> 2] | 0) != (u | 0)) {
+                        c[a >> 2] = u;
+                        c[(A + (i << 2)) >> 2] = g;
+                        switch (f | 0) {
+                          case 0: {
+                            s = 1.0;
+                            break;
+                          }
+                          case 1: {
+                            s = (+h[(H + (g << 3)) >> 3] + +h[x >> 3]) * 0.5;
+                            break;
+                          }
+                          case 2: {
+                            s = +D(+(+Zw(e, b, p, g)), 0.4);
+                            break;
+                          }
+                          default: {
+                            p = 42;
+                            break b;
+                          }
+                        }
+                        S = -1.0 / (s * s);
+                        h[(y + (i << 3)) >> 3] = S;
+                        c[(t + (i << 2)) >> 2] = g;
+                        R = S * s;
+                        n = (E + (i << 3)) | 0;
+                        h[n >> 3] = R;
+                        o = +_w(e, b, p, g) * R + o;
+                        R = +h[n >> 3];
+                        i = (i + 1) | 0;
+                        q = S + q;
+                        r = R + r;
+                        d = R * s + d;
+                      }
+                      j = (j + 1) | 0;
+                    }
+                    n = c[k >> 2] | 0;
+                    while (1) {
+                      if ((n | 0) >= (a | 0)) break;
+                      k = c[(N + (n << 2)) >> 2] | 0;
+                      l = (M + ((k + 1) << 2)) | 0;
+                      m = (H + (k << 3)) | 0;
+                      j = c[(M + (k << 2)) >> 2] | 0;
+                      while (1) {
+                        if ((j | 0) >= (c[l >> 2] | 0)) break;
+                        g = (N + (j << 2)) | 0;
+                        a = (J + (c[g >> 2] << 2)) | 0;
+                        if ((c[a >> 2] | 0) != (u | 0)) {
+                          c[a >> 2] = u;
+                          switch (f | 0) {
+                            case 0: {
+                              s = 2.0;
+                              break;
+                            }
+                            case 1: {
+                              s = (+h[m >> 3] * 2.0 + +h[x >> 3] + +h[(H + (c[g >> 2] << 3)) >> 3]) * 0.5;
+                              break;
+                            }
+                            case 2: {
+                              s = +D(+(+Zw(e, b, p, c[g >> 2] | 0)), 0.4);
+                              break;
+                            }
+                            default: {
+                              p = 53;
+                              break b;
+                            }
+                          }
+                          c[(A + (i << 2)) >> 2] = c[g >> 2];
+                          R = -1.0 / (s * s);
+                          h[(y + (i << 3)) >> 3] = R;
+                          c[(t + (i << 2)) >> 2] = c[g >> 2];
+                          S = R * s;
+                          a = (E + (i << 3)) | 0;
+                          h[a >> 3] = S;
+                          o = +_w(e, b, c[g >> 2] | 0, k) * S + o;
+                          S = +h[a >> 3];
+                          i = (i + 1) | 0;
+                          q = R + q;
+                          r = S + r;
+                          d = S * s + d;
+                        }
+                        j = (j + 1) | 0;
+                      }
+                      n = (n + 1) | 0;
+                      a = c[w >> 2] | 0;
+                    }
+                    c[(A + (i << 2)) >> 2] = p;
+                    x = (I + (p << 3)) | 0;
+                    S = -(q * +h[x >> 3]);
+                    h[x >> 3] = S;
+                    h[(y + (i << 3)) >> 3] = S - q;
+                    c[(t + (i << 2)) >> 2] = p;
+                    h[(E + (i << 3)) >> 3] = -r;
+                    i = (i + 1) | 0;
+                    c[(B + (v << 2)) >> 2] = i;
+                    c[(z + (v << 2)) >> 2] = i;
+                    p = v;
+                  }
+                  if ((p | 0) == 42) {
+                    U4(95915, 29, 1, c[15712] | 0) | 0;
+                    qa(138394, 95831, 418, 95876);
+                  } else if ((p | 0) == 53) {
+                    U4(95915, 29, 1, c[15712] | 0) | 0;
+                    qa(138394, 95831, 460, 95876);
+                  } else if ((p | 0) == 58) {
+                    d = o / d;
+                    a = 0;
+                    while (1) {
+                      if ((a | 0) >= (i | 0)) break;
+                      N = (E + (a << 3)) | 0;
+                      h[N >> 3] = +h[N >> 3] * d;
+                      a = (a + 1) | 0;
+                    }
+                    h[Q >> 3] = d;
+                    c[((c[F >> 2] | 0) + 8) >> 2] = i;
+                    c[((c[G >> 2] | 0) + 8) >> 2] = i;
+                    U1(J);
+                    U1(H);
+                    qw(O);
+                    K = P;
+                    break;
+                  }
+                } else {
+                  Fx(P);
+                  K = 0;
+                }
+              while (0);
+              return K | 0;
+            }
+            function Fx(a) {
+              a = a | 0;
+              var b = 0;
+              if (a | 0) {
+                b = c[(a + 4) >> 2] | 0;
+                if (b | 0) qw(b);
+                b = c[(a + 8) >> 2] | 0;
+                if (b | 0) qw(b);
+                b = c[(a + 12) >> 2] | 0;
+                if (b | 0) U1(b);
+                b = c[(a + 20) >> 2] | 0;
+                if (b | 0) tb[c[(a + 16) >> 2] & 127](b);
+                U1(a);
+              }
+              return;
+            }
+            function Gx(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = +d;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0.0,
+                k = 0,
+                l = 0.0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0.0,
+                N = 0;
+              K = c[a >> 2] | 0;
+              if (ww(a, 0) | 0 ? (c[(a + 16) >> 2] | 0) == 1 : 0) {
+                k = O(K, b) | 0;
+                j = 0.0;
+                i = 0;
+                while (1) {
+                  if ((i | 0) >= (k | 0)) break;
+                  q = +h[(e + (i << 3)) >> 3];
+                  j = q * q + j;
+                  i = (i + 1) | 0;
+                }
+                a: do
+                  if (j == 0.0) {
+                    i = 0;
+                    while (1) {
+                      if ((i | 0) >= (k | 0)) break a;
+                      h[(e + (i << 3)) >> 3] = +Sw() * 72.0;
+                      i = (i + 1) | 0;
+                    }
+                  }
+                while (0);
+                F = c[(a + 20) >> 2] | 0;
+                G = c[(a + 24) >> 2] | 0;
+                H = c[(a + 28) >> 2] | 0;
+                i = KK(56) | 0;
+                J = (i + 32) | 0;
+                h[J >> 3] = 1.0;
+                c[(i + 20) >> 2] = 0;
+                c[(i + 24) >> 2] = 0;
+                c[i >> 2] = a;
+                h[(i + 40) >> 3] = 0.01;
+                c[(i + 48) >> 2] = ~~+C(+(+(c[a >> 2] | 0)));
+                I = KK(K << 3) | 0;
+                c[(i + 12) >> 2] = I;
+                k = 0;
+                while (1) {
+                  if ((k | 0) >= (K | 0)) break;
+                  h[(I + (k << 3)) >> 3] = d;
+                  k = (k + 1) | 0;
+                }
+                a = ((c[(a + 8) >> 2] | 0) + K) | 0;
+                D = (i + 4) | 0;
+                c[D >> 2] = rw(K, K, a, 1, 1) | 0;
+                a = rw(K, K, a, 1, 1) | 0;
+                E = (i + 8) | 0;
+                c[E >> 2] = a;
+                k = c[D >> 2] | 0;
+                if (!(((a | 0) == 0) | ((k | 0) == 0))) {
+                  x = c[(k + 20) >> 2] | 0;
+                  y = c[(k + 24) >> 2] | 0;
+                  z = c[(a + 20) >> 2] | 0;
+                  A = c[(a + 24) >> 2] | 0;
+                  v = c[(k + 28) >> 2] | 0;
+                  B = c[(a + 28) >> 2] | 0;
+                  c[z >> 2] = 0;
+                  c[x >> 2] = 0;
+                  p = 0.0;
+                  q = 0.0;
+                  w = 0;
+                  s = 0;
+                  b: while (1) {
+                    if ((s | 0) >= (K | 0)) break;
+                    t = (s + 1) | 0;
+                    u = (F + (t << 2)) | 0;
+                    l = 0.0;
+                    m = 0.0;
+                    r = c[(F + (s << 2)) >> 2] | 0;
+                    o = p;
+                    d = q;
+                    a = w;
+                    while (1) {
+                      if ((r | 0) >= (c[u >> 2] | 0)) break;
+                      k = c[(G + (r << 2)) >> 2] | 0;
+                      if ((k | 0) == (s | 0)) {
+                        j = o;
+                        k = a;
+                      } else {
+                        c[(y + (a << 2)) >> 2] = k;
+                        n = +h[(H + (r << 3)) >> 3];
+                        switch (f | 0) {
+                          case 2: {
+                            j = n * n;
+                            j = j == 0.0 ? -1.0e5 : -1.0 / j;
+                            break;
+                          }
+                          case 1: {
+                            j = n * n == 0.0 ? -1.0e5 : -1.0 / n;
+                            break;
+                          }
+                          case 0: {
+                            j = -1.0;
+                            break;
+                          }
+                          default: {
+                            L = 23;
+                            break b;
+                          }
+                        }
+                        h[(v + (a << 3)) >> 3] = j;
+                        c[(A + (a << 2)) >> 2] = k;
+                        M = j * n;
+                        N = (B + (a << 3)) | 0;
+                        h[N >> 3] = M;
+                        d = +_w(e, b, s, k) * M + d;
+                        M = +h[N >> 3];
+                        l = j + l;
+                        m = M + m;
+                        j = M * n + o;
+                        k = (a + 1) | 0;
+                      }
+                      r = (r + 1) | 0;
+                      o = j;
+                      a = k;
+                    }
+                    c[(y + (a << 2)) >> 2] = s;
+                    w = (I + (s << 3)) | 0;
+                    p = -(l * +h[w >> 3]);
+                    h[w >> 3] = p;
+                    h[(v + (a << 3)) >> 3] = p - l;
+                    c[(A + (a << 2)) >> 2] = s;
+                    h[(B + (a << 3)) >> 3] = -m;
+                    w = (a + 1) | 0;
+                    c[(x + (t << 2)) >> 2] = w;
+                    c[(z + (t << 2)) >> 2] = w;
+                    p = o;
+                    q = d;
+                    s = t;
+                  }
+                  if ((L | 0) == 23) qa(138394, 95831, 591, 96012);
+                  j = (g | 0) == 0 ? 1.0 : q / p;
+                  if (j == 0.0) i = 0;
+                  else {
+                    k = 0;
+                    while (1) {
+                      if ((k | 0) >= (w | 0)) break;
+                      N = (B + (k << 3)) | 0;
+                      h[N >> 3] = +h[N >> 3] * j;
+                      k = (k + 1) | 0;
+                    }
+                    h[J >> 3] = j;
+                    c[((c[D >> 2] | 0) + 8) >> 2] = w;
+                    c[((c[E >> 2] | 0) + 8) >> 2] = w;
+                  }
+                } else {
+                  Fx(i);
+                  i = 0;
+                }
+                return i | 0;
+              }
+              qa(95945, 95831, 525, 96012);
+              return 0;
+            }
+            function Hx(a) {
+              a = a | 0;
+              Fx(a);
+              return;
+            }
+            function Ix(a, b, c, d, e) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = +e;
+              return +(+Jx(a, b, c, d, e));
+            }
+            function Jx(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = +f;
+              var g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0.0,
+                q = 0,
+                r = 0.0,
+                s = 0.0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0.0,
+                B = 0.0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                P = 0,
+                Q = 0,
+                R = 0,
+                S = 0,
+                T = 0,
+                U = 0;
+              T = l;
+              l = (l + 16) | 0;
+              Q = (T + 12) | 0;
+              S = (T + 8) | 0;
+              n = (T + 4) | 0;
+              k = T;
+              m = c[(a + 4) >> 2] | 0;
+              i = c[(a + 8) >> 2] | 0;
+              c[Q >> 2] = 0;
+              c[S >> 2] = 0;
+              c[n >> 2] = 0;
+              K = c[(a + 12) >> 2] | 0;
+              c[k >> 2] = 0;
+              L = xw(i) | 0;
+              M = c[m >> 2] | 0;
+              N = O(M, b) | 0;
+              g = N << 3;
+              R = KK(g) | 0;
+              if (
+                (R | 0) != 0
+                  ? ((P = O(b << 3, M) | 0),
+                    W6(R | 0, d | 0, P | 0) | 0,
+                    (J = KK(g) | 0),
+                    (c[S >> 2] = J),
+                    (J | 0) != 0)
+                  : 0
+              ) {
+                I = c[(i + 20) >> 2] | 0;
+                J = c[(i + 24) >> 2] | 0;
+                E = c[(i + 28) >> 2] | 0;
+                F = c[(L + 28) >> 2] | 0;
+                G = c[(m + 28) >> 2] | 0;
+                H = (a + 24) | 0;
+                switch (c[H >> 2] | 0) {
+                  case 1: {
+                    Kx(c[(a + 20) >> 2] | 0, M, b, d, k, n);
+                    g = c[k >> 2] | 0;
+                    if (!g) {
+                      A = 0.0;
+                      B = 0.0;
+                      g = 0;
+                    } else {
+                      m = yw(m, g) | 0;
+                      A = 0.0;
+                      B = 0.0;
+                    }
+                    break;
+                  }
+                  case 2: {
+                    g = c[(a + 20) >> 2] | 0;
+                    A = +h[(g + 8) >> 3];
+                    B = +h[g >> 3];
+                    g = 0;
+                    break;
+                  }
+                  default: {
+                    A = 0.0;
+                    B = 0.0;
+                    g = 0;
+                  }
+                }
+                y = (K | 0) == 0;
+                z = (a + 40) | 0;
+                x = (a + 48) | 0;
+                i = c[n >> 2] | 0;
+                j = 1.0;
+                k = 0;
+                a: while (1) {
+                  w = (k + 1) | 0;
+                  if (!(((k | 0) < (e | 0)) & (j > f))) break;
+                  b: do
+                    if ((c[H >> 2] | 0) == 4) {
+                      n = c[S >> 2] | 0;
+                      k = 0;
+                      while (1) {
+                        if ((k | 0) >= (M | 0)) break b;
+                        o = O(k, b) | 0;
+                        a = 0;
+                        while (1) {
+                          if ((a | 0) >= (b | 0)) break;
+                          h[(n + ((a + o) << 3)) >> 3] = 0.0;
+                          a = (a + 1) | 0;
+                        }
+                        k = (k + 1) | 0;
+                      }
+                    } else {
+                      q = 0;
+                      while (1) {
+                        if ((q | 0) >= (M | 0)) break;
+                        u = (q + 1) | 0;
+                        v = (I + (u << 2)) | 0;
+                        p = 0.0;
+                        t = c[(I + (q << 2)) >> 2] | 0;
+                        k = -1;
+                        while (1) {
+                          if ((t | 0) >= (c[v >> 2] | 0)) break;
+                          n = (J + (t << 2)) | 0;
+                          a = c[n >> 2] | 0;
+                          if ((q | 0) == (a | 0)) k = t;
+                          else {
+                            s = +_w(d, b, q, a);
+                            o = (E + (t << 3)) | 0;
+                            r = +h[o >> 3];
+                            if (r == 0.0) r = 0.0;
+                            else {
+                              if (s == 0.0) {
+                                r = (r / +h[(G + (t << 3)) >> 3]) * 0.0001;
+                                a = 0;
+                                while (1) {
+                                  if ((a | 0) >= (b | 0)) break;
+                                  s = r * (+Sw() + 0.0001);
+                                  U = (d + (((O(c[n >> 2] | 0, b) | 0) + a) << 3)) | 0;
+                                  h[U >> 3] = s + +h[U >> 3];
+                                  a = (a + 1) | 0;
+                                }
+                                s = +_w(d, b, q, c[n >> 2] | 0);
+                                r = +h[o >> 3];
+                              }
+                              r = r / s;
+                            }
+                            h[(F + (t << 3)) >> 3] = r;
+                            p = r + p;
+                          }
+                          t = (t + 1) | 0;
+                        }
+                        if ((k | 0) <= -1) {
+                          D = 25;
+                          break a;
+                        }
+                        h[(F + (k << 3)) >> 3] = -p;
+                        q = u;
+                      }
+                      Gw(L, 0, d, 0, S, 0, b);
+                    }
+                  while (0);
+                  c: do
+                    if (!y) {
+                      n = c[S >> 2] | 0;
+                      k = 0;
+                      while (1) {
+                        if ((k | 0) >= (M | 0)) break c;
+                        o = (K + (k << 3)) | 0;
+                        q = O(k, b) | 0;
+                        a = 0;
+                        while (1) {
+                          if ((a | 0) >= (b | 0)) break;
+                          v = (a + q) | 0;
+                          U = (n + (v << 3)) | 0;
+                          h[U >> 3] = +h[U >> 3] + +h[(R + (v << 3)) >> 3] * +h[o >> 3];
+                          a = (a + 1) | 0;
+                        }
+                        k = (k + 1) | 0;
+                      }
+                    }
+                  while (0);
+                  d: do
+                    switch (c[H >> 2] | 0) {
+                      case 1: {
+                        k = c[S >> 2] | 0;
+                        a = 0;
+                        while (1) {
+                          if ((a | 0) >= (M | 0)) {
+                            D = 50;
+                            break d;
+                          }
+                          o = O(a, b) | 0;
+                          n = 0;
+                          while (1) {
+                            if ((n | 0) >= (b | 0)) break;
+                            D = (n + o) | 0;
+                            U = (k + (D << 3)) | 0;
+                            h[U >> 3] = +h[U >> 3] + +h[(i + (D << 3)) >> 3];
+                            n = (n + 1) | 0;
+                          }
+                          a = (a + 1) | 0;
+                        }
+                      }
+                      case 2: {
+                        Lx(M, b, d, c[S >> 2] | 0, B, A);
+                        k = c[S >> 2] | 0;
+                        p = +h[z >> 3];
+                        a = c[x >> 2] | 0;
+                        if ((c[H >> 2] | 0) == 2) Mx(m, B, b, d, k, p, a, Q);
+                        else D = 51;
+                        break;
+                      }
+                      default: {
+                        k = c[S >> 2] | 0;
+                        D = 50;
+                      }
+                    }
+                  while (0);
+                  if ((D | 0) == 50) {
+                    p = +h[z >> 3];
+                    a = c[x >> 2] | 0;
+                    D = 51;
+                  }
+                  if ((D | 0) == 51) {
+                    D = 0;
+                    +fy(m, b, d, k, p, a, 0, Q);
+                  }
+                  if (c[Q >> 2] | 0) break;
+                  j = +Nx(M, b, d, c[S >> 2] | 0);
+                  j = j / +C(+(+Ww(N, d, d)));
+                  W6(d | 0, c[S >> 2] | 0, P | 0) | 0;
+                  k = w;
+                }
+                if ((D | 0) == 25) qa(96049, 95831, 895, 96060);
+                qw(L);
+                if (g) {
+                  qw(g);
+                  qw(m);
+                }
+              } else {
+                qw(L);
+                j = 1.0;
+                i = 0;
+              }
+              U1(R);
+              g = c[S >> 2] | 0;
+              if (g | 0) U1(g);
+              if (i | 0) U1(i);
+              l = T;
+              return +j;
+            }
+            function Kx(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0.0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0.0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0.0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0.0;
+              p = c[(a + 8) >> 2] | 0;
+              A = c[(a + 12) >> 2] | 0;
+              x = c[(a + 16) >> 2] | 0;
+              z = c[(a + 32) >> 2] | 0;
+              y = c[(z + 20) >> 2] | 0;
+              z = c[(z + 24) >> 2] | 0;
+              l = (a + 20) | 0;
+              r = c[l >> 2] | 0;
+              m = (a + 24) | 0;
+              q = c[m >> 2] | 0;
+              n = (a + 28) | 0;
+              o = c[n >> 2] | 0;
+              w = +h[a >> 3];
+              a: do
+                if ((p | 2 | 0) == 3) {
+                  if (!r) {
+                    if (((q | 0) != 0) | ((o | 0) != 0)) qa(96094, 95831, 692, 96111);
+                    else {
+                      i = 0;
+                      j = 0;
+                    }
+                    while (1) {
+                      if ((i | 0) >= (A | 0)) break;
+                      v = c[(x + (i << 2)) >> 2] | 0;
+                      s = +(((c[(y + ((v + 1) << 2)) >> 2] | 0) - (c[(y + (v << 2)) >> 2] | 0)) | 0) + 1.0;
+                      i = (i + 1) | 0;
+                      j = (j + ~~(s * s)) | 0;
+                    }
+                    q = j << 2;
+                    r = KK(q) | 0;
+                    c[l >> 2] = r;
+                    q = KK(q) | 0;
+                    c[m >> 2] = q;
+                    o = KK(j << 3) | 0;
+                    c[n >> 2] = o;
+                  }
+                  u = 0;
+                  a = 0;
+                  while (1) {
+                    if ((u | 0) >= (A | 0)) break;
+                    p = c[(x + (u << 2)) >> 2] | 0;
+                    t = (y + (p << 2)) | 0;
+                    j = c[t >> 2] | 0;
+                    i = c[(z + (j << 2)) >> 2] | 0;
+                    j = c[(z + ((j + 1) << 2)) >> 2] | 0;
+                    b: do
+                      if ((i | 0) != (j | 0)) {
+                        B = +Zw(e, d, i, j);
+                        B = B * B;
+                        n = (y + ((p + 1) << 2)) | 0;
+                        s = +(((c[n >> 2] | 0) - (c[t >> 2] | 0)) | 0);
+                        c[(r + (a << 2)) >> 2] = p;
+                        c[(q + (a << 2)) >> 2] = p;
+                        h[(o + (a << 3)) >> 3] = w / B;
+                        k = s * s * B;
+                        s = -(w / (B * s));
+                        j = c[t >> 2] | 0;
+                        while (1) {
+                          a = (a + 1) | 0;
+                          i = c[n >> 2] | 0;
+                          if ((j | 0) >= (i | 0)) break;
+                          c[(r + (a << 2)) >> 2] = p;
+                          c[(q + (a << 2)) >> 2] = c[(z + (j << 2)) >> 2];
+                          h[(o + (a << 3)) >> 3] = s;
+                          j = (j + 1) | 0;
+                        }
+                        k = w / k;
+                        m = c[t >> 2] | 0;
+                        while (1) {
+                          if ((m | 0) >= (i | 0)) break b;
+                          l = c[(z + (m << 2)) >> 2] | 0;
+                          c[(r + (a << 2)) >> 2] = l;
+                          c[(q + (a << 2)) >> 2] = p;
+                          h[(o + (a << 3)) >> 3] = s;
+                          j = c[t >> 2] | 0;
+                          while (1) {
+                            a = (a + 1) | 0;
+                            i = c[n >> 2] | 0;
+                            if ((j | 0) >= (i | 0)) break;
+                            v = c[(z + (j << 2)) >> 2] | 0;
+                            c[(r + (a << 2)) >> 2] = l;
+                            c[(q + (a << 2)) >> 2] = v;
+                            h[(o + (a << 3)) >> 3] = k;
+                            j = (j + 1) | 0;
+                          }
+                          m = (m + 1) | 0;
+                        }
+                      }
+                    while (0);
+                    u = (u + 1) | 0;
+                  }
+                  i = Dw(a, b, b, r, q, o, 1, 8) | 0;
+                  a = 0;
+                } else {
+                  switch (p | 0) {
+                    case 2:
+                    case 4:
+                      break;
+                    default: {
+                      i = 0;
+                      a = 0;
+                      break a;
+                    }
+                  }
+                  do
+                    if (!r)
+                      if (((q | 0) != 0) | ((o | 0) != 0)) qa(96094, 95831, 734, 96111);
+                      else {
+                        u = A << 2;
+                        v = KK(u) | 0;
+                        c[l >> 2] = v;
+                        u = KK(u) | 0;
+                        c[m >> 2] = u;
+                        t = KK(A << 3) | 0;
+                        c[n >> 2] = t;
+                        break;
+                      }
+                    else {
+                      t = o;
+                      u = q;
+                      v = r;
+                    }
+                  while (0);
+                  a = KK(O(b << 3, d) | 0) | 0;
+                  j = O(d, b) | 0;
+                  i = 0;
+                  while (1) {
+                    if ((i | 0) >= (j | 0)) {
+                      o = 0;
+                      break;
+                    }
+                    h[(a + (i << 3)) >> 3] = 0.0;
+                    i = (i + 1) | 0;
+                  }
+                  while (1) {
+                    if ((o | 0) >= (A | 0)) break;
+                    p = c[(x + (o << 2)) >> 2] | 0;
+                    l = (y + (p << 2)) | 0;
+                    m = c[l >> 2] | 0;
+                    k = +Zw(e, d, c[(z + (m << 2)) >> 2] | 0, c[(z + ((m + 1) << 2)) >> 2] | 0);
+                    c[(v + (o << 2)) >> 2] = p;
+                    c[(u + (o << 2)) >> 2] = p;
+                    k = w / k;
+                    h[(t + (o << 3)) >> 3] = k;
+                    l = c[l >> 2] | 0;
+                    m = c[(y + ((p + 1) << 2)) >> 2] | 0;
+                    p = O(p, d) | 0;
+                    j = l;
+                    while (1) {
+                      if ((j | 0) >= (m | 0)) break;
+                      n = O(c[(z + (j << 2)) >> 2] | 0, d) | 0;
+                      i = 0;
+                      while (1) {
+                        if ((i | 0) >= (d | 0)) break;
+                        r = (a + ((i + p) << 3)) | 0;
+                        h[r >> 3] = +h[r >> 3] + +h[(e + ((i + n) << 3)) >> 3];
+                        i = (i + 1) | 0;
+                      }
+                      j = (j + 1) | 0;
+                    }
+                    k = k * (1.0 / +((m - l) | 0));
+                    i = 0;
+                    while (1) {
+                      if ((i | 0) >= (d | 0)) break;
+                      r = (a + ((i + p) << 3)) | 0;
+                      h[r >> 3] = k * +h[r >> 3];
+                      i = (i + 1) | 0;
+                    }
+                    o = (o + 1) | 0;
+                  }
+                  i = Dw(o, b, b, v, u, t, 1, 8) | 0;
+                }
+              while (0);
+              c[f >> 2] = i;
+              c[g >> 2] = a;
+              return;
+            }
+            function Lx(a, b, c, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = +e;
+              f = +f;
+              var g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0;
+              f = f * e;
+              g = 0;
+              a: while (1) {
+                if ((g | 0) >= (a | 0)) break;
+                l = (g + 1) | 0;
+                m = O(g, b) | 0;
+                i = l;
+                while (1) {
+                  if ((i | 0) == (a | 0)) {
+                    g = l;
+                    continue a;
+                  }
+                  k = O(i, b) | 0;
+                  e = 1.0 / +Zw(c, b, g, i);
+                  j = 0;
+                  while (1) {
+                    if ((j | 0) >= (b | 0)) break;
+                    p = (j + m) | 0;
+                    n = (j + k) | 0;
+                    o = f * ((+h[(c + (p << 3)) >> 3] - +h[(c + (n << 3)) >> 3]) * e);
+                    p = (d + (p << 3)) | 0;
+                    h[p >> 3] = o + +h[p >> 3];
+                    n = (d + (n << 3)) | 0;
+                    h[n >> 3] = +h[n >> 3] - o;
+                    j = (j + 1) | 0;
+                  }
+                  i = (i + 1) | 0;
+                }
+              }
+              return;
+            }
+            function Mx(a, b, d, e, f, g, h, i) {
+              a = a | 0;
+              b = +b;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = +g;
+              h = h | 0;
+              i = i | 0;
+              var j = 0,
+                k = 0;
+              k = Wx(a, b) | 0;
+              j = $x(a, b) | 0;
+              +cy(k, j, c[a >> 2] | 0, d, e, f, g, h, i);
+              return;
+            }
+            function Nx(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0.0,
+                l = 0;
+              f = 0;
+              i = 0.0;
+              while (1) {
+                if ((f | 0) >= (a | 0)) break;
+                j = O(f, b) | 0;
+                e = 0;
+                g = 0.0;
+                while (1) {
+                  if ((e | 0) >= (b | 0)) break;
+                  l = (e + j) | 0;
+                  k = +h[(d + (l << 3)) >> 3] - +h[(c + (l << 3)) >> 3];
+                  e = (e + 1) | 0;
+                  g = k * k + g;
+                }
+                f = (f + 1) | 0;
+                i = +C(+g) + i;
+              }
+              return +i;
+            }
+            function Ox(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = +d;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0,
+                k = 0.0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0.0,
+                t = 0.0,
+                u = 0.0,
+                v = 0.0,
+                w = 0.0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                E = 0.0,
+                F = 0.0;
+              A = c[a >> 2] | 0;
+              p = c[(a + 20) >> 2] | 0;
+              q = c[(a + 24) >> 2] | 0;
+              if (!(ww(a, 0) | 0)) qa(95795, 95831, 1034, 96133);
+              r = A << 3;
+              B = KK(r) | 0;
+              j = 0;
+              while (1) {
+                if ((j | 0) >= (A | 0)) break;
+                m = (B + (j << 3)) | 0;
+                h[m >> 3] = 0.0;
+                n = (j + 1) | 0;
+                o = (p + (n << 2)) | 0;
+                l = c[(p + (j << 2)) >> 2] | 0;
+                g = 0;
+                k = 0.0;
+                while (1) {
+                  if ((l | 0) >= (c[o >> 2] | 0)) break;
+                  i = c[(q + (l << 2)) >> 2] | 0;
+                  if ((j | 0) != (i | 0)) {
+                    k = +_w(e, b, j, i);
+                    k = +h[m >> 3] + k;
+                    h[m >> 3] = k;
+                    g = (g + 1) | 0;
+                  }
+                  l = (l + 1) | 0;
+                }
+                if ((g | 0) <= 0) {
+                  z = 11;
+                  break;
+                }
+                h[m >> 3] = k / +(g | 0);
+                j = n;
+              }
+              if ((z | 0) == 11) qa(95908, 95831, 1046, 96133);
+              g = KK(56) | 0;
+              y = (g + 32) | 0;
+              h[y >> 3] = 1.0;
+              c[(g + 20) >> 2] = 0;
+              c[(g + 24) >> 2] = 0;
+              h[(g + 40) >> 3] = 0.01;
+              c[(g + 48) >> 2] = ~~+C(+(+(c[a >> 2] | 0)));
+              x = KK(r) | 0;
+              c[(g + 12) >> 2] = x;
+              i = 0;
+              while (1) {
+                if ((i | 0) >= (A | 0)) break;
+                h[(x + (i << 3)) >> 3] = d;
+                i = (i + 1) | 0;
+              }
+              do
+                if ((A | 0) > 2)
+                  if (!f) {
+                    i = hy(A, b, e) | 0;
+                    break;
+                  } else {
+                    i = gy(A, b, e) | 0;
+                    break;
+                  }
+                else i = xw(a) | 0;
+              while (0);
+              f = (g + 4) | 0;
+              c[f >> 2] = yw(a, i) | 0;
+              qw(i);
+              j = xw(c[f >> 2] | 0) | 0;
+              c[(g + 8) >> 2] = j;
+              i = c[f >> 2] | 0;
+              if (((j | 0) == 0) | ((i | 0) == 0)) {
+                Px(g);
+                g = 0;
+              } else {
+                r = c[(i + 20) >> 2] | 0;
+                q = c[(i + 24) >> 2] | 0;
+                p = c[(i + 28) >> 2] | 0;
+                f = c[(j + 28) >> 2] | 0;
+                v = 0.0;
+                w = 0.0;
+                m = 0;
+                while (1) {
+                  if ((m | 0) >= (A | 0)) break;
+                  o = (m + 1) | 0;
+                  n = (r + (o << 2)) | 0;
+                  u = 0.0;
+                  d = 0.0;
+                  j = -1;
+                  s = v;
+                  t = w;
+                  l = c[(r + (m << 2)) >> 2] | 0;
+                  while (1) {
+                    if ((l | 0) >= (c[n >> 2] | 0)) break;
+                    i = c[(q + (l << 2)) >> 2] | 0;
+                    if ((i | 0) == (m | 0)) {
+                      k = u;
+                      i = l;
+                    } else {
+                      E = +D(+(+Zw(e, b, m, i)), 0.6);
+                      k = 1.0 / (E * E);
+                      h[(p + (l << 3)) >> 3] = k;
+                      F = k * E;
+                      a = (f + (l << 3)) | 0;
+                      h[a >> 3] = F;
+                      t = F * +_w(e, b, m, i) + t;
+                      F = +h[a >> 3];
+                      k = k + u;
+                      d = F + d;
+                      i = j;
+                      s = F * E + s;
+                    }
+                    u = k;
+                    j = i;
+                    l = (l + 1) | 0;
+                  }
+                  a = (x + (m << 3)) | 0;
+                  k = -(u * +h[a >> 3]);
+                  h[a >> 3] = k;
+                  if ((j | 0) <= -1) {
+                    z = 31;
+                    break;
+                  }
+                  h[(p + (j << 3)) >> 3] = k - u;
+                  h[(f + (j << 3)) >> 3] = -d;
+                  v = s;
+                  w = t;
+                  m = o;
+                }
+                if ((z | 0) == 31) qa(96154, 95831, 1112, 96133);
+                k = w / v;
+                j = c[(r + (A << 2)) >> 2] | 0;
+                i = 0;
+                while (1) {
+                  if ((i | 0) >= (j | 0)) break;
+                  A = (f + (i << 3)) | 0;
+                  h[A >> 3] = +h[A >> 3] * k;
+                  i = (i + 1) | 0;
+                }
+                h[y >> 3] = k;
+                U1(B);
+              }
+              return g | 0;
+            }
+            function Px(a) {
+              a = a | 0;
+              Fx(a);
+              return;
+            }
+            function Qx(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              +Jx(a, b, c, 50, 0.001);
+              return;
+            }
+            function Rx(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0.0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0;
+              z = c[a >> 2] | 0;
+              A = c[(a + 20) >> 2] | 0;
+              B = c[(a + 24) >> 2] | 0;
+              if (!(ww(a, 0) | 0)) qa(95795, 95831, 1149, 96165);
+              v = Dx(a, b, e) | 0;
+              w = c[(v + 28) >> 2] | 0;
+              a = KK(8) | 0;
+              x = KK(z << 2) | 0;
+              y = KK(z << 3) | 0;
+              i = 0;
+              while (1) {
+                if ((i | 0) >= (z | 0)) {
+                  o = 0;
+                  break;
+                }
+                l = (y + (i << 3)) | 0;
+                h[l >> 3] = 0.0;
+                m = (i + 1) | 0;
+                n = (A + (m << 2)) | 0;
+                j = c[(A + (i << 2)) >> 2] | 0;
+                f = 0;
+                k = 0.0;
+                while (1) {
+                  if ((j | 0) >= (c[n >> 2] | 0)) break;
+                  g = c[(B + (j << 2)) >> 2] | 0;
+                  if ((i | 0) != (g | 0)) {
+                    k = +_w(e, b, i, g);
+                    k = +h[l >> 3] + k;
+                    h[l >> 3] = k;
+                    f = (f + 1) | 0;
+                  }
+                  j = (j + 1) | 0;
+                }
+                if ((f | 0) <= 0) {
+                  p = 11;
+                  break;
+                }
+                h[l >> 3] = k / +(f | 0);
+                i = m;
+              }
+              if ((p | 0) == 11) qa(95908, 95831, 1167, 96165);
+              while (1) {
+                if ((o | 0) >= (z | 0)) {
+                  m = 0;
+                  f = 0;
+                  break;
+                }
+                c[(x + (o << 2)) >> 2] = -1;
+                o = (o + 1) | 0;
+              }
+              a: while (1) {
+                if ((m | 0) >= (z | 0)) break;
+                c[(x + (m << 2)) >> 2] = m;
+                j = (A + (m << 2)) | 0;
+                n = (m + 1) | 0;
+                o = (A + (n << 2)) | 0;
+                i = c[j >> 2] | 0;
+                while (1) {
+                  g = c[o >> 2] | 0;
+                  if ((i | 0) >= (g | 0)) break;
+                  g = (x + (c[(B + (i << 2)) >> 2] << 2)) | 0;
+                  if ((c[g >> 2] | 0) != (m | 0)) {
+                    c[g >> 2] = m;
+                    f = (f + 1) | 0;
+                  }
+                  i = (i + 1) | 0;
+                }
+                l = c[j >> 2] | 0;
+                while (1) {
+                  if ((l | 0) >= (g | 0)) {
+                    m = n;
+                    continue a;
+                  }
+                  i = c[(B + (l << 2)) >> 2] | 0;
+                  j = (A + ((i + 1) << 2)) | 0;
+                  i = c[(A + (i << 2)) >> 2] | 0;
+                  while (1) {
+                    if ((i | 0) >= (c[j >> 2] | 0)) break;
+                    g = (x + (c[(B + (i << 2)) >> 2] << 2)) | 0;
+                    if ((c[g >> 2] | 0) != (m | 0)) {
+                      c[g >> 2] = m;
+                      f = (f + 1) | 0;
+                    }
+                    i = (i + 1) | 0;
+                  }
+                  l = (l + 1) | 0;
+                  g = c[o >> 2] | 0;
+                }
+              }
+              e = rw(z, z, f, 1, 1) | 0;
+              c[a >> 2] = e;
+              if (!e) {
+                Sx(a);
+                a = 0;
+              } else {
+                p = c[(e + 20) >> 2] | 0;
+                q = c[(e + 24) >> 2] | 0;
+                r = c[(e + 28) >> 2] | 0;
+                c[p >> 2] = 0;
+                g = 0;
+                f = 0;
+                while (1) {
+                  if ((g | 0) >= (z | 0)) break;
+                  s = (g + z) | 0;
+                  c[(x + (g << 2)) >> 2] = s;
+                  l = (A + (g << 2)) | 0;
+                  t = (g + 1) | 0;
+                  u = (A + (t << 2)) | 0;
+                  b = (y + (g << 3)) | 0;
+                  j = c[l >> 2] | 0;
+                  while (1) {
+                    g = c[u >> 2] | 0;
+                    if ((j | 0) >= (g | 0)) break;
+                    g = c[(B + (j << 2)) >> 2] | 0;
+                    i = (x + (g << 2)) | 0;
+                    if ((c[i >> 2] | 0) != (s | 0)) {
+                      c[i >> 2] = s;
+                      c[(q + (f << 2)) >> 2] = g;
+                      o = (r + (f << 3)) | 0;
+                      h[o >> 3] = (+h[(y + (g << 3)) >> 3] + +h[b >> 3]) * 0.5;
+                      h[o >> 3] = +h[(w + (j << 3)) >> 3];
+                      f = (f + 1) | 0;
+                    }
+                    j = (j + 1) | 0;
+                  }
+                  o = c[l >> 2] | 0;
+                  while (1) {
+                    if ((o | 0) >= (g | 0)) break;
+                    j = c[(B + (o << 2)) >> 2] | 0;
+                    l = (A + ((j + 1) << 2)) | 0;
+                    m = (y + (j << 3)) | 0;
+                    n = (w + (o << 3)) | 0;
+                    j = c[(A + (j << 2)) >> 2] | 0;
+                    while (1) {
+                      if ((j | 0) >= (c[l >> 2] | 0)) break;
+                      g = (B + (j << 2)) | 0;
+                      i = (x + (c[g >> 2] << 2)) | 0;
+                      if ((c[i >> 2] | 0) != (s | 0)) {
+                        c[i >> 2] = s;
+                        c[(q + (f << 2)) >> 2] = c[g >> 2];
+                        i = (r + (f << 3)) | 0;
+                        h[i >> 3] = (+h[m >> 3] * 2.0 + +h[b >> 3] + +h[(y + (c[g >> 2] << 3)) >> 3]) * 0.5;
+                        h[i >> 3] = +h[(w + (j << 3)) >> 3] + +h[n >> 3];
+                        f = (f + 1) | 0;
+                      }
+                      j = (j + 1) | 0;
+                    }
+                    o = (o + 1) | 0;
+                    g = c[u >> 2] | 0;
+                  }
+                  c[(p + (t << 2)) >> 2] = f;
+                  g = t;
+                }
+                c[(e + 8) >> 2] = f;
+                A = Yp() | 0;
+                B = (a + 4) | 0;
+                c[B >> 2] = A;
+                W6(A | 0, d | 0, 168) | 0;
+                B = c[B >> 2] | 0;
+                c[(B + 16) >> 2] = 0;
+                c[(B + 40) >> 2] = 1;
+                A = (B + 96) | 0;
+                h[A >> 3] = +h[A >> 3] * 0.5;
+                c[(B + 80) >> 2] = 20;
+                U1(x);
+                U1(y);
+                qw(v);
+              }
+              return a | 0;
+            }
+            function Sx(a) {
+              a = a | 0;
+              var b = 0;
+              if (a | 0) {
+                b = c[a >> 2] | 0;
+                if (b | 0) qw(b);
+                a = c[(a + 4) >> 2] | 0;
+                if (a | 0) Zp(a);
+              }
+              return;
+            }
+            function Tx(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0;
+              g = l;
+              l = (l + 16) | 0;
+              h = g;
+              c[h >> 2] = 0;
+              sq(e, b, c[a >> 2] | 0, c[(a + 4) >> 2] | 0, d, f, h);
+              if (!(c[h >> 2] | 0)) {
+                l = g;
+                return;
+              } else qa(96184, 95831, 1262, 96190);
+            }
+            function Ux(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0;
+              c[g >> 2] = 0;
+              g = c[(d + 120) >> 2] | 0;
+              a: do
+                switch (g | 0) {
+                  case 5:
+                  case 6: {
+                    if ((c[b >> 2] | 0) > 2) {
+                      b = Ox(b, a, 0.0, f, ((g | 0) != 6) & 1) | 0;
+                      Qx(b, a, f);
+                      Px(b);
+                    }
+                    break;
+                  }
+                  case 4: {
+                    g = 0;
+                    while (1) {
+                      if ((g | 0) == 1) break a;
+                      i = Rx(b, a, d, f) | 0;
+                      Tx(i, b, e, a, f);
+                      Sx(i);
+                      g = (g + 1) | 0;
+                    }
+                  }
+                  case 1: {
+                    d = 0;
+                    h = 6;
+                    break;
+                  }
+                  case 2: {
+                    d = 1;
+                    h = 6;
+                    break;
+                  }
+                  case 3: {
+                    d = 2;
+                    h = 6;
+                    break;
+                  }
+                  default: {
+                  }
+                }
+              while (0);
+              b: do
+                if ((h | 0) == 6) {
+                  g = 0;
+                  while (1) {
+                    if ((g | 0) == 1) break b;
+                    i = Ex(b, a, 0.05, f, d) | 0;
+                    +Jx(i, a, f, 50, 0.001);
+                    Fx(i);
+                    g = (g + 1) | 0;
+                  }
+                }
+              while (0);
+              return;
+            }
+            function Vx(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0,
+                g = 0,
+                i = 0.0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 16) | 0;
+              g = k;
+              c[g >> 2] = d;
+              j = c[a >> 2] | 0;
+              a = c[(j + 8) >> 2] | 0;
+              i = +h[j >> 3];
+              j = c[a >> 2] | 0;
+              Jw(a, b, g, 0);
+              a = 0;
+              f = 0.0;
+              while (1) {
+                if ((a | 0) >= (j | 0)) break;
+                e = +h[(b + (a << 3)) >> 3] + f;
+                a = (a + 1) | 0;
+                f = e;
+              }
+              e = +(j | 0);
+              d = c[g >> 2] | 0;
+              a = 0;
+              while (1) {
+                if ((a | 0) >= (j | 0)) break;
+                g = (d + (a << 3)) | 0;
+                h[g >> 3] = (+h[(b + (a << 3)) >> 3] * e - f) * i + +h[g >> 3];
+                a = (a + 1) | 0;
+              }
+              l = k;
+              return d | 0;
+            }
+            function Wx(a, b) {
+              a = a | 0;
+              b = +b;
+              var d = 0,
+                e = 0;
+              d = KK(8) | 0;
+              e = KK(16) | 0;
+              c[d >> 2] = e;
+              h[e >> 3] = b;
+              c[(e + 8) >> 2] = a;
+              c[(d + 4) >> 2] = 25;
+              return d | 0;
+            }
+            function Xx(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              f = l;
+              l = (l + 16) | 0;
+              e = f;
+              c[e >> 2] = d;
+              Jw(c[a >> 2] | 0, b, e, 0);
+              l = f;
+              return c[e >> 2] | 0;
+            }
+            function Yx(a) {
+              a = a | 0;
+              var b = 0;
+              b = KK(8) | 0;
+              c[b >> 2] = a;
+              c[(b + 4) >> 2] = 26;
+              return b | 0;
+            }
+            function Zx(a) {
+              a = a | 0;
+              if (a | 0) U1(a);
+              return;
+            }
+            function _x(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              f = c[a >> 2] | 0;
+              e = ~~+h[f >> 3];
+              f = (f + 8) | 0;
+              a = 0;
+              while (1) {
+                if ((a | 0) >= (e | 0)) break;
+                h[(d + (a << 3)) >> 3] = +h[(f + (a << 3)) >> 3] * +h[(b + (a << 3)) >> 3];
+                a = (a + 1) | 0;
+              }
+              return d | 0;
+            }
+            function $x(a, b) {
+              a = a | 0;
+              b = +b;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0.0,
+                o = 0,
+                p = 0,
+                q = 0.0;
+              m = c[a >> 2] | 0;
+              o = c[(a + 20) >> 2] | 0;
+              p = c[(a + 24) >> 2] | 0;
+              k = c[(a + 28) >> 2] | 0;
+              l = KK(8) | 0;
+              i = KK(((m << 3) + 8) | 0) | 0;
+              c[l >> 2] = i;
+              h[i >> 3] = +(m | 0);
+              i = (i + 8) | 0;
+              q = +((m + -1) | 0);
+              j = 1.0 / q;
+              b = q * b;
+              a = 0;
+              a: while (1) {
+                if ((a | 0) >= (m | 0)) break;
+                e = (i + (a << 3)) | 0;
+                h[e >> 3] = j;
+                f = (a + 1) | 0;
+                g = c[(o + (f << 2)) >> 2] | 0;
+                d = c[(o + (a << 2)) >> 2] | 0;
+                while (1) {
+                  if ((d | 0) >= (g | 0)) {
+                    a = f;
+                    continue a;
+                  }
+                  if (
+                    (a | 0) == (c[(p + (d << 2)) >> 2] | 0)
+                      ? ((n = +h[(k + (d << 3)) >> 3]), (n >= 0.0 ? n : -n) > 0.0)
+                      : 0
+                  )
+                    h[e >> 3] = 1.0 / (n + b);
+                  d = (d + 1) | 0;
+                }
+              }
+              c[(l + 4) >> 2] = 27;
+              return l | 0;
+            }
+            function ay(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0;
+              i = c[a >> 2] | 0;
+              k = c[(a + 20) >> 2] | 0;
+              l = c[(a + 24) >> 2] | 0;
+              m = c[(a + 28) >> 2] | 0;
+              n = KK(8) | 0;
+              d = KK(((c[a >> 2] << 3) + 8) | 0) | 0;
+              c[n >> 2] = d;
+              h[d >> 3] = +(i | 0);
+              d = (d + 8) | 0;
+              a = 0;
+              a: while (1) {
+                if ((a | 0) >= (i | 0)) break;
+                e = (d + (a << 3)) | 0;
+                h[e >> 3] = 1.0;
+                f = (a + 1) | 0;
+                g = c[(k + (f << 2)) >> 2] | 0;
+                b = c[(k + (a << 2)) >> 2] | 0;
+                while (1) {
+                  if ((b | 0) >= (g | 0)) {
+                    a = f;
+                    continue a;
+                  }
+                  if (
+                    (a | 0) == (c[(l + (b << 2)) >> 2] | 0)
+                      ? ((j = +h[(m + (b << 3)) >> 3]), (j >= 0.0 ? j : -j) > 0.0)
+                      : 0
+                  )
+                    h[e >> 3] = 1.0 / j;
+                  b = (b + 1) | 0;
+                }
+              }
+              c[(n + 4) >> 2] = 27;
+              return n | 0;
+            }
+            function by(a) {
+              a = a | 0;
+              U1(c[a >> 2] | 0);
+              if (a | 0) U1(a);
+              return;
+            }
+            function cy(a, b, c, d, e, f, g, i, j) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = +g;
+              i = i | 0;
+              j = j | 0;
+              var k = 0.0,
+                l = 0,
+                m = 0.0,
+                n = 0,
+                o = 0,
+                p = 0;
+              o = c << 3;
+              n = KK(o) | 0;
+              o = KK(o) | 0;
+              l = 0;
+              m = 0.0;
+              while (1) {
+                if ((l | 0) < (d | 0)) j = 0;
+                else break;
+                while (1) {
+                  if ((j | 0) >= (c | 0)) break;
+                  p = ((O(j, d) | 0) + l) | 0;
+                  h[(n + (j << 3)) >> 3] = +h[(e + (p << 3)) >> 3];
+                  h[(o + (j << 3)) >> 3] = +h[(f + (p << 3)) >> 3];
+                  j = (j + 1) | 0;
+                }
+                k = +dy(a, b, c, n, o, g, i);
+                j = 0;
+                while (1) {
+                  if ((j | 0) >= (c | 0)) break;
+                  h[(f + (((O(j, d) | 0) + l) << 3)) >> 3] = +h[(n + (j << 3)) >> 3];
+                  j = (j + 1) | 0;
+                }
+                l = (l + 1) | 0;
+                m = k + m;
+              }
+              U1(n);
+              U1(o);
+              return +m;
+            }
+            function dy(a, b, d, e, f, g, h) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = +g;
+              h = h | 0;
+              var i = 0,
+                j = 0.0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0.0,
+                o = 0.0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0.0,
+                t = 0,
+                u = 0;
+              r = c[(a + 4) >> 2] | 0;
+              p = c[(b + 4) >> 2] | 0;
+              q = d << 3;
+              i = KK(q) | 0;
+              k = KK(q) | 0;
+              t = KK(q) | 0;
+              l = KK(q) | 0;
+              k = nb[r & 63](a, e, k) | 0;
+              m = Vw(d, f, k) | 0;
+              o = +(d | 0);
+              s = +C(+(+Ww(d, m, m))) / o;
+              n = s * g;
+              o = 1.0 / o;
+              m = 0;
+              f = t;
+              j = 1.0;
+              g = s;
+              while (1) {
+                if (!((g > n) & ((m | 0) < (h | 0)))) break;
+                i = nb[p & 63](b, k, i) | 0;
+                g = +Ww(d, k, i);
+                if ((m | 0) > 0) Xw(d, i, f, g / j) | 0;
+                else W6(f | 0, i | 0, q | 0) | 0;
+                u = nb[r & 63](a, f, l) | 0;
+                j = g / +Ww(d, f, u);
+                Yw(d, e, f, j) | 0;
+                t = Yw(d, k, u, -j) | 0;
+                m = (m + 1) | 0;
+                j = g;
+                l = u;
+                g = +C(+(+Ww(d, t, t))) * o;
+              }
+              U1(i);
+              U1(k);
+              U1(f);
+              U1(l);
+              return +g;
+            }
+            function ey(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0;
+              C = l;
+              l = (l + 16) | 0;
+              B = C;
+              y = c[(a + 4) >> 2] | 0;
+              z = y << 3;
+              A = KK(z) | 0;
+              u = KK(z) | 0;
+              v = KK(z) | 0;
+              w = c[(a + 20) >> 2] | 0;
+              x = c[(a + 24) >> 2] | 0;
+              s = c[(a + 28) >> 2] | 0;
+              t = c[15712] | 0;
+              r = 0;
+              while (1) {
+                if ((r | 0) < (b | 0)) g = 0;
+                else break;
+                while (1) {
+                  if ((g | 0) >= (y | 0)) {
+                    a = 0;
+                    break;
+                  }
+                  q = ((O(g, b) | 0) + r) | 0;
+                  h[(A + (g << 3)) >> 3] = +h[(d + (q << 3)) >> 3];
+                  h[(v + (g << 3)) >> 3] = +h[(e + (q << 3)) >> 3];
+                  g = (g + 1) | 0;
+                }
+                while (1) {
+                  if ((a | 0) < (f | 0)) n = 0;
+                  else {
+                    g = 0;
+                    break;
+                  }
+                  while (1) {
+                    if ((n | 0) >= (y | 0)) break;
+                    o = c[(w + (n << 2)) >> 2] | 0;
+                    p = (n + 1) | 0;
+                    q = c[(w + (p << 2)) >> 2] | 0;
+                    m = o;
+                    j = 0.0;
+                    i = 0.0;
+                    while (1) {
+                      if ((m | 0) >= (q | 0)) break;
+                      g = c[(x + (m << 2)) >> 2] | 0;
+                      k = +h[(s + (m << 3)) >> 3];
+                      if ((g | 0) == (n | 0)) i = k;
+                      else j = +h[(A + (g << 3)) >> 3] * k + j;
+                      m = (m + 1) | 0;
+                    }
+                    if (j == 0.0) {
+                      c[B >> 2] = q - o;
+                      w4(t, 96212, B) | 0;
+                    }
+                    h[(u + (n << 3)) >> 3] = (+h[(v + (n << 3)) >> 3] - j) / i;
+                    n = p;
+                  }
+                  W6(A | 0, u | 0, z | 0) | 0;
+                  a = (a + 1) | 0;
+                }
+                while (1) {
+                  if ((g | 0) >= (y | 0)) break;
+                  h[(e + (((O(g, b) | 0) + r) << 3)) >> 3] = +h[(A + (g << 3)) >> 3];
+                  g = (g + 1) | 0;
+                }
+                r = (r + 1) | 0;
+              }
+              U1(A);
+              U1(u);
+              U1(v);
+              l = C;
+              return e | 0;
+            }
+            function fy(a, b, d, e, f, g, h, i) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = +f;
+              g = g | 0;
+              h = h | 0;
+              i = i | 0;
+              var j = 0;
+              j = c[a >> 2] | 0;
+              c[i >> 2] = 0;
+              switch (h | 0) {
+                case 0: {
+                  h = Yx(a) | 0;
+                  i = ay(a) | 0;
+                  f = +cy(h, i, j, b, d, e, f, g, 0);
+                  Zx(h);
+                  by(i);
+                  break;
+                }
+                case 1: {
+                  ey(a, b, d, e, g, 0) | 0;
+                  f = 0.0;
+                  break;
+                }
+                default:
+                  f = 0.0;
+              }
+              return +f;
+            }
+            function gy(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              o = l;
+              l = (l + 32) | 0;
+              k = o;
+              m = (o + 20) | 0;
+              f = (o + 16) | 0;
+              g = (o + 12) | 0;
+              i = (o + 8) | 0;
+              h[k >> 3] = 1.0;
+              j = a << 3;
+              n = KK(j) | 0;
+              j = KK(j) | 0;
+              b = 0;
+              while (1) {
+                if ((b | 0) >= (a | 0)) break;
+                e = b << 1;
+                h[(n + (b << 3)) >> 3] = +h[(d + (e << 3)) >> 3];
+                h[(j + (b << 3)) >> 3] = +h[(d + ((e | 1) << 3)) >> 3];
+                b = (b + 1) | 0;
+              }
+              c[m >> 2] = b;
+              if ((a | 0) > 2) d = Zr(n, j, a, i) | 0;
+              else {
+                c[i >> 2] = 0;
+                d = 0;
+              }
+              e = rw(a, a, 1, 1, 2) | 0;
+              b = 0;
+              while (1) {
+                c[m >> 2] = b;
+                if ((b | 0) >= (c[i >> 2] | 0)) break;
+                p = b << 1;
+                c[f >> 2] = c[(d + (p << 2)) >> 2];
+                c[g >> 2] = c[(d + ((p | 1) << 2)) >> 2];
+                Nw(e, 1, f, g, k) | 0;
+                b = ((c[m >> 2] | 0) + 1) | 0;
+              }
+              if ((a | 0) == 2) {
+                c[f >> 2] = 0;
+                c[g >> 2] = 1;
+                Nw(e, 1, f, g, k) | 0;
+                b = 0;
+              } else b = 0;
+              while (1) {
+                c[m >> 2] = b;
+                if ((b | 0) >= (a | 0)) break;
+                Nw(e, 1, m, m, k) | 0;
+                b = ((c[m >> 2] | 0) + 1) | 0;
+              }
+              a = Cw(e) | 0;
+              qw(e);
+              p = vw(a, 0) | 0;
+              qw(a);
+              U1(d);
+              U1(n);
+              U1(j);
+              l = o;
+              return p | 0;
+            }
+            function hy(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              m = l;
+              l = (l + 16) | 0;
+              g = (m + 8) | 0;
+              i = m;
+              h[i >> 3] = 1.0;
+              k = a << 3;
+              j = KK(k) | 0;
+              k = KK(k) | 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (a | 0)) break;
+                f = O(e, b) | 0;
+                h[(j + (e << 3)) >> 3] = +h[(d + (f << 3)) >> 3];
+                h[(k + (e << 3)) >> 3] = +h[(d + ((f + 1) << 3)) >> 3];
+                e = (e + 1) | 0;
+              }
+              c[g >> 2] = e;
+              e = _r(j, k, a, 0) | 0;
+              f = rw(a, a, 1, 1, 2) | 0;
+              b = 0;
+              while (1) {
+                c[g >> 2] = b;
+                if ((b | 0) < (a | 0)) d = 1;
+                else {
+                  b = 0;
+                  break;
+                }
+                while (1) {
+                  if ((d | 0) >= (c[(e + ((b * 12) | 0)) >> 2] | 0)) break;
+                  Nw(f, 1, g, ((c[(e + ((b * 12) | 0) + 4) >> 2] | 0) + (d << 2)) | 0, i) | 0;
+                  d = (d + 1) | 0;
+                  b = c[g >> 2] | 0;
+                }
+                b = (b + 1) | 0;
+              }
+              while (1) {
+                c[g >> 2] = b;
+                if ((b | 0) >= (a | 0)) break;
+                Nw(f, 1, g, g, i) | 0;
+                b = ((c[g >> 2] | 0) + 1) | 0;
+              }
+              i = vw(Cw(f) | 0, 0) | 0;
+              qw(f);
+              U1(j);
+              U1(k);
+              $r(e);
+              l = m;
+              return i | 0;
+            }
+            function iy(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = l;
+              l = (l + 16) | 0;
+              f = e;
+              jy(f, c);
+              ky(a, b, c, f);
+              ly(b, f, d);
+              my(f);
+              l = e;
+              return;
+            }
+            function jy(a, b) {
+              a = a | 0;
+              b = b | 0;
+              c[a >> 2] = KK(b << 4) | 0;
+              c[(a + 4) >> 2] = b;
+              c[(a + 8) >> 2] = 0;
+              return;
+            }
+            function ky(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0;
+              D = l;
+              l = (l + 64) | 0;
+              r = (D + 32) | 0;
+              u = (D + 48) | 0;
+              v = (D + 16) | 0;
+              w = D;
+              t = b << 2;
+              A = KK(t) | 0;
+              C = KK(t) | 0;
+              c[v >> 2] = 0;
+              c[(v + 4) >> 2] = 0;
+              c[(v + 8) >> 2] = 0;
+              c[(v + 12) >> 2] = 0;
+              s = KK(t) | 0;
+              t = KK(t) | 0;
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (b | 0)) break;
+                c[(s + (f << 2)) >> 2] = f;
+                f = (f + 1) | 0;
+              }
+              q = (b + -1) | 0;
+              it(a, s, 0, q);
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (b | 0)) break;
+                c[(t + (c[(s + (f << 2)) >> 2] << 2)) >> 2] = f;
+                f = (f + 1) | 0;
+              }
+              oy(u, a, s, b);
+              f = 1;
+              while (1) {
+                if ((f | 0) >= (b | 0)) {
+                  f = 0;
+                  break;
+                }
+                c[(A + (c[(s + (f << 2)) >> 2] << 2)) >> 2] = c[(s + ((f + -1) << 2)) >> 2];
+                f = (f + 1) | 0;
+              }
+              while (1) {
+                if ((f | 0) >= (q | 0)) break;
+                p = (f + 1) | 0;
+                c[(C + (c[(s + (f << 2)) >> 2] << 2)) >> 2] = c[(s + (p << 2)) >> 2];
+                f = p;
+              }
+              k = (e + 8) | 0;
+              m = (e + 4) | 0;
+              n = (v + 4) | 0;
+              o = (w + 4) | 0;
+              p = (w + 8) | 0;
+              j = 0;
+              while (1) {
+                if ((j | 0) >= (d | 0)) break;
+                if (!(((py(u, v) | 0) << 24) >> 24)) break;
+                f = c[k >> 2] | 0;
+                b = c[m >> 2] | 0;
+                if ((f | 0) < (b | 0)) b = c[e >> 2] | 0;
+                else {
+                  c[m >> 2] = b << 1;
+                  b = W1(c[e >> 2] | 0, b << 5) | 0;
+                  c[e >> 2] = b;
+                  f = c[k >> 2] | 0;
+                }
+                c[k >> 2] = f + 1;
+                f = (b + (f << 4)) | 0;
+                c[f >> 2] = c[v >> 2];
+                c[(f + 4) >> 2] = c[(v + 4) >> 2];
+                c[(f + 8) >> 2] = c[(v + 8) >> 2];
+                c[(f + 12) >> 2] = c[(v + 12) >> 2];
+                f = c[v >> 2] | 0;
+                b = c[(t + (f << 2)) >> 2] | 0;
+                g = c[n >> 2] | 0;
+                i = c[(t + (g << 2)) >> 2] | 0;
+                if (
+                  (b | 0) > 0
+                    ? ((x = c[(s + ((b + -1) << 2)) >> 2] | 0),
+                      (y = (C + (x << 2)) | 0),
+                      (c[(t + (c[y >> 2] << 2)) >> 2] | 0) < (i | 0))
+                    : 0
+                ) {
+                  c[w >> 2] = x;
+                  c[o >> 2] = g;
+                  h[p >> 3] = +h[(a + (g << 3)) >> 3] - +h[(a + (x << 3)) >> 3];
+                  c[r >> 2] = c[w >> 2];
+                  c[(r + 4) >> 2] = c[(w + 4) >> 2];
+                  c[(r + 8) >> 2] = c[(w + 8) >> 2];
+                  c[(r + 12) >> 2] = c[(w + 12) >> 2];
+                  qy(u, r);
+                  c[y >> 2] = g;
+                  c[(A + (g << 2)) >> 2] = x;
+                }
+                if (
+                  (i | 0) < (q | 0)
+                    ? ((z = c[(s + ((i + 1) << 2)) >> 2] | 0),
+                      (B = (A + (z << 2)) | 0),
+                      (c[(t + (c[B >> 2] << 2)) >> 2] | 0) > (b | 0))
+                    : 0
+                ) {
+                  c[w >> 2] = f;
+                  c[o >> 2] = z;
+                  h[p >> 3] = +h[(a + (z << 3)) >> 3] - +h[(a + (f << 3)) >> 3];
+                  c[r >> 2] = c[w >> 2];
+                  c[(r + 4) >> 2] = c[(w + 4) >> 2];
+                  c[(r + 8) >> 2] = c[(w + 8) >> 2];
+                  c[(r + 12) >> 2] = c[(w + 12) >> 2];
+                  qy(u, r);
+                  c[B >> 2] = f;
+                  c[(C + (f << 2)) >> 2] = z;
+                }
+                j = (j + 1) | 0;
+              }
+              U1(A);
+              U1(C);
+              U1(s);
+              U1(t);
+              ry(u);
+              l = D;
+              return;
+            }
+            function ly(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0;
+              k = KK(a << 2) | 0;
+              l = (b + 8) | 0;
+              i = c[l >> 2] | 0;
+              j = ((i << 1) + a) | 0;
+              h = j << 2;
+              e = KK(h) | 0;
+              h = KK(h) | 0;
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (a | 0)) break;
+                c[(k + (f << 2)) >> 2] = 1;
+                f = (f + 1) | 0;
+              }
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (i | 0)) {
+                  f = 0;
+                  break;
+                }
+                n = c[b >> 2] | 0;
+                m = c[(n + (f << 4) + 4) >> 2] | 0;
+                n = (k + (c[(n + (f << 4)) >> 2] << 2)) | 0;
+                c[n >> 2] = (c[n >> 2] | 0) + 1;
+                m = (k + (m << 2)) | 0;
+                c[m >> 2] = (c[m >> 2] | 0) + 1;
+                f = (f + 1) | 0;
+              }
+              while (1) {
+                if ((f | 0) >= (j | 0)) break;
+                g[(h + (f << 2)) >> 2] = 1.0;
+                f = (f + 1) | 0;
+              }
+              i = KK((a * 20) | 0) | 0;
+              c[d >> 2] = i;
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (a | 0)) break;
+                c[(i + ((f * 20) | 0)) >> 2] = 1;
+                c[(i + ((f * 20) | 0) + 8) >> 2] = h;
+                c[(i + ((f * 20) | 0) + 4) >> 2] = e;
+                c[e >> 2] = f;
+                g[h >> 2] = 0.0;
+                n = c[(k + (f << 2)) >> 2] | 0;
+                h = (h + (n << 2)) | 0;
+                e = (e + (n << 2)) | 0;
+                f = (f + 1) | 0;
+              }
+              U1(k);
+              while (1) {
+                e = c[l >> 2] | 0;
+                if (!e) break;
+                n = (e + -1) | 0;
+                c[l >> 2] = n;
+                m = c[b >> 2] | 0;
+                ny(i, c[(m + (n << 4)) >> 2] | 0, c[(m + (n << 4) + 4) >> 2] | 0);
+              }
+              return;
+            }
+            function my(a) {
+              a = a | 0;
+              U1(c[a >> 2] | 0);
+              return;
+            }
+            function ny(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              f = (a + ((b * 20) | 0)) | 0;
+              h = c[f >> 2] | 0;
+              i = c[(a + ((b * 20) | 0) + 4) >> 2] | 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (h | 0)) {
+                  j = 4;
+                  break;
+                }
+                if ((c[(i + (e << 2)) >> 2] | 0) == (d | 0)) break;
+                else e = (e + 1) | 0;
+              }
+              if (
+                (j | 0) == 4
+                  ? ((c[f >> 2] = h + 1),
+                    (c[(i + (h << 2)) >> 2] = d),
+                    (i = c[(a + ((d * 20) | 0) + 4) >> 2] | 0),
+                    (h = (a + ((d * 20) | 0)) | 0),
+                    (j = c[h >> 2] | 0),
+                    (c[h >> 2] = j + 1),
+                    (c[(i + (j << 2)) >> 2] = b),
+                    c[(a + 8) >> 2] | 0)
+                  : 0
+              ) {
+                j = c[(a + ((b * 20) | 0) + 8) >> 2] | 0;
+                g[j >> 2] = +g[j >> 2] + -1.0;
+                j = c[(a + ((d * 20) | 0) + 8) >> 2] | 0;
+                g[j >> 2] = +g[j >> 2] + -1.0;
+              }
+              return;
+            }
+            function oy(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0,
+                l = 0;
+              f = (e + -1) | 0;
+              c[(a + 4) >> 2] = f;
+              c[(a + 8) >> 2] = f;
+              c[a >> 2] = KK(f << 4) | 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (f | 0)) break;
+                l = c[(d + (e << 2)) >> 2] | 0;
+                g = (e + 1) | 0;
+                k = c[(d + (g << 2)) >> 2] | 0;
+                j = +h[(b + (k << 3)) >> 3] - +h[(b + (l << 3)) >> 3];
+                i = c[a >> 2] | 0;
+                c[(i + (e << 4)) >> 2] = l;
+                c[(i + (e << 4) + 4) >> 2] = k;
+                h[(i + (e << 4) + 8) >> 3] = j;
+                e = g;
+              }
+              e = ((f | 0) / 2) | 0;
+              while (1) {
+                if ((e | 0) <= -1) break;
+                sy(a, e);
+                e = (e + -1) | 0;
+              }
+              return;
+            }
+            function py(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = (a + 4) | 0;
+              if (!(c[d >> 2] | 0)) a = 0;
+              else {
+                e = c[a >> 2] | 0;
+                c[b >> 2] = c[e >> 2];
+                c[(b + 4) >> 2] = c[(e + 4) >> 2];
+                c[(b + 8) >> 2] = c[(e + 8) >> 2];
+                c[(b + 12) >> 2] = c[(e + 12) >> 2];
+                b = c[a >> 2] | 0;
+                e = (b + (((c[d >> 2] | 0) + -1) << 4)) | 0;
+                c[b >> 2] = c[e >> 2];
+                c[(b + 4) >> 2] = c[(e + 4) >> 2];
+                c[(b + 8) >> 2] = c[(e + 8) >> 2];
+                c[(b + 12) >> 2] = c[(e + 12) >> 2];
+                c[d >> 2] = (c[d >> 2] | 0) + -1;
+                sy(a, 0);
+                a = 1;
+              }
+              return a | 0;
+            }
+            function qy(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0.0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              n = l;
+              l = (l + 16) | 0;
+              m = n;
+              j = (a + 4) | 0;
+              g = c[j >> 2] | 0;
+              d = (a + 8) | 0;
+              if ((g | 0) == (c[d >> 2] | 0)) {
+                c[d >> 2] = g << 1;
+                d = W1(c[a >> 2] | 0, g << 5) | 0;
+                c[a >> 2] = d;
+                k = a;
+                i = c[j >> 2] | 0;
+              } else {
+                k = a;
+                i = g;
+                d = c[a >> 2] | 0;
+              }
+              c[j >> 2] = i + 1;
+              j = (d + (g << 4)) | 0;
+              c[j >> 2] = c[b >> 2];
+              c[(j + 4) >> 2] = c[(b + 4) >> 2];
+              c[(j + 8) >> 2] = c[(b + 8) >> 2];
+              c[(j + 12) >> 2] = c[(b + 12) >> 2];
+              while (1) {
+                if ((g | 0) <= 0) break;
+                d = c[k >> 2] | 0;
+                e = +h[(d + (g << 4) + 8) >> 3];
+                a = g >>> 1;
+                f = +h[(d + (a << 4) + 8) >> 3];
+                if (!(e < f)) {
+                  if (!(e == f)) break;
+                  if (!((x5() | 0) & 1)) break;
+                  d = c[k >> 2] | 0;
+                }
+                j = (d + (g << 4)) | 0;
+                c[m >> 2] = c[j >> 2];
+                c[(m + 4) >> 2] = c[(j + 4) >> 2];
+                c[(m + 8) >> 2] = c[(j + 8) >> 2];
+                c[(m + 12) >> 2] = c[(j + 12) >> 2];
+                b = (d + (a << 4)) | 0;
+                c[j >> 2] = c[b >> 2];
+                c[(j + 4) >> 2] = c[(b + 4) >> 2];
+                c[(j + 8) >> 2] = c[(b + 8) >> 2];
+                c[(j + 12) >> 2] = c[(b + 12) >> 2];
+                j = ((c[k >> 2] | 0) + (a << 4)) | 0;
+                c[j >> 2] = c[m >> 2];
+                c[(j + 4) >> 2] = c[(m + 4) >> 2];
+                c[(j + 8) >> 2] = c[(m + 8) >> 2];
+                c[(j + 12) >> 2] = c[(m + 12) >> 2];
+                g = a;
+              }
+              l = n;
+              return;
+            }
+            function ry(a) {
+              a = a | 0;
+              U1(c[a >> 2] | 0);
+              return;
+            }
+            function sy(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0.0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              m = l;
+              l = (l + 16) | 0;
+              i = m;
+              j = (a + 4) | 0;
+              while (1) {
+                d = b << 1;
+                g = d | 1;
+                if ((d | 0) < (c[j >> 2] | 0)) {
+                  n = c[a >> 2] | 0;
+                  e = +h[(n + (d << 4) + 8) >> 3];
+                  f = +h[(n + (b << 4) + 8) >> 3];
+                  if (!(e < f)) if (!(e == f ? (((x5() | 0) & 1) | 0) != 0 : 0)) k = 6;
+                } else k = 6;
+                if ((k | 0) == 6) {
+                  k = 0;
+                  d = b;
+                }
+                do
+                  if ((g | 0) < (c[j >> 2] | 0)) {
+                    n = c[a >> 2] | 0;
+                    e = +h[(n + (g << 4) + 8) >> 3];
+                    f = +h[(n + (d << 4) + 8) >> 3];
+                    if (!(e < f)) {
+                      if (!(e == f)) break;
+                      if (!((x5() | 0) & 1)) break;
+                    }
+                    d = g;
+                  }
+                while (0);
+                if ((d | 0) == (b | 0)) break;
+                g = c[a >> 2] | 0;
+                n = (g + (d << 4)) | 0;
+                c[i >> 2] = c[n >> 2];
+                c[(i + 4) >> 2] = c[(n + 4) >> 2];
+                c[(i + 8) >> 2] = c[(n + 8) >> 2];
+                c[(i + 12) >> 2] = c[(n + 12) >> 2];
+                g = (g + (b << 4)) | 0;
+                c[n >> 2] = c[g >> 2];
+                c[(n + 4) >> 2] = c[(g + 4) >> 2];
+                c[(n + 8) >> 2] = c[(g + 8) >> 2];
+                c[(n + 12) >> 2] = c[(g + 12) >> 2];
+                n = ((c[a >> 2] | 0) + (b << 4)) | 0;
+                c[n >> 2] = c[i >> 2];
+                c[(n + 4) >> 2] = c[(i + 4) >> 2];
+                c[(n + 8) >> 2] = c[(i + 8) >> 2];
+                c[(n + 12) >> 2] = c[(i + 12) >> 2];
+                b = d;
+              }
+              l = m;
+              return;
+            }
+            function ty(a, b, d, e, f, g, i, j) {
+              a = a | 0;
+              b = b | 0;
+              d = +d;
+              e = +e;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              j = j | 0;
+              var k = 0,
+                l = 0,
+                m = 0,
+                n = 0.0;
+              l = (f | 0) != 0;
+              if (!l) {
+                f = KK(b << 3) | 0;
+                if (!(ju(a, b, f, b) | 0)) m = 3;
+                else {
+                  a = 1;
+                  m = 17;
+                }
+              } else m = 3;
+              if ((m | 0) == 3) {
+                k = JK(b << 2) | 0;
+                c[g >> 2] = k;
+                a = 0;
+                while (1) {
+                  if ((a | 0) >= (b | 0)) break;
+                  c[(k + (a << 2)) >> 2] = a;
+                  a = (a + 1) | 0;
+                }
+                a = (b + -1) | 0;
+                it(f, k, 0, a);
+                n = +h[(f + (c[k >> 2] << 3)) >> 3];
+                e = ((+h[(f + (c[(k + (a << 2)) >> 2] << 3)) >> 3] - n) * e) / +(a | 0);
+                e = e < d ? d : e;
+                a = 0;
+                g = 1;
+                d = n;
+                while (1) {
+                  if ((g | 0) >= (b | 0)) break;
+                  n = +h[(f + (c[(k + (g << 2)) >> 2] << 3)) >> 3];
+                  a = (a + ((n - d > e) & 1)) | 0;
+                  g = (g + 1) | 0;
+                  d = n;
+                }
+                c[j >> 2] = a;
+                a: do
+                  if (!a) {
+                    k = KK(4) | 0;
+                    c[i >> 2] = k;
+                    c[k >> 2] = b;
+                  } else {
+                    j = KK(a << 2) | 0;
+                    c[i >> 2] = j;
+                    a = 0;
+                    g = 1;
+                    while (1) {
+                      if ((g | 0) >= (b | 0)) break a;
+                      if (
+                        +h[(f + (c[(k + (g << 2)) >> 2] << 3)) >> 3] -
+                          +h[(f + (c[(k + ((g + -1) << 2)) >> 2] << 3)) >> 3] >
+                        e
+                      ) {
+                        c[(j + (a << 2)) >> 2] = g;
+                        a = (a + 1) | 0;
+                      }
+                      g = (g + 1) | 0;
+                    }
+                  }
+                while (0);
+                if (l) a = 0;
+                else {
+                  a = 0;
+                  m = 17;
+                }
+              }
+              if ((m | 0) == 17) U1(f);
+              return a | 0;
+            }
+            function uy(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              d = c[46930] | 0;
+              if (d | 0) vn(d);
+              c[46930] = un(b, b, 0.0) | 0;
+              d = c[46931] | 0;
+              if (d | 0) U1(d);
+              c[46931] = JK(b << 2) | 0;
+              d = c[46932] | 0;
+              if (d | 0) U1(d);
+              n = JK(b << 3) | 0;
+              c[46932] = n;
+              o = c[46930] | 0;
+              p = c[46931] | 0;
+              i = 0;
+              while (1) {
+                if ((i | 0) >= (b | 0)) {
+                  e = 10;
+                  break;
+                }
+                e = (a + (i << 2)) | 0;
+                g = (o + (i << 2)) | 0;
+                f = 0.0;
+                d = 0;
+                while (1) {
+                  if ((d | 0) == (b | 0)) break;
+                  j = +h[((c[e >> 2] | 0) + (d << 3)) >> 3];
+                  h[((c[g >> 2] | 0) + (d << 3)) >> 3] = j;
+                  j = +B(+j);
+                  f = f < j ? j : f;
+                  d = (d + 1) | 0;
+                }
+                if (!(f != 0.0)) {
+                  e = 15;
+                  break;
+                }
+                h[(n + (i << 3)) >> 3] = 1.0 / f;
+                c[(p + (i << 2)) >> 2] = i;
+                i = (i + 1) | 0;
+              }
+              a: do
+                if ((e | 0) == 10) {
+                  m = (b + -1) | 0;
+                  d = 0;
+                  l = 0;
+                  b: while (1) {
+                    if ((l | 0) < (m | 0)) {
+                      e = l;
+                      k = d;
+                      f = 0.0;
+                    } else break;
+                    while (1) {
+                      if ((e | 0) >= (b | 0)) break;
+                      a = c[(p + (e << 2)) >> 2] | 0;
+                      j = +B(+(+h[((c[(o + (a << 2)) >> 2] | 0) + (l << 3)) >> 3]));
+                      j = +h[(n + (a << 3)) >> 3] * j;
+                      a = f < j;
+                      i = a ? e : k;
+                      e = (e + 1) | 0;
+                      k = i;
+                      f = a ? j : f;
+                    }
+                    if (f == 0.0) {
+                      d = 0;
+                      break a;
+                    }
+                    d = (p + (l << 2)) | 0;
+                    if ((k | 0) != (l | 0)) {
+                      i = c[d >> 2] | 0;
+                      a = (p + (k << 2)) | 0;
+                      c[d >> 2] = c[a >> 2];
+                      c[a >> 2] = i;
+                    }
+                    g = c[(o + (c[d >> 2] << 2)) >> 2] | 0;
+                    a = (l + 1) | 0;
+                    f = 1.0 / +h[(g + (l << 3)) >> 3];
+                    e = a;
+                    while (1) {
+                      if ((e | 0) >= (b | 0)) {
+                        d = k;
+                        l = a;
+                        continue b;
+                      }
+                      i = c[(o + (c[(p + (e << 2)) >> 2] << 2)) >> 2] | 0;
+                      d = (i + (l << 3)) | 0;
+                      j = +h[d >> 3] * f;
+                      h[d >> 3] = j;
+                      c: do
+                        if (j != 0.0) {
+                          d = a;
+                          while (1) {
+                            if ((d | 0) >= (b | 0)) break c;
+                            q = (i + (d << 3)) | 0;
+                            h[q >> 3] = +h[q >> 3] - +h[(g + (d << 3)) >> 3] * j;
+                            d = (d + 1) | 0;
+                          }
+                        }
+                      while (0);
+                      e = (e + 1) | 0;
+                    }
+                  }
+                  d = (+h[((c[(o + (c[(p + (m << 2)) >> 2] << 2)) >> 2] | 0) + (m << 3)) >> 3] != 0.0) & 1;
+                } else if ((e | 0) == 15) {
+                  h[(n + (i << 3)) >> 3] = 0.0;
+                  d = 0;
+                }
+              while (0);
+              return d | 0;
+            }
+            function vy(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              k = c[46930] | 0;
+              l = c[46931] | 0;
+              j = 0;
+              while (1) {
+                if ((j | 0) >= (d | 0)) {
+                  e = d;
+                  break;
+                }
+                g = c[(l + (j << 2)) >> 2] | 0;
+                i = (k + (g << 2)) | 0;
+                f = 0.0;
+                e = 0;
+                while (1) {
+                  if ((e | 0) == (j | 0)) break;
+                  f = +h[(a + (e << 3)) >> 3] * +h[((c[i >> 2] | 0) + (e << 3)) >> 3] + f;
+                  e = (e + 1) | 0;
+                }
+                h[(a + (j << 3)) >> 3] = +h[(b + (g << 3)) >> 3] - f;
+                j = (j + 1) | 0;
+              }
+              while (1) {
+                b = (e + -1) | 0;
+                if ((e | 0) <= 0) break;
+                g = (l + (b << 2)) | 0;
+                f = 0.0;
+                while (1) {
+                  if ((e | 0) >= (d | 0)) break;
+                  f = +h[(a + (e << 3)) >> 3] * +h[((c[(k + (c[g >> 2] << 2)) >> 2] | 0) + (e << 3)) >> 3] + f;
+                  e = (e + 1) | 0;
+                }
+                e = (a + (b << 3)) | 0;
+                h[e >> 3] = (+h[e >> 3] - f) / +h[((c[(k + (c[g >> 2] << 2)) >> 2] | 0) + (b << 3)) >> 3];
+                e = b;
+              }
+              return;
+            }
+            function wy(a) {
+              a = a | 0;
+              var b = 0;
+              b = KK(8) | 0;
+              c[b >> 2] = a;
+              c[(b + 4) >> 2] = 0;
+              return b | 0;
+            }
+            function xy(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              if (a | 0)
+                do {
+                  d = a;
+                  a = c[(a + 4) >> 2] | 0;
+                  e = c[d >> 2] | 0;
+                  if (e | 0) tb[b & 127](e);
+                  U1(d);
+                } while ((a | 0) != 0);
+              return;
+            }
+            function yy(a, b) {
+              a = a | 0;
+              b = b | 0;
+              b = wy(b) | 0;
+              c[(b + 4) >> 2] = a;
+              return b | 0;
+            }
+            function zy(a) {
+              a = a | 0;
+              return c[a >> 2] | 0;
+            }
+            function Ay(a) {
+              a = a | 0;
+              return c[(a + 4) >> 2] | 0;
+            }
+            function By(a) {
+              a = a | 0;
+              var b = 0;
+              b = KK(12) | 0;
+              c[b >> 2] = a;
+              c[(b + 4) >> 2] = 0;
+              c[(b + 8) >> 2] = 0;
+              return b | 0;
+            }
+            function Cy(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              if (a | 0)
+                do {
+                  d = a;
+                  a = c[(a + 4) >> 2] | 0;
+                  e = c[d >> 2] | 0;
+                  if (e | 0) tb[b & 127](e);
+                  U1(d);
+                } while ((a | 0) != 0);
+              return;
+            }
+            function Dy(a, b) {
+              a = a | 0;
+              b = b | 0;
+              b = By(b) | 0;
+              if (a | 0) {
+                c[(b + 4) >> 2] = a;
+                c[(a + 8) >> 2] = b;
+              }
+              return b | 0;
+            }
+            function Ey(a) {
+              a = a | 0;
+              return c[a >> 2] | 0;
+            }
+            function Fy(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              if (a | 0) {
+                e = c[(a + 4) >> 2] | 0;
+                f = c[(a + 8) >> 2] | 0;
+                g = c[a >> 2] | 0;
+                if (g | 0) tb[b & 127](g);
+                U1(a);
+                if (e | 0) c[(e + 8) >> 2] = f;
+                c[(f | 0 ? (f + 4) | 0 : d) >> 2] = e;
+              }
+              return;
+            }
+            function Gy(a) {
+              a = a | 0;
+              c[a >> 2] = 0;
+              c[(a + 4) >> 2] = 0;
+              return;
+            }
+            function Hy(a) {
+              a = a | 0;
+              var b = 0;
+              b = JK(64) | 0;
+              Gy((b + 36) | 0);
+              c[(b + 8) >> 2] = a;
+              return b | 0;
+            }
+            function Iy(a) {
+              a = a | 0;
+              if (a | 0) {
+                cz(c[(a + 32) >> 2] | 0);
+                U1(a);
+              }
+              return;
+            }
+            function Jy(a) {
+              a = a | 0;
+              return tB(c[(a + 8) >> 2] | 0) | 0;
+            }
+            function Ky(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              c[(b + 4) >> 2] = 0;
+              d = (a + 4) | 0;
+              e = c[d >> 2] | 0;
+              c[((e | 0) == 0 ? a : (e + 4) | 0) >> 2] = b;
+              c[d >> 2] = b;
+              return;
+            }
+            function Ly(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = c[a >> 2] | 0;
+              if (!d) {
+                c[a >> 2] = b;
+                a = (a + 4) | 0;
+              } else c[(b + 4) >> 2] = d;
+              c[a >> 2] = b;
+              return;
+            }
+            function My(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              Ny(a, b);
+              j = c[b >> 2] | 0;
+              h = c[(j + 4) >> 2] | 0;
+              while (1) {
+                if (!h) break;
+                k = c[(h + 8) >> 2] | 0;
+                i = jC(k) | 0;
+                d = c[((c[(i + 16) >> 2] | 0) + 112) >> 2] | 0;
+                a = c[(d + 16 + 4) >> 2] | 0;
+                d = c[(d + 8) >> 2] | 0;
+                f = i;
+                i = kC(k, i) | 0;
+                while (1) {
+                  if (!i) break;
+                  e = c[((c[(i + 16) >> 2] | 0) + 112) >> 2] | 0;
+                  g = c[(e + 16 + 4) >> 2] | 0;
+                  if ((g | 0) < (a | 0)) {
+                    f = i;
+                    d = c[(e + 8) >> 2] | 0;
+                    a = g;
+                  }
+                  i = kC(k, i) | 0;
+                }
+                i = c[((c[(d + 16) >> 2] | 0) + 112) >> 2] | 0;
+                k = (i + 4) | 0;
+                c[k >> 2] = c[k >> 2] | 8;
+                c[h >> 2] = f;
+                k = c[(h + 4) >> 2] | 0;
+                Ky(((c[(i + 12) >> 2] | 0) + 36) | 0, h);
+                h = k;
+              }
+              Gy(b);
+              return j | 0;
+            }
+            function Ny(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 16) | 0;
+              h = i;
+              g = (i + 8) | 0;
+              e = c[(b + 24) >> 2] | 0;
+              if (!((e | 0) != 0 ? ((d = tC(a, e, 0) | 0), (d | 0) != 0) : 0)) f = 3;
+              a: do
+                if ((f | 0) == 3) {
+                  e = (b + 20) | 0;
+                  b: do
+                    if (c[e >> 2] | 0) {
+                      d = jC(a) | 0;
+                      while (1) {
+                        if (!d) break b;
+                        if (
+                          ((cP(c[c[((c[(d + 16) >> 2] | 0) + 112) >> 2] >> 2] | 0, c[e >> 2] | 0, 0) | 0) << 24) >>
+                          24
+                        )
+                          break a;
+                        d = kC(a, d) | 0;
+                      }
+                    }
+                  while (0);
+                  d = jC(a) | 0;
+                }
+              while (0);
+              if (0) {
+                f = c[15712] | 0;
+                c[h >> 2] = KB(d) | 0;
+                w4(f, 96223, h) | 0;
+              }
+              c[(g + 4) >> 2] = 0;
+              c[g >> 2] = 0;
+              Oy(a, d, b, 1, g);
+              l = i;
+              return;
+            }
+            function Oy(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              l = (d + 8) | 0;
+              k = c[l >> 2] | 0;
+              c[l >> 2] = k + 1;
+              l = (b + 16) | 0;
+              c[((c[((c[l >> 2] | 0) + 112) >> 2] | 0) + 16 + 4) >> 2] = k;
+              c[((c[((c[l >> 2] | 0) + 112) >> 2] | 0) + 24) >> 2] = k;
+              k = (e | 0) == 0;
+              j = aB(a, b) | 0;
+              while (1) {
+                if (!j) break;
+                e = c[j >> 2] & 3;
+                g = c[(((e | 0) == 2 ? j : (j + -48) | 0) + 40) >> 2] | 0;
+                if ((g | 0) == (b | 0)) {
+                  e = c[(((e | 0) == 3 ? j : (j + 48) | 0) + 40) >> 2] | 0;
+                  g = c[((c[(j + 16) >> 2] | 0) + 120) >> 2] | 0;
+                  if (!(c[g >> 2] | 0)) c[g >> 2] = -1;
+                } else {
+                  e = c[((c[(j + 16) >> 2] | 0) + 120) >> 2] | 0;
+                  if (!(c[e >> 2] | 0)) {
+                    c[e >> 2] = 1;
+                    e = g;
+                  } else e = g;
+                }
+                g = (e + 16) | 0;
+                h = c[((c[g >> 2] | 0) + 112) >> 2] | 0;
+                i = c[(h + 16 + 4) >> 2] | 0;
+                do
+                  if (!i) {
+                    c[(h + 8) >> 2] = b;
+                    Py(f, j);
+                    Oy(a, e, d, 0, f);
+                    i = ((c[((c[l >> 2] | 0) + 112) >> 2] | 0) + 24) | 0;
+                    c[i >> 2] =
+                      c[
+                        ((c[
+                          ((c[
+                            (((c[i >> 2] | 0) < (c[((c[((c[g >> 2] | 0) + 112) >> 2] | 0) + 24) >> 2] | 0) ? b : e) +
+                              16) >>
+                              2
+                          ] |
+                            0) +
+                            112) >>
+                            2
+                        ] |
+                          0) +
+                          24) >>
+                          2
+                      ];
+                    if (
+                      (c[((c[((c[g >> 2] | 0) + 112) >> 2] | 0) + 24) >> 2] | 0) >=
+                      (c[((c[((c[l >> 2] | 0) + 112) >> 2] | 0) + 16 + 4) >> 2] | 0)
+                    ) {
+                      e = 0;
+                      do {
+                        h = Qy(f) | 0;
+                        g = (c[c[((c[(h + 16) >> 2] | 0) + 120) >> 2] >> 2] | 0) == 1;
+                        g =
+                          c[
+                            ((((c[h >> 2] & 3) | 0) == ((g ? 2 : 3) | 0) ? h : (h + (((g ? -1 : 1) * 48) | 0)) | 0) +
+                              40) >>
+                              2
+                          ] | 0;
+                        if (!(c[((c[((c[(g + 16) >> 2] | 0) + 112) >> 2] | 0) + 12) >> 2] | 0)) {
+                          if (!e) e = Ry(a, d) | 0;
+                          Sy(e, g);
+                        }
+                      } while ((h | 0) != (j | 0));
+                      if (e | 0) {
+                        if ((c[((c[((c[l >> 2] | 0) + 112) >> 2] | 0) + 12) >> 2] | 0) == 0 ? (Jy(e) | 0) > 1 : 0)
+                          Sy(e, b);
+                        if (!k ? (c[((c[((c[l >> 2] | 0) + 112) >> 2] | 0) + 12) >> 2] | 0) == (e | 0) : 0) {
+                          Ly(d, e);
+                          break;
+                        }
+                        Ky(d, e);
+                      }
+                    }
+                  } else {
+                    g = c[((c[l >> 2] | 0) + 112) >> 2] | 0;
+                    if ((c[(g + 8) >> 2] | 0) != (e | 0)) {
+                      h = (g + 24) | 0;
+                      g = c[h >> 2] | 0;
+                      c[h >> 2] = (g | 0) < (i | 0) ? g : i;
+                    }
+                  }
+                while (0);
+                j = bB(a, j, b) | 0;
+              }
+              if (!k ? (c[((c[((c[l >> 2] | 0) + 112) >> 2] | 0) + 12) >> 2] | 0) == 0 : 0) {
+                l = Ry(a, d) | 0;
+                Sy(l, b);
+                Ly(d, l);
+              }
+              return;
+            }
+            function Py(a, b) {
+              a = a | 0;
+              b = b | 0;
+              c[((c[((c[(b + 16) >> 2] | 0) + 120) >> 2] | 0) + 4) >> 2] = c[a >> 2];
+              c[a >> 2] = b;
+              b = (a + 4) | 0;
+              c[b >> 2] = (c[b >> 2] | 0) + 1;
+              return;
+            }
+            function Qy(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              b = c[a >> 2] | 0;
+              if (!b) qa(138394, 96254, 65, 96266);
+              d = (a + 4) | 0;
+              e = c[d >> 2] | 0;
+              if ((e | 0) > 0) {
+                c[a >> 2] = c[((c[((c[(b + 16) >> 2] | 0) + 120) >> 2] | 0) + 4) >> 2];
+                c[d >> 2] = e + -1;
+                return b | 0;
+              } else qa(96244, 96254, 61, 96266);
+              return 0;
+            }
+            function Ry(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return Hy(Ty(a, b) | 0) | 0;
+            }
+            function Sy(a, b) {
+              a = a | 0;
+              b = b | 0;
+              oC(c[(a + 8) >> 2] | 0, b, 1) | 0;
+              c[((c[((c[(b + 16) >> 2] | 0) + 112) >> 2] | 0) + 12) >> 2] = a;
+              return;
+            }
+            function Ty(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              d = l;
+              l = (l + 144) | 0;
+              f = d;
+              e = (d + 8) | 0;
+              g = (b + 12) | 0;
+              b = c[g >> 2] | 0;
+              c[g >> 2] = b + 1;
+              c[f >> 2] = b;
+              m4(e, 96234, f) | 0;
+              b = ND(a, e, 1) | 0;
+              TC(b, 137483, 280, 1) | 0;
+              l = d;
+              return b | 0;
+            }
+            function Uy(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = c[(a + 36) >> 2] | 0;
+              while (1) {
+                if (!b) break;
+                d = c[(b + 4) >> 2] | 0;
+                Uy(b);
+                b = d;
+              }
+              Iy(a);
+              return;
+            }
+            function Vy(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              Wy(a, b, +h[(c + 32) >> 3]);
+              return;
+            }
+            function Wy(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = +d;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0;
+              e = (b + 36) | 0;
+              f = 0;
+              while (1) {
+                e = c[e >> 2] | 0;
+                if (!e) break;
+                Wy(a, e, d);
+                e = (e + 4) | 0;
+                f = (f + 1) | 0;
+              }
+              e = mz(a, b, d) | 0;
+              c[(b + 32) >> 2] = e;
+              a = jz(e) | 0;
+              if ((f | 0) > 0) d = +Xy(f, a, e, b, d);
+              else d = 3.141592653589793;
+              if (
+                (
+                  ((a | 0) == 1 ? ((g = c[b >> 2] | 0), g | 0) : 0)
+                    ? c[((c[((c[(g + 16) >> 2] | 0) + 112) >> 2] | 0) + 8) >> 2] | 0
+                    : 0
+                )
+                  ? ((i = (b + 48) | 0), (h[i >> 3] = d), d < 0.0)
+                  : 0
+              )
+                h[i >> 3] = d + 6.283185307179586;
+              return;
+            }
+            function Xy(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = +f;
+              var g = 0.0,
+                i = 0,
+                j = 0.0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0;
+              v = l;
+              l = (l + 48) | 0;
+              t = v;
+              u = JK((a * 56) | 0) | 0;
+              c[(t + 40) >> 2] = c[(e + 36) >> 2];
+              p = (e + 16) | 0;
+              j = +h[p >> 3];
+              q = (t + 8) | 0;
+              h[q >> 3] = j;
+              h[t >> 3] = j;
+              c[(t + 44) >> 2] = c[e >> 2];
+              j = 6.283185307179586 / +(b | 0);
+              h[(t + 16) >> 3] = j;
+              r = (t + 24) | 0;
+              h[r >> 3] = -1.0;
+              s = (t + 32) | 0;
+              h[s >> 3] = -1.0;
+              k = 0;
+              o = 0;
+              g = 0.0;
+              while (1) {
+                i = c[d >> 2] | 0;
+                if (!i) break;
+                d = c[i >> 2] | 0;
+                if (!(c[((c[((c[(d + 16) >> 2] | 0) + 112) >> 2] | 0) + 4) >> 2] & 8)) d = o;
+                else {
+                  n = (u + ((o * 56) | 0)) | 0;
+                  c[n >> 2] = d;
+                  h[(u + ((o * 56) | 0) + 8) >> 3] = j * +(k | 0);
+                  d = (o + 1) | 0;
+                  g = +Yy(n, t, f);
+                }
+                k = (k + 1) | 0;
+                o = d;
+                d = (i + 4) | 0;
+              }
+              a: do
+                switch (o | 0) {
+                  case 1: {
+                    h[(u + 40) >> 3] = 1.0;
+                    d = 0;
+                    break;
+                  }
+                  case 2: {
+                    j = +h[(u + 64) >> 3] - +h[(u + 8) >> 3];
+                    Zy(u, (u + 56) | 0, j > 3.141592653589793 ? 6.283185307179586 - j : j);
+                    d = 0;
+                    break;
+                  }
+                  default: {
+                    n = (u + 8) | 0;
+                    m = u;
+                    d = 0;
+                    while (1) {
+                      if ((d | 0) >= (o | 0)) {
+                        d = 0;
+                        break a;
+                      }
+                      d = (d + 1) | 0;
+                      if ((d | 0) == (o | 0)) {
+                        i = u;
+                        j = +h[n >> 3] + 6.283185307179586 - +h[(m + 8) >> 3];
+                        k = (m + 56) | 0;
+                      } else {
+                        k = (m + 56) | 0;
+                        i = k;
+                        j = +h[(m + 64) >> 3] - +h[(m + 8) >> 3];
+                      }
+                      Zy(m, i, j);
+                      m = k;
+                    }
+                  }
+                }
+              while (0);
+              while (1) {
+                if ((d | 0) >= (o | 0)) break;
+                _y((u + ((d * 56) | 0)) | 0, t, b, f);
+                d = (d + 1) | 0;
+              }
+              U1(u);
+              if ((a | 0) == 1) {
+                f = g + f * 0.5;
+                $y(e, -f, 0.0, 0.0);
+                h[p >> 3] = +h[p >> 3] + f;
+                u = (e + 56) | 0;
+                c[u >> 2] = c[u >> 2] | 1;
+              } else h[p >> 3] = +h[q >> 3];
+              l = v;
+              return +((+h[s >> 3] + +h[r >> 3]) * 0.5 + -3.141592653589793);
+            }
+            function Yy(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = +d;
+              var e = 0,
+                f = 0.0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0.0;
+              i = 0;
+              f = 0.0;
+              g = 0.0;
+              e = (b + 40) | 0;
+              while (1) {
+                j = c[e >> 2] | 0;
+                if (!j) break;
+                e = c[j >> 2] | 0;
+                if (!e) e = 0;
+                else e = c[((c[((c[(e + 16) >> 2] | 0) + 112) >> 2] | 0) + 8) >> 2] | 0;
+                if ((e | 0) == (c[a >> 2] | 0)) {
+                  k = +h[(j + 16) >> 3];
+                  e = (i + 1) | 0;
+                  f = f + d + k * 2.0;
+                  g = g < k ? k : g;
+                } else e = i;
+                i = e;
+                e = (j + 4) | 0;
+              }
+              h[(a + 32) >> 3] = f;
+              c[(a + 48) >> 2] = i;
+              h[(a + 16) >> 3] = g + d + +h[b >> 3];
+              h[(a + 24) >> 3] = g;
+              return +g;
+            }
+            function Zy(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = +c;
+              var d = 0.0,
+                e = 0.0;
+              e = +h[(b + 16) >> 3];
+              d = +h[(a + 16) >> 3];
+              c = (d * +h[(b + 32) >> 3] + e * +h[(a + 32) >> 3]) / (c * 2.0 * e * d);
+              c = c < 1.0 ? 1.0 : c;
+              a = (a + 40) | 0;
+              if (c > +h[a >> 3]) h[a >> 3] = c;
+              a = (b + 40) | 0;
+              if (c > +h[a >> 3]) h[a >> 3] = c;
+              return;
+            }
+            function _y(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = +e;
+              var f = 0.0,
+                g = 0.0,
+                i = 0,
+                j = 0.0,
+                k = 0.0,
+                l = 0.0,
+                m = 0.0,
+                n = 0,
+                o = 0,
+                p = 0.0,
+                q = 0.0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0.0,
+                v = 0.0,
+                w = 0,
+                x = 0,
+                y = 0.0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0.0,
+                G = 0.0;
+              z = (b + 8) | 0;
+              y = +h[z >> 3];
+              A = (b + 24) | 0;
+              k = +h[A >> 3];
+              B = (b + 32) | 0;
+              j = +h[B >> 3];
+              f = +h[(a + 16) >> 3] * +h[(a + 40) >> 3];
+              x = (d | 0) == 1;
+              if (x) {
+                v = +h[(a + 32) >> 3];
+                g = v * 0.15915494309189535;
+                g = f > g ? f : g;
+                f = g * 6.283185307179586 - v;
+                if (f > 0.0) {
+                  e = f / +(c[(a + 48) >> 2] | 0) + e;
+                  l = 0.0;
+                  f = g;
+                } else {
+                  l = 0.0;
+                  f = g;
+                }
+              } else l = +h[(a + 8) >> 3] - +h[(a + 32) >> 3] / (f * 2.0);
+              q = +h[(a + 24) >> 3] + f;
+              r = q > y;
+              s = (a + 48) | 0;
+              t = ((((c[s >> 2] | 0) + 1) | 0) / 2) | 0;
+              u = 1.0 / f;
+              v = (e / f) * 0.5;
+              w = (a + 8) | 0;
+              n = (b + 40) | 0;
+              o = 0;
+              p = 0.0;
+              g = l;
+              while (1) {
+                n = c[n >> 2] | 0;
+                if (!n) break;
+                i = c[n >> 2] | 0;
+                if (!i) i = 0;
+                else i = c[((c[((c[(i + 16) >> 2] | 0) + 112) >> 2] | 0) + 8) >> 2] | 0;
+                if ((i | 0) == (c[a >> 2] | 0) ? (jz(c[(n + 32) >> 2] | 0) | 0) >= 1 : 0) {
+                  l = +h[(n + 16) >> 3];
+                  m = l * u;
+                  do
+                    if (!x)
+                      if ((c[s >> 2] | 0) == 1) {
+                        g = +h[w >> 3];
+                        break;
+                      } else {
+                        g = g + v + m;
+                        break;
+                      }
+                    else {
+                      if (g != 0.0) g = (c[s >> 2] | 0) == 2 ? 3.141592653589793 : m + g;
+                      j = g;
+                      k = k < 0.0 ? g : k;
+                    }
+                  while (0);
+                  G = +E(+g) * f;
+                  D = +F(+g) * f;
+                  $y(n, G, D, +az(n, G, D, g));
+                  g = (x ? (l + e) * u : m + v) + g;
+                  o = (o + 1) | 0;
+                  i = o;
+                  l = (o | 0) == (t | 0) ? g : p;
+                } else {
+                  i = o;
+                  l = p;
+                }
+                n = (n + 4) | 0;
+                o = i;
+                p = l;
+              }
+              f = r ? q : y;
+              if ((d | 0) > 1 ? ((C = c[a >> 2] | 0), (C | 0) == (c[(b + 44) >> 2] | 0)) : 0)
+                h[((c[((c[(C + 16) >> 2] | 0) + 112) >> 2] | 0) + 24) >> 3] = p;
+              h[z >> 3] = f;
+              h[A >> 3] = k;
+              h[B >> 3] = j;
+              return;
+            }
+            function $y(a, b, d, e) {
+              a = a | 0;
+              b = +b;
+              d = +d;
+              e = +e;
+              var f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0.0;
+              m = c[(a + 8) >> 2] | 0;
+              n = e != 0.0;
+              f = jC(m) | 0;
+              while (1) {
+                if (!f) break;
+                k = c[((c[(f + 16) >> 2] | 0) + 132) >> 2] | 0;
+                i = +h[k >> 3];
+                l = (k + 8) | 0;
+                g = +h[l >> 3];
+                if (n) {
+                  o = +E(+e);
+                  p = +F(+e);
+                  j = o * i - p * g;
+                  g = p * i + o * g;
+                } else j = i;
+                h[k >> 3] = j + b;
+                h[l >> 3] = g + d;
+                f = kC(m, f) | 0;
+              }
+              f = (a + 36) | 0;
+              while (1) {
+                f = c[f >> 2] | 0;
+                if (!f) break;
+                $y(f, b, d, e);
+                f = (f + 4) | 0;
+              }
+              return;
+            }
+            function az(a, b, d, e) {
+              a = a | 0;
+              b = +b;
+              d = +d;
+              e = +e;
+              var f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0.0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              m = c[(a + 8) >> 2] | 0;
+              f = +h[(a + 48) >> 3];
+              do
+                if (!(f >= 0.0)) {
+                  if ((jz(c[(a + 32) >> 2] | 0) | 0) == 2) {
+                    f = e + -1.5707963267948966;
+                    break;
+                  }
+                  l = c[a >> 2] | 0;
+                  n = (l + 16) | 0;
+                  i = c[((c[n >> 2] | 0) + 132) >> 2] | 0;
+                  f = +h[i >> 3] + b;
+                  k = +h[(i + 8) >> 3] + d;
+                  f = k * k + f * f;
+                  i = jC(m) | 0;
+                  g = l;
+                  while (1) {
+                    if (!i) break;
+                    if (
+                      (i | 0) != (l | 0)
+                        ? ((o = c[((c[(i + 16) >> 2] | 0) + 132) >> 2] | 0),
+                          (j = +h[o >> 3] + b),
+                          (k = +h[(o + 8) >> 3] + d),
+                          (j = k * k + j * j),
+                          j < f)
+                        : 0
+                    ) {
+                      f = j;
+                      g = i;
+                    }
+                    i = kC(m, i) | 0;
+                  }
+                  if ((l | 0) != (g | 0)) {
+                    j = +h[(a + 24) >> 3];
+                    k = +h[(a + 16) >> 3] - j;
+                    g = c[n >> 2] | 0;
+                    i = c[(g + 132) >> 2] | 0;
+                    f = +h[i >> 3];
+                    if (f > -k ? ((c[(a + 56) >> 2] & 1) | 0) != 0 : 0) {
+                      d = +C(+(d * d + b * b));
+                      b = +K(+(+h[(i + 8) >> 3]), +(f + k));
+                      f = +E(+b);
+                      f = e + 1.5707963267948966 - b - +I(+(((k - j / f) / d) * f));
+                      break;
+                    } else {
+                      f = +K(+(+h[(i + 8) >> 3]), +f);
+                      f = e + 3.141592653589793 - f - +h[((c[(g + 112) >> 2] | 0) + 24) >> 3];
+                      f = f > 6.283185307179586 ? f + -6.283185307179586 : f;
+                      break;
+                    }
+                  } else f = 0.0;
+                } else {
+                  f = 3.141592653589793 - f + e;
+                  f = f < 0.0 ? f + 6.283185307179586 : f;
+                }
+              while (0);
+              return +f;
+            }
+            function bz() {
+              return JK(12) | 0;
+            }
+            function cz(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              if (a | 0) {
+                b = c[a >> 2] | 0;
+                while (1) {
+                  if (!b) break;
+                  d = c[(b + 4) >> 2] | 0;
+                  U1(b);
+                  b = d;
+                }
+                U1(a);
+              }
+              return;
+            }
+            function dz(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              f = ez(d) | 0;
+              d = (a + 8) | 0;
+              c[d >> 2] = (c[d >> 2] | 0) + 1;
+              d = (a + 4) | 0;
+              e = c[d >> 2] | 0;
+              if (((b | 0) == 0) | ((e | 0) == (b | 0))) {
+                c[(e | 0 ? (e + 4) | 0 : a) >> 2] = f;
+                c[(f + 8) >> 2] = e;
+                e = 0;
+              } else {
+                e = (b + 4) | 0;
+                d = c[e >> 2] | 0;
+                c[e >> 2] = f;
+                c[(f + 8) >> 2] = b;
+                e = d;
+                d = (d + 8) | 0;
+              }
+              c[d >> 2] = f;
+              c[(f + 4) >> 2] = e;
+              return;
+            }
+            function ez(a) {
+              a = a | 0;
+              var b = 0;
+              b = JK(12) | 0;
+              c[b >> 2] = a;
+              return b | 0;
+            }
+            function fz(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              b = c[a >> 2] | 0;
+              d = b;
+              while (1) {
+                if (!b) break;
+                g = (b + 4) | 0;
+                e = c[g >> 2] | 0;
+                f = (b + 8) | 0;
+                c[g >> 2] = c[f >> 2];
+                c[f >> 2] = e;
+                b = e;
+              }
+              f = (a + 4) | 0;
+              g = c[f >> 2] | 0;
+              c[f >> 2] = d;
+              c[a >> 2] = g;
+              return a | 0;
+            }
+            function gz(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              d = c[a >> 2] | 0;
+              if ((d | 0) != (b | 0)) {
+                f = (b + 8) | 0;
+                e = c[f >> 2] | 0;
+                c[a >> 2] = b;
+                c[f >> 2] = 0;
+                b = (a + 4) | 0;
+                a = c[b >> 2] | 0;
+                c[(a + 4) >> 2] = d;
+                c[(d + 8) >> 2] = a;
+                c[b >> 2] = e;
+                c[(e + 4) >> 2] = 0;
+              }
+              return;
+            }
+            function hz(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              d = bz() | 0;
+              e = (d + 4) | 0;
+              b = 0;
+              while (1) {
+                a = c[a >> 2] | 0;
+                if (!a) break;
+                dz(d, b, c[a >> 2] | 0);
+                b = c[e >> 2] | 0;
+                a = (a + 4) | 0;
+              }
+              return d | 0;
+            }
+            function iz(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              f = a;
+              while (1) {
+                j = c[f >> 2] | 0;
+                if (!j) {
+                  k = 6;
+                  break;
+                }
+                if ((c[j >> 2] | 0) == (b | 0)) break;
+                f = (j + 4) | 0;
+              }
+              if ((k | 0) == 6) qa(96270, 96277, 217, 96288);
+              i = (j + 8) | 0;
+              f = c[i >> 2] | 0;
+              g = (j + 4) | 0;
+              b = c[g >> 2] | 0;
+              c[(f | 0 ? (f + 4) | 0 : a) >> 2] = b;
+              h = (a + 4) | 0;
+              c[(b | 0 ? (b + 8) | 0 : h) >> 2] = f;
+              b = 0;
+              f = a;
+              while (1) {
+                f = c[f >> 2] | 0;
+                if (!f) break;
+                if ((c[f >> 2] | 0) == (d | 0)) {
+                  k = 9;
+                  break;
+                }
+                b = f;
+                f = (f + 4) | 0;
+              }
+              if ((k | 0) == 9) {
+                do
+                  if (!e)
+                    if ((f | 0) == (c[a >> 2] | 0)) {
+                      c[a >> 2] = j;
+                      c[g >> 2] = f;
+                      c[i >> 2] = 0;
+                      f = (f + 8) | 0;
+                      break;
+                    } else {
+                      c[(b + 4) >> 2] = j;
+                      c[i >> 2] = b;
+                      c[g >> 2] = f;
+                      f = (f + 8) | 0;
+                      break;
+                    }
+                  else if ((f | 0) == (c[h >> 2] | 0)) {
+                    c[h >> 2] = j;
+                    c[g >> 2] = 0;
+                    c[i >> 2] = f;
+                    f = (f + 4) | 0;
+                    break;
+                  } else {
+                    c[i >> 2] = f;
+                    f = (f + 4) | 0;
+                    c[g >> 2] = c[f >> 2];
+                    c[((c[f >> 2] | 0) + 8) >> 2] = j;
+                    break;
+                  }
+                while (0);
+                c[f >> 2] = j;
+              }
+              return;
+            }
+            function jz(a) {
+              a = a | 0;
+              return c[(a + 8) >> 2] | 0;
+            }
+            function kz(a, b) {
+              a = a | 0;
+              b = b | 0;
+              lz(a, fz(b) | 0);
+              U1(b);
+              return;
+            }
+            function lz(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              d = c[b >> 2] | 0;
+              if (d | 0) {
+                e = (a + 4) | 0;
+                f = c[e >> 2] | 0;
+                c[(f + 4) >> 2] = d;
+                c[(d + 8) >> 2] = f;
+                c[e >> 2] = c[(b + 4) >> 2];
+                d = (a + 8) | 0;
+                c[d >> 2] = (c[d >> 2] | 0) + (c[(b + 8) >> 2] | 0);
+              }
+              return;
+            }
+            function mz(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = +d;
+              var e = 0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0.0;
+              m = c[(b + 8) >> 2] | 0;
+              nz(a, b);
+              l = oz(m) | 0;
+              a = qz(pz(l) | 0) | 0;
+              rz(m, a);
+              m = sz(a, m) | 0;
+              a = jz(m) | 0;
+              j = +tz(m);
+              k = (a | 0) == 1;
+              f = +(a | 0);
+              i = f * 0.15915494309189535 * (j + d);
+              g = k ? 0.0 : i;
+              a = m;
+              while (1) {
+                a = c[a >> 2] | 0;
+                if (!a) break;
+                if ((c[((c[((c[((c[a >> 2] | 0) + 16) >> 2] | 0) + 112) >> 2] | 0) + 4) >> 2] & 8) | 0) {
+                  e = 4;
+                  break;
+                }
+                a = (a + 4) | 0;
+              }
+              if ((e | 0) == 4) gz(m, a);
+              d = 1.0 / f;
+              e = 0;
+              a = m;
+              while (1) {
+                a = c[a >> 2] | 0;
+                if (!a) break;
+                n = ((c[a >> 2] | 0) + 16) | 0;
+                c[((c[((c[n >> 2] | 0) + 112) >> 2] | 0) + 16) >> 2] = e;
+                h[((c[((c[n >> 2] | 0) + 112) >> 2] | 0) + 24) >> 3] = 0.0;
+                f = 6.283185307179586 * d * +(e | 0);
+                o = +E(+f) * g;
+                n = c[((c[n >> 2] | 0) + 132) >> 2] | 0;
+                h[n >> 3] = o;
+                h[(n + 8) >> 3] = +F(+f) * g;
+                e = (e + 1) | 0;
+                a = (a + 4) | 0;
+              }
+              o = k ? j * 0.5 : i;
+              h[(b + 16) >> 3] = o;
+              h[(b + 24) >> 3] = o;
+              h[(b + 48) >> 3] = -1.0;
+              sB(l) | 0;
+              return m | 0;
+            }
+            function nz(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              f = c[(b + 8) >> 2] | 0;
+              d = jC(f) | 0;
+              while (1) {
+                if (!d) break;
+                e = XA(a, d) | 0;
+                while (1) {
+                  if (!e) break;
+                  if (
+                    (c[
+                      ((c[
+                        ((c[((c[((((c[e >> 2] & 3) | 0) == 2 ? e : (e + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                          112) >>
+                          2
+                      ] |
+                        0) +
+                        12) >>
+                        2
+                    ] |
+                      0) ==
+                    (b | 0)
+                  )
+                    mB(f, e, 1) | 0;
+                  e = ZA(a, e) | 0;
+                }
+                d = kC(f, d) | 0;
+              }
+              return;
+            }
+            function oz(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 16) | 0;
+              g = k;
+              f = zz(a, g) | 0;
+              g = c[g >> 2] | 0;
+              i = tB(g) | 0;
+              h = Az(g) | 0;
+              i = (i + -3) | 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (i | 0)) break;
+                j = Jz(h) | 0;
+                d = aB(g, j) | 0;
+                while (1) {
+                  if (!d) break;
+                  b = c[d >> 2] & 3;
+                  a = c[(((b | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0;
+                  if ((j | 0) == (a | 0)) a = c[(((b | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0;
+                  Iz(h, a);
+                  d = bB(g, d, j) | 0;
+                }
+                Bz(g, j, f);
+                d = aB(g, j) | 0;
+                while (1) {
+                  if (!d) break;
+                  b = c[d >> 2] & 3;
+                  a = c[(((b | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0;
+                  if ((j | 0) == (a | 0)) a = c[(((b | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0;
+                  b = ((c[(a + 16) >> 2] | 0) + 236) | 0;
+                  c[b >> 2] = (c[b >> 2] | 0) + -1;
+                  Hz(h, a);
+                  d = bB(g, d, j) | 0;
+                }
+                wC(g, j) | 0;
+                e = (e + 1) | 0;
+              }
+              sB(g) | 0;
+              Gz(h);
+              l = k;
+              return f | 0;
+            }
+            function pz(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              f = l;
+              l = (l + 144) | 0;
+              b = f;
+              e = (f + 8) | 0;
+              d = c[46933] | 0;
+              c[46933] = d + 1;
+              c[b >> 2] = d;
+              m4(e, 96303, b) | 0;
+              e = ND(a, e, 1) | 0;
+              TC(e, 137483, 280, 1) | 0;
+              b = jC(a) | 0;
+              while (1) {
+                if (!b) break;
+                oC(e, b, 1) | 0;
+                d = (b + 16) | 0;
+                c[((c[((c[d >> 2] | 0) + 112) >> 2] | 0) + 16 + 12) >> 2] = 0;
+                c[((c[((c[d >> 2] | 0) + 112) >> 2] | 0) + 32) >> 2] = 0;
+                d = ((c[((c[d >> 2] | 0) + 112) >> 2] | 0) + 4) | 0;
+                c[d >> 2] = c[d >> 2] & -2;
+                b = kC(a, b) | 0;
+              }
+              b = jC(a) | 0;
+              while (1) {
+                if (!b) break;
+                d = c[((c[(b + 16) >> 2] | 0) + 112) >> 2] | 0;
+                if (!(c[(d + 4) >> 2] & 1)) {
+                  c[(d + 16) >> 2] = 0;
+                  yz(a, b, e);
+                }
+                b = kC(a, b) | 0;
+              }
+              l = f;
+              return e | 0;
+            }
+            function qz(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              if ((tB(a) | 0) != 1) {
+                d = jC(a) | 0;
+                while (1) {
+                  if (!d) break;
+                  b = 0;
+                  e = aB(a, d) | 0;
+                  while (1) {
+                    if (!e) break;
+                    b = (b + 1) | 0;
+                    e = bB(a, e, d) | 0;
+                  }
+                  if ((b | 0) == 1) xz(d, d, 0, 0);
+                  d = kC(a, d) | 0;
+                }
+                b = 0;
+                f = 0;
+                d = jC(a) | 0;
+                while (1) {
+                  if (!d) break;
+                  g = c[((c[(d + 16) >> 2] | 0) + 112) >> 2] | 0;
+                  g = ((c[(g + 32) >> 2] | 0) + (c[(g + 16 + 12) >> 2] | 0)) | 0;
+                  e = (g | 0) > (b | 0);
+                  b = e ? g : b;
+                  f = e ? d : f;
+                  d = kC(a, d) | 0;
+                }
+                b = bz() | 0;
+                e = (f + 16) | 0;
+                d = ((c[((c[e >> 2] | 0) + 112) >> 2] | 0) + 16 + 4) | 0;
+                while (1) {
+                  d = c[d >> 2] | 0;
+                  if ((d | 0) == (f | 0)) break;
+                  dz(b, 0, d);
+                  d = c[((c[(d + 16) >> 2] | 0) + 112) >> 2] | 0;
+                  g = (d + 4) | 0;
+                  c[g >> 2] = c[g >> 2] | 16;
+                  d = (d + 16) | 0;
+                }
+                dz(b, 0, f);
+                g = c[((c[e >> 2] | 0) + 112) >> 2] | 0;
+                a = (g + 4) | 0;
+                c[a >> 2] = c[a >> 2] | 16;
+                if (c[(g + 32) >> 2] | 0) {
+                  a = bz() | 0;
+                  d = ((c[((c[e >> 2] | 0) + 112) >> 2] | 0) + 24) | 0;
+                  while (1) {
+                    d = c[d >> 2] | 0;
+                    if ((d | 0) == (f | 0)) break;
+                    dz(a, 0, d);
+                    d = c[((c[(d + 16) >> 2] | 0) + 112) >> 2] | 0;
+                    g = (d + 4) | 0;
+                    c[g >> 2] = c[g >> 2] | 16;
+                    d = (d + 16) | 0;
+                  }
+                  kz(b, a);
+                }
+              } else {
+                b = bz() | 0;
+                g = jC(a) | 0;
+                dz(b, 0, g);
+                g = ((c[((c[(g + 16) >> 2] | 0) + 112) >> 2] | 0) + 4) | 0;
+                c[g >> 2] = c[g >> 2] | 16;
+              }
+              return b | 0;
+            }
+            function rz(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = jC(a) | 0;
+              while (1) {
+                if (!d) break;
+                if (!(c[((c[((c[(d + 16) >> 2] | 0) + 112) >> 2] | 0) + 4) >> 2] & 16)) wz(a, d, b);
+                d = kC(a, d) | 0;
+              }
+              return;
+            }
+            function sz(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              g = l;
+              l = (l + 16) | 0;
+              f = g;
+              d = uz(a, b) | 0;
+              c[f >> 2] = d;
+              a: do
+                if (d) {
+                  e = 0;
+                  while (1) {
+                    if ((e | 0) >= 10) break a;
+                    a = vz(a, b, f) | 0;
+                    h = d;
+                    d = c[f >> 2] | 0;
+                    if (((h | 0) == (d | 0)) | ((d | 0) == 0)) break;
+                    else e = (e + 1) | 0;
+                  }
+                }
+              while (0);
+              l = g;
+              return a | 0;
+            }
+            function tz(a) {
+              a = a | 0;
+              var b = 0.0,
+                d = 0.0,
+                e = 0.0,
+                f = 0;
+              b = 0.0;
+              while (1) {
+                a = c[a >> 2] | 0;
+                if (!a) break;
+                f = c[((c[c[((c[((c[a >> 2] | 0) + 16) >> 2] | 0) + 112) >> 2] >> 2] | 0) + 16) >> 2] | 0;
+                d = +h[(f + 32) >> 3];
+                d = d > b ? d : b;
+                e = +h[(f + 40) >> 3];
+                b = e > d ? e : d;
+                a = (a + 4) | 0;
+              }
+              return +b;
+            }
+            function uz(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              k = Kz() | 0;
+              e = jC(b) | 0;
+              while (1) {
+                if (!e) break;
+                d = XA(b, e) | 0;
+                while (1) {
+                  if (!d) break;
+                  c[c[((c[(d + 16) >> 2] | 0) + 120) >> 2] >> 2] = 0;
+                  d = ZA(b, d) | 0;
+                }
+                e = kC(b, e) | 0;
+              }
+              j = 1;
+              d = 0;
+              while (1) {
+                h = c[a >> 2] | 0;
+                if (!h) break;
+                i = c[h >> 2] | 0;
+                g = aB(b, i) | 0;
+                while (1) {
+                  if (!g) break;
+                  f = (g + 16) | 0;
+                  if ((c[c[((c[f >> 2] | 0) + 120) >> 2] >> 2] | 0) > 0) {
+                    a = nb[c[k >> 2] & 63](k, 0, 128) | 0;
+                    while (1) {
+                      if (!a) break;
+                      e = c[(a + 8) >> 2] | 0;
+                      if (
+                        (c[c[((c[(e + 16) >> 2] | 0) + 120) >> 2] >> 2] | 0) >
+                        (c[c[((c[f >> 2] | 0) + 120) >> 2] >> 2] | 0)
+                          ? ((l = c[e >> 2] & 3), (c[(((l | 0) == 2 ? e : (e + -48) | 0) + 40) >> 2] | 0) != (i | 0))
+                          : 0
+                      )
+                        d = (d + (((c[(((l | 0) == 3 ? e : (e + 48) | 0) + 40) >> 2] | 0) != (i | 0)) & 1)) | 0;
+                      a = nb[c[k >> 2] & 63](k, a, 8) | 0;
+                    }
+                    Qz(k, g);
+                  }
+                  g = bB(b, g, i) | 0;
+                }
+                e = aB(b, i) | 0;
+                while (1) {
+                  if (!e) break;
+                  a = c[((c[(e + 16) >> 2] | 0) + 120) >> 2] | 0;
+                  if (!(c[a >> 2] | 0)) {
+                    c[a >> 2] = j;
+                    Pz(k, e);
+                  }
+                  e = bB(b, e, i) | 0;
+                }
+                a = (h + 4) | 0;
+                j = (j + 1) | 0;
+              }
+              Oz(k);
+              return d | 0;
+            }
+            function vz(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              e = c[d >> 2] | 0;
+              k = jC(b) | 0;
+              a: while (1) {
+                if (!k) break;
+                j = aB(b, k) | 0;
+                while (1) {
+                  if (!j) break;
+                  g = c[j >> 2] & 3;
+                  f = c[(((g | 0) == 3 ? j : (j + 48) | 0) + 40) >> 2] | 0;
+                  if ((f | 0) == (k | 0)) f = c[(((g | 0) == 2 ? j : (j + -48) | 0) + 40) >> 2] | 0;
+                  i = 0;
+                  while (1) {
+                    if ((i | 0) >= 2) break;
+                    h = hz(a) | 0;
+                    iz(a, k, f, i);
+                    g = uz(a, b) | 0;
+                    if ((g | 0) < (e | 0)) {
+                      cz(h);
+                      if (!g) {
+                        e = 0;
+                        break a;
+                      } else e = g;
+                    } else {
+                      cz(a);
+                      a = h;
+                    }
+                    i = (i + 1) | 0;
+                  }
+                  j = bB(b, j, k) | 0;
+                }
+                k = kC(b, k) | 0;
+              }
+              c[d >> 2] = e;
+              return a | 0;
+            }
+            function wz(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = bz() | 0;
+              e = XA(a, b) | 0;
+              while (1) {
+                if (!e) break;
+                f = (e + -48) | 0;
+                dz(h, 0, c[((((c[e >> 2] & 3) | 0) == 2 ? e : f) + 40) >> 2] | 0);
+                f =
+                  ((c[((c[((c[((((c[e >> 2] & 3) | 0) == 2 ? e : f) + 40) >> 2] | 0) + 16) >> 2] | 0) + 112) >> 2] |
+                    0) +
+                    4) |
+                  0;
+                c[f >> 2] = c[f >> 2] | 32;
+                e = ZA(a, e) | 0;
+              }
+              e = _A(a, b) | 0;
+              while (1) {
+                if (!e) break;
+                f = (e + 48) | 0;
+                dz(h, 0, c[((((c[e >> 2] & 3) | 0) == 3 ? e : f) + 40) >> 2] | 0);
+                f =
+                  ((c[((c[((c[((((c[e >> 2] & 3) | 0) == 3 ? e : f) + 40) >> 2] | 0) + 16) >> 2] | 0) + 112) >> 2] |
+                    0) +
+                    4) |
+                  0;
+                c[f >> 2] = c[f >> 2] | 32;
+                e = $A(a, e) | 0;
+              }
+              a: do
+                if ((jz(h) | 0) > 1) {
+                  f = (d + 4) | 0;
+                  a = d;
+                  while (1) {
+                    e = c[a >> 2] | 0;
+                    if (!e) {
+                      g = 13;
+                      break a;
+                    }
+                    a = (e + 4) | 0;
+                    if (!(c[((c[((c[((c[e >> 2] | 0) + 16) >> 2] | 0) + 112) >> 2] | 0) + 4) >> 2] & 32)) continue;
+                    if (
+                      (c[
+                        ((c[
+                          ((c[((c[c[((e | 0) == (c[f >> 2] | 0) ? d : a) >> 2] >> 2] | 0) + 16) >> 2] | 0) + 112) >> 2
+                        ] |
+                          0) +
+                          4) >>
+                          2
+                      ] &
+                        32) |
+                      0
+                    )
+                      break;
+                  }
+                  dz(d, e, b);
+                } else g = 13;
+              while (0);
+              b: do
+                if ((g | 0) == 13) {
+                  c: do
+                    if ((jz(h) | 0) > 0) {
+                      e = d;
+                      while (1) {
+                        e = c[e >> 2] | 0;
+                        if (!e) break c;
+                        if ((c[((c[((c[((c[e >> 2] | 0) + 16) >> 2] | 0) + 112) >> 2] | 0) + 4) >> 2] & 32) | 0) break;
+                        e = (e + 4) | 0;
+                      }
+                      dz(d, e, b);
+                      break b;
+                    }
+                  while (0);
+                  dz(d, 0, b);
+                }
+              while (0);
+              e = h;
+              while (1) {
+                e = c[e >> 2] | 0;
+                if (!e) break;
+                d = ((c[((c[((c[e >> 2] | 0) + 16) >> 2] | 0) + 112) >> 2] | 0) + 4) | 0;
+                c[d >> 2] = c[d >> 2] & -33;
+                e = (e + 4) | 0;
+              }
+              cz(h);
+              return;
+            }
+            function xz(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              while (1) {
+                g = c[((c[((c[(b + 16) >> 2] | 0) + 112) >> 2] | 0) + 16) >> 2] | 0;
+                if (!g) break;
+                h = (d + 1) | 0;
+                i = (g + 16) | 0;
+                j = c[((c[i >> 2] | 0) + 112) >> 2] | 0;
+                b = (j + 16) | 0;
+                f = c[(b + 12) >> 2] | 0;
+                if (f) {
+                  if ((f | 0) > (d | 0)) {
+                    k = 11;
+                    break;
+                  }
+                  b = c[(b + 4) >> 2] | 0;
+                  f = b;
+                  if ((b | 0) == (e | 0)) b = j;
+                  else {
+                    d = (j + 24) | 0;
+                    if (!((c[(j + 32) >> 2] | 0) != 0 ? (c[d >> 2] | 0) == (e | 0) : 0)) e = b;
+                    c[d >> 2] = f;
+                    b = c[((c[i >> 2] | 0) + 112) >> 2] | 0;
+                    c[(b + 32) >> 2] = c[(b + 16 + 12) >> 2];
+                    b = c[((c[i >> 2] | 0) + 112) >> 2] | 0;
+                  }
+                  b = (b + 16) | 0;
+                }
+                c[(b + 4) >> 2] = a;
+                c[((c[((c[i >> 2] | 0) + 112) >> 2] | 0) + 16 + 12) >> 2] = h;
+                b = g;
+                d = h;
+              }
+              if ((k | 0) == 11 ? (c[(j + 32) >> 2] | 0) <= (d | 0) : 0) {
+                c[(j + 24) >> 2] = a;
+                c[((c[((c[i >> 2] | 0) + 112) >> 2] | 0) + 32) >> 2] = h;
+              }
+              return;
+            }
+            function yz(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              g = ((c[((c[(b + 16) >> 2] | 0) + 112) >> 2] | 0) + 4) | 0;
+              c[g >> 2] = c[g >> 2] | 1;
+              g = aB(a, b) | 0;
+              while (1) {
+                if (!g) break;
+                f = c[g >> 2] & 3;
+                e = c[(((f | 0) == 2 ? g : (g + -48) | 0) + 40) >> 2] | 0;
+                if ((e | 0) == (b | 0)) e = c[(((f | 0) == 3 ? g : (g + 48) | 0) + 40) >> 2] | 0;
+                f = (e + 16) | 0;
+                if (!(c[((c[((c[f >> 2] | 0) + 112) >> 2] | 0) + 4) >> 2] & 1)) {
+                  mB(d, g, 1) | 0;
+                  c[((c[((c[f >> 2] | 0) + 112) >> 2] | 0) + 16) >> 2] = b;
+                  yz(a, e, d);
+                }
+                g = bB(a, g, b) | 0;
+              }
+              return;
+            }
+            function zz(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              k = l;
+              l = (l + 144) | 0;
+              j = (k + 8) | 0;
+              i = k;
+              e = (k + 16) | 0;
+              h = c[46934] | 0;
+              c[46934] = h + 1;
+              c[i >> 2] = h;
+              m4(e, 96312, i) | 0;
+              i = ND(b, e, 1) | 0;
+              TC(i, 137483, 280, 1) | 0;
+              h = c[46934] | 0;
+              c[46934] = h + 1;
+              c[j >> 2] = h;
+              m4(e, 96312, j) | 0;
+              h = (b + 24) | 0;
+              a[j >> 0] = a[h >> 0] | 0;
+              a[(j + 1) >> 0] = a[(h + 1) >> 0] | 0;
+              a[(j + 2) >> 0] = a[(h + 2) >> 0] | 0;
+              a[(j + 3) >> 0] = a[(h + 3) >> 0] | 0;
+              j = oB(e, j, 0) | 0;
+              e = jC(b) | 0;
+              while (1) {
+                if (!e) break;
+                oC(i, e, 1) | 0;
+                h = tC(j, KB(e) | 0, 1) | 0;
+                TC(h, 137447, 304, 1) | 0;
+                c[((c[((c[(e + 16) >> 2] | 0) + 112) >> 2] | 0) + 16) >> 2] = h;
+                e = kC(b, e) | 0;
+              }
+              f = jC(b) | 0;
+              while (1) {
+                if (!f) break;
+                g = c[((c[((c[(f + 16) >> 2] | 0) + 112) >> 2] | 0) + 16) >> 2] | 0;
+                h = (g + 16) | 0;
+                e = XA(b, f) | 0;
+                while (1) {
+                  if (!e) break;
+                  mB(i, e, 1) | 0;
+                  m =
+                    c[
+                      ((c[
+                        ((c[((c[((((c[e >> 2] & 3) | 0) == 2 ? e : (e + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                          112) >>
+                          2
+                      ] |
+                        0) +
+                        16) >>
+                        2
+                    ] | 0;
+                  n = iB(j, g, m, 0, 1) | 0;
+                  TC(n, 137460, 176, 1) | 0;
+                  c[((c[(n + 16) >> 2] | 0) + 116) >> 2] = e;
+                  n = ((c[h >> 2] | 0) + 236) | 0;
+                  c[n >> 2] = (c[n >> 2] | 0) + 1;
+                  m = ((c[(m + 16) >> 2] | 0) + 236) | 0;
+                  c[m >> 2] = (c[m >> 2] | 0) + 1;
+                  e = ZA(b, e) | 0;
+                }
+                f = kC(b, f) | 0;
+              }
+              c[d >> 2] = j;
+              l = k;
+              return i | 0;
+            }
+            function Az(a) {
+              a = a | 0;
+              var b = 0,
+                c = 0;
+              c = Cz() | 0;
+              b = jC(a) | 0;
+              while (1) {
+                if (!b) break;
+                Hz(c, b);
+                b = kC(a, b) | 0;
+              }
+              return c | 0;
+            }
+            function Bz(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              m = c[((c[(b + 16) >> 2] | 0) + 236) >> 2] | 0;
+              p = m << 2;
+              o = KK(p) | 0;
+              p = KK(p) | 0;
+              i = 0;
+              l = aB(a, b) | 0;
+              n = 0;
+              f = 0;
+              while (1) {
+                if (!l) break;
+                e = c[l >> 2] & 3;
+                g = c[(((e | 0) == 2 ? l : (l + -48) | 0) + 40) >> 2] | 0;
+                if ((g | 0) == (b | 0)) g = c[(((e | 0) == 3 ? l : (l + 48) | 0) + 40) >> 2] | 0;
+                h = 0;
+                k = aB(a, b) | 0;
+                j = i;
+                while (1) {
+                  if (!k) break;
+                  if ((k | 0) != (l | 0)) {
+                    i = c[k >> 2] & 3;
+                    e = c[(((i | 0) == 2 ? k : (k + -48) | 0) + 40) >> 2] | 0;
+                    if ((e | 0) == (b | 0)) e = c[(((i | 0) == 3 ? k : (k + 48) | 0) + 40) >> 2] | 0;
+                    i = iB(a, g, e, 0, 0) | 0;
+                    if (i)
+                      if (g >>> 0 < e >>> 0) {
+                        e = (j + 1) | 0;
+                        h = (i + 16) | 0;
+                        i = c[((c[h >> 2] | 0) + 116) >> 2] | 0;
+                        if (!i) h = 1;
+                        else {
+                          wC(d, i) | 0;
+                          c[((c[h >> 2] | 0) + 116) >> 2] = 0;
+                          h = 1;
+                        }
+                      } else {
+                        h = 1;
+                        e = j;
+                      }
+                    else e = j;
+                  } else e = j;
+                  k = bB(a, k, b) | 0;
+                  j = e;
+                }
+                if (!h) {
+                  c[(p + (n << 2)) >> 2] = g;
+                  e = (n + 1) | 0;
+                } else {
+                  c[(o + (f << 2)) >> 2] = g;
+                  e = n;
+                  f = (f + 1) | 0;
+                }
+                i = j;
+                l = bB(a, l, b) | 0;
+                n = e;
+              }
+              e = (m + -1 - i) | 0;
+              a: do
+                if ((e | 0) > 0) {
+                  if ((e | 0) < (n | 0)) g = 0;
+                  else {
+                    if ((e | 0) != (n | 0)) break;
+                    f = c[o >> 2] | 0;
+                    g = (f + 16) | 0;
+                    e = 0;
+                    while (1) {
+                      if ((e | 0) >= (n | 0)) break a;
+                      m = c[(p + (e << 2)) >> 2] | 0;
+                      TC(iB(a, f, m, 0, 1) | 0, 137460, 176, 1) | 0;
+                      d = ((c[g >> 2] | 0) + 236) | 0;
+                      c[d >> 2] = (c[d >> 2] | 0) + 1;
+                      m = ((c[(m + 16) >> 2] | 0) + 236) | 0;
+                      c[m >> 2] = (c[m >> 2] | 0) + 1;
+                      e = (e + 1) | 0;
+                    }
+                  }
+                  while (1) {
+                    if ((g | 0) >= (n | 0)) {
+                      f = 2;
+                      break;
+                    }
+                    f = g | 1;
+                    if ((f | 0) >= (n | 0)) {
+                      f = 2;
+                      break;
+                    }
+                    d = c[(p + (g << 2)) >> 2] | 0;
+                    m = c[(p + (f << 2)) >> 2] | 0;
+                    TC(iB(a, d, m, 0, 1) | 0, 137460, 176, 1) | 0;
+                    d = ((c[(d + 16) >> 2] | 0) + 236) | 0;
+                    c[d >> 2] = (c[d >> 2] | 0) + 1;
+                    m = ((c[(m + 16) >> 2] | 0) + 236) | 0;
+                    c[m >> 2] = (c[m >> 2] | 0) + 1;
+                    g = (g + 2) | 0;
+                    e = (e + -1) | 0;
+                  }
+                  while (1) {
+                    if ((e | 0) <= 0) break a;
+                    m = c[p >> 2] | 0;
+                    n = c[(p + (f << 2)) >> 2] | 0;
+                    TC(iB(a, m, n, 0, 1) | 0, 137460, 176, 1) | 0;
+                    m = ((c[(m + 16) >> 2] | 0) + 236) | 0;
+                    c[m >> 2] = (c[m >> 2] | 0) + 1;
+                    n = ((c[(n + 16) >> 2] | 0) + 236) | 0;
+                    c[n >> 2] = (c[n >> 2] | 0) + 1;
+                    f = (f + 1) | 0;
+                    e = (e + -1) | 0;
+                  }
+                }
+              while (0);
+              U1(p);
+              U1(o);
+              return;
+            }
+            function Cz() {
+              return Vz(18240, c[4581] | 0) | 0;
+            }
+            function Dz(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              d = KK(16) | 0;
+              c[(d + 12) >> 2] = 0;
+              c[(d + 8) >> 2] = c[(b + 8) >> 2];
+              return d | 0;
+            }
+            function Ez(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              U1(b);
+              return;
+            }
+            function Fz(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              b = c[b >> 2] | 0;
+              e = c[d >> 2] | 0;
+              return ((b | 0) < (e | 0) ? -1 : ((b | 0) > (e | 0)) & 1) | 0;
+            }
+            function Gz(a) {
+              a = a | 0;
+              Rz(a) | 0;
+              return;
+            }
+            function Hz(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              d = l;
+              l = (l + 16) | 0;
+              f = d;
+              e = (b + 16) | 0;
+              c[(f + 8) >> 2] = c[((c[e >> 2] | 0) + 236) >> 2];
+              a = ((nb[c[a >> 2] & 63](a, f, 1) | 0) + 12) | 0;
+              c[((c[e >> 2] | 0) + 164) >> 2] = c[a >> 2];
+              c[a >> 2] = b;
+              l = d;
+              return;
+            }
+            function Iz(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 16) | 0;
+              g = h;
+              f = (b + 16) | 0;
+              c[(g + 8) >> 2] = c[((c[f >> 2] | 0) + 236) >> 2];
+              g = nb[c[a >> 2] & 63](a, g, 4) | 0;
+              if (!g) qa(96322, 96325, 107, 96335);
+              e = (g + 12) | 0;
+              d = c[e >> 2] | 0;
+              if ((d | 0) == (b | 0)) {
+                b = c[((c[f >> 2] | 0) + 164) >> 2] | 0;
+                c[e >> 2] = b;
+                if (!b) nb[c[a >> 2] & 63](a, g, 2) | 0;
+              } else {
+                do {
+                  a = ((c[(d + 16) >> 2] | 0) + 164) | 0;
+                  d = c[a >> 2] | 0;
+                  e = (d | 0) != 0;
+                } while (e & ((d | 0) != (b | 0)));
+                if (e) c[a >> 2] = c[((c[(d + 16) >> 2] | 0) + 164) >> 2];
+              }
+              l = h;
+              return;
+            }
+            function Jz(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              d = nb[c[a >> 2] & 63](a, 0, 128) | 0;
+              if (d) {
+                f = (d + 12) | 0;
+                b = c[f >> 2] | 0;
+                e = c[((c[(b + 16) >> 2] | 0) + 164) >> 2] | 0;
+                c[f >> 2] = e;
+                if (!e) nb[c[a >> 2] & 63](a, d, 2) | 0;
+              } else b = 0;
+              return b | 0;
+            }
+            function Kz() {
+              return Vz(18276, c[4581] | 0) | 0;
+            }
+            function Lz(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              d = KK(12) | 0;
+              c[(d + 8) >> 2] = c[(b + 8) >> 2];
+              return d | 0;
+            }
+            function Mz(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              U1(b);
+              return;
+            }
+            function Nz(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              b = c[b >> 2] | 0;
+              e = c[d >> 2] | 0;
+              return (b >>> 0 > e >>> 0 ? 1 : ((b >>> 0 < e >>> 0) << 31) >> 31) | 0;
+            }
+            function Oz(a) {
+              a = a | 0;
+              Rz(a) | 0;
+              return;
+            }
+            function Pz(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = l;
+              l = (l + 16) | 0;
+              e = d;
+              c[(e + 8) >> 2] = b;
+              nb[c[a >> 2] & 63](a, e, 1) | 0;
+              l = d;
+              return;
+            }
+            function Qz(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = l;
+              l = (l + 16) | 0;
+              e = d;
+              c[(e + 8) >> 2] = b;
+              nb[c[a >> 2] & 63](a, e, 2) | 0;
+              l = d;
+              return;
+            }
+            function Rz(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              do
+                if ((a | 0) != 0 ? (c[(a + 24) >> 2] | 0) <= 0 : 0) {
+                  h = c[(a + 4) >> 2] | 0;
+                  g = (h + 32) | 0;
+                  b = c[g >> 2] | 0;
+                  if (b) {
+                    b = ob[b & 127](a, 2, 0, h) | 0;
+                    if ((b | 0) < 0) {
+                      b = -1;
+                      break;
+                    }
+                  } else b = 0;
+                  if (c[(a + 28) >> 2] | 0) _z(a, 0) | 0;
+                  f = (b | 0) == 0;
+                  if (f) {
+                    nb[c[c[(a + 16) >> 2] >> 2] & 63](a, 0, 64) | 0;
+                    if ((Xz(a) | 0) > 0) {
+                      b = -1;
+                      break;
+                    }
+                    d = (a + 8) | 0;
+                    b = c[d >> 2] | 0;
+                    if ((c[(b + 12) >> 2] | 0) > 0) {
+                      e = (a + 12) | 0;
+                      ob[c[e >> 2] & 127](a, c[(b + 8) >> 2] | 0, 0, h) | 0;
+                      b = c[d >> 2] | 0;
+                    } else e = (a + 12) | 0;
+                    ob[c[e >> 2] & 127](a, b, 0, h) | 0;
+                  }
+                  b = c[(a + 20) >> 2] | 0;
+                  if (b) {
+                    if (f & ((b | 0) == 1)) ob[c[(a + 12) >> 2] & 127](a, a, 0, h) | 0;
+                  } else U1(a);
+                  b = c[g >> 2] | 0;
+                  if (!b) b = 0;
+                  else {
+                    ob[b & 127](a, 6, 0, h) | 0;
+                    b = 0;
+                  }
+                } else b = -1;
+              while (0);
+              return b | 0;
+            }
+            function Sz(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              e = (a + 8) | 0;
+              b = c[e >> 2] | 0;
+              d = c[b >> 2] | 0;
+              a: do
+                if (!(d & 12)) {
+                  if (!(d & 3)) {
+                    d = (b + 8) | 0;
+                    a = c[d >> 2] | 0;
+                    c[d >> 2] = 0;
+                    break;
+                  }
+                  a = Tz(a) | 0;
+                  d = c[e >> 2] | 0;
+                  b = c[(d + 8) >> 2] | 0;
+                  d = (b + (c[(d + 12) >> 2] << 2)) | 0;
+                  while (1) {
+                    if (b >>> 0 >= d >>> 0) break a;
+                    c[b >> 2] = 0;
+                    b = (b + 4) | 0;
+                  }
+                } else a = c[(b + 4) >> 2] | 0;
+              while (0);
+              e = c[e >> 2] | 0;
+              c[e >> 2] = c[e >> 2] & -4097;
+              c[(e + 16) >> 2] = 0;
+              c[(e + 4) >> 2] = 0;
+              return a | 0;
+            }
+            function Tz(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              g = (a + 8) | 0;
+              a = c[g >> 2] | 0;
+              b = c[a >> 2] | 0;
+              if (!(b & 4096)) {
+                a: do
+                  if (!(b & 3)) {
+                    if ((b & 112) | 0) {
+                      a = c[(a + 8) >> 2] | 0;
+                      break;
+                    }
+                    a = c[(a + 4) >> 2] | 0;
+                    if (!a) a = 0;
+                    else {
+                      while (1) {
+                        b = (a + 4) | 0;
+                        d = c[b >> 2] | 0;
+                        if (!d) {
+                          e = a;
+                          break;
+                        }
+                        c[b >> 2] = c[d >> 2];
+                        c[d >> 2] = a;
+                        a = d;
+                      }
+                      while (1) {
+                        b = c[e >> 2] | 0;
+                        if (!b) break a;
+                        d = c[(b + 4) >> 2] | 0;
+                        if (!d) {
+                          e = b;
+                          continue;
+                        }
+                        while (1) {
+                          c[(b + 4) >> 2] = c[d >> 2];
+                          c[d >> 2] = b;
+                          b = c[(d + 4) >> 2] | 0;
+                          if (!b) break;
+                          else {
+                            f = d;
+                            d = b;
+                            b = f;
+                          }
+                        }
+                        c[e >> 2] = d;
+                        e = d;
+                      }
+                    }
+                  } else {
+                    e = c[(a + 8) >> 2] | 0;
+                    f = (e + (c[(a + 12) >> 2] << 2)) | 0;
+                    b = 0;
+                    a = 0;
+                    while (1) {
+                      if (e >>> 0 >= f >>> 0) break a;
+                      d = c[e >> 2] | 0;
+                      if (d) {
+                        if (!b) {
+                          b = d;
+                          a = d;
+                        } else c[b >> 2] = d;
+                        while (1) {
+                          d = c[b >> 2] | 0;
+                          if (!d) break;
+                          else b = d;
+                        }
+                        c[e >> 2] = b;
+                      }
+                      e = (e + 4) | 0;
+                    }
+                  }
+                while (0);
+                g = c[g >> 2] | 0;
+                c[(g + 4) >> 2] = a;
+                c[g >> 2] = c[g >> 2] | 4096;
+              } else a = c[(a + 4) >> 2] | 0;
+              return a | 0;
+            }
+            function Uz(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0;
+              s = (a + 8) | 0;
+              if ((c[c[s >> 2] >> 2] & 4096) | 0) Wz(a, 0) | 0;
+              r = c[(a + 4) >> 2] | 0;
+              m = c[r >> 2] | 0;
+              n = c[(r + 4) >> 2] | 0;
+              q = (r + 8) | 0;
+              u = c[q >> 2] | 0;
+              o = c[(r + 20) >> 2] | 0;
+              p = (a + 20) | 0;
+              f = c[p >> 2] & -32769;
+              c[p >> 2] = f;
+              a: do
+                if (!b) {
+                  if ((d & 384) | 0) {
+                    f = c[s >> 2] | 0;
+                    e = c[(f + 8) >> 2] | 0;
+                    if (!e) {
+                      e = 0;
+                      break;
+                    }
+                    if (d & 256) {
+                      e = c[(e + 4) >> 2] | 0;
+                      c[(f + 4) >> 2] = e;
+                      if (!e) {
+                        e = 0;
+                        break;
+                      }
+                    } else c[(f + 4) >> 2] = e;
+                    if ((u | 0) < 0) {
+                      e = c[(e + 8) >> 2] | 0;
+                      break;
+                    } else {
+                      e = (e + (0 - u)) | 0;
+                      break;
+                    }
+                  }
+                  if ((d & 4098) | 0) {
+                    e = c[s >> 2] | 0;
+                    if ((c[e >> 2] & 144) | 0) {
+                      e = 0;
+                      break;
+                    }
+                    e = c[(e + 8) >> 2] | 0;
+                    if (!e) {
+                      e = 0;
+                      break;
+                    } else {
+                      h = e;
+                      t = 84;
+                      break;
+                    }
+                  }
+                  if (!(d & 64)) e = 0;
+                  else {
+                    i = (r + 16) | 0;
+                    b: do
+                      if (((c[i >> 2] | 0) != 0) | ((u | 0) < 0)) {
+                        j = (a + 12) | 0;
+                        k = (u | 0) < 0;
+                        f = (0 - u) | 0;
+                        e = c[((c[s >> 2] | 0) + 8) >> 2] | 0;
+                        while (1) {
+                          if (!e) break b;
+                          g = c[e >> 2] | 0;
+                          h = c[i >> 2] | 0;
+                          if (h | 0) {
+                            if (k) b = c[(e + 8) >> 2] | 0;
+                            else b = (e + f) | 0;
+                            vb[h & 127](a, b, r);
+                          }
+                          if ((c[q >> 2] | 0) >= 0) {
+                            e = g;
+                            continue;
+                          }
+                          ob[c[j >> 2] & 127](a, e, 0, r) | 0;
+                          e = g;
+                        }
+                      }
+                    while (0);
+                    e = c[s >> 2] | 0;
+                    c[(e + 4) >> 2] = 0;
+                    c[(e + 8) >> 2] = 0;
+                    c[((c[s >> 2] | 0) + 16) >> 2] = 0;
+                    e = 0;
+                  }
+                } else {
+                  if ((d & 2049) | 0) {
+                    g = (r + 12) | 0;
+                    e = c[g >> 2] | 0;
+                    h = ((d & 1) | 0) == 0;
+                    if (!(h | ((e | 0) == 0))) {
+                      e = nb[e & 63](a, b, r) | 0;
+                      if (!e) {
+                        e = 0;
+                        break;
+                      } else f = e;
+                    } else f = b;
+                    do
+                      if ((u | 0) > -1) h = (f + u) | 0;
+                      else {
+                        e = ob[c[(a + 12) >> 2] & 127](a, 0, 12, r) | 0;
+                        if (e | 0) {
+                          c[(e + 8) >> 2] = f;
+                          h = e;
+                          break;
+                        }
+                        if (!(c[g >> 2] | 0)) {
+                          e = 0;
+                          break a;
+                        }
+                        e = c[(r + 16) >> 2] | 0;
+                        if (h | ((e | 0) == 0)) {
+                          e = 0;
+                          break a;
+                        }
+                        vb[e & 127](a, f, r);
+                        e = 0;
+                        break a;
+                      }
+                    while (0);
+                    g = c[s >> 2] | 0;
+                    e = c[g >> 2] | 0;
+                    do
+                      if (!(e & 128)) {
+                        if (!(e & 16))
+                          if (!(e & 32)) {
+                            t = 51;
+                            break;
+                          } else {
+                            t = 48;
+                            break;
+                          }
+                        f = c[(g + 4) >> 2] | 0;
+                        e = (f | 0) != 0;
+                        if (!(d & 8192)) {
+                          if (!e) {
+                            t = 48;
+                            break;
+                          }
+                          if ((f | 0) == (c[(g + 8) >> 2] | 0)) {
+                            t = 48;
+                            break;
+                          }
+                          r = (f + 4) | 0;
+                          a = c[r >> 2] | 0;
+                          c[(h + 4) >> 2] = a;
+                          c[a >> 2] = h;
+                          c[h >> 2] = f;
+                          c[r >> 2] = h;
+                          break;
+                        } else {
+                          if (!e) {
+                            t = 51;
+                            break;
+                          }
+                          e = c[f >> 2] | 0;
+                          if (!e) {
+                            t = 51;
+                            break;
+                          }
+                          c[h >> 2] = e;
+                          c[(e + 4) >> 2] = h;
+                          c[(h + 4) >> 2] = f;
+                          c[f >> 2] = h;
+                          break;
+                        }
+                      } else if (!(d & 8192)) t = 48;
+                      else t = 51;
+                    while (0);
+                    if ((t | 0) == 48) {
+                      e = c[(g + 8) >> 2] | 0;
+                      c[h >> 2] = e;
+                      if (!e) e = h;
+                      else c[(h + 4) >> 2] = c[(e + 4) >> 2];
+                      c[(e + 4) >> 2] = h;
+                      c[((c[s >> 2] | 0) + 8) >> 2] = h;
+                    } else if ((t | 0) == 51) {
+                      f = (g + 8) | 0;
+                      e = c[f >> 2] | 0;
+                      if (!e) {
+                        c[f >> 2] = h;
+                        e = h;
+                      } else {
+                        r = (e + 4) | 0;
+                        c[c[r >> 2] >> 2] = h;
+                        c[(h + 4) >> 2] = c[r >> 2];
+                      }
+                      c[(e + 4) >> 2] = h;
+                      c[h >> 2] = 0;
+                    }
+                    e = c[s >> 2] | 0;
+                    f = (e + 16) | 0;
+                    g = c[f >> 2] | 0;
+                    if ((g | 0) > -1) c[f >> 2] = g + 1;
+                    c[(e + 4) >> 2] = h;
+                    if ((u | 0) < 0) {
+                      e = c[(h + 8) >> 2] | 0;
+                      break;
+                    } else {
+                      e = (h + (0 - u)) | 0;
+                      break;
+                    }
+                  }
+                  h = c[s >> 2] | 0;
+                  do
+                    if (!(d & 512)) {
+                      e = c[(h + 4) >> 2] | 0;
+                      if (e | 0) {
+                        if ((u | 0) < 0) g = c[(e + 8) >> 2] | 0;
+                        else g = (e + (0 - u)) | 0;
+                        if ((g | 0) == (b | 0)) break;
+                      }
+                      e = (b + m) | 0;
+                      if ((n | 0) < 0) {
+                        b = c[e >> 2] | 0;
+                        t = 68;
+                      } else {
+                        b = e;
+                        t = 68;
+                      }
+                    } else t = 68;
+                  while (0);
+                  if ((t | 0) == 68) {
+                    g = (u | 0) < 0;
+                    i = (n | 0) < 0;
+                    j = (o | 0) == 0;
+                    k = (n | 0) < 1;
+                    l = (0 - u) | 0;
+                    e = (h + 8) | 0;
+                    do {
+                      e = c[e >> 2] | 0;
+                      if (!e) {
+                        e = 0;
+                        break a;
+                      }
+                      if (g) f = c[(e + 8) >> 2] | 0;
+                      else f = (e + l) | 0;
+                      f = (f + m) | 0;
+                      if (i) f = c[f >> 2] | 0;
+                      do
+                        if (j)
+                          if (k) {
+                            f = s2(b, f) | 0;
+                            break;
+                          } else {
+                            f = $3(b, f, n) | 0;
+                            break;
+                          }
+                        else f = ob[o & 127](a, b, f, r) | 0;
+                      while (0);
+                    } while ((f | 0) != 0);
+                    f = c[p >> 2] | 0;
+                  }
+                  c[p >> 2] = f | 32768;
+                  if (!(d & 4098)) {
+                    do
+                      if (!(d & 8)) {
+                        f = c[s >> 2] | 0;
+                        if (!(d & 16)) {
+                          c[(f + 4) >> 2] = e;
+                          break;
+                        }
+                        if ((e | 0) == (c[(f + 8) >> 2] | 0)) {
+                          c[(f + 4) >> 2] = 0;
+                          e = 0;
+                          break a;
+                        } else {
+                          e = (e + 4) | 0;
+                          t = 108;
+                          break;
+                        }
+                      } else {
+                        f = c[s >> 2] | 0;
+                        t = 108;
+                      }
+                    while (0);
+                    if ((t | 0) == 108) {
+                      e = c[e >> 2] | 0;
+                      c[(f + 4) >> 2] = e;
+                      if (!e) {
+                        e = 0;
+                        break;
+                      }
+                    }
+                    if ((u | 0) < 0) {
+                      e = c[(e + 8) >> 2] | 0;
+                      break;
+                    } else {
+                      e = (e + (0 - u)) | 0;
+                      break;
+                    }
+                  } else {
+                    h = e;
+                    t = 84;
+                  }
+                }
+              while (0);
+              if ((t | 0) == 84) {
+                e = c[h >> 2] | 0;
+                if (e) {
+                  c[(e + 4) >> 2] = c[(h + 4) >> 2];
+                  e = c[h >> 2] | 0;
+                }
+                f = ((c[s >> 2] | 0) + 8) | 0;
+                g = c[f >> 2] | 0;
+                if ((h | 0) == (g | 0)) {
+                  c[f >> 2] = e;
+                  e = c[((c[s >> 2] | 0) + 8) >> 2] | 0;
+                  if (e | 0) c[(e + 4) >> 2] = c[(h + 4) >> 2];
+                } else {
+                  f = (h + 4) | 0;
+                  c[c[f >> 2] >> 2] = e;
+                  e = (g + 4) | 0;
+                  if ((h | 0) == (c[e >> 2] | 0)) c[e >> 2] = c[f >> 2];
+                }
+                e = c[s >> 2] | 0;
+                f = (e + 4) | 0;
+                if ((h | 0) == (c[f >> 2] | 0)) g = c[h >> 2] | 0;
+                else g = 0;
+                c[f >> 2] = g;
+                t = (e + 16) | 0;
+                c[t >> 2] = (c[t >> 2] | 0) + -1;
+                if ((u | 0) < 0) e = c[(h + 8) >> 2] | 0;
+                else e = (h + (0 - u)) | 0;
+                f = c[(r + 16) >> 2] | 0;
+                if (!((((d & 2) | 0) == 0) | ((f | 0) == 0))) vb[f & 127](a, e, r);
+                if ((c[q >> 2] | 0) < 0) ob[c[(a + 12) >> 2] & 127](a, h, 0, r) | 0;
+              }
+              return e | 0;
+            }
+            function Vz(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 16) | 0;
+              g = j;
+              a: do
+                if (((a | 0) != 0) & ((b | 0) != 0) ? ((f = T1(40) | 0), (f | 0) != 0) : 0) {
+                  c[f >> 2] = 0;
+                  c[(f + 16) >> 2] = 0;
+                  c[(f + 4) >> 2] = 0;
+                  bA(f, a, 0) | 0;
+                  d = (f + 20) | 0;
+                  i = (a + 32) | 0;
+                  c[d >> 2] = 0;
+                  c[(d + 4) >> 2] = 0;
+                  c[(d + 8) >> 2] = 0;
+                  c[(d + 12) >> 2] = 0;
+                  c[(d + 16) >> 2] = 0;
+                  d = c[i >> 2] | 0;
+                  do
+                    if (d) {
+                      c[g >> 2] = 0;
+                      d = ob[d & 127](f, 1, g, a) | 0;
+                      if ((d | 0) >= 0)
+                        if (d) {
+                          e = c[g >> 2] | 0;
+                          if (e | 0)
+                            if (!(c[(b + 4) >> 2] & c[e >> 2])) {
+                              d = f;
+                              h = 12;
+                              break;
+                            } else {
+                              d = f;
+                              break;
+                            }
+                          d = (a + 28) | 0;
+                          if (!(c[d >> 2] | 0)) {
+                            d = f;
+                            h = 12;
+                          } else {
+                            U1(f);
+                            e = ob[c[d >> 2] & 127](0, 0, 40, a) | 0;
+                            if (!e) {
+                              d = 0;
+                              break a;
+                            }
+                            c[e >> 2] = 0;
+                            c[(e + 16) >> 2] = 0;
+                            c[(e + 4) >> 2] = 0;
+                            bA(e, a, 0) | 0;
+                            c[(e + 20) >> 2] = 1;
+                            c[(e + 24) >> 2] = 0;
+                            c[(e + 32) >> 2] = 0;
+                            c[(e + 28) >> 2] = 0;
+                            d = e;
+                            f = e;
+                            h = 11;
+                          }
+                        } else {
+                          d = f;
+                          h = 11;
+                        }
+                      else {
+                        d = f;
+                        h = 12;
+                      }
+                    } else {
+                      d = f;
+                      h = 11;
+                    }
+                  while (0);
+                  if ((h | 0) == 11) {
+                    e = ob[c[(d + 12) >> 2] & 127](d, 0, 28, a) | 0;
+                    c[g >> 2] = e;
+                    if (!e) {
+                      d = f;
+                      h = 12;
+                    } else {
+                      c[e >> 2] = c[(b + 4) >> 2];
+                      g = (e + 4) | 0;
+                      c[g >> 2] = 0;
+                      c[(g + 4) >> 2] = 0;
+                      c[(g + 8) >> 2] = 0;
+                      c[(g + 12) >> 2] = 0;
+                      c[(g + 16) >> 2] = 0;
+                      c[(g + 20) >> 2] = 0;
+                    }
+                  }
+                  if ((h | 0) == 12) {
+                    U1(d);
+                    d = 0;
+                    break;
+                  }
+                  c[(d + 8) >> 2] = e;
+                  c[d >> 2] = c[b >> 2];
+                  c[(d + 16) >> 2] = b;
+                  e = c[i >> 2] | 0;
+                  if (e) ob[e & 127](d, 5, f, a) | 0;
+                } else d = 0;
+              while (0);
+              l = j;
+              return d | 0;
+            }
+            function Wz(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              f = c[c[(a + 16) >> 2] >> 2] | 0;
+              j = (a + 8) | 0;
+              g = c[j >> 2] | 0;
+              h = c[g >> 2] | 0;
+              d = h & 4096;
+              if (!b)
+                if (!d) b = -1;
+                else {
+                  e = d;
+                  b = c[(g + 4) >> 2] | 0;
+                  i = 5;
+                }
+              else if (!(c[(g + 16) >> 2] | 0)) {
+                e = 0;
+                i = 5;
+              } else b = -1;
+              a: do
+                if ((i | 0) == 5) {
+                  c[g >> 2] = h & -4097;
+                  if (!(h & 3)) {
+                    d = (g + 4) | 0;
+                    if (!(h & 12)) {
+                      c[d >> 2] = 0;
+                      d = (g + 8) | 0;
+                    }
+                    c[d >> 2] = b;
+                    if (e | 0) {
+                      b = 0;
+                      break;
+                    }
+                    c[((c[j >> 2] | 0) + 16) >> 2] = -1;
+                    b = 0;
+                    break;
+                  }
+                  c[(g + 4) >> 2] = 0;
+                  if (!e) {
+                    c[(g + 16) >> 2] = 0;
+                    while (1) {
+                      if (!b) {
+                        b = 0;
+                        break a;
+                      }
+                      j = c[b >> 2] | 0;
+                      nb[f & 63](a, b, 32) | 0;
+                      b = j;
+                    }
+                  }
+                  e = c[(g + 8) >> 2] | 0;
+                  a = (e + (c[(g + 12) >> 2] << 2)) | 0;
+                  while (1) {
+                    if (e >>> 0 >= a >>> 0) {
+                      b = 0;
+                      break a;
+                    }
+                    d = c[e >> 2] | 0;
+                    if (d) {
+                      c[e >> 2] = b;
+                      b = c[d >> 2] | 0;
+                      c[d >> 2] = 0;
+                    }
+                    e = (e + 4) | 0;
+                  }
+                }
+              while (0);
+              return b | 0;
+            }
+            function Xz(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              b = (a + 8) | 0;
+              d = c[b >> 2] | 0;
+              if (c[d >> 2] & 4096) {
+                Wz(a, 0) | 0;
+                d = c[b >> 2] | 0;
+              }
+              e = (d + 16) | 0;
+              a = c[e >> 2] | 0;
+              do
+                if ((a | 0) < 0) {
+                  b = c[d >> 2] | 0;
+                  if ((b & 12) | 0) {
+                    a = Yz(c[(d + 4) >> 2] | 0) | 0;
+                    c[e >> 2] = a;
+                    break;
+                  }
+                  if (b & 112) {
+                    a = 0;
+                    b = (d + 8) | 0;
+                    while (1) {
+                      b = c[b >> 2] | 0;
+                      if (!b) break;
+                      a = (a + 1) | 0;
+                    }
+                    c[e >> 2] = a;
+                  }
+                }
+              while (0);
+              return a | 0;
+            }
+            function Yz(a) {
+              a = a | 0;
+              var b = 0;
+              if (!a) return 0;
+              else {
+                b = Yz(c[(a + 4) >> 2] | 0) | 0;
+                return (b + 1 + (Yz(c[a >> 2] | 0) | 0)) | 0;
+              }
+              return 0;
+            }
+            function Zz(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0;
+              G = l;
+              l = (l + 128) | 0;
+              z = (G + 120) | 0;
+              r = G;
+              F = (a + 8) | 0;
+              e = c[F >> 2] | 0;
+              if (c[e >> 2] & 4096) {
+                Wz(a, 0) | 0;
+                e = c[F >> 2] | 0;
+              }
+              E = c[(a + 4) >> 2] | 0;
+              A = c[E >> 2] | 0;
+              B = c[(E + 4) >> 2] | 0;
+              x = (E + 8) | 0;
+              D = c[x >> 2] | 0;
+              C = c[(E + 20) >> 2] | 0;
+              t = (a + 20) | 0;
+              c[t >> 2] = c[t >> 2] & -32769;
+              h = c[(e + 4) >> 2] | 0;
+              a: do
+                if (!b)
+                  if ((((d & 448) | 0) == 0) | ((h | 0) == 0)) e = 0;
+                  else {
+                    if (!(d & 64)) {
+                      b: do
+                        if (!(d & 256)) {
+                          e = h;
+                          while (1) {
+                            f = (e + 4) | 0;
+                            g = c[f >> 2] | 0;
+                            if (!g) break b;
+                            c[f >> 2] = c[g >> 2];
+                            c[g >> 2] = e;
+                            e = g;
+                          }
+                        } else {
+                          e = h;
+                          while (1) {
+                            f = c[e >> 2] | 0;
+                            if (!f) break b;
+                            a = (f + 4) | 0;
+                            c[e >> 2] = c[a >> 2];
+                            c[a >> 2] = e;
+                            e = f;
+                          }
+                        }
+                      while (0);
+                      c[((c[F >> 2] | 0) + 4) >> 2] = e;
+                      if ((D | 0) < 0) {
+                        e = c[(e + 8) >> 2] | 0;
+                        break;
+                      } else {
+                        e = (e + (0 - D)) | 0;
+                        break;
+                      }
+                    }
+                    b = (E + 16) | 0;
+                    if (((c[b >> 2] | 0) != 0) | ((D | 0) < 0)) {
+                      j = (a + 12) | 0;
+                      k = (D | 0) < 0;
+                      i = (0 - D) | 0;
+                      e = h;
+                      do {
+                        h = e;
+                        while (1) {
+                          e = (h + 4) | 0;
+                          f = c[e >> 2] | 0;
+                          if (!f) break;
+                          c[e >> 2] = c[f >> 2];
+                          c[f >> 2] = h;
+                          h = f;
+                        }
+                        e = c[h >> 2] | 0;
+                        f = c[b >> 2] | 0;
+                        if (f | 0) {
+                          if (k) g = c[(h + 8) >> 2] | 0;
+                          else g = (h + i) | 0;
+                          vb[f & 127](a, g, E);
+                        }
+                        if ((c[x >> 2] | 0) < 0) ob[c[j >> 2] & 127](a, h, 0, E) | 0;
+                      } while ((e | 0) != 0);
+                      e = c[F >> 2] | 0;
+                    }
+                    c[(e + 16) >> 2] = 0;
+                    c[(e + 4) >> 2] = 0;
+                    e = 0;
+                  }
+                else {
+                  y = (a + 16) | 0;
+                  u = ((d & 4098) | 0) == 0;
+                  c: do
+                    if (u | ((c[((c[y >> 2] | 0) + 4) >> 2] | 0) != 8)) v = 45;
+                    else {
+                      k = (B | 0) < 0;
+                      e = (b + A) | 0;
+                      if (k) e = c[e >> 2] | 0;
+                      i = (C | 0) == 0;
+                      j = (B | 0) < 1;
+                      g = nb[c[a >> 2] & 63](a, b, 4) | 0;
+                      while (1) {
+                        if (!g) {
+                          v = 45;
+                          break c;
+                        }
+                        f = (g + A) | 0;
+                        if (k) f = c[f >> 2] | 0;
+                        do
+                          if (i)
+                            if (j) {
+                              f = s2(e, f) | 0;
+                              break;
+                            } else {
+                              f = $3(e, f, B) | 0;
+                              break;
+                            }
+                          else f = ob[C & 127](a, e, f, E) | 0;
+                        while (0);
+                        if (f | 0) {
+                          v = 45;
+                          break c;
+                        }
+                        if ((g | 0) == (b | 0)) break;
+                        g = nb[c[a >> 2] & 63](a, g, 8) | 0;
+                      }
+                      h = c[((c[F >> 2] | 0) + 4) >> 2] | 0;
+                      c[z >> 2] = c[(h + 4) >> 2];
+                      c[(z + 4) >> 2] = c[h >> 2];
+                      e = z;
+                      v = 180;
+                    }
+                  while (0);
+                  d: do
+                    if ((v | 0) == 45) {
+                      do
+                        if (!(d & 2565)) {
+                          if ((d & 32) | 0) {
+                            if ((D | 0) < 0) g = c[(b + 8) >> 2] | 0;
+                            else g = (b + (0 - D)) | 0;
+                            e = (g + A) | 0;
+                            if ((B | 0) < 0) f = c[e >> 2] | 0;
+                            else f = e;
+                            if (!h) {
+                              e = b;
+                              f = z;
+                              h = z;
+                              v = 198;
+                              break;
+                            } else {
+                              e = b;
+                              s = f;
+                              j = b;
+                              v = 64;
+                              break;
+                            }
+                          }
+                          if (h) {
+                            if ((D | 0) < 0) e = c[(h + 8) >> 2] | 0;
+                            else e = (h + (0 - D)) | 0;
+                            if ((e | 0) != (b | 0)) {
+                              f = (b + A) | 0;
+                              if ((B | 0) < 0) {
+                                g = b;
+                                e = 0;
+                                s = c[f >> 2] | 0;
+                                j = 0;
+                                v = 64;
+                              } else {
+                                g = b;
+                                e = 0;
+                                s = f;
+                                j = 0;
+                                v = 64;
+                              }
+                            } else {
+                              e = 0;
+                              g = b;
+                              f = z;
+                              k = z;
+                              j = 0;
+                              v = 141;
+                            }
+                          } else {
+                            e = 0;
+                            g = b;
+                            f = z;
+                            h = z;
+                            v = 198;
+                          }
+                        } else {
+                          if (!(d & 512)) {
+                            e = (b + A) | 0;
+                            if ((B | 0) < 0) f = c[e >> 2] | 0;
+                            else f = e;
+                          } else f = b;
+                          if (!h) {
+                            e = 0;
+                            g = b;
+                            f = z;
+                            h = z;
+                            v = 198;
+                          } else {
+                            g = b;
+                            e = 0;
+                            s = f;
+                            j = 0;
+                            v = 64;
+                          }
+                        }
+                      while (0);
+                      e: do
+                        if ((v | 0) == 64) {
+                          f: do
+                            if (
+                              (c[((c[y >> 2] | 0) + 4) >> 2] | 0) == 4
+                                ? ((q = c[((c[F >> 2] | 0) + 24) >> 2] | 0), !((((d & 516) | 0) == 0) | ((q | 0) == 0)))
+                                : 0
+                            ) {
+                              b = (D | 0) < 0;
+                              m = (B | 0) < 0;
+                              n = (C | 0) == 0;
+                              o = (B | 0) < 1;
+                              p = (0 - D) | 0;
+                              k = 0;
+                              f = h;
+                              while (1) {
+                                if ((k | 0) >= (q | 0)) {
+                                  f = z;
+                                  k = z;
+                                  m = 0;
+                                  break;
+                                }
+                                if (b) i = c[(f + 8) >> 2] | 0;
+                                else i = (f + p) | 0;
+                                i = (i + A) | 0;
+                                if (m) i = c[i >> 2] | 0;
+                                do
+                                  if (n)
+                                    if (o) {
+                                      i = s2(s, i) | 0;
+                                      break;
+                                    } else {
+                                      i = $3(s, i, B) | 0;
+                                      break;
+                                    }
+                                  else i = ob[C & 127](a, s, i, E) | 0;
+                                while (0);
+                                if (!i) {
+                                  v = 80;
+                                  break;
+                                }
+                                c[(r + (k << 2)) >> 2] = i;
+                                f = c[((i | 0) < 0 ? (f + 4) | 0 : f) >> 2] | 0;
+                                if (!f) {
+                                  e = 0;
+                                  break a;
+                                } else k = (k + 1) | 0;
+                              }
+                              if ((v | 0) == 80)
+                                if (b) {
+                                  e = c[(f + 8) >> 2] | 0;
+                                  break a;
+                                } else {
+                                  e = (f + p) | 0;
+                                  break a;
+                                }
+                              while (1) {
+                                if ((m | 0) >= (q | 0)) break f;
+                                do
+                                  if ((c[(r + (m << 2)) >> 2] | 0) < 0) {
+                                    i = (h + 4) | 0;
+                                    b = c[i >> 2] | 0;
+                                    if ((c[(r + ((m | 1) << 2)) >> 2] | 0) < 0) {
+                                      c[i >> 2] = c[b >> 2];
+                                      c[b >> 2] = h;
+                                      c[(f + 4) >> 2] = b;
+                                      f = b;
+                                      h = k;
+                                      i = (b + 4) | 0;
+                                      break;
+                                    } else {
+                                      c[k >> 2] = b;
+                                      c[(f + 4) >> 2] = h;
+                                      f = h;
+                                      h = b;
+                                      i = b;
+                                      break;
+                                    }
+                                  } else {
+                                    i = c[h >> 2] | 0;
+                                    if ((c[(r + ((m | 1) << 2)) >> 2] | 0) > 0) {
+                                      p = (i + 4) | 0;
+                                      c[h >> 2] = c[p >> 2];
+                                      c[p >> 2] = h;
+                                      c[k >> 2] = i;
+                                      h = i;
+                                      break;
+                                    } else {
+                                      c[(f + 4) >> 2] = i;
+                                      c[k >> 2] = h;
+                                      f = i;
+                                      i = (i + 4) | 0;
+                                      break;
+                                    }
+                                  }
+                                while (0);
+                                k = h;
+                                m = (m + 2) | 0;
+                                h = c[i >> 2] | 0;
+                              }
+                            } else {
+                              f = z;
+                              k = z;
+                            }
+                          while (0);
+                          n = (D | 0) < 0;
+                          o = (B | 0) < 0;
+                          p = (C | 0) != 0;
+                          q = (B | 0) < 1;
+                          r = (0 - D) | 0;
+                          i = h;
+                          g: while (1) {
+                            h = i;
+                            while (1) {
+                              if (n) i = c[(h + 8) >> 2] | 0;
+                              else i = (h + r) | 0;
+                              i = (i + A) | 0;
+                              if (o) i = c[i >> 2] | 0;
+                              do
+                                if (!p)
+                                  if (q) {
+                                    i = s2(s, i) | 0;
+                                    break;
+                                  } else {
+                                    i = $3(s, i, B) | 0;
+                                    break;
+                                  }
+                                else i = ob[C & 127](a, s, i, E) | 0;
+                              while (0);
+                              if (!i) {
+                                v = 140;
+                                break g;
+                              }
+                              if ((i | 0) >= 0) break;
+                              b = (h + 4) | 0;
+                              m = c[b >> 2] | 0;
+                              if (!m) {
+                                v = 121;
+                                break g;
+                              }
+                              if (n) i = c[(m + 8) >> 2] | 0;
+                              else i = (m + r) | 0;
+                              i = (i + A) | 0;
+                              if (o) i = c[i >> 2] | 0;
+                              do
+                                if (!p)
+                                  if (q) {
+                                    i = s2(s, i) | 0;
+                                    break;
+                                  } else {
+                                    i = $3(s, i, B) | 0;
+                                    break;
+                                  }
+                                else i = ob[C & 127](a, s, i, E) | 0;
+                              while (0);
+                              if ((i | 0) >= 0) {
+                                v = 118;
+                                break;
+                              }
+                              c[b >> 2] = c[m >> 2];
+                              c[m >> 2] = h;
+                              c[(f + 4) >> 2] = m;
+                              h = c[(m + 4) >> 2] | 0;
+                              if (!h) {
+                                f = m;
+                                h = k;
+                                v = 198;
+                                break e;
+                              } else f = m;
+                            }
+                            if ((v | 0) == 118) {
+                              v = 0;
+                              if (!i) {
+                                v = 119;
+                                break;
+                              }
+                              c[k >> 2] = m;
+                              c[(f + 4) >> 2] = h;
+                              i = c[m >> 2] | 0;
+                              if (!i) {
+                                f = h;
+                                h = m;
+                                v = 198;
+                                break e;
+                              } else {
+                                f = h;
+                                k = m;
+                                continue;
+                              }
+                            }
+                            b = c[h >> 2] | 0;
+                            if (!b) {
+                              v = 139;
+                              break;
+                            }
+                            if (n) i = c[(b + 8) >> 2] | 0;
+                            else i = (b + r) | 0;
+                            i = (i + A) | 0;
+                            if (o) i = c[i >> 2] | 0;
+                            do
+                              if (!p)
+                                if (q) {
+                                  i = s2(s, i) | 0;
+                                  break;
+                                } else {
+                                  i = $3(s, i, B) | 0;
+                                  break;
+                                }
+                              else i = ob[C & 127](a, s, i, E) | 0;
+                            while (0);
+                            if ((i | 0) > 0) {
+                              i = (b + 4) | 0;
+                              c[h >> 2] = c[i >> 2];
+                              c[i >> 2] = h;
+                              c[k >> 2] = b;
+                              i = c[b >> 2] | 0;
+                              if (!i) {
+                                h = b;
+                                v = 198;
+                                break e;
+                              } else {
+                                k = b;
+                                continue;
+                              }
+                            }
+                            if (!i) {
+                              v = 137;
+                              break;
+                            }
+                            c[(f + 4) >> 2] = b;
+                            c[k >> 2] = h;
+                            i = c[(b + 4) >> 2] | 0;
+                            if (!i) {
+                              f = b;
+                              v = 198;
+                              break e;
+                            } else {
+                              f = b;
+                              k = h;
+                            }
+                          }
+                          if ((v | 0) == 119) {
+                            c[(f + 4) >> 2] = h;
+                            f = h;
+                            h = m;
+                            v = 141;
+                            break;
+                          } else if ((v | 0) == 121) {
+                            c[(f + 4) >> 2] = h;
+                            f = h;
+                            h = k;
+                            v = 198;
+                            break;
+                          } else if ((v | 0) == 137) {
+                            c[k >> 2] = h;
+                            k = h;
+                            h = b;
+                            v = 141;
+                            break;
+                          } else if ((v | 0) == 139) {
+                            c[k >> 2] = h;
+                            v = 198;
+                            break;
+                          } else if ((v | 0) == 140)
+                            if (!h) {
+                              h = k;
+                              v = 198;
+                              break;
+                            } else {
+                              v = 141;
+                              break;
+                            }
+                        }
+                      while (0);
+                      do
+                        if ((v | 0) == 141) {
+                          c[t >> 2] = c[t >> 2] | 32768;
+                          i = (h + 4) | 0;
+                          c[k >> 2] = c[i >> 2];
+                          c[(f + 4) >> 2] = c[h >> 2];
+                          if (!(d & 516)) {
+                            if ((d & 8) | 0) {
+                              c[i >> 2] = c[z >> 2];
+                              c[h >> 2] = 0;
+                              c[z >> 2] = h;
+                              v = 169;
+                              break;
+                            }
+                            if ((d & 16) | 0) {
+                              v = (z + 4) | 0;
+                              c[h >> 2] = c[v >> 2];
+                              c[i >> 2] = 0;
+                              c[v >> 2] = h;
+                              v = 175;
+                              break;
+                            }
+                            if (!u) {
+                              e = f;
+                              v = 180;
+                              break d;
+                            }
+                            if ((d & 2049) | 0) {
+                              if ((c[((c[y >> 2] | 0) + 4) >> 2] & 4) | 0) {
+                                e = h;
+                                break;
+                              }
+                              c[i >> 2] = 0;
+                              e = (z + 4) | 0;
+                              c[h >> 2] = c[e >> 2];
+                              c[e >> 2] = h;
+                              e = h;
+                              v = 205;
+                              break;
+                            }
+                            if (!(d & 32)) {
+                              e = 0;
+                              break a;
+                            }
+                            if (!(c[((c[y >> 2] | 0) + 4) >> 2] & 4)) {
+                              c[(e + 4) >> 2] = 0;
+                              x = (z + 4) | 0;
+                              c[e >> 2] = c[x >> 2];
+                              c[x >> 2] = j;
+                              e = ((c[F >> 2] | 0) + 16) | 0;
+                              c[e >> 2] = (c[e >> 2] | 0) + 1;
+                              e = h;
+                              break;
+                            }
+                            e = c[(E + 16) >> 2] | 0;
+                            if (e | 0) vb[e & 127](a, g, E);
+                            if ((c[x >> 2] | 0) < 0) {
+                              ob[c[(a + 12) >> 2] & 127](a, j, 0, E) | 0;
+                              e = h;
+                            } else e = h;
+                          } else e = h;
+                        } else if ((v | 0) == 198) {
+                          c[(f + 4) >> 2] = 0;
+                          c[h >> 2] = 0;
+                          if (!(d & 8))
+                            if (!(d & 16)) {
+                              if ((d & 516) | 0) {
+                                e = f;
+                                break d;
+                              }
+                              if (!(d & 2049)) {
+                                if (!(d & 32)) {
+                                  g = 0;
+                                  e = f;
+                                  break d;
+                                }
+                                x = ((c[F >> 2] | 0) + 16) | 0;
+                                c[x >> 2] = (c[x >> 2] | 0) + 1;
+                              } else {
+                                e = 0;
+                                v = 205;
+                              }
+                            } else v = 175;
+                          else v = 169;
+                        }
+                      while (0);
+                      if ((v | 0) == 169) {
+                        h = (z + 4) | 0;
+                        e = c[h >> 2] | 0;
+                        if (!e) {
+                          e = f;
+                          break;
+                        }
+                        while (1) {
+                          f = (e + 4) | 0;
+                          g = c[f >> 2] | 0;
+                          if (!g) break;
+                          c[f >> 2] = c[g >> 2];
+                          c[g >> 2] = e;
+                          e = g;
+                        }
+                        c[h >> 2] = c[e >> 2];
+                      } else if ((v | 0) == 175) {
+                        e = c[z >> 2] | 0;
+                        if (!e) {
+                          e = f;
+                          break;
+                        }
+                        while (1) {
+                          f = c[e >> 2] | 0;
+                          if (!f) break;
+                          x = (f + 4) | 0;
+                          c[e >> 2] = c[x >> 2];
+                          c[x >> 2] = e;
+                          e = f;
+                        }
+                        c[z >> 2] = c[(e + 4) >> 2];
+                      } else if ((v | 0) == 205) {
+                        i = (E + 12) | 0;
+                        h = c[i >> 2] | 0;
+                        j = ((d & 1) | 0) == 0;
+                        if (!(j | ((h | 0) == 0))) g = nb[h & 63](a, g, E) | 0;
+                        do
+                          if (g) {
+                            if ((D | 0) > -1) {
+                              e = (g + D) | 0;
+                              v = 215;
+                              break;
+                            }
+                            e = ob[c[(a + 12) >> 2] & 127](a, 0, 12, E) | 0;
+                            if (e | 0) {
+                              c[(e + 8) >> 2] = g;
+                              break;
+                            }
+                            if ((c[i >> 2] | 0) != 0 ? ((w = c[(E + 16) >> 2] | 0), !(j | ((w | 0) == 0))) : 0) {
+                              vb[w & 127](a, g, E);
+                              v = 215;
+                            } else v = 215;
+                          } else v = 215;
+                        while (0);
+                        if ((v | 0) == 215)
+                          if (!e) {
+                            e = f;
+                            break;
+                          }
+                        f = ((c[F >> 2] | 0) + 16) | 0;
+                        g = c[f >> 2] | 0;
+                        if ((g | 0) > -1) c[f >> 2] = g + 1;
+                      }
+                      c[(e + 4) >> 2] = c[z >> 2];
+                      c[e >> 2] = c[(z + 4) >> 2];
+                      h: do
+                        if (!(((d & 516) | 0) == 0 ? 1 : ((c[((c[y >> 2] | 0) + 4) >> 2] & 8) | 0) == 0)) {
+                          m = (D | 0) < 0;
+                          if (m) f = c[(e + 8) >> 2] | 0;
+                          else f = (e + (0 - D)) | 0;
+                          n = (B | 0) < 0;
+                          f = (f + A) | 0;
+                          if (n) f = c[f >> 2] | 0;
+                          j = (C | 0) == 0;
+                          k = (B | 0) < 1;
+                          b = (0 - D) | 0;
+                          while (1) {
+                            i = (e + 4) | 0;
+                            g = c[i >> 2] | 0;
+                            if (!g) break h;
+                            while (1) {
+                              h = c[g >> 2] | 0;
+                              if (!h) break;
+                              z = (h + 4) | 0;
+                              c[g >> 2] = c[z >> 2];
+                              c[z >> 2] = g;
+                              g = h;
+                            }
+                            c[i >> 2] = g;
+                            if (m) h = c[(g + 8) >> 2] | 0;
+                            else h = (g + b) | 0;
+                            h = (h + A) | 0;
+                            if (n) h = c[h >> 2] | 0;
+                            do
+                              if (j)
+                                if (k) {
+                                  h = s2(f, h) | 0;
+                                  break;
+                                } else {
+                                  h = $3(f, h, B) | 0;
+                                  break;
+                                }
+                              else h = ob[C & 127](a, f, h, E) | 0;
+                            while (0);
+                            if (h | 0) break h;
+                            c[i >> 2] = c[g >> 2];
+                            c[g >> 2] = e;
+                            e = g;
+                          }
+                        }
+                      while (0);
+                      c[((c[F >> 2] | 0) + 4) >> 2] = e;
+                      if ((D | 0) < 0) {
+                        e = c[(e + 8) >> 2] | 0;
+                        break a;
+                      } else {
+                        e = (e + (0 - D)) | 0;
+                        break a;
+                      }
+                    }
+                  while (0);
+                  if ((v | 0) == 180) {
+                    if ((D | 0) < 0) g = c[(h + 8) >> 2] | 0;
+                    else g = (h + (0 - D)) | 0;
+                    f = c[(E + 16) >> 2] | 0;
+                    if (!((((d & 2) | 0) == 0) | ((f | 0) == 0))) vb[f & 127](a, g, E);
+                    if ((c[x >> 2] | 0) < 0) ob[c[(a + 12) >> 2] & 127](a, h, 0, E) | 0;
+                    a = ((c[F >> 2] | 0) + 16) | 0;
+                    E = c[a >> 2] | 0;
+                    c[a >> 2] = (E | 0) < 1 ? -1 : (E + -1) | 0;
+                  }
+                  do {
+                    f = (e + 4) | 0;
+                    e = c[f >> 2] | 0;
+                  } while ((e | 0) != 0);
+                  c[f >> 2] = c[z >> 2];
+                  c[((c[F >> 2] | 0) + 4) >> 2] = c[(z + 4) >> 2];
+                  e = (d & 2) | 0 ? g : 0;
+                }
+              while (0);
+              l = G;
+              return e | 0;
+            }
+            function _z(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              if ((c[c[(a + 8) >> 2] >> 2] & 4096) | 0) Wz(a, 0) | 0;
+              f = (b | 0) != 0;
+              if (f) {
+                if ((c[c[(b + 8) >> 2] >> 2] & 4096) | 0) Wz(b, 0) | 0;
+                if ((c[(b + 16) >> 2] | 0) == (c[(a + 16) >> 2] | 0)) {
+                  d = b;
+                  e = 7;
+                } else b = 0;
+              } else {
+                d = 0;
+                e = 7;
+              }
+              a: do
+                if ((e | 0) == 7) {
+                  while (1) {
+                    if (!d) break;
+                    if ((d | 0) == (a | 0)) {
+                      b = 0;
+                      break a;
+                    }
+                    d = c[(d + 28) >> 2] | 0;
+                    e = 7;
+                  }
+                  d = (a + 28) | 0;
+                  e = c[d >> 2] | 0;
+                  if (e | 0) {
+                    g = (e + 24) | 0;
+                    c[g >> 2] = (c[g >> 2] | 0) + -1;
+                  }
+                  c[(a + 32) >> 2] = 0;
+                  c[d >> 2] = 0;
+                  if (f) {
+                    c[d >> 2] = b;
+                    c[a >> 2] = 28;
+                    g = (b + 24) | 0;
+                    c[g >> 2] = (c[g >> 2] | 0) + 1;
+                    break;
+                  } else {
+                    c[a >> 2] = c[c[(a + 16) >> 2] >> 2];
+                    b = e;
+                    break;
+                  }
+                }
+              while (0);
+              return b | 0;
+            }
+            function $z(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              a: do
+                if (!(d & 99)) {
+                  if (
+                    ((d & 516) | 0) == 0
+                      ? ((e = c[((c[(a + 16) >> 2] | 0) + 4) >> 2] | 0),
+                        !((((d & 384) | 0) != 0) & (((e & 12) | 0) == 0)))
+                      : 0
+                  ) {
+                    if ((e & 12) | 0) {
+                      if (!(d & 408)) {
+                        e = 0;
+                        break;
+                      }
+                      o = ((d & 136) | 0) != 0;
+                      p = ((d & 272) | 0) != 0;
+                      l = 0;
+                      f = 0;
+                      e = 0;
+                      n = a;
+                      while (1) {
+                        if (!n) break;
+                        m = nb[c[c[(n + 16) >> 2] >> 2] & 63](n, b, d) | 0;
+                        do
+                          if (!m) g = l;
+                          else {
+                            h = c[(n + 4) >> 2] | 0;
+                            i = c[(h + 4) >> 2] | 0;
+                            j = c[(h + 20) >> 2] | 0;
+                            g = (m + (c[h >> 2] | 0)) | 0;
+                            if ((i | 0) < 0) k = c[g >> 2] | 0;
+                            else k = g;
+                            if (e | 0) {
+                              do
+                                if (!j)
+                                  if ((i | 0) < 1) {
+                                    g = s2(k, f) | 0;
+                                    break;
+                                  } else {
+                                    g = $3(k, f, i) | 0;
+                                    break;
+                                  }
+                                else g = ob[j & 127](n, k, f, h) | 0;
+                              while (0);
+                              if (!((o & ((g | 0) < 0)) | (p & ((g | 0) > 0)))) {
+                                g = l;
+                                break;
+                              }
+                            }
+                            g = n;
+                            f = k;
+                            e = m;
+                          }
+                        while (0);
+                        l = g;
+                        n = c[(n + 28) >> 2] | 0;
+                      }
+                      c[(a + 32) >> 2] = l;
+                      break;
+                    }
+                    if (!(d & 24)) {
+                      e = 0;
+                      break;
+                    }
+                    j = (a + 32) | 0;
+                    f = c[j >> 2] | 0;
+                    if (f) {
+                      e = c[((c[(f + 4) >> 2] | 0) + 8) >> 2] | 0;
+                      g = c[((c[(f + 8) >> 2] | 0) + 4) >> 2] | 0;
+                      if ((e | 0) < 0) e = c[(g + 8) >> 2] | 0;
+                      else e = (g + (0 - e)) | 0;
+                      if ((e | 0) == (b | 0)) e = b;
+                      else {
+                        f = a;
+                        h = 32;
+                      }
+                    } else {
+                      f = a;
+                      h = 32;
+                    }
+                    do
+                      if ((h | 0) == 32) {
+                        while (1) {
+                          if (!f) {
+                            h = 33;
+                            break;
+                          }
+                          e = nb[c[c[(f + 16) >> 2] >> 2] & 63](f, b, 4) | 0;
+                          if (e | 0) {
+                            h = 36;
+                            break;
+                          }
+                          f = c[(f + 28) >> 2] | 0;
+                          h = 32;
+                        }
+                        if ((h | 0) == 33) {
+                          c[j >> 2] = 0;
+                          e = 0;
+                          break a;
+                        } else if ((h | 0) == 36) {
+                          c[j >> 2] = f;
+                          break;
+                        }
+                      }
+                    while (0);
+                    i = ((((d << 4) & 128) ^ 128) + 128) | 0;
+                    e = nb[c[c[(f + 16) >> 2] >> 2] & 63](f, e, d) | 0;
+                    while (1) {
+                      h = (f + 16) | 0;
+                      while (1) {
+                        if (!e) break;
+                        else g = a;
+                        while (1) {
+                          if ((g | 0) == (f | 0)) break a;
+                          if (nb[c[c[(g + 16) >> 2] >> 2] & 63](g, e, 4) | 0) break;
+                          g = c[(g + 28) >> 2] | 0;
+                        }
+                        e = nb[c[c[h >> 2] >> 2] & 63](f, e, d) | 0;
+                      }
+                      f = c[(f + 28) >> 2] | 0;
+                      c[j >> 2] = f;
+                      if (!f) {
+                        e = 0;
+                        break a;
+                      }
+                      e = nb[c[c[(f + 16) >> 2] >> 2] & 63](f, 0, i) | 0;
+                    }
+                  } else f = a;
+                  while (1) {
+                    if (!f) {
+                      f = 0;
+                      e = 0;
+                      break;
+                    }
+                    e = nb[c[c[(f + 16) >> 2] >> 2] & 63](f, b, d) | 0;
+                    if (e | 0) break;
+                    f = c[(f + 28) >> 2] | 0;
+                  }
+                  c[(a + 32) >> 2] = f;
+                } else e = nb[c[c[(a + 16) >> 2] >> 2] & 63](a, b, d) | 0;
+              while (0);
+              return e | 0;
+            }
+            function aA(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              g = (a + 32) | 0;
+              f = nb[c[a >> 2] & 63](a, 0, 128) | 0;
+              do {
+                if (!f) {
+                  e = 0;
+                  break;
+                }
+                h = c[g >> 2] | 0;
+                e = f;
+                f = nb[c[a >> 2] & 63](a, f, 8) | 0;
+                e = nb[b & 63]((h | 0) == 0 ? a : h, e, d) | 0;
+              } while ((e | 0) >= 0);
+              return e | 0;
+            }
+            function bA(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0;
+              f = (a + 4) | 0;
+              n = c[f >> 2] | 0;
+              a: do
+                if (n)
+                  if (b) {
+                    m = c[c[(a + 16) >> 2] >> 2] | 0;
+                    g = (a + 8) | 0;
+                    if ((c[c[g >> 2] >> 2] & 4096) | 0) Wz(a, 0) | 0;
+                    e = c[(n + 32) >> 2] | 0;
+                    if (e | 0 ? (ob[e & 127](a, 3, b, n) | 0) < 0 : 0) {
+                      b = 0;
+                      break;
+                    }
+                    c[f >> 2] = b;
+                    e = c[(b + 28) >> 2] | 0;
+                    c[(a + 12) >> 2] = (e | 0) == 0 ? 52 : e;
+                    e = c[c[g >> 2] >> 2] | 0;
+                    if (!(e & 112)) {
+                      do
+                        if (!(e & 2))
+                          if (!(e & 3))
+                            if (!(d & 1)) break;
+                            else {
+                              b = n;
+                              break a;
+                            }
+                          else if (((d & 3) | 0) == 3) {
+                            b = n;
+                            break a;
+                          } else break;
+                        else if ((d & 2) | 0) {
+                          b = n;
+                          break a;
+                        }
+                      while (0);
+                      h = Tz(a) | 0;
+                      e = c[g >> 2] | 0;
+                      l = c[e >> 2] | 0;
+                      c[e >> 2] = l & -4097;
+                      c[(e + 4) >> 2] = 0;
+                      c[(e + 16) >> 2] = 0;
+                      b: do
+                        if ((l & 3) | 0) {
+                          l = c[(e + 8) >> 2] | 0;
+                          f = (l + (c[(e + 12) >> 2] << 2)) | 0;
+                          e = l;
+                          while (1) {
+                            if (e >>> 0 >= f >>> 0) break b;
+                            c[e >> 2] = 0;
+                            e = (e + 4) | 0;
+                          }
+                        }
+                      while (0);
+                      i = ((d & 2) | 0) == 0;
+                      j = (b + 8) | 0;
+                      k = (b + 4) | 0;
+                      l = (b + 24) | 0;
+                      while (1) {
+                        if (!h) {
+                          b = n;
+                          break a;
+                        }
+                        d = c[h >> 2] | 0;
+                        if (i) {
+                          e = c[j >> 2] | 0;
+                          if ((e | 0) < 0) e = c[(h + 8) >> 2] | 0;
+                          else e = (h + (0 - e)) | 0;
+                          g = c[k >> 2] | 0;
+                          e = (e + (c[b >> 2] | 0)) | 0;
+                          if ((g | 0) < 0) e = c[e >> 2] | 0;
+                          f = c[l >> 2] | 0;
+                          if (!f) e = dA(0, e, g) | 0;
+                          else e = nb[f & 63](a, e, b) | 0;
+                          c[(h + 4) >> 2] = e;
+                        }
+                        nb[m & 63](a, h, 32) | 0;
+                        h = d;
+                      }
+                    } else b = n;
+                  } else b = n;
+                else {
+                  c[f >> 2] = b;
+                  n = c[(b + 28) >> 2] | 0;
+                  c[(a + 12) >> 2] = (n | 0) == 0 ? 52 : n;
+                }
+              while (0);
+              return b | 0;
+            }
+            function cA(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              a = (c | 0) == 0;
+              do
+                if (!b)
+                  if (a) a = 0;
+                  else a = T1(c) | 0;
+                else if (a) {
+                  U1(b);
+                  a = 0;
+                  break;
+                } else {
+                  a = W1(b, c) | 0;
+                  break;
+                }
+              while (0);
+              return a | 0;
+            }
+            function dA(b, c, e) {
+              b = b | 0;
+              c = c | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              g = c;
+              if ((e | 0) >= 1) {
+                h = (c + e + -1) | 0;
+                g = ((h >>> 0 < c >>> 0 ? c : h) + (1 - g)) & -2;
+                f = c;
+                while (1) {
+                  if (f >>> 0 >= h >>> 0) break;
+                  b = O((((d[f >> 0] | 0) << 8) + b + (d[(f + 1) >> 0] | 0)) | 0, 17109811) | 0;
+                  f = (f + 2) | 0;
+                }
+                f = (c + g) | 0;
+                if (f >>> 0 > h >>> 0) c = e;
+                else {
+                  c = e;
+                  b = O((((d[f >> 0] | 0) << 8) + b) | 0, 17109811) | 0;
+                }
+              } else {
+                while (1) {
+                  f = a[c >> 0] | 0;
+                  if (!((f << 24) >> 24)) break;
+                  h = a[(c + 1) >> 0] | 0;
+                  e = O((((f & 255) << 8) + b + (h & 255)) | 0, 17109811) | 0;
+                  b = e;
+                  c = (c + ((h << 24) >> 24 ? 2 : 1)) | 0;
+                }
+                c = (c - g) | 0;
+              }
+              return O((b + c) | 0, 17109811) | 0;
+            }
+            function eA(a) {
+              a = a | 0;
+              var b = 0;
+              b = c[46935] | 0;
+              c[46935] = a;
+              return b | 0;
+            }
+            function fA(a) {
+              a = a | 0;
+              var b = 0;
+              b = c[46936] | 0;
+              c[46936] = a;
+              return b | 0;
+            }
+            function gA(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = l;
+              l = (l + 16) | 0;
+              f = e;
+              c[f >> 2] = d;
+              d = hA(a, b, f) | 0;
+              l = e;
+              return d | 0;
+            }
+            function hA(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              g = l;
+              l = (l + 16) | 0;
+              e = g;
+              f = (a | 0) == 3;
+              h = f ? c[46938] | 0 : (a | 0) == 2 ? 1 : a;
+              c[46938] = h;
+              i = c[46939] | 0;
+              c[46939] = i >>> 0 > h >>> 0 ? i : h;
+              do
+                if (h >>> 0 < (c[46936] | 0) >>> 0) {
+                  a = c[46937] | 0;
+                  if (!a) {
+                    a = C6() | 0;
+                    c[46937] = a;
+                    if (!a) {
+                      a = 1;
+                      break;
+                    }
+                  }
+                  if (!f) {
+                    F6(a) | 0;
+                    a = c[46937] | 0;
+                  }
+                  H3(a, b, d) | 0;
+                  a = 0;
+                } else {
+                  if (c[46935] | 0) {
+                    iA(a, b, d);
+                    a = 0;
+                    break;
+                  }
+                  if (f) a = c[15712] | 0;
+                  else {
+                    i = c[15712] | 0;
+                    c[e >> 2] = (a | 0) == 1 ? 96349 : 96355;
+                    w4(i, 96363, e) | 0;
+                    a = i;
+                  }
+                  H3(a, b, d) | 0;
+                  a = 0;
+                }
+              while (0);
+              l = g;
+              return a | 0;
+            }
+            function iA(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              if ((c[46940] | 0) == 0 ? ((f = T1(c[4590] | 0) | 0), (c[46940] = f), (f | 0) == 0) : 0)
+                T4(96368, c[15712] | 0) | 0;
+              else e = 4;
+              do
+                if ((e | 0) == 4) {
+                  if ((a | 0) != 3) {
+                    kb[c[46935] & 63]((a | 0) == 1 ? 96349 : 96355) | 0;
+                    kb[c[46935] & 63](97027) | 0;
+                  }
+                  while (1) {
+                    a = G3(c[46940] | 0, c[4590] | 0, b, d) | 0;
+                    e = c[4590] | 0;
+                    if (((a | 0) > -1) & ((a | 0) < (e | 0))) {
+                      e = 7;
+                      break;
+                    }
+                    e = e << 1;
+                    f = (a + 1) | 0;
+                    f = (e | 0) > (f | 0) ? e : f;
+                    c[4590] = f;
+                    if (!(W1(c[46940] | 0, f) | 0)) {
+                      e = 9;
+                      break;
+                    }
+                  }
+                  if ((e | 0) == 7) {
+                    kb[c[46935] & 63](c[46940] | 0) | 0;
+                    break;
+                  } else if ((e | 0) == 9) {
+                    T4(96368, c[15712] | 0) | 0;
+                    break;
+                  }
+                }
+              while (0);
+              return;
+            }
+            function jA(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = l;
+              l = (l + 16) | 0;
+              e = d;
+              c[e >> 2] = b;
+              hA(1, a, e) | 0;
+              l = d;
+              return;
+            }
+            function kA(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0;
+              if (!e) {
+                e = (d | 0) == 0 ? 1024 : d;
+                d = e;
+                e = T1(e) | 0;
+                f = 1;
+              } else f = 0;
+              c[(b + 12) >> 2] = f;
+              c[b >> 2] = e;
+              c[(b + 8) >> 2] = e + d;
+              c[(b + 4) >> 2] = e;
+              a[e >> 0] = 0;
+              return;
+            }
+            function lA(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              h = (a + 8) | 0;
+              f = c[a >> 2] | 0;
+              g = ((c[h >> 2] | 0) - f) | 0;
+              e = g << 1;
+              g = (g + b) | 0;
+              e = g >>> 0 > e >>> 0 ? g : e;
+              g = (a + 4) | 0;
+              b = f;
+              f = ((c[g >> 2] | 0) - f) | 0;
+              d = (a + 12) | 0;
+              if (!(c[d >> 2] | 0)) {
+                i = T1(e) | 0;
+                W6(i | 0, b | 0, f | 0) | 0;
+                c[d >> 2] = 1;
+                b = i;
+              } else b = W1(b, e) | 0;
+              c[a >> 2] = b;
+              c[g >> 2] = b + f;
+              c[h >> 2] = b + e;
+              return 0;
+            }
+            function mA(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              f = (a + 4) | 0;
+              e = c[f >> 2] | 0;
+              if (((e + d) | 0) >>> 0 > (c[(a + 8) >> 2] | 0) >>> 0) {
+                lA(a, d) | 0;
+                e = c[f >> 2] | 0;
+              }
+              W6(e | 0, b | 0, d | 0) | 0;
+              c[f >> 2] = (c[f >> 2] | 0) + d;
+              return d | 0;
+            }
+            function nA(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return mA(a, b, l2(b) | 0) | 0;
+            }
+            function oA(a) {
+              a = a | 0;
+              if (c[(a + 12) >> 2] | 0) U1(c[a >> 2] | 0);
+              return;
+            }
+            function pA(a) {
+              a = a | 0;
+              var b = 0,
+                e = 0;
+              b = (a + 4) | 0;
+              e = c[b >> 2] | 0;
+              if (e >>> 0 > (c[a >> 2] | 0) >>> 0) {
+                c[b >> 2] = e + -1;
+                a = d[e >> 0] | 0;
+              } else a = -1;
+              return a | 0;
+            }
+            function qA(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              hD(c[46942] | 0, c[(b + 8) >> 2] | 0) | 0;
+              hD(c[46942] | 0, c[(b + 12) >> 2] | 0) | 0;
+              eC(c[46942] | 0, b);
+              return;
+            }
+            function rA(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0;
+              c = RC(a, 96416, 0) | 0;
+              if (((b | 0) != 0) & ((c | 0) == 0)) {
+                sA(a);
+                c = RC(a, 96416, 0) | 0;
+              }
+              return c | 0;
+            }
+            function sA(a) {
+              a = a | 0;
+              var b = 0,
+                c = 0,
+                d = 0;
+              d = yC(a) | 0;
+              BE(d, d, 107, 0, 1) | 0;
+              c = jC(d) | 0;
+              while (1) {
+                if (!c) break;
+                uA(a, c);
+                b = XA(d, c) | 0;
+                while (1) {
+                  if (!b) break;
+                  vA(a, b);
+                  b = ZA(d, b) | 0;
+                }
+                c = kC(d, c) | 0;
+              }
+              return;
+            }
+            function tA(b) {
+              b = b | 0;
+              var c = 0;
+              c = (b + 24) | 0;
+              a[c >> 0] = a[c >> 0] | 64;
+              AA(b);
+              c = QD(b) | 0;
+              xA((c | 0) == 0 ? b : c, b);
+              return;
+            }
+            function uA(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = wA(b) | 0;
+              if (!((d | 0) != 0 ? (c[(d + 8) >> 2] | 0) != 0 : 0)) xA(a, b);
+              return;
+            }
+            function vA(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = wA(b) | 0;
+              if (!((d | 0) != 0 ? (c[(d + 8) >> 2] | 0) != 0 : 0)) xA(a, b);
+              return;
+            }
+            function wA(a) {
+              a = a | 0;
+              return RC(a, 96404, 0) | 0;
+            }
+            function xA(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              d = TC(b, 96404, 16, 0) | 0;
+              f = yA(a, c[b >> 2] & 3) | 0;
+              e = (d + 8) | 0;
+              a: do
+                if (!(c[e >> 2] | 0)) {
+                  a = yC(a) | 0;
+                  c[e >> 2] = yA(a, c[b >> 2] & 3) | 0;
+                  a = zA(b) | 0;
+                  d = (d + 12) | 0;
+                  c[d >> 2] = dC(xC(b) | 0, ((a | 0) > 4 ? a : 4) << 2) | 0;
+                  a = nb[c[f >> 2] & 63](f, 0, 128) | 0;
+                  while (1) {
+                    if (!a) break a;
+                    e = xC(b) | 0;
+                    e = fD(e, c[(a + 12) >> 2] | 0) | 0;
+                    c[((c[d >> 2] | 0) + (c[(a + 16) >> 2] << 2)) >> 2] = e;
+                    a = nb[c[f >> 2] & 63](f, a, 8) | 0;
+                  }
+                }
+              while (0);
+              return;
+            }
+            function yA(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              e = l;
+              l = (l + 16) | 0;
+              d = e;
+              a = rA(a, 0) | 0;
+              a: do
+                if (!a) a = 0;
+                else
+                  switch (b | 0) {
+                    case 0: {
+                      a = c[(a + 16) >> 2] | 0;
+                      break a;
+                    }
+                    case 1: {
+                      a = c[(a + 8) >> 2] | 0;
+                      break a;
+                    }
+                    case 2:
+                    case 3: {
+                      a = c[(a + 12) >> 2] | 0;
+                      break a;
+                    }
+                    default: {
+                      c[d >> 2] = b;
+                      gA(1, 96429, d) | 0;
+                      a = 0;
+                      break a;
+                    }
+                  }
+              while (0);
+              l = e;
+              return a | 0;
+            }
+            function zA(a) {
+              a = a | 0;
+              var b = 0;
+              b = yC(xC(a) | 0) | 0;
+              a = yA(b, c[a >> 2] & 3) | 0;
+              if (!a) a = 0;
+              else a = Xz(a) | 0;
+              return a | 0;
+            }
+            function AA(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              d = TC(a, 96416, 20, 0) | 0;
+              e = (d + 8) | 0;
+              c[e >> 2] = UD(a, 18364, c[4589] | 0) | 0;
+              f = (d + 12) | 0;
+              c[f >> 2] = UD(a, 18364, c[4589] | 0) | 0;
+              d = (d + 16) | 0;
+              c[d >> 2] = UD(a, 18364, c[4589] | 0) | 0;
+              b = QD(a) | 0;
+              if (!b) {
+                b = c[46941] | 0;
+                if (!(((b | 0) == 0) | ((b | 0) == (a | 0)))) {
+                  b = rA(b, 0) | 0;
+                  BA(c[(b + 8) >> 2] | 0, c[e >> 2] | 0, a, 1);
+                  BA(c[(b + 12) >> 2] | 0, c[f >> 2] | 0, a, 2);
+                  BA(c[(b + 16) >> 2] | 0, c[d >> 2] | 0, a, 0);
+                }
+              } else {
+                a = rA(b, 0) | 0;
+                _z(c[e >> 2] | 0, c[(a + 8) >> 2] | 0) | 0;
+                _z(c[f >> 2] | 0, c[(a + 12) >> 2] | 0) | 0;
+                _z(c[d >> 2] | 0, c[(a + 16) >> 2] | 0) | 0;
+              }
+              return;
+            }
+            function BA(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0;
+              g = nb[c[b >> 2] & 63](b, 0, 128) | 0;
+              while (1) {
+                if (!g) break;
+                h = CA(e, c[(g + 8) >> 2] | 0, c[(g + 12) >> 2] | 0, c[(g + 16) >> 2] | 0, f) | 0;
+                a[(h + 22) >> 0] = a[(g + 22) >> 0] | 0;
+                a[(h + 21) >> 0] = a[(g + 21) >> 0] | 0;
+                nb[c[d >> 2] & 63](d, h, 1) | 0;
+                g = nb[c[b >> 2] & 63](b, g, 8) | 0;
+              }
+              return;
+            }
+            function CA(b, d, e, f, g) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0;
+              h = dC(b, 24) | 0;
+              a[(h + 20) >> 0] = g;
+              c[(h + 8) >> 2] = fD(b, d) | 0;
+              c[(h + 12) >> 2] = fD(b, e) | 0;
+              c[(h + 16) >> 2] = f;
+              return h | 0;
+            }
+            function DA(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = l;
+              l = (l + 32) | 0;
+              e = d;
+              c[(e + 8) >> 2] = b;
+              b = nb[c[a >> 2] & 63](a, e, 4) | 0;
+              l = d;
+              return b | 0;
+            }
+            function EA(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0;
+              c = _z(a, 0) | 0;
+              b = DA(a, b) | 0;
+              _z(a, c) | 0;
+              return b | 0;
+            }
+            function FA(a, b) {
+              a = a | 0;
+              b = b | 0;
+              a = wA(a) | 0;
+              if (!a) a = 0;
+              else a = DA(c[(a + 8) >> 2] | 0, b) | 0;
+              return a | 0;
+            }
+            function GA(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0;
+              h = l;
+              l = (l + 16) | 0;
+              g = h;
+              if (!b) {
+                b = c[46941] | 0;
+                if (!b) {
+                  a[g >> 0] = a[18400] | 0;
+                  a[(g + 1) >> 0] = a[18401] | 0;
+                  a[(g + 2) >> 0] = a[18402] | 0;
+                  a[(g + 3) >> 0] = a[18403] | 0;
+                  b = oB(0, g, 0) | 0;
+                  c[46941] = b;
+                }
+              }
+              if (!f) b = IA(b, d, e) | 0;
+              else b = HA(b, d, e, f) | 0;
+              l = h;
+              return b | 0;
+            }
+            function HA(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = yC(a) | 0;
+              rA(a, 1) | 0;
+              g = yA(a, b) | 0;
+              f = EA(g, d) | 0;
+              a: do
+                if (!f) {
+                  f = DA(g, d) | 0;
+                  if (f | 0) {
+                    f = CA(a, d, e, c[(f + 16) >> 2] | 0, b) | 0;
+                    nb[c[g >> 2] & 63](g, f, 1) | 0;
+                    h = 16;
+                    break;
+                  }
+                  g = yA(i, b) | 0;
+                  f = CA(a, d, e, Xz(g) | 0, b) | 0;
+                  nb[c[g >> 2] & 63](g, f, 1) | 0;
+                  switch (b | 0) {
+                    case 0: {
+                      BE(i, i, 57, f, 1) | 0;
+                      h = 16;
+                      break a;
+                    }
+                    case 1: {
+                      d = jC(i) | 0;
+                      while (1) {
+                        if (!d) {
+                          h = 16;
+                          break a;
+                        }
+                        JA(a, d, f);
+                        d = kC(i, d) | 0;
+                      }
+                    }
+                    case 2:
+                    case 3: {
+                      g = jC(i) | 0;
+                      while (1) {
+                        if (!g) {
+                          h = 16;
+                          break a;
+                        }
+                        d = XA(i, g) | 0;
+                        while (1) {
+                          if (!d) break;
+                          JA(a, d, f);
+                          d = ZA(i, d) | 0;
+                        }
+                        g = kC(i, g) | 0;
+                      }
+                    }
+                    default:
+                      break a;
+                  }
+                } else {
+                  h = (f + 12) | 0;
+                  hD(a, c[h >> 2] | 0) | 0;
+                  c[h >> 2] = fD(a, e) | 0;
+                  h = 16;
+                }
+              while (0);
+              if ((h | 0) == 16) if (((b | 0) == 0) & ((f | 0) != 0)) KA(a, f, e) | 0;
+              BC(a, a, f);
+              return f | 0;
+            }
+            function IA(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              a = yA(a, b) | 0;
+              if (!a) a = 0;
+              else a = DA(a, c) | 0;
+              return a | 0;
+            }
+            function JA(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              b = wA(b) | 0;
+              f = (d + 16) | 0;
+              e = c[f >> 2] | 0;
+              if ((e | 0) > 3) {
+                g = c[(a + 64) >> 2] | 0;
+                b = (b + 12) | 0;
+                e = e << 2;
+                c[b >> 2] =
+                  ob[c[((c[g >> 2] | 0) + 8) >> 2] & 127](c[(g + 12) >> 2] | 0, c[b >> 2] | 0, e, (e + 4) | 0) | 0;
+              } else b = (b + 12) | 0;
+              g = fD(a, c[(d + 12) >> 2] | 0) | 0;
+              c[((c[b >> 2] | 0) + (c[f >> 2] << 2)) >> 2] = g;
+              return;
+            }
+            function KA(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              h = xC(a) | 0;
+              g = ((wA(a) | 0) + 12) | 0;
+              i = (b + 16) | 0;
+              hD(h, c[((c[g >> 2] | 0) + (c[i >> 2] << 2)) >> 2] | 0) | 0;
+              f = fD(h, d) | 0;
+              c[((c[g >> 2] | 0) + (c[i >> 2] << 2)) >> 2] = f;
+              do
+                if (!(c[a >> 2] & 3)) {
+                  e = c[((rA(h, 0) | 0) + 16) >> 2] | 0;
+                  f = (b + 8) | 0;
+                  g = EA(e, c[f >> 2] | 0) | 0;
+                  if (!g) {
+                    i = CA(h, c[f >> 2] | 0, d, c[i >> 2] | 0, c[a >> 2] & 3) | 0;
+                    nb[c[e >> 2] & 63](e, i, 1) | 0;
+                    break;
+                  } else {
+                    i = (g + 12) | 0;
+                    hD(h, c[i >> 2] | 0) | 0;
+                    c[i >> 2] = fD(h, d) | 0;
+                    break;
+                  }
+                }
+              while (0);
+              BC(h, a, b);
+              return 0;
+            }
+            function LA(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              a = yA(a, b) | 0;
+              do
+                if (a) {
+                  b = c[a >> 2] | 0;
+                  if (!d) {
+                    a = nb[b & 63](a, 0, 128) | 0;
+                    break;
+                  } else {
+                    a = nb[b & 63](a, d, 8) | 0;
+                    break;
+                  }
+                } else a = 0;
+              while (0);
+              return a | 0;
+            }
+            function MA(a) {
+              a = a | 0;
+              var b = 0;
+              c[46942] = a;
+              b = wA(a) | 0;
+              if (b | 0) {
+                NA(a, b);
+                VC(a, c[b >> 2] | 0) | 0;
+              }
+              b = rA(a, 0) | 0;
+              if (b)
+                if (
+                  ((WD(a, c[(b + 8) >> 2] | 0) | 0) == 0 ? (WD(a, c[(b + 12) >> 2] | 0) | 0) == 0 : 0)
+                    ? (WD(a, c[(b + 16) >> 2] | 0) | 0) == 0
+                    : 0
+                ) {
+                  VC(a, c[b >> 2] | 0) | 0;
+                  b = 0;
+                } else b = 1;
+              else b = 0;
+              return b | 0;
+            }
+            function NA(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              f = xC(a) | 0;
+              e = zA(a) | 0;
+              b = (b + 12) | 0;
+              a = 0;
+              while (1) {
+                d = c[b >> 2] | 0;
+                if ((a | 0) >= (e | 0)) break;
+                hD(f, c[(d + (a << 2)) >> 2] | 0) | 0;
+                a = (a + 1) | 0;
+              }
+              eC(f, d);
+              return;
+            }
+            function OA(a) {
+              a = a | 0;
+              var b = 0;
+              b = wA(a) | 0;
+              if (b | 0) {
+                NA(a, b);
+                VC(a, 96404) | 0;
+              }
+              return;
+            }
+            function PA(a) {
+              a = a | 0;
+              var b = 0;
+              b = wA(a) | 0;
+              if (b | 0) {
+                NA(a, b);
+                VC(a, 96404) | 0;
+              }
+              return;
+            }
+            function QA(a, b) {
+              a = a | 0;
+              b = b | 0;
+              b = FA(a, b) | 0;
+              if (!b) b = 0;
+              else {
+                a = c[((wA(a) | 0) + 12) >> 2] | 0;
+                b = c[(a + (c[(b + 16) >> 2] << 2)) >> 2] | 0;
+              }
+              return b | 0;
+            }
+            function RA(a, b) {
+              a = a | 0;
+              b = b | 0;
+              a = c[((wA(a) | 0) + 12) >> 2] | 0;
+              return c[(a + (c[(b + 16) >> 2] << 2)) >> 2] | 0;
+            }
+            function SA(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              b = FA(a, b) | 0;
+              if (!b) b = -1;
+              else {
+                KA(a, b, c) | 0;
+                b = 0;
+              }
+              return b | 0;
+            }
+            function TA(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0;
+              f = xC(a) | 0;
+              f = GA(f, c[a >> 2] & 3, b, 0) | 0;
+              if (!f) {
+                f = xC(a) | 0;
+                f = GA(f, c[a >> 2] & 3, b, e) | 0;
+              }
+              KA(a, f, d) | 0;
+              return 0;
+            }
+            function UA(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              g = xC(a) | 0;
+              f = c[a >> 2] | 0;
+              a: do
+                if (!((c[b >> 2] ^ f) & 3)) {
+                  d = 1;
+                  e = 0;
+                  while (1) {
+                    e = LA(g, f & 3, e) | 0;
+                    if (!e) break a;
+                    d = FA(b, c[(e + 8) >> 2] | 0) | 0;
+                    if (!d) {
+                      d = 1;
+                      break a;
+                    }
+                    f = RA(a, e) | 0;
+                    KA(b, d, f) | 0;
+                    if (iD(f) | 0) jD(RA(b, d) | 0);
+                    d = 0;
+                    f = c[a >> 2] | 0;
+                  }
+                } else d = 1;
+              while (0);
+              return d | 0;
+            }
+            function VA(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              a = c[(b + 40) >> 2] | 0;
+              f = c[(d + 40) >> 2] | 0;
+              if ((a | 0) == (f | 0)) {
+                e = (c[b >> 2] | 0) >>> 4;
+                a = (c[d >> 2] | 0) >>> 4;
+                if (e >>> 0 >= a >>> 0)
+                  if (e >>> 0 > a >>> 0) a = 1;
+                  else g = 6;
+                else a = -1;
+              } else {
+                e = (c[a >> 2] | 0) >>> 4;
+                a = (c[f >> 2] | 0) >>> 4;
+                if (e >>> 0 >= a >>> 0)
+                  if (e >>> 0 > a >>> 0) a = 1;
+                  else g = 6;
+                else a = -1;
+              }
+              if ((g | 0) == 6) a = 0;
+              return a | 0;
+            }
+            function WA(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              a = ((c[(b + 40) >> 2] | 0) + 8) | 0;
+              g = c[a >> 2] | 0;
+              a = c[(a + 4) >> 2] | 0;
+              f = ((c[(d + 40) >> 2] | 0) + 8) | 0;
+              e = c[f >> 2] | 0;
+              f = c[(f + 4) >> 2] | 0;
+              do
+                if (!((a >>> 0 < f >>> 0) | (((a | 0) == (f | 0)) & (g >>> 0 < e >>> 0))))
+                  if ((a >>> 0 > f >>> 0) | (((a | 0) == (f | 0)) & (g >>> 0 > e >>> 0))) a = 1;
+                  else {
+                    e = (b + 8) | 0;
+                    a = c[e >> 2] | 0;
+                    e = c[(e + 4) >> 2] | 0;
+                    if (
+                      !(((a | 0) == 0) & ((e | 0) == 0))
+                        ? ((i = (d + 8) | 0),
+                          (h = c[i >> 2] | 0),
+                          (i = c[(i + 4) >> 2] | 0),
+                          !(((h | 0) == 0) & ((i | 0) == 0)))
+                        : 0
+                    ) {
+                      if ((e >>> 0 < i >>> 0) | (((e | 0) == (i | 0)) & (a >>> 0 < h >>> 0))) {
+                        a = -1;
+                        break;
+                      }
+                      if ((e >>> 0 > i >>> 0) | (((e | 0) == (i | 0)) & (a >>> 0 > h >>> 0))) {
+                        a = 1;
+                        break;
+                      }
+                    }
+                    a = 0;
+                  }
+                else a = -1;
+              while (0);
+              return a | 0;
+            }
+            function XA(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              b = YA(a, b) | 0;
+              if (!b) b = 0;
+              else {
+                d = (a + 44) | 0;
+                a = (b + 32) | 0;
+                Wz(c[d >> 2] | 0, c[a >> 2] | 0) | 0;
+                b = c[d >> 2] | 0;
+                b = nb[c[b >> 2] & 63](b, 0, 128) | 0;
+                c[a >> 2] = Sz(c[d >> 2] | 0) | 0;
+              }
+              return b | 0;
+            }
+            function YA(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              e = l;
+              l = (l + 48) | 0;
+              d = e;
+              if ((c[(b + 24) >> 2] | 0) == (a | 0)) a = (b + 28) | 0;
+              else {
+                c[(d + 16) >> 2] = b;
+                a = c[(a + 40) >> 2] | 0;
+                a = nb[c[a >> 2] & 63](a, d, 4) | 0;
+              }
+              l = e;
+              return a | 0;
+            }
+            function ZA(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = YA(a, c[((((c[b >> 2] & 3) | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0) | 0;
+              if (!d) a = 0;
+              else {
+                e = (a + 44) | 0;
+                d = (d + 32) | 0;
+                Wz(c[e >> 2] | 0, c[d >> 2] | 0) | 0;
+                a = c[e >> 2] | 0;
+                a = nb[c[a >> 2] & 63](a, b, 8) | 0;
+                c[d >> 2] = Sz(c[e >> 2] | 0) | 0;
+              }
+              return a | 0;
+            }
+            function _A(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              b = YA(a, b) | 0;
+              if (!b) b = 0;
+              else {
+                d = (a + 44) | 0;
+                a = (b + 28) | 0;
+                Wz(c[d >> 2] | 0, c[a >> 2] | 0) | 0;
+                b = c[d >> 2] | 0;
+                b = nb[c[b >> 2] & 63](b, 0, 128) | 0;
+                c[a >> 2] = Sz(c[d >> 2] | 0) | 0;
+              }
+              return b | 0;
+            }
+            function $A(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = YA(a, c[((((c[b >> 2] & 3) | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0) | 0;
+              if (!d) a = 0;
+              else {
+                e = (a + 44) | 0;
+                d = (d + 28) | 0;
+                Wz(c[e >> 2] | 0, c[d >> 2] | 0) | 0;
+                a = c[e >> 2] | 0;
+                a = nb[c[a >> 2] & 63](a, b, 8) | 0;
+                c[d >> 2] = Sz(c[e >> 2] | 0) | 0;
+              }
+              return a | 0;
+            }
+            function aB(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0;
+              c = XA(a, b) | 0;
+              if (!c) c = _A(a, b) | 0;
+              return c | 0;
+            }
+            function bB(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              a: do
+                if (((c[b >> 2] & 3) | 0) == 2) {
+                  b = ZA(a, b) | 0;
+                  if (!b) {
+                    b = 0;
+                    do {
+                      if (!b) b = _A(a, d) | 0;
+                      else b = $A(a, b) | 0;
+                      if (!b) {
+                        b = 0;
+                        break a;
+                      }
+                    } while ((c[(b + 40) >> 2] | 0) == (d | 0));
+                  }
+                } else
+                  do {
+                    b = $A(a, b) | 0;
+                    if (!b) {
+                      b = 0;
+                      break a;
+                    }
+                  } while ((c[(b + 40) >> 2] | 0) == (d | 0));
+              while (0);
+              return b | 0;
+            }
+            function cB(a, b, e) {
+              a = a | 0;
+              b = b | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 32) | 0;
+              f = (h + 16) | 0;
+              g = h;
+              if (
+                (zB(a) | 0) != 0
+                  ? ((c[g >> 2] = 0),
+                    (c[(g + 4) >> 2] = 0),
+                    (c[(g + 8) >> 2] = 0),
+                    (c[(g + 12) >> 2] = 0),
+                    (c[f >> 2] = c[g >> 2]),
+                    (c[(f + 4) >> 2] = c[(g + 4) >> 2]),
+                    (c[(f + 8) >> 2] = c[(g + 8) >> 2]),
+                    (c[(f + 12) >> 2] = c[(g + 12) >> 2]),
+                    (gB(a, b, e, f) | 0) != 0)
+                  : 0
+              )
+                f = 0;
+              else f = (((((d[(a + 24) >> 0] | 0) >>> 2) & 1) ^ 1) & 255) | ((b | 0) != (e | 0));
+              l = h;
+              return f | 0;
+            }
+            function dB(a, b) {
+              a = a | 0;
+              b = b | 0;
+              fB(a, b);
+              return;
+            }
+            function eB(b, d, e, f, g) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              oC(b, d, 1) | 0;
+              oC(b, e, 1) | 0;
+              h = dC(b, 96) | 0;
+              i = (h + 48) | 0;
+              l = rB(b, 2) | 0;
+              j = c[i >> 2] | 0;
+              k = c[h >> 2] | 0;
+              m = (h + 8) | 0;
+              c[m >> 2] = f;
+              c[(m + 4) >> 2] = g;
+              m = (h + 56) | 0;
+              c[m >> 2] = f;
+              c[(m + 4) >> 2] = g;
+              g = l << 4;
+              c[h >> 2] = (k & 12) | g | 2;
+              c[i >> 2] = (j & 12) | g | 3;
+              c[(h + 88) >> 2] = d;
+              c[(h + 40) >> 2] = e;
+              fB(b, h);
+              if (a[(b + 24) >> 0] & 64) {
+                TC(h, 96404, 16, 0) | 0;
+                vA(b, h);
+              }
+              zC(b, h);
+              return h | 0;
+            }
+            function fB(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              i = l;
+              l = (l + 16) | 0;
+              d = i;
+              h = c[b >> 2] & 3;
+              g = (h | 0) == 2 ? b : (b + -48) | 0;
+              h = (h | 0) == 3 ? b : (b + 48) | 0;
+              e = c[(h + 40) >> 2] | 0;
+              f = c[(g + 40) >> 2] | 0;
+              while (1) {
+                if (!a) break;
+                c[d >> 2] = c[b >> 2];
+                c[(d + 4) >> 2] = c[(b + 4) >> 2];
+                c[(d + 8) >> 2] = c[(b + 8) >> 2];
+                c[(d + 12) >> 2] = c[(b + 12) >> 2];
+                if (gB(a, e, f, d) | 0) break;
+                j = YA(a, e) | 0;
+                m = (a + 44) | 0;
+                hB(c[m >> 2] | 0, (j + 32) | 0, g);
+                k = (a + 48) | 0;
+                hB(c[k >> 2] | 0, (j + 24) | 0, g);
+                j = YA(a, f) | 0;
+                hB(c[m >> 2] | 0, (j + 28) | 0, h);
+                hB(c[k >> 2] | 0, (j + 20) | 0, h);
+                a = QD(a) | 0;
+              }
+              l = i;
+              return;
+            }
+            function gB(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 48) | 0;
+              f = h;
+              if (
+                !(((b | 0) == 0) | ((d | 0) == 0))
+                  ? ((c[f >> 2] = c[e >> 2]),
+                    (c[(f + 4) >> 2] = c[(e + 4) >> 2]),
+                    (c[(f + 8) >> 2] = c[(e + 8) >> 2]),
+                    (c[(f + 12) >> 2] = c[(e + 12) >> 2]),
+                    (c[(f + 40) >> 2] = b),
+                    (g = YA(a, d) | 0),
+                    (g | 0) != 0)
+                  : 0
+              ) {
+                e = (a + 48) | 0;
+                g = (g + 20) | 0;
+                Wz(c[e >> 2] | 0, c[g >> 2] | 0) | 0;
+                a = c[e >> 2] | 0;
+                a = nb[c[a >> 2] & 63](a, f, 4) | 0;
+                c[g >> 2] = Sz(c[e >> 2] | 0) | 0;
+              } else a = 0;
+              l = h;
+              return a | 0;
+            }
+            function hB(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              Wz(a, c[b >> 2] | 0) | 0;
+              nb[c[a >> 2] & 63](a, d, 1) | 0;
+              c[b >> 2] = Sz(a) | 0;
+              return;
+            }
+            function iB(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              n = l;
+              l = (l + 48) | 0;
+              i = (n + 24) | 0;
+              k = (n + 16) | 0;
+              j = n;
+              do
+                if (!(HB(a, 2, e, k, 0) | 0))
+                  if (!e) {
+                    if (f | 0 ? (zB(a) | 0) == 0 : 0) {
+                      m = 18;
+                      break;
+                    }
+                    c[j >> 2] = 0;
+                    c[(j + 4) >> 2] = 0;
+                    c[(j + 8) >> 2] = 0;
+                    c[(j + 12) >> 2] = 0;
+                    m = 7;
+                  } else m = 17;
+                else {
+                  o = j;
+                  c[o >> 2] = 0;
+                  c[(o + 4) >> 2] = 0;
+                  o = k;
+                  g = c[(o + 4) >> 2] | 0;
+                  m = (j + 8) | 0;
+                  c[m >> 2] = c[o >> 2];
+                  c[(m + 4) >> 2] = g;
+                  c[j >> 2] = 2;
+                  m = 7;
+                }
+              while (0);
+              a: do
+                if ((m | 0) == 7) {
+                  c[i >> 2] = c[j >> 2];
+                  c[(i + 4) >> 2] = c[(j + 4) >> 2];
+                  c[(i + 8) >> 2] = c[(j + 8) >> 2];
+                  c[(i + 12) >> 2] = c[(j + 12) >> 2];
+                  g = gB(a, b, d, i) | 0;
+                  b: do
+                    if (!g) {
+                      if (
+                        yB(a) | 0
+                          ? ((c[i >> 2] = c[j >> 2]),
+                            (c[(i + 4) >> 2] = c[(j + 4) >> 2]),
+                            (c[(i + 8) >> 2] = c[(j + 8) >> 2]),
+                            (c[(i + 12) >> 2] = c[(j + 12) >> 2]),
+                            (h = gB(a, d, b, i) | 0),
+                            h | 0)
+                          : 0
+                      ) {
+                        g = h;
+                        break;
+                      }
+                      do
+                        if (f | 0) {
+                          g = yC(a) | 0;
+                          c[i >> 2] = c[j >> 2];
+                          c[(i + 4) >> 2] = c[(j + 4) >> 2];
+                          c[(i + 8) >> 2] = c[(j + 8) >> 2];
+                          c[(i + 12) >> 2] = c[(j + 12) >> 2];
+                          g = gB(g, b, d, i) | 0;
+                          if (!g) {
+                            if (!(yB(a) | 0)) break;
+                            g = yC(a) | 0;
+                            c[i >> 2] = c[j >> 2];
+                            c[(i + 4) >> 2] = c[(j + 4) >> 2];
+                            c[(i + 8) >> 2] = c[(j + 8) >> 2];
+                            c[(i + 12) >> 2] = c[(j + 12) >> 2];
+                            g = gB(g, d, b, i) | 0;
+                            if (!g) break;
+                          }
+                          dB(a, g);
+                          break b;
+                        }
+                      while (0);
+                      m = 17;
+                      break a;
+                    }
+                  while (0);
+                }
+              while (0);
+              if ((m | 0) == 17)
+                if (!f) g = 0;
+                else m = 18;
+              if ((m | 0) == 18)
+                if ((cB(a, b, d) | 0) != 0 ? (HB(a, 2, e, k, 1) | 0) != 0 : 0) {
+                  g = k;
+                  g = eB(a, b, d, c[g >> 2] | 0, c[(g + 4) >> 2] | 0) | 0;
+                  LB(a, 2, g);
+                } else g = 0;
+              l = n;
+              return g | 0;
+            }
+            function jB(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              d = ((c[b >> 2] & 3) | 0) == 3;
+              g = d ? (b + -48) | 0 : b;
+              d = d ? b : (b + 48) | 0;
+              b = c[(g + 40) >> 2] | 0;
+              h = YA(a, c[(d + 40) >> 2] | 0) | 0;
+              f = (a + 44) | 0;
+              kB(c[f >> 2] | 0, (h + 32) | 0, g);
+              e = (a + 48) | 0;
+              kB(c[e >> 2] | 0, (h + 24) | 0, g);
+              b = YA(a, b) | 0;
+              kB(c[f >> 2] | 0, (b + 28) | 0, d);
+              kB(c[e >> 2] | 0, (b + 20) | 0, d);
+              return;
+            }
+            function kB(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              Wz(a, c[b >> 2] | 0) | 0;
+              nb[c[a >> 2] & 63](a, d, 2) | 0;
+              c[b >> 2] = Sz(a) | 0;
+              return;
+            }
+            function lB(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              e = l;
+              l = (l + 16) | 0;
+              f = e;
+              d = ((c[d >> 2] & 3) | 0) == 2 ? d : (d + -48) | 0;
+              g = c[d >> 2] & 3;
+              h = c[(((g | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0;
+              g = c[(((g | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0;
+              c[f >> 2] = c[d >> 2];
+              c[(f + 4) >> 2] = c[(d + 4) >> 2];
+              c[(f + 8) >> 2] = c[(d + 8) >> 2];
+              c[(f + 12) >> 2] = c[(d + 12) >> 2];
+              if (gB(b, h, g, f) | 0) {
+                if ((yC(b) | 0) == (b | 0)) {
+                  if (a[(b + 24) >> 0] & 64) PA(d);
+                  DC(b, d);
+                  $C(d);
+                  h = (d + 8) | 0;
+                  JB(b, 2, c[h >> 2] | 0, c[(h + 4) >> 2] | 0);
+                }
+                if (!(BE(b, d, 58, 0, 0) | 0))
+                  if ((yC(b) | 0) == (b | 0)) {
+                    eC(b, d);
+                    d = 0;
+                  } else d = 0;
+                else d = -1;
+              } else d = -1;
+              l = e;
+              return d | 0;
+            }
+            function mB(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 16) | 0;
+              e = h;
+              f = oC(a, c[((((c[b >> 2] & 3) | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0, d) | 0;
+              g = oC(a, c[((((c[b >> 2] & 3) | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0, d) | 0;
+              do
+                if (((f | 0) != 0) & ((g | 0) != 0)) {
+                  c[e >> 2] = c[b >> 2];
+                  c[(e + 4) >> 2] = c[(b + 4) >> 2];
+                  c[(e + 8) >> 2] = c[(b + 8) >> 2];
+                  c[(e + 12) >> 2] = c[(b + 12) >> 2];
+                  e = gB(a, f, g, e) | 0;
+                  f = (e | 0) == 0;
+                  if (!(((d | 0) != 0) & f)) {
+                    if (f) break;
+                  } else {
+                    fB(a, b);
+                    e = b;
+                  }
+                  d = c[e >> 2] & 3;
+                  l = h;
+                  return ((d | 0) == ((c[b >> 2] & 3) | 0) ? e : (e + ((((d | 0) == 3 ? -1 : 1) * 48) | 0)) | 0) | 0;
+                }
+              while (0);
+              l = h;
+              return 0;
+            }
+            function nB(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              b = (b + 8) | 0;
+              e = (d + 8) | 0;
+              e = K6(c[b >> 2] | 0, c[(b + 4) >> 2] | 0, c[e >> 2] | 0, c[(e + 4) >> 2] | 0) | 0;
+              return ((e | 0) == 0 ? 0 : (e >> 31) | 1) | 0;
+            }
+            function oB(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              h = l;
+              l = (l + 16) | 0;
+              g = h;
+              j = pB(e) | 0;
+              f = lb[c[((c[j >> 2] | 0) + 4) >> 2] & 127](c[(j + 12) >> 2] | 0, 72) | 0;
+              c[f >> 2] = c[f >> 2] & -4;
+              i = (f + 64) | 0;
+              c[i >> 2] = j;
+              k = (f + 24) | 0;
+              d = c[d >> 2] | 0;
+              c[k >> 2] = d;
+              a[k >> 0] = (d & 255) | 8;
+              c[(f + 60) >> 2] = f;
+              e = lb[c[c[(j + 4) >> 2] >> 2] & 127](f, e) | 0;
+              c[((c[i >> 2] | 0) + 16) >> 2] = e;
+              if (HB(f, 0, b, g, 1) | 0) {
+                i = g;
+                j = c[(i + 4) >> 2] | 0;
+                k = (f + 8) | 0;
+                c[k >> 2] = c[i >> 2];
+                c[(k + 4) >> 2] = j;
+              }
+              k = qB(f) | 0;
+              LB(k, 0, f);
+              l = h;
+              return k | 0;
+            }
+            function pB(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              d = (b | 0) != 0;
+              if (d) {
+                e = c[b >> 2] | 0;
+                e = (e | 0) == 0 ? 18736 : e;
+              } else e = 18736;
+              g = kb[c[e >> 2] & 63](b) | 0;
+              f = lb[c[(e + 4) >> 2] & 127](g, 80) | 0;
+              c[f >> 2] = e;
+              c[(f + 12) >> 2] = g;
+              if (d) {
+                g = c[(b + 4) >> 2] | 0;
+                c[(f + 4) >> 2] = (g | 0) == 0 ? 18612 : g;
+                b = c[(b + 8) >> 2] | 0;
+                b = (b | 0) == 0 ? 18712 : b;
+              } else {
+                c[(f + 4) >> 2] = 18612;
+                b = 18712;
+              }
+              c[(f + 8) >> 2] = b;
+              a[(f + 52) >> 0] = 1;
+              return f | 0;
+            }
+            function qB(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              c[(b + 36) >> 2] = UD(b, 18792, c[4589] | 0) | 0;
+              c[(b + 40) >> 2] = UD(b, 18756, c[4589] | 0) | 0;
+              d = (yC(b) | 0) == (b | 0);
+              c[(b + 44) >> 2] = UD(b, d ? 18404 : 18440, c[4589] | 0) | 0;
+              d = (yC(b) | 0) == (b | 0);
+              c[(b + 48) >> 2] = UD(b, d ? 18476 : 18512, c[4589] | 0) | 0;
+              c[(b + 52) >> 2] = UD(b, 18548, c[4589] | 0) | 0;
+              d = QD(b) | 0;
+              if (
+                !((d | 0) != 0
+                  ? ((e = rB(d, 0) | 0),
+                    (c[b >> 2] = (c[b >> 2] & 15) | (e << 4)),
+                    (e = c[(d + 52) >> 2] | 0),
+                    nb[c[e >> 2] & 63](e, b, 1) | 0,
+                    !(a[(d + 24) >> 0] & 64))
+                  : 0)
+              )
+                tA(b);
+              zC(b, b);
+              return b | 0;
+            }
+            function rB(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = ((c[(a + 64) >> 2] | 0) + 24 + (b << 3)) | 0;
+              b = d;
+              b = J6(c[b >> 2] | 0, c[(b + 4) >> 2] | 0, 1, 0) | 0;
+              a = z;
+              c[d >> 2] = b;
+              c[(d + 4) >> 2] = a;
+              z = a;
+              return b | 0;
+            }
+            function sB(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              f = QD(b) | 0;
+              g = (f | 0) == 0;
+              if (g ? ((d = (b + 64) | 0), (c[((c[c[d >> 2] >> 2] | 0) + 16) >> 2] | 0) != 0) : 0) {
+                DC(b, b);
+                g = (b + 8) | 0;
+                JB(b, 0, c[g >> 2] | 0, c[(g + 4) >> 2] | 0);
+                d = c[d >> 2] | 0;
+                tb[c[((c[d >> 2] | 0) + 16) >> 2] & 127](c[(d + 12) >> 2] | 0);
+                d = 0;
+              } else e = 4;
+              do
+                if ((e | 0) == 4) {
+                  d = OD(b) | 0;
+                  while (1) {
+                    if (!d) break;
+                    e = PD(d) | 0;
+                    sB(d) | 0;
+                    d = e;
+                  }
+                  d = jC(b) | 0;
+                  while (1) {
+                    if (!d) break;
+                    e = kC(b, d) | 0;
+                    vC(b, d) | 0;
+                    d = e;
+                  }
+                  UB(b);
+                  DC(b, b);
+                  if (
+                    (
+                      (
+                        ((WD(b, c[(b + 40) >> 2] | 0) | 0) == 0 ? (WD(b, c[(b + 36) >> 2] | 0) | 0) == 0 : 0)
+                          ? (WD(b, c[(b + 48) >> 2] | 0) | 0) == 0
+                          : 0
+                      )
+                        ? (WD(b, c[(b + 44) >> 2] | 0) | 0) == 0
+                        : 0
+                    )
+                      ? (WD(b, c[(b + 52) >> 2] | 0) | 0) == 0
+                      : 0
+                  ) {
+                    if (a[(b + 24) >> 0] & 64 ? MA(b) | 0 : 0) {
+                      d = -1;
+                      break;
+                    }
+                    $C(b);
+                    e = (b + 8) | 0;
+                    JB(b, 0, c[e >> 2] | 0, c[(e + 4) >> 2] | 0);
+                    if (!g) {
+                      RD(f, b) | 0;
+                      eC(f, b);
+                      d = 0;
+                      break;
+                    }
+                    d = (b + 64) | 0;
+                    while (1) {
+                      e = c[d >> 2] | 0;
+                      f = c[(e + 48) >> 2] | 0;
+                      if (!f) break;
+                      GC(b, c[f >> 2] | 0) | 0;
+                    }
+                    tb[c[((c[(e + 4) >> 2] | 0) + 20) >> 2] & 127](c[(e + 16) >> 2] | 0);
+                    if (!(aD(b) | 0)) {
+                      d = c[d >> 2] | 0;
+                      g = c[(d + 12) >> 2] | 0;
+                      f = ((c[d >> 2] | 0) + 12) | 0;
+                      ub[c[f >> 2] & 63](g, b);
+                      ub[c[f >> 2] & 63](g, d);
+                      d = 0;
+                    } else d = -1;
+                  } else d = -1;
+                }
+              while (0);
+              return d | 0;
+            }
+            function tB(a) {
+              a = a | 0;
+              return Xz(c[(a + 40) >> 2] | 0) | 0;
+            }
+            function uB(a) {
+              a = a | 0;
+              var b = 0,
+                c = 0,
+                d = 0;
+              b = 0;
+              c = jC(a) | 0;
+              while (1) {
+                if (!c) break;
+                d = ((vB(a, c, 0, 1) | 0) + b) | 0;
+                b = d;
+                c = kC(a, c) | 0;
+              }
+              return b | 0;
+            }
+            function vB(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0;
+              f = YA(a, b) | 0;
+              if (f) {
+                if (!e) b = 0;
+                else b = wB(c[(a + 44) >> 2] | 0, (f + 32) | 0) | 0;
+                if (d) b = ((wB(c[(a + 44) >> 2] | 0, (f + 28) | 0) | 0) + b) | 0;
+              } else b = 0;
+              return b | 0;
+            }
+            function wB(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              Wz(a, c[b >> 2] | 0) | 0;
+              d = Xz(a) | 0;
+              c[b >> 2] = Sz(a) | 0;
+              return d | 0;
+            }
+            function xB(b) {
+              b = b | 0;
+              return (a[(b + 24) >> 0] & 1) | 0;
+            }
+            function yB(a) {
+              a = a | 0;
+              return ((xB(a) | 0) == 0) | 0;
+            }
+            function zB(a) {
+              a = a | 0;
+              return (((d[(a + 24) >> 0] | 0) >>> 1) & 1) | 0;
+            }
+            function AB(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return a | 0;
+            }
+            function BB(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              if (!d) {
+                f = 1392;
+                d = c[f >> 2] | 0;
+                f = c[(f + 4) >> 2] | 0;
+                c[e >> 2] = d;
+                c[(e + 4) >> 2] = f;
+                f = J6(d | 0, f | 0, 2, 0) | 0;
+                e = 1392;
+                c[e >> 2] = f;
+                c[(e + 4) >> 2] = z;
+              } else {
+                if (!f) a = cD(a, d) | 0;
+                else a = fD(a, d) | 0;
+                c[e >> 2] = a;
+                c[(e + 4) >> 2] = 0;
+              }
+              return 1;
+            }
+            function CB(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              return 0;
+            }
+            function DB(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              if ((((c & 1) | 0) == 0) & (0 == 0)) hD(a, c) | 0;
+              return;
+            }
+            function EB(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              return ((((c & 1) | 0) == 0) & (0 == 0) ? c : 0) | 0;
+            }
+            function FB(a) {
+              a = a | 0;
+              return;
+            }
+            function GB(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              return;
+            }
+            function HB(b, d, e, f, g) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0;
+              i = (e | 0) != 0;
+              do
+                if (i) {
+                  if (
+                    (a[e >> 0] | 0) != 37
+                      ? ((h = c[(b + 64) >> 2] | 0),
+                        (h = pb[c[((c[(h + 4) >> 2] | 0) + 4) >> 2] & 127](c[(h + 16) >> 2] | 0, d, e, f, g) | 0),
+                        h | 0)
+                      : 0
+                  )
+                    break;
+                  h = MB(b, d, e, f) | 0;
+                  if (!h) j = 5;
+                } else j = 5;
+              while (0);
+              if ((j | 0) == 5)
+                if (g) {
+                  h = c[(b + 64) >> 2] | 0;
+                  h = pb[c[((c[(h + 4) >> 2] | 0) + 4) >> 2] & 127](c[(h + 16) >> 2] | 0, d, 0, f, g) | 0;
+                  if (i & ((h | 0) != 0)) {
+                    j = f;
+                    NB(b, d, e, c[j >> 2] | 0, c[(j + 4) >> 2] | 0);
+                  }
+                } else h = 0;
+              return h | 0;
+            }
+            function IB(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              a = c[(a + 64) >> 2] | 0;
+              return ob[c[((c[(a + 4) >> 2] | 0) + 8) >> 2] & 127](c[(a + 16) >> 2] | 0, b, d, e) | 0;
+            }
+            function JB(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              SB(a, b, d, e) | 0;
+              a = c[(a + 64) >> 2] | 0;
+              xb[c[((c[(a + 4) >> 2] | 0) + 12) >> 2] & 31](c[(a + 16) >> 2] | 0, b, d, e);
+              return;
+            }
+            function KB(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 16) | 0;
+              g = h;
+              d = xC(a) | 0;
+              f = (a + 8) | 0;
+              b = f;
+              b = QB(d, c[a >> 2] & 3, c[b >> 2] | 0, c[(b + 4) >> 2] | 0) | 0;
+              do
+                if (!b) {
+                  b = c[(d + 64) >> 2] | 0;
+                  d = c[((c[(b + 4) >> 2] | 0) + 16) >> 2] | 0;
+                  if (
+                    d | 0
+                      ? ((e = f),
+                        (e = ob[d & 127](c[(b + 16) >> 2] | 0, c[a >> 2] & 3, c[e >> 2] | 0, c[(e + 4) >> 2] | 0) | 0),
+                        e | 0)
+                      : 0
+                  ) {
+                    b = e;
+                    break;
+                  }
+                  if (((c[a >> 2] & 3) | 0) == 2) b = 0;
+                  else {
+                    e = c[f >> 2] | 0;
+                    f = c[(f + 4) >> 2] | 0;
+                    c[g >> 2] = 37;
+                    b = (g + 8) | 0;
+                    c[b >> 2] = e;
+                    c[(b + 4) >> 2] = f;
+                    m4(194773, 96456, g) | 0;
+                    b = 194773;
+                  }
+                }
+              while (0);
+              l = h;
+              return b | 0;
+            }
+            function LB(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              a = c[(a + 64) >> 2] | 0;
+              vb[c[((c[(a + 4) >> 2] | 0) + 24) >> 2] & 127](c[(a + 16) >> 2] | 0, b, d);
+              return;
+            }
+            function MB(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 32) | 0;
+              h = i;
+              b = c[((c[(a + 64) >> 2] | 0) + 56 + (((b | 0) == 3 ? 2 : b) << 2)) >> 2] | 0;
+              if (
+                ((b | 0) != 0 ? ((f = cD(a, d) | 0), (f | 0) != 0) : 0)
+                  ? ((c[(h + 24) >> 2] = f), (g = nb[c[b >> 2] & 63](b, h, 4) | 0), (g | 0) != 0)
+                  : 0
+              ) {
+                d = (g + 16) | 0;
+                h = c[(d + 4) >> 2] | 0;
+                b = e;
+                c[b >> 2] = c[d >> 2];
+                c[(b + 4) >> 2] = h;
+                b = 1;
+              } else b = 0;
+              l = i;
+              return b | 0;
+            }
+            function NB(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0;
+              h = dC(a, 32) | 0;
+              g = (h + 16) | 0;
+              c[g >> 2] = e;
+              c[(g + 4) >> 2] = f;
+              c[(h + 24) >> 2] = fD(a, d) | 0;
+              e = (b | 0) == 3 ? 2 : b;
+              g = (a + 64) | 0;
+              d = c[g >> 2] | 0;
+              b = c[(d + 56 + (e << 2)) >> 2] | 0;
+              if (!b) {
+                f = UD(a, 18640, c[4589] | 0) | 0;
+                c[((c[g >> 2] | 0) + 56 + (e << 2)) >> 2] = f;
+                b = c[g >> 2] | 0;
+              } else {
+                f = b;
+                b = d;
+              }
+              b = c[(b + 68 + (e << 2)) >> 2] | 0;
+              if (!b) {
+                b = UD(a, 18676, c[4589] | 0) | 0;
+                c[((c[g >> 2] | 0) + 68 + (e << 2)) >> 2] = b;
+              }
+              nb[c[f >> 2] & 63](f, h, 1) | 0;
+              nb[c[b >> 2] & 63](b, h, 1) | 0;
+              return;
+            }
+            function OB(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              a = (b + 16) | 0;
+              b = c[a >> 2] | 0;
+              a = c[(a + 4) >> 2] | 0;
+              d = (d + 16) | 0;
+              e = c[d >> 2] | 0;
+              d = c[(d + 4) >> 2] | 0;
+              return (
+                ((a >>> 0 > d >>> 0) | (((a | 0) == (d | 0)) & (b >>> 0 > e >>> 0))
+                  ? 1
+                  : (((a >>> 0 < d >>> 0) | (((a | 0) == (d | 0)) & (b >>> 0 < e >>> 0))) << 31) >> 31) | 0
+              );
+            }
+            function PB(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              b = c[(b + 24) >> 2] | 0;
+              e = c[(d + 24) >> 2] | 0;
+              return (b >>> 0 > e >>> 0 ? 1 : ((b >>> 0 < e >>> 0) << 31) >> 31) | 0;
+            }
+            function QB(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              a = RB(a, b, d, e) | 0;
+              if (!a) a = 0;
+              else a = c[(a + 24) >> 2] | 0;
+              return a | 0;
+            }
+            function RB(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              g = l;
+              l = (l + 32) | 0;
+              f = g;
+              a = c[((c[(a + 64) >> 2] | 0) + 68 + (((b | 0) == 3 ? 2 : b) << 2)) >> 2] | 0;
+              if (!a) a = 0;
+              else {
+                b = (f + 16) | 0;
+                c[b >> 2] = d;
+                c[(b + 4) >> 2] = e;
+                a = nb[c[a >> 2] & 63](a, f, 4) | 0;
+              }
+              l = g;
+              return a | 0;
+            }
+            function SB(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0;
+              f = (b | 0) == 3 ? 2 : b;
+              b = RB(a, f, d, e) | 0;
+              if (!b) b = 0;
+              else {
+                e = (a + 64) | 0;
+                d = c[((c[e >> 2] | 0) + 56 + (f << 2)) >> 2] | 0;
+                nb[c[d >> 2] & 63](d, b, 2) | 0;
+                e = c[((c[e >> 2] | 0) + 68 + (f << 2)) >> 2] | 0;
+                nb[c[e >> 2] & 63](e, b, 2) | 0;
+                hD(a, c[(b + 24) >> 2] | 0) | 0;
+                eC(a, b);
+                b = 1;
+              }
+              return b | 0;
+            }
+            function TB(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              c[46942] = b;
+              g = c[(b + 64) >> 2] | 0;
+              f = 0;
+              while (1) {
+                if ((f | 0) == 3) break;
+                h = (g + 56 + (f << 2)) | 0;
+                d = c[h >> 2] | 0;
+                a: do
+                  if (d | 0) {
+                    d = nb[c[d >> 2] & 63](d, 0, 128) | 0;
+                    while (1) {
+                      if (!d) break a;
+                      e = c[h >> 2] | 0;
+                      e = nb[c[e >> 2] & 63](e, d, 8) | 0;
+                      if ((a[c[(d + 24) >> 2] >> 0] | 0) != 37) {
+                        d = e;
+                        continue;
+                      }
+                      i = (d + 16) | 0;
+                      SB(b, f, c[i >> 2] | 0, c[(i + 4) >> 2] | 0) | 0;
+                      d = e;
+                    }
+                  }
+                while (0);
+                f = (f + 1) | 0;
+              }
+              return;
+            }
+            function UB(a) {
+              a = a | 0;
+              c[46942] = a;
+              a = (a + 64) | 0;
+              VB(((c[a >> 2] | 0) + 56) | 0);
+              VB(((c[a >> 2] | 0) + 68) | 0);
+              return;
+            }
+            function VB(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              b = 0;
+              while (1) {
+                if ((b | 0) == 3) break;
+                d = (a + (b << 2)) | 0;
+                e = c[d >> 2] | 0;
+                if (e | 0) {
+                  Rz(e) | 0;
+                  c[d >> 2] = 0;
+                }
+                b = (b + 1) | 0;
+              }
+              return;
+            }
+            function WB(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              if (!(c4(b, c, a) | 0)) a = 0;
+              else a = l2(b) | 0;
+              return a | 0;
+            }
+            function XB(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return T4(b, a) | 0;
+            }
+            function YB(a) {
+              a = a | 0;
+              return M4(a) | 0;
+            }
+            function ZB(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              b = l;
+              l = (l + 32) | 0;
+              e = (b + 12) | 0;
+              d = b;
+              c[4682] = c[4679];
+              c[4683] = c[4680];
+              c[e >> 2] = a;
+              c[(e + 4) >> 2] = l2(a) | 0;
+              c[(e + 8) >> 2] = 0;
+              c[d >> 2] = 18736;
+              c[(d + 4) >> 2] = 18612;
+              c[(d + 8) >> 2] = 18724;
+              a = jF(e, d) | 0;
+              kD(0);
+              l = b;
+              return a | 0;
+            }
+            function _B(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              if ((e | 0) != 0 ? ((h = (b + 8) | 0), (f = c[h >> 2] | 0), (f | 0) < (c[(b + 4) >> 2] | 0)) : 0) {
+                i = ((c[b >> 2] | 0) + f) | 0;
+                b = 0;
+                g = a[i >> 0] | 0;
+                f = d;
+                d = i;
+                while (1) {
+                  d = (d + 1) | 0;
+                  a[f >> 0] = g;
+                  b = (b + 1) | 0;
+                  if (!(((g << 24) >> 24 != 10) & ((b | 0) < (e | 0)))) break;
+                  g = a[d >> 0] | 0;
+                  if (!((g << 24) >> 24)) break;
+                  else f = (f + 1) | 0;
+                }
+                c[h >> 2] = (c[h >> 2] | 0) + b;
+              } else b = 0;
+              return b | 0;
+            }
+            function $B(a) {
+              a = a | 0;
+              return 0;
+            }
+            function aC(a, b) {
+              a = a | 0;
+              b = b | 0;
+              a = T1(b) | 0;
+              Y6(a | 0, 0, b | 0) | 0;
+              return a | 0;
+            }
+            function bC(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              a = W1(b, d) | 0;
+              if (d >>> 0 > c >>> 0) Y6((a + c) | 0, 0, (d - c) | 0) | 0;
+              return a | 0;
+            }
+            function cC(a, b) {
+              a = a | 0;
+              b = b | 0;
+              U1(b);
+              return;
+            }
+            function dC(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = l;
+              l = (l + 16) | 0;
+              a = c[(a + 64) >> 2] | 0;
+              a = lb[c[((c[a >> 2] | 0) + 4) >> 2] & 127](c[(a + 12) >> 2] | 0, b) | 0;
+              if (!a) gA(1, 96462, d) | 0;
+              l = d;
+              return a | 0;
+            }
+            function eC(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if (b | 0) {
+                a = c[(a + 64) >> 2] | 0;
+                ub[c[((c[a >> 2] | 0) + 12) >> 2] & 63](c[(a + 12) >> 2] | 0, b);
+              }
+              return;
+            }
+            function fC(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              a = ((c[(b + 16) >> 2] | 0) + 8) | 0;
+              b = c[a >> 2] | 0;
+              a = c[(a + 4) >> 2] | 0;
+              d = ((c[(d + 16) >> 2] | 0) + 8) | 0;
+              e = c[d >> 2] | 0;
+              d = c[(d + 4) >> 2] | 0;
+              return (
+                ((a >>> 0 < d >>> 0) | (((a | 0) == (d | 0)) & (b >>> 0 < e >>> 0))
+                  ? -1
+                  : ((a >>> 0 > d >>> 0) | (((a | 0) == (d | 0)) & (b >>> 0 > e >>> 0))) & 1) | 0
+              );
+            }
+            function gC(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              a = c[(b + 16) >> 2] | 0;
+              if (((a + 28) | 0) != (b | 0)) eC(c[(a + 24) >> 2] | 0, b);
+              return;
+            }
+            function hC(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              b = (c[c[(b + 16) >> 2] >> 2] | 0) >>> 4;
+              e = (c[c[(d + 16) >> 2] >> 2] | 0) >>> 4;
+              return (b >>> 0 < e >>> 0 ? -1 : (b >>> 0 > e >>> 0) & 1) | 0;
+            }
+            function iC(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              e = 186256;
+              c[e >> 2] = b;
+              c[(e + 4) >> 2] = d;
+              c[46947] = 186248;
+              a = c[(a + 40) >> 2] | 0;
+              a = nb[c[a >> 2] & 63](a, 187772, 4) | 0;
+              if (!a) a = 0;
+              else a = c[(a + 16) >> 2] | 0;
+              return a | 0;
+            }
+            function jC(a) {
+              a = a | 0;
+              a = c[(a + 36) >> 2] | 0;
+              a = nb[c[a >> 2] & 63](a, 0, 128) | 0;
+              if (!a) a = 0;
+              else a = c[(a + 16) >> 2] | 0;
+              return a | 0;
+            }
+            function kC(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              b = YA(a, b) | 0;
+              if ((b | 0) != 0 ? ((d = c[(a + 36) >> 2] | 0), (d = nb[c[d >> 2] & 63](d, b, 8) | 0), (d | 0) != 0) : 0)
+                b = c[(d + 16) >> 2] | 0;
+              else b = 0;
+              return b | 0;
+            }
+            function lC(a) {
+              a = a | 0;
+              a = c[(a + 36) >> 2] | 0;
+              a = nb[c[a >> 2] & 63](a, 0, 256) | 0;
+              if (!a) a = 0;
+              else a = c[(a + 16) >> 2] | 0;
+              return a | 0;
+            }
+            function mC(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              b = YA(a, b) | 0;
+              if ((b | 0) != 0 ? ((d = c[(a + 36) >> 2] | 0), (d = nb[c[d >> 2] & 63](d, b, 16) | 0), (d | 0) != 0) : 0)
+                b = c[(d + 16) >> 2] | 0;
+              else b = 0;
+              return b | 0;
+            }
+            function nC(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = iC(a, b, c) | 0;
+              do
+                if (((d | 0) != 0) & ((e | 0) == 0)) {
+                  e = yC(a) | 0;
+                  if ((e | 0) != (a | 0) ? ((f = iC(e, b, c) | 0), f | 0) : 0) {
+                    oC(a, f, 1) | 0;
+                    e = f;
+                    break;
+                  }
+                  if (!(IB(a, 1, b, c) | 0)) e = 0;
+                  else {
+                    e = rB(a, 1) | 0;
+                    e = pC(a, b, c, e, z) | 0;
+                    qC(a, e);
+                    rC(a, e);
+                  }
+                }
+              while (0);
+              return e | 0;
+            }
+            function oC(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              e = yC(a) | 0;
+              if ((e | 0) == (c[(b + 24) >> 2] | 0)) {
+                e = (b + 8) | 0;
+                e = iC(a, c[e >> 2] | 0, c[(e + 4) >> 2] | 0) | 0;
+                if (((d | 0) != 0) & ((e | 0) == 0)) {
+                  e = QD(a) | 0;
+                  if (!e) e = 0;
+                  else {
+                    d = oC(e, b, d) | 0;
+                    sC(a, d);
+                    return d | 0;
+                  }
+                }
+              } else e = 0;
+              return e | 0;
+            }
+            function pC(b, d, e, f, g) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0;
+              g = dC(b, 64) | 0;
+              h = c[g >> 2] | 0;
+              i = (g + 8) | 0;
+              c[i >> 2] = d;
+              c[(i + 4) >> 2] = e;
+              c[g >> 2] = (h & 12) | (f << 4) | 1;
+              c[(g + 24) >> 2] = yC(b) | 0;
+              if (a[((yC(b) | 0) + 24) >> 0] & 64) TC(g, 96404, 16, 0) | 0;
+              return g | 0;
+            }
+            function qC(a, b) {
+              a = a | 0;
+              b = b | 0;
+              do {
+                sC(a, b);
+                a = QD(a) | 0;
+              } while ((a | 0) != 0);
+              return;
+            }
+            function rC(b, c) {
+              b = b | 0;
+              c = c | 0;
+              if (a[((yC(b) | 0) + 24) >> 0] & 64) uA(b, c);
+              zC(b, c);
+              return;
+            }
+            function sC(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              e = (a + 40) | 0;
+              Xz(c[e >> 2] | 0) | 0;
+              if ((yC(a) | 0) == (a | 0)) d = (b + 28) | 0;
+              else d = dC(a, 36) | 0;
+              c[(d + 16) >> 2] = b;
+              e = c[e >> 2] | 0;
+              nb[c[e >> 2] & 63](e, d, 1) | 0;
+              e = c[(a + 36) >> 2] | 0;
+              nb[c[e >> 2] & 63](e, d, 1) | 0;
+              return;
+            }
+            function tC(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 16) | 0;
+              g = j;
+              h = yC(a) | 0;
+              if (HB(a, 1, b, g, 0) | 0) {
+                e = g;
+                e = iC(a, c[e >> 2] | 0, c[(e + 4) >> 2] | 0) | 0;
+                if (!e)
+                  if (
+                    !(((d | 0) == 0) | ((h | 0) == (a | 0)))
+                      ? ((f = g), (f = iC(h, c[f >> 2] | 0, c[(f + 4) >> 2] | 0) | 0), (f | 0) != 0)
+                      : 0
+                  )
+                    e = oC(a, f, 1) | 0;
+                  else i = 6;
+              } else i = 6;
+              if ((i | 0) == 6)
+                if ((d | 0) != 0 ? (HB(a, 1, b, g, 1) | 0) != 0 : 0) {
+                  i = g;
+                  h = c[i >> 2] | 0;
+                  i = c[(i + 4) >> 2] | 0;
+                  e = rB(a, 1) | 0;
+                  e = pC(a, h, i, e, z) | 0;
+                  qC(a, e);
+                  rC(a, e);
+                  LB(a, 1, e);
+                } else e = 0;
+              l = j;
+              return e | 0;
+            }
+            function uC(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              c[46956] = b;
+              d = aB(a, b) | 0;
+              while (1) {
+                if (!d) break;
+                e = bB(a, d, b) | 0;
+                jB(a, d, 0);
+                d = e;
+              }
+              e = c[(a + 40) >> 2] | 0;
+              nb[c[e >> 2] & 63](e, 187808, 2) | 0;
+              e = c[(a + 36) >> 2] | 0;
+              nb[c[e >> 2] & 63](e, 187808, 2) | 0;
+              return;
+            }
+            function vC(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              f = (d + 8) | 0;
+              e = f;
+              if (iC(b, c[e >> 2] | 0, c[(e + 4) >> 2] | 0) | 0) {
+                if ((yC(b) | 0) == (b | 0)) {
+                  e = aB(b, d) | 0;
+                  while (1) {
+                    if (!e) break;
+                    g = bB(b, e, d) | 0;
+                    lB(b, e) | 0;
+                    e = g;
+                  }
+                  if (a[(b + 24) >> 0] & 64) OA(d);
+                  DC(b, d);
+                  $C(d);
+                  g = f;
+                  JB(b, 1, c[g >> 2] | 0, c[(g + 4) >> 2] | 0);
+                }
+                if (!(BE(b, d, 59, 0, 0) | 0))
+                  if ((yC(b) | 0) == (b | 0)) {
+                    eC(b, d);
+                    e = 0;
+                  } else e = 0;
+                else e = -1;
+              } else e = -1;
+              return e | 0;
+            }
+            function wC(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 16) | 0;
+              e = h;
+              d = c[b >> 2] | 0;
+              do
+                if (!(d & 3))
+                  if ((QD(b) | 0) == (a | 0)) {
+                    d = c[b >> 2] | 0;
+                    g = 5;
+                    break;
+                  } else {
+                    gA(1, 96488, e) | 0;
+                    f = -1;
+                    break;
+                  }
+                else g = 5;
+              while (0);
+              a: do
+                if ((g | 0) == 5)
+                  switch (d & 3) {
+                    case 1: {
+                      f = vC(a, b) | 0;
+                      break a;
+                    }
+                    case 2:
+                    case 3: {
+                      f = lB(a, b) | 0;
+                      break a;
+                    }
+                    case 0: {
+                      f = sB(b) | 0;
+                      break a;
+                    }
+                    default: {
+                    }
+                  }
+              while (0);
+              l = h;
+              return f | 0;
+            }
+            function xC(a) {
+              a = a | 0;
+              var b = 0;
+              switch (c[a >> 2] & 3) {
+                case 2:
+                case 3: {
+                  b = c[((c[(a + 40) >> 2] | 0) + 24) >> 2] | 0;
+                  break;
+                }
+                case 1: {
+                  b = c[(a + 24) >> 2] | 0;
+                  break;
+                }
+                case 0: {
+                  b = a;
+                  break;
+                }
+                default: {
+                }
+              }
+              return b | 0;
+            }
+            function yC(a) {
+              a = a | 0;
+              var b = 0;
+              switch (c[a >> 2] & 3) {
+                case 2:
+                case 3: {
+                  b = ((c[(a + 40) >> 2] | 0) + 24) | 0;
+                  break;
+                }
+                case 1: {
+                  b = (a + 24) | 0;
+                  break;
+                }
+                case 0: {
+                  b = (a + 60) | 0;
+                  break;
+                }
+                default: {
+                }
+              }
+              return c[b >> 2] | 0;
+            }
+            function zC(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              e = c[(b + 64) >> 2] | 0;
+              if (!(a[(e + 52) >> 0] | 0)) JC(b, d, 100, 0);
+              else AC(b, d, c[(e + 48) >> 2] | 0);
+              return;
+            }
+            function AC(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              a: do
+                if (d | 0) {
+                  AC(a, b, c[(d + 8) >> 2] | 0);
+                  switch (c[b >> 2] & 3) {
+                    case 0: {
+                      e = c[d >> 2] | 0;
+                      break;
+                    }
+                    case 1: {
+                      e = ((c[d >> 2] | 0) + 12) | 0;
+                      break;
+                    }
+                    case 2: {
+                      e = ((c[d >> 2] | 0) + 24) | 0;
+                      break;
+                    }
+                    default:
+                      break a;
+                  }
+                  e = c[e >> 2] | 0;
+                  if (e | 0) vb[e & 127](a, b, c[(d + 4) >> 2] | 0);
+                }
+              while (0);
+              return;
+            }
+            function BC(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0;
+              f = c[(b + 64) >> 2] | 0;
+              if (!(a[(f + 52) >> 0] | 0)) JC(b, d, 101, e);
+              else CC(b, d, e, c[(f + 48) >> 2] | 0);
+              return;
+            }
+            function CC(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0;
+              a: do
+                if (e | 0) {
+                  CC(a, b, d, c[(e + 8) >> 2] | 0);
+                  switch (c[b >> 2] & 3) {
+                    case 0: {
+                      f = ((c[e >> 2] | 0) + 4) | 0;
+                      break;
+                    }
+                    case 1: {
+                      f = ((c[e >> 2] | 0) + 16) | 0;
+                      break;
+                    }
+                    case 2: {
+                      f = ((c[e >> 2] | 0) + 28) | 0;
+                      break;
+                    }
+                    default:
+                      break a;
+                  }
+                  f = c[f >> 2] | 0;
+                  if (f | 0) xb[f & 31](a, b, c[(e + 4) >> 2] | 0, d);
+                }
+              while (0);
+              return;
+            }
+            function DC(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              e = c[(b + 64) >> 2] | 0;
+              if (!(a[(e + 52) >> 0] | 0)) JC(b, d, 102, 0);
+              else EC(b, d, c[(e + 48) >> 2] | 0);
+              return;
+            }
+            function EC(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              a: do
+                if (d | 0) {
+                  EC(a, b, c[(d + 8) >> 2] | 0);
+                  switch (c[b >> 2] & 3) {
+                    case 0: {
+                      e = ((c[d >> 2] | 0) + 8) | 0;
+                      break;
+                    }
+                    case 1: {
+                      e = ((c[d >> 2] | 0) + 20) | 0;
+                      break;
+                    }
+                    case 2: {
+                      e = ((c[d >> 2] | 0) + 32) | 0;
+                      break;
+                    }
+                    default:
+                      break a;
+                  }
+                  e = c[e >> 2] | 0;
+                  if (e | 0) vb[e & 127](a, b, c[(d + 4) >> 2] | 0);
+                }
+              while (0);
+              return;
+            }
+            function FC(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              e = dC(a, 12) | 0;
+              c[e >> 2] = b;
+              c[(e + 4) >> 2] = d;
+              d = ((c[(a + 64) >> 2] | 0) + 48) | 0;
+              c[(e + 8) >> 2] = c[d >> 2];
+              c[d >> 2] = e;
+              return;
+            }
+            function GC(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              e = ((c[(a + 64) >> 2] | 0) + 48) | 0;
+              d = c[e >> 2] | 0;
+              a: do
+                if (!d) d = -1;
+                else {
+                  if ((c[d >> 2] | 0) != (b | 0)) {
+                    while (1) {
+                      if (!d) {
+                        d = -1;
+                        break a;
+                      }
+                      e = (d + 8) | 0;
+                      f = c[e >> 2] | 0;
+                      if ((c[f >> 2] | 0) == (b | 0)) break;
+                      else d = f;
+                    }
+                    if (f) c[e >> 2] = c[(f + 8) >> 2];
+                  } else c[e >> 2] = c[(d + 8) >> 2];
+                  eC(a, d);
+                  d = 0;
+                }
+              while (0);
+              return d | 0;
+            }
+            function HC(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = yC(a) | 0;
+              a: do
+                if ((d | 0) == (yC(b) | 0))
+                  switch (c[b >> 2] & 3) {
+                    case 0: {
+                      while (1) {
+                        if ((b | 0) == (a | 0)) {
+                          b = 1;
+                          break a;
+                        }
+                        b = QD(b) | 0;
+                        if (!b) {
+                          b = 0;
+                          break;
+                        }
+                      }
+                      break;
+                    }
+                    case 1: {
+                      b = (b + 8) | 0;
+                      b = (nC(a, c[b >> 2] | 0, c[(b + 4) >> 2] | 0, 0) | 0) != 0;
+                      break a;
+                    }
+                    default: {
+                      b = (mB(a, b, 0) | 0) != 0;
+                      break a;
+                    }
+                  }
+                else b = 0;
+              while (0);
+              return (b & 1) | 0;
+            }
+            function IC(a) {
+              a = a | 0;
+              return (c[a >> 2] & 3) | 0;
+            }
+            function JC(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 16) | 0;
+              g = h;
+              f = TC(a, 96512, 44, 0) | 0;
+              switch (c | 0) {
+                case 100: {
+                  e = KC(f, b, 100) | 0;
+                  if (!(LC(e, b) | 0)) MC(e, a, b, d) | 0;
+                  break;
+                }
+                case 101: {
+                  if (
+                    ((LC(KC(f, b, 100) | 0, b) | 0) == 0 ? (LC(KC(f, b, 102) | 0, b) | 0) == 0 : 0)
+                      ? ((e = KC(f, b, 101) | 0), (LC(e, b) | 0) == 0)
+                      : 0
+                  )
+                    MC(e, a, b, d) | 0;
+                  break;
+                }
+                case 102: {
+                  NC(KC(f, b, 100) | 0, b);
+                  NC(KC(f, b, 101) | 0, b);
+                  e = KC(f, b, 102) | 0;
+                  if (!(LC(e, b) | 0)) MC(e, a, b, d) | 0;
+                  break;
+                }
+                default:
+                  gA(1, 96524, g) | 0;
+              }
+              l = h;
+              return;
+            }
+            function KC(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              g = l;
+              l = (l + 16) | 0;
+              e = g;
+              a: do
+                switch (c[b >> 2] & 3) {
+                  case 0:
+                    switch (d | 0) {
+                      case 100: {
+                        d = (a + 8) | 0;
+                        break a;
+                      }
+                      case 101: {
+                        d = (a + 20) | 0;
+                        break a;
+                      }
+                      case 102: {
+                        d = (a + 32) | 0;
+                        break a;
+                      }
+                      default: {
+                        f = 14;
+                        break a;
+                      }
+                    }
+                  case 1:
+                    switch (d | 0) {
+                      case 100: {
+                        d = (a + 12) | 0;
+                        break a;
+                      }
+                      case 101: {
+                        d = (a + 24) | 0;
+                        break a;
+                      }
+                      case 102: {
+                        d = (a + 36) | 0;
+                        break a;
+                      }
+                      default: {
+                        f = 14;
+                        break a;
+                      }
+                    }
+                  case 2:
+                    switch (d | 0) {
+                      case 100: {
+                        d = (a + 16) | 0;
+                        break a;
+                      }
+                      case 101: {
+                        d = (a + 28) | 0;
+                        break a;
+                      }
+                      case 102: {
+                        d = (a + 40) | 0;
+                        break a;
+                      }
+                      default: {
+                        f = 14;
+                        break a;
+                      }
+                    }
+                  default:
+                    f = 14;
+                }
+              while (0);
+              if ((f | 0) == 14) {
+                gA(1, 96558, e) | 0;
+                d = 0;
+              }
+              a = c[d >> 2] | 0;
+              if (!a) {
+                a = xC(b) | 0;
+                a = UD(a, 18828, c[4589] | 0) | 0;
+                c[d >> 2] = a;
+              }
+              l = g;
+              return a | 0;
+            }
+            function LC(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              d = l;
+              l = (l + 32) | 0;
+              e = d;
+              f = OC(b) | 0;
+              b = (e + 8) | 0;
+              c[b >> 2] = f;
+              c[(b + 4) >> 2] = z;
+              b = nb[c[a >> 2] & 63](a, e, 4) | 0;
+              l = d;
+              return b | 0;
+            }
+            function MC(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              f = dC(xC(d) | 0, 32) | 0;
+              c[(f + 20) >> 2] = d;
+              g = OC(d) | 0;
+              d = (f + 8) | 0;
+              c[d >> 2] = g;
+              c[(d + 4) >> 2] = z;
+              c[(f + 16) >> 2] = b;
+              if (e | 0) {
+                g = dC(b, 8) | 0;
+                c[(f + 24) >> 2] = g;
+                c[g >> 2] = e;
+              }
+              nb[c[a >> 2] & 63](a, f, 1) | 0;
+              return f | 0;
+            }
+            function NC(a, b) {
+              a = a | 0;
+              b = b | 0;
+              b = LC(a, b) | 0;
+              if (b | 0) nb[c[a >> 2] & 63](a, b, 2) | 0;
+              return;
+            }
+            function OC(a) {
+              a = a | 0;
+              a = (a + 8) | 0;
+              z = c[(a + 4) >> 2] | 0;
+              return c[a >> 2] | 0;
+            }
+            function PC(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              QC(b);
+              eC(c[(b + 16) >> 2] | 0, b);
+              return;
+            }
+            function QC(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = (a + 16) | 0;
+              a = c[(a + 24) >> 2] | 0;
+              while (1) {
+                if (!a) break;
+                d = c[(a + 4) >> 2] | 0;
+                eC(c[b >> 2] | 0, a);
+                a = d;
+              }
+              return;
+            }
+            function RC(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 16) | 0;
+              i = k;
+              h = c[(b + 16) >> 2] | 0;
+              f = h;
+              while (1) {
+                if (!f) {
+                  f = 0;
+                  break;
+                }
+                g = c[f >> 2] | 0;
+                if ((g | 0) == (d | 0)) {
+                  j = 7;
+                  break;
+                }
+                if ((a[d >> 0] | 0) == (a[g >> 0] | 0) ? (s2(d, g) | 0) == 0 : 0) {
+                  j = 7;
+                  break;
+                }
+                f = c[(f + 4) >> 2] | 0;
+                if ((f | 0) == (h | 0)) {
+                  f = 0;
+                  break;
+                }
+              }
+              do
+                if ((j | 0) == 7) {
+                  if (!(c[b >> 2] & 4)) {
+                    if (((f | 0) == (h | 0)) & ((e | 0) == 0)) {
+                      f = h;
+                      break;
+                    }
+                    SC(b, f, e);
+                    break;
+                  }
+                  if (e)
+                    if ((h | 0) == (f | 0)) f = h;
+                    else gA(1, 96583, i) | 0;
+                }
+              while (0);
+              l = k;
+              return f | 0;
+            }
+            function SC(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              c[(a + 16) >> 2] = b;
+              e = c[a >> 2] | 0;
+              d = (d << 2) & 4;
+              c[a >> 2] = (e & -5) | d;
+              if ((e & 2) | 0) {
+                e = ((e & 3) | 0) == 3 ? -1 : 1;
+                c[(a + ((e * 48) | 0) + 16) >> 2] = b;
+                e = (a + ((e * 48) | 0)) | 0;
+                c[e >> 2] = (c[e >> 2] & -5) | d;
+              }
+              return;
+            }
+            function TC(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              h = xC(a) | 0;
+              f = RC(a, b, 0) | 0;
+              a: do
+                if (((d | 0) != 0) & ((f | 0) == 0)) {
+                  d = dC(h, d) | 0;
+                  c[d >> 2] = fD(h, b) | 0;
+                  switch (c[a >> 2] & 3) {
+                    case 0: {
+                      UC(a, d);
+                      g = d;
+                      break a;
+                    }
+                    case 1: {
+                      UC(a, d);
+                      g = d;
+                      break a;
+                    }
+                    case 2:
+                    case 3: {
+                      UC(a, d);
+                      g = d;
+                      break a;
+                    }
+                    default: {
+                    }
+                  }
+                } else g = f;
+              while (0);
+              if (e | 0) RC(a, b, 1) | 0;
+              return g | 0;
+            }
+            function UC(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              d = c[(a + 16) >> 2] | 0;
+              do
+                if (d) {
+                  e = (d + 4) | 0;
+                  f = c[e >> 2] | 0;
+                  if ((f | 0) == (d | 0)) {
+                    c[e >> 2] = b;
+                    e = d;
+                    d = b;
+                    break;
+                  } else {
+                    c[(b + 4) >> 2] = f;
+                    e = b;
+                    break;
+                  }
+                } else {
+                  e = b;
+                  d = b;
+                }
+              while (0);
+              c[(d + 4) >> 2] = e;
+              if (!(c[a >> 2] & 4)) SC(a, b, 0);
+              return;
+            }
+            function VC(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              e = xC(a) | 0;
+              d = RC(a, b, 0) | 0;
+              if (!d) b = -1;
+              else {
+                WC(a, d);
+                if (!(c[a >> 2] & 3)) {
+                  XC(e, a, d);
+                  b = d;
+                } else {
+                  BE(yC(e) | 0, a, 60, d, 0) | 0;
+                  b = d;
+                }
+                hD(e, c[d >> 2] | 0) | 0;
+                eC(e, b);
+                b = 0;
+              }
+              return b | 0;
+            }
+            function WC(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              a = c[(a + 16) >> 2] | 0;
+              do {
+                d = (a + 4) | 0;
+                a = c[d >> 2] | 0;
+              } while ((a | 0) != (b | 0));
+              c[d >> 2] = c[(b + 4) >> 2];
+              return;
+            }
+            function XC(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              if ((c[(b + 16) >> 2] | 0) == (d | 0)) {
+                a = c[(d + 4) >> 2] | 0;
+                SC(b, (a | 0) == (d | 0) ? 0 : a, 0);
+              }
+              return;
+            }
+            function YC(a, b, c, d, e) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              f = (d | 0) > -1;
+              g = f ? d : (0 - d) | 0;
+              a: do
+                switch (b | 0) {
+                  case 0: {
+                    TC(a, c, g, e) | 0;
+                    if (!f) {
+                      b = OD(a) | 0;
+                      while (1) {
+                        if (!b) break a;
+                        YC(b, 0, c, d, e);
+                        b = PD(b) | 0;
+                      }
+                    }
+                    break;
+                  }
+                  case 3:
+                  case 2:
+                  case 1: {
+                    d = (b | 0) == 1;
+                    b = jC(a) | 0;
+                    while (1) {
+                      if (!b) break a;
+                      b: do
+                        if (d) TC(b, c, g, e) | 0;
+                        else {
+                          f = XA(a, b) | 0;
+                          while (1) {
+                            if (!f) break b;
+                            TC(f, c, g, e) | 0;
+                            f = ZA(a, f) | 0;
+                          }
+                        }
+                      while (0);
+                      b = kC(a, b) | 0;
+                    }
+                  }
+                  default: {
+                  }
+                }
+              while (0);
+              return;
+            }
+            function ZC(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0,
+                e = 0;
+              a: do
+                switch (b | 0) {
+                  case 0: {
+                    BE(a, a, 61, c, 1) | 0;
+                    break;
+                  }
+                  case 3:
+                  case 2:
+                  case 1: {
+                    e = (b | 0) == 1;
+                    d = jC(a) | 0;
+                    while (1) {
+                      if (!d) break a;
+                      b: do
+                        if (e) VC(d, c) | 0;
+                        else {
+                          b = XA(a, d) | 0;
+                          while (1) {
+                            if (!b) break b;
+                            VC(b, c) | 0;
+                            b = ZA(a, b) | 0;
+                          }
+                        }
+                      while (0);
+                      d = kC(a, d) | 0;
+                    }
+                  }
+                  default: {
+                  }
+                }
+              while (0);
+              return;
+            }
+            function _C(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              VC(b, c) | 0;
+              return;
+            }
+            function $C(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              d = xC(a) | 0;
+              b = (a + 16) | 0;
+              a = c[b >> 2] | 0;
+              if (a | 0)
+                do {
+                  e = a;
+                  a = c[(a + 4) >> 2] | 0;
+                  hD(d, c[e >> 2] | 0) | 0;
+                  eC(d, e);
+                } while ((a | 0) != (c[b >> 2] | 0));
+              c[b >> 2] = 0;
+              return;
+            }
+            function aD(a) {
+              a = a | 0;
+              return WD(a, bD(a) | 0) | 0;
+            }
+            function bD(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              if (!a) d = 187844;
+              else d = ((c[(a + 64) >> 2] | 0) + 20) | 0;
+              b = c[d >> 2] | 0;
+              if (!b) {
+                b = UD(a, 18864, c[4589] | 0) | 0;
+                c[d >> 2] = b;
+                a = 186312;
+                c[a >> 2] = -2147483648;
+                c[(a + 4) >> 2] = 0;
+                a = 186320;
+                c[a >> 2] = 2147483647;
+                c[(a + 4) >> 2] = -1;
+              }
+              return b | 0;
+            }
+            function cD(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return dD(bD(a) | 0, b) | 0;
+            }
+            function dD(a, b) {
+              a = a | 0;
+              b = b | 0;
+              a = eD(a, b) | 0;
+              if (!a) a = 0;
+              else a = c[(a + 16) >> 2] | 0;
+              return a | 0;
+            }
+            function eD(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = l;
+              l = (l + 32) | 0;
+              e = d;
+              c[(e + 16) >> 2] = b;
+              b = nb[c[a >> 2] & 63](a, e, 4) | 0;
+              l = d;
+              return b | 0;
+            }
+            function fD(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              if (!b) d = 0;
+              else {
+                e = bD(a) | 0;
+                d = eD(e, b) | 0;
+                if (!d) {
+                  d = ((l2(b) | 0) + 24) | 0;
+                  if (!a) d = T1(d) | 0;
+                  else d = dC(a, d) | 0;
+                  a = (d + 8) | 0;
+                  c[a >> 2] = 1;
+                  c[(a + 4) >> 2] = 0;
+                  a = (d + 20) | 0;
+                  r3(a, b) | 0;
+                  c[(d + 16) >> 2] = a;
+                  nb[c[e >> 2] & 63](e, d, 1) | 0;
+                } else {
+                  e = (d + 8) | 0;
+                  b = e;
+                  b = J6(c[b >> 2] | 0, c[(b + 4) >> 2] | 0, 1, 0) | 0;
+                  c[e >> 2] = b;
+                  c[(e + 4) >> 2] = z;
+                }
+                d = c[(d + 16) >> 2] | 0;
+              }
+              return d | 0;
+            }
+            function gD(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              if (!b) d = 0;
+              else {
+                e = bD(a) | 0;
+                d = eD(e, b) | 0;
+                if (!d) {
+                  d = ((l2(b) | 0) + 24) | 0;
+                  if (!a) d = T1(d) | 0;
+                  else d = dC(a, d) | 0;
+                  g = 186312;
+                  f = c[(g + 4) >> 2] | 0;
+                  a = (d + 8) | 0;
+                  c[a >> 2] = c[g >> 2] | 1;
+                  c[(a + 4) >> 2] = f;
+                  a = (d + 20) | 0;
+                  r3(a, b) | 0;
+                  c[(d + 16) >> 2] = a;
+                  nb[c[e >> 2] & 63](e, d, 1) | 0;
+                } else {
+                  g = (d + 8) | 0;
+                  f = g;
+                  f = J6(c[f >> 2] | 0, c[(f + 4) >> 2] | 0, 1, 0) | 0;
+                  c[g >> 2] = f;
+                  c[(g + 4) >> 2] = z;
+                }
+                d = c[(d + 16) >> 2] | 0;
+              }
+              return d | 0;
+            }
+            function hD(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              if ((b | 0) != 0 ? ((d = bD(a) | 0), (e = eD(d, b) | 0), (e | 0) != 0) : 0)
+                if (
+                  (c[(e + 16) >> 2] | 0) == (b | 0)
+                    ? ((b = (e + 8) | 0),
+                      (g = b),
+                      (g = J6(c[g >> 2] | 0, c[(g + 4) >> 2] | 0, -1, -1) | 0),
+                      (f = z),
+                      b,
+                      (c[b >> 2] = g),
+                      (c[(b + 4) >> 2] = f),
+                      (b = 186320),
+                      (((g | 0) == 0) & ((f | 0) == 0)) | (((c[b >> 2] | 0) == 0) & ((c[(b + 4) >> 2] | 0) == 0)))
+                    : 0
+                ) {
+                  VD(a, d, e) | 0;
+                  a = 0;
+                } else a = 0;
+              else a = -1;
+              return a | 0;
+            }
+            function iD(a) {
+              a = a | 0;
+              var b = 0;
+              if (!a) a = 0;
+              else {
+                a = (a + -12) | 0;
+                b = 186312;
+                a = c[b >> 2] & c[a >> 2];
+              }
+              return a | 0;
+            }
+            function jD(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              if (a | 0) {
+                d = 186312;
+                a = (a + -12) | 0;
+                e = a;
+                b = c[(e + 4) >> 2] | c[(d + 4) >> 2];
+                c[a >> 2] = c[e >> 2] | c[d >> 2];
+                c[(a + 4) >> 2] = b;
+              }
+              return;
+            }
+            function kD(a) {
+              a = a | 0;
+              c[46966] = a;
+              c[4725] = 1;
+              return;
+            }
+            function lD(a, b) {
+              a = a | 0;
+              b = b | 0;
+              c[46967] = a;
+              c[46968] = b;
+              c[46969] = 0;
+              return;
+            }
+            function mD() {
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0;
+              if (!(c[46970] | 0)) {
+                c[46970] = 1;
+                if (!(c[46971] | 0)) c[46971] = 1;
+                if (!(c[46962] | 0)) c[46962] = c[15647];
+                if (!(c[46963] | 0)) c[46963] = c[15679];
+                k = c[46972] | 0;
+                if (!((k | 0) != 0 ? (c[k >> 2] | 0) != 0 : 0)) {
+                  nD();
+                  k = oD(c[46962] | 0, 16384) | 0;
+                  c[c[46972] >> 2] = k;
+                }
+                pD();
+              }
+              a: while (1) {
+                j = c[46973] | 0;
+                a[j >> 0] = a[194805] | 0;
+                e = ((c[((c[c[46972] >> 2] | 0) + 28) >> 2] | 0) + (c[46971] | 0)) | 0;
+                f = j;
+                b: while (1) {
+                  h = f;
+                  while (1) {
+                    f = c[(18904 + (d[h >> 0] << 2)) >> 2] | 0;
+                    if (b[(63856 + (e << 1)) >> 1] | 0) {
+                      c[46974] = e;
+                      c[46975] = h;
+                    }
+                    c: while (1) {
+                      g = f & 255;
+                      do {
+                        f = (g + (b[(64042 + (e << 1)) >> 1] | 0)) | 0;
+                        if ((e | 0) == (b[(64252 + (f << 1)) >> 1] | 0)) break c;
+                        k = b[(64788 + (e << 1)) >> 1] | 0;
+                        e = (k << 16) >> 16;
+                      } while ((k << 16) >> 16 <= 92);
+                      f = c[(19928 + (g << 2)) >> 2] | 0;
+                    }
+                    e = b[(64998 + (f << 1)) >> 1] | 0;
+                    f = (h + 1) | 0;
+                    if ((b[(64042 + (e << 1)) >> 1] | 0) == 219) break;
+                    else h = f;
+                  }
+                  d: while (1) {
+                    k = j;
+                    e: while (1) {
+                      e = b[(63856 + (e << 1)) >> 1] | 0;
+                      if (!((e << 16) >> 16)) {
+                        e = b[(63856 + (c[46974] << 1)) >> 1] | 0;
+                        f = c[46975] | 0;
+                      } else e = (e << 16) >> 16;
+                      c[46964] = j;
+                      i = f;
+                      c[46965] = i - k;
+                      a[194805] = a[f >> 0] | 0;
+                      a[f >> 0] = 0;
+                      c[46973] = f;
+                      f: while (1) {
+                        switch (e | 0) {
+                          case 1: {
+                            m = 27;
+                            break a;
+                          }
+                          case 12: {
+                            m = 53;
+                            break a;
+                          }
+                          case 13: {
+                            m = 55;
+                            break a;
+                          }
+                          case 14: {
+                            m = 57;
+                            break a;
+                          }
+                          case 15: {
+                            m = 61;
+                            break a;
+                          }
+                          case 16: {
+                            m = 65;
+                            break a;
+                          }
+                          case 17: {
+                            m = 67;
+                            break a;
+                          }
+                          case 18: {
+                            m = 69;
+                            break a;
+                          }
+                          case 19: {
+                            m = 72;
+                            break a;
+                          }
+                          case 20: {
+                            m = 75;
+                            break a;
+                          }
+                          case 21: {
+                            m = 78;
+                            break a;
+                          }
+                          case 23: {
+                            m = 86;
+                            break a;
+                          }
+                          case 33: {
+                            m = 118;
+                            break a;
+                          }
+                          case 39:
+                          case 38:
+                          case 37:
+                          case 36: {
+                            l = 0;
+                            break a;
+                          }
+                          case 2: {
+                            m = 29;
+                            break b;
+                          }
+                          case 3: {
+                            m = 32;
+                            break b;
+                          }
+                          case 4: {
+                            m = 35;
+                            break b;
+                          }
+                          case 5: {
+                            m = 37;
+                            break b;
+                          }
+                          case 6: {
+                            m = 39;
+                            break b;
+                          }
+                          case 7: {
+                            m = 42;
+                            break b;
+                          }
+                          case 8: {
+                            m = 44;
+                            break b;
+                          }
+                          case 9: {
+                            m = 47;
+                            break b;
+                          }
+                          case 10: {
+                            m = 49;
+                            break b;
+                          }
+                          case 11: {
+                            m = 51;
+                            break b;
+                          }
+                          case 22: {
+                            m = 83;
+                            break b;
+                          }
+                          case 24: {
+                            m = 89;
+                            break b;
+                          }
+                          case 25: {
+                            m = 92;
+                            break b;
+                          }
+                          case 26: {
+                            m = 95;
+                            break b;
+                          }
+                          case 27: {
+                            m = 98;
+                            break b;
+                          }
+                          case 28: {
+                            m = 101;
+                            break b;
+                          }
+                          case 29: {
+                            m = 104;
+                            break b;
+                          }
+                          case 30: {
+                            m = 109;
+                            break b;
+                          }
+                          case 31: {
+                            m = 112;
+                            break b;
+                          }
+                          case 32: {
+                            m = 115;
+                            break b;
+                          }
+                          case 34: {
+                            m = 121;
+                            break b;
+                          }
+                          case 0:
+                            break f;
+                          case 35:
+                            break;
+                          default: {
+                            m = 134;
+                            break a;
+                          }
+                        }
+                        h = c[46964] | 0;
+                        a[f >> 0] = a[194805] | 0;
+                        e = c[46972] | 0;
+                        g = c[e >> 2] | 0;
+                        if (!(c[(g + 44) >> 2] | 0)) {
+                          n = c[(g + 16) >> 2] | 0;
+                          c[46977] = n;
+                          c[g >> 2] = c[46962];
+                          g = c[e >> 2] | 0;
+                          c[(g + 44) >> 2] = 1;
+                          e = n;
+                        } else e = c[46977] | 0;
+                        if ((c[46973] | 0) >>> 0 <= (((c[(g + 4) >> 2] | 0) + e) | 0) >>> 0) {
+                          m = 128;
+                          break e;
+                        }
+                        switch (yD() | 0) {
+                          case 0: {
+                            m = 132;
+                            break d;
+                          }
+                          case 2: {
+                            m = 133;
+                            break e;
+                          }
+                          case 1:
+                            break;
+                          default:
+                            continue a;
+                        }
+                        c[46973] = c[46964];
+                        e = ((((((c[46971] | 0) + -1) | 0) / 2) | 0) + 36) | 0;
+                      }
+                      a[f >> 0] = a[194805] | 0;
+                      f = c[46975] | 0;
+                      e = c[46974] | 0;
+                    }
+                    if ((m | 0) == 128) {
+                      m = 0;
+                      g = (i - h) | 0;
+                      h = c[46964] | 0;
+                      f = (h + (g + -1)) | 0;
+                      c[46973] = f;
+                      e = wD() | 0;
+                      i = xD(e) | 0;
+                      j = c[46964] | 0;
+                      if (!i) continue;
+                      else {
+                        m = 129;
+                        break;
+                      }
+                    } else if ((m | 0) == 133) {
+                      m = 0;
+                      f = ((c[((c[c[46972] >> 2] | 0) + 4) >> 2] | 0) + (c[46977] | 0)) | 0;
+                      c[46973] = f;
+                      e = wD() | 0;
+                      j = c[46964] | 0;
+                      continue;
+                    }
+                  }
+                  if ((m | 0) == 129) {
+                    m = 0;
+                    f = (h + g) | 0;
+                    c[46973] = f;
+                    e = i;
+                    continue;
+                  } else if ((m | 0) == 132) {
+                    m = 0;
+                    f = ((c[46964] | 0) + (i - h + -1)) | 0;
+                    c[46973] = f;
+                    e = wD() | 0;
+                    j = c[46964] | 0;
+                    continue;
+                  }
+                }
+                switch (m | 0) {
+                  case 29: {
+                    m = 0;
+                    e = c[46965] | 0;
+                    if (e | 0)
+                      c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[((c[46964] | 0) + (e + -1)) >> 0] | 0) == 10) & 1;
+                    c[4725] = (c[4725] | 0) + 1;
+                    continue a;
+                  }
+                  case 32: {
+                    m = 0;
+                    e = c[46965] | 0;
+                    if (e | 0)
+                      c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[((c[46964] | 0) + (e + -1)) >> 0] | 0) == 10) & 1;
+                    c[46971] = 3;
+                    continue a;
+                  }
+                  case 35: {
+                    m = 0;
+                    e = c[46965] | 0;
+                    if (!e) continue a;
+                    c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[((c[46964] | 0) + (e + -1)) >> 0] | 0) == 10) & 1;
+                    continue a;
+                  }
+                  case 37: {
+                    m = 0;
+                    e = c[46965] | 0;
+                    if (!e) continue a;
+                    c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[((c[46964] | 0) + (e + -1)) >> 0] | 0) == 10) & 1;
+                    continue a;
+                  }
+                  case 39: {
+                    m = 0;
+                    e = c[46965] | 0;
+                    if (e | 0)
+                      c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[((c[46964] | 0) + (e + -1)) >> 0] | 0) == 10) & 1;
+                    c[46971] = 1;
+                    continue a;
+                  }
+                  case 42: {
+                    m = 0;
+                    e = c[46965] | 0;
+                    if (!e) continue a;
+                    c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[((c[46964] | 0) + (e + -1)) >> 0] | 0) == 10) & 1;
+                    continue a;
+                  }
+                  case 44: {
+                    m = 0;
+                    e = c[46965] | 0;
+                    if (e | 0)
+                      c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[((c[46964] | 0) + (e + -1)) >> 0] | 0) == 10) & 1;
+                    qD();
+                    continue a;
+                  }
+                  case 47: {
+                    m = 0;
+                    e = c[46965] | 0;
+                    if (!e) continue a;
+                    c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[((c[46964] | 0) + (e + -1)) >> 0] | 0) == 10) & 1;
+                    continue a;
+                  }
+                  case 49: {
+                    m = 0;
+                    e = c[46965] | 0;
+                    if (!e) continue a;
+                    c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[((c[46964] | 0) + (e + -1)) >> 0] | 0) == 10) & 1;
+                    continue a;
+                  }
+                  case 51: {
+                    m = 0;
+                    e = c[46965] | 0;
+                    if (!e) continue a;
+                    c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[((c[46964] | 0) + (e + -1)) >> 0] | 0) == 10) & 1;
+                    continue a;
+                  }
+                  case 83: {
+                    m = 0;
+                    e = c[46965] | 0;
+                    if (e | 0)
+                      c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[((c[46964] | 0) + (e + -1)) >> 0] | 0) == 10) & 1;
+                    c[46971] = 5;
+                    sD();
+                    continue a;
+                  }
+                  case 89: {
+                    m = 0;
+                    e = c[46965] | 0;
+                    if (e | 0)
+                      c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[((c[46964] | 0) + (e + -1)) >> 0] | 0) == 10) & 1;
+                    uD(98744);
+                    continue a;
+                  }
+                  case 92: {
+                    m = 0;
+                    e = c[46965] | 0;
+                    if (e | 0)
+                      c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[((c[46964] | 0) + (e + -1)) >> 0] | 0) == 10) & 1;
+                    uD(96616);
+                    continue a;
+                  }
+                  case 95: {
+                    m = 0;
+                    e = c[46965] | 0;
+                    if (e | 0)
+                      c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[((c[46964] | 0) + (e + -1)) >> 0] | 0) == 10) & 1;
+                    c[4725] = (c[4725] | 0) + 1;
+                    continue a;
+                  }
+                  case 98: {
+                    m = 0;
+                    f = c[46965] | 0;
+                    e = c[46964] | 0;
+                    if (f | 0) c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[(e + (f + -1)) >> 0] | 0) == 10) & 1;
+                    uD(e);
+                    continue a;
+                  }
+                  case 101: {
+                    m = 0;
+                    e = c[46965] | 0;
+                    if (e | 0)
+                      c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[((c[46964] | 0) + (e + -1)) >> 0] | 0) == 10) & 1;
+                    c[46971] = 7;
+                    c[46976] = 1;
+                    sD();
+                    continue a;
+                  }
+                  case 104: {
+                    m = 0;
+                    e = c[46965] | 0;
+                    if (e | 0)
+                      c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[((c[46964] | 0) + (e + -1)) >> 0] | 0) == 10) & 1;
+                    n = ((c[46976] | 0) + -1) | 0;
+                    c[46976] = n;
+                    if (!n) {
+                      m = 108;
+                      break a;
+                    }
+                    uD(c[46964] | 0);
+                    continue a;
+                  }
+                  case 109: {
+                    m = 0;
+                    f = c[46965] | 0;
+                    e = c[46964] | 0;
+                    if (f | 0) c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[(e + (f + -1)) >> 0] | 0) == 10) & 1;
+                    c[46976] = (c[46976] | 0) + 1;
+                    uD(e);
+                    continue a;
+                  }
+                  case 112: {
+                    m = 0;
+                    f = c[46965] | 0;
+                    e = c[46964] | 0;
+                    if (f | 0) c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[(e + (f + -1)) >> 0] | 0) == 10) & 1;
+                    uD(e);
+                    c[4725] = (c[4725] | 0) + 1;
+                    continue a;
+                  }
+                  case 115: {
+                    m = 0;
+                    f = c[46965] | 0;
+                    e = c[46964] | 0;
+                    if (f | 0) c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[(e + (f + -1)) >> 0] | 0) == 10) & 1;
+                    uD(e);
+                    continue a;
+                  }
+                  case 121: {
+                    m = 0;
+                    f = c[46965] | 0;
+                    e = c[46964] | 0;
+                    if (f | 0) c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[(e + (f + -1)) >> 0] | 0) == 10) & 1;
+                    U4(e, f, 1, c[46963] | 0) | 0;
+                    continue a;
+                  }
+                }
+              }
+              switch (m | 0) {
+                case 27: {
+                  e = c[46965] | 0;
+                  if (!e) l = -1;
+                  else {
+                    c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[((c[46964] | 0) + (e + -1)) >> 0] | 0) == 10) & 1;
+                    l = -1;
+                  }
+                  break;
+                }
+                case 53: {
+                  e = c[46965] | 0;
+                  if (!e) l = 259;
+                  else {
+                    c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[((c[46964] | 0) + (e + -1)) >> 0] | 0) == 10) & 1;
+                    l = 259;
+                  }
+                  break;
+                }
+                case 55: {
+                  e = c[46965] | 0;
+                  if (!e) l = 260;
+                  else {
+                    c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[((c[46964] | 0) + (e + -1)) >> 0] | 0) == 10) & 1;
+                    l = 260;
+                  }
+                  break;
+                }
+                case 57: {
+                  e = c[46965] | 0;
+                  if (e | 0)
+                    c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[((c[46964] | 0) + (e + -1)) >> 0] | 0) == 10) & 1;
+                  if (!(c[46969] | 0)) {
+                    c[46969] = 258;
+                    l = 258;
+                  } else l = 258;
+                  break;
+                }
+                case 61: {
+                  e = c[46965] | 0;
+                  if (e | 0)
+                    c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[((c[46964] | 0) + (e + -1)) >> 0] | 0) == 10) & 1;
+                  if (!(c[46969] | 0)) {
+                    c[46969] = 261;
+                    l = 261;
+                  } else l = 261;
+                  break;
+                }
+                case 65: {
+                  e = c[46965] | 0;
+                  if (!e) l = 263;
+                  else {
+                    c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[((c[46964] | 0) + (e + -1)) >> 0] | 0) == 10) & 1;
+                    l = 263;
+                  }
+                  break;
+                }
+                case 67: {
+                  e = c[46965] | 0;
+                  if (!e) l = 262;
+                  else {
+                    c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[((c[46964] | 0) + (e + -1)) >> 0] | 0) == 10) & 1;
+                    l = 262;
+                  }
+                  break;
+                }
+                case 69: {
+                  e = c[46965] | 0;
+                  if (e | 0)
+                    c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[((c[46964] | 0) + (e + -1)) >> 0] | 0) == 10) & 1;
+                  l = (c[46969] | 0) == 261 ? 264 : 45;
+                  break;
+                }
+                case 72: {
+                  e = c[46965] | 0;
+                  if (e | 0)
+                    c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[((c[46964] | 0) + (e + -1)) >> 0] | 0) == 10) & 1;
+                  l = (c[46969] | 0) == 258 ? 264 : 45;
+                  break;
+                }
+                case 75: {
+                  f = c[46965] | 0;
+                  e = c[46964] | 0;
+                  if (f | 0) c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[(e + (f + -1)) >> 0] | 0) == 10) & 1;
+                  c[46992] = fD(c[46942] | 0, e) | 0;
+                  l = 267;
+                  break;
+                }
+                case 78: {
+                  e = c[46965] | 0;
+                  if (e | 0)
+                    c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[((c[46964] | 0) + (e + -1)) >> 0] | 0) == 10) & 1;
+                  if (rD() | 0) {
+                    m = ((c[46965] | 0) + -1) | 0;
+                    a[f >> 0] = a[194805] | 0;
+                    n = (j + m) | 0;
+                    c[46973] = n;
+                    c[46964] = j;
+                    c[46965] = m;
+                    a[194805] = a[n >> 0] | 0;
+                    a[n >> 0] = 0;
+                    c[46973] = n;
+                  }
+                  c[46992] = fD(c[46942] | 0, c[46964] | 0) | 0;
+                  l = 267;
+                  break;
+                }
+                case 86: {
+                  e = c[46965] | 0;
+                  if (e | 0)
+                    c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[((c[46964] | 0) + (e + -1)) >> 0] | 0) == 10) & 1;
+                  c[46971] = 1;
+                  tD();
+                  l = 268;
+                  break;
+                }
+                case 108: {
+                  c[46971] = 1;
+                  vD();
+                  l = 268;
+                  break;
+                }
+                case 118: {
+                  f = c[46965] | 0;
+                  e = c[46964] | 0;
+                  if (f | 0) c[((c[c[46972] >> 2] | 0) + 28) >> 2] = ((a[(e + (f + -1)) >> 0] | 0) == 10) & 1;
+                  l = a[e >> 0] | 0;
+                  break;
+                }
+                case 134: {
+                  zD(96619);
+                  break;
+                }
+              }
+              return l | 0;
+            }
+            function nD() {
+              var a = 0,
+                b = 0,
+                d = 0;
+              b = c[46972] | 0;
+              do
+                if (!b) {
+                  a = GD(4) | 0;
+                  c[46972] = a;
+                  if (!a) zD(96977);
+                  else {
+                    c[a >> 2] = 0;
+                    a = 1;
+                    d = 9;
+                    break;
+                  }
+                } else {
+                  a = c[46983] | 0;
+                  if (0 >= ((a + -1) | 0) >>> 0) {
+                    a = (a + 8) | 0;
+                    b = AD(b, a << 2) | 0;
+                    c[46972] = b;
+                    if (!b) zD(96977);
+                    else {
+                      d = (b + (c[46983] << 2)) | 0;
+                      c[d >> 2] = 0;
+                      c[(d + 4) >> 2] = 0;
+                      c[(d + 8) >> 2] = 0;
+                      c[(d + 12) >> 2] = 0;
+                      c[(d + 16) >> 2] = 0;
+                      c[(d + 20) >> 2] = 0;
+                      c[(d + 24) >> 2] = 0;
+                      c[(d + 28) >> 2] = 0;
+                      d = 9;
+                      break;
+                    }
+                  }
+                }
+              while (0);
+              if ((d | 0) == 9) c[46983] = a;
+              return;
+            }
+            function oD(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = GD(48) | 0;
+              if (!d) zD(96932);
+              c[(d + 12) >> 2] = b;
+              b = GD((b + 2) | 0) | 0;
+              c[(d + 4) >> 2] = b;
+              if (!b) zD(96932);
+              else {
+                c[(d + 20) >> 2] = 1;
+                CD(d, a);
+                return d | 0;
+              }
+              return 0;
+            }
+            function pD() {
+              var b = 0,
+                d = 0;
+              d = c[46972] | 0;
+              b = c[d >> 2] | 0;
+              c[46977] = c[(b + 16) >> 2];
+              b = c[(b + 8) >> 2] | 0;
+              c[46973] = b;
+              c[46964] = b;
+              c[46962] = c[c[d >> 2] >> 2];
+              a[194805] = a[b >> 0] | 0;
+              return;
+            }
+            function qD() {
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              g = l;
+              l = (l + 32) | 0;
+              f = g;
+              d = (g + 16) | 0;
+              e = (g + 12) | 0;
+              h = c[46964] | 0;
+              b = (h + 1) | 0;
+              i = (Q2(b, 96916, 4) | 0) == 0;
+              b = i ? (h + 5) | 0 : b;
+              c[f >> 2] = e;
+              c[(f + 4) >> 2] = g + 20;
+              c[(f + 8) >> 2] = d;
+              f = b5(b, 96921, f) | 0;
+              if ((f | 0) > 0 ? ((c[4725] = (c[e >> 2] | 0) + -1), (f | 0) != 1) : 0) {
+                d = (b + (c[d >> 2] | 0)) | 0;
+                b = d;
+                a: while (1) {
+                  e = a[b >> 0] | 0;
+                  switch ((e << 24) >> 24) {
+                    case 0:
+                    case 34:
+                      break a;
+                    default: {
+                    }
+                  }
+                  b = (b + 1) | 0;
+                }
+                if (((b | 0) != (d | 0)) & ((e << 24) >> 24 == 34)) {
+                  a[b >> 0] = 0;
+                  FD(d, (b - d) | 0);
+                }
+              }
+              l = g;
+              return;
+            }
+            function rD() {
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              j = l;
+              l = (l + 2080) | 0;
+              i = (j + 8) | 0;
+              f = j;
+              b = (j + 1056) | 0;
+              d = (j + 32) | 0;
+              h = (j + 16) | 0;
+              k = a[((c[46964] | 0) + ((c[46965] | 0) + -1)) >> 0] | 0;
+              e = (k << 24) >> 24 == 46;
+              if (e | ((((k & 255) + -48) | 0) >>> 0 < 10))
+                if (e ? (ED() | 0) != 0 : 0) g = 4;
+                else b = 0;
+              else g = 4;
+              if ((g | 0) == 4) {
+                k = c[46966] | 0;
+                kA(h, 1024, b);
+                nA(h, 96827) | 0;
+                nA(h, c[46964] | 0) | 0;
+                c[f >> 2] = c[4725];
+                m4(d, 96871, f) | 0;
+                nA(h, d) | 0;
+                nA(h, (k | 0) == 0 ? 96821 : k) | 0;
+                nA(h, 96888) | 0;
+                d = (h + 4) | 0;
+                b = c[d >> 2] | 0;
+                if (b >>> 0 >= (c[(h + 8) >> 2] | 0) >>> 0) {
+                  lA(h, 1) | 0;
+                  b = c[d >> 2] | 0;
+                }
+                a[b >> 0] = 0;
+                b = c[h >> 2] | 0;
+                c[d >> 2] = b;
+                c[i >> 2] = b;
+                gA(0, 96913, i) | 0;
+                oA(h);
+                b = 1;
+              }
+              l = j;
+              return b | 0;
+            }
+            function sD() {
+              var b = 0;
+              b = c[46978] | 0;
+              if (!b) {
+                b = T1(1024) | 0;
+                c[46978] = b;
+                c[46980] = b + 1024;
+              }
+              c[46979] = b;
+              a[b >> 0] = 0;
+              return;
+            }
+            function tD() {
+              c[46992] = fD(c[46942] | 0, c[46978] | 0) | 0;
+              a[c[46978] >> 0] = 0;
+              return;
+            }
+            function uD(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              e = c[46979] | 0;
+              d = c[46978] | 0;
+              if (e >>> 0 > d >>> 0) {
+                e = (e + -1) | 0;
+                f = 3;
+              }
+              a: while (1) {
+                if ((f | 0) == 3) c[46979] = e;
+                f = c[46980] | 0;
+                g = f;
+                do {
+                  h = b;
+                  b = (b + 1) | 0;
+                  h = a[h >> 0] | 0;
+                  i = e;
+                  e = (e + 1) | 0;
+                  a[i >> 0] = h;
+                  if (!((h << 24) >> 24)) break a;
+                } while (e >>> 0 < f >>> 0);
+                c[46979] = e;
+                f = d;
+                i = (g - f) << 1;
+                d = W1(d, i) | 0;
+                c[46978] = d;
+                c[46980] = d + i;
+                e = (d + (e - f)) | 0;
+                f = 3;
+              }
+              c[46979] = e;
+              return;
+            }
+            function vD() {
+              c[46992] = gD(c[46942] | 0, c[46978] | 0) | 0;
+              a[c[46978] >> 0] = 0;
+              return;
+            }
+            function wD() {
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = c[46973] | 0;
+              g = c[46964] | 0;
+              e = ((c[((c[c[46972] >> 2] | 0) + 28) >> 2] | 0) + (c[46971] | 0)) | 0;
+              while (1) {
+                if (g >>> 0 >= h >>> 0) break;
+                d = a[g >> 0] | 0;
+                if (!((d << 24) >> 24)) d = 1;
+                else d = c[(18904 + ((d & 255) << 2)) >> 2] | 0;
+                if (b[(63856 + (e << 1)) >> 1] | 0) {
+                  c[46974] = e;
+                  c[46975] = g;
+                }
+                a: while (1) {
+                  f = d & 255;
+                  do {
+                    d = (f + (b[(64042 + (e << 1)) >> 1] | 0)) | 0;
+                    if ((e | 0) == (b[(64252 + (d << 1)) >> 1] | 0)) break a;
+                    d = b[(64788 + (e << 1)) >> 1] | 0;
+                    e = (d << 16) >> 16;
+                  } while ((d << 16) >> 16 <= 92);
+                  d = c[(19928 + (f << 2)) >> 2] | 0;
+                }
+                g = (g + 1) | 0;
+                e = b[(64998 + (d << 1)) >> 1] | 0;
+              }
+              return e | 0;
+            }
+            function xD(a) {
+              a = a | 0;
+              var d = 0;
+              if (b[(63856 + (a << 1)) >> 1] | 0) {
+                d = c[46973] | 0;
+                c[46974] = a;
+                c[46975] = d;
+              }
+              while (1) {
+                d = ((b[(64042 + (a << 1)) >> 1] | 0) + 1) | 0;
+                if ((a | 0) == (b[(64252 + (d << 1)) >> 1] | 0)) break;
+                a = b[(64788 + (a << 1)) >> 1] | 0;
+              }
+              d = b[(64998 + (d << 1)) >> 1] | 0;
+              return ((d << 16) >> 16 == 92 ? 0 : (d << 16) >> 16) | 0;
+            }
+            function yD() {
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              j = c[46972] | 0;
+              g = c[j >> 2] | 0;
+              i = c[(g + 4) >> 2] | 0;
+              f = c[46964] | 0;
+              l = c[46973] | 0;
+              k = l;
+              if (l >>> 0 > ((i + ((c[46977] | 0) + 1)) | 0) >>> 0) zD(96674);
+              h = (k - f) | 0;
+              if (!(c[(g + 40) >> 2] | 0)) b = (h | 0) == 1 ? 1 : 2;
+              else {
+                l = (h + -1) | 0;
+                h = i;
+                g = 0;
+                while (1) {
+                  if ((g | 0) >= (l | 0)) break;
+                  a[h >> 0] = a[f >> 0] | 0;
+                  h = (h + 1) | 0;
+                  f = (f + 1) | 0;
+                  g = (g + 1) | 0;
+                }
+                f = c[j >> 2] | 0;
+                do
+                  if ((c[(f + 44) >> 2] | 0) == 2) {
+                    c[46977] = 0;
+                    c[(f + 16) >> 2] = 0;
+                    e = f;
+                    m = 17;
+                  } else {
+                    while (1) {
+                      i = (f + 12) | 0;
+                      h = c[i >> 2] | 0;
+                      g = (h - l + -1) | 0;
+                      if (g | 0) {
+                        m = 16;
+                        break;
+                      }
+                      g = (f + 4) | 0;
+                      j = c[g >> 2] | 0;
+                      if (!(c[(f + 20) >> 2] | 0)) {
+                        m = 12;
+                        break;
+                      }
+                      f = h << 1;
+                      f = (f | 0) == 0 ? ((h >>> 3) + h) | 0 : f;
+                      c[i >> 2] = f;
+                      f = AD(j, (f + 2) | 0) | 0;
+                      c[g >> 2] = f;
+                      if (!f) break;
+                      j = (f + (k - j)) | 0;
+                      c[46973] = j;
+                      f = c[c[46972] >> 2] | 0;
+                      k = j;
+                    }
+                    if ((m | 0) == 12) c[g >> 2] = 0;
+                    else if ((m | 0) == 16) {
+                      d =
+                        nb[c[c[((c[46967] | 0) + 8) >> 2] >> 2] & 63](
+                          c[46968] | 0,
+                          ((c[(f + 4) >> 2] | 0) + l) | 0,
+                          g >>> 0 < 8192 ? g : 8192
+                        ) | 0;
+                      e = c[c[46972] >> 2] | 0;
+                      c[46977] = d;
+                      c[(e + 16) >> 2] = d;
+                      if (!d) {
+                        m = 17;
+                        break;
+                      } else {
+                        b = 0;
+                        break;
+                      }
+                    }
+                    zD(96730);
+                  }
+                while (0);
+                do
+                  if ((m | 0) == 17)
+                    if (!l) {
+                      BD(c[46962] | 0);
+                      b = 1;
+                      d = c[46977] | 0;
+                      e = c[c[46972] >> 2] | 0;
+                      break;
+                    } else {
+                      c[(e + 44) >> 2] = 2;
+                      b = 2;
+                      d = 0;
+                      break;
+                    }
+                while (0);
+                f = (d + l) | 0;
+                do
+                  if (f >>> 0 > (c[(e + 12) >> 2] | 0) >>> 0) {
+                    m = AD(c[(e + 4) >> 2] | 0, (f + (d >>> 1)) | 0) | 0;
+                    d = c[46972] | 0;
+                    c[((c[d >> 2] | 0) + 4) >> 2] = m;
+                    d = c[((c[d >> 2] | 0) + 4) >> 2] | 0;
+                    if (!d) zD(96774);
+                    else {
+                      n = c[46977] | 0;
+                      o = d;
+                      break;
+                    }
+                  } else {
+                    n = d;
+                    o = c[(e + 4) >> 2] | 0;
+                  }
+                while (0);
+                n = (n + l) | 0;
+                c[46977] = n;
+                a[(o + n) >> 0] = 0;
+                o = c[46972] | 0;
+                a[((c[((c[o >> 2] | 0) + 4) >> 2] | 0) + ((c[46977] | 0) + 1)) >> 0] = 0;
+                c[46964] = c[((c[o >> 2] | 0) + 4) >> 2];
+              }
+              return b | 0;
+            }
+            function zD(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = l;
+              l = (l + 16) | 0;
+              d = c[15712] | 0;
+              c[b >> 2] = a;
+              w4(d, 96670, b) | 0;
+              Sa(2);
+            }
+            function AD(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return W1(a, b) | 0;
+            }
+            function BD(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              d = c[46972] | 0;
+              if ((d | 0) != 0 ? ((b = c[d >> 2] | 0), (b | 0) != 0) : 0) e = 4;
+              else {
+                nD();
+                b = oD(c[46962] | 0, 16384) | 0;
+                d = c[46972] | 0;
+                c[d >> 2] = b;
+                if (!d) b = 0;
+                else e = 4;
+              }
+              CD(b, a);
+              pD();
+              return;
+            }
+            function CD(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = c[(d2() | 0) >> 2] | 0;
+              DD(a);
+              c[a >> 2] = b;
+              c[(a + 40) >> 2] = 1;
+              b = c[46972] | 0;
+              if (!b) b = 0;
+              else b = c[b >> 2] | 0;
+              if ((b | 0) != (a | 0)) {
+                c[(a + 32) >> 2] = 1;
+                c[(a + 36) >> 2] = 0;
+              }
+              c[(a + 24) >> 2] = 0;
+              c[(d2() | 0) >> 2] = d;
+              return;
+            }
+            function DD(b) {
+              b = b | 0;
+              var d = 0;
+              if (b | 0) {
+                c[(b + 16) >> 2] = 0;
+                d = (b + 4) | 0;
+                a[c[d >> 2] >> 0] = 0;
+                a[((c[d >> 2] | 0) + 1) >> 0] = 0;
+                c[(b + 8) >> 2] = c[d >> 2];
+                c[(b + 28) >> 2] = 1;
+                c[(b + 44) >> 2] = 0;
+                d = c[46972] | 0;
+                if (!d) d = 0;
+                else d = c[d >> 2] | 0;
+                if ((d | 0) == (b | 0)) pD();
+              }
+              return;
+            }
+            function ED() {
+              var b = 0,
+                d = 0;
+              d = c[46964] | 0;
+              b = ((c[46965] | 0) + -2) | 0;
+              while (1) {
+                if ((b | 0) <= -1) {
+                  b = 0;
+                  break;
+                }
+                if ((a[(d + b) >> 0] | 0) == 46) {
+                  b = 1;
+                  break;
+                } else b = (b + -1) | 0;
+              }
+              return b | 0;
+            }
+            function FD(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = c[46981] | 0;
+              if ((d | 0) < (b | 0)) {
+                if (!d) d = T1((b + 1) | 0) | 0;
+                else d = W1(c[46982] | 0, (b + 1) | 0) | 0;
+                c[46982] = d;
+                c[46981] = b;
+              } else d = c[46982] | 0;
+              r3(d, a) | 0;
+              c[46966] = c[46982];
+              return;
+            }
+            function GD(a) {
+              a = a | 0;
+              return T1(a) | 0;
+            }
+            function HD(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              m = l;
+              l = (l + 2112) | 0;
+              k = (m + 32) | 0;
+              i = (m + 24) | 0;
+              h = (m + 16) | 0;
+              g = (m + 8) | 0;
+              f = m;
+              d = (m + 56) | 0;
+              j = (m + 40) | 0;
+              kA(j, 1024, (m + 1080) | 0);
+              e = c[46966] | 0;
+              if (e | 0) {
+                nA(j, e) | 0;
+                nA(j, 97027) | 0;
+              }
+              nA(j, b) | 0;
+              c[f >> 2] = c[4725];
+              m4(d, 97030, f) | 0;
+              nA(j, d) | 0;
+              a: do
+                if (!(a[c[46964] >> 0] | 0))
+                  switch (((((c[46971] | 0) + -1) | 0) / 2) | 0 | 0) {
+                    case 2: {
+                      c[g >> 2] = 16384;
+                      m4(d, 97050, g) | 0;
+                      nA(j, d) | 0;
+                      b = c[46978] | 0;
+                      if (!(a[b >> 0] | 0)) break a;
+                      i = l2(b) | 0;
+                      nA(j, 97112) | 0;
+                      b = c[46978] | 0;
+                      if ((i | 0) > 80) a[(b + 80) >> 0] = 0;
+                      nA(j, b) | 0;
+                      break a;
+                    }
+                    case 3: {
+                      c[h >> 2] = 16384;
+                      m4(d, 97131, h) | 0;
+                      nA(j, d) | 0;
+                      b = c[46978] | 0;
+                      if (!(a[b >> 0] | 0)) break a;
+                      i = l2(b) | 0;
+                      nA(j, 97199) | 0;
+                      b = c[46978] | 0;
+                      if ((i | 0) > 80) a[(b + 80) >> 0] = 0;
+                      nA(j, b) | 0;
+                      break a;
+                    }
+                    case 1: {
+                      c[i >> 2] = 16384;
+                      m4(d, 97218, i) | 0;
+                      nA(j, d) | 0;
+                      break a;
+                    }
+                    default:
+                      break a;
+                  }
+                else {
+                  nA(j, 97042) | 0;
+                  nA(j, c[46964] | 0) | 0;
+                  d = (j + 4) | 0;
+                  b = c[d >> 2] | 0;
+                  if (b >>> 0 >= (c[(j + 8) >> 2] | 0) >>> 0) {
+                    lA(j, 1) | 0;
+                    b = c[d >> 2] | 0;
+                  }
+                  c[d >> 2] = b + 1;
+                  a[b >> 0] = 39;
+                }
+              while (0);
+              e = (j + 4) | 0;
+              b = c[e >> 2] | 0;
+              d = (j + 8) | 0;
+              if (b >>> 0 >= (c[d >> 2] | 0) >>> 0) {
+                lA(j, 1) | 0;
+                b = c[e >> 2] | 0;
+              }
+              c[e >> 2] = b + 1;
+              a[b >> 0] = 10;
+              b = c[e >> 2] | 0;
+              if (b >>> 0 >= (c[d >> 2] | 0) >>> 0) {
+                lA(j, 1) | 0;
+                b = c[e >> 2] | 0;
+              }
+              a[b >> 0] = 0;
+              i = c[j >> 2] | 0;
+              c[e >> 2] = i;
+              c[k >> 2] = i;
+              gA(1, 96913, k) | 0;
+              oA(j);
+              l = m;
+              return;
+            }
+            function ID() {
+              JD(c[46964] | 0);
+              return;
+            }
+            function JD(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              j = c[46973] | 0;
+              a[j >> 0] = a[194805] | 0;
+              i = c[46972] | 0;
+              e = c[i >> 2] | 0;
+              d = c[(e + 4) >> 2] | 0;
+              if (j >>> 0 < ((d + 2) | 0) >>> 0) {
+                f = (d + ((c[46977] | 0) + 2)) | 0;
+                g = (d + ((c[(e + 12) >> 2] | 0) + 2)) | 0;
+                k = d;
+                h = e;
+                while (1) {
+                  if (f >>> 0 <= k >>> 0) break;
+                  e = (f + -1) | 0;
+                  k = (g + -1) | 0;
+                  a[k >> 0] = a[e >> 0] | 0;
+                  h = c[i >> 2] | 0;
+                  f = e;
+                  g = k;
+                  k = c[(h + 4) >> 2] | 0;
+                }
+                e = (g - f) | 0;
+                d = (j + e) | 0;
+                j = c[(h + 12) >> 2] | 0;
+                c[46977] = j;
+                c[(h + 16) >> 2] = j;
+                if (d >>> 0 < ((k + 2) | 0) >>> 0) zD(97277);
+                else {
+                  l = (b + e) | 0;
+                  m = d;
+                }
+              } else {
+                l = b;
+                m = j;
+              }
+              b = (m + -1) | 0;
+              a[b >> 0] = 64;
+              c[46964] = l;
+              a[194805] = a[b >> 0] | 0;
+              c[46973] = b;
+              return;
+            }
+            function KD() {
+              var a = 0;
+              a = c[46972] | 0;
+              if (!a) a = 0;
+              else a = c[a >> 2] | 0;
+              DD(a);
+              return;
+            }
+            function LD(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              e = l;
+              l = (l + 80) | 0;
+              f = e;
+              g = (a + 52) | 0;
+              XD(a, c[g >> 2] | 0, 18548);
+              a = (f + 8) | 0;
+              c[a >> 2] = b;
+              c[(a + 4) >> 2] = d;
+              d = c[g >> 2] | 0;
+              d = nb[c[d >> 2] & 63](d, f, 4) | 0;
+              l = e;
+              return d | 0;
+            }
+            function MD(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              f = LD(b, d, e) | 0;
+              if (!f) {
+                f = dC(b, 72) | 0;
+                c[(f + 64) >> 2] = c[(b + 64) >> 2];
+                g = (f + 24) | 0;
+                h = c[(b + 24) >> 2] | 0;
+                c[g >> 2] = h;
+                a[g >> 0] = h & 255 & -9;
+                c[(f + 56) >> 2] = b;
+                c[(f + 60) >> 2] = c[(b + 60) >> 2];
+                b = (f + 8) | 0;
+                c[b >> 2] = d;
+                c[(b + 4) >> 2] = e;
+                qB(f) | 0;
+              }
+              return f | 0;
+            }
+            function ND(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              g = l;
+              l = (l + 16) | 0;
+              f = g;
+              if (
+                !(((b | 0) != 0 ? (HB(a, 0, b, f, 0) | 0) != 0 : 0)
+                  ? ((e = f), (e = LD(a, c[e >> 2] | 0, c[(e + 4) >> 2] | 0) | 0), (e | 0) != 0)
+                  : 0)
+              )
+                if ((d | 0) != 0 ? (HB(a, 0, b, f, 1) | 0) != 0 : 0) {
+                  e = f;
+                  e = MD(a, c[e >> 2] | 0, c[(e + 4) >> 2] | 0) | 0;
+                  LB(a, 0, e);
+                } else e = 0;
+              l = g;
+              return e | 0;
+            }
+            function OD(a) {
+              a = a | 0;
+              a = c[(a + 52) >> 2] | 0;
+              return nb[c[a >> 2] & 63](a, 0, 128) | 0;
+            }
+            function PD(a) {
+              a = a | 0;
+              var b = 0;
+              b = QD(a) | 0;
+              if (!b) a = 0;
+              else {
+                b = c[(b + 52) >> 2] | 0;
+                a = nb[c[b >> 2] & 63](b, a, 8) | 0;
+              }
+              return a | 0;
+            }
+            function QD(a) {
+              a = a | 0;
+              return c[(a + 56) >> 2] | 0;
+            }
+            function RD(a, b) {
+              a = a | 0;
+              b = b | 0;
+              a = c[(a + 52) >> 2] | 0;
+              return nb[c[a >> 2] & 63](a, b, 2) | 0;
+            }
+            function SD(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              a = c[46984] | 0;
+              e = (b | 0) != 0;
+              do
+                if (!a)
+                  if (e) {
+                    U1(b);
+                    a = 0;
+                    break;
+                  } else {
+                    a = T1(d) | 0;
+                    break;
+                  }
+                else if (e) {
+                  eC(a, b);
+                  a = 0;
+                  break;
+                } else {
+                  a = dC(a, d) | 0;
+                  break;
+                }
+              while (0);
+              return a | 0;
+            }
+            function TD(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              a = c[46984] | 0;
+              if (!a) U1(b);
+              else eC(a, b);
+              return;
+            }
+            function UD(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = (b + 28) | 0;
+              f = c[e >> 2] | 0;
+              c[e >> 2] = 7;
+              c[46984] = a;
+              d = Vz(b, d) | 0;
+              c[e >> 2] = f;
+              c[46984] = 0;
+              return d | 0;
+            }
+            function VD(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              c[46984] = a;
+              return nb[c[b >> 2] & 63](b, d, 2) | 0;
+            }
+            function WD(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = ((bA(b, 0, 0) | 0) + 28) | 0;
+              e = c[d >> 2] | 0;
+              c[d >> 2] = 7;
+              c[46984] = a;
+              if (!(Rz(b) | 0)) {
+                c[d >> 2] = e;
+                c[46984] = 0;
+                a = 0;
+              } else a = 1;
+              return a | 0;
+            }
+            function XD(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              if (c | 0 ? (bA(b, 0, 0) | 0) != (c | 0) : 0) bA(b, c, 0) | 0;
+              return;
+            }
+            function YD(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if (!(iD(a) | 0)) b = _D(a, b) | 0;
+              else ZD(a, b) | 0;
+              return b | 0;
+            }
+            function ZD(b, c) {
+              b = b | 0;
+              c = c | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              a[c >> 0] = 60;
+              e = c;
+              while (1) {
+                d = (e + 1) | 0;
+                f = a[b >> 0] | 0;
+                if (!((f << 24) >> 24)) break;
+                a[d >> 0] = f;
+                b = (b + 1) | 0;
+                e = d;
+              }
+              a[d >> 0] = 62;
+              a[(e + 2) >> 0] = 0;
+              return c | 0;
+            }
+            function _D(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              a: do
+                if ((b | 0) != 0 ? (a[b >> 0] | 0) != 0 : 0) {
+                  a[d >> 0] = 34;
+                  l = a[b >> 0] | 0;
+                  q = 0;
+                  g = ((((l + -45) & 255) < 2) | ((((l & 255) + -48) | 0) >>> 0 < 10)) & 1;
+                  h = 0;
+                  i = 0;
+                  j = 0;
+                  e = (d + 1) | 0;
+                  f = (b + 1) | 0;
+                  b: while (1) {
+                    k = e;
+                    while (1) {
+                      if (!((l << 24) >> 24)) break b;
+                      e = l & 255;
+                      c: do
+                        if ((l << 24) >> 24 == 34) {
+                          a[k >> 0] = 92;
+                          m = g;
+                          n = 1;
+                          k = (k + 1) | 0;
+                        } else {
+                          if (!g) {
+                            n = ((l << 24) >> 24 > -1) & (((l << 24) >> 24 != 95) & ((a3(e) | 0) == 0));
+                            m = 0;
+                            n = n ? 1 : h;
+                            break;
+                          }
+                          switch ((l << 24) >> 24) {
+                            case 45: {
+                              n = (j | 0) == 0;
+                              m = n ? g : 0;
+                              n = n ? h : 1;
+                              break c;
+                            }
+                            case 46: {
+                              n = (i | 0) == 0;
+                              m = n ? g : 0;
+                              n = n ? h : 1;
+                              i = (i + 1) | 0;
+                              break c;
+                            }
+                            default: {
+                              n = ((e + -48) | 0) >>> 0 < 10;
+                              m = n ? g : 0;
+                              n = n ? h : 1;
+                              break c;
+                            }
+                          }
+                        }
+                      while (0);
+                      e = (k + 1) | 0;
+                      a[k >> 0] = l;
+                      p = (f + 1) | 0;
+                      o = a[f >> 0] | 0;
+                      j = (j + 1) | 0;
+                      f = c[5031] | 0;
+                      if (!f) {
+                        g = m;
+                        h = n;
+                        k = e;
+                        f = p;
+                        l = o;
+                        continue;
+                      }
+                      g = o & 255;
+                      h = (o << 24) >> 24 != 0;
+                      if (
+                        (
+                          q & h
+                            ? !(
+                                ((l << 24) >> 24 == 92) |
+                                ((((l << 24) >> 24 > -1) &
+                                  ((((l + -45) & 255) > 1) & ((a3((l << 24) >> 24) | 0) == 0))) ^
+                                  1)
+                              )
+                            : 0
+                        )
+                          ? !(((o << 24) >> 24 > -1) & ((((o + -45) & 255) > 1) & ((a3(g) | 0) == 0)))
+                          : 0
+                      )
+                        break;
+                      if (((j | 0) < (f | 0)) | (h ^ 1)) {
+                        g = m;
+                        h = n;
+                        k = e;
+                        f = p;
+                        l = o;
+                        continue;
+                      }
+                      if (
+                        ((l << 24) >> 24 == 92) |
+                        ((((l << 24) >> 24 > -1) & (((a3((l << 24) >> 24) | 0) == 0) & (((l + -45) & 255) > 1))) ^ 1)
+                      ) {
+                        q = 1;
+                        g = m;
+                        h = n;
+                        l = o;
+                        f = p;
+                        continue b;
+                      }
+                      if (((o << 24) >> 24 > -1) & ((((o + -45) & 255) > 1) & ((a3(g) | 0) == 0))) {
+                        q = 1;
+                        g = m;
+                        h = n;
+                        l = o;
+                        f = p;
+                        continue b;
+                      }
+                      a[e >> 0] = 92;
+                      a[(k + 2) >> 0] = 10;
+                      g = m;
+                      h = 1;
+                      j = 0;
+                      k = (k + 3) | 0;
+                      f = p;
+                      l = o;
+                    }
+                    a[e >> 0] = 92;
+                    a[(k + 2) >> 0] = 10;
+                    q = 0;
+                    g = m;
+                    h = 1;
+                    j = 0;
+                    l = o;
+                    e = (k + 3) | 0;
+                    f = p;
+                  }
+                  a[k >> 0] = 34;
+                  a[(k + 1) >> 0] = 0;
+                  if (!h) {
+                    if ((j | 0) == 1 ? (((a[b >> 0] | 0) + -45) & 255) < 2 : 0) {
+                      b = d;
+                      break;
+                    } else e = 20128;
+                    while (1) {
+                      f = c[e >> 2] | 0;
+                      if (!f) break a;
+                      if (!(c3(f, b) | 0)) {
+                        b = d;
+                        break;
+                      } else e = (e + 4) | 0;
+                    }
+                  } else b = d;
+                } else b = 97309;
+              while (0);
+              return b | 0;
+            }
+            function $D(a) {
+              a = a | 0;
+              return YD(a, aE(a) | 0) | 0;
+            }
+            function aE(a) {
+              a = a | 0;
+              var b = 0;
+              b = (((l2(a) | 0) << 1) + 2) | 0;
+              b = b >>> 0 > 1024 ? b : 1024;
+              a = c[46986] | 0;
+              if (b >>> 0 > (c[46985] | 0) >>> 0) {
+                if (!a) a = T1(b) | 0;
+                else a = W1(a, b) | 0;
+                c[46986] = a;
+                c[46985] = b;
+              }
+              return a | 0;
+            }
+            function bE(a, b) {
+              a = a | 0;
+              b = b | 0;
+              a = OD(a) | 0;
+              while (1) {
+                if (!a) {
+                  a = 0;
+                  break;
+                }
+                if ((cE(a) | 0) == 0 ? oC(a, b, 0) | 0 : 0) {
+                  a = 1;
+                  break;
+                }
+                a = PD(a) | 0;
+              }
+              return a | 0;
+            }
+            function cE(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              h = KB(b) | 0;
+              if ((h | 0) != 0 ? (a[h >> 0] | 0) != 37 : 0) d = 0;
+              else e = 3;
+              a: do
+                if ((e | 0) == 3) {
+                  d = wA(b) | 0;
+                  b: do
+                    if (d | 0 ? ((f = wA(QD(b) | 0) | 0), f | 0) : 0) {
+                      h = Xz(c[((wA(yC(b) | 0) | 0) + 8) >> 2] | 0) | 0;
+                      g = (d + 12) | 0;
+                      e = (f + 12) | 0;
+                      d = 0;
+                      while (1) {
+                        if ((d | 0) >= (h | 0)) break b;
+                        f = c[((c[g >> 2] | 0) + (d << 2)) >> 2] | 0;
+                        if ((f | 0 ? ((i = c[((c[e >> 2] | 0) + (d << 2)) >> 2] | 0), i | 0) : 0) ? s2(f, i) | 0 : 0) {
+                          d = 0;
+                          break a;
+                        }
+                        d = (d + 1) | 0;
+                      }
+                    }
+                  while (0);
+                  d = rA(b, 0) | 0;
+                  if (d)
+                    if ((Xz(c[(d + 8) >> 2] | 0) | 0) > 0) d = 0;
+                    else return ((Xz(c[(d + 12) >> 2] | 0) | 0) < 1) | 0;
+                  else d = 1;
+                }
+              while (0);
+              return d | 0;
+            }
+            function dE(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              c[46987] = 0;
+              e = QA(b, 97319) | 0;
+              if (
+                (e | 0 ? (((a[e >> 0] | 0) + -48) | 0) >>> 0 < 10 : 0)
+                  ? ((f = y4(e, 0, 10) | 0), ((f | 0) == 0) | ((f | 0) > 59))
+                  : 0
+              )
+                c[5031] = f;
+              eE(b, 1);
+              if (((fE(b, d, 1) | 0) != -1 ? (gE(b, d) | 0) != -1 : 0) ? (hE(b, d) | 0) != -1 : 0) {
+                c[5031] = 128;
+                b = kb[c[((c[((c[(b + 64) >> 2] | 0) + 8) >> 2] | 0) + 8) >> 2] & 63](d) | 0;
+              } else b = -1;
+              return b | 0;
+            }
+            function eE(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              c[a >> 2] = c[a >> 2] & -9;
+              d = OD(a) | 0;
+              while (1) {
+                if (!d) break;
+                eE(d, 0);
+                d = PD(d) | 0;
+              }
+              a: do
+                if (b | 0) {
+                  b = jC(a) | 0;
+                  while (1) {
+                    if (!b) break a;
+                    c[b >> 2] = c[b >> 2] & -9;
+                    d = XA(a, b) | 0;
+                    while (1) {
+                      if (!d) break;
+                      c[d >> 2] = c[d >> 2] & -9;
+                      d = ZA(a, d) | 0;
+                    }
+                    b = kC(a, b) | 0;
+                  }
+                }
+              while (0);
+              return;
+            }
+            function fE(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              if ((e | 0) == 0 ? (QD(b) | 0) != 0 : 0) {
+                i = 0;
+                g = 195059;
+                k = 109514;
+              } else {
+                k = (a[(b + 24) >> 0] & 1) == 0 ? 195059 : 97363;
+                g = (zB(b) | 0) == 0;
+                c[46988] = GA(b, 2, 111455, 0) | 0;
+                c[46989] = GA(b, 2, 111464, 0) | 0;
+                i = 1;
+                g = g ? 195059 : 97366;
+              }
+              f = KB(b) | 0;
+              if ((f | 0) != 0 ? (a[f >> 0] | 0) != 37 : 0) {
+                h = 1;
+                j = 102604;
+              } else {
+                h = 0;
+                j = 195059;
+                f = 195059;
+              }
+              do
+                if ((iE(b, d) | 0) != -1 ? (jE(b, d, g) | 0) != -1 : 0) {
+                  g = (h | 0) == 0;
+                  if (h | i | 0) {
+                    if ((jE(b, d, k) | 0) == -1) {
+                      f = -1;
+                      break;
+                    }
+                    if ((jE(b, d, 102597) | 0) == -1) {
+                      f = -1;
+                      break;
+                    }
+                  }
+                  if (!g ? (uE(b, d, f) | 0) == -1 : 0) {
+                    f = -1;
+                    break;
+                  }
+                  if (
+                    ((jE(b, d, j) | 0) != -1 ? (jE(b, d, 97374) | 0) != -1 : 0)
+                      ? ((c[46987] = (c[46987] | 0) + 1), (zE(b, d, e) | 0) != -1)
+                      : 0
+                  ) {
+                    c[b >> 2] = c[b >> 2] | 8;
+                    f = 0;
+                  } else f = -1;
+                } else f = -1;
+              while (0);
+              return f | 0;
+            }
+            function gE(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              a: do
+                if ((kE(a, b) | 0) == -1) d = -1;
+                else {
+                  k = rA(yC(a) | 0, 0) | 0;
+                  i = (k | 0) == 0;
+                  j = (k + 12) | 0;
+                  k = (k + 8) | 0;
+                  h = jC(a) | 0;
+                  while (1) {
+                    if (!h) {
+                      d = 0;
+                      break a;
+                    }
+                    if (lE(a, h, (c[h >> 2] | 0) >>> 4, 0) | 0) {
+                      if (i) d = 0;
+                      else d = c[k >> 2] | 0;
+                      if ((mE(h, b, d) | 0) == -1) {
+                        d = -1;
+                        break a;
+                      }
+                    }
+                    g = XA(a, h) | 0;
+                    d = h;
+                    while (1) {
+                      if (!g) break;
+                      f = (g + -48) | 0;
+                      e = c[((((c[g >> 2] & 3) | 0) == 2 ? g : f) + 40) >> 2] | 0;
+                      if ((d | 0) != (e | 0) ? (lE(a, e, (c[h >> 2] | 0) >>> 4, 0) | 0) != 0 : 0) {
+                        if (i) d = 0;
+                        else d = c[k >> 2] | 0;
+                        if ((mE(c[((((c[g >> 2] & 3) | 0) == 2 ? g : f) + 40) >> 2] | 0, b, d) | 0) == -1) {
+                          d = -1;
+                          break a;
+                        }
+                        d = c[((((c[g >> 2] & 3) | 0) == 2 ? g : f) + 40) >> 2] | 0;
+                      }
+                      if (nE(a, g) | 0) {
+                        if (i) e = 0;
+                        else e = c[j >> 2] | 0;
+                        if ((oE(g, b, e) | 0) == -1) {
+                          d = -1;
+                          break a;
+                        }
+                      }
+                      g = ZA(a, g) | 0;
+                    }
+                    h = kC(a, h) | 0;
+                  }
+                }
+              while (0);
+              return d | 0;
+            }
+            function hE(a, b) {
+              a = a | 0;
+              b = b | 0;
+              c[46987] = (c[46987] | 0) + -1;
+              if ((iE(a, b) | 0) == -1) a = -1;
+              else a = (((jE(a, b, 111008) | 0) == -1) << 31) >> 31;
+              return a | 0;
+            }
+            function iE(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = c[46987] | 0;
+              while (1) {
+                if ((d | 0) <= 0) {
+                  d = 0;
+                  break;
+                }
+                if ((jE(a, b, 153597) | 0) == -1) {
+                  d = -1;
+                  break;
+                } else d = (d + -1) | 0;
+              }
+              return d | 0;
+            }
+            function jE(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              return lb[c[((c[((c[(a + 64) >> 2] | 0) + 8) >> 2] | 0) + 4) >> 2] & 127](b, d) | 0;
+            }
+            function kE(a, b) {
+              a = a | 0;
+              b = b | 0;
+              a = OD(a) | 0;
+              while (1) {
+                if (!a) {
+                  a = 0;
+                  break;
+                }
+                if (!(cE(a) | 0)) {
+                  if ((fE(a, b, 0) | 0) == -1) {
+                    a = -1;
+                    break;
+                  }
+                  if ((gE(a, b) | 0) == -1) {
+                    a = -1;
+                    break;
+                  }
+                  if ((hE(a, b) | 0) == -1) {
+                    a = -1;
+                    break;
+                  }
+                } else kE(a, b) | 0;
+                a = PD(a) | 0;
+              }
+              return a | 0;
+            }
+            function lE(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0;
+              if ((bE(a, b) | 0) == 0 ? (wE(a, b, c, d) | 0) != 0 : 0)
+                if ((xE(a, b) | 0) == 0 ? (yE(b) | 0) == 0 : 0) e = 5;
+                else a = 1;
+              else e = 5;
+              if ((e | 0) == 5) a = 0;
+              return a | 0;
+            }
+            function mE(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0;
+              d = xC(a) | 0;
+              do
+                if ((iE(d, b) | 0) != -1 ? (pE(a, b) | 0) != -1 : 0) {
+                  if ((rE(a) | 0) == 0 ? (sE(a, b, c) | 0) == -1 : 0) {
+                    a = -1;
+                    break;
+                  }
+                  a = jE(d, b, 97330) | 0;
+                } else a = -1;
+              while (0);
+              return a | 0;
+            }
+            function nE(a, b) {
+              a = a | 0;
+              b = b | 0;
+              a = OD(a) | 0;
+              while (1) {
+                if (!a) {
+                  a = 1;
+                  break;
+                }
+                if ((cE(a) | 0) == 0 ? mB(a, b, 0) | 0 : 0) {
+                  a = 0;
+                  break;
+                }
+                a = PD(a) | 0;
+              }
+              return a | 0;
+            }
+            function oE(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              e = c[a >> 2] & 3;
+              g = c[(((e | 0) == 3 ? a : (a + 48) | 0) + 40) >> 2] | 0;
+              e = c[(((e | 0) == 2 ? a : (a + -48) | 0) + 40) >> 2] | 0;
+              f = xC(g) | 0;
+              do
+                if (
+                  (
+                    (
+                      (((iE(f, b) | 0) != -1 ? (pE(g, b) | 0) != -1 : 0) ? (qE(a, b, c[46988] | 0) | 0) != -1 : 0)
+                        ? ((g = (xB(xC(g) | 0) | 0) != 0), (jE(f, b, g ? 100079 : 100084) | 0) != -1)
+                        : 0
+                    )
+                      ? (pE(e, b) | 0) != -1
+                      : 0
+                  )
+                    ? (qE(a, b, c[46989] | 0) | 0) != -1
+                    : 0
+                ) {
+                  if (!(rE(a) | 0)) {
+                    if ((sE(a, b, d) | 0) == -1) {
+                      a = -1;
+                      break;
+                    }
+                  } else if ((tE(a, b, 1) | 0) == -1) {
+                    a = -1;
+                    break;
+                  }
+                  a = jE(f, b, 97330) | 0;
+                } else a = -1;
+              while (0);
+              return a | 0;
+            }
+            function pE(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              i = l;
+              l = (l + 32) | 0;
+              g = i;
+              d = (i + 8) | 0;
+              e = KB(a) | 0;
+              f = xC(a) | 0;
+              if (!e) {
+                j = (a + 8) | 0;
+                a = c[(j + 4) >> 2] | 0;
+                e = g;
+                c[e >> 2] = c[j >> 2];
+                c[(e + 4) >> 2] = a;
+                m4(d, 97350, g) | 0;
+                if ((jE(f, b, d) | 0) == -1) a = -1;
+                else h = 4;
+              } else if ((uE(f, b, e) | 0) == -1) a = -1;
+              else h = 4;
+              if ((h | 0) == 4) a = 0;
+              l = i;
+              return a | 0;
+            }
+            function qE(b, c, d) {
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              a: do
+                if ((d | 0) != 0 ? ((e = xC(b) | 0), (f = RA(b, d) | 0), (a[f >> 0] | 0) != 0) : 0)
+                  if ((jE(e, c, 107984) | 0) == -1) b = -1;
+                  else {
+                    do
+                      if (iD(f) | 0) {
+                        if ((uE(e, c, f) | 0) == -1) {
+                          b = -1;
+                          break a;
+                        }
+                      } else {
+                        b = R2(f, 58) | 0;
+                        if (!b)
+                          if ((vE(e, c, f, 0) | 0) == -1) {
+                            b = -1;
+                            break a;
+                          } else break;
+                        a[b >> 0] = 0;
+                        if ((vE(e, c, f, 0) | 0) == -1) {
+                          b = -1;
+                          break a;
+                        }
+                        if ((jE(e, c, 107984) | 0) == -1) {
+                          b = -1;
+                          break a;
+                        }
+                        if ((vE(e, c, (b + 1) | 0, 0) | 0) == -1) {
+                          b = -1;
+                          break a;
+                        }
+                        a[b >> 0] = 58;
+                      }
+                    while (0);
+                    b = 0;
+                  }
+                else b = 0;
+              while (0);
+              return b | 0;
+            }
+            function rE(a) {
+              a = a | 0;
+              return (((c[a >> 2] | 0) >>> 3) & 1) | 0;
+            }
+            function sE(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              a: do
+                if (!(c[a >> 2] & 2)) {
+                  e = 0;
+                  k = 4;
+                } else {
+                  switch (tE(a, b, 0) | 0) {
+                    case -1: {
+                      e = -1;
+                      break a;
+                    }
+                    case 0: {
+                      e = 0;
+                      k = 4;
+                      break a;
+                    }
+                    default: {
+                    }
+                  }
+                  e = 1;
+                  k = 4;
+                }
+              while (0);
+              b: do
+                if ((k | 0) == 4) {
+                  f = wA(a) | 0;
+                  j = xC(a) | 0;
+                  c: do
+                    if (f) {
+                      i = (f + 12) | 0;
+                      h = nb[c[d >> 2] & 63](d, 0, 128) | 0;
+                      while (1) {
+                        if (!h) break c;
+                        do
+                          if (c[a >> 2] & 2) {
+                            g = c[46988] | 0;
+                            if (g | 0 ? (c[(h + 16) >> 2] | 0) == (c[(g + 16) >> 2] | 0) : 0) break;
+                            g = c[46989] | 0;
+                            if (!((g | 0) != 0 ? (c[(h + 16) >> 2] | 0) == (c[(g + 16) >> 2] | 0) : 0)) k = 12;
+                          } else k = 12;
+                        while (0);
+                        if ((k | 0) == 12) {
+                          k = 0;
+                          f = (h + 16) | 0;
+                          if ((c[((c[i >> 2] | 0) + (c[f >> 2] << 2)) >> 2] | 0) != (c[(h + 12) >> 2] | 0)) {
+                            g = (e + 1) | 0;
+                            if (e) {
+                              if ((jE(j, b, 97345) | 0) == -1) {
+                                e = -1;
+                                break b;
+                              }
+                              if ((iE(j, b) | 0) == -1) {
+                                e = -1;
+                                break b;
+                              }
+                            } else {
+                              if ((iE(j, b) | 0) == -1) {
+                                e = -1;
+                                break b;
+                              }
+                              if ((jE(j, b, 97342) | 0) == -1) {
+                                e = -1;
+                                break b;
+                              }
+                              c[46987] = (c[46987] | 0) + 1;
+                            }
+                            if ((uE(j, b, c[(h + 8) >> 2] | 0) | 0) == -1) {
+                              e = -1;
+                              break b;
+                            }
+                            if ((jE(j, b, 97348) | 0) == -1) {
+                              e = -1;
+                              break b;
+                            }
+                            if ((uE(j, b, c[((c[i >> 2] | 0) + (c[f >> 2] << 2)) >> 2] | 0) | 0) == -1) {
+                              e = -1;
+                              break b;
+                            } else e = g;
+                          }
+                        }
+                        h = nb[c[d >> 2] & 63](d, h, 8) | 0;
+                      }
+                    }
+                  while (0);
+                  if ((e | 0) > 0) {
+                    if ((jE(j, b, 97340) | 0) == -1) {
+                      e = -1;
+                      break;
+                    }
+                    c[46987] = (c[46987] | 0) + -1;
+                  }
+                  c[a >> 2] = c[a >> 2] | 8;
+                  e = 0;
+                }
+              while (0);
+              return e | 0;
+            }
+            function tE(b, c, d) {
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = KB(b) | 0;
+              b = xC(b) | 0;
+              if ((e | 0) != 0 ? (a[e >> 0] | 0) != 0 : 0)
+                if ((jE(b, c, 97333) | 0) != -1 ? (uE(b, c, e) | 0) != -1 : 0)
+                  if ((d | 0) != 0 ? (jE(b, c, 97340) | 0) == -1 : 0) b = -1;
+                  else {
+                    b = 1;
+                    f = 7;
+                  }
+                else b = -1;
+              else {
+                b = 0;
+                f = 7;
+              }
+              return b | 0;
+            }
+            function uE(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              return vE(a, b, c, 1) | 0;
+            }
+            function vE(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              if (!d) c = _D(c, aE(c) | 0) | 0;
+              else c = $D(c) | 0;
+              return jE(a, b, c) | 0;
+            }
+            function wE(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              a: do
+                if ((0 < e >>> 0) | (0 == (e | 0) ? ((c[b >> 2] | 0) >>> 4) >>> 0 < d >>> 0 : 0)) b = 0;
+                else {
+                  b = _A(a, b) | 0;
+                  while (1) {
+                    if (!b) {
+                      b = 1;
+                      break a;
+                    }
+                    if ((0 < e >>> 0) | (0 == (e | 0) ? ((c[c[(b + 40) >> 2] >> 2] | 0) >>> 4) >>> 0 < d >>> 0 : 0)) {
+                      b = 0;
+                      break a;
+                    }
+                    b = $A(a, b) | 0;
+                  }
+                }
+              while (0);
+              return b | 0;
+            }
+            function xE(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if (!(_A(a, b) | 0)) a = ((XA(a, b) | 0) == 0) & 1;
+              else a = 0;
+              return a | 0;
+            }
+            function yE(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              a = wA(a) | 0;
+              a: do
+                if (!a) a = 0;
+                else {
+                  d = (a + 8) | 0;
+                  e = c[d >> 2] | 0;
+                  b = (a + 12) | 0;
+                  a = nb[c[e >> 2] & 63](e, 0, 128) | 0;
+                  while (1) {
+                    if (!a) {
+                      a = 0;
+                      break a;
+                    }
+                    if ((c[((c[b >> 2] | 0) + (c[(a + 16) >> 2] << 2)) >> 2] | 0) != (c[(a + 12) >> 2] | 0)) {
+                      a = 1;
+                      break a;
+                    }
+                    e = c[d >> 2] | 0;
+                    a = nb[c[e >> 2] & 63](e, a, 8) | 0;
+                  }
+                }
+              while (0);
+              return a | 0;
+            }
+            function zE(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = rA(a, 0) | 0;
+              if (e)
+                if (
+                  (
+                    (AE(a, b, 111494, c[(e + 16) >> 2] | 0, d) | 0) != -1
+                      ? (AE(a, b, 111481, c[(e + 8) >> 2] | 0, d) | 0) != -1
+                      : 0
+                  )
+                    ? (AE(a, b, 111450, c[(e + 12) >> 2] | 0, d) | 0) != -1
+                    : 0
+                )
+                  f = 5;
+                else a = -1;
+              else f = 5;
+              if ((f | 0) == 5) a = 0;
+              return a | 0;
+            }
+            function AE(b, d, e, f, g) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              m = (g | 0) != 0;
+              if (m) l = 0;
+              else l = _z(f, 0) | 0;
+              k = (l | 0) == 0;
+              j = nb[c[f >> 2] & 63](f, 0, 128) | 0;
+              g = 0;
+              while (1) {
+                if (!j) {
+                  n = 23;
+                  break;
+                }
+                i = (j + 12) | 0;
+                n = c[i >> 2] | 0;
+                if ((n | 0) != 0 ? (a[n >> 0] | 0) != 0 : 0) n = 12;
+                else n = 7;
+                do
+                  if ((n | 0) == 7) {
+                    n = 0;
+                    if (!(a[(j + 22) >> 0] | 0)) {
+                      if (!k) {
+                        h = nb[c[l >> 2] & 63](l, j, 4) | 0;
+                        o = c[(h + 12) >> 2] | 0;
+                        if (o | 0 ? a[o >> 0] | 0 : 0) {
+                          n = 12;
+                          break;
+                        }
+                        if (!(a[(h + 22) >> 0] | 0)) n = 12;
+                      }
+                    } else n = 12;
+                  }
+                while (0);
+                if ((n | 0) == 12) {
+                  n = 0;
+                  h = (g + 1) | 0;
+                  if (g) {
+                    if ((jE(b, d, 97345) | 0) == -1) {
+                      g = -1;
+                      break;
+                    }
+                    if ((iE(b, d) | 0) == -1) {
+                      g = -1;
+                      break;
+                    }
+                  } else {
+                    if ((iE(b, d) | 0) == -1) {
+                      g = -1;
+                      break;
+                    }
+                    if ((jE(b, d, e) | 0) == -1) {
+                      g = -1;
+                      break;
+                    }
+                    if ((jE(b, d, 97342) | 0) == -1) {
+                      g = -1;
+                      break;
+                    }
+                    c[46987] = (c[46987] | 0) + 1;
+                  }
+                  if ((uE(b, d, c[(j + 8) >> 2] | 0) | 0) == -1) {
+                    g = -1;
+                    break;
+                  }
+                  if ((jE(b, d, 97348) | 0) == -1) {
+                    g = -1;
+                    break;
+                  }
+                  if ((uE(b, d, c[i >> 2] | 0) | 0) == -1) {
+                    g = -1;
+                    break;
+                  } else g = h;
+                }
+                j = nb[c[f >> 2] & 63](f, j, 8) | 0;
+              }
+              do
+                if ((n | 0) == 23) {
+                  if ((g | 0) > 0) {
+                    c[46987] = (c[46987] | 0) + -1;
+                    if ((g | 0) != 1) {
+                      if ((jE(b, d, 153599) | 0) == -1) {
+                        g = -1;
+                        break;
+                      }
+                      if ((iE(b, d) | 0) == -1) {
+                        g = -1;
+                        break;
+                      }
+                    }
+                    g = (jE(b, d, 97377) | 0) == -1;
+                    if (m | g) {
+                      g = (g << 31) >> 31;
+                      break;
+                    }
+                  } else if (m) {
+                    g = 0;
+                    break;
+                  }
+                  _z(f, l) | 0;
+                  g = 0;
+                }
+              while (0);
+              return g | 0;
+            }
+            function BE(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0;
+              switch (c[b >> 2] & 3) {
+                case 0: {
+                  g = 82;
+                  break;
+                }
+                case 1: {
+                  g = 83;
+                  break;
+                }
+                case 3:
+                case 2: {
+                  g = 84;
+                  break;
+                }
+                default: {
+                }
+              }
+              b = lb[g & 127](a, b) | 0;
+              if (!b) b = -1;
+              else {
+                FE(a, b, d, e, g, f);
+                b = 0;
+              }
+              return b | 0;
+            }
+            function CE(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if ((xC(b) | 0) != (a | 0)) b = mB(a, b, 0) | 0;
+              return b | 0;
+            }
+            function DE(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if ((xC(b) | 0) != (a | 0)) b = oC(a, b, 0) | 0;
+              return b | 0;
+            }
+            function EE(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return a | 0;
+            }
+            function FE(a, b, c, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0;
+              h = (f | 0) != 0;
+              if (h) vb[c & 127](a, b, d);
+              g = OD(a) | 0;
+              while (1) {
+                if (!g) break;
+                i = lb[e & 127](g, b) | 0;
+                if (i | 0) FE(g, i, c, d, e, f);
+                g = PD(g) | 0;
+              }
+              if (!h) vb[c & 127](a, b, d);
+              return;
+            }
+            function GE() {
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0;
+              t = l;
+              l = (l + 1200) | 0;
+              r = (t + 800) | 0;
+              g = t;
+              c[46990] = 0;
+              c[46991] = -2;
+              f = r;
+              i = 200;
+              n = g;
+              p = 0;
+              q = 0;
+              o = r;
+              a: while (1) {
+                b[o >> 1] = p;
+                if (((f + (i << 1) + -2) | 0) >>> 0 > o >>> 0) k = i;
+                else {
+                  m = (o - f) >> 1;
+                  e = (m + 1) | 0;
+                  if (i >>> 0 > 9999) {
+                    s = 75;
+                    break;
+                  }
+                  k = i << 1;
+                  k = k >>> 0 < 1e4 ? k : 1e4;
+                  h = T1((k * 6) | 3) | 0;
+                  if (h) {
+                    W6(h | 0, f | 0, (e << 1) | 0) | 0;
+                    i = (h + ((k >>> 1) << 2)) | 0;
+                    W6(i | 0, n | 0, (e << 2) | 0) | 0;
+                    if ((f | 0) == (r | 0)) {
+                      e = 0;
+                      f = h;
+                    } else {
+                      U1(f);
+                      e = 0;
+                      f = h;
+                    }
+                  } else {
+                    e = 4;
+                    i = n;
+                  }
+                  j = (e | 0) == 0;
+                  h = (f + (m << 1)) | 0;
+                  switch ((j ? (((f + (k << 1) + -2) | 0) >>> 0 > h >>> 0 ? 0 : 9) : e) & 15) {
+                    case 9: {
+                      e = 1;
+                      s = 76;
+                      break a;
+                    }
+                    case 4: {
+                      s = 75;
+                      break a;
+                    }
+                    case 0: {
+                      g = j ? (i + (m << 2)) | 0 : g;
+                      n = i;
+                      o = j ? h : o;
+                      break;
+                    }
+                    default: {
+                      e = 0;
+                      break a;
+                    }
+                  }
+                }
+                if ((p | 0) == 6) {
+                  e = 0;
+                  s = 76;
+                  break;
+                }
+                e = a[(97381 + p) >> 0] | 0;
+                j = (e << 24) >> 24;
+                do
+                  if ((e << 24) >> 24 != -18) {
+                    h = c[46991] | 0;
+                    if ((h | 0) == -2) {
+                      h = mD() | 0;
+                      c[46991] = h;
+                    }
+                    if ((h | 0) >= 1)
+                      if (h >>> 0 < 269) i = d[(97461 + h) >> 0] | 0;
+                      else i = 2;
+                    else {
+                      c[46991] = 0;
+                      i = 0;
+                    }
+                    h = (i + j) | 0;
+                    if (h >>> 0 <= 59 ? (i | 0) == (d[(97730 + h) >> 0] | 0) : 0) {
+                      p = a[(97790 + h) >> 0] | 0;
+                      e = (p << 24) >> 24;
+                      if ((p << 24) >> 24 < 1) {
+                        h = (0 - e) | 0;
+                        s = 23;
+                        break;
+                      } else {
+                        c[46991] = -2;
+                        g = (g + 4) | 0;
+                        c[g >> 2] = c[46992];
+                        j = (q | 0) == 0 ? 0 : (q + -1) | 0;
+                        h = o;
+                        break;
+                      }
+                    } else s = 22;
+                  } else s = 22;
+                while (0);
+                if ((s | 0) == 22) {
+                  s = 0;
+                  p = a[(97850 + p) >> 0] | 0;
+                  h = p & 255;
+                  if (!((p << 24) >> 24)) {
+                    h = c[46991] | 0;
+                    b: do
+                      switch (q | 0) {
+                        case 0: {
+                          c[46990] = (c[46990] | 0) + 1;
+                          HD(143761);
+                          h = o;
+                          break;
+                        }
+                        case 3:
+                          if ((h | 0) < 1)
+                            if (!h) {
+                              e = 1;
+                              s = 76;
+                              break a;
+                            } else {
+                              h = o;
+                              break b;
+                            }
+                          else {
+                            c[46991] = -2;
+                            h = o;
+                            break b;
+                          }
+                        default:
+                          h = o;
+                      }
+                    while (0);
+                    while (1) {
+                      if ((e << 24) >> 24 == 18) break;
+                      if ((h | 0) == (f | 0)) {
+                        e = 1;
+                        s = 76;
+                        break a;
+                      }
+                      e = (h + -2) | 0;
+                      g = (g + -4) | 0;
+                      h = e;
+                      e = a[(97381 + (b[e >> 1] | 0)) >> 0] | 0;
+                    }
+                    g = (g + 4) | 0;
+                    c[g >> 2] = c[46992];
+                    e = 1;
+                    j = 3;
+                  } else s = 23;
+                }
+                do
+                  if ((s | 0) == 23) {
+                    s = 0;
+                    i = d[(97930 + h) >> 0] | 0;
+                    e = c[(g + ((1 - i) << 2)) >> 2] | 0;
+                    c: do
+                      switch (h | 0) {
+                        case 2: {
+                          HE();
+                          IE();
+                          break;
+                        }
+                        case 3: {
+                          if (c[46993] | 0) {
+                            HE();
+                            IE();
+                            sB(c[46993] | 0) | 0;
+                            c[46942] = 0;
+                            c[46993] = 0;
+                          }
+                          break;
+                        }
+                        case 6: {
+                          JE(c[g >> 2] | 0, c[(g + -4) >> 2] | 0, c[(g + -8) >> 2] | 0);
+                          break;
+                        }
+                        case 7: {
+                          e = c[g >> 2] | 0;
+                          break;
+                        }
+                        case 8: {
+                          e = 0;
+                          break;
+                        }
+                        case 9: {
+                          e = 1;
+                          break;
+                        }
+                        case 10: {
+                          e = 0;
+                          break;
+                        }
+                        case 11: {
+                          e = 0;
+                          break;
+                        }
+                        case 12: {
+                          e = 1;
+                          break;
+                        }
+                        case 21:
+                          if (!(c[(g + -4) >> 2] | 0)) {
+                            LE();
+                            break c;
+                          } else {
+                            KE();
+                            break c;
+                          }
+                        case 24: {
+                          ME();
+                          break;
+                        }
+                        case 25: {
+                          ME();
+                          break;
+                        }
+                        case 26: {
+                          e = 1;
+                          break;
+                        }
+                        case 27: {
+                          e = 0;
+                          break;
+                        }
+                        case 30: {
+                          NE(c[g >> 2] | 0, 0, 0);
+                          break;
+                        }
+                        case 31: {
+                          NE(c[(g + -8) >> 2] | 0, c[g >> 2] | 0, 0);
+                          break;
+                        }
+                        case 32: {
+                          NE(c[(g + -16) >> 2] | 0, c[(g + -8) >> 2] | 0, c[g >> 2] | 0);
+                          break;
+                        }
+                        case 33: {
+                          OE(c[(g + -8) >> 2] | 0, c[(g + -4) >> 2] | 0);
+                          break;
+                        }
+                        case 34: {
+                          OE(258, 0);
+                          break;
+                        }
+                        case 35: {
+                          e = 258;
+                          break;
+                        }
+                        case 36: {
+                          e = 259;
+                          break;
+                        }
+                        case 37: {
+                          e = 260;
+                          break;
+                        }
+                        case 38: {
+                          e = c[(g + -4) >> 2] | 0;
+                          break;
+                        }
+                        case 39: {
+                          e = 0;
+                          break;
+                        }
+                        case 48: {
+                          PE(c[(g + -8) >> 2] | 0, c[g >> 2] | 0);
+                          break;
+                        }
+                        case 49: {
+                          PE(c[g >> 2] | 0, 0);
+                          break;
+                        }
+                        case 51: {
+                          QE(c[g >> 2] | 0);
+                          break;
+                        }
+                        case 52: {
+                          RE();
+                          break;
+                        }
+                        case 53: {
+                          e = c[g >> 2] | 0;
+                          break;
+                        }
+                        case 54: {
+                          e = 0;
+                          break;
+                        }
+                        case 55: {
+                          e = 0;
+                          break;
+                        }
+                        case 59: {
+                          e = c[g >> 2] | 0;
+                          break;
+                        }
+                        case 60: {
+                          e = c[g >> 2] | 0;
+                          break;
+                        }
+                        case 61: {
+                          e = c[g >> 2] | 0;
+                          break;
+                        }
+                        case 62: {
+                          e = SE(c[(g + -8) >> 2] | 0, c[g >> 2] | 0) | 0;
+                          break;
+                        }
+                        default: {
+                        }
+                      }
+                    while (0);
+                    i = (0 - i) | 0;
+                    p = (g + (i << 2)) | 0;
+                    i = (o + (i << 1)) | 0;
+                    g = (p + 4) | 0;
+                    c[(p + 4) >> 2] = e;
+                    e = ((d[(97993 + h) >> 0] | 0) + -24) | 0;
+                    p = b[i >> 1] | 0;
+                    h = (p + (a[(98056 + e) >> 0] | 0)) | 0;
+                    if (h >>> 0 < 60 ? (d[(97730 + h) >> 0] | 0) == (p | 0) : 0) {
+                      e = a[(97790 + h) >> 0] | 0;
+                      j = q;
+                      h = i;
+                      break;
+                    }
+                    e = a[(98091 + e) >> 0] | 0;
+                    j = q;
+                    h = i;
+                  }
+                while (0);
+                i = k;
+                p = e;
+                q = j;
+                o = (h + 2) | 0;
+              }
+              if ((s | 0) == 75) {
+                HD(140558);
+                e = 2;
+                s = 76;
+              }
+              if ((s | 0) == 76) if ((f | 0) != (r | 0)) U1(f);
+              l = t;
+              return e | 0;
+            }
+            function HE() {
+              var a = 0,
+                b = 0;
+              a = c[46994] | 0;
+              while (1) {
+                if (!a) break;
+                _E((a + 8) | 0);
+                _E(((c[46994] | 0) + 24) | 0);
+                _E(((c[46994] | 0) + 16) | 0);
+                b = TE(c[46994] | 0) | 0;
+                c[46994] = b;
+                a = b;
+              }
+              return;
+            }
+            function IE() {
+              ID();
+              TB(c[46993] | 0);
+              return;
+            }
+            function JE(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 16) | 0;
+              g = h;
+              f = c[46993] | 0;
+              if (!f) {
+                a[187980] = (d & 1) | (((e & 255) << 1) & 2) | (a[187980] & -12) | 8;
+                f = c[46996] | 0;
+                a[g >> 0] = a[187980] | 0;
+                a[(g + 1) >> 0] = a[187981] | 0;
+                a[(g + 2) >> 0] = a[187982] | 0;
+                a[(g + 3) >> 0] = a[187983] | 0;
+                f = oB(b, g, f) | 0;
+                c[46993] = f;
+              }
+              c[46942] = f;
+              c[46994] = UE(c[46994] | 0, f) | 0;
+              hD(0, b) | 0;
+              l = h;
+              return;
+            }
+            function KE() {
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              ZE(2);
+              e = c[46994] | 0;
+              f = a[98126] | 0;
+              h = 0;
+              b = (e + 24) | 0;
+              while (1) {
+                d = c[b >> 2] | 0;
+                if (!d) break;
+                if (
+                  ((c[d >> 2] | 0) == 267 ? ((g = c[(d + 4) >> 2] | 0), (a[g >> 0] | 0) == (f << 24) >> 24) : 0)
+                    ? (s2(g, 98126) | 0) == 0
+                    : 0
+                )
+                  b = c[(d + 8) >> 2] | 0;
+                else b = h;
+                h = b;
+                b = (d + 12) | 0;
+              }
+              b = (e + 16) | 0;
+              a: while (1) {
+                e = c[b >> 2] | 0;
+                b = (e + 12) | 0;
+                if (!(c[b >> 2] | 0)) break;
+                d = (e + 4) | 0;
+                if ((c[e >> 2] | 0) == 262) {
+                  e = c[d >> 2] | 0;
+                  d = jC(e) | 0;
+                  while (1) {
+                    if (!d) continue a;
+                    g = oC(c[c[46994] >> 2] | 0, d, 0) | 0;
+                    fF(g, 0, c[b >> 2] | 0, h);
+                    d = kC(e, d) | 0;
+                  }
+                } else
+                  while (1) {
+                    d = c[d >> 2] | 0;
+                    if (!d) continue a;
+                    fF(c[(d + 4) >> 2] | 0, c[(d + 8) >> 2] | 0, c[b >> 2] | 0, h);
+                    d = (d + 12) | 0;
+                  }
+              }
+              _E(((c[46994] | 0) + 8) | 0);
+              _E(((c[46994] | 0) + 16) | 0);
+              _E(((c[46994] | 0) + 24) | 0);
+              c[((c[46994] | 0) + 4) >> 2] = 0;
+              return;
+            }
+            function LE() {
+              var a = 0;
+              ZE(1);
+              a = ((c[46994] | 0) + 8) | 0;
+              while (1) {
+                a = c[a >> 2] | 0;
+                if (!a) break;
+                eF(c[(a + 4) >> 2] | 0);
+                a = (a + 12) | 0;
+              }
+              _E(((c[46994] | 0) + 8) | 0);
+              _E(((c[46994] | 0) + 24) | 0);
+              _E(((c[46994] | 0) + 16) | 0);
+              c[((c[46994] | 0) + 4) >> 2] = 0;
+              return;
+            }
+            function ME() {
+              var a = 0,
+                b = 0;
+              a = c[46994] | 0;
+              b = c[(a + 8) >> 2] | 0;
+              if (!b) {
+                b = c[(a + 4) >> 2] | 0;
+                if (!b) b = 0;
+                else {
+                  b = dF(b) | 0;
+                  a = c[46994] | 0;
+                }
+                c[(a + 4) >> 2] = 0;
+              } else {
+                b = cF(b) | 0;
+                a = c[46994] | 0;
+                c[(a + 12) >> 2] = 0;
+                c[(a + 8) >> 2] = 0;
+              }
+              if (b | 0) WE((a + 16) | 0, b);
+              return;
+            }
+            function NE(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              if (d) b = aF(b, d) | 0;
+              d = bF(tC(c[c[46994] >> 2] | 0, a, 1) | 0, b) | 0;
+              WE(((c[46994] | 0) + 8) | 0, d);
+              hD(c[46993] | 0, a) | 0;
+              return;
+            }
+            function OE(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              if (d | 0) YE();
+              d = ((c[46994] | 0) + 24) | 0;
+              while (1) {
+                d = c[d >> 2] | 0;
+                if (!d) break;
+                if (!(c[(d + 8) >> 2] | 0)) YE();
+                d = (d + 12) | 0;
+              }
+              g = (b | 0) == 260 ? 2 : ((b | 0) == 259) & 1;
+              ZE(g);
+              b = c[46994] | 0;
+              d = (b + 24) | 0;
+              while (1) {
+                f = c[d >> 2] | 0;
+                if (!f) break;
+                do
+                  if ((c[f >> 2] | 0) != 267) {
+                    d = c[(f + 4) >> 2] | 0;
+                    e = c[b >> 2] | 0;
+                    if (!(((a[(d + 21) >> 0] | 0) != 0) & ((e | 0) == (c[46993] | 0)))) {
+                      d = GA(e, g, c[(d + 8) >> 2] | 0, c[(f + 8) >> 2] | 0) | 0;
+                      b = c[46994] | 0;
+                      if ((c[b >> 2] | 0) != (c[46993] | 0)) break;
+                    }
+                    a[(d + 22) >> 0] = 1;
+                  }
+                while (0);
+                d = (f + 12) | 0;
+              }
+              _E((b + 24) | 0);
+              return;
+            }
+            function PE(a, b) {
+              a = a | 0;
+              b = b | 0;
+              b = VE(a, b) | 0;
+              WE(((c[46994] | 0) + 24) | 0, b);
+              return;
+            }
+            function QE(a) {
+              a = a | 0;
+              var b = 0;
+              b = c[46994] | 0;
+              c[46994] = UE(b, ND(c[b >> 2] | 0, a, 1) | 0) | 0;
+              hD(c[46993] | 0, a) | 0;
+              return;
+            }
+            function RE() {
+              var a = 0,
+                b = 0;
+              a = c[46994] | 0;
+              b = c[a >> 2] | 0;
+              a = TE(a) | 0;
+              c[46994] = a;
+              c[(a + 4) >> 2] = b;
+              return;
+            }
+            function SE(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              g = l;
+              l = (l + 1024) | 0;
+              f = g;
+              d = l2(a) | 0;
+              d = (d + 1 + (l2(b) | 0)) | 0;
+              if (d >>> 0 < 1025) d = f;
+              else d = T1(d) | 0;
+              r3(d, a) | 0;
+              F4(d, b) | 0;
+              e = fD(c[46993] | 0, d) | 0;
+              hD(c[46993] | 0, a) | 0;
+              hD(c[46993] | 0, b) | 0;
+              if ((d | 0) != (f | 0)) U1(d);
+              l = g;
+              return e | 0;
+            }
+            function TE(a) {
+              a = a | 0;
+              var b = 0;
+              b = c[((c[46994] | 0) + 32) >> 2] | 0;
+              eC(c[46993] | 0, a);
+              return b | 0;
+            }
+            function UE(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = dC(c[46993] | 0, 36) | 0;
+              c[(d + 32) >> 2] = a;
+              c[d >> 2] = b;
+              return d | 0;
+            }
+            function VE(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return XE(267, a, b) | 0;
+            }
+            function WE(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = (a + 4) | 0;
+              e = c[d >> 2] | 0;
+              if (e | 0) c[(e + 12) >> 2] = b;
+              c[d >> 2] = b;
+              if (!(c[a >> 2] | 0)) c[a >> 2] = b;
+              return;
+            }
+            function XE(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              e = dC(c[46993] | 0, 16) | 0;
+              c[e >> 2] = a;
+              c[(e + 4) >> 2] = b;
+              c[(e + 8) >> 2] = d;
+              return e | 0;
+            }
+            function YE() {
+              var a = 0;
+              a = l;
+              l = (l + 16) | 0;
+              gA(0, 98130, a) | 0;
+              l = a;
+              return;
+            }
+            function ZE(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              g = (b | 0) == 2;
+              d = ((c[46994] | 0) + 24) | 0;
+              while (1) {
+                d = c[d >> 2] | 0;
+                if (!d) break;
+                e = (d + 4) | 0;
+                f = c[e >> 2] | 0;
+                if (!((g ? (a[f >> 0] | 0) == (a[98126] | 0) : 0) ? !(s2(f, 98126) | 0) : 0)) {
+                  h = GA(c[c[46994] >> 2] | 0, b, f, 0) | 0;
+                  c[e >> 2] = h;
+                  if (!h) c[e >> 2] = GA(c[c[46994] >> 2] | 0, b, f, 195059) | 0;
+                  c[d >> 2] = 266;
+                  hD(c[46993] | 0, f) | 0;
+                }
+                d = (d + 12) | 0;
+              }
+              return;
+            }
+            function _E(a) {
+              a = a | 0;
+              $E(c[a >> 2] | 0);
+              c[(a + 4) >> 2] = 0;
+              c[a >> 2] = 0;
+              return;
+            }
+            function $E(a) {
+              a = a | 0;
+              var b = 0;
+              while (1) {
+                if (!a) break;
+                b = c[(a + 12) >> 2] | 0;
+                switch (c[a >> 2] | 0) {
+                  case 265: {
+                    $E(c[(a + 4) >> 2] | 0);
+                    break;
+                  }
+                  case 266:
+                  case 267: {
+                    hD(c[46993] | 0, c[(a + 8) >> 2] | 0) | 0;
+                    break;
+                  }
+                  default: {
+                  }
+                }
+                eC(c[46993] | 0, a);
+                a = b;
+              }
+              return;
+            }
+            function aF(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 1040) | 0;
+              f = h;
+              g = (h + 8) | 0;
+              d = l2(a) | 0;
+              d = (d + 2 + (l2(b) | 0)) | 0;
+              if (d >>> 0 < 1025) e = g;
+              else e = T1(d) | 0;
+              c[f >> 2] = a;
+              c[(f + 4) >> 2] = b;
+              m4(e, 98163, f) | 0;
+              d = fD(c[46993] | 0, e) | 0;
+              hD(c[46993] | 0, a) | 0;
+              hD(c[46993] | 0, b) | 0;
+              if ((e | 0) != (g | 0)) U1(e);
+              l = h;
+              return d | 0;
+            }
+            function bF(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return XE(259, a, b) | 0;
+            }
+            function cF(a) {
+              a = a | 0;
+              return XE(265, a, 0) | 0;
+            }
+            function dF(a) {
+              a = a | 0;
+              return XE(262, a, 0) | 0;
+            }
+            function eF(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = ((c[46994] | 0) + 24) | 0;
+              while (1) {
+                b = c[b >> 2] | 0;
+                if (!b) break;
+                if ((c[b >> 2] | 0) == 266 ? ((d = c[(b + 4) >> 2] | 0), d | 0) : 0) KA(a, d, c[(b + 8) >> 2] | 0) | 0;
+                b = (b + 12) | 0;
+              }
+              return;
+            }
+            function fF(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0;
+              f = (d + 4) | 0;
+              a: do
+                if ((c[d >> 2] | 0) == 262) {
+                  d = c[f >> 2] | 0;
+                  f = jC(d) | 0;
+                  while (1) {
+                    if (!f) break a;
+                    gF(a, b, oC(c[c[46994] >> 2] | 0, f, 0) | 0, 0, e);
+                    f = kC(d, f) | 0;
+                  }
+                } else
+                  while (1) {
+                    f = c[f >> 2] | 0;
+                    if (!f) break a;
+                    d = oC(c[c[46994] >> 2] | 0, c[(f + 4) >> 2] | 0, 0) | 0;
+                    gF(a, b, d, c[(f + 8) >> 2] | 0, e);
+                    f = (f + 12) | 0;
+                  }
+              while (0);
+              return;
+            }
+            function gF(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0;
+              d = iB(c[c[46994] >> 2] | 0, a, d, f, 1) | 0;
+              if (d | 0) {
+                g = c[d >> 2] & 3;
+                f = c[(((g | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0;
+                a = (f | 0) == (a | 0) ? (c[(((g | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0) != (f | 0) : 0;
+                hF(d, 111455, a ? e : b);
+                hF(d, 111464, a ? b : e);
+                eF(d);
+              }
+              return;
+            }
+            function hF(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              if (d | 0) {
+                e = GA(c[c[46994] >> 2] | 0, 2, b, 0) | 0;
+                if (!e) e = GA(c[c[46994] >> 2] | 0, 2, b, 195059) | 0;
+                KA(a, e, d) | 0;
+              }
+              return;
+            }
+            function iF(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              c[46962] = b;
+              c[46993] = a;
+              c[46942] = 0;
+              a = d | 0 ? d : 18600;
+              c[46996] = a;
+              lD(a, b);
+              GE() | 0;
+              a = c[46942] | 0;
+              if (!a) {
+                KD();
+                a = c[46942] | 0;
+              }
+              return a | 0;
+            }
+            function jF(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return iF(0, a, b) | 0;
+            }
+            function kF(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 16) | 0;
+              j = (k + 8) | 0;
+              i = k;
+              d = c[(b + 76) >> 2] | 0;
+              f = c[b >> 2] | 0;
+              if ((d | 0) != 0 ? ((e = c[d >> 2] | 0), (e | 0) != 0) : 0) {
+                tb[e & 127](b);
+                g = 12;
+              } else g = 4;
+              do
+                if ((g | 0) == 4)
+                  if ((c[(b + 40) >> 2] | 0) == 0 ? ((h = (b + 36) | 0), (c[h >> 2] | 0) == 0) : 0) {
+                    if (a[(f + 13) >> 0] | 0) lF(b);
+                    d = (b + 32) | 0;
+                    e = c[d >> 2] | 0;
+                    if (!e) {
+                      c[h >> 2] = c[15679];
+                      g = 12;
+                      break;
+                    }
+                    f = $4(e, 106512) | 0;
+                    c[h >> 2] = f;
+                    if (!f) {
+                      j = c[((c[(b + 12) >> 2] | 0) + 16) >> 2] | 0;
+                      h = c[d >> 2] | 0;
+                      d = t2(c[(d2() | 0) >> 2] | 0) | 0;
+                      c[i >> 2] = h;
+                      c[(i + 4) >> 2] = d;
+                      ub[j & 63](98169, i);
+                      d = 1;
+                    } else g = 12;
+                  } else g = 12;
+              while (0);
+              if ((g | 0) == 12)
+                if (!(c[(b + 152) >> 2] & 1024)) d = 0;
+                else {
+                  ub[c[((c[(b + 12) >> 2] | 0) + 16) >> 2] & 63](98207, j);
+                  d = 1;
+                }
+              l = k;
+              return d | 0;
+            }
+            function lF(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              h = l;
+              l = (l + 112) | 0;
+              e = h;
+              g = (h + 4) | 0;
+              d = c[(b + 24) >> 2] | 0;
+              if (!d) a[g >> 0] = 0;
+              else {
+                c[e >> 2] = d + 1;
+                m4(g, 98225, e) | 0;
+              }
+              e = c[(b + 20) >> 2] | 0;
+              e = e | 0 ? e : 98229;
+              d = l2(e) | 0;
+              i = l2(g) | 0;
+              f = (b + 52) | 0;
+              i = (d + 1 + i + (l2(c[f >> 2] | 0) | 0)) | 0;
+              d = (i + 11) | 0;
+              if ((c[46997] | 0) >>> 0 < ((i + 1) | 0) >>> 0) {
+                c[46997] = d;
+                d = W1(c[46998] | 0, d) | 0;
+                c[46998] = d;
+              } else d = c[46998] | 0;
+              r3(d, e) | 0;
+              F4(c[46998] | 0, g) | 0;
+              d = c[46998] | 0;
+              d = (d + (l2(d) | 0)) | 0;
+              a[d >> 0] = 46;
+              a[(d + 1) >> 0] = 0;
+              d = D4(c[f >> 2] | 0) | 0;
+              f = c[46998] | 0;
+              while (1) {
+                e = E4(d, 58) | 0;
+                if (!e) break;
+                F4(f, (e + 1) | 0) | 0;
+                i = c[46998] | 0;
+                g = (i + (l2(i) | 0)) | 0;
+                a[g >> 0] = 46;
+                a[(g + 1) >> 0] = 0;
+                a[e >> 0] = 0;
+                f = i;
+              }
+              F4(f, d) | 0;
+              U1(d);
+              c[(b + 32) >> 2] = c[46998];
+              l = h;
+              return;
+            }
+            function mF(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 16) | 0;
+              g = (h + 8) | 0;
+              f = h;
+              if (((b | 0) != 0) & ((d | 0) != 0)) {
+                if ((c[(a + 152) >> 2] & 1024) | 0) {
+                  ub[c[((c[(a + 12) >> 2] | 0) + 16) >> 2] & 63](98207, f);
+                  Sa(1);
+                }
+                if ((nF(a, b, d) | 0) == (d | 0)) e = d;
+                else {
+                  f = c[((c[(a + 12) >> 2] | 0) + 16) >> 2] | 0;
+                  c[g >> 2] = d;
+                  ub[f & 63](98239, g);
+                  Sa(1);
+                }
+              } else e = 0;
+              l = h;
+              return e | 0;
+            }
+            function nF(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              o = l;
+              l = (l + 16) | 0;
+              n = o;
+              f = c[((c[b >> 2] | 0) + 104) >> 2] | 0;
+              do
+                if (!f) {
+                  j = (b + 40) | 0;
+                  h = c[j >> 2] | 0;
+                  if (!h) {
+                    e = U4(d, 1, e, c[(b + 36) >> 2] | 0) | 0;
+                    break;
+                  }
+                  f = (b + 44) | 0;
+                  i = (b + 48) | 0;
+                  g = c[i >> 2] | 0;
+                  do
+                    if ((((c[f >> 2] | 0) + -1 - g) | 0) >>> 0 < e >>> 0) {
+                      g = (e + 4096 + g) & -4096;
+                      c[f >> 2] = g;
+                      f = W1(h, g) | 0;
+                      c[j >> 2] = f;
+                      if (!f) {
+                        ub[c[((c[(b + 12) >> 2] | 0) + 16) >> 2] & 63](98264, n);
+                        Sa(1);
+                      } else {
+                        k = f;
+                        m = c[i >> 2] | 0;
+                        break;
+                      }
+                    } else {
+                      k = h;
+                      m = g;
+                    }
+                  while (0);
+                  W6((k + m) | 0, d | 0, e | 0) | 0;
+                  n = ((c[i >> 2] | 0) + e) | 0;
+                  c[i >> 2] = n;
+                  a[((c[j >> 2] | 0) + n) >> 0] = 0;
+                } else e = nb[f & 63](b, d, e) | 0;
+              while (0);
+              l = o;
+              return e | 0;
+            }
+            function oF(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0;
+              c = l2(b) | 0;
+              b = (mF(a, b, c) | 0) == (c | 0);
+              return (b ? 1 : -1) | 0;
+            }
+            function pF(b, c) {
+              b = b | 0;
+              c = c | 0;
+              var d = 0,
+                e = 0;
+              d = l;
+              l = (l + 16) | 0;
+              e = d;
+              a[e >> 0] = c;
+              b = (mF(b, e, 1) | 0) == 1;
+              l = d;
+              return (b ? c : -1) | 0;
+            }
+            function qF(b) {
+              b = b | 0;
+              var d = 0;
+              d = c[(b + 36) >> 2] | 0;
+              if (((d | 0) != 0 ? (a[(b + 144) >> 0] | 0) == 0 : 0) ? (c[((c[b >> 2] | 0) + 104) >> 2] | 0) == 0 : 0)
+                b = M4(d) | 0;
+              else b = 0;
+              return b | 0;
+            }
+            function rF(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = c[(a + 76) >> 2] | 0;
+              if (b | 0 ? ((d = c[(b + 4) >> 2] | 0), d | 0) : 0) tb[d & 127](a);
+              qF(a) | 0;
+              return;
+            }
+            function sF(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              e = l;
+              l = (l + 16) | 0;
+              d = c[(a + 76) >> 2] | 0;
+              if ((c[(a + 152) >> 2] & 1024) | 0) {
+                ub[c[((c[(a + 12) >> 2] | 0) + 16) >> 2] & 63](98291, e);
+                Sa(1);
+              }
+              if ((d | 0) != 0 ? ((b = c[(d + 8) >> 2] | 0), (b | 0) != 0) : 0) tb[b & 127](a);
+              else {
+                qF(a) | 0;
+                tF(a);
+              }
+              l = e;
+              return;
+            }
+            function tF(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              d = (b + 32) | 0;
+              if (
+                (c[d >> 2] | 0 ? ((e = (b + 36) | 0), (f = c[e >> 2] | 0), (f | 0) != (c[15679] | 0)) : 0)
+                  ? (a[(b + 144) >> 0] | 0) == 0
+                  : 0
+              ) {
+                if (f | 0) {
+                  I4(f) | 0;
+                  c[e >> 2] = 0;
+                }
+                c[d >> 2] = 0;
+              }
+              return;
+            }
+            function uF(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 1056) | 0;
+              f = i;
+              h = (i + 24) | 0;
+              g = (i + 8) | 0;
+              c[g >> 2] = d;
+              e = G3(h, 1024, b, g) | 0;
+              if ((e | 0) >= 0) {
+                if ((e | 0) > 1023) {
+                  e = KK((e + 1) | 0) | 0;
+                  c[g >> 2] = d;
+                  f = e;
+                  e = n4(e, b, g) | 0;
+                } else f = h;
+                mF(a, f, e) | 0;
+                if ((f | 0) != (h | 0)) U1(f);
+              } else {
+                c[f >> 2] = t2(c[(d2() | 0) >> 2] | 0) | 0;
+                gA(1, 98308, f) | 0;
+              }
+              l = i;
+              return;
+            }
+            function vF(a, b) {
+              a = a | 0;
+              b = +b;
+              var d = 0,
+                e = 0,
+                f = 0;
+              d = l;
+              l = (l + 16) | 0;
+              e = d;
+              f = wF(e, b) | 0;
+              mF(a, f, c[e >> 2] | 0) | 0;
+              l = d;
+              return;
+            }
+            function wF(b, d) {
+              b = b | 0;
+              d = +d;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              if (!(d < -1.0e15))
+                if (!(d > 1.0e15)) {
+                  d = d * 1.0e4;
+                  f = ~~((d < 0.0 ? -0.5 : 0.5) + d);
+                  if (!f) {
+                    f = 138394;
+                    e = 1;
+                  } else {
+                    l = (f | 0) < 0;
+                    k = 4;
+                    i = 0;
+                    e = 194826;
+                    f = l ? (0 - f) | 0 : f;
+                    while (1) {
+                      if (!(((f | 0) != 0) | ((k | 0) > 0))) break;
+                      g = (f | 0) % 10 | 0;
+                      j = ((f | 0) / 10) | 0;
+                      h = (e + -1) | 0;
+                      if (((g | 0) == 0) & ((i << 24) >> 24 == 0)) f = 0;
+                      else {
+                        a[h >> 0] = g | 48;
+                        f = 1;
+                        e = h;
+                      }
+                      if ((k | 0) == 1)
+                        if (!((f << 24) >> 24)) f = 1;
+                        else {
+                          e = (e + -1) | 0;
+                          a[e >> 0] = 46;
+                          f = 1;
+                        }
+                      k = (k + -1) | 0;
+                      i = f;
+                      f = j;
+                    }
+                    if (l) {
+                      e = (e + -1) | 0;
+                      a[e >> 0] = 45;
+                    }
+                    f = e;
+                    e = (194826 - e) | 0;
+                  }
+                } else {
+                  f = 98323;
+                  e = 18;
+                }
+              else {
+                f = 98322;
+                e = 19;
+              }
+              c[b >> 2] = e;
+              return f | 0;
+            }
+            function xF(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              d = l;
+              l = (l + 16) | 0;
+              e = d;
+              f = wF(e, +h[b >> 3]) | 0;
+              mF(a, f, c[e >> 2] | 0) | 0;
+              mF(a, 102604, 1) | 0;
+              b = wF(e, +h[(b + 8) >> 3]) | 0;
+              mF(a, b, c[e >> 2] | 0) | 0;
+              l = d;
+              return;
+            }
+            function yF(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              g = l;
+              l = (l + 16) | 0;
+              f = g;
+              e = 0;
+              while (1) {
+                h = (b + (e << 4)) | 0;
+                c[f >> 2] = c[h >> 2];
+                c[(f + 4) >> 2] = c[(h + 4) >> 2];
+                c[(f + 8) >> 2] = c[(h + 8) >> 2];
+                c[(f + 12) >> 2] = c[(h + 12) >> 2];
+                xF(a, f);
+                e = (e + 1) | 0;
+                if ((e | 0) >= (d | 0)) break;
+                mF(a, 102604, 1) | 0;
+              }
+              l = g;
+              return;
+            }
+            function zF(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = JK(392) | 0;
+              if (d | 0) {
+                c[d >> 2] = 20156;
+                c[(d + 16) >> 2] = 23;
+                c[(d + 32) >> 2] = a;
+                c[(d + 36) >> 2] = b;
+              }
+              return d | 0;
+            }
+            function AF(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              b = JK(392) | 0;
+              d = b;
+              e = a;
+              f = (d + 40) | 0;
+              do {
+                c[d >> 2] = c[e >> 2];
+                d = (d + 4) | 0;
+                e = (e + 4) | 0;
+              } while ((d | 0) < (f | 0));
+              f = (b + 60) | 0;
+              e = (a + 60) | 0;
+              c[f >> 2] = c[e >> 2];
+              c[(f + 4) >> 2] = c[(e + 4) >> 2];
+              c[(f + 8) >> 2] = c[(e + 8) >> 2];
+              c[(f + 12) >> 2] = c[(e + 12) >> 2];
+              c[(f + 16) >> 2] = c[(e + 16) >> 2];
+              f = (b + 80) | 0;
+              e = (a + 80) | 0;
+              c[f >> 2] = c[e >> 2];
+              c[(f + 4) >> 2] = c[(e + 4) >> 2];
+              c[(f + 8) >> 2] = c[(e + 8) >> 2];
+              c[(f + 12) >> 2] = c[(e + 12) >> 2];
+              c[(f + 16) >> 2] = c[(e + 16) >> 2];
+              return b | 0;
+            }
+            function BF(a) {
+              a = a | 0;
+              IF(a);
+              U1(a);
+              return;
+            }
+            function CF(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              e = (a + 160) | 0;
+              d = c[e >> 2] | 0;
+              if (d) {
+                e = c[46999] | 0;
+                if (e) {
+                  d = c[(e + 4) >> 2] | 0;
+                  if (!d) {
+                    d = JK(632) | 0;
+                    c[((c[46999] | 0) + 4) >> 2] = d;
+                  }
+                }
+              } else {
+                d = JK(632) | 0;
+                c[e >> 2] = d;
+                c[(a + 164) >> 2] = d;
+              }
+              c[46999] = d;
+              c[(d + 32) >> 2] = b;
+              c[d >> 2] = a;
+              return;
+            }
+            function DF(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              e = (a + 160) | 0;
+              d = c[e >> 2] | 0;
+              if (d) {
+                e = c[47e3] | 0;
+                if (e) {
+                  d = c[(e + 4) >> 2] | 0;
+                  if (!d) {
+                    d = JK(632) | 0;
+                    c[((c[47e3] | 0) + 4) >> 2] = d;
+                  }
+                }
+              } else {
+                d = JK(632) | 0;
+                c[e >> 2] = d;
+                c[(a + 164) >> 2] = d;
+              }
+              c[47e3] = d;
+              c[(d + 52) >> 2] = b;
+              c[d >> 2] = a;
+              return ((LF(a, 3, b) | 0) != 0) | 0;
+            }
+            function EF(a) {
+              a = a | 0;
+              var b = 0;
+              b = c[(a + 160) >> 2] | 0;
+              c[(a + 164) >> 2] = b;
+              return b | 0;
+            }
+            function FF(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              a = (a + 164) | 0;
+              b = c[a >> 2] | 0;
+              d = c[(b + 4) >> 2] | 0;
+              if (d | 0 ? ((e = (d + 52) | 0), (c[e >> 2] | 0) == 0) : 0) c[e >> 2] = c[(b + 52) >> 2];
+              c[a >> 2] = d;
+              return d | 0;
+            }
+            function GF(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = (a + 8) | 0;
+              f = (b + 10) | 0;
+              if ((c[e >> 2] | 0) > (b | 0)) a = c[a >> 2] | 0;
+              else {
+                c[e >> 2] = f;
+                f = MK(c[a >> 2] | 0, f << 2) | 0;
+                c[a >> 2] = f;
+                a = f;
+              }
+              c[(a + (b << 2)) >> 2] = d;
+              return;
+            }
+            function HF(a) {
+              a = a | 0;
+              var b = 0;
+              b = c[a >> 2] | 0;
+              if (b | 0) U1(b);
+              c[a >> 2] = 0;
+              c[(a + 8) >> 2] = 0;
+              c[(a + 4) >> 2] = 0;
+              return;
+            }
+            function IF(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              d = (a + 160) | 0;
+              b = c[d >> 2] | 0;
+              while (1) {
+                if (!b) break;
+                e = c[(b + 4) >> 2] | 0;
+                HF((b + 604) | 0);
+                HF((b + 592) | 0);
+                U1(c[(b + 584) >> 2] | 0);
+                U1(c[(b + 588) >> 2] | 0);
+                U1(b);
+                b = e;
+              }
+              c[47e3] = 0;
+              c[46999] = 0;
+              c[(a + 192) >> 2] = 0;
+              c[(a + 164) >> 2] = 0;
+              c[d >> 2] = 0;
+              c[(a + 28) >> 2] = 0;
+              return;
+            }
+            function JF(b, d, e, f, g, h) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              n = l;
+              l = (l + 128) | 0;
+              k = (n + 64) | 0;
+              m = n;
+              i4(k, e, 63) | 0;
+              i = R2(k, 58) | 0;
+              if (i | 0) a[i >> 0] = 0;
+              b = (b + 60 + (d << 2)) | 0;
+              while (1) {
+                d = c[b >> 2] | 0;
+                if (!d) {
+                  d = b;
+                  b = 0;
+                  break;
+                }
+                i4(m, c[(d + 4) >> 2] | 0, 63) | 0;
+                d = R2(m, 58) | 0;
+                if (d | 0) a[d >> 0] = 0;
+                if ((s2(k, m) | 0) < 1) {
+                  j = 9;
+                  break;
+                }
+                b = c[b >> 2] | 0;
+              }
+              while (1) {
+                if ((j | 0) == 9) {
+                  d = b;
+                  b = c[b >> 2] | 0;
+                }
+                if (!b) break;
+                i4(m, c[(b + 4) >> 2] | 0, 63) | 0;
+                b = R2(m, 58) | 0;
+                if (b | 0) a[b >> 0] = 0;
+                if (s2(k, m) | 0) break;
+                b = c[d >> 2] | 0;
+                if ((c[(b + 8) >> 2] | 0) <= (f | 0)) break;
+                j = 9;
+              }
+              m = KK(20) | 0;
+              c[m >> 2] = c[d >> 2];
+              c[d >> 2] = m;
+              c[(m + 4) >> 2] = e;
+              c[(m + 8) >> 2] = f;
+              c[(m + 12) >> 2] = g;
+              c[(m + 16) >> 2] = h;
+              l = n;
+              return 1;
+            }
+            function KF(a, b) {
+              a = a | 0;
+              b = b | 0;
+              b = l;
+              l = (l + 16) | 0;
+              gA(1, 98396, b) | 0;
+              l = b;
+              return 0;
+            }
+            function LF(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0;
+              s = l;
+              l = (l + 144) | 0;
+              r = s;
+              o = (s + 80) | 0;
+              p = (s + 16) | 0;
+              n = ((d + -3) | 0) >>> 0 < 2 ? 0 : d;
+              i4(o, e, 63) | 0;
+              e = R2(o, 58) | 0;
+              if (e) {
+                f = (e + 1) | 0;
+                a[e >> 0] = 0;
+                e = R2(f, 58) | 0;
+                if (!e) m = 0;
+                else {
+                  a[e >> 0] = 0;
+                  m = (e + 1) | 0;
+                }
+              } else {
+                m = 0;
+                f = 0;
+              }
+              i = (f | 0) != 0;
+              j = (m | 0) == 0;
+              k = (n | 0) == (d | 0);
+              h = (b + 60 + (d << 2)) | 0;
+              a: while (1) {
+                e = c[h >> 2] | 0;
+                if (!e) {
+                  e = 0;
+                  break;
+                }
+                i4(p, c[(e + 4) >> 2] | 0, 63) | 0;
+                e = R2(p, 58) | 0;
+                if (!e) e = 0;
+                else {
+                  a[e >> 0] = 0;
+                  e = (e + 1) | 0;
+                }
+                do
+                  if (!(s2(p, o) | 0)) {
+                    g = (e | 0) != 0;
+                    if (i & g ? s2(e, f) | 0 : 0) break;
+                    if (!j ? s2(m, c[((c[((c[h >> 2] | 0) + 12) >> 2] | 0) + 8) >> 2] | 0) | 0 : 0) break;
+                    if (k | (g ^ 1)) {
+                      q = 16;
+                      break a;
+                    }
+                    if (LF(b, n, e) | 0) {
+                      q = 16;
+                      break a;
+                    }
+                  }
+                while (0);
+                h = c[h >> 2] | 0;
+              }
+              do
+                if ((q | 0) == 16) {
+                  e = c[h >> 2] | 0;
+                  if (e) {
+                    f = (e + 16) | 0;
+                    if ((c[f >> 2] | 0) == 0 ? (KF(0, 0) | 0, (c[f >> 2] | 0) == 0) : 0) {
+                      e = 0;
+                      break;
+                    }
+                    if ((c[(b + 8) >> 2] | 0) > 0) {
+                      q = c[15712] | 0;
+                      o = c[(e + 4) >> 2] | 0;
+                      p = c[((c[(e + 12) >> 2] | 0) + 8) >> 2] | 0;
+                      c[r >> 2] = c[(20168 + (d << 2)) >> 2];
+                      c[(r + 4) >> 2] = o;
+                      c[(r + 8) >> 2] = p;
+                      w4(q, 98427, r) | 0;
+                    }
+                  } else e = 0;
+                }
+              while (0);
+              c[(b + 80 + (d << 2)) >> 2] = e;
+              l = s;
+              return e | 0;
+            }
+            function MF(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              do
+                if (!e) e = 0;
+                else {
+                  if (c[5047] | 0) {
+                    kA(188004, 0, 0);
+                    c[5047] = 0;
+                  }
+                  h = D4(e) | 0;
+                  e = R2(h, 58) | 0;
+                  if (e) {
+                    a[e >> 0] = 0;
+                    f = (b + 60 + (d << 2)) | 0;
+                    e = 1;
+                    g = f;
+                    while (1) {
+                      b = c[g >> 2] | 0;
+                      if (!b) break;
+                      d = D4(c[(b + 4) >> 2] | 0) | 0;
+                      b = R2(d, 58) | 0;
+                      if (b | 0) a[b >> 0] = 0;
+                      if (!((a[h >> 0] | 0) != 0 ? (c3(h, d) | 0) != 0 : 0)) {
+                        e = c[47002] | 0;
+                        if (e >>> 0 >= (c[47003] | 0) >>> 0) {
+                          lA(188004, 1) | 0;
+                          e = c[47002] | 0;
+                        }
+                        c[47002] = e + 1;
+                        a[e >> 0] = 32;
+                        nA(188004, c[((c[g >> 2] | 0) + 4) >> 2] | 0) | 0;
+                        e = c[47002] | 0;
+                        if (e >>> 0 >= (c[47003] | 0) >>> 0) {
+                          lA(188004, 1) | 0;
+                          e = c[47002] | 0;
+                        }
+                        c[47002] = e + 1;
+                        a[e >> 0] = 58;
+                        nA(188004, c[((c[((c[g >> 2] | 0) + 12) >> 2] | 0) + 8) >> 2] | 0) | 0;
+                        e = 0;
+                      }
+                      U1(d);
+                      g = c[g >> 2] | 0;
+                    }
+                    U1(h);
+                    if ((e << 24) >> 24) {
+                      g = 0;
+                      i = 19;
+                    }
+                  } else {
+                    U1(h);
+                    g = 0;
+                    f = (b + 60 + (d << 2)) | 0;
+                    e = 1;
+                    i = 19;
+                  }
+                  if ((i | 0) == 19) {
+                    while (1) {
+                      b = c[f >> 2] | 0;
+                      if (!b) break;
+                      d = D4(c[(b + 4) >> 2] | 0) | 0;
+                      b = R2(d, 58) | 0;
+                      if (b | 0) a[b >> 0] = 0;
+                      if (!((g | 0) != 0 ? (c3(g, d) | 0) == 0 : 0)) {
+                        e = c[47002] | 0;
+                        if (e >>> 0 >= (c[47003] | 0) >>> 0) {
+                          lA(188004, 1) | 0;
+                          e = c[47002] | 0;
+                        }
+                        c[47002] = e + 1;
+                        a[e >> 0] = 32;
+                        nA(188004, d) | 0;
+                        e = 0;
+                      }
+                      g = d;
+                      f = c[f >> 2] | 0;
+                      i = 19;
+                    }
+                    if ((e << 24) >> 24) {
+                      e = 195059;
+                      break;
+                    }
+                  }
+                  e = c[47002] | 0;
+                  if (e >>> 0 >= (c[47003] | 0) >>> 0) {
+                    lA(188004, 1) | 0;
+                    e = c[47002] | 0;
+                  }
+                  a[e >> 0] = 0;
+                  e = c[47001] | 0;
+                  c[47002] = e;
+                }
+              while (0);
+              return e | 0;
+            }
+            function NF(b) {
+              b = b | 0;
+              var d = 0;
+              if (!b) qa(111208, 98444, 573, 98458);
+              if (!(a[b >> 0] | 0)) qa(111213, 98444, 574, 98458);
+              d = c[47005] | 0;
+              if (!d) b = 0;
+              else b = nb[c[d >> 2] & 63](d, b, 512) | 0;
+              return b | 0;
+            }
+            function OF(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 16) | 0;
+              j = (k + 8) | 0;
+              i = k;
+              if (!b) qa(111312, 98444, 589, 98475);
+              g = (b + 8) | 0;
+              e = c[g >> 2] | 0;
+              if (!e) qa(111315, 98444, 590, 98475);
+              if (!(a[e >> 0] | 0)) qa(111324, 98444, 591, 98475);
+              h = (b + 20) | 0;
+              f = c[h >> 2] | 0;
+              do
+                if (!f) {
+                  d = mP(e) | 0;
+                  if (!d) {
+                    c[i >> 2] = c[g >> 2];
+                    gA(0, 98499, i) | 0;
+                    d = 0;
+                    break;
+                  }
+                  i = $4(d, 138821) | 0;
+                  c[h >> 2] = i;
+                  if (!i) {
+                    c[j >> 2] = t2(c[(d2() | 0) >> 2] | 0) | 0;
+                    c[(j + 4) >> 2] = d;
+                    gA(0, 98524, j) | 0;
+                    d = 0;
+                    break;
+                  }
+                  d = c[47006] | 0;
+                  if ((d | 0) > 49) {
+                    a[(b + 17) >> 0] = 1;
+                    d = 1;
+                    break;
+                  } else {
+                    c[47006] = d + 1;
+                    d = 1;
+                    break;
+                  }
+                } else {
+                  n5(f, 0, 0) | 0;
+                  if (!(c[h >> 2] | 0)) qa(98545, 98444, 614, 98475);
+                  else d = 1;
+                }
+              while (0);
+              l = k;
+              return d | 0;
+            }
+            function PF(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              if (a[(b + 17) >> 0] | 0 ? ((d = (b + 20) | 0), (e = c[d >> 2] | 0), e | 0) : 0) {
+                I4(e) | 0;
+                c[d >> 2] = 0;
+              }
+              return;
+            }
+            function QF(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                g = 0.0;
+              if (!b) {
+                e = -1;
+                d = -1;
+              } else {
+                e = c[(b + 48) >> 2] | 0;
+                f = +(e | 0);
+                if (!e) {
+                  g = +h[d >> 3];
+                  f = +h[(d + 8) >> 3];
+                } else {
+                  h[(d + 8) >> 3] = f;
+                  h[d >> 3] = f;
+                  g = f;
+                }
+                e = ~~(+(((c[(b + 40) >> 2] | 0) * 72) | 0) / g);
+                d = ~~(+(((c[(b + 44) >> 2] | 0) * 72) | 0) / f);
+              }
+              c[a >> 2] = e;
+              c[(a + 4) >> 2] = d;
+              return;
+            }
+            function RF(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0.0;
+              m = l;
+              l = (l + 48) | 0;
+              f = (m + 16) | 0;
+              j = m;
+              k = (m + 32) | 0;
+              if ((e | 0) != 0 ? (a[e >> 0] | 0) != 0 : 0) {
+                if (
+                  (0 == 0 ? ((g = c[47133] | 0), (c[47007] | 0) != (g | 0)) : 0)
+                    ? ((c[47007] = g), (i = c[47005] | 0), i | 0)
+                    : 0
+                ) {
+                  Rz(i) | 0;
+                  c[47005] = 0;
+                }
+                n = +h[((c[((c[(d + 16) >> 2] | 0) + 8) >> 2] | 0) + 24) >> 3];
+                n = !(n >= 1.0) ? 96.0 : n;
+                h[(j + 8) >> 3] = n;
+                h[j >> 3] = n;
+                d = SF(e) | 0;
+                c[f >> 2] = c[j >> 2];
+                c[(f + 4) >> 2] = c[(j + 4) >> 2];
+                c[(f + 8) >> 2] = c[(j + 8) >> 2];
+                c[(f + 12) >> 2] = c[(j + 12) >> 2];
+                QF(k, d, f);
+                d = c[k >> 2] | 0;
+                f = c[(k + 4) >> 2] | 0;
+              } else {
+                d = -1;
+                f = -1;
+              }
+              c[b >> 2] = d;
+              c[(b + 4) >> 2] = f;
+              l = m;
+              return;
+            }
+            function SF(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              f = l;
+              l = (l + 16) | 0;
+              e = f;
+              if (!a) qa(111208, 98444, 638, 98551);
+              if (!(c[47005] | 0)) c[47005] = Vz(20192, c[4589] | 0) | 0;
+              b = NF(a) | 0;
+              a: do
+                if (!b) {
+                  b = JK(64) | 0;
+                  if (!b) b = 0;
+                  else {
+                    d = (b + 8) | 0;
+                    c[d >> 2] = fD(0, a) | 0;
+                    if (!(((OF(b) | 0) << 24) >> 24)) {
+                      TF(b);
+                      b = 0;
+                      break;
+                    }
+                    if (!(c[(b + 20) >> 2] | 0)) qa(98545, 98444, 653, 98551);
+                    do
+                      switch (UF(b) | 0) {
+                        case 0: {
+                          a = iN(c[d >> 2] | 0) | 0;
+                          c[(b + 52) >> 2] = a;
+                          if (!a) {
+                            c[e >> 2] = c[d >> 2];
+                            gA(0, 98568, e) | 0;
+                            TF(b);
+                            b = 0;
+                            break a;
+                          }
+                          break;
+                        }
+                        case 2: {
+                          VF(b);
+                          break;
+                        }
+                        case 3: {
+                          WF(b);
+                          break;
+                        }
+                        case 1: {
+                          XF(b);
+                          break;
+                        }
+                        case 4: {
+                          YF(b);
+                          break;
+                        }
+                        case 6: {
+                          ZF(b);
+                          break;
+                        }
+                        case 11: {
+                          _F(b);
+                          break;
+                        }
+                        case 8: {
+                          $F(b);
+                          break;
+                        }
+                        case 5: {
+                          aG(b);
+                          break;
+                        }
+                        case 12: {
+                          bG(b);
+                          break;
+                        }
+                        default: {
+                        }
+                      }
+                    while (0);
+                    PF(b);
+                    e = c[47005] | 0;
+                    nb[c[e >> 2] & 63](e, b, 1) | 0;
+                  }
+                } else PF(b);
+              while (0);
+              l = f;
+              return b | 0;
+            }
+            function TF(a) {
+              a = a | 0;
+              var b = 0;
+              b = c[(a + 8) >> 2] | 0;
+              if (b | 0) hD(0, b) | 0;
+              U1(a);
+              return;
+            }
+            function UF(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 224) | 0;
+              f = (j + 200) | 0;
+              g = j;
+              h = (a + 20) | 0;
+              b = c[h >> 2] | 0;
+              a: do
+                if ((b | 0) != 0 ? (x6(f, 1, 20, b) | 0) == 20 : 0) {
+                  d = 0;
+                  while (1) {
+                    if (d >>> 0 >= 10) {
+                      i = 13;
+                      break a;
+                    }
+                    if (!($3(f, c[(20228 + (d << 4)) >> 2] | 0, c[(20228 + (d << 4) + 4) >> 2] | 0) | 0)) break;
+                    d = (d + 1) | 0;
+                  }
+                  e = (a + 28) | 0;
+                  c[e >> 2] = c[(20228 + (d << 4) + 12) >> 2];
+                  b = c[(20228 + (d << 4) + 8) >> 2] | 0;
+                  a = (a + 24) | 0;
+                  c[a >> 2] = b;
+                  switch (d | 0) {
+                    case 7:
+                      break;
+                    case 8: {
+                      if ($3((f + 8) | 0, 98784, 4) | 0) break a;
+                      c[e >> 2] = 98789;
+                      c[a >> 2] = 11;
+                      b = 11;
+                      break a;
+                    }
+                    default:
+                      break a;
+                  }
+                  while (1) {
+                    if (!(c4(g, 200, c[h >> 2] | 0) | 0)) {
+                      i = 11;
+                      break;
+                    }
+                    if (!($3(g, 98779, 4) | 0)) {
+                      i = 8;
+                      break;
+                    }
+                  }
+                  if ((i | 0) == 8) {
+                    c[e >> 2] = 101803;
+                    c[a >> 2] = 8;
+                    b = 8;
+                    break;
+                  } else if ((i | 0) == 11) {
+                    b = c[a >> 2] | 0;
+                    break;
+                  }
+                } else i = 13;
+              while (0);
+              if ((i | 0) == 13) {
+                c[(a + 28) >> 2] = 98794;
+                c[(a + 24) >> 2] = 0;
+                b = 0;
+              }
+              l = j;
+              return b | 0;
+            }
+            function VF(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              f = l;
+              l = (l + 16) | 0;
+              b = (f + 4) | 0;
+              d = f;
+              c[(a + 48) >> 2] = 0;
+              e = (a + 20) | 0;
+              n5(c[e >> 2] | 0, 6, 0) | 0;
+              if (((kG(c[e >> 2] | 0, 2, b) | 0) << 24) >> 24 ? ((kG(c[e >> 2] | 0, 2, d) | 0) << 24) >> 24 : 0) {
+                c[(a + 40) >> 2] = c[b >> 2];
+                c[(a + 44) >> 2] = c[d >> 2];
+              }
+              l = f;
+              return;
+            }
+            function WF(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              f = l;
+              l = (l + 16) | 0;
+              b = (f + 4) | 0;
+              d = f;
+              c[(a + 48) >> 2] = 0;
+              e = (a + 20) | 0;
+              n5(c[e >> 2] | 0, 16, 0) | 0;
+              if (((cG(c[e >> 2] | 0, 4, b) | 0) << 24) >> 24 ? ((cG(c[e >> 2] | 0, 4, d) | 0) << 24) >> 24 : 0) {
+                c[(a + 40) >> 2] = c[b >> 2];
+                c[(a + 44) >> 2] = c[d >> 2];
+              }
+              l = f;
+              return;
+            }
+            function XF(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 16) | 0;
+              b = (h + 12) | 0;
+              d = (h + 8) | 0;
+              e = (h + 4) | 0;
+              f = h;
+              c[(a + 48) >> 2] = 0;
+              g = (a + 20) | 0;
+              n5(c[g >> 2] | 0, 16, 0) | 0;
+              if (
+                (
+                  (((kG(c[g >> 2] | 0, 2, b) | 0) << 24) >> 24 ? ((kG(c[g >> 2] | 0, 2, d) | 0) << 24) >> 24 : 0)
+                    ? ((kG(c[g >> 2] | 0, 2, e) | 0) << 24) >> 24
+                    : 0
+                )
+                  ? ((kG(c[g >> 2] | 0, 2, f) | 0) << 24) >> 24
+                  : 0
+              ) {
+                c[(a + 40) >> 2] = (c[b >> 2] << 16) | c[d >> 2];
+                c[(a + 44) >> 2] = (c[e >> 2] << 16) | c[f >> 2];
+              }
+              l = h;
+              return;
+            }
+            function YF(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              m = l;
+              l = (l + 32) | 0;
+              b = (m + 16) | 0;
+              e = (m + 12) | 0;
+              f = (m + 8) | 0;
+              h = (m + 4) | 0;
+              i = m;
+              c[(a + 48) >> 2] = 0;
+              j = (a + 20) | 0;
+              while (1) {
+                if (!(((cG(c[j >> 2] | 0, 1, b) | 0) << 24) >> 24)) break;
+                d = c[b >> 2] | 0;
+                if ((d | 0) == 255) continue;
+                if (R2(98767, d) | 0) continue;
+                if ((d | 0) == 192) {
+                  k = 6;
+                  break;
+                }
+                g = c[j >> 2] | 0;
+                if ((d | 0) == 194) {
+                  k = 11;
+                  break;
+                }
+                if (!(((cG(g, 2, e) | 0) << 24) >> 24)) break;
+                n5(c[j >> 2] | 0, ((c[e >> 2] | 0) + -2) | 0, 1) | 0;
+              }
+              if ((k | 0) == 6) {
+                if (
+                  (((cG(c[j >> 2] | 0, 3, i) | 0) << 24) >> 24 ? ((cG(c[j >> 2] | 0, 2, f) | 0) << 24) >> 24 : 0)
+                    ? ((cG(c[j >> 2] | 0, 2, h) | 0) << 24) >> 24
+                    : 0
+                ) {
+                  c[(a + 44) >> 2] = c[f >> 2];
+                  c[(a + 40) >> 2] = c[h >> 2];
+                }
+              } else if (
+                (
+                  ((k | 0) == 11 ? ((cG(g, 3, i) | 0) << 24) >> 24 : 0)
+                    ? ((cG(c[j >> 2] | 0, 2, f) | 0) << 24) >> 24
+                    : 0
+                )
+                  ? ((cG(c[j >> 2] | 0, 2, h) | 0) << 24) >> 24
+                  : 0
+              ) {
+                c[(a + 44) >> 2] = c[f >> 2];
+                c[(a + 40) >> 2] = c[h >> 2];
+              }
+              l = m;
+              return;
+            }
+            function ZF(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              m = l;
+              l = (l + 1056) | 0;
+              j = m;
+              b = (m + 32) | 0;
+              e = (m + 28) | 0;
+              f = (m + 24) | 0;
+              g = (m + 20) | 0;
+              h = (m + 16) | 0;
+              c[(a + 48) >> 2] = 72;
+              i = (a + 20) | 0;
+              n5(c[i >> 2] | 0, 0, 0) | 0;
+              while (1) {
+                if (!(c4(b, 1024, c[i >> 2] | 0) | 0)) break;
+                d = d4(b, 98752) | 0;
+                if (!d) continue;
+                c[j >> 2] = e;
+                c[(j + 4) >> 2] = f;
+                c[(j + 8) >> 2] = g;
+                c[(j + 12) >> 2] = h;
+                if ((b5(d, 104311, j) | 0) == 4) {
+                  k = 5;
+                  break;
+                }
+              }
+              if ((k | 0) == 5) {
+                j = c[e >> 2] | 0;
+                c[(a + 32) >> 2] = j;
+                k = c[f >> 2] | 0;
+                c[(a + 36) >> 2] = k;
+                c[(a + 40) >> 2] = (c[g >> 2] | 0) - j;
+                c[(a + 44) >> 2] = (c[h >> 2] | 0) - k;
+              }
+              l = m;
+              return;
+            }
+            function _F(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              g = l;
+              l = (l + 16) | 0;
+              b = (g + 4) | 0;
+              d = g;
+              c[(a + 48) >> 2] = 0;
+              e = (a + 20) | 0;
+              n5(c[e >> 2] | 0, 15, 0) | 0;
+              h = (D6(c[e >> 2] | 0) | 0) == 88;
+              f = c[e >> 2] | 0;
+              if (h) {
+                n5(f, 24, 0) | 0;
+                if (((kG(c[e >> 2] | 0, 4, b) | 0) << 24) >> 24 ? ((kG(c[e >> 2] | 0, 4, d) | 0) << 24) >> 24 : 0) {
+                  c[(a + 40) >> 2] = c[b >> 2];
+                  c[(a + 44) >> 2] = c[d >> 2];
+                }
+              } else {
+                n5(f, 26, 0) | 0;
+                if (((kG(c[e >> 2] | 0, 2, b) | 0) << 24) >> 24 ? ((kG(c[e >> 2] | 0, 2, d) | 0) << 24) >> 24 : 0) {
+                  c[(a + 40) >> 2] = c[b >> 2];
+                  c[(a + 44) >> 2] = c[d >> 2];
+                }
+              }
+              l = g;
+              return;
+            }
+            function $F(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0;
+              F = l;
+              l = (l + 352) | 0;
+              C = (F + 80) | 0;
+              B = (F + 72) | 0;
+              E = (F + 64) | 0;
+              D = (F + 56) | 0;
+              A = (F + 48) | 0;
+              d = (F + 40) | 0;
+              s = (F + 32) | 0;
+              t = (F + 24) | 0;
+              u = (F + 16) | 0;
+              v = (F + 8) | 0;
+              w = F;
+              x = (F + 328) | 0;
+              y = (F + 128) | 0;
+              z = (F + 96) | 0;
+              if (!(c[47008] | 0)) {
+                if (F5(188036, 98637, 1) | 0) {
+                  c[d >> 2] = 98637;
+                  gA(1, 98664, d) | 0;
+                }
+                c[47008] = 188036;
+              }
+              m = (b + 20) | 0;
+              n5(c[m >> 2] | 0, 0, 0) | 0;
+              n = (z + 12) | 0;
+              o = (z + 20) | 0;
+              p = (z + 8) | 0;
+              q = (z + 16) | 0;
+              r = (z + 4) | 0;
+              d = 0;
+              g = 0;
+              f = 0;
+              e = 0;
+              a: while (1) {
+                if (!(c4(y, 200, c[m >> 2] | 0) | 0)) break;
+                if (((g << 24) >> 24 == 0) | ((d << 24) >> 24 == 0)) {
+                  i = y;
+                  k = e;
+                } else break;
+                b: while (1) {
+                  j = f;
+                  c: while (1) {
+                    while (1) {
+                      if (r6(188036, i, 4, z, 0) | 0) {
+                        f = j;
+                        e = k;
+                        continue a;
+                      }
+                      a[(i + (c[n >> 2] | 0)) >> 0] = 0;
+                      a[(i + (c[o >> 2] | 0)) >> 0] = 0;
+                      e = (i + (c[p >> 2] | 0)) | 0;
+                      f = (i + (c[q >> 2] | 0)) | 0;
+                      i = (i + ((c[r >> 2] | 0) + 1)) | 0;
+                      if (!(s2(e, 141116) | 0)) break;
+                      if (!(s2(e, 141048) | 0)) break c;
+                      if (s2(e, 98711) | 0) continue;
+                      c[C >> 2] = t;
+                      c[(C + 4) >> 2] = u;
+                      c[(C + 8) >> 2] = v;
+                      c[(C + 12) >> 2] = w;
+                      if ((b5(f, 98719, C) | 0) == 4) break b;
+                    }
+                    c[A >> 2] = s;
+                    c[(A + 4) >> 2] = x;
+                    if ((b5(f, 98701, A) | 0) != 2) {
+                      c[D >> 2] = s;
+                      if ((b5(f, 101209, D) | 0) == 1) {
+                        e = 1;
+                        f = jG(+h[s >> 3], 98708) | 0;
+                      } else {
+                        e = g;
+                        f = j;
+                      }
+                    } else {
+                      e = 1;
+                      f = jG(+h[s >> 3], x) | 0;
+                    }
+                    if (!((d << 24) >> 24)) {
+                      d = 0;
+                      g = e;
+                      j = f;
+                    } else {
+                      g = e;
+                      e = k;
+                      continue a;
+                    }
+                  }
+                  c[E >> 2] = s;
+                  c[(E + 4) >> 2] = x;
+                  if ((b5(f, 98701, E) | 0) != 2) {
+                    c[B >> 2] = s;
+                    if ((b5(f, 101209, B) | 0) == 1) {
+                      d = 1;
+                      e = jG(+h[s >> 3], 98708) | 0;
+                    } else e = k;
+                  } else {
+                    d = 1;
+                    e = jG(+h[s >> 3], x) | 0;
+                  }
+                  if (!((g << 24) >> 24)) {
+                    g = 0;
+                    f = j;
+                    k = e;
+                  } else {
+                    f = j;
+                    continue a;
+                  }
+                }
+                d = 1;
+                g = 1;
+                f = ~~(+h[v >> 3] + 1.0 - +h[t >> 3]) >>> 0;
+                e = ~~(+h[w >> 3] + 1.0 - +h[u >> 3]) >>> 0;
+              }
+              c[(b + 48) >> 2] = 0;
+              c[(b + 40) >> 2] = f;
+              c[(b + 44) >> 2] = e;
+              l = F;
+              return;
+            }
+            function aG(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0.0,
+                g = 0.0;
+              d = l;
+              l = (l + 32) | 0;
+              b = d;
+              c[(a + 48) >> 2] = 0;
+              e = (a + 20) | 0;
+              n5(c[e >> 2] | 0, 0, 0) | 0;
+              if (!(dG(c[e >> 2] | 0, b) | 0)) {
+                g = +h[b >> 3];
+                c[(a + 32) >> 2] = ~~g;
+                f = +h[(b + 8) >> 3];
+                c[(a + 36) >> 2] = ~~f;
+                c[(a + 40) >> 2] = ~~(+h[(b + 16) >> 3] - g);
+                c[(a + 44) >> 2] = ~~(+h[(b + 24) >> 3] - f);
+              }
+              l = d;
+              return;
+            }
+            function bG(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              f = l;
+              l = (l + 16) | 0;
+              b = (f + 4) | 0;
+              d = f;
+              c[(a + 48) >> 2] = 0;
+              e = (a + 20) | 0;
+              n5(c[e >> 2] | 0, 6, 0) | 0;
+              if (((cG(c[e >> 2] | 0, 1, b) | 0) << 24) >> 24 ? ((cG(c[e >> 2] | 0, 1, d) | 0) << 24) >> 24 : 0) {
+                c[(a + 40) >> 2] = c[b >> 2];
+                c[(a + 44) >> 2] = c[d >> 2];
+              }
+              l = f;
+              return;
+            }
+            function cG(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              c[d >> 2] = 0;
+              e = 0;
+              while (1) {
+                if (e >>> 0 >= b >>> 0) {
+                  e = 1;
+                  break;
+                }
+                f = D6(a) | 0;
+                if (H4(a) | 0) {
+                  e = 0;
+                  break;
+                }
+                c[d >> 2] = (c[d >> 2] << 8) | f;
+                e = (e + 1) | 0;
+              }
+              return e | 0;
+            }
+            function dG(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 1040) | 0;
+              d = h;
+              e = (h + 16) | 0;
+              while (1) {
+                if (!(c4(e, 1024, a) | 0)) {
+                  a = 1;
+                  break;
+                }
+                f = d4(e, 98627) | 0;
+                if (f | 0) {
+                  g = 4;
+                  break;
+                }
+              }
+              if ((g | 0) == 4) {
+                c[(d + 4) >> 2] = e;
+                c[d >> 2] = f + 9;
+                c[(d + 8) >> 2] = a;
+                a = eG(d, b) | 0;
+              }
+              l = h;
+              return a | 0;
+            }
+            function eG(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              g = l;
+              l = (l + 1024) | 0;
+              f = g;
+              fG(b);
+              e = a[c[b >> 2] >> 0] | 0;
+              if (!((e << 24) >> 24)) e = (gG(b) | 0) & 255;
+              else e = (e << 24) >> 24;
+              if (
+                (
+                  ((e | 0) == 91 ? ((c[b >> 2] = (c[b >> 2] | 0) + 1), hG(b, f), (iG(f, d) | 0) == 0) : 0)
+                    ? (hG(b, f), (iG(f, (d + 8) | 0) | 0) == 0)
+                    : 0
+                )
+                  ? (hG(b, f), (iG(f, (d + 16) | 0) | 0) == 0)
+                  : 0
+              ) {
+                hG(b, f);
+                e = ((iG(f, (d + 24) | 0) | 0) != 0) & 1;
+              } else e = 1;
+              l = g;
+              return e | 0;
+            }
+            function fG(b) {
+              b = b | 0;
+              var d = 0;
+              d = c[b >> 2] | 0;
+              while (1) {
+                d = a[d >> 0] | 0;
+                if (!((d << 24) >> 24)) d = (gG(b) | 0) & 255;
+                else d = (d << 24) >> 24;
+                if (!(((d & 255) << 24) >> 24)) break;
+                if (!(S2(d & 255) | 0)) break;
+                d = ((c[b >> 2] | 0) + 1) | 0;
+                c[b >> 2] = d;
+              }
+              return;
+            }
+            function gG(b) {
+              b = b | 0;
+              var d = 0;
+              d = (b + 4) | 0;
+              if (!(c4(c[d >> 2] | 0, 1024, c[(b + 8) >> 2] | 0) | 0)) b = 0;
+              else {
+                d = c[d >> 2] | 0;
+                c[b >> 2] = d;
+                b = a[d >> 0] | 0;
+              }
+              return b | 0;
+            }
+            function hG(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              fG(b);
+              e = 0;
+              f = c[b >> 2] | 0;
+              while (1) {
+                f = a[f >> 0] | 0;
+                if (!((f << 24) >> 24)) g = (gG(b) | 0) & 255;
+                else g = (f << 24) >> 24;
+                f = (g << 24) >> 24;
+                if (!f) break;
+                if (!(((f | 0) == 46) | (((f + -48) | 0) >>> 0 < 10))) break;
+                a[(d + e) >> 0] = g;
+                e = (e + 1) | 0;
+                f = ((c[b >> 2] | 0) + 1) | 0;
+                c[b >> 2] = f;
+                if ((e | 0) == 1023) {
+                  e = 1023;
+                  break;
+                }
+              }
+              a[(d + e) >> 0] = 0;
+              return;
+            }
+            function iG(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0,
+                f = 0;
+              e = l;
+              l = (l + 16) | 0;
+              f = e;
+              d = +s5(a, f);
+              if ((c[f >> 2] | 0) == (a | 0)) a = 1;
+              else {
+                h[b >> 3] = d;
+                a = 0;
+              }
+              l = e;
+              return a | 0;
+            }
+            function jG(a, b) {
+              a = +a;
+              b = b | 0;
+              var c = 0.0;
+              do
+                if (!(s2(b, 98735) | 0)) {
+                  a = a * 72.0;
+                  c = a;
+                  a = a >= 0.0 ? 0.5 : -0.5;
+                } else {
+                  if (!(s2(b, 98738) | 0)) {
+                    a = a * 0.75;
+                    c = a;
+                    a = a >= 0.0 ? 0.5 : -0.5;
+                    break;
+                  }
+                  if (!(s2(b, 98741) | 0)) {
+                    a = a * 12.0;
+                    c = a;
+                    a = a >= 0.0 ? 0.5 : -0.5;
+                    break;
+                  }
+                  if (s2(b, 98708) | 0 ? s2(b, 98744) | 0 : 0)
+                    if (!(s2(b, 98746) | 0)) {
+                      a = a * 28.346456664;
+                      c = a;
+                      a = a >= 0.0 ? 0.5 : -0.5;
+                      break;
+                    } else {
+                      b = (s2(b, 98749) | 0) == 0;
+                      c = a * 2.8346456663999997;
+                      return (b ? ~~(c + (c >= 0.0 ? 0.5 : -0.5)) : 0) | 0;
+                    }
+                  c = a >= 0.0 ? 0.5 : -0.5;
+                }
+              while (0);
+              return ~~(a + c) | 0;
+            }
+            function kG(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              c[d >> 2] = 0;
+              e = 0;
+              while (1) {
+                if (e >>> 0 >= b >>> 0) {
+                  e = 1;
+                  break;
+                }
+                f = D6(a) | 0;
+                if (H4(a) | 0) {
+                  e = 0;
+                  break;
+                }
+                c[d >> 2] = c[d >> 2] | (f << (e << 3));
+                e = (e + 1) | 0;
+              }
+              return e | 0;
+            }
+            function lG(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              a = c[(b + 20) >> 2] | 0;
+              if (a | 0) I4(a) | 0;
+              if (c[(b + 52) >> 2] | 0 ? ((e = c[(b + 60) >> 2] | 0), e | 0) : 0) tb[e & 127](b);
+              U1(b);
+              return;
+            }
+            function mG() {
+              var a = 0;
+              GA(0, 1, 108224, 105493) | 0;
+              a = zF(0, 1) | 0;
+              aT(a, 0);
+              return a | 0;
+            }
+            function nG(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0;
+              k = l;
+              l = (l + 304) | 0;
+              j = (k + 24) | 0;
+              i = (k + 8) | 0;
+              f = k;
+              g = (k + 40) | 0;
+              if ((vS(b, e) | 0) != 999)
+                if ((wS(b, d) | 0) == -1) b = -1;
+                else {
+                  b = c[(d + 16) >> 2] | 0;
+                  e = (b + 16) | 0;
+                  if (!(a[((c[(b + 8) >> 2] | 0) + 81) >> 0] | 0)) {
+                    p = +h[e >> 3];
+                    o = +h[(b + 24) >> 3];
+                    n = +h[(b + 32) >> 3];
+                    m = +h[(b + 40) >> 3];
+                    c[j >> 2] = ~~(p + (p >= 0.0 ? 0.5 : -0.5));
+                    c[(j + 4) >> 2] = ~~(o + (o >= 0.0 ? 0.5 : -0.5));
+                    c[(j + 8) >> 2] = ~~(n + (n >= 0.0 ? 0.5 : -0.5));
+                    c[(j + 12) >> 2] = ~~(m + (m >= 0.0 ? 0.5 : -0.5));
+                    m4(g, 98899, j) | 0;
+                  } else {
+                    m = +h[(b + 24) >> 3];
+                    n = +h[e >> 3];
+                    o = +h[(b + 40) >> 3];
+                    p = +h[(b + 32) >> 3];
+                    c[i >> 2] = ~~(m + (m >= 0.0 ? 0.5 : -0.5));
+                    c[(i + 4) >> 2] = ~~(n + (n >= 0.0 ? 0.5 : -0.5));
+                    c[(i + 8) >> 2] = ~~(o + (o >= 0.0 ? 0.5 : -0.5));
+                    c[(i + 12) >> 2] = ~~(p + (p >= 0.0 ? 0.5 : -0.5));
+                    m4(g, 98899, i) | 0;
+                  }
+                  TA(d, 102671, g, 195059) | 0;
+                  b = 0;
+                }
+              else {
+                b = MF(b, 1, e) | 0;
+                c[f >> 2] = e;
+                c[(f + 4) >> 2] = b;
+                gA(1, 111233, f) | 0;
+                b = -1;
+              }
+              l = k;
+              return b | 0;
+            }
+            function oG(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 16) | 0;
+              g = i;
+              f = c[(b + 60) >> 2] | 0;
+              DF(a, d) | 0;
+              b = c[(a + 164) >> 2] | 0;
+              c[(b + 56) >> 2] = JR(b, c[(b + 52) >> 2] | 0) | 0;
+              if ((TC(f, 137483, 0, 1) | 0) != 0 ? (c[((c[(f + 16) >> 2] | 0) + 8) >> 2] | 0) != 0 : 0) h = 5;
+              else if (!(c[(b + 152) >> 2] & 67108864)) {
+                jA(98911, g);
+                b = -1;
+              } else h = 5;
+              if ((h | 0) == 5) {
+                c[(b + 36) >> 2] = e;
+                if (!e) {
+                  h = (b + 152) | 0;
+                  c[h >> 2] = c[h >> 2] | 134217728;
+                }
+                h = SJ(a, f) | 0;
+                LR(b);
+                IF(a);
+                b = h;
+              }
+              l = i;
+              return b | 0;
+            }
+            function pG(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 16) | 0;
+              g = i;
+              f = c[(b + 60) >> 2] | 0;
+              DF(a, d) | 0;
+              b = c[(a + 164) >> 2] | 0;
+              c[(b + 56) >> 2] = JR(b, c[(b + 52) >> 2] | 0) | 0;
+              if ((TC(f, 137483, 0, 1) | 0) != 0 ? (c[((c[(f + 16) >> 2] | 0) + 8) >> 2] | 0) != 0 : 0) h = 5;
+              else if (!(c[(b + 152) >> 2] & 67108864)) {
+                jA(98911, g);
+                b = -1;
+              } else h = 5;
+              if ((h | 0) == 5) {
+                CF(a, e);
+                h = SJ(a, f) | 0;
+                LR(b);
+                sF(b);
+                IF(a);
+                b = h;
+              }
+              l = i;
+              return b | 0;
+            }
+            function qG(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              m = l;
+              l = (l + 16) | 0;
+              h = (m + 8) | 0;
+              g = m;
+              b = c[(b + 60) >> 2] | 0;
+              DF(a, d) | 0;
+              j = c[(a + 164) >> 2] | 0;
+              c[(j + 56) >> 2] = JR(j, c[(j + 52) >> 2] | 0) | 0;
+              if ((TC(b, 137483, 0, 1) | 0) != 0 ? (c[((c[(b + 16) >> 2] | 0) + 8) >> 2] | 0) != 0 : 0) k = 5;
+              else if (!(c[(j + 152) >> 2] & 67108864)) {
+                jA(98911, g);
+                b = -1;
+              } else k = 5;
+              do
+                if ((k | 0) == 5) {
+                  if (e | 0 ? ((i = T1(4096) | 0), (c[e >> 2] = i), i | 0) : 0) {
+                    g = (j + 40) | 0;
+                    c[g >> 2] = i;
+                    c[(j + 44) >> 2] = 4096;
+                    d = (j + 48) | 0;
+                    c[d >> 2] = 0;
+                    b = SJ(a, b) | 0;
+                    LR(j);
+                    if (!b) {
+                      c[e >> 2] = c[g >> 2];
+                      c[f >> 2] = c[d >> 2];
+                    }
+                    IF(a);
+                    break;
+                  }
+                  gA(1, 98932, h) | 0;
+                  b = -1;
+                }
+              while (0);
+              l = m;
+              return b | 0;
+            }
+            function rG(a, b) {
+              a = a | 0;
+              b = b | 0;
+              _S(a, 0, b);
+              return;
+            }
+            function sG(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0;
+              H = l;
+              l = (l + 4288) | 0;
+              E = (H + 8) | 0;
+              D = H;
+              F = 4;
+              G = T1(40) | 0;
+              c[G >> 2] = 0;
+              A = (H + 4152) | 0;
+              B = (H + 4148) | 0;
+              C = (H + 4128) | 0;
+              j = (H + 4112) | 0;
+              k = (H + 16) | 0;
+              o = 0;
+              i = $(24, b | 0) | 0;
+              g = o;
+              o = 0;
+              if (((g | 0) != 0) & ((p | 0) != 0)) {
+                h = V6(c[g >> 2] | 0, G | 0, F | 0) | 0;
+                if (!h) bb(g | 0, p | 0);
+                z = p;
+              } else h = -1;
+              a: do
+                if ((h | 0) != 1) {
+                  if (!i) {
+                    c[d >> 2] = 0;
+                    g = 0;
+                    break;
+                  }
+                  o = 0;
+                  n = ca(29, e | 0, B | 0, A | 0) | 0;
+                  g = o;
+                  o = 0;
+                  if (((g | 0) != 0) & ((p | 0) != 0)) {
+                    h = V6(c[g >> 2] | 0, G | 0, F | 0) | 0;
+                    if (!h) bb(g | 0, p | 0);
+                    z = p;
+                  } else h = -1;
+                  if ((h | 0) != 1) {
+                    o = 0;
+                    m = $(23, 40) | 0;
+                    g = o;
+                    o = 0;
+                    if (((g | 0) != 0) & ((p | 0) != 0)) {
+                      h = V6(c[g >> 2] | 0, G | 0, F | 0) | 0;
+                      if (!h) bb(g | 0, p | 0);
+                      z = p;
+                    } else h = -1;
+                    if ((h | 0) != 1) {
+                      o = 0;
+                      na(7, C | 0, j | 0, k | 0, 24, 85);
+                      g = o;
+                      o = 0;
+                      if (((g | 0) != 0) & ((p | 0) != 0)) {
+                        h = V6(c[g >> 2] | 0, G | 0, F | 0) | 0;
+                        if (!h) bb(g | 0, p | 0);
+                        z = p;
+                      } else h = -1;
+                      if ((h | 0) != 1) {
+                        o = 0;
+                        e = $(25, b | 0) | 0;
+                        g = o;
+                        o = 0;
+                        if (((g | 0) != 0) & ((p | 0) != 0)) {
+                          h = V6(c[g >> 2] | 0, G | 0, F | 0) | 0;
+                          if (!h) bb(g | 0, p | 0);
+                          z = p;
+                        } else h = -1;
+                        if ((h | 0) != 1) {
+                          j = (C + 16) | 0;
+                          i = c[j >> 2] | 0;
+                          g = e;
+                          while (1) {
+                            if (!g) break;
+                            o = 0;
+                            aa(i | 0, g | 0, 0) | 0;
+                            h = o;
+                            o = 0;
+                            if (((h | 0) != 0) & ((p | 0) != 0)) {
+                              e = V6(c[h >> 2] | 0, G | 0, F | 0) | 0;
+                              if (!e) bb(h | 0, p | 0);
+                              z = p;
+                            } else e = -1;
+                            if ((e | 0) == 1) {
+                              y = 0;
+                              x = j;
+                              w = m;
+                              v = n;
+                              g = z;
+                              m = 15;
+                              break a;
+                            }
+                            o = 0;
+                            g = aa(86, b | 0, g | 0) | 0;
+                            h = o;
+                            o = 0;
+                            if (((h | 0) != 0) & ((p | 0) != 0)) {
+                              e = V6(c[h >> 2] | 0, G | 0, F | 0) | 0;
+                              if (!e) bb(h | 0, p | 0);
+                              z = p;
+                            } else e = -1;
+                            if ((e | 0) == 1) {
+                              y = 0;
+                              x = j;
+                              w = m;
+                              v = n;
+                              g = z;
+                              m = 15;
+                              break a;
+                            }
+                          }
+                          G = U6(188068, 1, G | 0, F | 0) | 0;
+                          F = z;
+                          o = 0;
+                          g = o;
+                          o = 0;
+                          if (((g | 0) != 0) & ((p | 0) != 0)) {
+                            h = V6(c[g >> 2] | 0, G | 0, F | 0) | 0;
+                            if (!h) bb(g | 0, p | 0);
+                            z = p;
+                          } else h = -1;
+                          if ((h | 0) == 1) {
+                            y = m;
+                            x = j;
+                            w = m;
+                            v = n;
+                            g = z;
+                            m = 15;
+                          } else {
+                            y = m;
+                            x = j;
+                            w = m;
+                            v = n;
+                            g = 0;
+                            m = 15;
+                          }
+                        } else {
+                          y = 0;
+                          x = 0;
+                          w = m;
+                          v = n;
+                          g = z;
+                          m = 15;
+                        }
+                      } else {
+                        y = 0;
+                        x = 0;
+                        w = m;
+                        v = n;
+                        g = z;
+                        m = 15;
+                      }
+                    } else {
+                      y = 0;
+                      x = 0;
+                      w = m;
+                      v = n;
+                      g = z;
+                      m = 15;
+                    }
+                  } else {
+                    y = 0;
+                    x = 0;
+                    w = 0;
+                    v = n;
+                    g = z;
+                    m = 15;
+                  }
+                } else {
+                  y = 0;
+                  x = 0;
+                  w = 0;
+                  v = 0;
+                  g = z;
+                  m = 15;
+                }
+              while (0);
+              do
+                if ((m | 0) == 15) {
+                  b: while (1) {
+                    c: do
+                      if (!g) {
+                        o = 0;
+                        e = $(25, b | 0) | 0;
+                        g = o;
+                        o = 0;
+                        if (((g | 0) != 0) & ((p | 0) != 0)) {
+                          h = V6(c[g >> 2] | 0, G | 0, F | 0) | 0;
+                          if (!h) bb(g | 0, p | 0);
+                          z = p;
+                        } else h = -1;
+                        if ((h | 0) == 1) {
+                          s = v;
+                          t = w;
+                          u = x;
+                          m = y;
+                          g = z;
+                          v = s;
+                          w = t;
+                          x = u;
+                          y = m;
+                          m = 15;
+                          continue b;
+                        }
+                        u = (v + (c[B >> 2] | 0)) | 0;
+                        k = 0;
+                        m = 0;
+                        j = 0;
+                        while (1) {
+                          if (!e) break;
+                          o = 0;
+                          g = aa(c[x >> 2] | 0, e | 0, -1) | 0;
+                          h = o;
+                          o = 0;
+                          if (((h | 0) != 0) & ((p | 0) != 0)) {
+                            i = V6(c[h >> 2] | 0, G | 0, F | 0) | 0;
+                            if (!i) bb(h | 0, p | 0);
+                            z = p;
+                          } else i = -1;
+                          if ((i | 0) == 1) {
+                            s = v;
+                            t = w;
+                            u = x;
+                            m = y;
+                            g = z;
+                            v = s;
+                            w = t;
+                            x = u;
+                            y = m;
+                            m = 15;
+                            continue b;
+                          }
+                          if ((g | 0) == 0 ? (a[((c[(e + 16) >> 2] | 0) + 119) >> 0] | 0) == 3 : 0) {
+                            if (!m) {
+                              o = 0;
+                              c[D >> 2] = j;
+                              ca(30, u | 0, 137395, D | 0) | 0;
+                              g = o;
+                              o = 0;
+                              if (((g | 0) != 0) & ((p | 0) != 0)) {
+                                h = V6(c[g >> 2] | 0, G | 0, F | 0) | 0;
+                                if (!h) bb(g | 0, p | 0);
+                                z = p;
+                              } else h = -1;
+                              if ((h | 0) == 1) {
+                                s = v;
+                                t = w;
+                                u = x;
+                                m = y;
+                                g = z;
+                                v = s;
+                                w = t;
+                                x = u;
+                                y = m;
+                                m = 15;
+                                continue b;
+                              }
+                              o = 0;
+                              i = ca(31, b | 0, v | 0, 1) | 0;
+                              g = o;
+                              o = 0;
+                              if (((g | 0) != 0) & ((p | 0) != 0)) {
+                                h = V6(c[g >> 2] | 0, G | 0, F | 0) | 0;
+                                if (!h) bb(g | 0, p | 0);
+                                z = p;
+                              } else h = -1;
+                              if ((h | 0) == 1) {
+                                s = v;
+                                t = w;
+                                u = x;
+                                m = y;
+                                g = z;
+                                v = s;
+                                w = t;
+                                x = u;
+                                y = m;
+                                m = 15;
+                                continue b;
+                              }
+                              o = 0;
+                              da(53, i | 0, 137483, 280, 1) | 0;
+                              g = o;
+                              o = 0;
+                              if (((g | 0) != 0) & ((p | 0) != 0)) {
+                                h = V6(c[g >> 2] | 0, G | 0, F | 0) | 0;
+                                if (!h) bb(g | 0, p | 0);
+                                z = p;
+                              } else h = -1;
+                              if ((h | 0) == 1) {
+                                s = v;
+                                t = w;
+                                u = x;
+                                m = y;
+                                g = z;
+                                v = s;
+                                w = t;
+                                x = u;
+                                y = m;
+                                m = 15;
+                                continue b;
+                              }
+                              c[(y + (j << 2)) >> 2] = i;
+                              k = 1;
+                              j = (j + 1) | 0;
+                            } else i = m;
+                            o = 0;
+                            da(54, b | 0, e | 0, i | 0, C | 0) | 0;
+                            g = o;
+                            o = 0;
+                            if (((g | 0) != 0) & ((p | 0) != 0)) {
+                              h = V6(c[g >> 2] | 0, G | 0, F | 0) | 0;
+                              if (!h) bb(g | 0, p | 0);
+                              z = p;
+                            } else h = -1;
+                            if ((h | 0) == 1) {
+                              s = v;
+                              t = w;
+                              u = x;
+                              m = y;
+                              g = z;
+                              v = s;
+                              w = t;
+                              x = u;
+                              y = m;
+                              m = 15;
+                              continue b;
+                            }
+                          } else i = m;
+                          o = 0;
+                          e = aa(86, b | 0, e | 0) | 0;
+                          g = o;
+                          o = 0;
+                          if (((g | 0) != 0) & ((p | 0) != 0)) {
+                            h = V6(c[g >> 2] | 0, G | 0, F | 0) | 0;
+                            if (!h) bb(g | 0, p | 0);
+                            z = p;
+                          } else h = -1;
+                          if ((h | 0) == 1) {
+                            s = v;
+                            t = w;
+                            u = x;
+                            m = y;
+                            g = z;
+                            v = s;
+                            w = t;
+                            x = u;
+                            y = m;
+                            m = 15;
+                            continue b;
+                          }
+                          m = i;
+                        }
+                        o = 0;
+                        e = $(25, b | 0) | 0;
+                        g = o;
+                        o = 0;
+                        if (((g | 0) != 0) & ((p | 0) != 0)) {
+                          h = V6(c[g >> 2] | 0, G | 0, F | 0) | 0;
+                          if (!h) bb(g | 0, p | 0);
+                          z = p;
+                        } else h = -1;
+                        if ((h | 0) == 1) {
+                          s = v;
+                          t = w;
+                          u = x;
+                          m = y;
+                          g = z;
+                          v = s;
+                          w = t;
+                          x = u;
+                          y = m;
+                          m = 15;
+                          continue b;
+                        }
+                        i = 10;
+                        n = y;
+                        q = w;
+                        r = w;
+                        t = w;
+                        while (1) {
+                          if (!e) {
+                            m = 0;
+                            i = r;
+                            e = t;
+                            break c;
+                          }
+                          o = 0;
+                          g = aa(c[x >> 2] | 0, e | 0, -1) | 0;
+                          h = o;
+                          o = 0;
+                          if (((h | 0) != 0) & ((p | 0) != 0)) {
+                            m = V6(c[h >> 2] | 0, G | 0, F | 0) | 0;
+                            if (!m) bb(h | 0, p | 0);
+                            z = p;
+                          } else m = -1;
+                          if ((m | 0) == 1) {
+                            s = v;
+                            t = w;
+                            u = x;
+                            m = y;
+                            g = z;
+                            v = s;
+                            w = t;
+                            x = u;
+                            y = m;
+                            m = 15;
+                            continue b;
+                          }
+                          if (!g) {
+                            o = 0;
+                            c[E >> 2] = j;
+                            ca(30, u | 0, 137395, E | 0) | 0;
+                            g = o;
+                            o = 0;
+                            if (((g | 0) != 0) & ((p | 0) != 0)) {
+                              h = V6(c[g >> 2] | 0, G | 0, F | 0) | 0;
+                              if (!h) bb(g | 0, p | 0);
+                              z = p;
+                            } else h = -1;
+                            if ((h | 0) == 1) {
+                              s = v;
+                              t = w;
+                              u = x;
+                              m = y;
+                              g = z;
+                              v = s;
+                              w = t;
+                              x = u;
+                              y = m;
+                              m = 15;
+                              continue b;
+                            }
+                            o = 0;
+                            s = ca(31, b | 0, v | 0, 1) | 0;
+                            g = o;
+                            o = 0;
+                            if (((g | 0) != 0) & ((p | 0) != 0)) {
+                              h = V6(c[g >> 2] | 0, G | 0, F | 0) | 0;
+                              if (!h) bb(g | 0, p | 0);
+                              z = p;
+                            } else h = -1;
+                            if ((h | 0) == 1) {
+                              s = v;
+                              t = w;
+                              u = x;
+                              m = y;
+                              g = z;
+                              v = s;
+                              w = t;
+                              x = u;
+                              y = m;
+                              m = 15;
+                              continue b;
+                            }
+                            o = 0;
+                            da(53, s | 0, 137483, 280, 1) | 0;
+                            h = o;
+                            o = 0;
+                            if (((h | 0) != 0) & ((p | 0) != 0)) {
+                              g = V6(c[h >> 2] | 0, G | 0, F | 0) | 0;
+                              if (!g) bb(h | 0, p | 0);
+                              z = p;
+                            } else g = -1;
+                            if ((g | 0) == 1) {
+                              s = v;
+                              t = w;
+                              u = x;
+                              m = y;
+                              g = z;
+                              v = s;
+                              w = t;
+                              x = u;
+                              y = m;
+                              m = 15;
+                              continue b;
+                            }
+                            o = 0;
+                            da(54, b | 0, e | 0, s | 0, C | 0) | 0;
+                            g = o;
+                            o = 0;
+                            if (((g | 0) != 0) & ((p | 0) != 0)) {
+                              h = V6(c[g >> 2] | 0, G | 0, F | 0) | 0;
+                              if (!h) bb(g | 0, p | 0);
+                              z = p;
+                            } else h = -1;
+                            if ((h | 0) == 1) {
+                              s = v;
+                              t = w;
+                              u = x;
+                              m = y;
+                              g = z;
+                              v = s;
+                              w = t;
+                              x = u;
+                              y = m;
+                              m = 15;
+                              continue b;
+                            }
+                            if ((j | 0) == (i | 0)) {
+                              i = j << 1;
+                              o = 0;
+                              m = aa(87, q | 0, (j << 3) | 0) | 0;
+                              g = o;
+                              o = 0;
+                              if (((g | 0) != 0) & ((p | 0) != 0)) {
+                                h = V6(c[g >> 2] | 0, G | 0, F | 0) | 0;
+                                if (!h) bb(g | 0, p | 0);
+                                z = p;
+                              } else h = -1;
+                              if ((h | 0) == 1) {
+                                s = v;
+                                t = w;
+                                u = x;
+                                m = y;
+                                g = z;
+                                v = s;
+                                w = t;
+                                x = u;
+                                y = m;
+                                m = 15;
+                                continue b;
+                              }
+                              g = m;
+                              q = m;
+                              r = m;
+                              h = m;
+                            } else {
+                              g = n;
+                              h = t;
+                            }
+                            c[(g + (j << 2)) >> 2] = s;
+                            n = g;
+                            j = (j + 1) | 0;
+                            m = h;
+                          } else m = t;
+                          o = 0;
+                          e = aa(86, b | 0, e | 0) | 0;
+                          g = o;
+                          o = 0;
+                          if (((g | 0) != 0) & ((p | 0) != 0)) {
+                            h = V6(c[g >> 2] | 0, G | 0, F | 0) | 0;
+                            if (!h) bb(g | 0, p | 0);
+                            z = p;
+                          } else h = -1;
+                          if ((h | 0) == 1) {
+                            s = v;
+                            t = w;
+                            u = x;
+                            m = y;
+                            g = z;
+                            v = s;
+                            w = t;
+                            x = u;
+                            y = m;
+                            m = 15;
+                            continue b;
+                          }
+                          t = m;
+                        }
+                      } else {
+                        m = 1;
+                        k = 0;
+                        n = y;
+                        j = 0;
+                        i = w;
+                        e = w;
+                      }
+                    while (0);
+                    o = 0;
+                    ia(108, C | 0);
+                    g = o;
+                    o = 0;
+                    if (((g | 0) != 0) & ((p | 0) != 0)) {
+                      h = V6(c[g >> 2] | 0, G | 0, F | 0) | 0;
+                      if (!h) bb(g | 0, p | 0);
+                      z = p;
+                    } else h = -1;
+                    if ((h | 0) == 1) {
+                      s = v;
+                      t = w;
+                      u = x;
+                      m = y;
+                      g = z;
+                      v = s;
+                      w = t;
+                      x = u;
+                      y = m;
+                      m = 15;
+                      continue;
+                    }
+                    if ((v | 0) != (A | 0)) {
+                      o = 0;
+                      ia(105, v | 0);
+                      g = o;
+                      o = 0;
+                      if (((g | 0) != 0) & ((p | 0) != 0)) {
+                        h = V6(c[g >> 2] | 0, G | 0, F | 0) | 0;
+                        if (!h) bb(g | 0, p | 0);
+                        z = p;
+                      } else h = -1;
+                      if ((h | 0) == 1) {
+                        s = v;
+                        t = w;
+                        u = x;
+                        m = y;
+                        g = z;
+                        v = s;
+                        w = t;
+                        x = u;
+                        y = m;
+                        m = 15;
+                        continue;
+                      }
+                    }
+                    if (!m) {
+                      o = 0;
+                      g = aa(87, e | 0, (j << 2) | 0) | 0;
+                      h = o;
+                      o = 0;
+                      if (((h | 0) != 0) & ((p | 0) != 0)) {
+                        e = V6(c[h >> 2] | 0, G | 0, F | 0) | 0;
+                        if (!e) bb(h | 0, p | 0);
+                        z = p;
+                      } else e = -1;
+                      if ((e | 0) == 1) {
+                        s = v;
+                        t = w;
+                        u = x;
+                        m = y;
+                        g = z;
+                        v = s;
+                        w = t;
+                        x = u;
+                        y = m;
+                        m = 15;
+                        continue;
+                      } else {
+                        m = 58;
+                        break;
+                      }
+                    }
+                    c[d >> 2] = 0;
+                    g = 0;
+                    while (1) {
+                      if ((g | 0) >= (j | 0)) break;
+                      o = 0;
+                      $(26, c[(n + (g << 2)) >> 2] | 0) | 0;
+                      h = o;
+                      o = 0;
+                      if (((h | 0) != 0) & ((p | 0) != 0)) {
+                        e = V6(c[h >> 2] | 0, G | 0, F | 0) | 0;
+                        if (!e) bb(h | 0, p | 0);
+                        z = p;
+                      } else e = -1;
+                      if ((e | 0) == 1) {
+                        s = v;
+                        t = w;
+                        u = x;
+                        m = y;
+                        g = z;
+                        v = s;
+                        w = t;
+                        x = u;
+                        y = m;
+                        m = 15;
+                        continue b;
+                      }
+                      g = (g + 1) | 0;
+                    }
+                    o = 0;
+                    ia(105, i | 0);
+                    g = o;
+                    o = 0;
+                    if (((g | 0) != 0) & ((p | 0) != 0)) {
+                      h = V6(c[g >> 2] | 0, G | 0, F | 0) | 0;
+                      if (!h) bb(g | 0, p | 0);
+                      z = p;
+                    } else h = -1;
+                    if ((h | 0) == 1) {
+                      s = v;
+                      t = w;
+                      u = x;
+                      m = y;
+                      g = z;
+                      v = s;
+                      w = t;
+                      x = u;
+                      y = m;
+                      m = 15;
+                    } else {
+                      m = 56;
+                      break;
+                    }
+                  }
+                  if ((m | 0) == 56) {
+                    g = 0;
+                    break;
+                  } else if ((m | 0) == 58) {
+                    c[d >> 2] = j;
+                    a[f >> 0] = k;
+                    break;
+                  }
+                }
+              while (0);
+              U1(G | 0);
+              l = H;
+              return g | 0;
+            }
+            function tG(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              if (!((a | 0) != 0 ? (CG(a) | 0) != 0 : 0)) a = 98988;
+              e = l2(a) | 0;
+              if ((e | 0) >= 104) {
+                d = KK((e + 25) | 0) | 0;
+                if (!d) d = 0;
+                else f = 6;
+              } else f = 6;
+              if ((f | 0) == 6) {
+                r3(d, a) | 0;
+                c[b >> 2] = e;
+              }
+              return d | 0;
+            }
+            function uG(a, b) {
+              a = a | 0;
+              b = b | 0;
+              oC(b, a, 1) | 0;
+              return;
+            }
+            function vG(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              b = ((c[(b + 16) >> 2] | 0) + 157) | 0;
+              e = a[b >> 0] | 0;
+              if ((d | 0) >= 0) a[b >> 0] = d;
+              return e | 0;
+            }
+            function wG(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              c[b >> 2] = d;
+              c[(b + 4) >> 2] = d + 4096;
+              c[(b + 12) >> 2] = 0;
+              c[(b + 8) >> 2] = 0;
+              c[a >> 2] = b;
+              c[(a + 4) >> 2] = b;
+              c[(a + 8) >> 2] = d;
+              c[(a + 12) >> 2] = e;
+              c[(a + 16) >> 2] = f;
+              return;
+            }
+            function xG(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              AG(e, b);
+              i = (e + 12) | 0;
+              j = (e + 16) | 0;
+              b = 0;
+              a: while (1) {
+                k = BG(e) | 0;
+                if (!k) break;
+                b = (b + 1) | 0;
+                f = c[i >> 2] | 0;
+                if (f | 0) ub[f & 63](k, d);
+                h = aB(a, k) | 0;
+                while (1) {
+                  if (!h) continue a;
+                  g = c[h >> 2] & 3;
+                  f = c[(((g | 0) == 3 ? h : (h + 48) | 0) + 40) >> 2] | 0;
+                  if ((f | 0) == (k | 0)) f = c[(((g | 0) == 2 ? h : (h + -48) | 0) + 40) >> 2] | 0;
+                  if (!(lb[c[j >> 2] & 127](f, -1) | 0)) AG(e, f);
+                  h = bB(a, h, k) | 0;
+                }
+              }
+              return b | 0;
+            }
+            function yG(a) {
+              a = a | 0;
+              var b = 0;
+              a = c[((c[a >> 2] | 0) + 12) >> 2] | 0;
+              while (1) {
+                if (!a) break;
+                b = c[(a + 12) >> 2] | 0;
+                zG(a);
+                a = b;
+              }
+              return;
+            }
+            function zG(a) {
+              a = a | 0;
+              U1(c[a >> 2] | 0);
+              U1(a);
+              return;
+            }
+            function AG(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 16) | 0;
+              j = (k + 8) | 0;
+              f = k;
+              g = (a + 8) | 0;
+              i = (a + 4) | 0;
+              d = c[i >> 2] | 0;
+              if ((c[g >> 2] | 0) == (c[(d + 4) >> 2] | 0)) {
+                d = c[(d + 12) >> 2] | 0;
+                do
+                  if (!d) {
+                    e = KK(16) | 0;
+                    if (!e) {
+                      gA(1, 98969, f) | 0;
+                      bb(188068, 1);
+                    }
+                    c[(e + 8) >> 2] = c[i >> 2];
+                    c[(e + 12) >> 2] = 0;
+                    d = KK(4e6) | 0;
+                    c[e >> 2] = d;
+                    if (!d) {
+                      gA(1, 98969, j) | 0;
+                      bb(188068, 1);
+                    } else {
+                      c[(e + 4) >> 2] = d + 4e6;
+                      c[((c[i >> 2] | 0) + 12) >> 2] = e;
+                      h = e;
+                      break;
+                    }
+                  } else h = d;
+                while (0);
+                c[i >> 2] = h;
+                c[g >> 2] = c[h >> 2];
+              }
+              lb[c[(a + 16) >> 2] & 127](b, 1) | 0;
+              j = c[g >> 2] | 0;
+              c[g >> 2] = j + 4;
+              c[j >> 2] = b;
+              l = k;
+              return;
+            }
+            function BG(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              f = (a + 8) | 0;
+              b = c[f >> 2] | 0;
+              d = (a + 4) | 0;
+              e = c[d >> 2] | 0;
+              if ((b | 0) == (c[e >> 2] | 0))
+                if ((e | 0) == (c[a >> 2] | 0)) b = 0;
+                else {
+                  b = c[(e + 8) >> 2] | 0;
+                  c[d >> 2] = b;
+                  b = c[(b + 4) >> 2] | 0;
+                  c[f >> 2] = b;
+                  g = 4;
+                }
+              else g = 4;
+              if ((g | 0) == 4) {
+                b = (b + -4) | 0;
+                c[f >> 2] = b;
+                b = c[b >> 2] | 0;
+              }
+              return b | 0;
+            }
+            function CG(b) {
+              b = b | 0;
+              var c = 0;
+              a: while (1) {
+                c = b;
+                b = (b + 1) | 0;
+                c = a[c >> 0] | 0;
+                switch ((c << 24) >> 24) {
+                  case 95:
+                    continue a;
+                  case 0: {
+                    b = 1;
+                    break a;
+                  }
+                  default: {
+                  }
+                }
+                if (!(a3(c & 255) | 0)) {
+                  b = 0;
+                  break;
+                }
+              }
+              return b | 0;
+            }
+            function DG(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                A = 0,
+                B = 0;
+              B = l;
+              l = (l + 4272) | 0;
+              x = B;
+              y = 4;
+              A = T1(40) | 0;
+              c[A >> 2] = 0;
+              u = (B + 4144) | 0;
+              v = (B + 4140) | 0;
+              w = (B + 4120) | 0;
+              h = (B + 4104) | 0;
+              i = (B + 8) | 0;
+              o = 0;
+              f = $(24, a | 0) | 0;
+              g = o;
+              o = 0;
+              if (((g | 0) != 0) & ((p | 0) != 0)) {
+                e = V6(c[g >> 2] | 0, A | 0, y | 0) | 0;
+                if (!e) bb(g | 0, p | 0);
+                z = p;
+              } else e = -1;
+              a: do
+                if ((e | 0) != 1)
+                  if (f) {
+                    o = 0;
+                    k = ca(29, d | 0, v | 0, u | 0) | 0;
+                    e = o;
+                    o = 0;
+                    if (((e | 0) != 0) & ((p | 0) != 0)) {
+                      d = V6(c[e >> 2] | 0, A | 0, y | 0) | 0;
+                      if (!d) bb(e | 0, p | 0);
+                      z = p;
+                    } else d = -1;
+                    if ((d | 0) != 1) {
+                      o = 0;
+                      j = $(23, 40) | 0;
+                      e = o;
+                      o = 0;
+                      if (((e | 0) != 0) & ((p | 0) != 0)) {
+                        d = V6(c[e >> 2] | 0, A | 0, y | 0) | 0;
+                        if (!d) bb(e | 0, p | 0);
+                        z = p;
+                      } else d = -1;
+                      if ((d | 0) != 1) {
+                        o = 0;
+                        na(7, w | 0, h | 0, i | 0, 24, 85);
+                        e = o;
+                        o = 0;
+                        if (((e | 0) != 0) & ((p | 0) != 0)) {
+                          d = V6(c[e >> 2] | 0, A | 0, y | 0) | 0;
+                          if (!d) bb(e | 0, p | 0);
+                          z = p;
+                        } else d = -1;
+                        if ((d | 0) != 1) {
+                          o = 0;
+                          f = $(25, a | 0) | 0;
+                          e = o;
+                          o = 0;
+                          if (((e | 0) != 0) & ((p | 0) != 0)) {
+                            d = V6(c[e >> 2] | 0, A | 0, y | 0) | 0;
+                            if (!d) bb(e | 0, p | 0);
+                            z = p;
+                          } else d = -1;
+                          if ((d | 0) != 1) {
+                            h = (w + 16) | 0;
+                            g = c[h >> 2] | 0;
+                            e = f;
+                            while (1) {
+                              if (!e) break;
+                              o = 0;
+                              aa(g | 0, e | 0, 0) | 0;
+                              d = o;
+                              o = 0;
+                              if (((d | 0) != 0) & ((p | 0) != 0)) {
+                                f = V6(c[d >> 2] | 0, A | 0, y | 0) | 0;
+                                if (!f) bb(d | 0, p | 0);
+                                z = p;
+                              } else f = -1;
+                              if ((f | 0) == 1) {
+                                t = h;
+                                s = j;
+                                r = k;
+                                e = z;
+                                j = 14;
+                                break a;
+                              }
+                              o = 0;
+                              e = aa(86, a | 0, e | 0) | 0;
+                              d = o;
+                              o = 0;
+                              if (((d | 0) != 0) & ((p | 0) != 0)) {
+                                f = V6(c[d >> 2] | 0, A | 0, y | 0) | 0;
+                                if (!f) bb(d | 0, p | 0);
+                                z = p;
+                              } else f = -1;
+                              if ((f | 0) == 1) {
+                                t = h;
+                                s = j;
+                                r = k;
+                                e = z;
+                                j = 14;
+                                break a;
+                              }
+                            }
+                            A = U6(188068, 1, A | 0, y | 0) | 0;
+                            y = z;
+                            o = 0;
+                            e = o;
+                            o = 0;
+                            if (((e | 0) != 0) & ((p | 0) != 0)) {
+                              d = V6(c[e >> 2] | 0, A | 0, y | 0) | 0;
+                              if (!d) bb(e | 0, p | 0);
+                              z = p;
+                            } else d = -1;
+                            if ((d | 0) == 1) {
+                              t = h;
+                              s = j;
+                              r = k;
+                              e = z;
+                              j = 14;
+                            } else {
+                              t = h;
+                              s = j;
+                              r = k;
+                              e = 0;
+                              j = 14;
+                            }
+                          } else {
+                            t = 0;
+                            s = j;
+                            r = k;
+                            e = z;
+                            j = 14;
+                          }
+                        } else {
+                          t = 0;
+                          s = j;
+                          r = k;
+                          e = z;
+                          j = 14;
+                        }
+                      } else {
+                        t = 0;
+                        s = j;
+                        r = k;
+                        e = z;
+                        j = 14;
+                      }
+                    } else {
+                      t = 0;
+                      s = 0;
+                      r = k;
+                      e = z;
+                      j = 14;
+                    }
+                  } else {
+                    d = 0;
+                    e = 0;
+                  }
+                else {
+                  t = 0;
+                  s = 0;
+                  r = 0;
+                  e = z;
+                  j = 14;
+                }
+              while (0);
+              b: do
+                if ((j | 0) == 14) {
+                  c: while (1) {
+                    if (e | 0) {
+                      o = 0;
+                      ia(108, w | 0);
+                      e = o;
+                      o = 0;
+                      if (((e | 0) != 0) & ((p | 0) != 0)) {
+                        d = V6(c[e >> 2] | 0, A | 0, y | 0) | 0;
+                        if (!d) bb(e | 0, p | 0);
+                        z = p;
+                      } else d = -1;
+                      if ((d | 0) == 1) {
+                        n = r;
+                        q = s;
+                        j = t;
+                        e = z;
+                        r = n;
+                        s = q;
+                        t = j;
+                        j = 14;
+                        continue;
+                      }
+                      o = 0;
+                      ia(105, s | 0);
+                      e = o;
+                      o = 0;
+                      if (((e | 0) != 0) & ((p | 0) != 0)) {
+                        d = V6(c[e >> 2] | 0, A | 0, y | 0) | 0;
+                        if (!d) bb(e | 0, p | 0);
+                        z = p;
+                      } else d = -1;
+                      if ((d | 0) == 1) {
+                        n = r;
+                        q = s;
+                        j = t;
+                        e = z;
+                        r = n;
+                        s = q;
+                        t = j;
+                        j = 14;
+                        continue;
+                      }
+                      if ((r | 0) == (u | 0)) {
+                        d = 0;
+                        e = 0;
+                        break b;
+                      }
+                      o = 0;
+                      ia(105, r | 0);
+                      e = o;
+                      o = 0;
+                      if (((e | 0) != 0) & ((p | 0) != 0)) {
+                        d = V6(c[e >> 2] | 0, A | 0, y | 0) | 0;
+                        if (!d) bb(e | 0, p | 0);
+                        z = p;
+                      } else d = -1;
+                      if ((d | 0) == 1) {
+                        n = r;
+                        q = s;
+                        j = t;
+                        e = z;
+                        r = n;
+                        s = q;
+                        t = j;
+                        j = 14;
+                        continue;
+                      } else {
+                        j = 19;
+                        break;
+                      }
+                    }
+                    o = 0;
+                    f = $(25, a | 0) | 0;
+                    e = o;
+                    o = 0;
+                    if (((e | 0) != 0) & ((p | 0) != 0)) {
+                      d = V6(c[e >> 2] | 0, A | 0, y | 0) | 0;
+                      if (!d) bb(e | 0, p | 0);
+                      z = p;
+                    } else d = -1;
+                    if ((d | 0) == 1) {
+                      n = r;
+                      q = s;
+                      j = t;
+                      e = z;
+                      r = n;
+                      s = q;
+                      t = j;
+                      j = 14;
+                      continue;
+                    }
+                    q = (r + (c[v >> 2] | 0)) | 0;
+                    h = 10;
+                    k = s;
+                    e = 0;
+                    j = s;
+                    n = s;
+                    while (1) {
+                      if (!f) break;
+                      o = 0;
+                      d = aa(c[t >> 2] | 0, f | 0, -1) | 0;
+                      g = o;
+                      o = 0;
+                      if (((g | 0) != 0) & ((p | 0) != 0)) {
+                        i = V6(c[g >> 2] | 0, A | 0, y | 0) | 0;
+                        if (!i) bb(g | 0, p | 0);
+                        z = p;
+                      } else i = -1;
+                      if ((i | 0) == 1) {
+                        n = r;
+                        q = s;
+                        j = t;
+                        e = z;
+                        r = n;
+                        s = q;
+                        t = j;
+                        j = 14;
+                        continue c;
+                      }
+                      if (!d) {
+                        o = 0;
+                        c[x >> 2] = e;
+                        ca(30, q | 0, 137395, x | 0) | 0;
+                        d = o;
+                        o = 0;
+                        if (((d | 0) != 0) & ((p | 0) != 0)) {
+                          g = V6(c[d >> 2] | 0, A | 0, y | 0) | 0;
+                          if (!g) bb(d | 0, p | 0);
+                          z = p;
+                        } else g = -1;
+                        if ((g | 0) == 1) {
+                          n = r;
+                          q = s;
+                          j = t;
+                          e = z;
+                          r = n;
+                          s = q;
+                          t = j;
+                          j = 14;
+                          continue c;
+                        }
+                        o = 0;
+                        m = ca(31, a | 0, r | 0, 1) | 0;
+                        d = o;
+                        o = 0;
+                        if (((d | 0) != 0) & ((p | 0) != 0)) {
+                          g = V6(c[d >> 2] | 0, A | 0, y | 0) | 0;
+                          if (!g) bb(d | 0, p | 0);
+                          z = p;
+                        } else g = -1;
+                        if ((g | 0) == 1) {
+                          n = r;
+                          q = s;
+                          j = t;
+                          e = z;
+                          r = n;
+                          s = q;
+                          t = j;
+                          j = 14;
+                          continue c;
+                        }
+                        o = 0;
+                        da(53, m | 0, 137483, 280, 1) | 0;
+                        d = o;
+                        o = 0;
+                        if (((d | 0) != 0) & ((p | 0) != 0)) {
+                          g = V6(c[d >> 2] | 0, A | 0, y | 0) | 0;
+                          if (!g) bb(d | 0, p | 0);
+                          z = p;
+                        } else g = -1;
+                        if ((g | 0) == 1) {
+                          n = r;
+                          q = s;
+                          j = t;
+                          e = z;
+                          r = n;
+                          s = q;
+                          t = j;
+                          j = 14;
+                          continue c;
+                        }
+                        o = 0;
+                        da(54, a | 0, f | 0, m | 0, w | 0) | 0;
+                        d = o;
+                        o = 0;
+                        if (((d | 0) != 0) & ((p | 0) != 0)) {
+                          g = V6(c[d >> 2] | 0, A | 0, y | 0) | 0;
+                          if (!g) bb(d | 0, p | 0);
+                          z = p;
+                        } else g = -1;
+                        if ((g | 0) == 1) {
+                          n = r;
+                          q = s;
+                          j = t;
+                          e = z;
+                          r = n;
+                          s = q;
+                          t = j;
+                          j = 14;
+                          continue c;
+                        }
+                        if ((e | 0) == (h | 0)) {
+                          h = e << 1;
+                          o = 0;
+                          i = aa(87, j | 0, (e << 3) | 0) | 0;
+                          d = o;
+                          o = 0;
+                          if (((d | 0) != 0) & ((p | 0) != 0)) {
+                            g = V6(c[d >> 2] | 0, A | 0, y | 0) | 0;
+                            if (!g) bb(d | 0, p | 0);
+                            z = p;
+                          } else g = -1;
+                          if ((g | 0) == 1) {
+                            n = r;
+                            q = s;
+                            j = t;
+                            e = z;
+                            r = n;
+                            s = q;
+                            t = j;
+                            j = 14;
+                            continue c;
+                          }
+                          g = i;
+                          j = i;
+                          d = i;
+                        } else {
+                          g = k;
+                          d = n;
+                        }
+                        c[(g + (e << 2)) >> 2] = m;
+                        e = (e + 1) | 0;
+                        k = g;
+                        i = d;
+                      } else i = n;
+                      o = 0;
+                      f = aa(86, a | 0, f | 0) | 0;
+                      d = o;
+                      o = 0;
+                      if (((d | 0) != 0) & ((p | 0) != 0)) {
+                        g = V6(c[d >> 2] | 0, A | 0, y | 0) | 0;
+                        if (!g) bb(d | 0, p | 0);
+                        z = p;
+                      } else g = -1;
+                      if ((g | 0) == 1) {
+                        n = r;
+                        q = s;
+                        j = t;
+                        e = z;
+                        r = n;
+                        s = q;
+                        t = j;
+                        j = 14;
+                        continue c;
+                      }
+                      n = i;
+                    }
+                    o = 0;
+                    ia(108, w | 0);
+                    d = o;
+                    o = 0;
+                    if (((d | 0) != 0) & ((p | 0) != 0)) {
+                      f = V6(c[d >> 2] | 0, A | 0, y | 0) | 0;
+                      if (!f) bb(d | 0, p | 0);
+                      z = p;
+                    } else f = -1;
+                    if ((f | 0) == 1) {
+                      n = r;
+                      q = s;
+                      j = t;
+                      e = z;
+                      r = n;
+                      s = q;
+                      t = j;
+                      j = 14;
+                      continue;
+                    }
+                    o = 0;
+                    d = aa(87, n | 0, (e << 2) | 0) | 0;
+                    f = o;
+                    o = 0;
+                    if (((f | 0) != 0) & ((p | 0) != 0)) {
+                      g = V6(c[f >> 2] | 0, A | 0, y | 0) | 0;
+                      if (!g) bb(f | 0, p | 0);
+                      z = p;
+                    } else g = -1;
+                    if ((g | 0) == 1) {
+                      n = r;
+                      q = s;
+                      j = t;
+                      e = z;
+                      r = n;
+                      s = q;
+                      t = j;
+                      j = 14;
+                      continue;
+                    }
+                    if ((r | 0) == (u | 0)) break b;
+                    o = 0;
+                    ia(105, r | 0);
+                    f = o;
+                    o = 0;
+                    if (((f | 0) != 0) & ((p | 0) != 0)) {
+                      g = V6(c[f >> 2] | 0, A | 0, y | 0) | 0;
+                      if (!g) bb(f | 0, p | 0);
+                      z = p;
+                    } else g = -1;
+                    if ((g | 0) == 1) {
+                      n = r;
+                      q = s;
+                      j = t;
+                      e = z;
+                      r = n;
+                      s = q;
+                      t = j;
+                      j = 14;
+                    } else {
+                      j = 39;
+                      break;
+                    }
+                  }
+                  if ((j | 0) == 19) {
+                    d = 0;
+                    e = 0;
+                    break;
+                  } else if ((j | 0) == 39) break;
+                }
+              while (0);
+              c[b >> 2] = e;
+              U1(A | 0);
+              l = B;
+              return d | 0;
+            }
+            function EG(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              d = 0;
+              f = jC(a) | 0;
+              while (1) {
+                if (!f) break;
+                e = XA(b, f) | 0;
+                while (1) {
+                  if (!e) break;
+                  if (oC(a, c[((((c[e >> 2] & 3) | 0) == 2 ? e : (e + -48) | 0) + 40) >> 2] | 0, 0) | 0) {
+                    mB(a, e, 1) | 0;
+                    d = (d + 1) | 0;
+                  }
+                  e = ZA(b, e) | 0;
+                }
+                f = kC(a, f) | 0;
+              }
+              return d | 0;
+            }
+            function FG(a) {
+              a = a | 0;
+              a = RC(a, 98993, 0) | 0;
+              if (!a) qa(98998, 99001, 529, 99010);
+              else return c[(a + 8) >> 2] | 0;
+              return 0;
+            }
+            function GG(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0;
+              u = l;
+              l = (l + 4320) | 0;
+              s = (u + 24) | 0;
+              r = (u + 8) | 0;
+              q = u;
+              t = (u + 4184) | 0;
+              p = (u + 4160) | 0;
+              f = (u + 40) | 0;
+              if (tB(b) | 0) {
+                YC(b, 0, 99019, -12, 0);
+                YC(b, 1, 99031, 16, 0);
+                o = tG(e, f, t) | 0;
+                k = HG(b) | 0;
+                m = KK((tB(k) | 0) << 2) | 0;
+                wG(p, (u + 4144) | 0, (u + 48) | 0, 24, 88);
+                h = jC(k) | 0;
+                n = (p + 16) | 0;
+                i = (o + (c[f >> 2] | 0)) | 0;
+                j = c[15712] | 0;
+                e = 0;
+                while (1) {
+                  if (!h) break;
+                  if (!(lb[c[n >> 2] & 127](h, -1) | 0)) {
+                    c[q >> 2] = e;
+                    m4(i, 99933, q) | 0;
+                    v = ND(k, o, 1) | 0;
+                    w = ND(b, o, 1) | 0;
+                    TC(w, 99019, 12, 0) | 0;
+                    a[((RC(w, 99019, 0) | 0) + 8) >> 0] = 1;
+                    f = xG(k, h, v, p) | 0;
+                    JG(v, w);
+                    g = KG(w) | 0;
+                    LG(b, w);
+                    c[(m + (e << 2)) >> 2] = w;
+                    wC(k, v) | 0;
+                    if (0) {
+                      c[r >> 2] = e;
+                      c[(r + 4) >> 2] = f;
+                      c[(r + 8) >> 2] = g;
+                      w4(j, 99043, r) | 0;
+                    }
+                    e = (e + 1) | 0;
+                  }
+                  h = kC(k, h) | 0;
+                }
+                if (0) {
+                  r = tB(b) | 0;
+                  v = uB(b) | 0;
+                  w = KB(b) | 0;
+                  c[s >> 2] = r;
+                  c[(s + 4) >> 2] = v;
+                  c[(s + 8) >> 2] = e;
+                  c[(s + 12) >> 2] = w;
+                  w4(j, 99073, s) | 0;
+                }
+                sB(k) | 0;
+                ZC(b, 0, 99019);
+                ZC(b, 1, 99031);
+                yG(p);
+                f = MK(m, e << 2) | 0;
+                if ((o | 0) != (t | 0)) U1(o);
+              } else {
+                f = 0;
+                e = 0;
+              }
+              c[d >> 2] = e;
+              l = u;
+              return f | 0;
+            }
+            function HG(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 16) | 0;
+              h = i;
+              a[h >> 0] = a[18596] | 0;
+              a[(h + 1) >> 0] = a[18597] | 0;
+              a[(h + 2) >> 0] = a[18598] | 0;
+              a[(h + 3) >> 0] = a[18599] | 0;
+              h = oB(99120, h, 0) | 0;
+              OG(h, b);
+              d = jC(b) | 0;
+              while (1) {
+                if (!d) break;
+                if (!(c[((RC(d, 99031, 0) | 0) + 12) >> 2] | 0)) {
+                  g = tC(h, KB(d) | 0, 1) | 0;
+                  TC(g, 99031, 16, 1) | 0;
+                  c[((c[(g + 16) >> 2] | 0) + 12) >> 2] = d;
+                  c[((RC(d, 99031, 0) | 0) + 12) >> 2] = g;
+                }
+                d = kC(b, d) | 0;
+              }
+              e = jC(b) | 0;
+              while (1) {
+                if (!e) break;
+                f = c[((RC(e, 99031, 0) | 0) + 12) >> 2] | 0;
+                d = XA(b, e) | 0;
+                while (1) {
+                  if (!d) break;
+                  g =
+                    c[
+                      ((RC(c[((((c[d >> 2] & 3) | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0, 99031, 0) | 0) + 12) >>
+                        2
+                    ] | 0;
+                  do
+                    if ((g | 0) != (f | 0))
+                      if (g >>> 0 > f >>> 0) {
+                        iB(h, f, g, 0, 1) | 0;
+                        break;
+                      } else {
+                        iB(h, g, f, 0, 1) | 0;
+                        break;
+                      }
+                  while (0);
+                  d = ZA(b, d) | 0;
+                }
+                e = kC(b, e) | 0;
+              }
+              l = i;
+              return h | 0;
+            }
+            function IG(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              b = ((c[(b + 16) >> 2] | 0) + 8) | 0;
+              e = a[b >> 0] | 0;
+              if ((d | 0) >= 0) a[b >> 0] = d;
+              return e | 0;
+            }
+            function JG(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              e = jC(a) | 0;
+              while (1) {
+                if (!e) break;
+                f = c[((c[(e + 16) >> 2] | 0) + 12) >> 2] | 0;
+                a: do
+                  if (((c[f >> 2] & 3) | 0) == 1) oC(b, f, 1) | 0;
+                  else {
+                    d = jC(f) | 0;
+                    while (1) {
+                      if (!d) break a;
+                      oC(b, d, 1) | 0;
+                      d = kC(f, d) | 0;
+                    }
+                  }
+                while (0);
+                e = kC(a, e) | 0;
+              }
+              return;
+            }
+            function KG(a) {
+              a = a | 0;
+              return EG(a, c[(a + 60) >> 2] | 0) | 0;
+            }
+            function LG(a, b) {
+              a = a | 0;
+              b = b | 0;
+              MG(a, b, 0);
+              return;
+            }
+            function MG(b, c, d) {
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              g = (d | 0) == 0;
+              b = OD(b) | 0;
+              while (1) {
+                if (!b) break;
+                if ((a[((RC(b, 99019, 0) | 0) + 8) >> 0] | 0) == 0 ? ((f = NG(b, c, d) | 0), f | 0) : 0) {
+                  if (g) e = (Q2(KB(b) | 0, 108006, 7) | 0) == 0;
+                  else e = 1;
+                  MG(b, f, e & 1);
+                }
+                b = PD(b) | 0;
+              }
+              return;
+            }
+            function NG(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              e = 0;
+              g = jC(a) | 0;
+              while (1) {
+                if (!g) break;
+                f = tC(b, KB(g) | 0, 0) | 0;
+                if (f) {
+                  if (!e) e = ND(b, KB(a) | 0, 1) | 0;
+                  oC(e, f, 1) | 0;
+                }
+                g = kC(a, g) | 0;
+              }
+              if (((d | 0) != 0) & ((e | 0) == 0)) e = ND(b, KB(a) | 0, 1) | 0;
+              if (e | 0 ? (EG(e, a) | 0, UA(a, e) | 0, (Q2(KB(e) | 0, 108006, 7) | 0) == 0) : 0)
+                c[((TC(e, 98993, 12, 0) | 0) + 8) >> 2] = a;
+              return e | 0;
+            }
+            function OG(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              h = l;
+              l = (l + 16) | 0;
+              g = h;
+              d = OD(b) | 0;
+              e = c[15712] | 0;
+              while (1) {
+                if (!d) break;
+                a: do
+                  if (!(Q2(KB(d) | 0, 108006, 7) | 0)) {
+                    f = tC(a, KB(d) | 0, 1) | 0;
+                    TC(f, 99031, 16, 1) | 0;
+                    c[((c[(f + 16) >> 2] | 0) + 12) >> 2] = d;
+                    b = jC(d) | 0;
+                    while (1) {
+                      if (!b) break a;
+                      if (c[((RC(b, 99031, 0) | 0) + 12) >> 2] | 0) {
+                        k = KB(b) | 0;
+                        j = KB(d) | 0;
+                        i = KB(c[((RC(b, 99031, 0) | 0) + 12) >> 2] | 0) | 0;
+                        c[g >> 2] = k;
+                        c[(g + 4) >> 2] = j;
+                        c[(g + 8) >> 2] = i;
+                        w4(e, 99123, g) | 0;
+                      }
+                      c[((RC(b, 99031, 0) | 0) + 12) >> 2] = f;
+                      b = kC(d, b) | 0;
+                    }
+                  } else OG(a, d);
+                while (0);
+                d = PD(d) | 0;
+              }
+              l = h;
+              return;
+            }
+            function PG(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0.0;
+              n = +h[a >> 3];
+              j = ~~(n + (n >= 0.0 ? 0.5 : -0.5));
+              n = +h[(a + 8) >> 3];
+              a = ~~(n + (n >= 0.0 ? 0.5 : -0.5));
+              n = +h[b >> 3];
+              g = ~~(n + (n >= 0.0 ? 0.5 : -0.5));
+              n = +h[(b + 8) >> 3];
+              f = ~~(n + (n >= 0.0 ? 0.5 : -0.5));
+              l = (g - j) | 0;
+              i = ((l | 0) > -1 ? l : (0 - l) | 0) << 1;
+              l = (l >> 31) | 1;
+              m = (f - a) | 0;
+              k = ((m | 0) > -1 ? m : (0 - m) | 0) << 1;
+              m = (m >> 31) | 1;
+              a: do
+                if ((i | 0) > (k | 0)) {
+                  e = (0 - i) | 0;
+                  d = (k - (i >> 1)) | 0;
+                  b = j;
+                  while (1) {
+                    QL(c, b, a);
+                    if ((b | 0) == (g | 0)) break a;
+                    j = (d | 0) > -1;
+                    d = (d + k + (j ? e : 0)) | 0;
+                    b = (b + l) | 0;
+                    a = ((j ? m : 0) + a) | 0;
+                  }
+                } else {
+                  e = (0 - k) | 0;
+                  d = j;
+                  b = (i - (k >> 1)) | 0;
+                  while (1) {
+                    QL(c, d, a);
+                    if ((a | 0) == (f | 0)) break a;
+                    k = (b | 0) > -1;
+                    d = ((k ? l : 0) + d) | 0;
+                    b = (b + i + (k ? e : 0)) | 0;
+                    a = (a + m) | 0;
+                  }
+                }
+              while (0);
+              return;
+            }
+            function QG(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              n = l;
+              l = (l + 16) | 0;
+              k = n;
+              j = (n + 4) | 0;
+              do
+                if ((a | 0) < 1) d = 0;
+                else {
+                  f = (e + 16) | 0;
+                  if ((c[f >> 2] | 0) >>> 0 < 4) {
+                    d = RG(a, b, d, e) | 0;
+                    break;
+                  }
+                  m = KK(a << 5) | 0;
+                  d = 0;
+                  while (1) {
+                    if ((d | 0) == (a | 0)) break;
+                    g = c[(b + (d << 2)) >> 2] | 0;
+                    BP(g);
+                    h = (m + (d << 5)) | 0;
+                    g = ((c[(g + 16) >> 2] | 0) + 16) | 0;
+                    c[h >> 2] = c[g >> 2];
+                    c[(h + 4) >> 2] = c[(g + 4) >> 2];
+                    c[(h + 8) >> 2] = c[(g + 8) >> 2];
+                    c[(h + 12) >> 2] = c[(g + 12) >> 2];
+                    c[(h + 16) >> 2] = c[(g + 16) >> 2];
+                    c[(h + 20) >> 2] = c[(g + 20) >> 2];
+                    c[(h + 24) >> 2] = c[(g + 24) >> 2];
+                    c[(h + 28) >> 2] = c[(g + 28) >> 2];
+                    d = (d + 1) | 0;
+                  }
+                  if ((c[f >> 2] | 0) == 4) {
+                    h = (e + 28) | 0;
+                    a: do
+                      if ((c[h >> 2] & 2) | 0) {
+                        f = (e + 24) | 0;
+                        c[f >> 2] = JK(a << 2) | 0;
+                        d = 0;
+                        while (1) {
+                          if ((d | 0) == (a | 0)) break a;
+                          g = QA(c[(b + (d << 2)) >> 2] | 0, 99190) | 0;
+                          if (
+                            g | 0
+                              ? ((c[k >> 2] = j),
+                                (g = (b5(g, 137395, k) | 0) > 0),
+                                (i = c[j >> 2] | 0),
+                                g & ((i | 0) > -1))
+                              : 0
+                          )
+                            c[((c[f >> 2] | 0) + (d << 2)) >> 2] = i;
+                          d = (d + 1) | 0;
+                        }
+                      }
+                    while (0);
+                    d = SG(a, m, e) | 0;
+                    if (c[h >> 2] & 2) U1(c[(e + 24) >> 2] | 0);
+                  } else d = 0;
+                  U1(m);
+                }
+              while (0);
+              l = n;
+              return d | 0;
+            }
+            function RG(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0.0,
+                I = 0.0,
+                J = 0.0,
+                K = 0.0;
+              G = l;
+              l = (l + 144) | 0;
+              B = (G + 136) | 0;
+              A = (G + 64) | 0;
+              F = (G + 48) | 0;
+              v = (G + 40) | 0;
+              u = G;
+              t = (G + 120) | 0;
+              x = (G + 104) | 0;
+              C = (G + 96) | 0;
+              D = c[(f + 20) >> 2] | 0;
+              c[x >> 2] = 0;
+              c[(x + 4) >> 2] = 0;
+              c[(x + 8) >> 2] = 0;
+              c[(x + 12) >> 2] = 0;
+              a: do
+                if ((b | 0) >= 1) {
+                  o = (D | 0) == 0;
+                  E = c[15712] | 0;
+                  p = (t + 4) | 0;
+                  q = (t + 8) | 0;
+                  r = (t + 12) | 0;
+                  y = (x + 4) | 0;
+                  w = (x + 8) | 0;
+                  z = (x + 12) | 0;
+                  n = 0;
+                  g = 0;
+                  while (1) {
+                    if ((n | 0) == (b | 0)) break;
+                    s = c[(d + (n << 2)) >> 2] | 0;
+                    BP(s);
+                    if (!o ? (a[(D + n) >> 0] | 0) != 0 : 0) {
+                      m = c[(s + 16) >> 2] | 0;
+                      H = +h[(m + 16) >> 3];
+                      i = ~~(H + (H >= 0.0 ? 0.5 : -0.5));
+                      c[t >> 2] = i;
+                      H = +h[(m + 24) >> 3];
+                      j = ~~(H + (H >= 0.0 ? 0.5 : -0.5));
+                      c[p >> 2] = j;
+                      H = +h[(m + 32) >> 3];
+                      k = ~~(H + (H >= 0.0 ? 0.5 : -0.5));
+                      c[q >> 2] = k;
+                      H = +h[(m + 40) >> 3];
+                      m = ~~(H + (H >= 0.0 ? 0.5 : -0.5));
+                      c[r >> 2] = m;
+                      if (!g) {
+                        c[x >> 2] = c[t >> 2];
+                        c[(x + 4) >> 2] = c[(t + 4) >> 2];
+                        c[(x + 8) >> 2] = c[(t + 8) >> 2];
+                        c[(x + 12) >> 2] = c[(t + 12) >> 2];
+                      } else {
+                        c[x >> 2] = c[((c[x >> 2] | 0) > (i | 0) ? t : x) >> 2];
+                        c[y >> 2] = c[(((c[y >> 2] | 0) > (j | 0) ? t : x) + 4) >> 2];
+                        c[w >> 2] = c[(((c[w >> 2] | 0) < (k | 0) ? t : x) + 8) >> 2];
+                        c[z >> 2] = c[(((c[z >> 2] | 0) < (m | 0) ? t : x) + 12) >> 2];
+                      }
+                      g = (g + 1) | 0;
+                    }
+                    if (0 > 2) {
+                      m = KB(s) | 0;
+                      s = c[(s + 16) >> 2] | 0;
+                      K = +h[(s + 16) >> 3];
+                      J = +h[(s + 24) >> 3];
+                      I = +h[(s + 32) >> 3];
+                      H = +h[(s + 40) >> 3];
+                      c[u >> 2] = m;
+                      h[(u + 8) >> 3] = K;
+                      h[(u + 16) >> 3] = J;
+                      h[(u + 24) >> 3] = I;
+                      h[(u + 32) >> 3] = H;
+                      w4(E, 99257, u) | 0;
+                    }
+                    n = (n + 1) | 0;
+                  }
+                  q = KK(b << 5) | 0;
+                  g = 0;
+                  while (1) {
+                    if ((g | 0) == (b | 0)) break;
+                    u = (q + (g << 5)) | 0;
+                    t = ((c[((c[(d + (g << 2)) >> 2] | 0) + 16) >> 2] | 0) + 16) | 0;
+                    c[u >> 2] = c[t >> 2];
+                    c[(u + 4) >> 2] = c[(t + 4) >> 2];
+                    c[(u + 8) >> 2] = c[(t + 8) >> 2];
+                    c[(u + 12) >> 2] = c[(t + 12) >> 2];
+                    c[(u + 16) >> 2] = c[(t + 16) >> 2];
+                    c[(u + 20) >> 2] = c[(t + 20) >> 2];
+                    c[(u + 24) >> 2] = c[(t + 24) >> 2];
+                    c[(u + 28) >> 2] = c[(t + 28) >> 2];
+                    g = (g + 1) | 0;
+                  }
+                  o = (f + 8) | 0;
+                  p = VG(b, q, c[o >> 2] | 0) | 0;
+                  if (0) {
+                    c[v >> 2] = p;
+                    w4(E, 99285, v) | 0;
+                  }
+                  if ((p | 0) >= 1) {
+                    n = (D | 0) != 0;
+                    if (n) {
+                      i = ((((c[w >> 2] | 0) + (c[x >> 2] | 0)) | 0) / 2) | 0;
+                      g = ((((c[z >> 2] | 0) + (c[y >> 2] | 0)) | 0) / 2) | 0;
+                    } else {
+                      i = 0;
+                      g = 0;
+                    }
+                    c[(C + 4) >> 2] = g;
+                    c[C >> 2] = i;
+                    m = JK(b << 4) | 0;
+                    k = (f + 16) | 0;
+                    g = 0;
+                    while (1) {
+                      if ((g | 0) >= (b | 0)) break;
+                      i = c[(d + (g << 2)) >> 2] | 0;
+                      j = (m + (g << 4)) | 0;
+                      c[(m + (g << 4) + 12) >> 2] = g;
+                      if ((c[k >> 2] | 0) == 3) {
+                        x = ((c[(i + 16) >> 2] | 0) + 16) | 0;
+                        y = c[o >> 2] | 0;
+                        z = KB(i) | 0;
+                        c[A >> 2] = c[x >> 2];
+                        c[(A + 4) >> 2] = c[(x + 4) >> 2];
+                        c[(A + 8) >> 2] = c[(x + 8) >> 2];
+                        c[(A + 12) >> 2] = c[(x + 12) >> 2];
+                        c[(A + 16) >> 2] = c[(x + 16) >> 2];
+                        c[(A + 20) >> 2] = c[(x + 20) >> 2];
+                        c[(A + 24) >> 2] = c[(x + 24) >> 2];
+                        c[(A + 28) >> 2] = c[(x + 28) >> 2];
+                        c[B >> 2] = c[C >> 2];
+                        c[(B + 4) >> 2] = c[(C + 4) >> 2];
+                        WG(A, j, p, y, B, z);
+                      } else {
+                        c[B >> 2] = c[C >> 2];
+                        c[(B + 4) >> 2] = c[(C + 4) >> 2];
+                        XG(e, i, j, p, f, B);
+                      }
+                      g = (g + 1) | 0;
+                    }
+                    j = JK(b << 2) | 0;
+                    g = 0;
+                    while (1) {
+                      if ((g | 0) >= (b | 0)) break;
+                      c[(j + (g << 2)) >> 2] = m + (g << 4);
+                      g = (g + 1) | 0;
+                    }
+                    o4(j, b, 4, 89);
+                    k = KL() | 0;
+                    g = JK(b << 3) | 0;
+                    b: do
+                      if (n) {
+                        i = 0;
+                        while (1) {
+                          if ((i | 0) >= (b | 0)) {
+                            i = 0;
+                            break;
+                          }
+                          if (a[(D + i) >> 0] | 0) {
+                            e = c[(j + (i << 2)) >> 2] | 0;
+                            f = (g + (c[(e + 12) >> 2] << 3)) | 0;
+                            c[B >> 2] = c[C >> 2];
+                            c[(B + 4) >> 2] = c[(C + 4) >> 2];
+                            ZG(e, k, f, B);
+                          }
+                          i = (i + 1) | 0;
+                        }
+                        while (1) {
+                          if ((i | 0) >= (b | 0)) break b;
+                          if (!(a[(D + i) >> 0] | 0)) {
+                            C = c[(j + (i << 2)) >> 2] | 0;
+                            _G(i, C, k, (g + (c[(C + 12) >> 2] << 3)) | 0, p, c[o >> 2] | 0, q);
+                          }
+                          i = (i + 1) | 0;
+                        }
+                      } else {
+                        i = 0;
+                        while (1) {
+                          if ((i | 0) >= (b | 0)) break b;
+                          D = c[(j + (i << 2)) >> 2] | 0;
+                          _G(i, D, k, (g + (c[(D + 12) >> 2] << 3)) | 0, p, c[o >> 2] | 0, q);
+                          i = (i + 1) | 0;
+                        }
+                      }
+                    while (0);
+                    U1(j);
+                    i = 0;
+                    while (1) {
+                      if ((i | 0) >= (b | 0)) break;
+                      U1(c[(m + (i << 4) + 4) >> 2] | 0);
+                      i = (i + 1) | 0;
+                    }
+                    U1(m);
+                    NL(k);
+                    U1(q);
+                    if (0 > 1) {
+                      i = 0;
+                      while (1) {
+                        if ((i | 0) >= (b | 0)) break a;
+                        C = c[(g + (i << 3)) >> 2] | 0;
+                        D = c[(g + (i << 3) + 4) >> 2] | 0;
+                        c[F >> 2] = i;
+                        c[(F + 4) >> 2] = C;
+                        c[(F + 8) >> 2] = D;
+                        w4(E, 99301, F) | 0;
+                        i = (i + 1) | 0;
+                      }
+                    }
+                  } else g = 0;
+                } else g = 0;
+              while (0);
+              l = G;
+              return g | 0;
+            }
+            function SG(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0;
+              z = l;
+              l = (l + 16) | 0;
+              g = z;
+              x = JK(a << 3) | 0;
+              f = c[(d + 4) >> 2] | 0;
+              y = (d + 28) | 0;
+              e = (f | 0) > 0;
+              do
+                if (!(c[y >> 2] & 1))
+                  if (e) {
+                    k = 1;
+                    w = (((a + -1 + f) | 0) / (f | 0)) | 0;
+                    break;
+                  } else {
+                    f = ~~+N(+(+C(+(+(a | 0)))));
+                    k = 1;
+                    w = (((a + -1 + f) | 0) / (f | 0)) | 0;
+                    break;
+                  }
+                else if (e) {
+                  k = 0;
+                  w = f;
+                  f = (((a + -1 + f) | 0) / (f | 0)) | 0;
+                  break;
+                } else {
+                  f = ~~+N(+(+C(+(+(a | 0)))));
+                  k = 0;
+                  w = f;
+                  f = (((a + -1 + f) | 0) / (f | 0)) | 0;
+                  break;
+                }
+              while (0);
+              if (0) {
+                v = c[15712] | 0;
+                c[g >> 2] = k | 0 ? 99196 : 99206;
+                c[(g + 4) >> 2] = w;
+                c[(g + 8) >> 2] = f;
+                w4(v, 99219, g) | 0;
+              }
+              t = JK(((f << 3) + 8) | 0) | 0;
+              u = JK(((w << 3) + 8) | 0) | 0;
+              v = JK((a * 24) | 0) | 0;
+              j = (d + 8) | 0;
+              e = 0;
+              g = v;
+              while (1) {
+                if ((e | 0) >= (a | 0)) break;
+                p = +h[(b + (e << 5) + 8) >> 3];
+                o = +h[(b + (e << 5) + 24) >> 3];
+                q = +((c[j >> 2] | 0) >>> 0);
+                h[g >> 3] = +h[(b + (e << 5) + 16) >> 3] - +h[(b + (e << 5)) >> 3] + q;
+                h[(g + 8) >> 3] = o - p + q;
+                c[(g + 16) >> 2] = e;
+                e = (e + 1) | 0;
+                g = (g + 24) | 0;
+              }
+              s = JK(a << 2) | 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (a | 0)) break;
+                c[(s + (e << 2)) >> 2] = v + ((e * 24) | 0);
+                e = (e + 1) | 0;
+              }
+              e = c[(d + 24) >> 2] | 0;
+              if (!e) {
+                if (!(c[y >> 2] & 64)) o4(s, a, 4, 91);
+              } else {
+                c[47056] = e;
+                o4(s, a, 4, 90);
+              }
+              r = (k | 0) == 0;
+              e = 0;
+              g = 0;
+              j = 0;
+              while (1) {
+                if ((j | 0) >= (a | 0)) {
+                  i = 0.0;
+                  e = 0;
+                  break;
+                }
+                k = c[(s + (j << 2)) >> 2] | 0;
+                d = (t + (g << 3)) | 0;
+                q = +h[d >> 3];
+                p = +h[k >> 3];
+                h[d >> 3] = q > p ? q : p;
+                d = (u + (e << 3)) | 0;
+                p = +h[d >> 3];
+                q = +h[(k + 8) >> 3];
+                h[d >> 3] = p > q ? p : q;
+                if (r) {
+                  e = (e + 1) | 0;
+                  d = (e | 0) == (w | 0);
+                  e = d ? 0 : e;
+                  g = (g + (d & 1)) | 0;
+                } else {
+                  g = (g + 1) | 0;
+                  d = (g | 0) == (f | 0);
+                  e = (e + (d & 1)) | 0;
+                  g = d ? 0 : g;
+                }
+                j = (j + 1) | 0;
+              }
+              while (1) {
+                if ((e | 0) > (f | 0)) {
+                  i = 0.0;
+                  e = w;
+                  break;
+                }
+                d = (t + (e << 3)) | 0;
+                q = +h[d >> 3];
+                h[d >> 3] = i;
+                i = q + i;
+                e = (e + 1) | 0;
+              }
+              while (1) {
+                if ((e | 0) <= 0) break;
+                d = (e + -1) | 0;
+                q = +h[(u + (d << 3)) >> 3];
+                h[(u + (e << 3)) >> 3] = i;
+                i = q + i;
+                e = d;
+              }
+              h[u >> 3] = i;
+              e = 0;
+              g = 0;
+              d = 0;
+              while (1) {
+                if ((d | 0) >= (a | 0)) break;
+                k = c[((c[(s + (d << 2)) >> 2] | 0) + 16) >> 2] | 0;
+                i = +h[(b + (k << 5)) >> 3];
+                m = -i;
+                p = +h[(b + (k << 5) + 8) >> 3];
+                q = -p;
+                n = +h[(b + (k << 5) + 16) >> 3];
+                o = +h[(b + (k << 5) + 24) >> 3];
+                j = c[y >> 2] | 0;
+                do
+                  if (!(j & 4))
+                    if (!(j & 8)) {
+                      i = (m - n + +h[(t + (g << 3)) >> 3] + +h[(t + ((g + 1) << 3)) >> 3]) * 0.5;
+                      break;
+                    } else {
+                      i = i - n + +h[(t + ((g + 1) << 3)) >> 3];
+                      break;
+                    }
+                  else i = +h[(t + (g << 3)) >> 3];
+                while (0);
+                c[(x + (k << 3)) >> 2] = ~~i;
+                do
+                  if (!(j & 16))
+                    if (!(j & 32)) {
+                      i = (q - o + +h[(u + (e << 3)) >> 3] + +h[(u + ((e + 1) << 3)) >> 3]) * 0.5;
+                      break;
+                    } else {
+                      i = +h[(u + ((e + 1) << 3)) >> 3];
+                      break;
+                    }
+                  else i = p - o + +h[(u + (e << 3)) >> 3];
+                while (0);
+                c[(x + (k << 3) + 4) >> 2] = ~~i;
+                if (r) {
+                  e = (e + 1) | 0;
+                  k = (e | 0) == (w | 0);
+                  e = k ? 0 : e;
+                  g = (g + (k & 1)) | 0;
+                } else {
+                  g = (g + 1) | 0;
+                  k = (g | 0) == (f | 0);
+                  e = (e + (k & 1)) | 0;
+                  g = k ? 0 : g;
+                }
+                d = (d + 1) | 0;
+              }
+              U1(v);
+              U1(s);
+              U1(t);
+              U1(u);
+              l = z;
+              return x | 0;
+            }
+            function TG(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = c[47056] | 0;
+              a = c[(d + (c[((c[a >> 2] | 0) + 16) >> 2] << 2)) >> 2] | 0;
+              b = c[(d + (c[((c[b >> 2] | 0) + 16) >> 2] << 2)) >> 2] | 0;
+              return ((a | 0) > (b | 0) ? 1 : (((a | 0) < (b | 0)) << 31) >> 31) | 0;
+            }
+            function UG(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0.0;
+              a = c[a >> 2] | 0;
+              b = c[b >> 2] | 0;
+              e = +h[a >> 3] + +h[(a + 8) >> 3];
+              d = +h[b >> 3] + +h[(b + 8) >> 3];
+              return (e < d ? 1 : ((e > d) << 31) >> 31) | 0;
+            }
+            function VG(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0,
+                m = 0,
+                n = 0.0,
+                o = 0.0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0;
+              s = l;
+              l = (l + 96) | 0;
+              q = (s + 80) | 0;
+              r = (s + 48) | 0;
+              p = (s + 8) | 0;
+              m = s;
+              k = (((a * 100) | 0) + -1) | 0;
+              e = +((d << 1) | 0);
+              n = 0.0;
+              o = 0.0;
+              d = 0;
+              while (1) {
+                if ((d | 0) >= (a | 0)) break;
+                j = +h[(b + (d << 5) + 16) >> 3] - +h[(b + (d << 5)) >> 3] + e;
+                i = +h[(b + (d << 5) + 24) >> 3] - +h[(b + (d << 5) + 8) >> 3] + e;
+                n = n - j - i;
+                o = o - i * j;
+                d = (d + 1) | 0;
+              }
+              i = +(k | 0);
+              j = n * n - i * 4.0 * o;
+              if (!(j < 0.0)) {
+                e = +C(+j);
+                g = i * 2.0;
+                f = (e - n) / g;
+                g = (-n - e) / g;
+                d = ~~f;
+                d = (d | 0) == 0 ? 1 : d;
+                if (0 > 2) {
+                  m = c[15712] | 0;
+                  U4(99444, 27, 1, m) | 0;
+                  h[p >> 3] = i;
+                  h[(p + 8) >> 3] = n;
+                  h[(p + 16) >> 3] = o;
+                  h[(p + 24) >> 3] = j;
+                  h[(p + 32) >> 3] = e;
+                  w4(m, 99472, p) | 0;
+                  c[r >> 2] = d;
+                  h[(r + 8) >> 3] = f;
+                  c[(r + 16) >> 2] = ~~g;
+                  h[(r + 24) >> 3] = g;
+                  w4(m, 99498, r) | 0;
+                  h[q >> 3] = (f * i + n) * f + o;
+                  h[(q + 8) >> 3] = (g * i + n) * g + o;
+                  w4(m, 99520, q) | 0;
+                }
+              } else {
+                h[m >> 3] = j;
+                gA(1, 99417, m) | 0;
+                d = -1;
+              }
+              l = s;
+              return d | 0;
+            }
+            function WG(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0.0,
+                w = 0.0;
+              u = l;
+              l = (l + 32) | 0;
+              t = (u + 16) | 0;
+              s = u;
+              p = +h[a >> 3];
+              q = +h[(a + 8) >> 3];
+              n = +h[(a + 16) >> 3];
+              o = +h[(a + 24) >> 3];
+              r = KL() | 0;
+              j = c[f >> 2] | 0;
+              a = (j - e) | 0;
+              k = c[(f + 4) >> 2] | 0;
+              i = (k - e) | 0;
+              j = (e - ~~(p + (p >= 0.0 ? 0.5 : -0.5)) + j + ~~(n + (n >= 0.0 ? 0.5 : -0.5))) | 0;
+              k = (e - ~~(q + (q >= 0.0 ? 0.5 : -0.5)) + k + ~~(o + (o >= 0.0 ? 0.5 : -0.5))) | 0;
+              if ((a | 0) > -1) f = ((a | 0) / (d | 0)) | 0;
+              else f = (((((a + 1) | 0) / (d | 0)) | 0) + -1) | 0;
+              if ((i | 0) > -1) m = ((i | 0) / (d | 0)) | 0;
+              else m = (((((i + 1) | 0) / (d | 0)) | 0) + -1) | 0;
+              if ((j | 0) > -1) j = ((j | 0) / (d | 0)) | 0;
+              else j = (((((j + 1) | 0) / (d | 0)) | 0) + -1) | 0;
+              if ((k | 0) > -1) i = ((k | 0) / (d | 0)) | 0;
+              else i = (((((k + 1) | 0) / (d | 0)) | 0) + -1) | 0;
+              while (1) {
+                if ((f | 0) > (j | 0)) break;
+                else a = m;
+                while (1) {
+                  if ((a | 0) > (i | 0)) break;
+                  QL(r, f, a);
+                  a = (a + 1) | 0;
+                }
+                f = (f + 1) | 0;
+              }
+              k = (b + 4) | 0;
+              c[k >> 2] = UL(r) | 0;
+              j = TL(r) | 0;
+              m = (b + 8) | 0;
+              c[m >> 2] = j;
+              w = +((e << 1) | 0);
+              v = +(d | 0);
+              i = ~~+N(+((n + w - p) / v));
+              a = ~~+N(+((o + w - q) / v));
+              c[b >> 2] = a + i;
+              a: do
+                if (0 > 2) {
+                  f = c[15712] | 0;
+                  c[s >> 2] = g;
+                  c[(s + 4) >> 2] = j;
+                  c[(s + 8) >> 2] = i;
+                  c[(s + 12) >> 2] = a;
+                  w4(f, 99376, s) | 0;
+                  a = 0;
+                  while (1) {
+                    if ((a | 0) >= (c[m >> 2] | 0)) break a;
+                    g = c[k >> 2] | 0;
+                    s = c[(g + (a << 3) + 4) >> 2] | 0;
+                    c[t >> 2] = c[(g + (a << 3)) >> 2];
+                    c[(t + 4) >> 2] = s;
+                    w4(f, 99403, t) | 0;
+                    a = (a + 1) | 0;
+                  }
+                }
+              while (0);
+              NL(r);
+              l = u;
+              return;
+            }
+            function XG(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0.0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                O = 0,
+                P = 0,
+                Q = 0.0,
+                R = 0.0;
+              P = l;
+              l = (l + 128) | 0;
+              F = (P + 112) | 0;
+              E = (P + 104) | 0;
+              O = (P + 16) | 0;
+              M = P;
+              H = (P + 64) | 0;
+              I = (P + 56) | 0;
+              z = (P + 40) | 0;
+              A = (P + 96) | 0;
+              y = (P + 88) | 0;
+              v = (P + 24) | 0;
+              w = (P + 80) | 0;
+              x = (P + 72) | 0;
+              K = c[(f + 8) >> 2] | 0;
+              G = c[(f + 12) >> 2] | 0;
+              C = (a | 0) == 0 ? b : a;
+              L = KL() | 0;
+              J = (b + 16) | 0;
+              B = c[J >> 2] | 0;
+              t = +h[(B + 16) >> 3];
+              D = ((c[g >> 2] | 0) - ~~(t + (t >= 0.0 ? 0.5 : -0.5))) | 0;
+              t = +h[(B + 24) >> 3];
+              B = ((c[(g + 4) >> 2] | 0) - ~~(t + (t >= 0.0 ? 0.5 : -0.5))) | 0;
+              a: do
+                if ((c[(f + 16) >> 2] | 0) == 1) {
+                  v = KK((tB(b) | 0) << 2) | 0;
+                  a = 0;
+                  g = jC(b) | 0;
+                  while (1) {
+                    if (!g) break;
+                    x = (g + 16) | 0;
+                    c[(v + (a << 2)) >> 2] = c[((c[x >> 2] | 0) + 112) >> 2];
+                    c[((c[x >> 2] | 0) + 112) >> 2] = 0;
+                    a = (a + 1) | 0;
+                    g = kC(b, g) | 0;
+                  }
+                  o = (D - K) | 0;
+                  p = (B - K) | 0;
+                  q = (D + K) | 0;
+                  r = (B + K) | 0;
+                  n = 1;
+                  while (1) {
+                    a = c[J >> 2] | 0;
+                    if ((n | 0) > (c[(a + 180) >> 2] | 0)) break;
+                    m = c[((c[(a + 184) >> 2] | 0) + (n << 2)) >> 2] | 0;
+                    i = c[(m + 16) >> 2] | 0;
+                    t = +h[(i + 16) >> 3];
+                    a = ~~(t + (t >= 0.0 ? 0.5 : -0.5));
+                    t = +h[(i + 24) >> 3];
+                    g = ~~(t + (t >= 0.0 ? 0.5 : -0.5));
+                    t = +h[(i + 32) >> 3];
+                    f = ~~(t + (t >= 0.0 ? 0.5 : -0.5));
+                    t = +h[(i + 40) >> 3];
+                    i = ~~(t + (t >= 0.0 ? 0.5 : -0.5));
+                    b: do
+                      if (((f | 0) > (a | 0)) & ((i | 0) > (g | 0))) {
+                        a = (o + a) | 0;
+                        j = (p + g) | 0;
+                        f = (q + f) | 0;
+                        k = (r + i) | 0;
+                        if ((a | 0) > -1) g = ((a | 0) / (e | 0)) | 0;
+                        else g = (((((a + 1) | 0) / (e | 0)) | 0) + -1) | 0;
+                        if ((j | 0) > -1) j = ((j | 0) / (e | 0)) | 0;
+                        else j = (((((j + 1) | 0) / (e | 0)) | 0) + -1) | 0;
+                        if ((f | 0) > -1) i = ((f | 0) / (e | 0)) | 0;
+                        else i = (((((f + 1) | 0) / (e | 0)) | 0) + -1) | 0;
+                        if ((k | 0) > -1) f = ((k | 0) / (e | 0)) | 0;
+                        else f = (((((k + 1) | 0) / (e | 0)) | 0) + -1) | 0;
+                        while (1) {
+                          if ((g | 0) > (i | 0)) break;
+                          else a = j;
+                          while (1) {
+                            if ((a | 0) > (f | 0)) break;
+                            QL(L, g, a);
+                            a = (a + 1) | 0;
+                          }
+                          g = (g + 1) | 0;
+                        }
+                        a = jC(m) | 0;
+                        while (1) {
+                          if (!a) break b;
+                          c[((c[(a + 16) >> 2] | 0) + 212) >> 2] = m;
+                          a = kC(m, a) | 0;
+                        }
+                      }
+                    while (0);
+                    n = (n + 1) | 0;
+                  }
+                  r = (z + 8) | 0;
+                  s = (H + 4) | 0;
+                  t = +(K | 0);
+                  u = (I + 4) | 0;
+                  q = (A + 4) | 0;
+                  p = (y + 4) | 0;
+                  o = jC(b) | 0;
+                  while (1) {
+                    if (!o) break;
+                    jP(z, o);
+                    R = +h[z >> 3];
+                    Q = +h[r >> 3];
+                    m = (D + ~~(R + (R >= 0.0 ? 0.5 : -0.5))) | 0;
+                    c[H >> 2] = m;
+                    n = (B + ~~(Q + (Q >= 0.0 ? 0.5 : -0.5))) | 0;
+                    c[s >> 2] = n;
+                    g = (o + 16) | 0;
+                    a = c[g >> 2] | 0;
+                    c: do
+                      if (!(c[(a + 212) >> 2] | 0)) {
+                        c[I >> 2] = ~~((+h[(a + 96) >> 3] + +h[(a + 88) >> 3]) * 0.5 + t);
+                        c[u >> 2] = ~~(+h[(a + 80) >> 3] * 0.5 + t);
+                        c[E >> 2] = c[H >> 2];
+                        c[(E + 4) >> 2] = c[(H + 4) >> 2];
+                        c[F >> 2] = c[I >> 2];
+                        c[(F + 4) >> 2] = c[(I + 4) >> 2];
+                        aH(A, E, F);
+                        a = c[A >> 2] | 0;
+                        f = c[q >> 2] | 0;
+                        c[E >> 2] = c[H >> 2];
+                        c[(E + 4) >> 2] = c[(H + 4) >> 2];
+                        c[F >> 2] = c[I >> 2];
+                        c[(F + 4) >> 2] = c[(I + 4) >> 2];
+                        bH(y, E, F);
+                        i = c[y >> 2] | 0;
+                        j = c[p >> 2] | 0;
+                        if ((a | 0) > -1) g = ((a | 0) / (e | 0)) | 0;
+                        else g = (((((a + 1) | 0) / (e | 0)) | 0) + -1) | 0;
+                        if ((f | 0) > -1) k = ((f | 0) / (e | 0)) | 0;
+                        else k = (((((f + 1) | 0) / (e | 0)) | 0) + -1) | 0;
+                        if ((i | 0) > -1) i = ((i | 0) / (e | 0)) | 0;
+                        else i = (((((i + 1) | 0) / (e | 0)) | 0) + -1) | 0;
+                        if ((j | 0) > -1) f = ((j | 0) / (e | 0)) | 0;
+                        else f = (((((j + 1) | 0) / (e | 0)) | 0) + -1) | 0;
+                        while (1) {
+                          if ((g | 0) > (i | 0)) break;
+                          else a = k;
+                          while (1) {
+                            if ((a | 0) > (f | 0)) break;
+                            QL(L, g, a);
+                            a = (a + 1) | 0;
+                          }
+                          g = (g + 1) | 0;
+                        }
+                        if ((m | 0) > -1) a = ((m | 0) / (e | 0)) | 0;
+                        else a = (((((m + 1) | 0) / (e | 0)) | 0) + -1) | 0;
+                        c[H >> 2] = a;
+                        if ((n | 0) > -1) a = ((n | 0) / (e | 0)) | 0;
+                        else a = (((((n + 1) | 0) / (e | 0)) | 0) + -1) | 0;
+                        c[s >> 2] = a;
+                        a = XA(C, o) | 0;
+                        while (1) {
+                          if (!a) break c;
+                          c[F >> 2] = c[H >> 2];
+                          c[(F + 4) >> 2] = c[(H + 4) >> 2];
+                          cH(a, F, L, D, B, e, G);
+                          a = ZA(C, a) | 0;
+                        }
+                      } else {
+                        if ((m | 0) > -1) a = ((m | 0) / (e | 0)) | 0;
+                        else a = (((((m + 1) | 0) / (e | 0)) | 0) + -1) | 0;
+                        c[H >> 2] = a;
+                        if ((n | 0) > -1) a = ((n | 0) / (e | 0)) | 0;
+                        else a = (((((n + 1) | 0) / (e | 0)) | 0) + -1) | 0;
+                        c[s >> 2] = a;
+                        a = XA(C, o) | 0;
+                        while (1) {
+                          if (!a) break c;
+                          if (
+                            (c[((c[g >> 2] | 0) + 212) >> 2] | 0) !=
+                            (c[
+                              ((c[((c[((((c[a >> 2] & 3) | 0) == 2 ? a : (a + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] |
+                                0) +
+                                212) >>
+                                2
+                            ] |
+                              0)
+                          ) {
+                            c[F >> 2] = c[H >> 2];
+                            c[(F + 4) >> 2] = c[(H + 4) >> 2];
+                            cH(a, F, L, D, B, e, G);
+                          }
+                          a = ZA(C, a) | 0;
+                        }
+                      }
+                    while (0);
+                    o = kC(b, o) | 0;
+                  }
+                  a = 0;
+                  g = jC(b) | 0;
+                  while (1) {
+                    if (!g) break;
+                    c[((c[(g + 16) >> 2] | 0) + 112) >> 2] = c[(v + (a << 2)) >> 2];
+                    a = (a + 1) | 0;
+                    g = kC(b, g) | 0;
+                  }
+                  U1(v);
+                } else {
+                  r = (v + 8) | 0;
+                  s = (H + 4) | 0;
+                  t = +(K | 0);
+                  u = (I + 4) | 0;
+                  q = (w + 4) | 0;
+                  p = (x + 4) | 0;
+                  o = jC(b) | 0;
+                  while (1) {
+                    if (!o) break a;
+                    jP(v, o);
+                    Q = +h[v >> 3];
+                    R = +h[r >> 3];
+                    m = (D + ~~(Q + (Q >= 0.0 ? 0.5 : -0.5))) | 0;
+                    c[H >> 2] = m;
+                    n = (B + ~~(R + (R >= 0.0 ? 0.5 : -0.5))) | 0;
+                    c[s >> 2] = n;
+                    a = c[(o + 16) >> 2] | 0;
+                    c[I >> 2] = ~~((+h[(a + 96) >> 3] + +h[(a + 88) >> 3]) * 0.5 + t);
+                    c[u >> 2] = ~~(+h[(a + 80) >> 3] * 0.5 + t);
+                    c[E >> 2] = c[H >> 2];
+                    c[(E + 4) >> 2] = c[(H + 4) >> 2];
+                    c[F >> 2] = c[I >> 2];
+                    c[(F + 4) >> 2] = c[(I + 4) >> 2];
+                    aH(w, E, F);
+                    a = c[w >> 2] | 0;
+                    f = c[q >> 2] | 0;
+                    c[E >> 2] = c[H >> 2];
+                    c[(E + 4) >> 2] = c[(H + 4) >> 2];
+                    c[F >> 2] = c[I >> 2];
+                    c[(F + 4) >> 2] = c[(I + 4) >> 2];
+                    bH(x, E, F);
+                    i = c[x >> 2] | 0;
+                    j = c[p >> 2] | 0;
+                    if ((a | 0) > -1) g = ((a | 0) / (e | 0)) | 0;
+                    else g = (((((a + 1) | 0) / (e | 0)) | 0) + -1) | 0;
+                    if ((f | 0) > -1) k = ((f | 0) / (e | 0)) | 0;
+                    else k = (((((f + 1) | 0) / (e | 0)) | 0) + -1) | 0;
+                    if ((i | 0) > -1) i = ((i | 0) / (e | 0)) | 0;
+                    else i = (((((i + 1) | 0) / (e | 0)) | 0) + -1) | 0;
+                    if ((j | 0) > -1) f = ((j | 0) / (e | 0)) | 0;
+                    else f = (((((j + 1) | 0) / (e | 0)) | 0) + -1) | 0;
+                    while (1) {
+                      if ((g | 0) > (i | 0)) break;
+                      else a = k;
+                      while (1) {
+                        if ((a | 0) > (f | 0)) break;
+                        QL(L, g, a);
+                        a = (a + 1) | 0;
+                      }
+                      g = (g + 1) | 0;
+                    }
+                    if ((m | 0) > -1) a = ((m | 0) / (e | 0)) | 0;
+                    else a = (((((m + 1) | 0) / (e | 0)) | 0) + -1) | 0;
+                    c[H >> 2] = a;
+                    if ((n | 0) > -1) a = ((n | 0) / (e | 0)) | 0;
+                    else a = (((((n + 1) | 0) / (e | 0)) | 0) + -1) | 0;
+                    c[s >> 2] = a;
+                    a = XA(C, o) | 0;
+                    while (1) {
+                      if (!a) break;
+                      c[F >> 2] = c[H >> 2];
+                      c[(F + 4) >> 2] = c[(H + 4) >> 2];
+                      cH(a, F, L, D, B, e, G);
+                      a = ZA(C, a) | 0;
+                    }
+                    o = kC(b, o) | 0;
+                  }
+                }
+              while (0);
+              i = (d + 4) | 0;
+              c[i >> 2] = UL(L) | 0;
+              j = (d + 8) | 0;
+              c[j >> 2] = TL(L) | 0;
+              g = c[J >> 2] | 0;
+              Q = +((K << 1) | 0);
+              R = +(e | 0);
+              a = ~~+N(+((+h[(g + 32) >> 3] + Q - +h[(g + 16) >> 3]) / R));
+              g = ~~+N(+((+h[(g + 40) >> 3] + Q - +h[(g + 24) >> 3]) / R));
+              c[d >> 2] = g + a;
+              d: do
+                if (0 > 2) {
+                  f = c[15712] | 0;
+                  d = KB(b) | 0;
+                  b = c[j >> 2] | 0;
+                  c[M >> 2] = d;
+                  c[(M + 4) >> 2] = b;
+                  c[(M + 8) >> 2] = a;
+                  c[(M + 12) >> 2] = g;
+                  w4(f, 99376, M) | 0;
+                  a = 0;
+                  while (1) {
+                    if ((a | 0) >= (c[j >> 2] | 0)) break d;
+                    b = c[i >> 2] | 0;
+                    M = c[(b + (a << 3) + 4) >> 2] | 0;
+                    c[O >> 2] = c[(b + (a << 3)) >> 2];
+                    c[(O + 4) >> 2] = M;
+                    w4(f, 99403, O) | 0;
+                    a = (a + 1) | 0;
+                  }
+                }
+              while (0);
+              NL(L);
+              l = P;
+              return;
+            }
+            function YG(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return ((c[c[b >> 2] >> 2] | 0) - (c[c[a >> 2] >> 2] | 0)) | 0;
+            }
+            function ZG(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              j = l;
+              l = (l + 32) | 0;
+              h = (j + 16) | 0;
+              i = j;
+              k = c[(a + 4) >> 2] | 0;
+              g = c[(a + 8) >> 2] | 0;
+              c[d >> 2] = 0 - (c[e >> 2] | 0);
+              f = (d + 4) | 0;
+              c[f >> 2] = 0 - (c[(e + 4) >> 2] | 0);
+              a = 0;
+              e = k;
+              while (1) {
+                if ((a | 0) >= (g | 0)) break;
+                c[h >> 2] = c[e >> 2];
+                c[(h + 4) >> 2] = c[(e + 4) >> 2];
+                OL(b, h);
+                a = (a + 1) | 0;
+                e = (e + 8) | 0;
+              }
+              if (0 > 1) {
+                k = c[15712] | 0;
+                b = c[d >> 2] | 0;
+                d = c[f >> 2] | 0;
+                c[i >> 2] = g;
+                c[(i + 4) >> 2] = b;
+                c[(i + 8) >> 2] = d;
+                w4(k, 99350, i) | 0;
+              }
+              l = j;
+              return;
+            }
+            function _G(a, b, d, e, f, g, i) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              var j = 0,
+                k = 0,
+                l = 0.0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0;
+              k = c[(b + 12) >> 2] | 0;
+              l = +h[(i + (k << 5)) >> 3];
+              m = +h[(i + (k << 5) + 8) >> 3];
+              n = +h[(i + (k << 5) + 16) >> 3];
+              o = +h[(i + (k << 5) + 24) >> 3];
+              if (
+                !((a | 0) == 0
+                  ? ((q = +((g << 1) | 0)),
+                    (p = +(f | 0)),
+                    ($G(
+                      ((~~+N(+((q - l + n) / p)) | 0) / -2) | 0,
+                      ((~~+N(+((q - m + o) / p)) | 0) / -2) | 0,
+                      b,
+                      d,
+                      e,
+                      f,
+                      i
+                    ) |
+                      0) !=
+                      0)
+                  : 0)
+              )
+                j = 3;
+              a: do
+                if ((j | 0) == 3 ? ($G(0, 0, b, d, e, f, i) | 0) == 0 : 0)
+                  if ((~~+N(+(n - l)) | 0) < (~~+N(+(o - m)) | 0)) {
+                    k = 1;
+                    while (1) {
+                      j = (0 - k) | 0;
+                      a = 0;
+                      while (1) {
+                        if ((a | 0) <= (j | 0)) {
+                          g = j;
+                          break;
+                        }
+                        if ($G(j, a, b, d, e, f, i) | 0) break a;
+                        a = (a + -1) | 0;
+                      }
+                      while (1) {
+                        if ((g | 0) >= (k | 0)) break;
+                        if ($G(g, a, b, d, e, f, i) | 0) break a;
+                        g = (g + 1) | 0;
+                      }
+                      while (1) {
+                        if ((a | 0) >= (k | 0)) break;
+                        if ($G(g, a, b, d, e, f, i) | 0) break a;
+                        a = (a + 1) | 0;
+                      }
+                      while (1) {
+                        if ((g | 0) <= (j | 0)) break;
+                        if ($G(g, a, b, d, e, f, i) | 0) break a;
+                        g = (g + -1) | 0;
+                      }
+                      while (1) {
+                        if ((a | 0) <= 0) break;
+                        if (!($G(g, a, b, d, e, f, i) | 0)) a = (a + -1) | 0;
+                        else break a;
+                      }
+                      k = (k + 1) | 0;
+                    }
+                  } else {
+                    k = 1;
+                    while (1) {
+                      j = (0 - k) | 0;
+                      a = 0;
+                      while (1) {
+                        if ((a | 0) >= (k | 0)) {
+                          g = j;
+                          break;
+                        }
+                        if ($G(a, j, b, d, e, f, i) | 0) break a;
+                        a = (a + 1) | 0;
+                      }
+                      while (1) {
+                        if ((g | 0) >= (k | 0)) break;
+                        if ($G(a, g, b, d, e, f, i) | 0) break a;
+                        g = (g + 1) | 0;
+                      }
+                      while (1) {
+                        if ((a | 0) <= (j | 0)) break;
+                        if ($G(a, g, b, d, e, f, i) | 0) break a;
+                        a = (a + -1) | 0;
+                      }
+                      while (1) {
+                        if ((g | 0) <= (j | 0)) break;
+                        if ($G(a, g, b, d, e, f, i) | 0) break a;
+                        g = (g + -1) | 0;
+                      }
+                      while (1) {
+                        if ((a | 0) >= 0) break;
+                        if (!($G(a, g, b, d, e, f, i) | 0)) a = (a + 1) | 0;
+                        else break a;
+                      }
+                      k = (k + 1) | 0;
+                    }
+                  }
+              while (0);
+              return;
+            }
+            function $G(a, b, d, e, f, g, i) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              var j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0.0,
+                x = 0.0;
+              t = l;
+              l = (l + 48) | 0;
+              r = (t + 32) | 0;
+              s = (t + 8) | 0;
+              q = t;
+              m = (d + 4) | 0;
+              o = c[(d + 8) >> 2] | 0;
+              p = (q + 4) | 0;
+              j = c[m >> 2] | 0;
+              k = 0;
+              while (1) {
+                if ((k | 0) >= (o | 0)) {
+                  n = 5;
+                  break;
+                }
+                v = j;
+                u = c[(v + 4) >> 2] | 0;
+                c[q >> 2] = (c[v >> 2] | 0) + a;
+                c[p >> 2] = u + b;
+                c[r >> 2] = c[q >> 2];
+                c[(r + 4) >> 2] = c[(q + 4) >> 2];
+                if (RL(e, r) | 0) {
+                  j = 0;
+                  break;
+                }
+                j = (j + 8) | 0;
+                k = (k + 1) | 0;
+              }
+              if ((n | 0) == 5) {
+                d = c[(d + 12) >> 2] | 0;
+                x = +h[(i + (d << 5)) >> 3];
+                w = +h[(i + (d << 5) + 8) >> 3];
+                c[f >> 2] = (O(g, a) | 0) - ~~(x + (x >= 0.0 ? 0.5 : -0.5));
+                d = (f + 4) | 0;
+                c[d >> 2] = (O(g, b) | 0) - ~~(w + (w >= 0.0 ? 0.5 : -0.5));
+                j = c[m >> 2] | 0;
+                k = 0;
+                while (1) {
+                  if ((k | 0) >= (o | 0)) break;
+                  u = j;
+                  v = c[(u + 4) >> 2] | 0;
+                  c[q >> 2] = (c[u >> 2] | 0) + a;
+                  c[p >> 2] = v + b;
+                  c[r >> 2] = c[q >> 2];
+                  c[(r + 4) >> 2] = c[(q + 4) >> 2];
+                  OL(e, r);
+                  j = (j + 8) | 0;
+                  k = (k + 1) | 0;
+                }
+                if (0 > 1) {
+                  j = c[15712] | 0;
+                  u = c[f >> 2] | 0;
+                  v = c[d >> 2] | 0;
+                  c[s >> 2] = o;
+                  c[(s + 4) >> 2] = a;
+                  c[(s + 8) >> 2] = b;
+                  c[(s + 12) >> 2] = u;
+                  c[(s + 16) >> 2] = v;
+                  w4(j, 99316, s) | 0;
+                  j = 1;
+                } else j = 1;
+              }
+              l = t;
+              return j | 0;
+            }
+            function aH(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              e = ((c[(b + 4) >> 2] | 0) - (c[(d + 4) >> 2] | 0)) | 0;
+              c[a >> 2] = (c[b >> 2] | 0) - (c[d >> 2] | 0);
+              c[(a + 4) >> 2] = e;
+              return;
+            }
+            function bH(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              e = ((c[(d + 4) >> 2] | 0) + (c[(b + 4) >> 2] | 0)) | 0;
+              c[a >> 2] = (c[d >> 2] | 0) + (c[b >> 2] | 0);
+              c[(a + 4) >> 2] = e;
+              return;
+            }
+            function cH(a, b, d, e, f, g, i) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              var j = 0.0,
+                k = 0.0,
+                m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0;
+              A = l;
+              l = (l + 112) | 0;
+              x = (A + 96) | 0;
+              w = (A + 80) | 0;
+              r = (A + 48) | 0;
+              s = (A + 32) | 0;
+              y = (A + 16) | 0;
+              z = A;
+              n = (A + 64) | 0;
+              h[y >> 3] = +(c[b >> 2] | 0);
+              t = (y + 8) | 0;
+              h[t >> 3] = +(c[(b + 4) >> 2] | 0);
+              a: do
+                if ((i | 0) != 0 ? ((u = (a + 16) | 0), (m = c[((c[u >> 2] | 0) + 8) >> 2] | 0), (m | 0) != 0) : 0) {
+                  q = +(e | 0);
+                  p = +(f | 0);
+                  o = 1.0 / +(g | 0);
+                  n = (z + 8) | 0;
+                  i = 0;
+                  while (1) {
+                    if ((i | 0) >= (c[(m + 4) >> 2] | 0)) break a;
+                    f = c[m >> 2] | 0;
+                    a = c[(f + ((i * 48) | 0)) >> 2] | 0;
+                    b = c[(f + ((i * 48) | 0) + 4) >> 2] | 0;
+                    g = c[(f + ((i * 48) | 0) + 8) >> 2] | 0;
+                    e = c[(f + ((i * 48) | 0) + 12) >> 2] | 0;
+                    m = (f + ((i * 48) | 0) + 16) | 0;
+                    c[r >> 2] = c[m >> 2];
+                    c[(r + 4) >> 2] = c[(m + 4) >> 2];
+                    c[(r + 8) >> 2] = c[(m + 8) >> 2];
+                    c[(r + 12) >> 2] = c[(m + 12) >> 2];
+                    f = (f + ((i * 48) | 0) + 32) | 0;
+                    c[s >> 2] = c[f >> 2];
+                    c[(s + 4) >> 2] = c[(f + 4) >> 2];
+                    c[(s + 8) >> 2] = c[(f + 8) >> 2];
+                    c[(s + 12) >> 2] = c[(f + 12) >> 2];
+                    if (!g) {
+                      c[y >> 2] = c[a >> 2];
+                      c[(y + 4) >> 2] = c[(a + 4) >> 2];
+                      c[(y + 8) >> 2] = c[(a + 8) >> 2];
+                      c[(y + 12) >> 2] = c[(a + 12) >> 2];
+                      m = (a + 16) | 0;
+                      c[z >> 2] = c[m >> 2];
+                      c[(z + 4) >> 2] = c[(m + 4) >> 2];
+                      c[(z + 8) >> 2] = c[(m + 8) >> 2];
+                      c[(z + 12) >> 2] = c[(m + 12) >> 2];
+                      m = 2;
+                    } else {
+                      c[y >> 2] = c[r >> 2];
+                      c[(y + 4) >> 2] = c[(r + 4) >> 2];
+                      c[(y + 8) >> 2] = c[(r + 8) >> 2];
+                      c[(y + 12) >> 2] = c[(r + 12) >> 2];
+                      c[z >> 2] = c[a >> 2];
+                      c[(z + 4) >> 2] = c[(a + 4) >> 2];
+                      c[(z + 8) >> 2] = c[(a + 8) >> 2];
+                      c[(z + 12) >> 2] = c[(a + 12) >> 2];
+                      m = 1;
+                    }
+                    j = +h[y >> 3] + q;
+                    h[y >> 3] = j;
+                    k = +h[t >> 3] + p;
+                    h[t >> 3] = k;
+                    if (!(j >= 0.0)) j = (j + 1.0) * o + -1.0;
+                    else j = j * o;
+                    h[y >> 3] = j;
+                    if (!(k >= 0.0)) j = (k + 1.0) * o + -1.0;
+                    else j = k * o;
+                    h[t >> 3] = j;
+                    j = +h[z >> 3] + q;
+                    h[z >> 3] = j;
+                    k = +h[n >> 3] + p;
+                    h[n >> 3] = k;
+                    if (!(j >= 0.0)) j = (j + 1.0) * o + -1.0;
+                    else j = j * o;
+                    h[z >> 3] = j;
+                    if (!(k >= 0.0)) j = (k + 1.0) * o + -1.0;
+                    else j = k * o;
+                    h[n >> 3] = j;
+                    c[w >> 2] = c[y >> 2];
+                    c[(w + 4) >> 2] = c[(y + 4) >> 2];
+                    c[(w + 8) >> 2] = c[(y + 8) >> 2];
+                    c[(w + 12) >> 2] = c[(y + 12) >> 2];
+                    c[x >> 2] = c[z >> 2];
+                    c[(x + 4) >> 2] = c[(z + 4) >> 2];
+                    c[(x + 8) >> 2] = c[(z + 8) >> 2];
+                    c[(x + 12) >> 2] = c[(z + 12) >> 2];
+                    PG(w, x, d);
+                    while (1) {
+                      if ((m | 0) >= (b | 0)) break;
+                      c[y >> 2] = c[z >> 2];
+                      c[(y + 4) >> 2] = c[(z + 4) >> 2];
+                      c[(y + 8) >> 2] = c[(z + 8) >> 2];
+                      c[(y + 12) >> 2] = c[(z + 12) >> 2];
+                      g = (a + (m << 4)) | 0;
+                      c[z >> 2] = c[g >> 2];
+                      c[(z + 4) >> 2] = c[(g + 4) >> 2];
+                      c[(z + 8) >> 2] = c[(g + 8) >> 2];
+                      c[(z + 12) >> 2] = c[(g + 12) >> 2];
+                      j = +h[z >> 3] + q;
+                      h[z >> 3] = j;
+                      k = +h[n >> 3] + p;
+                      h[n >> 3] = k;
+                      if (!(j >= 0.0)) j = (j + 1.0) * o + -1.0;
+                      else j = j * o;
+                      h[z >> 3] = j;
+                      if (!(k >= 0.0)) j = (k + 1.0) * o + -1.0;
+                      else j = k * o;
+                      h[n >> 3] = j;
+                      c[w >> 2] = c[y >> 2];
+                      c[(w + 4) >> 2] = c[(y + 4) >> 2];
+                      c[(w + 8) >> 2] = c[(y + 8) >> 2];
+                      c[(w + 12) >> 2] = c[(y + 12) >> 2];
+                      c[x >> 2] = c[z >> 2];
+                      c[(x + 4) >> 2] = c[(z + 4) >> 2];
+                      c[(x + 8) >> 2] = c[(z + 8) >> 2];
+                      c[(x + 12) >> 2] = c[(z + 12) >> 2];
+                      PG(w, x, d);
+                      m = (m + 1) | 0;
+                    }
+                    if (e | 0) {
+                      c[y >> 2] = c[z >> 2];
+                      c[(y + 4) >> 2] = c[(z + 4) >> 2];
+                      c[(y + 8) >> 2] = c[(z + 8) >> 2];
+                      c[(y + 12) >> 2] = c[(z + 12) >> 2];
+                      c[z >> 2] = c[s >> 2];
+                      c[(z + 4) >> 2] = c[(s + 4) >> 2];
+                      c[(z + 8) >> 2] = c[(s + 8) >> 2];
+                      c[(z + 12) >> 2] = c[(s + 12) >> 2];
+                      j = +h[z >> 3] + q;
+                      h[z >> 3] = j;
+                      k = +h[n >> 3] + p;
+                      h[n >> 3] = k;
+                      if (!(j >= 0.0)) j = (j + 1.0) * o + -1.0;
+                      else j = j * o;
+                      h[z >> 3] = j;
+                      if (!(k >= 0.0)) j = (k + 1.0) * o + -1.0;
+                      else j = k * o;
+                      h[n >> 3] = j;
+                      c[w >> 2] = c[y >> 2];
+                      c[(w + 4) >> 2] = c[(y + 4) >> 2];
+                      c[(w + 8) >> 2] = c[(y + 8) >> 2];
+                      c[(w + 12) >> 2] = c[(y + 12) >> 2];
+                      c[x >> 2] = c[z >> 2];
+                      c[(x + 4) >> 2] = c[(z + 4) >> 2];
+                      c[(x + 8) >> 2] = c[(z + 8) >> 2];
+                      c[(x + 12) >> 2] = c[(z + 12) >> 2];
+                      PG(w, x, d);
+                    }
+                    i = (i + 1) | 0;
+                    m = c[((c[u >> 2] | 0) + 8) >> 2] | 0;
+                  }
+                } else v = 4;
+              while (0);
+              if ((v | 0) == 4) {
+                jP(n, c[((((c[a >> 2] & 3) | 0) == 2 ? a : (a + -48) | 0) + 40) >> 2] | 0);
+                c[z >> 2] = c[n >> 2];
+                c[(z + 4) >> 2] = c[(n + 4) >> 2];
+                c[(z + 8) >> 2] = c[(n + 8) >> 2];
+                c[(z + 12) >> 2] = c[(n + 12) >> 2];
+                j = +h[z >> 3] + +(e | 0);
+                h[z >> 3] = j;
+                m = (z + 8) | 0;
+                k = +h[m >> 3] + +(f | 0);
+                h[m >> 3] = k;
+                if (!(j >= 0.0)) j = (j + 1.0) / +(g | 0) + -1.0;
+                else j = j / +(g | 0);
+                h[z >> 3] = j;
+                if (!(k >= 0.0)) j = (k + 1.0) / +(g | 0) + -1.0;
+                else j = k / +(g | 0);
+                h[m >> 3] = j;
+                c[w >> 2] = c[y >> 2];
+                c[(w + 4) >> 2] = c[(y + 4) >> 2];
+                c[(w + 8) >> 2] = c[(y + 8) >> 2];
+                c[(w + 12) >> 2] = c[(y + 12) >> 2];
+                c[x >> 2] = c[z >> 2];
+                c[(x + 4) >> 2] = c[(z + 4) >> 2];
+                c[(x + 8) >> 2] = c[(z + 8) >> 2];
+                c[(x + 12) >> 2] = c[(z + 12) >> 2];
+                PG(w, x, d);
+              }
+              l = A;
+              return;
+            }
+            function dH(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              a: do
+                if ((a | 0) < 1) a = 0;
+                else
+                  switch (c[(d + 16) >> 2] | 0) {
+                    case 4: {
+                      a = SG(a, b, d) | 0;
+                      break a;
+                    }
+                    case 3: {
+                      a = eH(a, b, d) | 0;
+                      break a;
+                    }
+                    default: {
+                      a = 0;
+                      break a;
+                    }
+                  }
+              while (0);
+              return a | 0;
+            }
+            function eH(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              n = l;
+              l = (l + 80) | 0;
+              g = (n + 64) | 0;
+              f = (n + 24) | 0;
+              m = (n + 8) | 0;
+              e = n;
+              h = (n + 56) | 0;
+              j = (d + 8) | 0;
+              k = VG(a, b, c[j >> 2] | 0) | 0;
+              if (0) {
+                i = c[15712] | 0;
+                c[e >> 2] = k;
+                w4(i, 99285, e) | 0;
+              }
+              a: do
+                if ((k | 0) >= 1) {
+                  c[(h + 4) >> 2] = 0;
+                  c[h >> 2] = 0;
+                  i = JK(a << 4) | 0;
+                  d = 0;
+                  while (1) {
+                    if ((d | 0) >= (a | 0)) break;
+                    c[(i + (d << 4) + 12) >> 2] = d;
+                    o = (b + (d << 5)) | 0;
+                    e = c[j >> 2] | 0;
+                    c[f >> 2] = c[o >> 2];
+                    c[(f + 4) >> 2] = c[(o + 4) >> 2];
+                    c[(f + 8) >> 2] = c[(o + 8) >> 2];
+                    c[(f + 12) >> 2] = c[(o + 12) >> 2];
+                    c[(f + 16) >> 2] = c[(o + 16) >> 2];
+                    c[(f + 20) >> 2] = c[(o + 20) >> 2];
+                    c[(f + 24) >> 2] = c[(o + 24) >> 2];
+                    c[(f + 28) >> 2] = c[(o + 28) >> 2];
+                    c[g >> 2] = c[h >> 2];
+                    c[(g + 4) >> 2] = c[(h + 4) >> 2];
+                    WG(f, (i + (d << 4)) | 0, k, e, g, 195059);
+                    d = (d + 1) | 0;
+                  }
+                  f = JK(a << 2) | 0;
+                  d = 0;
+                  while (1) {
+                    if ((d | 0) >= (a | 0)) break;
+                    c[(f + (d << 2)) >> 2] = i + (d << 4);
+                    d = (d + 1) | 0;
+                  }
+                  o4(f, a, 4, 89);
+                  g = KL() | 0;
+                  d = JK(a << 3) | 0;
+                  e = 0;
+                  while (1) {
+                    if ((e | 0) >= (a | 0)) break;
+                    o = c[(f + (e << 2)) >> 2] | 0;
+                    _G(e, o, g, (d + (c[(o + 12) >> 2] << 3)) | 0, k, c[j >> 2] | 0, b);
+                    e = (e + 1) | 0;
+                  }
+                  U1(f);
+                  e = 0;
+                  while (1) {
+                    if ((e | 0) >= (a | 0)) break;
+                    U1(c[(i + (e << 4) + 4) >> 2] | 0);
+                    e = (e + 1) | 0;
+                  }
+                  U1(i);
+                  NL(g);
+                  if (0 > 1) {
+                    f = c[15712] | 0;
+                    e = 0;
+                    while (1) {
+                      if ((e | 0) >= (a | 0)) break a;
+                      b = c[(d + (e << 3)) >> 2] | 0;
+                      o = c[(d + (e << 3) + 4) >> 2] | 0;
+                      c[m >> 2] = e;
+                      c[(m + 4) >> 2] = b;
+                      c[(m + 8) >> 2] = o;
+                      w4(f, 99301, m) | 0;
+                      e = (e + 1) | 0;
+                    }
+                  }
+                } else d = 0;
+              while (0);
+              l = n;
+              return d | 0;
+            }
+            function fH(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0;
+              a: do
+                if ((a | 0) < 1) f = (0 - a) | 0;
+                else {
+                  s = (e | 0) == 0;
+                  q = (f | 0) == 0;
+                  j = 0;
+                  while (1) {
+                    if ((j | 0) == (a | 0)) {
+                      f = 0;
+                      break a;
+                    }
+                    r = c[(b + (j << 2)) >> 2] | 0;
+                    g = s ? r : e;
+                    k = c[(d + (j << 3)) >> 2] | 0;
+                    l = c[(d + (j << 3) + 4) >> 2] | 0;
+                    m = +(k | 0);
+                    n = m * 0.013888888888888888;
+                    o = +(l | 0);
+                    p = o * 0.013888888888888888;
+                    i = jC(r) | 0;
+                    while (1) {
+                      if (!i) break;
+                      f = c[(i + 16) >> 2] | 0;
+                      t = c[(f + 132) >> 2] | 0;
+                      h[t >> 3] = +h[t >> 3] + n;
+                      t = (t + 8) | 0;
+                      h[t >> 3] = +h[t >> 3] + p;
+                      t = (f + 16) | 0;
+                      h[t >> 3] = +h[t >> 3] + m;
+                      t = (f + 24) | 0;
+                      h[t >> 3] = +h[t >> 3] + o;
+                      f = c[(f + 108) >> 2] | 0;
+                      if (f | 0) {
+                        t = (f + 56) | 0;
+                        h[t >> 3] = +h[t >> 3] + m;
+                        t = (f + 64) | 0;
+                        h[t >> 3] = +h[t >> 3] + o;
+                      }
+                      b: do
+                        if (!q) {
+                          f = XA(g, i) | 0;
+                          while (1) {
+                            if (!f) break b;
+                            gH(f, k, l);
+                            f = ZA(g, f) | 0;
+                          }
+                        }
+                      while (0);
+                      i = kC(r, i) | 0;
+                    }
+                    hH(r, k, l);
+                    j = (j + 1) | 0;
+                  }
+                }
+              while (0);
+              return f | 0;
+            }
+            function gH(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0,
+                l = 0.0,
+                m = 0,
+                n = 0;
+              e = c[(a + 16) >> 2] | 0;
+              a = c[(e + 96) >> 2] | 0;
+              if (a | 0) {
+                m = (a + 56) | 0;
+                h[m >> 3] = +h[m >> 3] + +(b | 0);
+                m = (a + 64) | 0;
+                h[m >> 3] = +h[m >> 3] + +(d | 0);
+              }
+              a = c[(e + 108) >> 2] | 0;
+              if (a | 0) {
+                m = (a + 56) | 0;
+                h[m >> 3] = +h[m >> 3] + +(b | 0);
+                m = (a + 64) | 0;
+                h[m >> 3] = +h[m >> 3] + +(d | 0);
+              }
+              a = c[(e + 100) >> 2] | 0;
+              if (a | 0) {
+                m = (a + 56) | 0;
+                h[m >> 3] = +h[m >> 3] + +(b | 0);
+                m = (a + 64) | 0;
+                h[m >> 3] = +h[m >> 3] + +(d | 0);
+              }
+              a = c[(e + 104) >> 2] | 0;
+              if (a | 0) {
+                m = (a + 56) | 0;
+                h[m >> 3] = +h[m >> 3] + +(b | 0);
+                m = (a + 64) | 0;
+                h[m >> 3] = +h[m >> 3] + +(d | 0);
+              }
+              m = c[(e + 8) >> 2] | 0;
+              a: do
+                if (m | 0) {
+                  l = +(b | 0);
+                  j = +(d | 0);
+                  b = c[(m + 4) >> 2] | 0;
+                  a = 0;
+                  while (1) {
+                    if ((a | 0) >= (b | 0)) break a;
+                    k = c[m >> 2] | 0;
+                    d = c[(k + ((a * 48) | 0)) >> 2] | 0;
+                    f = c[(k + ((a * 48) | 0) + 4) >> 2] | 0;
+                    g = c[(k + ((a * 48) | 0) + 8) >> 2] | 0;
+                    i = c[(k + ((a * 48) | 0) + 12) >> 2] | 0;
+                    e = 0;
+                    while (1) {
+                      if ((e | 0) >= (f | 0)) break;
+                      n = (d + (e << 4)) | 0;
+                      h[n >> 3] = +h[n >> 3] + l;
+                      n = (d + (e << 4) + 8) | 0;
+                      h[n >> 3] = +h[n >> 3] + j;
+                      e = (e + 1) | 0;
+                    }
+                    if (g | 0) {
+                      n = (k + ((a * 48) | 0) + 16) | 0;
+                      h[n >> 3] = +h[n >> 3] + l;
+                      n = (k + ((a * 48) | 0) + 24) | 0;
+                      h[n >> 3] = +h[n >> 3] + j;
+                    }
+                    if (i | 0) {
+                      n = (k + ((a * 48) | 0) + 32) | 0;
+                      h[n >> 3] = +h[n >> 3] + l;
+                      n = (k + ((a * 48) | 0) + 40) | 0;
+                      h[n >> 3] = +h[n >> 3] + j;
+                    }
+                    a = (a + 1) | 0;
+                  }
+                }
+              while (0);
+              return;
+            }
+            function hH(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0.0,
+                l = 0.0,
+                m = 0,
+                n = 0.0,
+                o = 0;
+              j = (b + 16) | 0;
+              b = c[j >> 2] | 0;
+              o = (b + 16) | 0;
+              m = (b + 24) | 0;
+              f = (b + 32) | 0;
+              b = (b + 40) | 0;
+              g = +(d | 0);
+              l = +h[f >> 3] + g;
+              i = +(e | 0);
+              n = +h[m >> 3] + i;
+              k = +h[b >> 3] + i;
+              h[o >> 3] = +h[o >> 3] + g;
+              h[m >> 3] = n;
+              h[f >> 3] = l;
+              h[b >> 3] = k;
+              b = c[j >> 2] | 0;
+              f = c[(b + 12) >> 2] | 0;
+              if ((f | 0) != 0 ? (a[(f + 81) >> 0] | 0) != 0 : 0) {
+                o = (f + 56) | 0;
+                h[o >> 3] = +h[o >> 3] + g;
+                f = (f + 64) | 0;
+                h[f >> 3] = +h[f >> 3] + i;
+                f = 1;
+              } else f = 1;
+              while (1) {
+                if ((f | 0) > (c[(b + 180) >> 2] | 0)) break;
+                hH(c[((c[(b + 184) >> 2] | 0) + (f << 2)) >> 2] | 0, d, e);
+                f = (f + 1) | 0;
+                b = c[j >> 2] | 0;
+              }
+              return;
+            }
+            function iH(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0;
+              f = QG(a, b, d, e) | 0;
+              if (!f) a = 1;
+              else {
+                a = fH(a, b, f, d, c[(e + 12) >> 2] | 0) | 0;
+                U1(f);
+              }
+              return a | 0;
+            }
+            function jH(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0;
+              p = l;
+              l = (l + 32) | 0;
+              o = p;
+              n = iH(a, b, d, e) | 0;
+              if (!n) {
+                BP(d);
+                m = ((c[(d + 16) >> 2] | 0) + 16) | 0;
+                c[o >> 2] = c[m >> 2];
+                c[(o + 4) >> 2] = c[(m + 4) >> 2];
+                c[(o + 8) >> 2] = c[(m + 8) >> 2];
+                c[(o + 12) >> 2] = c[(m + 12) >> 2];
+                c[(o + 16) >> 2] = c[(m + 16) >> 2];
+                c[(o + 20) >> 2] = c[(m + 20) >> 2];
+                c[(o + 24) >> 2] = c[(m + 24) >> 2];
+                c[(o + 28) >> 2] = c[(m + 28) >> 2];
+                f = (o + 8) | 0;
+                g = (o + 16) | 0;
+                i = (o + 24) | 0;
+                e = 0;
+                while (1) {
+                  if ((e | 0) >= (a | 0)) break;
+                  k = c[((c[(b + (e << 2)) >> 2] | 0) + 16) >> 2] | 0;
+                  j = c[(k + 180) >> 2] | 0;
+                  k = (k + 184) | 0;
+                  d = 1;
+                  while (1) {
+                    if ((d | 0) > (j | 0)) break;
+                    r = ((c[((c[((c[k >> 2] | 0) + (d << 2)) >> 2] | 0) + 16) >> 2] | 0) + 16) | 0;
+                    h[o >> 3] = +h[(+h[o >> 3] < +h[r >> 3] ? o : r) >> 3];
+                    r = c[((c[((c[k >> 2] | 0) + (d << 2)) >> 2] | 0) + 16) >> 2] | 0;
+                    q = (r + 16) | 0;
+                    h[f >> 3] = +h[((+h[f >> 3] < +h[(r + 24) >> 3] ? o : q) + 8) >> 3];
+                    h[g >> 3] = +h[((+h[g >> 3] > +h[(r + 32) >> 3] ? o : q) + 16) >> 3];
+                    h[i >> 3] = +h[((+h[i >> 3] > +h[(r + 40) >> 3] ? o : q) + 24) >> 3];
+                    d = (d + 1) | 0;
+                  }
+                  e = (e + 1) | 0;
+                }
+                c[m >> 2] = c[o >> 2];
+                c[(m + 4) >> 2] = c[(o + 4) >> 2];
+                c[(m + 8) >> 2] = c[(o + 8) >> 2];
+                c[(m + 12) >> 2] = c[(o + 12) >> 2];
+                c[(m + 16) >> 2] = c[(o + 16) >> 2];
+                c[(m + 20) >> 2] = c[(o + 20) >> 2];
+                c[(m + 24) >> 2] = c[(o + 24) >> 2];
+                c[(m + 28) >> 2] = c[(o + 28) >> 2];
+              }
+              l = p;
+              return n | 0;
+            }
+            function kH(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              g = l;
+              l = (l + 16) | 0;
+              f = g;
+              if (!e) qa(99534, 99540, 1400, 99547);
+              d = lH(a, d, d) | 0;
+              c[(e + 8) >> 2] = d;
+              if (0) {
+                h = c[15712] | 0;
+                c[f >> 2] = d;
+                w4(h, 99559, f) | 0;
+              }
+              c[(e + 12) >> 2] = 0;
+              c[(e + 20) >> 2] = 0;
+              mH(a, b, e) | 0;
+              l = g;
+              return c[(e + 16) >> 2] | 0;
+            }
+            function lH(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 16) | 0;
+              h = i;
+              f = (i + 4) | 0;
+              g = QA(b, 99689) | 0;
+              a: do
+                if (g) {
+                  c[h >> 2] = f;
+                  h = (b5(g, 137395, h) | 0) == 1;
+                  b = c[f >> 2] | 0;
+                  if (h & ((b | 0) > -1)) d = b;
+                  else {
+                    switch (a[g >> 0] | 0) {
+                      case 84:
+                      case 116:
+                        break;
+                      default:
+                        break a;
+                    }
+                    d = e;
+                  }
+                }
+              while (0);
+              l = i;
+              return d | 0;
+            }
+            function mH(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              return nH(QA(a, 99572) | 0, b, c) | 0;
+            }
+            function nH(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0.0;
+              u = l;
+              l = (l + 64) | 0;
+              r = (u + 40) | 0;
+              q = (u + 32) | 0;
+              t = (u + 24) | 0;
+              s = (u + 16) | 0;
+              m = (u + 8) | 0;
+              k = u;
+              i = (u + 48) | 0;
+              j = (u + 44) | 0;
+              if (!e) qa(99534, 99540, 1292, 99581);
+              o = (e + 28) | 0;
+              c[o >> 2] = 0;
+              p = (e + 16) | 0;
+              c[p >> 2] = d;
+              n = (e + 4) | 0;
+              c[n >> 2] = 0;
+              c[(e + 24) >> 2] = 0;
+              a: do
+                if (b | 0 ? ((f = a[b >> 0] | 0), (f << 24) >> 24) : 0)
+                  switch (((f << 24) >> 24) | 0) {
+                    case 97:
+                      if (!(Q2(b, 99599, 5) | 0)) {
+                        c[p >> 2] = 4;
+                        m = oH((b + 5) | 0, e) | 0;
+                        c[k >> 2] = j;
+                        m = (b5(m, 137395, k) | 0) > 0;
+                        d = c[j >> 2] | 0;
+                        if (!(m & ((d | 0) > 0))) break a;
+                        c[n >> 2] = d;
+                        break a;
+                      } else {
+                        if (Q2(b, 99605, 6) | 0) break a;
+                        c[p >> 2] = 5;
+                        c[m >> 2] = i;
+                        m = (b5((b + 5) | 0, 99612, m) | 0) > 0;
+                        v = +g[i >> 2];
+                        g[e >> 2] = m & (v > 0.0) ? v : 1.0;
+                        break a;
+                      }
+                    case 99: {
+                      if ((f << 24) >> 24 != 99) break a;
+                      if (s2(b, 108006) | 0) break a;
+                      c[p >> 2] = 1;
+                      break a;
+                    }
+                    case 103: {
+                      if ((f << 24) >> 24 != 103) break a;
+                      if (s2(b, 111494) | 0) break a;
+                      c[p >> 2] = 3;
+                      break a;
+                    }
+                    case 110: {
+                      if ((f << 24) >> 24 != 110) break a;
+                      if (s2(b, 111481) | 0) break a;
+                      c[p >> 2] = 2;
+                      break a;
+                    }
+                    default:
+                      break a;
+                  }
+              while (0);
+              if (0) {
+                d = c[15712] | 0;
+                U4(99615, 11, 1, d) | 0;
+                c[s >> 2] = pH(c[p >> 2] | 0) | 0;
+                w4(d, 99627, s) | 0;
+                if ((c[p >> 2] | 0) == 5) {
+                  h[t >> 3] = +g[e >> 2];
+                  w4(d, 99640, t) | 0;
+                }
+                c[q >> 2] = c[n >> 2];
+                w4(d, 99653, q) | 0;
+                c[r >> 2] = c[o >> 2];
+                w4(d, 99666, r) | 0;
+              }
+              l = u;
+              return c[p >> 2] | 0;
+            }
+            function oH(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              a: do
+                if ((a[b >> 0] | 0) == 95) {
+                  f = (d + 28) | 0;
+                  e = 1;
+                  while (1) {
+                    b = (b + 1) | 0;
+                    b: while (1) {
+                      if (!e) break a;
+                      d = a[b >> 0] | 0;
+                      if (!((d << 24) >> 24)) break a;
+                      switch (((d << 24) >> 24) | 0) {
+                        case 99: {
+                          g = 10;
+                          break b;
+                        }
+                        case 105: {
+                          g = 9;
+                          break b;
+                        }
+                        case 117: {
+                          g = 11;
+                          break b;
+                        }
+                        case 116: {
+                          g = 12;
+                          break b;
+                        }
+                        case 98: {
+                          d = 32;
+                          break b;
+                        }
+                        case 108: {
+                          g = 7;
+                          break b;
+                        }
+                        case 114: {
+                          g = 8;
+                          break b;
+                        }
+                        default:
+                          e = 0;
+                      }
+                    }
+                    if ((g | 0) == 7) {
+                      g = 0;
+                      d = 4;
+                    } else if ((g | 0) == 8) {
+                      g = 0;
+                      d = 8;
+                    } else if ((g | 0) == 9) {
+                      g = 0;
+                      d = 64;
+                    } else if ((g | 0) == 10) {
+                      g = 0;
+                      d = 1;
+                    } else if ((g | 0) == 11) {
+                      g = 0;
+                      d = 2;
+                    } else if ((g | 0) == 12) {
+                      g = 0;
+                      d = 16;
+                    }
+                    c[f >> 2] = c[f >> 2] | d;
+                  }
+                }
+              while (0);
+              return b | 0;
+            }
+            function pH(a) {
+              a = a | 0;
+              switch (a | 0) {
+                case 1: {
+                  a = 108006;
+                  break;
+                }
+                case 2: {
+                  a = 111481;
+                  break;
+                }
+                case 3: {
+                  a = 111494;
+                  break;
+                }
+                case 4: {
+                  a = 99599;
+                  break;
+                }
+                case 5: {
+                  a = 99605;
+                  break;
+                }
+                default:
+                  a = 99679;
+              }
+              return a | 0;
+            }
+            function qH(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              n = l;
+              l = (l + 96) | 0;
+              k = n;
+              m = (n + 80) | 0;
+              do
+                if (a) {
+                  if (!e) {
+                    e = V1(1, 20) | 0;
+                    c[(e + 4) >> 2] = d >>> 0 > 80 ? d : 80;
+                  }
+                  d = c[e >> 2] | 0;
+                  j = c[(e + 4) >> 2] | 0;
+                  if (!d) {
+                    h = 100;
+                    d = a;
+                    i = V1(100, j) | 0;
+                  } else {
+                    h = (d + 100) | 0;
+                    i = W1(c[(e + 8) >> 2] | 0, O(h, j) | 0) | 0;
+                    Y6((i + (O(j, d) | 0)) | 0, 0, (j * 100) | 0) | 0;
+                    d = a;
+                  }
+                  while (1) {
+                    d = rH(k, d, b, m) | 0;
+                    if (!d) break;
+                    a = c[e >> 2] | 0;
+                    f = h << 1;
+                    g = O(h, j) | 0;
+                    if ((a | 0) == (h | 0)) {
+                      i = W1(i, O(f, j) | 0) | 0;
+                      Y6((i + g) | 0, 0, g | 0) | 0;
+                      a = c[e >> 2] | 0;
+                    } else f = h;
+                    a = (i + (O(a, j) | 0)) | 0;
+                    g = k;
+                    h = (a + 80) | 0;
+                    do {
+                      c[a >> 2] = c[g >> 2];
+                      a = (a + 4) | 0;
+                      g = (g + 4) | 0;
+                    } while ((a | 0) < (h | 0));
+                    c[e >> 2] = (c[e >> 2] | 0) + 1;
+                    h = f;
+                  }
+                  if (c[m >> 2] | 0) {
+                    m = (e + 16) | 0;
+                    c[m >> 2] = c[m >> 2] | 1;
+                  }
+                  d = c[e >> 2] | 0;
+                  if (!d) {
+                    U1(i);
+                    U1(e);
+                    e = 0;
+                    break;
+                  } else {
+                    c[(e + 8) >> 2] = W1(i, O(d, j) | 0) | 0;
+                    break;
+                  }
+                }
+              while (0);
+              l = n;
+              return e | 0;
+            }
+            function rH(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 80) | 0;
+              h = (j + 64) | 0;
+              i = j;
+              c[f >> 2] = 0;
+              do {
+                g = a[d >> 0] | 0;
+                d = (d + 1) | 0;
+              } while ((S2(g) | 0) != 0);
+              a: do
+                switch (g | 0) {
+                  case 69: {
+                    c[b >> 2] = 0;
+                    d = sH(d, (b + 8) | 0) | 0;
+                    if (!d) {
+                      c[f >> 2] = 1;
+                      d = 0;
+                      break a;
+                    }
+                    if (e) c[(b + 72) >> 2] = c[e >> 2];
+                    break;
+                  }
+                  case 101: {
+                    c[b >> 2] = 1;
+                    d = sH(d, (b + 8) | 0) | 0;
+                    if (!d) {
+                      c[f >> 2] = 1;
+                      d = 0;
+                      break a;
+                    }
+                    if (e) c[(b + 72) >> 2] = c[e >> 2];
+                    break;
+                  }
+                  case 80: {
+                    c[b >> 2] = 2;
+                    d = tH(d, (b + 8) | 0) | 0;
+                    if (!d) {
+                      c[f >> 2] = 1;
+                      d = 0;
+                      break a;
+                    }
+                    if (e) c[(b + 72) >> 2] = c[(e + 4) >> 2];
+                    break;
+                  }
+                  case 112: {
+                    c[b >> 2] = 3;
+                    d = tH(d, (b + 8) | 0) | 0;
+                    if (!d) {
+                      c[f >> 2] = 1;
+                      d = 0;
+                      break a;
+                    }
+                    if (e) c[(b + 72) >> 2] = c[(e + 4) >> 2];
+                    break;
+                  }
+                  case 98: {
+                    c[b >> 2] = 4;
+                    d = tH(d, (b + 8) | 0) | 0;
+                    if (!d) {
+                      c[f >> 2] = 1;
+                      d = 0;
+                      break a;
+                    }
+                    if (e) c[(b + 72) >> 2] = c[(e + 8) >> 2];
+                    break;
+                  }
+                  case 66: {
+                    c[b >> 2] = 5;
+                    d = tH(d, (b + 8) | 0) | 0;
+                    if (!d) {
+                      c[f >> 2] = 1;
+                      d = 0;
+                      break a;
+                    }
+                    if (e) c[(b + 72) >> 2] = c[(e + 8) >> 2];
+                    break;
+                  }
+                  case 99: {
+                    d = uH(d, h) | 0;
+                    if (!d) {
+                      c[f >> 2] = 1;
+                      d = 0;
+                      break a;
+                    }
+                    g = vH(c[h >> 2] | 0, i) | 0;
+                    c[h >> 2] = g;
+                    if (!g) {
+                      c[f >> 2] = 1;
+                      d = 0;
+                      break a;
+                    }
+                    if (!(c[i >> 2] | 0)) {
+                      c[b >> 2] = 9;
+                      c[(b + 8) >> 2] = c[(i + 8) >> 2];
+                      if (!e) break a;
+                      c[(b + 72) >> 2] = c[(e + 24) >> 2];
+                      break a;
+                    } else {
+                      c[b >> 2] = 14;
+                      f = (b + 8) | 0;
+                      g = i;
+                      h = (f + 64) | 0;
+                      do {
+                        c[f >> 2] = c[g >> 2];
+                        f = (f + 4) | 0;
+                        g = (g + 4) | 0;
+                      } while ((f | 0) < (h | 0));
+                      if (!e) break a;
+                      c[(b + 72) >> 2] = c[(e + 40) >> 2];
+                      break a;
+                    }
+                  }
+                  case 67: {
+                    d = uH(d, h) | 0;
+                    if (!d) {
+                      c[f >> 2] = 1;
+                      d = 0;
+                      break a;
+                    }
+                    g = vH(c[h >> 2] | 0, i) | 0;
+                    c[h >> 2] = g;
+                    if (!g) {
+                      c[f >> 2] = 1;
+                      d = 0;
+                      break a;
+                    }
+                    if (!(c[i >> 2] | 0)) {
+                      c[b >> 2] = 8;
+                      c[(b + 8) >> 2] = c[(i + 8) >> 2];
+                      if (!e) break a;
+                      c[(b + 72) >> 2] = c[(e + 20) >> 2];
+                      break a;
+                    } else {
+                      c[b >> 2] = 13;
+                      f = (b + 8) | 0;
+                      g = i;
+                      h = (f + 64) | 0;
+                      do {
+                        c[f >> 2] = c[g >> 2];
+                        f = (f + 4) | 0;
+                        g = (g + 4) | 0;
+                      } while ((f | 0) < (h | 0));
+                      if (!e) break a;
+                      c[(b + 72) >> 2] = c[(e + 40) >> 2];
+                      break a;
+                    }
+                  }
+                  case 76: {
+                    c[b >> 2] = 6;
+                    d = tH(d, (b + 8) | 0) | 0;
+                    if (!d) {
+                      c[f >> 2] = 1;
+                      d = 0;
+                      break a;
+                    }
+                    if (e) c[(b + 72) >> 2] = c[(e + 12) >> 2];
+                    break;
+                  }
+                  case 84: {
+                    c[b >> 2] = 7;
+                    d = wH(d, (b + 8) | 0) | 0;
+                    if (!d) {
+                      c[f >> 2] = 1;
+                      d = 0;
+                      break a;
+                    }
+                    d = wH(d, (b + 16) | 0) | 0;
+                    if (!d) {
+                      c[f >> 2] = 1;
+                      d = 0;
+                      break a;
+                    }
+                    d = xH(d, (b + 24) | 0) | 0;
+                    if (!d) {
+                      c[f >> 2] = 1;
+                      d = 0;
+                      break a;
+                    }
+                    d = wH(d, (b + 32) | 0) | 0;
+                    if (!d) {
+                      c[f >> 2] = 1;
+                      d = 0;
+                      break a;
+                    }
+                    d = uH(d, (b + 40) | 0) | 0;
+                    if (!d) {
+                      c[f >> 2] = 1;
+                      d = 0;
+                      break a;
+                    }
+                    if (e) c[(b + 72) >> 2] = c[(e + 16) >> 2];
+                    break;
+                  }
+                  case 70: {
+                    c[b >> 2] = 10;
+                    d = wH(d, (b + 8) | 0) | 0;
+                    if (!d) {
+                      c[f >> 2] = 1;
+                      d = 0;
+                      break a;
+                    }
+                    d = uH(d, (b + 16) | 0) | 0;
+                    if (!d) {
+                      c[f >> 2] = 1;
+                      d = 0;
+                      break a;
+                    }
+                    if (e) c[(b + 72) >> 2] = c[(e + 28) >> 2];
+                    break;
+                  }
+                  case 83: {
+                    c[b >> 2] = 11;
+                    d = uH(d, (b + 8) | 0) | 0;
+                    if (!d) {
+                      c[f >> 2] = 1;
+                      d = 0;
+                      break a;
+                    }
+                    if (e) c[(b + 72) >> 2] = c[(e + 32) >> 2];
+                    break;
+                  }
+                  case 73: {
+                    c[b >> 2] = 12;
+                    d = sH(d, (b + 8) | 0) | 0;
+                    if (!d) {
+                      c[f >> 2] = 1;
+                      d = 0;
+                      break a;
+                    }
+                    d = uH(d, (b + 40) | 0) | 0;
+                    if (!d) {
+                      c[f >> 2] = 1;
+                      d = 0;
+                      break a;
+                    }
+                    if (e) c[(b + 72) >> 2] = c[(e + 36) >> 2];
+                    break;
+                  }
+                  case 116: {
+                    c[b >> 2] = 15;
+                    d = yH(d, (b + 8) | 0) | 0;
+                    if (!d) {
+                      c[f >> 2] = 1;
+                      d = 0;
+                      break a;
+                    }
+                    if (e) c[(b + 72) >> 2] = c[(e + 44) >> 2];
+                    break;
+                  }
+                  case 0: {
+                    d = 0;
+                    break;
+                  }
+                  default: {
+                    c[f >> 2] = 1;
+                    d = 0;
+                  }
+                }
+              while (0);
+              l = j;
+              return d | 0;
+            }
+            function sH(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0;
+              i = l;
+              l = (l + 16) | 0;
+              e = i;
+              h[b >> 3] = +s5(a, e);
+              f = c[e >> 2] | 0;
+              if (
+                ((f | 0) != (a | 0) ? ((h[(b + 8) >> 3] = +s5(f, e)), (g = c[e >> 2] | 0), (f | 0) != (g | 0)) : 0)
+                  ? ((h[(b + 16) >> 3] = +s5(g, e)), (d = c[e >> 2] | 0), (g | 0) != (d | 0))
+                  : 0
+              ) {
+                h[(b + 24) >> 3] = +s5(d, e);
+                a = c[e >> 2] | 0;
+                a = (d | 0) == (a | 0) ? 0 : a;
+              } else a = 0;
+              l = i;
+              return a | 0;
+            }
+            function tH(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 16) | 0;
+              j = (k + 4) | 0;
+              g = k;
+              a = zH(a, j) | 0;
+              do
+                if (a) {
+                  d = c[j >> 2] | 0;
+                  i = V1(d, 24) | 0;
+                  c[b >> 2] = d;
+                  e = i;
+                  f = 0;
+                  while (1) {
+                    if ((f | 0) >= (d | 0)) {
+                      d = 9;
+                      break;
+                    }
+                    h[e >> 3] = +s5(a, g);
+                    d = c[g >> 2] | 0;
+                    if ((a | 0) == (d | 0)) {
+                      d = 5;
+                      break;
+                    }
+                    h[(e + 8) >> 3] = +s5(d, g);
+                    a = c[g >> 2] | 0;
+                    if ((d | 0) == (a | 0)) {
+                      d = 7;
+                      break;
+                    }
+                    h[(e + 16) >> 3] = 0.0;
+                    e = (e + 24) | 0;
+                    d = c[b >> 2] | 0;
+                    f = (f + 1) | 0;
+                  }
+                  if ((d | 0) == 5) {
+                    c[j >> 2] = f;
+                    U1(i);
+                    a = 0;
+                    break;
+                  } else if ((d | 0) == 7) {
+                    c[j >> 2] = f;
+                    U1(i);
+                    a = 0;
+                    break;
+                  } else if ((d | 0) == 9) {
+                    c[j >> 2] = f;
+                    c[(b + 4) >> 2] = i;
+                    break;
+                  }
+                } else a = 0;
+              while (0);
+              l = k;
+              return a | 0;
+            }
+            function uH(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 16) | 0;
+              i = j;
+              b = zH(b, i) | 0;
+              f = c[i >> 2] | 0;
+              do
+                if (!(((b | 0) == 0) | ((f | 0) < 1))) {
+                  while (1) {
+                    h = a[b >> 0] | 0;
+                    e = (h << 24) >> 24 == 0;
+                    if (e ^ ((h << 24) >> 24 != 45)) b = (b + 1) | 0;
+                    else break;
+                  }
+                  if (!e) {
+                    h = V1((f + 1) | 0, 1) | 0;
+                    g = h;
+                    e = f;
+                    while (1) {
+                      b = (b + 1) | 0;
+                      if ((e | 0) <= 0) {
+                        e = 9;
+                        break;
+                      }
+                      e = a[b >> 0] | 0;
+                      if (!((e << 24) >> 24)) {
+                        e = 8;
+                        break;
+                      }
+                      a[g >> 0] = e;
+                      e = ((c[i >> 2] | 0) + -1) | 0;
+                      c[i >> 2] = e;
+                      g = (g + 1) | 0;
+                    }
+                    if ((e | 0) == 8) {
+                      U1(h);
+                      b = 0;
+                      break;
+                    } else if ((e | 0) == 9) {
+                      a[g >> 0] = 0;
+                      c[d >> 2] = h;
+                      break;
+                    }
+                  } else b = 0;
+                } else b = 0;
+              while (0);
+              l = j;
+              return b | 0;
+            }
+            function vH(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              e = a[b >> 0] | 0;
+              switch (e | 0) {
+                case 91: {
+                  b = AH((b + 1) | 0, d) | 0;
+                  break;
+                }
+                case 40: {
+                  b = BH((b + 1) | 0, d) | 0;
+                  break;
+                }
+                case 47:
+                case 35: {
+                  c[d >> 2] = 0;
+                  c[(d + 8) >> 2] = b;
+                  break;
+                }
+                default:
+                  if (!(a3(e) | 0)) b = 0;
+                  else {
+                    c[d >> 2] = 0;
+                    c[(d + 8) >> 2] = b;
+                  }
+              }
+              return b | 0;
+            }
+            function wH(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0.0,
+                f = 0;
+              f = l;
+              l = (l + 16) | 0;
+              d = f;
+              e = +s5(a, d);
+              d = c[d >> 2] | 0;
+              if ((d | 0) == (a | 0)) d = 0;
+              else h[b >> 3] = e;
+              l = f;
+              return d | 0;
+            }
+            function xH(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = l;
+              l = (l + 16) | 0;
+              e = d;
+              a = zH(a, e) | 0;
+              e = c[e >> 2] | 0;
+              c[b >> 2] = (e | 0) < 0 ? 0 : e | 0 ? 2 : 1;
+              l = d;
+              return a | 0;
+            }
+            function yH(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = l;
+              l = (l + 16) | 0;
+              e = d;
+              c[b >> 2] = T2(a, e, 10) | 0;
+              b = c[e >> 2] | 0;
+              l = d;
+              return ((b | 0) == (a | 0) ? 0 : b) | 0;
+            }
+            function zH(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = l;
+              l = (l + 16) | 0;
+              e = d;
+              c[b >> 2] = y4(a, e, 10) | 0;
+              b = c[e >> 2] | 0;
+              l = d;
+              return ((b | 0) == (a | 0) ? 0 : b) | 0;
+            }
+            function AH(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              o = l;
+              l = (l + 16) | 0;
+              m = o;
+              c[b >> 2] = 1;
+              n = (b + 8) | 0;
+              i = wH(a, n) | 0;
+              do
+                if (
+                  (
+                    (
+                      ((i | 0) != 0 ? ((j = wH(i, (b + 16) | 0) | 0), (j | 0) != 0) : 0)
+                        ? ((e = wH(j, (b + 24) | 0) | 0), (e | 0) != 0)
+                        : 0
+                    )
+                      ? ((f = wH(e, (b + 32) | 0) | 0), (f | 0) != 0)
+                      : 0
+                  )
+                    ? ((k = (b + 40) | 0), (d = zH(f, k) | 0), (d | 0) != 0)
+                    : 0
+                ) {
+                  b = c[k >> 2] | 0;
+                  f = V1(b, 8) | 0;
+                  e = 0;
+                  while (1) {
+                    if ((e | 0) >= (b | 0)) {
+                      d = 13;
+                      break;
+                    }
+                    d = wH(d, m) | 0;
+                    if (!d) {
+                      d = 9;
+                      break;
+                    }
+                    g[(f + (e << 3)) >> 2] = +h[m >> 3];
+                    d = uH(d, (f + (e << 3) + 4) | 0) | 0;
+                    if (!d) {
+                      d = 12;
+                      break;
+                    }
+                    e = (e + 1) | 0;
+                    b = c[k >> 2] | 0;
+                  }
+                  if ((d | 0) == 9) {
+                    U1(f);
+                    a = 0;
+                    break;
+                  } else if ((d | 0) == 12) {
+                    U1(f);
+                    a = 0;
+                    break;
+                  } else if ((d | 0) == 13) {
+                    c[(n + 36) >> 2] = f;
+                    break;
+                  }
+                } else a = 0;
+              while (0);
+              l = o;
+              return a | 0;
+            }
+            function BH(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              p = l;
+              l = (l + 16) | 0;
+              n = p;
+              c[b >> 2] = 2;
+              k = wH(a, (b + 8) | 0) | 0;
+              do
+                if (
+                  (
+                    (
+                      (
+                        (
+                          ((k | 0) != 0 ? ((m = wH(k, (b + 16) | 0) | 0), (m | 0) != 0) : 0)
+                            ? ((e = wH(m, (b + 24) | 0) | 0), (e | 0) != 0)
+                            : 0
+                        )
+                          ? ((f = wH(e, (b + 32) | 0) | 0), (f | 0) != 0)
+                          : 0
+                      )
+                        ? ((i = wH(f, (b + 40) | 0) | 0), (i | 0) != 0)
+                        : 0
+                    )
+                      ? ((j = wH(i, (b + 48) | 0) | 0), (j | 0) != 0)
+                      : 0
+                  )
+                    ? ((o = (b + 56) | 0), (d = zH(j, o) | 0), (d | 0) != 0)
+                    : 0
+                ) {
+                  e = c[o >> 2] | 0;
+                  i = V1(e, 8) | 0;
+                  f = 0;
+                  while (1) {
+                    if ((f | 0) >= (e | 0)) {
+                      d = 15;
+                      break;
+                    }
+                    d = wH(d, n) | 0;
+                    if (!d) {
+                      d = 11;
+                      break;
+                    }
+                    g[(i + (f << 3)) >> 2] = +h[n >> 3];
+                    d = uH(d, (i + (f << 3) + 4) | 0) | 0;
+                    if (!d) {
+                      d = 14;
+                      break;
+                    }
+                    f = (f + 1) | 0;
+                    e = c[o >> 2] | 0;
+                  }
+                  if ((d | 0) == 11) {
+                    U1(i);
+                    a = 0;
+                    break;
+                  } else if ((d | 0) == 14) {
+                    U1(i);
+                    a = 0;
+                    break;
+                  } else if ((d | 0) == 15) {
+                    c[(b + 60) >> 2] = i;
+                    break;
+                  }
+                } else a = 0;
+              while (0);
+              l = p;
+              return a | 0;
+            }
+            function CH(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              return qH(a, b, c, 0) | 0;
+            }
+            function DH(a) {
+              a = a | 0;
+              return CH(a, 0, 0) | 0;
+            }
+            function EH(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              e = c[(a + 12) >> 2] | 0;
+              if (a | 0) {
+                f = c[(a + 8) >> 2] | 0;
+                g = (a + 4) | 0;
+                h = (e | 0) == 0;
+                b = 0;
+                while (1) {
+                  if ((b | 0) >= (c[a >> 2] | 0)) break;
+                  d = (f + (O(c[g >> 2] | 0, b) | 0)) | 0;
+                  if (!h) tb[e & 127](d);
+                  FH(d);
+                  b = (b + 1) | 0;
+                }
+                U1(f);
+                U1(a);
+              }
+              return;
+            }
+            function FH(a) {
+              a = a | 0;
+              switch (c[a >> 2] | 0) {
+                case 3:
+                case 2: {
+                  U1(c[(a + 8 + 4) >> 2] | 0);
+                  break;
+                }
+                case 5:
+                case 4: {
+                  U1(c[(a + 8 + 4) >> 2] | 0);
+                  break;
+                }
+                case 6: {
+                  U1(c[(a + 8 + 4) >> 2] | 0);
+                  break;
+                }
+                case 7: {
+                  U1(c[(a + 40) >> 2] | 0);
+                  break;
+                }
+                case 9:
+                case 8: {
+                  U1(c[(a + 8) >> 2] | 0);
+                  break;
+                }
+                case 14:
+                case 13: {
+                  GH((a + 8) | 0);
+                  break;
+                }
+                case 10: {
+                  U1(c[(a + 16) >> 2] | 0);
+                  break;
+                }
+                case 11: {
+                  U1(c[(a + 8) >> 2] | 0);
+                  break;
+                }
+                case 12: {
+                  U1(c[(a + 40) >> 2] | 0);
+                  break;
+                }
+                default: {
+                }
+              }
+              return;
+            }
+            function GH(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              switch (c[a >> 2] | 0) {
+                case 1: {
+                  e = (a + 40) | 0;
+                  b = (a + 8 + 36) | 0;
+                  a = 0;
+                  while (1) {
+                    d = c[b >> 2] | 0;
+                    if ((a | 0) >= (c[e >> 2] | 0)) break;
+                    U1(c[(d + (a << 3) + 4) >> 2] | 0);
+                    a = (a + 1) | 0;
+                  }
+                  U1(d);
+                  break;
+                }
+                case 2: {
+                  e = (a + 56) | 0;
+                  d = (a + 60) | 0;
+                  a = 0;
+                  while (1) {
+                    b = c[d >> 2] | 0;
+                    if ((a | 0) >= (c[e >> 2] | 0)) break;
+                    U1(c[(b + (a << 3) + 4) >> 2] | 0);
+                    a = (a + 1) | 0;
+                  }
+                  U1(b);
+                  break;
+                }
+                default: {
+                }
+              }
+              return;
+            }
+            function HH(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              o = l;
+              l = (l + 16) | 0;
+              k = (o + 4) | 0;
+              n = o;
+              c[d >> 2] = 0;
+              c[e >> 2] = ((xB(xC(b) | 0) | 0) != 0) & 1;
+              f = c[47184] | 0;
+              a: do
+                if (f | 0 ? ((h = RA(b, f) | 0), (i = a[h >> 0] | 0), (i << 24) >> 24) : 0) {
+                  f = 20388;
+                  while (1) {
+                    g = c[f >> 2] | 0;
+                    if (!g) break a;
+                    if ((i << 24) >> 24 == (a[g >> 0] | 0) ? (s2(h, g) | 0) == 0 : 0) break;
+                    f = (f + 12) | 0;
+                  }
+                  c[d >> 2] = c[(f + 4) >> 2];
+                  c[e >> 2] = c[(f + 8) >> 2];
+                }
+              while (0);
+              f = c[47195] | 0;
+              if ((f | 0 ? (c[e >> 2] | 0) == 1 : 0) ? ((j = RA(b, f) | 0), a[j >> 0] | 0) : 0) IH(j, e);
+              f = c[47196] | 0;
+              if ((f | 0 ? (c[d >> 2] | 0) == 1 : 0) ? ((m = RA(b, f) | 0), a[m >> 0] | 0) : 0) IH(m, d);
+              if (a[((c[(b + 16) >> 2] | 0) + 153) >> 0] | 0) {
+                j = (b + -48) | 0;
+                i = xC(c[((((c[b >> 2] & 3) | 0) == 2 ? b : j) + 40) >> 2] | 0) | 0;
+                m = c[b >> 2] & 3;
+                HH(
+                  iB(
+                    i,
+                    c[(((m | 0) == 2 ? b : j) + 40) >> 2] | 0,
+                    c[(((m | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0,
+                    0,
+                    0
+                  ) | 0,
+                  k,
+                  n
+                );
+                c[e >> 2] = c[k >> 2] | c[e >> 2];
+                c[d >> 2] = c[n >> 2] | c[d >> 2];
+              }
+              l = o;
+              return;
+            }
+            function IH(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              o = l;
+              l = (l + 16) | 0;
+              m = o;
+              k = (o + 4) | 0;
+              j = 0;
+              e = 0;
+              a: while (1) {
+                c[d >> 2] = e;
+                g = (j | 0) < 4;
+                h = (j | 0) == 3;
+                i = (j | 0) == 0;
+                while (1) {
+                  if (!(g & ((a[b >> 0] | 0) != 0))) break a;
+                  c[k >> 2] = 0;
+                  f = JH(b, k) | 0;
+                  e = c[k >> 2] | 0;
+                  if (!e) {
+                    n = 5;
+                    break a;
+                  }
+                  b = (e | 0) == 8;
+                  if (!(h & b)) {
+                    if (!(i & b)) break;
+                    if (a[f >> 0] | 0) break;
+                  }
+                  c[k >> 2] = 0;
+                  b = f;
+                }
+                e = c[d >> 2] | (e << (j << 3));
+                j = (j + 1) | 0;
+                b = f;
+              }
+              if ((n | 0) == 5) {
+                c[m >> 2] = b;
+                gA(0, 99694, m) | 0;
+              }
+              l = o;
+              return;
+            }
+            function JH(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              f = l;
+              l = (l + 16) | 0;
+              e = f;
+              c[e >> 2] = 0;
+              d = KH(a, 20448, e) | 0;
+              if ((d | 0) == (a | 0)) {
+                while (1) {
+                  d = KH(a, 20464, e) | 0;
+                  if ((a | 0) == (d | 0)) break;
+                  else a = d;
+                }
+                d = KH(a, 20512, e) | 0;
+              }
+              a = c[e >> 2] | 0;
+              if (((a | 0) != 0) & (((a & 15) | 0) == 0)) {
+                a = a | 1;
+                c[e >> 2] = a;
+              }
+              c[b >> 2] = c[b >> 2] | a;
+              l = f;
+              return d | 0;
+            }
+            function KH(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              while (1) {
+                e = c[b >> 2] | 0;
+                if (!e) break;
+                f = l2(e) | 0;
+                if (!(Q2(a, e, f) | 0)) {
+                  g = 4;
+                  break;
+                }
+                b = (b + 8) | 0;
+              }
+              if ((g | 0) == 4) {
+                c[d >> 2] = c[d >> 2] | c[(b + 4) >> 2];
+                a = (a + f) | 0;
+              }
+              return a | 0;
+            }
+            function LH(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0;
+              g = 0;
+              d = 0.0;
+              while (1) {
+                if ((g | 0) == 4) break;
+                f = (b >> (g << 3)) & 15;
+                e = 1400;
+                while (1) {
+                  if (!(c[(e + 16) >> 2] | 0)) break;
+                  if ((f | 0) == (c[e >> 2] | 0)) {
+                    i = 6;
+                    break;
+                  }
+                  e = (e + 24) | 0;
+                }
+                if ((i | 0) == 6) {
+                  i = 0;
+                  d = +h[(e + 8) >> 3] + d;
+                }
+                g = (g + 1) | 0;
+              }
+              return +(d * 10.0 * +_O(a, c[47188] | 0, 1.0, 0.0));
+            }
+            function MH(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = +e;
+              f = +f;
+              g = g | 0;
+              var i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                m = 0,
+                n = 0.0,
+                o = 0,
+                p = 0;
+              p = l;
+              l = (l + 96) | 0;
+              m = (p + 80) | 0;
+              o = p;
+              k = f > 4.0 ? f * 0.0875 : 0.35;
+              i = +h[(d + 8) >> 3];
+              n = i * k;
+              j = +h[d >> 3];
+              k = j * k;
+              e = +h[b >> 3];
+              j = e + j;
+              h[m >> 3] = j;
+              f = +h[(b + 8) >> 3];
+              i = i + f;
+              h[(m + 8) >> 3] = i;
+              d = (o + 64) | 0;
+              if (!(g & 32)) {
+                c[d >> 2] = c[m >> 2];
+                c[(d + 4) >> 2] = c[(m + 4) >> 2];
+                c[(d + 8) >> 2] = c[(m + 8) >> 2];
+                c[(d + 12) >> 2] = c[(m + 12) >> 2];
+                c[o >> 2] = c[m >> 2];
+                c[(o + 4) >> 2] = c[(m + 4) >> 2];
+                c[(o + 8) >> 2] = c[(m + 8) >> 2];
+                c[(o + 12) >> 2] = c[(m + 12) >> 2];
+                m = (o + 32) | 0;
+                c[m >> 2] = c[b >> 2];
+                c[(m + 4) >> 2] = c[(b + 4) >> 2];
+                c[(m + 8) >> 2] = c[(b + 8) >> 2];
+                c[(m + 12) >> 2] = c[(b + 12) >> 2];
+                f = i;
+                e = j;
+              } else {
+                c[d >> 2] = c[b >> 2];
+                c[(d + 4) >> 2] = c[(b + 4) >> 2];
+                c[(d + 8) >> 2] = c[(b + 8) >> 2];
+                c[(d + 12) >> 2] = c[(b + 12) >> 2];
+                c[o >> 2] = c[b >> 2];
+                c[(o + 4) >> 2] = c[(b + 4) >> 2];
+                c[(o + 8) >> 2] = c[(b + 8) >> 2];
+                c[(o + 12) >> 2] = c[(b + 12) >> 2];
+                b = (o + 32) | 0;
+                c[b >> 2] = c[m >> 2];
+                c[(b + 4) >> 2] = c[(m + 4) >> 2];
+                c[(b + 8) >> 2] = c[(m + 8) >> 2];
+                c[(b + 12) >> 2] = c[(m + 12) >> 2];
+              }
+              h[(o + 16) >> 3] = e + n;
+              h[(o + 24) >> 3] = f - k;
+              h[(o + 48) >> 3] = e - n;
+              h[(o + 56) >> 3] = f + k;
+              do
+                if (!(g & 64))
+                  if (!(g & 128)) {
+                    nS(a, (o + 16) | 0, 3, ((g >>> 4) & 1) ^ 1);
+                    break;
+                  } else {
+                    nS(a, (o + 32) | 0, 3, ((g >>> 4) & 1) ^ 1);
+                    break;
+                  }
+                else nS(a, o, 3, ((g >>> 4) & 1) ^ 1);
+              while (0);
+              l = p;
+              return;
+            }
+            function NH(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = +e;
+              f = +f;
+              g = g | 0;
+              var i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                m = 0.0,
+                n = 0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0,
+                r = 0.0,
+                s = 0.0,
+                t = 0.0,
+                u = 0.0,
+                v = 0.0,
+                w = 0,
+                x = 0,
+                y = 0;
+              x = l;
+              l = (l + 160) | 0;
+              n = (x + 144) | 0;
+              w = x;
+              q = e * 4.0;
+              y = ((g & 32) | 0) == 0;
+              q = !(q < f) | y ? 0.45 : (f / q) * 0.45;
+              s = !(f > 1.0) | y ? 0.0 : ((f + -1.0) * 0.05) / e;
+              u = +h[(d + 8) >> 3];
+              r = -u;
+              v = q * r;
+              t = +h[d >> 3];
+              q = t * q;
+              r = s * r;
+              s = t * s;
+              p = +h[b >> 3];
+              e = p + t;
+              h[n >> 3] = e;
+              o = +h[(b + 8) >> 3];
+              f = u + o;
+              h[(n + 8) >> 3] = f;
+              t = t * 0.5 + p;
+              u = u * 0.5 + o;
+              d = (w + 128) | 0;
+              if (y) {
+                c[d >> 2] = c[n >> 2];
+                c[(d + 4) >> 2] = c[(n + 4) >> 2];
+                c[(d + 8) >> 2] = c[(n + 8) >> 2];
+                c[(d + 12) >> 2] = c[(n + 12) >> 2];
+                c[w >> 2] = c[n >> 2];
+                c[(w + 4) >> 2] = c[(n + 4) >> 2];
+                c[(w + 8) >> 2] = c[(n + 8) >> 2];
+                c[(w + 12) >> 2] = c[(n + 12) >> 2];
+                y = (w + 64) | 0;
+                c[y >> 2] = c[b >> 2];
+                c[(y + 4) >> 2] = c[(b + 4) >> 2];
+                c[(y + 8) >> 2] = c[(b + 8) >> 2];
+                c[(y + 12) >> 2] = c[(b + 12) >> 2];
+                i = o;
+                j = p;
+                k = o;
+                m = p;
+                f = o;
+                e = p;
+              } else {
+                c[d >> 2] = c[b >> 2];
+                c[(d + 4) >> 2] = c[(b + 4) >> 2];
+                c[(d + 8) >> 2] = c[(b + 8) >> 2];
+                c[(d + 12) >> 2] = c[(b + 12) >> 2];
+                c[w >> 2] = c[b >> 2];
+                c[(w + 4) >> 2] = c[(b + 4) >> 2];
+                c[(w + 8) >> 2] = c[(b + 8) >> 2];
+                c[(w + 12) >> 2] = c[(b + 12) >> 2];
+                y = (w + 64) | 0;
+                c[y >> 2] = c[n >> 2];
+                c[(y + 4) >> 2] = c[(n + 4) >> 2];
+                c[(y + 8) >> 2] = c[(n + 8) >> 2];
+                c[(y + 12) >> 2] = c[(n + 12) >> 2];
+                i = f + s;
+                j = e + r;
+                k = f - s;
+                m = e - r;
+              }
+              h[(w + 16) >> 3] = e - v;
+              h[(w + 24) >> 3] = f - q;
+              h[(w + 32) >> 3] = t - r;
+              h[(w + 40) >> 3] = u - s;
+              h[(w + 48) >> 3] = m;
+              h[(w + 56) >> 3] = k;
+              h[(w + 80) >> 3] = j;
+              h[(w + 88) >> 3] = i;
+              h[(w + 96) >> 3] = t + r;
+              h[(w + 104) >> 3] = u + s;
+              h[(w + 112) >> 3] = e + v;
+              h[(w + 120) >> 3] = f + q;
+              do
+                if (!(g & 64))
+                  if (!(g & 128)) {
+                    nS(a, w, 9, 1);
+                    break;
+                  } else {
+                    nS(a, (w + 48) | 0, 6, 1);
+                    break;
+                  }
+                else nS(a, w, 6, 1);
+              while (0);
+              l = x;
+              return;
+            }
+            function OH(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = +e;
+              f = +f;
+              g = g | 0;
+              var i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                m = 0.0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0.0,
+                t = 0.0;
+              q = l;
+              l = (l + 64) | 0;
+              p = q;
+              t = +h[(d + 8) >> 3];
+              s = +h[d >> 3];
+              k = +h[b >> 3];
+              e = k + s;
+              m = +h[(b + 8) >> 3];
+              f = m + t;
+              i = k + s * 0.2;
+              j = m + t * 0.2;
+              k = k + s * 0.6;
+              m = m + t * 0.6;
+              h[p >> 3] = i - t;
+              h[(p + 8) >> 3] = j + s;
+              n = (p + 16) | 0;
+              h[n >> 3] = i + t;
+              o = (p + 24) | 0;
+              h[o >> 3] = j - s;
+              h[(p + 32) >> 3] = k + t;
+              h[(p + 40) >> 3] = m - s;
+              h[(p + 48) >> 3] = k - t;
+              h[(p + 56) >> 3] = m + s;
+              if (!(g & 64)) {
+                if ((g & 128) | 0) {
+                  d = 2;
+                  g = 1;
+                  r = 3;
+                }
+              } else {
+                d = 3;
+                g = 0;
+                r = 3;
+              }
+              if ((r | 0) == 3) {
+                h[(p + (g << 4)) >> 3] = i;
+                h[(p + (g << 4) + 8) >> 3] = j;
+                h[(p + (d << 4)) >> 3] = k;
+                h[(p + (d << 4) + 8) >> 3] = m;
+              }
+              nS(a, p, 4, 1);
+              c[p >> 2] = c[b >> 2];
+              c[(p + 4) >> 2] = c[(b + 4) >> 2];
+              c[(p + 8) >> 2] = c[(b + 8) >> 2];
+              c[(p + 12) >> 2] = c[(b + 12) >> 2];
+              h[n >> 3] = e;
+              h[o >> 3] = f;
+              qS(a, p, 2);
+              l = q;
+              return;
+            }
+            function PH(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = +e;
+              f = +f;
+              g = g | 0;
+              var i = 0.0,
+                j = 0.0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0.0,
+                r = 0.0,
+                s = 0.0,
+                t = 0.0;
+              o = l;
+              l = (l + 64) | 0;
+              n = o;
+              j = +h[(d + 8) >> 3];
+              r = j * -0.4;
+              i = +h[d >> 3];
+              q = i * 0.4;
+              t = +h[b >> 3];
+              e = t + i * 0.8;
+              s = +h[(b + 8) >> 3];
+              f = s + j * 0.8;
+              i = t + i;
+              j = s + j;
+              h[n >> 3] = t + r;
+              k = (n + 8) | 0;
+              h[k >> 3] = s + q;
+              d = (n + 16) | 0;
+              h[d >> 3] = t - r;
+              m = (n + 24) | 0;
+              h[m >> 3] = s - q;
+              h[(n + 32) >> 3] = e - r;
+              h[(n + 40) >> 3] = f - q;
+              h[(n + 48) >> 3] = e + r;
+              h[(n + 56) >> 3] = f + q;
+              if (!(g & 64)) {
+                if ((g & 128) | 0) {
+                  c[d >> 2] = c[b >> 2];
+                  c[(d + 4) >> 2] = c[(b + 4) >> 2];
+                  c[(d + 8) >> 2] = c[(b + 8) >> 2];
+                  c[(d + 12) >> 2] = c[(b + 12) >> 2];
+                  d = 2;
+                  p = 5;
+                }
+              } else {
+                c[n >> 2] = c[b >> 2];
+                c[(n + 4) >> 2] = c[(b + 4) >> 2];
+                c[(n + 8) >> 2] = c[(b + 8) >> 2];
+                c[(n + 12) >> 2] = c[(b + 12) >> 2];
+                d = 3;
+                p = 5;
+              }
+              if ((p | 0) == 5) {
+                h[(n + (d << 4)) >> 3] = e;
+                h[(n + (d << 4) + 8) >> 3] = f;
+              }
+              nS(a, n, 4, ((g >>> 4) & 1) ^ 1);
+              h[n >> 3] = e;
+              h[k >> 3] = f;
+              h[(n + 16) >> 3] = i;
+              h[m >> 3] = j;
+              qS(a, n, 2);
+              l = o;
+              return;
+            }
+            function QH(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = +e;
+              f = +f;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0.0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0;
+              j = l;
+              l = (l + 80) | 0;
+              i = j;
+              n = +h[(d + 8) >> 3];
+              k = n * -0.3333333333333333;
+              p = +h[d >> 3];
+              f = p * 0.3333333333333333;
+              q = +h[b >> 3];
+              m = q + p * 0.5;
+              o = +h[(b + 8) >> 3];
+              e = o + n * 0.5;
+              d = (i + 64) | 0;
+              h[(i + 64) >> 3] = q + p;
+              h[(i + 72) >> 3] = o + n;
+              c[i >> 2] = c[d >> 2];
+              c[(i + 4) >> 2] = c[(d + 4) >> 2];
+              c[(i + 8) >> 2] = c[(d + 8) >> 2];
+              c[(i + 12) >> 2] = c[(d + 12) >> 2];
+              h[(i + 16) >> 3] = m + k;
+              h[(i + 24) >> 3] = e + f;
+              d = (i + 32) | 0;
+              c[d >> 2] = c[b >> 2];
+              c[(d + 4) >> 2] = c[(b + 4) >> 2];
+              c[(d + 8) >> 2] = c[(b + 8) >> 2];
+              c[(d + 12) >> 2] = c[(b + 12) >> 2];
+              h[(i + 48) >> 3] = m - k;
+              h[(i + 56) >> 3] = e - f;
+              do
+                if (!(g & 64)) {
+                  d = ((g >>> 4) & 1) ^ 1;
+                  if (!(g & 128)) {
+                    nS(a, i, 4, d);
+                    break;
+                  } else {
+                    nS(a, i, 3, d);
+                    break;
+                  }
+                } else nS(a, d, 3, ((g >>> 4) & 1) ^ 1);
+              while (0);
+              l = j;
+              return;
+            }
+            function RH(a, b, c, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = +d;
+              e = +e;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0.0,
+                m = 0.0;
+              g = l;
+              l = (l + 32) | 0;
+              i = g;
+              k = +h[c >> 3];
+              e = +h[(c + 8) >> 3];
+              d = +C(+(e * e + k * k)) * 0.5;
+              m = +h[b >> 3];
+              k = k * 0.5;
+              h[i >> 3] = m + k - d;
+              j = +h[(b + 8) >> 3];
+              e = e * 0.5;
+              h[(i + 8) >> 3] = j - d + e;
+              h[(i + 16) >> 3] = m + d + k;
+              h[(i + 24) >> 3] = j + d + e;
+              mS(a, i, 2, ((f >>> 4) & 1) ^ 1);
+              l = g;
+              return;
+            }
+            function SH(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = +e;
+              f = +f;
+              g = g | 0;
+              var i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0;
+              t = l;
+              l = (l + 112) | 0;
+              q = (t + 48) | 0;
+              r = (t + 16) | 0;
+              s = t;
+              n = f > 4.0 ? f * 0.125 : 0.5;
+              p = +h[b >> 3];
+              o = +h[d >> 3];
+              i = +h[(b + 8) >> 3];
+              m = +h[(d + 8) >> 3];
+              e = m * n;
+              f = o * n;
+              c[r >> 2] = c[b >> 2];
+              c[(r + 4) >> 2] = c[(b + 4) >> 2];
+              c[(r + 8) >> 2] = c[(b + 8) >> 2];
+              c[(r + 12) >> 2] = c[(b + 12) >> 2];
+              h[(r + 16) >> 3] = o + p;
+              h[(r + 24) >> 3] = m + i;
+              h[q >> 3] = n * (o - m) + p;
+              j = n * (m + o);
+              k = j + i;
+              h[(q + 8) >> 3] = k;
+              h[(q + 48) >> 3] = j + p;
+              i = n * (m - o) + i;
+              h[(q + 56) >> 3] = i;
+              o = e * -0.95;
+              m = o + f + p;
+              n = f * 1.3333333333333333;
+              if (!(g & 32)) {
+                e = e * 1.3333333333333333;
+                j = f * -0.33333333333333326;
+                i = i - e;
+                f = k - e;
+                e = m - n;
+              } else {
+                e = e * 1.3333333333333333;
+                j = f * 2.333333333333333;
+                i = i + e;
+                f = k + e;
+                e = m + n;
+              }
+              h[(q + 16) >> 3] = e;
+              h[(q + 24) >> 3] = f;
+              h[(q + 32) >> 3] = j - o + p;
+              h[(q + 40) >> 3] = i;
+              qS(a, r, 2);
+              if (!(g & 64)) {
+                if ((g & 128) | 0) kP(s, q, 3, 0.5, q, 0);
+              } else kP(s, q, 3, 0.5, 0, q);
+              pS(a, q, 4, 0, 0, 0);
+              l = t;
+              return;
+            }
+            function TH(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = +e;
+              f = +f;
+              g = g | 0;
+              var i = 0;
+              g = l;
+              l = (l + 32) | 0;
+              i = g;
+              e = +h[d >> 3] + +h[b >> 3];
+              f = +h[(d + 8) >> 3] + +h[(b + 8) >> 3];
+              c[i >> 2] = c[b >> 2];
+              c[(i + 4) >> 2] = c[(b + 4) >> 2];
+              c[(i + 8) >> 2] = c[(b + 8) >> 2];
+              c[(i + 12) >> 2] = c[(b + 12) >> 2];
+              h[(i + 16) >> 3] = e;
+              h[(i + 24) >> 3] = f;
+              qS(a, i, 2);
+              l = g;
+              return;
+            }
+            function UH(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0.0,
+                q = 0,
+                r = 0,
+                s = 0;
+              n = l;
+              l = (l + 80) | 0;
+              j = (n + 72) | 0;
+              k = (n + 8) | 0;
+              m = n;
+              i = +LH(a, g);
+              i = i * i;
+              h[m >> 3] = i;
+              c[(f + 12) >> 2] = g;
+              g = (f + 32) | 0;
+              a = (e + 3) | 0;
+              f = (b + (a << 4)) | 0;
+              c[g >> 2] = c[f >> 2];
+              c[(g + 4) >> 2] = c[(f + 4) >> 2];
+              c[(g + 8) >> 2] = c[(f + 8) >> 2];
+              c[(g + 12) >> 2] = c[(f + 12) >> 2];
+              if (
+                (e | 0) > (d | 0)
+                  ? ((o = +h[(b + (e << 4)) >> 3] - +h[f >> 3]),
+                    (p = +h[(b + (e << 4) + 8) >> 3] - +h[(b + (a << 4) + 8) >> 3]),
+                    p * p + o * o < i)
+                  : 0
+              )
+                e = (e + -3) | 0;
+              s = (k + 48) | 0;
+              r = (b + (e << 4)) | 0;
+              c[s >> 2] = c[r >> 2];
+              c[(s + 4) >> 2] = c[(r + 4) >> 2];
+              c[(s + 8) >> 2] = c[(r + 8) >> 2];
+              c[(s + 12) >> 2] = c[(r + 12) >> 2];
+              q = (k + 32) | 0;
+              a = (b + ((e + 1) << 4)) | 0;
+              c[q >> 2] = c[a >> 2];
+              c[(q + 4) >> 2] = c[(a + 4) >> 2];
+              c[(q + 8) >> 2] = c[(a + 8) >> 2];
+              c[(q + 12) >> 2] = c[(a + 12) >> 2];
+              f = (k + 16) | 0;
+              d = (b + ((e + 2) << 4)) | 0;
+              c[f >> 2] = c[d >> 2];
+              c[(f + 4) >> 2] = c[(d + 4) >> 2];
+              c[(f + 8) >> 2] = c[(d + 8) >> 2];
+              c[(f + 12) >> 2] = c[(d + 12) >> 2];
+              c[k >> 2] = c[g >> 2];
+              c[(k + 4) >> 2] = c[(g + 4) >> 2];
+              c[(k + 8) >> 2] = c[(g + 8) >> 2];
+              c[(k + 12) >> 2] = c[(g + 12) >> 2];
+              c[j >> 2] = k;
+              c[(j + 4) >> 2] = m;
+              $N(j, 92, k, 1);
+              c[r >> 2] = c[s >> 2];
+              c[(r + 4) >> 2] = c[(s + 4) >> 2];
+              c[(r + 8) >> 2] = c[(s + 8) >> 2];
+              c[(r + 12) >> 2] = c[(s + 12) >> 2];
+              c[a >> 2] = c[q >> 2];
+              c[(a + 4) >> 2] = c[(q + 4) >> 2];
+              c[(a + 8) >> 2] = c[(q + 8) >> 2];
+              c[(a + 12) >> 2] = c[(q + 12) >> 2];
+              c[d >> 2] = c[f >> 2];
+              c[(d + 4) >> 2] = c[(f + 4) >> 2];
+              c[(d + 8) >> 2] = c[(f + 8) >> 2];
+              c[(d + 12) >> 2] = c[(f + 12) >> 2];
+              m = (b + ((e + 3) << 4)) | 0;
+              c[m >> 2] = c[k >> 2];
+              c[(m + 4) >> 2] = c[(k + 4) >> 2];
+              c[(m + 8) >> 2] = c[(k + 8) >> 2];
+              c[(m + 12) >> 2] = c[(k + 12) >> 2];
+              l = n;
+              return e | 0;
+            }
+            function VH(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0;
+              f = c[a >> 2] | 0;
+              d = +h[b >> 3] - +h[f >> 3];
+              e = +h[(b + 8) >> 3] - +h[(f + 8) >> 3];
+              return (e * e + d * d <= +h[c[(a + 4) >> 2] >> 3]) | 0;
+            }
+            function WH(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0.0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0.0,
+                q = 0.0,
+                r = 0,
+                s = 0;
+              o = l;
+              l = (l + 80) | 0;
+              k = (o + 72) | 0;
+              m = (o + 8) | 0;
+              n = o;
+              j = +LH(a, g);
+              j = j * j;
+              h[n >> 3] = j;
+              c[(f + 8) >> 2] = g;
+              f = (f + 16) | 0;
+              a = (b + (d << 4)) | 0;
+              c[f >> 2] = c[a >> 2];
+              c[(f + 4) >> 2] = c[(a + 4) >> 2];
+              c[(f + 8) >> 2] = c[(a + 8) >> 2];
+              c[(f + 12) >> 2] = c[(a + 12) >> 2];
+              if (
+                !((e | 0) > (d | 0)
+                  ? ((i = (d + 3) | 0),
+                    (p = +h[a >> 3] - +h[(b + (i << 4)) >> 3]),
+                    (q = +h[(b + (d << 4) + 8) >> 3] - +h[(b + (i << 4) + 8) >> 3]),
+                    q * q + p * p < j)
+                  : 0)
+              )
+                i = d;
+              e = (b + ((i + 3) << 4)) | 0;
+              c[m >> 2] = c[e >> 2];
+              c[(m + 4) >> 2] = c[(e + 4) >> 2];
+              c[(m + 8) >> 2] = c[(e + 8) >> 2];
+              c[(m + 12) >> 2] = c[(e + 12) >> 2];
+              g = (m + 16) | 0;
+              d = (b + ((i + 2) << 4)) | 0;
+              c[g >> 2] = c[d >> 2];
+              c[(g + 4) >> 2] = c[(d + 4) >> 2];
+              c[(g + 8) >> 2] = c[(d + 8) >> 2];
+              c[(g + 12) >> 2] = c[(d + 12) >> 2];
+              r = (m + 32) | 0;
+              a = (b + ((i + 1) << 4)) | 0;
+              c[r >> 2] = c[a >> 2];
+              c[(r + 4) >> 2] = c[(a + 4) >> 2];
+              c[(r + 8) >> 2] = c[(a + 8) >> 2];
+              c[(r + 12) >> 2] = c[(a + 12) >> 2];
+              s = (m + 48) | 0;
+              c[s >> 2] = c[f >> 2];
+              c[(s + 4) >> 2] = c[(f + 4) >> 2];
+              c[(s + 8) >> 2] = c[(f + 8) >> 2];
+              c[(s + 12) >> 2] = c[(f + 12) >> 2];
+              c[k >> 2] = s;
+              c[(k + 4) >> 2] = n;
+              $N(k, 92, m, 0);
+              n = (b + (i << 4)) | 0;
+              c[n >> 2] = c[s >> 2];
+              c[(n + 4) >> 2] = c[(s + 4) >> 2];
+              c[(n + 8) >> 2] = c[(s + 8) >> 2];
+              c[(n + 12) >> 2] = c[(s + 12) >> 2];
+              c[a >> 2] = c[r >> 2];
+              c[(a + 4) >> 2] = c[(r + 4) >> 2];
+              c[(a + 8) >> 2] = c[(r + 8) >> 2];
+              c[(a + 12) >> 2] = c[(r + 12) >> 2];
+              c[d >> 2] = c[g >> 2];
+              c[(d + 4) >> 2] = c[(g + 4) >> 2];
+              c[(d + 8) >> 2] = c[(g + 8) >> 2];
+              c[(d + 12) >> 2] = c[(g + 12) >> 2];
+              c[e >> 2] = c[m >> 2];
+              c[(e + 4) >> 2] = c[(m + 4) >> 2];
+              c[(e + 8) >> 2] = c[(m + 8) >> 2];
+              c[(e + 12) >> 2] = c[(m + 12) >> 2];
+              l = o;
+              return i | 0;
+            }
+            function XH(a, b, d, e, f, g, i) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              var j = 0.0,
+                k = 0.0,
+                l = 0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0,
+                r = 0,
+                s = 0.0,
+                t = 0.0,
+                u = 0,
+                v = 0,
+                w = 0;
+              u = (g | 0) != 0;
+              l = (i | 0) != 0;
+              if (!(((e | 0) == (d | 0)) & (u & l))) {
+                if (l) {
+                  j = +LH(a, i);
+                  k = +h[(b + (e << 4)) >> 3];
+                  p = +h[(b + (e << 4) + 8) >> 3];
+                  l = (e + 3) | 0;
+                  r = (b + (l << 4)) | 0;
+                  n = +h[r >> 3];
+                  l = (b + (l << 4) + 8) | 0;
+                  o = +h[l >> 3];
+                  t = k - n;
+                  s = p - o;
+                  t = +C(+(s * s + t * t)) * 0.9;
+                  j = j >= t ? t : j;
+                  if (p == o) {
+                    m = (k < n ? -j : j) + n;
+                    j = p;
+                  } else {
+                    m = k;
+                    j = (p < o ? -j : j) + o;
+                  }
+                  w = (e + 1) | 0;
+                  h[(b + (w << 4)) >> 3] = k;
+                  h[(b + (w << 4) + 8) >> 3] = p;
+                  e = (b + ((e + 2) << 4)) | 0;
+                  h[r >> 3] = m;
+                  h[l >> 3] = j;
+                  c[e >> 2] = c[r >> 2];
+                  c[(e + 4) >> 2] = c[(r + 4) >> 2];
+                  c[(e + 8) >> 2] = c[(r + 8) >> 2];
+                  c[(e + 12) >> 2] = c[(r + 12) >> 2];
+                  c[(f + 12) >> 2] = i;
+                  h[(f + 32) >> 3] = n;
+                  h[(f + 40) >> 3] = o;
+                }
+                if (u) {
+                  m = +LH(a, g);
+                  l = (b + (d << 4)) | 0;
+                  k = +h[l >> 3];
+                  j = +h[(b + (d << 4) + 8) >> 3];
+                  w = (d + 3) | 0;
+                  o = +h[(b + (w << 4)) >> 3];
+                  p = +h[(b + (w << 4) + 8) >> 3];
+                  t = k - o;
+                  s = j - p;
+                  t = +C(+(s * s + t * t)) * 0.9;
+                  m = m >= t ? t : m;
+                  if (j == p) {
+                    n = (k < o ? m : -m) + k;
+                    m = j;
+                  } else {
+                    n = k;
+                    m = (j < p ? m : -m) + j;
+                  }
+                  w = (d + 1) | 0;
+                  v = (b + (w << 4)) | 0;
+                  h[v >> 3] = n;
+                  h[(b + (w << 4) + 8) >> 3] = m;
+                  c[l >> 2] = c[v >> 2];
+                  c[(l + 4) >> 2] = c[(v + 4) >> 2];
+                  c[(l + 8) >> 2] = c[(v + 8) >> 2];
+                  c[(l + 12) >> 2] = c[(v + 12) >> 2];
+                  v = (d + 2) | 0;
+                  h[(b + (v << 4)) >> 3] = o;
+                  h[(b + (v << 4) + 8) >> 3] = p;
+                  v = 16;
+                }
+              } else {
+                r = (b + (e << 4)) | 0;
+                s = +h[r >> 3];
+                t = +h[(b + (e << 4) + 8) >> 3];
+                l = (e + 3) | 0;
+                u = (b + (l << 4)) | 0;
+                k = +h[u >> 3];
+                l = (b + (l << 4) + 8) | 0;
+                j = +h[l >> 3];
+                m = +LH(a, g);
+                q = +LH(a, i);
+                n = s - k;
+                p = t - j;
+                n = +C(+(p * p + n * n));
+                w = !(q + m >= n);
+                n = n * 0.3333333333333333;
+                m = w ? m : n;
+                n = w ? q : n;
+                if (t == j) {
+                  w = s < k;
+                  p = (w ? -n : n) + k;
+                  q = (w ? m : -m) + s;
+                  o = t;
+                  m = t;
+                } else {
+                  w = t < j;
+                  p = s;
+                  q = s;
+                  o = (w ? m : -m) + t;
+                  m = (w ? -n : n) + j;
+                }
+                w = (e + 1) | 0;
+                v = (b + (w << 4)) | 0;
+                h[v >> 3] = q;
+                h[(b + (w << 4) + 8) >> 3] = o;
+                c[r >> 2] = c[v >> 2];
+                c[(r + 4) >> 2] = c[(v + 4) >> 2];
+                c[(r + 8) >> 2] = c[(v + 8) >> 2];
+                c[(r + 12) >> 2] = c[(v + 12) >> 2];
+                v = (b + ((e + 2) << 4)) | 0;
+                h[u >> 3] = p;
+                h[l >> 3] = m;
+                c[v >> 2] = c[u >> 2];
+                c[(v + 4) >> 2] = c[(u + 4) >> 2];
+                c[(v + 8) >> 2] = c[(u + 8) >> 2];
+                c[(v + 12) >> 2] = c[(u + 12) >> 2];
+                c[(f + 12) >> 2] = i;
+                h[(f + 32) >> 3] = s;
+                h[(f + 40) >> 3] = t;
+                v = 16;
+              }
+              if ((v | 0) == 16) {
+                c[(f + 8) >> 2] = g;
+                h[(f + 16) >> 3] = k;
+                h[(f + 24) >> 3] = j;
+              }
+              return;
+            }
+            function YH(a, b, c, d, e) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = +d;
+              e = e | 0;
+              var f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                l = 0.0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0;
+              n = +h[b >> 3];
+              k = +h[c >> 3] - n;
+              o = +h[(b + 8) >> 3];
+              l = +h[(c + 8) >> 3] - o;
+              j = (d * 10.0) / (+C(+(k * k + l * l)) + 0.0001);
+              k = j * ((k >= 0.0 ? 0.0001 : -0.0001) + k);
+              j = ((l >= 0.0 ? 0.0001 : -0.0001) + l) * j;
+              l = k * 0.5;
+              m = j * 0.5;
+              i = n - m;
+              f = o - l;
+              n = m + n;
+              l = o + l;
+              o = i + k;
+              m = f + j;
+              k = n + k;
+              j = l + j;
+              g = o > k ? o : k;
+              g = n > g ? n : g;
+              d = m > j ? m : j;
+              d = l > d ? l : d;
+              k = o < k ? o : k;
+              k = n < k ? n : k;
+              j = m < j ? m : j;
+              j = l < j ? l : j;
+              h[a >> 3] = i < k ? i : k;
+              h[(a + 8) >> 3] = f < j ? f : j;
+              h[(a + 16) >> 3] = i > g ? i : g;
+              h[(a + 24) >> 3] = f > d ? f : d;
+              return;
+            }
+            function ZH(a, b, d, e, f, g, i) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = +f;
+              g = +g;
+              i = i | 0;
+              var j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0.0,
+                s = 0.0,
+                t = 0.0;
+              q = l;
+              l = (l + 48) | 0;
+              m = (q + 32) | 0;
+              k = (q + 16) | 0;
+              p = q;
+              n = ((c[(a + 16) >> 2] | 0) + 12) | 0;
+              o = c[n >> 2] | 0;
+              c[n >> 2] = b;
+              lS(a, c[((c[a >> 2] | 0) + 336) >> 2] | 0);
+              uS(a, g);
+              t = +h[e >> 3] - +h[d >> 3];
+              b = (e + 8) | 0;
+              s = +h[b >> 3] - +h[(d + 8) >> 3];
+              r = 10.0 / (+C(+(t * t + s * s)) + 0.0001);
+              h[e >> 3] = r * ((t >= 0.0 ? 0.0001 : -0.0001) + t);
+              h[b >> 3] = ((s >= 0.0 ? 0.0001 : -0.0001) + s) * r;
+              b = 0;
+              while (1) {
+                if ((b | 0) >= 4) break;
+                j = (i >> (b << 3)) & 255;
+                if (!j) break;
+                c[k >> 2] = c[d >> 2];
+                c[(k + 4) >> 2] = c[(d + 4) >> 2];
+                c[(k + 8) >> 2] = c[(d + 8) >> 2];
+                c[(k + 12) >> 2] = c[(d + 12) >> 2];
+                c[m >> 2] = c[e >> 2];
+                c[(m + 4) >> 2] = c[(e + 4) >> 2];
+                c[(m + 8) >> 2] = c[(e + 8) >> 2];
+                c[(m + 12) >> 2] = c[(e + 12) >> 2];
+                _H(p, a, k, m, f, g, j);
+                c[d >> 2] = c[p >> 2];
+                c[(d + 4) >> 2] = c[(p + 4) >> 2];
+                c[(d + 8) >> 2] = c[(p + 8) >> 2];
+                c[(d + 12) >> 2] = c[(p + 12) >> 2];
+                b = (b + 1) | 0;
+              }
+              c[n >> 2] = o;
+              l = q;
+              return;
+            }
+            function _H(a, b, d, e, f, g, i) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = +f;
+              g = +g;
+              i = i | 0;
+              var j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0.0;
+              q = l;
+              l = (l + 32) | 0;
+              m = (q + 16) | 0;
+              k = q;
+              n = i & 15;
+              j = 1400;
+              while (1) {
+                o = c[j >> 2] | 0;
+                if (!o) break;
+                if ((n | 0) == (o | 0)) {
+                  p = 4;
+                  break;
+                }
+                j = (j + 24) | 0;
+              }
+              if ((p | 0) == 4) {
+                r = +h[(j + 8) >> 3] * f;
+                h[e >> 3] = r * +h[e >> 3];
+                o = (e + 8) | 0;
+                h[o >> 3] = r * +h[o >> 3];
+                p = c[(j + 16) >> 2] | 0;
+                c[k >> 2] = c[d >> 2];
+                c[(k + 4) >> 2] = c[(d + 4) >> 2];
+                c[(k + 8) >> 2] = c[(d + 8) >> 2];
+                c[(k + 12) >> 2] = c[(d + 12) >> 2];
+                c[m >> 2] = c[e >> 2];
+                c[(m + 4) >> 2] = c[(e + 4) >> 2];
+                c[(m + 8) >> 2] = c[(e + 8) >> 2];
+                c[(m + 12) >> 2] = c[(e + 12) >> 2];
+                wb[p & 15](b, k, m, f, g, i);
+                h[d >> 3] = +h[e >> 3] + +h[d >> 3];
+                p = (d + 8) | 0;
+                h[p >> 3] = +h[o >> 3] + +h[p >> 3];
+              }
+              c[a >> 2] = c[d >> 2];
+              c[(a + 4) >> 2] = c[(d + 4) >> 2];
+              c[(a + 8) >> 2] = c[(d + 8) >> 2];
+              c[(a + 12) >> 2] = c[(d + 12) >> 2];
+              l = q;
+              return;
+            }
+            function $H(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 16) | 0;
+              g = (i + 8) | 0;
+              f = i;
+              d = QA(b, 99796) | 0;
+              if ((d | 0) != 0 ? (a[d >> 0] | 0) != 0 : 0) {
+                e = d;
+                h = 5;
+              } else {
+                d = QA(b, 99808) | 0;
+                if ((d | 0) != 0 ? (a[d >> 0] | 0) != 0 : 0) {
+                  e = d;
+                  h = 5;
+                } else d = 0;
+              }
+              if ((h | 0) == 5) {
+                d = CH(e, 0, 120) | 0;
+                if (!d) {
+                  c[f >> 2] = KB(b) | 0;
+                  gA(0, 99815, f) | 0;
+                  c[g >> 2] = e;
+                  gA(3, 99868, g) | 0;
+                }
+              }
+              l = i;
+              return d | 0;
+            }
+            function aI(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              g = l;
+              l = (l + 16) | 0;
+              f = JK(304) | 0;
+              if (!f) gA(1, 99876, g) | 0;
+              e = (a + 16) | 0;
+              a = c[e >> 2] | 0;
+              c[f >> 2] = a;
+              c[e >> 2] = f;
+              if (!a) {
+                c[(f + 144) >> 2] = 3;
+                c[(f + 148) >> 2] = 0;
+                h[(f + 152) >> 3] = 1.0;
+              } else {
+                b = (f + 16) | 0;
+                d = (a + 16) | 0;
+                e = (b + 40) | 0;
+                do {
+                  c[b >> 2] = c[d >> 2];
+                  b = (b + 4) | 0;
+                  d = (d + 4) | 0;
+                } while ((b | 0) < (e | 0));
+                b = (f + 56) | 0;
+                d = (a + 56) | 0;
+                e = (b + 40) | 0;
+                do {
+                  c[b >> 2] = c[d >> 2];
+                  b = (b + 4) | 0;
+                  d = (d + 4) | 0;
+                } while ((b | 0) < (e | 0));
+                c[(f + 144) >> 2] = c[(a + 144) >> 2];
+                c[(f + 148) >> 2] = c[(a + 148) >> 2];
+                h[(f + 152) >> 3] = +h[(a + 152) >> 3];
+                c[(f + 136) >> 2] = c[(a + 136) >> 2];
+                b = (f + 96) | 0;
+                d = (a + 96) | 0;
+                e = (b + 40) | 0;
+                do {
+                  c[b >> 2] = c[d >> 2];
+                  b = (b + 4) | 0;
+                  d = (d + 4) | 0;
+                } while ((b | 0) < (e | 0));
+              }
+              l = g;
+              return f | 0;
+            }
+            function bI(a) {
+              a = a | 0;
+              var b = 0;
+              a = (a + 16) | 0;
+              b = c[a >> 2] | 0;
+              if (!b) qa(99902, 99906, 117, 99913);
+              else {
+                U1(c[(b + 212) >> 2] | 0);
+                U1(c[(b + 208) >> 2] | 0);
+                U1(c[(b + 216) >> 2] | 0);
+                U1(c[(b + 220) >> 2] | 0);
+                U1(c[(b + 224) >> 2] | 0);
+                U1(c[(b + 228) >> 2] | 0);
+                U1(c[(b + 232) >> 2] | 0);
+                U1(c[(b + 236) >> 2] | 0);
+                U1(c[(b + 240) >> 2] | 0);
+                U1(c[(b + 244) >> 2] | 0);
+                U1(c[(b + 248) >> 2] | 0);
+                U1(c[(b + 252) >> 2] | 0);
+                U1(c[(b + 256) >> 2] | 0);
+                U1(c[(b + 272) >> 2] | 0);
+                U1(c[(b + 284) >> 2] | 0);
+                U1(c[(b + 280) >> 2] | 0);
+                c[a >> 2] = c[b >> 2];
+                U1(b);
+                return;
+              }
+            }
+            function cI(d, e, f, g, h, i, j) {
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              i = i | 0;
+              j = j | 0;
+              var k = 0,
+                l = 0;
+              l = c[(d + 16) >> 2] | 0;
+              k = c[(d + 152) >> 2] | 0;
+              if (((e | 0) != 0) & (((k & 32768) | 0) != 0)) c[(l + 192) >> 2] = e;
+              if (
+                (((k & 65536) | 0) != 0 ? ((c[(l + 212) >> 2] = EK(i, j) | 0), (f | 0) != 0) : 0)
+                  ? (a[f >> 0] | 0) != 0
+                  : 0
+              ) {
+                c[(l + 208) >> 2] = EK(f, j) | 0;
+                d = 1;
+              } else d = 0;
+              do
+                if (k & 4194304) {
+                  if (g | 0 ? a[g >> 0] | 0 : 0) {
+                    c[(l + 228) >> 2] = EK(g, j) | 0;
+                    d = (l + 260) | 0;
+                    b[d >> 1] = b[d >> 1] | 1;
+                    d = 1;
+                    break;
+                  }
+                  e = c[(l + 192) >> 2] | 0;
+                  if (e) {
+                    c[(l + 228) >> 2] = D4(e) | 0;
+                    d = 1;
+                  }
+                }
+              while (0);
+              if (((h | 0) != 0) & (((k & 8388608) | 0) != 0) ? (a[h >> 0] | 0) != 0 : 0) {
+                c[(l + 244) >> 2] = EK(h, j) | 0;
+                d = 1;
+              }
+              return d | 0;
+            }
+            function dI(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 80) | 0;
+              i = j;
+              h = (j + 8) | 0;
+              g = c[((c[b >> 2] | 0) + 168) >> 2] | 0;
+              f = c[((c[((c[(g + 16) >> 2] | 0) + 8) >> 2] | 0) + 92) >> 2] | 0;
+              eI(b, e);
+              b = QA(d, 141060) | 0;
+              if ((b | 0) != 0 ? (a[b >> 0] | 0) != 0 : 0) {
+                nA(e, b) | 0;
+                f = (e + 4) | 0;
+                b = c[f >> 2] | 0;
+                if (b >>> 0 >= (c[(e + 8) >> 2] | 0) >>> 0) {
+                  lA(e, 1) | 0;
+                  b = c[f >> 2] | 0;
+                }
+                a[b >> 0] = 0;
+                b = c[e >> 2] | 0;
+                c[f >> 2] = b;
+              } else {
+                if (((g | 0) != (d | 0)) & ((f | 0) != 0)) {
+                  nA(e, f) | 0;
+                  f = (e + 4) | 0;
+                  b = c[f >> 2] | 0;
+                  if (b >>> 0 >= (c[(e + 8) >> 2] | 0) >>> 0) {
+                    lA(e, 1) | 0;
+                    b = c[f >> 2] | 0;
+                  }
+                  c[f >> 2] = b + 1;
+                  a[b >> 0] = 95;
+                }
+                switch (IC(d) | 0) {
+                  case 0: {
+                    f = (g | 0) == (d | 0) ? 111494 : 99927;
+                    b = (c[d >> 2] | 0) >>> 4;
+                    break;
+                  }
+                  case 1: {
+                    f = 111481;
+                    b = (c[d >> 2] | 0) >>> 4;
+                    break;
+                  }
+                  case 2: {
+                    f = 111450;
+                    b = (c[d >> 2] | 0) >>> 4;
+                    break;
+                  }
+                  default: {
+                    f = 0;
+                    b = 0;
+                  }
+                }
+                nA(e, f) | 0;
+                c[i >> 2] = b;
+                m4(h, 99933, i) | 0;
+                nA(e, h) | 0;
+                f = (e + 4) | 0;
+                b = c[f >> 2] | 0;
+                if (b >>> 0 >= (c[(e + 8) >> 2] | 0) >>> 0) {
+                  lA(e, 1) | 0;
+                  b = c[f >> 2] | 0;
+                }
+                a[b >> 0] = 0;
+                b = c[e >> 2] | 0;
+                c[f >> 2] = b;
+              }
+              l = j;
+              return b | 0;
+            }
+            function eI(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 144) | 0;
+              h = i;
+              g = (i + 8) | 0;
+              e = c[(b + 160) >> 2] | 0;
+              if ((e | 0) > 1 ? (c[(b + 152) >> 2] & 64) | 0 : 0) {
+                nA(d, c[((c[((c[b >> 2] | 0) + 308) >> 2] | 0) + (e << 2)) >> 2] | 0) | 0;
+                f = (d + 4) | 0;
+                e = c[f >> 2] | 0;
+                if (e >>> 0 >= (c[(d + 8) >> 2] | 0) >>> 0) {
+                  lA(d, 1) | 0;
+                  e = c[f >> 2] | 0;
+                }
+                c[f >> 2] = e + 1;
+                a[e >> 0] = 95;
+              }
+              f = c[(b + 196) >> 2] | 0;
+              e = c[(b + 200) >> 2] | 0;
+              if (((f | 0) > 0) | ((e | 0) > 0)) {
+                c[h >> 2] = f;
+                c[(h + 4) >> 2] = e;
+                m4(g, 99937, h) | 0;
+                nA(d, g) | 0;
+              }
+              l = i;
+              return;
+            }
+            function fI(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0,
+                i = 0.0,
+                j = 0,
+                k = 0.0,
+                m = 0.0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0.0,
+                s = 0;
+              s = l;
+              l = (l + 48) | 0;
+              p = (s + 16) | 0;
+              f = (s + 32) | 0;
+              q = s;
+              r = +h[((c[(a + 16) >> 2] | 0) + 152) >> 3];
+              o = gI(d, 0, f) | 0;
+              if (((o + -1) | 0) >>> 0 >= 2) {
+                e = +h[(b + 16) >> 3];
+                k = (e + +h[b >> 3]) * 0.5;
+                h[q >> 3] = k;
+                i = +h[(b + 24) >> 3];
+                m = (i + +h[(b + 8) >> 3]) * 0.5;
+                h[(q + 8) >> 3] = m;
+                k = e - k;
+                m = i - m;
+                n = r > 0.5;
+                if (n) uS(a, 0.5);
+                j = c[f >> 2] | 0;
+                i = 0.0;
+                f = c[(j + 8) >> 2] | 0;
+                while (1) {
+                  d = c[f >> 2] | 0;
+                  if (!d) break;
+                  b = (f + 4) | 0;
+                  if (+g[b >> 2] == 0.0) e = i;
+                  else {
+                    jS(a, d);
+                    if (!(c[(f + 12) >> 2] | 0)) e = 6.283185307179586;
+                    else e = +g[b >> 2] * 6.283185307179586 + i;
+                    c[p >> 2] = c[q >> 2];
+                    c[(p + 4) >> 2] = c[(q + 4) >> 2];
+                    c[(p + 8) >> 2] = c[(q + 8) >> 2];
+                    c[(p + 12) >> 2] = c[(q + 12) >> 2];
+                    b = IT(p, k, m, i, e) | 0;
+                    pS(a, c[b >> 2] | 0, c[(b + 4) >> 2] | 0, 0, 0, 1);
+                    EY(b);
+                  }
+                  i = e;
+                  f = (f + 12) | 0;
+                }
+                if (n) uS(a, r);
+                hI(j);
+              }
+              l = s;
+              return o | 0;
+            }
+            function gI(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                h = 0,
+                i = 0,
+                j = 0.0,
+                k = 0.0,
+                m = 0.0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0;
+              r = l;
+              l = (l + 16) | 0;
+              o = (r + 8) | 0;
+              n = r;
+              q = JK(12) | 0;
+              i = D4(b) | 0;
+              a: do
+                if (!d) {
+                  d = 1;
+                  f = i;
+                  while (1) {
+                    switch (a[f >> 0] | 0) {
+                      case 0:
+                        break a;
+                      case 58: {
+                        d = (d + 1) | 0;
+                        break;
+                      }
+                      default: {
+                      }
+                    }
+                    f = (f + 1) | 0;
+                  }
+                }
+              while (0);
+              c[(q + 4) >> 2] = i;
+              p = JK((((d * 12) | 0) + 12) | 0) | 0;
+              c[(q + 8) >> 2] = p;
+              m = 1.0;
+              h = 0;
+              d = 0;
+              f = i;
+              while (1) {
+                f = A4(f, 107984) | 0;
+                if (!f) {
+                  f = 20;
+                  break;
+                }
+                j = +iI(f);
+                if (!(j >= 0.0)) {
+                  f = 17;
+                  break;
+                }
+                k = j - m;
+                if (k > 0.0)
+                  if ((c[5156] | 0) != 0 ? !((k < 1.0e-5) & (k > -1.0e-5)) : 0) {
+                    c[n >> 2] = b;
+                    gA(0, 99948, n) | 0;
+                    c[5156] = 0;
+                    j = m;
+                    d = 3;
+                  } else j = m;
+                k = m - j;
+                if (j > 0.0) a[(p + ((h * 12) | 0) + 8) >> 0] = 1;
+                if (a[f >> 0] | 0) c[(p + ((h * 12) | 0)) >> 2] = f;
+                f = (h + 1) | 0;
+                g[(p + ((h * 12) | 0) + 4) >> 2] = j;
+                if ((k < 1.0e-5) & (k > -1.0e-5)) {
+                  h = f;
+                  f = 30;
+                  break;
+                } else {
+                  m = k;
+                  h = f;
+                  f = 0;
+                }
+              }
+              b: do
+                if ((f | 0) == 17) {
+                  if (!(c[5156] | 0)) d = 1;
+                  else {
+                    c[o >> 2] = b;
+                    gA(1, 99983, o) | 0;
+                    c[5156] = 0;
+                    d = 2;
+                  }
+                  hI(q);
+                } else if ((f | 0) == 20)
+                  if (m > 0.0) {
+                    f = 0;
+                    i = 0;
+                    while (1) {
+                      if ((f | 0) >= (h | 0)) break;
+                      o = (i + ((+g[(p + ((f * 12) | 0) + 4) >> 2] == 0.0) & 1)) | 0;
+                      f = (f + 1) | 0;
+                      i = o;
+                    }
+                    if ((i | 0) <= 0) {
+                      f = (p + ((((h + -1) | 0) * 12) | 0) + 4) | 0;
+                      g[f >> 2] = m + +g[f >> 2];
+                      f = 30;
+                      break;
+                    }
+                    j = m / +(i | 0);
+                    f = 0;
+                    while (1) {
+                      if ((f | 0) >= (h | 0)) {
+                        f = 30;
+                        break b;
+                      }
+                      i = (p + ((f * 12) | 0) + 4) | 0;
+                      if (+g[i >> 2] == 0.0) g[i >> 2] = j;
+                      f = (f + 1) | 0;
+                    }
+                  } else f = 30;
+              while (0);
+              if ((f | 0) == 30) {
+                while (1) {
+                  f = (h + -1) | 0;
+                  if ((h | 0) <= 0) break;
+                  if (+g[(p + ((f * 12) | 0) + 4) >> 2] > 0.0) break;
+                  else h = f;
+                }
+                c[(p + ((h * 12) | 0)) >> 2] = 0;
+                c[q >> 2] = h;
+                c[e >> 2] = q;
+              }
+              l = r;
+              return d | 0;
+            }
+            function hI(a) {
+              a = a | 0;
+              U1(c[(a + 4) >> 2] | 0);
+              U1(c[(a + 8) >> 2] | 0);
+              U1(a);
+              return;
+            }
+            function iI(b) {
+              b = b | 0;
+              var d = 0.0,
+                e = 0,
+                f = 0,
+                g = 0;
+              f = l;
+              l = (l + 16) | 0;
+              e = f;
+              b = R2(b, 59) | 0;
+              if (!b) d = 0.0;
+              else {
+                g = (b + 1) | 0;
+                a[b >> 0] = 0;
+                d = +s5(g, e);
+                d = (d >= 0.0 ? (c[e >> 2] | 0) != (g | 0) : 0) ? d : -1.0;
+              }
+              l = f;
+              return +d;
+            }
+            function jI(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0.0,
+                n = 0.0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0.0,
+                t = 0;
+              t = l;
+              l = (l + 80) | 0;
+              i = (t + 64) | 0;
+              r = t;
+              s = +h[((c[(a + 16) >> 2] | 0) + 152) >> 3];
+              q = gI(d, 0, i) | 0;
+              if (((q + -1) | 0) >>> 0 >= 2) {
+                if (!e) {
+                  c[r >> 2] = c[b >> 2];
+                  c[(r + 4) >> 2] = c[(b + 4) >> 2];
+                  c[(r + 8) >> 2] = c[(b + 8) >> 2];
+                  c[(r + 12) >> 2] = c[(b + 12) >> 2];
+                  p = (r + 16) | 0;
+                  o = (b + 16) | 0;
+                  c[p >> 2] = c[o >> 2];
+                  c[(p + 4) >> 2] = c[(o + 4) >> 2];
+                  c[(p + 8) >> 2] = c[(o + 8) >> 2];
+                  c[(p + 12) >> 2] = c[(o + 12) >> 2];
+                  p = (r + 32) | 0;
+                  o = (b + 32) | 0;
+                  c[p >> 2] = c[o >> 2];
+                  c[(p + 4) >> 2] = c[(o + 4) >> 2];
+                  c[(p + 8) >> 2] = c[(o + 8) >> 2];
+                  c[(p + 12) >> 2] = c[(o + 12) >> 2];
+                  p = (r + 48) | 0;
+                  o = (b + 48) | 0;
+                  c[p >> 2] = c[o >> 2];
+                  c[(p + 4) >> 2] = c[(o + 4) >> 2];
+                  c[(p + 8) >> 2] = c[(o + 8) >> 2];
+                  c[(p + 12) >> 2] = c[(o + 12) >> 2];
+                } else {
+                  p = (b + 32) | 0;
+                  c[r >> 2] = c[p >> 2];
+                  c[(r + 4) >> 2] = c[(p + 4) >> 2];
+                  c[(r + 8) >> 2] = c[(p + 8) >> 2];
+                  c[(r + 12) >> 2] = c[(p + 12) >> 2];
+                  p = (r + 16) | 0;
+                  o = (b + 48) | 0;
+                  c[p >> 2] = c[o >> 2];
+                  c[(p + 4) >> 2] = c[(o + 4) >> 2];
+                  c[(p + 8) >> 2] = c[(o + 8) >> 2];
+                  c[(p + 12) >> 2] = c[(o + 12) >> 2];
+                  p = (r + 32) | 0;
+                  c[p >> 2] = c[b >> 2];
+                  c[(p + 4) >> 2] = c[(b + 4) >> 2];
+                  c[(p + 8) >> 2] = c[(b + 8) >> 2];
+                  c[(p + 12) >> 2] = c[(b + 12) >> 2];
+                  p = (r + 48) | 0;
+                  o = (b + 16) | 0;
+                  c[p >> 2] = c[o >> 2];
+                  c[(p + 4) >> 2] = c[(o + 4) >> 2];
+                  c[(p + 8) >> 2] = c[(o + 8) >> 2];
+                  c[(p + 12) >> 2] = c[(o + 12) >> 2];
+                }
+                k = (r + 16) | 0;
+                m = +h[k >> 3];
+                f = +h[r >> 3];
+                n = m - f;
+                o = (r + 32) | 0;
+                h[o >> 3] = f;
+                h[k >> 3] = f;
+                p = s > 0.5;
+                if (p) uS(a, 0.5);
+                i = c[i >> 2] | 0;
+                j = (r + 48) | 0;
+                e = c[(i + 8) >> 2] | 0;
+                while (1) {
+                  d = c[e >> 2] | 0;
+                  if (!d) break;
+                  b = (e + 4) | 0;
+                  if (!(+g[b >> 2] == 0.0)) {
+                    jS(a, d);
+                    if (!(c[(e + 12) >> 2] | 0)) f = m;
+                    else f = n * +g[b >> 2] + +h[r >> 3];
+                    h[o >> 3] = f;
+                    h[k >> 3] = f;
+                    nS(a, r, 4, 1);
+                    f = +h[k >> 3];
+                    h[j >> 3] = f;
+                    h[r >> 3] = f;
+                  }
+                  e = (e + 12) | 0;
+                }
+                if (p) uS(a, s);
+                hI(i);
+              }
+              l = t;
+              return q | 0;
+            }
+            function kI(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              d = c[(a + 16) >> 2] | 0;
+              e = c[(a + 152) >> 2] | 0;
+              if ((e & 4259840) | 0) {
+                f = e & 131072;
+                g = (f >>> 16) ^ 2;
+                c[(d + 264) >> 2] = g;
+                h = (d + 268) | 0;
+                c[h >> 2] = g + 2;
+                g = (d + 272) | 0;
+                U1(c[g >> 2] | 0);
+                d = JK(c[h >> 2] << 4) | 0;
+                c[g >> 2] = d;
+                c[d >> 2] = c[b >> 2];
+                c[(d + 4) >> 2] = c[(b + 4) >> 2];
+                c[(d + 8) >> 2] = c[(b + 8) >> 2];
+                c[(d + 12) >> 2] = c[(b + 12) >> 2];
+                g = (d + 16) | 0;
+                b = (b + 16) | 0;
+                c[g >> 2] = c[b >> 2];
+                c[(g + 4) >> 2] = c[(b + 4) >> 2];
+                c[(g + 8) >> 2] = c[(b + 8) >> 2];
+                c[(g + 12) >> 2] = c[(b + 12) >> 2];
+                if (!(e & 8192)) NR(a, d, d, 2) | 0;
+                if (!f) jK(d);
+              }
+              return;
+            }
+            function lI(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0,
+                d = 0.0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                m = 0.0,
+                n = 0.0,
+                o = 0,
+                p = 0,
+                q = 0;
+              q = l;
+              l = (l + 144) | 0;
+              c = (q + 80) | 0;
+              e = (q + 16) | 0;
+              f = q;
+              k = +h[b >> 3];
+              o = (a + 16) | 0;
+              m = +h[o >> 3];
+              if (
+                !((
+                  (
+                    (
+                      (
+                        (
+                          (
+                            (
+                              (!(k > m) ? ((n = +h[a >> 3]), !(k < n)) : 0)
+                                ? ((d = +h[(b + 8) >> 3]), (i = +h[(a + 24) >> 3]), !(d > i))
+                                : 0
+                            )
+                              ? ((j = +h[(a + 8) >> 3]), !(d < j))
+                              : 0
+                          )
+                            ? ((k = +h[(b + 16) >> 3]), !((k > m) | (k < n)))
+                            : 0
+                        )
+                          ? ((k = +h[(b + 24) >> 3]), !((k > i) | (k < j)))
+                          : 0
+                      )
+                        ? ((k = +h[(b + 32) >> 3]), !((k > m) | (k < n)))
+                        : 0
+                    )
+                      ? ((k = +h[(b + 40) >> 3]), !((k > i) | (k < j)))
+                      : 0
+                  )
+                    ? ((k = +h[(b + 48) >> 3]), !((k > m) | (k < n)))
+                    : 0
+                )
+                  ? ((n = +h[(b + 56) >> 3]), !((n > i) | (n < j)))
+                  : 0)
+              )
+                p = 11;
+              a: do
+                if ((p | 0) == 11) {
+                  if (!(mI(b) | 0)) {
+                    kP(f, b, 3, 0.5, c, e);
+                    lI(a, c);
+                    lI(a, e);
+                    break;
+                  }
+                  f = (a + 24) | 0;
+                  g = (a + 8) | 0;
+                  e = 0;
+                  while (1) {
+                    if ((e | 0) == 4) break a;
+                    d = +h[(b + (e << 4)) >> 3];
+                    if (!(d > +h[o >> 3])) {
+                      if (d < +h[a >> 3]) {
+                        c = a;
+                        p = 16;
+                      }
+                    } else {
+                      c = o;
+                      p = 16;
+                    }
+                    if ((p | 0) == 16) {
+                      p = 0;
+                      h[c >> 3] = d;
+                    }
+                    d = +h[(b + (e << 4) + 8) >> 3];
+                    if (!(d > +h[f >> 3])) {
+                      if (d < +h[g >> 3]) {
+                        c = a;
+                        p = 19;
+                      }
+                    } else {
+                      c = o;
+                      p = 19;
+                    }
+                    if ((p | 0) == 19) {
+                      p = 0;
+                      h[(c + 8) >> 3] = d;
+                    }
+                    e = (e + 1) | 0;
+                  }
+                }
+              while (0);
+              l = q;
+              return;
+            }
+            function mI(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0.0,
+                h = 0,
+                i = 0;
+              b = l;
+              l = (l + 48) | 0;
+              d = (b + 32) | 0;
+              e = (b + 16) | 0;
+              f = b;
+              i = (a + 48) | 0;
+              h = (a + 16) | 0;
+              c[f >> 2] = c[a >> 2];
+              c[(f + 4) >> 2] = c[(a + 4) >> 2];
+              c[(f + 8) >> 2] = c[(a + 8) >> 2];
+              c[(f + 12) >> 2] = c[(a + 12) >> 2];
+              c[e >> 2] = c[i >> 2];
+              c[(e + 4) >> 2] = c[(i + 4) >> 2];
+              c[(e + 8) >> 2] = c[(i + 8) >> 2];
+              c[(e + 12) >> 2] = c[(i + 12) >> 2];
+              c[d >> 2] = c[h >> 2];
+              c[(d + 4) >> 2] = c[(h + 4) >> 2];
+              c[(d + 8) >> 2] = c[(h + 8) >> 2];
+              c[(d + 12) >> 2] = c[(h + 12) >> 2];
+              g = +oK(f, e, d);
+              h = (a + 32) | 0;
+              c[f >> 2] = c[a >> 2];
+              c[(f + 4) >> 2] = c[(a + 4) >> 2];
+              c[(f + 8) >> 2] = c[(a + 8) >> 2];
+              c[(f + 12) >> 2] = c[(a + 12) >> 2];
+              c[e >> 2] = c[i >> 2];
+              c[(e + 4) >> 2] = c[(i + 4) >> 2];
+              c[(e + 8) >> 2] = c[(i + 8) >> 2];
+              c[(e + 12) >> 2] = c[(i + 12) >> 2];
+              c[d >> 2] = c[h >> 2];
+              c[(d + 4) >> 2] = c[(h + 4) >> 2];
+              c[(d + 8) >> 2] = c[(h + 8) >> 2];
+              c[(d + 12) >> 2] = c[(h + 12) >> 2];
+              a = (g < 4.0) & (+oK(f, e, d) < 4.0) & 1;
+              l = b;
+              return a | 0;
+            }
+            function nI(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0.0,
+                G = 0.0,
+                H = 0.0,
+                I = 0.0,
+                J = 0,
+                K = 0;
+              D = l;
+              l = (l + 272) | 0;
+              u = (D + 256) | 0;
+              v = (D + 224) | 0;
+              w = (D + 192) | 0;
+              x = (D + 128) | 0;
+              y = (D + 64) | 0;
+              z = D;
+              A = (D + 160) | 0;
+              B = (D + 96) | 0;
+              C = (D + 32) | 0;
+              t = c[(d + 16) >> 2] | 0;
+              s = c[(t + 144) >> 2] | 0;
+              r = (t + 16) | 0;
+              c[x >> 2] = c[r >> 2];
+              c[(x + 4) >> 2] = c[(r + 4) >> 2];
+              c[(x + 8) >> 2] = c[(r + 8) >> 2];
+              c[(x + 12) >> 2] = c[(r + 12) >> 2];
+              c[(x + 16) >> 2] = c[(r + 16) >> 2];
+              c[(x + 20) >> 2] = c[(r + 20) >> 2];
+              c[(x + 24) >> 2] = c[(r + 24) >> 2];
+              c[(x + 28) >> 2] = c[(r + 28) >> 2];
+              t = c[((c[(t + 8) >> 2] | 0) + 88) >> 2] | 0;
+              c[z >> 2] = 0;
+              c[(z + 4) >> 2] = 0;
+              c[(z + 8) >> 2] = 0;
+              c[(z + 12) >> 2] = 0;
+              c[(z + 16) >> 2] = 0;
+              c[(z + 20) >> 2] = 0;
+              c[(z + 24) >> 2] = 0;
+              c[(z + 28) >> 2] = 0;
+              if (!t) {
+                c[b >> 2] = c[x >> 2];
+                c[(b + 4) >> 2] = c[(x + 4) >> 2];
+                c[(b + 8) >> 2] = c[(x + 8) >> 2];
+                c[(b + 12) >> 2] = c[(x + 12) >> 2];
+                c[(b + 16) >> 2] = c[(x + 16) >> 2];
+                c[(b + 20) >> 2] = c[(x + 20) >> 2];
+                c[(b + 24) >> 2] = c[(x + 24) >> 2];
+                c[(b + 28) >> 2] = c[(x + 28) >> 2];
+              } else {
+                d = (x + 16) | 0;
+                if (+h[x >> 3] == +h[d >> 3] ? ((e = (x + 8) | 0), (f = (x + 24) | 0), +h[e >> 3] == +h[f >> 3]) : 0) {
+                  h[e >> 3] = 1797693134862315708145274.0e284;
+                  h[x >> 3] = 1797693134862315708145274.0e284;
+                  h[f >> 3] = -1797693134862315708145274.0e284;
+                  h[d >> 3] = -1797693134862315708145274.0e284;
+                }
+                j = (v + 8) | 0;
+                k = (v + 16) | 0;
+                m = (v + 24) | 0;
+                n = (y + 16) | 0;
+                o = (y + 24) | 0;
+                p = (s + 144) | 0;
+                q = (w + 16) | 0;
+                r = (t + 12) | 0;
+                d = 0;
+                f = c[(t + 8) >> 2] | 0;
+                e = 0;
+                g = 0.0;
+                i = 0;
+                while (1) {
+                  if ((i | 0) >= (c[t >> 2] | 0)) break;
+                  c[y >> 2] = c[z >> 2];
+                  c[(y + 4) >> 2] = c[(z + 4) >> 2];
+                  c[(y + 8) >> 2] = c[(z + 8) >> 2];
+                  c[(y + 12) >> 2] = c[(z + 12) >> 2];
+                  c[(y + 16) >> 2] = c[(z + 16) >> 2];
+                  c[(y + 20) >> 2] = c[(z + 20) >> 2];
+                  c[(y + 24) >> 2] = c[(z + 24) >> 2];
+                  c[(y + 28) >> 2] = c[(z + 28) >> 2];
+                  switch (c[f >> 2] | 0) {
+                    case 1:
+                    case 0: {
+                      H = +h[(f + 8) >> 3];
+                      I = +h[(f + 24) >> 3];
+                      h[v >> 3] = H - I;
+                      F = +h[(f + 16) >> 3];
+                      G = +h[(f + 32) >> 3];
+                      h[j >> 3] = F - G;
+                      h[k >> 3] = I + H;
+                      h[m >> 3] = G + F;
+                      E = (f + 80) | 0;
+                      c[E >> 2] = c[v >> 2];
+                      c[(E + 4) >> 2] = c[(v + 4) >> 2];
+                      c[(E + 8) >> 2] = c[(v + 8) >> 2];
+                      c[(E + 12) >> 2] = c[(v + 12) >> 2];
+                      E = (f + 96) | 0;
+                      c[E >> 2] = c[k >> 2];
+                      c[(E + 4) >> 2] = c[(k + 4) >> 2];
+                      c[(E + 8) >> 2] = c[(k + 8) >> 2];
+                      c[(E + 12) >> 2] = c[(k + 12) >> 2];
+                      c[u >> 2] = c[v >> 2];
+                      c[(u + 4) >> 2] = c[(v + 4) >> 2];
+                      c[(u + 8) >> 2] = c[(v + 8) >> 2];
+                      c[(u + 12) >> 2] = c[(v + 12) >> 2];
+                      oI(x, u);
+                      c[u >> 2] = c[k >> 2];
+                      c[(u + 4) >> 2] = c[(k + 4) >> 2];
+                      c[(u + 8) >> 2] = c[(k + 8) >> 2];
+                      c[(u + 12) >> 2] = c[(k + 12) >> 2];
+                      oI(x, u);
+                      break;
+                    }
+                    case 3:
+                    case 2: {
+                      E = (f + 80) | 0;
+                      J = (f + 8) | 0;
+                      pI(A, c[(J + 4) >> 2] | 0, c[J >> 2] | 0, x);
+                      c[E >> 2] = c[A >> 2];
+                      c[(E + 4) >> 2] = c[(A + 4) >> 2];
+                      c[(E + 8) >> 2] = c[(A + 8) >> 2];
+                      c[(E + 12) >> 2] = c[(A + 12) >> 2];
+                      c[(E + 16) >> 2] = c[(A + 16) >> 2];
+                      c[(E + 20) >> 2] = c[(A + 20) >> 2];
+                      c[(E + 24) >> 2] = c[(A + 24) >> 2];
+                      c[(E + 28) >> 2] = c[(A + 28) >> 2];
+                      break;
+                    }
+                    case 5:
+                    case 4: {
+                      J = (f + 80) | 0;
+                      E = (f + 8) | 0;
+                      pI(B, c[(E + 4) >> 2] | 0, c[E >> 2] | 0, x);
+                      c[J >> 2] = c[B >> 2];
+                      c[(J + 4) >> 2] = c[(B + 4) >> 2];
+                      c[(J + 8) >> 2] = c[(B + 8) >> 2];
+                      c[(J + 12) >> 2] = c[(B + 12) >> 2];
+                      c[(J + 16) >> 2] = c[(B + 16) >> 2];
+                      c[(J + 20) >> 2] = c[(B + 20) >> 2];
+                      c[(J + 24) >> 2] = c[(B + 24) >> 2];
+                      c[(J + 28) >> 2] = c[(B + 28) >> 2];
+                      break;
+                    }
+                    case 6: {
+                      J = (f + 80) | 0;
+                      E = (f + 8) | 0;
+                      pI(C, c[(E + 4) >> 2] | 0, c[E >> 2] | 0, x);
+                      c[J >> 2] = c[C >> 2];
+                      c[(J + 4) >> 2] = c[(C + 4) >> 2];
+                      c[(J + 8) >> 2] = c[(C + 8) >> 2];
+                      c[(J + 12) >> 2] = c[(C + 12) >> 2];
+                      c[(J + 16) >> 2] = c[(C + 16) >> 2];
+                      c[(J + 20) >> 2] = c[(C + 20) >> 2];
+                      c[(J + 24) >> 2] = c[(C + 24) >> 2];
+                      c[(J + 28) >> 2] = c[(C + 28) >> 2];
+                      break;
+                    }
+                    case 7: {
+                      J = (f + 112) | 0;
+                      c[J >> 2] = JK(56) | 0;
+                      E = D4(c[(f + 40) >> 2] | 0) | 0;
+                      K = c[J >> 2] | 0;
+                      c[K >> 2] = E;
+                      a[(K + 48) >> 0] = a[(100029 + (c[(f + 24) >> 2] | 0)) >> 0] | 0;
+                      c[y >> 2] = e;
+                      h[n >> 3] = g;
+                      c[o >> 2] = (c[o >> 2] & -128) | (d & 127);
+                      K = c[p >> 2] | 0;
+                      K = nb[c[K >> 2] & 63](K, y, 1) | 0;
+                      E = c[J >> 2] | 0;
+                      c[(E + 4) >> 2] = K;
+                      LO(u, s, E);
+                      qI(w, +h[(f + 8) >> 3], +h[(f + 16) >> 3], c[J >> 2] | 0);
+                      J = (f + 80) | 0;
+                      c[J >> 2] = c[w >> 2];
+                      c[(J + 4) >> 2] = c[(w + 4) >> 2];
+                      c[(J + 8) >> 2] = c[(w + 8) >> 2];
+                      c[(J + 12) >> 2] = c[(w + 12) >> 2];
+                      c[(J + 16) >> 2] = c[(w + 16) >> 2];
+                      c[(J + 20) >> 2] = c[(w + 20) >> 2];
+                      c[(J + 24) >> 2] = c[(w + 24) >> 2];
+                      c[(J + 28) >> 2] = c[(w + 28) >> 2];
+                      c[u >> 2] = c[w >> 2];
+                      c[(u + 4) >> 2] = c[(w + 4) >> 2];
+                      c[(u + 8) >> 2] = c[(w + 8) >> 2];
+                      c[(u + 12) >> 2] = c[(w + 12) >> 2];
+                      oI(x, u);
+                      c[u >> 2] = c[q >> 2];
+                      c[(u + 4) >> 2] = c[(q + 4) >> 2];
+                      c[(u + 8) >> 2] = c[(q + 8) >> 2];
+                      c[(u + 12) >> 2] = c[(q + 12) >> 2];
+                      oI(x, u);
+                      if (!(c[r >> 2] | 0)) c[r >> 2] = 109;
+                      break;
+                    }
+                    case 10: {
+                      e = c[(f + 16) >> 2] | 0;
+                      g = +h[(f + 8) >> 3];
+                      break;
+                    }
+                    case 15: {
+                      d = c[(f + 8) >> 2] | 0;
+                      break;
+                    }
+                    default: {
+                    }
+                  }
+                  f = (f + 120) | 0;
+                  i = (i + 1) | 0;
+                }
+                c[b >> 2] = c[x >> 2];
+                c[(b + 4) >> 2] = c[(x + 4) >> 2];
+                c[(b + 8) >> 2] = c[(x + 8) >> 2];
+                c[(b + 12) >> 2] = c[(x + 12) >> 2];
+                c[(b + 16) >> 2] = c[(x + 16) >> 2];
+                c[(b + 20) >> 2] = c[(x + 20) >> 2];
+                c[(b + 24) >> 2] = c[(x + 24) >> 2];
+                c[(b + 28) >> 2] = c[(x + 28) >> 2];
+              }
+              l = D;
+              return;
+            }
+            function oI(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0,
+                d = 0;
+              c = +h[b >> 3];
+              d = (a + 16) | 0;
+              if (c > +h[d >> 3]) h[d >> 3] = c;
+              if (c < +h[a >> 3]) h[a >> 3] = c;
+              c = +h[(b + 8) >> 3];
+              b = (a + 24) | 0;
+              if (c > +h[b >> 3]) h[b >> 3] = c;
+              b = (a + 8) | 0;
+              if (c < +h[b >> 3]) h[b >> 3] = c;
+              return;
+            }
+            function pI(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0;
+              r = l;
+              l = (l + 48) | 0;
+              k = (r + 32) | 0;
+              n = r;
+              f = +h[b >> 3];
+              o = (n + 16) | 0;
+              h[o >> 3] = f;
+              h[n >> 3] = f;
+              f = +h[(b + 8) >> 3];
+              p = (n + 24) | 0;
+              h[p >> 3] = f;
+              m = (n + 8) | 0;
+              h[m >> 3] = f;
+              j = 1;
+              while (1) {
+                if ((j | 0) >= (d | 0)) break;
+                i = (b + 24) | 0;
+                f = +h[i >> 3];
+                if (!(f < +h[n >> 3])) {
+                  if (f > +h[o >> 3]) {
+                    g = o;
+                    q = 5;
+                  }
+                } else {
+                  g = n;
+                  q = 5;
+                }
+                if ((q | 0) == 5) {
+                  q = 0;
+                  h[g >> 3] = f;
+                }
+                f = +h[(b + 32) >> 3];
+                if (!(f < +h[m >> 3])) {
+                  if (f > +h[p >> 3]) {
+                    b = o;
+                    q = 8;
+                  }
+                } else {
+                  b = n;
+                  q = 8;
+                }
+                if ((q | 0) == 8) {
+                  q = 0;
+                  h[(b + 8) >> 3] = f;
+                }
+                j = (j + 1) | 0;
+                b = i;
+              }
+              c[k >> 2] = c[n >> 2];
+              c[(k + 4) >> 2] = c[(n + 4) >> 2];
+              c[(k + 8) >> 2] = c[(n + 8) >> 2];
+              c[(k + 12) >> 2] = c[(n + 12) >> 2];
+              oI(e, k);
+              c[k >> 2] = c[o >> 2];
+              c[(k + 4) >> 2] = c[(o + 4) >> 2];
+              c[(k + 8) >> 2] = c[(o + 8) >> 2];
+              c[(k + 12) >> 2] = c[(o + 12) >> 2];
+              oI(e, k);
+              c[a >> 2] = c[n >> 2];
+              c[(a + 4) >> 2] = c[(n + 4) >> 2];
+              c[(a + 8) >> 2] = c[(n + 8) >> 2];
+              c[(a + 12) >> 2] = c[(n + 12) >> 2];
+              c[(a + 16) >> 2] = c[(n + 16) >> 2];
+              c[(a + 20) >> 2] = c[(n + 20) >> 2];
+              c[(a + 24) >> 2] = c[(n + 24) >> 2];
+              c[(a + 28) >> 2] = c[(n + 28) >> 2];
+              l = r;
+              return;
+            }
+            function qI(b, c, d, e) {
+              b = b | 0;
+              c = +c;
+              d = +d;
+              e = e | 0;
+              var f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0.0,
+                m = 0,
+                n = 0;
+              n = l;
+              l = (l + 16) | 0;
+              i = (n + 8) | 0;
+              j = n;
+              f = +h[(e + 32) >> 3];
+              k = +h[(e + 40) >> 3];
+              switch (a[(e + 48) >> 0] | 0) {
+                case 108: {
+                  h[i >> 3] = c;
+                  f = f + c;
+                  g = j;
+                  m = 5;
+                  break;
+                }
+                case 110: {
+                  f = f * 0.5;
+                  h[i >> 3] = c - f;
+                  f = f + c;
+                  g = j;
+                  m = 5;
+                  break;
+                }
+                case 114: {
+                  h[j >> 3] = c;
+                  f = c - f;
+                  g = i;
+                  m = 5;
+                  break;
+                }
+                default: {
+                  c = 0.0;
+                  f = 0.0;
+                }
+              }
+              if ((m | 0) == 5) {
+                h[g >> 3] = f;
+                c = +h[i >> 3];
+                f = +h[j >> 3];
+              }
+              d = +h[(e + 16) >> 3] + d;
+              h[b >> 3] = c;
+              h[(b + 8) >> 3] = d - k;
+              h[(b + 16) >> 3] = f;
+              h[(b + 24) >> 3] = d;
+              l = n;
+              return;
+            }
+            function rI(a) {
+              a = a | 0;
+              if ((c[a >> 2] | 0) == 7) BK(c[(a + 112) >> 2] | 0, 1);
+              return;
+            }
+            function sI(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0.0;
+              m = l;
+              l = (l + 16) | 0;
+              k = m;
+              j = c[(b + 152) >> 2] | 0;
+              n = +h[(b + 432) >> 3];
+              i = +h[(b + 352) >> 3] * 0.013888888888888888;
+              f = i * n;
+              h[(b + 488) >> 3] = f;
+              g = +h[(b + 440) >> 3];
+              i = i * g;
+              h[(b + 496) >> 3] = i;
+              h[(b + 520) >> 3] = n * 0.013888888888888888;
+              e = (b + 528) | 0;
+              h[e >> 3] = g * 0.013888888888888888;
+              if ((j & 4096) | 0) h[e >> 3] = g * -0.013888888888888888;
+              e = (c[(b + 360) >> 2] | 0) == 0;
+              n = +((c[(b + 448) >> 2] | 0) >>> 0);
+              g = +((c[(b + 452) >> 2] | 0) >>> 0);
+              h[(b + 368) >> 3] = (e ? n : g) / f;
+              h[(b + 376) >> 3] = (e ? g : n) / i;
+              rS(b, aP(d, GA(d, 0, 101522, 0) | 0, 195059) | 0);
+              c[(b + 160) >> 2] = 0;
+              tI(b, d);
+              if ((j & 2) | 0) uI(b, d);
+              e = jC(d) | 0;
+              while (1) {
+                if (!e) break;
+                a[((c[(e + 16) >> 2] | 0) + 116) >> 0] = 0;
+                e = kC(d, e) | 0;
+              }
+              vI(b, k);
+              while (1) {
+                if (!(((wI(b) | 0) << 24) >> 24)) break;
+                if ((xI(b) | 0) > 1) SR(b);
+                yI(b);
+                while (1) {
+                  if (!(((zI(b) | 0) << 24) >> 24)) break;
+                  AI(b, d);
+                  BI(b);
+                }
+                if ((xI(b) | 0) > 1) TR(b);
+                CI(b, k);
+              }
+              DI(b);
+              l = m;
+              return;
+            }
+            function tI(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = aI(a) | 0;
+              c[(d + 4) >> 2] = 0;
+              c[(d + 8) >> 2] = b;
+              c[(d + 12) >> 2] = 0;
+              CJ(a, c[((c[(b + 16) >> 2] | 0) + 12) >> 2] | 0, b);
+              OR(a, b);
+              return;
+            }
+            function uI(b, c) {
+              b = b | 0;
+              c = c | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              jS(b, 134800);
+              d = QA(c, 140977) | 0;
+              if (d | 0 ? a[d >> 0] | 0 : 0) jS(b, d);
+              d = QA(c, 101446) | 0;
+              if (d | 0 ? a[d >> 0] | 0 : 0) hS(b, d);
+              OJ(b, c);
+              g = jC(c) | 0;
+              while (1) {
+                if (!g) break;
+                d = QA(g, 140823) | 0;
+                if (d | 0 ? a[d >> 0] | 0 : 0) hS(b, d);
+                d = QA(g, 137729) | 0;
+                if (d | 0 ? a[d >> 0] | 0 : 0) jS(b, d);
+                d = QA(g, 101418) | 0;
+                do
+                  if (d | 0 ? a[d >> 0] | 0 : 0) {
+                    if (!(R2(d, 58) | 0)) {
+                      hS(b, d);
+                      break;
+                    }
+                    e = D4(d) | 0;
+                    d = e;
+                    while (1) {
+                      d = A4(d, 107984) | 0;
+                      if (!d) break;
+                      if (!(a[d >> 0] | 0)) {
+                        d = 0;
+                        continue;
+                      }
+                      hS(b, d);
+                      d = 0;
+                    }
+                    U1(e);
+                  }
+                while (0);
+                d = QA(g, 101446) | 0;
+                if (d | 0 ? a[d >> 0] | 0 : 0) hS(b, d);
+                f = XA(c, g) | 0;
+                while (1) {
+                  if (!f) break;
+                  d = QA(f, 140823) | 0;
+                  do
+                    if (d | 0 ? a[d >> 0] | 0 : 0) {
+                      if (!(R2(d, 58) | 0)) {
+                        hS(b, d);
+                        break;
+                      }
+                      e = D4(d) | 0;
+                      d = e;
+                      while (1) {
+                        d = A4(d, 107984) | 0;
+                        if (!d) break;
+                        if (!(a[d >> 0] | 0)) {
+                          d = 0;
+                          continue;
+                        }
+                        hS(b, d);
+                        d = 0;
+                      }
+                      U1(e);
+                    }
+                  while (0);
+                  d = QA(f, 101446) | 0;
+                  if (d | 0 ? a[d >> 0] | 0 : 0) hS(b, d);
+                  f = ZA(c, f) | 0;
+                }
+                g = kC(c, g) | 0;
+              }
+              return;
+            }
+            function vI(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 16) | 0;
+              e = (i + 8) | 0;
+              g = i;
+              h = c[a >> 2] | 0;
+              d = c[(h + 312) >> 2] | 0;
+              f = (a + 156) | 0;
+              c[f >> 2] = d;
+              h = c[(h + 316) >> 2] | 0;
+              if (!h)
+                if ((d | 0) > 1 ? ((c[(a + 152) >> 2] & 64) | 0) == 0 : 0) {
+                  c[e >> 2] = c[(a + 52) >> 2];
+                  gA(0, 100567, e) | 0;
+                  c[f >> 2] = 1;
+                  e = 1;
+                  d = 0;
+                } else {
+                  e = 1;
+                  d = 0;
+                }
+              else {
+                d = (h + 4) | 0;
+                if ((c[h >> 2] | 0) > 1 ? ((c[(a + 152) >> 2] & 64) | 0) == 0 : 0) {
+                  c[g >> 2] = c[(a + 52) >> 2];
+                  gA(0, 100567, g) | 0;
+                  c[(h + 8) >> 2] = (c[f >> 2] | 0) + 1;
+                }
+                e = c[d >> 2] | 0;
+                d = (h + 8) | 0;
+              }
+              c[(a + 160) >> 2] = e;
+              c[b >> 2] = d;
+              l = i;
+              return;
+            }
+            function wI(a) {
+              a = a | 0;
+              return ((c[(a + 160) >> 2] | 0) <= (c[(a + 156) >> 2] | 0)) | 0;
+            }
+            function xI(a) {
+              a = a | 0;
+              var b = 0;
+              b = c[((c[a >> 2] | 0) + 316) >> 2] | 0;
+              return c[((b | 0) == 0 ? (a + 156) | 0 : b) >> 2] | 0;
+            }
+            function yI(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              d = (a + 172) | 0;
+              b = c[(d + 4) >> 2] | 0;
+              a = (a + 196) | 0;
+              c[a >> 2] = c[d >> 2];
+              c[(a + 4) >> 2] = b;
+              return;
+            }
+            function zI(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              d = c[(a + 196) >> 2] | 0;
+              if (
+                ((d | 0) > -1 ? (d | 0) < (c[(a + 164) >> 2] | 0) : 0) ? ((b = c[(a + 200) >> 2] | 0), (b | 0) > -1) : 0
+              )
+                a = ((b | 0) < (c[(a + 168) >> 2] | 0)) & 1;
+              else a = 0;
+              return a | 0;
+            }
+            function AI(d, e) {
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              p = l;
+              l = (l + 176) | 0;
+              k = p;
+              f = (p + 48) | 0;
+              m = (p + 32) | 0;
+              n = c[(d + 16) >> 2] | 0;
+              o = c[(d + 152) >> 2] | 0;
+              if ((c[(d + 160) >> 2] | 0) <= 1 ? (c[(d + 196) >> 2] | 0) <= 0 : 0) h = 0;
+              else {
+                kA(m, 128, f);
+                g = (n + 212) | 0;
+                h = c[g >> 2] | 0;
+                eI(d, m);
+                nA(m, h) | 0;
+                i = (m + 4) | 0;
+                f = c[i >> 2] | 0;
+                if (f >>> 0 >= (c[(m + 8) >> 2] | 0) >>> 0) {
+                  lA(m, 1) | 0;
+                  f = c[i >> 2] | 0;
+                }
+                a[f >> 0] = 0;
+                f = c[m >> 2] | 0;
+                c[i >> 2] = f;
+                c[g >> 2] = f;
+              }
+              HT(QA(e, 100032) | 0);
+              FI(d);
+              QR(d);
+              hS(d, 137314);
+              jS(d, 134800);
+              do
+                if ((o & 4259840) | 0) {
+                  if ((c[(n + 208) >> 2] | 0) == 0 ? (b[(n + 260) >> 1] & 1) == 0 : 0) break;
+                  if (o & 655360) {
+                    i = o & 131072;
+                    c[(n + 264) >> 2] = (i >>> 16) ^ 2;
+                    f = JK((((i >>> 12) ^ 32) + 32) | 0) | 0;
+                    g = (d + 288) | 0;
+                    c[f >> 2] = c[g >> 2];
+                    c[(f + 4) >> 2] = c[(g + 4) >> 2];
+                    c[(f + 8) >> 2] = c[(g + 8) >> 2];
+                    c[(f + 12) >> 2] = c[(g + 12) >> 2];
+                    g = (f + 16) | 0;
+                    q = (d + 304) | 0;
+                    c[g >> 2] = c[q >> 2];
+                    c[(g + 4) >> 2] = c[(q + 4) >> 2];
+                    c[(g + 8) >> 2] = c[(q + 8) >> 2];
+                    c[(g + 12) >> 2] = c[(q + 12) >> 2];
+                    if (!i) {
+                      jK(f);
+                      g = 4;
+                    } else g = 2;
+                  } else {
+                    f = 0;
+                    g = 0;
+                  }
+                  if (!(o & 8192)) NR(d, f, f, g) | 0;
+                  c[(n + 272) >> 2] = f;
+                  c[(n + 268) >> 2] = g;
+                }
+              while (0);
+              if ((o & 32768) | 0 ? ((j = c[((c[(e + 16) >> 2] | 0) + 12) >> 2] | 0), j | 0) : 0)
+                c[(n + 192) >> 2] = c[j >> 2];
+              g = ((o & 4) | 0) != 0;
+              do
+                if (!g) {
+                  f = (n + 208) | 0;
+                  if ((c[f >> 2] | 0) == 0 ? (b[(n + 260) >> 1] & 1) == 0 : 0) break;
+                  q = (d + 256) | 0;
+                  c[k >> 2] = c[q >> 2];
+                  c[(k + 4) >> 2] = c[(q + 4) >> 2];
+                  c[(k + 8) >> 2] = c[(q + 8) >> 2];
+                  c[(k + 12) >> 2] = c[(q + 12) >> 2];
+                  c[(k + 16) >> 2] = c[(q + 16) >> 2];
+                  c[(k + 20) >> 2] = c[(q + 20) >> 2];
+                  c[(k + 24) >> 2] = c[(q + 24) >> 2];
+                  c[(k + 28) >> 2] = c[(q + 28) >> 2];
+                  kI(d, k);
+                  cS(d, c[f >> 2] | 0, c[(n + 228) >> 2] | 0, c[(n + 244) >> 2] | 0, c[(n + 212) >> 2] | 0);
+                }
+              while (0);
+              GI(d, e);
+              f = c[((c[(e + 16) >> 2] | 0) + 12) >> 2] | 0;
+              if (f | 0) DK(d, 4, f);
+              do
+                if (!g) {
+                  if ((c[(n + 208) >> 2] | 0) == 0 ? (b[(n + 260) >> 1] & 1) == 0 : 0) break;
+                  dS(d);
+                }
+              while (0);
+              HI(d, e, o);
+              RR(d);
+              if (h | 0) {
+                oA(m);
+                c[(n + 212) >> 2] = h;
+              }
+              l = p;
+              return;
+            }
+            function BI(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              h = l;
+              l = (l + 32) | 0;
+              d = (h + 24) | 0;
+              b = (h + 16) | 0;
+              j = (h + 8) | 0;
+              f = h;
+              g = (a + 196) | 0;
+              i = (a + 188) | 0;
+              c[b >> 2] = c[g >> 2];
+              c[(b + 4) >> 2] = c[(g + 4) >> 2];
+              c[d >> 2] = c[i >> 2];
+              c[(d + 4) >> 2] = c[(i + 4) >> 2];
+              EI(j, b, d);
+              i = c[(j + 4) >> 2] | 0;
+              e = g;
+              c[e >> 2] = c[j >> 2];
+              c[(e + 4) >> 2] = i;
+              if (!(((zI(a) | 0) << 24) >> 24)) {
+                e = (a + 180) | 0;
+                if (!(c[(a + 184) >> 2] | 0)) c[(a + 200) >> 2] = c[(a + 176) >> 2];
+                else c[g >> 2] = c[(a + 172) >> 2];
+                c[b >> 2] = c[g >> 2];
+                c[(b + 4) >> 2] = c[(g + 4) >> 2];
+                c[d >> 2] = c[e >> 2];
+                c[(d + 4) >> 2] = c[(e + 4) >> 2];
+                EI(f, b, d);
+                i = c[(f + 4) >> 2] | 0;
+                j = g;
+                c[j >> 2] = c[f >> 2];
+                c[(j + 4) >> 2] = i;
+              }
+              l = h;
+              return;
+            }
+            function CI(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = c[b >> 2] | 0;
+              if (!d) {
+                d = (a + 160) | 0;
+                c[d >> 2] = (c[d >> 2] | 0) + 1;
+              } else {
+                c[(a + 160) >> 2] = c[d >> 2];
+                c[b >> 2] = d + 4;
+              }
+              return;
+            }
+            function DI(a) {
+              a = a | 0;
+              PR(a);
+              bI(a);
+              return;
+            }
+            function EI(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              e = ((c[(d + 4) >> 2] | 0) + (c[(b + 4) >> 2] | 0)) | 0;
+              c[a >> 2] = (c[d >> 2] | 0) + (c[b >> 2] | 0);
+              c[(a + 4) >> 2] = e;
+              return;
+            }
+            function FI(a) {
+              a = a | 0;
+              var b = 0.0,
+                d = 0.0,
+                e = 0.0,
+                f = 0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0.0;
+              t = l;
+              l = (l + 48) | 0;
+              n = (t + 32) | 0;
+              f = (t + 24) | 0;
+              j = (t + 8) | 0;
+              k = (t + 16) | 0;
+              m = t;
+              r = (a + 196) | 0;
+              q = c[r >> 2] | 0;
+              r = c[(r + 4) >> 2] | 0;
+              p = f;
+              c[p >> 2] = q;
+              c[(p + 4) >> 2] = r;
+              p = (a + 164) | 0;
+              i = c[p >> 2] | 0;
+              p = c[(p + 4) >> 2] | 0;
+              s = j;
+              c[s >> 2] = i;
+              c[(s + 4) >> 2] = p;
+              s = (a + 360) | 0;
+              if (!(c[s >> 2] | 0)) {
+                k = q;
+                j = r;
+              } else {
+                c[n >> 2] = c[f >> 2];
+                c[(n + 4) >> 2] = c[(f + 4) >> 2];
+                NJ(k, n);
+                r = k;
+                k = c[r >> 2] | 0;
+                r = c[(r + 4) >> 2] | 0;
+                p = f;
+                c[p >> 2] = k;
+                c[(p + 4) >> 2] = r;
+                c[n >> 2] = c[j >> 2];
+                c[(n + 4) >> 2] = c[(j + 4) >> 2];
+                NJ(m, n);
+                p = m;
+                i = c[p >> 2] | 0;
+                p = c[(p + 4) >> 2] | 0;
+                c[j >> 2] = i;
+                c[(j + 4) >> 2] = p;
+                j = r;
+              }
+              d = +h[(a + 320) >> 3];
+              g = d * +(k | 0) - +h[(a + 240) >> 3];
+              h[(a + 288) >> 3] = g;
+              e = +h[(a + 328) >> 3];
+              o = e * +(j | 0) - +h[(a + 248) >> 3];
+              h[(a + 296) >> 3] = o;
+              h[(a + 304) >> 3] = d + g;
+              h[(a + 312) >> 3] = e + o;
+              f = (a + 472) | 0;
+              if (!(c[((c[(a + 12) >> 2] | 0) + 28) >> 2] | 0)) {
+                r = (a + 456) | 0;
+                c[f >> 2] = c[r >> 2];
+                c[(f + 4) >> 2] = c[(r + 4) >> 2];
+                c[(f + 8) >> 2] = c[(r + 8) >> 2];
+                c[(f + 12) >> 2] = c[(r + 12) >> 2];
+              } else {
+                q = (a + 456) | 0;
+                c[f >> 2] = c[((c[f >> 2] | 0) < (c[q >> 2] | 0) ? f : q) >> 2];
+                r = (a + 476) | 0;
+                c[r >> 2] = c[(((c[r >> 2] | 0) < (c[(a + 460) >> 2] | 0) ? f : q) + 4) >> 2];
+                r = (a + 480) | 0;
+                c[r >> 2] = c[(((c[r >> 2] | 0) > (c[(a + 464) >> 2] | 0) ? f : q) + 8) >> 2];
+                r = (a + 484) | 0;
+                c[r >> 2] = c[(((c[r >> 2] | 0) > (c[(a + 468) >> 2] | 0) ? f : q) + 12) >> 2];
+              }
+              m = c[(a + 152) >> 2] | 0;
+              b = +h[(a + 336) >> 3];
+              if (!(m & 128)) {
+                b = (+(k | 0) - +(i | 0) * 0.5) * d + b;
+                h[(a + 256) >> 3] = b;
+                g = (+(j | 0) - +(p | 0) * 0.5) * e + +h[(a + 344) >> 3];
+                o = g;
+                d = d + b;
+                g = g + e;
+              } else {
+                d = +h[(a + 368) >> 3] * 0.5;
+                e = b - d;
+                h[(a + 256) >> 3] = e;
+                g = +h[(a + 344) >> 3];
+                u = +h[(a + 376) >> 3] * 0.5;
+                o = g - u;
+                d = d + b;
+                g = u + g;
+                b = e;
+              }
+              h[(a + 264) >> 3] = o;
+              h[(a + 272) >> 3] = d;
+              h[(a + 280) >> 3] = g;
+              if (!(c[s >> 2] | 0)) {
+                e = +h[(a + 352) >> 3];
+                h[(a + 504) >> 3] = +h[(a + 384) >> 3] / e - b;
+                if (!(m & 4096)) {
+                  d = +h[(a + 392) >> 3] / e;
+                  b = o;
+                } else {
+                  d = -g;
+                  b = +h[(a + 392) >> 3] / e;
+                }
+                h[(a + 512) >> 3] = d - b;
+              } else {
+                f = (a + 384) | 0;
+                e = +h[(a + 352) >> 3];
+                h[(a + 512) >> 3] = -g - +h[(a + 392) >> 3] / e;
+                if (!(m & 4096)) d = +h[f >> 3] / e;
+                else {
+                  d = -d;
+                  b = +h[f >> 3] / e;
+                }
+                h[(a + 504) >> 3] = d - b;
+              }
+              l = t;
+              return;
+            }
+            function GI(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0;
+              s = l;
+              l = (l + 48) | 0;
+              q = s;
+              o = (s + 40) | 0;
+              p = (s + 36) | 0;
+              r = (s + 32) | 0;
+              e = QA(d, 140977) | 0;
+              if (!e) {
+                j = 1;
+                e = 137198;
+              } else {
+                i = (a[e >> 0] | 0) == 0;
+                j = i & 1;
+                e = i ? 137198 : e;
+              }
+              h = c[(b + 152) >> 2] | 0;
+              i = (a[e >> 0] | 0) == 116;
+              if (!(h & 256))
+                if (i) {
+                  m = (s2(e, 137379) | 0) == 0;
+                  k = m ? 137198 : e;
+                  m = m ? 1 : j;
+                  n = 8;
+                } else {
+                  k = e;
+                  m = j;
+                  n = 8;
+                }
+              else if (!(i ? !(s2(e, 137379) | 0) : 0)) {
+                k = e;
+                m = j;
+                n = 8;
+              }
+              if ((n | 0) == 8 ? !(((m | 0) != 0) & (((h & 33554432) | 0) != 0)) : 0)
+                if (!(((JJ(k, o, p) | 0) << 24) >> 24)) {
+                  jS(b, k);
+                  hS(b, 137379);
+                  r = (b + 256) | 0;
+                  c[q >> 2] = c[r >> 2];
+                  c[(q + 4) >> 2] = c[(r + 4) >> 2];
+                  c[(q + 8) >> 2] = c[(r + 8) >> 2];
+                  c[(q + 12) >> 2] = c[(r + 12) >> 2];
+                  c[(q + 16) >> 2] = c[(r + 16) >> 2];
+                  c[(q + 20) >> 2] = c[(r + 20) >> 2];
+                  c[(q + 24) >> 2] = c[(r + 24) >> 2];
+                  c[(q + 28) >> 2] = c[(r + 28) >> 2];
+                  oS(b, q, 1);
+                } else {
+                  c[r >> 2] = 0;
+                  i = c[o >> 2] | 0;
+                  jS(b, i);
+                  hS(b, 137379);
+                  IJ(d, r) | 0;
+                  e = c[(o + 4) >> 2] | 0;
+                  h = ZO(d, c[47143] | 0, 0, 0) | 0;
+                  f = +g[p >> 2];
+                  if (!e) kS(b, 137314, h, f);
+                  else kS(b, e, h, f);
+                  r = (((c[r >> 2] | 0) >>> 1) & 1) | 2;
+                  p = (b + 256) | 0;
+                  c[q >> 2] = c[p >> 2];
+                  c[(q + 4) >> 2] = c[(p + 4) >> 2];
+                  c[(q + 8) >> 2] = c[(p + 8) >> 2];
+                  c[(q + 12) >> 2] = c[(p + 12) >> 2];
+                  c[(q + 16) >> 2] = c[(p + 16) >> 2];
+                  c[(q + 20) >> 2] = c[(p + 20) >> 2];
+                  c[(q + 24) >> 2] = c[(p + 24) >> 2];
+                  c[(q + 28) >> 2] = c[(p + 28) >> 2];
+                  oS(b, q, r);
+                  U1(i);
+                }
+              e = c[((c[((c[(d + 16) >> 2] | 0) + 8) >> 2] | 0) + 88) >> 2] | 0;
+              if (e | 0) LJ(b, e);
+              l = s;
+              return;
+            }
+            function HI(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              g = ((c[a >> 2] | 0) + 28) | 0;
+              c[g >> 2] = (c[g >> 2] | 0) + 1;
+              g = ((d & 4) | 0) != 0;
+              if (!g) II(a, b, d);
+              a: do
+                if (!(d & 1)) {
+                  if ((d & 16) | 0) {
+                    YR(a);
+                    f = jC(b) | 0;
+                    while (1) {
+                      if (!f) break;
+                      e = XA(b, f) | 0;
+                      while (1) {
+                        if (!e) break;
+                        KI(a, e);
+                        e = ZA(b, e) | 0;
+                      }
+                      f = kC(b, f) | 0;
+                    }
+                    ZR(a);
+                    WR(a);
+                    e = jC(b) | 0;
+                    while (1) {
+                      if (!e) break;
+                      JI(a, e);
+                      e = kC(b, e) | 0;
+                    }
+                    XR(a);
+                    break;
+                  }
+                  if (!(d & 8)) {
+                    f = jC(b) | 0;
+                    while (1) {
+                      if (!f) break a;
+                      JI(a, f);
+                      e = XA(b, f) | 0;
+                      while (1) {
+                        if (!e) break;
+                        JI(a, c[((((c[e >> 2] & 3) | 0) == 2 ? e : (e + -48) | 0) + 40) >> 2] | 0);
+                        KI(a, e);
+                        e = ZA(b, e) | 0;
+                      }
+                      f = kC(b, f) | 0;
+                    }
+                  }
+                  WR(a);
+                  e = jC(b) | 0;
+                  while (1) {
+                    if (!e) break;
+                    if (((LI(b, e) | 0) << 24) >> 24) JI(a, e);
+                    e = kC(b, e) | 0;
+                  }
+                  XR(a);
+                  YR(a);
+                  f = jC(b) | 0;
+                  while (1) {
+                    if (!f) break;
+                    e = XA(b, f) | 0;
+                    while (1) {
+                      if (!e) break;
+                      if (((MI(b, e) | 0) << 24) >> 24) KI(a, e);
+                      e = ZA(b, e) | 0;
+                    }
+                    f = kC(b, f) | 0;
+                  }
+                  ZR(a);
+                } else {
+                  WR(a);
+                  e = jC(b) | 0;
+                  while (1) {
+                    if (!e) break;
+                    JI(a, e);
+                    e = kC(b, e) | 0;
+                  }
+                  XR(a);
+                  YR(a);
+                  f = jC(b) | 0;
+                  while (1) {
+                    if (!f) break;
+                    e = XA(b, f) | 0;
+                    while (1) {
+                      if (!e) break;
+                      KI(a, e);
+                      e = ZA(b, e) | 0;
+                    }
+                    f = kC(b, f) | 0;
+                  }
+                  ZR(a);
+                }
+              while (0);
+              if (g) II(a, b, d);
+              return;
+            }
+            function II(e, f, i) {
+              e = e | 0;
+              f = f | 0;
+              i = i | 0;
+              var j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                O = 0,
+                P = 0,
+                Q = 0;
+              P = l;
+              l = (l + 128) | 0;
+              w = (P + 72) | 0;
+              N = (P + 64) | 0;
+              H = (P + 112) | 0;
+              I = P;
+              J = (P + 104) | 0;
+              K = (f + 16) | 0;
+              L = ((i & 4) | 0) != 0;
+              M = (e + 16) | 0;
+              x = (I + 32) | 0;
+              y = (I + 16) | 0;
+              A = (I + 8) | 0;
+              B = (I + 24) | 0;
+              C = (I + 48) | 0;
+              D = (I + 40) | 0;
+              E = (I + 56) | 0;
+              F = ((i & 8) | 0) == 0;
+              G = (J + 4) | 0;
+              v = 1;
+              while (1) {
+                j = c[K >> 2] | 0;
+                if ((v | 0) > (c[(j + 180) >> 2] | 0)) break;
+                u = c[((c[(j + 184) >> 2] | 0) + (v << 2)) >> 2] | 0;
+                if (((GJ(e, u) | 0) << 24) >> 24) {
+                  if (L) II(e, u, i);
+                  HJ(e, u);
+                  r = c[M >> 2] | 0;
+                  s = (r + 208) | 0;
+                  if (!(c[s >> 2] | 0)) t = (b[(r + 260) >> 1] & 1) != 0;
+                  else t = 1;
+                  HT(QA(u, 100032) | 0);
+                  if (!(L | (t ^ 1))) {
+                    q = ((c[(u + 16) >> 2] | 0) + 16) | 0;
+                    c[w >> 2] = c[q >> 2];
+                    c[(w + 4) >> 2] = c[(q + 4) >> 2];
+                    c[(w + 8) >> 2] = c[(q + 8) >> 2];
+                    c[(w + 12) >> 2] = c[(q + 12) >> 2];
+                    c[(w + 16) >> 2] = c[(q + 16) >> 2];
+                    c[(w + 20) >> 2] = c[(q + 20) >> 2];
+                    c[(w + 24) >> 2] = c[(q + 24) >> 2];
+                    c[(w + 28) >> 2] = c[(q + 28) >> 2];
+                    kI(e, w);
+                    cS(e, c[s >> 2] | 0, c[(r + 228) >> 2] | 0, c[(r + 244) >> 2] | 0, c[(r + 212) >> 2] | 0);
+                  }
+                  c[H >> 2] = 0;
+                  j = IJ(u, H) | 0;
+                  if (!j) p = 0;
+                  else {
+                    lS(e, j);
+                    p = c[H >> 2] & 1;
+                  }
+                  q = (u + 16) | 0;
+                  j = d[((c[q >> 2] | 0) + 112) >> 0] | 0;
+                  do
+                    if (!(j & 1)) {
+                      if ((j & 2) | 0) {
+                        j = bP(u, 0, 106256) | 0;
+                        k = bP(u, 0, 106264) | 0;
+                        O = 29;
+                        break;
+                      }
+                      if ((j & 8) | 0) {
+                        j = bP(u, 0, 106272) | 0;
+                        k = bP(u, 0, 106280) | 0;
+                        O = 29;
+                        break;
+                      }
+                      if ((j & 4) | 0) {
+                        j = bP(u, 0, 106288) | 0;
+                        k = bP(u, 0, 106296) | 0;
+                        O = 29;
+                        break;
+                      }
+                      j = QA(u, 140823) | 0;
+                      if (!j) k = 0;
+                      else k = (a[j >> 0] | 0) == 0 ? 0 : j;
+                      j = QA(u, 137729) | 0;
+                      if (!j) j = k;
+                      else j = (a[j >> 0] | 0) == 0 ? k : j;
+                      m = QA(u, 101418) | 0;
+                      if (m) k = (a[m >> 0] | 0) == 0 ? k : m;
+                      if (!(((p | 0) != 0) & ((k | 0) != 0))) {
+                        m = QA(u, 140977) | 0;
+                        if (m | 0 ? a[m >> 0] | 0 : 0) {
+                          k = m;
+                          O = 29;
+                          break;
+                        }
+                        j = (j | 0) == 0 ? 137314 : j;
+                        n = (k | 0) == 0 ? 134800 : k;
+                        c[J >> 2] = 0;
+                        if (!p) k = 0;
+                        else O = 31;
+                      } else O = 29;
+                    } else {
+                      j = bP(u, 0, 106240) | 0;
+                      k = bP(u, 0, 106248) | 0;
+                      O = 29;
+                    }
+                  while (0);
+                  if ((O | 0) == 29) {
+                    c[J >> 2] = 0;
+                    j = (j | 0) == 0 ? 137314 : j;
+                    n = (k | 0) == 0 ? 134800 : k;
+                    O = 31;
+                  }
+                  if ((O | 0) == 31) {
+                    O = 0;
+                    if (!(((JJ(n, J, w) | 0) << 24) >> 24)) {
+                      jS(e, n);
+                      k = 1;
+                    } else {
+                      jS(e, c[J >> 2] | 0);
+                      k = c[G >> 2] | 0;
+                      m = ZO(u, c[47143] | 0, 0, 0) | 0;
+                      o = +g[w >> 2];
+                      if (!k) kS(e, 137314, m, o);
+                      else kS(e, k, m, o);
+                      k = (((c[H >> 2] | 0) >>> 1) & 1) | 2;
+                    }
+                  }
+                  m = c[47142] | 0;
+                  if ((m | 0 ? ((z = RA(u, m) | 0), z | 0) : 0) ? a[z >> 0] | 0 : 0)
+                    uS(e, +_O(u, c[47142] | 0, 1.0, 0.0));
+                  p = c[H >> 2] | 0;
+                  do
+                    if (p & 4) {
+                      m = ZO(u, c[47141] | 0, 1, 0) | 0;
+                      if (m | k | 0) {
+                        n = c[q >> 2] | 0;
+                        Q = (n + 16) | 0;
+                        c[I >> 2] = c[Q >> 2];
+                        c[(I + 4) >> 2] = c[(Q + 4) >> 2];
+                        c[(I + 8) >> 2] = c[(Q + 8) >> 2];
+                        c[(I + 12) >> 2] = c[(Q + 12) >> 2];
+                        n = (n + 32) | 0;
+                        c[x >> 2] = c[n >> 2];
+                        c[(x + 4) >> 2] = c[(n + 4) >> 2];
+                        c[(x + 8) >> 2] = c[(n + 8) >> 2];
+                        c[(x + 12) >> 2] = c[(n + 12) >> 2];
+                        h[y >> 3] = +h[x >> 3];
+                        h[B >> 3] = +h[A >> 3];
+                        h[C >> 3] = +h[I >> 3];
+                        h[E >> 3] = +h[D >> 3];
+                        if (!m) hS(e, 137379);
+                        else hS(e, j);
+                        TM(e, I, 4, p, k);
+                      }
+                    } else {
+                      if (!(p & 64)) {
+                        if (ZO(u, c[47141] | 0, 1, 0) | 0) {
+                          hS(e, j);
+                          Q = ((c[q >> 2] | 0) + 16) | 0;
+                          c[w >> 2] = c[Q >> 2];
+                          c[(w + 4) >> 2] = c[(Q + 4) >> 2];
+                          c[(w + 8) >> 2] = c[(Q + 8) >> 2];
+                          c[(w + 12) >> 2] = c[(Q + 12) >> 2];
+                          c[(w + 16) >> 2] = c[(Q + 16) >> 2];
+                          c[(w + 20) >> 2] = c[(Q + 20) >> 2];
+                          c[(w + 24) >> 2] = c[(Q + 24) >> 2];
+                          c[(w + 28) >> 2] = c[(Q + 28) >> 2];
+                          oS(e, w, k);
+                          break;
+                        }
+                        if (!k) break;
+                        hS(e, 137379);
+                        Q = ((c[q >> 2] | 0) + 16) | 0;
+                        c[w >> 2] = c[Q >> 2];
+                        c[(w + 4) >> 2] = c[(Q + 4) >> 2];
+                        c[(w + 8) >> 2] = c[(Q + 8) >> 2];
+                        c[(w + 12) >> 2] = c[(Q + 12) >> 2];
+                        c[(w + 16) >> 2] = c[(Q + 16) >> 2];
+                        c[(w + 20) >> 2] = c[(Q + 20) >> 2];
+                        c[(w + 24) >> 2] = c[(Q + 24) >> 2];
+                        c[(w + 28) >> 2] = c[(Q + 28) >> 2];
+                        oS(e, w, k);
+                        break;
+                      }
+                      Q = c[q >> 2] | 0;
+                      p = (Q + 16) | 0;
+                      c[I >> 2] = c[p >> 2];
+                      c[(I + 4) >> 2] = c[(p + 4) >> 2];
+                      c[(I + 8) >> 2] = c[(p + 8) >> 2];
+                      c[(I + 12) >> 2] = c[(p + 12) >> 2];
+                      Q = (Q + 32) | 0;
+                      c[x >> 2] = c[Q >> 2];
+                      c[(x + 4) >> 2] = c[(Q + 4) >> 2];
+                      c[(x + 8) >> 2] = c[(Q + 8) >> 2];
+                      c[(x + 12) >> 2] = c[(Q + 12) >> 2];
+                      h[y >> 3] = +h[x >> 3];
+                      h[B >> 3] = +h[A >> 3];
+                      h[C >> 3] = +h[I >> 3];
+                      h[E >> 3] = +h[D >> 3];
+                      if (!(ZO(u, c[47141] | 0, 1, 0) | 0)) hS(e, 137379);
+                      else hS(e, j);
+                      if ((jI(e, I, n, 0) | 0) > 1) {
+                        c[N >> 2] = KB(u) | 0;
+                        gA(3, 100400, N) | 0;
+                      }
+                      Q = ((c[q >> 2] | 0) + 16) | 0;
+                      c[w >> 2] = c[Q >> 2];
+                      c[(w + 4) >> 2] = c[(Q + 4) >> 2];
+                      c[(w + 8) >> 2] = c[(Q + 8) >> 2];
+                      c[(w + 12) >> 2] = c[(Q + 12) >> 2];
+                      c[(w + 16) >> 2] = c[(Q + 16) >> 2];
+                      c[(w + 20) >> 2] = c[(Q + 20) >> 2];
+                      c[(w + 24) >> 2] = c[(Q + 24) >> 2];
+                      c[(w + 28) >> 2] = c[(Q + 28) >> 2];
+                      oS(e, w, 0);
+                    }
+                  while (0);
+                  U1(c[J >> 2] | 0);
+                  j = c[((c[q >> 2] | 0) + 12) >> 2] | 0;
+                  if (j | 0) DK(e, 5, j);
+                  if (t) {
+                    if (L) {
+                      Q = ((c[q >> 2] | 0) + 16) | 0;
+                      c[w >> 2] = c[Q >> 2];
+                      c[(w + 4) >> 2] = c[(Q + 4) >> 2];
+                      c[(w + 8) >> 2] = c[(Q + 8) >> 2];
+                      c[(w + 12) >> 2] = c[(Q + 12) >> 2];
+                      c[(w + 16) >> 2] = c[(Q + 16) >> 2];
+                      c[(w + 20) >> 2] = c[(Q + 20) >> 2];
+                      c[(w + 24) >> 2] = c[(Q + 24) >> 2];
+                      c[(w + 28) >> 2] = c[(Q + 28) >> 2];
+                      kI(e, w);
+                      cS(e, c[s >> 2] | 0, c[(r + 228) >> 2] | 0, c[(r + 244) >> 2] | 0, c[(r + 212) >> 2] | 0);
+                    }
+                    dS(e);
+                  }
+                  a: do
+                    if (!F) {
+                      k = jC(u) | 0;
+                      while (1) {
+                        if (!k) break a;
+                        JI(e, k);
+                        j = XA(u, k) | 0;
+                        while (1) {
+                          if (!j) break;
+                          KI(e, j);
+                          j = ZA(u, j) | 0;
+                        }
+                        k = kC(u, k) | 0;
+                      }
+                    }
+                  while (0);
+                  KJ(e, f);
+                  if (!L) II(e, u, i);
+                }
+                v = (v + 1) | 0;
+              }
+              l = P;
+              return;
+            }
+            function JI(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              j = l;
+              l = (l + 32) | 0;
+              e = j;
+              h = c[b >> 2] | 0;
+              i = (d + 16) | 0;
+              a: do
+                if (
+                  (
+                    (c[((c[i >> 2] | 0) + 8) >> 2] | 0 ? ((yJ(b, xC(d) | 0, d) | 0) << 24) >> 24 : 0)
+                      ? ((k = (b + 256) | 0),
+                        (c[e >> 2] = c[k >> 2]),
+                        (c[(e + 4) >> 2] = c[(k + 4) >> 2]),
+                        (c[(e + 8) >> 2] = c[(k + 8) >> 2]),
+                        (c[(e + 12) >> 2] = c[(k + 12) >> 2]),
+                        (c[(e + 16) >> 2] = c[(k + 16) >> 2]),
+                        (c[(e + 20) >> 2] = c[(k + 20) >> 2]),
+                        (c[(e + 24) >> 2] = c[(k + 24) >> 2]),
+                        (c[(e + 28) >> 2] = c[(k + 28) >> 2]),
+                        ((zJ(d, e) | 0) << 24) >> 24)
+                      : 0
+                  )
+                    ? ((f = ((c[i >> 2] | 0) + 116) | 0), (g = c[(h + 28) >> 2] | 0), (g | 0) != (a[f >> 0] | 0))
+                    : 0
+                ) {
+                  a[f >> 0] = g;
+                  rS(b, KB(d) | 0);
+                  e = aP(d, c[47169] | 0, 195059) | 0;
+                  if (a[e >> 0] | 0) rS(b, e);
+                  e = aP(d, c[47157] | 0, 195059) | 0;
+                  b: do
+                    if (a[e >> 0] | 0) {
+                      PI(e) | 0;
+                      e = 188228;
+                      while (1) {
+                        f = e;
+                        e = (e + 4) | 0;
+                        f = c[f >> 2] | 0;
+                        if (!f) break b;
+                        if ((a[f >> 0] | 0) != 105) continue;
+                        if (!(s2(f, 134335) | 0)) break a;
+                      }
+                    }
+                  while (0);
+                  AJ(b, d);
+                  ub[c[((c[((c[((c[i >> 2] | 0) + 8) >> 2] | 0) + 4) >> 2] | 0) + 20) >> 2] & 63](b, d);
+                  e = c[((c[i >> 2] | 0) + 108) >> 2] | 0;
+                  if (e | 0 ? a[(e + 81) >> 0] | 0 : 0) DK(b, 10, e);
+                  BJ(b);
+                }
+              while (0);
+              l = j;
+              return;
+            }
+            function KI(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              h = l;
+              l = (l + 32) | 0;
+              g = h;
+              e = (b + 256) | 0;
+              c[g >> 2] = c[e >> 2];
+              c[(g + 4) >> 2] = c[(e + 4) >> 2];
+              c[(g + 8) >> 2] = c[(e + 8) >> 2];
+              c[(g + 12) >> 2] = c[(e + 12) >> 2];
+              c[(g + 16) >> 2] = c[(e + 16) >> 2];
+              c[(g + 20) >> 2] = c[(e + 20) >> 2];
+              c[(g + 24) >> 2] = c[(e + 24) >> 2];
+              c[(g + 28) >> 2] = c[(e + 28) >> 2];
+              a: do
+                if (((NI(d, g) | 0) << 24) >> 24 ? ((f = (d + -48) | 0), ((OI(b, d) | 0) << 24) >> 24) : 0) {
+                  i = (d + 48) | 0;
+                  e = l2(KB(c[((((c[d >> 2] & 3) | 0) == 3 ? d : i) + 40) >> 2] | 0) | 0) | 0;
+                  e = T1((e + 3 + (l2(KB(c[((((c[d >> 2] & 3) | 0) == 2 ? d : f) + 40) >> 2] | 0) | 0) | 0)) | 0) | 0;
+                  r3(e, KB(c[((((c[d >> 2] & 3) | 0) == 3 ? d : i) + 40) >> 2] | 0) | 0) | 0;
+                  i = (xB(xC(c[((((c[d >> 2] & 3) | 0) == 2 ? d : f) + 40) >> 2] | 0) | 0) | 0) == 0;
+                  g = (e + (l2(e) | 0)) | 0;
+                  if (i) {
+                    a[g >> 0] = a[141747] | 0;
+                    a[(g + 1) >> 0] = a[141748] | 0;
+                    a[(g + 2) >> 0] = a[141749] | 0;
+                  } else {
+                    a[g >> 0] = a[137738] | 0;
+                    a[(g + 1) >> 0] = a[137739] | 0;
+                    a[(g + 2) >> 0] = a[137740] | 0;
+                  }
+                  F4(e, KB(c[((((c[d >> 2] & 3) | 0) == 2 ? d : f) + 40) >> 2] | 0) | 0) | 0;
+                  rS(b, e);
+                  U1(e);
+                  e = aP(d, c[47191] | 0, 195059) | 0;
+                  if (a[e >> 0] | 0) rS(b, e);
+                  e = aP(d, c[47185] | 0, 195059) | 0;
+                  b: do
+                    if (!(a[e >> 0] | 0)) e = 0;
+                    else {
+                      PI(e) | 0;
+                      e = 188228;
+                      while (1) {
+                        f = e;
+                        e = (e + 4) | 0;
+                        f = c[f >> 2] | 0;
+                        if (!f) {
+                          e = 188228;
+                          break b;
+                        }
+                        if ((a[f >> 0] | 0) != 105) continue;
+                        if (!(s2(f, 134335) | 0)) break a;
+                      }
+                    }
+                  while (0);
+                  QI(b, d, e);
+                  RI(b, d, e);
+                  SI(b);
+                }
+              while (0);
+              l = h;
+              return;
+            }
+            function LI(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = (a + 16) | 0;
+              a = 1;
+              while (1) {
+                e = c[d >> 2] | 0;
+                if ((a | 0) > (c[(e + 180) >> 2] | 0)) {
+                  a = 1;
+                  break;
+                }
+                if (!(HC(c[((c[(e + 184) >> 2] | 0) + (a << 2)) >> 2] | 0, b) | 0)) a = (a + 1) | 0;
+                else {
+                  a = 0;
+                  break;
+                }
+              }
+              return a | 0;
+            }
+            function MI(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = (a + 16) | 0;
+              a = 1;
+              while (1) {
+                e = c[d >> 2] | 0;
+                if ((a | 0) > (c[(e + 180) >> 2] | 0)) {
+                  a = 1;
+                  break;
+                }
+                if (!(HC(c[((c[(e + 184) >> 2] | 0) + (a << 2)) >> 2] | 0, b) | 0)) a = (a + 1) | 0;
+                else {
+                  a = 0;
+                  break;
+                }
+              }
+              return a | 0;
+            }
+            function NI(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 64) | 0;
+              i = (j + 32) | 0;
+              f = j;
+              g = (b + 16) | 0;
+              b = c[g >> 2] | 0;
+              e = c[(b + 8) >> 2] | 0;
+              if (
+                (e | 0) != 0
+                  ? ((e = (e + 8) | 0),
+                    (c[f >> 2] = c[e >> 2]),
+                    (c[(f + 4) >> 2] = c[(e + 4) >> 2]),
+                    (c[(f + 8) >> 2] = c[(e + 8) >> 2]),
+                    (c[(f + 12) >> 2] = c[(e + 12) >> 2]),
+                    (c[(f + 16) >> 2] = c[(e + 16) >> 2]),
+                    (c[(f + 20) >> 2] = c[(e + 20) >> 2]),
+                    (c[(f + 24) >> 2] = c[(e + 24) >> 2]),
+                    (c[(f + 28) >> 2] = c[(e + 28) >> 2]),
+                    (c[i >> 2] = c[d >> 2]),
+                    (c[(i + 4) >> 2] = c[(d + 4) >> 2]),
+                    (c[(i + 8) >> 2] = c[(d + 8) >> 2]),
+                    (c[(i + 12) >> 2] = c[(d + 12) >> 2]),
+                    (c[(i + 16) >> 2] = c[(d + 16) >> 2]),
+                    (c[(i + 20) >> 2] = c[(d + 20) >> 2]),
+                    (c[(i + 24) >> 2] = c[(d + 24) >> 2]),
+                    (c[(i + 28) >> 2] = c[(d + 28) >> 2]),
+                    (xJ(f, i) | 0) != 0)
+                  : 0
+              )
+                b = 1;
+              else h = 3;
+              do
+                if ((h | 0) == 3) {
+                  e = c[(b + 96) >> 2] | 0;
+                  if (e) {
+                    c[i >> 2] = c[d >> 2];
+                    c[(i + 4) >> 2] = c[(d + 4) >> 2];
+                    c[(i + 8) >> 2] = c[(d + 8) >> 2];
+                    c[(i + 12) >> 2] = c[(d + 12) >> 2];
+                    c[(i + 16) >> 2] = c[(d + 16) >> 2];
+                    c[(i + 20) >> 2] = c[(d + 20) >> 2];
+                    c[(i + 24) >> 2] = c[(d + 24) >> 2];
+                    c[(i + 28) >> 2] = c[(d + 28) >> 2];
+                    if (((iQ(e, i) | 0) << 24) >> 24) {
+                      b = 1;
+                      break;
+                    }
+                    b = c[g >> 2] | 0;
+                  }
+                  b = c[(b + 108) >> 2] | 0;
+                  if (
+                    (b | 0 ? a[(b + 81) >> 0] | 0 : 0)
+                      ? ((c[i >> 2] = c[d >> 2]),
+                        (c[(i + 4) >> 2] = c[(d + 4) >> 2]),
+                        (c[(i + 8) >> 2] = c[(d + 8) >> 2]),
+                        (c[(i + 12) >> 2] = c[(d + 12) >> 2]),
+                        (c[(i + 16) >> 2] = c[(d + 16) >> 2]),
+                        (c[(i + 20) >> 2] = c[(d + 20) >> 2]),
+                        (c[(i + 24) >> 2] = c[(d + 24) >> 2]),
+                        (c[(i + 28) >> 2] = c[(d + 28) >> 2]),
+                        ((iQ(b, i) | 0) << 24) >> 24)
+                      : 0
+                  ) {
+                    b = 1;
+                    break;
+                  }
+                  b = 0;
+                }
+              while (0);
+              l = j;
+              return b | 0;
+            }
+            function OI(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              a: do
+                if (
+                  (c[(b + 156) >> 2] | 0) >= 2
+                    ? ((e = aP(d, c[47190] | 0, 195059) | 0), ((tJ(b, e) | 0) << 24) >> 24 == 0)
+                    : 0
+                )
+                  if (!(a[e >> 0] | 0)) {
+                    e = 0;
+                    while (1) {
+                      if ((e | 0) >= 2) {
+                        e = 0;
+                        break a;
+                      }
+                      f = (e | 0) == 1;
+                      f =
+                        aP(
+                          c[
+                            ((((c[d >> 2] & 3) | 0) == ((f ? 2 : 3) | 0) ? d : (d + (((f ? -1 : 1) * 48) | 0)) | 0) +
+                              40) >>
+                              2
+                          ] | 0,
+                          c[47167] | 0,
+                          195059
+                        ) | 0;
+                      if (!(a[f >> 0] | 0)) {
+                        e = 1;
+                        break a;
+                      }
+                      if (!(((tJ(b, f) | 0) << 24) >> 24)) e = (e + 1) | 0;
+                      else {
+                        e = 1;
+                        break;
+                      }
+                    }
+                  } else e = 0;
+                else e = 1;
+              while (0);
+              return e | 0;
+            }
+            function PI(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              p = l;
+              l = (l + 192) | 0;
+              o = (p + 24) | 0;
+              n = (p + 16) | 0;
+              m = (p + 8) | 0;
+              k = p;
+              g = (p + 48) | 0;
+              j = (p + 32) | 0;
+              if (a[100282] | 0) {
+                kA(188492, 128, 194826);
+                a[100282] = 0;
+              }
+              kA(j, 128, (p + 56) | 0);
+              c[g >> 2] = b;
+              h = (j + 4) | 0;
+              i = (j + 8) | 0;
+              d = 0;
+              e = 0;
+              a: while (1) {
+                f = d;
+                b: while (1)
+                  switch (rJ(g, j) | 0) {
+                    case 0: {
+                      d = 21;
+                      break a;
+                    }
+                    case 40:
+                      if (!((f << 24) >> 24)) {
+                        f = 1;
+                        continue b;
+                      } else {
+                        d = 7;
+                        break a;
+                      }
+                    case 41:
+                      if (!((f << 24) >> 24)) {
+                        d = 9;
+                        break a;
+                      } else {
+                        f = 0;
+                        continue b;
+                      }
+                    default:
+                      break b;
+                  }
+                if (!((f << 24) >> 24)) {
+                  if ((e | 0) == 63) {
+                    d = 12;
+                    break;
+                  }
+                  d = c[47124] | 0;
+                  if (d >>> 0 >= (c[47125] | 0) >>> 0) {
+                    lA(188492, 1) | 0;
+                    d = c[47124] | 0;
+                  }
+                  c[47124] = d + 1;
+                  a[d >> 0] = 0;
+                  c[(188228 + (e << 2)) >> 2] = c[47124];
+                  e = (e + 1) | 0;
+                }
+                d = c[h >> 2] | 0;
+                if (d >>> 0 >= (c[i >> 2] | 0) >>> 0) {
+                  lA(j, 1) | 0;
+                  d = c[h >> 2] | 0;
+                }
+                a[d >> 0] = 0;
+                d = c[j >> 2] | 0;
+                c[h >> 2] = d;
+                nA(188492, d) | 0;
+                d = c[47124] | 0;
+                if (d >>> 0 >= (c[47125] | 0) >>> 0) {
+                  lA(188492, 1) | 0;
+                  d = c[47124] | 0;
+                }
+                c[47124] = d + 1;
+                a[d >> 0] = 0;
+                d = f;
+              }
+              do
+                if ((d | 0) == 7) {
+                  c[k >> 2] = b;
+                  gA(1, 100283, k) | 0;
+                  c[47057] = 0;
+                  oA(j);
+                } else if ((d | 0) == 9) {
+                  c[m >> 2] = b;
+                  gA(1, 100317, m) | 0;
+                  c[47057] = 0;
+                  oA(j);
+                } else if ((d | 0) == 12) {
+                  c[n >> 2] = b;
+                  gA(0, 100345, n) | 0;
+                  c[47120] = 0;
+                  oA(j);
+                } else if ((d | 0) == 21) {
+                  if ((f << 24) >> 24) {
+                    c[o >> 2] = b;
+                    gA(1, 100368, o) | 0;
+                    c[47057] = 0;
+                    oA(j);
+                    break;
+                  }
+                  c[(188228 + (e << 2)) >> 2] = 0;
+                  oA(j);
+                  d = c[47124] | 0;
+                  if (d >>> 0 >= (c[47125] | 0) >>> 0) {
+                    lA(188492, 1) | 0;
+                    d = c[47124] | 0;
+                  }
+                  a[d >> 0] = 0;
+                  c[47124] = c[47123];
+                }
+              while (0);
+              l = p;
+              return 188228;
+            }
+            function Bb(a) {
+              a = a | 0;
+              var b = 0;
+              b = l;
+              l = (l + a) | 0;
+              l = (l + 15) & -16;
+              return b | 0;
+            }
+            function Cb() {
+              return l | 0;
+            }
+            function Db(a) {
+              a = a | 0;
+              l = a;
+            }
+            function Eb(a, b) {
+              a = a | 0;
+              b = b | 0;
+              l = a;
+              m = b;
+            }
+            function Fb(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if (!o) {
+                o = a;
+                p = b;
+              }
+            }
+            function Gb(a) {
+              a = a | 0;
+              z = a;
+            }
+            function Hb() {
+              return z | 0;
+            }
+            function Ib(a) {
+              a = a | 0;
+              c[46654] = a;
+              return 0;
+            }
+            function Jb() {
+              return c[46654] | 0;
+            }
+            function Kb(a, b) {
+              a = a | 0;
+              b = b | 0;
+              Oa(0, a | 0, b | 0) | 0;
+              return;
+            }
+            function Lb(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 16) | 0;
+              f = (i + 4) | 0;
+              g = i;
+              c[f >> 2] = 0;
+              h = mG() | 0;
+              rG(h, 10976);
+              rG(h, 17220);
+              rG(h, 17440);
+              fA(1) | 0;
+              eA(18) | 0;
+              while (1) {
+                a = ZB(a) | 0;
+                e = c[f >> 2] | 0;
+                if (!a) break;
+                if (e | 0) {
+                  a = 195059;
+                  continue;
+                }
+                nG(h, a, d) | 0;
+                qG(h, a, b, f, g) | 0;
+                a = 195059;
+              }
+              l = i;
+              return e | 0;
+            }
+            function Mb(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              g = l;
+              l = (l + 16) | 0;
+              d = (g + 4) | 0;
+              e = g;
+              f = c[((c[(a + 16) >> 2] | 0) + 8) >> 2] | 0;
+              a = (a + 64) | 0;
+              switch (c[a >> 2] | 0) {
+                case 0: {
+                  JL(f);
+                  break;
+                }
+                case 1: {
+                  if (b[((c[(f + 16) >> 2] | 0) + 136) >> 1] & 1) UP(f);
+                  break;
+                }
+                case 4:
+                case 5:
+                case 6: {
+                  GL(f, e, d);
+                  Pb(f, c[e >> 2] | 0, c[d >> 2] | 0, c[a >> 2] | 0);
+                  break;
+                }
+                default: {
+                }
+              }
+              l = g;
+              return;
+            }
+            function Nb(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              d = c[((c[(a + 16) >> 2] | 0) + 8) >> 2] | 0;
+              if (!(c[46655] | 0)) {
+                c[46655] = c[4678];
+                c[46656] = 57;
+                c[46657] = 19;
+              }
+              e = (d + 64) | 0;
+              f = ((c[e >> 2] | 0) + 8) | 0;
+              b = c[f >> 2] | 0;
+              c[f >> 2] = 186620;
+              switch (c[(a + 64) >> 2] | 0) {
+                case 2: {
+                  wL(a, d, a, 0);
+                  break;
+                }
+                case 3: {
+                  wL(a, d, a, 1);
+                  break;
+                }
+                case 1:
+                case 0: {
+                  if (!(c[(a + 152) >> 2] & 134217728)) dE(d, a) | 0;
+                  break;
+                }
+                case 6:
+                case 5:
+                case 4: {
+                  Ob(d);
+                  if (!(c[(a + 152) >> 2] & 134217728)) dE(d, a) | 0;
+                  break;
+                }
+                default: {
+                }
+              }
+              c[((c[e >> 2] | 0) + 8) >> 2] = b;
+              return;
+            }
+            function Ob(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = c[46659] | 0;
+              if ((d | 0) != (c[46658] | 0)) {
+                e = c[c[46690] >> 2] | 0;
+                if (!e) {
+                  e = _P(b, 0, 99808, 195059) | 0;
+                  c[c[46690] >> 2] = e;
+                  d = c[46659] | 0;
+                }
+                if (d >>> 0 >= (c[46660] | 0) >>> 0) {
+                  lA(186632, 1) | 0;
+                  d = c[46659] | 0;
+                }
+                a[d >> 0] = 0;
+                d = c[46658] | 0;
+                c[46659] = d;
+                KA(b, e, d) | 0;
+              }
+              if (c[((c[(b + 16) >> 2] | 0) + 12) >> 2] | 0) {
+                e = c[((c[46690] | 0) + 4) >> 2] | 0;
+                d = c[46675] | 0;
+                if (d >>> 0 >= (c[46676] | 0) >>> 0) {
+                  lA(186696, 1) | 0;
+                  d = c[46675] | 0;
+                }
+                a[d >> 0] = 0;
+                d = c[46674] | 0;
+                c[46675] = d;
+                KA(b, e, d) | 0;
+              }
+              TA(b, 66753, c[((c[46690] | 0) + 8236) >> 2] | 0, 195059) | 0;
+              d = 0;
+              while (1) {
+                if ((d | 0) == 8) break;
+                oA((186632 + (d << 4)) | 0);
+                d = (d + 1) | 0;
+              }
+              U1(c[46690] | 0);
+              h[1] = 1.0;
+              h[5] = 1.0;
+              c[46691] = 0;
+              c[46695] = 0;
+              return;
+            }
+            function Pb(d, e, f, g) {
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0;
+              i = T1(8240) | 0;
+              c[46690] = i;
+              a: do
+                switch (g | 0) {
+                  case 6: {
+                    b[(i + 8232) >> 1] = 14;
+                    g = 66769;
+                    break;
+                  }
+                  case 5: {
+                    b[(i + 8232) >> 1] = 12;
+                    g = 66773;
+                    break;
+                  }
+                  default: {
+                    g = QA(d, 66753) | 0;
+                    if ((g | 0 ? a[g >> 0] | 0 : 0) ? ((h = Qb(g) | 0), (h & 65535) > 10) : 0) {
+                      i = c[46690] | 0;
+                      b[(i + 8232) >> 1] = h;
+                      break a;
+                    }
+                    g = Qb(66765) | 0;
+                    i = c[46690] | 0;
+                    b[(i + 8232) >> 1] = g;
+                    g = 66765;
+                  }
+                }
+              while (0);
+              c[(i + 8236) >> 2] = g;
+              j = (d + 16) | 0;
+              g = c[j >> 2] | 0;
+              if (!(c[(g + 180) >> 2] | 0)) h = 0;
+              else {
+                h = _P(d, 0, 99808, 195059) | 0;
+                i = c[46690] | 0;
+                g = c[j >> 2] | 0;
+              }
+              c[i >> 2] = h;
+              if (!(a[(g + 113) >> 0] & 8)) g = 0;
+              else g = _P(d, 0, 66777, 195059) | 0;
+              c[((c[46690] | 0) + 4) >> 2] = g;
+              i = _P(d, 1, 99808, 195059) | 0;
+              c[((c[46690] | 0) + 8) >> 2] = i;
+              i = _P(d, 1, 66777, 195059) | 0;
+              c[((c[46690] | 0) + 12) >> 2] = i;
+              i = _P(d, 2, 99808, 195059) | 0;
+              g = c[46690] | 0;
+              c[(g + 16) >> 2] = i;
+              if (!f) h = 0;
+              else {
+                h = _P(d, 2, 66785, 195059) | 0;
+                g = c[46690] | 0;
+              }
+              c[(g + 20) >> 2] = h;
+              if (!e) h = 0;
+              else {
+                h = _P(d, 2, 66793, 195059) | 0;
+                g = c[46690] | 0;
+              }
+              c[(g + 24) >> 2] = h;
+              h = a[((c[j >> 2] | 0) + 113) >> 0] | 0;
+              if (!(h & 33)) i = 0;
+              else {
+                i = _P(d, 2, 66777, 195059) | 0;
+                g = c[46690] | 0;
+                h = a[((c[j >> 2] | 0) + 113) >> 0] | 0;
+              }
+              c[(g + 28) >> 2] = i;
+              if (!(h & 2)) i = 0;
+              else {
+                i = _P(d, 2, 66801, 195059) | 0;
+                g = c[46690] | 0;
+                h = a[((c[j >> 2] | 0) + 113) >> 0] | 0;
+              }
+              c[(g + 32) >> 2] = i;
+              if (!(h & 4)) h = 0;
+              else {
+                h = _P(d, 2, 66810, 195059) | 0;
+                g = c[46690] | 0;
+              }
+              c[(g + 36) >> 2] = h;
+              g = 0;
+              while (1) {
+                if ((g | 0) == 8) break;
+                kA((186632 + (g << 4)) | 0, 1024, ((c[46690] | 0) + 40 + (g << 10)) | 0);
+                g = (g + 1) | 0;
+              }
+              return;
+            }
+            function Qb(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 1040) | 0;
+              h = j;
+              g = (j + 8) | 0;
+              f = 0;
+              d = b;
+              a: while (1) {
+                do {
+                  e = d;
+                  d = (d + 1) | 0;
+                  e = a[e >> 0] | 0;
+                  if (!((e << 24) >> 24)) break a;
+                } while (((((e << 24) >> 24) + -48) | 0) >>> 0 >= 10);
+                if ((f | 0) >= 1023) {
+                  i = 7;
+                  break;
+                }
+                a[(g + f) >> 0] = e;
+                f = (f + 1) | 0;
+              }
+              if ((i | 0) == 7) {
+                c[h >> 2] = b;
+                gA(0, 66819, h) | 0;
+              }
+              a[(g + f) >> 0] = 0;
+              i = (q5(g) | 0) & 65535;
+              l = j;
+              return i | 0;
+            }
+            function Rb(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              e = c[((c[(b + 16) >> 2] | 0) + 8) >> 2] | 0;
+              d = c[c[46690] >> 2] | 0;
+              b = c[46663] | 0;
+              if (b >>> 0 >= (c[46664] | 0) >>> 0) {
+                lA(186648, 1) | 0;
+                b = c[46663] | 0;
+              }
+              a[b >> 0] = 0;
+              b = c[46662] | 0;
+              c[46663] = b;
+              KA(e, d, b) | 0;
+              if (c[((c[(e + 16) >> 2] | 0) + 12) >> 2] | 0) {
+                d = c[((c[46690] | 0) + 4) >> 2] | 0;
+                b = c[46679] | 0;
+                if (b >>> 0 >= (c[46680] | 0) >>> 0) {
+                  lA(186712, 1) | 0;
+                  b = c[46679] | 0;
+                }
+                a[b >> 0] = 0;
+                b = c[46678] | 0;
+                c[46679] = b;
+                KA(e, d, b) | 0;
+              }
+              h[2] = 1.0;
+              h[6] = 1.0;
+              c[46692] = 0;
+              c[46696] = 0;
+              return;
+            }
+            function Sb(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              e = c[((c[(b + 16) >> 2] | 0) + 8) >> 2] | 0;
+              b = c[46663] | 0;
+              if ((c[46662] | 0) != (b | 0)) {
+                d = c[((c[46690] | 0) + 8) >> 2] | 0;
+                if (b >>> 0 >= (c[46664] | 0) >>> 0) {
+                  lA(186648, 1) | 0;
+                  b = c[46663] | 0;
+                }
+                a[b >> 0] = 0;
+                b = c[46662] | 0;
+                c[46663] = b;
+                KA(e, d, b) | 0;
+              }
+              b = c[46679] | 0;
+              if ((c[46678] | 0) != (b | 0)) {
+                d = c[((c[46690] | 0) + 12) >> 2] | 0;
+                if (b >>> 0 >= (c[46680] | 0) >>> 0) {
+                  lA(186712, 1) | 0;
+                  b = c[46679] | 0;
+                }
+                a[b >> 0] = 0;
+                b = c[46678] | 0;
+                c[46679] = b;
+                KA(e, d, b) | 0;
+              }
+              h[9] = 1.0;
+              h[11] = 1.0;
+              c[46699] = 0;
+              c[46701] = 0;
+              return;
+            }
+            function Tb(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              e = c[((c[(b + 16) >> 2] | 0) + 8) >> 2] | 0;
+              b = c[46663] | 0;
+              if ((c[46662] | 0) != (b | 0)) {
+                d = c[((c[46690] | 0) + 16) >> 2] | 0;
+                if (b >>> 0 >= (c[46664] | 0) >>> 0) {
+                  lA(186648, 1) | 0;
+                  b = c[46663] | 0;
+                }
+                a[b >> 0] = 0;
+                b = c[46662] | 0;
+                c[46663] = b;
+                KA(e, d, b) | 0;
+              }
+              b = c[46667] | 0;
+              if ((c[46666] | 0) != (b | 0)) {
+                d = c[((c[46690] | 0) + 24) >> 2] | 0;
+                if (b >>> 0 >= (c[46668] | 0) >>> 0) {
+                  lA(186664, 1) | 0;
+                  b = c[46667] | 0;
+                }
+                a[b >> 0] = 0;
+                b = c[46666] | 0;
+                c[46667] = b;
+                KA(e, d, b) | 0;
+              }
+              b = c[46671] | 0;
+              if ((c[46670] | 0) != (b | 0)) {
+                d = c[((c[46690] | 0) + 20) >> 2] | 0;
+                if (b >>> 0 >= (c[46672] | 0) >>> 0) {
+                  lA(186680, 1) | 0;
+                  b = c[46671] | 0;
+                }
+                a[b >> 0] = 0;
+                b = c[46670] | 0;
+                c[46671] = b;
+                KA(e, d, b) | 0;
+              }
+              b = c[46679] | 0;
+              if ((c[46678] | 0) != (b | 0)) {
+                d = c[((c[46690] | 0) + 28) >> 2] | 0;
+                if (b >>> 0 >= (c[46680] | 0) >>> 0) {
+                  lA(186712, 1) | 0;
+                  b = c[46679] | 0;
+                }
+                a[b >> 0] = 0;
+                b = c[46678] | 0;
+                c[46679] = b;
+                KA(e, d, b) | 0;
+              }
+              b = c[46683] | 0;
+              if ((c[46682] | 0) != (b | 0)) {
+                d = c[((c[46690] | 0) + 36) >> 2] | 0;
+                if (b >>> 0 >= (c[46684] | 0) >>> 0) {
+                  lA(186728, 1) | 0;
+                  b = c[46683] | 0;
+                }
+                a[b >> 0] = 0;
+                b = c[46682] | 0;
+                c[46683] = b;
+                KA(e, d, b) | 0;
+              }
+              b = c[46687] | 0;
+              if ((c[46686] | 0) != (b | 0)) {
+                d = c[((c[46690] | 0) + 32) >> 2] | 0;
+                if (b >>> 0 >= (c[46688] | 0) >>> 0) {
+                  lA(186744, 1) | 0;
+                  b = c[46687] | 0;
+                }
+                a[b >> 0] = 0;
+                b = c[46686] | 0;
+                c[46687] = b;
+                KA(e, d, b) | 0;
+              }
+              h[10] = 1.0;
+              h[12] = 1.0;
+              h[3] = 1.0;
+              h[4] = 1.0;
+              h[7] = 1.0;
+              h[8] = 1.0;
+              c[46700] = 0;
+              c[46702] = 0;
+              c[46693] = 0;
+              c[46694] = 0;
+              c[46697] = 0;
+              c[46698] = 0;
+              return;
+            }
+            function Ub(d, e, f) {
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0;
+              t = l;
+              l = (l + 1056) | 0;
+              j = (t + 16) | 0;
+              s = (t + 8) | 0;
+              r = t;
+              k = (t + 32) | 0;
+              o = c[((c[(d + 16) >> 2] | 0) + 12) >> 2] | 0;
+              p = c[(11416 + (o << 2)) >> 2] | 0;
+              nA(p, 66916) | 0;
+              g = (f + 4) | 0;
+              bc(k, +h[((c[g >> 2] | 0) + 16) >> 3]);
+              nA(p, k) | 0;
+              ec(d, 195059, c[c[g >> 2] >> 2] | 0);
+              _b(d);
+              q = a[(f + 48) >> 0] | 0;
+              q = (q << 24) >> 24 == 108 ? -1 : ((q << 24) >> 24 == 114) & 1;
+              g = c[g >> 2] | 0;
+              if (!g) g = 0;
+              else g = c[(g + 24) >> 2] & 127;
+              i = b[((c[46690] | 0) + 8232) >> 1] | 0;
+              if (
+                (i & 65535) > 14
+                  ? ((m = c[(11464 + (((i & 65535) + -15) << 2)) >> 2] & g),
+                    (n = (186764 + (o << 2)) | 0),
+                    (c[n >> 2] | 0) != (m | 0))
+                  : 0
+              ) {
+                c[r >> 2] = m;
+                m4(k, 66919, r) | 0;
+                nA(p, k) | 0;
+                c[n >> 2] = m;
+              }
+              r = (e + 8) | 0;
+              h[r >> 3] = +h[r >> 3] + +h[(f + 24) >> 3];
+              nA(p, 66925) | 0;
+              c[j >> 2] = c[e >> 2];
+              c[(j + 4) >> 2] = c[(e + 4) >> 2];
+              c[(j + 8) >> 2] = c[(e + 8) >> 2];
+              c[(j + 12) >> 2] = c[(e + 12) >> 2];
+              ac(p, j);
+              c[s >> 2] = q;
+              m4(k, 102220, s) | 0;
+              nA(p, k) | 0;
+              bc(k, +h[(f + 32) >> 3]);
+              nA(p, k) | 0;
+              ec(d, 195059, c[f >> 2] | 0);
+              l = t;
+              return;
+            }
+            function Vb(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0;
+              i = l;
+              l = (l + 1040) | 0;
+              f = i;
+              g = (i + 16) | 0;
+              e = c[((c[(a + 16) >> 2] | 0) + 12) >> 2] | 0;
+              Zb(a);
+              _b(a);
+              if (!d) {
+                a = c[(11416 + (e << 2)) >> 2] | 0;
+                nA(a, 66913) | 0;
+              } else {
+                if ((d | 1 | 0) == 3) gc(a, d, b, 2);
+                else hc(a);
+                a = c[(11416 + (e << 2)) >> 2] | 0;
+                nA(a, 66910) | 0;
+              }
+              c[f >> 2] = c[b >> 2];
+              c[(f + 4) >> 2] = c[(b + 4) >> 2];
+              c[(f + 8) >> 2] = c[(b + 8) >> 2];
+              c[(f + 12) >> 2] = c[(b + 12) >> 2];
+              ac(a, f);
+              bc(g, +h[(b + 16) >> 3] - +h[b >> 3]);
+              nA(a, g) | 0;
+              bc(g, +h[(b + 24) >> 3] - +h[(b + 8) >> 3]);
+              nA(a, g) | 0;
+              l = i;
+              return;
+            }
+            function Wb(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              Zb(a);
+              _b(a);
+              if (!d) $b(a, 112, b, c);
+              else {
+                if ((d | 1 | 0) == 3) gc(a, d, b, c);
+                else hc(a);
+                $b(a, 80, b, c);
+              }
+              return;
+            }
+            function Xb(a, b, c, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              Zb(a);
+              _b(a);
+              if (!f) $b(a, 66, b, c);
+              else {
+                if ((f | 1 | 0) == 3) gc(a, f, b, c);
+                else hc(a);
+                $b(a, 98, b, c);
+              }
+              return;
+            }
+            function Yb(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              Zb(a);
+              _b(a);
+              $b(a, 76, b, c);
+              return;
+            }
+            function Zb(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              n = l;
+              l = (l + 1184) | 0;
+              i = n;
+              f = (n + 24) | 0;
+              m = (n + 8) | 0;
+              kA(m, 1024, (n + 152) | 0);
+              j = (b + 16) | 0;
+              d = c[j >> 2] | 0;
+              g = +h[(d + 152) >> 3];
+              e = (8 + (c[(d + 12) >> 2] << 3)) | 0;
+              if (g != +h[e >> 3]) {
+                h[e >> 3] = g;
+                nA(m, 66882) | 0;
+                h[i >> 3] = +h[((c[j >> 2] | 0) + 152) >> 3];
+                m4(f, 66896, i) | 0;
+                cc(f, 0);
+                nA(m, f) | 0;
+                f = (m + 4) | 0;
+                d = c[f >> 2] | 0;
+                e = (m + 8) | 0;
+                if (d >>> 0 >= (c[e >> 2] | 0) >>> 0) {
+                  lA(m, 1) | 0;
+                  d = c[f >> 2] | 0;
+                }
+                c[f >> 2] = d + 1;
+                a[d >> 0] = 41;
+                d = c[f >> 2] | 0;
+                if (d >>> 0 >= (c[e >> 2] | 0) >>> 0) {
+                  lA(m, 1) | 0;
+                  d = c[f >> 2] | 0;
+                }
+                a[d >> 0] = 0;
+                d = c[m >> 2] | 0;
+                c[f >> 2] = d;
+                ec(b, 66901, d);
+                d = c[j >> 2] | 0;
+              }
+              d = c[(d + 160) >> 2] | 0;
+              if (d | 0) {
+                j = (m + 4) | 0;
+                k = (m + 8) | 0;
+                a: while (1) {
+                  i = (d + 4) | 0;
+                  d = c[d >> 2] | 0;
+                  if (!d) break;
+                  switch (a[d >> 0] | 0) {
+                    case 102: {
+                      if (!(s2(d, 111101) | 0)) {
+                        d = i;
+                        continue a;
+                      }
+                      break;
+                    }
+                    case 98: {
+                      if (!(s2(d, 111083) | 0)) {
+                        d = i;
+                        continue a;
+                      }
+                      break;
+                    }
+                    case 115: {
+                      if (!(s2(d, 111088) | 0)) {
+                        d = i;
+                        continue a;
+                      }
+                      break;
+                    }
+                    default: {
+                    }
+                  }
+                  nA(m, d) | 0;
+                  do {
+                    f = d;
+                    d = (d + 1) | 0;
+                  } while ((a[f >> 0] | 0) != 0);
+                  if (a[d >> 0] | 0) {
+                    e = c[j >> 2] | 0;
+                    if (e >>> 0 >= (c[k >> 2] | 0) >>> 0) {
+                      lA(m, 1) | 0;
+                      e = c[j >> 2] | 0;
+                    }
+                    c[j >> 2] = e + 1;
+                    a[e >> 0] = 40;
+                    f = 0;
+                    while (1) {
+                      if (!(a[d >> 0] | 0)) break;
+                      if (f | 0) {
+                        e = c[j >> 2] | 0;
+                        if (e >>> 0 >= (c[k >> 2] | 0) >>> 0) {
+                          lA(m, 1) | 0;
+                          e = c[j >> 2] | 0;
+                        }
+                        c[j >> 2] = e + 1;
+                        a[e >> 0] = 44;
+                      }
+                      nA(m, d) | 0;
+                      do {
+                        e = d;
+                        d = (d + 1) | 0;
+                      } while ((a[e >> 0] | 0) != 0);
+                      f = (f + 1) | 0;
+                    }
+                    d = c[j >> 2] | 0;
+                    if (d >>> 0 >= (c[k >> 2] | 0) >>> 0) {
+                      lA(m, 1) | 0;
+                      d = c[j >> 2] | 0;
+                    }
+                    c[j >> 2] = d + 1;
+                    a[d >> 0] = 41;
+                  }
+                  d = c[j >> 2] | 0;
+                  if (d >>> 0 >= (c[k >> 2] | 0) >>> 0) {
+                    lA(m, 1) | 0;
+                    d = c[j >> 2] | 0;
+                  }
+                  a[d >> 0] = 0;
+                  d = c[m >> 2] | 0;
+                  c[j >> 2] = d;
+                  ec(b, 66901, d);
+                  d = i;
+                }
+                oA(m);
+              }
+              l = n;
+              return;
+            }
+            function _b(a) {
+              a = a | 0;
+              dc(((c[(a + 16) >> 2] | 0) + 16) | 0);
+              ec(a, 75834, 193758);
+              return;
+            }
+            function $b(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 1040) | 0;
+              j = k;
+              i = (k + 16) | 0;
+              h = c[(11416 + (c[((c[(b + 16) >> 2] | 0) + 12) >> 2] << 2)) >> 2] | 0;
+              g = (h + 4) | 0;
+              b = c[g >> 2] | 0;
+              if (b >>> 0 >= (c[(h + 8) >> 2] | 0) >>> 0) {
+                lA(h, 1) | 0;
+                b = c[g >> 2] | 0;
+              }
+              c[g >> 2] = b + 1;
+              a[b >> 0] = d;
+              c[j >> 2] = f;
+              m4(i, 66846, j) | 0;
+              nA(h, i) | 0;
+              b = 0;
+              while (1) {
+                if ((b | 0) >= (f | 0)) break;
+                i = (e + (b << 4)) | 0;
+                c[j >> 2] = c[i >> 2];
+                c[(j + 4) >> 2] = c[(i + 4) >> 2];
+                c[(j + 8) >> 2] = c[(i + 8) >> 2];
+                c[(j + 12) >> 2] = c[(i + 12) >> 2];
+                ac(h, j);
+                b = (b + 1) | 0;
+              }
+              l = k;
+              return;
+            }
+            function ac(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0,
+                d = 0;
+              c = l;
+              l = (l + 1024) | 0;
+              d = c;
+              bc(d, +h[b >> 3]);
+              nA(a, d) | 0;
+              bc(d, +vL(+h[(b + 8) >> 3]));
+              nA(a, d) | 0;
+              l = c;
+              return;
+            }
+            function bc(a, b) {
+              a = a | 0;
+              b = +b;
+              var c = 0,
+                d = 0;
+              c = l;
+              l = (l + 16) | 0;
+              d = c;
+              h[d >> 3] = (b > -1.0e-8) & (b < 1.0e-8) ? 0.0 : b;
+              m4(a, 66851, d) | 0;
+              cc(a, 1);
+              l = c;
+              return;
+            }
+            function cc(b, c) {
+              b = b | 0;
+              c = c | 0;
+              var d = 0,
+                e = 0;
+              d = R2(b, 46) | 0;
+              if (!d) {
+                if (c | 0) {
+                  d = (b + (l2(b) | 0)) | 0;
+                  e = 10;
+                }
+              } else {
+                while (1) {
+                  b = (d + 1) | 0;
+                  if (!(a[b >> 0] | 0)) break;
+                  else d = b;
+                }
+                a: while (1) {
+                  switch (a[d >> 0] | 0) {
+                    case 46: {
+                      e = 5;
+                      break a;
+                    }
+                    case 48:
+                      break;
+                    default: {
+                      e = 6;
+                      break a;
+                    }
+                  }
+                  a[d >> 0] = 0;
+                  d = (d + -1) | 0;
+                }
+                if ((e | 0) == 5) a[d >> 0] = 0;
+                else if ((e | 0) == 6) d = (d + 1) | 0;
+                if (c | 0) e = 10;
+              }
+              if ((e | 0) == 10) {
+                a[d >> 0] = 32;
+                a[(d + 1) >> 0] = 0;
+              }
+              return;
+            }
+            function dc(b) {
+              b = b | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 32) | 0;
+              i = (j + 16) | 0;
+              h = j;
+              e = a[(b + 3) >> 0] | 0;
+              f = d[b >> 0] | 0;
+              g = d[(b + 1) >> 0] | 0;
+              b = d[(b + 2) >> 0] | 0;
+              if ((e << 24) >> 24 == -1) {
+                c[h >> 2] = f;
+                c[(h + 4) >> 2] = g;
+                c[(h + 8) >> 2] = b;
+                m4(193758, 75714, h) | 0;
+              } else {
+                c[i >> 2] = f;
+                c[(i + 4) >> 2] = g;
+                c[(i + 8) >> 2] = b;
+                c[(i + 12) >> 2] = e & 255;
+                m4(193758, 66864, i) | 0;
+              }
+              l = j;
+              return;
+            }
+            function ec(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              fc(c[(11416 + (c[((c[(a + 16) >> 2] | 0) + 12) >> 2] << 2)) >> 2] | 0, b, d);
+              return;
+            }
+            function fc(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              f = l;
+              l = (l + 1040) | 0;
+              h = f;
+              g = (f + 8) | 0;
+              i = l2(e) | 0;
+              c[h >> 2] = d;
+              c[(h + 4) >> 2] = i;
+              m4(g, 66857, h) | 0;
+              nA(b, g) | 0;
+              nA(b, e) | 0;
+              e = (b + 4) | 0;
+              d = c[e >> 2] | 0;
+              if (d >>> 0 >= (c[(b + 8) >> 2] | 0) >>> 0) {
+                lA(b, 1) | 0;
+                d = c[e >> 2] | 0;
+              }
+              c[e >> 2] = d + 1;
+              a[d >> 0] = 32;
+              l = f;
+              return;
+            }
+            function gc(b, d, f, i) {
+              b = b | 0;
+              d = d | 0;
+              f = f | 0;
+              i = i | 0;
+              var j = 0.0,
+                k = 0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0.0;
+              x = l;
+              l = (l + 1120) | 0;
+              t = (x + 64) | 0;
+              w = (x + 80) | 0;
+              k = (x + 32) | 0;
+              r = (x + 16) | 0;
+              s = x;
+              u = c[(b + 16) >> 2] | 0;
+              j = +(c[(u + 136) >> 2] | 0) * 0.017453292519943295;
+              if ((e[((c[46690] | 0) + 8232) >> 1] | 0) < 14) hc(b);
+              else {
+                kA(w, 1024, (x + 96) | 0);
+                v = (d | 0) == 2;
+                if (v) {
+                  pQ(f, k, i, j, 2);
+                  f = (w + 4) | 0;
+                  d = c[f >> 2] | 0;
+                  if (d >>> 0 >= (c[(w + 8) >> 2] | 0) >>> 0) {
+                    lA(w, 1) | 0;
+                    d = c[f >> 2] | 0;
+                  }
+                  c[f >> 2] = d + 1;
+                  a[d >> 0] = 91;
+                  c[t >> 2] = c[k >> 2];
+                  c[(t + 4) >> 2] = c[(k + 4) >> 2];
+                  c[(t + 8) >> 2] = c[(k + 8) >> 2];
+                  c[(t + 12) >> 2] = c[(k + 12) >> 2];
+                  ac(w, t);
+                  s = (k + 16) | 0;
+                  c[t >> 2] = c[s >> 2];
+                  c[(t + 4) >> 2] = c[(s + 4) >> 2];
+                  c[(t + 8) >> 2] = c[(s + 8) >> 2];
+                  c[(t + 12) >> 2] = c[(s + 12) >> 2];
+                  ac(w, t);
+                } else {
+                  pQ(f, k, i, 0.0, 3);
+                  q = +h[(k + 24) >> 3];
+                  o = +h[k >> 3];
+                  if (j == 0.0) {
+                    n = +h[(k + 8) >> 3];
+                    p = q * 0.25;
+                    j = n;
+                    m = o;
+                  } else {
+                    p = q * 0.25;
+                    y = p;
+                    m = +E(+j) * y + o;
+                    n = +h[(k + 8) >> 3];
+                    j = +F(+j) * y + n;
+                  }
+                  h[r >> 3] = m;
+                  h[(r + 8) >> 3] = j;
+                  h[s >> 3] = o;
+                  h[(s + 8) >> 3] = n;
+                  f = (w + 4) | 0;
+                  d = c[f >> 2] | 0;
+                  if (d >>> 0 >= (c[(w + 8) >> 2] | 0) >>> 0) {
+                    lA(w, 1) | 0;
+                    d = c[f >> 2] | 0;
+                  }
+                  c[f >> 2] = d + 1;
+                  a[d >> 0] = 40;
+                  c[t >> 2] = c[r >> 2];
+                  c[(t + 4) >> 2] = c[(r + 4) >> 2];
+                  c[(t + 8) >> 2] = c[(r + 8) >> 2];
+                  c[(t + 12) >> 2] = c[(r + 12) >> 2];
+                  ac(w, t);
+                  ic(w, p);
+                  c[t >> 2] = c[s >> 2];
+                  c[(t + 4) >> 2] = c[(s + 4) >> 2];
+                  c[(t + 8) >> 2] = c[(s + 8) >> 2];
+                  c[(t + 12) >> 2] = c[(s + 12) >> 2];
+                  ac(w, t);
+                  ic(w, q);
+                }
+                nA(w, 66907) | 0;
+                d = (u + 140) | 0;
+                j = +g[d >> 2];
+                f = (u + 56) | 0;
+                if (j > 0.0) {
+                  jc(w, j, f);
+                  jc(w, +g[d >> 2], (u + 96) | 0);
+                } else {
+                  jc(w, 0.0, f);
+                  jc(w, 1.0, (u + 96) | 0);
+                }
+                pA(w) | 0;
+                k = (w + 4) | 0;
+                d = c[k >> 2] | 0;
+                i = (w + 8) | 0;
+                f = d >>> 0 >= (c[i >> 2] | 0) >>> 0;
+                if (v) {
+                  if (f) {
+                    lA(w, 1) | 0;
+                    d = c[k >> 2] | 0;
+                  }
+                  c[k >> 2] = d + 1;
+                  a[d >> 0] = 93;
+                } else {
+                  if (f) {
+                    lA(w, 1) | 0;
+                    d = c[k >> 2] | 0;
+                  }
+                  c[k >> 2] = d + 1;
+                  a[d >> 0] = 41;
+                }
+                d = c[k >> 2] | 0;
+                if (d >>> 0 >= (c[i >> 2] | 0) >>> 0) {
+                  lA(w, 1) | 0;
+                  d = c[k >> 2] | 0;
+                }
+                a[d >> 0] = 0;
+                v = c[w >> 2] | 0;
+                c[k >> 2] = v;
+                ec(b, 66904, v);
+                oA(w);
+              }
+              l = x;
+              return;
+            }
+            function hc(a) {
+              a = a | 0;
+              dc(((c[(a + 16) >> 2] | 0) + 56) | 0);
+              ec(a, 66904, 193758);
+              return;
+            }
+            function ic(a, b) {
+              a = a | 0;
+              b = +b;
+              var c = 0,
+                d = 0;
+              c = l;
+              l = (l + 1024) | 0;
+              d = c;
+              bc(d, b);
+              nA(a, d) | 0;
+              l = c;
+              return;
+            }
+            function jc(a, b, c) {
+              a = a | 0;
+              b = +b;
+              c = c | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              d = l;
+              l = (l + 1040) | 0;
+              f = d;
+              e = (d + 8) | 0;
+              h[f >> 3] = b;
+              m4(e, 94168, f) | 0;
+              cc(e, 1);
+              dc(c);
+              fc(a, e, 193758);
+              l = d;
+              return;
+            }
+            function kc(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0;
+              e = l;
+              l = (l + 1040) | 0;
+              i = e;
+              f = (e + 16) | 0;
+              g = c[(11416 + (c[((c[(a + 16) >> 2] | 0) + 12) >> 2] << 2)) >> 2] | 0;
+              nA(g, 67013) | 0;
+              c[i >> 2] = c[d >> 2];
+              c[(i + 4) >> 2] = c[(d + 4) >> 2];
+              c[(i + 8) >> 2] = c[(d + 8) >> 2];
+              c[(i + 12) >> 2] = c[(d + 12) >> 2];
+              ac(g, i);
+              bc(f, +h[(d + 16) >> 3] - +h[d >> 3]);
+              nA(g, f) | 0;
+              bc(f, +h[(d + 24) >> 3] - +h[(d + 8) >> 3]);
+              nA(g, f) | 0;
+              ec(a, 195059, c[(b + 8) >> 2] | 0);
+              l = e;
+              return;
+            }
+            function lc(a) {
+              a = a | 0;
+              var b = 0;
+              switch (c[(a + 64) >> 2] | 0) {
+                case 0: {
+                  b = AF(c[a >> 2] | 0) | 0;
+                  oG(b, c[((c[(a + 16) >> 2] | 0) + 8) >> 2] | 0, 67797, 0) | 0;
+                  BF(b);
+                  break;
+                }
+                case 1: {
+                  JL(c[((c[a >> 2] | 0) + 168) >> 2] | 0);
+                  break;
+                }
+                default: {
+                }
+              }
+              return;
+            }
+            function mc(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              f = l;
+              l = (l + 16) | 0;
+              d = f;
+              e = c[((c[(b + 16) >> 2] | 0) + 8) >> 2] | 0;
+              if (!(c[46703] | 0)) {
+                c[46703] = c[4678];
+                c[46704] = 57;
+                c[46705] = 19;
+              }
+              c[((c[(e + 64) >> 2] | 0) + 8) >> 2] = 186812;
+              nc(e, 1);
+              c[d >> 2] = 0;
+              a[(d + 4) >> 0] = ((a[((c[(e + 16) >> 2] | 0) + 115) >> 0] | 0) == 1) & 1;
+              g = c[(b + 64) >> 2] | 0;
+              a[(d + 5) >> 0] = (((g | 0) == 0) | ((g | 0) == 3)) & 1;
+              a[(d + 6) >> 0] = 0;
+              oc(e, b, 1, d);
+              l = f;
+              return;
+            }
+            function nc(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              c[a >> 2] = c[a >> 2] & -9;
+              d = OD(a) | 0;
+              while (1) {
+                if (!d) break;
+                nc(d, 0);
+                d = PD(d) | 0;
+              }
+              a: do
+                if (b | 0) {
+                  b = jC(a) | 0;
+                  while (1) {
+                    if (!b) break a;
+                    c[b >> 2] = c[b >> 2] & -9;
+                    d = XA(a, b) | 0;
+                    while (1) {
+                      if (!d) break;
+                      c[d >> 2] = c[d >> 2] & -9;
+                      d = ZA(a, d) | 0;
+                    }
+                    b = kC(a, b) | 0;
+                  }
+                }
+              while (0);
+              return;
+            }
+            function oc(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              q = l;
+              l = (l + 16) | 0;
+              p = (q + 8) | 0;
+              o = q;
+              n = (d | 0) != 0;
+              if (n) {
+                m = Vz(11836, c[4581] | 0) | 0;
+                YC(a, 1, 141060, 12, 0);
+                YC(a, 2, 141060, 12, 0);
+                YC(a, 0, 141060, -12, 0);
+                f = pc(a, 0, m) | 0;
+                j = jC(a) | 0;
+                i = 0;
+                g = 0;
+                while (1) {
+                  if (!j) break;
+                  if (!(Q2(KB(j) | 0, 108006, 7) | 0)) {
+                    k = g;
+                    g = qc(m, KB(j) | 0) | 0;
+                  } else {
+                    k = (g + 1) | 0;
+                    g = (g + f) | 0;
+                  }
+                  c[((RC(j, 141060, 0) | 0) + 8) >> 2] = g;
+                  h = XA(a, j) | 0;
+                  g = i;
+                  while (1) {
+                    if (!h) break;
+                    c[((RC(h, 141060, 0) | 0) + 8) >> 2] = g;
+                    h = ZA(a, h) | 0;
+                    g = (g + 1) | 0;
+                  }
+                  j = kC(a, j) | 0;
+                  i = g;
+                  g = k;
+                }
+                Rz(m) | 0;
+              } else f = 0;
+              m = c[e >> 2] | 0;
+              c[e >> 2] = m + 1;
+              rc(b, m);
+              oF(b, 97374) | 0;
+              sc(a, b, d, e);
+              tc(a, b, e);
+              oF(b, 97345) | 0;
+              rc(b, c[e >> 2] | 0);
+              if (n) {
+                c[o >> 2] = f;
+                uF(b, 67016, o);
+              } else {
+                c[p >> 2] = c[((RC(a, 141060, 0) | 0) + 8) >> 2];
+                uF(b, 67036, p);
+              }
+              vc(a, b, d, uc(a, b, d, e) | 0, e);
+              wc(a, b, d, e);
+              oF(b, 153599) | 0;
+              p = ((c[e >> 2] | 0) + -1) | 0;
+              c[e >> 2] = p;
+              rc(b, p);
+              if (n) oF(b, 111008) | 0;
+              else oF(b, 75357) | 0;
+              l = q;
+              return;
+            }
+            function pc(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              if ((yC(a) | 0) != (a | 0)) {
+                e = (b + 1) | 0;
+                c[((RC(a, 141060, 0) | 0) + 8) >> 2] = b;
+                if (!(Q2(KB(a) | 0, 108006, 7) | 0)) {
+                  b = KB(a) | 0;
+                  Ic(d, b, c[((RC(a, 141060, 0) | 0) + 8) >> 2] | 0);
+                  b = e;
+                } else b = e;
+              }
+              e = OD(a) | 0;
+              while (1) {
+                if (!e) break;
+                a = pc(e, b, d) | 0;
+                e = PD(e) | 0;
+                b = a;
+              }
+              return b | 0;
+            }
+            function qc(a, b) {
+              a = a | 0;
+              b = b | 0;
+              a = nb[c[a >> 2] & 63](a, b, 512) | 0;
+              if (!a) a = -1;
+              else a = c[(a + 12) >> 2] | 0;
+              return a | 0;
+            }
+            function rc(a, b) {
+              a = a | 0;
+              b = b | 0;
+              while (1) {
+                if ((b | 0) <= 0) break;
+                oF(a, 90574) | 0;
+                b = (b + -1) | 0;
+              }
+              return;
+            }
+            function sc(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              h = l;
+              l = (l + 32) | 0;
+              g = (h + 16) | 0;
+              f = (h + 8) | 0;
+              i = h;
+              j = KB(a) | 0;
+              rc(b, c[e >> 2] | 0);
+              c[i >> 2] = zc(j, e) | 0;
+              uF(b, 67124, i);
+              if (d | 0) {
+                oF(b, 97345) | 0;
+                rc(b, c[e >> 2] | 0);
+                j = (xB(a) | 0) != 0;
+                c[f >> 2] = j ? 107652 : 137308;
+                uF(b, 67738, f);
+                rc(b, c[e >> 2] | 0);
+                j = (zB(a) | 0) != 0;
+                c[g >> 2] = j ? 107652 : 137308;
+                uF(b, 67755, g);
+              }
+              l = h;
+              return;
+            }
+            function tc(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              o = l;
+              l = (l + 16) | 0;
+              n = (o + 8) | 0;
+              m = o;
+              i = yC(b) | 0;
+              j = c[b >> 2] & 3;
+              f = LA(i, j, 0) | 0;
+              a: do
+                if (f | 0) {
+                  k = (e + 5) | 0;
+                  while (1) {
+                    if (!f) break a;
+                    g = RA(b, f) | 0;
+                    do
+                      if (g | 0) {
+                        h = (f + 8) | 0;
+                        if (!(a[g >> 0] | 0)) {
+                          g = c[h >> 2] | 0;
+                          if ((a[g >> 0] | 0) != 108) break;
+                          if (s2(g, 108224) | 0) break;
+                        }
+                        oF(d, 97345) | 0;
+                        rc(d, c[e >> 2] | 0);
+                        c[m >> 2] = zc(c[h >> 2] | 0, e) | 0;
+                        uF(d, 67174, m);
+                        if (a[k >> 0] | 0 ? Bc(c[h >> 2] | 0) | 0 : 0) {
+                          Cc(RA(b, f) | 0, d, e);
+                          break;
+                        }
+                        c[n >> 2] = zc(RA(b, f) | 0, e) | 0;
+                        uF(d, 67181, n);
+                      }
+                    while (0);
+                    f = LA(i, j, f) | 0;
+                  }
+                }
+              while (0);
+              l = o;
+              return;
+            }
+            function uc(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 16) | 0;
+              h = i;
+              f = OD(a) | 0;
+              if (f) {
+                oF(b, 97345) | 0;
+                g = c[e >> 2] | 0;
+                c[e >> 2] = g + 1;
+                rc(b, g);
+                g = (d | 0) != 0;
+                if (g) {
+                  oF(b, 67098) | 0;
+                  a = 0;
+                  d = f;
+                } else {
+                  oF(b, 67158) | 0;
+                  rc(b, c[e >> 2] | 0);
+                  a = 0;
+                  d = f;
+                }
+                while (1) {
+                  if (!d) break;
+                  if (!a) a = 1;
+                  else oF(b, 97345) | 0;
+                  if (g) Ac(d, b, e);
+                  else {
+                    c[h >> 2] = c[((RC(d, 141060, 0) | 0) + 8) >> 2];
+                    uF(b, 137395, h);
+                  }
+                  d = PD(d) | 0;
+                }
+                if (g) a = 1;
+                else {
+                  c[e >> 2] = (c[e >> 2] | 0) + -1;
+                  oF(b, 153599) | 0;
+                  rc(b, c[e >> 2] | 0);
+                  oF(b, 97340) | 0;
+                  a = 1;
+                }
+              } else a = 0;
+              l = i;
+              return a | 0;
+            }
+            function vc(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0;
+              g = jC(a) | 0;
+              if (!g) {
+                if (((d | 0) != 0) & ((e | 0) != 0)) {
+                  c[f >> 2] = (c[f >> 2] | 0) + -1;
+                  oF(b, 153599) | 0;
+                  rc(b, c[f >> 2] | 0);
+                  oF(b, 97340) | 0;
+                }
+              } else {
+                oF(b, 97345) | 0;
+                h = (d | 0) != 0;
+                if (h)
+                  if (!e) {
+                    e = c[f >> 2] | 0;
+                    c[f >> 2] = e + 1;
+                    rc(b, e);
+                    oF(b, 67098) | 0;
+                    e = 0;
+                  } else e = 0;
+                else {
+                  e = c[f >> 2] | 0;
+                  c[f >> 2] = e + 1;
+                  rc(b, e);
+                  oF(b, 67112) | 0;
+                  rc(b, c[f >> 2] | 0);
+                  e = 0;
+                }
+                while (1) {
+                  if (!g) break;
+                  if (Q2(KB(g) | 0, 108006, 7) | 0) {
+                    do
+                      if (e)
+                        if (h) {
+                          oF(b, 97345) | 0;
+                          break;
+                        } else {
+                          oF(b, 100999) | 0;
+                          break;
+                        }
+                      else e = 1;
+                    while (0);
+                    yc(g, b, d, f);
+                  }
+                  g = kC(a, g) | 0;
+                }
+                c[f >> 2] = (c[f >> 2] | 0) + -1;
+                oF(b, 153599) | 0;
+                rc(b, c[f >> 2] | 0);
+                oF(b, 97340) | 0;
+              }
+              return;
+            }
+            function wc(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              f = jC(a) | 0;
+              a: do
+                if (f | 0) {
+                  while (1) {
+                    if (!f) break a;
+                    if (XA(a, f) | 0) break;
+                    f = kC(a, f) | 0;
+                  }
+                  oF(b, 97345) | 0;
+                  i = c[e >> 2] | 0;
+                  c[e >> 2] = i + 1;
+                  rc(b, i);
+                  oF(b, 67048) | 0;
+                  i = (d | 0) != 0;
+                  if (i) g = 0;
+                  else {
+                    rc(b, c[e >> 2] | 0);
+                    g = 0;
+                  }
+                  while (1) {
+                    if (!f) break;
+                    h = XA(a, f) | 0;
+                    while (1) {
+                      if (!h) break;
+                      do
+                        if (g)
+                          if (i) {
+                            oF(b, 97345) | 0;
+                            break;
+                          } else {
+                            oF(b, 100999) | 0;
+                            break;
+                          }
+                        else g = 1;
+                      while (0);
+                      xc(h, b, d, e);
+                      h = ZA(a, h) | 0;
+                    }
+                    f = kC(a, f) | 0;
+                  }
+                  c[e >> 2] = (c[e >> 2] | 0) + -1;
+                  oF(b, 153599) | 0;
+                  rc(b, c[e >> 2] | 0);
+                  oF(b, 97340) | 0;
+                }
+              while (0);
+              return;
+            }
+            function xc(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 32) | 0;
+              i = (j + 24) | 0;
+              h = (j + 16) | 0;
+              g = (j + 8) | 0;
+              f = j;
+              if (!d) {
+                c[i >> 2] = c[((RC(a, 141060, 0) | 0) + 8) >> 2];
+                uF(b, 137395, i);
+              } else {
+                i = c[e >> 2] | 0;
+                c[e >> 2] = i + 1;
+                rc(b, i);
+                oF(b, 97374) | 0;
+                rc(b, c[e >> 2] | 0);
+                c[f >> 2] = c[((RC(a, 141060, 0) | 0) + 8) >> 2];
+                uF(b, 67060, f);
+                rc(b, c[e >> 2] | 0);
+                c[g >> 2] =
+                  c[((RC(c[((((c[a >> 2] & 3) | 0) == 3 ? a : (a + 48) | 0) + 40) >> 2] | 0, 141060, 0) | 0) + 8) >> 2];
+                uF(b, 67074, g);
+                rc(b, c[e >> 2] | 0);
+                c[h >> 2] =
+                  c[
+                    ((RC(c[((((c[a >> 2] & 3) | 0) == 2 ? a : (a + -48) | 0) + 40) >> 2] | 0, 141060, 0) | 0) + 8) >> 2
+                  ];
+                uF(b, 67087, h);
+                tc(a, b, e);
+                oF(b, 153599) | 0;
+                i = ((c[e >> 2] | 0) + -1) | 0;
+                c[e >> 2] = i;
+                rc(b, i);
+                oF(b, 75357) | 0;
+              }
+              l = j;
+              return;
+            }
+            function yc(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 32) | 0;
+              h = (i + 16) | 0;
+              g = (i + 8) | 0;
+              f = i;
+              if (!d) {
+                c[h >> 2] = c[((RC(a, 141060, 0) | 0) + 8) >> 2];
+                uF(b, 137395, h);
+              } else {
+                h = c[e >> 2] | 0;
+                c[e >> 2] = h + 1;
+                rc(b, h);
+                oF(b, 97374) | 0;
+                rc(b, c[e >> 2] | 0);
+                c[f >> 2] = c[((RC(a, 141060, 0) | 0) + 8) >> 2];
+                uF(b, 67060, f);
+                rc(b, c[e >> 2] | 0);
+                c[g >> 2] = zc(KB(a) | 0, e) | 0;
+                uF(b, 67124, g);
+                tc(a, b, e);
+                oF(b, 153599) | 0;
+                h = ((c[e >> 2] | 0) + -1) | 0;
+                c[e >> 2] = h;
+                rc(b, h);
+                oF(b, 75357) | 0;
+              }
+              l = i;
+              return;
+            }
+            function zc(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              g = (d + 4) | 0;
+              if (a[g >> 0] | 0) b = eQ(b) | 0;
+              if (!(c[46706] | 0)) {
+                kA(186824, 1024, 0);
+                e = b;
+              } else e = b;
+              a: while (1) {
+                f = a[e >> 0] | 0;
+                switch ((f << 24) >> 24) {
+                  case 0:
+                    break a;
+                  case 34: {
+                    nA(186824, 67137) | 0;
+                    break;
+                  }
+                  case 92: {
+                    nA(186824, 96616) | 0;
+                    break;
+                  }
+                  case 47: {
+                    nA(186824, 67140) | 0;
+                    break;
+                  }
+                  case 8: {
+                    nA(186824, 67143) | 0;
+                    break;
+                  }
+                  case 12: {
+                    nA(186824, 67146) | 0;
+                    break;
+                  }
+                  case 10: {
+                    nA(186824, 67149) | 0;
+                    break;
+                  }
+                  case 13: {
+                    nA(186824, 67152) | 0;
+                    break;
+                  }
+                  case 9: {
+                    nA(186824, 67155) | 0;
+                    break;
+                  }
+                  default: {
+                    d = c[46707] | 0;
+                    if (d >>> 0 >= (c[46708] | 0) >>> 0) {
+                      lA(186824, 1) | 0;
+                      d = c[46707] | 0;
+                    }
+                    c[46707] = d + 1;
+                    a[d >> 0] = f;
+                  }
+                }
+                e = (e + 1) | 0;
+              }
+              d = c[46707] | 0;
+              if (d >>> 0 >= (c[46708] | 0) >>> 0) {
+                lA(186824, 1) | 0;
+                d = c[46707] | 0;
+              }
+              a[d >> 0] = 0;
+              d = c[46706] | 0;
+              c[46707] = d;
+              if (a[g >> 0] | 0) U1(b);
+              return d | 0;
+            }
+            function Ac(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              oc(a, b, 0, c);
+              a = OD(a) | 0;
+              while (1) {
+                if (!a) break;
+                oF(b, 97345) | 0;
+                Ac(a, b, c);
+                a = PD(a) | 0;
+              }
+              return;
+            }
+            function Bc(b) {
+              b = b | 0;
+              var c = 0;
+              c = (b + 1) | 0;
+              a: do
+                if ((a[b >> 0] | 0) == 95) {
+                  b = (((a[c >> 0] | 0) + -100) << 24) >> 24;
+                  switch (((((b & 255) >>> 2) | ((b << 6) & 255)) << 24) >> 24) {
+                    case 0: {
+                      if (!(s2(c, 67695) | 0)) {
+                        b = 1;
+                        break a;
+                      }
+                      break;
+                    }
+                    case 2: {
+                      if (!(s2(c, 67701) | 0)) {
+                        b = 1;
+                        break a;
+                      }
+                      break;
+                    }
+                    case 1: {
+                      if (!(s2(c, 67708) | 0)) {
+                        b = 1;
+                        break a;
+                      }
+                      return ((s2(c, 67722) | 0) == 0) | 0;
+                    }
+                    case 4: {
+                      if (!(s2(c, 67715) | 0)) {
+                        b = 1;
+                        break a;
+                      }
+                      b = ((s2(c, 67730) | 0) == 0) & 1;
+                      break a;
+                    }
+                    default: {
+                      b = 0;
+                      break a;
+                    }
+                  }
+                  b = 0;
+                } else b = 0;
+              while (0);
+              return b | 0;
+            }
+            function Cc(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 16) | 0;
+              f = i;
+              do
+                if (b | 0 ? a[b >> 0] | 0 : 0) {
+                  h = DH(b) | 0;
+                  if (!h) {
+                    c[f >> 2] = b;
+                    gA(0, 67186, f) | 0;
+                    break;
+                  }
+                  oF(d, 153599) | 0;
+                  g = c[e >> 2] | 0;
+                  c[e >> 2] = g + 1;
+                  rc(d, g);
+                  oF(d, 67213) | 0;
+                  g = (h + 8) | 0;
+                  b = 0;
+                  f = 0;
+                  while (1) {
+                    if ((f | 0) >= (c[h >> 2] | 0)) break;
+                    if (!b) b = 1;
+                    else oF(d, 97345) | 0;
+                    Dc(((c[g >> 2] | 0) + ((f * 80) | 0)) | 0, d, e);
+                    f = (f + 1) | 0;
+                  }
+                  c[e >> 2] = (c[e >> 2] | 0) + -1;
+                  oF(d, 153599) | 0;
+                  rc(d, c[e >> 2] | 0);
+                  oF(d, 97340) | 0;
+                  EH(h);
+                }
+              while (0);
+              l = i;
+              return;
+            }
+            function Dc(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0.0,
+                C = 0.0,
+                D = 0.0;
+              A = l;
+              l = (l + 240) | 0;
+              y = (A + 224) | 0;
+              x = (A + 216) | 0;
+              w = (A + 208) | 0;
+              v = (A + 200) | 0;
+              u = (A + 192) | 0;
+              t = (A + 184) | 0;
+              s = (A + 176) | 0;
+              r = (A + 152) | 0;
+              q = (A + 136) | 0;
+              p = (A + 128) | 0;
+              o = (A + 112) | 0;
+              n = (A + 104) | 0;
+              m = (A + 96) | 0;
+              k = (A + 88) | 0;
+              j = (A + 72) | 0;
+              i = (A + 48) | 0;
+              z = (A + 40) | 0;
+              g = (A + 8) | 0;
+              f = A;
+              e = c[d >> 2] | 0;
+              c[d >> 2] = e + 1;
+              rc(b, e);
+              oF(b, 97374) | 0;
+              rc(b, c[d >> 2] | 0);
+              e = c[a >> 2] | 0;
+              a: do
+                switch (e | 0) {
+                  case 1:
+                  case 0: {
+                    c[f >> 2] = (e | 0) == 0 ? 69 : 101;
+                    uF(b, 67216, f);
+                    rc(b, c[d >> 2] | 0);
+                    D = +h[(a + 16) >> 3];
+                    C = +h[(a + 24) >> 3];
+                    B = +h[(a + 32) >> 3];
+                    h[g >> 3] = +h[(a + 8) >> 3];
+                    h[(g + 8) >> 3] = D;
+                    h[(g + 16) >> 3] = C;
+                    h[(g + 24) >> 3] = B;
+                    uF(b, 67229, g);
+                    break;
+                  }
+                  case 3:
+                  case 2: {
+                    c[z >> 2] = (e | 0) == 2 ? 80 : 112;
+                    uF(b, 67216, z);
+                    rc(b, c[d >> 2] | 0);
+                    Ec(b, (a + 8) | 0);
+                    break;
+                  }
+                  case 5:
+                  case 4: {
+                    c[i >> 2] = (e | 0) == 4 ? 66 : 98;
+                    uF(b, 67216, i);
+                    rc(b, c[d >> 2] | 0);
+                    Ec(b, (a + 8) | 0);
+                    break;
+                  }
+                  case 6: {
+                    uF(b, 67264, (A + 56) | 0);
+                    rc(b, c[d >> 2] | 0);
+                    Ec(b, (a + 8) | 0);
+                    break;
+                  }
+                  case 7: {
+                    uF(b, 67276, (A + 64) | 0);
+                    rc(b, c[d >> 2] | 0);
+                    D = +h[(a + 16) >> 3];
+                    h[j >> 3] = +h[(a + 8) >> 3];
+                    h[(j + 8) >> 3] = D;
+                    uF(b, 67288, j);
+                    rc(b, c[d >> 2] | 0);
+                    z = c[(a + 24) >> 2] | 0;
+                    c[k >> 2] = (z | 0) == 0 ? 108 : (z | 0) == 1 ? 99 : 114;
+                    uF(b, 67310, k);
+                    rc(b, c[d >> 2] | 0);
+                    h[m >> 3] = +h[(a + 32) >> 3];
+                    uF(b, 67326, m);
+                    rc(b, c[d >> 2] | 0);
+                    c[n >> 2] = zc(c[(a + 40) >> 2] | 0, d) | 0;
+                    uF(b, 67343, n);
+                    break;
+                  }
+                  case 9:
+                  case 8: {
+                    c[o >> 2] = (e | 0) == 8 ? 67 : 99;
+                    uF(b, 67216, o);
+                    rc(b, c[d >> 2] | 0);
+                    uF(b, 67357, (A + 120) | 0);
+                    rc(b, c[d >> 2] | 0);
+                    c[p >> 2] = zc(c[(a + 8) >> 2] | 0, d) | 0;
+                    uF(b, 67374, p);
+                    break;
+                  }
+                  case 13:
+                  case 14: {
+                    c[q >> 2] = (e | 0) == 13 ? 67 : 99;
+                    uF(b, 67216, q);
+                    rc(b, c[d >> 2] | 0);
+                    switch (c[(a + 8) >> 2] | 0) {
+                      case 0: {
+                        uF(b, 67357, (A + 144) | 0);
+                        rc(b, c[d >> 2] | 0);
+                        c[r >> 2] = zc(c[(a + 16) >> 2] | 0, d) | 0;
+                        uF(b, 67374, r);
+                        break a;
+                      }
+                      case 1: {
+                        uF(b, 67389, (A + 160) | 0);
+                        rc(b, c[d >> 2] | 0);
+                        Fc(b, (a + 16) | 0, d);
+                        break a;
+                      }
+                      default: {
+                        uF(b, 67408, (A + 168) | 0);
+                        rc(b, c[d >> 2] | 0);
+                        Gc(b, (a + 16) | 0, d);
+                        break a;
+                      }
+                    }
+                  }
+                  case 10: {
+                    uF(b, 67427, s);
+                    rc(b, c[d >> 2] | 0);
+                    h[t >> 3] = +h[(a + 8) >> 3];
+                    uF(b, 67439, t);
+                    rc(b, c[d >> 2] | 0);
+                    c[u >> 2] = zc(c[(a + 16) >> 2] | 0, d) | 0;
+                    uF(b, 67455, u);
+                    break;
+                  }
+                  case 11: {
+                    uF(b, 67469, v);
+                    rc(b, c[d >> 2] | 0);
+                    c[w >> 2] = zc(c[(a + 8) >> 2] | 0, d) | 0;
+                    uF(b, 67481, w);
+                    break;
+                  }
+                  case 15: {
+                    uF(b, 67496, x);
+                    rc(b, c[d >> 2] | 0);
+                    c[y >> 2] = c[(a + 8) >> 2];
+                    uF(b, 67508, y);
+                    break;
+                  }
+                  default: {
+                  }
+                }
+              while (0);
+              z = ((c[d >> 2] | 0) + -1) | 0;
+              c[d >> 2] = z;
+              rc(b, z);
+              oF(b, 75357) | 0;
+              l = A;
+              return;
+            }
+            function Ec(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0.0;
+              j = l;
+              l = (l + 48) | 0;
+              i = (j + 32) | 0;
+              g = (j + 16) | 0;
+              f = (j + 8) | 0;
+              e = c[b >> 2] | 0;
+              d = c[(b + 4) >> 2] | 0;
+              uF(a, 67669, j);
+              b = 0;
+              while (1) {
+                if ((b | 0) >= (e | 0)) break;
+                if ((b | 0) > 0) uF(a, 100999, f);
+                k = +h[(d + ((b * 24) | 0) + 8) >> 3];
+                h[g >> 3] = +h[(d + ((b * 24) | 0)) >> 3];
+                h[(g + 8) >> 3] = k;
+                uF(a, 67681, g);
+                b = (b + 1) | 0;
+              }
+              uF(a, 67622, i);
+              l = j;
+              return;
+            }
+            function Fc(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0;
+              e = l;
+              l = (l + 32) | 0;
+              f = (e + 16) | 0;
+              i = e;
+              rc(a, c[d >> 2] | 0);
+              g = +h[(b + 8) >> 3];
+              h[i >> 3] = +h[b >> 3];
+              h[(i + 8) >> 3] = g;
+              uF(a, 67625, i);
+              rc(a, c[d >> 2] | 0);
+              g = +h[(b + 24) >> 3];
+              h[f >> 3] = +h[(b + 16) >> 3];
+              h[(f + 8) >> 3] = g;
+              uF(a, 67647, f);
+              rc(a, c[d >> 2] | 0);
+              Hc(a, c[(b + 32) >> 2] | 0, c[(b + 36) >> 2] | 0, d);
+              l = e;
+              return;
+            }
+            function Gc(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0;
+              e = l;
+              l = (l + 48) | 0;
+              f = (e + 24) | 0;
+              j = e;
+              rc(a, c[d >> 2] | 0);
+              g = +h[(b + 8) >> 3];
+              i = +h[(b + 16) >> 3];
+              h[j >> 3] = +h[b >> 3];
+              h[(j + 8) >> 3] = g;
+              h[(j + 16) >> 3] = i;
+              uF(a, 67524, j);
+              rc(a, c[d >> 2] | 0);
+              i = +h[(b + 32) >> 3];
+              g = +h[(b + 40) >> 3];
+              h[f >> 3] = +h[(b + 24) >> 3];
+              h[(f + 8) >> 3] = i;
+              h[(f + 16) >> 3] = g;
+              uF(a, 67552, f);
+              rc(a, c[d >> 2] | 0);
+              Hc(a, c[(b + 48) >> 2] | 0, c[(b + 52) >> 2] | 0, d);
+              l = e;
+              return;
+            }
+            function Hc(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0.0;
+              m = l;
+              l = (l + 48) | 0;
+              k = (m + 32) | 0;
+              j = (m + 16) | 0;
+              i = (m + 8) | 0;
+              uF(a, 67580, m);
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (b | 0)) break;
+                if ((f | 0) > 0) uF(a, 100999, i);
+                o = +g[(d + (f << 3)) >> 2];
+                n = zc(c[(d + (f << 3) + 4) >> 2] | 0, e) | 0;
+                h[j >> 3] = o;
+                c[(j + 8) >> 2] = n;
+                uF(a, 67591, j);
+                f = (f + 1) | 0;
+              }
+              uF(a, 67622, k);
+              l = m;
+              return;
+            }
+            function Ic(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              g = l;
+              l = (l + 16) | 0;
+              f = g;
+              e = nb[c[a >> 2] & 63](a, b, 512) | 0;
+              if (e) {
+                if ((c[(e + 12) >> 2] | 0) != (d | 0)) {
+                  c[f >> 2] = b;
+                  gA(0, 67768, f) | 0;
+                }
+              } else {
+                f = V1(1, 16) | 0;
+                c[(f + 8) >> 2] = D4(b) | 0;
+                c[(f + 12) >> 2] = d;
+                nb[c[a >> 2] & 63](a, f, 1) | 0;
+              }
+              l = g;
+              return;
+            }
+            function Jc(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              U1(c[(b + 8) >> 2] | 0);
+              U1(b);
+              return;
+            }
+            function Kc(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              b = l;
+              l = (l + 32) | 0;
+              d = (b + 24) | 0;
+              e = (b + 16) | 0;
+              g = b;
+              f = c[(a + 16) >> 2] | 0;
+              oF(a, 68623) | 0;
+              j = c[c[(a + 12) >> 2] >> 2] | 0;
+              i = c[(j + 4) >> 2] | 0;
+              h = c[(j + 8) >> 2] | 0;
+              c[g >> 2] = c[j >> 2];
+              c[(g + 4) >> 2] = i;
+              c[(g + 8) >> 2] = h;
+              uF(a, 68633, g);
+              c[e >> 2] = KB(c[(f + 8) >> 2] | 0) | 0;
+              uF(a, 68668, e);
+              c[d >> 2] = O(c[(a + 168) >> 2] | 0, c[(a + 164) >> 2] | 0) | 0;
+              uF(a, 68681, d);
+              oF(a, 68694) | 0;
+              oF(a, 68704) | 0;
+              oF(a, 68712) | 0;
+              oF(a, 68720) | 0;
+              oF(a, 68728) | 0;
+              oF(a, 68736) | 0;
+              oF(a, 68744) | 0;
+              oF(a, 68748) | 0;
+              oF(a, 68753) | 0;
+              l = b;
+              return;
+            }
+            function Lc(a) {
+              a = a | 0;
+              oF(a, 68604) | 0;
+              return;
+            }
+            function Mc(a) {
+              a = a | 0;
+              c[46710] = 2;
+              return;
+            }
+            function Nc(a) {
+              a = a | 0;
+              c[46710] = 1;
+              return;
+            }
+            function Oc(a) {
+              a = a | 0;
+              c[46710] = 2;
+              return;
+            }
+            function Pc(a) {
+              a = a | 0;
+              c[46710] = 0;
+              return;
+            }
+            function Qc(a) {
+              a = a | 0;
+              c[46710] = 2;
+              return;
+            }
+            function Rc(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0.0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0.0,
+                r = 0.0,
+                s = 0;
+              p = l;
+              l = (l + 80) | 0;
+              o = p;
+              m = c[((c[(b + 16) >> 2] | 0) + 16) >> 2] | 0;
+              n = c[46710] | 0;
+              f = c[(e + 4) >> 2] | 0;
+              g = +h[(b + 352) >> 3] * +h[(f + 16) >> 3];
+              i = c[(b + 360) >> 2] | 0 ? 1.5707963267948966 : 0.0;
+              j = c[e >> 2] | 0;
+              k = g * 0.3333333333333333 * +((l2(j) | 0) >>> 0);
+              f = c[(f + 8) >> 2] | 0;
+              if (!f) f = -1;
+              else f = c[(f + 20) >> 2] | 0;
+              s = a[(e + 48) >> 0] | 0;
+              r = +h[d >> 3];
+              q = +h[(d + 8) >> 3];
+              e = $c(j) | 0;
+              c[o >> 2] = 4;
+              c[(o + 4) >> 2] = (s << 24) >> 24 == 108 ? 0 : (s << 24) >> 24 == 114 ? 2 : 1;
+              c[(o + 8) >> 2] = m;
+              c[(o + 12) >> 2] = n;
+              c[(o + 16) >> 2] = 0;
+              c[(o + 20) >> 2] = f;
+              h[(o + 24) >> 3] = g;
+              h[(o + 32) >> 3] = i;
+              c[(o + 40) >> 2] = 6;
+              h[(o + 48) >> 3] = g;
+              h[(o + 56) >> 3] = k;
+              c[(o + 64) >> 2] = ~~(r + (r >= 0.0 ? 0.5 : -0.5));
+              c[(o + 68) >> 2] = ~~(q + (q + -72.0 >= 0.0 ? -71.5 : -72.5));
+              c[(o + 72) >> 2] = e;
+              uF(b, 68549, o);
+              l = p;
+              return;
+            }
+            function Sc(b, e) {
+              b = b | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              n = l;
+              l = (l + 32) | 0;
+              j = n;
+              i = (n + 20) | 0;
+              m = (e + 32) | 0;
+              a: do
+                switch (c[m >> 2] | 0) {
+                  case 5: {
+                    f = 0;
+                    while (1) {
+                      g = c[(12724 + (f << 2)) >> 2] | 0;
+                      if ((f | 0) == 8) break a;
+                      h = c[e >> 2] | 0;
+                      if ((a[g >> 0] | 0) == (a[h >> 0] | 0) ? (s2(g, h) | 0) == 0 : 0) {
+                        k = 10;
+                        break a;
+                      }
+                      f = (f + 1) | 0;
+                    }
+                  }
+                  case 1: {
+                    g = (e + 1) | 0;
+                    h = (e + 2) | 0;
+                    f = ((_c(i, d[e >> 0] | 0, d[g >> 0] | 0, d[h >> 0] | 0) | 0) + 32) | 0;
+                    if (!(c[i >> 2] | 0)) k = 10;
+                    else {
+                      o = d[e >> 0] | 0;
+                      i = d[g >> 0] | 0;
+                      k = d[h >> 0] | 0;
+                      c[j >> 2] = 0;
+                      c[(j + 4) >> 2] = f;
+                      c[(j + 8) >> 2] = o;
+                      c[(j + 12) >> 2] = i;
+                      c[(j + 16) >> 2] = k;
+                      uF(b, 68492, j);
+                      k = 10;
+                    }
+                    break;
+                  }
+                  default:
+                    qa(138394, 67889, 163, 67920);
+                }
+              while (0);
+              if ((k | 0) == 10) c[e >> 2] = f;
+              c[m >> 2] = 6;
+              l = n;
+              return;
+            }
+            function Tc(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0;
+              e = l;
+              l = (l + 112) | 0;
+              f = (e + 8) | 0;
+              u = (e + 104) | 0;
+              t = e;
+              k = c[(a + 16) >> 2] | 0;
+              s = ~~+h[(k + 152) >> 3];
+              r = c[(k + 16) >> 2] | 0;
+              q = c[(k + 56) >> 2] | 0;
+              p = c[46710] | 0;
+              Yc(k, u, t);
+              n = +h[b >> 3];
+              k = ~~(n + (n >= 0.0 ? 0.5 : -0.5));
+              m = +h[(b + 8) >> 3];
+              j = ~~(m + (m >= 0.0 ? 0.5 : -0.5));
+              i = +h[(b + 16) >> 3];
+              n = i - n;
+              g = +h[(b + 24) >> 3];
+              m = g - m;
+              b = c[u >> 2] | 0;
+              o = +h[t >> 3];
+              c[f >> 2] = 1;
+              c[(f + 4) >> 2] = 1;
+              c[(f + 8) >> 2] = b;
+              c[(f + 12) >> 2] = s;
+              c[(f + 16) >> 2] = r;
+              c[(f + 20) >> 2] = q;
+              c[(f + 24) >> 2] = p;
+              c[(f + 28) >> 2] = 0;
+              c[(f + 32) >> 2] = d | 0 ? 20 : -1;
+              h[(f + 40) >> 3] = o;
+              c[(f + 48) >> 2] = 0;
+              h[(f + 56) >> 3] = 0.0;
+              c[(f + 64) >> 2] = k;
+              c[(f + 68) >> 2] = j;
+              c[(f + 72) >> 2] = ~~(n + (n >= 0.0 ? 0.5 : -0.5));
+              c[(f + 76) >> 2] = ~~(m + (m >= 0.0 ? 0.5 : -0.5));
+              c[(f + 80) >> 2] = k;
+              c[(f + 84) >> 2] = j;
+              c[(f + 88) >> 2] = ~~(i + (i >= 0.0 ? 0.5 : -0.5));
+              c[(f + 92) >> 2] = ~~(g + (g >= 0.0 ? 0.5 : -0.5));
+              uF(a, 68427, f);
+              l = e;
+              return;
+            }
+            function Uc(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              f = l;
+              l = (l + 96) | 0;
+              g = (f + 8) | 0;
+              o = (f + 80) | 0;
+              p = f;
+              q = c[(a + 16) >> 2] | 0;
+              n = ~~+h[(q + 152) >> 3];
+              m = c[(q + 16) >> 2] | 0;
+              k = c[(q + 56) >> 2] | 0;
+              j = c[46710] | 0;
+              Yc(q, o, p);
+              o = c[o >> 2] | 0;
+              i = +h[p >> 3];
+              c[g >> 2] = 2;
+              c[(g + 4) >> 2] = 3;
+              c[(g + 8) >> 2] = o;
+              c[(g + 12) >> 2] = n;
+              c[(g + 16) >> 2] = m;
+              c[(g + 20) >> 2] = k;
+              c[(g + 24) >> 2] = j;
+              c[(g + 28) >> 2] = 0;
+              c[(g + 32) >> 2] = e | 0 ? 20 : -1;
+              h[(g + 40) >> 3] = i;
+              c[(g + 48) >> 2] = 0;
+              c[(g + 52) >> 2] = 0;
+              c[(g + 56) >> 2] = 0;
+              c[(g + 60) >> 2] = 0;
+              c[(g + 64) >> 2] = 0;
+              c[(g + 68) >> 2] = d + 1;
+              uF(a, 68331, g);
+              Zc(a, b, d, 1);
+              l = f;
+              return;
+            }
+            function Vc(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0.0,
+                E = 0.0,
+                F = 0;
+              C = l;
+              l = (l + 192) | 0;
+              B = (C + 176) | 0;
+              z = (C + 168) | 0;
+              A = (C + 104) | 0;
+              y = (C + 96) | 0;
+              i = (C + 88) | 0;
+              u = (C + 180) | 0;
+              v = (C + 80) | 0;
+              w = (C + 16) | 0;
+              x = C;
+              f = (a + 16) | 0;
+              e = c[f >> 2] | 0;
+              q = ~~+h[(e + 152) >> 3];
+              r = c[(e + 16) >> 2] | 0;
+              s = c[46710] | 0;
+              if ((d | 0) <= 3) qa(67882, 67889, 360, 67909);
+              t = T1((((d * 140) | 0) + 140) | 0) | 0;
+              Yc(e, u, v);
+              if (!g) {
+                o = 4;
+                j = 0;
+                k = -1;
+              } else {
+                o = 5;
+                j = c[((c[f >> 2] | 0) + 56) >> 2] | 0;
+                k = 20;
+              }
+              E = +h[b >> 3];
+              n = (w + 48) | 0;
+              h[n >> 3] = E;
+              D = +h[(b + 8) >> 3];
+              h[(w + 56) >> 3] = D;
+              c[i >> 2] = ~~(E + (E >= 0.0 ? 0.5 : -0.5));
+              c[(i + 4) >> 2] = ~~(D + (D >= 0.0 ? 0.5 : -0.5));
+              m = (x + 8) | 0;
+              e = (t + (m4(t, 81099, i) | 0)) | 0;
+              p = 1;
+              g = 0;
+              while (1) {
+                i = (g + 3) | 0;
+                if ((i | 0) >= (d | 0)) break;
+                c[w >> 2] = c[n >> 2];
+                c[(w + 4) >> 2] = c[(n + 4) >> 2];
+                c[(w + 8) >> 2] = c[(n + 8) >> 2];
+                c[(w + 12) >> 2] = c[(n + 12) >> 2];
+                f = 1;
+                while (1) {
+                  if ((f | 0) == 4) {
+                    f = 1;
+                    break;
+                  }
+                  F = (f + g) | 0;
+                  h[(w + (f << 4)) >> 3] = +h[(b + (F << 4)) >> 3];
+                  h[(w + (f << 4) + 8) >> 3] = +h[(b + (F << 4) + 8) >> 3];
+                  f = (f + 1) | 0;
+                }
+                while (1) {
+                  if ((f | 0) == 7) break;
+                  kP(x, w, 3, +(f | 0) * 0.16666666666666666, 0, 0);
+                  D = +h[x >> 3];
+                  E = +h[m >> 3];
+                  c[y >> 2] = ~~(D + (D >= 0.0 ? 0.5 : -0.5));
+                  c[(y + 4) >> 2] = ~~(E + (E >= 0.0 ? 0.5 : -0.5));
+                  f = (f + 1) | 0;
+                  e = (e + (m4(e, 81099, y) | 0)) | 0;
+                }
+                p = (p + 6) | 0;
+                g = i;
+              }
+              f = c[u >> 2] | 0;
+              E = +h[v >> 3];
+              c[A >> 2] = 3;
+              c[(A + 4) >> 2] = o;
+              c[(A + 8) >> 2] = f;
+              c[(A + 12) >> 2] = q;
+              c[(A + 16) >> 2] = r;
+              c[(A + 20) >> 2] = j;
+              c[(A + 24) >> 2] = s;
+              c[(A + 28) >> 2] = 0;
+              c[(A + 32) >> 2] = k;
+              h[(A + 40) >> 3] = E;
+              c[(A + 48) >> 2] = 0;
+              c[(A + 52) >> 2] = 0;
+              c[(A + 56) >> 2] = 0;
+              c[(A + 60) >> 2] = p;
+              uF(a, 68382, A);
+              c[z >> 2] = t;
+              uF(a, 81106, z);
+              U1(t);
+              f = (p + -1) | 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (p | 0)) break;
+                c[B >> 2] = (((e | 0) % (f | 0) | 0 | 0) != 0) & 1;
+                uF(a, 81111, B);
+                e = (e + 1) | 0;
+              }
+              oF(a, 153599) | 0;
+              l = C;
+              return;
+            }
+            function Wc(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              e = l;
+              l = (l + 96) | 0;
+              f = (e + 8) | 0;
+              m = (e + 80) | 0;
+              n = e;
+              o = c[(a + 16) >> 2] | 0;
+              k = ~~+h[(o + 152) >> 3];
+              j = c[(o + 16) >> 2] | 0;
+              i = c[46710] | 0;
+              Yc(o, m, n);
+              m = c[m >> 2] | 0;
+              g = +h[n >> 3];
+              c[f >> 2] = 2;
+              c[(f + 4) >> 2] = 1;
+              c[(f + 8) >> 2] = m;
+              c[(f + 12) >> 2] = k;
+              c[(f + 16) >> 2] = j;
+              c[(f + 20) >> 2] = 0;
+              c[(f + 24) >> 2] = i;
+              c[(f + 28) >> 2] = 0;
+              c[(f + 32) >> 2] = 0;
+              h[(f + 40) >> 3] = g;
+              c[(f + 48) >> 2] = 0;
+              c[(f + 52) >> 2] = 0;
+              c[(f + 56) >> 2] = 0;
+              c[(f + 60) >> 2] = 0;
+              c[(f + 64) >> 2] = 0;
+              c[(f + 68) >> 2] = d;
+              uF(a, 68331, f);
+              Zc(a, b, d, 0);
+              l = e;
+              return;
+            }
+            function Xc(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = l;
+              l = (l + 16) | 0;
+              e = d;
+              c[e >> 2] = b;
+              uF(a, 68325, e);
+              l = d;
+              return;
+            }
+            function Yc(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0;
+              switch (c[(a + 144) >> 2] | 0) {
+                case 1: {
+                  e = 10.0;
+                  a = 1;
+                  break;
+                }
+                case 2: {
+                  e = 10.0;
+                  a = 2;
+                  break;
+                }
+                default: {
+                  e = 0.0;
+                  a = 0;
+                }
+              }
+              c[b >> 2] = a;
+              h[d >> 3] = e;
+              return;
+            }
+            function Zc(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0.0,
+                m = 0.0;
+              j = l;
+              l = (l + 16) | 0;
+              i = (j + 8) | 0;
+              g = j;
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (d | 0)) break;
+                m = +h[(b + (f << 4)) >> 3];
+                k = +h[(b + (f << 4) + 8) >> 3];
+                c[g >> 2] = ~~(m + (m >= 0.0 ? 0.5 : -0.5));
+                c[(g + 4) >> 2] = ~~(k + (k >= 0.0 ? 0.5 : -0.5));
+                uF(a, 81099, g);
+                f = (f + 1) | 0;
+              }
+              if (e | 0) {
+                k = +h[b >> 3];
+                m = +h[(b + 8) >> 3];
+                c[i >> 2] = ~~(k + (k >= 0.0 ? 0.5 : -0.5));
+                c[(i + 4) >> 2] = ~~(m + (m >= 0.0 ? 0.5 : -0.5));
+                uF(a, 81099, i);
+              }
+              oF(a, 153599) | 0;
+              l = j;
+              return;
+            }
+            function _c(a, d, e, f) {
+              a = a | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0;
+              c[a >> 2] = 0;
+              k = c[46711] | 0;
+              h = 195075;
+              g = 0;
+              i = -1;
+              while (1) {
+                if ((g | 0) >= (k | 0)) {
+                  l = 6;
+                  break;
+                }
+                m = ((b[(190680 + (g << 1)) >> 1] | 0) - d) | 0;
+                n = ((b[(191192 + (g << 1)) >> 1] | 0) - e) | 0;
+                j = ((b[(191704 + (g << 1)) >> 1] | 0) - f) | 0;
+                j = ((O(n, n) | 0) + (O(m, m) | 0) + (O(j, j) | 0)) | 0;
+                if ((j | 0) < (h | 0))
+                  if (!j) break;
+                  else {
+                    h = j;
+                    i = g;
+                  }
+                g = (g + 1) | 0;
+              }
+              if ((l | 0) == 6) {
+                c[46711] = k + 1;
+                if ((k | 0) == 256) g = i;
+                else {
+                  b[(190680 + (g << 1)) >> 1] = d;
+                  b[(191192 + (g << 1)) >> 1] = e;
+                  b[(191704 + (g << 1)) >> 1] = f;
+                  c[a >> 2] = 1;
+                }
+              }
+              return g | 0;
+            }
+            function $c(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 16) | 0;
+              h = i;
+              d = c[46712] | 0;
+              if (!d) {
+                c[46713] = 64;
+                d = T1(64) | 0;
+                c[46712] = d;
+                e = 0;
+              } else e = 0;
+              while (1) {
+                g = (b + 1) | 0;
+                f = a[b >> 0] | 0;
+                if (!((f << 24) >> 24)) break;
+                b = c[46713] | 0;
+                if ((e | 0) > ((b + -8) | 0)) {
+                  d = b << 1;
+                  c[46713] = d;
+                  d = W1(c[46712] | 0, d) | 0;
+                  c[46712] = d;
+                  d = (d + e) | 0;
+                }
+                if ((f << 24) >> 24 <= -1) {
+                  a[d >> 0] = 92;
+                  c[h >> 2] = f & 255;
+                  m4((d + 1) | 0, 81224, h) | 0;
+                  b = g;
+                  d = (d + 4) | 0;
+                  e = (e + 4) | 0;
+                  continue;
+                }
+                if ((f << 24) >> 24 == 92) {
+                  a[d >> 0] = 92;
+                  e = (e + 1) | 0;
+                  d = (d + 1) | 0;
+                }
+                a[d >> 0] = f;
+                b = g;
+                d = (d + 1) | 0;
+                e = (e + 1) | 0;
+              }
+              a[d >> 0] = 0;
+              l = i;
+              return c[46712] | 0;
+            }
+            function ad(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              e = c[(b + 16) >> 2] | 0;
+              switch (c[(b + 64) >> 2] | 0) {
+                case 0: {
+                  oF(b, 68220) | 0;
+                  d = (e + 208) | 0;
+                  e = c[d >> 2] | 0;
+                  if (e | 0 ? a[e >> 0] | 0 : 0) {
+                    oF(b, 68234) | 0;
+                    oF(b, FK(c[d >> 2] | 0) | 0) | 0;
+                    oF(b, 153599) | 0;
+                  }
+                  break;
+                }
+                case 1: {
+                  d = (e + 208) | 0;
+                  f = c[d >> 2] | 0;
+                  if (f | 0 ? a[f >> 0] | 0 : 0) {
+                    oF(b, 68234) | 0;
+                    oF(b, FK(c[d >> 2] | 0) | 0) | 0;
+                    oF(b, 102604) | 0;
+                    oF(b, FK(KB(c[(e + 8) >> 2] | 0) | 0) | 0) | 0;
+                    oF(b, 153599) | 0;
+                  }
+                  break;
+                }
+                case 3: {
+                  f = FK(KB(c[(e + 8) >> 2] | 0) | 0) | 0;
+                  oF(b, 68243) | 0;
+                  oF(b, f) | 0;
+                  oF(b, 68253) | 0;
+                  oF(b, f) | 0;
+                  oF(b, 68208) | 0;
+                  break;
+                }
+                default: {
+                }
+              }
+              return;
+            }
+            function bd(a) {
+              a = a | 0;
+              var b = 0;
+              b = c[(a + 16) >> 2] | 0;
+              switch (c[(a + 64) >> 2] | 0) {
+                case 2: {
+                  dd(
+                    a,
+                    c[(b + 264) >> 2] | 0,
+                    c[(b + 272) >> 2] | 0,
+                    c[(b + 268) >> 2] | 0,
+                    c[(b + 208) >> 2] | 0,
+                    c[(b + 228) >> 2] | 0,
+                    c[(b + 244) >> 2] | 0,
+                    c[(b + 212) >> 2] | 0
+                  );
+                  break;
+                }
+                case 3: {
+                  dd(
+                    a,
+                    c[(b + 264) >> 2] | 0,
+                    c[(b + 272) >> 2] | 0,
+                    c[(b + 268) >> 2] | 0,
+                    c[(b + 208) >> 2] | 0,
+                    c[(b + 228) >> 2] | 0,
+                    c[(b + 244) >> 2] | 0,
+                    c[(b + 212) >> 2] | 0
+                  );
+                  oF(a, 68212) | 0;
+                  break;
+                }
+                default: {
+                }
+              }
+              return;
+            }
+            function cd(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0;
+              g = c[(a + 16) >> 2] | 0;
+              dd(a, c[(g + 264) >> 2] | 0, c[(g + 272) >> 2] | 0, c[(g + 268) >> 2] | 0, b, d, e, f);
+              return;
+            }
+            function dd(b, d, e, f, g, i, j, k) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              j = j | 0;
+              k = k | 0;
+              var m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0.0;
+              y = l;
+              l = (l + 128) | 0;
+              x = (y + 120) | 0;
+              u = (y + 112) | 0;
+              t = (y + 96) | 0;
+              s = (y + 80) | 0;
+              r = (y + 56) | 0;
+              w = (y + 48) | 0;
+              q = (y + 40) | 0;
+              v = (y + 24) | 0;
+              p = y;
+              a: do
+                if (((e | 0) != 0) & ((f | 0) != 0)) {
+                  m = (f + 10) | 0;
+                  if ((c[46714] | 0) < (f | 0)) {
+                    c[46714] = m;
+                    o = W1(c[46715] | 0, m << 3) | 0;
+                    c[46715] = o;
+                  } else o = c[46715] | 0;
+                  m = 0;
+                  while (1) {
+                    if ((m | 0) >= (f | 0)) break;
+                    z = +h[(e + (m << 4)) >> 3];
+                    c[(o + (m << 3)) >> 2] = ~~(z + (z >= 0.0 ? 0.5 : -0.5));
+                    z = +h[(e + (m << 4) + 8) >> 3];
+                    c[(o + (m << 3) + 4) >> 2] = ~~(z + (z >= 0.0 ? 0.5 : -0.5));
+                    m = (m + 1) | 0;
+                  }
+                  n = (b + 64) | 0;
+                  m = c[n >> 2] | 0;
+                  e = (g | 0) != 0;
+                  if (e & ((m | 0) == 0)) {
+                    if (!(a[g >> 0] | 0)) break;
+                    switch (d | 0) {
+                      case 0: {
+                        v = c[o >> 2] | 0;
+                        w = c[(o + 12) >> 2] | 0;
+                        x = c[(o + 8) >> 2] | 0;
+                        f = c[(o + 4) >> 2] | 0;
+                        c[p >> 2] = g;
+                        c[(p + 4) >> 2] = v;
+                        c[(p + 8) >> 2] = w;
+                        c[(p + 12) >> 2] = x;
+                        c[(p + 16) >> 2] = f;
+                        uF(b, 67954, p);
+                        break a;
+                      }
+                      case 1: {
+                        w = c[o >> 2] | 0;
+                        x = c[(o + 4) >> 2] | 0;
+                        f = ((c[(o + 8) >> 2] | 0) - w) | 0;
+                        c[v >> 2] = g;
+                        c[(v + 4) >> 2] = w;
+                        c[(v + 8) >> 2] = x;
+                        c[(v + 12) >> 2] = f;
+                        uF(b, 67975, v);
+                        break a;
+                      }
+                      case 2: {
+                        c[q >> 2] = g;
+                        uF(b, 67995, q);
+                        m = 0;
+                        while (1) {
+                          if ((m | 0) >= (f | 0)) break;
+                          v = c[46715] | 0;
+                          x = c[(v + (m << 3) + 4) >> 2] | 0;
+                          c[w >> 2] = c[(v + (m << 3)) >> 2];
+                          c[(w + 4) >> 2] = x;
+                          uF(b, 68003, w);
+                          m = (m + 1) | 0;
+                        }
+                        oF(b, 153599) | 0;
+                        break a;
+                      }
+                      default:
+                        qa(138394, 68010, 63, 68030);
+                    }
+                  }
+                  if (e & ((m | 0) == 1)) {
+                    if (!(a[g >> 0] | 0)) break;
+                    if (!d) {
+                      w = c[(o + 12) >> 2] | 0;
+                      x = c[(o + 8) >> 2] | 0;
+                      f = c[(o + 4) >> 2] | 0;
+                      c[r >> 2] = c[o >> 2];
+                      c[(r + 4) >> 2] = w;
+                      c[(r + 8) >> 2] = x;
+                      c[(r + 12) >> 2] = f;
+                      c[(r + 16) >> 2] = g;
+                      c[(r + 20) >> 2] = i;
+                      uF(b, 68047, r);
+                      break;
+                    } else qa(138394, 68010, 75, 68030);
+                  }
+                  if (((m & -2) | 0) == 2) {
+                    switch (d | 0) {
+                      case 1: {
+                        oF(b, 68080) | 0;
+                        break;
+                      }
+                      case 0: {
+                        oF(b, 68101) | 0;
+                        break;
+                      }
+                      case 2: {
+                        oF(b, 68120) | 0;
+                        break;
+                      }
+                      default:
+                        qa(138394, 68010, 91, 68030);
+                    }
+                    if (k | 0 ? a[k >> 0] | 0 : 0) {
+                      oF(b, 73600) | 0;
+                      oF(b, IK(k) | 0) | 0;
+                      oF(b, 98744) | 0;
+                    }
+                    if (e ? a[g >> 0] | 0 : 0) {
+                      oF(b, 68139) | 0;
+                      oF(b, IK(g) | 0) | 0;
+                      oF(b, 98744) | 0;
+                    }
+                    if (j | 0 ? a[j >> 0] | 0 : 0) {
+                      oF(b, 74559) | 0;
+                      oF(b, FK(j) | 0) | 0;
+                      oF(b, 98744) | 0;
+                    }
+                    if (i | 0 ? a[i >> 0] | 0 : 0) {
+                      oF(b, 68147) | 0;
+                      oF(b, FK(i) | 0) | 0;
+                      oF(b, 98744) | 0;
+                    }
+                    oF(b, 68156) | 0;
+                    oF(b, 68164) | 0;
+                    b: do
+                      switch (d | 0) {
+                        case 1: {
+                          f = c[46715] | 0;
+                          w = c[f >> 2] | 0;
+                          x = c[(f + 4) >> 2] | 0;
+                          f = ((c[(f + 8) >> 2] | 0) - w) | 0;
+                          c[s >> 2] = w;
+                          c[(s + 4) >> 2] = x;
+                          c[(s + 8) >> 2] = f;
+                          uF(b, 68174, s);
+                          break;
+                        }
+                        case 0: {
+                          v = c[46715] | 0;
+                          w = c[(v + 12) >> 2] | 0;
+                          x = c[(v + 8) >> 2] | 0;
+                          f = c[(v + 4) >> 2] | 0;
+                          c[t >> 2] = c[v >> 2];
+                          c[(t + 4) >> 2] = w;
+                          c[(t + 8) >> 2] = x;
+                          c[(t + 12) >> 2] = f;
+                          uF(b, 68183, t);
+                          break;
+                        }
+                        case 2: {
+                          w = c[46715] | 0;
+                          m = c[(w + 4) >> 2] | 0;
+                          c[u >> 2] = c[w >> 2];
+                          c[(u + 4) >> 2] = m;
+                          uF(b, 68195, u);
+                          m = 1;
+                          while (1) {
+                            if ((m | 0) >= (f | 0)) break b;
+                            v = c[46715] | 0;
+                            w = c[(v + (m << 3) + 4) >> 2] | 0;
+                            c[x >> 2] = c[(v + (m << 3)) >> 2];
+                            c[(x + 4) >> 2] = w;
+                            uF(b, 68201, x);
+                            m = (m + 1) | 0;
+                          }
+                        }
+                        default: {
+                        }
+                      }
+                    while (0);
+                    if ((c[n >> 2] | 0) == 3) {
+                      oF(b, 73424) | 0;
+                      break;
+                    } else {
+                      oF(b, 68208) | 0;
+                      break;
+                    }
+                  }
+                }
+              while (0);
+              l = y;
+              return;
+            }
+            function ed(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              b = l;
+              l = (l + 32) | 0;
+              d = (b + 24) | 0;
+              e = (b + 16) | 0;
+              g = b;
+              f = c[(a + 16) >> 2] | 0;
+              oF(a, 68623) | 0;
+              j = c[c[(a + 12) >> 2] >> 2] | 0;
+              i = c[(j + 4) >> 2] | 0;
+              h = c[(j + 8) >> 2] | 0;
+              c[g >> 2] = c[j >> 2];
+              c[(g + 4) >> 2] = i;
+              c[(g + 8) >> 2] = h;
+              uF(a, 68633, g);
+              c[e >> 2] = KB(c[(f + 8) >> 2] | 0) | 0;
+              uF(a, 68668, e);
+              c[d >> 2] = O(c[(a + 168) >> 2] | 0, c[(a + 164) >> 2] | 0) | 0;
+              uF(a, 68681, d);
+              oF(a, 68694) | 0;
+              oF(a, 68704) | 0;
+              oF(a, 68712) | 0;
+              oF(a, 68720) | 0;
+              oF(a, 68728) | 0;
+              oF(a, 68736) | 0;
+              oF(a, 68744) | 0;
+              oF(a, 68748) | 0;
+              oF(a, 68753) | 0;
+              l = b;
+              return;
+            }
+            function fd(a) {
+              a = a | 0;
+              oF(a, 68604) | 0;
+              return;
+            }
+            function gd(a) {
+              a = a | 0;
+              c[46716] = 2;
+              return;
+            }
+            function hd(a) {
+              a = a | 0;
+              c[46716] = 1;
+              return;
+            }
+            function id(a) {
+              a = a | 0;
+              c[46716] = 2;
+              return;
+            }
+            function jd(a) {
+              a = a | 0;
+              c[46716] = 0;
+              return;
+            }
+            function kd(a) {
+              a = a | 0;
+              c[46716] = 2;
+              return;
+            }
+            function ld(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0.0,
+                q = 0;
+              n = l;
+              l = (l + 80) | 0;
+              m = n;
+              j = c[((c[(b + 16) >> 2] | 0) + 16) >> 2] | 0;
+              k = c[46716] | 0;
+              f = c[(e + 4) >> 2] | 0;
+              g = +h[(b + 352) >> 3] * +h[(f + 16) >> 3];
+              i = c[(b + 360) >> 2] | 0 ? 1.5707963267948966 : 0.0;
+              f = c[(f + 8) >> 2] | 0;
+              if (!f) f = -1;
+              else f = c[(f + 20) >> 2] | 0;
+              q = a[(e + 48) >> 0] | 0;
+              p = +h[d >> 3];
+              o = +h[(d + 8) >> 3];
+              e = vd(c[e >> 2] | 0) | 0;
+              c[m >> 2] = 4;
+              c[(m + 4) >> 2] = (q << 24) >> 24 == 108 ? 0 : (q << 24) >> 24 == 114 ? 2 : 1;
+              c[(m + 8) >> 2] = j;
+              c[(m + 12) >> 2] = k;
+              c[(m + 16) >> 2] = 0;
+              c[(m + 20) >> 2] = f;
+              h[(m + 24) >> 3] = g;
+              h[(m + 32) >> 3] = i;
+              c[(m + 40) >> 2] = 4;
+              h[(m + 48) >> 3] = 0.0;
+              h[(m + 56) >> 3] = 0.0;
+              c[(m + 64) >> 2] = ~~(p + (p >= 0.0 ? 0.5 : -0.5));
+              c[(m + 68) >> 2] = ~~(o + (o >= 0.0 ? 0.5 : -0.5));
+              c[(m + 72) >> 2] = e;
+              uF(b, 68549, m);
+              l = n;
+              return;
+            }
+            function md(b, e) {
+              b = b | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              n = l;
+              l = (l + 32) | 0;
+              j = n;
+              i = (n + 20) | 0;
+              m = (e + 32) | 0;
+              a: do
+                switch (c[m >> 2] | 0) {
+                  case 5: {
+                    f = 0;
+                    while (1) {
+                      g = c[(12724 + (f << 2)) >> 2] | 0;
+                      if ((f | 0) == 8) break a;
+                      h = c[e >> 2] | 0;
+                      if ((a[g >> 0] | 0) == (a[h >> 0] | 0) ? (s2(g, h) | 0) == 0 : 0) {
+                        k = 10;
+                        break a;
+                      }
+                      f = (f + 1) | 0;
+                    }
+                  }
+                  case 1: {
+                    g = (e + 1) | 0;
+                    h = (e + 2) | 0;
+                    f = ((ud(i, d[e >> 0] | 0, d[g >> 0] | 0, d[h >> 0] | 0) | 0) + 32) | 0;
+                    if (!(c[i >> 2] | 0)) k = 10;
+                    else {
+                      o = d[e >> 0] | 0;
+                      i = d[g >> 0] | 0;
+                      k = d[h >> 0] | 0;
+                      c[j >> 2] = 0;
+                      c[(j + 4) >> 2] = f;
+                      c[(j + 8) >> 2] = o;
+                      c[(j + 12) >> 2] = i;
+                      c[(j + 16) >> 2] = k;
+                      uF(b, 68492, j);
+                      k = 10;
+                    }
+                    break;
+                  }
+                  case 0: {
+                    f = 0;
+                    k = 10;
+                    break;
+                  }
+                  default:
+                    qa(138394, 68513, 168, 68532);
+                }
+              while (0);
+              if ((k | 0) == 10) c[e >> 2] = f;
+              c[m >> 2] = 6;
+              l = n;
+              return;
+            }
+            function nd(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0;
+              e = l;
+              l = (l + 112) | 0;
+              f = (e + 8) | 0;
+              u = (e + 104) | 0;
+              t = e;
+              k = c[(a + 16) >> 2] | 0;
+              s = ~~+h[(k + 152) >> 3];
+              r = c[(k + 16) >> 2] | 0;
+              q = c[(k + 56) >> 2] | 0;
+              p = c[46716] | 0;
+              sd(k, u, t);
+              n = +h[b >> 3];
+              k = ~~(n + (n >= 0.0 ? 0.5 : -0.5));
+              m = +h[(b + 8) >> 3];
+              j = ~~(m + (m >= 0.0 ? 0.5 : -0.5));
+              i = +h[(b + 16) >> 3];
+              n = i - n;
+              g = +h[(b + 24) >> 3];
+              m = g - m;
+              b = c[u >> 2] | 0;
+              o = +h[t >> 3];
+              c[f >> 2] = 1;
+              c[(f + 4) >> 2] = 1;
+              c[(f + 8) >> 2] = b;
+              c[(f + 12) >> 2] = s;
+              c[(f + 16) >> 2] = r;
+              c[(f + 20) >> 2] = q;
+              c[(f + 24) >> 2] = p;
+              c[(f + 28) >> 2] = 0;
+              c[(f + 32) >> 2] = d | 0 ? 20 : -1;
+              h[(f + 40) >> 3] = o;
+              c[(f + 48) >> 2] = 0;
+              h[(f + 56) >> 3] = 0.0;
+              c[(f + 64) >> 2] = k;
+              c[(f + 68) >> 2] = j;
+              c[(f + 72) >> 2] = ~~(n + (n >= 0.0 ? 0.5 : -0.5));
+              c[(f + 76) >> 2] = ~~(m + (m >= 0.0 ? 0.5 : -0.5));
+              c[(f + 80) >> 2] = k;
+              c[(f + 84) >> 2] = j;
+              c[(f + 88) >> 2] = ~~(i + (i >= 0.0 ? 0.5 : -0.5));
+              c[(f + 92) >> 2] = ~~(g + (g >= 0.0 ? 0.5 : -0.5));
+              uF(a, 68427, f);
+              l = e;
+              return;
+            }
+            function od(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              f = l;
+              l = (l + 96) | 0;
+              g = (f + 8) | 0;
+              o = (f + 80) | 0;
+              p = f;
+              q = c[(a + 16) >> 2] | 0;
+              n = ~~+h[(q + 152) >> 3];
+              m = c[(q + 16) >> 2] | 0;
+              k = c[(q + 56) >> 2] | 0;
+              j = c[46716] | 0;
+              sd(q, o, p);
+              o = c[o >> 2] | 0;
+              i = +h[p >> 3];
+              c[g >> 2] = 2;
+              c[(g + 4) >> 2] = 3;
+              c[(g + 8) >> 2] = o;
+              c[(g + 12) >> 2] = n;
+              c[(g + 16) >> 2] = m;
+              c[(g + 20) >> 2] = k;
+              c[(g + 24) >> 2] = j;
+              c[(g + 28) >> 2] = 0;
+              c[(g + 32) >> 2] = e | 0 ? 20 : -1;
+              h[(g + 40) >> 3] = i;
+              c[(g + 48) >> 2] = 0;
+              c[(g + 52) >> 2] = 0;
+              c[(g + 56) >> 2] = 0;
+              c[(g + 60) >> 2] = 0;
+              c[(g + 64) >> 2] = 0;
+              c[(g + 68) >> 2] = d + 1;
+              uF(a, 68331, g);
+              td(a, b, d, 1);
+              l = f;
+              return;
+            }
+            function pd(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0.0,
+                E = 0.0,
+                F = 0;
+              C = l;
+              l = (l + 192) | 0;
+              B = (C + 176) | 0;
+              z = (C + 168) | 0;
+              A = (C + 104) | 0;
+              y = (C + 96) | 0;
+              f = (C + 88) | 0;
+              u = (C + 180) | 0;
+              v = (C + 80) | 0;
+              w = (C + 16) | 0;
+              x = C;
+              e = (a + 16) | 0;
+              p = c[e >> 2] | 0;
+              q = ~~+h[(p + 152) >> 3];
+              r = c[(p + 16) >> 2] | 0;
+              s = c[46716] | 0;
+              t = T1((((d * 140) | 0) + 140) | 0) | 0;
+              sd(p, u, v);
+              if (!g) {
+                o = 4;
+                j = 0;
+                k = -1;
+              } else {
+                o = 5;
+                j = c[((c[e >> 2] | 0) + 56) >> 2] | 0;
+                k = 20;
+              }
+              E = +h[b >> 3];
+              n = (w + 48) | 0;
+              h[n >> 3] = E;
+              D = +h[(b + 8) >> 3];
+              h[(w + 56) >> 3] = D;
+              c[f >> 2] = ~~(E + (E >= 0.0 ? 0.5 : -0.5));
+              c[(f + 4) >> 2] = ~~(D + (D >= 0.0 ? 0.5 : -0.5));
+              m = (x + 8) | 0;
+              e = (t + (m4(t, 81099, f) | 0)) | 0;
+              p = 1;
+              g = 0;
+              while (1) {
+                i = (g + 3) | 0;
+                if ((i | 0) >= (d | 0)) break;
+                c[w >> 2] = c[n >> 2];
+                c[(w + 4) >> 2] = c[(n + 4) >> 2];
+                c[(w + 8) >> 2] = c[(n + 8) >> 2];
+                c[(w + 12) >> 2] = c[(n + 12) >> 2];
+                f = 1;
+                while (1) {
+                  if ((f | 0) == 4) {
+                    f = 1;
+                    break;
+                  }
+                  F = (f + g) | 0;
+                  h[(w + (f << 4)) >> 3] = +h[(b + (F << 4)) >> 3];
+                  h[(w + (f << 4) + 8) >> 3] = +h[(b + (F << 4) + 8) >> 3];
+                  f = (f + 1) | 0;
+                }
+                while (1) {
+                  if ((f | 0) == 7) break;
+                  kP(x, w, 3, +(f | 0) * 0.16666666666666666, 0, 0);
+                  D = +h[x >> 3];
+                  E = +h[m >> 3];
+                  c[y >> 2] = ~~(D + (D >= 0.0 ? 0.5 : -0.5));
+                  c[(y + 4) >> 2] = ~~(E + (E >= 0.0 ? 0.5 : -0.5));
+                  f = (f + 1) | 0;
+                  e = (e + (m4(e, 81099, y) | 0)) | 0;
+                }
+                p = (p + 6) | 0;
+                g = i;
+              }
+              f = c[u >> 2] | 0;
+              E = +h[v >> 3];
+              c[A >> 2] = 3;
+              c[(A + 4) >> 2] = o;
+              c[(A + 8) >> 2] = f;
+              c[(A + 12) >> 2] = q;
+              c[(A + 16) >> 2] = r;
+              c[(A + 20) >> 2] = j;
+              c[(A + 24) >> 2] = s;
+              c[(A + 28) >> 2] = 0;
+              c[(A + 32) >> 2] = k;
+              h[(A + 40) >> 3] = E;
+              c[(A + 48) >> 2] = 0;
+              c[(A + 52) >> 2] = 0;
+              c[(A + 56) >> 2] = 0;
+              c[(A + 60) >> 2] = p;
+              uF(a, 68382, A);
+              c[z >> 2] = t;
+              uF(a, 81106, z);
+              U1(t);
+              f = (p + -1) | 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (p | 0)) break;
+                c[B >> 2] = (((e | 0) % (f | 0) | 0 | 0) != 0) & 1;
+                uF(a, 81111, B);
+                e = (e + 1) | 0;
+              }
+              oF(a, 153599) | 0;
+              l = C;
+              return;
+            }
+            function qd(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              e = l;
+              l = (l + 96) | 0;
+              f = (e + 8) | 0;
+              m = (e + 80) | 0;
+              n = e;
+              o = c[(a + 16) >> 2] | 0;
+              k = ~~+h[(o + 152) >> 3];
+              j = c[(o + 16) >> 2] | 0;
+              i = c[46716] | 0;
+              sd(o, m, n);
+              m = c[m >> 2] | 0;
+              g = +h[n >> 3];
+              c[f >> 2] = 2;
+              c[(f + 4) >> 2] = 1;
+              c[(f + 8) >> 2] = m;
+              c[(f + 12) >> 2] = k;
+              c[(f + 16) >> 2] = j;
+              c[(f + 20) >> 2] = 0;
+              c[(f + 24) >> 2] = i;
+              c[(f + 28) >> 2] = 0;
+              c[(f + 32) >> 2] = 0;
+              h[(f + 40) >> 3] = g;
+              c[(f + 48) >> 2] = 0;
+              c[(f + 52) >> 2] = 0;
+              c[(f + 56) >> 2] = 0;
+              c[(f + 60) >> 2] = 0;
+              c[(f + 64) >> 2] = 0;
+              c[(f + 68) >> 2] = d;
+              uF(a, 68331, f);
+              td(a, b, d, 0);
+              l = e;
+              return;
+            }
+            function rd(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = l;
+              l = (l + 16) | 0;
+              e = d;
+              c[e >> 2] = b;
+              uF(a, 68325, e);
+              l = d;
+              return;
+            }
+            function sd(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0;
+              switch (c[(a + 144) >> 2] | 0) {
+                case 1: {
+                  e = 10.0;
+                  a = 1;
+                  break;
+                }
+                case 2: {
+                  e = 10.0;
+                  a = 2;
+                  break;
+                }
+                default: {
+                  e = 0.0;
+                  a = 0;
+                }
+              }
+              c[b >> 2] = a;
+              h[d >> 3] = e;
+              return;
+            }
+            function td(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0.0,
+                m = 0.0;
+              j = l;
+              l = (l + 16) | 0;
+              i = (j + 8) | 0;
+              g = j;
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (d | 0)) break;
+                m = +h[(b + (f << 4)) >> 3];
+                k = +h[(b + (f << 4) + 8) >> 3];
+                c[g >> 2] = ~~(m + (m >= 0.0 ? 0.5 : -0.5));
+                c[(g + 4) >> 2] = ~~(k + (k >= 0.0 ? 0.5 : -0.5));
+                uF(a, 81099, g);
+                f = (f + 1) | 0;
+              }
+              if (e | 0) {
+                k = +h[b >> 3];
+                m = +h[(b + 8) >> 3];
+                c[i >> 2] = ~~(k + (k >= 0.0 ? 0.5 : -0.5));
+                c[(i + 4) >> 2] = ~~(m + (m >= 0.0 ? 0.5 : -0.5));
+                uF(a, 81099, i);
+              }
+              oF(a, 153599) | 0;
+              l = j;
+              return;
+            }
+            function ud(a, d, e, f) {
+              a = a | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0;
+              c[a >> 2] = 0;
+              k = c[46717] | 0;
+              h = 195075;
+              g = 0;
+              i = -1;
+              while (1) {
+                if ((g | 0) >= (k | 0)) {
+                  l = 6;
+                  break;
+                }
+                m = ((b[(192216 + (g << 1)) >> 1] | 0) - d) | 0;
+                n = ((b[(192728 + (g << 1)) >> 1] | 0) - e) | 0;
+                j = ((b[(193240 + (g << 1)) >> 1] | 0) - f) | 0;
+                j = ((O(n, n) | 0) + (O(m, m) | 0) + (O(j, j) | 0)) | 0;
+                if ((j | 0) < (h | 0))
+                  if (!j) break;
+                  else {
+                    h = j;
+                    i = g;
+                  }
+                g = (g + 1) | 0;
+              }
+              if ((l | 0) == 6) {
+                c[46717] = k + 1;
+                if ((k | 0) == 256) g = i;
+                else {
+                  b[(192216 + (g << 1)) >> 1] = d;
+                  b[(192728 + (g << 1)) >> 1] = e;
+                  b[(193240 + (g << 1)) >> 1] = f;
+                  c[a >> 2] = 1;
+                }
+              }
+              return g | 0;
+            }
+            function vd(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 16) | 0;
+              h = i;
+              d = c[46718] | 0;
+              if (!d) {
+                c[46719] = 64;
+                d = T1(64) | 0;
+                c[46718] = d;
+                e = 0;
+              } else e = 0;
+              while (1) {
+                g = (b + 1) | 0;
+                f = a[b >> 0] | 0;
+                if (!((f << 24) >> 24)) break;
+                b = c[46719] | 0;
+                if ((e | 0) > ((b + -8) | 0)) {
+                  d = b << 1;
+                  c[46719] = d;
+                  d = W1(c[46718] | 0, d) | 0;
+                  c[46718] = d;
+                  d = (d + e) | 0;
+                }
+                if ((f << 24) >> 24 <= -1) {
+                  a[d >> 0] = 92;
+                  c[h >> 2] = f & 255;
+                  m4((d + 1) | 0, 81224, h) | 0;
+                  b = g;
+                  d = (d + 4) | 0;
+                  e = (e + 4) | 0;
+                  continue;
+                }
+                if ((f << 24) >> 24 == 92) {
+                  a[d >> 0] = 92;
+                  e = (e + 1) | 0;
+                  d = (d + 1) | 0;
+                }
+                a[d >> 0] = f;
+                b = g;
+                d = (d + 1) | 0;
+                e = (e + 1) | 0;
+              }
+              a[d >> 0] = 0;
+              l = i;
+              return c[46718] | 0;
+            }
+            function wd(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              d = l;
+              l = (l + 16) | 0;
+              b = d;
+              oF(a, 73332) | 0;
+              if ((c[(a + 64) >> 2] | 0) == 2) oF(a, 73347) | 0;
+              else oF(a, 153599) | 0;
+              g = c[c[(a + 12) >> 2] >> 2] | 0;
+              f = c[(g + 4) >> 2] | 0;
+              e = c[(g + 8) >> 2] | 0;
+              c[b >> 2] = c[g >> 2];
+              c[(b + 4) >> 2] = f;
+              c[(b + 8) >> 2] = e;
+              uF(a, 73358, b);
+              l = d;
+              return;
+            }
+            function xd(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              g = l;
+              l = (l + 32) | 0;
+              f = (g + 8) | 0;
+              e = g;
+              oF(a, 73286) | 0;
+              d = (a + 64) | 0;
+              b = (a + 12) | 0;
+              if ((c[d >> 2] | 0) != 2) {
+                c[e >> 2] = c[((c[b >> 2] | 0) + 28) >> 2];
+                uF(a, 73297, e);
+              }
+              if ((c[((c[b >> 2] | 0) + 20) >> 2] | 0) == 0 ? (c[d >> 2] | 0) != 2 : 0) {
+                b = c[(a + 476) >> 2] | 0;
+                d = c[(a + 480) >> 2] | 0;
+                e = c[(a + 484) >> 2] | 0;
+                c[f >> 2] = c[(a + 472) >> 2];
+                c[(f + 4) >> 2] = b;
+                c[(f + 8) >> 2] = d;
+                c[(f + 12) >> 2] = e;
+                uF(a, 69666, f);
+              }
+              oF(a, 73312) | 0;
+              oF(a, 73325) | 0;
+              l = g;
+              return;
+            }
+            function yd(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              k = l;
+              l = (l + 32) | 0;
+              j = (k + 24) | 0;
+              f = (k + 8) | 0;
+              i = k;
+              g = c[(b + 16) >> 2] | 0;
+              a[193768] = 0;
+              e = (b + 12) | 0;
+              h = (g + 8) | 0;
+              if (!(c[((c[e >> 2] | 0) + 28) >> 2] | 0)) {
+                c[i >> 2] = KB(c[h >> 2] | 0) | 0;
+                uF(b, 69597, i);
+                d = (b + 64) | 0;
+                if ((c[d >> 2] | 0) == 2) oF(b, 69630) | 0;
+                else oF(b, 69612) | 0;
+                do
+                  if (!(c[((c[e >> 2] | 0) + 20) >> 2] | 0))
+                    if ((c[d >> 2] | 0) == 2) {
+                      n = c[(b + 460) >> 2] | 0;
+                      m = c[(b + 464) >> 2] | 0;
+                      d = c[(b + 468) >> 2] | 0;
+                      c[f >> 2] = c[(b + 456) >> 2];
+                      c[(f + 4) >> 2] = n;
+                      c[(f + 8) >> 2] = m;
+                      c[(f + 12) >> 2] = d;
+                      uF(b, 69666, f);
+                      break;
+                    } else {
+                      oF(b, 69642) | 0;
+                      break;
+                    }
+                while (0);
+                oF(b, 69696) | 0;
+                yM(b, c[((c[e >> 2] | 0) + 24) >> 2] | 0, 13e3);
+                AM(b);
+                d = c[((c[e >> 2] | 0) + 20) >> 2] | 0;
+                if (d | 0) {
+                  c[i >> 2] = c[d >> 2];
+                  c[(i + 4) >> 2] = 0;
+                  yM(b, 0, i);
+                }
+              }
+              c[46720] = (a[((c[((c[h >> 2] | 0) + 16) >> 2] | 0) + 115) >> 0] | 0) == 1 ? 1 : -1;
+              if (!(a[193768] | 0)) {
+                oF(b, 69716) | 0;
+                a[193768] = 1;
+              }
+              d = c[(g + 208) >> 2] | 0;
+              if (d | 0) {
+                c[j >> 2] = BM(d, c[46720] | 0) | 0;
+                uF(b, 69729, j);
+              }
+              l = k;
+              return;
+            }
+            function zd(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0;
+              b = l;
+              l = (l + 16) | 0;
+              f = b;
+              c[f >> 2] = d;
+              c[(f + 4) >> 2] = e;
+              uF(a, 69581, f);
+              l = b;
+              return;
+            }
+            function Ad(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0.0,
+                v = 0.0,
+                w = 0.0;
+              s = l;
+              l = (l + 144) | 0;
+              r = (s + 128) | 0;
+              q = (s + 112) | 0;
+              p = (s + 72) | 0;
+              o = (s + 56) | 0;
+              n = (s + 40) | 0;
+              m = (s + 32) | 0;
+              e = (s + 24) | 0;
+              b = (s + 8) | 0;
+              d = s;
+              f = c[(a + 456) >> 2] | 0;
+              j = c[(a + 460) >> 2] | 0;
+              g = c[(a + 464) >> 2] | 0;
+              i = c[(a + 468) >> 2] | 0;
+              k = (a + 12) | 0;
+              t = ((c[((c[k >> 2] | 0) + 28) >> 2] | 0) + 1) | 0;
+              c[d >> 2] = t;
+              c[(d + 4) >> 2] = t;
+              uF(a, 69208, d);
+              if (!(c[((c[k >> 2] | 0) + 20) >> 2] | 0)) {
+                c[b >> 2] = f;
+                c[(b + 4) >> 2] = j;
+                c[(b + 8) >> 2] = g;
+                c[(b + 12) >> 2] = i;
+                uF(a, 69225, b);
+              }
+              d = (a + 360) | 0;
+              c[e >> 2] = c[d >> 2] | 0 ? 69259 : 69269;
+              uF(a, 69278, e);
+              b = (a + 64) | 0;
+              if ((c[b >> 2] | 0) == 1) {
+                c[m >> 2] = g;
+                c[(m + 4) >> 2] = i;
+                uF(a, 69303, m);
+              }
+              m = c[(a + 200) >> 2] | 0;
+              t = c[(a + 204) >> 2] | 0;
+              c[n >> 2] = c[(a + 196) >> 2];
+              c[(n + 4) >> 2] = m;
+              c[(n + 8) >> 2] = t;
+              uF(a, 69342, n);
+              if (!(c[((c[k >> 2] | 0) + 20) >> 2] | 0)) {
+                c[o >> 2] = f;
+                c[(o + 4) >> 2] = j;
+                c[(o + 8) >> 2] = g - f;
+                c[(o + 12) >> 2] = i - j;
+                uF(a, 69362, o);
+              }
+              w = +h[(a + 496) >> 3];
+              t = c[d >> 2] | 0;
+              v = +h[(a + 504) >> 3];
+              u = +h[(a + 512) >> 3];
+              h[p >> 3] = +h[(a + 488) >> 3];
+              h[(p + 8) >> 3] = w;
+              c[(p + 16) >> 2] = t;
+              h[(p + 24) >> 3] = v;
+              h[(p + 32) >> 3] = u;
+              uF(a, 69402, p);
+              if ((c[b >> 2] | 0) == 1) {
+                if (((g | 0) > 14399) | ((i | 0) > 14399)) {
+                  t = c[((c[k >> 2] | 0) + 16) >> 2] | 0;
+                  c[q >> 2] = g;
+                  c[(q + 4) >> 2] = i;
+                  c[(q + 8) >> 2] = 14400;
+                  ub[t & 63](69445, q);
+                }
+                c[r >> 2] = f;
+                c[(r + 4) >> 2] = j;
+                c[(r + 8) >> 2] = g;
+                c[(r + 12) >> 2] = i;
+                uF(a, 69540, r);
+              }
+              l = s;
+              return;
+            }
+            function Bd(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              e = l;
+              l = (l + 16) | 0;
+              d = e;
+              b = (a + 12) | 0;
+              if (c[((c[b >> 2] | 0) + 20) >> 2] | 0) {
+                oF(a, 69132) | 0;
+                yM(a, 0, ((c[((c[b >> 2] | 0) + 20) >> 2] | 0) + 4) | 0);
+              }
+              oF(a, 69149) | 0;
+              oF(a, 69176) | 0;
+              c[d >> 2] = c[((c[b >> 2] | 0) + 28) >> 2];
+              uF(a, 69191, d);
+              l = e;
+              return;
+            }
+            function Cd(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = l;
+              l = (l + 16) | 0;
+              d = b;
+              c[d >> 2] = KB(c[((c[(a + 16) >> 2] | 0) + 8) >> 2] | 0) | 0;
+              uF(a, 69125, d);
+              oF(a, 69118) | 0;
+              l = b;
+              return;
+            }
+            function Dd(a) {
+              a = a | 0;
+              oF(a, 84552) | 0;
+              return;
+            }
+            function Ed(a) {
+              a = a | 0;
+              oF(a, 69118) | 0;
+              return;
+            }
+            function Fd(a) {
+              a = a | 0;
+              oF(a, 84552) | 0;
+              return;
+            }
+            function Gd(a) {
+              a = a | 0;
+              oF(a, 69118) | 0;
+              return;
+            }
+            function Hd(a) {
+              a = a | 0;
+              oF(a, 84552) | 0;
+              return;
+            }
+            function Id(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0;
+              e = l;
+              l = (l + 16) | 0;
+              d = e;
+              if (b | 0 ? ((g = ((c[(a + 16) >> 2] | 0) + 272) | 0), c[g >> 2] | 0) : 0) {
+                oF(a, 69014) | 0;
+                yF(a, c[g >> 2] | 0, 2);
+                oF(a, 69025) | 0;
+                c[d >> 2] = BM(b, c[46720] | 0) | 0;
+                uF(a, 69029, d);
+              }
+              l = e;
+              return;
+            }
+            function Jd(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              m = l;
+              l = (l + 32) | 0;
+              j = (m + 8) | 0;
+              k = m;
+              f = c[(b + 16) >> 2] | 0;
+              if (!(+h[(f + 40) >> 3] < 0.5)) {
+                Qd(b, (f + 16) | 0);
+                i = (e + 4) | 0;
+                vF(b, +h[((c[i >> 2] | 0) + 16) >> 3]);
+                c[j >> 2] = c[c[i >> 2] >> 2];
+                uF(b, 68973, j);
+                i = BM(c[e >> 2] | 0, c[46720] | 0) | 0;
+                switch (a[(e + 48) >> 0] | 0) {
+                  case 114: {
+                    n = (e + 32) | 0;
+                    f = n;
+                    g = +h[n >> 3];
+                    break;
+                  }
+                  case 108: {
+                    f = (e + 32) | 0;
+                    g = 0.0;
+                    break;
+                  }
+                  default: {
+                    n = (e + 32) | 0;
+                    f = n;
+                    g = +h[n >> 3] * 0.5;
+                  }
+                }
+                h[d >> 3] = +h[d >> 3] - g;
+                n = (d + 8) | 0;
+                h[n >> 3] = +h[n >> 3] + +h[(e + 24) >> 3];
+                c[j >> 2] = c[d >> 2];
+                c[(j + 4) >> 2] = c[(d + 4) >> 2];
+                c[(j + 8) >> 2] = c[(d + 8) >> 2];
+                c[(j + 12) >> 2] = c[(d + 12) >> 2];
+                xF(b, j);
+                oF(b, 68988) | 0;
+                vF(b, +h[f >> 3]);
+                c[k >> 2] = i;
+                uF(b, 68997, k);
+              }
+              l = m;
+              return;
+            }
+            function Kd(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              g = l;
+              l = (l + 32) | 0;
+              f = g;
+              c[f >> 2] = c[b >> 2];
+              c[(f + 4) >> 2] = c[(b + 4) >> 2];
+              c[(f + 8) >> 2] = c[(b + 8) >> 2];
+              c[(f + 12) >> 2] = c[(b + 12) >> 2];
+              h[(f + 16) >> 3] = +h[(b + 16) >> 3] - +h[b >> 3];
+              h[(f + 24) >> 3] = +h[(b + 24) >> 3] - +h[(b + 8) >> 3];
+              b = (a + 16) | 0;
+              if (d | 0 ? ((e = c[b >> 2] | 0), +h[(e + 80) >> 3] > 0.5) : 0) {
+                Qd(a, (e + 56) | 0);
+                yF(a, f, 2);
+                oF(a, 68931) | 0;
+              }
+              if (+h[((c[b >> 2] | 0) + 40) >> 3] > 0.5) {
+                Rd(a);
+                Qd(a, ((c[b >> 2] | 0) + 16) | 0);
+                yF(a, f, 2);
+                oF(a, 68951) | 0;
+              }
+              l = g;
+              return;
+            }
+            function Ld(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 16) | 0;
+              i = j;
+              g = (a + 16) | 0;
+              if (e | 0 ? ((f = c[g >> 2] | 0), +h[(f + 80) >> 3] > 0.5) : 0) {
+                Qd(a, (f + 56) | 0);
+                oF(a, 68852) | 0;
+                c[i >> 2] = c[b >> 2];
+                c[(i + 4) >> 2] = c[(b + 4) >> 2];
+                c[(i + 8) >> 2] = c[(b + 8) >> 2];
+                c[(i + 12) >> 2] = c[(b + 12) >> 2];
+                xF(a, i);
+                oF(a, 68861) | 0;
+                e = 1;
+                while (1) {
+                  if ((e | 0) >= (d | 0)) break;
+                  f = (b + (e << 4)) | 0;
+                  c[i >> 2] = c[f >> 2];
+                  c[(i + 4) >> 2] = c[(f + 4) >> 2];
+                  c[(i + 8) >> 2] = c[(f + 8) >> 2];
+                  c[(i + 12) >> 2] = c[(f + 12) >> 2];
+                  xF(a, i);
+                  oF(a, 68870) | 0;
+                  e = (e + 1) | 0;
+                }
+                oF(a, 68897) | 0;
+              }
+              if (+h[((c[g >> 2] | 0) + 40) >> 3] > 0.5) {
+                Rd(a);
+                Qd(a, ((c[g >> 2] | 0) + 16) | 0);
+                oF(a, 68852) | 0;
+                c[i >> 2] = c[b >> 2];
+                c[(i + 4) >> 2] = c[(b + 4) >> 2];
+                c[(i + 8) >> 2] = c[(b + 8) >> 2];
+                c[(i + 12) >> 2] = c[(b + 12) >> 2];
+                xF(a, i);
+                oF(a, 68861) | 0;
+                e = 1;
+                while (1) {
+                  if ((e | 0) >= (d | 0)) break;
+                  g = (b + (e << 4)) | 0;
+                  c[i >> 2] = c[g >> 2];
+                  c[(i + 4) >> 2] = c[(g + 4) >> 2];
+                  c[(i + 8) >> 2] = c[(g + 8) >> 2];
+                  c[(i + 12) >> 2] = c[(g + 12) >> 2];
+                  xF(a, i);
+                  oF(a, 68870) | 0;
+                  e = (e + 1) | 0;
+                }
+                oF(a, 68913) | 0;
+              }
+              l = j;
+              return;
+            }
+            function Md(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 16) | 0;
+              f = k;
+              i = (a + 16) | 0;
+              if (g | 0 ? ((j = c[i >> 2] | 0), +h[(j + 80) >> 3] > 0.5) : 0) {
+                Qd(a, (j + 56) | 0);
+                oF(a, 68852) | 0;
+                c[f >> 2] = c[b >> 2];
+                c[(f + 4) >> 2] = c[(b + 4) >> 2];
+                c[(f + 8) >> 2] = c[(b + 8) >> 2];
+                c[(f + 12) >> 2] = c[(b + 12) >> 2];
+                xF(a, f);
+                oF(a, 68861) | 0;
+                e = 1;
+                while (1) {
+                  if ((e | 0) >= (d | 0)) break;
+                  yF(a, (b + (e << 4)) | 0, 3);
+                  oF(a, 68887) | 0;
+                  e = (e + 3) | 0;
+                }
+                oF(a, 68897) | 0;
+              }
+              if (+h[((c[i >> 2] | 0) + 40) >> 3] > 0.5) {
+                Rd(a);
+                Qd(a, ((c[i >> 2] | 0) + 16) | 0);
+                oF(a, 68852) | 0;
+                c[f >> 2] = c[b >> 2];
+                c[(f + 4) >> 2] = c[(b + 4) >> 2];
+                c[(f + 8) >> 2] = c[(b + 8) >> 2];
+                c[(f + 12) >> 2] = c[(b + 12) >> 2];
+                xF(a, f);
+                oF(a, 68861) | 0;
+                e = 1;
+                while (1) {
+                  if ((e | 0) >= (d | 0)) break;
+                  yF(a, (b + (e << 4)) | 0, 3);
+                  oF(a, 68887) | 0;
+                  e = (e + 3) | 0;
+                }
+                oF(a, 68879) | 0;
+              }
+              l = k;
+              return;
+            }
+            function Nd(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0;
+              g = l;
+              l = (l + 16) | 0;
+              f = g;
+              e = (a + 16) | 0;
+              if (+h[((c[e >> 2] | 0) + 40) >> 3] > 0.5) {
+                Rd(a);
+                Qd(a, ((c[e >> 2] | 0) + 16) | 0);
+                oF(a, 68852) | 0;
+                c[f >> 2] = c[b >> 2];
+                c[(f + 4) >> 2] = c[(b + 4) >> 2];
+                c[(f + 8) >> 2] = c[(b + 8) >> 2];
+                c[(f + 12) >> 2] = c[(b + 12) >> 2];
+                xF(a, f);
+                oF(a, 68861) | 0;
+                e = 1;
+                while (1) {
+                  if ((e | 0) >= (d | 0)) break;
+                  i = (b + (e << 4)) | 0;
+                  c[f >> 2] = c[i >> 2];
+                  c[(f + 4) >> 2] = c[(i + 4) >> 2];
+                  c[(f + 8) >> 2] = c[(i + 8) >> 2];
+                  c[(f + 12) >> 2] = c[(i + 12) >> 2];
+                  xF(a, f);
+                  oF(a, 68870) | 0;
+                  e = (e + 1) | 0;
+                }
+                oF(a, 68879) | 0;
+              }
+              l = g;
+              return;
+            }
+            function Od(a, b) {
+              a = a | 0;
+              b = b | 0;
+              oF(a, 68849) | 0;
+              oF(a, b) | 0;
+              oF(a, 153599) | 0;
+              return;
+            }
+            function Pd(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              n = l;
+              l = (l + 32) | 0;
+              g = (n + 16) | 0;
+              m = (n + 8) | 0;
+              k = n;
+              i = (a + 16) | 0;
+              if (f | 0 ? ((j = c[i >> 2] | 0), +h[(j + 80) >> 3] > 0.5) : 0) {
+                Qd(a, (j + 56) | 0);
+                oF(a, 84447) | 0;
+                yF(a, d, e);
+                oF(a, 102604) | 0;
+                c[g >> 2] = c[d >> 2];
+                c[(g + 4) >> 2] = c[(d + 4) >> 2];
+                c[(g + 8) >> 2] = c[(d + 8) >> 2];
+                c[(g + 12) >> 2] = c[(d + 12) >> 2];
+                xF(a, g);
+                c[k >> 2] = e;
+                c[(k + 4) >> 2] = b;
+                uF(a, 68766, k);
+              }
+              if (+h[((c[i >> 2] | 0) + 40) >> 3] > 0.5) {
+                Rd(a);
+                Qd(a, ((c[i >> 2] | 0) + 16) | 0);
+                oF(a, 84447) | 0;
+                yF(a, d, e);
+                oF(a, 102604) | 0;
+                c[g >> 2] = c[d >> 2];
+                c[(g + 4) >> 2] = c[(d + 4) >> 2];
+                c[(g + 8) >> 2] = c[(d + 8) >> 2];
+                c[(g + 12) >> 2] = c[(d + 12) >> 2];
+                xF(a, g);
+                c[m >> 2] = e;
+                c[(m + 4) >> 2] = b;
+                uF(a, 68782, m);
+              }
+              l = n;
+              return;
+            }
+            function Qd(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0.0;
+              f = l;
+              l = (l + 32) | 0;
+              e = f;
+              if (b | 0) {
+                switch (c[((c[(a + 16) >> 2] | 0) + 4) >> 2] | 0) {
+                  case 1:
+                  case 0: {
+                    d = 111494;
+                    break;
+                  }
+                  case 2: {
+                    d = 111481;
+                    break;
+                  }
+                  case 3: {
+                    d = 111450;
+                    break;
+                  }
+                  default:
+                    d = 68818;
+                }
+                i = +h[(b + 8) >> 3];
+                g = +h[(b + 16) >> 3];
+                h[e >> 3] = +h[b >> 3];
+                h[(e + 8) >> 3] = i;
+                h[(e + 16) >> 3] = g;
+                c[(e + 24) >> 2] = d;
+                uF(a, 68825, e);
+              }
+              l = f;
+              return;
+            }
+            function Rd(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              m = l;
+              l = (l + 16) | 0;
+              k = (m + 8) | 0;
+              j = m;
+              g = (b + 16) | 0;
+              i = c[g >> 2] | 0;
+              d = c[(i + 160) >> 2] | 0;
+              vF(b, +h[(i + 152) >> 3]);
+              oF(b, 68799) | 0;
+              while (1) {
+                if (!d) break;
+                i = (d + 4) | 0;
+                f = c[d >> 2] | 0;
+                if (!f) break;
+                if (!(s2(f, 111088) | 0)) {
+                  d = i;
+                  continue;
+                } else e = f;
+                while (1) {
+                  d = (e + 1) | 0;
+                  if (!(a[e >> 0] | 0)) break;
+                  else e = d;
+                }
+                a: while (1) {
+                  if (!(a[d >> 0] | 0)) break;
+                  c[j >> 2] = d;
+                  uF(b, 68814, j);
+                  while (1) {
+                    e = (d + 1) | 0;
+                    if (!(a[d >> 0] | 0)) {
+                      d = e;
+                      continue a;
+                    } else d = e;
+                  }
+                }
+                if (!(s2(f, 134335) | 0)) h[((c[g >> 2] | 0) + 152) >> 3] = 0.0;
+                c[k >> 2] = f;
+                uF(b, 96670, k);
+                d = i;
+              }
+              l = m;
+              return;
+            }
+            function Sd(b) {
+              b = b | 0;
+              var d = 0;
+              oF(b, 74838) | 0;
+              d = QA(c[((c[b >> 2] | 0) + 168) >> 2] | 0, 74894) | 0;
+              if (d | 0 ? a[d >> 0] | 0 : 0) {
+                oF(b, 74905) | 0;
+                oF(b, d) | 0;
+                oF(b, 74929) | 0;
+              }
+              oF(b, 74950) | 0;
+              oF(b, 74998) | 0;
+              oF(b, 75052) | 0;
+              d = (b + 12) | 0;
+              oF(b, FK(c[c[c[d >> 2] >> 2] >> 2] | 0) | 0) | 0;
+              oF(b, 78181) | 0;
+              oF(b, FK(c[((c[c[d >> 2] >> 2] | 0) + 4) >> 2] | 0) | 0) | 0;
+              oF(b, 78191) | 0;
+              oF(b, FK(c[((c[c[d >> 2] >> 2] | 0) + 8) >> 2] | 0) | 0) | 0;
+              oF(b, 75434) | 0;
+              oF(b, 75458) | 0;
+              return;
+            }
+            function Td(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0.0,
+                m = 0.0;
+              i = l;
+              l = (l + 48) | 0;
+              g = (i + 16) | 0;
+              f = (i + 8) | 0;
+              e = i;
+              d = c[(b + 16) >> 2] | 0;
+              oF(b, 74673) | 0;
+              d = (d + 8) | 0;
+              if (a[(KB(c[d >> 2] | 0) | 0) >> 0] | 0) {
+                oF(b, 75397) | 0;
+                oF(b, FK(KB(c[d >> 2] | 0) | 0) | 0) | 0;
+              }
+              c[e >> 2] = O(c[(b + 168) >> 2] | 0, c[(b + 164) >> 2] | 0) | 0;
+              uF(b, 74678, e);
+              e = c[(b + 452) >> 2] | 0;
+              c[f >> 2] = c[(b + 448) >> 2];
+              c[(f + 4) >> 2] = e;
+              uF(b, 74694, f);
+              m = +h[(b + 392) >> 3];
+              k = +h[(b + 400) >> 3];
+              j = +h[(b + 408) >> 3];
+              h[g >> 3] = +h[(b + 384) >> 3];
+              h[(g + 8) >> 3] = m;
+              h[(g + 16) >> 3] = k;
+              h[(g + 24) >> 3] = j;
+              uF(b, 74727, g);
+              oF(b, 74758) | 0;
+              oF(b, 74794) | 0;
+              oF(b, 76388) | 0;
+              l = i;
+              return;
+            }
+            function Ud(a) {
+              a = a | 0;
+              oF(a, 74665) | 0;
+              return;
+            }
+            function Vd(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              qe(a, b, 0, 101510, c[((c[(a + 16) >> 2] | 0) + 8) >> 2] | 0);
+              oF(a, 76388) | 0;
+              return;
+            }
+            function Wd(a) {
+              a = a | 0;
+              oF(a, 74513) | 0;
+              return;
+            }
+            function Xd(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              e = l;
+              l = (l + 16) | 0;
+              f = e;
+              g = c[(b + 16) >> 2] | 0;
+              d = (g + 8) | 0;
+              qe(b, c[(g + 212) >> 2] | 0, 0, 111494, c[d >> 2] | 0);
+              oF(b, 74617) | 0;
+              vF(b, +h[(b + 488) >> 3]);
+              oF(b, 102604) | 0;
+              vF(b, +h[(b + 496) >> 3]);
+              c[f >> 2] = 0 - (c[(b + 360) >> 2] | 0);
+              uF(b, 74636, f);
+              vF(b, +h[(b + 504) >> 3]);
+              oF(b, 102604) | 0;
+              vF(b, -+h[(b + 512) >> 3]);
+              oF(b, 74660) | 0;
+              if (a[(KB(c[d >> 2] | 0) | 0) >> 0] | 0) {
+                oF(b, 74569) | 0;
+                oF(b, FK(KB(c[d >> 2] | 0) | 0) | 0) | 0;
+                oF(b, 74577) | 0;
+              }
+              l = e;
+              return;
+            }
+            function Yd(a) {
+              a = a | 0;
+              oF(a, 74513) | 0;
+              return;
+            }
+            function Zd(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              d = c[(a + 16) >> 2] | 0;
+              b = (d + 8) | 0;
+              qe(a, c[(d + 212) >> 2] | 0, 0, 108006, c[b >> 2] | 0);
+              oF(a, 76388) | 0;
+              oF(a, 74569) | 0;
+              oF(a, FK(KB(c[b >> 2] | 0) | 0) | 0) | 0;
+              oF(a, 74577) | 0;
+              return;
+            }
+            function _d(a) {
+              a = a | 0;
+              oF(a, 74513) | 0;
+              return;
+            }
+            function $d(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              d = c[(a + 16) >> 2] | 0;
+              b = c[(a + 160) >> 2] | 0;
+              if ((b | 0) > 1) b = c[((c[((c[a >> 2] | 0) + 308) >> 2] | 0) + (b << 2)) >> 2] | 0;
+              else b = 0;
+              e = (d + 8) | 0;
+              qe(a, c[(d + 212) >> 2] | 0, b, 111481, c[e >> 2] | 0);
+              oF(a, 76388) | 0;
+              oF(a, 74569) | 0;
+              oF(a, FK(KB(c[e >> 2] | 0) | 0) | 0) | 0;
+              oF(a, 74577) | 0;
+              return;
+            }
+            function ae(a) {
+              a = a | 0;
+              oF(a, 74513) | 0;
+              return;
+            }
+            function be(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              d = c[(a + 16) >> 2] | 0;
+              b = (d + 8) | 0;
+              qe(a, c[(d + 212) >> 2] | 0, 0, 111450, c[b >> 2] | 0);
+              oF(a, 76388) | 0;
+              oF(a, 74569) | 0;
+              b = EK(102095, c[b >> 2] | 0) | 0;
+              oF(a, FK(b) | 0) | 0;
+              U1(b);
+              oF(a, 74577) | 0;
+              return;
+            }
+            function ce(a) {
+              a = a | 0;
+              oF(a, 74513) | 0;
+              return;
+            }
+            function de(b, c, d, e, f) {
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              oF(b, 74519) | 0;
+              if (f | 0) {
+                oF(b, 74522) | 0;
+                oF(b, FK(f) | 0) | 0;
+                oF(b, 98744) | 0;
+              }
+              oF(b, 74412) | 0;
+              oF(b, 76349) | 0;
+              if (c | 0 ? a[c >> 0] | 0 : 0) {
+                oF(b, 74530) | 0;
+                oF(b, c) | 0;
+                oF(b, 98744) | 0;
+              }
+              if (d | 0 ? a[d >> 0] | 0 : 0) {
+                oF(b, 74544) | 0;
+                oF(b, GK(d, 1) | 0) | 0;
+                oF(b, 98744) | 0;
+              }
+              if (e | 0 ? a[e >> 0] | 0 : 0) {
+                oF(b, 74559) | 0;
+                oF(b, FK(e) | 0) | 0;
+                oF(b, 98744) | 0;
+              }
+              oF(b, 76388) | 0;
+              return;
+            }
+            function ee(a) {
+              a = a | 0;
+              oF(a, 76343) | 0;
+              oF(a, 74513) | 0;
+              return;
+            }
+            function fe(e, f, g) {
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0.0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0;
+              M = l;
+              l = (l + 176) | 0;
+              L = (M + 160) | 0;
+              K = (M + 152) | 0;
+              F = (M + 136) | 0;
+              J = (M + 128) | 0;
+              E = (M + 120) | 0;
+              D = (M + 112) | 0;
+              C = (M + 104) | 0;
+              B = (M + 96) | 0;
+              A = (M + 88) | 0;
+              y = (M + 80) | 0;
+              w = (M + 72) | 0;
+              v = (M + 64) | 0;
+              u = (M + 56) | 0;
+              t = (M + 48) | 0;
+              i = (M + 40) | 0;
+              q = (M + 32) | 0;
+              s = (M + 24) | 0;
+              r = (M + 16) | 0;
+              p = (M + 8) | 0;
+              o = M;
+              I = c[(e + 16) >> 2] | 0;
+              oF(e, 74044) | 0;
+              switch (a[(g + 48) >> 0] | 0) {
+                case 108: {
+                  oF(e, 74050) | 0;
+                  break;
+                }
+                case 114: {
+                  oF(e, 74071) | 0;
+                  break;
+                }
+                default:
+                  oF(e, 74090) | 0;
+              }
+              H = (f + 8) | 0;
+              G = +h[H >> 3] + +h[(g + 24) >> 3];
+              h[H >> 3] = G;
+              H = (I + 260) | 0;
+              if (!(b[H >> 1] & 512)) {
+                oF(e, 74112) | 0;
+                vF(e, +h[f >> 3]);
+                oF(e, 74117) | 0;
+                vF(e, -G);
+                oF(e, 98744) | 0;
+              }
+              x = (g + 4) | 0;
+              f = c[x >> 2] | 0;
+              n = c[(f + 8) >> 2] | 0;
+              if (n) {
+                switch (c[((c[((c[((c[e >> 2] | 0) + 168) >> 2] | 0) + 16) >> 2] | 0) + 244) >> 2] | 0) {
+                  case 1: {
+                    m = n;
+                    f = (n + 16) | 0;
+                    i = (n + 8) | 0;
+                    break;
+                  }
+                  case 2: {
+                    m = (n + 24) | 0;
+                    f = (n + 32) | 0;
+                    i = (n + 28) | 0;
+                    break;
+                  }
+                  default: {
+                    m = (n + 4) | 0;
+                    f = (n + 16) | 0;
+                    i = (n + 8) | 0;
+                  }
+                }
+                j = c[f >> 2] | 0;
+                f = c[i >> 2] | 0;
+                k = c[(n + 12) >> 2] | 0;
+                c[o >> 2] = c[m >> 2];
+                uF(e, 74123, o);
+                i = c[(n + 24) >> 2] | 0;
+                if (i | 0) {
+                  c[p >> 2] = i;
+                  uF(e, 74140, p);
+                }
+                oF(e, 98744) | 0;
+                if (f | 0) {
+                  c[r >> 2] = f;
+                  uF(e, 74144, r);
+                }
+                if (k | 0) {
+                  c[s >> 2] = k;
+                  uF(e, 74162, s);
+                }
+                if (!j) j = 0;
+                else {
+                  c[q >> 2] = j;
+                  uF(e, 74181, q);
+                }
+              } else {
+                c[i >> 2] = c[f >> 2];
+                uF(e, 74198, i);
+                j = 0;
+                f = 0;
+              }
+              i = c[x >> 2] | 0;
+              if (i | 0 ? ((z = c[(i + 24) >> 2] | 0), (z & 127) | 0) : 0) {
+                if (!(((f | 0) != 0) | (((z & 1) | 0) == 0))) uF(e, 74216, t);
+                if (!(((j | 0) != 0) | (((z & 2) | 0) == 0))) uF(e, 74236, u);
+                if ((z & 100) | 0) {
+                  uF(e, 74257, v);
+                  if (!(z & 4)) f = 0;
+                  else {
+                    uF(e, 105986, w);
+                    f = 1;
+                  }
+                  if (z & 64) {
+                    c[y >> 2] = f | 0 ? 100999 : 195059;
+                    uF(e, 74276, y);
+                    f = 1;
+                  }
+                  if ((z & 32) | 0) {
+                    c[A >> 2] = f | 0 ? 100999 : 195059;
+                    uF(e, 74287, A);
+                  }
+                  uF(e, 98744, B);
+                }
+                if ((z & 8) | 0) uF(e, 74302, C);
+                if ((z & 16) | 0) uF(e, 74326, D);
+              }
+              h[E >> 3] = +h[((c[x >> 2] | 0) + 16) >> 3];
+              uF(e, 74348, E);
+              f = (I + 16) | 0;
+              switch (c[(I + 48) >> 2] | 0) {
+                case 5: {
+                  f = c[f >> 2] | 0;
+                  if (c3(f, 137314) | 0) {
+                    c[J >> 2] = f;
+                    uF(e, 74366, J);
+                  }
+                  break;
+                }
+                case 1: {
+                  E = d[(f + 1) >> 0] | 0;
+                  J = d[(f + 2) >> 0] | 0;
+                  c[F >> 2] = d[f >> 0];
+                  c[(F + 4) >> 2] = E;
+                  c[(F + 8) >> 2] = J;
+                  uF(e, 74377, F);
+                  break;
+                }
+                default:
+                  qa(138394, 73558, 486, 74399);
+              }
+              oF(e, 74412) | 0;
+              if (b[H >> 1] & 512) {
+                c[K >> 2] = FK(c[(I + 212) >> 2] | 0) | 0;
+                uF(e, 74414, K);
+                oF(e, 74463) | 0;
+                vF(e, -G);
+                oF(e, 74481) | 0;
+              }
+              oF(e, GK(c[g >> 2] | 0, 1) | 0) | 0;
+              if (b[H >> 1] & 512) uF(e, 74484, L);
+              oF(e, 74504) | 0;
+              l = M;
+              return;
+            }
+            function ge(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0;
+              switch (c | 0) {
+                case 2: {
+                  d = ne(a, b, 2) | 0;
+                  break;
+                }
+                case 3: {
+                  d = oe(a) | 0;
+                  break;
+                }
+                default:
+                  d = 0;
+              }
+              oF(a, 74008) | 0;
+              le(a, c, d);
+              oF(a, 74017) | 0;
+              vF(a, +h[b >> 3]);
+              oF(a, 74023) | 0;
+              c = (b + 8) | 0;
+              vF(a, -+h[c >> 3]);
+              oF(a, 74030) | 0;
+              vF(a, +h[(b + 16) >> 3] - +h[b >> 3]);
+              oF(a, 74037) | 0;
+              vF(a, +h[(b + 24) >> 3] - +h[c >> 3]);
+              oF(a, 73424) | 0;
+              return;
+            }
+            function he(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0;
+              switch (d | 0) {
+                case 2: {
+                  e = ne(a, b, c) | 0;
+                  break;
+                }
+                case 3: {
+                  e = oe(a) | 0;
+                  break;
+                }
+                default:
+                  e = 0;
+              }
+              oF(a, 73999) | 0;
+              le(a, d, e);
+              oF(a, 73414) | 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (c | 0)) break;
+                vF(a, +h[(b + (e << 4)) >> 3]);
+                oF(a, 100999) | 0;
+                vF(a, -+h[(b + (e << 4) + 8) >> 3]);
+                oF(a, 102604) | 0;
+                e = (e + 1) | 0;
+              }
+              vF(a, +h[b >> 3]);
+              oF(a, 100999) | 0;
+              vF(a, -+h[(b + 8) >> 3]);
+              oF(a, 73424) | 0;
+              return;
+            }
+            function ie(a, d, e, f, g, h) {
+              a = a | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              g = c[(a + 16) >> 2] | 0;
+              switch (h | 0) {
+                case 2: {
+                  f = ne(a, d, e) | 0;
+                  break;
+                }
+                case 3: {
+                  f = oe(a) | 0;
+                  break;
+                }
+                default:
+                  f = 0;
+              }
+              oF(a, 73594) | 0;
+              if (b[(g + 260) >> 1] & 512) {
+                oF(a, 73600) | 0;
+                oF(a, FK(c[(g + 212) >> 2] | 0) | 0) | 0;
+                oF(a, 73606) | 0;
+              }
+              le(a, h, f);
+              oF(a, 73611) | 0;
+              pe(a, d, e);
+              oF(a, 73424) | 0;
+              return;
+            }
+            function je(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0;
+              oF(a, 73404) | 0;
+              le(a, 0, 0);
+              oF(a, 73414) | 0;
+              d = 0;
+              while (1) {
+                if ((d | 0) >= (c | 0)) break;
+                vF(a, +h[(b + (d << 4)) >> 3]);
+                oF(a, 100999) | 0;
+                vF(a, -+h[(b + (d << 4) + 8) >> 3]);
+                oF(a, 102604) | 0;
+                d = (d + 1) | 0;
+              }
+              oF(a, 73424) | 0;
+              return;
+            }
+            function ke(a, b) {
+              a = a | 0;
+              b = b | 0;
+              oF(a, 73398) | 0;
+              oF(a, FK(b) | 0) | 0;
+              oF(a, 75458) | 0;
+              return;
+            }
+            function le(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              q = l;
+              l = (l + 96) | 0;
+              k = (q + 48) | 0;
+              p = (q + 40) | 0;
+              n = (q + 32) | 0;
+              o = (q + 24) | 0;
+              j = (q + 16) | 0;
+              g = (q + 8) | 0;
+              f = q;
+              m = c[(b + 16) >> 2] | 0;
+              oF(b, 73429) | 0;
+              a: do
+                switch (d | 0) {
+                  case 2: {
+                    c[f >> 2] = e;
+                    uF(b, 73437, f);
+                    break;
+                  }
+                  case 3: {
+                    c[g >> 2] = e;
+                    uF(b, 73448, g);
+                    break;
+                  }
+                  case 0: {
+                    oF(b, 135709) | 0;
+                    break;
+                  }
+                  default: {
+                    d = (m + 56) | 0;
+                    f = k;
+                    g = d;
+                    i = (f + 40) | 0;
+                    do {
+                      c[f >> 2] = c[g >> 2];
+                      f = (f + 4) | 0;
+                      g = (g + 4) | 0;
+                    } while ((f | 0) < (i | 0));
+                    me(b, k);
+                    if ((c[(m + 88) >> 2] | 0) == 1) {
+                      d = a[(d + 3) >> 0] | 0;
+                      switch ((d << 24) >> 24) {
+                        case -1:
+                        case 0:
+                          break a;
+                        default: {
+                        }
+                      }
+                      h[j >> 3] = +(d & 255) * 0.00392156862745098;
+                      uF(b, 73459, j);
+                    }
+                  }
+                }
+              while (0);
+              oF(b, 73478) | 0;
+              e = (m + 16) | 0;
+              f = k;
+              g = e;
+              i = (f + 40) | 0;
+              do {
+                c[f >> 2] = c[g >> 2];
+                f = (f + 4) | 0;
+                g = (g + 4) | 0;
+              } while ((f | 0) < (i | 0));
+              me(b, k);
+              d = (m + 152) | 0;
+              if (+h[d >> 3] != 1.0) {
+                oF(b, 73489) | 0;
+                vF(b, +h[d >> 3]);
+              }
+              switch (c[(m + 144) >> 2] | 0) {
+                case 1: {
+                  c[o >> 2] = 73529;
+                  uF(b, 73506, o);
+                  break;
+                }
+                case 2: {
+                  c[n >> 2] = 73533;
+                  uF(b, 73506, n);
+                  break;
+                }
+                default: {
+                }
+              }
+              b: do
+                if ((c[(m + 48) >> 2] | 0) == 1) {
+                  d = a[(e + 3) >> 0] | 0;
+                  switch ((d << 24) >> 24) {
+                    case -1:
+                    case 0:
+                      break b;
+                    default: {
+                    }
+                  }
+                  h[p >> 3] = +(d & 255) * 0.00392156862745098;
+                  uF(b, 73537, p);
+                }
+              while (0);
+              oF(b, 98744) | 0;
+              l = q;
+              return;
+            }
+            function me(b, e) {
+              b = b | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              g = l;
+              l = (l + 16) | 0;
+              f = g;
+              a: do
+                switch (c[(e + 32) >> 2] | 0) {
+                  case 5: {
+                    oF(b, c[e >> 2] | 0) | 0;
+                    break;
+                  }
+                  case 1:
+                    if (!(a[(e + 3) >> 0] | 0)) {
+                      oF(b, 137379) | 0;
+                      break a;
+                    } else {
+                      i = d[(e + 1) >> 0] | 0;
+                      h = d[(e + 2) >> 0] | 0;
+                      c[f >> 2] = d[e >> 0];
+                      c[(f + 4) >> 2] = i;
+                      c[(f + 8) >> 2] = h;
+                      uF(b, 75714, f);
+                      break a;
+                    }
+                  default:
+                    qa(138394, 73558, 117, 73578);
+                }
+              while (0);
+              l = g;
+              return;
+            }
+            function ne(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0;
+              t = l;
+              l = (l + 112) | 0;
+              o = (t + 64) | 0;
+              r = (t + 56) | 0;
+              n = (t + 48) | 0;
+              m = (t + 40) | 0;
+              i = (t + 32) | 0;
+              k = t;
+              q = c[46722] | 0;
+              c[46722] = q + 1;
+              p = c[(b + 16) >> 2] | 0;
+              f = +(c[(p + 136) >> 2] | 0) * 0.017453292519943295;
+              c[k >> 2] = 0;
+              c[(k + 4) >> 2] = 0;
+              c[(k + 8) >> 2] = 0;
+              c[(k + 12) >> 2] = 0;
+              c[(k + 16) >> 2] = 0;
+              c[(k + 20) >> 2] = 0;
+              c[(k + 24) >> 2] = 0;
+              c[(k + 28) >> 2] = 0;
+              pQ(d, k, e, f, 0);
+              c[o >> 2] = q;
+              uF(b, 73831, o);
+              oF(b, 73896) | 0;
+              vF(b, +h[k >> 3]);
+              oF(b, 73901) | 0;
+              vF(b, +h[(k + 8) >> 3]);
+              oF(b, 73908) | 0;
+              vF(b, +h[(k + 16) >> 3]);
+              oF(b, 73915) | 0;
+              vF(b, +h[(k + 24) >> 3]);
+              oF(b, 73922) | 0;
+              k = (p + 140) | 0;
+              f = +g[k >> 2];
+              if (f > 0.0) {
+                h[i >> 3] = f + -0.001;
+                uF(b, 73927, i);
+              } else oF(b, 73703) | 0;
+              d = (p + 56) | 0;
+              e = o;
+              i = d;
+              j = (e + 40) | 0;
+              do {
+                c[e >> 2] = c[i >> 2];
+                e = (e + 4) | 0;
+                i = (i + 4) | 0;
+              } while ((e | 0) < (j | 0));
+              me(b, o);
+              oF(b, 73739) | 0;
+              a: do
+                if ((c[(p + 88) >> 2] | 0) == 1) {
+                  d = a[(d + 3) >> 0] | 0;
+                  switch ((d << 24) >> 24) {
+                    case -1:
+                    case 0: {
+                      s = 7;
+                      break a;
+                    }
+                    default: {
+                    }
+                  }
+                  h[m >> 3] = +(d & 255) * 0.00392156862745098;
+                  uF(b, 99612, m);
+                } else s = 7;
+              while (0);
+              if ((s | 0) == 7) oF(b, 73754) | 0;
+              oF(b, 73757) | 0;
+              f = +g[k >> 2];
+              if (f > 0.0) {
+                h[n >> 3] = f;
+                uF(b, 73927, n);
+              } else oF(b, 73763) | 0;
+              d = (p + 96) | 0;
+              e = o;
+              i = d;
+              j = (e + 40) | 0;
+              do {
+                c[e >> 2] = c[i >> 2];
+                e = (e + 4) | 0;
+                i = (i + 4) | 0;
+              } while ((e | 0) < (j | 0));
+              me(b, o);
+              oF(b, 73739) | 0;
+              b: do
+                if ((c[(p + 128) >> 2] | 0) == 1) {
+                  d = a[(d + 3) >> 0] | 0;
+                  switch ((d << 24) >> 24) {
+                    case -1:
+                    case 0: {
+                      s = 14;
+                      break b;
+                    }
+                    default: {
+                    }
+                  }
+                  h[r >> 3] = +(d & 255) * 0.00392156862745098;
+                  uF(b, 99612, r);
+                } else s = 14;
+              while (0);
+              if ((s | 0) == 14) oF(b, 73754) | 0;
+              oF(b, 73967) | 0;
+              l = t;
+              return q | 0;
+            }
+            function oe(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0.0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0.0;
+              q = l;
+              l = (l + 64) | 0;
+              k = (q + 16) | 0;
+              o = (q + 8) | 0;
+              j = q;
+              n = c[46721] | 0;
+              c[46721] = n + 1;
+              m = c[(b + 16) >> 2] | 0;
+              r = +(c[(m + 136) >> 2] | 0) * 0.017453292519943295;
+              e = r;
+              if (r == 0.0) {
+                f = 50;
+                d = 50;
+              } else {
+                f = ~~((+E(+e) + 1.0) * 50.0);
+                d = ~~((1.0 - +F(+e)) * 50.0);
+              }
+              c[k >> 2] = n;
+              c[(k + 4) >> 2] = f;
+              c[(k + 8) >> 2] = d;
+              uF(b, 73619, k);
+              oF(b, 73703) | 0;
+              d = (m + 56) | 0;
+              f = k;
+              g = d;
+              i = (f + 40) | 0;
+              do {
+                c[f >> 2] = c[g >> 2];
+                f = (f + 4) | 0;
+                g = (g + 4) | 0;
+              } while ((f | 0) < (i | 0));
+              me(b, k);
+              oF(b, 73739) | 0;
+              a: do
+                if ((c[(m + 88) >> 2] | 0) == 1) {
+                  d = a[(d + 3) >> 0] | 0;
+                  switch ((d << 24) >> 24) {
+                    case -1:
+                    case 0: {
+                      p = 6;
+                      break a;
+                    }
+                    default: {
+                    }
+                  }
+                  h[j >> 3] = +(d & 255) * 0.00392156862745098;
+                  uF(b, 99612, j);
+                } else p = 6;
+              while (0);
+              if ((p | 0) == 6) oF(b, 73754) | 0;
+              oF(b, 73757) | 0;
+              oF(b, 73763) | 0;
+              d = (m + 96) | 0;
+              f = k;
+              g = d;
+              i = (f + 40) | 0;
+              do {
+                c[f >> 2] = c[g >> 2];
+                f = (f + 4) | 0;
+                g = (g + 4) | 0;
+              } while ((f | 0) < (i | 0));
+              me(b, k);
+              oF(b, 73739) | 0;
+              b: do
+                if ((c[(m + 128) >> 2] | 0) == 1) {
+                  d = a[(d + 3) >> 0] | 0;
+                  switch ((d << 24) >> 24) {
+                    case -1:
+                    case 0: {
+                      p = 10;
+                      break b;
+                    }
+                    default: {
+                    }
+                  }
+                  h[o >> 3] = +(d & 255) * 0.00392156862745098;
+                  uF(b, 99612, o);
+                } else p = 10;
+              while (0);
+              if ((p | 0) == 10) oF(b, 73754) | 0;
+              oF(b, 73799) | 0;
+              l = q;
+              return n | 0;
+            }
+            function pe(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0;
+              i = l;
+              l = (l + 16) | 0;
+              g = i;
+              e = 77;
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (d | 0)) break;
+                c[g >> 2] = e;
+                uF(a, 73616, g);
+                vF(a, +h[(b + (f << 4)) >> 3]);
+                oF(a, 100999) | 0;
+                vF(a, -+h[(b + (f << 4) + 8) >> 3]);
+                e = (f | 0) == 0 ? 67 : 32;
+                f = (f + 1) | 0;
+              }
+              l = i;
+              return;
+            }
+            function qe(b, d, e, f, g) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 16) | 0;
+              i = (j + 8) | 0;
+              h = j;
+              oF(b, 74587) | 0;
+              oF(b, FK(d) | 0) | 0;
+              if (e | 0) {
+                c[h >> 2] = FK(e) | 0;
+                uF(b, 74595, h);
+              }
+              c[i >> 2] = f;
+              uF(b, 74599, i);
+              d = QA(g, 74611) | 0;
+              if (d | 0 ? a[d >> 0] | 0 : 0) {
+                oF(b, 102604) | 0;
+                oF(b, FK(d) | 0) | 0;
+              }
+              oF(b, 98744) | 0;
+              l = j;
+              return;
+            }
+            function re(a) {
+              a = a | 0;
+              var b = 0;
+              oF(a, 75418) | 0;
+              b = (a + 12) | 0;
+              oF(a, Be(c[c[c[b >> 2] >> 2] >> 2] | 0) | 0) | 0;
+              oF(a, 78181) | 0;
+              oF(a, Be(c[((c[c[b >> 2] >> 2] | 0) + 4) >> 2] | 0) | 0) | 0;
+              oF(a, 78191) | 0;
+              oF(a, Be(c[((c[c[b >> 2] >> 2] | 0) + 8) >> 2] | 0) | 0) | 0;
+              oF(a, 75434) | 0;
+              return;
+            }
+            function se(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              f = l;
+              l = (l + 16) | 0;
+              e = f;
+              d = c[(b + 16) >> 2] | 0;
+              oF(b, 75395) | 0;
+              d = (d + 8) | 0;
+              if (a[(KB(c[d >> 2] | 0) | 0) >> 0] | 0) {
+                oF(b, 75397) | 0;
+                oF(b, Be(KB(c[d >> 2] | 0) | 0) | 0) | 0;
+              }
+              c[e >> 2] = O(c[(b + 168) >> 2] | 0, c[(b + 164) >> 2] | 0) | 0;
+              uF(b, 75406, e);
+              c[46723] = 0;
+              l = f;
+              return;
+            }
+            function te(a) {
+              a = a | 0;
+              c[46723] = 1;
+              return;
+            }
+            function ue(a) {
+              a = a | 0;
+              c[46723] = -1;
+              return;
+            }
+            function ve(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              n = l;
+              l = (l + 48) | 0;
+              i = (n + 8) | 0;
+              m = n;
+              f = c[(b + 16) >> 2] | 0;
+              if (
+                c[(f + 144) >> 2] | 0
+                  ? ((k = (e + 4) | 0), (j = ~~(+h[(b + 352) >> 3] * +h[((c[k >> 2] | 0) + 16) >> 3])), j | 0)
+                  : 0
+              ) {
+                Ce(b);
+                oF(b, 75334) | 0;
+                g = (d + 8) | 0;
+                h[g >> 3] = +h[g >> 3] - +(j | 0) * 0.55;
+                c[i >> 2] = c[d >> 2];
+                c[(i + 4) >> 2] = c[(d + 4) >> 2];
+                c[(i + 8) >> 2] = c[(d + 8) >> 2];
+                c[(i + 12) >> 2] = c[(d + 12) >> 2];
+                xF(b, i);
+                oF(b, 75348) | 0;
+                oF(b, c[e >> 2] | 0) | 0;
+                oF(b, 75357) | 0;
+                oF(b, 75155) | 0;
+                g = i;
+                d = (f + 16) | 0;
+                f = (g + 40) | 0;
+                do {
+                  c[g >> 2] = c[d >> 2];
+                  g = (g + 4) | 0;
+                  d = (d + 4) | 0;
+                } while ((g | 0) < (f | 0));
+                De(b, i);
+                oF(b, 75359) | 0;
+                i = c[k >> 2] | 0;
+                k = c[(i + 8) >> 2] | 0;
+                k = c[((k | 0) == 0 ? i : (k + 4) | 0) >> 2] | 0;
+                oF(b, 98744) | 0;
+                oF(b, k) | 0;
+                oF(b, 98744) | 0;
+                c[m >> 2] = j;
+                uF(b, 75368, m);
+                switch (a[(e + 48) >> 0] | 0) {
+                  case 108: {
+                    oF(b, 75373) | 0;
+                    break;
+                  }
+                  case 114: {
+                    oF(b, 75384) | 0;
+                    break;
+                  }
+                  default: {
+                  }
+                }
+                Ee(b);
+                oF(b, 153599) | 0;
+              }
+              l = n;
+              return;
+            }
+            function we(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0.0,
+                m = 0.0,
+                n = 0.0;
+              j = l;
+              l = (l + 48) | 0;
+              f = j;
+              g = c[(a + 16) >> 2] | 0;
+              i = (g + 144) | 0;
+              if (c[i >> 2] | 0) {
+                n = +h[b >> 3];
+                m = +h[(b + 24) >> 3];
+                e = (b + 8) | 0;
+                k = +h[e >> 3];
+                h[b >> 3] = n - +h[(b + 16) >> 3] + n;
+                h[e >> 3] = k - m + k;
+                Ce(a);
+                oF(a, 75320) | 0;
+                yF(a, b, 2);
+                oF(a, 75155) | 0;
+                do
+                  if (!d)
+                    if (!(c[46723] | 0)) {
+                      oF(a, 97309) | 0;
+                      break;
+                    } else {
+                      oF(a, 137198) | 0;
+                      break;
+                    }
+                  else {
+                    b = f;
+                    d = (g + 56) | 0;
+                    e = (b + 40) | 0;
+                    do {
+                      c[b >> 2] = c[d >> 2];
+                      b = (b + 4) | 0;
+                      d = (d + 4) | 0;
+                    } while ((b | 0) < (e | 0));
+                    De(a, f);
+                  }
+                while (0);
+                if ((c[46723] | 0) == 1) c[46723] = 0;
+                oF(a, 75266) | 0;
+                vF(a, +h[(g + 152) >> 3]);
+                oF(a, 75309) | 0;
+                b = f;
+                d = (g + 16) | 0;
+                e = (b + 40) | 0;
+                do {
+                  c[b >> 2] = c[d >> 2];
+                  b = (b + 4) | 0;
+                  d = (d + 4) | 0;
+                } while ((b | 0) < (e | 0));
+                De(a, f);
+                b = c[i >> 2] | 0;
+                if ((b | 0) == 1) {
+                  oF(a, 75163) | 0;
+                  b = c[i >> 2] | 0;
+                }
+                if ((b | 0) == 2) oF(a, 75172) | 0;
+                Ee(a);
+                oF(a, 153599) | 0;
+              }
+              l = j;
+              return;
+            }
+            function xe(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 48) | 0;
+              f = j;
+              g = c[(a + 16) >> 2] | 0;
+              i = (g + 144) | 0;
+              if (c[i >> 2] | 0) {
+                Ce(a);
+                oF(a, 75292) | 0;
+                yF(a, b, d);
+                oF(a, 75155) | 0;
+                do
+                  if (!e)
+                    if (!(c[46723] | 0)) {
+                      oF(a, 97309) | 0;
+                      break;
+                    } else {
+                      oF(a, 137198) | 0;
+                      break;
+                    }
+                  else {
+                    b = f;
+                    d = (g + 56) | 0;
+                    e = (b + 40) | 0;
+                    do {
+                      c[b >> 2] = c[d >> 2];
+                      b = (b + 4) | 0;
+                      d = (d + 4) | 0;
+                    } while ((b | 0) < (e | 0));
+                    De(a, f);
+                  }
+                while (0);
+                if ((c[46723] | 0) == 1) c[46723] = 0;
+                oF(a, 75266) | 0;
+                vF(a, +h[(g + 152) >> 3]);
+                oF(a, 75309) | 0;
+                b = f;
+                d = (g + 16) | 0;
+                e = (b + 40) | 0;
+                do {
+                  c[b >> 2] = c[d >> 2];
+                  b = (b + 4) | 0;
+                  d = (d + 4) | 0;
+                } while ((b | 0) < (e | 0));
+                De(a, f);
+                b = c[i >> 2] | 0;
+                if ((b | 0) == 1) {
+                  oF(a, 75163) | 0;
+                  b = c[i >> 2] | 0;
+                }
+                if ((b | 0) == 2) oF(a, 75172) | 0;
+                Ee(a);
+                oF(a, 153599) | 0;
+              }
+              l = j;
+              return;
+            }
+            function ye(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              m = l;
+              l = (l + 48) | 0;
+              i = m;
+              j = c[(a + 16) >> 2] | 0;
+              k = (j + 144) | 0;
+              if (c[k >> 2] | 0) {
+                Ce(a);
+                oF(a, 75141) | 0;
+                yF(a, b, d);
+                oF(a, 75155) | 0;
+                e = i;
+                f = (j + 16) | 0;
+                g = (e + 40) | 0;
+                do {
+                  c[e >> 2] = c[f >> 2];
+                  e = (e + 4) | 0;
+                  f = (f + 4) | 0;
+                } while ((e | 0) < (g | 0));
+                De(a, i);
+                oF(a, 75266) | 0;
+                vF(a, +h[(j + 152) >> 3]);
+                e = c[k >> 2] | 0;
+                if ((e | 0) == 1) {
+                  oF(a, 75163) | 0;
+                  e = c[k >> 2] | 0;
+                }
+                if ((e | 0) == 2) oF(a, 75172) | 0;
+                oF(a, 75275) | 0;
+                Ee(a);
+                oF(a, 153599) | 0;
+              }
+              l = m;
+              return;
+            }
+            function ze(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 48) | 0;
+              g = i;
+              e = c[(a + 16) >> 2] | 0;
+              h = (e + 144) | 0;
+              if (c[h >> 2] | 0) {
+                Ce(a);
+                oF(a, 75141) | 0;
+                yF(a, b, d);
+                oF(a, 75155) | 0;
+                f = g;
+                b = (e + 16) | 0;
+                d = (f + 40) | 0;
+                do {
+                  c[f >> 2] = c[b >> 2];
+                  f = (f + 4) | 0;
+                  b = (b + 4) | 0;
+                } while ((f | 0) < (d | 0));
+                De(a, g);
+                b = c[h >> 2] | 0;
+                if ((b | 0) == 1) {
+                  oF(a, 75163) | 0;
+                  b = c[h >> 2] | 0;
+                }
+                if ((b | 0) == 2) oF(a, 75172) | 0;
+                Ee(a);
+                oF(a, 153599) | 0;
+              }
+              l = i;
+              return;
+            }
+            function Ae(a, b) {
+              a = a | 0;
+              b = b | 0;
+              oF(a, 75138) | 0;
+              oF(a, Be(b) | 0) | 0;
+              oF(a, 153599) | 0;
+              return;
+            }
+            function Be(a) {
+              a = a | 0;
+              return a | 0;
+            }
+            function Ce(b) {
+              b = b | 0;
+              if (!(a[(b + 144) >> 0] | 0)) oF(b, 75263) | 0;
+              else oF(b, c[(b + 148) >> 2] | 0) | 0;
+              return;
+            }
+            function De(b, e) {
+              b = b | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              g = l;
+              l = (l + 16) | 0;
+              f = g;
+              a: do
+                switch (c[(e + 32) >> 2] | 0) {
+                  case 5: {
+                    oF(b, c[e >> 2] | 0) | 0;
+                    break;
+                  }
+                  case 1:
+                    if (!(a[(e + 3) >> 0] | 0)) {
+                      oF(b, 97309) | 0;
+                      break a;
+                    } else {
+                      i = d[(e + 1) >> 0] | 0;
+                      h = d[(e + 2) >> 0] | 0;
+                      c[f >> 2] = d[e >> 0];
+                      c[(f + 4) >> 2] = i;
+                      c[(f + 8) >> 2] = h;
+                      uF(b, 75714, f);
+                      break a;
+                    }
+                  default:
+                    qa(138394, 75181, 49, 75245);
+                }
+              while (0);
+              l = g;
+              return;
+            }
+            function Ee(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 16) | 0;
+              g = h;
+              f = c[(a + 16) >> 2] | 0;
+              switch (c[(f + 12) >> 2] | 0) {
+                case 8: {
+                  b = 1;
+                  d = 111481;
+                  e = (f + 8) | 0;
+                  break;
+                }
+                case 10: {
+                  b = 0;
+                  d = 111481;
+                  e = (f + 8) | 0;
+                  break;
+                }
+                case 3:
+                case 2:
+                case 9: {
+                  b = 1;
+                  d = 111450;
+                  e = (f + 8) | 0;
+                  break;
+                }
+                case 7:
+                case 6:
+                case 11: {
+                  b = 0;
+                  d = 111450;
+                  e = (f + 8) | 0;
+                  break;
+                }
+                case 0: {
+                  b = 1;
+                  d = 111494;
+                  e = (f + 8) | 0;
+                  break;
+                }
+                case 4: {
+                  b = 0;
+                  d = 75217;
+                  e = (f + 8) | 0;
+                  break;
+                }
+                case 1: {
+                  b = 1;
+                  d = 111494;
+                  e = (f + 8) | 0;
+                  break;
+                }
+                case 5: {
+                  b = 0;
+                  d = 111494;
+                  e = (f + 8) | 0;
+                  break;
+                }
+                default:
+                  qa(138394, 75181, 106, 75200);
+              }
+              f = c[((c[e >> 2] | 0) + 8) >> 2] | 0;
+              c[g >> 2] = b;
+              c[(g + 4) >> 2] = d;
+              c[(g + 8) >> 2] = f;
+              uF(a, 75229, g);
+              l = h;
+              return;
+            }
+            function Fe(a) {
+              a = a | 0;
+              var b = 0;
+              oF(a, 78153) | 0;
+              oF(a, 78161) | 0;
+              b = (a + 12) | 0;
+              oF(a, Qe(c[c[c[b >> 2] >> 2] >> 2] | 0) | 0) | 0;
+              oF(a, 78181) | 0;
+              oF(a, Qe(c[((c[c[b >> 2] >> 2] | 0) + 4) >> 2] | 0) | 0) | 0;
+              oF(a, 78191) | 0;
+              oF(a, Qe(c[((c[c[b >> 2] >> 2] | 0) + 8) >> 2] | 0) | 0) | 0;
+              oF(a, 78194) | 0;
+              return;
+            }
+            function Ge(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 32) | 0;
+              i = (j + 24) | 0;
+              g = (j + 16) | 0;
+              f = (j + 8) | 0;
+              e = j;
+              d = c[(b + 16) >> 2] | 0;
+              c[46727] = ~~(+h[(b + 232) >> 3] - +h[(b + 216) >> 3]);
+              c[46726] = ~~(+h[(b + 224) >> 3] - +h[(b + 208) >> 3]);
+              oF(b, 76840) | 0;
+              oF(b, 76847) | 0;
+              d = KB(c[(d + 8) >> 2] | 0) | 0;
+              if (a[d >> 0] | 0) {
+                oF(b, 76916) | 0;
+                oF(b, Qe(d) | 0) | 0;
+                oF(b, 76924) | 0;
+              }
+              c[e >> 2] = O(c[(b + 168) >> 2] | 0, c[(b + 164) >> 2] | 0) | 0;
+              uF(b, 76933, e);
+              oF(b, 76953) | 0;
+              oF(b, 76988) | 0;
+              oF(b, 77016) | 0;
+              oF(b, 77022) | 0;
+              oF(b, 77065) | 0;
+              oF(b, 77106) | 0;
+              oF(b, 77125) | 0;
+              oF(b, 77142) | 0;
+              oF(b, 77190) | 0;
+              oF(b, 77243) | 0;
+              oF(b, 77319) | 0;
+              oF(b, 77395) | 0;
+              oF(b, 77404) | 0;
+              oF(b, 77427) | 0;
+              oF(b, 77454) | 0;
+              oF(b, 77507) | 0;
+              oF(b, 77529) | 0;
+              oF(b, 77574) | 0;
+              oF(b, 77586) | 0;
+              oF(b, 77596) | 0;
+              oF(b, 77622) | 0;
+              oF(b, 77507) | 0;
+              oF(b, 77674) | 0;
+              oF(b, 77574) | 0;
+              oF(b, 77586) | 0;
+              oF(b, 77718) | 0;
+              oF(b, 77427) | 0;
+              oF(b, 77454) | 0;
+              oF(b, 77507) | 0;
+              oF(b, 77674) | 0;
+              oF(b, 77574) | 0;
+              oF(b, 77586) | 0;
+              oF(b, 77596) | 0;
+              oF(b, 77622) | 0;
+              oF(b, 77507) | 0;
+              oF(b, 77529) | 0;
+              oF(b, 77574) | 0;
+              oF(b, 77586) | 0;
+              oF(b, 77731) | 0;
+              oF(b, 77739) | 0;
+              oF(b, 77745) | 0;
+              oF(b, 77759) | 0;
+              oF(b, 77767) | 0;
+              oF(b, 77800) | 0;
+              e = ((c[46727] | 0) + 10) | 0;
+              c[f >> 2] = c[46726];
+              c[(f + 4) >> 2] = e;
+              uF(b, 77877, f);
+              oF(b, 77907) | 0;
+              oF(b, 77916) | 0;
+              oF(b, 77974) | 0;
+              oF(b, 77984) | 0;
+              oF(b, 78049) | 0;
+              f = c[46727] | 0;
+              c[g >> 2] = c[46726];
+              c[(g + 4) >> 2] = f;
+              uF(b, 78086, g);
+              g = c[46727] | 0;
+              c[i >> 2] = c[46726];
+              c[(i + 4) >> 2] = g;
+              uF(b, 78114, i);
+              l = j;
+              return;
+            }
+            function He(a) {
+              a = a | 0;
+              oF(a, 76391) | 0;
+              oF(a, 76403) | 0;
+              oF(a, 76411) | 0;
+              oF(a, 76474) | 0;
+              oF(a, 76403) | 0;
+              oF(a, 76519) | 0;
+              oF(a, 76568) | 0;
+              oF(a, 76622) | 0;
+              oF(a, 76403) | 0;
+              oF(a, 76722) | 0;
+              oF(a, 76771) | 0;
+              oF(a, 76403) | 0;
+              oF(a, 76823) | 0;
+              return;
+            }
+            function Ie(b, d, e, f, g) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 32) | 0;
+              i = (j + 16) | 0;
+              h = (j + 8) | 0;
+              g = j;
+              oF(b, 76349) | 0;
+              if (d | 0 ? a[d >> 0] | 0 : 0) {
+                c[g >> 2] = Qe(d) | 0;
+                uF(b, 76352, g);
+              }
+              if (e | 0 ? a[e >> 0] | 0 : 0) {
+                c[h >> 2] = Qe(e) | 0;
+                uF(b, 76363, h);
+              }
+              if (f | 0 ? a[f >> 0] | 0 : 0) {
+                c[i >> 2] = Qe(f) | 0;
+                uF(b, 76375, i);
+              }
+              oF(b, 76388) | 0;
+              l = j;
+              return;
+            }
+            function Je(a) {
+              a = a | 0;
+              oF(a, 76343) | 0;
+              return;
+            }
+            function Ke(b, e, f) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                m = 0.0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0.0;
+              A = l;
+              l = (l + 112) | 0;
+              y = (A + 96) | 0;
+              z = (A + 88) | 0;
+              w = (A + 80) | 0;
+              q = (A + 72) | 0;
+              v = (A + 64) | 0;
+              t = (A + 56) | 0;
+              s = (A + 48) | 0;
+              r = (A + 40) | 0;
+              p = (A + 24) | 0;
+              o = (A + 8) | 0;
+              n = A;
+              x = c[(b + 16) >> 2] | 0;
+              switch (a[(f + 48) >> 0] | 0) {
+                case 108: {
+                  j = +h[e >> 3];
+                  m = +h[(f + 32) >> 3];
+                  break;
+                }
+                case 114: {
+                  m = +h[(f + 32) >> 3];
+                  j = +h[e >> 3] - m;
+                  break;
+                }
+                default: {
+                  m = +h[(f + 32) >> 3];
+                  j = +h[e >> 3] - m * 0.5;
+                }
+              }
+              g = (f + 40) | 0;
+              i = +h[g >> 3];
+              u = (f + 4) | 0;
+              k = +h[((c[u >> 2] | 0) + 16) >> 3];
+              if (i < k) {
+                i = k * 1.1 + 1.0;
+                h[g >> 3] = i;
+              }
+              B = j + -8.0;
+              k = +((c[46727] | 0) >>> 0) - +h[(e + 8) >> 3] - i + k * 0.2 + (k < 12.0 ? 1.4 : 2.0);
+              uF(b, 76005, n);
+              h[o >> 3] = B;
+              h[(o + 8) >> 3] = k;
+              uF(b, 75942, o);
+              h[p >> 3] = j + 8.0 + m - B;
+              h[(p + 8) >> 3] = i;
+              uF(b, 75966, p);
+              oF(b, 76040) | 0;
+              oF(b, 76074) | 0;
+              g = c[u >> 2] | 0;
+              e = c[(g + 8) >> 2] | 0;
+              if (e) {
+                c[r >> 2] = c[(e + 4) >> 2];
+                uF(b, 76164, r);
+                g = c[(e + 8) >> 2] | 0;
+                if (g | 0) {
+                  c[s >> 2] = g;
+                  uF(b, 76183, s);
+                }
+                g = c[(e + 12) >> 2] | 0;
+                if (g | 0) {
+                  c[t >> 2] = g;
+                  uF(b, 76200, t);
+                }
+                g = c[(e + 16) >> 2] | 0;
+                if (g | 0) {
+                  c[v >> 2] = g;
+                  uF(b, 76218, v);
+                }
+              } else {
+                c[q >> 2] = c[g >> 2];
+                uF(b, 76164, q);
+              }
+              h[w >> 3] = +h[((c[u >> 2] | 0) + 16) >> 3];
+              uF(b, 76234, w);
+              g = (x + 16) | 0;
+              switch (c[(x + 48) >> 2] | 0) {
+                case 5: {
+                  g = c[g >> 2] | 0;
+                  if (c3(g, 137314) | 0) {
+                    c[z >> 2] = g;
+                    uF(b, 76254, z);
+                  }
+                  break;
+                }
+                case 1: {
+                  x = d[(g + 1) >> 0] | 0;
+                  z = d[(g + 2) >> 0] | 0;
+                  c[y >> 2] = d[g >> 0];
+                  c[(y + 4) >> 2] = x;
+                  c[(y + 8) >> 2] = z;
+                  uF(b, 76264, y);
+                  break;
+                }
+                default:
+                  qa(138394, 75728, 438, 76285);
+              }
+              oF(b, 76298) | 0;
+              oF(b, Qe(c[f >> 2] | 0) | 0) | 0;
+              oF(b, 76309) | 0;
+              oF(b, 76332) | 0;
+              l = A;
+              return;
+            }
+            function Le(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0.0,
+                m = 0.0;
+              e = l;
+              l = (l + 32) | 0;
+              f = (e + 16) | 0;
+              j = e;
+              oF(a, 75906) | 0;
+              m = +h[b >> 3];
+              i = +h[(b + 16) >> 3] - m;
+              k = +h[(b + 24) >> 3];
+              g = k - +h[(b + 8) >> 3];
+              k = +((c[46727] | 0) >>> 0) - k;
+              h[j >> 3] = m - i;
+              h[(j + 8) >> 3] = k;
+              uF(a, 75942, j);
+              h[f >> 3] = i * 2.0;
+              h[(f + 8) >> 3] = g * 2.0;
+              uF(a, 75966, f);
+              Ue(a, d);
+              oF(a, 75788) | 0;
+              Se(a);
+              oF(a, 75994) | 0;
+              l = e;
+              return;
+            }
+            function Me(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0.0,
+                g = 0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              m = l;
+              l = (l + 48) | 0;
+              k = (m + 24) | 0;
+              j = (m + 8) | 0;
+              g = m;
+              oF(a, 75511) | 0;
+              n = c[46727] | 0;
+              c[g >> 2] = c[46726];
+              c[(g + 4) >> 2] = n;
+              uF(a, 75764, g);
+              Ue(a, e);
+              oF(a, 75788) | 0;
+              Se(a);
+              oF(a, 75791) | 0;
+              g = (d + -1) | 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (d | 0)) break;
+                i = +h[(b + (e << 4)) >> 3];
+                f = +((c[46727] | 0) >>> 0) - +h[(b + (e << 4) + 8) >> 3];
+                if (!e) {
+                  oF(a, 75818) | 0;
+                  h[j >> 3] = i;
+                  h[(j + 8) >> 3] = f;
+                  uF(a, 75884, j);
+                  oF(a, 75895) | 0;
+                } else {
+                  h[k >> 3] = i;
+                  h[(k + 8) >> 3] = f;
+                  uF(a, 75884, k);
+                }
+                if ((e | 0) == (g | 0)) oF(a, 75898) | 0;
+                e = (e + 1) | 0;
+              }
+              oF(a, 75627) | 0;
+              l = m;
+              return;
+            }
+            function Ne(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0;
+              f = l;
+              l = (l + 16) | 0;
+              e = f;
+              oF(a, 75511) | 0;
+              h = c[46727] | 0;
+              c[e >> 2] = c[46726];
+              c[(e + 4) >> 2] = h;
+              uF(a, 75764, e);
+              Ue(a, g);
+              oF(a, 75788) | 0;
+              Se(a);
+              oF(a, 75791) | 0;
+              Ve(a, b, d);
+              oF(a, 75804) | 0;
+              l = f;
+              return;
+            }
+            function Oe(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0.0;
+              k = l;
+              l = (l + 48) | 0;
+              j = (k + 24) | 0;
+              i = (k + 8) | 0;
+              f = k;
+              oF(a, 75511) | 0;
+              g = c[46727] | 0;
+              c[f >> 2] = c[46726];
+              c[(f + 4) >> 2] = g;
+              uF(a, 75548, f);
+              oF(a, 75588) | 0;
+              f = (d + -1) | 0;
+              g = (b + 8) | 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (d | 0)) break;
+                if (!e) {
+                  oF(a, 75600) | 0;
+                  m = +((c[46727] | 0) >>> 0) - +h[g >> 3];
+                  h[i >> 3] = +h[b >> 3];
+                  h[(i + 8) >> 3] = m;
+                  uF(a, 75604, i);
+                  oF(a, 75615) | 0;
+                } else {
+                  m = +((c[46727] | 0) >>> 0) - +h[(b + (e << 4) + 8) >> 3];
+                  h[j >> 3] = +h[(b + (e << 4)) >> 3];
+                  h[(j + 8) >> 3] = m;
+                  uF(a, 75604, j);
+                }
+                if ((e | 0) == (f | 0)) oF(a, 75619) | 0;
+                e = (e + 1) | 0;
+              }
+              oF(a, 75623) | 0;
+              Se(a);
+              oF(a, 75627) | 0;
+              l = k;
+              return;
+            }
+            function Pe(a, b) {
+              a = a | 0;
+              b = b | 0;
+              oF(a, 75446) | 0;
+              oF(a, Qe(b) | 0) | 0;
+              oF(a, 75458) | 0;
+              return;
+            }
+            function Qe(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0;
+              u = l;
+              l = (l + 16) | 0;
+              e = u;
+              d = c[46724] | 0;
+              if (!d) {
+                c[46725] = 64;
+                d = KK(64) | 0;
+                c[46724] = d;
+              }
+              s = (e + 15) | 0;
+              r = (e + 14) | 0;
+              g = 0;
+              q = 0;
+              o = 0;
+              e = 0;
+              f = 0;
+              a: while (1) {
+                n = (o | 0) != 0;
+                k = g;
+                p = b;
+                j = e;
+                b: while (1) {
+                  if (!p) {
+                    t = 32;
+                    break a;
+                  }
+                  e = a[p >> 0] | 0;
+                  if (!((e << 24) >> 24)) {
+                    t = 32;
+                    break a;
+                  }
+                  b = c[46725] | 0;
+                  if ((q | 0) > ((b + -8) | 0)) {
+                    d = b << 1;
+                    c[46725] = d;
+                    d = MK(c[46724] | 0, d) | 0;
+                    c[46724] = d;
+                    d = (d + q) | 0;
+                    e = a[p >> 0] | 0;
+                  }
+                  switch ((e << 24) >> 24) {
+                    case 60: {
+                      e = 4;
+                      b = 102153;
+                      t = 26;
+                      break b;
+                    }
+                    case 62: {
+                      e = 4;
+                      b = 102136;
+                      t = 27;
+                      break b;
+                    }
+                    case 38: {
+                      t = 10;
+                      break b;
+                    }
+                    case 45: {
+                      e = 5;
+                      b = 102147;
+                      i = j;
+                      break b;
+                    }
+                    default: {
+                    }
+                  }
+                  if (n & ((e << 24) >> 24 == 32)) {
+                    t = 12;
+                    break;
+                  }
+                  switch ((e << 24) >> 24) {
+                    case 34: {
+                      e = 6;
+                      b = 102116;
+                      t = 26;
+                      break b;
+                    }
+                    case 39: {
+                      e = 5;
+                      b = 102141;
+                      t = 27;
+                      break b;
+                    }
+                    default: {
+                    }
+                  }
+                  if ((e << 24) >> 24 < 0) {
+                    i = 127;
+                    b = 0;
+                  } else {
+                    e = 1;
+                    b = p;
+                    t = 26;
+                    break;
+                  }
+                  while (1) {
+                    g = i & 255;
+                    h = e & 255;
+                    if (g >>> 0 >= h >>> 0) break;
+                    e = i & h & 255;
+                    i = g >>> 1;
+                    b = (b + 1) | 0;
+                  }
+                  if ((b | 0) <= 1) {
+                    g = R6(j | 0, f | 0, 6) | 0;
+                    g = J6(g | 0, z | 0, (e & 255) | 0, 0) | 0;
+                    f = z;
+                    m = (k + -1) | 0;
+                    if ((k | 0) > 1) {
+                      b = m;
+                      e = g;
+                    } else {
+                      t = 21;
+                      break;
+                    }
+                  } else {
+                    b = (b + -1) | 0;
+                    e = e & 255;
+                    f = 0;
+                  }
+                  k = b;
+                  p = (p + 1) | 0;
+                  j = e;
+                }
+                if ((t | 0) == 10) {
+                  t = 0;
+                  b = (Re(p) | 0) == 0;
+                  e = b ? 5 : 1;
+                  b = b ? 102130 : p;
+                  i = j;
+                } else if ((t | 0) == 12) {
+                  t = 0;
+                  b = (a[o >> 0] | 0) == 32;
+                  e = b ? 6 : 1;
+                  b = b ? 102123 : p;
+                  i = j;
+                } else if ((t | 0) == 21) {
+                  t = 0;
+                  a[s >> 0] = 59;
+                  e = 3;
+                  h = r;
+                  i = g;
+                  j = f;
+                  while (1) {
+                    b = O6(i | 0, j | 0, 10, 0) | 0;
+                    g = (h + -1) | 0;
+                    a[h >> 0] = b | 48;
+                    b = i;
+                    i = N6(i | 0, j | 0, 10, 0) | 0;
+                    f = j;
+                    j = z;
+                    o = e;
+                    e = (e + 1) | 0;
+                    if ((o | 0) > 11) {
+                      t = 23;
+                      break a;
+                    }
+                    if (!((f >>> 0 > 0) | (((f | 0) == 0) & (b >>> 0 > 9)))) break;
+                    else h = g;
+                  }
+                  b = (h + -2) | 0;
+                  a[g >> 0] = 35;
+                  a[b >> 0] = 38;
+                  k = m;
+                  f = j;
+                } else if ((t | 0) == 26) {
+                  t = 0;
+                  i = j;
+                } else if ((t | 0) == 27) {
+                  t = 0;
+                  i = j;
+                }
+                h = (d + e) | 0;
+                g = e;
+                while (1) {
+                  if (!g) break;
+                  a[d >> 0] = a[b >> 0] | 0;
+                  g = (g + -1) | 0;
+                  b = (b + 1) | 0;
+                  d = (d + 1) | 0;
+                }
+                g = k;
+                b = (p + 1) | 0;
+                q = (e + q) | 0;
+                o = p;
+                d = h;
+                e = i;
+              }
+              if ((t | 0) == 23) {
+                U4(75464, 46, 1, c[15712] | 0) | 0;
+                Sa(1);
+              } else if ((t | 0) == 32) {
+                a[d >> 0] = 0;
+                l = u;
+                return c[46724] | 0;
+              }
+              return 0;
+            }
+            function Re(b) {
+              b = b | 0;
+              var c = 0,
+                d = 0;
+              d = (b + 1) | 0;
+              c = a[d >> 0] | 0;
+              a: do
+                if ((c << 24) >> 24 == 35) {
+                  d = (b + 2) | 0;
+                  c = a[d >> 0] | 0;
+                  switch ((c << 24) >> 24) {
+                    case 88:
+                    case 120:
+                      break;
+                    default: {
+                      b = d;
+                      while (1) {
+                        d = (b + 1) | 0;
+                        if (((c + -48) & 255) >= 10) break a;
+                        b = d;
+                        c = a[d >> 0] | 0;
+                      }
+                    }
+                  }
+                  d = (b + 3) | 0;
+                  while (1) {
+                    c = a[d >> 0] | 0;
+                    if (((c + -48) & 255) >= 10)
+                      switch ((c << 24) >> 24) {
+                        case 65:
+                        case 66:
+                        case 67:
+                        case 68:
+                        case 69:
+                        case 70:
+                        case 97:
+                        case 98:
+                        case 99:
+                        case 100:
+                        case 101:
+                        case 102:
+                          break;
+                        default:
+                          break a;
+                      }
+                    d = (d + 1) | 0;
+                  }
+                } else
+                  while (1) {
+                    b = (d + 1) | 0;
+                    if ((((c & -33) + -65) & 255) >= 26) break a;
+                    d = b;
+                    c = a[b >> 0] | 0;
+                  }
+              while (0);
+              return ((c << 24) >> 24 == 59) | 0;
+            }
+            function Se(a) {
+              a = a | 0;
+              var b = 0.0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 48) | 0;
+              d = (k + 8) | 0;
+              j = k;
+              i = c[(a + 16) >> 2] | 0;
+              oF(a, 75639) | 0;
+              e = d;
+              f = (i + 16) | 0;
+              g = (e + 40) | 0;
+              do {
+                c[e >> 2] = c[f >> 2];
+                e = (e + 4) | 0;
+                f = (f + 4) | 0;
+              } while ((e | 0) < (g | 0));
+              Te(a, d);
+              b = +h[(i + 152) >> 3];
+              if (b != 1.0) {
+                h[j >> 3] = b;
+                uF(a, 75657, j);
+              }
+              switch (c[(i + 144) >> 2] | 0) {
+                case 1: {
+                  oF(a, 75674) | 0;
+                  break;
+                }
+                case 2: {
+                  oF(a, 75692) | 0;
+                  break;
+                }
+                default: {
+                }
+              }
+              oF(a, 75709) | 0;
+              l = k;
+              return;
+            }
+            function Te(b, e) {
+              b = b | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              g = l;
+              l = (l + 16) | 0;
+              f = g;
+              a: do
+                switch (c[(e + 32) >> 2] | 0) {
+                  case 5: {
+                    oF(b, c[e >> 2] | 0) | 0;
+                    break;
+                  }
+                  case 1:
+                    if (!(a[(e + 3) >> 0] | 0)) {
+                      oF(b, 135709) | 0;
+                      break a;
+                    } else {
+                      i = d[(e + 1) >> 0] | 0;
+                      h = d[(e + 2) >> 0] | 0;
+                      c[f >> 2] = d[e >> 0];
+                      c[(f + 4) >> 2] = i;
+                      c[(f + 8) >> 2] = h;
+                      uF(b, 75714, f);
+                      break a;
+                    }
+                  default:
+                    qa(138394, 75728, 94, 75748);
+                }
+              while (0);
+              l = g;
+              return;
+            }
+            function Ue(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              g = l;
+              l = (l + 48) | 0;
+              f = g;
+              if (!b) oF(a, 75867) | 0;
+              else {
+                d = c[(a + 16) >> 2] | 0;
+                oF(a, 75837) | 0;
+                b = f;
+                d = (d + 56) | 0;
+                e = (b + 40) | 0;
+                do {
+                  c[b >> 2] = c[d >> 2];
+                  b = (b + 4) | 0;
+                  d = (d + 4) | 0;
+                } while ((b | 0) < (e | 0));
+                Te(a, f);
+                oF(a, 75864) | 0;
+              }
+              l = g;
+              return;
+            }
+            function Ve(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0.0;
+              i = l;
+              l = (l + 32) | 0;
+              g = i;
+              e = 75818;
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (d | 0)) break;
+                k = +h[(b + (f << 4)) >> 3];
+                j = +((c[46727] | 0) >>> 0) - +h[(b + (f << 4) + 8) >> 3];
+                c[g >> 2] = e;
+                h[(g + 8) >> 3] = k;
+                h[(g + 16) >> 3] = j;
+                uF(a, 75821, g);
+                e = (f | 0) == 0 ? 75834 : 195059;
+                f = (f + 1) | 0;
+              }
+              oF(a, 98744) | 0;
+              l = i;
+              return;
+            }
+            function We(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              b = l;
+              l = (l + 16) | 0;
+              d = (b + 8) | 0;
+              e = b;
+              oF(a, 80451) | 0;
+              oF(a, 80466) | 0;
+              oF(a, 80505) | 0;
+              oF(a, 80554) | 0;
+              c[e >> 2] = 137314;
+              c[(e + 4) >> 2] = 80642;
+              uF(a, 80623, e);
+              c[d >> 2] = 137198;
+              c[(d + 4) >> 2] = 80648;
+              uF(a, 80623, d);
+              l = b;
+              return;
+            }
+            function Xe(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0.0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0;
+              b = l;
+              l = (l + 64) | 0;
+              d = (b + 8) | 0;
+              j = b;
+              c[j >> 2] = KB(c[((c[(a + 16) >> 2] | 0) + 8) >> 2] | 0) | 0;
+              uF(a, 79404, j);
+              i = +h[(a + 368) >> 3] * 0.5 * +h[(a + 488) >> 3];
+              g = +h[(a + 376) >> 3] * 0.5 * +h[(a + 496) >> 3];
+              f = +J(+(i * 2.0000000949949026e-3)) * 180.0 * 0.6366197723675814;
+              e = +J(+(g * 2.0000000949949026e-3)) * 180.0 * 0.6366197723675814;
+              h[d >> 3] = i;
+              h[(d + 8) >> 3] = g;
+              h[(d + 16) >> 3] = -500.0;
+              h[(d + 24) >> 3] = i;
+              h[(d + 32) >> 3] = g;
+              h[(d + 40) >> 3] = 0.0;
+              h[(d + 48) >> 3] = (f > e ? f : e) * 1.2;
+              uF(a, 79426, d);
+              oF(a, 79573) | 0;
+              oF(a, 80403) | 0;
+              l = b;
+              return;
+            }
+            function Ye(a) {
+              a = a | 0;
+              oF(a, 79387) | 0;
+              return;
+            }
+            function Ze(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                h = 0;
+              f = l;
+              l = (l + 16) | 0;
+              h = f;
+              c[h >> 2] = b;
+              c[(h + 4) >> 2] = d;
+              c[(h + 8) >> 2] = e;
+              uF(a, 79357, h);
+              g[46728] = +(O(d, -10) | 0);
+              l = f;
+              return;
+            }
+            function _e(a) {
+              a = a | 0;
+              oF(a, 79340) | 0;
+              return;
+            }
+            function $e(a) {
+              a = a | 0;
+              oF(a, 79322) | 0;
+              return;
+            }
+            function af(a) {
+              a = a | 0;
+              oF(a, 79306) | 0;
+              return;
+            }
+            function bf(a) {
+              a = a | 0;
+              oF(a, 79285) | 0;
+              g[46728] = +g[46728] + -2.0;
+              return;
+            }
+            function cf(a) {
+              a = a | 0;
+              oF(a, 79266) | 0;
+              return;
+            }
+            function df(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = l;
+              l = (l + 16) | 0;
+              d = b;
+              c[d >> 2] = KB(c[((c[(a + 16) >> 2] | 0) + 8) >> 2] | 0) | 0;
+              uF(a, 79244, d);
+              l = b;
+              return;
+            }
+            function ef(a) {
+              a = a | 0;
+              oF(a, 79228) | 0;
+              return;
+            }
+            function ff(a) {
+              a = a | 0;
+              oF(a, 79210) | 0;
+              g[46728] = +g[46728] + -5.0;
+              return;
+            }
+            function gf(a) {
+              a = a | 0;
+              oF(a, 79194) | 0;
+              g[46728] = +g[46728] + 5.0;
+              return;
+            }
+            function hf(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0.0,
+                t = 0.0,
+                u = 0.0;
+              r = l;
+              l = (l + 144) | 0;
+              o = (r + 104) | 0;
+              q = (r + 56) | 0;
+              m = (r + 32) | 0;
+              j = (r + 24) | 0;
+              n = r;
+              p = (e + 4) | 0;
+              i = c[p >> 2] | 0;
+              f = +h[(i + 16) >> 3];
+              i = c[i >> 2] | 0;
+              c[n >> 2] = c[e >> 2];
+              h[(n + 8) >> 3] = f;
+              c[(n + 16) >> 2] = i;
+              uF(b, 79040, n);
+              g[46729] = +g[46728] + -9.0;
+              switch (a[(e + 48) >> 0] | 0) {
+                case 108: {
+                  f = +h[d >> 3];
+                  break;
+                }
+                case 114: {
+                  i = d;
+                  f = +h[d >> 3] - +h[(e + 32) >> 3];
+                  k = 5;
+                  break;
+                }
+                default: {
+                  i = d;
+                  f = +h[d >> 3] - +h[(e + 32) >> 3] * 0.5;
+                  k = 5;
+                }
+              }
+              if ((k | 0) == 5) h[i >> 3] = f;
+              u = +h[(b + 488) >> 3];
+              t = (+h[(b + 504) >> 3] + f) * u;
+              s = (+h[(b + 512) >> 3] + +h[(d + 8) >> 3]) * +h[(b + 496) >> 3];
+              h[j >> 3] = +h[((c[p >> 2] | 0) + 16) >> 3] * u;
+              n = of(b, 79092, j) | 0;
+              f = +(c[(b + 360) >> 2] | 0);
+              h[m >> 3] = 0.0;
+              h[(m + 8) >> 3] = 0.0;
+              h[(m + 16) >> 3] = f;
+              i = of(b, 78309, m) | 0;
+              f = +g[46729];
+              h[o >> 3] = t;
+              h[(o + 8) >> 3] = s;
+              h[(o + 16) >> 3] = f;
+              d = of(b, 78341, o) | 0;
+              j = o;
+              k = ((c[(b + 16) >> 2] | 0) + 16) | 0;
+              m = (j + 40) | 0;
+              do {
+                c[j >> 2] = c[k >> 2];
+                j = (j + 4) | 0;
+                k = (k + 4) | 0;
+              } while ((j | 0) < (m | 0));
+              o = pf(b, o, 0.0) | 0;
+              e = c[e >> 2] | 0;
+              c[q >> 2] = c[c[p >> 2] >> 2];
+              h[(q + 8) >> 3] = 0.25;
+              h[(q + 16) >> 3] = 0.0;
+              c[(q + 24) >> 2] = e;
+              c[(q + 28) >> 2] = 79179;
+              c[(q + 32) >> 2] = n;
+              c[(q + 36) >> 2] = i;
+              c[(q + 40) >> 2] = d;
+              c[(q + 44) >> 2] = o;
+              q = of(b, 79104, q) | 0;
+              oF(b, q) | 0;
+              U1(q);
+              U1(i);
+              U1(o);
+              U1(d);
+              U1(n);
+              l = r;
+              return;
+            }
+            function jf(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0.0,
+                q = 0.0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0.0;
+              z = l;
+              l = (l + 240) | 0;
+              x = (z + 192) | 0;
+              y = (z + 152) | 0;
+              t = (z + 128) | 0;
+              r = (z + 104) | 0;
+              o = (z + 80) | 0;
+              n = (z + 48) | 0;
+              e = (z + 24) | 0;
+              m = z;
+              oF(a, 78917) | 0;
+              g[46729] = +g[46728] + -6.0;
+              i = +h[b >> 3];
+              j = +h[(a + 488) >> 3];
+              p = (+h[(a + 504) >> 3] + i) * j;
+              A = +h[(b + 8) >> 3];
+              k = +h[(a + 496) >> 3];
+              q = (+h[(a + 512) >> 3] + A) * k;
+              j = (+h[(b + 16) >> 3] - i) * j;
+              k = (+h[(b + 24) >> 3] - A) * k;
+              s = (a + 16) | 0;
+              A = k + j;
+              i = (+h[((c[s >> 2] | 0) + 152) >> 3] / A) * 2.5;
+              h[m >> 3] = j;
+              h[(m + 8) >> 3] = A * 0.25;
+              h[(m + 16) >> 3] = k;
+              b = of(a, 78277, m) | 0;
+              m = (a + 360) | 0;
+              A = +(c[m >> 2] | 0);
+              h[e >> 3] = 90.0;
+              h[(e + 8) >> 3] = 0.0;
+              h[(e + 16) >> 3] = A;
+              e = of(a, 78309, e) | 0;
+              A = +g[46729];
+              h[x >> 3] = p;
+              h[(x + 8) >> 3] = q;
+              h[(x + 16) >> 3] = A;
+              f = of(a, 78341, x) | 0;
+              u = x;
+              v = ((c[s >> 2] | 0) + 16) | 0;
+              w = (u + 40) | 0;
+              do {
+                c[u >> 2] = c[v >> 2];
+                u = (u + 4) | 0;
+                v = (v + 4) | 0;
+              } while ((u | 0) < (w | 0));
+              v = pf(a, x, 0.0) | 0;
+              h[n >> 3] = 1.0;
+              h[(n + 8) >> 3] = i;
+              c[(n + 16) >> 2] = b;
+              c[(n + 20) >> 2] = e;
+              c[(n + 24) >> 2] = f;
+              c[(n + 28) >> 2] = v;
+              w = of(a, 78932, n) | 0;
+              oF(a, w) | 0;
+              U1(b);
+              U1(e);
+              U1(f);
+              U1(v);
+              U1(w);
+              if (d | 0) {
+                h[o >> 3] = j;
+                h[(o + 8) >> 3] = k;
+                h[(o + 16) >> 3] = 1.0;
+                f = of(a, 78277, o) | 0;
+                A = +(c[m >> 2] | 0);
+                h[r >> 3] = 0.0;
+                h[(r + 8) >> 3] = 0.0;
+                h[(r + 16) >> 3] = A;
+                e = of(a, 78309, r) | 0;
+                A = +g[46729];
+                h[t >> 3] = p;
+                h[(t + 8) >> 3] = q;
+                h[(t + 16) >> 3] = A;
+                b = of(a, 78341, t) | 0;
+                u = x;
+                v = ((c[s >> 2] | 0) + 56) | 0;
+                w = (u + 40) | 0;
+                do {
+                  c[u >> 2] = c[v >> 2];
+                  u = (u + 4) | 0;
+                  v = (v + 4) | 0;
+                } while ((u | 0) < (w | 0));
+                x = pf(a, x, 0.0) | 0;
+                h[y >> 3] = 0.0;
+                h[(y + 8) >> 3] = 0.0;
+                h[(y + 16) >> 3] = 0.0;
+                c[(y + 24) >> 2] = f;
+                c[(y + 28) >> 2] = e;
+                c[(y + 32) >> 2] = b;
+                c[(y + 36) >> 2] = x;
+                y = of(a, 78978, y) | 0;
+                oF(a, y) | 0;
+                U1(f);
+                U1(e);
+                U1(b);
+                U1(x);
+                U1(y);
+              }
+              l = z;
+              return;
+            }
+            function kf(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0.0,
+                M = 0,
+                N = 0.0;
+              K = l;
+              l = (l + 336) | 0;
+              B = (K + 296) | 0;
+              J = (K + 288) | 0;
+              I = (K + 272) | 0;
+              H = (K + 264) | 0;
+              G = (K + 240) | 0;
+              D = (K + 232) | 0;
+              A = (K + 208) | 0;
+              z = (K + 184) | 0;
+              w = (K + 160) | 0;
+              v = (K + 152) | 0;
+              u = (K + 136) | 0;
+              t = (K + 128) | 0;
+              s = (K + 96) | 0;
+              r = (K + 88) | 0;
+              q = (K + 56) | 0;
+              f = (K + 48) | 0;
+              m = (K + 24) | 0;
+              k = K;
+              oF(a, 78782) | 0;
+              g[46729] = +g[46728] + -2.0;
+              o = (a + 488) | 0;
+              p = (a + 496) | 0;
+              L = +h[p >> 3];
+              h[k >> 3] = +h[o >> 3];
+              h[(k + 8) >> 3] = L;
+              h[(k + 16) >> 3] = 1.0;
+              k = of(a, 78277, k) | 0;
+              y = (a + 360) | 0;
+              L = +(c[y >> 2] | 0);
+              h[m >> 3] = 0.0;
+              h[(m + 8) >> 3] = 0.0;
+              h[(m + 16) >> 3] = L;
+              m = of(a, 78309, m) | 0;
+              L = +g[46729] + -2.0;
+              h[B >> 3] = 0.0;
+              h[(B + 8) >> 3] = 0.0;
+              h[(B + 16) >> 3] = L;
+              n = of(a, 78341, B) | 0;
+              C = (a + 16) | 0;
+              i = B;
+              j = ((c[C >> 2] | 0) + 16) | 0;
+              x = (i + 40) | 0;
+              do {
+                c[i >> 2] = c[j >> 2];
+                i = (i + 4) | 0;
+                j = (j + 4) | 0;
+              } while ((i | 0) < (x | 0));
+              j = pf(a, B, 0.0) | 0;
+              c[f >> 2] = 78404;
+              c[(f + 4) >> 2] = d + 1;
+              E = (a + 504) | 0;
+              F = (a + 512) | 0;
+              i = 0;
+              f = of(a, 78373, f) | 0;
+              while (1) {
+                if ((i | 0) >= (d | 0)) break;
+                N = +h[F >> 3] + +h[(b + (i << 4) + 8) >> 3];
+                L = +h[((c[C >> 2] | 0) + 152) >> 3];
+                h[q >> 3] = +h[E >> 3] + +h[(b + (i << 4)) >> 3];
+                h[(q + 8) >> 3] = N;
+                h[(q + 16) >> 3] = 0.0;
+                h[(q + 24) >> 3] = L;
+                M = of(a, 78418, q) | 0;
+                c[r >> 2] = f;
+                c[(r + 4) >> 2] = M;
+                x = of(a, 78447, r) | 0;
+                U1(M);
+                U1(f);
+                i = (i + 1) | 0;
+                f = x;
+              }
+              L = +h[F >> 3] + +h[(b + 8) >> 3];
+              N = +h[((c[C >> 2] | 0) + 152) >> 3];
+              h[s >> 3] = +h[E >> 3] + +h[b >> 3];
+              h[(s + 8) >> 3] = L;
+              h[(s + 16) >> 3] = 0.0;
+              h[(s + 24) >> 3] = N;
+              x = of(a, 78418, s) | 0;
+              c[t >> 2] = f;
+              c[(t + 4) >> 2] = x;
+              M = of(a, 78447, t) | 0;
+              U1(x);
+              U1(f);
+              c[u >> 2] = k;
+              c[(u + 4) >> 2] = m;
+              c[(u + 8) >> 2] = n;
+              c[(u + 12) >> 2] = j;
+              x = of(a, 78797, u) | 0;
+              c[v >> 2] = M;
+              c[(v + 4) >> 2] = x;
+              M = of(a, 78502, v) | 0;
+              U1(x);
+              oF(a, M) | 0;
+              U1(k);
+              U1(m);
+              U1(n);
+              U1(j);
+              U1(M);
+              if (e | 0) {
+                N = +h[p >> 3];
+                h[w >> 3] = +h[o >> 3];
+                h[(w + 8) >> 3] = N;
+                h[(w + 16) >> 3] = 1.0;
+                n = of(a, 78277, w) | 0;
+                N = +(c[y >> 2] | 0);
+                h[z >> 3] = 0.0;
+                h[(z + 8) >> 3] = 0.0;
+                h[(z + 16) >> 3] = N;
+                m = of(a, 78309, z) | 0;
+                N = +g[46729] + -2.0;
+                h[A >> 3] = 0.0;
+                h[(A + 8) >> 3] = 0.0;
+                h[(A + 16) >> 3] = N;
+                k = of(a, 78341, A) | 0;
+                i = B;
+                j = ((c[C >> 2] | 0) + 56) | 0;
+                x = (i + 40) | 0;
+                do {
+                  c[i >> 2] = c[j >> 2];
+                  i = (i + 4) | 0;
+                  j = (j + 4) | 0;
+                } while ((i | 0) < (x | 0));
+                j = pf(a, B, 0.25) | 0;
+                c[D >> 2] = d;
+                i = 0;
+                f = of(a, 78842, D) | 0;
+                while (1) {
+                  if ((i | 0) >= (d | 0)) break;
+                  N = +h[F >> 3] + +h[(b + (i << 4) + 8) >> 3];
+                  h[G >> 3] = +h[E >> 3] + +h[(b + (i << 4)) >> 3];
+                  h[(G + 8) >> 3] = N;
+                  h[(G + 16) >> 3] = 0.0;
+                  D = of(a, 78857, G) | 0;
+                  c[H >> 2] = f;
+                  c[(H + 4) >> 2] = D;
+                  M = of(a, 78879, H) | 0;
+                  U1(D);
+                  U1(f);
+                  i = (i + 1) | 0;
+                  f = M;
+                }
+                c[I >> 2] = n;
+                c[(I + 4) >> 2] = m;
+                c[(I + 8) >> 2] = k;
+                c[(I + 12) >> 2] = j;
+                I = of(a, 78889, I) | 0;
+                c[J >> 2] = f;
+                c[(J + 4) >> 2] = I;
+                M = of(a, 78502, J) | 0;
+                U1(I);
+                oF(a, M) | 0;
+                U1(n);
+                U1(m);
+                U1(k);
+                U1(j);
+                U1(M);
+              }
+              l = K;
+              return;
+            }
+            function lf(a, b, d, e, f, i) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              i = i | 0;
+              var j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0.0,
+                D = 0.0;
+              B = l;
+              l = (l + 208) | 0;
+              e = (B + 160) | 0;
+              A = (B + 152) | 0;
+              z = (B + 136) | 0;
+              y = (B + 128) | 0;
+              x = (B + 96) | 0;
+              w = (B + 88) | 0;
+              v = (B + 56) | 0;
+              k = (B + 48) | 0;
+              s = (B + 24) | 0;
+              r = B;
+              oF(a, 78709) | 0;
+              g[46729] = +g[46728] + -4.0;
+              C = +h[(a + 496) >> 3];
+              h[r >> 3] = +h[(a + 488) >> 3];
+              h[(r + 8) >> 3] = C;
+              h[(r + 16) >> 3] = 1.0;
+              r = of(a, 78277, r) | 0;
+              C = +(c[(a + 360) >> 2] | 0);
+              h[s >> 3] = 0.0;
+              h[(s + 8) >> 3] = 0.0;
+              h[(s + 16) >> 3] = C;
+              s = of(a, 78309, s) | 0;
+              C = +g[46729] + -2.0;
+              h[e >> 3] = 0.0;
+              h[(e + 8) >> 3] = 0.0;
+              h[(e + 16) >> 3] = C;
+              t = of(a, 78341, e) | 0;
+              u = (a + 16) | 0;
+              f = e;
+              i = ((c[u >> 2] | 0) + 56) | 0;
+              j = (f + 40) | 0;
+              do {
+                c[f >> 2] = c[i >> 2];
+                f = (f + 4) | 0;
+                i = (i + 4) | 0;
+              } while ((f | 0) < (j | 0));
+              n = pf(a, e, 0.0) | 0;
+              c[k >> 2] = 78723;
+              c[(k + 4) >> 2] = d + 2;
+              o = (a + 504) | 0;
+              p = (a + 512) | 0;
+              q = (d + -1) | 0;
+              m = 0;
+              e = of(a, 78373, k) | 0;
+              while (1) {
+                if ((m | 0) >= (d | 0)) break;
+                f = (b + (m << 4)) | 0;
+                i = (b + (m << 4) + 8) | 0;
+                D = +h[p >> 3] + +h[i >> 3];
+                C = +h[((c[u >> 2] | 0) + 152) >> 3];
+                h[v >> 3] = +h[o >> 3] + +h[f >> 3];
+                h[(v + 8) >> 3] = D;
+                h[(v + 16) >> 3] = 0.0;
+                h[(v + 24) >> 3] = C;
+                k = of(a, 78418, v) | 0;
+                c[w >> 2] = e;
+                c[(w + 4) >> 2] = k;
+                j = of(a, 78447, w) | 0;
+                U1(k);
+                U1(e);
+                if (((m | 0) == 0) | ((m | 0) == (q | 0))) {
+                  C = +h[p >> 3] + +h[i >> 3];
+                  D = +h[((c[u >> 2] | 0) + 152) >> 3];
+                  h[x >> 3] = +h[o >> 3] + +h[f >> 3];
+                  h[(x + 8) >> 3] = C;
+                  h[(x + 16) >> 3] = 0.0;
+                  h[(x + 24) >> 3] = D;
+                  k = of(a, 78418, x) | 0;
+                  c[y >> 2] = j;
+                  c[(y + 4) >> 2] = k;
+                  e = of(a, 78447, y) | 0;
+                  U1(k);
+                  U1(j);
+                } else e = j;
+                m = (m + 1) | 0;
+              }
+              c[z >> 2] = r;
+              c[(z + 4) >> 2] = s;
+              c[(z + 8) >> 2] = t;
+              c[(z + 12) >> 2] = n;
+              b = of(a, 78732, z) | 0;
+              c[A >> 2] = e;
+              c[(A + 4) >> 2] = b;
+              d = of(a, 78502, A) | 0;
+              U1(b);
+              oF(a, d) | 0;
+              U1(r);
+              U1(s);
+              U1(t);
+              U1(n);
+              U1(d);
+              l = B;
+              return;
+            }
+            function mf(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0.0,
+                x = 0,
+                y = 0.0;
+              v = l;
+              l = (l + 160) | 0;
+              e = (v + 120) | 0;
+              u = (v + 112) | 0;
+              t = (v + 96) | 0;
+              s = (v + 88) | 0;
+              r = (v + 56) | 0;
+              m = (v + 48) | 0;
+              n = (v + 24) | 0;
+              q = v;
+              oF(a, 78261) | 0;
+              g[46729] = +g[46728] + -6.0;
+              w = +h[(a + 496) >> 3];
+              h[q >> 3] = +h[(a + 488) >> 3];
+              h[(q + 8) >> 3] = w;
+              h[(q + 16) >> 3] = 1.0;
+              q = of(a, 78277, q) | 0;
+              w = +(c[(a + 360) >> 2] | 0);
+              h[n >> 3] = 0.0;
+              h[(n + 8) >> 3] = 0.0;
+              h[(n + 16) >> 3] = w;
+              n = of(a, 78309, n) | 0;
+              w = +g[46729];
+              h[e >> 3] = 0.0;
+              h[(e + 8) >> 3] = 0.0;
+              h[(e + 16) >> 3] = w;
+              o = of(a, 78341, e) | 0;
+              p = (a + 16) | 0;
+              f = e;
+              i = ((c[p >> 2] | 0) + 16) | 0;
+              j = (f + 40) | 0;
+              do {
+                c[f >> 2] = c[i >> 2];
+                f = (f + 4) | 0;
+                i = (i + 4) | 0;
+              } while ((f | 0) < (j | 0));
+              i = pf(a, e, 0.0) | 0;
+              c[m >> 2] = 78404;
+              c[(m + 4) >> 2] = d;
+              j = (a + 504) | 0;
+              k = (a + 512) | 0;
+              f = 0;
+              e = of(a, 78373, m) | 0;
+              while (1) {
+                if ((f | 0) >= (d | 0)) break;
+                y = +h[k >> 3] + +h[(b + (f << 4) + 8) >> 3];
+                w = +h[((c[p >> 2] | 0) + 152) >> 3];
+                h[r >> 3] = +h[j >> 3] + +h[(b + (f << 4)) >> 3];
+                h[(r + 8) >> 3] = y;
+                h[(r + 16) >> 3] = 0.0;
+                h[(r + 24) >> 3] = w;
+                x = of(a, 78418, r) | 0;
+                c[s >> 2] = e;
+                c[(s + 4) >> 2] = x;
+                m = of(a, 78447, s) | 0;
+                U1(x);
+                U1(e);
+                f = (f + 1) | 0;
+                e = m;
+              }
+              c[t >> 2] = q;
+              c[(t + 4) >> 2] = n;
+              c[(t + 8) >> 2] = o;
+              c[(t + 12) >> 2] = i;
+              t = of(a, 78456, t) | 0;
+              c[u >> 2] = e;
+              c[(u + 4) >> 2] = t;
+              x = of(a, 78502, u) | 0;
+              U1(t);
+              oF(a, x) | 0;
+              U1(q);
+              U1(n);
+              U1(o);
+              U1(i);
+              U1(x);
+              l = v;
+              return;
+            }
+            function nf(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = l;
+              l = (l + 16) | 0;
+              e = d;
+              c[e >> 2] = b;
+              uF(a, 78242, e);
+              l = d;
+              return;
+            }
+            function of(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 1056) | 0;
+              h = i;
+              e = (i + 24) | 0;
+              f = (i + 8) | 0;
+              c[f >> 2] = d;
+              g = G3(e, 1024, b, f) | 0;
+              do
+                if ((g | 0) >= 0)
+                  if ((g | 0) > 1023) {
+                    a = T1((g + 1) | 0) | 0;
+                    c[f >> 2] = d;
+                    n4(a, b, f) | 0;
+                    break;
+                  } else {
+                    a = D4(e) | 0;
+                    break;
+                  }
+                else {
+                  a = c[((c[(a + 12) >> 2] | 0) + 16) >> 2] | 0;
+                  c[h >> 2] = t2(c[(d2() | 0) >> 2] | 0) | 0;
+                  ub[a & 63](78687, h);
+                  a = D4(195059) | 0;
+                }
+              while (0);
+              l = i;
+              return a | 0;
+            }
+            function pf(a, b, e) {
+              a = a | 0;
+              b = b | 0;
+              e = +e;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0.0,
+                s = 0.0;
+              q = l;
+              l = (l + 112) | 0;
+              o = (q + 104) | 0;
+              j = (q + 96) | 0;
+              i = (q + 64) | 0;
+              n = (q + 48) | 0;
+              p = (q + 32) | 0;
+              m = (q + 16) | 0;
+              k = q;
+              g = c[(b + 32) >> 2] | 0;
+              a: do
+                switch (g | 0) {
+                  case 5: {
+                    f = c[b >> 2] | 0;
+                    if (!(s2(f, 136302) | 0)) {
+                      c[k >> 2] = 78524;
+                      h[(k + 8) >> 3] = e;
+                      f = of(a, 78507, k) | 0;
+                      break a;
+                    }
+                    if (!(s2(f, 133432) | 0)) {
+                      c[m >> 2] = 78528;
+                      h[(m + 8) >> 3] = e;
+                      f = of(a, 78507, m) | 0;
+                      break a;
+                    }
+                    if (!(s2(f, 131431) | 0)) {
+                      c[p >> 2] = 78534;
+                      h[(p + 8) >> 3] = e;
+                      f = of(a, 78507, p) | 0;
+                      break a;
+                    } else {
+                      c[n >> 2] = f;
+                      h[(n + 8) >> 3] = e;
+                      f = of(a, 78507, n) | 0;
+                      break a;
+                    }
+                  }
+                  case 1: {
+                    s = +(d[(b + 1) >> 0] | 0) * 0.00390625;
+                    r = +(d[(b + 2) >> 0] | 0) * 0.00390625;
+                    h[i >> 3] = +(d[b >> 0] | 0) * 0.00390625;
+                    h[(i + 8) >> 3] = s;
+                    h[(i + 16) >> 3] = r;
+                    h[(i + 24) >> 3] = e;
+                    f = of(a, 78539, i) | 0;
+                    break;
+                  }
+                  default: {
+                    p = c[15712] | 0;
+                    n = c[b >> 2] | 0;
+                    c[j >> 2] = g;
+                    c[(j + 4) >> 2] = n;
+                    w4(p, 78578, j) | 0;
+                    qa(138394, 78628, 436, 78648);
+                  }
+                }
+              while (0);
+              c[o >> 2] = f;
+              p = of(a, 78665, o) | 0;
+              U1(f);
+              l = q;
+              return p | 0;
+            }
+            function qf(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              b = l;
+              l = (l + 32) | 0;
+              d = (b + 24) | 0;
+              e = (b + 16) | 0;
+              g = b;
+              f = c[(a + 16) >> 2] | 0;
+              h = c[c[(a + 12) >> 2] >> 2] | 0;
+              j = c[h >> 2] | 0;
+              i = c[(h + 4) >> 2] | 0;
+              h = c[(h + 8) >> 2] | 0;
+              c[g >> 2] = 81094;
+              c[(g + 4) >> 2] = j;
+              c[(g + 8) >> 2] = i;
+              c[(g + 12) >> 2] = h;
+              uF(a, 83704, g);
+              f = KB(c[(f + 8) >> 2] | 0) | 0;
+              c[e >> 2] = 81094;
+              c[(e + 4) >> 2] = f;
+              uF(a, 83736, e);
+              c[d >> 2] = 81094;
+              uF(a, 83750, d);
+              l = b;
+              return;
+            }
+            function rf(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = l;
+              l = (l + 16) | 0;
+              d = b;
+              c[d >> 2] = 81094;
+              uF(a, 83652, d);
+              l = b;
+              return;
+            }
+            function sf(a) {
+              a = a | 0;
+              var b = 0.0,
+                d = 0.0,
+                e = 0.0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                O = 0,
+                P = 0,
+                Q = 0,
+                R = 0,
+                S = 0,
+                T = 0,
+                U = 0,
+                V = 0,
+                W = 0;
+              W = l;
+              l = (l + 304) | 0;
+              V = (W + 296) | 0;
+              U = (W + 288) | 0;
+              T = (W + 272) | 0;
+              R = (W + 264) | 0;
+              Q = (W + 256) | 0;
+              P = (W + 248) | 0;
+              O = (W + 240) | 0;
+              N = (W + 232) | 0;
+              M = (W + 224) | 0;
+              L = (W + 216) | 0;
+              K = (W + 208) | 0;
+              J = (W + 200) | 0;
+              I = (W + 192) | 0;
+              H = (W + 184) | 0;
+              G = (W + 176) | 0;
+              F = (W + 168) | 0;
+              E = (W + 160) | 0;
+              C = (W + 152) | 0;
+              A = (W + 144) | 0;
+              z = (W + 136) | 0;
+              y = (W + 128) | 0;
+              x = (W + 120) | 0;
+              w = (W + 112) | 0;
+              v = (W + 104) | 0;
+              u = (W + 96) | 0;
+              t = (W + 88) | 0;
+              s = (W + 80) | 0;
+              r = (W + 72) | 0;
+              q = (W + 64) | 0;
+              p = (W + 56) | 0;
+              o = (W + 48) | 0;
+              S = (W + 40) | 0;
+              B = (W + 24) | 0;
+              n = (W + 16) | 0;
+              m = W;
+              g = c[(a + 456) >> 2] | 0;
+              i = c[(a + 460) >> 2] | 0;
+              j = c[(a + 464) >> 2] | 0;
+              k = c[(a + 468) >> 2] | 0;
+              f = (a + 360) | 0;
+              a: do
+                if (c[4025] | 0) {
+                  switch (c[f >> 2] | 0) {
+                    case 90:
+                    case 0:
+                      break a;
+                    default: {
+                    }
+                  }
+                  Ef();
+                  c[4025] = 0;
+                }
+              while (0);
+              e = (+(k | 0) - +(i | 0)) * 0.013888888888888888;
+              b = (+(j | 0) - +(g | 0)) * 0.013888888888888888;
+              k = (c[f >> 2] | 0) == 90;
+              d = k ? e : b;
+              e = k ? b : e;
+              h[m >> 3] = d;
+              h[(m + 8) >> 3] = e;
+              uF(a, 81281, m);
+              c[n >> 2] = 81094;
+              uF(a, 81296, n);
+              if (d > 0.0) {
+                b = +A2(d);
+                h[19214] = b;
+                b = b + 3.0 - +(~~b | 0);
+              } else b = 3.0;
+              b = +D(10.0, +b);
+              h[19214] = b;
+              h[B >> 3] = b;
+              h[(B + 8) >> 3] = b;
+              uF(a, 81465, B);
+              c[S >> 2] = 81094;
+              uF(a, 81500, S);
+              c[o >> 2] = 81094;
+              uF(a, 81558, o);
+              c[p >> 2] = 81094;
+              uF(a, 81618, p);
+              c[q >> 2] = 81094;
+              uF(a, 81667, q);
+              c[r >> 2] = 81094;
+              uF(a, 81706, r);
+              c[s >> 2] = 81094;
+              uF(a, 81757, s);
+              c[t >> 2] = 81094;
+              uF(a, 81819, t);
+              c[u >> 2] = 81094;
+              uF(a, 81929, u);
+              c[v >> 2] = 81094;
+              uF(a, 82020, v);
+              c[w >> 2] = 81094;
+              uF(a, 82074, w);
+              c[x >> 2] = 81094;
+              uF(a, 82143, x);
+              uF(a, 82179, y);
+              c[z >> 2] = 81094;
+              uF(a, 82304, z);
+              c[A >> 2] = 81094;
+              uF(a, 82333, A);
+              uF(a, 82373, C);
+              c[E >> 2] = 81094;
+              uF(a, 82466, E);
+              c[F >> 2] = 81094;
+              uF(a, 82525, F);
+              c[G >> 2] = 81094;
+              uF(a, 82606, G);
+              uF(a, 82676, H);
+              c[I >> 2] = 81094;
+              uF(a, 82765, I);
+              c[J >> 2] = 81094;
+              uF(a, 82870, J);
+              c[K >> 2] = 81094;
+              uF(a, 82946, K);
+              c[L >> 2] = 81094;
+              uF(a, 82985, L);
+              c[M >> 2] = 81094;
+              uF(a, 83084, M);
+              c[N >> 2] = 81094;
+              uF(a, 83130, N);
+              uF(a, 83219, O);
+              c[P >> 2] = 81094;
+              uF(a, 83260, P);
+              c[Q >> 2] = 81094;
+              uF(a, 83343, Q);
+              c[R >> 2] = 81094;
+              uF(a, 83444, R);
+              h[T >> 3] = e;
+              h[(T + 8) >> 3] = d;
+              uF(a, 83508, T);
+              uF(a, 83536, U);
+              uF(a, 83544, V);
+              l = W;
+              return;
+            }
+            function tf(a) {
+              a = a | 0;
+              var b = 0;
+              b = l;
+              l = (l + 16) | 0;
+              uF(a, 81274, b);
+              l = b;
+              return;
+            }
+            function uf(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0,
+                m = 0,
+                n = 0.0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0;
+              r = l;
+              l = (l + 48) | 0;
+              q = (r + 24) | 0;
+              p = (r + 8) | 0;
+              o = r;
+              switch (a[(e + 48) >> 0] | 0) {
+                case 108: {
+                  k = d;
+                  i = +h[(e + 32) >> 3];
+                  j = +h[d >> 3];
+                  break;
+                }
+                case 114: {
+                  i = +h[(e + 32) >> 3];
+                  g = i;
+                  f = 5;
+                  break;
+                }
+                default: {
+                  i = +h[(e + 32) >> 3];
+                  g = i * 0.5;
+                  f = 5;
+                }
+              }
+              if ((f | 0) == 5) {
+                j = +h[d >> 3] - g;
+                h[d >> 3] = j;
+                k = d;
+              }
+              m = (e + 4) | 0;
+              f = c[m >> 2] | 0;
+              g = +h[(f + 16) >> 3];
+              d = (d + 8) | 0;
+              n = +h[d >> 3] + g * 0.004629629629629629;
+              h[d >> 3] = n;
+              i = j + i * 0.006944444444444444;
+              h[k >> 3] = i;
+              f = c[f >> 2] | 0;
+              do
+                if (f) {
+                  d = c[46730] | 0;
+                  if (d | 0 ? (s2(d, f) | 0) == 0 : 0) break;
+                  c[o >> 2] = Cf(f) | 0;
+                  uF(b, 81173, o);
+                  o = c[m >> 2] | 0;
+                  c[46730] = c[o >> 2];
+                  g = +h[(o + 16) >> 3];
+                }
+              while (0);
+              f = ~~g;
+              f = (f | 0) > 1 ? f : 1;
+              if ((f | 0) != (c[46731] | 0)) {
+                j = +h[19214];
+                c[p >> 2] = f;
+                h[(p + 8) >> 3] = j;
+                uF(b, 81181, p);
+                c[46731] = f;
+              }
+              c[q >> 2] = Df(c[e >> 2] | 0) | 0;
+              h[(q + 8) >> 3] = i;
+              h[(q + 16) >> 3] = n;
+              uF(b, 81202, q);
+              l = r;
+              return;
+            }
+            function vf(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0;
+              e = l;
+              l = (l + 48) | 0;
+              f = e;
+              i = +h[b >> 3];
+              k = (+h[(b + 16) >> 3] - i) * 0.027777777777777776;
+              g = +h[(b + 8) >> 3];
+              j = (+h[(b + 24) >> 3] - g) * 0.027777777777777776;
+              c[f >> 2] = 1;
+              c[(f + 4) >> 2] = d | 0 ? 81115 : 195059;
+              h[(f + 8) >> 3] = k;
+              h[(f + 16) >> 3] = j;
+              h[(f + 24) >> 3] = i * 0.013888888888888888;
+              h[(f + 32) >> 3] = g * 0.013888888888888888;
+              uF(a, 81121, f);
+              l = e;
+              return;
+            }
+            function wf(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              e = l;
+              l = (l + 16) | 0;
+              Af(c[(a + 16) >> 2] | 0, (e + 8) | 0, e);
+              Bf(a, b, d, 1);
+              l = e;
+              return;
+            }
+            function xf(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0.0,
+                v = 0.0,
+                w = 0;
+              t = l;
+              l = (l + 128) | 0;
+              s = (t + 112) | 0;
+              q = (t + 104) | 0;
+              p = (t + 96) | 0;
+              e = (t + 88) | 0;
+              n = (t + 16) | 0;
+              o = t;
+              k = c[(a + 16) >> 2] | 0;
+              j = T1((((d * 140) | 0) + 140) | 0) | 0;
+              Af(k, (t + 116) | 0, (t + 80) | 0);
+              v = +h[b >> 3];
+              k = (n + 48) | 0;
+              h[k >> 3] = v;
+              u = +h[(b + 8) >> 3];
+              h[(n + 56) >> 3] = u;
+              c[e >> 2] = ~~(v + (v >= 0.0 ? 0.5 : -0.5));
+              c[(e + 4) >> 2] = ~~(u + (u >= 0.0 ? 0.5 : -0.5));
+              i = (o + 8) | 0;
+              e = (j + (m4(j, 81099, e) | 0)) | 0;
+              r = 1;
+              g = 0;
+              while (1) {
+                m = (g + 3) | 0;
+                if ((m | 0) >= (d | 0)) break;
+                c[n >> 2] = c[k >> 2];
+                c[(n + 4) >> 2] = c[(k + 4) >> 2];
+                c[(n + 8) >> 2] = c[(k + 8) >> 2];
+                c[(n + 12) >> 2] = c[(k + 12) >> 2];
+                f = 1;
+                while (1) {
+                  if ((f | 0) == 4) {
+                    f = 1;
+                    break;
+                  }
+                  w = (f + g) | 0;
+                  h[(n + (f << 4)) >> 3] = +h[(b + (w << 4)) >> 3];
+                  h[(n + (f << 4) + 8) >> 3] = +h[(b + (w << 4) + 8) >> 3];
+                  f = (f + 1) | 0;
+                }
+                while (1) {
+                  if ((f | 0) == 7) break;
+                  kP(o, n, 3, +(f | 0) * 0.16666666666666666, 0, 0);
+                  u = +h[o >> 3];
+                  v = +h[i >> 3];
+                  c[p >> 2] = ~~(u + (u >= 0.0 ? 0.5 : -0.5));
+                  c[(p + 4) >> 2] = ~~(v + (v >= 0.0 ? 0.5 : -0.5));
+                  f = (f + 1) | 0;
+                  e = (e + (m4(e, 81099, p) | 0)) | 0;
+                }
+                r = (r + 6) | 0;
+                g = m;
+              }
+              c[q >> 2] = j;
+              uF(a, 81106, q);
+              U1(j);
+              f = (r + -1) | 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (r | 0)) break;
+                c[s >> 2] = (((e | 0) % (f | 0) | 0 | 0) != 0) & 1;
+                uF(a, 81111, s);
+                e = (e + 1) | 0;
+              }
+              oF(a, 153599) | 0;
+              l = t;
+              return;
+            }
+            function yf(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              e = l;
+              l = (l + 16) | 0;
+              Af(c[(a + 16) >> 2] | 0, (e + 8) | 0, e);
+              Bf(a, b, d, 0);
+              l = e;
+              return;
+            }
+            function zf(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = l;
+              l = (l + 16) | 0;
+              e = d;
+              c[e >> 2] = 81094;
+              c[(e + 4) >> 2] = b;
+              uF(a, 81087, e);
+              l = d;
+              return;
+            }
+            function Af(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0;
+              switch (c[(a + 144) >> 2] | 0) {
+                case 1: {
+                  e = 10.0;
+                  a = 1;
+                  break;
+                }
+                case 2: {
+                  e = 10.0;
+                  a = 2;
+                  break;
+                }
+                default: {
+                  e = 0.0;
+                  a = 0;
+                }
+              }
+              c[b >> 2] = a;
+              h[d >> 3] = e;
+              return;
+            }
+            function Bf(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0.0,
+                m = 0.0;
+              j = l;
+              l = (l + 16) | 0;
+              i = (j + 8) | 0;
+              g = j;
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (d | 0)) break;
+                m = +h[(b + (f << 4)) >> 3];
+                k = +h[(b + (f << 4) + 8) >> 3];
+                c[g >> 2] = ~~(m + (m >= 0.0 ? 0.5 : -0.5));
+                c[(g + 4) >> 2] = ~~(k + (k >= 0.0 ? 0.5 : -0.5));
+                uF(a, 81099, g);
+                f = (f + 1) | 0;
+              }
+              if (e | 0) {
+                k = +h[b >> 3];
+                m = +h[(b + 8) >> 3];
+                c[i >> 2] = ~~(k + (k >= 0.0 ? 0.5 : -0.5));
+                c[(i + 4) >> 2] = ~~(m + (m >= 0.0 ? 0.5 : -0.5));
+                uF(a, 81099, i);
+              }
+              oF(a, 153599) | 0;
+              l = j;
+              return;
+            }
+            function Cf(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 16) | 0;
+              f = h;
+              a: while (1) {
+                d = 15828;
+                while (1) {
+                  e = c[(d + 4) >> 2] | 0;
+                  if (!e) break;
+                  if (!(s2(e, b) | 0)) {
+                    g = 6;
+                    break a;
+                  }
+                  d = (d + 8) | 0;
+                }
+                c[f >> 2] = 81255;
+                c[(f + 4) >> 2] = b;
+                gA(1, 81229, f) | 0;
+                d = E4(b, 45) | 0;
+                if (!d) {
+                  d = 81272;
+                  break;
+                }
+                a[d >> 0] = 0;
+              }
+              l = h;
+              return d | 0;
+            }
+            function Df(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 16) | 0;
+              h = i;
+              d = c[46732] | 0;
+              if (!d) {
+                c[46733] = 64;
+                d = T1(64) | 0;
+                c[46732] = d;
+                e = 0;
+              } else e = 0;
+              while (1) {
+                g = (b + 1) | 0;
+                f = a[b >> 0] | 0;
+                if (!((f << 24) >> 24)) break;
+                b = c[46733] | 0;
+                if ((e | 0) > ((b + -8) | 0)) {
+                  d = b << 1;
+                  c[46733] = d;
+                  d = W1(c[46732] | 0, d) | 0;
+                  c[46732] = d;
+                  d = (d + e) | 0;
+                }
+                if ((f << 24) >> 24 <= -1) {
+                  a[d >> 0] = 92;
+                  c[h >> 2] = f & 255;
+                  m4((d + 1) | 0, 81224, h) | 0;
+                  b = g;
+                  d = (d + 4) | 0;
+                  e = (e + 4) | 0;
+                  continue;
+                }
+                if ((f << 24) >> 24 == 92) {
+                  a[d >> 0] = 92;
+                  e = (e + 1) | 0;
+                  d = (d + 1) | 0;
+                }
+                a[d >> 0] = f;
+                b = g;
+                d = (d + 1) | 0;
+                e = (e + 1) | 0;
+              }
+              a[d >> 0] = 0;
+              l = i;
+              return c[46732] | 0;
+            }
+            function Ef() {
+              var a = 0,
+                b = 0;
+              a = l;
+              l = (l + 16) | 0;
+              b = a;
+              c[b >> 2] = 81255;
+              c[(b + 4) >> 2] = 91269;
+              gA(0, 83634, b) | 0;
+              l = a;
+              return;
+            }
+            function Ff(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0;
+              e = l;
+              l = (l + 32) | 0;
+              f = (e + 8) | 0;
+              j = e;
+              b = (b + 8) | 0;
+              k = c[b >> 2] | 0;
+              c[j >> 2] = k;
+              c[(j + 4) >> 2] = k;
+              uF(a, 84223, j);
+              i = (+h[d >> 3] + +h[(d + 16) >> 3]) * 0.5;
+              g = (+h[(d + 8) >> 3] + +h[(d + 24) >> 3]) * 0.5;
+              c[f >> 2] = c[b >> 2];
+              h[(f + 8) >> 3] = i;
+              h[(f + 16) >> 3] = g;
+              uF(a, 84265, f);
+              l = e;
+              return;
+            }
+            function Gf(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0;
+              e = l;
+              l = (l + 48) | 0;
+              f = e;
+              i = +h[d >> 3];
+              k = +h[(d + 16) >> 3] - i;
+              g = +h[(d + 24) >> 3];
+              j = g - +h[(d + 8) >> 3];
+              g = +(~~(+h[(a + 232) >> 3] - +h[(a + 216) >> 3]) >>> 0) - g;
+              c[f >> 2] = c[(b + 8) >> 2];
+              h[(f + 8) >> 3] = k;
+              h[(f + 16) >> 3] = j;
+              h[(f + 24) >> 3] = i;
+              h[(f + 32) >> 3] = g;
+              uF(a, 84310, f);
+              oF(a, 84402) | 0;
+              l = e;
+              return;
+            }
+            function Hf(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              return;
+            }
+            function If(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0.0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0.0;
+              t = l;
+              l = (l + 160) | 0;
+              s = (t + 152) | 0;
+              r = (t + 136) | 0;
+              q = (t + 120) | 0;
+              k = (t + 112) | 0;
+              n = (t + 104) | 0;
+              m = (t + 88) | 0;
+              j = (t + 72) | 0;
+              i = (t + 64) | 0;
+              o = t;
+              if (!a) qa(111282, 84407, 212, 84426);
+              if (!b) qa(111312, 84407, 213, 84426);
+              p = (b + 8) | 0;
+              if (!(c[p >> 2] | 0)) qa(111315, 84407, 214, 84426);
+              if (c[(b + 52) >> 2] | 0) {
+                c[o >> 2] = c[d >> 2];
+                c[(o + 4) >> 2] = c[(d + 4) >> 2];
+                c[(o + 8) >> 2] = c[(d + 8) >> 2];
+                c[(o + 12) >> 2] = c[(d + 12) >> 2];
+                b = (o + 32) | 0;
+                d = (d + 16) | 0;
+                c[b >> 2] = c[d >> 2];
+                c[(b + 4) >> 2] = c[(d + 4) >> 2];
+                c[(b + 8) >> 2] = c[(d + 8) >> 2];
+                c[(b + 12) >> 2] = c[(d + 12) >> 2];
+                f = +h[o >> 3];
+                h[(o + 16) >> 3] = f;
+                h[(o + 24) >> 3] = +h[(o + 40) >> 3];
+                h[(o + 48) >> 3] = +h[b >> 3];
+                g = +h[(o + 8) >> 3];
+                h[(o + 56) >> 3] = g;
+                if ((e << 24) >> 24) {
+                  uF(a, 84447, i);
+                  b = 0;
+                  while (1) {
+                    if ((b | 0) == 4) break;
+                    u = +h[(o + (b << 4) + 8) >> 3];
+                    h[j >> 3] = +h[(o + (b << 4)) >> 3];
+                    h[(j + 8) >> 3] = u;
+                    uF(a, 84450, j);
+                    b = (b + 1) | 0;
+                  }
+                  h[m >> 3] = f;
+                  h[(m + 8) >> 3] = g;
+                  uF(a, 84450, m);
+                  m = c[p >> 2] | 0;
+                  c[n >> 2] = 4;
+                  c[(n + 4) >> 2] = m;
+                  uF(a, 84457, n);
+                }
+                uF(a, 84447, k);
+                b = 0;
+                while (1) {
+                  if ((b | 0) == 4) break;
+                  u = +h[(o + (b << 4) + 8) >> 3];
+                  h[q >> 3] = +h[(o + (b << 4)) >> 3];
+                  h[(q + 8) >> 3] = u;
+                  uF(a, 84450, q);
+                  b = (b + 1) | 0;
+                }
+                h[r >> 3] = f;
+                h[(r + 8) >> 3] = g;
+                uF(a, 84450, r);
+                r = c[p >> 2] | 0;
+                c[s >> 2] = 4;
+                c[(s + 4) >> 2] = r;
+                uF(a, 84472, s);
+              }
+              l = t;
+              return;
+            }
+            function Jf(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0.0;
+              o = l;
+              l = (l + 112) | 0;
+              n = (o + 24) | 0;
+              m = (o + 16) | 0;
+              k = o;
+              i = (o + 28) | 0;
+              if (!b) qa(111282, 84407, 153, 84488);
+              if (!d) qa(111312, 84407, 154, 84488);
+              if (!(c[(d + 8) >> 2] | 0)) qa(111315, 84407, 155, 84488);
+              j = (d + 52) | 0;
+              if (c[j >> 2] | 0) {
+                f = (d + 60) | 0;
+                g = c[f >> 2] | 0;
+                if ((g | 0) == 100) g = 18;
+                else {
+                  tb[g & 127](d);
+                  c[j >> 2] = 0;
+                  c[f >> 2] = 0;
+                  c[(d + 56) >> 2] = 0;
+                  g = 10;
+                }
+              } else g = 10;
+              do
+                if ((g | 0) == 10) {
+                  if (!(((OF(d) | 0) << 24) >> 24)) break;
+                  f = A6(c[(d + 20) >> 2] | 0) | 0;
+                  if (((c[(d + 24) >> 2] & -2) | 0) == 6) {
+                    Z4(f, i) | 0;
+                    i = c[(i + 36) >> 2] | 0;
+                    c[(d + 56) >> 2] = i;
+                    f = j2(0, i, 1, 1, f, 0) | 0;
+                    c[j >> 2] = f;
+                    a[(d + 16) >> 0] = 1;
+                  } else f = c[j >> 2] | 0;
+                  if (f | 0) c[(d + 60) >> 2] = 100;
+                  PF(d);
+                  if (c[j >> 2] | 0) g = 18;
+                }
+              while (0);
+              if ((g | 0) == 18) {
+                p = +h[(e + 8) >> 3] - +(c[(d + 36) >> 2] | 0);
+                h[k >> 3] = +h[e >> 3] - +(c[(d + 32) >> 2] | 0);
+                h[(k + 8) >> 3] = p;
+                uF(b, 84506, k);
+                if (!(a[(d + 16) >> 0] | 0)) {
+                  c[m >> 2] = c[(d + 12) >> 2];
+                  uF(b, 84537, m);
+                } else zM(b, d);
+                uF(b, 84552, n);
+              }
+              l = o;
+              return;
+            }
+            function Kf(a) {
+              a = a | 0;
+              h2(c[(a + 52) >> 2] | 0, c[(a + 56) >> 2] | 0) | 0;
+              return;
+            }
+            function Lf(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              g = l;
+              l = (l + 80) | 0;
+              f = (g + 48) | 0;
+              if (!a) qa(111282, 84407, 121, 84562);
+              e = c[(a + 16) >> 2] | 0;
+              if (!e) qa(99902, 84407, 123, 84562);
+              if (!b) qa(111312, 84407, 124, 84562);
+              d = (b + 8) | 0;
+              if (!(c[d >> 2] | 0)) qa(111315, 84407, 125, 84562);
+              if (!(c[(e + 8) >> 2] | 0)) qa(138879, 84407, 128, 84562);
+              else {
+                uF(a, 84582, g);
+                uF(a, 84591, (g + 8) | 0);
+                uF(a, 84618, (g + 16) | 0);
+                uF(a, 84643, (g + 24) | 0);
+                uF(a, 84672, (g + 32) | 0);
+                uF(a, 84700, (g + 40) | 0);
+                c[f >> 2] = c[d >> 2];
+                uF(a, 84707, f);
+                uF(a, 84746, (g + 56) | 0);
+                uF(a, 111008, (g + 64) | 0);
+                l = g;
+                return;
+              }
+            }
+            function Mf(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0.0;
+              i = l;
+              l = (l + 128) | 0;
+              g = (i + 80) | 0;
+              f = i;
+              if (!a) qa(111282, 84407, 97, 84751);
+              if (!b) qa(111312, 84407, 98, 84751);
+              e = c[(b + 8) >> 2] | 0;
+              if (!e) qa(111315, 84407, 99, 84751);
+              else {
+                m = +h[d >> 3];
+                j = ~~(m + (m >= 0.0 ? 0.5 : -0.5));
+                m = +h[(d + 8) >> 3];
+                b = ~~(m + (m >= 0.0 ? 0.5 : -0.5));
+                m = +h[(d + 16) >> 3];
+                k = ~~(m + (m >= 0.0 ? 0.5 : -0.5));
+                m = +h[(d + 24) >> 3];
+                d = ~~(m + (m >= 0.0 ? 0.5 : -0.5));
+                c[f >> 2] = 2;
+                c[(f + 4) >> 2] = 5;
+                c[(f + 8) >> 2] = 0;
+                c[(f + 12) >> 2] = 0;
+                c[(f + 16) >> 2] = 0;
+                c[(f + 20) >> 2] = -1;
+                c[(f + 24) >> 2] = 1;
+                c[(f + 28) >> 2] = -1;
+                c[(f + 32) >> 2] = 0;
+                h[(f + 40) >> 3] = 0.0;
+                c[(f + 48) >> 2] = 0;
+                c[(f + 52) >> 2] = 0;
+                c[(f + 56) >> 2] = 0;
+                c[(f + 60) >> 2] = 0;
+                c[(f + 64) >> 2] = 0;
+                c[(f + 68) >> 2] = 5;
+                c[(f + 72) >> 2] = 0;
+                c[(f + 76) >> 2] = e;
+                uF(a, 84770, f);
+                c[g >> 2] = j;
+                c[(g + 4) >> 2] = b;
+                c[(g + 8) >> 2] = j;
+                c[(g + 12) >> 2] = d;
+                c[(g + 16) >> 2] = k;
+                c[(g + 20) >> 2] = d;
+                c[(g + 24) >> 2] = k;
+                c[(g + 28) >> 2] = b;
+                c[(g + 32) >> 2] = j;
+                c[(g + 36) >> 2] = b;
+                uF(a, 84828, g);
+                l = i;
+                return;
+              }
+            }
+            function Nf(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              o = l;
+              l = (l + 96) | 0;
+              n = (o + 56) | 0;
+              m = (o + 32) | 0;
+              k = o;
+              i = +h[d >> 3];
+              j = +h[(d + 16) >> 3] - i;
+              f = +h[(d + 24) >> 3];
+              g = f - +h[(d + 8) >> 3];
+              if (!a) qa(111282, 84407, 53, 84860);
+              if (!b) qa(111312, 84407, 54, 84860);
+              e = (b + 8) | 0;
+              if (!(c[e >> 2] | 0)) qa(111315, 84407, 55, 84860);
+              oF(a, 84879) | 0;
+              oF(a, c[e >> 2] | 0) | 0;
+              e = (a + 360) | 0;
+              f = -f;
+              if (!(c[e >> 2] | 0)) {
+                h[n >> 3] = j;
+                h[(n + 8) >> 3] = g;
+                h[(n + 16) >> 3] = i;
+                h[(n + 24) >> 3] = f;
+                uF(a, 85008, n);
+              } else {
+                h[k >> 3] = g;
+                h[(k + 8) >> 3] = j;
+                h[(k + 16) >> 3] = i;
+                h[(k + 24) >> 3] = f;
+                uF(a, 84899, k);
+                c[m >> 2] = c[e >> 2];
+                h[(m + 8) >> 3] = i;
+                h[(m + 16) >> 3] = f;
+                uF(a, 84978, m);
+              }
+              oF(a, 85087) | 0;
+              l = o;
+              return;
+            }
+            function Of(a) {
+              a = a | 0;
+              var b = 0,
+                c = 0;
+              b = jC(a) | 0;
+              while (1) {
+                if (!b) break;
+                Pf(b);
+                b = kC(a, b) | 0;
+              }
+              c = jC(a) | 0;
+              while (1) {
+                if (!c) break;
+                b = XA(a, c) | 0;
+                while (1) {
+                  if (!b) break;
+                  Qf(b);
+                  b = ZA(a, b) | 0;
+                }
+                c = kC(a, c) | 0;
+              }
+              return;
+            }
+            function Pf(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              TC(a, 137447, 304, 1) | 0;
+              sP(a);
+              qQ(a, c[((c[((xC(a) | 0) + 16) >> 2] | 0) + 116) >> 2] & 1);
+              a = (a + 16) | 0;
+              c[((c[a >> 2] | 0) + 176) >> 2] = 0;
+              b = JK(20) | 0;
+              d = c[a >> 2] | 0;
+              c[(d + 172) >> 2] = b;
+              c[(d + 184) >> 2] = 0;
+              d = JK(20) | 0;
+              b = c[a >> 2] | 0;
+              c[(b + 180) >> 2] = d;
+              c[(b + 200) >> 2] = 0;
+              b = JK(12) | 0;
+              d = c[a >> 2] | 0;
+              c[(d + 196) >> 2] = b;
+              c[(d + 192) >> 2] = 0;
+              d = JK(12) | 0;
+              b = c[a >> 2] | 0;
+              c[(b + 188) >> 2] = d;
+              c[(b + 208) >> 2] = 0;
+              b = JK(12) | 0;
+              a = c[a >> 2] | 0;
+              c[(a + 204) >> 2] = b;
+              c[(a + 216) >> 2] = 1;
+              return;
+            }
+            function Qf(d) {
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              TC(d, 137460, 176, 1) | 0;
+              tP(d) | 0;
+              h = ZO(d, c[47174] | 0, 1, 0) | 0;
+              g = (d + 16) | 0;
+              c[((c[g >> 2] | 0) + 156) >> 2] = h;
+              h = aP(c[((((c[d >> 2] & 3) | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0, c[47168] | 0, 195059) | 0;
+              i = aP(c[((((c[d >> 2] & 3) | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0, c[47168] | 0, 195059) | 0;
+              e = c[g >> 2] | 0;
+              f = (e + 154) | 0;
+              b[f >> 1] = 1;
+              b[(e + 168) >> 1] = 1;
+              if (((h | 0) == (i | 0)) & ((a[h >> 0] | 0) != 0)) {
+                b[f >> 1] = 1e3;
+                i = (e + 156) | 0;
+                c[i >> 2] = (c[i >> 2] | 0) * 100;
+              }
+              if (Mk(d) | 0) {
+                i = c[g >> 2] | 0;
+                b[(i + 154) >> 1] = 0;
+                c[(i + 156) >> 2] = 0;
+              }
+              i = (ZO(d, c[47187] | 0, 0, 0) | 0) & 255;
+              a[((c[g >> 2] | 0) + 152) >> 0] = i;
+              i = (ZO(d, c[47175] | 0, 1, 0) | 0) & 65535;
+              b[((c[g >> 2] | 0) + 170) >> 1] = i;
+              return;
+            }
+            function Rf(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              Sf(c[((c[(a + 16) >> 2] | 0) + 192) >> 2] | 0);
+              d = jC(a) | 0;
+              while (1) {
+                if (!d) break;
+                b = XA(a, d) | 0;
+                while (1) {
+                  if (!b) break;
+                  YP(b);
+                  b = ZA(a, b) | 0;
+                }
+                Tf(d);
+                d = kC(a, d) | 0;
+              }
+              Uf(a);
+              return;
+            }
+            function Sf(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              while (1) {
+                if (!b) break;
+                f = (b + 16) | 0;
+                g = c[((c[f >> 2] | 0) + 164) >> 2] | 0;
+                Vf(b);
+                d = c[f >> 2] | 0;
+                if ((a[(d + 156) >> 0] | 0) != 1) {
+                  b = g;
+                  continue;
+                }
+                e = c[(d + 180) >> 2] | 0;
+                if (e) {
+                  U1(e);
+                  d = c[f >> 2] | 0;
+                }
+                e = c[(d + 172) >> 2] | 0;
+                if (e) {
+                  U1(e);
+                  d = c[f >> 2] | 0;
+                }
+                U1(d);
+                U1(b);
+                b = g;
+              }
+              return;
+            }
+            function Tf(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              e = (a + 16) | 0;
+              b = c[e >> 2] | 0;
+              d = c[(b + 172) >> 2] | 0;
+              if (d) {
+                U1(d);
+                b = c[e >> 2] | 0;
+              }
+              d = c[(b + 180) >> 2] | 0;
+              if (d) {
+                U1(d);
+                b = c[e >> 2] | 0;
+              }
+              d = c[(b + 188) >> 2] | 0;
+              if (d) {
+                U1(d);
+                b = c[e >> 2] | 0;
+              }
+              d = c[(b + 196) >> 2] | 0;
+              if (d) {
+                U1(d);
+                b = c[e >> 2] | 0;
+              }
+              d = c[(b + 204) >> 2] | 0;
+              if (d) {
+                U1(d);
+                b = c[e >> 2] | 0;
+              }
+              CK(c[(b + 104) >> 2] | 0);
+              CK(c[((c[e >> 2] | 0) + 108) >> 2] | 0);
+              b = c[((c[e >> 2] | 0) + 8) >> 2] | 0;
+              if (b | 0) tb[c[((c[(b + 4) >> 2] | 0) + 4) >> 2] & 127](a);
+              VC(a, 137447) | 0;
+              return;
+            }
+            function Uf(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              d = OD(a) | 0;
+              while (1) {
+                if (!d) break;
+                Uf(d);
+                d = PD(d) | 0;
+              }
+              if (TC(a, 137483, 0, 1) | 0) {
+                f = (a + 16) | 0;
+                d = c[f >> 2] | 0;
+                e = c[(d + 184) >> 2] | 0;
+                if (e) {
+                  U1(e);
+                  d = c[f >> 2] | 0;
+                }
+                e = c[(d + 268) >> 2] | 0;
+                if (e) {
+                  U1(e);
+                  d = c[f >> 2] | 0;
+                }
+                e = c[(d + 216) >> 2] | 0;
+                if (e) {
+                  U1(e);
+                  d = c[f >> 2] | 0;
+                }
+                do
+                  if (c[(d + 196) >> 2] | 0) {
+                    e = b[(d + 236) >> 1] | 0;
+                    while (1) {
+                      if ((e | 0) > (b[(d + 238) >> 1] | 0)) break;
+                      U1(c[((c[(d + 196) >> 2] | 0) + (e << 6) + 12) >> 2] | 0);
+                      e = (e + 1) | 0;
+                      d = c[f >> 2] | 0;
+                    }
+                    e = c[(d + 196) >> 2] | 0;
+                    if ((b[(d + 236) >> 1] | 0) == -1) {
+                      U1((e + -64) | 0);
+                      break;
+                    } else {
+                      U1(e);
+                      break;
+                    }
+                  }
+                while (0);
+                if ((yC(a) | 0) != (a | 0)) {
+                  CK(c[((c[f >> 2] | 0) + 12) >> 2] | 0);
+                  VC(a, 137483) | 0;
+                }
+              }
+              return;
+            }
+            function Vf(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              e = (a + 16) | 0;
+              d = c[e >> 2] | 0;
+              b = c[(d + 176) >> 2] | 0;
+              while (1) {
+                a = (b + -1) | 0;
+                if ((b | 0) <= 0) break;
+                b = c[((c[(d + 172) >> 2] | 0) + (a << 2)) >> 2] | 0;
+                ih(b);
+                U1(c[(b + 16) >> 2] | 0);
+                U1(b);
+                b = a;
+                d = c[e >> 2] | 0;
+              }
+              b = c[(d + 184) >> 2] | 0;
+              while (1) {
+                a = (b + -1) | 0;
+                if ((b | 0) <= 0) break;
+                b = c[((c[((c[e >> 2] | 0) + 180) >> 2] | 0) + (a << 2)) >> 2] | 0;
+                ih(b);
+                U1(c[(b + 16) >> 2] | 0);
+                U1(b);
+                b = a;
+              }
+              return;
+            }
+            function Wf(a) {
+              a = a | 0;
+              if (tB(a) | 0) Xf(a);
+              tM(a);
+              return;
+            }
+            function Xf(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 48) | 0;
+              g = (h + 32) | 0;
+              f = h;
+              b = lH(a, -1, 8) | 0;
+              d = mH(a, 0, f) | 0;
+              kH(a, 2, 8, f) | 0;
+              d = (d | 0) == 0;
+              e = (b | 0) < 0;
+              if (e & d) Yf(a);
+              else {
+                if (d) c[(f + 16) >> 2] = 3;
+                else b = e ? 8 : b;
+                c[(f + 8) >> 2] = b;
+                c[(f + 20) >> 2] = 0;
+                e = GG(a, g, 0) | 0;
+                b = c[g >> 2] | 0;
+                do
+                  if ((b | 0) == 1) {
+                    Yf(a);
+                    b = 0;
+                  } else {
+                    if (c[((c[((c[(a + 16) >> 2] | 0) + 8) >> 2] | 0) + 84) >> 2] | 0) {
+                      Yf(a);
+                      b = 0;
+                      break;
+                    }
+                    c[(f + 12) >> 2] = 1;
+                    d = 0;
+                    while (1) {
+                      if ((d | 0) >= (b | 0)) break;
+                      b = c[(e + (d << 2)) >> 2] | 0;
+                      Zf(b, a);
+                      Yf(b);
+                      d = (d + 1) | 0;
+                      b = c[g >> 2] | 0;
+                    }
+                    _f(a);
+                    jH(c[g >> 2] | 0, e, a, f) | 0;
+                    $f(a);
+                    ag(c[g >> 2] | 0, e, a);
+                    b = 0;
+                  }
+                while (0);
+                while (1) {
+                  if ((b | 0) >= (c[g >> 2] | 0)) break;
+                  f = (e + (b << 2)) | 0;
+                  U1(c[((c[((c[f >> 2] | 0) + 16) >> 2] | 0) + 8) >> 2] | 0);
+                  Uf(c[f >> 2] | 0);
+                  wC(a, c[f >> 2] | 0) | 0;
+                  b = (b + 1) | 0;
+                }
+                U1(e);
+              }
+              l = h;
+              return;
+            }
+            function Yf(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              m = l;
+              l = (l + 48) | 0;
+              k = (m + 40) | 0;
+              e = m;
+              i = ZO(a, GA(a, 0, 85102, 0) | 0, -1, 1) | 0;
+              oQ(a, 10);
+              d = Lk(a, e) | 0;
+              cg(a, a);
+              Of(a);
+              f = (i | 0) == 1;
+              g = (e + 32) | 0;
+              h = (i | 0) == 2;
+              i = (i | 0) == 3;
+              j = (e + 28) | 0;
+              e = (e + 24) | 0;
+              while (1) {
+                xj(a, d);
+                if (f) {
+                  d = 3;
+                  break;
+                }
+                if (c[g >> 2] | 0) {
+                  gA(0, 85108, k) | 0;
+                  c[e >> 2] = 0;
+                  d = 0;
+                }
+                Hh(a, ((d | 0) != 0) & 1);
+                if (h) {
+                  d = 7;
+                  break;
+                }
+                Ki(a, d);
+                if (i) {
+                  d = 9;
+                  break;
+                }
+                n = ((c[j >> 2] | 0) + -1) | 0;
+                c[j >> 2] = n;
+                if (!(((n | 0) != 0) & ((c[e >> 2] | 0) != 0))) {
+                  d = 11;
+                  break;
+                }
+              }
+              if ((d | 0) == 3) dg(a, 1);
+              else if ((d | 0) == 7) dg(a, 2);
+              else if ((d | 0) == 9) dg(a, 2);
+              else if ((d | 0) == 11) {
+                if (b[((c[(a + 16) >> 2] | 0) + 136) >> 1] & 16) eg(a);
+                rk(a);
+                ig(a);
+                if (((dP(QA(a, 85199) | 0) | 0) << 24) >> 24) ll(a);
+              }
+              l = m;
+              return;
+            }
+            function Zf(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              TC(b, 137483, 280, 1) | 0;
+              e = JK(96) | 0;
+              b = c[(b + 16) >> 2] | 0;
+              c[(b + 8) >> 2] = e;
+              d = c[(d + 16) >> 2] | 0;
+              f = c[(d + 8) >> 2] | 0;
+              h[e >> 3] = +h[f >> 3];
+              h[(e + 24) >> 3] = +h[(f + 24) >> 3];
+              c[(b + 144) >> 2] = c[(d + 144) >> 2];
+              a[(b + 115) >> 0] = a[(d + 115) >> 0] | 0;
+              c[(b + 116) >> 2] = c[(d + 116) >> 2];
+              c[(b + 248) >> 2] = c[(d + 248) >> 2];
+              c[(b + 252) >> 2] = c[(d + 252) >> 2];
+              c[(b + 244) >> 2] = c[(d + 244) >> 2];
+              return;
+            }
+            function _f(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              b = JK((tB(a) | 0) << 4) | 0;
+              d = jC(a) | 0;
+              while (1) {
+                if (!d) break;
+                e = c[(d + 16) >> 2] | 0;
+                c[(e + 132) >> 2] = b;
+                h[b >> 3] = +h[(e + 16) >> 3] * 0.013888888888888888;
+                h[(b + 8) >> 3] = +h[(e + 24) >> 3] * 0.013888888888888888;
+                b = (b + 16) | 0;
+                d = kC(a, d) | 0;
+              }
+              return;
+            }
+            function $f(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              e = c[((c[((jC(a) | 0) + 16) >> 2] | 0) + 132) >> 2] | 0;
+              b = e;
+              d = jC(a) | 0;
+              while (1) {
+                if (!d) break;
+                f = c[(d + 16) >> 2] | 0;
+                c[(f + 132) >> 2] = 0;
+                h[(f + 16) >> 3] = +h[b >> 3] * 72.0;
+                h[(f + 24) >> 3] = +h[(b + 8) >> 3] * 72.0;
+                b = (b + 16) | 0;
+                d = kC(a, d) | 0;
+              }
+              U1(e);
+              return;
+            }
+            function ag(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              e = 0;
+              f = 0;
+              while (1) {
+                if ((e | 0) >= (a | 0)) break;
+                i = ((c[((c[((c[(b + (e << 2)) >> 2] | 0) + 16) >> 2] | 0) + 180) >> 2] | 0) + f) | 0;
+                e = (e + 1) | 0;
+                f = i;
+              }
+              i = (d + 16) | 0;
+              c[((c[i >> 2] | 0) + 180) >> 2] = f;
+              g = JK(((f << 2) + 4) | 0) | 0;
+              c[((c[i >> 2] | 0) + 184) >> 2] = g;
+              g = 0;
+              e = 1;
+              while (1) {
+                if ((g | 0) >= (a | 0)) break;
+                h = ((c[(b + (g << 2)) >> 2] | 0) + 16) | 0;
+                f = 1;
+                while (1) {
+                  d = c[h >> 2] | 0;
+                  if ((f | 0) > (c[(d + 180) >> 2] | 0)) break;
+                  d = FG(c[((c[(d + 184) >> 2] | 0) + (f << 2)) >> 2] | 0) | 0;
+                  c[((c[((c[i >> 2] | 0) + 184) >> 2] | 0) + (e << 2)) >> 2] = d;
+                  bg(c[((c[((c[h >> 2] | 0) + 184) >> 2] | 0) + (f << 2)) >> 2] | 0, d);
+                  f = (f + 1) | 0;
+                  e = (e + 1) | 0;
+                }
+                g = (g + 1) | 0;
+              }
+              return;
+            }
+            function bg(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              TC(d, 137483, 280, 1) | 0;
+              g = (d + 16) | 0;
+              d = ((c[g >> 2] | 0) + 16) | 0;
+              f = (b + 16) | 0;
+              b = ((c[f >> 2] | 0) + 16) | 0;
+              c[d >> 2] = c[b >> 2];
+              c[(d + 4) >> 2] = c[(b + 4) >> 2];
+              c[(d + 8) >> 2] = c[(b + 8) >> 2];
+              c[(d + 12) >> 2] = c[(b + 12) >> 2];
+              c[(d + 16) >> 2] = c[(b + 16) >> 2];
+              c[(d + 20) >> 2] = c[(b + 20) >> 2];
+              c[(d + 24) >> 2] = c[(b + 24) >> 2];
+              c[(d + 28) >> 2] = c[(b + 28) >> 2];
+              b = c[f >> 2] | 0;
+              d = c[g >> 2] | 0;
+              a[(d + 275) >> 0] = a[(b + 275) >> 0] | 0;
+              d = (d + 48) | 0;
+              b = (b + 48) | 0;
+              e = (d + 64) | 0;
+              do {
+                c[d >> 2] = c[b >> 2];
+                d = (d + 4) | 0;
+                b = (b + 4) | 0;
+              } while ((d | 0) < (e | 0));
+              b = c[((c[f >> 2] | 0) + 180) >> 2] | 0;
+              c[((c[g >> 2] | 0) + 180) >> 2] = b;
+              d = JK(((b << 2) + 4) | 0) | 0;
+              c[((c[g >> 2] | 0) + 184) >> 2] = d;
+              d = 1;
+              while (1) {
+                e = c[f >> 2] | 0;
+                if ((d | 0) > (b | 0)) break;
+                e = FG(c[((c[(e + 184) >> 2] | 0) + (d << 2)) >> 2] | 0) | 0;
+                c[((c[((c[g >> 2] | 0) + 184) >> 2] | 0) + (d << 2)) >> 2] = e;
+                bg(c[((c[((c[f >> 2] | 0) + 184) >> 2] | 0) + (d << 2)) >> 2] | 0, e);
+                d = (d + 1) | 0;
+              }
+              f = (e + 12) | 0;
+              c[((c[g >> 2] | 0) + 12) >> 2] = c[f >> 2];
+              c[f >> 2] = 0;
+              return;
+            }
+            function cg(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if ((yC(a) | 0) != (a | 0)) TC(a, 137483, 280, 1) | 0;
+              if ((a | 0) == (b | 0)) c[((c[((yC(a) | 0) + 16) >> 2] | 0) + 188) >> 2] = a;
+              a = OD(a) | 0;
+              while (1) {
+                if (!a) break;
+                cg(a, b);
+                a = PD(a) | 0;
+              }
+              return;
+            }
+            function dg(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              m = l;
+              l = (l + 1040) | 0;
+              k = (m + 8) | 0;
+              j = m;
+              e = (m + 16) | 0;
+              f = GA(a, 1, 87171, 195059) | 0;
+              g = GA(a, 1, 85242, 195059) | 0;
+              h = (b | 0) > 0;
+              d = (b | 0) == 1;
+              b = jC(a) | 0;
+              while (1) {
+                if (!b) break;
+                if (
+                  h
+                    ? ((i = (b + 16) | 0),
+                      (c[j >> 2] = c[((c[i >> 2] | 0) + 232) >> 2]),
+                      m4(e, 137395, j) | 0,
+                      KA(b, f, e) | 0,
+                      !d)
+                    : 0
+                ) {
+                  c[k >> 2] = c[((c[i >> 2] | 0) + 236) >> 2];
+                  m4(e, 137395, k) | 0;
+                  KA(b, g, e) | 0;
+                }
+                b = kC(a, b) | 0;
+              }
+              l = m;
+              return;
+            }
+            function eg(a) {
+              a = a | 0;
+              var b = 0,
+                c = 0,
+                d = 0;
+              c = ND(a, 86675, 0) | 0;
+              if (c | 0) {
+                b = jC(c) | 0;
+                while (1) {
+                  if (!b) break;
+                  d = kC(c, b) | 0;
+                  qh(a, b);
+                  fg(a, b);
+                  Tf(b);
+                  vC(a, b) | 0;
+                  b = d;
+                }
+                RD(a, c) | 0;
+              }
+              return;
+            }
+            function fg(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              j = c[((c[(b + 16) >> 2] | 0) + 232) >> 2] | 0;
+              i = (a + 16) | 0;
+              a = c[((c[i >> 2] | 0) + 196) >> 2] | 0;
+              d = c[(a + (j << 6)) >> 2] | 0;
+              h = (a + (j << 6) + 4) | 0;
+              g = 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (d | 0)) {
+                  f = 7;
+                  break;
+                }
+                f = c[((c[h >> 2] | 0) + (e << 2)) >> 2] | 0;
+                e = (e + 1) | 0;
+                if ((f | 0) == (b | 0)) {
+                  f = 4;
+                  break;
+                } else g = f;
+              }
+              if ((f | 0) == 4) {
+                while (1) {
+                  if ((e | 0) >= (d | 0)) break;
+                  f = c[(a + (j << 6) + 4) >> 2] | 0;
+                  c[(f + ((e + -1) << 2)) >> 2] = c[(f + (e << 2)) >> 2];
+                  f = c[((c[i >> 2] | 0) + 196) >> 2] | 0;
+                  e = (e + 1) | 0;
+                  d = c[(f + (j << 6)) >> 2] | 0;
+                  a = f;
+                  f = 4;
+                }
+                c[(a + (j << 6)) >> 2] = d + -1;
+              } else if ((f | 0) == 7 ? (g | 0) != (b | 0) : 0) qa(85208, 85215, 248, 85225);
+              return;
+            }
+            function gg(a) {
+              a = a | 0;
+              return c[((c[((yC(a) | 0) + 16) >> 2] | 0) + 188) >> 2] | 0;
+            }
+            function hg(b, c) {
+              b = b | 0;
+              c = c | 0;
+              var d = 0;
+              d = a[(b + 28) >> 0] | 0;
+              if (a[(c + 28) >> 0] | 0)
+                if ((d << 24) >> 24) {
+                  d = ~~(+h[b >> 3] - +h[c >> 3]);
+                  if (!d) d = ~~(+h[(b + 8) >> 3] - +h[(c + 8) >> 3]);
+                } else d = -1;
+              else d = ((d << 24) >> 24 != 0) & 1;
+              return d | 0;
+            }
+            function ig(a) {
+              a = a | 0;
+              jg(a, 1);
+              return;
+            }
+            function jg(d, e) {
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0.0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                O = 0,
+                P = 0,
+                Q = 0,
+                R = 0,
+                S = 0,
+                T = 0,
+                U = 0,
+                V = 0,
+                W = 0,
+                X = 0,
+                Y = 0,
+                Z = 0,
+                _ = 0.0;
+              Z = l;
+              l = (l + 656) | 0;
+              O = (Z + 592) | 0;
+              N = (Z + 552) | 0;
+              f = (Z + 544) | 0;
+              T = (Z + 96) | 0;
+              U = Z;
+              Y = (Z + 632) | 0;
+              V = (d + 16) | 0;
+              X = b[((c[V >> 2] | 0) + 136) >> 1] & 14;
+              P = X & 65535;
+              Q = (T + 16) | 0;
+              c[Q >> 2] = Z + 368;
+              R = (U + 16) | 0;
+              c[R >> 2] = Z + 192;
+              do
+                if ((X << 16) >> 16) {
+                  S = (X << 16) >> 16 == 4;
+                  do
+                    if (S) {
+                      kg(d);
+                      if (!(a[((c[((c[(d + 60) >> 2] | 0) + 16) >> 2] | 0) + 113) >> 0] & 1)) A = 9;
+                      else {
+                        gA(0, 85248, f) | 0;
+                        A = 9;
+                      }
+                    } else if ((X << 16) >> 16 == 8) {
+                      kg(d);
+                      if (!(a[((c[((c[(d + 60) >> 2] | 0) + 16) >> 2] | 0) + 113) >> 0] & 1)) {
+                        rQ(d, 0);
+                        n = 0;
+                        m = 0;
+                        k = 0;
+                        break;
+                      } else {
+                        lg(d);
+                        rQ(d, 1);
+                        n = 0;
+                        m = 0;
+                        k = 0;
+                        break;
+                      }
+                    } else A = 9;
+                  while (0);
+                  if ((A | 0) == 9) {
+                    jl(d);
+                    if (FM() | 0) break;
+                    W = JK(96) | 0;
+                    K = c[((c[V >> 2] | 0) + 248) >> 2] | 0;
+                    c[(Y + 8) >> 2] = ((K | 0) / 4) | 0;
+                    c[(Y + 12) >> 2] = K;
+                    k = JK(512) | 0;
+                    F = (Y + 4) | 0;
+                    c[F >> 2] = 0;
+                    c[Y >> 2] = 0;
+                    j = c[V >> 2] | 0;
+                    C = b[(j + 236) >> 1] | 0;
+                    D = 0;
+                    L = 0;
+                    M = k;
+                    E = k;
+                    m = k;
+                    n = k;
+                    o = k;
+                    H = 0;
+                    I = 0;
+                    a: while (1) {
+                      if ((C | 0) > (b[(j + 238) >> 1] | 0)) break;
+                      p = c[(j + 196) >> 2] | 0;
+                      i = c[(p + (C << 6)) >> 2] | 0;
+                      G = (i + D) | 0;
+                      g = c[(p + (C << 6) + 4) >> 2] | 0;
+                      f = c[g >> 2] | 0;
+                      if (!f) f = H;
+                      else {
+                        _ = +(H | 0);
+                        f = c[(f + 16) >> 2] | 0;
+                        y = +h[(f + 16) >> 3] - +h[(f + 88) >> 3];
+                        f = ~~(y > _ ? _ : y);
+                      }
+                      if ((i | 0) != 0 ? ((J = c[(g + ((i + -1) << 2)) >> 2] | 0), (J | 0) != 0) : 0) {
+                        y = +(I | 0);
+                        g = c[(J + 16) >> 2] | 0;
+                        _ = +h[(g + 96) >> 3] + +h[(g + 16) >> 3];
+                        g = ~~(_ < y ? y : _);
+                      } else g = I;
+                      B = (f + -16) | 0;
+                      z = (g + 16) | 0;
+                      x = 0;
+                      t = L;
+                      r = M;
+                      q = j;
+                      u = E;
+                      v = m;
+                      g = k;
+                      f = p;
+                      while (1) {
+                        if ((x | 0) >= (i | 0)) break;
+                        k = c[((c[(f + (C << 6) + 4) >> 2] | 0) + (x << 2)) >> 2] | 0;
+                        w = (k + 16) | 0;
+                        f = c[w >> 2] | 0;
+                        i = c[(f + 112) >> 2] | 0;
+                        if (i) {
+                          i = (i + 16) | 0;
+                          j = c[((c[i >> 2] | 0) + 96) >> 2] | 0;
+                          if (!j) {
+                            A = 21;
+                            break a;
+                          }
+                          s = (j + 56) | 0;
+                          f = (f + 16) | 0;
+                          c[s >> 2] = c[f >> 2];
+                          c[(s + 4) >> 2] = c[(f + 4) >> 2];
+                          c[(s + 8) >> 2] = c[(f + 8) >> 2];
+                          c[(s + 12) >> 2] = c[(f + 12) >> 2];
+                          a[((c[((c[i >> 2] | 0) + 96) >> 2] | 0) + 81) >> 0] = 1;
+                          f = c[w >> 2] | 0;
+                        }
+                        if ((a[(f + 156) >> 0] | 0) != 0 ? ((kb[c[17300 >> 2] & 63](k) | 0) << 24) >> 24 == 0 : 0) {
+                          q = t;
+                          f = r;
+                          j = u;
+                          k = v;
+                          i = o;
+                        } else {
+                          s = 0;
+                          q = t;
+                          j = u;
+                          k = v;
+                          A = 25;
+                        }
+                        b: do
+                          if ((A | 0) == 25) {
+                            while (1) {
+                              A = 0;
+                              p = c[w >> 2] | 0;
+                              i = c[((c[(p + 180) >> 2] | 0) + (s << 2)) >> 2] | 0;
+                              if (!i) break;
+                              switch (a[((c[(i + 16) >> 2] | 0) + 112) >> 0] | 0) {
+                                case 6:
+                                case 4: {
+                                  f = q;
+                                  i = r;
+                                  break;
+                                }
+                                default: {
+                                  mg(i, 1, 16, 64);
+                                  f = (q + 1) | 0;
+                                  c[(r + (q << 2)) >> 2] = i;
+                                  if (!(f & 127)) {
+                                    g = MK(g, ((q << 2) + 516) | 0) | 0;
+                                    i = g;
+                                    j = g;
+                                    k = g;
+                                    n = g;
+                                    o = g;
+                                  } else i = r;
+                                }
+                              }
+                              s = (s + 1) | 0;
+                              q = f;
+                              r = i;
+                              A = 25;
+                            }
+                            f = c[(p + 188) >> 2] | 0;
+                            c: do
+                              if (!f) i = o;
+                              else {
+                                s = 0;
+                                i = o;
+                                while (1) {
+                                  f = c[(f + (s << 2)) >> 2] | 0;
+                                  if (!f) break c;
+                                  mg(f, 2, 0, 128);
+                                  o = (q + 1) | 0;
+                                  c[(r + (q << 2)) >> 2] = f;
+                                  if (!(o & 127)) {
+                                    g = MK(i, ((q << 2) + 516) | 0) | 0;
+                                    f = g;
+                                    j = g;
+                                    k = g;
+                                    n = g;
+                                    i = g;
+                                  } else f = r;
+                                  p = c[w >> 2] | 0;
+                                  s = (s + 1) | 0;
+                                  q = o;
+                                  r = f;
+                                  f = c[(p + 188) >> 2] | 0;
+                                }
+                              }
+                            while (0);
+                            f = c[(p + 204) >> 2] | 0;
+                            if (!f) f = r;
+                            else {
+                              if (!(a[(p + 156) >> 0] | 0)) {
+                                v = (p + 96) | 0;
+                                _ = +h[v >> 3];
+                                s = (p + 240) | 0;
+                                h[v >> 3] = +h[s >> 3];
+                                h[s >> 3] = _;
+                                s = 0;
+                                p = r;
+                              } else {
+                                s = 0;
+                                p = r;
+                              }
+                              while (1) {
+                                f = c[(f + (s << 2)) >> 2] | 0;
+                                if (!f) {
+                                  f = p;
+                                  break b;
+                                }
+                                mg(f, 0, 0, 128);
+                                o = (q + 1) | 0;
+                                c[(p + (q << 2)) >> 2] = f;
+                                if (!(o & 127)) {
+                                  g = MK(n, ((q << 2) + 516) | 0) | 0;
+                                  f = g;
+                                  j = g;
+                                  k = g;
+                                  n = g;
+                                  i = g;
+                                } else f = p;
+                                s = (s + 1) | 0;
+                                q = o;
+                                p = f;
+                                f = c[((c[w >> 2] | 0) + 204) >> 2] | 0;
+                              }
+                            }
+                          }
+                        while (0);
+                        u = c[V >> 2] | 0;
+                        w = c[(u + 196) >> 2] | 0;
+                        x = (x + 1) | 0;
+                        t = q;
+                        r = f;
+                        q = u;
+                        u = j;
+                        v = k;
+                        o = i;
+                        i = c[(w + (C << 6)) >> 2] | 0;
+                        f = w;
+                      }
+                      C = (C + 1) | 0;
+                      D = G;
+                      L = t;
+                      M = r;
+                      E = u;
+                      j = q;
+                      m = v;
+                      k = g;
+                      H = B;
+                      I = z;
+                    }
+                    if ((A | 0) == 21) qa(85316, 85329, 313, 85342);
+                    c[Y >> 2] = H;
+                    c[F >> 2] = I;
+                    o4(E, L, 4, 58);
+                    c[(W + 84) >> 2] = JK(((D << 5) + 11520) | 0) | 0;
+                    c[(Y + 16) >> 2] = JK(C << 5) | 0;
+                    d: do
+                      if ((X << 16) >> 16 == 2) {
+                        f = ((c[V >> 2] | 0) + 192) | 0;
+                        while (1) {
+                          g = c[f >> 2] | 0;
+                          if (!g) break d;
+                          i = (g + 16) | 0;
+                          f = c[i >> 2] | 0;
+                          if ((a[(f + 156) >> 0] | 0) == 1 ? (c[(f + 104) >> 2] | 0) != 0 : 0) {
+                            og(g);
+                            f = c[i >> 2] | 0;
+                          }
+                          f = (f + 164) | 0;
+                        }
+                      }
+                    while (0);
+                    z = (U + 48) | 0;
+                    A = (U + -48) | 0;
+                    B = (T + 48) | 0;
+                    C = (T + -48) | 0;
+                    y = +(K | 0);
+                    x = 0;
+                    e: while (1) {
+                      if ((x | 0) >= (L | 0)) break;
+                      v = (M + (x << 2)) | 0;
+                      r = c[v >> 2] | 0;
+                      s = pg(r) | 0;
+                      t = (r + 16) | 0;
+                      g = c[t >> 2] | 0;
+                      if (!(a[(g + 44) >> 0] | 0)) {
+                        g = (a[(g + 84) >> 0] | 0) == 0 ? s : r;
+                        f = g;
+                        g = c[(g + 16) >> 2] | 0;
+                      } else f = r;
+                      i = (f + 16) | 0;
+                      if (c[(g + 164) >> 2] & 32) {
+                        g = c[Q >> 2] | 0;
+                        W6(g | 0, c[i >> 2] | 0, 176) | 0;
+                        n = T;
+                        o = f;
+                        p = (n + 48) | 0;
+                        do {
+                          c[n >> 2] = c[o >> 2];
+                          n = (n + 4) | 0;
+                          o = (o + 4) | 0;
+                        } while ((n | 0) < (p | 0));
+                        c[Q >> 2] = g;
+                        o = c[f >> 2] & 3;
+                        n = c[T >> 2] & 3;
+                        c[(((n | 0) == 3 ? T : B) + 40) >> 2] = c[(((o | 0) == 2 ? f : (f + -48) | 0) + 40) >> 2];
+                        c[(((n | 0) == 2 ? T : C) + 40) >> 2] = c[(((o | 0) == 3 ? f : (f + 48) | 0) + 40) >> 2];
+                        n = (g + 16) | 0;
+                        o = ((c[i >> 2] | 0) + 56) | 0;
+                        p = (n + 40) | 0;
+                        do {
+                          c[n >> 2] = c[o >> 2];
+                          n = (n + 4) | 0;
+                          o = (o + 4) | 0;
+                        } while ((n | 0) < (p | 0));
+                        n = (g + 56) | 0;
+                        o = ((c[i >> 2] | 0) + 16) | 0;
+                        p = (n + 40) | 0;
+                        do {
+                          c[n >> 2] = c[o >> 2];
+                          n = (n + 4) | 0;
+                          o = (o + 4) | 0;
+                        } while ((n | 0) < (p | 0));
+                        a[(g + 112) >> 0] = 1;
+                        c[(g + 116) >> 2] = f;
+                        f = T;
+                      }
+                      q = (f + 16) | 0;
+                      w = 1;
+                      f = x;
+                      while (1) {
+                        u = (f + 1) | 0;
+                        if ((u | 0) >= (L | 0)) break;
+                        j = (M + (u << 2)) | 0;
+                        f = c[j >> 2] | 0;
+                        if ((s | 0) != (pg(f) | 0)) break;
+                        if (!(a[((c[t >> 2] | 0) + 113) >> 0] | 0)) {
+                          k = (f + 16) | 0;
+                          g = c[k >> 2] | 0;
+                          if (!(a[(g + 44) >> 0] | 0)) {
+                            g = (a[(g + 84) >> 0] | 0) == 0 ? s : f;
+                            f = g;
+                            g = c[(g + 16) >> 2] | 0;
+                          }
+                          i = (f + 16) | 0;
+                          if (c[(g + 164) >> 2] & 32) {
+                            g = c[R >> 2] | 0;
+                            W6(g | 0, c[i >> 2] | 0, 176) | 0;
+                            n = U;
+                            o = f;
+                            p = (n + 48) | 0;
+                            do {
+                              c[n >> 2] = c[o >> 2];
+                              n = (n + 4) | 0;
+                              o = (o + 4) | 0;
+                            } while ((n | 0) < (p | 0));
+                            c[R >> 2] = g;
+                            o = c[f >> 2] & 3;
+                            n = c[U >> 2] & 3;
+                            c[(((n | 0) == 3 ? U : z) + 40) >> 2] = c[(((o | 0) == 2 ? f : (f + -48) | 0) + 40) >> 2];
+                            c[(((n | 0) == 2 ? U : A) + 40) >> 2] = c[(((o | 0) == 3 ? f : (f + 48) | 0) + 40) >> 2];
+                            n = (g + 16) | 0;
+                            o = ((c[i >> 2] | 0) + 56) | 0;
+                            p = (n + 40) | 0;
+                            do {
+                              c[n >> 2] = c[o >> 2];
+                              n = (n + 4) | 0;
+                              o = (o + 4) | 0;
+                            } while ((n | 0) < (p | 0));
+                            n = (g + 56) | 0;
+                            o = ((c[i >> 2] | 0) + 16) | 0;
+                            p = (n + 40) | 0;
+                            do {
+                              c[n >> 2] = c[o >> 2];
+                              n = (n + 4) | 0;
+                              o = (o + 4) | 0;
+                            } while ((n | 0) < (p | 0));
+                            a[(g + 112) >> 0] = 1;
+                            c[(g + 116) >> 2] = f;
+                          }
+                          i = c[q >> 2] | 0;
+                          f = (g + 16) | 0;
+                          n = N;
+                          o = (i + 16) | 0;
+                          p = (n + 40) | 0;
+                          do {
+                            c[n >> 2] = c[o >> 2];
+                            n = (n + 4) | 0;
+                            o = (o + 4) | 0;
+                          } while ((n | 0) < (p | 0));
+                          n = O;
+                          o = f;
+                          p = (n + 40) | 0;
+                          do {
+                            c[n >> 2] = c[o >> 2];
+                            n = (n + 4) | 0;
+                            o = (o + 4) | 0;
+                          } while ((n | 0) < (p | 0));
+                          if (hg(N, O) | 0) break;
+                          f = (g + 56) | 0;
+                          n = N;
+                          o = (i + 56) | 0;
+                          p = (n + 40) | 0;
+                          do {
+                            c[n >> 2] = c[o >> 2];
+                            n = (n + 4) | 0;
+                            o = (o + 4) | 0;
+                          } while ((n | 0) < (p | 0));
+                          n = O;
+                          o = f;
+                          p = (n + 40) | 0;
+                          do {
+                            c[n >> 2] = c[o >> 2];
+                            n = (n + 4) | 0;
+                            o = (o + 4) | 0;
+                          } while ((n | 0) < (p | 0));
+                          if (hg(N, O) | 0) break;
+                          K = c[t >> 2] | 0;
+                          if (
+                            ((c[(K + 164) >> 2] & 15) | 0) == 2
+                              ? (c[(K + 96) >> 2] | 0) != (c[((c[k >> 2] | 0) + 96) >> 2] | 0)
+                              : 0
+                          )
+                            break;
+                          if ((c[((c[((c[j >> 2] | 0) + 16) >> 2] | 0) + 164) >> 2] & 64) | 0) break;
+                        }
+                        w = (w + 1) | 0;
+                        f = u;
+                      }
+                      if (S) {
+                        if ((w | 0) == 1) f = O;
+                        else f = JK(w << 2) | 0;
+                        c[f >> 2] = pg(c[v >> 2] | 0) | 0;
+                        g = 1;
+                        while (1) {
+                          if ((g | 0) >= (w | 0)) break;
+                          c[(f + (g << 2)) >> 2] = c[(v + (g << 2)) >> 2];
+                          g = (g + 1) | 0;
+                        }
+                        PM(d, f, w, P, 17296);
+                        if ((w | 0) > 1) U1(f);
+                        x = u;
+                        continue;
+                      }
+                      f = c[r >> 2] & 3;
+                      K = c[(((f | 0) == 3 ? r : (r + 48) | 0) + 40) >> 2] | 0;
+                      f = c[(((f | 0) == 2 ? r : (r + -48) | 0) + 40) >> 2] | 0;
+                      g = c[(K + 16) >> 2] | 0;
+                      i = c[(g + 232) >> 2] | 0;
+                      if ((K | 0) != (f | 0))
+                        if ((i | 0) == (c[((c[(f + 16) >> 2] | 0) + 232) >> 2] | 0)) {
+                          qg(d, Y, W, M, x, w, P);
+                          x = u;
+                          continue;
+                        } else {
+                          rg(d, Y, W, M, x, w, P);
+                          x = u;
+                          continue;
+                        }
+                      f = c[V >> 2] | 0;
+                      do
+                        if ((i | 0) == (b[(f + 238) >> 1] | 0))
+                          if ((i | 0) > 0) {
+                            f = ~~(
+                              +h[
+                                ((c[((c[c[((c[(f + 196) >> 2] | 0) + ((i + -1) << 6) + 4) >> 2] >> 2] | 0) + 16) >> 2] |
+                                  0) +
+                                  24) >>
+                                  3
+                              ] - +h[(g + 24) >> 3]
+                            );
+                            break;
+                          } else {
+                            f = ~~+h[(g + 80) >> 3];
+                            break;
+                          }
+                        else if ((i | 0) == (b[(f + 236) >> 1] | 0)) {
+                          f = ~~(
+                            +h[(g + 24) >> 3] -
+                            +h[
+                              ((c[((c[c[((c[(f + 196) >> 2] | 0) + ((i + 1) << 6) + 4) >> 2] >> 2] | 0) + 16) >> 2] |
+                                0) +
+                                24) >>
+                                3
+                            ]
+                          );
+                          break;
+                        } else {
+                          f = c[(f + 196) >> 2] | 0;
+                          _ = +h[(g + 24) >> 3];
+                          K = ~~(
+                            +h[((c[((c[c[(f + ((i + -1) << 6) + 4) >> 2] >> 2] | 0) + 16) >> 2] | 0) + 24) >> 3] - _
+                          );
+                          f = ~~(
+                            _ - +h[((c[((c[c[(f + ((i + 1) << 6) + 4) >> 2] >> 2] | 0) + 16) >> 2] | 0) + 24) >> 3]
+                          );
+                          f = (K | 0) < (f | 0) ? K : f;
+                          break;
+                        }
+                      while (0);
+                      lO(W, M, x, w, y, +(((f | 0) / 2) | 0 | 0), 17296);
+                      f = 0;
+                      while (1) {
+                        if ((f | 0) >= (w | 0)) {
+                          x = u;
+                          continue e;
+                        }
+                        g = c[((c[((c[(M + ((f + x) << 2)) >> 2] | 0) + 16) >> 2] | 0) + 96) >> 2] | 0;
+                        if (g | 0) zP(d, g);
+                        f = (f + 1) | 0;
+                      }
+                    }
+                    f = ((c[V >> 2] | 0) + 192) | 0;
+                    while (1) {
+                      g = c[f >> 2] | 0;
+                      if (!g) break;
+                      i = (g + 16) | 0;
+                      f = c[i >> 2] | 0;
+                      if ((a[(f + 156) >> 0] | 0) == 1 ? (c[(f + 104) >> 2] | 0) != 0 : 0) {
+                        og(g);
+                        zP(d, c[((c[i >> 2] | 0) + 104) >> 2] | 0);
+                        f = c[i >> 2] | 0;
+                      }
+                      f = (f + 164) | 0;
+                    }
+                    if (!e) {
+                      n = W;
+                      k = W;
+                    } else {
+                      sg(d);
+                      n = W;
+                      k = W;
+                    }
+                  }
+                  f: do
+                    if (
+                      ((c[47197] | 0) != 0) | ((c[47198] | 0) != 0) ? ((c[47203] | 0) != 0) | ((c[47202] | 0) != 0) : 0
+                    ) {
+                      j = jC(d) | 0;
+                      while (1) {
+                        if (!j) break f;
+                        g: do
+                          if (c[47197] | 0) {
+                            f = _A(d, j) | 0;
+                            while (1) {
+                              if (!f) break g;
+                              g = (f + -48) | 0;
+                              i = ((c[f >> 2] & 3) | 0) == 2 ? f : g;
+                              if (c[((c[(i + 16) >> 2] | 0) + 100) >> 2] | 0) {
+                                tO(i, 1) | 0;
+                                zP(d, c[((c[((((c[f >> 2] & 3) | 0) == 2 ? f : g) + 16) >> 2] | 0) + 100) >> 2] | 0);
+                              }
+                              f = $A(d, f) | 0;
+                            }
+                          }
+                        while (0);
+                        h: do
+                          if (c[47198] | 0) {
+                            f = XA(d, j) | 0;
+                            while (1) {
+                              if (!f) break h;
+                              g = (f + 16) | 0;
+                              if (c[((c[g >> 2] | 0) + 104) >> 2] | 0 ? tO(f, 0) | 0 : 0)
+                                zP(d, c[((c[g >> 2] | 0) + 104) >> 2] | 0);
+                              f = ZA(d, f) | 0;
+                            }
+                          }
+                        while (0);
+                        j = kC(d, j) | 0;
+                      }
+                    }
+                  while (0);
+                  switch (X & 15) {
+                    case 4:
+                    case 8:
+                      break;
+                    default: {
+                      U1(m);
+                      U1(c[(n + 84) >> 2] | 0);
+                      U1(k);
+                      U1(c[(Y + 16) >> 2] | 0);
+                      GM();
+                    }
+                  }
+                  c[47138] = 1;
+                  c[47139] = 1;
+                }
+              while (0);
+              l = Z;
+              return;
+            }
+            function kg(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0.0,
+                f = 0;
+              b = jC(a) | 0;
+              while (1) {
+                if (!b) break;
+                d = c[(b + 16) >> 2] | 0;
+                if (c[(d + 204) >> 2] | 0) {
+                  f = (d + 96) | 0;
+                  e = +h[f >> 3];
+                  d = (d + 240) | 0;
+                  h[f >> 3] = +h[d >> 3];
+                  h[d >> 3] = e;
+                }
+                b = kC(a, b) | 0;
+              }
+              return;
+            }
+            function lg(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              d = ((c[(b + 16) >> 2] | 0) + 192) | 0;
+              a: while (1) {
+                f = c[d >> 2] | 0;
+                if (!f) {
+                  d = 12;
+                  break;
+                }
+                g = (f + 16) | 0;
+                d = c[g >> 2] | 0;
+                do
+                  if ((a[(d + 156) >> 0] | 0) == 1) {
+                    e = c[(d + 112) >> 2] | 0;
+                    if (!e) {
+                      e = c[(d + 104) >> 2] | 0;
+                      if (!e) break;
+                      og(f);
+                      d = e;
+                    } else {
+                      e = c[((c[(e + 16) >> 2] | 0) + 96) >> 2] | 0;
+                      if (!e) {
+                        d = 6;
+                        break a;
+                      }
+                      f = (e + 56) | 0;
+                      d = (d + 16) | 0;
+                      c[f >> 2] = c[d >> 2];
+                      c[(f + 4) >> 2] = c[(d + 4) >> 2];
+                      c[(f + 8) >> 2] = c[(d + 8) >> 2];
+                      c[(f + 12) >> 2] = c[(d + 12) >> 2];
+                      a[(e + 81) >> 0] = 1;
+                      d = e;
+                    }
+                    zP(b, d);
+                    d = c[g >> 2] | 0;
+                  }
+                while (0);
+                d = (d + 164) | 0;
+              }
+              if ((d | 0) == 6) qa(85516, 85329, 234, 85535);
+              else if ((d | 0) == 12) return;
+            }
+            function mg(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0;
+              do
+                if (!d) {
+                  g = c[b >> 2] & 3;
+                  d = c[(((g | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0;
+                  g = c[(((g | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0;
+                  if ((d | 0) != (g | 0)) {
+                    d =
+                      (c[((c[(d + 16) >> 2] | 0) + 232) >> 2] | 0) == (c[((c[(g + 16) >> 2] | 0) + 232) >> 2] | 0)
+                        ? 2
+                        : 1;
+                    break;
+                  }
+                  d = c[(b + 16) >> 2] | 0;
+                  if (!(a[(d + 44) >> 0] | 0)) d = (a[(d + 84) >> 0] | 0) == 0 ? 8 : 4;
+                  else d = 4;
+                }
+              while (0);
+              a: do
+                if (!e)
+                  switch (d | 0) {
+                    case 1: {
+                      e = c[b >> 2] & 3;
+                      e =
+                        (c[((c[((c[(((e | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] |
+                          0) <
+                        (c[((c[((c[(((e | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] |
+                          0)
+                          ? 16
+                          : 32;
+                      break a;
+                    }
+                    case 2: {
+                      e = c[b >> 2] & 3;
+                      e =
+                        (c[((c[((c[(((e | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 236) >> 2] |
+                          0) <
+                        (c[((c[((c[(((e | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 236) >> 2] |
+                          0)
+                          ? 16
+                          : 32;
+                      break a;
+                    }
+                    default: {
+                      e = 16;
+                      break a;
+                    }
+                  }
+              while (0);
+              c[((c[(b + 16) >> 2] | 0) + 164) >> 2] = d | f | e;
+              return;
+            }
+            function ng(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0;
+              D = l;
+              l = (l + 624) | 0;
+              z = (D + 584) | 0;
+              y = (D + 544) | 0;
+              s = (D + 368) | 0;
+              e = (D + 192) | 0;
+              t = (D + 96) | 0;
+              v = D;
+              u = (t + 16) | 0;
+              c[u >> 2] = s;
+              w = (v + 16) | 0;
+              c[w >> 2] = e;
+              C = c[b >> 2] | 0;
+              B = c[d >> 2] | 0;
+              x = (C + 16) | 0;
+              q = c[x >> 2] | 0;
+              d = c[(q + 164) >> 2] | 0;
+              f = d & 15;
+              A = (B + 16) | 0;
+              b = c[A >> 2] | 0;
+              g = c[(b + 164) >> 2] & 15;
+              do
+                if ((g | 0) == (f | 0)) {
+                  p = pg(C) | 0;
+                  r = pg(B) | 0;
+                  n = c[p >> 2] | 0;
+                  g = n & 3;
+                  f = c[((c[(((g | 0) == 3 ? p : (p + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                  g = c[((c[(((g | 0) == 2 ? p : (p + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                  i = ((c[(f + 232) >> 2] | 0) - (c[(g + 232) >> 2] | 0)) | 0;
+                  o = c[r >> 2] | 0;
+                  m = o & 3;
+                  k = c[((c[(((m | 0) == 3 ? r : (r + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                  m = c[((c[(((m | 0) == 2 ? r : (r + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                  j = ((c[(k + 232) >> 2] | 0) - (c[(m + 232) >> 2] | 0)) | 0;
+                  i = (i | 0) > -1 ? i : (0 - i) | 0;
+                  j = (j | 0) > -1 ? j : (0 - j) | 0;
+                  if ((i | 0) != (j | 0)) {
+                    b = (i - j) | 0;
+                    break;
+                  }
+                  g = ~~(+h[(f + 16) >> 3] - +h[(g + 16) >> 3]);
+                  g = (g | 0) > -1 ? g : (0 - g) | 0;
+                  f = ~~(+h[(k + 16) >> 3] - +h[(m + 16) >> 3]);
+                  f = (f | 0) > -1 ? f : (0 - f) | 0;
+                  if ((g | 0) != (f | 0)) {
+                    b = (g - f) | 0;
+                    break;
+                  }
+                  g = n >>> 4;
+                  f = o >>> 4;
+                  if ((g | 0) != (f | 0)) {
+                    b = (g - f) | 0;
+                    break;
+                  }
+                  if (!(a[(q + 44) >> 0] | 0)) {
+                    d = (a[(q + 84) >> 0] | 0) == 0 ? p : C;
+                    g = d;
+                    d = c[((c[(d + 16) >> 2] | 0) + 164) >> 2] | 0;
+                  } else g = C;
+                  f = (g + 16) | 0;
+                  if (d & 32) {
+                    W6(s | 0, c[f >> 2] | 0, 176) | 0;
+                    i = t;
+                    j = g;
+                    k = (i + 48) | 0;
+                    do {
+                      c[i >> 2] = c[j >> 2];
+                      i = (i + 4) | 0;
+                      j = (j + 4) | 0;
+                    } while ((i | 0) < (k | 0));
+                    c[u >> 2] = s;
+                    j = c[g >> 2] & 3;
+                    i = c[t >> 2] & 3;
+                    c[(((i | 0) == 3 ? t : (t + 48) | 0) + 40) >> 2] =
+                      c[(((j | 0) == 2 ? g : (g + -48) | 0) + 40) >> 2];
+                    c[(((i | 0) == 2 ? t : (t + -48) | 0) + 40) >> 2] =
+                      c[(((j | 0) == 3 ? g : (g + 48) | 0) + 40) >> 2];
+                    i = (s + 16) | 0;
+                    j = ((c[f >> 2] | 0) + 56) | 0;
+                    k = (i + 40) | 0;
+                    do {
+                      c[i >> 2] = c[j >> 2];
+                      i = (i + 4) | 0;
+                      j = (j + 4) | 0;
+                    } while ((i | 0) < (k | 0));
+                    i = (s + 56) | 0;
+                    j = ((c[f >> 2] | 0) + 16) | 0;
+                    k = (i + 40) | 0;
+                    do {
+                      c[i >> 2] = c[j >> 2];
+                      i = (i + 4) | 0;
+                      j = (j + 4) | 0;
+                    } while ((i | 0) < (k | 0));
+                    a[(s + 112) >> 0] = 1;
+                    c[(s + 116) >> 2] = g;
+                    g = t;
+                    b = c[A >> 2] | 0;
+                  }
+                  if (!(a[(b + 44) >> 0] | 0)) {
+                    b = (a[(b + 84) >> 0] | 0) == 0 ? r : B;
+                    f = b;
+                    b = c[(b + 16) >> 2] | 0;
+                  } else f = B;
+                  d = (f + 16) | 0;
+                  if (!(c[(b + 164) >> 2] & 32)) e = b;
+                  else {
+                    W6(e | 0, c[d >> 2] | 0, 176) | 0;
+                    i = v;
+                    j = f;
+                    k = (i + 48) | 0;
+                    do {
+                      c[i >> 2] = c[j >> 2];
+                      i = (i + 4) | 0;
+                      j = (j + 4) | 0;
+                    } while ((i | 0) < (k | 0));
+                    c[w >> 2] = e;
+                    j = c[f >> 2] & 3;
+                    i = c[v >> 2] & 3;
+                    c[(((i | 0) == 3 ? v : (v + 48) | 0) + 40) >> 2] =
+                      c[(((j | 0) == 2 ? f : (f + -48) | 0) + 40) >> 2];
+                    c[(((i | 0) == 2 ? v : (v + -48) | 0) + 40) >> 2] =
+                      c[(((j | 0) == 3 ? f : (f + 48) | 0) + 40) >> 2];
+                    i = (e + 16) | 0;
+                    j = ((c[d >> 2] | 0) + 56) | 0;
+                    k = (i + 40) | 0;
+                    do {
+                      c[i >> 2] = c[j >> 2];
+                      i = (i + 4) | 0;
+                      j = (j + 4) | 0;
+                    } while ((i | 0) < (k | 0));
+                    i = (e + 56) | 0;
+                    j = ((c[d >> 2] | 0) + 16) | 0;
+                    k = (i + 40) | 0;
+                    do {
+                      c[i >> 2] = c[j >> 2];
+                      i = (i + 4) | 0;
+                      j = (j + 4) | 0;
+                    } while ((i | 0) < (k | 0));
+                    a[(e + 112) >> 0] = 1;
+                    c[(e + 116) >> 2] = f;
+                  }
+                  d = c[(g + 16) >> 2] | 0;
+                  b = (e + 16) | 0;
+                  i = y;
+                  j = (d + 16) | 0;
+                  k = (i + 40) | 0;
+                  do {
+                    c[i >> 2] = c[j >> 2];
+                    i = (i + 4) | 0;
+                    j = (j + 4) | 0;
+                  } while ((i | 0) < (k | 0));
+                  i = z;
+                  j = b;
+                  k = (i + 40) | 0;
+                  do {
+                    c[i >> 2] = c[j >> 2];
+                    i = (i + 4) | 0;
+                    j = (j + 4) | 0;
+                  } while ((i | 0) < (k | 0));
+                  b = hg(y, z) | 0;
+                  if (!b) {
+                    b = (e + 56) | 0;
+                    i = y;
+                    j = (d + 56) | 0;
+                    k = (i + 40) | 0;
+                    do {
+                      c[i >> 2] = c[j >> 2];
+                      i = (i + 4) | 0;
+                      j = (j + 4) | 0;
+                    } while ((i | 0) < (k | 0));
+                    i = z;
+                    j = b;
+                    k = (i + 40) | 0;
+                    do {
+                      c[i >> 2] = c[j >> 2];
+                      i = (i + 4) | 0;
+                      j = (j + 4) | 0;
+                    } while ((i | 0) < (k | 0));
+                    b = hg(y, z) | 0;
+                    if (!b) {
+                      d = c[((c[x >> 2] | 0) + 164) >> 2] & 192;
+                      b = c[((c[A >> 2] | 0) + 164) >> 2] & 192;
+                      if ((d | 0) == (b | 0)) {
+                        b = (((c[C >> 2] | 0) >>> 4) - ((c[B >> 2] | 0) >>> 4)) | 0;
+                        break;
+                      } else {
+                        b = (d - b) | 0;
+                        break;
+                      }
+                    }
+                  }
+                } else b = (g - f) | 0;
+              while (0);
+              l = D;
+              return b | 0;
+            }
+            function og(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0.0;
+              f = (b + 16) | 0;
+              d = c[f >> 2] | 0;
+              if (c[(d + 176) >> 2] | 0) {
+                d = c[(d + 180) >> 2] | 0;
+                while (1) {
+                  d = ((c[d >> 2] | 0) + 16) | 0;
+                  e = c[d >> 2] | 0;
+                  if (!(a[(e + 112) >> 0] | 0)) break;
+                  else d = (e + 116) | 0;
+                }
+                e = c[(e + 96) >> 2] | 0;
+                g = +h[(e + 24) >> 3];
+                i = +h[(e + 32) >> 3];
+                e = ((c[((c[((xC(b) | 0) + 16) >> 2] | 0) + 116) >> 2] & 1) | 0) != 0;
+                b = c[f >> 2] | 0;
+                f = c[((c[d >> 2] | 0) + 96) >> 2] | 0;
+                h[(f + 56) >> 3] = (e ? i : g) * 0.5 + +h[(b + 16) >> 3];
+                h[(f + 64) >> 3] = +h[(b + 24) >> 3];
+                a[(f + 81) >> 0] = 1;
+              }
+              return;
+            }
+            function pg(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              while (1) {
+                b = c[(a + 16) >> 2] | 0;
+                d = c[(b + 172) >> 2] | 0;
+                if (!d) break;
+                else a = d;
+              }
+              while (1) {
+                b = c[(b + 116) >> 2] | 0;
+                if (!b) break;
+                a = b;
+                b = c[(b + 16) >> 2] | 0;
+              }
+              return a | 0;
+            }
+            function qg(b, d, e, f, g, i, j) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              j = j | 0;
+              var k = 0,
+                m = 0.0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0.0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0.0,
+                D = 0.0,
+                E = 0.0,
+                F = 0.0,
+                G = 0.0;
+              B = l;
+              l = (l + 1712) | 0;
+              x = (B + 1664) | 0;
+              s = (B + 1488) | 0;
+              t = (B + 1392) | 0;
+              A = (B + 1696) | 0;
+              y = (B + 696) | 0;
+              z = B;
+              p = (t + 16) | 0;
+              c[p >> 2] = s;
+              q = c[(f + (g << 2)) >> 2] | 0;
+              r = (q + 16) | 0;
+              k = c[r >> 2] | 0;
+              u = a[(k + 113) >> 0] | 0;
+              if (c[(k + 164) >> 2] & 32) {
+                W6(s | 0, k | 0, 176) | 0;
+                k = t;
+                n = q;
+                o = (k + 48) | 0;
+                do {
+                  c[k >> 2] = c[n >> 2];
+                  k = (k + 4) | 0;
+                  n = (n + 4) | 0;
+                } while ((k | 0) < (o | 0));
+                c[p >> 2] = s;
+                k = c[t >> 2] & 3;
+                c[(((k | 0) == 3 ? t : (t + 48) | 0) + 40) >> 2] =
+                  c[((((c[q >> 2] & 3) | 0) == 2 ? q : (q + -48) | 0) + 40) >> 2];
+                c[(((k | 0) == 2 ? t : (t + -48) | 0) + 40) >> 2] =
+                  c[((((c[q >> 2] & 3) | 0) == 3 ? q : (q + 48) | 0) + 40) >> 2];
+                k = (s + 16) | 0;
+                n = ((c[r >> 2] | 0) + 56) | 0;
+                o = (k + 40) | 0;
+                do {
+                  c[k >> 2] = c[n >> 2];
+                  k = (k + 4) | 0;
+                  n = (n + 4) | 0;
+                } while ((k | 0) < (o | 0));
+                k = (s + 56) | 0;
+                n = ((c[r >> 2] | 0) + 16) | 0;
+                o = (k + 40) | 0;
+                do {
+                  c[k >> 2] = c[n >> 2];
+                  k = (k + 4) | 0;
+                  n = (n + 4) | 0;
+                } while ((k | 0) < (o | 0));
+                a[(s + 112) >> 0] = 1;
+                c[(s + 116) >> 2] = q;
+                q = t;
+              }
+              k = 1;
+              while (1) {
+                if ((k | 0) >= (i | 0)) {
+                  w = 6;
+                  break;
+                }
+                if (!(a[((c[((c[(f + ((k + g) << 2)) >> 2] | 0) + 16) >> 2] | 0) + 113) >> 0] | 0)) k = (k + 1) | 0;
+                else {
+                  w = 7;
+                  break;
+                }
+              }
+              a: do
+                if ((w | 0) == 6)
+                  if (!((u << 24) >> 24)) {
+                    k = c[(q + 16) >> 2] | 0;
+                    if (c[(k + 96) >> 2] | 0) {
+                      Qg(b, d, e, q, j);
+                      break;
+                    }
+                    if ((j | 0) == 2) {
+                      A = c[q >> 2] & 3;
+                      Rg(
+                        c[(((A | 0) == 3 ? q : (q + 48) | 0) + 40) >> 2] | 0,
+                        c[(((A | 0) == 2 ? q : (q + -48) | 0) + 40) >> 2] | 0,
+                        f,
+                        g,
+                        i,
+                        2
+                      );
+                      break;
+                    }
+                    t = a[(k + 49) >> 0] | 0;
+                    u = a[(k + 89) >> 0] | 0;
+                    if (
+                      !(((t << 24) >> 24 == 1) & ((u << 24) >> 24 != 4))
+                        ? !(((t << 24) >> 24 != 4) & ((u << 24) >> 24 == 1))
+                        : 0
+                    ) {
+                      p = c[q >> 2] & 3;
+                      o = c[(((p | 0) == 3 ? q : (q + 48) | 0) + 40) >> 2] | 0;
+                      p = c[(((p | 0) == 2 ? q : (q + -48) | 0) + 40) >> 2] | 0;
+                      k = c[(o + 16) >> 2] | 0;
+                      n = c[(k + 232) >> 2] | 0;
+                      if ((n | 0) > 0) {
+                        u = c[((c[(b + 16) >> 2] | 0) + 196) >> 2] | 0;
+                        t = (n + ~(a[((c[((c[(b + 60) >> 2] | 0) + 16) >> 2] | 0) + 113) >> 0] & 1)) | 0;
+                        m =
+                          +h[((c[((c[c[(u + (t << 6) + 4) >> 2] >> 2] | 0) + 16) >> 2] | 0) + 24) >> 3] -
+                          +h[(u + (t << 6) + 16) >> 3] -
+                          +h[(k + 24) >> 3] -
+                          +h[(u + (n << 6) + 24) >> 3];
+                      } else m = +(c[((c[(b + 16) >> 2] | 0) + 252) >> 2] | 0);
+                      C = +((i + 1) | 0);
+                      v = +(c[(d + 12) >> 2] | 0) / C;
+                      m = m / C;
+                      Tg(b, d, e, o, q, y, 1);
+                      Tg(b, d, e, p, q, z, 0);
+                      s = (y + 52) | 0;
+                      t = (z + 52) | 0;
+                      p = (j | 0) == 10;
+                      q = (e + 80) | 0;
+                      k = 0;
+                      while (1) {
+                        if ((k | 0) >= (i | 0)) break a;
+                        r = c[(f + ((k + g) << 2)) >> 2] | 0;
+                        o = c[s >> 2] | 0;
+                        n = (o + -1) | 0;
+                        G = +h[(y + 56 + (n << 5)) >> 3];
+                        F = +h[(y + 56 + (n << 5) + 16) >> 3];
+                        E = +h[(y + 56 + (n << 5) + 24) >> 3];
+                        h[19215] = G;
+                        h[19216] = E;
+                        k = (k + 1) | 0;
+                        C = +(k | 0);
+                        D = v * C;
+                        h[19217] = F + D;
+                        C = E + m * C;
+                        h[19218] = C;
+                        h[19219] = G;
+                        h[19220] = C;
+                        n = ((c[t >> 2] | 0) + -1) | 0;
+                        G = +h[(z + 56 + (n << 5) + 16) >> 3];
+                        h[19221] = G;
+                        h[19222] = C + m;
+                        E = +h[(z + 56 + (n << 5)) >> 3];
+                        F = +h[(z + 56 + (n << 5) + 24) >> 3];
+                        h[19225] = G;
+                        h[19224] = F;
+                        h[19223] = E - D;
+                        h[19226] = C;
+                        n = 0;
+                        while (1) {
+                          if ((n | 0) >= (o | 0)) {
+                            n = 0;
+                            break;
+                          }
+                          o = (y + 56 + (n << 5)) | 0;
+                          c[x >> 2] = c[o >> 2];
+                          c[(x + 4) >> 2] = c[(o + 4) >> 2];
+                          c[(x + 8) >> 2] = c[(o + 8) >> 2];
+                          c[(x + 12) >> 2] = c[(o + 12) >> 2];
+                          c[(x + 16) >> 2] = c[(o + 16) >> 2];
+                          c[(x + 20) >> 2] = c[(o + 20) >> 2];
+                          c[(x + 24) >> 2] = c[(o + 24) >> 2];
+                          c[(x + 28) >> 2] = c[(o + 28) >> 2];
+                          fO(e, x);
+                          n = (n + 1) | 0;
+                          o = c[s >> 2] | 0;
+                        }
+                        while (1) {
+                          if ((n | 0) == 3) break;
+                          j = (153720 + (n << 5)) | 0;
+                          c[x >> 2] = c[j >> 2];
+                          c[(x + 4) >> 2] = c[(j + 4) >> 2];
+                          c[(x + 8) >> 2] = c[(j + 8) >> 2];
+                          c[(x + 12) >> 2] = c[(j + 12) >> 2];
+                          c[(x + 16) >> 2] = c[(j + 16) >> 2];
+                          c[(x + 20) >> 2] = c[(j + 20) >> 2];
+                          c[(x + 24) >> 2] = c[(j + 24) >> 2];
+                          c[(x + 28) >> 2] = c[(j + 28) >> 2];
+                          fO(e, x);
+                          n = (n + 1) | 0;
+                        }
+                        o = c[t >> 2] | 0;
+                        while (1) {
+                          n = (o + -1) | 0;
+                          if ((o | 0) <= 0) break;
+                          o = (z + 56 + (n << 5)) | 0;
+                          c[x >> 2] = c[o >> 2];
+                          c[(x + 4) >> 2] = c[(o + 4) >> 2];
+                          c[(x + 8) >> 2] = c[(o + 8) >> 2];
+                          c[(x + 12) >> 2] = c[(o + 12) >> 2];
+                          c[(x + 16) >> 2] = c[(o + 16) >> 2];
+                          c[(x + 20) >> 2] = c[(o + 20) >> 2];
+                          c[(x + 24) >> 2] = c[(o + 24) >> 2];
+                          c[(x + 28) >> 2] = c[(o + 28) >> 2];
+                          fO(e, x);
+                          o = n;
+                        }
+                        if (p) n = HM(e, A) | 0;
+                        else n = NM(e, A) | 0;
+                        o = c[A >> 2] | 0;
+                        if (!o) break a;
+                        dO(r, c[((((c[r >> 2] & 3) | 0) == 2 ? r : (r + -48) | 0) + 40) >> 2] | 0, n, o, 17296);
+                        c[q >> 2] = 0;
+                      }
+                    }
+                    Sg(b, d, e, f, g, i, q, ((j | 0) == 10) & 1);
+                  } else w = 7;
+              while (0);
+              if ((w | 0) == 7) Pg(b, f, g, i, q, j);
+              l = B;
+              return;
+            }
+            function rg(b, d, e, f, g, i, j) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              j = j | 0;
+              var k = 0,
+                m = 0.0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                P = 0,
+                Q = 0,
+                R = 0,
+                S = 0,
+                T = 0,
+                U = 0,
+                V = 0,
+                W = 0,
+                X = 0,
+                Y = 0,
+                Z = 0,
+                _ = 0,
+                $ = 0,
+                aa = 0,
+                ba = 0,
+                ca = 0;
+              ba = l;
+              l = (l + 2576) | 0;
+              S = (ba + 2528) | 0;
+              _ = (ba + 2568) | 0;
+              k = (ba + 2352) | 0;
+              n = (ba + 2176) | 0;
+              t = (ba + 1904) | 0;
+              Y = (ba + 1808) | 0;
+              $ = (ba + 1712) | 0;
+              T = (ba + 1016) | 0;
+              U = (ba + 320) | 0;
+              V = (ba + 256) | 0;
+              X = (ba + 2564) | 0;
+              Z = (ba + 2560) | 0;
+              z = (ba + 288) | 0;
+              A = (ba + 224) | 0;
+              L = (ba + 192) | 0;
+              M = (ba + 160) | 0;
+              N = (ba + 128) | 0;
+              P = (ba + 96) | 0;
+              Q = (ba + 64) | 0;
+              R = (ba + 32) | 0;
+              W = ba;
+              s = (t + 16) | 0;
+              c[s >> 2] = k;
+              o = (Y + 16) | 0;
+              c[o >> 2] = n;
+              aa = ($ + 16) | 0;
+              c[aa >> 2] = ba + 2e3;
+              if (!(c[46734] | 0)) {
+                c[46734] = KK(32e3) | 0;
+                c[46735] = KK(32e3) | 0;
+                c[46736] = 2e3;
+                c[46737] = 2e3;
+              }
+              u = c[(f + (g << 2)) >> 2] | 0;
+              K = c[u >> 2] & 3;
+              p = (u + 48) | 0;
+              q = (u + -48) | 0;
+              K =
+                ((c[((c[((c[(((K | 0) == 3 ? u : p) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0) -
+                  (c[((c[((c[(((K | 0) == 2 ? u : q) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0)) |
+                0;
+              r = (u + 16) | 0;
+              if ((((K | 0) > -1 ? K : (0 - K) | 0) | 0) <= 1) {
+                k = c[r >> 2] | 0;
+                if (!(c[(k + 164) >> 2] & 32)) {
+                  K = u;
+                  n = 0;
+                } else {
+                  n = c[s >> 2] | 0;
+                  W6(n | 0, k | 0, 176) | 0;
+                  w = t;
+                  x = u;
+                  y = (w + 48) | 0;
+                  do {
+                    c[w >> 2] = c[x >> 2];
+                    w = (w + 4) | 0;
+                    x = (x + 4) | 0;
+                  } while ((w | 0) < (y | 0));
+                  c[s >> 2] = n;
+                  w = c[t >> 2] & 3;
+                  c[(((w | 0) == 3 ? t : (t + 48) | 0) + 40) >> 2] =
+                    c[((((c[u >> 2] & 3) | 0) == 2 ? u : q) + 40) >> 2];
+                  c[(((w | 0) == 2 ? t : (t + -48) | 0) + 40) >> 2] =
+                    c[((((c[u >> 2] & 3) | 0) == 3 ? u : p) + 40) >> 2];
+                  w = (n + 16) | 0;
+                  x = ((c[r >> 2] | 0) + 56) | 0;
+                  y = (w + 40) | 0;
+                  do {
+                    c[w >> 2] = c[x >> 2];
+                    w = (w + 4) | 0;
+                    x = (x + 4) | 0;
+                  } while ((w | 0) < (y | 0));
+                  k = c[s >> 2] | 0;
+                  w = (k + 56) | 0;
+                  x = ((c[r >> 2] | 0) + 16) | 0;
+                  y = (w + 40) | 0;
+                  do {
+                    c[w >> 2] = c[x >> 2];
+                    w = (w + 4) | 0;
+                    x = (x + 4) | 0;
+                  } while ((w | 0) < (y | 0));
+                  a[(k + 112) >> 0] = 1;
+                  n = 0;
+                  J = 12;
+                }
+              } else {
+                W6(k | 0, c[r >> 2] | 0, 176) | 0;
+                w = t;
+                x = u;
+                y = (w + 48) | 0;
+                do {
+                  c[w >> 2] = c[x >> 2];
+                  w = (w + 4) | 0;
+                  x = (x + 4) | 0;
+                } while ((w | 0) < (y | 0));
+                w = (t + 48) | 0;
+                x = p;
+                y = (w + 48) | 0;
+                do {
+                  c[w >> 2] = c[x >> 2];
+                  w = (w + 4) | 0;
+                  x = (x + 4) | 0;
+                } while ((w | 0) < (y | 0));
+                c[s >> 2] = k;
+                k = c[r >> 2] | 0;
+                if (!(c[(k + 164) >> 2] & 32)) {
+                  W6(n | 0, k | 0, 176) | 0;
+                  w = Y;
+                  x = u;
+                  y = (w + 48) | 0;
+                  do {
+                    c[w >> 2] = c[x >> 2];
+                    w = (w + 4) | 0;
+                    x = (x + 4) | 0;
+                  } while ((w | 0) < (y | 0));
+                  c[o >> 2] = n;
+                  o = c[t >> 2] | 0;
+                  c[((((o & 3) | 0) == 3 ? t : (t + 48) | 0) + 40) >> 2] =
+                    c[((((c[u >> 2] & 3) | 0) == 3 ? u : p) + 40) >> 2];
+                  w = (Y + 48) | 0;
+                  x = p;
+                  y = (w + 48) | 0;
+                  do {
+                    c[w >> 2] = c[x >> 2];
+                    w = (w + 4) | 0;
+                    x = (x + 4) | 0;
+                  } while ((w | 0) < (y | 0));
+                } else {
+                  n = c[o >> 2] | 0;
+                  W6(n | 0, k | 0, 176) | 0;
+                  w = Y;
+                  x = u;
+                  y = (w + 48) | 0;
+                  do {
+                    c[w >> 2] = c[x >> 2];
+                    w = (w + 4) | 0;
+                    x = (x + 4) | 0;
+                  } while ((w | 0) < (y | 0));
+                  c[o >> 2] = n;
+                  w = c[Y >> 2] & 3;
+                  c[(((w | 0) == 3 ? Y : (Y + 48) | 0) + 40) >> 2] =
+                    c[((((c[u >> 2] & 3) | 0) == 2 ? u : q) + 40) >> 2];
+                  c[(((w | 0) == 2 ? Y : (Y + -48) | 0) + 40) >> 2] =
+                    c[((((c[u >> 2] & 3) | 0) == 3 ? u : p) + 40) >> 2];
+                  w = (n + 16) | 0;
+                  x = ((c[r >> 2] | 0) + 56) | 0;
+                  y = (w + 40) | 0;
+                  do {
+                    c[w >> 2] = c[x >> 2];
+                    w = (w + 4) | 0;
+                    x = (x + 4) | 0;
+                  } while ((w | 0) < (y | 0));
+                  k = c[o >> 2] | 0;
+                  w = (k + 56) | 0;
+                  x = ((c[r >> 2] | 0) + 16) | 0;
+                  y = (w + 40) | 0;
+                  do {
+                    c[w >> 2] = c[x >> 2];
+                    w = (w + 4) | 0;
+                    x = (x + 4) | 0;
+                  } while ((w | 0) < (y | 0));
+                  a[(k + 112) >> 0] = 1;
+                  c[(k + 116) >> 2] = u;
+                  o = c[t >> 2] | 0;
+                  c[((((o & 3) | 0) == 3 ? t : (t + 48) | 0) + 40) >> 2] =
+                    c[((((c[u >> 2] & 3) | 0) == 2 ? u : q) + 40) >> 2];
+                  w = ((c[s >> 2] | 0) + 16) | 0;
+                  x = ((c[r >> 2] | 0) + 56) | 0;
+                  y = (w + 40) | 0;
+                  do {
+                    c[w >> 2] = c[x >> 2];
+                    w = (w + 4) | 0;
+                    x = (x + 4) | 0;
+                  } while ((w | 0) < (y | 0));
+                }
+                k = pg(u) | 0;
+                while (1) {
+                  n = c[((c[(k + 16) >> 2] | 0) + 172) >> 2] | 0;
+                  if (!n) break;
+                  else k = n;
+                }
+                c[((((o & 3) | 0) == 2 ? t : (t + -48) | 0) + 40) >> 2] =
+                  c[((((c[k >> 2] & 3) | 0) == 2 ? k : (k + -48) | 0) + 40) >> 2];
+                k = c[s >> 2] | 0;
+                a[(k + 84) >> 0] = 0;
+                a[(k + 112) >> 0] = 1;
+                n = (k + 56) | 0;
+                c[n >> 2] = 0;
+                c[(n + 4) >> 2] = 0;
+                c[(n + 8) >> 2] = 0;
+                c[(n + 12) >> 2] = 0;
+                n = 1;
+                J = 12;
+              }
+              if ((J | 0) == 12) {
+                c[(k + 116) >> 2] = u;
+                K = t;
+              }
+              H = (j | 0) == 2;
+              if (H ? ((v = vg(b, K, c[46734] | 0, _) | 0), (c[Z >> 2] = v), (v | 0) != 0) : 0) J = 63;
+              else J = 15;
+              a: do
+                if ((J | 0) == 15) {
+                  G = (j | 0) == 10;
+                  c[Z >> 2] = 0;
+                  o = c[K >> 2] & 3;
+                  k = c[(((o | 0) == 3 ? K : (K + 48) | 0) + 40) >> 2] | 0;
+                  o = c[(((o | 0) == 2 ? K : (K + -48) | 0) + 40) >> 2] | 0;
+                  c[_ >> 2] = o;
+                  wg(z, b, d, k, 0, K);
+                  c[T >> 2] = c[z >> 2];
+                  c[(T + 4) >> 2] = c[(z + 4) >> 2];
+                  c[(T + 8) >> 2] = c[(z + 8) >> 2];
+                  c[(T + 12) >> 2] = c[(z + 12) >> 2];
+                  c[(T + 16) >> 2] = c[(z + 16) >> 2];
+                  c[(T + 20) >> 2] = c[(z + 20) >> 2];
+                  c[(T + 24) >> 2] = c[(z + 24) >> 2];
+                  c[(T + 28) >> 2] = c[(z + 28) >> 2];
+                  c[V >> 2] = c[z >> 2];
+                  c[(V + 4) >> 2] = c[(z + 4) >> 2];
+                  c[(V + 8) >> 2] = c[(z + 8) >> 2];
+                  c[(V + 12) >> 2] = c[(z + 12) >> 2];
+                  c[(V + 16) >> 2] = c[(z + 16) >> 2];
+                  c[(V + 20) >> 2] = c[(z + 20) >> 2];
+                  gO(e, K, 1, T, xg(k) | 0);
+                  B = (T + 52) | 0;
+                  I = ((c[B >> 2] | 0) + -1) | 0;
+                  D = (V + 24) | 0;
+                  h[D >> 3] = +h[(T + 56 + (I << 5) + 24) >> 3];
+                  E = (V + 8) | 0;
+                  h[E >> 3] = +h[(T + 56 + (I << 5) + 8) >> 3];
+                  I = c[(k + 16) >> 2] | 0;
+                  F = (b + 16) | 0;
+                  m =
+                    +h[(I + 24) >> 3] -
+                    +h[((c[((c[F >> 2] | 0) + 196) >> 2] | 0) + (c[(I + 232) >> 2] << 6) + 16) >> 3];
+                  c[S >> 2] = c[V >> 2];
+                  c[(S + 4) >> 2] = c[(V + 4) >> 2];
+                  c[(S + 8) >> 2] = c[(V + 8) >> 2];
+                  c[(S + 12) >> 2] = c[(V + 12) >> 2];
+                  c[(S + 16) >> 2] = c[(V + 16) >> 2];
+                  c[(S + 20) >> 2] = c[(V + 20) >> 2];
+                  c[(S + 24) >> 2] = c[(V + 24) >> 2];
+                  c[(S + 28) >> 2] = c[(V + 28) >> 2];
+                  yg(A, S, 1, m);
+                  c[V >> 2] = c[A >> 2];
+                  c[(V + 4) >> 2] = c[(A + 4) >> 2];
+                  c[(V + 8) >> 2] = c[(A + 8) >> 2];
+                  c[(V + 12) >> 2] = c[(A + 12) >> 2];
+                  c[(V + 16) >> 2] = c[(A + 16) >> 2];
+                  c[(V + 20) >> 2] = c[(A + 20) >> 2];
+                  c[(V + 24) >> 2] = c[(A + 24) >> 2];
+                  c[(V + 28) >> 2] = c[(A + 28) >> 2];
+                  A = (V + 16) | 0;
+                  if (+h[V >> 3] < +h[A >> 3] ? +h[E >> 3] < +h[D >> 3] : 0) {
+                    I = c[B >> 2] | 0;
+                    c[B >> 2] = I + 1;
+                    I = (T + 56 + (I << 5)) | 0;
+                    c[I >> 2] = c[V >> 2];
+                    c[(I + 4) >> 2] = c[(V + 4) >> 2];
+                    c[(I + 8) >> 2] = c[(V + 8) >> 2];
+                    c[(I + 12) >> 2] = c[(V + 12) >> 2];
+                    c[(I + 16) >> 2] = c[(V + 16) >> 2];
+                    c[(I + 20) >> 2] = c[(V + 20) >> 2];
+                    c[(I + 24) >> 2] = c[(V + 24) >> 2];
+                    c[(I + 28) >> 2] = c[(V + 28) >> 2];
+                  }
+                  w = (b + 60) | 0;
+                  C = (U + 52) | 0;
+                  x = (e + 56) | 0;
+                  y = (e + 69) | 0;
+                  j = (e + 16) | 0;
+                  z = (e + 29) | 0;
+                  I = K;
+                  q = 0;
+                  r = -1;
+                  b: while (1) {
+                    s = k;
+                    t = 0;
+                    k = 0;
+                    u = I;
+                    while (1) {
+                      p = o;
+                      v = o;
+                      if ((a[((c[(p + 16) >> 2] | 0) + 156) >> 0] | 0) != 1) break b;
+                      if (((kb[c[17300 >> 2] & 63](p) | 0) << 24) >> 24) break b;
+                      o = t | 1;
+                      ca = (153720 + (t << 5)) | 0;
+                      zg(L, d, b, c[((c[(s + 16) >> 2] | 0) + 232) >> 2] | 0);
+                      c[ca >> 2] = c[L >> 2];
+                      c[(ca + 4) >> 2] = c[(L + 4) >> 2];
+                      c[(ca + 8) >> 2] = c[(L + 8) >> 2];
+                      c[(ca + 12) >> 2] = c[(L + 12) >> 2];
+                      c[(ca + 16) >> 2] = c[(L + 16) >> 2];
+                      c[(ca + 20) >> 2] = c[(L + 20) >> 2];
+                      c[(ca + 24) >> 2] = c[(L + 24) >> 2];
+                      c[(ca + 28) >> 2] = c[(L + 28) >> 2];
+                      if (!k) {
+                        q = Ag(p) | 0;
+                        k =
+                          (q | 0) <
+                          (((((a[((c[((c[w >> 2] | 0) + 16) >> 2] | 0) + 113) >> 0] << 1) & 2) + 3) & 255) | 0);
+                        q = k ? q : (q + -2) | 0;
+                        r = k ? r : 1;
+                        k = (k ^ 1) & 1;
+                      }
+                      if (!(((k | 0) == 0) | ((r | 0) > 0))) break;
+                      ca = (153720 + (o << 5)) | 0;
+                      wg(M, b, d, p, u, c[c[((c[(p + 16) >> 2] | 0) + 180) >> 2] >> 2] | 0);
+                      c[ca >> 2] = c[M >> 2];
+                      c[(ca + 4) >> 2] = c[(M + 4) >> 2];
+                      c[(ca + 8) >> 2] = c[(M + 8) >> 2];
+                      c[(ca + 12) >> 2] = c[(M + 12) >> 2];
+                      c[(ca + 16) >> 2] = c[(M + 16) >> 2];
+                      c[(ca + 20) >> 2] = c[(M + 20) >> 2];
+                      c[(ca + 24) >> 2] = c[(M + 24) >> 2];
+                      c[(ca + 28) >> 2] = c[(M + 28) >> 2];
+                      ca = c[c[((c[(v + 16) >> 2] | 0) + 180) >> 2] >> 2] | 0;
+                      o = c[ca >> 2] & 3;
+                      s = c[(((o | 0) == 3 ? ca : (ca + 48) | 0) + 40) >> 2] | 0;
+                      o = c[(((o | 0) == 2 ? ca : (ca + -48) | 0) + 40) >> 2] | 0;
+                      c[_ >> 2] = o;
+                      t = (t + 2) | 0;
+                      r = (r + -1) | 0;
+                      u = ca;
+                    }
+                    wg(N, b, d, p, u, c[c[((c[(p + 16) >> 2] | 0) + 180) >> 2] >> 2] | 0);
+                    c[U >> 2] = c[N >> 2];
+                    c[(U + 4) >> 2] = c[(N + 4) >> 2];
+                    c[(U + 8) >> 2] = c[(N + 8) >> 2];
+                    c[(U + 12) >> 2] = c[(N + 12) >> 2];
+                    c[(U + 16) >> 2] = c[(N + 16) >> 2];
+                    c[(U + 20) >> 2] = c[(N + 20) >> 2];
+                    c[(U + 24) >> 2] = c[(N + 24) >> 2];
+                    c[(U + 28) >> 2] = c[(N + 28) >> 2];
+                    jO(e, u, 1, U, xg(c[((((c[u >> 2] & 3) | 0) == 2 ? u : (u + -48) | 0) + 40) >> 2] | 0) | 0);
+                    ca = (U + 56 + (((c[C >> 2] | 0) + -1) << 5)) | 0;
+                    t = c[(v + 16) >> 2] | 0;
+                    m =
+                      +h[((c[((c[F >> 2] | 0) + 196) >> 2] | 0) + (c[(t + 232) >> 2] << 6) + 24) >> 3] +
+                      +h[(t + 24) >> 3];
+                    c[S >> 2] = c[ca >> 2];
+                    c[(S + 4) >> 2] = c[(ca + 4) >> 2];
+                    c[(S + 8) >> 2] = c[(ca + 8) >> 2];
+                    c[(S + 12) >> 2] = c[(ca + 12) >> 2];
+                    c[(S + 16) >> 2] = c[(ca + 16) >> 2];
+                    c[(S + 20) >> 2] = c[(ca + 20) >> 2];
+                    c[(S + 24) >> 2] = c[(ca + 24) >> 2];
+                    c[(S + 28) >> 2] = c[(ca + 28) >> 2];
+                    yg(V, S, 4, m);
+                    if (+h[V >> 3] < +h[A >> 3] ? +h[E >> 3] < +h[D >> 3] : 0) {
+                      ca = c[C >> 2] | 0;
+                      c[C >> 2] = ca + 1;
+                      ca = (U + 56 + (ca << 5)) | 0;
+                      c[ca >> 2] = c[V >> 2];
+                      c[(ca + 4) >> 2] = c[(V + 4) >> 2];
+                      c[(ca + 8) >> 2] = c[(V + 8) >> 2];
+                      c[(ca + 12) >> 2] = c[(V + 12) >> 2];
+                      c[(ca + 16) >> 2] = c[(V + 16) >> 2];
+                      c[(ca + 20) >> 2] = c[(V + 20) >> 2];
+                      c[(ca + 24) >> 2] = c[(V + 24) >> 2];
+                      c[(ca + 28) >> 2] = c[(V + 28) >> 2];
+                    }
+                    h[x >> 3] = 1.5707963267948966;
+                    a[y >> 0] = 1;
+                    Bg(e, I, u, T, U, o);
+                    if (!G) {
+                      k = NM(e, X) | 0;
+                      o = c[X >> 2] | 0;
+                      if (H & ((o | 0) > 4)) {
+                        ca = (k + 16) | 0;
+                        c[ca >> 2] = c[k >> 2];
+                        c[(ca + 4) >> 2] = c[(k + 4) >> 2];
+                        c[(ca + 8) >> 2] = c[(k + 8) >> 2];
+                        c[(ca + 12) >> 2] = c[(k + 12) >> 2];
+                        ca = (k + 32) | 0;
+                        o = (k + ((o + -1) << 4)) | 0;
+                        c[ca >> 2] = c[o >> 2];
+                        c[(ca + 4) >> 2] = c[(o + 4) >> 2];
+                        c[(ca + 8) >> 2] = c[(o + 8) >> 2];
+                        c[(ca + 12) >> 2] = c[(o + 12) >> 2];
+                        X6((k + 48) | 0, o | 0, 16) | 0;
+                        c[X >> 2] = 4;
+                        o = 4;
+                      } else J = 33;
+                    } else {
+                      k = HM(e, X) | 0;
+                      o = c[X >> 2] | 0;
+                      J = 33;
+                    }
+                    if ((J | 0) == 33) {
+                      J = 0;
+                      if (!o) break a;
+                    }
+                    u = c[Z >> 2] | 0;
+                    p = (u + o) | 0;
+                    if ((p | 0) > (c[46736] | 0)) {
+                      c[46736] = p << 1;
+                      t = MK(c[46734] | 0, p << 5) | 0;
+                      c[46734] = t;
+                      o = c[X >> 2] | 0;
+                    } else t = c[46734] | 0;
+                    s = 0;
+                    p = u;
+                    while (1) {
+                      if ((s | 0) >= (o | 0)) break;
+                      ca = (t + (p << 4)) | 0;
+                      u = (k + (s << 4)) | 0;
+                      c[ca >> 2] = c[u >> 2];
+                      c[(ca + 4) >> 2] = c[(u + 4) >> 2];
+                      c[(ca + 8) >> 2] = c[(u + 8) >> 2];
+                      c[(ca + 12) >> 2] = c[(u + 12) >> 2];
+                      s = (s + 1) | 0;
+                      p = (p + 1) | 0;
+                    }
+                    c[Z >> 2] = p;
+                    o = Cg(c[c[((c[(v + 16) >> 2] | 0) + 180) >> 2] >> 2] | 0, q, t, Z) | 0;
+                    Dg(I, e);
+                    p = c[o >> 2] & 3;
+                    k = c[(((p | 0) == 3 ? o : (o + 48) | 0) + 40) >> 2] | 0;
+                    p = c[(((p | 0) == 2 ? o : (o + -48) | 0) + 40) >> 2] | 0;
+                    c[_ >> 2] = p;
+                    I = (k + 16) | 0;
+                    wg(P, b, d, k, c[c[((c[I >> 2] | 0) + 172) >> 2] >> 2] | 0, o);
+                    c[T >> 2] = c[P >> 2];
+                    c[(T + 4) >> 2] = c[(P + 4) >> 2];
+                    c[(T + 8) >> 2] = c[(P + 8) >> 2];
+                    c[(T + 12) >> 2] = c[(P + 12) >> 2];
+                    c[(T + 16) >> 2] = c[(P + 16) >> 2];
+                    c[(T + 20) >> 2] = c[(P + 20) >> 2];
+                    c[(T + 24) >> 2] = c[(P + 24) >> 2];
+                    c[(T + 28) >> 2] = c[(P + 28) >> 2];
+                    gO(e, o, 1, T, xg(k) | 0);
+                    ca = (T + 56 + (((c[B >> 2] | 0) + -1) << 5)) | 0;
+                    I = c[I >> 2] | 0;
+                    m =
+                      +h[(I + 24) >> 3] -
+                      +h[((c[((c[F >> 2] | 0) + 196) >> 2] | 0) + (c[(I + 232) >> 2] << 6) + 16) >> 3];
+                    c[S >> 2] = c[ca >> 2];
+                    c[(S + 4) >> 2] = c[(ca + 4) >> 2];
+                    c[(S + 8) >> 2] = c[(ca + 8) >> 2];
+                    c[(S + 12) >> 2] = c[(ca + 12) >> 2];
+                    c[(S + 16) >> 2] = c[(ca + 16) >> 2];
+                    c[(S + 20) >> 2] = c[(ca + 20) >> 2];
+                    c[(S + 24) >> 2] = c[(ca + 24) >> 2];
+                    c[(S + 28) >> 2] = c[(ca + 28) >> 2];
+                    yg(V, S, 1, m);
+                    if (+h[V >> 3] < +h[A >> 3] ? +h[E >> 3] < +h[D >> 3] : 0) {
+                      ca = c[B >> 2] | 0;
+                      c[B >> 2] = ca + 1;
+                      ca = (T + 56 + (ca << 5)) | 0;
+                      c[ca >> 2] = c[V >> 2];
+                      c[(ca + 4) >> 2] = c[(V + 4) >> 2];
+                      c[(ca + 8) >> 2] = c[(V + 8) >> 2];
+                      c[(ca + 12) >> 2] = c[(V + 12) >> 2];
+                      c[(ca + 16) >> 2] = c[(V + 16) >> 2];
+                      c[(ca + 20) >> 2] = c[(V + 20) >> 2];
+                      c[(ca + 24) >> 2] = c[(V + 24) >> 2];
+                      c[(ca + 28) >> 2] = c[(V + 28) >> 2];
+                    }
+                    h[j >> 3] = -1.5707963267948966;
+                    a[z >> 0] = 1;
+                    I = o;
+                    o = p;
+                  }
+                  k = t | 1;
+                  r = (153720 + (t << 5)) | 0;
+                  zg(Q, d, b, c[((c[(s + 16) >> 2] | 0) + 232) >> 2] | 0);
+                  c[r >> 2] = c[Q >> 2];
+                  c[(r + 4) >> 2] = c[(Q + 4) >> 2];
+                  c[(r + 8) >> 2] = c[(Q + 8) >> 2];
+                  c[(r + 12) >> 2] = c[(Q + 12) >> 2];
+                  c[(r + 16) >> 2] = c[(Q + 16) >> 2];
+                  c[(r + 20) >> 2] = c[(Q + 20) >> 2];
+                  c[(r + 24) >> 2] = c[(Q + 24) >> 2];
+                  c[(r + 28) >> 2] = c[(Q + 28) >> 2];
+                  wg(R, b, d, p, u, 0);
+                  c[U >> 2] = c[R >> 2];
+                  c[(U + 4) >> 2] = c[(R + 4) >> 2];
+                  c[(U + 8) >> 2] = c[(R + 8) >> 2];
+                  c[(U + 12) >> 2] = c[(R + 12) >> 2];
+                  c[(U + 16) >> 2] = c[(R + 16) >> 2];
+                  c[(U + 20) >> 2] = c[(R + 20) >> 2];
+                  c[(U + 24) >> 2] = c[(R + 24) >> 2];
+                  c[(U + 28) >> 2] = c[(R + 28) >> 2];
+                  c[V >> 2] = c[R >> 2];
+                  c[(V + 4) >> 2] = c[(R + 4) >> 2];
+                  c[(V + 8) >> 2] = c[(R + 8) >> 2];
+                  c[(V + 12) >> 2] = c[(R + 12) >> 2];
+                  c[(V + 16) >> 2] = c[(R + 16) >> 2];
+                  c[(V + 20) >> 2] = c[(R + 20) >> 2];
+                  c[(V + 24) >> 2] = c[(R + 24) >> 2];
+                  c[(V + 28) >> 2] = c[(R + 28) >> 2];
+                  r = (n | 0) != 0;
+                  s = (u + -48) | 0;
+                  jO(e, r ? Y : u, 1, U, xg(c[((((c[u >> 2] & 3) | 0) == 2 ? u : s) + 40) >> 2] | 0) | 0);
+                  ca = ((c[C >> 2] | 0) + -1) | 0;
+                  h[D >> 3] = +h[(U + 56 + (ca << 5) + 24) >> 3];
+                  h[E >> 3] = +h[(U + 56 + (ca << 5) + 8) >> 3];
+                  ca = c[(v + 16) >> 2] | 0;
+                  m =
+                    +h[((c[((c[F >> 2] | 0) + 196) >> 2] | 0) + (c[(ca + 232) >> 2] << 6) + 24) >> 3] +
+                    +h[(ca + 24) >> 3];
+                  c[S >> 2] = c[V >> 2];
+                  c[(S + 4) >> 2] = c[(V + 4) >> 2];
+                  c[(S + 8) >> 2] = c[(V + 8) >> 2];
+                  c[(S + 12) >> 2] = c[(V + 12) >> 2];
+                  c[(S + 16) >> 2] = c[(V + 16) >> 2];
+                  c[(S + 20) >> 2] = c[(V + 20) >> 2];
+                  c[(S + 24) >> 2] = c[(V + 24) >> 2];
+                  c[(S + 28) >> 2] = c[(V + 28) >> 2];
+                  yg(W, S, 4, m);
+                  c[V >> 2] = c[W >> 2];
+                  c[(V + 4) >> 2] = c[(W + 4) >> 2];
+                  c[(V + 8) >> 2] = c[(W + 8) >> 2];
+                  c[(V + 12) >> 2] = c[(W + 12) >> 2];
+                  c[(V + 16) >> 2] = c[(W + 16) >> 2];
+                  c[(V + 20) >> 2] = c[(W + 20) >> 2];
+                  c[(V + 24) >> 2] = c[(W + 24) >> 2];
+                  c[(V + 28) >> 2] = c[(W + 28) >> 2];
+                  if (+h[V >> 3] < +h[A >> 3] ? +h[E >> 3] < +h[D >> 3] : 0) {
+                    ca = c[C >> 2] | 0;
+                    c[C >> 2] = ca + 1;
+                    ca = (U + 56 + (ca << 5)) | 0;
+                    c[ca >> 2] = c[V >> 2];
+                    c[(ca + 4) >> 2] = c[(V + 4) >> 2];
+                    c[(ca + 8) >> 2] = c[(V + 8) >> 2];
+                    c[(ca + 12) >> 2] = c[(V + 12) >> 2];
+                    c[(ca + 16) >> 2] = c[(V + 16) >> 2];
+                    c[(ca + 20) >> 2] = c[(V + 20) >> 2];
+                    c[(ca + 24) >> 2] = c[(V + 24) >> 2];
+                    c[(ca + 28) >> 2] = c[(V + 28) >> 2];
+                  }
+                  Bg(e, I, u, T, U, k);
+                  if (G) q = HM(e, X) | 0;
+                  else q = NM(e, X) | 0;
+                  k = c[X >> 2] | 0;
+                  if (!(H & ((k | 0) > 4))) {
+                    if (!k) break;
+                  } else {
+                    ca = (q + 16) | 0;
+                    c[ca >> 2] = c[q >> 2];
+                    c[(ca + 4) >> 2] = c[(q + 4) >> 2];
+                    c[(ca + 8) >> 2] = c[(q + 8) >> 2];
+                    c[(ca + 12) >> 2] = c[(q + 12) >> 2];
+                    ca = (q + 32) | 0;
+                    k = (q + ((k + -1) << 4)) | 0;
+                    c[ca >> 2] = c[k >> 2];
+                    c[(ca + 4) >> 2] = c[(k + 4) >> 2];
+                    c[(ca + 8) >> 2] = c[(k + 8) >> 2];
+                    c[(ca + 12) >> 2] = c[(k + 12) >> 2];
+                    X6((q + 48) | 0, k | 0, 16) | 0;
+                    c[X >> 2] = 4;
+                    k = 4;
+                  }
+                  o = c[Z >> 2] | 0;
+                  n = (o + k) | 0;
+                  if ((n | 0) > (c[46736] | 0)) {
+                    c[46736] = n << 1;
+                    p = MK(c[46734] | 0, n << 5) | 0;
+                    c[46734] = p;
+                    k = c[X >> 2] | 0;
+                  } else p = c[46734] | 0;
+                  n = 0;
+                  while (1) {
+                    if ((n | 0) >= (k | 0)) break;
+                    ca = (p + (o << 4)) | 0;
+                    X = (q + (n << 4)) | 0;
+                    c[ca >> 2] = c[X >> 2];
+                    c[(ca + 4) >> 2] = c[(X + 4) >> 2];
+                    c[(ca + 8) >> 2] = c[(X + 8) >> 2];
+                    c[(ca + 12) >> 2] = c[(X + 12) >> 2];
+                    n = (n + 1) | 0;
+                    o = (o + 1) | 0;
+                  }
+                  c[Z >> 2] = o;
+                  Dg(I, e);
+                  if (r) k = ((c[Y >> 2] & 3) | 0) == 2 ? Y : (Y + -48) | 0;
+                  else k = ((c[u >> 2] & 3) | 0) == 2 ? u : s;
+                  c[_ >> 2] = c[(k + 40) >> 2];
+                  v = o;
+                  J = 63;
+                }
+              while (0);
+              c: do
+                if ((J | 0) == 63) {
+                  if ((i | 0) == 1) {
+                    dO(K, c[_ >> 2] | 0, c[46734] | 0, v, 17296);
+                    break;
+                  }
+                  t = (d + 12) | 0;
+                  u = (v + -1) | 0;
+                  m = +(((O(c[t >> 2] | 0, (i + -1) | 0) | 0) / 2) | 0 | 0);
+                  n = c[46734] | 0;
+                  k = 1;
+                  while (1) {
+                    if ((k | 0) >= (u | 0)) break;
+                    ca = (n + (k << 4)) | 0;
+                    h[ca >> 3] = +h[ca >> 3] - m;
+                    k = (k + 1) | 0;
+                  }
+                  k = c[46736] | 0;
+                  if ((k | 0) > (c[46737] | 0)) {
+                    c[46737] = k;
+                    o = MK(c[46735] | 0, k << 4) | 0;
+                    c[46735] = o;
+                    n = c[46734] | 0;
+                  } else o = c[46735] | 0;
+                  k = 0;
+                  while (1) {
+                    if ((k | 0) >= (v | 0)) break;
+                    ca = (o + (k << 4)) | 0;
+                    d = (n + (k << 4)) | 0;
+                    c[ca >> 2] = c[d >> 2];
+                    c[(ca + 4) >> 2] = c[(d + 4) >> 2];
+                    c[(ca + 8) >> 2] = c[(d + 8) >> 2];
+                    c[(ca + 12) >> 2] = c[(d + 12) >> 2];
+                    k = (k + 1) | 0;
+                  }
+                  dO(K, c[_ >> 2] | 0, o, v, 17296);
+                  r = ($ + 48) | 0;
+                  s = ($ + -48) | 0;
+                  q = 1;
+                  while (1) {
+                    if ((q | 0) >= (i | 0)) break c;
+                    o = c[(f + ((q + g) << 2)) >> 2] | 0;
+                    p = (o + 16) | 0;
+                    k = c[p >> 2] | 0;
+                    if (c[(k + 164) >> 2] & 32) {
+                      n = c[aa >> 2] | 0;
+                      W6(n | 0, k | 0, 176) | 0;
+                      w = $;
+                      x = o;
+                      y = (w + 48) | 0;
+                      do {
+                        c[w >> 2] = c[x >> 2];
+                        w = (w + 4) | 0;
+                        x = (x + 4) | 0;
+                      } while ((w | 0) < (y | 0));
+                      c[aa >> 2] = n;
+                      w = c[$ >> 2] & 3;
+                      c[(((w | 0) == 3 ? $ : r) + 40) >> 2] =
+                        c[((((c[o >> 2] & 3) | 0) == 2 ? o : (o + -48) | 0) + 40) >> 2];
+                      c[(((w | 0) == 2 ? $ : s) + 40) >> 2] =
+                        c[((((c[o >> 2] & 3) | 0) == 3 ? o : (o + 48) | 0) + 40) >> 2];
+                      w = (n + 16) | 0;
+                      x = ((c[p >> 2] | 0) + 56) | 0;
+                      y = (w + 40) | 0;
+                      do {
+                        c[w >> 2] = c[x >> 2];
+                        w = (w + 4) | 0;
+                        x = (x + 4) | 0;
+                      } while ((w | 0) < (y | 0));
+                      k = c[aa >> 2] | 0;
+                      w = (k + 56) | 0;
+                      x = ((c[p >> 2] | 0) + 16) | 0;
+                      y = (w + 40) | 0;
+                      do {
+                        c[w >> 2] = c[x >> 2];
+                        w = (w + 4) | 0;
+                        x = (x + 4) | 0;
+                      } while ((w | 0) < (y | 0));
+                      a[(k + 112) >> 0] = 1;
+                      c[(k + 116) >> 2] = o;
+                      o = $;
+                    }
+                    p = c[46734] | 0;
+                    k = 1;
+                    while (1) {
+                      if ((k | 0) >= (u | 0)) break;
+                      ca = (p + (k << 4)) | 0;
+                      h[ca >> 3] = +h[ca >> 3] + +(c[t >> 2] | 0);
+                      k = (k + 1) | 0;
+                    }
+                    n = c[46735] | 0;
+                    k = 0;
+                    while (1) {
+                      if ((k | 0) >= (v | 0)) break;
+                      ca = (n + (k << 4)) | 0;
+                      _ = (p + (k << 4)) | 0;
+                      c[ca >> 2] = c[_ >> 2];
+                      c[(ca + 4) >> 2] = c[(_ + 4) >> 2];
+                      c[(ca + 8) >> 2] = c[(_ + 8) >> 2];
+                      c[(ca + 12) >> 2] = c[(_ + 12) >> 2];
+                      k = (k + 1) | 0;
+                    }
+                    dO(o, c[((((c[o >> 2] & 3) | 0) == 2 ? o : (o + -48) | 0) + 40) >> 2] | 0, n, v, 17296);
+                    q = (q + 1) | 0;
+                  }
+                }
+              while (0);
+              l = ba;
+              return;
+            }
+            function sg(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              b = jC(a) | 0;
+              while (1) {
+                if (!b) break;
+                d = XA(a, b) | 0;
+                while (1) {
+                  if (!d) break;
+                  if (
+                    ((kb[c[4324] & 63](d) | 0) << 24) >> 24
+                      ? ((e = c[((c[(d + 16) >> 2] | 0) + 8) >> 2] | 0), e | 0)
+                      : 0
+                  )
+                    tg(e);
+                  d = ZA(a, d) | 0;
+                }
+                b = kC(a, b) | 0;
+              }
+              return;
+            }
+            function tg(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              f = c[(a + 4) >> 2] | 0;
+              g = KK((f * 48) | 0) | 0;
+              b = g;
+              d = 0;
+              e = ((c[a >> 2] | 0) + ((((f + -1) | 0) * 48) | 0)) | 0;
+              while (1) {
+                if ((d | 0) >= (f | 0)) {
+                  b = 0;
+                  break;
+                }
+                ug(e, b);
+                b = (b + 48) | 0;
+                d = (d + 1) | 0;
+                e = (e + -48) | 0;
+              }
+              while (1) {
+                d = c[a >> 2] | 0;
+                if ((b | 0) >= (f | 0)) break;
+                U1(c[(d + ((b * 48) | 0)) >> 2] | 0);
+                b = (b + 1) | 0;
+              }
+              U1(d);
+              c[a >> 2] = g;
+              return;
+            }
+            function ug(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              g = c[(a + 4) >> 2] | 0;
+              h = KK(g << 4) | 0;
+              d = h;
+              e = 0;
+              f = ((c[a >> 2] | 0) + ((g + -1) << 4)) | 0;
+              while (1) {
+                if ((e | 0) >= (g | 0)) break;
+                c[d >> 2] = c[f >> 2];
+                c[(d + 4) >> 2] = c[(f + 4) >> 2];
+                c[(d + 8) >> 2] = c[(f + 8) >> 2];
+                c[(d + 12) >> 2] = c[(f + 12) >> 2];
+                d = (d + 16) | 0;
+                e = (e + 1) | 0;
+                f = (f + -16) | 0;
+              }
+              c[b >> 2] = h;
+              c[(b + 4) >> 2] = g;
+              c[(b + 8) >> 2] = c[(a + 12) >> 2];
+              c[(b + 12) >> 2] = c[(a + 8) >> 2];
+              h = (b + 16) | 0;
+              g = (a + 32) | 0;
+              c[h >> 2] = c[g >> 2];
+              c[(h + 4) >> 2] = c[(g + 4) >> 2];
+              c[(h + 8) >> 2] = c[(g + 8) >> 2];
+              c[(h + 12) >> 2] = c[(g + 12) >> 2];
+              h = (b + 32) | 0;
+              g = (a + 16) | 0;
+              c[h >> 2] = c[g >> 2];
+              c[(h + 4) >> 2] = c[(g + 4) >> 2];
+              c[(h + 8) >> 2] = c[(g + 8) >> 2];
+              c[(h + 12) >> 2] = c[(g + 12) >> 2];
+              return;
+            }
+            function vg(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0;
+              x = l;
+              l = (l + 96) | 0;
+              q = (x + 80) | 0;
+              s = (x + 64) | 0;
+              r = (x + 48) | 0;
+              u = (x + 32) | 0;
+              v = (x + 16) | 0;
+              w = x;
+              m = d;
+              while (1) {
+                t = (m + 16) | 0;
+                g = c[t >> 2] | 0;
+                if (!(a[(g + 112) >> 0] | 0)) break;
+                m = c[(g + 116) >> 2] | 0;
+              }
+              g = c[m >> 2] & 3;
+              o = c[(((g | 0) == 2 ? m : (m + -48) | 0) + 40) >> 2] | 0;
+              g = c[(((g | 0) == 3 ? m : (m + 48) | 0) + 40) >> 2] | 0;
+              m = (o + 16) | 0;
+              n = (g + 16) | 0;
+              y = ((c[((c[m >> 2] | 0) + 232) >> 2] | 0) - (c[((c[n >> 2] | 0) + 232) >> 2] | 0)) | 0;
+              switch (((y | 0) > -1 ? y : (0 - y) | 0) | 0) {
+                case 1: {
+                  g = 0;
+                  break;
+                }
+                case 2: {
+                  if (!(a[((c[((c[(b + 60) >> 2] | 0) + 16) >> 2] | 0) + 113) >> 0] & 1)) p = 6;
+                  else g = 0;
+                  break;
+                }
+                default:
+                  p = 6;
+              }
+              do
+                if ((p | 0) == 6) {
+                  if ((c[((((c[d >> 2] & 3) | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0) == (g | 0)) {
+                    c[f >> 2] = o;
+                    y = ((c[n >> 2] | 0) + 16) | 0;
+                    p = ((c[t >> 2] | 0) + 16) | 0;
+                    c[s >> 2] = c[y >> 2];
+                    c[(s + 4) >> 2] = c[(y + 4) >> 2];
+                    c[(s + 8) >> 2] = c[(y + 8) >> 2];
+                    c[(s + 12) >> 2] = c[(y + 12) >> 2];
+                    c[q >> 2] = c[p >> 2];
+                    c[(q + 4) >> 2] = c[(p + 4) >> 2];
+                    c[(q + 8) >> 2] = c[(p + 8) >> 2];
+                    c[(q + 12) >> 2] = c[(p + 12) >> 2];
+                    Ng(u, s, q);
+                    p = ((c[m >> 2] | 0) + 16) | 0;
+                    y = ((c[t >> 2] | 0) + 56) | 0;
+                    c[s >> 2] = c[p >> 2];
+                    c[(s + 4) >> 2] = c[(p + 4) >> 2];
+                    c[(s + 8) >> 2] = c[(p + 8) >> 2];
+                    c[(s + 12) >> 2] = c[(p + 12) >> 2];
+                    c[q >> 2] = c[y >> 2];
+                    c[(q + 4) >> 2] = c[(y + 4) >> 2];
+                    c[(q + 8) >> 2] = c[(y + 8) >> 2];
+                    c[(q + 12) >> 2] = c[(y + 12) >> 2];
+                    Ng(v, s, q);
+                  } else {
+                    c[f >> 2] = g;
+                    y = ((c[m >> 2] | 0) + 16) | 0;
+                    p = ((c[t >> 2] | 0) + 56) | 0;
+                    c[s >> 2] = c[y >> 2];
+                    c[(s + 4) >> 2] = c[(y + 4) >> 2];
+                    c[(s + 8) >> 2] = c[(y + 8) >> 2];
+                    c[(s + 12) >> 2] = c[(y + 12) >> 2];
+                    c[q >> 2] = c[p >> 2];
+                    c[(q + 4) >> 2] = c[(p + 4) >> 2];
+                    c[(q + 8) >> 2] = c[(p + 8) >> 2];
+                    c[(q + 12) >> 2] = c[(p + 12) >> 2];
+                    Ng(u, s, q);
+                    p = ((c[n >> 2] | 0) + 16) | 0;
+                    y = ((c[t >> 2] | 0) + 16) | 0;
+                    c[s >> 2] = c[p >> 2];
+                    c[(s + 4) >> 2] = c[(p + 4) >> 2];
+                    c[(s + 8) >> 2] = c[(p + 8) >> 2];
+                    c[(s + 12) >> 2] = c[(p + 12) >> 2];
+                    c[q >> 2] = c[y >> 2];
+                    c[(q + 4) >> 2] = c[(y + 4) >> 2];
+                    c[(q + 8) >> 2] = c[(y + 8) >> 2];
+                    c[(q + 12) >> 2] = c[(y + 12) >> 2];
+                    Ng(v, s, q);
+                  }
+                  g = c[((c[t >> 2] | 0) + 96) >> 2] | 0;
+                  if (!g) {
+                    g = (e + 16) | 0;
+                    c[e >> 2] = c[u >> 2];
+                    c[(e + 4) >> 2] = c[(u + 4) >> 2];
+                    c[(e + 8) >> 2] = c[(u + 8) >> 2];
+                    c[(e + 12) >> 2] = c[(u + 12) >> 2];
+                    c[g >> 2] = c[u >> 2];
+                    c[(g + 4) >> 2] = c[(u + 4) >> 2];
+                    c[(g + 8) >> 2] = c[(u + 8) >> 2];
+                    c[(g + 12) >> 2] = c[(u + 12) >> 2];
+                    g = (e + 48) | 0;
+                    y = (e + 32) | 0;
+                    c[y >> 2] = c[v >> 2];
+                    c[(y + 4) >> 2] = c[(v + 4) >> 2];
+                    c[(y + 8) >> 2] = c[(v + 8) >> 2];
+                    c[(y + 12) >> 2] = c[(v + 12) >> 2];
+                    c[g >> 2] = c[v >> 2];
+                    c[(g + 4) >> 2] = c[(v + 4) >> 2];
+                    c[(g + 8) >> 2] = c[(v + 8) >> 2];
+                    c[(g + 12) >> 2] = c[(v + 12) >> 2];
+                    g = 4;
+                    break;
+                  }
+                  j = +h[(g + 24) >> 3];
+                  i = +h[(g + 32) >> 3];
+                  p = ((c[((c[((xC(o) | 0) + 16) >> 2] | 0) + 116) >> 2] & 1) | 0) == 0;
+                  k = p ? i : j;
+                  y = ((c[((c[t >> 2] | 0) + 96) >> 2] | 0) + 56) | 0;
+                  c[w >> 2] = c[y >> 2];
+                  c[(w + 4) >> 2] = c[(y + 4) >> 2];
+                  c[(w + 8) >> 2] = c[(y + 8) >> 2];
+                  c[(w + 12) >> 2] = c[(y + 12) >> 2];
+                  c[r >> 2] = c[v >> 2];
+                  c[(r + 4) >> 2] = c[(v + 4) >> 2];
+                  c[(r + 8) >> 2] = c[(v + 8) >> 2];
+                  c[(r + 12) >> 2] = c[(v + 12) >> 2];
+                  c[s >> 2] = c[u >> 2];
+                  c[(s + 4) >> 2] = c[(u + 4) >> 2];
+                  c[(s + 8) >> 2] = c[(u + 8) >> 2];
+                  c[(s + 12) >> 2] = c[(u + 12) >> 2];
+                  c[q >> 2] = c[y >> 2];
+                  c[(q + 4) >> 2] = c[(y + 4) >> 2];
+                  c[(q + 8) >> 2] = c[(y + 8) >> 2];
+                  c[(q + 12) >> 2] = c[(y + 12) >> 2];
+                  y = (Og(r, s, q) | 0) == 0;
+                  i = (p ? j : i) * 0.5;
+                  j = +h[w >> 3];
+                  if (y) {
+                    h[w >> 3] = j - i;
+                    y = (w + 8) | 0;
+                    h[y >> 3] = +h[y >> 3] + k * 0.5;
+                  } else {
+                    h[w >> 3] = j + i;
+                    y = (w + 8) | 0;
+                    h[y >> 3] = +h[y >> 3] - k * 0.5;
+                  }
+                  g = (e + 16) | 0;
+                  c[e >> 2] = c[u >> 2];
+                  c[(e + 4) >> 2] = c[(u + 4) >> 2];
+                  c[(e + 8) >> 2] = c[(u + 8) >> 2];
+                  c[(e + 12) >> 2] = c[(u + 12) >> 2];
+                  c[g >> 2] = c[u >> 2];
+                  c[(g + 4) >> 2] = c[(u + 4) >> 2];
+                  c[(g + 8) >> 2] = c[(u + 8) >> 2];
+                  c[(g + 12) >> 2] = c[(u + 12) >> 2];
+                  g = (e + 32) | 0;
+                  y = (e + 48) | 0;
+                  u = (e + 64) | 0;
+                  c[u >> 2] = c[w >> 2];
+                  c[(u + 4) >> 2] = c[(w + 4) >> 2];
+                  c[(u + 8) >> 2] = c[(w + 8) >> 2];
+                  c[(u + 12) >> 2] = c[(w + 12) >> 2];
+                  c[y >> 2] = c[w >> 2];
+                  c[(y + 4) >> 2] = c[(w + 4) >> 2];
+                  c[(y + 8) >> 2] = c[(w + 8) >> 2];
+                  c[(y + 12) >> 2] = c[(w + 12) >> 2];
+                  c[g >> 2] = c[w >> 2];
+                  c[(g + 4) >> 2] = c[(w + 4) >> 2];
+                  c[(g + 8) >> 2] = c[(w + 8) >> 2];
+                  c[(g + 12) >> 2] = c[(w + 12) >> 2];
+                  g = (e + 80) | 0;
+                  y = (e + 96) | 0;
+                  c[y >> 2] = c[v >> 2];
+                  c[(y + 4) >> 2] = c[(v + 4) >> 2];
+                  c[(y + 8) >> 2] = c[(v + 8) >> 2];
+                  c[(y + 12) >> 2] = c[(v + 12) >> 2];
+                  c[g >> 2] = c[v >> 2];
+                  c[(g + 4) >> 2] = c[(v + 4) >> 2];
+                  c[(g + 8) >> 2] = c[(v + 8) >> 2];
+                  c[(g + 12) >> 2] = c[(v + 12) >> 2];
+                  g = 7;
+                }
+              while (0);
+              l = x;
+              return g | 0;
+            }
+            function wg(b, d, e, f, g, i) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              var j = 0.0,
+                k = 0,
+                l = 0,
+                m = 0.0,
+                n = 0,
+                o = 0.0,
+                p = 0.0,
+                q = 0;
+              q = c[(f + 16) >> 2] | 0;
+              p = +h[(q + 16) >> 3];
+              j = p - +h[(q + 88) >> 3];
+              m = j + -4.0;
+              l = Jg(d, f, g, i, -1) | 0;
+              if (!l) {
+                n = ~~(j + (m >= 0.0 ? -3.5 : -4.5));
+                k = c[e >> 2] | 0;
+                k = (k | 0) > (n | 0) ? n : k;
+              } else {
+                k = Kg(d, f, l) | 0;
+                do
+                  if (!k) {
+                    n = c[(l + 16) >> 2] | 0;
+                    j = +h[(n + 240) >> 3] + +h[(n + 16) >> 3];
+                    if (!(a[(n + 156) >> 0] | 0)) {
+                      j = +(c[((c[(d + 16) >> 2] | 0) + 248) >> 2] | 0) * 0.5 + j;
+                      break;
+                    } else {
+                      j = j + +(c[(e + 8) >> 2] | 0);
+                      break;
+                    }
+                  } else j = +h[((c[(k + 16) >> 2] | 0) + 32) >> 3] + +(c[(e + 8) >> 2] | 0);
+                while (0);
+                o = j < m ? j : m;
+                k = ~~(o + (o >= 0.0 ? 0.5 : -0.5));
+              }
+              o = +(k | 0);
+              n = (a[(q + 156) >> 0] | 0) == 1;
+              if (n ? (c[(q + 104) >> 2] | 0) != 0 : 0) m = p + 10.0;
+              else m = p + 4.0 + +h[(q + 96) >> 3];
+              l = Jg(d, f, g, i, 1) | 0;
+              if (!l) {
+                f = ~~(m + (m >= 0.0 ? 0.5 : -0.5));
+                k = c[(e + 4) >> 2] | 0;
+                k = (k | 0) < (f | 0) ? f : k;
+              } else {
+                k = Kg(d, f, l) | 0;
+                do
+                  if (!k) {
+                    f = c[(l + 16) >> 2] | 0;
+                    j = +h[(f + 16) >> 3] - +h[(f + 88) >> 3];
+                    if (!(a[(f + 156) >> 0] | 0)) {
+                      j = j - +(c[((c[(d + 16) >> 2] | 0) + 248) >> 2] | 0) * 0.5;
+                      break;
+                    } else {
+                      j = j - +(c[(e + 8) >> 2] | 0);
+                      break;
+                    }
+                  } else j = +h[((c[(k + 16) >> 2] | 0) + 16) >> 3] - +(c[(e + 8) >> 2] | 0);
+                while (0);
+                m = j > m ? j : m;
+                k = ~~(m + (m >= 0.0 ? 0.5 : -0.5));
+              }
+              j = +(k | 0);
+              if (n ? (c[(q + 104) >> 2] | 0) != 0 : 0) {
+                j = j - +h[(q + 96) >> 3];
+                if (j < o) j = p;
+              }
+              p = +h[(q + 24) >> 3];
+              d = c[((c[(d + 16) >> 2] | 0) + 196) >> 2] | 0;
+              q = c[(q + 232) >> 2] | 0;
+              m = p - +h[(d + (q << 6) + 16) >> 3];
+              p = +h[(d + (q << 6) + 24) >> 3] + p;
+              h[b >> 3] = o;
+              h[(b + 8) >> 3] = m;
+              h[(b + 16) >> 3] = j;
+              h[(b + 24) >> 3] = p;
+              return;
+            }
+            function xg(b) {
+              b = b | 0;
+              b = c[(b + 16) >> 2] | 0;
+              if ((a[(b + 156) >> 0] | 0) == 1)
+                if ((c[(b + 176) >> 2] | 0) > 1) b = 1;
+                else b = ((c[(b + 184) >> 2] | 0) > 1) & 1;
+              else b = 0;
+              return b | 0;
+            }
+            function yg(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = +e;
+              var f = 0,
+                g = 0;
+              g = l;
+              l = (l + 32) | 0;
+              f = g;
+              switch (d | 0) {
+                case 1: {
+                  Ig(f, +h[b >> 3], e, +h[(b + 16) >> 3], +h[(b + 8) >> 3]);
+                  break;
+                }
+                case 4: {
+                  Ig(f, +h[b >> 3], +h[(b + 24) >> 3], +h[(b + 16) >> 3], e);
+                  break;
+                }
+                default: {
+                }
+              }
+              c[a >> 2] = c[f >> 2];
+              c[(a + 4) >> 2] = c[(f + 4) >> 2];
+              c[(a + 8) >> 2] = c[(f + 8) >> 2];
+              c[(a + 12) >> 2] = c[(f + 12) >> 2];
+              c[(a + 16) >> 2] = c[(f + 16) >> 2];
+              c[(a + 20) >> 2] = c[(f + 20) >> 2];
+              c[(a + 24) >> 2] = c[(f + 24) >> 2];
+              c[(a + 28) >> 2] = c[(f + 28) >> 2];
+              l = g;
+              return;
+            }
+            function zg(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              l = c[(b + 16) >> 2] | 0;
+              k = (l + (e << 5)) | 0;
+              j = +h[k >> 3];
+              m = (l + (e << 5) + 8) | 0;
+              g = +h[m >> 3];
+              n = (l + (e << 5) + 16) | 0;
+              f = +h[n >> 3];
+              l = (l + (e << 5) + 24) | 0;
+              i = +h[l >> 3];
+              if (j == f) {
+                d = c[((c[(d + 16) >> 2] | 0) + 196) >> 2] | 0;
+                o = (e + 1) | 0;
+                j = +(c[b >> 2] | 0);
+                g =
+                  +h[(d + (o << 6) + 24) >> 3] +
+                  +h[((c[((c[c[(d + (o << 6) + 4) >> 2] >> 2] | 0) + 16) >> 2] | 0) + 24) >> 3];
+                f = +(c[(b + 4) >> 2] | 0);
+                i =
+                  +h[((c[((c[c[(d + (e << 6) + 4) >> 2] >> 2] | 0) + 16) >> 2] | 0) + 24) >> 3] -
+                  +h[(d + (e << 6) + 16) >> 3];
+                h[k >> 3] = j;
+                h[m >> 3] = g;
+                h[n >> 3] = f;
+                h[l >> 3] = i;
+              }
+              h[a >> 3] = j;
+              h[(a + 8) >> 3] = g;
+              h[(a + 16) >> 3] = f;
+              h[(a + 24) >> 3] = i;
+              return;
+            }
+            function Ag(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              b = c[(b + 16) >> 2] | 0;
+              e = (b + 16) | 0;
+              d = 0;
+              while (1) {
+                b = c[c[(b + 180) >> 2] >> 2] | 0;
+                b = c[((c[((((c[b >> 2] & 3) | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                if ((a[(b + 156) >> 0] | 0) != 1) break;
+                if ((c[(b + 184) >> 2] | 0) != 1) break;
+                if ((c[(b + 176) >> 2] | 0) != 1) break;
+                if (+h[(b + 16) >> 3] != +h[e >> 3]) break;
+                d = (d + 1) | 0;
+              }
+              return d | 0;
+            }
+            function Bg(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 32) | 0;
+              j = k;
+              h = Fg(b, -1) | 0;
+              b = Fg(b, 1) | 0;
+              if (!((h | 0) != 0 ? !(uO(h) | 0) : 0)) i = 3;
+              do
+                if ((i | 0) == 3) {
+                  if (b | 0 ? (uO(b) | 0) == 0 : 0) break;
+                  h = Gg(d, -1) | 0;
+                  b = Gg(d, 1) | 0;
+                  if (h | 0 ? (uO(h) | 0) == 0 : 0) break;
+                  if (b | 0 ? (uO(b) | 0) == 0 : 0) break;
+                  h = (e + 52) | 0;
+                  b = 0;
+                  while (1) {
+                    if ((b | 0) >= (c[h >> 2] | 0)) break;
+                    d = (e + 56 + (b << 5)) | 0;
+                    c[j >> 2] = c[d >> 2];
+                    c[(j + 4) >> 2] = c[(d + 4) >> 2];
+                    c[(j + 8) >> 2] = c[(d + 8) >> 2];
+                    c[(j + 12) >> 2] = c[(d + 12) >> 2];
+                    c[(j + 16) >> 2] = c[(d + 16) >> 2];
+                    c[(j + 20) >> 2] = c[(d + 20) >> 2];
+                    c[(j + 24) >> 2] = c[(d + 24) >> 2];
+                    c[(j + 28) >> 2] = c[(d + 28) >> 2];
+                    fO(a, j);
+                    b = (b + 1) | 0;
+                  }
+                  h = c[(a + 80) >> 2] | 0;
+                  i = (g + -3) | 0;
+                  b = 0;
+                  while (1) {
+                    if ((b | 0) >= (g | 0)) break;
+                    e = (153720 + (b << 5)) | 0;
+                    c[j >> 2] = c[e >> 2];
+                    c[(j + 4) >> 2] = c[(e + 4) >> 2];
+                    c[(j + 8) >> 2] = c[(e + 8) >> 2];
+                    c[(j + 12) >> 2] = c[(e + 12) >> 2];
+                    c[(j + 16) >> 2] = c[(e + 16) >> 2];
+                    c[(j + 20) >> 2] = c[(e + 20) >> 2];
+                    c[(j + 24) >> 2] = c[(e + 24) >> 2];
+                    c[(j + 28) >> 2] = c[(e + 28) >> 2];
+                    fO(a, j);
+                    b = (b + 1) | 0;
+                  }
+                  d = (h + 1) | 0;
+                  i = (i + d) | 0;
+                  h = c[(f + 52) >> 2] | 0;
+                  while (1) {
+                    b = (h + -1) | 0;
+                    if ((h | 0) <= 0) break;
+                    h = (f + 56 + (b << 5)) | 0;
+                    c[j >> 2] = c[h >> 2];
+                    c[(j + 4) >> 2] = c[(h + 4) >> 2];
+                    c[(j + 8) >> 2] = c[(h + 8) >> 2];
+                    c[(j + 12) >> 2] = c[(h + 12) >> 2];
+                    c[(j + 16) >> 2] = c[(h + 16) >> 2];
+                    c[(j + 20) >> 2] = c[(h + 20) >> 2];
+                    c[(j + 24) >> 2] = c[(h + 24) >> 2];
+                    c[(j + 28) >> 2] = c[(h + 28) >> 2];
+                    fO(a, j);
+                    h = b;
+                  }
+                  Hg(a, d, i);
+                }
+              while (0);
+              l = k;
+              return;
+            }
+            function Cg(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              f = c[e >> 2] | 0;
+              while (1) {
+                if (!b) break;
+                a =
+                  c[
+                    c[
+                      ((c[((c[((((c[a >> 2] & 3) | 0) == 2 ? a : (a + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                        180) >>
+                        2
+                    ] >> 2
+                  ] | 0;
+                b = (b + -1) | 0;
+              }
+              c[e >> 2] = f + 1;
+              g = (d + (f << 4)) | 0;
+              b = (d + ((f + -1) << 4)) | 0;
+              c[g >> 2] = c[b >> 2];
+              c[(g + 4) >> 2] = c[(b + 4) >> 2];
+              c[(g + 8) >> 2] = c[(b + 8) >> 2];
+              c[(g + 12) >> 2] = c[(b + 12) >> 2];
+              f = c[e >> 2] | 0;
+              c[e >> 2] = f + 1;
+              f = (d + (f << 4)) | 0;
+              c[f >> 2] = c[b >> 2];
+              c[(f + 4) >> 2] = c[(b + 4) >> 2];
+              c[(f + 8) >> 2] = c[(b + 8) >> 2];
+              c[(f + 12) >> 2] = c[(b + 12) >> 2];
+              f = (d + (c[e >> 2] << 4)) | 0;
+              e = ((c[((c[((((c[a >> 2] & 3) | 0) == 3 ? a : (a + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 16) | 0;
+              c[f >> 2] = c[e >> 2];
+              c[(f + 4) >> 2] = c[(e + 4) >> 2];
+              c[(f + 8) >> 2] = c[(e + 8) >> 2];
+              c[(f + 12) >> 2] = c[(e + 12) >> 2];
+              return a | 0;
+            }
+            function Dg(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              m = (d + 84) | 0;
+              l = (d + 80) | 0;
+              e = 0;
+              d = b;
+              a: while (1) {
+                j = c[((((c[d >> 2] & 3) | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0;
+                k = (j + 16) | 0;
+                if ((a[((c[k >> 2] | 0) + 156) >> 0] | 0) != 1) break;
+                if (((kb[c[17300 >> 2] & 63](j) | 0) << 24) >> 24) break;
+                d = c[l >> 2] | 0;
+                while (1) {
+                  if ((e | 0) >= (d | 0)) break a;
+                  if (!(+h[((c[m >> 2] | 0) + (e << 5) + 8) >> 3] > +h[((c[k >> 2] | 0) + 24) >> 3])) break;
+                  e = (e + 1) | 0;
+                }
+                d = c[m >> 2] | 0;
+                b = c[k >> 2] | 0;
+                do
+                  if (!(+h[(d + (e << 5) + 24) >> 3] < +h[(b + 24) >> 3])) {
+                    g = +h[(d + (e << 5)) >> 3];
+                    i = ~~g;
+                    f = +h[(d + (e << 5) + 16) >> 3];
+                    if (!(c[(b + 104) >> 2] | 0)) {
+                      Eg(j, i, ~~((f + g) * 0.5), ~~f);
+                      break;
+                    } else {
+                      Eg(j, i, ~~f, ~~(+h[(b + 96) >> 3] + f));
+                      break;
+                    }
+                  }
+                while (0);
+                d = c[c[((c[k >> 2] | 0) + 180) >> 2] >> 2] | 0;
+              }
+              return;
+            }
+            function Eg(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              a = c[(a + 16) >> 2] | 0;
+              h[(a + 16) >> 3] = +(d | 0);
+              h[(a + 88) >> 3] = +((d - b) | 0);
+              h[(a + 96) >> 3] = +((e - d) | 0);
+              return;
+            }
+            function Fg(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              h = c[a >> 2] & 3;
+              i = c[((c[((c[(((h | 0) == 3 ? a : (a + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 180) >> 2] | 0;
+              h = (((h | 0) == 2 ? a : (a + -48) | 0) + 40) | 0;
+              g = 0;
+              a = 0;
+              while (1) {
+                e = c[(i + (g << 2)) >> 2] | 0;
+                if (!e) break;
+                f =
+                  c[
+                    ((c[((c[((((c[e >> 2] & 3) | 0) == 2 ? e : (e + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                      236) >>
+                      2
+                  ] | 0;
+                do
+                  if ((O((f - (c[((c[((c[h >> 2] | 0) + 16) >> 2] | 0) + 236) >> 2] | 0)) | 0, b) | 0) >= 1) {
+                    d = c[(e + 16) >> 2] | 0;
+                    if (!(c[(d + 8) >> 2] | 0)) {
+                      d = c[(d + 116) >> 2] | 0;
+                      if (!d) break;
+                      if (!(c[((c[(d + 16) >> 2] | 0) + 8) >> 2] | 0)) break;
+                    }
+                    if (
+                      a | 0
+                        ? (O(
+                            ((c[
+                              ((c[((c[((((c[a >> 2] & 3) | 0) == 2 ? a : (a + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] |
+                                0) +
+                                236) >>
+                                2
+                            ] |
+                              0) -
+                              f) |
+                              0,
+                            b
+                          ) |
+                            0) <=
+                          0
+                        : 0
+                    )
+                      break;
+                    a = e;
+                  }
+                while (0);
+                g = (g + 1) | 0;
+              }
+              return a | 0;
+            }
+            function Gg(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              h = c[a >> 2] & 3;
+              i = c[((c[((c[(((h | 0) == 2 ? a : (a + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 172) >> 2] | 0;
+              h = (((h | 0) == 3 ? a : (a + 48) | 0) + 40) | 0;
+              g = 0;
+              a = 0;
+              while (1) {
+                e = c[(i + (g << 2)) >> 2] | 0;
+                if (!e) break;
+                f =
+                  c[
+                    ((c[((c[((((c[e >> 2] & 3) | 0) == 3 ? e : (e + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 236) >>
+                      2
+                  ] | 0;
+                do
+                  if ((O((f - (c[((c[((c[h >> 2] | 0) + 16) >> 2] | 0) + 236) >> 2] | 0)) | 0, b) | 0) >= 1) {
+                    d = c[(e + 16) >> 2] | 0;
+                    if (!(c[(d + 8) >> 2] | 0)) {
+                      d = c[(d + 116) >> 2] | 0;
+                      if (!d) break;
+                      if (!(c[((c[(d + 16) >> 2] | 0) + 8) >> 2] | 0)) break;
+                    }
+                    if (
+                      a | 0
+                        ? (O(
+                            ((c[
+                              ((c[((c[((((c[a >> 2] & 3) | 0) == 3 ? a : (a + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] |
+                                0) +
+                                236) >>
+                                2
+                            ] |
+                              0) -
+                              f) |
+                              0,
+                            b
+                          ) |
+                            0) <=
+                          0
+                        : 0
+                    )
+                      break;
+                    a = e;
+                  }
+                while (0);
+                g = (g + 1) | 0;
+              }
+              return a | 0;
+            }
+            function Hg(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0.0;
+              l = (a + 84) | 0;
+              i = (b + -1) | 0;
+              while (1) {
+                if ((i | 0) > (d | 0)) break;
+                f = c[l >> 2] | 0;
+                j = (f + (i << 5)) | 0;
+                e = +h[j >> 3];
+                if (!((i - b) & 1)) {
+                  f = (f + (i << 5) + 16) | 0;
+                  m = +h[f >> 3];
+                  g = ~~((m + e) * 0.5);
+                  if (e >= m) {
+                    h[j >> 3] = +((g + -8) | 0);
+                    h[f >> 3] = +((g + 8) | 0);
+                  }
+                } else {
+                  f = (f + (i << 5) + 16) | 0;
+                  m = +h[f >> 3];
+                  g = ~~((m + e) * 0.5);
+                  if (e + 16.0 > m) {
+                    h[j >> 3] = +((g + -8) | 0);
+                    h[f >> 3] = +((g + 8) | 0);
+                  }
+                }
+                i = (i + 1) | 0;
+              }
+              k = ((c[(a + 80) >> 2] | 0) + -1) | 0;
+              g = 0;
+              while (1) {
+                if ((g | 0) >= (k | 0)) break;
+                i = c[l >> 2] | 0;
+                f = (i + (g << 5)) | 0;
+                j = (g + 1) | 0;
+                a = (i + (j << 5)) | 0;
+                if (!(((g | 0) < (b | 0)) | ((g | 0) > (d | 0))) ? (((g - b) & 1) | 0) == 0 : 0) {
+                  e = +h[f >> 3] + 16.0;
+                  f = (i + (j << 5) + 16) | 0;
+                  if (e > +h[f >> 3]) h[f >> 3] = e;
+                  e = +h[(i + (g << 5) + 16) >> 3] + -16.0;
+                  if (!(e < +h[a >> 3])) {
+                    g = j;
+                    continue;
+                  }
+                  h[a >> 3] = e;
+                  g = j;
+                  continue;
+                }
+                if (!(((g | 0) < (d | 0)) & ((j | 0) >= (b | 0)))) {
+                  g = j;
+                  continue;
+                }
+                if (((j - b) & 1) | 0) {
+                  g = j;
+                  continue;
+                }
+                e = +h[(i + (j << 5) + 16) >> 3];
+                if (+h[f >> 3] + 16.0 > e) h[f >> 3] = e + -16.0;
+                f = (i + (g << 5) + 16) | 0;
+                e = +h[a >> 3];
+                if (!(+h[f >> 3] + -16.0 < e)) {
+                  g = j;
+                  continue;
+                }
+                h[f >> 3] = e + 16.0;
+                g = j;
+              }
+              return;
+            }
+            function Ig(a, b, c, d, e) {
+              a = a | 0;
+              b = +b;
+              c = +c;
+              d = +d;
+              e = +e;
+              h[a >> 3] = b;
+              h[(a + 8) >> 3] = c;
+              h[(a + 16) >> 3] = d;
+              h[(a + 24) >> 3] = e;
+              return;
+            }
+            function Jg(b, d, e, f, g) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = c[((c[(b + 16) >> 2] | 0) + 196) >> 2] | 0;
+              h = c[(d + 16) >> 2] | 0;
+              j = c[(h + 232) >> 2] | 0;
+              i = (k + (j << 6)) | 0;
+              j = (k + (j << 6) + 4) | 0;
+              h = c[(h + 236) >> 2] | 0;
+              a: do {
+                h = (h + g) | 0;
+                if ((h | 0) <= -1) {
+                  b = 0;
+                  break;
+                }
+                if ((h | 0) >= (c[i >> 2] | 0)) {
+                  b = 0;
+                  break;
+                }
+                b = c[((c[j >> 2] | 0) + (h << 2)) >> 2] | 0;
+                k = c[(b + 16) >> 2] | 0;
+                switch (a[(k + 156) >> 0] | 0) {
+                  case 0:
+                    break a;
+                  case 1: {
+                    if (c[(k + 104) >> 2] | 0) break a;
+                    break;
+                  }
+                  default: {
+                  }
+                }
+              } while (((Mg(b, d, e, f) | 0) << 24) >> 24 != 0);
+              return b | 0;
+            }
+            function Kg(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              d = c[(d + 16) >> 2] | 0;
+              if (!(a[(d + 156) >> 0] | 0)) {
+                i = c[(d + 212) >> 2] | 0;
+                h = i;
+              } else {
+                i = c[((c[((c[c[(d + 180) >> 2] >> 2] | 0) + 16) >> 2] | 0) + 116) >> 2] | 0;
+                g = c[i >> 2] & 3;
+                h = c[((c[((c[(((g | 0) == 2 ? i : (i + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 212) >> 2] | 0;
+                i = c[((c[((c[(((g | 0) == 3 ? i : (i + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 212) >> 2] | 0;
+              }
+              d = c[(e + 16) >> 2] | 0;
+              if (!(a[(d + 156) >> 0] | 0)) {
+                e = c[(d + 212) >> 2] | 0;
+                e = (e | 0) == (b | 0) ? 0 : e;
+                return (((e | 0) == (h | 0)) | (((e | 0) == 0) | ((e | 0) == (i | 0))) ? 0 : e) | 0;
+              }
+              f = c[((c[((c[c[(d + 180) >> 2] >> 2] | 0) + 16) >> 2] | 0) + 116) >> 2] | 0;
+              g = c[f >> 2] & 3;
+              d = c[((c[((c[(((g | 0) == 3 ? f : (f + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 212) >> 2] | 0;
+              d = (d | 0) == (b | 0) ? 0 : d;
+              if (!(!(((d | 0) == (h | 0)) | (((d | 0) == 0) | ((d | 0) == (i | 0)))) ? (Lg(d, e) | 0) != 0 : 0)) {
+                d = c[((c[((c[(((g | 0) == 2 ? f : (f + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 212) >> 2] | 0;
+                d = (d | 0) == (b | 0) ? 0 : d;
+                if (((d | 0) == (h | 0)) | (((d | 0) == 0) | ((d | 0) == (i | 0)))) d = 0;
+                else {
+                  e = (Lg(d, e) | 0) == 0;
+                  return (e ? 0 : d) | 0;
+                }
+              }
+              return d | 0;
+            }
+            function Lg(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0.0,
+                f = 0.0;
+              d = c[(a + 16) >> 2] | 0;
+              a = c[(b + 16) >> 2] | 0;
+              f = +h[(a + 16) >> 3];
+              if (
+                (+h[(d + 16) >> 3] <= f ? f <= +h[(d + 32) >> 3] : 0)
+                  ? ((e = +h[(a + 24) >> 3]), +h[(d + 24) >> 3] <= e)
+                  : 0
+              )
+                a = (e <= +h[(d + 40) >> 3]) & 1;
+              else a = 0;
+              return a | 0;
+            }
+            function Mg(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              i = c[(b + 16) >> 2] | 0;
+              j = (c[(i + 236) >> 2] | 0) > (c[((c[(d + 16) >> 2] | 0) + 236) >> 2] | 0);
+              a: do
+                if ((c[(i + 184) >> 2] | 0) == 1) {
+                  b: do
+                    if (f | 0) {
+                      h = 0;
+                      b = c[c[(i + 180) >> 2] >> 2] | 0;
+                      while (1) {
+                        if ((h | 0) >= 2) break b;
+                        b = c[((((c[b >> 2] & 3) | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0;
+                        d = c[((((c[f >> 2] & 3) | 0) == 2 ? f : (f + -48) | 0) + 40) >> 2] | 0;
+                        if ((b | 0) == (d | 0)) break b;
+                        g = c[(b + 16) >> 2] | 0;
+                        b = c[(d + 16) >> 2] | 0;
+                        if (j ^ ((c[(g + 236) >> 2] | 0) > (c[(b + 236) >> 2] | 0))) {
+                          b = 1;
+                          break a;
+                        }
+                        if ((c[(g + 184) >> 2] | 0) != 1) break b;
+                        if (!(a[(g + 156) >> 0] | 0)) break b;
+                        if ((c[(b + 184) >> 2] | 0) != 1) break b;
+                        if (!(a[(b + 156) >> 0] | 0)) break b;
+                        h = (h + 1) | 0;
+                        f = c[c[(b + 180) >> 2] >> 2] | 0;
+                        b = c[c[(g + 180) >> 2] >> 2] | 0;
+                      }
+                    }
+                  while (0);
+                  if (e | 0 ? (c[(i + 176) >> 2] | 0) == 1 : 0) {
+                    g = 0;
+                    d = e;
+                    b = c[c[(i + 172) >> 2] >> 2] | 0;
+                    while (1) {
+                      if ((g | 0) >= 2) {
+                        b = 0;
+                        break a;
+                      }
+                      b = c[((((c[b >> 2] & 3) | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0;
+                      d = c[((((c[d >> 2] & 3) | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0;
+                      if ((b | 0) == (d | 0)) {
+                        b = 0;
+                        break a;
+                      }
+                      f = c[(b + 16) >> 2] | 0;
+                      b = c[(d + 16) >> 2] | 0;
+                      if (j ^ ((c[(f + 236) >> 2] | 0) > (c[(b + 236) >> 2] | 0))) {
+                        b = 1;
+                        break a;
+                      }
+                      if ((c[(f + 176) >> 2] | 0) != 1) {
+                        b = 0;
+                        break a;
+                      }
+                      if (!(a[(f + 156) >> 0] | 0)) {
+                        b = 0;
+                        break a;
+                      }
+                      if ((c[(b + 176) >> 2] | 0) != 1) {
+                        b = 0;
+                        break a;
+                      }
+                      if (!(a[(b + 156) >> 0] | 0)) {
+                        b = 0;
+                        break a;
+                      }
+                      g = (g + 1) | 0;
+                      d = c[c[(b + 172) >> 2] >> 2] | 0;
+                      b = c[c[(f + 172) >> 2] >> 2] | 0;
+                    }
+                  } else b = 0;
+                } else b = 0;
+              while (0);
+              return b | 0;
+            }
+            function Ng(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0;
+              d = +h[(c + 8) >> 3] + +h[(b + 8) >> 3];
+              h[a >> 3] = +h[c >> 3] + +h[b >> 3];
+              h[(a + 8) >> 3] = d;
+              return;
+            }
+            function Og(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0,
+                e = 0.0;
+              d = +h[(b + 8) >> 3];
+              e = +h[b >> 3];
+              return (
+                ((~~((+h[c >> 3] - e) * (+h[(a + 8) >> 3] - d) - (+h[a >> 3] - e) * (+h[(c + 8) >> 3] - d)) | 0) > 0) |
+                0
+              );
+            }
+            function Pg(b, d, e, f, g, i) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              var j = 0,
+                k = 0,
+                m = 0.0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0.0,
+                t = 0,
+                u = 0,
+                v = 0.0,
+                w = 0.0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                O = 0,
+                P = 0,
+                Q = 0,
+                R = 0,
+                S = 0,
+                T = 0;
+              R = l;
+              l = (l + 256) | 0;
+              D = (R + 232) | 0;
+              C = (R + 216) | 0;
+              P = (R + 88) | 0;
+              O = (R + 80) | 0;
+              K = (R + 64) | 0;
+              L = (R + 200) | 0;
+              M = (R + 184) | 0;
+              N = R;
+              E = (R + 168) | 0;
+              F = (R + 152) | 0;
+              G = (R + 136) | 0;
+              H = (R + 120) | 0;
+              I = (R + 104) | 0;
+              B = c[g >> 2] & 3;
+              J = c[(((B | 0) == 3 ? g : (g + 48) | 0) + 40) >> 2] | 0;
+              B = c[(((B | 0) == 2 ? g : (g + -48) | 0) + 40) >> 2] | 0;
+              do
+                if ((WM(J) | 0) != 2 ? (WM(B) | 0) != 2 : 0) {
+                  g = 0;
+                  j = 0;
+                  k = 0;
+                  while (1) {
+                    if ((k | 0) >= (f | 0)) break;
+                    A = c[((c[(d + ((k + e) << 2)) >> 2] | 0) + 16) >> 2] | 0;
+                    g = (g + (((c[(A + 96) >> 2] | 0) != 0) & 1)) | 0;
+                    if (!((a[(A + 44) >> 0] | 0) == 0 ? (a[(A + 84) >> 0] | 0) == 0 : 0)) j = 1;
+                    k = (k + 1) | 0;
+                  }
+                  if (!j)
+                    if (!g) {
+                      Rg(J, B, d, e, f, i);
+                      break;
+                    } else {
+                      Wg(J, B, d, e, f, i, g);
+                      break;
+                    }
+                  y = JK(156) | 0;
+                  z = Xg(b, y) | 0;
+                  t = ND(z, 85478, 1) | 0;
+                  TC(t, 137483, 280, 1) | 0;
+                  SA(t, 87171, 87185) | 0;
+                  m = +h[((c[(B + 16) >> 2] | 0) + 16) >> 3];
+                  s = +h[((c[(J + 16) >> 2] | 0) + 16) >> 3];
+                  A = (b + 16) | 0;
+                  q = ((c[((c[A >> 2] | 0) + 116) >> 2] & 1) | 0) == 0;
+                  r = q ? B : J;
+                  q = q ? J : B;
+                  t = Yg(t, q) | 0;
+                  u = Yg(z, r) | 0;
+                  g = 0;
+                  p = 0;
+                  while (1) {
+                    if ((p | 0) >= (f | 0)) break;
+                    j = (d + ((p + e) << 2)) | 0;
+                    while (1) {
+                      o = c[j >> 2] | 0;
+                      n = (o + 16) | 0;
+                      j = c[n >> 2] | 0;
+                      if (!(a[(j + 112) >> 0] | 0)) break;
+                      else j = (j + 116) | 0;
+                    }
+                    if ((c[((((c[o >> 2] & 3) | 0) == 3 ? o : (o + 48) | 0) + 40) >> 2] | 0) == (q | 0))
+                      k = Zg(z, t, u, o) | 0;
+                    else k = Zg(z, u, t, o) | 0;
+                    j = c[n >> 2] | 0;
+                    c[(j + 120) >> 2] = k;
+                    if (!g)
+                      if ((a[(j + 44) >> 0] | 0) == 0 ? (a[(j + 84) >> 0] | 0) == 0 : 0) {
+                        c[((c[(k + 16) >> 2] | 0) + 120) >> 2] = o;
+                        g = k;
+                      } else g = 0;
+                    p = (p + 1) | 0;
+                  }
+                  if (!g) x = iB(z, t, u, 0, 1) | 0;
+                  else x = g;
+                  KA(x, c[47174] | 0, 85482) | 0;
+                  g = (z + 16) | 0;
+                  n = c[g >> 2] | 0;
+                  c[(n + 144) >> 2] = c[((c[A >> 2] | 0) + 144) >> 2];
+                  c[(n + 188) >> 2] = z;
+                  oQ(z, i);
+                  Of(z);
+                  xj(z, 0);
+                  Hh(z, 0);
+                  Ki(z, 0);
+                  q = (q + 16) | 0;
+                  i = c[q >> 2] | 0;
+                  n = c[(r + 16) >> 2] | 0;
+                  r = (t + 16) | 0;
+                  o = c[r >> 2] | 0;
+                  p = (o + 16) | 0;
+                  v = +(~~m | 0);
+                  w = +(~~((+h[((c[(u + 16) >> 2] | 0) + 16) >> 3] + +h[p >> 3]) * 0.5) | 0);
+                  m = +(~~s | 0);
+                  s = +(~~((+h[(i + 16) >> 3] - +h[(i + 96) >> 3] + +h[(n + 16) >> 3] + +h[(n + 88) >> 3]) * 0.5) | 0);
+                  n = (o + 24) | 0;
+                  g = ((c[g >> 2] | 0) + 192) | 0;
+                  while (1) {
+                    j = c[g >> 2] | 0;
+                    if (!j) break;
+                    do
+                      if ((j | 0) != (t | 0)) {
+                        g = c[(j + 16) >> 2] | 0;
+                        k = (g + 24) | 0;
+                        if ((j | 0) == (u | 0)) {
+                          h[k >> 3] = m;
+                          h[(g + 16) >> 3] = w;
+                          break;
+                        } else {
+                          h[k >> 3] = s;
+                          break;
+                        }
+                      } else {
+                        h[n >> 3] = v;
+                        h[p >> 3] = w;
+                        g = o;
+                      }
+                    while (0);
+                    g = (g + 164) | 0;
+                  }
+                  rk(z);
+                  jg(z, 0);
+                  tM(z);
+                  k = c[q >> 2] | 0;
+                  g = c[r >> 2] | 0;
+                  if (!(c[((c[A >> 2] | 0) + 116) >> 2] & 1)) {
+                    j = (g + 16) | 0;
+                    m = +h[(k + 24) >> 3] - +h[(g + 24) >> 3];
+                  } else {
+                    j = (g + 24) | 0;
+                    m = +h[(g + 16) >> 3] + +h[(k + 24) >> 3];
+                  }
+                  h[K >> 3] = +h[(k + 16) >> 3] - +h[j >> 3];
+                  h[(K + 8) >> 3] = m;
+                  i = (N + 16) | 0;
+                  t = (N + 32) | 0;
+                  u = (N + 48) | 0;
+                  r = 0;
+                  while (1) {
+                    if ((r | 0) >= (f | 0)) break;
+                    g = (d + ((r + e) << 2)) | 0;
+                    while (1) {
+                      j = c[g >> 2] | 0;
+                      q = (j + 16) | 0;
+                      g = c[q >> 2] | 0;
+                      if (!(a[(g + 112) >> 0] | 0)) break;
+                      else g = (g + 116) | 0;
+                    }
+                    o = c[(g + 120) >> 2] | 0;
+                    p = (o + 16) | 0;
+                    g = c[p >> 2] | 0;
+                    if (!(((o | 0) == (x | 0)) & ((c[(g + 120) >> 2] | 0) == 0))) {
+                      n = c[c[(g + 8) >> 2] >> 2] | 0;
+                      o = (n + 4) | 0;
+                      j = cO(j, c[o >> 2] | 0) | 0;
+                      c[(j + 8) >> 2] = c[(n + 8) >> 2];
+                      g = (j + 16) | 0;
+                      k = (n + 16) | 0;
+                      S = c[((c[A >> 2] | 0) + 116) >> 2] & 1;
+                      c[C >> 2] = c[k >> 2];
+                      c[(C + 4) >> 2] = c[(k + 4) >> 2];
+                      c[(C + 8) >> 2] = c[(k + 8) >> 2];
+                      c[(C + 12) >> 2] = c[(k + 12) >> 2];
+                      c[D >> 2] = c[K >> 2];
+                      c[(D + 4) >> 2] = c[(K + 4) >> 2];
+                      c[(D + 8) >> 2] = c[(K + 8) >> 2];
+                      c[(D + 12) >> 2] = c[(K + 12) >> 2];
+                      _g(L, C, D, S);
+                      c[g >> 2] = c[L >> 2];
+                      c[(g + 4) >> 2] = c[(L + 4) >> 2];
+                      c[(g + 8) >> 2] = c[(L + 8) >> 2];
+                      c[(g + 12) >> 2] = c[(L + 12) >> 2];
+                      c[(j + 12) >> 2] = c[(n + 12) >> 2];
+                      g = (j + 32) | 0;
+                      S = (n + 32) | 0;
+                      k = c[((c[A >> 2] | 0) + 116) >> 2] & 1;
+                      c[C >> 2] = c[S >> 2];
+                      c[(C + 4) >> 2] = c[(S + 4) >> 2];
+                      c[(C + 8) >> 2] = c[(S + 8) >> 2];
+                      c[(C + 12) >> 2] = c[(S + 12) >> 2];
+                      c[D >> 2] = c[K >> 2];
+                      c[(D + 4) >> 2] = c[(K + 4) >> 2];
+                      c[(D + 8) >> 2] = c[(K + 8) >> 2];
+                      c[(D + 12) >> 2] = c[(K + 12) >> 2];
+                      _g(M, C, D, k);
+                      c[g >> 2] = c[M >> 2];
+                      c[(g + 4) >> 2] = c[(M + 4) >> 2];
+                      c[(g + 8) >> 2] = c[(M + 8) >> 2];
+                      c[(g + 12) >> 2] = c[(M + 12) >> 2];
+                      g = 0;
+                      while (1) {
+                        if ((g | 0) >= (c[o >> 2] | 0)) break;
+                        k = ((c[j >> 2] | 0) + (g << 4)) | 0;
+                        T = ((c[n >> 2] | 0) + (g << 4)) | 0;
+                        S = c[((c[A >> 2] | 0) + 116) >> 2] & 1;
+                        c[C >> 2] = c[T >> 2];
+                        c[(C + 4) >> 2] = c[(T + 4) >> 2];
+                        c[(C + 8) >> 2] = c[(T + 8) >> 2];
+                        c[(C + 12) >> 2] = c[(T + 12) >> 2];
+                        c[D >> 2] = c[K >> 2];
+                        c[(D + 4) >> 2] = c[(K + 4) >> 2];
+                        c[(D + 8) >> 2] = c[(K + 8) >> 2];
+                        c[(D + 12) >> 2] = c[(K + 12) >> 2];
+                        _g(E, C, D, S);
+                        c[k >> 2] = c[E >> 2];
+                        c[(k + 4) >> 2] = c[(E + 4) >> 2];
+                        c[(k + 8) >> 2] = c[(E + 8) >> 2];
+                        c[(k + 12) >> 2] = c[(E + 12) >> 2];
+                        c[N >> 2] = c[E >> 2];
+                        c[(N + 4) >> 2] = c[(E + 4) >> 2];
+                        c[(N + 8) >> 2] = c[(E + 8) >> 2];
+                        c[(N + 12) >> 2] = c[(E + 12) >> 2];
+                        k = (g + 1) | 0;
+                        if ((k | 0) >= (c[o >> 2] | 0)) {
+                          Q = 48;
+                          break;
+                        }
+                        S = ((c[j >> 2] | 0) + (k << 4)) | 0;
+                        k = ((c[n >> 2] | 0) + (k << 4)) | 0;
+                        T = c[((c[A >> 2] | 0) + 116) >> 2] & 1;
+                        c[C >> 2] = c[k >> 2];
+                        c[(C + 4) >> 2] = c[(k + 4) >> 2];
+                        c[(C + 8) >> 2] = c[(k + 8) >> 2];
+                        c[(C + 12) >> 2] = c[(k + 12) >> 2];
+                        c[D >> 2] = c[K >> 2];
+                        c[(D + 4) >> 2] = c[(K + 4) >> 2];
+                        c[(D + 8) >> 2] = c[(K + 8) >> 2];
+                        c[(D + 12) >> 2] = c[(K + 12) >> 2];
+                        _g(F, C, D, T);
+                        c[S >> 2] = c[F >> 2];
+                        c[(S + 4) >> 2] = c[(F + 4) >> 2];
+                        c[(S + 8) >> 2] = c[(F + 8) >> 2];
+                        c[(S + 12) >> 2] = c[(F + 12) >> 2];
+                        c[i >> 2] = c[F >> 2];
+                        c[(i + 4) >> 2] = c[(F + 4) >> 2];
+                        c[(i + 8) >> 2] = c[(F + 8) >> 2];
+                        c[(i + 12) >> 2] = c[(F + 12) >> 2];
+                        S = (g + 2) | 0;
+                        T = ((c[j >> 2] | 0) + (S << 4)) | 0;
+                        S = ((c[n >> 2] | 0) + (S << 4)) | 0;
+                        k = c[((c[A >> 2] | 0) + 116) >> 2] & 1;
+                        c[C >> 2] = c[S >> 2];
+                        c[(C + 4) >> 2] = c[(S + 4) >> 2];
+                        c[(C + 8) >> 2] = c[(S + 8) >> 2];
+                        c[(C + 12) >> 2] = c[(S + 12) >> 2];
+                        c[D >> 2] = c[K >> 2];
+                        c[(D + 4) >> 2] = c[(K + 4) >> 2];
+                        c[(D + 8) >> 2] = c[(K + 8) >> 2];
+                        c[(D + 12) >> 2] = c[(K + 12) >> 2];
+                        _g(G, C, D, k);
+                        c[T >> 2] = c[G >> 2];
+                        c[(T + 4) >> 2] = c[(G + 4) >> 2];
+                        c[(T + 8) >> 2] = c[(G + 8) >> 2];
+                        c[(T + 12) >> 2] = c[(G + 12) >> 2];
+                        c[t >> 2] = c[G >> 2];
+                        c[(t + 4) >> 2] = c[(G + 4) >> 2];
+                        c[(t + 8) >> 2] = c[(G + 8) >> 2];
+                        c[(t + 12) >> 2] = c[(G + 12) >> 2];
+                        T = (g + 3) | 0;
+                        k = ((c[n >> 2] | 0) + (T << 4)) | 0;
+                        S = c[((c[A >> 2] | 0) + 116) >> 2] & 1;
+                        c[C >> 2] = c[k >> 2];
+                        c[(C + 4) >> 2] = c[(k + 4) >> 2];
+                        c[(C + 8) >> 2] = c[(k + 8) >> 2];
+                        c[(C + 12) >> 2] = c[(k + 12) >> 2];
+                        c[D >> 2] = c[K >> 2];
+                        c[(D + 4) >> 2] = c[(K + 4) >> 2];
+                        c[(D + 8) >> 2] = c[(K + 8) >> 2];
+                        c[(D + 12) >> 2] = c[(K + 12) >> 2];
+                        _g(H, C, D, S);
+                        c[u >> 2] = c[H >> 2];
+                        c[(u + 4) >> 2] = c[(H + 4) >> 2];
+                        c[(u + 8) >> 2] = c[(H + 8) >> 2];
+                        c[(u + 12) >> 2] = c[(H + 12) >> 2];
+                        lI(((c[A >> 2] | 0) + 16) | 0, N);
+                        g = T;
+                      }
+                      if ((Q | 0) == 48) Q = 0;
+                      g = c[((c[q >> 2] | 0) + 96) >> 2] | 0;
+                      if (g | 0) {
+                        T = (g + 56) | 0;
+                        p = ((c[((c[p >> 2] | 0) + 96) >> 2] | 0) + 56) | 0;
+                        S = c[((c[A >> 2] | 0) + 116) >> 2] & 1;
+                        c[C >> 2] = c[p >> 2];
+                        c[(C + 4) >> 2] = c[(p + 4) >> 2];
+                        c[(C + 8) >> 2] = c[(p + 8) >> 2];
+                        c[(C + 12) >> 2] = c[(p + 12) >> 2];
+                        c[D >> 2] = c[K >> 2];
+                        c[(D + 4) >> 2] = c[(K + 4) >> 2];
+                        c[(D + 8) >> 2] = c[(K + 8) >> 2];
+                        c[(D + 12) >> 2] = c[(K + 12) >> 2];
+                        _g(I, C, D, S);
+                        c[T >> 2] = c[I >> 2];
+                        c[(T + 4) >> 2] = c[(I + 4) >> 2];
+                        c[(T + 8) >> 2] = c[(I + 8) >> 2];
+                        c[(T + 12) >> 2] = c[(I + 12) >> 2];
+                        T = c[((c[q >> 2] | 0) + 96) >> 2] | 0;
+                        a[(T + 81) >> 0] = 1;
+                        zP(b, T);
+                      }
+                    }
+                    r = (r + 1) | 0;
+                  }
+                  $g(z, y);
+                } else Q = 3;
+              while (0);
+              if ((Q | 0) == 3 ? (c[46738] | 0) == 0 : 0) {
+                c[46738] = 1;
+                gA(0, 85355, O) | 0;
+                Q = KB(J) | 0;
+                S = (xB(b) | 0) != 0;
+                T = KB(B) | 0;
+                c[P >> 2] = Q;
+                c[(P + 4) >> 2] = S ? 137738 : 141747;
+                c[(P + 8) >> 2] = T;
+                gA(3, 85461, P) | 0;
+              }
+              l = R;
+              return;
+            }
+            function Qg(b, d, e, f, g) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0.0,
+                B = 0.0,
+                C = 0.0,
+                D = 0.0,
+                E = 0.0;
+              z = l;
+              l = (l + 1600) | 0;
+              u = (z + 1552) | 0;
+              n = (z + 1536) | 0;
+              t = (z + 840) | 0;
+              v = (z + 144) | 0;
+              w = (z + 1584) | 0;
+              j = (z + 32) | 0;
+              s = (z + 16) | 0;
+              o = z;
+              q = c[f >> 2] & 3;
+              p = c[(((q | 0) == 3 ? f : (f + 48) | 0) + 40) >> 2] | 0;
+              x = (f + -48) | 0;
+              q = c[(((q | 0) == 2 ? f : x) + 40) >> 2] | 0;
+              r = (f + 16) | 0;
+              k = c[r >> 2] | 0;
+              i = c[(k + 172) >> 2] | 0;
+              while (1) {
+                m = c[((c[(i + 16) >> 2] | 0) + 172) >> 2] | 0;
+                if (!m) break;
+                else i = m;
+              }
+              k = ((c[(k + 96) >> 2] | 0) + 56) | 0;
+              i = ((c[((((c[i >> 2] & 3) | 0) == 3 ? i : (i + 48) | 0) + 40) >> 2] | 0) + 16) | 0;
+              m = ((c[i >> 2] | 0) + 16) | 0;
+              c[k >> 2] = c[m >> 2];
+              c[(k + 4) >> 2] = c[(m + 4) >> 2];
+              c[(k + 8) >> 2] = c[(m + 8) >> 2];
+              c[(k + 12) >> 2] = c[(m + 12) >> 2];
+              k = c[r >> 2] | 0;
+              a[((c[(k + 96) >> 2] | 0) + 81) >> 0] = 1;
+              if ((g | 0) != 2) {
+                k = c[i >> 2] | 0;
+                C = +h[(k + 16) >> 3];
+                E = C - +h[(k + 88) >> 3];
+                C = +h[(k + 96) >> 3] + C;
+                B = +h[(k + 24) >> 3];
+                D = +h[(k + 80) >> 3] * 0.5 + B;
+                k = c[((c[(b + 16) >> 2] | 0) + 196) >> 2] | 0;
+                m = c[(p + 16) >> 2] | 0;
+                j = c[(m + 232) >> 2] | 0;
+                B = +(
+                  ~~(
+                    +(~~(B - +h[(k + (j << 6) + 16) >> 3] - +h[(m + 24) >> 3] + +h[(k + (j << 6) + 24) >> 3]) | 0) *
+                    0.16666666666666666
+                  ) | 0
+                );
+                B = D - (B < 5.0 ? 5.0 : B);
+                Tg(b, d, e, p, f, t, 1);
+                Tg(b, d, e, q, f, v, 0);
+                j = (t + 52) | 0;
+                k = c[j >> 2] | 0;
+                m = (k + -1) | 0;
+                A = +h[(t + 56 + (m << 5)) >> 3];
+                h[19215] = A;
+                h[19216] = +h[(t + 56 + (m << 5) + 24) >> 3];
+                h[19217] = E;
+                h[19218] = B;
+                h[19219] = A;
+                h[19220] = B;
+                m = (v + 52) | 0;
+                i = ((c[m >> 2] | 0) + -1) | 0;
+                A = +h[(v + 56 + (i << 5) + 16) >> 3];
+                h[19221] = A;
+                h[19222] = D;
+                h[19223] = C;
+                h[19226] = B;
+                h[19224] = +h[(v + 56 + (i << 5) + 24) >> 3];
+                h[19225] = A;
+                i = 0;
+                while (1) {
+                  if ((i | 0) >= (k | 0)) {
+                    i = 0;
+                    break;
+                  }
+                  k = (t + 56 + (i << 5)) | 0;
+                  c[u >> 2] = c[k >> 2];
+                  c[(u + 4) >> 2] = c[(k + 4) >> 2];
+                  c[(u + 8) >> 2] = c[(k + 8) >> 2];
+                  c[(u + 12) >> 2] = c[(k + 12) >> 2];
+                  c[(u + 16) >> 2] = c[(k + 16) >> 2];
+                  c[(u + 20) >> 2] = c[(k + 20) >> 2];
+                  c[(u + 24) >> 2] = c[(k + 24) >> 2];
+                  c[(u + 28) >> 2] = c[(k + 28) >> 2];
+                  fO(e, u);
+                  i = (i + 1) | 0;
+                  k = c[j >> 2] | 0;
+                }
+                while (1) {
+                  if ((i | 0) == 3) break;
+                  t = (153720 + (i << 5)) | 0;
+                  c[u >> 2] = c[t >> 2];
+                  c[(u + 4) >> 2] = c[(t + 4) >> 2];
+                  c[(u + 8) >> 2] = c[(t + 8) >> 2];
+                  c[(u + 12) >> 2] = c[(t + 12) >> 2];
+                  c[(u + 16) >> 2] = c[(t + 16) >> 2];
+                  c[(u + 20) >> 2] = c[(t + 20) >> 2];
+                  c[(u + 24) >> 2] = c[(t + 24) >> 2];
+                  c[(u + 28) >> 2] = c[(t + 28) >> 2];
+                  fO(e, u);
+                  i = (i + 1) | 0;
+                }
+                j = c[m >> 2] | 0;
+                while (1) {
+                  i = (j + -1) | 0;
+                  if ((j | 0) <= 0) break;
+                  j = (v + 56 + (i << 5)) | 0;
+                  c[u >> 2] = c[j >> 2];
+                  c[(u + 4) >> 2] = c[(j + 4) >> 2];
+                  c[(u + 8) >> 2] = c[(j + 8) >> 2];
+                  c[(u + 12) >> 2] = c[(j + 12) >> 2];
+                  c[(u + 16) >> 2] = c[(j + 16) >> 2];
+                  c[(u + 20) >> 2] = c[(j + 20) >> 2];
+                  c[(u + 24) >> 2] = c[(j + 24) >> 2];
+                  c[(u + 28) >> 2] = c[(j + 28) >> 2];
+                  fO(e, u);
+                  j = i;
+                }
+                if ((g | 0) == 10) j = HM(e, w) | 0;
+                else j = NM(e, w) | 0;
+                i = c[w >> 2] | 0;
+                if (i | 0) y = 17;
+              } else {
+                i = ((c[(p + 16) >> 2] | 0) + 16) | 0;
+                v = (k + 16) | 0;
+                c[n >> 2] = c[i >> 2];
+                c[(n + 4) >> 2] = c[(i + 4) >> 2];
+                c[(n + 8) >> 2] = c[(i + 8) >> 2];
+                c[(n + 12) >> 2] = c[(i + 12) >> 2];
+                c[u >> 2] = c[v >> 2];
+                c[(u + 4) >> 2] = c[(v + 4) >> 2];
+                c[(u + 8) >> 2] = c[(v + 8) >> 2];
+                c[(u + 12) >> 2] = c[(v + 12) >> 2];
+                Ng(s, n, u);
+                v = ((c[(q + 16) >> 2] | 0) + 16) | 0;
+                i = ((c[r >> 2] | 0) + 56) | 0;
+                c[n >> 2] = c[v >> 2];
+                c[(n + 4) >> 2] = c[(v + 4) >> 2];
+                c[(n + 8) >> 2] = c[(v + 8) >> 2];
+                c[(n + 12) >> 2] = c[(v + 12) >> 2];
+                c[u >> 2] = c[i >> 2];
+                c[(u + 4) >> 2] = c[(i + 4) >> 2];
+                c[(u + 8) >> 2] = c[(i + 8) >> 2];
+                c[(u + 12) >> 2] = c[(i + 12) >> 2];
+                Ng(o, n, u);
+                i = c[((c[r >> 2] | 0) + 96) >> 2] | 0;
+                D = +h[(i + 56) >> 3];
+                E = +h[(i + 64) >> 3] - +h[(i + 32) >> 3] * 0.5;
+                i = (j + 16) | 0;
+                c[j >> 2] = c[s >> 2];
+                c[(j + 4) >> 2] = c[(s + 4) >> 2];
+                c[(j + 8) >> 2] = c[(s + 8) >> 2];
+                c[(j + 12) >> 2] = c[(s + 12) >> 2];
+                c[i >> 2] = c[s >> 2];
+                c[(i + 4) >> 2] = c[(s + 4) >> 2];
+                c[(i + 8) >> 2] = c[(s + 8) >> 2];
+                c[(i + 12) >> 2] = c[(s + 12) >> 2];
+                i = (j + 32) | 0;
+                v = (j + 48) | 0;
+                y = (j + 64) | 0;
+                h[(j + 64) >> 3] = D;
+                h[(j + 72) >> 3] = E;
+                c[v >> 2] = c[y >> 2];
+                c[(v + 4) >> 2] = c[(y + 4) >> 2];
+                c[(v + 8) >> 2] = c[(y + 8) >> 2];
+                c[(v + 12) >> 2] = c[(y + 12) >> 2];
+                c[i >> 2] = c[y >> 2];
+                c[(i + 4) >> 2] = c[(y + 4) >> 2];
+                c[(i + 8) >> 2] = c[(y + 8) >> 2];
+                c[(i + 12) >> 2] = c[(y + 12) >> 2];
+                i = (j + 80) | 0;
+                y = (j + 96) | 0;
+                c[y >> 2] = c[o >> 2];
+                c[(y + 4) >> 2] = c[(o + 4) >> 2];
+                c[(y + 8) >> 2] = c[(o + 8) >> 2];
+                c[(y + 12) >> 2] = c[(o + 12) >> 2];
+                c[i >> 2] = c[o >> 2];
+                c[(i + 4) >> 2] = c[(o + 4) >> 2];
+                c[(i + 8) >> 2] = c[(o + 8) >> 2];
+                c[(i + 12) >> 2] = c[(o + 12) >> 2];
+                c[w >> 2] = 7;
+                i = 7;
+                y = 17;
+              }
+              if ((y | 0) == 17) dO(f, c[((((c[f >> 2] & 3) | 0) == 2 ? f : x) + 40) >> 2] | 0, j, i, 17296);
+              l = z;
+              return;
+            }
+            function Rg(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0.0,
+                s = 0,
+                t = 0.0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0.0,
+                A = 0.0,
+                B = 0.0,
+                C = 0.0,
+                D = 0.0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0;
+              N = l;
+              l = (l + 352) | 0;
+              x = (N + 336) | 0;
+              w = (N + 320) | 0;
+              L = (N + 128) | 0;
+              u = (N + 304) | 0;
+              y = (N + 288) | 0;
+              M = (N + 112) | 0;
+              E = (N + 96) | 0;
+              F = (N + 80) | 0;
+              G = (N + 64) | 0;
+              H = (N + 48) | 0;
+              I = (N + 32) | 0;
+              J = (N + 16) | 0;
+              K = N;
+              a = (a + 16) | 0;
+              q = ((c[a >> 2] | 0) + 16) | 0;
+              v = ((c[(d + (e << 2)) >> 2] | 0) + 16) | 0;
+              s = ((c[v >> 2] | 0) + 16) | 0;
+              c[w >> 2] = c[q >> 2];
+              c[(w + 4) >> 2] = c[(q + 4) >> 2];
+              c[(w + 8) >> 2] = c[(q + 8) >> 2];
+              c[(w + 12) >> 2] = c[(q + 12) >> 2];
+              c[x >> 2] = c[s >> 2];
+              c[(x + 4) >> 2] = c[(s + 4) >> 2];
+              c[(x + 8) >> 2] = c[(s + 8) >> 2];
+              c[(x + 12) >> 2] = c[(s + 12) >> 2];
+              Ng(u, w, x);
+              C = +h[u >> 3];
+              D = +h[(u + 8) >> 3];
+              u = ((c[(b + 16) >> 2] | 0) + 16) | 0;
+              v = ((c[v >> 2] | 0) + 56) | 0;
+              c[w >> 2] = c[u >> 2];
+              c[(w + 4) >> 2] = c[(u + 4) >> 2];
+              c[(w + 8) >> 2] = c[(u + 8) >> 2];
+              c[(w + 12) >> 2] = c[(u + 12) >> 2];
+              c[x >> 2] = c[v >> 2];
+              c[(x + 4) >> 2] = c[(v + 4) >> 2];
+              c[(x + 8) >> 2] = c[(v + 8) >> 2];
+              c[(x + 12) >> 2] = c[(v + 12) >> 2];
+              Ng(y, w, x);
+              A = +h[y >> 3];
+              B = +h[(y + 8) >> 3];
+              if ((f | 0) > 1) {
+                z = +h[((c[a >> 2] | 0) + 80) >> 3];
+                i = z * 0.5;
+                z = z / +((f + -1) | 0);
+              } else {
+                i = 0.0;
+                z = 0.0;
+              }
+              p = (g | 8 | 0) == 10;
+              m = (L + 8) | 0;
+              q = (L + 16) | 0;
+              r = (A + C * 2.0) * 0.3333333333333333;
+              s = (L + 32) | 0;
+              t = (A * 2.0 + C) * 0.3333333333333333;
+              n = (L + 24) | 0;
+              u = (L + 48) | 0;
+              v = (L + 64) | 0;
+              w = (L + 80) | 0;
+              x = (L + 96) | 0;
+              y = (L + 112) | 0;
+              k = (L + 128) | 0;
+              o = (L + 136) | 0;
+              i = D - i;
+              b = 0;
+              while (1) {
+                if ((b | 0) >= (f | 0)) break;
+                j = c[(d + ((b + e) << 2)) >> 2] | 0;
+                h[L >> 3] = C;
+                h[m >> 3] = D;
+                if (p) {
+                  Vg(M, r, i);
+                  c[q >> 2] = c[M >> 2];
+                  c[(q + 4) >> 2] = c[(M + 4) >> 2];
+                  c[(q + 8) >> 2] = c[(M + 8) >> 2];
+                  c[(q + 12) >> 2] = c[(M + 12) >> 2];
+                  Vg(E, t, i);
+                  c[s >> 2] = c[E >> 2];
+                  c[(s + 4) >> 2] = c[(E + 4) >> 2];
+                  c[(s + 8) >> 2] = c[(E + 8) >> 2];
+                  c[(s + 12) >> 2] = c[(E + 12) >> 2];
+                  a = 4;
+                  g = 3;
+                } else {
+                  h[q >> 3] = C;
+                  h[n >> 3] = D;
+                  Vg(F, r, i);
+                  c[s >> 2] = c[F >> 2];
+                  c[(s + 4) >> 2] = c[(F + 4) >> 2];
+                  c[(s + 8) >> 2] = c[(F + 8) >> 2];
+                  c[(s + 12) >> 2] = c[(F + 12) >> 2];
+                  Vg(G, r, i);
+                  c[u >> 2] = c[G >> 2];
+                  c[(u + 4) >> 2] = c[(G + 4) >> 2];
+                  c[(u + 8) >> 2] = c[(G + 8) >> 2];
+                  c[(u + 12) >> 2] = c[(G + 12) >> 2];
+                  Vg(H, r, i);
+                  c[v >> 2] = c[H >> 2];
+                  c[(v + 4) >> 2] = c[(H + 4) >> 2];
+                  c[(v + 8) >> 2] = c[(H + 8) >> 2];
+                  c[(v + 12) >> 2] = c[(H + 12) >> 2];
+                  Vg(I, t, i);
+                  c[w >> 2] = c[I >> 2];
+                  c[(w + 4) >> 2] = c[(I + 4) >> 2];
+                  c[(w + 8) >> 2] = c[(I + 8) >> 2];
+                  c[(w + 12) >> 2] = c[(I + 12) >> 2];
+                  Vg(J, t, i);
+                  c[x >> 2] = c[J >> 2];
+                  c[(x + 4) >> 2] = c[(J + 4) >> 2];
+                  c[(x + 8) >> 2] = c[(J + 8) >> 2];
+                  c[(x + 12) >> 2] = c[(J + 12) >> 2];
+                  Vg(K, t, i);
+                  c[y >> 2] = c[K >> 2];
+                  c[(y + 4) >> 2] = c[(K + 4) >> 2];
+                  c[(y + 8) >> 2] = c[(K + 8) >> 2];
+                  c[(y + 12) >> 2] = c[(K + 12) >> 2];
+                  h[k >> 3] = A;
+                  h[o >> 3] = B;
+                  a = 10;
+                  g = 9;
+                }
+                h[(L + (g << 4)) >> 3] = A;
+                h[(L + (g << 4) + 8) >> 3] = B;
+                dO(j, c[((((c[j >> 2] & 3) | 0) == 2 ? j : (j + -48) | 0) + 40) >> 2] | 0, L, a, 17296);
+                i = i + z;
+                b = (b + 1) | 0;
+              }
+              l = N;
+              return;
+            }
+            function Sg(a, d, e, f, g, i, j, k) {
+              a = a | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              j = j | 0;
+              k = k | 0;
+              var m = 0,
+                n = 0.0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0.0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0.0,
+                A = 0.0,
+                B = 0.0,
+                C = 0.0,
+                D = 0.0;
+              x = l;
+              l = (l + 1440) | 0;
+              t = (x + 1392) | 0;
+              v = (x + 1424) | 0;
+              w = (x + 696) | 0;
+              u = x;
+              r = c[j >> 2] & 3;
+              q = c[(((r | 0) == 3 ? j : (j + 48) | 0) + 40) >> 2] | 0;
+              r = c[(((r | 0) == 2 ? j : (j + -48) | 0) + 40) >> 2] | 0;
+              m = c[(q + 16) >> 2] | 0;
+              o = c[(m + 232) >> 2] | 0;
+              p = c[(a + 16) >> 2] | 0;
+              if ((o | 0) < (b[(p + 238) >> 1] | 0)) {
+                y = c[(p + 196) >> 2] | 0;
+                p = (o + 1) | 0;
+                n =
+                  +h[(m + 24) >> 3] -
+                  +h[(y + (o << 6) + 32) >> 3] -
+                  +h[((c[((c[c[(y + (p << 6) + 4) >> 2] >> 2] | 0) + 16) >> 2] | 0) + 24) >> 3] -
+                  +h[(y + (p << 6) + 40) >> 3];
+              } else n = +(c[(p + 252) >> 2] | 0);
+              z = +((i + 1) | 0);
+              s = +(c[(d + 12) >> 2] | 0) / z;
+              n = n / z;
+              Ug(a, d, e, q, j, w, 1);
+              Ug(a, d, e, r, j, u, 0);
+              r = (w + 52) | 0;
+              j = (u + 52) | 0;
+              a = (k | 0) == 0;
+              d = (e + 80) | 0;
+              m = 0;
+              while (1) {
+                if ((m | 0) >= (i | 0)) break;
+                q = c[(f + ((m + g) << 2)) >> 2] | 0;
+                p = c[r >> 2] | 0;
+                o = (p + -1) | 0;
+                D = +h[(w + 56 + (o << 5)) >> 3];
+                B = +h[(w + 56 + (o << 5) + 8) >> 3];
+                C = +h[(w + 56 + (o << 5) + 16) >> 3];
+                h[19215] = D;
+                h[19218] = B;
+                m = (m + 1) | 0;
+                z = +(m | 0);
+                A = s * z;
+                h[19217] = C + A;
+                z = B - n * z;
+                h[19216] = z;
+                h[19219] = D;
+                h[19222] = z;
+                o = ((c[j >> 2] | 0) + -1) | 0;
+                D = +h[(u + 56 + (o << 5) + 16) >> 3];
+                h[19221] = D;
+                h[19220] = z - n;
+                B = +h[(u + 56 + (o << 5)) >> 3];
+                C = +h[(u + 56 + (o << 5) + 8) >> 3];
+                h[19225] = D;
+                h[19226] = C;
+                h[19223] = B - A;
+                h[19224] = z;
+                o = 0;
+                while (1) {
+                  if ((o | 0) >= (p | 0)) {
+                    o = 0;
+                    break;
+                  }
+                  p = (w + 56 + (o << 5)) | 0;
+                  c[t >> 2] = c[p >> 2];
+                  c[(t + 4) >> 2] = c[(p + 4) >> 2];
+                  c[(t + 8) >> 2] = c[(p + 8) >> 2];
+                  c[(t + 12) >> 2] = c[(p + 12) >> 2];
+                  c[(t + 16) >> 2] = c[(p + 16) >> 2];
+                  c[(t + 20) >> 2] = c[(p + 20) >> 2];
+                  c[(t + 24) >> 2] = c[(p + 24) >> 2];
+                  c[(t + 28) >> 2] = c[(p + 28) >> 2];
+                  fO(e, t);
+                  o = (o + 1) | 0;
+                  p = c[r >> 2] | 0;
+                }
+                while (1) {
+                  if ((o | 0) == 3) break;
+                  y = (153720 + (o << 5)) | 0;
+                  c[t >> 2] = c[y >> 2];
+                  c[(t + 4) >> 2] = c[(y + 4) >> 2];
+                  c[(t + 8) >> 2] = c[(y + 8) >> 2];
+                  c[(t + 12) >> 2] = c[(y + 12) >> 2];
+                  c[(t + 16) >> 2] = c[(y + 16) >> 2];
+                  c[(t + 20) >> 2] = c[(y + 20) >> 2];
+                  c[(t + 24) >> 2] = c[(y + 24) >> 2];
+                  c[(t + 28) >> 2] = c[(y + 28) >> 2];
+                  fO(e, t);
+                  o = (o + 1) | 0;
+                }
+                p = c[j >> 2] | 0;
+                while (1) {
+                  o = (p + -1) | 0;
+                  if ((p | 0) <= 0) break;
+                  p = (u + 56 + (o << 5)) | 0;
+                  c[t >> 2] = c[p >> 2];
+                  c[(t + 4) >> 2] = c[(p + 4) >> 2];
+                  c[(t + 8) >> 2] = c[(p + 8) >> 2];
+                  c[(t + 12) >> 2] = c[(p + 12) >> 2];
+                  c[(t + 16) >> 2] = c[(p + 16) >> 2];
+                  c[(t + 20) >> 2] = c[(p + 20) >> 2];
+                  c[(t + 24) >> 2] = c[(p + 24) >> 2];
+                  c[(t + 28) >> 2] = c[(p + 28) >> 2];
+                  fO(e, t);
+                  p = o;
+                }
+                if (a) o = NM(e, v) | 0;
+                else o = HM(e, v) | 0;
+                p = c[v >> 2] | 0;
+                if (!p) break;
+                dO(q, c[((((c[q >> 2] & 3) | 0) == 2 ? q : (q + -48) | 0) + 40) >> 2] | 0, o, p, 17296);
+                c[d >> 2] = 0;
+              }
+              l = x;
+              return;
+            }
+            function Tg(a, b, d, e, f, g, i) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              var j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0.0;
+              n = l;
+              l = (l + 128) | 0;
+              j = (n + 96) | 0;
+              k = (n + 64) | 0;
+              o = (n + 32) | 0;
+              m = n;
+              wg(o, a, b, e, 0, f);
+              c[g >> 2] = c[o >> 2];
+              c[(g + 4) >> 2] = c[(o + 4) >> 2];
+              c[(g + 8) >> 2] = c[(o + 8) >> 2];
+              c[(g + 12) >> 2] = c[(o + 12) >> 2];
+              c[(g + 16) >> 2] = c[(o + 16) >> 2];
+              c[(g + 20) >> 2] = c[(o + 20) >> 2];
+              c[(g + 24) >> 2] = c[(o + 24) >> 2];
+              c[(g + 28) >> 2] = c[(o + 28) >> 2];
+              c[k >> 2] = c[o >> 2];
+              c[(k + 4) >> 2] = c[(o + 4) >> 2];
+              c[(k + 8) >> 2] = c[(o + 8) >> 2];
+              c[(k + 12) >> 2] = c[(o + 12) >> 2];
+              c[(k + 16) >> 2] = c[(o + 16) >> 2];
+              c[(k + 20) >> 2] = c[(o + 20) >> 2];
+              c[(k + 24) >> 2] = c[(o + 24) >> 2];
+              c[(k + 28) >> 2] = c[(o + 28) >> 2];
+              c[(g + 48) >> 2] = 4;
+              if (!((i << 24) >> 24)) jO(d, f, 2, g, 0);
+              else gO(d, f, 2, g, 0);
+              b = (g + 52) | 0;
+              f = ((c[b >> 2] | 0) + -1) | 0;
+              o = (k + 24) | 0;
+              h[o >> 3] = +h[(g + 56 + (f << 5) + 24) >> 3];
+              i = (k + 8) | 0;
+              h[i >> 3] = +h[(g + 56 + (f << 5) + 8) >> 3];
+              e = c[(e + 16) >> 2] | 0;
+              p =
+                +h[((c[((c[(a + 16) >> 2] | 0) + 196) >> 2] | 0) + (c[(e + 232) >> 2] << 6) + 24) >> 3] +
+                +h[(e + 24) >> 3];
+              c[j >> 2] = c[k >> 2];
+              c[(j + 4) >> 2] = c[(k + 4) >> 2];
+              c[(j + 8) >> 2] = c[(k + 8) >> 2];
+              c[(j + 12) >> 2] = c[(k + 12) >> 2];
+              c[(j + 16) >> 2] = c[(k + 16) >> 2];
+              c[(j + 20) >> 2] = c[(k + 20) >> 2];
+              c[(j + 24) >> 2] = c[(k + 24) >> 2];
+              c[(j + 28) >> 2] = c[(k + 28) >> 2];
+              yg(m, j, 4, p);
+              c[k >> 2] = c[m >> 2];
+              c[(k + 4) >> 2] = c[(m + 4) >> 2];
+              c[(k + 8) >> 2] = c[(m + 8) >> 2];
+              c[(k + 12) >> 2] = c[(m + 12) >> 2];
+              c[(k + 16) >> 2] = c[(m + 16) >> 2];
+              c[(k + 20) >> 2] = c[(m + 20) >> 2];
+              c[(k + 24) >> 2] = c[(m + 24) >> 2];
+              c[(k + 28) >> 2] = c[(m + 28) >> 2];
+              if (+h[k >> 3] < +h[(k + 16) >> 3] ? +h[i >> 3] < +h[o >> 3] : 0) {
+                o = c[b >> 2] | 0;
+                c[b >> 2] = o + 1;
+                o = (g + 56 + (o << 5)) | 0;
+                c[o >> 2] = c[k >> 2];
+                c[(o + 4) >> 2] = c[(k + 4) >> 2];
+                c[(o + 8) >> 2] = c[(k + 8) >> 2];
+                c[(o + 12) >> 2] = c[(k + 12) >> 2];
+                c[(o + 16) >> 2] = c[(k + 16) >> 2];
+                c[(o + 20) >> 2] = c[(k + 20) >> 2];
+                c[(o + 24) >> 2] = c[(k + 24) >> 2];
+                c[(o + 28) >> 2] = c[(k + 28) >> 2];
+              }
+              l = n;
+              return;
+            }
+            function Ug(a, b, d, e, f, g, i) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              var j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0.0;
+              n = l;
+              l = (l + 128) | 0;
+              j = (n + 96) | 0;
+              k = (n + 64) | 0;
+              o = (n + 32) | 0;
+              m = n;
+              wg(o, a, b, e, 0, f);
+              c[g >> 2] = c[o >> 2];
+              c[(g + 4) >> 2] = c[(o + 4) >> 2];
+              c[(g + 8) >> 2] = c[(o + 8) >> 2];
+              c[(g + 12) >> 2] = c[(o + 12) >> 2];
+              c[(g + 16) >> 2] = c[(o + 16) >> 2];
+              c[(g + 20) >> 2] = c[(o + 20) >> 2];
+              c[(g + 24) >> 2] = c[(o + 24) >> 2];
+              c[(g + 28) >> 2] = c[(o + 28) >> 2];
+              c[k >> 2] = c[o >> 2];
+              c[(k + 4) >> 2] = c[(o + 4) >> 2];
+              c[(k + 8) >> 2] = c[(o + 8) >> 2];
+              c[(k + 12) >> 2] = c[(o + 12) >> 2];
+              c[(k + 16) >> 2] = c[(o + 16) >> 2];
+              c[(k + 20) >> 2] = c[(o + 20) >> 2];
+              c[(k + 24) >> 2] = c[(o + 24) >> 2];
+              c[(k + 28) >> 2] = c[(o + 28) >> 2];
+              c[(g + 48) >> 2] = 1;
+              if (!((i << 24) >> 24)) jO(d, f, 2, g, 0);
+              else gO(d, f, 2, g, 0);
+              b = (g + 52) | 0;
+              f = ((c[b >> 2] | 0) + -1) | 0;
+              o = (k + 24) | 0;
+              h[o >> 3] = +h[(g + 56 + (f << 5) + 24) >> 3];
+              i = (k + 8) | 0;
+              h[i >> 3] = +h[(g + 56 + (f << 5) + 8) >> 3];
+              e = c[(e + 16) >> 2] | 0;
+              p =
+                +h[(e + 24) >> 3] -
+                +h[((c[((c[(a + 16) >> 2] | 0) + 196) >> 2] | 0) + (c[(e + 232) >> 2] << 6) + 24) >> 3];
+              c[j >> 2] = c[k >> 2];
+              c[(j + 4) >> 2] = c[(k + 4) >> 2];
+              c[(j + 8) >> 2] = c[(k + 8) >> 2];
+              c[(j + 12) >> 2] = c[(k + 12) >> 2];
+              c[(j + 16) >> 2] = c[(k + 16) >> 2];
+              c[(j + 20) >> 2] = c[(k + 20) >> 2];
+              c[(j + 24) >> 2] = c[(k + 24) >> 2];
+              c[(j + 28) >> 2] = c[(k + 28) >> 2];
+              yg(m, j, 1, p);
+              c[k >> 2] = c[m >> 2];
+              c[(k + 4) >> 2] = c[(m + 4) >> 2];
+              c[(k + 8) >> 2] = c[(m + 8) >> 2];
+              c[(k + 12) >> 2] = c[(m + 12) >> 2];
+              c[(k + 16) >> 2] = c[(m + 16) >> 2];
+              c[(k + 20) >> 2] = c[(m + 20) >> 2];
+              c[(k + 24) >> 2] = c[(m + 24) >> 2];
+              c[(k + 28) >> 2] = c[(m + 28) >> 2];
+              if (+h[k >> 3] < +h[(k + 16) >> 3] ? +h[i >> 3] < +h[o >> 3] : 0) {
+                o = c[b >> 2] | 0;
+                c[b >> 2] = o + 1;
+                o = (g + 56 + (o << 5)) | 0;
+                c[o >> 2] = c[k >> 2];
+                c[(o + 4) >> 2] = c[(k + 4) >> 2];
+                c[(o + 8) >> 2] = c[(k + 8) >> 2];
+                c[(o + 12) >> 2] = c[(k + 12) >> 2];
+                c[(o + 16) >> 2] = c[(k + 16) >> 2];
+                c[(o + 20) >> 2] = c[(k + 20) >> 2];
+                c[(o + 24) >> 2] = c[(k + 24) >> 2];
+                c[(o + 28) >> 2] = c[(k + 28) >> 2];
+              }
+              l = n;
+              return;
+            }
+            function Vg(a, b, c) {
+              a = a | 0;
+              b = +b;
+              c = +c;
+              h[a >> 3] = b;
+              h[(a + 8) >> 3] = c;
+              return;
+            }
+            function Wg(b, d, e, f, g, i, j) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              j = j | 0;
+              var k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0.0,
+                q = 0.0,
+                r = 0.0,
+                s = 0.0,
+                t = 0.0,
+                u = 0.0,
+                v = 0.0,
+                w = 0.0,
+                x = 0.0,
+                y = 0,
+                z = 0,
+                A = 0.0,
+                B = 0.0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                O = 0,
+                P = 0,
+                Q = 0,
+                R = 0,
+                S = 0,
+                T = 0,
+                U = 0,
+                V = 0,
+                W = 0,
+                X = 0,
+                Y = 0,
+                Z = 0.0;
+              Y = l;
+              l = (l + 288) | 0;
+              R = (Y + 256) | 0;
+              Q = (Y + 240) | 0;
+              P = (Y + 224) | 0;
+              V = (Y + 280) | 0;
+              W = (Y + 272) | 0;
+              X = (Y + 32) | 0;
+              S = (Y + 16) | 0;
+              T = Y;
+              m = (Y + 208) | 0;
+              n = (Y + 192) | 0;
+              o = c[(e + (f << 2)) >> 2] | 0;
+              U = JK(g << 2) | 0;
+              k = 0;
+              while (1) {
+                if ((k | 0) >= (g | 0)) break;
+                c[(U + (k << 2)) >> 2] = c[(e + ((k + f) << 2)) >> 2];
+                k = (k + 1) | 0;
+              }
+              o4(U, g, 4, 59);
+              e = (b + 16) | 0;
+              f = ((c[e >> 2] | 0) + 16) | 0;
+              o = (o + 16) | 0;
+              C = ((c[o >> 2] | 0) + 16) | 0;
+              c[Q >> 2] = c[f >> 2];
+              c[(Q + 4) >> 2] = c[(f + 4) >> 2];
+              c[(Q + 8) >> 2] = c[(f + 8) >> 2];
+              c[(Q + 12) >> 2] = c[(f + 12) >> 2];
+              c[R >> 2] = c[C >> 2];
+              c[(R + 4) >> 2] = c[(C + 4) >> 2];
+              c[(R + 8) >> 2] = c[(C + 8) >> 2];
+              c[(R + 12) >> 2] = c[(C + 12) >> 2];
+              Ng(m, Q, R);
+              c[S >> 2] = c[m >> 2];
+              c[(S + 4) >> 2] = c[(m + 4) >> 2];
+              c[(S + 8) >> 2] = c[(m + 8) >> 2];
+              c[(S + 12) >> 2] = c[(m + 12) >> 2];
+              C = (d + 16) | 0;
+              f = ((c[C >> 2] | 0) + 16) | 0;
+              o = ((c[o >> 2] | 0) + 56) | 0;
+              c[Q >> 2] = c[f >> 2];
+              c[(Q + 4) >> 2] = c[(f + 4) >> 2];
+              c[(Q + 8) >> 2] = c[(f + 8) >> 2];
+              c[(Q + 12) >> 2] = c[(f + 12) >> 2];
+              c[R >> 2] = c[o >> 2];
+              c[(R + 4) >> 2] = c[(o + 4) >> 2];
+              c[(R + 8) >> 2] = c[(o + 8) >> 2];
+              c[(R + 12) >> 2] = c[(o + 12) >> 2];
+              Ng(n, Q, R);
+              c[T >> 2] = c[n >> 2];
+              c[(T + 4) >> 2] = c[(n + 4) >> 2];
+              c[(T + 8) >> 2] = c[(n + 8) >> 2];
+              c[(T + 12) >> 2] = c[(n + 12) >> 2];
+              w = +h[((c[e >> 2] | 0) + 96) >> 3] + +h[S >> 3];
+              x = +h[T >> 3] - +h[((c[C >> 2] | 0) + 88) >> 3];
+              u = x + w;
+              v = u * 0.5;
+              C = c[U >> 2] | 0;
+              c[X >> 2] = c[S >> 2];
+              c[(X + 4) >> 2] = c[(S + 4) >> 2];
+              c[(X + 8) >> 2] = c[(S + 8) >> 2];
+              c[(X + 12) >> 2] = c[(S + 12) >> 2];
+              o = (X + 16) | 0;
+              c[o >> 2] = c[S >> 2];
+              c[(o + 4) >> 2] = c[(S + 4) >> 2];
+              c[(o + 8) >> 2] = c[(S + 8) >> 2];
+              c[(o + 12) >> 2] = c[(S + 12) >> 2];
+              e = (X + 32) | 0;
+              c[e >> 2] = c[T >> 2];
+              c[(e + 4) >> 2] = c[(T + 4) >> 2];
+              c[(e + 8) >> 2] = c[(T + 8) >> 2];
+              c[(e + 12) >> 2] = c[(T + 12) >> 2];
+              f = (X + 48) | 0;
+              c[f >> 2] = c[T >> 2];
+              c[(f + 4) >> 2] = c[(T + 4) >> 2];
+              c[(f + 8) >> 2] = c[(T + 8) >> 2];
+              c[(f + 12) >> 2] = c[(T + 12) >> 2];
+              dO(C, c[((((c[C >> 2] & 3) | 0) == 2 ? C : (C + -48) | 0) + 40) >> 2] | 0, X, 4, 17296);
+              C = c[((c[(C + 16) >> 2] | 0) + 96) >> 2] | 0;
+              h[(C + 56) >> 3] = v;
+              z = (S + 8) | 0;
+              r = +h[z >> 3];
+              s = +h[(C + 32) >> 3];
+              h[(C + 64) >> 3] = (s + 6.0) * 0.5 + r;
+              a[(C + 81) >> 0] = 1;
+              r = r + 3.0;
+              B = +h[(C + 24) >> 3];
+              A = (u - B) * 0.5;
+              B = (B + u) * 0.5;
+              C = (X + 24) | 0;
+              D = (X + 40) | 0;
+              E = (X + 56) | 0;
+              F = (X + 64) | 0;
+              G = (T + 8) | 0;
+              H = (X + 72) | 0;
+              I = (X + 80) | 0;
+              J = (X + 88) | 0;
+              K = (X + 96) | 0;
+              L = (X + 104) | 0;
+              M = (X + 112) | 0;
+              N = (X + 120) | 0;
+              O = (V + 4) | 0;
+              n = ((i | 0) == 6) & 1;
+              q = 0.0;
+              p = 0.0;
+              s = s + r;
+              m = 1;
+              while (1) {
+                if ((m | 0) >= (j | 0)) {
+                  y = 6;
+                  break;
+                }
+                d = c[(U + (m << 2)) >> 2] | 0;
+                if (!(m & 1)) {
+                  c[X >> 2] = c[S >> 2];
+                  c[(X + 4) >> 2] = c[(S + 4) >> 2];
+                  c[(X + 8) >> 2] = c[(S + 8) >> 2];
+                  c[(X + 12) >> 2] = c[(S + 12) >> 2];
+                  h[o >> 3] = A;
+                  h[C >> 3] = +h[z >> 3];
+                  h[e >> 3] = A;
+                  h[D >> 3] = s;
+                  h[f >> 3] = B;
+                  h[E >> 3] = s;
+                  h[F >> 3] = B;
+                  t = +h[G >> 3];
+                  h[H >> 3] = t;
+                  Z = +h[T >> 3];
+                  h[I >> 3] = Z;
+                  h[J >> 3] = t;
+                  h[K >> 3] = Z;
+                  Z = s + 6.0;
+                  h[L >> 3] = Z;
+                  h[M >> 3] = +h[S >> 3];
+                  h[N >> 3] = Z;
+                  s = +h[((c[((c[(d + 16) >> 2] | 0) + 96) >> 2] | 0) + 32) >> 3];
+                  t = Z + s * 0.5;
+                  s = Z + s;
+                } else {
+                  k = (d + 16) | 0;
+                  b = c[((c[k >> 2] | 0) + 96) >> 2] | 0;
+                  if ((m | 0) == 1) {
+                    p = +h[(b + 24) >> 3];
+                    q = (p + u) * 0.5;
+                    p = (u - p) * 0.5;
+                  }
+                  r = r + -6.0 - +h[(b + 32) >> 3];
+                  c[X >> 2] = c[S >> 2];
+                  c[(X + 4) >> 2] = c[(S + 4) >> 2];
+                  c[(X + 8) >> 2] = c[(S + 8) >> 2];
+                  c[(X + 12) >> 2] = c[(S + 12) >> 2];
+                  h[o >> 3] = +h[S >> 3];
+                  t = r + -6.0;
+                  h[C >> 3] = t;
+                  h[e >> 3] = +h[T >> 3];
+                  h[D >> 3] = t;
+                  c[f >> 2] = c[T >> 2];
+                  c[(f + 4) >> 2] = c[(T + 4) >> 2];
+                  c[(f + 8) >> 2] = c[(T + 8) >> 2];
+                  c[(f + 12) >> 2] = c[(T + 12) >> 2];
+                  h[F >> 3] = q;
+                  h[H >> 3] = +h[G >> 3];
+                  h[I >> 3] = q;
+                  h[J >> 3] = r;
+                  h[K >> 3] = p;
+                  h[L >> 3] = r;
+                  h[M >> 3] = p;
+                  h[N >> 3] = +h[z >> 3];
+                  t = +h[((c[((c[k >> 2] | 0) + 96) >> 2] | 0) + 32) >> 3] * 0.5 + r;
+                }
+                c[O >> 2] = 8;
+                c[V >> 2] = X;
+                c[P >> 2] = c[S >> 2];
+                c[(P + 4) >> 2] = c[(S + 4) >> 2];
+                c[(P + 8) >> 2] = c[(S + 8) >> 2];
+                c[(P + 12) >> 2] = c[(S + 12) >> 2];
+                c[Q >> 2] = c[T >> 2];
+                c[(Q + 4) >> 2] = c[(T + 4) >> 2];
+                c[(Q + 8) >> 2] = c[(T + 8) >> 2];
+                c[(Q + 12) >> 2] = c[(T + 12) >> 2];
+                c[R >> 2] = c[V >> 2];
+                c[(R + 4) >> 2] = c[(V + 4) >> 2];
+                k = DM(P, Q, R, W, n) | 0;
+                b = c[W >> 2] | 0;
+                if (!b) break;
+                i = c[((c[(d + 16) >> 2] | 0) + 96) >> 2] | 0;
+                h[(i + 56) >> 3] = v;
+                h[(i + 64) >> 3] = t;
+                a[(i + 81) >> 0] = 1;
+                dO(d, c[((((c[d >> 2] & 3) | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0, k, b, 17296);
+                m = (m + 1) | 0;
+              }
+              a: do
+                if ((y | 0) == 6) {
+                  v = (x + w * 2.0) * 0.3333333333333333;
+                  u = (x * 2.0 + w) * 0.3333333333333333;
+                  while (1) {
+                    if ((m | 0) >= (g | 0)) break;
+                    d = c[(U + (m << 2)) >> 2] | 0;
+                    if (!(m & 1)) {
+                      c[X >> 2] = c[S >> 2];
+                      c[(X + 4) >> 2] = c[(S + 4) >> 2];
+                      c[(X + 8) >> 2] = c[(S + 8) >> 2];
+                      c[(X + 12) >> 2] = c[(S + 12) >> 2];
+                      h[o >> 3] = A;
+                      h[C >> 3] = +h[z >> 3];
+                      h[e >> 3] = A;
+                      h[D >> 3] = s;
+                      h[f >> 3] = B;
+                      h[E >> 3] = s;
+                      h[F >> 3] = B;
+                      t = +h[G >> 3];
+                      h[H >> 3] = t;
+                      Z = +h[T >> 3];
+                      h[I >> 3] = Z;
+                      h[J >> 3] = t;
+                      h[K >> 3] = Z;
+                      Z = s + 6.0;
+                      h[L >> 3] = Z;
+                      h[M >> 3] = +h[S >> 3];
+                      s = Z;
+                      t = p;
+                      p = Z;
+                    } else {
+                      y = (m | 0) == 1;
+                      t = y ? v : p;
+                      q = y ? u : q;
+                      p = r + -6.0;
+                      c[X >> 2] = c[S >> 2];
+                      c[(X + 4) >> 2] = c[(S + 4) >> 2];
+                      c[(X + 8) >> 2] = c[(S + 8) >> 2];
+                      c[(X + 12) >> 2] = c[(S + 12) >> 2];
+                      h[o >> 3] = +h[S >> 3];
+                      r = r + -12.0;
+                      h[C >> 3] = r;
+                      h[e >> 3] = +h[T >> 3];
+                      h[D >> 3] = r;
+                      c[f >> 2] = c[T >> 2];
+                      c[(f + 4) >> 2] = c[(T + 4) >> 2];
+                      c[(f + 8) >> 2] = c[(T + 8) >> 2];
+                      c[(f + 12) >> 2] = c[(T + 12) >> 2];
+                      h[F >> 3] = q;
+                      h[H >> 3] = +h[G >> 3];
+                      h[I >> 3] = q;
+                      h[J >> 3] = p;
+                      h[K >> 3] = t;
+                      h[L >> 3] = p;
+                      h[M >> 3] = t;
+                      r = p;
+                      p = +h[z >> 3];
+                    }
+                    h[N >> 3] = p;
+                    c[O >> 2] = 8;
+                    c[V >> 2] = X;
+                    c[P >> 2] = c[S >> 2];
+                    c[(P + 4) >> 2] = c[(S + 4) >> 2];
+                    c[(P + 8) >> 2] = c[(S + 8) >> 2];
+                    c[(P + 12) >> 2] = c[(S + 12) >> 2];
+                    c[Q >> 2] = c[T >> 2];
+                    c[(Q + 4) >> 2] = c[(T + 4) >> 2];
+                    c[(Q + 8) >> 2] = c[(T + 8) >> 2];
+                    c[(Q + 12) >> 2] = c[(T + 12) >> 2];
+                    c[R >> 2] = c[V >> 2];
+                    c[(R + 4) >> 2] = c[(V + 4) >> 2];
+                    k = DM(P, Q, R, W, n) | 0;
+                    b = c[W >> 2] | 0;
+                    if (!b) break a;
+                    dO(d, c[((((c[d >> 2] & 3) | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0, k, b, 17296);
+                    m = (m + 1) | 0;
+                    p = t;
+                  }
+                  U1(U);
+                }
+              while (0);
+              l = Y;
+              return;
+            }
+            function Xg(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              g = l;
+              l = (l + 16) | 0;
+              f = g;
+              j = (xB(b) | 0) == 0;
+              j = j ? 18592 : 18584;
+              a[f >> 0] = a[j >> 0] | 0;
+              a[(f + 1) >> 0] = a[(j + 1) >> 0] | 0;
+              a[(f + 2) >> 0] = a[(j + 2) >> 0] | 0;
+              a[(f + 3) >> 0] = a[(j + 3) >> 0] | 0;
+              f = oB(85493, f, 0) | 0;
+              TC(f, 137483, 280, 1) | 0;
+              GA(f, 0, 87171, 195059) | 0;
+              j = JK(96) | 0;
+              e = c[(f + 16) >> 2] | 0;
+              c[(e + 8) >> 2] = j;
+              i = c[(b + 16) >> 2] | 0;
+              k = c[(i + 8) >> 2] | 0;
+              h[j >> 3] = +h[k >> 3];
+              h[(j + 24) >> 3] = +h[(k + 24) >> 3];
+              a[(e + 115) >> 0] = a[(i + 115) >> 0] | 0;
+              c[(e + 116) >> 2] = (c[(i + 116) >> 2] & 1) ^ 1;
+              c[(e + 248) >> 2] = c[(i + 248) >> 2];
+              c[(e + 252) >> 2] = c[(i + 252) >> 2];
+              e = LA(yC(b) | 0, 1, 0) | 0;
+              while (1) {
+                if (!e) break;
+                GA(f, 1, c[(e + 8) >> 2] | 0, c[(e + 12) >> 2] | 0) | 0;
+                e = LA(yC(b) | 0, 1, e) | 0;
+              }
+              e = LA(yC(b) | 0, 2, 0) | 0;
+              while (1) {
+                if (!e) break;
+                GA(f, 2, c[(e + 8) >> 2] | 0, c[(e + 12) >> 2] | 0) | 0;
+                e = LA(yC(b) | 0, 2, e) | 0;
+              }
+              if (!(GA(f, 2, 111464, 0) | 0)) GA(f, 2, 111464, 195059) | 0;
+              if (!(GA(f, 2, 111455, 0) | 0)) GA(f, 2, 111455, 195059) | 0;
+              ah(f, d);
+              l = g;
+              return f | 0;
+            }
+            function Yg(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              e = l;
+              l = (l + 16) | 0;
+              d = e;
+              a = tC(a, KB(b) | 0, 1) | 0;
+              TC(a, 137447, 304, 1) | 0;
+              UA(b, a) | 0;
+              if ((WM(b) | 0) == 2) {
+                f = (b + 16) | 0;
+                b = KK(((l2(c[c[((c[f >> 2] | 0) + 104) >> 2] >> 2] | 0) | 0) + 3) | 0) | 0;
+                c[d >> 2] = c[c[((c[f >> 2] | 0) + 104) >> 2] >> 2];
+                m4(b, 85488, d) | 0;
+                SA(a, 108224, b) | 0;
+              }
+              l = e;
+              return a | 0;
+            }
+            function Zg(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              c = iB(a, b, c, 0, 1) | 0;
+              TC(c, 137460, 176, 1) | 0;
+              UA(d, c) | 0;
+              return c | 0;
+            }
+            function _g(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0.0;
+              i = l;
+              l = (l + 32) | 0;
+              g = (i + 16) | 0;
+              f = i;
+              if (e | 0) {
+                j = +h[b >> 3];
+                e = (b + 8) | 0;
+                h[b >> 3] = +h[e >> 3];
+                h[e >> 3] = -j;
+              }
+              c[f >> 2] = c[b >> 2];
+              c[(f + 4) >> 2] = c[(b + 4) >> 2];
+              c[(f + 8) >> 2] = c[(b + 8) >> 2];
+              c[(f + 12) >> 2] = c[(b + 12) >> 2];
+              c[g >> 2] = c[d >> 2];
+              c[(g + 4) >> 2] = c[(d + 4) >> 2];
+              c[(g + 8) >> 2] = c[(d + 8) >> 2];
+              c[(g + 12) >> 2] = c[(d + 12) >> 2];
+              Ng(a, f, g);
+              l = i;
+              return;
+            }
+            function $g(a, b) {
+              a = a | 0;
+              b = b | 0;
+              c[47189] = c[b >> 2];
+              c[47193] = c[(b + 4) >> 2];
+              c[47194] = c[(b + 8) >> 2];
+              c[47174] = c[(b + 12) >> 2];
+              c[47175] = c[(b + 16) >> 2];
+              c[47181] = c[(b + 20) >> 2];
+              c[47180] = c[(b + 24) >> 2];
+              c[47179] = c[(b + 28) >> 2];
+              c[47205] = c[(b + 32) >> 2];
+              c[47197] = c[(b + 36) >> 2];
+              c[47182] = c[(b + 40) >> 2];
+              c[47192] = c[(b + 44) >> 2];
+              c[47201] = c[(b + 48) >> 2];
+              c[47200] = c[(b + 52) >> 2];
+              c[47199] = c[(b + 56) >> 2];
+              c[47204] = c[(b + 60) >> 2];
+              c[47198] = c[(b + 64) >> 2];
+              c[47183] = c[(b + 68) >> 2];
+              c[47145] = c[(b + 72) >> 2];
+              c[47146] = c[(b + 76) >> 2];
+              c[47147] = c[(b + 80) >> 2];
+              c[47157] = c[(b + 84) >> 2];
+              c[47150] = c[(b + 88) >> 2];
+              c[47151] = c[(b + 92) >> 2];
+              c[47152] = c[(b + 96) >> 2];
+              c[47154] = c[(b + 100) >> 2];
+              c[47155] = c[(b + 104) >> 2];
+              c[47158] = c[(b + 108) >> 2];
+              c[47161] = c[(b + 112) >> 2];
+              c[47159] = c[(b + 116) >> 2];
+              c[47160] = c[(b + 120) >> 2];
+              c[47163] = c[(b + 124) >> 2];
+              c[47162] = c[(b + 128) >> 2];
+              c[47164] = c[(b + 132) >> 2];
+              c[47165] = c[(b + 136) >> 2];
+              c[47156] = c[(b + 140) >> 2];
+              c[47168] = c[(b + 144) >> 2];
+              c[47140] = c[(b + 148) >> 2];
+              c[47138] = c[(b + 152) >> 2];
+              U1(b);
+              Rf(a);
+              sB(a) | 0;
+              return;
+            }
+            function ah(a, b) {
+              a = a | 0;
+              b = b | 0;
+              c[b >> 2] = c[47189];
+              c[(b + 4) >> 2] = c[47193];
+              c[(b + 8) >> 2] = c[47194];
+              c[(b + 12) >> 2] = c[47174];
+              c[(b + 16) >> 2] = c[47175];
+              c[(b + 20) >> 2] = c[47181];
+              c[(b + 24) >> 2] = c[47180];
+              c[(b + 28) >> 2] = c[47179];
+              c[(b + 32) >> 2] = c[47205];
+              c[(b + 36) >> 2] = c[47197];
+              c[(b + 40) >> 2] = c[47182];
+              c[(b + 44) >> 2] = c[47192];
+              c[(b + 48) >> 2] = c[47201];
+              c[(b + 52) >> 2] = c[47200];
+              c[(b + 56) >> 2] = c[47199];
+              c[(b + 60) >> 2] = c[47204];
+              c[(b + 64) >> 2] = c[47198];
+              c[(b + 68) >> 2] = c[47183];
+              c[(b + 72) >> 2] = c[47145];
+              c[(b + 76) >> 2] = c[47146];
+              c[(b + 80) >> 2] = c[47147];
+              c[(b + 84) >> 2] = c[47157];
+              c[(b + 88) >> 2] = c[47150];
+              c[(b + 92) >> 2] = c[47151];
+              c[(b + 96) >> 2] = c[47152];
+              c[(b + 100) >> 2] = c[47154];
+              c[(b + 104) >> 2] = c[47155];
+              c[(b + 108) >> 2] = c[47158];
+              c[(b + 112) >> 2] = c[47161];
+              c[(b + 116) >> 2] = c[47159];
+              c[(b + 120) >> 2] = c[47160];
+              c[(b + 124) >> 2] = c[47163];
+              c[(b + 128) >> 2] = c[47162];
+              c[(b + 132) >> 2] = c[47164];
+              c[(b + 136) >> 2] = c[47165];
+              c[(b + 140) >> 2] = c[47156];
+              c[(b + 144) >> 2] = c[47168];
+              c[(b + 152) >> 2] = c[47138];
+              c[(b + 148) >> 2] = c[47140];
+              c[47189] = 0;
+              c[47193] = GA(a, 2, 87412, 0) | 0;
+              c[47194] = GA(a, 2, 87421, 0) | 0;
+              b = GA(a, 2, 101541, 0) | 0;
+              c[47174] = b;
+              if (!b) c[47174] = GA(a, 2, 101541, 195059) | 0;
+              c[47175] = 0;
+              c[47181] = 0;
+              c[47180] = GA(a, 2, 101437, 0) | 0;
+              c[47179] = GA(a, 2, 101428, 0) | 0;
+              c[47205] = GA(a, 2, 101717, 0) | 0;
+              c[47197] = 0;
+              c[47182] = GA(a, 2, 108224, 0) | 0;
+              c[47192] = GA(a, 2, 85498, 0) | 0;
+              c[47201] = 0;
+              c[47200] = GA(a, 2, 101617, 0) | 0;
+              c[47199] = GA(a, 2, 101603, 0) | 0;
+              c[47204] = GA(a, 2, 101708, 0) | 0;
+              c[47198] = 0;
+              c[47183] = 0;
+              c[47145] = GA(a, 1, 141048, 0) | 0;
+              c[47146] = GA(a, 1, 141116, 0) | 0;
+              c[47147] = GA(a, 1, 108230, 0) | 0;
+              c[47157] = 0;
+              c[47150] = GA(a, 1, 101428, 0) | 0;
+              c[47151] = GA(a, 1, 101437, 0) | 0;
+              c[47152] = 0;
+              c[47154] = GA(a, 1, 108224, 0) | 0;
+              c[47155] = 0;
+              c[47158] = 0;
+              c[47161] = GA(a, 1, 101409, 0) | 0;
+              c[47159] = GA(a, 1, 141076, 0) | 0;
+              c[47160] = GA(a, 1, 101472, 0) | 0;
+              c[47163] = GA(a, 1, 101484, 0) | 0;
+              c[47162] = GA(a, 1, 101348, 0) | 0;
+              c[47164] = GA(a, 1, 101489, 0) | 0;
+              c[47165] = GA(a, 1, 85510, 0) | 0;
+              c[47156] = 0;
+              c[47168] = 0;
+              c[47140] = GA(a, 0, 101409, 0) | 0;
+              return;
+            }
+            function bh(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0.0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0;
+              d = c[((c[((c[a >> 2] | 0) + 16) >> 2] | 0) + 96) >> 2] | 0;
+              a = c[((c[((c[b >> 2] | 0) + 16) >> 2] | 0) + 96) >> 2] | 0;
+              b = (a | 0) != 0;
+              if (d)
+                if (
+                  b
+                    ? ((f = +h[(d + 24) >> 3]),
+                      (i = +h[(d + 32) >> 3]),
+                      (e = +h[(a + 24) >> 3]),
+                      (g = +h[(a + 32) >> 3]),
+                      !(f > e))
+                    : 0
+                )
+                  if (!(f < e))
+                    if (i > g) a = -1;
+                    else a = (i < g) & 1;
+                  else a = 1;
+                else a = -1;
+              else a = b & 1;
+              return a | 0;
+            }
+            function ch(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              while (1) {
+                b = c[((c[(a + 16) >> 2] | 0) + 116) >> 2] | 0;
+                if (!b) break;
+                else a = b;
+              }
+              b = c[a >> 2] & 3;
+              d = c[((c[(((b | 0) == 2 ? a : (a + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0;
+              e = c[(d + 232) >> 2] | 0;
+              a = c[((c[(((b | 0) == 3 ? a : (a + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0;
+              b = c[(a + 232) >> 2] | 0;
+              if ((e | 0) <= (b | 0))
+                if ((e | 0) < (b | 0)) a = 1;
+                else a = ((c[(d + 236) >> 2] | 0) < (c[(a + 236) >> 2] | 0)) & 1;
+              else a = 0;
+              return a | 0;
+            }
+            function dh(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              d = l;
+              l = (l + 16) | 0;
+              e = (d + 8) | 0;
+              f = d;
+              h = ((c[(a + 16) >> 2] | 0) + 180) | 0;
+              g = ((c[(b + 16) >> 2] | 0) + 172) | 0;
+              c[f >> 2] = c[h >> 2];
+              c[(f + 4) >> 2] = c[(h + 4) >> 2];
+              c[e >> 2] = c[g >> 2];
+              c[(e + 4) >> 2] = c[(g + 4) >> 2];
+              b = eh(a, f, b, e) | 0;
+              l = d;
+              return b | 0;
+            }
+            function eh(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              f = c[(b + 4) >> 2] | 0;
+              a: do
+                if ((f | 0) > 0 ? ((g = c[(e + 4) >> 2] | 0), (g | 0) > 0) : 0)
+                  if ((f | 0) < (g | 0)) {
+                    f = c[b >> 2] | 0;
+                    e = 0;
+                    while (1) {
+                      b = c[(f + (e << 2)) >> 2] | 0;
+                      if (!b) {
+                        b = 0;
+                        break a;
+                      }
+                      if ((c[((((c[b >> 2] & 3) | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0) == (d | 0)) break;
+                      else e = (e + 1) | 0;
+                    }
+                  } else {
+                    f = c[e >> 2] | 0;
+                    e = 0;
+                    while (1) {
+                      b = c[(f + (e << 2)) >> 2] | 0;
+                      if (!b) {
+                        b = 0;
+                        break a;
+                      }
+                      if ((c[((((c[b >> 2] & 3) | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0) == (a | 0)) break;
+                      else e = (e + 1) | 0;
+                    }
+                  }
+                else b = 0;
+              while (0);
+              return b | 0;
+            }
+            function fh(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              d = l;
+              l = (l + 16) | 0;
+              e = (d + 8) | 0;
+              f = d;
+              h = ((c[(a + 16) >> 2] | 0) + 188) | 0;
+              g = ((c[(b + 16) >> 2] | 0) + 196) | 0;
+              c[f >> 2] = c[h >> 2];
+              c[(f + 4) >> 2] = c[(h + 4) >> 2];
+              c[e >> 2] = c[g >> 2];
+              c[(e + 4) >> 2] = c[(g + 4) >> 2];
+              b = eh(a, f, b, e) | 0;
+              l = d;
+              return b | 0;
+            }
+            function gh(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              e = (a + 48) | 0;
+              d = c[((c[((((c[a >> 2] & 3) | 0) == 3 ? a : e) + 40) >> 2] | 0) + 16) >> 2] | 0;
+              b = c[(d + 180) >> 2] | 0;
+              if (!b) b = KK(((c[(d + 184) >> 2] << 2) + 8) | 0) | 0;
+              else b = MK(b, ((c[(d + 184) >> 2] << 2) + 8) | 0) | 0;
+              c[((c[((c[((((c[a >> 2] & 3) | 0) == 3 ? a : e) + 40) >> 2] | 0) + 16) >> 2] | 0) + 180) >> 2] = b;
+              f = c[((c[((((c[a >> 2] & 3) | 0) == 3 ? a : e) + 40) >> 2] | 0) + 16) >> 2] | 0;
+              d = c[(f + 180) >> 2] | 0;
+              f = (f + 184) | 0;
+              b = c[f >> 2] | 0;
+              c[f >> 2] = b + 1;
+              c[(d + (b << 2)) >> 2] = a;
+              e = c[((c[((((c[a >> 2] & 3) | 0) == 3 ? a : e) + 40) >> 2] | 0) + 16) >> 2] | 0;
+              c[((c[(e + 180) >> 2] | 0) + (c[(e + 184) >> 2] << 2)) >> 2] = 0;
+              e = (a + -48) | 0;
+              b = c[((c[((((c[a >> 2] & 3) | 0) == 2 ? a : e) + 40) >> 2] | 0) + 16) >> 2] | 0;
+              d = c[(b + 172) >> 2] | 0;
+              if (!d) b = KK(((c[(b + 176) >> 2] << 2) + 8) | 0) | 0;
+              else b = MK(d, ((c[(b + 176) >> 2] << 2) + 8) | 0) | 0;
+              c[((c[((c[((((c[a >> 2] & 3) | 0) == 2 ? a : e) + 40) >> 2] | 0) + 16) >> 2] | 0) + 172) >> 2] = b;
+              b = c[((c[((((c[a >> 2] & 3) | 0) == 2 ? a : e) + 40) >> 2] | 0) + 16) >> 2] | 0;
+              d = c[(b + 172) >> 2] | 0;
+              b = (b + 176) | 0;
+              f = c[b >> 2] | 0;
+              c[b >> 2] = f + 1;
+              c[(d + (f << 2)) >> 2] = a;
+              f = c[((c[((((c[a >> 2] & 3) | 0) == 2 ? a : e) + 40) >> 2] | 0) + 16) >> 2] | 0;
+              c[((c[(f + 172) >> 2] | 0) + (c[(f + 176) >> 2] << 2)) >> 2] = 0;
+              return a | 0;
+            }
+            function hh(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              e = (a + 4) | 0;
+              f = c[e >> 2] | 0;
+              d = 0;
+              while (1) {
+                if ((d | 0) >= (f | 0)) break;
+                g = c[a >> 2] | 0;
+                h = (g + (d << 2)) | 0;
+                if ((c[h >> 2] | 0) == (b | 0)) {
+                  i = 4;
+                  break;
+                } else d = (d + 1) | 0;
+              }
+              if ((i | 0) == 4) {
+                i = (f + -1) | 0;
+                c[e >> 2] = i;
+                c[h >> 2] = c[(g + (i << 2)) >> 2];
+                c[((c[a >> 2] | 0) + (i << 2)) >> 2] = 0;
+              }
+              return;
+            }
+            function ih(a) {
+              a = a | 0;
+              if (!a) qa(85551, 85561, 117, 85570);
+              else {
+                hh(
+                  ((c[((c[((((c[a >> 2] & 3) | 0) == 3 ? a : (a + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 180) | 0,
+                  a
+                );
+                hh(
+                  ((c[((c[((((c[a >> 2] & 3) | 0) == 2 ? a : (a + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 172) |
+                    0,
+                  a
+                );
+                return;
+              }
+            }
+            function jh(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              e = (a + 48) | 0;
+              d = c[((c[((((c[a >> 2] & 3) | 0) == 3 ? a : e) + 40) >> 2] | 0) + 16) >> 2] | 0;
+              b = c[(d + 204) >> 2] | 0;
+              if (!b) b = KK(((c[(d + 208) >> 2] << 2) + 8) | 0) | 0;
+              else b = MK(b, ((c[(d + 208) >> 2] << 2) + 8) | 0) | 0;
+              c[((c[((c[((((c[a >> 2] & 3) | 0) == 3 ? a : e) + 40) >> 2] | 0) + 16) >> 2] | 0) + 204) >> 2] = b;
+              f = c[((c[((((c[a >> 2] & 3) | 0) == 3 ? a : e) + 40) >> 2] | 0) + 16) >> 2] | 0;
+              b = c[(f + 204) >> 2] | 0;
+              f = (f + 208) | 0;
+              d = c[f >> 2] | 0;
+              c[f >> 2] = d + 1;
+              c[(b + (d << 2)) >> 2] = a;
+              e = c[((c[((((c[a >> 2] & 3) | 0) == 3 ? a : e) + 40) >> 2] | 0) + 16) >> 2] | 0;
+              c[((c[(e + 204) >> 2] | 0) + (c[(e + 208) >> 2] << 2)) >> 2] = 0;
+              return;
+            }
+            function kh(a) {
+              a = a | 0;
+              lh(
+                a,
+                ((c[((c[((((c[a >> 2] & 3) | 0) == 3 ? a : (a + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 204) | 0
+              );
+              return;
+            }
+            function lh(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = (b + 4) | 0;
+              e = c[h >> 2] | 0;
+              f = c[b >> 2] | 0;
+              d = 0;
+              while (1) {
+                if ((d | 0) >= (e | 0)) {
+                  g = 4;
+                  break;
+                }
+                if ((c[(f + (d << 2)) >> 2] | 0) == (a | 0)) break;
+                else d = (d + 1) | 0;
+              }
+              if ((g | 0) == 4) {
+                if (!f) d = KK(((e << 2) + 8) | 0) | 0;
+                else d = MK(f, ((e << 2) + 8) | 0) | 0;
+                c[b >> 2] = d;
+                f = c[h >> 2] | 0;
+                g = (f + 1) | 0;
+                c[h >> 2] = g;
+                c[(d + (f << 2)) >> 2] = a;
+                c[((c[b >> 2] | 0) + (g << 2)) >> 2] = 0;
+              }
+              return;
+            }
+            function mh(d, e, f) {
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0;
+              n = JK(96) | 0;
+              g = (n + 48) | 0;
+              c[g >> 2] = c[g >> 2] | 3;
+              c[n >> 2] = (c[n >> 2] & -4) | 2;
+              h = JK(176) | 0;
+              m = (n + 16) | 0;
+              c[m >> 2] = h;
+              c[((((c[n >> 2] & 3) | 0) == 3 ? n : g) + 40) >> 2] = d;
+              j = (n + -48) | 0;
+              c[((((c[n >> 2] & 3) | 0) == 2 ? n : j) + 40) >> 2] = e;
+              a[(h + 112) >> 0] = 1;
+              if (!f) {
+                c[(h + 156) >> 2] = 1;
+                b[(h + 154) >> 1] = 1;
+                b[(h + 168) >> 1] = 1;
+                b[(h + 170) >> 1] = 1;
+              } else {
+                c[n >> 2] = (c[n >> 2] & 15) | (c[f >> 2] & -16);
+                c[g >> 2] = (c[g >> 2] & 15) | (c[f >> 2] & -16);
+                l = (f + 16) | 0;
+                i = c[l >> 2] | 0;
+                b[(h + 168) >> 1] = b[(i + 168) >> 1] | 0;
+                b[(h + 154) >> 1] = b[(i + 154) >> 1] | 0;
+                c[(h + 156) >> 2] = c[(i + 156) >> 2];
+                b[(h + 170) >> 1] = b[(i + 170) >> 1] | 0;
+                d = c[((((c[n >> 2] & 3) | 0) == 3 ? n : g) + 40) >> 2] | 0;
+                e = c[f >> 2] & 3;
+                k = (f + 48) | 0;
+                if ((d | 0) != (c[(((e | 0) == 3 ? f : k) + 40) >> 2] | 0)) {
+                  g = (f + -48) | 0;
+                  if ((d | 0) == (c[(((e | 0) == 2 ? f : g) + 40) >> 2] | 0)) {
+                    h = (h + 16) | 0;
+                    d = (i + 56) | 0;
+                    e = (h + 40) | 0;
+                    do {
+                      c[h >> 2] = c[d >> 2];
+                      h = (h + 4) | 0;
+                      d = (d + 4) | 0;
+                    } while ((h | 0) < (e | 0));
+                  }
+                } else {
+                  h = (h + 16) | 0;
+                  d = (i + 16) | 0;
+                  e = (h + 40) | 0;
+                  do {
+                    c[h >> 2] = c[d >> 2];
+                    h = (h + 4) | 0;
+                    d = (d + 4) | 0;
+                  } while ((h | 0) < (e | 0));
+                  g = (f + -48) | 0;
+                }
+                d = c[((((c[n >> 2] & 3) | 0) == 2 ? n : j) + 40) >> 2] | 0;
+                e = c[f >> 2] & 3;
+                if ((d | 0) != (c[(((e | 0) == 2 ? f : g) + 40) >> 2] | 0)) {
+                  if ((d | 0) == (c[(((e | 0) == 3 ? f : k) + 40) >> 2] | 0)) {
+                    h = ((c[m >> 2] | 0) + 56) | 0;
+                    d = ((c[l >> 2] | 0) + 16) | 0;
+                    e = (h + 40) | 0;
+                    do {
+                      c[h >> 2] = c[d >> 2];
+                      h = (h + 4) | 0;
+                      d = (d + 4) | 0;
+                    } while ((h | 0) < (e | 0));
+                  }
+                } else {
+                  h = ((c[m >> 2] | 0) + 56) | 0;
+                  d = ((c[l >> 2] | 0) + 56) | 0;
+                  e = (h + 40) | 0;
+                  do {
+                    c[h >> 2] = c[d >> 2];
+                    h = (h + 4) | 0;
+                    d = (d + 4) | 0;
+                  } while ((h | 0) < (e | 0));
+                }
+                d = ((c[l >> 2] | 0) + 172) | 0;
+                if (!(c[d >> 2] | 0)) c[d >> 2] = n;
+                c[((c[m >> 2] | 0) + 116) >> 2] = f;
+              }
+              return n | 0;
+            }
+            function nh(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              return gh(mh(a, b, c) | 0) | 0;
+            }
+            function oh(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              a = ((c[(a + 16) >> 2] | 0) + 192) | 0;
+              f = c[a >> 2] | 0;
+              d = c[(b + 16) >> 2] | 0;
+              c[(d + 164) >> 2] = f;
+              e = f;
+              if (f | 0) c[((c[(e + 16) >> 2] | 0) + 168) >> 2] = b;
+              c[a >> 2] = b;
+              c[(d + 168) >> 2] = 0;
+              if ((e | 0) == (b | 0)) qa(85587, 85561, 215, 85603);
+              else return;
+            }
+            function ph(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              if ((a | 0) == (b | 0)) qa(85613, 85561, 220, 85620);
+              f = c[(b + 16) >> 2] | 0;
+              d = (f + 164) | 0;
+              if (c[d >> 2] | 0) qa(85633, 85561, 221, 85620);
+              e = ((c[(a + 16) >> 2] | 0) + 164) | 0;
+              c[d >> 2] = c[e >> 2];
+              d = c[e >> 2] | 0;
+              if (d | 0) c[((c[(d + 16) >> 2] | 0) + 168) >> 2] = b;
+              c[(f + 168) >> 2] = a;
+              c[e >> 2] = b;
+              return;
+            }
+            function qh(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              if (!(rh(a, b) | 0)) qa(85652, 85561, 231, 85673);
+              b = c[(b + 16) >> 2] | 0;
+              d = c[(b + 164) >> 2] | 0;
+              e = d;
+              b = (b + 168) | 0;
+              if (d | 0) c[((c[(d + 16) >> 2] | 0) + 168) >> 2] = c[b >> 2];
+              b = c[b >> 2] | 0;
+              if (!b) c[((c[(a + 16) >> 2] | 0) + 192) >> 2] = e;
+              else c[((c[(b + 16) >> 2] | 0) + 164) >> 2] = e;
+              return;
+            }
+            function rh(a, b) {
+              a = a | 0;
+              b = b | 0;
+              a = ((c[(a + 16) >> 2] | 0) + 192) | 0;
+              while (1) {
+                a = c[a >> 2] | 0;
+                if (((a | 0) == 0) | ((a | 0) == (b | 0))) break;
+                a = ((c[(a + 16) >> 2] | 0) + 164) | 0;
+              }
+              return a | 0;
+            }
+            function sh(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              d = JK(64) | 0;
+              c[d >> 2] = (c[d >> 2] & -4) | 1;
+              e = (d + 16) | 0;
+              c[e >> 2] = JK(304) | 0;
+              c[(d + 24) >> 2] = yC(b) | 0;
+              g = c[e >> 2] | 0;
+              a[(g + 156) >> 0] = 1;
+              h[(g + 96) >> 3] = 1.0;
+              h[(g + 88) >> 3] = 1.0;
+              h[(g + 80) >> 3] = 1.0;
+              c[(g + 216) >> 2] = 1;
+              c[(g + 176) >> 2] = 0;
+              g = JK(20) | 0;
+              f = c[e >> 2] | 0;
+              c[(f + 172) >> 2] = g;
+              c[(f + 184) >> 2] = 0;
+              f = JK(20) | 0;
+              c[((c[e >> 2] | 0) + 180) >> 2] = f;
+              oh(b, d);
+              b = ((c[(b + 16) >> 2] | 0) + 232) | 0;
+              c[b >> 2] = (c[b >> 2] | 0) + 1;
+              return d | 0;
+            }
+            function th(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              g = (d + 48) | 0;
+              e = c[((c[((((c[d >> 2] & 3) | 0) == 3 ? d : g) + 40) >> 2] | 0) + 16) >> 2] | 0;
+              f = c[(e + 188) >> 2] | 0;
+              if (!f) e = KK(((c[(e + 192) >> 2] << 2) + 8) | 0) | 0;
+              else e = MK(f, ((c[(e + 192) >> 2] << 2) + 8) | 0) | 0;
+              c[((c[((c[((((c[d >> 2] & 3) | 0) == 3 ? d : g) + 40) >> 2] | 0) + 16) >> 2] | 0) + 188) >> 2] = e;
+              h = c[((c[((((c[d >> 2] & 3) | 0) == 3 ? d : g) + 40) >> 2] | 0) + 16) >> 2] | 0;
+              f = c[(h + 188) >> 2] | 0;
+              h = (h + 192) | 0;
+              e = c[h >> 2] | 0;
+              c[h >> 2] = e + 1;
+              c[(f + (e << 2)) >> 2] = d;
+              g = c[((c[((((c[d >> 2] & 3) | 0) == 3 ? d : g) + 40) >> 2] | 0) + 16) >> 2] | 0;
+              c[((c[(g + 188) >> 2] | 0) + (c[(g + 192) >> 2] << 2)) >> 2] = 0;
+              g = (d + -48) | 0;
+              e = c[((c[((((c[d >> 2] & 3) | 0) == 2 ? d : g) + 40) >> 2] | 0) + 16) >> 2] | 0;
+              f = c[(e + 196) >> 2] | 0;
+              if (!f) e = KK(((c[(e + 200) >> 2] << 2) + 8) | 0) | 0;
+              else e = MK(f, ((c[(e + 200) >> 2] << 2) + 8) | 0) | 0;
+              c[((c[((c[((((c[d >> 2] & 3) | 0) == 2 ? d : g) + 40) >> 2] | 0) + 16) >> 2] | 0) + 196) >> 2] = e;
+              e = c[((c[((((c[d >> 2] & 3) | 0) == 2 ? d : g) + 40) >> 2] | 0) + 16) >> 2] | 0;
+              f = c[(e + 196) >> 2] | 0;
+              e = (e + 200) | 0;
+              h = c[e >> 2] | 0;
+              c[e >> 2] = h + 1;
+              c[(f + (h << 2)) >> 2] = d;
+              h = c[((c[((((c[d >> 2] & 3) | 0) == 2 ? d : g) + 40) >> 2] | 0) + 16) >> 2] | 0;
+              c[((c[(h + 196) >> 2] | 0) + (c[(h + 200) >> 2] << 2)) >> 2] = 0;
+              a[((c[(b + 16) >> 2] | 0) + 240) >> 0] = 1;
+              a[((c[((gg(b) | 0) + 16) >> 2] | 0) + 240) >> 0] = 1;
+              return;
+            }
+            function uh(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              if (!a) qa(85551, 85561, 269, 85690);
+              b = c[((c[(a + 16) >> 2] | 0) + 116) >> 2] | 0;
+              if (b | 0 ? ((d = ((c[(b + 16) >> 2] | 0) + 172) | 0), (c[d >> 2] | 0) == (a | 0)) : 0) c[d >> 2] = 0;
+              hh(
+                ((c[((c[((((c[a >> 2] & 3) | 0) == 3 ? a : (a + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 188) | 0,
+                a
+              );
+              hh(
+                ((c[((c[((((c[a >> 2] & 3) | 0) == 2 ? a : (a + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 196) | 0,
+                a
+              );
+              return;
+            }
+            function vh(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              f = l;
+              l = (l + 16) | 0;
+              d = ((c[(a + 16) >> 2] | 0) + 172) | 0;
+              e = c[d >> 2] | 0;
+              do
+                if ((e | 0) != (b | 0))
+                  if (!e) {
+                    c[d >> 2] = b;
+                    wh(a, b);
+                    break;
+                  } else qa(87593, 85561, 340, 85728);
+                else gA(0, 85707, f) | 0;
+              while (0);
+              l = f;
+              return;
+            }
+            function wh(a, d) {
+              a = a | 0;
+              d = d | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              f = ((c[(d + 16) >> 2] | 0) + 170) | 0;
+              i = c[(a + 16) >> 2] | 0;
+              a = b[(i + 170) >> 1] | 0;
+              if ((e[f >> 1] | 0) < (a & 65535)) b[f >> 1] = a;
+              g = (i + 168) | 0;
+              h = (i + 154) | 0;
+              f = (i + 156) | 0;
+              a = d;
+              while (1) {
+                if (!a) break;
+                d = c[(a + 16) >> 2] | 0;
+                i = (d + 168) | 0;
+                b[i >> 1] = (e[i >> 1] | 0) + (e[g >> 1] | 0);
+                i = (d + 154) | 0;
+                b[i >> 1] = (e[i >> 1] | 0) + (e[h >> 1] | 0);
+                i = (d + 156) | 0;
+                c[i >> 2] = (c[i >> 2] | 0) + (c[f >> 2] | 0);
+                a = c[(d + 172) >> 2] | 0;
+              }
+              return;
+            }
+            function xh(d) {
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              f = (d + 16) | 0;
+              e = c[((c[f >> 2] | 0) + 172) >> 2] | 0;
+              a: while (1) {
+                if (!e) break;
+                yh(e, d);
+                h = c[(e + 16) >> 2] | 0;
+                g = c[(h + 172) >> 2] | 0;
+                if (!(b[(h + 168) >> 1] | 0)) zh(e);
+                while (1) {
+                  if ((a[((c[(e + 16) >> 2] | 0) + 112) >> 0] | 0) != 1) {
+                    e = g;
+                    continue a;
+                  }
+                  e = c[((c[((((c[e >> 2] & 3) | 0) == 2 ? e : (e + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                  if ((a[(e + 156) >> 0] | 0) != 1) {
+                    e = g;
+                    continue a;
+                  }
+                  if ((c[(e + 184) >> 2] | 0) != 1) {
+                    e = g;
+                    continue a;
+                  }
+                  e = c[c[(e + 180) >> 2] >> 2] | 0;
+                  yh(e, d);
+                }
+              }
+              c[((c[f >> 2] | 0) + 172) >> 2] = 0;
+              return;
+            }
+            function yh(a, d) {
+              a = a | 0;
+              d = d | 0;
+              var f = 0;
+              f = c[(d + 16) >> 2] | 0;
+              d = c[(a + 16) >> 2] | 0;
+              a = (d + 168) | 0;
+              b[a >> 1] = (e[a >> 1] | 0) - (e[(f + 168) >> 1] | 0);
+              a = (d + 154) | 0;
+              b[a >> 1] = (e[a >> 1] | 0) - (e[(f + 154) >> 1] | 0);
+              d = (d + 156) | 0;
+              c[d >> 2] = (c[d >> 2] | 0) - (c[(f + 156) >> 2] | 0);
+              return;
+            }
+            function zh(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              if (!a) qa(85551, 85561, 128, 85741);
+              g = (a + 48) | 0;
+              d = 0;
+              while (1) {
+                b = c[a >> 2] | 0;
+                e = ((c[((c[((((b & 3) | 0) == 3 ? a : g) + 40) >> 2] | 0) + 16) >> 2] | 0) + 180) | 0;
+                f = c[((c[e >> 2] | 0) + (d << 2)) >> 2] | 0;
+                if (!f) break;
+                if ((f | 0) == (a | 0)) hh(e, a);
+                d = (d + 1) | 0;
+              }
+              g = (a + -48) | 0;
+              f = 0;
+              while (1) {
+                d = ((c[((c[((((b & 3) | 0) == 2 ? a : g) + 40) >> 2] | 0) + 16) >> 2] | 0) + 172) | 0;
+                e = c[((c[d >> 2] | 0) + (f << 2)) >> 2] | 0;
+                if (!e) break;
+                if ((e | 0) == (a | 0)) {
+                  hh(d, a);
+                  b = c[a >> 2] | 0;
+                }
+                f = (f + 1) | 0;
+              }
+              return;
+            }
+            function Ah(d) {
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0;
+              p = l;
+              l = (l + 1040) | 0;
+              n = (p + 1032) | 0;
+              o = p;
+              m = (p + 8) | 0;
+              k = (d + 16) | 0;
+              d = c[k >> 2] | 0;
+              j = b[(d + 236) >> 1] | 0;
+              while (1) {
+                if ((j | 0) > (b[(d + 238) >> 1] | 0)) break;
+                i = c[(d + 196) >> 2] | 0;
+                h = (i + (j << 6)) | 0;
+                i = (i + (j << 6) + 4) | 0;
+                g = 0;
+                d = 0;
+                while (1) {
+                  if ((g | 0) >= (c[h >> 2] | 0)) break;
+                  e = c[((c[i >> 2] | 0) + (g << 2)) >> 2] | 0;
+                  f = (e + 16) | 0;
+                  if (c[((c[f >> 2] | 0) + 112) >> 2] | 0) {
+                    if (!d) {
+                      a[n >> 0] = a[18588] | 0;
+                      a[(n + 1) >> 0] = a[18589] | 0;
+                      a[(n + 2) >> 0] = a[18590] | 0;
+                      a[(n + 3) >> 0] = a[18591] | 0;
+                      d = oB(85763, n, 0) | 0;
+                    }
+                    c[o >> 2] = g;
+                    m4(m, 137395, o) | 0;
+                    t = tC(d, m, 1) | 0;
+                    TC(t, 91164, 24, 1) | 0;
+                    q = c[((c[f >> 2] | 0) + 180) >> 2] | 0;
+                    r = c[q >> 2] | 0;
+                    r =
+                      c[
+                        ((c[((c[((((c[r >> 2] & 3) | 0) == 2 ? r : (r + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                          236) >>
+                          2
+                      ] | 0;
+                    q = c[(q + 4) >> 2] | 0;
+                    q =
+                      c[
+                        ((c[((c[((((c[q >> 2] & 3) | 0) == 2 ? q : (q + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                          236) >>
+                          2
+                      ] | 0;
+                    s = (r | 0) > (q | 0);
+                    f = c[(t + 16) >> 2] | 0;
+                    c[(f + 12) >> 2] = s ? q : r;
+                    c[(f + 16) >> 2] = s ? r : q;
+                    c[(f + 20) >> 2] = e;
+                  }
+                  g = (g + 1) | 0;
+                }
+                if (d | 0) {
+                  if ((tB(d) | 0) > 1) Bh(d, h);
+                  sB(d) | 0;
+                }
+                j = (j + 1) | 0;
+                d = c[k >> 2] | 0;
+              }
+              l = p;
+              return;
+            }
+            function Bh(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              d = 0;
+              h = jC(a) | 0;
+              a: while (1) {
+                if (!h) break;
+                i = kC(a, h) | 0;
+                j = (h + 16) | 0;
+                g = i;
+                while (1) {
+                  if (!g) {
+                    h = i;
+                    continue a;
+                  }
+                  f = c[(g + 16) >> 2] | 0;
+                  e = c[j >> 2] | 0;
+                  if ((c[(f + 16) >> 2] | 0) > (c[(e + 12) >> 2] | 0)) {
+                    if ((c[(e + 16) >> 2] | 0) <= (c[(f + 12) >> 2] | 0)) iB(a, h, g, 0, 1) | 0;
+                  } else {
+                    iB(a, g, h, 0, 1) | 0;
+                    d = 1;
+                  }
+                  g = kC(a, g) | 0;
+                }
+              }
+              do
+                if (d | 0) {
+                  h = ND(a, 85766, 1) | 0;
+                  j = JK((tB(a) | 0) << 2) | 0;
+                  i = JK((tB(a) | 0) << 2) | 0;
+                  f = (b + 4) | 0;
+                  e = jC(a) | 0;
+                  b: while (1) {
+                    if (!e) {
+                      d = 23;
+                      break;
+                    }
+                    if ((c[((c[(e + 16) >> 2] | 0) + 8) >> 2] | 0) == 0 ? vB(a, e, 1, 1) | 0 : 0) {
+                      c: do
+                        if (Ch(a, e, h, i) | 0) {
+                          g = tB(h) | 0;
+                          if ((Dh(a, h, j) | 0) != (g | 0)) {
+                            d = 17;
+                            break b;
+                          }
+                          o4(i, g, 4, 60);
+                          d = 0;
+                          while (1) {
+                            if ((d | 0) >= (g | 0)) break c;
+                            b = (i + (d << 2)) | 0;
+                            k = c[(j + (d << 2)) >> 2] | 0;
+                            c[((c[(k + 16) >> 2] | 0) + 236) >> 2] = c[b >> 2];
+                            c[((c[f >> 2] | 0) + (c[b >> 2] << 2)) >> 2] = k;
+                            d = (d + 1) | 0;
+                          }
+                        }
+                      while (0);
+                      Fh(h);
+                    }
+                    e = kC(a, e) | 0;
+                  }
+                  if ((d | 0) == 17) qa(85771, 85781, 265, 85792);
+                  else if ((d | 0) == 23) {
+                    U1(j);
+                    break;
+                  }
+                }
+              while (0);
+              return;
+            }
+            function Ch(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              h = c[(b + 16) >> 2] | 0;
+              c[(h + 8) >> 2] = 1;
+              h = c[((c[((c[(h + 20) >> 2] | 0) + 16) >> 2] | 0) + 236) >> 2] | 0;
+              c[(e + ((tB(d) | 0) << 2)) >> 2] = h;
+              oC(d, b, 1) | 0;
+              h = XA(a, b) | 0;
+              f = 0;
+              while (1) {
+                if (!h) break;
+                j = c[h >> 2] & 3;
+                g = c[(((j | 0) == 2 ? h : (h + -48) | 0) + 40) >> 2] | 0;
+                i = c[(g + 16) >> 2] | 0;
+                f =
+                  (f +
+                    (((c[((c[((c[(i + 20) >> 2] | 0) + 16) >> 2] | 0) + 236) >> 2] | 0) >
+                      (c[
+                        ((c[
+                          ((c[((c[((c[(((j | 0) == 3 ? h : (h + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 20) >> 2] |
+                            0) +
+                            16) >>
+                            2
+                        ] |
+                          0) +
+                          236) >>
+                          2
+                      ] |
+                        0)) &
+                      1)) |
+                  0;
+                if (!(c[(i + 8) >> 2] | 0)) f = ((Ch(a, g, d, e) | 0) + f) | 0;
+                h = ZA(a, h) | 0;
+              }
+              h = _A(a, b) | 0;
+              while (1) {
+                if (!h) break;
+                i = c[h >> 2] & 3;
+                g = c[(((i | 0) == 3 ? h : (h + 48) | 0) + 40) >> 2] | 0;
+                j = c[(g + 16) >> 2] | 0;
+                f =
+                  (f +
+                    (((c[
+                      ((c[
+                        ((c[((c[((c[(((i | 0) == 2 ? h : (h + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 20) >> 2] |
+                          0) +
+                          16) >>
+                          2
+                      ] |
+                        0) +
+                        236) >>
+                        2
+                    ] |
+                      0) >
+                      (c[((c[((c[(j + 20) >> 2] | 0) + 16) >> 2] | 0) + 236) >> 2] | 0)) &
+                      1)) |
+                  0;
+                if (!(c[(j + 8) >> 2] | 0)) f = ((Ch(a, g, d, e) | 0) + f) | 0;
+                h = $A(a, h) | 0;
+              }
+              return f | 0;
+            }
+            function Dh(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              f = 0;
+              while (1) {
+                e = Gh(a, b) | 0;
+                if (!e) break;
+                c[(d + (f << 2)) >> 2] = c[((c[(e + 16) >> 2] | 0) + 20) >> 2];
+                vC(b, e) | 0;
+                e = XA(a, e) | 0;
+                while (1) {
+                  if (!e) break;
+                  g = ZA(a, e) | 0;
+                  lB(a, e) | 0;
+                  e = g;
+                }
+                f = (f + 1) | 0;
+              }
+              return f | 0;
+            }
+            function Eh(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return ((c[a >> 2] | 0) - (c[b >> 2] | 0)) | 0;
+            }
+            function Fh(a) {
+              a = a | 0;
+              var b = 0,
+                c = 0;
+              b = jC(a) | 0;
+              while (1) {
+                if (!b) break;
+                c = kC(a, b) | 0;
+                vC(a, b) | 0;
+                b = c;
+              }
+              return;
+            }
+            function Gh(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0;
+              c = jC(b) | 0;
+              while (1) {
+                if (!c) {
+                  c = 0;
+                  break;
+                }
+                if (!(vB(a, c, 1, 0) | 0)) break;
+                c = kC(b, c) | 0;
+              }
+              return c | 0;
+            }
+            function Hh(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              Ih(b);
+              i = (b + 16) | 0;
+              f = 0;
+              e = 0;
+              while (1) {
+                if ((f | 0) >= (c[((c[i >> 2] | 0) + 220) >> 2] | 0)) break;
+                Jh(b, f);
+                f = (f + 1) | 0;
+                e = ((Kh(b, 0, d) | 0) + e) | 0;
+              }
+              Lh(b);
+              h = 1;
+              while (1) {
+                f = c[i >> 2] | 0;
+                g = c[(f + 180) >> 2] | 0;
+                if ((h | 0) > (g | 0)) break;
+                g = ((Mh(c[((c[(f + 184) >> 2] | 0) + (h << 2)) >> 2] | 0, d) | 0) + e) | 0;
+                h = (h + 1) | 0;
+                e = g;
+              }
+              do
+                if ((g | 0) > 0) {
+                  f = QA(b, 85806) | 0;
+                  if (f | 0 ? ((dP(f) | 0) << 24) >> 24 == 0 : 0) break;
+                  jl(b);
+                  a[193769] = 1;
+                  e = Kh(b, 2, d) | 0;
+                }
+              while (0);
+              Nh(b, e);
+              return;
+            }
+            function Ih(d) {
+              d = d | 0;
+              var e = 0;
+              if (0) TO();
+              a[193769] = 0;
+              c[46741] = d;
+              e = (((uB(gg(d) | 0) | 0) << 2) + 4) | 0;
+              c[46740] = JK(e) | 0;
+              c[46739] = JK(e) | 0;
+              Di(d);
+              e = (d + 16) | 0;
+              if (b[((c[e >> 2] | 0) + 136) >> 1] & 16) Ei(d);
+              Sk(d);
+              Gl(d, 1);
+              Fi(d);
+              Uh(d);
+              e = c[e >> 2] | 0;
+              c[46742] = b[(e + 236) >> 1];
+              c[46743] = b[(e + 238) >> 1];
+              return;
+            }
+            function Jh(a, d) {
+              a = a | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              a = c[(a + 16) >> 2] | 0;
+              c[(a + 192) >> 2] = c[((c[(a + 216) >> 2] | 0) + (d << 2)) >> 2];
+              a: do
+                if ((d | 0) > 0) {
+                  d = b[(a + 238) >> 1] | 0;
+                  e = (a + 196) | 0;
+                  a = b[(a + 236) >> 1] | 0;
+                  while (1) {
+                    if ((a | 0) > (d | 0)) break a;
+                    f = c[e >> 2] | 0;
+                    g = (f + (a << 6) + 4) | 0;
+                    f = (f + (a << 6)) | 0;
+                    c[g >> 2] = (c[g >> 2] | 0) + (c[f >> 2] << 2);
+                    c[f >> 2] = 0;
+                    a = (a + 1) | 0;
+                  }
+                }
+              while (0);
+              return;
+            }
+            function Kh(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              o = l;
+              l = (l + 32) | 0;
+              n = o;
+              if ((b | 0) > 1) {
+                e = ii(0) | 0;
+                ji(a);
+              } else e = 2147483647;
+              m = c[15712] | 0;
+              k = b;
+              f = 0;
+              b = e;
+              while (1) {
+                if ((k | 0) >= 3) break;
+                f = c[47136] | 0;
+                if ((k | 0) == 2)
+                  if ((e | 0) > (b | 0)) {
+                    li(a);
+                    e = b;
+                  } else e = b;
+                else {
+                  e = (f | 0) < 4 ? f : 4;
+                  if ((gg(a) | 0) == (a | 0)) ki(a, k);
+                  if (!k) Vh(a);
+                  Wh(a);
+                  g = ii(0) | 0;
+                  if ((g | 0) > (b | 0)) {
+                    f = e;
+                    e = g;
+                  } else {
+                    ji(a);
+                    f = e;
+                    e = g;
+                    b = g;
+                  }
+                }
+                g = 0;
+                j = 0;
+                while (1) {
+                  if ((j | 0) >= (f | 0)) break;
+                  if (0) {
+                    c[n >> 2] = k;
+                    c[(n + 4) >> 2] = j;
+                    c[(n + 8) >> 2] = g;
+                    c[(n + 12) >> 2] = e;
+                    c[(n + 16) >> 2] = b;
+                    w4(m, 86199, n) | 0;
+                  }
+                  i = (g + 1) | 0;
+                  if (((e | 0) == 0) | ((g | 0) >= (c[46744] | 0))) break;
+                  mi(a, j);
+                  e = ii(0) | 0;
+                  if ((e | 0) > (b | 0)) g = i;
+                  else {
+                    ji(a);
+                    g = +h[23215] * +(b | 0) > +(e | 0) ? 0 : i;
+                    b = e;
+                  }
+                  j = (j + 1) | 0;
+                }
+                if (!e) {
+                  e = 0;
+                  break;
+                } else k = (k + 1) | 0;
+              }
+              if ((e | 0) > (b | 0)) li(a);
+              if ((b | 0) > 0) {
+                ni(a, 0);
+                e = ii(0) | 0;
+              } else e = b;
+              a: do
+                if (d | 0) {
+                  b = 0;
+                  while (1) {
+                    if ((b | 0) >= (f | 0)) break a;
+                    oi(a);
+                    b = (b + 1) | 0;
+                  }
+                }
+              while (0);
+              l = o;
+              return e | 0;
+            }
+            function Lh(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              p = l;
+              l = (l + 16) | 0;
+              n = p;
+              hi(a);
+              k = (a + 16) | 0;
+              d = c[k >> 2] | 0;
+              m = c[15712] | 0;
+              j = b[(d + 236) >> 1] | 0;
+              while (1) {
+                if ((j | 0) > (b[(d + 238) >> 1] | 0)) break;
+                e = c[(d + 196) >> 2] | 0;
+                f = c[(e + (j << 6) + 8) >> 2] | 0;
+                c[(e + (j << 6)) >> 2] = f;
+                g = c[(e + (j << 6) + 12) >> 2] | 0;
+                c[(e + (j << 6) + 4) >> 2] = g;
+                i = 0;
+                while (1) {
+                  if ((i | 0) >= (f | 0)) break;
+                  h = c[(g + (i << 2)) >> 2] | 0;
+                  if (!h) {
+                    o = 6;
+                    break;
+                  }
+                  c[((c[(h + 16) >> 2] | 0) + 236) >> 2] = i;
+                  i = (i + 1) | 0;
+                }
+                if ((o | 0) == 6) {
+                  o = 0;
+                  if (0) {
+                    e = KB(a) | 0;
+                    d = c[((c[((c[k >> 2] | 0) + 196) >> 2] | 0) + (j << 6)) >> 2] | 0;
+                    c[n >> 2] = e;
+                    c[(n + 4) >> 2] = j;
+                    c[(n + 8) >> 2] = i;
+                    c[(n + 12) >> 2] = d;
+                    w4(m, 86149, n) | 0;
+                    d = c[k >> 2] | 0;
+                    e = c[(d + 196) >> 2] | 0;
+                  }
+                  c[(e + (j << 6)) >> 2] = i;
+                }
+                j = (j + 1) | 0;
+              }
+              l = p;
+              return;
+            }
+            function Mh(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              dl(a);
+              Uh(a);
+              Vh(a);
+              Wh(a);
+              f = (a + 16) | 0;
+              d = Kh(a, 2, b) | 0;
+              e = 1;
+              while (1) {
+                g = c[f >> 2] | 0;
+                if ((e | 0) > (c[(g + 180) >> 2] | 0)) break;
+                d = ((Mh(c[((c[(g + 184) >> 2] | 0) + (e << 2)) >> 2] | 0, b) | 0) + d) | 0;
+                e = (e + 1) | 0;
+              }
+              Xh(a);
+              return d | 0;
+            }
+            function Nh(d, e) {
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0.0;
+              q = l;
+              l = (l + 16) | 0;
+              p = q;
+              f = c[46739] | 0;
+              if (f | 0) {
+                U1(f);
+                c[46739] = 0;
+              }
+              f = c[46740] | 0;
+              if (f | 0) {
+                U1(f);
+                c[46740] = 0;
+              }
+              o = (d + 16) | 0;
+              f = 1;
+              while (1) {
+                g = c[o >> 2] | 0;
+                if ((f | 0) > (c[(g + 180) >> 2] | 0)) break;
+                Oh(c[((c[(g + 184) >> 2] | 0) + (f << 2)) >> 2] | 0);
+                f = (f + 1) | 0;
+              }
+              n = b[(g + 236) >> 1] | 0;
+              f = g;
+              while (1) {
+                if ((n | 0) > (b[(f + 238) >> 1] | 0)) break;
+                else m = 0;
+                while (1) {
+                  f = c[(f + 196) >> 2] | 0;
+                  if ((m | 0) >= (c[(f + (n << 6)) >> 2] | 0)) break;
+                  k = ((c[((c[(f + (n << 6) + 4) >> 2] | 0) + (m << 2)) >> 2] | 0) + 16) | 0;
+                  f = c[k >> 2] | 0;
+                  c[(f + 236) >> 2] = m;
+                  f = c[(f + 188) >> 2] | 0;
+                  a: do
+                    if (f | 0) {
+                      g = 0;
+                      while (1) {
+                        i = c[(f + (g << 2)) >> 2] | 0;
+                        if (!i) break a;
+                        j = (i + 16) | 0;
+                        if ((a[((c[j >> 2] | 0) + 112) >> 0] | 0) == 4) {
+                          uh(i);
+                          U1(c[j >> 2] | 0);
+                          U1(i);
+                          g = (g + -1) | 0;
+                          f = c[((c[k >> 2] | 0) + 188) >> 2] | 0;
+                        }
+                        g = (g + 1) | 0;
+                      }
+                    }
+                  while (0);
+                  m = (m + 1) | 0;
+                  f = c[o >> 2] | 0;
+                }
+                Ph(c[(f + (n << 6) + 56) >> 2] | 0);
+                n = (n + 1) | 0;
+                f = c[o >> 2] | 0;
+              }
+              if (0) {
+                o = c[15712] | 0;
+                d = KB(d) | 0;
+                r = +UO();
+                c[p >> 2] = d;
+                c[(p + 4) >> 2] = e;
+                h[(p + 8) >> 3] = r;
+                w4(o, 85817, p) | 0;
+              }
+              l = q;
+              return;
+            }
+            function Oh(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              g = (a + 16) | 0;
+              d = 1;
+              while (1) {
+                f = c[g >> 2] | 0;
+                if ((d | 0) > (c[(f + 180) >> 2] | 0)) break;
+                Oh(c[((c[(f + 184) >> 2] | 0) + (d << 2)) >> 2] | 0);
+                d = (d + 1) | 0;
+              }
+              a: do
+                if (c[(f + 268) >> 2] | 0) {
+                  e = b[(f + 236) >> 1] | 0;
+                  d = f;
+                  while (1) {
+                    if ((e | 0) > (b[(d + 238) >> 1] | 0)) break a;
+                    j = c[((c[(d + 268) >> 2] | 0) + (e << 2)) >> 2] | 0;
+                    i = Qh(a, j, -1) | 0;
+                    j = Qh(a, j, 1) | 0;
+                    c[((c[((c[g >> 2] | 0) + 268) >> 2] | 0) + (e << 2)) >> 2] = i;
+                    k = c[((c[((c[((gg(a) | 0) + 16) >> 2] | 0) + 196) >> 2] | 0) + (e << 6) + 4) >> 2] | 0;
+                    i = c[((c[(i + 16) >> 2] | 0) + 236) >> 2] | 0;
+                    f = c[g >> 2] | 0;
+                    h = c[(f + 196) >> 2] | 0;
+                    c[(h + (e << 6) + 4) >> 2] = k + (i << 2);
+                    c[(h + (e << 6)) >> 2] = (c[((c[(j + 16) >> 2] | 0) + 236) >> 2] | 0) + 1 - i;
+                    e = (e + 1) | 0;
+                    d = f;
+                  }
+                }
+              while (0);
+              return;
+            }
+            function Ph(a) {
+              a = a | 0;
+              if (a | 0) {
+                U1(c[(a + 8) >> 2] | 0);
+                U1(a);
+              }
+              return;
+            }
+            function Qh(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0,
+                e = 0;
+              d = b;
+              while (1) {
+                b = Rh(b, c) | 0;
+                if (!b) break;
+                if (Sh(a, b) | 0) {
+                  d = b;
+                  continue;
+                }
+                e = (Th(a, b) | 0) == 0;
+                d = e ? d : b;
+              }
+              return d | 0;
+            }
+            function Rh(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              if (!a) qa(85856, 85781, 1023, 85858);
+              if ((b | 0) < 0) {
+                a = c[(a + 16) >> 2] | 0;
+                e = c[(a + 236) >> 2] | 0;
+                if ((e | 0) > 0) {
+                  a = ((c[((c[((c[46741] | 0) + 16) >> 2] | 0) + 196) >> 2] | 0) + (c[(a + 232) >> 2] << 6) + 4) | 0;
+                  d = (e + -1) | 0;
+                  f = 7;
+                } else g = 0;
+              } else {
+                a = c[(a + 16) >> 2] | 0;
+                e = c[(a + 236) >> 2] | 0;
+                a = ((c[((c[((c[46741] | 0) + 16) >> 2] | 0) + 196) >> 2] | 0) + (c[(a + 232) >> 2] << 6) + 4) | 0;
+                d = (e + 1) | 0;
+                f = 7;
+              }
+              if ((f | 0) == 7) {
+                a = c[((c[a >> 2] | 0) + (d << 2)) >> 2] | 0;
+                if (a)
+                  if ((O(((c[((c[(a + 16) >> 2] | 0) + 236) >> 2] | 0) - e) | 0, b) | 0) > 0) g = a;
+                  else qa(85867, 85781, 1029, 85858);
+                else g = 0;
+              }
+              return g | 0;
+            }
+            function Sh(b, d) {
+              b = b | 0;
+              d = d | 0;
+              if (!(a[((c[(d + 16) >> 2] | 0) + 156) >> 0] | 0)) b = ((HC(b, d) | 0) != 0) & 1;
+              else b = 0;
+              return b | 0;
+            }
+            function Th(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              d = c[(d + 16) >> 2] | 0;
+              if (
+                ((a[(d + 156) >> 0] | 0) == 1 ? (c[(d + 176) >> 2] | 0) == 1 : 0) ? (c[(d + 184) >> 2] | 0) == 1 : 0
+              ) {
+                d = c[(d + 180) >> 2] | 0;
+                while (1) {
+                  d = c[d >> 2] | 0;
+                  e = c[(d + 16) >> 2] | 0;
+                  if (!(a[(e + 112) >> 0] | 0)) break;
+                  else d = (e + 116) | 0;
+                }
+                if (HC(b, d) | 0) d = 1;
+                else f = 7;
+              } else f = 7;
+              if ((f | 0) == 7) d = 0;
+              return d | 0;
+            }
+            function Uh(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              f = l;
+              l = (l + 16) | 0;
+              e = f;
+              d = c[47140] | 0;
+              a: do
+                if (((d | 0) != 0) | ((c[47161] | 0) != 0)) {
+                  d = aP(b, d, 0) | 0;
+                  if (d | 0) {
+                    switch (a[d >> 0] | 0) {
+                      case 0:
+                        break a;
+                      case 111: {
+                        if (!(s2(d, 86069) | 0)) {
+                          ci(b, 1);
+                          break a;
+                        }
+                        break;
+                      }
+                      case 105: {
+                        if (!(s2(d, 98735) | 0)) {
+                          ci(b, 0);
+                          break a;
+                        }
+                        break;
+                      }
+                      default: {
+                      }
+                    }
+                    c[e >> 2] = d;
+                    gA(1, 86073, e) | 0;
+                    break;
+                  }
+                  d = OD(b) | 0;
+                  while (1) {
+                    if (!d) break;
+                    if (!(Pj(d) | 0)) Uh(d);
+                    d = PD(d) | 0;
+                  }
+                  if (c[47161] | 0) di(b);
+                }
+              while (0);
+              l = f;
+              return;
+            }
+            function Vh(d) {
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = (d + 16) | 0;
+              e = c[k >> 2] | 0;
+              j = b[(e + 236) >> 1] | 0;
+              while (1) {
+                if ((j | 0) > (b[(e + 238) >> 1] | 0)) break;
+                else {
+                  f = 0;
+                  i = 0;
+                }
+                while (1) {
+                  g = c[(e + 196) >> 2] | 0;
+                  h = c[(g + (j << 6)) >> 2] | 0;
+                  if ((i | 0) >= (h | 0)) break;
+                  g = c[((c[((c[(g + (j << 6) + 4) >> 2] | 0) + (i << 2)) >> 2] | 0) + 16) >> 2] | 0;
+                  a[(g + 158) >> 0] = 0;
+                  a[(g + 157) >> 0] = 0;
+                  c[(g + 284) >> 2] = i;
+                  if (((f | 0) == 0) & ((c[(g + 192) >> 2] | 0) > 0)) {
+                    f = ai(h, h) | 0;
+                    e = c[k >> 2] | 0;
+                    c[((c[(e + 196) >> 2] | 0) + (j << 6) + 56) >> 2] = f;
+                    f = 1;
+                  }
+                  i = (i + 1) | 0;
+                }
+                a: do
+                  if (f) {
+                    i = 0;
+                    f = h;
+                    while (1) {
+                      if ((i | 0) >= (f | 0)) break a;
+                      h = c[((c[(g + (j << 6) + 4) >> 2] | 0) + (i << 2)) >> 2] | 0;
+                      if (!(a[((c[(h + 16) >> 2] | 0) + 157) >> 0] | 0)) {
+                        bi(d, h);
+                        e = c[k >> 2] | 0;
+                        f = c[(e + 196) >> 2] | 0;
+                        g = f;
+                        f = c[(f + (j << 6)) >> 2] | 0;
+                      }
+                      i = (i + 1) | 0;
+                    }
+                  }
+                while (0);
+                j = (j + 1) | 0;
+              }
+              return;
+            }
+            function Wh(d) {
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0;
+              s = (d + 16) | 0;
+              e = c[s >> 2] | 0;
+              if (a[(e + 240) >> 0] | 0) {
+                h = 0;
+                r = b[(e + 236) >> 1] | 0;
+                q = 0;
+                i = 0;
+                a: while (1) {
+                  if ((r | 0) > (b[(e + 238) >> 1] | 0)) break;
+                  f = c[(e + 196) >> 2] | 0;
+                  g = c[(f + (r << 6)) >> 2] | 0;
+                  if (!g) {
+                    g = q;
+                    f = i;
+                  } else {
+                    f = c[(f + (r << 6) + 4) >> 2] | 0;
+                    o = c[((c[((c[f >> 2] | 0) + 16) >> 2] | 0) + 236) >> 2] | 0;
+                    e = 0;
+                    while (1) {
+                      if ((e | 0) >= (g | 0)) break;
+                      a[((c[((c[(f + (e << 2)) >> 2] | 0) + 16) >> 2] | 0) + 157) >> 0] = 0;
+                      e = (e + 1) | 0;
+                    }
+                    e = ((e << 2) + 4) | 0;
+                    if (!h) p = KK(e) | 0;
+                    else p = MK(i, e) | 0;
+                    m = 0;
+                    n = 0;
+                    while (1) {
+                      e = c[s >> 2] | 0;
+                      f = c[(e + 196) >> 2] | 0;
+                      g = c[(f + (r << 6)) >> 2] | 0;
+                      if ((g | 0) <= (n | 0)) break;
+                      j =
+                        c[
+                          ((c[(f + (r << 6) + 4) >> 2] | 0) +
+                            ((((c[(e + 116) >> 2] & 1) | 0) == 0 ? (g + ~n) | 0 : n) << 2)) >>
+                            2
+                        ] | 0;
+                      l = (j + 16) | 0;
+                      e = 0;
+                      k = 0;
+                      while (1) {
+                        i = c[l >> 2] | 0;
+                        if ((e | 0) >= (c[(i + 200) >> 2] | 0)) {
+                          f = 0;
+                          g = 0;
+                          e = i;
+                          break;
+                        }
+                        i = (k + (((Yh(d, c[((c[(i + 196) >> 2] | 0) + (e << 2)) >> 2] | 0) | 0) != 0) & 1)) | 0;
+                        e = (e + 1) | 0;
+                        k = i;
+                      }
+                      while (1) {
+                        if ((g | 0) >= (c[(e + 192) >> 2] | 0)) break;
+                        i = (f + (((Yh(d, c[((c[(e + 188) >> 2] | 0) + (g << 2)) >> 2] | 0) | 0) != 0) & 1)) | 0;
+                        f = i;
+                        g = (g + 1) | 0;
+                        e = c[l >> 2] | 0;
+                      }
+                      if (f | k)
+                        if (((k | 0) == 0) & ((a[(e + 157) >> 0] | 0) == 0))
+                          e = ((Zh(d, j, (p + (m << 2)) | 0, r) | 0) + m) | 0;
+                        else e = m;
+                      else {
+                        c[(p + (m << 2)) >> 2] = j;
+                        e = (m + 1) | 0;
+                      }
+                      m = e;
+                      n = (n + 1) | 0;
+                    }
+                    b: do
+                      if (m) {
+                        c: do
+                          if (!(c[(e + 116) >> 2] & 1)) {
+                            f = p;
+                            e = (p + (m << 2)) | 0;
+                            while (1) {
+                              e = (e + -4) | 0;
+                              if (f >>> 0 >= e >>> 0) {
+                                g = 0;
+                                break c;
+                              }
+                              n = c[f >> 2] | 0;
+                              c[f >> 2] = c[e >> 2];
+                              c[e >> 2] = n;
+                              f = (f + 4) | 0;
+                            }
+                          } else g = 0;
+                        while (0);
+                        while (1) {
+                          e = c[s >> 2] | 0;
+                          i = c[(e + 196) >> 2] | 0;
+                          f = c[(i + (r << 6)) >> 2] | 0;
+                          if ((g | 0) >= (f | 0)) {
+                            m = 0;
+                            g = i;
+                            break;
+                          }
+                          n = c[(p + (g << 2)) >> 2] | 0;
+                          c[((c[(i + (r << 6) + 4) >> 2] | 0) + (g << 2)) >> 2] = n;
+                          c[((c[(n + 16) >> 2] | 0) + 236) >> 2] = g + o;
+                          g = (g + 1) | 0;
+                        }
+                        while (1) {
+                          if ((m | 0) >= (f | 0)) break b;
+                          l = ((c[((c[(g + (r << 6) + 4) >> 2] | 0) + (m << 2)) >> 2] | 0) + 16) | 0;
+                          i = c[((c[l >> 2] | 0) + 188) >> 2] | 0;
+                          if (i) {
+                            k = 0;
+                            f = i;
+                            while (1) {
+                              g = c[(f + (k << 2)) >> 2] | 0;
+                              e = c[s >> 2] | 0;
+                              if (!g) break;
+                              j = c[g >> 2] & 3;
+                              i =
+                                c[
+                                  ((c[((c[(((j | 0) == 2 ? g : (g + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                                    236) >>
+                                    2
+                                ] | 0;
+                              j =
+                                c[
+                                  ((c[((c[(((j | 0) == 3 ? g : (g + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 236) >>
+                                    2
+                                ] | 0;
+                              if (!(c[(e + 116) >> 2] & 1))
+                                if ((i | 0) < (j | 0)) t = 36;
+                                else e = k;
+                              else if ((i | 0) > (j | 0)) t = 36;
+                              else e = k;
+                              if ((t | 0) == 36) {
+                                t = 0;
+                                if (Yh(d, g) | 0) {
+                                  t = 37;
+                                  break a;
+                                }
+                                uh(g);
+                                _h(d, g);
+                                e = (k + -1) | 0;
+                                f = c[((c[l >> 2] | 0) + 188) >> 2] | 0;
+                              }
+                              k = (e + 1) | 0;
+                            }
+                            f = c[(e + 196) >> 2] | 0;
+                            g = f;
+                            f = c[(f + (r << 6)) >> 2] | 0;
+                          }
+                          m = (m + 1) | 0;
+                        }
+                      }
+                    while (0);
+                    a[((c[((c[((c[46741] | 0) + 16) >> 2] | 0) + 196) >> 2] | 0) + (r << 6) + 49) >> 0] = 0;
+                    h = p;
+                    g = p;
+                    f = p;
+                  }
+                  r = (r + 1) | 0;
+                  q = g;
+                  i = f;
+                }
+                if ((t | 0) == 37) qa(85915, 85781, 1561, 85954);
+                if (h | 0) U1(q);
+              }
+              return;
+            }
+            function Xh(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0;
+              e = (a + 16) | 0;
+              a = c[e >> 2] | 0;
+              a: do
+                if (c[(a + 268) >> 2] | 0) {
+                  d = b[(a + 236) >> 1] | 0;
+                  while (1) {
+                    if ((d | 0) > (b[(a + 238) >> 1] | 0)) break a;
+                    c[((c[(a + 268) >> 2] | 0) + (d << 2)) >> 2] =
+                      c[c[((c[(a + 196) >> 2] | 0) + (d << 6) + 4) >> 2] >> 2];
+                    d = (d + 1) | 0;
+                    a = c[e >> 2] | 0;
+                  }
+                }
+              while (0);
+              return;
+            }
+            function Yh(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if (
+                (c[((c[(b + 16) >> 2] | 0) + 156) >> 2] | 0) != 0
+                  ? ($h(a, c[((((c[b >> 2] & 3) | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0) | 0) != 0
+                  : 0
+              )
+                a = (($h(a, c[((((c[b >> 2] & 3) | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0) | 0) != 0) & 1;
+              else a = 0;
+              return a | 0;
+            }
+            function Zh(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              l = (d + 16) | 0;
+              g = c[l >> 2] | 0;
+              a[(g + 157) >> 0] = 1;
+              a: do
+                if ((c[(g + 192) >> 2] | 0) > 0) {
+                  h = 0;
+                  j = 0;
+                  while (1) {
+                    i = c[((c[(g + 188) >> 2] | 0) + (j << 2)) >> 2] | 0;
+                    if (!i) break a;
+                    if (
+                      (Yh(b, i) | 0) != 0
+                        ? ((k = c[((((c[i >> 2] & 3) | 0) == 2 ? i : (i + -48) | 0) + 40) >> 2] | 0),
+                          (a[((c[(k + 16) >> 2] | 0) + 157) >> 0] | 0) == 0)
+                        : 0
+                    )
+                      h = ((Zh(b, k, (e + (h << 2)) | 0, f) | 0) + h) | 0;
+                    j = (j + 1) | 0;
+                    g = c[l >> 2] | 0;
+                  }
+                } else h = 0;
+              while (0);
+              if ((c[(g + 232) >> 2] | 0) == (f | 0)) {
+                c[(e + (h << 2)) >> 2] = d;
+                return (h + 1) | 0;
+              } else qa(85967, 85781, 1490, 85983);
+              return 0;
+            }
+            function _h(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              i = c[d >> 2] & 3;
+              j = c[(((i | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0;
+              f = c[((c[(j + 16) >> 2] | 0) + 188) >> 2] | 0;
+              a: do
+                if (!f) {
+                  e = (d + 48) | 0;
+                  m = 15;
+                } else {
+                  l = (d + 48) | 0;
+                  g = (((i | 0) == 3 ? d : l) + 40) | 0;
+                  e = 0;
+                  while (1) {
+                    h = c[(f + (e << 2)) >> 2] | 0;
+                    if (!h) {
+                      e = l;
+                      m = 15;
+                      break a;
+                    }
+                    if ((c[((((c[h >> 2] & 3) | 0) == 2 ? h : (h + -48) | 0) + 40) >> 2] | 0) == (c[g >> 2] | 0)) break;
+                    else e = (e + 1) | 0;
+                  }
+                  vh(d, h);
+                  e = ((c[(d + 16) >> 2] | 0) + 172) | 0;
+                  if (!(c[e >> 2] | 0)) c[e >> 2] = h;
+                  e = c[(h + 16) >> 2] | 0;
+                  if ((a[(e + 112) >> 0] | 0) == 4 ? ((k = (e + 116) | 0), (c[k >> 2] | 0) == 0) : 0) c[k >> 2] = d;
+                  e = c[((c[((((c[d >> 2] & 3) | 0) == 3 ? d : l) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                  f = c[(e + 204) >> 2] | 0;
+                  if (!f) e = KK(((c[(e + 208) >> 2] << 2) + 8) | 0) | 0;
+                  else e = MK(f, ((c[(e + 208) >> 2] << 2) + 8) | 0) | 0;
+                  c[((c[((c[((((c[d >> 2] & 3) | 0) == 3 ? d : l) + 40) >> 2] | 0) + 16) >> 2] | 0) + 204) >> 2] = e;
+                  i = c[((c[((((c[d >> 2] & 3) | 0) == 3 ? d : l) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                  j = c[(i + 204) >> 2] | 0;
+                  i = (i + 208) | 0;
+                  k = c[i >> 2] | 0;
+                  c[i >> 2] = k + 1;
+                  c[(j + (k << 2)) >> 2] = d;
+                  d = c[((c[((((c[d >> 2] & 3) | 0) == 3 ? d : l) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                  c[((c[(d + 204) >> 2] | 0) + (c[(d + 208) >> 2] << 2)) >> 2] = 0;
+                }
+              while (0);
+              if ((m | 0) == 15) {
+                m = mh(j, c[(((i | 0) == 3 ? d : e) + 40) >> 2] | 0, d) | 0;
+                l = c[(d + 16) >> 2] | 0;
+                d = c[(m + 16) >> 2] | 0;
+                a[(d + 112) >> 0] = (a[(l + 112) >> 0] | 0) == 4 ? 4 : 3;
+                c[(d + 96) >> 2] = c[(l + 96) >> 2];
+                th(b, m);
+              }
+              return;
+            }
+            function $h(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0;
+              c = Sh(a, b) | 0;
+              return Th(a, b) | 0 | c | 0;
+            }
+            function ai(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = JK(12) | 0;
+              c[d >> 2] = a;
+              c[(d + 4) >> 2] = b;
+              c[(d + 8) >> 2] = JK(O(b, a) | 0) | 0;
+              return d | 0;
+            }
+            function bi(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0;
+              o = (d + 16) | 0;
+              l = c[o >> 2] | 0;
+              k = c[((c[((c[(b + 16) >> 2] | 0) + 196) >> 2] | 0) + (c[(l + 232) >> 2] << 6) + 56) >> 2] | 0;
+              a[(l + 157) >> 0] = 1;
+              a[(l + 158) >> 0] = 1;
+              l = (c[((c[((gg(b) | 0) + 16) >> 2] | 0) + 180) >> 2] | 0) > 0;
+              e = c[o >> 2] | 0;
+              f = c[(e + 188) >> 2] | 0;
+              a: do
+                if (f) {
+                  m = (k + 4) | 0;
+                  n = (k + 8) | 0;
+                  d = 0;
+                  b: while (1) {
+                    j = c[(f + (d << 2)) >> 2] | 0;
+                    if (!j) {
+                      p = e;
+                      break a;
+                    }
+                    if (l) {
+                      if (
+                        (HC(b, c[((((c[j >> 2] & 3) | 0) == 3 ? j : (j + 48) | 0) + 40) >> 2] | 0) | 0) != 0
+                          ? (HC(b, c[((((c[j >> 2] & 3) | 0) == 2 ? j : (j + -48) | 0) + 40) >> 2] | 0) | 0) != 0
+                          : 0
+                      )
+                        q = 7;
+                    } else q = 7;
+                    do
+                      if ((q | 0) == 7) {
+                        q = 0;
+                        h = (j + 16) | 0;
+                        if (c[((c[h >> 2] | 0) + 156) >> 2] | 0) {
+                          e = c[j >> 2] & 3;
+                          g = (j + -48) | 0;
+                          r = c[((c[(((e | 0) == 2 ? j : g) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                          i = c[(r + 284) >> 2] | 0;
+                          f = (i | 0) < (c[k >> 2] | 0);
+                          if ((a[(r + 158) >> 0] | 0) == 1) {
+                            if (!f) {
+                              q = 10;
+                              break b;
+                            }
+                            e =
+                              c[
+                                ((c[((c[(((e | 0) == 3 ? j : (j + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 284) >> 2
+                              ] | 0;
+                            f = c[m >> 2] | 0;
+                            if ((e | 0) >= (f | 0)) {
+                              q = 12;
+                              break b;
+                            }
+                            a[((c[n >> 2] | 0) + ((O(f, i) | 0) + e)) >> 0] = 1;
+                            uh(j);
+                            d = (d + -1) | 0;
+                            if ((a[((c[h >> 2] | 0) + 112) >> 0] | 0) == 4) break;
+                            _h(b, j);
+                            break;
+                          } else {
+                            if (!f) {
+                              q = 16;
+                              break b;
+                            }
+                            e =
+                              c[
+                                ((c[((c[(((e | 0) == 3 ? j : (j + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 284) >> 2
+                              ] | 0;
+                            f = c[m >> 2] | 0;
+                            if ((e | 0) >= (f | 0)) {
+                              q = 18;
+                              break b;
+                            }
+                            a[((c[n >> 2] | 0) + ((O(f, e) | 0) + i)) >> 0] = 1;
+                            e = c[((((c[j >> 2] & 3) | 0) == 2 ? j : g) + 40) >> 2] | 0;
+                            if (a[((c[(e + 16) >> 2] | 0) + 157) >> 0] | 0) break;
+                            bi(b, e);
+                            break;
+                          }
+                        }
+                      }
+                    while (0);
+                    f = c[o >> 2] | 0;
+                    d = (d + 1) | 0;
+                    e = f;
+                    f = c[(f + 188) >> 2] | 0;
+                  }
+                  if ((q | 0) == 10) qa(85993, 85781, 1251, 86025);
+                  else if ((q | 0) == 12) qa(86037, 85781, 1252, 86025);
+                  else if ((q | 0) == 16) qa(85993, 85781, 1260, 86025);
+                  else if ((q | 0) == 18) qa(86037, 85781, 1261, 86025);
+                } else p = e;
+              while (0);
+              a[(p + 158) >> 0] = 0;
+              return;
+            }
+            function ci(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0;
+              c = jC(a) | 0;
+              while (1) {
+                if (!c) break;
+                ei(a, c, b);
+                c = kC(a, c) | 0;
+              }
+              return;
+            }
+            function di(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              g = l;
+              l = (l + 16) | 0;
+              f = g;
+              d = jC(b) | 0;
+              while (1) {
+                if (!d) break;
+                e = aP(d, c[47161] | 0, 0) | 0;
+                a: do
+                  if (e | 0) {
+                    switch (a[e >> 0] | 0) {
+                      case 0:
+                        break a;
+                      case 111: {
+                        if (!(s2(e, 86069) | 0)) {
+                          ei(b, d, 1);
+                          break a;
+                        }
+                        break;
+                      }
+                      case 105: {
+                        if (!(s2(e, 98735) | 0)) {
+                          ei(b, d, 0);
+                          break a;
+                        }
+                        break;
+                      }
+                      default: {
+                      }
+                    }
+                    h = KB(d) | 0;
+                    c[f >> 2] = e;
+                    c[(f + 4) >> 2] = h;
+                    gA(1, 86104, f) | 0;
+                  }
+                while (0);
+                d = kC(b, d) | 0;
+              }
+              l = g;
+              return;
+            }
+            function ei(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              j = c[46740] | 0;
+              h = (d + 16) | 0;
+              f = c[h >> 2] | 0;
+              a: do
+                if (!(c[(f + 212) >> 2] | 0)) {
+                  i = (e | 0) != 0;
+                  b: do
+                    if (i) {
+                      g = 0;
+                      d = 0;
+                      e = f;
+                      while (1) {
+                        f = c[((c[(e + 180) >> 2] | 0) + (g << 2)) >> 2] | 0;
+                        if (!f) break b;
+                        if (!(fi(f) | 0)) {
+                          c[(j + (d << 2)) >> 2] = f;
+                          d = (d + 1) | 0;
+                          e = c[h >> 2] | 0;
+                        }
+                        g = (g + 1) | 0;
+                      }
+                    } else {
+                      g = 0;
+                      d = 0;
+                      e = f;
+                      while (1) {
+                        f = c[((c[(e + 172) >> 2] | 0) + (g << 2)) >> 2] | 0;
+                        if (!f) break b;
+                        if (!(fi(f) | 0)) {
+                          c[(j + (d << 2)) >> 2] = f;
+                          d = (d + 1) | 0;
+                          e = c[h >> 2] | 0;
+                        }
+                        g = (g + 1) | 0;
+                      }
+                    }
+                  while (0);
+                  if ((d | 0) >= 2) {
+                    c[(j + (d << 2)) >> 2] = 0;
+                    o4(j, d, 4, 61);
+                    h = i ? 2 : 3;
+                    g = i ? -1 : 1;
+                    f = 1;
+                    while (1) {
+                      d = c[(j + (f << 2)) >> 2] | 0;
+                      if (!d) break a;
+                      e = c[(j + ((f + -1) << 2)) >> 2] | 0;
+                      e = c[((((c[e >> 2] & 3) | 0) == (h | 0) ? e : (e + ((g * 48) | 0)) | 0) + 40) >> 2] | 0;
+                      d = c[((((c[d >> 2] & 3) | 0) == (h | 0) ? d : (d + ((g * 48) | 0)) | 0) + 40) >> 2] | 0;
+                      if (fh(e, d) | 0) break a;
+                      i = mh(e, d, 0) | 0;
+                      a[((c[(i + 16) >> 2] | 0) + 112) >> 0] = 4;
+                      th(b, i);
+                      f = (f + 1) | 0;
+                    }
+                  }
+                }
+              while (0);
+              return;
+            }
+            function fi(a) {
+              a = a | 0;
+              var b = 0;
+              while (1) {
+                b = c[((c[(a + 16) >> 2] | 0) + 116) >> 2] | 0;
+                if (!b) break;
+                else a = b;
+              }
+              b = c[a >> 2] & 3;
+              return (
+                ((c[((c[((c[(((b | 0) == 3 ? a : (a + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 212) >> 2] | 0) !=
+                  (c[((c[((c[(((b | 0) == 2 ? a : (a + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 212) >> 2] | 0)) |
+                0
+              );
+            }
+            function gi(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return (((c[c[a >> 2] >> 2] | 0) >>> 4) - ((c[c[b >> 2] >> 2] | 0) >>> 4)) | 0;
+            }
+            function hi(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              f = c[(a + 16) >> 2] | 0;
+              g = (f + 220) | 0;
+              h = c[g >> 2] | 0;
+              if ((h | 0) >= 2) {
+                i = (f + 216) | 0;
+                a = 0;
+                e = 0;
+                while (1) {
+                  if ((e | 0) >= (h | 0)) break;
+                  d = c[((c[i >> 2] | 0) + (e << 2)) >> 2] | 0;
+                  if (a | 0) c[((c[(a + 16) >> 2] | 0) + 164) >> 2] = d;
+                  j = c[(d + 16) >> 2] | 0;
+                  c[(j + 168) >> 2] = a;
+                  a = d;
+                  d = j;
+                  while (1) {
+                    d = c[(d + 164) >> 2] | 0;
+                    if (!d) break;
+                    a = d;
+                    d = c[(d + 16) >> 2] | 0;
+                  }
+                  e = (e + 1) | 0;
+                }
+                c[g >> 2] = 1;
+                c[(f + 192) >> 2] = c[c[(f + 216) >> 2] >> 2];
+                b[(f + 236) >> 1] = c[46742];
+                b[(f + 238) >> 1] = c[46743];
+              }
+              return;
+            }
+            function ii(d) {
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              i = c[46741] | 0;
+              j = (i + 16) | 0;
+              f = c[j >> 2] | 0;
+              g = 0;
+              h = b[(f + 236) >> 1] | 0;
+              while (1) {
+                if ((h | 0) >= (b[(f + 238) >> 1] | 0)) break;
+                d = c[(f + 196) >> 2] | 0;
+                if (!(a[(d + (h << 6) + 49) >> 0] | 0)) {
+                  e = Bi(i, h) | 0;
+                  d = c[j >> 2] | 0;
+                  f = c[(d + 196) >> 2] | 0;
+                  c[(f + (h << 6) + 52) >> 2] = e;
+                  a[(f + (h << 6) + 49) >> 0] = 1;
+                } else {
+                  e = c[(d + (h << 6) + 52) >> 2] | 0;
+                  d = f;
+                }
+                g = (e + g) | 0;
+                h = (h + 1) | 0;
+                f = d;
+              }
+              return g | 0;
+            }
+            function ji(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0;
+              a = c[(a + 16) >> 2] | 0;
+              g = b[(a + 238) >> 1] | 0;
+              i = (a + 196) | 0;
+              a = b[(a + 236) >> 1] | 0;
+              while (1) {
+                if ((a | 0) > (g | 0)) break;
+                f = c[i >> 2] | 0;
+                e = c[(f + (a << 6)) >> 2] | 0;
+                f = (f + (a << 6) + 4) | 0;
+                d = 0;
+                while (1) {
+                  if ((d | 0) >= (e | 0)) break;
+                  j = c[((c[((c[f >> 2] | 0) + (d << 2)) >> 2] | 0) + 16) >> 2] | 0;
+                  h[(j + 16) >> 3] = +(c[(j + 236) >> 2] | 0);
+                  d = (d + 1) | 0;
+                }
+                a = (a + 1) | 0;
+              }
+              return;
+            }
+            function ki(d, e) {
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0;
+              r = l;
+              l = (l + 16) | 0;
+              m = r;
+              n = (d + 16) | 0;
+              o = VO(c[((c[n >> 2] | 0) + 232) >> 2] | 0) | 0;
+              j = c[n >> 2] | 0;
+              f = (j + 192) | 0;
+              g = f;
+              while (1) {
+                g = c[g >> 2] | 0;
+                if (!g) break;
+                g = c[(g + 16) >> 2] | 0;
+                a[(g + 157) >> 0] = 0;
+                g = (g + 164) | 0;
+              }
+              h = b[(j + 238) >> 1] | 0;
+              i = (j + 196) | 0;
+              g = b[(j + 236) >> 1] | 0;
+              while (1) {
+                if ((g | 0) > (h | 0)) break;
+                c[((c[i >> 2] | 0) + (g << 6)) >> 2] = 0;
+                g = (g + 1) | 0;
+              }
+              i = (e | 0) == 0;
+              while (1) {
+                g = c[f >> 2] | 0;
+                if (!g) break;
+                h = (g + 16) | 0;
+                f = c[h >> 2] | 0;
+                if (
+                  (c[c[(i ? (f + 172) | 0 : (f + 180) | 0) >> 2] >> 2] | 0) == 0
+                    ? ((k = (f + 157) | 0), (a[k >> 0] | 0) == 0)
+                    : 0
+                ) {
+                  a[k >> 0] = 1;
+                  XO(o, g);
+                  while (1) {
+                    f = YO(o) | 0;
+                    if (!f) break;
+                    if ((a[((c[(f + 16) >> 2] | 0) + 159) >> 0] | 0) == 7) {
+                      il(d, f, e, o);
+                      continue;
+                    } else {
+                      zi(d, f);
+                      Ai(o, f, e);
+                      continue;
+                    }
+                  }
+                  f = c[h >> 2] | 0;
+                }
+                f = (f + 164) | 0;
+              }
+              if (YO(o) | 0) gA(1, 86312, m) | 0;
+              f = c[n >> 2] | 0;
+              j = b[(f + 236) >> 1] | 0;
+              while (1) {
+                if ((j | 0) > (b[(f + 238) >> 1] | 0)) break;
+                a[((c[((c[((c[46741] | 0) + 16) >> 2] | 0) + 196) >> 2] | 0) + (j << 6) + 49) >> 0] = 0;
+                if (
+                  ((c[(f + 116) >> 2] & 1) | 0) != 0
+                    ? ((p = c[(f + 196) >> 2] | 0), (q = c[(p + (j << 6)) >> 2] | 0), (q | 0) > 0)
+                    : 0
+                ) {
+                  g = c[(p + (j << 6) + 4) >> 2] | 0;
+                  h = (q + -1) | 0;
+                  i = ((h | 0) / 2) | 0;
+                  f = 0;
+                  while (1) {
+                    if ((f | 0) > (i | 0)) break;
+                    ti(c[(g + (f << 2)) >> 2] | 0, c[(g + ((h - f) << 2)) >> 2] | 0);
+                    f = (f + 1) | 0;
+                  }
+                  f = c[n >> 2] | 0;
+                }
+                j = (j + 1) | 0;
+              }
+              if ((gg(d) | 0) == (d | 0) ? (ii(0) | 0) > 0 : 0) ni(d, 0);
+              WO(o);
+              l = r;
+              return;
+            }
+            function li(d) {
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              n = (d + 16) | 0;
+              d = c[n >> 2] | 0;
+              f = b[(d + 236) >> 1] | 0;
+              e = b[(d + 238) >> 1] | 0;
+              l = (e << 16) >> 16;
+              m = (d + 196) | 0;
+              g = f;
+              while (1) {
+                if ((g | 0) > (l | 0)) break;
+                k = c[m >> 2] | 0;
+                j = c[(k + (g << 6)) >> 2] | 0;
+                k = (k + (g << 6) + 4) | 0;
+                i = 0;
+                while (1) {
+                  if ((i | 0) >= (j | 0)) break;
+                  o = c[((c[((c[k >> 2] | 0) + (i << 2)) >> 2] | 0) + 16) >> 2] | 0;
+                  c[(o + 236) >> 2] = ~~+h[(o + 16) >> 3];
+                  i = (i + 1) | 0;
+                }
+                g = (g + 1) | 0;
+              }
+              while (1) {
+                if ((f | 0) > (((e << 16) >> 16) | 0)) break;
+                a[((c[((c[((c[46741] | 0) + 16) >> 2] | 0) + 196) >> 2] | 0) + (f << 6) + 49) >> 0] = 0;
+                o = c[(d + 196) >> 2] | 0;
+                o4(c[(o + (f << 6) + 4) >> 2] | 0, c[(o + (f << 6)) >> 2] | 0, 4, 62);
+                o = c[n >> 2] | 0;
+                f = (f + 1) | 0;
+                e = b[(o + 238) >> 1] | 0;
+                d = o;
+              }
+              return;
+            }
+            function mi(a, d) {
+              a = a | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              g = (((d | 0) % 4 | 0 | 0) < 2) & 1;
+              e = c[(a + 16) >> 2] | 0;
+              if (!(d & 1)) {
+                d = b[(e + 236) >> 1] | 0;
+                f = 1;
+                e = b[(e + 238) >> 1] | 0;
+                d =
+                  ((((d << 16) >> 16 <= (b[((c[((c[46741] | 0) + 16) >> 2] | 0) + 236) >> 1] | 0)) & 1) +
+                    ((d << 16) >> 16)) |
+                  0;
+              } else {
+                d = b[(e + 238) >> 1] | 0;
+                f = -1;
+                e = b[(e + 236) >> 1] | 0;
+                d =
+                  (((((d << 16) >> 16 >= (b[((c[((c[46741] | 0) + 16) >> 2] | 0) + 238) >> 1] | 0)) << 31) >> 31) +
+                    ((d << 16) >> 16)) |
+                  0;
+              }
+              e = (f + e) | 0;
+              while (1) {
+                if ((d | 0) == (e | 0)) break;
+                wi(a, d, g, (vi(a, d, (d - f) | 0) | 0) & 255);
+                d = (d + f) | 0;
+              }
+              ni(a, g ^ 1);
+              return;
+            }
+            function ni(d, e) {
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = (d + 16) | 0;
+              g = c[k >> 2] | 0;
+              i = b[(g + 236) >> 1] | 0;
+              j = b[(g + 238) >> 1] | 0;
+              h = (g + 196) | 0;
+              f = (i << 16) >> 16;
+              while (1) {
+                if ((f | 0) > (j | 0)) {
+                  h = i;
+                  break;
+                }
+                a[((c[h >> 2] | 0) + (f << 6) + 48) >> 0] = 1;
+                f = (f + 1) | 0;
+              }
+              while (1) {
+                f = 0;
+                h = (h << 16) >> 16;
+                while (1) {
+                  if ((h | 0) > (b[(g + 238) >> 1] | 0)) break;
+                  if (a[((c[(g + 196) >> 2] | 0) + (h << 6) + 48) >> 0] | 0) {
+                    f = ((ui(d, h, e) | 0) + f) | 0;
+                    g = c[k >> 2] | 0;
+                  }
+                  h = (h + 1) | 0;
+                }
+                if ((f | 0) <= 0) break;
+                h = b[(g + 236) >> 1] | 0;
+              }
+              return;
+            }
+            function oi(d) {
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              o = (d + 16) | 0;
+              e = c[o >> 2] | 0;
+              n = b[(e + 238) >> 1] | 0;
+              a: while (1) {
+                if ((n | 0) < (b[(e + 236) >> 1] | 0)) {
+                  e = 16;
+                  break;
+                }
+                f = c[(e + 196) >> 2] | 0;
+                a[(f + (n << 6) + 48) >> 0] = 0;
+                p = (n | 0) > 0;
+                q = (n + 1) | 0;
+                g = 0;
+                b: while (1) {
+                  l = ((c[(f + (n << 6)) >> 2] | 0) + -1) | 0;
+                  m = (f + (n << 6) + 4) | 0;
+                  k = (f + (q << 6)) | 0;
+                  while (1) {
+                    if ((g | 0) >= (l | 0)) break b;
+                    j = c[m >> 2] | 0;
+                    i = c[(j + (g << 2)) >> 2] | 0;
+                    g = (g + 1) | 0;
+                    j = c[(j + (g << 2)) >> 2] | 0;
+                    if ((c[((c[(i + 16) >> 2] | 0) + 236) >> 2] | 0) >= (c[((c[(j + 16) >> 2] | 0) + 236) >> 2] | 0)) {
+                      e = 7;
+                      break a;
+                    }
+                    if (pi(d, i, j) | 0) continue;
+                    if (p) {
+                      f = qi(i, j) | 0;
+                      h = qi(j, i) | 0;
+                    } else {
+                      f = 0;
+                      h = 0;
+                    }
+                    if ((c[k >> 2] | 0) > 0) {
+                      f = ((ri(i, j) | 0) + f) | 0;
+                      h = ((ri(j, i) | 0) + h) | 0;
+                    }
+                    if ((h | 0) <= (f | 0)) break;
+                  }
+                  si(d, n, i, j);
+                  e = c[o >> 2] | 0;
+                  f = c[(e + 196) >> 2] | 0;
+                }
+                n = (n + -1) | 0;
+              }
+              if ((e | 0) == 7) qa(86263, 85781, 721, 86289);
+              else if ((e | 0) == 16) return;
+            }
+            function pi(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              j = c[(d + 16) >> 2] | 0;
+              i = c[(j + 212) >> 2] | 0;
+              f = c[(e + 16) >> 2] | 0;
+              g = c[(f + 212) >> 2] | 0;
+              h = (i | 0) != (g | 0);
+              do
+                if (!(a[193769] | 0))
+                  if (((g | 0) == 0) | (((i | 0) == 0) | (h ^ 1))) k = 9;
+                  else {
+                    if ((a[(j + 159) >> 0] | 0) == 7 ? (a[(j + 156) >> 0] | 0) == 1 : 0) {
+                      b = 0;
+                      break;
+                    }
+                    if ((a[(f + 159) >> 0] | 0) == 7 ? (a[(f + 156) >> 0] | 0) == 1 : 0) {
+                      b = 0;
+                      break;
+                    }
+                    b = 1;
+                  }
+                else if (h) b = 1;
+                else k = 9;
+              while (0);
+              if ((k | 0) == 9) {
+                f = c[(b + 16) >> 2] | 0;
+                b = c[((c[(f + 196) >> 2] | 0) + (c[(j + 232) >> 2] << 6) + 56) >> 2] | 0;
+                if (!b) b = 0;
+                else {
+                  j = ((c[(f + 116) >> 2] & 1) | 0) == 0;
+                  k = O(c[(b + 4) >> 2] | 0, c[((c[((j ? d : e) + 16) >> 2] | 0) + 284) >> 2] | 0) | 0;
+                  b =
+                    a[((c[(b + 8) >> 2] | 0) + ((c[((c[((j ? e : d) + 16) >> 2] | 0) + 284) >> 2] | 0) + k)) >> 0] | 0;
+                }
+              }
+              return b | 0;
+            }
+            function qi(a, d) {
+              a = a | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0;
+              l = (a + 16) | 0;
+              j = c[((c[(d + 16) >> 2] | 0) + 172) >> 2] | 0;
+              d = 0;
+              while (1) {
+                a = c[j >> 2] | 0;
+                if (!a) break;
+                i = c[(a + 16) >> 2] | 0;
+                k = b[(i + 154) >> 1] | 0;
+                g =
+                  c[
+                    ((c[((c[((((c[a >> 2] & 3) | 0) == 3 ? a : (a + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 236) >>
+                      2
+                  ] | 0;
+                i = (i + 16) | 0;
+                f = c[((c[l >> 2] | 0) + 172) >> 2] | 0;
+                a = d;
+                while (1) {
+                  d = c[f >> 2] | 0;
+                  if (!d) break;
+                  e =
+                    ((c[
+                      ((c[((c[((((c[d >> 2] & 3) | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                        236) >>
+                        2
+                    ] |
+                      0) -
+                      g) |
+                    0;
+                  if ((e | 0) <= 0) {
+                    if ((e | 0) == 0 ? ((m = c[(d + 16) >> 2] | 0), +h[(m + 16) >> 3] > +h[i >> 3]) : 0) {
+                      d = m;
+                      n = 9;
+                    }
+                  } else {
+                    d = c[(d + 16) >> 2] | 0;
+                    n = 9;
+                  }
+                  if ((n | 0) == 9) {
+                    n = 0;
+                    a = ((O(b[(d + 154) >> 1] | 0, k) | 0) + a) | 0;
+                  }
+                  f = (f + 4) | 0;
+                }
+                j = (j + 4) | 0;
+                d = a;
+              }
+              return d | 0;
+            }
+            function ri(a, d) {
+              a = a | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0;
+              l = (a + 16) | 0;
+              j = c[((c[(d + 16) >> 2] | 0) + 180) >> 2] | 0;
+              d = 0;
+              while (1) {
+                a = c[j >> 2] | 0;
+                if (!a) break;
+                i = c[(a + 16) >> 2] | 0;
+                k = b[(i + 154) >> 1] | 0;
+                g =
+                  c[
+                    ((c[((c[((((c[a >> 2] & 3) | 0) == 2 ? a : (a + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                      236) >>
+                      2
+                  ] | 0;
+                i = (i + 56) | 0;
+                f = c[((c[l >> 2] | 0) + 180) >> 2] | 0;
+                a = d;
+                while (1) {
+                  d = c[f >> 2] | 0;
+                  if (!d) break;
+                  e =
+                    ((c[
+                      ((c[((c[((((c[d >> 2] & 3) | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                        236) >>
+                        2
+                    ] |
+                      0) -
+                      g) |
+                    0;
+                  if ((e | 0) <= 0) {
+                    if ((e | 0) == 0 ? ((m = c[(d + 16) >> 2] | 0), +h[(m + 56) >> 3] > +h[i >> 3]) : 0) {
+                      d = m;
+                      n = 9;
+                    }
+                  } else {
+                    d = c[(d + 16) >> 2] | 0;
+                    n = 9;
+                  }
+                  if ((n | 0) == 9) {
+                    n = 0;
+                    a = ((O(b[(d + 154) >> 1] | 0, k) | 0) + a) | 0;
+                  }
+                  f = (f + 4) | 0;
+                }
+                j = (j + 4) | 0;
+                d = a;
+              }
+              return d | 0;
+            }
+            function si(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              i = a[((c[(e + 16) >> 2] | 0) + 156) >> 0] | 0;
+              if ((i << 24) >> 24 != (a[((c[(f + 16) >> 2] | 0) + 156) >> 0] | 0)) {
+                j = (b + 16) | 0;
+                l = c[((c[j >> 2] | 0) + 196) >> 2] | 0;
+                k = c[(l + (d << 6)) >> 2] | 0;
+                l = (l + (d << 6) + 4) | 0;
+                b = 0;
+                g = 0;
+                h = 0;
+                while (1) {
+                  if ((b | 0) >= (k | 0)) break;
+                  o = (a[((c[((c[((c[l >> 2] | 0) + (b << 2)) >> 2] | 0) + 16) >> 2] | 0) + 156) >> 0] | 0) == 0;
+                  b = (b + 1) | 0;
+                  g = (g + (o & 1)) | 0;
+                  h = (h + ((o ^ 1) & 1)) | 0;
+                }
+                i = (i << 24) >> 24 == 0;
+                h = (g | 0) < (h | 0) ? (i ? e : f) : i ? f : e;
+                i = 0;
+                b = 0;
+                while (1) {
+                  if ((b | 0) >= (k | 0)) break;
+                  i = (c[((c[l >> 2] | 0) + (b << 2)) >> 2] | 0) == (h | 0) ? b : i;
+                  b = (b + 1) | 0;
+                }
+                o = ((a[((c[(h + 16) >> 2] | 0) + 156) >> 0] | 0) == 0) & 1;
+                n = 0;
+                g = i;
+                while (1) {
+                  b = (g + -1) | 0;
+                  if ((g | 0) <= 0) {
+                    m = 0;
+                    b = i;
+                    break;
+                  }
+                  if (
+                    (a[((c[((c[((c[l >> 2] | 0) + (b << 2)) >> 2] | 0) + 16) >> 2] | 0) + 156) >> 0] | 0) !=
+                    (o | 0)
+                  ) {
+                    m = 0;
+                    b = i;
+                    break;
+                  }
+                  n = (n + 1) | 0;
+                  g = b;
+                }
+                while (1) {
+                  b = (b + 1) | 0;
+                  if ((b | 0) >= (k | 0)) break;
+                  if ((a[((c[((c[((c[l >> 2] | 0) + (b << 2)) >> 2] | 0) + 16) >> 2] | 0) + 156) >> 0] | 0) != (o | 0))
+                    break;
+                  m = (m + 1) | 0;
+                }
+                ti(e, f);
+                j = c[((c[j >> 2] | 0) + 196) >> 2] | 0;
+                k = c[(j + (d << 6)) >> 2] | 0;
+                j = (j + (d << 6) + 4) | 0;
+                b = 0;
+                while (1) {
+                  if ((b | 0) >= (k | 0)) {
+                    h = 0;
+                    g = i;
+                    break;
+                  }
+                  i = (c[((c[j >> 2] | 0) + (b << 2)) >> 2] | 0) == (h | 0) ? b : i;
+                  b = (b + 1) | 0;
+                }
+                while (1) {
+                  b = (g + -1) | 0;
+                  if ((g | 0) <= 0) {
+                    g = 0;
+                    b = i;
+                    break;
+                  }
+                  if (
+                    (a[((c[((c[((c[j >> 2] | 0) + (b << 2)) >> 2] | 0) + 16) >> 2] | 0) + 156) >> 0] | 0) !=
+                    (o | 0)
+                  ) {
+                    g = 0;
+                    b = i;
+                    break;
+                  }
+                  h = (h + 1) | 0;
+                  g = b;
+                }
+                while (1) {
+                  b = (b + 1) | 0;
+                  if ((b | 0) >= (k | 0)) break;
+                  if ((a[((c[((c[((c[j >> 2] | 0) + (b << 2)) >> 2] | 0) + 16) >> 2] | 0) + 156) >> 0] | 0) != (o | 0))
+                    break;
+                  g = (g + 1) | 0;
+                }
+                d = (h - g) | 0;
+                o = (n - m) | 0;
+                if ((((d | 0) > -1 ? d : (0 - d) | 0) | 0) > (((o | 0) > -1 ? o : (0 - o) | 0) | 0)) ti(e, f);
+              }
+              return;
+            }
+            function ti(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              f = c[(a + 16) >> 2] | 0;
+              e = c[(f + 232) >> 2] | 0;
+              f = (f + 236) | 0;
+              d = c[f >> 2] | 0;
+              g = (b + 16) | 0;
+              h = c[((c[g >> 2] | 0) + 236) >> 2] | 0;
+              c[f >> 2] = h;
+              f = ((c[46741] | 0) + 16) | 0;
+              c[((c[((c[((c[f >> 2] | 0) + 196) >> 2] | 0) + (e << 6) + 4) >> 2] | 0) + (h << 2)) >> 2] = a;
+              c[((c[g >> 2] | 0) + 236) >> 2] = d;
+              c[((c[((c[((c[f >> 2] | 0) + 196) >> 2] | 0) + (e << 6) + 4) >> 2] | 0) + (d << 2)) >> 2] = b;
+              return;
+            }
+            function ui(d, e, f) {
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0;
+              q = (d + 16) | 0;
+              n = c[((c[q >> 2] | 0) + 196) >> 2] | 0;
+              a[(n + (e << 6) + 48) >> 0] = 0;
+              r = (e | 0) > 0;
+              s = (e + 1) | 0;
+              o = (f | 0) != 0;
+              p = (e + -1) | 0;
+              g = 0;
+              i = 0;
+              f = n;
+              a: while (1) {
+                l = ((c[(f + (e << 6)) >> 2] | 0) + -1) | 0;
+                m = (f + (e << 6) + 4) | 0;
+                h = (f + (s << 6)) | 0;
+                n = g;
+                while (1) {
+                  if ((n | 0) >= (l | 0)) {
+                    f = 17;
+                    break a;
+                  }
+                  k = c[m >> 2] | 0;
+                  j = c[(k + (n << 2)) >> 2] | 0;
+                  n = (n + 1) | 0;
+                  k = c[(k + (n << 2)) >> 2] | 0;
+                  if ((c[((c[(j + 16) >> 2] | 0) + 236) >> 2] | 0) >= (c[((c[(k + 16) >> 2] | 0) + 236) >> 2] | 0)) {
+                    f = 5;
+                    break a;
+                  }
+                  if (pi(d, j, k) | 0) continue;
+                  if (r) {
+                    f = qi(j, k) | 0;
+                    g = qi(k, j) | 0;
+                  } else {
+                    f = 0;
+                    g = 0;
+                  }
+                  if ((c[h >> 2] | 0) > 0) {
+                    f = ((ri(j, k) | 0) + f) | 0;
+                    g = ((ri(k, j) | 0) + g) | 0;
+                  }
+                  if ((f | 0) > (g | 0)) break;
+                  if (((f | 0) == (g | 0)) & (o & ((f | 0) > 0))) {
+                    f = g;
+                    break;
+                  }
+                }
+                ti(j, k);
+                i = (f - g + i) | 0;
+                g = c[((c[((c[46741] | 0) + 16) >> 2] | 0) + 196) >> 2] | 0;
+                a[(g + (e << 6) + 49) >> 0] = 0;
+                h = c[q >> 2] | 0;
+                f = c[(h + 196) >> 2] | 0;
+                a[(f + (e << 6) + 48) >> 0] = 1;
+                if ((b[(h + 236) >> 1] | 0) < (e | 0)) {
+                  a[(g + (p << 6) + 49) >> 0] = 0;
+                  a[(f + (p << 6) + 48) >> 0] = 1;
+                }
+                if ((b[(h + 238) >> 1] | 0) <= (e | 0)) {
+                  g = n;
+                  continue;
+                }
+                a[(g + (s << 6) + 49) >> 0] = 0;
+                a[(f + (s << 6) + 48) >> 0] = 1;
+                g = n;
+              }
+              if ((f | 0) == 5) qa(86263, 85781, 770, 86297);
+              else if ((f | 0) == 17) return i | 0;
+              return 0;
+            }
+            function vi(a, e, f) {
+              a = a | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0;
+              p = c[46739] | 0;
+              q = (a + 16) | 0;
+              a = c[((c[q >> 2] | 0) + 196) >> 2] | 0;
+              r = c[(a + (e << 6) + 4) >> 2] | 0;
+              n = (f | 0) > (e | 0);
+              o = (p + 4) | 0;
+              m = 0;
+              while (1) {
+                f = c[(a + (e << 6)) >> 2] | 0;
+                if ((m | 0) >= (f | 0)) {
+                  a = 0;
+                  j = 0;
+                  break;
+                }
+                l = ((c[(r + (m << 2)) >> 2] | 0) + 16) | 0;
+                a = c[l >> 2] | 0;
+                a: do
+                  if (n) {
+                    k = c[(a + 180) >> 2] | 0;
+                    a = 0;
+                    j = 0;
+                    while (1) {
+                      f = c[(k + (j << 2)) >> 2] | 0;
+                      if (!f) break a;
+                      g = c[(f + 16) >> 2] | 0;
+                      if ((b[(g + 154) >> 1] | 0) > 0) {
+                        c[(p + (a << 2)) >> 2] =
+                          (c[
+                            ((c[((c[((((c[f >> 2] & 3) | 0) == 2 ? f : (f + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] |
+                              0) +
+                              236) >>
+                              2
+                          ] <<
+                            8) |
+                          d[(g + 88) >> 0];
+                        a = (a + 1) | 0;
+                      }
+                      j = (j + 1) | 0;
+                    }
+                  } else {
+                    k = c[(a + 172) >> 2] | 0;
+                    j = 0;
+                    a = 0;
+                    while (1) {
+                      f = c[(k + (j << 2)) >> 2] | 0;
+                      if (!f) break a;
+                      g = c[(f + 16) >> 2] | 0;
+                      if ((b[(g + 154) >> 1] | 0) > 0) {
+                        c[(p + (a << 2)) >> 2] =
+                          (c[
+                            ((c[((c[((((c[f >> 2] & 3) | 0) == 3 ? f : (f + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                              236) >>
+                              2
+                          ] <<
+                            8) |
+                          d[(g + 48) >> 0];
+                        a = (a + 1) | 0;
+                      }
+                      j = (j + 1) | 0;
+                    }
+                  }
+                while (0);
+                b: do
+                  switch (a | 0) {
+                    case 0: {
+                      i = -1.0;
+                      break;
+                    }
+                    case 1: {
+                      i = +(c[p >> 2] | 0);
+                      break;
+                    }
+                    case 2: {
+                      i = +(((((c[o >> 2] | 0) + (c[p >> 2] | 0)) | 0) / 2) | 0 | 0);
+                      break;
+                    }
+                    default: {
+                      o4(p, a, 4, 60);
+                      f = ((a | 0) / 2) | 0;
+                      if ((a & 1) | 0) {
+                        i = +(c[(p + (f << 2)) >> 2] | 0);
+                        break b;
+                      }
+                      j = c[(p + (f << 2)) >> 2] | 0;
+                      g = ((c[(p + ((a + -1) << 2)) >> 2] | 0) - j) | 0;
+                      a = c[(p + ((f + -1) << 2)) >> 2] | 0;
+                      f = (a - (c[p >> 2] | 0)) | 0;
+                      if ((f | 0) == (g | 0)) {
+                        i = +((((a + j) | 0) / 2) | 0 | 0);
+                        break b;
+                      } else {
+                        i = +(((((O(f, j) | 0) + (O(a, g) | 0)) | 0) / ((f + g) | 0)) | 0 | 0);
+                        break b;
+                      }
+                    }
+                  }
+                while (0);
+                h[((c[l >> 2] | 0) + 240) >> 3] = i;
+                m = (m + 1) | 0;
+                a = c[((c[q >> 2] | 0) + 196) >> 2] | 0;
+              }
+              while (1) {
+                if ((j | 0) >= (f | 0)) break;
+                g = c[(r + (j << 2)) >> 2] | 0;
+                p = c[(g + 16) >> 2] | 0;
+                if ((c[(p + 184) >> 2] | 0) == 0 ? (c[(p + 176) >> 2] | 0) == 0 : 0) {
+                  a = (xi(g) | 0 | (a & 255)) & 255;
+                  f = c[((c[((c[q >> 2] | 0) + 196) >> 2] | 0) + (e << 6)) >> 2] | 0;
+                }
+                j = (j + 1) | 0;
+              }
+              return a | 0;
+            }
+            function wi(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0.0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0;
+              o = c[((c[(b + 16) >> 2] | 0) + 196) >> 2] | 0;
+              s = c[(o + (d << 6) + 4) >> 2] | 0;
+              o = c[(o + (d << 6)) >> 2] | 0;
+              q = (e | 0) != 0;
+              p = (f | e | 0) == 0;
+              f = 0;
+              e = o;
+              o = (s + (o << 2)) | 0;
+              while (1) {
+                n = (e + -1) | 0;
+                if ((e | 0) > 0) e = s;
+                else break;
+                a: while (1) {
+                  b: while (1) {
+                    if (e >>> 0 >= o >>> 0) break a;
+                    while (1) {
+                      if (e >>> 0 >= o >>> 0) break a;
+                      l = c[e >> 2] | 0;
+                      m = +h[((c[(l + 16) >> 2] | 0) + 240) >> 3];
+                      if (!(m < 0.0)) break;
+                      e = (e + 4) | 0;
+                    }
+                    k = 0;
+                    while (1) {
+                      g = (k << 24) >> 24 == 0;
+                      while (1) {
+                        e = (e + 4) | 0;
+                        if (e >>> 0 >= o >>> 0) break a;
+                        if (g) {
+                          g = 11;
+                          break;
+                        }
+                        i = c[e >> 2] | 0;
+                        if (!(c[((c[(i + 16) >> 2] | 0) + 212) >> 2] | 0)) {
+                          g = 13;
+                          break;
+                        }
+                      }
+                      if ((g | 0) == 11) {
+                        i = c[e >> 2] | 0;
+                        j = i;
+                      } else if ((g | 0) == 13) j = i;
+                      if (pi(b, l, j) | 0) continue b;
+                      g = c[(i + 16) >> 2] | 0;
+                      if (+h[(g + 240) >> 3] >= 0.0) break;
+                      k = (c[(g + 212) >> 2] | 0) == 0 ? k : 1;
+                    }
+                    g = ~~m;
+                    k = ~~+h[((c[(i + 16) >> 2] | 0) + 240) >> 3];
+                    if (((g | 0) > (k | 0)) | (q & ((g | 0) == (k | 0)))) break;
+                  }
+                  ti(l, j);
+                  f = (f + 1) | 0;
+                }
+                e = n;
+                o = p ? (o + -4) | 0 : o;
+              }
+              if (
+                f | 0
+                  ? ((r = c[((c[((c[46741] | 0) + 16) >> 2] | 0) + 196) >> 2] | 0),
+                    (a[(r + (d << 6) + 49) >> 0] = 0),
+                    (d | 0) > 0)
+                  : 0
+              )
+                a[(r + ((d + -1) << 6) + 49) >> 0] = 0;
+              return;
+            }
+            function xi(a) {
+              a = a | 0;
+              var b = 0.0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              g = c[(a + 16) >> 2] | 0;
+              if ((c[(g + 200) >> 2] | 0) > 0) {
+                f = c[(g + 196) >> 2] | 0;
+                a = c[f >> 2] | 0;
+                a = c[((((c[a >> 2] & 3) | 0) == 3 ? a : (a + 48) | 0) + 40) >> 2] | 0;
+                d = 1;
+                while (1) {
+                  e = c[(f + (d << 2)) >> 2] | 0;
+                  if (!e) break;
+                  e = c[((((c[e >> 2] & 3) | 0) == 3 ? e : (e + 48) | 0) + 40) >> 2] | 0;
+                  a =
+                    (c[((c[(e + 16) >> 2] | 0) + 236) >> 2] | 0) > (c[((c[(a + 16) >> 2] | 0) + 236) >> 2] | 0) ? e : a;
+                  d = (d + 1) | 0;
+                }
+                b = +h[((c[(a + 16) >> 2] | 0) + 240) >> 3];
+                if (!(b >= 0.0)) a = 1;
+                else {
+                  h[(g + 240) >> 3] = b + 1.0;
+                  a = 0;
+                }
+              } else if ((c[(g + 192) >> 2] | 0) > 0) {
+                e = c[(g + 188) >> 2] | 0;
+                d = c[e >> 2] | 0;
+                a = 1;
+                d = c[((((c[d >> 2] & 3) | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0;
+                while (1) {
+                  f = c[(e + (a << 2)) >> 2] | 0;
+                  if (!f) break;
+                  f = c[((((c[f >> 2] & 3) | 0) == 2 ? f : (f + -48) | 0) + 40) >> 2] | 0;
+                  a = (a + 1) | 0;
+                  d =
+                    (c[((c[(f + 16) >> 2] | 0) + 236) >> 2] | 0) < (c[((c[(d + 16) >> 2] | 0) + 236) >> 2] | 0) ? f : d;
+                }
+                b = +h[((c[(d + 16) >> 2] | 0) + 240) >> 3];
+                if (b > 0.0) {
+                  h[(g + 240) >> 3] = b + -1.0;
+                  a = 0;
+                } else a = 1;
+              } else a = 1;
+              return a | 0;
+            }
+            function yi(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return (
+                ((c[((c[((c[a >> 2] | 0) + 16) >> 2] | 0) + 236) >> 2] | 0) -
+                  (c[((c[((c[b >> 2] | 0) + 16) >> 2] | 0) + 236) >> 2] | 0)) |
+                0
+              );
+            }
+            function zi(a, d) {
+              a = a | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              p = l;
+              l = (l + 96) | 0;
+              o = (p + 64) | 0;
+              n = (p + 48) | 0;
+              h = (p + 24) | 0;
+              f = p;
+              j = (d + 16) | 0;
+              k = c[((c[j >> 2] | 0) + 232) >> 2] | 0;
+              m = (a + 16) | 0;
+              e = c[((c[m >> 2] | 0) + 196) >> 2] | 0;
+              i = c[(e + (k << 6)) >> 2] | 0;
+              do
+                if ((c[(e + (k << 6) + 8) >> 2] | 0) >= 1) {
+                  c[((c[(e + (k << 6) + 4) >> 2] | 0) + (i << 2)) >> 2] = d;
+                  c[((c[j >> 2] | 0) + 236) >> 2] = i;
+                  a = c[m >> 2] | 0;
+                  f = c[(a + 196) >> 2] | 0;
+                  e = (f + (k << 6)) | 0;
+                  g = c[e >> 2] | 0;
+                  c[e >> 2] = g + 1;
+                  if ((g | 0) >= (c[(f + (k << 6) + 8) >> 2] | 0)) qa(86377, 85781, 1346, 86413);
+                  g = c[((c[((c[((c[46741] | 0) + 16) >> 2] | 0) + 196) >> 2] | 0) + (k << 6) + 8) >> 2] | 0;
+                  if ((i | 0) > (g | 0)) {
+                    m = KB(d) | 0;
+                    n = c[((c[j >> 2] | 0) + 236) >> 2] | 0;
+                    o = c[((c[((c[((c[46741] | 0) + 16) >> 2] | 0) + 196) >> 2] | 0) + (k << 6) + 8) >> 2] | 0;
+                    c[h >> 2] = 1359;
+                    c[(h + 4) >> 2] = m;
+                    c[(h + 8) >> 2] = n;
+                    c[(h + 12) >> 2] = k;
+                    c[(h + 16) >> 2] = o;
+                    gA(1, 86429, h) | 0;
+                    break;
+                  }
+                  e = b[(a + 236) >> 1] | 0;
+                  a = b[(a + 238) >> 1] | 0;
+                  if (((k | 0) < (e | 0)) | ((k | 0) > (((a << 16) >> 16) | 0))) {
+                    c[n >> 2] = 1364;
+                    c[(n + 4) >> 2] = k;
+                    c[(n + 8) >> 2] = e;
+                    c[(n + 12) >> 2] = (a << 16) >> 16;
+                    gA(1, 86502, n) | 0;
+                    break;
+                  }
+                  if (
+                    (((c[(f + (k << 6) + 4) >> 2] | 0) + (i << 2)) | 0) >>> 0 >
+                    (((c[(f + (k << 6) + 12) >> 2] | 0) + (g << 2)) | 0) >>> 0
+                  ) {
+                    i = KB(d) | 0;
+                    n = c[((c[m >> 2] | 0) + 196) >> 2] | 0;
+                    m = ((c[(n + (k << 6) + 4) >> 2] | 0) + (c[((c[j >> 2] | 0) + 236) >> 2] << 2)) | 0;
+                    n =
+                      ((c[(n + (k << 6) + 12) >> 2] | 0) +
+                        (c[((c[((c[((c[46741] | 0) + 16) >> 2] | 0) + 196) >> 2] | 0) + (k << 6) + 8) >> 2] << 2)) |
+                      0;
+                    c[o >> 2] = 1370;
+                    c[(o + 4) >> 2] = k;
+                    c[(o + 8) >> 2] = i;
+                    c[(o + 12) >> 2] = m;
+                    c[(o + 16) >> 2] = k;
+                    c[(o + 20) >> 2] = k;
+                    c[(o + 24) >> 2] = n;
+                    gA(1, 86563, o) | 0;
+                  }
+                } else {
+                  n = KB(a) | 0;
+                  o = KB(d) | 0;
+                  c[f >> 2] = 1339;
+                  c[(f + 4) >> 2] = n;
+                  c[(f + 8) >> 2] = o;
+                  c[(f + 12) >> 2] = k;
+                  c[(f + 16) >> 2] = i;
+                  gA(1, 86322, f) | 0;
+                }
+              while (0);
+              l = p;
+              return;
+            }
+            function Ai(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              h = (d + 16) | 0;
+              a: do
+                if (!e) {
+                  g = 0;
+                  while (1) {
+                    d = c[h >> 2] | 0;
+                    if ((g | 0) >= (c[(d + 184) >> 2] | 0)) break a;
+                    d = c[((c[(d + 180) >> 2] | 0) + (g << 2)) >> 2] | 0;
+                    e = (d + -48) | 0;
+                    f = ((c[((c[((((c[d >> 2] & 3) | 0) == 2 ? d : e) + 40) >> 2] | 0) + 16) >> 2] | 0) + 157) | 0;
+                    if (!(a[f >> 0] | 0)) {
+                      a[f >> 0] = 1;
+                      XO(b, c[((((c[d >> 2] & 3) | 0) == 2 ? d : e) + 40) >> 2] | 0);
+                    }
+                    g = (g + 1) | 0;
+                  }
+                } else {
+                  g = 0;
+                  while (1) {
+                    d = c[h >> 2] | 0;
+                    if ((g | 0) >= (c[(d + 176) >> 2] | 0)) break a;
+                    d = c[((c[(d + 172) >> 2] | 0) + (g << 2)) >> 2] | 0;
+                    e = (d + 48) | 0;
+                    f = ((c[((c[((((c[d >> 2] & 3) | 0) == 3 ? d : e) + 40) >> 2] | 0) + 16) >> 2] | 0) + 157) | 0;
+                    if (!(a[f >> 0] | 0)) {
+                      a[f >> 0] = 1;
+                      XO(b, c[((((c[d >> 2] & 3) | 0) == 3 ? d : e) + 40) >> 2] | 0);
+                    }
+                    g = (g + 1) | 0;
+                  }
+                }
+              while (0);
+              return;
+            }
+            function Bi(d, e) {
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0;
+              v = l;
+              l = (l + 16) | 0;
+              u = v;
+              g = (d + 16) | 0;
+              f = c[((c[g >> 2] | 0) + 196) >> 2] | 0;
+              s = c[(f + (e << 6) + 4) >> 2] | 0;
+              t = (e + 1) | 0;
+              d = c[((c[((c[((c[46741] | 0) + 16) >> 2] | 0) + 196) >> 2] | 0) + (t << 6)) >> 2] | 0;
+              if ((c[46745] | 0) > (d | 0)) q = c[46746] | 0;
+              else {
+                d = (d + 1) | 0;
+                c[46745] = d;
+                f = c[46746] | 0;
+                if (!f) d = KK(d << 2) | 0;
+                else d = MK(f, d << 2) | 0;
+                c[46746] = d;
+                f = c[((c[g >> 2] | 0) + 196) >> 2] | 0;
+                q = d;
+              }
+              r = (f + (t << 6)) | 0;
+              d = 0;
+              while (1) {
+                if ((d | 0) >= (c[r >> 2] | 0)) break;
+                c[(q + (d << 2)) >> 2] = 0;
+                d = (d + 1) | 0;
+              }
+              p = (f + (e << 6)) | 0;
+              o = 0;
+              h = 0;
+              d = 0;
+              j = q;
+              while (1) {
+                k = c[p >> 2] | 0;
+                if ((o | 0) >= (k | 0)) break;
+                n = c[((c[((c[(s + (o << 2)) >> 2] | 0) + 16) >> 2] | 0) + 180) >> 2] | 0;
+                a: do
+                  if ((h | 0) > 0) {
+                    m = 0;
+                    while (1) {
+                      g = c[(n + (m << 2)) >> 2] | 0;
+                      if (!g) break a;
+                      k = (g + 16) | 0;
+                      i =
+                        c[
+                          ((c[((c[((((c[g >> 2] & 3) | 0) == 2 ? g : (g + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                            236) >>
+                            2
+                        ] | 0;
+                      while (1) {
+                        g = (i + 1) | 0;
+                        if ((i | 0) >= (h | 0)) break;
+                        i = g;
+                        d = ((O(c[(j + (g << 2)) >> 2] | 0, b[((c[k >> 2] | 0) + 154) >> 1] | 0) | 0) + d) | 0;
+                      }
+                      m = (m + 1) | 0;
+                    }
+                  }
+                while (0);
+                i = 0;
+                while (1) {
+                  g = c[(n + (i << 2)) >> 2] | 0;
+                  if (!g) break;
+                  j =
+                    c[
+                      ((c[((c[((((c[g >> 2] & 3) | 0) == 2 ? g : (g + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                        236) >>
+                        2
+                    ] | 0;
+                  m = (q + (j << 2)) | 0;
+                  c[m >> 2] = (c[m >> 2] | 0) + (b[((c[(g + 16) >> 2] | 0) + 154) >> 1] | 0);
+                  h = (j | 0) > (h | 0) ? j : h;
+                  i = (i + 1) | 0;
+                  j = q;
+                }
+                o = (o + 1) | 0;
+              }
+              i = (f + (e << 6) + 4) | 0;
+              h = 0;
+              while (1) {
+                if ((h | 0) >= (k | 0)) break;
+                g = c[((c[((c[i >> 2] | 0) + (h << 2)) >> 2] | 0) + 16) >> 2] | 0;
+                if (a[(g + 145) >> 0] | 0) {
+                  e = (g + 180) | 0;
+                  c[u >> 2] = c[e >> 2];
+                  c[(u + 4) >> 2] = c[(e + 4) >> 2];
+                  d = ((Ci(u, 1) | 0) + d) | 0;
+                }
+                h = (h + 1) | 0;
+              }
+              i = c[r >> 2] | 0;
+              h = (f + (t << 6) + 4) | 0;
+              g = 0;
+              while (1) {
+                if ((g | 0) >= (i | 0)) break;
+                f = c[((c[((c[h >> 2] | 0) + (g << 2)) >> 2] | 0) + 16) >> 2] | 0;
+                if (a[(f + 145) >> 0] | 0) {
+                  t = (f + 172) | 0;
+                  c[u >> 2] = c[t >> 2];
+                  c[(u + 4) >> 2] = c[(t + 4) >> 2];
+                  d = ((Ci(u, -1) | 0) + d) | 0;
+                }
+                g = (g + 1) | 0;
+              }
+              l = v;
+              return d | 0;
+            }
+            function Ci(a, d) {
+              a = a | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0;
+              n = (d | 0) < 1;
+              l = c[a >> 2] | 0;
+              d = 0;
+              a = 0;
+              a: while (1) {
+                m = c[(l + (d << 2)) >> 2] | 0;
+                if (!m) break;
+                d = (d + 1) | 0;
+                if (n) {
+                  j = (m + 48) | 0;
+                  k = (m + 16) | 0;
+                  i = d;
+                  while (1) {
+                    e = c[(l + (i << 2)) >> 2] | 0;
+                    if (!e) continue a;
+                    f = c[(e + 16) >> 2] | 0;
+                    g = c[k >> 2] | 0;
+                    if (
+                      (+h[(f + 56) >> 3] - +h[(g + 56) >> 3]) *
+                        +(
+                          ((c[
+                            ((c[((c[((((c[e >> 2] & 3) | 0) == 3 ? e : (e + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                              236) >>
+                              2
+                          ] |
+                            0) -
+                            (c[
+                              ((c[((c[((((c[m >> 2] & 3) | 0) == 3 ? m : j) + 40) >> 2] | 0) + 16) >> 2] | 0) + 236) >>
+                                2
+                            ] |
+                              0)) |
+                          0
+                        ) <
+                      0.0
+                    )
+                      a = ((O(b[(f + 154) >> 1] | 0, b[(g + 154) >> 1] | 0) | 0) + a) | 0;
+                    i = (i + 1) | 0;
+                  }
+                } else {
+                  j = (m + -48) | 0;
+                  k = (m + 16) | 0;
+                  i = d;
+                  while (1) {
+                    e = c[(l + (i << 2)) >> 2] | 0;
+                    if (!e) continue a;
+                    f = c[(e + 16) >> 2] | 0;
+                    g = c[k >> 2] | 0;
+                    if (
+                      (+h[(f + 16) >> 3] - +h[(g + 16) >> 3]) *
+                        +(
+                          ((c[
+                            ((c[((c[((((c[e >> 2] & 3) | 0) == 2 ? e : (e + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] |
+                              0) +
+                              236) >>
+                              2
+                          ] |
+                            0) -
+                            (c[
+                              ((c[((c[((((c[m >> 2] & 3) | 0) == 2 ? m : j) + 40) >> 2] | 0) + 16) >> 2] | 0) + 236) >>
+                                2
+                            ] |
+                              0)) |
+                          0
+                        ) <
+                      0.0
+                    )
+                      a = ((O(b[(f + 154) >> 1] | 0, b[(g + 154) >> 1] | 0) | 0) + a) | 0;
+                    i = (i + 1) | 0;
+                  }
+                }
+              }
+              return a | 0;
+            }
+            function Di(a) {
+              a = a | 0;
+              var b = 0.0,
+                d = 0.0;
+              c[46744] = 8;
+              c[47136] = 24;
+              h[23215] = 0.995;
+              a = QA(a, 86685) | 0;
+              if (a | 0 ? ((b = +r5(a)), b > 0.0) : 0) {
+                d = b * +(c[46744] | 0);
+                c[46744] = ~~(d > 1.0 ? d : 1.0);
+                b = b * +(c[47136] | 0);
+                c[47136] = ~~(b > 1.0 ? b : 1.0);
+              }
+              return;
+            }
+            function Ei(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0;
+              e = ((b[((c[(a + 16) >> 2] | 0) + 238) >> 1] | 0) + 2) | 0;
+              d = JK(e << 2) | 0;
+              Gi(a, d, e, 0) | 0;
+              U1(d);
+              return;
+            }
+            function Fi(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              h = (a + 16) | 0;
+              i = JK(((b[((c[h >> 2] | 0) + 238) >> 1] << 2) + 8) | 0) | 0;
+              g = jC(a) | 0;
+              while (1) {
+                if (!g) break;
+                f = (i + (c[((c[(g + 16) >> 2] | 0) + 232) >> 2] << 2)) | 0;
+                c[f >> 2] = (c[f >> 2] | 0) + 1;
+                f = XA(a, g) | 0;
+                while (1) {
+                  if (!f) break;
+                  j = c[f >> 2] & 3;
+                  d = c[((c[((c[(((j | 0) == 3 ? f : (f + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0;
+                  j = c[((c[((c[(((j | 0) == 2 ? f : (f + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0;
+                  k = (d | 0) > (j | 0);
+                  e = k ? d : j;
+                  d = k ? j : d;
+                  while (1) {
+                    d = (d + 1) | 0;
+                    if ((d | 0) >= (e | 0)) break;
+                    k = (i + (d << 2)) | 0;
+                    c[k >> 2] = (c[k >> 2] | 0) + 1;
+                  }
+                  f = ZA(a, f) | 0;
+                }
+                g = kC(a, g) | 0;
+              }
+              f = JK(((b[((c[h >> 2] | 0) + 238) >> 1] << 6) + 128) | 0) | 0;
+              e = c[h >> 2] | 0;
+              c[(e + 196) >> 2] = f;
+              d = b[(e + 236) >> 1] | 0;
+              while (1) {
+                if ((d | 0) > (b[(e + 238) >> 1] | 0)) break;
+                j = (i + (d << 2)) | 0;
+                e = c[j >> 2] | 0;
+                c[(f + (d << 6)) >> 2] = e;
+                c[(f + (d << 6) + 8) >> 2] = e;
+                j = JK(((c[j >> 2] << 2) + 4) | 0) | 0;
+                e = c[h >> 2] | 0;
+                k = c[(e + 196) >> 2] | 0;
+                c[(k + (d << 6) + 4) >> 2] = j;
+                c[(k + (d << 6) + 12) >> 2] = j;
+                d = (d + 1) | 0;
+                f = k;
+              }
+              U1(i);
+              return;
+            }
+            function Gi(a, d, e, f) {
+              a = a | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              m = (a + 16) | 0;
+              i = 1;
+              while (1) {
+                g = c[m >> 2] | 0;
+                if ((i | 0) > (c[(g + 180) >> 2] | 0)) break;
+                l = Gi(c[((c[(g + 184) >> 2] | 0) + (i << 2)) >> 2] | 0, d, e, f) | 0;
+                i = (i + 1) | 0;
+                f = l;
+              }
+              a: do
+                if ((gg(a) | 0) != (a | 0)) {
+                  Y6(d | 0, 0, (e << 2) | 0) | 0;
+                  g = jC(a) | 0;
+                  while (1) {
+                    if (!g) break;
+                    k = (g + 16) | 0;
+                    c[(d + (c[((c[k >> 2] | 0) + 232) >> 2] << 2)) >> 2] = 1;
+                    i = XA(a, g) | 0;
+                    while (1) {
+                      if (!i) break;
+                      l = (i + -48) | 0;
+                      j = c[((c[k >> 2] | 0) + 232) >> 2] | 0;
+                      while (1) {
+                        e = (j + 1) | 0;
+                        if (
+                          (j | 0) >=
+                          (c[
+                            ((c[((c[((((c[i >> 2] & 3) | 0) == 2 ? i : l) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2
+                          ] |
+                            0)
+                        )
+                          break;
+                        c[(d + (e << 2)) >> 2] = 1;
+                        j = e;
+                      }
+                      i = ZA(a, i) | 0;
+                    }
+                    g = kC(a, g) | 0;
+                  }
+                  g = c[m >> 2] | 0;
+                  i = b[(g + 236) >> 1] | 0;
+                  while (1) {
+                    if ((i | 0) > (b[(g + 238) >> 1] | 0)) break a;
+                    if (!(c[(d + (i << 2)) >> 2] | 0)) {
+                      if (!f) f = ND(gg(a) | 0, 86675, 1) | 0;
+                      g = tC(f, 0, 1) | 0;
+                      TC(g, 137447, 304, 1) | 0;
+                      l = (g + 16) | 0;
+                      j = c[l >> 2] | 0;
+                      c[(j + 232) >> 2] = i;
+                      h[(j + 96) >> 3] = 0.5;
+                      h[(j + 88) >> 3] = 0.5;
+                      h[(j + 80) >> 3] = 1.0;
+                      c[(j + 216) >> 2] = 1;
+                      c[(j + 176) >> 2] = 0;
+                      j = JK(20) | 0;
+                      k = c[l >> 2] | 0;
+                      c[(k + 172) >> 2] = j;
+                      c[(k + 184) >> 2] = 0;
+                      k = JK(20) | 0;
+                      c[((c[l >> 2] | 0) + 180) >> 2] = k;
+                      oC(a, g, 1) | 0;
+                      g = c[m >> 2] | 0;
+                    }
+                    i = (i + 1) | 0;
+                  }
+                }
+              while (0);
+              return f | 0;
+            }
+            function Hi(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              Xh(a);
+              b = (a + 16) | 0;
+              a = 1;
+              while (1) {
+                d = c[b >> 2] | 0;
+                if ((a | 0) > (c[(d + 180) >> 2] | 0)) break;
+                Hi(c[((c[(d + 184) >> 2] | 0) + (a << 2)) >> 2] | 0);
+                a = (a + 1) | 0;
+              }
+              return;
+            }
+            function Ii(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = c[a >> 2] & 3;
+              d = Ji(c[(((b | 0) == 3 ? a : (a + 48) | 0) + 40) >> 2] | 0) | 0;
+              b =
+                c[
+                  (17308 + ((d * 12) | 0) + ((Ji(c[(((b | 0) == 2 ? a : (a + -48) | 0) + 40) >> 2] | 0) | 0) << 2)) >> 2
+                ] | 0;
+              a = ((c[(a + 16) >> 2] | 0) + 156) | 0;
+              c[a >> 2] = O(c[a >> 2] | 0, b) | 0;
+              return;
+            }
+            function Ji(b) {
+              b = b | 0;
+              b = c[(b + 16) >> 2] | 0;
+              if ((a[(b + 156) >> 0] | 0) == 1) b = 2;
+              else b = ((a[(b + 160) >> 0] | 0) < 2) & 1;
+              return b | 0;
+            }
+            function Ki(b, d) {
+              b = b | 0;
+              d = d | 0;
+              if (c[((c[(b + 16) >> 2] | 0) + 192) >> 2] | 0) {
+                jl(b);
+                Li(b);
+                if (a[194954] | 0) xl(b);
+                Mi(b);
+                if (Pl(b) | 0) Li(b);
+                Ni(b);
+                if (uL(b, 2, Oi(b) | 0) | 0 ? (Pi(b), uL(b, 2, Oi(b) | 0) | 0) : 0) qa(86693, 86721, 134, 86732);
+                Qi(b);
+                Ri(b, d);
+                Si(b);
+              }
+              return;
+            }
+            function Li(d) {
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0.0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0.0,
+                z = 0.0;
+              v = (d + 16) | 0;
+              e = c[v >> 2] | 0;
+              w = c[(e + 196) >> 2] | 0;
+              t = b[(e + 236) >> 1] | 0;
+              while (1) {
+                if ((t | 0) > (b[(e + 238) >> 1] | 0)) break;
+                n = (w + (t << 6)) | 0;
+                o = (w + (t << 6) + 4) | 0;
+                p = (w + (t << 6) + 40) | 0;
+                q = (w + (t << 6) + 24) | 0;
+                r = (w + (t << 6) + 32) | 0;
+                s = (w + (t << 6) + 16) | 0;
+                m = 0;
+                while (1) {
+                  if ((m | 0) >= (c[n >> 2] | 0)) break;
+                  l = ((c[((c[o >> 2] | 0) + (m << 2)) >> 2] | 0) + 16) | 0;
+                  e = c[l >> 2] | 0;
+                  j = +h[(e + 80) >> 3] * 0.5;
+                  i = c[(e + 204) >> 2] | 0;
+                  a: do
+                    if (i) {
+                      g = 0;
+                      while (1) {
+                        f = c[(i + (g << 2)) >> 2] | 0;
+                        if (!f) break a;
+                        x = c[f >> 2] & 3;
+                        if (
+                          (c[(((x | 0) == 3 ? f : (f + 48) | 0) + 40) >> 2] | 0) ==
+                          (c[(((x | 0) == 2 ? f : (f + -48) | 0) + 40) >> 2] | 0)
+                            ? ((u = c[((c[(f + 16) >> 2] | 0) + 96) >> 2] | 0), (u | 0) != 0)
+                            : 0
+                        ) {
+                          k = +h[(u + 32) >> 3] * 0.5;
+                          j = j > k ? j : k;
+                        }
+                        g = (g + 1) | 0;
+                      }
+                    }
+                  while (0);
+                  if (+h[p >> 3] < j) {
+                    h[q >> 3] = j;
+                    h[p >> 3] = j;
+                  }
+                  if (+h[r >> 3] < j) {
+                    h[s >> 3] = j;
+                    h[r >> 3] = j;
+                  }
+                  f = c[(e + 212) >> 2] | 0;
+                  if (f | 0) {
+                    if ((f | 0) == (d | 0)) g = 0;
+                    else {
+                      g = ZO(f, c[47144] | 0, 8, 0) | 0;
+                      e = c[l >> 2] | 0;
+                    }
+                    i = c[(e + 232) >> 2] | 0;
+                    f = c[(f + 16) >> 2] | 0;
+                    e = (f + 128) | 0;
+                    j = j + +(g | 0);
+                    if ((i | 0) == (b[(f + 236) >> 1] | 0)) {
+                      k = +h[e >> 3];
+                      h[e >> 3] = k > j ? k : j;
+                    }
+                    e = (f + 120) | 0;
+                    if ((i | 0) == (b[(f + 238) >> 1] | 0)) {
+                      k = +h[e >> 3];
+                      h[e >> 3] = k > j ? k : j;
+                    }
+                  }
+                  m = (m + 1) | 0;
+                }
+                t = (t + 1) | 0;
+                e = c[v >> 2] | 0;
+              }
+              m = rj(d) | 0;
+              g = c[v >> 2] | 0;
+              e = b[(g + 238) >> 1] | 0;
+              h[((c[((c[c[(w + (e << 6) + 4) >> 2] >> 2] | 0) + 16) >> 2] | 0) + 24) >> 3] =
+                +h[(w + (e << 6) + 16) >> 3];
+              f = b[(g + 236) >> 1] | 0;
+              i = (g + 252) | 0;
+              k = 0.0;
+              while (1) {
+                l = (e + -1) | 0;
+                if ((e | 0) <= (f | 0)) break;
+                y = +h[(w + (l << 6) + 32) >> 3] + +h[(w + (e << 6) + 40) >> 3] + +(c[i >> 2] | 0);
+                j = +h[(w + (e << 6) + 24) >> 3] + 8.0 + +h[(w + (l << 6) + 16) >> 3];
+                j = y > j ? y : j;
+                if ((c[(w + (l << 6)) >> 2] | 0) > 0)
+                  h[((c[((c[c[(w + (l << 6) + 4) >> 2] >> 2] | 0) + 16) >> 2] | 0) + 24) >> 3] =
+                    +h[((c[((c[c[(w + (e << 6) + 4) >> 2] >> 2] | 0) + 16) >> 2] | 0) + 24) >> 3] + j;
+                k = k > j ? k : j;
+                e = l;
+              }
+              b: do
+                if ((m | 0) != 0 ? ((c[(g + 116) >> 2] & 1) | 0) != 0 : 0) {
+                  sj(d, 0);
+                  g = c[v >> 2] | 0;
+                  if (a[(g + 276) >> 0] | 0) {
+                    e = b[(g + 238) >> 1] | 0;
+                    f = b[(g + 236) >> 1] | 0;
+                    j = +h[((c[((c[c[(w + (e << 6) + 4) >> 2] >> 2] | 0) + 16) >> 2] | 0) + 24) >> 3];
+                    k = 0.0;
+                    while (1) {
+                      i = (e + -1) | 0;
+                      if ((e | 0) <= (f | 0)) break b;
+                      z = +h[((c[((c[c[(w + (i << 6) + 4) >> 2] >> 2] | 0) + 16) >> 2] | 0) + 24) >> 3];
+                      y = z - j;
+                      j = z;
+                      k = k > y ? k : y;
+                      e = i;
+                    }
+                  }
+                }
+              while (0);
+              c: do
+                if (a[(g + 276) >> 0] | 0) {
+                  i = b[(g + 236) >> 1] | 0;
+                  f = b[(g + 238) >> 1] | 0;
+                  while (1) {
+                    e = (f + -1) | 0;
+                    if ((f | 0) <= (i | 0)) break c;
+                    if ((c[(w + (e << 6)) >> 2] | 0) <= 0) {
+                      f = e;
+                      continue;
+                    }
+                    h[((c[((c[c[(w + (e << 6) + 4) >> 2] >> 2] | 0) + 16) >> 2] | 0) + 24) >> 3] =
+                      +h[((c[((c[c[(w + (f << 6) + 4) >> 2] >> 2] | 0) + 16) >> 2] | 0) + 24) >> 3] + k;
+                    f = e;
+                  }
+                }
+              while (0);
+              e = (g + 192) | 0;
+              while (1) {
+                e = c[e >> 2] | 0;
+                if (!e) break;
+                e = c[(e + 16) >> 2] | 0;
+                h[(e + 24) >> 3] =
+                  +h[((c[((c[c[(w + (c[(e + 232) >> 2] << 6) + 4) >> 2] >> 2] | 0) + 16) >> 2] | 0) + 24) >> 3];
+                e = (e + 164) | 0;
+              }
+              return;
+            }
+            function Mi(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              nj(a);
+              b = ((c[(a + 16) >> 2] | 0) + 192) | 0;
+              while (1) {
+                b = c[b >> 2] | 0;
+                if (!b) break;
+                e = (b + 16) | 0;
+                b = c[e >> 2] | 0;
+                d = c[(b + 224) >> 2] | 0;
+                if (d) {
+                  oj(a, d);
+                  b = c[e >> 2] | 0;
+                }
+                d = c[(b + 228) >> 2] | 0;
+                if (!d) d = b;
+                else {
+                  oj(a, d);
+                  d = c[e >> 2] | 0;
+                }
+                e = c[(d + 204) >> 2] | 0;
+                if (e | 0) {
+                  b = 0;
+                  while (1)
+                    if (!(c[(e + (b << 2)) >> 2] | 0)) break;
+                    else b = (b + 1) | 0;
+                }
+                b = (d + 164) | 0;
+              }
+              return;
+            }
+            function Ni(a) {
+              a = a | 0;
+              $i(a);
+              aj(a);
+              bj(a);
+              cj(a);
+              dj(a);
+              return;
+            }
+            function Oi(a) {
+              a = a | 0;
+              var b = 0,
+                c = 0.0;
+              b = QA(a, 86921) | 0;
+              if (!b) a = 2147483647;
+              else {
+                c = +r5(b);
+                a = ~~(c * +(tB(a) | 0));
+              }
+              return a | 0;
+            }
+            function Pi(d) {
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0;
+              r = (d + 16) | 0;
+              e = c[r >> 2] | 0;
+              q = b[(e + 236) >> 1] | 0;
+              while (1) {
+                p = b[(e + 238) >> 1] | 0;
+                if ((q | 0) > (p | 0)) {
+                  s = 19;
+                  break;
+                }
+                n = c[(e + 196) >> 2] | 0;
+                o = (n + (q << 6)) | 0;
+                m = c[o >> 2] | 0;
+                n = (n + (q << 6) + 4) | 0;
+                l = 0;
+                f = 0;
+                a: while (1) {
+                  if ((l | 0) >= (m | 0)) {
+                    s = 14;
+                    break;
+                  }
+                  f = c[((c[n >> 2] | 0) + (l << 2)) >> 2] | 0;
+                  h = c[(f + 16) >> 2] | 0;
+                  i = c[(h + 256) >> 2] | 0;
+                  b: do
+                    if (i | 0) {
+                      g = 0;
+                      while (1) {
+                        j = c[(i + (g << 2)) >> 2] | 0;
+                        if (!j) break b;
+                        k = c[j >> 2] & 3;
+                        if (
+                          (c[
+                            ((c[((c[(((k | 0) == 2 ? j : (j + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2
+                          ] |
+                            0) >
+                          (q | 0)
+                        )
+                          break a;
+                        if (
+                          (c[((c[((c[(((k | 0) == 3 ? j : (j + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] |
+                            0) >
+                          (q | 0)
+                        )
+                          break a;
+                        else g = (g + 1) | 0;
+                      }
+                    }
+                  while (0);
+                  h = c[(h + 248) >> 2] | 0;
+                  c: do
+                    if (h | 0) {
+                      g = 0;
+                      while (1) {
+                        i = c[(h + (g << 2)) >> 2] | 0;
+                        if (!i) break c;
+                        j = c[i >> 2] & 3;
+                        if (
+                          (c[((c[((c[(((j | 0) == 3 ? i : (i + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] |
+                            0) >
+                          (q | 0)
+                        )
+                          break a;
+                        if (
+                          (c[
+                            ((c[((c[(((j | 0) == 2 ? i : (i + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2
+                          ] |
+                            0) >
+                          (q | 0)
+                        )
+                          break a;
+                        else g = (g + 1) | 0;
+                      }
+                    }
+                  while (0);
+                  l = (l + 1) | 0;
+                }
+                if ((s | 0) == 14) {
+                  s = 0;
+                  if (f) {
+                    f = c[c[n >> 2] >> 2] | 0;
+                    e = c[c[(o + (((q | 0) < (p | 0) ? 1 : -1) << 6) + 4) >> 2] >> 2] | 0;
+                    if (!e) {
+                      s = 16;
+                      break;
+                    }
+                    o = sh(d) | 0;
+                    p = (o + 16) | 0;
+                    a[((c[p >> 2] | 0) + 156) >> 0] = 2;
+                    Zi(o, f, 0.0, 0) | 0;
+                    Zi(o, e, 0.0, 0) | 0;
+                    c[((c[p >> 2] | 0) + 232) >> 2] =
+                      c[
+                        ((c[
+                          (((c[((c[(f + 16) >> 2] | 0) + 232) >> 2] | 0) < (c[((c[(e + 16) >> 2] | 0) + 232) >> 2] | 0)
+                            ? f
+                            : e) +
+                            16) >>
+                            2
+                        ] |
+                          0) +
+                          232) >>
+                          2
+                      ];
+                    e = c[r >> 2] | 0;
+                  }
+                }
+                q = (q + 1) | 0;
+              }
+              if ((s | 0) == 16) qa(86829, 86721, 111, 86832);
+              else if ((s | 0) == 19) return;
+            }
+            function Qi(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              a = c[(a + 16) >> 2] | 0;
+              i = c[(a + 196) >> 2] | 0;
+              e = b[(a + 238) >> 1] | 0;
+              a = b[(a + 236) >> 1] | 0;
+              while (1) {
+                if ((a | 0) > (e | 0)) break;
+                f = c[(i + (a << 6)) >> 2] | 0;
+                g = (i + (a << 6) + 4) | 0;
+                d = 0;
+                while (1) {
+                  if ((d | 0) >= (f | 0)) break;
+                  k = c[((c[((c[g >> 2] | 0) + (d << 2)) >> 2] | 0) + 16) >> 2] | 0;
+                  j = (k + 232) | 0;
+                  h[(k + 16) >> 3] = +(c[j >> 2] | 0);
+                  c[j >> 2] = a;
+                  d = (d + 1) | 0;
+                }
+                a = (a + 1) | 0;
+              }
+              return;
+            }
+            function Ri(a, d) {
+              a = a | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                g = 0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                l = 0.0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              Ti(a, a);
+              g = (a + 16) | 0;
+              k = c[g >> 2] | 0;
+              a: do
+                if ((b[(k + 238) >> 1] | 0) > 0 ? ((j = c[(k + 8) >> 2] | 0), (e = c[(j + 84) >> 2] | 0), e | 0) : 0) {
+                  o = ~~(+h[(k + 32) >> 3] - +h[(k + 16) >> 3]);
+                  m = ~~(+h[(k + 40) >> 3] - +h[(k + 24) >> 3]);
+                  p = ((c[(k + 116) >> 2] & 1) | 0) == 0;
+                  n = p ? m : o;
+                  m = p ? o : m;
+                  if ((e | 0) == 4) {
+                    e = Ui(a) | 0;
+                    k = c[g >> 2] | 0;
+                    j = c[(k + 8) >> 2] | 0;
+                  } else e = ((e | 0) == 2) & 1;
+                  b: do
+                    if (!((e << 24) >> 24)) {
+                      switch (c[(j + 84) >> 2] | 0) {
+                        case 5: {
+                          f = +h[(j + 64) >> 3];
+                          if (f <= 0.0) break a;
+                          i = f / +h[(k + 32) >> 3];
+                          l = +h[(j + 72) >> 3] / +h[(k + 40) >> 3];
+                          f = i < l ? i : l;
+                          if ((i > 1.0) & (l > 1.0)) {
+                            l = f;
+                            break b;
+                          } else break a;
+                        }
+                        case 1:
+                          break;
+                        default:
+                          break a;
+                      }
+                      i = +h[(j + 16) >> 3];
+                      f = +(n | 0) / +(m | 0);
+                      if (f < i) {
+                        l = 1.0;
+                        f = i / f;
+                        break;
+                      } else {
+                        l = f / i;
+                        f = 1.0;
+                        break;
+                      }
+                    } else {
+                      f = +h[(j + 64) >> 3];
+                      if (f <= 0.0) break a;
+                      i = f / +(m | 0);
+                      f = +h[(j + 72) >> 3] / +(n | 0);
+                      if ((i < 1.0) | (f < 1.0))
+                        if (i < f) {
+                          l = 1.0;
+                          f = f / i;
+                          break;
+                        } else {
+                          l = i / f;
+                          f = 1.0;
+                          break;
+                        }
+                      else l = i;
+                    }
+                  while (0);
+                  e = ((c[(k + 116) >> 2] & 1) | 0) == 0;
+                  i = e ? f : l;
+                  f = e ? l : f;
+                  e = (k + 192) | 0;
+                  while (1) {
+                    e = c[e >> 2] | 0;
+                    if (!e) break;
+                    e = c[(e + 16) >> 2] | 0;
+                    p = (e + 16) | 0;
+                    l = +h[p >> 3] * f;
+                    h[p >> 3] = +(~~(l + (l >= 0.0 ? 0.5 : -0.5)) | 0);
+                    p = (e + 24) | 0;
+                    l = +h[p >> 3] * i;
+                    h[p >> 3] = +(~~(l + (l >= 0.0 ? 0.5 : -0.5)) | 0);
+                    e = (e + 164) | 0;
+                  }
+                  Vi(a, f, i);
+                }
+              while (0);
+              if (d | 0) Wi(a, d);
+              return;
+            }
+            function Si(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = (b + 16) | 0;
+              b = ((c[h >> 2] | 0) + 192) | 0;
+              while (1) {
+                b = c[b >> 2] | 0;
+                if (!b) break;
+                g = (b + 16) | 0;
+                d = 0;
+                while (1) {
+                  b = c[g >> 2] | 0;
+                  f = c[(b + 180) >> 2] | 0;
+                  e = c[(f + (d << 2)) >> 2] | 0;
+                  if (!e) break;
+                  U1(c[(e + 16) >> 2] | 0);
+                  U1(e);
+                  d = (d + 1) | 0;
+                }
+                if (f) {
+                  U1(f);
+                  b = c[g >> 2] | 0;
+                }
+                d = c[(b + 172) >> 2] | 0;
+                if (d) {
+                  U1(d);
+                  b = c[g >> 2] | 0;
+                }
+                f = (b + 256) | 0;
+                e = c[(f + 4) >> 2] | 0;
+                b = (b + 180) | 0;
+                c[b >> 2] = c[f >> 2];
+                c[(b + 4) >> 2] = e;
+                b = c[g >> 2] | 0;
+                e = (b + 248) | 0;
+                f = c[(e + 4) >> 2] | 0;
+                b = (b + 172) | 0;
+                c[b >> 2] = c[e >> 2];
+                c[(b + 4) >> 2] = f;
+                b = ((c[g >> 2] | 0) + 164) | 0;
+              }
+              b = 0;
+              d = c[((c[h >> 2] | 0) + 192) >> 2] | 0;
+              a: while (1) {
+                g = (b | 0) == 0;
+                f = (b + 16) | 0;
+                b = d;
+                while (1) {
+                  if (!b) break a;
+                  e = c[(b + 16) >> 2] | 0;
+                  d = c[(e + 164) >> 2] | 0;
+                  if ((a[(e + 156) >> 0] | 0) != 2) continue a;
+                  if (g) c[((c[h >> 2] | 0) + 192) >> 2] = d;
+                  else c[((c[f >> 2] | 0) + 164) >> 2] = d;
+                  U1(e);
+                  U1(b);
+                  b = d;
+                }
+              }
+              c[((c[((c[((c[h >> 2] | 0) + 192) >> 2] | 0) + 16) >> 2] | 0) + 168) >> 2] = 0;
+              return;
+            }
+            function Ti(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              e = (a + 16) | 0;
+              d = 1;
+              while (1) {
+                f = c[e >> 2] | 0;
+                if ((d | 0) > (c[(f + 180) >> 2] | 0)) break;
+                Ti(c[((c[(f + 184) >> 2] | 0) + (d << 2)) >> 2] | 0, b);
+                d = (d + 1) | 0;
+              }
+              Yi(a, b);
+              return;
+            }
+            function Ui(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0.0,
+                m = 0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0,
+                r = 0,
+                s = 0,
+                t = 0;
+              s = l;
+              l = (l + 80) | 0;
+              e = (s + 64) | 0;
+              d = (s + 48) | 0;
+              f = (s + 16) | 0;
+              m = s;
+              r = (s + 32) | 0;
+              a = (a + 16) | 0;
+              b = c[((c[a >> 2] | 0) + 8) >> 2] | 0;
+              t = (b + 48) | 0;
+              c[f >> 2] = c[t >> 2];
+              c[(f + 4) >> 2] = c[(t + 4) >> 2];
+              c[(f + 8) >> 2] = c[(t + 8) >> 2];
+              c[(f + 12) >> 2] = c[(t + 12) >> 2];
+              if (
+                (!(+h[f >> 3] < 0.001) ? ((g = (f + 8) | 0), !(+h[g >> 3] < 0.001)) : 0)
+                  ? ((i = (b + 32) | 0),
+                    (c[m >> 2] = c[i >> 2]),
+                    (c[(m + 4) >> 2] = c[(i + 4) >> 2]),
+                    (c[(m + 8) >> 2] = c[(i + 8) >> 2]),
+                    (c[(m + 12) >> 2] = c[(i + 12) >> 2]),
+                    (c[d >> 2] = c[f >> 2]),
+                    (c[(d + 4) >> 2] = c[(f + 4) >> 2]),
+                    (c[(d + 8) >> 2] = c[(f + 8) >> 2]),
+                    (c[(d + 12) >> 2] = c[(f + 12) >> 2]),
+                    (c[e >> 2] = c[i >> 2]),
+                    (c[(e + 4) >> 2] = c[(i + 4) >> 2]),
+                    (c[(e + 8) >> 2] = c[(i + 8) >> 2]),
+                    (c[(e + 12) >> 2] = c[(i + 12) >> 2]),
+                    Xi(r, d, e),
+                    (c[f >> 2] = c[r >> 2]),
+                    (c[(f + 4) >> 2] = c[(r + 4) >> 2]),
+                    (c[(f + 8) >> 2] = c[(r + 8) >> 2]),
+                    (c[(f + 12) >> 2] = c[(r + 12) >> 2]),
+                    (c[d >> 2] = c[r >> 2]),
+                    (c[(d + 4) >> 2] = c[(r + 4) >> 2]),
+                    (c[(d + 8) >> 2] = c[(r + 8) >> 2]),
+                    (c[(d + 12) >> 2] = c[(r + 12) >> 2]),
+                    (c[e >> 2] = c[m >> 2]),
+                    (c[(e + 4) >> 2] = c[(m + 4) >> 2]),
+                    (c[(e + 8) >> 2] = c[(m + 8) >> 2]),
+                    (c[(e + 12) >> 2] = c[(m + 12) >> 2]),
+                    Xi(f, d, e),
+                    (i = c[a >> 2] | 0),
+                    (j = +h[(i + 32) >> 3]),
+                    (k = +h[(i + 40) >> 3]),
+                    (n = +h[f >> 3]),
+                    (o = n / j),
+                    (p = +h[g >> 3]),
+                    (q = p / k),
+                    !((o >= 1.0) & (q >= 1.0)))
+                  : 0
+              ) {
+                o = o < q ? o : q;
+                o = o > 0.5 ? o : 0.5;
+                q = (+N(+((o * k) / p)) * p) / k;
+                p = ((+N(+((o * j) / n)) * n) / j) * j;
+                a = c[(i + 8) >> 2] | 0;
+                h[(a + 64) >> 3] = p;
+                h[(a + 72) >> 3] = q * k;
+                a = 1;
+              } else a = 0;
+              l = s;
+              return a | 0;
+            }
+            function Vi(a, b, d) {
+              a = a | 0;
+              b = +b;
+              d = +d;
+              var e = 0,
+                f = 0;
+              e = (a + 16) | 0;
+              a = 1;
+              while (1) {
+                f = c[e >> 2] | 0;
+                if ((a | 0) > (c[(f + 180) >> 2] | 0)) break;
+                Vi(c[((c[(f + 184) >> 2] | 0) + (a << 2)) >> 2] | 0, b, d);
+                a = (a + 1) | 0;
+              }
+              e = (f + 16) | 0;
+              h[e >> 3] = +h[e >> 3] * b;
+              e = (f + 24) | 0;
+              h[e >> 3] = +h[e >> 3] * d;
+              e = (f + 32) | 0;
+              h[e >> 3] = +h[e >> 3] * b;
+              f = (f + 40) | 0;
+              h[f >> 3] = +h[f >> 3] * d;
+              return;
+            }
+            function Wi(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0,
+                g = 0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              m = l;
+              l = (l + 32) | 0;
+              j = (m + 24) | 0;
+              g = (m + 16) | 0;
+              f = m;
+              n = c[(a + 16) >> 2] | 0;
+              e = +h[(n + 32) >> 3] - +h[(n + 16) >> 3];
+              d = +h[(n + 40) >> 3] - +h[(n + 24) >> 3];
+              i = e / d;
+              if (0) {
+                n = c[15712] | 0;
+                h[f >> 3] = i;
+                h[(f + 8) >> 3] = e * 0.0001 * d;
+                w4(n, 86745, f) | 0;
+                c[g >> 2] = xk(a) | 0;
+                w4(n, 86770, g) | 0;
+              }
+              d = +h[b >> 3];
+              do
+                if (!(i > d * 1.1)) {
+                  a = (b + 24) | 0;
+                  if (!(i <= d * 0.8)) {
+                    c[a >> 2] = 0;
+                    k = 9;
+                    break;
+                  }
+                  c[a >> 2] = -1;
+                  if (0) {
+                    U4(86780, 34, 1, c[15712] | 0) | 0;
+                    k = 9;
+                  }
+                } else {
+                  c[(b + 24) >> 2] = ~~((d * +(((c[(b + 20) >> 2] | 0) - (c[(b + 16) >> 2] | 0)) | 0)) / i);
+                  k = 9;
+                }
+              while (0);
+              if ((k | 0) == 9 ? 0 : 0) {
+                n = c[15712] | 0;
+                c[j >> 2] = c[(b + 24) >> 2];
+                w4(n, 86815, j) | 0;
+              }
+              l = m;
+              return;
+            }
+            function Xi(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0;
+              d = +h[(b + 8) >> 3] - +h[(c + 8) >> 3];
+              h[a >> 3] = +h[b >> 3] - +h[c >> 3];
+              h[(a + 8) >> 3] = d;
+              return;
+            }
+            function Yi(d, e) {
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0.0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0.0;
+              s = (gg(d) | 0) == (d | 0);
+              v = (d + 16) | 0;
+              w = c[v >> 2] | 0;
+              a: do
+                if (s) {
+                  f = b[(w + 236) >> 1] | 0;
+                  d = b[(w + 238) >> 1] | 0;
+                  q = (d << 16) >> 16;
+                  r = (w + 196) | 0;
+                  s = (w + 196) | 0;
+                  p = (f << 16) >> 16;
+                  i = -2147483647.0;
+                  g = 2147483647.0;
+                  while (1) {
+                    if ((p | 0) > (q | 0)) break;
+                    j = c[r >> 2] | 0;
+                    o = c[(j + (p << 6)) >> 2] | 0;
+                    if ((o | 0) != 0 ? ((t = c[(j + (p << 6) + 4) >> 2] | 0), (u = c[t >> 2] | 0), (u | 0) != 0) : 0) {
+                      l = 1;
+                      j = u;
+                      while (1) {
+                        j = c[(j + 16) >> 2] | 0;
+                        k = a[(j + 156) >> 0] | 0;
+                        if (!(((l | 0) < (o | 0)) & ((k << 24) >> 24 != 0))) break;
+                        j = c[(t + (l << 2)) >> 2] | 0;
+                        l = (l + 1) | 0;
+                      }
+                      if (!((k << 24) >> 24)) {
+                        m = +h[(j + 16) >> 3] - +h[(j + 88) >> 3];
+                        n = g < m;
+                        l = c[((c[s >> 2] | 0) + (p << 6) + 4) >> 2] | 0;
+                        k = (o + -2) | 0;
+                        j = (o + -1) | 0;
+                        while (1) {
+                          j = c[((c[(l + (j << 2)) >> 2] | 0) + 16) >> 2] | 0;
+                          if (!(a[(j + 156) >> 0] | 0)) break;
+                          else {
+                            j = k;
+                            k = (k + -1) | 0;
+                          }
+                        }
+                        x = +h[(j + 96) >> 3] + +h[(j + 16) >> 3];
+                        i = i > x ? i : x;
+                        g = n ? g : m;
+                      }
+                    }
+                    p = (p + 1) | 0;
+                  }
+                  k = c[(w + 180) >> 2] | 0;
+                  l = (w + 184) | 0;
+                  j = 1;
+                  while (1) {
+                    if ((j | 0) > (k | 0)) break a;
+                    u = c[((c[((c[l >> 2] | 0) + (j << 2)) >> 2] | 0) + 16) >> 2] | 0;
+                    x = +h[(u + 16) >> 3] + -8.0;
+                    m = +h[(u + 32) >> 3] + 8.0;
+                    j = (j + 1) | 0;
+                    i = i > m ? i : m;
+                    g = g < x ? g : x;
+                  }
+                } else {
+                  i = +(c[((c[((c[(w + 260) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0);
+                  g = +(c[((c[((c[(w + 256) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0);
+                  f = b[(w + 236) >> 1] | 0;
+                  d = b[(w + 238) >> 1] | 0;
+                }
+              while (0);
+              e = c[((c[(e + 16) >> 2] | 0) + 196) >> 2] | 0;
+              m =
+                +h[((c[((c[c[(e + (((d << 16) >> 16) << 6) + 4) >> 2] >> 2] | 0) + 16) >> 2] | 0) + 24) >> 3] -
+                +h[(w + 120) >> 3];
+              x =
+                +h[(w + 128) >> 3] +
+                +h[((c[((c[c[(e + (((f << 16) >> 16) << 6) + 4) >> 2] >> 2] | 0) + 16) >> 2] | 0) + 24) >> 3];
+              h[(w + 16) >> 3] = g;
+              h[(w + 24) >> 3] = m;
+              e = c[v >> 2] | 0;
+              h[(e + 32) >> 3] = i;
+              h[(e + 40) >> 3] = x;
+              return;
+            }
+            function Zi(a, d, e, f) {
+              a = a | 0;
+              d = d | 0;
+              e = +e;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              i = JK(96) | 0;
+              j = (i + 48) | 0;
+              c[j >> 2] = c[j >> 2] | 3;
+              c[i >> 2] = (c[i >> 2] & -4) | 2;
+              g = JK(176) | 0;
+              h = (i + 16) | 0;
+              c[h >> 2] = g;
+              c[((((c[i >> 2] & 3) | 0) == 3 ? i : j) + 40) >> 2] = a;
+              c[((((c[i >> 2] & 3) | 0) == 2 ? i : (i + -48) | 0) + 40) >> 2] = d;
+              if (e > 65535.0) {
+                _i(e);
+                e = 65535.0;
+                g = c[h >> 2] | 0;
+              }
+              b[(g + 170) >> 1] = ~~(e + (e >= 0.0 ? 0.5 : -0.5));
+              c[(g + 156) >> 2] = f;
+              gh(i) | 0;
+              return i | 0;
+            }
+            function _i(a) {
+              a = +a;
+              var b = 0,
+                d = 0;
+              b = l;
+              l = (l + 16) | 0;
+              d = b;
+              h[d >> 3] = a;
+              c[(d + 8) >> 2] = 65535;
+              gA(1, 86845, d) | 0;
+              l = b;
+              return;
+            }
+            function $i(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              a = ((c[(a + 16) >> 2] | 0) + 192) | 0;
+              while (1) {
+                a = c[a >> 2] | 0;
+                if (!a) break;
+                f = (a + 16) | 0;
+                e = c[f >> 2] | 0;
+                a = (e + 172) | 0;
+                d = c[(a + 4) >> 2] | 0;
+                e = (e + 248) | 0;
+                c[e >> 2] = c[a >> 2];
+                c[(e + 4) >> 2] = d;
+                e = c[f >> 2] | 0;
+                d = (e + 180) | 0;
+                a = c[(d + 4) >> 2] | 0;
+                e = (e + 256) | 0;
+                c[e >> 2] = c[d >> 2];
+                c[(e + 4) >> 2] = a;
+                e = c[f >> 2] | 0;
+                a = c[(e + 180) >> 2] | 0;
+                d = 0;
+                while (1)
+                  if (!(c[(a + (d << 2)) >> 2] | 0)) break;
+                  else d = (d + 1) | 0;
+                b = c[(e + 172) >> 2] | 0;
+                a = 0;
+                while (1)
+                  if (!(c[(b + (a << 2)) >> 2] | 0)) break;
+                  else a = (a + 1) | 0;
+                c[(e + 176) >> 2] = 0;
+                a = JK((((a + d) << 2) + 16) | 0) | 0;
+                e = c[f >> 2] | 0;
+                c[(e + 172) >> 2] = a;
+                c[(e + 184) >> 2] = 0;
+                e = JK(16) | 0;
+                a = c[f >> 2] | 0;
+                c[(a + 180) >> 2] = e;
+                a = (a + 164) | 0;
+              }
+              return;
+            }
+            function aj(d) {
+              d = d | 0;
+              var f = 0,
+                g = 0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0.0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0.0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0.0,
+                B = 0.0;
+              z = l;
+              l = (l + 16) | 0;
+              w = z;
+              x = (d + 16) | 0;
+              u = c[x >> 2] | 0;
+              y = c[(u + 196) >> 2] | 0;
+              d = (a[((c[((c[(d + 60) >> 2] | 0) + 16) >> 2] | 0) + 113) >> 0] & 1) != 0;
+              v = c[(u + 248) >> 2] | 0;
+              c[w >> 2] = v;
+              c[(w + 4) >> 2] = d ? 5 : v;
+              v = b[(u + 236) >> 1] | 0;
+              d = u;
+              while (1) {
+                if ((v | 0) > (b[(d + 238) >> 1] | 0)) break;
+                r = (y + (v << 6) + 4) | 0;
+                c[((c[((c[c[r >> 2] >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] = 0;
+                s = (y + (v << 6)) | 0;
+                t = +(c[(w + ((v & 1) << 2)) >> 2] | 0);
+                p = 0.0;
+                k = 0;
+                a: while (1) {
+                  if ((k | 0) >= (c[s >> 2] | 0)) break;
+                  f = c[r >> 2] | 0;
+                  m = c[(f + (k << 2)) >> 2] | 0;
+                  u = (m + 16) | 0;
+                  d = c[u >> 2] | 0;
+                  i = +h[(d + 96) >> 3];
+                  h[(d + 240) >> 3] = i;
+                  if ((c[(d + 208) >> 2] | 0) > 0) {
+                    j = 0;
+                    f = 0;
+                    while (1) {
+                      g = c[((c[(d + 204) >> 2] | 0) + (j << 2)) >> 2] | 0;
+                      if (!g) break;
+                      q = c[g >> 2] & 3;
+                      if (
+                        (c[(((q | 0) == 3 ? g : (g + 48) | 0) + 40) >> 2] | 0) ==
+                        (c[(((q | 0) == 2 ? g : (g + -48) | 0) + 40) >> 2] | 0)
+                      ) {
+                        f = ((kO(g) | 0) + f) | 0;
+                        d = c[u >> 2] | 0;
+                      }
+                      j = (j + 1) | 0;
+                    }
+                    q = (d + 96) | 0;
+                    i = +h[q >> 3] + +(f | 0);
+                    h[q >> 3] = i;
+                    f = c[r >> 2] | 0;
+                  }
+                  q = (k + 1) | 0;
+                  f = c[(f + (q << 2)) >> 2] | 0;
+                  if (f) {
+                    o = (f + 16) | 0;
+                    i = i + t + +h[((c[o >> 2] | 0) + 88) >> 3];
+                    Zi(m, f, i, 0) | 0;
+                    d = ~~(i + p);
+                    c[((c[o >> 2] | 0) + 232) >> 2] = d;
+                    p = +(d | 0);
+                    d = c[u >> 2] | 0;
+                  }
+                  f = c[(d + 112) >> 2] | 0;
+                  if (f) {
+                    j = c[(d + 256) >> 2] | 0;
+                    k = c[j >> 2] | 0;
+                    j = c[(j + 4) >> 2] | 0;
+                    d =
+                      (c[
+                        ((c[((c[((((c[k >> 2] & 3) | 0) == 2 ? k : (k + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                          236) >>
+                          2
+                      ] |
+                        0) >
+                      (c[
+                        ((c[((c[((((c[j >> 2] & 3) | 0) == 2 ? j : (j + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                          236) >>
+                          2
+                      ] |
+                        0);
+                    g = d ? j : k;
+                    j = d ? k : j;
+                    k = (f + 16) | 0;
+                    d = c[k >> 2] | 0;
+                    i = +(((O(c[((c[x >> 2] | 0) + 248) >> 2] | 0, e[(d + 170) >> 1] | 0) | 0) / 2) | 0 | 0);
+                    o = c[g >> 2] & 3;
+                    f = c[(((o | 0) == 2 ? g : (g + -48) | 0) + 40) >> 2] | 0;
+                    g = c[(((o | 0) == 3 ? g : (g + 48) | 0) + 40) >> 2] | 0;
+                    if (!(lj(g, f) | 0))
+                      Zi(
+                        f,
+                        g,
+                        +(~~(+h[((c[(f + 16) >> 2] | 0) + 96) >> 3] + i + +h[((c[(g + 16) >> 2] | 0) + 88) >> 3]) | 0),
+                        c[(d + 156) >> 2] | 0
+                      ) | 0;
+                    d = c[j >> 2] & 3;
+                    f = c[(((d | 0) == 3 ? j : (j + 48) | 0) + 40) >> 2] | 0;
+                    d = c[(((d | 0) == 2 ? j : (j + -48) | 0) + 40) >> 2] | 0;
+                    if (!(lj(d, f) | 0)) {
+                      Zi(
+                        f,
+                        d,
+                        +(~~(+h[((c[(f + 16) >> 2] | 0) + 96) >> 3] + i + +h[((c[(d + 16) >> 2] | 0) + 88) >> 3]) | 0),
+                        c[((c[k >> 2] | 0) + 156) >> 2] | 0
+                      ) | 0;
+                      o = 0;
+                    } else o = 0;
+                  } else o = 0;
+                  while (1) {
+                    d = c[u >> 2] | 0;
+                    if ((o | 0) >= (c[(d + 192) >> 2] | 0)) {
+                      k = q;
+                      continue a;
+                    }
+                    m = c[((c[(d + 188) >> 2] | 0) + (o << 2)) >> 2] | 0;
+                    k = c[m >> 2] & 3;
+                    g = c[(((k | 0) == 3 ? m : (m + 48) | 0) + 40) >> 2] | 0;
+                    k = c[(((k | 0) == 2 ? m : (m + -48) | 0) + 40) >> 2] | 0;
+                    j = (c[((c[(g + 16) >> 2] | 0) + 236) >> 2] | 0) < (c[((c[(k + 16) >> 2] | 0) + 236) >> 2] | 0);
+                    f = j ? g : k;
+                    g = j ? k : g;
+                    i = +h[((c[(g + 16) >> 2] | 0) + 88) >> 3] + +h[((c[(f + 16) >> 2] | 0) + 96) >> 3];
+                    k = (m + 16) | 0;
+                    j = ~~(i + +(O(c[((c[x >> 2] | 0) + 248) >> 2] | 0, e[((c[k >> 2] | 0) + 170) >> 1] | 0) | 0));
+                    n = dh(f, g) | 0;
+                    if (!n) {
+                      d = c[k >> 2] | 0;
+                      if (!(c[(d + 96) >> 2] | 0)) Zi(f, g, +(j | 0), c[(d + 156) >> 2] | 0) | 0;
+                    } else {
+                      A = +(j | 0);
+                      d = c[k >> 2] | 0;
+                      B = +h[(d + 136) >> 3];
+                      i = i + +(c[((c[x >> 2] | 0) + 248) >> 2] | 0) + +(~~(B + (B >= 0.0 ? 0.5 : -0.5)) | 0);
+                      f = ~~(i < A ? A : i);
+                      if ((f | 0) > 65535) {
+                        _i(+(f | 0));
+                        f = 65535;
+                        d = c[k >> 2] | 0;
+                      }
+                      k = c[(n + 16) >> 2] | 0;
+                      j = (k + 170) | 0;
+                      g = e[j >> 1] | 0;
+                      b[j >> 1] = (f | 0) < (g | 0) ? g : f;
+                      k = (k + 156) | 0;
+                      c[k >> 2] =
+                        c[((c[(((c[k >> 2] | 0) > (c[(d + 156) >> 2] | 0) ? n : m) + 16) >> 2] | 0) + 156) >> 2];
+                    }
+                    o = (o + 1) | 0;
+                  }
+                }
+                v = (v + 1) | 0;
+                d = c[x >> 2] | 0;
+              }
+              l = z;
+              return;
+            }
+            function bj(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0;
+              d = ((c[(b + 16) >> 2] | 0) + 192) | 0;
+              while (1) {
+                d = c[d >> 2] | 0;
+                if (!d) break;
+                g = (d + 16) | 0;
+                d = c[g >> 2] | 0;
+                e = c[(d + 256) >> 2] | 0;
+                a: do
+                  if (e) {
+                    f = 0;
+                    while (1) {
+                      e = c[(e + (f << 2)) >> 2] | 0;
+                      if (!e) break a;
+                      n = sh(b) | 0;
+                      d = (n + 16) | 0;
+                      a[((c[d >> 2] | 0) + 156) >> 0] = 2;
+                      l = (e + 16) | 0;
+                      k = c[l >> 2] | 0;
+                      i = ~~(+h[(k + 56) >> 3] - +h[(k + 16) >> 3]);
+                      m = (i | 0) > 0;
+                      j = m ? 0 : (0 - i) | 0;
+                      i = m ? i : 0;
+                      m = (e + 48) | 0;
+                      Zi(
+                        n,
+                        c[((((c[e >> 2] & 3) | 0) == 3 ? e : m) + 40) >> 2] | 0,
+                        +((i + 1) | 0),
+                        c[(k + 156) >> 2] | 0
+                      ) | 0;
+                      k = (e + -48) | 0;
+                      Zi(
+                        n,
+                        c[((((c[e >> 2] & 3) | 0) == 2 ? e : k) + 40) >> 2] | 0,
+                        +((j + 1) | 0),
+                        c[((c[l >> 2] | 0) + 156) >> 2] | 0
+                      ) | 0;
+                      l = c[e >> 2] & 3;
+                      i =
+                        ((c[((c[((c[(((l | 0) == 3 ? e : m) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0) - i) |
+                        0;
+                      e =
+                        ((c[((c[((c[(((l | 0) == 2 ? e : k) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0) - j) |
+                        0;
+                      c[((c[d >> 2] | 0) + 232) >> 2] = ((i | 0) < (e | 0) ? i : e) + -1;
+                      d = c[g >> 2] | 0;
+                      f = (f + 1) | 0;
+                      e = c[(d + 256) >> 2] | 0;
+                    }
+                  }
+                while (0);
+                d = (d + 164) | 0;
+              }
+              return;
+            }
+            function cj(a) {
+              a = a | 0;
+              if ((c[((c[(a + 16) >> 2] | 0) + 180) >> 2] | 0) > 0) {
+                gj(a);
+                hj(a);
+                ij(a);
+                jj(a);
+              }
+              return;
+            }
+            function dj(a) {
+              a = a | 0;
+              var b = 0.0,
+                d = 0.0,
+                e = 0,
+                f = 0;
+              e = (a + 16) | 0;
+              f = c[((c[e >> 2] | 0) + 8) >> 2] | 0;
+              if (
+                (c[(f + 84) >> 2] | 0) == 3 ? ((b = +h[(f + 64) >> 3]), (d = +h[(f + 72) >> 3]), !(d * b <= 1.0)) : 0
+              ) {
+                ej(a);
+                f = c[e >> 2] | 0;
+                d = ((c[(f + 116) >> 2] & 1) | 0) == 0 ? b : d;
+                Zi(c[(f + 256) >> 2] | 0, c[(f + 260) >> 2] | 0, d < 65535.0 ? d : 65535.0, 1e3) | 0;
+              }
+              return;
+            }
+            function ej(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              n = l;
+              l = (l + 16) | 0;
+              m = n;
+              e = ZO(a, c[47144] | 0, 8, 0) | 0;
+              fj(a);
+              i = (a + 16) | 0;
+              g = c[i >> 2] | 0;
+              j = c[(g + 256) >> 2] | 0;
+              k = c[(g + 260) >> 2] | 0;
+              f = +(e | 0);
+              e = b[(g + 236) >> 1] | 0;
+              while (1) {
+                if ((e | 0) > (b[(g + 238) >> 1] | 0)) break;
+                d = c[(g + 196) >> 2] | 0;
+                do
+                  if (c[(d + (e << 6)) >> 2] | 0) {
+                    d = c[c[(d + (e << 6) + 4) >> 2] >> 2] | 0;
+                    if (!d) {
+                      c[m >> 2] = KB(a) | 0;
+                      c[(m + 4) >> 2] = e;
+                      gA(1, 86929, m) | 0;
+                      break;
+                    } else {
+                      Zi(j, d, +h[((c[(d + 16) >> 2] | 0) + 88) >> 3] + f + +h[(g + 96) >> 3], 0) | 0;
+                      g = c[i >> 2] | 0;
+                      d = c[(g + 196) >> 2] | 0;
+                      d = c[((c[(d + (e << 6) + 4) >> 2] | 0) + (((c[(d + (e << 6)) >> 2] | 0) + -1) << 2)) >> 2] | 0;
+                      Zi(d, k, +h[((c[(d + 16) >> 2] | 0) + 96) >> 3] + f + +h[(g + 64) >> 3], 0) | 0;
+                      break;
+                    }
+                  }
+                while (0);
+                e = (e + 1) | 0;
+                g = c[i >> 2] | 0;
+              }
+              l = n;
+              return;
+            }
+            function fj(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              d = (b + 16) | 0;
+              if (!(c[((c[d >> 2] | 0) + 256) >> 2] | 0)) {
+                f = sh(gg(b) | 0) | 0;
+                a[((c[(f + 16) >> 2] | 0) + 156) >> 0] = 2;
+                e = sh(gg(b) | 0) | 0;
+                a[((c[(e + 16) >> 2] | 0) + 156) >> 0] = 2;
+                if (
+                  (c[((c[d >> 2] | 0) + 12) >> 2] | 0 ? (gg(b) | 0) != (b | 0) : 0)
+                    ? ((c[((c[((yC(b) | 0) + 16) >> 2] | 0) + 116) >> 2] & 1) | 0) == 0
+                    : 0
+                ) {
+                  b = c[d >> 2] | 0;
+                  Zi(f, e, +(~~+h[(b + 48 + ((+h[(b + 48) >> 3] > +h[(b + 80) >> 3] ? 0 : 2) << 4)) >> 3] | 0), 0) | 0;
+                }
+                d = c[d >> 2] | 0;
+                c[(d + 256) >> 2] = f;
+                c[(d + 260) >> 2] = e;
+              }
+              return;
+            }
+            function gj(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              do
+                if ((gg(a) | 0) != (a | 0)) {
+                  ej(a);
+                  a = (a + 16) | 0;
+                  b = c[a >> 2] | 0;
+                  b = dh(c[(b + 256) >> 2] | 0, c[(b + 260) >> 2] | 0) | 0;
+                  if (!b) {
+                    d = c[a >> 2] | 0;
+                    Zi(c[(d + 256) >> 2] | 0, c[(d + 260) >> 2] | 0, 1.0, 128) | 0;
+                    break;
+                  } else {
+                    d = ((c[(b + 16) >> 2] | 0) + 156) | 0;
+                    c[d >> 2] = (c[d >> 2] | 0) + 128;
+                    break;
+                  }
+                } else a = (a + 16) | 0;
+              while (0);
+              b = 1;
+              while (1) {
+                d = c[a >> 2] | 0;
+                if ((b | 0) > (c[(d + 180) >> 2] | 0)) break;
+                gj(c[((c[(d + 184) >> 2] | 0) + (b << 2)) >> 2] | 0);
+                b = (b + 1) | 0;
+              }
+              return;
+            }
+            function hj(d) {
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0.0,
+                n = 0,
+                o = 0;
+              k = ZO(d, c[47144] | 0, 8, 0) | 0;
+              o = (d + 16) | 0;
+              e = c[o >> 2] | 0;
+              m = +(k | 0);
+              k = b[(e + 236) >> 1] | 0;
+              while (1) {
+                if ((k | 0) > (b[(e + 238) >> 1] | 0)) {
+                  f = 1;
+                  break;
+                }
+                e = c[(e + 196) >> 2] | 0;
+                a: do
+                  if (c[(e + (k << 6)) >> 2] | 0 ? ((l = c[c[(e + (k << 6) + 4) >> 2] >> 2] | 0), l | 0) : 0) {
+                    i = (l + 16) | 0;
+                    f = c[((c[i >> 2] | 0) + 236) >> 2] | 0;
+                    while (1) {
+                      if ((f | 0) <= 0) break;
+                      f = (f + -1) | 0;
+                      j =
+                        c[
+                          ((c[((c[((c[((gg(d) | 0) + 16) >> 2] | 0) + 196) >> 2] | 0) + (k << 6) + 4) >> 2] | 0) +
+                            (f << 2)) >>
+                            2
+                        ] | 0;
+                      g = (j + 16) | 0;
+                      e = c[g >> 2] | 0;
+                      if (!(a[(e + 156) >> 0] | 0)) {
+                        n = 10;
+                        break;
+                      }
+                      if (kj(d, j) | 0) {
+                        n = 9;
+                        break;
+                      }
+                    }
+                    if ((n | 0) == 9) {
+                      e = c[g >> 2] | 0;
+                      n = 10;
+                    }
+                    if ((n | 0) == 10) {
+                      n = 0;
+                      Zi(j, c[((c[o >> 2] | 0) + 256) >> 2] | 0, +h[(e + 96) >> 3] + m, 0) | 0;
+                    }
+                    f =
+                      ((c[((c[((c[o >> 2] | 0) + 196) >> 2] | 0) + (k << 6)) >> 2] | 0) +
+                        (c[((c[i >> 2] | 0) + 236) >> 2] | 0)) |
+                      0;
+                    while (1) {
+                      if ((f | 0) >= (c[((c[((c[((gg(d) | 0) + 16) >> 2] | 0) + 196) >> 2] | 0) + (k << 6)) >> 2] | 0))
+                        break a;
+                      i =
+                        c[
+                          ((c[((c[((c[((gg(d) | 0) + 16) >> 2] | 0) + 196) >> 2] | 0) + (k << 6) + 4) >> 2] | 0) +
+                            (f << 2)) >>
+                            2
+                        ] | 0;
+                      g = (i + 16) | 0;
+                      e = c[g >> 2] | 0;
+                      if (!(a[(e + 156) >> 0] | 0)) break;
+                      if (!(kj(d, i) | 0)) f = (f + 1) | 0;
+                      else {
+                        n = 15;
+                        break;
+                      }
+                    }
+                    if ((n | 0) == 15) {
+                      n = 0;
+                      e = c[g >> 2] | 0;
+                    }
+                    Zi(c[((c[o >> 2] | 0) + 260) >> 2] | 0, i, +h[(e + 88) >> 3] + m, 0) | 0;
+                  }
+                while (0);
+                k = (k + 1) | 0;
+                e = c[o >> 2] | 0;
+              }
+              while (1) {
+                if ((f | 0) > (c[(e + 180) >> 2] | 0)) break;
+                hj(c[((c[(e + 184) >> 2] | 0) + (f << 2)) >> 2] | 0);
+                f = (f + 1) | 0;
+                e = c[o >> 2] | 0;
+              }
+              return;
+            }
+            function ij(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0.0,
+                e = 0,
+                f = 0,
+                g = 0;
+              e = ZO(a, c[47144] | 0, 8, 0) | 0;
+              fj(a);
+              b = (a + 16) | 0;
+              d = +(e | 0);
+              a = 1;
+              while (1) {
+                e = c[b >> 2] | 0;
+                if ((a | 0) > (c[(e + 180) >> 2] | 0)) break;
+                e = c[((c[(e + 184) >> 2] | 0) + (a << 2)) >> 2] | 0;
+                fj(e);
+                f = c[b >> 2] | 0;
+                g = (e + 16) | 0;
+                Zi(c[(f + 256) >> 2] | 0, c[((c[g >> 2] | 0) + 256) >> 2] | 0, +h[(f + 96) >> 3] + d, 0) | 0;
+                f = c[b >> 2] | 0;
+                Zi(c[((c[g >> 2] | 0) + 260) >> 2] | 0, c[(f + 260) >> 2] | 0, +h[(f + 64) >> 3] + d, 0) | 0;
+                ij(e);
+                a = (a + 1) | 0;
+              }
+              return;
+            }
+            function jj(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0.0,
+                n = 0,
+                o = 0;
+              d = ZO(a, c[47144] | 0, 8, 0) | 0;
+              n = (a + 16) | 0;
+              a = 1;
+              while (1) {
+                f = c[n >> 2] | 0;
+                e = c[(f + 180) >> 2] | 0;
+                if ((a | 0) > (e | 0)) break;
+                fj(c[((c[(f + 184) >> 2] | 0) + (a << 2)) >> 2] | 0);
+                a = (a + 1) | 0;
+              }
+              m = +(d | 0);
+              l = 1;
+              a = e;
+              d = f;
+              while (1) {
+                if ((l | 0) > (a | 0)) break;
+                k = (l + 1) | 0;
+                j = k;
+                while (1) {
+                  e = c[(d + 184) >> 2] | 0;
+                  f = c[(e + (l << 2)) >> 2] | 0;
+                  if ((j | 0) > (a | 0)) break;
+                  e = c[(e + (j << 2)) >> 2] | 0;
+                  g = (b[((c[(f + 16) >> 2] | 0) + 236) >> 1] | 0) > (b[((c[(e + 16) >> 2] | 0) + 236) >> 1] | 0);
+                  i = g ? e : f;
+                  e = g ? f : e;
+                  f = c[(i + 16) >> 2] | 0;
+                  g = c[(e + 16) >> 2] | 0;
+                  o = b[(g + 236) >> 1] | 0;
+                  h = (o << 16) >> 16;
+                  if ((b[(f + 238) >> 1] | 0) >= (o << 16) >> 16) {
+                    a =
+                      (c[
+                        ((c[((c[c[((c[(f + 196) >> 2] | 0) + (h << 6) + 4) >> 2] >> 2] | 0) + 16) >> 2] | 0) + 236) >> 2
+                      ] |
+                        0) <
+                      (c[
+                        ((c[((c[c[((c[(g + 196) >> 2] | 0) + (h << 6) + 4) >> 2] >> 2] | 0) + 16) >> 2] | 0) + 236) >> 2
+                      ] |
+                        0);
+                    Zi(
+                      c[((c[((a ? i : e) + 16) >> 2] | 0) + 260) >> 2] | 0,
+                      c[((c[((a ? e : i) + 16) >> 2] | 0) + 256) >> 2] | 0,
+                      m,
+                      0
+                    ) | 0;
+                    a = c[n >> 2] | 0;
+                    d = a;
+                    a = c[(a + 180) >> 2] | 0;
+                  }
+                  j = (j + 1) | 0;
+                }
+                jj(f);
+                d = c[n >> 2] | 0;
+                l = k;
+                a = c[(d + 180) >> 2] | 0;
+              }
+              return;
+            }
+            function kj(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              d = c[(d + 16) >> 2] | 0;
+              if ((a[(d + 156) >> 0] | 0) == 1) {
+                d = c[c[(d + 256) >> 2] >> 2] | 0;
+                while (1) {
+                  e = c[((c[(d + 16) >> 2] | 0) + 116) >> 2] | 0;
+                  if (!e) break;
+                  else d = e;
+                }
+                if (!(HC(b, c[((((c[d >> 2] & 3) | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0) | 0))
+                  d = ((HC(b, c[((((c[d >> 2] & 3) | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0) | 0) == 0) & 1;
+                else d = 0;
+              } else d = 0;
+              return d | 0;
+            }
+            function lj(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return mj(a, b) | 0;
+            }
+            function mj(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              a: do
+                if ((a | 0) == (b | 0)) a = 1;
+                else {
+                  d = c[((c[(a + 16) >> 2] | 0) + 180) >> 2] | 0;
+                  a = 0;
+                  while (1) {
+                    e = c[(d + (a << 2)) >> 2] | 0;
+                    if (!e) {
+                      a = 0;
+                      break a;
+                    }
+                    if (!(mj(c[((((c[e >> 2] & 3) | 0) == 2 ? e : (e + -48) | 0) + 40) >> 2] | 0, b) | 0))
+                      a = (a + 1) | 0;
+                    else {
+                      a = 1;
+                      break;
+                    }
+                  }
+                }
+              while (0);
+              return a | 0;
+            }
+            function nj(d) {
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = (d + 16) | 0;
+              d = c[k >> 2] | 0;
+              j = b[(d + 236) >> 1] | 0;
+              while (1) {
+                if ((j | 0) > (b[(d + 238) >> 1] | 0)) break;
+                h = c[(d + 196) >> 2] | 0;
+                g = c[(h + (j << 6)) >> 2] | 0;
+                h = (h + (j << 6) + 4) | 0;
+                i = 0;
+                f = 0;
+                while (1) {
+                  if ((f | 0) >= (g | 0)) break;
+                  e = c[((c[((c[h >> 2] | 0) + (f << 2)) >> 2] | 0) + 16) >> 2] | 0;
+                  c[(e + 236) >> 2] = i;
+                  if ((a[(e + 159) >> 0] | 0) == 6) e = c[(e + 216) >> 2] | 0;
+                  else e = 1;
+                  i = (e + i) | 0;
+                  f = (f + 1) | 0;
+                }
+                if ((i | 0) > (g | 0)) {
+                  d = c[h >> 2] | 0;
+                  if (!d) d = KK(((i << 2) + 4) | 0) | 0;
+                  else d = MK(d, ((i << 2) + 4) | 0) | 0;
+                  f = c[((c[k >> 2] | 0) + 196) >> 2] | 0;
+                  c[(f + (j << 6) + 4) >> 2] = d;
+                  e = c[(f + (j << 6)) >> 2] | 0;
+                  while (1) {
+                    d = (e + -1) | 0;
+                    if ((e | 0) <= 0) break;
+                    h = c[(f + (j << 6) + 4) >> 2] | 0;
+                    e = c[(h + (d << 2)) >> 2] | 0;
+                    c[(h + (c[((c[(e + 16) >> 2] | 0) + 236) >> 2] << 2)) >> 2] = e;
+                    e = d;
+                    f = c[((c[k >> 2] | 0) + 196) >> 2] | 0;
+                  }
+                  c[(f + (j << 6)) >> 2] = i;
+                  c[((c[(f + (j << 6) + 4) >> 2] | 0) + (i << 2)) >> 2] = 0;
+                  d = c[k >> 2] | 0;
+                }
+                j = (j + 1) | 0;
+              }
+              return;
+            }
+            function oj(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              o = l;
+              l = (l + 48) | 0;
+              n = (o + 32) | 0;
+              m = (o + 8) | 0;
+              d = (o + 24) | 0;
+              k = (o + 16) | 0;
+              j = o;
+              e = (b + 16) | 0;
+              f = c[e >> 2] | 0;
+              a: do
+                if ((c[(f + 216) >> 2] | 0) >= 2) {
+                  c[m >> 2] = ~~(+h[(f + 16) >> 3] - +h[(f + 88) >> 3]);
+                  c[(m + 4) >> 2] = ~~+h[(f + 24) >> 3];
+                  c[n >> 2] = c[m >> 2];
+                  c[(n + 4) >> 2] = c[(m + 4) >> 2];
+                  pj(d, b, n);
+                  g = d;
+                  i = c[(g + 4) >> 2] | 0;
+                  d = m;
+                  c[d >> 2] = c[g >> 2];
+                  c[(d + 4) >> 2] = i;
+                  d = c[e >> 2] | 0;
+                  if ((c[(d + 184) >> 2] | 0) > 0) {
+                    j = c[c[(d + 180) >> 2] >> 2] | 0;
+                    d = ((c[(d + 236) >> 2] | 0) + 1) | 0;
+                    j = _A(a, c[((((c[j >> 2] & 3) | 0) == 2 ? j : (j + -48) | 0) + 40) >> 2] | 0) | 0;
+                    while (1) {
+                      if (!j) break a;
+                      i = ((c[j >> 2] & 3) | 0) == 2 ? j : (j + -48) | 0;
+                      e = (i + 48) | 0;
+                      f = c[((((c[i >> 2] & 3) | 0) == 3 ? i : e) + 40) >> 2] | 0;
+                      if ((f | 0) != (b | 0) ? (fP(f) | 0) == (b | 0) : 0) {
+                        f = c[((((c[i >> 2] & 3) | 0) == 3 ? i : e) + 40) >> 2] | 0;
+                        c[n >> 2] = c[m >> 2];
+                        c[(n + 4) >> 2] = c[(m + 4) >> 2];
+                        qj(k, a, f, n, d);
+                        f = k;
+                        e = c[(f + 4) >> 2] | 0;
+                        g = m;
+                        c[g >> 2] = c[f >> 2];
+                        c[(g + 4) >> 2] = e;
+                        xh(i);
+                        g = (i + -48) | 0;
+                        e = c[((c[((((c[i >> 2] & 3) | 0) == 2 ? i : g) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                        f = c[(e + 172) >> 2] | 0;
+                        if (!f) e = KK(((c[(e + 176) >> 2] << 2) + 8) | 0) | 0;
+                        else e = MK(f, ((c[(e + 176) >> 2] << 2) + 8) | 0) | 0;
+                        c[((c[((c[((((c[i >> 2] & 3) | 0) == 2 ? i : g) + 40) >> 2] | 0) + 16) >> 2] | 0) + 172) >> 2] =
+                          e;
+                        p = c[((c[((((c[i >> 2] & 3) | 0) == 2 ? i : g) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                        e = c[(p + 172) >> 2] | 0;
+                        p = (p + 176) | 0;
+                        f = c[p >> 2] | 0;
+                        c[p >> 2] = f + 1;
+                        c[(e + (f << 2)) >> 2] = i;
+                        i = c[((c[((((c[i >> 2] & 3) | 0) == 2 ? i : g) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                        c[((c[(i + 172) >> 2] | 0) + (c[(i + 176) >> 2] << 2)) >> 2] = 0;
+                        d = (d + 1) | 0;
+                      }
+                      j = $A(a, j) | 0;
+                    }
+                  } else {
+                    i = c[c[(d + 172) >> 2] >> 2] | 0;
+                    d = ((c[(d + 236) >> 2] | 0) + 1) | 0;
+                    i = XA(a, c[((((c[i >> 2] & 3) | 0) == 3 ? i : (i + 48) | 0) + 40) >> 2] | 0) | 0;
+                    while (1) {
+                      if (!i) break a;
+                      e = (i + -48) | 0;
+                      f = c[((((c[i >> 2] & 3) | 0) == 2 ? i : e) + 40) >> 2] | 0;
+                      if ((f | 0) != (b | 0) ? (fP(f) | 0) == (b | 0) : 0) {
+                        f = c[((((c[i >> 2] & 3) | 0) == 2 ? i : e) + 40) >> 2] | 0;
+                        c[n >> 2] = c[m >> 2];
+                        c[(n + 4) >> 2] = c[(m + 4) >> 2];
+                        qj(j, a, f, n, d);
+                        f = j;
+                        e = c[(f + 4) >> 2] | 0;
+                        g = m;
+                        c[g >> 2] = c[f >> 2];
+                        c[(g + 4) >> 2] = e;
+                        xh(i);
+                        g = (i + 48) | 0;
+                        e = c[((c[((((c[i >> 2] & 3) | 0) == 3 ? i : g) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                        f = c[(e + 180) >> 2] | 0;
+                        if (!f) e = KK(((c[(e + 184) >> 2] << 2) + 8) | 0) | 0;
+                        else e = MK(f, ((c[(e + 184) >> 2] << 2) + 8) | 0) | 0;
+                        c[((c[((c[((((c[i >> 2] & 3) | 0) == 3 ? i : g) + 40) >> 2] | 0) + 16) >> 2] | 0) + 180) >> 2] =
+                          e;
+                        f = c[((c[((((c[i >> 2] & 3) | 0) == 3 ? i : g) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                        k = c[(f + 180) >> 2] | 0;
+                        f = (f + 184) | 0;
+                        p = c[f >> 2] | 0;
+                        c[f >> 2] = p + 1;
+                        c[(k + (p << 2)) >> 2] = i;
+                        p = c[((c[((((c[i >> 2] & 3) | 0) == 3 ? i : g) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                        c[((c[(p + 180) >> 2] | 0) + (c[(p + 184) >> 2] << 2)) >> 2] = 0;
+                        d = (d + 1) | 0;
+                      }
+                      i = ZA(a, i) | 0;
+                    }
+                  }
+                }
+              while (0);
+              l = o;
+              return;
+            }
+            function pj(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0;
+              qQ(b, c[((c[((xC(b) | 0) + 16) >> 2] | 0) + 116) >> 2] & 1);
+              e = c[(b + 16) >> 2] | 0;
+              h[(e + 24) >> 3] = +(c[(d + 4) >> 2] | 0);
+              f = +h[(e + 88) >> 3] + +(c[d >> 2] | 0);
+              h[(e + 16) >> 3] = f;
+              f = f + +h[(e + 96) >> 3];
+              c[d >> 2] = ~~(f + +(c[((c[((xC(b) | 0) + 16) >> 2] | 0) + 248) >> 2] | 0));
+              e = d;
+              b = c[(e + 4) >> 2] | 0;
+              d = a;
+              c[d >> 2] = c[e >> 2];
+              c[(d + 4) >> 2] = b;
+              return;
+            }
+            function qj(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              i = l;
+              l = (l + 16) | 0;
+              h = i;
+              b = gg(b) | 0;
+              g = fP(d) | 0;
+              if ((g | 0) != (d | 0)) ph(g, d);
+              j = c[(d + 16) >> 2] | 0;
+              c[(j + 236) >> 2] = f;
+              g = c[((c[(g + 16) >> 2] | 0) + 232) >> 2] | 0;
+              c[(j + 232) >> 2] = g;
+              c[((c[((c[((c[(b + 16) >> 2] | 0) + 196) >> 2] | 0) + (g << 6) + 4) >> 2] | 0) + (f << 2)) >> 2] = d;
+              c[h >> 2] = c[e >> 2];
+              c[(h + 4) >> 2] = c[(e + 4) >> 2];
+              pj(a, d, h);
+              l = i;
+              return;
+            }
+            function rj(a) {
+              a = a | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0.0;
+              m = c[((c[((gg(a) | 0) + 16) >> 2] | 0) + 196) >> 2] | 0;
+              if ((gg(a) | 0) == (a | 0)) j = 8.0;
+              else j = +(ZO(a, c[47144] | 0, 8, 0) | 0);
+              l = (a + 16) | 0;
+              g = c[l >> 2] | 0;
+              f = 0;
+              k = 1;
+              e = +h[(g + 120) >> 3];
+              d = +h[(g + 128) >> 3];
+              while (1) {
+                if ((k | 0) > (c[(g + 180) >> 2] | 0)) break;
+                i = c[((c[(g + 184) >> 2] | 0) + (k << 2)) >> 2] | 0;
+                f = rj(i) | 0 | f;
+                i = c[(i + 16) >> 2] | 0;
+                g = c[l >> 2] | 0;
+                if ((b[(i + 238) >> 1] | 0) == (b[(g + 238) >> 1] | 0)) {
+                  n = +h[(i + 120) >> 3] + j;
+                  e = e > n ? e : n;
+                }
+                if ((b[(i + 236) >> 1] | 0) == (b[(g + 236) >> 1] | 0)) {
+                  n = +h[(i + 128) >> 3] + j;
+                  d = d > n ? d : n;
+                }
+                k = (k + 1) | 0;
+              }
+              if ((gg(a) | 0) != (a | 0) ? (c[((c[l >> 2] | 0) + 12) >> 2] | 0) != 0 : 0)
+                if (!(c[((c[((yC(a) | 0) + 16) >> 2] | 0) + 116) >> 2] & 1)) {
+                  k = c[l >> 2] | 0;
+                  f = 1;
+                  e = +h[(k + 56) >> 3] + e;
+                  d = +h[(k + 88) >> 3] + d;
+                } else f = 1;
+              k = c[l >> 2] | 0;
+              h[(k + 120) >> 3] = e;
+              h[(k + 128) >> 3] = d;
+              if ((gg(a) | 0) != (a | 0)) {
+                l = c[l >> 2] | 0;
+                a = (m + (b[(l + 236) >> 1] << 6) + 24) | 0;
+                n = +h[a >> 3];
+                h[a >> 3] = n > d ? n : d;
+                m = (m + (b[(l + 238) >> 1] << 6) + 16) | 0;
+                n = +h[m >> 3];
+                h[m >> 3] = n > e ? n : e;
+              }
+              return f | 0;
+            }
+            function sj(a, d) {
+              a = a | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0.0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0.0,
+                q = 0.0;
+              o = c[((c[((gg(a) | 0) + 16) >> 2] | 0) + 196) >> 2] | 0;
+              if ((gg(a) | 0) == (a | 0)) e = 0;
+              else e = ZO(a, c[47144] | 0, 8, 0) | 0;
+              l = (a + 16) | 0;
+              i = c[l >> 2] | 0;
+              m = (e + d) | 0;
+              k = +(e | 0);
+              j = 1;
+              f = +h[(i + 128) >> 3];
+              g = +h[(i + 120) >> 3];
+              e = i;
+              while (1) {
+                if ((j | 0) > (c[(e + 180) >> 2] | 0)) break;
+                i = c[((c[(e + 184) >> 2] | 0) + (j << 2)) >> 2] | 0;
+                sj(i, m);
+                i = c[(i + 16) >> 2] | 0;
+                e = c[l >> 2] | 0;
+                if ((b[(i + 238) >> 1] | 0) == (b[(e + 238) >> 1] | 0)) {
+                  q = +h[(i + 120) >> 3] + k;
+                  g = g > q ? g : q;
+                }
+                if ((b[(i + 236) >> 1] | 0) == (b[(e + 236) >> 1] | 0)) {
+                  q = +h[(i + 128) >> 3] + k;
+                  f = f > q ? f : q;
+                }
+                j = (j + 1) | 0;
+              }
+              h[(e + 120) >> 3] = g;
+              h[(e + 128) >> 3] = f;
+              if (
+                ((gg(a) | 0) != (a | 0) ? ((n = c[l >> 2] | 0), c[(n + 12) >> 2] | 0) : 0)
+                  ? ((p =
+                      -g -
+                      f +
+                      +h[(n + 48 + ((+h[(n + 104) >> 3] > +h[(n + 72) >> 3] ? 3 : 1) << 4) + 8) >> 3] -
+                      +h[((c[((c[c[(o + (b[(n + 236) >> 1] << 6) + 4) >> 2] >> 2] | 0) + 16) >> 2] | 0) + 24) >> 3] +
+                      +h[((c[((c[c[(o + (b[(n + 238) >> 1] << 6) + 4) >> 2] >> 2] | 0) + 16) >> 2] | 0) + 24) >> 3]),
+                    p > 0.0)
+                  : 0
+              )
+                tj(a, ~~p, d);
+              if ((gg(a) | 0) != (a | 0)) {
+                n = c[l >> 2] | 0;
+                m = (o + (b[(n + 236) >> 1] << 6) + 24) | 0;
+                q = +h[m >> 3];
+                p = +h[(n + 128) >> 3];
+                h[m >> 3] = q > p ? q : p;
+                o = (o + (b[(n + 238) >> 1] << 6) + 16) | 0;
+                p = +h[o >> 3];
+                q = +h[(n + 120) >> 3];
+                h[o >> 3] = p > q ? p : q;
+              }
+              return;
+            }
+            function tj(a, d, e) {
+              a = a | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0.0,
+                o = 0.0,
+                p = 0,
+                q = 0,
+                r = 0;
+              k = c[((gg(a) | 0) + 16) >> 2] | 0;
+              q = c[(k + 196) >> 2] | 0;
+              p = c[(a + 16) >> 2] | 0;
+              a = b[(p + 238) >> 1] | 0;
+              f = b[(p + 236) >> 1] | 0;
+              l = (((d + 1) | 0) / 2) | 0;
+              m = (p + 120) | 0;
+              n = +h[m >> 3];
+              o = +(l | 0);
+              i = +(e | 0);
+              e = ~~(o + i + n - +h[(q + (a << 6) + 16) >> 3]);
+              if ((e | 0) > 0) {
+                g = +(e | 0);
+                while (1) {
+                  if ((a | 0) < (f | 0)) break;
+                  if ((c[(q + (a << 6)) >> 2] | 0) > 0) {
+                    r = ((c[((c[c[(q + (a << 6) + 4) >> 2] >> 2] | 0) + 16) >> 2] | 0) + 24) | 0;
+                    h[r >> 3] = +h[r >> 3] + g;
+                  }
+                  a = (a + -1) | 0;
+                }
+                j = +h[(p + 128) >> 3];
+                a = e;
+                g = j + +((d - l) | 0);
+              } else {
+                j = +h[(p + 128) >> 3];
+                a = (d - l) | 0;
+                g = j;
+              }
+              a = ~~(+(a | 0) + i + g - +h[(q + (f << 6) + 24) >> 3]);
+              a: do
+                if ((a | 0) > 0) {
+                  e = b[(k + 236) >> 1] | 0;
+                  g = +(a | 0);
+                  while (1) {
+                    a = (f + -1) | 0;
+                    if ((f | 0) <= (e | 0)) break a;
+                    if ((c[(q + (a << 6)) >> 2] | 0) <= 0) {
+                      f = a;
+                      continue;
+                    }
+                    f = ((c[((c[c[(q + (a << 6) + 4) >> 2] >> 2] | 0) + 16) >> 2] | 0) + 24) | 0;
+                    h[f >> 3] = +h[f >> 3] + g;
+                    f = a;
+                  }
+                }
+              while (0);
+              h[(p + 128) >> 3] = j + +((d - l) | 0);
+              h[m >> 3] = n + o;
+              return;
+            }
+            function uj(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = c[(b + 16) >> 2] | 0;
+              f = a[(e + 84) >> 0] | 0;
+              b = c[(d + 16) >> 2] | 0;
+              do
+                if ((f << 24) >> 24 == (a[(b + 84) >> 0] | 0)) {
+                  if (+h[(e + 56) >> 3] == +h[(b + 56) >> 3]) {
+                    if (!((f << 24) >> 24 == 0 ? 1 : +h[(e + 64) >> 3] == +h[(b + 64) >> 3])) {
+                      b = 0;
+                      break;
+                    }
+                  } else if ((f << 24) >> 24) {
+                    b = 0;
+                    break;
+                  }
+                  if (+h[(e + 16) >> 3] == +h[(b + 16) >> 3] ? +h[(e + 24) >> 3] == +h[(b + 24) >> 3] : 0) {
+                    b = 1;
+                    break;
+                  }
+                  b = ((a[(e + 44) >> 0] | 0) == 0) & 1;
+                } else b = 0;
+              while (0);
+              return b | 0;
+            }
+            function vj(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = (a + 16) | 0;
+              d = c[i >> 2] | 0;
+              b[(d + 236) >> 1] = 32767;
+              b[(d + 238) >> 1] = -1;
+              d = 0;
+              h = jC(a) | 0;
+              while (1) {
+                e = c[i >> 2] | 0;
+                if (!h) break;
+                f = (e + 238) | 0;
+                g = c[((c[(h + 16) >> 2] | 0) + 232) >> 2] | 0;
+                if ((g | 0) > (b[f >> 1] | 0)) b[f >> 1] = g;
+                e = (e + 236) | 0;
+                if ((g | 0) < (b[e >> 1] | 0)) b[e >> 1] = g;
+                if (!d) d = h;
+                else d = (g | 0) < (c[((c[(d + 16) >> 2] | 0) + 232) >> 2] | 0) ? h : d;
+                h = kC(a, h) | 0;
+              }
+              c[(e + 264) >> 2] = d;
+              return;
+            }
+            function wj(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0.0;
+              b = QA(a, 86974) | 0;
+              if (!b) b = 2147483647;
+              else {
+                g = +r5(b);
+                b = ~~(g * +(tB(a) | 0));
+              }
+              e = (a + 16) | 0;
+              d = 0;
+              while (1) {
+                f = c[e >> 2] | 0;
+                if ((d | 0) >= (c[(f + 220) >> 2] | 0)) break;
+                c[(f + 192) >> 2] = c[((c[(f + 216) >> 2] | 0) + (d << 2)) >> 2];
+                uL(a, ((c[(f + 180) >> 2] | 0) == 0) & 1, b) | 0;
+                d = (d + 1) | 0;
+              }
+              return;
+            }
+            function xj(a, d) {
+              a = a | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              f = l;
+              l = (l + 16) | 0;
+              e = f;
+              if (!(QA(a, 86983) | 0)) zj(a, d);
+              else {
+                g = ((c[(a + 16) >> 2] | 0) + 136) | 0;
+                b[g >> 1] = b[g >> 1] | 16;
+                yj(a, d);
+              }
+              if (0) {
+                g = c[15712] | 0;
+                a = c[(a + 16) >> 2] | 0;
+                d = b[(a + 236) >> 1] | 0;
+                c[e >> 2] = b[(a + 238) >> 1];
+                c[(e + 4) >> 2] = d;
+                w4(g, 86991, e) | 0;
+              }
+              l = f;
+              return;
+            }
+            function yj(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0.0;
+              i = l;
+              l = (l + 16) | 0;
+              h = i;
+              c[46747] = 0;
+              a[h >> 0] = a[18588] | 0;
+              a[(h + 1) >> 0] = a[18589] | 0;
+              a[(h + 2) >> 0] = a[18590] | 0;
+              a[(h + 3) >> 0] = a[18591] | 0;
+              h = oB(87201, h, 0) | 0;
+              TC(h, 87230, 280, 1) | 0;
+              FC(h, 17404, 17344);
+              Aj(b);
+              e = QA(b, 86974) | 0;
+              if (!e) f = 2147483647;
+              else {
+                j = +r5(e);
+                f = ~~(j * +(tB(b) | 0));
+              }
+              Qj(b, 0);
+              Rj(b, h);
+              Sj(b, h);
+              Tj(b, h, 0, 0);
+              Uj(h);
+              g = Vj(h) | 0;
+              Wj(h);
+              if (d | 0) {
+                Kk(h);
+                yk(h);
+              }
+              e = QA(b, 102586) | 0;
+              if (!e) e = -1;
+              else e = q5(e) | 0;
+              NK(h, 1, f, e) | 0;
+              Xj(b, h, g);
+              sB(h) | 0;
+              l = i;
+              return;
+            }
+            function zj(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              g = l;
+              l = (l + 32) | 0;
+              f = (g + 16) | 0;
+              e = (g + 8) | 0;
+              d = g;
+              Aj(a);
+              do
+                if (!b) {
+                  Bj(a, a);
+                  Nk(a);
+                  Cj(d, a);
+                  h = d;
+                  d = c[(h + 4) >> 2] | 0;
+                  b = e;
+                  c[b >> 2] = c[h >> 2];
+                  c[(b + 4) >> 2] = d;
+                  Gl(a, 0);
+                  b = 0;
+                } else {
+                  Kk(a);
+                  yk(a);
+                  Bj(a, a);
+                  Nk(a);
+                  Cj(d, a);
+                  i = d;
+                  d = c[(i + 4) >> 2] | 0;
+                  h = e;
+                  c[h >> 2] = c[i >> 2];
+                  c[(h + 4) >> 2] = d;
+                  Gl(a, 0);
+                  h = c[(a + 16) >> 2] | 0;
+                  if ((c[(h + 220) >> 2] | 0) <= 1 ? (c[(h + 180) >> 2] | 0) <= 0 : 0) break;
+                  c[(b + 32) >> 2] = 1;
+                  b = 0;
+                }
+              while (0);
+              vk(a);
+              c[f >> 2] = c[e >> 2];
+              c[(f + 4) >> 2] = c[(e + 4) >> 2];
+              if (Dj(a, f) | 0) Gl(a, 0);
+              if (!b) wj(a);
+              else zk(a, b);
+              Ej(a, b);
+              Fj(a);
+              l = g;
+              return;
+            }
+            function Aj(d) {
+              d = d | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              if (a[((c[((c[(d + 60) >> 2] | 0) + 16) >> 2] | 0) + 113) >> 0] & 1) {
+                g = jC(d) | 0;
+                while (1) {
+                  if (!g) break;
+                  f = XA(d, g) | 0;
+                  while (1) {
+                    if (!f) break;
+                    h = ((c[(f + 16) >> 2] | 0) + 170) | 0;
+                    b[h >> 1] = (e[h >> 1] | 0) << 1;
+                    f = ZA(d, f) | 0;
+                  }
+                  g = kC(d, g) | 0;
+                }
+                h = ((c[(d + 16) >> 2] | 0) + 252) | 0;
+                c[h >> 2] = ((((c[h >> 2] | 0) + 1) | 0) / 2) | 0;
+              }
+              return;
+            }
+            function Bj(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              b = OD(b) | 0;
+              while (1) {
+                if (!b) break;
+                d = Nj(b) | 0;
+                do
+                  if (d)
+                    if (((d | 0) == 7) & ((c[47135] | 0) == 100)) {
+                      Jj(a, b);
+                      break;
+                    } else {
+                      Oj(a, b, d);
+                      break;
+                    }
+                  else Bj(a, b);
+                while (0);
+                b = PD(b) | 0;
+              }
+              return;
+            }
+            function Cj(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              i = (d + 16) | 0;
+              e = c[i >> 2] | 0;
+              d = c[(e + 228) >> 2] | 0;
+              e = c[(e + 224) >> 2] | 0;
+              f = (e | 0) == 0;
+              if (!d)
+                if (f) {
+                  j = 0;
+                  k = 0;
+                } else g = 4;
+              else if (f) g = 5;
+              else g = 4;
+              if ((g | 0) == 4) {
+                d = fP(e) | 0;
+                e = c[i >> 2] | 0;
+                c[(e + 224) >> 2] = d;
+                d = c[(e + 228) >> 2] | 0;
+                if (!d) {
+                  h = 0;
+                  d = e;
+                  g = 12;
+                } else g = 5;
+              }
+              do
+                if ((g | 0) == 5) {
+                  d = fP(d) | 0;
+                  e = c[i >> 2] | 0;
+                  c[(e + 228) >> 2] = d;
+                  if (d) {
+                    e = (d + 16) | 0;
+                    d = c[e >> 2] | 0;
+                    f = ((a[(d + 159) >> 0] | 0) == 5) & 1;
+                    while (1) {
+                      d = c[c[(d + 180) >> 2] >> 2] | 0;
+                      if (!d) {
+                        g = 11;
+                        break;
+                      }
+                      h = c[((((c[d >> 2] & 3) | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0;
+                      if ((h | 0) != (fP(h) | 0)) {
+                        g = 9;
+                        break;
+                      }
+                      uk(d);
+                      d = c[e >> 2] | 0;
+                    }
+                    if ((g | 0) == 9) qa(87094, 87034, 346, 87126);
+                    else if ((g | 0) == 11) {
+                      h = f;
+                      d = c[i >> 2] | 0;
+                      g = 12;
+                      break;
+                    }
+                  } else {
+                    h = 0;
+                    d = e;
+                    g = 12;
+                  }
+                }
+              while (0);
+              a: do
+                if ((g | 0) == 12) {
+                  d = c[(d + 224) >> 2] | 0;
+                  if (!d) {
+                    j = 0;
+                    k = h;
+                  } else {
+                    e = (d + 16) | 0;
+                    d = c[e >> 2] | 0;
+                    f = ((a[(d + 159) >> 0] | 0) == 3) & 1;
+                    while (1) {
+                      d = c[c[(d + 172) >> 2] >> 2] | 0;
+                      if (!d) {
+                        j = f;
+                        k = h;
+                        break a;
+                      }
+                      i = c[((((c[d >> 2] & 3) | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0;
+                      if ((i | 0) != (fP(i) | 0)) break;
+                      uk(d);
+                      d = c[e >> 2] | 0;
+                    }
+                    qa(87139, 87034, 353, 87126);
+                  }
+                }
+              while (0);
+              c[b >> 2] = j;
+              c[(b + 4) >> 2] = k;
+              return;
+            }
+            function Dj(a, d) {
+              a = a | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              j = (a + 16) | 0;
+              i = c[j >> 2] | 0;
+              if ((c[(i + 228) >> 2] | 0) == 0 ? (c[(i + 224) >> 2] | 0) == 0 : 0) d = 0;
+              else e = 3;
+              a: do
+                if ((e | 0) == 3) {
+                  g = jC(a) | 0;
+                  i = (d + 4) | 0;
+                  h = c[d >> 2] & 65535;
+                  d = 0;
+                  while (1) {
+                    if (!g) break a;
+                    if ((g | 0) == (fP(g) | 0)) {
+                      f = (g + 16) | 0;
+                      e = c[f >> 2] | 0;
+                      if (
+                        (c[(e + 184) >> 2] | 0) == 0
+                          ? ((k = c[((c[j >> 2] | 0) + 228) >> 2] | 0), !(((k | 0) == 0) | ((g | 0) == (k | 0))))
+                          : 0
+                      ) {
+                        d = nh(g, k, 0) | 0;
+                        e = c[(d + 16) >> 2] | 0;
+                        b[(e + 170) >> 1] = c[i >> 2];
+                        c[(e + 156) >> 2] = 0;
+                        e = c[f >> 2] | 0;
+                      }
+                      if (
+                        (c[(e + 176) >> 2] | 0) == 0
+                          ? ((l = c[((c[j >> 2] | 0) + 224) >> 2] | 0), !(((l | 0) == 0) | ((g | 0) == (l | 0))))
+                          : 0
+                      ) {
+                        d = nh(l, g, 0) | 0;
+                        f = c[(d + 16) >> 2] | 0;
+                        b[(f + 170) >> 1] = h;
+                        c[(f + 156) >> 2] = 0;
+                      }
+                    }
+                    g = kC(a, g) | 0;
+                  }
+                }
+              while (0);
+              return ((d | 0) != 0) | 0;
+            }
+            function Ej(d, e) {
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              g = jC(d) | 0;
+              k = (d + 16) | 0;
+              f = c[k >> 2] | 0;
+              a: do
+                if (g) {
+                  b[(f + 236) >> 1] = 32767;
+                  b[(f + 238) >> 1] = -1;
+                  j = (e | 0) == 0;
+                  while (1) {
+                    if (!g) break;
+                    f = fP(g) | 0;
+                    i = c[(g + 16) >> 2] | 0;
+                    e = c[(i + 232) >> 2] | 0;
+                    do
+                      if ((f | 0) != (g | 0)) {
+                        if (!j)
+                          if (!e) e = 0;
+                          else break;
+                        e = (e + (c[((c[(f + 16) >> 2] | 0) + 232) >> 2] | 0)) | 0;
+                        c[(i + 232) >> 2] = e;
+                      }
+                    while (0);
+                    f = c[k >> 2] | 0;
+                    h = (f + 238) | 0;
+                    if ((e | 0) > (b[h >> 1] | 0)) b[h >> 1] = e;
+                    f = (f + 236) | 0;
+                    if ((e | 0) < (b[f >> 1] | 0)) b[f >> 1] = e;
+                    switch (a[(i + 159) >> 0] | 0) {
+                      case 6:
+                      case 0:
+                        break;
+                      default:
+                        hP(g);
+                    }
+                    g = kC(d, g) | 0;
+                  }
+                  if ((gg(d) | 0) == (d | 0)) {
+                    if ((c[47135] | 0) == 100) e = 1;
+                    else {
+                      Ij(d);
+                      break;
+                    }
+                    while (1) {
+                      f = c[k >> 2] | 0;
+                      if ((e | 0) > (c[(f + 180) >> 2] | 0)) break a;
+                      Hj(c[((c[(f + 184) >> 2] | 0) + (e << 2)) >> 2] | 0);
+                      e = (e + 1) | 0;
+                    }
+                  }
+                } else {
+                  b[(f + 238) >> 1] = 0;
+                  b[(f + 236) >> 1] = 0;
+                }
+              while (0);
+              return;
+            }
+            function Fj(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              j = (b + 16) | 0;
+              e = 0;
+              while (1) {
+                d = c[j >> 2] | 0;
+                if ((e | 0) >= (c[(d + 220) >> 2] | 0)) break;
+                i = c[((c[(d + 216) >> 2] | 0) + (e << 2)) >> 2] | 0;
+                c[(d + 192) >> 2] = i;
+                d = i;
+                while (1) {
+                  if (!d) break;
+                  i = (d + 16) | 0;
+                  Gj(((c[i >> 2] | 0) + 172) | 0);
+                  Gj(((c[i >> 2] | 0) + 180) | 0);
+                  i = c[i >> 2] | 0;
+                  a[(i + 157) >> 0] = 0;
+                  d = c[(i + 164) >> 2] | 0;
+                }
+                e = (e + 1) | 0;
+              }
+              i = jC(b) | 0;
+              while (1) {
+                if (!i) break;
+                h = XA(b, i) | 0;
+                while (1) {
+                  if (!h) break;
+                  f = (h + 16) | 0;
+                  d = c[f >> 2] | 0;
+                  g = c[(d + 172) >> 2] | 0;
+                  if ((g | 0) != 0 ? ((k = (g + 16) | 0), (h | 0) == (c[((c[k >> 2] | 0) + 116) >> 2] | 0)) : 0) {
+                    d = jC(b) | 0;
+                    while (1) {
+                      if (!d) break;
+                      e = XA(b, d) | 0;
+                      while (1) {
+                        if (!e) break;
+                        if (
+                          (h | 0) != (e | 0)
+                            ? ((l = ((c[(e + 16) >> 2] | 0) + 172) | 0),
+                              (m = c[l >> 2] | 0),
+                              ((m | 0) != 0) & ((g | 0) == (m | 0)))
+                            : 0
+                        )
+                          c[l >> 2] = 0;
+                        e = ZA(b, e) | 0;
+                      }
+                      d = kC(b, d) | 0;
+                    }
+                    U1(c[k >> 2] | 0);
+                    U1(g);
+                    d = c[f >> 2] | 0;
+                  }
+                  c[(d + 172) >> 2] = 0;
+                  h = ZA(b, h) | 0;
+                }
+                i = kC(b, i) | 0;
+              }
+              U1(c[((c[j >> 2] | 0) + 216) >> 2] | 0);
+              m = c[j >> 2] | 0;
+              c[(m + 216) >> 2] = 0;
+              c[(m + 220) >> 2] = 0;
+              return;
+            }
+            function Gj(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              d = (a + 4) | 0;
+              b = c[d >> 2] | 0;
+              while (1) {
+                if ((b | 0) <= -1) break;
+                c[((c[a >> 2] | 0) + (b << 2)) >> 2] = 0;
+                b = (b + -1) | 0;
+              }
+              c[d >> 2] = 0;
+              return;
+            }
+            function Hj(a) {
+              a = a | 0;
+              var d = 0,
+                f = 0,
+                g = 0;
+              d = (a + 16) | 0;
+              f = c[d >> 2] | 0;
+              g = c[((c[((c[(f + 264) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0;
+              a = (f + 236) | 0;
+              b[a >> 1] = g + (e[a >> 1] | 0);
+              a = (f + 238) | 0;
+              b[a >> 1] = g + (e[a >> 1] | 0);
+              a = 1;
+              while (1) {
+                if ((a | 0) > (c[(f + 180) >> 2] | 0)) break;
+                Hj(c[((c[(f + 184) >> 2] | 0) + (a << 2)) >> 2] | 0);
+                a = (a + 1) | 0;
+                f = c[d >> 2] | 0;
+              }
+              return;
+            }
+            function Ij(b) {
+              b = b | 0;
+              var d = 0;
+              d = OD(gg(b) | 0) | 0;
+              while (1) {
+                if (!d) break;
+                if ((a[((c[(d + 16) >> 2] | 0) + 274) >> 0] | 0) == 7) Jj(b, d);
+                d = PD(d) | 0;
+              }
+              return;
+            }
+            function Jj(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = ((c[(b + 16) >> 2] | 0) + 200) | 0;
+              do
+                if ((c[d >> 2] | 0) == 0 ? ((c[d >> 2] = a), Kj(a, b), jC(b) | 0) : 0) {
+                  Lj(a, b);
+                  if ((c[47135] | 0) == 100) {
+                    zj(b, 0);
+                    Mj(b);
+                    break;
+                  } else {
+                    vj(b);
+                    break;
+                  }
+                }
+              while (0);
+              return;
+            }
+            function Kj(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              h = (b + 16) | 0;
+              g = jC(d) | 0;
+              while (1) {
+                if (!g) break;
+                i = kC(d, g) | 0;
+                j = (g + 16) | 0;
+                if (!(a[((c[j >> 2] | 0) + 159) >> 0] | 0)) f = 1;
+                else {
+                  wC(d, g) | 0;
+                  g = i;
+                  continue;
+                }
+                while (1) {
+                  e = c[h >> 2] | 0;
+                  b = c[(e + 180) >> 2] | 0;
+                  if ((f | 0) >= (b | 0)) break;
+                  if (HC(c[((c[(e + 184) >> 2] | 0) + (f << 2)) >> 2] | 0, g) | 0) {
+                    k = 7;
+                    break;
+                  }
+                  f = (f + 1) | 0;
+                }
+                if ((k | 0) == 7) {
+                  k = 0;
+                  b = c[((c[h >> 2] | 0) + 180) >> 2] | 0;
+                }
+                if ((f | 0) < (b | 0)) wC(d, g) | 0;
+                c[((c[j >> 2] | 0) + 212) >> 2] = 0;
+                g = i;
+              }
+              e = jC(d) | 0;
+              while (1) {
+                if (!e) break;
+                b = XA(gg(d) | 0, e) | 0;
+                while (1) {
+                  if (!b) break;
+                  if (HC(d, c[((((c[b >> 2] & 3) | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0) | 0) mB(d, b, 1) | 0;
+                  b = ZA(gg(d) | 0, b) | 0;
+                }
+                e = kC(d, e) | 0;
+              }
+              return;
+            }
+            function Lj(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              e = (a + 16) | 0;
+              d = c[e >> 2] | 0;
+              g = (d + 180) | 0;
+              a = c[g >> 2] | 0;
+              f = (a + 1) | 0;
+              c[g >> 2] = f;
+              d = c[(d + 184) >> 2] | 0;
+              if (!d) a = JK(((a << 2) + 8) | 0) | 0;
+              else a = LK(d, (a + 2) | 0, 4, f) | 0;
+              c[((c[e >> 2] | 0) + 184) >> 2] = a;
+              c[(a + (f << 2)) >> 2] = b;
+              uK(b);
+              return;
+            }
+            function Mj(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              g = c[(b + 16) >> 2] | 0;
+              d = (g + 192) | 0;
+              h = 0;
+              while (1) {
+                d = c[d >> 2] | 0;
+                if (!d) break;
+                f = c[(d + 16) >> 2] | 0;
+                if (!(c[(f + 232) >> 2] | 0)) e = (a[(f + 156) >> 0] | 0) == 0 ? d : h;
+                else e = h;
+                d = (f + 164) | 0;
+                h = e;
+              }
+              if (!h) qa(87019, 87034, 238, 87041);
+              c[(g + 264) >> 2] = h;
+              d = jC(b) | 0;
+              while (1) {
+                if (!d) {
+                  d = 13;
+                  break;
+                }
+                e = (d + 16) | 0;
+                if (!((d | 0) == (h | 0) ? 1 : (c[((c[e >> 2] | 0) + 216) >> 2] | 0) < 2)) {
+                  d = 11;
+                  break;
+                }
+                gP(d, h) | 0;
+                a[((c[e >> 2] | 0) + 159) >> 0] = 7;
+                d = kC(b, d) | 0;
+              }
+              if ((d | 0) == 11) qa(87056, 87034, 242, 87041);
+              else if ((d | 0) == 13) return;
+            }
+            function Nj(b) {
+              b = b | 0;
+              var d = 0;
+              if (!(Pj(b) | 0)) {
+                d = pP(QA(b, 87171) | 0, 17356, 17380) | 0;
+                a[((c[(b + 16) >> 2] | 0) + 274) >> 0] = d;
+                b = d;
+              } else b = 7;
+              return b | 0;
+            }
+            function Oj(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              g = jC(d) | 0;
+              a: do
+                if (g | 0) {
+                  j = e & 255;
+                  i = (g + 16) | 0;
+                  f = g;
+                  h = j;
+                  while (1) {
+                    a[((c[(f + 16) >> 2] | 0) + 159) >> 0] = h;
+                    f = kC(d, f) | 0;
+                    if (!f) break;
+                    gP(g, f) | 0;
+                    h = a[((c[i >> 2] | 0) + 159) >> 0] | 0;
+                  }
+                  switch (e | 0) {
+                    case 3:
+                    case 2: {
+                      b = (b + 16) | 0;
+                      f = c[b >> 2] | 0;
+                      h = c[(f + 224) >> 2] | 0;
+                      if (h) {
+                        g = gP(h, g) | 0;
+                        f = c[b >> 2] | 0;
+                      }
+                      c[(f + 224) >> 2] = g;
+                      break;
+                    }
+                    case 5:
+                    case 4: {
+                      b = (b + 16) | 0;
+                      f = c[b >> 2] | 0;
+                      h = c[(f + 228) >> 2] | 0;
+                      if (h) {
+                        g = gP(h, g) | 0;
+                        f = c[b >> 2] | 0;
+                      }
+                      c[(f + 228) >> 2] = g;
+                      break;
+                    }
+                    default:
+                      break a;
+                  }
+                  switch (e | 0) {
+                    case 3: {
+                      f = (f + 224) | 0;
+                      break;
+                    }
+                    case 5: {
+                      f = (f + 228) | 0;
+                      break;
+                    }
+                    default:
+                      break a;
+                  }
+                  a[((c[((c[f >> 2] | 0) + 16) >> 2] | 0) + 159) >> 0] = j;
+                }
+              while (0);
+              return;
+            }
+            function Pj(a) {
+              a = a | 0;
+              return ((Q2(KB(a) | 0, 108006, 7) | 0) == 0) | 0;
+            }
+            function Qj(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              m = l;
+              l = (l + 16) | 0;
+              g = m;
+              if (!(jk(b) | 0)) {
+                do
+                  if (FP(b) | 0)
+                    if (!d) {
+                      c[((c[(b + 16) >> 2] | 0) + 204) >> 2] = 0;
+                      d = b;
+                      break;
+                    } else {
+                      c[((c[(b + 16) >> 2] | 0) + 204) >> 2] = (c[((c[(d + 16) >> 2] | 0) + 204) >> 2] | 0) + 1;
+                      kk(b, d);
+                      d = b;
+                      break;
+                    }
+                while (0);
+                e = OD(b) | 0;
+                while (1) {
+                  if (!e) break;
+                  Qj(e, d);
+                  e = PD(e) | 0;
+                }
+                a: do
+                  if (FP(b) | 0) {
+                    e = jC(b) | 0;
+                    while (1) {
+                      if (!e) break a;
+                      f = ((c[(e + 16) >> 2] | 0) + 212) | 0;
+                      if (!(c[f >> 2] | 0)) c[f >> 2] = b;
+                      e = kC(b, e) | 0;
+                    }
+                  }
+                while (0);
+                switch (lk(b) | 0) {
+                  case 3: {
+                    d = (d + 16) | 0;
+                    a[((c[d >> 2] | 0) + 241) >> 0] = 1;
+                    k = 19;
+                    break;
+                  }
+                  case 2: {
+                    d = (d + 16) | 0;
+                    k = 19;
+                    break;
+                  }
+                  case 5: {
+                    d = (d + 16) | 0;
+                    a[((c[d >> 2] | 0) + 242) >> 0] = 1;
+                    k = 21;
+                    break;
+                  }
+                  case 4: {
+                    d = (d + 16) | 0;
+                    k = 21;
+                    break;
+                  }
+                  case 1: {
+                    mk(b) | 0;
+                    break;
+                  }
+                  case 6:
+                    break;
+                  default: {
+                    e = KB(b) | 0;
+                    f = QA(b, 87171) | 0;
+                    c[g >> 2] = e;
+                    c[(g + 4) >> 2] = f;
+                    gA(0, 87354, g) | 0;
+                  }
+                }
+                if ((k | 0) == 19) {
+                  k = mk(b) | 0;
+                  k = nk(k, c[((c[d >> 2] | 0) + 208) >> 2] | 0) | 0;
+                  c[((c[d >> 2] | 0) + 208) >> 2] = k;
+                } else if ((k | 0) == 21) {
+                  k = mk(b) | 0;
+                  k = nk(k, c[((c[d >> 2] | 0) + 212) >> 2] | 0) | 0;
+                  c[((c[d >> 2] | 0) + 212) >> 2] = k;
+                }
+                if (
+                  (FP(b) | 0 ? ((h = (b + 16) | 0), (i = c[h >> 2] | 0), (j = c[(i + 208) >> 2] | 0), j | 0) : 0)
+                    ? (j | 0) == (c[(i + 212) >> 2] | 0)
+                    : 0
+                ) {
+                  j = mk(b) | 0;
+                  k = c[h >> 2] | 0;
+                  c[(k + 208) >> 2] = j;
+                  c[(k + 212) >> 2] = j;
+                }
+              }
+              l = m;
+              return;
+            }
+            function Rj(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              c[46747] = 0;
+              d = jC(a) | 0;
+              while (1) {
+                if (!d) break;
+                if ((Yj(d) | 0) == (d | 0)) {
+                  e = $j(b, KB(d) | 0) | 0;
+                  c[((c[(d + 16) >> 2] | 0) + 148) >> 2] = e;
+                }
+                d = kC(a, d) | 0;
+              }
+              d = jC(a) | 0;
+              while (1) {
+                if (!d) break;
+                b = (d + 16) | 0;
+                if (!(c[((c[b >> 2] | 0) + 148) >> 2] | 0)) {
+                  e = c[((c[((Yj(d) | 0) + 16) >> 2] | 0) + 148) >> 2] | 0;
+                  c[((c[b >> 2] | 0) + 148) >> 2] = e;
+                }
+                d = kC(a, d) | 0;
+              }
+              return;
+            }
+            function Sj(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              h = jC(a) | 0;
+              while (1) {
+                if (!h) break;
+                d = c[((c[(h + 16) >> 2] | 0) + 148) >> 2] | 0;
+                i = XA(a, h) | 0;
+                while (1) {
+                  if (!i) break;
+                  do
+                    if (
+                      (ek(i) | 0) == 0
+                        ? ((j = (i + -48) | 0),
+                          (k =
+                            c[
+                              ((c[((Yj(c[((((c[i >> 2] & 3) | 0) == 2 ? i : j) + 40) >> 2] | 0) | 0) + 16) >> 2] | 0) +
+                                148) >>
+                                2
+                            ] | 0),
+                          (d | 0) != (k | 0))
+                        : 0
+                    ) {
+                      f = c[i >> 2] & 3;
+                      g = (i + 48) | 0;
+                      e = (((f | 0) == 3 ? i : g) + 40) | 0;
+                      f = c[((c[((c[(((f | 0) == 2 ? i : j) + 40) >> 2] | 0) + 16) >> 2] | 0) + 212) >> 2] | 0;
+                      if (!(fk(i) | 0)) {
+                        if (
+                          (dk(c[((c[((c[e >> 2] | 0) + 16) >> 2] | 0) + 212) >> 2] | 0) | 0) == 0 ? (dk(f) | 0) == 0 : 0
+                        ) {
+                          gk(b, d, k, i);
+                          break;
+                        }
+                        hk(b, d, k, i);
+                        break;
+                      } else {
+                        f = Yj(c[e >> 2] | 0) | 0;
+                        e = c[i >> 2] & 3;
+                        if (
+                          (f | 0) !=
+                          (c[
+                            ((c[
+                              ((c[((c[((c[(((e | 0) == 3 ? i : g) + 40) >> 2] | 0) + 16) >> 2] | 0) + 212) >> 2] | 0) +
+                                16) >>
+                                2
+                            ] |
+                              0) +
+                              212) >>
+                              2
+                          ] |
+                            0)
+                            ? ((g = Yj(c[(((e | 0) == 2 ? i : j) + 40) >> 2] | 0) | 0),
+                              (g | 0) !=
+                                (c[
+                                  ((c[
+                                    ((c[
+                                      ((c[((c[((((c[i >> 2] & 3) | 0) == 2 ? i : j) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                                        212) >>
+                                        2
+                                    ] |
+                                      0) +
+                                      16) >>
+                                      2
+                                  ] |
+                                    0) +
+                                    208) >>
+                                    2
+                                ] |
+                                  0))
+                            : 0
+                        )
+                          e = k;
+                        else {
+                          e = d;
+                          d = k;
+                        }
+                        gk(b, d, e, i);
+                        break;
+                      }
+                    }
+                  while (0);
+                  i = ZA(a, i) | 0;
+                }
+                h = kC(a, h) | 0;
+              }
+              return;
+            }
+            function Tj(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              if ((FP(a) | 0) != 0 ? (dk(a) | 0) != 0 : 0) {
+                g = jC(a) | 0;
+                while (1) {
+                  if (!g) break;
+                  if (!(_A(a, g) | 0)) {
+                    f = c[((c[((Yj(g) | 0) + 16) >> 2] | 0) + 148) >> 2] | 0;
+                    if (!d) d = $j(b, 87252) | 0;
+                    iB(b, d, f, 0, 1) | 0;
+                  }
+                  if (!(XA(a, g) | 0)) {
+                    f = c[((c[((Yj(g) | 0) + 16) >> 2] | 0) + 148) >> 2] | 0;
+                    if (!e) e = $j(b, 87257) | 0;
+                    iB(b, f, e, 0, 1) | 0;
+                  }
+                  g = kC(a, g) | 0;
+                }
+                if (((e | 0) != 0) & ((d | 0) != 0)) {
+                  ck(iB(b, d, e, 0, 1) | 0, 0, 1e3);
+                  f = d;
+                } else f = d;
+              } else f = d;
+              d = OD(a) | 0;
+              while (1) {
+                if (!d) break;
+                Tj(d, b, f, e);
+                d = PD(d) | 0;
+              }
+              return;
+            }
+            function Uj(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = jC(b) | 0;
+              while (1) {
+                if (!d) break;
+                e = c[(d + 16) >> 2] | 0;
+                a[(e + 158) >> 0] = 0;
+                a[(e + 157) >> 0] = 0;
+                d = kC(b, d) | 0;
+              }
+              d = jC(b) | 0;
+              while (1) {
+                if (!d) break;
+                ak(b, d);
+                d = kC(b, d) | 0;
+              }
+              return;
+            }
+            function Vj(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              b = jC(a) | 0;
+              while (1) {
+                if (!b) break;
+                c[((c[(b + 16) >> 2] | 0) + 128) >> 2] = 0;
+                b = kC(a, b) | 0;
+              }
+              b = 0;
+              e = jC(a) | 0;
+              while (1) {
+                if (!e) break;
+                d = (b + 1) | 0;
+                if (!(c[((c[(e + 16) >> 2] | 0) + 128) >> 2] | 0)) {
+                  _j(a, e, d);
+                  b = d;
+                }
+                e = kC(a, e) | 0;
+              }
+              a: do
+                if ((b | 0) > 1) {
+                  f = $j(a, 87246) | 0;
+                  d = 1;
+                  e = jC(a) | 0;
+                  while (1) {
+                    if (!e) break a;
+                    if ((c[((c[(e + 16) >> 2] | 0) + 128) >> 2] | 0) == (d | 0)) {
+                      iB(a, f, e, 0, 1) | 0;
+                      d = (d + 1) | 0;
+                    }
+                    e = kC(a, e) | 0;
+                  }
+                }
+              while (0);
+              return b | 0;
+            }
+            function Wj(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              g = jC(a) | 0;
+              while (1) {
+                if (!g) break;
+                h = (g + 16) | 0;
+                f = XA(a, g) | 0;
+                while (1) {
+                  if (!f) break;
+                  b = c[h >> 2] | 0;
+                  d = c[(b + 180) >> 2] | 0;
+                  if (!d) b = KK(((c[(b + 184) >> 2] << 2) + 8) | 0) | 0;
+                  else b = MK(d, ((c[(b + 184) >> 2] << 2) + 8) | 0) | 0;
+                  d = c[h >> 2] | 0;
+                  c[(d + 180) >> 2] = b;
+                  d = (d + 184) | 0;
+                  e = c[d >> 2] | 0;
+                  c[d >> 2] = e + 1;
+                  c[(b + (e << 2)) >> 2] = f;
+                  e = c[h >> 2] | 0;
+                  c[((c[(e + 180) >> 2] | 0) + (c[(e + 184) >> 2] << 2)) >> 2] = 0;
+                  e = (f + -48) | 0;
+                  b = c[((c[((((c[f >> 2] & 3) | 0) == 2 ? f : e) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                  d = c[(b + 172) >> 2] | 0;
+                  if (!d) b = KK(((c[(b + 176) >> 2] << 2) + 8) | 0) | 0;
+                  else b = MK(d, ((c[(b + 176) >> 2] << 2) + 8) | 0) | 0;
+                  c[((c[((c[((((c[f >> 2] & 3) | 0) == 2 ? f : e) + 40) >> 2] | 0) + 16) >> 2] | 0) + 172) >> 2] = b;
+                  i = c[((c[((((c[f >> 2] & 3) | 0) == 2 ? f : e) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                  b = c[(i + 172) >> 2] | 0;
+                  i = (i + 176) | 0;
+                  d = c[i >> 2] | 0;
+                  c[i >> 2] = d + 1;
+                  c[(b + (d << 2)) >> 2] = f;
+                  e = c[((c[((((c[f >> 2] & 3) | 0) == 2 ? f : e) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                  c[((c[(e + 172) >> 2] | 0) + (c[(e + 176) >> 2] << 2)) >> 2] = 0;
+                  f = ZA(a, f) | 0;
+                }
+                g = kC(a, g) | 0;
+              }
+              return;
+            }
+            function Xj(a, d, f) {
+              a = a | 0;
+              d = d | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              n = (a + 16) | 0;
+              o = c[n >> 2] | 0;
+              b[(o + 236) >> 1] = 32767;
+              b[(o + 238) >> 1] = -1;
+              a: do
+                if ((f | 0) > 1) {
+                  h = JK(((f << 2) + 4) | 0) | 0;
+                  g = (f + 1) | 0;
+                  f = 1;
+                  while (1) {
+                    if ((f | 0) == (g | 0)) {
+                      m = h;
+                      o = h;
+                      break a;
+                    }
+                    c[(h + (f << 2)) >> 2] = 32767;
+                    f = (f + 1) | 0;
+                  }
+                } else {
+                  m = 0;
+                  o = 0;
+                }
+              while (0);
+              i = (m | 0) == 0;
+              h = jC(a) | 0;
+              while (1) {
+                if (!h) break;
+                j = c[((c[((c[((Yj(h) | 0) + 16) >> 2] | 0) + 148) >> 2] | 0) + 16) >> 2] | 0;
+                k = c[(j + 232) >> 2] | 0;
+                l = c[(h + 16) >> 2] | 0;
+                c[(l + 232) >> 2] = k;
+                f = c[n >> 2] | 0;
+                g = (f + 238) | 0;
+                if ((k | 0) > (b[g >> 1] | 0)) b[g >> 1] = k;
+                f = (f + 236) | 0;
+                if ((k | 0) < (b[f >> 1] | 0)) b[f >> 1] = k;
+                if (!i) {
+                  j = c[(j + 128) >> 2] | 0;
+                  c[(l + 128) >> 2] = j;
+                  l = (m + (j << 2)) | 0;
+                  j = c[l >> 2] | 0;
+                  c[l >> 2] = (j | 0) < (k | 0) ? j : k;
+                }
+                h = kC(a, h) | 0;
+              }
+              j = (m | 0) != 0;
+              b: do
+                if (!j) {
+                  m = b[((c[n >> 2] | 0) + 236) >> 1] | 0;
+                  g = (m << 16) >> 16;
+                  if ((m << 16) >> 16 > 0) {
+                    f = jC(a) | 0;
+                    while (1) {
+                      if (!f) break;
+                      m = ((c[(f + 16) >> 2] | 0) + 232) | 0;
+                      c[m >> 2] = (c[m >> 2] | 0) - g;
+                      f = kC(a, f) | 0;
+                    }
+                    f = c[n >> 2] | 0;
+                    n = (f + 236) | 0;
+                    b[n >> 1] = (e[n >> 1] | 0) - g;
+                    f = (f + 238) | 0;
+                    b[f >> 1] = (e[f >> 1] | 0) - g;
+                    f = 0;
+                  } else f = 0;
+                } else {
+                  f = jC(a) | 0;
+                  while (1) {
+                    if (!f) {
+                      f = 1;
+                      break b;
+                    }
+                    l = c[(f + 16) >> 2] | 0;
+                    n = (l + 232) | 0;
+                    c[n >> 2] = (c[n >> 2] | 0) - (c[(m + (c[(l + 128) >> 2] << 2)) >> 2] | 0);
+                    f = kC(a, f) | 0;
+                  }
+                }
+              while (0);
+              Zj(a, f);
+              i = jC(d) | 0;
+              while (1) {
+                if (!i) break;
+                g = (i + 16) | 0;
+                f = c[g >> 2] | 0;
+                h = c[(f + 172) >> 2] | 0;
+                if (h) {
+                  U1(h);
+                  f = c[g >> 2] | 0;
+                }
+                f = c[(f + 180) >> 2] | 0;
+                if (f | 0) U1(f);
+                i = kC(d, i) | 0;
+              }
+              U1(c[((c[((jC(a) | 0) + 16) >> 2] | 0) + 112) >> 2] | 0);
+              f = jC(a) | 0;
+              while (1) {
+                if (!f) break;
+                c[((c[(f + 16) >> 2] | 0) + 112) >> 2] = 0;
+                f = kC(a, f) | 0;
+              }
+              if (j) U1(o);
+              return;
+            }
+            function Yj(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              b = (a + 16) | 0;
+              d = ((c[b >> 2] | 0) + 152) | 0;
+              e = c[d >> 2] | 0;
+              if (e) {
+                if ((e | 0) != (a | 0)) {
+                  e = Yj(e) | 0;
+                  c[((c[b >> 2] | 0) + 152) >> 2] = e;
+                  return e | 0;
+                }
+              } else c[d >> 2] = a;
+              return a | 0;
+            }
+            function Zj(a, d) {
+              a = a | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = (a + 16) | 0;
+              e = 1;
+              while (1) {
+                f = c[i >> 2] | 0;
+                if ((e | 0) > (c[(f + 180) >> 2] | 0)) break;
+                Zj(c[((c[(f + 184) >> 2] | 0) + (e << 2)) >> 2] | 0, 0);
+                e = (e + 1) | 0;
+              }
+              if (((d | 0) != 0) | ((c[(f + 200) >> 2] | 0) != 0)) {
+                b[(f + 236) >> 1] = 32767;
+                b[(f + 238) >> 1] = -1;
+                e = 0;
+                h = jC(a) | 0;
+                while (1) {
+                  if (!h) break;
+                  g = c[((c[(h + 16) >> 2] | 0) + 232) >> 2] | 0;
+                  d = c[i >> 2] | 0;
+                  f = (d + 238) | 0;
+                  if ((g | 0) > (b[f >> 1] | 0)) b[f >> 1] = g;
+                  d = (d + 236) | 0;
+                  if ((g | 0) < (b[d >> 1] | 0)) {
+                    b[d >> 1] = g;
+                    e = h;
+                  }
+                  h = kC(a, h) | 0;
+                }
+                c[((c[i >> 2] | 0) + 264) >> 2] = e;
+              }
+              return;
+            }
+            function _j(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              e = ((c[(b + 16) >> 2] | 0) + 128) | 0;
+              a: do
+                if (!(c[e >> 2] | 0)) {
+                  c[e >> 2] = d;
+                  e = XA(a, b) | 0;
+                  while (1) {
+                    if (!e) break;
+                    _j(a, c[((((c[e >> 2] & 3) | 0) == 2 ? e : (e + -48) | 0) + 40) >> 2] | 0, d);
+                    e = ZA(a, e) | 0;
+                  }
+                  e = _A(a, b) | 0;
+                  while (1) {
+                    if (!e) break a;
+                    _j(a, c[((((c[e >> 2] & 3) | 0) == 3 ? e : (e + 48) | 0) + 40) >> 2] | 0, d);
+                    e = $A(a, e) | 0;
+                  }
+                }
+              while (0);
+              return;
+            }
+            function $j(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              f = tC(a, b, 1) | 0;
+              b = (f + 16) | 0;
+              c[((c[b >> 2] | 0) + 176) >> 2] = 0;
+              e = JK(20) | 0;
+              d = c[b >> 2] | 0;
+              c[(d + 172) >> 2] = e;
+              c[(d + 184) >> 2] = 0;
+              d = JK(20) | 0;
+              b = c[b >> 2] | 0;
+              c[(b + 180) >> 2] = d;
+              d = c[46747] | 0;
+              e = (b + 168) | 0;
+              if (!d) {
+                c[e >> 2] = 0;
+                c[((c[(a + 16) >> 2] | 0) + 192) >> 2] = f;
+              } else {
+                c[e >> 2] = d;
+                c[((c[(d + 16) >> 2] | 0) + 164) >> 2] = f;
+              }
+              c[46747] = f;
+              c[(b + 164) >> 2] = 0;
+              return f | 0;
+            }
+            function ak(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = (d + 16) | 0;
+              e = c[h >> 2] | 0;
+              f = (e + 157) | 0;
+              if (!(a[f >> 0] | 0)) {
+                a[f >> 0] = 1;
+                a[(e + 158) >> 0] = 1;
+                d = XA(b, d) | 0;
+                while (1) {
+                  if (!d) break;
+                  e = ZA(b, d) | 0;
+                  f = c[((((c[d >> 2] & 3) | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0;
+                  g = c[(f + 16) >> 2] | 0;
+                  if (a[(g + 158) >> 0] | 0) {
+                    bk(b, d);
+                    d = e;
+                    continue;
+                  }
+                  if (a[(g + 157) >> 0] | 0) {
+                    d = e;
+                    continue;
+                  }
+                  ak(b, f);
+                  d = e;
+                }
+                a[((c[h >> 2] | 0) + 158) >> 0] = 0;
+              }
+              return;
+            }
+            function bk(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                f = 0,
+                g = 0;
+              d = c[b >> 2] & 3;
+              g = (b + -48) | 0;
+              f = (b + 48) | 0;
+              d = iB(a, c[(((d | 0) == 2 ? b : g) + 40) >> 2] | 0, c[(((d | 0) == 3 ? b : f) + 40) >> 2] | 0, 0, 0) | 0;
+              if (!d) {
+                d = c[b >> 2] & 3;
+                d =
+                  iB(a, c[(((d | 0) == 2 ? b : g) + 40) >> 2] | 0, c[(((d | 0) == 3 ? b : f) + 40) >> 2] | 0, 0, 1) | 0;
+              }
+              g = c[(b + 16) >> 2] | 0;
+              ck(d, e[(g + 170) >> 1] | 0, c[(g + 156) >> 2] | 0);
+              wC(a, b) | 0;
+              return;
+            }
+            function ck(a, d, f) {
+              a = a | 0;
+              d = d | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0;
+              a = c[(a + 16) >> 2] | 0;
+              g = (a + 170) | 0;
+              h = e[g >> 1] | 0;
+              b[g >> 1] = (h | 0) > (d | 0) ? h : d;
+              d = (a + 156) | 0;
+              c[d >> 2] = (c[d >> 2] | 0) + f;
+              return;
+            }
+            function dk(a) {
+              a = a | 0;
+              return ((eP(QA(a, 87262) | 0, 0) | 0) & 255) | 0;
+            }
+            function ek(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = c[47189] | 0;
+              if (
+                (((d | 0) != 0 ? ((e = RA(b, d) | 0), (e | 0) != 0) : 0) ? (a[e >> 0] | 0) != 0 : 0)
+                  ? ((dP(e) | 0) << 24) >> 24 == 0
+                  : 0
+              )
+                b = 1;
+              else b = 0;
+              return b | 0;
+            }
+            function fk(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              d = c[a >> 2] & 3;
+              b = c[((c[((c[(((d | 0) == 3 ? a : (a + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 212) >> 2] | 0;
+              a = c[((c[((c[(((d | 0) == 2 ? a : (a + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 212) >> 2] | 0;
+              if ((b | 0) == (a | 0)) return 1;
+              else {
+                d = ik(b, a) | 0;
+                return ((((d | 0) == (b | 0)) | ((d | 0) == (a | 0))) & 1) | 0;
+              }
+              return 0;
+            }
+            function gk(a, b, d, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 16) | 0;
+              h = j;
+              g = iB(a, b, d, 0, 0) | 0;
+              if (!g) {
+                g = iB(a, d, b, 0, 0) | 0;
+                if (!g) {
+                  g = iB(a, b, d, 0, 1) | 0;
+                  if (!g) {
+                    b = KB(b) | 0;
+                    f = KB(d) | 0;
+                    c[h >> 2] = b;
+                    c[(h + 4) >> 2] = f;
+                    gA(1, 87279, h) | 0;
+                  } else i = 4;
+                } else i = 4;
+              } else i = 4;
+              if ((i | 0) == 4) {
+                i = c[(f + 16) >> 2] | 0;
+                ck(g, e[(i + 170) >> 1] | 0, c[(i + 156) >> 2] | 0);
+              }
+              l = j;
+              return;
+            }
+            function hk(a, d, f, g) {
+              a = a | 0;
+              d = d | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              m = l;
+              l = (l + 112) | 0;
+              j = m;
+              i = (m + 4) | 0;
+              h = _A(a, d) | 0;
+              while (1) {
+                if (!h) {
+                  k = 6;
+                  break;
+                }
+                n = XA(a, c[((((c[h >> 2] & 3) | 0) == 3 ? h : (h + 48) | 0) + 40) >> 2] | 0) | 0;
+                if (n | 0 ? (c[((((c[n >> 2] & 3) | 0) == 2 ? n : (n + -48) | 0) + 40) >> 2] | 0) == (f | 0) : 0) break;
+                h = $A(a, h) | 0;
+              }
+              if ((k | 0) == 6) {
+                n = c[46748] | 0;
+                c[46748] = n + 1;
+                c[j >> 2] = n;
+                m4(i, 87270, j) | 0;
+                i = $j(a, i) | 0;
+                n = iB(a, i, d, 0, 1) | 0;
+                i = iB(a, i, f, 0, 1) | 0;
+                f = c[(g + 16) >> 2] | 0;
+                k = (f + 156) | 0;
+                n = ((c[(n + 16) >> 2] | 0) + 156) | 0;
+                c[n >> 2] = (c[n >> 2] | 0) + (((c[k >> 2] | 0) * 1e3) | 0);
+                n = c[(i + 16) >> 2] | 0;
+                j = (n + 170) | 0;
+                b[j >> 1] =
+                  b[((c[(((e[j >> 1] | 0) > (e[(f + 170) >> 1] | 0) ? i : g) + 16) >> 2] | 0) + 170) >> 1] | 0;
+                n = (n + 156) | 0;
+                c[n >> 2] = (c[n >> 2] | 0) + (c[k >> 2] | 0);
+              }
+              l = m;
+              return;
+            }
+            function ik(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              a: while (1) {
+                e = (a + 16) | 0;
+                while (1) {
+                  if ((a | 0) == (b | 0)) break a;
+                  f = c[e >> 2] | 0;
+                  d = c[(b + 16) >> 2] | 0;
+                  if ((c[(f + 204) >> 2] | 0) >= (c[(d + 204) >> 2] | 0)) break;
+                  b = c[(d + 200) >> 2] | 0;
+                }
+                a = c[(f + 200) >> 2] | 0;
+              }
+              return a | 0;
+            }
+            function jk(a) {
+              a = a | 0;
+              return ((jC(a) | 0) == 0) | 0;
+            }
+            function kk(a, b) {
+              a = a | 0;
+              b = b | 0;
+              c[((c[(a + 16) >> 2] | 0) + 200) >> 2] = b;
+              Lj(b, a);
+              Kj(b, a);
+              return;
+            }
+            function lk(b) {
+              b = b | 0;
+              var c = 0;
+              b = QA(b, 87171) | 0;
+              if ((b | 0) != 0 ? (a[b >> 0] | 0) != 0 : 0)
+                if (s2(b, 87181) | 0)
+                  if (s2(b, 87185) | 0)
+                    if (s2(b, 87192) | 0)
+                      if (s2(b, 87196) | 0)
+                        if (!(s2(b, 87176) | 0)) b = 1;
+                        else c = 8;
+                      else b = 5;
+                    else b = 4;
+                  else b = 3;
+                else b = 2;
+              else c = 8;
+              if ((c | 0) == 8) b = 6;
+              return b | 0;
+            }
+            function mk(a) {
+              a = a | 0;
+              var b = 0,
+                c = 0;
+              c = jC(a) | 0;
+              a: do
+                if (!c) b = 0;
+                else {
+                  b = Yj(c) | 0;
+                  while (1) {
+                    c = kC(a, c) | 0;
+                    if (!c) break a;
+                    nk(b, c) | 0;
+                  }
+                }
+              while (0);
+              return b | 0;
+            }
+            function nk(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if (b) {
+                a = Yj(a) | 0;
+                c[((c[((Yj(b) | 0) + 16) >> 2] | 0) + 152) >> 2] = a;
+              }
+              return a | 0;
+            }
+            function ok(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              TC(b, 87230, c[d >> 2] | 0, 1) | 0;
+              return;
+            }
+            function pk(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              TC(b, 87397, c[(d + 4) >> 2] | 0, 1) | 0;
+              return;
+            }
+            function qk(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              TC(b, 87382, c[(d + 8) >> 2] | 0, 1) | 0;
+              return;
+            }
+            function rk(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              p = l;
+              l = (l + 240) | 0;
+              m = (p + 120) | 0;
+              n = p;
+              c[47193] = GA(b, 2, 87412, 0) | 0;
+              k = GA(b, 2, 87421, 0) | 0;
+              c[47194] = k;
+              a: do
+                if (((k | 0) != 0) | ((c[47193] | 0) != 0)) {
+                  k = jC(b) | 0;
+                  while (1) {
+                    if (!k) break a;
+                    j = 0;
+                    d = 0;
+                    i = aB(b, k) | 0;
+                    while (1) {
+                      if (!i) {
+                        f = 0;
+                        break;
+                      }
+                      e = c[i >> 2] | 0;
+                      g = e & 3;
+                      f = c[(((g | 0) == 2 ? i : (i + -48) | 0) + 40) >> 2] | 0;
+                      h = (i + 48) | 0;
+                      b: do
+                        if ((f | 0) != (c[(((g | 0) == 3 ? i : h) + 40) >> 2] | 0)) {
+                          g = c[47193] | 0;
+                          do
+                            if (((f | 0) == (k | 0)) & ((g | 0) != 0)) {
+                              f = RA(i, g) | 0;
+                              if (!(a[f >> 0] | 0)) {
+                                e = c[i >> 2] | 0;
+                                break;
+                              } else {
+                                e = j;
+                                d = sk(m, d, k, i, f) | 0;
+                                break b;
+                              }
+                            }
+                          while (0);
+                          f = c[47194] | 0;
+                          if (
+                            (f | 0 ? (c[((((e & 3) | 0) == 3 ? i : h) + 40) >> 2] | 0) == (k | 0) : 0)
+                              ? ((o = RA(i, f) | 0), (a[o >> 0] | 0) != 0)
+                              : 0
+                          )
+                            e = sk(n, j, k, i, o) | 0;
+                          else e = j;
+                        } else e = j;
+                      while (0);
+                      j = e;
+                      i = bB(b, i, k) | 0;
+                    }
+                    while (1) {
+                      if ((f | 0) >= (d | 0)) {
+                        e = 0;
+                        break;
+                      }
+                      e = (m + ((f * 24) | 0) + 4) | 0;
+                      if ((c[(m + ((f * 24) | 0) + 8) >> 2] | 0) > 1) tk(k, e);
+                      e = c[e >> 2] | 0;
+                      if (e | 0) U1(e);
+                      f = (f + 1) | 0;
+                    }
+                    while (1) {
+                      if ((e | 0) >= (j | 0)) break;
+                      d = (n + ((e * 24) | 0) + 4) | 0;
+                      if ((c[(n + ((e * 24) | 0) + 8) >> 2] | 0) > 1) tk(k, d);
+                      d = c[d >> 2] | 0;
+                      if (d | 0) U1(d);
+                      e = (e + 1) | 0;
+                    }
+                    k = kC(b, k) | 0;
+                  }
+                }
+              while (0);
+              l = p;
+              return;
+            }
+            function sk(b, d, e, f, g) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0;
+              p = l;
+              l = (l + 16) | 0;
+              k = p;
+              m = (p + 12) | 0;
+              n = (p + 8) | 0;
+              o = 0;
+              while (1) {
+                if ((o | 0) >= (d | 0)) {
+                  j = 10;
+                  break;
+                }
+                j = c[(b + ((o * 24) | 0)) >> 2] | 0;
+                if ((a[j >> 0] | 0) == (a[g >> 0] | 0) ? (s2(j, g) | 0) == 0 : 0) {
+                  j = 5;
+                  break;
+                }
+                o = (o + 1) | 0;
+              }
+              do
+                if ((j | 0) == 5) {
+                  k = (b + ((o * 24) | 0) + 4) | 0;
+                  j = c[k >> 2] | 0;
+                  if (!j) {
+                    j = (b + ((o * 24) | 0) + 8) | 0;
+                    g = j;
+                    j = KK(((c[j >> 2] << 2) + 8) | 0) | 0;
+                  } else {
+                    q = (b + ((o * 24) | 0) + 8) | 0;
+                    g = q;
+                    j = MK(j, ((c[q >> 2] << 2) + 8) | 0) | 0;
+                  }
+                  c[k >> 2] = j;
+                  r = c[g >> 2] | 0;
+                  q = (r + 1) | 0;
+                  c[g >> 2] = q;
+                  c[(j + (r << 2)) >> 2] = f;
+                  c[((c[k >> 2] | 0) + (q << 2)) >> 2] = 0;
+                  j = 13;
+                } else if ((j | 0) == 10)
+                  if ((d | 0) > 4) {
+                    r = KB(e) | 0;
+                    c[k >> 2] = 5;
+                    c[(k + 4) >> 2] = r;
+                    gA(1, 87430, k) | 0;
+                    break;
+                  } else {
+                    s = (b + ((o * 24) | 0) + 8) | 0;
+                    c[s >> 2] = 0;
+                    k = JK(8) | 0;
+                    r = (b + ((o * 24) | 0) + 4) | 0;
+                    c[r >> 2] = k;
+                    q = c[s >> 2] | 0;
+                    j = (q + 1) | 0;
+                    c[s >> 2] = j;
+                    c[(k + (q << 2)) >> 2] = f;
+                    c[((c[r >> 2] | 0) + (j << 2)) >> 2] = 0;
+                    c[(b + ((o * 24) | 0)) >> 2] = g;
+                    c[(b + ((o * 24) | 0) + 12) >> 2] = 0;
+                    h[(b + ((o * 24) | 0) + 16) >> 3] = 0.0;
+                    d = (d + 1) | 0;
+                    j = 13;
+                    break;
+                  }
+              while (0);
+              if ((j | 0) == 13) {
+                HH(f, m, n);
+                j =
+                  (c[((((c[f >> 2] & 3) | 0) == 2 ? f : (f + -48) | 0) + 40) >> 2] | 0) == (e | 0)
+                    ? c[n >> 2] | 0
+                    : c[m >> 2] | 0;
+                if (j) {
+                  r = (b + ((o * 24) | 0) + 12) | 0;
+                  s = c[r >> 2] | 0;
+                  c[r >> 2] = s + 1;
+                  if (!s) i = +LH(f, j);
+                  else i = 0.0;
+                  h[(b + ((o * 24) | 0) + 16) >> 3] = i;
+                }
+              }
+              l = p;
+              return d | 0;
+            }
+            function tk(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0.0,
+                m = 0.0,
+                n = 0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0.0;
+              x = l;
+              l = (l + 80) | 0;
+              t = (x + 68) | 0;
+              u = (x + 64) | 0;
+              r = x;
+              v = (d + 4) | 0;
+              n = c[v >> 2] | 0;
+              w = (b + 16) | 0;
+              i = 0;
+              p = 0.0;
+              q = 0.0;
+              while (1) {
+                if ((i | 0) >= (n | 0)) break;
+                f = c[((c[d >> 2] | 0) + (i << 2)) >> 2] | 0;
+                g = c[f >> 2] & 3;
+                e = c[(((g | 0) == 2 ? f : (f + -48) | 0) + 40) >> 2] | 0;
+                if ((e | 0) == (b | 0)) e = c[(((g | 0) == 3 ? f : (f + 48) | 0) + 40) >> 2] | 0;
+                g = c[(e + 16) >> 2] | 0;
+                s = c[w >> 2] | 0;
+                k = +h[(g + 16) >> 3] - +h[(s + 16) >> 3];
+                m = +h[(g + 24) >> 3] - +h[(s + 24) >> 3];
+                o = +L2(k, m);
+                i = (i + 1) | 0;
+                p = k / o + p;
+                q = m / o + q;
+              }
+              j = +L2(p, q);
+              s = c[w >> 2] | 0;
+              k = +h[(s + 16) >> 3];
+              m = +h[(s + 24) >> 3];
+              y = +h[(s + 96) >> 3] + +h[(s + 88) >> 3];
+              o = +h[(s + 80) >> 3];
+              s = y > o + +(c[((c[((xC(b) | 0) + 16) >> 2] | 0) + 252) >> 2] | 0);
+              e = c[w >> 2] | 0;
+              if (s) o = +h[(e + 96) >> 3] + +h[(e + 88) >> 3];
+              else {
+                o = +h[(e + 80) >> 3];
+                o = o + +(c[((c[((xC(b) | 0) + 16) >> 2] | 0) + 252) >> 2] | 0);
+                e = c[w >> 2] | 0;
+              }
+              y = +h[(e + 16) >> 3] + o * (p / j);
+              j = +h[(e + 24) >> 3] + o * (q / j);
+              h[r >> 3] = k;
+              n = (r + 8) | 0;
+              h[n >> 3] = m;
+              h[(r + 16) >> 3] = (y + k * 2.0) * 0.3333333333333333;
+              h[(r + 24) >> 3] = (j + m * 2.0) * 0.3333333333333333;
+              h[(r + 32) >> 3] = (y * 2.0 + k) * 0.3333333333333333;
+              h[(r + 40) >> 3] = (j * 2.0 + m) * 0.3333333333333333;
+              h[(r + 48) >> 3] = y;
+              h[(r + 56) >> 3] = j;
+              aO(b, r);
+              s = c[w >> 2] | 0;
+              j = +h[r >> 3] - +h[(s + 16) >> 3];
+              k = +h[n >> 3] - +h[(s + 24) >> 3];
+              j = +(~~(j + (j >= 0.0 ? 0.5 : -0.5)) | 0);
+              k = +(~~(k + (k >= 0.0 ? 0.5 : -0.5)) | 0);
+              y = +h[(s + 88) >> 3];
+              s = ~~(((y + j) * 256.0) / (+h[(s + 96) >> 3] + y)) & 255;
+              r = 0;
+              while (1) {
+                if ((r | 0) >= (c[v >> 2] | 0)) break;
+                n = c[((c[d >> 2] | 0) + (r << 2)) >> 2] | 0;
+                HH(n, t, u);
+                while (1) {
+                  if (!n) break;
+                  else g = n;
+                  while (1) {
+                    if (!g) {
+                      i = n;
+                      break;
+                    }
+                    e = c[g >> 2] | 0;
+                    i = (g + -48) | 0;
+                    if ((c[((((e & 3) | 0) == 2 ? g : i) + 40) >> 2] | 0) == (b | 0)) {
+                      e = c[(g + 16) >> 2] | 0;
+                      h[(e + 56) >> 3] = j;
+                      h[(e + 64) >> 3] = k;
+                      h[(e + 72) >> 3] = 0.0;
+                      c[(e + 80) >> 2] = 0;
+                      a[(e + 84) >> 0] = 1;
+                      a[(e + 85) >> 0] = 0;
+                      a[(e + 86) >> 0] = 0;
+                      a[(e + 87) >> 0] = 0;
+                      a[(e + 88) >> 0] = s;
+                      a[(e + 89) >> 0] = 0;
+                      c[(e + 92) >> 2] = 0;
+                      e = c[g >> 2] | 0;
+                    }
+                    f = (g + 16) | 0;
+                    if ((c[((((e & 3) | 0) == 3 ? g : (g + 48) | 0) + 40) >> 2] | 0) == (b | 0)) {
+                      e = c[f >> 2] | 0;
+                      h[(e + 16) >> 3] = j;
+                      h[(e + 24) >> 3] = k;
+                      h[(e + 32) >> 3] = 0.0;
+                      c[(e + 40) >> 2] = 0;
+                      a[(e + 44) >> 0] = 1;
+                      a[(e + 45) >> 0] = 0;
+                      a[(e + 46) >> 0] = 0;
+                      a[(e + 47) >> 0] = 0;
+                      a[(e + 48) >> 0] = s;
+                      a[(e + 49) >> 0] = 0;
+                      c[(e + 52) >> 2] = 0;
+                    }
+                    if ((a[((c[f >> 2] | 0) + 112) >> 0] | 0) != 1) {
+                      g = 0;
+                      continue;
+                    }
+                    e = c[((c[((((c[g >> 2] & 3) | 0) == 2 ? g : i) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                    if ((a[(e + 156) >> 0] | 0) != 1) {
+                      g = 0;
+                      continue;
+                    }
+                    if ((c[(e + 184) >> 2] | 0) != 1) {
+                      g = 0;
+                      continue;
+                    }
+                    g = c[c[(e + 180) >> 2] >> 2] | 0;
+                  }
+                  while (1) {
+                    if (!i) break;
+                    e = c[i >> 2] | 0;
+                    if ((c[((((e & 3) | 0) == 2 ? i : (i + -48) | 0) + 40) >> 2] | 0) == (b | 0)) {
+                      e = c[(i + 16) >> 2] | 0;
+                      h[(e + 56) >> 3] = j;
+                      h[(e + 64) >> 3] = k;
+                      h[(e + 72) >> 3] = 0.0;
+                      c[(e + 80) >> 2] = 0;
+                      a[(e + 84) >> 0] = 1;
+                      a[(e + 85) >> 0] = 0;
+                      a[(e + 86) >> 0] = 0;
+                      a[(e + 87) >> 0] = 0;
+                      a[(e + 88) >> 0] = s;
+                      a[(e + 89) >> 0] = 0;
+                      c[(e + 92) >> 2] = 0;
+                      e = c[i >> 2] | 0;
+                    }
+                    f = (i + 48) | 0;
+                    g = (i + 16) | 0;
+                    if ((c[((((e & 3) | 0) == 3 ? i : f) + 40) >> 2] | 0) == (b | 0)) {
+                      e = c[g >> 2] | 0;
+                      h[(e + 16) >> 3] = j;
+                      h[(e + 24) >> 3] = k;
+                      h[(e + 32) >> 3] = 0.0;
+                      c[(e + 40) >> 2] = 0;
+                      a[(e + 44) >> 0] = 1;
+                      a[(e + 45) >> 0] = 0;
+                      a[(e + 46) >> 0] = 0;
+                      a[(e + 47) >> 0] = 0;
+                      a[(e + 48) >> 0] = s;
+                      a[(e + 49) >> 0] = 0;
+                      c[(e + 52) >> 2] = 0;
+                    }
+                    if ((a[((c[g >> 2] | 0) + 112) >> 0] | 0) != 1) {
+                      i = 0;
+                      continue;
+                    }
+                    e = c[((c[((((c[i >> 2] & 3) | 0) == 3 ? i : f) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                    if ((a[(e + 156) >> 0] | 0) != 1) {
+                      i = 0;
+                      continue;
+                    }
+                    if ((c[(e + 176) >> 2] | 0) != 1) {
+                      i = 0;
+                      continue;
+                    }
+                    i = c[c[(e + 172) >> 2] >> 2] | 0;
+                  }
+                  n = c[((c[(n + 16) >> 2] | 0) + 172) >> 2] | 0;
+                }
+                r = (r + 1) | 0;
+              }
+              a[((c[w >> 2] | 0) + 145) >> 0] = 1;
+              l = x;
+              return;
+            }
+            function uk(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              ih(a);
+              b = c[a >> 2] & 3;
+              d = (a + -48) | 0;
+              e = (a + 48) | 0;
+              b = dh(c[(((b | 0) == 2 ? a : d) + 40) >> 2] | 0, c[(((b | 0) == 3 ? a : e) + 40) >> 2] | 0) | 0;
+              if (!b) {
+                b = c[a >> 2] & 3;
+                nh(c[(((b | 0) == 2 ? a : d) + 40) >> 2] | 0, c[(((b | 0) == 3 ? a : e) + 40) >> 2] | 0, a) | 0;
+              } else vh(a, b);
+              return;
+            }
+            function vk(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              f = (b + 16) | 0;
+              e = 0;
+              while (1) {
+                b = c[f >> 2] | 0;
+                if ((e | 0) >= (c[(b + 220) >> 2] | 0)) break;
+                d = c[((c[(b + 216) >> 2] | 0) + (e << 2)) >> 2] | 0;
+                c[(b + 192) >> 2] = d;
+                b = d;
+                d = b;
+                while (1) {
+                  if (!d) break;
+                  g = c[(d + 16) >> 2] | 0;
+                  a[(g + 157) >> 0] = 0;
+                  d = c[(g + 164) >> 2] | 0;
+                }
+                while (1) {
+                  if (!b) break;
+                  wk(b);
+                  b = c[((c[(b + 16) >> 2] | 0) + 164) >> 2] | 0;
+                }
+                e = (e + 1) | 0;
+              }
+              return;
+            }
+            function wk(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              g = (b + 16) | 0;
+              d = c[g >> 2] | 0;
+              b = (d + 157) | 0;
+              if (!(a[b >> 0] | 0)) {
+                a[b >> 0] = 1;
+                a[(d + 158) >> 0] = 1;
+                b = 0;
+                while (1) {
+                  f = c[((c[(d + 180) >> 2] | 0) + (b << 2)) >> 2] | 0;
+                  if (!f) break;
+                  d = c[((((c[f >> 2] & 3) | 0) == 2 ? f : (f + -48) | 0) + 40) >> 2] | 0;
+                  e = c[(d + 16) >> 2] | 0;
+                  if (!(a[(e + 158) >> 0] | 0)) {
+                    if (!(a[(e + 157) >> 0] | 0)) wk(d);
+                  } else {
+                    uk(f);
+                    b = (b + -1) | 0;
+                  }
+                  b = (b + 1) | 0;
+                  d = c[g >> 2] | 0;
+                }
+                a[(d + 158) >> 0] = 0;
+              }
+              return;
+            }
+            function xk(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              e = jC(a) | 0;
+              b = 0;
+              while (1) {
+                if (!e) break;
+                d = XA(a, e) | 0;
+                while (1) {
+                  if (!d) break;
+                  g = c[d >> 2] & 3;
+                  h = c[((c[((c[(((g | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0;
+                  g = c[((c[((c[(((g | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0;
+                  f = (h - g) | 0;
+                  d = ZA(a, d) | 0;
+                  b = (((h | 0) == (g | 0) ? 0 : (((f | 0) > -1 ? f : (0 - f) | 0) + -1) | 0) + b) | 0;
+                }
+                e = kC(a, e) | 0;
+              }
+              return b | 0;
+            }
+            function yk(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              e = jC(b) | 0;
+              while (1) {
+                if (!e) break;
+                g = c[(e + 16) >> 2] | 0;
+                f = c[(g + 176) >> 2] | 0;
+                g = (g + 172) | 0;
+                d = 0;
+                while (1) {
+                  if ((d | 0) >= (f | 0)) break;
+                  a[((c[((c[((c[g >> 2] | 0) + (d << 2)) >> 2] | 0) + 16) >> 2] | 0) + 112) >> 0] = 0;
+                  d = (d + 1) | 0;
+                }
+                e = kC(b, e) | 0;
+              }
+              return;
+            }
+            function zk(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0.0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              q = l;
+              l = (l + 16) | 0;
+              o = q;
+              j = c[(b + 24) >> 2] | 0;
+              Ak(a);
+              k = (j | 0) == -1;
+              m = (b + 8) | 0;
+              i = k ^ 1;
+              n = c[15712] | 0;
+              f = 1797693134862315708145274.0e284;
+              g = 0;
+              while (1) {
+                if (!(k | ((g | 0) < (j | 0)))) break;
+                d = jC(a) | 0;
+                while (1) {
+                  if (!d) break;
+                  c[((c[(d + 16) >> 2] | 0) + 232) >> 2] = 0;
+                  d = kC(a, d) | 0;
+                }
+                wj(a);
+                e = +Bk(a);
+                h[m >> 3] = e;
+                if (0) {
+                  h[o >> 3] = e;
+                  w4(n, 87482, o) | 0;
+                  e = +h[m >> 3];
+                }
+                if (!(!(e <= +h[b >> 3]) & (!(f <= e) | i))) {
+                  p = 9;
+                  break;
+                }
+                Ck(a);
+                f = e;
+                g = (g + 1) | 0;
+              }
+              if ((p | 0) == 9) {
+                p = (b + 20) | 0;
+                c[(b + 16) >> 2] = c[p >> 2];
+                c[p >> 2] = g;
+              }
+              wj(a);
+              Dk(a);
+              Ek();
+              h[m >> 3] = +Bk(a);
+              l = q;
+              return;
+            }
+            function Ak(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0.0,
+                m = 0.0,
+                n = 0;
+              c[46752] = KK(((tB(a) | 0) * 24) | 0) | 0;
+              c[46751] = 0;
+              b = jC(a) | 0;
+              while (1) {
+                if (!b) break;
+                c[((c[(b + 16) >> 2] | 0) + 120) >> 2] = -1;
+                b = kC(a, b) | 0;
+              }
+              i = jC(a) | 0;
+              while (1) {
+                if (!i) break;
+                j = (i + 16) | 0;
+                do
+                  if (!(c[((c[j >> 2] | 0) + 216) >> 2] | 0)) {
+                    f = JK(4) | 0;
+                    g = c[46752] | 0;
+                    k = c[46751] | 0;
+                    c[(g + ((k * 24) | 0)) >> 2] = f;
+                    c[f >> 2] = i;
+                    c[(g + ((k * 24) | 0) + 4) >> 2] = 1;
+                    j = c[j >> 2] | 0;
+                    h[(g + ((k * 24) | 0) + 8) >> 3] = +h[(j + 32) >> 3];
+                    h[(g + ((k * 24) | 0) + 16) >> 3] = +h[(j + 40) >> 3];
+                    c[(j + 120) >> 2] = k;
+                    c[46751] = k + 1;
+                  } else {
+                    g = fP(i) | 0;
+                    k = (g + 16) | 0;
+                    b = c[k >> 2] | 0;
+                    d = c[(b + 120) >> 2] | 0;
+                    if ((d | 0) > -1) {
+                      g = c[46752] | 0;
+                      f = c[(g + ((d * 24) | 0)) >> 2] | 0;
+                      e = (g + ((d * 24) | 0) + 4) | 0;
+                      k = c[e >> 2] | 0;
+                      c[e >> 2] = k + 1;
+                      c[(f + (k << 2)) >> 2] = i;
+                      k = c[j >> 2] | 0;
+                      j = (g + ((d * 24) | 0) + 8) | 0;
+                      h[j >> 3] = +h[j >> 3] + +h[(k + 32) >> 3];
+                      j = (g + ((d * 24) | 0) + 16) | 0;
+                      l = +h[j >> 3];
+                      m = +h[(k + 40) >> 3];
+                      h[j >> 3] = l < m ? m : l;
+                      c[(k + 120) >> 2] = d;
+                      break;
+                    }
+                    d = JK(c[(b + 216) >> 2] << 2) | 0;
+                    e = c[46752] | 0;
+                    f = c[46751] | 0;
+                    b = (e + ((f * 24) | 0)) | 0;
+                    c[b >> 2] = d;
+                    c[d >> 2] = g;
+                    if ((g | 0) == (i | 0)) {
+                      h[(e + ((f * 24) | 0) + 8) >> 3] = +h[((c[k >> 2] | 0) + 32) >> 3];
+                      d = 1;
+                      b = i;
+                    } else {
+                      c[((c[b >> 2] | 0) + 4) >> 2] = i;
+                      n = c[k >> 2] | 0;
+                      b = c[j >> 2] | 0;
+                      h[(e + ((f * 24) | 0) + 8) >> 3] = +h[(b + 32) >> 3] + +h[(n + 32) >> 3];
+                      d = 2;
+                      b = +h[(n + 40) >> 3] < +h[(b + 40) >> 3] ? i : g;
+                    }
+                    c[(e + ((f * 24) | 0) + 4) >> 2] = d;
+                    h[(e + ((f * 24) | 0) + 16) >> 3] = +h[((c[(b + 16) >> 2] | 0) + 40) >> 3];
+                    c[((c[k >> 2] | 0) + 120) >> 2] = f;
+                    c[((c[j >> 2] | 0) + 120) >> 2] = f;
+                    c[46751] = f + 1;
+                  }
+                while (0);
+                i = kC(a, i) | 0;
+              }
+              return;
+            }
+            function Bk(a) {
+              a = a | 0;
+              var b = 0.0,
+                d = 0.0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0.0,
+                j = 0.0;
+              Dk(a);
+              g = c[46749] | 0;
+              e = c[(a + 16) >> 2] | 0;
+              b = +(O(c[(e + 252) >> 2] | 0, (g + -1) | 0) | 0);
+              f = c[46750] | 0;
+              e = (e + 248) | 0;
+              a = 0;
+              d = 0.0;
+              while (1) {
+                if ((a | 0) >= (g | 0)) break;
+                i = +h[(f + ((a * 40) | 0) + 24) >> 3] + +(O(c[e >> 2] | 0, c[(f + ((a * 40) | 0) + 16) >> 2] | 0) | 0);
+                j = +h[(f + ((a * 40) | 0) + 32) >> 3] + b;
+                a = (a + 1) | 0;
+                b = j;
+                d = d < i ? i : d;
+              }
+              return +(d / b);
+            }
+            function Ck(a) {
+              a = a | 0;
+              var b = 0;
+              c[46753] = JK((tB(a) | 0) << 2) | 0;
+              b = 0;
+              while (1) {
+                if ((b | 0) >= (tB(a) | 0)) break;
+                c[((c[46753] | 0) + (b << 2)) >> 2] = b;
+                b = (b + 1) | 0;
+              }
+              Dk(a);
+              Fk(a);
+              Gk(a);
+              return;
+            }
+            function Dk(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0,
+                l = 0;
+              c[46749] = 0;
+              b = c[46750] | 0;
+              if (b | 0) {
+                e = 0;
+                while (1) {
+                  if ((e | 0) >= (c[46751] | 0)) break;
+                  d = c[(b + ((e * 40) | 0) + 4) >> 2] | 0;
+                  if (d) {
+                    U1(d);
+                    b = c[46750] | 0;
+                  }
+                  d = c[(b + ((e * 40) | 0) + 8) >> 2] | 0;
+                  if (d) {
+                    U1(d);
+                    b = c[46750] | 0;
+                  }
+                  e = (e + 1) | 0;
+                }
+                U1(b);
+              }
+              c[46750] = JK(((c[46751] | 0) * 40) | 0) | 0;
+              b = 0;
+              while (1) {
+                d = c[46751] | 0;
+                if ((b | 0) >= (d | 0)) break;
+                k = JK(d << 2) | 0;
+                c[((c[46750] | 0) + ((b * 40) | 0) + 4) >> 2] = k;
+                k = JK(c[46751] << 2) | 0;
+                l = c[46750] | 0;
+                c[(l + ((b * 40) | 0) + 8) >> 2] = k;
+                c[(l + ((b * 40) | 0)) >> 2] = b;
+                c[(l + ((b * 40) | 0) + 12) >> 2] = 0;
+                c[(l + ((b * 40) | 0) + 16) >> 2] = 0;
+                l = (l + ((b * 40) | 0) + 24) | 0;
+                c[l >> 2] = 0;
+                c[(l + 4) >> 2] = 0;
+                c[(l + 8) >> 2] = 0;
+                c[(l + 12) >> 2] = 0;
+                b = (b + 1) | 0;
+              }
+              e = jC(a) | 0;
+              while (1) {
+                if (!e) break;
+                d = XA(a, e) | 0;
+                while (1) {
+                  if (!d) break;
+                  i = c[d >> 2] | 0;
+                  f = (d + -48) | 0;
+                  g = c[46750] | 0;
+                  b =
+                    c[((c[((c[((((i & 3) | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] |
+                    0;
+                  while (1) {
+                    b = (b + 1) | 0;
+                    if (
+                      (b | 0) >=
+                      (c[((c[((c[((((i & 3) | 0) == 2 ? d : f) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0)
+                    )
+                      break;
+                    i = (g + ((b * 40) | 0) + 16) | 0;
+                    c[i >> 2] = (c[i >> 2] | 0) + 1;
+                    i = c[d >> 2] | 0;
+                  }
+                  d = ZA(a, d) | 0;
+                }
+                e = kC(a, e) | 0;
+              }
+              i = c[46751] | 0;
+              k = c[46752] | 0;
+              l = c[46750] | 0;
+              d = (a + 16) | 0;
+              b = 0;
+              while (1) {
+                if ((b | 0) >= (i | 0)) break;
+                e = ((c[c[(k + ((b * 24) | 0)) >> 2] >> 2] | 0) + 16) | 0;
+                f = c[((c[e >> 2] | 0) + 232) >> 2] | 0;
+                if ((f | 0) >= (c[46749] | 0)) c[46749] = f + 1;
+                g = (l + ((f * 40) | 0) + 24) | 0;
+                j = +h[g >> 3];
+                h[g >> 3] =
+                  j +
+                  +h[(k + ((b * 24) | 0) + 8) >> 3] * 72.0 +
+                  (j > 0.0 ? +(c[((c[d >> 2] | 0) + 248) >> 2] | 0) : 0.0);
+                g = (l + ((f * 40) | 0) + 32) | 0;
+                j = +h[(k + ((b * 24) | 0) + 16) >> 3] * 72.0;
+                if (+h[g >> 3] < j) h[g >> 3] = j;
+                c[((c[(l + ((f * 40) | 0) + 4) >> 2] | 0) + (c[(l + ((f * 40) | 0) + 12) >> 2] << 2)) >> 2] =
+                  k + ((b * 24) | 0);
+                a = (l + (((c[((c[e >> 2] | 0) + 232) >> 2] | 0) * 40) | 0) + 12) | 0;
+                c[a >> 2] = (c[a >> 2] | 0) + 1;
+                b = (b + 1) | 0;
+              }
+              return;
+            }
+            function Ek() {
+              var a = 0,
+                b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              k = c[46749] | 0;
+              l = c[46750] | 0;
+              j = 0;
+              b = 0;
+              a = 0;
+              while (1) {
+                if ((j | 0) >= (k | 0)) break;
+                d = (l + ((j * 40) | 0)) | 0;
+                i = c[(l + ((j * 40) | 0) + 12) >> 2] | 0;
+                e = (b | 0) == 0;
+                a: do
+                  if (i)
+                    if (!e) {
+                      if ((c[d >> 2] | 0) > (a | 0)) {
+                        f = (l + ((j * 40) | 0) + 4) | 0;
+                        d = 0;
+                        while (1) {
+                          if ((d | 0) >= (i | 0)) break a;
+                          g = c[((c[f >> 2] | 0) + (d << 2)) >> 2] | 0;
+                          h = c[(g + 4) >> 2] | 0;
+                          e = 0;
+                          while (1) {
+                            if ((e | 0) >= (h | 0)) break;
+                            m = ((c[((c[((c[g >> 2] | 0) + (e << 2)) >> 2] | 0) + 16) >> 2] | 0) + 232) | 0;
+                            c[m >> 2] = (c[m >> 2] | 0) - b;
+                            e = (e + 1) | 0;
+                          }
+                          d = (d + 1) | 0;
+                        }
+                      }
+                    } else b = 0;
+                  else {
+                    if (e) a = c[d >> 2] | 0;
+                    b = (b + 1) | 0;
+                  }
+                while (0);
+                j = (j + 1) | 0;
+              }
+              return;
+            }
+            function Fk(a) {
+              a = a | 0;
+              var b = 0;
+              b = c[46753] | 0;
+              o4(b, tB(a) | 0, 4, 63);
+              return;
+            }
+            function Gk(b) {
+              b = b | 0;
+              var d = 0.0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0.0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0.0,
+                s = 0;
+              j = c[46749] | 0;
+              k = c[46750] | 0;
+              g = c[46753] | 0;
+              i = 0;
+              while (1) {
+                if ((i | 0) >= (j | 0)) {
+                  e = 0;
+                  d = 0.0;
+                  break;
+                }
+                e = c[(g + (i << 2)) >> 2] | 0;
+                f = (i + 1) | 0;
+                if ((c[(k + ((e * 40) | 0) + 12) >> 2] | 0) < 2) i = f;
+                else {
+                  l = 4;
+                  break;
+                }
+              }
+              if ((l | 0) == 4)
+                if ((j | 0) > (f | 0)) d = +h[(k + (((c[(g + (f << 2)) >> 2] | 0) * 40) | 0) + 24) >> 3];
+                else d = 0.0;
+              a: do
+                if ((i | 0) != (j | 0)) {
+                  o4(c[(k + ((e * 40) | 0) + 4) >> 2] | 0, c[(k + ((e * 40) | 0) + 12) >> 2] | 0, 4, 64);
+                  g = c[46750] | 0;
+                  r = +h[(g + ((e * 40) | 0) + 24) >> 3];
+                  r = !(d <= r * 0.25) & !(d >= r * 0.75) ? d : r * 0.5;
+                  s = c[(g + ((e * 40) | 0) + 12) >> 2] | 0;
+                  q = (b + 16) | 0;
+                  n = 0;
+                  o = 0;
+                  d = 0.0;
+                  f = 0;
+                  p = 0;
+                  while (1) {
+                    if ((p | 0) >= ((f + s) | 0)) break a;
+                    do
+                      if (!(c[((c[(g + ((e * 40) | 0) + 8) >> 2] | 0) + (p << 2)) >> 2] | 0)) {
+                        l = c[((c[(g + ((e * 40) | 0) + 4) >> 2] | 0) + (p << 2)) >> 2] | 0;
+                        b = (l + 8) | 0;
+                        m = +h[b >> 3] * 72.0 + d + (d > 0.0 ? +(c[((c[q >> 2] | 0) + 248) >> 2] | 0) : 0.0);
+                        i = (o | 0) != 0;
+                        if (!(i & !(m <= r))) {
+                          j = i ? n : l;
+                          i = i ? o : 1;
+                          d = m;
+                          break;
+                        }
+                        j = (n + 4) | 0;
+                        k = (l + 4) | 0;
+                        i = 0;
+                        while (1) {
+                          if ((i | 0) < (c[j >> 2] | 0)) g = 0;
+                          else break;
+                          while (1) {
+                            if ((g | 0) >= (c[k >> 2] | 0)) break;
+                            a[
+                              ((c[
+                                ((nh(
+                                  c[((c[n >> 2] | 0) + (i << 2)) >> 2] | 0,
+                                  c[((c[l >> 2] | 0) + (g << 2)) >> 2] | 0,
+                                  0
+                                ) |
+                                  0) +
+                                  16) >>
+                                  2
+                              ] |
+                                0) +
+                                112) >>
+                                0
+                            ] = 1;
+                            g = (g + 1) | 0;
+                          }
+                          i = (i + 1) | 0;
+                        }
+                        g = c[46750] | 0;
+                        c[((c[(g + ((e * 40) | 0) + 8) >> 2] | 0) + (p << 2)) >> 2] = 1;
+                        j = (g + ((e * 40) | 0) + 12) | 0;
+                        c[j >> 2] = (c[j >> 2] | 0) + -1;
+                        j = (g + ((e * 40) | 0) + 16) | 0;
+                        c[j >> 2] = (c[j >> 2] | 0) + 1;
+                        j = (g + ((e * 40) | 0) + 24) | 0;
+                        h[j >> 3] = +h[b >> 3] * -72.0 - +(c[((c[q >> 2] | 0) + 248) >> 2] | 0) + +h[j >> 3];
+                        j = n;
+                        i = o;
+                      } else {
+                        j = n;
+                        i = o;
+                        f = (f + 1) | 0;
+                      }
+                    while (0);
+                    n = j;
+                    o = i;
+                    p = (p + 1) | 0;
+                  }
+                }
+              while (0);
+              return;
+            }
+            function Hk(a, b) {
+              a = a | 0;
+              b = b | 0;
+              a = Ik(c[a >> 2] | 0) | 0;
+              b = Ik(c[b >> 2] | 0) | 0;
+              return ((((b | 0) < (a | 0)) & 1) - (((b | 0) > (a | 0)) & 1)) | 0;
+            }
+            function Ik(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              f = (a + 4) | 0;
+              d = 0;
+              b = 0;
+              while (1) {
+                if ((d | 0) >= (c[f >> 2] | 0)) break;
+                e = c[((c[a >> 2] | 0) + (d << 2)) >> 2] | 0;
+                g = xC(e) | 0;
+                e = XA(g, e) | 0;
+                while (1) {
+                  if (!e) break;
+                  e = ZA(g, e) | 0;
+                  b = (b + 1) | 0;
+                }
+                d = (d + 1) | 0;
+              }
+              return b | 0;
+            }
+            function Jk(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0;
+              f = c[46750] | 0;
+              e = +h[(f + (((c[b >> 2] | 0) * 40) | 0) + 24) >> 3];
+              d = +h[(f + (((c[a >> 2] | 0) * 40) | 0) + 24) >> 3];
+              return (((e > d) & 1) - ((e < d) & 1)) | 0;
+            }
+            function Kk(a) {
+              a = a | 0;
+              var b = 0;
+              b = jC(a) | 0;
+              while (1) {
+                if (!b) break;
+                c[((c[(b + 16) >> 2] | 0) + 216) >> 2] = 0;
+                b = kC(a, b) | 0;
+              }
+              return;
+            }
+            function Lk(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              g = l;
+              l = (l + 32) | 0;
+              f = (g + 16) | 0;
+              e = (g + 8) | 0;
+              d = (g + 20) | 0;
+              c[d >> 2] = 5;
+              a = QA(a, 99605) | 0;
+              if (a | 0 ? ((c[e >> 2] = g), (c[(e + 4) >> 2] = d), (b5(a, 87497, e) | 0) >= 1) : 0) gA(0, 87504, f) | 0;
+              c[(b + 24) >> 2] = 0;
+              c[(b + 32) >> 2] = 0;
+              l = g;
+              return 0;
+            }
+            function Mk(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = c[47189] | 0;
+              if (
+                (((d | 0) != 0 ? ((e = RA(b, d) | 0), (e | 0) != 0) : 0) ? (a[e >> 0] | 0) != 0 : 0)
+                  ? ((dP(e) | 0) << 24) >> 24 == 0
+                  : 0
+              )
+                b = 1;
+              else b = 0;
+              return b | 0;
+            }
+            function Nk(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              gl(a);
+              b = jC(a) | 0;
+              while (1) {
+                if (!b) break;
+                d = XA(a, b) | 0;
+                while (1) {
+                  if (!d) break;
+                  do
+                    if (
+                      ((c[((c[(d + 16) >> 2] | 0) + 172) >> 2] | 0) == 0 ? (Mk(d) | 0) == 0 : 0)
+                        ? ((e = (d + 48) | 0),
+                          (f = fP(c[((((c[d >> 2] & 3) | 0) == 3 ? d : e) + 40) >> 2] | 0) | 0),
+                          (g = (d + -48) | 0),
+                          (h = fP(c[((((c[d >> 2] & 3) | 0) == 2 ? d : g) + 40) >> 2] | 0) | 0),
+                          (f | 0) != (h | 0))
+                        : 0
+                    ) {
+                      if (
+                        (c[((c[(f + 16) >> 2] | 0) + 212) >> 2] | 0) == 0
+                          ? (c[((c[(h + 16) >> 2] | 0) + 212) >> 2] | 0) == 0
+                          : 0
+                      ) {
+                        i = dh(f, h) | 0;
+                        if (!i) {
+                          nh(f, h, d) | 0;
+                          break;
+                        } else {
+                          vh(d, i);
+                          break;
+                        }
+                      }
+                      i = c[d >> 2] & 3;
+                      Ok(a, c[(((i | 0) == 3 ? d : e) + 40) >> 2] | 0, c[(((i | 0) == 2 ? d : g) + 40) >> 2] | 0, d);
+                    }
+                  while (0);
+                  d = ZA(a, d) | 0;
+                }
+                b = kC(a, b) | 0;
+              }
+              return;
+            }
+            function Ok(b, d, f, g) {
+              b = b | 0;
+              d = d | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              j = c[g >> 2] & 3;
+              h = c[((c[(((j | 0) == 3 ? g : (g + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0;
+              i = c[(h + 212) >> 2] | 0;
+              if (!i) k = 0;
+              else
+                k =
+                  ((c[(h + 232) >> 2] | 0) -
+                    (c[((c[((c[((c[(i + 16) >> 2] | 0) + 264) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0)) |
+                  0;
+              h = c[((c[(((j | 0) == 2 ? g : (g + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0;
+              i = c[(h + 212) >> 2] | 0;
+              if (!i) h = 0;
+              else
+                h =
+                  ((c[((c[((c[((c[(i + 16) >> 2] | 0) + 264) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0) -
+                    (c[(h + 232) >> 2] | 0)) |
+                  0;
+              j = (g + 16) | 0;
+              k = (h + k + (e[((c[j >> 2] | 0) + 170) >> 1] | 0)) | 0;
+              b = sh(b) | 0;
+              a[((c[(b + 16) >> 2] | 0) + 156) >> 0] = 2;
+              i = fP(d) | 0;
+              d = fP(f) | 0;
+              f = Zi(b, i, (k | 0) > 0 ? 0.0 : +((0 - k) | 0), ((c[((c[j >> 2] | 0) + 156) >> 2] | 0) * 10) | 0) | 0;
+              c[
+                ((c[((Zi(b, d, +(((k | 0) > 0 ? k : 0) | 0), c[((c[j >> 2] | 0) + 156) >> 2] | 0) | 0) + 16) >> 2] |
+                  0) +
+                  116) >>
+                  2
+              ] = g;
+              c[((c[(f + 16) >> 2] | 0) + 116) >> 2] = g;
+              return;
+            }
+            function Pk(a, d, f, g) {
+              a = a | 0;
+              d = d | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              j = c[d >> 2] & 3;
+              i = (j | 0) == 3 ? d : (d + 48) | 0;
+              j = (j | 0) == 2 ? d : (d + -48) | 0;
+              j =
+                c[
+                  ((c[
+                    ((c[
+                      (((c[((c[((c[(i + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0) >
+                      (c[((c[((c[(j + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0)
+                        ? i
+                        : j) +
+                        40) >>
+                        2
+                    ] |
+                      0) +
+                      16) >>
+                      2
+                  ] |
+                    0) +
+                    232) >>
+                    2
+                ] | 0;
+              i = (d + 16) | 0;
+              d = ((c[i >> 2] | 0) + 172) | 0;
+              if (c[d >> 2] | 0) qa(87593, 87615, 148, 87624);
+              c[d >> 2] = f;
+              h = (g | 0) == 0;
+              do {
+                d = c[i >> 2] | 0;
+                if (h) g = c[(f + 16) >> 2] | 0;
+                else {
+                  g = c[(f + 16) >> 2] | 0;
+                  k = (g + 168) | 0;
+                  b[k >> 1] = (e[k >> 1] | 0) + (e[(d + 168) >> 1] | 0);
+                }
+                k = (g + 154) | 0;
+                b[k >> 1] = (e[k >> 1] | 0) + (e[(d + 154) >> 1] | 0);
+                g = (g + 156) | 0;
+                c[g >> 2] = (c[g >> 2] | 0) + (c[(d + 156) >> 2] | 0);
+                d = (f + -48) | 0;
+                g = c[((((c[f >> 2] & 3) | 0) == 2 ? f : d) + 40) >> 2] | 0;
+                if ((c[((c[(g + 16) >> 2] | 0) + 232) >> 2] | 0) == (j | 0)) break;
+                Qk(a, g);
+                f =
+                  c[
+                    c[((c[((c[((((c[f >> 2] & 3) | 0) == 2 ? f : d) + 40) >> 2] | 0) + 16) >> 2] | 0) + 180) >> 2] >> 2
+                  ] | 0;
+              } while ((f | 0) != 0);
+              return;
+            }
+            function Qk(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0;
+              d = +(((c[((c[(a + 16) >> 2] | 0) + 248) >> 2] | 0) / 2) | 0 | 0);
+              b = c[(b + 16) >> 2] | 0;
+              a = (b + 88) | 0;
+              h[a >> 3] = +h[a >> 3] + d;
+              b = (b + 96) | 0;
+              h[b >> 3] = +h[b >> 3] + d;
+              return;
+            }
+            function Rk(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              if (
+                (
+                  (
+                    (
+                      ((a | 0) != 0) & ((b | 0) != 0)
+                        ? ((e = c[a >> 2] & 3),
+                          (d = c[b >> 2] & 3),
+                          (c[(((e | 0) == 3 ? a : (a + 48) | 0) + 40) >> 2] | 0) ==
+                            (c[(((d | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0))
+                        : 0
+                    )
+                      ? (c[(((e | 0) == 2 ? a : (a + -48) | 0) + 40) >> 2] | 0) ==
+                        (c[(((d | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0)
+                      : 0
+                  )
+                    ? (c[((c[(a + 16) >> 2] | 0) + 96) >> 2] | 0) == (c[((c[(b + 16) >> 2] | 0) + 96) >> 2] | 0)
+                    : 0
+                )
+                  ? (uj(a, b) | 0) != 0
+                  : 0
+              )
+                a = 1;
+              else a = 0;
+              return a | 0;
+            }
+            function Sk(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0;
+              r = (b + 16) | 0;
+              d = c[r >> 2] | 0;
+              c[(d + 192) >> 2] = 0;
+              c[(d + 232) >> 2] = 0;
+              gl(b);
+              d = 1;
+              while (1) {
+                e = c[r >> 2] | 0;
+                if ((d | 0) > (c[(e + 180) >> 2] | 0)) break;
+                hl(b, c[((c[(e + 184) >> 2] | 0) + (d << 2)) >> 2] | 0);
+                d = (d + 1) | 0;
+              }
+              h = jC(b) | 0;
+              while (1) {
+                if (!h) break;
+                g = XA(b, h) | 0;
+                while (1) {
+                  if (!g) break;
+                  d = c[g >> 2] | 0;
+                  e = ((c[((c[((((d & 3) | 0) == 2 ? g : (g + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 160) | 0;
+                  f = a[e >> 0] | 0;
+                  if ((f << 24) >> 24 < 3) {
+                    a[e >> 0] = ((f + 1) << 24) >> 24;
+                    d = c[g >> 2] | 0;
+                  }
+                  d = ((c[((c[((((d & 3) | 0) == 3 ? g : (g + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 160) | 0;
+                  e = a[d >> 0] | 0;
+                  if ((e << 24) >> 24 < 3) a[d >> 0] = ((e + 1) << 24) >> 24;
+                  g = ZA(b, g) | 0;
+                }
+                h = kC(b, h) | 0;
+              }
+              m = jC(b) | 0;
+              while (1) {
+                if (!m) break;
+                if ((c[((c[(m + 16) >> 2] | 0) + 212) >> 2] | 0) == 0 ? (m | 0) == (fP(m) | 0) : 0) {
+                  oh(b, m);
+                  l = ((c[r >> 2] | 0) + 232) | 0;
+                  c[l >> 2] = (c[l >> 2] | 0) + 1;
+                }
+                d = 0;
+                l = XA(b, m) | 0;
+                while (1) {
+                  if (!l) break;
+                  k = (l + 16) | 0;
+                  h = c[k >> 2] | 0;
+                  a: do
+                    if (!(c[(h + 172) >> 2] | 0)) {
+                      if (Tk(l) | 0) {
+                        if (!(Rk(d, l) | 0)) {
+                          Uk(b, l);
+                          d = l;
+                          break;
+                        }
+                        e = c[((c[(d + 16) >> 2] | 0) + 172) >> 2] | 0;
+                        if (e | 0) {
+                          Pk(b, l, e, 0);
+                          jh(l);
+                          break;
+                        }
+                        k = c[l >> 2] & 3;
+                        if (
+                          (c[((c[((c[(((k | 0) == 3 ? l : (l + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] |
+                            0) !=
+                          (c[
+                            ((c[((c[(((k | 0) == 2 ? l : (l + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2
+                          ] |
+                            0)
+                        )
+                          break;
+                        vh(l, d);
+                        jh(l);
+                        break;
+                      }
+                      if (d) {
+                        i = c[l >> 2] & 3;
+                        e = (l + 48) | 0;
+                        f = c[(((i | 0) == 3 ? l : e) + 40) >> 2] | 0;
+                        g = c[d >> 2] & 3;
+                        if (
+                          (f | 0) == (c[(((g | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0)
+                            ? ((n = c[(((i | 0) == 2 ? l : (l + -48) | 0) + 40) >> 2] | 0),
+                              (n | 0) == (c[(((g | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0))
+                            : 0
+                        ) {
+                          if (
+                            (c[((c[(f + 16) >> 2] | 0) + 232) >> 2] | 0) ==
+                            (c[((c[(n + 16) >> 2] | 0) + 232) >> 2] | 0)
+                          ) {
+                            vh(l, d);
+                            jh(l);
+                            break;
+                          }
+                          if (
+                            (
+                              (c[(h + 96) >> 2] | 0) == 0
+                                ? ((o = (d + 16) | 0), (c[((c[o >> 2] | 0) + 96) >> 2] | 0) == 0)
+                                : 0
+                            )
+                              ? (uj(l, d) | 0) != 0
+                              : 0
+                          )
+                            if (!(a[194954] | 0)) {
+                              Pk(b, l, c[((c[o >> 2] | 0) + 172) >> 2] | 0, 1);
+                              jh(l);
+                              break;
+                            } else {
+                              a[((c[k >> 2] | 0) + 112) >> 0] = 6;
+                              break;
+                            }
+                          else i = e;
+                        } else i = e;
+                      } else i = (l + 48) | 0;
+                      h = c[l >> 2] & 3;
+                      e = c[(((h | 0) == 3 ? l : i) + 40) >> 2] | 0;
+                      j = (l + -48) | 0;
+                      if ((e | 0) == (c[(((h | 0) == 2 ? l : j) + 40) >> 2] | 0)) {
+                        jh(l);
+                        d = l;
+                        break;
+                      }
+                      e = fP(e) | 0;
+                      f = fP(c[((((c[l >> 2] & 3) | 0) == 2 ? l : j) + 40) >> 2] | 0) | 0;
+                      h = c[l >> 2] & 3;
+                      if (
+                        (c[(((h | 0) == 3 ? l : i) + 40) >> 2] | 0) == (e | 0)
+                          ? (c[(((h | 0) == 2 ? l : j) + 40) >> 2] | 0) == (f | 0)
+                          : 0
+                      ) {
+                        g = c[((c[(e + 16) >> 2] | 0) + 232) >> 2] | 0;
+                        h = c[((c[(f + 16) >> 2] | 0) + 232) >> 2] | 0;
+                        if ((g | 0) == (h | 0)) {
+                          th(b, l);
+                          d = l;
+                          break;
+                        }
+                        if ((h | 0) > (g | 0)) {
+                          Vk(b, e, f, l);
+                          d = l;
+                          break;
+                        }
+                        e = iB(b, f, e, 0, 0) | 0;
+                        do
+                          if (
+                            e | 0
+                              ? ((p = c[e >> 2] & 3),
+                                (q = c[(((p | 0) == 2 ? e : (e + -48) | 0) + 40) >> 2] | 0),
+                                (q | 0) != (c[((((c[l >> 2] & 3) | 0) == 2 ? l : j) + 40) >> 2] | 0))
+                              : 0
+                          ) {
+                            f = (e + 16) | 0;
+                            if (!(c[((c[f >> 2] | 0) + 172) >> 2] | 0))
+                              Vk(b, c[(((p | 0) == 3 ? e : (e + 48) | 0) + 40) >> 2] | 0, q, e);
+                            if (
+                              (c[((c[k >> 2] | 0) + 96) >> 2] | 0) == 0 ? (c[((c[f >> 2] | 0) + 96) >> 2] | 0) == 0 : 0
+                            ) {
+                              if (!(uj(l, e) | 0)) break;
+                              if (!(a[194954] | 0)) {
+                                jh(l);
+                                Pk(b, l, c[((c[f >> 2] | 0) + 172) >> 2] | 0, 1);
+                                break a;
+                              } else {
+                                a[((c[k >> 2] | 0) + 112) >> 0] = 6;
+                                a[((c[f >> 2] | 0) + 153) >> 0] = 1;
+                                break a;
+                              }
+                            }
+                          }
+                        while (0);
+                        d = c[l >> 2] & 3;
+                        Vk(b, c[(((d | 0) == 2 ? l : j) + 40) >> 2] | 0, c[(((d | 0) == 3 ? l : i) + 40) >> 2] | 0, l);
+                        d = l;
+                      }
+                    } else d = l;
+                  while (0);
+                  l = ZA(b, l) | 0;
+                }
+                m = kC(b, m) | 0;
+              }
+              if ((gg(b) | 0) != (b | 0)) {
+                d = c[((c[r >> 2] | 0) + 216) >> 2] | 0;
+                if (!d) d = KK(4) | 0;
+                else d = MK(d, 4) | 0;
+                r = c[r >> 2] | 0;
+                c[(r + 216) >> 2] = d;
+                c[d >> 2] = c[(r + 192) >> 2];
+              }
+              return;
+            }
+            function Tk(b) {
+              b = b | 0;
+              var d = 0;
+              d = c[b >> 2] & 3;
+              if (
+                (a[((c[((c[(((d | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 159) >> 0] | 0) ==
+                7
+              )
+                b = 1;
+              else
+                b =
+                  ((a[((c[((c[(((d | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 159) >> 0] | 0) ==
+                    7) &
+                  1;
+              return b | 0;
+            }
+            function Uk(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              f = Yk(c[((((c[d >> 2] & 3) | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0) | 0;
+              g = Yk(c[((((c[d >> 2] & 3) | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0) | 0;
+              i = (c[((c[(f + 16) >> 2] | 0) + 232) >> 2] | 0) > (c[((c[(g + 16) >> 2] | 0) + 232) >> 2] | 0);
+              e = i ? f : g;
+              f = i ? g : f;
+              g = (f + 16) | 0;
+              i = (e + 16) | 0;
+              a: do
+                if ((c[((c[g >> 2] | 0) + 212) >> 2] | 0) != (c[((c[i >> 2] | 0) + 212) >> 2] | 0)) {
+                  h = dh(f, e) | 0;
+                  if (h | 0) {
+                    Pk(b, d, h, 1);
+                    break;
+                  }
+                  if ((c[((c[g >> 2] | 0) + 232) >> 2] | 0) != (c[((c[i >> 2] | 0) + 232) >> 2] | 0)) {
+                    Vk(b, f, e, d);
+                    e = ((c[(d + 16) >> 2] | 0) + 172) | 0;
+                    while (1) {
+                      e = c[e >> 2] | 0;
+                      if (!e) break a;
+                      f = (e + -48) | 0;
+                      if (
+                        (c[
+                          ((c[((c[((((c[e >> 2] & 3) | 0) == 2 ? e : f) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2
+                        ] |
+                          0) >
+                        (c[((c[i >> 2] | 0) + 232) >> 2] | 0)
+                      )
+                        break a;
+                      a[((c[(e + 16) >> 2] | 0) + 112) >> 0] = 5;
+                      e =
+                        c[((c[((c[((((c[e >> 2] & 3) | 0) == 2 ? e : f) + 40) >> 2] | 0) + 16) >> 2] | 0) + 180) >> 2] |
+                        0;
+                    }
+                  }
+                }
+              while (0);
+              return;
+            }
+            function Vk(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = (e + 16) | 0;
+              f = c[k >> 2] | 0;
+              if (!(c[(f + 96) >> 2] | 0)) j = -1;
+              else
+                j =
+                  ((((c[((c[(d + 16) >> 2] | 0) + 232) >> 2] | 0) + (c[((c[(b + 16) >> 2] | 0) + 232) >> 2] | 0)) | 0) /
+                    2) |
+                  0;
+              if (c[(f + 172) >> 2] | 0) qa(87636, 87615, 89, 87661);
+              i = (d + 16) | 0;
+              h = c[((c[(b + 16) >> 2] | 0) + 232) >> 2] | 0;
+              while (1) {
+                g = (h + 1) | 0;
+                f = c[((c[i >> 2] | 0) + 232) >> 2] | 0;
+                if ((h | 0) >= (f | 0)) break;
+                if ((g | 0) < (f | 0)) {
+                  if ((g | 0) == (j | 0)) f = Wk(a, e) | 0;
+                  else f = Xk(a) | 0;
+                  c[((c[(f + 16) >> 2] | 0) + 232) >> 2] = g;
+                } else f = d;
+                Ii(nh(b, f, e) | 0);
+                h = g;
+                b = f;
+              }
+              if (!(c[((c[k >> 2] | 0) + 172) >> 2] | 0)) qa(87672, 87615, 103, 87661);
+              else return;
+            }
+            function Wk(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0.0;
+              i = (d + 16) | 0;
+              g = c[((c[i >> 2] | 0) + 96) >> 2] | 0;
+              e = +h[(g + 24) >> 3];
+              f = +h[(g + 32) >> 3];
+              g = sh(b) | 0;
+              d = (g + 16) | 0;
+              c[((c[d >> 2] | 0) + 104) >> 2] = c[((c[i >> 2] | 0) + 96) >> 2];
+              j = +(c[((c[((yC(g) | 0) + 16) >> 2] | 0) + 248) >> 2] | 0);
+              h[((c[d >> 2] | 0) + 88) >> 3] = j;
+              if (!(a[((c[i >> 2] | 0) + 114) >> 0] | 0)) {
+                b = ((c[((c[((yC(b) | 0) + 16) >> 2] | 0) + 116) >> 2] & 1) | 0) == 0;
+                i = c[d >> 2] | 0;
+                h[(i + 80) >> 3] = b ? f : e;
+                h[(i + 96) >> 3] = b ? e : f;
+              }
+              return g | 0;
+            }
+            function Xk(a) {
+              a = a | 0;
+              var b = 0;
+              b = sh(a) | 0;
+              Qk(a, b);
+              return b | 0;
+            }
+            function Yk(b) {
+              b = b | 0;
+              var d = 0;
+              d = c[(b + 16) >> 2] | 0;
+              if ((a[(d + 159) >> 0] | 0) == 7)
+                b =
+                  c[
+                    ((c[((c[((c[(d + 212) >> 2] | 0) + 16) >> 2] | 0) + 268) >> 2] | 0) + (c[(d + 232) >> 2] << 2)) >> 2
+                  ] | 0;
+              else b = fP(b) | 0;
+              return b | 0;
+            }
+            function Zk(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              j = gg(a) | 0;
+              h = jC(a) | 0;
+              while (1) {
+                if (!h) break;
+                b = aB(j, h) | 0;
+                i = 0;
+                while (1) {
+                  if (!b) break;
+                  l = bB(j, b, h) | 0;
+                  if (HC(a, b) | 0) {
+                    k = i;
+                    b = l;
+                    i = k;
+                    continue;
+                  }
+                  k = ((c[b >> 2] & 3) | 0) == 2 ? b : (b + -48) | 0;
+                  m = (Rk(i, k) | 0) == 0;
+                  e = c[k >> 2] & 3;
+                  b = c[(((e | 0) == 3 ? k : (k + 48) | 0) + 40) >> 2] | 0;
+                  d = c[((c[(b + 16) >> 2] | 0) + 232) >> 2] | 0;
+                  e = c[(((e | 0) == 2 ? k : (k + -48) | 0) + 40) >> 2] | 0;
+                  f = c[((c[(e + 16) >> 2] | 0) + 232) >> 2] | 0;
+                  g = (d | 0) == (f | 0);
+                  if (!m) {
+                    c[((c[(k + 16) >> 2] | 0) + 172) >> 2] = g ? i : 0;
+                    b = c[((c[(i + 16) >> 2] | 0) + 172) >> 2] | 0;
+                    if (!b) {
+                      m = i;
+                      b = l;
+                      i = m;
+                      continue;
+                    }
+                    Pk(a, k, b, 0);
+                    kh(k);
+                    m = i;
+                    b = l;
+                    i = m;
+                    continue;
+                  }
+                  if (!g)
+                    if ((f | 0) > (d | 0)) {
+                      _k(b, e, k);
+                      b = l;
+                      i = k;
+                      continue;
+                    } else {
+                      _k(e, b, k);
+                      b = l;
+                      i = k;
+                      continue;
+                    }
+                  b = fh(b, e) | 0;
+                  if (!b) {
+                    th(j, k);
+                    b = l;
+                    i = k;
+                    continue;
+                  }
+                  if ((k | 0) == (b | 0)) {
+                    m = i;
+                    b = l;
+                    i = m;
+                    continue;
+                  }
+                  kh(k);
+                  if (c[((c[(k + 16) >> 2] | 0) + 172) >> 2] | 0) {
+                    m = i;
+                    b = l;
+                    i = m;
+                    continue;
+                  }
+                  vh(k, b);
+                  m = i;
+                  b = l;
+                  i = m;
+                }
+                h = kC(a, h) | 0;
+              }
+              return;
+            }
+            function _k(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              f = $k(a) | 0;
+              e = $k(b) | 0;
+              al(
+                f,
+                e,
+                d,
+                c[((c[(d + 16) >> 2] | 0) + 172) >> 2] | 0,
+                ((f | 0) == (a | 0)) & ((e | 0) == (b | 0)) ? 1 : 5
+              );
+              return;
+            }
+            function $k(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              d = c[(b + 16) >> 2] | 0;
+              e = c[(d + 212) >> 2] | 0;
+              if ((e | 0) != 0 ? ((f = c[(e + 16) >> 2] | 0), (a[(f + 272) >> 0] | 0) == 0) : 0)
+                b = c[((c[(f + 268) >> 2] | 0) + (c[(d + 232) >> 2] << 2)) >> 2] | 0;
+              return b | 0;
+            }
+            function al(d, e, f, g, h) {
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              n = (d + 16) | 0;
+              k = c[((c[n >> 2] | 0) + 232) >> 2] | 0;
+              o = (e + 16) | 0;
+              i = c[((c[o >> 2] | 0) + 232) >> 2] | 0;
+              if ((i | 0) <= (k | 0)) qa(87697, 87725, 81, 87735);
+              m = c[g >> 2] & 3;
+              if (
+                !((c[(((m | 0) == 3 ? g : (g + 48) | 0) + 40) >> 2] | 0) == (d | 0)
+                  ? (c[(((m | 0) == 2 ? g : (g + -48) | 0) + 40) >> 2] | 0) == (e | 0)
+                  : 0)
+              )
+                l = 5;
+              a: do
+                if ((l | 0) == 5) {
+                  if ((b[((c[(g + 16) >> 2] | 0) + 168) >> 1] | 0) > 1) {
+                    c[((c[(f + 16) >> 2] | 0) + 172) >> 2] = 0;
+                    if ((((i - k) | 0) == 1 ? ((j = dh(d, e) | 0), j | 0) : 0) ? uj(f, j) | 0 : 0) {
+                      vh(f, j);
+                      if (a[((c[n >> 2] | 0) + 156) >> 0] | 0) break;
+                      if (a[((c[o >> 2] | 0) + 156) >> 0] | 0) break;
+                      jh(f);
+                      break;
+                    }
+                    m = h & 255;
+                    h = d;
+                    l = c[((c[n >> 2] | 0) + 232) >> 2] | 0;
+                    while (1) {
+                      i = c[((c[o >> 2] | 0) + 232) >> 2] | 0;
+                      if ((l | 0) >= (i | 0)) break a;
+                      if ((l | 0) < ((i + -1) | 0)) {
+                        i = gg(d) | 0;
+                        j = (g + -48) | 0;
+                        i = bl(i, c[((((c[g >> 2] & 3) | 0) == 2 ? g : j) + 40) >> 2] | 0) | 0;
+                        k = g;
+                      } else {
+                        i = e;
+                        j = (g + -48) | 0;
+                        k = g;
+                      }
+                      a[((c[((nh(h, i, f) | 0) + 16) >> 2] | 0) + 112) >> 0] = m;
+                      n = ((c[(g + 16) >> 2] | 0) + 168) | 0;
+                      b[n >> 1] = (((b[n >> 1] | 0) + -1) << 16) >> 16;
+                      h = i;
+                      l = (l + 1) | 0;
+                      g =
+                        c[
+                          c[
+                            ((c[((c[((((c[k >> 2] & 3) | 0) == 2 ? g : j) + 40) >> 2] | 0) + 16) >> 2] | 0) + 180) >> 2
+                          ] >> 2
+                        ] | 0;
+                    }
+                  }
+                  do
+                    if (((i - k) | 0) == 1) {
+                      g = dh(d, e) | 0;
+                      if (g | 0 ? uj(f, g) | 0 : 0) {
+                        c[((c[(f + 16) >> 2] | 0) + 172) >> 2] = g;
+                        m = c[(g + 16) >> 2] | 0;
+                        a[(m + 112) >> 0] = h;
+                        m = (m + 168) | 0;
+                        b[m >> 1] = (((b[m >> 1] | 0) + 1) << 16) >> 16;
+                        if (a[((c[n >> 2] | 0) + 156) >> 0] | 0) break;
+                        if (a[((c[o >> 2] | 0) + 156) >> 0] | 0) break;
+                        jh(f);
+                        break;
+                      }
+                      c[((c[(f + 16) >> 2] | 0) + 172) >> 2] = 0;
+                      g = nh(d, e, f) | 0;
+                      a[((c[(g + 16) >> 2] | 0) + 112) >> 0] = h;
+                    }
+                  while (0);
+                  i = c[((c[o >> 2] | 0) + 232) >> 2] | 0;
+                  if (((i - (c[((c[n >> 2] | 0) + 232) >> 2] | 0)) | 0) > 1) {
+                    if ((c[((((c[g >> 2] & 3) | 0) == 3 ? g : (g + 48) | 0) + 40) >> 2] | 0) == (d | 0)) l = i;
+                    else {
+                      n = (f + 16) | 0;
+                      c[((c[n >> 2] | 0) + 172) >> 2] = 0;
+                      l = nh(d, c[((((c[g >> 2] & 3) | 0) == 2 ? g : (g + -48) | 0) + 40) >> 2] | 0, f) | 0;
+                      c[((c[n >> 2] | 0) + 172) >> 2] = l;
+                      ih(g);
+                      g = l;
+                      l = c[((c[o >> 2] | 0) + 232) >> 2] | 0;
+                    }
+                    while (1) {
+                      i = c[g >> 2] & 3;
+                      j = c[(((i | 0) == 2 ? g : (g + -48) | 0) + 40) >> 2] | 0;
+                      k = c[(j + 16) >> 2] | 0;
+                      if ((c[(k + 232) >> 2] | 0) == (l | 0)) break;
+                      g = c[c[(k + 180) >> 2] >> 2] | 0;
+                    }
+                    if ((j | 0) != (e | 0)) {
+                      a[
+                        ((c[((nh(c[(((i | 0) == 3 ? g : (g + 48) | 0) + 40) >> 2] | 0, e, f) | 0) + 16) >> 2] | 0) +
+                          112) >>
+                          0
+                      ] = h;
+                      ih(g);
+                    }
+                  }
+                }
+              while (0);
+              return;
+            }
+            function bl(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              d = (b + 16) | 0;
+              b = c[d >> 2] | 0;
+              e = c[(b + 232) >> 2] | 0;
+              cl(a, e, c[(b + 236) >> 2] | 0, 2);
+              b = sh(a) | 0;
+              d = c[d >> 2] | 0;
+              f = c[(b + 16) >> 2] | 0;
+              h[(f + 88) >> 3] = +h[(d + 88) >> 3];
+              h[(f + 96) >> 3] = +h[(d + 96) >> 3];
+              c[(f + 232) >> 2] = c[(d + 232) >> 2];
+              d = ((c[(d + 236) >> 2] | 0) + 1) | 0;
+              c[(f + 236) >> 2] = d;
+              c[((c[((c[((c[(a + 16) >> 2] | 0) + 196) >> 2] | 0) + (e << 6) + 4) >> 2] | 0) + (d << 2)) >> 2] = b;
+              return b | 0;
+            }
+            function cl(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              h = (a + 16) | 0;
+              f = c[((c[h >> 2] | 0) + 196) >> 2] | 0;
+              i = c[(f + (b << 6) + 4) >> 2] | 0;
+              a: do
+                if ((e | 0) < 1) {
+                  d = (d - e) | 0;
+                  while (1) {
+                    g = (d + 1) | 0;
+                    a = c[(f + (b << 6)) >> 2] | 0;
+                    if ((g | 0) >= (a | 0)) break;
+                    a = c[(i + (g << 2)) >> 2] | 0;
+                    f = (d + e) | 0;
+                    c[((c[(a + 16) >> 2] | 0) + 236) >> 2] = f;
+                    c[(i + (f << 2)) >> 2] = a;
+                    d = g;
+                    f = c[((c[h >> 2] | 0) + 196) >> 2] | 0;
+                  }
+                  g = (e + -1) | 0;
+                  d = (g + a) | 0;
+                  while (1) {
+                    if ((d | 0) >= (a | 0)) break a;
+                    c[(i + (d << 2)) >> 2] = 0;
+                    f = c[((c[h >> 2] | 0) + 196) >> 2] | 0;
+                    d = (d + 1) | 0;
+                    a = c[(f + (b << 6)) >> 2] | 0;
+                  }
+                } else {
+                  g = (e + -1) | 0;
+                  a = c[(f + (b << 6)) >> 2] | 0;
+                  while (1) {
+                    a = (a + -1) | 0;
+                    if ((a | 0) <= (d | 0)) break;
+                    j = c[(i + (a << 2)) >> 2] | 0;
+                    f = (g + a) | 0;
+                    c[((c[(j + 16) >> 2] | 0) + 236) >> 2] = f;
+                    c[(i + (f << 2)) >> 2] = j;
+                  }
+                  f = (e + d) | 0;
+                  a = d;
+                  while (1) {
+                    a = (a + 1) | 0;
+                    if ((a | 0) >= (f | 0)) break;
+                    c[(i + (a << 2)) >> 2] = 0;
+                  }
+                  a = c[((c[h >> 2] | 0) + 196) >> 2] | 0;
+                  f = a;
+                  a = c[(a + (b << 6)) >> 2] | 0;
+                }
+              while (0);
+              c[(f + (b << 6)) >> 2] = g + a;
+              return;
+            }
+            function dl(a) {
+              a = a | 0;
+              var b = 0;
+              Sk(a);
+              b = c[(a + 16) >> 2] | 0;
+              c[(b + 220) >> 2] = 1;
+              c[c[(b + 216) >> 2] >> 2] = c[(b + 192) >> 2];
+              Fi(a);
+              ki(a, 0);
+              el(a);
+              Zk(a);
+              fl(a);
+              return;
+            }
+            function el(d) {
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              k = gg(d) | 0;
+              l = (d + 16) | 0;
+              f = c[l >> 2] | 0;
+              j = b[(f + 236) >> 1] | 0;
+              e = (j << 16) >> 16;
+              m = (k + 16) | 0;
+              if ((j << 16) >> 16 > 0) a[((c[((c[m >> 2] | 0) + 196) >> 2] | 0) + ((e + -1) << 6) + 49) >> 0] = 0;
+              j = e;
+              while (1) {
+                if ((j | 0) > (b[(f + 238) >> 1] | 0)) break;
+                i = c[((c[((c[((c[(f + 268) >> 2] | 0) + (j << 2)) >> 2] | 0) + 16) >> 2] | 0) + 236) >> 2] | 0;
+                cl(k, j, i, c[((c[(f + 196) >> 2] | 0) + (j << 6)) >> 2] | 0);
+                g = 0;
+                h = i;
+                while (1) {
+                  f = c[l >> 2] | 0;
+                  e = c[(f + 196) >> 2] | 0;
+                  if ((g | 0) >= (c[(e + (j << 6)) >> 2] | 0)) break;
+                  e = c[((c[(e + (j << 6) + 4) >> 2] | 0) + (g << 2)) >> 2] | 0;
+                  c[((c[((c[((c[m >> 2] | 0) + 196) >> 2] | 0) + (j << 6) + 4) >> 2] | 0) + (h << 2)) >> 2] = e;
+                  f = c[(e + 16) >> 2] | 0;
+                  c[(f + 236) >> 2] = h;
+                  if ((a[(f + 156) >> 0] | 0) == 1) c[(e + 24) >> 2] = yC(k) | 0;
+                  qh(d, e);
+                  oh(k, e);
+                  f = ((c[m >> 2] | 0) + 232) | 0;
+                  c[f >> 2] = (c[f >> 2] | 0) + 1;
+                  g = (g + 1) | 0;
+                  h = (h + 1) | 0;
+                }
+                h = c[((c[m >> 2] | 0) + 196) >> 2] | 0;
+                c[(e + (j << 6) + 4) >> 2] = (c[(h + (j << 6) + 4) >> 2] | 0) + (i << 2);
+                a[(h + (j << 6) + 49) >> 0] = 0;
+                j = (j + 1) | 0;
+              }
+              e = c[m >> 2] | 0;
+              if ((j | 0) < (b[(e + 238) >> 1] | 0)) a[((c[(e + 196) >> 2] | 0) + (j << 6) + 49) >> 0] = 0;
+              a[(f + 272) >> 0] = 1;
+              return;
+            }
+            function fl(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = (a + 16) | 0;
+              d = c[i >> 2] | 0;
+              h = b[(d + 236) >> 1] | 0;
+              while (1) {
+                if ((h | 0) > (b[(d + 238) >> 1] | 0)) break;
+                f = c[((c[(d + 268) >> 2] | 0) + (h << 2)) >> 2] | 0;
+                g = (f + 16) | 0;
+                while (1) {
+                  d = c[g >> 2] | 0;
+                  e = c[c[(d + 180) >> 2] >> 2] | 0;
+                  if (!e) break;
+                  ih(e);
+                }
+                while (1) {
+                  d = c[c[(d + 172) >> 2] >> 2] | 0;
+                  if (!d) break;
+                  ih(d);
+                  d = c[g >> 2] | 0;
+                }
+                qh(gg(a) | 0, f);
+                c[((c[((c[i >> 2] | 0) + 268) >> 2] | 0) + (h << 2)) >> 2] = 0;
+                h = (h + 1) | 0;
+                d = c[i >> 2] | 0;
+              }
+              return;
+            }
+            function gl(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              o = l;
+              l = (l + 16) | 0;
+              n = o;
+              f = jC(b) | 0;
+              while (1) {
+                if (!f) break;
+                e = (f + 16) | 0;
+                d = c[e >> 2] | 0;
+                if ((a[(d + 159) >> 0] | 0) == 7) {
+                  hP(f);
+                  d = c[e >> 2] | 0;
+                }
+                c[(d + 212) >> 2] = 0;
+                f = kC(b, f) | 0;
+              }
+              m = (b + 16) | 0;
+              k = 1;
+              while (1) {
+                d = c[m >> 2] | 0;
+                if ((k | 0) > (c[(d + 180) >> 2] | 0)) break;
+                h = c[((c[(d + 184) >> 2] | 0) + (k << 2)) >> 2] | 0;
+                i = (h + 16) | 0;
+                d = jC(h) | 0;
+                a: while (1) {
+                  if (!d) break;
+                  j = kC(h, d) | 0;
+                  e = (d + 16) | 0;
+                  if (a[((c[e >> 2] | 0) + 159) >> 0] | 0) {
+                    f = KB(d) | 0;
+                    g = KB(b) | 0;
+                    c[n >> 2] = f;
+                    c[(n + 4) >> 2] = g;
+                    gA(0, 87744, n) | 0;
+                    wC(h, d) | 0;
+                    d = j;
+                    continue;
+                  }
+                  iP(d, c[((c[i >> 2] | 0) + 264) >> 2] | 0);
+                  g = c[e >> 2] | 0;
+                  c[(g + 212) >> 2] = h;
+                  a[(g + 159) >> 0] = 7;
+                  g = XA(h, d) | 0;
+                  while (1) {
+                    if (!g) {
+                      d = j;
+                      continue a;
+                    }
+                    d = c[((c[(g + 16) >> 2] | 0) + 172) >> 2] | 0;
+                    b: do
+                      if (d | 0)
+                        do {
+                          e = (d + -48) | 0;
+                          f = c[((c[((((c[d >> 2] & 3) | 0) == 2 ? d : e) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                          if ((a[(f + 156) >> 0] | 0) != 1) break b;
+                          c[(f + 212) >> 2] = h;
+                          d =
+                            c[
+                              c[
+                                ((c[((c[((((c[d >> 2] & 3) | 0) == 2 ? d : e) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                                  180) >>
+                                  2
+                              ] >> 2
+                            ] | 0;
+                        } while ((d | 0) != 0);
+                    while (0);
+                    g = ZA(h, g) | 0;
+                  }
+                }
+                k = (k + 1) | 0;
+              }
+              l = o;
+              return;
+            }
+            function hl(d, e) {
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = (e + 16) | 0;
+              g = JK(((b[((c[k >> 2] | 0) + 238) >> 1] << 2) + 8) | 0) | 0;
+              f = c[k >> 2] | 0;
+              c[(f + 268) >> 2] = g;
+              g = 0;
+              h = b[(f + 236) >> 1] | 0;
+              while (1) {
+                if ((h | 0) > (b[(f + 238) >> 1] | 0)) break;
+                f = sh(d) | 0;
+                c[((c[((c[k >> 2] | 0) + 268) >> 2] | 0) + (h << 2)) >> 2] = f;
+                j = c[(f + 16) >> 2] | 0;
+                c[(j + 232) >> 2] = h;
+                a[(j + 159) >> 0] = 7;
+                c[(j + 212) >> 2] = e;
+                if (g | 0) {
+                  j = ((c[((nh(g, f, 0) | 0) + 16) >> 2] | 0) + 154) | 0;
+                  b[j >> 1] = (b[j >> 1] | 0) * 1e3;
+                }
+                g = f;
+                h = (h + 1) | 0;
+                f = c[k >> 2] | 0;
+              }
+              j = jC(e) | 0;
+              while (1) {
+                f = c[k >> 2] | 0;
+                if (!j) break;
+                h = ((c[((c[(f + 268) >> 2] | 0) + (c[((c[(j + 16) >> 2] | 0) + 232) >> 2] << 2)) >> 2] | 0) + 16) | 0;
+                f = ((c[h >> 2] | 0) + 216) | 0;
+                c[f >> 2] = (c[f >> 2] | 0) + 1;
+                f = XA(e, j) | 0;
+                while (1) {
+                  if (!f) break;
+                  i = c[f >> 2] | 0;
+                  d = (f + -48) | 0;
+                  g =
+                    c[((c[((c[((((i & 3) | 0) == 3 ? f : (f + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] |
+                    0;
+                  while (1) {
+                    if (
+                      (g | 0) >=
+                      (c[((c[((c[((((i & 3) | 0) == 2 ? f : d) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0)
+                    )
+                      break;
+                    i = ((c[((c[c[((c[h >> 2] | 0) + 180) >> 2] >> 2] | 0) + 16) >> 2] | 0) + 168) | 0;
+                    b[i >> 1] = (((b[i >> 1] | 0) + 1) << 16) >> 16;
+                    g = (g + 1) | 0;
+                    i = c[f >> 2] | 0;
+                  }
+                  f = ZA(e, f) | 0;
+                }
+                j = kC(e, j) | 0;
+              }
+              d = b[(f + 238) >> 1] | 0;
+              i = (f + 268) | 0;
+              f = b[(f + 236) >> 1] | 0;
+              while (1) {
+                if ((f | 0) > (d | 0)) break;
+                g = ((c[((c[((c[i >> 2] | 0) + (f << 2)) >> 2] | 0) + 16) >> 2] | 0) + 216) | 0;
+                h = c[g >> 2] | 0;
+                if ((h | 0) > 1) c[g >> 2] = h + -1;
+                f = (f + 1) | 0;
+              }
+              return;
+            }
+            function il(d, e, f, g) {
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = ((c[((c[(e + 16) >> 2] | 0) + 212) >> 2] | 0) + 16) | 0;
+              e = c[k >> 2] | 0;
+              j = (f + 1) | 0;
+              if ((j | 0) != (a[(e + 273) >> 0] | 0)) {
+                i = b[(e + 236) >> 1] | 0;
+                while (1) {
+                  h = b[(e + 238) >> 1] | 0;
+                  if ((i | 0) > (((h << 16) >> 16) | 0)) break;
+                  zi(d, c[((c[(e + 268) >> 2] | 0) + (i << 2)) >> 2] | 0);
+                  i = (i + 1) | 0;
+                  e = c[k >> 2] | 0;
+                }
+                i = b[(e + 236) >> 1] | 0;
+                while (1) {
+                  if ((i | 0) > (((h << 16) >> 16) | 0)) break;
+                  Ai(g, c[((c[(e + 268) >> 2] | 0) + (i << 2)) >> 2] | 0, f);
+                  d = c[k >> 2] | 0;
+                  i = (i + 1) | 0;
+                  h = b[(d + 238) >> 1] | 0;
+                  e = d;
+                }
+                a[(e + 273) >> 0] = j;
+              }
+              return;
+            }
+            function jl(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = jC(b) | 0;
+              while (1) {
+                if (!h) break;
+                c[((c[(h + 16) >> 2] | 0) + 212) >> 2] = 0;
+                g = XA(b, h) | 0;
+                while (1) {
+                  if (!g) break;
+                  d = c[((c[(g + 16) >> 2] | 0) + 172) >> 2] | 0;
+                  a: do
+                    if (d | 0)
+                      do {
+                        e = (d + -48) | 0;
+                        f = c[((c[((((c[d >> 2] & 3) | 0) == 2 ? d : e) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                        if ((a[(f + 156) >> 0] | 0) != 1) break a;
+                        c[(f + 212) >> 2] = 0;
+                        d =
+                          c[
+                            c[
+                              ((c[((c[((((c[d >> 2] & 3) | 0) == 2 ? d : e) + 40) >> 2] | 0) + 16) >> 2] | 0) + 180) >>
+                                2
+                            ] >> 2
+                          ] | 0;
+                      } while ((d | 0) != 0);
+                  while (0);
+                  g = ZA(b, g) | 0;
+                }
+                h = kC(b, h) | 0;
+              }
+              kl(b);
+              return;
+            }
+            function kl(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              e = (b + 16) | 0;
+              d = 1;
+              while (1) {
+                f = c[e >> 2] | 0;
+                if ((d | 0) > (c[(f + 180) >> 2] | 0)) break;
+                kl(c[((c[(f + 184) >> 2] | 0) + (d << 2)) >> 2] | 0);
+                d = (d + 1) | 0;
+              }
+              i = jC(b) | 0;
+              while (1) {
+                if (!i) break;
+                d = ((c[(i + 16) >> 2] | 0) + 212) | 0;
+                if (!(c[d >> 2] | 0)) c[d >> 2] = b;
+                h = XA(b, i) | 0;
+                while (1) {
+                  if (!h) break;
+                  d = c[((c[(h + 16) >> 2] | 0) + 172) >> 2] | 0;
+                  a: do
+                    if (d | 0)
+                      do {
+                        e = c[d >> 2] | 0;
+                        g = (d + -48) | 0;
+                        f = c[((c[((((e & 3) | 0) == 2 ? d : g) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                        if ((a[(f + 156) >> 0] | 0) != 1) break a;
+                        f = (f + 212) | 0;
+                        if (!(c[f >> 2] | 0)) {
+                          c[f >> 2] = b;
+                          e = c[d >> 2] | 0;
+                        }
+                        d =
+                          c[
+                            c[((c[((c[((((e & 3) | 0) == 2 ? d : g) + 40) >> 2] | 0) + 16) >> 2] | 0) + 180) >> 2] >> 2
+                          ] | 0;
+                      } while ((d | 0) != 0);
+                  while (0);
+                  h = ZA(b, h) | 0;
+                }
+                i = kC(b, i) | 0;
+              }
+              return;
+            }
+            function ll(a) {
+              a = a | 0;
+              var b = 0,
+                c = 0,
+                d = 0;
+              d = IP(a) | 0;
+              c = jC(a) | 0;
+              while (1) {
+                if (!c) break;
+                b = XA(a, c) | 0;
+                while (1) {
+                  if (!b) break;
+                  ml(b, d);
+                  b = ZA(a, b) | 0;
+                }
+                c = kC(a, c) | 0;
+              }
+              Rz(d) | 0;
+              return;
+            }
+            function ml(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0;
+              M = l;
+              l = (l + 320) | 0;
+              H = (M + 296) | 0;
+              G = (M + 280) | 0;
+              x = (M + 136) | 0;
+              w = (M + 120) | 0;
+              n = (M + 104) | 0;
+              i = (M + 88) | 0;
+              f = (M + 80) | 0;
+              E = (M + 16) | 0;
+              z = M;
+              j = (M + 264) | 0;
+              k = (M + 248) | 0;
+              m = (M + 232) | 0;
+              o = (M + 216) | 0;
+              A = (M + 200) | 0;
+              B = (M + 184) | 0;
+              y = (M + 168) | 0;
+              D = (M + 152) | 0;
+              g = nl(QA(a, 87798) | 0, b) | 0;
+              q = nl(QA(a, 87804) | 0, b) | 0;
+              r = (q | 0) != 0;
+              b = (g | 0) != 0;
+              do
+                if (b | r ? ((L = (a + 16) | 0), (e = c[((c[L >> 2] | 0) + 8) >> 2] | 0), e | 0) : 0) {
+                  if ((c[(e + 4) >> 2] | 0) > 1) {
+                    K = KB(c[((((c[a >> 2] & 3) | 0) == 3 ? a : (a + 48) | 0) + 40) >> 2] | 0) | 0;
+                    L = KB(c[((((c[a >> 2] & 3) | 0) == 2 ? a : (a + -48) | 0) + 40) >> 2] | 0) | 0;
+                    c[f >> 2] = K;
+                    c[(f + 4) >> 2] = L;
+                    gA(0, 87810, f) | 0;
+                    break;
+                  }
+                  I = c[e >> 2] | 0;
+                  e = c[(I + 4) >> 2] | 0;
+                  p = c[a >> 2] & 3;
+                  s = (a + -48) | 0;
+                  t = c[(((p | 0) == 2 ? a : s) + 40) >> 2] | 0;
+                  u = (a + 48) | 0;
+                  p = c[(((p | 0) == 3 ? a : u) + 40) >> 2] | 0;
+                  J = KK(48) | 0;
+                  v = (I + 12) | 0;
+                  c[(J + 12) >> 2] = c[v >> 2];
+                  C = (I + 8) | 0;
+                  c[(J + 8) >> 2] = c[C >> 2];
+                  do
+                    if (b) {
+                      h = ((c[(g + 16) >> 2] | 0) + 16) | 0;
+                      g = ((c[(t + 16) >> 2] | 0) + 16) | 0;
+                      c[H >> 2] = c[g >> 2];
+                      c[(H + 4) >> 2] = c[(g + 4) >> 2];
+                      c[(H + 8) >> 2] = c[(g + 8) >> 2];
+                      c[(H + 12) >> 2] = c[(g + 12) >> 2];
+                      if (!(ol(H, h) | 0)) {
+                        o = KB(c[((((c[a >> 2] & 3) | 0) == 3 ? a : u) + 40) >> 2] | 0) | 0;
+                        F = KB(c[((((c[a >> 2] & 3) | 0) == 2 ? a : s) + 40) >> 2] | 0) | 0;
+                        K = QA(a, 87798) | 0;
+                        c[i >> 2] = o;
+                        c[(i + 4) >> 2] = F;
+                        c[(i + 8) >> 2] = K;
+                        gA(0, 87851, i) | 0;
+                        K = 26;
+                        break;
+                      }
+                      b = c[I >> 2] | 0;
+                      c[H >> 2] = c[b >> 2];
+                      c[(H + 4) >> 2] = c[(b + 4) >> 2];
+                      c[(H + 8) >> 2] = c[(b + 8) >> 2];
+                      c[(H + 12) >> 2] = c[(b + 12) >> 2];
+                      if (ol(H, h) | 0) {
+                        F = ((c[(p + 16) >> 2] | 0) + 16) | 0;
+                        c[H >> 2] = c[F >> 2];
+                        c[(H + 4) >> 2] = c[(F + 4) >> 2];
+                        c[(H + 8) >> 2] = c[(F + 8) >> 2];
+                        c[(H + 12) >> 2] = c[(F + 12) >> 2];
+                        if (ol(H, h) | 0) {
+                          o = KB(c[((((c[a >> 2] & 3) | 0) == 3 ? a : u) + 40) >> 2] | 0) | 0;
+                          F = KB(c[((((c[a >> 2] & 3) | 0) == 2 ? a : s) + 40) >> 2] | 0) | 0;
+                          K = QA(a, 87798) | 0;
+                          c[n >> 2] = o;
+                          c[(n + 4) >> 2] = F;
+                          c[(n + 8) >> 2] = K;
+                          gA(0, 87894, n) | 0;
+                          K = 26;
+                          break;
+                        }
+                        if (!(c[C >> 2] | 0)) qa(87936, 87947, 369, 87958);
+                        o = (I + 16) | 0;
+                        c[G >> 2] = c[b >> 2];
+                        c[(G + 4) >> 2] = c[(b + 4) >> 2];
+                        c[(G + 8) >> 2] = c[(b + 8) >> 2];
+                        c[(G + 12) >> 2] = c[(b + 12) >> 2];
+                        c[H >> 2] = c[o >> 2];
+                        c[(H + 4) >> 2] = c[(o + 4) >> 2];
+                        c[(H + 8) >> 2] = c[(o + 8) >> 2];
+                        c[(H + 12) >> 2] = c[(o + 12) >> 2];
+                        pl(z, G, H, h);
+                        F = ((c[I >> 2] | 0) + 48) | 0;
+                        c[F >> 2] = c[z >> 2];
+                        c[(F + 4) >> 2] = c[(z + 4) >> 2];
+                        c[(F + 8) >> 2] = c[(z + 8) >> 2];
+                        c[(F + 12) >> 2] = c[(z + 12) >> 2];
+                        F = ((c[I >> 2] | 0) + 16) | 0;
+                        c[G >> 2] = c[z >> 2];
+                        c[(G + 4) >> 2] = c[(z + 4) >> 2];
+                        c[(G + 8) >> 2] = c[(z + 8) >> 2];
+                        c[(G + 12) >> 2] = c[(z + 12) >> 2];
+                        c[H >> 2] = c[o >> 2];
+                        c[(H + 4) >> 2] = c[(o + 4) >> 2];
+                        c[(H + 8) >> 2] = c[(o + 8) >> 2];
+                        c[(H + 12) >> 2] = c[(o + 12) >> 2];
+                        ql(j, G, H);
+                        c[F >> 2] = c[j >> 2];
+                        c[(F + 4) >> 2] = c[(j + 4) >> 2];
+                        c[(F + 8) >> 2] = c[(j + 8) >> 2];
+                        c[(F + 12) >> 2] = c[(j + 12) >> 2];
+                        F = c[I >> 2] | 0;
+                        b = (F + 16) | 0;
+                        c[G >> 2] = c[b >> 2];
+                        c[(G + 4) >> 2] = c[(b + 4) >> 2];
+                        c[(G + 8) >> 2] = c[(b + 8) >> 2];
+                        c[(G + 12) >> 2] = c[(b + 12) >> 2];
+                        c[H >> 2] = c[o >> 2];
+                        c[(H + 4) >> 2] = c[(o + 4) >> 2];
+                        c[(H + 8) >> 2] = c[(o + 8) >> 2];
+                        c[(H + 12) >> 2] = c[(o + 12) >> 2];
+                        ql(k, G, H);
+                        c[F >> 2] = c[k >> 2];
+                        c[(F + 4) >> 2] = c[(k + 4) >> 2];
+                        c[(F + 8) >> 2] = c[(k + 8) >> 2];
+                        c[(F + 12) >> 2] = c[(k + 12) >> 2];
+                        F = c[I >> 2] | 0;
+                        b = (F + 32) | 0;
+                        F = (F + 16) | 0;
+                        c[G >> 2] = c[F >> 2];
+                        c[(G + 4) >> 2] = c[(F + 4) >> 2];
+                        c[(G + 8) >> 2] = c[(F + 8) >> 2];
+                        c[(G + 12) >> 2] = c[(F + 12) >> 2];
+                        c[H >> 2] = c[z >> 2];
+                        c[(H + 4) >> 2] = c[(z + 4) >> 2];
+                        c[(H + 8) >> 2] = c[(z + 8) >> 2];
+                        c[(H + 12) >> 2] = c[(z + 12) >> 2];
+                        ql(m, G, H);
+                        c[b >> 2] = c[m >> 2];
+                        c[(b + 4) >> 2] = c[(m + 4) >> 2];
+                        c[(b + 8) >> 2] = c[(m + 8) >> 2];
+                        c[(b + 12) >> 2] = c[(m + 12) >> 2];
+                        b = c[v >> 2] | 0;
+                        if (!b) {
+                          F = 3;
+                          break;
+                        }
+                        F = ((UH(a, c[I >> 2] | 0, 0, 0, J, b) | 0) + 3) | 0;
+                        break;
+                      }
+                      g = (e + -1) | 0;
+                      b = 0;
+                      while (1) {
+                        if ((b | 0) >= (g | 0)) break;
+                        if (rl(((c[I >> 2] | 0) + (b << 4)) | 0, h) | 0) break;
+                        b = (b + 3) | 0;
+                      }
+                      e = c[v >> 2] | 0;
+                      f = (e | 0) != 0;
+                      if ((b | 0) == (g | 0))
+                        if (f) {
+                          F = (J + 32) | 0;
+                          m = (I + 32) | 0;
+                          n = ((c[I >> 2] | 0) + (g << 4)) | 0;
+                          c[G >> 2] = c[m >> 2];
+                          c[(G + 4) >> 2] = c[(m + 4) >> 2];
+                          c[(G + 8) >> 2] = c[(m + 8) >> 2];
+                          c[(G + 12) >> 2] = c[(m + 12) >> 2];
+                          c[H >> 2] = c[n >> 2];
+                          c[(H + 4) >> 2] = c[(n + 4) >> 2];
+                          c[(H + 8) >> 2] = c[(n + 8) >> 2];
+                          c[(H + 12) >> 2] = c[(n + 12) >> 2];
+                          pl(o, G, H, h);
+                          c[F >> 2] = c[o >> 2];
+                          c[(F + 4) >> 2] = c[(o + 4) >> 2];
+                          c[(F + 8) >> 2] = c[(o + 8) >> 2];
+                          c[(F + 12) >> 2] = c[(o + 12) >> 2];
+                          F = g;
+                          break;
+                        } else qa(87975, 87947, 387, 87958);
+                      else {
+                        if (f) b = UH(a, c[I >> 2] | 0, 0, b, J, e) | 0;
+                        F = (b + 3) | 0;
+                        break;
+                      }
+                    } else K = 26;
+                  while (0);
+                  if ((K | 0) == 26) {
+                    b = (e + -1) | 0;
+                    if (!(c[v >> 2] | 0)) F = b;
+                    else {
+                      F = (J + 32) | 0;
+                      o = (I + 32) | 0;
+                      c[F >> 2] = c[o >> 2];
+                      c[(F + 4) >> 2] = c[(o + 4) >> 2];
+                      c[(F + 8) >> 2] = c[(o + 8) >> 2];
+                      c[(F + 12) >> 2] = c[(o + 12) >> 2];
+                      F = b;
+                    }
+                  }
+                  do
+                    if (r) {
+                      f = ((c[(q + 16) >> 2] | 0) + 16) | 0;
+                      r = ((c[(p + 16) >> 2] | 0) + 16) | 0;
+                      c[H >> 2] = c[r >> 2];
+                      c[(H + 4) >> 2] = c[(r + 4) >> 2];
+                      c[(H + 8) >> 2] = c[(r + 8) >> 2];
+                      c[(H + 12) >> 2] = c[(r + 12) >> 2];
+                      if (!(ol(H, f) | 0)) {
+                        G = KB(c[((((c[a >> 2] & 3) | 0) == 3 ? a : u) + 40) >> 2] | 0) | 0;
+                        H = KB(c[((((c[a >> 2] & 3) | 0) == 2 ? a : s) + 40) >> 2] | 0) | 0;
+                        K = QA(a, 87804) | 0;
+                        c[w >> 2] = G;
+                        c[(w + 4) >> 2] = H;
+                        c[(w + 8) >> 2] = K;
+                        gA(0, 87986, w) | 0;
+                        K = 52;
+                        break;
+                      }
+                      b = ((c[I >> 2] | 0) + (F << 4)) | 0;
+                      c[H >> 2] = c[b >> 2];
+                      c[(H + 4) >> 2] = c[(b + 4) >> 2];
+                      c[(H + 8) >> 2] = c[(b + 8) >> 2];
+                      c[(H + 12) >> 2] = c[(b + 12) >> 2];
+                      if (ol(H, f) | 0) {
+                        E = ((c[(t + 16) >> 2] | 0) + 16) | 0;
+                        c[H >> 2] = c[E >> 2];
+                        c[(H + 4) >> 2] = c[(E + 4) >> 2];
+                        c[(H + 8) >> 2] = c[(E + 8) >> 2];
+                        c[(H + 12) >> 2] = c[(E + 12) >> 2];
+                        if (ol(H, f) | 0) {
+                          G = KB(c[((((c[a >> 2] & 3) | 0) == 3 ? a : u) + 40) >> 2] | 0) | 0;
+                          H = KB(c[((((c[a >> 2] & 3) | 0) == 2 ? a : s) + 40) >> 2] | 0) | 0;
+                          K = QA(a, 87804) | 0;
+                          c[x >> 2] = G;
+                          c[(x + 4) >> 2] = H;
+                          c[(x + 8) >> 2] = K;
+                          gA(0, 88029, x) | 0;
+                          K = 52;
+                          break;
+                        }
+                        if (!(c[v >> 2] | 0)) qa(87975, 87947, 429, 87958);
+                        x = (J + 32) | 0;
+                        c[G >> 2] = c[b >> 2];
+                        c[(G + 4) >> 2] = c[(b + 4) >> 2];
+                        c[(G + 8) >> 2] = c[(b + 8) >> 2];
+                        c[(G + 12) >> 2] = c[(b + 12) >> 2];
+                        c[H >> 2] = c[x >> 2];
+                        c[(H + 4) >> 2] = c[(x + 4) >> 2];
+                        c[(H + 8) >> 2] = c[(x + 8) >> 2];
+                        c[(H + 12) >> 2] = c[(x + 12) >> 2];
+                        pl(z, G, H, f);
+                        d = (F + -3) | 0;
+                        E = ((c[I >> 2] | 0) + (d << 4)) | 0;
+                        c[E >> 2] = c[z >> 2];
+                        c[(E + 4) >> 2] = c[(z + 4) >> 2];
+                        c[(E + 8) >> 2] = c[(z + 8) >> 2];
+                        c[(E + 12) >> 2] = c[(z + 12) >> 2];
+                        E = (F + -1) | 0;
+                        b = ((c[I >> 2] | 0) + (E << 4)) | 0;
+                        c[G >> 2] = c[z >> 2];
+                        c[(G + 4) >> 2] = c[(z + 4) >> 2];
+                        c[(G + 8) >> 2] = c[(z + 8) >> 2];
+                        c[(G + 12) >> 2] = c[(z + 12) >> 2];
+                        c[H >> 2] = c[x >> 2];
+                        c[(H + 4) >> 2] = c[(x + 4) >> 2];
+                        c[(H + 8) >> 2] = c[(x + 8) >> 2];
+                        c[(H + 12) >> 2] = c[(x + 12) >> 2];
+                        ql(A, G, H);
+                        c[b >> 2] = c[A >> 2];
+                        c[(b + 4) >> 2] = c[(A + 4) >> 2];
+                        c[(b + 8) >> 2] = c[(A + 8) >> 2];
+                        c[(b + 12) >> 2] = c[(A + 12) >> 2];
+                        b = c[I >> 2] | 0;
+                        D = (b + (F << 4)) | 0;
+                        b = (b + (E << 4)) | 0;
+                        c[G >> 2] = c[b >> 2];
+                        c[(G + 4) >> 2] = c[(b + 4) >> 2];
+                        c[(G + 8) >> 2] = c[(b + 8) >> 2];
+                        c[(G + 12) >> 2] = c[(b + 12) >> 2];
+                        c[H >> 2] = c[x >> 2];
+                        c[(H + 4) >> 2] = c[(x + 4) >> 2];
+                        c[(H + 8) >> 2] = c[(x + 8) >> 2];
+                        c[(H + 12) >> 2] = c[(x + 12) >> 2];
+                        ql(B, G, H);
+                        c[D >> 2] = c[B >> 2];
+                        c[(D + 4) >> 2] = c[(B + 4) >> 2];
+                        c[(D + 8) >> 2] = c[(B + 8) >> 2];
+                        c[(D + 12) >> 2] = c[(B + 12) >> 2];
+                        D = c[I >> 2] | 0;
+                        b = (D + ((F + -2) << 4)) | 0;
+                        E = (D + (E << 4)) | 0;
+                        c[G >> 2] = c[E >> 2];
+                        c[(G + 4) >> 2] = c[(E + 4) >> 2];
+                        c[(G + 8) >> 2] = c[(E + 8) >> 2];
+                        c[(G + 12) >> 2] = c[(E + 12) >> 2];
+                        c[H >> 2] = c[z >> 2];
+                        c[(H + 4) >> 2] = c[(z + 4) >> 2];
+                        c[(H + 8) >> 2] = c[(z + 8) >> 2];
+                        c[(H + 12) >> 2] = c[(z + 12) >> 2];
+                        ql(y, G, H);
+                        c[b >> 2] = c[y >> 2];
+                        c[(b + 4) >> 2] = c[(y + 4) >> 2];
+                        c[(b + 8) >> 2] = c[(y + 8) >> 2];
+                        c[(b + 12) >> 2] = c[(y + 12) >> 2];
+                        b = c[C >> 2] | 0;
+                        if (!b) break;
+                        d = WH(a, c[I >> 2] | 0, d, d, J, b) | 0;
+                        break;
+                      }
+                      e = F;
+                      while (1) {
+                        if ((e | 0) > 0) b = 0;
+                        else break;
+                        while (1) {
+                          if ((b | 0) == 4) break;
+                          B = (E + (b << 4)) | 0;
+                          A = ((c[I >> 2] | 0) + ((e - b) << 4)) | 0;
+                          c[B >> 2] = c[A >> 2];
+                          c[(B + 4) >> 2] = c[(A + 4) >> 2];
+                          c[(B + 8) >> 2] = c[(A + 8) >> 2];
+                          c[(B + 12) >> 2] = c[(A + 12) >> 2];
+                          b = (b + 1) | 0;
+                        }
+                        if (rl(E, f) | 0) {
+                          b = 0;
+                          K = 43;
+                          break;
+                        }
+                        e = (e + -3) | 0;
+                      }
+                      a: do
+                        if ((K | 0) == 43)
+                          while (1) {
+                            K = 0;
+                            if ((b | 0) == 4) break a;
+                            K = ((c[I >> 2] | 0) + ((e - b) << 4)) | 0;
+                            B = (E + (b << 4)) | 0;
+                            c[K >> 2] = c[B >> 2];
+                            c[(K + 4) >> 2] = c[(B + 4) >> 2];
+                            c[(K + 8) >> 2] = c[(B + 8) >> 2];
+                            c[(K + 12) >> 2] = c[(B + 12) >> 2];
+                            b = (b + 1) | 0;
+                            K = 43;
+                          }
+                      while (0);
+                      if (e | 0) {
+                        d = (e + -3) | 0;
+                        b = c[C >> 2] | 0;
+                        if (!b) break;
+                        d = WH(a, c[I >> 2] | 0, d, (F + -3) | 0, J, b) | 0;
+                        break;
+                      }
+                      if (!(c[C >> 2] | 0)) qa(87936, 87947, 452, 87958);
+                      else {
+                        d = (J + 16) | 0;
+                        E = (I + 16) | 0;
+                        a = c[I >> 2] | 0;
+                        c[G >> 2] = c[E >> 2];
+                        c[(G + 4) >> 2] = c[(E + 4) >> 2];
+                        c[(G + 8) >> 2] = c[(E + 8) >> 2];
+                        c[(G + 12) >> 2] = c[(E + 12) >> 2];
+                        c[H >> 2] = c[a >> 2];
+                        c[(H + 4) >> 2] = c[(a + 4) >> 2];
+                        c[(H + 8) >> 2] = c[(a + 8) >> 2];
+                        c[(H + 12) >> 2] = c[(a + 12) >> 2];
+                        pl(D, G, H, f);
+                        c[d >> 2] = c[D >> 2];
+                        c[(d + 4) >> 2] = c[(D + 4) >> 2];
+                        c[(d + 8) >> 2] = c[(D + 8) >> 2];
+                        c[(d + 12) >> 2] = c[(D + 12) >> 2];
+                        d = 0;
+                        break;
+                      }
+                    } else K = 52;
+                  while (0);
+                  if ((K | 0) == 52)
+                    if (!(c[C >> 2] | 0)) d = 0;
+                    else {
+                      d = (J + 16) | 0;
+                      K = (I + 16) | 0;
+                      c[d >> 2] = c[K >> 2];
+                      c[(d + 4) >> 2] = c[(K + 4) >> 2];
+                      c[(d + 8) >> 2] = c[(K + 8) >> 2];
+                      c[(d + 12) >> 2] = c[(K + 12) >> 2];
+                      d = 0;
+                    }
+                  b = (F - d + 1) | 0;
+                  e = (J + 4) | 0;
+                  c[e >> 2] = b;
+                  c[J >> 2] = KK(b << 4) | 0;
+                  b = 0;
+                  while (1) {
+                    if ((b | 0) >= (c[e >> 2] | 0)) break;
+                    K = ((c[J >> 2] | 0) + (b << 4)) | 0;
+                    a = ((c[I >> 2] | 0) + (d << 4)) | 0;
+                    c[K >> 2] = c[a >> 2];
+                    c[(K + 4) >> 2] = c[(a + 4) >> 2];
+                    c[(K + 8) >> 2] = c[(a + 8) >> 2];
+                    c[(K + 12) >> 2] = c[(a + 12) >> 2];
+                    d = (d + 1) | 0;
+                    b = (b + 1) | 0;
+                  }
+                  U1(c[I >> 2] | 0);
+                  U1(I);
+                  c[c[((c[L >> 2] | 0) + 8) >> 2] >> 2] = J;
+                }
+              while (0);
+              l = M;
+              return;
+            }
+            function nl(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              f = l;
+              l = (l + 16) | 0;
+              e = f;
+              if ((b | 0) != 0 ? (a[b >> 0] | 0) != 0 : 0) {
+                d = KP(d, b) | 0;
+                if (!d) {
+                  c[e >> 2] = b;
+                  gA(0, 88149, e) | 0;
+                  d = 0;
+                }
+              } else d = 0;
+              l = f;
+              return d | 0;
+            }
+            function ol(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0,
+                d = 0.0;
+              d = +h[a >> 3];
+              if ((+h[b >> 3] <= d ? d <= +h[(b + 16) >> 3] : 0) ? ((c = +h[(a + 8) >> 3]), +h[(b + 8) >> 3] <= c) : 0)
+                a = (c <= +h[(b + 24) >> 3]) & 1;
+              else a = 0;
+              return a | 0;
+            }
+            function pl(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0.0,
+                g = 0.0,
+                i = 0,
+                j = 0.0,
+                k = 0.0,
+                m = 0.0,
+                n = 0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0,
+                r = 0.0,
+                s = 0.0,
+                t = 0.0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0.0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0;
+              C = l;
+              l = (l + 464) | 0;
+              n = (C + 48) | 0;
+              B = (C + 32) | 0;
+              u = (C + 16) | 0;
+              v = C;
+              w = (C + 364) | 0;
+              x = (C + 264) | 0;
+              z = (C + 164) | 0;
+              A = (C + 64) | 0;
+              q = +h[b >> 3];
+              r = +h[(b + 8) >> 3];
+              s = +h[d >> 3];
+              t = +h[(d + 8) >> 3];
+              c[u >> 2] = c[e >> 2];
+              c[(u + 4) >> 2] = c[(e + 4) >> 2];
+              c[(u + 8) >> 2] = c[(e + 8) >> 2];
+              c[(u + 12) >> 2] = c[(e + 12) >> 2];
+              e = (e + 16) | 0;
+              c[v >> 2] = c[e >> 2];
+              c[(v + 4) >> 2] = c[(e + 4) >> 2];
+              c[(v + 8) >> 2] = c[(e + 8) >> 2];
+              c[(v + 12) >> 2] = c[(e + 12) >> 2];
+              k = +h[u >> 3];
+              if (
+                (s < k ? ((f = r + +(~~(((k - q) * (r - t)) / (q - s)) | 0)), f >= +h[(u + 8) >> 3]) : 0)
+                  ? f <= +h[(v + 8) >> 3]
+                  : 0
+              ) {
+                o = f;
+                p = k;
+              } else i = 4;
+              do
+                if ((i | 0) == 4) {
+                  j = +h[v >> 3];
+                  if (s > j) {
+                    g = r + +(~~(((j - q) * (r - t)) / (q - s)) | 0);
+                    f = +h[(u + 8) >> 3];
+                    if (g >= f ? g <= +h[(v + 8) >> 3] : 0) {
+                      o = g;
+                      p = j;
+                      break;
+                    }
+                  } else f = +h[(u + 8) >> 3];
+                  if (t < f ? ((m = q + +(~~(((f - r) * (q - s)) / (r - t)) | 0)), !(!(m >= k) | !(m <= j))) : 0) {
+                    o = f;
+                    p = m;
+                    break;
+                  }
+                  f = +h[(v + 8) >> 3];
+                  if (t > f ? ((y = q + +(~~(((f - r) * (q - s)) / (r - t)) | 0)), !(!(y >= k) | !(y <= j))) : 0) {
+                    o = f;
+                    p = y;
+                    break;
+                  }
+                  c[n >> 2] = c[b >> 2];
+                  c[(n + 4) >> 2] = c[(b + 4) >> 2];
+                  c[(n + 8) >> 2] = c[(b + 8) >> 2];
+                  c[(n + 12) >> 2] = c[(b + 12) >> 2];
+                  w = wl(n, w) | 0;
+                  c[n >> 2] = c[d >> 2];
+                  c[(n + 4) >> 2] = c[(d + 4) >> 2];
+                  c[(n + 8) >> 2] = c[(d + 8) >> 2];
+                  c[(n + 12) >> 2] = c[(d + 12) >> 2];
+                  x = wl(n, x) | 0;
+                  c[n >> 2] = c[u >> 2];
+                  c[(n + 4) >> 2] = c[(u + 4) >> 2];
+                  c[(n + 8) >> 2] = c[(u + 8) >> 2];
+                  c[(n + 12) >> 2] = c[(u + 12) >> 2];
+                  z = wl(n, z) | 0;
+                  c[n >> 2] = c[v >> 2];
+                  c[(n + 4) >> 2] = c[(v + 4) >> 2];
+                  c[(n + 8) >> 2] = c[(v + 8) >> 2];
+                  c[(n + 12) >> 2] = c[(v + 12) >> 2];
+                  A = wl(n, A) | 0;
+                  c[B >> 2] = w;
+                  c[(B + 4) >> 2] = x;
+                  c[(B + 8) >> 2] = z;
+                  c[(B + 12) >> 2] = A;
+                  gA(1, 88071, B) | 0;
+                  qa(138394, 87947, 78, 88123);
+                }
+              while (0);
+              h[a >> 3] = p;
+              h[(a + 8) >> 3] = o;
+              l = C;
+              return;
+            }
+            function ql(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0;
+              d = (+h[(c + 8) >> 3] + +h[(b + 8) >> 3]) * 0.5;
+              h[a >> 3] = (+h[c >> 3] + +h[b >> 3]) * 0.5;
+              h[(a + 8) >> 3] = d;
+              return;
+            }
+            function rl(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              m = l;
+              l = (l + 80) | 0;
+              j = (m + 16) | 0;
+              k = m;
+              e = 0;
+              while (1) {
+                if ((e | 0) == 4) break;
+                i = (j + (e << 4)) | 0;
+                g = (a + (e << 4)) | 0;
+                c[i >> 2] = c[g >> 2];
+                c[(i + 4) >> 2] = c[(g + 4) >> 2];
+                c[(i + 8) >> 2] = c[(g + 8) >> 2];
+                c[(i + 12) >> 2] = c[(g + 12) >> 2];
+                e = (e + 1) | 0;
+              }
+              e = (b + 8) | 0;
+              i = (b + 24) | 0;
+              d = +sl(a, 0.0, 1.0, +h[b >> 3], +h[e >> 3], +h[i >> 3]);
+              if ((d >= 0.0) & (d < 2.0)) kP(k, j, 3, d, a, 0);
+              else d = 2.0;
+              g = (b + 16) | 0;
+              f = +sl(a, 0.0, d > 1.0 ? 1.0 : d, +h[g >> 3], +h[e >> 3], +h[i >> 3]);
+              if ((f >= 0.0) & (f < d)) {
+                kP(k, j, 3, f, a, 0);
+                d = f;
+              }
+              f = +tl(a, 0.0, d > 1.0 ? 1.0 : d, +h[e >> 3], +h[b >> 3], +h[g >> 3]);
+              if ((f >= 0.0) & (f < d)) {
+                kP(k, j, 3, f, a, 0);
+                d = f;
+              }
+              f = +tl(a, 0.0, d > 1.0 ? 1.0 : d, +h[i >> 3], +h[b >> 3], +h[g >> 3]);
+              if ((f >= 0.0) & (f < d)) {
+                kP(k, j, 3, f, a, 0);
+                d = f;
+              }
+              l = m;
+              return (d < 2.0) | 0;
+            }
+            function sl(a, b, c, d, e, f) {
+              a = a | 0;
+              b = +b;
+              c = +c;
+              d = +d;
+              e = +e;
+              f = +f;
+              var g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              m = l;
+              l = (l + 144) | 0;
+              j = (m + 80) | 0;
+              k = (m + 16) | 0;
+              i = m;
+              a: do
+                if (!(b == c)) {
+                  switch (vl(a, d) | 0) {
+                    case 0: {
+                      b = -1.0;
+                      break a;
+                    }
+                    case 1: {
+                      if (+B(+(+h[(a + 48) >> 3] - d)) <= 0.005) {
+                        b = +h[(a + 56) >> 3];
+                        b = !(b >= e) | !(b <= f) ? -1.0 : c;
+                        break a;
+                      }
+                      break;
+                    }
+                    default: {
+                    }
+                  }
+                  kP(i, a, 3, 0.5, j, k);
+                  g = (c + b) * 0.5;
+                  b = +sl(j, b, g, d, e, f);
+                  if (!(b >= 0.0)) b = +sl(k, g, c, d, e, f);
+                }
+              while (0);
+              l = m;
+              return +b;
+            }
+            function tl(a, b, c, d, e, f) {
+              a = a | 0;
+              b = +b;
+              c = +c;
+              d = +d;
+              e = +e;
+              f = +f;
+              var g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              m = l;
+              l = (l + 144) | 0;
+              j = (m + 80) | 0;
+              k = (m + 16) | 0;
+              i = m;
+              a: do
+                if (!(b == c)) {
+                  switch (ul(a, d) | 0) {
+                    case 0: {
+                      b = -1.0;
+                      break a;
+                    }
+                    case 1: {
+                      if (+B(+(+h[(a + 56) >> 3] - d)) <= 0.005) {
+                        b = +h[(a + 48) >> 3];
+                        b = !(b >= e) | !(b <= f) ? -1.0 : c;
+                        break a;
+                      }
+                      break;
+                    }
+                    default: {
+                    }
+                  }
+                  kP(i, a, 3, 0.5, j, k);
+                  g = (c + b) * 0.5;
+                  b = +tl(j, b, g, d, e, f);
+                  if (!(b >= 0.0)) b = +tl(k, g, c, d, e, f);
+                }
+              while (0);
+              l = m;
+              return +b;
+            }
+            function ul(a, b) {
+              a = a | 0;
+              b = +b;
+              var c = 0,
+                d = 0,
+                e = 0,
+                f = 0.0,
+                g = 0,
+                i = 0;
+              f = +h[(a + 8) >> 3];
+              e = f < b ? -1 : (f > b) & 1;
+              c = 1;
+              d = e;
+              e = ((e | 0) == 0) & 1;
+              while (1) {
+                if ((c | 0) == 4) break;
+                f = +h[(a + (c << 4) + 8) >> 3];
+                i = f < b ? -1 : (f > b) & 1;
+                g = (e + (((d | 0) != 0) & ((i | 0) != (d | 0)) & 1)) | 0;
+                c = (c + 1) | 0;
+                d = i;
+                e = g;
+              }
+              return e | 0;
+            }
+            function vl(a, b) {
+              a = a | 0;
+              b = +b;
+              var c = 0,
+                d = 0,
+                e = 0,
+                f = 0.0,
+                g = 0,
+                i = 0;
+              f = +h[a >> 3];
+              e = f < b ? -1 : (f > b) & 1;
+              c = 1;
+              d = e;
+              e = ((e | 0) == 0) & 1;
+              while (1) {
+                if ((c | 0) == 4) break;
+                f = +h[(a + (c << 4)) >> 3];
+                i = f < b ? -1 : (f > b) & 1;
+                g = (e + (((d | 0) != 0) & ((i | 0) != (d | 0)) & 1)) | 0;
+                c = (c + 1) | 0;
+                d = i;
+                e = g;
+              }
+              return e | 0;
+            }
+            function wl(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0,
+                d = 0,
+                e = 0.0;
+              c = l;
+              l = (l + 16) | 0;
+              d = c;
+              e = +h[(a + 8) >> 3];
+              h[d >> 3] = +h[a >> 3];
+              h[(d + 8) >> 3] = e;
+              m4(b, 88137, d) | 0;
+              l = c;
+              return b | 0;
+            }
+            function xl(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0;
+              v = l;
+              l = (l + 16) | 0;
+              s = v;
+              u = 4;
+              t = T1(40) | 0;
+              c[t >> 2] = 0;
+              r = (a + 16) | 0;
+              e = c[r >> 2] | 0;
+              a: do
+                if ((((b[(e + 238) >> 1] | 0) - (b[(e + 236) >> 1] | 0)) | 0) >= 2) {
+                  m = 1;
+                  d = e;
+                  e = c[(e + 196) >> 2] | 0;
+                  b: while (1) {
+                    n = (m + 1) | 0;
+                    if (!(c[(e + (n << 6)) >> 2] | 0)) {
+                      q = 15;
+                      break;
+                    } else k = 0;
+                    while (1) {
+                      h = c[(e + (m << 6)) >> 2] | 0;
+                      if ((k | 0) >= (h | 0)) {
+                        m = n;
+                        continue b;
+                      }
+                      j = c[((c[(e + (m << 6) + 4) >> 2] | 0) + (k << 2)) >> 2] | 0;
+                      o = 0;
+                      d = $(20, j | 0) | 0;
+                      f = o;
+                      o = 0;
+                      if (((f | 0) != 0) & ((p | 0) != 0)) {
+                        g = V6(c[f >> 2] | 0, t | 0, u | 0) | 0;
+                        if (!g) bb(f | 0, p | 0);
+                        z = p;
+                      } else g = -1;
+                      if ((g | 0) == 1) {
+                        d = z;
+                        break b;
+                      }
+                      if ((d << 24) >> 24) {
+                        i = k;
+                        d = h;
+                        while (1) {
+                          g = (i + 1) | 0;
+                          if ((g | 0) >= (d | 0)) break;
+                          o = 0;
+                          d = aa(65, j | 0, c[((c[(e + (m << 6) + 4) >> 2] | 0) + (g << 2)) >> 2] | 0) | 0;
+                          e = o;
+                          o = 0;
+                          if (((e | 0) != 0) & ((p | 0) != 0)) {
+                            f = V6(c[e >> 2] | 0, t | 0, u | 0) | 0;
+                            if (!f) bb(e | 0, p | 0);
+                            z = p;
+                          } else f = -1;
+                          if ((f | 0) == 1) {
+                            d = z;
+                            break b;
+                          }
+                          if (!((d << 24) >> 24)) break;
+                          d = c[((c[r >> 2] | 0) + 196) >> 2] | 0;
+                          i = g;
+                          e = d;
+                          d = c[(d + (m << 6)) >> 2] | 0;
+                        }
+                        if (((g - k) | 0) > 1) {
+                          o = 0;
+                          na(6, a | 0, m | 0, k | 0, i | 0, 1);
+                          d = o;
+                          o = 0;
+                          if (((d | 0) != 0) & ((p | 0) != 0)) {
+                            e = V6(c[d >> 2] | 0, t | 0, u | 0) | 0;
+                            if (!e) bb(d | 0, p | 0);
+                            z = p;
+                          } else e = -1;
+                          if ((e | 0) == 1) {
+                            d = z;
+                            break b;
+                          }
+                        }
+                      }
+                      e = c[r >> 2] | 0;
+                      k = (k + 1) | 0;
+                      d = e;
+                      e = c[(e + 196) >> 2] | 0;
+                    }
+                  }
+                  c: do
+                    if ((q | 0) == 15) {
+                      while (1) {
+                        if ((m | 0) > 0) k = 0;
+                        else break;
+                        while (1) {
+                          e = c[(d + 196) >> 2] | 0;
+                          h = c[(e + (m << 6)) >> 2] | 0;
+                          if ((k | 0) >= (h | 0)) break;
+                          j = c[((c[(e + (m << 6) + 4) >> 2] | 0) + (k << 2)) >> 2] | 0;
+                          o = 0;
+                          d = $(21, j | 0) | 0;
+                          f = o;
+                          o = 0;
+                          if (((f | 0) != 0) & ((p | 0) != 0)) {
+                            g = V6(c[f >> 2] | 0, t | 0, u | 0) | 0;
+                            if (!g) bb(f | 0, p | 0);
+                            z = p;
+                          } else g = -1;
+                          if ((g | 0) == 1) {
+                            d = z;
+                            break c;
+                          }
+                          if ((d << 24) >> 24) {
+                            i = k;
+                            d = h;
+                            while (1) {
+                              g = (i + 1) | 0;
+                              if ((g | 0) >= (d | 0)) break;
+                              o = 0;
+                              d = aa(66, j | 0, c[((c[(e + (m << 6) + 4) >> 2] | 0) + (g << 2)) >> 2] | 0) | 0;
+                              e = o;
+                              o = 0;
+                              if (((e | 0) != 0) & ((p | 0) != 0)) {
+                                f = V6(c[e >> 2] | 0, t | 0, u | 0) | 0;
+                                if (!f) bb(e | 0, p | 0);
+                                z = p;
+                              } else f = -1;
+                              if ((f | 0) == 1) {
+                                d = z;
+                                break c;
+                              }
+                              if (!((d << 24) >> 24)) break;
+                              d = c[((c[r >> 2] | 0) + 196) >> 2] | 0;
+                              i = g;
+                              e = d;
+                              d = c[(d + (m << 6)) >> 2] | 0;
+                            }
+                            if (((g - k) | 0) > 1) {
+                              o = 0;
+                              na(6, a | 0, m | 0, k | 0, i | 0, 0);
+                              d = o;
+                              o = 0;
+                              if (((d | 0) != 0) & ((p | 0) != 0)) {
+                                e = V6(c[d >> 2] | 0, t | 0, u | 0) | 0;
+                                if (!e) bb(d | 0, p | 0);
+                                z = p;
+                              } else e = -1;
+                              if ((e | 0) == 1) {
+                                d = z;
+                                break c;
+                              }
+                            }
+                          }
+                          k = (k + 1) | 0;
+                          d = c[r >> 2] | 0;
+                        }
+                        m = (m + -1) | 0;
+                        q = 15;
+                      }
+                      t = U6(187016, 1, t | 0, u | 0) | 0;
+                      u = z;
+                      o = 0;
+                      d = o;
+                      o = 0;
+                      if (((d | 0) != 0) & ((p | 0) != 0)) {
+                        e = V6(c[d >> 2] | 0, t | 0, u | 0) | 0;
+                        if (!e) bb(d | 0, p | 0);
+                        z = p;
+                      } else e = -1;
+                      if ((e | 0) == 1) d = z;
+                      else d = 0;
+                    }
+                  while (0);
+                  d: while (1) {
+                    if (d) {
+                      o = 0;
+                      ca(20, 3, 88177, s | 0) | 0;
+                      d = o;
+                      o = 0;
+                      if (((d | 0) != 0) & ((p | 0) != 0)) {
+                        e = V6(c[d >> 2] | 0, t | 0, u | 0) | 0;
+                        if (!e) bb(d | 0, p | 0);
+                        z = p;
+                      } else e = -1;
+                      if ((e | 0) == 1) {
+                        d = z;
+                        continue;
+                      } else break;
+                    } else f = 1;
+                    while (1) {
+                      d = c[r >> 2] | 0;
+                      if ((f | 0) > (c[(d + 180) >> 2] | 0)) break a;
+                      o = 0;
+                      ia(101, c[((c[(d + 184) >> 2] | 0) + (f << 2)) >> 2] | 0);
+                      d = o;
+                      o = 0;
+                      if (((d | 0) != 0) & ((p | 0) != 0)) {
+                        e = V6(c[d >> 2] | 0, t | 0, u | 0) | 0;
+                        if (!e) bb(d | 0, p | 0);
+                        z = p;
+                      } else e = -1;
+                      if ((e | 0) == 1) {
+                        d = z;
+                        continue d;
+                      }
+                      f = (f + 1) | 0;
+                    }
+                  }
+                }
+              while (0);
+              U1(t | 0);
+              l = v;
+              return;
+            }
+            function yl(b) {
+              b = b | 0;
+              b = c[(b + 16) >> 2] | 0;
+              if (((a[(b + 156) >> 0] | 0) == 1 ? (c[(b + 176) >> 2] | 0) == 1 : 0) ? (c[(b + 184) >> 2] | 0) == 1 : 0)
+                b = ((c[(b + 104) >> 2] | 0) == 0) & 1;
+              else b = 0;
+              return b | 0;
+            }
+            function zl(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 80) | 0;
+              h = (i + 40) | 0;
+              g = i;
+              e = c[c[((c[(a + 16) >> 2] | 0) + 172) >> 2] >> 2] | 0;
+              a = c[c[((c[(b + 16) >> 2] | 0) + 172) >> 2] >> 2] | 0;
+              if (
+                (
+                  ((yl(b) | 0) << 24) >> 24 != 0
+                    ? (c[((((c[e >> 2] & 3) | 0) == 3 ? e : (e + 48) | 0) + 40) >> 2] | 0) ==
+                      (c[((((c[a >> 2] & 3) | 0) == 3 ? a : (a + 48) | 0) + 40) >> 2] | 0)
+                    : 0
+                )
+                  ? ((Fl(e, a) | 0) << 24) >> 24 != 0
+                  : 0
+              ) {
+                d = ((c[(a + 16) >> 2] | 0) + 16) | 0;
+                f = g;
+                a = ((c[(e + 16) >> 2] | 0) + 16) | 0;
+                b = (f + 40) | 0;
+                do {
+                  c[f >> 2] = c[a >> 2];
+                  f = (f + 4) | 0;
+                  a = (a + 4) | 0;
+                } while ((f | 0) < (b | 0));
+                f = h;
+                a = d;
+                b = (f + 40) | 0;
+                do {
+                  c[f >> 2] = c[a >> 2];
+                  f = (f + 4) | 0;
+                  a = (a + 4) | 0;
+                } while ((f | 0) < (b | 0));
+                a = ((hg(g, h) | 0) == 0) & 1;
+              } else a = 0;
+              l = i;
+              return a | 0;
+            }
+            function Al(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0;
+              t = (a + 16) | 0;
+              q = c[((c[((c[((c[t >> 2] | 0) + 196) >> 2] | 0) + (b << 6) + 4) >> 2] | 0) + (d << 2)) >> 2] | 0;
+              p = (d + 1) | 0;
+              m = (f | 0) == 1;
+              n = (q + 16) | 0;
+              l = p;
+              while (1) {
+                if ((l | 0) > (e | 0)) {
+                  g = e;
+                  s = p;
+                  break;
+                }
+                o = c[((c[((c[((c[t >> 2] | 0) + 196) >> 2] | 0) + (b << 6) + 4) >> 2] | 0) + (l << 2)) >> 2] | 0;
+                k = (o + 16) | 0;
+                a: do
+                  if (m)
+                    while (1) {
+                      d = c[k >> 2] | 0;
+                      j = c[c[(d + 180) >> 2] >> 2] | 0;
+                      if (!j) break a;
+                      h = c[((c[n >> 2] | 0) + 180) >> 2] | 0;
+                      i = (j + -48) | 0;
+                      f = 0;
+                      while (1) {
+                        d = c[(h + (f << 2)) >> 2] | 0;
+                        if (!d) {
+                          r = 8;
+                          break;
+                        }
+                        if (
+                          (c[((((c[d >> 2] & 3) | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0) ==
+                          (c[((((c[j >> 2] & 3) | 0) == 2 ? j : i) + 40) >> 2] | 0)
+                        )
+                          break;
+                        else f = (f + 1) | 0;
+                      }
+                      if ((r | 0) == 8) {
+                        r = 0;
+                        d = nh(q, c[((((c[j >> 2] & 3) | 0) == 2 ? j : i) + 40) >> 2] | 0, j) | 0;
+                      }
+                      while (1) {
+                        f = c[c[((c[k >> 2] | 0) + 172) >> 2] >> 2] | 0;
+                        if (!f) break;
+                        vh(f, d);
+                        ih(f);
+                      }
+                      ih(j);
+                    }
+                  else
+                    while (1) {
+                      d = c[k >> 2] | 0;
+                      j = c[c[(d + 172) >> 2] >> 2] | 0;
+                      if (!j) break a;
+                      h = c[((c[n >> 2] | 0) + 172) >> 2] | 0;
+                      i = (j + 48) | 0;
+                      f = 0;
+                      while (1) {
+                        d = c[(h + (f << 2)) >> 2] | 0;
+                        if (!d) {
+                          r = 17;
+                          break;
+                        }
+                        if (
+                          (c[((((c[d >> 2] & 3) | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0) ==
+                          (c[((((c[j >> 2] & 3) | 0) == 3 ? j : i) + 40) >> 2] | 0)
+                        )
+                          break;
+                        else f = (f + 1) | 0;
+                      }
+                      if ((r | 0) == 17) {
+                        r = 0;
+                        d = nh(c[((((c[j >> 2] & 3) | 0) == 3 ? j : i) + 40) >> 2] | 0, q, j) | 0;
+                      }
+                      while (1) {
+                        f = c[c[((c[k >> 2] | 0) + 180) >> 2] >> 2] | 0;
+                        if (!f) break;
+                        vh(f, d);
+                        ih(f);
+                      }
+                      ih(j);
+                    }
+                while (0);
+                if ((c[(d + 176) >> 2] | 0) != ((0 - (c[(d + 184) >> 2] | 0)) | 0)) {
+                  r = 23;
+                  break;
+                }
+                qh(a, o);
+                l = (l + 1) | 0;
+              }
+              if ((r | 0) == 23) qa(88313, 88357, 115, 88364);
+              while (1) {
+                g = (g + 1) | 0;
+                d = c[((c[t >> 2] | 0) + 196) >> 2] | 0;
+                f = (d + (b << 6)) | 0;
+                if ((g | 0) >= (c[f >> 2] | 0)) break;
+                e = c[(d + (b << 6) + 4) >> 2] | 0;
+                r = c[(e + (g << 2)) >> 2] | 0;
+                c[(e + (s << 2)) >> 2] = r;
+                c[((c[(r + 16) >> 2] | 0) + 236) >> 2] = s;
+                s = (s + 1) | 0;
+              }
+              c[f >> 2] = s;
+              c[((c[(d + (b << 6) + 4) >> 2] | 0) + (s << 2)) >> 2] = 0;
+              return;
+            }
+            function Bl(b) {
+              b = b | 0;
+              b = c[(b + 16) >> 2] | 0;
+              if (((a[(b + 156) >> 0] | 0) == 1 ? (c[(b + 184) >> 2] | 0) == 1 : 0) ? (c[(b + 176) >> 2] | 0) == 1 : 0)
+                b = ((c[(b + 104) >> 2] | 0) == 0) & 1;
+              else b = 0;
+              return b | 0;
+            }
+            function Cl(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 80) | 0;
+              h = (i + 40) | 0;
+              g = i;
+              e = c[c[((c[(a + 16) >> 2] | 0) + 180) >> 2] >> 2] | 0;
+              a = c[c[((c[(b + 16) >> 2] | 0) + 180) >> 2] >> 2] | 0;
+              if (
+                (
+                  ((Bl(b) | 0) << 24) >> 24 != 0
+                    ? (c[((((c[e >> 2] & 3) | 0) == 2 ? e : (e + -48) | 0) + 40) >> 2] | 0) ==
+                      (c[((((c[a >> 2] & 3) | 0) == 2 ? a : (a + -48) | 0) + 40) >> 2] | 0)
+                    : 0
+                )
+                  ? ((Fl(e, a) | 0) << 24) >> 24 != 0
+                  : 0
+              ) {
+                d = ((c[(a + 16) >> 2] | 0) + 56) | 0;
+                f = g;
+                a = ((c[(e + 16) >> 2] | 0) + 56) | 0;
+                b = (f + 40) | 0;
+                do {
+                  c[f >> 2] = c[a >> 2];
+                  f = (f + 4) | 0;
+                  a = (a + 4) | 0;
+                } while ((f | 0) < (b | 0));
+                f = h;
+                a = d;
+                b = (f + 40) | 0;
+                do {
+                  c[f >> 2] = c[a >> 2];
+                  f = (f + 4) | 0;
+                  a = (a + 4) | 0;
+                } while ((f | 0) < (b | 0));
+                a = ((hg(g, h) | 0) == 0) & 1;
+              } else a = 0;
+              l = i;
+              return a | 0;
+            }
+            function Dl(d) {
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0;
+              r = l;
+              l = (l + 32) | 0;
+              p = (r + 16) | 0;
+              o = r;
+              m = (d + 16) | 0;
+              f = c[m >> 2] | 0;
+              e = b[(f + 236) >> 1] | 0;
+              while (1) {
+                if ((e | 0) > (b[(f + 238) >> 1] | 0)) break;
+                c[((c[(f + 268) >> 2] | 0) + (e << 2)) >> 2] = 0;
+                e = (e + 1) | 0;
+                f = c[m >> 2] | 0;
+              }
+              vj(d);
+              j = jC(d) | 0;
+              while (1) {
+                if (!j) break;
+                El(d, j);
+                i = XA(d, j) | 0;
+                while (1) {
+                  if (!i) break;
+                  else f = i;
+                  while (1) {
+                    e = c[((c[(f + 16) >> 2] | 0) + 172) >> 2] | 0;
+                    if (!e) break;
+                    else f = e;
+                  }
+                  h = (i + -48) | 0;
+                  while (1) {
+                    e = (f + -48) | 0;
+                    g = c[((((c[f >> 2] & 3) | 0) == 2 ? f : e) + 40) >> 2] | 0;
+                    if (
+                      (c[((c[(g + 16) >> 2] | 0) + 232) >> 2] | 0) >=
+                      (c[((c[((c[((((c[i >> 2] & 3) | 0) == 2 ? i : h) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] |
+                        0)
+                    )
+                      break;
+                    El(d, g);
+                    f =
+                      c[
+                        c[
+                          ((c[((c[((((c[f >> 2] & 3) | 0) == 2 ? f : e) + 40) >> 2] | 0) + 16) >> 2] | 0) + 180) >> 2
+                        ] >> 2
+                      ] | 0;
+                  }
+                  i = ZA(d, i) | 0;
+                }
+                j = kC(d, j) | 0;
+              }
+              e = c[m >> 2] | 0;
+              i = b[(e + 236) >> 1] | 0;
+              while (1) {
+                if ((i | 0) > (b[(e + 238) >> 1] | 0)) {
+                  k = 1;
+                  n = e;
+                  break;
+                }
+                e = c[((c[(e + 268) >> 2] | 0) + (i << 2)) >> 2] | 0;
+                j = c[((c[((c[((gg(d) | 0) + 16) >> 2] | 0) + 196) >> 2] | 0) + (i << 6) + 4) >> 2] | 0;
+                f = (e + 16) | 0;
+                if ((c[(j + (c[((c[f >> 2] | 0) + 236) >> 2] << 2)) >> 2] | 0) != (e | 0)) {
+                  q = 17;
+                  break;
+                }
+                h = c[((c[((c[((gg(d) | 0) + 16) >> 2] | 0) + 196) >> 2] | 0) + (i << 6) + 4) >> 2] | 0;
+                e = c[m >> 2] | 0;
+                f = c[(e + 196) >> 2] | 0;
+                c[(f + (i << 6) + 4) >> 2] =
+                  h + (c[((c[((c[((c[(e + 268) >> 2] | 0) + (i << 2)) >> 2] | 0) + 16) >> 2] | 0) + 236) >> 2] << 2);
+                e = -1;
+                h = 0;
+                a: while (1) {
+                  if ((h | 0) >= (c[(f + (i << 6)) >> 2] | 0)) break;
+                  f = c[((c[(f + (i << 6) + 4) >> 2] | 0) + (h << 2)) >> 2] | 0;
+                  if (!f) break;
+                  g = c[(f + 16) >> 2] | 0;
+                  b: do
+                    if (!(a[(g + 156) >> 0] | 0))
+                      if (!(HC(d, f) | 0)) break a;
+                      else e = h;
+                    else {
+                      f = c[c[(g + 172) >> 2] >> 2] | 0;
+                      while (1) {
+                        if (!f) break b;
+                        g = c[((c[(f + 16) >> 2] | 0) + 116) >> 2] | 0;
+                        if (!g) break;
+                        else f = g;
+                      }
+                      if (HC(d, c[((((c[f >> 2] & 3) | 0) == 3 ? f : (f + 48) | 0) + 40) >> 2] | 0) | 0) {
+                        j = (HC(d, c[((((c[f >> 2] & 3) | 0) == 2 ? f : (f + -48) | 0) + 40) >> 2] | 0) | 0) == 0;
+                        e = j ? e : h;
+                      }
+                    }
+                  while (0);
+                  h = (h + 1) | 0;
+                  f = c[((c[m >> 2] | 0) + 196) >> 2] | 0;
+                }
+                if ((e | 0) == -1) {
+                  c[p >> 2] = KB(d) | 0;
+                  c[(p + 4) >> 2] = i;
+                  gA(0, 88277, p) | 0;
+                }
+                j = c[m >> 2] | 0;
+                c[((c[(j + 196) >> 2] | 0) + (i << 6)) >> 2] = e + 1;
+                i = (i + 1) | 0;
+                e = j;
+              }
+              if ((q | 0) == 17) {
+                p = KB(e) | 0;
+                q = c[((c[f >> 2] | 0) + 236) >> 2] | 0;
+                c[o >> 2] = p;
+                c[(o + 4) >> 2] = q;
+                c[(o + 8) >> 2] = i;
+                gA(1, 88219, o) | 0;
+                bb(187016, 1);
+              }
+              while (1) {
+                if ((k | 0) > (c[(n + 180) >> 2] | 0)) break;
+                Dl(c[((c[(n + 184) >> 2] | 0) + (k << 2)) >> 2] | 0);
+                k = (k + 1) | 0;
+                n = c[m >> 2] | 0;
+              }
+              l = r;
+              return;
+            }
+            function El(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = c[(b + 16) >> 2] | 0;
+              a = ((c[((c[(a + 16) >> 2] | 0) + 268) >> 2] | 0) + (c[(d + 232) >> 2] << 2)) | 0;
+              e = c[a >> 2] | 0;
+              if (!((e | 0) != 0 ? (c[((c[(e + 16) >> 2] | 0) + 236) >> 2] | 0) <= (c[(d + 236) >> 2] | 0) : 0))
+                c[a >> 2] = b;
+              return;
+            }
+            function Fl(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              while (1) {
+                f = c[(b + 16) >> 2] | 0;
+                if (!(a[(f + 112) >> 0] | 0)) break;
+                b = c[(f + 116) >> 2] | 0;
+              }
+              while (1) {
+                e = c[(d + 16) >> 2] | 0;
+                if (!(a[(e + 112) >> 0] | 0)) break;
+                d = c[(e + 116) >> 2] | 0;
+              }
+              if ((a[(f + 153) >> 0] | 0) == 0 ? (a[(e + 153) >> 0] | 0) == 0 : 0) {
+                f = c[d >> 2] & 3;
+                e = c[b >> 2] & 3;
+                b =
+                  ((O(
+                    ((c[((c[((c[(((e | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0) -
+                      (c[((c[((c[(((e | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] |
+                        0)) |
+                      0,
+                    ((c[((c[((c[(((f | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0) -
+                      (c[((c[((c[(((f | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] |
+                        0)) |
+                      0
+                  ) |
+                    0) >
+                    0) &
+                  1;
+              } else b = 0;
+              return b | 0;
+            }
+            function Gl(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 544) | 0;
+              j = (k + 528) | 0;
+              Hl(j, (k + 512) | 0, k);
+              e = (((a[193770] | 0) + 1) << 24) >> 24;
+              a[193770] = (e << 24) >> 24 == 0 ? 1 : e;
+              e = c[(b + 16) >> 2] | 0;
+              c[(e + 220) >> 2] = 0;
+              c[(e + 232) >> 2] = 0;
+              e = (d | 0) > 0;
+              d = jC(b) | 0;
+              while (1) {
+                if (!d) break;
+                if (e ? ((h = c[(d + 16) >> 2] | 0), (i = c[(h + 212) >> 2] | 0), (i | 0) != 0) : 0) {
+                  g = c[((c[((c[(i + 16) >> 2] | 0) + 268) >> 2] | 0) + (c[(h + 232) >> 2] << 2)) >> 2] | 0;
+                  f = 7;
+                } else f = 6;
+                if ((f | 0) == 6 ? ((f = 0), (d | 0) == (fP(d) | 0)) : 0) {
+                  g = d;
+                  f = 7;
+                }
+                if ((f | 0) == 7 ? (0, (a[((c[(g + 16) >> 2] | 0) + 157) >> 0] | 0) != (a[193770] | 0)) : 0) {
+                  Il(b);
+                  Jl(j, b, g);
+                  Kl(b);
+                }
+                d = kC(b, d) | 0;
+              }
+              Ll(j);
+              l = k;
+              return;
+            }
+            function Hl(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              c[b >> 2] = d;
+              c[(b + 4) >> 2] = d + 512;
+              c[(b + 12) >> 2] = 0;
+              c[(b + 8) >> 2] = 0;
+              c[a >> 2] = b;
+              c[(a + 4) >> 2] = b;
+              c[(a + 8) >> 2] = d;
+              return;
+            }
+            function Il(a) {
+              a = a | 0;
+              c[((c[(a + 16) >> 2] | 0) + 192) >> 2] = 0;
+              c[46793] = 0;
+              return;
+            }
+            function Jl(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              q = l;
+              l = (l + 32) | 0;
+              p = q;
+              Ml(b, e);
+              k = (p + 8) | 0;
+              m = (p + 16) | 0;
+              n = (p + 24) | 0;
+              a: while (1) {
+                o = Nl(b) | 0;
+                if (!o) break;
+                e = (o + 16) | 0;
+                if ((a[((c[e >> 2] | 0) + 157) >> 0] | 0) == (a[193770] | 0)) continue;
+                Ol(d, o);
+                h = c[e >> 2] | 0;
+                g = (h + 180) | 0;
+                j = c[(g + 4) >> 2] | 0;
+                i = p;
+                c[i >> 2] = c[g >> 2];
+                c[(i + 4) >> 2] = j;
+                i = (h + 172) | 0;
+                j = c[(i + 4) >> 2] | 0;
+                g = k;
+                c[g >> 2] = c[i >> 2];
+                c[(g + 4) >> 2] = j;
+                g = (h + 188) | 0;
+                j = c[(g + 4) >> 2] | 0;
+                i = m;
+                c[i >> 2] = c[g >> 2];
+                c[(i + 4) >> 2] = j;
+                h = (h + 196) | 0;
+                i = c[(h + 4) >> 2] | 0;
+                j = n;
+                c[j >> 2] = c[h >> 2];
+                c[(j + 4) >> 2] = i;
+                j = 3;
+                while (1) {
+                  if ((j | 0) <= -1) continue a;
+                  e = c[(p + (j << 3)) >> 2] | 0;
+                  b: do
+                    if (e | 0) {
+                      i = ((c[(p + (j << 3) + 4) >> 2] | 0) + -1) | 0;
+                      h = (e + (i << 2)) | 0;
+                      while (1) {
+                        if ((i | 0) <= -1) break b;
+                        f = c[h >> 2] | 0;
+                        g = c[f >> 2] & 3;
+                        e = c[(((g | 0) == 2 ? f : (f + -48) | 0) + 40) >> 2] | 0;
+                        if ((e | 0) == (o | 0)) e = c[(((g | 0) == 3 ? f : (f + 48) | 0) + 40) >> 2] | 0;
+                        if (
+                          (a[((c[(e + 16) >> 2] | 0) + 157) >> 0] | 0) != (a[193770] | 0) ? (e | 0) == (fP(e) | 0) : 0
+                        )
+                          Ml(b, e);
+                        h = (h + -4) | 0;
+                        i = (i + -1) | 0;
+                      }
+                    }
+                  while (0);
+                  j = (j + -1) | 0;
+                }
+              }
+              l = q;
+              return;
+            }
+            function Kl(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              d = (a + 16) | 0;
+              b = c[d >> 2] | 0;
+              f = (b + 220) | 0;
+              e = c[f >> 2] | 0;
+              a = (e + 1) | 0;
+              c[f >> 2] = a;
+              b = c[(b + 216) >> 2] | 0;
+              if (!b) a = KK(a << 2) | 0;
+              else a = MK(b, a << 2) | 0;
+              f = c[d >> 2] | 0;
+              c[(f + 216) >> 2] = a;
+              c[(a + (e << 2)) >> 2] = c[(f + 192) >> 2];
+              return;
+            }
+            function Ll(a) {
+              a = a | 0;
+              var b = 0;
+              a = c[((c[a >> 2] | 0) + 12) >> 2] | 0;
+              while (1) {
+                if (!a) break;
+                b = c[(a + 12) >> 2] | 0;
+                U1(c[a >> 2] | 0);
+                U1(a);
+                a = b;
+              }
+              return;
+            }
+            function Ml(b, e) {
+              b = b | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 16) | 0;
+              h = (k + 8) | 0;
+              g = k;
+              j = (b + 8) | 0;
+              f = c[j >> 2] | 0;
+              i = (b + 4) | 0;
+              b = c[i >> 2] | 0;
+              if ((f | 0) == (c[(b + 4) >> 2] | 0)) {
+                f = c[(b + 12) >> 2] | 0;
+                if (!f) {
+                  f = JK(16) | 0;
+                  if (!f) gA(1, 98969, g) | 0;
+                  c[(f + 8) >> 2] = c[i >> 2];
+                  c[(f + 12) >> 2] = 0;
+                  b = JK(4e6) | 0;
+                  c[f >> 2] = b;
+                  if (!b) {
+                    gA(1, 88377, h) | 0;
+                    b = c[f >> 2] | 0;
+                  }
+                  c[(f + 4) >> 2] = b + 4e6;
+                  c[((c[i >> 2] | 0) + 12) >> 2] = f;
+                }
+                c[i >> 2] = f;
+                f = c[f >> 2] | 0;
+                c[j >> 2] = f;
+              }
+              a[((c[(e + 16) >> 2] | 0) + 157) >> 0] = (d[193770] | 0) + 1;
+              c[j >> 2] = f + 4;
+              c[f >> 2] = e;
+              l = k;
+              return;
+            }
+            function Nl(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              f = (a + 8) | 0;
+              b = c[f >> 2] | 0;
+              d = (a + 4) | 0;
+              e = c[d >> 2] | 0;
+              if ((b | 0) == (c[e >> 2] | 0))
+                if ((e | 0) == (c[a >> 2] | 0)) b = 0;
+                else {
+                  b = c[(e + 8) >> 2] | 0;
+                  c[d >> 2] = b;
+                  b = c[(b + 4) >> 2] | 0;
+                  c[f >> 2] = b;
+                  g = 4;
+                }
+              else g = 4;
+              if ((g | 0) == 4) {
+                b = (b + -4) | 0;
+                c[f >> 2] = b;
+                b = c[b >> 2] | 0;
+              }
+              return b | 0;
+            }
+            function Ol(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              f = c[(b + 16) >> 2] | 0;
+              g = (f + 232) | 0;
+              c[g >> 2] = (c[g >> 2] | 0) + 1;
+              g = c[(d + 16) >> 2] | 0;
+              a[(g + 157) >> 0] = a[193770] | 0;
+              b = c[46793] | 0;
+              e = (g + 168) | 0;
+              if (!b) {
+                c[e >> 2] = 0;
+                c[(f + 192) >> 2] = d;
+              } else {
+                c[e >> 2] = b;
+                c[((c[(b + 16) >> 2] | 0) + 164) >> 2] = d;
+              }
+              c[46793] = d;
+              c[(g + 164) >> 2] = 0;
+              return;
+            }
+            function Pl(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0.0,
+                o = 0.0;
+              m = (b + 16) | 0;
+              d = ((c[m >> 2] | 0) + 192) | 0;
+              while (1) {
+                d = c[d >> 2] | 0;
+                if (!d) break;
+                g = (d + 16) | 0;
+                d = c[g >> 2] | 0;
+                e = c[(d + 188) >> 2] | 0;
+                a: do
+                  if (!e) f = 0;
+                  else {
+                    f = 0;
+                    while (1) {
+                      e = c[(e + (f << 2)) >> 2] | 0;
+                      if (!e) {
+                        f = 0;
+                        break a;
+                      }
+                      Ql(e);
+                      d = c[g >> 2] | 0;
+                      f = (f + 1) | 0;
+                      e = c[(d + 188) >> 2] | 0;
+                    }
+                  }
+                while (0);
+                while (1) {
+                  if ((f | 0) >= (c[(d + 208) >> 2] | 0)) break;
+                  e = c[((c[(d + 204) >> 2] | 0) + (f << 2)) >> 2] | 0;
+                  l = c[e >> 2] & 3;
+                  if (
+                    (c[((c[((c[(((l | 0) == 2 ? e : (e + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] |
+                      0) ==
+                    (c[((c[((c[(((l | 0) == 3 ? e : (e + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0)
+                  ) {
+                    Ql(e);
+                    d = c[g >> 2] | 0;
+                  }
+                  f = (f + 1) | 0;
+                }
+                d = (d + 164) | 0;
+              }
+              l = c[m >> 2] | 0;
+              d = c[(l + 196) >> 2] | 0;
+              if (!((c[(d + 56) >> 2] | 0) == 0 ? (c[(l + 180) >> 2] | 0) <= 0 : 0)) i = 13;
+              b: do
+                if ((i | 0) == 13) {
+                  i = c[(d + 4) >> 2] | 0;
+                  g = 0;
+                  c: while (1) {
+                    d = c[(i + (g << 2)) >> 2] | 0;
+                    if (!d) break b;
+                    e = c[((c[(d + 16) >> 2] | 0) + 196) >> 2] | 0;
+                    d = 0;
+                    while (1) {
+                      f = c[(e + (d << 2)) >> 2] | 0;
+                      if (!f) break;
+                      l = c[(f + 16) >> 2] | 0;
+                      if (c[(l + 96) >> 2] | 0 ? (a[(l + 113) >> 0] | 0) == 0 : 0) break c;
+                      d = (d + 1) | 0;
+                    }
+                    g = (g + 1) | 0;
+                  }
+                  Rl(b);
+                }
+              while (0);
+              Hi(b);
+              e = 0;
+              d = ((c[m >> 2] | 0) + 192) | 0;
+              while (1) {
+                d = c[d >> 2] | 0;
+                if (!d) break;
+                l = (d + 16) | 0;
+                d = c[l >> 2] | 0;
+                f = c[(d + 188) >> 2] | 0;
+                d: do
+                  if (f) {
+                    k = 0;
+                    while (1) {
+                      g = c[(f + (k << 2)) >> 2] | 0;
+                      if (!g) {
+                        k = 0;
+                        break;
+                      }
+                      i = c[(g + 16) >> 2] | 0;
+                      j = c[(i + 96) >> 2] | 0;
+                      do
+                        if (j)
+                          if (!(a[(i + 113) >> 0] | 0)) {
+                            Sl(g);
+                            f = c[l >> 2] | 0;
+                            e = 1;
+                            d = f;
+                            f = c[(f + 188) >> 2] | 0;
+                            break;
+                          } else {
+                            h[(i + 136) >> 3] =
+                              +h[(((c[((c[m >> 2] | 0) + 116) >> 2] & 1) | 0) == 0 ? (j + 24) | 0 : (j + 32) | 0) >> 3];
+                            break;
+                          }
+                      while (0);
+                      k = (k + 1) | 0;
+                    }
+                    while (1) {
+                      if ((k | 0) >= (c[(d + 208) >> 2] | 0)) break d;
+                      i = c[((c[(d + 204) >> 2] | 0) + (k << 2)) >> 2] | 0;
+                      j = c[i >> 2] & 3;
+                      g = c[(((j | 0) == 3 ? i : (i + 48) | 0) + 40) >> 2] | 0;
+                      j = c[(((j | 0) == 2 ? i : (i + -48) | 0) + 40) >> 2] | 0;
+                      do
+                        if (
+                          !((g | 0) == (j | 0)
+                            ? 1
+                            : (c[((c[(g + 16) >> 2] | 0) + 232) >> 2] | 0) !=
+                              (c[((c[(j + 16) >> 2] | 0) + 232) >> 2] | 0))
+                        ) {
+                          f = i;
+                          do {
+                            j = c[(f + 16) >> 2] | 0;
+                            f = c[(j + 172) >> 2] | 0;
+                          } while ((f | 0) != 0);
+                          f = a[(j + 113) >> 0] | 0;
+                          g = c[(i + 16) >> 2] | 0;
+                          a[(g + 113) >> 0] = f;
+                          g = c[(g + 96) >> 2] | 0;
+                          if (g)
+                            if (!((f << 24) >> 24)) {
+                              Sl(i);
+                              e = 1;
+                              d = c[l >> 2] | 0;
+                              break;
+                            } else {
+                              o =
+                                +h[
+                                  (((c[((c[m >> 2] | 0) + 116) >> 2] & 1) | 0) == 0 ? (g + 24) | 0 : (g + 32) | 0) >> 3
+                                ];
+                              j = (j + 136) | 0;
+                              n = +h[j >> 3];
+                              h[j >> 3] = o > n ? o : n;
+                              break;
+                            }
+                        }
+                      while (0);
+                      k = (k + 1) | 0;
+                    }
+                  }
+                while (0);
+                d = (d + 164) | 0;
+              }
+              if (e | 0) {
+                Ah(b);
+                Oh(b);
+              }
+              return e | 0;
+            }
+            function Ql(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              d = c[b >> 2] & 3;
+              i = c[(((d | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0;
+              f = (i + 16) | 0;
+              g = c[((c[f >> 2] | 0) + 236) >> 2] | 0;
+              d = c[((c[((c[(((d | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 236) >> 2] | 0;
+              h = (g | 0) < (d | 0);
+              e = h ? d : g;
+              i = c[((c[((gg(i) | 0) + 16) >> 2] | 0) + 196) >> 2] | 0;
+              f = (i + (c[((c[f >> 2] | 0) + 232) >> 2] << 6) + 4) | 0;
+              d = h ? g : d;
+              a: while (1) {
+                d = (d + 1) | 0;
+                if ((d | 0) >= (e | 0)) break;
+                g = c[((c[((c[f >> 2] | 0) + (d << 2)) >> 2] | 0) + 16) >> 2] | 0;
+                switch (a[(g + 156) >> 0] | 0) {
+                  case 0:
+                    break a;
+                  case 1:
+                    break;
+                  default:
+                    continue a;
+                }
+                if (c[(g + 104) >> 2] | 0) break;
+              }
+              if ((d | 0) == (e | 0))
+                do {
+                  i = c[(b + 16) >> 2] | 0;
+                  a[(i + 113) >> 0] = 1;
+                  b = c[(i + 172) >> 2] | 0;
+                } while ((b | 0) != 0);
+              return;
+            }
+            function Rl(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              g = (a + 16) | 0;
+              a = c[g >> 2] | 0;
+              if (b[(a + 236) >> 1] | 0) qa(88434, 88417, 190, 88453);
+              d = ((b[(a + 238) >> 1] | 0) + 3) | 0;
+              a = c[(a + 196) >> 2] | 0;
+              if (!a) a = KK(d << 6) | 0;
+              else a = MK(a, d << 6) | 0;
+              d = (a + 64) | 0;
+              a = c[g >> 2] | 0;
+              c[(a + 196) >> 2] = d;
+              a = b[(a + 238) >> 1] | 0;
+              while (1) {
+                if ((a | 0) <= -1) break;
+                f = (a + -1) | 0;
+                e = (d + (a << 6)) | 0;
+                a = (d + (f << 6)) | 0;
+                d = (e + 64) | 0;
+                do {
+                  c[e >> 2] = c[a >> 2];
+                  e = (e + 4) | 0;
+                  a = (a + 4) | 0;
+                } while ((e | 0) < (d | 0));
+                a = f;
+                d = c[((c[g >> 2] | 0) + 196) >> 2] | 0;
+              }
+              c[(d + (a << 6) + 8) >> 2] = 0;
+              c[(d + (a << 6)) >> 2] = 0;
+              e = JK(8) | 0;
+              g = c[g >> 2] | 0;
+              f = c[(g + 196) >> 2] | 0;
+              c[(f + (a << 6) + 12) >> 2] = e;
+              c[(f + (a << 6) + 4) >> 2] = e;
+              c[(f + (a << 6) + 56) >> 2] = 0;
+              h[(f + (a << 6) + 24) >> 3] = 1.0;
+              h[(f + (a << 6) + 16) >> 3] = 1.0;
+              h[(f + (a << 6) + 40) >> 3] = 1.0;
+              h[(f + (a << 6) + 32) >> 3] = 1.0;
+              g = (g + 236) | 0;
+              b[g >> 1] = (((b[g >> 1] | 0) + -1) << 16) >> 16;
+              return;
+            }
+            function Sl(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0.0,
+                q = 0.0,
+                r = 0.0;
+              j = (b + 16) | 0;
+              if (c[((c[j >> 2] | 0) + 96) >> 2] | 0) {
+                m = (b + 48) | 0;
+                k = gg(c[((((c[b >> 2] & 3) | 0) == 3 ? b : m) + 40) >> 2] | 0) | 0;
+                d = c[((c[((c[((((c[b >> 2] & 3) | 0) == 3 ? b : m) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0;
+                l = Tl(k, b) | 0;
+                n = (k + 16) | 0;
+                e = c[n >> 2] | 0;
+                g = c[(e + 196) >> 2] | 0;
+                o = (d + -1) | 0;
+                i = c[c[(g + (o << 6) + 4) >> 2] >> 2] | 0;
+                if (!i)
+                  f =
+                    +h[(g + (d << 6) + 24) >> 3] +
+                    +h[((c[((c[c[(g + (d << 6) + 4) >> 2] >> 2] | 0) + 16) >> 2] | 0) + 24) >> 3] +
+                    +(c[(e + 252) >> 2] | 0);
+                else f = +h[((c[(i + 16) >> 2] | 0) + 24) >> 3] - +h[(g + (o << 6) + 16) >> 3];
+                d = Ul(k, o, l) | 0;
+                k = c[((c[j >> 2] | 0) + 96) >> 2] | 0;
+                q = +h[(k + 24) >> 3];
+                p = +h[(k + 32) >> 3];
+                j = ((c[((c[n >> 2] | 0) + 116) >> 2] & 1) | 0) == 0;
+                r = j ? p : q;
+                g = (d + 16) | 0;
+                e = c[g >> 2] | 0;
+                h[(e + 80) >> 3] = r;
+                l = ~~(r * 0.5);
+                p = (j ? q : p) * 0.5;
+                h[(e + 96) >> 3] = p;
+                h[(e + 88) >> 3] = p;
+                c[(e + 104) >> 2] = k;
+                h[(e + 24) >> 3] = +((l + ~~f) | 0);
+                e = nh(d, c[((((c[b >> 2] & 3) | 0) == 3 ? b : m) + 40) >> 2] | 0, b) | 0;
+                e = c[(e + 16) >> 2] | 0;
+                h[(e + 16) >> 3] = -+h[((c[g >> 2] | 0) + 88) >> 3];
+                h[(e + 56) >> 3] =
+                  +h[((c[((c[((((c[b >> 2] & 3) | 0) == 3 ? b : m) + 40) >> 2] | 0) + 16) >> 2] | 0) + 96) >> 3];
+                a[(e + 112) >> 0] = 4;
+                e = (b + -48) | 0;
+                d = nh(d, c[((((c[b >> 2] & 3) | 0) == 2 ? b : e) + 40) >> 2] | 0, b) | 0;
+                g = c[g >> 2] | 0;
+                d = c[(d + 16) >> 2] | 0;
+                h[(d + 16) >> 3] = +h[(g + 96) >> 3];
+                h[(d + 56) >> 3] =
+                  +h[((c[((c[((((c[b >> 2] & 3) | 0) == 2 ? b : e) + 40) >> 2] | 0) + 16) >> 2] | 0) + 88) >> 3];
+                a[(d + 112) >> 0] = 4;
+                d = c[((c[n >> 2] | 0) + 196) >> 2] | 0;
+                e = (d + (o << 6) + 16) | 0;
+                f = +(l | 0);
+                if (+h[e >> 3] < f) h[e >> 3] = f;
+                d = (d + (o << 6) + 24) | 0;
+                if (+h[d >> 3] < f) h[d >> 3] = f;
+                c[(g + 112) >> 2] = b;
+              }
+              return;
+            }
+            function QI(d, f, g) {
+              d = d | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0.0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0;
+              A = l;
+              l = (l + 160) | 0;
+              y = (A + 24) | 0;
+              w = (A + 20) | 0;
+              v = (A + 16) | 0;
+              o = A;
+              p = (A + 32) | 0;
+              x = c[(d + 152) >> 2] | 0;
+              c[y >> 2] = 0;
+              c[w >> 2] = 0;
+              c[v >> 2] = 0;
+              z = aI(d) | 0;
+              c[(z + 4) >> 2] = 3;
+              c[(z + 8) >> 2] = f;
+              c[(z + 12) >> 2] = 9;
+              t = (f + 16) | 0;
+              n = c[((c[t >> 2] | 0) + 96) >> 2] | 0;
+              if ((n | 0 ? (a[(n + 82) >> 0] | 0) == 0 : 0) ? ((eP(QA(f, 100105) | 0, 0) | 0) << 24) >> 24 : 0) {
+                n = (z + 260) | 0;
+                b[n >> 1] = b[n >> 1] | 512;
+              }
+              if (g | 0 ? c[((c[t >> 2] | 0) + 8) >> 2] | 0 : 0) lS(d, g);
+              g = c[47206] | 0;
+              if ((g | 0 ? ((i = RA(f, g) | 0), i | 0) : 0) ? a[i >> 0] | 0 : 0) uS(d, +_O(f, c[47206] | 0, 1.0, 0.0));
+              do
+                if ((x & 16777216) | 0) {
+                  g = (f + 48) | 0;
+                  if (
+                    (e[
+                      ((c[((xC(c[((((c[f >> 2] & 3) | 0) == 3 ? f : g) + 40) >> 2] | 0) | 0) + 16) >> 2] | 0) + 178) >>
+                        1
+                    ] |
+                      0) >
+                    2
+                  ) {
+                    m =
+                      +h[
+                        ((c[
+                          ((c[((c[((((c[f >> 2] & 3) | 0) == 3 ? f : g) + 40) >> 2] | 0) + 16) >> 2] | 0) + 132) >> 2
+                        ] |
+                          0) +
+                          16) >>
+                          3
+                      ] * 72.0;
+                    h[(z + 176) >> 3] = +(~~(m + (m >= 0.0 ? 0.5 : -0.5)) | 0);
+                    m =
+                      +h[
+                        ((c[
+                          ((c[((c[((((c[f >> 2] & 3) | 0) == 2 ? f : (f + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                            132) >>
+                            2
+                        ] |
+                          0) +
+                          16) >>
+                          3
+                      ] * 72.0;
+                    h[(z + 184) >> 3] = +(~~(m + (m >= 0.0 ? 0.5 : -0.5)) | 0);
+                    break;
+                  } else {
+                    n = (z + 176) | 0;
+                    c[n >> 2] = 0;
+                    c[(n + 4) >> 2] = 0;
+                    c[(n + 8) >> 2] = 0;
+                    c[(n + 12) >> 2] = 0;
+                    break;
+                  }
+                }
+              while (0);
+              if ((x & 32768) | 0) {
+                n = c[t >> 2] | 0;
+                g = c[(n + 96) >> 2] | 0;
+                if (!g) g = c[(z + 192) >> 2] | 0;
+                else {
+                  g = c[g >> 2] | 0;
+                  c[(z + 192) >> 2] = g;
+                }
+                i = (z + 196) | 0;
+                c[i >> 2] = g;
+                k = (z + 204) | 0;
+                c[k >> 2] = g;
+                j = (z + 200) | 0;
+                c[j >> 2] = g;
+                g = c[(n + 108) >> 2] | 0;
+                if (g | 0) c[i >> 2] = c[g >> 2];
+                g = c[(n + 104) >> 2] | 0;
+                if (g | 0) c[j >> 2] = c[g >> 2];
+                g = c[(n + 100) >> 2] | 0;
+                if (g | 0) c[k >> 2] = c[g >> 2];
+              }
+              if (!(x & 65536)) j = 0;
+              else {
+                kA(o, 128, p);
+                c[(z + 212) >> 2] = EK(dI(d, f, o) | 0, f) | 0;
+                oA(o);
+                g = QA(f, 141055) | 0;
+                if ((g | 0) != 0 ? (a[g >> 0] | 0) != 0 : 0) q = 31;
+                else {
+                  g = QA(f, 111477) | 0;
+                  if ((g | 0) != 0 ? (a[g >> 0] | 0) != 0 : 0) q = 31;
+                  else i = 0;
+                }
+                if ((q | 0) == 31) i = EK(g, f) | 0;
+                g = QA(f, 100118) | 0;
+                if ((g | 0) != 0 ? (a[g >> 0] | 0) != 0 : 0) q = 36;
+                else q = 34;
+                do
+                  if ((q | 0) == 34) {
+                    g = QA(f, 100127) | 0;
+                    if (g | 0 ? a[g >> 0] | 0 : 0) {
+                      q = 36;
+                      break;
+                    }
+                    if (i | 0) {
+                      g = D4(i) | 0;
+                      q = 39;
+                    }
+                  }
+                while (0);
+                if ((q | 0) == 36) {
+                  g = EK(g, f) | 0;
+                  q = 39;
+                }
+                if ((q | 0) == 39) c[(z + 208) >> 2] = g;
+                g = QA(f, 100135) | 0;
+                if ((g | 0) != 0 ? (a[g >> 0] | 0) != 0 : 0) q = 44;
+                else q = 42;
+                do
+                  if ((q | 0) == 42) {
+                    g = QA(f, 100145) | 0;
+                    if (g | 0 ? a[g >> 0] | 0 : 0) {
+                      q = 44;
+                      break;
+                    }
+                    if (i | 0) {
+                      g = D4(i) | 0;
+                      q = 47;
+                    }
+                  }
+                while (0);
+                if ((q | 0) == 44) {
+                  g = EK(g, f) | 0;
+                  q = 47;
+                }
+                if ((q | 0) == 47) c[(z + 216) >> 2] = g;
+                g = QA(f, 100154) | 0;
+                if ((g | 0) != 0 ? (a[g >> 0] | 0) != 0 : 0) q = 52;
+                else q = 50;
+                do
+                  if ((q | 0) == 50) {
+                    g = QA(f, 100163) | 0;
+                    if (g | 0 ? a[g >> 0] | 0 : 0) {
+                      q = 52;
+                      break;
+                    }
+                    if (i | 0) c[(z + 220) >> 2] = D4(i) | 0;
+                  }
+                while (0);
+                if ((q | 0) == 52) {
+                  c[(z + 220) >> 2] = EK(g, f) | 0;
+                  q = (z + 260) | 0;
+                  b[q >> 1] = b[q >> 1] | 128;
+                }
+                g = QA(f, 100171) | 0;
+                if ((g | 0) != 0 ? (a[g >> 0] | 0) != 0 : 0) q = 59;
+                else q = 57;
+                do
+                  if ((q | 0) == 57) {
+                    g = QA(f, 100180) | 0;
+                    if (g | 0 ? a[g >> 0] | 0 : 0) {
+                      q = 59;
+                      break;
+                    }
+                    if (i | 0) c[(z + 224) >> 2] = D4(i) | 0;
+                  }
+                while (0);
+                if ((q | 0) == 59) {
+                  c[(z + 224) >> 2] = EK(g, f) | 0;
+                  q = (z + 260) | 0;
+                  b[q >> 1] = b[q >> 1] | 256;
+                }
+                j = i;
+              }
+              do
+                if (x & 8388608) {
+                  g = QA(f, 141088) | 0;
+                  if ((g | 0) != 0 ? (a[g >> 0] | 0) != 0 : 0) i = EK(g, f) | 0;
+                  else i = 0;
+                  g = QA(f, 100188) | 0;
+                  if ((g | 0) != 0 ? (a[g >> 0] | 0) != 0 : 0) {
+                    q = (z + 260) | 0;
+                    b[q >> 1] = b[q >> 1] | 64;
+                    g = EK(g, f) | 0;
+                    q = 72;
+                  } else q = 70;
+                  if ((q | 0) == 70 ? i | 0 : 0) {
+                    g = D4(i) | 0;
+                    q = 72;
+                  }
+                  if ((q | 0) == 72) c[(z + 244) >> 2] = g;
+                  g = QA(f, 100199) | 0;
+                  if ((g | 0) != 0 ? (a[g >> 0] | 0) != 0 : 0) {
+                    g = EK(g, f) | 0;
+                    q = 78;
+                  } else q = 76;
+                  if ((q | 0) == 76 ? i | 0 : 0) {
+                    g = D4(i) | 0;
+                    q = 78;
+                  }
+                  if ((q | 0) == 78) c[(z + 248) >> 2] = g;
+                  g = QA(f, 100211) | 0;
+                  if ((g | 0) != 0 ? (a[g >> 0] | 0) != 0 : 0) {
+                    c[(z + 252) >> 2] = EK(g, f) | 0;
+                    p = (z + 260) | 0;
+                    b[p >> 1] = b[p >> 1] | 16;
+                  } else q = 82;
+                  if ((q | 0) == 82 ? i | 0 : 0) c[(z + 252) >> 2] = D4(i) | 0;
+                  g = QA(f, 100222) | 0;
+                  if (g | 0 ? a[g >> 0] | 0 : 0) {
+                    q = (z + 260) | 0;
+                    b[q >> 1] = b[q >> 1] | 32;
+                    c[(z + 256) >> 2] = EK(g, f) | 0;
+                    break;
+                  }
+                  if (i) c[(z + 256) >> 2] = D4(i) | 0;
+                  else i = 0;
+                } else i = 0;
+              while (0);
+              do
+                if ((x & 4194304) | 0) {
+                  g = QA(f, 141101) | 0;
+                  if ((g | 0) != 0 ? (a[g >> 0] | 0) != 0 : 0) q = 94;
+                  else q = 92;
+                  do
+                    if ((q | 0) == 92) {
+                      g = QA(f, 100233) | 0;
+                      if (g | 0 ? a[g >> 0] | 0 : 0) {
+                        q = 94;
+                        break;
+                      }
+                      g = c[(z + 192) >> 2] | 0;
+                      if (g | 0) c[(z + 228) >> 2] = D4(g) | 0;
+                    }
+                  while (0);
+                  if ((q | 0) == 94) {
+                    p = jJ(g, f) | 0;
+                    c[(z + 228) >> 2] = EK(p, f) | 0;
+                    U1(p);
+                    p = (z + 260) | 0;
+                    b[p >> 1] = b[p >> 1] | 1;
+                  }
+                  g = QA(f, 100245) | 0;
+                  if ((g | 0) != 0 ? (a[g >> 0] | 0) != 0 : 0) {
+                    p = jJ(g, f) | 0;
+                    c[(z + 232) >> 2] = EK(p, f) | 0;
+                    U1(p);
+                    p = (z + 260) | 0;
+                    b[p >> 1] = b[p >> 1] | 8;
+                  } else q = 100;
+                  if ((q | 0) == 100 ? ((r = c[(z + 192) >> 2] | 0), r | 0) : 0) c[(z + 232) >> 2] = D4(r) | 0;
+                  g = QA(f, 100258) | 0;
+                  if ((g | 0) != 0 ? (a[g >> 0] | 0) != 0 : 0) {
+                    r = jJ(g, f) | 0;
+                    c[(z + 236) >> 2] = EK(r, f) | 0;
+                    U1(r);
+                    r = (z + 260) | 0;
+                    b[r >> 1] = b[r >> 1] | 2;
+                  } else q = 105;
+                  if ((q | 0) == 105 ? ((s = c[(z + 200) >> 2] | 0), s | 0) : 0) c[(z + 236) >> 2] = D4(s) | 0;
+                  g = QA(f, 100270) | 0;
+                  if (g | 0 ? a[g >> 0] | 0 : 0) {
+                    s = jJ(g, f) | 0;
+                    c[(z + 240) >> 2] = EK(s, f) | 0;
+                    U1(s);
+                    s = (z + 260) | 0;
+                    b[s >> 1] = b[s >> 1] | 4;
+                    break;
+                  }
+                  g = c[(z + 204) >> 2] | 0;
+                  if (g | 0) c[(z + 240) >> 2] = D4(g) | 0;
+                }
+              while (0);
+              U1(j);
+              U1(i);
+              do
+                if ((x & 4259840) | 0 ? ((u = c[((c[t >> 2] | 0) + 8) >> 2] | 0), u | 0) : 0) {
+                  if (!(c[(z + 208) >> 2] | 0)) {
+                    if ((((x & 524288) | 0) == 0) | ((c[(z + 228) >> 2] | 0) == 0)) break;
+                  } else if (!(x & 524288)) break;
+                  m = +h[((c[(d + 16) >> 2] | 0) + 152) >> 3] * 0.5;
+                  m = m > 2.0 ? m : 2.0;
+                  i = c[(u + 4) >> 2] | 0;
+                  g = 0;
+                  while (1) {
+                    if ((g | 0) >= (i | 0)) break;
+                    kJ(y, w, v, ((c[u >> 2] | 0) + ((g * 48) | 0)) | 0, m);
+                    g = (g + 1) | 0;
+                  }
+                  j = c[v >> 2] | 0;
+                  c[(z + 276) >> 2] = j;
+                  k = c[w >> 2] | 0;
+                  c[(z + 280) >> 2] = k;
+                  if (!(x & 8192)) {
+                    g = 0;
+                    i = 0;
+                    while (1) {
+                      if ((i | 0) >= (j | 0)) break;
+                      g = ((c[(k + (i << 2)) >> 2] | 0) + g) | 0;
+                      i = (i + 1) | 0;
+                    }
+                    y = c[y >> 2] | 0;
+                    NR(d, y, y, g) | 0;
+                    g = y;
+                  } else g = c[y >> 2] | 0;
+                  c[(z + 284) >> 2] = g;
+                  c[(z + 264) >> 2] = 2;
+                  c[(z + 272) >> 2] = g;
+                  c[(z + 268) >> 2] = c[k >> 2];
+                }
+              while (0);
+              aS(d, f);
+              g = c[(z + 208) >> 2] | 0;
+              if (!((g | 0) == 0 ? !(b[(z + 260) >> 1] & 1) : 0))
+                cS(d, g, c[(z + 228) >> 2] | 0, c[(z + 244) >> 2] | 0, c[(z + 212) >> 2] | 0);
+              l = A;
+              return;
+            }
+            function RI(b, e, f) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0.0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0.0,
+                N = 0.0,
+                O = 0,
+                P = 0,
+                Q = 0,
+                R = 0,
+                S = 0;
+              P = l;
+              l = (l + 240) | 0;
+              L = (P + 224) | 0;
+              K = (P + 208) | 0;
+              x = (P + 128) | 0;
+              w = (P + 112) | 0;
+              O = (P + 64) | 0;
+              C = (P + 48) | 0;
+              D = (P + 32) | 0;
+              E = (P + 16) | 0;
+              F = P;
+              G = (P + 192) | 0;
+              H = (P + 176) | 0;
+              y = (P + 160) | 0;
+              B = (P + 144) | 0;
+              c[E >> 2] = 0;
+              c[(E + 4) >> 2] = 0;
+              c[(E + 8) >> 2] = 0;
+              c[(E + 12) >> 2] = 0;
+              M = +h[((c[(b + 16) >> 2] | 0) + 152) >> 3];
+              HT(QA(e, 100032) | 0);
+              J = (e + 16) | 0;
+              a: do
+                if (c[((c[J >> 2] | 0) + 8) >> 2] | 0) {
+                  N = +_O(e, c[47188] | 0, 1.0, 0.0);
+                  k = aP(e, c[47176] | 0, 195059) | 0;
+                  v = (f | 0) != 0;
+                  b: do
+                    if (v) {
+                      g = f;
+                      while (1) {
+                        i = g;
+                        g = (g + 4) | 0;
+                        i = c[i >> 2] | 0;
+                        if (!i) {
+                          o = 0;
+                          break b;
+                        }
+                        if ((a[i >> 0] | 0) != 116) continue;
+                        if (!(s2(i, 111117) | 0)) {
+                          o = 1;
+                          break;
+                        }
+                      }
+                    } else o = 0;
+                  while (0);
+                  j = k;
+                  q = 0;
+                  i = 0;
+                  c: while (1) {
+                    switch (a[j >> 0] | 0) {
+                      case 0:
+                        break c;
+                      case 58: {
+                        g = (q + 1) | 0;
+                        break;
+                      }
+                      case 59: {
+                        g = q;
+                        i = (i + 1) | 0;
+                        break;
+                      }
+                      default:
+                        g = q;
+                    }
+                    j = (j + 1) | 0;
+                    q = g;
+                  }
+                  n = (q | 0) != 0;
+                  if (((i | 0) != 0) & n)
+                    if (!(ZI(b, e, f, k, (q + 1) | 0, N, M) | 0)) break;
+                    else m = 137314;
+                  else m = k;
+                  g = d[((c[J >> 2] | 0) + 115) >> 0] | 0;
+                  if (!(g & 1))
+                    if (!(g & 2))
+                      if (!(g & 8))
+                        if (!(g & 4)) {
+                          i = m;
+                          j = bP(e, c[47177] | 0, m) | 0;
+                        } else {
+                          j = 106296;
+                          g = 106288;
+                          k = 188712;
+                          i = 188712;
+                          p = 18;
+                        }
+                      else {
+                        j = 106280;
+                        g = 106272;
+                        k = 188712;
+                        i = 188712;
+                        p = 18;
+                      }
+                    else {
+                      j = 106264;
+                      g = 106256;
+                      k = 188712;
+                      i = 188712;
+                      p = 18;
+                    }
+                  else {
+                    j = 106248;
+                    g = 106240;
+                    k = 188712;
+                    i = 188712;
+                    p = 18;
+                  }
+                  if ((p | 0) == 18) {
+                    i = c[i >> 2] | 0;
+                    i = bP(e, i, _I(m, g) | 0) | 0;
+                    g = bP(e, c[k >> 2] | 0, j) | 0;
+                    if ((i | 0) == (m | 0)) {
+                      i = m;
+                      j = g;
+                    } else {
+                      hS(b, i);
+                      j = g;
+                    }
+                  }
+                  if ((j | 0) != (m | 0)) jS(b, j);
+                  if ((o << 24) >> 24) {
+                    i = (a[i >> 0] | 0) == 0 ? 137314 : i;
+                    g = (a[j >> 0] | 0) == 0 ? 137314 : j;
+                    hS(b, 137379);
+                    jS(b, i);
+                    u = O;
+                    r = c[c[((c[J >> 2] | 0) + 8) >> 2] >> 2] | 0;
+                    s = (u + 48) | 0;
+                    do {
+                      c[u >> 2] = c[r >> 2];
+                      u = (u + 4) | 0;
+                      r = (r + 4) | 0;
+                    } while ((u | 0) < (s | 0));
+                    J = zO(O, $I(e) | 0, M, 0, 0) | 0;
+                    nS(b, c[(J + 8) >> 2] | 0, c[J >> 2] | 0, 1);
+                    aJ(J);
+                    hS(b, i);
+                    if ((g | 0) != (i | 0)) jS(b, g);
+                    g = c[(O + 8) >> 2] | 0;
+                    if (g | 0) {
+                      I = (O + 16) | 0;
+                      J = c[O >> 2] | 0;
+                      c[K >> 2] = c[I >> 2];
+                      c[(K + 4) >> 2] = c[(I + 4) >> 2];
+                      c[(K + 8) >> 2] = c[(I + 8) >> 2];
+                      c[(K + 12) >> 2] = c[(I + 12) >> 2];
+                      c[L >> 2] = c[J >> 2];
+                      c[(L + 4) >> 2] = c[(J + 4) >> 2];
+                      c[(L + 8) >> 2] = c[(J + 8) >> 2];
+                      c[(L + 12) >> 2] = c[(J + 12) >> 2];
+                      ZH(b, 2, K, L, N, M, g);
+                    }
+                    g = c[(O + 12) >> 2] | 0;
+                    if (!g) break;
+                    J = (O + 32) | 0;
+                    O = ((c[O >> 2] | 0) + (((c[(O + 4) >> 2] | 0) + -1) << 4)) | 0;
+                    c[K >> 2] = c[J >> 2];
+                    c[(K + 4) >> 2] = c[(J + 4) >> 2];
+                    c[(K + 8) >> 2] = c[(J + 8) >> 2];
+                    c[(K + 12) >> 2] = c[(J + 12) >> 2];
+                    c[L >> 2] = c[O >> 2];
+                    c[(L + 4) >> 2] = c[(O + 4) >> 2];
+                    c[(L + 8) >> 2] = c[(O + 8) >> 2];
+                    c[(L + 12) >> 2] = c[(O + 12) >> 2];
+                    ZH(b, 3, K, L, N, M, g);
+                    break;
+                  }
+                  g = c[J >> 2] | 0;
+                  if (!n) {
+                    do
+                      if (!(a[(g + 115) >> 0] & 3)) {
+                        if (a[i >> 0] | 0) {
+                          hS(b, i);
+                          jS(b, j);
+                          break;
+                        }
+                        hS(b, 137314);
+                        if (!(a[j >> 0] | 0)) {
+                          jS(b, 137314);
+                          break;
+                        } else {
+                          jS(b, j);
+                          break;
+                        }
+                      }
+                    while (0);
+                    k = (b + 152) | 0;
+                    m = (O + 4) | 0;
+                    n = (O + 8) | 0;
+                    o = (O + 12) | 0;
+                    p = (O + 32) | 0;
+                    q = (O + 16) | 0;
+                    j = 0;
+                    while (1) {
+                      g = c[((c[J >> 2] | 0) + 8) >> 2] | 0;
+                      if ((j | 0) >= (c[(g + 4) >> 2] | 0)) break a;
+                      u = O;
+                      r = ((c[g >> 2] | 0) + ((j * 48) | 0)) | 0;
+                      s = (u + 48) | 0;
+                      do {
+                        c[u >> 2] = c[r >> 2];
+                        u = (u + 4) | 0;
+                        r = (r + 4) | 0;
+                      } while ((u | 0) < (s | 0));
+                      g = c[O >> 2] | 0;
+                      i = c[m >> 2] | 0;
+                      do
+                        if (!(c[k >> 2] & 16384)) {
+                          pS(b, g, i, 0, 0, 0);
+                          g = c[n >> 2] | 0;
+                          if (g | 0) {
+                            I = c[O >> 2] | 0;
+                            c[K >> 2] = c[q >> 2];
+                            c[(K + 4) >> 2] = c[(q + 4) >> 2];
+                            c[(K + 8) >> 2] = c[(q + 8) >> 2];
+                            c[(K + 12) >> 2] = c[(q + 12) >> 2];
+                            c[L >> 2] = c[I >> 2];
+                            c[(L + 4) >> 2] = c[(I + 4) >> 2];
+                            c[(L + 8) >> 2] = c[(I + 8) >> 2];
+                            c[(L + 12) >> 2] = c[(I + 12) >> 2];
+                            ZH(b, 2, K, L, N, M, g);
+                          }
+                          g = c[o >> 2] | 0;
+                          if (g | 0) {
+                            I = ((c[O >> 2] | 0) + (((c[m >> 2] | 0) + -1) << 4)) | 0;
+                            c[K >> 2] = c[p >> 2];
+                            c[(K + 4) >> 2] = c[(p + 4) >> 2];
+                            c[(K + 8) >> 2] = c[(p + 8) >> 2];
+                            c[(K + 12) >> 2] = c[(p + 12) >> 2];
+                            c[L >> 2] = c[I >> 2];
+                            c[(L + 4) >> 2] = c[(I + 4) >> 2];
+                            c[(L + 8) >> 2] = c[(I + 8) >> 2];
+                            c[(L + 12) >> 2] = c[(I + 12) >> 2];
+                            ZH(b, 3, K, L, N, M, g);
+                          }
+                          if ((c[((c[((c[J >> 2] | 0) + 8) >> 2] | 0) + 4) >> 2] | 0) > 1) {
+                            if (!(c[n >> 2] | 0)) {
+                              if (!(v & ((c[o >> 2] | 0) != 0))) break;
+                            } else if (!v) break;
+                            lS(b, f);
+                          }
+                        } else pS(b, g, i, c[n >> 2] | 0, c[o >> 2] | 0, 0);
+                      while (0);
+                      j = (j + 1) | 0;
+                    }
+                  }
+                  I = c[((c[(g + 8) >> 2] | 0) + 4) >> 2] | 0;
+                  A = (I * 48) | 0;
+                  z = T1(A) | 0;
+                  A = T1(A) | 0;
+                  t = +((q + 2) | 0) * 0.5;
+                  v = (O + 4) | 0;
+                  p = (C + 8) | 0;
+                  q = (D + 8) | 0;
+                  e = (E + 8) | 0;
+                  f = (F + 8) | 0;
+                  o = 0;
+                  while (1) {
+                    if ((o | 0) >= (I | 0)) break;
+                    u = O;
+                    r = ((c[c[((c[J >> 2] | 0) + 8) >> 2] >> 2] | 0) + ((o * 48) | 0)) | 0;
+                    s = (u + 48) | 0;
+                    do {
+                      c[u >> 2] = c[r >> 2];
+                      u = (u + 4) | 0;
+                      r = (r + 4) | 0;
+                    } while ((u | 0) < (s | 0));
+                    g = c[v >> 2] | 0;
+                    c[(z + ((o * 48) | 0) + 4) >> 2] = g;
+                    c[(A + ((o * 48) | 0) + 4) >> 2] = g;
+                    n = g << 4;
+                    m = T1(n) | 0;
+                    c[(z + ((o * 48) | 0)) >> 2] = m;
+                    n = T1(n) | 0;
+                    c[(A + ((o * 48) | 0)) >> 2] = n;
+                    k = c[O >> 2] | 0;
+                    c[F >> 2] = c[k >> 2];
+                    c[(F + 4) >> 2] = c[(k + 4) >> 2];
+                    c[(F + 8) >> 2] = c[(k + 8) >> 2];
+                    c[(F + 12) >> 2] = c[(k + 12) >> 2];
+                    k = 0;
+                    while (1) {
+                      if ((k | 0) >= ((g + -1) | 0)) break;
+                      c[C >> 2] = c[F >> 2];
+                      c[(C + 4) >> 2] = c[(F + 4) >> 2];
+                      c[(C + 8) >> 2] = c[(F + 8) >> 2];
+                      c[(C + 12) >> 2] = c[(F + 12) >> 2];
+                      g = (k + 1) | 0;
+                      j = ((c[O >> 2] | 0) + (g << 4)) | 0;
+                      c[D >> 2] = c[j >> 2];
+                      c[(D + 4) >> 2] = c[(j + 4) >> 2];
+                      c[(D + 8) >> 2] = c[(j + 8) >> 2];
+                      c[(D + 12) >> 2] = c[(j + 12) >> 2];
+                      j = (m + (k << 4)) | 0;
+                      if (!k) {
+                        c[K >> 2] = c[C >> 2];
+                        c[(K + 4) >> 2] = c[(C + 4) >> 2];
+                        c[(K + 8) >> 2] = c[(C + 8) >> 2];
+                        c[(K + 12) >> 2] = c[(C + 12) >> 2];
+                        c[L >> 2] = c[D >> 2];
+                        c[(L + 4) >> 2] = c[(D + 4) >> 2];
+                        c[(L + 8) >> 2] = c[(D + 8) >> 2];
+                        c[(L + 12) >> 2] = c[(D + 12) >> 2];
+                        bJ(G, K, L);
+                        c[j >> 2] = c[G >> 2];
+                        c[(j + 4) >> 2] = c[(G + 4) >> 2];
+                        c[(j + 8) >> 2] = c[(G + 8) >> 2];
+                        c[(j + 12) >> 2] = c[(G + 12) >> 2];
+                      } else {
+                        c[K >> 2] = c[E >> 2];
+                        c[(K + 4) >> 2] = c[(E + 4) >> 2];
+                        c[(K + 8) >> 2] = c[(E + 8) >> 2];
+                        c[(K + 12) >> 2] = c[(E + 12) >> 2];
+                        c[L >> 2] = c[D >> 2];
+                        c[(L + 4) >> 2] = c[(D + 4) >> 2];
+                        c[(L + 8) >> 2] = c[(D + 8) >> 2];
+                        c[(L + 12) >> 2] = c[(D + 12) >> 2];
+                        bJ(H, K, L);
+                        c[j >> 2] = c[H >> 2];
+                        c[(j + 4) >> 2] = c[(H + 4) >> 2];
+                        c[(j + 8) >> 2] = c[(H + 8) >> 2];
+                        c[(j + 12) >> 2] = c[(H + 12) >> 2];
+                      }
+                      R = c[O >> 2] | 0;
+                      s = (k + 2) | 0;
+                      S = (R + (s << 4)) | 0;
+                      c[E >> 2] = c[S >> 2];
+                      c[(E + 4) >> 2] = c[(S + 4) >> 2];
+                      c[(E + 8) >> 2] = c[(S + 8) >> 2];
+                      c[(E + 12) >> 2] = c[(S + 12) >> 2];
+                      u = (k + 3) | 0;
+                      R = (R + (u << 4)) | 0;
+                      c[F >> 2] = c[R >> 2];
+                      c[(F + 4) >> 2] = c[(R + 4) >> 2];
+                      c[(F + 8) >> 2] = c[(R + 8) >> 2];
+                      c[(F + 12) >> 2] = c[(R + 12) >> 2];
+                      Q = (m + (g << 4)) | 0;
+                      r = (m + (s << 4)) | 0;
+                      c[w >> 2] = c[C >> 2];
+                      c[(w + 4) >> 2] = c[(C + 4) >> 2];
+                      c[(w + 8) >> 2] = c[(C + 8) >> 2];
+                      c[(w + 12) >> 2] = c[(C + 12) >> 2];
+                      c[x >> 2] = c[D >> 2];
+                      c[(x + 4) >> 2] = c[(D + 4) >> 2];
+                      c[(x + 8) >> 2] = c[(D + 8) >> 2];
+                      c[(x + 12) >> 2] = c[(D + 12) >> 2];
+                      c[K >> 2] = c[S >> 2];
+                      c[(K + 4) >> 2] = c[(S + 4) >> 2];
+                      c[(K + 8) >> 2] = c[(S + 8) >> 2];
+                      c[(K + 12) >> 2] = c[(S + 12) >> 2];
+                      c[L >> 2] = c[R >> 2];
+                      c[(L + 4) >> 2] = c[(R + 4) >> 2];
+                      c[(L + 8) >> 2] = c[(R + 8) >> 2];
+                      c[(L + 12) >> 2] = c[(R + 12) >> 2];
+                      cJ(y, w, x, K, L);
+                      c[r >> 2] = c[y >> 2];
+                      c[(r + 4) >> 2] = c[(y + 4) >> 2];
+                      c[(r + 8) >> 2] = c[(y + 8) >> 2];
+                      c[(r + 12) >> 2] = c[(y + 12) >> 2];
+                      c[Q >> 2] = c[y >> 2];
+                      c[(Q + 4) >> 2] = c[(y + 4) >> 2];
+                      c[(Q + 8) >> 2] = c[(y + 8) >> 2];
+                      c[(Q + 12) >> 2] = c[(y + 12) >> 2];
+                      h[(n + (k << 4)) >> 3] = +h[C >> 3] - +h[j >> 3] * t;
+                      h[(n + (k << 4) + 8) >> 3] = +h[p >> 3] - +h[(m + (k << 4) + 8) >> 3] * t;
+                      h[(n + (g << 4)) >> 3] = +h[D >> 3] - +h[Q >> 3] * t;
+                      h[(n + (g << 4) + 8) >> 3] = +h[q >> 3] - +h[(m + (g << 4) + 8) >> 3] * t;
+                      h[(n + (s << 4)) >> 3] = +h[E >> 3] - +h[r >> 3] * t;
+                      h[(n + (s << 4) + 8) >> 3] = +h[e >> 3] - +h[(m + (s << 4) + 8) >> 3] * t;
+                      k = u;
+                      g = c[v >> 2] | 0;
+                    }
+                    S = (m + (k << 4)) | 0;
+                    c[K >> 2] = c[E >> 2];
+                    c[(K + 4) >> 2] = c[(E + 4) >> 2];
+                    c[(K + 8) >> 2] = c[(E + 8) >> 2];
+                    c[(K + 12) >> 2] = c[(E + 12) >> 2];
+                    c[L >> 2] = c[F >> 2];
+                    c[(L + 4) >> 2] = c[(F + 4) >> 2];
+                    c[(L + 8) >> 2] = c[(F + 8) >> 2];
+                    c[(L + 12) >> 2] = c[(F + 12) >> 2];
+                    bJ(B, K, L);
+                    c[S >> 2] = c[B >> 2];
+                    c[(S + 4) >> 2] = c[(B + 4) >> 2];
+                    c[(S + 8) >> 2] = c[(B + 8) >> 2];
+                    c[(S + 12) >> 2] = c[(B + 12) >> 2];
+                    h[(n + (k << 4)) >> 3] = +h[F >> 3] - +h[S >> 3] * t;
+                    h[(n + (k << 4) + 8) >> 3] = +h[f >> 3] - +h[(m + (k << 4) + 8) >> 3] * t;
+                    o = (o + 1) | 0;
+                  }
+                  s = D4(i) | 0;
+                  f = 0;
+                  r = i;
+                  g = i;
+                  j = i;
+                  i = s;
+                  while (1) {
+                    i = A4(i, 107984) | 0;
+                    if (!i) break;
+                    e = (a[i >> 0] | 0) == 0 ? 137314 : i;
+                    if ((e | 0) != (j | 0))
+                      if (!(a[((c[J >> 2] | 0) + 115) >> 0] & 3)) {
+                        hS(b, e);
+                        jS(b, e);
+                        j = e;
+                      } else j = e;
+                    m = (f | 0) == 0;
+                    n = f >>> 0 < 2;
+                    i = 0;
+                    while (1) {
+                      if ((i | 0) >= (I | 0)) break;
+                      o = c[(A + ((i * 48) | 0)) >> 2] | 0;
+                      p = c[(z + ((i * 48) | 0)) >> 2] | 0;
+                      q = c[(A + ((i * 48) | 0) + 4) >> 2] | 0;
+                      k = 0;
+                      while (1) {
+                        if ((k | 0) >= (q | 0)) break;
+                        S = (o + (k << 4)) | 0;
+                        h[S >> 3] = +h[S >> 3] + +h[(p + (k << 4)) >> 3];
+                        S = (o + (k << 4) + 8) | 0;
+                        h[S >> 3] = +h[S >> 3] + +h[(p + (k << 4) + 8) >> 3];
+                        k = (k + 1) | 0;
+                      }
+                      pS(b, o, q, 0, 0, 0);
+                      i = (i + 1) | 0;
+                    }
+                    f = (f + 1) | 0;
+                    r = m ? e : r;
+                    g = n ? e : g;
+                    i = 0;
+                  }
+                  i = c[(O + 8) >> 2] | 0;
+                  if (!i) i = 0;
+                  else {
+                    if (g) {
+                      if (!(a[((c[J >> 2] | 0) + 115) >> 0] & 3)) {
+                        hS(b, g);
+                        jS(b, g);
+                      }
+                    } else g = 0;
+                    R = (O + 16) | 0;
+                    S = c[O >> 2] | 0;
+                    c[K >> 2] = c[R >> 2];
+                    c[(K + 4) >> 2] = c[(R + 4) >> 2];
+                    c[(K + 8) >> 2] = c[(R + 8) >> 2];
+                    c[(K + 12) >> 2] = c[(R + 12) >> 2];
+                    c[L >> 2] = c[S >> 2];
+                    c[(L + 4) >> 2] = c[(S + 4) >> 2];
+                    c[(L + 8) >> 2] = c[(S + 8) >> 2];
+                    c[(L + 12) >> 2] = c[(S + 12) >> 2];
+                    ZH(b, 2, K, L, N, M, i);
+                    i = g;
+                  }
+                  j = (O + 12) | 0;
+                  g = c[j >> 2] | 0;
+                  if (g | 0) {
+                    if ((i | 0) != (r | 0) ? (a[((c[J >> 2] | 0) + 115) >> 0] & 3) == 0 : 0) {
+                      hS(b, r);
+                      jS(b, r);
+                      g = c[j >> 2] | 0;
+                    }
+                    R = (O + 32) | 0;
+                    S = ((c[O >> 2] | 0) + (((c[v >> 2] | 0) + -1) << 4)) | 0;
+                    c[K >> 2] = c[R >> 2];
+                    c[(K + 4) >> 2] = c[(R + 4) >> 2];
+                    c[(K + 8) >> 2] = c[(R + 8) >> 2];
+                    c[(K + 12) >> 2] = c[(R + 12) >> 2];
+                    c[L >> 2] = c[S >> 2];
+                    c[(L + 4) >> 2] = c[(S + 4) >> 2];
+                    c[(L + 8) >> 2] = c[(S + 8) >> 2];
+                    c[(L + 12) >> 2] = c[(S + 12) >> 2];
+                    ZH(b, 3, K, L, N, M, g);
+                  }
+                  U1(s);
+                  g = 0;
+                  while (1) {
+                    if ((g | 0) >= (I | 0)) break;
+                    U1(c[(z + ((g * 48) | 0)) >> 2] | 0);
+                    U1(c[(A + ((g * 48) | 0)) >> 2] | 0);
+                    g = (g + 1) | 0;
+                  }
+                  U1(z);
+                  U1(A);
+                }
+              while (0);
+              l = P;
+              return;
+            }
+            function SI(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0;
+              x = l;
+              l = (l + 64) | 0;
+              r = (x + 48) | 0;
+              u = (x + 32) | 0;
+              t = (x + 16) | 0;
+              s = x;
+              w = c[(a + 16) >> 2] | 0;
+              v = c[(w + 8) >> 2] | 0;
+              q = (w + 208) | 0;
+              if (!((c[q >> 2] | 0) == 0 ? !(b[(w + 260) >> 1] & 1) : 0)) d = 3;
+              a: do
+                if ((d | 0) == 3 ? (dS(a), (p = (w + 276) | 0), (e = c[p >> 2] | 0), e | 0) : 0) {
+                  h = (w + 280) | 0;
+                  d = c[h >> 2] | 0;
+                  i = (w + 268) | 0;
+                  j = (w + 284) | 0;
+                  k = (w + 272) | 0;
+                  m = (w + 228) | 0;
+                  n = (w + 244) | 0;
+                  o = (w + 212) | 0;
+                  f = c[d >> 2] | 0;
+                  g = 1;
+                  while (1) {
+                    if ((g | 0) >= (e | 0)) break a;
+                    c[i >> 2] = c[(d + (g << 2)) >> 2];
+                    c[k >> 2] = (c[j >> 2] | 0) + (f << 4);
+                    cS(a, c[q >> 2] | 0, c[m >> 2] | 0, c[n >> 2] | 0, c[o >> 2] | 0);
+                    dS(a);
+                    y = c[h >> 2] | 0;
+                    f = ((c[(y + (g << 2)) >> 2] | 0) + f) | 0;
+                    g = (g + 1) | 0;
+                    e = c[p >> 2] | 0;
+                    d = y;
+                  }
+                }
+              while (0);
+              c[(w + 268) >> 2] = 0;
+              c[(w + 272) >> 2] = 0;
+              q = (v + 16) | 0;
+              d = c[q >> 2] | 0;
+              e = c[(d + 8) >> 2] | 0;
+              if (!e) f = (w + 260) | 0;
+              else {
+                p = c[e >> 2] | 0;
+                d = c[p >> 2] | 0;
+                y = c[(p + 8) >> 2] | 0;
+                o = (p + 16) | 0;
+                c[t >> 2] = c[o >> 2];
+                c[(t + 4) >> 2] = c[(o + 4) >> 2];
+                c[(t + 8) >> 2] = c[(o + 8) >> 2];
+                c[(t + 12) >> 2] = c[(o + 12) >> 2];
+                p = (p + 32) | 0;
+                c[s >> 2] = c[p >> 2];
+                c[(s + 4) >> 2] = c[(p + 4) >> 2];
+                c[(s + 8) >> 2] = c[(p + 8) >> 2];
+                c[(s + 12) >> 2] = c[(p + 12) >> 2];
+                if (!y) {
+                  c[u >> 2] = c[d >> 2];
+                  c[(u + 4) >> 2] = c[(d + 4) >> 2];
+                  c[(u + 8) >> 2] = c[(d + 8) >> 2];
+                  c[(u + 12) >> 2] = c[(d + 12) >> 2];
+                } else {
+                  c[u >> 2] = c[t >> 2];
+                  c[(u + 4) >> 2] = c[(t + 4) >> 2];
+                  c[(u + 8) >> 2] = c[(t + 8) >> 2];
+                  c[(u + 12) >> 2] = c[(t + 12) >> 2];
+                }
+                f = (w + 260) | 0;
+                p = b[f >> 1] | 0;
+                o = c[(w + 220) >> 2] | 0;
+                c[r >> 2] = c[u >> 2];
+                c[(r + 4) >> 2] = c[(u + 4) >> 2];
+                c[(r + 8) >> 2] = c[(u + 8) >> 2];
+                c[(r + 12) >> 2] = c[(u + 12) >> 2];
+                TI(
+                  a,
+                  r,
+                  (((((p << 8) & 65535) << 16) >> 16) >> 15) & 255,
+                  o,
+                  (((((p << 14) & 65535) << 16) >> 16) >> 15) & 255
+                );
+                p = c[((c[q >> 2] | 0) + 8) >> 2] | 0;
+                o = c[p >> 2] | 0;
+                p = ((c[(p + 4) >> 2] | 0) + -1) | 0;
+                d = c[(o + ((p * 48) | 0)) >> 2] | 0;
+                e = c[(o + ((p * 48) | 0) + 4) >> 2] | 0;
+                y = c[(o + ((p * 48) | 0) + 12) >> 2] | 0;
+                n = (o + ((p * 48) | 0) + 16) | 0;
+                c[t >> 2] = c[n >> 2];
+                c[(t + 4) >> 2] = c[(n + 4) >> 2];
+                c[(t + 8) >> 2] = c[(n + 8) >> 2];
+                c[(t + 12) >> 2] = c[(n + 12) >> 2];
+                t = (o + ((p * 48) | 0) + 32) | 0;
+                c[s >> 2] = c[t >> 2];
+                c[(s + 4) >> 2] = c[(t + 4) >> 2];
+                c[(s + 8) >> 2] = c[(t + 8) >> 2];
+                c[(s + 12) >> 2] = c[(t + 12) >> 2];
+                if (!y) {
+                  y = (d + ((e + -1) << 4)) | 0;
+                  c[u >> 2] = c[y >> 2];
+                  c[(u + 4) >> 2] = c[(y + 4) >> 2];
+                  c[(u + 8) >> 2] = c[(y + 8) >> 2];
+                  c[(u + 12) >> 2] = c[(y + 12) >> 2];
+                } else {
+                  c[u >> 2] = c[s >> 2];
+                  c[(u + 4) >> 2] = c[(s + 4) >> 2];
+                  c[(u + 8) >> 2] = c[(s + 8) >> 2];
+                  c[(u + 12) >> 2] = c[(s + 12) >> 2];
+                }
+                d = b[f >> 1] | 0;
+                y = c[(w + 224) >> 2] | 0;
+                c[r >> 2] = c[u >> 2];
+                c[(r + 4) >> 2] = c[(u + 4) >> 2];
+                c[(r + 8) >> 2] = c[(u + 8) >> 2];
+                c[(r + 12) >> 2] = c[(u + 12) >> 2];
+                TI(
+                  a,
+                  r,
+                  (((((d << 7) & 65535) << 16) >> 16) >> 15) & 255,
+                  y,
+                  (((((d << 13) & 65535) << 16) >> 16) >> 15) & 255
+                );
+                d = c[q >> 2] | 0;
+              }
+              e = c[(d + 96) >> 2] | 0;
+              g = ((((((b[f >> 1] << 12) & 65535) << 16) >> 16) >> 15) << 16) >> 16;
+              m = (w + 216) | 0;
+              h = c[m >> 2] | 0;
+              n = (w + 232) | 0;
+              i = c[n >> 2] | 0;
+              o = (w + 248) | 0;
+              j = c[o >> 2] | 0;
+              p = (w + 212) | 0;
+              k = c[p >> 2] | 0;
+              if (!(((dP(aP(v, c[47186] | 0, 137308) | 0) | 0) << 24) >> 24)) d = 0;
+              else d = c[((c[q >> 2] | 0) + 8) >> 2] | 0;
+              UI(a, e, 11, g, h, i, j, k, d);
+              j = c[((c[q >> 2] | 0) + 108) >> 2] | 0;
+              k = ((((((b[f >> 1] << 12) & 65535) << 16) >> 16) >> 15) << 16) >> 16;
+              i = c[m >> 2] | 0;
+              h = c[n >> 2] | 0;
+              e = c[o >> 2] | 0;
+              g = c[p >> 2] | 0;
+              if (!(((dP(aP(v, c[47186] | 0, 137308) | 0) | 0) << 24) >> 24)) d = 0;
+              else d = c[((c[q >> 2] | 0) + 8) >> 2] | 0;
+              UI(a, j, 11, k, i, h, e, g, d);
+              UI(
+                a,
+                c[((c[q >> 2] | 0) + 100) >> 2] | 0,
+                7,
+                ((((((b[f >> 1] << 13) & 65535) << 16) >> 16) >> 15) << 16) >> 16,
+                c[(w + 224) >> 2] | 0,
+                c[(w + 240) >> 2] | 0,
+                c[(w + 256) >> 2] | 0,
+                c[p >> 2] | 0,
+                0
+              );
+              UI(
+                a,
+                c[((c[q >> 2] | 0) + 104) >> 2] | 0,
+                6,
+                ((((((b[f >> 1] << 14) & 65535) << 16) >> 16) >> 15) << 16) >> 16,
+                c[(w + 220) >> 2] | 0,
+                c[(w + 236) >> 2] | 0,
+                c[(w + 252) >> 2] | 0,
+                c[p >> 2] | 0,
+                0
+              );
+              bS(a);
+              bI(a);
+              l = x;
+              return;
+            }
+            function TI(a, d, e, f, g) {
+              a = a | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 16) | 0;
+              h = j;
+              i = c[(a + 16) >> 2] | 0;
+              if (!((e << 24) >> 24)) f = c[(i + 208) >> 2] | 0;
+              if (!((g << 24) >> 24 == 0 ? ((f | 0) == 0 ? (b[(i + 260) >> 1] & 1) == 0 : 0) : 0)) {
+                c[h >> 2] = c[d >> 2];
+                c[(h + 4) >> 2] = c[(d + 4) >> 2];
+                c[(h + 8) >> 2] = c[(d + 8) >> 2];
+                c[(h + 12) >> 2] = c[(d + 12) >> 2];
+                YI(a, h);
+              }
+              l = j;
+              return;
+            }
+            function UI(b, d, e, f, g, h, i, j, k) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              i = i | 0;
+              j = j | 0;
+              k = k | 0;
+              var m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0;
+              r = l;
+              l = (l + 16) | 0;
+              o = r;
+              q = c[(b + 152) >> 2] | 0;
+              if (d | 0 ? a[(d + 81) >> 0] | 0 : 0) {
+                if (!j) n = 0;
+                else {
+                  n = JK(((l2(j) | 0) + 11) | 0) | 0;
+                  switch (e | 0) {
+                    case 11: {
+                      m = 108224;
+                      break;
+                    }
+                    case 7: {
+                      m = 101583;
+                      break;
+                    }
+                    case 6: {
+                      m = 101593;
+                      break;
+                    }
+                    default:
+                      qa(138394, 99906, 2730, 100044);
+                  }
+                  c[o >> 2] = j;
+                  c[(o + 4) >> 2] = m;
+                  m4(n, 100060, o) | 0;
+                }
+                o = (b + 16) | 0;
+                j = ((c[o >> 2] | 0) + 12) | 0;
+                p = c[j >> 2] | 0;
+                c[j >> 2] = e;
+                j = ((f | 0) != 0) | ((g | 0) != 0);
+                m = ((q & 4) | 0) == 0;
+                if (j & m) {
+                  VI(b, d);
+                  cS(b, g, h, i, n);
+                }
+                DK(b, e, d);
+                if (k | 0) WI(b, d, k);
+                if (j) {
+                  if (!m) {
+                    VI(b, d);
+                    cS(b, g, h, i, n);
+                  }
+                  dS(b);
+                }
+                U1(n);
+                c[((c[o >> 2] | 0) + 12) >> 2] = p;
+              }
+              l = r;
+              return;
+            }
+            function VI(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0;
+              d = c[(a + 16) >> 2] | 0;
+              e = c[(a + 152) >> 2] | 0;
+              if ((e & 4259840) | 0) {
+                f = e & 131072;
+                i = (f >>> 16) ^ 2;
+                c[(d + 264) >> 2] = i;
+                j = (d + 268) | 0;
+                c[j >> 2] = i + 2;
+                i = (d + 272) | 0;
+                U1(c[i >> 2] | 0);
+                d = JK(c[j >> 2] << 4) | 0;
+                c[i >> 2] = d;
+                i = (b + 56) | 0;
+                j = (b + 24) | 0;
+                h[d >> 3] = +h[i >> 3] - +h[j >> 3] * 0.5;
+                g = (b + 64) | 0;
+                b = (b + 32) | 0;
+                h[(d + 8) >> 3] = +h[g >> 3] - +h[b >> 3] * 0.5;
+                h[(d + 16) >> 3] = +h[j >> 3] * 0.5 + +h[i >> 3];
+                h[(d + 24) >> 3] = +h[b >> 3] * 0.5 + +h[g >> 3];
+                if (!(e & 8192)) NR(a, d, d, 2) | 0;
+                if (!f) jK(d);
+              }
+              return;
+            }
+            function WI(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0.0;
+              o = l;
+              l = (l + 96) | 0;
+              g = (o + 80) | 0;
+              i = (o + 32) | 0;
+              j = (o + 16) | 0;
+              k = o;
+              f = c[d >> 2] | 0;
+              while (1) {
+                m = a[f >> 0] | 0;
+                if (!((m << 24) >> 24)) break;
+                if (!(S2(m & 255) | 0)) {
+                  n = 4;
+                  break;
+                } else f = (f + 1) | 0;
+              }
+              if ((n | 0) == 4) {
+                p = +h[(d + 24) >> 3];
+                m = (d + 56) | 0;
+                XI(i, +h[m >> 3] + p * 0.5, +h[(d + 64) >> 3] - +h[(d + 32) >> 3] * 0.5);
+                n = (i + 16) | 0;
+                XI(j, +h[i >> 3] - p, +h[(i + 8) >> 3]);
+                c[n >> 2] = c[j >> 2];
+                c[(n + 4) >> 2] = c[(j + 4) >> 2];
+                c[(n + 8) >> 2] = c[(j + 8) >> 2];
+                c[(n + 12) >> 2] = c[(j + 12) >> 2];
+                n = (i + 32) | 0;
+                c[g >> 2] = c[m >> 2];
+                c[(g + 4) >> 2] = c[(m + 4) >> 2];
+                c[(g + 8) >> 2] = c[(m + 8) >> 2];
+                c[(g + 12) >> 2] = c[(m + 12) >> 2];
+                qP(k, e, g);
+                c[n >> 2] = c[k >> 2];
+                c[(n + 4) >> 2] = c[(k + 4) >> 2];
+                c[(n + 8) >> 2] = c[(k + 8) >> 2];
+                c[(n + 12) >> 2] = c[(k + 12) >> 2];
+                lS(b, c[((c[b >> 2] | 0) + 336) >> 2] | 0);
+                hS(b, c[(d + 8) >> 2] | 0);
+                qS(b, i, 3);
+              }
+              l = o;
+              return;
+            }
+            function XI(a, b, c) {
+              a = a | 0;
+              b = +b;
+              c = +c;
+              h[a >> 3] = b;
+              h[(a + 8) >> 3] = c;
+              return;
+            }
+            function YI(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0;
+              d = c[(a + 16) >> 2] | 0;
+              e = c[(a + 152) >> 2] | 0;
+              if ((e & 4259840) | 0) {
+                f = e & 131072;
+                j = (f >>> 16) ^ 2;
+                c[(d + 264) >> 2] = j;
+                k = (d + 268) | 0;
+                c[k >> 2] = j + 2;
+                j = (d + 272) | 0;
+                U1(c[j >> 2] | 0);
+                d = JK(c[k >> 2] << 4) | 0;
+                c[j >> 2] = d;
+                i = +h[b >> 3];
+                h[d >> 3] = i + -3.0;
+                g = +h[(b + 8) >> 3];
+                h[(d + 8) >> 3] = g + -3.0;
+                h[(d + 16) >> 3] = i + 3.0;
+                h[(d + 24) >> 3] = g + 3.0;
+                if (!(e & 8192)) NR(a, d, d, 2) | 0;
+                if (!f) jK(d);
+              }
+              return;
+            }
+            function ZI(a, b, d, e, f, h, i) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              h = +h;
+              i = +i;
+              var j = 0,
+                k = 0,
+                m = 0.0,
+                n = 0.0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0;
+              J = l;
+              l = (l + 256) | 0;
+              D = (J + 224) | 0;
+              C = (J + 208) | 0;
+              j = (J + 192) | 0;
+              F = (J + 144) | 0;
+              G = (J + 96) | 0;
+              H = (J + 48) | 0;
+              E = J;
+              k = (J + 240) | 0;
+              e = gI(e, f, k) | 0;
+              if ((e | 0) > 1) {
+                z = (b + 48) | 0;
+                A = xC(c[((((c[b >> 2] & 3) | 0) == 3 ? b : z) + 40) >> 2] | 0) | 0;
+                z = KB(c[((((c[b >> 2] & 3) | 0) == 3 ? b : z) + 40) >> 2] | 0) | 0;
+                A = (xB(A) | 0) != 0;
+                B = KB(c[((((c[b >> 2] & 3) | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0) | 0;
+                c[j >> 2] = z;
+                c[(j + 4) >> 2] = A ? 100079 : 100084;
+                c[(j + 8) >> 2] = B;
+                gA(3, 100089, j) | 0;
+                if ((e | 0) == 2) e = 1;
+                else I = 4;
+              } else if ((e | 0) == 1) e = 1;
+              else I = 4;
+              if ((I | 0) == 4) {
+                B = (b + 16) | 0;
+                r = c[k >> 2] | 0;
+                s = (r + 8) | 0;
+                t = (H + 4) | 0;
+                u = (F + 8) | 0;
+                v = (F + 12) | 0;
+                w = (d | 0) != 0;
+                q = (d | 0) == 0;
+                x = (F + 32) | 0;
+                y = (F + 4) | 0;
+                z = (F + 16) | 0;
+                A = (E + 4) | 0;
+                e = 0;
+                p = 0;
+                while (1) {
+                  f = c[((c[B >> 2] | 0) + 8) >> 2] | 0;
+                  if ((p | 0) >= (c[(f + 4) >> 2] | 0)) break;
+                  j = F;
+                  f = ((c[f >> 2] | 0) + ((p * 48) | 0)) | 0;
+                  b = (j + 48) | 0;
+                  do {
+                    c[j >> 2] = c[f >> 2];
+                    j = (j + 4) | 0;
+                    f = (f + 4) | 0;
+                  } while ((j | 0) < (b | 0));
+                  b = 1;
+                  m = 1.0;
+                  o = c[s >> 2] | 0;
+                  a: while (1) {
+                    f = c[o >> 2] | 0;
+                    if (!f) break;
+                    k = (o + 4) | 0;
+                    n = +g[k >> 2];
+                    do
+                      if ((n < 1.0e-5) & (n > -1.0e-5)) f = b;
+                      else {
+                        hS(a, f);
+                        n = +g[k >> 2];
+                        m = m - n;
+                        e = c[o >> 2] | 0;
+                        if (b | 0) {
+                          hJ(F, n, H, E);
+                          k = c[H >> 2] | 0;
+                          pS(a, k, c[t >> 2] | 0, 0, 0, 0);
+                          U1(k);
+                          if ((m < 1.0e-5) & (m > -1.0e-5)) {
+                            I = 11;
+                            break a;
+                          } else {
+                            f = 0;
+                            break;
+                          }
+                        }
+                        if ((m < 1.0e-5) & (m > -1.0e-5)) {
+                          I = 13;
+                          break a;
+                        }
+                        j = G;
+                        f = E;
+                        b = (j + 48) | 0;
+                        do {
+                          c[j >> 2] = c[f >> 2];
+                          j = (j + 4) | 0;
+                          f = (f + 4) | 0;
+                        } while ((j | 0) < (b | 0));
+                        n = +g[k >> 2];
+                        hJ(G, n / (m + n), H, E);
+                        U1(c[G >> 2] | 0);
+                        f = c[H >> 2] | 0;
+                        pS(a, f, c[t >> 2] | 0, 0, 0, 0);
+                        U1(f);
+                        f = 0;
+                      }
+                    while (0);
+                    b = f;
+                    o = (o + 12) | 0;
+                  }
+                  if ((I | 0) == 11) {
+                    I = 0;
+                    U1(c[E >> 2] | 0);
+                  } else if ((I | 0) == 13) {
+                    I = 0;
+                    o = c[E >> 2] | 0;
+                    pS(a, o, c[A >> 2] | 0, 0, 0, 0);
+                    U1(o);
+                  }
+                  if (c[u >> 2] | 0) {
+                    hS(a, c[c[s >> 2] >> 2] | 0);
+                    jS(a, c[c[s >> 2] >> 2] | 0);
+                    k = c[F >> 2] | 0;
+                    o = c[u >> 2] | 0;
+                    c[C >> 2] = c[z >> 2];
+                    c[(C + 4) >> 2] = c[(z + 4) >> 2];
+                    c[(C + 8) >> 2] = c[(z + 8) >> 2];
+                    c[(C + 12) >> 2] = c[(z + 12) >> 2];
+                    c[D >> 2] = c[k >> 2];
+                    c[(D + 4) >> 2] = c[(k + 4) >> 2];
+                    c[(D + 8) >> 2] = c[(k + 8) >> 2];
+                    c[(D + 12) >> 2] = c[(k + 12) >> 2];
+                    ZH(a, 2, C, D, h, i, o);
+                  }
+                  if (c[v >> 2] | 0) {
+                    hS(a, e);
+                    jS(a, e);
+                    k = ((c[F >> 2] | 0) + (((c[y >> 2] | 0) + -1) << 4)) | 0;
+                    o = c[v >> 2] | 0;
+                    c[C >> 2] = c[x >> 2];
+                    c[(C + 4) >> 2] = c[(x + 4) >> 2];
+                    c[(C + 8) >> 2] = c[(x + 8) >> 2];
+                    c[(C + 12) >> 2] = c[(x + 12) >> 2];
+                    c[D >> 2] = c[k >> 2];
+                    c[(D + 4) >> 2] = c[(k + 4) >> 2];
+                    c[(D + 8) >> 2] = c[(k + 8) >> 2];
+                    c[(D + 12) >> 2] = c[(k + 12) >> 2];
+                    ZH(a, 3, C, D, h, i, o);
+                  }
+                  do
+                    if ((c[((c[((c[B >> 2] | 0) + 8) >> 2] | 0) + 4) >> 2] | 0) > 1) {
+                      if (!(c[u >> 2] | 0)) {
+                        if (!(w & ((c[v >> 2] | 0) != 0))) break;
+                      } else if (q) break;
+                      lS(a, d);
+                    }
+                  while (0);
+                  p = (p + 1) | 0;
+                }
+                hI(r);
+                e = 0;
+              }
+              l = J;
+              return e | 0;
+            }
+            function _I(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = 1;
+              a: while (1) {
+                switch (a[b >> 0] | 0) {
+                  case 0:
+                    break a;
+                  case 58: {
+                    e = (e + 1) | 0;
+                    break;
+                  }
+                  default: {
+                  }
+                }
+                b = (b + 1) | 0;
+              }
+              f = O(((l2(d) | 0) + 1) | 0, e) | 0;
+              b = (f + 10) | 0;
+              if ((c[47121] | 0) < (f | 0)) {
+                c[47121] = b;
+                b = W1(c[47122] | 0, b) | 0;
+                c[47122] = b;
+              } else b = c[47122] | 0;
+              r3(b, d) | 0;
+              while (1) {
+                e = (e + -1) | 0;
+                b = c[47122] | 0;
+                if (!e) break;
+                f = (b + (l2(b) | 0)) | 0;
+                a[f >> 0] = 58;
+                a[(f + 1) >> 0] = 0;
+                F4(b, d) | 0;
+              }
+              return b | 0;
+            }
+            function $I(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = c[47184] | 0;
+              a: do
+                if (!d) e = 7;
+                else {
+                  d = RA(b, d) | 0;
+                  switch (a[d >> 0] | 0) {
+                    case 110:
+                      if (!(s2(d, 135709) | 0)) {
+                        d = 1;
+                        break a;
+                      } else {
+                        e = 7;
+                        break a;
+                      }
+                    case 102:
+                      if (!(s2(d, 100066) | 0)) {
+                        d = 2;
+                        break a;
+                      } else {
+                        e = 7;
+                        break a;
+                      }
+                    case 98: {
+                      if (!(s2(d, 100074) | 0)) {
+                        d = 3;
+                        break a;
+                      }
+                      if (!(s2(d, 111221) | 0)) {
+                        d = 4;
+                        break a;
+                      } else {
+                        e = 7;
+                        break a;
+                      }
+                    }
+                    default: {
+                      e = 7;
+                      break a;
+                    }
+                  }
+                }
+              while (0);
+              if ((e | 0) == 7) {
+                d = (xB(xC(c[((((c[b >> 2] & 3) | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0) | 0) | 0) != 0;
+                d = d ? 2 : 1;
+              }
+              return d | 0;
+            }
+            function aJ(a) {
+              a = a | 0;
+              if (a | 0) {
+                U1(c[(a + 8) >> 2] | 0);
+                U1(a);
+              }
+              return;
+            }
+            function bJ(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0.0;
+              e = +h[b >> 3] - +h[c >> 3];
+              f = +h[(b + 8) >> 3] - +h[(c + 8) >> 3];
+              d = 2.0 / +C(+(e * e + 0.0001 + f * f));
+              h[a >> 3] = d * f;
+              h[(a + 8) >> 3] = -(e * d);
+              return;
+            }
+            function cJ(a, b, c, d, e) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0;
+              g = +h[c >> 3] - +h[d >> 3];
+              i = +h[(c + 8) >> 3] - +h[(d + 8) >> 3];
+              f = +C(+(i * i + g * g));
+              if (f < 0.0001) {
+                j = +h[b >> 3] - +h[e >> 3];
+                f = +h[(b + 8) >> 3] - +h[(e + 8) >> 3];
+                i = f;
+                g = j;
+                f = +C(+(j * j + 0.0001 + f * f));
+              }
+              j = 2.0 / f;
+              h[a >> 3] = i * j;
+              h[(a + 8) >> 3] = -(j * g);
+              return;
+            }
+            function dJ(a, b, c) {
+              a = +a;
+              b = +b;
+              c = +c;
+              return +(c * 0.5 * (1.0 - a / b));
+            }
+            function eJ(a, b, c) {
+              a = +a;
+              b = +b;
+              c = +c;
+              return +(c * 0.5);
+            }
+            function fJ(a, b, c) {
+              a = +a;
+              b = +b;
+              c = +c;
+              return +(c * 0.5 * (a / b));
+            }
+            function gJ(a, b, c) {
+              a = +a;
+              b = +b;
+              c = +c;
+              b = a / b;
+              return +((!(b <= 0.5) ? 1.0 - b : b) * c);
+            }
+            function hJ(a, b, d, e) {
+              a = a | 0;
+              b = +b;
+              d = d | 0;
+              e = e | 0;
+              var f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0.0,
+                r = 0,
+                s = 0;
+              p = l;
+              l = (l + 16) | 0;
+              o = p;
+              n = c[(a + 4) >> 2] | 0;
+              j = (((n + -1) | 0) / 3) | 0;
+              if (((n + -4) | 0) >>> 0 < 3) {
+                c[(d + 4) >> 2] = 4;
+                c[d >> 2] = JK(64) | 0;
+                c[(e + 4) >> 2] = 4;
+                n = JK(64) | 0;
+                c[e >> 2] = n;
+                kP(o, c[a >> 2] | 0, 3, b, c[d >> 2] | 0, n);
+              } else {
+                n = JK(j << 3) | 0;
+                g = 0;
+                i = c[a >> 2] | 0;
+                f = 0.0;
+                while (1) {
+                  if ((g | 0) >= (j | 0)) break;
+                  q = +iJ(i);
+                  h[(n + (g << 3)) >> 3] = q;
+                  g = (g + 1) | 0;
+                  i = (i + 48) | 0;
+                  f = q + f;
+                }
+                b = f * b;
+                m = 0;
+                f = 0.0;
+                while (1) {
+                  if ((j | 0) <= (m | 0)) break;
+                  f = +h[(n + (m << 3)) >> 3] + f;
+                  if (f >= b) break;
+                  m = (m + 1) | 0;
+                }
+                k = (m * 3) | 0;
+                g = (k + 4) | 0;
+                i = (d + 4) | 0;
+                c[i >> 2] = g;
+                c[d >> 2] = JK(g << 4) | 0;
+                g = (((((j - m) | 0) * 3) | 0) + 1) | 0;
+                j = (e + 4) | 0;
+                c[j >> 2] = g;
+                c[e >> 2] = JK(g << 4) | 0;
+                g = 0;
+                while (1) {
+                  if ((g | 0) >= (c[i >> 2] | 0)) break;
+                  r = ((c[d >> 2] | 0) + (g << 4)) | 0;
+                  s = ((c[a >> 2] | 0) + (g << 4)) | 0;
+                  c[r >> 2] = c[s >> 2];
+                  c[(r + 4) >> 2] = c[(s + 4) >> 2];
+                  c[(r + 8) >> 2] = c[(s + 8) >> 2];
+                  c[(r + 12) >> 2] = c[(s + 12) >> 2];
+                  g = (g + 1) | 0;
+                }
+                g = (g + -4) | 0;
+                i = 0;
+                while (1) {
+                  if ((i | 0) >= (c[j >> 2] | 0)) break;
+                  s = ((c[e >> 2] | 0) + (i << 4)) | 0;
+                  r = ((c[a >> 2] | 0) + (g << 4)) | 0;
+                  c[s >> 2] = c[r >> 2];
+                  c[(s + 4) >> 2] = c[(r + 4) >> 2];
+                  c[(s + 8) >> 2] = c[(r + 8) >> 2];
+                  c[(s + 12) >> 2] = c[(r + 12) >> 2];
+                  g = (g + 1) | 0;
+                  i = (i + 1) | 0;
+                }
+                q = +h[(n + (m << 3)) >> 3];
+                kP(
+                  o,
+                  ((c[a >> 2] | 0) + (k << 4)) | 0,
+                  3,
+                  (b - f + q) / q,
+                  ((c[d >> 2] | 0) + (k << 4)) | 0,
+                  c[e >> 2] | 0
+                );
+                U1(n);
+              }
+              l = p;
+              return;
+            }
+            function iJ(a) {
+              a = a | 0;
+              var b = 0.0,
+                c = 0.0,
+                d = 0.0,
+                e = 0.0,
+                f = 0.0;
+              e = +h[(a + 16) >> 3];
+              d = +h[a >> 3] - e;
+              f = +h[(a + 24) >> 3];
+              b = +h[(a + 8) >> 3] - f;
+              d = +C(+(b * b + d * d));
+              b = +h[(a + 32) >> 3];
+              e = e - b;
+              c = +h[(a + 40) >> 3];
+              f = f - c;
+              d = +C(+(f * f + e * e)) + d;
+              b = b - +h[(a + 48) >> 3];
+              c = c - +h[(a + 56) >> 3];
+              return +(d + +C(+(c * c + b * b)));
+            }
+            function jJ(b, d) {
+              b = b | 0;
+              d = d | 0;
+              d = yC(d) | 0;
+              if ((a[((c[(d + 16) >> 2] | 0) + 115) >> 0] | 0) == 1) d = eQ(b) | 0;
+              else d = bQ(b, d) | 0;
+              return qJ(d) | 0;
+            }
+            function kJ(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = +f;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0;
+              q = l;
+              l = (l + 1664) | 0;
+              m = (q + 1600) | 0;
+              n = (q + 800) | 0;
+              o = q;
+              p = KK(24) | 0;
+              c[(p + 16) >> 2] = 1;
+              j = ((((c[(e + 4) >> 2] | 0) + -1) | 0) / 3) | 0;
+              h = 0;
+              i = p;
+              while (1) {
+                if ((h | 0) >= (j | 0)) break;
+                k = (h * 3) | 0;
+                g = 0;
+                while (1) {
+                  if ((g | 0) == 4) break;
+                  r = (m + (g << 4)) | 0;
+                  s = ((c[e >> 2] | 0) + ((g + k) << 4)) | 0;
+                  c[r >> 2] = c[s >> 2];
+                  c[(r + 4) >> 2] = c[(s + 4) >> 2];
+                  c[(r + 8) >> 2] = c[(s + 8) >> 2];
+                  c[(r + 12) >> 2] = c[(s + 12) >> 2];
+                  g = (g + 1) | 0;
+                }
+                h = (h + 1) | 0;
+                i = lJ(m, i) | 0;
+              }
+              g = 0;
+              h = 0;
+              i = p;
+              while (1) {
+                if (!i) {
+                  h = p;
+                  g = p;
+                  break;
+                }
+                j = c[(i + 16) >> 2] | 0;
+                k = (n + (g << 4)) | 0;
+                e = (o + (g << 4)) | 0;
+                mJ(h, i, j, k, e, f);
+                g = (g + 1) | 0;
+                if (!(((g | 0) == 50) | ((j | 0) == 0))) {
+                  h = i;
+                  i = j;
+                  continue;
+                }
+                nJ(a, b, d, g, n, o);
+                c[n >> 2] = c[k >> 2];
+                c[(n + 4) >> 2] = c[(k + 4) >> 2];
+                c[(n + 8) >> 2] = c[(k + 8) >> 2];
+                c[(n + 12) >> 2] = c[(k + 12) >> 2];
+                c[o >> 2] = c[e >> 2];
+                c[(o + 4) >> 2] = c[(e + 4) >> 2];
+                c[(o + 8) >> 2] = c[(e + 8) >> 2];
+                c[(o + 12) >> 2] = c[(e + 12) >> 2];
+                h = i;
+                g = 1;
+                i = j;
+              }
+              while (1) {
+                if (!h) break;
+                s = c[(h + 16) >> 2] | 0;
+                U1(g);
+                h = s;
+                g = s;
+              }
+              l = q;
+              return;
+            }
+            function lJ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              g = l;
+              l = (l + 144) | 0;
+              f = (g + 128) | 0;
+              d = (g + 64) | 0;
+              e = g;
+              if (!(mI(a) | 0)) {
+                kP(f, a, 3, 0.5, d, e);
+                d = lJ(e, lJ(d, b) | 0) | 0;
+              } else {
+                d = (b + 16) | 0;
+                if ((c[d >> 2] | 0) == 1) {
+                  c[d >> 2] = 0;
+                  c[b >> 2] = c[a >> 2];
+                  c[(b + 4) >> 2] = c[(a + 4) >> 2];
+                  c[(b + 8) >> 2] = c[(a + 8) >> 2];
+                  c[(b + 12) >> 2] = c[(a + 12) >> 2];
+                }
+                d = (a + 48) | 0;
+                c[f >> 2] = c[d >> 2];
+                c[(f + 4) >> 2] = c[(d + 4) >> 2];
+                c[(f + 8) >> 2] = c[(d + 8) >> 2];
+                c[(f + 12) >> 2] = c[(d + 12) >> 2];
+                d = pJ(f, b) | 0;
+              }
+              l = g;
+              return d | 0;
+            }
+            function mJ(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = +g;
+              var i = 0.0,
+                j = 0.0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0.0,
+                t = 0.0;
+              r = l;
+              l = (l + 96) | 0;
+              n = (r + 80) | 0;
+              m = (r + 64) | 0;
+              k = (r + 48) | 0;
+              o = (r + 32) | 0;
+              p = (r + 16) | 0;
+              q = r;
+              c[o >> 2] = c[b >> 2];
+              c[(o + 4) >> 2] = c[(b + 4) >> 2];
+              c[(o + 8) >> 2] = c[(b + 8) >> 2];
+              c[(o + 12) >> 2] = c[(b + 12) >> 2];
+              do
+                if (a) {
+                  c[p >> 2] = c[a >> 2];
+                  c[(p + 4) >> 2] = c[(a + 4) >> 2];
+                  c[(p + 8) >> 2] = c[(a + 8) >> 2];
+                  c[(p + 12) >> 2] = c[(a + 12) >> 2];
+                  if (!d) {
+                    i = +h[o >> 3];
+                    h[q >> 3] = i * 2.0 - +h[p >> 3];
+                    j = +h[(o + 8) >> 3];
+                    h[(q + 8) >> 3] = j * 2.0 - +h[(p + 8) >> 3];
+                    break;
+                  } else {
+                    c[q >> 2] = c[d >> 2];
+                    c[(q + 4) >> 2] = c[(d + 4) >> 2];
+                    c[(q + 8) >> 2] = c[(d + 8) >> 2];
+                    c[(q + 12) >> 2] = c[(d + 12) >> 2];
+                    i = +h[o >> 3];
+                    j = +h[(o + 8) >> 3];
+                    break;
+                  }
+                } else {
+                  c[q >> 2] = c[d >> 2];
+                  c[(q + 4) >> 2] = c[(d + 4) >> 2];
+                  c[(q + 8) >> 2] = c[(d + 8) >> 2];
+                  c[(q + 12) >> 2] = c[(d + 12) >> 2];
+                  i = +h[o >> 3];
+                  h[p >> 3] = i * 2.0 - +h[q >> 3];
+                  j = +h[(o + 8) >> 3];
+                  h[(p + 8) >> 3] = j * 2.0 - +h[(q + 8) >> 3];
+                }
+              while (0);
+              c[k >> 2] = c[p >> 2];
+              c[(k + 4) >> 2] = c[(p + 4) >> 2];
+              c[(k + 8) >> 2] = c[(p + 8) >> 2];
+              c[(k + 12) >> 2] = c[(p + 12) >> 2];
+              c[m >> 2] = c[o >> 2];
+              c[(m + 4) >> 2] = c[(o + 4) >> 2];
+              c[(m + 8) >> 2] = c[(o + 8) >> 2];
+              c[(m + 12) >> 2] = c[(o + 12) >> 2];
+              c[n >> 2] = c[q >> 2];
+              c[(n + 4) >> 2] = c[(q + 4) >> 2];
+              c[(n + 8) >> 2] = c[(q + 8) >> 2];
+              c[(n + 12) >> 2] = c[(q + 12) >> 2];
+              t = +oJ(k, m, n);
+              s = +E(+t) * g;
+              g = +F(+t) * g;
+              h[e >> 3] = i + s;
+              h[(e + 8) >> 3] = j + g;
+              h[f >> 3] = i - s;
+              h[(f + 8) >> 3] = j - g;
+              l = r;
+              return;
+            }
+            function nJ(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              i = e << 1;
+              j = c[d >> 2] | 0;
+              h = 0;
+              k = 0;
+              while (1) {
+                if ((h | 0) >= (j | 0)) break;
+                l = ((c[((c[b >> 2] | 0) + (h << 2)) >> 2] | 0) + k) | 0;
+                h = (h + 1) | 0;
+                k = l;
+              }
+              l = (j + 1) | 0;
+              c[d >> 2] = l;
+              l = MK(c[b >> 2] | 0, l << 2) | 0;
+              c[b >> 2] = l;
+              c[(l + (h << 2)) >> 2] = i;
+              c[a >> 2] = MK(c[a >> 2] | 0, (k + i) << 4) | 0;
+              b = (i + -1 + k) | 0;
+              h = 0;
+              while (1) {
+                if ((h | 0) >= (e | 0)) break;
+                l = ((c[a >> 2] | 0) + ((h + k) << 4)) | 0;
+                j = (f + (h << 4)) | 0;
+                c[l >> 2] = c[j >> 2];
+                c[(l + 4) >> 2] = c[(j + 4) >> 2];
+                c[(l + 8) >> 2] = c[(j + 8) >> 2];
+                c[(l + 12) >> 2] = c[(j + 12) >> 2];
+                l = ((c[a >> 2] | 0) + ((b - h) << 4)) | 0;
+                j = (g + (h << 4)) | 0;
+                c[l >> 2] = c[j >> 2];
+                c[(l + 4) >> 2] = c[(j + 4) >> 2];
+                c[(l + 8) >> 2] = c[(j + 8) >> 2];
+                c[(l + 12) >> 2] = c[(j + 12) >> 2];
+                h = (h + 1) | 0;
+              }
+              return;
+            }
+            function oJ(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0.0;
+              f = +h[(b + 8) >> 3];
+              d = +h[b >> 3];
+              e = +K(+(+h[(c + 8) >> 3] - f), +(+h[c >> 3] - d));
+              d = +K(+(+h[(a + 8) >> 3] - f), +(+h[a >> 3] - d));
+              e = e - d;
+              return +((e > 0.0 ? e + -6.283185307179586 : e) * 0.5 + d);
+            }
+            function pJ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = KK(24) | 0;
+              c[(d + 16) >> 2] = 0;
+              c[d >> 2] = c[a >> 2];
+              c[(d + 4) >> 2] = c[(a + 4) >> 2];
+              c[(d + 8) >> 2] = c[(a + 8) >> 2];
+              c[(d + 12) >> 2] = c[(a + 12) >> 2];
+              c[(b + 16) >> 2] = d;
+              return d | 0;
+            }
+            function qJ(b) {
+              b = b | 0;
+              var c = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              c = b;
+              f = b;
+              a: while (1) {
+                e = 0;
+                while (1) {
+                  d = c;
+                  c = (c + 1) | 0;
+                  d = a[d >> 0] | 0;
+                  if (!((d << 24) >> 24)) break a;
+                  if ((e << 24) >> 24) {
+                    g = 5;
+                    break;
+                  }
+                  if ((d << 24) >> 24 != 92) break;
+                  else e = 1;
+                }
+                b: do
+                  if ((g | 0) == 5) {
+                    g = 0;
+                    switch (((d << 24) >> 24) | 0) {
+                      case 114: {
+                        d = 13;
+                        break b;
+                      }
+                      case 108:
+                      case 110: {
+                        d = 10;
+                        break b;
+                      }
+                      default:
+                        break b;
+                    }
+                  }
+                while (0);
+                a[f >> 0] = d;
+                f = (f + 1) | 0;
+              }
+              a[f >> 0] = 0;
+              return b | 0;
+            }
+            function rJ(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              e = c[b >> 2] | 0;
+              while (1) {
+                g = a[e >> 0] | 0;
+                if (!((g << 24) >> 24)) {
+                  f = 0;
+                  break;
+                }
+                f = (g << 24) >> 24;
+                if (!(((g << 24) >> 24 == 44) | ((S2(f) | 0) != 0))) {
+                  h = 5;
+                  break;
+                }
+                e = (e + 1) | 0;
+              }
+              a: do
+                if ((h | 0) == 5) {
+                  switch (f | 0) {
+                    case 0: {
+                      f = 0;
+                      break a;
+                    }
+                    case 41:
+                    case 40: {
+                      e = (e + 1) | 0;
+                      break a;
+                    }
+                    default: {
+                    }
+                  }
+                  h = (d + 4) | 0;
+                  i = (d + 8) | 0;
+                  while (1) {
+                    if (((sJ((g << 24) >> 24) | 0) << 24) >> 24) {
+                      f = 1;
+                      break a;
+                    }
+                    f = c[h >> 2] | 0;
+                    if (f >>> 0 >= (c[i >> 2] | 0) >>> 0) {
+                      lA(d, 1) | 0;
+                      f = c[h >> 2] | 0;
+                    }
+                    c[h >> 2] = f + 1;
+                    a[f >> 0] = g;
+                    f = (e + 1) | 0;
+                    e = f;
+                    g = a[f >> 0] | 0;
+                  }
+                }
+              while (0);
+              c[b >> 2] = e;
+              return f | 0;
+            }
+            function sJ(a) {
+              a = a | 0;
+              switch (a | 0) {
+                case 0:
+                case 44:
+                case 41:
+                case 40: {
+                  a = 1;
+                  break;
+                }
+                default:
+                  a = 0;
+              }
+              return a | 0;
+            }
+            function tJ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return uJ(c[a >> 2] | 0, c[(a + 160) >> 2] | 0, c[(a + 156) >> 2] | 0, b) | 0;
+            }
+            function uJ(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              o = l;
+              l = (l + 160) | 0;
+              k = (o + 20) | 0;
+              m = (o + 16) | 0;
+              n = o;
+              c[k >> 2] = 0;
+              c[m >> 2] = 0;
+              kA(n, 128, (o + 24) | 0);
+              nA(n, f) | 0;
+              g = (n + 4) | 0;
+              f = c[g >> 2] | 0;
+              if (f >>> 0 >= (c[(n + 8) >> 2] | 0) >>> 0) {
+                lA(n, 1) | 0;
+                f = c[g >> 2] | 0;
+              }
+              a[f >> 0] = 0;
+              h = c[n >> 2] | 0;
+              c[g >> 2] = h;
+              i = (b + 300) | 0;
+              j = (b + 296) | 0;
+              f = 0;
+              g = h;
+              a: while (1) {
+                if (f) {
+                  f = 1;
+                  break;
+                }
+                f = C4(g, c[i >> 2] | 0, k) | 0;
+                if (!f) {
+                  f = 0;
+                  break;
+                }
+                g = C4(f, c[j >> 2] | 0, m) | 0;
+                h = (g | 0) != 0;
+                if (h) f = C4(0, c[j >> 2] | 0, m) | 0;
+                else f = 0;
+                switch (((((f | 0) != 0) & 1) + (h & 1)) & 3) {
+                  case 2: {
+                    g = vJ(b, g, 0) | 0;
+                    f = vJ(b, f, e) | 0;
+                    h = (g | 0) > (f | 0);
+                    f = (((f & g) | 0) > -1) & ((((h ? g : f) | 0) >= (d | 0)) & (((h ? f : g) | 0) <= (d | 0)));
+                    g = 0;
+                    continue a;
+                  }
+                  case 1: {
+                    f = (vJ(b, g, d) | 0) == (d | 0);
+                    g = 0;
+                    continue a;
+                  }
+                  default: {
+                    f = 0;
+                    g = 0;
+                    continue a;
+                  }
+                }
+              }
+              oA(n);
+              l = o;
+              return f | 0;
+            }
+            function vJ(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              h = a[d >> 0] | 0;
+              if (!((h << 24) >> 24 == 97 ? (s2(d, 100396) | 0) == 0 : 0)) f = 3;
+              a: do
+                if ((f | 0) == 3) {
+                  if (((wJ(d) | 0) << 24) >> 24) {
+                    e = q5(d) | 0;
+                    break;
+                  }
+                  g = c[(b + 308) >> 2] | 0;
+                  if (!g) e = -1;
+                  else {
+                    b = c[(b + 312) >> 2] | 0;
+                    e = 1;
+                    while (1) {
+                      if ((e | 0) > (b | 0)) {
+                        e = -1;
+                        break a;
+                      }
+                      f = c[(g + (e << 2)) >> 2] | 0;
+                      if ((h << 24) >> 24 == (a[f >> 0] | 0) ? (s2(d, f) | 0) == 0 : 0) break a;
+                      e = (e + 1) | 0;
+                    }
+                  }
+                }
+              while (0);
+              return e | 0;
+            }
+            function wJ(b) {
+              b = b | 0;
+              var c = 0;
+              while (1) {
+                c = a[b >> 0] | 0;
+                if (!((c << 24) >> 24)) {
+                  b = 1;
+                  break;
+                }
+                if ((((c & 255) + -48) | 0) >>> 0 < 10) b = (b + 1) | 0;
+                else {
+                  b = 0;
+                  break;
+                }
+              }
+              return b | 0;
+            }
+            function xJ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if (
+                (+h[(a + 16) >> 3] >= +h[b >> 3] ? +h[(b + 16) >> 3] >= +h[a >> 3] : 0)
+                  ? +h[(a + 24) >> 3] >= +h[(b + 8) >> 3]
+                  : 0
+              )
+                a = (+h[(b + 24) >> 3] >= +h[(a + 8) >> 3]) & 1;
+              else a = 0;
+              return a | 0;
+            }
+            function yJ(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              a: do
+                if (
+                  (c[(b + 156) >> 2] | 0) >= 2
+                    ? ((f = aP(e, c[47167] | 0, 195059) | 0), ((tJ(b, f) | 0) << 24) >> 24 == 0)
+                    : 0
+                )
+                  if (!(a[f >> 0] | 0))
+                    if (!(aB(d, e) | 0)) f = 1;
+                    else {
+                      f = aB(d, e) | 0;
+                      while (1) {
+                        if (!f) {
+                          f = 0;
+                          break a;
+                        }
+                        g = aP(f, c[47190] | 0, 195059) | 0;
+                        if (!(a[g >> 0] | 0)) {
+                          f = 1;
+                          break a;
+                        }
+                        if (((tJ(b, g) | 0) << 24) >> 24) {
+                          f = 1;
+                          break a;
+                        }
+                        f = bB(d, f, e) | 0;
+                      }
+                    }
+                  else f = 0;
+                else f = 1;
+              while (0);
+              return f | 0;
+            }
+            function zJ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              d = l;
+              l = (l + 64) | 0;
+              e = (d + 32) | 0;
+              f = d;
+              a = ((c[(a + 16) >> 2] | 0) + 48) | 0;
+              c[f >> 2] = c[a >> 2];
+              c[(f + 4) >> 2] = c[(a + 4) >> 2];
+              c[(f + 8) >> 2] = c[(a + 8) >> 2];
+              c[(f + 12) >> 2] = c[(a + 12) >> 2];
+              c[(f + 16) >> 2] = c[(a + 16) >> 2];
+              c[(f + 20) >> 2] = c[(a + 20) >> 2];
+              c[(f + 24) >> 2] = c[(a + 24) >> 2];
+              c[(f + 28) >> 2] = c[(a + 28) >> 2];
+              c[e >> 2] = c[b >> 2];
+              c[(e + 4) >> 2] = c[(b + 4) >> 2];
+              c[(e + 8) >> 2] = c[(b + 8) >> 2];
+              c[(e + 12) >> 2] = c[(b + 12) >> 2];
+              c[(e + 16) >> 2] = c[(b + 16) >> 2];
+              c[(e + 20) >> 2] = c[(b + 20) >> 2];
+              c[(e + 24) >> 2] = c[(b + 24) >> 2];
+              c[(e + 28) >> 2] = c[(b + 28) >> 2];
+              b = (xJ(f, e) | 0) & 255;
+              l = d;
+              return b | 0;
+            }
+            function AJ(a, d) {
+              a = a | 0;
+              d = d | 0;
+              var f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0.0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0.0,
+                v = 0.0;
+              r = c[(a + 152) >> 2] | 0;
+              s = aI(a) | 0;
+              c[(s + 4) >> 2] = 2;
+              c[(s + 8) >> 2] = d;
+              c[(s + 12) >> 2] = 8;
+              if ((r & 16777216) | 0) {
+                if ((e[((c[((xC(d) | 0) + 16) >> 2] | 0) + 178) >> 1] | 0) > 2) {
+                  f = +h[((c[((c[(d + 16) >> 2] | 0) + 132) >> 2] | 0) + 16) >> 3] * 72.0;
+                  f = +(~~(f + (f >= 0.0 ? 0.5 : -0.5)) | 0);
+                } else f = 0.0;
+                h[(s + 168) >> 3] = f;
+              }
+              k = (d + 16) | 0;
+              CJ(a, c[((c[k >> 2] | 0) + 104) >> 2] | 0, d);
+              do
+                if ((r & 4259840) | 0) {
+                  if ((c[(s + 208) >> 2] | 0) == 0 ? (b[(s + 260) >> 1] & 1) == 0 : 0) break;
+                  p = WM(d) | 0;
+                  l = c[k >> 2] | 0;
+                  f = +h[(l + 16) >> 3];
+                  q = +h[(l + 24) >> 3];
+                  l = DJ(d) | 0;
+                  a: do
+                    if ((p | 2 | 0) == 3) {
+                      n = c[((c[k >> 2] | 0) + 12) >> 2] | 0;
+                      if (!(((EJ(n) | 0) << 24) >> 24)) g = 0;
+                      else g = (c[(n + 4) >> 2] | l | 0) != 0;
+                      if (!((((r & 524288) | 0) == 0) | (((n | 0) == 0) | g))) {
+                        i = (n + 8) | 0;
+                        o = c[i >> 2] | 0;
+                        o = (o | 0) < 3 ? 1 : o;
+                        j = (n + 4) | 0;
+                        m = c[j >> 2] | 0;
+                        m = (m | 0) > 1 ? m : 1;
+                        p = c[(n + 44) >> 2] | 0;
+                        g = QA(d, 102705) | 0;
+                        if (!g) g = 0;
+                        else g = q5(g) | 0;
+                        g = ((g + -4) | 0) >>> 0 > 56 ? 20 : g;
+                        if (!(c[j >> 2] | l)) {
+                          c[(s + 264) >> 2] = 0;
+                          i = JK(32) | 0;
+                          g = c[k >> 2] | 0;
+                          v = +h[(g + 88) >> 3];
+                          h[i >> 3] = f - v;
+                          u = +h[(g + 80) >> 3] * 0.5;
+                          h[(i + 8) >> 3] = q - u;
+                          h[(i + 16) >> 3] = v + f;
+                          h[(i + 24) >> 3] = u + q;
+                          g = 2;
+                          break;
+                        }
+                        i = c[i >> 2] | 0;
+                        if (((i | 0) < 3 ? +h[(n + 32) >> 3] == 0.0 : 0) ? +h[(n + 24) >> 3] == 0.0 : 0) {
+                          i = (s + 264) | 0;
+                          if (c[n >> 2] | 0) {
+                            c[i >> 2] = 1;
+                            i = JK(32) | 0;
+                            h[i >> 3] = f;
+                            h[(i + 8) >> 3] = q;
+                            g = ((m << 1) + -1) | 0;
+                            h[(i + 16) >> 3] = +h[(p + (g << 4)) >> 3] + f;
+                            h[(i + 24) >> 3] = +h[(p + (g << 4) + 8) >> 3] + q;
+                            g = 2;
+                            break;
+                          }
+                          c[i >> 2] = 2;
+                          i = ((m << 1) + -1) | 0;
+                          i = FJ(+h[(p + (i << 4)) >> 3], +h[(p + (i << 4) + 8) >> 3], g) | 0;
+                          j = 0;
+                          while (1) {
+                            if ((j | 0) >= (g | 0)) break a;
+                            p = (i + (j << 4)) | 0;
+                            h[p >> 3] = +h[p >> 3] + f;
+                            p = (i + (j << 4) + 8) | 0;
+                            h[p >> 3] = +h[p >> 3] + q;
+                            j = (j + 1) | 0;
+                          }
+                        }
+                        m = O(i, (m + -1) | 0) | 0;
+                        c[(s + 264) >> 2] = 2;
+                        if ((i | 0) < (g | 0)) {
+                          i = JK(o << 4) | 0;
+                          g = 0;
+                          while (1) {
+                            if ((g | 0) >= (o | 0)) {
+                              g = o;
+                              break a;
+                            }
+                            n = (g + m) | 0;
+                            h[(i + (g << 4)) >> 3] = +h[(p + (n << 4)) >> 3] + f;
+                            h[(i + (g << 4) + 8) >> 3] = +h[(p + (n << 4) + 8) >> 3] + q;
+                            g = (g + 1) | 0;
+                          }
+                        } else {
+                          l = ((i | 0) / (g | 0)) | 0;
+                          i = JK(g << 4) | 0;
+                          j = 0;
+                          k = 0;
+                          while (1) {
+                            if ((j | 0) >= (g | 0)) break a;
+                            o = (k + m) | 0;
+                            h[(i + (j << 4)) >> 3] = +h[(p + (o << 4)) >> 3] + f;
+                            h[(i + (j << 4) + 8) >> 3] = +h[(p + (o << 4) + 8) >> 3] + q;
+                            j = (j + 1) | 0;
+                            k = (k + l) | 0;
+                          }
+                        }
+                      } else t = 31;
+                    } else t = 31;
+                  while (0);
+                  if ((t | 0) == 31) {
+                    c[(s + 264) >> 2] = 0;
+                    i = JK(32) | 0;
+                    g = c[k >> 2] | 0;
+                    h[i >> 3] = f - +h[(g + 88) >> 3];
+                    v = +h[(g + 80) >> 3] * 0.5;
+                    h[(i + 8) >> 3] = q - v;
+                    h[(i + 16) >> 3] = +h[(g + 96) >> 3] + f;
+                    h[(i + 24) >> 3] = v + q;
+                    g = 2;
+                  }
+                  if (!(r & 8192)) NR(a, i, i, g) | 0;
+                  c[(s + 272) >> 2] = i;
+                  c[(s + 268) >> 2] = g;
+                }
+              while (0);
+              HT(QA(d, 100032) | 0);
+              _R(a, d);
+              return;
+            }
+            function BJ(a) {
+              a = a | 0;
+              $R(a);
+              bI(a);
+              return;
+            }
+            function CJ(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              m = l;
+              l = (l + 144) | 0;
+              j = m;
+              f = QA(e, 141055) | 0;
+              i = QA(e, 141101) | 0;
+              k = QA(e, 141088) | 0;
+              kA(j, 128, (m + 16) | 0);
+              if (!d) h = 0;
+              else h = c[d >> 2] | 0;
+              if (!((f | 0) != 0 ? (a[f >> 0] | 0) != 0 : 0)) f = QA(e, 111477) | 0;
+              g = dI(b, e, j) | 0;
+              if (!i) d = 0;
+              else d = jJ(i, e) | 0;
+              cI(b, h, f, d, k, g, e) | 0;
+              U1(d);
+              oA(j);
+              l = m;
+              return;
+            }
+            function DJ(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              b = bP(b, c[47157] | 0, 195059) | 0;
+              a: do
+                if (!(a[b >> 0] | 0)) b = 0;
+                else {
+                  PI(b) | 0;
+                  b = 0;
+                  d = 188228;
+                  while (1) {
+                    e = c[d >> 2] | 0;
+                    if (!e) break a;
+                    e = (s2(e, 111101) | 0) == 0;
+                    b = e ? 1 : b;
+                    d = (d + 4) | 0;
+                  }
+                }
+              while (0);
+              return b | 0;
+            }
+            function EJ(a) {
+              a = a | 0;
+              var b = 0.0;
+              if (
+                (
+                  (c[(a + 8) >> 2] | 0) == 4
+                    ? ((b = +h[(a + 16) >> 3]), ((~~(b + (b >= 0.0 ? 0.5 : -0.5)) | 0) % 90 | 0 | 0) == 0)
+                    : 0
+                )
+                  ? +h[(a + 24) >> 3] == 0.0
+                  : 0
+              )
+                a = (+h[(a + 32) >> 3] == 0.0) & 1;
+              else a = 0;
+              return a | 0;
+            }
+            function FJ(a, b, c) {
+              a = +a;
+              b = +b;
+              c = c | 0;
+              var d = 0.0,
+                e = 0,
+                f = 0.0,
+                g = 0;
+              f = 6.283185307179586 / +(c | 0);
+              g = JK(c << 4) | 0;
+              d = 0.0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (c | 0)) break;
+                h[(g + (e << 4)) >> 3] = +E(+d) * a;
+                h[(g + (e << 4) + 8) >> 3] = +F(+d) * b;
+                d = d + f;
+                e = (e + 1) | 0;
+              }
+              return g | 0;
+            }
+            function GJ(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              a: do
+                if (
+                  (c[(b + 156) >> 2] | 0) >= 2
+                    ? ((e = aP(d, GA(d, 0, 101510, 0) | 0, 195059) | 0), ((tJ(b, e) | 0) << 24) >> 24 == 0)
+                    : 0
+                )
+                  if (!(a[e >> 0] | 0)) {
+                    e = jC(d) | 0;
+                    while (1) {
+                      if (!e) {
+                        e = 0;
+                        break a;
+                      }
+                      if (((yJ(b, d, e) | 0) << 24) >> 24) {
+                        e = 1;
+                        break a;
+                      }
+                      e = kC(d, e) | 0;
+                    }
+                  } else e = 0;
+                else e = 1;
+              while (0);
+              return e | 0;
+            }
+            function HJ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = aI(a) | 0;
+              c[(d + 4) >> 2] = 1;
+              c[(d + 8) >> 2] = b;
+              c[(d + 12) >> 2] = 1;
+              CJ(a, c[((c[(b + 16) >> 2] | 0) + 12) >> 2] | 0, b);
+              UR(a, b);
+              return;
+            }
+            function IJ(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              b = QA(b, 141082) | 0;
+              a: do
+                if ((b | 0) != 0 ? (a[b >> 0] | 0) != 0 : 0) {
+                  PI(b) | 0;
+                  e = 188228;
+                  b = 0;
+                  while (1) {
+                    while (1) {
+                      f = c[e >> 2] | 0;
+                      if (!f) {
+                        e = 188228;
+                        break a;
+                      }
+                      if (!(s2(f, 111101) | 0)) {
+                        g = 10;
+                        break;
+                      }
+                      if (!(s2(f, 106334) | 0)) {
+                        f = e;
+                        g = 12;
+                        break;
+                      }
+                      if (!(s2(f, 106341) | 0)) {
+                        f = e;
+                        g = 14;
+                        break;
+                      }
+                      if (!(s2(f, 106316) | 0)) {
+                        f = e;
+                        g = 16;
+                        break;
+                      }
+                      e = (e + 4) | 0;
+                    }
+                    if ((g | 0) == 10) {
+                      e = (e + 4) | 0;
+                      b = b | 1;
+                      continue;
+                    } else if ((g | 0) == 12) {
+                      while (1) {
+                        h = f;
+                        f = (f + 4) | 0;
+                        g = c[f >> 2] | 0;
+                        c[h >> 2] = g;
+                        if (!g) break;
+                        else g = 12;
+                      }
+                      b = b | 3;
+                      continue;
+                    } else if ((g | 0) == 14) {
+                      while (1) {
+                        g = f;
+                        f = (f + 4) | 0;
+                        h = c[f >> 2] | 0;
+                        c[g >> 2] = h;
+                        if (!h) break;
+                        else g = 14;
+                      }
+                      b = b | 64;
+                      continue;
+                    } else if ((g | 0) == 16) {
+                      while (1) {
+                        g = f;
+                        f = (f + 4) | 0;
+                        h = c[f >> 2] | 0;
+                        c[g >> 2] = h;
+                        if (!h) break;
+                        else g = 16;
+                      }
+                      b = b | 4;
+                      continue;
+                    }
+                  }
+                } else {
+                  e = 0;
+                  b = 0;
+                }
+              while (0);
+              c[d >> 2] = b;
+              return e | 0;
+            }
+            function JJ(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              k = l;
+              l = (l + 16) | 0;
+              i = k;
+              j = (k + 4) | 0;
+              c[j >> 2] = 0;
+              m = (gI(b, 0, j) | 0) == 0;
+              j = c[j >> 2] | 0;
+              if (
+                (m ? ((f = c[j >> 2] | 0), (f | 0) >= 2) : 0) ? ((h = (j + 8) | 0), (c[c[h >> 2] >> 2] | 0) != 0) : 0
+              ) {
+                if ((f | 0) > 2) gA(0, 100415, i) | 0;
+                m = KK(((l2(b) | 0) + 1) | 0) | 0;
+                c[d >> 2] = m;
+                r3(m, c[c[h >> 2] >> 2] | 0) | 0;
+                if (!(c[((c[h >> 2] | 0) + 12) >> 2] | 0)) c[(d + 4) >> 2] = 0;
+                else {
+                  m = c[d >> 2] | 0;
+                  m = (m + ((l2(m) | 0) + 1)) | 0;
+                  c[(d + 4) >> 2] = m;
+                  r3(m, c[((c[h >> 2] | 0) + 12) >> 2] | 0) | 0;
+                }
+                b = c[h >> 2] | 0;
+                do
+                  if (!(a[(b + 8) >> 0] | 0))
+                    if (!(a[(b + 20) >> 0] | 0)) {
+                      g[e >> 2] = 0.0;
+                      break;
+                    } else {
+                      g[e >> 2] = 1.0 - +g[(b + 16) >> 2];
+                      break;
+                    }
+                  else c[e >> 2] = c[(b + 4) >> 2];
+                while (0);
+                hI(j);
+                b = 1;
+              } else {
+                c[d >> 2] = 0;
+                hI(j);
+                b = 0;
+              }
+              l = k;
+              return b | 0;
+            }
+            function KJ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              VR(a, b);
+              bI(a);
+              return;
+            }
+            function LJ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                i = 0,
+                j = 0,
+                k = 0.0,
+                m = 0.0,
+                n = 0,
+                o = 0.0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0;
+              x = l;
+              l = (l + 96) | 0;
+              p = (x + 48) | 0;
+              s = (x + 16) | 0;
+              w = (x + 8) | 0;
+              v = x;
+              t = (x + 80) | 0;
+              c[t >> 2] = 1e3;
+              f = KK(16e3) | 0;
+              u = (a + 256) | 0;
+              e = 1;
+              j = 1;
+              i = 0;
+              q = 0;
+              r = c[(b + 8) >> 2] | 0;
+              while (1) {
+                if ((q | 0) >= (c[b >> 2] | 0)) break;
+                d = c[r >> 2] | 0;
+                a: do
+                  switch (d | 0) {
+                    case 1:
+                    case 0: {
+                      n = (r + 80) | 0;
+                      c[s >> 2] = c[n >> 2];
+                      c[(s + 4) >> 2] = c[(n + 4) >> 2];
+                      c[(s + 8) >> 2] = c[(n + 8) >> 2];
+                      c[(s + 12) >> 2] = c[(n + 12) >> 2];
+                      c[(s + 16) >> 2] = c[(n + 16) >> 2];
+                      c[(s + 20) >> 2] = c[(n + 20) >> 2];
+                      c[(s + 24) >> 2] = c[(n + 24) >> 2];
+                      c[(s + 28) >> 2] = c[(n + 28) >> 2];
+                      c[p >> 2] = c[u >> 2];
+                      c[(p + 4) >> 2] = c[(u + 4) >> 2];
+                      c[(p + 8) >> 2] = c[(u + 8) >> 2];
+                      c[(p + 12) >> 2] = c[(u + 12) >> 2];
+                      c[(p + 16) >> 2] = c[(u + 16) >> 2];
+                      c[(p + 20) >> 2] = c[(u + 20) >> 2];
+                      c[(p + 24) >> 2] = c[(u + 24) >> 2];
+                      c[(p + 28) >> 2] = c[(u + 28) >> 2];
+                      if (!(xJ(s, p) | 0)) d = j;
+                      else {
+                        z = (r + 8) | 0;
+                        A = (r + 24) | 0;
+                        h[f >> 3] = +h[z >> 3] - +h[A >> 3];
+                        n = (r + 16) | 0;
+                        y = (r + 32) | 0;
+                        h[(f + 8) >> 3] = +h[n >> 3] - +h[y >> 3];
+                        h[(f + 16) >> 3] = +h[A >> 3] + +h[z >> 3];
+                        h[(f + 24) >> 3] = +h[y >> 3] + +h[n >> 3];
+                        mS(a, f, 2, (d | 0) == 0 ? j : 0);
+                        d = j;
+                      }
+                      break;
+                    }
+                    case 3:
+                    case 2: {
+                      A = (r + 80) | 0;
+                      c[s >> 2] = c[A >> 2];
+                      c[(s + 4) >> 2] = c[(A + 4) >> 2];
+                      c[(s + 8) >> 2] = c[(A + 8) >> 2];
+                      c[(s + 12) >> 2] = c[(A + 12) >> 2];
+                      c[(s + 16) >> 2] = c[(A + 16) >> 2];
+                      c[(s + 20) >> 2] = c[(A + 20) >> 2];
+                      c[(s + 24) >> 2] = c[(A + 24) >> 2];
+                      c[(s + 28) >> 2] = c[(A + 28) >> 2];
+                      c[p >> 2] = c[u >> 2];
+                      c[(p + 4) >> 2] = c[(u + 4) >> 2];
+                      c[(p + 8) >> 2] = c[(u + 8) >> 2];
+                      c[(p + 12) >> 2] = c[(u + 12) >> 2];
+                      c[(p + 16) >> 2] = c[(u + 16) >> 2];
+                      c[(p + 20) >> 2] = c[(u + 20) >> 2];
+                      c[(p + 24) >> 2] = c[(u + 24) >> 2];
+                      c[(p + 28) >> 2] = c[(u + 28) >> 2];
+                      if (!(xJ(s, p) | 0)) d = j;
+                      else {
+                        d = (r + 8) | 0;
+                        f = MJ(f, t, c[(d + 4) >> 2] | 0, c[d >> 2] | 0) | 0;
+                        nS(a, f, c[d >> 2] | 0, (c[r >> 2] | 0) == 2 ? j : 0);
+                        d = j;
+                      }
+                      break;
+                    }
+                    case 5:
+                    case 4: {
+                      A = (r + 80) | 0;
+                      c[s >> 2] = c[A >> 2];
+                      c[(s + 4) >> 2] = c[(A + 4) >> 2];
+                      c[(s + 8) >> 2] = c[(A + 8) >> 2];
+                      c[(s + 12) >> 2] = c[(A + 12) >> 2];
+                      c[(s + 16) >> 2] = c[(A + 16) >> 2];
+                      c[(s + 20) >> 2] = c[(A + 20) >> 2];
+                      c[(s + 24) >> 2] = c[(A + 24) >> 2];
+                      c[(s + 28) >> 2] = c[(A + 28) >> 2];
+                      c[p >> 2] = c[u >> 2];
+                      c[(p + 4) >> 2] = c[(u + 4) >> 2];
+                      c[(p + 8) >> 2] = c[(u + 8) >> 2];
+                      c[(p + 12) >> 2] = c[(u + 12) >> 2];
+                      c[(p + 16) >> 2] = c[(u + 16) >> 2];
+                      c[(p + 20) >> 2] = c[(u + 20) >> 2];
+                      c[(p + 24) >> 2] = c[(u + 24) >> 2];
+                      c[(p + 28) >> 2] = c[(u + 28) >> 2];
+                      if (!(xJ(s, p) | 0)) d = j;
+                      else {
+                        d = (r + 8) | 0;
+                        f = MJ(f, t, c[(d + 4) >> 2] | 0, c[d >> 2] | 0) | 0;
+                        pS(a, f, c[d >> 2] | 0, 0, 0, (c[r >> 2] | 0) == 4 ? j & 255 : 0);
+                        d = j;
+                      }
+                      break;
+                    }
+                    case 6: {
+                      A = (r + 80) | 0;
+                      c[s >> 2] = c[A >> 2];
+                      c[(s + 4) >> 2] = c[(A + 4) >> 2];
+                      c[(s + 8) >> 2] = c[(A + 8) >> 2];
+                      c[(s + 12) >> 2] = c[(A + 12) >> 2];
+                      c[(s + 16) >> 2] = c[(A + 16) >> 2];
+                      c[(s + 20) >> 2] = c[(A + 20) >> 2];
+                      c[(s + 24) >> 2] = c[(A + 24) >> 2];
+                      c[(s + 28) >> 2] = c[(A + 28) >> 2];
+                      c[p >> 2] = c[u >> 2];
+                      c[(p + 4) >> 2] = c[(u + 4) >> 2];
+                      c[(p + 8) >> 2] = c[(u + 8) >> 2];
+                      c[(p + 12) >> 2] = c[(u + 12) >> 2];
+                      c[(p + 16) >> 2] = c[(u + 16) >> 2];
+                      c[(p + 20) >> 2] = c[(u + 20) >> 2];
+                      c[(p + 24) >> 2] = c[(u + 24) >> 2];
+                      c[(p + 28) >> 2] = c[(u + 28) >> 2];
+                      if (!(xJ(s, p) | 0)) d = j;
+                      else {
+                        d = (r + 8) | 0;
+                        f = MJ(f, t, c[(d + 4) >> 2] | 0, c[d >> 2] | 0) | 0;
+                        qS(a, f, c[d >> 2] | 0);
+                        d = j;
+                      }
+                      break;
+                    }
+                    case 7: {
+                      A = (r + 80) | 0;
+                      c[s >> 2] = c[A >> 2];
+                      c[(s + 4) >> 2] = c[(A + 4) >> 2];
+                      c[(s + 8) >> 2] = c[(A + 8) >> 2];
+                      c[(s + 12) >> 2] = c[(A + 12) >> 2];
+                      c[(s + 16) >> 2] = c[(A + 16) >> 2];
+                      c[(s + 20) >> 2] = c[(A + 20) >> 2];
+                      c[(s + 24) >> 2] = c[(A + 24) >> 2];
+                      c[(s + 28) >> 2] = c[(A + 28) >> 2];
+                      c[p >> 2] = c[u >> 2];
+                      c[(p + 4) >> 2] = c[(u + 4) >> 2];
+                      c[(p + 8) >> 2] = c[(u + 8) >> 2];
+                      c[(p + 12) >> 2] = c[(u + 12) >> 2];
+                      c[(p + 16) >> 2] = c[(u + 16) >> 2];
+                      c[(p + 20) >> 2] = c[(u + 20) >> 2];
+                      c[(p + 24) >> 2] = c[(u + 24) >> 2];
+                      c[(p + 28) >> 2] = c[(u + 28) >> 2];
+                      if (!(xJ(s, p) | 0)) d = j;
+                      else {
+                        h[f >> 3] = +h[(r + 8) >> 3];
+                        h[(f + 8) >> 3] = +h[(r + 16) >> 3];
+                        d = c[(r + 112) >> 2] | 0;
+                        c[p >> 2] = c[f >> 2];
+                        c[(p + 4) >> 2] = c[(f + 4) >> 2];
+                        c[(p + 8) >> 2] = c[(f + 8) >> 2];
+                        c[(p + 12) >> 2] = c[(f + 12) >> 2];
+                        gS(a, p, d);
+                        d = j;
+                      }
+                      break;
+                    }
+                    case 8: {
+                      jS(a, c[(r + 8) >> 2] | 0);
+                      d = 1;
+                      break;
+                    }
+                    case 9: {
+                      hS(a, c[(r + 8) >> 2] | 0);
+                      d = 1;
+                      break;
+                    }
+                    case 13: {
+                      if ((c[(r + 8) >> 2] | 0) != 2) {
+                        d = (r + 16) | 0;
+                        z = c[(d + 36) >> 2] | 0;
+                        A = c[(z + 12) >> 2] | 0;
+                        o = +g[(z + 8) >> 2];
+                        d = ~~(
+                          +K(+(+h[(r + 40) >> 3] - +h[(r + 24) >> 3]), +(+h[(r + 32) >> 3] - +h[d >> 3])) *
+                          57.29577951308232
+                        );
+                        jS(a, c[(z + 4) >> 2] | 0);
+                        kS(a, A, d, o);
+                        d = 2;
+                        break a;
+                      }
+                      A = c[(r + 68) >> 2] | 0;
+                      j = c[(A + 4) >> 2] | 0;
+                      n = c[(A + 12) >> 2] | 0;
+                      o = +g[(A + 8) >> 2];
+                      k = +h[(r + 40) >> 3];
+                      m = +h[(r + 16) >> 3];
+                      if (k == m ? +h[(r + 48) >> 3] == +h[(r + 24) >> 3] : 0) d = 0;
+                      else d = ~~(+H(+((m - k) / +h[(r + 32) >> 3])) * 57.29577951308232);
+                      jS(a, j);
+                      kS(a, n, d, o);
+                      d = 3;
+                      break;
+                    }
+                    case 14: {
+                      gA(0, 100481, v) | 0;
+                      d = j;
+                      break;
+                    }
+                    case 12: {
+                      if (!e) {
+                        e = 0;
+                        d = j;
+                      } else {
+                        gA(0, 100521, w) | 0;
+                        e = 0;
+                        d = j;
+                      }
+                      break;
+                    }
+                    case 11: {
+                      PI(c[(r + 8) >> 2] | 0) | 0;
+                      lS(a, 188228);
+                      i = 188228;
+                      d = j;
+                      break;
+                    }
+                    default:
+                      d = j;
+                  }
+                while (0);
+                j = d;
+                q = (q + 1) | 0;
+                r = (r + 120) | 0;
+              }
+              if (i | 0) lS(a, c[((c[a >> 2] | 0) + 336) >> 2] | 0);
+              U1(f);
+              l = x;
+              return;
+            }
+            function MJ(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              g = c[b >> 2] | 0;
+              f = g << 1;
+              f = (f | 0) > (e | 0) ? f : e;
+              if ((g | 0) < (e | 0)) {
+                a = MK(a, f << 4) | 0;
+                c[b >> 2] = f;
+              }
+              b = 0;
+              while (1) {
+                if ((b | 0) >= (e | 0)) break;
+                h[(a + (b << 4)) >> 3] = +h[(d + ((b * 24) | 0)) >> 3];
+                h[(a + (b << 4) + 8) >> 3] = +h[(d + ((b * 24) | 0) + 8) >> 3];
+                b = (b + 1) | 0;
+              }
+              return a | 0;
+            }
+            function NJ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = c[b >> 2] | 0;
+              c[a >> 2] = c[(b + 4) >> 2];
+              c[(a + 4) >> 2] = d;
+              return;
+            }
+            function OJ(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              g = (d + 16) | 0;
+              f = 1;
+              while (1) {
+                d = c[g >> 2] | 0;
+                if ((f | 0) > (c[(d + 180) >> 2] | 0)) break;
+                e = c[((c[(d + 184) >> 2] | 0) + (f << 2)) >> 2] | 0;
+                OJ(b, e);
+                d = QA(e, 140823) | 0;
+                if (d | 0 ? a[d >> 0] | 0 : 0) hS(b, d);
+                d = QA(e, 137729) | 0;
+                if (d | 0 ? a[d >> 0] | 0 : 0) hS(b, d);
+                d = QA(e, 140977) | 0;
+                if (d | 0 ? a[d >> 0] | 0 : 0) hS(b, d);
+                d = QA(e, 101418) | 0;
+                if (d | 0 ? a[d >> 0] | 0 : 0) jS(b, d);
+                d = QA(e, 101446) | 0;
+                if (d | 0 ? a[d >> 0] | 0 : 0) hS(b, d);
+                f = (f + 1) | 0;
+              }
+              return;
+            }
+            function PJ(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              b = c[47127] | 0;
+              if (!b) {
+                b = Vz(20628, c[4581] | 0) | 0;
+                c[47127] = b;
+              }
+              if (!(nb[c[b >> 2] & 63](b, a, 4) | 0)) {
+                d = c[47127] | 0;
+                e = c[d >> 2] | 0;
+                b = D4(a) | 0;
+                nb[e & 63](d, b, 1) | 0;
+                b = 1;
+              } else b = 0;
+              return b | 0;
+            }
+            function QJ(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              U1(b);
+              return;
+            }
+            function RJ(a) {
+              a = a | 0;
+              var b = 0;
+              b = c[47128] | 0;
+              if (!a) {
+                if ((b | 0) > 0 ? ((b = (b + -1) | 0), (c[47128] = b), (b | 0) == 0) : 0) {
+                  Z3(1, c[47129] | 0) | 0;
+                  U1(c[47129] | 0);
+                }
+              } else {
+                c[47128] = b + 1;
+                if (!b) {
+                  c[47129] = D4(Z3(1, 0) | 0) | 0;
+                  Z3(1, 153563) | 0;
+                }
+              }
+              return;
+            }
+            function SJ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0.0;
+              u = l;
+              l = (l + 96) | 0;
+              r = (u + 72) | 0;
+              q = (u + 56) | 0;
+              p = (u + 48) | 0;
+              t = (u + 32) | 0;
+              s = (u + 24) | 0;
+              e = (u + 8) | 0;
+              d = u;
+              if (0) TO();
+              do
+                if (
+                  (TC(b, 137483, 0, 1) | 0) != 0 ? ((o = (b + 16) | 0), (c[((c[o >> 2] | 0) + 8) >> 2] | 0) != 0) : 0
+                ) {
+                  TJ(b);
+                  UJ(a, b);
+                  VJ(a, b);
+                  RJ(1);
+                  j = (a + 56) | 0;
+                  k = (a + 184) | 0;
+                  m = (a + 192) | 0;
+                  n = (a + 28) | 0;
+                  i = EF(a) | 0;
+                  a: while (1) {
+                    if (!i) {
+                      g = 33;
+                      break;
+                    }
+                    d = c[j >> 2] | 0;
+                    if (!d) {
+                      c[(i + 20) >> 2] = 0;
+                      d = 0;
+                    } else {
+                      c[(i + 20) >> 2] = c[(d + 8) >> 2];
+                      d = c[(d + 12) >> 2] | 0;
+                    }
+                    c[(i + 24) >> 2] = d;
+                    c[(i + 12) >> 2] = a;
+                    c[(i + 28) >> 2] = c[k >> 2];
+                    c[(i + 620) >> 2] = 25764;
+                    c[(i + 624) >> 2] = 14;
+                    if (!(c[((c[o >> 2] | 0) + 8) >> 2] | 0)) {
+                      g = 13;
+                      break;
+                    }
+                    e = (i + 52) | 0;
+                    g = JR(i, c[e >> 2] | 0) | 0;
+                    c[(i + 56) >> 2] = g;
+                    switch (g | 0) {
+                      case 999: {
+                        g = 16;
+                        break a;
+                      }
+                      case 21: {
+                        d = 1;
+                        break;
+                      }
+                      case 24: {
+                        d = 520;
+                        break;
+                      }
+                      default:
+                        d = WJ(b) | 0;
+                    }
+                    f = (i + 152) | 0;
+                    c[f >> 2] = c[f >> 2] | d;
+                    d = c[m >> 2] | 0;
+                    do
+                      if (!d) g = 24;
+                      else {
+                        if ((c[(d + 152) >> 2] & 32) | 0 ? (s2(c[e >> 2] | 0, c[(d + 52) >> 2] | 0) | 0) == 0 : 0) {
+                          d = c[47130] | 0;
+                          if (!d) {
+                            g = 27;
+                            break;
+                          }
+                          c[(d + 8) >> 2] = i;
+                          c[(i + 36) >> 2] = c[(d + 36) >> 2];
+                          g = 29;
+                          break;
+                        }
+                        LR(d);
+                        c[m >> 2] = 0;
+                        c[n >> 2] = 0;
+                        g = 24;
+                      }
+                    while (0);
+                    if ((g | 0) == 24) {
+                      c[47130] = 0;
+                      g = 27;
+                    }
+                    if ((g | 0) == 27 ? ((g = 0), (KR(i) | 0) == 0) : 0) {
+                      c[m >> 2] = i;
+                      g = 29;
+                    }
+                    if ((g | 0) == 29) {
+                      c[(i + 8) >> 2] = 0;
+                      c[(i + 104) >> 2] = 25876;
+                      XJ(i);
+                      YJ(i);
+                      ZJ(i, b);
+                      _J(i, b);
+                      $J(i, b);
+                      if (!(c[f >> 2] & 128)) sI(i, b);
+                      c[47130] = i;
+                    }
+                    i = FF(a) | 0;
+                  }
+                  if ((g | 0) == 13) {
+                    gA(1, 100679, s) | 0;
+                    RJ(0);
+                    if (!0) {
+                      d = -1;
+                      break;
+                    }
+                    d = c[15712] | 0;
+                    s = KB(b) | 0;
+                    v = +UO();
+                    c[t >> 2] = s;
+                    h[(t + 8) >> 3] = v;
+                    w4(d, 100650, t) | 0;
+                    d = -1;
+                    break;
+                  } else if ((g | 0) == 16) {
+                    c[p >> 2] = c[e >> 2];
+                    gA(1, 100700, p) | 0;
+                    RJ(0);
+                    if (!0) {
+                      d = -1;
+                      break;
+                    }
+                    d = c[15712] | 0;
+                    t = KB(b) | 0;
+                    v = +UO();
+                    c[q >> 2] = t;
+                    h[(q + 8) >> 3] = v;
+                    w4(d, 100650, q) | 0;
+                    d = -1;
+                    break;
+                  } else if ((g | 0) == 33) {
+                    RJ(0);
+                    if (!0) {
+                      d = 0;
+                      break;
+                    }
+                    d = c[15712] | 0;
+                    t = KB(b) | 0;
+                    v = +UO();
+                    c[r >> 2] = t;
+                    h[(r + 8) >> 3] = v;
+                    w4(d, 100650, r) | 0;
+                    d = 0;
+                    break;
+                  }
+                } else g = 5;
+              while (0);
+              if ((g | 0) == 5) {
+                gA(1, 100602, d) | 0;
+                if (!0) d = -1;
+                else {
+                  d = c[15712] | 0;
+                  t = KB(b) | 0;
+                  v = +UO();
+                  c[e >> 2] = t;
+                  h[(e + 8) >> 3] = v;
+                  w4(d, 100650, e) | 0;
+                  d = -1;
+                }
+              }
+              l = u;
+              return d | 0;
+            }
+            function TJ(a) {
+              a = a | 0;
+              var b = 0;
+              b = jC(a) | 0;
+              while (1) {
+                if (!b) break;
+                eK(a, b);
+                b = kC(a, b) | 0;
+              }
+              return;
+            }
+            function UJ(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0.0;
+              o = l;
+              l = (l + 32) | 0;
+              k = (o + 24) | 0;
+              f = (o + 16) | 0;
+              j = (o + 8) | 0;
+              n = o;
+              c[(b + 168) >> 2] = d;
+              g = (b + 293) | 0;
+              a[g >> 0] = 0;
+              e = QA(d, 105496) | 0;
+              if (e | 0 ? ((c[f >> 2] = j), (c[(f + 4) >> 2] = n), (i = b5(e, 105503, f) | 0), (i | 0) > 0) : 0) {
+                p = +h[j >> 3] * 72.0;
+                e = (b + 208) | 0;
+                h[e >> 3] = p;
+                h[(b + 200) >> 3] = p;
+                if ((i | 0) != 1) h[e >> 3] = +h[n >> 3] * 72.0;
+                a[g >> 0] = 1;
+              }
+              f = (b + 292) | 0;
+              a[f >> 0] = 0;
+              e = QA(d, 101102) | 0;
+              if (e | 0 ? ((c[k >> 2] = j), (c[(k + 4) >> 2] = n), (m = b5(e, 105503, k) | 0), (m | 0) > 0) : 0) {
+                p = +h[j >> 3] * 72.0;
+                e = (b + 224) | 0;
+                h[e >> 3] = p;
+                h[(b + 216) >> 3] = p;
+                if ((m | 0) != 1) h[e >> 3] = +h[n >> 3] * 72.0;
+                a[f >> 0] = 1;
+              }
+              e = (b + 294) | 0;
+              a[e >> 0] = 0;
+              f = (b + 232) | 0;
+              g = (d + 16) | 0;
+              n = ((c[((c[g >> 2] | 0) + 8) >> 2] | 0) + 48) | 0;
+              c[f >> 2] = c[n >> 2];
+              c[(f + 4) >> 2] = c[(n + 4) >> 2];
+              c[(f + 8) >> 2] = c[(n + 8) >> 2];
+              c[(f + 12) >> 2] = c[(n + 12) >> 2];
+              f = c[((c[g >> 2] | 0) + 8) >> 2] | 0;
+              if (+h[(f + 48) >> 3] > 0.001 ? +h[(f + 56) >> 3] > 0.001 : 0) a[e >> 0] = 1;
+              c[(b + 288) >> 2] = a[(f + 81) >> 0] | 0 ? 90 : 0;
+              e = (b + 196) | 0;
+              c[e >> 2] = 101106;
+              f = QA(d, 101109) | 0;
+              if (f | 0 ? a[f >> 0] | 0 : 0) c[e >> 2] = f;
+              n = (b + 256) | 0;
+              m = ((c[g >> 2] | 0) + 16) | 0;
+              c[n >> 2] = c[m >> 2];
+              c[(n + 4) >> 2] = c[(m + 4) >> 2];
+              c[(n + 8) >> 2] = c[(m + 8) >> 2];
+              c[(n + 12) >> 2] = c[(m + 12) >> 2];
+              c[(n + 16) >> 2] = c[(m + 16) >> 2];
+              c[(n + 20) >> 2] = c[(m + 20) >> 2];
+              c[(n + 24) >> 2] = c[(m + 24) >> 2];
+              c[(n + 28) >> 2] = c[(m + 28) >> 2];
+              c[47141] = GA(d, 0, 101472, 0) | 0;
+              c[47142] = GA(d, 0, 101463, 0) | 0;
+              c[(b + 320) >> 2] = bP(0, c[47151] | 0, 107994) | 0;
+              h[(b + 328) >> 3] = +_O(0, c[47150] | 0, 14.0, 1.0);
+              c[(b + 336) >> 2] = 20664;
+              c[(b + 188) >> 2] = KB(d) | 0;
+              l = o;
+              return;
+            }
+            function VJ(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              e = (b + 304) | 0;
+              f = c[e >> 2] | 0;
+              if (f | 0) {
+                U1(f);
+                c[e >> 2] = 0;
+              }
+              f = (b + 308) | 0;
+              e = c[f >> 2] | 0;
+              if (e | 0) {
+                U1(e);
+                c[f >> 2] = 0;
+              }
+              g = (b + 316) | 0;
+              e = c[g >> 2] | 0;
+              if (e | 0) {
+                U1(e);
+                c[g >> 2] = 0;
+              }
+              e = QA(d, 100853) | 0;
+              if (e) {
+                c[(b + 312) >> 2] = cK(b, d, e) | 0;
+                e = QA(d, 100860) | 0;
+                if (e | 0 ? a[e >> 0] | 0 : 0) c[g >> 2] = dK(b, e) | 0;
+              } else {
+                c[f >> 2] = 0;
+                c[(b + 312) >> 2] = 1;
+              }
+              return;
+            }
+            function WJ(b) {
+              b = b | 0;
+              b = QA(b, 100821) | 0;
+              a: do
+                if (!b) b = 0;
+                else
+                  switch (a[b >> 0] | 0) {
+                    case 110: {
+                      if (!(s2((b + 1) | 0, 100833) | 0)) b = 1;
+                      else {
+                        b = 0;
+                        break a;
+                      }
+                      break;
+                    }
+                    case 101: {
+                      if (!(s2((b + 1) | 0, 100843) | 0)) b = 16;
+                      else {
+                        b = 0;
+                        break a;
+                      }
+                      break;
+                    }
+                    default: {
+                      b = 0;
+                      break a;
+                    }
+                  }
+              while (0);
+              return b | 0;
+            }
+            function XJ(b) {
+              b = b | 0;
+              var d = 0.0,
+                e = 0;
+              e = c[b >> 2] | 0;
+              if (!(a[(e + 292) >> 0] | 0)) {
+                if ((c[(b + 56) >> 2] | 0) == 300) d = +h[((c[(b + 68) >> 2] | 0) + 8) >> 3];
+                else d = 4.0;
+                h[(b + 248) >> 3] = d;
+                h[(b + 240) >> 3] = d;
+              } else {
+                b = (b + 240) | 0;
+                e = (e + 216) | 0;
+                c[b >> 2] = c[e >> 2];
+                c[(b + 4) >> 2] = c[(e + 4) >> 2];
+                c[(b + 8) >> 2] = c[(e + 8) >> 2];
+                c[(b + 12) >> 2] = c[(e + 12) >> 2];
+              }
+              return;
+            }
+            function YJ(b) {
+              b = b | 0;
+              var d = 0;
+              d = c[b >> 2] | 0;
+              a: do
+                if (!(a[(d + 293) >> 0] | 0))
+                  switch (c[(b + 56) >> 2] | 0) {
+                    case 300: {
+                      d = (b + 416) | 0;
+                      b = ((c[(b + 84) >> 2] | 0) + 8) | 0;
+                      c[d >> 2] = c[b >> 2];
+                      c[(d + 4) >> 2] = c[(b + 4) >> 2];
+                      c[(d + 8) >> 2] = c[(b + 8) >> 2];
+                      c[(d + 12) >> 2] = c[(b + 12) >> 2];
+                      break a;
+                    }
+                    case 30:
+                    case 21:
+                    case 22:
+                    case 4:
+                    case 3:
+                    case 2: {
+                      h[(b + 424) >> 3] = 36.0;
+                      h[(b + 416) >> 3] = 36.0;
+                      break a;
+                    }
+                    default: {
+                      d = (b + 416) | 0;
+                      c[d >> 2] = 0;
+                      c[(d + 4) >> 2] = 0;
+                      c[(d + 8) >> 2] = 0;
+                      c[(d + 12) >> 2] = 0;
+                      break a;
+                    }
+                  }
+                else {
+                  b = (b + 416) | 0;
+                  d = (d + 200) | 0;
+                  c[b >> 2] = c[d >> 2];
+                  c[(b + 4) >> 2] = c[(d + 4) >> 2];
+                  c[(b + 8) >> 2] = c[(d + 8) >> 2];
+                  c[(b + 12) >> 2] = c[(d + 12) >> 2];
+                }
+              while (0);
+              return;
+            }
+            function ZJ(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0;
+              f = c[((c[b >> 2] | 0) + 192) >> 2] | 0;
+              e = +h[((c[((c[(d + 16) >> 2] | 0) + 8) >> 2] | 0) + 24) >> 3];
+              do
+                if (!(e != 0.0)) {
+                  if (f | 0 ? a[(f + 128) >> 0] | 0 : 0) {
+                    b = (b + 432) | 0;
+                    f = (f + 112) | 0;
+                    c[b >> 2] = c[f >> 2];
+                    c[(b + 4) >> 2] = c[(f + 4) >> 2];
+                    c[(b + 8) >> 2] = c[(f + 8) >> 2];
+                    c[(b + 12) >> 2] = c[(f + 12) >> 2];
+                    break;
+                  }
+                  d = (b + 432) | 0;
+                  if ((c[(b + 56) >> 2] | 0) == 300) {
+                    b = ((c[(b + 84) >> 2] | 0) + 40) | 0;
+                    c[d >> 2] = c[b >> 2];
+                    c[(d + 4) >> 2] = c[(b + 4) >> 2];
+                    c[(d + 8) >> 2] = c[(b + 8) >> 2];
+                    c[(d + 12) >> 2] = c[(b + 12) >> 2];
+                    break;
+                  } else {
+                    h[(b + 440) >> 3] = 96.0;
+                    h[d >> 3] = 96.0;
+                    break;
+                  }
+                } else {
+                  h[(b + 440) >> 3] = e;
+                  h[(b + 432) >> 3] = e;
+                }
+              while (0);
+              return;
+            }
+            function _J(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0,
+                g = 0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0,
+                r = 0.0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0;
+              A = l;
+              l = (l + 112) | 0;
+              t = (A + 80) | 0;
+              u = (A + 56) | 0;
+              s = (A + 40) | 0;
+              v = (A + 32) | 0;
+              w = (A + 24) | 0;
+              x = (A + 16) | 0;
+              y = (A + 8) | 0;
+              z = A;
+              m = c[b >> 2] | 0;
+              o = +h[(m + 272) >> 3];
+              q = +h[(m + 280) >> 3];
+              p = +h[(m + 256) >> 3];
+              r = +h[(m + 264) >> 3];
+              f = +h[(b + 240) >> 3];
+              e = p - f;
+              h[(b + 208) >> 3] = e;
+              i = +h[(b + 248) >> 3];
+              j = r - i;
+              h[(b + 216) >> 3] = j;
+              f = f + o;
+              h[(b + 224) >> 3] = f;
+              i = i + q;
+              h[(b + 232) >> 3] = i;
+              e = f - e;
+              j = i - j;
+              h[x >> 3] = 1.0;
+              g = c[((c[(d + 16) >> 2] | 0) + 8) >> 2] | 0;
+              i = +h[(g + 64) >> 3];
+              do
+                if (i > 0.001 ? ((k = +h[(g + 72) >> 3]), k > 0.001) : 0) {
+                  e = e == 0.0 ? i : e;
+                  f = j == 0.0 ? k : j;
+                  if (!((i < e) | (k < f)) ? !((k > f) & ((i > e) & ((a[(g + 80) >> 0] | 0) != 0))) : 0) {
+                    k = e;
+                    j = f;
+                    i = 1.0;
+                    break;
+                  }
+                  n = i / e < k / f;
+                  i = (n ? i : k) / (n ? e : f);
+                  h[x >> 3] = i;
+                  k = e;
+                  j = f;
+                } else {
+                  k = e;
+                  i = 1.0;
+                }
+              while (0);
+              f = (p + o) * 0.5;
+              h[y >> 3] = f;
+              e = (r + q) * 0.5;
+              h[z >> 3] = e;
+              c[(b + 360) >> 2] = c[(m + 288) >> 2];
+              k = i * k;
+              h[v >> 3] = k;
+              j = i * j;
+              h[w >> 3] = j;
+              g = QA(d, 100752) | 0;
+              if (g) {
+                m = T1(((l2(g) | 0) + 1) | 0) | 0;
+                n = T1(((l2(g) | 0) + 1) | 0) | 0;
+                c[s >> 2] = v;
+                c[(s + 4) >> 2] = w;
+                c[(s + 8) >> 2] = x;
+                c[(s + 12) >> 2] = m;
+                do
+                  if ((b5(g, 100761, s) | 0) == 4) {
+                    g = tC(c[(d + 60) >> 2] | 0, m, 0) | 0;
+                    if (g | 0) {
+                      u = c[(g + 16) >> 2] | 0;
+                      h[y >> 3] = +h[(u + 16) >> 3];
+                      h[z >> 3] = +h[(u + 24) >> 3];
+                    }
+                  } else {
+                    c[u >> 2] = v;
+                    c[(u + 4) >> 2] = w;
+                    c[(u + 8) >> 2] = x;
+                    c[(u + 12) >> 2] = m;
+                    c[(u + 16) >> 2] = n;
+                    if ((b5(g, 100781, u) | 0) != 4) {
+                      c[t >> 2] = v;
+                      c[(t + 4) >> 2] = w;
+                      c[(t + 8) >> 2] = x;
+                      c[(t + 12) >> 2] = y;
+                      c[(t + 16) >> 2] = z;
+                      b5(g, 100801, t) | 0;
+                      break;
+                    }
+                    g = tC(c[(d + 60) >> 2] | 0, m, 0) | 0;
+                    if (g | 0) {
+                      u = c[(g + 16) >> 2] | 0;
+                      h[y >> 3] = +h[(u + 16) >> 3];
+                      h[z >> 3] = +h[(u + 24) >> 3];
+                    }
+                  }
+                while (0);
+                U1(m);
+                U1(n);
+                k = +h[v >> 3];
+                j = +h[w >> 3];
+                i = +h[x >> 3];
+                f = +h[y >> 3];
+                e = +h[z >> 3];
+              }
+              h[(b + 368) >> 3] = k;
+              h[(b + 376) >> 3] = j;
+              h[(b + 352) >> 3] = i;
+              h[(b + 336) >> 3] = f;
+              h[(b + 344) >> 3] = e;
+              l = A;
+              return;
+            }
+            function $J(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0.0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0.0,
+                P = 0.0,
+                Q = 0.0;
+              M = l;
+              l = (l + 224) | 0;
+              J = (M + 200) | 0;
+              z = (M + 168) | 0;
+              E = (M + 144) | 0;
+              I = (M + 120) | 0;
+              F = (M + 96) | 0;
+              G = (M + 64) | 0;
+              e = (M + 184) | 0;
+              v = (M + 176) | 0;
+              w = (M + 160) | 0;
+              y = (M + 136) | 0;
+              x = (M + 112) | 0;
+              A = (M + 80) | 0;
+              B = (M + 48) | 0;
+              C = (M + 32) | 0;
+              D = (M + 16) | 0;
+              K = (M + 8) | 0;
+              L = M;
+              u = c[b >> 2] | 0;
+              c[G >> 2] = 0;
+              c[(G + 4) >> 2] = 0;
+              c[(G + 8) >> 2] = 0;
+              c[(G + 12) >> 2] = 0;
+              H = (b + 368) | 0;
+              c[I >> 2] = c[H >> 2];
+              c[(I + 4) >> 2] = c[(H + 4) >> 2];
+              c[(I + 8) >> 2] = c[(H + 8) >> 2];
+              c[(I + 12) >> 2] = c[(H + 12) >> 2];
+              H = (b + 360) | 0;
+              if (c[H >> 2] | 0) {
+                c[J >> 2] = c[I >> 2];
+                c[(J + 4) >> 2] = c[(I + 4) >> 2];
+                c[(J + 8) >> 2] = c[(I + 8) >> 2];
+                c[(J + 12) >> 2] = c[(I + 12) >> 2];
+                aK(e, J);
+                c[I >> 2] = c[e >> 2];
+                c[(I + 4) >> 2] = c[(e + 4) >> 2];
+                c[(I + 8) >> 2] = c[(e + 8) >> 2];
+                c[(I + 12) >> 2] = c[(e + 12) >> 2];
+              }
+              t = (b + 416) | 0;
+              c[F >> 2] = c[t >> 2];
+              c[(F + 4) >> 2] = c[(t + 4) >> 2];
+              c[(F + 8) >> 2] = c[(t + 8) >> 2];
+              c[(F + 12) >> 2] = c[(t + 12) >> 2];
+              if ((a[(u + 294) >> 0] | 0) != 0 ? ((c[(b + 152) >> 2] & 32) | 0) != 0 : 0) {
+                i = +h[(u + 232) >> 3] - +h[F >> 3] * 2.0;
+                h[E >> 3] = i;
+                k = +h[(u + 240) >> 3] - +h[(F + 8) >> 3] * 2.0;
+                p = (E + 8) | 0;
+                h[p >> 3] = k;
+                if (!(i < 0.0001)) {
+                  o = +h[I >> 3];
+                  e = ~~(o / i);
+                  f = (b + 164) | 0;
+                  c[f >> 2] = e;
+                  if (o - i * +(e | 0) > 0.0001) {
+                    e = (e + 1) | 0;
+                    c[f >> 2] = e;
+                  }
+                } else {
+                  c[(b + 164) >> 2] = 1;
+                  e = 1;
+                }
+                if (!(k < 0.0001)) {
+                  g = +h[(I + 8) >> 3];
+                  f = ~~(g / k);
+                  j = (b + 168) | 0;
+                  c[j >> 2] = f;
+                  if (g - k * +(f | 0) > 0.0001) {
+                    f = (f + 1) | 0;
+                    c[j >> 2] = f;
+                  }
+                } else {
+                  c[(b + 168) >> 2] = 1;
+                  f = 1;
+                  g = +h[(I + 8) >> 3];
+                }
+                c[(b + 204) >> 2] = O(f, e) | 0;
+                o = +h[(+h[I >> 3] < i ? I : E) >> 3];
+                h[I >> 3] = o;
+                e = p;
+                f = I;
+                m = +h[((g < k ? I : E) + 8) >> 3];
+                g = o;
+                j = 21;
+              } else {
+                if (c[(b + 68) >> 2] | 0) {
+                  e = c[(b + 84) >> 2] | 0;
+                  i = +h[(e + 24) >> 3] - +h[F >> 3] * 2.0;
+                  i = i < 0.0 ? 0.0 : i;
+                  h[E >> 3] = i;
+                  o = +h[(e + 32) >> 3] - +h[(F + 8) >> 3] * 2.0;
+                  e = (E + 8) | 0;
+                  h[e >> 3] = o;
+                  if (o < 0.0) {
+                    f = E;
+                    j = 17;
+                  } else e = E;
+                } else {
+                  h[(E + 8) >> 3] = 0.0;
+                  f = E;
+                  e = E;
+                  j = 17;
+                }
+                if ((j | 0) == 17) {
+                  h[e >> 3] = 0.0;
+                  e = f;
+                  i = +h[f >> 3];
+                }
+                c[(b + 204) >> 2] = 1;
+                c[(b + 168) >> 2] = 1;
+                c[(b + 164) >> 2] = 1;
+                g = +h[I >> 3];
+                if (i < g) {
+                  h[e >> 3] = g;
+                  i = g;
+                }
+                e = (E + 8) | 0;
+                k = +h[e >> 3];
+                m = +h[(I + 8) >> 3];
+                if (k < m) {
+                  f = E;
+                  j = 21;
+                } else {
+                  r = e;
+                  m = k;
+                }
+              }
+              if ((j | 0) == 21) {
+                h[(f + 8) >> 3] = m;
+                r = e;
+                m = +h[e >> 3];
+              }
+              n = +h[F >> 3];
+              s = (b + 432) | 0;
+              k = +h[s >> 3] * 0.013888888888888888 * (n * 2.0 + i);
+              c[(b + 448) >> 2] = ~~(k + (k >= 0.0 ? 0.5 : -0.5));
+              q = (F + 8) | 0;
+              k = +h[q >> 3];
+              t = (b + 440) | 0;
+              o = +h[t >> 3] * 0.013888888888888888 * (k * 2.0 + m);
+              c[(b + 452) >> 2] = ~~(o + (o >= 0.0 ? 0.5 : -0.5));
+              j = (b + 188) | 0;
+              p = (b + 180) | 0;
+              e = (b + 172) | 0;
+              f = (u + 196) | 0;
+              c[e >> 2] = 0;
+              c[(e + 4) >> 2] = 0;
+              c[(e + 8) >> 2] = 0;
+              c[(e + 12) >> 2] = 0;
+              c[(e + 16) >> 2] = 0;
+              c[(e + 20) >> 2] = 0;
+              bK(v, b, a[c[f >> 2] >> 0] | 0);
+              u = v;
+              v = c[(u + 4) >> 2] | 0;
+              e = p;
+              c[e >> 2] = c[u >> 2];
+              c[(e + 4) >> 2] = v;
+              bK(w, b, a[((c[f >> 2] | 0) + 1) >> 0] | 0);
+              e = w;
+              w = c[e >> 2] | 0;
+              e = c[(e + 4) >> 2] | 0;
+              v = j;
+              c[v >> 2] = w;
+              c[(v + 4) >> 2] = e;
+              w = ((c[p >> 2] | 0) + w) | 0;
+              if (
+                !((((w | 0) > -1 ? w : (0 - w) | 0) | 0) == 1
+                  ? ((w = ((c[(b + 184) >> 2] | 0) + e) | 0), (((w | 0) > -1 ? w : (0 - w) | 0) | 0) == 1)
+                  : 0)
+              ) {
+                bK(y, b, 66);
+                v = y;
+                y = c[(v + 4) >> 2] | 0;
+                w = p;
+                c[w >> 2] = c[v >> 2];
+                c[(w + 4) >> 2] = y;
+                bK(x, b, 76);
+                w = x;
+                x = c[(w + 4) >> 2] | 0;
+                y = j;
+                c[y >> 2] = c[w >> 2];
+                c[(y + 4) >> 2] = x;
+                c[z >> 2] = c[f >> 2];
+                gA(0, 100732, z) | 0;
+              }
+              if (a[((c[((c[(d + 16) >> 2] | 0) + 8) >> 2] | 0) + 82) >> 0] | 0) {
+                if (i > g) {
+                  m = (i - g) * 0.5;
+                  h[G >> 3] = m;
+                } else m = 0.0;
+                i = +h[r >> 3];
+                o = +h[(I + 8) >> 3];
+                if (i > o) {
+                  i = (i - o) * 0.5;
+                  h[(G + 8) >> 3] = i;
+                } else i = 0.0;
+              } else {
+                i = 0.0;
+                m = 0.0;
+              }
+              if (!(c[H >> 2] | 0)) j = 1;
+              else {
+                c[J >> 2] = c[I >> 2];
+                c[(J + 4) >> 2] = c[(I + 4) >> 2];
+                c[(J + 8) >> 2] = c[(I + 8) >> 2];
+                c[(J + 12) >> 2] = c[(I + 12) >> 2];
+                aK(A, J);
+                c[I >> 2] = c[A >> 2];
+                c[(I + 4) >> 2] = c[(A + 4) >> 2];
+                c[(I + 8) >> 2] = c[(A + 8) >> 2];
+                c[(I + 12) >> 2] = c[(A + 12) >> 2];
+                c[J >> 2] = c[E >> 2];
+                c[(J + 4) >> 2] = c[(E + 4) >> 2];
+                c[(J + 8) >> 2] = c[(E + 8) >> 2];
+                c[(J + 12) >> 2] = c[(E + 12) >> 2];
+                aK(B, J);
+                c[E >> 2] = c[B >> 2];
+                c[(E + 4) >> 2] = c[(B + 4) >> 2];
+                c[(E + 8) >> 2] = c[(B + 8) >> 2];
+                c[(E + 12) >> 2] = c[(B + 12) >> 2];
+                c[J >> 2] = c[F >> 2];
+                c[(J + 4) >> 2] = c[(F + 4) >> 2];
+                c[(J + 8) >> 2] = c[(F + 8) >> 2];
+                c[(J + 12) >> 2] = c[(F + 12) >> 2];
+                aK(C, J);
+                c[F >> 2] = c[C >> 2];
+                c[(F + 4) >> 2] = c[(C + 4) >> 2];
+                c[(F + 8) >> 2] = c[(C + 8) >> 2];
+                c[(F + 12) >> 2] = c[(C + 12) >> 2];
+                c[J >> 2] = c[G >> 2];
+                c[(J + 4) >> 2] = c[(G + 4) >> 2];
+                c[(J + 8) >> 2] = c[(G + 8) >> 2];
+                c[(J + 12) >> 2] = c[(G + 12) >> 2];
+                aK(D, J);
+                c[G >> 2] = c[D >> 2];
+                c[(G + 4) >> 2] = c[(D + 4) >> 2];
+                c[(G + 8) >> 2] = c[(D + 8) >> 2];
+                c[(G + 12) >> 2] = c[(D + 12) >> 2];
+                n = +h[F >> 3];
+                m = +h[G >> 3];
+                k = +h[q >> 3];
+                i = +h[(G + 8) >> 3];
+                g = +h[I >> 3];
+                j = (c[H >> 2] | 0) == 0;
+              }
+              o = m + n;
+              h[(b + 384) >> 3] = o;
+              P = i + k;
+              h[(b + 392) >> 3] = P;
+              N = m + n + g;
+              h[(b + 400) >> 3] = N;
+              Q = +h[(I + 8) >> 3];
+              n = i + k + Q;
+              h[(b + 408) >> 3] = n;
+              m = +h[(b + 352) >> 3];
+              h[(b + 320) >> 3] = g / m;
+              h[(b + 328) >> 3] = Q / m;
+              m = +h[s >> 3];
+              o = o * 0.013888888888888888 * m;
+              f = (b + 456) | 0;
+              c[f >> 2] = ~~(o + (o >= 0.0 ? 0.5 : -0.5));
+              o = +h[t >> 3];
+              k = P * 0.013888888888888888 * o;
+              c[(b + 460) >> 2] = ~~(k + (k >= 0.0 ? 0.5 : -0.5));
+              m = N * 0.013888888888888888 * m;
+              e = (b + 464) | 0;
+              c[e >> 2] = ~~(m + (m >= 0.0 ? 0.5 : -0.5));
+              o = n * 0.013888888888888888 * o;
+              c[(b + 468) >> 2] = ~~(o + (o >= 0.0 ? 0.5 : -0.5));
+              if (!j) {
+                c[J >> 2] = c[f >> 2];
+                c[(J + 4) >> 2] = c[(f + 4) >> 2];
+                NJ(K, J);
+                I = K;
+                K = c[(I + 4) >> 2] | 0;
+                b = f;
+                c[b >> 2] = c[I >> 2];
+                c[(b + 4) >> 2] = K;
+                c[J >> 2] = c[e >> 2];
+                c[(J + 4) >> 2] = c[(e + 4) >> 2];
+                NJ(L, J);
+                b = L;
+                K = c[(b + 4) >> 2] | 0;
+                L = e;
+                c[L >> 2] = c[b >> 2];
+                c[(L + 4) >> 2] = K;
+              }
+              l = M;
+              return;
+            }
+            function aK(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0;
+              c = +h[b >> 3];
+              h[a >> 3] = +h[(b + 8) >> 3];
+              h[(a + 8) >> 3] = c;
+              return;
+            }
+            function bK(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              d = (((d << 24) >> 24) + -66) | 0;
+              switch ((d >>> 1) | (d << 31) | 0) {
+                case 9: {
+                  c[(b + 176) >> 2] = (c[(b + 168) >> 2] | 0) + -1;
+                  b = 0;
+                  d = -1;
+                  break;
+                }
+                case 0: {
+                  b = 0;
+                  d = 1;
+                  break;
+                }
+                case 5: {
+                  b = 1;
+                  d = 0;
+                  break;
+                }
+                case 8: {
+                  c[(b + 172) >> 2] = (c[(b + 164) >> 2] | 0) + -1;
+                  b = -1;
+                  d = 0;
+                  break;
+                }
+                default: {
+                  b = 0;
+                  d = 0;
+                }
+              }
+              c[a >> 2] = b;
+              c[(a + 4) >> 2] = d;
+              return;
+            }
+            function cK(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 16) | 0;
+              g = j;
+              f = QA(d, 100973) | 0;
+              i = (b + 296) | 0;
+              c[i >> 2] = (f | 0) == 0 ? 100982 : f;
+              d = QA(d, 100986) | 0;
+              f = (b + 300) | 0;
+              d = (d | 0) == 0 ? 100999 : d;
+              c[f >> 2] = d;
+              d = G4(c[i >> 2] | 0, d) | 0;
+              if (d | 0) {
+                c[g >> 2] = a[d >> 0];
+                gA(0, 101001, g) | 0;
+                c[f >> 2] = 195059;
+              }
+              d = D4(e) | 0;
+              c[(b + 304) >> 2] = d;
+              h = (b + 308) | 0;
+              f = 0;
+              b = 0;
+              while (1) {
+                e = A4(d, c[i >> 2] | 0) | 0;
+                if (!e) break;
+                g = (b + 1) | 0;
+                if ((b | 0) < (f | 0)) d = c[h >> 2] | 0;
+                else {
+                  f = (f + 128) | 0;
+                  d = c[h >> 2] | 0;
+                  if (!d) d = KK(f << 2) | 0;
+                  else d = MK(d, f << 2) | 0;
+                  c[h >> 2] = d;
+                }
+                c[(d + (g << 2)) >> 2] = e;
+                b = g;
+                d = 0;
+              }
+              if (b | 0) {
+                i = MK(c[h >> 2] | 0, ((b << 2) + 8) | 0) | 0;
+                c[h >> 2] = i;
+                c[i >> 2] = 0;
+                c[((c[h >> 2] | 0) + ((b + 1) << 2)) >> 2] = 0;
+              }
+              l = j;
+              return b | 0;
+            }
+            function dK(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 16) | 0;
+              j = k;
+              i = (a + 312) | 0;
+              d = KK(((c[i >> 2] << 2) + 8) | 0) | 0;
+              e = 0;
+              h = 1;
+              while (1) {
+                g = c[i >> 2] | 0;
+                if ((h | 0) > (g | 0)) break;
+                f = (e + 1) | 0;
+                if (((uJ(a, h, g, b) | 0) << 24) >> 24) {
+                  c[(d + (f << 2)) >> 2] = h;
+                  e = f;
+                }
+                h = (h + 1) | 0;
+              }
+              if (!e) {
+                c[j >> 2] = b;
+                gA(0, 100872, j) | 0;
+                U1(d);
+                d = 0;
+              } else {
+                c[d >> 2] = e;
+                c[(d + ((e + 1) << 2)) >> 2] = (c[i >> 2] | 0) + 1;
+              }
+              l = k;
+              return d | 0;
+            }
+            function eK(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0.0,
+                f = 0.0,
+                g = 0.0;
+              d = c[(b + 16) >> 2] | 0;
+              g = +h[(d + 16) >> 3];
+              h[(d + 48) >> 3] = g - +h[(d + 88) >> 3];
+              e = +h[(d + 24) >> 3];
+              f = +h[(d + 80) >> 3] * 0.5;
+              h[(d + 56) >> 3] = e - f;
+              h[(d + 64) >> 3] = +h[(d + 96) >> 3] + g;
+              h[(d + 72) >> 3] = f + e;
+              b = XA(a, b) | 0;
+              while (1) {
+                if (!b) break;
+                fK(b);
+                b = ZA(a, b) | 0;
+              }
+              return;
+            }
+            function fK(a) {
+              a = a | 0;
+              a = c[((c[(a + 16) >> 2] | 0) + 8) >> 2] | 0;
+              if (a | 0) gK(a);
+              return;
+            }
+            function gK(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0;
+              C = l;
+              l = (l + 240) | 0;
+              v = (C + 192) | 0;
+              u = (C + 176) | 0;
+              w = (C + 64) | 0;
+              x = (C + 32) | 0;
+              y = C;
+              z = (C + 144) | 0;
+              A = (C + 112) | 0;
+              B = (a + 4) | 0;
+              if ((c[B >> 2] | 0) <= 0) qa(101140, 99906, 3994, 101154);
+              b = c[a >> 2] | 0;
+              d = w;
+              e = b;
+              f = (d + 48) | 0;
+              do {
+                c[d >> 2] = c[e >> 2];
+                d = (d + 4) | 0;
+                e = (e + 4) | 0;
+              } while ((d | 0) < (f | 0));
+              d = v;
+              e = b;
+              f = (d + 48) | 0;
+              do {
+                c[d >> 2] = c[e >> 2];
+                d = (d + 4) | 0;
+                e = (e + 4) | 0;
+              } while ((d | 0) < (f | 0));
+              hK(x, v);
+              i = (x + 8) | 0;
+              j = (y + 8) | 0;
+              k = (x + 16) | 0;
+              m = (y + 16) | 0;
+              n = (x + 24) | 0;
+              o = (y + 24) | 0;
+              p = (w + 8) | 0;
+              q = (w + 12) | 0;
+              r = (w + 32) | 0;
+              s = (w + 4) | 0;
+              t = (w + 16) | 0;
+              g = 0;
+              while (1) {
+                if ((g | 0) >= (c[B >> 2] | 0)) break;
+                if ((g | 0) > 0) {
+                  b = ((c[a >> 2] | 0) + ((g * 48) | 0)) | 0;
+                  d = w;
+                  e = b;
+                  f = (d + 48) | 0;
+                  do {
+                    c[d >> 2] = c[e >> 2];
+                    d = (d + 4) | 0;
+                    e = (e + 4) | 0;
+                  } while ((d | 0) < (f | 0));
+                  d = v;
+                  e = b;
+                  f = (d + 48) | 0;
+                  do {
+                    c[d >> 2] = c[e >> 2];
+                    d = (d + 4) | 0;
+                    e = (e + 4) | 0;
+                  } while ((d | 0) < (f | 0));
+                  hK(y, v);
+                  h[x >> 3] = +h[(+h[x >> 3] < +h[y >> 3] ? x : y) >> 3];
+                  h[i >> 3] = +h[((+h[i >> 3] < +h[j >> 3] ? x : y) + 8) >> 3];
+                  h[k >> 3] = +h[((+h[k >> 3] > +h[m >> 3] ? x : y) + 16) >> 3];
+                  h[n >> 3] = +h[((+h[n >> 3] > +h[o >> 3] ? x : y) + 24) >> 3];
+                }
+                b = c[p >> 2] | 0;
+                if (b | 0) {
+                  f = c[w >> 2] | 0;
+                  c[u >> 2] = c[t >> 2];
+                  c[(u + 4) >> 2] = c[(t + 4) >> 2];
+                  c[(u + 8) >> 2] = c[(t + 8) >> 2];
+                  c[(u + 12) >> 2] = c[(t + 12) >> 2];
+                  c[v >> 2] = c[f >> 2];
+                  c[(v + 4) >> 2] = c[(f + 4) >> 2];
+                  c[(v + 8) >> 2] = c[(f + 8) >> 2];
+                  c[(v + 12) >> 2] = c[(f + 12) >> 2];
+                  YH(z, u, v, 1.0, b);
+                  c[y >> 2] = c[z >> 2];
+                  c[(y + 4) >> 2] = c[(z + 4) >> 2];
+                  c[(y + 8) >> 2] = c[(z + 8) >> 2];
+                  c[(y + 12) >> 2] = c[(z + 12) >> 2];
+                  c[(y + 16) >> 2] = c[(z + 16) >> 2];
+                  c[(y + 20) >> 2] = c[(z + 20) >> 2];
+                  c[(y + 24) >> 2] = c[(z + 24) >> 2];
+                  c[(y + 28) >> 2] = c[(z + 28) >> 2];
+                  h[x >> 3] = +h[(+h[x >> 3] < +h[y >> 3] ? x : y) >> 3];
+                  h[i >> 3] = +h[((+h[i >> 3] < +h[j >> 3] ? x : y) + 8) >> 3];
+                  h[k >> 3] = +h[((+h[k >> 3] > +h[m >> 3] ? x : y) + 16) >> 3];
+                  h[n >> 3] = +h[((+h[n >> 3] > +h[o >> 3] ? x : y) + 24) >> 3];
+                }
+                b = c[q >> 2] | 0;
+                if (b | 0) {
+                  f = ((c[w >> 2] | 0) + (((c[s >> 2] | 0) + -1) << 4)) | 0;
+                  c[u >> 2] = c[r >> 2];
+                  c[(u + 4) >> 2] = c[(r + 4) >> 2];
+                  c[(u + 8) >> 2] = c[(r + 8) >> 2];
+                  c[(u + 12) >> 2] = c[(r + 12) >> 2];
+                  c[v >> 2] = c[f >> 2];
+                  c[(v + 4) >> 2] = c[(f + 4) >> 2];
+                  c[(v + 8) >> 2] = c[(f + 8) >> 2];
+                  c[(v + 12) >> 2] = c[(f + 12) >> 2];
+                  YH(A, u, v, 1.0, b);
+                  c[y >> 2] = c[A >> 2];
+                  c[(y + 4) >> 2] = c[(A + 4) >> 2];
+                  c[(y + 8) >> 2] = c[(A + 8) >> 2];
+                  c[(y + 12) >> 2] = c[(A + 12) >> 2];
+                  c[(y + 16) >> 2] = c[(A + 16) >> 2];
+                  c[(y + 20) >> 2] = c[(A + 20) >> 2];
+                  c[(y + 24) >> 2] = c[(A + 24) >> 2];
+                  c[(y + 28) >> 2] = c[(A + 28) >> 2];
+                  h[x >> 3] = +h[(+h[x >> 3] < +h[y >> 3] ? x : y) >> 3];
+                  h[i >> 3] = +h[((+h[i >> 3] < +h[j >> 3] ? x : y) + 8) >> 3];
+                  h[k >> 3] = +h[((+h[k >> 3] > +h[m >> 3] ? x : y) + 16) >> 3];
+                  h[n >> 3] = +h[((+h[n >> 3] > +h[o >> 3] ? x : y) + 24) >> 3];
+                }
+                g = (g + 1) | 0;
+              }
+              B = (a + 8) | 0;
+              c[B >> 2] = c[x >> 2];
+              c[(B + 4) >> 2] = c[(x + 4) >> 2];
+              c[(B + 8) >> 2] = c[(x + 8) >> 2];
+              c[(B + 12) >> 2] = c[(x + 12) >> 2];
+              c[(B + 16) >> 2] = c[(x + 16) >> 2];
+              c[(B + 20) >> 2] = c[(x + 20) >> 2];
+              c[(B + 24) >> 2] = c[(x + 24) >> 2];
+              c[(B + 28) >> 2] = c[(x + 28) >> 2];
+              l = C;
+              return;
+            }
+            function hK(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0,
+                r = 0.0,
+                s = 0.0,
+                t = 0;
+              n = l;
+              l = (l + 48) | 0;
+              i = (n + 32) | 0;
+              j = n;
+              k = c[(b + 4) >> 2] | 0;
+              if ((k | 0) <= 0) qa(101170, 99906, 3968, 101182);
+              if (((k >>> 0) % 3 | 0 | 0) != 1) qa(101192, 99906, 3969, 101182);
+              m = (j + 16) | 0;
+              d = c[b >> 2] | 0;
+              c[m >> 2] = c[d >> 2];
+              c[(m + 4) >> 2] = c[(d + 4) >> 2];
+              c[(m + 8) >> 2] = c[(d + 8) >> 2];
+              c[(m + 12) >> 2] = c[(d + 12) >> 2];
+              c[j >> 2] = c[d >> 2];
+              c[(j + 4) >> 2] = c[(d + 4) >> 2];
+              c[(j + 8) >> 2] = c[(d + 8) >> 2];
+              c[(j + 12) >> 2] = c[(d + 12) >> 2];
+              e = (i + 8) | 0;
+              f = (j + 8) | 0;
+              g = (j + 24) | 0;
+              b = 1;
+              while (1) {
+                if ((b | 0) >= (k | 0)) break;
+                p = +h[(d + (b << 4) + 8) >> 3];
+                t = (b + 1) | 0;
+                o = +h[(d + (t << 4) + 8) >> 3];
+                r = (+h[(d + (t << 4)) >> 3] + +h[(d + (b << 4)) >> 3]) * 0.5;
+                h[i >> 3] = r;
+                p = (o + p) * 0.5;
+                h[e >> 3] = p;
+                o = +h[(+h[j >> 3] < r ? j : i) >> 3];
+                h[j >> 3] = o;
+                s = +h[((+h[f >> 3] < p ? j : i) + 8) >> 3];
+                h[f >> 3] = s;
+                r = +h[(+h[m >> 3] > r ? m : i) >> 3];
+                h[m >> 3] = r;
+                p = +h[((+h[g >> 3] > p ? m : i) + 8) >> 3];
+                h[g >> 3] = p;
+                t = (d + ((b + 2) << 4)) | 0;
+                c[i >> 2] = c[t >> 2];
+                c[(i + 4) >> 2] = c[(t + 4) >> 2];
+                c[(i + 8) >> 2] = c[(t + 8) >> 2];
+                c[(i + 12) >> 2] = c[(t + 12) >> 2];
+                q = +h[i >> 3];
+                h[j >> 3] = +h[(o < q ? j : i) >> 3];
+                o = +h[e >> 3];
+                h[f >> 3] = +h[((s < o ? j : i) + 8) >> 3];
+                h[m >> 3] = +h[(r > q ? m : i) >> 3];
+                h[g >> 3] = +h[((p > o ? m : i) + 8) >> 3];
+                b = (b + 3) | 0;
+              }
+              c[a >> 2] = c[j >> 2];
+              c[(a + 4) >> 2] = c[(j + 4) >> 2];
+              c[(a + 8) >> 2] = c[(j + 8) >> 2];
+              c[(a + 12) >> 2] = c[(j + 12) >> 2];
+              c[(a + 16) >> 2] = c[(j + 16) >> 2];
+              c[(a + 20) >> 2] = c[(j + 20) >> 2];
+              c[(a + 24) >> 2] = c[(j + 24) >> 2];
+              c[(a + 28) >> 2] = c[(j + 28) >> 2];
+              l = n;
+              return;
+            }
+            function iK(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0,
+                e = 0.0,
+                f = 0.0,
+                g = 0.0,
+                i = 0,
+                j = 0.0,
+                k = 0,
+                l = 0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0,
+                r = 0.0;
+              q = +h[a >> 3];
+              r = +h[c >> 3];
+              k = !(q >= r);
+              if ((!k ? q <= +h[(c + 16) >> 3] : 0) ? ((e = +h[(a + 8) >> 3]), e >= +h[(c + 8) >> 3]) : 0)
+                i = e <= +h[(c + 24) >> 3];
+              else i = 0;
+              e = +h[b >> 3];
+              if ((e >= r ? e <= +h[(c + 16) >> 3] : 0) ? ((f = +h[(b + 8) >> 3]), f >= +h[(c + 8) >> 3]) : 0) {
+                d = f <= +h[(c + 24) >> 3];
+                if (!(i ^ d))
+                  if (i & d) d = 1;
+                  else l = 11;
+                else d = 0;
+              } else if (i) d = 0;
+              else l = 11;
+              a: do
+                if ((l | 0) == 11) {
+                  p = +h[(a + 8) >> 3];
+                  do
+                    if (q == e) {
+                      r = +h[(c + 8) >> 3];
+                      if (!(k | ((p >= r) ^ (+h[(b + 8) >> 3] >= r) ^ 1)) ? q <= +h[(c + 16) >> 3] : 0) {
+                        d = 0;
+                        break a;
+                      }
+                    } else {
+                      j = +h[(b + 8) >> 3];
+                      if (p == j) {
+                        if (!((q >= r) ^ (e >= r))) break;
+                        if (!(p >= +h[(c + 8) >> 3])) break;
+                        if (!(p <= +h[(c + 24) >> 3])) break;
+                        else {
+                          d = 0;
+                          break a;
+                        }
+                      }
+                      o = (j - p) / (e - q);
+                      l = q < e;
+                      g = l ? q : e;
+                      e = l ? e : q;
+                      f = (r - q) * o + p;
+                      m = +h[(c + 8) >> 3];
+                      if (!(!(r >= g) | !(r <= e) | !(f >= m)) ? f <= +h[(c + 24) >> 3] : 0) {
+                        d = 0;
+                        break a;
+                      }
+                      n = +h[(c + 16) >> 3];
+                      f = (n - r) * o + f;
+                      if (f >= m ? !(!(n <= e) | (n >= g ? !(f <= +h[(c + 24) >> 3]) : 1)) : 0) {
+                        d = 0;
+                        break a;
+                      }
+                      l = p < j;
+                      g = l ? p : j;
+                      f = l ? j : p;
+                      e = (m - p) / o + q;
+                      if (e >= r ? !(!(m <= f) | (!(m >= g) | !(e <= n))) : 0) {
+                        d = 0;
+                        break a;
+                      }
+                      p = +h[(c + 24) >> 3];
+                      q = (p - m) / o + e;
+                      if (q >= r ? !(!(p <= f) | (!(p >= g) | !(q <= n))) : 0) {
+                        d = 0;
+                        break a;
+                      }
+                    }
+                  while (0);
+                  d = -1;
+                }
+              while (0);
+              return d | 0;
+            }
+            function jK(a) {
+              a = a | 0;
+              var b = 0,
+                c = 0.0;
+              b = (a + 16) | 0;
+              c = +h[b >> 3];
+              h[(a + 32) >> 3] = c;
+              h[(a + 48) >> 3] = c;
+              h[(a + 40) >> 3] = +h[(a + 24) >> 3];
+              h[(a + 56) >> 3] = +h[(a + 8) >> 3];
+              h[b >> 3] = +h[a >> 3];
+              return;
+            }
+            function kK(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0;
+              if ((c[47131] | 0) != (d | 0)) {
+                N2(+(d | 0) * 0.15915494309189535, 186328, 186336);
+                c[47131] = d;
+              }
+              g = +h[b >> 3];
+              e = +h[23292];
+              f = +h[(b + 8) >> 3];
+              i = +h[23291];
+              h[a >> 3] = e * g - i * f;
+              h[(a + 8) >> 3] = i * g + f * e;
+              return;
+            }
+            function lK(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 16) | 0;
+              f = k;
+              e = +h[b >> 3];
+              i = (b + 8) | 0;
+              g = +h[i >> 3];
+              a: do
+                switch (d | 0) {
+                  case 0: {
+                    j = 11;
+                    break;
+                  }
+                  case 90: {
+                    h[b >> 3] = g;
+                    e = -e;
+                    j = 10;
+                    break;
+                  }
+                  case 180: {
+                    e = -g;
+                    j = 10;
+                    break;
+                  }
+                  case 270: {
+                    h[b >> 3] = g;
+                    j = 10;
+                    break;
+                  }
+                  default: {
+                    if ((d | 0) < 0) {
+                      c[f >> 2] = c[b >> 2];
+                      c[(f + 4) >> 2] = c[(b + 4) >> 2];
+                      c[(f + 8) >> 2] = c[(b + 8) >> 2];
+                      c[(f + 12) >> 2] = c[(b + 12) >> 2];
+                      mK(a, f, (0 - d) | 0);
+                      break a;
+                    }
+                    if ((d | 0) > 360) {
+                      c[f >> 2] = c[b >> 2];
+                      c[(f + 4) >> 2] = c[(b + 4) >> 2];
+                      c[(f + 8) >> 2] = c[(b + 8) >> 2];
+                      c[(f + 12) >> 2] = c[(b + 12) >> 2];
+                      lK(a, f, (d >>> 0) % 360 | 0);
+                      break a;
+                    } else {
+                      c[f >> 2] = c[b >> 2];
+                      c[(f + 4) >> 2] = c[(b + 4) >> 2];
+                      c[(f + 8) >> 2] = c[(b + 8) >> 2];
+                      c[(f + 12) >> 2] = c[(b + 12) >> 2];
+                      kK(a, f, d);
+                      break a;
+                    }
+                  }
+                }
+              while (0);
+              if ((j | 0) == 10) {
+                h[i >> 3] = e;
+                j = 11;
+              }
+              if ((j | 0) == 11) {
+                c[a >> 2] = c[b >> 2];
+                c[(a + 4) >> 2] = c[(b + 4) >> 2];
+                c[(a + 8) >> 2] = c[(b + 8) >> 2];
+                c[(a + 12) >> 2] = c[(b + 12) >> 2];
+              }
+              l = k;
+              return;
+            }
+            function mK(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 16) | 0;
+              f = k;
+              e = +h[b >> 3];
+              i = (b + 8) | 0;
+              g = +h[i >> 3];
+              a: do
+                switch (d | 0) {
+                  case 0: {
+                    j = 11;
+                    break;
+                  }
+                  case 90: {
+                    h[b >> 3] = -g;
+                    j = 10;
+                    break;
+                  }
+                  case 180: {
+                    e = -g;
+                    j = 10;
+                    break;
+                  }
+                  case 270: {
+                    h[b >> 3] = g;
+                    j = 10;
+                    break;
+                  }
+                  default: {
+                    if ((d | 0) < 0) {
+                      c[f >> 2] = c[b >> 2];
+                      c[(f + 4) >> 2] = c[(b + 4) >> 2];
+                      c[(f + 8) >> 2] = c[(b + 8) >> 2];
+                      c[(f + 12) >> 2] = c[(b + 12) >> 2];
+                      lK(a, f, (0 - d) | 0);
+                      break a;
+                    }
+                    if ((d | 0) > 360) {
+                      c[f >> 2] = c[b >> 2];
+                      c[(f + 4) >> 2] = c[(b + 4) >> 2];
+                      c[(f + 8) >> 2] = c[(b + 8) >> 2];
+                      c[(f + 12) >> 2] = c[(b + 12) >> 2];
+                      mK(a, f, (d >>> 0) % 360 | 0);
+                      break a;
+                    } else {
+                      c[f >> 2] = c[b >> 2];
+                      c[(f + 4) >> 2] = c[(b + 4) >> 2];
+                      c[(f + 8) >> 2] = c[(b + 8) >> 2];
+                      c[(f + 12) >> 2] = c[(b + 12) >> 2];
+                      kK(a, f, (360 - d) | 0);
+                      break a;
+                    }
+                  }
+                }
+              while (0);
+              if ((j | 0) == 10) {
+                h[i >> 3] = e;
+                j = 11;
+              }
+              if ((j | 0) == 11) {
+                c[a >> 2] = c[b >> 2];
+                c[(a + 4) >> 2] = c[(b + 4) >> 2];
+                c[(a + 8) >> 2] = c[(b + 8) >> 2];
+                c[(a + 12) >> 2] = c[(b + 12) >> 2];
+              }
+              l = k;
+              return;
+            }
+            function nK(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0.0,
+                g = 0.0;
+              g = +h[c >> 3];
+              d = +h[(c + 8) >> 3];
+              f = d + +h[b >> 3];
+              e = g + +h[(b + 24) >> 3];
+              d = d + +h[(b + 16) >> 3];
+              h[a >> 3] = g + +h[(b + 8) >> 3];
+              h[(a + 8) >> 3] = f;
+              h[(a + 16) >> 3] = e;
+              h[(a + 24) >> 3] = d;
+              return;
+            }
+            function oK(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0.0,
+                g = 0.0;
+              f = +h[a >> 3];
+              d = +h[b >> 3] - f;
+              g = +h[(a + 8) >> 3];
+              e = +h[(b + 8) >> 3] - g;
+              f = (+h[(c + 8) >> 3] - g) * d - (+h[c >> 3] - f) * e;
+              f = f * f;
+              return +(f < 1.0e-10 ? 0.0 : f / (e * e + d * d));
+            }
+            function pK(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              g = l;
+              l = (l + 16) | 0;
+              f = (g + 8) | 0;
+              e = g;
+              a = QA(a, b) | 0;
+              if (a | 0 ? ((c[f >> 2] = e), (b5(a, 101209, f) | 0) > 0) : 0) h[d >> 3] = +h[e >> 3];
+              l = g;
+              return;
+            }
+            function qK(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              n = l;
+              l = (l + 16) | 0;
+              g = (n + 8) | 0;
+              i = n;
+              e = JK(96) | 0;
+              m = (b + 16) | 0;
+              c[((c[m >> 2] | 0) + 8) >> 2] = e;
+              e = QA(b, 101213) | 0;
+              if (!e) {
+                e = Ta(101222) | 0;
+                if (e | 0) k = 3;
+              } else k = 3;
+              if ((k | 0) == 3) cb(101234, e | 0, 1) | 0;
+              e = (rK(b) | 0) & 255;
+              a[((c[m >> 2] | 0) + 115) >> 0] = e;
+              if (0 == 0 ? ((e = QA(b, 101245) | 0), (c[47133] = e), (e | 0) == 0) : 0) c[47133] = c[47132];
+              f = +_O(b, GA(b, 0, 101255, 0) | 0, 0.0, 0.0);
+              h[c[((c[m >> 2] | 0) + 8) >> 2] >> 3] = f;
+              e = QA(b, 101263) | 0;
+              a: do
+                if (!e) e = 0;
+                else {
+                  switch (a[e >> 0] | 0) {
+                    case 76: {
+                      if (!(s2(e, 101271) | 0)) {
+                        e = 1;
+                        break a;
+                      }
+                      break;
+                    }
+                    case 66: {
+                      if (!(s2(e, 101274) | 0)) {
+                        e = 2;
+                        break a;
+                      }
+                      break;
+                    }
+                    case 82: {
+                      e = (s2(e, 101277) | 0) == 0;
+                      e = e ? 3 : 0;
+                      break a;
+                    }
+                    default: {
+                      e = 0;
+                      break a;
+                    }
+                  }
+                  e = 0;
+                }
+              while (0);
+              c[((c[m >> 2] | 0) + 116) >> 2] = (e << 2) | ((d << 24) >> 24 == 0 ? 0 : e);
+              f = +_O(b, GA(b, 0, 101280, 0) | 0, 0.25, 0.02);
+              h[i >> 3] = f;
+              f = f * 72.0;
+              c[((c[m >> 2] | 0) + 248) >> 2] = ~~(f + (f >= 0.0 ? 0.5 : -0.5));
+              e = aP(b, GA(b, 0, 101288, 0) | 0, 0) | 0;
+              if (e) {
+                c[g >> 2] = i;
+                if (b5(e, 101209, g) | 0) {
+                  f = +h[i >> 3];
+                  if (f < 0.02) {
+                    h[i >> 3] = 0.02;
+                    f = 0.02;
+                  }
+                } else {
+                  h[i >> 3] = 0.5;
+                  f = 0.5;
+                }
+                if (d4(e, 101296) | 0) a[((c[m >> 2] | 0) + 276) >> 0] = 1;
+              } else {
+                h[i >> 3] = 0.5;
+                f = 0.5;
+              }
+              f = f * 72.0;
+              c[((c[m >> 2] | 0) + 252) >> 2] = ~~(f + (f >= 0.0 ? 0.5 : -0.5));
+              i = (ZO(b, GA(b, 0, 101304, 0) | 0, 0, 0) | 0) & 255;
+              a[((c[m >> 2] | 0) + 243) >> 0] = i;
+              i = pP(aP(b, GA(b, 0, 101314, 0) | 0, 0) | 0, 20676, 20692) | 0;
+              c[((c[m >> 2] | 0) + 244) >> 2] = i;
+              sK(b);
+              i = tK(b, 101324, ((c[((c[m >> 2] | 0) + 8) >> 2] | 0) + 64) | 0) | 0;
+              e = c[((c[m >> 2] | 0) + 8) >> 2] | 0;
+              a[(e + 80) >> 0] = i;
+              tK(b, 101329, (e + 48) | 0) | 0;
+              e = dP(QA(b, 101334) | 0) | 0;
+              a[((c[((c[m >> 2] | 0) + 8) >> 2] | 0) + 82) >> 0] = e;
+              e = QA(b, 101341) | 0;
+              do
+                if (!e) {
+                  e = QA(b, 101348) | 0;
+                  if (e | 0) {
+                    e = (((a[e >> 0] | 32) << 24) >> 24 == 108) & 1;
+                    k = 27;
+                    break;
+                  }
+                  e = QA(b, 101360) | 0;
+                  if (e | 0) {
+                    e = dP(e) | 0;
+                    k = 27;
+                  }
+                } else {
+                  e = ((q5(e) | 0) == 90) & 1;
+                  k = 27;
+                }
+              while (0);
+              if ((k | 0) == 27) a[((c[((c[m >> 2] | 0) + 8) >> 2] | 0) + 81) >> 0] = e;
+              c[47135] = pP(QA(b, 101370) | 0, 20708, 20724) | 0;
+              a[194954] = dP(QA(b, 101382) | 0) | 0;
+              c[47138] = 0;
+              c[47139] = 0;
+              h[((c[((c[m >> 2] | 0) + 8) >> 2] | 0) + 24) >> 3] = 0.0;
+              e = QA(b, 101394) | 0;
+              if ((e | 0) != 0 ? (a[e >> 0] | 0) != 0 : 0) k = 32;
+              else k = 30;
+              if (((k | 0) == 30 ? ((j = QA(b, 101398) | 0), j | 0) : 0) ? a[j >> 0] | 0 : 0) {
+                e = j;
+                k = 32;
+              }
+              if ((k | 0) == 32) {
+                f = +r5(e);
+                h[((c[((c[m >> 2] | 0) + 8) >> 2] | 0) + 24) >> 3] = f;
+              }
+              uK(b);
+              h[23295] = 1e37;
+              c[47140] = GA(b, 0, 101409, 0) | 0;
+              c[47143] = GA(b, 0, 141034, 0) | 0;
+              c[47144] = GA(b, 0, 105496, 0) | 0;
+              c[47145] = GA(b, 1, 141048, 0) | 0;
+              c[47146] = GA(b, 1, 141116, 0) | 0;
+              c[47147] = GA(b, 1, 108230, 0) | 0;
+              c[47148] = GA(b, 1, 140823, 0) | 0;
+              c[47149] = GA(b, 1, 101418, 0) | 0;
+              c[47157] = GA(b, 1, 141082, 0) | 0;
+              c[47150] = GA(b, 1, 101428, 0) | 0;
+              c[47151] = GA(b, 1, 101437, 0) | 0;
+              c[47152] = GA(b, 1, 101446, 0) | 0;
+              k = GA(b, 1, 108224, 0) | 0;
+              c[47154] = k;
+              if (!k) c[47154] = GA(b, 1, 108224, 105493) | 0;
+              c[47155] = GA(b, 1, 101456, 0) | 0;
+              c[47158] = GA(b, 1, 101304, 0) | 0;
+              c[47172] = GA(b, 1, 101463, 0) | 0;
+              c[47161] = GA(b, 1, 101409, 0) | 0;
+              c[47153] = GA(b, 1, 105496, 0) | 0;
+              c[47159] = GA(b, 1, 141076, 0) | 0;
+              c[47160] = GA(b, 1, 101472, 0) | 0;
+              c[47163] = GA(b, 1, 101484, 0) | 0;
+              c[47162] = GA(b, 1, 101348, 0) | 0;
+              c[47164] = GA(b, 1, 101489, 0) | 0;
+              c[47165] = GA(b, 1, 141024, 0) | 0;
+              c[47166] = GA(b, 1, 137297, 0) | 0;
+              c[47156] = GA(b, 1, 101500, 0) | 0;
+              c[47167] = GA(b, 1, 101510, 0) | 0;
+              c[47168] = GA(b, 1, 101516, 0) | 0;
+              c[47169] = GA(b, 1, 101522, 0) | 0;
+              c[47170] = GA(b, 1, 101530, 0) | 0;
+              c[47171] = GA(b, 1, 101539, 0) | 0;
+              c[47173] = GA(b, 1, 141034, 0) | 0;
+              c[47174] = GA(b, 2, 101541, 0) | 0;
+              c[47176] = GA(b, 2, 140823, 0) | 0;
+              c[47177] = GA(b, 2, 101418, 0) | 0;
+              c[47179] = GA(b, 2, 101428, 0) | 0;
+              c[47180] = GA(b, 2, 101437, 0) | 0;
+              c[47181] = GA(b, 2, 101446, 0) | 0;
+              c[47182] = GA(b, 2, 108224, 0) | 0;
+              c[47183] = GA(b, 2, 101456, 0) | 0;
+              c[47192] = GA(b, 2, 101548, 0) | 0;
+              c[47184] = GA(b, 2, 101559, 0) | 0;
+              c[47195] = GA(b, 2, 101563, 0) | 0;
+              c[47196] = GA(b, 2, 101573, 0) | 0;
+              c[47197] = GA(b, 2, 101583, 0) | 0;
+              c[47198] = GA(b, 2, 101593, 0) | 0;
+              c[47199] = GA(b, 2, 101603, 0) | 0;
+              c[47200] = GA(b, 2, 101617, 0) | 0;
+              c[47201] = GA(b, 2, 101631, 0) | 0;
+              c[47202] = GA(b, 2, 101646, 0) | 0;
+              c[47203] = GA(b, 2, 101660, 0) | 0;
+              c[47175] = GA(b, 2, 101671, 0) | 0;
+              c[47187] = GA(b, 2, 101304, 0) | 0;
+              c[47185] = GA(b, 2, 141082, 0) | 0;
+              c[47186] = GA(b, 2, 101678, 0) | 0;
+              c[47188] = GA(b, 2, 101687, 0) | 0;
+              c[47189] = GA(b, 2, 101697, 0) | 0;
+              c[47190] = GA(b, 2, 101510, 0) | 0;
+              c[47191] = GA(b, 2, 101522, 0) | 0;
+              c[47204] = GA(b, 2, 101708, 0) | 0;
+              c[47205] = GA(b, 2, 101717, 0) | 0;
+              c[47206] = GA(b, 2, 101463, 0) | 0;
+              e = $H(b) | 0;
+              c[((c[((c[m >> 2] | 0) + 8) >> 2] | 0) + 88) >> 2] = e;
+              e = QA(b, 141060) | 0;
+              if (e | 0 ? a[e >> 0] | 0 : 0) {
+                b = EK(e, b) | 0;
+                c[((c[((c[m >> 2] | 0) + 8) >> 2] | 0) + 92) >> 2] = b;
+              }
+              l = n;
+              return;
+            }
+            function rK(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              d = l;
+              l = (l + 16) | 0;
+              b = d;
+              a = bP(a, GA(a, 0, 101807, 0) | 0, 101815) | 0;
+              if (
+                (
+                  (
+                    (
+                      (((c3(a, 101821) | 0) != 0 ? (c3(a, 101829) | 0) != 0 : 0) ? (c3(a, 101836) | 0) != 0 : 0)
+                        ? (c3(a, 101839) | 0) != 0
+                        : 0
+                    )
+                      ? (c3(a, 101850) | 0) != 0
+                      : 0
+                  )
+                    ? (c3(a, 101861) | 0) != 0
+                    : 0
+                )
+                  ? (c3(a, 101871) | 0) != 0
+                  : 0
+              )
+                if ((c3(a, 101882) | 0) != 0 ? (c3(a, 101888) | 0) != 0 : 0)
+                  if ((c3(a, 101815) | 0) != 0 ? (c3(a, 101893) | 0) != 0 : 0) {
+                    c[b >> 2] = a;
+                    gA(0, 101898, b) | 0;
+                    a = 0;
+                  } else a = 0;
+                else a = 2;
+              else a = 1;
+              l = d;
+              return a | 0;
+            }
+            function sK(b) {
+              b = b | 0;
+              var d = 0.0,
+                e = 0,
+                f = 0;
+              e = QA(b, 101765) | 0;
+              a: do
+                if (e | 0 ? ((f = a[e >> 0] | 0), (f << 24) >> 24) : 0)
+                  switch (((f << 24) >> 24) | 0) {
+                    case 97: {
+                      if ((f << 24) >> 24 != 97) break a;
+                      if (s2(e, 101771) | 0) break a;
+                      c[((c[((c[(b + 16) >> 2] | 0) + 8) >> 2] | 0) + 84) >> 2] = 4;
+                      break a;
+                    }
+                    case 99: {
+                      if ((f << 24) >> 24 != 99) break a;
+                      if (s2(e, 101776) | 0) break a;
+                      c[((c[((c[(b + 16) >> 2] | 0) + 8) >> 2] | 0) + 84) >> 2] = 3;
+                      break a;
+                    }
+                    case 101: {
+                      if ((f << 24) >> 24 != 101) break a;
+                      if (s2(e, 101785) | 0) break a;
+                      c[((c[((c[(b + 16) >> 2] | 0) + 8) >> 2] | 0) + 84) >> 2] = 5;
+                      break a;
+                    }
+                    case 102: {
+                      if ((f << 24) >> 24 != 102) break a;
+                      if (s2(e, 101792) | 0) break a;
+                      c[((c[((c[(b + 16) >> 2] | 0) + 8) >> 2] | 0) + 84) >> 2] = 2;
+                      break a;
+                    }
+                    default: {
+                      d = +r5(e);
+                      if (!(d > 0.0)) break a;
+                      b = c[((c[(b + 16) >> 2] | 0) + 8) >> 2] | 0;
+                      c[(b + 84) >> 2] = 1;
+                      h[(b + 16) >> 3] = d;
+                      break a;
+                    }
+                  }
+              while (0);
+              return;
+            }
+            function tK(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0.0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              o = l;
+              l = (l + 48) | 0;
+              m = (o + 32) | 0;
+              i = (o + 16) | 0;
+              k = (o + 8) | 0;
+              j = o;
+              n = (o + 40) | 0;
+              a[n >> 0] = 0;
+              b = QA(b, d) | 0;
+              do
+                if (b) {
+                  c[i >> 2] = k;
+                  c[(i + 4) >> 2] = j;
+                  c[(i + 8) >> 2] = n;
+                  i = (b5(b, 101749, i) | 0) > 1;
+                  g = +h[k >> 3];
+                  f = +h[j >> 3];
+                  if (i & (g > 0.0) & (f > 0.0)) {
+                    g = g * 72.0;
+                    h[e >> 3] = +(~~(g + (g >= 0.0 ? 0.5 : -0.5)) | 0);
+                    g = f * 72.0;
+                    h[(e + 8) >> 3] = +(~~(g + (g >= 0.0 ? 0.5 : -0.5)) | 0);
+                    b = (a[n >> 0] | 0) == 33;
+                    break;
+                  }
+                  a[n >> 0] = 0;
+                  c[m >> 2] = k;
+                  c[(m + 4) >> 2] = n;
+                  m = (b5(b, 101759, m) | 0) > 0;
+                  f = +h[k >> 3];
+                  if (m & (f > 0.0)) {
+                    g = f * 72.0;
+                    g = +(~~(g + (g >= 0.0 ? 0.5 : -0.5)) | 0);
+                    h[e >> 3] = g;
+                    h[(e + 8) >> 3] = g;
+                    b = (a[n >> 0] | 0) == 33;
+                  } else b = 0;
+                } else b = 0;
+              while (0);
+              l = o;
+              return (b & 1) | 0;
+            }
+            function uK(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0.0,
+                g = 0.0,
+                i = 0;
+              d = QA(b, 108224) | 0;
+              do
+                if (d | 0 ? a[d >> 0] | 0 : 0) {
+                  e = ((c[((c[(b + 60) >> 2] | 0) + 16) >> 2] | 0) + 113) | 0;
+                  a[e >> 0] = a[e >> 0] | 8;
+                  e = (iD(d) | 0) != 0;
+                  g = +_O(b, GA(b, 0, 101428, 0) | 0, 14.0, 1.0);
+                  i = bP(b, GA(b, 0, 101437, 0) | 0, 107994) | 0;
+                  d = zK(b, d, e ? 2 : 0, g, i, bP(b, GA(b, 0, 101446, 0) | 0, 137314) | 0) | 0;
+                  i = (b + 16) | 0;
+                  c[((c[i >> 2] | 0) + 12) >> 2] = d;
+                  d = QA(b, 105628) | 0;
+                  e = (d | 0) != 0;
+                  do
+                    if ((yC(b) | 0) == (b | 0)) {
+                      if (e ? (a[d >> 0] | 0) == 116 : 0) {
+                        d = 1;
+                        break;
+                      }
+                      d = 0;
+                    } else {
+                      if (e ? (a[d >> 0] | 0) == 98 : 0) {
+                        d = 0;
+                        break;
+                      }
+                      d = 1;
+                    }
+                  while (0);
+                  e = QA(b, 101726) | 0;
+                  a: do
+                    if (e)
+                      switch (a[e >> 0] | 0) {
+                        case 108: {
+                          d = d | 2;
+                          break a;
+                        }
+                        case 114: {
+                          d = d | 4;
+                          break a;
+                        }
+                        default:
+                          break a;
+                      }
+                  while (0);
+                  a[((c[i >> 2] | 0) + 275) >> 0] = d;
+                  if ((yC(b) | 0) != (b | 0)) {
+                    d = c[((c[i >> 2] | 0) + 12) >> 2] | 0;
+                    f = +h[(d + 24) >> 3] + 16.0;
+                    g = +h[(d + 32) >> 3] + 8.0;
+                    b = ((c[((c[((yC(b) | 0) + 16) >> 2] | 0) + 116) >> 2] & 1) | 0) == 0;
+                    d = c[i >> 2] | 0;
+                    e = (a[(d + 275) >> 0] << 1) & 2;
+                    if (b) {
+                      b = e & 255;
+                      h[(d + 48 + (b << 4)) >> 3] = f;
+                      h[(d + 48 + (b << 4) + 8) >> 3] = g;
+                      break;
+                    } else {
+                      b = (e ^ 3) & 255;
+                      h[(d + 48 + (b << 4)) >> 3] = g;
+                      h[(d + 48 + (b << 4) + 8) >> 3] = f;
+                      break;
+                    }
+                  }
+                }
+              while (0);
+              return;
+            }
+            function vK(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              e = (a + 16) | 0;
+              d = c[e >> 2] | 0;
+              b = c[(d + 8) >> 2] | 0;
+              do
+                if (!b) b = d;
+                else {
+                  d = c[(b + 88) >> 2] | 0;
+                  if (d) {
+                    EH(d);
+                    d = c[e >> 2] | 0;
+                    b = c[(d + 8) >> 2] | 0;
+                    if (!b) {
+                      b = d;
+                      break;
+                    }
+                  }
+                  U1(c[(b + 92) >> 2] | 0);
+                  b = c[e >> 2] | 0;
+                }
+              while (0);
+              U1(c[(b + 8) >> 2] | 0);
+              e = c[e >> 2] | 0;
+              c[(e + 8) >> 2] = 0;
+              CK(c[(e + 12) >> 2] | 0);
+              ZC(a, 0, 137483);
+              return;
+            }
+            function wK(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              d = l;
+              l = (l + 16) | 0;
+              b = d;
+              switch (a | 0) {
+                case 0: {
+                  a = 101971;
+                  break;
+                }
+                case 1: {
+                  a = 101839;
+                  break;
+                }
+                case 2: {
+                  a = 101977;
+                  break;
+                }
+                default: {
+                  c[b >> 2] = a;
+                  gA(1, 101941, b) | 0;
+                  a = 101971;
+                }
+              }
+              l = d;
+              return a | 0;
+            }
+            function xK(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              f = c[d >> 2] | 0;
+              l = (d + 24) | 0;
+              c[l >> 2] = 0;
+              c[(l + 4) >> 2] = 0;
+              c[(l + 8) >> 2] = 0;
+              c[(l + 12) >> 2] = 0;
+              if (a[f >> 0] | 0) {
+                i = KK(((l2(f) | 0) + 1) | 0) | 0;
+                a[i >> 0] = 0;
+                j = (d + 12) | 0;
+                e = i;
+                a: while (1) {
+                  b: while (1) {
+                    h = (f + 1) | 0;
+                    g = a[f >> 0] | 0;
+                    if (!((g << 24) >> 24)) break a;
+                    if (!(((g << 24) >> 24 == -1) | (((g & 255) < 161) | ((c[j >> 2] | 0) != 2)))) {
+                      a[e >> 0] = g;
+                      h = a[h >> 0] | 0;
+                      g = (e + 2) | 0;
+                      a[(e + 1) >> 0] = h;
+                      if (!((h << 24) >> 24)) {
+                        e = g;
+                        break a;
+                      } else {
+                        e = g;
+                        f = (f + 2) | 0;
+                        continue;
+                      }
+                    }
+                    switch ((g << 24) >> 24) {
+                      case 92:
+                        break b;
+                      case 10: {
+                        k = 12;
+                        break b;
+                      }
+                      default: {
+                      }
+                    }
+                    a[e >> 0] = g;
+                    e = (e + 1) | 0;
+                    f = h;
+                  }
+                  if ((k | 0) == 12) {
+                    k = 0;
+                    f = (e + 1) | 0;
+                    a[e >> 0] = 0;
+                    yK(b, d, i, 110);
+                    e = f;
+                    i = f;
+                    f = h;
+                    continue;
+                  }
+                  g = a[h >> 0] | 0;
+                  switch (((g << 24) >> 24) | 0) {
+                    case 114:
+                    case 108:
+                    case 110: {
+                      g = (e + 1) | 0;
+                      a[e >> 0] = 0;
+                      yK(b, d, i, a[h >> 0] | 0);
+                      e = g;
+                      break;
+                    }
+                    default: {
+                      a[e >> 0] = g;
+                      e = (e + 1) | 0;
+                      g = i;
+                    }
+                  }
+                  i = g;
+                  f = (a[h >> 0] | 0) == 0 ? h : (f + 2) | 0;
+                }
+                if ((i | 0) != (e | 0)) {
+                  a[e >> 0] = 0;
+                  yK(b, d, i, 110);
+                }
+                d = (d + 40) | 0;
+                c[d >> 2] = c[l >> 2];
+                c[(d + 4) >> 2] = c[(l + 4) >> 2];
+                c[(d + 8) >> 2] = c[(l + 8) >> 2];
+                c[(d + 12) >> 2] = c[(l + 12) >> 2];
+              }
+              return;
+            }
+            function yK(d, e, f, g) {
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0.0,
+                j = 0.0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0;
+              s = l;
+              l = (l + 32) | 0;
+              q = (s + 16) | 0;
+              p = s;
+              r = (e + 76) | 0;
+              k = b[r >> 1] | 0;
+              o = (e + 72) | 0;
+              m = c[o >> 2] | 0;
+              if (!m) n = JK((((k * 56) | 0) + 112) | 0) | 0;
+              else n = LK(m, (k + 2) | 0, 56, (k + 1) | 0) | 0;
+              c[o >> 2] = n;
+              k = b[r >> 1] | 0;
+              m = (n + ((k * 56) | 0)) | 0;
+              c[m >> 2] = f;
+              a[(n + ((k * 56) | 0) + 48) >> 0] = g;
+              if ((f | 0) != 0 ? (a[f >> 0] | 0) != 0 : 0) {
+                c[46594] = c[(e + 4) >> 2];
+                h[23299] = +h[(e + 16) >> 3];
+                g = c[(d + 144) >> 2] | 0;
+                c[(n + ((k * 56) | 0) + 4) >> 2] = nb[c[g >> 2] & 63](g, 186376, 1) | 0;
+                LO(p, d, m);
+                j = +h[p >> 3];
+                h[q >> 3] = j;
+                i = +h[(p + 8) >> 3];
+              } else {
+                h[q >> 3] = 0.0;
+                i = +(~~(+h[(e + 16) >> 3] * 1.2) | 0);
+                h[(n + ((k * 56) | 0) + 40) >> 3] = i;
+                j = 0.0;
+              }
+              b[r >> 1] = (((b[r >> 1] | 0) + 1) << 16) >> 16;
+              r = (e + 24) | 0;
+              h[r >> 3] = +h[(+h[r >> 3] > j ? r : q) >> 3];
+              r = (e + 32) | 0;
+              h[r >> 3] = +h[r >> 3] + i;
+              l = s;
+              return;
+            }
+            function zK(b, e, f, g, i, j) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = +g;
+              i = i | 0;
+              j = j | 0;
+              var k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0;
+              u = l;
+              l = (l + 32) | 0;
+              r = (u + 16) | 0;
+              q = (u + 8) | 0;
+              p = u;
+              t = JK(88) | 0;
+              switch (IC(b) | 0) {
+                case 0: {
+                  m = 0;
+                  s = c[(b + 60) >> 2] | 0;
+                  n = b;
+                  o = 0;
+                  break;
+                }
+                case 1: {
+                  m = 0;
+                  s = yC(xC(b) | 0) | 0;
+                  n = 0;
+                  o = b;
+                  break;
+                }
+                case 2: {
+                  m = b;
+                  s = yC(xC(c[((((c[b >> 2] & 3) | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0) | 0) | 0;
+                  n = 0;
+                  o = 0;
+                  break;
+                }
+                default: {
+                  m = 0;
+                  s = 0;
+                  n = 0;
+                  o = 0;
+                }
+              }
+              c[(t + 4) >> 2] = i;
+              c[(t + 8) >> 2] = j;
+              h[(t + 16) >> 3] = g;
+              k = (s + 16) | 0;
+              j = (t + 12) | 0;
+              c[j >> 2] = d[((c[k >> 2] | 0) + 115) >> 0];
+              a: do
+                if (f & 4) {
+                  c[t >> 2] = D4(e) | 0;
+                  if ((f & 2) | 0) a[(t + 82) >> 0] = 1;
+                } else
+                  switch (f | 0) {
+                    case 2: {
+                      c[t >> 2] = D4(e) | 0;
+                      a[(t + 82) >> 0] = 1;
+                      if (!(BU(b, t) | 0)) break a;
+                      switch (IC(b) | 0) {
+                        case 0: {
+                          c[p >> 2] = KB(n) | 0;
+                          gA(3, 101983, p) | 0;
+                          break a;
+                        }
+                        case 1: {
+                          c[q >> 2] = KB(o) | 0;
+                          gA(3, 102005, q) | 0;
+                          break a;
+                        }
+                        case 2: {
+                          p = KB(c[((((c[m >> 2] & 3) | 0) == 3 ? m : (m + 48) | 0) + 40) >> 2] | 0) | 0;
+                          q = (xB(s) | 0) != 0;
+                          s = KB(c[((((c[m >> 2] & 3) | 0) == 2 ? m : (m + -48) | 0) + 40) >> 2] | 0) | 0;
+                          c[r >> 2] = p;
+                          c[(r + 4) >> 2] = q ? 137738 : 141747;
+                          c[(r + 8) >> 2] = s;
+                          gA(3, 102026, r) | 0;
+                          break a;
+                        }
+                        default:
+                          break a;
+                      }
+                    }
+                    case 0: {
+                      i = AK(e, b, 0) | 0;
+                      c[t >> 2] = i;
+                      if ((c[j >> 2] | 0) == 1) i = eQ(i) | 0;
+                      else i = bQ(i, s) | 0;
+                      U1(c[t >> 2] | 0);
+                      c[t >> 2] = i;
+                      xK(c[((c[k >> 2] | 0) + 144) >> 2] | 0, t);
+                      break a;
+                    }
+                    default:
+                      qa(102053, 102069, 166, 102078);
+                  }
+              while (0);
+              l = u;
+              return t | 0;
+            }
+            function AK(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0;
+              switch (IC(d) | 0) {
+                case 0: {
+                  i = KB(d) | 0;
+                  g = l2(i) | 0;
+                  f = c[((c[(d + 16) >> 2] | 0) + 12) >> 2] | 0;
+                  if (f) {
+                    f = c[f >> 2] | 0;
+                    if (!b) {
+                      v = 0;
+                      t = 2;
+                      u = 2;
+                      s = 2;
+                      h = 2;
+                      y = 102101;
+                      m = 102098;
+                      j = 105493;
+                      o = 195059;
+                      q = 195059;
+                      p = 0;
+                      r = 0;
+                      n = 2;
+                      w = f;
+                      x = 102095;
+                    } else {
+                      v = 0;
+                      t = 2;
+                      u = 2;
+                      s = 2;
+                      h = 2;
+                      y = 102101;
+                      m = 102098;
+                      j = 105493;
+                      o = 195059;
+                      q = 195059;
+                      p = 0;
+                      r = 0;
+                      n = l2(f) | 0;
+                      w = f;
+                      x = 102095;
+                    }
+                  } else {
+                    v = 0;
+                    t = 2;
+                    u = 2;
+                    s = 2;
+                    h = 2;
+                    y = 102101;
+                    m = 102098;
+                    j = 105493;
+                    o = 195059;
+                    q = 195059;
+                    p = 0;
+                    r = 0;
+                    n = 2;
+                    w = 102089;
+                    x = 102095;
+                  }
+                  break;
+                }
+                case 1: {
+                  i = KB(xC(d) | 0) | 0;
+                  g = l2(i) | 0;
+                  j = KB(d) | 0;
+                  h = l2(j) | 0;
+                  f = c[((c[(d + 16) >> 2] | 0) + 104) >> 2] | 0;
+                  if (f) {
+                    f = c[f >> 2] | 0;
+                    if (!b) {
+                      v = 0;
+                      t = 2;
+                      u = 2;
+                      s = 2;
+                      y = 102101;
+                      m = 102098;
+                      o = 195059;
+                      q = 195059;
+                      p = 0;
+                      r = 0;
+                      n = 2;
+                      w = f;
+                      x = 102095;
+                    } else {
+                      v = 0;
+                      t = 2;
+                      u = 2;
+                      s = 2;
+                      y = 102101;
+                      m = 102098;
+                      o = 195059;
+                      q = 195059;
+                      p = 0;
+                      r = 0;
+                      n = l2(f) | 0;
+                      w = f;
+                      x = 102095;
+                    }
+                  } else {
+                    v = 0;
+                    t = 2;
+                    u = 2;
+                    s = 2;
+                    y = 102101;
+                    m = 102098;
+                    o = 195059;
+                    q = 195059;
+                    p = 0;
+                    r = 0;
+                    n = 2;
+                    w = 102089;
+                    x = 102095;
+                  }
+                  break;
+                }
+                case 2: {
+                  h = (d + 48) | 0;
+                  i = KB(yC(xC(c[((((c[d >> 2] & 3) | 0) == 3 ? d : h) + 40) >> 2] | 0) | 0) | 0) | 0;
+                  g = l2(i) | 0;
+                  l = KB(c[((((c[d >> 2] & 3) | 0) == 3 ? d : h) + 40) >> 2] | 0) | 0;
+                  k = l2(l) | 0;
+                  f = (d + 16) | 0;
+                  q = c[((c[f >> 2] | 0) + 52) >> 2] | 0;
+                  if (!q) r = 0;
+                  else r = l2(q) | 0;
+                  m = KB(c[((((c[d >> 2] & 3) | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0) | 0;
+                  f = c[f >> 2] | 0;
+                  o = c[(f + 92) >> 2] | 0;
+                  if (!o) p = 0;
+                  else p = l2(o) | 0;
+                  j = l2(m) | 0;
+                  f = c[(f + 96) >> 2] | 0;
+                  if (f) {
+                    f = c[f >> 2] | 0;
+                    if (!b) n = 2;
+                    else n = l2(f) | 0;
+                  } else {
+                    n = 2;
+                    f = 102089;
+                  }
+                  x = (xB(yC(xC(c[((((c[d >> 2] & 3) | 0) == 3 ? d : h) + 40) >> 2] | 0) | 0) | 0) | 0) == 0;
+                  v = 1;
+                  t = k;
+                  u = j;
+                  s = (k + 2 + (r | 0 ? (r + 1) | 0 : 0) + j + (p | 0 ? (p + 1) | 0 : 0)) | 0;
+                  h = 2;
+                  y = l;
+                  j = 105493;
+                  w = f;
+                  x = x ? 141747 : 137738;
+                  break;
+                }
+                default: {
+                  v = 0;
+                  t = 2;
+                  u = 2;
+                  s = 2;
+                  h = 2;
+                  g = 2;
+                  y = 102101;
+                  m = 102098;
+                  j = 105493;
+                  i = 102092;
+                  o = 195059;
+                  q = 195059;
+                  p = 0;
+                  r = 0;
+                  n = 2;
+                  w = 102089;
+                  x = 102095;
+                }
+              }
+              e = (e | 0) == 0;
+              l = 0;
+              f = b;
+              a: while (1) {
+                d = (f + 1) | 0;
+                b: do
+                  switch (a[f >> 0] | 0) {
+                    case 0:
+                      break a;
+                    case 92: {
+                      f = (f + 2) | 0;
+                      switch (a[d >> 0] | 0) {
+                        case 78: {
+                          k = h;
+                          break b;
+                        }
+                        case 71: {
+                          k = g;
+                          break b;
+                        }
+                        case 69: {
+                          k = s;
+                          break b;
+                        }
+                        case 72: {
+                          k = u;
+                          break b;
+                        }
+                        case 84: {
+                          k = t;
+                          break b;
+                        }
+                        case 76: {
+                          k = n;
+                          break b;
+                        }
+                        case 92: {
+                          if (!e) {
+                            k = 1;
+                            break b;
+                          }
+                          break;
+                        }
+                        default: {
+                        }
+                      }
+                      k = 2;
+                      break;
+                    }
+                    default: {
+                      k = 1;
+                      f = d;
+                    }
+                  }
+                while (0);
+                l = (l + k) | 0;
+              }
+              s = KK((l + 1) | 0) | 0;
+              n = (v | 0) == 0;
+              l = (r | 0) == 0;
+              d = (p | 0) == 0;
+              f = s;
+              g = b;
+              c: while (1) {
+                k = (g + 1) | 0;
+                h = a[g >> 0] | 0;
+                switch ((h << 24) >> 24) {
+                  case 0:
+                    break c;
+                  case 92:
+                    break;
+                  default: {
+                    a[f >> 0] = h;
+                    f = (f + 1) | 0;
+                    g = k;
+                    continue c;
+                  }
+                }
+                h = (g + 2) | 0;
+                g = a[k >> 0] | 0;
+                switch (((g << 24) >> 24) | 0) {
+                  case 71: {
+                    g = i;
+                    while (1) {
+                      b = a[g >> 0] | 0;
+                      a[f >> 0] = b;
+                      if (!((b << 24) >> 24)) {
+                        g = h;
+                        continue c;
+                      }
+                      g = (g + 1) | 0;
+                      f = (f + 1) | 0;
+                    }
+                  }
+                  case 78: {
+                    g = j;
+                    while (1) {
+                      b = a[g >> 0] | 0;
+                      a[f >> 0] = b;
+                      if (!((b << 24) >> 24)) {
+                        g = h;
+                        continue c;
+                      }
+                      g = (g + 1) | 0;
+                      f = (f + 1) | 0;
+                    }
+                  }
+                  case 69: {
+                    if (n) {
+                      g = h;
+                      continue c;
+                    } else g = y;
+                    while (1) {
+                      b = a[g >> 0] | 0;
+                      a[f >> 0] = b;
+                      if (!((b << 24) >> 24)) break;
+                      g = (g + 1) | 0;
+                      f = (f + 1) | 0;
+                    }
+                    if (l) g = x;
+                    else {
+                      a[f >> 0] = 58;
+                      g = q;
+                      while (1) {
+                        f = (f + 1) | 0;
+                        b = a[g >> 0] | 0;
+                        a[f >> 0] = b;
+                        if (!((b << 24) >> 24)) {
+                          g = x;
+                          break;
+                        } else g = (g + 1) | 0;
+                      }
+                    }
+                    while (1) {
+                      b = a[g >> 0] | 0;
+                      a[f >> 0] = b;
+                      if (!((b << 24) >> 24)) {
+                        g = m;
+                        break;
+                      }
+                      g = (g + 1) | 0;
+                      f = (f + 1) | 0;
+                    }
+                    while (1) {
+                      b = a[g >> 0] | 0;
+                      a[f >> 0] = b;
+                      if (!((b << 24) >> 24)) break;
+                      g = (g + 1) | 0;
+                      f = (f + 1) | 0;
+                    }
+                    if (d) {
+                      g = h;
+                      continue c;
+                    }
+                    a[f >> 0] = 58;
+                    g = o;
+                    while (1) {
+                      f = (f + 1) | 0;
+                      b = a[g >> 0] | 0;
+                      a[f >> 0] = b;
+                      if (!((b << 24) >> 24)) {
+                        g = h;
+                        continue c;
+                      } else g = (g + 1) | 0;
+                    }
+                  }
+                  case 84: {
+                    g = y;
+                    while (1) {
+                      b = a[g >> 0] | 0;
+                      a[f >> 0] = b;
+                      if (!((b << 24) >> 24)) {
+                        g = h;
+                        continue c;
+                      }
+                      g = (g + 1) | 0;
+                      f = (f + 1) | 0;
+                    }
+                  }
+                  case 72: {
+                    g = m;
+                    while (1) {
+                      b = a[g >> 0] | 0;
+                      a[f >> 0] = b;
+                      if (!((b << 24) >> 24)) {
+                        g = h;
+                        continue c;
+                      }
+                      f = (f + 1) | 0;
+                      g = (g + 1) | 0;
+                    }
+                  }
+                  case 76: {
+                    g = w;
+                    while (1) {
+                      b = a[g >> 0] | 0;
+                      a[f >> 0] = b;
+                      if (!((b << 24) >> 24)) {
+                        g = h;
+                        continue c;
+                      }
+                      f = (f + 1) | 0;
+                      g = (g + 1) | 0;
+                    }
+                  }
+                  case 92: {
+                    if (!e) {
+                      a[f >> 0] = 92;
+                      f = (f + 1) | 0;
+                      g = h;
+                      continue c;
+                    }
+                    break;
+                  }
+                  default: {
+                  }
+                }
+                a[f >> 0] = 92;
+                a[(f + 1) >> 0] = g;
+                f = (f + 2) | 0;
+                g = h;
+              }
+              a[f >> 0] = 0;
+              return s | 0;
+            }
+            function BK(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              if (a | 0) {
+                d = a;
+                e = 0;
+                while (1) {
+                  if ((e | 0) >= (b | 0)) break;
+                  if (!e) U1(c[d >> 2] | 0);
+                  g = c[(d + 8) >> 2] | 0;
+                  if (g | 0 ? ((f = c[(d + 12) >> 2] | 0), f | 0) : 0) tb[f & 127](g);
+                  d = (d + 56) | 0;
+                  e = (e + 1) | 0;
+                }
+                U1(a);
+              }
+              return;
+            }
+            function CK(d) {
+              d = d | 0;
+              var e = 0;
+              if (d | 0) {
+                U1(c[d >> 2] | 0);
+                e = (d + 72) | 0;
+                if (a[(d + 82) >> 0] | 0) {
+                  e = c[e >> 2] | 0;
+                  if (e | 0) mU(e, 1);
+                } else BK(c[e >> 2] | 0, b[(d + 76) >> 1] | 0);
+                U1(d);
+              }
+              return;
+            }
+            function DK(d, e, f) {
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0.0,
+                i = 0,
+                j = 0.0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0;
+              u = l;
+              l = (l + 32) | 0;
+              q = (u + 16) | 0;
+              r = u;
+              k = c[(d + 16) >> 2] | 0;
+              s = (k + 12) | 0;
+              t = c[s >> 2] | 0;
+              c[s >> 2] = e;
+              if (!(a[(f + 82) >> 0] | 0)) {
+                p = (f + 76) | 0;
+                if ((b[p >> 1] | 0) >= 1) {
+                  eS(d, 0);
+                  hS(d, c[(f + 8) >> 2] | 0);
+                  switch (a[(f + 80) >> 0] | 0) {
+                    case 116: {
+                      j = +h[(f + 64) >> 3];
+                      g = +h[(f + 48) >> 3] * 0.5 + j;
+                      break;
+                    }
+                    case 98: {
+                      j = +h[(f + 64) >> 3];
+                      g = +h[(f + 48) >> 3] * -0.5 + j + +h[(f + 32) >> 3];
+                      break;
+                    }
+                    default: {
+                      j = +h[(f + 64) >> 3];
+                      g = +h[(f + 32) >> 3] * 0.5 + j;
+                    }
+                  }
+                  g = g - +h[(f + 16) >> 3];
+                  o = (r + 8) | 0;
+                  h[o >> 3] = g;
+                  if (b[(k + 260) >> 1] & 512) h[o >> 3] = g - j;
+                  m = (f + 72) | 0;
+                  n = (f + 56) | 0;
+                  i = (f + 40) | 0;
+                  e = 0;
+                  while (1) {
+                    if ((e | 0) >= (b[p >> 1] | 0)) break;
+                    k = c[m >> 2] | 0;
+                    switch (a[(k + ((e * 56) | 0) + 48) >> 0] | 0) {
+                      case 108: {
+                        g = +h[n >> 3] - +h[i >> 3] * 0.5;
+                        break;
+                      }
+                      case 114: {
+                        g = +h[i >> 3] * 0.5 + +h[n >> 3];
+                        break;
+                      }
+                      default:
+                        g = +h[n >> 3];
+                    }
+                    h[r >> 3] = g;
+                    c[q >> 2] = c[r >> 2];
+                    c[(q + 4) >> 2] = c[(r + 4) >> 2];
+                    c[(q + 8) >> 2] = c[(r + 8) >> 2];
+                    c[(q + 12) >> 2] = c[(r + 12) >> 2];
+                    gS(d, q, (k + ((e * 56) | 0)) | 0);
+                    h[o >> 3] = +h[o >> 3] - +h[((c[m >> 2] | 0) + ((e * 56) | 0) + 40) >> 3];
+                    e = (e + 1) | 0;
+                  }
+                  fS(d);
+                  i = 18;
+                }
+              } else {
+                TT(d, c[(f + 72) >> 2] | 0, f);
+                i = 18;
+              }
+              if ((i | 0) == 18) c[s >> 2] = t;
+              l = u;
+              return;
+            }
+            function EK(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return AK(a, b, 1) | 0;
+            }
+            function FK(a) {
+              a = a | 0;
+              return GK(a, 0) | 0;
+            }
+            function GK(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              e = c[47207] | 0;
+              if (!e) {
+                c[47208] = 64;
+                e = KK(64) | 0;
+                c[47207] = e;
+              }
+              j = (d << 24) >> 24 == 0;
+              i = 0;
+              f = 0;
+              h = b;
+              while (1) {
+                if (!h) break;
+                d = a[h >> 0] | 0;
+                if (!((d << 24) >> 24)) break;
+                b = c[47208] | 0;
+                if ((i | 0) > ((b + -8) | 0)) {
+                  e = b << 1;
+                  c[47208] = e;
+                  e = MK(c[47207] | 0, e) | 0;
+                  c[47207] = e;
+                  e = (e + i) | 0;
+                  d = a[h >> 0] | 0;
+                }
+                a: do
+                  switch ((d << 24) >> 24) {
+                    case 38: {
+                      if (j ? (HK(h) | 0) != 0 : 0) k = 18;
+                      else {
+                        f = 5;
+                        d = 102130;
+                      }
+                      break;
+                    }
+                    case 60: {
+                      f = 4;
+                      d = 102153;
+                      break;
+                    }
+                    case 62: {
+                      f = 4;
+                      d = 102136;
+                      break;
+                    }
+                    case 45: {
+                      f = 5;
+                      d = 102147;
+                      break;
+                    }
+                    default: {
+                      if (((f | 0) != 0) & ((d << 24) >> 24 == 32))
+                        if ((a[f >> 0] | 0) == 32) {
+                          f = 6;
+                          d = 102123;
+                          break a;
+                        } else {
+                          k = 18;
+                          break a;
+                        }
+                      switch ((d << 24) >> 24) {
+                        case 34: {
+                          f = 6;
+                          d = 102116;
+                          break a;
+                        }
+                        case 39: {
+                          f = 5;
+                          d = 102141;
+                          break a;
+                        }
+                        case 10:
+                          if (j) {
+                            k = 18;
+                            break a;
+                          } else {
+                            f = 5;
+                            d = 102110;
+                            break a;
+                          }
+                        default: {
+                          k = 18;
+                          break a;
+                        }
+                      }
+                    }
+                  }
+                while (0);
+                if ((k | 0) == 18) {
+                  k = 0;
+                  d = j | ((d << 24) >> 24 != 13);
+                  f = d ? 1 : 5;
+                  d = d ? h : 102104;
+                }
+                g = (e + f) | 0;
+                b = f;
+                while (1) {
+                  if (!b) break;
+                  a[e >> 0] = a[d >> 0] | 0;
+                  b = (b + -1) | 0;
+                  d = (d + 1) | 0;
+                  e = (e + 1) | 0;
+                }
+                b = h;
+                i = (f + i) | 0;
+                e = g;
+                h = (h + 1) | 0;
+                f = b;
+              }
+              a[e >> 0] = 0;
+              return c[47207] | 0;
+            }
+            function HK(b) {
+              b = b | 0;
+              var c = 0,
+                d = 0;
+              d = (b + 1) | 0;
+              c = a[d >> 0] | 0;
+              a: do
+                if ((c << 24) >> 24 == 35) {
+                  d = (b + 2) | 0;
+                  c = a[d >> 0] | 0;
+                  switch ((c << 24) >> 24) {
+                    case 88:
+                    case 120:
+                      break;
+                    default: {
+                      b = d;
+                      while (1) {
+                        d = (b + 1) | 0;
+                        if (((c + -48) & 255) >= 10) break a;
+                        b = d;
+                        c = a[d >> 0] | 0;
+                      }
+                    }
+                  }
+                  d = (b + 3) | 0;
+                  while (1) {
+                    c = a[d >> 0] | 0;
+                    if (((c + -48) & 255) >= 10)
+                      switch ((c << 24) >> 24) {
+                        case 65:
+                        case 66:
+                        case 67:
+                        case 68:
+                        case 69:
+                        case 70:
+                        case 97:
+                        case 98:
+                        case 99:
+                        case 100:
+                        case 101:
+                        case 102:
+                          break;
+                        default:
+                          break a;
+                      }
+                    d = (d + 1) | 0;
+                  }
+                } else
+                  while (1) {
+                    b = (d + 1) | 0;
+                    if ((((c & -33) + -65) & 255) >= 26) break a;
+                    d = b;
+                    c = a[b >> 0] | 0;
+                  }
+              while (0);
+              return ((c << 24) >> 24 == 59) | 0;
+            }
+            function IK(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              d = c[47209] | 0;
+              if (!d) {
+                c[47210] = 64;
+                d = KK(64) | 0;
+                c[47209] = d;
+                i = 0;
+              } else i = 0;
+              while (1) {
+                if (!b) break;
+                e = a[b >> 0] | 0;
+                if (!((e << 24) >> 24)) break;
+                f = c[47210] | 0;
+                if ((i | 0) > ((f + -8) | 0)) {
+                  d = f << 1;
+                  c[47210] = d;
+                  d = MK(c[47209] | 0, d) | 0;
+                  c[47209] = d;
+                  d = (d + i) | 0;
+                  e = a[b >> 0] | 0;
+                }
+                switch ((e << 24) >> 24) {
+                  case 38: {
+                    if (!(HK(b) | 0)) {
+                      g = 5;
+                      e = 102130;
+                    } else j = 12;
+                    break;
+                  }
+                  case 60: {
+                    g = 4;
+                    e = 102153;
+                    break;
+                  }
+                  case 62: {
+                    g = 4;
+                    e = 102136;
+                    break;
+                  }
+                  case 34: {
+                    g = 6;
+                    e = 102116;
+                    break;
+                  }
+                  case 39: {
+                    g = 5;
+                    e = 102141;
+                    break;
+                  }
+                  default:
+                    j = 12;
+                }
+                if ((j | 0) == 12) {
+                  j = 0;
+                  g = 1;
+                  e = b;
+                }
+                h = (d + g) | 0;
+                f = g;
+                while (1) {
+                  if (!f) break;
+                  a[d >> 0] = a[e >> 0] | 0;
+                  f = (f + -1) | 0;
+                  e = (e + 1) | 0;
+                  d = (d + 1) | 0;
+                }
+                i = (g + i) | 0;
+                d = h;
+                b = (b + 1) | 0;
+              }
+              a[d >> 0] = 0;
+              return c[47209] | 0;
+            }
+            function JK(a) {
+              a = a | 0;
+              var b = 0;
+              if (!a) a = 0;
+              else {
+                b = KK(a) | 0;
+                Y6(b | 0, 0, a | 0) | 0;
+                a = b;
+              }
+              return a | 0;
+            }
+            function KK(a) {
+              a = a | 0;
+              if (a) {
+                a = T1(a) | 0;
+                if (!a) {
+                  U4(111740, 14, 1, c[15712] | 0) | 0;
+                  a = 0;
+                }
+              } else a = 0;
+              return a | 0;
+            }
+            function LK(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              a = W1(a, O(d, b) | 0) | 0;
+              if (!(((b | 0) != 0) & ((a | 0) == 0))) {
+                if (b >>> 0 > e >>> 0) Y6((a + (O(e, d) | 0)) | 0, 0, O((b - e) | 0, d) | 0) | 0;
+              } else U4(111740, 14, 1, c[15712] | 0) | 0;
+              return a | 0;
+            }
+            function MK(a, b) {
+              a = a | 0;
+              b = b | 0;
+              a = W1(a, b) | 0;
+              if (((b | 0) != 0) & ((a | 0) == 0)) U4(111740, 14, 1, c[15712] | 0) | 0;
+              return a | 0;
+            }
+            function NK(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0.0,
+                m = 0,
+                n = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0;
+              u = l;
+              l = (l + 80) | 0;
+              r = (u + 40) | 0;
+              q = (u + 32) | 0;
+              n = (u + 24) | 0;
+              m = u;
+              s = 4;
+              t = T1(40) | 0;
+              c[t >> 2] = 0;
+              f = (u + 68) | 0;
+              g = (u + 64) | 0;
+              if (0) {
+                o = 0;
+                ka(62, a | 0, f | 0, g | 0);
+                i = o;
+                o = 0;
+                if (((i | 0) != 0) & ((p | 0) != 0)) {
+                  j = V6(c[i >> 2] | 0, t | 0, s | 0) | 0;
+                  if (!j) bb(i | 0, p | 0);
+                  z = p;
+                } else j = -1;
+                if ((j | 0) != 1) {
+                  j = c[15712] | 0;
+                  i = c[f >> 2] | 0;
+                  f = c[g >> 2] | 0;
+                  o = 0;
+                  c[m >> 2] = 102202;
+                  c[(m + 4) >> 2] = i;
+                  c[(m + 8) >> 2] = f;
+                  c[(m + 12) >> 2] = d;
+                  c[(m + 16) >> 2] = b;
+                  ca(32, j | 0, 102158, m | 0) | 0;
+                  f = o;
+                  o = 0;
+                  if (((f | 0) != 0) & ((p | 0) != 0)) {
+                    g = V6(c[f >> 2] | 0, t | 0, s | 0) | 0;
+                    if (!g) bb(f | 0, p | 0);
+                    z = p;
+                  } else g = -1;
+                  if ((g | 0) != 1) {
+                    o = 0;
+                    ha(1);
+                    f = o;
+                    o = 0;
+                    if (((f | 0) != 0) & ((p | 0) != 0)) {
+                      g = V6(c[f >> 2] | 0, t | 0, s | 0) | 0;
+                      if (!g) bb(f | 0, p | 0);
+                      z = p;
+                    } else g = -1;
+                    if ((g | 0) != 1) j = 6;
+                    else {
+                      f = z;
+                      j = 15;
+                    }
+                  } else {
+                    f = z;
+                    j = 15;
+                  }
+                } else {
+                  f = z;
+                  j = 15;
+                }
+              } else j = 6;
+              do
+                if ((j | 0) == 6) {
+                  o = 0;
+                  f = $(27, a | 0) | 0;
+                  g = o;
+                  o = 0;
+                  if (((g | 0) != 0) & ((p | 0) != 0)) {
+                    i = V6(c[g >> 2] | 0, t | 0, s | 0) | 0;
+                    if (!i) bb(g | 0, p | 0);
+                    z = p;
+                  } else i = -1;
+                  if ((i | 0) != 1) {
+                    if (!f) {
+                      o = 0;
+                      ha(2);
+                      f = o;
+                      o = 0;
+                      if (((f | 0) != 0) & ((p | 0) != 0)) {
+                        g = V6(c[f >> 2] | 0, t | 0, s | 0) | 0;
+                        if (!g) bb(f | 0, p | 0);
+                        z = p;
+                      } else g = -1;
+                      if ((g | 0) == 1) {
+                        f = z;
+                        j = 15;
+                        break;
+                      }
+                    }
+                    if ((d | 0) < 1) {
+                      o = 0;
+                      ha(3);
+                      f = o;
+                      o = 0;
+                      if (((f | 0) != 0) & ((p | 0) != 0)) {
+                        g = V6(c[f >> 2] | 0, t | 0, s | 0) | 0;
+                        if (!g) bb(f | 0, p | 0);
+                        z = p;
+                      } else g = -1;
+                      if ((g | 0) == 1) {
+                        f = z;
+                        j = 15;
+                        break;
+                      }
+                      f = 0;
+                      break;
+                    } else {
+                      c[47211] = (e | 0) > -1 ? e : 30;
+                      t = U6(188848, 1, t | 0, s | 0) | 0;
+                      s = z;
+                      o = 0;
+                      f = o;
+                      o = 0;
+                      if (((f | 0) != 0) & ((p | 0) != 0)) {
+                        g = V6(c[f >> 2] | 0, t | 0, s | 0) | 0;
+                        if (!g) bb(f | 0, p | 0);
+                        z = p;
+                      } else g = -1;
+                      if ((g | 0) == 1) {
+                        f = z;
+                        j = 15;
+                        break;
+                      }
+                      f = 0;
+                      j = 15;
+                      break;
+                    }
+                  } else {
+                    f = z;
+                    j = 15;
+                  }
+                }
+              while (0);
+              a: do
+                if ((j | 0) == 15) {
+                  b: while (1) {
+                    if (f | 0) {
+                      f = 2;
+                      break a;
+                    }
+                    o = 0;
+                    ha(4);
+                    f = o;
+                    o = 0;
+                    if (((f | 0) != 0) & ((p | 0) != 0)) {
+                      g = V6(c[f >> 2] | 0, t | 0, s | 0) | 0;
+                      if (!g) bb(f | 0, p | 0);
+                      z = p;
+                    } else g = -1;
+                    if ((g | 0) == 1) {
+                      f = z;
+                      j = 15;
+                      continue;
+                    }
+                    a = c[15712] | 0;
+                    m = 0;
+                    while (1) {
+                      o = 0;
+                      j = _(2) | 0;
+                      f = o;
+                      o = 0;
+                      if (((f | 0) != 0) & ((p | 0) != 0)) {
+                        g = V6(c[f >> 2] | 0, t | 0, s | 0) | 0;
+                        if (!g) bb(f | 0, p | 0);
+                        z = p;
+                      } else g = -1;
+                      if ((g | 0) == 1) {
+                        f = z;
+                        j = 15;
+                        continue b;
+                      }
+                      if (!j) break;
+                      o = 0;
+                      f = $(28, j | 0) | 0;
+                      g = o;
+                      o = 0;
+                      if (((g | 0) != 0) & ((p | 0) != 0)) {
+                        i = V6(c[g >> 2] | 0, t | 0, s | 0) | 0;
+                        if (!i) bb(g | 0, p | 0);
+                        z = p;
+                      } else i = -1;
+                      if ((i | 0) == 1) {
+                        f = z;
+                        j = 15;
+                        continue b;
+                      }
+                      o = 0;
+                      ja(25, j | 0, f | 0);
+                      f = o;
+                      o = 0;
+                      if (((f | 0) != 0) & ((p | 0) != 0)) {
+                        g = V6(c[f >> 2] | 0, t | 0, s | 0) | 0;
+                        if (!g) bb(f | 0, p | 0);
+                        z = p;
+                      } else g = -1;
+                      if ((g | 0) == 1) {
+                        f = z;
+                        j = 15;
+                        continue b;
+                      }
+                      m = (m + 1) | 0;
+                      do
+                        if ((((m | 0) % 100 | 0 | 0) == 0) & (0 != 0)) {
+                          f = (m | 0) % 1e3 | 0;
+                          if ((f | 0) == 100) {
+                            o = 0;
+                            aa(93, 102202, a | 0) | 0;
+                            f = o;
+                            o = 0;
+                            if (((f | 0) != 0) & ((p | 0) != 0)) {
+                              g = V6(c[f >> 2] | 0, t | 0, s | 0) | 0;
+                              if (!g) bb(f | 0, p | 0);
+                              z = p;
+                            } else g = -1;
+                            if ((g | 0) == 1) {
+                              f = z;
+                              j = 15;
+                              continue b;
+                            }
+                            o = 0;
+                            c[n >> 2] = m;
+                            ca(32, a | 0, 102220, n | 0) | 0;
+                            f = o;
+                            o = 0;
+                            if (((f | 0) != 0) & ((p | 0) != 0)) {
+                              g = V6(c[f >> 2] | 0, t | 0, s | 0) | 0;
+                              if (!g) bb(f | 0, p | 0);
+                              z = p;
+                            } else g = -1;
+                            if ((g | 0) == 1) {
+                              f = z;
+                              j = 15;
+                              continue b;
+                            }
+                            break;
+                          }
+                          o = 0;
+                          c[q >> 2] = m;
+                          ca(32, a | 0, 102220, q | 0) | 0;
+                          g = o;
+                          o = 0;
+                          if (((g | 0) != 0) & ((p | 0) != 0)) {
+                            i = V6(c[g >> 2] | 0, t | 0, s | 0) | 0;
+                            if (!i) bb(g | 0, p | 0);
+                            z = p;
+                          } else i = -1;
+                          if ((i | 0) == 1) {
+                            f = z;
+                            j = 15;
+                            continue b;
+                          }
+                          if (!f) {
+                            o = 0;
+                            aa(94, 10, a | 0) | 0;
+                            f = o;
+                            o = 0;
+                            if (((f | 0) != 0) & ((p | 0) != 0)) {
+                              g = V6(c[f >> 2] | 0, t | 0, s | 0) | 0;
+                              if (!g) bb(f | 0, p | 0);
+                              z = p;
+                            } else g = -1;
+                            if ((g | 0) == 1) {
+                              f = z;
+                              j = 15;
+                              continue b;
+                            }
+                          }
+                        }
+                      while (0);
+                      if ((m | 0) >= (d | 0)) break;
+                    }
+                    switch (b | 0) {
+                      case 1: {
+                        o = 0;
+                        ha(5);
+                        f = o;
+                        o = 0;
+                        if (((f | 0) != 0) & ((p | 0) != 0)) {
+                          g = V6(c[f >> 2] | 0, t | 0, s | 0) | 0;
+                          if (!g) bb(f | 0, p | 0);
+                          z = p;
+                        } else g = -1;
+                        if ((g | 0) == 1) {
+                          f = z;
+                          j = 15;
+                          continue b;
+                        }
+                        break;
+                      }
+                      case 2: {
+                        o = 0;
+                        ha(6);
+                        f = o;
+                        o = 0;
+                        if (((f | 0) != 0) & ((p | 0) != 0)) {
+                          g = V6(c[f >> 2] | 0, t | 0, s | 0) | 0;
+                          if (!g) bb(f | 0, p | 0);
+                          z = p;
+                        } else g = -1;
+                        if ((g | 0) == 1) {
+                          f = z;
+                          j = 15;
+                          continue b;
+                        }
+                        break;
+                      }
+                      default: {
+                        o = 0;
+                        ha(7);
+                        f = o;
+                        o = 0;
+                        if (((f | 0) != 0) & ((p | 0) != 0)) {
+                          g = V6(c[f >> 2] | 0, t | 0, s | 0) | 0;
+                          if (!g) bb(f | 0, p | 0);
+                          z = p;
+                        } else g = -1;
+                        if ((g | 0) == 1) {
+                          f = z;
+                          j = 15;
+                          continue b;
+                        }
+                        o = 0;
+                        ha(3);
+                        f = o;
+                        o = 0;
+                        if (((f | 0) != 0) & ((p | 0) != 0)) {
+                          g = V6(c[f >> 2] | 0, t | 0, s | 0) | 0;
+                          if (!g) bb(f | 0, p | 0);
+                          z = p;
+                        } else g = -1;
+                        if ((g | 0) == 1) {
+                          f = z;
+                          j = 15;
+                          continue b;
+                        }
+                      }
+                    }
+                    if (!0) {
+                      f = 0;
+                      break a;
+                    }
+                    if ((m | 0) > 99) {
+                      o = 0;
+                      aa(94, 10, a | 0) | 0;
+                      f = o;
+                      o = 0;
+                      if (((f | 0) != 0) & ((p | 0) != 0)) {
+                        g = V6(c[f >> 2] | 0, t | 0, s | 0) | 0;
+                        if (!g) bb(f | 0, p | 0);
+                        z = p;
+                      } else g = -1;
+                      if ((g | 0) == 1) {
+                        f = z;
+                        j = 15;
+                        continue;
+                      }
+                    }
+                    f = c[47251] | 0;
+                    g = c[47252] | 0;
+                    o = 0;
+                    k = +X(1);
+                    i = o;
+                    o = 0;
+                    if (((i | 0) != 0) & ((p | 0) != 0)) {
+                      j = V6(c[i >> 2] | 0, t | 0, s | 0) | 0;
+                      if (!j) bb(i | 0, p | 0);
+                      z = p;
+                    } else j = -1;
+                    if ((j | 0) == 1) {
+                      f = z;
+                      j = 15;
+                      continue;
+                    }
+                    o = 0;
+                    c[r >> 2] = 102202;
+                    c[(r + 4) >> 2] = f;
+                    c[(r + 8) >> 2] = g;
+                    c[(r + 12) >> 2] = m;
+                    h[(r + 16) >> 3] = k;
+                    ca(32, a | 0, 102224, r | 0) | 0;
+                    f = o;
+                    o = 0;
+                    if (((f | 0) != 0) & ((p | 0) != 0)) {
+                      g = V6(c[f >> 2] | 0, t | 0, s | 0) | 0;
+                      if (!g) bb(f | 0, p | 0);
+                      z = p;
+                    } else g = -1;
+                    if ((g | 0) == 1) {
+                      f = z;
+                      j = 15;
+                    } else break;
+                  }
+                  f = 0;
+                }
+              while (0);
+              U1(t | 0);
+              l = u;
+              return f | 0;
+            }
+            function OK(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              a = ((c[(a + 16) >> 2] | 0) + 192) | 0;
+              e = 0;
+              h = 0;
+              while (1) {
+                a = c[a >> 2] | 0;
+                if (!a) break;
+                g = c[(a + 16) >> 2] | 0;
+                f = c[(g + 180) >> 2] | 0;
+                a = 0;
+                while (1) {
+                  if (!(c[(f + (a << 2)) >> 2] | 0)) break;
+                  a = (a + 1) | 0;
+                  e = (e + 1) | 0;
+                }
+                a = (g + 164) | 0;
+                h = (h + 1) | 0;
+              }
+              c[b >> 2] = h;
+              c[d >> 2] = e;
+              return;
+            }
+            function PK(b) {
+              b = b | 0;
+              var d = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              c[47254] = b;
+              c[47261] = 0;
+              c[47252] = 0;
+              c[47251] = 0;
+              i = (b + 16) | 0;
+              b = ((c[i >> 2] | 0) + 192) | 0;
+              h = 0;
+              f = 0;
+              while (1) {
+                b = c[b >> 2] | 0;
+                if (!b) break;
+                g = c[(b + 16) >> 2] | 0;
+                a[(g + 157) >> 0] = 0;
+                h = (h + 1) | 0;
+                c[47251] = h;
+                d = c[(g + 180) >> 2] | 0;
+                b = 0;
+                while (1) {
+                  if (!(c[(d + (b << 2)) >> 2] | 0)) break;
+                  k = (f + 1) | 0;
+                  c[47252] = k;
+                  b = (b + 1) | 0;
+                  f = k;
+                }
+                b = (g + 164) | 0;
+              }
+              b = c[47262] | 0;
+              if (!b) b = KK(h << 2) | 0;
+              else b = MK(b, h << 2) | 0;
+              c[47262] = b;
+              c[47263] = 0;
+              b = c[47256] | 0;
+              if (!b) b = KK(c[47251] << 2) | 0;
+              else b = MK(b, c[47251] << 2) | 0;
+              c[47256] = b;
+              c[47255] = 0;
+              d = 1;
+              b = ((c[i >> 2] | 0) + 192) | 0;
+              while (1) {
+                b = c[b >> 2] | 0;
+                if (!b) break;
+                k = (b + 16) | 0;
+                i = c[k >> 2] | 0;
+                j = (i + 292) | 0;
+                c[j >> 2] = 0;
+                i = c[(i + 172) >> 2] | 0;
+                h = d;
+                g = 0;
+                b = 0;
+                while (1) {
+                  d = c[(i + (g << 2)) >> 2] | 0;
+                  if (!d) break;
+                  f = (b + 1) | 0;
+                  c[j >> 2] = f;
+                  b = c[(d + 16) >> 2] | 0;
+                  c[(b + 160) >> 2] = 0;
+                  c[(b + 164) >> 2] = -1;
+                  if (!h) b = 0;
+                  else {
+                    l = c[d >> 2] & 3;
+                    b =
+                      (((c[((c[((c[(((l | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] |
+                        0) -
+                        (c[((c[((c[(((l | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] |
+                          0)) |
+                        0) <
+                      (e[(b + 170) >> 1] | 0 | 0)
+                        ? 0
+                        : h;
+                  }
+                  h = b;
+                  g = (g + 1) | 0;
+                  b = f;
+                }
+                b = JK(((g << 2) + 4) | 0) | 0;
+                d = c[k >> 2] | 0;
+                c[(d + 264) >> 2] = b;
+                c[(d + 268) >> 2] = 0;
+                d = c[(d + 180) >> 2] | 0;
+                b = 0;
+                do {
+                  l = b;
+                  b = (b + 1) | 0;
+                } while ((c[(d + (l << 2)) >> 2] | 0) != 0);
+                d = JK(b << 2) | 0;
+                b = c[k >> 2] | 0;
+                c[(b + 272) >> 2] = d;
+                c[(b + 276) >> 2] = 0;
+                d = h;
+                b = (b + 164) | 0;
+              }
+              return d | 0;
+            }
+            function QK() {
+              var a = 0,
+                b = 0,
+                d = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              o = l;
+              l = (l + 16) | 0;
+              n = (o + 8) | 0;
+              k = o;
+              m = VO(c[47251] | 0) | 0;
+              a = ((c[((c[47254] | 0) + 16) >> 2] | 0) + 192) | 0;
+              while (1) {
+                b = c[a >> 2] | 0;
+                if (!b) {
+                  j = 0;
+                  break;
+                }
+                d = (b + 16) | 0;
+                a = c[d >> 2] | 0;
+                if (!(c[(a + 292) >> 2] | 0)) {
+                  XO(m, b);
+                  a = c[d >> 2] | 0;
+                }
+                a = (a + 164) | 0;
+              }
+              while (1) {
+                a = YO(m) | 0;
+                if (!a) break;
+                i = (a + 16) | 0;
+                a = c[i >> 2] | 0;
+                f = (a + 232) | 0;
+                c[f >> 2] = 0;
+                d = c[(a + 172) >> 2] | 0;
+                b = 0;
+                h = 0;
+                while (1) {
+                  g = c[(d + (b << 2)) >> 2] | 0;
+                  if (!g) {
+                    f = 0;
+                    break;
+                  }
+                  g =
+                    ((c[
+                      ((c[((c[((((c[g >> 2] & 3) | 0) == 3 ? g : (g + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                        232) >>
+                        2
+                    ] |
+                      0) +
+                      (e[((c[(g + 16) >> 2] | 0) + 170) >> 1] | 0)) |
+                    0;
+                  g = (h | 0) > (g | 0) ? h : g;
+                  c[f >> 2] = g;
+                  b = (b + 1) | 0;
+                  h = g;
+                }
+                while (1) {
+                  b = c[((c[(a + 180) >> 2] | 0) + (f << 2)) >> 2] | 0;
+                  if (!b) break;
+                  d = (b + -48) | 0;
+                  g = ((c[((c[((((c[b >> 2] & 3) | 0) == 2 ? b : d) + 40) >> 2] | 0) + 16) >> 2] | 0) + 292) | 0;
+                  h = c[g >> 2] | 0;
+                  c[g >> 2] = h + -1;
+                  if ((h | 0) < 2) {
+                    XO(m, c[((((c[b >> 2] & 3) | 0) == 2 ? b : d) + 40) >> 2] | 0);
+                    a = c[i >> 2] | 0;
+                  }
+                  f = (f + 1) | 0;
+                }
+                j = (j + 1) | 0;
+              }
+              a: do
+                if ((j | 0) != (c[47251] | 0)) {
+                  gA(1, 102556, k) | 0;
+                  a = ((c[((c[47254] | 0) + 16) >> 2] | 0) + 192) | 0;
+                  while (1) {
+                    b = c[a >> 2] | 0;
+                    if (!b) break a;
+                    d = (b + 16) | 0;
+                    a = c[d >> 2] | 0;
+                    if (c[(a + 292) >> 2] | 0) {
+                      k = KB(b) | 0;
+                      a = c[((c[d >> 2] | 0) + 292) >> 2] | 0;
+                      c[n >> 2] = k;
+                      c[(n + 4) >> 2] = a;
+                      gA(3, 102578, n) | 0;
+                      a = c[d >> 2] | 0;
+                    }
+                    a = (a + 164) | 0;
+                  }
+                }
+              while (0);
+              WO(m);
+              l = o;
+              return;
+            }
+            function RK() {
+              var b = 0,
+                d = 0,
+                e = 0;
+              b = ((c[((c[47254] | 0) + 16) >> 2] | 0) + 192) | 0;
+              while (1) {
+                b = c[b >> 2] | 0;
+                if (!b) break;
+                e = (b + 16) | 0;
+                b = c[e >> 2] | 0;
+                d = c[(b + 264) >> 2] | 0;
+                if (d) {
+                  U1(d);
+                  b = c[e >> 2] | 0;
+                }
+                d = c[(b + 272) >> 2] | 0;
+                if (d) {
+                  U1(d);
+                  b = c[e >> 2] | 0;
+                }
+                a[(b + 157) >> 0] = 0;
+                b = (b + 164) | 0;
+              }
+              return;
+            }
+            function SK() {
+              var a = 0,
+                b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              a = ((c[((c[47254] | 0) + 16) >> 2] | 0) + 192) | 0;
+              while (1) {
+                a = c[a >> 2] | 0;
+                if (!a) break;
+                a = c[(a + 16) >> 2] | 0;
+                c[(a + 280) >> 2] = 0;
+                a = (a + 164) | 0;
+              }
+              f = JK(c[47251] << 2) | 0;
+              e = 0;
+              a = ((c[((c[47254] | 0) + 16) >> 2] | 0) + 192) | 0;
+              while (1) {
+                b = c[a >> 2] | 0;
+                if (!b) break;
+                d = (b + 16) | 0;
+                a = c[d >> 2] | 0;
+                if (!(c[(a + 280) >> 2] | 0)) {
+                  c[(f + (e << 2)) >> 2] = dL(b) | 0;
+                  b = (e + 1) | 0;
+                  a = c[d >> 2] | 0;
+                } else b = e;
+                e = b;
+                a = (a + 164) | 0;
+              }
+              a = eL(f, e) | 0;
+              while (1) {
+                if ((fL(a) | 0) <= 1) break;
+                jL(a, c[((iL(hL(gL(a) | 0) | 0) | 0) + 8) >> 2] | 0);
+              }
+              U1(a);
+              a = 0;
+              while (1) {
+                if ((a | 0) >= (e | 0)) break;
+                U1(c[(f + (a << 2)) >> 2] | 0);
+                a = (a + 1) | 0;
+              }
+              U1(f);
+              if ((c[47255] | 0) == (((c[47251] | 0) + -1) | 0)) {
+                kL();
+                return;
+              } else qa(102301, 102331, 523, 102336);
+            }
+            function TK() {
+              var a = 0,
+                b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              i = c[47261] | 0;
+              f = c[47255] | 0;
+              j = c[47256] | 0;
+              k = c[47211] | 0;
+              b = 0;
+              a = 0;
+              g = i;
+              while (1) {
+                if ((g | 0) >= (f | 0)) {
+                  h = 8;
+                  break;
+                }
+                e = c[(j + (g << 2)) >> 2] | 0;
+                d = c[((c[(e + 16) >> 2] | 0) + 160) >> 2] | 0;
+                if ((d | 0) < 0) {
+                  if (!a) a = e;
+                  else a = (c[((c[(a + 16) >> 2] | 0) + 160) >> 2] | 0) > (d | 0) ? e : a;
+                  b = (b + 1) | 0;
+                  if ((b | 0) >= (k | 0)) break;
+                }
+                e = (g + 1) | 0;
+                c[47261] = e;
+                g = e;
+              }
+              if ((h | 0) == 8)
+                if ((i | 0) > 0) {
+                  f = 0;
+                  while (1) {
+                    if ((f | 0) >= (i | 0)) break;
+                    d = c[(j + (f << 2)) >> 2] | 0;
+                    e = c[((c[(d + 16) >> 2] | 0) + 160) >> 2] | 0;
+                    if ((e | 0) < 0) {
+                      if (!a) a = d;
+                      else a = (c[((c[(a + 16) >> 2] | 0) + 160) >> 2] | 0) > (e | 0) ? d : a;
+                      b = (b + 1) | 0;
+                      if ((b | 0) >= (k | 0)) break;
+                    }
+                    f = (f + 1) | 0;
+                  }
+                  c[47261] = f;
+                }
+              return a | 0;
+            }
+            function UK(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = c[a >> 2] & 3;
+              d = c[(((b | 0) == 3 ? a : (a + 48) | 0) + 40) >> 2] | 0;
+              a = c[(((b | 0) == 2 ? a : (a + -48) | 0) + 40) >> 2] | 0;
+              b = (c[((c[(d + 16) >> 2] | 0) + 288) >> 2] | 0) < (c[((c[(a + 16) >> 2] | 0) + 288) >> 2] | 0);
+              a = b ? d : a;
+              c[47257] = 0;
+              c[47258] = 2147483647;
+              d = c[(a + 16) >> 2] | 0;
+              c[47259] = c[(d + 284) >> 2];
+              c[47260] = c[(d + 288) >> 2];
+              if (b) cL(a);
+              else bL(a);
+              return c[47257] | 0;
+            }
+            function VK(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              o = l;
+              l = (l + 16) | 0;
+              n = o;
+              g = c[b >> 2] & 3;
+              m = (b + -48) | 0;
+              j = (b + 48) | 0;
+              k = (b + 16) | 0;
+              g =
+                ((c[((c[((c[(((g | 0) == 2 ? b : m) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0) -
+                  (c[((c[((c[(((g | 0) == 3 ? b : j) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0) -
+                  (e[((c[k >> 2] | 0) + 170) >> 1] | 0)) |
+                0;
+              do
+                if ((g | 0) > 0) {
+                  d = c[a >> 2] & 3;
+                  h = c[(((d | 0) == 3 ? a : (a + 48) | 0) + 40) >> 2] | 0;
+                  i = c[(h + 16) >> 2] | 0;
+                  if ((((c[(i + 276) >> 2] | 0) + (c[(i + 268) >> 2] | 0)) | 0) == 1) {
+                    ZK(h, g);
+                    break;
+                  }
+                  d = c[(((d | 0) == 2 ? a : (a + -48) | 0) + 40) >> 2] | 0;
+                  f = c[(d + 16) >> 2] | 0;
+                  if ((((c[(f + 276) >> 2] | 0) + (c[(f + 268) >> 2] | 0)) | 0) == 1) {
+                    ZK(d, (0 - g) | 0);
+                    break;
+                  }
+                  if ((c[(i + 288) >> 2] | 0) < (c[(f + 288) >> 2] | 0)) {
+                    ZK(h, g);
+                    break;
+                  } else {
+                    ZK(d, (0 - g) | 0);
+                    break;
+                  }
+                }
+              while (0);
+              d = (a + 16) | 0;
+              f = c[((c[d >> 2] | 0) + 160) >> 2] | 0;
+              g = c[b >> 2] & 3;
+              g = _K(c[(((g | 0) == 3 ? b : j) + 40) >> 2] | 0, c[(((g | 0) == 2 ? b : m) + 40) >> 2] | 0, f, 1) | 0;
+              i = c[b >> 2] & 3;
+              if (
+                (_K(c[(((i | 0) == 2 ? b : m) + 40) >> 2] | 0, c[(((i | 0) == 3 ? b : j) + 40) >> 2] | 0, f, 0) | 0) ==
+                (g | 0)
+              ) {
+                c[((c[k >> 2] | 0) + 160) >> 2] = 0 - f;
+                c[((c[d >> 2] | 0) + 160) >> 2] = 0;
+                $K(a, b);
+                n = c[(g + 16) >> 2] | 0;
+                aL(g, c[(n + 280) >> 2] | 0, c[(n + 284) >> 2] | 0) | 0;
+                l = o;
+                return;
+              } else {
+                gA(1, 102262, n) | 0;
+                bb(188848, 1);
+              }
+            }
+            function WK() {
+              var b = 0,
+                d = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              YK();
+              m = JK(((c[47253] << 2) + 4) | 0) | 0;
+              d = c[47253] | 0;
+              b = 0;
+              while (1) {
+                if ((b | 0) > (d | 0)) break;
+                c[(m + (b << 2)) >> 2] = 0;
+                b = (b + 1) | 0;
+              }
+              b = ((c[((c[47254] | 0) + 16) >> 2] | 0) + 192) | 0;
+              d = b;
+              while (1) {
+                d = c[d >> 2] | 0;
+                if (!d) break;
+                d = c[(d + 16) >> 2] | 0;
+                if (!(a[(d + 156) >> 0] | 0)) {
+                  l = (m + (c[(d + 232) >> 2] << 2)) | 0;
+                  c[l >> 2] = (c[l >> 2] | 0) + 1;
+                }
+                d = (d + 164) | 0;
+              }
+              while (1) {
+                b = c[b >> 2] | 0;
+                if (!b) break;
+                l = (b + 16) | 0;
+                b = c[l >> 2] | 0;
+                if (!(a[(b + 156) >> 0] | 0)) {
+                  h = c[47253] | 0;
+                  f = c[(b + 172) >> 2] | 0;
+                  k = 0;
+                  j = 0;
+                  d = 0;
+                  while (1) {
+                    g = c[(f + (d << 2)) >> 2] | 0;
+                    if (!g) break;
+                    n = c[(g + 16) >> 2] | 0;
+                    i =
+                      ((c[
+                        ((c[((c[((((c[g >> 2] & 3) | 0) == 3 ? g : (g + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                          232) >>
+                          2
+                      ] |
+                        0) +
+                        (e[(n + 170) >> 1] | 0)) |
+                      0;
+                    k = ((c[(n + 156) >> 2] | 0) + k) | 0;
+                    j = (j | 0) > (i | 0) ? j : i;
+                    d = (d + 1) | 0;
+                  }
+                  g = c[(b + 180) >> 2] | 0;
+                  i = 0;
+                  d = 0;
+                  while (1) {
+                    f = c[(g + (d << 2)) >> 2] | 0;
+                    if (!f) break;
+                    o = c[(f + 16) >> 2] | 0;
+                    n =
+                      ((c[
+                        ((c[((c[((((c[f >> 2] & 3) | 0) == 2 ? f : (f + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                          232) >>
+                          2
+                      ] |
+                        0) -
+                        (e[(o + 170) >> 1] | 0)) |
+                      0;
+                    i = ((c[(o + 156) >> 2] | 0) + i) | 0;
+                    h = (h | 0) < (n | 0) ? h : n;
+                    d = (d + 1) | 0;
+                  }
+                  d = (j | 0) > 0 ? j : 0;
+                  if ((k | 0) == (i | 0)) {
+                    g = d;
+                    f = d;
+                    while (1) {
+                      d = (f + 1) | 0;
+                      if ((f | 0) >= (h | 0)) break;
+                      g = (c[(m + (d << 2)) >> 2] | 0) < (c[(m + (g << 2)) >> 2] | 0) ? d : g;
+                      f = d;
+                    }
+                    o = (b + 232) | 0;
+                    n = (m + (c[o >> 2] << 2)) | 0;
+                    c[n >> 2] = (c[n >> 2] | 0) + -1;
+                    n = (m + (g << 2)) | 0;
+                    c[n >> 2] = (c[n >> 2] | 0) + 1;
+                    c[o >> 2] = g;
+                  }
+                  d = c[(b + 264) >> 2] | 0;
+                  if (d) {
+                    U1(d);
+                    b = c[l >> 2] | 0;
+                  }
+                  d = c[(b + 272) >> 2] | 0;
+                  if (d) {
+                    U1(d);
+                    b = c[l >> 2] | 0;
+                  }
+                  a[(b + 157) >> 0] = 0;
+                }
+                b = (b + 164) | 0;
+              }
+              U1(m);
+              return;
+            }
+            function XK() {
+              var a = 0,
+                b = 0,
+                d = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              b = 0;
+              while (1) {
+                if ((b | 0) >= (c[47255] | 0)) break;
+                a = c[((c[47256] | 0) + (b << 2)) >> 2] | 0;
+                do
+                  if (
+                    ((c[((c[(a + 16) >> 2] | 0) + 160) >> 2] | 0) == 0 ? ((d = UK(a) | 0), d | 0) : 0)
+                      ? ((f = c[d >> 2] & 3),
+                        (f =
+                          ((c[
+                            ((c[((c[(((f | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2
+                          ] |
+                            0) -
+                            (c[
+                              ((c[((c[(((f | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2
+                            ] |
+                              0) -
+                            (e[((c[(d + 16) >> 2] | 0) + 170) >> 1] | 0)) |
+                          0),
+                        (f | 0) >= 2)
+                      : 0
+                  ) {
+                    h = c[a >> 2] & 3;
+                    g = c[(((h | 0) == 3 ? a : (a + 48) | 0) + 40) >> 2] | 0;
+                    a = c[(((h | 0) == 2 ? a : (a + -48) | 0) + 40) >> 2] | 0;
+                    if ((c[((c[(g + 16) >> 2] | 0) + 288) >> 2] | 0) < (c[((c[(a + 16) >> 2] | 0) + 288) >> 2] | 0)) {
+                      ZK(g, f >>> 1);
+                      break;
+                    } else {
+                      ZK(a, ((f | 0) / -2) | 0);
+                      break;
+                    }
+                  }
+                while (0);
+                b = (b + 1) | 0;
+              }
+              RK();
+              return;
+            }
+            function YK() {
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              i = l;
+              l = (l + 16) | 0;
+              h = i;
+              c[h >> 2] = 0;
+              c[h >> 2] = 2147483647;
+              c[47253] = -2147483647;
+              b = ((c[((c[47254] | 0) + 16) >> 2] | 0) + 192) | 0;
+              e = b;
+              g = 2147483647;
+              f = -2147483647;
+              while (1) {
+                d = c[e >> 2] | 0;
+                if (!d) break;
+                e = c[(d + 16) >> 2] | 0;
+                if (!(a[(e + 156) >> 0] | 0)) {
+                  j = c[(e + 232) >> 2] | 0;
+                  d = (g | 0) < (j | 0) ? g : j;
+                  c[h >> 2] = d;
+                  f = (f | 0) > (j | 0) ? f : j;
+                  c[47253] = f;
+                } else d = g;
+                e = (e + 164) | 0;
+                g = d;
+              }
+              if (g | 0) {
+                while (1) {
+                  b = c[b >> 2] | 0;
+                  if (!b) break;
+                  b = c[(b + 16) >> 2] | 0;
+                  j = (b + 232) | 0;
+                  c[j >> 2] = (c[j >> 2] | 0) - g;
+                  b = (b + 164) | 0;
+                }
+                c[47253] = f - g;
+                c[h >> 2] = 0;
+              }
+              l = i;
+              return;
+            }
+            function ZK(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              f = (a + 16) | 0;
+              a = c[f >> 2] | 0;
+              e = (a + 232) | 0;
+              c[e >> 2] = (c[e >> 2] | 0) - b;
+              e = 0;
+              while (1) {
+                d = c[((c[(a + 272) >> 2] | 0) + (e << 2)) >> 2] | 0;
+                if (!d) {
+                  e = 0;
+                  break;
+                }
+                if ((d | 0) != (c[(a + 280) >> 2] | 0)) {
+                  ZK(c[((((c[d >> 2] & 3) | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0, b);
+                  a = c[f >> 2] | 0;
+                }
+                e = (e + 1) | 0;
+              }
+              while (1) {
+                d = c[((c[(a + 264) >> 2] | 0) + (e << 2)) >> 2] | 0;
+                if (!d) break;
+                if ((d | 0) != (c[(a + 280) >> 2] | 0)) {
+                  ZK(c[((((c[d >> 2] & 3) | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0, b);
+                  a = c[f >> 2] | 0;
+                }
+                e = (e + 1) | 0;
+              }
+              return;
+            }
+            function _K(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              g = ((e | 0) == 0) & 1;
+              h = (0 - d) | 0;
+              f = c[((c[(b + 16) >> 2] | 0) + 288) >> 2] | 0;
+              b = a;
+              while (1) {
+                a = c[(b + 16) >> 2] | 0;
+                if ((c[(a + 284) >> 2] | 0) <= (f | 0) ? (f | 0) <= (c[(a + 288) >> 2] | 0) : 0) break;
+                a = c[(a + 280) >> 2] | 0;
+                i = (a + 48) | 0;
+                j = ((c[(a + 16) >> 2] | 0) + 160) | 0;
+                c[j >> 2] =
+                  (((b | 0) == (c[((((c[a >> 2] & 3) | 0) == 3 ? a : i) + 40) >> 2] | 0) ? e : g) | 0 ? d : h) +
+                  (c[j >> 2] | 0);
+                j = c[a >> 2] & 3;
+                i = c[(((j | 0) == 3 ? a : i) + 40) >> 2] | 0;
+                a = c[(((j | 0) == 2 ? a : (a + -48) | 0) + 40) >> 2] | 0;
+                b = (c[((c[(i + 16) >> 2] | 0) + 288) >> 2] | 0) > (c[((c[(a + 16) >> 2] | 0) + 288) >> 2] | 0) ? i : a;
+              }
+              return b | 0;
+            }
+            function $K(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              i = (a + 16) | 0;
+              e = ((c[i >> 2] | 0) + 164) | 0;
+              c[((c[(b + 16) >> 2] | 0) + 164) >> 2] = c[e >> 2];
+              c[((c[47256] | 0) + (c[e >> 2] << 2)) >> 2] = b;
+              c[((c[i >> 2] | 0) + 164) >> 2] = -1;
+              i = ((c[((((c[a >> 2] & 3) | 0) == 3 ? a : (a + 48) | 0) + 40) >> 2] | 0) + 16) | 0;
+              e = c[i >> 2] | 0;
+              g = (e + 276) | 0;
+              f = c[g >> 2] | 0;
+              j = (f + -1) | 0;
+              c[g >> 2] = j;
+              g = (e + 272) | 0;
+              h = 0;
+              while (1) {
+                if ((h | 0) >= (f | 0)) {
+                  k = 3;
+                  break;
+                }
+                d = c[g >> 2] | 0;
+                if ((c[(d + (h << 2)) >> 2] | 0) == (a | 0)) break;
+                h = (h + 1) | 0;
+              }
+              if ((k | 0) == 3) d = c[(e + 272) >> 2] | 0;
+              c[(d + (h << 2)) >> 2] = c[(d + (j << 2)) >> 2];
+              c[((c[((c[i >> 2] | 0) + 272) >> 2] | 0) + (j << 2)) >> 2] = 0;
+              i = ((c[((((c[a >> 2] & 3) | 0) == 2 ? a : (a + -48) | 0) + 40) >> 2] | 0) + 16) | 0;
+              e = c[i >> 2] | 0;
+              g = (e + 268) | 0;
+              f = c[g >> 2] | 0;
+              j = (f + -1) | 0;
+              c[g >> 2] = j;
+              g = (e + 264) | 0;
+              h = 0;
+              while (1) {
+                if ((h | 0) >= (f | 0)) {
+                  k = 8;
+                  break;
+                }
+                d = c[g >> 2] | 0;
+                if ((c[(d + (h << 2)) >> 2] | 0) == (a | 0)) break;
+                h = (h + 1) | 0;
+              }
+              if ((k | 0) == 8) d = c[(e + 264) >> 2] | 0;
+              c[(d + (h << 2)) >> 2] = c[(d + (j << 2)) >> 2];
+              c[((c[((c[i >> 2] | 0) + 264) >> 2] | 0) + (j << 2)) >> 2] = 0;
+              k = ((c[((((c[b >> 2] & 3) | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0) + 16) | 0;
+              a = c[k >> 2] | 0;
+              j = c[(a + 272) >> 2] | 0;
+              a = (a + 276) | 0;
+              i = c[a >> 2] | 0;
+              c[a >> 2] = i + 1;
+              c[(j + (i << 2)) >> 2] = b;
+              k = c[k >> 2] | 0;
+              c[((c[(k + 272) >> 2] | 0) + (c[(k + 276) >> 2] << 2)) >> 2] = 0;
+              k = ((c[((((c[b >> 2] & 3) | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0) + 16) | 0;
+              i = c[k >> 2] | 0;
+              j = c[(i + 264) >> 2] | 0;
+              i = (i + 268) | 0;
+              a = c[i >> 2] | 0;
+              c[i >> 2] = a + 1;
+              c[(j + (a << 2)) >> 2] = b;
+              k = c[k >> 2] | 0;
+              c[((c[(k + 264) >> 2] | 0) + (c[(k + 268) >> 2] << 2)) >> 2] = 0;
+              return;
+            }
+            function aL(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              g = (a + 16) | 0;
+              a = c[g >> 2] | 0;
+              c[(a + 280) >> 2] = b;
+              c[(a + 284) >> 2] = d;
+              f = 0;
+              while (1) {
+                e = c[((c[(a + 272) >> 2] | 0) + (f << 2)) >> 2] | 0;
+                if (!e) {
+                  f = 0;
+                  break;
+                }
+                if ((e | 0) != (b | 0)) {
+                  d = aL(c[((((c[e >> 2] & 3) | 0) == 2 ? e : (e + -48) | 0) + 40) >> 2] | 0, e, d) | 0;
+                  a = c[g >> 2] | 0;
+                }
+                f = (f + 1) | 0;
+              }
+              while (1) {
+                e = c[((c[(a + 264) >> 2] | 0) + (f << 2)) >> 2] | 0;
+                if (!e) break;
+                if ((e | 0) != (b | 0)) {
+                  d = aL(c[((((c[e >> 2] & 3) | 0) == 3 ? e : (e + 48) | 0) + 40) >> 2] | 0, e, d) | 0;
+                  a = c[g >> 2] | 0;
+                }
+                f = (f + 1) | 0;
+              }
+              c[(a + 288) >> 2] = d;
+              return (d + 1) | 0;
+            }
+            function bL(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              i = (a + 16) | 0;
+              g = 0;
+              while (1) {
+                a = c[i >> 2] | 0;
+                d = c[((c[(a + 180) >> 2] | 0) + (g << 2)) >> 2] | 0;
+                if (!d) {
+                  d = 0;
+                  break;
+                }
+                f = c[(d + 16) >> 2] | 0;
+                if ((c[(f + 164) >> 2] | 0) < 0) {
+                  a = c[d >> 2] & 3;
+                  b = c[((c[(((a | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                  j = c[(b + 288) >> 2] | 0;
+                  if (
+                    ((c[47259] | 0) > (j | 0)) | ((j | 0) > (c[47260] | 0))
+                      ? ((h =
+                          ((c[(b + 232) >> 2] | 0) -
+                            (c[
+                              ((c[((c[(((a | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2
+                            ] |
+                              0) -
+                            (e[(f + 170) >> 1] | 0)) |
+                          0),
+                        ((h | 0) < (c[47258] | 0)) | ((c[47257] | 0) == 0))
+                      : 0
+                  ) {
+                    c[47257] = d;
+                    c[47258] = h;
+                  }
+                } else {
+                  b = c[((((c[d >> 2] & 3) | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0;
+                  if ((c[((c[(b + 16) >> 2] | 0) + 288) >> 2] | 0) < (c[(a + 288) >> 2] | 0)) bL(b);
+                }
+                g = (g + 1) | 0;
+              }
+              while (1) {
+                b = c[((c[(a + 264) >> 2] | 0) + (d << 2)) >> 2] | 0;
+                if (!(((b | 0) != 0) & ((c[47258] | 0) > 0))) break;
+                b = c[((((c[b >> 2] & 3) | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0;
+                if ((c[((c[(b + 16) >> 2] | 0) + 288) >> 2] | 0) < (c[(a + 288) >> 2] | 0)) {
+                  bL(b);
+                  a = c[i >> 2] | 0;
+                }
+                d = (d + 1) | 0;
+              }
+              return;
+            }
+            function cL(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              i = (a + 16) | 0;
+              g = 0;
+              while (1) {
+                a = c[i >> 2] | 0;
+                d = c[((c[(a + 172) >> 2] | 0) + (g << 2)) >> 2] | 0;
+                if (!d) {
+                  d = 0;
+                  break;
+                }
+                f = c[(d + 16) >> 2] | 0;
+                if ((c[(f + 164) >> 2] | 0) < 0) {
+                  a = c[d >> 2] & 3;
+                  b = c[((c[(((a | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                  j = c[(b + 288) >> 2] | 0;
+                  if (
+                    ((c[47259] | 0) > (j | 0)) | ((j | 0) > (c[47260] | 0))
+                      ? ((h =
+                          ((c[
+                            ((c[((c[(((a | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2
+                          ] |
+                            0) -
+                            (c[(b + 232) >> 2] | 0) -
+                            (e[(f + 170) >> 1] | 0)) |
+                          0),
+                        ((h | 0) < (c[47258] | 0)) | ((c[47257] | 0) == 0))
+                      : 0
+                  ) {
+                    c[47257] = d;
+                    c[47258] = h;
+                  }
+                } else {
+                  b = c[((((c[d >> 2] & 3) | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0;
+                  if ((c[((c[(b + 16) >> 2] | 0) + 288) >> 2] | 0) < (c[(a + 288) >> 2] | 0)) cL(b);
+                }
+                g = (g + 1) | 0;
+              }
+              while (1) {
+                b = c[((c[(a + 272) >> 2] | 0) + (d << 2)) >> 2] | 0;
+                if (!(((b | 0) != 0) & ((c[47258] | 0) > 0))) break;
+                b = c[((((c[b >> 2] & 3) | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0;
+                if ((c[((c[(b + 16) >> 2] | 0) + 288) >> 2] | 0) < (c[(a + 288) >> 2] | 0)) {
+                  cL(b);
+                  a = c[i >> 2] | 0;
+                }
+                d = (d + 1) | 0;
+              }
+              return;
+            }
+            function dL(a) {
+              a = a | 0;
+              var b = 0;
+              b = JK(16) | 0;
+              c[b >> 2] = a;
+              c[(b + 4) >> 2] = tL(a, b) | 0;
+              c[(b + 12) >> 2] = b;
+              return b | 0;
+            }
+            function eL(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              e = JK(8) | 0;
+              c[e >> 2] = a;
+              c[(e + 4) >> 2] = b;
+              d = 0;
+              while (1) {
+                if ((d | 0) >= (b | 0)) break;
+                c[((c[(a + (d << 2)) >> 2] | 0) + 8) >> 2] = d;
+                d = (d + 1) | 0;
+              }
+              d = ((b | 0) / 2) | 0;
+              while (1) {
+                if ((d | 0) <= -1) break;
+                jL(e, d);
+                d = (d + -1) | 0;
+              }
+              return e | 0;
+            }
+            function fL(a) {
+              a = a | 0;
+              return c[(a + 4) >> 2] | 0;
+            }
+            function gL(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              f = c[a >> 2] | 0;
+              b = c[f >> 2] | 0;
+              c[(b + 8) >> 2] = -1;
+              d = (a + 4) | 0;
+              e = ((c[d >> 2] | 0) + -1) | 0;
+              c[f >> 2] = c[(f + (e << 2)) >> 2];
+              f = c[a >> 2] | 0;
+              c[((c[f >> 2] | 0) + 8) >> 2] = 0;
+              c[(f + (e << 2)) >> 2] = b;
+              c[d >> 2] = e;
+              jL(a, 0);
+              return b | 0;
+            }
+            function hL(a) {
+              a = a | 0;
+              return sL(c[a >> 2] | 0, 0, 0) | 0;
+            }
+            function iL(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              b = (a + 16) | 0;
+              if ((c[((c[b >> 2] | 0) + 164) >> 2] | 0) > -1) qa(102350, 102331, 463, 102364);
+              g = (a + 48) | 0;
+              d = oL(c[((((c[a >> 2] & 3) | 0) == 3 ? a : g) + 40) >> 2] | 0) | 0;
+              i = (a + -48) | 0;
+              f = oL(c[((((c[a >> 2] & 3) | 0) == 2 ? a : i) + 40) >> 2] | 0) | 0;
+              h = c[a >> 2] & 3;
+              b =
+                ((c[((c[((c[(((h | 0) == 2 ? a : i) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0) -
+                  (c[((c[((c[(((h | 0) == 3 ? a : g) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0) -
+                  (e[((c[b >> 2] | 0) + 170) >> 1] | 0)) |
+                0;
+              if ((c[(d + 8) >> 2] | 0) == -1) pL(c[d >> 2] | 0, 0, b);
+              else pL(c[f >> 2] | 0, 0, (0 - b) | 0);
+              qL(a);
+              return rL(d, f) | 0;
+            }
+            function jL(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              h = c[a >> 2] | 0;
+              g = c[(a + 4) >> 2] | 0;
+              while (1) {
+                a = b << 1;
+                f = (a + 2) | 0;
+                a = a | 1;
+                if (
+                  !((a | 0) < (g | 0)
+                    ? (c[((c[(h + (a << 2)) >> 2] | 0) + 4) >> 2] | 0) <
+                      (c[((c[(h + (b << 2)) >> 2] | 0) + 4) >> 2] | 0)
+                    : 0)
+                )
+                  a = b;
+                if ((f | 0) >= (g | 0)) break;
+                d = (h + (f << 2)) | 0;
+                e = c[d >> 2] | 0;
+                if ((f | 0) == (b | 0) ? 1 : (c[(e + 4) >> 2] | 0) >= (c[((c[(h + (a << 2)) >> 2] | 0) + 4) >> 2] | 0))
+                  break;
+                i = (h + (b << 2)) | 0;
+                a = c[i >> 2] | 0;
+                c[i >> 2] = e;
+                c[d >> 2] = a;
+                c[((c[i >> 2] | 0) + 8) >> 2] = b;
+                c[(a + 8) >> 2] = f;
+                b = f;
+              }
+              return;
+            }
+            function kL() {
+              aL(c[((c[((c[47254] | 0) + 16) >> 2] | 0) + 192) >> 2] | 0, 0, 1) | 0;
+              lL(c[((c[((c[47254] | 0) + 16) >> 2] | 0) + 192) >> 2] | 0, 0);
+              return;
+            }
+            function lL(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              f = (a + 16) | 0;
+              d = 0;
+              while (1) {
+                a = c[f >> 2] | 0;
+                e = c[((c[(a + 272) >> 2] | 0) + (d << 2)) >> 2] | 0;
+                if (!e) {
+                  e = 0;
+                  break;
+                }
+                if ((e | 0) != (b | 0)) lL(c[((((c[e >> 2] & 3) | 0) == 2 ? e : (e + -48) | 0) + 40) >> 2] | 0, e);
+                d = (d + 1) | 0;
+              }
+              while (1) {
+                d = c[((c[(a + 264) >> 2] | 0) + (e << 2)) >> 2] | 0;
+                if (!d) break;
+                if ((d | 0) != (b | 0)) {
+                  lL(c[((((c[d >> 2] & 3) | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0, d);
+                  a = c[f >> 2] | 0;
+                }
+                e = (e + 1) | 0;
+              }
+              if (b | 0) mL(b);
+              return;
+            }
+            function mL(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              b = c[a >> 2] & 3;
+              d = c[(((b | 0) == 3 ? a : (a + 48) | 0) + 40) >> 2] | 0;
+              e = c[(d + 16) >> 2] | 0;
+              if ((c[(e + 280) >> 2] | 0) == (a | 0)) i = 1;
+              else {
+                e = c[(((b | 0) == 2 ? a : (a + -48) | 0) + 40) >> 2] | 0;
+                i = -1;
+                d = e;
+                e = c[(e + 16) >> 2] | 0;
+              }
+              g = c[(e + 180) >> 2] | 0;
+              b = 0;
+              f = 0;
+              while (1) {
+                h = c[(g + (f << 2)) >> 2] | 0;
+                if (!h) break;
+                b = ((nL(h, d, i) | 0) + b) | 0;
+                f = (f + 1) | 0;
+              }
+              g = c[(e + 172) >> 2] | 0;
+              e = 0;
+              while (1) {
+                f = c[(g + (e << 2)) >> 2] | 0;
+                if (!f) break;
+                b = ((nL(f, d, i) | 0) + b) | 0;
+                e = (e + 1) | 0;
+              }
+              c[((c[(a + 16) >> 2] | 0) + 160) >> 2] = b;
+              return;
+            }
+            function nL(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              h = c[a >> 2] & 3;
+              i = (h | 0) == 3 ? a : (a + 48) | 0;
+              e = c[(i + 40) >> 2] | 0;
+              if ((e | 0) == (b | 0)) e = c[(((h | 0) == 2 ? a : (a + -48) | 0) + 40) >> 2] | 0;
+              g = c[(b + 16) >> 2] | 0;
+              f = c[((c[(e + 16) >> 2] | 0) + 288) >> 2] | 0;
+              if ((c[(g + 284) >> 2] | 0) <= (f | 0) ? (f | 0) <= (c[(g + 288) >> 2] | 0) : 0) {
+                f = c[(a + 16) >> 2] | 0;
+                if ((c[(f + 164) >> 2] | 0) > -1) e = c[(f + 160) >> 2] | 0;
+                else e = 0;
+                g = 1;
+                e = (e - (c[(f + 156) >> 2] | 0)) | 0;
+              } else {
+                g = 0;
+                e = c[((c[(a + 16) >> 2] | 0) + 156) >> 2] | 0;
+              }
+              i = (c[(((d | 0) > 0 ? ((h | 0) == 2 ? a : (a + -48) | 0) : i) + 40) >> 2] | 0) == (b | 0) ? 1 : -1;
+              return (((g ? i : (0 - i) | 0) | 0) < 0 ? (0 - e) | 0 : e) | 0;
+            }
+            function oL(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              a = c[((c[(a + 16) >> 2] | 0) + 280) >> 2] | 0;
+              while (1) {
+                b = (a + 12) | 0;
+                d = c[b >> 2] | 0;
+                if (!(((d | 0) != (a | 0)) & ((d | 0) != 0))) break;
+                a = c[(d + 12) >> 2] | 0;
+                if (!a) {
+                  a = d;
+                  continue;
+                }
+                c[b >> 2] = a;
+              }
+              return a | 0;
+            }
+            function pL(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = (a + 16) | 0;
+              e = c[h >> 2] | 0;
+              g = (e + 232) | 0;
+              c[g >> 2] = (c[g >> 2] | 0) + d;
+              g = 0;
+              while (1) {
+                f = c[((c[(e + 264) >> 2] | 0) + (g << 2)) >> 2] | 0;
+                if (!f) {
+                  g = 0;
+                  break;
+                }
+                f = c[((((c[f >> 2] & 3) | 0) == 3 ? f : (f + 48) | 0) + 40) >> 2] | 0;
+                if ((f | 0) != (b | 0)) {
+                  pL(f, a, d);
+                  e = c[h >> 2] | 0;
+                }
+                g = (g + 1) | 0;
+              }
+              while (1) {
+                f = c[((c[(e + 272) >> 2] | 0) + (g << 2)) >> 2] | 0;
+                if (!f) break;
+                f = c[((((c[f >> 2] & 3) | 0) == 2 ? f : (f + -48) | 0) + 40) >> 2] | 0;
+                if ((f | 0) != (b | 0)) {
+                  pL(f, a, d);
+                  e = c[h >> 2] | 0;
+                }
+                g = (g + 1) | 0;
+              }
+              return;
+            }
+            function qL(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              h = l;
+              l = (l + 32) | 0;
+              d = ((c[(b + 16) >> 2] | 0) + 164) | 0;
+              if ((c[d >> 2] | 0) > -1) {
+                gA(1, 102453, h) | 0;
+                bb(188848, 1);
+              }
+              g = c[47255] | 0;
+              c[d >> 2] = g;
+              d = c[47256] | 0;
+              c[47255] = g + 1;
+              c[(d + (g << 2)) >> 2] = b;
+              d = c[b >> 2] | 0;
+              g = (b + 48) | 0;
+              e = c[((((d & 3) | 0) == 3 ? b : g) + 40) >> 2] | 0;
+              if (!(a[((c[(e + 16) >> 2] | 0) + 157) >> 0] | 0)) {
+                f = c[47262] | 0;
+                d = c[47263] | 0;
+                c[47263] = d + 1;
+                c[(f + (d << 2)) >> 2] = e;
+                d = c[b >> 2] | 0;
+              }
+              f = (b + -48) | 0;
+              e = c[((((d & 3) | 0) == 2 ? b : f) + 40) >> 2] | 0;
+              if (!(a[((c[(e + 16) >> 2] | 0) + 157) >> 0] | 0)) {
+                i = c[47262] | 0;
+                d = c[47263] | 0;
+                c[47263] = d + 1;
+                c[(i + (d << 2)) >> 2] = e;
+                d = c[b >> 2] | 0;
+              }
+              i = ((c[((((d & 3) | 0) == 3 ? b : g) + 40) >> 2] | 0) + 16) | 0;
+              d = c[i >> 2] | 0;
+              a[(d + 157) >> 0] = 1;
+              e = c[(d + 272) >> 2] | 0;
+              d = (d + 276) | 0;
+              g = c[d >> 2] | 0;
+              c[d >> 2] = g + 1;
+              c[(e + (g << 2)) >> 2] = b;
+              g = c[i >> 2] | 0;
+              c[((c[(g + 272) >> 2] | 0) + (c[(g + 276) >> 2] << 2)) >> 2] = 0;
+              i = c[i >> 2] | 0;
+              if (!(c[((c[(i + 180) >> 2] | 0) + (((c[(i + 276) >> 2] | 0) + -1) << 2)) >> 2] | 0)) {
+                gA(1, 102487, (h + 8) | 0) | 0;
+                bb(188848, 1);
+              }
+              i = ((c[((((c[b >> 2] & 3) | 0) == 2 ? b : f) + 40) >> 2] | 0) + 16) | 0;
+              e = c[i >> 2] | 0;
+              a[(e + 157) >> 0] = 1;
+              f = c[(e + 264) >> 2] | 0;
+              e = (e + 268) | 0;
+              g = c[e >> 2] | 0;
+              c[e >> 2] = g + 1;
+              c[(f + (g << 2)) >> 2] = b;
+              b = c[i >> 2] | 0;
+              c[((c[(b + 264) >> 2] | 0) + (c[(b + 268) >> 2] << 2)) >> 2] = 0;
+              i = c[i >> 2] | 0;
+              if (!(c[((c[(i + 172) >> 2] | 0) + (((c[(i + 268) >> 2] | 0) + -1) << 2)) >> 2] | 0)) {
+                gA(1, 102522, (h + 16) | 0) | 0;
+                bb(188848, 1);
+              } else {
+                l = h;
+                return;
+              }
+            }
+            function rL(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              while (1) {
+                g = (a + 12) | 0;
+                d = c[g >> 2] | 0;
+                if (((d | 0) == 0) | ((d | 0) == (a | 0))) break;
+                else a = d;
+              }
+              while (1) {
+                f = (b + 12) | 0;
+                d = c[f >> 2] | 0;
+                if (((d | 0) == 0) | ((d | 0) == (b | 0))) break;
+                else b = d;
+              }
+              if ((a | 0) != (b | 0)) {
+                e = c[(a + 8) >> 2] | 0;
+                d = c[(b + 8) >> 2] | 0;
+                do
+                  if ((e | 0) > -1)
+                    if ((d | 0) == -1) h = a;
+                    else j = 10;
+                  else if ((d | 0) > -1)
+                    if ((e | 0) == -1) {
+                      h = b;
+                      break;
+                    } else {
+                      j = 10;
+                      break;
+                    }
+                  else qa(102376, 102331, 327, 102423);
+                while (0);
+                if ((j | 0) == 10) h = (c[(b + 4) >> 2] | 0) < (c[(a + 4) >> 2] | 0) ? a : b;
+                c[f >> 2] = h;
+                c[g >> 2] = h;
+                c[(h + 4) >> 2] = (c[(b + 4) >> 2] | 0) + (c[(a + 4) >> 2] | 0);
+                if ((c[(h + 8) >> 2] | 0) > -1) i = h;
+                else qa(102434, 102331, 335, 102423);
+              } else i = a;
+              return i | 0;
+            }
+            function sL(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              l = oL(a) | 0;
+              if (d) {
+                k = c[d >> 2] & 3;
+                if (
+                  (((c[((c[((c[(((k | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0) -
+                    (c[((c[((c[(((k | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0)) |
+                    0) !=
+                  (e[((c[(d + 16) >> 2] | 0) + 170) >> 1] | 0 | 0)
+                )
+                  f = 3;
+              } else {
+                d = 0;
+                f = 3;
+              }
+              a: do
+                if ((f | 0) == 3) {
+                  k = (a + 16) | 0;
+                  j = 0;
+                  while (1) {
+                    f = c[k >> 2] | 0;
+                    i = c[((c[(f + 180) >> 2] | 0) + (j << 2)) >> 2] | 0;
+                    if (!i) {
+                      j = 0;
+                      break;
+                    }
+                    f = (i + 16) | 0;
+                    g = (i + -48) | 0;
+                    h = c[((((c[i >> 2] & 3) | 0) == 2 ? i : g) + 40) >> 2] | 0;
+                    do
+                      if ((c[((c[f >> 2] | 0) + 164) >> 2] | 0) > -1) {
+                        if ((h | 0) != (b | 0)) d = sL(h, a, d) | 0;
+                      } else if ((oL(h) | 0) != (l | 0)) {
+                        if (
+                          d | 0
+                            ? ((m = c[i >> 2] & 3),
+                              (h = c[d >> 2] & 3),
+                              (((c[((c[((c[(((m | 0) == 2 ? i : g) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0) -
+                                (c[
+                                  ((c[((c[(((m | 0) == 3 ? i : (i + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >>
+                                    2
+                                ] |
+                                  0) -
+                                (e[((c[f >> 2] | 0) + 170) >> 1] | 0)) |
+                                0) >=
+                                (((c[
+                                  ((c[((c[(((h | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                                    232) >>
+                                    2
+                                ] |
+                                  0) -
+                                  (c[
+                                    ((c[((c[(((h | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                                      232) >>
+                                      2
+                                  ] |
+                                    0) -
+                                  (e[((c[(d + 16) >> 2] | 0) + 170) >> 1] | 0)) |
+                                  0))
+                            : 0
+                        )
+                          break;
+                        d = i;
+                      }
+                    while (0);
+                    j = (j + 1) | 0;
+                  }
+                  while (1) {
+                    f = c[((c[(f + 172) >> 2] | 0) + (j << 2)) >> 2] | 0;
+                    if (!f) break a;
+                    g = (f + 16) | 0;
+                    h = (f + 48) | 0;
+                    i = c[((((c[f >> 2] & 3) | 0) == 3 ? f : h) + 40) >> 2] | 0;
+                    do
+                      if ((c[((c[g >> 2] | 0) + 164) >> 2] | 0) > -1) {
+                        if ((i | 0) != (b | 0)) d = sL(i, a, d) | 0;
+                      } else if ((oL(i) | 0) != (l | 0)) {
+                        if (
+                          d | 0
+                            ? ((i = c[f >> 2] & 3),
+                              (m = c[d >> 2] & 3),
+                              (((c[
+                                ((c[((c[(((i | 0) == 2 ? f : (f + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >>
+                                  2
+                              ] |
+                                0) -
+                                (c[((c[((c[(((i | 0) == 3 ? f : h) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0) -
+                                (e[((c[g >> 2] | 0) + 170) >> 1] | 0)) |
+                                0) >=
+                                (((c[
+                                  ((c[((c[(((m | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                                    232) >>
+                                    2
+                                ] |
+                                  0) -
+                                  (c[
+                                    ((c[((c[(((m | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                                      232) >>
+                                      2
+                                  ] |
+                                    0) -
+                                  (e[((c[(d + 16) >> 2] | 0) + 170) >> 1] | 0)) |
+                                  0))
+                            : 0
+                        )
+                          break;
+                        d = f;
+                      }
+                    while (0);
+                    j = (j + 1) | 0;
+                    f = c[k >> 2] | 0;
+                  }
+                }
+              while (0);
+              return d | 0;
+            }
+            function tL(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              l = (a + 16) | 0;
+              d = c[l >> 2] | 0;
+              c[(d + 280) >> 2] = b;
+              a = 1;
+              h = 0;
+              while (1) {
+                g = c[((c[(d + 172) >> 2] | 0) + (h << 2)) >> 2] | 0;
+                if (!g) {
+                  h = 0;
+                  break;
+                }
+                f = c[(g + 16) >> 2] | 0;
+                if (
+                  (
+                    (c[(f + 164) >> 2] | 0) <= -1
+                      ? ((i = c[g >> 2] & 3),
+                        (j = (g + 48) | 0),
+                        (k = c[((c[(((i | 0) == 3 ? g : j) + 40) >> 2] | 0) + 16) >> 2] | 0),
+                        (c[(k + 280) >> 2] | 0) == 0)
+                      : 0
+                  )
+                    ? (((c[((c[((c[(((i | 0) == 2 ? g : (g + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] |
+                        0) -
+                        (c[(k + 232) >> 2] | 0)) |
+                        0) ==
+                      (e[(f + 170) >> 1] | 0 | 0)
+                    : 0
+                ) {
+                  qL(g);
+                  a = ((tL(c[((((c[g >> 2] & 3) | 0) == 3 ? g : j) + 40) >> 2] | 0, b) | 0) + a) | 0;
+                  d = c[l >> 2] | 0;
+                }
+                h = (h + 1) | 0;
+              }
+              while (1) {
+                f = c[((c[(d + 180) >> 2] | 0) + (h << 2)) >> 2] | 0;
+                if (!f) break;
+                g = c[(f + 16) >> 2] | 0;
+                if (
+                  (
+                    (c[(g + 164) >> 2] | 0) <= -1
+                      ? ((m = c[f >> 2] & 3),
+                        (n = (f + -48) | 0),
+                        (o = c[((c[(((m | 0) == 2 ? f : n) + 40) >> 2] | 0) + 16) >> 2] | 0),
+                        (c[(o + 280) >> 2] | 0) == 0)
+                      : 0
+                  )
+                    ? (((c[(o + 232) >> 2] | 0) -
+                        (c[((c[((c[(((m | 0) == 3 ? f : (f + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] |
+                          0)) |
+                        0) ==
+                      (e[(g + 170) >> 1] | 0 | 0)
+                    : 0
+                ) {
+                  qL(f);
+                  a = ((tL(c[((((c[f >> 2] & 3) | 0) == 2 ? f : n) + 40) >> 2] | 0, b) | 0) + a) | 0;
+                  d = c[l >> 2] | 0;
+                }
+                h = (h + 1) | 0;
+              }
+              return a | 0;
+            }
+            function uL(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0;
+              d = QA(a, 102586) | 0;
+              if (!d) d = 30;
+              else d = q5(d) | 0;
+              return NK(a, b, c, d) | 0;
+            }
+            function vL(a) {
+              a = +a;
+              return +(0 == 0 ? a : +h[23301] - a);
+            }
+            function wL(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0.0,
+                t = 0.0,
+                u = 0;
+              r = l;
+              l = (l + 16) | 0;
+              q = r;
+              c[47264] = c[((c[((c[(d + 64) >> 2] | 0) + 8) >> 2] | 0) + 4) >> 2];
+              xL(d);
+              i = c[(d + 16) >> 2] | 0;
+              t = +h[(i + 32) >> 3];
+              s = +h[(i + 40) >> 3];
+              yL(e, 102597, +h[(b + 352) >> 3]);
+              yL(e, 102604, t * 0.013888888888888888);
+              yL(e, 102604, s * 0.013888888888888888);
+              zL(e);
+              i = jC(d) | 0;
+              while (1) {
+                if (!i) break;
+                g = (i + 16) | 0;
+                if (!(a[((c[g >> 2] | 0) + 118) >> 0] | 0)) {
+                  AL(e, 102606, $D(KB(i) | 0) | 0);
+                  p = ((c[g >> 2] | 0) + 16) | 0;
+                  c[q >> 2] = c[p >> 2];
+                  c[(q + 4) >> 2] = c[(p + 4) >> 2];
+                  c[(q + 8) >> 2] = c[(p + 8) >> 2];
+                  c[(q + 12) >> 2] = c[(p + 12) >> 2];
+                  BL(e, q);
+                  if (!(a[((c[((c[g >> 2] | 0) + 104) >> 2] | 0) + 82) >> 0] | 0)) {
+                    b = xC(i) | 0;
+                    b = CL(b, c[c[((c[g >> 2] | 0) + 104) >> 2] >> 2] | 0) | 0;
+                  } else b = $D(RA(i, c[47154] | 0) | 0) | 0;
+                  yL(e, 102604, +h[((c[g >> 2] | 0) + 32) >> 3]);
+                  yL(e, 102604, +h[((c[g >> 2] | 0) + 40) >> 3]);
+                  AL(e, 102604, b);
+                  AL(e, 102604, bP(i, c[47157] | 0, 111067) | 0);
+                  AL(e, 102604, c[c[((c[g >> 2] | 0) + 8) >> 2] >> 2] | 0);
+                  AL(e, 102604, bP(i, c[47148] | 0, 137314) | 0);
+                  b = bP(i, c[47149] | 0, 195059) | 0;
+                  if (!(a[b >> 0] | 0)) b = bP(i, c[47148] | 0, 134800) | 0;
+                  AL(e, 102604, b);
+                  zL(e);
+                }
+                i = kC(d, i) | 0;
+              }
+              o = (f << 24) >> 24 == 0;
+              n = jC(d) | 0;
+              while (1) {
+                if (!n) break;
+                m = XA(d, n) | 0;
+                while (1) {
+                  if (!m) break;
+                  if (o) {
+                    f = 195059;
+                    j = 195059;
+                  } else {
+                    j = QA(m, 111455) | 0;
+                    f = QA(m, 111464) | 0;
+                    f = f | 0 ? f : 195059;
+                    j = j | 0 ? j : 195059;
+                  }
+                  p = (m + 16) | 0;
+                  b = c[p >> 2] | 0;
+                  k = c[(b + 8) >> 2] | 0;
+                  a: do
+                    if (k) {
+                      i = c[(k + 4) >> 2] | 0;
+                      b = 0;
+                      g = 0;
+                      while (1) {
+                        if ((b | 0) >= (i | 0)) break;
+                        u = ((c[((c[k >> 2] | 0) + ((b * 48) | 0) + 4) >> 2] | 0) + g) | 0;
+                        b = (b + 1) | 0;
+                        g = u;
+                      }
+                      AL(e, 0, 111450);
+                      DL(e, c[((((c[m >> 2] & 3) | 0) == 3 ? m : (m + 48) | 0) + 40) >> 2] | 0, j);
+                      DL(e, c[((((c[m >> 2] & 3) | 0) == 2 ? m : (m + -48) | 0) + 40) >> 2] | 0, f);
+                      EL(e, g);
+                      f = 0;
+                      while (1) {
+                        b = c[p >> 2] | 0;
+                        g = c[(b + 8) >> 2] | 0;
+                        if ((f | 0) >= (c[(g + 4) >> 2] | 0)) break a;
+                        i = c[g >> 2] | 0;
+                        g = c[(i + ((f * 48) | 0)) >> 2] | 0;
+                        i = c[(i + ((f * 48) | 0) + 4) >> 2] | 0;
+                        b = 0;
+                        while (1) {
+                          if ((b | 0) >= (i | 0)) break;
+                          u = (g + (b << 4)) | 0;
+                          c[q >> 2] = c[u >> 2];
+                          c[(q + 4) >> 2] = c[(u + 4) >> 2];
+                          c[(q + 8) >> 2] = c[(u + 8) >> 2];
+                          c[(q + 12) >> 2] = c[(u + 12) >> 2];
+                          BL(e, q);
+                          b = (b + 1) | 0;
+                        }
+                        f = (f + 1) | 0;
+                      }
+                    }
+                  while (0);
+                  if (c[(b + 96) >> 2] | 0) {
+                    u = xC(c[((((c[m >> 2] & 3) | 0) == 3 ? m : (m + 48) | 0) + 40) >> 2] | 0) | 0;
+                    AL(e, 102604, CL(u, c[c[((c[p >> 2] | 0) + 96) >> 2] >> 2] | 0) | 0);
+                    u = ((c[((c[p >> 2] | 0) + 96) >> 2] | 0) + 56) | 0;
+                    c[q >> 2] = c[u >> 2];
+                    c[(q + 4) >> 2] = c[(u + 4) >> 2];
+                    c[(q + 8) >> 2] = c[(u + 8) >> 2];
+                    c[(q + 12) >> 2] = c[(u + 12) >> 2];
+                    BL(e, q);
+                  }
+                  AL(e, 102604, bP(m, c[47185] | 0, 111067) | 0);
+                  AL(e, 102604, bP(m, c[47176] | 0, 137314) | 0);
+                  zL(e);
+                  m = ZA(d, m) | 0;
+                }
+                n = kC(d, n) | 0;
+              }
+              FL(102612, e);
+              l = r;
+              return;
+            }
+            function xL(a) {
+              a = a | 0;
+              var b = 0.0;
+              if (0) {
+                a = c[(a + 16) >> 2] | 0;
+                b = +h[(a + 24) >> 3] + +h[(a + 40) >> 3];
+                h[23301] = b;
+                h[23302] = b * 0.013888888888888888;
+              }
+              return;
+            }
+            function yL(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = +c;
+              var d = 0,
+                e = 0,
+                f = 0;
+              f = l;
+              l = (l + 1040) | 0;
+              e = f;
+              d = (f + 8) | 0;
+              if (b | 0) FL(b, a);
+              h[e >> 3] = c;
+              m4(d, 102618, e) | 0;
+              FL(d, a);
+              l = f;
+              return;
+            }
+            function zL(b) {
+              b = b | 0;
+              a[194955] = 10;
+              lb[c[47264] & 127](b, 194955) | 0;
+              return;
+            }
+            function AL(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              if (b | 0) FL(b, a);
+              FL(c, a);
+              return;
+            }
+            function BL(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0;
+              yL(a, 102604, +h[b >> 3] * 0.013888888888888888);
+              if (!0) c = +h[(b + 8) >> 3];
+              else c = +h[23301] - +h[(b + 8) >> 3];
+              yL(a, 102604, c * 0.013888888888888888);
+              return;
+            }
+            function CL(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0;
+              c = fD(a, b) | 0;
+              b = $D(c) | 0;
+              hD(a, c) | 0;
+              return b | 0;
+            }
+            function DL(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0;
+              if (!(a[((c[(d + 16) >> 2] | 0) + 118) >> 0] | 0)) d = $D(KB(d) | 0) | 0;
+              else {
+                f = xC(d) | 0;
+                d = CL(f, ((R2(KB(d) | 0, 58) | 0) + 1) | 0) | 0;
+              }
+              AL(b, 102604, d);
+              if (e | 0 ? a[e >> 0] | 0 : 0) AL(b, 107984, $D(e) | 0);
+              return;
+            }
+            function EL(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              d = l;
+              l = (l + 1040) | 0;
+              f = d;
+              e = (d + 8) | 0;
+              FL(102604, a);
+              c[f >> 2] = b;
+              m4(e, 137395, f) | 0;
+              FL(e, a);
+              l = d;
+              return;
+            }
+            function FL(a, b) {
+              a = a | 0;
+              b = b | 0;
+              lb[c[47264] & 127](b, a) | 0;
+              return;
+            }
+            function GL(d, f, g) {
+              d = d | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0.0,
+                n = 0,
+                o = 0.0,
+                p = 0,
+                q = 0.0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                O = 0,
+                P = 0,
+                Q = 0,
+                R = 0,
+                S = 0,
+                T = 0,
+                U = 0,
+                V = 0,
+                W = 0,
+                X = 0,
+                Y = 0;
+              Y = l;
+              l = (l + 2288) | 0;
+              W = (Y + 208) | 0;
+              V = (Y + 192) | 0;
+              U = (Y + 176) | 0;
+              T = (Y + 160) | 0;
+              S = (Y + 144) | 0;
+              R = (Y + 128) | 0;
+              P = (Y + 112) | 0;
+              O = (Y + 96) | 0;
+              N = (Y + 80) | 0;
+              M = (Y + 64) | 0;
+              L = (Y + 56) | 0;
+              K = (Y + 48) | 0;
+              X = (Y + 32) | 0;
+              Q = (Y + 24) | 0;
+              J = Y;
+              G = (Y + 1264) | 0;
+              H = (Y + 224) | 0;
+              I = (d + 16) | 0;
+              C = (e[((c[I >> 2] | 0) + 178) >> 1] | 0) > 2;
+              RJ(1);
+              xL(d);
+              kA(H, 1024, (Y + 240) | 0);
+              _P(d, 1, 102623, 195059) | 0;
+              _P(d, 1, 102627, 195059) | 0;
+              c[47146] = _P(d, 1, 141116, 195059) | 0;
+              c[47145] = _P(d, 1, 141048, 195059) | 0;
+              _P(d, 2, 102623, 195059) | 0;
+              i = a[((c[I >> 2] | 0) + 113) >> 0] | 0;
+              if (i & 16) {
+                _P(d, 1, 102633, 195059) | 0;
+                i = a[((c[I >> 2] | 0) + 113) >> 0] | 0;
+              }
+              if (i & 1) {
+                _P(d, 2, 102637, 195059) | 0;
+                i = a[((c[I >> 2] | 0) + 113) >> 0] | 0;
+              }
+              if (i & 32) {
+                _P(d, 2, 102633, 195059) | 0;
+                i = a[((c[I >> 2] | 0) + 113) >> 0] | 0;
+              }
+              if (i & 2) {
+                _P(d, 2, 102640, 195059) | 0;
+                i = a[((c[I >> 2] | 0) + 113) >> 0] | 0;
+              }
+              if (i & 4) {
+                _P(d, 2, 102648, 195059) | 0;
+                i = a[((c[I >> 2] | 0) + 113) >> 0] | 0;
+              }
+              if (!(i & 8)) {
+                v = 0;
+                w = 0;
+                x = 0;
+              } else {
+                x = _P(d, 0, 102637, 195059) | 0;
+                w = _P(d, 0, 102656, 195059) | 0;
+                v = _P(d, 0, 102663, 195059) | 0;
+              }
+              z = _P(d, 0, 102671, 195059) | 0;
+              A = (H + 4) | 0;
+              B = (H + 8) | 0;
+              u = 0;
+              i = 0;
+              y = jC(d) | 0;
+              while (1) {
+                if (!y) break;
+                t = (y + 16) | 0;
+                k = c[t >> 2] | 0;
+                o = +h[(k + 16) >> 3];
+                j = 0 == 0;
+                if (C) {
+                  if (j) m = +h[(k + 24) >> 3];
+                  else m = +h[23301] - +h[(k + 24) >> 3];
+                  q = +h[((c[(k + 132) >> 2] | 0) + 16) >> 3] * 72.0;
+                  h[J >> 3] = o;
+                  h[(J + 8) >> 3] = m;
+                  h[(J + 16) >> 3] = q;
+                  m4(G, 102674, J) | 0;
+                  nA(H, G) | 0;
+                  j = 3;
+                  while (1) {
+                    if ((j | 0) >= (e[((c[I >> 2] | 0) + 178) >> 1] | 0)) break;
+                    h[Q >> 3] = +h[((c[((c[t >> 2] | 0) + 132) >> 2] | 0) + (j << 3)) >> 3] * 72.0;
+                    m4(G, 102689, Q) | 0;
+                    nA(H, G) | 0;
+                    j = (j + 1) | 0;
+                  }
+                  j = c[A >> 2] | 0;
+                  if (j >>> 0 >= (c[B >> 2] | 0) >>> 0) {
+                    lA(H, 1) | 0;
+                    j = c[A >> 2] | 0;
+                  }
+                  a[j >> 0] = 0;
+                  s = c[H >> 2] | 0;
+                  c[A >> 2] = s;
+                  SA(y, 102623, s) | 0;
+                  s = y;
+                } else {
+                  if (j) m = +h[(k + 24) >> 3];
+                  else m = +h[23301] - +h[(k + 24) >> 3];
+                  h[X >> 3] = o;
+                  h[(X + 8) >> 3] = m;
+                  m4(G, 102695, X) | 0;
+                  SA(y, 102623, G) | 0;
+                  s = y;
+                }
+                h[K >> 3] = +h[((c[t >> 2] | 0) + 80) >> 3] * 0.013888888888888888;
+                m4(G, 102618, K) | 0;
+                KA(s, c[47145] | 0, G) | 0;
+                j = c[t >> 2] | 0;
+                h[L >> 3] = (+h[(j + 96) >> 3] + +h[(j + 88) >> 3]) * 0.013888888888888888;
+                m4(G, 102618, L) | 0;
+                KA(s, c[47146] | 0, G) | 0;
+                j = c[t >> 2] | 0;
+                k = c[(j + 108) >> 2] | 0;
+                if ((k | 0) != 0 ? (a[(k + 81) >> 0] | 0) != 0 : 0) {
+                  q = +h[(k + 64) >> 3];
+                  q = 0 == 0 ? q : +h[23301] - q;
+                  h[M >> 3] = +h[(k + 56) >> 3];
+                  h[(M + 8) >> 3] = q;
+                  m4(G, 102695, M) | 0;
+                  SA(s, 102633, G) | 0;
+                  j = c[t >> 2] | 0;
+                }
+                if (s2(c[c[(j + 8) >> 2] >> 2] | 0, 106220) | 0) {
+                  if (c[47170] | 0 ? ((hN(y) | 0) << 24) >> 24 : 0) {
+                    k = c[((c[t >> 2] | 0) + 12) >> 2] | 0;
+                    r = (k + 8) | 0;
+                    j = c[r >> 2] | 0;
+                    if ((j | 0) < 3) {
+                      j = QA(s, 102705) | 0;
+                      if (!j) j = 8;
+                      else j = q5(j) | 0;
+                      j = (j | 0) < 3 ? 8 : j;
+                    }
+                    p = (k + 44) | 0;
+                    q = 1.0 / +(j | 0);
+                    n = 0;
+                    while (1) {
+                      if ((n | 0) >= (j | 0)) break;
+                      if ((n | 0) > 0) {
+                        k = c[A >> 2] | 0;
+                        if (k >>> 0 >= (c[B >> 2] | 0) >>> 0) {
+                          lA(H, 1) | 0;
+                          k = c[A >> 2] | 0;
+                        }
+                        c[A >> 2] = k + 1;
+                        a[k >> 0] = 32;
+                      }
+                      if ((c[r >> 2] | 0) > 2) {
+                        k = c[p >> 2] | 0;
+                        if (!0) m = +h[(k + (n << 4) + 8) >> 3] * 0.013888888888888888;
+                        else m = +h[23302] - +h[(k + (n << 4) + 8) >> 3] * 0.013888888888888888;
+                        h[N >> 3] = +h[(k + (n << 4)) >> 3] * 0.013888888888888888;
+                        h[(N + 8) >> 3] = m;
+                        m4(G, 102718, N) | 0;
+                      } else {
+                        k = c[t >> 2] | 0;
+                        m = q * +(n | 0) * 6.283185307179586;
+                        o = +h[(k + 32) >> 3] * 0.5 * +E(+m);
+                        if (!0) m = +h[(k + 40) >> 3] * 0.5 * +F(+m);
+                        else m = +h[23302] - +h[(k + 40) >> 3] * 0.5 * +F(+m);
+                        h[O >> 3] = o;
+                        h[(O + 8) >> 3] = m;
+                        m4(G, 102718, O) | 0;
+                      }
+                      nA(H, G) | 0;
+                      n = (n + 1) | 0;
+                    }
+                    k = c[47170] | 0;
+                    j = c[A >> 2] | 0;
+                    if (j >>> 0 >= (c[B >> 2] | 0) >>> 0) {
+                      lA(H, 1) | 0;
+                      j = c[A >> 2] | 0;
+                    }
+                    a[j >> 0] = 0;
+                    t = c[H >> 2] | 0;
+                    c[A >> 2] = t;
+                    KA(s, k, t) | 0;
+                  }
+                } else {
+                  HL(y, c[(j + 12) >> 2] | 0, H);
+                  pA(H) | 0;
+                  j = c[A >> 2] | 0;
+                  if (j >>> 0 >= (c[B >> 2] | 0) >>> 0) {
+                    lA(H, 1) | 0;
+                    j = c[A >> 2] | 0;
+                  }
+                  a[j >> 0] = 0;
+                  t = c[H >> 2] | 0;
+                  c[A >> 2] = t;
+                  SA(s, 102627, t) | 0;
+                }
+                a: do
+                  if ((c[47138] | 0) > 0) {
+                    t = XA(d, y) | 0;
+                    j = u;
+                    while (1) {
+                      if (!t) break a;
+                      s = (t + 16) | 0;
+                      k = c[s >> 2] | 0;
+                      do
+                        if ((a[(k + 112) >> 0] | 0) != 6 ? ((D = c[(k + 8) >> 2] | 0), (D | 0) != 0) : 0) {
+                          r = 0;
+                          k = D;
+                          while (1) {
+                            if ((r | 0) >= (c[(k + 4) >> 2] | 0)) break;
+                            if ((r | 0) > 0) {
+                              k = c[A >> 2] | 0;
+                              if (k >>> 0 >= (c[B >> 2] | 0) >>> 0) {
+                                lA(H, 1) | 0;
+                                k = c[A >> 2] | 0;
+                              }
+                              c[A >> 2] = k + 1;
+                              a[k >> 0] = 59;
+                              k = c[((c[s >> 2] | 0) + 8) >> 2] | 0;
+                            }
+                            k = c[k >> 2] | 0;
+                            if (c[(k + ((r * 48) | 0) + 8) >> 2] | 0) {
+                              if (!0) m = +h[(k + ((r * 48) | 0) + 24) >> 3];
+                              else m = +h[23301] - +h[(k + ((r * 48) | 0) + 24) >> 3];
+                              h[P >> 3] = +h[(k + ((r * 48) | 0) + 16) >> 3];
+                              h[(P + 8) >> 3] = m;
+                              m4(G, 102728, P) | 0;
+                              nA(H, G) | 0;
+                              i = 1;
+                              k = c[c[((c[s >> 2] | 0) + 8) >> 2] >> 2] | 0;
+                            }
+                            if (c[(k + ((r * 48) | 0) + 12) >> 2] | 0) {
+                              if (!0) m = +h[(k + ((r * 48) | 0) + 40) >> 3];
+                              else m = +h[23301] - +h[(k + ((r * 48) | 0) + 40) >> 3];
+                              h[R >> 3] = +h[(k + ((r * 48) | 0) + 32) >> 3];
+                              h[(R + 8) >> 3] = m;
+                              m4(G, 102741, R) | 0;
+                              nA(H, G) | 0;
+                              j = 1;
+                            }
+                            p = 0;
+                            while (1) {
+                              k = c[((c[s >> 2] | 0) + 8) >> 2] | 0;
+                              n = c[k >> 2] | 0;
+                              if ((p | 0) >= (c[(n + ((r * 48) | 0) + 4) >> 2] | 0)) break;
+                              if ((p | 0) > 0) {
+                                k = c[A >> 2] | 0;
+                                if (k >>> 0 >= (c[B >> 2] | 0) >>> 0) {
+                                  lA(H, 1) | 0;
+                                  k = c[A >> 2] | 0;
+                                }
+                                c[A >> 2] = k + 1;
+                                a[k >> 0] = 32;
+                                k = c[c[((c[s >> 2] | 0) + 8) >> 2] >> 2] | 0;
+                              } else k = n;
+                              u = c[(k + ((r * 48) | 0)) >> 2] | 0;
+                              q = +h[(u + (p << 4) + 8) >> 3];
+                              q = 0 == 0 ? q : +h[23301] - q;
+                              h[S >> 3] = +h[(u + (p << 4)) >> 3];
+                              h[(S + 8) >> 3] = q;
+                              m4(G, 102695, S) | 0;
+                              nA(H, G) | 0;
+                              p = (p + 1) | 0;
+                            }
+                            r = (r + 1) | 0;
+                          }
+                          k = c[A >> 2] | 0;
+                          if (k >>> 0 >= (c[B >> 2] | 0) >>> 0) {
+                            lA(H, 1) | 0;
+                            k = c[A >> 2] | 0;
+                          }
+                          a[k >> 0] = 0;
+                          k = c[H >> 2] | 0;
+                          c[A >> 2] = k;
+                          SA(t, 102623, k) | 0;
+                          k = c[s >> 2] | 0;
+                          n = c[(k + 96) >> 2] | 0;
+                          if (n) {
+                            q = +h[(n + 64) >> 3];
+                            q = 0 == 0 ? q : +h[23301] - q;
+                            h[T >> 3] = +h[(n + 56) >> 3];
+                            h[(T + 8) >> 3] = q;
+                            m4(G, 102695, T) | 0;
+                            SA(t, 102637, G) | 0;
+                            k = c[s >> 2] | 0;
+                          }
+                          n = c[(k + 108) >> 2] | 0;
+                          do
+                            if (n) {
+                              if (!(a[(n + 81) >> 0] | 0)) break;
+                              q = +h[(n + 64) >> 3];
+                              q = 0 == 0 ? q : +h[23301] - q;
+                              h[U >> 3] = +h[(n + 56) >> 3];
+                              h[(U + 8) >> 3] = q;
+                              m4(G, 102695, U) | 0;
+                              SA(t, 102633, G) | 0;
+                              k = c[s >> 2] | 0;
+                            }
+                          while (0);
+                          n = c[(k + 100) >> 2] | 0;
+                          if (n) {
+                            q = +h[(n + 64) >> 3];
+                            q = 0 == 0 ? q : +h[23301] - q;
+                            h[V >> 3] = +h[(n + 56) >> 3];
+                            h[(V + 8) >> 3] = q;
+                            m4(G, 102695, V) | 0;
+                            SA(t, 102640, G) | 0;
+                            k = c[s >> 2] | 0;
+                          }
+                          k = c[(k + 104) >> 2] | 0;
+                          if (!k) break;
+                          q = +h[(k + 64) >> 3];
+                          q = 0 == 0 ? q : +h[23301] - q;
+                          h[W >> 3] = +h[(k + 56) >> 3];
+                          h[(W + 8) >> 3] = q;
+                          m4(G, 102695, W) | 0;
+                          SA(t, 102648, G) | 0;
+                        }
+                      while (0);
+                      t = ZA(d, t) | 0;
+                    }
+                  } else j = u;
+                while (0);
+                u = j;
+                y = kC(d, y) | 0;
+              }
+              IL(d, z, x, w, v);
+              oA(H);
+              if (b[((c[I >> 2] | 0) + 136) >> 1] & 1) UP(d);
+              c[f >> 2] = i;
+              c[g >> 2] = u;
+              RJ(0);
+              l = Y;
+              return;
+            }
+            function HL(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0.0;
+              n = l;
+              l = (l + 1056) | 0;
+              k = n;
+              j = (n + 32) | 0;
+              m = (b + 48) | 0;
+              if (!(c[m >> 2] | 0)) {
+                e = c[(a + 16) >> 2] | 0;
+                i = +h[(e + 16) >> 3];
+                if (!0) {
+                  g = +h[(e + 24) >> 3];
+                  f = g + +h[(b + 24) >> 3];
+                  g = g + +h[(b + 40) >> 3];
+                } else {
+                  g = +h[(e + 24) >> 3];
+                  f = +h[23301] - +h[(b + 24) >> 3] - g;
+                  g = +h[23301] - +h[(b + 40) >> 3] - g;
+                }
+                o = i + +h[(b + 32) >> 3];
+                h[k >> 3] = i + +h[(b + 16) >> 3];
+                h[(k + 8) >> 3] = f;
+                h[(k + 16) >> 3] = o;
+                h[(k + 24) >> 3] = g;
+                m4(j, 102779, k) | 0;
+                nA(d, j) | 0;
+              }
+              b = (b + 56) | 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (c[m >> 2] | 0)) break;
+                HL(a, c[((c[b >> 2] | 0) + (e << 2)) >> 2] | 0, d);
+                e = (e + 1) | 0;
+              }
+              l = n;
+              return;
+            }
+            function IL(b, d, e, f, g) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0.0,
+                m = 0.0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0.0;
+              s = l;
+              l = (l + 1088) | 0;
+              o = (s + 56) | 0;
+              q = (s + 48) | 0;
+              p = (s + 32) | 0;
+              j = s;
+              n = (s + 64) | 0;
+              r = (b + 16) | 0;
+              i = c[r >> 2] | 0;
+              if (!0) {
+                k = +h[(i + 24) >> 3];
+                m = +h[(i + 40) >> 3];
+              } else {
+                m = +h[23301];
+                k = m - +h[(i + 24) >> 3];
+                m = m - +h[(i + 40) >> 3];
+              }
+              t = +h[(i + 32) >> 3];
+              h[j >> 3] = +h[(i + 16) >> 3];
+              h[(j + 8) >> 3] = k;
+              h[(j + 16) >> 3] = t;
+              h[(j + 24) >> 3] = m;
+              m4(n, 102754, j) | 0;
+              KA(b, d, n) | 0;
+              i = c[((c[r >> 2] | 0) + 12) >> 2] | 0;
+              if ((i | 0) != 0 ? (a[c[i >> 2] >> 0] | 0) != 0 : 0) {
+                t = +h[(i + 64) >> 3];
+                t = 0 == 0 ? t : +h[23301] - t;
+                h[p >> 3] = +h[(i + 56) >> 3];
+                h[(p + 8) >> 3] = t;
+                m4(n, 102695, p) | 0;
+                KA(b, e, n) | 0;
+                i = c[((c[r >> 2] | 0) + 12) >> 2] | 0;
+                t = +h[(i + 32) >> 3];
+                h[q >> 3] = +h[(i + 24) >> 3] * 0.013888888888888888;
+                m4(n, 102774, q) | 0;
+                KA(b, f, n) | 0;
+                h[o >> 3] = t * 0.013888888888888888;
+                m4(n, 102774, o) | 0;
+                KA(b, g, n) | 0;
+                i = 1;
+              } else i = 1;
+              while (1) {
+                j = c[r >> 2] | 0;
+                if ((i | 0) > (c[(j + 180) >> 2] | 0)) break;
+                IL(c[((c[(j + 184) >> 2] | 0) + (i << 2)) >> 2] | 0, d, e, f, g);
+                i = (i + 1) | 0;
+              }
+              l = s;
+              return;
+            }
+            function JL(a) {
+              a = a | 0;
+              var b = 0;
+              b = l;
+              l = (l + 16) | 0;
+              GL(a, b, (b + 4) | 0);
+              l = b;
+              return;
+            }
+            function KL() {
+              return Vz(20740, c[4581] | 0) | 0;
+            }
+            function LL(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              U1(b);
+              return;
+            }
+            function ML(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              a = c[b >> 2] | 0;
+              e = c[d >> 2] | 0;
+              if ((a | 0) <= (e | 0))
+                if ((a | 0) < (e | 0)) a = -1;
+                else {
+                  b = c[(b + 4) >> 2] | 0;
+                  d = c[(d + 4) >> 2] | 0;
+                  return ((b | 0) > (d | 0) ? 1 : (((b | 0) < (d | 0)) << 31) >> 31) | 0;
+                }
+              else a = 1;
+              return a | 0;
+            }
+            function NL(a) {
+              a = a | 0;
+              Rz(a) | 0;
+              return;
+            }
+            function OL(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = l;
+              l = (l + 16) | 0;
+              e = d;
+              c[e >> 2] = c[b >> 2];
+              c[(e + 4) >> 2] = c[(b + 4) >> 2];
+              b = PL(e) | 0;
+              if ((nb[c[a >> 2] & 63](a, b, 1) | 0) != (b | 0)) U1(b);
+              l = d;
+              return;
+            }
+            function PL(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              b = JK(16) | 0;
+              e = a;
+              d = c[(e + 4) >> 2] | 0;
+              a = (b + 8) | 0;
+              c[a >> 2] = c[e >> 2];
+              c[(a + 4) >> 2] = d;
+              return b | 0;
+            }
+            function QL(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              e = l;
+              l = (l + 16) | 0;
+              f = (e + 8) | 0;
+              g = e;
+              c[g >> 2] = b;
+              c[(g + 4) >> 2] = d;
+              c[f >> 2] = c[g >> 2];
+              c[(f + 4) >> 2] = c[(g + 4) >> 2];
+              b = PL(f) | 0;
+              if ((nb[c[a >> 2] & 63](a, b, 1) | 0) != (b | 0)) U1(b);
+              l = e;
+              return;
+            }
+            function RL(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              d = l;
+              l = (l + 16) | 0;
+              e = d;
+              g = b;
+              f = c[(g + 4) >> 2] | 0;
+              b = (e + 8) | 0;
+              c[b >> 2] = c[g >> 2];
+              c[(b + 4) >> 2] = f;
+              b = ((nb[c[a >> 2] & 63](a, e, 4) | 0) != 0) & 1;
+              l = d;
+              return b | 0;
+            }
+            function SL(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = l;
+              l = (l + 16) | 0;
+              f = e;
+              c[(f + 8) >> 2] = b;
+              c[(f + 12) >> 2] = d;
+              d = ((nb[c[a >> 2] & 63](a, f, 4) | 0) != 0) & 1;
+              l = e;
+              return d | 0;
+            }
+            function TL(a) {
+              a = a | 0;
+              return Xz(a) | 0;
+            }
+            function UL(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              d = JK((Xz(a) | 0) << 3) | 0;
+              b = d;
+              a = Tz(a) | 0;
+              while (1) {
+                if (!a) break;
+                g = (a + 8) | 0;
+                f = c[(g + 4) >> 2] | 0;
+                e = b;
+                c[e >> 2] = c[g >> 2];
+                c[(e + 4) >> 2] = f;
+                b = (b + 8) | 0;
+                a = c[a >> 2] | 0;
+              }
+              return d | 0;
+            }
+            function VL() {
+              var a = 0,
+                b = 0,
+                d = 0,
+                e = 0;
+              a = KK(40) | 0;
+              b = a;
+              d = 20776;
+              e = (b + 36) | 0;
+              do {
+                c[b >> 2] = c[d >> 2];
+                b = (b + 4) | 0;
+                d = (d + 4) | 0;
+              } while ((b | 0) < (e | 0));
+              c[(a + 36) >> 2] = 0;
+              return Vz(a, c[4581] | 0) | 0;
+            }
+            function WL(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              d = (d + 36) | 0;
+              a = c[d >> 2] | 0;
+              if (!a) a = KK(20) | 0;
+              else c[d >> 2] = c[a >> 2];
+              f = (b + 8) | 0;
+              e = c[(f + 4) >> 2] | 0;
+              d = (a + 8) | 0;
+              c[d >> 2] = c[f >> 2];
+              c[(d + 4) >> 2] = e;
+              c[(a + 16) >> 2] = c[(b + 16) >> 2];
+              return a | 0;
+            }
+            function XL(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              d = (d + 36) | 0;
+              c[b >> 2] = c[d >> 2];
+              c[d >> 2] = b;
+              return;
+            }
+            function YL(a) {
+              a = a | 0;
+              nb[c[a >> 2] & 63](a, 0, 64) | 0;
+              return;
+            }
+            function ZL(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = c[(a + 4) >> 2] | 0;
+              Rz(a) | 0;
+              a = c[(b + 36) >> 2] | 0;
+              while (1) {
+                if (!a) break;
+                d = c[a >> 2] | 0;
+                U1(a);
+                a = d;
+              }
+              U1(b);
+              return;
+            }
+            function _L(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              f = l;
+              l = (l + 32) | 0;
+              g = f;
+              c[(g + 8) >> 2] = b;
+              c[(g + 12) >> 2] = d;
+              c[(g + 16) >> 2] = e;
+              e = c[((nb[c[a >> 2] & 63](a, g, 1) | 0) + 16) >> 2] | 0;
+              l = f;
+              return e | 0;
+            }
+            function $L(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0.0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0;
+              t = l;
+              l = (l + 160) | 0;
+              q = (t + 144) | 0;
+              d = (t + 48) | 0;
+              j = (t + 128) | 0;
+              k = (t + 112) | 0;
+              m = (t + 96) | 0;
+              n = (t + 80) | 0;
+              o = (t + 32) | 0;
+              p = (t + 16) | 0;
+              r = t;
+              s = (a + 16) | 0;
+              a = c[s >> 2] | 0;
+              e = +h[(a + 16) >> 3];
+              f = +h[(a + 24) >> 3];
+              g = +h[(a + 32) >> 3];
+              i = +h[(a + 40) >> 3];
+              if (((b + -1) | 0) >>> 0 < 2) {
+                aM(j, e, i);
+                c[q >> 2] = c[j >> 2];
+                c[(q + 4) >> 2] = c[(j + 4) >> 2];
+                c[(q + 8) >> 2] = c[(j + 8) >> 2];
+                c[(q + 12) >> 2] = c[(j + 12) >> 2];
+                bM(d, q);
+                p = (d + 16) | 0;
+                aM(k, g, f);
+                c[q >> 2] = c[k >> 2];
+                c[(q + 4) >> 2] = c[(k + 4) >> 2];
+                c[(q + 8) >> 2] = c[(k + 8) >> 2];
+                c[(q + 12) >> 2] = c[(k + 12) >> 2];
+                bM(m, q);
+                c[p >> 2] = c[m >> 2];
+                c[(p + 4) >> 2] = c[(m + 4) >> 2];
+                c[(p + 8) >> 2] = c[(m + 8) >> 2];
+                c[(p + 12) >> 2] = c[(m + 12) >> 2];
+              } else {
+                aM(n, e, f);
+                c[q >> 2] = c[n >> 2];
+                c[(q + 4) >> 2] = c[(n + 4) >> 2];
+                c[(q + 8) >> 2] = c[(n + 8) >> 2];
+                c[(q + 12) >> 2] = c[(n + 12) >> 2];
+                bM(d, q);
+                n = (d + 16) | 0;
+                aM(o, g, i);
+                c[q >> 2] = c[o >> 2];
+                c[(q + 4) >> 2] = c[(o + 4) >> 2];
+                c[(q + 8) >> 2] = c[(o + 8) >> 2];
+                c[(q + 12) >> 2] = c[(o + 12) >> 2];
+                bM(p, q);
+                c[n >> 2] = c[p >> 2];
+                c[(n + 4) >> 2] = c[(p + 4) >> 2];
+                c[(n + 8) >> 2] = c[(p + 8) >> 2];
+                c[(n + 12) >> 2] = c[(p + 12) >> 2];
+              }
+              a = ((c[s >> 2] | 0) + 16) | 0;
+              c[a >> 2] = c[d >> 2];
+              c[(a + 4) >> 2] = c[(d + 4) >> 2];
+              c[(a + 8) >> 2] = c[(d + 8) >> 2];
+              c[(a + 12) >> 2] = c[(d + 12) >> 2];
+              c[(a + 16) >> 2] = c[(d + 16) >> 2];
+              c[(a + 20) >> 2] = c[(d + 20) >> 2];
+              c[(a + 24) >> 2] = c[(d + 24) >> 2];
+              c[(a + 28) >> 2] = c[(d + 28) >> 2];
+              a = c[((c[s >> 2] | 0) + 12) >> 2] | 0;
+              if (!a) a = 1;
+              else {
+                a = (a + 56) | 0;
+                c[q >> 2] = c[a >> 2];
+                c[(q + 4) >> 2] = c[(a + 4) >> 2];
+                c[(q + 8) >> 2] = c[(a + 8) >> 2];
+                c[(q + 12) >> 2] = c[(a + 12) >> 2];
+                bM(r, q);
+                c[a >> 2] = c[r >> 2];
+                c[(a + 4) >> 2] = c[(r + 4) >> 2];
+                c[(a + 8) >> 2] = c[(r + 8) >> 2];
+                c[(a + 12) >> 2] = c[(r + 12) >> 2];
+                a = 1;
+              }
+              while (1) {
+                d = c[s >> 2] | 0;
+                if ((a | 0) > (c[(d + 180) >> 2] | 0)) break;
+                $L(c[((c[(d + 184) >> 2] | 0) + (a << 2)) >> 2] | 0, b);
+                a = (a + 1) | 0;
+              }
+              l = t;
+              return;
+            }
+            function aM(a, b, c) {
+              a = a | 0;
+              b = +b;
+              c = +c;
+              h[a >> 3] = b;
+              h[(a + 8) >> 3] = c;
+              return;
+            }
+            function bM(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              d = l;
+              l = (l + 32) | 0;
+              g = (d + 16) | 0;
+              e = d;
+              f = ((c[47265] | 0) * 90) | 0;
+              c[g >> 2] = c[b >> 2];
+              c[(g + 4) >> 2] = c[(b + 4) >> 2];
+              c[(g + 8) >> 2] = c[(b + 8) >> 2];
+              c[(g + 12) >> 2] = c[(b + 12) >> 2];
+              mK(e, g, f);
+              c[b >> 2] = c[e >> 2];
+              c[(b + 4) >> 2] = c[(e + 4) >> 2];
+              c[(b + 8) >> 2] = c[(e + 8) >> 2];
+              c[(b + 12) >> 2] = c[(e + 12) >> 2];
+              h[b >> 3] = +h[b >> 3] - +h[23303];
+              e = (b + 8) | 0;
+              h[e >> 3] = +h[e >> 3] - +h[23304];
+              c[a >> 2] = c[b >> 2];
+              c[(a + 4) >> 2] = c[(b + 4) >> 2];
+              c[(a + 8) >> 2] = c[(b + 8) >> 2];
+              c[(a + 12) >> 2] = c[(b + 12) >> 2];
+              l = d;
+              return;
+            }
+            function cM(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0.0,
+                m = 0,
+                n = 0.0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0;
+              w = l;
+              l = (l + 1168) | 0;
+              s = (w + 144) | 0;
+              v = (w + 96) | 0;
+              u = (w + 64) | 0;
+              t = (w + 48) | 0;
+              o = (w + 32) | 0;
+              p = (w + 16) | 0;
+              q = w;
+              c[t >> 2] = 0;
+              c[(t + 4) >> 2] = 0;
+              c[(t + 8) >> 2] = 0;
+              c[(t + 12) >> 2] = 0;
+              r = (b + 16) | 0;
+              m = c[((c[r >> 2] | 0) + 116) >> 2] | 0;
+              c[47265] = m & 3;
+              m = m & 1;
+              a[194957] = m;
+              if (!((m << 24) >> 24)) eM(b);
+              else dM(b);
+              fM(b);
+              m = c[r >> 2] | 0;
+              e = c[(m + 12) >> 2] | 0;
+              do
+                if (e | 0 ? (a[(e + 81) >> 0] | 0) == 0 : 0) {
+                  g = (e + 24) | 0;
+                  c[t >> 2] = c[g >> 2];
+                  c[(t + 4) >> 2] = c[(g + 4) >> 2];
+                  c[(t + 8) >> 2] = c[(g + 8) >> 2];
+                  c[(t + 12) >> 2] = c[(g + 12) >> 2];
+                  n = +h[t >> 3] + 16.0;
+                  h[t >> 3] = n;
+                  g = (t + 8) | 0;
+                  f = +h[g >> 3] + 8.0;
+                  h[g >> 3] = f;
+                  g = (a[(m + 275) >> 0] & 1) != 0;
+                  if (a[194957] | 0) {
+                    if (g) {
+                      i = (m + 32) | 0;
+                      h[i >> 3] = +h[i >> 3] + f;
+                    } else {
+                      i = (m + 16) | 0;
+                      h[i >> 3] = +h[i >> 3] - f;
+                    }
+                    g = (m + 40) | 0;
+                    f = +h[g >> 3];
+                    i = (m + 24) | 0;
+                    j = +h[i >> 3];
+                    k = f - j;
+                    if (!(n > k)) break;
+                    n = (n - k) * 0.5;
+                    h[i >> 3] = j - n;
+                    h[g >> 3] = f + n;
+                    break;
+                  }
+                  i = (c[47265] | 0) == 0;
+                  do
+                    if (g)
+                      if (i) {
+                        i = (m + 40) | 0;
+                        h[i >> 3] = +h[i >> 3] + f;
+                        break;
+                      } else {
+                        i = (m + 24) | 0;
+                        h[i >> 3] = +h[i >> 3] - f;
+                        break;
+                      }
+                    else if (i) {
+                      i = (m + 24) | 0;
+                      h[i >> 3] = +h[i >> 3] - f;
+                      break;
+                    } else {
+                      i = (m + 40) | 0;
+                      h[i >> 3] = +h[i >> 3] + f;
+                      break;
+                    }
+                  while (0);
+                  g = (m + 32) | 0;
+                  f = +h[g >> 3];
+                  i = (m + 16) | 0;
+                  j = +h[i >> 3];
+                  k = f - j;
+                  if (n > k) {
+                    n = (n - k) * 0.5;
+                    h[i >> 3] = j - n;
+                    h[g >> 3] = f + n;
+                  }
+                }
+              while (0);
+              if (d) {
+                switch (c[47265] | 0) {
+                  case 0: {
+                    q = (m + 16) | 0;
+                    c[46606] = c[q >> 2];
+                    c[46607] = c[(q + 4) >> 2];
+                    c[46608] = c[(q + 8) >> 2];
+                    c[46609] = c[(q + 12) >> 2];
+                    break;
+                  }
+                  case 1: {
+                    aM(o, -+h[(m + 40) >> 3], +h[(m + 16) >> 3]);
+                    c[46606] = c[o >> 2];
+                    c[46607] = c[(o + 4) >> 2];
+                    c[46608] = c[(o + 8) >> 2];
+                    c[46609] = c[(o + 12) >> 2];
+                    break;
+                  }
+                  case 2: {
+                    aM(p, +h[(m + 16) >> 3], -+h[(m + 40) >> 3]);
+                    c[46606] = c[p >> 2];
+                    c[46607] = c[(p + 4) >> 2];
+                    c[46608] = c[(p + 8) >> 2];
+                    c[46609] = c[(p + 12) >> 2];
+                    break;
+                  }
+                  case 3: {
+                    aM(q, +h[(m + 24) >> 3], +h[(m + 16) >> 3]);
+                    c[46606] = c[q >> 2];
+                    c[46607] = c[(q + 4) >> 2];
+                    c[46608] = c[(q + 8) >> 2];
+                    c[46609] = c[(q + 12) >> 2];
+                    break;
+                  }
+                  default: {
+                  }
+                }
+                gM(b);
+                e = c[((c[r >> 2] | 0) + 12) >> 2] | 0;
+              }
+              if (e | 0 ? (a[(e + 81) >> 0] | 0) == 0 : 0) {
+                c[s >> 2] = c[t >> 2];
+                c[(s + 4) >> 2] = c[(t + 4) >> 2];
+                c[(s + 8) >> 2] = c[(t + 8) >> 2];
+                c[(s + 12) >> 2] = c[(t + 12) >> 2];
+                hM(b, s);
+              }
+              if (!0) {
+                l = w;
+                return;
+              }
+              if (!(a[194957] | 0)) {
+                n = +h[23304];
+                k = +h[23303];
+                h[v >> 3] = n;
+                h[(v + 8) >> 3] = k;
+                h[(v + 16) >> 3] = n;
+                h[(v + 24) >> 3] = k;
+                h[(v + 32) >> 3] = -k;
+                h[(v + 40) >> 3] = -n;
+                m4(s, 103015, v) | 0;
+              } else {
+                k = +h[23303];
+                n = +h[23304];
+                h[u >> 3] = k;
+                h[(u + 8) >> 3] = n;
+                h[(u + 16) >> 3] = k;
+                h[(u + 24) >> 3] = n;
+                m4(s, 102800, u) | 0;
+              }
+              D4(s) | 0;
+              ab();
+            }
+            function dM(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0.0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0;
+              j = (b + 16) | 0;
+              if (
+                ((yC(b) | 0) != (b | 0) ? ((g = c[j >> 2] | 0), (i = c[(g + 12) >> 2] | 0), (i | 0) != 0) : 0)
+                  ? (a[(i + 81) >> 0] | 0) == 0
+                  : 0
+              ) {
+                d = a[(g + 275) >> 0] | 0;
+                if (!(d & 1)) {
+                  f = +h[(g + 16) >> 3] + +h[(g + 96) >> 3] * 0.5;
+                  b = (g + 104) | 0;
+                } else {
+                  f = +h[(g + 32) >> 3] - +h[(g + 64) >> 3] * 0.5;
+                  b = (g + 72) | 0;
+                }
+                e = +h[b >> 3];
+                b = (d << 24) >> 24;
+                do
+                  if (!(b & 4))
+                    if (!(b & 2)) {
+                      e = (+h[(g + 40) >> 3] + +h[(g + 24) >> 3]) * 0.5;
+                      break;
+                    } else {
+                      e = +h[(g + 40) >> 3] - e * 0.5;
+                      break;
+                    }
+                  else e = +h[(g + 24) >> 3] + e * 0.5;
+                while (0);
+                h[(i + 56) >> 3] = f;
+                h[(i + 64) >> 3] = e;
+                a[((c[((c[j >> 2] | 0) + 12) >> 2] | 0) + 81) >> 0] = 1;
+                b = 1;
+              } else b = 1;
+              while (1) {
+                d = c[j >> 2] | 0;
+                if ((b | 0) > (c[(d + 180) >> 2] | 0)) break;
+                dM(c[((c[(d + 184) >> 2] | 0) + (b << 2)) >> 2] | 0);
+                b = (b + 1) | 0;
+              }
+              return;
+            }
+            function eM(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0.0,
+                f = 0.0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = (b + 16) | 0;
+              if (
+                ((yC(b) | 0) != (b | 0) ? ((i = c[k >> 2] | 0), (j = c[(i + 12) >> 2] | 0), (j | 0) != 0) : 0)
+                  ? (a[(j + 81) >> 0] | 0) == 0
+                  : 0
+              ) {
+                d = a[(i + 275) >> 0] | 0;
+                if (!(d & 1)) {
+                  g = +h[(i + 24) >> 3] + +h[(i + 56) >> 3] * 0.5;
+                  b = (i + 48) | 0;
+                } else {
+                  g = +h[(i + 40) >> 3] - +h[(i + 88) >> 3] * 0.5;
+                  b = (i + 80) | 0;
+                }
+                f = +h[b >> 3];
+                b = (d << 24) >> 24;
+                do
+                  if (!(b & 4)) {
+                    e = +h[(i + 16) >> 3];
+                    if (!(b & 2)) {
+                      e = (+h[(i + 32) >> 3] + e) * 0.5;
+                      break;
+                    } else {
+                      e = e + f * 0.5;
+                      break;
+                    }
+                  } else e = +h[(i + 32) >> 3] - f * 0.5;
+                while (0);
+                h[(j + 56) >> 3] = e;
+                h[(j + 64) >> 3] = g;
+                a[((c[((c[k >> 2] | 0) + 12) >> 2] | 0) + 81) >> 0] = 1;
+                b = 1;
+              } else b = 1;
+              while (1) {
+                d = c[k >> 2] | 0;
+                if ((b | 0) > (c[(d + 180) >> 2] | 0)) break;
+                eM(c[((c[(d + 184) >> 2] | 0) + (b << 2)) >> 2] | 0);
+                b = (b + 1) | 0;
+              }
+              return;
+            }
+            function fM(e) {
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                O = 0,
+                P = 0,
+                Q = 0,
+                R = 0,
+                S = 0;
+              S = l;
+              l = (l + 544) | 0;
+              L = (S + 504) | 0;
+              R = (S + 416) | 0;
+              Q = (S + 376) | 0;
+              K = (S + 352) | 0;
+              J = (S + 312) | 0;
+              I = (S + 288) | 0;
+              H = (S + 248) | 0;
+              M = (S + 200) | 0;
+              B = (S + 152) | 0;
+              O = (S + 96) | 0;
+              p = (S + 488) | 0;
+              C = (S + 456) | 0;
+              D = (S + 424) | 0;
+              E = (S + 384) | 0;
+              F = (S + 360) | 0;
+              G = (S + 320) | 0;
+              w = (S + 296) | 0;
+              x = (S + 256) | 0;
+              y = (S + 232) | 0;
+              z = (S + 168) | 0;
+              A = (S + 136) | 0;
+              f = (S + 56) | 0;
+              N = (S + 16) | 0;
+              P = S;
+              o = (e + 16) | 0;
+              u = c[o >> 2] | 0;
+              g = b[(u + 136) >> 1] & 14;
+              u = d[(u + 113) >> 0] | 0;
+              if (!(((u & 54) | 0) == 0 ? (((u & 1) | 0) == 0) | ((c[47139] | 0) != 0) : 0)) {
+                u = (g << 16) >> 16 == 0;
+                n = jC(e) | 0;
+                h = 0;
+                j = 0;
+                i = 0;
+                while (1) {
+                  if (!n) break;
+                  g = c[((c[(n + 16) >> 2] | 0) + 108) >> 2] | 0;
+                  do
+                    if (g)
+                      if (!(a[(g + 81) >> 0] | 0)) {
+                        i = (i + 1) | 0;
+                        break;
+                      } else {
+                        h = (h + 1) | 0;
+                        break;
+                      }
+                  while (0);
+                  m = XA(e, n) | 0;
+                  g = j;
+                  while (1) {
+                    if (!m) break;
+                    k = c[(m + 16) >> 2] | 0;
+                    j = c[(k + 108) >> 2] | 0;
+                    do
+                      if (j) {
+                        if (a[(j + 81) >> 0] | 0) {
+                          h = (h + 1) | 0;
+                          break;
+                        }
+                        if (!u) g = (g + (((c[(k + 8) >> 2] | 0) != 0) & 1)) | 0;
+                      }
+                    while (0);
+                    j = c[(k + 100) >> 2] | 0;
+                    do
+                      if (j) {
+                        if (a[(j + 81) >> 0] | 0) {
+                          h = (h + 1) | 0;
+                          break;
+                        }
+                        if (!u) g = (g + (((c[(k + 8) >> 2] | 0) != 0) & 1)) | 0;
+                      }
+                    while (0);
+                    j = c[(k + 104) >> 2] | 0;
+                    do
+                      if (j) {
+                        if (a[(j + 81) >> 0] | 0) {
+                          h = (h + 1) | 0;
+                          break;
+                        }
+                        if (!u) g = (g + (((c[(k + 8) >> 2] | 0) != 0) & 1)) | 0;
+                      }
+                    while (0);
+                    j = c[(k + 96) >> 2] | 0;
+                    do
+                      if (j) {
+                        if (a[(j + 81) >> 0] | 0) {
+                          h = (h + 1) | 0;
+                          break;
+                        }
+                        if (!u) g = (g + (((c[(k + 8) >> 2] | 0) != 0) & 1)) | 0;
+                      }
+                    while (0);
+                    m = ZA(e, m) | 0;
+                  }
+                  n = kC(e, n) | 0;
+                  j = g;
+                }
+                if (!(a[((c[o >> 2] | 0) + 113) >> 0] & 8)) o = 0;
+                else o = jM(e) | 0;
+                t = (j + i) | 0;
+                if (t | 0) {
+                  q = (h + j + o + (tB(e) | 0)) | 0;
+                  r = JK((q * 40) | 0) | 0;
+                  s = JK((t * 40) | 0) | 0;
+                  aM(M, 2147483647.0, 2147483647.0);
+                  g = (M + 16) | 0;
+                  aM(p, -2147483647.0, -2147483647.0);
+                  c[g >> 2] = c[p >> 2];
+                  c[(g + 4) >> 2] = c[(p + 4) >> 2];
+                  c[(g + 8) >> 2] = c[(p + 8) >> 2];
+                  c[(g + 12) >> 2] = c[(p + 12) >> 2];
+                  g = s;
+                  i = r;
+                  n = jC(e) | 0;
+                  while (1) {
+                    if (!n) break;
+                    c[L >> 2] = c[M >> 2];
+                    c[(L + 4) >> 2] = c[(M + 4) >> 2];
+                    c[(L + 8) >> 2] = c[(M + 8) >> 2];
+                    c[(L + 12) >> 2] = c[(M + 12) >> 2];
+                    c[(L + 16) >> 2] = c[(M + 16) >> 2];
+                    c[(L + 20) >> 2] = c[(M + 20) >> 2];
+                    c[(L + 24) >> 2] = c[(M + 24) >> 2];
+                    c[(L + 28) >> 2] = c[(M + 28) >> 2];
+                    kM(C, n, i, L);
+                    c[M >> 2] = c[C >> 2];
+                    c[(M + 4) >> 2] = c[(C + 4) >> 2];
+                    c[(M + 8) >> 2] = c[(C + 8) >> 2];
+                    c[(M + 12) >> 2] = c[(C + 12) >> 2];
+                    c[(M + 16) >> 2] = c[(C + 16) >> 2];
+                    c[(M + 20) >> 2] = c[(C + 20) >> 2];
+                    c[(M + 24) >> 2] = c[(C + 24) >> 2];
+                    c[(M + 28) >> 2] = c[(C + 28) >> 2];
+                    h = c[((c[(n + 16) >> 2] | 0) + 108) >> 2] | 0;
+                    do
+                      if (h)
+                        if (!(a[(h + 81) >> 0] | 0)) {
+                          c[L >> 2] = c[B >> 2];
+                          c[(L + 4) >> 2] = c[(B + 4) >> 2];
+                          c[(L + 8) >> 2] = c[(B + 8) >> 2];
+                          c[(L + 12) >> 2] = c[(B + 12) >> 2];
+                          mM(h, i, g, 0, L);
+                          g = (g + 40) | 0;
+                          break;
+                        } else {
+                          i = (i + 40) | 0;
+                          c[L >> 2] = c[M >> 2];
+                          c[(L + 4) >> 2] = c[(M + 4) >> 2];
+                          c[(L + 8) >> 2] = c[(M + 8) >> 2];
+                          c[(L + 12) >> 2] = c[(M + 12) >> 2];
+                          c[(L + 16) >> 2] = c[(M + 16) >> 2];
+                          c[(L + 20) >> 2] = c[(M + 20) >> 2];
+                          c[(L + 24) >> 2] = c[(M + 24) >> 2];
+                          c[(L + 28) >> 2] = c[(M + 28) >> 2];
+                          lM(D, h, i, L);
+                          c[M >> 2] = c[D >> 2];
+                          c[(M + 4) >> 2] = c[(D + 4) >> 2];
+                          c[(M + 8) >> 2] = c[(D + 8) >> 2];
+                          c[(M + 12) >> 2] = c[(D + 12) >> 2];
+                          c[(M + 16) >> 2] = c[(D + 16) >> 2];
+                          c[(M + 20) >> 2] = c[(D + 20) >> 2];
+                          c[(M + 24) >> 2] = c[(D + 24) >> 2];
+                          c[(M + 28) >> 2] = c[(D + 28) >> 2];
+                          break;
+                        }
+                    while (0);
+                    m = XA(e, n) | 0;
+                    i = (i + 40) | 0;
+                    while (1) {
+                      if (!m) break;
+                      k = (m + 16) | 0;
+                      h = c[k >> 2] | 0;
+                      j = c[(h + 96) >> 2] | 0;
+                      a: do
+                        if (!j) v = 52;
+                        else {
+                          do
+                            if (!(a[(j + 81) >> 0] | 0)) {
+                              if (!u ? c[(h + 8) >> 2] | 0 : 0) {
+                                vO(F, e, m);
+                                c[L >> 2] = c[F >> 2];
+                                c[(L + 4) >> 2] = c[(F + 4) >> 2];
+                                c[(L + 8) >> 2] = c[(F + 8) >> 2];
+                                c[(L + 12) >> 2] = c[(F + 12) >> 2];
+                                mM(j, i, g, 1, L);
+                                g = (g + 40) | 0;
+                                break;
+                              }
+                              c[H >> 2] = c[j >> 2];
+                              gA(0, 103827, H) | 0;
+                              break a;
+                            } else {
+                              c[L >> 2] = c[M >> 2];
+                              c[(L + 4) >> 2] = c[(M + 4) >> 2];
+                              c[(L + 8) >> 2] = c[(M + 8) >> 2];
+                              c[(L + 12) >> 2] = c[(M + 12) >> 2];
+                              c[(L + 16) >> 2] = c[(M + 16) >> 2];
+                              c[(L + 20) >> 2] = c[(M + 20) >> 2];
+                              c[(L + 24) >> 2] = c[(M + 24) >> 2];
+                              c[(L + 28) >> 2] = c[(M + 28) >> 2];
+                              lM(E, j, i, L);
+                              c[M >> 2] = c[E >> 2];
+                              c[(M + 4) >> 2] = c[(E + 4) >> 2];
+                              c[(M + 8) >> 2] = c[(E + 8) >> 2];
+                              c[(M + 12) >> 2] = c[(E + 12) >> 2];
+                              c[(M + 16) >> 2] = c[(E + 16) >> 2];
+                              c[(M + 20) >> 2] = c[(E + 20) >> 2];
+                              c[(M + 24) >> 2] = c[(E + 24) >> 2];
+                              c[(M + 28) >> 2] = c[(E + 28) >> 2];
+                            }
+                          while (0);
+                          i = (i + 40) | 0;
+                          h = c[k >> 2] | 0;
+                          v = 52;
+                        }
+                      while (0);
+                      b: do
+                        if ((v | 0) == 52) {
+                          v = 0;
+                          j = c[(h + 104) >> 2] | 0;
+                          if (j) {
+                            do
+                              if (!(a[(j + 81) >> 0] | 0)) {
+                                if (!u ? c[(h + 8) >> 2] | 0 : 0) {
+                                  nM(w, m);
+                                  c[L >> 2] = c[w >> 2];
+                                  c[(L + 4) >> 2] = c[(w + 4) >> 2];
+                                  c[(L + 8) >> 2] = c[(w + 8) >> 2];
+                                  c[(L + 12) >> 2] = c[(w + 12) >> 2];
+                                  mM(j, i, g, 1, L);
+                                  g = (g + 40) | 0;
+                                  break;
+                                }
+                                c[I >> 2] = c[j >> 2];
+                                gA(0, 103862, I) | 0;
+                                break b;
+                              } else {
+                                c[L >> 2] = c[M >> 2];
+                                c[(L + 4) >> 2] = c[(M + 4) >> 2];
+                                c[(L + 8) >> 2] = c[(M + 8) >> 2];
+                                c[(L + 12) >> 2] = c[(M + 12) >> 2];
+                                c[(L + 16) >> 2] = c[(M + 16) >> 2];
+                                c[(L + 20) >> 2] = c[(M + 20) >> 2];
+                                c[(L + 24) >> 2] = c[(M + 24) >> 2];
+                                c[(L + 28) >> 2] = c[(M + 28) >> 2];
+                                lM(G, j, i, L);
+                                c[M >> 2] = c[G >> 2];
+                                c[(M + 4) >> 2] = c[(G + 4) >> 2];
+                                c[(M + 8) >> 2] = c[(G + 8) >> 2];
+                                c[(M + 12) >> 2] = c[(G + 12) >> 2];
+                                c[(M + 16) >> 2] = c[(G + 16) >> 2];
+                                c[(M + 20) >> 2] = c[(G + 20) >> 2];
+                                c[(M + 24) >> 2] = c[(G + 24) >> 2];
+                                c[(M + 28) >> 2] = c[(G + 28) >> 2];
+                              }
+                            while (0);
+                            i = (i + 40) | 0;
+                            h = c[k >> 2] | 0;
+                          }
+                          j = c[(h + 100) >> 2] | 0;
+                          if (j) {
+                            do
+                              if (!(a[(j + 81) >> 0] | 0)) {
+                                if (!u ? c[(h + 8) >> 2] | 0 : 0) {
+                                  oM(y, m);
+                                  c[L >> 2] = c[y >> 2];
+                                  c[(L + 4) >> 2] = c[(y + 4) >> 2];
+                                  c[(L + 8) >> 2] = c[(y + 8) >> 2];
+                                  c[(L + 12) >> 2] = c[(y + 12) >> 2];
+                                  mM(j, i, g, 1, L);
+                                  g = (g + 40) | 0;
+                                  break;
+                                }
+                                c[J >> 2] = c[j >> 2];
+                                gA(0, 103902, J) | 0;
+                                break b;
+                              } else {
+                                c[L >> 2] = c[M >> 2];
+                                c[(L + 4) >> 2] = c[(M + 4) >> 2];
+                                c[(L + 8) >> 2] = c[(M + 8) >> 2];
+                                c[(L + 12) >> 2] = c[(M + 12) >> 2];
+                                c[(L + 16) >> 2] = c[(M + 16) >> 2];
+                                c[(L + 20) >> 2] = c[(M + 20) >> 2];
+                                c[(L + 24) >> 2] = c[(M + 24) >> 2];
+                                c[(L + 28) >> 2] = c[(M + 28) >> 2];
+                                lM(x, j, i, L);
+                                c[M >> 2] = c[x >> 2];
+                                c[(M + 4) >> 2] = c[(x + 4) >> 2];
+                                c[(M + 8) >> 2] = c[(x + 8) >> 2];
+                                c[(M + 12) >> 2] = c[(x + 12) >> 2];
+                                c[(M + 16) >> 2] = c[(x + 16) >> 2];
+                                c[(M + 20) >> 2] = c[(x + 20) >> 2];
+                                c[(M + 24) >> 2] = c[(x + 24) >> 2];
+                                c[(M + 28) >> 2] = c[(x + 28) >> 2];
+                              }
+                            while (0);
+                            i = (i + 40) | 0;
+                            h = c[k >> 2] | 0;
+                          }
+                          j = c[(h + 108) >> 2] | 0;
+                          if (j) {
+                            do
+                              if (!(a[(j + 81) >> 0] | 0)) {
+                                if (!u ? c[(h + 8) >> 2] | 0 : 0) {
+                                  vO(A, e, m);
+                                  c[L >> 2] = c[A >> 2];
+                                  c[(L + 4) >> 2] = c[(A + 4) >> 2];
+                                  c[(L + 8) >> 2] = c[(A + 8) >> 2];
+                                  c[(L + 12) >> 2] = c[(A + 12) >> 2];
+                                  mM(j, i, g, 1, L);
+                                  g = (g + 40) | 0;
+                                  break;
+                                }
+                                c[K >> 2] = c[j >> 2];
+                                gA(0, 103942, K) | 0;
+                                break b;
+                              } else {
+                                c[L >> 2] = c[M >> 2];
+                                c[(L + 4) >> 2] = c[(M + 4) >> 2];
+                                c[(L + 8) >> 2] = c[(M + 8) >> 2];
+                                c[(L + 12) >> 2] = c[(M + 12) >> 2];
+                                c[(L + 16) >> 2] = c[(M + 16) >> 2];
+                                c[(L + 20) >> 2] = c[(M + 20) >> 2];
+                                c[(L + 24) >> 2] = c[(M + 24) >> 2];
+                                c[(L + 28) >> 2] = c[(M + 28) >> 2];
+                                lM(z, j, i, L);
+                                c[M >> 2] = c[z >> 2];
+                                c[(M + 4) >> 2] = c[(z + 4) >> 2];
+                                c[(M + 8) >> 2] = c[(z + 8) >> 2];
+                                c[(M + 12) >> 2] = c[(z + 12) >> 2];
+                                c[(M + 16) >> 2] = c[(z + 16) >> 2];
+                                c[(M + 20) >> 2] = c[(z + 20) >> 2];
+                                c[(M + 24) >> 2] = c[(z + 24) >> 2];
+                                c[(M + 28) >> 2] = c[(z + 28) >> 2];
+                              }
+                            while (0);
+                            i = (i + 40) | 0;
+                          }
+                        }
+                      while (0);
+                      m = ZA(e, m) | 0;
+                    }
+                    n = kC(e, n) | 0;
+                  }
+                  if (o | 0) {
+                    c[f >> 2] = c[M >> 2];
+                    c[(f + 4) >> 2] = c[(M + 4) >> 2];
+                    c[(f + 8) >> 2] = c[(M + 8) >> 2];
+                    c[(f + 12) >> 2] = c[(M + 12) >> 2];
+                    c[(f + 16) >> 2] = c[(M + 16) >> 2];
+                    c[(f + 20) >> 2] = c[(M + 20) >> 2];
+                    c[(f + 24) >> 2] = c[(M + 24) >> 2];
+                    c[(f + 28) >> 2] = c[(M + 28) >> 2];
+                    c[(f + 32) >> 2] = i;
+                    h = L;
+                    g = (h + 40) | 0;
+                    do {
+                      c[h >> 2] = c[f >> 2];
+                      h = (h + 4) | 0;
+                      f = (f + 4) | 0;
+                    } while ((h | 0) < (g | 0));
+                    pM(N, e, L);
+                    c[M >> 2] = c[N >> 2];
+                    c[(M + 4) >> 2] = c[(N + 4) >> 2];
+                    c[(M + 8) >> 2] = c[(N + 8) >> 2];
+                    c[(M + 12) >> 2] = c[(N + 12) >> 2];
+                    c[(M + 16) >> 2] = c[(N + 16) >> 2];
+                    c[(M + 20) >> 2] = c[(N + 20) >> 2];
+                    c[(M + 24) >> 2] = c[(N + 24) >> 2];
+                    c[(M + 28) >> 2] = c[(N + 28) >> 2];
+                  }
+                  a[(O + 32) >> 0] = cP(e, GA(e, 0, 103978, 0) | 0, 1) | 0;
+                  c[O >> 2] = c[M >> 2];
+                  c[(O + 4) >> 2] = c[(M + 4) >> 2];
+                  c[(O + 8) >> 2] = c[(M + 8) >> 2];
+                  c[(O + 12) >> 2] = c[(M + 12) >> 2];
+                  c[(O + 16) >> 2] = c[(M + 16) >> 2];
+                  c[(O + 20) >> 2] = c[(M + 20) >> 2];
+                  c[(O + 24) >> 2] = c[(M + 24) >> 2];
+                  c[(O + 28) >> 2] = c[(M + 28) >> 2];
+                  hT(r, q, s, t, O) | 0;
+                  if (0) qM(r, q, s, t, O);
+                  f = 0;
+                  g = 0;
+                  h = s;
+                  while (1) {
+                    if ((g | 0) >= (t | 0)) break;
+                    if (a[(h + 36) >> 0] | 0) {
+                      O = c[(h + 32) >> 2] | 0;
+                      a[(O + 81) >> 0] = 1;
+                      N = (O + 56) | 0;
+                      rM(P, h);
+                      c[N >> 2] = c[P >> 2];
+                      c[(N + 4) >> 2] = c[(P + 4) >> 2];
+                      c[(N + 8) >> 2] = c[(P + 8) >> 2];
+                      c[(N + 12) >> 2] = c[(P + 12) >> 2];
+                      zP(e, O);
+                      f = (f + 1) | 0;
+                    }
+                    g = (g + 1) | 0;
+                    h = (h + 40) | 0;
+                  }
+                  if (!0) {
+                    if ((f | 0) != (t | 0)) {
+                      c[R >> 2] = f;
+                      c[(R + 4) >> 2] = t;
+                      gA(0, 104023, R) | 0;
+                    }
+                  } else {
+                    R = c[15712] | 0;
+                    c[Q >> 2] = f;
+                    c[(Q + 4) >> 2] = t;
+                    w4(R, 103990, Q) | 0;
+                  }
+                  U1(r);
+                  U1(s);
+                }
+              }
+              l = S;
+              return;
+            }
+            function gM(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0;
+              i = l;
+              l = (l + 48) | 0;
+              e = (i + 32) | 0;
+              f = (i + 16) | 0;
+              g = i;
+              if ((+h[23303] != 0.0) | (+h[23304] != 0.0) | ((c[47265] | 0) != 0)) {
+                d = jC(a) | 0;
+                while (1) {
+                  if (!d) break;
+                  if (c[47265] | 0) qQ(d, 0);
+                  b = (d + 16) | 0;
+                  j = ((c[b >> 2] | 0) + 16) | 0;
+                  c[e >> 2] = c[j >> 2];
+                  c[(e + 4) >> 2] = c[(j + 4) >> 2];
+                  c[(e + 8) >> 2] = c[(j + 8) >> 2];
+                  c[(e + 12) >> 2] = c[(j + 12) >> 2];
+                  bM(f, e);
+                  c[j >> 2] = c[f >> 2];
+                  c[(j + 4) >> 2] = c[(f + 4) >> 2];
+                  c[(j + 8) >> 2] = c[(f + 8) >> 2];
+                  c[(j + 12) >> 2] = c[(f + 12) >> 2];
+                  b = c[((c[b >> 2] | 0) + 108) >> 2] | 0;
+                  if (b | 0) {
+                    j = (b + 56) | 0;
+                    c[e >> 2] = c[j >> 2];
+                    c[(e + 4) >> 2] = c[(j + 4) >> 2];
+                    c[(e + 8) >> 2] = c[(j + 8) >> 2];
+                    c[(e + 12) >> 2] = c[(j + 12) >> 2];
+                    bM(g, e);
+                    c[j >> 2] = c[g >> 2];
+                    c[(j + 4) >> 2] = c[(g + 4) >> 2];
+                    c[(j + 8) >> 2] = c[(g + 8) >> 2];
+                    c[(j + 12) >> 2] = c[(g + 12) >> 2];
+                  }
+                  a: do
+                    if ((c[47138] | 0) == 1) {
+                      b = XA(a, d) | 0;
+                      while (1) {
+                        if (!b) break a;
+                        iM(b);
+                        b = ZA(a, b) | 0;
+                      }
+                    }
+                  while (0);
+                  d = kC(a, d) | 0;
+                }
+                $L(a, c[((c[(a + 16) >> 2] | 0) + 116) >> 2] & 3);
+              }
+              l = i;
+              return;
+            }
+            function hM(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0;
+              i = (b + 16) | 0;
+              j = c[i >> 2] | 0;
+              g = a[(j + 275) >> 0] | 0;
+              b = (g << 24) >> 24;
+              do
+                if (!(b & 4)) {
+                  e = +h[(j + 16) >> 3];
+                  if (!(b & 2)) {
+                    f = (+h[(j + 32) >> 3] + e) * 0.5;
+                    break;
+                  } else {
+                    f = +h[d >> 3] * 0.5 + e;
+                    break;
+                  }
+                } else f = +h[(j + 32) >> 3] - +h[d >> 3] * 0.5;
+              while (0);
+              if (!(g & 1)) e = +h[(d + 8) >> 3] * 0.5 + +h[(j + 24) >> 3];
+              else e = +h[(j + 40) >> 3] - +h[(d + 8) >> 3] * 0.5;
+              j = c[(j + 12) >> 2] | 0;
+              h[(j + 56) >> 3] = f;
+              h[(j + 64) >> 3] = e;
+              a[((c[((c[i >> 2] | 0) + 12) >> 2] | 0) + 81) >> 0] = 1;
+              return;
+            }
+            function iM(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0;
+              s = l;
+              l = (l + 144) | 0;
+              q = (s + 120) | 0;
+              e = (s + 16) | 0;
+              i = (s + 104) | 0;
+              j = (s + 88) | 0;
+              k = (s + 72) | 0;
+              m = (s + 56) | 0;
+              n = (s + 40) | 0;
+              o = (s + 24) | 0;
+              r = s;
+              p = (b + 16) | 0;
+              d = c[p >> 2] | 0;
+              f = c[(d + 8) >> 2] | 0;
+              if (!f) {
+                if ((a[194954] | 0) == 0 ? (a[(d + 112) >> 0] | 0) != 6 : 0) {
+                  q = KB(c[((((c[b >> 2] & 3) | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0) | 0;
+                  r = KB(c[((((c[b >> 2] & 3) | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0) | 0;
+                  c[e >> 2] = q;
+                  c[(e + 4) >> 2] = r;
+                  gA(1, 103810, e) | 0;
+                }
+              } else {
+                h = 0;
+                b = f;
+                while (1) {
+                  if ((h | 0) >= (c[(b + 4) >> 2] | 0)) break;
+                  g = c[b >> 2] | 0;
+                  b = c[(g + ((h * 48) | 0)) >> 2] | 0;
+                  e = c[(g + ((h * 48) | 0) + 4) >> 2] | 0;
+                  f = c[(g + ((h * 48) | 0) + 8) >> 2] | 0;
+                  g = c[(g + ((h * 48) | 0) + 12) >> 2] | 0;
+                  d = 0;
+                  while (1) {
+                    if ((d | 0) >= (e | 0)) break;
+                    t = (b + (d << 4)) | 0;
+                    c[q >> 2] = c[t >> 2];
+                    c[(q + 4) >> 2] = c[(t + 4) >> 2];
+                    c[(q + 8) >> 2] = c[(t + 8) >> 2];
+                    c[(q + 12) >> 2] = c[(t + 12) >> 2];
+                    bM(i, q);
+                    c[t >> 2] = c[i >> 2];
+                    c[(t + 4) >> 2] = c[(i + 4) >> 2];
+                    c[(t + 8) >> 2] = c[(i + 8) >> 2];
+                    c[(t + 12) >> 2] = c[(i + 12) >> 2];
+                    d = (d + 1) | 0;
+                  }
+                  if (f | 0) {
+                    t = ((c[c[((c[p >> 2] | 0) + 8) >> 2] >> 2] | 0) + ((h * 48) | 0) + 16) | 0;
+                    c[q >> 2] = c[t >> 2];
+                    c[(q + 4) >> 2] = c[(t + 4) >> 2];
+                    c[(q + 8) >> 2] = c[(t + 8) >> 2];
+                    c[(q + 12) >> 2] = c[(t + 12) >> 2];
+                    bM(j, q);
+                    c[t >> 2] = c[j >> 2];
+                    c[(t + 4) >> 2] = c[(j + 4) >> 2];
+                    c[(t + 8) >> 2] = c[(j + 8) >> 2];
+                    c[(t + 12) >> 2] = c[(j + 12) >> 2];
+                  }
+                  if (g | 0) {
+                    t = ((c[c[((c[p >> 2] | 0) + 8) >> 2] >> 2] | 0) + ((h * 48) | 0) + 32) | 0;
+                    c[q >> 2] = c[t >> 2];
+                    c[(q + 4) >> 2] = c[(t + 4) >> 2];
+                    c[(q + 8) >> 2] = c[(t + 8) >> 2];
+                    c[(q + 12) >> 2] = c[(t + 12) >> 2];
+                    bM(k, q);
+                    c[t >> 2] = c[k >> 2];
+                    c[(t + 4) >> 2] = c[(k + 4) >> 2];
+                    c[(t + 8) >> 2] = c[(k + 8) >> 2];
+                    c[(t + 12) >> 2] = c[(k + 12) >> 2];
+                  }
+                  d = c[p >> 2] | 0;
+                  h = (h + 1) | 0;
+                  b = c[(d + 8) >> 2] | 0;
+                }
+                b = c[(d + 96) >> 2] | 0;
+                if (b) {
+                  d = (b + 56) | 0;
+                  c[q >> 2] = c[d >> 2];
+                  c[(q + 4) >> 2] = c[(d + 4) >> 2];
+                  c[(q + 8) >> 2] = c[(d + 8) >> 2];
+                  c[(q + 12) >> 2] = c[(d + 12) >> 2];
+                  bM(m, q);
+                  c[d >> 2] = c[m >> 2];
+                  c[(d + 4) >> 2] = c[(m + 4) >> 2];
+                  c[(d + 8) >> 2] = c[(m + 8) >> 2];
+                  c[(d + 12) >> 2] = c[(m + 12) >> 2];
+                  d = c[p >> 2] | 0;
+                }
+                b = c[(d + 108) >> 2] | 0;
+                if (b) {
+                  d = (b + 56) | 0;
+                  c[q >> 2] = c[d >> 2];
+                  c[(q + 4) >> 2] = c[(d + 4) >> 2];
+                  c[(q + 8) >> 2] = c[(d + 8) >> 2];
+                  c[(q + 12) >> 2] = c[(d + 12) >> 2];
+                  bM(n, q);
+                  c[d >> 2] = c[n >> 2];
+                  c[(d + 4) >> 2] = c[(n + 4) >> 2];
+                  c[(d + 8) >> 2] = c[(n + 8) >> 2];
+                  c[(d + 12) >> 2] = c[(n + 12) >> 2];
+                  d = c[p >> 2] | 0;
+                }
+                b = c[(d + 100) >> 2] | 0;
+                if (b) {
+                  d = (b + 56) | 0;
+                  c[q >> 2] = c[d >> 2];
+                  c[(q + 4) >> 2] = c[(d + 4) >> 2];
+                  c[(q + 8) >> 2] = c[(d + 8) >> 2];
+                  c[(q + 12) >> 2] = c[(d + 12) >> 2];
+                  bM(o, q);
+                  c[d >> 2] = c[o >> 2];
+                  c[(d + 4) >> 2] = c[(o + 4) >> 2];
+                  c[(d + 8) >> 2] = c[(o + 8) >> 2];
+                  c[(d + 12) >> 2] = c[(o + 12) >> 2];
+                  d = c[p >> 2] | 0;
+                }
+                d = c[(d + 104) >> 2] | 0;
+                if (d | 0) {
+                  t = (d + 56) | 0;
+                  c[q >> 2] = c[t >> 2];
+                  c[(q + 4) >> 2] = c[(t + 4) >> 2];
+                  c[(q + 8) >> 2] = c[(t + 8) >> 2];
+                  c[(q + 12) >> 2] = c[(t + 12) >> 2];
+                  bM(r, q);
+                  c[t >> 2] = c[r >> 2];
+                  c[(t + 4) >> 2] = c[(r + 4) >> 2];
+                  c[(t + 8) >> 2] = c[(r + 8) >> 2];
+                  c[(t + 12) >> 2] = c[(r + 12) >> 2];
+                }
+              }
+              l = s;
+              return;
+            }
+            function jM(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              f = (b + 16) | 0;
+              if ((yC(b) | 0) != (b | 0) ? ((d = c[((c[f >> 2] | 0) + 12) >> 2] | 0), (d | 0) != 0) : 0) {
+                e = 1;
+                b = ((a[(d + 81) >> 0] | 0) != 0) & 1;
+              } else {
+                e = 1;
+                b = 0;
+              }
+              while (1) {
+                d = c[f >> 2] | 0;
+                if ((e | 0) > (c[(d + 180) >> 2] | 0)) break;
+                d = ((jM(c[((c[(d + 184) >> 2] | 0) + (e << 2)) >> 2] | 0) | 0) + b) | 0;
+                e = (e + 1) | 0;
+                b = d;
+              }
+              return b | 0;
+            }
+            function kM(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0.0,
+                m = 0,
+                n = 0;
+              g = l;
+              l = (l + 32) | 0;
+              i = g;
+              n = (a[194957] | 0) == 0;
+              d = (d + 16) | 0;
+              m = c[d >> 2] | 0;
+              k = +h[(n ? (m + 32) | 0 : (m + 40) | 0) >> 3];
+              h[(e + 16) >> 3] = k * 72.0;
+              j = +h[(n ? (m + 40) | 0 : (m + 32) | 0) >> 3];
+              h[(e + 24) >> 3] = j * 72.0;
+              d = ((c[d >> 2] | 0) + 16) | 0;
+              c[e >> 2] = c[d >> 2];
+              c[(e + 4) >> 2] = c[(d + 4) >> 2];
+              c[(e + 8) >> 2] = c[(d + 8) >> 2];
+              c[(e + 12) >> 2] = c[(d + 12) >> 2];
+              h[e >> 3] = +h[e >> 3] - k * 36.0;
+              d = (e + 8) | 0;
+              h[d >> 3] = +h[d >> 3] - j * 36.0;
+              c[i >> 2] = c[f >> 2];
+              c[(i + 4) >> 2] = c[(f + 4) >> 2];
+              c[(i + 8) >> 2] = c[(f + 8) >> 2];
+              c[(i + 12) >> 2] = c[(f + 12) >> 2];
+              c[(i + 16) >> 2] = c[(f + 16) >> 2];
+              c[(i + 20) >> 2] = c[(f + 20) >> 2];
+              c[(i + 24) >> 2] = c[(f + 24) >> 2];
+              c[(i + 28) >> 2] = c[(f + 28) >> 2];
+              sM(b, e, i);
+              l = g;
+              return;
+            }
+            function lM(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0.0,
+                m = 0,
+                n = 0;
+              g = l;
+              l = (l + 32) | 0;
+              i = g;
+              n = (a[194957] | 0) == 0;
+              m = (d + 24) | 0;
+              k = +h[(n ? m : (d + 32) | 0) >> 3];
+              h[(e + 16) >> 3] = k;
+              j = +h[(n ? (d + 32) | 0 : m) >> 3];
+              h[(e + 24) >> 3] = j;
+              d = (d + 56) | 0;
+              c[e >> 2] = c[d >> 2];
+              c[(e + 4) >> 2] = c[(d + 4) >> 2];
+              c[(e + 8) >> 2] = c[(d + 8) >> 2];
+              c[(e + 12) >> 2] = c[(d + 12) >> 2];
+              h[e >> 3] = +h[e >> 3] - k * 0.5;
+              d = (e + 8) | 0;
+              h[d >> 3] = +h[d >> 3] - j * 0.5;
+              c[i >> 2] = c[f >> 2];
+              c[(i + 4) >> 2] = c[(f + 4) >> 2];
+              c[(i + 8) >> 2] = c[(f + 8) >> 2];
+              c[(i + 12) >> 2] = c[(f + 12) >> 2];
+              c[(i + 16) >> 2] = c[(f + 16) >> 2];
+              c[(i + 20) >> 2] = c[(f + 20) >> 2];
+              c[(i + 24) >> 2] = c[(f + 24) >> 2];
+              c[(i + 28) >> 2] = c[(f + 28) >> 2];
+              sM(b, e, i);
+              l = g;
+              return;
+            }
+            function mM(b, d, e, f, g) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              if (f | 0) {
+                f = (d + 16) | 0;
+                c[f >> 2] = 0;
+                c[(f + 4) >> 2] = 0;
+                c[(f + 8) >> 2] = 0;
+                c[(f + 12) >> 2] = 0;
+                c[d >> 2] = c[g >> 2];
+                c[(d + 4) >> 2] = c[(g + 4) >> 2];
+                c[(d + 8) >> 2] = c[(g + 8) >> 2];
+                c[(d + 12) >> 2] = c[(g + 12) >> 2];
+              }
+              if (!(a[194957] | 0)) {
+                g = (b + 24) | 0;
+                c[e >> 2] = c[g >> 2];
+                c[(e + 4) >> 2] = c[(g + 4) >> 2];
+                c[(e + 8) >> 2] = c[(g + 8) >> 2];
+                c[(e + 12) >> 2] = c[(g + 12) >> 2];
+              } else {
+                h[e >> 3] = +h[(b + 32) >> 3];
+                h[(e + 8) >> 3] = +h[(b + 24) >> 3];
+              }
+              c[(e + 32) >> 2] = b;
+              a[(e + 36) >> 0] = 0;
+              c[(d + 32) >> 2] = e;
+              return;
+            }
+            function nM(a, b) {
+              a = a | 0;
+              b = b | 0;
+              b = uO(b) | 0;
+              do
+                if (b) {
+                  b = c[b >> 2] | 0;
+                  if (!(c[(b + 8) >> 2] | 0)) {
+                    b = c[b >> 2] | 0;
+                    c[a >> 2] = c[b >> 2];
+                    c[(a + 4) >> 2] = c[(b + 4) >> 2];
+                    c[(a + 8) >> 2] = c[(b + 8) >> 2];
+                    c[(a + 12) >> 2] = c[(b + 12) >> 2];
+                    break;
+                  } else {
+                    b = (b + 16) | 0;
+                    c[a >> 2] = c[b >> 2];
+                    c[(a + 4) >> 2] = c[(b + 4) >> 2];
+                    c[(a + 8) >> 2] = c[(b + 8) >> 2];
+                    c[(a + 12) >> 2] = c[(b + 12) >> 2];
+                    break;
+                  }
+                } else {
+                  c[a >> 2] = 0;
+                  c[(a + 4) >> 2] = 0;
+                  c[(a + 8) >> 2] = 0;
+                  c[(a + 12) >> 2] = 0;
+                }
+              while (0);
+              return;
+            }
+            function oM(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              b = uO(b) | 0;
+              do
+                if (b) {
+                  d = c[b >> 2] | 0;
+                  b = ((c[(b + 4) >> 2] | 0) + -1) | 0;
+                  if (!(c[(d + ((b * 48) | 0) + 12) >> 2] | 0)) {
+                    d = ((c[(d + ((b * 48) | 0)) >> 2] | 0) + (((c[(d + ((b * 48) | 0) + 4) >> 2] | 0) + -1) << 4)) | 0;
+                    c[a >> 2] = c[d >> 2];
+                    c[(a + 4) >> 2] = c[(d + 4) >> 2];
+                    c[(a + 8) >> 2] = c[(d + 8) >> 2];
+                    c[(a + 12) >> 2] = c[(d + 12) >> 2];
+                    break;
+                  } else {
+                    d = (d + ((b * 48) | 0) + 32) | 0;
+                    c[a >> 2] = c[d >> 2];
+                    c[(a + 4) >> 2] = c[(d + 4) >> 2];
+                    c[(a + 8) >> 2] = c[(d + 8) >> 2];
+                    c[(a + 12) >> 2] = c[(d + 12) >> 2];
+                    break;
+                  }
+                } else {
+                  c[a >> 2] = 0;
+                  c[(a + 4) >> 2] = 0;
+                  c[(a + 8) >> 2] = 0;
+                  c[(a + 12) >> 2] = 0;
+                }
+              while (0);
+              return;
+            }
+            function pM(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              q = l;
+              l = (l + 112) | 0;
+              k = (q + 72) | 0;
+              n = (q + 32) | 0;
+              o = q;
+              p = (d + 16) | 0;
+              j = 1;
+              while (1) {
+                f = c[p >> 2] | 0;
+                if ((j | 0) > (c[(f + 180) >> 2] | 0)) break;
+                f = c[((c[(f + 184) >> 2] | 0) + (j << 2)) >> 2] | 0;
+                g = k;
+                h = e;
+                i = (g + 40) | 0;
+                do {
+                  c[g >> 2] = c[h >> 2];
+                  g = (g + 4) | 0;
+                  h = (h + 4) | 0;
+                } while ((g | 0) < (i | 0));
+                pM(n, f, k);
+                g = e;
+                h = n;
+                i = (g + 40) | 0;
+                do {
+                  c[g >> 2] = c[h >> 2];
+                  g = (g + 4) | 0;
+                  h = (h + 4) | 0;
+                } while ((g | 0) < (i | 0));
+                j = (j + 1) | 0;
+              }
+              if (
+                ((yC(d) | 0) != (d | 0) ? ((m = c[((c[p >> 2] | 0) + 12) >> 2] | 0), m | 0) : 0)
+                  ? a[(m + 81) >> 0] | 0
+                  : 0
+              ) {
+                p = (e + 32) | 0;
+                n = c[p >> 2] | 0;
+                c[k >> 2] = c[e >> 2];
+                c[(k + 4) >> 2] = c[(e + 4) >> 2];
+                c[(k + 8) >> 2] = c[(e + 8) >> 2];
+                c[(k + 12) >> 2] = c[(e + 12) >> 2];
+                c[(k + 16) >> 2] = c[(e + 16) >> 2];
+                c[(k + 20) >> 2] = c[(e + 20) >> 2];
+                c[(k + 24) >> 2] = c[(e + 24) >> 2];
+                c[(k + 28) >> 2] = c[(e + 28) >> 2];
+                lM(o, m, n, k);
+                c[e >> 2] = c[o >> 2];
+                c[(e + 4) >> 2] = c[(o + 4) >> 2];
+                c[(e + 8) >> 2] = c[(o + 8) >> 2];
+                c[(e + 12) >> 2] = c[(o + 12) >> 2];
+                c[(e + 16) >> 2] = c[(o + 16) >> 2];
+                c[(e + 20) >> 2] = c[(o + 20) >> 2];
+                c[(e + 24) >> 2] = c[(o + 24) >> 2];
+                c[(e + 28) >> 2] = c[(o + 28) >> 2];
+                c[p >> 2] = (c[p >> 2] | 0) + 40;
+              }
+              g = b;
+              h = e;
+              i = (g + 40) | 0;
+              do {
+                c[g >> 2] = c[h >> 2];
+                g = (g + 4) | 0;
+                h = (h + 4) | 0;
+              } while ((g | 0) < (i | 0));
+              l = q;
+              return;
+            }
+            function qM(a, b, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                m = 0.0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0;
+              s = l;
+              l = (l + 160) | 0;
+              r = (s + 96) | 0;
+              p = (s + 48) | 0;
+              o = s;
+              q = c[15712] | 0;
+              n = d[(g + 32) >> 0] | 0;
+              i = +h[g >> 3];
+              j = +h[(g + 8) >> 3];
+              k = +h[(g + 16) >> 3];
+              m = +h[(g + 24) >> 3];
+              c[o >> 2] = b;
+              c[(o + 4) >> 2] = f;
+              c[(o + 8) >> 2] = n;
+              h[(o + 16) >> 3] = i;
+              h[(o + 24) >> 3] = j;
+              h[(o + 32) >> 3] = k;
+              h[(o + 40) >> 3] = m;
+              w4(q, 104065, o) | 0;
+              a: do
+                if (0 >= 2) {
+                  U4(104125, 8, 1, q) | 0;
+                  o = 0;
+                  while (1) {
+                    if ((o | 0) >= (b | 0)) break;
+                    g = c[(a + 32) >> 2] | 0;
+                    i = +h[a >> 3];
+                    j = +h[(a + 8) >> 3];
+                    k = +h[(a + 16) >> 3];
+                    m = +h[(a + 24) >> 3];
+                    if (!g) n = 195059;
+                    else n = c[c[(g + 32) >> 2] >> 2] | 0;
+                    c[p >> 2] = o;
+                    h[(p + 8) >> 3] = i;
+                    h[(p + 16) >> 3] = j;
+                    h[(p + 24) >> 3] = k;
+                    h[(p + 32) >> 3] = m;
+                    c[(p + 40) >> 2] = g;
+                    c[(p + 44) >> 2] = n;
+                    w4(q, 104134, p) | 0;
+                    o = (o + 1) | 0;
+                    a = (a + 40) | 0;
+                  }
+                  U4(104177, 8, 1, q) | 0;
+                  g = 0;
+                  while (1) {
+                    if ((g | 0) >= (f | 0)) break a;
+                    b = d[(e + 36) >> 0] | 0;
+                    i = +h[(e + 16) >> 3];
+                    j = +h[(e + 24) >> 3];
+                    k = +h[e >> 3];
+                    m = +h[(e + 8) >> 3];
+                    p = c[c[(e + 32) >> 2] >> 2] | 0;
+                    c[r >> 2] = g;
+                    c[(r + 4) >> 2] = e;
+                    c[(r + 8) >> 2] = b;
+                    h[(r + 16) >> 3] = i;
+                    h[(r + 24) >> 3] = j;
+                    h[(r + 32) >> 3] = k;
+                    h[(r + 40) >> 3] = m;
+                    c[(r + 48) >> 2] = p;
+                    w4(q, 104186, r) | 0;
+                    e = (e + 40) | 0;
+                    g = (g + 1) | 0;
+                  }
+                }
+              while (0);
+              l = s;
+              return;
+            }
+            function rM(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0;
+              c = +h[(b + 8) >> 3] * 0.5 + +h[(b + 24) >> 3];
+              h[a >> 3] = +h[b >> 3] * 0.5 + +h[(b + 16) >> 3];
+              h[(a + 8) >> 3] = c;
+              return;
+            }
+            function sM(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0.0,
+                j = 0.0;
+              e = l;
+              l = (l + 16) | 0;
+              f = e;
+              j = +h[b >> 3];
+              h[d >> 3] = +h[(+h[d >> 3] < j ? d : b) >> 3];
+              g = (d + 8) | 0;
+              i = +h[(b + 8) >> 3];
+              h[g >> 3] = +h[((+h[g >> 3] < i ? d : b) + 8) >> 3];
+              j = +h[(b + 16) >> 3] + j;
+              h[f >> 3] = j;
+              i = +h[(b + 24) >> 3] + i;
+              h[(f + 8) >> 3] = i;
+              g = (d + 16) | 0;
+              h[g >> 3] = +h[(+h[g >> 3] > j ? g : f) >> 3];
+              b = (d + 24) | 0;
+              h[b >> 3] = +h[((+h[b >> 3] > i ? g : f) + 8) >> 3];
+              c[a >> 2] = c[d >> 2];
+              c[(a + 4) >> 2] = c[(d + 4) >> 2];
+              c[(a + 8) >> 2] = c[(d + 8) >> 2];
+              c[(a + 12) >> 2] = c[(d + 12) >> 2];
+              c[(a + 16) >> 2] = c[(d + 16) >> 2];
+              c[(a + 20) >> 2] = c[(d + 20) >> 2];
+              c[(a + 24) >> 2] = c[(d + 24) >> 2];
+              c[(a + 28) >> 2] = c[(d + 28) >> 2];
+              l = e;
+              return;
+            }
+            function tM(a) {
+              a = a | 0;
+              cM(a, 1);
+              return;
+            }
+            function uM(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              e = l;
+              l = (l + 16) | 0;
+              d = e;
+              b = mP(QA(a, 105526) | 0) | 0;
+              if (b) {
+                b = vM(b) | 0;
+                if (b | 0) {
+                  f = c[(b + 40) >> 2] | 0;
+                  d = c[(b + 44) >> 2] | 0;
+                  g = (a + 16) | 0;
+                  a = c[g >> 2] | 0;
+                  h[(a + 32) >> 3] = +(f | 0) * 0.013888888888888888;
+                  h[(a + 40) >> 3] = +(d | 0) * 0.013888888888888888;
+                  a = JK(12) | 0;
+                  c[((c[g >> 2] | 0) + 12) >> 2] = a;
+                  c[a >> 2] = c[(b + 12) >> 2];
+                  c[(a + 4) >> 2] = (((f | 0) / -2) | 0) - (c[(b + 32) >> 2] | 0);
+                  c[(a + 8) >> 2] = (((d | 0) / -2) | 0) - (c[(b + 36) >> 2] | 0);
+                }
+              } else {
+                c[d >> 2] = KB(a) | 0;
+                gA(0, 104234, d) | 0;
+              }
+              l = e;
+              return;
+            }
+            function vM(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              p = l;
+              l = (l + 1152) | 0;
+              i = (p + 24) | 0;
+              h = (p + 8) | 0;
+              e = p;
+              f = (p + 120) | 0;
+              j = (p + 44) | 0;
+              k = (p + 40) | 0;
+              m = (p + 36) | 0;
+              n = (p + 32) | 0;
+              o = (p + 28) | 0;
+              d = c[47266] | 0;
+              if (!d) {
+                d = Vz(20812, c[4581] | 0) | 0;
+                c[47266] = d;
+              }
+              d = nb[c[d >> 2] & 63](d, b, 512) | 0;
+              do
+                if (!d) {
+                  g = $4(b, 138821) | 0;
+                  if (!g) {
+                    c[e >> 2] = b;
+                    gA(0, 104283, e) | 0;
+                    d = 0;
+                    break;
+                  } else {
+                    d = 0;
+                    e = 0;
+                  }
+                  while (1) {
+                    if (!(c4(f, 1024, g) | 0)) {
+                      f = 11;
+                      break;
+                    }
+                    c[h >> 2] = k;
+                    c[(h + 4) >> 2] = m;
+                    c[(h + 8) >> 2] = n;
+                    c[(h + 12) >> 2] = o;
+                    q = (b5(f, 104311, h) | 0) == 4;
+                    e = q ? 1 : e;
+                    if ((a[f >> 0] | 0) != 37) {
+                      q = (d4(f, 104340) | 0) == 0;
+                      d = q ? d : 1;
+                    }
+                    if (((e | 0) != 0) & ((d | 0) != 0)) {
+                      f = 12;
+                      break;
+                    }
+                  }
+                  if ((f | 0) == 11)
+                    if (!e) {
+                      c[i >> 2] = b;
+                      gA(0, 104345, i) | 0;
+                      d = 0;
+                    } else f = 12;
+                  if ((f | 0) == 12) {
+                    q = KK(64) | 0;
+                    k = c[k >> 2] | 0;
+                    c[(q + 32) >> 2] = k;
+                    m = c[m >> 2] | 0;
+                    c[(q + 40) >> 2] = (c[n >> 2] | 0) - k;
+                    c[(q + 36) >> 2] = (c[o >> 2] | 0) - m;
+                    c[(q + 8) >> 2] = b;
+                    o = c[47267] | 0;
+                    c[47267] = o + 1;
+                    c[(q + 12) >> 2] = o;
+                    Z4(A6(g) | 0, j) | 0;
+                    o = c[(j + 36) >> 2] | 0;
+                    n = KK((o + 1) | 0) | 0;
+                    c[(q + 52) >> 2] = n;
+                    n5(g, 0, 0) | 0;
+                    x6(n, o, 1, g) | 0;
+                    a[(n + o) >> 0] = 0;
+                    o = c[47266] | 0;
+                    nb[c[o >> 2] & 63](o, q, 1) | 0;
+                    a[(q + 16) >> 0] = d;
+                    d = q;
+                  }
+                  I4(g) | 0;
+                }
+              while (0);
+              l = p;
+              return d | 0;
+            }
+            function wM(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              U1(c[(b + 52) >> 2] | 0);
+              return;
+            }
+            function xM(a) {
+              a = a | 0;
+              U1(c[((c[(a + 16) >> 2] | 0) + 12) >> 2] | 0);
+              return;
+            }
+            function yM(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              n = l;
+              l = (l + 16) | 0;
+              m = (n + 8) | 0;
+              k = n;
+              j = (d | 0) != 0;
+              a: do
+                if (j) {
+                  h = 0;
+                  f = 0;
+                  b: while (1)
+                    while (1) {
+                      if (h) break a;
+                      g = c[(d + (f << 2)) >> 2] | 0;
+                      if (!g) {
+                        i = 6;
+                        break a;
+                      }
+                      f = (f + 1) | 0;
+                      if (!(a[g >> 0] | 0)) {
+                        h = 1;
+                        continue b;
+                      }
+                    }
+                } else i = 6;
+              while (0);
+              c: do
+                if ((i | 0) == 6)
+                  while (1) {
+                    f = c[e >> 2] | 0;
+                    if (!f) break c;
+                    oF(b, f) | 0;
+                    oF(b, 153599) | 0;
+                    e = (e + 4) | 0;
+                    i = 6;
+                  }
+              while (0);
+              d: do
+                if (j) {
+                  h = 0;
+                  while (1) {
+                    f = c[(d + (h << 2)) >> 2] | 0;
+                    if (!f) break d;
+                    do
+                      if (a[f >> 0] | 0) {
+                        e = mP(f) | 0;
+                        if (!e) {
+                          c[k >> 2] = f;
+                          gA(0, 104384, k) | 0;
+                          break;
+                        }
+                        g = $4(e, 138821) | 0;
+                        if (!g) {
+                          c[m >> 2] = e;
+                          gA(0, 104412, m) | 0;
+                          break;
+                        }
+                        while (1) {
+                          f = lP(g) | 0;
+                          if (!f) break;
+                          oF(b, f) | 0;
+                        }
+                        oF(b, 153599) | 0;
+                        I4(g) | 0;
+                      }
+                    while (0);
+                    h = (h + 1) | 0;
+                  }
+                }
+              while (0);
+              l = n;
+              return;
+            }
+            function zM(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              d = c[(d + 52) >> 2] | 0;
+              a: while (1) {
+                e = a[d >> 0] | 0;
+                b: do
+                  switch ((e << 24) >> 24) {
+                    case 0:
+                      break a;
+                    case 37: {
+                      if ((a[(d + 1) >> 0] | 0) == 37) {
+                        e = (d + 2) | 0;
+                        if (
+                          (
+                            ((j3(e, 104440, 3) | 0) != 0 ? (j3(e, 104444, 5) | 0) != 0 : 0)
+                              ? (j3(e, 104450, 3) | 0) != 0
+                              : 0
+                          )
+                            ? (j3(e, 104454, 7) | 0) != 0
+                            : 0
+                        ) {
+                          e = 37;
+                          break b;
+                        } else g = 37;
+                        c: while (1) {
+                          switch ((g << 24) >> 24) {
+                            case 13: {
+                              f = 10;
+                              break c;
+                            }
+                            case 10:
+                            case 0: {
+                              f = 12;
+                              break c;
+                            }
+                            default: {
+                            }
+                          }
+                          g = (d + 1) | 0;
+                          d = g;
+                          g = a[g >> 0] | 0;
+                        }
+                        if ((f | 0) == 10) {
+                          e = (d + 1) | 0;
+                          if ((a[e >> 0] | 0) == 10) {
+                            d = (d + 2) | 0;
+                            continue a;
+                          }
+                        } else if ((f | 0) == 12) e = (d + 1) | 0;
+                        d = (g << 24) >> 24 == 0 ? d : e;
+                        continue a;
+                      } else e = 37;
+                      break;
+                    }
+                    default: {
+                    }
+                  }
+                while (0);
+                d: while (1) {
+                  switch ((e << 24) >> 24) {
+                    case 10:
+                    case 13:
+                    case 0:
+                      break d;
+                    default: {
+                    }
+                  }
+                  pF(b, (e << 24) >> 24) | 0;
+                  g = (d + 1) | 0;
+                  d = g;
+                  e = a[g >> 0] | 0;
+                }
+                f = (d + 1) | 0;
+                if ((e << 24) >> 24 == 13 ? (a[f >> 0] | 0) == 10 : 0) d = (d + 2) | 0;
+                else d = (e << 24) >> 24 == 0 ? d : f;
+                pF(b, 10) | 0;
+              }
+              return;
+            }
+            function AM(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              f = l;
+              l = (l + 16) | 0;
+              e = f;
+              d = c[47266] | 0;
+              a: do
+                if (d | 0) {
+                  d = nb[c[d >> 2] & 63](d, 0, 128) | 0;
+                  while (1) {
+                    if (!d) break a;
+                    if (!(a[(d + 16) >> 0] | 0)) {
+                      c[e >> 2] = c[(d + 12) >> 2];
+                      uF(b, 104462, e);
+                      oF(b, 104480) | 0;
+                      zM(b, d);
+                      oF(b, 104498) | 0;
+                      oF(b, 104513) | 0;
+                    }
+                    g = c[47266] | 0;
+                    d = nb[c[g >> 2] & 63](g, d, 8) | 0;
+                  }
+                }
+              while (0);
+              l = f;
+              return;
+            }
+            function BM(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              g = l;
+              l = (l + 16) | 0;
+              e = g;
+              a: do
+                switch (d | 0) {
+                  case 0: {
+                    f = b;
+                    break;
+                  }
+                  case 1: {
+                    f = fQ(b) | 0;
+                    break;
+                  }
+                  default: {
+                    switch (CM(b) | 0) {
+                      case 2:
+                        break;
+                      case 1: {
+                        f = fQ(b) | 0;
+                        break a;
+                      }
+                      default: {
+                        f = b;
+                        break a;
+                      }
+                    }
+                    if (!(c[47268] | 0)) {
+                      gA(0, 104525, e) | 0;
+                      c[47268] = 1;
+                      f = b;
+                    } else f = b;
+                  }
+                }
+              while (0);
+              if (!(c[47269] | 0)) kA(189076, 0, 0);
+              d = c[47270] | 0;
+              if (d >>> 0 >= (c[47271] | 0) >>> 0) {
+                lA(189076, 1) | 0;
+                d = c[47270] | 0;
+              }
+              c[47270] = d + 1;
+              a[d >> 0] = 40;
+              e = f;
+              b: while (1) {
+                switch (a[e >> 0] | 0) {
+                  case 0:
+                    break b;
+                  case 92:
+                  case 41:
+                  case 40: {
+                    d = c[47270] | 0;
+                    if (d >>> 0 >= (c[47271] | 0) >>> 0) {
+                      lA(189076, 1) | 0;
+                      d = c[47270] | 0;
+                    }
+                    c[47270] = d + 1;
+                    a[d >> 0] = 92;
+                    break;
+                  }
+                  default: {
+                  }
+                }
+                d = c[47270] | 0;
+                if (d >>> 0 >= (c[47271] | 0) >>> 0) {
+                  lA(189076, 1) | 0;
+                  d = c[47270] | 0;
+                }
+                h = a[e >> 0] | 0;
+                c[47270] = d + 1;
+                a[d >> 0] = h;
+                e = (e + 1) | 0;
+              }
+              d = c[47270] | 0;
+              if (d >>> 0 >= (c[47271] | 0) >>> 0) {
+                lA(189076, 1) | 0;
+                d = c[47270] | 0;
+              }
+              c[47270] = d + 1;
+              a[d >> 0] = 41;
+              if ((f | 0) != (b | 0)) U1(f);
+              d = c[47270] | 0;
+              if (d >>> 0 >= (c[47271] | 0) >>> 0) {
+                lA(189076, 1) | 0;
+                d = c[47270] | 0;
+              }
+              a[d >> 0] = 0;
+              h = c[47269] | 0;
+              c[47270] = h;
+              l = g;
+              return h | 0;
+            }
+            function CM(b) {
+              b = b | 0;
+              var c = 0,
+                d = 0;
+              c = 0;
+              a: while (1) {
+                while (1) {
+                  d = a[b >> 0] | 0;
+                  if (!((d << 24) >> 24)) break a;
+                  if ((d & 255) < 127) b = (b + 1) | 0;
+                  else break;
+                }
+                if (((d & -4) << 24) >> 24 == -64) {
+                  c = 1;
+                  b = (b + 2) | 0;
+                } else {
+                  c = 2;
+                  break;
+                }
+              }
+              return c | 0;
+            }
+            function DM(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              n = l;
+              l = (l + 96) | 0;
+              i = (n + 80) | 0;
+              j = (n + 72) | 0;
+              m = (n + 64) | 0;
+              g = (n + 32) | 0;
+              k = n;
+              h[g >> 3] = +h[a >> 3];
+              h[(g + 8) >> 3] = +h[(a + 8) >> 3];
+              h[(g + 16) >> 3] = +h[b >> 3];
+              h[(g + 24) >> 3] = +h[(b + 8) >> 3];
+              do
+                if ((iY(d, g, j) | 0) >= 0) {
+                  if (!f) {
+                    b = (d + 4) | 0;
+                    a = c[b >> 2] | 0;
+                    f = c[47274] | 0;
+                    if ((a | 0) > (c[47273] | 0)) {
+                      if (!f) a = KK(a << 5) | 0;
+                      else a = MK(f, a << 5) | 0;
+                      c[47274] = a;
+                      g = c[b >> 2] | 0;
+                      c[47273] = g;
+                      f = a;
+                    } else g = a;
+                    b = c[d >> 2] | 0;
+                    a = 0;
+                    while (1) {
+                      if ((a | 0) >= (g | 0)) break;
+                      o = (f + (a << 5)) | 0;
+                      d = (b + (a << 4)) | 0;
+                      c[o >> 2] = c[d >> 2];
+                      c[(o + 4) >> 2] = c[(d + 4) >> 2];
+                      c[(o + 8) >> 2] = c[(d + 8) >> 2];
+                      c[(o + 12) >> 2] = c[(d + 12) >> 2];
+                      o = (f + (a << 5) + 16) | 0;
+                      d = (a + 1) | 0;
+                      p = (b + (((d | 0) % (g | 0) | 0) << 4)) | 0;
+                      c[o >> 2] = c[p >> 2];
+                      c[(o + 4) >> 2] = c[(p + 4) >> 2];
+                      c[(o + 8) >> 2] = c[(p + 8) >> 2];
+                      c[(o + 12) >> 2] = c[(p + 12) >> 2];
+                      a = d;
+                    }
+                    c[k >> 2] = 0;
+                    c[(k + 4) >> 2] = 0;
+                    c[(k + 8) >> 2] = 0;
+                    c[(k + 12) >> 2] = 0;
+                    c[(k + 16) >> 2] = 0;
+                    c[(k + 20) >> 2] = 0;
+                    c[(k + 24) >> 2] = 0;
+                    c[(k + 28) >> 2] = 0;
+                    c[i >> 2] = c[j >> 2];
+                    c[(i + 4) >> 2] = c[(j + 4) >> 2];
+                    if ((OX(f, g, i, k, m) | 0) < 0) {
+                      a = 0;
+                      break;
+                    }
+                  } else {
+                    c[i >> 2] = c[j >> 2];
+                    c[(i + 4) >> 2] = c[(j + 4) >> 2];
+                    FY(i, m);
+                  }
+                  a = (m + 4) | 0;
+                  if (!(EM(c[a >> 2] | 0) | 0)) {
+                    g = c[a >> 2] | 0;
+                    a = c[47275] | 0;
+                    f = c[m >> 2] | 0;
+                    b = 0;
+                    while (1) {
+                      if ((b | 0) >= (g | 0)) break;
+                      p = (a + (b << 4)) | 0;
+                      o = (f + (b << 4)) | 0;
+                      c[p >> 2] = c[o >> 2];
+                      c[(p + 4) >> 2] = c[(o + 4) >> 2];
+                      c[(p + 8) >> 2] = c[(o + 8) >> 2];
+                      c[(p + 12) >> 2] = c[(o + 12) >> 2];
+                      b = (b + 1) | 0;
+                    }
+                    c[e >> 2] = g;
+                  } else a = 0;
+                } else a = 0;
+              while (0);
+              l = n;
+              return a | 0;
+            }
+            function EM(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              e = l;
+              l = (l + 16) | 0;
+              d = e;
+              b = c[47276] | 0;
+              do
+                if ((b | 0) < (a | 0)) {
+                  a = (a + 300 - ((a | 0) % 300 | 0) + b) | 0;
+                  b = MK(c[47275] | 0, a << 4) | 0;
+                  c[47275] = b;
+                  if (!b) {
+                    gA(1, 104615, d) | 0;
+                    a = 1;
+                    break;
+                  } else {
+                    c[47276] = a;
+                    a = 0;
+                    break;
+                  }
+                } else a = 0;
+              while (0);
+              l = e;
+              return a | 0;
+            }
+            function FM() {
+              var a = 0,
+                b = 0,
+                d = 0;
+              b = l;
+              l = (l + 16) | 0;
+              a = b;
+              d = c[47277] | 0;
+              c[47277] = d + 1;
+              do
+                if ((d | 0) <= 0) {
+                  d = KK(4800) | 0;
+                  c[47275] = d;
+                  if (!d) {
+                    gA(1, 104638, a) | 0;
+                    a = 1;
+                    break;
+                  }
+                  c[47276] = 300;
+                  c[47278] = 0;
+                  c[47279] = 0;
+                  if (0) {
+                    TO();
+                    a = 0;
+                  } else a = 0;
+                } else a = 0;
+              while (0);
+              l = b;
+              return a | 0;
+            }
+            function GM() {
+              var a = 0,
+                b = 0,
+                d = 0,
+                e = 0.0,
+                f = 0,
+                g = 0;
+              b = l;
+              l = (l + 16) | 0;
+              a = b;
+              d = c[47277] | 0;
+              c[47277] = d + -1;
+              if ((d | 0) <= 1 ? (U1(c[47275] | 0), 0) : 0) {
+                d = c[15712] | 0;
+                g = c[47278] | 0;
+                f = c[47279] | 0;
+                e = +UO();
+                c[a >> 2] = g;
+                c[(a + 4) >> 2] = f;
+                h[(a + 8) >> 3] = e;
+                w4(d, 104676, a) | 0;
+              }
+              l = b;
+              return;
+            }
+            function HM(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return IM(a, b, 0) | 0;
+            }
+            function IM(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0.0,
+                m = 0.0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0;
+              L = l;
+              l = (l + 176) | 0;
+              G = (L + 168) | 0;
+              K = (L + 128) | 0;
+              x = (L + 120) | 0;
+              v = (L + 112) | 0;
+              i = (L + 104) | 0;
+              s = (L + 88) | 0;
+              n = (L + 72) | 0;
+              g = (L + 64) | 0;
+              t = (L + 160) | 0;
+              I = (L + 152) | 0;
+              y = (L + 144) | 0;
+              u = (L + 32) | 0;
+              w = L;
+              J = (L + 136) | 0;
+              c[47278] = (c[47278] | 0) + 1;
+              H = c[(b + 80) >> 2] | 0;
+              c[47279] = (c[47279] | 0) + H;
+              f = (b + 88) | 0;
+              while (1) {
+                C = c[f >> 2] | 0;
+                if (!C) {
+                  D = 4;
+                  break;
+                }
+                f = c[(C + 16) >> 2] | 0;
+                if (!(a[(f + 112) >> 0] | 0)) {
+                  D = 5;
+                  break;
+                } else f = (f + 116) | 0;
+              }
+              do
+                if ((D | 0) == 4) {
+                  gA(1, 104719, g) | 0;
+                  f = 0;
+                } else if ((D | 0) == 5) {
+                  B = c[(b + 84) >> 2] | 0;
+                  if (!(JM(H, B, b) | 0)) {
+                    g = H << 3;
+                    if ((g | 0) > (c[47280] | 0)) {
+                      f = c[47281] | 0;
+                      if (!f) f = KK(H << 7) | 0;
+                      else f = MK(f, H << 7) | 0;
+                      c[47281] = f;
+                      c[47280] = g;
+                    }
+                    a: do
+                      if ((H | 0) > 1 ? +h[(B + 8) >> 3] > +h[(B + 40) >> 3] : 0) {
+                        f = 0;
+                        while (1) {
+                          if ((f | 0) == (H | 0)) {
+                            p = 1;
+                            break a;
+                          }
+                          z = (B + (f << 5) + 24) | 0;
+                          m = +h[z >> 3];
+                          A = (B + (f << 5) + 8) | 0;
+                          h[z >> 3] = -+h[A >> 3];
+                          h[A >> 3] = -m;
+                          f = (f + 1) | 0;
+                        }
+                      } else p = 0;
+                    while (0);
+                    r = c[C >> 2] & 3;
+                    z = (C + 48) | 0;
+                    f = c[(((r | 0) == 3 ? C : z) + 40) >> 2] | 0;
+                    A = (C + -48) | 0;
+                    if ((f | 0) == (c[(((r | 0) == 2 ? C : A) + 40) >> 2] | 0)) {
+                      c[i >> 2] = KB(f) | 0;
+                      gA(1, 104826, i) | 0;
+                      f = 0;
+                      break;
+                    }
+                    o = (H + -1) | 0;
+                    q = c[47281] | 0;
+                    r = q;
+                    f = 0;
+                    j = 0;
+                    b: while (1) {
+                      if ((j | 0) >= (H | 0)) {
+                        j = o;
+                        n = f;
+                        break;
+                      }
+                      if ((j | 0) > 0) g = +h[(B + (j << 5) + 8) >> 3] > +h[(B + ((j + -1) << 5) + 8) >> 3] ? -1 : 1;
+                      else g = 0;
+                      if ((j | 0) < (o | 0))
+                        i = +h[(B + ((j + 1) << 5) + 8) >> 3] > +h[(B + (j << 5) + 8) >> 3] ? 1 : -1;
+                      else i = 0;
+                      c: do
+                        if ((g | 0) != (i | 0))
+                          if (((g | 0) == 1) | ((i | 0) == -1)) {
+                            g = (B + (j << 5)) | 0;
+                            h[(q + (f << 4)) >> 3] = +h[g >> 3];
+                            i = (f + 1) | 0;
+                            h[(q + (f << 4) + 8) >> 3] = +h[(B + (j << 5) + 24) >> 3];
+                            h[(q + (i << 4)) >> 3] = +h[g >> 3];
+                            g = (B + (j << 5) + 8) | 0;
+                            D = 29;
+                            break;
+                          } else {
+                            g = (B + (j << 5) + 16) | 0;
+                            h[(q + (f << 4)) >> 3] = +h[g >> 3];
+                            i = (f + 1) | 0;
+                            h[(q + (f << 4) + 8) >> 3] = +h[(B + (j << 5) + 8) >> 3];
+                            h[(q + (i << 4)) >> 3] = +h[g >> 3];
+                            g = (B + (j << 5) + 24) | 0;
+                            D = 29;
+                            break;
+                          }
+                        else {
+                          switch (g | 0) {
+                            case -1:
+                              break c;
+                            case 0:
+                              break;
+                            default: {
+                              D = 28;
+                              break b;
+                            }
+                          }
+                          g = (B + (j << 5)) | 0;
+                          h[(q + (f << 4)) >> 3] = +h[g >> 3];
+                          i = (f + 1) | 0;
+                          h[(q + (f << 4) + 8) >> 3] = +h[(B + (j << 5) + 24) >> 3];
+                          h[(q + (i << 4)) >> 3] = +h[g >> 3];
+                          g = (B + (j << 5) + 8) | 0;
+                          D = 29;
+                        }
+                      while (0);
+                      if ((D | 0) == 29) {
+                        D = 0;
+                        h[(q + (i << 4) + 8) >> 3] = +h[g >> 3];
+                        f = (f + 2) | 0;
+                      }
+                      j = (j + 1) | 0;
+                    }
+                    if ((D | 0) == 28) {
+                      c[n >> 2] = g;
+                      c[(n + 4) >> 2] = g;
+                      c[(n + 8) >> 2] = 480;
+                      gA(1, 104761, n) | 0;
+                      f = 0;
+                      break;
+                    }
+                    d: while (1) {
+                      if ((j | 0) <= -1) break;
+                      if ((j | 0) < (o | 0))
+                        f = +h[(B + (j << 5) + 8) >> 3] > +h[(B + ((j + 1) << 5) + 8) >> 3] ? -1 : 1;
+                      else f = 0;
+                      if ((j | 0) > 0) g = +h[(B + ((j + -1) << 5) + 8) >> 3] > +h[(B + (j << 5) + 8) >> 3] ? 1 : -1;
+                      else g = 0;
+                      e: do
+                        if ((f | 0) != (g | 0))
+                          if (((f | 0) == 1) | ((g | 0) == -1)) {
+                            f = (B + (j << 5)) | 0;
+                            h[(q + (n << 4)) >> 3] = +h[f >> 3];
+                            g = (n + 1) | 0;
+                            h[(q + (n << 4) + 8) >> 3] = +h[(B + (j << 5) + 24) >> 3];
+                            h[(q + (g << 4)) >> 3] = +h[f >> 3];
+                            f = (B + (j << 5) + 8) | 0;
+                            i = 2;
+                            break;
+                          } else {
+                            f = (B + (j << 5) + 16) | 0;
+                            h[(q + (n << 4)) >> 3] = +h[f >> 3];
+                            g = (n + 1) | 0;
+                            h[(q + (n << 4) + 8) >> 3] = +h[(B + (j << 5) + 8) >> 3];
+                            h[(q + (g << 4)) >> 3] = +h[f >> 3];
+                            f = (B + (j << 5) + 24) | 0;
+                            i = 2;
+                            break;
+                          }
+                        else
+                          switch (f | 0) {
+                            case 0: {
+                              f = (B + (j << 5) + 16) | 0;
+                              h[(q + (n << 4)) >> 3] = +h[f >> 3];
+                              g = (n + 1) | 0;
+                              h[(q + (n << 4) + 8) >> 3] = +h[(B + (j << 5) + 8) >> 3];
+                              h[(q + (g << 4)) >> 3] = +h[f >> 3];
+                              f = (B + (j << 5) + 24) | 0;
+                              i = 2;
+                              break e;
+                            }
+                            case -1: {
+                              N = (B + (j << 5) + 16) | 0;
+                              h[(q + (n << 4)) >> 3] = +h[N >> 3];
+                              f = (B + (j << 5) + 8) | 0;
+                              i = (n + 1) | 0;
+                              h[(q + (n << 4) + 8) >> 3] = +h[f >> 3];
+                              h[(q + (i << 4)) >> 3] = +h[N >> 3];
+                              N = (B + (j << 5) + 24) | 0;
+                              M = (n + 2) | 0;
+                              h[(q + (i << 4) + 8) >> 3] = +h[N >> 3];
+                              i = (B + (j << 5)) | 0;
+                              h[(q + (M << 4)) >> 3] = +h[i >> 3];
+                              g = (n + 3) | 0;
+                              h[(q + (M << 4) + 8) >> 3] = +h[N >> 3];
+                              h[(q + (g << 4)) >> 3] = +h[i >> 3];
+                              i = 4;
+                              break e;
+                            }
+                            default: {
+                              D = 42;
+                              break d;
+                            }
+                          }
+                      while (0);
+                      h[(q + (g << 4) + 8) >> 3] = +h[f >> 3];
+                      j = (j + -1) | 0;
+                      n = (n + i) | 0;
+                    }
+                    if ((D | 0) == 42) {
+                      c[s >> 2] = f;
+                      c[(s + 4) >> 2] = f;
+                      c[(s + 8) >> 2] = 513;
+                      gA(1, 104761, s) | 0;
+                      f = 0;
+                      break;
+                    }
+                    f: do
+                      if (!p) f = 0;
+                      else {
+                        f = 0;
+                        while (1) {
+                          if ((f | 0) >= (H | 0)) {
+                            f = 0;
+                            break;
+                          }
+                          M = (B + (f << 5) + 24) | 0;
+                          m = +h[M >> 3];
+                          N = (B + (f << 5) + 8) | 0;
+                          h[M >> 3] = -+h[N >> 3];
+                          h[N >> 3] = -m;
+                          f = (f + 1) | 0;
+                        }
+                        while (1) {
+                          if ((f | 0) >= (n | 0)) {
+                            f = 0;
+                            break f;
+                          }
+                          N = (q + (f << 4) + 8) | 0;
+                          h[N >> 3] = -+h[N >> 3];
+                          f = (f + 1) | 0;
+                        }
+                      }
+                    while (0);
+                    while (1) {
+                      if ((f | 0) >= (H | 0)) break;
+                      h[(B + (f << 5)) >> 3] = 2147483647.0;
+                      h[(B + (f << 5) + 16) >> 3] = -2147483648.0;
+                      f = (f + 1) | 0;
+                    }
+                    c[t >> 2] = r;
+                    i = (t + 4) | 0;
+                    c[i >> 2] = n;
+                    h[u >> 3] = +h[b >> 3];
+                    h[(u + 8) >> 3] = +h[(b + 8) >> 3];
+                    h[(u + 16) >> 3] = +h[(b + 40) >> 3];
+                    h[(u + 24) >> 3] = +h[(b + 48) >> 3];
+                    if ((iY(t, u, I) | 0) < 0) {
+                      gA(1, 104865, v) | 0;
+                      f = 0;
+                      break;
+                    }
+                    if (!e) {
+                      g = c[i >> 2] | 0;
+                      f = c[47274] | 0;
+                      if ((g | 0) > (c[47273] | 0)) {
+                        if (!f) f = KK(g << 5) | 0;
+                        else f = MK(f, g << 5) | 0;
+                        c[47274] = f;
+                        g = c[i >> 2] | 0;
+                        c[47273] = g;
+                      }
+                      j = c[47281] | 0;
+                      i = 0;
+                      while (1) {
+                        if ((i | 0) >= (g | 0)) break;
+                        M = (f + (i << 5)) | 0;
+                        N = (j + (i << 4)) | 0;
+                        c[M >> 2] = c[N >> 2];
+                        c[(M + 4) >> 2] = c[(N + 4) >> 2];
+                        c[(M + 8) >> 2] = c[(N + 8) >> 2];
+                        c[(M + 12) >> 2] = c[(N + 12) >> 2];
+                        M = (f + (i << 5) + 16) | 0;
+                        N = (i + 1) | 0;
+                        v = (j + (((N | 0) % (g | 0) | 0) << 4)) | 0;
+                        c[M >> 2] = c[v >> 2];
+                        c[(M + 4) >> 2] = c[(v + 4) >> 2];
+                        c[(M + 8) >> 2] = c[(v + 8) >> 2];
+                        c[(M + 12) >> 2] = c[(v + 12) >> 2];
+                        i = N;
+                      }
+                      if (!(a[(b + 29) >> 0] | 0)) {
+                        k = 0.0;
+                        m = 0.0;
+                      } else {
+                        m = +h[(b + 16) >> 3];
+                        k = +E(+m);
+                        m = +F(+m);
+                      }
+                      h[(w + 8) >> 3] = m;
+                      h[w >> 3] = k;
+                      if (!(a[(b + 69) >> 0] | 0)) {
+                        k = 0.0;
+                        m = 0.0;
+                      } else {
+                        m = +h[(b + 56) >> 3];
+                        k = -+E(+m);
+                        m = -+F(+m);
+                      }
+                      h[(w + 24) >> 3] = m;
+                      h[(w + 16) >> 3] = k;
+                      c[G >> 2] = c[I >> 2];
+                      c[(G + 4) >> 2] = c[(I + 4) >> 2];
+                      if ((OX(f, g, G, w, y) | 0) < 0) {
+                        gA(1, 104904, x) | 0;
+                        f = 0;
+                        break;
+                      }
+                    } else {
+                      c[G >> 2] = c[I >> 2];
+                      c[(G + 4) >> 2] = c[(I + 4) >> 2];
+                      FY(G, y);
+                    }
+                    n = (y + 4) | 0;
+                    if (!(EM(c[n >> 2] | 0) | 0)) {
+                      f = 0;
+                      while (1) {
+                        if ((f | 0) >= (H | 0)) break;
+                        h[(B + (f << 5)) >> 3] = 2147483647.0;
+                        h[(B + (f << 5) + 16) >> 3] = -2147483648.0;
+                        f = (f + 1) | 0;
+                      }
+                      i = c[n >> 2] | 0;
+                      j = c[47275] | 0;
+                      g = c[y >> 2] | 0;
+                      f = 0;
+                      while (1) {
+                        if ((f | 0) >= (i | 0)) {
+                          i = 1;
+                          f = 10;
+                          g = 0;
+                          break;
+                        }
+                        N = (j + (f << 4)) | 0;
+                        M = (g + (f << 4)) | 0;
+                        c[N >> 2] = c[M >> 2];
+                        c[(N + 4) >> 2] = c[(M + 4) >> 2];
+                        c[(N + 8) >> 2] = c[(M + 8) >> 2];
+                        c[(N + 12) >> 2] = c[(M + 12) >> 2];
+                        f = (f + 1) | 0;
+                      }
+                      while (1) {
+                        if (!(((g | 0) < 15) & ((i << 24) >> 24 != 0))) break;
+                        KM(B, H, c[47275] | 0, c[n >> 2] | 0, f);
+                        j = 0;
+                        while (1) {
+                          if ((j | 0) >= (H | 0)) break;
+                          if (+h[(B + (j << 5)) >> 3] == 2147483647.0) {
+                            D = 82;
+                            break;
+                          }
+                          if (+h[(B + (j << 5) + 16) >> 3] == -2147483648.0) {
+                            D = 82;
+                            break;
+                          }
+                          j = (j + 1) | 0;
+                        }
+                        if ((D | 0) == 82) {
+                          D = 0;
+                          N = f << 1;
+                          f = N;
+                          g = (N | 0) > ((2147483647 / (H | 0)) | 0 | 0) ? 15 : g;
+                        }
+                        i = (j | 0) == (H | 0) ? 0 : i;
+                        g = (g + 1) | 0;
+                      }
+                      if ((i << 24) >> 24) {
+                        M = KB(c[((((c[C >> 2] & 3) | 0) == 3 ? C : z) + 40) >> 2] | 0) | 0;
+                        N = KB(c[((((c[C >> 2] & 3) | 0) == 2 ? C : A) + 40) >> 2] | 0) | 0;
+                        c[K >> 2] = M;
+                        c[(K + 4) >> 2] = N;
+                        gA(0, 104942, K) | 0;
+                        c[G >> 2] = c[I >> 2];
+                        c[(G + 4) >> 2] = c[(I + 4) >> 2];
+                        FY(G, J);
+                        KM(B, H, c[J >> 2] | 0, c[(J + 4) >> 2] | 0, 10);
+                        U1(c[J >> 2] | 0);
+                      }
+                      c[d >> 2] = c[n >> 2];
+                      f = c[47275] | 0;
+                    } else f = 0;
+                  } else f = 0;
+                }
+              while (0);
+              l = L;
+              return f | 0;
+            }
+            function JM(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0.0,
+                n = 0.0,
+                o = 0,
+                p = 0.0,
+                q = 0.0,
+                r = 0.0,
+                s = 0.0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0.0,
+                L = 0,
+                M = 0,
+                N = 0,
+                O = 0.0,
+                P = 0,
+                Q = 0,
+                R = 0;
+              R = l;
+              l = (l + 32) | 0;
+              I = (R + 16) | 0;
+              H = (R + 8) | 0;
+              k = R;
+              e = 0;
+              j = 0;
+              while (1) {
+                if ((j | 0) >= (a | 0)) break;
+                i = (b + (j << 5)) | 0;
+                s = +h[(b + (j << 5) + 8) >> 3] - +h[(b + (j << 5) + 24) >> 3];
+                if (
+                  !((s >= 0.0 ? s : -s) < 0.01)
+                    ? ((s = +h[i >> 3] - +h[(b + (j << 5) + 16) >> 3]), !((s >= 0.0 ? s : -s) < 0.01))
+                    : 0
+                ) {
+                  if ((e | 0) != (j | 0)) {
+                    P = (b + (e << 5)) | 0;
+                    c[P >> 2] = c[i >> 2];
+                    c[(P + 4) >> 2] = c[(i + 4) >> 2];
+                    c[(P + 8) >> 2] = c[(i + 8) >> 2];
+                    c[(P + 12) >> 2] = c[(i + 12) >> 2];
+                    c[(P + 16) >> 2] = c[(i + 16) >> 2];
+                    c[(P + 20) >> 2] = c[(i + 20) >> 2];
+                    c[(P + 24) >> 2] = c[(i + 24) >> 2];
+                    c[(P + 28) >> 2] = c[(i + 28) >> 2];
+                  }
+                  e = (e + 1) | 0;
+                }
+                j = (j + 1) | 0;
+              }
+              J = (b + 16) | 0;
+              do
+                if (
+                  !(+h[b >> 3] > +h[J >> 3]) ? ((L = (b + 8) | 0), (N = (b + 24) | 0), !(+h[L >> 3] > +h[N >> 3])) : 0
+                ) {
+                  P = (e + -1) | 0;
+                  M = c[15712] | 0;
+                  w = 0;
+                  while (1) {
+                    if ((w | 0) >= (P | 0)) break;
+                    D = (w + 1) | 0;
+                    E = (b + (D << 5)) | 0;
+                    f = +h[E >> 3];
+                    F = (b + (D << 5) + 16) | 0;
+                    g = +h[F >> 3];
+                    if (f > g) {
+                      Q = 16;
+                      break;
+                    }
+                    A = (b + (D << 5) + 8) | 0;
+                    m = +h[A >> 3];
+                    B = (b + (D << 5) + 24) | 0;
+                    n = +h[B >> 3];
+                    if (m > n) {
+                      Q = 16;
+                      break;
+                    }
+                    G = (b + (w << 5) + 16) | 0;
+                    v = +h[G >> 3] < f;
+                    e = v & 1;
+                    C = (b + (w << 5)) | 0;
+                    u = +h[C >> 3] > g;
+                    a = u & 1;
+                    z = (b + (w << 5) + 24) | 0;
+                    t = +h[z >> 3] < m;
+                    j = t & 1;
+                    y = (b + (w << 5) + 8) | 0;
+                    k = +h[y >> 3] > n;
+                    i = k & 1;
+                    x = (a + e + j + i) | 0;
+                    o = (x | 0) != 0;
+                    if (!((0 == 0) | (o ^ 1))) {
+                      c[I >> 2] = w;
+                      c[(I + 4) >> 2] = D;
+                      w4(M, 105142, I) | 0;
+                      LM(d);
+                    }
+                    a: do
+                      if (o) {
+                        if (!v)
+                          if (!u)
+                            if (!t) {
+                              if (k) {
+                                k = 0;
+                                o = e;
+                                e = B;
+                                i = y;
+                                Q = 24;
+                              }
+                            } else {
+                              k = i;
+                              j = 0;
+                              o = e;
+                              e = A;
+                              i = z;
+                              Q = 24;
+                            }
+                          else {
+                            k = i;
+                            a = 0;
+                            o = e;
+                            e = F;
+                            i = C;
+                            Q = 24;
+                          }
+                        else {
+                          k = i;
+                          o = 0;
+                          e = E;
+                          i = G;
+                          Q = 24;
+                        }
+                        if ((Q | 0) == 24) {
+                          Q = 0;
+                          w = ~~+h[i >> 3];
+                          h[i >> 3] = +h[e >> 3];
+                          h[e >> 3] = +(w | 0);
+                          i = k;
+                          e = o;
+                        }
+                        o = (x + -1) | 0;
+                        k = 0;
+                        while (1) {
+                          if ((k | 0) >= (o | 0)) break a;
+                          do
+                            if ((e | 0) != 1) {
+                              if ((a | 0) == 1) {
+                                s = +(~~((+h[F >> 3] + +h[C >> 3]) * 0.5 + 0.5) | 0);
+                                h[F >> 3] = s;
+                                h[C >> 3] = s;
+                                a = 0;
+                                break;
+                              }
+                              if ((j | 0) == 1) {
+                                s = +(~~((+h[A >> 3] + +h[z >> 3]) * 0.5 + 0.5) | 0);
+                                h[A >> 3] = s;
+                                h[z >> 3] = s;
+                                j = 0;
+                                break;
+                              }
+                              if ((i | 0) == 1) {
+                                s = +(~~((+h[B >> 3] + +h[y >> 3]) * 0.5 + 0.5) | 0);
+                                h[B >> 3] = s;
+                                h[y >> 3] = s;
+                                i = 0;
+                              }
+                            } else {
+                              s = +(~~((+h[E >> 3] + +h[G >> 3]) * 0.5 + 0.5) | 0);
+                              h[E >> 3] = s;
+                              h[G >> 3] = s;
+                              e = 0;
+                            }
+                          while (0);
+                          k = (k + 1) | 0;
+                        }
+                      }
+                    while (0);
+                    p = +h[C >> 3];
+                    q = +h[G >> 3];
+                    r = +h[E >> 3];
+                    s = +h[F >> 3];
+                    i = MM(~~p, ~~q, ~~r, ~~s) | 0;
+                    n = +h[y >> 3];
+                    m = +h[z >> 3];
+                    g = +h[A >> 3];
+                    f = +h[B >> 3];
+                    e = MM(~~n, ~~m, ~~g, ~~f) | 0;
+                    if (!(((i | 0) != 0) & ((e | 0) != 0))) {
+                      w = D;
+                      continue;
+                    }
+                    if ((i | 0) < (e | 0)) {
+                      B = q - p > s - r;
+                      w = q < s;
+                      h[(B ? (w ? G : C) : w ? E : F) >> 3] = B ? (w ? r : s) : w ? q : p;
+                      w = D;
+                      continue;
+                    } else {
+                      B = m - n > f - g;
+                      w = m < f;
+                      h[((B ? (w ? G : C) : w ? E : F) + 8) >> 3] = B ? (w ? g : f) : w ? m : n;
+                      w = D;
+                      continue;
+                    }
+                  }
+                  if ((Q | 0) == 16) {
+                    c[H >> 2] = D;
+                    gA(1, 105096, H) | 0;
+                    LM(d);
+                    e = 1;
+                    break;
+                  }
+                  f = +h[d >> 3];
+                  g = +h[b >> 3];
+                  if (
+                    !(((!(f < g) ? !(f > +h[J >> 3]) : 0) ? ((K = +h[(d + 8) >> 3]), !(K < +h[L >> 3])) : 0)
+                      ? !(K > +h[N >> 3])
+                      : 0)
+                  ) {
+                    if (0) {
+                      U4(105185, 42, 1, M) | 0;
+                      LM(d);
+                      g = +h[b >> 3];
+                      f = +h[d >> 3];
+                    }
+                    if (f < g) h[d >> 3] = g;
+                    else g = f;
+                    f = +h[J >> 3];
+                    if (g > f) h[d >> 3] = f;
+                    e = (d + 8) | 0;
+                    g = +h[e >> 3];
+                    f = +h[L >> 3];
+                    if (g < f) {
+                      h[e >> 3] = f;
+                      g = f;
+                    }
+                    f = +h[N >> 3];
+                    if (g > f) h[e >> 3] = f;
+                  }
+                  i = (d + 40) | 0;
+                  f = +h[i >> 3];
+                  e = (b + (P << 5)) | 0;
+                  g = +h[e >> 3];
+                  if (
+                    (
+                      (!(f < g) ? !(f > +h[(b + (P << 5) + 16) >> 3]) : 0)
+                        ? ((O = +h[(d + 48) >> 3]), !(O < +h[(b + (P << 5) + 8) >> 3]))
+                        : 0
+                    )
+                      ? !(O > +h[(b + (P << 5) + 24) >> 3])
+                      : 0
+                  ) {
+                    e = 0;
+                    break;
+                  }
+                  if (0) {
+                    U4(105228, 39, 1, M) | 0;
+                    LM(d);
+                    g = +h[e >> 3];
+                    f = +h[i >> 3];
+                  }
+                  if (f < g) {
+                    h[i >> 3] = g;
+                    f = g;
+                  }
+                  g = +h[(b + (P << 5) + 16) >> 3];
+                  if (f > g) h[i >> 3] = g;
+                  e = (d + 48) | 0;
+                  f = +h[e >> 3];
+                  g = +h[(b + (P << 5) + 8) >> 3];
+                  if (f < g) h[e >> 3] = g;
+                  else g = f;
+                  f = +h[(b + (P << 5) + 24) >> 3];
+                  if (g > f) {
+                    h[e >> 3] = f;
+                    e = 0;
+                  } else e = 0;
+                } else Q = 12;
+              while (0);
+              if ((Q | 0) == 12) {
+                gA(1, 105051, k) | 0;
+                LM(d);
+                e = 1;
+              }
+              l = R;
+              return e | 0;
+            }
+            function KM(a, b, c, d, e) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0.0,
+                n = 0.0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0.0,
+                u = 0,
+                v = 0.0,
+                w = 0.0,
+                x = 0.0,
+                y = 0.0,
+                z = 0.0;
+              s = O(e, b) | 0;
+              t = 1.0 / +(s | 0);
+              e = 0;
+              a: while (1) {
+                u = (e + 3) | 0;
+                if ((u | 0) >= (d | 0)) break;
+                o = (c + (e << 4)) | 0;
+                p = (c + (e << 4) + 8) | 0;
+                r = (e + 1) | 0;
+                q = (c + (r << 4)) | 0;
+                r = (c + (r << 4) + 8) | 0;
+                j = (e + 2) | 0;
+                i = (c + (j << 4)) | 0;
+                j = (c + (j << 4) + 8) | 0;
+                k = (c + (u << 4)) | 0;
+                l = (c + (u << 4) + 8) | 0;
+                g = 0;
+                while (1) {
+                  if ((g | 0) > (s | 0)) {
+                    e = u;
+                    continue a;
+                  }
+                  v = t * +(g | 0);
+                  m = +h[o >> 3];
+                  n = +h[p >> 3];
+                  y = +h[q >> 3];
+                  w = +h[r >> 3];
+                  z = +h[i >> 3];
+                  x = +h[j >> 3];
+                  m = (y - m) * v + m;
+                  n = (w - n) * v + n;
+                  y = (z - y) * v + y;
+                  w = (x - w) * v + w;
+                  m = (y - m) * v + m;
+                  n = (w - n) * v + n;
+                  m = ((z - y + (+h[k >> 3] - z) * v) * v + y - m) * v + m;
+                  n = ((x - w + (+h[l >> 3] - x) * v) * v + w - n) * v + n;
+                  f = 0;
+                  while (1) {
+                    if ((f | 0) >= (b | 0)) break;
+                    if (n <= +h[(a + (f << 5) + 24) >> 3] + 0.0001 ? n >= +h[(a + (f << 5) + 8) >> 3] + -0.0001 : 0) {
+                      e = (a + (f << 5)) | 0;
+                      if (+h[e >> 3] > m) h[e >> 3] = m;
+                      e = (a + (f << 5) + 16) | 0;
+                      if (+h[e >> 3] < m) h[e >> 3] = m;
+                    }
+                    f = (f + 1) | 0;
+                  }
+                  g = (g + 1) | 0;
+                }
+              }
+              return;
+            }
+            function LM(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0,
+                r = 0;
+              m = l;
+              l = (l + 112) | 0;
+              j = (m + 80) | 0;
+              k = (m + 48) | 0;
+              i = (m + 8) | 0;
+              g = m;
+              e = c[15712] | 0;
+              f = (b + 80) | 0;
+              c[g >> 2] = c[f >> 2];
+              w4(e, 105268, g) | 0;
+              g = (b + 84) | 0;
+              d = 0;
+              while (1) {
+                if ((d | 0) >= (c[f >> 2] | 0)) break;
+                r = c[g >> 2] | 0;
+                q = +h[(r + (d << 5)) >> 3];
+                p = +h[(r + (d << 5) + 8) >> 3];
+                o = +h[(r + (d << 5) + 16) >> 3];
+                n = +h[(r + (d << 5) + 24) >> 3];
+                c[i >> 2] = d;
+                h[(i + 8) >> 3] = q;
+                h[(i + 16) >> 3] = p;
+                h[(i + 24) >> 3] = o;
+                h[(i + 32) >> 3] = n;
+                w4(e, 105279, i) | 0;
+                d = (d + 1) | 0;
+              }
+              q = +h[(b + 8) >> 3];
+              p = +h[(b + 16) >> 3];
+              r = a[(b + 29) >> 0] | 0 ? 105310 : 105322;
+              h[k >> 3] = +h[b >> 3];
+              h[(k + 8) >> 3] = q;
+              h[(k + 16) >> 3] = p;
+              c[(k + 24) >> 2] = r;
+              w4(e, 105338, k) | 0;
+              p = +h[(b + 48) >> 3];
+              q = +h[(b + 56) >> 3];
+              r = a[(b + 69) >> 0] | 0 ? 105310 : 105322;
+              h[j >> 3] = +h[(b + 40) >> 3];
+              h[(j + 8) >> 3] = p;
+              h[(j + 16) >> 3] = q;
+              c[(j + 24) >> 2] = r;
+              w4(e, 105389, j) | 0;
+              l = m;
+              return;
+            }
+            function MM(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              do
+                if (((b | 0) > (c | 0)) & ((d | 0) > (a | 0))) {
+                  if (!(((c | 0) > (a | 0)) | ((d | 0) < (a | 0)))) {
+                    a = (d - a) | 0;
+                    break;
+                  }
+                  if (((b | 0) < (c | 0)) | ((b | 0) > (d | 0))) {
+                    b = (b - a) | 0;
+                    a = (d - c) | 0;
+                    a = (b | 0) < (a | 0) ? b : a;
+                    break;
+                  } else {
+                    a = (b - c) | 0;
+                    break;
+                  }
+                } else a = 0;
+              while (0);
+              return a | 0;
+            }
+            function NM(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return IM(a, b, 1) | 0;
+            }
+            function OM(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 80) | 0;
+              g = j;
+              i = 1;
+              f = b;
+              while (1) {
+                h = f;
+                f = c[((c[(f + 16) >> 2] | 0) + 172) >> 2] | 0;
+                if (!(((f | 0) != 0) & ((h | 0) != (f | 0)))) break;
+                else i = (i + 1) | 0;
+              }
+              if ((i | 0) >= 21) g = JK(i << 2) | 0;
+              h = 0;
+              f = b;
+              while (1) {
+                if ((h | 0) >= (i | 0)) break;
+                c[(g + (h << 2)) >> 2] = f;
+                h = (h + 1) | 0;
+                f = c[((c[(f + 16) >> 2] | 0) + 172) >> 2] | 0;
+              }
+              PM(a, g, i, d, e);
+              if ((i | 0) > 20) U1(g);
+              l = j;
+              return;
+            }
+            function PM(b, d, e, f, g) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0,
+                r = 0,
+                s = 0.0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0.0,
+                M = 0.0,
+                N = 0.0,
+                P = 0,
+                Q = 0;
+              K = l;
+              l = (l + 304) | 0;
+              A = (K + 272) | 0;
+              z = (K + 208) | 0;
+              G = (K + 96) | 0;
+              H = (K + 32) | 0;
+              I = (K + 16) | 0;
+              J = K;
+              r = (K + 192) | 0;
+              y = (K + 176) | 0;
+              i = (K + 160) | 0;
+              B = (K + 296) | 0;
+              D = (K + 288) | 0;
+              j = c[d >> 2] | 0;
+              w = c[j >> 2] & 3;
+              k = (j + -48) | 0;
+              E = c[(((w | 0) == 2 ? j : k) + 40) >> 2] | 0;
+              t = (G + 16) | 0;
+              w = ((c[((c[(((w | 0) == 3 ? j : (j + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 16) | 0;
+              x = (j + 16) | 0;
+              F = ((c[x >> 2] | 0) + 16) | 0;
+              c[z >> 2] = c[w >> 2];
+              c[(z + 4) >> 2] = c[(w + 4) >> 2];
+              c[(z + 8) >> 2] = c[(w + 8) >> 2];
+              c[(z + 12) >> 2] = c[(w + 12) >> 2];
+              c[A >> 2] = c[F >> 2];
+              c[(A + 4) >> 2] = c[(F + 4) >> 2];
+              c[(A + 8) >> 2] = c[(F + 8) >> 2];
+              c[(A + 12) >> 2] = c[(F + 12) >> 2];
+              QM(r, z, A);
+              c[G >> 2] = c[r >> 2];
+              c[(G + 4) >> 2] = c[(r + 4) >> 2];
+              c[(G + 8) >> 2] = c[(r + 8) >> 2];
+              c[(G + 12) >> 2] = c[(r + 12) >> 2];
+              c[t >> 2] = c[r >> 2];
+              c[(t + 4) >> 2] = c[(r + 4) >> 2];
+              c[(t + 8) >> 2] = c[(r + 8) >> 2];
+              c[(t + 12) >> 2] = c[(r + 12) >> 2];
+              c[I >> 2] = c[r >> 2];
+              c[(I + 4) >> 2] = c[(r + 4) >> 2];
+              c[(I + 8) >> 2] = c[(r + 8) >> 2];
+              c[(I + 12) >> 2] = c[(r + 12) >> 2];
+              r = (G + 32) | 0;
+              F = (G + 48) | 0;
+              w = ((c[(E + 16) >> 2] | 0) + 16) | 0;
+              x = ((c[x >> 2] | 0) + 56) | 0;
+              c[z >> 2] = c[w >> 2];
+              c[(z + 4) >> 2] = c[(w + 4) >> 2];
+              c[(z + 8) >> 2] = c[(w + 8) >> 2];
+              c[(z + 12) >> 2] = c[(w + 12) >> 2];
+              c[A >> 2] = c[x >> 2];
+              c[(A + 4) >> 2] = c[(x + 4) >> 2];
+              c[(A + 8) >> 2] = c[(x + 8) >> 2];
+              c[(A + 12) >> 2] = c[(x + 12) >> 2];
+              QM(y, z, A);
+              c[F >> 2] = c[y >> 2];
+              c[(F + 4) >> 2] = c[(y + 4) >> 2];
+              c[(F + 8) >> 2] = c[(y + 8) >> 2];
+              c[(F + 12) >> 2] = c[(y + 12) >> 2];
+              c[r >> 2] = c[y >> 2];
+              c[(r + 4) >> 2] = c[(y + 4) >> 2];
+              c[(r + 8) >> 2] = c[(y + 8) >> 2];
+              c[(r + 12) >> 2] = c[(y + 12) >> 2];
+              c[J >> 2] = c[y >> 2];
+              c[(J + 4) >> 2] = c[(y + 4) >> 2];
+              c[(J + 8) >> 2] = c[(y + 8) >> 2];
+              c[(J + 12) >> 2] = c[(y + 12) >> 2];
+              a: do
+                if (((e | 0) != 1) & ((a[194954] | 0) == 0)) {
+                  m = +h[G >> 3];
+                  n = +h[F >> 3];
+                  L = m - n;
+                  o = +h[(G + 8) >> 3];
+                  p = +h[(G + 56) >> 3];
+                  s = o - p;
+                  q = s * s;
+                  if (q + L * L < 1.0e-6) {
+                    c[t >> 2] = c[G >> 2];
+                    c[(t + 4) >> 2] = c[(G + 4) >> 2];
+                    c[(t + 8) >> 2] = c[(G + 8) >> 2];
+                    c[(t + 12) >> 2] = c[(G + 12) >> 2];
+                    c[r >> 2] = c[F >> 2];
+                    c[(r + 4) >> 2] = c[(F + 4) >> 2];
+                    c[(r + 8) >> 2] = c[(F + 8) >> 2];
+                    c[(r + 12) >> 2] = c[(F + 12) >> 2];
+                    y = (G + 24) | 0;
+                    x = (G + 40) | 0;
+                    n = 0.0;
+                    m = 0.0;
+                  } else {
+                    M = n - m;
+                    L = +C(+(q + M * M));
+                    w = c[((c[((c[(b + 60) >> 2] | 0) + 16) >> 2] | 0) + 248) >> 2] | 0;
+                    N = +(((O(w, (e + -1) | 0) | 0) / 2) | 0 | 0);
+                    q = (s * N) / L;
+                    h[t >> 3] = q + m;
+                    m = (M * N) / L;
+                    y = (G + 24) | 0;
+                    h[y >> 3] = m + o;
+                    h[r >> 3] = q + n;
+                    x = (G + 40) | 0;
+                    h[x >> 3] = p + m;
+                    m = +((0 - w) | 0);
+                    n = (M * m) / L;
+                    m = (s * m) / L;
+                  }
+                  f = (f | 0) == 6;
+                  u = (D + 4) | 0;
+                  v = (B + 4) | 0;
+                  j = 0;
+                  while (1) {
+                    if ((j | 0) >= (e | 0)) break a;
+                    w = c[(d + (j << 2)) >> 2] | 0;
+                    k = (w + -48) | 0;
+                    b: do
+                      if ((c[((((c[w >> 2] & 3) | 0) == 2 ? w : k) + 40) >> 2] | 0) == (E | 0)) {
+                        c[I >> 2] = c[G >> 2];
+                        c[(I + 4) >> 2] = c[(G + 4) >> 2];
+                        c[(I + 8) >> 2] = c[(G + 8) >> 2];
+                        c[(I + 12) >> 2] = c[(G + 12) >> 2];
+                        c[J >> 2] = c[F >> 2];
+                        c[(J + 4) >> 2] = c[(F + 4) >> 2];
+                        c[(J + 8) >> 2] = c[(F + 8) >> 2];
+                        c[(J + 12) >> 2] = c[(F + 12) >> 2];
+                        i = 0;
+                        while (1) {
+                          if ((i | 0) == 4) break b;
+                          P = (H + (i << 4)) | 0;
+                          Q = (G + (i << 4)) | 0;
+                          c[P >> 2] = c[Q >> 2];
+                          c[(P + 4) >> 2] = c[(Q + 4) >> 2];
+                          c[(P + 8) >> 2] = c[(Q + 8) >> 2];
+                          c[(P + 12) >> 2] = c[(Q + 12) >> 2];
+                          i = (i + 1) | 0;
+                        }
+                      } else {
+                        c[I >> 2] = c[F >> 2];
+                        c[(I + 4) >> 2] = c[(F + 4) >> 2];
+                        c[(I + 8) >> 2] = c[(F + 8) >> 2];
+                        c[(I + 12) >> 2] = c[(F + 12) >> 2];
+                        c[J >> 2] = c[G >> 2];
+                        c[(J + 4) >> 2] = c[(G + 4) >> 2];
+                        c[(J + 8) >> 2] = c[(G + 8) >> 2];
+                        c[(J + 12) >> 2] = c[(G + 12) >> 2];
+                        i = 0;
+                        while (1) {
+                          if ((i | 0) == 4) break b;
+                          Q = (H + ((3 - i) << 4)) | 0;
+                          P = (G + (i << 4)) | 0;
+                          c[Q >> 2] = c[P >> 2];
+                          c[(Q + 4) >> 2] = c[(P + 4) >> 2];
+                          c[(Q + 8) >> 2] = c[(P + 8) >> 2];
+                          c[(Q + 12) >> 2] = c[(P + 12) >> 2];
+                          i = (i + 1) | 0;
+                        }
+                      }
+                    while (0);
+                    if (f) {
+                      c[u >> 2] = 4;
+                      c[D >> 2] = z;
+                      i = 0;
+                      while (1) {
+                        if ((i | 0) == 4) break;
+                        Q = (z + (i << 4)) | 0;
+                        P = (H + (i << 4)) | 0;
+                        c[Q >> 2] = c[P >> 2];
+                        c[(Q + 4) >> 2] = c[(P + 4) >> 2];
+                        c[(Q + 8) >> 2] = c[(P + 8) >> 2];
+                        c[(Q + 12) >> 2] = c[(P + 12) >> 2];
+                        i = (i + 1) | 0;
+                      }
+                      c[A >> 2] = c[D >> 2];
+                      c[(A + 4) >> 2] = c[(D + 4) >> 2];
+                      FY(A, B);
+                      dO(w, c[((((c[w >> 2] & 3) | 0) == 2 ? w : k) + 40) >> 2] | 0, c[B >> 2] | 0, c[v >> 2] | 0, g);
+                    } else dO(w, c[((((c[w >> 2] & 3) | 0) == 2 ? w : k) + 40) >> 2] | 0, H, 4, g);
+                    c[z >> 2] = c[I >> 2];
+                    c[(z + 4) >> 2] = c[(I + 4) >> 2];
+                    c[(z + 8) >> 2] = c[(I + 8) >> 2];
+                    c[(z + 12) >> 2] = c[(I + 12) >> 2];
+                    c[A >> 2] = c[J >> 2];
+                    c[(A + 4) >> 2] = c[(J + 4) >> 2];
+                    c[(A + 8) >> 2] = c[(J + 8) >> 2];
+                    c[(A + 12) >> 2] = c[(J + 12) >> 2];
+                    yO(b, w, z, A);
+                    h[t >> 3] = +h[t >> 3] + m;
+                    h[y >> 3] = +h[y >> 3] + n;
+                    h[r >> 3] = +h[r >> 3] + m;
+                    h[x >> 3] = +h[x >> 3] + n;
+                    j = (j + 1) | 0;
+                  }
+                } else {
+                  if ((f | 0) == 4) {
+                    RM(i, b);
+                    c[A >> 2] = c[i >> 2];
+                    c[(A + 4) >> 2] = c[(i + 4) >> 2];
+                    c[(A + 8) >> 2] = c[(i + 8) >> 2];
+                    c[(A + 12) >> 2] = c[(i + 12) >> 2];
+                    SM(G, A);
+                  }
+                  dO(j, c[((((c[j >> 2] & 3) | 0) == 2 ? j : k) + 40) >> 2] | 0, G, 4, g);
+                  c[z >> 2] = c[I >> 2];
+                  c[(z + 4) >> 2] = c[(I + 4) >> 2];
+                  c[(z + 8) >> 2] = c[(I + 8) >> 2];
+                  c[(z + 12) >> 2] = c[(I + 12) >> 2];
+                  c[A >> 2] = c[J >> 2];
+                  c[(A + 4) >> 2] = c[(J + 4) >> 2];
+                  c[(A + 8) >> 2] = c[(J + 8) >> 2];
+                  c[(A + 12) >> 2] = c[(J + 12) >> 2];
+                  yO(b, j, z, A);
+                }
+              while (0);
+              l = K;
+              return;
+            }
+            function QM(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0;
+              d = +h[(c + 8) >> 3] + +h[(b + 8) >> 3];
+              h[a >> 3] = +h[c >> 3] + +h[b >> 3];
+              h[(a + 8) >> 3] = d;
+              return;
+            }
+            function RM(a, b) {
+              a = a | 0;
+              b = b | 0;
+              b = c[(b + 16) >> 2] | 0;
+              h[23305] = (+h[(b + 32) >> 3] + +h[(b + 16) >> 3]) * 0.5;
+              h[23306] = (+h[(b + 40) >> 3] + +h[(b + 24) >> 3]) * 0.5;
+              c[a >> 2] = c[46610];
+              c[(a + 4) >> 2] = c[46611];
+              c[(a + 8) >> 2] = c[46612];
+              c[(a + 12) >> 2] = c[46613];
+              return;
+            }
+            function SM(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0,
+                d = 0.0,
+                e = 0.0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0;
+              f = +h[a >> 3];
+              d = +h[(a + 48) >> 3];
+              i = (d + f) * 0.5;
+              g = +h[(a + 8) >> 3];
+              c = +h[(a + 56) >> 3];
+              e = (c + g) * 0.5;
+              f = d - f;
+              g = c - g;
+              f = +C(+(g * g + f * f)) * 0.2;
+              g = +h[b >> 3] - i;
+              c = +h[(b + 8) >> 3] - e;
+              d = +C(+(c * c + g * g));
+              if (!(d == 0.0)) {
+                g = i - (g / d) * f;
+                i = e - (c / d) * f;
+                h[(a + 32) >> 3] = g;
+                h[(a + 16) >> 3] = g;
+                h[(a + 40) >> 3] = i;
+                h[(a + 24) >> 3] = i;
+              }
+              return;
+            }
+            function TM(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0.0,
+                n = 0,
+                o = 0.0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                D = 0,
+                E = 0,
+                F = 0.0,
+                G = 0,
+                H = 0.0,
+                I = 0.0,
+                J = 0.0;
+              E = l;
+              l = (l + 208) | 0;
+              t = (E + 192) | 0;
+              s = (E + 176) | 0;
+              B = (E + 32) | 0;
+              w = (E + 16) | 0;
+              x = E;
+              y = (E + 160) | 0;
+              z = (E + 144) | 0;
+              u = (E + 128) | 0;
+              v = (E + 112) | 0;
+              g = e & 2130706432;
+              A = ((e & 8) | 0) == 0 ? ((g | 0) == 0 ? 4 : g) : 8;
+              if ((A | 0) == 436207616) UM(a, b, d, f);
+              else {
+                D = JK(((d << 6) + 64) | 0) | 0;
+                p = (d + -1) | 0;
+                q = (x + 8) | 0;
+                r = (w + 8) | 0;
+                o = 12.0;
+                e = 0;
+                while (1) {
+                  if ((e | 0) >= (d | 0)) break;
+                  n = (b + (e << 4)) | 0;
+                  c[w >> 2] = c[n >> 2];
+                  c[(w + 4) >> 2] = c[(n + 4) >> 2];
+                  c[(w + 8) >> 2] = c[(n + 8) >> 2];
+                  c[(w + 12) >> 2] = c[(n + 12) >> 2];
+                  if ((e | 0) < (p | 0)) {
+                    e = (e + 1) | 0;
+                    n = (b + (e << 4)) | 0;
+                    c[x >> 2] = c[n >> 2];
+                    c[(x + 4) >> 2] = c[(n + 4) >> 2];
+                    c[(x + 8) >> 2] = c[(n + 8) >> 2];
+                    c[(x + 12) >> 2] = c[(n + 12) >> 2];
+                  } else {
+                    c[x >> 2] = c[b >> 2];
+                    c[(x + 4) >> 2] = c[(b + 4) >> 2];
+                    c[(x + 8) >> 2] = c[(b + 8) >> 2];
+                    c[(x + 12) >> 2] = c[(b + 12) >> 2];
+                    e = (e + 1) | 0;
+                  }
+                  m = +h[x >> 3] - +h[w >> 3];
+                  F = +h[q >> 3] - +h[r >> 3];
+                  m = +C(+(F * F + m * m)) * 0.3333333333333333;
+                  o = o < m ? o : m;
+                }
+                k = (g | 16777216 | 0) == 83886080;
+                n = (A | 0) == 4;
+                j = (g | 0) == 16777216;
+                e = 0;
+                i = 0;
+                while (1) {
+                  if ((i | 0) >= (d | 0)) break;
+                  g = (b + (i << 4)) | 0;
+                  c[w >> 2] = c[g >> 2];
+                  c[(w + 4) >> 2] = c[(g + 4) >> 2];
+                  c[(w + 8) >> 2] = c[(g + 8) >> 2];
+                  c[(w + 12) >> 2] = c[(g + 12) >> 2];
+                  if ((i | 0) < (p | 0)) {
+                    g = (b + ((i + 1) << 4)) | 0;
+                    c[x >> 2] = c[g >> 2];
+                    c[(x + 4) >> 2] = c[(g + 4) >> 2];
+                    c[(x + 8) >> 2] = c[(g + 8) >> 2];
+                    c[(x + 12) >> 2] = c[(g + 12) >> 2];
+                  } else {
+                    c[x >> 2] = c[b >> 2];
+                    c[(x + 4) >> 2] = c[(b + 4) >> 2];
+                    c[(x + 8) >> 2] = c[(b + 8) >> 2];
+                    c[(x + 12) >> 2] = c[(b + 12) >> 2];
+                  }
+                  m = +h[x >> 3] - +h[w >> 3];
+                  F = +h[q >> 3] - +h[r >> 3];
+                  m = o / +C(+(F * F + m * m));
+                  m = k ? m * 0.3333333333333333 : j ? m * 0.5 : m;
+                  g = (D + (e << 4)) | 0;
+                  if (n) {
+                    c[s >> 2] = c[w >> 2];
+                    c[(s + 4) >> 2] = c[(w + 4) >> 2];
+                    c[(s + 8) >> 2] = c[(w + 8) >> 2];
+                    c[(s + 12) >> 2] = c[(w + 12) >> 2];
+                    c[t >> 2] = c[x >> 2];
+                    c[(t + 4) >> 2] = c[(x + 4) >> 2];
+                    c[(t + 8) >> 2] = c[(x + 8) >> 2];
+                    c[(t + 12) >> 2] = c[(x + 12) >> 2];
+                    VM(y, m * 0.5, s, t);
+                    c[g >> 2] = c[y >> 2];
+                    c[(g + 4) >> 2] = c[(y + 4) >> 2];
+                    c[(g + 8) >> 2] = c[(y + 8) >> 2];
+                    c[(g + 12) >> 2] = c[(y + 12) >> 2];
+                  } else {
+                    c[g >> 2] = c[w >> 2];
+                    c[(g + 4) >> 2] = c[(w + 4) >> 2];
+                    c[(g + 8) >> 2] = c[(w + 8) >> 2];
+                    c[(g + 12) >> 2] = c[(w + 12) >> 2];
+                  }
+                  g = (D + ((e + 1) << 4)) | 0;
+                  c[s >> 2] = c[w >> 2];
+                  c[(s + 4) >> 2] = c[(w + 4) >> 2];
+                  c[(s + 8) >> 2] = c[(w + 8) >> 2];
+                  c[(s + 12) >> 2] = c[(w + 12) >> 2];
+                  c[t >> 2] = c[x >> 2];
+                  c[(t + 4) >> 2] = c[(x + 4) >> 2];
+                  c[(t + 8) >> 2] = c[(x + 8) >> 2];
+                  c[(t + 12) >> 2] = c[(x + 12) >> 2];
+                  VM(z, m, s, t);
+                  c[g >> 2] = c[z >> 2];
+                  c[(g + 4) >> 2] = c[(z + 4) >> 2];
+                  c[(g + 8) >> 2] = c[(z + 8) >> 2];
+                  c[(g + 12) >> 2] = c[(z + 12) >> 2];
+                  g = (e + 3) | 0;
+                  G = (D + ((e + 2) << 4)) | 0;
+                  c[s >> 2] = c[w >> 2];
+                  c[(s + 4) >> 2] = c[(w + 4) >> 2];
+                  c[(s + 8) >> 2] = c[(w + 8) >> 2];
+                  c[(s + 12) >> 2] = c[(w + 12) >> 2];
+                  c[t >> 2] = c[x >> 2];
+                  c[(t + 4) >> 2] = c[(x + 4) >> 2];
+                  c[(t + 8) >> 2] = c[(x + 8) >> 2];
+                  c[(t + 12) >> 2] = c[(x + 12) >> 2];
+                  VM(u, 1.0 - m, s, t);
+                  c[G >> 2] = c[u >> 2];
+                  c[(G + 4) >> 2] = c[(u + 4) >> 2];
+                  c[(G + 8) >> 2] = c[(u + 8) >> 2];
+                  c[(G + 12) >> 2] = c[(u + 12) >> 2];
+                  if (n) {
+                    G = (D + (g << 4)) | 0;
+                    c[s >> 2] = c[w >> 2];
+                    c[(s + 4) >> 2] = c[(w + 4) >> 2];
+                    c[(s + 8) >> 2] = c[(w + 8) >> 2];
+                    c[(s + 12) >> 2] = c[(w + 12) >> 2];
+                    c[t >> 2] = c[x >> 2];
+                    c[(t + 4) >> 2] = c[(x + 4) >> 2];
+                    c[(t + 8) >> 2] = c[(x + 8) >> 2];
+                    c[(t + 12) >> 2] = c[(x + 12) >> 2];
+                    VM(v, 1.0 - m * 0.5, s, t);
+                    c[G >> 2] = c[v >> 2];
+                    c[(G + 4) >> 2] = c[(v + 4) >> 2];
+                    c[(G + 8) >> 2] = c[(v + 8) >> 2];
+                    c[(G + 12) >> 2] = c[(v + 12) >> 2];
+                    e = (e + 4) | 0;
+                  } else e = g;
+                  i = (i + 1) | 0;
+                }
+                k = (D + (e << 4)) | 0;
+                c[k >> 2] = c[D >> 2];
+                c[(k + 4) >> 2] = c[(D + 4) >> 2];
+                c[(k + 8) >> 2] = c[(D + 8) >> 2];
+                c[(k + 12) >> 2] = c[(D + 12) >> 2];
+                k = (D + ((e + 1) << 4)) | 0;
+                j = (D + 16) | 0;
+                c[k >> 2] = c[j >> 2];
+                c[(k + 4) >> 2] = c[(j + 4) >> 2];
+                c[(k + 8) >> 2] = c[(j + 8) >> 2];
+                c[(k + 12) >> 2] = c[(j + 12) >> 2];
+                e = (D + ((e + 2) << 4)) | 0;
+                k = (D + 32) | 0;
+                c[e >> 2] = c[k >> 2];
+                c[(e + 4) >> 2] = c[(k + 4) >> 2];
+                c[(e + 8) >> 2] = c[(k + 8) >> 2];
+                c[(e + 12) >> 2] = c[(k + 12) >> 2];
+                e = A & 2147483647;
+                a: do
+                  if ((e | 0) < 201326592) {
+                    if ((e | 0) >= 83886080) {
+                      if ((e | 0) < 134217728) {
+                        if ((e | 0) < 100663296) {
+                          switch (e | 0) {
+                            case 83886080:
+                              break;
+                            default:
+                              break a;
+                          }
+                          if ((d | 0) == 4) {
+                            G = JK(192) | 0;
+                            c[G >> 2] = c[b >> 2];
+                            c[(G + 4) >> 2] = c[(b + 4) >> 2];
+                            c[(G + 8) >> 2] = c[(b + 8) >> 2];
+                            c[(G + 12) >> 2] = c[(b + 12) >> 2];
+                            p = (G + 16) | 0;
+                            t = (b + 16) | 0;
+                            c[p >> 2] = c[t >> 2];
+                            c[(p + 4) >> 2] = c[(t + 4) >> 2];
+                            c[(p + 8) >> 2] = c[(t + 8) >> 2];
+                            c[(p + 12) >> 2] = c[(t + 12) >> 2];
+                            p = (D + 48) | 0;
+                            t = (D + 64) | 0;
+                            o = +h[t >> 3];
+                            n = (G + 32) | 0;
+                            h[n >> 3] = o;
+                            q = (D + 56) | 0;
+                            r = (D + 72) | 0;
+                            H = +h[r >> 3];
+                            z = (G + 40) | 0;
+                            h[z >> 3] = H;
+                            F = +h[p >> 3] + o - +h[k >> 3];
+                            u = (G + 48) | 0;
+                            h[u >> 3] = F;
+                            J = +h[q >> 3] + H - +h[(D + 40) >> 3];
+                            x = (G + 56) | 0;
+                            h[x >> 3] = J;
+                            I = +h[t >> 3] + F - +h[p >> 3];
+                            p = (G + 64) | 0;
+                            h[p >> 3] = I;
+                            m = +h[r >> 3] + J - +h[q >> 3];
+                            q = (G + 72) | 0;
+                            h[q >> 3] = m;
+                            r = (G + 80) | 0;
+                            h[r >> 3] = o + I - F;
+                            h[(G + 88) >> 3] = H + m - J;
+                            t = (D + 96) | 0;
+                            v = (D + 80) | 0;
+                            J = +h[v >> 3];
+                            d = (G + 144) | 0;
+                            h[d >> 3] = J;
+                            w = (D + 104) | 0;
+                            s = (D + 88) | 0;
+                            m = +h[s >> 3];
+                            h[(G + 152) >> 3] = m;
+                            H = +h[t >> 3] + J - +h[(D + 112) >> 3];
+                            y = (G + 128) | 0;
+                            h[y >> 3] = H;
+                            F = +h[w >> 3] + m - +h[(D + 120) >> 3];
+                            A = (G + 136) | 0;
+                            h[A >> 3] = F;
+                            I = +h[v >> 3] + H - +h[t >> 3];
+                            t = (G + 112) | 0;
+                            h[t >> 3] = I;
+                            o = +h[s >> 3] + F - +h[w >> 3];
+                            w = (G + 120) | 0;
+                            h[w >> 3] = o;
+                            s = (G + 96) | 0;
+                            h[s >> 3] = J + I - H;
+                            v = (G + 104) | 0;
+                            h[v >> 3] = m + o - F;
+                            k = (G + 160) | 0;
+                            j = (b + 32) | 0;
+                            c[k >> 2] = c[j >> 2];
+                            c[(k + 4) >> 2] = c[(j + 4) >> 2];
+                            c[(k + 8) >> 2] = c[(j + 8) >> 2];
+                            c[(k + 12) >> 2] = c[(j + 12) >> 2];
+                            k = (G + 176) | 0;
+                            b = (b + 48) | 0;
+                            c[k >> 2] = c[b >> 2];
+                            c[(k + 4) >> 2] = c[(b + 4) >> 2];
+                            c[(k + 8) >> 2] = c[(b + 8) >> 2];
+                            c[(k + 12) >> 2] = c[(b + 12) >> 2];
+                            nS(a, G, 12, f);
+                            c[B >> 2] = c[n >> 2];
+                            c[(B + 4) >> 2] = c[(n + 4) >> 2];
+                            c[(B + 8) >> 2] = c[(n + 8) >> 2];
+                            c[(B + 12) >> 2] = c[(n + 12) >> 2];
+                            F = +h[n >> 3];
+                            o = +h[u >> 3];
+                            F = F + F - o;
+                            u = (B + 16) | 0;
+                            h[u >> 3] = F;
+                            m = +h[z >> 3];
+                            H = +h[x >> 3];
+                            m = m + m - H;
+                            x = (B + 24) | 0;
+                            h[x >> 3] = m;
+                            z = (B + 32) | 0;
+                            h[z >> 3] = +h[p >> 3] + F - o;
+                            b = (B + 40) | 0;
+                            h[b >> 3] = +h[q >> 3] + m - H;
+                            f = (B + 48) | 0;
+                            c[f >> 2] = c[r >> 2];
+                            c[(f + 4) >> 2] = c[(r + 4) >> 2];
+                            c[(f + 8) >> 2] = c[(r + 8) >> 2];
+                            c[(f + 12) >> 2] = c[(r + 12) >> 2];
+                            qS(a, B, 4);
+                            c[B >> 2] = c[s >> 2];
+                            c[(B + 4) >> 2] = c[(s + 4) >> 2];
+                            c[(B + 8) >> 2] = c[(s + 8) >> 2];
+                            c[(B + 12) >> 2] = c[(s + 12) >> 2];
+                            H = +h[s >> 3];
+                            m = +h[t >> 3];
+                            H = H - (m - H);
+                            h[u >> 3] = H;
+                            o = +h[v >> 3];
+                            F = +h[w >> 3];
+                            o = o - (F - o);
+                            h[x >> 3] = o;
+                            h[z >> 3] = +h[y >> 3] + H - m;
+                            h[b >> 3] = +h[A >> 3] + o - F;
+                            c[f >> 2] = c[d >> 2];
+                            c[(f + 4) >> 2] = c[(d + 4) >> 2];
+                            c[(f + 8) >> 2] = c[(d + 8) >> 2];
+                            c[(f + 12) >> 2] = c[(d + 12) >> 2];
+                            qS(a, B, 4);
+                            U1(G);
+                            break;
+                          } else qa(105438, 105449, 737, 105458);
+                        }
+                        if ((e | 0) < 117440512) {
+                          switch (e | 0) {
+                            case 100663296:
+                              break;
+                            default:
+                              break a;
+                          }
+                          y = (d + 5) | 0;
+                          G = JK(y << 4) | 0;
+                          z = (b + 16) | 0;
+                          H = +h[z >> 3];
+                          H = (+h[b >> 3] - H) * 0.625 + H;
+                          h[G >> 3] = H;
+                          A = (b + 40) | 0;
+                          J = +h[A >> 3];
+                          d = (b + 24) | 0;
+                          v = (D + 48) | 0;
+                          w = (D + 56) | 0;
+                          x = (D + 72) | 0;
+                          J = (+h[d >> 3] - J) * 0.5 + J + (+h[w >> 3] - +h[x >> 3]) * 1.5;
+                          h[(G + 8) >> 3] = J;
+                          I = +h[z >> 3];
+                          I = (+h[b >> 3] - I) * 0.25 + I;
+                          h[(G + 16) >> 3] = I;
+                          h[(G + 24) >> 3] = J;
+                          h[(G + 32) >> 3] = I;
+                          F = +h[A >> 3];
+                          h[(G + 40) >> 3] = (+h[d >> 3] - F) * 0.5 + F;
+                          I = (+h[k >> 3] - +h[v >> 3]) * 0.5 + I;
+                          h[(G + 48) >> 3] = I;
+                          F = +h[A >> 3];
+                          h[(G + 56) >> 3] = (+h[d >> 3] - F) * 0.5 + F;
+                          h[(G + 64) >> 3] = I;
+                          I = +h[A >> 3];
+                          I = (+h[d >> 3] - I) * 0.5 + I + (+h[w >> 3] - +h[x >> 3]);
+                          h[(G + 72) >> 3] = I;
+                          h[(G + 80) >> 3] = H;
+                          h[(G + 88) >> 3] = I;
+                          h[(G + 96) >> 3] = H;
+                          I = I - (+h[w >> 3] - +h[x >> 3]) * 0.25;
+                          h[(G + 104) >> 3] = I;
+                          h[(G + 112) >> 3] = +h[k >> 3] + H - +h[v >> 3];
+                          h[(G + 120) >> 3] = (+h[w >> 3] - +h[x >> 3]) * 0.5 + I;
+                          h[(G + 128) >> 3] = +h[G >> 3];
+                          h[(G + 136) >> 3] = (+h[w >> 3] - +h[x >> 3]) * 0.25 + J;
+                          nS(a, G, y, f);
+                          h[B >> 3] = +h[z >> 3];
+                          J = +h[A >> 3];
+                          h[(B + 8) >> 3] = (+h[d >> 3] - J) * 0.5 + J;
+                          h[(B + 16) >> 3] = +h[b >> 3];
+                          h[(B + 24) >> 3] = (+h[(b + 8) >> 3] - +h[(b + 56) >> 3]) * 0.5 + J;
+                          qS(a, B, 2);
+                          U1(G);
+                          break;
+                        } else {
+                          switch (e | 0) {
+                            case 117440512:
+                              break;
+                            default:
+                              break a;
+                          }
+                          d = (d + 1) | 0;
+                          G = JK(d << 4) | 0;
+                          h[G >> 3] = +h[j >> 3];
+                          z = (D + 56) | 0;
+                          A = (D + 72) | 0;
+                          h[(G + 8) >> 3] = +h[(D + 24) >> 3] - (+h[z >> 3] - +h[A >> 3]) * 0.5;
+                          h[(G + 16) >> 3] = +h[(D + 48) >> 3];
+                          J = +h[z >> 3];
+                          h[(G + 24) >> 3] = J - (J - +h[A >> 3]) * 0.5;
+                          h[(G + 32) >> 3] = +h[(b + 32) >> 3];
+                          B = (b + 40) | 0;
+                          h[(G + 40) >> 3] = (+h[z >> 3] - +h[A >> 3]) * 0.5 + +h[B >> 3];
+                          h[(G + 48) >> 3] = +h[j >> 3];
+                          h[(G + 56) >> 3] = (+h[z >> 3] - +h[A >> 3]) * 0.5 + +h[B >> 3];
+                          J = +h[(b + 8) >> 3];
+                          h[(G + 72) >> 3] = J - (J - +h[(b + 56) >> 3]) * 0.5;
+                          h[(G + 64) >> 3] = +h[b >> 3];
+                          nS(a, G, d, f);
+                          U1(G);
+                          break;
+                        }
+                      }
+                      if ((e | 0) < 167772160)
+                        if ((e | 0) < 150994944) {
+                          switch (e | 0) {
+                            case 134217728:
+                              break;
+                            default:
+                              break a;
+                          }
+                          y = (d + 4) | 0;
+                          G = JK(y << 4) | 0;
+                          z = (b + 16) | 0;
+                          F = +h[z >> 3];
+                          x = (D + 48) | 0;
+                          F = (+h[b >> 3] - F) * 0.5 + F + (+h[k >> 3] - +h[x >> 3]) * 0.25;
+                          h[G >> 3] = F;
+                          A = (b + 40) | 0;
+                          J = +h[A >> 3];
+                          d = (b + 24) | 0;
+                          J = (+h[d >> 3] - J) * 0.5 + J;
+                          h[(G + 8) >> 3] = J;
+                          h[(G + 16) >> 3] = F;
+                          v = (D + 56) | 0;
+                          w = (D + 72) | 0;
+                          H = (+h[v >> 3] - +h[w >> 3]) * 0.5 + J;
+                          h[(G + 24) >> 3] = H;
+                          F = (+h[k >> 3] - +h[x >> 3]) * 0.5 + F;
+                          h[(G + 32) >> 3] = F;
+                          h[(G + 40) >> 3] = H;
+                          h[(G + 48) >> 3] = F;
+                          F = (+h[v >> 3] - +h[w >> 3]) * 0.5 + H;
+                          h[(G + 56) >> 3] = F;
+                          I = +h[z >> 3];
+                          I = (+h[b >> 3] - I) * 0.5 + I + (+h[k >> 3] - +h[x >> 3]) * -0.75;
+                          h[(G + 64) >> 3] = I;
+                          h[(G + 72) >> 3] = F;
+                          h[(G + 80) >> 3] = I;
+                          h[(G + 88) >> 3] = H;
+                          I = +h[z >> 3];
+                          I = (+h[b >> 3] - I) * 0.5 + I + (+h[k >> 3] - +h[x >> 3]) * -0.25;
+                          h[(G + 96) >> 3] = I;
+                          h[(G + 104) >> 3] = H;
+                          h[(G + 112) >> 3] = I;
+                          h[(G + 120) >> 3] = J;
+                          nS(a, G, y, f);
+                          h[B >> 3] = +h[z >> 3];
+                          J = +h[A >> 3];
+                          h[(B + 8) >> 3] = (+h[d >> 3] - J) * 0.5 + J;
+                          h[(B + 16) >> 3] = +h[b >> 3];
+                          h[(B + 24) >> 3] = (+h[(b + 8) >> 3] - +h[(b + 56) >> 3]) * 0.5 + J;
+                          qS(a, B, 2);
+                          U1(G);
+                          break;
+                        } else {
+                          switch (e | 0) {
+                            case 150994944:
+                              break;
+                            default:
+                              break a;
+                          }
+                          y = (d + 2) | 0;
+                          G = JK(y << 4) | 0;
+                          z = (b + 16) | 0;
+                          H = +h[z >> 3];
+                          x = (D + 48) | 0;
+                          H = (+h[b >> 3] - H) * 0.5 + H + (+h[k >> 3] - +h[x >> 3]) * 0.75;
+                          h[G >> 3] = H;
+                          A = (b + 40) | 0;
+                          J = +h[A >> 3];
+                          d = (b + 24) | 0;
+                          J = (+h[d >> 3] - J) * 0.5 + J;
+                          h[(G + 8) >> 3] = J;
+                          h[(G + 16) >> 3] = H;
+                          v = (D + 56) | 0;
+                          w = (D + 72) | 0;
+                          H = (+h[v >> 3] - +h[w >> 3]) * 0.25 + J;
+                          h[(G + 24) >> 3] = H;
+                          I = +h[z >> 3];
+                          h[(G + 32) >> 3] = (+h[b >> 3] - I) * 0.5 + I + (+h[k >> 3] - +h[x >> 3]) * 0.25;
+                          I = (+h[v >> 3] - +h[w >> 3]) * 0.5 + H;
+                          h[(G + 40) >> 3] = I;
+                          F = +h[z >> 3];
+                          h[(G + 48) >> 3] = (+h[b >> 3] - F) * 0.5 + F + (+h[k >> 3] - +h[x >> 3]) * -0.25;
+                          h[(G + 56) >> 3] = I;
+                          I = +h[z >> 3];
+                          I = (+h[b >> 3] - I) * 0.5 + I + (+h[k >> 3] - +h[x >> 3]) * -0.75;
+                          h[(G + 64) >> 3] = I;
+                          h[(G + 72) >> 3] = H;
+                          h[(G + 80) >> 3] = I;
+                          h[(G + 88) >> 3] = J;
+                          nS(a, G, y, f);
+                          h[B >> 3] = +h[z >> 3];
+                          J = +h[A >> 3];
+                          h[(B + 8) >> 3] = (+h[d >> 3] - J) * 0.5 + J;
+                          h[(B + 16) >> 3] = +h[b >> 3];
+                          h[(B + 24) >> 3] = (+h[(b + 8) >> 3] - +h[(b + 56) >> 3]) * 0.5 + J;
+                          qS(a, B, 2);
+                          U1(G);
+                          break;
+                        }
+                      else if ((e | 0) < 184549376) {
+                        switch (e | 0) {
+                          case 167772160:
+                            break;
+                          default:
+                            break a;
+                        }
+                        y = (d + 1) | 0;
+                        G = JK(y << 4) | 0;
+                        z = (b + 16) | 0;
+                        H = +h[z >> 3];
+                        v = (D + 48) | 0;
+                        H = +h[k >> 3] + H + (+h[b >> 3] - H) * 0.5 - +h[v >> 3];
+                        h[G >> 3] = H;
+                        A = (b + 40) | 0;
+                        J = +h[A >> 3];
+                        d = (b + 24) | 0;
+                        w = (D + 56) | 0;
+                        x = (D + 72) | 0;
+                        J = (+h[d >> 3] - J) * 0.5 + J + (+h[w >> 3] - +h[x >> 3]) * 0.25;
+                        h[(G + 8) >> 3] = J;
+                        H = H - +h[k >> 3] + +h[v >> 3];
+                        h[(G + 16) >> 3] = H;
+                        h[(G + 24) >> 3] = +h[w >> 3] + J - +h[x >> 3];
+                        h[(G + 32) >> 3] = H;
+                        H = (+h[w >> 3] - +h[x >> 3]) * 0.5 + J;
+                        h[(G + 40) >> 3] = H;
+                        I = +h[z >> 3];
+                        I = (+h[b >> 3] - I) * 0.25 + I;
+                        h[(G + 48) >> 3] = I;
+                        h[(G + 56) >> 3] = H;
+                        h[(G + 64) >> 3] = I;
+                        h[(G + 72) >> 3] = J;
+                        nS(a, G, y, f);
+                        h[B >> 3] = +h[z >> 3];
+                        J = +h[A >> 3];
+                        h[(B + 8) >> 3] = (+h[d >> 3] - J) * 0.5 + J;
+                        h[(B + 16) >> 3] = +h[b >> 3];
+                        h[(B + 24) >> 3] = (+h[(b + 8) >> 3] - +h[(b + 56) >> 3]) * 0.5 + J;
+                        qS(a, B, 2);
+                        U1(G);
+                        break;
+                      } else {
+                        switch (e | 0) {
+                          case 184549376:
+                            break;
+                          default:
+                            break a;
+                        }
+                        z = (d + 4) | 0;
+                        G = JK(z << 4) | 0;
+                        y = (b + 16) | 0;
+                        H = +h[y >> 3];
+                        I = +h[b >> 3] - H;
+                        u = (D + 48) | 0;
+                        I = I * 0.125 + H + (+h[k >> 3] - +h[u >> 3] + I) * 0.5;
+                        h[G >> 3] = I;
+                        w = (b + 40) | 0;
+                        H = +h[w >> 3];
+                        x = (b + 24) | 0;
+                        d = (D + 56) | 0;
+                        v = (D + 72) | 0;
+                        H = (+h[x >> 3] - H) * 0.5 + H + (+h[d >> 3] - +h[v >> 3]) * 0.25;
+                        h[(G + 8) >> 3] = H;
+                        J = +h[y >> 3];
+                        J = (+h[b >> 3] - J) * 0.375 + J;
+                        h[(G + 16) >> 3] = J;
+                        h[(G + 24) >> 3] = H;
+                        h[(G + 32) >> 3] = J;
+                        H = (+h[d >> 3] - +h[v >> 3]) * 0.5 + H;
+                        h[(G + 40) >> 3] = H;
+                        J = J - (+h[k >> 3] - +h[u >> 3]) * 0.5;
+                        h[(G + 48) >> 3] = J;
+                        h[(G + 56) >> 3] = H;
+                        A = (G + 64) | 0;
+                        h[A >> 3] = J;
+                        J = +h[w >> 3];
+                        J = (+h[x >> 3] - J) * 0.5 + J + (+h[d >> 3] - +h[v >> 3]) * -0.25;
+                        h[(G + 72) >> 3] = J;
+                        H = I - (+h[k >> 3] - +h[u >> 3]) * 0.5;
+                        h[(G + 80) >> 3] = H;
+                        h[(G + 88) >> 3] = J;
+                        h[(G + 96) >> 3] = H;
+                        J = J - (+h[d >> 3] - +h[v >> 3]) * 0.5;
+                        h[(G + 104) >> 3] = J;
+                        v = (G + 112) | 0;
+                        h[v >> 3] = I;
+                        h[(G + 120) >> 3] = J;
+                        nS(a, G, z, f);
+                        h[B >> 3] = +h[y >> 3];
+                        J = +h[w >> 3];
+                        y = (B + 8) | 0;
+                        h[y >> 3] = (+h[x >> 3] - J) * 0.5 + J;
+                        z = (B + 16) | 0;
+                        h[z >> 3] = +h[A >> 3];
+                        A = (b + 8) | 0;
+                        d = (b + 56) | 0;
+                        f = (B + 24) | 0;
+                        h[f >> 3] = (+h[A >> 3] - +h[d >> 3]) * 0.5 + J;
+                        qS(a, B, 2);
+                        h[B >> 3] = +h[v >> 3];
+                        J = +h[w >> 3];
+                        h[y >> 3] = (+h[x >> 3] - J) * 0.5 + J;
+                        h[z >> 3] = +h[b >> 3];
+                        h[f >> 3] = (+h[A >> 3] - +h[d >> 3]) * 0.5 + J;
+                        qS(a, B, 2);
+                        U1(G);
+                        break;
+                      }
+                    }
+                    if ((e | 0) < 33554432) {
+                      if ((e | 0) < 8) {
+                        switch (e | 0) {
+                          case 4:
+                            break;
+                          default:
+                            break a;
+                        }
+                        i = KK((((d * 96) | 0) + 32) | 0) | 0;
+                        e = 0;
+                        g = 0;
+                        while (1) {
+                          j = g | 1;
+                          k = (i + (g << 4)) | 0;
+                          if ((e | 0) >= (d | 0)) break;
+                          b = e << 2;
+                          G = (D + (b << 4)) | 0;
+                          c[k >> 2] = c[G >> 2];
+                          c[(k + 4) >> 2] = c[(G + 4) >> 2];
+                          c[(k + 8) >> 2] = c[(G + 8) >> 2];
+                          c[(k + 12) >> 2] = c[(G + 12) >> 2];
+                          G = (i + (j << 4)) | 0;
+                          B = (D + ((b | 1) << 4)) | 0;
+                          c[G >> 2] = c[B >> 2];
+                          c[(G + 4) >> 2] = c[(B + 4) >> 2];
+                          c[(G + 8) >> 2] = c[(B + 8) >> 2];
+                          c[(G + 12) >> 2] = c[(B + 12) >> 2];
+                          G = (i + ((g + 2) << 4)) | 0;
+                          c[G >> 2] = c[B >> 2];
+                          c[(G + 4) >> 2] = c[(B + 4) >> 2];
+                          c[(G + 8) >> 2] = c[(B + 8) >> 2];
+                          c[(G + 12) >> 2] = c[(B + 12) >> 2];
+                          G = (i + ((g + 3) << 4)) | 0;
+                          B = (D + ((b | 2) << 4)) | 0;
+                          c[G >> 2] = c[B >> 2];
+                          c[(G + 4) >> 2] = c[(B + 4) >> 2];
+                          c[(G + 8) >> 2] = c[(B + 8) >> 2];
+                          c[(G + 12) >> 2] = c[(B + 12) >> 2];
+                          G = (i + ((g + 4) << 4)) | 0;
+                          c[G >> 2] = c[B >> 2];
+                          c[(G + 4) >> 2] = c[(B + 4) >> 2];
+                          c[(G + 8) >> 2] = c[(B + 8) >> 2];
+                          c[(G + 12) >> 2] = c[(B + 12) >> 2];
+                          G = (i + ((g + 5) << 4)) | 0;
+                          b = (D + ((b | 3) << 4)) | 0;
+                          c[G >> 2] = c[b >> 2];
+                          c[(G + 4) >> 2] = c[(b + 4) >> 2];
+                          c[(G + 8) >> 2] = c[(b + 8) >> 2];
+                          c[(G + 12) >> 2] = c[(b + 12) >> 2];
+                          e = (e + 1) | 0;
+                          g = (g + 6) | 0;
+                        }
+                        c[k >> 2] = c[i >> 2];
+                        c[(k + 4) >> 2] = c[(i + 4) >> 2];
+                        c[(k + 8) >> 2] = c[(i + 8) >> 2];
+                        c[(k + 12) >> 2] = c[(i + 12) >> 2];
+                        d = (i + (j << 4)) | 0;
+                        G = (i + 16) | 0;
+                        c[d >> 2] = c[G >> 2];
+                        c[(d + 4) >> 2] = c[(G + 4) >> 2];
+                        c[(d + 8) >> 2] = c[(G + 8) >> 2];
+                        c[(d + 12) >> 2] = c[(G + 12) >> 2];
+                        pS(a, G, j, 0, 0, f & 255);
+                        U1(i);
+                        break;
+                      }
+                      if ((e | 0) < 16777216) {
+                        switch (e | 0) {
+                          case 8:
+                            break;
+                          default:
+                            break a;
+                        }
+                        nS(a, b, d, f);
+                        g = (B + 16) | 0;
+                        e = 0;
+                        while (1) {
+                          if ((e | 0) >= (d | 0)) break a;
+                          G = (e * 3) | 0;
+                          f = (D + ((G + 2) << 4)) | 0;
+                          c[B >> 2] = c[f >> 2];
+                          c[(B + 4) >> 2] = c[(f + 4) >> 2];
+                          c[(B + 8) >> 2] = c[(f + 8) >> 2];
+                          c[(B + 12) >> 2] = c[(f + 12) >> 2];
+                          G = (D + ((G + 4) << 4)) | 0;
+                          c[g >> 2] = c[G >> 2];
+                          c[(g + 4) >> 2] = c[(G + 4) >> 2];
+                          c[(g + 8) >> 2] = c[(G + 8) >> 2];
+                          c[(g + 12) >> 2] = c[(G + 12) >> 2];
+                          qS(a, B, 2);
+                          e = (e + 1) | 0;
+                        }
+                      }
+                      switch (e | 0) {
+                        case 16777216:
+                          break;
+                        default:
+                          break a;
+                      }
+                      g = (d + 1) | 0;
+                      i = JK(g << 4) | 0;
+                      e = 1;
+                      while (1) {
+                        if ((e | 0) >= (d | 0)) break;
+                        G = (i + (e << 4)) | 0;
+                        A = (b + (e << 4)) | 0;
+                        c[G >> 2] = c[A >> 2];
+                        c[(G + 4) >> 2] = c[(A + 4) >> 2];
+                        c[(G + 8) >> 2] = c[(A + 8) >> 2];
+                        c[(G + 12) >> 2] = c[(A + 12) >> 2];
+                        e = (e + 1) | 0;
+                      }
+                      b = (d * 3) | 0;
+                      A = (D + ((b + 1) << 4)) | 0;
+                      c[i >> 2] = c[A >> 2];
+                      c[(i + 4) >> 2] = c[(A + 4) >> 2];
+                      c[(i + 8) >> 2] = c[(A + 8) >> 2];
+                      c[(i + 12) >> 2] = c[(A + 12) >> 2];
+                      d = (i + (d << 4)) | 0;
+                      G = (D + ((b + -1) << 4)) | 0;
+                      c[d >> 2] = c[G >> 2];
+                      c[(d + 4) >> 2] = c[(G + 4) >> 2];
+                      c[(d + 8) >> 2] = c[(G + 8) >> 2];
+                      c[(d + 12) >> 2] = c[(G + 12) >> 2];
+                      nS(a, i, g, f);
+                      U1(i);
+                      c[B >> 2] = c[G >> 2];
+                      c[(B + 4) >> 2] = c[(G + 4) >> 2];
+                      c[(B + 8) >> 2] = c[(G + 8) >> 2];
+                      c[(B + 12) >> 2] = c[(G + 12) >> 2];
+                      G = (B + 16) | 0;
+                      c[G >> 2] = c[A >> 2];
+                      c[(G + 4) >> 2] = c[(A + 4) >> 2];
+                      c[(G + 8) >> 2] = c[(A + 8) >> 2];
+                      c[(G + 12) >> 2] = c[(A + 12) >> 2];
+                      f = (B + 32) | 0;
+                      h[f >> 3] = +h[B >> 3] + +h[G >> 3] - +h[(D + (b << 4)) >> 3];
+                      h[(B + 40) >> 3] = +h[(B + 8) >> 3] + +h[(B + 24) >> 3] - +h[(D + (b << 4) + 8) >> 3];
+                      qS(a, G, 2);
+                      c[G >> 2] = c[f >> 2];
+                      c[(G + 4) >> 2] = c[(f + 4) >> 2];
+                      c[(G + 8) >> 2] = c[(f + 8) >> 2];
+                      c[(G + 12) >> 2] = c[(f + 12) >> 2];
+                      qS(a, B, 2);
+                      break;
+                    } else {
+                      if ((e | 0) < 50331648) {
+                        switch (e | 0) {
+                          case 33554432:
+                            break;
+                          default:
+                            break a;
+                        }
+                        g = (d + 2) | 0;
+                        i = JK(g << 4) | 0;
+                        c[i >> 2] = c[b >> 2];
+                        c[(i + 4) >> 2] = c[(b + 4) >> 2];
+                        c[(i + 8) >> 2] = c[(b + 8) >> 2];
+                        c[(i + 12) >> 2] = c[(b + 12) >> 2];
+                        j = (i + 16) | 0;
+                        c[j >> 2] = c[k >> 2];
+                        c[(j + 4) >> 2] = c[(k + 4) >> 2];
+                        c[(j + 8) >> 2] = c[(k + 8) >> 2];
+                        c[(j + 12) >> 2] = c[(k + 12) >> 2];
+                        j = (D + 48) | 0;
+                        d = (D + 64) | 0;
+                        h[(i + 32) >> 3] = (+h[j >> 3] - +h[d >> 3]) * 0.3333333333333333 + +h[k >> 3];
+                        G = (D + 56) | 0;
+                        e = (D + 72) | 0;
+                        h[(i + 40) >> 3] = (+h[G >> 3] - +h[e >> 3]) * 0.3333333333333333 + +h[(D + 40) >> 3];
+                        J = +h[j >> 3];
+                        h[(i + 48) >> 3] = (J - +h[d >> 3]) * 0.3333333333333333 + J;
+                        J = +h[G >> 3];
+                        h[(i + 56) >> 3] = (J - +h[e >> 3]) * 0.3333333333333333 + J;
+                        e = 4;
+                        while (1) {
+                          if ((e | 0) >= (g | 0)) break;
+                          G = (i + (e << 4)) | 0;
+                          d = (b + ((e + -2) << 4)) | 0;
+                          c[G >> 2] = c[d >> 2];
+                          c[(G + 4) >> 2] = c[(d + 4) >> 2];
+                          c[(G + 8) >> 2] = c[(d + 8) >> 2];
+                          c[(G + 12) >> 2] = c[(d + 12) >> 2];
+                          e = (e + 1) | 0;
+                        }
+                        nS(a, i, g, f);
+                        U1(i);
+                        c[B >> 2] = c[j >> 2];
+                        c[(B + 4) >> 2] = c[(j + 4) >> 2];
+                        c[(B + 8) >> 2] = c[(j + 8) >> 2];
+                        c[(B + 12) >> 2] = c[(j + 12) >> 2];
+                        G = (B + 16) | 0;
+                        c[G >> 2] = c[k >> 2];
+                        c[(G + 4) >> 2] = c[(k + 4) >> 2];
+                        c[(G + 8) >> 2] = c[(k + 8) >> 2];
+                        c[(G + 12) >> 2] = c[(k + 12) >> 2];
+                        qS(a, B, 2);
+                        break;
+                      }
+                      if ((e | 0) >= 67108864) {
+                        switch (e | 0) {
+                          case 67108864:
+                            break;
+                          default:
+                            break a;
+                        }
+                        if ((d | 0) == 4) {
+                          G = JK(96) | 0;
+                          c[G >> 2] = c[b >> 2];
+                          c[(G + 4) >> 2] = c[(b + 4) >> 2];
+                          c[(G + 8) >> 2] = c[(b + 8) >> 2];
+                          c[(G + 12) >> 2] = c[(b + 12) >> 2];
+                          d = (G + 16) | 0;
+                          c[d >> 2] = c[k >> 2];
+                          c[(d + 4) >> 2] = c[(k + 4) >> 2];
+                          c[(d + 8) >> 2] = c[(k + 8) >> 2];
+                          c[(d + 12) >> 2] = c[(k + 12) >> 2];
+                          d = (G + 32) | 0;
+                          A = (D + 64) | 0;
+                          c[d >> 2] = c[A >> 2];
+                          c[(d + 4) >> 2] = c[(A + 4) >> 2];
+                          c[(d + 8) >> 2] = c[(A + 8) >> 2];
+                          c[(d + 12) >> 2] = c[(A + 12) >> 2];
+                          d = (G + 48) | 0;
+                          b = (b + 32) | 0;
+                          c[d >> 2] = c[b >> 2];
+                          c[(d + 4) >> 2] = c[(b + 4) >> 2];
+                          c[(d + 8) >> 2] = c[(b + 8) >> 2];
+                          c[(d + 12) >> 2] = c[(b + 12) >> 2];
+                          b = (G + 64) | 0;
+                          d = (D + 128) | 0;
+                          c[b >> 2] = c[d >> 2];
+                          c[(b + 4) >> 2] = c[(d + 4) >> 2];
+                          c[(b + 8) >> 2] = c[(d + 8) >> 2];
+                          c[(b + 12) >> 2] = c[(d + 12) >> 2];
+                          b = (G + 80) | 0;
+                          z = (D + 160) | 0;
+                          c[b >> 2] = c[z >> 2];
+                          c[(b + 4) >> 2] = c[(z + 4) >> 2];
+                          c[(b + 8) >> 2] = c[(z + 8) >> 2];
+                          c[(b + 12) >> 2] = c[(z + 12) >> 2];
+                          nS(a, G, 6, f);
+                          U1(G);
+                          h[B >> 3] = +h[(D + 176) >> 3] + +h[j >> 3] - +h[D >> 3];
+                          h[(B + 8) >> 3] = +h[(D + 184) >> 3] + +h[(D + 24) >> 3] - +h[(D + 8) >> 3];
+                          G = (B + 16) | 0;
+                          c[G >> 2] = c[A >> 2];
+                          c[(G + 4) >> 2] = c[(A + 4) >> 2];
+                          c[(G + 8) >> 2] = c[(A + 8) >> 2];
+                          c[(G + 12) >> 2] = c[(A + 12) >> 2];
+                          qS(a, B, 2);
+                          c[G >> 2] = c[d >> 2];
+                          c[(G + 4) >> 2] = c[(d + 4) >> 2];
+                          c[(G + 8) >> 2] = c[(d + 8) >> 2];
+                          c[(G + 12) >> 2] = c[(d + 12) >> 2];
+                          qS(a, B, 2);
+                          c[G >> 2] = c[D >> 2];
+                          c[(G + 4) >> 2] = c[(D + 4) >> 2];
+                          c[(G + 8) >> 2] = c[(D + 8) >> 2];
+                          c[(G + 12) >> 2] = c[(D + 12) >> 2];
+                          qS(a, B, 2);
+                          break;
+                        } else qa(105438, 105449, 714, 105458);
+                      }
+                      switch (e | 0) {
+                        case 50331648:
+                          break;
+                        default:
+                          break a;
+                      }
+                      g = (d + 3) | 0;
+                      i = JK(g << 4) | 0;
+                      c[i >> 2] = c[b >> 2];
+                      c[(i + 4) >> 2] = c[(b + 4) >> 2];
+                      c[(i + 8) >> 2] = c[(b + 8) >> 2];
+                      c[(i + 12) >> 2] = c[(b + 12) >> 2];
+                      J = +h[b >> 3];
+                      h[(i + 16) >> 3] = J - (J - +h[j >> 3]) * 0.25;
+                      e = (D + 56) | 0;
+                      J = (+h[e >> 3] - +h[(D + 72) >> 3]) * 0.3333333333333333 + +h[(b + 8) >> 3];
+                      h[(i + 24) >> 3] = J;
+                      I = +h[b >> 3];
+                      h[(i + 32) >> 3] = I - (I - +h[j >> 3]) * 2.0;
+                      h[(i + 40) >> 3] = J;
+                      J = +h[b >> 3];
+                      h[(i + 48) >> 3] = J - (J - +h[j >> 3]) * 2.25;
+                      h[(i + 56) >> 3] = +h[e >> 3];
+                      h[(i + 64) >> 3] = +h[(D + 48) >> 3];
+                      h[(i + 72) >> 3] = +h[e >> 3];
+                      e = 4;
+                      while (1) {
+                        if ((e | 0) >= (g | 0)) break;
+                        G = (i + (e << 4)) | 0;
+                        d = (b + ((e + -3) << 4)) | 0;
+                        c[G >> 2] = c[d >> 2];
+                        c[(G + 4) >> 2] = c[(d + 4) >> 2];
+                        c[(G + 8) >> 2] = c[(d + 8) >> 2];
+                        c[(G + 12) >> 2] = c[(d + 12) >> 2];
+                        e = (e + 1) | 0;
+                      }
+                      nS(a, i, g, f);
+                      U1(i);
+                      break;
+                    }
+                  } else if ((e | 0) < 318767104) {
+                    if ((e | 0) < 251658240) {
+                      if ((e | 0) < 218103808) {
+                        switch (e | 0) {
+                          case 201326592:
+                            break;
+                          default:
+                            break a;
+                        }
+                        G = d << 4;
+                        u = JK(G) | 0;
+                        v = (b + 16) | 0;
+                        J = +h[v >> 3];
+                        h[u >> 3] = J;
+                        z = (b + 40) | 0;
+                        I = +h[z >> 3];
+                        A = (b + 24) | 0;
+                        y = (D + 48) | 0;
+                        w = (D + 56) | 0;
+                        x = (D + 72) | 0;
+                        I = (+h[A >> 3] - I) * 0.5 + I + (+h[w >> 3] - +h[x >> 3]) * 0.125;
+                        h[(u + 8) >> 3] = I;
+                        H = (+h[k >> 3] - +h[y >> 3]) * 2.0 + J;
+                        h[(u + 16) >> 3] = H;
+                        h[(u + 24) >> 3] = I;
+                        h[(u + 32) >> 3] = H;
+                        I = (+h[w >> 3] - +h[x >> 3]) * 0.5 + I;
+                        h[(u + 40) >> 3] = I;
+                        h[(u + 48) >> 3] = J;
+                        h[(u + 56) >> 3] = I;
+                        nS(a, u, d, f);
+                        U1(u);
+                        G = JK(G) | 0;
+                        I = +h[k >> 3] + +h[v >> 3] - +h[y >> 3];
+                        h[G >> 3] = I;
+                        J = +h[z >> 3];
+                        J = (+h[A >> 3] - J) * 0.5 + J + (+h[w >> 3] - +h[x >> 3]) * -0.625;
+                        h[(G + 8) >> 3] = J;
+                        H = +h[k >> 3] - +h[y >> 3] + I;
+                        y = (G + 16) | 0;
+                        h[y >> 3] = H;
+                        h[(G + 24) >> 3] = J;
+                        h[(G + 32) >> 3] = H;
+                        J = (+h[w >> 3] - +h[x >> 3]) * 0.5 + J;
+                        h[(G + 40) >> 3] = J;
+                        h[(G + 48) >> 3] = I;
+                        h[(G + 56) >> 3] = J;
+                        nS(a, G, d, f);
+                        h[B >> 3] = +h[y >> 3];
+                        J = +h[z >> 3];
+                        h[(B + 8) >> 3] = (+h[A >> 3] - J) * 0.5 + J;
+                        h[(B + 16) >> 3] = +h[b >> 3];
+                        h[(B + 24) >> 3] = (+h[(b + 8) >> 3] - +h[(b + 56) >> 3]) * 0.5 + J;
+                        qS(a, B, 2);
+                        U1(G);
+                        break;
+                      }
+                      if ((e | 0) < 234881024) {
+                        switch (e | 0) {
+                          case 218103808:
+                            break;
+                          default:
+                            break a;
+                        }
+                        G = d << 4;
+                        w = JK(G) | 0;
+                        J = +h[b >> 3];
+                        h[w >> 3] = J;
+                        y = (b + 40) | 0;
+                        I = +h[y >> 3];
+                        z = (b + 24) | 0;
+                        x = (D + 56) | 0;
+                        A = (D + 72) | 0;
+                        I = (+h[z >> 3] - I) * 0.5 + I + (+h[x >> 3] - +h[A >> 3]) * 0.125;
+                        h[(w + 8) >> 3] = I;
+                        h[(w + 16) >> 3] = J;
+                        H = (+h[x >> 3] - +h[A >> 3]) * 0.5 + I;
+                        h[(w + 24) >> 3] = H;
+                        J = J - (+h[x >> 3] - +h[A >> 3]) * 2.0;
+                        h[(w + 32) >> 3] = J;
+                        h[(w + 40) >> 3] = H;
+                        h[(w + 48) >> 3] = J;
+                        h[(w + 56) >> 3] = I;
+                        nS(a, w, d, f);
+                        U1(w);
+                        G = JK(G) | 0;
+                        I = +h[b >> 3] - +h[k >> 3] + +h[(D + 48) >> 3];
+                        h[G >> 3] = I;
+                        J = +h[y >> 3];
+                        J = (+h[z >> 3] - J) * 0.5 + J + (+h[x >> 3] - +h[A >> 3]) * -0.625;
+                        h[(G + 8) >> 3] = J;
+                        h[(G + 16) >> 3] = I;
+                        H = (+h[x >> 3] - +h[A >> 3]) * 0.5 + J;
+                        h[(G + 24) >> 3] = H;
+                        I = I - (+h[x >> 3] - +h[A >> 3]);
+                        h[(G + 32) >> 3] = I;
+                        h[(G + 40) >> 3] = H;
+                        A = (G + 48) | 0;
+                        h[A >> 3] = I;
+                        h[(G + 56) >> 3] = J;
+                        nS(a, G, d, f);
+                        h[B >> 3] = +h[(b + 16) >> 3];
+                        J = +h[y >> 3];
+                        h[(B + 8) >> 3] = (+h[z >> 3] - J) * 0.5 + J;
+                        h[(B + 16) >> 3] = +h[A >> 3];
+                        h[(B + 24) >> 3] = (+h[(b + 8) >> 3] - +h[(b + 56) >> 3]) * 0.5 + J;
+                        qS(a, B, 2);
+                        U1(G);
+                        break;
+                      } else {
+                        switch (e | 0) {
+                          case 234881024:
+                            break;
+                          default:
+                            break a;
+                        }
+                        G = d << 4;
+                        y = JK(G) | 0;
+                        u = (b + 16) | 0;
+                        I = +h[u >> 3];
+                        v = (D + 48) | 0;
+                        I = (+h[b >> 3] - I) * 0.5 + I + (+h[k >> 3] - +h[v >> 3]) * -1.125;
+                        h[y >> 3] = I;
+                        w = (b + 40) | 0;
+                        J = +h[w >> 3];
+                        x = (b + 24) | 0;
+                        A = (D + 56) | 0;
+                        z = (D + 72) | 0;
+                        J = (+h[x >> 3] - J) * 0.5 + J + (+h[A >> 3] - +h[z >> 3]) * 0.125;
+                        h[(y + 8) >> 3] = J;
+                        H = +h[k >> 3] - +h[v >> 3] + I;
+                        h[(y + 16) >> 3] = H;
+                        h[(y + 24) >> 3] = J;
+                        h[(y + 32) >> 3] = H;
+                        J = (+h[A >> 3] - +h[z >> 3]) * 0.5 + J;
+                        h[(y + 40) >> 3] = J;
+                        h[(y + 48) >> 3] = I;
+                        h[(y + 56) >> 3] = J;
+                        nS(a, y, d, f);
+                        U1(y);
+                        y = JK(G) | 0;
+                        J = +h[u >> 3];
+                        J = (+h[b >> 3] - J) * 0.5 + J + (+h[k >> 3] - +h[v >> 3]) * -1.125;
+                        h[y >> 3] = J;
+                        I = +h[w >> 3];
+                        I = (+h[x >> 3] - I) * 0.5 + I + (+h[A >> 3] - +h[z >> 3]) * -0.625;
+                        h[(y + 8) >> 3] = I;
+                        H = +h[k >> 3] - +h[v >> 3] + J;
+                        h[(y + 16) >> 3] = H;
+                        h[(y + 24) >> 3] = I;
+                        h[(y + 32) >> 3] = H;
+                        I = (+h[A >> 3] - +h[z >> 3]) * 0.5 + I;
+                        h[(y + 40) >> 3] = I;
+                        h[(y + 48) >> 3] = J;
+                        h[(y + 56) >> 3] = I;
+                        nS(a, y, d, f);
+                        U1(y);
+                        y = JK(G) | 0;
+                        I = +h[u >> 3];
+                        I = (+h[b >> 3] - I) * 0.5 + I + (+h[k >> 3] - +h[v >> 3]) * 0.125;
+                        h[y >> 3] = I;
+                        J = +h[w >> 3];
+                        J = (+h[x >> 3] - J) * 0.5 + J + (+h[A >> 3] - +h[z >> 3]) * -0.625;
+                        h[(y + 8) >> 3] = J;
+                        H = +h[k >> 3] - +h[v >> 3] + I;
+                        h[(y + 16) >> 3] = H;
+                        h[(y + 24) >> 3] = J;
+                        h[(y + 32) >> 3] = H;
+                        J = (+h[A >> 3] - +h[z >> 3]) * 0.5 + J;
+                        h[(y + 40) >> 3] = J;
+                        h[(y + 48) >> 3] = I;
+                        h[(y + 56) >> 3] = J;
+                        nS(a, y, d, f);
+                        U1(y);
+                        G = JK(G) | 0;
+                        J = +h[u >> 3];
+                        J = (+h[b >> 3] - J) * 0.5 + J + (+h[k >> 3] - +h[v >> 3]) * 0.125;
+                        h[G >> 3] = J;
+                        I = +h[w >> 3];
+                        I = (+h[x >> 3] - I) * 0.5 + I + (+h[A >> 3] - +h[z >> 3]) * 0.125;
+                        h[(G + 8) >> 3] = I;
+                        H = +h[k >> 3] - +h[v >> 3] + J;
+                        y = (G + 16) | 0;
+                        h[y >> 3] = H;
+                        h[(G + 24) >> 3] = I;
+                        h[(G + 32) >> 3] = H;
+                        I = (+h[A >> 3] - +h[z >> 3]) * 0.5 + I;
+                        h[(G + 40) >> 3] = I;
+                        h[(G + 48) >> 3] = J;
+                        h[(G + 56) >> 3] = I;
+                        nS(a, G, d, f);
+                        h[B >> 3] = +h[y >> 3];
+                        I = +h[w >> 3];
+                        y = (B + 8) | 0;
+                        h[y >> 3] = (+h[x >> 3] - I) * 0.5 + I;
+                        z = (B + 16) | 0;
+                        h[z >> 3] = +h[b >> 3];
+                        A = (b + 8) | 0;
+                        d = (b + 56) | 0;
+                        f = (B + 24) | 0;
+                        h[f >> 3] = (+h[A >> 3] - +h[d >> 3]) * 0.5 + I;
+                        qS(a, B, 2);
+                        I = +h[u >> 3];
+                        h[B >> 3] = (+h[b >> 3] - I) * 0.5 + I + (+h[k >> 3] - +h[v >> 3]) * -1.125;
+                        J = +h[w >> 3];
+                        h[y >> 3] = (+h[x >> 3] - J) * 0.5 + J;
+                        h[z >> 3] = I;
+                        h[f >> 3] = (+h[A >> 3] - +h[d >> 3]) * 0.5 + J;
+                        qS(a, B, 2);
+                        U1(G);
+                        break;
+                      }
+                    }
+                    if ((e | 0) < 285212672)
+                      if ((e | 0) < 268435456) {
+                        switch (e | 0) {
+                          case 251658240:
+                            break;
+                          default:
+                            break a;
+                        }
+                        G = d << 4;
+                        u = JK(G) | 0;
+                        v = (b + 16) | 0;
+                        J = +h[v >> 3];
+                        y = (D + 48) | 0;
+                        J = J - +h[k >> 3] + (+h[b >> 3] - J) * 0.5 + +h[y >> 3];
+                        h[u >> 3] = J;
+                        w = (b + 40) | 0;
+                        I = +h[w >> 3];
+                        x = (b + 24) | 0;
+                        A = (D + 56) | 0;
+                        z = (D + 72) | 0;
+                        I = (+h[x >> 3] - I) * 0.5 + I + (+h[A >> 3] - +h[z >> 3]) * 0.125;
+                        h[(u + 8) >> 3] = I;
+                        H = (+h[k >> 3] - +h[y >> 3]) * 2.0 + J;
+                        h[(u + 16) >> 3] = H;
+                        h[(u + 24) >> 3] = I;
+                        h[(u + 32) >> 3] = H;
+                        I = (+h[A >> 3] - +h[z >> 3]) * 0.5 + I;
+                        h[(u + 40) >> 3] = I;
+                        h[(u + 48) >> 3] = J;
+                        h[(u + 56) >> 3] = I;
+                        nS(a, u, d, f);
+                        U1(u);
+                        G = JK(G) | 0;
+                        I = +h[v >> 3];
+                        I = I - +h[k >> 3] + (+h[b >> 3] - I) * 0.5 + +h[y >> 3];
+                        h[G >> 3] = I;
+                        J = +h[w >> 3];
+                        J = (+h[x >> 3] - J) * 0.5 + J + (+h[A >> 3] - +h[z >> 3]) * -0.625;
+                        h[(G + 8) >> 3] = J;
+                        H = (+h[k >> 3] - +h[y >> 3]) * 2.0 + I;
+                        y = (G + 16) | 0;
+                        h[y >> 3] = H;
+                        h[(G + 24) >> 3] = J;
+                        h[(G + 32) >> 3] = H;
+                        J = (+h[A >> 3] - +h[z >> 3]) * 0.5 + J;
+                        h[(G + 40) >> 3] = J;
+                        h[(G + 48) >> 3] = I;
+                        h[(G + 56) >> 3] = J;
+                        nS(a, G, d, f);
+                        h[B >> 3] = +h[y >> 3];
+                        J = +h[w >> 3];
+                        y = (B + 8) | 0;
+                        h[y >> 3] = (+h[x >> 3] - J) * 0.5 + J;
+                        z = (B + 16) | 0;
+                        h[z >> 3] = +h[b >> 3];
+                        A = (b + 8) | 0;
+                        d = (b + 56) | 0;
+                        f = (B + 24) | 0;
+                        h[f >> 3] = (+h[A >> 3] - +h[d >> 3]) * 0.5 + J;
+                        qS(a, B, 2);
+                        h[B >> 3] = +h[v >> 3];
+                        J = +h[w >> 3];
+                        h[y >> 3] = (+h[x >> 3] - J) * 0.5 + J;
+                        h[z >> 3] = +h[G >> 3];
+                        h[f >> 3] = (+h[A >> 3] - +h[d >> 3]) * 0.5 + J;
+                        qS(a, B, 2);
+                        U1(G);
+                        break;
+                      } else {
+                        switch (e | 0) {
+                          case 268435456:
+                            break;
+                          default:
+                            break a;
+                        }
+                        G = JK(d << 4) | 0;
+                        h[G >> 3] = +h[b >> 3];
+                        v = (D + 48) | 0;
+                        x = (D + 56) | 0;
+                        y = (D + 72) | 0;
+                        h[(G + 8) >> 3] = +h[(D + 24) >> 3] - (+h[x >> 3] - +h[y >> 3]) * 0.5;
+                        h[(G + 16) >> 3] = +h[v >> 3];
+                        J = +h[x >> 3];
+                        h[(G + 24) >> 3] = J - (J - +h[y >> 3]) * 0.5;
+                        h[(G + 32) >> 3] = +h[(b + 32) >> 3];
+                        z = (b + 40) | 0;
+                        h[(G + 40) >> 3] = (+h[x >> 3] - +h[y >> 3]) * 0.5 + +h[z >> 3];
+                        h[(G + 48) >> 3] = +h[b >> 3];
+                        h[(G + 56) >> 3] = (+h[x >> 3] - +h[y >> 3]) * 0.5 + +h[z >> 3];
+                        nS(a, G, d, f);
+                        w = (b + 16) | 0;
+                        J = (+h[k >> 3] - +h[v >> 3]) * 0.25;
+                        I = J + +h[w >> 3];
+                        h[B >> 3] = I;
+                        H = +h[z >> 3];
+                        u = (b + 24) | 0;
+                        F = +h[x >> 3] - +h[y >> 3];
+                        H = (+h[u >> 3] - H) * 0.5 + H + F * 0.125;
+                        A = (B + 8) | 0;
+                        h[A >> 3] = H;
+                        d = (B + 16) | 0;
+                        h[d >> 3] = J + I;
+                        f = (B + 24) | 0;
+                        h[f >> 3] = H - F * 0.25;
+                        qS(a, B, 2);
+                        F = (+h[k >> 3] - +h[v >> 3]) * 0.25;
+                        H = F + +h[w >> 3];
+                        h[B >> 3] = H;
+                        I = +h[z >> 3];
+                        J = +h[x >> 3] - +h[y >> 3];
+                        I = (+h[u >> 3] - I) * 0.5 + I + J * -0.125;
+                        h[A >> 3] = I;
+                        h[d >> 3] = F + H;
+                        h[f >> 3] = J * 0.25 + I;
+                        qS(a, B, 2);
+                        I = (+h[k >> 3] - +h[v >> 3]) * 0.25;
+                        h[B >> 3] = I + +h[w >> 3];
+                        J = (+h[x >> 3] - +h[y >> 3]) * 0.75 + +h[z >> 3];
+                        h[A >> 3] = J;
+                        h[d >> 3] = +h[b >> 3] - I;
+                        h[f >> 3] = J;
+                        qS(a, B, 2);
+                        U1(G);
+                        break;
+                      }
+                    else if ((e | 0) < 301989888) {
+                      switch (e | 0) {
+                        case 285212672:
+                          break;
+                        default:
+                          break a;
+                      }
+                      y = JK(d << 4) | 0;
+                      v = (b + 16) | 0;
+                      I = +h[v >> 3];
+                      z = (D + 48) | 0;
+                      I = (+h[k >> 3] - +h[z >> 3] + (+h[b >> 3] - I)) * 0.5 + I;
+                      h[y >> 3] = I;
+                      w = (b + 40) | 0;
+                      F = +h[w >> 3];
+                      x = (b + 24) | 0;
+                      F = (+h[k >> 3] - +h[z >> 3] + (+h[x >> 3] - F)) * 0.5 + F;
+                      h[(y + 8) >> 3] = F;
+                      h[(y + 16) >> 3] = I;
+                      I = +h[w >> 3];
+                      o = +h[k >> 3] - +h[z >> 3];
+                      I = (+h[x >> 3] - I - o) * 0.5 + I;
+                      h[(y + 24) >> 3] = I;
+                      J = +h[v >> 3];
+                      J = (+h[b >> 3] - J - o) * 0.5 + J;
+                      h[(y + 32) >> 3] = J;
+                      h[(y + 40) >> 3] = I;
+                      h[(y + 48) >> 3] = J;
+                      h[(y + 56) >> 3] = F;
+                      nS(a, y, d, f);
+                      U1(y);
+                      F = +h[v >> 3];
+                      F = (+h[b >> 3] - F) * 0.5 + F;
+                      J = +h[k >> 3] - +h[z >> 3];
+                      I = J * 0.75;
+                      o = F + I;
+                      h[B >> 3] = o;
+                      H = +h[w >> 3];
+                      H = (+h[x >> 3] - H) * 0.5 + H;
+                      I = H + I;
+                      y = (B + 8) | 0;
+                      h[y >> 3] = I;
+                      A = (B + 16) | 0;
+                      h[A >> 3] = o;
+                      J = J * -0.75;
+                      H = H + J;
+                      G = (B + 24) | 0;
+                      h[G >> 3] = H;
+                      J = F + J;
+                      h[(B + 32) >> 3] = J;
+                      h[(B + 40) >> 3] = H;
+                      h[(B + 48) >> 3] = J;
+                      h[(B + 56) >> 3] = I;
+                      d = (B + 64) | 0;
+                      c[d >> 2] = c[B >> 2];
+                      c[(d + 4) >> 2] = c[(B + 4) >> 2];
+                      c[(d + 8) >> 2] = c[(B + 8) >> 2];
+                      c[(d + 12) >> 2] = c[(B + 12) >> 2];
+                      qS(a, B, 5);
+                      I = +h[v >> 3];
+                      J = +h[b >> 3];
+                      h[B >> 3] = (J - I) * 0.5 + I + (+h[k >> 3] - +h[z >> 3]) * 0.75;
+                      I = +h[w >> 3];
+                      h[y >> 3] = (+h[x >> 3] - I) * 0.5 + I;
+                      h[A >> 3] = J;
+                      d = (b + 8) | 0;
+                      f = (b + 56) | 0;
+                      h[G >> 3] = (+h[d >> 3] - +h[f >> 3]) * 0.5 + I;
+                      qS(a, B, 2);
+                      I = +h[v >> 3];
+                      h[B >> 3] = I;
+                      J = +h[w >> 3];
+                      h[y >> 3] = (+h[x >> 3] - J) * 0.5 + J;
+                      h[A >> 3] = (+h[b >> 3] - I) * 0.5 + I + (+h[k >> 3] - +h[z >> 3]) * -0.75;
+                      h[G >> 3] = (+h[d >> 3] - +h[f >> 3]) * 0.5 + J;
+                      qS(a, B, 2);
+                      break;
+                    } else {
+                      switch (e | 0) {
+                        case 301989888:
+                          break;
+                        default:
+                          break a;
+                      }
+                      A = (d + 12) | 0;
+                      G = JK(A << 4) | 0;
+                      x = (b + 16) | 0;
+                      m = +h[x >> 3];
+                      s = (D + 48) | 0;
+                      m = (+h[b >> 3] - m) * 0.5 + m + (+h[k >> 3] - +h[s >> 3]) * 0.25;
+                      h[G >> 3] = m;
+                      y = (b + 40) | 0;
+                      F = +h[y >> 3];
+                      z = (b + 24) | 0;
+                      v = (D + 56) | 0;
+                      w = (D + 72) | 0;
+                      F = (+h[v >> 3] - +h[w >> 3] + (+h[z >> 3] - F)) * 0.5 + F;
+                      u = (G + 8) | 0;
+                      h[u >> 3] = F;
+                      h[(G + 16) >> 3] = m;
+                      F = (+h[v >> 3] - +h[w >> 3]) * 0.125 + F;
+                      t = (G + 24) | 0;
+                      h[t >> 3] = F;
+                      H = m - (+h[k >> 3] - +h[s >> 3]) * 0.125;
+                      d = (G + 32) | 0;
+                      h[d >> 3] = H;
+                      o = (+h[v >> 3] - +h[w >> 3]) * 0.125 + F;
+                      h[(G + 40) >> 3] = o;
+                      h[(G + 48) >> 3] = m;
+                      I = (+h[v >> 3] - +h[w >> 3]) * 0.125 + o;
+                      h[(G + 56) >> 3] = I;
+                      h[(G + 64) >> 3] = m;
+                      m = (+h[v >> 3] - +h[w >> 3]) * 0.125 + I;
+                      h[(G + 72) >> 3] = m;
+                      h[(G + 80) >> 3] = H;
+                      h[(G + 88) >> 3] = m;
+                      H = +h[x >> 3];
+                      H = (+h[b >> 3] - H) * 0.5 + H;
+                      h[(G + 96) >> 3] = H;
+                      h[(G + 104) >> 3] = I;
+                      J = H - (+h[k >> 3] - +h[s >> 3]) * 0.125;
+                      h[(G + 112) >> 3] = J;
+                      h[(G + 120) >> 3] = m;
+                      J = J - (+h[k >> 3] - +h[s >> 3]) * 0.125;
+                      h[(G + 128) >> 3] = J;
+                      h[(G + 136) >> 3] = m;
+                      h[(G + 144) >> 3] = J;
+                      h[(G + 152) >> 3] = I;
+                      I = (+h[k >> 3] - +h[s >> 3]) * 0.125 + J;
+                      h[(G + 160) >> 3] = I;
+                      h[(G + 168) >> 3] = o;
+                      h[(G + 176) >> 3] = J;
+                      h[(G + 184) >> 3] = F;
+                      h[(G + 192) >> 3] = J;
+                      J = +h[u >> 3];
+                      h[(G + 200) >> 3] = J;
+                      h[(G + 208) >> 3] = I;
+                      h[(G + 216) >> 3] = J;
+                      u = (G + 224) | 0;
+                      h[u >> 3] = H;
+                      h[(G + 232) >> 3] = +h[t >> 3];
+                      h[(G + 240) >> 3] = +h[d >> 3];
+                      h[(G + 248) >> 3] = J;
+                      nS(a, G, A, f);
+                      J = +h[u >> 3];
+                      h[B >> 3] = J;
+                      H = +h[y >> 3];
+                      H = (+h[z >> 3] - H) * 0.5 + H;
+                      A = (B + 8) | 0;
+                      h[A >> 3] = H;
+                      d = (B + 16) | 0;
+                      h[d >> 3] = J;
+                      f = (B + 24) | 0;
+                      h[f >> 3] = (+h[v >> 3] - +h[w >> 3]) * 0.125 + H;
+                      qS(a, B, 2);
+                      H = +h[u >> 3];
+                      h[B >> 3] = H;
+                      J = +h[y >> 3];
+                      I = +h[v >> 3] - +h[w >> 3];
+                      J = (+h[z >> 3] - J) * 0.5 + J + I * 0.25;
+                      h[A >> 3] = J;
+                      h[d >> 3] = H;
+                      h[f >> 3] = I * 0.125 + J;
+                      qS(a, B, 2);
+                      h[B >> 3] = +h[x >> 3];
+                      J = +h[y >> 3];
+                      h[A >> 3] = (+h[z >> 3] - J) * 0.5 + J;
+                      h[d >> 3] = +h[b >> 3];
+                      h[f >> 3] = (+h[(b + 8) >> 3] - +h[(b + 56) >> 3]) * 0.5 + J;
+                      qS(a, B, 2);
+                      U1(G);
+                      break;
+                    }
+                  } else {
+                    if ((e | 0) < 369098752) {
+                      if ((e | 0) < 335544320) {
+                        switch (e | 0) {
+                          case 318767104:
+                            break;
+                          default:
+                            break a;
+                        }
+                        A = (d + 4) | 0;
+                        G = JK(A << 4) | 0;
+                        x = (b + 16) | 0;
+                        H = +h[x >> 3];
+                        d = (D + 48) | 0;
+                        H = (+h[b >> 3] - H) * 0.5 + H + (+h[k >> 3] - +h[d >> 3]) * 0.125;
+                        h[G >> 3] = H;
+                        y = (b + 40) | 0;
+                        J = +h[y >> 3];
+                        z = (b + 24) | 0;
+                        v = (D + 56) | 0;
+                        w = (D + 72) | 0;
+                        J = (+h[v >> 3] - +h[w >> 3] + (+h[z >> 3] - J)) * 0.5 + J;
+                        h[(G + 8) >> 3] = J;
+                        o = (+h[k >> 3] - +h[d >> 3]) * 0.125 + H;
+                        h[(G + 16) >> 3] = o;
+                        I = (+h[v >> 3] - +h[w >> 3]) * 0.125 + J;
+                        h[(G + 24) >> 3] = I;
+                        h[(G + 32) >> 3] = o;
+                        o = (+h[v >> 3] - +h[w >> 3]) * 0.25 + I;
+                        h[(G + 40) >> 3] = o;
+                        h[(G + 48) >> 3] = H;
+                        F = (+h[v >> 3] - +h[w >> 3]) * 0.125 + o;
+                        h[(G + 56) >> 3] = F;
+                        H = H - (+h[k >> 3] - +h[d >> 3]) * 0.25;
+                        h[(G + 64) >> 3] = H;
+                        h[(G + 72) >> 3] = F;
+                        F = H - (+h[k >> 3] - +h[d >> 3]) * 0.125;
+                        h[(G + 80) >> 3] = F;
+                        h[(G + 88) >> 3] = o;
+                        h[(G + 96) >> 3] = F;
+                        h[(G + 104) >> 3] = I;
+                        h[(G + 112) >> 3] = H;
+                        h[(G + 120) >> 3] = J;
+                        nS(a, G, A, f);
+                        J = +h[x >> 3];
+                        J = (+h[b >> 3] - J) * 0.5 + J;
+                        h[B >> 3] = J;
+                        H = +h[y >> 3];
+                        H = (+h[z >> 3] - H) * 0.5 + H;
+                        A = (B + 8) | 0;
+                        h[A >> 3] = H;
+                        d = (B + 16) | 0;
+                        h[d >> 3] = J;
+                        f = (B + 24) | 0;
+                        h[f >> 3] = (+h[v >> 3] - +h[w >> 3]) * 0.125 + H;
+                        qS(a, B, 2);
+                        H = +h[x >> 3];
+                        H = (+h[b >> 3] - H) * 0.5 + H;
+                        h[B >> 3] = H;
+                        J = +h[y >> 3];
+                        I = +h[v >> 3] - +h[w >> 3];
+                        J = (+h[z >> 3] - J) * 0.5 + J + I * 0.25;
+                        h[A >> 3] = J;
+                        h[d >> 3] = H;
+                        h[f >> 3] = I * 0.125 + J;
+                        qS(a, B, 2);
+                        h[B >> 3] = +h[x >> 3];
+                        J = +h[y >> 3];
+                        h[A >> 3] = (+h[z >> 3] - J) * 0.5 + J;
+                        h[d >> 3] = +h[b >> 3];
+                        h[f >> 3] = (+h[(b + 8) >> 3] - +h[(b + 56) >> 3]) * 0.5 + J;
+                        qS(a, B, 2);
+                        U1(G);
+                        break;
+                      }
+                      if ((e | 0) < 352321536) {
+                        switch (e | 0) {
+                          case 335544320:
+                            break;
+                          default:
+                            break a;
+                        }
+                        x = (d + 12) | 0;
+                        G = JK(x << 4) | 0;
+                        y = (b + 16) | 0;
+                        m = +h[y >> 3];
+                        u = (D + 48) | 0;
+                        m = (+h[b >> 3] - m) * 0.5 + m + (+h[k >> 3] - +h[u >> 3]) * 0.25;
+                        h[G >> 3] = m;
+                        z = (b + 40) | 0;
+                        F = +h[z >> 3];
+                        A = (b + 24) | 0;
+                        s = (D + 56) | 0;
+                        t = (D + 72) | 0;
+                        F = (+h[s >> 3] - +h[t >> 3] + (+h[A >> 3] - F)) * 0.5 + F;
+                        d = (G + 8) | 0;
+                        h[d >> 3] = F;
+                        h[(G + 16) >> 3] = m;
+                        F = (+h[s >> 3] - +h[t >> 3]) * 0.125 + F;
+                        v = (G + 24) | 0;
+                        h[v >> 3] = F;
+                        I = m - (+h[k >> 3] - +h[u >> 3]) * 0.125;
+                        w = (G + 32) | 0;
+                        h[w >> 3] = I;
+                        o = (+h[s >> 3] - +h[t >> 3]) * 0.125 + F;
+                        h[(G + 40) >> 3] = o;
+                        h[(G + 48) >> 3] = m;
+                        H = (+h[s >> 3] - +h[t >> 3]) * 0.125 + o;
+                        h[(G + 56) >> 3] = H;
+                        h[(G + 64) >> 3] = m;
+                        m = (+h[s >> 3] - +h[t >> 3]) * 0.125 + H;
+                        h[(G + 72) >> 3] = m;
+                        h[(G + 80) >> 3] = I;
+                        h[(G + 88) >> 3] = m;
+                        I = +h[y >> 3];
+                        I = (+h[b >> 3] - I) * 0.5 + I;
+                        h[(G + 96) >> 3] = I;
+                        h[(G + 104) >> 3] = H;
+                        J = I - (+h[k >> 3] - +h[u >> 3]) * 0.125;
+                        h[(G + 112) >> 3] = J;
+                        h[(G + 120) >> 3] = m;
+                        J = J - (+h[k >> 3] - +h[u >> 3]) * 0.125;
+                        h[(G + 128) >> 3] = J;
+                        h[(G + 136) >> 3] = m;
+                        h[(G + 144) >> 3] = J;
+                        h[(G + 152) >> 3] = H;
+                        H = (+h[k >> 3] - +h[u >> 3]) * 0.125 + J;
+                        h[(G + 160) >> 3] = H;
+                        h[(G + 168) >> 3] = o;
+                        h[(G + 176) >> 3] = J;
+                        h[(G + 184) >> 3] = F;
+                        h[(G + 192) >> 3] = J;
+                        J = +h[d >> 3];
+                        h[(G + 200) >> 3] = J;
+                        h[(G + 208) >> 3] = H;
+                        h[(G + 216) >> 3] = J;
+                        d = (G + 224) | 0;
+                        h[d >> 3] = I;
+                        h[(G + 232) >> 3] = +h[v >> 3];
+                        h[(G + 240) >> 3] = +h[w >> 3];
+                        h[(G + 248) >> 3] = J;
+                        nS(a, G, x, f);
+                        c[B >> 2] = c[d >> 2];
+                        c[(B + 4) >> 2] = c[(d + 4) >> 2];
+                        c[(B + 8) >> 2] = c[(d + 8) >> 2];
+                        c[(B + 12) >> 2] = c[(d + 12) >> 2];
+                        d = (B + 16) | 0;
+                        h[d >> 3] = +h[B >> 3];
+                        J = +h[z >> 3];
+                        f = (B + 24) | 0;
+                        h[f >> 3] = (+h[A >> 3] - J) * 0.5 + J;
+                        qS(a, B, 2);
+                        h[B >> 3] = +h[y >> 3];
+                        J = +h[z >> 3];
+                        h[(B + 8) >> 3] = (+h[A >> 3] - J) * 0.5 + J;
+                        h[d >> 3] = +h[b >> 3];
+                        h[f >> 3] = (+h[(b + 8) >> 3] - +h[(b + 56) >> 3]) * 0.5 + J;
+                        qS(a, B, 2);
+                        U1(G);
+                        break;
+                      } else {
+                        switch (e | 0) {
+                          case 352321536:
+                            break;
+                          default:
+                            break a;
+                        }
+                        A = (d + 4) | 0;
+                        G = JK(A << 4) | 0;
+                        x = (b + 16) | 0;
+                        I = +h[x >> 3];
+                        w = (D + 48) | 0;
+                        I = (+h[b >> 3] - I) * 0.5 + I + (+h[k >> 3] - +h[w >> 3]) * 0.125;
+                        h[G >> 3] = I;
+                        y = (b + 40) | 0;
+                        J = +h[y >> 3];
+                        z = (b + 24) | 0;
+                        u = (D + 56) | 0;
+                        v = (D + 72) | 0;
+                        J = (+h[u >> 3] - +h[v >> 3] + (+h[z >> 3] - J)) * 0.5 + J;
+                        d = (G + 8) | 0;
+                        h[d >> 3] = J;
+                        o = (+h[k >> 3] - +h[w >> 3]) * 0.125 + I;
+                        h[(G + 16) >> 3] = o;
+                        H = (+h[u >> 3] - +h[v >> 3]) * 0.125 + J;
+                        h[(G + 24) >> 3] = H;
+                        h[(G + 32) >> 3] = o;
+                        o = (+h[u >> 3] - +h[v >> 3]) * 0.25 + H;
+                        h[(G + 40) >> 3] = o;
+                        h[(G + 48) >> 3] = I;
+                        F = (+h[u >> 3] - +h[v >> 3]) * 0.125 + o;
+                        h[(G + 56) >> 3] = F;
+                        I = I - (+h[k >> 3] - +h[w >> 3]) * 0.25;
+                        h[(G + 64) >> 3] = I;
+                        h[(G + 72) >> 3] = F;
+                        F = I - (+h[k >> 3] - +h[w >> 3]) * 0.125;
+                        h[(G + 80) >> 3] = F;
+                        h[(G + 88) >> 3] = o;
+                        h[(G + 96) >> 3] = F;
+                        h[(G + 104) >> 3] = H;
+                        h[(G + 112) >> 3] = I;
+                        h[(G + 120) >> 3] = J;
+                        nS(a, G, A, f);
+                        J = +h[x >> 3];
+                        J = (+h[b >> 3] - J) * 0.5 + J;
+                        h[B >> 3] = J;
+                        A = (B + 8) | 0;
+                        h[A >> 3] = +h[d >> 3];
+                        d = (B + 16) | 0;
+                        h[d >> 3] = J;
+                        J = +h[y >> 3];
+                        f = (B + 24) | 0;
+                        h[f >> 3] = (+h[z >> 3] - J) * 0.5 + J;
+                        qS(a, B, 2);
+                        h[B >> 3] = +h[x >> 3];
+                        J = +h[y >> 3];
+                        h[A >> 3] = (+h[z >> 3] - J) * 0.5 + J;
+                        h[d >> 3] = +h[b >> 3];
+                        h[f >> 3] = (+h[(b + 8) >> 3] - +h[(b + 56) >> 3]) * 0.5 + J;
+                        qS(a, B, 2);
+                        U1(G);
+                        break;
+                      }
+                    }
+                    if ((e | 0) < 402653184)
+                      if ((e | 0) < 385875968) {
+                        switch (e | 0) {
+                          case 369098752:
+                            break;
+                          default:
+                            break a;
+                        }
+                        d = (d + 5) | 0;
+                        G = JK(d << 4) | 0;
+                        B = (D + 48) | 0;
+                        h[G >> 3] = +h[j >> 3] - (+h[k >> 3] - +h[B >> 3]) * 0.5;
+                        y = (D + 56) | 0;
+                        A = (D + 72) | 0;
+                        h[(G + 8) >> 3] = +h[(D + 24) >> 3] - (+h[y >> 3] - +h[A >> 3]) * 0.5;
+                        h[(G + 16) >> 3] = +h[B >> 3];
+                        J = +h[y >> 3];
+                        h[(G + 24) >> 3] = J - (J - +h[A >> 3]) * 0.5;
+                        h[(G + 32) >> 3] = +h[(b + 32) >> 3];
+                        z = (b + 40) | 0;
+                        h[(G + 40) >> 3] = +h[z >> 3];
+                        J = +h[k >> 3];
+                        h[(G + 48) >> 3] = (J - +h[B >> 3]) * 0.5 + J;
+                        h[(G + 56) >> 3] = +h[z >> 3];
+                        J = +h[k >> 3];
+                        h[(G + 64) >> 3] = (J - +h[B >> 3]) * 0.5 + J;
+                        h[(G + 72) >> 3] = (+h[y >> 3] - +h[A >> 3]) * 0.5 + +h[z >> 3];
+                        h[(G + 80) >> 3] = +h[j >> 3] - (+h[k >> 3] - +h[B >> 3]) * 0.5;
+                        h[(G + 88) >> 3] = (+h[y >> 3] - +h[A >> 3]) * 0.5 + +h[z >> 3];
+                        h[(G + 96) >> 3] = +h[j >> 3] - (+h[k >> 3] - +h[B >> 3]) * 0.5;
+                        z = (b + 56) | 0;
+                        h[(G + 104) >> 3] = +h[z >> 3];
+                        A = (b + 8) | 0;
+                        J = +h[A >> 3];
+                        h[(G + 120) >> 3] = J - (J - +h[z >> 3]) * 0.5;
+                        h[(G + 112) >> 3] = +h[b >> 3];
+                        h[(G + 136) >> 3] = +h[A >> 3];
+                        h[(G + 128) >> 3] = +h[j >> 3] - (+h[k >> 3] - +h[B >> 3]) * 0.5;
+                        nS(a, G, d, f);
+                        U1(G);
+                        break;
+                      } else {
+                        switch (e | 0) {
+                          case 385875968:
+                            break;
+                          default:
+                            break a;
+                        }
+                        d = (d + 3) | 0;
+                        G = JK(d << 4) | 0;
+                        B = (D + 48) | 0;
+                        h[G >> 3] = +h[j >> 3] - (+h[k >> 3] - +h[B >> 3]) * 0.5;
+                        y = (D + 56) | 0;
+                        A = (D + 72) | 0;
+                        h[(G + 8) >> 3] = +h[(D + 24) >> 3] - (+h[y >> 3] - +h[A >> 3]) * 0.5;
+                        h[(G + 16) >> 3] = +h[B >> 3];
+                        J = +h[y >> 3];
+                        h[(G + 24) >> 3] = J - (J - +h[A >> 3]) * 0.5;
+                        h[(G + 32) >> 3] = +h[(b + 32) >> 3];
+                        z = (b + 40) | 0;
+                        h[(G + 40) >> 3] = (+h[y >> 3] - +h[A >> 3]) * 0.5 + +h[z >> 3];
+                        h[(G + 48) >> 3] = +h[j >> 3] - (+h[k >> 3] - +h[B >> 3]) * 0.5;
+                        h[(G + 56) >> 3] = (+h[y >> 3] - +h[A >> 3]) * 0.5 + +h[z >> 3];
+                        h[(G + 64) >> 3] = +h[j >> 3] - (+h[k >> 3] - +h[B >> 3]) * 0.5;
+                        z = (b + 56) | 0;
+                        h[(G + 72) >> 3] = +h[z >> 3];
+                        A = (b + 8) | 0;
+                        J = +h[A >> 3];
+                        h[(G + 88) >> 3] = J - (J - +h[z >> 3]) * 0.5;
+                        h[(G + 80) >> 3] = +h[b >> 3];
+                        h[(G + 104) >> 3] = +h[A >> 3];
+                        h[(G + 96) >> 3] = +h[j >> 3] - (+h[k >> 3] - +h[B >> 3]) * 0.5;
+                        nS(a, G, d, f);
+                        U1(G);
+                        break;
+                      }
+                    else if ((e | 0) < 419430400) {
+                      switch (e | 0) {
+                        case 402653184:
+                          break;
+                        default:
+                          break a;
+                      }
+                      d = (d + 3) | 0;
+                      G = JK(d << 4) | 0;
+                      h[G >> 3] = +h[b >> 3];
+                      y = (b + 8) | 0;
+                      z = (D + 48) | 0;
+                      A = (D + 56) | 0;
+                      B = (D + 72) | 0;
+                      h[(G + 8) >> 3] = +h[y >> 3] - (+h[A >> 3] - +h[B >> 3]) * 0.5;
+                      J = +h[k >> 3];
+                      h[(G + 16) >> 3] = (J - +h[z >> 3]) * 0.5 + J;
+                      h[(G + 24) >> 3] = +h[y >> 3] - (+h[A >> 3] - +h[B >> 3]) * 0.5;
+                      J = +h[k >> 3];
+                      h[(G + 32) >> 3] = (J - +h[z >> 3]) * 0.5 + J;
+                      h[(G + 40) >> 3] = +h[(D + 40) >> 3];
+                      h[(G + 48) >> 3] = +h[(b + 16) >> 3];
+                      J = +h[(b + 24) >> 3];
+                      y = (b + 40) | 0;
+                      h[(G + 56) >> 3] = J - (J - +h[y >> 3]) * 0.5;
+                      J = +h[k >> 3];
+                      h[(G + 64) >> 3] = (J - +h[z >> 3]) * 0.5 + J;
+                      h[(G + 72) >> 3] = +h[y >> 3];
+                      h[(G + 88) >> 3] = (+h[A >> 3] - +h[B >> 3]) * 0.5 + +h[y >> 3];
+                      J = +h[k >> 3];
+                      h[(G + 80) >> 3] = (J - +h[z >> 3]) * 0.5 + J;
+                      h[(G + 104) >> 3] = (+h[A >> 3] - +h[B >> 3]) * 0.5 + +h[(b + 56) >> 3];
+                      h[(G + 96) >> 3] = +h[b >> 3];
+                      nS(a, G, d, f);
+                      U1(G);
+                      break;
+                    } else {
+                      switch (e | 0) {
+                        case 419430400:
+                          break;
+                        default:
+                          break a;
+                      }
+                      d = (d + 5) | 0;
+                      G = JK(d << 4) | 0;
+                      h[G >> 3] = +h[b >> 3];
+                      B = (b + 8) | 0;
+                      A = (D + 48) | 0;
+                      y = (D + 56) | 0;
+                      z = (D + 72) | 0;
+                      h[(G + 8) >> 3] = +h[B >> 3] - (+h[y >> 3] - +h[z >> 3]) * 0.5;
+                      J = +h[k >> 3];
+                      h[(G + 16) >> 3] = (J - +h[A >> 3]) * 0.5 + J;
+                      h[(G + 24) >> 3] = +h[B >> 3] - (+h[y >> 3] - +h[z >> 3]) * 0.5;
+                      J = +h[k >> 3];
+                      h[(G + 32) >> 3] = (J - +h[A >> 3]) * 0.5 + J;
+                      h[(G + 40) >> 3] = +h[(D + 40) >> 3];
+                      h[(G + 48) >> 3] = +h[(b + 16) >> 3];
+                      J = +h[(b + 24) >> 3];
+                      B = (b + 40) | 0;
+                      h[(G + 56) >> 3] = J - (J - +h[B >> 3]) * 0.5;
+                      J = +h[k >> 3];
+                      h[(G + 64) >> 3] = (J - +h[A >> 3]) * 0.5 + J;
+                      h[(G + 72) >> 3] = +h[B >> 3];
+                      h[(G + 88) >> 3] = (+h[y >> 3] - +h[z >> 3]) * 0.5 + +h[B >> 3];
+                      J = +h[k >> 3];
+                      h[(G + 80) >> 3] = (J - +h[A >> 3]) * 0.5 + J;
+                      B = (b + 56) | 0;
+                      h[(G + 104) >> 3] = (+h[y >> 3] - +h[z >> 3]) * 0.5 + +h[B >> 3];
+                      h[(G + 96) >> 3] = +h[j >> 3] - (+h[k >> 3] - +h[A >> 3]) * 0.5;
+                      h[(G + 112) >> 3] = +h[j >> 3] - (+h[k >> 3] - +h[A >> 3]) * 0.5;
+                      h[(G + 120) >> 3] = +h[B >> 3];
+                      h[(G + 128) >> 3] = +h[(b + 48) >> 3];
+                      h[(G + 136) >> 3] = +h[B >> 3];
+                      nS(a, G, d, f);
+                      U1(G);
+                      break;
+                    }
+                  }
+                while (0);
+                U1(D);
+              }
+              l = E;
+              return;
+            }
+            function UM(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0.0;
+              f = l;
+              l = (l + 112) | 0;
+              g = f;
+              k = +h[(b + 8) >> 3] * 2.0;
+              c[g >> 2] = c[b >> 2];
+              c[(g + 4) >> 2] = c[(b + 4) >> 2];
+              c[(g + 8) >> 2] = c[(b + 8) >> 2];
+              c[(g + 12) >> 2] = c[(b + 12) >> 2];
+              h[(g + 16) >> 3] = +h[(b + 16) >> 3];
+              h[(g + 24) >> 3] = k - +h[(b + 24) >> 3];
+              h[(g + 32) >> 3] = +h[(b + 32) >> 3];
+              h[(g + 40) >> 3] = k - +h[(b + 40) >> 3];
+              h[(g + 48) >> 3] = +h[(b + 48) >> 3];
+              h[(g + 56) >> 3] = k - +h[(b + 56) >> 3];
+              h[(g + 64) >> 3] = +h[(b + 64) >> 3];
+              h[(g + 72) >> 3] = k - +h[(b + 72) >> 3];
+              h[(g + 80) >> 3] = +h[(b + 80) >> 3];
+              h[(g + 88) >> 3] = k - +h[(b + 88) >> 3];
+              i = (g + 96) | 0;
+              j = (b + 96) | 0;
+              c[i >> 2] = c[j >> 2];
+              c[(i + 4) >> 2] = c[(j + 4) >> 2];
+              c[(i + 8) >> 2] = c[(j + 8) >> 2];
+              c[(i + 12) >> 2] = c[(j + 12) >> 2];
+              pS(a, b, d, 0, 0, e & 255);
+              pS(a, g, 7, 0, 0, 0);
+              l = f;
+              return;
+            }
+            function VM(a, b, c, d) {
+              a = a | 0;
+              b = +b;
+              c = c | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0;
+              f = +h[c >> 3];
+              e = +h[(c + 8) >> 3];
+              e = (+h[(d + 8) >> 3] - e) * b + e;
+              h[a >> 3] = (+h[d >> 3] - f) * b + f;
+              h[(a + 8) >> 3] = e;
+              return;
+            }
+            function WM(a) {
+              a = a | 0;
+              a = c[((c[(a + 16) >> 2] | 0) + 8) >> 2] | 0;
+              if (a) {
+                a = c[c[(a + 4) >> 2] >> 2] | 0;
+                if ((a | 0) != 91)
+                  if ((a | 0) == 94) a = 2;
+                  else return ((a | 0) == 93 ? 3 : (a | 0) == 96 ? 4 : 0) | 0;
+                else a = 1;
+              } else a = 0;
+              return a | 0;
+            }
+            function XM(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0.0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0,
+                q = 0.0,
+                r = 0.0,
+                s = 0.0,
+                t = 0.0,
+                u = 0.0,
+                v = 0.0,
+                w = 0.0,
+                x = 0.0,
+                y = 0.0,
+                z = 0.0,
+                A = 0,
+                D = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                P = 0.0,
+                Q = 0.0,
+                R = 0,
+                S = 0,
+                T = 0.0,
+                U = 0.0,
+                V = 0.0,
+                W = 0,
+                X = 0,
+                Y = 0,
+                Z = 0,
+                _ = 0,
+                $ = 0,
+                aa = 0,
+                ba = 0.0;
+              aa = l;
+              l = (l + 144) | 0;
+              J = (aa + 112) | 0;
+              N = (aa + 104) | 0;
+              G = (aa + 96) | 0;
+              H = (aa + 88) | 0;
+              i = (aa + 80) | 0;
+              Y = (aa + 64) | 0;
+              _ = (aa + 48) | 0;
+              R = (aa + 40) | 0;
+              S = (aa + 32) | 0;
+              j = (aa + 24) | 0;
+              p = (aa + 16) | 0;
+              D = (aa + 136) | 0;
+              A = (aa + 128) | 0;
+              L = aa;
+              $ = JK(48) | 0;
+              Z = (b + 16) | 0;
+              W = c[((c[((c[Z >> 2] | 0) + 8) >> 2] | 0) + 8) >> 2] | 0;
+              g = (W | 0) == 1616;
+              X = c[W >> 2] | 0;
+              d = c[(W + 4) >> 2] | 0;
+              e = c[(W + 8) >> 2] | 0;
+              m = +h[(W + 16) >> 3];
+              n = +h[(W + 32) >> 3];
+              o = +h[(W + 24) >> 3];
+              X = X | ((dP(QA(b, 105511) | 0) | 0) & 255);
+              do
+                if (!g) {
+                  if (!X) {
+                    W = c[Z >> 2] | 0;
+                    k = +h[(W + 32) >> 3] * 72.0;
+                    f = +h[(W + 40) >> 3] * 72.0;
+                    f = +(~~(f + (f >= 0.0 ? 0.5 : -0.5)) | 0);
+                    k = +(~~(k + (k >= 0.0 ? 0.5 : -0.5)) | 0);
+                    break;
+                  }
+                  k = +fN(b);
+                  if (k > 0.0) f = k;
+                  else {
+                    W = c[Z >> 2] | 0;
+                    f = +h[(W + 32) >> 3];
+                    k = +h[(W + 40) >> 3];
+                    k = (f < k ? f : k) * 72.0;
+                    k = +(~~(k + (k >= 0.0 ? 0.5 : -0.5)) | 0);
+                    f = k;
+                  }
+                } else {
+                  f = 0.0;
+                  k = 0.0;
+                }
+              while (0);
+              W = ZO(b, c[47160] | 0, d, 0) | 0;
+              V = +_O(b, c[47162] | 0, 0.0, -360.0) + m;
+              if (!e) {
+                U = +_O(b, c[47163] | 0, 0.0, -100.0);
+                I = ZO(b, c[47159] | 0, 4, 0) | 0;
+                T = +_O(b, c[47164] | 0, 0.0, -100.0);
+              } else {
+                I = e;
+                U = n;
+                T = o;
+              }
+              d = c[((c[Z >> 2] | 0) + 104) >> 2] | 0;
+              e = (d + 24) | 0;
+              c[Y >> 2] = c[e >> 2];
+              c[(Y + 4) >> 2] = c[(e + 4) >> 2];
+              c[(Y + 8) >> 2] = c[(e + 8) >> 2];
+              c[(Y + 12) >> 2] = c[(e + 12) >> 2];
+              q = +h[Y >> 3];
+              if (q > 0.0) {
+                if (!g) M = 11;
+              } else if (!(g | !(+h[(Y + 8) >> 3] > 0.0))) M = 11;
+              if ((M | 0) == 11) {
+                d = QA(b, 105496) | 0;
+                do
+                  if (d) {
+                    h[p >> 3] = 0.0;
+                    h[j >> 3] = 0.0;
+                    c[i >> 2] = j;
+                    c[(i + 4) >> 2] = p;
+                    d = b5(d, 105503, i) | 0;
+                    m = +h[j >> 3];
+                    if (m < 0.0) {
+                      h[j >> 3] = 0.0;
+                      m = 0.0;
+                    }
+                    n = +h[p >> 3];
+                    if (n < 0.0) {
+                      h[p >> 3] = 0.0;
+                      o = 0.0;
+                    } else o = n;
+                    if ((d | 0) <= 0) {
+                      n = q + 16.0;
+                      h[Y >> 3] = n;
+                      m = 8.0;
+                      break;
+                    }
+                    m = m * 72.0;
+                    m = +((~~(m + (m >= 0.0 ? 0.5 : -0.5)) << 1) | 0);
+                    n = q + m;
+                    h[Y >> 3] = n;
+                    if ((d | 0) != 1) {
+                      m = o * 72.0;
+                      m = +((~~(m + (m >= 0.0 ? 0.5 : -0.5)) << 1) | 0);
+                    }
+                  } else {
+                    n = q + 16.0;
+                    h[Y >> 3] = n;
+                    m = 8.0;
+                  }
+                while (0);
+                d = (Y + 8) | 0;
+                h[d >> 3] = +h[d >> 3] + m;
+                d = c[((c[Z >> 2] | 0) + 104) >> 2] | 0;
+                q = n;
+              }
+              s = +h[(d + 24) >> 3];
+              m = +h[c[((c[((xC(b) | 0) + 16) >> 2] | 0) + 8) >> 2] >> 3];
+              if (m > 0.0) {
+                P = m * 72.0;
+                P = +(~~(P + (P >= 0.0 ? 0.5 : -0.5)) | 0);
+                Q = +gN(q, P);
+                h[Y >> 3] = Q;
+                p = (Y + 8) | 0;
+                h[p >> 3] = +gN(+h[p >> 3], P);
+              } else Q = q;
+              d = c[((c[Z >> 2] | 0) + 8) >> 2] | 0;
+              do
+                if (!(a[(d + 12) >> 0] | 0)) {
+                  e = QA(b, 109025) | 0;
+                  if ((e | 0) != 0 ? (a[e >> 0] | 0) != 0 : 0) {
+                    RF(A, xC(b) | 0, e);
+                    d = c[A >> 2] | 0;
+                    g = c[(A + 4) >> 2] | 0;
+                    if (((g & d) | 0) == -1) {
+                      d = KB(b) | 0;
+                      c[G >> 2] = e;
+                      c[(G + 4) >> 2] = d;
+                      gA(0, 105587, G) | 0;
+                      e = 0;
+                      d = 0;
+                      break;
+                    } else {
+                      a[((c[((xC(b) | 0) + 16) >> 2] | 0) + 114) >> 0] = 1;
+                      e = (d + 2) | 0;
+                      d = (g + 2) | 0;
+                      break;
+                    }
+                  } else {
+                    e = 0;
+                    d = 0;
+                  }
+                } else {
+                  d = c[d >> 2] | 0;
+                  if ((a[d >> 0] | 0) == 99 ? (s2(d, 105519) | 0) == 0 : 0) {
+                    e = QA(b, 105526) | 0;
+                    RF(D, xC(b) | 0, e);
+                    d = c[D >> 2] | 0;
+                    g = c[(D + 4) >> 2] | 0;
+                    if (((g & d) | 0) == -1) {
+                      d = KB(b) | 0;
+                      c[H >> 2] = e | 0 ? e : 105536;
+                      c[(H + 4) >> 2] = d;
+                      gA(0, 105542, H) | 0;
+                      e = 0;
+                      d = 0;
+                      break;
+                    } else {
+                      a[((c[((xC(b) | 0) + 16) >> 2] | 0) + 114) >> 0] = 1;
+                      e = (d + 2) | 0;
+                      d = (g + 2) | 0;
+                      break;
+                    }
+                  } else {
+                    e = 0;
+                    d = 0;
+                  }
+                }
+              while (0);
+              P = +(e | 0);
+              h[_ >> 3] = Q > P ? Q : P;
+              P = +h[(Y + 8) >> 3];
+              r = +(d | 0);
+              d = (_ + 8) | 0;
+              h[d >> 3] = P > r ? P : r;
+              e = ((I | 0) < 3) & ((T != 0.0) | (U != 0.0)) ? 120 : I;
+              g = QA(b, 105628) | 0;
+              if (!g) i = 99;
+              else {
+                i = a[g >> 0] | 0;
+                i = (i << 24) >> 24 == 116 ? 116 : (i << 24) >> 24 == 98 ? 98 : 99;
+              }
+              g = c[Z >> 2] | 0;
+              a[((c[(g + 104) >> 2] | 0) + 80) >> 0] = i;
+              if (
+                (e | 0) == 4
+                  ? (T == 0.0 ? ((~~(V + (V >= 0.0 ? 0.5 : -0.5)) | 0) % 90 | 0 | 0) == 0 : 0) & (U == 0.0)
+                  : 0
+              )
+                p = 1;
+              else M = 39;
+              do
+                if ((M | 0) == 39) {
+                  g = c[((c[((c[(g + 8) >> 2] | 0) + 8) >> 2] | 0) + 44) >> 2] | 0;
+                  if (g | 0) {
+                    p = c[g >> 2] | 0;
+                    c[J >> 2] = c[_ >> 2];
+                    c[(J + 4) >> 2] = c[(_ + 4) >> 2];
+                    c[(J + 8) >> 2] = c[(_ + 8) >> 2];
+                    c[(J + 12) >> 2] = c[(_ + 12) >> 2];
+                    ub[p & 63](L, J);
+                    c[_ >> 2] = c[L >> 2];
+                    c[(_ + 4) >> 2] = c[(L + 4) >> 2];
+                    c[(_ + 8) >> 2] = c[(L + 8) >> 2];
+                    c[(_ + 12) >> 2] = c[(L + 12) >> 2];
+                    p = 0;
+                    break;
+                  }
+                  m = +h[d >> 3];
+                  n = m * 1.4142135623730951;
+                  if ((f > n) & ((i << 24) >> 24 == 99)) {
+                    o = m / f;
+                    o = +C(+(1.0 / (1.0 - o * o)));
+                    o = +h[_ >> 3] * o;
+                    h[_ >> 3] = o;
+                  } else {
+                    o = +h[_ >> 3] * 1.4142135623730951;
+                    h[_ >> 3] = o;
+                    h[d >> 3] = n;
+                    m = n;
+                  }
+                  if ((e | 0) > 2) {
+                    z = +E(+(3.141592653589793 / +(e | 0)));
+                    h[_ >> 3] = o / z;
+                    h[d >> 3] = m / z;
+                    p = 0;
+                  } else p = 0;
+                }
+              while (0);
+              m = +h[d >> 3];
+              g = aP(b, c[47165] | 0, 137308) | 0;
+              if ((a[g >> 0] | 0) == 115 ? (s2(g, 108230) | 0) == 0 : 0) {
+                h[_ >> 3] = k;
+                h[d >> 3] = f;
+                N = ($ + 40) | 0;
+                c[N >> 2] = c[N >> 2] | 2048;
+              } else {
+                if (!(((dP(g) | 0) << 24) >> 24)) {
+                  z = +h[_ >> 3];
+                  k = k > z ? k : z;
+                  h[_ >> 3] = k;
+                  z = +h[d >> 3];
+                  f = f > z ? f : z;
+                } else {
+                  M = c[((c[Z >> 2] | 0) + 104) >> 2] | 0;
+                  if (!(!(k < +h[(M + 24) >> 3]) ? !(f < +h[(M + 32) >> 3]) : 0)) {
+                    L = KB(b) | 0;
+                    M = KB(xC(b) | 0) | 0;
+                    c[N >> 2] = L;
+                    c[(N + 4) >> 2] = M;
+                    gA(0, 105637, N) | 0;
+                  }
+                  h[_ >> 3] = k;
+                }
+                h[d >> 3] = f;
+              }
+              if (!X) {
+                z = f;
+                y = k;
+              } else {
+                y = k > f ? k : f;
+                h[d >> 3] = y;
+                h[_ >> 3] = y;
+                z = y;
+              }
+              do
+                if (!(((dP(aP(b, c[47156] | 0, 137308) | 0) | 0) << 24) >> 24)) {
+                  if (p) {
+                    f = +h[(Q > +h[_ >> 3] ? Y : _) >> 3];
+                    break;
+                  }
+                  f = +h[d >> 3];
+                  if (P < f) {
+                    f = +h[_ >> 3] * +C(+(1.0 - (P * P) / (f * f)));
+                    f = Q > f ? Q : f;
+                  } else f = Q;
+                } else f = Q;
+              while (0);
+              g = c[((c[Z >> 2] | 0) + 104) >> 2] | 0;
+              h[(g + 40) >> 3] = s - q + f;
+              A = ($ + 40) | 0;
+              if (!(c[A >> 2] & 2048)) {
+                x = +h[d >> 3] - m;
+                h[(g + 48) >> 3] = (P < r ? r - P + x : x) + P;
+              }
+              j = (W | 0) > 1;
+              g = j ? W : 1;
+              a: do
+                if ((e | 0) < 3) {
+                  g = JK(g << 5) | 0;
+                  k = +h[_ >> 3] * 0.5;
+                  f = +h[d >> 3] * 0.5;
+                  h[g >> 3] = -k;
+                  h[(g + 8) >> 3] = -f;
+                  h[(g + 16) >> 3] = k;
+                  h[(g + 24) >> 3] = f;
+                  if (j) {
+                    e = 1;
+                    i = 2;
+                    while (1) {
+                      if ((e | 0) == (W | 0)) break;
+                      y = k + 4.0;
+                      z = f + 4.0;
+                      h[(g + (i << 4)) >> 3] = -y;
+                      h[(g + (i << 4) + 8) >> 3] = -z;
+                      S = i | 1;
+                      h[(g + (S << 4)) >> 3] = y;
+                      h[(g + (S << 4) + 8) >> 3] = z;
+                      e = (e + 1) | 0;
+                      i = (i + 2) | 0;
+                      k = y;
+                      f = z;
+                    }
+                    h[_ >> 3] = k * 2.0;
+                    h[d >> 3] = f * 2.0;
+                    e = 2;
+                  } else e = 2;
+                } else {
+                  g = JK(O(g << 4, e) | 0) | 0;
+                  i = c[((c[((c[((c[Z >> 2] | 0) + 8) >> 2] | 0) + 8) >> 2] | 0) + 44) >> 2] | 0;
+                  b: do
+                    if (!i) {
+                      q = 6.283185307179586 / +(e | 0);
+                      t = q * 0.5;
+                      r = +F(+t);
+                      s = +L2(+B(+U) + +B(+T), 1.0);
+                      t = (T * 1.4142135623730951) / +E(+t);
+                      u = U * 0.5;
+                      N2((q + -3.141592653589793) * 0.5, R, S);
+                      v = V * 0.017453292519943295;
+                      k = 0.0;
+                      f = 0.0;
+                      m = 0.0;
+                      i = 0;
+                      n = +h[S >> 3] * 0.5;
+                      o = +h[R >> 3] * 0.5;
+                      while (1) {
+                        if ((i | 0) >= (e | 0)) break b;
+                        m = m + q;
+                        N2(m, R, S);
+                        n = +h[S >> 3] * r + n;
+                        o = +h[R >> 3] * r + o;
+                        x = (o * t + s) * n + u * o;
+                        N2(+K(+o, +x) + v, R, S);
+                        x = +L2(x, o);
+                        w = +h[S >> 3] * x * +h[_ >> 3];
+                        x = +h[R >> 3] * x * +h[d >> 3];
+                        ba = +B(+w);
+                        f = ba > f ? ba : f;
+                        ba = +B(+x);
+                        k = ba > k ? ba : k;
+                        h[(g + (i << 4)) >> 3] = w;
+                        h[(g + (i << 4) + 8) >> 3] = x;
+                        if (p) break;
+                        else i = (i + 1) | 0;
+                      }
+                      ba = -w;
+                      h[(g + 16) >> 3] = ba;
+                      h[(g + 24) >> 3] = x;
+                      h[(g + 32) >> 3] = ba;
+                      ba = -x;
+                      h[(g + 40) >> 3] = ba;
+                      h[(g + 48) >> 3] = w;
+                      h[(g + 56) >> 3] = ba;
+                    } else {
+                      ub[c[(i + 4) >> 2] & 63](g, _);
+                      k = +h[d >> 3] * 0.5;
+                      f = +h[_ >> 3] * 0.5;
+                    }
+                  while (0);
+                  f = f * 2.0;
+                  k = k * 2.0;
+                  y = y > f ? y : f;
+                  h[_ >> 3] = y;
+                  ba = z > k ? z : k;
+                  h[d >> 3] = ba;
+                  f = y / f;
+                  k = ba / k;
+                  i = 0;
+                  while (1) {
+                    if ((i | 0) >= (e | 0)) break;
+                    N = (g + (i << 4)) | 0;
+                    b = (g + (i << 4) + 8) | 0;
+                    ba = +h[b >> 3] * k;
+                    h[N >> 3] = +h[N >> 3] * f;
+                    h[b >> 3] = ba;
+                    i = (i + 1) | 0;
+                  }
+                  if (j) {
+                    j = (e + -1) | 0;
+                    k = +h[g >> 3];
+                    m = +h[(g + 8) >> 3];
+                    f = +K(+(m - +h[(g + (j << 4) + 8) >> 3]), +(k - +h[(g + (j << 4)) >> 3]));
+                    j = 0;
+                    c: while (1) {
+                      if ((j | 0) >= (e | 0)) break;
+                      p = (j + 1) | 0;
+                      i = (p | 0) % (e | 0) | 0;
+                      n = +h[(g + (i << 4)) >> 3];
+                      o = +h[(g + (i << 4) + 8) >> 3];
+                      q = +K(+(o - m), +(n - k));
+                      z = (f + 3.141592653589793 - q) * 0.5;
+                      ba = 4.0 / +F(+z);
+                      N2(f - z, R, S);
+                      h[R >> 3] = +h[R >> 3] * ba;
+                      h[S >> 3] = +h[S >> 3] * ba;
+                      i = 1;
+                      f = m;
+                      while (1) {
+                        if ((i | 0) == (W | 0)) {
+                          f = q;
+                          j = p;
+                          k = n;
+                          m = o;
+                          continue c;
+                        }
+                        z = +h[S >> 3] + k;
+                        ba = +h[R >> 3] + f;
+                        b = ((O(i, e) | 0) + j) | 0;
+                        h[(g + (b << 4)) >> 3] = z;
+                        h[(g + (b << 4) + 8) >> 3] = ba;
+                        i = (i + 1) | 0;
+                        k = z;
+                        f = ba;
+                      }
+                    }
+                    j = O(e, (W + -1) | 0) | 0;
+                    i = 0;
+                    while (1) {
+                      if ((i | 0) >= (e | 0)) break a;
+                      S = (i + j) | 0;
+                      z = +h[(g + (S << 4) + 8) >> 3];
+                      y = +B(+(+h[(g + (S << 4)) >> 3])) * 2.0;
+                      ba = +h[_ >> 3];
+                      h[_ >> 3] = y > ba ? y : ba;
+                      z = +B(+z) * 2.0;
+                      ba = +h[d >> 3];
+                      h[d >> 3] = z > ba ? z : ba;
+                      i = (i + 1) | 0;
+                    }
+                  }
+                }
+              while (0);
+              c[$ >> 2] = X;
+              c[($ + 4) >> 2] = W;
+              c[($ + 8) >> 2] = e;
+              h[($ + 16) >> 3] = V;
+              h[($ + 32) >> 3] = U;
+              h[($ + 24) >> 3] = T;
+              c[($ + 44) >> 2] = g;
+              f = +h[_ >> 3];
+              if (!(c[A >> 2] & 2048)) {
+                e = c[Z >> 2] | 0;
+                h[(e + 32) >> 3] = f * 0.013888888888888888;
+              } else {
+                e = c[Z >> 2] | 0;
+                h[(e + 32) >> 3] = +h[(Q > f ? Y : _) >> 3] * 0.013888888888888888;
+                d = ((P > +h[d >> 3] ? Y : _) + 8) | 0;
+              }
+              h[(e + 40) >> 3] = +h[d >> 3] * 0.013888888888888888;
+              c[(e + 12) >> 2] = $;
+              l = aa;
+              return;
+            }
+            function YM(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              o = l;
+              l = (l + 64) | 0;
+              j = (o + 40) | 0;
+              e = (o + 32) | 0;
+              k = (o + 16) | 0;
+              n = o;
+              d = (((c[((c[((xC(a) | 0) + 16) >> 2] | 0) + 116) >> 2] | 0) >>> 2) & 1) ^ 1;
+              m = (a + 16) | 0;
+              f = c[c[((c[m >> 2] | 0) + 104) >> 2] >> 2] | 0;
+              c[47282] = f;
+              f = l2(f) | 0;
+              f = JK((((f | 0) > 1 ? f : 1) + 1) | 0) | 0;
+              b = _M(a, d, 1, f) | 0;
+              if (!b) {
+                c[e >> 2] = c[c[((c[m >> 2] | 0) + 104) >> 2] >> 2];
+                gA(1, 105472, e) | 0;
+                c[47282] = 105493;
+                b = _M(a, d, 1, f) | 0;
+              }
+              U1(f);
+              $M(j, a, b);
+              d = c[m >> 2] | 0;
+              i = +h[(d + 32) >> 3] * 72.0;
+              i = +(~~(i + (i >= 0.0 ? 0.5 : -0.5)) | 0);
+              h[n >> 3] = i;
+              g = +h[(d + 40) >> 3] * 72.0;
+              g = +(~~(g + (g >= 0.0 ? 0.5 : -0.5)) | 0);
+              d = (n + 8) | 0;
+              h[d >> 3] = g;
+              if (!(((dP(aP(a, c[47165] | 0, 137308) | 0) | 0) << 24) >> 24)) {
+                i = +h[(+h[b >> 3] > i ? b : n) >> 3];
+                h[n >> 3] = i;
+                e = (b + 8) | 0;
+                g = +h[((+h[e >> 3] > g ? b : n) + 8) >> 3];
+                h[d >> 3] = g;
+                d = e;
+                e = b;
+              } else {
+                d = (b + 8) | 0;
+                e = b;
+              }
+              a = (dP(aP(a, c[47156] | 0, 137308) | 0) | 0) & 255;
+              c[j >> 2] = c[n >> 2];
+              c[(j + 4) >> 2] = c[(n + 4) >> 2];
+              c[(j + 8) >> 2] = c[(n + 8) >> 2];
+              c[(j + 12) >> 2] = c[(n + 12) >> 2];
+              aN(b, j, a);
+              bN(k, i * -0.5, g * 0.5);
+              c[j >> 2] = c[k >> 2];
+              c[(j + 4) >> 2] = c[(k + 4) >> 2];
+              c[(j + 8) >> 2] = c[(k + 8) >> 2];
+              c[(j + 12) >> 2] = c[(k + 12) >> 2];
+              cN(b, j, 15);
+              n = c[m >> 2] | 0;
+              h[(n + 32) >> 3] = +h[e >> 3] * 0.013888888888888888;
+              h[(n + 40) >> 3] = (+h[d >> 3] + 1.0) * 0.013888888888888888;
+              c[(n + 12) >> 2] = b;
+              l = o;
+              return;
+            }
+            function ZM(a) {
+              a = a | 0;
+              var b = 0.0,
+                d = 0,
+                e = 0.0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0.0,
+                m = 0;
+              j = JK(48) | 0;
+              k = (a + 16) | 0;
+              g = c[((c[((c[((c[k >> 2] | 0) + 8) >> 2] | 0) + 8) >> 2] | 0) + 4) >> 2] | 0;
+              f = +_O(a, c[47146] | 0, 1797693134862315708145274.0e284, 0.0);
+              b = +_O(a, c[47145] | 0, 1797693134862315708145274.0e284, 0.0);
+              f = f < b ? f : b;
+              f =
+                (b == 1797693134862315708145274.0e284) & (f == 1797693134862315708145274.0e284)
+                  ? 0.05
+                  : f > 0.0
+                    ? f > 0.0003
+                      ? f
+                      : 0.0003
+                    : f;
+              i = c[k >> 2] | 0;
+              h[(i + 40) >> 3] = f;
+              h[(i + 32) >> 3] = f;
+              b = f * 72.0;
+              g = ZO(a, c[47160] | 0, g, 0) | 0;
+              i = JK((g | 0) < 1 ? 32 : g << 5) | 0;
+              f = f * 36.0;
+              e = -f;
+              h[i >> 3] = e;
+              h[(i + 8) >> 3] = e;
+              h[(i + 16) >> 3] = f;
+              h[(i + 24) >> 3] = f;
+              if ((g | 0) > 1) {
+                a = 1;
+                d = 2;
+                e = f;
+                b = f;
+                while (1) {
+                  if ((a | 0) == (g | 0)) break;
+                  l = e + 4.0;
+                  f = b + 4.0;
+                  h[(i + (d << 4)) >> 3] = -l;
+                  h[(i + (d << 4) + 8) >> 3] = -f;
+                  m = d | 1;
+                  h[(i + (m << 4)) >> 3] = l;
+                  h[(i + (m << 4) + 8) >> 3] = f;
+                  a = (a + 1) | 0;
+                  d = (d + 2) | 0;
+                  e = l;
+                  b = f;
+                }
+                b = e * 2.0;
+              }
+              c[j >> 2] = 1;
+              c[(j + 4) >> 2] = g;
+              c[(j + 8) >> 2] = 2;
+              m = (j + 16) | 0;
+              c[m >> 2] = 0;
+              c[(m + 4) >> 2] = 0;
+              c[(m + 8) >> 2] = 0;
+              c[(m + 12) >> 2] = 0;
+              c[(m + 16) >> 2] = 0;
+              c[(m + 20) >> 2] = 0;
+              c[(j + 44) >> 2] = i;
+              l = b * 0.013888888888888888;
+              m = c[k >> 2] | 0;
+              h[(m + 32) >> 3] = l;
+              h[(m + 40) >> 3] = l;
+              c[(m + 12) >> 2] = j;
+              return;
+            }
+            function _M(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0;
+              g = JK(72) | 0;
+              n = c[((c[(b + 16) >> 2] | 0) + 104) >> 2] | 0;
+              m = 0;
+              i = 1;
+              j = c[47282] | 0;
+              a: while (1) {
+                k = a[j >> 0] | 0;
+                switch ((k << 24) >> 24) {
+                  case 0:
+                    break a;
+                  case 92: {
+                    j = (j + 1) | 0;
+                    k = a[j >> 0] | 0;
+                    switch ((k << 24) >> 24) {
+                      case 124:
+                      case 125:
+                      case 123:
+                      case 92: {
+                        l = m;
+                        break;
+                      }
+                      default:
+                        E = 4;
+                    }
+                    break;
+                  }
+                  default:
+                    E = 4;
+                }
+                if ((E | 0) == 4) {
+                  E = 0;
+                  switch ((k << 24) >> 24) {
+                    case 123: {
+                      l = (m + 1) | 0;
+                      break;
+                    }
+                    case 125: {
+                      l = (m + -1) | 0;
+                      break;
+                    }
+                    default: {
+                      l = m;
+                      i = (i + (((m | 0) == 0) & ((k << 24) >> 24 == 124) & 1)) | 0;
+                    }
+                  }
+                  if ((l | 0) < 0) break;
+                }
+                m = l;
+                j = (j + 1) | 0;
+              }
+              B = (g + 56) | 0;
+              c[B >> 2] = JK(i << 2) | 0;
+              a[(g + 64) >> 0] = d;
+              y = ((d | 0) == 0) & 1;
+              z = (n + 82) | 0;
+              A = (f + 1) | 0;
+              v = (e | 0) != 0;
+              w = (n + 16) | 0;
+              x = (n + 4) | 0;
+              u = (n + 8) | 0;
+              k = 0;
+              m = 0;
+              d = 0;
+              t = 0;
+              l = 0;
+              e = 0;
+              n = f;
+              i = 0;
+              j = 0;
+              b: while (1) {
+                p = k;
+                k = 0;
+                c: while (1) {
+                  d: while (1) {
+                    s = e;
+                    e: while (1) {
+                      r = k;
+                      o = i;
+                      f: while (1) {
+                        q = m;
+                        g: while (1) {
+                          while (1) {
+                            if (t) {
+                              E = 78;
+                              break b;
+                            }
+                            m = c[47282] | 0;
+                            i = a[m >> 0] | 0;
+                            if (((i + -1) & 255) >= 31) break;
+                            c[47282] = m + 1;
+                          }
+                          switch (((i << 24) >> 24) | 0) {
+                            case 92: {
+                              E = 53;
+                              break d;
+                            }
+                            case 0:
+                            case 124:
+                            case 125:
+                              break e;
+                            case 60:
+                              break f;
+                            case 62:
+                              break g;
+                            case 123:
+                              break;
+                            default: {
+                              k = d;
+                              i = m;
+                              break d;
+                            }
+                          }
+                          i = (m + 1) | 0;
+                          c[47282] = i;
+                          if (l | 0) {
+                            E = 34;
+                            break b;
+                          }
+                          if (!(a[i >> 0] | 0)) {
+                            E = 34;
+                            break b;
+                          }
+                          e = _M(b, y, 0, f) | 0;
+                          c[((c[B >> 2] | 0) + (q << 2)) >> 2] = e;
+                          if (!e) {
+                            E = 36;
+                            break b;
+                          } else {
+                            q = (q + 1) | 0;
+                            l = 4;
+                          }
+                        }
+                        if (a[z >> 0] | 0) {
+                          k = d;
+                          i = m;
+                          break d;
+                        }
+                        if (!(l & 16)) {
+                          E = 27;
+                          break b;
+                        }
+                        if (o >>> 0 > A >>> 0 ? ((C = (o + -1) | 0), (C | 0) != (s | 0)) : 0)
+                          i = (a[C >> 0] | 0) == 32 ? C : o;
+                        else i = o;
+                        a[i >> 0] = 0;
+                        r = D4(f) | 0;
+                        c[47282] = (c[47282] | 0) + 1;
+                        m = q;
+                        l = l & -17;
+                        o = i;
+                      }
+                      if ((l & 6) | 0) {
+                        E = 22;
+                        break b;
+                      }
+                      if (a[z >> 0] | 0) {
+                        k = d;
+                        i = m;
+                        break d;
+                      }
+                      c[47282] = m + 1;
+                      m = q;
+                      l = l | 18;
+                      k = r;
+                      s = f;
+                      i = f;
+                    }
+                    if (!((((l & 16) | 0) == 0) & (v | ((i << 24) >> 24 != 0)))) {
+                      E = 38;
+                      break b;
+                    }
+                    if (!(l & 4)) {
+                      k = JK(72) | 0;
+                      c[((c[B >> 2] | 0) + (q << 2)) >> 2] = k;
+                      m = (q + 1) | 0;
+                    } else {
+                      k = p;
+                      m = q;
+                    }
+                    if (r | 0) c[(k + 60) >> 2] = r;
+                    if (!(l & 5)) {
+                      a[(f + j) >> 0] = 32;
+                      l = l | 1;
+                      j = (j + 1) | 0;
+                    }
+                    i = (f + j) | 0;
+                    if (l & 1) {
+                      if ((j | 0) > 1 ? ((D = (i + -1) | 0), (D | 0) != (n | 0)) : 0) i = (a[D >> 0] | 0) == 32 ? D : i;
+                      a[i >> 0] = 0;
+                      n = D4(f) | 0;
+                      c[(k + 52) >> 2] = zK(b, n, a[z >> 0] | 0 ? 2 : 0, +h[w >> 3], c[x >> 2] | 0, c[u >> 2] | 0) | 0;
+                      a[(k + 64) >> 0] = 1;
+                      n = f;
+                      j = 0;
+                    }
+                    i = c[47282] | 0;
+                    switch (a[i >> 0] | 0) {
+                      case 0: {
+                        t = 1;
+                        e = s;
+                        i = o;
+                        continue b;
+                      }
+                      case 125: {
+                        E = 51;
+                        break b;
+                      }
+                      default: {
+                      }
+                    }
+                    c[47282] = i + 1;
+                    p = k;
+                    l = 0;
+                    k = 0;
+                    e = s;
+                    i = o;
+                  }
+                  h: do
+                    if ((E | 0) == 53) {
+                      E = 0;
+                      k = (f + j) | 0;
+                      i = (m + 1) | 0;
+                      switch (a[i >> 0] | 0) {
+                        case 0: {
+                          k = d;
+                          i = m;
+                          break h;
+                        }
+                        case 62:
+                        case 60:
+                        case 124:
+                        case 125:
+                        case 123: {
+                          k = d;
+                          break;
+                        }
+                        case 32: {
+                          if (!(a[z >> 0] | 0)) k = 1;
+                          else E = 55;
+                          break;
+                        }
+                        default:
+                          E = 55;
+                      }
+                      if ((E | 0) == 55) {
+                        E = 0;
+                        a[k >> 0] = 92;
+                        k = d;
+                        l = l | 9;
+                        j = (j + 1) | 0;
+                      }
+                      c[47282] = i;
+                    }
+                  while (0);
+                  d = (f + j) | 0;
+                  if ((l & 4) | 0 ? (a[i >> 0] | 0) != 32 : 0) {
+                    E = 59;
+                    break b;
+                  }
+                  if (!(l & 24)) l = (a[i >> 0] | 0) == 32 ? l : l | 9;
+                  if (!(l & 8))
+                    if (!(l & 16)) e = s;
+                    else {
+                      m = a[i >> 0] | 0;
+                      d = (k | 0) != 0;
+                      if (!(d | ((m << 24) >> 24 != 32)))
+                        if ((o | 0) != (f | 0))
+                          if ((a[(o + -1) >> 0] | 0) == 32) m = o;
+                          else E = 73;
+                        else m = f;
+                      else E = 73;
+                      if ((E | 0) == 73) {
+                        E = 0;
+                        a[o >> 0] = m;
+                        m = (o + 1) | 0;
+                        i = c[47282] | 0;
+                      }
+                      e = d ? (m + -1) | 0 : s;
+                      o = m;
+                    }
+                  else {
+                    m = a[i >> 0] | 0;
+                    e = (k | 0) != 0;
+                    if (
+                      !((!(e | ((m << 24) >> 24 != 32)) ? (a[(d + -1) >> 0] | 0) == 32 : 0) ? (a[z >> 0] | 0) == 0 : 0)
+                    ) {
+                      a[d >> 0] = m;
+                      j = (j + 1) | 0;
+                    }
+                    if (e) {
+                      e = s;
+                      n = (f + j + -1) | 0;
+                    } else e = s;
+                  }
+                  i = (i + 1) | 0;
+                  c[47282] = i;
+                  while (1) {
+                    if ((a[i >> 0] | 0) >= 0) {
+                      m = q;
+                      d = k;
+                      k = r;
+                      i = o;
+                      continue c;
+                    }
+                    s = (i + 1) | 0;
+                    c[47282] = s;
+                    a[(f + j) >> 0] = a[i >> 0] | 0;
+                    j = (j + 1) | 0;
+                    i = s;
+                  }
+                }
+              }
+              if ((E | 0) == 22) {
+                dN(g, r);
+                g = 0;
+              } else if ((E | 0) == 27) {
+                dN(g, r);
+                g = 0;
+              } else if ((E | 0) == 34) {
+                dN(g, r);
+                g = 0;
+              } else if ((E | 0) == 36) {
+                dN(g, r);
+                g = 0;
+              } else if ((E | 0) == 38) {
+                dN(g, r);
+                g = 0;
+              } else if ((E | 0) == 51) {
+                c[47282] = i + 1;
+                c[(g + 48) >> 2] = m;
+              } else if ((E | 0) == 59) {
+                dN(g, r);
+                g = 0;
+              } else if ((E | 0) == 78) c[(g + 48) >> 2] = q;
+              return g | 0;
+            }
+            function $M(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0;
+              u = l;
+              l = (l + 64) | 0;
+              k = (u + 48) | 0;
+              m = (u + 40) | 0;
+              n = (u + 32) | 0;
+              t = (u + 16) | 0;
+              s = u;
+              j = c[(e + 52) >> 2] | 0;
+              a: do
+                if (!j) {
+                  n = (t + 8) | 0;
+                  o = (e + 48) | 0;
+                  p = (e + 56) | 0;
+                  q = (e + 64) | 0;
+                  r = (s + 8) | 0;
+                  c[t >> 2] = 0;
+                  c[(t + 4) >> 2] = 0;
+                  c[(t + 8) >> 2] = 0;
+                  c[(t + 12) >> 2] = 0;
+                  j = 0;
+                  while (1) {
+                    if ((j | 0) >= (c[o >> 2] | 0)) break a;
+                    $M(s, d, c[((c[p >> 2] | 0) + (j << 2)) >> 2] | 0);
+                    if (!(a[q >> 0] | 0)) {
+                      h[n >> 3] = +h[n >> 3] + +h[r >> 3];
+                      k = t;
+                      m = +h[t >> 3] > +h[s >> 3] ? t : s;
+                    } else {
+                      h[t >> 3] = +h[t >> 3] + +h[s >> 3];
+                      k = n;
+                      m = ((+h[n >> 3] > +h[r >> 3] ? t : s) + 8) | 0;
+                    }
+                    h[k >> 3] = +h[m >> 3];
+                    j = (j + 1) | 0;
+                  }
+                } else {
+                  g = +h[(j + 24) >> 3];
+                  f = +h[(j + 32) >> 3];
+                  if ((g > 0.0) | (f > 0.0)) {
+                    j = QA(d, 105496) | 0;
+                    do
+                      if (j) {
+                        c[k >> 2] = m;
+                        c[(k + 4) >> 2] = n;
+                        j = b5(j, 105503, k) | 0;
+                        if ((j | 0) <= 0) {
+                          i = 8.0;
+                          g = g + 16.0;
+                          break;
+                        }
+                        i = +h[m >> 3] * 72.0;
+                        i = +((~~(i + (i >= 0.0 ? 0.5 : -0.5)) << 1) | 0);
+                        g = g + i;
+                        if ((j | 0) != 1) {
+                          i = +h[n >> 3] * 72.0;
+                          i = +((~~(i + (i >= 0.0 ? 0.5 : -0.5)) << 1) | 0);
+                        }
+                      } else {
+                        i = 8.0;
+                        g = g + 16.0;
+                      }
+                    while (0);
+                    f = i + f;
+                  }
+                  h[t >> 3] = g;
+                  h[(t + 8) >> 3] = f;
+                }
+              while (0);
+              c[e >> 2] = c[t >> 2];
+              c[(e + 4) >> 2] = c[(t + 4) >> 2];
+              c[(e + 8) >> 2] = c[(t + 8) >> 2];
+              c[(e + 12) >> 2] = c[(t + 12) >> 2];
+              c[b >> 2] = c[t >> 2];
+              c[(b + 4) >> 2] = c[(t + 4) >> 2];
+              c[(b + 8) >> 2] = c[(t + 8) >> 2];
+              c[(b + 12) >> 2] = c[(t + 12) >> 2];
+              l = u;
+              return;
+            }
+            function aN(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0.0,
+                g = 0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0.0,
+                r = 0.0,
+                s = 0;
+              s = l;
+              l = (l + 32) | 0;
+              o = (s + 16) | 0;
+              p = s;
+              q = +h[d >> 3];
+              i = q - +h[b >> 3];
+              r = +h[(d + 8) >> 3];
+              f = r - +h[(b + 8) >> 3];
+              c[b >> 2] = c[d >> 2];
+              c[(b + 4) >> 2] = c[(d + 4) >> 2];
+              c[(b + 8) >> 2] = c[(d + 8) >> 2];
+              c[(b + 12) >> 2] = c[(d + 12) >> 2];
+              d = c[(b + 52) >> 2] | 0;
+              if (!(((e | 0) != 0) | ((d | 0) == 0))) {
+                n = (d + 40) | 0;
+                h[n >> 3] = +h[n >> 3] + i;
+                n = (d + 48) | 0;
+                h[n >> 3] = +h[n >> 3] + f;
+              }
+              m = (b + 48) | 0;
+              d = c[m >> 2] | 0;
+              a: do
+                if (d | 0) {
+                  n = (b + 64) | 0;
+                  f = ((a[n >> 0] | 0) == 0 ? f : i) / +(d | 0);
+                  k = (b + 56) | 0;
+                  j = 0;
+                  while (1) {
+                    if ((j | 0) >= (d | 0)) break a;
+                    b = c[((c[k >> 2] | 0) + (j << 2)) >> 2] | 0;
+                    g = (j + 1) | 0;
+                    d = (~~(f * +(g | 0)) - ~~(f * +(j | 0))) | 0;
+                    if (!(a[n >> 0] | 0)) bN(p, q, +h[(b + 8) >> 3] + +(d | 0));
+                    else bN(p, +h[b >> 3] + +(d | 0), r);
+                    c[o >> 2] = c[p >> 2];
+                    c[(o + 4) >> 2] = c[(p + 4) >> 2];
+                    c[(o + 8) >> 2] = c[(p + 8) >> 2];
+                    c[(o + 12) >> 2] = c[(p + 12) >> 2];
+                    aN(b, o, e);
+                    j = g;
+                    d = c[m >> 2] | 0;
+                  }
+                }
+              while (0);
+              l = s;
+              return;
+            }
+            function bN(a, b, c) {
+              a = a | 0;
+              b = +b;
+              c = +c;
+              h[a >> 3] = b;
+              h[(a + 8) >> 3] = c;
+              return;
+            }
+            function cN(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0.0,
+                s = 0.0;
+              q = l;
+              l = (l + 48) | 0;
+              j = (q + 32) | 0;
+              n = (q + 16) | 0;
+              m = q;
+              a[(b + 65) >> 0] = e;
+              k = (b + 16) | 0;
+              s = +h[d >> 3];
+              p = (d + 8) | 0;
+              r = +h[p >> 3];
+              bN(n, s, r - +h[(b + 8) >> 3]);
+              c[k >> 2] = c[n >> 2];
+              c[(k + 4) >> 2] = c[(n + 4) >> 2];
+              c[(k + 8) >> 2] = c[(n + 8) >> 2];
+              c[(k + 12) >> 2] = c[(n + 12) >> 2];
+              k = (b + 32) | 0;
+              bN(m, +h[b >> 3] + s, r);
+              c[k >> 2] = c[m >> 2];
+              c[(k + 4) >> 2] = c[(m + 4) >> 2];
+              c[(k + 8) >> 2] = c[(m + 8) >> 2];
+              c[(k + 12) >> 2] = c[(m + 12) >> 2];
+              k = c[(b + 48) >> 2] | 0;
+              m = (k + -1) | 0;
+              n = (e | 0) == 0;
+              o = (b + 56) | 0;
+              i = (b + 64) | 0;
+              g = 0;
+              while (1) {
+                if ((g | 0) >= (k | 0)) break;
+                do
+                  if (!n) {
+                    b = (g | 0) == 0;
+                    f = (g | 0) == (m | 0);
+                    if (!(a[i >> 0] | 0))
+                      if (b) {
+                        b = f ? 15 : 14;
+                        break;
+                      } else {
+                        b = f ? 11 : 10;
+                        break;
+                      }
+                    else if (b) {
+                      b = f ? 15 : 13;
+                      break;
+                    } else {
+                      b = f ? 7 : 5;
+                      break;
+                    }
+                  } else b = 0;
+                while (0);
+                f = c[((c[o >> 2] | 0) + (g << 2)) >> 2] | 0;
+                c[j >> 2] = c[d >> 2];
+                c[(j + 4) >> 2] = c[(d + 4) >> 2];
+                c[(j + 8) >> 2] = c[(d + 8) >> 2];
+                c[(j + 12) >> 2] = c[(d + 12) >> 2];
+                cN(f, j, b & e);
+                if (!(a[i >> 0] | 0))
+                  h[p >> 3] = +h[p >> 3] - +h[((c[((c[o >> 2] | 0) + (g << 2)) >> 2] | 0) + 8) >> 3];
+                else h[d >> 3] = +h[c[((c[o >> 2] | 0) + (g << 2)) >> 2] >> 3] + +h[d >> 3];
+                g = (g + 1) | 0;
+              }
+              l = q;
+              return;
+            }
+            function dN(a, b) {
+              a = a | 0;
+              b = b | 0;
+              eN(a);
+              U1(b);
+              return;
+            }
+            function eN(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              d = (a + 48) | 0;
+              e = (a + 56) | 0;
+              b = 0;
+              while (1) {
+                if ((b | 0) >= (c[d >> 2] | 0)) break;
+                eN(c[((c[e >> 2] | 0) + (b << 2)) >> 2] | 0);
+                b = (b + 1) | 0;
+              }
+              U1(c[(a + 60) >> 2] | 0);
+              CK(c[(a + 52) >> 2] | 0);
+              U1(c[e >> 2] | 0);
+              U1(a);
+              return;
+            }
+            function fN(a) {
+              a = a | 0;
+              var b = 0.0,
+                d = 0.0;
+              d = +_O(a, c[47146] | 0, 0.0, 0.01);
+              b = +_O(a, c[47145] | 0, 0.0, 0.02);
+              b = (d > b ? d : b) * 72.0;
+              return +(+(~~(b + (b >= 0.0 ? 0.5 : -0.5)) | 0));
+            }
+            function gN(a, b) {
+              a = +a;
+              b = +b;
+              var c = 0;
+              c = ~~(a / b);
+              return +(+((((+(c | 0) * b + 1.0e-5 < a) & 1) + c) | 0) * b);
+            }
+            function hN(a) {
+              a = a | 0;
+              a = c[((c[(a + 16) >> 2] | 0) + 8) >> 2] | 0;
+              if (!a) a = 0;
+              else a = ((c[c[(a + 4) >> 2] >> 2] | 0) == 91) & 1;
+              return a | 0;
+            }
+            function iN(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              f = c[47283] | 0;
+              a: do
+                if (!f) d = 0;
+                else {
+                  g = c[47284] | 0;
+                  e = 0;
+                  while (1) {
+                    if ((e | 0) >= (g | 0)) {
+                      d = 0;
+                      break a;
+                    }
+                    d = c[(f + (e << 2)) >> 2] | 0;
+                    h = c[d >> 2] | 0;
+                    if ((a[h >> 0] | 0) == (a[b >> 0] | 0) ? (s2(h, b) | 0) == 0 : 0) break a;
+                    e = (e + 1) | 0;
+                  }
+                }
+              while (0);
+              return d | 0;
+            }
+            function jN(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              if (mP(QA(d, 105526) | 0) | 0)
+                if ((a[b >> 0] | 0) == 101 ? (s2(b, 105685) | 0) == 0 : 0) {
+                  d = 101;
+                  g = 6;
+                } else {
+                  b = 105519;
+                  g = 4;
+                }
+              else g = 4;
+              if ((g | 0) == 4) {
+                d = a[b >> 0] | 0;
+                if ((d << 24) >> 24 == 99)
+                  if (!(s2(b, 105519) | 0)) g = 11;
+                  else {
+                    d = 99;
+                    g = 6;
+                  }
+                else g = 6;
+              }
+              a: do
+                if ((g | 0) == 6) {
+                  e = 20848;
+                  while (1) {
+                    f = c[e >> 2] | 0;
+                    if (!f) {
+                      g = 11;
+                      break a;
+                    }
+                    if ((a[f >> 0] | 0) == (d << 24) >> 24 ? (s2(f, b) | 0) == 0 : 0) {
+                      b = e;
+                      break a;
+                    }
+                    e = (e + 16) | 0;
+                  }
+                }
+              while (0);
+              if ((g | 0) == 11) b = kN(b) | 0;
+              return b | 0;
+            }
+            function kN(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 16) | 0;
+              g = h;
+              d = iN(b) | 0;
+              if (!d) {
+                f = c[47284] | 0;
+                d = (f + 1) | 0;
+                c[47284] = d;
+                e = c[47283] | 0;
+                if (!e) d = KK(d << 2) | 0;
+                else d = MK(e, d << 2) | 0;
+                c[47283] = d;
+                d = JK(16) | 0;
+                c[((c[47283] | 0) + (f << 2)) >> 2] = d;
+                c[d >> 2] = c[5212];
+                c[(d + 4) >> 2] = c[5213];
+                c[(d + 8) >> 2] = c[5214];
+                c[(d + 12) >> 2] = c[5215];
+                e = D4(b) | 0;
+                c[d >> 2] = e;
+                do
+                  if (!0) {
+                    if ((a[b >> 0] | 0) == 99 ? (s2(b, 105519) | 0) == 0 : 0) {
+                      e = 1;
+                      break;
+                    }
+                    c[g >> 2] = c[5212];
+                    c[(g + 4) >> 2] = e;
+                    gA(0, 105690, g) | 0;
+                    e = 0;
+                  } else e = 1;
+                while (0);
+                a[(d + 12) >> 0] = e;
+              }
+              l = h;
+              return d | 0;
+            }
+            function lN(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0,
+                d = 0.0;
+              d = +h[b >> 3] * 0.5257311121191336;
+              c = +h[(b + 8) >> 3] * 0.8944271909999159;
+              c = d > c ? d : c;
+              h[a >> 3] = c * 4.97979656976556;
+              h[(a + 8) >> 3] = c * 4.73606797749979;
+              return;
+            }
+            function mN(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0,
+                d = 0.0,
+                e = 0.0,
+                f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0,
+                l = 0,
+                m = 0.0;
+              d = +h[b >> 3];
+              k = (b + 8) | 0;
+              e = +h[k >> 3];
+              c = e / d;
+              if (!(c > 0.9510565162951536))
+                if (c < 0.9510565162951536) {
+                  j = d;
+                  e = d * 0.9510565162951536;
+                } else j = d;
+              else j = e * 1.0514622242382672;
+              d = j * 0.5257311121191336;
+              g = j * 0.20081141588622725;
+              i = j * 0.05020285397155681;
+              c = 0.3141592653589793;
+              f = 0;
+              while (1) {
+                if ((f | 0) >= 10) break;
+                h[(a + (f << 4)) >> 3] = +E(+c) * d;
+                h[(a + (f << 4) + 8) >> 3] = +F(+c) * d - i;
+                m = c + 0.6283185307179586;
+                l = f | 1;
+                h[(a + (l << 4)) >> 3] = +E(+m) * g;
+                h[(a + (l << 4) + 8) >> 3] = +F(+m) * g - i;
+                c = c + 1.2566370614359172;
+                f = (f + 2) | 0;
+              }
+              h[b >> 3] = j;
+              h[k >> 3] = e;
+              return;
+            }
+            function nN(a) {
+              a = a | 0;
+              a = c[((c[(a + 16) >> 2] | 0) + 12) >> 2] | 0;
+              if (a | 0) {
+                U1(c[(a + 44) >> 2] | 0);
+                U1(a);
+              }
+              return;
+            }
+            function oN(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              o = l;
+              l = (l + 80) | 0;
+              k = (o + 40) | 0;
+              g = o;
+              n = (o + 64) | 0;
+              h = (o + 56) | 0;
+              if (!(a[e >> 0] | 0)) {
+                g = 4208;
+                h = (b + 40) | 0;
+                do {
+                  c[b >> 2] = c[g >> 2];
+                  b = (b + 4) | 0;
+                  g = (g + 4) | 0;
+                } while ((b | 0) < (h | 0));
+              } else {
+                i = (f | 0) == 0 ? 106356 : f;
+                c[n >> 2] = 15;
+                j = (d + 16) | 0;
+                f = c[j >> 2] | 0;
+                do
+                  if (a[((c[(f + 104) >> 2] | 0) + 82) >> 0] | 0) {
+                    f = pU(d, e, n) | 0;
+                    if (!f) {
+                      f = c[j >> 2] | 0;
+                      m = 8;
+                      break;
+                    }
+                    if (CN(d, f, g, i, c[n >> 2] | 0, 0) | 0) {
+                      c[k >> 2] = KB(d) | 0;
+                      c[(k + 4) >> 2] = e;
+                      c[(k + 8) >> 2] = i;
+                      gA(0, 106358, k) | 0;
+                    }
+                  } else m = 8;
+                while (0);
+                if ((m | 0) == 8) {
+                  if ((c[((c[(f + 8) >> 2] | 0) + 8) >> 2] | 0) == 1664) h = 0;
+                  else {
+                    c[h >> 2] = d;
+                    c[(h + 4) >> 2] = 0;
+                  }
+                  if (CN(d, 0, g, e, c[n >> 2] | 0, h) | 0) DN(d, e);
+                }
+                c[(g + 36) >> 2] = 0;
+                h = (b + 40) | 0;
+                do {
+                  c[b >> 2] = c[g >> 2];
+                  b = (b + 4) | 0;
+                  g = (g + 4) | 0;
+                } while ((b | 0) < (h | 0));
+              }
+              l = o;
+              return;
+            }
+            function pN(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0.0,
+                t = 0;
+              r = l;
+              l = (l + 112) | 0;
+              n = (r + 96) | 0;
+              m = (r + 80) | 0;
+              p = (r + 64) | 0;
+              k = (r + 48) | 0;
+              q = (r + 32) | 0;
+              o = r;
+              f = (r + 16) | 0;
+              if (!a) {
+                c[47287] = 0;
+                a = 0;
+              } else {
+                g = c[(a + 4) >> 2] | 0;
+                a = c[a >> 2] | 0;
+                i = ((c[((c[((xC(a) | 0) + 16) >> 2] | 0) + 116) >> 2] & 3) * 90) | 0;
+                c[n >> 2] = c[b >> 2];
+                c[(n + 4) >> 2] = c[(b + 4) >> 2];
+                c[(n + 8) >> 2] = c[(b + 8) >> 2];
+                c[(n + 12) >> 2] = c[(b + 12) >> 2];
+                mK(f, n, i);
+                c[q >> 2] = c[f >> 2];
+                c[(q + 4) >> 2] = c[(f + 4) >> 2];
+                c[(q + 8) >> 2] = c[(f + 8) >> 2];
+                c[(q + 12) >> 2] = c[(f + 12) >> 2];
+                a: do
+                  if (g) {
+                    d = +h[(g + 8) >> 3];
+                    e = +h[(g + 24) >> 3];
+                    s = +h[q >> 3];
+                    if ((+h[g >> 3] <= s ? s <= +h[(g + 16) >> 3] : 0) ? ((j = +h[(q + 8) >> 3]), d <= j) : 0)
+                      a = (j <= e) & 1;
+                    else a = 0;
+                  } else {
+                    if ((a | 0) == (c[47287] | 0)) {
+                      f = c[47288] | 0;
+                      g = c[47290] | 0;
+                      i = c[47289] | 0;
+                    } else {
+                      g = c[((c[(a + 16) >> 2] | 0) + 12) >> 2] | 0;
+                      c[47291] = g;
+                      i = c[(g + 44) >> 2] | 0;
+                      c[47289] = i;
+                      f = c[(g + 8) >> 2] | 0;
+                      c[47288] = f;
+                      g = O(((c[(g + 4) >> 2] | 0) + -1) | 0, f) | 0;
+                      g = (g | 0) > 0 ? g : 0;
+                      c[47290] = g;
+                      c[47287] = a;
+                    }
+                    a = 0;
+                    b = 0;
+                    while (1) {
+                      if ((a | 0) >= (f | 0)) {
+                        a = 1;
+                        break a;
+                      }
+                      t = (i + ((g + a) << 4)) | 0;
+                      c[o >> 2] = c[t >> 2];
+                      c[(o + 4) >> 2] = c[(t + 4) >> 2];
+                      c[(o + 8) >> 2] = c[(t + 8) >> 2];
+                      c[(o + 12) >> 2] = c[(t + 12) >> 2];
+                      t = (i + ((g + (((a + 4) | 0) % (f | 0) | 0)) << 4)) | 0;
+                      c[k >> 2] = c[q >> 2];
+                      c[(k + 4) >> 2] = c[(q + 4) >> 2];
+                      c[(k + 8) >> 2] = c[(q + 8) >> 2];
+                      c[(k + 12) >> 2] = c[(q + 12) >> 2];
+                      c[p >> 2] = c[46614];
+                      c[(p + 4) >> 2] = c[46615];
+                      c[(p + 8) >> 2] = c[46616];
+                      c[(p + 12) >> 2] = c[46617];
+                      c[m >> 2] = c[o >> 2];
+                      c[(m + 4) >> 2] = c[(o + 4) >> 2];
+                      c[(m + 8) >> 2] = c[(o + 8) >> 2];
+                      c[(m + 12) >> 2] = c[(o + 12) >> 2];
+                      c[n >> 2] = c[t >> 2];
+                      c[(n + 4) >> 2] = c[(t + 4) >> 2];
+                      c[(n + 8) >> 2] = c[(t + 8) >> 2];
+                      c[(n + 12) >> 2] = c[(t + 12) >> 2];
+                      b = (b + (((BN(k, p, m, n) | 0) == 0) & 1)) | 0;
+                      if ((b | 0) == 2) {
+                        a = 0;
+                        break;
+                      } else a = (a + 2) | 0;
+                    }
+                  }
+                while (0);
+              }
+              l = r;
+              return a | 0;
+            }
+            function qN(b, d, e, f, g) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              e = c[(b + 16) >> 2] | 0;
+              if ((a[((c[(e + 104) >> 2] | 0) + 82) >> 0] | 0) != 0 ? (a[(e + 145) >> 0] | 0) != 0 : 0)
+                b = sU(b, d, 0, f, g) | 0;
+              else b = 0;
+              return b | 0;
+            }
+            function rN(e, f) {
+              e = e | 0;
+              f = f | 0;
+              var i = 0,
+                j = 0,
+                k = 0.0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0.0,
+                C = 0.0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                P = 0,
+                Q = 0,
+                R = 0;
+              P = l;
+              l = (l + 48) | 0;
+              H = (P + 24) | 0;
+              G = (P + 16) | 0;
+              A = (P + 8) | 0;
+              z = P;
+              L = (P + 32) | 0;
+              n = (P + 28) | 0;
+              M = c[(e + 16) >> 2] | 0;
+              N = (M + 208) | 0;
+              i = c[N >> 2] | 0;
+              if ((i | 0) == 0 ? (b[(M + 260) >> 1] & 1) == 0 : 0) J = 0;
+              else E = 4;
+              if ((E | 0) == 4)
+                if (!(c[(e + 152) >> 2] & 4)) {
+                  cS(e, i, c[(M + 228) >> 2] | 0, c[(M + 244) >> 2] | 0, c[(M + 212) >> 2] | 0);
+                  J = 1;
+                } else J = 1;
+              I = (f + 16) | 0;
+              i = c[I >> 2] | 0;
+              r = c[(i + 12) >> 2] | 0;
+              F = c[(r + 44) >> 2] | 0;
+              K = c[(r + 8) >> 2] | 0;
+              r = c[(r + 4) >> 2] | 0;
+              if ((c[47285] | 0) < (K | 0)) {
+                i = (K + 5) | 0;
+                c[47285] = i;
+                j = c[47286] | 0;
+                if (!j) i = KK(i << 4) | 0;
+                else i = MK(j, i << 4) | 0;
+                c[47286] = i;
+                i = c[I >> 2] | 0;
+              }
+              D = ((c[(i + 104) >> 2] | 0) + 56) | 0;
+              i = (i + 16) | 0;
+              c[D >> 2] = c[i >> 2];
+              c[(D + 4) >> 2] = c[(i + 4) >> 2];
+              c[(D + 8) >> 2] = c[(i + 8) >> 2];
+              c[(D + 12) >> 2] = c[(i + 12) >> 2];
+              D = c[I >> 2] | 0;
+              B = +h[(D + 32) >> 3] * 72.0;
+              B = (+h[(D + 96) >> 3] + +h[(D + 88) >> 3]) / +(~~(B + (B >= 0.0 ? 0.5 : -0.5)) | 0);
+              C = +h[(D + 40) >> 3] * 72.0;
+              C = +h[(D + 80) >> 3] / +(~~(C + (C >= 0.0 ? 0.5 : -0.5)) | 0);
+              D = sN(e, f) | 0;
+              c[L >> 2] = 0;
+              i = d[((c[I >> 2] | 0) + 117) >> 0] | 0;
+              do
+                if (!(i & 1)) {
+                  if ((i & 2) | 0) {
+                    s = bP(f, 0, 106256) | 0;
+                    hS(e, s);
+                    jS(e, bP(f, 0, 106264) | 0);
+                    j = 0;
+                    i = 1;
+                    break;
+                  }
+                  if ((i & 8) | 0) {
+                    s = bP(f, 0, 106272) | 0;
+                    hS(e, s);
+                    jS(e, bP(f, 0, 106280) | 0);
+                    j = 0;
+                    i = 1;
+                    break;
+                  }
+                  if ((i & 4) | 0) {
+                    s = bP(f, 0, 106288) | 0;
+                    hS(e, s);
+                    jS(e, bP(f, 0, 106296) | 0);
+                    j = 0;
+                    i = 1;
+                    break;
+                  }
+                  if (!(D & 1))
+                    if (!(D & 576)) {
+                      j = 0;
+                      i = 0;
+                    } else {
+                      j = tN(f) | 0;
+                      i = 1;
+                    }
+                  else {
+                    j = tN(f) | 0;
+                    if (!(((JJ(j, L, n) | 0) << 24) >> 24)) {
+                      jS(e, j);
+                      i = 1;
+                    } else {
+                      jS(e, c[L >> 2] | 0);
+                      i = c[(L + 4) >> 2] | 0;
+                      m = ZO(f, c[47173] | 0, 0, 0) | 0;
+                      k = +g[n >> 2];
+                      if (!i) kS(e, 137314, m, k);
+                      else kS(e, i, m, k);
+                      i = ((D & 2) >>> 1) | 2;
+                    }
+                  }
+                  s = uN(e, f) | 0;
+                } else {
+                  s = bP(f, 0, 106240) | 0;
+                  hS(e, s);
+                  jS(e, bP(f, 0, 106248) | 0);
+                  j = 0;
+                  i = 1;
+                }
+              while (0);
+              m = c[((c[I >> 2] | 0) + 8) >> 2] | 0;
+              if (a[(m + 12) >> 0] | 0) {
+                m = c[m >> 2] | 0;
+                if ((a[m >> 0] | 0) == 99) {
+                  m = (s2(m, 105519) | 0) == 0;
+                  E = 33;
+                } else u = 1;
+              } else {
+                m = 1;
+                E = 33;
+              }
+              if ((E | 0) == 33) {
+                m = m ^ 1;
+                if (((r | 0) != 0) | ((i << 24) >> 24 == 0) | m) u = m;
+                else {
+                  hS(e, 137379);
+                  r = 1;
+                  u = 0;
+                }
+              }
+              v = (K | 0) < 3;
+              w = ((D & 512) | 0) != 0;
+              y = ((D & 8) | 0) == 0;
+              x = ((D & 64) | 0) == 0;
+              p = ((D & 1024) | 0) == 0;
+              q = ((D & 2130706444) | 0) == 0;
+              t = 0;
+              while (1) {
+                if ((t | 0) >= (r | 0)) break;
+                n = O(t, K) | 0;
+                o = c[47286] | 0;
+                m = 0;
+                while (1) {
+                  if ((m | 0) >= (K | 0)) break;
+                  R = (m + n) | 0;
+                  k = +h[(F + (R << 4) + 8) >> 3];
+                  Q = c[I >> 2] | 0;
+                  h[(o + (m << 4)) >> 3] = +h[(Q + 16) >> 3] + +h[(F + (R << 4)) >> 3] * B;
+                  h[(o + (m << 4) + 8) >> 3] = +h[(Q + 24) >> 3] + k * C;
+                  m = (m + 1) | 0;
+                }
+                do
+                  if (v) {
+                    if (w & ((t | 0) == 0) ? (R2(j, 58) | 0) != 0 : 0)
+                      if ((fI(e, o, j) | 0) > 1) {
+                        c[z >> 2] = KB(f) | 0;
+                        gA(3, 106304, z) | 0;
+                        i = 0;
+                      } else i = 0;
+                    mS(e, c[47286] | 0, K, i & 255);
+                    if (!y) vN(e, f);
+                  } else {
+                    if (!x) {
+                      if ((t | 0) == 0 ? (jI(e, o, j, 1) | 0) > 1 : 0) {
+                        c[A >> 2] = KB(f) | 0;
+                        gA(3, 106304, A) | 0;
+                      }
+                      nS(e, c[47286] | 0, K, 0);
+                      break;
+                    }
+                    if (!p) {
+                      hS(e, 137379);
+                      nS(e, c[47286] | 0, K, i & 255);
+                      hS(e, s);
+                      qS(e, ((c[47286] | 0) + 32) | 0, 2);
+                      break;
+                    }
+                    i = i & 255;
+                    if (q) {
+                      nS(e, o, K, i);
+                      break;
+                    } else {
+                      TM(e, o, K, D, i);
+                      break;
+                    }
+                  }
+                while (0);
+                t = (t + 1) | 0;
+                i = 0;
+              }
+              m = c[((c[I >> 2] | 0) + 8) >> 2] | 0;
+              if (!(a[(m + 12) >> 0] | 0)) {
+                m = QA(f, 109025) | 0;
+                if (m | 0 ? a[m >> 0] | 0 : 0) {
+                  o = m;
+                  E = 65;
+                }
+              } else {
+                m = c[m >> 2] | 0;
+                if ((a[m >> 0] | 0) == 99 ? (s2(m, 105519) | 0) == 0 : 0) {
+                  m = QA(f, 105526) | 0;
+                  if (m | 0 ? a[m >> 0] | 0 : 0) {
+                    o = m;
+                    E = 65;
+                  }
+                } else {
+                  o = m;
+                  E = 65;
+                }
+              }
+              if ((E | 0) == 65) {
+                n = c[47286] | 0;
+                m = 0;
+                while (1) {
+                  if ((m | 0) >= (K | 0)) break;
+                  k = +h[(F + (m << 4) + 8) >> 3];
+                  R = c[I >> 2] | 0;
+                  h[(n + (m << 4)) >> 3] = +h[(R + 16) >> 3] + +h[(F + (m << 4)) >> 3] * B;
+                  h[(n + (m << 4) + 8) >> 3] = +h[(R + 24) >> 3] + k * C;
+                  m = (m + 1) | 0;
+                }
+                m = i & 255;
+                do
+                  if (!(u | ((i << 24) >> 24 == 0))) {
+                    if (v) {
+                      if (w & ((t | 0) == 0) ? (R2(j, 58) | 0) != 0 : 0)
+                        if ((fI(e, n, j) | 0) > 1) {
+                          c[G >> 2] = KB(f) | 0;
+                          gA(3, 106304, G) | 0;
+                          i = 0;
+                        } else i = 0;
+                      mS(e, c[47286] | 0, K, i & 255);
+                      if (y) break;
+                      vN(e, f);
+                      break;
+                    }
+                    if (x)
+                      if (!(D & 12)) {
+                        nS(e, n, K, m);
+                        break;
+                      } else {
+                        TM(e, n, K, D, m);
+                        break;
+                      }
+                    else {
+                      if ((jI(e, n, j, 1) | 0) > 1) {
+                        c[H >> 2] = KB(f) | 0;
+                        gA(3, 106304, H) | 0;
+                      }
+                      nS(e, c[47286] | 0, K, 0);
+                      break;
+                    }
+                  }
+                while (0);
+                R = c[47286] | 0;
+                sS(e, o, R, K, i, aP(f, c[47166] | 0, 137308) | 0);
+              }
+              U1(c[L >> 2] | 0);
+              DK(e, 10, c[((c[I >> 2] | 0) + 104) >> 2] | 0);
+              if (J) {
+                if ((c[(e + 152) >> 2] & 4) | 0)
+                  cS(e, c[N >> 2] | 0, c[(M + 228) >> 2] | 0, c[(M + 244) >> 2] | 0, c[(M + 212) >> 2] | 0);
+                dS(e);
+              }
+              l = P;
+              return;
+            }
+            function sN(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 16) | 0;
+              f = h;
+              e = yN(d, f) | 0;
+              if (e | 0) lS(b, e);
+              e = c[47172] | 0;
+              if ((e | 0 ? ((g = RA(d, e) | 0), g | 0) : 0) ? a[g >> 0] | 0 : 0) uS(b, +_O(d, c[47172] | 0, 1.0, 0.0));
+              l = h;
+              return c[f >> 2] | 0;
+            }
+            function tN(a) {
+              a = a | 0;
+              return xN(a, 134800) | 0;
+            }
+            function uN(b, d) {
+              b = b | 0;
+              d = d | 0;
+              d = bP(d, c[47148] | 0, 195059) | 0;
+              d = a[d >> 0] | 0 ? d : 137314;
+              hS(b, d);
+              return d | 0;
+            }
+            function vN(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0.0,
+                g = 0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0;
+              d = l;
+              l = (l + 96) | 0;
+              j = (d + 80) | 0;
+              k = (d + 64) | 0;
+              e = (d + 32) | 0;
+              m = (d + 16) | 0;
+              g = d;
+              b = c[(b + 16) >> 2] | 0;
+              f = +h[(b + 80) >> 3];
+              h[(m + 8) >> 3] = f * 0.375;
+              i = +h[(b + 96) >> 3];
+              h[m >> 3] = i * 0.6614;
+              b = (b + 16) | 0;
+              c[k >> 2] = c[m >> 2];
+              c[(k + 4) >> 2] = c[(m + 4) >> 2];
+              c[(k + 8) >> 2] = c[(m + 8) >> 2];
+              c[(k + 12) >> 2] = c[(m + 12) >> 2];
+              c[j >> 2] = c[b >> 2];
+              c[(j + 4) >> 2] = c[(b + 4) >> 2];
+              c[(j + 8) >> 2] = c[(b + 8) >> 2];
+              c[(j + 12) >> 2] = c[(b + 12) >> 2];
+              wN(g, k, j);
+              c[e >> 2] = c[g >> 2];
+              c[(e + 4) >> 2] = c[(g + 4) >> 2];
+              c[(e + 8) >> 2] = c[(g + 8) >> 2];
+              c[(e + 12) >> 2] = c[(g + 12) >> 2];
+              g = (e + 8) | 0;
+              b = (e + 24) | 0;
+              h[b >> 3] = +h[g >> 3];
+              h[(e + 16) >> 3] = +h[e >> 3] - i * 1.3228;
+              qS(a, e, 2);
+              f = +h[g >> 3] - f * 0.75;
+              h[g >> 3] = f;
+              h[b >> 3] = f;
+              qS(a, e, 2);
+              l = d;
+              return;
+            }
+            function wN(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0;
+              d = +h[(c + 8) >> 3] + +h[(b + 8) >> 3];
+              h[a >> 3] = +h[c >> 3] + +h[b >> 3];
+              h[(a + 8) >> 3] = d;
+              return;
+            }
+            function xN(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              e = bP(b, c[47149] | 0, 195059) | 0;
+              if (!(a[e >> 0] | 0)) {
+                e = bP(b, c[47148] | 0, 195059) | 0;
+                return ((a[e >> 0] | 0) == 0 ? d : e) | 0;
+              } else return e | 0;
+              return 0;
+            }
+            function yN(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              e = bP(b, c[47157] | 0, 195059) | 0;
+              a: do
+                if (!(a[e >> 0] | 0)) {
+                  g = 0;
+                  e = 0;
+                } else {
+                  g = PI(e) | 0;
+                  h = g;
+                  e = 0;
+                  b: while (1) {
+                    f = c[h >> 2] | 0;
+                    if (!f) break a;
+                    switch (a[f >> 0] | 0) {
+                      case 102: {
+                        if (!(s2(f, 111101) | 0)) {
+                          h = (h + 4) | 0;
+                          e = e | 1;
+                          continue b;
+                        }
+                        break;
+                      }
+                      case 114: {
+                        if (!(s2(f, 106316) | 0)) {
+                          f = h;
+                          do {
+                            j = f;
+                            f = (f + 4) | 0;
+                            i = c[f >> 2] | 0;
+                            c[j >> 2] = i;
+                          } while ((i | 0) != 0);
+                          j = h;
+                          e = e | 4;
+                          h = j;
+                          continue b;
+                        }
+                        if (!(s2(f, 106334) | 0)) {
+                          f = h;
+                          do {
+                            i = f;
+                            f = (f + 4) | 0;
+                            j = c[f >> 2] | 0;
+                            c[i >> 2] = j;
+                          } while ((j | 0) != 0);
+                          j = h;
+                          e = e | 3;
+                          h = j;
+                          continue b;
+                        }
+                        break;
+                      }
+                      case 100: {
+                        if (!(s2(f, 106324) | 0)) {
+                          f = h;
+                          do {
+                            i = f;
+                            f = (f + 4) | 0;
+                            j = c[f >> 2] | 0;
+                            c[i >> 2] = j;
+                          } while ((j | 0) != 0);
+                          j = h;
+                          e = e | 8;
+                          h = j;
+                          continue b;
+                        }
+                        break;
+                      }
+                      case 105: {
+                        if (!(s2(f, 134335) | 0)) {
+                          h = (h + 4) | 0;
+                          e = e | 32;
+                          continue b;
+                        }
+                        break;
+                      }
+                      case 115: {
+                        if ((s2(f, 106341) | 0) == 0 ? zN(b) | 0 : 0) {
+                          f = h;
+                          do {
+                            i = f;
+                            f = (f + 4) | 0;
+                            j = c[f >> 2] | 0;
+                            c[i >> 2] = j;
+                          } while ((j | 0) != 0);
+                          j = h;
+                          e = e | 64;
+                          h = j;
+                          continue b;
+                        }
+                        break;
+                      }
+                      case 119: {
+                        if ((s2(f, 106349) | 0) == 0 ? AN(b) | 0 : 0) {
+                          f = h;
+                          do {
+                            i = f;
+                            f = (f + 4) | 0;
+                            j = c[f >> 2] | 0;
+                            c[i >> 2] = j;
+                          } while ((j | 0) != 0);
+                          j = h;
+                          e = e | 512;
+                          h = j;
+                          continue b;
+                        }
+                        break;
+                      }
+                      default: {
+                      }
+                    }
+                    h = (h + 4) | 0;
+                  }
+                }
+              while (0);
+              f = c[((c[((c[(b + 16) >> 2] | 0) + 8) >> 2] | 0) + 8) >> 2] | 0;
+              if (f) e = c[(f + 40) >> 2] | e;
+              c[d >> 2] = e;
+              return g | 0;
+            }
+            function zN(a) {
+              a = a | 0;
+              var b = 0.0;
+              a = c[((c[((c[(a + 16) >> 2] | 0) + 8) >> 2] | 0) + 8) >> 2] | 0;
+              if (
+                (
+                  ((a | 0) != 0 ? (c[(a + 8) >> 2] | 0) == 4 : 0)
+                    ? ((b = +h[(a + 16) >> 3]), ((~~(b + (b >= 0.0 ? 0.5 : -0.5)) | 0) % 90 | 0 | 0) == 0)
+                    : 0
+                )
+                  ? +h[(a + 24) >> 3] == 0.0
+                  : 0
+              )
+                a = (+h[(a + 32) >> 3] == 0.0) & 1;
+              else a = 0;
+              return a | 0;
+            }
+            function AN(a) {
+              a = a | 0;
+              a = c[((c[((c[(a + 16) >> 2] | 0) + 8) >> 2] | 0) + 8) >> 2] | 0;
+              if (!a) a = 0;
+              else a = ((c[(a + 8) >> 2] | 0) < 3) & 1;
+              return a | 0;
+            }
+            function BN(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0;
+              i = +h[(c + 8) >> 3];
+              g = -(+h[(d + 8) >> 3] - i);
+              f = +h[c >> 3];
+              e = +h[d >> 3] - f;
+              f = e * i + f * g;
+              return (
+                (((+h[(a + 8) >> 3] * e + +h[a >> 3] * g - f >= 0.0) ^
+                  (+h[b >> 3] * g - f + +h[(b + 8) >> 3] * e >= 0.0) ^
+                  1) &
+                  1) |
+                0
+              );
+            }
+            function CN(b, d, e, f, g, i) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              var j = 0.0,
+                k = 0.0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0.0,
+                r = 0.0,
+                s = 0.0,
+                t = 0.0,
+                u = 0.0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0;
+              G = l;
+              l = (l + 192) | 0;
+              B = (G + 176) | 0;
+              E = (G + 160) | 0;
+              m = (G + 144) | 0;
+              z = (G + 128) | 0;
+              A = (G + 112) | 0;
+              n = (G + 96) | 0;
+              o = (G + 80) | 0;
+              p = (G + 64) | 0;
+              v = (G + 48) | 0;
+              w = (G + 32) | 0;
+              x = (G + 16) | 0;
+              D = G;
+              if (!d) {
+                c[E >> 2] = 0;
+                c[(E + 4) >> 2] = 0;
+                c[(E + 8) >> 2] = 0;
+                c[(E + 12) >> 2] = 0;
+                m = ((c[((c[((xC(b) | 0) + 16) >> 2] | 0) + 116) >> 2] & 1) | 0) == 0;
+                C = c[(b + 16) >> 2] | 0;
+                q = +h[(C + 80) >> 3] * 0.5;
+                j = +h[(C + 88) >> 3];
+                t = m ? q : j;
+                q = m ? j : q;
+                m = 0;
+                C = E;
+                j = 0.0;
+                k = -q;
+                r = t;
+                F = (E + 8) | 0;
+                s = 0.0;
+                t = -t;
+              } else {
+                k = +h[d >> 3];
+                t = +h[(d + 8) >> 3];
+                q = +h[(d + 16) >> 3];
+                r = +h[(d + 24) >> 3];
+                bN(m, (q + k) * 0.5, (r + t) * 0.5);
+                c[E >> 2] = c[m >> 2];
+                c[(E + 4) >> 2] = c[(m + 4) >> 2];
+                c[(E + 8) >> 2] = c[(m + 8) >> 2];
+                c[(E + 12) >> 2] = c[(m + 12) >> 2];
+                H = (E + 8) | 0;
+                m = 1;
+                C = E;
+                j = +h[E >> 3];
+                F = H;
+                s = +h[H >> 3];
+              }
+              u = (q > r ? q : r) * 4.0;
+              a: do
+                if ((f | 0) != 0 ? ((y = a[f >> 0] | 0), (y << 24) >> 24 != 0) : 0) {
+                  f = (f + 1) | 0;
+                  switch (((y << 24) >> 24) | 0) {
+                    case 99: {
+                      p = 1;
+                      g = 0;
+                      f = 0;
+                      n = 0;
+                      j = 0.0;
+                      o = 0;
+                      break a;
+                    }
+                    case 101: {
+                      if (a[f >> 0] | 0) {
+                        p = 1;
+                        g = 0;
+                        f = 0;
+                        n = 0;
+                        j = 0.0;
+                        o = 1;
+                        break a;
+                      }
+                      if (!i) h[C >> 3] = q;
+                      else {
+                        EN(z, i, s, u);
+                        c[E >> 2] = c[z >> 2];
+                        c[(E + 4) >> 2] = c[(z + 4) >> 2];
+                        c[(E + 8) >> 2] = c[(z + 8) >> 2];
+                        c[(E + 12) >> 2] = c[(z + 12) >> 2];
+                      }
+                      p = 0;
+                      g = g & 2;
+                      f = 0;
+                      n = 1;
+                      j = 0.0;
+                      o = 0;
+                      m = 1;
+                      break a;
+                    }
+                    case 115: {
+                      h[F >> 3] = t;
+                      switch (a[f >> 0] | 0) {
+                        case 0: {
+                          if (!i) h[C >> 3] = j;
+                          else {
+                            EN(A, i, -u, j);
+                            c[E >> 2] = c[A >> 2];
+                            c[(E + 4) >> 2] = c[(A + 4) >> 2];
+                            c[(E + 8) >> 2] = c[(A + 8) >> 2];
+                            c[(E + 12) >> 2] = c[(A + 12) >> 2];
+                          }
+                          p = 0;
+                          g = g & 1;
+                          f = 0;
+                          n = 1;
+                          j = -1.5707963267948966;
+                          o = 0;
+                          m = 1;
+                          break a;
+                        }
+                        case 101: {
+                          if (!i) h[C >> 3] = q;
+                          else {
+                            EN(n, i, -u, u);
+                            c[E >> 2] = c[n >> 2];
+                            c[(E + 4) >> 2] = c[(n + 4) >> 2];
+                            c[(E + 8) >> 2] = c[(n + 8) >> 2];
+                            c[(E + 12) >> 2] = c[(n + 12) >> 2];
+                          }
+                          p = 0;
+                          g = g & 3;
+                          f = 0;
+                          n = 1;
+                          j = -0.7853981633974483;
+                          o = 0;
+                          m = 1;
+                          break a;
+                        }
+                        case 119: {
+                          if (!i) h[C >> 3] = k;
+                          else {
+                            u = -u;
+                            EN(o, i, u, u);
+                            c[E >> 2] = c[o >> 2];
+                            c[(E + 4) >> 2] = c[(o + 4) >> 2];
+                            c[(E + 8) >> 2] = c[(o + 8) >> 2];
+                            c[(E + 12) >> 2] = c[(o + 12) >> 2];
+                          }
+                          p = 0;
+                          g = g & 9;
+                          f = 0;
+                          n = 1;
+                          j = -2.356194490192345;
+                          o = 0;
+                          m = 1;
+                          break a;
+                        }
+                        default: {
+                          h[F >> 3] = s;
+                          p = 1;
+                          g = 0;
+                          f = 0;
+                          n = 0;
+                          j = 0.0;
+                          o = 1;
+                          break a;
+                        }
+                      }
+                    }
+                    case 119: {
+                      if (a[f >> 0] | 0) {
+                        p = 1;
+                        g = 0;
+                        f = 0;
+                        n = 0;
+                        j = 0.0;
+                        o = 1;
+                        break a;
+                      }
+                      if (!i) h[C >> 3] = k;
+                      else {
+                        EN(p, i, s, -u);
+                        c[E >> 2] = c[p >> 2];
+                        c[(E + 4) >> 2] = c[(p + 4) >> 2];
+                        c[(E + 8) >> 2] = c[(p + 8) >> 2];
+                        c[(E + 12) >> 2] = c[(p + 12) >> 2];
+                      }
+                      p = 0;
+                      g = g & 8;
+                      f = 0;
+                      n = 1;
+                      j = 3.141592653589793;
+                      o = 0;
+                      m = 1;
+                      break a;
+                    }
+                    case 110: {
+                      h[F >> 3] = r;
+                      switch (a[f >> 0] | 0) {
+                        case 0: {
+                          if (!i) h[C >> 3] = j;
+                          else {
+                            EN(v, i, u, j);
+                            c[E >> 2] = c[v >> 2];
+                            c[(E + 4) >> 2] = c[(v + 4) >> 2];
+                            c[(E + 8) >> 2] = c[(v + 8) >> 2];
+                            c[(E + 12) >> 2] = c[(v + 12) >> 2];
+                          }
+                          p = 0;
+                          g = g & 4;
+                          f = 0;
+                          n = 1;
+                          j = 1.5707963267948966;
+                          o = 0;
+                          m = 1;
+                          break a;
+                        }
+                        case 101: {
+                          if (!i) h[C >> 3] = q;
+                          else {
+                            EN(w, i, u, u);
+                            c[E >> 2] = c[w >> 2];
+                            c[(E + 4) >> 2] = c[(w + 4) >> 2];
+                            c[(E + 8) >> 2] = c[(w + 8) >> 2];
+                            c[(E + 12) >> 2] = c[(w + 12) >> 2];
+                          }
+                          p = 0;
+                          g = g & 6;
+                          f = 0;
+                          n = 1;
+                          j = 0.7853981633974483;
+                          o = 0;
+                          m = 1;
+                          break a;
+                        }
+                        case 119: {
+                          if (!i) h[C >> 3] = k;
+                          else {
+                            EN(x, i, u, -u);
+                            c[E >> 2] = c[x >> 2];
+                            c[(E + 4) >> 2] = c[(x + 4) >> 2];
+                            c[(E + 8) >> 2] = c[(x + 8) >> 2];
+                            c[(E + 12) >> 2] = c[(x + 12) >> 2];
+                          }
+                          p = 0;
+                          g = g & 12;
+                          f = 0;
+                          n = 1;
+                          j = 2.356194490192345;
+                          o = 0;
+                          m = 1;
+                          break a;
+                        }
+                        default: {
+                          h[F >> 3] = s;
+                          p = 1;
+                          g = 0;
+                          f = 0;
+                          n = 0;
+                          j = 0.0;
+                          o = 1;
+                          break a;
+                        }
+                      }
+                    }
+                    case 95: {
+                      p = 1;
+                      f = 1;
+                      n = 0;
+                      j = 0.0;
+                      o = 0;
+                      break a;
+                    }
+                    default: {
+                      p = 1;
+                      g = 0;
+                      f = 0;
+                      n = 0;
+                      j = 0.0;
+                      o = 1;
+                      break a;
+                    }
+                  }
+                } else {
+                  p = 1;
+                  g = 0;
+                  f = 0;
+                  n = 0;
+                  j = 0.0;
+                  o = 0;
+                }
+              while (0);
+              H = ((c[((c[((xC(b) | 0) + 16) >> 2] | 0) + 116) >> 2] & 3) * 90) | 0;
+              c[B >> 2] = c[E >> 2];
+              c[(B + 4) >> 2] = c[(E + 4) >> 2];
+              c[(B + 8) >> 2] = c[(E + 8) >> 2];
+              c[(B + 12) >> 2] = c[(E + 12) >> 2];
+              lK(D, B, H);
+              c[E >> 2] = c[D >> 2];
+              c[(E + 4) >> 2] = c[(D + 4) >> 2];
+              c[(E + 8) >> 2] = c[(D + 8) >> 2];
+              c[(E + 12) >> 2] = c[(D + 12) >> 2];
+              if (!((f << 24) >> 24)) g = FN(g, c[((c[((xC(b) | 0) + 16) >> 2] | 0) + 116) >> 2] & 3) | 0;
+              a[(e + 33) >> 0] = g;
+              c[(e + 24) >> 2] = d;
+              k = +h[C >> 3];
+              h[e >> 3] = +(~~(k + (k >= 0.0 ? 0.5 : -0.5)) | 0);
+              k = +h[F >> 3];
+              h[(e + 8) >> 3] = +(~~(k + (k >= 0.0 ? 0.5 : -0.5)) | 0);
+              h[(e + 16) >> 3] = +GN(j, c[((c[((xC(b) | 0) + 16) >> 2] | 0) + 116) >> 2] & 3);
+              k = +h[C >> 3];
+              j = +h[F >> 3];
+              if ((k == 0.0) & (j == 0.0)) g = -128;
+              else {
+                u = +K(+j, +k);
+                t = u + 4.71238898038469;
+                g = ~~((!(t >= 6.283185307179586) ? t : u + -1.5707963267948966) * 40.74366543152521) & 255;
+              }
+              a[(e + 32) >> 0] = g;
+              a[(e + 29) >> 0] = n;
+              a[(e + 28) >> 0] = m;
+              a[(e + 30) >> 0] = p;
+              a[(e + 31) >> 0] = f;
+              l = G;
+              return o | 0;
+            }
+            function DN(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = l;
+              l = (l + 16) | 0;
+              e = d;
+              c[e >> 2] = KB(a) | 0;
+              c[(e + 4) >> 2] = b;
+              gA(0, 106419, e) | 0;
+              l = d;
+              return;
+            }
+            function EN(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = +d;
+              e = +e;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              p = l;
+              l = (l + 128) | 0;
+              g = (p + 112) | 0;
+              j = (p + 48) | 0;
+              k = (p + 16) | 0;
+              m = (p + 32) | 0;
+              n = p;
+              o = c[b >> 2] | 0;
+              i = c[((c[((xC(o) | 0) + 16) >> 2] | 0) + 116) >> 2] & 3;
+              h[k >> 3] = e;
+              h[(k + 8) >> 3] = d;
+              f = (i | 0) != 0;
+              if (f) {
+                c[g >> 2] = c[k >> 2];
+                c[(g + 4) >> 2] = c[(k + 4) >> 2];
+                c[(g + 8) >> 2] = c[(k + 8) >> 2];
+                c[(g + 12) >> 2] = c[(k + 12) >> 2];
+                lK(m, g, (i * 90) | 0);
+                c[k >> 2] = c[m >> 2];
+                c[(k + 4) >> 2] = c[(m + 4) >> 2];
+                c[(k + 8) >> 2] = c[(m + 8) >> 2];
+                c[(k + 12) >> 2] = c[(m + 12) >> 2];
+              }
+              m = (j + 48) | 0;
+              q = (j + 32) | 0;
+              c[j >> 2] = 0;
+              c[(j + 4) >> 2] = 0;
+              c[(j + 8) >> 2] = 0;
+              c[(j + 12) >> 2] = 0;
+              c[(j + 16) >> 2] = 0;
+              c[(j + 20) >> 2] = 0;
+              c[(j + 24) >> 2] = 0;
+              c[(j + 28) >> 2] = 0;
+              c[q >> 2] = c[k >> 2];
+              c[(q + 4) >> 2] = c[(k + 4) >> 2];
+              c[(q + 8) >> 2] = c[(k + 8) >> 2];
+              c[(q + 12) >> 2] = c[(k + 12) >> 2];
+              c[m >> 2] = c[k >> 2];
+              c[(m + 4) >> 2] = c[(k + 4) >> 2];
+              c[(m + 8) >> 2] = c[(k + 8) >> 2];
+              c[(m + 12) >> 2] = c[(k + 12) >> 2];
+              $N(b, c[((c[((c[((c[(o + 16) >> 2] | 0) + 8) >> 2] | 0) + 4) >> 2] | 0) + 12) >> 2] | 0, j, 1);
+              if (f) {
+                c[g >> 2] = c[j >> 2];
+                c[(g + 4) >> 2] = c[(j + 4) >> 2];
+                c[(g + 8) >> 2] = c[(j + 8) >> 2];
+                c[(g + 12) >> 2] = c[(j + 12) >> 2];
+                mK(n, g, (i * 90) | 0);
+                c[j >> 2] = c[n >> 2];
+                c[(j + 4) >> 2] = c[(n + 4) >> 2];
+                c[(j + 8) >> 2] = c[(n + 8) >> 2];
+                c[(j + 12) >> 2] = c[(n + 12) >> 2];
+              }
+              c[a >> 2] = c[j >> 2];
+              c[(a + 4) >> 2] = c[(j + 4) >> 2];
+              c[(a + 8) >> 2] = c[(j + 8) >> 2];
+              c[(a + 12) >> 2] = c[(j + 12) >> 2];
+              l = p;
+              return;
+            }
+            function FN(a, b) {
+              a = a | 0;
+              b = b | 0;
+              a: do
+                switch (b | 0) {
+                  case 3:
+                    switch (a | 0) {
+                      case 4: {
+                        a = 2;
+                        break a;
+                      }
+                      case 1: {
+                        a = 8;
+                        break a;
+                      }
+                      case 8: {
+                        a = 1;
+                        break a;
+                      }
+                      case 2: {
+                        a = 4;
+                        break a;
+                      }
+                      default:
+                        break a;
+                    }
+                  case 2:
+                    switch (a | 0) {
+                      case 4: {
+                        a = 1;
+                        break a;
+                      }
+                      case 1: {
+                        a = 4;
+                        break a;
+                      }
+                      default:
+                        break a;
+                    }
+                  case 1:
+                    switch (a | 0) {
+                      case 4: {
+                        a = 2;
+                        break a;
+                      }
+                      case 1: {
+                        a = 8;
+                        break a;
+                      }
+                      case 8: {
+                        a = 4;
+                        break a;
+                      }
+                      case 2: {
+                        a = 1;
+                        break a;
+                      }
+                      default:
+                        break a;
+                    }
+                  default: {
+                  }
+                }
+              while (0);
+              return a | 0;
+            }
+            function GN(a, b) {
+              a = +a;
+              b = b | 0;
+              switch (b | 0) {
+                case 3: {
+                  if (!(a == 3.141592653589793))
+                    if (!(a == 2.356194490192345))
+                      if (!(a == 1.5707963267948966))
+                        if (!(a == 0.0))
+                          if (!(a == -0.7853981633974483)) {
+                            if (a == -1.5707963267948966) a = 3.141592653589793;
+                          } else a = 2.356194490192345;
+                        else a = 1.5707963267948966;
+                      else a = 0.0;
+                    else a = -0.7853981633974483;
+                  else a = -1.5707963267948966;
+                  break;
+                }
+                case 2: {
+                  a = -a;
+                  break;
+                }
+                case 1: {
+                  a = a + -1.5707963267948966;
+                  break;
+                }
+                default: {
+                }
+              }
+              return +a;
+            }
+            function HN(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0,
+                f = 0.0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0;
+              e = l;
+              l = (l + 32) | 0;
+              k = (e + 16) | 0;
+              i = e;
+              a = c[a >> 2] | 0;
+              j = ((c[((c[((xC(a) | 0) + 16) >> 2] | 0) + 116) >> 2] & 3) * 90) | 0;
+              c[k >> 2] = c[b >> 2];
+              c[(k + 4) >> 2] = c[(b + 4) >> 2];
+              c[(k + 8) >> 2] = c[(b + 8) >> 2];
+              c[(k + 12) >> 2] = c[(b + 12) >> 2];
+              mK(i, k, j);
+              d = +h[i >> 3];
+              g = +h[(i + 8) >> 3];
+              a = c[(a + 16) >> 2] | 0;
+              f = +h[(a + 80) >> 3] * 0.5;
+              if (!(!(g >= -f) | !(g <= f)) ? d >= -+h[(a + 88) >> 3] : 0) a = (d <= +h[(a + 96) >> 3]) & 1;
+              else a = 0;
+              l = e;
+              return a | 0;
+            }
+            function IN(a, d) {
+              a = a | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0.0;
+              n = l;
+              l = (l + 32) | 0;
+              m = n;
+              i = c[(a + 16) >> 2] | 0;
+              j = (i + 208) | 0;
+              g = c[j >> 2] | 0;
+              if (!g) k = (b[(i + 260) >> 1] & 1) != 0;
+              else k = 1;
+              e = (d + 16) | 0;
+              d = c[e >> 2] | 0;
+              f = c[(d + 12) >> 2] | 0;
+              if (f | 0) {
+                if (k ? ((c[(a + 152) >> 2] & 4) | 0) == 0 : 0) {
+                  cS(a, g, c[(i + 228) >> 2] | 0, c[(i + 244) >> 2] | 0, c[(i + 212) >> 2] | 0);
+                  d = c[e >> 2] | 0;
+                }
+                g = c[(a + 36) >> 2] | 0;
+                p = +h[(d + 24) >> 3] + +(c[(f + 8) >> 2] | 0);
+                o = c[f >> 2] | 0;
+                h[m >> 3] = +h[(d + 16) >> 3] + +(c[(f + 4) >> 2] | 0);
+                h[(m + 8) >> 3] = p;
+                c[(m + 16) >> 2] = o;
+                w4(g, 106450, m) | 0;
+                g = c[e >> 2] | 0;
+                m = ((c[(g + 104) >> 2] | 0) + 56) | 0;
+                g = (g + 16) | 0;
+                c[m >> 2] = c[g >> 2];
+                c[(m + 4) >> 2] = c[(g + 4) >> 2];
+                c[(m + 8) >> 2] = c[(g + 8) >> 2];
+                c[(m + 12) >> 2] = c[(g + 12) >> 2];
+                DK(a, 10, c[((c[e >> 2] | 0) + 104) >> 2] | 0);
+                if (k) {
+                  if ((c[(a + 152) >> 2] & 4) | 0)
+                    cS(a, c[j >> 2] | 0, c[(i + 228) >> 2] | 0, c[(i + 244) >> 2] | 0, c[(i + 212) >> 2] | 0);
+                  dS(a);
+                }
+              }
+              l = n;
+              return;
+            }
+            function JN(a) {
+              a = a | 0;
+              eN(c[((c[(a + 16) >> 2] | 0) + 12) >> 2] | 0);
+              return;
+            }
+            function KN(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              m = l;
+              l = (l + 64) | 0;
+              k = (m + 40) | 0;
+              h = m;
+              if (!(a[f >> 0] | 0)) {
+                h = 4208;
+                g = (b + 40) | 0;
+                do {
+                  c[b >> 2] = c[h >> 2];
+                  b = (b + 4) | 0;
+                  h = (h + 4) | 0;
+                } while ((b | 0) < (g | 0));
+              } else {
+                g = (g | 0) == 0 ? 106356 : g;
+                i = c[((c[(e + 16) >> 2] | 0) + 12) >> 2] | 0;
+                j = QN(i, f) | 0;
+                if (!j) {
+                  if (CN(e, (i + 16) | 0, h, f, 15, 0) | 0) DN(e, f);
+                } else if (CN(e, (j + 16) | 0, h, g, d[(j + 65) >> 0] | 0, 0) | 0) {
+                  c[k >> 2] = KB(e) | 0;
+                  c[(k + 4) >> 2] = f;
+                  c[(k + 8) >> 2] = g;
+                  gA(0, 106358, k) | 0;
+                }
+                g = (b + 40) | 0;
+                do {
+                  c[b >> 2] = c[h >> 2];
+                  b = (b + 4) | 0;
+                  h = (h + 4) | 0;
+                } while ((b | 0) < (g | 0));
+              }
+              l = m;
+              return;
+            }
+            function LN(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0,
+                m = 0,
+                n = 0.0;
+              k = l;
+              l = (l + 32) | 0;
+              m = (k + 16) | 0;
+              i = k;
+              f = c[(a + 4) >> 2] | 0;
+              a = c[a >> 2] | 0;
+              g = ((c[((c[((xC(a) | 0) + 16) >> 2] | 0) + 116) >> 2] & 3) * 90) | 0;
+              c[m >> 2] = c[b >> 2];
+              c[(m + 4) >> 2] = c[(b + 4) >> 2];
+              c[(m + 8) >> 2] = c[(b + 8) >> 2];
+              c[(m + 12) >> 2] = c[(b + 12) >> 2];
+              mK(i, m, g);
+              c[b >> 2] = c[i >> 2];
+              c[(b + 4) >> 2] = c[(i + 4) >> 2];
+              c[(b + 8) >> 2] = c[(i + 8) >> 2];
+              c[(b + 12) >> 2] = c[(i + 12) >> 2];
+              if (!f) {
+                f = c[((c[(a + 16) >> 2] | 0) + 12) >> 2] | 0;
+                g = (f + 16) | 0;
+                a = (f + 24) | 0;
+                i = (f + 32) | 0;
+                f = (f + 40) | 0;
+              } else {
+                g = f;
+                a = (f + 8) | 0;
+                i = (f + 16) | 0;
+                f = (f + 24) | 0;
+              }
+              e = +h[a >> 3];
+              d = +h[f >> 3];
+              n = +h[b >> 3];
+              if ((+h[g >> 3] <= n ? n <= +h[i >> 3] : 0) ? ((j = +h[(b + 8) >> 3]), e <= j) : 0) a = (j <= d) & 1;
+              else a = 0;
+              l = k;
+              return a | 0;
+            }
+            function MN(b, d, e, f, g) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0.0,
+                j = 0.0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0.0,
+                t = 0,
+                u = 0,
+                v = 0.0;
+              u = l;
+              l = (l + 80) | 0;
+              r = (u + 64) | 0;
+              q = (u + 32) | 0;
+              t = u;
+              a: do
+                if (!(a[(d + 28) >> 0] | 0)) e = 0;
+                else {
+                  i = +h[d >> 3];
+                  p = (b + 16) | 0;
+                  m = c[((c[p >> 2] | 0) + 12) >> 2] | 0;
+                  k = (m + 48) | 0;
+                  m = (m + 56) | 0;
+                  d = 0;
+                  while (1) {
+                    if ((d | 0) >= (c[k >> 2] | 0)) break a;
+                    n = ((c[((c[((xC(b) | 0) + 16) >> 2] | 0) + 116) >> 2] & 1) | 0) == 0;
+                    o = c[((c[m >> 2] | 0) + (d << 2)) >> 2] | 0;
+                    j = +(~~+h[(n ? (o + 16) | 0 : (o + 24) | 0) >> 3] | 0);
+                    if (i >= j ? ((s = +(~~+h[(n ? (o + 32) | 0 : (o + 40) | 0) >> 3] | 0)), i <= s) : 0) break;
+                    d = (d + 1) | 0;
+                  }
+                  if (!(c[((c[((xC(b) | 0) + 16) >> 2] | 0) + 116) >> 2] & 1)) {
+                    t = c[p >> 2] | 0;
+                    v = +h[(t + 16) >> 3];
+                    h[f >> 3] = v + j;
+                    j = +h[(t + 24) >> 3];
+                    i = +h[(t + 80) >> 3];
+                    h[(f + 8) >> 3] = j - i * 0.5;
+                    h[(f + 16) >> 3] = v + s;
+                  } else {
+                    o = ((c[((c[m >> 2] | 0) + (d << 2)) >> 2] | 0) + 16) | 0;
+                    b = ((c[p >> 2] | 0) + 16) | 0;
+                    c[q >> 2] = c[o >> 2];
+                    c[(q + 4) >> 2] = c[(o + 4) >> 2];
+                    c[(q + 8) >> 2] = c[(o + 8) >> 2];
+                    c[(q + 12) >> 2] = c[(o + 12) >> 2];
+                    c[(q + 16) >> 2] = c[(o + 16) >> 2];
+                    c[(q + 20) >> 2] = c[(o + 20) >> 2];
+                    c[(q + 24) >> 2] = c[(o + 24) >> 2];
+                    c[(q + 28) >> 2] = c[(o + 28) >> 2];
+                    c[r >> 2] = c[b >> 2];
+                    c[(r + 4) >> 2] = c[(b + 4) >> 2];
+                    c[(r + 8) >> 2] = c[(b + 8) >> 2];
+                    c[(r + 12) >> 2] = c[(b + 12) >> 2];
+                    nK(t, q, r);
+                    c[f >> 2] = c[t >> 2];
+                    c[(f + 4) >> 2] = c[(t + 4) >> 2];
+                    c[(f + 8) >> 2] = c[(t + 8) >> 2];
+                    c[(f + 12) >> 2] = c[(t + 12) >> 2];
+                    c[(f + 16) >> 2] = c[(t + 16) >> 2];
+                    c[(f + 20) >> 2] = c[(t + 20) >> 2];
+                    c[(f + 24) >> 2] = c[(t + 24) >> 2];
+                    c[(f + 28) >> 2] = c[(t + 28) >> 2];
+                    t = c[p >> 2] | 0;
+                    i = +h[(t + 80) >> 3];
+                    j = +h[(t + 24) >> 3];
+                  }
+                  h[(f + 24) >> 3] = i * 0.5 + j;
+                  c[g >> 2] = 1;
+                }
+              while (0);
+              l = u;
+              return e | 0;
+            }
+            function NN(d, e) {
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                i = 0,
+                j = 0,
+                k = 0.0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0.0;
+              w = l;
+              l = (l + 144) | 0;
+              n = (w + 96) | 0;
+              p = (w + 64) | 0;
+              r = w;
+              s = (w + 128) | 0;
+              t = c[(d + 16) >> 2] | 0;
+              u = (t + 208) | 0;
+              f = c[u >> 2] | 0;
+              if (!f) v = (b[(t + 260) >> 1] & 1) != 0;
+              else v = 1;
+              m = (e + 16) | 0;
+              q = c[m >> 2] | 0;
+              o = c[(q + 12) >> 2] | 0;
+              j = (o + 16) | 0;
+              c[p >> 2] = c[j >> 2];
+              c[(p + 4) >> 2] = c[(j + 4) >> 2];
+              c[(p + 8) >> 2] = c[(j + 8) >> 2];
+              c[(p + 12) >> 2] = c[(j + 12) >> 2];
+              c[(p + 16) >> 2] = c[(j + 16) >> 2];
+              c[(p + 20) >> 2] = c[(j + 20) >> 2];
+              c[(p + 24) >> 2] = c[(j + 24) >> 2];
+              c[(p + 28) >> 2] = c[(j + 28) >> 2];
+              x = +h[(q + 16) >> 3];
+              h[p >> 3] = +h[p >> 3] + x;
+              k = +h[(q + 24) >> 3];
+              q = (p + 8) | 0;
+              h[q >> 3] = +h[q >> 3] + k;
+              q = (p + 16) | 0;
+              h[q >> 3] = +h[q >> 3] + x;
+              j = (p + 24) | 0;
+              h[j >> 3] = +h[j >> 3] + k;
+              if (v ? ((c[(d + 152) >> 2] & 4) | 0) == 0 : 0)
+                cS(d, f, c[(t + 228) >> 2] | 0, c[(t + 244) >> 2] | 0, c[(t + 212) >> 2] | 0);
+              f = sN(d, e) | 0;
+              uN(d, e) | 0;
+              c[s >> 2] = 0;
+              if (!(f & 1)) i = 0;
+              else {
+                i = tN(e) | 0;
+                if (!(((JJ(i, s, n) | 0) << 24) >> 24)) {
+                  jS(d, i);
+                  i = 1;
+                } else {
+                  jS(d, c[s >> 2] | 0);
+                  i = c[(s + 4) >> 2] | 0;
+                  j = ZO(e, c[47173] | 0, 0, 0) | 0;
+                  k = +g[n >> 2];
+                  if (!i) kS(d, 137314, j, k);
+                  else kS(d, i, j, k);
+                  i = ((f >>> 1) & 1) | 2;
+                }
+              }
+              j = c[c[((c[m >> 2] | 0) + 8) >> 2] >> 2] | 0;
+              if ((a[j >> 0] | 0) == 77) {
+                m = (s2(j, 106227) | 0) == 0;
+                f = m ? f | 4 : f;
+              }
+              if (!(f & 2130706444)) {
+                c[n >> 2] = c[p >> 2];
+                c[(n + 4) >> 2] = c[(p + 4) >> 2];
+                c[(n + 8) >> 2] = c[(p + 8) >> 2];
+                c[(n + 12) >> 2] = c[(p + 12) >> 2];
+                c[(n + 16) >> 2] = c[(p + 16) >> 2];
+                c[(n + 20) >> 2] = c[(p + 20) >> 2];
+                c[(n + 24) >> 2] = c[(p + 24) >> 2];
+                c[(n + 28) >> 2] = c[(p + 28) >> 2];
+                oS(d, n, i);
+              } else {
+                c[r >> 2] = c[p >> 2];
+                c[(r + 4) >> 2] = c[(p + 4) >> 2];
+                c[(r + 8) >> 2] = c[(p + 8) >> 2];
+                c[(r + 12) >> 2] = c[(p + 12) >> 2];
+                p = (r + 32) | 0;
+                c[p >> 2] = c[q >> 2];
+                c[(p + 4) >> 2] = c[(q + 4) >> 2];
+                c[(p + 8) >> 2] = c[(q + 8) >> 2];
+                c[(p + 12) >> 2] = c[(q + 12) >> 2];
+                h[(r + 16) >> 3] = +h[p >> 3];
+                h[(r + 24) >> 3] = +h[(r + 8) >> 3];
+                h[(r + 48) >> 3] = +h[r >> 3];
+                h[(r + 56) >> 3] = +h[(r + 40) >> 3];
+                TM(d, r, 4, f, i);
+              }
+              ON(d, e, o);
+              U1(c[s >> 2] | 0);
+              if (v) {
+                if ((c[(d + 152) >> 2] & 4) | 0)
+                  cS(d, c[u >> 2] | 0, c[(t + 228) >> 2] | 0, c[(t + 244) >> 2] | 0, c[(t + 212) >> 2] | 0);
+                dS(d);
+              }
+              l = w;
+              return;
+            }
+            function ON(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0;
+              u = l;
+              l = (l + 144) | 0;
+              p = (u + 128) | 0;
+              o = (u + 112) | 0;
+              q = (u + 16) | 0;
+              r = u;
+              g = (u + 96) | 0;
+              i = (u + 80) | 0;
+              s = (u + 64) | 0;
+              t = (u + 48) | 0;
+              j = (e + 52) | 0;
+              f = c[j >> 2] | 0;
+              if (!f) f = (d + 16) | 0;
+              else {
+                n = (f + 56) | 0;
+                m = (e + 16) | 0;
+                f = (e + 32) | 0;
+                c[o >> 2] = c[m >> 2];
+                c[(o + 4) >> 2] = c[(m + 4) >> 2];
+                c[(o + 8) >> 2] = c[(m + 8) >> 2];
+                c[(o + 12) >> 2] = c[(m + 12) >> 2];
+                c[p >> 2] = c[f >> 2];
+                c[(p + 4) >> 2] = c[(f + 4) >> 2];
+                c[(p + 8) >> 2] = c[(f + 8) >> 2];
+                c[(p + 12) >> 2] = c[(f + 12) >> 2];
+                PN(g, o, p);
+                f = (d + 16) | 0;
+                m = ((c[f >> 2] | 0) + 16) | 0;
+                c[o >> 2] = c[g >> 2];
+                c[(o + 4) >> 2] = c[(g + 4) >> 2];
+                c[(o + 8) >> 2] = c[(g + 8) >> 2];
+                c[(o + 12) >> 2] = c[(g + 12) >> 2];
+                c[p >> 2] = c[m >> 2];
+                c[(p + 4) >> 2] = c[(m + 4) >> 2];
+                c[(p + 8) >> 2] = c[(m + 8) >> 2];
+                c[(p + 12) >> 2] = c[(m + 12) >> 2];
+                wN(i, o, p);
+                c[n >> 2] = c[i >> 2];
+                c[(n + 4) >> 2] = c[(i + 4) >> 2];
+                c[(n + 8) >> 2] = c[(i + 8) >> 2];
+                c[(n + 12) >> 2] = c[(i + 12) >> 2];
+                DK(b, 10, c[j >> 2] | 0);
+                uN(b, d) | 0;
+              }
+              k = ((c[f >> 2] | 0) + 16) | 0;
+              c[r >> 2] = c[k >> 2];
+              c[(r + 4) >> 2] = c[(k + 4) >> 2];
+              c[(r + 8) >> 2] = c[(k + 8) >> 2];
+              c[(r + 12) >> 2] = c[(k + 12) >> 2];
+              k = (e + 48) | 0;
+              m = (e + 64) | 0;
+              n = (q + 16) | 0;
+              j = (e + 56) | 0;
+              e = (q + 16) | 0;
+              i = 0;
+              while (1) {
+                if ((i | 0) >= (c[k >> 2] | 0)) break;
+                if ((i | 0) > 0) {
+                  f = ((c[j >> 2] | 0) + (i << 2)) | 0;
+                  g = c[f >> 2] | 0;
+                  if (!(a[m >> 0] | 0)) {
+                    g = (g + 32) | 0;
+                    c[n >> 2] = c[g >> 2];
+                    c[(n + 4) >> 2] = c[(g + 4) >> 2];
+                    c[(n + 8) >> 2] = c[(g + 8) >> 2];
+                    c[(n + 12) >> 2] = c[(g + 12) >> 2];
+                    h[q >> 3] = +h[((c[f >> 2] | 0) + 16) >> 3];
+                    f = n;
+                    g = 0;
+                  } else {
+                    g = (g + 16) | 0;
+                    c[q >> 2] = c[g >> 2];
+                    c[(q + 4) >> 2] = c[(g + 4) >> 2];
+                    c[(q + 8) >> 2] = c[(g + 8) >> 2];
+                    c[(q + 12) >> 2] = c[(g + 12) >> 2];
+                    h[e >> 3] = +h[q >> 3];
+                    f = ((c[f >> 2] | 0) + 32) | 0;
+                    g = 1;
+                  }
+                  h[(q + (g << 4) + 8) >> 3] = +h[(f + 8) >> 3];
+                  c[o >> 2] = c[q >> 2];
+                  c[(o + 4) >> 2] = c[(q + 4) >> 2];
+                  c[(o + 8) >> 2] = c[(q + 8) >> 2];
+                  c[(o + 12) >> 2] = c[(q + 12) >> 2];
+                  c[p >> 2] = c[r >> 2];
+                  c[(p + 4) >> 2] = c[(r + 4) >> 2];
+                  c[(p + 8) >> 2] = c[(r + 8) >> 2];
+                  c[(p + 12) >> 2] = c[(r + 12) >> 2];
+                  wN(s, o, p);
+                  c[q >> 2] = c[s >> 2];
+                  c[(q + 4) >> 2] = c[(s + 4) >> 2];
+                  c[(q + 8) >> 2] = c[(s + 8) >> 2];
+                  c[(q + 12) >> 2] = c[(s + 12) >> 2];
+                  c[o >> 2] = c[n >> 2];
+                  c[(o + 4) >> 2] = c[(n + 4) >> 2];
+                  c[(o + 8) >> 2] = c[(n + 8) >> 2];
+                  c[(o + 12) >> 2] = c[(n + 12) >> 2];
+                  c[p >> 2] = c[r >> 2];
+                  c[(p + 4) >> 2] = c[(r + 4) >> 2];
+                  c[(p + 8) >> 2] = c[(r + 8) >> 2];
+                  c[(p + 12) >> 2] = c[(r + 12) >> 2];
+                  wN(t, o, p);
+                  c[n >> 2] = c[t >> 2];
+                  c[(n + 4) >> 2] = c[(t + 4) >> 2];
+                  c[(n + 8) >> 2] = c[(t + 8) >> 2];
+                  c[(n + 12) >> 2] = c[(t + 12) >> 2];
+                  qS(b, q, 2);
+                }
+                ON(b, d, c[((c[j >> 2] | 0) + (i << 2)) >> 2] | 0);
+                i = (i + 1) | 0;
+              }
+              l = u;
+              return;
+            }
+            function PN(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0;
+              d = (+h[(c + 8) >> 3] + +h[(b + 8) >> 3]) * 0.5;
+              h[a >> 3] = (+h[c >> 3] + +h[b >> 3]) * 0.5;
+              h[(a + 8) >> 3] = d;
+              return;
+            }
+            function QN(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              e = c[(b + 60) >> 2] | 0;
+              if (!(((e | 0) != 0 ? (a[e >> 0] | 0) == (a[d >> 0] | 0) : 0) ? (s2(e, d) | 0) == 0 : 0)) f = 4;
+              a: do
+                if ((f | 0) == 4) {
+                  g = (b + 56) | 0;
+                  f = c[(b + 48) >> 2] | 0;
+                  e = 0;
+                  while (1) {
+                    if ((e | 0) >= (f | 0)) {
+                      b = 0;
+                      break a;
+                    }
+                    b = QN(c[((c[g >> 2] | 0) + (e << 2)) >> 2] | 0, d) | 0;
+                    if (!b) e = (e + 1) | 0;
+                    else break;
+                  }
+                }
+              while (0);
+              return b | 0;
+            }
+            function RN(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = (b + 8) | 0;
+              h[d >> 3] = +h[d >> 3] * 1.375;
+              c[a >> 2] = c[b >> 2];
+              c[(a + 4) >> 2] = c[(b + 4) >> 2];
+              c[(a + 8) >> 2] = c[(b + 8) >> 2];
+              c[(a + 12) >> 2] = c[(b + 12) >> 2];
+              return;
+            }
+            function SN(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0.0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                l = 0.0,
+                m = 0.0;
+              k = +h[b >> 3];
+              f = k * 0.5;
+              m = +h[(b + 8) >> 3];
+              i = m * 0.5;
+              h[a >> 3] = f;
+              e = m * 0.40909090909090906;
+              h[(a + 8) >> 3] = e;
+              h[(a + 16) >> 3] = f;
+              g = m * 0.4592530909090909;
+              h[(a + 24) >> 3] = g;
+              j = k * 0.275892;
+              h[(a + 32) >> 3] = j;
+              h[(a + 40) >> 3] = i;
+              h[(a + 48) >> 3] = 0.0;
+              h[(a + 56) >> 3] = i;
+              k = k * -0.275892;
+              h[(a + 64) >> 3] = k;
+              h[(a + 72) >> 3] = i;
+              l = -f;
+              h[(a + 80) >> 3] = l;
+              h[(a + 88) >> 3] = g;
+              d = (a + 96) | 0;
+              h[d >> 3] = l;
+              h[(a + 104) >> 3] = e;
+              b = (a + 112) | 0;
+              c[b >> 2] = c[d >> 2];
+              c[(b + 4) >> 2] = c[(d + 4) >> 2];
+              c[(b + 8) >> 2] = c[(d + 8) >> 2];
+              c[(b + 12) >> 2] = c[(d + 12) >> 2];
+              b = (a + 128) | 0;
+              h[b >> 3] = l;
+              h[(a + 136) >> 3] = m * -0.40909090909090906;
+              d = (a + 144) | 0;
+              c[d >> 2] = c[b >> 2];
+              c[(d + 4) >> 2] = c[(b + 4) >> 2];
+              c[(d + 8) >> 2] = c[(b + 8) >> 2];
+              c[(d + 12) >> 2] = c[(b + 12) >> 2];
+              h[(a + 160) >> 3] = l;
+              g = -g;
+              h[(a + 168) >> 3] = g;
+              h[(a + 176) >> 3] = k;
+              i = -i;
+              h[(a + 184) >> 3] = i;
+              h[(a + 192) >> 3] = 0.0;
+              h[(a + 200) >> 3] = i;
+              h[(a + 208) >> 3] = j;
+              h[(a + 216) >> 3] = i;
+              h[(a + 224) >> 3] = f;
+              h[(a + 232) >> 3] = g;
+              d = (a + 240) | 0;
+              h[d >> 3] = f;
+              h[(a + 248) >> 3] = -e;
+              b = (a + 256) | 0;
+              c[b >> 2] = c[d >> 2];
+              c[(b + 4) >> 2] = c[(d + 4) >> 2];
+              c[(b + 8) >> 2] = c[(d + 8) >> 2];
+              c[(b + 12) >> 2] = c[(d + 12) >> 2];
+              b = (a + 288) | 0;
+              d = (a + 272) | 0;
+              c[d >> 2] = c[a >> 2];
+              c[(d + 4) >> 2] = c[(a + 4) >> 2];
+              c[(d + 8) >> 2] = c[(a + 8) >> 2];
+              c[(d + 12) >> 2] = c[(a + 12) >> 2];
+              c[b >> 2] = c[a >> 2];
+              c[(b + 4) >> 2] = c[(a + 4) >> 2];
+              c[(b + 8) >> 2] = c[(a + 8) >> 2];
+              c[(b + 12) >> 2] = c[(a + 12) >> 2];
+              return;
+            }
+            function TN(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0.0,
+                g = 0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0.0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0;
+              x = l;
+              l = (l + 144) | 0;
+              u = (x + 112) | 0;
+              t = (x + 96) | 0;
+              v = (x + 80) | 0;
+              s = (x + 64) | 0;
+              w = (x + 32) | 0;
+              q = (x + 16) | 0;
+              r = x;
+              g = (x + 48) | 0;
+              do
+                if (a) {
+                  j = c[(a + 4) >> 2] | 0;
+                  k = c[a >> 2] | 0;
+                  o = ((c[((c[((xC(k) | 0) + 16) >> 2] | 0) + 116) >> 2] & 3) * 90) | 0;
+                  c[u >> 2] = c[b >> 2];
+                  c[(u + 4) >> 2] = c[(b + 4) >> 2];
+                  c[(u + 8) >> 2] = c[(b + 8) >> 2];
+                  c[(u + 12) >> 2] = c[(b + 12) >> 2];
+                  mK(g, u, o);
+                  c[w >> 2] = c[g >> 2];
+                  c[(w + 4) >> 2] = c[(g + 4) >> 2];
+                  c[(w + 8) >> 2] = c[(g + 8) >> 2];
+                  c[(w + 12) >> 2] = c[(g + 12) >> 2];
+                  if (j | 0) {
+                    d = +h[w >> 3];
+                    if (!(+h[j >> 3] <= d)) {
+                      a = 0;
+                      break;
+                    }
+                    if (!(d <= +h[(j + 16) >> 3])) {
+                      a = 0;
+                      break;
+                    }
+                    d = +h[(w + 8) >> 3];
+                    if (!(+h[(j + 8) >> 3] <= d)) {
+                      a = 0;
+                      break;
+                    }
+                    a = d <= +h[(j + 24) >> 3];
+                    break;
+                  }
+                  if ((k | 0) == (c[47292] | 0)) {
+                    d = +h[23309];
+                    e = +h[23310];
+                    i = +h[23311];
+                  } else {
+                    a = (k + 16) | 0;
+                    b = c[((c[a >> 2] | 0) + 12) >> 2] | 0;
+                    c[47293] = b;
+                    c[47294] = c[(b + 44) >> 2];
+                    c[47295] = c[(b + 8) >> 2];
+                    if (!(c[(b + 40) >> 2] & 2048)) {
+                      n = ((c[((c[((xC(k) | 0) + 16) >> 2] | 0) + 116) >> 2] & 1) | 0) == 0;
+                      o = c[a >> 2] | 0;
+                      h[(n ? 186496 : 186504) >> 3] = +h[(o + 96) >> 3] + +h[(o + 88) >> 3];
+                      h[(n ? 186504 : 186496) >> 3] = +h[(o + 80) >> 3];
+                      i = +h[(o + 32) >> 3] * 72.0;
+                      f = +h[(o + 40) >> 3] * 72.0;
+                      f = +(~~(f + (f >= 0.0 ? 0.5 : -0.5)) | 0);
+                      i = +(~~(i + (i >= 0.0 ? 0.5 : -0.5)) | 0);
+                    } else {
+                      yP(u, b);
+                      i = +h[(u + 16) >> 3] - +h[u >> 3];
+                      f = +h[(u + 24) >> 3] - +h[(u + 8) >> 3];
+                      o = ((c[((c[((xC(k) | 0) + 16) >> 2] | 0) + 116) >> 2] & 1) | 0) == 0;
+                      h[(o ? 186496 : 186504) >> 3] = i;
+                      h[(o ? 186504 : 186496) >> 3] = f;
+                    }
+                    d = +h[23312];
+                    if (d == 0.0) {
+                      h[23312] = 1.0;
+                      d = 1.0;
+                    }
+                    e = +h[23313];
+                    if (e == 0.0) {
+                      h[23313] = 1.0;
+                      e = 1.0;
+                    }
+                    d = i / d;
+                    h[23309] = d;
+                    e = f / e;
+                    h[23310] = e;
+                    i = i * 0.5;
+                    h[23311] = i;
+                    h[23314] = f * 0.5;
+                    o = O(((c[((c[47293] | 0) + 4) >> 2] | 0) + -1) | 0, c[47295] | 0) | 0;
+                    c[47296] = (o | 0) > 0 ? o : 0;
+                    c[47292] = k;
+                  }
+                  f = +h[w >> 3] * d;
+                  h[w >> 3] = f;
+                  o = (w + 8) | 0;
+                  d = +h[o >> 3] * e;
+                  h[o >> 3] = d;
+                  if (!(+B(+f) > i) ? ((e = +B(+d)), (p = +h[23314]), !(e > p)) : 0) {
+                    o = c[47295] | 0;
+                    if ((o | 0) < 3) {
+                      a = +L2(f / i, d / p) < 1.0;
+                      break;
+                    }
+                    b = (c[47297] | 0) % (o | 0) | 0;
+                    a = ((b + 1) | 0) % (o | 0) | 0;
+                    k = c[47294] | 0;
+                    m = c[47296] | 0;
+                    n = (k + ((m + b) << 4)) | 0;
+                    c[q >> 2] = c[n >> 2];
+                    c[(q + 4) >> 2] = c[(n + 4) >> 2];
+                    c[(q + 8) >> 2] = c[(n + 8) >> 2];
+                    c[(q + 12) >> 2] = c[(n + 12) >> 2];
+                    n = (k + ((m + a) << 4)) | 0;
+                    c[r >> 2] = c[n >> 2];
+                    c[(r + 4) >> 2] = c[(n + 4) >> 2];
+                    c[(r + 8) >> 2] = c[(n + 8) >> 2];
+                    c[(r + 12) >> 2] = c[(n + 12) >> 2];
+                    c[s >> 2] = c[w >> 2];
+                    c[(s + 4) >> 2] = c[(w + 4) >> 2];
+                    c[(s + 8) >> 2] = c[(w + 8) >> 2];
+                    c[(s + 12) >> 2] = c[(w + 12) >> 2];
+                    c[v >> 2] = c[46630];
+                    c[(v + 4) >> 2] = c[46631];
+                    c[(v + 8) >> 2] = c[46632];
+                    c[(v + 12) >> 2] = c[46633];
+                    c[t >> 2] = c[q >> 2];
+                    c[(t + 4) >> 2] = c[(q + 4) >> 2];
+                    c[(t + 8) >> 2] = c[(q + 8) >> 2];
+                    c[(t + 12) >> 2] = c[(q + 12) >> 2];
+                    c[u >> 2] = c[n >> 2];
+                    c[(u + 4) >> 2] = c[(n + 4) >> 2];
+                    c[(u + 8) >> 2] = c[(n + 8) >> 2];
+                    c[(u + 12) >> 2] = c[(n + 12) >> 2];
+                    if (BN(s, v, t, u) | 0) {
+                      c[s >> 2] = c[w >> 2];
+                      c[(s + 4) >> 2] = c[(w + 4) >> 2];
+                      c[(s + 8) >> 2] = c[(w + 8) >> 2];
+                      c[(s + 12) >> 2] = c[(w + 12) >> 2];
+                      c[v >> 2] = c[q >> 2];
+                      c[(v + 4) >> 2] = c[(q + 4) >> 2];
+                      c[(v + 8) >> 2] = c[(q + 8) >> 2];
+                      c[(v + 12) >> 2] = c[(q + 12) >> 2];
+                      c[t >> 2] = c[r >> 2];
+                      c[(t + 4) >> 2] = c[(r + 4) >> 2];
+                      c[(t + 8) >> 2] = c[(r + 8) >> 2];
+                      c[(t + 12) >> 2] = c[(r + 12) >> 2];
+                      c[u >> 2] = c[46630];
+                      c[(u + 4) >> 2] = c[46631];
+                      c[(u + 8) >> 2] = c[46632];
+                      c[(u + 12) >> 2] = c[46633];
+                      n = (BN(s, v, t, u) | 0) != 0;
+                      if (
+                        n
+                          ? ((c[s >> 2] = c[w >> 2]),
+                            (c[(s + 4) >> 2] = c[(w + 4) >> 2]),
+                            (c[(s + 8) >> 2] = c[(w + 8) >> 2]),
+                            (c[(s + 12) >> 2] = c[(w + 12) >> 2]),
+                            (c[v >> 2] = c[r >> 2]),
+                            (c[(v + 4) >> 2] = c[(r + 4) >> 2]),
+                            (c[(v + 8) >> 2] = c[(r + 8) >> 2]),
+                            (c[(v + 12) >> 2] = c[(r + 12) >> 2]),
+                            (c[t >> 2] = c[46630]),
+                            (c[(t + 4) >> 2] = c[46631]),
+                            (c[(t + 8) >> 2] = c[46632]),
+                            (c[(t + 12) >> 2] = c[46633]),
+                            (c[u >> 2] = c[q >> 2]),
+                            (c[(u + 4) >> 2] = c[(q + 4) >> 2]),
+                            (c[(u + 8) >> 2] = c[(q + 8) >> 2]),
+                            (c[(u + 12) >> 2] = c[(q + 12) >> 2]),
+                            (BN(s, v, t, u) | 0) != 0)
+                          : 0
+                      ) {
+                        a = 1;
+                        break;
+                      } else {
+                        j = b;
+                        b = 1;
+                      }
+                      while (1) {
+                        if ((b | 0) >= (o | 0)) {
+                          b = 31;
+                          break;
+                        }
+                        if (n) {
+                          g = a;
+                          a = ((a + 1) | 0) % (o | 0) | 0;
+                        } else {
+                          g = ((j + -1 + o) | 0) % (o | 0) | 0;
+                          a = j;
+                        }
+                        q = (k + ((m + g) << 4)) | 0;
+                        r = (k + ((m + a) << 4)) | 0;
+                        c[s >> 2] = c[w >> 2];
+                        c[(s + 4) >> 2] = c[(w + 4) >> 2];
+                        c[(s + 8) >> 2] = c[(w + 8) >> 2];
+                        c[(s + 12) >> 2] = c[(w + 12) >> 2];
+                        c[v >> 2] = c[46630];
+                        c[(v + 4) >> 2] = c[46631];
+                        c[(v + 8) >> 2] = c[46632];
+                        c[(v + 12) >> 2] = c[46633];
+                        c[t >> 2] = c[q >> 2];
+                        c[(t + 4) >> 2] = c[(q + 4) >> 2];
+                        c[(t + 8) >> 2] = c[(q + 8) >> 2];
+                        c[(t + 12) >> 2] = c[(q + 12) >> 2];
+                        c[u >> 2] = c[r >> 2];
+                        c[(u + 4) >> 2] = c[(r + 4) >> 2];
+                        c[(u + 8) >> 2] = c[(r + 8) >> 2];
+                        c[(u + 12) >> 2] = c[(r + 12) >> 2];
+                        if (!(BN(s, v, t, u) | 0)) {
+                          b = 30;
+                          break;
+                        } else {
+                          j = g;
+                          b = (b + 1) | 0;
+                        }
+                      }
+                      if ((b | 0) == 30) {
+                        c[47297] = g;
+                        a = 0;
+                        break;
+                      } else if ((b | 0) == 31) {
+                        c[47297] = j;
+                        a = 1;
+                        break;
+                      }
+                    } else a = 0;
+                  } else a = 0;
+                } else {
+                  c[47292] = 0;
+                  a = 0;
+                }
+              while (0);
+              l = x;
+              return (a & 1) | 0;
+            }
+            function UN(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0;
+              j = l;
+              l = (l + 32) | 0;
+              f = (j + 16) | 0;
+              i = j;
+              if (a) {
+                a = c[a >> 2] | 0;
+                k = ((c[((c[((xC(a) | 0) + 16) >> 2] | 0) + 116) >> 2] & 3) * 90) | 0;
+                c[f >> 2] = c[b >> 2];
+                c[(f + 4) >> 2] = c[(b + 4) >> 2];
+                c[(f + 8) >> 2] = c[(b + 8) >> 2];
+                c[(f + 12) >> 2] = c[(b + 12) >> 2];
+                mK(i, f, k);
+                g = +h[i >> 3];
+                e = +h[(i + 8) >> 3];
+                if ((a | 0) == (c[47300] | 0)) d = +h[23317];
+                else {
+                  i = c[((c[(a + 16) >> 2] | 0) + 12) >> 2] | 0;
+                  k = ((c[(i + 4) >> 2] << 1) + -2) | 0;
+                  d = +h[((c[(i + 44) >> 2] | 0) + ((((k | 0) > 0 ? k : 0) | 1) << 4)) >> 3];
+                  h[23317] = d;
+                  c[47300] = a;
+                }
+                if ((+B(+g) > d) | (+B(+e) > d)) a = 0;
+                else a = (+L2(g, e) <= d) & 1;
+              } else {
+                c[47300] = 0;
+                a = 0;
+              }
+              l = j;
+              return a | 0;
+            }
+            function VN(e, f) {
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0.0,
+                v = 0,
+                w = 0;
+              t = l;
+              l = (l + 16) | 0;
+              j = t;
+              r = c[(e + 16) >> 2] | 0;
+              s = (r + 208) | 0;
+              g = c[s >> 2] | 0;
+              if ((g | 0) == 0 ? (b[(r + 260) >> 1] & 1) == 0 : 0) q = 0;
+              else if (!(c[(e + 152) >> 2] & 4)) {
+                cS(e, g, c[(r + 228) >> 2] | 0, c[(r + 244) >> 2] | 0, c[(r + 212) >> 2] | 0);
+                q = 1;
+              } else q = 1;
+              n = (f + 16) | 0;
+              k = c[((c[n >> 2] | 0) + 12) >> 2] | 0;
+              o = c[(k + 44) >> 2] | 0;
+              p = c[(k + 8) >> 2] | 0;
+              k = c[(k + 4) >> 2] | 0;
+              if ((c[47298] | 0) < (p | 0)) {
+                g = (p + 2) | 0;
+                c[47298] = g;
+                i = c[47299] | 0;
+                if (!i) g = KK(g << 4) | 0;
+                else g = MK(i, g << 4) | 0;
+                c[47299] = g;
+              }
+              yN(f, j) | 0;
+              if (!(c[j >> 2] & 32)) lS(e, 22020);
+              else lS(e, 22016);
+              g = c[47172] | 0;
+              if (g | 0) uS(e, +_O(f, g, 1.0, 0.0));
+              g = d[((c[n >> 2] | 0) + 117) >> 0] | 0;
+              do
+                if (!(g & 1)) {
+                  if ((g & 2) | 0) {
+                    hS(e, bP(f, 0, 106256) | 0);
+                    g = bP(f, 0, 106264) | 0;
+                    jS(e, g);
+                    break;
+                  }
+                  if ((g & 8) | 0) {
+                    hS(e, bP(f, 0, 106272) | 0);
+                    g = bP(f, 0, 106280) | 0;
+                    jS(e, g);
+                    break;
+                  }
+                  if (!(g & 4)) {
+                    g = xN(f, 137314) | 0;
+                    jS(e, g);
+                    uN(e, f) | 0;
+                    break;
+                  } else {
+                    hS(e, bP(f, 0, 106288) | 0);
+                    g = bP(f, 0, 106296) | 0;
+                    jS(e, g);
+                    break;
+                  }
+                } else {
+                  hS(e, bP(f, 0, 106240) | 0);
+                  g = bP(f, 0, 106248) | 0;
+                  jS(e, g);
+                }
+              while (0);
+              if (!k)
+                if (!(a[g >> 0] | 0)) i = 1;
+                else {
+                  hS(e, g);
+                  i = 1;
+                }
+              else i = k;
+              j = 1;
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (i | 0)) break;
+                k = O(f, p) | 0;
+                m = c[47299] | 0;
+                g = 0;
+                while (1) {
+                  if ((g | 0) >= (p | 0)) break;
+                  w = (g + k) | 0;
+                  u = +h[(o + (w << 4) + 8) >> 3];
+                  v = c[n >> 2] | 0;
+                  h[(m + (g << 4)) >> 3] = +h[(v + 16) >> 3] + +h[(o + (w << 4)) >> 3];
+                  h[(m + (g << 4) + 8) >> 3] = +h[(v + 24) >> 3] + u;
+                  g = (g + 1) | 0;
+                }
+                mS(e, m, p, j);
+                j = 0;
+                f = (f + 1) | 0;
+              }
+              if (q) {
+                if ((c[(e + 152) >> 2] & 4) | 0)
+                  cS(e, c[s >> 2] | 0, c[(r + 228) >> 2] | 0, c[(r + 244) >> 2] | 0, c[(r + 212) >> 2] | 0);
+                dS(e);
+              }
+              l = t;
+              return;
+            }
+            function WN(a, b, e, f) {
+              a = a | 0;
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0;
+              g = l;
+              l = (l + 48) | 0;
+              h = g;
+              e = XN(b, e, f) | 0;
+              c[(h + 36) >> 2] = c[(f + 36) >> 2];
+              CN(b, c[(f + 24) >> 2] | 0, h, e, d[(f + 33) >> 0] | 0, 0) | 0;
+              b = h;
+              e = (a + 40) | 0;
+              do {
+                c[a >> 2] = c[b >> 2];
+                a = (a + 4) | 0;
+                b = (b + 4) | 0;
+              } while ((a | 0) < (e | 0));
+              l = g;
+              return;
+            }
+            function XN(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0.0,
+                j = 0.0,
+                k = 0,
+                m = 0.0,
+                n = 0.0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0.0,
+                B = 0.0,
+                C = 0;
+              z = l;
+              l = (l + 32) | 0;
+              y = z;
+              g = (z + 24) | 0;
+              k = (z + 16) | 0;
+              x = c[((c[((c[((xC(b) | 0) + 60) >> 2] | 0) + 16) >> 2] | 0) + 116) >> 2] & 3;
+              f = (b + 16) | 0;
+              w = ((c[f >> 2] | 0) + 16) | 0;
+              c[y >> 2] = c[w >> 2];
+              c[(y + 4) >> 2] = c[(w + 4) >> 2];
+              c[(y + 8) >> 2] = c[(w + 8) >> 2];
+              c[(y + 12) >> 2] = c[(w + 12) >> 2];
+              YN(g, y, x);
+              w = ((c[(d + 16) >> 2] | 0) + 16) | 0;
+              c[y >> 2] = c[w >> 2];
+              c[(y + 4) >> 2] = c[(w + 4) >> 2];
+              c[(y + 8) >> 2] = c[(w + 8) >> 2];
+              c[(y + 12) >> 2] = c[(w + 12) >> 2];
+              YN(k, y, x);
+              x = a[(e + 33) >> 0] | 0;
+              y = x & 255;
+              a: do
+                switch ((x << 24) >> 24) {
+                  case 0:
+                  case 15: {
+                    d = 0;
+                    break;
+                  }
+                  default: {
+                    d = c[(e + 24) >> 2] | 0;
+                    if (!d) {
+                      x = ((c[((c[((xC(b) | 0) + 16) >> 2] | 0) + 116) >> 2] & 1) | 0) == 0;
+                      w = c[f >> 2] | 0;
+                      B = +h[(w + 80) >> 3] * 0.5;
+                      A = -B;
+                      m = +h[(w + 88) >> 3];
+                      j = -m;
+                      n = x ? j : A;
+                      i = x ? m : B;
+                      m = x ? B : m;
+                      j = x ? A : j;
+                    } else {
+                      n = +h[d >> 3];
+                      i = +h[(d + 16) >> 3];
+                      m = +h[(d + 24) >> 3];
+                      j = +h[(d + 8) >> 3];
+                    }
+                    x = c[g >> 2] | 0;
+                    v = c[(g + 4) >> 2] | 0;
+                    w = c[k >> 2] | 0;
+                    s = c[(k + 4) >> 2] | 0;
+                    t = ~~j;
+                    u = ~~((i + n) * 0.5);
+                    r = ~~i;
+                    q = ~~((m + j) * 0.5);
+                    p = ~~m;
+                    o = ~~n;
+                    g = 0;
+                    k = 0;
+                    d = 0;
+                    e = 0;
+                    b = 0;
+                    while (1) {
+                      if ((k | 0) == 4) break a;
+                      if ((1 << k) & y) {
+                        switch (k | 0) {
+                          case 0: {
+                            e = u;
+                            b = t;
+                            break;
+                          }
+                          case 1: {
+                            e = r;
+                            b = q;
+                            break;
+                          }
+                          case 2: {
+                            e = u;
+                            b = p;
+                            break;
+                          }
+                          case 3: {
+                            e = o;
+                            b = q;
+                            break;
+                          }
+                          default: {
+                          }
+                        }
+                        e = (x + e) | 0;
+                        b = (v + b) | 0;
+                        f = (e - w) | 0;
+                        C = (b - s) | 0;
+                        f = ((O(C, C) | 0) + (O(f, f) | 0)) | 0;
+                        if (((d | 0) == 0) | ((f | 0) < (g | 0))) d = c[(22028 + (k << 2)) >> 2] | 0;
+                        else f = g;
+                      } else f = g;
+                      g = f;
+                      k = (k + 1) | 0;
+                    }
+                  }
+                }
+              while (0);
+              l = z;
+              return d | 0;
+            }
+            function YN(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0;
+              switch (d | 0) {
+                case 0: {
+                  f = +h[b >> 3];
+                  e = +h[(b + 8) >> 3];
+                  break;
+                }
+                case 2: {
+                  f = +h[b >> 3];
+                  e = -+h[(b + 8) >> 3];
+                  break;
+                }
+                case 1: {
+                  f = -+h[(b + 8) >> 3];
+                  e = +h[b >> 3];
+                  break;
+                }
+                case 3: {
+                  f = +h[(b + 8) >> 3];
+                  e = +h[b >> 3];
+                  break;
+                }
+                default: {
+                  f = 0.0;
+                  e = 0.0;
+                }
+              }
+              c[a >> 2] = ~~(f + (f >= 0.0 ? 0.5 : -0.5));
+              c[(a + 4) >> 2] = ~~(e + (e >= 0.0 ? 0.5 : -0.5));
+              return;
+            }
+            function ZN(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 80) | 0;
+              f = (i + 40) | 0;
+              h = i;
+              g = (b + 16) | 0;
+              e = c[g >> 2] | 0;
+              d = (e + 16) | 0;
+              if (a[(e + 47) >> 0] | 0) {
+                e = c[b >> 2] & 3;
+                WN(
+                  f,
+                  c[(((e | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0,
+                  c[(((e | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0,
+                  d
+                );
+                e = f;
+                f = (d + 40) | 0;
+                do {
+                  c[d >> 2] = c[e >> 2];
+                  d = (d + 4) | 0;
+                  e = (e + 4) | 0;
+                } while ((d | 0) < (f | 0));
+                e = c[g >> 2] | 0;
+              }
+              d = (e + 56) | 0;
+              if (a[(e + 87) >> 0] | 0) {
+                e = c[b >> 2] & 3;
+                WN(
+                  h,
+                  c[(((e | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0,
+                  c[(((e | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0,
+                  d
+                );
+                e = h;
+                f = (d + 40) | 0;
+                do {
+                  c[d >> 2] = c[e >> 2];
+                  d = (d + 4) | 0;
+                  e = (e + 4) | 0;
+                } while ((d | 0) < (f | 0));
+              }
+              l = i;
+              return;
+            }
+            function _N() {
+              var a = 0,
+                b = 0,
+                d = 0;
+              a = l;
+              l = (l + 32) | 0;
+              b = (a + 16) | 0;
+              d = a;
+              c[d >> 2] = 0;
+              c[(d + 4) >> 2] = 0;
+              c[(d + 8) >> 2] = 0;
+              c[(d + 12) >> 2] = 0;
+              c[b >> 2] = c[d >> 2];
+              c[(b + 4) >> 2] = c[(d + 4) >> 2];
+              c[(b + 8) >> 2] = c[(d + 8) >> 2];
+              c[(b + 12) >> 2] = c[(d + 12) >> 2];
+              TN(0, b) | 0;
+              c[b >> 2] = c[d >> 2];
+              c[(b + 4) >> 2] = c[(d + 4) >> 2];
+              c[(b + 8) >> 2] = c[(d + 8) >> 2];
+              c[(b + 12) >> 2] = c[(d + 12) >> 2];
+              UN(0, b) | 0;
+              c[b >> 2] = c[d >> 2];
+              c[(b + 4) >> 2] = c[(d + 4) >> 2];
+              c[(b + 8) >> 2] = c[(d + 8) >> 2];
+              c[(b + 12) >> 2] = c[(d + 12) >> 2];
+              pN(0, b) | 0;
+              l = a;
+              return;
+            }
+            function $N(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0.0,
+                q = 0,
+                r = 0.0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0;
+              z = l;
+              l = (l + 192) | 0;
+              s = (z + 176) | 0;
+              x = (z + 112) | 0;
+              y = (z + 48) | 0;
+              t = (z + 32) | 0;
+              u = (z + 24) | 0;
+              v = (z + 16) | 0;
+              w = z;
+              if (!((e << 24) >> 24)) {
+                k = (d + 48) | 0;
+                c[t >> 2] = c[k >> 2];
+                c[(t + 4) >> 2] = c[(k + 4) >> 2];
+                c[(t + 8) >> 2] = c[(k + 8) >> 2];
+                c[(t + 12) >> 2] = c[(k + 12) >> 2];
+                k = u;
+                m = v;
+                n = x;
+                o = 0;
+              } else {
+                c[t >> 2] = c[d >> 2];
+                c[(t + 4) >> 2] = c[(d + 4) >> 2];
+                c[(t + 8) >> 2] = c[(d + 8) >> 2];
+                c[(t + 12) >> 2] = c[(d + 12) >> 2];
+                k = v;
+                m = u;
+                n = 0;
+                o = x;
+              }
+              h[u >> 3] = 0.0;
+              h[v >> 3] = 1.0;
+              q = (t + 8) | 0;
+              f = 0.0;
+              g = 1.0;
+              j = 0;
+              p = +h[t >> 3];
+              while (1) {
+                r = +h[q >> 3];
+                f = (f + g) * 0.5;
+                kP(w, d, 3, f, n, o);
+                c[t >> 2] = c[w >> 2];
+                c[(t + 4) >> 2] = c[(w + 4) >> 2];
+                c[(t + 8) >> 2] = c[(w + 8) >> 2];
+                c[(t + 12) >> 2] = c[(w + 12) >> 2];
+                c[s >> 2] = c[w >> 2];
+                c[(s + 4) >> 2] = c[(w + 4) >> 2];
+                c[(s + 8) >> 2] = c[(w + 8) >> 2];
+                c[(s + 12) >> 2] = c[(w + 12) >> 2];
+                a: do
+                  if (!(((lb[b & 127](a, s) | 0) << 24) >> 24)) {
+                    e = 0;
+                    while (1) {
+                      if ((e | 0) == 4) {
+                        e = k;
+                        j = 1;
+                        break a;
+                      }
+                      j = (y + (e << 4)) | 0;
+                      A = (x + (e << 4)) | 0;
+                      c[j >> 2] = c[A >> 2];
+                      c[(j + 4) >> 2] = c[(A + 4) >> 2];
+                      c[(j + 8) >> 2] = c[(A + 8) >> 2];
+                      c[(j + 12) >> 2] = c[(A + 12) >> 2];
+                      e = (e + 1) | 0;
+                    }
+                  } else e = m;
+                while (0);
+                h[e >> 3] = f;
+                i = +h[t >> 3];
+                p = p - i;
+                if (!((p >= 0.0 ? p : -p) > 0.5) ? ((r = r - +h[q >> 3]), !((r >= 0.0 ? r : -r) > 0.5)) : 0) break;
+                f = +h[u >> 3];
+                g = +h[v >> 3];
+                p = i;
+              }
+              b: do
+                if (!((j << 24) >> 24)) {
+                  e = 0;
+                  while (1) {
+                    if ((e | 0) == 4) break b;
+                    A = (d + (e << 4)) | 0;
+                    y = (x + (e << 4)) | 0;
+                    c[A >> 2] = c[y >> 2];
+                    c[(A + 4) >> 2] = c[(y + 4) >> 2];
+                    c[(A + 8) >> 2] = c[(y + 8) >> 2];
+                    c[(A + 12) >> 2] = c[(y + 12) >> 2];
+                    e = (e + 1) | 0;
+                  }
+                } else {
+                  e = 0;
+                  while (1) {
+                    if ((e | 0) == 4) break b;
+                    A = (d + (e << 4)) | 0;
+                    x = (y + (e << 4)) | 0;
+                    c[A >> 2] = c[x >> 2];
+                    c[(A + 4) >> 2] = c[(x + 4) >> 2];
+                    c[(A + 8) >> 2] = c[(x + 8) >> 2];
+                    c[(A + 12) >> 2] = c[(x + 12) >> 2];
+                    e = (e + 1) | 0;
+                  }
+                }
+              while (0);
+              l = z;
+              return;
+            }
+            function aO(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0.0;
+              m = l;
+              l = (l + 48) | 0;
+              d = (m + 16) | 0;
+              e = m;
+              f = (m + 32) | 0;
+              g = (a + 16) | 0;
+              i = c[g >> 2] | 0;
+              j = c[(i + 8) >> 2] | 0;
+              if (j | 0 ? ((k = (j + 4) | 0), c[((c[k >> 2] | 0) + 12) >> 2] | 0) : 0) {
+                c[f >> 2] = a;
+                c[(f + 4) >> 2] = 0;
+                n = +h[(i + 96) >> 3];
+                h[e >> 3] = +h[b >> 3] - +h[(i + 16) >> 3];
+                h[(e + 8) >> 3] = +h[(b + 8) >> 3] - +h[(i + 24) >> 3];
+                k = c[((c[k >> 2] | 0) + 12) >> 2] | 0;
+                c[d >> 2] = c[e >> 2];
+                c[(d + 4) >> 2] = c[(e + 4) >> 2];
+                c[(d + 8) >> 2] = c[(e + 8) >> 2];
+                c[(d + 12) >> 2] = c[(e + 12) >> 2];
+                k = lb[k & 127](f, d) | 0;
+                h[((c[g >> 2] | 0) + 96) >> 3] = n;
+                bO(f, a, b, k);
+              }
+              l = m;
+              return;
+            }
+            function bO(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0.0,
+                m = 0,
+                n = 0;
+              n = l;
+              l = (l + 64) | 0;
+              m = n;
+              j = (b + 16) | 0;
+              g = c[j >> 2] | 0;
+              k = +h[(g + 96) >> 3];
+              i = (g + 16) | 0;
+              f = (g + 24) | 0;
+              b = 0;
+              while (1) {
+                if ((b | 0) == 4) break;
+                h[(m + (b << 4)) >> 3] = +h[(d + (b << 4)) >> 3] - +h[i >> 3];
+                h[(m + (b << 4) + 8) >> 3] = +h[(d + (b << 4) + 8) >> 3] - +h[f >> 3];
+                b = (b + 1) | 0;
+              }
+              $N(a, c[((c[((c[(g + 8) >> 2] | 0) + 4) >> 2] | 0) + 12) >> 2] | 0, m, e);
+              b = 0;
+              while (1) {
+                if ((b | 0) == 4) break;
+                e = c[j >> 2] | 0;
+                h[(d + (b << 4)) >> 3] = +h[(e + 16) >> 3] + +h[(m + (b << 4)) >> 3];
+                h[(d + (b << 4) + 8) >> 3] = +h[(e + 24) >> 3] + +h[(m + (b << 4) + 8) >> 3];
+                b = (b + 1) | 0;
+              }
+              h[((c[j >> 2] | 0) + 96) >> 3] = k;
+              l = n;
+              return;
+            }
+            function cO(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              while (1) {
+                f = (b + 16) | 0;
+                b = c[f >> 2] | 0;
+                if (!(a[(b + 112) >> 0] | 0)) break;
+                b = c[(b + 116) >> 2] | 0;
+              }
+              b = c[(b + 8) >> 2] | 0;
+              if (!b) {
+                b = JK(40) | 0;
+                c[((c[f >> 2] | 0) + 8) >> 2] = b;
+              }
+              e = c[b >> 2] | 0;
+              if (!e) b = KK(((((c[(b + 4) >> 2] | 0) * 48) | 0) + 48) | 0) | 0;
+              else b = MK(e, ((((c[(b + 4) >> 2] | 0) * 48) | 0) + 48) | 0) | 0;
+              f = c[((c[f >> 2] | 0) + 8) >> 2] | 0;
+              c[f >> 2] = b;
+              f = (f + 4) | 0;
+              e = c[f >> 2] | 0;
+              c[f >> 2] = e + 1;
+              f = (b + ((e * 48) | 0)) | 0;
+              c[f >> 2] = JK(d << 4) | 0;
+              c[(b + ((e * 48) | 0) + 4) >> 2] = d;
+              b = (b + ((e * 48) | 0) + 8) | 0;
+              e = (b + 40) | 0;
+              do {
+                c[b >> 2] = 0;
+                b = (b + 4) | 0;
+              } while ((b | 0) < (e | 0));
+              return f | 0;
+            }
+            function dO(b, e, f, g, i) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              var j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0.0,
+                F = 0.0;
+              D = l;
+              l = (l + 96) | 0;
+              A = (D + 16) | 0;
+              u = D;
+              x = (D + 92) | 0;
+              y = (D + 88) | 0;
+              v = (D + 80) | 0;
+              m = c[((((c[b >> 2] & 3) | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0;
+              z = xC(m) | 0;
+              B = cO(b, g) | 0;
+              n = b;
+              while (1) {
+                o = c[(n + 16) >> 2] | 0;
+                if (!(a[(o + 112) >> 0] | 0)) break;
+                n = c[(o + 116) >> 2] | 0;
+              }
+              if (
+                (a[(i + 8) >> 0] | 0) == 0
+                  ? ((j = c[(m + 16) >> 2] | 0),
+                    (k = c[(e + 16) >> 2] | 0),
+                    (c[(j + 232) >> 2] | 0) == (c[(k + 232) >> 2] | 0))
+                  : 0
+              ) {
+                p = (c[(j + 236) >> 2] | 0) > (c[(k + 236) >> 2] | 0);
+                w = p ? m : e;
+                m = p ? e : m;
+              } else w = e;
+              if ((m | 0) == (c[((((c[n >> 2] & 3) | 0) == 3 ? n : (n + 48) | 0) + 40) >> 2] | 0)) {
+                j = (o + 80) | 0;
+                k = (o + 40) | 0;
+                p = d[(o + 86) >> 0] | 0;
+                e = d[(o + 46) >> 0] | 0;
+              } else {
+                j = (o + 40) | 0;
+                k = (o + 80) | 0;
+                p = d[(o + 46) >> 0] | 0;
+                e = d[(o + 86) >> 0] | 0;
+              }
+              o = c[j >> 2] | 0;
+              j = c[k >> 2] | 0;
+              if (
+                ((e | 0) != 0 ? ((r = (m + 16) | 0), (q = c[((c[r >> 2] | 0) + 8) >> 2] | 0), (q | 0) != 0) : 0)
+                  ? (c[((c[(q + 4) >> 2] | 0) + 12) >> 2] | 0) != 0
+                  : 0
+              ) {
+                c[v >> 2] = m;
+                c[(v + 4) >> 2] = j;
+                j = (g + -4) | 0;
+                e = (u + 8) | 0;
+                k = 0;
+                while (1) {
+                  if ((k | 0) >= (j | 0)) break;
+                  n = (k + 3) | 0;
+                  q = c[r >> 2] | 0;
+                  h[u >> 3] = +h[(f + (n << 4)) >> 3] - +h[(q + 16) >> 3];
+                  h[e >> 3] = +h[(f + (n << 4) + 8) >> 3] - +h[(q + 24) >> 3];
+                  q = c[((c[((c[(q + 8) >> 2] | 0) + 4) >> 2] | 0) + 12) >> 2] | 0;
+                  c[A >> 2] = c[u >> 2];
+                  c[(A + 4) >> 2] = c[(u + 4) >> 2];
+                  c[(A + 8) >> 2] = c[(u + 8) >> 2];
+                  c[(A + 12) >> 2] = c[(u + 12) >> 2];
+                  if (!(((lb[q & 127](v, A) | 0) << 24) >> 24)) break;
+                  else k = n;
+                }
+                c[x >> 2] = k;
+                bO(v, m, (f + (k << 4)) | 0, 1);
+              } else {
+                c[x >> 2] = 0;
+                k = 0;
+              }
+              if (
+                ((p | 0) != 0 ? ((t = (w + 16) | 0), (s = c[((c[t >> 2] | 0) + 8) >> 2] | 0), (s | 0) != 0) : 0)
+                  ? (c[((c[(s + 4) >> 2] | 0) + 12) >> 2] | 0) != 0
+                  : 0
+              ) {
+                c[v >> 2] = w;
+                c[(v + 4) >> 2] = o;
+                m = (g + -4) | 0;
+                e = (u + 8) | 0;
+                j = m;
+                while (1) {
+                  if ((j | 0) <= 0) break;
+                  g = c[t >> 2] | 0;
+                  h[u >> 3] = +h[(f + (j << 4)) >> 3] - +h[(g + 16) >> 3];
+                  h[e >> 3] = +h[(f + (j << 4) + 8) >> 3] - +h[(g + 24) >> 3];
+                  g = c[((c[((c[(g + 8) >> 2] | 0) + 4) >> 2] | 0) + 12) >> 2] | 0;
+                  c[A >> 2] = c[u >> 2];
+                  c[(A + 4) >> 2] = c[(u + 4) >> 2];
+                  c[(A + 8) >> 2] = c[(u + 8) >> 2];
+                  c[(A + 12) >> 2] = c[(u + 12) >> 2];
+                  if (!(((lb[g & 127](v, A) | 0) << 24) >> 24)) break;
+                  j = (j + -3) | 0;
+                }
+                c[y >> 2] = j;
+                bO(v, w, (f + (j << 4)) | 0, 0);
+              } else {
+                m = (g + -4) | 0;
+                c[y >> 2] = m;
+                j = m;
+              }
+              while (1) {
+                if ((k | 0) >= (m | 0)) break;
+                e = (k + 3) | 0;
+                E = +h[(f + (k << 4)) >> 3] - +h[(f + (e << 4)) >> 3];
+                F = +h[(f + (k << 4) + 8) >> 3] - +h[(f + (e << 4) + 8) >> 3];
+                if (F * F + E * E < 1.0e-6) k = e;
+                else break;
+              }
+              c[x >> 2] = k;
+              while (1) {
+                if ((j | 0) <= 0) break;
+                v = (j + 3) | 0;
+                F = +h[(f + (j << 4)) >> 3] - +h[(f + (v << 4)) >> 3];
+                E = +h[(f + (j << 4) + 8) >> 3] - +h[(f + (v << 4) + 8) >> 3];
+                if (!(E * E + F * F < 1.0e-6)) break;
+                j = (j + -3) | 0;
+              }
+              c[y >> 2] = j;
+              eO(b, w, f, x, y, B, i);
+              r = c[x >> 2] | 0;
+              n = c[y >> 2] | 0;
+              m = (n + 4) | 0;
+              n = (n + 3) | 0;
+              o = (A + 16) | 0;
+              p = (A + 32) | 0;
+              q = (A + 48) | 0;
+              k = (z + 16) | 0;
+              j = r;
+              while (1) {
+                if ((j | 0) >= (m | 0)) break;
+                z = ((c[B >> 2] | 0) + ((j - r) << 4)) | 0;
+                e = (f + (j << 4)) | 0;
+                c[z >> 2] = c[e >> 2];
+                c[(z + 4) >> 2] = c[(e + 4) >> 2];
+                c[(z + 8) >> 2] = c[(e + 8) >> 2];
+                c[(z + 12) >> 2] = c[(e + 12) >> 2];
+                c[A >> 2] = c[e >> 2];
+                c[(A + 4) >> 2] = c[(e + 4) >> 2];
+                c[(A + 8) >> 2] = c[(e + 8) >> 2];
+                c[(A + 12) >> 2] = c[(e + 12) >> 2];
+                e = (j + 1) | 0;
+                if ((j | 0) >= (n | 0)) {
+                  C = 38;
+                  break;
+                }
+                y = ((c[B >> 2] | 0) + ((e - r) << 4)) | 0;
+                z = (f + (e << 4)) | 0;
+                c[y >> 2] = c[z >> 2];
+                c[(y + 4) >> 2] = c[(z + 4) >> 2];
+                c[(y + 8) >> 2] = c[(z + 8) >> 2];
+                c[(y + 12) >> 2] = c[(z + 12) >> 2];
+                c[o >> 2] = c[z >> 2];
+                c[(o + 4) >> 2] = c[(z + 4) >> 2];
+                c[(o + 8) >> 2] = c[(z + 8) >> 2];
+                c[(o + 12) >> 2] = c[(z + 12) >> 2];
+                z = (j + 2) | 0;
+                y = ((c[B >> 2] | 0) + ((z - r) << 4)) | 0;
+                z = (f + (z << 4)) | 0;
+                c[y >> 2] = c[z >> 2];
+                c[(y + 4) >> 2] = c[(z + 4) >> 2];
+                c[(y + 8) >> 2] = c[(z + 8) >> 2];
+                c[(y + 12) >> 2] = c[(z + 12) >> 2];
+                c[p >> 2] = c[z >> 2];
+                c[(p + 4) >> 2] = c[(z + 4) >> 2];
+                c[(p + 8) >> 2] = c[(z + 8) >> 2];
+                c[(p + 12) >> 2] = c[(z + 12) >> 2];
+                z = (j + 3) | 0;
+                y = (f + (z << 4)) | 0;
+                c[q >> 2] = c[y >> 2];
+                c[(q + 4) >> 2] = c[(y + 4) >> 2];
+                c[(q + 8) >> 2] = c[(y + 8) >> 2];
+                c[(q + 12) >> 2] = c[(y + 12) >> 2];
+                lI(((c[k >> 2] | 0) + 16) | 0, A);
+                j = z;
+              }
+              c[(B + 4) >> 2] = m - r;
+              l = D;
+              return;
+            }
+            function eO(b, d, e, f, g, h, i) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              i = i | 0;
+              var j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              p = l;
+              l = (l + 16) | 0;
+              m = (p + 4) | 0;
+              n = p;
+              o = b;
+              while (1) {
+                j = c[((c[(o + 16) >> 2] | 0) + 116) >> 2] | 0;
+                if (!j) break;
+                else o = j;
+              }
+              if (!(a[(i + 8) >> 0] | 0)) j = (kb[c[i >> 2] & 63](o) | 0) & 255;
+              else j = 0;
+              HH(o, m, n);
+              k = (i + 4) | 0;
+              if (((kb[c[k >> 2] & 63](d) | 0) << 24) >> 24) c[n >> 2] = 0;
+              if (
+                ((kb[c[k >> 2] & 63](c[((((c[b >> 2] & 3) | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0) | 0) << 24) >>
+                24
+              )
+                c[m >> 2] = 0;
+              if (j | 0) {
+                d = c[m >> 2] | 0;
+                c[m >> 2] = c[n >> 2];
+                c[n >> 2] = d;
+              }
+              if (!(a[(i + 9) >> 0] | 0)) {
+                j = c[m >> 2] | 0;
+                if (j | 0) c[f >> 2] = WH(o, e, c[f >> 2] | 0, c[g >> 2] | 0, h, j) | 0;
+                j = c[n >> 2] | 0;
+                if (j | 0) c[g >> 2] = UH(o, e, c[f >> 2] | 0, c[g >> 2] | 0, h, j) | 0;
+              } else {
+                k = c[n >> 2] | 0;
+                j = c[m >> 2] | 0;
+                if (j | k | 0) XH(o, e, c[f >> 2] | 0, c[g >> 2] | 0, h, j, k);
+              }
+              l = p;
+              return;
+            }
+            function fO(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              if (+h[b >> 3] < +h[(b + 16) >> 3] ? +h[(b + 8) >> 3] < +h[(b + 24) >> 3] : 0) {
+                d = c[(a + 84) >> 2] | 0;
+                e = (a + 80) | 0;
+                a = c[e >> 2] | 0;
+                c[e >> 2] = a + 1;
+                a = (d + (a << 5)) | 0;
+                c[a >> 2] = c[b >> 2];
+                c[(a + 4) >> 2] = c[(b + 4) >> 2];
+                c[(a + 8) >> 2] = c[(b + 8) >> 2];
+                c[(a + 12) >> 2] = c[(b + 12) >> 2];
+                c[(a + 16) >> 2] = c[(b + 16) >> 2];
+                c[(a + 20) >> 2] = c[(b + 20) >> 2];
+                c[(a + 24) >> 2] = c[(b + 24) >> 2];
+                c[(a + 28) >> 2] = c[(b + 28) >> 2];
+              }
+              return;
+            }
+            function gO(b, d, e, f, g) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0.0,
+                m = 0.0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0.0,
+                z = 0.0;
+              x = l;
+              l = (l + 112) | 0;
+              u = (x + 72) | 0;
+              o = (x + 56) | 0;
+              n = (x + 16) | 0;
+              q = x;
+              j = c[d >> 2] & 3;
+              p = (d + 48) | 0;
+              w = c[(((j | 0) == 3 ? d : p) + 40) >> 2] | 0;
+              t = (d + 16) | 0;
+              r = c[t >> 2] | 0;
+              i = (r + 16) | 0;
+              if (a[(r + 47) >> 0] | 0) {
+                WN(n, w, c[(((j | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0, i);
+                j = n;
+                n = (i + 40) | 0;
+                do {
+                  c[i >> 2] = c[j >> 2];
+                  i = (i + 4) | 0;
+                  j = (j + 4) | 0;
+                } while ((i | 0) < (n | 0));
+              }
+              r = (w + 16) | 0;
+              j = c[r >> 2] | 0;
+              i = c[(j + 8) >> 2] | 0;
+              if (!i) n = 0;
+              else n = c[((c[(i + 4) >> 2] | 0) + 16) >> 2] | 0;
+              i = (j + 16) | 0;
+              j = ((c[t >> 2] | 0) + 16) | 0;
+              c[o >> 2] = c[i >> 2];
+              c[(o + 4) >> 2] = c[(i + 4) >> 2];
+              c[(o + 8) >> 2] = c[(i + 8) >> 2];
+              c[(o + 12) >> 2] = c[(i + 12) >> 2];
+              c[u >> 2] = c[j >> 2];
+              c[(u + 4) >> 2] = c[(j + 4) >> 2];
+              c[(u + 8) >> 2] = c[(j + 8) >> 2];
+              c[(u + 12) >> 2] = c[(j + 12) >> 2];
+              hO(q, o, u);
+              c[b >> 2] = c[q >> 2];
+              c[(b + 4) >> 2] = c[(q + 4) >> 2];
+              c[(b + 8) >> 2] = c[(q + 8) >> 2];
+              c[(b + 12) >> 2] = c[(q + 12) >> 2];
+              if (!((g << 24) >> 24)) {
+                i = c[t >> 2] | 0;
+                if (!(a[(i + 45) >> 0] | 0)) i = 0;
+                else {
+                  k = +h[(i + 32) >> 3];
+                  v = 9;
+                }
+              } else {
+                k = +iO(c[((((c[d >> 2] & 3) | 0) == 3 ? d : p) + 40) >> 2] | 0);
+                v = 9;
+              }
+              if ((v | 0) == 9) {
+                h[(b + 16) >> 3] = k;
+                i = 1;
+              }
+              a[(b + 29) >> 0] = i;
+              c[(b + 80) >> 2] = 0;
+              c[(b + 88) >> 2] = d;
+              q = (f + 32) | 0;
+              c[q >> 2] = c[b >> 2];
+              c[(q + 4) >> 2] = c[(b + 4) >> 2];
+              c[(q + 8) >> 2] = c[(b + 8) >> 2];
+              c[(q + 12) >> 2] = c[(b + 12) >> 2];
+              switch (e | 0) {
+                case 1: {
+                  j = c[r >> 2] | 0;
+                  if (
+                    (a[(j + 156) >> 0] | 0) == 0
+                      ? ((q = a[((c[t >> 2] | 0) + 49) >> 0] | 0), (s = q & 255), (q << 24) >> 24 != 0)
+                      : 0
+                  ) {
+                    c[u >> 2] = c[f >> 2];
+                    c[(u + 4) >> 2] = c[(f + 4) >> 2];
+                    c[(u + 8) >> 2] = c[(f + 8) >> 2];
+                    c[(u + 12) >> 2] = c[(f + 12) >> 2];
+                    c[(u + 16) >> 2] = c[(f + 16) >> 2];
+                    c[(u + 20) >> 2] = c[(f + 20) >> 2];
+                    c[(u + 24) >> 2] = c[(f + 24) >> 2];
+                    c[(u + 28) >> 2] = c[(f + 28) >> 2];
+                    do
+                      if (!(s & 4)) {
+                        if ((s & 1) | 0) {
+                          c[(f + 48) >> 2] = 1;
+                          i = (u + 24) | 0;
+                          h[i >> 3] = +h[((+h[i >> 3] > +h[(b + 8) >> 3] ? (u + 16) | 0 : b) + 8) >> 3];
+                          i = (f + 56) | 0;
+                          c[i >> 2] = c[u >> 2];
+                          c[(i + 4) >> 2] = c[(u + 4) >> 2];
+                          c[(i + 8) >> 2] = c[(u + 8) >> 2];
+                          c[(i + 12) >> 2] = c[(u + 12) >> 2];
+                          c[(i + 16) >> 2] = c[(u + 16) >> 2];
+                          c[(i + 20) >> 2] = c[(u + 20) >> 2];
+                          c[(i + 24) >> 2] = c[(u + 24) >> 2];
+                          c[(i + 28) >> 2] = c[(u + 28) >> 2];
+                          i = 1;
+                          break;
+                        }
+                        i = (f + 48) | 0;
+                        if (!(s & 8)) {
+                          c[i >> 2] = 2;
+                          h[u >> 3] = +h[b >> 3];
+                          h[(u + 8) >> 3] = +h[(j + 24) >> 3] - +h[(j + 80) >> 3] * 0.5;
+                          h[(u + 24) >> 3] = +h[(b + 8) >> 3];
+                          i = (f + 56) | 0;
+                          c[i >> 2] = c[u >> 2];
+                          c[(i + 4) >> 2] = c[(u + 4) >> 2];
+                          c[(i + 8) >> 2] = c[(u + 8) >> 2];
+                          c[(i + 12) >> 2] = c[(u + 12) >> 2];
+                          c[(i + 16) >> 2] = c[(u + 16) >> 2];
+                          c[(i + 20) >> 2] = c[(u + 20) >> 2];
+                          c[(i + 24) >> 2] = c[(u + 24) >> 2];
+                          c[(i + 28) >> 2] = c[(u + 28) >> 2];
+                          i = 1;
+                          break;
+                        } else {
+                          c[i >> 2] = 8;
+                          h[(u + 16) >> 3] = +h[b >> 3];
+                          h[(u + 8) >> 3] = +h[(j + 24) >> 3] - +h[(j + 80) >> 3] * 0.5;
+                          h[(u + 24) >> 3] = +h[(b + 8) >> 3];
+                          i = (f + 56) | 0;
+                          c[i >> 2] = c[u >> 2];
+                          c[(i + 4) >> 2] = c[(u + 4) >> 2];
+                          c[(i + 8) >> 2] = c[(u + 8) >> 2];
+                          c[(i + 12) >> 2] = c[(u + 12) >> 2];
+                          c[(i + 16) >> 2] = c[(u + 16) >> 2];
+                          c[(i + 20) >> 2] = c[(u + 20) >> 2];
+                          c[(i + 24) >> 2] = c[(u + 24) >> 2];
+                          c[(i + 28) >> 2] = c[(u + 28) >> 2];
+                          i = 1;
+                          break;
+                        }
+                      } else {
+                        c[(f + 48) >> 2] = 4;
+                        k = +h[u >> 3];
+                        if (+h[b >> 3] < +h[(j + 16) >> 3]) {
+                          z = k + -1.0;
+                          y = +h[(b + 8) >> 3];
+                          b = (u + 16) | 0;
+                          k = +h[b >> 3];
+                          m = +h[(j + 80) >> 3] * 0.5 + +h[(j + 24) >> 3];
+                          m = m + +(((c[((c[((xC(w) | 0) + 16) >> 2] | 0) + 252) >> 2] | 0) / 2) | 0 | 0);
+                          i = c[r >> 2] | 0;
+                          h[b >> 3] = +h[(i + 16) >> 3] - +h[(i + 88) >> 3];
+                          h[(u + 24) >> 3] = y;
+                          h[(u + 8) >> 3] = +h[(i + 24) >> 3] - +h[(i + 80) >> 3] * 0.5;
+                          h[u >> 3] = z;
+                          h[(f + 56) >> 3] = z;
+                          h[(f + 64) >> 3] = y;
+                          h[(f + 72) >> 3] = k;
+                          h[(f + 80) >> 3] = m;
+                          i = (f + 88) | 0;
+                          c[i >> 2] = c[u >> 2];
+                          c[(i + 4) >> 2] = c[(u + 4) >> 2];
+                          c[(i + 8) >> 2] = c[(u + 8) >> 2];
+                          c[(i + 12) >> 2] = c[(u + 12) >> 2];
+                          c[(i + 16) >> 2] = c[(u + 16) >> 2];
+                          c[(i + 20) >> 2] = c[(u + 20) >> 2];
+                          c[(i + 24) >> 2] = c[(u + 24) >> 2];
+                          c[(i + 28) >> 2] = c[(u + 28) >> 2];
+                          i = 2;
+                          break;
+                        } else {
+                          m = +h[(b + 8) >> 3];
+                          i = (u + 16) | 0;
+                          y = +h[i >> 3] + 1.0;
+                          z = +h[(j + 80) >> 3] * 0.5 + +h[(j + 24) >> 3];
+                          z = z + +(((c[((c[((xC(w) | 0) + 16) >> 2] | 0) + 252) >> 2] | 0) / 2) | 0 | 0);
+                          b = c[r >> 2] | 0;
+                          h[u >> 3] = +h[(b + 96) >> 3] + +h[(b + 16) >> 3];
+                          h[(u + 24) >> 3] = m;
+                          h[(u + 8) >> 3] = +h[(b + 24) >> 3] - +h[(b + 80) >> 3] * 0.5;
+                          h[i >> 3] = y;
+                          h[(f + 56) >> 3] = k;
+                          h[(f + 64) >> 3] = m;
+                          h[(f + 72) >> 3] = y;
+                          h[(f + 80) >> 3] = z;
+                          i = (f + 88) | 0;
+                          c[i >> 2] = c[u >> 2];
+                          c[(i + 4) >> 2] = c[(u + 4) >> 2];
+                          c[(i + 8) >> 2] = c[(u + 8) >> 2];
+                          c[(i + 12) >> 2] = c[(u + 12) >> 2];
+                          c[(i + 16) >> 2] = c[(u + 16) >> 2];
+                          c[(i + 20) >> 2] = c[(u + 20) >> 2];
+                          c[(i + 24) >> 2] = c[(u + 24) >> 2];
+                          c[(i + 28) >> 2] = c[(u + 28) >> 2];
+                          i = 2;
+                          break;
+                        }
+                      }
+                    while (0);
+                    c[(f + 52) >> 2] = i;
+                    while (1) {
+                      i = c[(d + 16) >> 2] | 0;
+                      if (!(a[(i + 112) >> 0] | 0)) break;
+                      d = c[(i + 116) >> 2] | 0;
+                    }
+                    a[
+                      (((w | 0) == (c[((((c[d >> 2] & 3) | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0)
+                        ? (i + 16) | 0
+                        : (i + 56) | 0) +
+                        30) >>
+                        0
+                    ] = 0;
+                  } else {
+                    j = 1;
+                    v = 47;
+                  }
+                  break;
+                }
+                case 2: {
+                  s = a[((c[t >> 2] | 0) + 49) >> 0] | 0;
+                  j = s & 255;
+                  if (!((s << 24) >> 24)) v = 46;
+                  else {
+                    c[u >> 2] = c[f >> 2];
+                    c[(u + 4) >> 2] = c[(f + 4) >> 2];
+                    c[(u + 8) >> 2] = c[(f + 8) >> 2];
+                    c[(u + 12) >> 2] = c[(f + 12) >> 2];
+                    c[(u + 16) >> 2] = c[(f + 16) >> 2];
+                    c[(u + 20) >> 2] = c[(f + 20) >> 2];
+                    c[(u + 24) >> 2] = c[(f + 24) >> 2];
+                    c[(u + 28) >> 2] = c[(f + 28) >> 2];
+                    do
+                      if (!(j & 4)) {
+                        if ((j & 1) | 0)
+                          if ((c[(f + 48) >> 2] | 0) == 4) {
+                            i = c[r >> 2] | 0;
+                            z = +h[(i + 24) >> 3] - +h[(i + 80) >> 3] * 0.5;
+                            i = (u + 16) | 0;
+                            y = +h[i >> 3] + 1.0;
+                            k = +h[b >> 3];
+                            m = z - +(((c[((c[((xC(w) | 0) + 16) >> 2] | 0) + 252) >> 2] | 0) / 2) | 0 | 0);
+                            b = c[r >> 2] | 0;
+                            h[u >> 3] = +h[(b + 96) >> 3] + +h[(b + 16) >> 3];
+                            h[(u + 8) >> 3] = z;
+                            h[(u + 24) >> 3] = +h[(b + 80) >> 3] * 0.5 + +h[(b + 24) >> 3];
+                            h[i >> 3] = y;
+                            h[(f + 56) >> 3] = k;
+                            h[(f + 64) >> 3] = m;
+                            h[(f + 72) >> 3] = y;
+                            h[(f + 80) >> 3] = z;
+                            i = (f + 88) | 0;
+                            c[i >> 2] = c[u >> 2];
+                            c[(i + 4) >> 2] = c[(u + 4) >> 2];
+                            c[(i + 8) >> 2] = c[(u + 8) >> 2];
+                            c[(i + 12) >> 2] = c[(u + 12) >> 2];
+                            c[(i + 16) >> 2] = c[(u + 16) >> 2];
+                            c[(i + 20) >> 2] = c[(u + 20) >> 2];
+                            c[(i + 24) >> 2] = c[(u + 24) >> 2];
+                            c[(i + 28) >> 2] = c[(u + 28) >> 2];
+                            i = 2;
+                            break;
+                          } else {
+                            i = (u + 24) | 0;
+                            h[i >> 3] = +h[((+h[i >> 3] > +h[(b + 8) >> 3] ? (u + 16) | 0 : b) + 8) >> 3];
+                            i = (f + 56) | 0;
+                            c[i >> 2] = c[u >> 2];
+                            c[(i + 4) >> 2] = c[(u + 4) >> 2];
+                            c[(i + 8) >> 2] = c[(u + 8) >> 2];
+                            c[(i + 12) >> 2] = c[(u + 12) >> 2];
+                            c[(i + 16) >> 2] = c[(u + 16) >> 2];
+                            c[(i + 20) >> 2] = c[(u + 20) >> 2];
+                            c[(i + 24) >> 2] = c[(u + 24) >> 2];
+                            c[(i + 28) >> 2] = c[(u + 28) >> 2];
+                            i = 1;
+                            break;
+                          }
+                        k = +h[b >> 3];
+                        if (!(j & 8)) {
+                          h[u >> 3] = k;
+                          e = c[r >> 2] | 0;
+                          k = +h[(e + 24) >> 3];
+                          m = +h[(e + 80) >> 3] * 0.5;
+                          if ((c[(f + 48) >> 2] | 0) == 4) {
+                            h[(u + 24) >> 3] = m + k;
+                            k = +h[(b + 8) >> 3];
+                            i = u;
+                          } else {
+                            h[(u + 8) >> 3] = k - m;
+                            k = +h[(b + 8) >> 3] + 1.0;
+                            i = (u + 16) | 0;
+                          }
+                          h[(i + 8) >> 3] = k;
+                          i = (f + 56) | 0;
+                          c[i >> 2] = c[u >> 2];
+                          c[(i + 4) >> 2] = c[(u + 4) >> 2];
+                          c[(i + 8) >> 2] = c[(u + 8) >> 2];
+                          c[(i + 12) >> 2] = c[(u + 12) >> 2];
+                          c[(i + 16) >> 2] = c[(u + 16) >> 2];
+                          c[(i + 20) >> 2] = c[(u + 20) >> 2];
+                          c[(i + 24) >> 2] = c[(u + 24) >> 2];
+                          c[(i + 28) >> 2] = c[(u + 28) >> 2];
+                          i = 1;
+                          break;
+                        } else {
+                          i = (u + 16) | 0;
+                          h[i >> 3] = k + 1.0;
+                          e = c[r >> 2] | 0;
+                          k = +h[(e + 24) >> 3];
+                          m = +h[(e + 80) >> 3] * 0.5;
+                          if ((c[(f + 48) >> 2] | 0) == 4) {
+                            h[(u + 24) >> 3] = m + k;
+                            k = +h[(b + 8) >> 3] + -1.0;
+                            i = u;
+                          } else {
+                            h[(u + 8) >> 3] = k - m;
+                            k = +h[(b + 8) >> 3] + 1.0;
+                          }
+                          h[(i + 8) >> 3] = k;
+                          i = (f + 56) | 0;
+                          c[i >> 2] = c[u >> 2];
+                          c[(i + 4) >> 2] = c[(u + 4) >> 2];
+                          c[(i + 8) >> 2] = c[(u + 8) >> 2];
+                          c[(i + 12) >> 2] = c[(u + 12) >> 2];
+                          c[(i + 16) >> 2] = c[(u + 16) >> 2];
+                          c[(i + 20) >> 2] = c[(u + 20) >> 2];
+                          c[(i + 24) >> 2] = c[(u + 24) >> 2];
+                          c[(i + 28) >> 2] = c[(u + 28) >> 2];
+                          i = 1;
+                          break;
+                        }
+                      } else {
+                        i = (u + 8) | 0;
+                        h[i >> 3] = +h[((+h[i >> 3] < +h[(b + 8) >> 3] ? u : b) + 8) >> 3];
+                        i = (f + 56) | 0;
+                        c[i >> 2] = c[u >> 2];
+                        c[(i + 4) >> 2] = c[(u + 4) >> 2];
+                        c[(i + 8) >> 2] = c[(u + 8) >> 2];
+                        c[(i + 12) >> 2] = c[(u + 12) >> 2];
+                        c[(i + 16) >> 2] = c[(u + 16) >> 2];
+                        c[(i + 20) >> 2] = c[(u + 20) >> 2];
+                        c[(i + 24) >> 2] = c[(u + 24) >> 2];
+                        c[(i + 28) >> 2] = c[(u + 28) >> 2];
+                        i = 1;
+                      }
+                    while (0);
+                    c[(f + 52) >> 2] = i;
+                    while (1) {
+                      i = c[(d + 16) >> 2] | 0;
+                      if (!(a[(i + 112) >> 0] | 0)) break;
+                      d = c[(i + 116) >> 2] | 0;
+                    }
+                    a[
+                      (((w | 0) == (c[((((c[d >> 2] & 3) | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0)
+                        ? (i + 16) | 0
+                        : (i + 56) | 0) +
+                        30) >>
+                        0
+                    ] = 0;
+                    c[(f + 48) >> 2] = j;
+                  }
+                  break;
+                }
+                default:
+                  v = 46;
+              }
+              if ((v | 0) == 46) {
+                j = c[(f + 48) >> 2] | 0;
+                v = 47;
+              }
+              a: do
+                if ((v | 0) == 47) {
+                  if (n) {
+                    d = (f + 56) | 0;
+                    i = (f + 52) | 0;
+                    j = pb[n & 127](w, ((c[t >> 2] | 0) + 16) | 0, j, d, i) | 0;
+                    if (j) {
+                      c[(f + 48) >> 2] = j;
+                      break;
+                    }
+                  } else {
+                    i = (f + 52) | 0;
+                    d = (f + 56) | 0;
+                  }
+                  c[d >> 2] = c[f >> 2];
+                  c[(d + 4) >> 2] = c[(f + 4) >> 2];
+                  c[(d + 8) >> 2] = c[(f + 8) >> 2];
+                  c[(d + 12) >> 2] = c[(f + 12) >> 2];
+                  c[(d + 16) >> 2] = c[(f + 16) >> 2];
+                  c[(d + 20) >> 2] = c[(f + 20) >> 2];
+                  c[(d + 24) >> 2] = c[(f + 24) >> 2];
+                  c[(d + 28) >> 2] = c[(f + 28) >> 2];
+                  c[i >> 2] = 1;
+                  switch (e | 0) {
+                    case 8: {
+                      qa(138394, 106514, 569, 106524);
+                      break;
+                    }
+                    case 2: {
+                      h[(((c[(f + 48) >> 2] | 0) == 4 ? (f + 56) | 0 : (f + 72) | 0) + 8) >> 3] = +h[(b + 8) >> 3];
+                      break a;
+                    }
+                    case 1: {
+                      h[(f + 80) >> 3] = +h[(b + 8) >> 3];
+                      c[(f + 48) >> 2] = 1;
+                      break a;
+                    }
+                    default:
+                      break a;
+                  }
+                }
+              while (0);
+              l = x;
+              return;
+            }
+            function hO(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0;
+              d = +h[(c + 8) >> 3] + +h[(b + 8) >> 3];
+              h[a >> 3] = +h[c >> 3] + +h[b >> 3];
+              h[(a + 8) >> 3] = d;
+              return;
+            }
+            function iO(a) {
+              a = a | 0;
+              var b = 0.0,
+                d = 0,
+                e = 0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0.0,
+                l = 0.0;
+              i = c[(a + 16) >> 2] | 0;
+              j = c[(i + 172) >> 2] | 0;
+              f = 0.0;
+              g = 0;
+              while (1) {
+                a = c[(j + (g << 2)) >> 2] | 0;
+                if (!a) break;
+                f =
+                  +h[
+                    ((c[((c[((((c[a >> 2] & 3) | 0) == 3 ? a : (a + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 16) >>
+                      3
+                  ] + f;
+                g = (g + 1) | 0;
+              }
+              e = c[(i + 180) >> 2] | 0;
+              b = 0.0;
+              a = 0;
+              while (1) {
+                d = c[(e + (a << 2)) >> 2] | 0;
+                if (!d) break;
+                b =
+                  +h[
+                    ((c[((c[((((c[d >> 2] & 3) | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 16) >>
+                      3
+                  ] + b;
+                a = (a + 1) | 0;
+              }
+              k = +h[(i + 16) >> 3];
+              l = +h[(i + 24) >> 3];
+              j = c[j >> 2] | 0;
+              f = +K(
+                +(
+                  l -
+                  +h[
+                    ((c[((c[((((c[j >> 2] & 3) | 0) == 3 ? j : (j + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 24) >>
+                      3
+                  ]
+                ),
+                +(k - f / +(g | 0))
+              );
+              j = c[e >> 2] | 0;
+              return +(
+                (+K(
+                  +(
+                    +h[
+                      ((c[((c[((((c[j >> 2] & 3) | 0) == 2 ? j : (j + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                        24) >>
+                        3
+                    ] - l
+                  ),
+                  +(b / +(a | 0) - k)
+                ) +
+                  f) *
+                0.5
+              );
+            }
+            function jO(b, d, e, f, g) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0.0,
+                m = 0.0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0.0,
+                B = 0.0;
+              z = l;
+              l = (l + 112) | 0;
+              w = (z + 72) | 0;
+              p = (z + 56) | 0;
+              n = (z + 16) | 0;
+              t = z;
+              j = c[d >> 2] & 3;
+              r = (d + -48) | 0;
+              y = c[(((j | 0) == 2 ? d : r) + 40) >> 2] | 0;
+              u = (d + 16) | 0;
+              s = c[u >> 2] | 0;
+              i = (s + 56) | 0;
+              if (a[(s + 87) >> 0] | 0) {
+                WN(n, y, c[(((j | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0, i);
+                j = n;
+                n = (i + 40) | 0;
+                do {
+                  c[i >> 2] = c[j >> 2];
+                  i = (i + 4) | 0;
+                  j = (j + 4) | 0;
+                } while ((i | 0) < (n | 0));
+              }
+              s = (y + 16) | 0;
+              j = c[s >> 2] | 0;
+              i = c[(j + 8) >> 2] | 0;
+              if (!i) o = 0;
+              else o = c[((c[(i + 4) >> 2] | 0) + 16) >> 2] | 0;
+              n = (b + 40) | 0;
+              i = (j + 16) | 0;
+              j = ((c[u >> 2] | 0) + 56) | 0;
+              c[p >> 2] = c[i >> 2];
+              c[(p + 4) >> 2] = c[(i + 4) >> 2];
+              c[(p + 8) >> 2] = c[(i + 8) >> 2];
+              c[(p + 12) >> 2] = c[(i + 12) >> 2];
+              c[w >> 2] = c[j >> 2];
+              c[(w + 4) >> 2] = c[(j + 4) >> 2];
+              c[(w + 8) >> 2] = c[(j + 8) >> 2];
+              c[(w + 12) >> 2] = c[(j + 12) >> 2];
+              hO(t, p, w);
+              c[n >> 2] = c[t >> 2];
+              c[(n + 4) >> 2] = c[(t + 4) >> 2];
+              c[(n + 8) >> 2] = c[(t + 8) >> 2];
+              c[(n + 12) >> 2] = c[(t + 12) >> 2];
+              if (!((g << 24) >> 24)) {
+                i = c[u >> 2] | 0;
+                if (!(a[(i + 85) >> 0] | 0)) q = 0;
+                else {
+                  h[(b + 56) >> 3] = +h[(i + 72) >> 3];
+                  q = 1;
+                }
+              } else {
+                m = +iO(c[((((c[d >> 2] & 3) | 0) == 2 ? d : r) + 40) >> 2] | 0) + 3.141592653589793;
+                h[(b + 56) >> 3] = m;
+                if (m < 6.283185307179586) q = 1;
+                else qa(106534, 106514, 606, 106558);
+              }
+              a[(b + 69) >> 0] = q;
+              t = (f + 32) | 0;
+              c[t >> 2] = c[n >> 2];
+              c[(t + 4) >> 2] = c[(n + 4) >> 2];
+              c[(t + 8) >> 2] = c[(n + 8) >> 2];
+              c[(t + 12) >> 2] = c[(n + 12) >> 2];
+              switch (e | 0) {
+                case 1: {
+                  j = c[s >> 2] | 0;
+                  if (
+                    (a[(j + 156) >> 0] | 0) == 0
+                      ? ((t = a[((c[u >> 2] | 0) + 89) >> 0] | 0), (v = t & 255), (t << 24) >> 24 != 0)
+                      : 0
+                  ) {
+                    c[w >> 2] = c[f >> 2];
+                    c[(w + 4) >> 2] = c[(f + 4) >> 2];
+                    c[(w + 8) >> 2] = c[(f + 8) >> 2];
+                    c[(w + 12) >> 2] = c[(f + 12) >> 2];
+                    c[(w + 16) >> 2] = c[(f + 16) >> 2];
+                    c[(w + 20) >> 2] = c[(f + 20) >> 2];
+                    c[(w + 24) >> 2] = c[(f + 24) >> 2];
+                    c[(w + 28) >> 2] = c[(f + 28) >> 2];
+                    do
+                      if (!(v & 4))
+                        if (!(v & 1)) {
+                          i = (f + 48) | 0;
+                          if (!(v & 8)) {
+                            c[i >> 2] = 2;
+                            h[w >> 3] = +h[n >> 3];
+                            h[(w + 24) >> 3] = +h[(j + 80) >> 3] * 0.5 + +h[(j + 24) >> 3];
+                            h[(w + 8) >> 3] = +h[(b + 48) >> 3];
+                            i = (f + 56) | 0;
+                            c[i >> 2] = c[w >> 2];
+                            c[(i + 4) >> 2] = c[(w + 4) >> 2];
+                            c[(i + 8) >> 2] = c[(w + 8) >> 2];
+                            c[(i + 12) >> 2] = c[(w + 12) >> 2];
+                            c[(i + 16) >> 2] = c[(w + 16) >> 2];
+                            c[(i + 20) >> 2] = c[(w + 20) >> 2];
+                            c[(i + 24) >> 2] = c[(w + 24) >> 2];
+                            c[(i + 28) >> 2] = c[(w + 28) >> 2];
+                            i = 1;
+                            break;
+                          } else {
+                            c[i >> 2] = 8;
+                            h[(w + 16) >> 3] = +h[n >> 3];
+                            h[(w + 24) >> 3] = +h[(j + 80) >> 3] * 0.5 + +h[(j + 24) >> 3];
+                            h[(w + 8) >> 3] = +h[(b + 48) >> 3];
+                            i = (f + 56) | 0;
+                            c[i >> 2] = c[w >> 2];
+                            c[(i + 4) >> 2] = c[(w + 4) >> 2];
+                            c[(i + 8) >> 2] = c[(w + 8) >> 2];
+                            c[(i + 12) >> 2] = c[(w + 12) >> 2];
+                            c[(i + 16) >> 2] = c[(w + 16) >> 2];
+                            c[(i + 20) >> 2] = c[(w + 20) >> 2];
+                            c[(i + 24) >> 2] = c[(w + 24) >> 2];
+                            c[(i + 28) >> 2] = c[(w + 28) >> 2];
+                            i = 1;
+                            break;
+                          }
+                        } else {
+                          c[(f + 48) >> 2] = 1;
+                          k = +h[w >> 3];
+                          if (+h[n >> 3] < +h[(j + 16) >> 3]) {
+                            B = k + -1.0;
+                            m = +h[(b + 48) >> 3];
+                            b = (w + 16) | 0;
+                            k = +h[b >> 3];
+                            A = +h[(j + 80) >> 3] * -0.5 + +h[(j + 24) >> 3];
+                            A = A - +(((c[((c[((xC(y) | 0) + 16) >> 2] | 0) + 252) >> 2] | 0) / 2) | 0 | 0);
+                            i = c[s >> 2] | 0;
+                            h[b >> 3] = +h[(i + 16) >> 3] - +h[(i + 88) >> 3];
+                            h[(w + 8) >> 3] = m;
+                            h[(w + 24) >> 3] = +h[(i + 80) >> 3] * 0.5 + +h[(i + 24) >> 3];
+                            h[w >> 3] = B;
+                            h[(f + 56) >> 3] = B;
+                            h[(f + 64) >> 3] = A;
+                            h[(f + 72) >> 3] = k;
+                            h[(f + 80) >> 3] = m;
+                            i = (f + 88) | 0;
+                            c[i >> 2] = c[w >> 2];
+                            c[(i + 4) >> 2] = c[(w + 4) >> 2];
+                            c[(i + 8) >> 2] = c[(w + 8) >> 2];
+                            c[(i + 12) >> 2] = c[(w + 12) >> 2];
+                            c[(i + 16) >> 2] = c[(w + 16) >> 2];
+                            c[(i + 20) >> 2] = c[(w + 20) >> 2];
+                            c[(i + 24) >> 2] = c[(w + 24) >> 2];
+                            c[(i + 28) >> 2] = c[(w + 28) >> 2];
+                            i = 2;
+                            break;
+                          } else {
+                            B = +h[(b + 48) >> 3];
+                            i = (w + 16) | 0;
+                            A = +h[i >> 3] + 1.0;
+                            m = +h[(j + 80) >> 3] * -0.5 + +h[(j + 24) >> 3];
+                            m = m - +(((c[((c[((xC(y) | 0) + 16) >> 2] | 0) + 252) >> 2] | 0) / 2) | 0 | 0);
+                            b = c[s >> 2] | 0;
+                            h[w >> 3] = +h[(b + 96) >> 3] + +h[(b + 16) >> 3];
+                            h[(w + 8) >> 3] = B;
+                            h[(w + 24) >> 3] = +h[(b + 80) >> 3] * 0.5 + +h[(b + 24) >> 3];
+                            h[i >> 3] = A;
+                            h[(f + 56) >> 3] = k;
+                            h[(f + 64) >> 3] = m;
+                            h[(f + 72) >> 3] = A;
+                            h[(f + 80) >> 3] = B;
+                            i = (f + 88) | 0;
+                            c[i >> 2] = c[w >> 2];
+                            c[(i + 4) >> 2] = c[(w + 4) >> 2];
+                            c[(i + 8) >> 2] = c[(w + 8) >> 2];
+                            c[(i + 12) >> 2] = c[(w + 12) >> 2];
+                            c[(i + 16) >> 2] = c[(w + 16) >> 2];
+                            c[(i + 20) >> 2] = c[(w + 20) >> 2];
+                            c[(i + 24) >> 2] = c[(w + 24) >> 2];
+                            c[(i + 28) >> 2] = c[(w + 28) >> 2];
+                            i = 2;
+                            break;
+                          }
+                        }
+                      else {
+                        c[(f + 48) >> 2] = 4;
+                        i = (w + 8) | 0;
+                        h[i >> 3] = +h[((+h[i >> 3] < +h[(b + 48) >> 3] ? w : n) + 8) >> 3];
+                        i = (f + 56) | 0;
+                        c[i >> 2] = c[w >> 2];
+                        c[(i + 4) >> 2] = c[(w + 4) >> 2];
+                        c[(i + 8) >> 2] = c[(w + 8) >> 2];
+                        c[(i + 12) >> 2] = c[(w + 12) >> 2];
+                        c[(i + 16) >> 2] = c[(w + 16) >> 2];
+                        c[(i + 20) >> 2] = c[(w + 20) >> 2];
+                        c[(i + 24) >> 2] = c[(w + 24) >> 2];
+                        c[(i + 28) >> 2] = c[(w + 28) >> 2];
+                        i = 1;
+                      }
+                    while (0);
+                    c[(f + 52) >> 2] = i;
+                    while (1) {
+                      i = c[(d + 16) >> 2] | 0;
+                      if (!(a[(i + 112) >> 0] | 0)) break;
+                      d = c[(i + 116) >> 2] | 0;
+                    }
+                    a[
+                      (((y | 0) == (c[((((c[d >> 2] & 3) | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0)
+                        ? (i + 56) | 0
+                        : (i + 16) | 0) +
+                        30) >>
+                        0
+                    ] = 0;
+                    c[(f + 48) >> 2] = v;
+                  } else {
+                    j = 4;
+                    x = 47;
+                  }
+                  break;
+                }
+                case 2: {
+                  v = a[((c[u >> 2] | 0) + 89) >> 0] | 0;
+                  j = v & 255;
+                  if (!((v << 24) >> 24)) x = 46;
+                  else {
+                    c[w >> 2] = c[f >> 2];
+                    c[(w + 4) >> 2] = c[(f + 4) >> 2];
+                    c[(w + 8) >> 2] = c[(f + 8) >> 2];
+                    c[(w + 12) >> 2] = c[(f + 12) >> 2];
+                    c[(w + 16) >> 2] = c[(f + 16) >> 2];
+                    c[(w + 20) >> 2] = c[(f + 20) >> 2];
+                    c[(w + 24) >> 2] = c[(f + 24) >> 2];
+                    c[(w + 28) >> 2] = c[(f + 28) >> 2];
+                    do
+                      if (!(j & 4)) {
+                        if ((j & 1) | 0)
+                          if ((c[(f + 48) >> 2] | 0) == 4) {
+                            k = +h[w >> 3] + -1.0;
+                            i = c[s >> 2] | 0;
+                            B = +h[(i + 24) >> 3] - +h[(i + 80) >> 3] * 0.5;
+                            A = +h[n >> 3];
+                            m = B - +(((c[((c[((xC(y) | 0) + 16) >> 2] | 0) + 252) >> 2] | 0) / 2) | 0 | 0);
+                            i = c[s >> 2] | 0;
+                            h[(w + 16) >> 3] = +h[(i + 16) >> 3] + -2.0 - +h[(i + 88) >> 3];
+                            h[(w + 8) >> 3] = B;
+                            h[(w + 24) >> 3] = +h[(i + 80) >> 3] * 0.5 + +h[(i + 24) >> 3];
+                            h[w >> 3] = k;
+                            h[(f + 56) >> 3] = k;
+                            h[(f + 64) >> 3] = m;
+                            h[(f + 72) >> 3] = A;
+                            h[(f + 80) >> 3] = B;
+                            i = (f + 88) | 0;
+                            c[i >> 2] = c[w >> 2];
+                            c[(i + 4) >> 2] = c[(w + 4) >> 2];
+                            c[(i + 8) >> 2] = c[(w + 8) >> 2];
+                            c[(i + 12) >> 2] = c[(w + 12) >> 2];
+                            c[(i + 16) >> 2] = c[(w + 16) >> 2];
+                            c[(i + 20) >> 2] = c[(w + 20) >> 2];
+                            c[(i + 24) >> 2] = c[(w + 24) >> 2];
+                            c[(i + 28) >> 2] = c[(w + 28) >> 2];
+                            i = 2;
+                            break;
+                          } else {
+                            i = (w + 24) | 0;
+                            h[i >> 3] = +h[((+h[i >> 3] > +h[(b + 8) >> 3] ? (w + 16) | 0 : b) + 8) >> 3];
+                            i = (f + 56) | 0;
+                            c[i >> 2] = c[w >> 2];
+                            c[(i + 4) >> 2] = c[(w + 4) >> 2];
+                            c[(i + 8) >> 2] = c[(w + 8) >> 2];
+                            c[(i + 12) >> 2] = c[(w + 12) >> 2];
+                            c[(i + 16) >> 2] = c[(w + 16) >> 2];
+                            c[(i + 20) >> 2] = c[(w + 20) >> 2];
+                            c[(i + 24) >> 2] = c[(w + 24) >> 2];
+                            c[(i + 28) >> 2] = c[(w + 28) >> 2];
+                            i = 1;
+                            break;
+                          }
+                        k = +h[n >> 3];
+                        if (!(j & 8)) {
+                          h[w >> 3] = k + -1.0;
+                          e = c[s >> 2] | 0;
+                          k = +h[(e + 24) >> 3];
+                          m = +h[(e + 80) >> 3] * 0.5;
+                          if ((c[(f + 48) >> 2] | 0) == 4) {
+                            h[(w + 24) >> 3] = m + k;
+                            k = +h[(b + 48) >> 3] + -1.0;
+                            i = w;
+                          } else {
+                            h[(w + 8) >> 3] = k - m;
+                            k = +h[(b + 48) >> 3];
+                            i = (w + 16) | 0;
+                          }
+                          h[(i + 8) >> 3] = k;
+                          i = (f + 56) | 0;
+                          c[i >> 2] = c[w >> 2];
+                          c[(i + 4) >> 2] = c[(w + 4) >> 2];
+                          c[(i + 8) >> 2] = c[(w + 8) >> 2];
+                          c[(i + 12) >> 2] = c[(w + 12) >> 2];
+                          c[(i + 16) >> 2] = c[(w + 16) >> 2];
+                          c[(i + 20) >> 2] = c[(w + 20) >> 2];
+                          c[(i + 24) >> 2] = c[(w + 24) >> 2];
+                          c[(i + 28) >> 2] = c[(w + 28) >> 2];
+                          i = 1;
+                          break;
+                        } else {
+                          i = (w + 16) | 0;
+                          h[i >> 3] = k + 1.0;
+                          e = c[s >> 2] | 0;
+                          k = +h[(e + 24) >> 3];
+                          m = +h[(e + 80) >> 3] * 0.5;
+                          if ((c[(f + 48) >> 2] | 0) == 4) {
+                            h[(w + 24) >> 3] = m + k;
+                            k = +h[(b + 48) >> 3] + -1.0;
+                            i = w;
+                          } else {
+                            h[(w + 8) >> 3] = k - m;
+                            k = +h[(b + 48) >> 3] + 1.0;
+                          }
+                          h[(i + 8) >> 3] = k;
+                          i = (f + 56) | 0;
+                          c[i >> 2] = c[w >> 2];
+                          c[(i + 4) >> 2] = c[(w + 4) >> 2];
+                          c[(i + 8) >> 2] = c[(w + 8) >> 2];
+                          c[(i + 12) >> 2] = c[(w + 12) >> 2];
+                          c[(i + 16) >> 2] = c[(w + 16) >> 2];
+                          c[(i + 20) >> 2] = c[(w + 20) >> 2];
+                          c[(i + 24) >> 2] = c[(w + 24) >> 2];
+                          c[(i + 28) >> 2] = c[(w + 28) >> 2];
+                          i = 1;
+                          break;
+                        }
+                      } else {
+                        i = (w + 8) | 0;
+                        h[i >> 3] = +h[((+h[i >> 3] < +h[(b + 48) >> 3] ? w : n) + 8) >> 3];
+                        i = (f + 56) | 0;
+                        c[i >> 2] = c[w >> 2];
+                        c[(i + 4) >> 2] = c[(w + 4) >> 2];
+                        c[(i + 8) >> 2] = c[(w + 8) >> 2];
+                        c[(i + 12) >> 2] = c[(w + 12) >> 2];
+                        c[(i + 16) >> 2] = c[(w + 16) >> 2];
+                        c[(i + 20) >> 2] = c[(w + 20) >> 2];
+                        c[(i + 24) >> 2] = c[(w + 24) >> 2];
+                        c[(i + 28) >> 2] = c[(w + 28) >> 2];
+                        i = 1;
+                      }
+                    while (0);
+                    c[(f + 52) >> 2] = i;
+                    while (1) {
+                      i = c[(d + 16) >> 2] | 0;
+                      if (!(a[(i + 112) >> 0] | 0)) break;
+                      d = c[(i + 116) >> 2] | 0;
+                    }
+                    a[
+                      (((y | 0) == (c[((((c[d >> 2] & 3) | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0)
+                        ? (i + 56) | 0
+                        : (i + 16) | 0) +
+                        30) >>
+                        0
+                    ] = 0;
+                    c[(f + 48) >> 2] = j;
+                  }
+                  break;
+                }
+                default:
+                  x = 46;
+              }
+              if ((x | 0) == 46) {
+                j = c[(f + 48) >> 2] | 0;
+                x = 47;
+              }
+              a: do
+                if ((x | 0) == 47) {
+                  if (o) {
+                    d = (f + 56) | 0;
+                    i = (f + 52) | 0;
+                    j = pb[o & 127](y, ((c[u >> 2] | 0) + 56) | 0, j, d, i) | 0;
+                    if (j) {
+                      c[(f + 48) >> 2] = j;
+                      break;
+                    }
+                  } else {
+                    i = (f + 52) | 0;
+                    d = (f + 56) | 0;
+                  }
+                  c[d >> 2] = c[f >> 2];
+                  c[(d + 4) >> 2] = c[(f + 4) >> 2];
+                  c[(d + 8) >> 2] = c[(f + 8) >> 2];
+                  c[(d + 12) >> 2] = c[(f + 12) >> 2];
+                  c[(d + 16) >> 2] = c[(f + 16) >> 2];
+                  c[(d + 20) >> 2] = c[(f + 20) >> 2];
+                  c[(d + 24) >> 2] = c[(f + 24) >> 2];
+                  c[(d + 28) >> 2] = c[(f + 28) >> 2];
+                  c[i >> 2] = 1;
+                  switch (e | 0) {
+                    case 8: {
+                      qa(138394, 106514, 765, 106558);
+                      break;
+                    }
+                    case 2: {
+                      h[(((c[(f + 48) >> 2] | 0) == 4 ? (f + 56) | 0 : (f + 72) | 0) + 8) >> 3] = +h[(b + 48) >> 3];
+                      break a;
+                    }
+                    case 1: {
+                      h[(f + 64) >> 3] = +h[(b + 48) >> 3];
+                      c[(f + 48) >> 2] = 4;
+                      break a;
+                    }
+                    default:
+                      break a;
+                  }
+                }
+              while (0);
+              l = z;
+              return;
+            }
+            function kO(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0;
+              g = c[(b + 16) >> 2] | 0;
+              i = c[(g + 96) >> 2] | 0;
+              if ((a[(g + 44) >> 0] | 0) == 0 ? (a[(g + 84) >> 0] | 0) == 0 : 0) j = 6;
+              else {
+                d = a[(g + 49) >> 0] | 0;
+                e = d & 255;
+                if (
+                  (((e & 8) | 0) == 0 ? ((f = a[(g + 89) >> 0] | 0), (f & 8) == 0) : 0)
+                    ? ((e & 5) | 0) == 0
+                      ? 1
+                      : (d << 24) >> 24 != (f << 24) >> 24
+                    : 0
+                )
+                  j = 6;
+                else b = 0;
+              }
+              if ((j | 0) == 6)
+                if (!i) b = 18;
+                else {
+                  b =
+                    ((c[
+                      ((c[((xC(c[((((c[b >> 2] & 3) | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0) | 0) + 16) >> 2] |
+                        0) +
+                        116) >>
+                        2
+                    ] &
+                      1) |
+                      0) !=
+                    0;
+                  b = ~~(+h[(b ? (i + 32) | 0 : (i + 24) | 0) >> 3] + 18.0);
+                }
+              return b | 0;
+            }
+            function lO(b, d, e, f, g, h, i) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = +g;
+              h = +h;
+              i = i | 0;
+              var j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              b = c[((c[(d + (e << 2)) >> 2] | 0) + 16) >> 2] | 0;
+              if ((a[(b + 44) >> 0] | 0) == 0 ? (a[(b + 84) >> 0] | 0) == 0 : 0) l = 6;
+              else l = 3;
+              do
+                if ((l | 0) == 3) {
+                  j = a[(b + 49) >> 0] | 0;
+                  k = j & 255;
+                  if (!(k & 8)) {
+                    m = a[(b + 89) >> 0] | 0;
+                    if ((m & 8) == 0 ? (((k & 5) | 0) == 0 ? 1 : (j << 24) >> 24 != (m << 24) >> 24) : 0) {
+                      l = 6;
+                      break;
+                    }
+                    if (!(a[(b + 89) >> 0] & 8)) {
+                      if ((k & 4) | 0) {
+                        nO(d, e, f, g, h, i);
+                        break;
+                      }
+                      if (!(k & 1)) qa(138394, 106514, 1231, 106566);
+                      else {
+                        pO(d, e, f, g, h, i);
+                        break;
+                      }
+                    }
+                  }
+                  if ((j & 2) == 0 ? (a[(b + 89) >> 0] & 2) == 0 : 0) {
+                    oO(d, e, f, g, h, i);
+                    break;
+                  }
+                  nO(d, e, f, g, h, i);
+                }
+              while (0);
+              if ((l | 0) == 6) mO(d, e, f, g, h, i);
+              return;
+            }
+            function mO(b, e, f, g, i, j) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = +g;
+              i = +i;
+              j = j | 0;
+              var k = 0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0.0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0.0,
+                A = 0,
+                B = 0,
+                C = 0.0,
+                D = 0,
+                E = 0.0,
+                F = 0.0,
+                G = 0.0,
+                H = 0.0,
+                I = 0.0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                O = 0,
+                P = 0,
+                Q = 0.0,
+                R = 0.0,
+                S = 0;
+              P = l;
+              l = (l + 16080) | 0;
+              L = (P + 80) | 0;
+              M = (P + 64) | 0;
+              N = (P + 48) | 0;
+              O = (P + 32) | 0;
+              J = (P + 16) | 0;
+              K = P;
+              B = c[(b + (e << 2)) >> 2] | 0;
+              n = (i * 0.5) / +(f | 0);
+              n = n > 2.0 ? n : 2.0;
+              D = ((c[((((c[B >> 2] & 3) | 0) == 3 ? B : (B + 48) | 0) + 40) >> 2] | 0) + 16) | 0;
+              A = c[D >> 2] | 0;
+              C = +h[(A + 16) >> 3];
+              H = +h[(A + 24) >> 3];
+              B = c[(B + 16) >> 2] | 0;
+              m = +h[(B + 16) >> 3];
+              E = m + C;
+              F = +h[(B + 24) >> 3] + H;
+              i = +h[(B + 56) >> 3];
+              G = i + C;
+              H = +h[(B + 64) >> 3] + H;
+              k = !(F >= H) ? -1 : 1;
+              p = +h[(A + 96) >> 3];
+              switch (qO(d[(B + 49) >> 0] | 0, d[(B + 89) >> 0] | 0) | 0) {
+                case 65:
+                case 32: {
+                  if (F == H) k = (0 - k) | 0;
+                  break;
+                }
+                default: {
+                }
+              }
+              Q = (p - m) * 3.0;
+              m = (p - i) * 3.0;
+              v = n * +(k | 0);
+              u = (L + 8) | 0;
+              w = (L + 16) | 0;
+              x = (L + 32) | 0;
+              y = (L + 48) | 0;
+              z = (H + F) * 0.5;
+              A = (L + 64) | 0;
+              B = (L + 80) | 0;
+              s = (L + 96) | 0;
+              t = (L + 104) | 0;
+              r = 0;
+              o = 0.0;
+              i = p;
+              n = p < Q ? p : Q;
+              m = p < m ? p : m;
+              while (1) {
+                if ((r | 0) >= (f | 0)) break;
+                q = (e + 1) | 0;
+                e = c[(b + (e << 2)) >> 2] | 0;
+                p = i + g;
+                n = n + g;
+                m = m + g;
+                o = o + v;
+                h[L >> 3] = E;
+                h[u >> 3] = F;
+                Q = o + F;
+                rO(M, n * 0.3333333333333333 + E, Q);
+                c[w >> 2] = c[M >> 2];
+                c[(w + 4) >> 2] = c[(M + 4) >> 2];
+                c[(w + 8) >> 2] = c[(M + 8) >> 2];
+                c[(w + 12) >> 2] = c[(M + 12) >> 2];
+                R = p + C;
+                rO(N, R, Q);
+                c[x >> 2] = c[N >> 2];
+                c[(x + 4) >> 2] = c[(N + 4) >> 2];
+                c[(x + 8) >> 2] = c[(N + 8) >> 2];
+                c[(x + 12) >> 2] = c[(N + 12) >> 2];
+                rO(O, R, z);
+                c[y >> 2] = c[O >> 2];
+                c[(y + 4) >> 2] = c[(O + 4) >> 2];
+                c[(y + 8) >> 2] = c[(O + 8) >> 2];
+                c[(y + 12) >> 2] = c[(O + 12) >> 2];
+                Q = H - o;
+                rO(J, R, Q);
+                c[A >> 2] = c[J >> 2];
+                c[(A + 4) >> 2] = c[(J + 4) >> 2];
+                c[(A + 8) >> 2] = c[(J + 8) >> 2];
+                c[(A + 12) >> 2] = c[(J + 12) >> 2];
+                rO(K, m * 0.3333333333333333 + G, Q);
+                c[B >> 2] = c[K >> 2];
+                c[(B + 4) >> 2] = c[(K + 4) >> 2];
+                c[(B + 8) >> 2] = c[(K + 8) >> 2];
+                c[(B + 12) >> 2] = c[(K + 12) >> 2];
+                h[s >> 3] = G;
+                h[t >> 3] = H;
+                k = (e + 16) | 0;
+                if (
+                  (c[((c[k >> 2] | 0) + 96) >> 2] | 0) != 0
+                    ? ((S =
+                        ((c[
+                          ((c[
+                            ((xC(c[((((c[e >> 2] & 3) | 0) == 3 ? e : (e + 48) | 0) + 40) >> 2] | 0) | 0) + 16) >> 2
+                          ] |
+                            0) +
+                            116) >>
+                            2
+                        ] &
+                          1) |
+                          0) ==
+                        0),
+                      (k = c[((c[k >> 2] | 0) + 96) >> 2] | 0),
+                      (I = +h[(S ? (k + 24) | 0 : (k + 32) | 0) >> 3]),
+                      (S = c[D >> 2] | 0),
+                      (h[(k + 56) >> 3] = I * 0.5 + p + +h[(S + 16) >> 3]),
+                      (h[(k + 64) >> 3] = +h[(S + 24) >> 3]),
+                      (a[(k + 81) >> 0] = 1),
+                      I > g)
+                    : 0
+                )
+                  i = I + i;
+                else i = p;
+                dO(e, c[((((c[e >> 2] & 3) | 0) == 2 ? e : (e + -48) | 0) + 40) >> 2] | 0, L, 7, j);
+                e = q;
+                r = (r + 1) | 0;
+              }
+              l = P;
+              return;
+            }
+            function nO(b, e, f, g, i, j) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = +g;
+              i = +i;
+              j = j | 0;
+              var k = 0.0,
+                m = 0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0,
+                r = 0,
+                s = 0.0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0.0,
+                B = 0,
+                C = 0,
+                D = 0.0,
+                E = 0,
+                F = 0.0,
+                G = 0.0,
+                H = 0.0,
+                I = 0.0,
+                J = 0.0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                O = 0,
+                P = 0,
+                Q = 0,
+                R = 0.0,
+                S = 0;
+              Q = l;
+              l = (l + 16080) | 0;
+              M = (Q + 80) | 0;
+              N = (Q + 64) | 0;
+              O = (Q + 48) | 0;
+              P = (Q + 32) | 0;
+              K = (Q + 16) | 0;
+              L = Q;
+              C = c[(b + (e << 2)) >> 2] | 0;
+              q = (g * 0.5) / +(f | 0);
+              q = q > 2.0 ? q : 2.0;
+              E = ((c[((((c[C >> 2] & 3) | 0) == 3 ? C : (C + 48) | 0) + 40) >> 2] | 0) + 16) | 0;
+              m = c[E >> 2] | 0;
+              H = +h[(m + 16) >> 3];
+              D = +h[(m + 24) >> 3];
+              C = c[(C + 16) >> 2] | 0;
+              k = +h[(C + 16) >> 3];
+              p = +h[(C + 24) >> 3];
+              F = k + H;
+              G = p + D;
+              g = +h[(C + 56) >> 3];
+              o = +h[(C + 64) >> 3];
+              H = g + H;
+              I = o + D;
+              n = !(F >= H) ? -1.0 : 1.0;
+              s = +h[(m + 80) >> 3] * 0.5;
+              switch (qO(d[(C + 49) >> 0] | 0, d[(C + 89) >> 0] | 0) | 0) {
+                case 15: {
+                  k = (q - g + +h[(m + 96) >> 3]) * n;
+                  break;
+                }
+                case 38: {
+                  k = (g + q + +h[(m + 88) >> 3]) * n;
+                  break;
+                }
+                case 41: {
+                  k = (q - k + +h[(m + 96) >> 3]) * n;
+                  break;
+                }
+                case 48: {
+                  k = (q - k + +h[(m + 96) >> 3]) * n;
+                  break;
+                }
+                case 58:
+                case 57:
+                case 51:
+                case 47:
+                case 37:
+                case 14: {
+                  k = n * 0.3333333333333333 * (k - g + +h[(m + 88) >> 3] + +h[(m + 96) >> 3]);
+                  break;
+                }
+                case 73: {
+                  k = (k + q + +h[(m + 88) >> 3]) * n;
+                  break;
+                }
+                case 83: {
+                  k = (+h[(m + 88) >> 3] + k) * n;
+                  break;
+                }
+                case 84: {
+                  k = ((k - g + +h[(m + 88) >> 3] + +h[(m + 96) >> 3]) * 0.5 + q) * n;
+                  break;
+                }
+                case 85:
+                case 75:
+                case 74: {
+                  k = ((k - g + +h[(m + 88) >> 3] + +h[(m + 96) >> 3]) * 0.5 + q * 2.0) * n;
+                  break;
+                }
+                default:
+                  k = 0.0;
+              }
+              p = (s - p) * 3.0;
+              o = (s - o) * 3.0;
+              q = n * q;
+              w = (M + 8) | 0;
+              x = (M + 16) | 0;
+              y = (M + 32) | 0;
+              z = (M + 48) | 0;
+              A = (H + F) * 0.5;
+              B = (M + 64) | 0;
+              C = (M + 80) | 0;
+              u = (M + 96) | 0;
+              v = (M + 104) | 0;
+              t = 0;
+              g = s;
+              p = s < p ? s : p;
+              n = s < o ? s : o;
+              while (1) {
+                if ((t | 0) >= (f | 0)) break;
+                r = (e + 1) | 0;
+                e = c[(b + (e << 2)) >> 2] | 0;
+                o = g + i;
+                p = p + i;
+                n = n + i;
+                k = k + q;
+                h[M >> 3] = F;
+                h[w >> 3] = G;
+                s = k + F;
+                rO(N, s, p * 0.3333333333333333 + G);
+                c[x >> 2] = c[N >> 2];
+                c[(x + 4) >> 2] = c[(N + 4) >> 2];
+                c[(x + 8) >> 2] = c[(N + 8) >> 2];
+                c[(x + 12) >> 2] = c[(N + 12) >> 2];
+                R = o + D;
+                rO(O, s, R);
+                c[y >> 2] = c[O >> 2];
+                c[(y + 4) >> 2] = c[(O + 4) >> 2];
+                c[(y + 8) >> 2] = c[(O + 8) >> 2];
+                c[(y + 12) >> 2] = c[(O + 12) >> 2];
+                rO(P, A, R);
+                c[z >> 2] = c[P >> 2];
+                c[(z + 4) >> 2] = c[(P + 4) >> 2];
+                c[(z + 8) >> 2] = c[(P + 8) >> 2];
+                c[(z + 12) >> 2] = c[(P + 12) >> 2];
+                s = H - k;
+                rO(K, s, R);
+                c[B >> 2] = c[K >> 2];
+                c[(B + 4) >> 2] = c[(K + 4) >> 2];
+                c[(B + 8) >> 2] = c[(K + 8) >> 2];
+                c[(B + 12) >> 2] = c[(K + 12) >> 2];
+                rO(L, s, n * 0.3333333333333333 + I);
+                c[C >> 2] = c[L >> 2];
+                c[(C + 4) >> 2] = c[(L + 4) >> 2];
+                c[(C + 8) >> 2] = c[(L + 8) >> 2];
+                c[(C + 12) >> 2] = c[(L + 12) >> 2];
+                h[u >> 3] = H;
+                h[v >> 3] = I;
+                m = (e + 16) | 0;
+                if (
+                  (c[((c[m >> 2] | 0) + 96) >> 2] | 0) != 0
+                    ? ((S =
+                        ((c[
+                          ((c[
+                            ((xC(c[((((c[e >> 2] & 3) | 0) == 3 ? e : (e + 48) | 0) + 40) >> 2] | 0) | 0) + 16) >> 2
+                          ] |
+                            0) +
+                            116) >>
+                            2
+                        ] &
+                          1) |
+                          0) ==
+                        0),
+                      (m = c[((c[m >> 2] | 0) + 96) >> 2] | 0),
+                      (J = +h[(S ? (m + 32) | 0 : (m + 24) | 0) >> 3]),
+                      (S = c[E >> 2] | 0),
+                      (h[(m + 64) >> 3] = J * 0.5 + o + +h[(S + 24) >> 3]),
+                      (h[(m + 56) >> 3] = +h[(S + 16) >> 3]),
+                      (a[(m + 81) >> 0] = 1),
+                      J > i)
+                    : 0
+                )
+                  g = J + g;
+                else g = o;
+                dO(e, c[((((c[e >> 2] & 3) | 0) == 2 ? e : (e + -48) | 0) + 40) >> 2] | 0, M, 7, j);
+                e = r;
+                t = (t + 1) | 0;
+              }
+              l = Q;
+              return;
+            }
+            function oO(b, e, f, g, i, j) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = +g;
+              i = +i;
+              j = j | 0;
+              var k = 0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0.0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0.0,
+                A = 0,
+                B = 0,
+                C = 0.0,
+                D = 0,
+                E = 0.0,
+                F = 0.0,
+                G = 0.0,
+                H = 0.0,
+                I = 0.0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                O = 0,
+                P = 0,
+                Q = 0.0,
+                R = 0.0,
+                S = 0;
+              P = l;
+              l = (l + 16080) | 0;
+              L = (P + 80) | 0;
+              M = (P + 64) | 0;
+              N = (P + 48) | 0;
+              O = (P + 32) | 0;
+              J = (P + 16) | 0;
+              K = P;
+              B = c[(b + (e << 2)) >> 2] | 0;
+              n = (i * 0.5) / +(f | 0);
+              n = n > 2.0 ? n : 2.0;
+              D = ((c[((((c[B >> 2] & 3) | 0) == 3 ? B : (B + 48) | 0) + 40) >> 2] | 0) + 16) | 0;
+              A = c[D >> 2] | 0;
+              C = +h[(A + 16) >> 3];
+              H = +h[(A + 24) >> 3];
+              B = c[(B + 16) >> 2] | 0;
+              m = +h[(B + 16) >> 3];
+              E = m + C;
+              F = +h[(B + 24) >> 3] + H;
+              i = +h[(B + 56) >> 3];
+              G = i + C;
+              H = +h[(B + 64) >> 3] + H;
+              k = !(F >= H) ? -1 : 1;
+              p = +h[(A + 88) >> 3];
+              switch (qO(d[(B + 49) >> 0] | 0, d[(B + 89) >> 0] | 0) | 0) {
+                case 67:
+                case 12: {
+                  if (F == H) k = (0 - k) | 0;
+                  break;
+                }
+                default: {
+                }
+              }
+              Q = (m + p) * 3.0;
+              m = (i + p) * 3.0;
+              v = n * +(k | 0);
+              u = (L + 8) | 0;
+              w = (L + 16) | 0;
+              x = (L + 32) | 0;
+              y = (L + 48) | 0;
+              z = (H + F) * 0.5;
+              A = (L + 64) | 0;
+              B = (L + 80) | 0;
+              s = (L + 96) | 0;
+              t = (L + 104) | 0;
+              r = 0;
+              o = 0.0;
+              i = p;
+              n = p < Q ? p : Q;
+              m = p < m ? p : m;
+              while (1) {
+                if ((r | 0) >= (f | 0)) break;
+                q = (e + 1) | 0;
+                e = c[(b + (e << 2)) >> 2] | 0;
+                p = i + g;
+                n = n + g;
+                m = m + g;
+                o = o + v;
+                h[L >> 3] = E;
+                h[u >> 3] = F;
+                Q = o + F;
+                rO(M, E - n * 0.3333333333333333, Q);
+                c[w >> 2] = c[M >> 2];
+                c[(w + 4) >> 2] = c[(M + 4) >> 2];
+                c[(w + 8) >> 2] = c[(M + 8) >> 2];
+                c[(w + 12) >> 2] = c[(M + 12) >> 2];
+                R = C - p;
+                rO(N, R, Q);
+                c[x >> 2] = c[N >> 2];
+                c[(x + 4) >> 2] = c[(N + 4) >> 2];
+                c[(x + 8) >> 2] = c[(N + 8) >> 2];
+                c[(x + 12) >> 2] = c[(N + 12) >> 2];
+                rO(O, R, z);
+                c[y >> 2] = c[O >> 2];
+                c[(y + 4) >> 2] = c[(O + 4) >> 2];
+                c[(y + 8) >> 2] = c[(O + 8) >> 2];
+                c[(y + 12) >> 2] = c[(O + 12) >> 2];
+                Q = H - o;
+                rO(J, R, Q);
+                c[A >> 2] = c[J >> 2];
+                c[(A + 4) >> 2] = c[(J + 4) >> 2];
+                c[(A + 8) >> 2] = c[(J + 8) >> 2];
+                c[(A + 12) >> 2] = c[(J + 12) >> 2];
+                rO(K, G - m * 0.3333333333333333, Q);
+                c[B >> 2] = c[K >> 2];
+                c[(B + 4) >> 2] = c[(K + 4) >> 2];
+                c[(B + 8) >> 2] = c[(K + 8) >> 2];
+                c[(B + 12) >> 2] = c[(K + 12) >> 2];
+                h[s >> 3] = G;
+                h[t >> 3] = H;
+                k = (e + 16) | 0;
+                if (
+                  (c[((c[k >> 2] | 0) + 96) >> 2] | 0) != 0
+                    ? ((S =
+                        ((c[
+                          ((c[
+                            ((xC(c[((((c[e >> 2] & 3) | 0) == 3 ? e : (e + 48) | 0) + 40) >> 2] | 0) | 0) + 16) >> 2
+                          ] |
+                            0) +
+                            116) >>
+                            2
+                        ] &
+                          1) |
+                          0) ==
+                        0),
+                      (k = c[((c[k >> 2] | 0) + 96) >> 2] | 0),
+                      (I = +h[(S ? (k + 24) | 0 : (k + 32) | 0) >> 3]),
+                      (S = c[D >> 2] | 0),
+                      (h[(k + 56) >> 3] = I * -0.5 - p + +h[(S + 16) >> 3]),
+                      (h[(k + 64) >> 3] = +h[(S + 24) >> 3]),
+                      (a[(k + 81) >> 0] = 1),
+                      I > g)
+                    : 0
+                )
+                  i = I + i;
+                else i = p;
+                dO(e, c[((((c[e >> 2] & 3) | 0) == 2 ? e : (e + -48) | 0) + 40) >> 2] | 0, L, 7, j);
+                e = q;
+                r = (r + 1) | 0;
+              }
+              l = P;
+              return;
+            }
+            function pO(b, e, f, g, i, j) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = +g;
+              i = +i;
+              j = j | 0;
+              var k = 0.0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0.0,
+                w = 0,
+                x = 0.0,
+                y = 0.0,
+                z = 0.0,
+                A = 0.0,
+                B = 0.0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0.0,
+                G = 0,
+                H = 0,
+                I = 0.0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                O = 0,
+                P = 0,
+                Q = 0.0,
+                R = 0.0,
+                S = 0;
+              P = l;
+              l = (l + 16080) | 0;
+              L = (P + 80) | 0;
+              M = (P + 64) | 0;
+              N = (P + 48) | 0;
+              O = (P + 32) | 0;
+              J = (P + 16) | 0;
+              K = P;
+              C = c[(b + (e << 2)) >> 2] | 0;
+              B = (g * 0.5) / +(f | 0);
+              w = ((c[((((c[C >> 2] & 3) | 0) == 3 ? C : (C + 48) | 0) + 40) >> 2] | 0) + 16) | 0;
+              D = c[w >> 2] | 0;
+              z = +h[(D + 16) >> 3];
+              v = +h[(D + 24) >> 3];
+              C = c[(C + 16) >> 2] | 0;
+              m = +h[(C + 24) >> 3];
+              x = +h[(C + 16) >> 3] + z;
+              y = m + v;
+              n = +h[(C + 64) >> 3];
+              z = +h[(C + 56) >> 3] + z;
+              A = n + v;
+              u = !(x >= z) ? -1 : 1;
+              o = +h[(D + 80) >> 3] * 0.5;
+              C = (qO(d[(C + 49) >> 0] | 0, d[(C + 89) >> 0] | 0) | 0) == 67;
+              m = (m + o) * 3.0;
+              n = (n + o) * 3.0;
+              B = (B > 2.0 ? B : 2.0) * +((C ? (0 - u) | 0 : u) | 0);
+              u = (L + 8) | 0;
+              C = (L + 16) | 0;
+              D = (L + 32) | 0;
+              E = (L + 48) | 0;
+              F = (z + x) * 0.5;
+              G = (L + 64) | 0;
+              H = (L + 80) | 0;
+              s = (L + 96) | 0;
+              t = (L + 104) | 0;
+              g = o;
+              k = 0.0;
+              m = o < m ? o : m;
+              n = o < n ? o : n;
+              q = 0;
+              while (1) {
+                if ((q | 0) >= (f | 0)) break;
+                r = (e + 1) | 0;
+                p = c[(b + (e << 2)) >> 2] | 0;
+                o = g + i;
+                m = m + i;
+                n = n + i;
+                k = k + B;
+                h[L >> 3] = x;
+                h[u >> 3] = y;
+                Q = k + x;
+                rO(M, Q, y - m * 0.3333333333333333);
+                c[C >> 2] = c[M >> 2];
+                c[(C + 4) >> 2] = c[(M + 4) >> 2];
+                c[(C + 8) >> 2] = c[(M + 8) >> 2];
+                c[(C + 12) >> 2] = c[(M + 12) >> 2];
+                R = v - o;
+                rO(N, Q, R);
+                c[D >> 2] = c[N >> 2];
+                c[(D + 4) >> 2] = c[(N + 4) >> 2];
+                c[(D + 8) >> 2] = c[(N + 8) >> 2];
+                c[(D + 12) >> 2] = c[(N + 12) >> 2];
+                rO(O, F, R);
+                c[E >> 2] = c[O >> 2];
+                c[(E + 4) >> 2] = c[(O + 4) >> 2];
+                c[(E + 8) >> 2] = c[(O + 8) >> 2];
+                c[(E + 12) >> 2] = c[(O + 12) >> 2];
+                Q = z - k;
+                rO(J, Q, R);
+                c[G >> 2] = c[J >> 2];
+                c[(G + 4) >> 2] = c[(J + 4) >> 2];
+                c[(G + 8) >> 2] = c[(J + 8) >> 2];
+                c[(G + 12) >> 2] = c[(J + 12) >> 2];
+                rO(K, Q, A - n * 0.3333333333333333);
+                c[H >> 2] = c[K >> 2];
+                c[(H + 4) >> 2] = c[(K + 4) >> 2];
+                c[(H + 8) >> 2] = c[(K + 8) >> 2];
+                c[(H + 12) >> 2] = c[(K + 12) >> 2];
+                h[s >> 3] = z;
+                h[t >> 3] = A;
+                e = (p + 16) | 0;
+                if (
+                  (c[((c[e >> 2] | 0) + 96) >> 2] | 0) != 0
+                    ? ((S =
+                        ((c[
+                          ((c[
+                            ((xC(c[((((c[p >> 2] & 3) | 0) == 3 ? p : (p + 48) | 0) + 40) >> 2] | 0) | 0) + 16) >> 2
+                          ] |
+                            0) +
+                            116) >>
+                            2
+                        ] &
+                          1) |
+                          0) ==
+                        0),
+                      (e = c[((c[e >> 2] | 0) + 96) >> 2] | 0),
+                      (I = +h[(S ? (e + 32) | 0 : (e + 24) | 0) >> 3]),
+                      (S = c[w >> 2] | 0),
+                      (h[(e + 64) >> 3] = I * -0.5 - o + +h[(S + 24) >> 3]),
+                      (h[(e + 56) >> 3] = +h[(S + 16) >> 3]),
+                      (a[(e + 81) >> 0] = 1),
+                      I > i)
+                    : 0
+                )
+                  g = I + g;
+                else g = o;
+                dO(p, c[((((c[p >> 2] & 3) | 0) == 2 ? p : (p + -48) | 0) + 40) >> 2] | 0, L, 7, j);
+                e = r;
+                q = (q + 1) | 0;
+              }
+              l = P;
+              return;
+            }
+            function qO(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = 0;
+              while (1) {
+                if ((d | 0) >= 8) {
+                  b = -1;
+                  break;
+                }
+                if ((c[(22044 + (d << 2)) >> 2] | 0) == (b | 0)) {
+                  b = d;
+                  break;
+                }
+                d = (d + 1) | 0;
+              }
+              d = 0;
+              while (1) {
+                if ((d | 0) >= 8) {
+                  d = -1;
+                  break;
+                }
+                if ((c[(22044 + (d << 2)) >> 2] | 0) == (a | 0)) break;
+                d = (d + 1) | 0;
+              }
+              if ((d | b | 0) < 0) d = 0;
+              else d = c[(22076 + (d << 5) + (b << 2)) >> 2] | 0;
+              return d | 0;
+            }
+            function rO(a, b, c) {
+              a = a | 0;
+              b = +b;
+              c = +c;
+              h[a >> 3] = b;
+              h[(a + 8) >> 3] = c;
+              return;
+            }
+            function sO(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              if (((c[47203] | 0) != 0) | ((c[47202] | 0) != 0)) {
+                d = (b + 16) | 0;
+                e = c[((c[d >> 2] | 0) + 100) >> 2] | 0;
+                if ((e | 0 ? (a[(e + 81) >> 0] | 0) == 0 : 0) ? tO(b, 1) | 0 : 0) {
+                  e = xC(c[((((c[b >> 2] & 3) | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0) | 0;
+                  zP(e, c[((c[d >> 2] | 0) + 100) >> 2] | 0);
+                }
+                e = c[((c[d >> 2] | 0) + 104) >> 2] | 0;
+                if ((e | 0 ? (a[(e + 81) >> 0] | 0) == 0 : 0) ? tO(b, 0) | 0 : 0) {
+                  e = xC(c[((((c[b >> 2] & 3) | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0) | 0;
+                  zP(e, c[((c[d >> 2] | 0) + 104) >> 2] | 0);
+                }
+              }
+              return;
+            }
+            function tO(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                g = 0.0,
+                i = 0,
+                j = 0.0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0.0;
+              q = l;
+              l = (l + 96) | 0;
+              o = (q + 32) | 0;
+              m = (q + 16) | 0;
+              n = q;
+              i = (b + 16) | 0;
+              do
+                if ((a[((c[i >> 2] | 0) + 112) >> 0] | 0) != 6) {
+                  e = c[47203] | 0;
+                  if (!((e | 0) != 0 ? (a[(RA(b, e) | 0) >> 0] | 0) != 0 : 0)) {
+                    e = c[47202] | 0;
+                    if (!e) {
+                      e = 0;
+                      break;
+                    }
+                    if (!(a[(RA(b, e) | 0) >> 0] | 0)) {
+                      e = 0;
+                      break;
+                    }
+                  }
+                  d = (d << 24) >> 24 == 0;
+                  p = c[i >> 2] | 0;
+                  p = c[(d ? (p + 104) | 0 : (p + 100) | 0) >> 2] | 0;
+                  e = uO(b) | 0;
+                  if (e) {
+                    k = c[e >> 2] | 0;
+                    do
+                      if (d) {
+                        if (c[(k + 8) >> 2] | 0) {
+                          e = c[k >> 2] | 0;
+                          j = +h[e >> 3];
+                          g = +h[(k + 16) >> 3];
+                          e = (e + 8) | 0;
+                          f = +h[(k + 24) >> 3];
+                          break;
+                        }
+                        e = c[k >> 2] | 0;
+                        g = +h[e >> 3];
+                        f = +h[(e + 8) >> 3];
+                        e = 0;
+                        while (1) {
+                          if ((e | 0) == 4) break;
+                          n = (o + (e << 4)) | 0;
+                          i = ((c[k >> 2] | 0) + (e << 4)) | 0;
+                          c[n >> 2] = c[i >> 2];
+                          c[(n + 4) >> 2] = c[(i + 4) >> 2];
+                          c[(n + 8) >> 2] = c[(i + 8) >> 2];
+                          c[(n + 12) >> 2] = c[(i + 12) >> 2];
+                          e = (e + 1) | 0;
+                        }
+                        kP(m, o, 3, 0.1, 0, 0);
+                        j = +h[m >> 3];
+                        e = (m + 8) | 0;
+                      } else {
+                        d = ((c[(e + 4) >> 2] | 0) + -1) | 0;
+                        i = (k + ((d * 48) | 0)) | 0;
+                        if (c[(k + ((d * 48) | 0) + 12) >> 2] | 0) {
+                          o = c[i >> 2] | 0;
+                          e = ((c[(k + ((d * 48) | 0) + 4) >> 2] | 0) + -1) | 0;
+                          j = +h[(o + (e << 4)) >> 3];
+                          g = +h[(k + ((d * 48) | 0) + 32) >> 3];
+                          e = (o + (e << 4) + 8) | 0;
+                          f = +h[(k + ((d * 48) | 0) + 40) >> 3];
+                          break;
+                        }
+                        m = c[i >> 2] | 0;
+                        d = (k + ((d * 48) | 0) + 4) | 0;
+                        e = ((c[d >> 2] | 0) + -1) | 0;
+                        g = +h[(m + (e << 4)) >> 3];
+                        f = +h[(m + (e << 4) + 8) >> 3];
+                        e = 0;
+                        while (1) {
+                          if ((e | 0) == 4) break;
+                          m = (o + (e << 4)) | 0;
+                          k = ((c[i >> 2] | 0) + ((e + -4 + (c[d >> 2] | 0)) << 4)) | 0;
+                          c[m >> 2] = c[k >> 2];
+                          c[(m + 4) >> 2] = c[(k + 4) >> 2];
+                          c[(m + 8) >> 2] = c[(k + 8) >> 2];
+                          c[(m + 12) >> 2] = c[(k + 12) >> 2];
+                          e = (e + 1) | 0;
+                        }
+                        kP(n, o, 3, 0.9, 0, 0);
+                        j = +h[n >> 3];
+                        e = (n + 8) | 0;
+                      }
+                    while (0);
+                    r = +K(+(+h[e >> 3] - f), +(j - g));
+                    r = +_O(b, c[47203] | 0, -25.0, -180.0) * 0.017453292519943295 + r;
+                    j = +_O(b, c[47202] | 0, 1.0, 0.0) * 10.0;
+                    h[(p + 56) >> 3] = j * +E(+r) + g;
+                    h[(p + 64) >> 3] = +F(+r) * j + f;
+                    a[(p + 81) >> 0] = 1;
+                    e = 1;
+                  } else e = 0;
+                } else e = 0;
+              while (0);
+              l = q;
+              return e | 0;
+            }
+            function uO(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 16) | 0;
+              f = h;
+              d = b;
+              while (1) {
+                e = c[(d + 16) >> 2] | 0;
+                d = c[(e + 8) >> 2] | 0;
+                if (d | 0) break;
+                if (!(a[(e + 112) >> 0] | 0)) {
+                  g = 5;
+                  break;
+                }
+                d = c[(e + 116) >> 2] | 0;
+              }
+              if ((g | 0) == 5) {
+                g = KB(c[((((c[b >> 2] & 3) | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0) | 0;
+                d = KB(c[((((c[b >> 2] & 3) | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0) | 0;
+                c[f >> 2] = g;
+                c[(f + 4) >> 2] = d;
+                gA(1, 106579, f) | 0;
+                d = 0;
+              }
+              l = h;
+              return d | 0;
+            }
+            function vO(a, d, e) {
+              a = a | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0.0,
+                u = 0.0;
+              s = l;
+              l = (l + 96) | 0;
+              m = (s + 80) | 0;
+              n = (s + 64) | 0;
+              o = (s + 48) | 0;
+              p = (s + 32) | 0;
+              q = (s + 16) | 0;
+              r = s;
+              k = b[((c[(d + 16) >> 2] | 0) + 136) >> 1] | 0;
+              d = (e + 16) | 0;
+              wO(c[((c[d >> 2] | 0) + 8) >> 2] | 0, p, q);
+              f = +h[p >> 3];
+              g = +h[q >> 3];
+              t = f - g;
+              i = +h[(p + 8) >> 3];
+              j = +h[(q + 8) >> 3];
+              u = i - j;
+              a: do
+                if (u * u + t * t < 1.0e-6) {
+                  c[o >> 2] = c[p >> 2];
+                  c[(o + 4) >> 2] = c[(p + 4) >> 2];
+                  c[(o + 8) >> 2] = c[(p + 8) >> 2];
+                  c[(o + 12) >> 2] = c[(p + 12) >> 2];
+                } else
+                  switch (k & 14) {
+                    case 4:
+                    case 10: {
+                      h[n >> 3] = (g + f) * 0.5;
+                      h[(n + 8) >> 3] = (j + i) * 0.5;
+                      q = c[((c[d >> 2] | 0) + 8) >> 2] | 0;
+                      c[m >> 2] = c[n >> 2];
+                      c[(m + 4) >> 2] = c[(n + 4) >> 2];
+                      c[(m + 8) >> 2] = c[(n + 8) >> 2];
+                      c[(m + 12) >> 2] = c[(n + 12) >> 2];
+                      qP(r, q, m);
+                      c[o >> 2] = c[r >> 2];
+                      c[(o + 4) >> 2] = c[(r + 4) >> 2];
+                      c[(o + 8) >> 2] = c[(r + 8) >> 2];
+                      c[(o + 12) >> 2] = c[(r + 12) >> 2];
+                      break a;
+                    }
+                    default: {
+                      xO(o, c[((c[d >> 2] | 0) + 8) >> 2] | 0, p, q);
+                      break a;
+                    }
+                  }
+              while (0);
+              c[a >> 2] = c[o >> 2];
+              c[(a + 4) >> 2] = c[(o + 4) >> 2];
+              c[(a + 8) >> 2] = c[(o + 8) >> 2];
+              c[(a + 12) >> 2] = c[(o + 12) >> 2];
+              l = s;
+              return;
+            }
+            function wO(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              h = l;
+              l = (l + 32) | 0;
+              g = (h + 16) | 0;
+              f = h;
+              j = c[a >> 2] | 0;
+              e = c[j >> 2] | 0;
+              i = c[(j + 8) >> 2] | 0;
+              k = (j + 16) | 0;
+              c[g >> 2] = c[k >> 2];
+              c[(g + 4) >> 2] = c[(k + 4) >> 2];
+              c[(g + 8) >> 2] = c[(k + 8) >> 2];
+              c[(g + 12) >> 2] = c[(k + 12) >> 2];
+              j = (j + 32) | 0;
+              c[f >> 2] = c[j >> 2];
+              c[(f + 4) >> 2] = c[(j + 4) >> 2];
+              c[(f + 8) >> 2] = c[(j + 8) >> 2];
+              c[(f + 12) >> 2] = c[(j + 12) >> 2];
+              if (!i) {
+                c[b >> 2] = c[e >> 2];
+                c[(b + 4) >> 2] = c[(e + 4) >> 2];
+                c[(b + 8) >> 2] = c[(e + 8) >> 2];
+                c[(b + 12) >> 2] = c[(e + 12) >> 2];
+              } else {
+                c[b >> 2] = c[g >> 2];
+                c[(b + 4) >> 2] = c[(g + 4) >> 2];
+                c[(b + 8) >> 2] = c[(g + 8) >> 2];
+                c[(b + 12) >> 2] = c[(g + 12) >> 2];
+              }
+              i = c[a >> 2] | 0;
+              j = ((c[(a + 4) >> 2] | 0) + -1) | 0;
+              e = c[(i + ((j * 48) | 0)) >> 2] | 0;
+              a = c[(i + ((j * 48) | 0) + 4) >> 2] | 0;
+              k = c[(i + ((j * 48) | 0) + 12) >> 2] | 0;
+              b = (i + ((j * 48) | 0) + 16) | 0;
+              c[g >> 2] = c[b >> 2];
+              c[(g + 4) >> 2] = c[(b + 4) >> 2];
+              c[(g + 8) >> 2] = c[(b + 8) >> 2];
+              c[(g + 12) >> 2] = c[(b + 12) >> 2];
+              j = (i + ((j * 48) | 0) + 32) | 0;
+              c[f >> 2] = c[j >> 2];
+              c[(f + 4) >> 2] = c[(j + 4) >> 2];
+              c[(f + 8) >> 2] = c[(j + 8) >> 2];
+              c[(f + 12) >> 2] = c[(j + 12) >> 2];
+              if (!k) {
+                k = (e + ((a + -1) << 4)) | 0;
+                c[d >> 2] = c[k >> 2];
+                c[(d + 4) >> 2] = c[(k + 4) >> 2];
+                c[(d + 8) >> 2] = c[(k + 8) >> 2];
+                c[(d + 12) >> 2] = c[(k + 12) >> 2];
+              } else {
+                c[d >> 2] = c[f >> 2];
+                c[(d + 4) >> 2] = c[(f + 4) >> 2];
+                c[(d + 8) >> 2] = c[(f + 8) >> 2];
+                c[(d + 12) >> 2] = c[(f + 12) >> 2];
+              }
+              l = h;
+              return;
+            }
+            function xO(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0,
+                r = 0,
+                s = 0.0;
+              r = c[(b + 4) >> 2] | 0;
+              g = 0.0;
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (r | 0)) break;
+                l = c[b >> 2] | 0;
+                k = c[(l + ((f * 48) | 0)) >> 2] | 0;
+                l = c[(l + ((f * 48) | 0) + 4) >> 2] | 0;
+                i = 3;
+                j = 0;
+                while (1) {
+                  if ((i | 0) >= (l | 0)) break;
+                  q = +h[(k + (j << 4)) >> 3] - +h[(k + (i << 4)) >> 3];
+                  p = +h[(k + (j << 4) + 8) >> 3] - +h[(k + (i << 4) + 8) >> 3];
+                  i = (i + 3) | 0;
+                  j = (j + 3) | 0;
+                  g = +C(+(p * p + q * q)) + g;
+                }
+                f = (f + 1) | 0;
+              }
+              l = 0;
+              g = g * 0.5;
+              a: while (1) {
+                if ((l | 0) >= (r | 0)) {
+                  f = 15;
+                  break;
+                }
+                k = c[b >> 2] | 0;
+                j = c[(k + ((l * 48) | 0)) >> 2] | 0;
+                k = c[(k + ((l * 48) | 0) + 4) >> 2] | 0;
+                f = 3;
+                i = 0;
+                while (1) {
+                  if ((f | 0) >= (k | 0)) break;
+                  m = +h[(j + (i << 4)) >> 3];
+                  p = +h[(j + (i << 4) + 8) >> 3];
+                  n = +h[(j + (f << 4)) >> 3];
+                  o = +h[(j + (f << 4) + 8) >> 3];
+                  q = m - n;
+                  s = p - o;
+                  q = +C(+(s * s + q * q));
+                  if (q >= g) {
+                    f = 12;
+                    break a;
+                  }
+                  f = (f + 3) | 0;
+                  i = (i + 3) | 0;
+                  g = g - q;
+                }
+                l = (l + 1) | 0;
+              }
+              if ((f | 0) == 12) {
+                h[d >> 3] = m;
+                h[(d + 8) >> 3] = p;
+                h[e >> 3] = n;
+                h[(e + 8) >> 3] = o;
+                s = q - g;
+                h[a >> 3] = (s * m + n * g) / q;
+                h[(a + 8) >> 3] = (s * p + o * g) / q;
+                return;
+              } else if ((f | 0) == 15) qa(138712, 106514, 1316, 106641);
+            }
+            function yO(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              sO(b);
+              return;
+            }
+            function zO(b, d, e, f, g) {
+              b = b | 0;
+              d = d | 0;
+              e = +e;
+              f = f | 0;
+              g = g | 0;
+              var i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                l = 0.0,
+                m = 0.0,
+                n = 0,
+                o = 0,
+                p = 0.0,
+                q = 0.0,
+                r = 0.0,
+                s = 0,
+                t = 0.0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0.0,
+                C = 0.0,
+                D = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0;
+              J = AO(b) | 0;
+              I = c[(J + 4) >> 2] | 0;
+              K = c[J >> 2] | 0;
+              H = (I + -1) | 0;
+              B = +h[(K + (H << 6) + 16) >> 3];
+              C = +(I | 0);
+              D = (g | 0) == 2;
+              G = (f | 0) != 0;
+              n = 0;
+              j = 0.0;
+              i = 0.0;
+              l = 0.0;
+              m = 0.0;
+              while (1) {
+                if ((n | 0) >= (I | 0)) break;
+                b = ~~+BO(+((n + -1) | 0), C);
+                A = (n + 1) | 0;
+                L = ~~+BO(+(A | 0), C);
+                o = (K + (n << 6)) | 0;
+                m = +h[o >> 3];
+                z = (K + (n << 6) + 8) | 0;
+                l = +h[z >> 3];
+                s = (K + (n << 6) + 16) | 0;
+                t = +h[s >> 3];
+                u = (K + (n << 6) + 24) | 0;
+                v = (K + (n << 6) + 32) | 0;
+                w = (K + (n << 6) + 40) | 0;
+                x = (K + (n << 6) + 48) | 0;
+                y = (K + (n << 6) + 56) | 0;
+                k = +CO(+h[(K + (L << 6) + 8) >> 3] - l, +h[(K + (L << 6)) >> 3] - m);
+                q = +CO(+h[(K + (b << 6) + 8) >> 3] - l, +h[(K + (b << 6)) >> 3] - m);
+                r = +hb[d & 7](t, B, e);
+                b = (n | 0) == 0;
+                do
+                  if (b | ((n | 0) == (H | 0)))
+                    if (b) {
+                      i = k + 1.5707963267948966;
+                      if (!D) {
+                        b = 0;
+                        p = i;
+                        j = r;
+                        break;
+                      }
+                      b = 0;
+                      p = i;
+                      j = r;
+                      l = l - +F(+k) * r;
+                      m = m - +E(+k) * r;
+                      break;
+                    } else {
+                      i = q + -1.5707963267948966;
+                      if (!D) {
+                        b = 0;
+                        p = i;
+                        j = r;
+                        break;
+                      }
+                      b = 0;
+                      p = i;
+                      j = r;
+                      l = l - +F(+q) * r;
+                      m = m - +E(+q) * r;
+                      break;
+                    }
+                  else {
+                    p = k - q;
+                    p = 1.5707963267948966 - (p < 0.0 ? p + 6.283185307179586 : p) * 0.5;
+                    j = +E(+p);
+                    j = j == 0.0 ? 0.0 : r / j;
+                    i = k + 1.5707963267948966;
+                    k = p + i;
+                    if (G | (j > r * 10.0)) {
+                      q = +BO(q + -1.5707963267948966, 6.283185307179586);
+                      b = 1;
+                      p = +BO(i, 6.283185307179586);
+                      j = r;
+                      i = q;
+                    } else {
+                      b = 0;
+                      p = k;
+                      i = k;
+                    }
+                  }
+                while (0);
+                h[o >> 3] = m;
+                h[z >> 3] = l;
+                h[s >> 3] = t;
+                a[u >> 0] = 108;
+                h[v >> 3] = i;
+                h[w >> 3] = j;
+                c[x >> 2] = b;
+                h[y >> 3] = p;
+                n = A;
+              }
+              o = JK(12) | 0;
+              b = 0;
+              while (1) {
+                if ((b | 0) >= (I | 0)) break;
+                m = +h[(K + (b << 6)) >> 3];
+                l = +h[(K + (b << 6) + 8) >> 3];
+                i = +h[(K + (b << 6) + 32) >> 3];
+                j = +h[(K + (b << 6) + 40) >> 3];
+                L = c[(K + (b << 6) + 48) >> 2] | 0;
+                k = +h[(K + (b << 6) + 56) >> 3];
+                DO(o, +E(+i) * j + m, +F(+i) * j + l);
+                if (L | 0) EO(m, l, j, 1, i, k, f, o);
+                b = (b + 1) | 0;
+              }
+              n = (g | 0) == 1;
+              k = i + 3.141592653589793;
+              if (n) FO(o, m, l, j, i, k);
+              else {
+                DO(o, +E(+k) * j + m, +F(+k) * j + l);
+                i = k;
+              }
+              b = (I + -2) | 0;
+              k = m;
+              while (1) {
+                if ((b | 0) <= -1) break;
+                m = +h[(K + (b << 6)) >> 3];
+                l = +h[(K + (b << 6) + 8) >> 3];
+                j = +h[(K + (b << 6) + 40) >> 3];
+                L = c[(K + (b << 6) + 48) >> 2] | 0;
+                i = +h[(K + (b << 6) + 32) >> 3] + 3.141592653589793;
+                k = +h[(K + (b << 6) + 56) >> 3] + 3.141592653589793;
+                DO(o, +E(+k) * j + m, +F(+k) * j + l);
+                if (L | 0) EO(m, l, j, 0, i, k, f, o);
+                b = (b + -1) | 0;
+                k = m;
+              }
+              if (n) FO(o, k, l, j, i, i + 3.141592653589793);
+              GO(J);
+              return o | 0;
+            }
+            function AO(a) {
+              a = a | 0;
+              var b = 0.0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0.0;
+              q = l;
+              l = (l + 144) | 0;
+              i = (q + 128) | 0;
+              h = (q + 112) | 0;
+              j = (q + 96) | 0;
+              k = (q + 64) | 0;
+              m = q;
+              n = (q + 80) | 0;
+              o = HO() | 0;
+              p = c[(a + 4) >> 2] | 0;
+              f = c[a >> 2] | 0;
+              c[i >> 2] = c[f >> 2];
+              c[(i + 4) >> 2] = c[(f + 4) >> 2];
+              c[(i + 8) >> 2] = c[(f + 8) >> 2];
+              c[(i + 12) >> 2] = c[(f + 12) >> 2];
+              IO(o, i, 0.0);
+              g = (m + 48) | 0;
+              c[g >> 2] = c[f >> 2];
+              c[(g + 4) >> 2] = c[(f + 4) >> 2];
+              c[(g + 8) >> 2] = c[(f + 8) >> 2];
+              c[(g + 12) >> 2] = c[(f + 12) >> 2];
+              d = 0;
+              b = 0.0;
+              a: while (1) {
+                e = (d + 3) | 0;
+                if ((e | 0) >= (p | 0)) break;
+                c[m >> 2] = c[g >> 2];
+                c[(m + 4) >> 2] = c[(g + 4) >> 2];
+                c[(m + 8) >> 2] = c[(g + 8) >> 2];
+                c[(m + 12) >> 2] = c[(g + 12) >> 2];
+                a = 1;
+                while (1) {
+                  if ((a | 0) == 4) break;
+                  r = (m + (a << 4)) | 0;
+                  s = (f + ((a + d) << 4)) | 0;
+                  c[r >> 2] = c[s >> 2];
+                  c[(r + 4) >> 2] = c[(s + 4) >> 2];
+                  c[(r + 8) >> 2] = c[(s + 8) >> 2];
+                  c[(r + 12) >> 2] = c[(s + 12) >> 2];
+                  a = (a + 1) | 0;
+                }
+                c[j >> 2] = c[m >> 2];
+                c[(j + 4) >> 2] = c[(m + 4) >> 2];
+                c[(j + 8) >> 2] = c[(m + 8) >> 2];
+                c[(j + 12) >> 2] = c[(m + 12) >> 2];
+                a = 1;
+                while (1) {
+                  if ((a | 0) == 21) {
+                    d = e;
+                    continue a;
+                  }
+                  kP(n, m, 3, +(a | 0) * 0.05, 0, 0);
+                  c[k >> 2] = c[n >> 2];
+                  c[(k + 4) >> 2] = c[(n + 4) >> 2];
+                  c[(k + 8) >> 2] = c[(n + 8) >> 2];
+                  c[(k + 12) >> 2] = c[(n + 12) >> 2];
+                  c[h >> 2] = c[j >> 2];
+                  c[(h + 4) >> 2] = c[(j + 4) >> 2];
+                  c[(h + 8) >> 2] = c[(j + 8) >> 2];
+                  c[(h + 12) >> 2] = c[(j + 12) >> 2];
+                  c[i >> 2] = c[n >> 2];
+                  c[(i + 4) >> 2] = c[(n + 4) >> 2];
+                  c[(i + 8) >> 2] = c[(n + 8) >> 2];
+                  c[(i + 12) >> 2] = c[(n + 12) >> 2];
+                  t = +JO(h, i) + b;
+                  c[i >> 2] = c[k >> 2];
+                  c[(i + 4) >> 2] = c[(k + 4) >> 2];
+                  c[(i + 8) >> 2] = c[(k + 8) >> 2];
+                  c[(i + 12) >> 2] = c[(k + 12) >> 2];
+                  IO(o, i, t);
+                  c[j >> 2] = c[k >> 2];
+                  c[(j + 4) >> 2] = c[(k + 4) >> 2];
+                  c[(j + 8) >> 2] = c[(k + 8) >> 2];
+                  c[(j + 12) >> 2] = c[(k + 12) >> 2];
+                  a = (a + 1) | 0;
+                  b = t;
+                }
+              }
+              KO(o);
+              l = q;
+              return o | 0;
+            }
+            function BO(a, b) {
+              a = +a;
+              b = +b;
+              var c = 0.0;
+              c = a - +A(+(a / b)) * b;
+              return +(!(a < 0.0) & !(a >= b) ? a : c);
+            }
+            function CO(a, b) {
+              a = +a;
+              b = +b;
+              if (!((a == 0.0) & (b == 0.0))) {
+                a = +K(+a, +b);
+                if (!(a >= 0.0)) a = a + 6.283185307179586;
+              } else a = 0.0;
+              return +a;
+            }
+            function DO(a, b, d) {
+              a = a | 0;
+              b = +b;
+              d = +d;
+              var e = 0,
+                f = 0;
+              e = c[a >> 2] | 0;
+              f = (a + 4) | 0;
+              if ((e | 0) < (c[f >> 2] | 0)) f = c[(a + 8) >> 2] | 0;
+              else {
+                c[f >> 2] = 2e3;
+                e = (a + 8) | 0;
+                f = MK(c[e >> 2] | 0, 32e3) | 0;
+                c[e >> 2] = f;
+                e = c[a >> 2] | 0;
+              }
+              c[a >> 2] = e + 1;
+              h[(f + (e << 4)) >> 3] = b;
+              h[(f + (e << 4) + 8) >> 3] = d;
+              return;
+            }
+            function EO(a, b, c, d, e, f, g, h) {
+              a = +a;
+              b = +b;
+              c = +c;
+              d = d | 0;
+              e = +e;
+              f = +f;
+              g = g | 0;
+              h = h | 0;
+              var i = 0.0;
+              d = (d | 0) == 0;
+              i = d ? e : f;
+              do
+                if ((g | 0) == 1) {
+                  e = (d ? f : e) - i;
+                  e = !(e <= 1.7453292519943296e-3) ? e : e + 6.283185307179586;
+                  if (e < 3.141592653589793) {
+                    FO(h, a, b, c, e + i, i);
+                    break;
+                  } else {
+                    DO(h, +E(+i) * c + a, +F(+i) * c + a);
+                    break;
+                  }
+                } else DO(h, +E(+i) * c + a, +F(+i) * c + a);
+              while (0);
+              return;
+            }
+            function FO(a, b, c, d, e, f) {
+              a = a | 0;
+              b = +b;
+              c = +c;
+              d = +d;
+              e = +e;
+              f = +f;
+              var g = 0,
+                h = 0.0;
+              DO(a, +E(+e) * d + b, +F(+e) * d + c);
+              a: do
+                if (!(d == 0.0)) {
+                  while (1) {
+                    if (!(f > e)) break;
+                    f = f + -6.283185307179586;
+                  }
+                  f = e - f;
+                  while (1) {
+                    if (!(f > 6.283185307179586)) break;
+                    f = f + -6.283185307179586;
+                  }
+                  f = f * 0.05263157894736842;
+                  g = 1;
+                  while (1) {
+                    if ((g | 0) == 20) break a;
+                    h = e - f * +(g | 0);
+                    DO(a, +E(+h) * d + b, +F(+h) * d + c);
+                    g = (g + 1) | 0;
+                  }
+                }
+              while (0);
+              return;
+            }
+            function GO(a) {
+              a = a | 0;
+              U1(c[a >> 2] | 0);
+              U1(a);
+              return;
+            }
+            function HO() {
+              var a = 0;
+              a = JK(12) | 0;
+              c[(a + 4) >> 2] = 0;
+              c[(a + 8) >> 2] = 2e3;
+              c[a >> 2] = JK(128e3) | 0;
+              return a | 0;
+            }
+            function IO(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = +d;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0;
+              i = (a + 4) | 0;
+              e = c[i >> 2] | 0;
+              f = (a + 8) | 0;
+              g = c[f >> 2] | 0;
+              if ((e | 0) < (g | 0)) a = c[a >> 2] | 0;
+              else {
+                c[f >> 2] = g << 1;
+                e = MK(c[a >> 2] | 0, g << 7) | 0;
+                c[a >> 2] = e;
+                a = e;
+                e = c[i >> 2] | 0;
+              }
+              h[(a + (e << 6)) >> 3] = +h[b >> 3];
+              h[(a + (e << 6) + 8) >> 3] = +h[(b + 8) >> 3];
+              c[i >> 2] = e + 1;
+              h[(a + (e << 6) + 16) >> 3] = d;
+              return;
+            }
+            function JO(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0,
+                d = 0.0;
+              c = +h[a >> 3] - +h[b >> 3];
+              d = +h[(a + 8) >> 3] - +h[(b + 8) >> 3];
+              return +(+C(+(d * d + c * c)));
+            }
+            function KO(a) {
+              a = a | 0;
+              var b = 0;
+              b = c[(a + 4) >> 2] | 0;
+              if ((c[(a + 8) >> 2] | 0) > (b | 0)) c[a >> 2] = MK(c[a >> 2] | 0, b << 6) | 0;
+              return;
+            }
+            function LO(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 16) | 0;
+              j = (k + 8) | 0;
+              i = k;
+              g = (k + 12) | 0;
+              c[g >> 2] = 0;
+              h = c[(d + 4) >> 2] | 0;
+              if (!h) qa(106658, 106669, 203, 106680);
+              e = c[h >> 2] | 0;
+              if (!e) qa(106694, 106669, 206, 106680);
+              f = (h + 8) | 0;
+              if (!(c[f >> 2] | 0)) c[f >> 2] = MO(e) | 0;
+              if (!0) e = 0;
+              else {
+                e = (PJ(c[h >> 2] | 0) | 0) == 0;
+                e = e ? 0 : g;
+              }
+              if (!(((dT(b, d, e) | 0) << 24) >> 24)) NO(d, e);
+              do
+                if (e | 0) {
+                  f = c[g >> 2] | 0;
+                  b = c[15712] | 0;
+                  e = c[h >> 2] | 0;
+                  if (!f) {
+                    c[j >> 2] = e;
+                    w4(b, 106737, j) | 0;
+                    break;
+                  } else {
+                    c[i >> 2] = e;
+                    c[(i + 4) >> 2] = f;
+                    w4(b, 106705, i) | 0;
+                    break;
+                  }
+                }
+              while (0);
+              j = (d + 32) | 0;
+              c[a >> 2] = c[j >> 2];
+              c[(a + 4) >> 2] = c[(j + 4) >> 2];
+              c[(a + 8) >> 2] = c[(j + 8) >> 2];
+              c[(a + 12) >> 2] = c[(j + 12) >> 2];
+              l = k;
+              return;
+            }
+            function MO(a) {
+              a = a | 0;
+              var b = 0;
+              b = c[47301] | 0;
+              if ((b | 0) != 0 ? (c3(b, a) | 0) == 0 : 0) a = c[47310] | 0;
+              else {
+                U1(b);
+                c[47301] = D4(a) | 0;
+                a = u5(189204, 22332, 35, 36, 95) | 0;
+                c[47310] = a;
+              }
+              return a | 0;
+            }
+            function NO(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                g = 0,
+                i = 0.0,
+                j = 0,
+                k = 0.0;
+              j = c[(b + 4) >> 2] | 0;
+              e = c[j >> 2] | 0;
+              i = +h[(j + 16) >> 3];
+              j = (b + 32) | 0;
+              h[j >> 3] = 0.0;
+              h[(b + 40) >> 3] = i * 1.2;
+              h[(b + 16) >> 3] = 0.0;
+              h[(b + 24) >> 3] = i * 0.1;
+              c[(b + 8) >> 2] = 0;
+              c[(b + 12) >> 2] = 0;
+              if (j3(e, 106771, 4) | 0)
+                if ((j3(e, 106776, 5) | 0) != 0 ? (j3(e, 106782, 9) | 0) != 0 : 0) {
+                  g = 4248;
+                  e = 106792;
+                } else {
+                  g = 8344;
+                  e = 106828;
+                }
+              else {
+                g = 6296;
+                e = 106809;
+              }
+              if (d | 0) c[d >> 2] = e;
+              e = c[b >> 2] | 0;
+              if (e | 0) {
+                f = 0.0;
+                while (1) {
+                  b = a[e >> 0] | 0;
+                  if (!((b << 24) >> 24)) break;
+                  k = f + +h[(g + ((b & 255) << 3)) >> 3];
+                  h[j >> 3] = k;
+                  e = (e + 1) | 0;
+                  f = k;
+                }
+                h[j >> 3] = f * i;
+              }
+              return;
+            }
+            function OO(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return c3(c[a >> 2] | 0, c[b >> 2] | 0) | 0;
+            }
+            function PO(a) {
+              a = a | 0;
+              var b = 0;
+              b = (a + 108) | 0;
+              c[b >> 2] = 0;
+              c[(a + 112) >> 2] = 32;
+              c[(a + 116) >> 2] = -1;
+              c[(a + 120) >> 2] = 33;
+              c[(a + 124) >> 2] = 63;
+              c[(a + 128) >> 2] = 55;
+              c[(a + 132) >> 2] = 0;
+              c[(a + 136) >> 2] = 0;
+              c[(a + 140) >> 2] = 0;
+              b = Vz(b, c[4581] | 0) | 0;
+              c[(a + 144) >> 2] = b;
+              return b | 0;
+            }
+            function QO(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              d = V1(1, 32) | 0;
+              a = c[b >> 2] | 0;
+              if (a | 0) c[d >> 2] = D4(a) | 0;
+              a = c[(b + 4) >> 2] | 0;
+              if (a | 0) c[(d + 4) >> 2] = D4(a) | 0;
+              c[(d + 24) >> 2] = c[(b + 24) >> 2] & 127;
+              h[(d + 16) >> 3] = +h[(b + 16) >> 3];
+              c[(d + 8) >> 2] = c[(b + 8) >> 2];
+              return d | 0;
+            }
+            function RO(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              U1(c[b >> 2] | 0);
+              U1(c[(b + 4) >> 2] | 0);
+              U1(b);
+              return;
+            }
+            function SO(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0.0,
+                g = 0.0,
+                i = 0,
+                j = 0;
+              a = c[b >> 2] | 0;
+              e = c[d >> 2] | 0;
+              i = (e | 0) == 0;
+              if (!a)
+                if (i) j = 5;
+                else a = -1;
+              else if (!i) {
+                a = s2(a, e) | 0;
+                if (!a) j = 5;
+              } else a = 1;
+              do
+                if ((j | 0) == 5) {
+                  a = c[(b + 4) >> 2] | 0;
+                  e = c[(d + 4) >> 2] | 0;
+                  i = (e | 0) == 0;
+                  if (!a) {
+                    if (!i) {
+                      a = -1;
+                      break;
+                    }
+                  } else {
+                    if (i) {
+                      a = 1;
+                      break;
+                    }
+                    a = s2(a, e) | 0;
+                    if (a | 0) break;
+                  }
+                  a = ((c[(b + 24) >> 2] & 127) - (c[(d + 24) >> 2] & 127)) | 0;
+                  if (!a) {
+                    g = +h[(b + 16) >> 3];
+                    f = +h[(d + 16) >> 3];
+                    if (g < f) a = -1;
+                    else a = (g > f) & 1;
+                  }
+                }
+              while (0);
+              return a | 0;
+            }
+            function TO() {
+              eb(189244) | 0;
+              return;
+            }
+            function UO() {
+              var a = 0,
+                b = 0;
+              b = l;
+              l = (l + 16) | 0;
+              a = b;
+              eb(a | 0) | 0;
+              l = b;
+              return +(
+                +(((c[(a + 4) >> 2] | 0) + (c[a >> 2] | 0) - (c[47311] | 0) - (c[47312] | 0)) | 0) *
+                0.016666666666666666
+              );
+            }
+            function VO(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = JK(16) | 0;
+              a = (a | 0) > 2 ? a : 2;
+              d = JK(a << 2) | 0;
+              c[b >> 2] = d;
+              c[(b + 12) >> 2] = d;
+              c[(b + 8) >> 2] = d;
+              c[(b + 4) >> 2] = d + (a << 2);
+              return b | 0;
+            }
+            function WO(a) {
+              a = a | 0;
+              U1(c[a >> 2] | 0);
+              U1(a);
+              return;
+            }
+            function XO(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = (a + 12) | 0;
+              e = c[d >> 2] | 0;
+              c[d >> 2] = e + 4;
+              c[e >> 2] = b;
+              if ((c[d >> 2] | 0) >>> 0 >= (c[(a + 4) >> 2] | 0) >>> 0) c[d >> 2] = c[a >> 2];
+              return;
+            }
+            function YO(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              d = (a + 8) | 0;
+              b = c[d >> 2] | 0;
+              if ((b | 0) != (c[(a + 12) >> 2] | 0)) {
+                e = (b + 4) | 0;
+                c[d >> 2] = e;
+                b = c[b >> 2] | 0;
+                if (e >>> 0 >= (c[(a + 4) >> 2] | 0) >>> 0) c[d >> 2] = c[a >> 2];
+              } else b = 0;
+              return b | 0;
+            }
+            function ZO(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 16) | 0;
+              g = i;
+              if (((d | 0) != 0 ? ((h = RA(b, d) | 0), (h | 0) != 0) : 0) ? (a[h >> 0] | 0) != 0 : 0) {
+                d = y4(h, g, 10) | 0;
+                e = (h | 0) == (c[g >> 2] | 0) ? e : (d | 0) < (f | 0) ? f : d;
+              }
+              l = i;
+              return e | 0;
+            }
+            function _O(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = +e;
+              f = +f;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0.0;
+              i = l;
+              l = (l + 16) | 0;
+              g = i;
+              if (
+                (((b | 0) != 0) & ((d | 0) != 0) ? ((h = RA(b, d) | 0), (h | 0) != 0) : 0) ? (a[h >> 0] | 0) != 0 : 0
+              ) {
+                j = +s5(h, g);
+                e = (h | 0) == (c[g >> 2] | 0) ? e : j < f ? f : j;
+              }
+              l = i;
+              return +e;
+            }
+            function $O(a) {
+              a = a | 0;
+              var b = 0.0;
+              b = +h[23293];
+              if (!(b > 0.0)) {
+                b = +_O(a, GA(a, 0, 107638, 0) | 0, -1.0, 0.0);
+                b = b == 0.0 ? 72.0 : b;
+              }
+              return +b;
+            }
+            function aP(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              if (((a | 0) != 0) & ((b | 0) != 0)) c = RA(a, b) | 0;
+              return c | 0;
+            }
+            function bP(b, c, d) {
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              b = aP(b, c, d) | 0;
+              if ((b | 0) != 0 ? (a[b >> 0] | 0) != 0 : 0) d = b;
+              return d | 0;
+            }
+            function cP(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              if (!b) a = c & 255;
+              else a = dP(RA(a, b) | 0) | 0;
+              return a | 0;
+            }
+            function dP(a) {
+              a = a | 0;
+              return eP(a, 0) | 0;
+            }
+            function eP(b, c) {
+              b = b | 0;
+              c = c | 0;
+              var d = 0;
+              if ((b | 0) != 0 ? ((d = a[b >> 0] | 0), (d << 24) >> 24 != 0) : 0)
+                if ((c3(b, 137308) | 0) != 0 ? (c3(b, 107649) | 0) != 0 : 0)
+                  if ((c3(b, 107652) | 0) != 0 ? (c3(b, 107657) | 0) != 0 : 0) {
+                    if (((((d << 24) >> 24) + -48) | 0) >>> 0 < 10) c = (q5(b) | 0) & 255;
+                  } else c = 1;
+                else c = 0;
+              return c | 0;
+            }
+            function fP(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              while (1) {
+                b = ((c[(a + 16) >> 2] | 0) + 220) | 0;
+                d = c[b >> 2] | 0;
+                if (!(((d | 0) != (a | 0)) & ((d | 0) != 0))) break;
+                a = c[((c[(d + 16) >> 2] | 0) + 220) >> 2] | 0;
+                if (!a) {
+                  a = d;
+                  continue;
+                }
+                c[b >> 2] = a;
+              }
+              return a | 0;
+            }
+            function gP(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              if ((a | 0) != (b | 0)) {
+                d = c[(a + 16) >> 2] | 0;
+                e = (d + 220) | 0;
+                if (!(c[e >> 2] | 0)) {
+                  c[e >> 2] = a;
+                  c[(d + 216) >> 2] = 1;
+                } else a = fP(a) | 0;
+                d = c[(b + 16) >> 2] | 0;
+                e = (d + 220) | 0;
+                if (!(c[e >> 2] | 0)) {
+                  c[e >> 2] = b;
+                  c[(d + 216) >> 2] = 1;
+                } else {
+                  d = fP(b) | 0;
+                  b = d;
+                  d = c[(d + 16) >> 2] | 0;
+                }
+                g = (a + 16) | 0;
+                e = c[g >> 2] | 0;
+                f = (b + 16) | 0;
+                h = (c[(e + 120) >> 2] | 0) > (c[(d + 120) >> 2] | 0);
+                a = h ? b : a;
+                c[((h ? e : d) + 220) >> 2] = a;
+                e = ((c[(h ? f : g) >> 2] | 0) + 216) | 0;
+                c[e >> 2] = (c[e >> 2] | 0) + (c[((c[(h ? g : f) >> 2] | 0) + 216) >> 2] | 0);
+              }
+              return a | 0;
+            }
+            function hP(b) {
+              b = b | 0;
+              b = c[(b + 16) >> 2] | 0;
+              c[(b + 216) >> 2] = 1;
+              c[(b + 220) >> 2] = 0;
+              a[(b + 159) >> 0] = 0;
+              return;
+            }
+            function iP(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if ((fP(a) | 0) == (a | 0)) {
+                a = c[(a + 16) >> 2] | 0;
+                c[(a + 220) >> 2] = b;
+                b = ((c[(b + 16) >> 2] | 0) + 216) | 0;
+                c[b >> 2] = (c[b >> 2] | 0) + (c[(a + 216) >> 2] | 0);
+                return;
+              } else qa(107669, 107661, 194, 107685);
+            }
+            function jP(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0;
+              b = c[((c[(b + 16) >> 2] | 0) + 132) >> 2] | 0;
+              d = +h[(b + 8) >> 3] * 72.0;
+              h[a >> 3] = +h[b >> 3] * 72.0;
+              h[(a + 8) >> 3] = d;
+              return;
+            }
+            function kP(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = +e;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0.0,
+                n = 0,
+                o = 0,
+                p = 0;
+              o = l;
+              l = (l + 576) | 0;
+              n = o;
+              i = 0;
+              while (1) {
+                if ((i | 0) > (d | 0)) break;
+                k = (n + (i << 4)) | 0;
+                j = (b + (i << 4)) | 0;
+                c[k >> 2] = c[j >> 2];
+                c[(k + 4) >> 2] = c[(j + 4) >> 2];
+                c[(k + 8) >> 2] = c[(j + 8) >> 2];
+                c[(k + 12) >> 2] = c[(j + 12) >> 2];
+                i = (i + 1) | 0;
+              }
+              m = 1.0 - e;
+              i = 1;
+              while (1) {
+                if ((i | 0) > (d | 0)) break;
+                j = (d - i) | 0;
+                k = (i + -1) | 0;
+                b = 0;
+                while (1) {
+                  if ((b | 0) > (j | 0)) break;
+                  p = (b + 1) | 0;
+                  h[(n + ((i * 96) | 0) + (b << 4)) >> 3] =
+                    +h[(n + ((k * 96) | 0) + (p << 4)) >> 3] * e + +h[(n + ((k * 96) | 0) + (b << 4)) >> 3] * m;
+                  h[(n + ((i * 96) | 0) + (b << 4) + 8) >> 3] =
+                    +h[(n + ((k * 96) | 0) + (p << 4) + 8) >> 3] * e + +h[(n + ((k * 96) | 0) + (b << 4) + 8) >> 3] * m;
+                  b = p;
+                }
+                i = (i + 1) | 0;
+              }
+              a: do
+                if (f | 0) {
+                  i = 0;
+                  while (1) {
+                    if ((i | 0) > (d | 0)) break a;
+                    p = (f + (i << 4)) | 0;
+                    k = (n + ((i * 96) | 0)) | 0;
+                    c[p >> 2] = c[k >> 2];
+                    c[(p + 4) >> 2] = c[(k + 4) >> 2];
+                    c[(p + 8) >> 2] = c[(k + 8) >> 2];
+                    c[(p + 12) >> 2] = c[(k + 12) >> 2];
+                    i = (i + 1) | 0;
+                  }
+                }
+              while (0);
+              b: do
+                if (g | 0) {
+                  i = 0;
+                  while (1) {
+                    if ((i | 0) > (d | 0)) break b;
+                    p = (g + (i << 4)) | 0;
+                    f = (n + ((((d - i) | 0) * 96) | 0) + (i << 4)) | 0;
+                    c[p >> 2] = c[f >> 2];
+                    c[(p + 4) >> 2] = c[(f + 4) >> 2];
+                    c[(p + 8) >> 2] = c[(f + 8) >> 2];
+                    c[(p + 12) >> 2] = c[(f + 12) >> 2];
+                    i = (i + 1) | 0;
+                  }
+                }
+              while (0);
+              p = (n + ((d * 96) | 0)) | 0;
+              c[a >> 2] = c[p >> 2];
+              c[(a + 4) >> 2] = c[(p + 4) >> 2];
+              c[(a + 8) >> 2] = c[(p + 8) >> 2];
+              c[(a + 12) >> 2] = c[(p + 12) >> 2];
+              l = o;
+              return;
+            }
+            function lP(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              e = 0;
+              do {
+                d = c[47315] | 0;
+                f = (d + 1024) | 0;
+                if (((d - e) | 0) < 1024) {
+                  c[47315] = f;
+                  f = MK(c[47316] | 0, f) | 0;
+                  c[47316] = f;
+                  d = c[47315] | 0;
+                } else f = c[47316] | 0;
+                d = c4((f + e) | 0, (d - e) | 0, b) | 0;
+                if (!d) {
+                  g = 6;
+                  break;
+                }
+                e = ((l2(d) | 0) + e) | 0;
+                d = c[47316] | 0;
+              } while ((a[(d + (e + -1)) >> 0] | 0) != 10);
+              if ((g | 0) == 6) d = c[47316] | 0;
+              return ((e | 0) > 0 ? d : 0) | 0;
+            }
+            function mP(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              f = l;
+              l = (l + 16) | 0;
+              do
+                if ((b | 0) != 0 ? (a[b >> 0] | 0) != 0 : 0)
+                  if (!0) {
+                    d = c[47133] | 0;
+                    e = c[47318] | 0;
+                    if ((c[47317] | 0) == (d | 0)) d = e;
+                    else {
+                      if (e) {
+                        U1(c[e >> 2] | 0);
+                        U1(c[47318] | 0);
+                        c[47318] = 0;
+                        d = c[47133] | 0;
+                      }
+                      c[47317] = d;
+                      if (!d) break;
+                      if (!(a[d >> 0] | 0)) break;
+                      d = nP(d) | 0;
+                      c[47318] = d;
+                    }
+                    if (!(((a[b >> 0] | 0) != 47) & ((d | 0) != 0))) break;
+                    b = oP(d, c[47319] | 0, b) | 0;
+                    break;
+                  } else S();
+                else b = 0;
+              while (0);
+              l = f;
+              return b | 0;
+            }
+            function nP(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              e = 0;
+              f = 0;
+              g = 0;
+              b = D4(a) | 0;
+              d = 0;
+              while (1) {
+                b = A4(b, 107984) | 0;
+                if (!b) break;
+                a = ((g << 2) + 8) | 0;
+                if (!f) a = KK(a) | 0;
+                else a = MK(d, a) | 0;
+                c[(a + (g << 2)) >> 2] = b;
+                f = l2(b) | 0;
+                e = e >>> 0 > f >>> 0 ? e : f;
+                f = a;
+                g = (g + 1) | 0;
+                b = 0;
+                d = a;
+              }
+              c[(f + (g << 2)) >> 2] = 0;
+              c[47319] = e;
+              return f | 0;
+            }
+            function oP(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              g = l;
+              l = (l + 16) | 0;
+              e = g;
+              h = c[47320] | 0;
+              c[47320] = W1(h, (b + 2 + (l2(d) | 0)) | 0) | 0;
+              while (1) {
+                b = c[a >> 2] | 0;
+                if (!b) {
+                  a = 0;
+                  break;
+                }
+                h = c[47320] | 0;
+                c[e >> 2] = b;
+                c[(e + 4) >> 2] = 107982;
+                c[(e + 8) >> 2] = d;
+                m4(h, 107975, e) | 0;
+                if (!(_4(c[47320] | 0, 4) | 0)) {
+                  f = 4;
+                  break;
+                } else a = (a + 4) | 0;
+              }
+              if ((f | 0) == 4) a = c[47320] | 0;
+              l = g;
+              return a | 0;
+            }
+            function pP(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              g = (b | 0) == 0;
+              f = 0;
+              while (1) {
+                h = c[(d + (f << 2)) >> 2] | 0;
+                if (!h) break;
+                if ((!g ? (a[b >> 0] | 0) == (a[h >> 0] | 0) : 0) ? (s2(b, h) | 0) == 0 : 0) break;
+                f = (f + 1) | 0;
+              }
+              return c[(e + (f << 2)) >> 2] | 0;
+            }
+            function qP(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                C = 0;
+              z = l;
+              l = (l + 80) | 0;
+              x = (z + 16) | 0;
+              y = z;
+              u = c[(b + 4) >> 2] | 0;
+              v = c[b >> 2] | 0;
+              w = (d + 8) | 0;
+              f = 0;
+              e = -1;
+              g = 1e38;
+              b = -1;
+              while (1) {
+                if ((f | 0) >= (u | 0)) break;
+                s = c[(v + ((f * 48) | 0)) >> 2] | 0;
+                t = c[(v + ((f * 48) | 0) + 4) >> 2] | 0;
+                r = 0;
+                while (1) {
+                  if ((r | 0) >= (t | 0)) break;
+                  q = +h[(s + (r << 4)) >> 3] - +h[d >> 3];
+                  p = +h[(s + (r << 4) + 8) >> 3] - +h[w >> 3];
+                  q = p * p + q * q;
+                  A = ((e | 0) == -1) | (q < g);
+                  C = A ? r : e;
+                  r = (r + 1) | 0;
+                  b = A ? f : b;
+                  e = C;
+                  g = A ? q : g;
+                }
+                f = (f + 1) | 0;
+              }
+              f = c[(v + ((b * 48) | 0)) >> 2] | 0;
+              e = (e + ((((e | 0) == (((c[(v + ((b * 48) | 0) + 4) >> 2] | 0) + -1) | 0)) << 31) >> 31)) | 0;
+              e = (e - ((e | 0) % 3 | 0)) | 0;
+              b = 0;
+              while (1) {
+                if ((b | 0) == 4) break;
+                C = (b + e) | 0;
+                h[(x + (b << 4)) >> 3] = +h[(f + (C << 4)) >> 3];
+                h[(x + (b << 4) + 8) >> 3] = +h[(f + (C << 4) + 8) >> 3];
+                b = (b + 1) | 0;
+              }
+              q = +h[d >> 3];
+              k = +h[x >> 3] - q;
+              o = +h[w >> 3];
+              p = +h[(x + 8) >> 3] - o;
+              j = +h[(x + 48) >> 3] - q;
+              n = +h[(x + 56) >> 3] - o;
+              b = (y + 8) | 0;
+              g = 1.0;
+              i = 0.0;
+              j = n * n + j * j;
+              k = p * p + k * k;
+              while (1) {
+                p = (g + i) * 0.5;
+                kP(y, x, 3, p, 0, 0);
+                m = +h[y >> 3];
+                n = +h[b >> 3];
+                if (+B(+(k - j)) < 1.0) break;
+                if (+B(+(g - i)) < 1.0e-5) break;
+                C = k < j;
+                m = m - q;
+                n = n - o;
+                n = n * n + m * m;
+                g = C ? p : g;
+                i = C ? i : p;
+                j = C ? n : j;
+                k = C ? k : n;
+              }
+              h[a >> 3] = m;
+              h[(a + 8) >> 3] = n;
+              l = z;
+              return;
+            }
+            function rP() {
+              return 0;
+            }
+            function sP(b) {
+              b = b | 0;
+              var d = 0.0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              d = +_O(b, c[47146] | 0, 0.75, 0.01);
+              g = (b + 16) | 0;
+              h[((c[g >> 2] | 0) + 32) >> 3] = d;
+              d = +_O(b, c[47145] | 0, 0.5, 0.02);
+              h[((c[g >> 2] | 0) + 40) >> 3] = d;
+              l = jN(bP(b, c[47147] | 0, 107986) | 0, b) | 0;
+              c[((c[g >> 2] | 0) + 8) >> 2] = l;
+              l = RA(b, c[47154] | 0) | 0;
+              d = +_O(b, c[47150] | 0, 14.0, 1.0);
+              e = bP(b, c[47151] | 0, 107994) | 0;
+              f = bP(b, c[47152] | 0, 137314) | 0;
+              i = (iD(l) | 0) != 0;
+              k = (WM(b) | 0) == 2;
+              i = zK(b, l, (k ? 4 : 0) | (i ? 2 : 0), d, e, f) | 0;
+              c[((c[g >> 2] | 0) + 104) >> 2] = i;
+              i = c[47155] | 0;
+              if ((i | 0 ? ((j = RA(b, i) | 0), j | 0) : 0) ? a[j >> 0] | 0 : 0) {
+                l = (iD(j) | 0) != 0;
+                l = zK(b, j, l ? 2 : 0, d, e, f) | 0;
+                c[((c[g >> 2] | 0) + 108) >> 2] = l;
+                l = ((c[((xC(b) | 0) + 16) >> 2] | 0) + 113) | 0;
+                a[l >> 0] = a[l >> 0] | 16;
+              }
+              k = (ZO(b, c[47158] | 0, 0, 0) | 0) & 255;
+              l = c[g >> 2] | 0;
+              a[(l + 144) >> 0] = k;
+              tb[c[c[((c[(l + 8) >> 2] | 0) + 4) >> 2] >> 2] & 127](b);
+              return;
+            }
+            function tP(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0;
+              v = l;
+              l = (l + 112) | 0;
+              m = (v + 96) | 0;
+              n = (v + 80) | 0;
+              s = (v + 40) | 0;
+              u = v;
+              r = (b + 48) | 0;
+              p = xC(c[((((c[b >> 2] & 3) | 0) == 3 ? b : r) + 40) >> 2] | 0) | 0;
+              g = (m + 8) | 0;
+              c[g >> 2] = 0;
+              o = (n + 8) | 0;
+              c[o >> 2] = 0;
+              d = c[47182] | 0;
+              if (((d | 0) != 0 ? ((e = RA(b, d) | 0), (e | 0) != 0) : 0) ? (a[e >> 0] | 0) != 0 : 0) {
+                uP(b, m);
+                t = (iD(e) | 0) != 0;
+                i = +h[m >> 3];
+                f = c[g >> 2] | 0;
+                d = c[(m + 12) >> 2] | 0;
+                e = zK(b, e, t ? 2 : 0, i, f, d) | 0;
+                t = (b + 16) | 0;
+                c[((c[t >> 2] | 0) + 96) >> 2] = e;
+                e = ((c[(p + 16) >> 2] | 0) + 113) | 0;
+                a[e >> 0] = a[e >> 0] | 1;
+                e = dP(aP(b, c[47192] | 0, 137308) | 0) | 0;
+                a[((c[t >> 2] | 0) + 114) >> 0] = e;
+                t = 1;
+                e = f;
+              } else {
+                t = 0;
+                d = 0;
+                i = 0.0;
+                e = 0;
+              }
+              f = c[47183] | 0;
+              if ((f | 0 ? ((j = RA(b, f) | 0), j | 0) : 0) ? a[j >> 0] | 0 : 0) {
+                if (!e) {
+                  uP(b, m);
+                  i = +h[m >> 3];
+                  e = c[g >> 2] | 0;
+                  d = c[(m + 12) >> 2] | 0;
+                }
+                g = (iD(j) | 0) != 0;
+                j = zK(b, j, g ? 2 : 0, i, e, d) | 0;
+                c[((c[(b + 16) >> 2] | 0) + 108) >> 2] = j;
+                j = ((c[(p + 16) >> 2] | 0) + 113) | 0;
+                a[j >> 0] = a[j >> 0] | 32;
+              }
+              d = c[47197] | 0;
+              if (((d | 0) != 0 ? ((k = RA(b, d) | 0), (k | 0) != 0) : 0) ? (a[k >> 0] | 0) != 0 : 0) {
+                vP(b, m, n);
+                j = (iD(k) | 0) != 0;
+                i = +h[n >> 3];
+                d = c[o >> 2] | 0;
+                e = c[(n + 12) >> 2] | 0;
+                k = zK(b, k, j ? 2 : 0, i, d, e) | 0;
+                c[((c[(b + 16) >> 2] | 0) + 100) >> 2] = k;
+                k = ((c[(p + 16) >> 2] | 0) + 113) | 0;
+                a[k >> 0] = a[k >> 0] | 2;
+              } else {
+                e = 0;
+                i = 0.0;
+                d = 0;
+              }
+              f = c[47198] | 0;
+              if ((f | 0 ? ((q = RA(b, f) | 0), q | 0) : 0) ? a[q >> 0] | 0 : 0) {
+                if (!d) {
+                  vP(b, m, n);
+                  e = c[(n + 12) >> 2] | 0;
+                  i = +h[n >> 3];
+                  d = c[o >> 2] | 0;
+                }
+                o = (iD(q) | 0) != 0;
+                q = zK(b, q, o ? 2 : 0, i, d, e) | 0;
+                c[((c[(b + 16) >> 2] | 0) + 104) >> 2] = q;
+                q = ((c[(p + 16) >> 2] | 0) + 113) | 0;
+                a[q >> 0] = a[q >> 0] | 4;
+              }
+              d = QA(b, 111455) | 0;
+              d = d | 0 ? d : 195059;
+              if (a[d >> 0] | 0)
+                a[((c[((c[((((c[b >> 2] & 3) | 0) == 3 ? b : r) + 40) >> 2] | 0) + 16) >> 2] | 0) + 145) >> 0] = 1;
+              g = (b + 16) | 0;
+              f = ((c[g >> 2] | 0) + 16) | 0;
+              e = c[((((c[b >> 2] & 3) | 0) == 3 ? b : r) + 40) >> 2] | 0;
+              wP(s, c[((c[((c[((c[(e + 16) >> 2] | 0) + 8) >> 2] | 0) + 4) >> 2] | 0) + 8) >> 2] | 0, e, d);
+              d = s;
+              e = (f + 40) | 0;
+              do {
+                c[f >> 2] = c[d >> 2];
+                f = (f + 4) | 0;
+                d = (d + 4) | 0;
+              } while ((f | 0) < (e | 0));
+              if (((xP(b, c[47204] | 0) | 0) << 24) >> 24) a[((c[g >> 2] | 0) + 46) >> 0] = 0;
+              d = QA(b, 111464) | 0;
+              d = d | 0 ? d : 195059;
+              if (!(a[d >> 0] | 0)) e = (b + -48) | 0;
+              else {
+                e = (b + -48) | 0;
+                a[((c[((c[((((c[b >> 2] & 3) | 0) == 2 ? b : e) + 40) >> 2] | 0) + 16) >> 2] | 0) + 145) >> 0] = 1;
+              }
+              f = ((c[g >> 2] | 0) + 56) | 0;
+              e = c[((((c[b >> 2] & 3) | 0) == 2 ? b : e) + 40) >> 2] | 0;
+              wP(u, c[((c[((c[((c[(e + 16) >> 2] | 0) + 8) >> 2] | 0) + 4) >> 2] | 0) + 8) >> 2] | 0, e, d);
+              d = u;
+              e = (f + 40) | 0;
+              do {
+                c[f >> 2] = c[d >> 2];
+                f = (f + 4) | 0;
+                d = (d + 4) | 0;
+              } while ((f | 0) < (e | 0));
+              if (((xP(b, c[47205] | 0) | 0) << 24) >> 24) a[((c[g >> 2] | 0) + 86) >> 0] = 0;
+              l = v;
+              return t | 0;
+            }
+            function uP(a, b) {
+              a = a | 0;
+              b = b | 0;
+              h[b >> 3] = +_O(a, c[47179] | 0, 14.0, 1.0);
+              c[(b + 8) >> 2] = bP(a, c[47180] | 0, 107994) | 0;
+              c[(b + 12) >> 2] = bP(a, c[47181] | 0, 137314) | 0;
+              return;
+            }
+            function vP(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              e = (b + 8) | 0;
+              if (!(c[e >> 2] | 0)) uP(a, b);
+              h[d >> 3] = +_O(a, c[47199] | 0, +h[b >> 3], 1.0);
+              c[(d + 8) >> 2] = bP(a, c[47200] | 0, c[e >> 2] | 0) | 0;
+              c[(d + 12) >> 2] = bP(a, c[47201] | 0, c[(b + 12) >> 2] | 0) | 0;
+              return;
+            }
+            function wP(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              m = l;
+              l = (l + 128) | 0;
+              k = (m + 80) | 0;
+              h = (m + 40) | 0;
+              g = m;
+              if ((f | 0) != 0 ? ((j = R2(f, 58) | 0), (j | 0) != 0) : 0) {
+                a[j >> 0] = 0;
+                i = (j + 1) | 0;
+                xb[d & 31](h, e, f, i);
+                e = k;
+                g = h;
+                d = (e + 36) | 0;
+                do {
+                  c[e >> 2] = c[g >> 2];
+                  e = (e + 4) | 0;
+                  g = (g + 4) | 0;
+                } while ((e | 0) < (d | 0));
+                a[j >> 0] = 58;
+                f = i;
+              } else {
+                xb[d & 31](g, e, f, 0);
+                e = k;
+                d = (e + 36) | 0;
+                do {
+                  c[e >> 2] = c[g >> 2];
+                  e = (e + 4) | 0;
+                  g = (g + 4) | 0;
+                } while ((e | 0) < (d | 0));
+              }
+              e = b;
+              g = k;
+              d = (e + 36) | 0;
+              do {
+                c[e >> 2] = c[g >> 2];
+                e = (e + 4) | 0;
+                g = (g + 4) | 0;
+              } while ((e | 0) < (d | 0));
+              c[(b + 36) >> 2] = f;
+              l = m;
+              return;
+            }
+            function xP(b, c) {
+              b = b | 0;
+              c = c | 0;
+              var d = 0;
+              if (((c | 0) != 0 ? ((d = RA(b, c) | 0), (d | 0) != 0) : 0) ? (a[d >> 0] | 0) != 0 : 0)
+                b = (((dP(d) | 0) << 24) >> 24 == 0) & 1;
+              else b = 0;
+              return b | 0;
+            }
+            function yP(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0.0,
+                o = 0.0;
+              k = l;
+              l = (l + 32) | 0;
+              i = k;
+              j = c[(b + 8) >> 2] | 0;
+              d = c[(b + 4) >> 2] | 0;
+              d = ((c[(b + 44) >> 2] | 0) + ((O((d | 0) > 1 ? (d + -1) | 0 : 0, j) | 0) << 4)) | 0;
+              e = (i + 16) | 0;
+              c[e >> 2] = c[d >> 2];
+              c[(e + 4) >> 2] = c[(d + 4) >> 2];
+              c[(e + 8) >> 2] = c[(d + 8) >> 2];
+              c[(e + 12) >> 2] = c[(d + 12) >> 2];
+              c[i >> 2] = c[d >> 2];
+              c[(i + 4) >> 2] = c[(d + 4) >> 2];
+              c[(i + 8) >> 2] = c[(d + 8) >> 2];
+              c[(i + 12) >> 2] = c[(d + 12) >> 2];
+              f = (i + 8) | 0;
+              g = (i + 24) | 0;
+              b = 1;
+              while (1) {
+                if ((b | 0) >= (j | 0)) break;
+                m = (d + (b << 4)) | 0;
+                o = +h[m >> 3];
+                h[i >> 3] = +h[(+h[i >> 3] < o ? i : m) >> 3];
+                n = +h[(m + 8) >> 3];
+                h[f >> 3] = +h[((+h[f >> 3] < n ? i : m) + 8) >> 3];
+                h[e >> 3] = +h[(+h[e >> 3] > o ? e : m) >> 3];
+                h[g >> 3] = +h[((+h[g >> 3] > n ? e : m) + 8) >> 3];
+                b = (b + 1) | 0;
+              }
+              c[a >> 2] = c[i >> 2];
+              c[(a + 4) >> 2] = c[(i + 4) >> 2];
+              c[(a + 8) >> 2] = c[(i + 8) >> 2];
+              c[(a + 12) >> 2] = c[(i + 12) >> 2];
+              c[(a + 16) >> 2] = c[(i + 16) >> 2];
+              c[(a + 20) >> 2] = c[(i + 20) >> 2];
+              c[(a + 24) >> 2] = c[(i + 24) >> 2];
+              c[(a + 28) >> 2] = c[(i + 28) >> 2];
+              l = k;
+              return;
+            }
+            function zP(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              d = l;
+              l = (l + 64) | 0;
+              g = (d + 32) | 0;
+              e = d;
+              f = c[(a + 16) >> 2] | 0;
+              a = (f + 16) | 0;
+              f = c[(f + 116) >> 2] & 1;
+              c[g >> 2] = c[a >> 2];
+              c[(g + 4) >> 2] = c[(a + 4) >> 2];
+              c[(g + 8) >> 2] = c[(a + 8) >> 2];
+              c[(g + 12) >> 2] = c[(a + 12) >> 2];
+              c[(g + 16) >> 2] = c[(a + 16) >> 2];
+              c[(g + 20) >> 2] = c[(a + 20) >> 2];
+              c[(g + 24) >> 2] = c[(a + 24) >> 2];
+              c[(g + 28) >> 2] = c[(a + 28) >> 2];
+              AP(e, g, b, f);
+              c[a >> 2] = c[e >> 2];
+              c[(a + 4) >> 2] = c[(e + 4) >> 2];
+              c[(a + 8) >> 2] = c[(e + 8) >> 2];
+              c[(a + 12) >> 2] = c[(e + 12) >> 2];
+              c[(a + 16) >> 2] = c[(e + 16) >> 2];
+              c[(a + 20) >> 2] = c[(e + 20) >> 2];
+              c[(a + 24) >> 2] = c[(e + 24) >> 2];
+              c[(a + 28) >> 2] = c[(e + 28) >> 2];
+              l = d;
+              return;
+            }
+            function AP(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0.0,
+                l = 0.0,
+                m = 0.0;
+              g = +h[(d + 56) >> 3];
+              l = +h[(d + 64) >> 3];
+              j = (e << 24) >> 24 == 0;
+              k = +h[(d + 24) >> 3];
+              i = +h[(d + 32) >> 3];
+              m = (j ? k : i) * 0.5;
+              f = g - m;
+              g = m + g;
+              if (f < +h[b >> 3]) h[b >> 3] = f;
+              e = (b + 16) | 0;
+              if (g > +h[e >> 3]) h[e >> 3] = g;
+              g = (j ? i : k) * 0.5;
+              f = l - g;
+              g = g + l;
+              e = (b + 8) | 0;
+              if (f < +h[e >> 3]) h[e >> 3] = f;
+              e = (b + 24) | 0;
+              if (g > +h[e >> 3]) h[e >> 3] = g;
+              c[a >> 2] = c[b >> 2];
+              c[(a + 4) >> 2] = c[(b + 4) >> 2];
+              c[(a + 8) >> 2] = c[(b + 8) >> 2];
+              c[(a + 12) >> 2] = c[(b + 12) >> 2];
+              c[(a + 16) >> 2] = c[(b + 16) >> 2];
+              c[(a + 20) >> 2] = c[(b + 20) >> 2];
+              c[(a + 24) >> 2] = c[(b + 24) >> 2];
+              c[(a + 28) >> 2] = c[(b + 28) >> 2];
+              return;
+            }
+            function BP(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0.0,
+                N = 0.0,
+                O = 0.0,
+                P = 0.0;
+              L = l;
+              l = (l + 448) | 0;
+              H = (L + 416) | 0;
+              t = (L + 384) | 0;
+              u = (L + 304) | 0;
+              K = (L + 256) | 0;
+              G = (L + 192) | 0;
+              B = (L + 144) | 0;
+              C = (L + 96) | 0;
+              d = (L + 400) | 0;
+              e = (L + 368) | 0;
+              f = (L + 352) | 0;
+              g = (L + 336) | 0;
+              v = (L + 288) | 0;
+              w = (L + 224) | 0;
+              x = (L + 160) | 0;
+              y = (L + 112) | 0;
+              z = (L + 64) | 0;
+              A = (L + 32) | 0;
+              I = L;
+              J = (b + 16) | 0;
+              if ((tB(b) | 0) == 0 ? (c[((c[J >> 2] | 0) + 180) >> 2] | 0) == 0 : 0) {
+                CP(d, 0.0, 0.0);
+                c[K >> 2] = c[d >> 2];
+                c[(K + 4) >> 2] = c[(d + 4) >> 2];
+                c[(K + 8) >> 2] = c[(d + 8) >> 2];
+                c[(K + 12) >> 2] = c[(d + 12) >> 2];
+                K = (K + 16) | 0;
+                CP(e, 0.0, 0.0);
+                c[K >> 2] = c[e >> 2];
+                c[(K + 4) >> 2] = c[(e + 4) >> 2];
+                c[(K + 8) >> 2] = c[(e + 8) >> 2];
+                c[(K + 12) >> 2] = c[(e + 12) >> 2];
+              } else {
+                CP(f, 2147483647.0, 2147483647.0);
+                c[K >> 2] = c[f >> 2];
+                c[(K + 4) >> 2] = c[(f + 4) >> 2];
+                c[(K + 8) >> 2] = c[(f + 8) >> 2];
+                c[(K + 12) >> 2] = c[(f + 12) >> 2];
+                F = (K + 16) | 0;
+                CP(g, -2147483647.0, -2147483647.0);
+                c[F >> 2] = c[g >> 2];
+                c[(F + 4) >> 2] = c[(g + 4) >> 2];
+                c[(F + 8) >> 2] = c[(g + 8) >> 2];
+                c[(F + 12) >> 2] = c[(g + 12) >> 2];
+                o = (C + 8) | 0;
+                p = (u + 16) | 0;
+                D = (K + 8) | 0;
+                q = (u + 8) | 0;
+                E = (K + 24) | 0;
+                r = (u + 24) | 0;
+                s = (B + 8) | 0;
+                n = jC(b) | 0;
+                while (1) {
+                  if (!n) break;
+                  jP(B, n);
+                  d = (n + 16) | 0;
+                  m = c[d >> 2] | 0;
+                  h[C >> 3] = (+h[(m + 96) >> 3] + +h[(m + 88) >> 3]) * 0.5;
+                  h[o >> 3] = +h[(m + 80) >> 3] * 0.5;
+                  c[t >> 2] = c[B >> 2];
+                  c[(t + 4) >> 2] = c[(B + 4) >> 2];
+                  c[(t + 8) >> 2] = c[(B + 8) >> 2];
+                  c[(t + 12) >> 2] = c[(B + 12) >> 2];
+                  c[H >> 2] = c[C >> 2];
+                  c[(H + 4) >> 2] = c[(C + 4) >> 2];
+                  c[(H + 8) >> 2] = c[(C + 8) >> 2];
+                  c[(H + 12) >> 2] = c[(C + 12) >> 2];
+                  DP(u, t, H);
+                  c[t >> 2] = c[B >> 2];
+                  c[(t + 4) >> 2] = c[(B + 4) >> 2];
+                  c[(t + 8) >> 2] = c[(B + 8) >> 2];
+                  c[(t + 12) >> 2] = c[(B + 12) >> 2];
+                  c[H >> 2] = c[C >> 2];
+                  c[(H + 4) >> 2] = c[(C + 4) >> 2];
+                  c[(H + 8) >> 2] = c[(C + 8) >> 2];
+                  c[(H + 12) >> 2] = c[(C + 12) >> 2];
+                  EP(v, t, H);
+                  c[p >> 2] = c[v >> 2];
+                  c[(p + 4) >> 2] = c[(v + 4) >> 2];
+                  c[(p + 8) >> 2] = c[(v + 8) >> 2];
+                  c[(p + 12) >> 2] = c[(v + 12) >> 2];
+                  h[K >> 3] = +h[(+h[K >> 3] < +h[u >> 3] ? K : u) >> 3];
+                  h[D >> 3] = +h[((+h[D >> 3] < +h[q >> 3] ? K : u) + 8) >> 3];
+                  h[F >> 3] = +h[((+h[F >> 3] > +h[p >> 3] ? K : u) + 16) >> 3];
+                  h[E >> 3] = +h[((+h[E >> 3] > +h[r >> 3] ? K : u) + 24) >> 3];
+                  d = c[((c[d >> 2] | 0) + 108) >> 2] | 0;
+                  if (d | 0 ? a[(d + 81) >> 0] | 0 : 0) {
+                    m = c[((c[J >> 2] | 0) + 116) >> 2] & 1;
+                    c[H >> 2] = c[K >> 2];
+                    c[(H + 4) >> 2] = c[(K + 4) >> 2];
+                    c[(H + 8) >> 2] = c[(K + 8) >> 2];
+                    c[(H + 12) >> 2] = c[(K + 12) >> 2];
+                    c[(H + 16) >> 2] = c[(K + 16) >> 2];
+                    c[(H + 20) >> 2] = c[(K + 20) >> 2];
+                    c[(H + 24) >> 2] = c[(K + 24) >> 2];
+                    c[(H + 28) >> 2] = c[(K + 28) >> 2];
+                    AP(w, H, d, m);
+                    c[K >> 2] = c[w >> 2];
+                    c[(K + 4) >> 2] = c[(w + 4) >> 2];
+                    c[(K + 8) >> 2] = c[(w + 8) >> 2];
+                    c[(K + 12) >> 2] = c[(w + 12) >> 2];
+                    c[(K + 16) >> 2] = c[(w + 16) >> 2];
+                    c[(K + 20) >> 2] = c[(w + 20) >> 2];
+                    c[(K + 24) >> 2] = c[(w + 24) >> 2];
+                    c[(K + 28) >> 2] = c[(w + 28) >> 2];
+                  }
+                  m = XA(b, n) | 0;
+                  while (1) {
+                    if (!m) break;
+                    k = (m + 16) | 0;
+                    d = c[k >> 2] | 0;
+                    j = (d + 8) | 0;
+                    e = c[j >> 2] | 0;
+                    if (e | 0) {
+                      i = 0;
+                      while (1) {
+                        if ((i | 0) < (c[(e + 4) >> 2] | 0)) g = 0;
+                        else break;
+                        while (1) {
+                          f = c[e >> 2] | 0;
+                          if ((g | 0) >= (c[(f + ((i * 48) | 0) + 4) >> 2] | 0)) break;
+                          e = ((c[(f + ((i * 48) | 0)) >> 2] | 0) + (g << 4)) | 0;
+                          c[B >> 2] = c[e >> 2];
+                          c[(B + 4) >> 2] = c[(e + 4) >> 2];
+                          c[(B + 8) >> 2] = c[(e + 8) >> 2];
+                          c[(B + 12) >> 2] = c[(e + 12) >> 2];
+                          N = +h[B >> 3];
+                          h[K >> 3] = +h[(+h[K >> 3] < N ? K : B) >> 3];
+                          M = +h[s >> 3];
+                          h[D >> 3] = +h[((+h[D >> 3] < M ? K : B) + 8) >> 3];
+                          h[F >> 3] = +h[(+h[F >> 3] > N ? F : B) >> 3];
+                          h[E >> 3] = +h[((+h[E >> 3] > M ? F : B) + 8) >> 3];
+                          g = (g + 1) | 0;
+                          e = c[j >> 2] | 0;
+                        }
+                        i = (i + 1) | 0;
+                      }
+                      e = c[(d + 96) >> 2] | 0;
+                      if ((e | 0) != 0 ? (a[(e + 81) >> 0] | 0) != 0 : 0) {
+                        d = c[((c[J >> 2] | 0) + 116) >> 2] & 1;
+                        c[H >> 2] = c[K >> 2];
+                        c[(H + 4) >> 2] = c[(K + 4) >> 2];
+                        c[(H + 8) >> 2] = c[(K + 8) >> 2];
+                        c[(H + 12) >> 2] = c[(K + 12) >> 2];
+                        c[(H + 16) >> 2] = c[(K + 16) >> 2];
+                        c[(H + 20) >> 2] = c[(K + 20) >> 2];
+                        c[(H + 24) >> 2] = c[(K + 24) >> 2];
+                        c[(H + 28) >> 2] = c[(K + 28) >> 2];
+                        AP(x, H, e, d);
+                        c[K >> 2] = c[x >> 2];
+                        c[(K + 4) >> 2] = c[(x + 4) >> 2];
+                        c[(K + 8) >> 2] = c[(x + 8) >> 2];
+                        c[(K + 12) >> 2] = c[(x + 12) >> 2];
+                        c[(K + 16) >> 2] = c[(x + 16) >> 2];
+                        c[(K + 20) >> 2] = c[(x + 20) >> 2];
+                        c[(K + 24) >> 2] = c[(x + 24) >> 2];
+                        c[(K + 28) >> 2] = c[(x + 28) >> 2];
+                        d = c[k >> 2] | 0;
+                      }
+                      e = c[(d + 100) >> 2] | 0;
+                      if ((e | 0) != 0 ? (a[(e + 81) >> 0] | 0) != 0 : 0) {
+                        d = c[((c[J >> 2] | 0) + 116) >> 2] & 1;
+                        c[H >> 2] = c[K >> 2];
+                        c[(H + 4) >> 2] = c[(K + 4) >> 2];
+                        c[(H + 8) >> 2] = c[(K + 8) >> 2];
+                        c[(H + 12) >> 2] = c[(K + 12) >> 2];
+                        c[(H + 16) >> 2] = c[(K + 16) >> 2];
+                        c[(H + 20) >> 2] = c[(K + 20) >> 2];
+                        c[(H + 24) >> 2] = c[(K + 24) >> 2];
+                        c[(H + 28) >> 2] = c[(K + 28) >> 2];
+                        AP(y, H, e, d);
+                        c[K >> 2] = c[y >> 2];
+                        c[(K + 4) >> 2] = c[(y + 4) >> 2];
+                        c[(K + 8) >> 2] = c[(y + 8) >> 2];
+                        c[(K + 12) >> 2] = c[(y + 12) >> 2];
+                        c[(K + 16) >> 2] = c[(y + 16) >> 2];
+                        c[(K + 20) >> 2] = c[(y + 20) >> 2];
+                        c[(K + 24) >> 2] = c[(y + 24) >> 2];
+                        c[(K + 28) >> 2] = c[(y + 28) >> 2];
+                        d = c[k >> 2] | 0;
+                      }
+                      e = c[(d + 104) >> 2] | 0;
+                      if ((e | 0) != 0 ? (a[(e + 81) >> 0] | 0) != 0 : 0) {
+                        d = c[((c[J >> 2] | 0) + 116) >> 2] & 1;
+                        c[H >> 2] = c[K >> 2];
+                        c[(H + 4) >> 2] = c[(K + 4) >> 2];
+                        c[(H + 8) >> 2] = c[(K + 8) >> 2];
+                        c[(H + 12) >> 2] = c[(K + 12) >> 2];
+                        c[(H + 16) >> 2] = c[(K + 16) >> 2];
+                        c[(H + 20) >> 2] = c[(K + 20) >> 2];
+                        c[(H + 24) >> 2] = c[(K + 24) >> 2];
+                        c[(H + 28) >> 2] = c[(K + 28) >> 2];
+                        AP(z, H, e, d);
+                        c[K >> 2] = c[z >> 2];
+                        c[(K + 4) >> 2] = c[(z + 4) >> 2];
+                        c[(K + 8) >> 2] = c[(z + 8) >> 2];
+                        c[(K + 12) >> 2] = c[(z + 12) >> 2];
+                        c[(K + 16) >> 2] = c[(z + 16) >> 2];
+                        c[(K + 20) >> 2] = c[(z + 20) >> 2];
+                        c[(K + 24) >> 2] = c[(z + 24) >> 2];
+                        c[(K + 28) >> 2] = c[(z + 28) >> 2];
+                        d = c[k >> 2] | 0;
+                      }
+                      d = c[(d + 108) >> 2] | 0;
+                      if (d | 0 ? a[(d + 81) >> 0] | 0 : 0) {
+                        k = c[((c[J >> 2] | 0) + 116) >> 2] & 1;
+                        c[H >> 2] = c[K >> 2];
+                        c[(H + 4) >> 2] = c[(K + 4) >> 2];
+                        c[(H + 8) >> 2] = c[(K + 8) >> 2];
+                        c[(H + 12) >> 2] = c[(K + 12) >> 2];
+                        c[(H + 16) >> 2] = c[(K + 16) >> 2];
+                        c[(H + 20) >> 2] = c[(K + 20) >> 2];
+                        c[(H + 24) >> 2] = c[(K + 24) >> 2];
+                        c[(H + 28) >> 2] = c[(K + 28) >> 2];
+                        AP(A, H, d, k);
+                        c[K >> 2] = c[A >> 2];
+                        c[(K + 4) >> 2] = c[(A + 4) >> 2];
+                        c[(K + 8) >> 2] = c[(A + 8) >> 2];
+                        c[(K + 12) >> 2] = c[(A + 12) >> 2];
+                        c[(K + 16) >> 2] = c[(A + 16) >> 2];
+                        c[(K + 20) >> 2] = c[(A + 20) >> 2];
+                        c[(K + 24) >> 2] = c[(A + 24) >> 2];
+                        c[(K + 28) >> 2] = c[(A + 28) >> 2];
+                      }
+                    }
+                    m = ZA(b, m) | 0;
+                  }
+                  n = kC(b, n) | 0;
+                }
+                d = c[J >> 2] | 0;
+                f = c[(d + 180) >> 2] | 0;
+                g = (d + 184) | 0;
+                i = (G + 8) | 0;
+                j = (G + 16) | 0;
+                k = (G + 24) | 0;
+                e = 1;
+                while (1) {
+                  if ((e | 0) > (f | 0)) break;
+                  P = +h[((c[((c[((c[g >> 2] | 0) + (e << 2)) >> 2] | 0) + 16) >> 2] | 0) + 16) >> 3];
+                  h[G >> 3] = P;
+                  C = c[((c[((c[g >> 2] | 0) + (e << 2)) >> 2] | 0) + 16) >> 2] | 0;
+                  O = +h[(C + 24) >> 3];
+                  h[i >> 3] = O;
+                  M = +h[(C + 32) >> 3];
+                  h[j >> 3] = M;
+                  N = +h[(C + 40) >> 3];
+                  h[k >> 3] = N;
+                  h[K >> 3] = +h[(+h[K >> 3] < P ? K : G) >> 3];
+                  h[D >> 3] = +h[((+h[D >> 3] < O ? K : G) + 8) >> 3];
+                  h[F >> 3] = +h[((+h[F >> 3] > M ? K : G) + 16) >> 3];
+                  h[E >> 3] = +h[((+h[E >> 3] > N ? K : G) + 24) >> 3];
+                  e = (e + 1) | 0;
+                }
+                e = c[(d + 12) >> 2] | 0;
+                if ((e | 0) != 0 ? (a[(e + 81) >> 0] | 0) != 0 : 0) {
+                  d = c[(d + 116) >> 2] & 1;
+                  c[H >> 2] = c[K >> 2];
+                  c[(H + 4) >> 2] = c[(K + 4) >> 2];
+                  c[(H + 8) >> 2] = c[(K + 8) >> 2];
+                  c[(H + 12) >> 2] = c[(K + 12) >> 2];
+                  c[(H + 16) >> 2] = c[(K + 16) >> 2];
+                  c[(H + 20) >> 2] = c[(K + 20) >> 2];
+                  c[(H + 24) >> 2] = c[(K + 24) >> 2];
+                  c[(H + 28) >> 2] = c[(K + 28) >> 2];
+                  AP(I, H, e, d);
+                  c[K >> 2] = c[I >> 2];
+                  c[(K + 4) >> 2] = c[(I + 4) >> 2];
+                  c[(K + 8) >> 2] = c[(I + 8) >> 2];
+                  c[(K + 12) >> 2] = c[(I + 12) >> 2];
+                  c[(K + 16) >> 2] = c[(I + 16) >> 2];
+                  c[(K + 20) >> 2] = c[(I + 20) >> 2];
+                  c[(K + 24) >> 2] = c[(I + 24) >> 2];
+                  c[(K + 28) >> 2] = c[(I + 28) >> 2];
+                  d = c[J >> 2] | 0;
+                }
+                J = (d + 16) | 0;
+                c[J >> 2] = c[K >> 2];
+                c[(J + 4) >> 2] = c[(K + 4) >> 2];
+                c[(J + 8) >> 2] = c[(K + 8) >> 2];
+                c[(J + 12) >> 2] = c[(K + 12) >> 2];
+                c[(J + 16) >> 2] = c[(K + 16) >> 2];
+                c[(J + 20) >> 2] = c[(K + 20) >> 2];
+                c[(J + 24) >> 2] = c[(K + 24) >> 2];
+                c[(J + 28) >> 2] = c[(K + 28) >> 2];
+              }
+              l = L;
+              return;
+            }
+            function CP(a, b, c) {
+              a = a | 0;
+              b = +b;
+              c = +c;
+              h[a >> 3] = b;
+              h[(a + 8) >> 3] = c;
+              return;
+            }
+            function DP(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0;
+              d = +h[(b + 8) >> 3] - +h[(c + 8) >> 3];
+              h[a >> 3] = +h[b >> 3] - +h[c >> 3];
+              h[(a + 8) >> 3] = d;
+              return;
+            }
+            function EP(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0;
+              d = +h[(c + 8) >> 3] + +h[(b + 8) >> 3];
+              h[a >> 3] = +h[c >> 3] + +h[b >> 3];
+              h[(a + 8) >> 3] = d;
+              return;
+            }
+            function FP(a) {
+              a = a | 0;
+              if ((c[(a + 60) >> 2] | 0) == (a | 0)) a = 1;
+              else a = ((j3(KB(a) | 0, 108006, 7) | 0) == 0) & 1;
+              return a | 0;
+            }
+            function GP(a, b, c, d, e) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              a: do
+                if (!e)
+                  switch (IC(b) | 0) {
+                    case 0: {
+                      e = GA(a, 0, c, 195059) | 0;
+                      break a;
+                    }
+                    case 1: {
+                      e = GA(a, 1, c, 195059) | 0;
+                      break a;
+                    }
+                    case 2: {
+                      e = GA(a, 2, c, 195059) | 0;
+                      break a;
+                    }
+                    default: {
+                      e = 0;
+                      break a;
+                    }
+                  }
+              while (0);
+              KA(b, e, d) | 0;
+              return e | 0;
+            }
+            function HP(d) {
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 144) | 0;
+              g = k;
+              i = IP(d) | 0;
+              h = Vz(23592, c[4581] | 0) | 0;
+              j = ND(d, 108014, 1) | 0;
+              TC(j, 137483, 280, 1) | 0;
+              kA(g, 128, (k + 16) | 0);
+              e = jC(d) | 0;
+              while (1) {
+                if (!e) break;
+                a: do
+                  if (!(a[((c[(e + 16) >> 2] | 0) + 118) >> 0] | 0)) {
+                    f = XA(d, e) | 0;
+                    while (1) {
+                      if (!f) break a;
+                      JP(f, j, g, h, i);
+                      f = ZA(d, f) | 0;
+                    }
+                  }
+                while (0);
+                e = kC(d, e) | 0;
+              }
+              oA(g);
+              Rz(h) | 0;
+              f = tB(j) | 0;
+              e = jC(j) | 0;
+              while (1) {
+                if (!e) break;
+                h = kC(j, e) | 0;
+                wC(d, e) | 0;
+                e = h;
+              }
+              sB(j) | 0;
+              if (f | 0) {
+                j = ((c[(d + 16) >> 2] | 0) + 136) | 0;
+                b[j >> 1] = b[j >> 1] | 1;
+              }
+              Rz(i) | 0;
+              l = k;
+              return f | 0;
+            }
+            function IP(a) {
+              a = a | 0;
+              var b = 0;
+              b = Vz(23628, c[4581] | 0) | 0;
+              SP(a, b);
+              return b | 0;
+            }
+            function JP(b, d, e, f, g) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0;
+              t = l;
+              l = (l + 48) | 0;
+              q = (t + 32) | 0;
+              p = (t + 24) | 0;
+              s = (t + 16) | 0;
+              r = (t + 8) | 0;
+              k = t;
+              n = c[b >> 2] & 3;
+              m = c[(((n | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0;
+              n = c[(((n | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0;
+              do
+                if (!(a[((c[(n + 16) >> 2] | 0) + 118) >> 0] | 0)) {
+                  if (!(Q2(KB(m) | 0, 108006, 7) | 0)) o = KP(g, KB(m) | 0) | 0;
+                  else o = 0;
+                  if (!(Q2(KB(n) | 0, 108006, 7) | 0)) i = KP(g, KB(n) | 0) | 0;
+                  else i = 0;
+                  h = (o | 0) != 0;
+                  j = (i | 0) != 0;
+                  if (h | j) {
+                    if ((o | 0) == (i | 0)) {
+                      r = KB(m) | 0;
+                      s = KB(m) | 0;
+                      c[k >> 2] = r;
+                      c[(k + 4) >> 2] = s;
+                      gA(0, 108029, k) | 0;
+                      break;
+                    }
+                    g = LP(f, b) | 0;
+                    if (g | 0) {
+                      MP(b, c[(g + 16) >> 2] | 0, c[(g + 20) >> 2] | 0) | 0;
+                      break;
+                    }
+                    if (!j)
+                      if (!(HC(o, n) | 0)) {
+                        OP(f, m, n, MP(b, NP(m, o, e, d) | 0, n) | 0);
+                        break;
+                      } else {
+                        r = KB(n) | 0;
+                        s = KB(o) | 0;
+                        c[q >> 2] = r;
+                        c[(q + 4) >> 2] = s;
+                        gA(0, 108184, q) | 0;
+                        break;
+                      }
+                    if (!h)
+                      if (!(HC(i, m) | 0)) {
+                        OP(f, m, n, MP(b, m, NP(n, i, e, d) | 0) | 0);
+                        break;
+                      } else {
+                        r = KB(m) | 0;
+                        s = KB(i) | 0;
+                        c[p >> 2] = r;
+                        c[(p + 4) >> 2] = s;
+                        gA(0, 108147, p) | 0;
+                        break;
+                      }
+                    if (HC(i, o) | 0) {
+                      q = KB(o) | 0;
+                      s = KB(i) | 0;
+                      c[r >> 2] = q;
+                      c[(r + 4) >> 2] = s;
+                      gA(0, 108067, r) | 0;
+                      break;
+                    }
+                    if (!(HC(o, i) | 0)) {
+                      s = NP(m, o, e, d) | 0;
+                      OP(f, m, n, MP(b, s, NP(n, i, e, d) | 0) | 0);
+                      break;
+                    } else {
+                      q = KB(i) | 0;
+                      r = KB(o) | 0;
+                      c[s >> 2] = q;
+                      c[(s + 4) >> 2] = r;
+                      gA(0, 108107, s) | 0;
+                      break;
+                    }
+                  }
+                }
+              while (0);
+              l = t;
+              return;
+            }
+            function KP(a, b) {
+              a = a | 0;
+              b = b | 0;
+              a = nb[c[a >> 2] & 63](a, b, 512) | 0;
+              if (!a) a = 0;
+              else a = c[(a + 12) >> 2] | 0;
+              return a | 0;
+            }
+            function LP(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              d = l;
+              l = (l + 16) | 0;
+              e = d;
+              f = c[b >> 2] & 3;
+              c[e >> 2] = c[(((f | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2];
+              c[(e + 4) >> 2] = c[(((f | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2];
+              b = nb[c[a >> 2] & 63](a, e, 512) | 0;
+              l = d;
+              return b | 0;
+            }
+            function MP(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              c = iB(xC(b) | 0, b, c, 0, 1) | 0;
+              TC(c, 137460, 176, 1) | 0;
+              UA(a, c) | 0;
+              return c | 0;
+            }
+            function NP(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 112) | 0;
+              g = k;
+              j = (k + 4) | 0;
+              nA(e, 108221) | 0;
+              i = c[47321] | 0;
+              c[47321] = i + 1;
+              c[g >> 2] = i;
+              m4(j, 137395, g) | 0;
+              nA(e, j) | 0;
+              j = (e + 4) | 0;
+              g = c[j >> 2] | 0;
+              i = (e + 8) | 0;
+              if (g >>> 0 >= (c[i >> 2] | 0) >>> 0) {
+                lA(e, 1) | 0;
+                g = c[j >> 2] | 0;
+              }
+              c[j >> 2] = g + 1;
+              a[g >> 0] = 58;
+              nA(e, KB(d) | 0) | 0;
+              h = yC(d) | 0;
+              g = c[j >> 2] | 0;
+              if (g >>> 0 >= (c[i >> 2] | 0) >>> 0) {
+                lA(e, 1) | 0;
+                g = c[j >> 2] | 0;
+              }
+              a[g >> 0] = 0;
+              e = c[e >> 2] | 0;
+              c[j >> 2] = e;
+              j = tC(h, e, 1) | 0;
+              TC(j, 137447, 304, 1) | 0;
+              a[((c[(j + 16) >> 2] | 0) + 118) >> 0] = 1;
+              oC(d, j, 1) | 0;
+              oC(f, b, 1) | 0;
+              f = xC(j) | 0;
+              c[47154] = GP(f, j, 108224, 195059, c[47154] | 0) | 0;
+              f = xC(j) | 0;
+              c[47157] = GP(f, j, 141082, 134335, c[47157] | 0) | 0;
+              f = xC(j) | 0;
+              c[47147] = GP(f, j, 108230, 108236, c[47147] | 0) | 0;
+              l = k;
+              return j | 0;
+            }
+            function OP(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              f = l;
+              l = (l + 32) | 0;
+              g = f;
+              n = (g + 8) | 0;
+              c[n >> 2] = b;
+              m = (g + 12) | 0;
+              c[m >> 2] = d;
+              o = c[e >> 2] & 3;
+              i = (e + 48) | 0;
+              j = (g + 16) | 0;
+              c[j >> 2] = c[(((o | 0) == 3 ? e : i) + 40) >> 2];
+              k = (e + -48) | 0;
+              h = (g + 20) | 0;
+              c[h >> 2] = c[(((o | 0) == 2 ? e : k) + 40) >> 2];
+              nb[c[a >> 2] & 63](a, g, 1) | 0;
+              c[n >> 2] = d;
+              c[m >> 2] = b;
+              d = c[e >> 2] & 3;
+              c[j >> 2] = c[(((d | 0) == 2 ? e : k) + 40) >> 2];
+              c[h >> 2] = c[(((d | 0) == 3 ? e : i) + 40) >> 2];
+              nb[c[a >> 2] & 63](a, g, 1) | 0;
+              l = f;
+              return;
+            }
+            function PP(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              d = JK(24) | 0;
+              c[(d + 8) >> 2] = c[(b + 8) >> 2];
+              c[(d + 12) >> 2] = c[(b + 12) >> 2];
+              c[(d + 16) >> 2] = c[(b + 16) >> 2];
+              c[(d + 20) >> 2] = c[(b + 20) >> 2];
+              return d | 0;
+            }
+            function QP(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              U1(b);
+              return;
+            }
+            function RP(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              a = c[b >> 2] | 0;
+              e = c[d >> 2] | 0;
+              if (a >>> 0 >= e >>> 0)
+                if (a >>> 0 > e >>> 0) a = 1;
+                else {
+                  b = c[(b + 4) >> 2] | 0;
+                  d = c[(d + 4) >> 2] | 0;
+                  return (b >>> 0 < d >>> 0 ? -1 : (b >>> 0 > d >>> 0) & 1) | 0;
+                }
+              else a = -1;
+              return a | 0;
+            }
+            function SP(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              h = l;
+              l = (l + 16) | 0;
+              g = h;
+              f = (a + 16) | 0;
+              e = 1;
+              while (1) {
+                a = c[f >> 2] | 0;
+                if ((e | 0) > (c[(a + 180) >> 2] | 0)) break;
+                a = c[((c[(a + 184) >> 2] | 0) + (e << 2)) >> 2] | 0;
+                d = KB(a) | 0;
+                if (!(nb[c[b >> 2] & 63](b, d, 512) | 0)) {
+                  i = JK(16) | 0;
+                  c[(i + 8) >> 2] = d;
+                  c[(i + 12) >> 2] = a;
+                  nb[c[b >> 2] & 63](b, i, 1) | 0;
+                } else {
+                  c[g >> 2] = d;
+                  gA(0, 108240, g) | 0;
+                }
+                SP(a, b);
+                e = (e + 1) | 0;
+              }
+              l = h;
+              return;
+            }
+            function TP(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              U1(b);
+              return;
+            }
+            function UP(a) {
+              a = a | 0;
+              var b = 0,
+                c = 0,
+                d = 0;
+              d = ND(a, 108014, 1) | 0;
+              TC(d, 137483, 280, 1) | 0;
+              b = jC(a) | 0;
+              while (1) {
+                if (!b) break;
+                c = XA(a, b) | 0;
+                while (1) {
+                  if (!c) break;
+                  VP(c, d);
+                  c = ZA(a, c) | 0;
+                }
+                b = kC(a, b) | 0;
+              }
+              b = jC(d) | 0;
+              while (1) {
+                if (!b) break;
+                c = kC(d, b) | 0;
+                WP(b);
+                wC(a, b) | 0;
+                b = c;
+              }
+              sB(d) | 0;
+              return;
+            }
+            function VP(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = c[b >> 2] & 3;
+              f = c[(((e | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0;
+              e = c[(((e | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0;
+              if (
+                !((a[((c[(f + 16) >> 2] | 0) + 118) >> 0] | 0) == 0 ? !(a[((c[(e + 16) >> 2] | 0) + 118) >> 0] | 0) : 0)
+              ) {
+                f = XP(f, d) | 0;
+                e = MP(b, f, XP(e, d) | 0) | 0;
+                f = c[(b + 16) >> 2] | 0;
+                d = (f + 8) | 0;
+                e = c[(e + 16) >> 2] | 0;
+                c[(e + 8) >> 2] = c[d >> 2];
+                c[d >> 2] = 0;
+                d = (f + 96) | 0;
+                c[(e + 96) >> 2] = c[d >> 2];
+                c[d >> 2] = 0;
+                d = (f + 108) | 0;
+                c[(e + 108) >> 2] = c[d >> 2];
+                c[d >> 2] = 0;
+                d = (f + 100) | 0;
+                c[(e + 100) >> 2] = c[d >> 2];
+                c[d >> 2] = 0;
+                f = (f + 104) | 0;
+                c[(e + 104) >> 2] = c[f >> 2];
+                c[f >> 2] = 0;
+                YP(b);
+              }
+              return;
+            }
+            function WP(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              e = (a + 16) | 0;
+              b = c[e >> 2] | 0;
+              d = c[(b + 132) >> 2] | 0;
+              if (d) {
+                U1(d);
+                b = c[e >> 2] | 0;
+              }
+              d = c[(b + 8) >> 2] | 0;
+              if (d) {
+                tb[c[((c[(d + 4) >> 2] | 0) + 4) >> 2] & 127](a);
+                b = c[e >> 2] | 0;
+              }
+              CK(c[(b + 104) >> 2] | 0);
+              CK(c[((c[e >> 2] | 0) + 108) >> 2] | 0);
+              VC(a, 137447) | 0;
+              return;
+            }
+            function XP(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              f = xC(b) | 0;
+              a: do
+                if (a[((c[(b + 16) >> 2] | 0) + 118) >> 0] | 0) {
+                  oC(d, b, 1) | 0;
+                  b = R2(KB(b) | 0, 58) | 0;
+                  if (!b) qa(111208, 107661, 1225, 108292);
+                  d = (b + 1) | 0;
+                  b = tC(f, d, 0) | 0;
+                  if (!b) {
+                    b = tC(f, d, 1) | 0;
+                    TC(b, 137447, 304, 1) | 0;
+                    d = LA(f, 1, 0) | 0;
+                    while (1) {
+                      if (!d) break a;
+                      g = RA(b, d) | 0;
+                      e = c[(d + 12) >> 2] | 0;
+                      if ((g | 0) != (e | 0)) KA(b, d, e) | 0;
+                      d = LA(f, 1, d) | 0;
+                    }
+                  }
+                }
+              while (0);
+              return b | 0;
+            }
+            function YP(a) {
+              a = a | 0;
+              var b = 0;
+              b = (a + 16) | 0;
+              U1(c[((c[b >> 2] | 0) + 144) >> 2] | 0);
+              ZP(a);
+              CK(c[((c[b >> 2] | 0) + 96) >> 2] | 0);
+              CK(c[((c[b >> 2] | 0) + 108) >> 2] | 0);
+              CK(c[((c[b >> 2] | 0) + 100) >> 2] | 0);
+              CK(c[((c[b >> 2] | 0) + 104) >> 2] | 0);
+              VC(a, 137460) | 0;
+              return;
+            }
+            function ZP(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              e = (a + 16) | 0;
+              a = c[e >> 2] | 0;
+              b = c[(a + 8) >> 2] | 0;
+              if (b) {
+                d = 0;
+                while (1) {
+                  a = c[b >> 2] | 0;
+                  if ((d | 0) >= (c[(b + 4) >> 2] | 0)) break;
+                  U1(c[(a + ((d * 48) | 0)) >> 2] | 0);
+                  d = (d + 1) | 0;
+                  b = c[((c[e >> 2] | 0) + 8) >> 2] | 0;
+                }
+                U1(a);
+                U1(c[((c[e >> 2] | 0) + 8) >> 2] | 0);
+                a = c[e >> 2] | 0;
+              }
+              c[(a + 8) >> 2] = 0;
+              return;
+            }
+            function _P(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0;
+              e = GA(a, b, c, 0) | 0;
+              if (!e) e = GA(a, b, c, d) | 0;
+              return e | 0;
+            }
+            function $P(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              o = l;
+              l = (l + 32) | 0;
+              i = o;
+              h = (o + 8) | 0;
+              j = (o + 16) | 0;
+              m = R2(b, 59) | 0;
+              n = (d + 4) | 0;
+              e = c[n >> 2] | 0;
+              k = (d + 8) | 0;
+              if (e >>> 0 >= (c[k >> 2] | 0) >>> 0) {
+                lA(d, 1) | 0;
+                e = c[n >> 2] | 0;
+              }
+              c[n >> 2] = e + 1;
+              a[e >> 0] = 38;
+              if (
+                ((m | 0) != 0 ? ((f = (m - b) | 0), ((f + -2) | 0) >>> 0 <= 6) : 0)
+                  ? (i4(j, b, f) | 0,
+                    (a[(j + f) >> 0] = 0),
+                    (c[h >> 2] = j),
+                    (g = u5(h, 23664, 252, 8, 96) | 0),
+                    (g | 0) != 0)
+                  : 0
+              ) {
+                c[i >> 2] = c[(g + 4) >> 2];
+                m4(j, 137395, i) | 0;
+                b = c[n >> 2] | 0;
+                if (b >>> 0 >= (c[k >> 2] | 0) >>> 0) {
+                  lA(d, 1) | 0;
+                  b = c[n >> 2] | 0;
+                }
+                c[n >> 2] = b + 1;
+                a[b >> 0] = 35;
+                nA(d, j) | 0;
+                b = c[n >> 2] | 0;
+                if (b >>> 0 >= (c[k >> 2] | 0) >>> 0) {
+                  lA(d, 1) | 0;
+                  b = c[n >> 2] | 0;
+                }
+                c[n >> 2] = b + 1;
+                a[b >> 0] = 59;
+                b = (m + 1) | 0;
+              }
+              l = o;
+              return b | 0;
+            }
+            function aQ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return s2(c[a >> 2] | 0, c[b >> 2] | 0) | 0;
+            }
+            function bQ(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              q = l;
+              l = (l + 1072) | 0;
+              k = (q + 8) | 0;
+              j = q;
+              i = (q + 16) | 0;
+              o = (q + 24) | 0;
+              c[i >> 2] = b;
+              if ((c[47322] | 0) != (d | 0)) {
+                c[47322] = d;
+                a[194958] = 0;
+              }
+              kA(o, 1024, (q + 40) | 0);
+              p = (o + 4) | 0;
+              n = (o + 8) | 0;
+              while (1) {
+                f = (b + 1) | 0;
+                c[i >> 2] = f;
+                e = a[b >> 0] | 0;
+                if (!((e << 24) >> 24)) break;
+                do
+                  if ((e & 255) < 192)
+                    if ((e << 24) >> 24 == 38) {
+                      f = dQ(i) | 0;
+                      if (!f) e = 38;
+                      else {
+                        if (f >>> 0 < 127) {
+                          e = f & 255;
+                          break;
+                        }
+                        b = c[p >> 2] | 0;
+                        e = b >>> 0 >= (c[n >> 2] | 0) >>> 0;
+                        if (f >>> 0 < 2047) {
+                          if (e) {
+                            lA(o, 1) | 0;
+                            b = c[p >> 2] | 0;
+                          }
+                          c[p >> 2] = b + 1;
+                          a[b >> 0] = (f >>> 6) | 192;
+                          e = ((f & 63) | 128) & 255;
+                          break;
+                        }
+                        if (e) {
+                          lA(o, 1) | 0;
+                          b = c[p >> 2] | 0;
+                        }
+                        c[p >> 2] = b + 1;
+                        a[b >> 0] = (f >>> 12) | 224;
+                        b = c[p >> 2] | 0;
+                        if (b >>> 0 >= (c[n >> 2] | 0) >>> 0) {
+                          lA(o, 1) | 0;
+                          b = c[p >> 2] | 0;
+                        }
+                        c[p >> 2] = b + 1;
+                        a[b >> 0] = ((f >>> 6) & 63) | 128;
+                        e = ((f & 63) | 128) & 255;
+                      }
+                    } else {
+                      h = 0;
+                      m = 9;
+                    }
+                  else if ((e & 255) >= 224)
+                    if ((e & 255) >= 240)
+                      if ((e & 255) < 248) {
+                        h = 3;
+                        m = 9;
+                      } else {
+                        if (!(a[194958] | 0)) {
+                          c[j >> 2] = KB(d) | 0;
+                          gA(0, 109707, j) | 0;
+                          a[194958] = 1;
+                        }
+                        h = -1;
+                        e = cQ(e, o) | 0;
+                        m = 9;
+                      }
+                    else {
+                      h = 2;
+                      m = 9;
+                    }
+                  else {
+                    h = 1;
+                    m = 9;
+                  }
+                while (0);
+                do
+                  if ((m | 0) == 9) {
+                    m = 0;
+                    g = 0;
+                    while (1) {
+                      if ((g | 0) >= (h | 0)) {
+                        m = 34;
+                        break;
+                      }
+                      if (((a[f >> 0] & -64) << 24) >> 24 != -128) break;
+                      b = c[p >> 2] | 0;
+                      if (b >>> 0 >= (c[n >> 2] | 0) >>> 0) {
+                        lA(o, 1) | 0;
+                        b = c[p >> 2] | 0;
+                      }
+                      c[p >> 2] = b + 1;
+                      a[b >> 0] = e;
+                      g = (g + 1) | 0;
+                      e = a[f >> 0] | 0;
+                      f = (f + 1) | 0;
+                    }
+                    if ((m | 0) == 34) {
+                      m = 0;
+                      c[i >> 2] = f;
+                      break;
+                    }
+                    c[i >> 2] = f;
+                    if (!(a[194958] | 0)) {
+                      g = KB(d) | 0;
+                      c[k >> 2] = h + 1;
+                      c[(k + 4) >> 2] = g;
+                      gA(0, 109828, k) | 0;
+                      a[194958] = 1;
+                    }
+                    e = cQ(e, o) | 0;
+                  }
+                while (0);
+                b = c[p >> 2] | 0;
+                if (b >>> 0 >= (c[n >> 2] | 0) >>> 0) {
+                  lA(o, 1) | 0;
+                  b = c[p >> 2] | 0;
+                }
+                c[p >> 2] = b + 1;
+                a[b >> 0] = e;
+                b = c[i >> 2] | 0;
+              }
+              b = c[p >> 2] | 0;
+              if (b >>> 0 >= (c[n >> 2] | 0) >>> 0) {
+                lA(o, 1) | 0;
+                b = c[p >> 2] | 0;
+              }
+              a[b >> 0] = 0;
+              n = c[o >> 2] | 0;
+              c[p >> 2] = n;
+              p = D4(n) | 0;
+              oA(o);
+              l = q;
+              return p | 0;
+            }
+            function cQ(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              j = l;
+              l = (l + 16) | 0;
+              g = j;
+              a[g >> 0] = b;
+              a[(g + 1) >> 0] = 0;
+              g = eQ(g) | 0;
+              h = (d + 4) | 0;
+              i = (d + 8) | 0;
+              e = l2(g) | 0;
+              f = g;
+              while (1) {
+                if ((e | 0) <= 1) break;
+                b = c[h >> 2] | 0;
+                if (b >>> 0 >= (c[i >> 2] | 0) >>> 0) {
+                  lA(d, 1) | 0;
+                  b = c[h >> 2] | 0;
+                }
+                k = a[f >> 0] | 0;
+                c[h >> 2] = b + 1;
+                a[b >> 0] = k;
+                e = (e + -1) | 0;
+                f = (f + 1) | 0;
+              }
+              k = a[f >> 0] | 0;
+              U1(g);
+              l = j;
+              return k | 0;
+            }
+            function dQ(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 32) | 0;
+              h = i;
+              d = (i + 8) | 0;
+              e = c[b >> 2] | 0;
+              a: do
+                if ((a[e >> 0] | 0) != 35) {
+                  c[h >> 2] = d;
+                  g = 0;
+                  b: while (1) {
+                    if ((g | 0) >= 8) {
+                      d = 0;
+                      break a;
+                    }
+                    f = a[(e + g) >> 0] | 0;
+                    switch ((f << 24) >> 24) {
+                      case 0: {
+                        d = 0;
+                        break a;
+                      }
+                      case 59:
+                        break b;
+                      default: {
+                      }
+                    }
+                    a[d >> 0] = f;
+                    d = (d + 1) | 0;
+                    g = (g + 1) | 0;
+                  }
+                  a[d >> 0] = 0;
+                  d = u5(h, 23664, 252, 8, 96) | 0;
+                  if (!d) d = 0;
+                  else {
+                    e = (e + (g + 1)) | 0;
+                    d = c[(d + 4) >> 2] | 0;
+                  }
+                } else {
+                  h = a[(e + 1) >> 0] | 0;
+                  d = h & 255;
+                  c: do
+                    if (((h | 32) << 24) >> 24 == 120) {
+                      h = 0;
+                      g = 2;
+                      while (1) {
+                        if ((g | 0) >= 8) {
+                          f = h;
+                          break c;
+                        }
+                        f = a[(e + g) >> 0] | 0;
+                        d = f & 255;
+                        if (((f + -65) & 255) >= 6)
+                          if (((f + -97) & 255) >= 6)
+                            if (((f + -48) & 255) < 10) f = -48;
+                            else {
+                              f = h;
+                              break c;
+                            }
+                          else f = -87;
+                        else f = -55;
+                        d = (f + d) | 0;
+                        h = (d + (h << 4)) | 0;
+                        g = (g + 1) | 0;
+                      }
+                    } else {
+                      f = 0;
+                      g = 1;
+                      while (1) {
+                        if ((g | 0) >= 8) break c;
+                        h = a[(e + g) >> 0] | 0;
+                        d = h & 255;
+                        if (((h + -48) & 255) >= 10) break c;
+                        f = (((f * 10) | 0) + -48 + d) | 0;
+                        g = (g + 1) | 0;
+                      }
+                    }
+                  while (0);
+                  d = (d | 0) == 59;
+                  e = d ? (e + (g + 1)) | 0 : e;
+                  d = d ? f : 0;
+                }
+              while (0);
+              c[b >> 2] = e;
+              l = i;
+              return d | 0;
+            }
+            function eQ(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 1056) | 0;
+              g = k;
+              i = (k + 8) | 0;
+              c[g >> 2] = b;
+              kA(i, 1024, (k + 24) | 0);
+              j = (i + 4) | 0;
+              h = (i + 8) | 0;
+              while (1) {
+                c[g >> 2] = b + 1;
+                d = a[b >> 0] | 0;
+                if (!((d << 24) >> 24)) break;
+                b = d & 255;
+                if ((d << 24) >> 24 == 38) {
+                  b = dQ(g) | 0;
+                  if (!b) {
+                    b = 38;
+                    f = 6;
+                  } else f = 5;
+                } else f = 5;
+                do
+                  if ((f | 0) == 5) {
+                    f = 0;
+                    if (b >>> 0 < 127) f = 6;
+                    else {
+                      d = c[j >> 2] | 0;
+                      e = d >>> 0 >= (c[h >> 2] | 0) >>> 0;
+                      if (b >>> 0 < 2047) {
+                        if (e) {
+                          lA(i, 1) | 0;
+                          d = c[j >> 2] | 0;
+                        }
+                        c[j >> 2] = d + 1;
+                        a[d >> 0] = (b >>> 6) | 192;
+                        d = c[j >> 2] | 0;
+                        if (d >>> 0 >= (c[h >> 2] | 0) >>> 0) {
+                          lA(i, 1) | 0;
+                          d = c[j >> 2] | 0;
+                        }
+                        b = (b & 63) | 128;
+                        break;
+                      }
+                      if (e) {
+                        lA(i, 1) | 0;
+                        d = c[j >> 2] | 0;
+                      }
+                      c[j >> 2] = d + 1;
+                      a[d >> 0] = (b >>> 12) | 224;
+                      d = c[j >> 2] | 0;
+                      if (d >>> 0 >= (c[h >> 2] | 0) >>> 0) {
+                        lA(i, 1) | 0;
+                        d = c[j >> 2] | 0;
+                      }
+                      c[j >> 2] = d + 1;
+                      a[d >> 0] = ((b >>> 6) & 63) | 128;
+                      d = c[j >> 2] | 0;
+                      if (d >>> 0 >= (c[h >> 2] | 0) >>> 0) {
+                        lA(i, 1) | 0;
+                        d = c[j >> 2] | 0;
+                      }
+                      b = (b & 63) | 128;
+                    }
+                  }
+                while (0);
+                if ((f | 0) == 6) {
+                  d = c[j >> 2] | 0;
+                  if (d >>> 0 >= (c[h >> 2] | 0) >>> 0) {
+                    lA(i, 1) | 0;
+                    d = c[j >> 2] | 0;
+                  }
+                }
+                c[j >> 2] = d + 1;
+                a[d >> 0] = b;
+                b = c[g >> 2] | 0;
+              }
+              b = c[j >> 2] | 0;
+              if (b >>> 0 >= (c[h >> 2] | 0) >>> 0) {
+                lA(i, 1) | 0;
+                b = c[j >> 2] | 0;
+              }
+              a[b >> 0] = 0;
+              h = c[i >> 2] | 0;
+              c[j >> 2] = h;
+              j = D4(h) | 0;
+              oA(i);
+              l = k;
+              return j | 0;
+            }
+            function fQ(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 1040) | 0;
+              g = i;
+              kA(g, 1024, (i + 16) | 0);
+              h = (g + 4) | 0;
+              f = (g + 8) | 0;
+              while (1) {
+                d = (b + 1) | 0;
+                e = a[b >> 0] | 0;
+                if (!((e << 24) >> 24)) break;
+                if ((e & 255) < 127) {
+                  b = c[h >> 2] | 0;
+                  if (b >>> 0 >= (c[f >> 2] | 0) >>> 0) {
+                    lA(g, 1) | 0;
+                    b = c[h >> 2] | 0;
+                  }
+                  c[h >> 2] = b + 1;
+                  a[b >> 0] = e;
+                  b = d;
+                  continue;
+                } else {
+                  e = (a[d >> 0] & 63) | ((e << 6) & 255);
+                  d = c[h >> 2] | 0;
+                  if (d >>> 0 >= (c[f >> 2] | 0) >>> 0) {
+                    lA(g, 1) | 0;
+                    d = c[h >> 2] | 0;
+                  }
+                  c[h >> 2] = d + 1;
+                  a[d >> 0] = e;
+                  b = (b + 2) | 0;
+                  continue;
+                }
+              }
+              b = c[h >> 2] | 0;
+              if (b >>> 0 >= (c[f >> 2] | 0) >>> 0) {
+                lA(g, 1) | 0;
+                b = c[h >> 2] | 0;
+              }
+              a[b >> 0] = 0;
+              f = c[g >> 2] | 0;
+              c[h >> 2] = f;
+              h = D4(f) | 0;
+              oA(g);
+              l = i;
+              return h | 0;
+            }
+            function gQ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              n = l;
+              l = (l + 80) | 0;
+              e = (n + 48) | 0;
+              d = (n + 32) | 0;
+              f = (n + 64) | 0;
+              g = (n + 16) | 0;
+              i = n;
+              j = (b + 16) | 0;
+              k = (a + 16) | 0;
+              m = c[k >> 2] | 0;
+              if (
+                (
+                  (+h[j >> 3] >= +h[(m + 48) >> 3] ? +h[(m + 64) >> 3] >= +h[b >> 3] : 0)
+                    ? +h[(b + 24) >> 3] >= +h[(m + 56) >> 3]
+                    : 0
+                )
+                  ? +h[(m + 72) >> 3] >= +h[(b + 8) >> 3]
+                  : 0
+              ) {
+                m = (m + 16) | 0;
+                c[d >> 2] = c[j >> 2];
+                c[(d + 4) >> 2] = c[(j + 4) >> 2];
+                c[(d + 8) >> 2] = c[(j + 8) >> 2];
+                c[(d + 12) >> 2] = c[(j + 12) >> 2];
+                c[e >> 2] = c[b >> 2];
+                c[(e + 4) >> 2] = c[(b + 4) >> 2];
+                c[(e + 8) >> 2] = c[(b + 8) >> 2];
+                c[(e + 12) >> 2] = c[(b + 12) >> 2];
+                hQ(g, d, e);
+                c[d >> 2] = c[m >> 2];
+                c[(d + 4) >> 2] = c[(m + 4) >> 2];
+                c[(d + 8) >> 2] = c[(m + 8) >> 2];
+                c[(d + 12) >> 2] = c[(m + 12) >> 2];
+                c[e >> 2] = c[g >> 2];
+                c[(e + 4) >> 2] = c[(g + 4) >> 2];
+                c[(e + 8) >> 2] = c[(g + 8) >> 2];
+                c[(e + 12) >> 2] = c[(g + 12) >> 2];
+                DP(i, d, e);
+                c[f >> 2] = a;
+                c[(f + 4) >> 2] = 0;
+                d = c[((c[((c[((c[k >> 2] | 0) + 8) >> 2] | 0) + 4) >> 2] | 0) + 12) >> 2] | 0;
+                c[e >> 2] = c[i >> 2];
+                c[(e + 4) >> 2] = c[(i + 4) >> 2];
+                c[(e + 8) >> 2] = c[(i + 8) >> 2];
+                c[(e + 12) >> 2] = c[(i + 12) >> 2];
+                d = lb[d & 127](f, e) | 0;
+              } else d = 0;
+              l = n;
+              return d | 0;
+            }
+            function hQ(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0;
+              d = (+h[(c + 8) >> 3] + +h[(b + 8) >> 3]) * 0.5;
+              h[a >> 3] = (+h[c >> 3] + +h[b >> 3]) * 0.5;
+              h[(a + 8) >> 3] = d;
+              return;
+            }
+            function iQ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0,
+                f = 0.0,
+                g = 0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              e = l;
+              l = (l + 80) | 0;
+              j = (e + 64) | 0;
+              k = (e + 48) | 0;
+              m = e;
+              n = (e + 32) | 0;
+              g = (e + 16) | 0;
+              h[m >> 3] = +h[(a + 24) >> 3] * 0.5;
+              h[(m + 8) >> 3] = +h[(a + 32) >> 3] * 0.5;
+              a = (a + 56) | 0;
+              c[k >> 2] = c[a >> 2];
+              c[(k + 4) >> 2] = c[(a + 4) >> 2];
+              c[(k + 8) >> 2] = c[(a + 8) >> 2];
+              c[(k + 12) >> 2] = c[(a + 12) >> 2];
+              c[j >> 2] = c[m >> 2];
+              c[(j + 4) >> 2] = c[(m + 4) >> 2];
+              c[(j + 8) >> 2] = c[(m + 8) >> 2];
+              c[(j + 12) >> 2] = c[(m + 12) >> 2];
+              DP(n, k, j);
+              i = +h[n >> 3];
+              f = +h[(n + 8) >> 3];
+              c[k >> 2] = c[a >> 2];
+              c[(k + 4) >> 2] = c[(a + 4) >> 2];
+              c[(k + 8) >> 2] = c[(a + 8) >> 2];
+              c[(k + 12) >> 2] = c[(a + 12) >> 2];
+              c[j >> 2] = c[m >> 2];
+              c[(j + 4) >> 2] = c[(m + 4) >> 2];
+              c[(j + 8) >> 2] = c[(m + 8) >> 2];
+              c[(j + 12) >> 2] = c[(m + 12) >> 2];
+              EP(g, k, j);
+              d = +h[(g + 8) >> 3];
+              if ((+h[(b + 16) >> 3] >= i ? +h[g >> 3] >= +h[b >> 3] : 0) ? +h[(b + 24) >> 3] >= f : 0)
+                a = (d >= +h[(b + 8) >> 3]) & 1;
+              else a = 0;
+              l = e;
+              return a | 0;
+            }
+            function jQ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              n = l;
+              l = (l + 80) | 0;
+              k = (n + 48) | 0;
+              j = n;
+              h = (a + 16) | 0;
+              a = c[h >> 2] | 0;
+              i = c[(a + 8) >> 2] | 0;
+              a: do
+                if (
+                  (i | 0) != 0
+                    ? ((g = (i + 8) | 0),
+                      (c[j >> 2] = c[g >> 2]),
+                      (c[(j + 4) >> 2] = c[(g + 4) >> 2]),
+                      (c[(j + 8) >> 2] = c[(g + 8) >> 2]),
+                      (c[(j + 12) >> 2] = c[(g + 12) >> 2]),
+                      (c[(j + 16) >> 2] = c[(g + 16) >> 2]),
+                      (c[(j + 20) >> 2] = c[(g + 20) >> 2]),
+                      (c[(j + 24) >> 2] = c[(g + 24) >> 2]),
+                      (c[(j + 28) >> 2] = c[(g + 28) >> 2]),
+                      (c[k >> 2] = c[b >> 2]),
+                      (c[(k + 4) >> 2] = c[(b + 4) >> 2]),
+                      (c[(k + 8) >> 2] = c[(b + 8) >> 2]),
+                      (c[(k + 12) >> 2] = c[(b + 12) >> 2]),
+                      (c[(k + 16) >> 2] = c[(b + 16) >> 2]),
+                      (c[(k + 20) >> 2] = c[(b + 20) >> 2]),
+                      (c[(k + 24) >> 2] = c[(b + 24) >> 2]),
+                      (c[(k + 28) >> 2] = c[(b + 28) >> 2]),
+                      (kQ(j, k) | 0) != 0)
+                    : 0
+                ) {
+                  d = (i + 4) | 0;
+                  a = 0;
+                  while (1) {
+                    if ((a | 0) >= (c[d >> 2] | 0)) break;
+                    e = j;
+                    f = ((c[i >> 2] | 0) + ((a * 48) | 0)) | 0;
+                    g = (e + 48) | 0;
+                    do {
+                      c[e >> 2] = c[f >> 2];
+                      e = (e + 4) | 0;
+                      f = (f + 4) | 0;
+                    } while ((e | 0) < (g | 0));
+                    c[k >> 2] = c[b >> 2];
+                    c[(k + 4) >> 2] = c[(b + 4) >> 2];
+                    c[(k + 8) >> 2] = c[(b + 8) >> 2];
+                    c[(k + 12) >> 2] = c[(b + 12) >> 2];
+                    c[(k + 16) >> 2] = c[(b + 16) >> 2];
+                    c[(k + 20) >> 2] = c[(b + 20) >> 2];
+                    c[(k + 24) >> 2] = c[(b + 24) >> 2];
+                    c[(k + 28) >> 2] = c[(b + 28) >> 2];
+                    if (!(((lQ(j, k) | 0) << 24) >> 24)) a = (a + 1) | 0;
+                    else {
+                      a = 1;
+                      break a;
+                    }
+                  }
+                  a = c[h >> 2] | 0;
+                  m = 7;
+                } else m = 7;
+              while (0);
+              do
+                if ((m | 0) == 7) {
+                  a = c[(a + 96) >> 2] | 0;
+                  if (
+                    a | 0
+                      ? ((c[k >> 2] = c[b >> 2]),
+                        (c[(k + 4) >> 2] = c[(b + 4) >> 2]),
+                        (c[(k + 8) >> 2] = c[(b + 8) >> 2]),
+                        (c[(k + 12) >> 2] = c[(b + 12) >> 2]),
+                        (c[(k + 16) >> 2] = c[(b + 16) >> 2]),
+                        (c[(k + 20) >> 2] = c[(b + 20) >> 2]),
+                        (c[(k + 24) >> 2] = c[(b + 24) >> 2]),
+                        (c[(k + 28) >> 2] = c[(b + 28) >> 2]),
+                        ((iQ(a, k) | 0) << 24) >> 24)
+                      : 0
+                  ) {
+                    a = 1;
+                    break;
+                  }
+                  a = 0;
+                }
+              while (0);
+              l = n;
+              return a | 0;
+            }
+            function kQ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if (
+                (+h[(a + 16) >> 3] >= +h[b >> 3] ? +h[(b + 16) >> 3] >= +h[a >> 3] : 0)
+                  ? +h[(a + 24) >> 3] >= +h[(b + 8) >> 3]
+                  : 0
+              )
+                a = (+h[(b + 24) >> 3] >= +h[(a + 8) >> 3]) & 1;
+              else a = 0;
+              return a | 0;
+            }
+            function lQ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              n = l;
+              l = (l + 96) | 0;
+              k = (n + 64) | 0;
+              j = (n + 48) | 0;
+              i = (n + 32) | 0;
+              f = (n + 16) | 0;
+              g = n;
+              m = (a + 4) | 0;
+              d = c[m >> 2] | 0;
+              if (!d) qa(109937, 107661, 1637, 109945);
+              e = c[a >> 2] | 0;
+              c[g >> 2] = c[e >> 2];
+              c[(g + 4) >> 2] = c[(e + 4) >> 2];
+              c[(g + 8) >> 2] = c[(e + 8) >> 2];
+              c[(g + 12) >> 2] = c[(e + 12) >> 2];
+              e = 1;
+              while (1) {
+                if ((e | 0) >= (d | 0)) {
+                  h = 7;
+                  break;
+                }
+                d = ((c[a >> 2] | 0) + (e << 4)) | 0;
+                c[f >> 2] = c[d >> 2];
+                c[(f + 4) >> 2] = c[(d + 4) >> 2];
+                c[(f + 8) >> 2] = c[(d + 8) >> 2];
+                c[(f + 12) >> 2] = c[(d + 12) >> 2];
+                c[i >> 2] = c[d >> 2];
+                c[(i + 4) >> 2] = c[(d + 4) >> 2];
+                c[(i + 8) >> 2] = c[(d + 8) >> 2];
+                c[(i + 12) >> 2] = c[(d + 12) >> 2];
+                c[j >> 2] = c[g >> 2];
+                c[(j + 4) >> 2] = c[(g + 4) >> 2];
+                c[(j + 8) >> 2] = c[(g + 8) >> 2];
+                c[(j + 12) >> 2] = c[(g + 12) >> 2];
+                c[k >> 2] = c[b >> 2];
+                c[(k + 4) >> 2] = c[(b + 4) >> 2];
+                c[(k + 8) >> 2] = c[(b + 8) >> 2];
+                c[(k + 12) >> 2] = c[(b + 12) >> 2];
+                c[(k + 16) >> 2] = c[(b + 16) >> 2];
+                c[(k + 20) >> 2] = c[(b + 20) >> 2];
+                c[(k + 24) >> 2] = c[(b + 24) >> 2];
+                c[(k + 28) >> 2] = c[(b + 28) >> 2];
+                if ((iK(i, j, k) | 0) != -1) {
+                  d = 1;
+                  break;
+                }
+                c[g >> 2] = c[f >> 2];
+                c[(g + 4) >> 2] = c[(f + 4) >> 2];
+                c[(g + 8) >> 2] = c[(f + 8) >> 2];
+                c[(g + 12) >> 2] = c[(f + 12) >> 2];
+                e = (e + 1) | 0;
+                d = c[m >> 2] | 0;
+              }
+              do
+                if ((h | 0) == 7) {
+                  d = c[(a + 8) >> 2] | 0;
+                  if (
+                    d | 0
+                      ? ((g = (a + 16) | 0),
+                        (h = c[a >> 2] | 0),
+                        (c[i >> 2] = c[g >> 2]),
+                        (c[(i + 4) >> 2] = c[(g + 4) >> 2]),
+                        (c[(i + 8) >> 2] = c[(g + 8) >> 2]),
+                        (c[(i + 12) >> 2] = c[(g + 12) >> 2]),
+                        (c[j >> 2] = c[h >> 2]),
+                        (c[(j + 4) >> 2] = c[(h + 4) >> 2]),
+                        (c[(j + 8) >> 2] = c[(h + 8) >> 2]),
+                        (c[(j + 12) >> 2] = c[(h + 12) >> 2]),
+                        (c[k >> 2] = c[b >> 2]),
+                        (c[(k + 4) >> 2] = c[(b + 4) >> 2]),
+                        (c[(k + 8) >> 2] = c[(b + 8) >> 2]),
+                        (c[(k + 12) >> 2] = c[(b + 12) >> 2]),
+                        (c[(k + 16) >> 2] = c[(b + 16) >> 2]),
+                        (c[(k + 20) >> 2] = c[(b + 20) >> 2]),
+                        (c[(k + 24) >> 2] = c[(b + 24) >> 2]),
+                        (c[(k + 28) >> 2] = c[(b + 28) >> 2]),
+                        ((mQ(i, j, d, k) | 0) << 24) >> 24)
+                      : 0
+                  ) {
+                    d = 1;
+                    break;
+                  }
+                  d = c[(a + 12) >> 2] | 0;
+                  if (
+                    d | 0
+                      ? ((h = (a + 32) | 0),
+                        (m = ((c[a >> 2] | 0) + (((c[m >> 2] | 0) + -1) << 4)) | 0),
+                        (c[i >> 2] = c[h >> 2]),
+                        (c[(i + 4) >> 2] = c[(h + 4) >> 2]),
+                        (c[(i + 8) >> 2] = c[(h + 8) >> 2]),
+                        (c[(i + 12) >> 2] = c[(h + 12) >> 2]),
+                        (c[j >> 2] = c[m >> 2]),
+                        (c[(j + 4) >> 2] = c[(m + 4) >> 2]),
+                        (c[(j + 8) >> 2] = c[(m + 8) >> 2]),
+                        (c[(j + 12) >> 2] = c[(m + 12) >> 2]),
+                        (c[k >> 2] = c[b >> 2]),
+                        (c[(k + 4) >> 2] = c[(b + 4) >> 2]),
+                        (c[(k + 8) >> 2] = c[(b + 8) >> 2]),
+                        (c[(k + 12) >> 2] = c[(b + 12) >> 2]),
+                        (c[(k + 16) >> 2] = c[(b + 16) >> 2]),
+                        (c[(k + 20) >> 2] = c[(b + 20) >> 2]),
+                        (c[(k + 24) >> 2] = c[(b + 24) >> 2]),
+                        (c[(k + 28) >> 2] = c[(b + 28) >> 2]),
+                        ((mQ(i, j, d, k) | 0) << 24) >> 24)
+                      : 0
+                  ) {
+                    d = 1;
+                    break;
+                  }
+                  d = 0;
+                }
+              while (0);
+              l = n;
+              return d | 0;
+            }
+            function mQ(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0.0;
+              m = l;
+              l = (l + 160) | 0;
+              g = (m + 144) | 0;
+              f = (m + 128) | 0;
+              n = (m + 96) | 0;
+              i = (m + 64) | 0;
+              j = (m + 32) | 0;
+              k = m;
+              o = +h[(e + 16) >> 3];
+              c[f >> 2] = c[a >> 2];
+              c[(f + 4) >> 2] = c[(a + 4) >> 2];
+              c[(f + 8) >> 2] = c[(a + 8) >> 2];
+              c[(f + 12) >> 2] = c[(a + 12) >> 2];
+              c[g >> 2] = c[b >> 2];
+              c[(g + 4) >> 2] = c[(b + 4) >> 2];
+              c[(g + 8) >> 2] = c[(b + 8) >> 2];
+              c[(g + 12) >> 2] = c[(b + 12) >> 2];
+              YH(n, f, g, 1.0, d);
+              if (
+                (
+                  (
+                    o >= +h[n >> 3]
+                      ? ((c[f >> 2] = c[a >> 2]),
+                        (c[(f + 4) >> 2] = c[(a + 4) >> 2]),
+                        (c[(f + 8) >> 2] = c[(a + 8) >> 2]),
+                        (c[(f + 12) >> 2] = c[(a + 12) >> 2]),
+                        (c[g >> 2] = c[b >> 2]),
+                        (c[(g + 4) >> 2] = c[(b + 4) >> 2]),
+                        (c[(g + 8) >> 2] = c[(b + 8) >> 2]),
+                        (c[(g + 12) >> 2] = c[(b + 12) >> 2]),
+                        YH(i, f, g, 1.0, d),
+                        +h[(i + 16) >> 3] >= +h[e >> 3])
+                      : 0
+                  )
+                    ? ((o = +h[(e + 24) >> 3]),
+                      (c[f >> 2] = c[a >> 2]),
+                      (c[(f + 4) >> 2] = c[(a + 4) >> 2]),
+                      (c[(f + 8) >> 2] = c[(a + 8) >> 2]),
+                      (c[(f + 12) >> 2] = c[(a + 12) >> 2]),
+                      (c[g >> 2] = c[b >> 2]),
+                      (c[(g + 4) >> 2] = c[(b + 4) >> 2]),
+                      (c[(g + 8) >> 2] = c[(b + 8) >> 2]),
+                      (c[(g + 12) >> 2] = c[(b + 12) >> 2]),
+                      YH(j, f, g, 1.0, d),
+                      o >= +h[(j + 8) >> 3])
+                    : 0
+                )
+                  ? ((c[f >> 2] = c[a >> 2]),
+                    (c[(f + 4) >> 2] = c[(a + 4) >> 2]),
+                    (c[(f + 8) >> 2] = c[(a + 8) >> 2]),
+                    (c[(f + 12) >> 2] = c[(a + 12) >> 2]),
+                    (c[g >> 2] = c[b >> 2]),
+                    (c[(g + 4) >> 2] = c[(b + 4) >> 2]),
+                    (c[(g + 8) >> 2] = c[(b + 8) >> 2]),
+                    (c[(g + 12) >> 2] = c[(b + 12) >> 2]),
+                    YH(k, f, g, 1.0, d),
+                    +h[(k + 24) >> 3] >= +h[(e + 8) >> 3])
+                  : 0
+              )
+                f = 1;
+              else f = 0;
+              l = m;
+              return f | 0;
+            }
+            function nQ(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              g = l;
+              l = (l + 16) | 0;
+              f = g;
+              a: do
+                if ((b | 0) != 0 ? ((e = a[b >> 0] | 0), (e << 24) >> 24 != 0) : 0) {
+                  do
+                    switch (((e << 24) >> 24) | 0) {
+                      case 48: {
+                        d = 2;
+                        break a;
+                      }
+                      case 57:
+                      case 56:
+                      case 55:
+                      case 54:
+                      case 53:
+                      case 52:
+                      case 51:
+                      case 50:
+                      case 49: {
+                        d = 10;
+                        break a;
+                      }
+                      case 67:
+                      case 99: {
+                        e = (b + 1) | 0;
+                        if (!(c3(e, 109960) | 0)) {
+                          d = 4;
+                          break a;
+                        }
+                        if (!(c3(e, 109966) | 0)) {
+                          d = 12;
+                          break a;
+                        }
+                        break;
+                      }
+                      case 70:
+                      case 102: {
+                        if (!(c3((b + 1) | 0, 109974) | 0)) {
+                          d = 2;
+                          break a;
+                        }
+                        break;
+                      }
+                      case 76:
+                      case 108: {
+                        if (!(c3((b + 1) | 0, 109979) | 0)) {
+                          d = 2;
+                          break a;
+                        }
+                        break;
+                      }
+                      case 78:
+                      case 110: {
+                        e = (b + 1) | 0;
+                        if (!(c3(e, 109983) | 0)) {
+                          d = 0;
+                          break a;
+                        }
+                        if (!(c3(e, 109987) | 0)) {
+                          d = 2;
+                          break a;
+                        }
+                        break;
+                      }
+                      case 79:
+                      case 111: {
+                        if (!(c3((b + 1) | 0, 109989) | 0)) {
+                          d = 8;
+                          break a;
+                        }
+                        break;
+                      }
+                      case 80:
+                      case 112: {
+                        if (!(c3((b + 1) | 0, 109994) | 0)) {
+                          d = 6;
+                          break a;
+                        }
+                        break;
+                      }
+                      case 83:
+                      case 115: {
+                        if (!(c3((b + 1) | 0, 110002) | 0)) {
+                          d = 10;
+                          break a;
+                        }
+                        break;
+                      }
+                      case 84:
+                      case 116: {
+                        if (!(c3((b + 1) | 0, 110008) | 0)) {
+                          d = 10;
+                          break a;
+                        }
+                        break;
+                      }
+                      case 89:
+                      case 121: {
+                        if (!(c3((b + 1) | 0, 110012) | 0)) {
+                          d = 10;
+                          break a;
+                        }
+                        break;
+                      }
+                      default: {
+                      }
+                    }
+                  while (0);
+                  c[f >> 2] = b;
+                  gA(0, 110015, f) | 0;
+                }
+              while (0);
+              l = g;
+              return d | 0;
+            }
+            function oQ(d, f) {
+              d = d | 0;
+              f = f | 0;
+              var g = 0;
+              g = QA(d, 110056) | 0;
+              if (g)
+                if (!(a[g >> 0] | 0)) f = 0;
+                else f = nQ(g, f) | 0;
+              d = ((c[(d + 16) >> 2] | 0) + 136) | 0;
+              b[d >> 1] = f | e[d >> 1];
+              return;
+            }
+            function pQ(a, b, c, d, e) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = +d;
+              e = e | 0;
+              var f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0,
+                q = 0.0,
+                r = 0,
+                s = 0.0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0;
+              v = l;
+              l = (l + 32) | 0;
+              p = (v + 16) | 0;
+              r = v;
+              t = e & 1;
+              u = e & 2;
+              a: do
+                if ((c | 0) == 2) {
+                  s = +h[(a + 16) >> 3];
+                  f = +h[a >> 3];
+                  j = +h[(a + 24) >> 3];
+                  i = +h[(a + 8) >> 3];
+                  f = f - (s - f);
+                  h[p >> 3] = f;
+                  h[r >> 3] = s;
+                  i = i - (j - i);
+                  h[(p + 8) >> 3] = i;
+                  h[(r + 8) >> 3] = j;
+                } else {
+                  g = +h[a >> 3];
+                  h[r >> 3] = g;
+                  h[p >> 3] = g;
+                  j = +h[(a + 8) >> 3];
+                  m = (r + 8) | 0;
+                  h[m >> 3] = j;
+                  n = (p + 8) | 0;
+                  h[n >> 3] = j;
+                  e = 0;
+                  f = g;
+                  i = j;
+                  while (1) {
+                    if ((e | 0) >= (c | 0)) {
+                      s = g;
+                      break a;
+                    }
+                    w = (a + (e << 4)) | 0;
+                    q = +h[w >> 3];
+                    k = +h[(q < f ? w : p) >> 3];
+                    h[p >> 3] = k;
+                    s = +h[(a + (e << 4) + 8) >> 3];
+                    o = +h[((s < i ? w : p) + 8) >> 3];
+                    h[n >> 3] = o;
+                    q = +h[(q > g ? w : r) >> 3];
+                    h[r >> 3] = q;
+                    s = +h[((s > j ? w : r) + 8) >> 3];
+                    h[m >> 3] = s;
+                    e = (e + 1) | 0;
+                    f = k;
+                    i = o;
+                    g = q;
+                    j = s;
+                  }
+                }
+              while (0);
+              g = (s - f) * 0.5;
+              q = g + f;
+              o = (j - i) * 0.5;
+              k = o + i;
+              if (!t) {
+                f = j - k;
+                j = d;
+                i = +F(+j);
+                j = +E(+j);
+                if (!u) {
+                  g = i * f - k;
+                  f = -k - o * i;
+                } else {
+                  f = i * f;
+                  g = k - f;
+                  f = f + k;
+                }
+                h[(b + 8) >> 3] = g;
+                h[(b + 24) >> 3] = f;
+                d = j * (s - q);
+                h[b >> 3] = q - d;
+                h[(b + 16) >> 3] = d + q;
+              } else {
+                d = +C(+(o * o + g * g));
+                h[(b + 8) >> 3] = u | 0 ? k : -k;
+                h[b >> 3] = q;
+                h[(b + 16) >> 3] = d * 0.25;
+                h[(b + 24) >> 3] = d;
+              }
+              l = v;
+              return;
+            }
+            function qQ(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0,
+                f = 0;
+              e = (a + 16) | 0;
+              f = c[e >> 2] | 0;
+              if (!((b << 24) >> 24)) {
+                d = +h[(f + 32) >> 3] * 36.0;
+                h[(f + 88) >> 3] = d;
+                a = (f + 40) | 0;
+              } else {
+                d = +h[(f + 40) >> 3] * 36.0;
+                h[(f + 88) >> 3] = d;
+                a = (f + 32) | 0;
+              }
+              h[(f + 96) >> 3] = d;
+              h[((c[e >> 2] | 0) + 80) >> 3] = +h[a >> 3] * 72.0;
+              return;
+            }
+            function Tl(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              n = l;
+              l = (l + 32) | 0;
+              j = (n + 8) | 0;
+              f = (n + 4) | 0;
+              g = n;
+              d = c[b >> 2] & 3;
+              e = c[(((d | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0;
+              k = ((c[((c[(e + 16) >> 2] | 0) + 232) >> 2] | 0) + -1) | 0;
+              a = c[((c[(a + 16) >> 2] | 0) + 196) >> 2] | 0;
+              h = c[(a + (k << 6) + 4) >> 2] | 0;
+              a = c[(a + (k << 6)) >> 2] | 0;
+              k = (j + 8) | 0;
+              c[k >> 2] = -1;
+              c[j >> 2] = -1;
+              m = (j + 12) | 0;
+              c[m >> 2] = a;
+              i = (j + 4) | 0;
+              c[i >> 2] = a;
+              Vl(e, c[(((d | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0, f, g);
+              f = c[f >> 2] | 0;
+              g = c[g >> 2] | 0;
+              d = 0;
+              e = a;
+              b = -1;
+              while (1) {
+                if ((d | 0) >= (e | 0)) break;
+                e = (e + -1) | 0;
+                Wl(c[(h + (d << 2)) >> 2] | 0, j, f, g);
+                if ((d | 0) != (e | 0)) Wl(c[(h + (e << 2)) >> 2] | 0, j, f, g);
+                a = c[i >> 2] | 0;
+                b = c[j >> 2] | 0;
+                if (((a - b) | 0) < 2) break;
+                else d = (d + 1) | 0;
+              }
+              if ((b | 0) > (a | 0)) a = ((c[m >> 2] | 0) + (c[k >> 2] | 0)) | 0;
+              else a = (a + b) | 0;
+              l = n;
+              return (((a + 1) | 0) / 2) | 0 | 0;
+            }
+            function Ul(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              g = (a + 16) | 0;
+              f = c[((c[g >> 2] | 0) + 196) >> 2] | 0;
+              e = (f + (b << 6)) | 0;
+              f = c[(f + (b << 6) + 4) >> 2] | 0;
+              if (!f) f = KK(((c[e >> 2] << 2) + 8) | 0) | 0;
+              else f = MK(f, ((c[e >> 2] << 2) + 8) | 0) | 0;
+              e = c[((c[g >> 2] | 0) + 196) >> 2] | 0;
+              c[(e + (b << 6) + 4) >> 2] = f;
+              e = c[(e + (b << 6)) >> 2] | 0;
+              while (1) {
+                if ((e | 0) <= (d | 0)) break;
+                h = (e + -1) | 0;
+                i = c[(f + (h << 2)) >> 2] | 0;
+                c[(f + (e << 2)) >> 2] = i;
+                i = ((c[(i + 16) >> 2] | 0) + 236) | 0;
+                c[i >> 2] = (c[i >> 2] | 0) + 1;
+                e = h;
+              }
+              h = sh(a) | 0;
+              i = (f + (d << 2)) | 0;
+              c[i >> 2] = h;
+              h = c[(h + 16) >> 2] | 0;
+              c[(h + 236) >> 2] = d;
+              c[(h + 232) >> 2] = b;
+              g = ((c[((c[g >> 2] | 0) + 196) >> 2] | 0) + (b << 6)) | 0;
+              h = ((c[g >> 2] | 0) + 1) | 0;
+              c[g >> 2] = h;
+              c[(f + (h << 2)) >> 2] = 0;
+              return c[i >> 2] | 0;
+            }
+            function Vl(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0;
+              a = c[((c[(a + 16) >> 2] | 0) + 236) >> 2] | 0;
+              b = c[((c[(b + 16) >> 2] | 0) + 236) >> 2] | 0;
+              f = (a | 0) > (b | 0);
+              c[d >> 2] = f ? b : a;
+              c[e >> 2] = f ? a : b;
+              return;
+            }
+            function Wl(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              m = l;
+              l = (l + 16) | 0;
+              h = (m + 4) | 0;
+              g = m;
+              b = c[(b + 16) >> 2] | 0;
+              do
+                if ((a[(b + 156) >> 0] | 0) == 1) {
+                  k = c[(b + 236) >> 2] | 0;
+                  if (c[(b + 176) >> 2] | 0) {
+                    i = c[(b + 180) >> 2] | 0;
+                    b = 0;
+                    g = 0;
+                    h = 0;
+                    while (1) {
+                      j = c[(i + (h << 2)) >> 2] | 0;
+                      if (!j) break;
+                      n =
+                        c[
+                          ((c[((c[((((c[j >> 2] & 3) | 0) == 2 ? j : (j + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                            236) >>
+                            2
+                        ] | 0;
+                      j = (n | 0) > (e | 0);
+                      b = j ? ((n | 0) < (f | 0) ? b : 1) : b;
+                      g = j ? g : 1;
+                      h = (h + 1) | 0;
+                    }
+                    if (((g << 24) >> 24 != 0) & ((b << 24) >> 24 == 0)) {
+                      c[d >> 2] = k + 1;
+                      break;
+                    }
+                    if (!(((g << 24) >> 24 == 0) & ((b << 24) >> 24 != 0))) break;
+                    c[(d + 4) >> 2] = k + -1;
+                    break;
+                  }
+                  if ((c[(b + 184) >> 2] | 0) != 2) qa(88397, 88417, 63, 88424);
+                  i = c[(b + 180) >> 2] | 0;
+                  n = c[i >> 2] | 0;
+                  i = c[(i + 4) >> 2] | 0;
+                  Vl(
+                    c[((((c[n >> 2] & 3) | 0) == 2 ? n : (n + -48) | 0) + 40) >> 2] | 0,
+                    c[((((c[i >> 2] & 3) | 0) == 2 ? i : (i + -48) | 0) + 40) >> 2] | 0,
+                    h,
+                    g
+                  );
+                  i = c[g >> 2] | 0;
+                  if ((i | 0) <= (e | 0)) {
+                    c[d >> 2] = k;
+                    c[(d + 8) >> 2] = k;
+                    break;
+                  }
+                  b = c[h >> 2] | 0;
+                  if ((b | 0) >= (f | 0)) {
+                    c[(d + 4) >> 2] = k;
+                    c[(d + 12) >> 2] = k;
+                    break;
+                  }
+                  g = (b | 0) < (e | 0);
+                  h = (i | 0) > (f | 0);
+                  if (!(h & g)) {
+                    if (!(!g ? !(((i | 0) < (f | 0)) & ((b | 0) == (e | 0))) : 0)) c[(d + 8) >> 2] = k;
+                    if (!h ? !(((i | 0) == (f | 0)) & ((b | 0) > (e | 0))) : 0) break;
+                    c[(d + 12) >> 2] = k;
+                  }
+                }
+              while (0);
+              l = m;
+              return;
+            }
+            function Xl(a) {
+              a = a | 0;
+              c[47134] = 1;
+              pm(a);
+              c[47134] = 0;
+              return;
+            }
+            function Yl(a) {
+              a = a | 0;
+              c[47134] = 2;
+              pm(a);
+              c[47134] = 0;
+              return;
+            }
+            function Zl(a) {
+              a = a | 0;
+              var b = 0;
+              TC(a, 137447, 304, 1) | 0;
+              sP(a);
+              b = JK((e[((c[((xC(a) | 0) + 16) >> 2] | 0) + 176) >> 1] | 0) << 3) | 0;
+              c[((c[(a + 16) >> 2] | 0) + 132) >> 2] = b;
+              qQ(a, c[((c[((xC(a) | 0) + 16) >> 2] | 0) + 116) >> 2] & 1);
+              return;
+            }
+            function _l(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0.0,
+                u = 0.0;
+              s = l;
+              l = (l + 64) | 0;
+              j = (s + 48) | 0;
+              o = (s + 40) | 0;
+              k = (s + 24) | 0;
+              i = (s + 8) | 0;
+              q = (s + 56) | 0;
+              m = s;
+              do
+                if (
+                  (b | 0) != 0
+                    ? ((r = (e + 16) | 0),
+                      (p = c[((c[r >> 2] | 0) + 132) >> 2] | 0),
+                      (g = RA(e, b) | 0),
+                      (a[g >> 0] | 0) != 0)
+                    : 0
+                ) {
+                  a[q >> 0] = 0;
+                  b = (p + 8) | 0;
+                  if (
+                    (c[47137] | 0) > 2
+                      ? ((c[i >> 2] = p),
+                        (c[(i + 4) >> 2] = b),
+                        (c[(i + 8) >> 2] = p + 16),
+                        (c[(i + 12) >> 2] = q),
+                        (b5(g, 88535, i) | 0) > 2)
+                      : 0
+                  ) {
+                    a[((c[r >> 2] | 0) + 119) >> 0] = 1;
+                    g = c[47137] | 0;
+                    a: do
+                      if (+h[23293] > 0.0) {
+                        b = 0;
+                        while (1) {
+                          if ((b | 0) >= (g | 0)) break a;
+                          o = (p + (b << 3)) | 0;
+                          h[o >> 3] = +h[o >> 3] / +h[23293];
+                          b = (b + 1) | 0;
+                        }
+                      }
+                    while (0);
+                    if ((g | 0) > 3) Fn(e, f, 3);
+                    if ((a[q >> 0] | 0) != 33) {
+                      if (!d) {
+                        b = 1;
+                        break;
+                      }
+                      if (!(((dP(RA(e, d) | 0) | 0) << 24) >> 24)) {
+                        b = 1;
+                        break;
+                      }
+                    }
+                    a[((c[r >> 2] | 0) + 119) >> 0] = 3;
+                    b = 1;
+                    break;
+                  }
+                  c[k >> 2] = p;
+                  c[(k + 4) >> 2] = b;
+                  c[(k + 8) >> 2] = q;
+                  if ((b5(g, 101749, k) | 0) <= 1) {
+                    c[j >> 2] = KB(e) | 0;
+                    c[(j + 4) >> 2] = g;
+                    gA(1, 88549, j) | 0;
+                    b = 0;
+                    break;
+                  }
+                  a[((c[r >> 2] | 0) + 119) >> 0] = 1;
+                  g = c[47137] | 0;
+                  b: do
+                    if (+h[23293] > 0.0) {
+                      b = 0;
+                      while (1) {
+                        if ((b | 0) >= (g | 0)) break b;
+                        k = (p + (b << 3)) | 0;
+                        h[k >> 3] = +h[k >> 3] / +h[23293];
+                        b = (b + 1) | 0;
+                      }
+                    }
+                  while (0);
+                  do
+                    if ((g | 0) > 2) {
+                      b = c[47171] | 0;
+                      if (
+                        (b | 0 ? ((n = RA(e, b) | 0), n | 0) : 0) ? ((c[o >> 2] = m), (b5(n, 101209, o) | 0) == 1) : 0
+                      ) {
+                        u = +h[23293];
+                        t = +h[m >> 3];
+                        h[(p + 16) >> 3] = u > 0.0 ? t / u : t;
+                        Fn(e, f, 3);
+                        break;
+                      }
+                      Gn(e, f);
+                    }
+                  while (0);
+                  if ((a[q >> 0] | 0) != 33) {
+                    if (!d) {
+                      b = 1;
+                      break;
+                    }
+                    if (!(((dP(RA(e, d) | 0) | 0) << 24) >> 24)) {
+                      b = 1;
+                      break;
+                    }
+                  }
+                  a[((c[r >> 2] | 0) + 119) >> 0] = 3;
+                  b = 1;
+                } else b = 0;
+              while (0);
+              l = s;
+              return b | 0;
+            }
+            function $l(a) {
+              a = a | 0;
+              var b = 0,
+                c = 0;
+              c = jC(a) | 0;
+              while (1) {
+                if (!c) break;
+                b = XA(a, c) | 0;
+                while (1) {
+                  if (!b) break;
+                  YP(b);
+                  b = ZA(a, b) | 0;
+                }
+                WP(c);
+                c = kC(a, c) | 0;
+              }
+              am(a);
+              return;
+            }
+            function am(a) {
+              a = a | 0;
+              if (((c[47134] | 0) != 0) | ((c[46795] | 0) < 0)) Dn(a);
+              if ((yC(a) | 0) != (a | 0)) ZC(a, 0, 137483);
+              return;
+            }
+            function bm(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              q = l;
+              l = (l + 48) | 0;
+              m = (q + 32) | 0;
+              o = q;
+              k = GA(b, 0, 102637, 0) | 0;
+              e = GA(b, 0, 102671, 0) | 0;
+              p = ((eP(QA(b, 88593) | 0, 0) | 0) << 24) >> 24 != 0;
+              if (!e) e = GA(b, 0, 102671, 195059) | 0;
+              Cn(b) | 0;
+              n = (b + 16) | 0;
+              i = 0;
+              while (1) {
+                j = c[((c[((c[n >> 2] | 0) + 152) >> 2] | 0) + (i << 2)) >> 2] | 0;
+                if (!j) {
+                  f = 12;
+                  break;
+                }
+                g = (j + 16) | 0;
+                f = c[g >> 2] | 0;
+                if (!(a[(f + 119) >> 0] | 0)) {
+                  if (Q2(KB(j) | 0, 108006, 7) | 0) {
+                    f = 8;
+                    break;
+                  }
+                  f = c[g >> 2] | 0;
+                }
+                f = c[(f + 108) >> 2] | 0;
+                if (f | 0) cm(j, f, 102633);
+                i = (i + 1) | 0;
+              }
+              a: do
+                if ((f | 0) == 8) {
+                  p = KB(j) | 0;
+                  e = KB(b) | 0;
+                  c[m >> 2] = p;
+                  c[(m + 4) >> 2] = e;
+                  gA(1, 88605, m) | 0;
+                  e = -1;
+                } else if ((f | 0) == 12) {
+                  dm(b, k, e);
+                  j = em(b) | 0;
+                  e = c[((c[n >> 2] | 0) + 8) >> 2] | 0;
+                  if (!(c[(e + 88) >> 2] | 0)) e = 0;
+                  else {
+                    c[(e + 84) >> 2] = 0;
+                    e = 1;
+                  }
+                  g = (d | 0) != 0;
+                  i = (e | 0) != 0;
+                  if (!(i | ((g & ((c[47134] | 0) == 1)) ^ 1)) ? (or(b) | 0) != 0 : 0) {
+                    f = c[((c[n >> 2] | 0) + 12) >> 2] | 0;
+                    if (!f) f = 1;
+                    else {
+                      a[(f + 81) >> 0] = 0;
+                      f = 1;
+                    }
+                  } else f = 0;
+                  BP(b);
+                  if (i) {
+                    d = ((c[n >> 2] | 0) + 16) | 0;
+                    nI(o, b);
+                    c[d >> 2] = c[o >> 2];
+                    c[(d + 4) >> 2] = c[(o + 4) >> 2];
+                    c[(d + 8) >> 2] = c[(o + 8) >> 2];
+                    c[(d + 12) >> 2] = c[(o + 12) >> 2];
+                    c[(d + 16) >> 2] = c[(o + 16) >> 2];
+                    c[(d + 20) >> 2] = c[(o + 20) >> 2];
+                    c[(d + 24) >> 2] = c[(o + 24) >> 2];
+                    c[(d + 28) >> 2] = c[(o + 28) >> 2];
+                  }
+                  if (!g) {
+                    c[47138] = 1;
+                    f = jC(b) | 0;
+                    while (1) {
+                      if (!f) break a;
+                      p = c[(f + 16) >> 2] | 0;
+                      o = c[(p + 132) >> 2] | 0;
+                      h[(p + 16) >> 3] = +h[o >> 3] * 72.0;
+                      h[(p + 24) >> 3] = +h[(o + 8) >> 3] * 72.0;
+                      f = kC(b, f) | 0;
+                    }
+                  }
+                  do
+                    if (!(p | i)) {
+                      p = c[n >> 2] | 0;
+                      if (!(+h[(p + 16) >> 3] != 0.0) ? !(+h[(p + 24) >> 3] != 0.0) : 0) break;
+                      an(b);
+                    }
+                  while (0);
+                  if (!(((j | 0) != 0) & (f | (((_m(b) | 0) << 24) >> 24 != 0)))) {
+                    if ((j | 0) == 2) {
+                      c[47138] = 1;
+                      break;
+                    }
+                  } else fm(b);
+                  Zm(b, 0);
+                }
+              while (0);
+              l = q;
+              return e | 0;
+            }
+            function cm(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 48) | 0;
+              j = (k + 32) | 0;
+              f = (k + 24) | 0;
+              g = (k + 16) | 0;
+              i = k;
+              b = QA(b, e) | 0;
+              if (b | 0 ? ((c[j >> 2] = f), (c[(j + 4) >> 2] = g), (b5(b, 105503, j) | 0) == 2) : 0) {
+                j = (d + 56) | 0;
+                im(i, +h[f >> 3], +h[g >> 3]);
+                c[j >> 2] = c[i >> 2];
+                c[(j + 4) >> 2] = c[(i + 4) >> 2];
+                c[(j + 8) >> 2] = c[(i + 8) >> 2];
+                c[(j + 12) >> 2] = c[(i + 12) >> 2];
+                a[(d + 81) >> 0] = 1;
+              }
+              l = k;
+              return;
+            }
+            function dm(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              m = l;
+              l = (l + 48) | 0;
+              k = (m + 32) | 0;
+              f = (m + 24) | 0;
+              g = (m + 16) | 0;
+              i = m;
+              j = (b + 16) | 0;
+              if (
+                (d | 0 ? (c[((c[j >> 2] | 0) + 12) >> 2] | 0) != 0 : 0)
+                  ? ((n = RA(b, d) | 0), (c[k >> 2] = f), (c[(k + 4) >> 2] = g), (b5(n, 105503, k) | 0) == 2)
+                  : 0
+              ) {
+                n = ((c[((c[j >> 2] | 0) + 12) >> 2] | 0) + 56) | 0;
+                im(i, +h[f >> 3], +h[g >> 3]);
+                c[n >> 2] = c[i >> 2];
+                c[(n + 4) >> 2] = c[(i + 4) >> 2];
+                c[(n + 8) >> 2] = c[(i + 8) >> 2];
+                c[(n + 12) >> 2] = c[(i + 12) >> 2];
+                a[((c[((c[j >> 2] | 0) + 12) >> 2] | 0) + 81) >> 0] = 1;
+              }
+              a: do
+                if (e | 0) {
+                  f = OD(b) | 0;
+                  while (1) {
+                    if (!f) break a;
+                    jm(f, b, d, e);
+                    f = PD(f) | 0;
+                  }
+                }
+              while (0);
+              l = m;
+              return;
+            }
+            function em(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              if (uB(a) | 0) {
+                f = GA(a, 2, 102623, 0) | 0;
+                if (!(((f | 0) == 0) | ((c[47134] | 0) < 2))) {
+                  b = 0;
+                  e = jC(a) | 0;
+                  while (1) {
+                    if (!e) break;
+                    d = XA(a, e) | 0;
+                    while (1) {
+                      if (!d) break;
+                      g = (b + (((gm(f, d) | 0) != 0) & 1)) | 0;
+                      d = ZA(a, d) | 0;
+                      b = g;
+                    }
+                    e = kC(a, e) | 0;
+                  }
+                  if (b) {
+                    b = (b | 0) == (uB(a) | 0);
+                    b = b ? 2 : 1;
+                  } else b = 0;
+                } else b = 0;
+              } else b = 2;
+              return b | 0;
+            }
+            function fm(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              d = jC(a) | 0;
+              while (1) {
+                if (!d) break;
+                b = XA(a, d) | 0;
+                while (1) {
+                  if (!b) break;
+                  ZP(b);
+                  e = (b + 16) | 0;
+                  CK(c[((c[e >> 2] | 0) + 96) >> 2] | 0);
+                  CK(c[((c[e >> 2] | 0) + 108) >> 2] | 0);
+                  CK(c[((c[e >> 2] | 0) + 100) >> 2] | 0);
+                  CK(c[((c[e >> 2] | 0) + 104) >> 2] | 0);
+                  b = ZA(a, b) | 0;
+                }
+                d = kC(a, d) | 0;
+              }
+              return;
+            }
+            function gm(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0;
+              B = l;
+              l = (l + 96) | 0;
+              z = (B + 72) | 0;
+              x = (B + 56) | 0;
+              A = (B + 48) | 0;
+              y = (B + 32) | 0;
+              w = (B + 16) | 0;
+              r = (B + 88) | 0;
+              s = (B + 8) | 0;
+              t = B;
+              u = (B + 84) | 0;
+              v = (B + 80) | 0;
+              b = RA(d, b) | 0;
+              do
+                if (a[b >> 0] | 0) {
+                  HH(d, u, v);
+                  q = 1;
+                  f = 0;
+                  e = 0;
+                  j = 0.0;
+                  i = 0.0;
+                  k = 0.0;
+                  g = 0.0;
+                  a: while (1) {
+                    c[w >> 2] = s;
+                    c[(w + 4) >> 2] = t;
+                    c[(w + 8) >> 2] = r;
+                    if ((b5(b, 88642, w) | 0) == 2) {
+                      p = 1;
+                      b = (b + (c[r >> 2] | 0)) | 0;
+                      i = +h[s >> 3];
+                      g = +h[t >> 3];
+                    } else p = e;
+                    c[y >> 2] = s;
+                    c[(y + 4) >> 2] = t;
+                    c[(y + 8) >> 2] = r;
+                    if ((b5(b, 88654, y) | 0) == 2) {
+                      o = 1;
+                      b = (b + (c[r >> 2] | 0)) | 0;
+                      j = +h[s >> 3];
+                      k = +h[t >> 3];
+                    } else o = f;
+                    m = hm(b) | 0;
+                    if (!(((m | 0) > 3) & (((m | 0) % 3 | 0 | 0) == 1))) {
+                      e = 8;
+                      break;
+                    }
+                    n = KK(m << 4) | 0;
+                    e = n;
+                    f = m;
+                    while (1) {
+                      if (!f) break;
+                      c[x >> 2] = s;
+                      c[(x + 4) >> 2] = t;
+                      c[(x + 8) >> 2] = r;
+                      if ((b5(b, 88724, x) | 0) < 2) {
+                        e = 13;
+                        break a;
+                      }
+                      C = (b + (c[r >> 2] | 0)) | 0;
+                      h[e >> 3] = +h[s >> 3];
+                      h[(e + 8) >> 3] = +h[t >> 3];
+                      e = (e + 16) | 0;
+                      f = (f + -1) | 0;
+                      b = C;
+                    }
+                    while (1) {
+                      e = a[b >> 0] | 0;
+                      f = (b + 1) | 0;
+                      if (!(S2((e << 24) >> 24) | 0)) break;
+                      else b = f;
+                    }
+                    C = (e << 24) >> 24 == 0;
+                    b = C ? b : f;
+                    q = C ? 0 : q;
+                    f = cO(d, m) | 0;
+                    if (p | 0) {
+                      c[(f + 8) >> 2] = c[u >> 2];
+                      h[(f + 16) >> 3] = i;
+                      h[(f + 24) >> 3] = g;
+                    }
+                    if (o | 0) {
+                      c[(f + 12) >> 2] = c[v >> 2];
+                      h[(f + 32) >> 3] = j;
+                      h[(f + 40) >> 3] = k;
+                    }
+                    e = 0;
+                    while (1) {
+                      if ((e | 0) >= (m | 0)) break;
+                      C = ((c[f >> 2] | 0) + (e << 4)) | 0;
+                      D = (n + (e << 4)) | 0;
+                      c[C >> 2] = c[D >> 2];
+                      c[(C + 4) >> 2] = c[(D + 4) >> 2];
+                      c[(C + 8) >> 2] = c[(D + 8) >> 2];
+                      c[(C + 12) >> 2] = c[(D + 12) >> 2];
+                      e = (e + 1) | 0;
+                    }
+                    U1(n);
+                    if (!q) {
+                      e = 26;
+                      break;
+                    } else {
+                      f = o;
+                      e = p;
+                    }
+                  }
+                  if ((e | 0) == 8) {
+                    ZP(d);
+                    if (a[193771] | 0) {
+                      b = 0;
+                      break;
+                    }
+                    a[193771] = 1;
+                    D = KB(c[((((c[d >> 2] & 3) | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0) | 0;
+                    b = KB(c[((((c[d >> 2] & 3) | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0) | 0;
+                    c[A >> 2] = D;
+                    c[(A + 4) >> 2] = b;
+                    gA(0, 88667, A) | 0;
+                    b = 0;
+                    break;
+                  } else if ((e | 0) == 13) {
+                    if (!(a[193771] | 0)) {
+                      a[193771] = 1;
+                      C = KB(c[((((c[d >> 2] & 3) | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] | 0) | 0;
+                      D = KB(c[((((c[d >> 2] & 3) | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] | 0) | 0;
+                      c[z >> 2] = C;
+                      c[(z + 4) >> 2] = D;
+                      gA(0, 88734, z) | 0;
+                    }
+                    U1(n);
+                    ZP(d);
+                    b = 0;
+                    break;
+                  } else if ((e | 0) == 26) {
+                    f = (d + 16) | 0;
+                    b = c[f >> 2] | 0;
+                    e = c[(b + 96) >> 2] | 0;
+                    if (e) {
+                      cm(d, e, 102637);
+                      b = c[f >> 2] | 0;
+                    }
+                    e = c[(b + 108) >> 2] | 0;
+                    if (e) {
+                      cm(d, e, 102633);
+                      b = c[f >> 2] | 0;
+                    }
+                    e = c[(b + 100) >> 2] | 0;
+                    if (e) {
+                      cm(d, e, 102640);
+                      b = c[f >> 2] | 0;
+                    }
+                    b = c[(b + 104) >> 2] | 0;
+                    if (!b) {
+                      b = 1;
+                      break;
+                    }
+                    cm(d, b, 102648);
+                    b = 1;
+                    break;
+                  }
+                } else b = 0;
+              while (0);
+              l = B;
+              return b | 0;
+            }
+            function hm(b) {
+              b = b | 0;
+              var c = 0,
+                d = 0;
+              d = 0;
+              do {
+                while (1) {
+                  c = a[b >> 0] | 0;
+                  if (!(S2(c & 255) | 0)) break;
+                  else b = (b + 1) | 0;
+                }
+                a: do
+                  if (!((c << 24) >> 24)) c = 0;
+                  else {
+                    d = (d + 1) | 0;
+                    while (1) {
+                      if (!((c << 24) >> 24)) {
+                        c = 0;
+                        break a;
+                      }
+                      if (((c << 24) >> 24 == 59) | ((S2(c & 255) | 0) != 0)) break a;
+                      c = (b + 1) | 0;
+                      b = c;
+                      c = a[c >> 0] | 0;
+                    }
+                  }
+                while (0);
+              } while ((S2(c & 255) | 0) != 0);
+              return d | 0;
+            }
+            function im(a, b, c) {
+              a = a | 0;
+              b = +b;
+              c = +c;
+              h[a >> 3] = b;
+              h[(a + 8) >> 3] = c;
+              return;
+            }
+            function jm(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              h = l;
+              l = (l + 32) | 0;
+              f = h;
+              if ((Q2(KB(a) | 0, 108006, 7) | 0) == 0 ? (km(a, e, f) | 0) != 0 : 0) {
+                TC(a, 137483, 280, 1) | 0;
+                i = ((c[(a + 16) >> 2] | 0) + 16) | 0;
+                c[i >> 2] = c[f >> 2];
+                c[(i + 4) >> 2] = c[(f + 4) >> 2];
+                c[(i + 8) >> 2] = c[(f + 8) >> 2];
+                c[(i + 12) >> 2] = c[(f + 12) >> 2];
+                c[(i + 16) >> 2] = c[(f + 16) >> 2];
+                c[(i + 20) >> 2] = c[(f + 20) >> 2];
+                c[(i + 24) >> 2] = c[(f + 24) >> 2];
+                c[(i + 28) >> 2] = c[(f + 28) >> 2];
+                lm(b, a);
+                dm(a, d, e);
+              } else g = 4;
+              a: do
+                if ((g | 0) == 4) {
+                  a = OD(a) | 0;
+                  while (1) {
+                    if (!a) break a;
+                    jm(a, b, d, e);
+                    a = PD(a) | 0;
+                  }
+                }
+              while (0);
+              l = h;
+              return;
+            }
+            function km(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              i = l;
+              l = (l + 48) | 0;
+              j = (i + 32) | 0;
+              g = i;
+              k = RA(a, b) | 0;
+              a = (g + 8) | 0;
+              b = (g + 24) | 0;
+              c[j >> 2] = g;
+              c[(j + 4) >> 2] = a;
+              c[(j + 8) >> 2] = g + 16;
+              c[(j + 12) >> 2] = b;
+              if ((b5(k, 88782, j) | 0) == 4) {
+                e = +h[a >> 3];
+                f = +h[b >> 3];
+                if (e > f) {
+                  h[a >> 3] = f;
+                  h[b >> 3] = e;
+                }
+                c[d >> 2] = c[g >> 2];
+                c[(d + 4) >> 2] = c[(g + 4) >> 2];
+                c[(d + 8) >> 2] = c[(g + 8) >> 2];
+                c[(d + 12) >> 2] = c[(g + 12) >> 2];
+                c[(d + 16) >> 2] = c[(g + 16) >> 2];
+                c[(d + 20) >> 2] = c[(g + 20) >> 2];
+                c[(d + 24) >> 2] = c[(g + 24) >> 2];
+                c[(d + 28) >> 2] = c[(g + 28) >> 2];
+                a = 1;
+              } else a = 0;
+              l = i;
+              return a | 0;
+            }
+            function lm(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              e = (a + 16) | 0;
+              d = c[e >> 2] | 0;
+              g = (d + 180) | 0;
+              a = c[g >> 2] | 0;
+              f = (a + 1) | 0;
+              c[g >> 2] = f;
+              d = c[(d + 184) >> 2] | 0;
+              if (!d) a = JK(((a << 2) + 8) | 0) | 0;
+              else a = LK(d, (a + 2) | 0, 4, f) | 0;
+              c[((c[e >> 2] | 0) + 184) >> 2] = a;
+              c[(a + (f << 2)) >> 2] = b;
+              uK(b);
+              return;
+            }
+            function mm(b, e, f) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              n = l;
+              l = (l + 48) | 0;
+              m = (n + 8) | 0;
+              k = n;
+              i = (n + 16) | 0;
+              j = (n + 12) | 0;
+              h = QA(b, 88798) | 0;
+              do
+                if ((h | 0) != 0 ? ((g = a[h >> 0] | 0), (g << 24) >> 24 != 0) : 0) {
+                  g = g & 255;
+                  if (!(b3(g) | 0))
+                    if (((e | 0) == 2) | (((g + -48) | 0) >>> 0 < 10)) e = h;
+                    else break;
+                  else {
+                    if (!(Q2(h, 88804, 4) | 0)) {
+                      e = 0;
+                      break;
+                    }
+                    if (!(Q2(h, 105511, 7) | 0)) {
+                      e = 1;
+                      break;
+                    }
+                    if (Q2(h, 88809, 6) | 0)
+                      if ((e | 0) == 2) e = h;
+                      else break;
+                    else e = (h + 6) | 0;
+                  }
+                  if (!((((d[e >> 0] | 0) + -48) | 0) >>> 0 < 10 ? ((c[k >> 2] = j), (b5(e, 99933, k) | 0) >= 1) : 0)) {
+                    k = X4() | 0;
+                    k = (db(0) | 0) ^ k;
+                    c[j >> 2] = k;
+                    c[m >> 2] = k;
+                    m4(i, 99933, m) | 0;
+                    SA(b, 88798, i) | 0;
+                  }
+                  c[f >> 2] = c[j >> 2];
+                  e = 2;
+                }
+              while (0);
+              l = n;
+              return e | 0;
+            }
+            function nm(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              f = l;
+              l = (l + 16) | 0;
+              e = (f + 4) | 0;
+              c[e >> 2] = 1;
+              d = mm(a, d, e) | 0;
+              if (((d | 0) != 2) & ((c[46796] | 0) != 0)) gA(0, 88816, f) | 0;
+              if ((d | 0) == 1) om(a, b);
+              z5(c[e >> 2] | 0);
+              l = f;
+              return d | 0;
+            }
+            function om(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                l = 0.0;
+              g = +(d | 0);
+              i = 6.283185307179586 / g;
+              e = jC(b) | 0;
+              f = 0.0;
+              while (1) {
+                if (!e) break;
+                l = +E(+f) * g;
+                j = c[(e + 16) >> 2] | 0;
+                k = c[(j + 132) >> 2] | 0;
+                h[k >> 3] = l;
+                h[(k + 8) >> 3] = +F(+f) * g;
+                a[(j + 119) >> 0] = 1;
+                if ((c[47137] | 0) > 2) Gn(e, d);
+                e = kC(b, e) | 0;
+                f = f + i;
+              }
+              return;
+            }
+            function pm(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0.0,
+                r = 0;
+              r = l;
+              l = (l + 80) | 0;
+              d = (r + 24) | 0;
+              n = (r + 32) | 0;
+              k = r;
+              p = (r + 28) | 0;
+              m = (r + 64) | 0;
+              q = +h[23293];
+              do
+                if (c[47134] | 0) {
+                  h[23293] = 72.0;
+                  qm(b);
+                  rm(b);
+                  if ((bm(b, 1) | 0) < 0) {
+                    gA(3, 88864, d) | 0;
+                    break;
+                  } else {
+                    cM(b, 0);
+                    f = 32;
+                    break;
+                  }
+                } else {
+                  o = eP(QA(b, 88593) | 0, 0) | 0;
+                  h[23293] = +$O(b);
+                  qm(b);
+                  g = sm(b) | 0;
+                  Nq(b, k, 0) | 0;
+                  i = tm(b) | 0;
+                  j = mH(b, 0, n) | 0;
+                  d = lH(b, -1, 8) | 0;
+                  c[46795] = d;
+                  e = (d | 0) < 0;
+                  do
+                    if (!j) {
+                      if (((g | 0) != 0) & e) {
+                        c[46795] = 8;
+                        c[(n + 16) >> 2] = 2;
+                        f = 11;
+                        break;
+                      }
+                      c[(n + 16) >> 2] = 2;
+                      if ((d | 0) <= -1) {
+                        um(b, g, i);
+                        Qq(b, k) | 0;
+                        rm(b);
+                        if (!((o << 24) >> 24)) {
+                          fn(b);
+                          break;
+                        } else {
+                          vm(b);
+                          break;
+                        }
+                      } else f = 11;
+                    } else if (e) {
+                      c[46795] = 8;
+                      f = 11;
+                    } else f = 11;
+                  while (0);
+                  if ((f | 0) == 11) {
+                    j = sG(b, p, 88892, m) | 0;
+                    d = c[p >> 2] | 0;
+                    do
+                      if ((d | 0) <= 1) {
+                        um(b, g, i);
+                        Qq(b, k) | 0;
+                        if (!((o << 24) >> 24)) {
+                          fn(b);
+                          break;
+                        } else {
+                          vm(b);
+                          break;
+                        }
+                      } else {
+                        f = (o << 24) >> 24 == 0;
+                        e = 0;
+                        while (1) {
+                          if ((e | 0) >= (d | 0)) break;
+                          d = c[(j + (e << 2)) >> 2] | 0;
+                          KG(d) | 0;
+                          um(d, g, i);
+                          Qq(d, k) | 0;
+                          oQ(d, 2);
+                          if (f) fn(d);
+                          else vm(d);
+                          e = (e + 1) | 0;
+                          d = c[p >> 2] | 0;
+                        }
+                        if (!(a[m >> 0] | 0)) e = 0;
+                        else {
+                          e = JK(d) | 0;
+                          a[e >> 0] = 1;
+                          d = c[p >> 2] | 0;
+                        }
+                        c[(n + 8) >> 2] = c[46795];
+                        c[(n + 20) >> 2] = e;
+                        c[(n + 12) >> 2] = 1;
+                        iH(d, j, b, n) | 0;
+                        U1(e);
+                      }
+                    while (0);
+                    BP(b);
+                    rm(b);
+                    d = 0;
+                    while (1) {
+                      if ((d | 0) >= (c[p >> 2] | 0)) break;
+                      n = c[(j + (d << 2)) >> 2] | 0;
+                      Dn(n);
+                      VC(n, 137483) | 0;
+                      wC(b, n) | 0;
+                      d = (d + 1) | 0;
+                    }
+                    U1(j);
+                  }
+                  cM(b, ((o << 24) >> 24 == 0) & 1);
+                  f = 32;
+                }
+              while (0);
+              if ((f | 0) == 32) h[23293] = q;
+              l = r;
+              return;
+            }
+            function qm(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              oQ(a, 2);
+              f = ZO(a, GA(a, 0, 91368, 0) | 0, 2, 2) | 0;
+              d = (ZO(a, GA(a, 0, 91374, 0) | 0, f, 2) | 0) & 65535;
+              b[((c[((yC(a) | 0) + 16) >> 2] | 0) + 176) >> 1] = d;
+              d = c[((c[(a + 60) >> 2] | 0) + 16) >> 2] | 0;
+              g = (d + 176) | 0;
+              e = b[g >> 1] | 0;
+              e = (e & 65535) < 10 ? e : 10;
+              b[g >> 1] = e;
+              e = e & 65535;
+              c[47137] = e;
+              b[(d + 178) >> 1] = (f | 0) < (e | 0) ? f : e;
+              Fm(a);
+              return;
+            }
+            function rm(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              f = l;
+              l = (l + 1040) | 0;
+              e = f;
+              d = (f + 8) | 0;
+              a: do
+                if (((c[47137] | 0) > 2) & ((c[47171] | 0) != 0)) {
+                  b = jC(a) | 0;
+                  while (1) {
+                    if (!b) break a;
+                    h[e >> 3] = +h[((c[((c[(b + 16) >> 2] | 0) + 132) >> 2] | 0) + 16) >> 3] * 72.0;
+                    m4(d, 101209, e) | 0;
+                    KA(b, c[47171] | 0, d) | 0;
+                    b = kC(a, b) | 0;
+                  }
+                }
+              while (0);
+              l = f;
+              return;
+            }
+            function sm(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              f = l;
+              l = (l + 16) | 0;
+              e = f;
+              d = QA(b, 89577) | 0;
+              a: do
+                if (!d) b = 1;
+                else {
+                  switch (a[d >> 0] | 0) {
+                    case 0: {
+                      b = 1;
+                      break a;
+                    }
+                    case 75: {
+                      if (!(s2(d, 89582) | 0)) {
+                        b = 0;
+                        break a;
+                      }
+                      break;
+                    }
+                    case 109: {
+                      if (!(s2(d, 89585) | 0)) {
+                        b = 1;
+                        break a;
+                      }
+                      break;
+                    }
+                    case 104: {
+                      if (!(s2(d, 89591) | 0)) {
+                        b = 2;
+                        break a;
+                      }
+                      break;
+                    }
+                    default: {
+                    }
+                  }
+                  b = KB(b) | 0;
+                  c[e >> 2] = d;
+                  c[(e + 4) >> 2] = b;
+                  gA(0, 89596, e) | 0;
+                  b = 1;
+                }
+              while (0);
+              l = f;
+              return b | 0;
+            }
+            function tm(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 32) | 0;
+              g = (h + 16) | 0;
+              f = (h + 8) | 0;
+              e = h;
+              d = QA(b, 89360) | 0;
+              a: do
+                if (!d) b = 0;
+                else {
+                  switch (a[d >> 0] | 0) {
+                    case 0: {
+                      b = 0;
+                      break a;
+                    }
+                    case 99: {
+                      if (!(s2(d, 89366) | 0)) {
+                        b = 1;
+                        break a;
+                      }
+                      break;
+                    }
+                    case 115: {
+                      if (!(s2(d, 89374) | 0)) {
+                        b = 2;
+                        break a;
+                      }
+                      if (!(s2(d, 89381) | 0)) {
+                        b = 0;
+                        break a;
+                      }
+                      break;
+                    }
+                    case 109: {
+                      if (!(s2(d, 89391) | 0)) {
+                        if (GA(b, 2, 92493, 0) | 0) {
+                          b = 3;
+                          break a;
+                        }
+                        c[e >> 2] = KB(b) | 0;
+                        gA(0, 89395, e) | 0;
+                        gA(3, 89458, f) | 0;
+                        b = 0;
+                        break a;
+                      }
+                      break;
+                    }
+                    default: {
+                    }
+                  }
+                  b = KB(b) | 0;
+                  c[g >> 2] = d;
+                  c[(g + 4) >> 2] = b;
+                  gA(0, 89515, g) | 0;
+                  b = 0;
+                }
+              while (0);
+              l = h;
+              return b | 0;
+            }
+            function um(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              e = QA(a, 91061) | 0;
+              if (!e)
+                if ((b | 0) == 1) e = 200;
+                else e = ((tB(a) | 0) * 100) | 0;
+              else e = q5(e) | 0;
+              c[47136] = e;
+              e = wn(a, b) | 0;
+              do
+                if (!(((e | 0) < 2) | ((c[47136] | 0) < 0)))
+                  if (!b) {
+                    xm(a, e, d);
+                    break;
+                  } else {
+                    wm(a, e, b, d, c[47137] | 0);
+                    break;
+                  }
+              while (0);
+              return;
+            }
+            function vm(a) {
+              a = a | 0;
+              BP(a);
+              Zm(a, 1);
+              return;
+            }
+            function wm(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0.0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0;
+              u = l;
+              l = (l + 64) | 0;
+              r = (u + 40) | 0;
+              o = (u + 24) | 0;
+              n = u;
+              p = (u + 48) | 0;
+              t = (u + 44) | 0;
+              q = (d | 0) == 2;
+              i = nm(a, b, q ? 0 : 2) | 0;
+              j = Em(a) | 0;
+              k = j | 4;
+              s = KK(f << 2) | 0;
+              c[s >> 2] = KK(O(b << 3, f) | 0) | 0;
+              g = c[47137] | 0;
+              f = 1;
+              while (1) {
+                if ((f | 0) >= (g | 0)) break;
+                c[(s + (f << 2)) >> 2] = (c[s >> 2] | 0) + ((O(f, b) | 0) << 3);
+                f = (f + 1) | 0;
+              }
+              g = (i | 0) == 0;
+              f = g ? k : j;
+              if (0) {
+                k = c[15712] | 0;
+                j = c[47136] | 0;
+                m = +h[23294];
+                c[n >> 2] = e;
+                c[(n + 4) >> 2] = g & 1;
+                c[(n + 8) >> 2] = f & 3;
+                c[(n + 12) >> 2] = j;
+                h[(n + 16) >> 3] = m;
+                w4(k, 89173, n) | 0;
+                U4(89230, 15, 1, k) | 0;
+                TO();
+                U4(89246, 13, 1, k) | 0;
+              }
+              n = Am(a, b, p, d, e, t) | 0;
+              if (0) {
+                k = c[15712] | 0;
+                m = +UO();
+                c[o >> 2] = b;
+                h[(o + 8) >> 3] = m;
+                w4(k, 89260, o) | 0;
+              }
+              if ((d | 0) != 1) {
+                m = +_O(a, GA(a, 0, 89279, 0) | 0, 0.0, -1797693134862315708145274.0e284);
+                if (q) {
+                  f = Br(n, b, c[p >> 2] | 0, s, c[t >> 2] | 0, c[47137] | 0, f, e, c[47136] | 0, m) | 0;
+                  g = 12;
+                } else g = 14;
+              } else {
+                f = on(n, b, c[p >> 2] | 0, s, c[t >> 2] | 0, c[47137] | 0, f, e, c[47136] | 0) | 0;
+                g = 12;
+              }
+              if ((g | 0) == 12)
+                if ((f | 0) < 0) gA(3, 89289, r) | 0;
+                else g = 14;
+              a: do
+                if ((g | 0) == 14) {
+                  g = jC(a) | 0;
+                  while (1) {
+                    if (!g) break a;
+                    k = c[(g + 16) >> 2] | 0;
+                    i = c[(k + 120) >> 2] | 0;
+                    j = c[47137] | 0;
+                    k = (k + 132) | 0;
+                    f = 0;
+                    while (1) {
+                      if ((f | 0) >= (j | 0)) break;
+                      h[((c[k >> 2] | 0) + (f << 3)) >> 3] = +h[((c[(s + (f << 2)) >> 2] | 0) + (i << 3)) >> 3];
+                      f = (f + 1) | 0;
+                    }
+                    g = kC(a, g) | 0;
+                  }
+                }
+              while (0);
+              as(n);
+              U1(c[s >> 2] | 0);
+              U1(s);
+              U1(c[t >> 2] | 0);
+              l = u;
+              return;
+            }
+            function xm(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0.0,
+                j = 0;
+              g = l;
+              l = (l + 48) | 0;
+              f = (g + 32) | 0;
+              e = g;
+              switch (d | 0) {
+                case 2: {
+                  ym(a, b);
+                  break;
+                }
+                case 1: {
+                  if (!(xr(a, b) | 0)) {
+                    c[e >> 2] = KB(a) | 0;
+                    gA(0, 88902, e) | 0;
+                    gA(3, 93364, (g + 8) | 0) | 0;
+                    gA(3, 88954, (g + 16) | 0) | 0;
+                    gA(3, 89026, (g + 24) | 0) | 0;
+                    Un(a, b);
+                  }
+                  break;
+                }
+                default: {
+                  Un(a, b);
+                  if ((d | 0) == 3) zm(a);
+                }
+              }
+              In(a, b);
+              Jn(a, b);
+              if (0) {
+                e = c[15712] | 0;
+                j = c[47136] | 0;
+                i = +h[23294];
+                c[f >> 2] = d;
+                c[(f + 4) >> 2] = j;
+                h[(f + 8) >> 3] = i;
+                w4(e, 89064, f) | 0;
+                TO();
+              }
+              Kn(a, b);
+              l = g;
+              return;
+            }
+            function ym(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 16) | 0;
+              g = Am(a, b, j, 0, 2, 0) | 0;
+              i = ct(g, b) | 0;
+              e = (a + 16) | 0;
+              a = 0;
+              while (1) {
+                if ((a | 0) >= (b | 0)) break;
+                f = (i + (a << 2)) | 0;
+                d = 0;
+                while (1) {
+                  if ((d | 0) == (b | 0)) break;
+                  h[((c[((c[((c[e >> 2] | 0) + 160) >> 2] | 0) + (a << 2)) >> 2] | 0) + (d << 3)) >> 3] = +(
+                    c[((c[f >> 2] | 0) + (d << 2)) >> 2] | 0
+                  );
+                  d = (d + 1) | 0;
+                }
+                a = (a + 1) | 0;
+              }
+              U1(c[i >> 2] | 0);
+              U1(i);
+              as(g);
+              l = j;
+              return;
+            }
+            function zm(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0.0;
+              f = (a + 16) | 0;
+              d = jC(a) | 0;
+              while (1) {
+                if (!d) break;
+                b = XA(a, d) | 0;
+                while (1) {
+                  if (!b) break;
+                  g = c[b >> 2] & 3;
+                  e = (c[c[(((g | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] >> 2] | 0) >>> 4;
+                  g = (c[c[(((g | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] >> 2] | 0) >>> 4;
+                  if ((e | 0) != (g | 0)) {
+                    j = +h[((c[(b + 16) >> 2] | 0) + 136) >> 3];
+                    i = c[((c[f >> 2] | 0) + 160) >> 2] | 0;
+                    h[((c[(i + (g << 2)) >> 2] | 0) + (e << 3)) >> 3] = j;
+                    h[((c[(i + (e << 2)) >> 2] | 0) + (g << 3)) >> 3] = j;
+                  }
+                  b = ZA(a, b) | 0;
+                }
+                d = kC(a, d) | 0;
+              }
+              return;
+            }
+            function Am(a, b, d, e, f, i) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              i = i | 0;
+              var j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0.0,
+                I = 0;
+              j = uB(a) | 0;
+              G = VL() | 0;
+              if ((f | 0) == 2) {
+                k = 0;
+                D = 0;
+              } else {
+                D = GA(a, 2, 92493, 0) | 0;
+                k = ((c[47174] | 0) != 0) & 1;
+                D = (D | 0) != 0;
+              }
+              A = (e | 1 | 0) == 3;
+              E = KK((b * 20) | 0) | 0;
+              F = KK(b << 2) | 0;
+              l = ((j << 1) + b) << 2;
+              m = KK(l) | 0;
+              z = A | D;
+              if (z) f = KK(l) | 0;
+              else f = 0;
+              C = (k | 0) != 0;
+              if (C) j = KK(l) | 0;
+              else j = 0;
+              if (A) k = KK(l) | 0;
+              else k = 0;
+              l = 0;
+              x = jC(a) | 0;
+              y = 0;
+              while (1) {
+                if (!x) break;
+                YL(G);
+                if ((c[((c[(x + 16) >> 2] | 0) + 120) >> 2] | 0) != (y | 0)) {
+                  B = 12;
+                  break;
+                }
+                c[(F + (y << 2)) >> 2] = x;
+                u = (E + ((y * 20) | 0) + 4) | 0;
+                c[u >> 2] = m;
+                v = (E + ((y * 20) | 0) + 8) | 0;
+                c[v >> 2] = z ? f : 0;
+                w = (E + ((y * 20) | 0) + 12) | 0;
+                c[w >> 2] = C ? j : 0;
+                c[(E + ((y * 20) | 0) + 16) >> 2] = A ? k : 0;
+                r = 1;
+                t = aB(a, x) | 0;
+                s = 1;
+                q = l;
+                m = (m + 4) | 0;
+                f = z ? (f + 4) | 0 : f;
+                j = C ? (j + 4) | 0 : j;
+                k = A ? (k + 4) | 0 : k;
+                while (1) {
+                  if (!t) break;
+                  n = c[t >> 2] & 3;
+                  p = (t + -48) | 0;
+                  l = (t + 48) | 0;
+                  do
+                    if ((c[(((n | 0) == 2 ? t : p) + 40) >> 2] | 0) == (c[(((n | 0) == 3 ? t : l) + 40) >> 2] | 0)) {
+                      n = r;
+                      p = s;
+                      l = q;
+                    } else {
+                      n = Bm(G, t, r) | 0;
+                      if ((n | 0) != (r | 0)) {
+                        if (C) {
+                          p = ((c[w >> 2] | 0) + (n << 2)) | 0;
+                          g[p >> 2] = +h[((c[(t + 16) >> 2] | 0) + 128) >> 3] + +g[p >> 2];
+                        }
+                        if (!D) {
+                          n = r;
+                          p = s;
+                          l = q;
+                          break;
+                        }
+                        n = ((c[v >> 2] | 0) + (n << 2)) | 0;
+                        H = +h[((c[(t + 16) >> 2] | 0) + 136) >> 3];
+                        o = +(~~+g[n >> 2] | 0);
+                        g[n >> 2] = H > o ? H : o;
+                        n = r;
+                        p = s;
+                        l = q;
+                        break;
+                      }
+                      I = c[t >> 2] & 3;
+                      l = (I | 0) == 3 ? t : l;
+                      q = (q + 1) | 0;
+                      n = (r + 1) | 0;
+                      r = (m + 4) | 0;
+                      c[m >> 2] =
+                        c[
+                          ((c[
+                            ((c[(((c[(l + 40) >> 2] | 0) == (x | 0) ? ((I | 0) == 2 ? t : p) : l) + 40) >> 2] | 0) +
+                              16) >>
+                              2
+                          ] |
+                            0) +
+                            120) >>
+                            2
+                        ];
+                      if (C) {
+                        g[j >> 2] = +h[((c[(t + 16) >> 2] | 0) + 128) >> 3];
+                        j = (j + 4) | 0;
+                      }
+                      if (D) {
+                        l = (f + 4) | 0;
+                        g[f >> 2] = +h[((c[(t + 16) >> 2] | 0) + 136) >> 3];
+                        if (A) {
+                          f = l;
+                          B = 27;
+                        } else f = l;
+                      } else if (A) {
+                        g[f >> 2] = 1.0;
+                        f = (f + 4) | 0;
+                        B = 27;
+                      }
+                      if ((B | 0) == 27) {
+                        B = 0;
+                        l = QA(t, 101559) | 0;
+                        if ((l | 0) != 0 ? (Q2(l, 135709, 4) | 0) == 0 : 0) o = 0.0;
+                        else o = (x | 0) == (c[((((c[t >> 2] & 3) | 0) == 2 ? t : p) + 40) >> 2] | 0) ? 1.0 : -1.0;
+                        g[k >> 2] = o;
+                        k = (k + 4) | 0;
+                      }
+                      p = (s + 1) | 0;
+                      l = q;
+                      m = r;
+                    }
+                  while (0);
+                  r = n;
+                  t = bB(a, t, x) | 0;
+                  s = p;
+                  q = l;
+                }
+                c[(E + ((y * 20) | 0)) >> 2] = s;
+                c[c[u >> 2] >> 2] = y;
+                l = q;
+                x = kC(a, x) | 0;
+                y = (y + 1) | 0;
+              }
+              if ((B | 0) == 12) qa(89103, 89118, 819, 89130);
+              if (A) Cm(E, b, e, F);
+              n = ((l | 0) / 2) | 0;
+              a: do
+                if ((n | 0) != (uB(a) | 0)) {
+                  l = ((n << 1) + b) << 2;
+                  k = MK(c[(E + 4) >> 2] | 0, l) | 0;
+                  if (D) f = MK(c[(E + 8) >> 2] | 0, l) | 0;
+                  if (C) {
+                    m = 0;
+                    j = MK(c[(E + 12) >> 2] | 0, l) | 0;
+                  } else m = 0;
+                  while (1) {
+                    if ((m | 0) >= (b | 0)) break a;
+                    l = c[(E + ((m * 20) | 0)) >> 2] | 0;
+                    c[(E + ((m * 20) | 0) + 4) >> 2] = k;
+                    if (D) {
+                      c[(E + ((m * 20) | 0) + 8) >> 2] = f;
+                      f = (f + (l << 2)) | 0;
+                    }
+                    if (C) {
+                      c[(E + ((m * 20) | 0) + 12) >> 2] = j;
+                      j = (j + (l << 2)) | 0;
+                    }
+                    m = (m + 1) | 0;
+                    k = (k + (l << 2)) | 0;
+                  }
+                }
+              while (0);
+              c[d >> 2] = n;
+              if (!i) U1(F);
+              else c[i >> 2] = F;
+              ZL(G);
+              return E | 0;
+            }
+            function Bm(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              f = c[b >> 2] & 3;
+              e = c[((c[((c[(((f | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 120) >> 2] | 0;
+              b = c[((c[((c[(((f | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 120) >> 2] | 0;
+              f = (e | 0) > (b | 0);
+              return _L(a, f ? b : e, f ? e : b, d) | 0;
+            }
+            function Cm(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0;
+              g = 0;
+              while (1) {
+                if ((g | 0) >= (d | 0)) {
+                  g = 0;
+                  break;
+                }
+                h = c[((c[(f + (g << 2)) >> 2] | 0) + 16) >> 2] | 0;
+                a[(h + 157) >> 0] = 0;
+                a[(h + 158) >> 0] = 0;
+                g = (g + 1) | 0;
+              }
+              while (1) {
+                if ((g | 0) >= (d | 0)) break;
+                if (!(a[((c[((c[(f + (g << 2)) >> 2] | 0) + 16) >> 2] | 0) + 157) >> 0] | 0)) Dm(b, g, e, f);
+                g = (g + 1) | 0;
+              }
+              return;
+            }
+            function Dm(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0,
+                q = 0;
+              q = ((c[(f + (d << 2)) >> 2] | 0) + 16) | 0;
+              l = c[q >> 2] | 0;
+              a[(l + 157) >> 0] = 1;
+              a[(l + 158) >> 0] = 1;
+              l = (b + ((d * 20) | 0)) | 0;
+              m = (b + ((d * 20) | 0) + 16) | 0;
+              n = (b + ((d * 20) | 0) + 4) | 0;
+              o = (e | 0) == 3 ? -1.0 : 1.0;
+              k = 1;
+              a: while (1) {
+                if ((k | 0) >= (c[l >> 2] | 0)) {
+                  h = 14;
+                  break;
+                }
+                h = ((c[m >> 2] | 0) + (k << 2)) | 0;
+                do
+                  if (!(+g[h >> 2] == 1.0)) {
+                    p = c[((c[n >> 2] | 0) + (k << 2)) >> 2] | 0;
+                    i = c[((c[(f + (p << 2)) >> 2] | 0) + 16) >> 2] | 0;
+                    if (!(a[(i + 158) >> 0] | 0)) {
+                      if (a[(i + 157) >> 0] | 0) break;
+                      Dm(b, p, e, f);
+                      break;
+                    }
+                    g[h >> 2] = o;
+                    i = (b + ((p * 20) | 0) + 4) | 0;
+                    j = c[(b + ((p * 20) | 0)) >> 2] | 0;
+                    h = 1;
+                    while (1) {
+                      if ((h | 0) >= (j | 0)) {
+                        h = 9;
+                        break a;
+                      }
+                      if ((c[((c[i >> 2] | 0) + (h << 2)) >> 2] | 0) == (d | 0)) break;
+                      h = (h + 1) | 0;
+                    }
+                    g[((c[(b + ((p * 20) | 0) + 16) >> 2] | 0) + (h << 2)) >> 2] = -1.0;
+                  }
+                while (0);
+                k = (k + 1) | 0;
+              }
+              if ((h | 0) == 9) qa(89144, 89118, 721, 89164);
+              else if ((h | 0) == 14) {
+                a[((c[q >> 2] | 0) + 158) >> 0] = 0;
+                return;
+              }
+            }
+            function Em(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              d = l;
+              l = (l + 16) | 0;
+              b = d;
+              a = ZO(a, GA(a, 0, 89305, 0) | 0, 2, 0) | 0;
+              if (((a | 0) == 0) | ((a | 0) > 2)) {
+                c[b >> 2] = 89305;
+                gA(0, 89314, b) | 0;
+                a = 2;
+              }
+              l = d;
+              return a | 0;
+            }
+            function Fm(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              d = tB(a) | 0;
+              c[46796] = GA(a, 1, 102623, 0) | 0;
+              e = GA(a, 1, 90660, 0) | 0;
+              b = jC(a) | 0;
+              while (1) {
+                if (!b) break;
+                Zl(b);
+                _l(c[46796] | 0, e, b, d) | 0;
+                b = kC(a, b) | 0;
+              }
+              d = jC(a) | 0;
+              while (1) {
+                if (!d) break;
+                b = XA(a, d) | 0;
+                while (1) {
+                  if (!b) break;
+                  Gm(b);
+                  b = ZA(a, b) | 0;
+                }
+                d = kC(a, d) | 0;
+              }
+              return;
+            }
+            function Gm(a) {
+              a = a | 0;
+              var b = 0.0;
+              TC(a, 137460, 176, 1) | 0;
+              tP(a) | 0;
+              b = +_O(a, c[47174] | 0, 1.0, 1.0);
+              h[((c[(a + 16) >> 2] | 0) + 128) >> 3] = b;
+              return;
+            }
+            function Hm(a, d, e) {
+              a = a | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              a = JK(64) | 0;
+              e = (a + 8) | 0;
+              f = (d + 8) | 0;
+              g = (e + 48) | 0;
+              do {
+                c[e >> 2] = c[f >> 2];
+                e = (e + 4) | 0;
+                f = (f + 4) | 0;
+              } while ((e | 0) < (g | 0));
+              d = c[(d + 56) >> 2] | 0;
+              c[(a + 56) >> 2] = d;
+              b[((c[(d + 16) >> 2] | 0) + 168) >> 1] = 1;
+              return a | 0;
+            }
+            function Im(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              U1(b);
+              return;
+            }
+            function Jm(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              a = c[b >> 2] | 0;
+              e = c[d >> 2] | 0;
+              if (a >>> 0 <= e >>> 0)
+                if (a >>> 0 >= e >>> 0) {
+                  e = c[(b + 24) >> 2] | 0;
+                  a = c[(d + 24) >> 2] | 0;
+                  if (e >>> 0 <= a >>> 0)
+                    if (e >>> 0 >= a >>> 0) {
+                      a = ~~(+h[(b + 8) >> 3] - +h[(d + 8) >> 3]);
+                      if (!a) {
+                        a = ~~(+h[(b + 16) >> 3] - +h[(d + 16) >> 3]);
+                        if (!a) {
+                          a = ~~(+h[(b + 32) >> 3] - +h[(d + 32) >> 3]);
+                          if (!a) a = ~~(+h[(b + 40) >> 3] - +h[(d + 40) >> 3]);
+                        }
+                      }
+                    } else a = -1;
+                  else a = 1;
+                } else a = -1;
+              else a = 1;
+              return a | 0;
+            }
+            function Km(d, e, f) {
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0.0;
+              k = l;
+              l = (l + 16) | 0;
+              g = k;
+              h = (e + 16) | 0;
+              i = b[((c[h >> 2] | 0) + 168) >> 1] | 0;
+              j = (i << 16) >> 16;
+              if (((i << 16) >> 16 != 1) & ((a[194954] | 0) == 0)) {
+                i = KK(j << 2) | 0;
+                g = 0;
+                while (1) {
+                  if ((g | 0) >= (j | 0)) break;
+                  c[(i + (g << 2)) >> 2] = e;
+                  e = c[((c[(e + 16) >> 2] | 0) + 172) >> 2] | 0;
+                  g = (g + 1) | 0;
+                }
+                m = +(f | 0);
+                lO(d, i, 0, j, m, m, 17792);
+                e = 0;
+                while (1) {
+                  if ((e | 0) >= (j | 0)) break;
+                  g = c[(i + (e << 2)) >> 2] | 0;
+                  h = (g + 16) | 0;
+                  if (c[((c[h >> 2] | 0) + 96) >> 2] | 0) {
+                    f = xC(c[((((c[g >> 2] & 3) | 0) == 3 ? g : (g + 48) | 0) + 40) >> 2] | 0) | 0;
+                    zP(f, c[((c[h >> 2] | 0) + 96) >> 2] | 0);
+                  }
+                  sO(g);
+                  e = (e + 1) | 0;
+                }
+                U1(i);
+              } else {
+                c[g >> 2] = e;
+                m = +(f | 0);
+                lO(d, g, 0, 1, m, m, 17792);
+                if (c[((c[h >> 2] | 0) + 96) >> 2] | 0) {
+                  j = xC(c[((((c[e >> 2] & 3) | 0) == 3 ? e : (e + 48) | 0) + 40) >> 2] | 0) | 0;
+                  zP(j, c[((c[h >> 2] | 0) + 96) >> 2] | 0);
+                }
+                sO(e);
+              }
+              l = k;
+              return;
+            }
+            function Lm(a) {
+              a = a | 0;
+              return 0;
+            }
+            function Mm(a) {
+              a = a | 0;
+              return 0;
+            }
+            function Nm(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                i = 0,
+                j = 0,
+                k = 0.0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0,
+                r = 0,
+                s = 0.0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0.0,
+                x = 0.0,
+                y = 0.0,
+                z = 0,
+                A = 0,
+                B = 0,
+                D = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                O = 0,
+                P = 0,
+                Q = 0;
+              Q = l;
+              l = (l + 384) | 0;
+              O = (Q + 368) | 0;
+              P = (Q + 112) | 0;
+              j = (Q + 32) | 0;
+              r = (Q + 336) | 0;
+              K = (Q + 320) | 0;
+              L = (Q + 304) | 0;
+              M = (Q + 288) | 0;
+              N = (Q + 272) | 0;
+              i = (Q + 256) | 0;
+              H = (Q + 240) | 0;
+              I = (Q + 224) | 0;
+              J = (Q + 208) | 0;
+              t = (Q + 192) | 0;
+              u = (Q + 176) | 0;
+              v = (Q + 160) | 0;
+              z = (Q + 144) | 0;
+              A = (Q + 128) | 0;
+              B = (Q + 96) | 0;
+              D = (Q + 16) | 0;
+              G = Q;
+              a: do
+                switch (WM(b) | 0) {
+                  case 3:
+                  case 1: {
+                    f = JK(8) | 0;
+                    z = (b + 16) | 0;
+                    b = c[z >> 2] | 0;
+                    i = c[(b + 12) >> 2] | 0;
+                    do
+                      if (!((e << 24) >> 24)) {
+                        b = c[(i + 8) >> 2] | 0;
+                        if ((b | 0) > 2) {
+                          y = 0.0;
+                          j = c[(i + 44) >> 2] | 0;
+                          e = 0;
+                          p = +g[d >> 2];
+                          q = +g[(d + 4) >> 2];
+                          break;
+                        } else {
+                          y = +B5() * 0.01;
+                          b = 8;
+                          j = 0;
+                          e = 1;
+                          p = 0.0;
+                          q = 0.0;
+                          break;
+                        }
+                      } else if (!(c[(i + 40) >> 2] & 2048)) {
+                        q = +h[(b + 88) >> 3];
+                        p = -q;
+                        y = +h[(b + 80) >> 3];
+                        x = y * -0.5;
+                        h[j >> 3] = p;
+                        h[(j + 8) >> 3] = x;
+                        h[(j + 16) >> 3] = q;
+                        h[(j + 24) >> 3] = x;
+                        y = y * 0.5;
+                        h[(j + 32) >> 3] = q;
+                        h[(j + 40) >> 3] = y;
+                        h[(j + 48) >> 3] = p;
+                        h[(j + 56) >> 3] = y;
+                        y = 0.0;
+                        b = 4;
+                        e = 0;
+                        p = 0.0;
+                        q = 0.0;
+                        break;
+                      } else {
+                        yP(r, i);
+                        p = +h[r >> 3];
+                        x = +h[(r + 8) >> 3];
+                        q = +h[(r + 16) >> 3];
+                        y = +h[(r + 24) >> 3];
+                        h[j >> 3] = p;
+                        h[(j + 8) >> 3] = x;
+                        h[(j + 16) >> 3] = q;
+                        h[(j + 24) >> 3] = x;
+                        h[(j + 32) >> 3] = q;
+                        h[(j + 40) >> 3] = y;
+                        h[(j + 48) >> 3] = p;
+                        h[(j + 56) >> 3] = y;
+                        y = 0.0;
+                        b = 4;
+                        e = 0;
+                        p = 0.0;
+                        q = 0.0;
+                        break;
+                      }
+                    while (0);
+                    c[(f + 4) >> 2] = b;
+                    r = JK(b << 4) | 0;
+                    c[f >> 2] = r;
+                    s = 1.0 / +(b | 0);
+                    t = (d + 8) | 0;
+                    u = (d + 4) | 0;
+                    v = (b | 0) == 4;
+                    w = -p;
+                    x = -q;
+                    i = 0;
+                    while (1) {
+                      if ((b | 0) <= (i | 0)) break a;
+                      do
+                        if (e) {
+                          k = +(i | 0) * 6.283185307179586 * s + y;
+                          m = +E(+k);
+                          k = +F(+k);
+                          if (!(a[t >> 0] | 0)) {
+                            P = c[z >> 2] | 0;
+                            n = k * +g[u >> 2] * +h[(P + 80) >> 3];
+                            k = m * +g[d >> 2] * (+h[(P + 96) >> 3] + +h[(P + 88) >> 3]);
+                          } else {
+                            P = c[z >> 2] | 0;
+                            n = (+h[(P + 80) >> 3] + +g[u >> 2]) * k;
+                            k = (+h[(P + 96) >> 3] + +h[(P + 88) >> 3] + +g[d >> 2]) * m;
+                          }
+                          o = k * 0.5;
+                          k = n * 0.5;
+                        } else {
+                          if (!(a[t >> 0] | 0)) {
+                            o = +h[(j + (i << 4)) >> 3] * p;
+                            k = +h[(j + (i << 4) + 8) >> 3] * q;
+                            break;
+                          }
+                          if (!v) {
+                            o = +h[(j + (i << 4)) >> 3];
+                            k = +h[(j + (i << 4) + 8) >> 3];
+                            n = +C(+(k * k + o * o));
+                            o = (p / n + 1.0) * o;
+                            k = (q / n + 1.0) * k;
+                            break;
+                          }
+                          switch (i | 0) {
+                            case 0: {
+                              m = q;
+                              k = p;
+                              break;
+                            }
+                            case 1: {
+                              m = q;
+                              k = w;
+                              break;
+                            }
+                            case 2: {
+                              m = x;
+                              k = w;
+                              break;
+                            }
+                            case 3: {
+                              m = x;
+                              k = p;
+                              break;
+                            }
+                            default: {
+                              m = 0.0;
+                              k = 0.0;
+                            }
+                          }
+                          o = +h[(j + (i << 4)) >> 3] + k;
+                          k = +h[(j + (i << 4) + 8) >> 3] + m;
+                        }
+                      while (0);
+                      O = c[z >> 2] | 0;
+                      P = (b - i + -1) | 0;
+                      h[(r + (P << 4)) >> 3] = +h[(O + 16) >> 3] + o;
+                      h[(r + (P << 4) + 8) >> 3] = +h[(O + 24) >> 3] + k;
+                      i = (i + 1) | 0;
+                    }
+                  }
+                  case 2: {
+                    G = (b + 16) | 0;
+                    f = c[((c[G >> 2] | 0) + 12) >> 2] | 0;
+                    k = +h[(f + 16) >> 3];
+                    o = +h[(f + 24) >> 3];
+                    m = +h[(f + 32) >> 3];
+                    n = +h[(f + 40) >> 3];
+                    f = JK(8) | 0;
+                    c[(f + 4) >> 2] = 4;
+                    b = JK(64) | 0;
+                    c[f >> 2] = b;
+                    G = ((c[G >> 2] | 0) + 16) | 0;
+                    c[P >> 2] = c[G >> 2];
+                    c[(P + 4) >> 2] = c[(G + 4) >> 2];
+                    c[(P + 8) >> 2] = c[(G + 8) >> 2];
+                    c[(P + 12) >> 2] = c[(G + 12) >> 2];
+                    if (!(a[(d + 8) >> 0] | 0)) {
+                      c[O >> 2] = c[P >> 2];
+                      c[(O + 4) >> 2] = c[(P + 4) >> 2];
+                      c[(O + 8) >> 2] = c[(P + 8) >> 2];
+                      c[(O + 12) >> 2] = c[(P + 12) >> 2];
+                      Pm(i, k, o, O, d);
+                      c[b >> 2] = c[i >> 2];
+                      c[(b + 4) >> 2] = c[(i + 4) >> 2];
+                      c[(b + 8) >> 2] = c[(i + 8) >> 2];
+                      c[(b + 12) >> 2] = c[(i + 12) >> 2];
+                      N = ((c[f >> 2] | 0) + 16) | 0;
+                      c[O >> 2] = c[P >> 2];
+                      c[(O + 4) >> 2] = c[(P + 4) >> 2];
+                      c[(O + 8) >> 2] = c[(P + 8) >> 2];
+                      c[(O + 12) >> 2] = c[(P + 12) >> 2];
+                      Pm(H, k, n, O, d);
+                      c[N >> 2] = c[H >> 2];
+                      c[(N + 4) >> 2] = c[(H + 4) >> 2];
+                      c[(N + 8) >> 2] = c[(H + 8) >> 2];
+                      c[(N + 12) >> 2] = c[(H + 12) >> 2];
+                      N = ((c[f >> 2] | 0) + 32) | 0;
+                      c[O >> 2] = c[P >> 2];
+                      c[(O + 4) >> 2] = c[(P + 4) >> 2];
+                      c[(O + 8) >> 2] = c[(P + 8) >> 2];
+                      c[(O + 12) >> 2] = c[(P + 12) >> 2];
+                      Pm(I, m, n, O, d);
+                      c[N >> 2] = c[I >> 2];
+                      c[(N + 4) >> 2] = c[(I + 4) >> 2];
+                      c[(N + 8) >> 2] = c[(I + 8) >> 2];
+                      c[(N + 12) >> 2] = c[(I + 12) >> 2];
+                      N = ((c[f >> 2] | 0) + 48) | 0;
+                      c[O >> 2] = c[P >> 2];
+                      c[(O + 4) >> 2] = c[(P + 4) >> 2];
+                      c[(O + 8) >> 2] = c[(P + 8) >> 2];
+                      c[(O + 12) >> 2] = c[(P + 12) >> 2];
+                      Pm(J, m, o, O, d);
+                      c[N >> 2] = c[J >> 2];
+                      c[(N + 4) >> 2] = c[(J + 4) >> 2];
+                      c[(N + 8) >> 2] = c[(J + 8) >> 2];
+                      c[(N + 12) >> 2] = c[(J + 12) >> 2];
+                      break a;
+                    } else {
+                      y = k - +g[d >> 2];
+                      J = (d + 4) | 0;
+                      x = o - +g[J >> 2];
+                      c[O >> 2] = c[P >> 2];
+                      c[(O + 4) >> 2] = c[(P + 4) >> 2];
+                      c[(O + 8) >> 2] = c[(P + 8) >> 2];
+                      c[(O + 12) >> 2] = c[(P + 12) >> 2];
+                      Om(K, y, x, O);
+                      c[b >> 2] = c[K >> 2];
+                      c[(b + 4) >> 2] = c[(K + 4) >> 2];
+                      c[(b + 8) >> 2] = c[(K + 8) >> 2];
+                      c[(b + 12) >> 2] = c[(K + 12) >> 2];
+                      K = ((c[f >> 2] | 0) + 16) | 0;
+                      x = k - +g[d >> 2];
+                      y = n + +g[J >> 2];
+                      c[O >> 2] = c[P >> 2];
+                      c[(O + 4) >> 2] = c[(P + 4) >> 2];
+                      c[(O + 8) >> 2] = c[(P + 8) >> 2];
+                      c[(O + 12) >> 2] = c[(P + 12) >> 2];
+                      Om(L, x, y, O);
+                      c[K >> 2] = c[L >> 2];
+                      c[(K + 4) >> 2] = c[(L + 4) >> 2];
+                      c[(K + 8) >> 2] = c[(L + 8) >> 2];
+                      c[(K + 12) >> 2] = c[(L + 12) >> 2];
+                      L = ((c[f >> 2] | 0) + 32) | 0;
+                      y = m + +g[d >> 2];
+                      x = n + +g[J >> 2];
+                      c[O >> 2] = c[P >> 2];
+                      c[(O + 4) >> 2] = c[(P + 4) >> 2];
+                      c[(O + 8) >> 2] = c[(P + 8) >> 2];
+                      c[(O + 12) >> 2] = c[(P + 12) >> 2];
+                      Om(M, y, x, O);
+                      c[L >> 2] = c[M >> 2];
+                      c[(L + 4) >> 2] = c[(M + 4) >> 2];
+                      c[(L + 8) >> 2] = c[(M + 8) >> 2];
+                      c[(L + 12) >> 2] = c[(M + 12) >> 2];
+                      M = ((c[f >> 2] | 0) + 48) | 0;
+                      x = m + +g[d >> 2];
+                      y = o - +g[J >> 2];
+                      c[O >> 2] = c[P >> 2];
+                      c[(O + 4) >> 2] = c[(P + 4) >> 2];
+                      c[(O + 8) >> 2] = c[(P + 8) >> 2];
+                      c[(O + 12) >> 2] = c[(P + 12) >> 2];
+                      Om(N, x, y, O);
+                      c[M >> 2] = c[N >> 2];
+                      c[(M + 4) >> 2] = c[(N + 4) >> 2];
+                      c[(M + 8) >> 2] = c[(N + 8) >> 2];
+                      c[(M + 12) >> 2] = c[(N + 12) >> 2];
+                      break a;
+                    }
+                  }
+                  case 4: {
+                    b = (b + 16) | 0;
+                    f = JK(8) | 0;
+                    c[(f + 4) >> 2] = 4;
+                    i = JK(64) | 0;
+                    c[f >> 2] = i;
+                    j = c[b >> 2] | 0;
+                    N = (j + 16) | 0;
+                    c[P >> 2] = c[N >> 2];
+                    c[(P + 4) >> 2] = c[(N + 4) >> 2];
+                    c[(P + 8) >> 2] = c[(N + 8) >> 2];
+                    c[(P + 12) >> 2] = c[(N + 12) >> 2];
+                    k = -+h[(j + 88) >> 3];
+                    if (!(a[(d + 8) >> 0] | 0)) {
+                      x = -+h[(j + 80) >> 3];
+                      c[O >> 2] = c[P >> 2];
+                      c[(O + 4) >> 2] = c[(P + 4) >> 2];
+                      c[(O + 8) >> 2] = c[(P + 8) >> 2];
+                      c[(O + 12) >> 2] = c[(P + 12) >> 2];
+                      Pm(A, k, x, O, d);
+                      c[i >> 2] = c[A >> 2];
+                      c[(i + 4) >> 2] = c[(A + 4) >> 2];
+                      c[(i + 8) >> 2] = c[(A + 8) >> 2];
+                      c[(i + 12) >> 2] = c[(A + 12) >> 2];
+                      N = ((c[f >> 2] | 0) + 16) | 0;
+                      M = c[b >> 2] | 0;
+                      x = -+h[(M + 88) >> 3];
+                      y = +h[(M + 80) >> 3];
+                      c[O >> 2] = c[P >> 2];
+                      c[(O + 4) >> 2] = c[(P + 4) >> 2];
+                      c[(O + 8) >> 2] = c[(P + 8) >> 2];
+                      c[(O + 12) >> 2] = c[(P + 12) >> 2];
+                      Pm(B, x, y, O, d);
+                      c[N >> 2] = c[B >> 2];
+                      c[(N + 4) >> 2] = c[(B + 4) >> 2];
+                      c[(N + 8) >> 2] = c[(B + 8) >> 2];
+                      c[(N + 12) >> 2] = c[(B + 12) >> 2];
+                      N = ((c[f >> 2] | 0) + 32) | 0;
+                      M = c[b >> 2] | 0;
+                      y = +h[(M + 96) >> 3];
+                      x = +h[(M + 80) >> 3];
+                      c[O >> 2] = c[P >> 2];
+                      c[(O + 4) >> 2] = c[(P + 4) >> 2];
+                      c[(O + 8) >> 2] = c[(P + 8) >> 2];
+                      c[(O + 12) >> 2] = c[(P + 12) >> 2];
+                      Pm(D, y, x, O, d);
+                      c[N >> 2] = c[D >> 2];
+                      c[(N + 4) >> 2] = c[(D + 4) >> 2];
+                      c[(N + 8) >> 2] = c[(D + 8) >> 2];
+                      c[(N + 12) >> 2] = c[(D + 12) >> 2];
+                      N = ((c[f >> 2] | 0) + 48) | 0;
+                      M = c[b >> 2] | 0;
+                      x = +h[(M + 96) >> 3];
+                      y = -+h[(M + 80) >> 3];
+                      c[O >> 2] = c[P >> 2];
+                      c[(O + 4) >> 2] = c[(P + 4) >> 2];
+                      c[(O + 8) >> 2] = c[(P + 8) >> 2];
+                      c[(O + 12) >> 2] = c[(P + 12) >> 2];
+                      Pm(G, x, y, O, d);
+                      c[N >> 2] = c[G >> 2];
+                      c[(N + 4) >> 2] = c[(G + 4) >> 2];
+                      c[(N + 8) >> 2] = c[(G + 8) >> 2];
+                      c[(N + 12) >> 2] = c[(G + 12) >> 2];
+                      break a;
+                    } else {
+                      y = k - +g[d >> 2];
+                      M = (d + 4) | 0;
+                      x = -+h[(j + 80) >> 3] - +g[M >> 2];
+                      c[O >> 2] = c[P >> 2];
+                      c[(O + 4) >> 2] = c[(P + 4) >> 2];
+                      c[(O + 8) >> 2] = c[(P + 8) >> 2];
+                      c[(O + 12) >> 2] = c[(P + 12) >> 2];
+                      Om(t, y, x, O);
+                      c[i >> 2] = c[t >> 2];
+                      c[(i + 4) >> 2] = c[(t + 4) >> 2];
+                      c[(i + 8) >> 2] = c[(t + 8) >> 2];
+                      c[(i + 12) >> 2] = c[(t + 12) >> 2];
+                      N = ((c[f >> 2] | 0) + 16) | 0;
+                      L = c[b >> 2] | 0;
+                      x = -+h[(L + 88) >> 3] - +g[d >> 2];
+                      y = +h[(L + 80) >> 3] + +g[M >> 2];
+                      c[O >> 2] = c[P >> 2];
+                      c[(O + 4) >> 2] = c[(P + 4) >> 2];
+                      c[(O + 8) >> 2] = c[(P + 8) >> 2];
+                      c[(O + 12) >> 2] = c[(P + 12) >> 2];
+                      Om(u, x, y, O);
+                      c[N >> 2] = c[u >> 2];
+                      c[(N + 4) >> 2] = c[(u + 4) >> 2];
+                      c[(N + 8) >> 2] = c[(u + 8) >> 2];
+                      c[(N + 12) >> 2] = c[(u + 12) >> 2];
+                      N = ((c[f >> 2] | 0) + 32) | 0;
+                      L = c[b >> 2] | 0;
+                      y = +h[(L + 96) >> 3] + +g[d >> 2];
+                      x = +h[(L + 80) >> 3] + +g[M >> 2];
+                      c[O >> 2] = c[P >> 2];
+                      c[(O + 4) >> 2] = c[(P + 4) >> 2];
+                      c[(O + 8) >> 2] = c[(P + 8) >> 2];
+                      c[(O + 12) >> 2] = c[(P + 12) >> 2];
+                      Om(v, y, x, O);
+                      c[N >> 2] = c[v >> 2];
+                      c[(N + 4) >> 2] = c[(v + 4) >> 2];
+                      c[(N + 8) >> 2] = c[(v + 8) >> 2];
+                      c[(N + 12) >> 2] = c[(v + 12) >> 2];
+                      N = ((c[f >> 2] | 0) + 48) | 0;
+                      L = c[b >> 2] | 0;
+                      x = +h[(L + 96) >> 3] + +g[d >> 2];
+                      y = -+h[(L + 80) >> 3] - +g[M >> 2];
+                      c[O >> 2] = c[P >> 2];
+                      c[(O + 4) >> 2] = c[(P + 4) >> 2];
+                      c[(O + 8) >> 2] = c[(P + 8) >> 2];
+                      c[(O + 12) >> 2] = c[(P + 12) >> 2];
+                      Om(z, x, y, O);
+                      c[N >> 2] = c[z >> 2];
+                      c[(N + 4) >> 2] = c[(z + 4) >> 2];
+                      c[(N + 8) >> 2] = c[(z + 8) >> 2];
+                      c[(N + 12) >> 2] = c[(z + 12) >> 2];
+                      break a;
+                    }
+                  }
+                  default:
+                    f = 0;
+                }
+              while (0);
+              l = Q;
+              return f | 0;
+            }
+            function Om(a, b, c, d) {
+              a = a | 0;
+              b = +b;
+              c = +c;
+              d = d | 0;
+              c = +h[(d + 8) >> 3] + c;
+              h[a >> 3] = +h[d >> 3] + b;
+              h[(a + 8) >> 3] = c;
+              return;
+            }
+            function Pm(a, b, c, d, e) {
+              a = a | 0;
+              b = +b;
+              c = +c;
+              d = d | 0;
+              e = e | 0;
+              c = +g[(e + 4) >> 2] * c + +h[(d + 8) >> 3];
+              h[a >> 3] = +g[e >> 2] * b + +h[d >> 3];
+              h[(a + 8) >> 3] = c;
+              return;
+            }
+            function Qm(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0;
+              o = l;
+              l = (l + 112) | 0;
+              j = (o + 88) | 0;
+              i = (o + 72) | 0;
+              k = (o + 32) | 0;
+              m = (o + 16) | 0;
+              n = o;
+              f = (o + 56) | 0;
+              g = (o + 40) | 0;
+              h = (b + 48) | 0;
+              r = ((c[((c[((((c[b >> 2] & 3) | 0) == 3 ? b : h) + 40) >> 2] | 0) + 16) >> 2] | 0) + 16) | 0;
+              p = (b + 16) | 0;
+              q = ((c[p >> 2] | 0) + 16) | 0;
+              c[i >> 2] = c[r >> 2];
+              c[(i + 4) >> 2] = c[(r + 4) >> 2];
+              c[(i + 8) >> 2] = c[(r + 8) >> 2];
+              c[(i + 12) >> 2] = c[(r + 12) >> 2];
+              c[j >> 2] = c[q >> 2];
+              c[(j + 4) >> 2] = c[(q + 4) >> 2];
+              c[(j + 8) >> 2] = c[(q + 8) >> 2];
+              c[(j + 12) >> 2] = c[(q + 12) >> 2];
+              Rm(f, i, j);
+              c[m >> 2] = c[f >> 2];
+              c[(m + 4) >> 2] = c[(f + 4) >> 2];
+              c[(m + 8) >> 2] = c[(f + 8) >> 2];
+              c[(m + 12) >> 2] = c[(f + 12) >> 2];
+              f = (b + -48) | 0;
+              q = ((c[((c[((((c[b >> 2] & 3) | 0) == 2 ? b : f) + 40) >> 2] | 0) + 16) >> 2] | 0) + 16) | 0;
+              p = ((c[p >> 2] | 0) + 56) | 0;
+              c[i >> 2] = c[q >> 2];
+              c[(i + 4) >> 2] = c[(q + 4) >> 2];
+              c[(i + 8) >> 2] = c[(q + 8) >> 2];
+              c[(i + 12) >> 2] = c[(q + 12) >> 2];
+              c[j >> 2] = c[p >> 2];
+              c[(j + 4) >> 2] = c[(p + 4) >> 2];
+              c[(j + 8) >> 2] = c[(p + 8) >> 2];
+              c[(j + 12) >> 2] = c[(p + 12) >> 2];
+              Rm(g, i, j);
+              c[n >> 2] = c[g >> 2];
+              c[(n + 4) >> 2] = c[(g + 4) >> 2];
+              c[(n + 8) >> 2] = c[(g + 8) >> 2];
+              c[(n + 12) >> 2] = c[(g + 12) >> 2];
+              if (!e) {
+                g = -1111;
+                f = -1111;
+              } else {
+                r = c[b >> 2] & 3;
+                g = c[((c[((c[(((r | 0) == 2 ? b : f) + 40) >> 2] | 0) + 16) >> 2] | 0) + 288) >> 2] | 0;
+                f = c[((c[((c[(((r | 0) == 3 ? b : h) + 40) >> 2] | 0) + 16) >> 2] | 0) + 288) >> 2] | 0;
+              }
+              c[i >> 2] = c[m >> 2];
+              c[(i + 4) >> 2] = c[(m + 4) >> 2];
+              c[(i + 8) >> 2] = c[(m + 8) >> 2];
+              c[(i + 12) >> 2] = c[(m + 12) >> 2];
+              c[j >> 2] = c[n >> 2];
+              c[(j + 4) >> 2] = c[(n + 4) >> 2];
+              c[(j + 8) >> 2] = c[(n + 8) >> 2];
+              c[(j + 12) >> 2] = c[(n + 12) >> 2];
+              MX(d, i, f, j, g, k) | 0;
+              p = k;
+              q = c[(p + 4) >> 2] | 0;
+              r = a;
+              c[r >> 2] = c[p >> 2];
+              c[(r + 4) >> 2] = q;
+              l = o;
+              return;
+            }
+            function Rm(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0;
+              d = +h[(c + 8) >> 3] + +h[(b + 8) >> 3];
+              h[a >> 3] = +h[c >> 3] + +h[b >> 3];
+              h[(a + 8) >> 3] = d;
+              return;
+            }
+            function Sm(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0;
+              u = l;
+              l = (l + 144) | 0;
+              p = (u + 104) | 0;
+              q = (u + 88) | 0;
+              o = (u + 80) | 0;
+              n = (u + 72) | 0;
+              j = (u + 64) | 0;
+              s = (u + 128) | 0;
+              k = (u + 32) | 0;
+              m = (u + 124) | 0;
+              t = (u + 16) | 0;
+              r = u;
+              i = (u + 120) | 0;
+              h = ((c[(b + 16) >> 2] | 0) + 144) | 0;
+              g = c[h >> 2] | 0;
+              h = c[(h + 4) >> 2] | 0;
+              v = j;
+              c[v >> 2] = g;
+              c[(v + 4) >> 2] = h;
+              v = g;
+              c[t >> 2] = c[v >> 2];
+              c[(t + 4) >> 2] = c[(v + 4) >> 2];
+              c[(t + 8) >> 2] = c[(v + 8) >> 2];
+              c[(t + 12) >> 2] = c[(v + 12) >> 2];
+              h = (g + ((h + -1) << 4)) | 0;
+              c[r >> 2] = c[h >> 2];
+              c[(r + 4) >> 2] = c[(h + 4) >> 2];
+              c[(r + 8) >> 2] = c[(h + 8) >> 2];
+              c[(r + 12) >> 2] = c[(h + 12) >> 2];
+              a: do
+                if (!((f << 24) >> 24)) {
+                  g = -1111;
+                  f = -1111;
+                } else {
+                  g = -1111;
+                  f = -1111;
+                  h = 0;
+                  while (1) {
+                    if ((h | 0) >= (e | 0)) break a;
+                    if ((f | 0) == -1111) {
+                      f = c[(d + (h << 2)) >> 2] | 0;
+                      c[q >> 2] = c[f >> 2];
+                      c[(q + 4) >> 2] = c[(f + 4) >> 2];
+                      c[p >> 2] = c[t >> 2];
+                      c[(p + 4) >> 2] = c[(t + 4) >> 2];
+                      c[(p + 8) >> 2] = c[(t + 8) >> 2];
+                      c[(p + 12) >> 2] = c[(t + 12) >> 2];
+                      f = (NX(q, p) | 0) == 0;
+                      f = f ? -1111 : h;
+                    }
+                    if ((g | 0) == -1111) {
+                      g = c[(d + (h << 2)) >> 2] | 0;
+                      c[q >> 2] = c[g >> 2];
+                      c[(q + 4) >> 2] = c[(g + 4) >> 2];
+                      c[p >> 2] = c[r >> 2];
+                      c[(p + 4) >> 2] = c[(r + 4) >> 2];
+                      c[(p + 8) >> 2] = c[(r + 8) >> 2];
+                      c[(p + 12) >> 2] = c[(r + 12) >> 2];
+                      g = (NX(q, p) | 0) == 0;
+                      g = g ? -1111 : h;
+                    }
+                    h = (h + 1) | 0;
+                  }
+                }
+              while (0);
+              Tm(d, e, f, g, i, m);
+              c[k >> 2] = 0;
+              c[(k + 4) >> 2] = 0;
+              c[(k + 8) >> 2] = 0;
+              c[(k + 12) >> 2] = 0;
+              c[(k + 16) >> 2] = 0;
+              c[(k + 20) >> 2] = 0;
+              c[(k + 24) >> 2] = 0;
+              c[(k + 28) >> 2] = 0;
+              h = c[i >> 2] | 0;
+              v = c[m >> 2] | 0;
+              c[p >> 2] = c[j >> 2];
+              c[(p + 4) >> 2] = c[(j + 4) >> 2];
+              if ((OX(h, v, p, k, s) | 0) < 0) {
+                t = KB(c[((((c[b >> 2] & 3) | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0) | 0;
+                v = KB(c[((((c[b >> 2] & 3) | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0) | 0;
+                c[n >> 2] = t;
+                c[(n + 4) >> 2] = v;
+                gA(1, 89657, n) | 0;
+              } else {
+                if (0 > 1) {
+                  g = c[15712] | 0;
+                  n = KB(c[((((c[b >> 2] & 3) | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0) | 0;
+                  f = (b + -48) | 0;
+                  v = KB(c[((((c[b >> 2] & 3) | 0) == 2 ? b : f) + 40) >> 2] | 0) | 0;
+                  c[o >> 2] = n;
+                  c[(o + 4) >> 2] = v;
+                  w4(g, 89705, o) | 0;
+                  g = b;
+                } else {
+                  f = (b + -48) | 0;
+                  g = b;
+                }
+                dO(
+                  b,
+                  c[((((c[g >> 2] & 3) | 0) == 2 ? b : f) + 40) >> 2] | 0,
+                  c[s >> 2] | 0,
+                  c[(s + 4) >> 2] | 0,
+                  17792
+                );
+                U1(h);
+                c[q >> 2] = c[t >> 2];
+                c[(q + 4) >> 2] = c[(t + 4) >> 2];
+                c[(q + 8) >> 2] = c[(t + 8) >> 2];
+                c[(q + 12) >> 2] = c[(t + 12) >> 2];
+                c[p >> 2] = c[r >> 2];
+                c[(p + 4) >> 2] = c[(r + 4) >> 2];
+                c[(p + 8) >> 2] = c[(r + 8) >> 2];
+                c[(p + 12) >> 2] = c[(r + 12) >> 2];
+                yO(a, b, q, p);
+              }
+              l = u;
+              return;
+            }
+            function Tm(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              i = 0;
+              h = 0;
+              while (1) {
+                if ((i | 0) >= (b | 0)) break;
+                if (!(((i | 0) == (d | 0)) | ((i | 0) == (e | 0))))
+                  h = ((c[((c[(a + (i << 2)) >> 2] | 0) + 4) >> 2] | 0) + h) | 0;
+                i = (i + 1) | 0;
+              }
+              o = KK(h << 5) | 0;
+              i = 0;
+              n = 0;
+              while (1) {
+                if ((n | 0) >= (b | 0)) break;
+                a: do
+                  if (!(((n | 0) == (d | 0)) | ((n | 0) == (e | 0)))) {
+                    m = (a + (n << 2)) | 0;
+                    l = 0;
+                    while (1) {
+                      j = c[m >> 2] | 0;
+                      k = c[(j + 4) >> 2] | 0;
+                      if ((l | 0) >= (k | 0)) break a;
+                      p = (l + 1) | 0;
+                      q = (o + (i << 5)) | 0;
+                      j = ((c[j >> 2] | 0) + (l << 4)) | 0;
+                      c[q >> 2] = c[j >> 2];
+                      c[(q + 4) >> 2] = c[(j + 4) >> 2];
+                      c[(q + 8) >> 2] = c[(j + 8) >> 2];
+                      c[(q + 12) >> 2] = c[(j + 12) >> 2];
+                      j = (o + (i << 5) + 16) | 0;
+                      k = ((c[c[m >> 2] >> 2] | 0) + (((p | 0) < (k | 0) ? p : 0) << 4)) | 0;
+                      c[j >> 2] = c[k >> 2];
+                      c[(j + 4) >> 2] = c[(k + 4) >> 2];
+                      c[(j + 8) >> 2] = c[(k + 8) >> 2];
+                      c[(j + 12) >> 2] = c[(k + 12) >> 2];
+                      l = p;
+                      i = (i + 1) | 0;
+                    }
+                  }
+                while (0);
+                n = (n + 1) | 0;
+              }
+              if ((i | 0) == (h | 0)) {
+                c[f >> 2] = o;
+                c[g >> 2] = h;
+                return;
+              } else qa(89719, 89726, 77, 89741);
+            }
+            function Um(a, d, e) {
+              a = a | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              n = l;
+              l = (l + 32) | 0;
+              k = (n + 12) | 0;
+              f = n;
+              pr(f, a);
+              c[k >> 2] = c[f >> 2];
+              c[(k + 4) >> 2] = c[(f + 4) >> 2];
+              c[(k + 8) >> 2] = c[(f + 8) >> 2];
+              f = jC(a) | 0;
+              while (1) {
+                if (!f) break;
+                g = XA(a, f) | 0;
+                while (1) {
+                  if (!g) break;
+                  ZN(g);
+                  g = ZA(a, g) | 0;
+                }
+                f = kC(a, f) | 0;
+              }
+              h = Vz(17756, c[4581] | 0) | 0;
+              f = jC(a) | 0;
+              while (1) {
+                if (!f) break;
+                g = XA(a, f) | 0;
+                while (1) {
+                  if (!g) break;
+                  if ((c[47134] | 0) > 1 ? ((i = c[(g + 16) >> 2] | 0), (c[(i + 8) >> 2] | 0) != 0) : 0) {
+                    o = (i + 168) | 0;
+                    b[o >> 1] = (((b[o >> 1] | 0) + 1) << 16) >> 16;
+                  } else m = 14;
+                  if ((m | 0) == 14 ? ((m = 0), (j = Vm(h, g) | 0), (j | 0) != (g | 0)) : 0) {
+                    o = c[(j + 16) >> 2] | 0;
+                    p = (o + 168) | 0;
+                    b[p >> 1] = (((b[p >> 1] | 0) + 1) << 16) >> 16;
+                    o = (o + 172) | 0;
+                    c[((c[(g + 16) >> 2] | 0) + 172) >> 2] = c[o >> 2];
+                    c[o >> 2] = g;
+                  }
+                  g = ZA(a, g) | 0;
+                }
+                f = kC(a, f) | 0;
+              }
+              Rz(h) | 0;
+              if (!(nb[d & 63](a, k, e) | 0)) {
+                c[47138] = 1;
+                f = 0;
+              } else f = 1;
+              l = n;
+              return f | 0;
+            }
+            function Vm(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0.0,
+                g = 0.0,
+                i = 0,
+                j = 0.0,
+                k = 0.0,
+                m = 0.0,
+                n = 0.0,
+                o = 0,
+                p = 0,
+                q = 0;
+              q = l;
+              l = (l + 64) | 0;
+              p = q;
+              e = c[b >> 2] & 3;
+              i = c[(((e | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0;
+              e = c[(((e | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0;
+              do
+                if (i >>> 0 >= e >>> 0) {
+                  d = (b + 16) | 0;
+                  if (i >>> 0 > e >>> 0) {
+                    d = c[d >> 2] | 0;
+                    o = e;
+                    e = i;
+                    k = +h[(d + 16) >> 3];
+                    m = +h[(d + 24) >> 3];
+                    g = +h[(d + 56) >> 3];
+                    f = +h[(d + 64) >> 3];
+                    break;
+                  }
+                  o = c[d >> 2] | 0;
+                  j = +h[(o + 56) >> 3];
+                  n = +h[(o + 64) >> 3];
+                  g = +h[(o + 16) >> 3];
+                  f = +h[(o + 24) >> 3];
+                  if (!(g < j))
+                    if (!(g > j)) {
+                      d = f > n;
+                      if (f < n) {
+                        o = i;
+                        e = i;
+                        k = j;
+                        m = n;
+                      } else {
+                        o = i;
+                        e = i;
+                        k = g;
+                        m = f;
+                        g = d ? j : g;
+                        f = d ? n : f;
+                      }
+                    } else {
+                      o = i;
+                      e = i;
+                      k = g;
+                      m = f;
+                      g = j;
+                      f = n;
+                    }
+                  else {
+                    o = i;
+                    e = i;
+                    k = j;
+                    m = n;
+                  }
+                } else {
+                  d = c[(b + 16) >> 2] | 0;
+                  o = i;
+                  k = +h[(d + 56) >> 3];
+                  m = +h[(d + 64) >> 3];
+                  g = +h[(d + 16) >> 3];
+                  f = +h[(d + 24) >> 3];
+                }
+              while (0);
+              c[(p + 8) >> 2] = o;
+              h[(p + 16) >> 3] = g;
+              h[(p + 24) >> 3] = f;
+              c[(p + 32) >> 2] = e;
+              h[(p + 40) >> 3] = k;
+              h[(p + 48) >> 3] = m;
+              c[(p + 56) >> 2] = b;
+              p = c[((nb[c[a >> 2] & 63](a, p, 1) | 0) + 56) >> 2] | 0;
+              l = q;
+              return p | 0;
+            }
+            function Wm(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return Um(a, 21, b) | 0;
+            }
+            function Xm(d, e, f) {
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0.0,
+                H = 0;
+              F = l;
+              l = (l + 112) | 0;
+              B = (F + 88) | 0;
+              A = (F + 72) | 0;
+              t = (F + 40) | 0;
+              q = (F + 8) | 0;
+              p = F;
+              u = (F + 64) | 0;
+              C = (F + 48) | 0;
+              D = (F + 24) | 0;
+              i = ((c[47134] | 0) > 1) & 1;
+              do
+                if ((f | 0) > 5) {
+                  s = JK((tB(d) | 0) << 2) | 0;
+                  o = (f | 0) == 8;
+                  n = o & 1;
+                  m = jC(d) | 0;
+                  r = 0;
+                  while (1) {
+                    if (!m) break;
+                    j = Nm(m, e, n) | 0;
+                    k = ((c[(m + 16) >> 2] | 0) + 288) | 0;
+                    if (!j) {
+                      c[k >> 2] = -1111;
+                      j = r;
+                    } else {
+                      c[k >> 2] = r;
+                      c[(s + (r << 2)) >> 2] = j;
+                      j = (r + 1) | 0;
+                    }
+                    m = kC(d, m) | 0;
+                    r = j;
+                  }
+                  if (s) {
+                    j = lt(s, r) | 0;
+                    if (j | 0) {
+                      if (o) {
+                        y = 0;
+                        z = s;
+                        x = s;
+                        w = 1;
+                        break;
+                      }
+                      y = JX(s, r) | 0;
+                      z = s;
+                      x = s;
+                      w = 1;
+                      break;
+                    }
+                    if (o) {
+                      gA(0, 89755, p) | 0;
+                      j = 0;
+                      y = 0;
+                      z = s;
+                      x = s;
+                      w = 1;
+                      break;
+                    } else {
+                      G = +g[(e + 4) >> 2];
+                      h[q >> 3] = +g[e >> 2];
+                      h[(q + 8) >> 3] = G;
+                      gA(0, 89833, q) | 0;
+                      j = 0;
+                      y = 0;
+                      z = s;
+                      x = s;
+                      w = 1;
+                      break;
+                    }
+                  } else {
+                    j = 0;
+                    y = 0;
+                    z = 0;
+                    x = 0;
+                    w = 0;
+                  }
+                } else {
+                  j = 0;
+                  y = 0;
+                  z = 0;
+                  r = 0;
+                  x = 0;
+                  w = 0;
+                }
+              while (0);
+              if (0) {
+                k = c[15712] | 0;
+                if (((f | 0) == 8) & ((j | 0) != 0)) m = 89939;
+                else m = (y | 0) == 0 ? 89925 : (f | 0) == 10 ? 110056 : 89915;
+                c[t >> 2] = m;
+                w4(k, 89956, t) | 0;
+              }
+              v = (y | 0) != 0;
+              a: do
+                if (!v) {
+                  if (((f | 0) == 8) & ((j | 0) != 0)) {
+                    rQ(d, 0);
+                    i = 1;
+                  }
+                } else {
+                  k = jC(d) | 0;
+                  while (1) {
+                    if (!k) break a;
+                    j = XA(d, k) | 0;
+                    while (1) {
+                      if (!j) break;
+                      t = ((c[(j + 16) >> 2] | 0) + 144) | 0;
+                      Qm(u, j, y, 1, 0, 0);
+                      q = u;
+                      s = c[(q + 4) >> 2] | 0;
+                      c[t >> 2] = c[q >> 2];
+                      c[(t + 4) >> 2] = s;
+                      j = ZA(d, j) | 0;
+                    }
+                    k = kC(d, k) | 0;
+                  }
+                }
+              while (0);
+              p = (i | 0) == 0;
+              q = (d + 60) | 0;
+              s = (f | 0) == 10;
+              i = 0;
+              o = jC(d) | 0;
+              j = 0;
+              while (1) {
+                if (!o) break;
+                t = (o + 16) | 0;
+                e = XA(d, o) | 0;
+                while (1) {
+                  if (!e) break;
+                  n = c[((((c[e >> 2] & 3) | 0) == 2 ? e : (e + -48) | 0) + 40) >> 2] | 0;
+                  k = (e + 16) | 0;
+                  m = c[k >> 2] | 0;
+                  if (!p ? (c[(m + 8) >> 2] | 0) != 0 : 0) {
+                    H = ((c[t >> 2] | 0) + 16) | 0;
+                    u = (m + 16) | 0;
+                    c[A >> 2] = c[H >> 2];
+                    c[(A + 4) >> 2] = c[(H + 4) >> 2];
+                    c[(A + 8) >> 2] = c[(H + 8) >> 2];
+                    c[(A + 12) >> 2] = c[(H + 12) >> 2];
+                    c[B >> 2] = c[u >> 2];
+                    c[(B + 4) >> 2] = c[(u + 4) >> 2];
+                    c[(B + 8) >> 2] = c[(u + 8) >> 2];
+                    c[(B + 12) >> 2] = c[(u + 12) >> 2];
+                    Rm(C, A, B);
+                    n = ((c[(n + 16) >> 2] | 0) + 16) | 0;
+                    u = ((c[k >> 2] | 0) + 56) | 0;
+                    c[A >> 2] = c[n >> 2];
+                    c[(A + 4) >> 2] = c[(n + 4) >> 2];
+                    c[(A + 8) >> 2] = c[(n + 8) >> 2];
+                    c[(A + 12) >> 2] = c[(n + 12) >> 2];
+                    c[B >> 2] = c[u >> 2];
+                    c[(B + 4) >> 2] = c[(u + 4) >> 2];
+                    c[(B + 8) >> 2] = c[(u + 8) >> 2];
+                    c[(B + 12) >> 2] = c[(u + 12) >> 2];
+                    Rm(D, A, B);
+                    c[A >> 2] = c[C >> 2];
+                    c[(A + 4) >> 2] = c[(C + 4) >> 2];
+                    c[(A + 8) >> 2] = c[(C + 8) >> 2];
+                    c[(A + 12) >> 2] = c[(C + 12) >> 2];
+                    c[B >> 2] = c[D >> 2];
+                    c[(B + 4) >> 2] = c[(D + 4) >> 2];
+                    c[(B + 8) >> 2] = c[(D + 8) >> 2];
+                    c[(B + 12) >> 2] = c[(D + 12) >> 2];
+                    yO(d, e, A, B);
+                  } else E = 35;
+                  b: do
+                    if ((E | 0) == 35) {
+                      E = 0;
+                      H = b[(m + 168) >> 1] | 0;
+                      k = (H << 16) >> 16;
+                      if ((H << 16) >> 16) {
+                        if ((o | 0) == (n | 0)) {
+                          if (!i) {
+                            j = JK(96) | 0;
+                            c[(j + 84) >> 2] = JK((((tB(d) | 0) << 5) + 11520) | 0) | 0;
+                            i = j;
+                          }
+                          Km(i, e, c[((c[((c[q >> 2] | 0) + 16) >> 2] | 0) + 248) >> 2] | 0);
+                          break;
+                        }
+                        if (!v) {
+                          OM(d, e, f, 17792);
+                          break;
+                        }
+                        k = a[194954] | 0 ? 1 : k;
+                        m = e;
+                        n = 0;
+                        while (1) {
+                          if ((n | 0) >= (k | 0)) break b;
+                          if (s) Sm(d, m, z, r, 1);
+                          else Ym(d, m);
+                          m = c[((c[(m + 16) >> 2] | 0) + 172) >> 2] | 0;
+                          n = (n + 1) | 0;
+                        }
+                      }
+                    }
+                  while (0);
+                  e = ZA(d, e) | 0;
+                }
+                o = kC(d, o) | 0;
+              }
+              if (v) LX(y);
+              if (i | 0) {
+                U1(c[(i + 84) >> 2] | 0);
+                U1(j);
+              }
+              if (w) {
+                i = 0;
+                while (1) {
+                  if ((i | 0) >= (r | 0)) break;
+                  U1(c[(z + (i << 2)) >> 2] | 0);
+                  i = (i + 1) | 0;
+                }
+                U1(x);
+              }
+              l = F;
+              return 0;
+            }
+            function Ym(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              k = l;
+              l = (l + 96) | 0;
+              g = (k + 64) | 0;
+              f = (k + 48) | 0;
+              d = (k + 40) | 0;
+              h = (k + 80) | 0;
+              e = (k + 32) | 0;
+              i = (k + 16) | 0;
+              j = k;
+              m = ((c[(b + 16) >> 2] | 0) + 144) | 0;
+              n = c[m >> 2] | 0;
+              m = c[(m + 4) >> 2] | 0;
+              o = e;
+              c[o >> 2] = n;
+              c[(o + 4) >> 2] = m;
+              o = n;
+              c[i >> 2] = c[o >> 2];
+              c[(i + 4) >> 2] = c[(o + 4) >> 2];
+              c[(i + 8) >> 2] = c[(o + 8) >> 2];
+              c[(i + 12) >> 2] = c[(o + 12) >> 2];
+              m = (n + ((m + -1) << 4)) | 0;
+              c[j >> 2] = c[m >> 2];
+              c[(j + 4) >> 2] = c[(m + 4) >> 2];
+              c[(j + 8) >> 2] = c[(m + 8) >> 2];
+              c[(j + 12) >> 2] = c[(m + 12) >> 2];
+              c[g >> 2] = c[e >> 2];
+              c[(g + 4) >> 2] = c[(e + 4) >> 2];
+              FY(g, h);
+              if (0 > 1) {
+                o = c[15712] | 0;
+                m = KB(c[((((c[b >> 2] & 3) | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0) | 0;
+                e = (b + -48) | 0;
+                n = KB(c[((((c[b >> 2] & 3) | 0) == 2 ? b : e) + 40) >> 2] | 0) | 0;
+                c[d >> 2] = m;
+                c[(d + 4) >> 2] = n;
+                w4(o, 89981, d) | 0;
+                d = e;
+                e = b;
+              } else {
+                d = (b + -48) | 0;
+                e = b;
+              }
+              dO(b, c[((((c[e >> 2] & 3) | 0) == 2 ? b : d) + 40) >> 2] | 0, c[h >> 2] | 0, c[(h + 4) >> 2] | 0, 17792);
+              c[f >> 2] = c[i >> 2];
+              c[(f + 4) >> 2] = c[(i + 4) >> 2];
+              c[(f + 8) >> 2] = c[(i + 8) >> 2];
+              c[(f + 12) >> 2] = c[(i + 12) >> 2];
+              c[g >> 2] = c[j >> 2];
+              c[(g + 4) >> 2] = c[(j + 4) >> 2];
+              c[(g + 8) >> 2] = c[(j + 8) >> 2];
+              c[(g + 12) >> 2] = c[(j + 12) >> 2];
+              yO(a, b, f, g);
+              l = k;
+              return;
+            }
+            function Zm(a, d) {
+              a = a | 0;
+              d = d | 0;
+              var e = 0;
+              e = b[((c[(a + 16) >> 2] | 0) + 136) >> 1] & 14;
+              if ((d << 24) >> 24) _m(a) | 0;
+              if ((e << 16) >> 16) Wm(a, e & 65535) | 0;
+              return;
+            }
+            function _m(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              d = $m(a) | 0;
+              b = jC(a) | 0;
+              while (1) {
+                if (!b) break;
+                e = c[(b + 16) >> 2] | 0;
+                f = c[(e + 132) >> 2] | 0;
+                h[(e + 16) >> 3] = +h[f >> 3] * 72.0;
+                h[(e + 24) >> 3] = +h[(f + 8) >> 3] * 72.0;
+                b = kC(a, b) | 0;
+              }
+              return d | 0;
+            }
+            function $m(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0;
+              a: do
+                if (
+                  (c[(a + 60) >> 2] | 0) == (a | 0)
+                    ? ((d = (a + 16) | 0), (e = c[d >> 2] | 0), (c[((c[(e + 8) >> 2] | 0) + 84) >> 2] | 0) != 0)
+                    : 0
+                ) {
+                  if (!(+h[(e + 16) >> 3] != 0.0) ? !(+h[(e + 24) >> 3] != 0.0) : 0) b = 0;
+                  else {
+                    an(a);
+                    b = 1;
+                    e = c[d >> 2] | 0;
+                  }
+                  j = ((c[(e + 116) >> 2] & 1) | 0) == 0;
+                  if (!j) {
+                    k = (e + 32) | 0;
+                    i = +h[k >> 3];
+                    d = (e + 40) | 0;
+                    h[k >> 3] = +h[d >> 3];
+                    h[d >> 3] = i;
+                  }
+                  d = c[(e + 8) >> 2] | 0;
+                  b: do
+                    switch (c[(d + 84) >> 2] | 0) {
+                      case 2: {
+                        f = +h[(d + 64) >> 3];
+                        if (f <= 0.0) break a;
+                        g = f / +h[(e + 32) >> 3];
+                        f = +h[(d + 72) >> 3] / +h[(e + 40) >> 3];
+                        if ((g < 1.0) | (f < 1.0))
+                          if (g < f) {
+                            i = 1.0;
+                            f = f / g;
+                            break b;
+                          } else {
+                            i = g / f;
+                            f = 1.0;
+                            break b;
+                          }
+                        else i = g;
+                        break;
+                      }
+                      case 5: {
+                        f = +h[(d + 64) >> 3];
+                        if (f <= 0.0) break a;
+                        g = f / +h[(e + 32) >> 3];
+                        f = +h[(d + 72) >> 3] / +h[(e + 40) >> 3];
+                        if (!((g > 1.0) & (f > 1.0))) break a;
+                        f = g < f ? g : f;
+                        i = f;
+                        break;
+                      }
+                      case 1: {
+                        g = +h[(d + 16) >> 3];
+                        f = +h[(e + 40) >> 3] / +h[(e + 32) >> 3];
+                        if (f < g) {
+                          i = 1.0;
+                          f = g / f;
+                          break b;
+                        } else {
+                          i = f / g;
+                          f = 1.0;
+                          break b;
+                        }
+                      }
+                      default:
+                        break a;
+                    }
+                  while (0);
+                  g = j ? f : i;
+                  f = j ? i : f;
+                  c: do
+                    if ((c[47134] | 0) > 1) {
+                      d = jC(a) | 0;
+                      while (1) {
+                        if (!d) break c;
+                        b = XA(a, d) | 0;
+                        while (1) {
+                          if (!b) break;
+                          if (c[((c[(b + 16) >> 2] | 0) + 8) >> 2] | 0) bn(b, f, g);
+                          b = ZA(a, b) | 0;
+                        }
+                        d = kC(a, d) | 0;
+                      }
+                    }
+                  while (0);
+                  b = jC(a) | 0;
+                  while (1) {
+                    if (!b) break;
+                    k = c[((c[(b + 16) >> 2] | 0) + 132) >> 2] | 0;
+                    h[k >> 3] = +h[k >> 3] * f;
+                    k = (k + 8) | 0;
+                    h[k >> 3] = +h[k >> 3] * g;
+                    b = kC(a, b) | 0;
+                  }
+                  cn(a, f, g);
+                  b = 1;
+                } else b = 0;
+              while (0);
+              return b | 0;
+            }
+            function an(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              n = l;
+              l = (l + 32) | 0;
+              k = (n + 16) | 0;
+              m = n;
+              d = ((c[(b + 16) >> 2] | 0) + 16) | 0;
+              c[m >> 2] = c[d >> 2];
+              c[(m + 4) >> 2] = c[(d + 4) >> 2];
+              c[(m + 8) >> 2] = c[(d + 8) >> 2];
+              c[(m + 12) >> 2] = c[(d + 12) >> 2];
+              f = +h[m >> 3];
+              g = f * 0.013888888888888888;
+              i = +h[(m + 8) >> 3];
+              j = i * 0.013888888888888888;
+              d = jC(b) | 0;
+              while (1) {
+                if (!d) break;
+                e = c[(d + 16) >> 2] | 0;
+                o = c[(e + 132) >> 2] | 0;
+                h[o >> 3] = +h[o >> 3] - g;
+                o = (o + 8) | 0;
+                h[o >> 3] = +h[o >> 3] - j;
+                e = c[(e + 108) >> 2] | 0;
+                if (e | 0 ? a[(e + 81) >> 0] | 0 : 0) {
+                  o = (e + 56) | 0;
+                  h[o >> 3] = +h[o >> 3] - f;
+                  o = (e + 64) | 0;
+                  h[o >> 3] = +h[o >> 3] - i;
+                }
+                d = kC(b, d) | 0;
+              }
+              e = jC(b) | 0;
+              while (1) {
+                if (!e) break;
+                d = XA(b, e) | 0;
+                while (1) {
+                  if (!d) break;
+                  if (c[((c[(d + 16) >> 2] | 0) + 8) >> 2] | 0) {
+                    c[k >> 2] = c[m >> 2];
+                    c[(k + 4) >> 2] = c[(m + 4) >> 2];
+                    c[(k + 8) >> 2] = c[(m + 8) >> 2];
+                    c[(k + 12) >> 2] = c[(m + 12) >> 2];
+                    dn(d, k);
+                  }
+                  d = ZA(b, d) | 0;
+                }
+                e = kC(b, e) | 0;
+              }
+              c[k >> 2] = c[m >> 2];
+              c[(k + 4) >> 2] = c[(m + 4) >> 2];
+              c[(k + 8) >> 2] = c[(m + 8) >> 2];
+              c[(k + 12) >> 2] = c[(m + 12) >> 2];
+              en(b, k);
+              l = n;
+              return;
+            }
+            function bn(b, d, e) {
+              b = b | 0;
+              d = +d;
+              e = +e;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0,
+                q = 0.0,
+                r = 0.0,
+                s = 0.0,
+                t = 0.0,
+                u = 0;
+              p = c[b >> 2] & 3;
+              i = c[((c[((c[(((p | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 132) >> 2] | 0;
+              s = (d + -1.0) * 72.0;
+              q = s * +h[i >> 3];
+              t = (e + -1.0) * 72.0;
+              r = t * +h[(i + 8) >> 3];
+              p = c[((c[((c[(((p | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 132) >> 2] | 0;
+              s = s * +h[p >> 3];
+              t = t * +h[(p + 8) >> 3];
+              p = c[(b + 16) >> 2] | 0;
+              i = c[(p + 8) >> 2] | 0;
+              j = c[(i + 4) >> 2] | 0;
+              k = (j + -1) | 0;
+              b = 0;
+              i = c[i >> 2] | 0;
+              while (1) {
+                if ((b | 0) >= (j | 0)) break;
+                l = c[(i + 4) >> 2] | 0;
+                m = (l + -1) | 0;
+                n = (b | 0) == (k | 0);
+                f = 0;
+                g = c[i >> 2] | 0;
+                while (1) {
+                  if ((f | 0) >= (l | 0)) break;
+                  do
+                    if (f | b) {
+                      o = +h[g >> 3];
+                      if (((f | 0) == (m | 0)) & n) {
+                        h[g >> 3] = o + q;
+                        u = (g + 8) | 0;
+                        h[u >> 3] = +h[u >> 3] + r;
+                        break;
+                      } else {
+                        h[g >> 3] = o * d;
+                        u = (g + 8) | 0;
+                        h[u >> 3] = +h[u >> 3] * e;
+                        break;
+                      }
+                    } else {
+                      h[g >> 3] = +h[g >> 3] + s;
+                      u = (g + 8) | 0;
+                      h[u >> 3] = +h[u >> 3] + t;
+                    }
+                  while (0);
+                  f = (f + 1) | 0;
+                  g = (g + 16) | 0;
+                }
+                if (c[(i + 8) >> 2] | 0) {
+                  u = (i + 16) | 0;
+                  h[u >> 3] = +h[u >> 3] + s;
+                  u = (i + 24) | 0;
+                  h[u >> 3] = +h[u >> 3] + t;
+                }
+                if (c[(i + 12) >> 2] | 0) {
+                  u = (i + 32) | 0;
+                  h[u >> 3] = +h[u >> 3] + q;
+                  u = (i + 40) | 0;
+                  h[u >> 3] = +h[u >> 3] + r;
+                }
+                b = (b + 1) | 0;
+                i = (i + 48) | 0;
+              }
+              b = c[(p + 96) >> 2] | 0;
+              if (b | 0 ? a[(b + 81) >> 0] | 0 : 0) {
+                u = (b + 56) | 0;
+                h[u >> 3] = +h[u >> 3] * d;
+                u = (b + 64) | 0;
+                h[u >> 3] = +h[u >> 3] * e;
+              }
+              b = c[(p + 100) >> 2] | 0;
+              if (b | 0 ? a[(b + 81) >> 0] | 0 : 0) {
+                u = (b + 56) | 0;
+                h[u >> 3] = +h[u >> 3] + q;
+                u = (b + 64) | 0;
+                h[u >> 3] = +h[u >> 3] + r;
+              }
+              b = c[(p + 104) >> 2] | 0;
+              if (b | 0 ? a[(b + 81) >> 0] | 0 : 0) {
+                u = (b + 56) | 0;
+                h[u >> 3] = +h[u >> 3] + s;
+                u = (b + 64) | 0;
+                h[u >> 3] = +h[u >> 3] + t;
+              }
+              return;
+            }
+            function cn(b, d, e) {
+              b = b | 0;
+              d = +d;
+              e = +e;
+              var f = 0,
+                g = 0,
+                i = 0;
+              i = (b + 16) | 0;
+              g = c[i >> 2] | 0;
+              b = (g + 32) | 0;
+              h[b >> 3] = +h[b >> 3] * d;
+              b = (g + 40) | 0;
+              h[b >> 3] = +h[b >> 3] * e;
+              b = (g + 16) | 0;
+              h[b >> 3] = +h[b >> 3] * d;
+              b = (g + 24) | 0;
+              h[b >> 3] = +h[b >> 3] * e;
+              b = c[(g + 12) >> 2] | 0;
+              if ((b | 0) != 0 ? (a[(b + 81) >> 0] | 0) != 0 : 0) {
+                f = (b + 56) | 0;
+                h[f >> 3] = +h[f >> 3] * d;
+                f = (b + 64) | 0;
+                h[f >> 3] = +h[f >> 3] * e;
+                f = 1;
+                b = g;
+              } else {
+                f = 1;
+                b = g;
+              }
+              while (1) {
+                if ((f | 0) > (c[(b + 180) >> 2] | 0)) break;
+                cn(c[((c[(b + 184) >> 2] | 0) + (f << 2)) >> 2] | 0, d, e);
+                f = (f + 1) | 0;
+                b = c[i >> 2] | 0;
+              }
+              return;
+            }
+            function dn(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              k = c[(b + 16) >> 2] | 0;
+              b = c[(k + 8) >> 2] | 0;
+              j = c[(b + 4) >> 2] | 0;
+              l = (d + 8) | 0;
+              b = c[b >> 2] | 0;
+              g = 0;
+              while (1) {
+                if ((g | 0) >= (j | 0)) break;
+                i = c[(b + 4) >> 2] | 0;
+                e = c[b >> 2] | 0;
+                f = 0;
+                while (1) {
+                  if ((f | 0) >= (i | 0)) break;
+                  h[e >> 3] = +h[e >> 3] - +h[d >> 3];
+                  m = (e + 8) | 0;
+                  h[m >> 3] = +h[m >> 3] - +h[l >> 3];
+                  e = (e + 16) | 0;
+                  f = (f + 1) | 0;
+                }
+                if (c[(b + 8) >> 2] | 0) {
+                  m = (b + 16) | 0;
+                  h[m >> 3] = +h[m >> 3] - +h[d >> 3];
+                  m = (b + 24) | 0;
+                  h[m >> 3] = +h[m >> 3] - +h[l >> 3];
+                }
+                if (c[(b + 12) >> 2] | 0) {
+                  m = (b + 32) | 0;
+                  h[m >> 3] = +h[m >> 3] - +h[d >> 3];
+                  m = (b + 40) | 0;
+                  h[m >> 3] = +h[m >> 3] - +h[l >> 3];
+                }
+                b = (b + 48) | 0;
+                g = (g + 1) | 0;
+              }
+              b = c[(k + 96) >> 2] | 0;
+              if (b | 0 ? a[(b + 81) >> 0] | 0 : 0) {
+                m = (b + 56) | 0;
+                h[m >> 3] = +h[m >> 3] - +h[d >> 3];
+                m = (b + 64) | 0;
+                h[m >> 3] = +h[m >> 3] - +h[l >> 3];
+              }
+              b = c[(k + 108) >> 2] | 0;
+              if (b | 0 ? a[(b + 81) >> 0] | 0 : 0) {
+                m = (b + 56) | 0;
+                h[m >> 3] = +h[m >> 3] - +h[d >> 3];
+                m = (b + 64) | 0;
+                h[m >> 3] = +h[m >> 3] - +h[l >> 3];
+              }
+              b = c[(k + 100) >> 2] | 0;
+              if (b | 0 ? a[(b + 81) >> 0] | 0 : 0) {
+                m = (b + 56) | 0;
+                h[m >> 3] = +h[m >> 3] - +h[d >> 3];
+                m = (b + 64) | 0;
+                h[m >> 3] = +h[m >> 3] - +h[l >> 3];
+              }
+              b = c[(k + 104) >> 2] | 0;
+              if (b | 0 ? a[(b + 81) >> 0] | 0 : 0) {
+                m = (b + 56) | 0;
+                h[m >> 3] = +h[m >> 3] - +h[d >> 3];
+                m = (b + 64) | 0;
+                h[m >> 3] = +h[m >> 3] - +h[l >> 3];
+              }
+              return;
+            }
+            function en(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              k = l;
+              l = (l + 16) | 0;
+              j = k;
+              g = +h[d >> 3];
+              i = (b + 16) | 0;
+              b = c[i >> 2] | 0;
+              e = (b + 32) | 0;
+              h[e >> 3] = +h[e >> 3] - g;
+              f = +h[(d + 8) >> 3];
+              e = (b + 40) | 0;
+              h[e >> 3] = +h[e >> 3] - f;
+              e = (b + 16) | 0;
+              h[e >> 3] = +h[e >> 3] - g;
+              e = (b + 24) | 0;
+              h[e >> 3] = +h[e >> 3] - f;
+              e = c[(b + 12) >> 2] | 0;
+              if ((e | 0) != 0 ? (a[(e + 81) >> 0] | 0) != 0 : 0) {
+                m = (e + 56) | 0;
+                h[m >> 3] = +h[m >> 3] - g;
+                e = (e + 64) | 0;
+                h[e >> 3] = +h[e >> 3] - f;
+                e = 1;
+              } else e = 1;
+              while (1) {
+                if ((e | 0) > (c[(b + 180) >> 2] | 0)) break;
+                m = c[((c[(b + 184) >> 2] | 0) + (e << 2)) >> 2] | 0;
+                c[j >> 2] = c[d >> 2];
+                c[(j + 4) >> 2] = c[(d + 4) >> 2];
+                c[(j + 8) >> 2] = c[(d + 8) >> 2];
+                c[(j + 12) >> 2] = c[(d + 12) >> 2];
+                en(m, j);
+                e = (e + 1) | 0;
+                b = c[i >> 2] | 0;
+              }
+              l = k;
+              return;
+            }
+            function fn(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0.0,
+                g = 0.0,
+                i = 0,
+                j = 0;
+              i = l;
+              l = (l + 16) | 0;
+              d = i;
+              BP(a);
+              e = (a + 16) | 0;
+              b = c[e >> 2] | 0;
+              f = +h[(b + 16) >> 3] * 0.013888888888888888;
+              g = +h[(b + 24) >> 3] * 0.013888888888888888;
+              b = jC(a) | 0;
+              while (1) {
+                if (!b) break;
+                j = c[((c[(b + 16) >> 2] | 0) + 132) >> 2] | 0;
+                h[j >> 3] = +h[j >> 3] - f;
+                j = (j + 8) | 0;
+                h[j >> 3] = +h[j >> 3] - g;
+                b = kC(a, b) | 0;
+              }
+              j = ((c[e >> 2] | 0) + 16) | 0;
+              c[d >> 2] = c[j >> 2];
+              c[(d + 4) >> 2] = c[(j + 4) >> 2];
+              c[(d + 8) >> 2] = c[(j + 8) >> 2];
+              c[(d + 12) >> 2] = c[(j + 12) >> 2];
+              gn(a, d);
+              Zm(a, 1);
+              l = i;
+              return;
+            }
+            function gn(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0.0,
+                j = 0.0;
+              g = l;
+              l = (l + 16) | 0;
+              f = g;
+              d = (a + 16) | 0;
+              a = 1;
+              while (1) {
+                e = c[d >> 2] | 0;
+                if ((a | 0) > (c[(e + 180) >> 2] | 0)) break;
+                e = c[((c[(e + 184) >> 2] | 0) + (a << 2)) >> 2] | 0;
+                c[f >> 2] = c[b >> 2];
+                c[(f + 4) >> 2] = c[(b + 4) >> 2];
+                c[(f + 8) >> 2] = c[(b + 8) >> 2];
+                c[(f + 12) >> 2] = c[(b + 12) >> 2];
+                gn(e, f);
+                a = (a + 1) | 0;
+              }
+              j = +h[b >> 3];
+              f = (e + 32) | 0;
+              h[f >> 3] = +h[f >> 3] - j;
+              i = +h[(b + 8) >> 3];
+              b = (e + 40) | 0;
+              h[b >> 3] = +h[b >> 3] - i;
+              b = (e + 16) | 0;
+              h[b >> 3] = +h[b >> 3] - j;
+              b = (e + 24) | 0;
+              h[b >> 3] = +h[b >> 3] - i;
+              l = g;
+              return;
+            }
+            function hn(b, d, e, f, g) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0.0;
+              p = (e | 0) > 2;
+              n = 0;
+              o = 0;
+              j = c[(f + 4) >> 2] | 0;
+              b = c[f >> 2] | 0;
+              while (1) {
+                if ((o | 0) >= (d | 0)) {
+                  b = 0;
+                  break;
+                }
+                i = c[((c[(g + (o << 2)) >> 2] | 0) + 16) >> 2] | 0;
+                l = a[(i + 119) >> 0] | 0;
+                a: do
+                  if (!((l << 24) >> 24)) {
+                    k = (b + 8) | 0;
+                    h[b >> 3] = +B5();
+                    i = (j + 8) | 0;
+                    h[j >> 3] = +B5();
+                    if (p) {
+                      b = 2;
+                      while (1) {
+                        if ((b | 0) == (e | 0)) {
+                          j = n;
+                          b = k;
+                          break a;
+                        }
+                        q = +B5();
+                        h[((c[(f + (b << 2)) >> 2] | 0) + (o << 3)) >> 3] = q;
+                        b = (b + 1) | 0;
+                      }
+                    } else {
+                      j = n;
+                      b = k;
+                    }
+                  } else {
+                    k = c[(i + 132) >> 2] | 0;
+                    m = (b + 8) | 0;
+                    h[b >> 3] = +h[k >> 3];
+                    i = (j + 8) | 0;
+                    h[j >> 3] = +h[(k + 8) >> 3];
+                    b: do
+                      if (p) {
+                        j = 2;
+                        b = (k + 16) | 0;
+                        while (1) {
+                          if ((j | 0) == (e | 0)) break b;
+                          h[((c[(f + (j << 2)) >> 2] | 0) + (o << 3)) >> 3] = +h[b >> 3];
+                          j = (j + 1) | 0;
+                          b = (b + 8) | 0;
+                        }
+                      }
+                    while (0);
+                    j = (l & 255) > 1 ? 1 : n;
+                    b = m;
+                  }
+                while (0);
+                n = j;
+                o = (o + 1) | 0;
+                j = i;
+              }
+              while (1) {
+                if ((b | 0) >= (e | 0)) break;
+                Ht(d, c[(f + (b << 2)) >> 2] | 0);
+                b = (b + 1) | 0;
+              }
+              return n | 0;
+            }
+            function jn(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0.0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              d = JK((((O((b + 1) | 0, b) | 0) / 2) | 0) << 2) | 0;
+              n = un(b, b, 0.0) | 0;
+              o = un(b, b, 0.0) | 0;
+              a: do
+                if (!(c[(a + 8) >> 2] | 0)) {
+                  e = 0;
+                  while (1) {
+                    if ((e | 0) >= (b | 0)) break a;
+                    i = c[(a + ((e * 20) | 0)) >> 2] | 0;
+                    j = (a + ((e * 20) | 0) + 4) | 0;
+                    k = (n + (e << 2)) | 0;
+                    f = 1;
+                    while (1) {
+                      if ((f | 0) >= (i | 0)) break;
+                      m = c[((c[j >> 2] | 0) + (f << 2)) >> 2] | 0;
+                      h[((c[(n + (m << 2)) >> 2] | 0) + (e << 3)) >> 3] = -1.0;
+                      h[((c[k >> 2] | 0) + (m << 3)) >> 3] = -1.0;
+                      f = (f + 1) | 0;
+                    }
+                    e = (e + 1) | 0;
+                  }
+                } else {
+                  e = 0;
+                  while (1) {
+                    if ((e | 0) >= (b | 0)) break a;
+                    i = c[(a + ((e * 20) | 0)) >> 2] | 0;
+                    j = (a + ((e * 20) | 0) + 4) | 0;
+                    k = (a + ((e * 20) | 0) + 8) | 0;
+                    m = (n + (e << 2)) | 0;
+                    f = 1;
+                    while (1) {
+                      if ((f | 0) >= (i | 0)) break;
+                      p = c[((c[j >> 2] | 0) + (f << 2)) >> 2] | 0;
+                      l = -1.0 / +g[((c[k >> 2] | 0) + (f << 2)) >> 2];
+                      h[((c[(n + (p << 2)) >> 2] | 0) + (e << 3)) >> 3] = l;
+                      h[((c[m >> 2] | 0) + (p << 3)) >> 3] = l;
+                      f = (f + 1) | 0;
+                    }
+                    e = (e + 1) | 0;
+                  }
+                }
+              while (0);
+              b: do
+                if (!(wr(b, n, o) | 0)) {
+                  U1(d);
+                  d = 0;
+                } else {
+                  f = 0;
+                  j = 0;
+                  m = b;
+                  while (1) {
+                    if ((j | 0) >= (b | 0)) break b;
+                    k = (o + (j << 2)) | 0;
+                    e = j;
+                    i = f;
+                    while (1) {
+                      if ((e | 0) == (b | 0)) break;
+                      if ((j | 0) == (e | 0)) l = 0.0;
+                      else {
+                        p = c[k >> 2] | 0;
+                        l =
+                          +h[((c[(o + (e << 2)) >> 2] | 0) + (e << 3)) >> 3] +
+                          +h[(p + (j << 3)) >> 3] +
+                          +h[(p + (e << 3)) >> 3] * -2.0;
+                      }
+                      g[(d + (i << 2)) >> 2] = l;
+                      e = (e + 1) | 0;
+                      i = (i + 1) | 0;
+                    }
+                    f = (f + m) | 0;
+                    j = (j + 1) | 0;
+                    m = (m + -1) | 0;
+                  }
+                }
+              while (0);
+              vn(n);
+              vn(o);
+              return d | 0;
+            }
+            function kn(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0.0;
+              r = l;
+              l = (l + 16) | 0;
+              q = r;
+              if (c[(a + 8) >> 2] | 0) {
+                d = ln(a, b) | 0;
+                f = 0.0;
+                e = 0;
+                p = 0;
+                while (1) {
+                  if ((p | 0) >= (b | 0)) break;
+                  e = (e + p) | 0;
+                  o = c[(a + ((p * 20) | 0)) >> 2] | 0;
+                  k = (a + ((p * 20) | 0) + 4) | 0;
+                  m = ((O(p, b) | 0) - e) | 0;
+                  n = (a + ((p * 20) | 0) + 8) | 0;
+                  j = 1;
+                  while (1) {
+                    if ((j | 0) >= (o | 0)) break;
+                    i = c[((c[k >> 2] | 0) + (j << 2)) >> 2] | 0;
+                    if ((i | 0) >= (p | 0)) {
+                      i = (d + ((m + i) << 2)) | 0;
+                      s = +g[((c[n >> 2] | 0) + (j << 2)) >> 2];
+                      f = f + +B(+(+g[i >> 2] - s));
+                      g[i >> 2] = s;
+                    }
+                    j = (j + 1) | 0;
+                  }
+                  p = (p + 1) | 0;
+                }
+                if (0) {
+                  b = c[15712] | 0;
+                  h[q >> 3] = f;
+                  w4(b, 89997, q) | 0;
+                }
+              } else d = 0;
+              l = r;
+              return d | 0;
+            }
+            function ln(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              m = l;
+              l = (l + 16) | 0;
+              h = m;
+              i = JK((((O((b + 1) | 0, b) | 0) / 2) | 0) << 2) | 0;
+              j = JK(b << 2) | 0;
+              ur(h, b);
+              d = 0;
+              f = 0;
+              k = b;
+              while (1) {
+                if ((d | 0) >= (b | 0)) break;
+                hs(d, a, b, j);
+                e = d;
+                g = f;
+                while (1) {
+                  if ((e | 0) == (b | 0)) break;
+                  c[(i + (g << 2)) >> 2] = c[(j + (e << 2)) >> 2];
+                  e = (e + 1) | 0;
+                  g = (g + 1) | 0;
+                }
+                d = (d + 1) | 0;
+                f = (f + k) | 0;
+                k = (k + -1) | 0;
+              }
+              U1(j);
+              vr(h);
+              l = m;
+              return i | 0;
+            }
+            function mn(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              n = l;
+              l = (l + 16) | 0;
+              i = n;
+              j = JK((((O((b + 1) | 0, b) | 0) / 2) | 0) << 2) | 0;
+              k = JK(b << 2) | 0;
+              ur(i, b);
+              d = 0;
+              f = 0;
+              m = b;
+              while (1) {
+                if ((d | 0) >= (b | 0)) break;
+                qr(d, a, b, k, i);
+                e = d;
+                h = f;
+                while (1) {
+                  if ((e | 0) == (b | 0)) break;
+                  g[(j + (h << 2)) >> 2] = +(c[(k + (e << 2)) >> 2] | 0);
+                  e = (e + 1) | 0;
+                  h = (h + 1) | 0;
+                }
+                d = (d + 1) | 0;
+                f = (f + m) | 0;
+                m = (m + -1) | 0;
+              }
+              U1(k);
+              vr(i);
+              l = n;
+              return j | 0;
+            }
+            function nn(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0.0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0.0;
+              r = (a + 8) | 0;
+              d = c[r >> 2] | 0;
+              e = 0;
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (b | 0)) break;
+                e = ((c[(a + ((f * 20) | 0)) >> 2] | 0) + e) | 0;
+                f = (f + 1) | 0;
+              }
+              f = JK(e << 2) | 0;
+              q = JK(b << 2) | 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (b | 0)) break;
+                c[(q + (e << 2)) >> 2] = 0;
+                e = (e + 1) | 0;
+              }
+              if (!(c[r >> 2] | 0)) {
+                h = 0;
+                while (1) {
+                  if ((h | 0) >= (b | 0)) break;
+                  c[(a + ((h * 20) | 0) + 8) >> 2] = f;
+                  Zs(a, h, q);
+                  i = (a + ((h * 20) | 0)) | 0;
+                  j = c[i >> 2] | 0;
+                  k = (a + ((h * 20) | 0) + 4) | 0;
+                  l = +((j + -1) | 0);
+                  e = 1;
+                  while (1) {
+                    if ((e | 0) >= (j | 0)) break;
+                    p = c[((c[k >> 2] | 0) + (e << 2)) >> 2] | 0;
+                    s = +(((c[(a + ((p * 20) | 0)) >> 2] | 0) + -1) | 0) + l;
+                    g[(f + (e << 2)) >> 2] = s - +(((Ys(a, h, p, q) | 0) << 1) | 0);
+                    e = (e + 1) | 0;
+                  }
+                  _s(a, h, q);
+                  f = (f + (c[i >> 2] << 2)) | 0;
+                  h = (h + 1) | 0;
+                }
+                f = mn(a, b) | 0;
+              } else {
+                j = 0;
+                while (1) {
+                  if ((j | 0) >= (b | 0)) break;
+                  Zs(a, j, q);
+                  k = (a + ((j * 20) | 0)) | 0;
+                  m = c[k >> 2] | 0;
+                  n = (a + ((j * 20) | 0) + 4) | 0;
+                  o = (m + -2) | 0;
+                  p = (a + ((j * 20) | 0) + 8) | 0;
+                  i = 1;
+                  while (1) {
+                    if ((i | 0) >= (m | 0)) break;
+                    e = c[((c[n >> 2] | 0) + (i << 2)) >> 2] | 0;
+                    h = (o + (c[(a + ((e * 20) | 0)) >> 2] | 0)) | 0;
+                    s = +((h - ((Ys(a, j, e, q) | 0) << 1)) | 0);
+                    l = +g[((c[p >> 2] | 0) + (i << 2)) >> 2];
+                    if (l < s) l = +((h - ((Ys(a, j, e, q) | 0) << 1)) | 0);
+                    g[(f + (i << 2)) >> 2] = l;
+                    i = (i + 1) | 0;
+                  }
+                  _s(a, j, q);
+                  c[p >> 2] = f;
+                  f = (f + (c[k >> 2] << 2)) | 0;
+                  j = (j + 1) | 0;
+                }
+                f = ln(a, b) | 0;
+              }
+              U1(q);
+              U1(c[r >> 2] | 0);
+              c[r >> 2] = 0;
+              a: do
+                if (d | 0) {
+                  e = 0;
+                  while (1) {
+                    if ((e | 0) >= (b | 0)) break a;
+                    c[(a + ((e * 20) | 0) + 8) >> 2] = d;
+                    d = (d + (c[(a + ((e * 20) | 0)) >> 2] << 2)) | 0;
+                    e = (e + 1) | 0;
+                  }
+                }
+              while (0);
+              return f | 0;
+            }
+            function on(a, b, e, f, i, j, k, m, n) {
+              a = a | 0;
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              i = i | 0;
+              j = j | 0;
+              k = k | 0;
+              m = m | 0;
+              n = n | 0;
+              var o = 0,
+                p = 0,
+                q = 0,
+                r = 0.0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0.0,
+                w = 0,
+                x = 0.0,
+                y = 0,
+                z = 0,
+                A = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0.0,
+                P = 0.0;
+              M = l;
+              l = (l + 80) | 0;
+              L = (M + 56) | 0;
+              K = (M + 48) | 0;
+              A = (M + 40) | 0;
+              u = (M + 32) | 0;
+              t = (M + 24) | 0;
+              s = (M + 16) | 0;
+              p = (M + 8) | 0;
+              o = M;
+              q = k & 4;
+              J = k & 3;
+              a: do
+                if ((n | 0) < 0) e = 0;
+                else {
+                  if (0) TO();
+                  k = (m | 0) == 2;
+                  b: do
+                    if (k) {
+                      if (0) U4(93290, 24, 1, c[15712] | 0) | 0;
+                      e = nn(a, b) | 0;
+                      w = 14;
+                    } else {
+                      switch (m | 0) {
+                        case 1: {
+                          e = jn(a, b) | 0;
+                          if (e | 0) {
+                            I = e;
+                            break b;
+                          }
+                          gA(0, 93315, o) | 0;
+                          gA(3, 93364, p) | 0;
+                          w = 15;
+                          break b;
+                        }
+                        case 3:
+                          break;
+                        default: {
+                          w = 15;
+                          break b;
+                        }
+                      }
+                      if (0) U4(93417, 21, 1, c[15712] | 0) | 0;
+                      e = kn(a, b) | 0;
+                      w = 14;
+                    }
+                  while (0);
+                  if ((w | 0) == 14)
+                    if (!e) w = 15;
+                    else I = e;
+                  do
+                    if ((w | 0) == 15) {
+                      if (0) U4(93439, 26, 1, c[15712] | 0) | 0;
+                      if (!(c[(a + 8) >> 2] | 0)) {
+                        I = mn(a, b) | 0;
+                        break;
+                      } else {
+                        I = ln(a, b) | 0;
+                        break;
+                      }
+                    }
+                  while (0);
+                  if (0) {
+                    H = c[15712] | 0;
+                    h[s >> 3] = +UO();
+                    w4(H, 93466, s) | 0;
+                    U4(93478, 25, 1, H) | 0;
+                    TO();
+                  }
+                  c: do
+                    if (((b | 0) > 1) & ((q | 0) != 0))
+                      if ((pn(a, b, f, j, q, J, k & 1) | 0) < 0) {
+                        u = 0;
+                        t = 0;
+                        e = -1;
+                        a = 0;
+                        s = 0;
+                        q = 0;
+                        p = 0;
+                        o = 0;
+                        m = 0;
+                        k = 0;
+                      } else {
+                        k = 0;
+                        while (1) {
+                          if ((k | 0) >= (j | 0)) {
+                            y = 0;
+                            w = 35;
+                            break c;
+                          }
+                          m = (f + (k << 2)) | 0;
+                          r = 1.0;
+                          e = 0;
+                          while (1) {
+                            if ((e | 0) == (b | 0)) break;
+                            x = +B(+(+h[((c[m >> 2] | 0) + (e << 3)) >> 3]));
+                            r = x > r ? x : r;
+                            e = (e + 1) | 0;
+                          }
+                          r = 1.0 / r;
+                          e = 0;
+                          while (1) {
+                            if ((e | 0) == (b | 0)) {
+                              e = 0;
+                              break;
+                            }
+                            H = ((c[m >> 2] | 0) + (e << 3)) | 0;
+                            h[H >> 3] = +h[H >> 3] * r;
+                            e = (e + 1) | 0;
+                          }
+                          while (1) {
+                            if ((e | 0) == (b | 0)) break;
+                            x = (+B5() + -0.5) * 1.0e-6;
+                            H = ((c[m >> 2] | 0) + (e << 3)) | 0;
+                            h[H >> 3] = +h[H >> 3] + x;
+                            e = (e + 1) | 0;
+                          }
+                          Ht(b, c[m >> 2] | 0);
+                          k = (k + 1) | 0;
+                        }
+                      }
+                    else {
+                      y = hn(0, b, j, f, i) | 0;
+                      w = 35;
+                    }
+                  while (0);
+                  d: do
+                    if ((w | 0) == 35) {
+                      if (0) {
+                        H = c[15712] | 0;
+                        h[t >> 3] = +UO();
+                        w4(H, 93504, t) | 0;
+                      }
+                      if (((b | 0) == 1) | ((n | 0) == 0)) {
+                        e = 0;
+                        break a;
+                      }
+                      if (0) {
+                        H = c[15712] | 0;
+                        h[u >> 3] = +UO();
+                        w4(H, 93466, u) | 0;
+                        U4(90019, 26, 1, H) | 0;
+                        TO();
+                      }
+                      s = j << 2;
+                      H = JK(s) | 0;
+                      t = b << 2;
+                      a = O(t, j) | 0;
+                      G = JK(a) | 0;
+                      e = 0;
+                      while (1) {
+                        if ((e | 0) >= (j | 0)) break;
+                        m = (G + ((O(e, b) | 0) << 2)) | 0;
+                        c[(H + (e << 2)) >> 2] = m;
+                        o = (f + (e << 2)) | 0;
+                        k = 0;
+                        while (1) {
+                          if ((k | 0) >= (b | 0)) break;
+                          g[(m + (k << 2)) >> 2] = +h[((c[o >> 2] | 0) + (k << 3)) >> 3];
+                          k = (k + 1) | 0;
+                        }
+                        e = (e + 1) | 0;
+                      }
+                      e: do
+                        if (!J) {
+                          p = (b + -1) | 0;
+                          e = 0;
+                          r = 0.0;
+                          o = 0;
+                          while (1) {
+                            if ((o | 0) >= (p | 0)) break e;
+                            q = (b - o) | 0;
+                            m = e;
+                            k = 1;
+                            while (1) {
+                              e = (m + 1) | 0;
+                              if ((k | 0) >= (q | 0)) break;
+                              m = e;
+                              r = +g[(I + (e << 2)) >> 2] + r;
+                              k = (k + 1) | 0;
+                            }
+                            o = (o + 1) | 0;
+                          }
+                        } else r = +(b | 0) * 0.5 * +((b + -1) | 0);
+                      while (0);
+                      C = ((O((b + 1) | 0, b) | 0) / 2) | 0;
+                      D = (J | 0) == 2;
+                      if (D) bu(C, I);
+                      cu(C, I);
+                      E = b << 3;
+                      m = JK(E) | 0;
+                      Y6(m | 0, 0, E | 0) | 0;
+                      F = (b + -1) | 0;
+                      e = 0;
+                      o = 0;
+                      while (1) {
+                        if ((o | 0) >= (F | 0)) {
+                          e = b;
+                          k = 0;
+                          o = 0;
+                          break;
+                        }
+                        p = (b - o) | 0;
+                        v = 0.0;
+                        k = 1;
+                        while (1) {
+                          e = (e + 1) | 0;
+                          if ((k | 0) >= (p | 0)) break;
+                          x = +g[(I + (e << 2)) >> 2];
+                          z = (m + ((k + o) << 3)) | 0;
+                          h[z >> 3] = +h[z >> 3] - x;
+                          v = v + x;
+                          k = (k + 1) | 0;
+                        }
+                        z = (m + (o << 3)) | 0;
+                        h[z >> 3] = +h[z >> 3] - v;
+                        o = (o + 1) | 0;
+                      }
+                      while (1) {
+                        if ((k | 0) >= (b | 0)) break;
+                        g[(I + (o << 2)) >> 2] = +h[(m + (k << 3)) >> 3];
+                        z = (e + o) | 0;
+                        e = (e + -1) | 0;
+                        k = (k + 1) | 0;
+                        o = z;
+                      }
+                      z = JK(s) | 0;
+                      c[z >> 2] = JK(a) | 0;
+                      e = 1;
+                      while (1) {
+                        if ((e | 0) >= (j | 0)) break;
+                        c[(z + (e << 2)) >> 2] = (c[z >> 2] | 0) + ((O(e, b) | 0) << 2);
+                        e = (e + 1) | 0;
+                      }
+                      p = JK(t) | 0;
+                      o = JK(t) | 0;
+                      k = JK(C << 2) | 0;
+                      if (0) {
+                        w = c[15712] | 0;
+                        h[A >> 3] = +UO();
+                        w4(w, 93466, A) | 0;
+                        U4(90046, 15, 1, w) | 0;
+                        TO();
+                      }
+                      w = (y | 0) == 0;
+                      y = c[15712] | 0;
+                      e = 0;
+                      q = 0;
+                      x = 1797693134862315708145274.0e284;
+                      while (1) {
+                        if (!(((q << 24) >> 24 == 0) & ((e | 0) < (n | 0)))) break;
+                        Y6(m | 0, 0, E | 0) | 0;
+                        if (D) {
+                          du(C, I, k);
+                          u = 0;
+                          a = 0;
+                        } else {
+                          u = 0;
+                          a = 0;
+                        }
+                        while (1) {
+                          if ((u | 0) >= (F | 0)) {
+                            q = b;
+                            s = 0;
+                            a = 0;
+                            break;
+                          }
+                          t = (b - u + -1) | 0;
+                          $t(t, 0.0, o);
+                          q = 0;
+                          while (1) {
+                            if ((q | 0) >= (j | 0)) break;
+                            A = (H + (q << 2)) | 0;
+                            $t(t, +g[((c[A >> 2] | 0) + (u << 2)) >> 2], p);
+                            Wt(t, p, -1.0, ((c[A >> 2] | 0) + (u << 2) + 4) | 0);
+                            bu(t, p);
+                            Vt(t, p, o, o);
+                            q = (q + 1) | 0;
+                          }
+                          eu(t, o);
+                          q = 0;
+                          while (1) {
+                            if ((q | 0) >= (t | 0)) break;
+                            s = (o + (q << 2)) | 0;
+                            v = +g[s >> 2];
+                            if ((v >= 3402823466385288598117041.0e14) | (v < 0.0)) g[s >> 2] = 0.0;
+                            q = (q + 1) | 0;
+                          }
+                          q = (a + 1) | 0;
+                          a = (u + 1) | 0;
+                          f: do
+                            if (D) {
+                              v = 0.0;
+                              s = 0;
+                              while (1) {
+                                if ((s | 0) >= (t | 0)) break f;
+                                A = (k + (q << 2)) | 0;
+                                N = +g[A >> 2] * +g[(o + (s << 2)) >> 2];
+                                g[A >> 2] = N;
+                                A = (m + ((a + s) << 3)) | 0;
+                                h[A >> 3] = +h[A >> 3] - N;
+                                v = v + N;
+                                q = (q + 1) | 0;
+                                s = (s + 1) | 0;
+                              }
+                            } else {
+                              v = 0.0;
+                              s = 0;
+                              while (1) {
+                                if ((s | 0) >= (t | 0)) break f;
+                                N = +g[(o + (s << 2)) >> 2];
+                                g[(k + (q << 2)) >> 2] = N;
+                                A = (m + ((a + s) << 3)) | 0;
+                                h[A >> 3] = +h[A >> 3] - N;
+                                v = v + N;
+                                q = (q + 1) | 0;
+                                s = (s + 1) | 0;
+                              }
+                            }
+                          while (0);
+                          A = (m + (u << 3)) | 0;
+                          h[A >> 3] = +h[A >> 3] - v;
+                          u = a;
+                          a = q;
+                        }
+                        while (1) {
+                          if ((s | 0) >= (b | 0)) {
+                            q = 0;
+                            break;
+                          }
+                          g[(k + (a << 2)) >> 2] = +h[(m + (s << 3)) >> 3];
+                          A = (q + a) | 0;
+                          q = (q + -1) | 0;
+                          s = (s + 1) | 0;
+                          a = A;
+                        }
+                        while (1) {
+                          if ((q | 0) >= (j | 0)) {
+                            v = 0.0;
+                            q = 0;
+                            break;
+                          }
+                          Tt(k, b, c[(H + (q << 2)) >> 2] | 0, c[(z + (q << 2)) >> 2] | 0);
+                          q = (q + 1) | 0;
+                        }
+                        while (1) {
+                          if ((q | 0) >= (j | 0)) break;
+                          v = +Zt(b, c[(H + (q << 2)) >> 2] | 0, c[(z + (q << 2)) >> 2] | 0) + v;
+                          q = (q + 1) | 0;
+                        }
+                        v = v * 2.0 + r;
+                        q = 0;
+                        while (1) {
+                          if ((q | 0) >= (j | 0)) break;
+                          A = (H + (q << 2)) | 0;
+                          Tt(I, b, c[A >> 2] | 0, p);
+                          v = v - +Zt(b, c[A >> 2] | 0, p);
+                          q = (q + 1) | 0;
+                        }
+                        P = x - v;
+                        N = +h[23294];
+                        q = (v < N ? 1 : (P >= 0.0 ? P : -P) / x < N) & 1;
+                        a = 0;
+                        while (1) {
+                          if ((a | 0) >= (j | 0)) break;
+                          t = (H + (a << 2)) | 0;
+                          s = c[t >> 2] | 0;
+                          g: do
+                            if (w) {
+                              if ((Ar(I, s, c[(z + (a << 2)) >> 2] | 0, b, 0.001, b) | 0) < 0) {
+                                u = z;
+                                t = I;
+                                e = -1;
+                                a = G;
+                                s = H;
+                                q = z;
+                                break d;
+                              }
+                            } else {
+                              Yt(b, s, p);
+                              if ((Ar(I, p, c[(z + (a << 2)) >> 2] | 0, b, 0.001, b) | 0) < 0) {
+                                u = z;
+                                t = I;
+                                e = -1;
+                                a = G;
+                                s = H;
+                                q = z;
+                                break d;
+                              } else s = 0;
+                              while (1) {
+                                if ((s | 0) >= (b | 0)) break g;
+                                if ((d[((c[((c[(i + (s << 2)) >> 2] | 0) + 16) >> 2] | 0) + 119) >> 0] | 0) <= 1)
+                                  c[((c[t >> 2] | 0) + (s << 2)) >> 2] = c[(p + (s << 2)) >> 2];
+                                s = (s + 1) | 0;
+                              }
+                            }
+                          while (0);
+                          a = (a + 1) | 0;
+                        }
+                        if (
+                          (((e | 0) % 5 | 0 | 0) == 0) & (0 != 0)
+                            ? ((h[K >> 3] = v), w4(y, 90371, K) | 0, (((e + 5) | 0) % 50 | 0 | 0) == 0)
+                            : 0
+                        )
+                          E6(10, y) | 0;
+                        e = (e + 1) | 0;
+                        x = v;
+                      }
+                      if (!0) q = 0;
+                      else {
+                        N = +qn(H, I, j, b, J);
+                        P = +UO();
+                        h[L >> 3] = N;
+                        c[(L + 8) >> 2] = e;
+                        h[(L + 16) >> 3] = P;
+                        w4(y, 90062, L) | 0;
+                        q = 0;
+                      }
+                      while (1) {
+                        if ((q | 0) >= (j | 0)) {
+                          u = z;
+                          t = I;
+                          a = G;
+                          s = H;
+                          q = z;
+                          break d;
+                        }
+                        a = (H + (q << 2)) | 0;
+                        t = (f + (q << 2)) | 0;
+                        s = 0;
+                        while (1) {
+                          if ((s | 0) >= (b | 0)) break;
+                          h[((c[t >> 2] | 0) + (s << 3)) >> 3] = +g[((c[a >> 2] | 0) + (s << 2)) >> 2];
+                          s = (s + 1) | 0;
+                        }
+                        q = (q + 1) | 0;
+                      }
+                    }
+                  while (0);
+                  U1(a);
+                  U1(s);
+                  U1(t);
+                  if (u | 0) {
+                    U1(c[u >> 2] | 0);
+                    U1(q);
+                  }
+                  U1(p);
+                  U1(o);
+                  U1(m);
+                  U1(k);
+                }
+              while (0);
+              l = M;
+              return e | 0;
+            }
+            function pn(b, d, e, f, i, j, k) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              i = i | 0;
+              j = j | 0;
+              k = k | 0;
+              var m = 0,
+                n = 0,
+                o = 0,
+                p = 0.0,
+                q = 0,
+                r = 0,
+                s = 0.0,
+                t = 0,
+                u = 0.0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                P = 0,
+                Q = 0,
+                R = 0;
+              R = l;
+              l = (l + 32) | 0;
+              o = (R + 24) | 0;
+              Q = (R + 8) | 0;
+              H = (R + 4) | 0;
+              N = R;
+              M = (d | 0) < 50 ? d : 50;
+              P = KK(M << 2) | 0;
+              G = d << 3;
+              n = KK(O(G, M) | 0) | 0;
+              m = 0;
+              while (1) {
+                if ((m | 0) >= (M | 0)) break;
+                c[(P + (m << 2)) >> 2] = n + ((O(m, d) | 0) << 3);
+                m = (m + 1) | 0;
+              }
+              E = M << 1;
+              E = (E | 0) > 50 ? E : 50;
+              E = (E | 0) > (d | 0) ? d : E;
+              c[o >> 2] = 0;
+              rs(b, d, E, o, k);
+              ss(c[o >> 2] | 0, d, E);
+              mu(c[o >> 2] | 0, E, d, P, M);
+              U1(c[c[o >> 2] >> 2] | 0);
+              U1(c[o >> 2] | 0);
+              E = d << 2;
+              L = KK(E) | 0;
+              m = 0;
+              while (1) {
+                if ((m | 0) >= (d | 0)) break;
+                c[(L + (m << 2)) >> 2] = -1;
+                m = (m + 1) | 0;
+              }
+              ur(Q, d);
+              J = c[(b + 8) >> 2] | 0;
+              I = (k | 0) != 0;
+              if (I) dt(b, d);
+              C = KK(E) | 0;
+              K = KK(160) | 0;
+              n = KK((d * 160) | 0) | 0;
+              D = KK(160) | 0;
+              m = 0;
+              while (1) {
+                if ((m | 0) == 40) break;
+                c[(D + (m << 2)) >> 2] = n + ((O(m, d) | 0) << 2);
+                m = (m + 1) | 0;
+              }
+              m = (x5() | 0) % (d | 0) | 0;
+              c[(L + (m << 2)) >> 2] = 0;
+              c[K >> 2] = m;
+              n = c[D >> 2] | 0;
+              if (I) {
+                bs(m, b, d, n);
+                n = 0;
+                o = 0;
+              } else {
+                qr(m, b, d, n, Q);
+                n = 0;
+                o = 0;
+              }
+              while (1) {
+                if ((o | 0) >= (d | 0)) {
+                  r = 1;
+                  break;
+                }
+                F = c[((c[D >> 2] | 0) + (o << 2)) >> 2] | 0;
+                c[(C + (o << 2)) >> 2] = F;
+                A = (F | 0) > (n | 0);
+                m = A ? o : m;
+                n = A ? F : n;
+                o = (o + 1) | 0;
+              }
+              while (1) {
+                if ((r | 0) == 40) {
+                  m = 0;
+                  break;
+                }
+                c[(L + (m << 2)) >> 2] = r;
+                c[(K + (r << 2)) >> 2] = m;
+                t = (D + (r << 2)) | 0;
+                n = c[t >> 2] | 0;
+                if (I) {
+                  bs(m, b, d, n);
+                  q = 0;
+                  n = 0;
+                } else {
+                  qr(m, b, d, n, Q);
+                  q = 0;
+                  n = 0;
+                }
+                while (1) {
+                  if ((q | 0) >= (d | 0)) break;
+                  o = (C + (q << 2)) | 0;
+                  F = c[o >> 2] | 0;
+                  k = c[((c[t >> 2] | 0) + (q << 2)) >> 2] | 0;
+                  k = (F | 0) < (k | 0) ? F : k;
+                  c[o >> 2] = k;
+                  if ((k | 0) <= (n | 0)) {
+                    if ((k | 0) == (n | 0) ? ((x5() | 0) % ((q + 1) | 0) | 0 | 0) == 0 : 0) {
+                      n = c[o >> 2] | 0;
+                      m = q;
+                    }
+                  } else {
+                    n = k;
+                    m = q;
+                  }
+                  q = (q + 1) | 0;
+                }
+                r = (r + 1) | 0;
+              }
+              while (1) {
+                if ((m | 0) >= (d | 0)) break;
+                c[(C + (m << 2)) >> 2] = -1;
+                m = (m + 1) | 0;
+              }
+              w = KK(E) | 0;
+              F = KK(d << 4) | 0;
+              x = (d + -1) | 0;
+              y = x << 2;
+              A = 0;
+              o = 0;
+              k = 0;
+              n = 0;
+              z = 0;
+              while (1) {
+                if ((z | 0) >= (d | 0)) break;
+                m = (L + (z << 2)) | 0;
+                a: do
+                  if ((c[m >> 2] | 0) > -1) {
+                    t = (F + (z << 4) + 4) | 0;
+                    c[t >> 2] = KK(y) | 0;
+                    v = KK(y) | 0;
+                    c[(F + (z << 4) + 8) >> 2] = v;
+                    c[(F + (z << 4)) >> 2] = x;
+                    a[(F + (z << 4) + 12) >> 0] = 1;
+                    r = (D + (c[m >> 2] << 2)) | 0;
+                    m = 0;
+                    while (1) {
+                      if ((m | 0) == (z | 0)) {
+                        q = z;
+                        break;
+                      }
+                      c[((c[t >> 2] | 0) + (m << 2)) >> 2] = m;
+                      c[(v + (m << 2)) >> 2] = c[((c[r >> 2] | 0) + (m << 2)) >> 2];
+                      m = (m + 1) | 0;
+                    }
+                    while (1) {
+                      m = (q + 1) | 0;
+                      if ((q | 0) == (x | 0)) {
+                        m = x;
+                        break a;
+                      }
+                      c[((c[t >> 2] | 0) + (q << 2)) >> 2] = m;
+                      c[(v + (q << 2)) >> 2] = c[((c[r >> 2] | 0) + (m << 2)) >> 2];
+                      q = m;
+                    }
+                  } else {
+                    if ((n | 0) < 40) {
+                      k = KK(E) | 0;
+                      o = KK(E) | 0;
+                      n = d;
+                      m = 1;
+                    } else m = 0;
+                    a[(F + (z << 4) + 12) >> 0] = m;
+                    c[(F + (z << 4) + 4) >> 2] = k;
+                    c[(F + (z << 4) + 8) >> 2] = o;
+                    c[(F + (z << 4)) >> 2] = 40;
+                    m = 0;
+                    while (1) {
+                      if ((m | 0) == 40) break;
+                      c[(k + (m << 2)) >> 2] = c[(K + (m << 2)) >> 2];
+                      c[(o + (m << 2)) >> 2] = c[((c[(D + (m << 2)) >> 2] | 0) + (z << 2)) >> 2];
+                      m = (m + 1) | 0;
+                    }
+                    o = (o + 160) | 0;
+                    k = (k + 160) | 0;
+                    n = (n + -40) | 0;
+                    m = 40;
+                  }
+                while (0);
+                A = (m + A) | 0;
+                z = (z + 1) | 0;
+              }
+              U1(C);
+              U1(w);
+              if (D | 0) {
+                U1(c[D >> 2] | 0);
+                U1(D);
+              }
+              D = KK((d * 20) | 0) | 0;
+              q = (A + d) << 2;
+              r = KK(q) | 0;
+              v = (j | 0) == 2;
+              q = KK(q) | 0;
+              t = 0;
+              while (1) {
+                if ((t | 0) >= (d | 0)) break;
+                c[(D + ((t * 20) | 0) + 4) >> 2] = r;
+                c[(D + ((t * 20) | 0) + 8) >> 2] = q;
+                m = ((c[(F + (t << 4)) >> 2] | 0) + 1) | 0;
+                w = (D + ((t * 20) | 0)) | 0;
+                c[w >> 2] = m;
+                o = ((c[(F + (t << 4) + 8) >> 2] | 0) + -4) | 0;
+                k = (F + (t << 4) + 4) | 0;
+                b: do
+                  if (v) {
+                    p = 0.0;
+                    n = 1;
+                    while (1) {
+                      if ((n | 0) >= (m | 0)) break b;
+                      c[(r + (n << 2)) >> 2] = c[((c[k >> 2] | 0) + ((n + -1) << 2)) >> 2];
+                      u = +(c[(o + (n << 2)) >> 2] | 0);
+                      u = -1.0 / (u * u);
+                      g[(q + (n << 2)) >> 2] = u;
+                      p = p - u;
+                      n = (n + 1) | 0;
+                      m = c[w >> 2] | 0;
+                    }
+                  } else {
+                    p = 0.0;
+                    n = 1;
+                    while (1) {
+                      if ((n | 0) >= (m | 0)) break b;
+                      c[(r + (n << 2)) >> 2] = c[((c[k >> 2] | 0) + ((n + -1) << 2)) >> 2];
+                      u = -1.0 / +(c[(o + (n << 2)) >> 2] | 0);
+                      g[(q + (n << 2)) >> 2] = u;
+                      p = p - u;
+                      n = (n + 1) | 0;
+                      m = c[w >> 2] | 0;
+                    }
+                  }
+                while (0);
+                c[r >> 2] = t;
+                g[q >> 2] = p;
+                E = c[w >> 2] | 0;
+                q = (q + (E << 2)) | 0;
+                r = (r + (E << 2)) | 0;
+                t = (t + 1) | 0;
+              }
+              C = KK(f << 2) | 0;
+              c[C >> 2] = KK(O(f << 3, M) | 0) | 0;
+              m = 1;
+              while (1) {
+                if ((m | 0) >= (f | 0)) break;
+                c[(C + (m << 2)) >> 2] = (c[C >> 2] | 0) + ((O(m, M) | 0) << 3);
+                m = (m + 1) | 0;
+              }
+              c: do
+                if (i) {
+                  m = 0;
+                  while (1) {
+                    if ((m | 0) >= (f | 0)) break;
+                    o = (C + (m << 2)) | 0;
+                    n = 0;
+                    while (1) {
+                      if ((n | 0) >= (M | 0)) break;
+                      h[((c[o >> 2] | 0) + (n << 3)) >> 3] = 0.0;
+                      n = (n + 1) | 0;
+                    }
+                    m = (m + 1) | 0;
+                  }
+                  if ((f | 0) != 2) {
+                    m = 0;
+                    while (1) {
+                      if ((m | 0) >= (f | 0)) {
+                        m = 0;
+                        break c;
+                      }
+                      h[((c[(C + (m << 2)) >> 2] | 0) + (m << 3)) >> 3] = 1.0;
+                      m = (m + 1) | 0;
+                    }
+                  }
+                  h[c[C >> 2] >> 3] = 1.0;
+                  m = (C + 4) | 0;
+                  if (!(((nu(P, M, d, c[m >> 2] | 0) | 0) << 24) >> 24)) {
+                    n = c[m >> 2] | 0;
+                    m = 0;
+                    while (1) {
+                      if ((m | 0) >= (M | 0)) break;
+                      h[(n + (m << 3)) >> 3] = 0.0;
+                      m = (m + 1) | 0;
+                    }
+                    h[(n + 8) >> 3] = 1.0;
+                    m = 0;
+                  } else m = 0;
+                } else {
+                  n = 0;
+                  while (1) {
+                    if ((n | 0) >= (f | 0)) {
+                      m = 0;
+                      break c;
+                    }
+                    o = (C + (n << 2)) | 0;
+                    m = 0;
+                    while (1) {
+                      if ((m | 0) >= (M | 0)) break;
+                      u = +(x5() | 0) * 4.656612875245797e-10;
+                      h[((c[o >> 2] | 0) + (m << 3)) >> 3] = u;
+                      m = (m + 1) | 0;
+                    }
+                    n = (n + 1) | 0;
+                  }
+                }
+              while (0);
+              while (1) {
+                if ((m | 0) >= (f | 0)) break;
+                Rt(P, d, M, c[(C + (m << 2)) >> 2] | 0, c[(e + (m << 2)) >> 2] | 0);
+                m = (m + 1) | 0;
+              }
+              c[H >> 2] = 0;
+              c[N >> 2] = 0;
+              Gt(D, P, d, M, H);
+              Et(P, c[H >> 2] | 0, M, d, M, N);
+              U1(c[c[H >> 2] >> 2] | 0);
+              U1(c[H >> 2] | 0);
+              z = KK(G) | 0;
+              A = KK(M << 3) | 0;
+              m = 0;
+              n = 0;
+              p = +rn(e, F, f, d, j);
+              d: while (1) {
+                if (((n | 0) < 50) & ((m << 24) >> 24 == 0)) x = 0;
+                else break;
+                while (1) {
+                  if ((x | 0) >= (f | 0)) break;
+                  y = (e + (x << 2)) | 0;
+                  o = 0;
+                  while (1) {
+                    if ((o | 0) >= (d | 0)) break;
+                    q = (z + (o << 3)) | 0;
+                    h[q >> 3] = 0.0;
+                    r = ((c[(F + (o << 4) + 8) >> 2] | 0) + -4) | 0;
+                    t = c[(D + ((o * 20) | 0) + 4) >> 2] | 0;
+                    v = c[(D + ((o * 20) | 0) + 8) >> 2] | 0;
+                    w = (D + ((o * 20) | 0)) | 0;
+                    s = 0.0;
+                    k = 1;
+                    while (1) {
+                      if ((k | 0) >= (c[w >> 2] | 0)) break;
+                      m = c[(t + (k << 2)) >> 2] | 0;
+                      u = +ft(e, f, o, m);
+                      if (u > 1.0e-30) {
+                        u = -(+g[(v + (k << 2)) >> 2] * +(c[(r + (k << 2)) >> 2] | 0)) / u;
+                        h[q >> 3] = u * +h[((c[y >> 2] | 0) + (m << 3)) >> 3] + +h[q >> 3];
+                        s = s - u;
+                      }
+                      k = (k + 1) | 0;
+                    }
+                    h[q >> 3] = +h[q >> 3] + +h[((c[y >> 2] | 0) + (o << 3)) >> 3] * s;
+                    o = (o + 1) | 0;
+                  }
+                  Dt(P, M, d, z, A);
+                  m = (C + (x << 2)) | 0;
+                  if (zr(c[N >> 2] | 0, c[m >> 2] | 0, A, M, 0.001, M, 0) | 0) {
+                    n = -1;
+                    break d;
+                  }
+                  Rt(P, d, M, c[m >> 2] | 0, c[y >> 2] | 0);
+                  x = (x + 1) | 0;
+                }
+                if (!(n & 1)) {
+                  u = +rn(e, F, f, d, j);
+                  p = +B(+(u - p)) / (u + 1.0e-10);
+                  m = (p < +h[23294]) & 1;
+                  p = u;
+                } else m = 0;
+                n = (n + 1) | 0;
+              }
+              U1(A);
+              U1(z);
+              if (I) {
+                et(b, d, J);
+                m = 0;
+              } else m = 0;
+              while (1) {
+                if ((m | 0) >= (d | 0)) break;
+                if (a[(F + (m << 4) + 12) >> 0] | 0) {
+                  U1(c[(F + (m << 4) + 4) >> 2] | 0);
+                  U1(c[(F + (m << 4) + 8) >> 2] | 0);
+                }
+                m = (m + 1) | 0;
+              }
+              U1(F);
+              U1(c[(D + 4) >> 2] | 0);
+              U1(c[(D + 8) >> 2] | 0);
+              U1(D);
+              U1(L);
+              U1(K);
+              U1(c[C >> 2] | 0);
+              U1(C);
+              m = c[N >> 2] | 0;
+              if (m | 0) {
+                U1(c[m >> 2] | 0);
+                U1(c[N >> 2] | 0);
+              }
+              U1(c[P >> 2] | 0);
+              U1(P);
+              vr(Q);
+              l = R;
+              return n | 0;
+            }
+            function qn(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var h = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                l = 0.0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0;
+              q = (e + -1) | 0;
+              o = (f | 0) == 2;
+              h = 0.0;
+              f = 0;
+              m = 0;
+              while (1) {
+                if ((m | 0) >= (q | 0)) break;
+                p = (e - m) | 0;
+                n = 1;
+                while (1) {
+                  f = (f + 1) | 0;
+                  if ((n | 0) >= (p | 0)) break;
+                  k = (n + m) | 0;
+                  i = 0.0;
+                  j = 0;
+                  while (1) {
+                    if ((j | 0) >= (d | 0)) break;
+                    r = c[(a + (j << 2)) >> 2] | 0;
+                    l = +g[(r + (m << 2)) >> 2] - +g[(r + (k << 2)) >> 2];
+                    i = i + l * l;
+                    j = (j + 1) | 0;
+                  }
+                  i = +C(+i);
+                  l = +g[(b + (f << 2)) >> 2];
+                  if (o) {
+                    i = 1.0 / +C(+l) - i;
+                    i = i * i;
+                  } else {
+                    i = 1.0 / l - i;
+                    i = i * i;
+                  }
+                  n = (n + 1) | 0;
+                  h = i * l + h;
+                }
+                m = (m + 1) | 0;
+              }
+              return +h;
+            }
+            function rn(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0.0,
+                q = 0;
+              a: do
+                if ((f | 0) == 2) {
+                  g = 0.0;
+                  l = 0;
+                  while (1) {
+                    if ((l | 0) >= (e | 0)) break a;
+                    n = c[(b + (l << 4)) >> 2] | 0;
+                    o = (b + (l << 4) + 4) | 0;
+                    m = (b + (l << 4) + 8) | 0;
+                    k = 0;
+                    while (1) {
+                      if ((k | 0) >= (n | 0)) break;
+                      j = c[((c[o >> 2] | 0) + (k << 2)) >> 2] | 0;
+                      if ((j | 0) > (l | 0)) {
+                        i = 0.0;
+                        f = 0;
+                        while (1) {
+                          if ((f | 0) >= (d | 0)) break;
+                          q = c[(a + (f << 2)) >> 2] | 0;
+                          p = +h[(q + (l << 3)) >> 3] - +h[(q + (j << 3)) >> 3];
+                          i = p * p + i;
+                          f = (f + 1) | 0;
+                        }
+                        i = +C(+i);
+                        p = +(c[((c[m >> 2] | 0) + (k << 2)) >> 2] | 0);
+                        i = p - i;
+                        g = (i * i) / (p * p) + g;
+                      }
+                      k = (k + 1) | 0;
+                    }
+                    l = (l + 1) | 0;
+                  }
+                } else {
+                  l = 0;
+                  g = 0.0;
+                  while (1) {
+                    if ((l | 0) >= (e | 0)) break a;
+                    m = c[(b + (l << 4)) >> 2] | 0;
+                    n = (b + (l << 4) + 4) | 0;
+                    o = (b + (l << 4) + 8) | 0;
+                    k = 0;
+                    while (1) {
+                      if ((k | 0) >= (m | 0)) break;
+                      j = c[((c[n >> 2] | 0) + (k << 2)) >> 2] | 0;
+                      if ((j | 0) > (l | 0)) {
+                        i = 0.0;
+                        f = 0;
+                        while (1) {
+                          if ((f | 0) >= (d | 0)) break;
+                          q = c[(a + (f << 2)) >> 2] | 0;
+                          p = +h[(q + (l << 3)) >> 3] - +h[(q + (j << 3)) >> 3];
+                          i = p * p + i;
+                          f = (f + 1) | 0;
+                        }
+                        i = +C(+i);
+                        p = +(c[((c[o >> 2] | 0) + (k << 2)) >> 2] | 0);
+                        i = p - i;
+                        g = (i * i) / p + g;
+                      }
+                      k = (k + 1) | 0;
+                    }
+                    l = (l + 1) | 0;
+                  }
+                }
+              while (0);
+              return +g;
+            }
+            function sn(a) {
+              a = +a;
+              return +(+C(+a) * a);
+            }
+            function tn(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0,
+                g = 0,
+                i = 0.0;
+              g = c[47137] | 0;
+              e = 0.0;
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (g | 0)) break;
+                i = +h[(a + (f << 3)) >> 3] - +h[(b + (f << 3)) >> 3];
+                h[(d + (f << 3)) >> 3] = i;
+                e = i * i + e;
+                f = (f + 1) | 0;
+              }
+              return +(+C(+e));
+            }
+            function un(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = +d;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0;
+              i = JK(a << 2) | 0;
+              f = 0;
+              g = JK(O(a << 3, b) | 0) | 0;
+              while (1) {
+                if ((f | 0) >= (a | 0)) break;
+                c[(i + (f << 2)) >> 2] = g;
+                e = 0;
+                while (1) {
+                  if ((e | 0) >= (b | 0)) break;
+                  h[(g + (e << 3)) >> 3] = d;
+                  e = (e + 1) | 0;
+                }
+                f = (f + 1) | 0;
+                g = (g + (b << 3)) | 0;
+              }
+              return i | 0;
+            }
+            function vn(a) {
+              a = a | 0;
+              if (a | 0) {
+                U1(c[a >> 2] | 0);
+                U1(a);
+              }
+              return;
+            }
+            function wn(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              o = l;
+              l = (l + 16) | 0;
+              n = tB(b) | 0;
+              m = uB(b) | 0;
+              k = GA(b, 2, 92493, 0) | 0;
+              a: do
+                if (!d) {
+                  h[23294] = +(n | 0) * 0.0001;
+                  pK(b, 108886, 186352);
+                  g = QA(c[(b + 60) >> 2] | 0, 90100) | 0;
+                  if (!g) e = 0.99;
+                  else e = +r5(g);
+                  h[23296] = e;
+                  g = JK(((n << 2) + 4) | 0) | 0;
+                  j = (b + 16) | 0;
+                  c[((c[j >> 2] | 0) + 152) >> 2] = g;
+                  g = 0;
+                  e = 0.0;
+                  i = jC(b) | 0;
+                  while (1) {
+                    if (!i) break a;
+                    c[((c[((c[j >> 2] | 0) + 152) >> 2] | 0) + (g << 2)) >> 2] = i;
+                    p = c[(i + 16) >> 2] | 0;
+                    c[(p + 120) >> 2] = g;
+                    c[(p + 124) >> 2] = -1;
+                    f = +zn(b, i, k) + e;
+                    g = (g + 1) | 0;
+                    e = f;
+                    i = kC(b, i) | 0;
+                  }
+                } else {
+                  h[23294] = 0.0001;
+                  pK(b, 108886, 186352);
+                  g = 0;
+                  e = 0.0;
+                  i = jC(b) | 0;
+                  while (1) {
+                    if (!i) break a;
+                    c[((c[(i + 16) >> 2] | 0) + 120) >> 2] = g;
+                    f = +zn(b, i, k) + e;
+                    g = (g + 1) | 0;
+                    e = f;
+                    i = kC(b, i) | 0;
+                  }
+                }
+              while (0);
+              g = QA(b, 90108) | 0;
+              if ((g | 0) != 0 ? (a[g >> 0] | 0) != 0 : 0) {
+                e = +h[23294];
+                f = +r5(g);
+                if (!(e > f)) e = f;
+              } else e = (e / +(((m | 0) > 1 ? m : 1) | 0)) * +C(+(+(n | 0))) + 1.0;
+              h[23295] = e;
+              if (!(c[47134] | d)) {
+                d = un(n, n, e) | 0;
+                p = (b + 16) | 0;
+                c[((c[p >> 2] | 0) + 160) >> 2] = d;
+                d = un(n, n, 1.0) | 0;
+                c[((c[p >> 2] | 0) + 164) >> 2] = d;
+                d = un(n, c[47137] | 0, 1.0) | 0;
+                c[((c[p >> 2] | 0) + 168) >> 2] = d;
+                d = An(n, n, c[47137] | 0) | 0;
+                c[((c[p >> 2] | 0) + 172) >> 2] = d;
+              }
+              l = o;
+              return n | 0;
+            }
+            function xn(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              f = 0;
+              e = 0;
+              j = aB(a, b) | 0;
+              a: while (1) {
+                if (!j) break;
+                h = c[j >> 2] & 3;
+                g = c[(((h | 0) == 2 ? j : (j + -48) | 0) + 40) >> 2] | 0;
+                h = c[(((h | 0) == 3 ? j : (j + 48) | 0) + 40) >> 2] | 0;
+                do
+                  if ((g | 0) != (h | 0)) {
+                    i = (h | 0) == (b | 0);
+                    if ((e | 0) != 1) {
+                      f = i ? g : h;
+                      c[d >> 2] = f;
+                      e = (e + 1) | 0;
+                      break;
+                    }
+                    if (!(((g | 0) == (f | 0)) & i) ? !(((g | 0) == (b | 0)) & ((h | 0) == (f | 0))) : 0) {
+                      e = 2;
+                      break a;
+                    } else e = 1;
+                  }
+                while (0);
+                j = bB(a, j, b) | 0;
+              }
+              return e | 0;
+            }
+            function yn(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 16) | 0;
+              f = h;
+              g = (a + 60) | 0;
+              a: while (1) {
+                b: while (1) {
+                  if (!b) break a;
+                  switch (xn(a, b, f) | 0) {
+                    case 0: {
+                      e = 5;
+                      break b;
+                    }
+                    case 1: {
+                      e = 8;
+                      break b;
+                    }
+                    default:
+                      b = 0;
+                  }
+                }
+                if ((e | 0) == 5) {
+                  if ((d | 0) == (b | 0)) d = kC(a, d) | 0;
+                  wC(c[g >> 2] | 0, b) | 0;
+                  b = 0;
+                  continue;
+                } else if ((e | 0) == 8) {
+                  if ((d | 0) == (b | 0)) d = kC(a, d) | 0;
+                  wC(c[g >> 2] | 0, b) | 0;
+                  b = c[f >> 2] | 0;
+                  continue;
+                }
+              }
+              l = h;
+              return d | 0;
+            }
+            function zn(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 32) | 0;
+              i = (k + 8) | 0;
+              g = k;
+              b = XA(a, b) | 0;
+              e = 0.0;
+              while (1) {
+                if (!b) break;
+                switch (Bn(b, d, g) | 0) {
+                  case 0: {
+                    f = +h[g >> 3];
+                    break;
+                  }
+                  case 2: {
+                    c[i >> 2] = KB(a) | 0;
+                    h[(i + 8) >> 3] = 1.0;
+                    gA(3, 90120, i) | 0;
+                    j = 6;
+                    break;
+                  }
+                  default:
+                    j = 6;
+                }
+                if ((j | 0) == 6) {
+                  j = 0;
+                  h[g >> 3] = 1.0;
+                  f = 1.0;
+                }
+                h[((c[(b + 16) >> 2] | 0) + 136) >> 3] = f;
+                b = ZA(a, b) | 0;
+                e = f + e;
+              }
+              l = k;
+              return +e;
+            }
+            function An(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              j = JK(((a << 2) + 4) | 0) | 0;
+              k = ((b << 2) + 4) | 0;
+              l = d << 3;
+              g = 0;
+              while (1) {
+                if ((g | 0) >= (a | 0)) break;
+                i = (j + (g << 2)) | 0;
+                c[i >> 2] = JK(k) | 0;
+                f = 0;
+                while (1) {
+                  if ((f | 0) >= (b | 0)) break;
+                  e = JK(l) | 0;
+                  c[((c[i >> 2] | 0) + (f << 2)) >> 2] = e;
+                  e = 0;
+                  while (1) {
+                    if ((e | 0) >= (d | 0)) break;
+                    h[((c[((c[i >> 2] | 0) + (f << 2)) >> 2] | 0) + (e << 3)) >> 3] = 0.0;
+                    e = (e + 1) | 0;
+                  }
+                  f = (f + 1) | 0;
+                }
+                c[((c[i >> 2] | 0) + (f << 2)) >> 2] = 0;
+                g = (g + 1) | 0;
+              }
+              c[(j + (g << 2)) >> 2] = 0;
+              return j | 0;
+            }
+            function Bn(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 16) | 0;
+              j = (k + 8) | 0;
+              i = k;
+              do
+                if ((d | 0) != 0 ? ((f = RA(b, d) | 0), (a[f >> 0] | 0) != 0) : 0) {
+                  c[i >> 2] = e;
+                  if (
+                    ((b5(f, 101209, i) | 0) >= 1 ? ((g = +h[e >> 3]), !(g < 0.0)) : 0)
+                      ? (g != 0.0) | ((c[47134] | 0) != 0)
+                      : 0
+                  ) {
+                    b = 0;
+                    break;
+                  }
+                  c[j >> 2] = f;
+                  gA(0, 90147, j) | 0;
+                  b = 2;
+                } else b = 1;
+              while (0);
+              l = k;
+              return b | 0;
+            }
+            function Cn(a) {
+              a = a | 0;
+              return wn(a, 0) | 0;
+            }
+            function Dn(a) {
+              a = a | 0;
+              a = (a + 16) | 0;
+              U1(c[((c[a >> 2] | 0) + 152) >> 2] | 0);
+              if (!(c[47134] | 0)) {
+                vn(c[((c[a >> 2] | 0) + 160) >> 2] | 0);
+                vn(c[((c[a >> 2] | 0) + 164) >> 2] | 0);
+                vn(c[((c[a >> 2] | 0) + 168) >> 2] | 0);
+                En(c[((c[a >> 2] | 0) + 172) >> 2] | 0);
+                c[((c[a >> 2] | 0) + 172) >> 2] = 0;
+              }
+              return;
+            }
+            function En(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              if (a | 0) {
+                f = 0;
+                while (1) {
+                  g = (a + (f << 2)) | 0;
+                  b = c[g >> 2] | 0;
+                  if (!b) break;
+                  else e = 0;
+                  while (1) {
+                    d = c[(b + (e << 2)) >> 2] | 0;
+                    if (!d) break;
+                    U1(d);
+                    e = (e + 1) | 0;
+                    b = c[g >> 2] | 0;
+                  }
+                  U1(b);
+                  f = (f + 1) | 0;
+                }
+                U1(a);
+              }
+              return;
+            }
+            function Fn(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0;
+              e = +(b | 0);
+              b = (a + 16) | 0;
+              while (1) {
+                if ((d | 0) >= (c[47137] | 0)) break;
+                f = +B5() * e;
+                h[((c[((c[b >> 2] | 0) + 132) >> 2] | 0) + (d << 3)) >> 3] = f;
+                d = (d + 1) | 0;
+              }
+              return;
+            }
+            function Gn(a, b) {
+              a = a | 0;
+              b = b | 0;
+              Fn(a, b, 2);
+              return;
+            }
+            function Hn(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0.0,
+                f = 0.0;
+              e = +(b | 0);
+              f = +B5() * e;
+              d = (a + 16) | 0;
+              h[c[((c[d >> 2] | 0) + 132) >> 2] >> 3] = f;
+              e = +B5() * e;
+              h[((c[((c[d >> 2] | 0) + 132) >> 2] | 0) + 8) >> 3] = e;
+              if ((c[47137] | 0) > 2) Gn(a, b);
+              return;
+            }
+            function In(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              f = l;
+              l = (l + 16) | 0;
+              e = f;
+              if (0) U4(90165, 26, 1, c[15712] | 0) | 0;
+              d = nm(b, d, 2) | 0;
+              a: do
+                if ((d | 0) != 1) {
+                  if (!(c[46797] | d)) {
+                    gA(0, 90192, e) | 0;
+                    c[46797] = 1;
+                  }
+                  e = (b + 16) | 0;
+                  d = 0;
+                  while (1) {
+                    b = c[((c[((c[e >> 2] | 0) + 152) >> 2] | 0) + (d << 2)) >> 2] | 0;
+                    if (!b) break a;
+                    if (!(a[((c[(b + 16) >> 2] | 0) + 119) >> 0] | 0)) Hn(b, 1);
+                    d = (d + 1) | 0;
+                  }
+                }
+              while (0);
+              l = f;
+              return;
+            }
+            function Jn(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0.0;
+              q = l;
+              l = (l + 96) | 0;
+              p = (q + 80) | 0;
+              n = q;
+              if (0) {
+                U4(90241, 25, 1, c[15712] | 0) | 0;
+                TO();
+              }
+              o = (a + 16) | 0;
+              f = c[o >> 2] | 0;
+              k = c[(f + 164) >> 2] | 0;
+              f = c[(f + 160) >> 2] | 0;
+              m = 0;
+              while (1) {
+                if ((m | 0) >= (b | 0)) break;
+                i = (f + (m << 2)) | 0;
+                j = (k + (m << 2)) | 0;
+                e = 0;
+                while (1) {
+                  if ((e | 0) == (m | 0)) break;
+                  g = +h[((c[i >> 2] | 0) + (e << 3)) >> 3];
+                  g = 1.0 / (g * g);
+                  d = c[((c[o >> 2] | 0) + 152) >> 2] | 0;
+                  d = iB(a, c[(d + (m << 2)) >> 2] | 0, c[(d + (e << 2)) >> 2] | 0, 0, 0) | 0;
+                  if (d) g = +h[((c[(d + 16) >> 2] | 0) + 128) >> 3] * g;
+                  h[((c[(k + (e << 2)) >> 2] | 0) + (m << 3)) >> 3] = g;
+                  h[((c[j >> 2] | 0) + (e << 3)) >> 3] = g;
+                  e = (e + 1) | 0;
+                }
+                m = (m + 1) | 0;
+              }
+              a = c[47137] | 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) < (b | 0)) d = 0;
+                else break;
+                while (1) {
+                  if ((d | 0) >= (a | 0)) break;
+                  h[((c[((c[((c[o >> 2] | 0) + 168) >> 2] | 0) + (e << 2)) >> 2] | 0) + (d << 3)) >> 3] = 0.0;
+                  d = (d + 1) | 0;
+                }
+                e = (e + 1) | 0;
+              }
+              i = 0;
+              while (1) {
+                d = c[((c[((c[o >> 2] | 0) + 152) >> 2] | 0) + (i << 2)) >> 2] | 0;
+                if (!d) break;
+                a = (d + 16) | 0;
+                d = 0;
+                while (1) {
+                  if ((d | 0) >= (b | 0)) break;
+                  a: do
+                    if ((i | 0) != (d | 0)) {
+                      g = +tn(
+                        c[((c[a >> 2] | 0) + 132) >> 2] | 0,
+                        c[
+                          ((c[((c[((c[((c[o >> 2] | 0) + 152) >> 2] | 0) + (d << 2)) >> 2] | 0) + 16) >> 2] | 0) +
+                            132) >>
+                            2
+                        ] | 0,
+                        n
+                      );
+                      f = c[47137] | 0;
+                      g = 1.0 / g;
+                      e = 0;
+                      while (1) {
+                        if ((e | 0) >= (f | 0)) break a;
+                        m = c[o >> 2] | 0;
+                        r = +h[(n + (e << 3)) >> 3];
+                        r =
+                          (r - +h[((c[((c[(m + 160) >> 2] | 0) + (i << 2)) >> 2] | 0) + (d << 3)) >> 3] * r * g) *
+                          +h[((c[((c[(m + 164) >> 2] | 0) + (i << 2)) >> 2] | 0) + (d << 3)) >> 3];
+                        h[
+                          ((c[((c[((c[(m + 172) >> 2] | 0) + (i << 2)) >> 2] | 0) + (d << 2)) >> 2] | 0) + (e << 3)) >>
+                            3
+                        ] = r;
+                        m = ((c[((c[(m + 168) >> 2] | 0) + (i << 2)) >> 2] | 0) + (e << 3)) | 0;
+                        h[m >> 3] = +h[m >> 3] + r;
+                        e = (e + 1) | 0;
+                      }
+                    }
+                  while (0);
+                  d = (d + 1) | 0;
+                }
+                i = (i + 1) | 0;
+              }
+              if (0) {
+                o = c[15712] | 0;
+                h[p >> 3] = +UO();
+                w4(o, 90267, p) | 0;
+              }
+              l = q;
+              return;
+            }
+            function Kn(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0;
+              i = l;
+              l = (l + 32) | 0;
+              g = (i + 24) | 0;
+              f = (i + 8) | 0;
+              e = i;
+              j = +h[23294];
+              h[23216] = j * j;
+              while (1) {
+                d = Ln(a, b) | 0;
+                if (!d) break;
+                Mn(a, b, d);
+              }
+              if (!0) b = (a + 16) | 0;
+              else {
+                d = c[15712] | 0;
+                h[e >> 3] = +Nn(a, b);
+                w4(d, 90277, e) | 0;
+                b = (a + 16) | 0;
+                k = c[((c[b >> 2] | 0) + 156) >> 2] | 0;
+                e = (k | 0) == (c[47136] | 0) ? 90291 : 195059;
+                j = +UO();
+                c[f >> 2] = k;
+                c[(f + 4) >> 2] = e;
+                h[(f + 8) >> 3] = j;
+                w4(d, 90293, f) | 0;
+              }
+              b = c[((c[b >> 2] | 0) + 156) >> 2] | 0;
+              if ((b | 0) == (c[47136] | 0)) {
+                k = KB(a) | 0;
+                c[g >> 2] = b;
+                c[(g + 4) >> 2] = k;
+                gA(0, 90320, g) | 0;
+              }
+              l = i;
+              return;
+            }
+            function Ln(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var e = 0.0,
+                f = 0,
+                g = 0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0.0;
+              r = l;
+              l = (l + 16) | 0;
+              q = r;
+              o = ((c[46799] | 0) + 1) | 0;
+              c[46799] = o;
+              a = c[(a + 16) >> 2] | 0;
+              if ((c[(a + 156) >> 2] | 0) < (c[47136] | 0)) {
+                m = c[47137] | 0;
+                n = (a + 152) | 0;
+                k = (a + 168) | 0;
+                a = 0;
+                e = 0.0;
+                j = 0;
+                while (1) {
+                  if ((j | 0) >= (b | 0)) break;
+                  g = c[((c[n >> 2] | 0) + (j << 2)) >> 2] | 0;
+                  if ((d[((c[(g + 16) >> 2] | 0) + 119) >> 0] | 0) <= 1) {
+                    i = 0.0;
+                    f = 0;
+                    while (1) {
+                      if ((f | 0) >= (m | 0)) break;
+                      s = +h[((c[((c[k >> 2] | 0) + (j << 2)) >> 2] | 0) + (f << 3)) >> 3];
+                      i = s * s + i;
+                      f = (f + 1) | 0;
+                    }
+                    if (i > e) {
+                      a = g;
+                      e = i;
+                    }
+                  }
+                  j = (j + 1) | 0;
+                }
+                if (!(e < +h[23216])) {
+                  if (
+                    (0 != 0) & (((o | 0) % 100 | 0 | 0) == 0)
+                      ? ((p = c[15712] | 0),
+                        (h[q >> 3] = +C(+e)),
+                        w4(p, 90371, q) | 0,
+                        ((c[46799] | 0) % 1e3 | 0 | 0) == 0)
+                      : 0
+                  )
+                    E6(10, p) | 0;
+                } else a = 0;
+              } else a = 0;
+              l = r;
+              return a | 0;
+            }
+            function Mn(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              o = l;
+              l = (l + 16) | 0;
+              n = o;
+              k = (d + 16) | 0;
+              m = c[((c[k >> 2] | 0) + 120) >> 2] | 0;
+              f = c[46798] | 0;
+              if (!f) {
+                g = c[47137] | 0;
+                g = KK(O(g << 3, g) | 0) | 0;
+              } else {
+                g = c[47137] | 0;
+                g = MK(f, O(g << 3, g) | 0) | 0;
+              }
+              c[46798] = g;
+              On(a, b, m, g);
+              i = c[47137] | 0;
+              j = (a + 16) | 0;
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (i | 0)) break;
+                h[(185736 + (f << 3)) >> 3] =
+                  -+h[((c[((c[((c[j >> 2] | 0) + 168) >> 2] | 0) + (m << 2)) >> 2] | 0) + (f << 3)) >> 3];
+                f = (f + 1) | 0;
+              }
+              Xu(g, 185816, 185736, i);
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (c[47137] | 0)) break;
+                e = +h[23296];
+                e = (1.0 - e) * 2.0 * +B5() + e;
+                i = (185816 + (f << 3)) | 0;
+                e = e * +h[i >> 3];
+                h[i >> 3] = e;
+                i = ((c[((c[k >> 2] | 0) + 132) >> 2] | 0) + (f << 3)) | 0;
+                h[i >> 3] = +h[i >> 3] + e;
+                f = (f + 1) | 0;
+              }
+              k = ((c[j >> 2] | 0) + 156) | 0;
+              c[k >> 2] = (c[k >> 2] | 0) + 1;
+              Pn(a, b, m);
+              if (rP() | 0) {
+                g = c[47137] | 0;
+                e = 0.0;
+                f = 0;
+                while (1) {
+                  if ((f | 0) >= (g | 0)) break;
+                  e = +B(+(+h[(185816 + (f << 3)) >> 3])) + e;
+                  f = (f + 1) | 0;
+                }
+                e = +C(+e);
+                m = c[15712] | 0;
+                c[n >> 2] = KB(d) | 0;
+                h[(n + 8) >> 3] = e;
+                w4(m, 90362, n) | 0;
+              }
+              l = o;
+              return;
+            }
+            function Nn(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0.0;
+              q = (b + -1) | 0;
+              n = (a + 16) | 0;
+              o = c[47137] | 0;
+              g = 0;
+              d = 0.0;
+              a: while (1) {
+                if ((g | 0) >= (q | 0)) break;
+                m = c[n >> 2] | 0;
+                p = c[(m + 152) >> 2] | 0;
+                j = (g + 1) | 0;
+                k = ((c[(p + (g << 2)) >> 2] | 0) + 16) | 0;
+                l = (m + 164) | 0;
+                m = (m + 160) | 0;
+                i = j;
+                while (1) {
+                  if ((i | 0) >= (b | 0)) {
+                    g = j;
+                    continue a;
+                  }
+                  f = ((c[(p + (i << 2)) >> 2] | 0) + 16) | 0;
+                  a = 0;
+                  e = 0.0;
+                  while (1) {
+                    if ((a | 0) >= (o | 0)) break;
+                    r =
+                      +h[((c[((c[k >> 2] | 0) + 132) >> 2] | 0) + (a << 3)) >> 3] -
+                      +h[((c[((c[f >> 2] | 0) + 132) >> 2] | 0) + (a << 3)) >> 3];
+                    a = (a + 1) | 0;
+                    e = r * r + e;
+                  }
+                  r = +h[((c[((c[m >> 2] | 0) + (g << 2)) >> 2] | 0) + (i << 3)) >> 3];
+                  r =
+                    ((+C(+e) * -2.0 + r) * r + e) * +h[((c[((c[l >> 2] | 0) + (g << 2)) >> 2] | 0) + (i << 3)) >> 3] +
+                    d;
+                  i = (i + 1) | 0;
+                  d = r;
+                }
+              }
+              return +d;
+            }
+            function On(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0,
+                r = 0.0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0;
+              x = l;
+              l = (l + 80) | 0;
+              w = x;
+              v = c[(a + 16) >> 2] | 0;
+              k = c[(v + 164) >> 2] | 0;
+              m = c[(v + 160) >> 2] | 0;
+              v = c[(v + 152) >> 2] | 0;
+              j = c[(v + (d << 2)) >> 2] | 0;
+              g = c[47137] | 0;
+              a = 0;
+              while (1) {
+                if ((a | 0) >= (g | 0)) break;
+                i = O(g, a) | 0;
+                f = 0;
+                while (1) {
+                  if ((f | 0) == (g | 0)) break;
+                  h[(e + ((i + f) << 3)) >> 3] = 0.0;
+                  f = (f + 1) | 0;
+                }
+                a = (a + 1) | 0;
+              }
+              u = c[47137] | 0;
+              t = (j + 16) | 0;
+              s = (k + (d << 2)) | 0;
+              k = (m + (d << 2)) | 0;
+              j = 0;
+              while (1) {
+                if ((j | 0) >= (b | 0)) break;
+                a: do
+                  if ((j | 0) != (d | 0)) {
+                    f = ((c[(v + (j << 2)) >> 2] | 0) + 16) | 0;
+                    r = 0.0;
+                    a = 0;
+                    while (1) {
+                      if ((a | 0) >= (u | 0)) break;
+                      q =
+                        +h[((c[((c[t >> 2] | 0) + 132) >> 2] | 0) + (a << 3)) >> 3] -
+                        +h[((c[((c[f >> 2] | 0) + 132) >> 2] | 0) + (a << 3)) >> 3];
+                      h[(w + (a << 3)) >> 3] = q;
+                      r = q * q + r;
+                      a = (a + 1) | 0;
+                    }
+                    n = 1.0 / +sn(r);
+                    i = 0;
+                    while (1) {
+                      if ((i | 0) >= (u | 0)) break a;
+                      f = ((c[s >> 2] | 0) + (j << 3)) | 0;
+                      g = ((c[k >> 2] | 0) + (j << 3)) | 0;
+                      o = +h[(w + (i << 3)) >> 3];
+                      a = 0;
+                      while (1) {
+                        p = +h[f >> 3];
+                        q = +h[g >> 3];
+                        if ((a | 0) == (i | 0)) break;
+                        m = (e + (((O(u, a) | 0) + i) << 3)) | 0;
+                        h[m >> 3] = +h[m >> 3] + p * n * q * o * +h[(w + (a << 3)) >> 3];
+                        a = (a + 1) | 0;
+                      }
+                      m = (e + (((O(u, i) | 0) + i) << 3)) | 0;
+                      h[m >> 3] = (1.0 - q * n * (r - o * o)) * p + +h[m >> 3];
+                      i = (i + 1) | 0;
+                    }
+                  }
+                while (0);
+                j = (j + 1) | 0;
+              }
+              f = c[47137] | 0;
+              i = 1;
+              while (1) {
+                if ((i | 0) >= (f | 0)) break;
+                g = O(f, i) | 0;
+                a = 0;
+                while (1) {
+                  if ((a | 0) == (i | 0)) break;
+                  h[(e + ((g + a) << 3)) >> 3] = +h[(e + (((O(f, a) | 0) + i) << 3)) >> 3];
+                  a = (a + 1) | 0;
+                }
+                i = (i + 1) | 0;
+              }
+              l = x;
+              return;
+            }
+            function Pn(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0.0,
+                q = 0,
+                r = 0,
+                s = 0;
+              m = l;
+              l = (l + 80) | 0;
+              k = m;
+              j = (a + 16) | 0;
+              f = c[j >> 2] | 0;
+              g = c[((c[(f + 152) >> 2] | 0) + (d << 2)) >> 2] | 0;
+              e = c[47137] | 0;
+              f = (f + 168) | 0;
+              a = 0;
+              while (1) {
+                if ((a | 0) >= (e | 0)) break;
+                h[((c[((c[f >> 2] | 0) + (d << 2)) >> 2] | 0) + (a << 3)) >> 3] = 0.0;
+                a = (a + 1) | 0;
+              }
+              f = (g + 16) | 0;
+              a = 0;
+              while (1) {
+                if ((a | 0) >= (b | 0)) break;
+                a: do
+                  if ((a | 0) != (d | 0)) {
+                    i = +tn(
+                      c[((c[f >> 2] | 0) + 132) >> 2] | 0,
+                      c[
+                        ((c[((c[((c[((c[j >> 2] | 0) + 152) >> 2] | 0) + (a << 2)) >> 2] | 0) + 16) >> 2] | 0) + 132) >>
+                          2
+                      ] | 0,
+                      k
+                    );
+                    g = c[47137] | 0;
+                    i = 1.0 / i;
+                    e = 0;
+                    while (1) {
+                      if ((e | 0) >= (g | 0)) break a;
+                      n = c[j >> 2] | 0;
+                      q = c[(n + 172) >> 2] | 0;
+                      r = ((c[((c[(q + (d << 2)) >> 2] | 0) + (a << 2)) >> 2] | 0) + (e << 3)) | 0;
+                      o = +h[(k + (e << 3)) >> 3];
+                      o =
+                        (o - +h[((c[((c[(n + 160) >> 2] | 0) + (d << 2)) >> 2] | 0) + (a << 3)) >> 3] * o * i) *
+                        +h[((c[((c[(n + 164) >> 2] | 0) + (d << 2)) >> 2] | 0) + (a << 3)) >> 3];
+                      h[r >> 3] = o;
+                      n = c[(n + 168) >> 2] | 0;
+                      s = ((c[(n + (d << 2)) >> 2] | 0) + (e << 3)) | 0;
+                      h[s >> 3] = +h[s >> 3] + o;
+                      q = ((c[((c[(q + (a << 2)) >> 2] | 0) + (d << 2)) >> 2] | 0) + (e << 3)) | 0;
+                      o = +h[q >> 3];
+                      p = -+h[r >> 3];
+                      h[q >> 3] = p;
+                      n = ((c[(n + (a << 2)) >> 2] | 0) + (e << 3)) | 0;
+                      h[n >> 3] = p - o + +h[n >> 3];
+                      e = (e + 1) | 0;
+                    }
+                  }
+                while (0);
+                a = (a + 1) | 0;
+              }
+              l = m;
+              return;
+            }
+            function Qn(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0;
+              d = (a + 16) | 0;
+              g = c[46800] | 0;
+              b = c[((c[d >> 2] | 0) + 124) >> 2] | 0;
+              while (1) {
+                if ((b | 0) <= 0) break;
+                i = (((b + -1) | 0) / 2) | 0;
+                j = (g + (i << 2)) | 0;
+                e = c[j >> 2] | 0;
+                f = (e + 16) | 0;
+                if (+h[((c[f >> 2] | 0) + 136) >> 3] <= +h[((c[d >> 2] | 0) + 136) >> 3]) break;
+                c[j >> 2] = a;
+                c[((c[d >> 2] | 0) + 124) >> 2] = i;
+                c[(g + (b << 2)) >> 2] = e;
+                c[((c[f >> 2] | 0) + 124) >> 2] = b;
+                b = i;
+              }
+              return;
+            }
+            function Rn(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              i = (a + 16) | 0;
+              j = c[46801] | 0;
+              k = c[46800] | 0;
+              g = c[((c[i >> 2] | 0) + 124) >> 2] | 0;
+              while (1) {
+                e = (g << 1) | 1;
+                if ((e | 0) >= (j | 0)) break;
+                d = (e + 1) | 0;
+                if ((d | 0) < (j | 0)) {
+                  f = c[(k + (d << 2)) >> 2] | 0;
+                  b = c[(k + (e << 2)) >> 2] | 0;
+                  if (+h[((c[(f + 16) >> 2] | 0) + 136) >> 3] < +h[((c[(b + 16) >> 2] | 0) + 136) >> 3]) {
+                    e = d;
+                    b = f;
+                  } else l = 6;
+                } else {
+                  b = c[(k + (e << 2)) >> 2] | 0;
+                  l = 6;
+                }
+                if ((l | 0) == 6) l = 0;
+                d = (b + 16) | 0;
+                if (+h[((c[i >> 2] | 0) + 136) >> 3] <= +h[((c[d >> 2] | 0) + 136) >> 3]) break;
+                c[(k + (e << 2)) >> 2] = a;
+                c[((c[i >> 2] | 0) + 124) >> 2] = e;
+                c[(k + (g << 2)) >> 2] = b;
+                c[((c[d >> 2] | 0) + 124) >> 2] = g;
+                g = e;
+              }
+              return;
+            }
+            function Sn(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = ((c[(a + 16) >> 2] | 0) + 124) | 0;
+              if ((c[b >> 2] | 0) >= 0) qa(90377, 90397, 643, 90405);
+              d = c[46801] | 0;
+              c[46801] = d + 1;
+              c[b >> 2] = d;
+              c[((c[46800] | 0) + (d << 2)) >> 2] = a;
+              if ((d | 0) > 0) Qn(a);
+              return;
+            }
+            function Tn() {
+              var a = 0,
+                b = 0,
+                d = 0,
+                e = 0;
+              b = c[46801] | 0;
+              if (!b) a = 0;
+              else {
+                e = c[46800] | 0;
+                a = c[e >> 2] | 0;
+                d = (b + -1) | 0;
+                c[46801] = d;
+                d = c[(e + (d << 2)) >> 2] | 0;
+                c[e >> 2] = d;
+                c[((c[(d + 16) >> 2] | 0) + 124) >> 2] = 0;
+                if ((b | 0) > 2) Rn(d);
+                c[((c[(a + 16) >> 2] | 0) + 124) >> 2] = -1;
+              }
+              return a | 0;
+            }
+            function Un(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              e = l;
+              l = (l + 16) | 0;
+              d = e;
+              c[46800] = JK(((b << 2) + 4) | 0) | 0;
+              if (0) {
+                U4(90419, 28, 1, c[15712] | 0) | 0;
+                TO();
+              }
+              b = jC(a) | 0;
+              while (1) {
+                if (!b) break;
+                Vn(a, b);
+                b = kC(a, b) | 0;
+              }
+              if (0) {
+                a = c[15712] | 0;
+                h[d >> 3] = +UO();
+                w4(a, 90267, d) | 0;
+              }
+              U1(c[46800] | 0);
+              l = e;
+              return;
+            }
+            function Vn(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              e = c[((c[(a + 16) >> 2] | 0) + 152) >> 2] | 0;
+              f = +h[23295];
+              d = 0;
+              while (1) {
+                g = c[(e + (d << 2)) >> 2] | 0;
+                if (!g) break;
+                h[((c[(g + 16) >> 2] | 0) + 136) >> 3] = f;
+                d = (d + 1) | 0;
+              }
+              c[46802] = b;
+              k = c[(b + 16) >> 2] | 0;
+              h[(k + 136) >> 3] = 0.0;
+              c[(k + 128) >> 2] = 0;
+              Sn(b);
+              a: while (1) {
+                k = Tn() | 0;
+                if (!k) break;
+                d = c[46802] | 0;
+                j = (k + 16) | 0;
+                if ((k | 0) != (d | 0)) Wn(a, d, k, +h[((c[j >> 2] | 0) + 136) >> 3]);
+                i = aB(a, k) | 0;
+                while (1) {
+                  if (!i) continue a;
+                  d = c[i >> 2] & 3;
+                  b = c[(((d | 0) == 3 ? i : (i + 48) | 0) + 40) >> 2] | 0;
+                  if ((b | 0) == (k | 0)) b = c[(((d | 0) == 2 ? i : (i + -48) | 0) + 40) >> 2] | 0;
+                  d = c[j >> 2] | 0;
+                  f = +h[((c[(i + 16) >> 2] | 0) + 136) >> 3] + +h[(d + 136) >> 3];
+                  e = c[(b + 16) >> 2] | 0;
+                  g = (e + 136) | 0;
+                  do
+                    if (+h[g >> 3] > f) {
+                      h[g >> 3] = f;
+                      if ((c[(e + 124) >> 2] | 0) > -1) {
+                        Qn(b);
+                        break;
+                      } else {
+                        c[(e + 128) >> 2] = (c[(d + 128) >> 2] | 0) + 1;
+                        Sn(b);
+                        break;
+                      }
+                    }
+                  while (0);
+                  i = bB(a, i, k) | 0;
+                }
+              }
+              return;
+            }
+            function Wn(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = +e;
+              b = c[((c[(b + 16) >> 2] | 0) + 120) >> 2] | 0;
+              d = c[((c[(d + 16) >> 2] | 0) + 120) >> 2] | 0;
+              a = c[((c[(a + 16) >> 2] | 0) + 160) >> 2] | 0;
+              h[((c[(a + (d << 2)) >> 2] | 0) + (b << 3)) >> 3] = e;
+              h[((c[(a + (b << 2)) >> 2] | 0) + (d << 3)) >> 3] = e;
+              return;
+            }
+            function Xn(a) {
+              a = a | 0;
+              oQ(a, 2);
+              b[((c[(a + 16) >> 2] | 0) + 176) >> 1] = 2;
+              c[47137] = 2;
+              Yn(a);
+              return;
+            }
+            function Yn(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              b = tB(a) | 0;
+              e = JK((b * 56) | 0) | 0;
+              b = JK(((b << 2) + 4) | 0) | 0;
+              f = (a + 16) | 0;
+              c[((c[f >> 2] | 0) + 152) >> 2] = b;
+              b = jC(a) | 0;
+              d = 0;
+              while (1) {
+                if (!b) break;
+                Zl(b);
+                c[((c[(b + 16) >> 2] | 0) + 112) >> 2] = e + ((d * 56) | 0);
+                c[((c[((c[f >> 2] | 0) + 152) >> 2] | 0) + (d << 2)) >> 2] = b;
+                b = kC(a, b) | 0;
+                d = (d + 1) | 0;
+              }
+              d = jC(a) | 0;
+              while (1) {
+                if (!d) break;
+                b = XA(a, d) | 0;
+                while (1) {
+                  if (!b) break;
+                  Zn(b);
+                  b = ZA(a, b) | 0;
+                }
+                d = kC(a, d) | 0;
+              }
+              return;
+            }
+            function Zn(a) {
+              a = a | 0;
+              var b = 0.0;
+              TC(a, 137460, 176, 1) | 0;
+              tP(a) | 0;
+              b = +_O(a, c[47174] | 0, 1.0, 0.0);
+              h[((c[(a + 16) >> 2] | 0) + 128) >> 3] = b;
+              return;
+            }
+            function _n(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0;
+              u = l;
+              l = (l + 80) | 0;
+              m = (u + 32) | 0;
+              i = (u + 24) | 0;
+              g = (u + 16) | 0;
+              j = u;
+              t = (u + 72) | 0;
+              p = (u + 40) | 0;
+              if (tB(b) | 0) {
+                Xn(b);
+                f = QA(b, 95738) | 0;
+                if (f)
+                  if (a[f >> 0] | 0) {
+                    d = tC(b, f, 0) | 0;
+                    if (!d) {
+                      c[g >> 2] = f;
+                      gA(0, 90448, g) | 0;
+                      gA(3, 90488, i) | 0;
+                      d = 0;
+                      s = 1;
+                    } else s = 0;
+                  } else {
+                    d = 0;
+                    s = 1;
+                  }
+                else {
+                  d = 0;
+                  s = 0;
+                }
+                n = GA(b, 1, 95738, 0) | 0;
+                o = (n | 0) != 0;
+                f = QA(b, 140742) | 0;
+                if (
+                  (f | 0 ? a[f >> 0] | 0 : 0)
+                    ? ((k = (j + 8) | 0), (c[m >> 2] = j), (c[(m + 4) >> 2] = k), (b5(f, 105503, m) | 0) == 1)
+                    : 0
+                )
+                  h[k >> 3] = +h[j >> 3];
+                if (tB(b) | 0) {
+                  m = DG(b, t, 0) | 0;
+                  if ((c[t >> 2] | 0) == 1) {
+                    g = (d | 0) != 0;
+                    do
+                      if (g) e = d;
+                      else {
+                        if (o ? ((e = $n(b, n) | 0), e | 0) : 0) break;
+                        e = 0;
+                      }
+                    while (0);
+                    f = Zu(b, e) | 0;
+                    if (!(((e | 0) != 0) | (o ^ 1))) KA(f, n, 142463) | 0;
+                    r = ((jC(b) | 0) + 16) | 0;
+                    U1(c[((c[r >> 2] | 0) + 112) >> 2] | 0);
+                    c[((c[r >> 2] | 0) + 112) >> 2] = 0;
+                    or(b) | 0;
+                    fn(b);
+                    d = ((s | 0) == 0) | g ? d : f;
+                  } else {
+                    kH(b, 2, 8, p) | 0;
+                    c[(p + 12) >> 2] = 0;
+                    k = (s | 0) == 0;
+                    j = 0;
+                    while (1) {
+                      if ((j | 0) >= (c[t >> 2] | 0)) break;
+                      g = c[(m + (j << 2)) >> 2] | 0;
+                      e = (d | 0) != 0;
+                      if (e ? (HC(g, d) | 0) != 0 : 0) f = d;
+                      else r = 23;
+                      do
+                        if ((r | 0) == 23) {
+                          r = 0;
+                          if (o ? ((q = $n(g, n) | 0), q | 0) : 0) {
+                            f = q;
+                            break;
+                          }
+                          f = 0;
+                        }
+                      while (0);
+                      KG(g) | 0;
+                      i = Zu(g, f) | 0;
+                      d = k | e ? d : i;
+                      if (o ? ((f | 0) == 0) | ((f | 0) == (d | 0)) : 0) KA(i, n, 142463) | 0;
+                      or(g) | 0;
+                      j = (j + 1) | 0;
+                    }
+                    r = ((jC(b) | 0) + 16) | 0;
+                    U1(c[((c[r >> 2] | 0) + 112) >> 2] | 0);
+                    c[((c[r >> 2] | 0) + 112) >> 2] = 0;
+                    jH(c[t >> 2] | 0, m, b, p) | 0;
+                    fn(b);
+                  }
+                  e = 0;
+                  while (1) {
+                    if ((e | 0) >= (c[t >> 2] | 0)) break;
+                    wC(b, c[(m + (e << 2)) >> 2] | 0) | 0;
+                    e = (e + 1) | 0;
+                  }
+                  U1(m);
+                }
+                if (s | 0) SA(b, 95738, KB(d) | 0) | 0;
+                tM(b);
+              }
+              l = u;
+              return;
+            }
+            function $n(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0;
+              c = jC(a) | 0;
+              while (1) {
+                if (!c) {
+                  c = 0;
+                  break;
+                }
+                if (((dP(RA(c, b) | 0) | 0) << 24) >> 24) break;
+                c = kC(a, c) | 0;
+              }
+              return c | 0;
+            }
+            function ao(a) {
+              a = a | 0;
+              var b = 0,
+                c = 0;
+              b = jC(a) | 0;
+              if (b | 0) {
+                while (1) {
+                  if (!b) break;
+                  c = XA(a, b) | 0;
+                  while (1) {
+                    if (!c) break;
+                    YP(c);
+                    c = ZA(a, c) | 0;
+                  }
+                  WP(b);
+                  b = kC(a, b) | 0;
+                }
+                bo(a);
+              }
+              return;
+            }
+            function bo(a) {
+              a = a | 0;
+              U1(c[((c[(a + 16) >> 2] | 0) + 152) >> 2] | 0);
+              if ((yC(a) | 0) != (a | 0)) ZC(a, 0, 137483);
+              return;
+            }
+            function co(a) {
+              a = a | 0;
+              eo(a);
+              if (!((tB(a) | 0) == 0 ? !(c[((c[(a + 16) >> 2] | 0) + 180) >> 2] | 0) : 0)) {
+                nv(a);
+                tM(a);
+              }
+              return;
+            }
+            function eo(a) {
+              a = a | 0;
+              c[47147] = GA(a, 1, 108230, 108236) | 0;
+              oQ(a, 2);
+              b[((c[(a + 16) >> 2] | 0) + 176) >> 1] = 2;
+              c[47137] = 2;
+              fo(a, 0);
+              go(a);
+              return;
+            }
+            function fo(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 16) | 0;
+              g = i;
+              h = (b | 0) == 0;
+              if (h) {
+                jo(g);
+                b = g;
+              }
+              d = OD(a) | 0;
+              while (1) {
+                if (!d) break;
+                if (!(Q2(KB(d) | 0, 108006, 7) | 0)) {
+                  TC(d, 137483, 280, 1) | 0;
+                  ko(b, d);
+                  fo(d, 0);
+                } else fo(d, b);
+                d = PD(d) | 0;
+              }
+              if (
+                h ? ((e = c[(g + 8) >> 2] | 0), (f = (a + 16) | 0), (c[((c[f >> 2] | 0) + 180) >> 2] = e), e | 0) : 0
+              ) {
+                h = MK(c[g >> 2] | 0, ((e << 2) + 4) | 0) | 0;
+                c[((c[f >> 2] | 0) + 184) >> 2] = h;
+              }
+              l = i;
+              return;
+            }
+            function go(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              f = JK((tB(a) | 0) << 2) | 0;
+              b = JK((((tB(a) | 0) << 2) + 4) | 0) | 0;
+              g = (a + 16) | 0;
+              c[((c[g >> 2] | 0) + 152) >> 2] = b;
+              b = jC(a) | 0;
+              d = 0;
+              while (1) {
+                if (!b) break;
+                TC(b, 137447, 304, 1) | 0;
+                c[((c[(b + 16) >> 2] | 0) + 112) >> 2] = f + (d << 2);
+                c[((c[((c[g >> 2] | 0) + 152) >> 2] | 0) + (d << 2)) >> 2] = b;
+                ho(b);
+                e = XA(a, b) | 0;
+                while (1) {
+                  if (!e) break;
+                  io(e);
+                  e = ZA(a, e) | 0;
+                }
+                b = kC(a, b) | 0;
+                d = (d + 1) | 0;
+              }
+              return;
+            }
+            function ho(a) {
+              a = a | 0;
+              SA(a, 108230, 108236) | 0;
+              return;
+            }
+            function io(a) {
+              a = a | 0;
+              TC(a, 137460, 304, 1) | 0;
+              return;
+            }
+            function jo(a) {
+              a = a | 0;
+              c[a >> 2] = 0;
+              c[(a + 4) >> 2] = 0;
+              c[(a + 8) >> 2] = 0;
+              return;
+            }
+            function ko(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              g = (a + 8) | 0;
+              d = ((c[g >> 2] | 0) + 1) | 0;
+              c[g >> 2] = d;
+              e = (a + 4) | 0;
+              h = c[e >> 2] | 0;
+              f = (h + 10) | 0;
+              if ((d | 0) < (h | 0)) a = c[a >> 2] | 0;
+              else {
+                c[e >> 2] = f;
+                d = MK(c[a >> 2] | 0, f << 2) | 0;
+                c[a >> 2] = d;
+                a = d;
+                d = c[g >> 2] | 0;
+              }
+              c[(a + (d << 2)) >> 2] = b;
+              return;
+            }
+            function lo(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = jC(a) | 0;
+              if (b | 0) {
+                U1(c[((c[(b + 16) >> 2] | 0) + 112) >> 2] | 0);
+                while (1) {
+                  if (!b) break;
+                  d = XA(a, b) | 0;
+                  while (1) {
+                    if (!d) break;
+                    YP(d);
+                    d = ZA(a, d) | 0;
+                  }
+                  WP(b);
+                  b = kC(a, b) | 0;
+                }
+                mo(a);
+              }
+              return;
+            }
+            function mo(a) {
+              a = a | 0;
+              U1(c[((c[(a + 16) >> 2] | 0) + 152) >> 2] | 0);
+              if ((yC(a) | 0) != (a | 0)) ZC(a, 0, 137483);
+              return;
+            }
+            function no(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              oo(a);
+              po(a, 0);
+              qo(a, 0);
+              ro(a, 0);
+              d = c[(a + 16) >> 2] | 0;
+              if (!(c[((c[(d + 8) >> 2] | 0) + 84) >> 2] | 0)) {
+                d = b[(d + 136) >> 1] & 14;
+                if ((d << 16) >> 16) Wm(a, d & 65535) | 0;
+              } else {
+                d = jC(a) | 0;
+                while (1) {
+                  if (!d) break;
+                  f = c[(d + 16) >> 2] | 0;
+                  e = c[(f + 132) >> 2] | 0;
+                  h[e >> 3] = +h[(f + 16) >> 3] * 0.013888888888888888;
+                  h[(e + 8) >> 3] = +h[(f + 24) >> 3] * 0.013888888888888888;
+                  d = kC(a, d) | 0;
+                }
+                Zm(a, 1);
+              }
+              tM(a);
+              return;
+            }
+            function oo(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0;
+              oQ(a, 2);
+              b[((c[(a + 16) >> 2] | 0) + 176) >> 1] = 2;
+              c[47137] = 2;
+              d = jC(a) | 0;
+              while (1) {
+                if (!d) break;
+                Zl(d);
+                d = kC(a, d) | 0;
+              }
+              e = jC(a) | 0;
+              while (1) {
+                if (!e) break;
+                d = XA(a, e) | 0;
+                while (1) {
+                  if (!d) break;
+                  TC(d, 137460, 176, 1) | 0;
+                  tP(d) | 0;
+                  d = ZA(a, d) | 0;
+                }
+                e = kC(a, e) | 0;
+              }
+              return;
+            }
+            function po(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 16) | 0;
+              g = i;
+              h = (b | 0) == 0;
+              if (h) {
+                wo(g);
+                b = g;
+              }
+              d = OD(a) | 0;
+              while (1) {
+                if (!d) break;
+                if (!(Q2(KB(d) | 0, 108006, 7) | 0)) {
+                  TC(d, 137483, 280, 1) | 0;
+                  uK(d);
+                  xo(b, d);
+                  po(d, 0);
+                } else po(d, b);
+                d = PD(d) | 0;
+              }
+              if (
+                h ? ((e = c[(g + 8) >> 2] | 0), (f = (a + 16) | 0), (c[((c[f >> 2] | 0) + 180) >> 2] = e), e | 0) : 0
+              ) {
+                h = MK(c[g >> 2] | 0, ((e << 2) + 4) | 0) | 0;
+                c[((c[f >> 2] | 0) + 184) >> 2] = h;
+              }
+              l = i;
+              return;
+            }
+            function qo(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                m = 0.0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                O = 0,
+                P = 0,
+                Q = 0;
+              Q = l;
+              l = (l + 448) | 0;
+              G = (Q + 400) | 0;
+              F = (Q + 384) | 0;
+              P = (Q + 344) | 0;
+              O = (Q + 304) | 0;
+              N = (Q + 248) | 0;
+              D = (Q + 192) | 0;
+              x = (Q + 152) | 0;
+              y = (Q + 96) | 0;
+              o = (Q + 72) | 0;
+              d = (Q + 64) | 0;
+              I = (Q + 32) | 0;
+              J = Q;
+              B = (Q + 416) | 0;
+              u = (Q + 328) | 0;
+              w = (Q + 288) | 0;
+              K = (Q + 232) | 0;
+              L = (Q + 176) | 0;
+              M = (Q + 136) | 0;
+              H = (Q + 80) | 0;
+              n = c[(a + 60) >> 2] | 0;
+              if (0 > 1) {
+                so(b);
+                E = c[15712] | 0;
+                c[d >> 2] = KB(a) | 0;
+                w4(E, 90723, d) | 0;
+              }
+              E = (a + 16) | 0;
+              f = (b + 1) | 0;
+              d = 1;
+              e = 0;
+              while (1) {
+                g = c[E >> 2] | 0;
+                if ((d | 0) > (c[(g + 180) >> 2] | 0)) break;
+                C = c[((c[(g + 184) >> 2] | 0) + (d << 2)) >> 2] | 0;
+                qo(C, f);
+                d = (d + 1) | 0;
+                e = ((tB(C) | 0) + e) | 0;
+              }
+              p = ((tB(a) | 0) - e) | 0;
+              d = c[E >> 2] | 0;
+              C = ((c[(d + 180) >> 2] | 0) + p) | 0;
+              v = (C | 0) == 0;
+              if (v ? (c[(d + 12) >> 2] | 0) == 0 : 0) {
+                P = (d + 16) | 0;
+                c[P >> 2] = 0;
+                c[(P + 4) >> 2] = 0;
+                c[(P + 8) >> 2] = 0;
+                c[(P + 12) >> 2] = 0;
+                h[(d + 40) >> 3] = 18.0;
+                h[(d + 32) >> 3] = 18.0;
+              } else {
+                d = (B + 16) | 0;
+                do
+                  if ((kH(a, 4, 4, B) | 0) >>> 0 >= 3)
+                    if ((c[d >> 2] | 0) == 4 ? ((c[(B + 28) >> 2] & 2) | 0) != 0 : 0) {
+                      e = GA(n, 0, 99190, 0) | 0;
+                      d = GA(n, 1, 99190, 0) | 0;
+                      if (((e | 0) != 0) | ((d | 0) != 0)) {
+                        c[(B + 24) >> 2] = JK(C << 2) | 0;
+                        break;
+                      } else {
+                        c[o >> 2] = KB(a) | 0;
+                        gA(0, 90577, o) | 0;
+                        d = 0;
+                        e = 0;
+                        break;
+                      }
+                    } else {
+                      d = 0;
+                      e = 0;
+                    }
+                  else {
+                    c[d >> 2] = 3;
+                    d = 0;
+                    e = 0;
+                  }
+                while (0);
+                z = JK(C << 5) | 0;
+                A = JK(C << 2) | 0;
+                s = (B + 24) | 0;
+                n = (e | 0) != 0;
+                r = 0;
+                g = 1;
+                while (1) {
+                  f = c[E >> 2] | 0;
+                  if ((g | 0) > (c[(f + 180) >> 2] | 0)) break;
+                  f = c[((c[(f + 184) >> 2] | 0) + (g << 2)) >> 2] | 0;
+                  t = (z + (r << 5)) | 0;
+                  q = ((c[(f + 16) >> 2] | 0) + 16) | 0;
+                  c[t >> 2] = c[q >> 2];
+                  c[(t + 4) >> 2] = c[(q + 4) >> 2];
+                  c[(t + 8) >> 2] = c[(q + 8) >> 2];
+                  c[(t + 12) >> 2] = c[(q + 12) >> 2];
+                  c[(t + 16) >> 2] = c[(q + 16) >> 2];
+                  c[(t + 20) >> 2] = c[(q + 20) >> 2];
+                  c[(t + 24) >> 2] = c[(q + 24) >> 2];
+                  c[(t + 28) >> 2] = c[(q + 28) >> 2];
+                  if (n & ((c[s >> 2] | 0) != 0)) {
+                    t = ZO(f, e, 0, 0) | 0;
+                    c[((c[s >> 2] | 0) + (r << 2)) >> 2] = t;
+                  }
+                  c[(A + (r << 2)) >> 2] = f;
+                  r = (r + 1) | 0;
+                  g = (g + 1) | 0;
+                }
+                a: do
+                  if ((p | 0) > 0) {
+                    o = (I + 16) | 0;
+                    p = (I + 24) | 0;
+                    q = (d | 0) != 0;
+                    n = jC(a) | 0;
+                    e = r;
+                    while (1) {
+                      if (!n) break a;
+                      f = c[(n + 16) >> 2] | 0;
+                      g = (f + 112) | 0;
+                      if (!(c[g >> 2] | 0)) {
+                        c[g >> 2] = a;
+                        c[I >> 2] = 0;
+                        c[(I + 4) >> 2] = 0;
+                        c[(I + 8) >> 2] = 0;
+                        c[(I + 12) >> 2] = 0;
+                        h[o >> 3] = +h[(f + 96) >> 3] + +h[(f + 88) >> 3];
+                        h[p >> 3] = +h[(f + 80) >> 3];
+                        t = (z + (e << 5)) | 0;
+                        c[t >> 2] = c[I >> 2];
+                        c[(t + 4) >> 2] = c[(I + 4) >> 2];
+                        c[(t + 8) >> 2] = c[(I + 8) >> 2];
+                        c[(t + 12) >> 2] = c[(I + 12) >> 2];
+                        c[(t + 16) >> 2] = c[(I + 16) >> 2];
+                        c[(t + 20) >> 2] = c[(I + 20) >> 2];
+                        c[(t + 24) >> 2] = c[(I + 24) >> 2];
+                        c[(t + 28) >> 2] = c[(I + 28) >> 2];
+                        if (q & ((c[s >> 2] | 0) != 0)) {
+                          t = ZO(n, d, 0, 0) | 0;
+                          c[((c[s >> 2] | 0) + (e << 2)) >> 2] = t;
+                        }
+                        c[(A + (e << 2)) >> 2] = n;
+                        e = (e + 1) | 0;
+                      }
+                      n = kC(a, n) | 0;
+                    }
+                  }
+                while (0);
+                t = dH(C, z, B) | 0;
+                d = c[s >> 2] | 0;
+                if (d | 0) U1(d);
+                to(J, 2147483647.0, 2147483647.0);
+                s = (J + 16) | 0;
+                to(u, -2147483647.0, -2147483647.0);
+                c[s >> 2] = c[u >> 2];
+                c[(s + 4) >> 2] = c[(u + 4) >> 2];
+                c[(s + 8) >> 2] = c[(u + 8) >> 2];
+                c[(s + 12) >> 2] = c[(u + 12) >> 2];
+                g = (I + 16) | 0;
+                n = (I + 8) | 0;
+                o = (I + 24) | 0;
+                p = (J + 8) | 0;
+                q = (J + 24) | 0;
+                r = c[15712] | 0;
+                d = 0;
+                while (1) {
+                  if ((d | 0) >= (C | 0)) break;
+                  j = +(c[(t + (d << 3)) >> 2] | 0);
+                  m = +(c[(t + (d << 3) + 4) >> 2] | 0);
+                  e = (z + (d << 5)) | 0;
+                  c[I >> 2] = c[e >> 2];
+                  c[(I + 4) >> 2] = c[(e + 4) >> 2];
+                  c[(I + 8) >> 2] = c[(e + 8) >> 2];
+                  c[(I + 12) >> 2] = c[(e + 12) >> 2];
+                  c[(I + 16) >> 2] = c[(e + 16) >> 2];
+                  c[(I + 20) >> 2] = c[(e + 20) >> 2];
+                  c[(I + 24) >> 2] = c[(e + 24) >> 2];
+                  c[(I + 28) >> 2] = c[(e + 28) >> 2];
+                  i = +h[I >> 3] + j;
+                  h[I >> 3] = i;
+                  j = +h[g >> 3] + j;
+                  h[g >> 3] = j;
+                  k = +h[n >> 3] + m;
+                  h[n >> 3] = k;
+                  m = +h[o >> 3] + m;
+                  h[o >> 3] = m;
+                  h[J >> 3] = +h[(+h[J >> 3] < i ? J : I) >> 3];
+                  h[p >> 3] = +h[((+h[p >> 3] < k ? J : I) + 8) >> 3];
+                  h[s >> 3] = +h[((+h[s >> 3] > j ? J : I) + 16) >> 3];
+                  h[q >> 3] = +h[((+h[q >> 3] > m ? J : I) + 24) >> 3];
+                  e = c[(A + (d << 2)) >> 2] | 0;
+                  f = (e + 16) | 0;
+                  if ((d | 0) < (c[((c[E >> 2] | 0) + 180) >> 2] | 0)) {
+                    u = ((c[f >> 2] | 0) + 16) | 0;
+                    c[u >> 2] = c[I >> 2];
+                    c[(u + 4) >> 2] = c[(I + 4) >> 2];
+                    c[(u + 8) >> 2] = c[(I + 8) >> 2];
+                    c[(u + 12) >> 2] = c[(I + 12) >> 2];
+                    c[(u + 16) >> 2] = c[(I + 16) >> 2];
+                    c[(u + 20) >> 2] = c[(I + 20) >> 2];
+                    c[(u + 24) >> 2] = c[(I + 24) >> 2];
+                    c[(u + 28) >> 2] = c[(I + 28) >> 2];
+                    if (0 > 1) {
+                      so(b);
+                      c[y >> 2] = KB(e) | 0;
+                      h[(y + 8) >> 3] = i;
+                      h[(y + 16) >> 3] = k;
+                      h[(y + 24) >> 3] = j;
+                      h[(y + 32) >> 3] = m;
+                      w4(r, 90556, y) | 0;
+                    }
+                  } else {
+                    u = ((c[f >> 2] | 0) + 16) | 0;
+                    c[F >> 2] = c[I >> 2];
+                    c[(F + 4) >> 2] = c[(I + 4) >> 2];
+                    c[(F + 8) >> 2] = c[(I + 8) >> 2];
+                    c[(F + 12) >> 2] = c[(I + 12) >> 2];
+                    c[G >> 2] = c[g >> 2];
+                    c[(G + 4) >> 2] = c[(g + 4) >> 2];
+                    c[(G + 8) >> 2] = c[(g + 8) >> 2];
+                    c[(G + 12) >> 2] = c[(g + 12) >> 2];
+                    uo(w, F, G);
+                    c[u >> 2] = c[w >> 2];
+                    c[(u + 4) >> 2] = c[(w + 4) >> 2];
+                    c[(u + 8) >> 2] = c[(w + 8) >> 2];
+                    c[(u + 12) >> 2] = c[(w + 12) >> 2];
+                    if (0 > 1) {
+                      so(b);
+                      u = KB(e) | 0;
+                      f = c[f >> 2] | 0;
+                      k = +h[(f + 16) >> 3];
+                      m = +h[(f + 24) >> 3];
+                      c[x >> 2] = u;
+                      h[(x + 8) >> 3] = k;
+                      h[(x + 16) >> 3] = m;
+                      w4(r, 90544, x) | 0;
+                    }
+                  }
+                  d = (d + 1) | 0;
+                }
+                e = c[E >> 2] | 0;
+                d = c[(e + 12) >> 2] | 0;
+                if (d | 0) {
+                  i = +h[(d + 24) >> 3];
+                  if (v) {
+                    j = +h[(d + 32) >> 3];
+                    c[J >> 2] = 0;
+                    c[(J + 4) >> 2] = 0;
+                    c[(J + 8) >> 2] = 0;
+                    c[(J + 12) >> 2] = 0;
+                    h[s >> 3] = i;
+                    h[q >> 3] = j;
+                    j = 0.0;
+                    k = i;
+                  } else {
+                    j = +h[J >> 3];
+                    k = +h[s >> 3];
+                  }
+                  m = i - (k - j);
+                  i = m * 0.5;
+                  if (m > 0.0) {
+                    h[J >> 3] = j - i;
+                    h[s >> 3] = k + i;
+                  }
+                }
+                if ((b | 0) > 0) i = +((c[(B + 8) >> 2] | 0) >>> 0) * 0.5;
+                else i = 0.0;
+                j = +h[J >> 3] - i;
+                h[J >> 3] = j;
+                k = +h[s >> 3] + i;
+                h[s >> 3] = k;
+                m = -i - +h[(e + 56) >> 3] + +h[p >> 3];
+                h[p >> 3] = m;
+                i = +h[(e + 88) >> 3] + i + +h[q >> 3];
+                h[q >> 3] = i;
+                if (0 > 1) {
+                  so(b);
+                  c[D >> 2] = KB(a) | 0;
+                  h[(D + 8) >> 3] = j;
+                  h[(D + 16) >> 3] = m;
+                  h[(D + 24) >> 3] = k;
+                  h[(D + 32) >> 3] = i;
+                  w4(r, 90556, D) | 0;
+                }
+                d = 0;
+                while (1) {
+                  if ((d | 0) >= (C | 0)) break;
+                  e = c[(A + (d << 2)) >> 2] | 0;
+                  f = (e + 16) | 0;
+                  if ((d | 0) < (c[((c[E >> 2] | 0) + 180) >> 2] | 0)) {
+                    D = ((c[f >> 2] | 0) + 16) | 0;
+                    c[I >> 2] = c[D >> 2];
+                    c[(I + 4) >> 2] = c[(D + 4) >> 2];
+                    c[(I + 8) >> 2] = c[(D + 8) >> 2];
+                    c[(I + 12) >> 2] = c[(D + 12) >> 2];
+                    c[(I + 16) >> 2] = c[(D + 16) >> 2];
+                    c[(I + 20) >> 2] = c[(D + 20) >> 2];
+                    c[(I + 24) >> 2] = c[(D + 24) >> 2];
+                    c[(I + 28) >> 2] = c[(D + 28) >> 2];
+                    c[F >> 2] = c[D >> 2];
+                    c[(F + 4) >> 2] = c[(D + 4) >> 2];
+                    c[(F + 8) >> 2] = c[(D + 8) >> 2];
+                    c[(F + 12) >> 2] = c[(D + 12) >> 2];
+                    c[G >> 2] = c[J >> 2];
+                    c[(G + 4) >> 2] = c[(J + 4) >> 2];
+                    c[(G + 8) >> 2] = c[(J + 8) >> 2];
+                    c[(G + 12) >> 2] = c[(J + 12) >> 2];
+                    vo(I, F, G);
+                    c[F >> 2] = c[g >> 2];
+                    c[(F + 4) >> 2] = c[(g + 4) >> 2];
+                    c[(F + 8) >> 2] = c[(g + 8) >> 2];
+                    c[(F + 12) >> 2] = c[(g + 12) >> 2];
+                    c[G >> 2] = c[J >> 2];
+                    c[(G + 4) >> 2] = c[(J + 4) >> 2];
+                    c[(G + 8) >> 2] = c[(J + 8) >> 2];
+                    c[(G + 12) >> 2] = c[(J + 12) >> 2];
+                    vo(K, F, G);
+                    c[g >> 2] = c[K >> 2];
+                    c[(g + 4) >> 2] = c[(K + 4) >> 2];
+                    c[(g + 8) >> 2] = c[(K + 8) >> 2];
+                    c[(g + 12) >> 2] = c[(K + 12) >> 2];
+                    D = ((c[f >> 2] | 0) + 16) | 0;
+                    c[D >> 2] = c[I >> 2];
+                    c[(D + 4) >> 2] = c[(I + 4) >> 2];
+                    c[(D + 8) >> 2] = c[(I + 8) >> 2];
+                    c[(D + 12) >> 2] = c[(I + 12) >> 2];
+                    c[(D + 16) >> 2] = c[(I + 16) >> 2];
+                    c[(D + 20) >> 2] = c[(I + 20) >> 2];
+                    c[(D + 24) >> 2] = c[(I + 24) >> 2];
+                    c[(D + 28) >> 2] = c[(I + 28) >> 2];
+                    if (0 > 1) {
+                      so(b);
+                      D = KB(e) | 0;
+                      i = +h[I >> 3];
+                      j = +h[n >> 3];
+                      k = +h[g >> 3];
+                      m = +h[o >> 3];
+                      c[N >> 2] = D;
+                      h[(N + 8) >> 3] = i;
+                      h[(N + 16) >> 3] = j;
+                      h[(N + 24) >> 3] = k;
+                      h[(N + 32) >> 3] = m;
+                      w4(r, 90556, N) | 0;
+                    }
+                  } else {
+                    D = ((c[f >> 2] | 0) + 16) | 0;
+                    c[F >> 2] = c[D >> 2];
+                    c[(F + 4) >> 2] = c[(D + 4) >> 2];
+                    c[(F + 8) >> 2] = c[(D + 8) >> 2];
+                    c[(F + 12) >> 2] = c[(D + 12) >> 2];
+                    c[G >> 2] = c[J >> 2];
+                    c[(G + 4) >> 2] = c[(J + 4) >> 2];
+                    c[(G + 8) >> 2] = c[(J + 8) >> 2];
+                    c[(G + 12) >> 2] = c[(J + 12) >> 2];
+                    vo(L, F, G);
+                    c[D >> 2] = c[L >> 2];
+                    c[(D + 4) >> 2] = c[(L + 4) >> 2];
+                    c[(D + 8) >> 2] = c[(L + 8) >> 2];
+                    c[(D + 12) >> 2] = c[(L + 12) >> 2];
+                    if (0 > 1) {
+                      so(b);
+                      D = KB(e) | 0;
+                      B = c[f >> 2] | 0;
+                      k = +h[(B + 16) >> 3];
+                      m = +h[(B + 24) >> 3];
+                      c[O >> 2] = D;
+                      h[(O + 8) >> 3] = k;
+                      h[(O + 16) >> 3] = m;
+                      w4(r, 90544, O) | 0;
+                    }
+                  }
+                  d = (d + 1) | 0;
+                }
+                c[F >> 2] = c[s >> 2];
+                c[(F + 4) >> 2] = c[(s + 4) >> 2];
+                c[(F + 8) >> 2] = c[(s + 8) >> 2];
+                c[(F + 12) >> 2] = c[(s + 12) >> 2];
+                c[G >> 2] = c[J >> 2];
+                c[(G + 4) >> 2] = c[(J + 4) >> 2];
+                c[(G + 8) >> 2] = c[(J + 8) >> 2];
+                c[(G + 12) >> 2] = c[(J + 12) >> 2];
+                vo(M, F, G);
+                c[s >> 2] = c[M >> 2];
+                c[(s + 4) >> 2] = c[(M + 4) >> 2];
+                c[(s + 8) >> 2] = c[(M + 8) >> 2];
+                c[(s + 12) >> 2] = c[(M + 12) >> 2];
+                c[F >> 2] = c[J >> 2];
+                c[(F + 4) >> 2] = c[(J + 4) >> 2];
+                c[(F + 8) >> 2] = c[(J + 8) >> 2];
+                c[(F + 12) >> 2] = c[(J + 12) >> 2];
+                c[G >> 2] = c[J >> 2];
+                c[(G + 4) >> 2] = c[(J + 4) >> 2];
+                c[(G + 8) >> 2] = c[(J + 8) >> 2];
+                c[(G + 12) >> 2] = c[(J + 12) >> 2];
+                vo(H, F, G);
+                c[J >> 2] = c[H >> 2];
+                c[(J + 4) >> 2] = c[(H + 4) >> 2];
+                c[(J + 8) >> 2] = c[(H + 8) >> 2];
+                c[(J + 12) >> 2] = c[(H + 12) >> 2];
+                O = ((c[E >> 2] | 0) + 16) | 0;
+                c[O >> 2] = c[J >> 2];
+                c[(O + 4) >> 2] = c[(J + 4) >> 2];
+                c[(O + 8) >> 2] = c[(J + 8) >> 2];
+                c[(O + 12) >> 2] = c[(J + 12) >> 2];
+                c[(O + 16) >> 2] = c[(J + 16) >> 2];
+                c[(O + 20) >> 2] = c[(J + 20) >> 2];
+                c[(O + 24) >> 2] = c[(J + 24) >> 2];
+                c[(O + 28) >> 2] = c[(J + 28) >> 2];
+                if (0 > 1) {
+                  so(b);
+                  O = KB(a) | 0;
+                  i = +h[J >> 3];
+                  j = +h[p >> 3];
+                  k = +h[s >> 3];
+                  m = +h[q >> 3];
+                  c[P >> 2] = O;
+                  h[(P + 8) >> 3] = i;
+                  h[(P + 16) >> 3] = j;
+                  h[(P + 24) >> 3] = k;
+                  h[(P + 32) >> 3] = m;
+                  w4(r, 90556, P) | 0;
+                }
+                U1(z);
+                U1(A);
+                U1(t);
+              }
+              l = Q;
+              return;
+            }
+            function ro(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0.0,
+                m = 0.0,
+                n = 0.0,
+                o = 0,
+                p = 0.0,
+                q = 0.0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0;
+              t = l;
+              l = (l + 80) | 0;
+              s = (t + 32) | 0;
+              i = (t + 8) | 0;
+              d = t;
+              r = (a + 16) | 0;
+              o = c[r >> 2] | 0;
+              p = +h[(o + 16) >> 3];
+              q = +h[(o + 24) >> 3];
+              if (0 > 1) {
+                so(b);
+                o = c[15712] | 0;
+                c[d >> 2] = KB(a) | 0;
+                w4(o, 90529, d) | 0;
+              }
+              o = (b | 0) != 0;
+              a: do
+                if (o) {
+                  d = jC(a) | 0;
+                  e = c[15712] | 0;
+                  while (1) {
+                    if (!d) break a;
+                    f = (d + 16) | 0;
+                    g = c[f >> 2] | 0;
+                    if (
+                      (c[(g + 112) >> 2] | 0) == (a | 0)
+                        ? ((u = (g + 16) | 0),
+                          (h[u >> 3] = +h[u >> 3] + p),
+                          (g = (g + 24) | 0),
+                          (h[g >> 3] = +h[g >> 3] + q),
+                          0 > 1)
+                        : 0
+                    ) {
+                      so(b);
+                      u = KB(d) | 0;
+                      g = c[f >> 2] | 0;
+                      m = +h[(g + 16) >> 3];
+                      n = +h[(g + 24) >> 3];
+                      c[i >> 2] = u;
+                      h[(i + 8) >> 3] = m;
+                      h[(i + 16) >> 3] = n;
+                      w4(e, 90544, i) | 0;
+                    }
+                    d = kC(a, d) | 0;
+                  }
+                } else e = c[15712] | 0;
+              while (0);
+              i = (b + 1) | 0;
+              a = 1;
+              while (1) {
+                d = c[r >> 2] | 0;
+                if ((a | 0) > (c[(d + 180) >> 2] | 0)) break;
+                g = c[((c[(d + 184) >> 2] | 0) + (a << 2)) >> 2] | 0;
+                if (o) {
+                  f = (g + 16) | 0;
+                  d = c[f >> 2] | 0;
+                  j = +h[(d + 16) >> 3] + p;
+                  k = +h[(d + 24) >> 3] + q;
+                  m = +h[(d + 32) >> 3] + p;
+                  n = +h[(d + 40) >> 3] + q;
+                  if (0 > 1) {
+                    so(b);
+                    c[s >> 2] = KB(g) | 0;
+                    h[(s + 8) >> 3] = j;
+                    h[(s + 16) >> 3] = k;
+                    h[(s + 24) >> 3] = m;
+                    h[(s + 32) >> 3] = n;
+                    w4(e, 90556, s) | 0;
+                    d = c[f >> 2] | 0;
+                  }
+                  h[(d + 16) >> 3] = j;
+                  h[(d + 24) >> 3] = k;
+                  h[(d + 32) >> 3] = m;
+                  h[(d + 40) >> 3] = n;
+                }
+                ro(g, i);
+                a = (a + 1) | 0;
+              }
+              l = t;
+              return;
+            }
+            function so(a) {
+              a = a | 0;
+              var b = 0;
+              b = c[15712] | 0;
+              while (1) {
+                if ((a | 0) <= 0) break;
+                T4(90574, b) | 0;
+                a = (a + -1) | 0;
+              }
+              return;
+            }
+            function to(a, b, c) {
+              a = a | 0;
+              b = +b;
+              c = +c;
+              h[a >> 3] = b;
+              h[(a + 8) >> 3] = c;
+              return;
+            }
+            function uo(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0;
+              d = (+h[(c + 8) >> 3] + +h[(b + 8) >> 3]) * 0.5;
+              h[a >> 3] = (+h[c >> 3] + +h[b >> 3]) * 0.5;
+              h[(a + 8) >> 3] = d;
+              return;
+            }
+            function vo(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0;
+              d = +h[(b + 8) >> 3] - +h[(c + 8) >> 3];
+              h[a >> 3] = +h[b >> 3] - +h[c >> 3];
+              h[(a + 8) >> 3] = d;
+              return;
+            }
+            function wo(a) {
+              a = a | 0;
+              c[a >> 2] = 0;
+              c[(a + 4) >> 2] = 0;
+              c[(a + 8) >> 2] = 0;
+              return;
+            }
+            function xo(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              g = (a + 8) | 0;
+              d = ((c[g >> 2] | 0) + 1) | 0;
+              c[g >> 2] = d;
+              e = (a + 4) | 0;
+              h = c[e >> 2] | 0;
+              f = (h + 10) | 0;
+              if ((d | 0) < (h | 0)) a = c[a >> 2] | 0;
+              else {
+                c[e >> 2] = f;
+                d = MK(c[a >> 2] | 0, f << 2) | 0;
+                c[a >> 2] = d;
+                a = d;
+                d = c[g >> 2] | 0;
+              }
+              c[(a + (d << 2)) >> 2] = b;
+              return;
+            }
+            function yo(a) {
+              a = a | 0;
+              var b = 0;
+              b = jC(a) | 0;
+              while (1) {
+                if (!b) break;
+                WP(b);
+                b = kC(a, b) | 0;
+              }
+              zo(a);
+              return;
+            }
+            function zo(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              b = (a + 16) | 0;
+              a = 1;
+              while (1) {
+                e = c[b >> 2] | 0;
+                d = c[(e + 184) >> 2] | 0;
+                if ((a | 0) > (c[(e + 180) >> 2] | 0)) break;
+                e = c[(d + (a << 2)) >> 2] | 0;
+                CK(c[((c[(e + 16) >> 2] | 0) + 12) >> 2] | 0);
+                zo(e);
+                a = (a + 1) | 0;
+              }
+              U1(d);
+              return;
+            }
+            function Ao(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              YC(a, 1, 137447, 304, 1);
+              HP(a) | 0;
+              b = JK((((tB(a) | 0) << 2) + 4) | 0) | 0;
+              e = (a + 16) | 0;
+              c[((c[e >> 2] | 0) + 152) >> 2] = b;
+              b = 0;
+              d = jC(a) | 0;
+              while (1) {
+                if (!d) break;
+                Bo(d);
+                c[((c[((c[e >> 2] | 0) + 152) >> 2] | 0) + (b << 2)) >> 2] = d;
+                c[((c[(d + 16) >> 2] | 0) + 120) >> 2] = b;
+                b = (b + 1) | 0;
+                d = kC(a, d) | 0;
+              }
+              e = GA(a, 2, 92493, 0) | 0;
+              d = jC(a) | 0;
+              while (1) {
+                if (!d) break;
+                b = XA(a, d) | 0;
+                while (1) {
+                  if (!b) break;
+                  Co(b, e);
+                  b = ZA(a, b) | 0;
+                }
+                d = kC(a, d) | 0;
+              }
+              Do(a);
+              return;
+            }
+            function Bo(a) {
+              a = a | 0;
+              var b = 0;
+              sP(a);
+              b = JK((e[((c[((xC(a) | 0) + 16) >> 2] | 0) + 176) >> 1] | 0) << 3) | 0;
+              c[((c[(a + 16) >> 2] | 0) + 132) >> 2] = b;
+              qQ(a, c[((c[((xC(a) | 0) + 16) >> 2] | 0) + 116) >> 2] & 1);
+              return;
+            }
+            function Co(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0.0;
+              TC(a, 137460, 176, 1) | 0;
+              e = +_O(a, c[47174] | 0, 1.0, 0.0);
+              d = (a + 16) | 0;
+              h[((c[d >> 2] | 0) + 128) >> 3] = e;
+              e = +_O(a, b, +h[1371], 0.0);
+              h[((c[d >> 2] | 0) + 136) >> 3] = e;
+              tP(a) | 0;
+              return;
+            }
+            function Do(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0;
+              r = l;
+              l = (l + 32) | 0;
+              q = (r + 16) | 0;
+              p = r;
+              m = (r + 24) | 0;
+              n = GA(b, 1, 102623, 0) | 0;
+              a: do
+                if (n | 0) {
+                  o = GA(b, 1, 90660, 0) | 0;
+                  i = (b + 16) | 0;
+                  j = (o | 0) == 0;
+                  k = c[15712] | 0;
+                  g = 0;
+                  while (1) {
+                    e = c[((c[((c[i >> 2] | 0) + 152) >> 2] | 0) + (g << 2)) >> 2] | 0;
+                    if (!e) break a;
+                    b = RA(e, n) | 0;
+                    do
+                      if (a[b >> 0] | 0) {
+                        f = (e + 16) | 0;
+                        d = c[((c[f >> 2] | 0) + 132) >> 2] | 0;
+                        a[m >> 0] = 0;
+                        c[p >> 2] = d;
+                        c[(p + 4) >> 2] = d + 8;
+                        c[(p + 8) >> 2] = m;
+                        if ((b5(b, 101749, p) | 0) <= 1) {
+                          c[q >> 2] = KB(e) | 0;
+                          c[(q + 4) >> 2] = b;
+                          w4(k, 90664, q) | 0;
+                          break;
+                        }
+                        b: do
+                          if (+h[23293] > 0.0) {
+                            b = 0;
+                            while (1) {
+                              if ((b | 0) == 2) break b;
+                              s = (d + (b << 3)) | 0;
+                              h[s >> 3] = +h[s >> 3] / +h[23293];
+                              b = (b + 1) | 0;
+                            }
+                          }
+                        while (0);
+                        b = c[f >> 2] | 0;
+                        a[(b + 119) >> 0] = 1;
+                        if ((a[m >> 0] | 0) != 33) {
+                          if (j) break;
+                          if (!(((dP(RA(e, o) | 0) | 0) << 24) >> 24)) break;
+                          b = c[f >> 2] | 0;
+                        }
+                        a[(b + 119) >> 0] = 3;
+                      }
+                    while (0);
+                    g = (g + 1) | 0;
+                  }
+                }
+              while (0);
+              l = r;
+              return;
+            }
+            function Eo(a) {
+              a = a | 0;
+              var b = 0,
+                c = 0;
+              c = jC(a) | 0;
+              while (1) {
+                if (!c) break;
+                b = XA(a, c) | 0;
+                while (1) {
+                  if (!b) break;
+                  YP(b);
+                  b = ZA(a, b) | 0;
+                }
+                WP(c);
+                c = kC(a, c) | 0;
+              }
+              Fo(a);
+              return;
+            }
+            function Fo(a) {
+              a = a | 0;
+              Go(a);
+              a = (a + 16) | 0;
+              U1(c[((c[a >> 2] | 0) + 152) >> 2] | 0);
+              U1(c[((c[a >> 2] | 0) + 140) >> 2] | 0);
+              return;
+            }
+            function Go(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              g = (a + 16) | 0;
+              f = 1;
+              while (1) {
+                e = c[g >> 2] | 0;
+                b = c[(e + 184) >> 2] | 0;
+                if ((f | 0) > (c[(e + 180) >> 2] | 0)) break;
+                e = c[(b + (f << 2)) >> 2] | 0;
+                b = (e + 16) | 0;
+                CK(c[((c[b >> 2] | 0) + 12) >> 2] | 0);
+                d = c[((c[b >> 2] | 0) + 140) >> 2] | 0;
+                if (d | 0) {
+                  U1(c[d >> 2] | 0);
+                  U1(c[((c[b >> 2] | 0) + 140) >> 2] | 0);
+                }
+                Go(e);
+                f = (f + 1) | 0;
+              }
+              U1(b);
+              if ((yC(a) | 0) != (a | 0)) VC(a, 137483) | 0;
+              return;
+            }
+            function Ho(a, b) {
+              a = a | 0;
+              b = b | 0;
+              c[(b + 4) >> 2] = GA(a, 0, 90716, 0) | 0;
+              c[(b + 8) >> 2] = GA(a, 0, 141116, 0) | 0;
+              c[(b + 12) >> 2] = GA(a, 0, 141048, 0) | 0;
+              c[b >> 2] = a;
+              c[(b + 16) >> 2] = 0;
+              c[(b + 36) >> 2] = kH(a, 2, 4, (b + 20) | 0) | 0;
+              return;
+            }
+            function Io(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0;
+              oQ(a, 2);
+              d = JK(56) | 0;
+              e = (a + 16) | 0;
+              c[((c[e >> 2] | 0) + 140) >> 2] = d;
+              d = (ZO(a, GA(a, 0, 91374, 0) | 0, 2, 2) | 0) & 65535;
+              d = (d & 65535) < 10 ? d : 10;
+              b[((c[e >> 2] | 0) + 176) >> 1] = d;
+              c[47137] = d & 65535;
+              Jo(a, 0, a);
+              fp(a);
+              Ao(a);
+              return;
+            }
+            function Jo(a, d, e) {
+              a = a | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              m = l;
+              l = (l + 16) | 0;
+              j = m;
+              k = (d | 0) == 0;
+              if (k) {
+                Ko(j);
+                d = j;
+              }
+              g = (e + 16) | 0;
+              f = OD(a) | 0;
+              while (1) {
+                if (!f) break;
+                if (!(Q2(KB(f) | 0, 108006, 7) | 0)) {
+                  TC(f, 137483, 280, 1) | 0;
+                  n = JK(56) | 0;
+                  p = c[(f + 16) >> 2] | 0;
+                  c[(p + 140) >> 2] = n;
+                  o = c[g >> 2] | 0;
+                  b[(p + 176) >> 1] = b[(o + 176) >> 1] | 0;
+                  c[(n + 44) >> 2] = (c[((c[(o + 140) >> 2] | 0) + 44) >> 2] | 0) + 1;
+                  c[(n + 48) >> 2] = e;
+                  Lo(d, f);
+                  Jo(f, 0, f);
+                } else Jo(f, d, e);
+                f = PD(f) | 0;
+              }
+              if (
+                k ? ((h = c[(j + 8) >> 2] | 0), (i = (a + 16) | 0), (c[((c[i >> 2] | 0) + 180) >> 2] = h), h | 0) : 0
+              ) {
+                p = MK(c[j >> 2] | 0, ((h << 2) + 4) | 0) | 0;
+                c[((c[i >> 2] | 0) + 184) >> 2] = p;
+              }
+              l = m;
+              return;
+            }
+            function Ko(a) {
+              a = a | 0;
+              c[a >> 2] = 0;
+              c[(a + 4) >> 2] = 0;
+              c[(a + 8) >> 2] = 0;
+              return;
+            }
+            function Lo(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              g = (a + 8) | 0;
+              d = ((c[g >> 2] | 0) + 1) | 0;
+              c[g >> 2] = d;
+              e = (a + 4) | 0;
+              h = c[e >> 2] | 0;
+              f = (h + 10) | 0;
+              if ((d | 0) < (h | 0)) a = c[a >> 2] | 0;
+              else {
+                c[e >> 2] = f;
+                d = MK(c[a >> 2] | 0, f << 2) | 0;
+                c[a >> 2] = d;
+                a = d;
+                d = c[g >> 2] | 0;
+              }
+              c[(a + (d << 2)) >> 2] = b;
+              return;
+            }
+            function Mo(a) {
+              a = a | 0;
+              var b = 0,
+                c = 0;
+              b = l;
+              l = (l + 64) | 0;
+              c = b;
+              Ho(a, c);
+              No(a, c);
+              Oo(a);
+              Po(a, a);
+              Qo(a);
+              l = b;
+              return;
+            }
+            function No(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0.0,
+                u = 0.0,
+                v = 0,
+                w = 0.0,
+                x = 0.0;
+              s = l;
+              l = (l + 64) | 0;
+              r = (s + 48) | 0;
+              e = (s + 40) | 0;
+              o = (s + 56) | 0;
+              n = (s + 52) | 0;
+              m = s;
+              if (0) {
+                q = c[15712] | 0;
+                c[e >> 2] = KB(b) | 0;
+                w4(q, 90723, e) | 0;
+              }
+              e = jC(b) | 0;
+              while (1) {
+                if (!e) break;
+                c[((c[(e + 16) >> 2] | 0) + 164) >> 2] = 0;
+                e = kC(b, e) | 0;
+              }
+              p = Ro(b, d) | 0;
+              q = Iv(p, o, n) | 0;
+              e = q;
+              while (1) {
+                k = (e + 4) | 0;
+                f = c[e >> 2] | 0;
+                if (!f) break;
+                gp(f, m);
+                e = jC(f) | 0;
+                while (1) {
+                  if (!e) break;
+                  g = kC(f, e) | 0;
+                  i = (e + 16) | 0;
+                  j = c[i >> 2] | 0;
+                  if (c[(j + 212) >> 2] | 0) {
+                    v = So(e, f) | 0;
+                    No(v, d);
+                    v = c[((c[(v + 16) >> 2] | 0) + 140) >> 2] | 0;
+                    u = +h[(v + 24) >> 3];
+                    j = c[i >> 2] | 0;
+                    h[(j + 32) >> 3] = u;
+                    t = +h[(v + 32) >> 3];
+                    h[(j + 40) >> 3] = t;
+                    u = u * 36.0;
+                    h[(j + 88) >> 3] = u;
+                    h[(j + 96) >> 3] = u;
+                    h[(j + 80) >> 3] = t * 72.0;
+                    e = g;
+                    continue;
+                  }
+                  if (c[((c[(j + 112) >> 2] | 0) + 8) >> 2] | 0) {
+                    e = g;
+                    continue;
+                  }
+                  wC(f, e) | 0;
+                  e = g;
+                }
+                if ((tB(f) | 0) <= 1) {
+                  e = k;
+                  continue;
+                }
+                if ((c[d >> 2] | 0) == (b | 0)) Lq(f) | 0;
+                tp(f, m);
+                e = k;
+              }
+              e = c[o >> 2] | 0;
+              if ((e | 0) <= 1)
+                if ((e | 0) == 1) {
+                  BP(c[q >> 2] | 0);
+                  e = 0;
+                } else e = 0;
+              else {
+                if (!(c[n >> 2] | 0)) f = 0;
+                else {
+                  f = JK(e) | 0;
+                  a[f >> 0] = 1;
+                  e = c[o >> 2] | 0;
+                }
+                c[(d + 40) >> 2] = f;
+                e = QG(e, q, 0, (d + 20) | 0) | 0;
+                U1(f);
+              }
+              To(p, c[o >> 2] | 0, q, e, b, d);
+              U1(e);
+              f = jC(p) | 0;
+              while (1) {
+                if (!f) break;
+                g = c[(f + 16) >> 2] | 0;
+                e = c[(g + 212) >> 2] | 0;
+                if (!e) {
+                  e = c[((c[(g + 112) >> 2] | 0) + 8) >> 2] | 0;
+                  if (e | 0) {
+                    o = c[(g + 132) >> 2] | 0;
+                    v = c[((c[(e + 16) >> 2] | 0) + 132) >> 2] | 0;
+                    h[v >> 3] = +h[o >> 3];
+                    h[(v + 8) >> 3] = +h[(o + 8) >> 3];
+                  }
+                } else {
+                  o = c[(g + 132) >> 2] | 0;
+                  x = +h[(g + 32) >> 3];
+                  w = +h[o >> 3] - x * 0.5;
+                  v = c[((c[(e + 16) >> 2] | 0) + 140) >> 2] | 0;
+                  h[(v + 8) >> 3] = w;
+                  t = +h[(g + 40) >> 3];
+                  u = +h[(o + 8) >> 3] - t * 0.5;
+                  h[(v + 16) >> 3] = u;
+                  h[(v + 24) >> 3] = x + w;
+                  h[(v + 32) >> 3] = t + u;
+                }
+                f = kC(p, f) | 0;
+              }
+              v = ((c[((c[(b + 16) >> 2] | 0) + 140) >> 2] | 0) + 8) | 0;
+              o = ((c[((c[(p + 16) >> 2] | 0) + 140) >> 2] | 0) + 8) | 0;
+              c[v >> 2] = c[o >> 2];
+              c[(v + 4) >> 2] = c[(o + 4) >> 2];
+              c[(v + 8) >> 2] = c[(o + 8) >> 2];
+              c[(v + 12) >> 2] = c[(o + 12) >> 2];
+              c[(v + 16) >> 2] = c[(o + 16) >> 2];
+              c[(v + 20) >> 2] = c[(o + 20) >> 2];
+              c[(v + 24) >> 2] = c[(o + 24) >> 2];
+              c[(v + 28) >> 2] = c[(o + 28) >> 2];
+              Uo(p, q);
+              U1(q);
+              if (0) {
+                v = c[15712] | 0;
+                c[r >> 2] = KB(b) | 0;
+                w4(v, 90734, r) | 0;
+              }
+              l = s;
+              return;
+            }
+            function Oo(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0;
+              d = jC(b) | 0;
+              while (1) {
+                if (!d) break;
+                e = c[(d + 16) >> 2] | 0;
+                if (a[(e + 118) >> 0] | 0) {
+                  k = c[((c[((c[(e + 212) >> 2] | 0) + 16) >> 2] | 0) + 140) >> 2] | 0;
+                  j = +h[(k + 24) >> 3] - +h[(k + 8) >> 3];
+                  i = +h[(k + 32) >> 3] - +h[(k + 16) >> 3];
+                  g = j * 36.0;
+                  f = i * 36.0;
+                  k = c[(e + 132) >> 2] | 0;
+                  h[k >> 3] = j * 0.5;
+                  h[(k + 8) >> 3] = i * 0.5;
+                  h[(e + 32) >> 3] = j;
+                  h[(e + 40) >> 3] = i;
+                  h[(e + 96) >> 3] = g;
+                  h[(e + 88) >> 3] = g;
+                  h[(e + 80) >> 3] = i * 72.0;
+                  e = c[((c[(e + 12) >> 2] | 0) + 44) >> 2] | 0;
+                  h[e >> 3] = g;
+                  h[(e + 8) >> 3] = f;
+                  i = -g;
+                  h[(e + 16) >> 3] = i;
+                  h[(e + 24) >> 3] = f;
+                  h[(e + 32) >> 3] = i;
+                  f = -f;
+                  h[(e + 40) >> 3] = f;
+                  h[(e + 48) >> 3] = g;
+                  h[(e + 56) >> 3] = f;
+                }
+                d = kC(b, d) | 0;
+              }
+              return;
+            }
+            function Po(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0.0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0.0,
+                l = 0,
+                m = 0.0,
+                n = 0,
+                o = 0.0,
+                p = 0;
+              i = (a + 16) | 0;
+              j = c[((c[i >> 2] | 0) + 140) >> 2] | 0;
+              f = +h[(j + 8) >> 3];
+              g = +h[(j + 16) >> 3];
+              j = (a | 0) != (b | 0);
+              a: do
+                if (j) {
+                  d = jC(a) | 0;
+                  while (1) {
+                    if (!d) {
+                      a = 1;
+                      break a;
+                    }
+                    e = c[(d + 16) >> 2] | 0;
+                    if ((c[(e + 212) >> 2] | 0) == (a | 0)) {
+                      e = c[(e + 132) >> 2] | 0;
+                      h[e >> 3] = +h[e >> 3] + f;
+                      e = (e + 8) | 0;
+                      h[e >> 3] = +h[e >> 3] + g;
+                    }
+                    d = kC(a, d) | 0;
+                  }
+                } else a = 1;
+              while (0);
+              while (1) {
+                d = c[i >> 2] | 0;
+                if ((a | 0) > (c[(d + 180) >> 2] | 0)) break;
+                d = c[((c[(d + 184) >> 2] | 0) + (a << 2)) >> 2] | 0;
+                if (j) {
+                  e = c[((c[(d + 16) >> 2] | 0) + 140) >> 2] | 0;
+                  p = (e + 8) | 0;
+                  n = (e + 16) | 0;
+                  l = (e + 24) | 0;
+                  e = (e + 32) | 0;
+                  o = +h[n >> 3] + g;
+                  m = +h[l >> 3] + f;
+                  k = +h[e >> 3] + g;
+                  h[p >> 3] = +h[p >> 3] + f;
+                  h[n >> 3] = o;
+                  h[l >> 3] = m;
+                  h[e >> 3] = k;
+                }
+                Po(d, b);
+                a = (a + 1) | 0;
+              }
+              return;
+            }
+            function Qo(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0.0,
+                f = 0.0,
+                g = 0.0;
+              b = (a + 16) | 0;
+              a = c[b >> 2] | 0;
+              d = c[(a + 140) >> 2] | 0;
+              g = +h[(d + 16) >> 3] * 72.0;
+              f = +h[(d + 24) >> 3] * 72.0;
+              e = +h[(d + 32) >> 3] * 72.0;
+              h[(a + 16) >> 3] = +h[(d + 8) >> 3] * 72.0;
+              h[(a + 24) >> 3] = g;
+              h[(a + 32) >> 3] = f;
+              h[(a + 40) >> 3] = e;
+              a = 1;
+              while (1) {
+                d = c[b >> 2] | 0;
+                if ((a | 0) > (c[(d + 180) >> 2] | 0)) break;
+                Qo(c[((c[(d + 184) >> 2] | 0) + (a << 2)) >> 2] | 0);
+                a = (a + 1) | 0;
+              }
+              return;
+            }
+            function Ro(d, e) {
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0;
+              y = l;
+              l = (l + 160) | 0;
+              s = (y + 24) | 0;
+              t = (y + 8) | 0;
+              g = y;
+              f = (y + 56) | 0;
+              w = (e + 16) | 0;
+              x = c[w >> 2] | 0;
+              c[w >> 2] = x + 1;
+              c[s >> 2] = x;
+              m4(f, 90796, s) | 0;
+              if (0 > 1) {
+                x = c[15712] | 0;
+                w = KB(d) | 0;
+                c[g >> 2] = f;
+                c[(g + 4) >> 2] = w;
+                w4(x, 90803, g) | 0;
+              }
+              a[s >> 0] = a[18588] | 0;
+              a[(s + 1) >> 0] = a[18589] | 0;
+              a[(s + 2) >> 0] = a[18590] | 0;
+              a[(s + 3) >> 0] = a[18591] | 0;
+              x = oB(91156, s, 0) | 0;
+              TC(x, 137483, 280, 1) | 0;
+              v = JK(56) | 0;
+              w = (x + 16) | 0;
+              o = c[w >> 2] | 0;
+              c[(o + 140) >> 2] = v;
+              v = (d + 16) | 0;
+              b[(o + 176) >> 1] = b[((c[v >> 2] | 0) + 176) >> 1] | 0;
+              _o(d, x, 92507);
+              _o(d, x, 93112);
+              _o(d, x, 91202);
+              o = (e + 4) | 0;
+              p = (s + 16) | 0;
+              q = (s + 8) | 0;
+              r = (s + 24) | 0;
+              j = 0;
+              n = 1;
+              while (1) {
+                f = c[v >> 2] | 0;
+                if ((n | 0) > (c[(f + 180) >> 2] | 0)) break;
+                c[s >> 2] = c[332];
+                c[(s + 4) >> 2] = c[333];
+                c[(s + 8) >> 2] = c[334];
+                c[(s + 12) >> 2] = c[335];
+                c[(s + 16) >> 2] = c[336];
+                c[(s + 20) >> 2] = c[337];
+                c[(s + 24) >> 2] = c[338];
+                c[(s + 28) >> 2] = c[339];
+                g = c[((c[(f + 184) >> 2] | 0) + (n << 2)) >> 2] | 0;
+                uK(g);
+                i = $o(x, KB(g) | 0) | 0;
+                k = (i + 16) | 0;
+                f = c[k >> 2] | 0;
+                c[(f + 212) >> 2] = g;
+                m = (j + 1) | 0;
+                c[(f + 120) >> 2] = j;
+                if (c[o >> 2] | 0) ap(g, i, e, s);
+                f = jC(g) | 0;
+                while (1) {
+                  if (!f) break;
+                  c[((c[(f + 16) >> 2] | 0) + 164) >> 2] = i;
+                  f = kC(g, f) | 0;
+                }
+                f = c[k >> 2] | 0;
+                if (a[(f + 119) >> 0] | 0) {
+                  k = c[(f + 132) >> 2] | 0;
+                  h[k >> 3] = (+h[p >> 3] + +h[s >> 3]) * 0.5;
+                  h[(k + 8) >> 3] = (+h[r >> 3] + +h[q >> 3]) * 0.5;
+                }
+                j = m;
+                n = (n + 1) | 0;
+              }
+              k = jC(d) | 0;
+              while (1) {
+                if (!k) break;
+                f = (k + 16) | 0;
+                g = c[f >> 2] | 0;
+                if (!(c[(g + 164) >> 2] | 0)) {
+                  i = (g + 212) | 0;
+                  s = c[i >> 2] | 0;
+                  if (s | 0 ? (s | 0) != (c[((c[((c[v >> 2] | 0) + 140) >> 2] | 0) + 48) >> 2] | 0) : 0) {
+                    u = 18;
+                    break;
+                  }
+                  c[i >> 2] = d;
+                  if (!(a[(g + 118) >> 0] | 0)) {
+                    i = $o(x, KB(k) | 0) | 0;
+                    g = c[f >> 2] | 0;
+                    c[(g + 164) >> 2] = i;
+                    i = c[(i + 16) >> 2] | 0;
+                    c[(i + 120) >> 2] = j;
+                    h[(i + 32) >> 3] = +h[(g + 32) >> 3];
+                    h[(i + 40) >> 3] = +h[(g + 40) >> 3];
+                    h[(i + 88) >> 3] = +h[(g + 88) >> 3];
+                    h[(i + 96) >> 3] = +h[(g + 96) >> 3];
+                    h[(i + 80) >> 3] = +h[(g + 80) >> 3];
+                    c[(i + 8) >> 2] = c[(g + 8) >> 2];
+                    c[(i + 12) >> 2] = c[(g + 12) >> 2];
+                    f = a[(g + 119) >> 0] | 0;
+                    if ((f << 24) >> 24) {
+                      e = c[(g + 132) >> 2] | 0;
+                      s = c[(i + 132) >> 2] | 0;
+                      h[s >> 3] = +h[e >> 3];
+                      h[(s + 8) >> 3] = +h[(e + 8) >> 3];
+                      a[(i + 119) >> 0] = f;
+                    }
+                    c[((c[(i + 112) >> 2] | 0) + 8) >> 2] = k;
+                    f = (j + 1) | 0;
+                  } else f = j;
+                } else f = j;
+                k = kC(d, k) | 0;
+                j = f;
+              }
+              if ((u | 0) == 18) {
+                e = KB(k) | 0;
+                s = KB(d) | 0;
+                u = KB(c[((c[f >> 2] | 0) + 212) >> 2] | 0) | 0;
+                c[t >> 2] = e;
+                c[(t + 4) >> 2] = s;
+                c[(t + 8) >> 2] = u;
+                gA(1, 90826, t) | 0;
+                bb(187212, 1);
+              }
+              m = jC(d) | 0;
+              while (1) {
+                if (!m) break;
+                n = c[((c[(m + 16) >> 2] | 0) + 164) >> 2] | 0;
+                o = (n + 16) | 0;
+                i = XA(d, m) | 0;
+                while (1) {
+                  if (!i) break;
+                  f =
+                    c[
+                      ((c[((c[((((c[i >> 2] & 3) | 0) == 2 ? i : (i + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                        164) >>
+                        2
+                    ] | 0;
+                  if ((f | 0) != (n | 0)) {
+                    if (f >>> 0 > n >>> 0) k = iB(x, n, f, 0, 1) | 0;
+                    else k = iB(x, f, n, 0, 1) | 0;
+                    TC(k, 137460, 176, 1) | 0;
+                    g = c[(i + 16) >> 2] | 0;
+                    u = c[(k + 16) >> 2] | 0;
+                    h[(u + 136) >> 3] = +h[(g + 136) >> 3];
+                    h[(u + 128) >> 3] = +h[(g + 128) >> 3];
+                    f = c[((c[(f + 16) >> 2] | 0) + 112) >> 2] | 0;
+                    g = (f + 4) | 0;
+                    c[g >> 2] = (c[g >> 2] | 0) + 1;
+                    g = c[((c[o >> 2] | 0) + 112) >> 2] | 0;
+                    t = (g + 4) | 0;
+                    c[t >> 2] = (c[t >> 2] | 0) + 1;
+                    if (!(c[(u + 172) >> 2] | 0)) {
+                      c[f >> 2] = (c[f >> 2] | 0) + 1;
+                      c[g >> 2] = (c[g >> 2] | 0) + 1;
+                    }
+                    bp(k, i);
+                  }
+                  i = ZA(d, i) | 0;
+                }
+                m = kC(d, m) | 0;
+              }
+              f = c[((c[v >> 2] | 0) + 140) >> 2] | 0;
+              g = c[f >> 2] | 0;
+              if (g | 0) {
+                i = JK(((c[(f + 4) >> 2] << 4) + 16) | 0) | 0;
+                c[c[((c[w >> 2] | 0) + 140) >> 2] >> 2] = i;
+                f = 0;
+                while (1) {
+                  if (!(c[g >> 2] | 0)) break;
+                  m = c[((c[((c[(g + 4) >> 2] | 0) + 16) >> 2] | 0) + 164) >> 2] | 0;
+                  if (m) {
+                    cp(d, g);
+                    n = $o(x, 193772) | 0;
+                    o = (n + 16) | 0;
+                    c[((c[o >> 2] | 0) + 120) >> 2] = j;
+                    if (n >>> 0 > m >>> 0) k = iB(x, m, n, 0, 1) | 0;
+                    else k = iB(x, n, m, 0, 1) | 0;
+                    TC(k, 137460, 176, 1) | 0;
+                    u = c[g >> 2] | 0;
+                    t = c[(u + 16) >> 2] | 0;
+                    v = c[(k + 16) >> 2] | 0;
+                    h[(v + 136) >> 3] = +h[(t + 136) >> 3];
+                    h[(v + 128) >> 3] = +h[(t + 128) >> 3];
+                    bp(k, u);
+                    u = c[((c[o >> 2] | 0) + 112) >> 2] | 0;
+                    v = (u + 4) | 0;
+                    c[v >> 2] = (c[v >> 2] | 0) + 1;
+                    v = c[((c[(m + 16) >> 2] | 0) + 112) >> 2] | 0;
+                    t = (v + 4) | 0;
+                    c[t >> 2] = (c[t >> 2] | 0) + 1;
+                    c[u >> 2] = (c[u >> 2] | 0) + 1;
+                    c[v >> 2] = (c[v >> 2] | 0) + 1;
+                    c[(i + 4) >> 2] = n;
+                    h[(i + 8) >> 3] = +h[(g + 8) >> 3];
+                    c[i >> 2] = k;
+                    f = (f + 1) | 0;
+                    i = (i + 16) | 0;
+                    j = (j + 1) | 0;
+                  }
+                  g = (g + 16) | 0;
+                }
+                c[((c[((c[w >> 2] | 0) + 140) >> 2] | 0) + 4) >> 2] = f;
+              }
+              l = y;
+              return x | 0;
+            }
+            function So(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              l = c[(a + 16) >> 2] | 0;
+              k = c[(l + 212) >> 2] | 0;
+              l = c[((c[(l + 112) >> 2] | 0) + 4) >> 2] | 0;
+              do
+                if (l | 0) {
+                  j = JK(((l << 4) + 16) | 0) | 0;
+                  f = Xo(a, b) | 0;
+                  g = (f + 8) | 0;
+                  b = 0;
+                  e = f;
+                  while (1) {
+                    if (!(c[e >> 2] | 0)) break;
+                    i = (e + 24) | 0;
+                    if (!(c[i >> 2] | 0)) d = +h[g >> 3] + 6.283185307179586;
+                    else d = +h[(e + 32) >> 3];
+                    b = Yo(a, e, j, b, d) | 0;
+                    e = i;
+                  }
+                  if ((b | 0) == (l | 0)) {
+                    a = c[((c[(k + 16) >> 2] | 0) + 140) >> 2] | 0;
+                    c[a >> 2] = j;
+                    c[(a + 4) >> 2] = l;
+                    U1(f);
+                    break;
+                  } else qa(90742, 90752, 766, 90761);
+                }
+              while (0);
+              return k | 0;
+            }
+            function To(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0.0,
+                j = 0,
+                k = 0.0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0.0,
+                H = 0.0;
+              B = l;
+              l = (l + 32) | 0;
+              x = (B + 16) | 0;
+              A = B;
+              m = c[(g + 8) >> 2] | 0;
+              j = c[(g + 12) >> 2] | 0;
+              y = (c[g >> 2] | 0) == (f | 0);
+              z = (b | 0) != 0;
+              a: do
+                if (z) {
+                  p = c[((c[d >> 2] | 0) + 16) >> 2] | 0;
+                  k = +h[(p + 16) >> 3];
+                  m = ~~(k + (k >= 0.0 ? 0.5 : -0.5));
+                  c[A >> 2] = m;
+                  k = +h[(p + 24) >> 3];
+                  g = ~~(k + (k >= 0.0 ? 0.5 : -0.5));
+                  u = (A + 4) | 0;
+                  c[u >> 2] = g;
+                  k = +h[(p + 32) >> 3];
+                  n = ~~(k + (k >= 0.0 ? 0.5 : -0.5));
+                  v = (A + 8) | 0;
+                  c[v >> 2] = n;
+                  k = +h[(p + 40) >> 3];
+                  p = ~~(k + (k >= 0.0 ? 0.5 : -0.5));
+                  w = (A + 12) | 0;
+                  c[w >> 2] = p;
+                  if ((b | 0) > 1) {
+                    q = c[e >> 2] | 0;
+                    t = c[(e + 4) >> 2] | 0;
+                    m = (q + m) | 0;
+                    c[A >> 2] = m;
+                    b = (t + g) | 0;
+                    c[u >> 2] = b;
+                    n = (q + n) | 0;
+                    c[v >> 2] = n;
+                    q = (x + 4) | 0;
+                    r = (x + 8) | 0;
+                    s = (x + 12) | 0;
+                    o = e;
+                    g = d;
+                    t = (t + p) | 0;
+                    p = b;
+                    while (1) {
+                      g = (g + 4) | 0;
+                      j = (o + 8) | 0;
+                      c[w >> 2] = t;
+                      b = c[g >> 2] | 0;
+                      if (!b) {
+                        j = 0;
+                        r = p;
+                        s = t;
+                        break a;
+                      }
+                      E = c[(b + 16) >> 2] | 0;
+                      G = +h[(E + 16) >> 3];
+                      i = +h[(E + 24) >> 3];
+                      k = +h[(E + 32) >> 3];
+                      H = +h[(E + 40) >> 3];
+                      E = ~~(H + (H >= 0.0 ? 0.5 : -0.5));
+                      c[s >> 2] = E;
+                      b = c[j >> 2] | 0;
+                      F = c[(o + 12) >> 2] | 0;
+                      D = (b + ~~(G + (G >= 0.0 ? 0.5 : -0.5))) | 0;
+                      c[x >> 2] = D;
+                      C = (F + ~~(i + (i >= 0.0 ? 0.5 : -0.5))) | 0;
+                      c[q >> 2] = C;
+                      b = (b + ~~(k + (k >= 0.0 ? 0.5 : -0.5))) | 0;
+                      c[r >> 2] = b;
+                      E = (F + E) | 0;
+                      c[s >> 2] = E;
+                      D = c[((m | 0) < (D | 0) ? A : x) >> 2] | 0;
+                      c[A >> 2] = D;
+                      C = c[(((p | 0) < (C | 0) ? A : x) + 4) >> 2] | 0;
+                      c[u >> 2] = C;
+                      b = c[(((n | 0) > (b | 0) ? A : x) + 8) >> 2] | 0;
+                      c[v >> 2] = b;
+                      o = j;
+                      t = c[(((t | 0) > (E | 0) ? A : x) + 12) >> 2] | 0;
+                      m = D;
+                      p = C;
+                      n = b;
+                    }
+                  } else {
+                    j = 0;
+                    r = g;
+                    s = p;
+                  }
+                } else {
+                  c[A >> 2] = 0;
+                  c[(A + 4) >> 2] = 0;
+                  n = ZO(f, m, 54, 3) | 0;
+                  c[(A + 8) >> 2] = n;
+                  s = ZO(f, j, 36, 3) | 0;
+                  c[(A + 12) >> 2] = s;
+                  j = 1;
+                  m = 0;
+                  r = 0;
+                }
+              while (0);
+              b = (f + 16) | 0;
+              o = c[b >> 2] | 0;
+              g = c[(o + 12) >> 2] | 0;
+              if (g) {
+                H = +h[(g + 24) >> 3];
+                g = (m - n + ~~(H + (H >= 0.0 ? 0.5 : -0.5))) | 0;
+                if ((g | 0) > 0) {
+                  g = g >>> 1;
+                  m = (m - g) | 0;
+                  c[A >> 2] = m;
+                  n = (n + g) | 0;
+                  c[(A + 8) >> 2] = n;
+                  g = 0;
+                } else g = 0;
+              } else g = j;
+              if (y | ((g | 0) != 0)) {
+                j = 0;
+                g = o;
+              } else {
+                j = ZO(a, c[47144] | 0, 8, 0) | 0;
+                g = c[b >> 2] | 0;
+              }
+              q = (j - m) | 0;
+              p = ~~(+h[(g + 56) >> 3] + +((j - r) | 0));
+              c[A >> 2] = 0;
+              c[(A + 4) >> 2] = 0;
+              o = (q + j + n) | 0;
+              c[(A + 8) >> 2] = o;
+              b = ~~(+h[(g + 88) >> 3] + +((j + p) | 0) + +(s | 0));
+              c[(A + 12) >> 2] = b;
+              b: do
+                if (z) {
+                  g = e;
+                  c: while (1) {
+                    n = (d + 4) | 0;
+                    j = c[d >> 2] | 0;
+                    if (!j) break b;
+                    if (!g) {
+                      m = 0;
+                      d = q;
+                      g = p;
+                    } else {
+                      m = (g + 8) | 0;
+                      d = ((c[g >> 2] | 0) + q) | 0;
+                      g = ((c[(g + 4) >> 2] | 0) + p) | 0;
+                    }
+                    k = +(d | 0) * 0.013888888888888888;
+                    i = +(g | 0) * 0.013888888888888888;
+                    d = jC(j) | 0;
+                    while (1) {
+                      if (!d) {
+                        d = n;
+                        g = m;
+                        continue c;
+                      }
+                      F = c[((c[(d + 16) >> 2] | 0) + 132) >> 2] | 0;
+                      h[F >> 3] = +h[F >> 3] + k;
+                      F = (F + 8) | 0;
+                      h[F >> 3] = +h[F >> 3] + i;
+                      d = kC(j, d) | 0;
+                    }
+                  }
+                }
+              while (0);
+              F = c[((c[(a + 16) >> 2] | 0) + 140) >> 2] | 0;
+              E = (F + 8) | 0;
+              c[E >> 2] = 0;
+              c[(E + 4) >> 2] = 0;
+              c[(E + 8) >> 2] = 0;
+              c[(E + 12) >> 2] = 0;
+              h[(F + 24) >> 3] = +(o | 0) * 0.013888888888888888;
+              h[(F + 32) >> 3] = +(b | 0) * 0.013888888888888888;
+              l = B;
+              return;
+            }
+            function Uo(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              while (1) {
+                d = c[b >> 2] | 0;
+                if (!d) break;
+                Vo(d);
+                VC(d, 137483) | 0;
+                b = (b + 4) | 0;
+              }
+              b = c[c[((c[(a + 16) >> 2] | 0) + 140) >> 2] >> 2] | 0;
+              if (b | 0) U1(b);
+              Vo(a);
+              VC(a, 137483) | 0;
+              d = jC(a) | 0;
+              while (1) {
+                if (!d) break;
+                e = kC(a, d) | 0;
+                b = XA(a, d) | 0;
+                while (1) {
+                  if (!b) break;
+                  U1(c[((c[(b + 16) >> 2] | 0) + 172) >> 2] | 0);
+                  VC(b, 137460) | 0;
+                  b = ZA(a, b) | 0;
+                }
+                Wo(d);
+                d = e;
+              }
+              sB(a) | 0;
+              return;
+            }
+            function Vo(a) {
+              a = a | 0;
+              U1(c[((c[(a + 16) >> 2] | 0) + 140) >> 2] | 0);
+              return;
+            }
+            function Wo(a) {
+              a = a | 0;
+              var b = 0;
+              b = (a + 16) | 0;
+              U1(c[((c[b >> 2] | 0) + 112) >> 2] | 0);
+              U1(c[((c[b >> 2] | 0) + 132) >> 2] | 0);
+              VC(a, 137447) | 0;
+              return;
+            }
+            function Xo(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              k = (a + 16) | 0;
+              l = c[c[((c[k >> 2] | 0) + 112) >> 2] >> 2] | 0;
+              m = JK((((l * 24) | 0) + 24) | 0) | 0;
+              i = 0;
+              j = aB(b, a) | 0;
+              while (1) {
+                if (!j) break;
+                f = c[j >> 2] & 3;
+                e = c[(((f | 0) == 2 ? j : (j + -48) | 0) + 40) >> 2] | 0;
+                if ((e | 0) == (a | 0)) e = c[(((f | 0) == 3 ? j : (j + 48) | 0) + 40) >> 2] | 0;
+                e = c[((c[(e + 16) >> 2] | 0) + 132) >> 2] | 0;
+                f = c[((c[k >> 2] | 0) + 132) >> 2] | 0;
+                g = +h[e >> 3] - +h[f >> 3];
+                d = +h[(e + 8) >> 3] - +h[(f + 8) >> 3];
+                c[(m + ((i * 24) | 0)) >> 2] = j;
+                h[(m + ((i * 24) | 0) + 8) >> 3] = +K(+d, +g);
+                h[(m + ((i * 24) | 0) + 16) >> 3] = d * d + g * g;
+                i = (i + 1) | 0;
+                j = bB(b, j, a) | 0;
+              }
+              if ((i | 0) != (l | 0)) qa(90775, 90752, 642, 90784);
+              o4(m, l, 24, 67);
+              a: do
+                if ((l | 0) > 1) {
+                  j = (l + -1) | 0;
+                  e = 0;
+                  b: while (1) {
+                    if ((e | 0) >= (j | 0)) break a;
+                    g = +h[(m + ((e * 24) | 0) + 8) >> 3];
+                    f = (e + 1) | 0;
+                    i = f;
+                    while (1) {
+                      if ((i | 0) >= (l | 0)) break;
+                      if (!(+h[(m + ((i * 24) | 0) + 8) >> 3] == g)) break;
+                      i = (i + 1) | 0;
+                    }
+                    if ((i | 0) == (f | 0)) {
+                      e = f;
+                      continue;
+                    }
+                    if ((i | 0) == (l | 0)) d = 3.141592653589793;
+                    else d = +h[(m + ((i * 24) | 0) + 8) >> 3];
+                    d = (d - g) / +((i - e) | 0);
+                    d = d > 0.03490658503988659 ? 0.03490658503988659 : d;
+                    g = 0.0;
+                    while (1) {
+                      if ((e | 0) >= (i | 0)) continue b;
+                      k = (m + ((e * 24) | 0) + 8) | 0;
+                      h[k >> 3] = +h[k >> 3] + g;
+                      g = g + d;
+                      e = (e + 1) | 0;
+                    }
+                  }
+                }
+              while (0);
+              return m | 0;
+            }
+            function Yo(a, d, e, f, g) {
+              a = a | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = +g;
+              var i = 0,
+                j = 0,
+                k = 0,
+                l = 0.0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0.0,
+                q = 0;
+              k = c[d >> 2] | 0;
+              n = c[(k + 16) >> 2] | 0;
+              m = b[(n + 168) >> 1] | 0;
+              o = (m << 16) >> 16;
+              j = c[k >> 2] & 3;
+              i = c[(((j | 0) == 2 ? k : (k + -48) | 0) + 40) >> 2] | 0;
+              if ((i | 0) == (a | 0)) i = c[(((j | 0) == 3 ? k : (k + 48) | 0) + 40) >> 2] | 0;
+              p = +h[(d + 8) >> 3];
+              g = (g - p) / +((m << 16) >> 16);
+              g = g > 0.03490658503988659 ? 0.03490658503988659 : g;
+              m = i >>> 0 > a >>> 0;
+              l = m ? g : -g;
+              d = m ? 1 : -1;
+              k = 0;
+              i = c[(n + 172) >> 2] | 0;
+              j = m ? f : (f + -1 + o) | 0;
+              g = m ? p : g * +((o + -1) | 0) + p;
+              while (1) {
+                if ((k | 0) >= (o | 0)) break;
+                n = c[i >> 2] | 0;
+                c[(e + (j << 4)) >> 2] = n;
+                m = c[n >> 2] & 3;
+                q = (m | 0) == 3 ? n : (n + 48) | 0;
+                c[(e + (j << 4) + 4) >> 2] =
+                  c[
+                    (((c[((c[((c[(q + 40) >> 2] | 0) + 16) >> 2] | 0) + 164) >> 2] | 0) == (a | 0)
+                      ? q
+                      : (m | 0) == 2
+                        ? n
+                        : (n + -48) | 0) +
+                      40) >>
+                      2
+                  ];
+                h[(e + (j << 4) + 8) >> 3] = g;
+                k = (k + 1) | 0;
+                i = (i + 4) | 0;
+                j = (j + d) | 0;
+                g = g + l;
+              }
+              return (o + f) | 0;
+            }
+            function Zo(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0,
+                d = 0.0;
+              c = +h[(a + 8) >> 3];
+              d = +h[(b + 8) >> 3];
+              if (!(c > d))
+                if (!(c < d)) {
+                  d = +h[(a + 16) >> 3];
+                  c = +h[(b + 16) >> 3];
+                  if (d > c) a = 1;
+                  else a = ((d < c) << 31) >> 31;
+                } else a = -1;
+              else a = 1;
+              return a | 0;
+            }
+            function _o(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0;
+              d = GA(a, 0, c, 0) | 0;
+              do
+                if (d | 0) {
+                  a = RA(a, d) | 0;
+                  d = GA(b, 0, c, 0) | 0;
+                  if (!d) {
+                    GA(b, 0, c, a) | 0;
+                    break;
+                  } else {
+                    KA(b, d, a) | 0;
+                    break;
+                  }
+                }
+              while (0);
+              return;
+            }
+            function $o(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                f = 0;
+              b = tC(a, b, 1) | 0;
+              TC(b, 137447, 304, 1) | 0;
+              f = JK(32) | 0;
+              d = (b + 16) | 0;
+              c[((c[d >> 2] | 0) + 112) >> 2] = f;
+              a = KK((e[((c[(a + 16) >> 2] | 0) + 176) >> 1] | 0) << 3) | 0;
+              c[((c[d >> 2] | 0) + 132) >> 2] = a;
+              return b | 0;
+            }
+            function ap(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              q = l;
+              l = (l + 80) | 0;
+              n = (q + 56) | 0;
+              m = (q + 32) | 0;
+              p = q;
+              o = (q + 64) | 0;
+              i = c[(e + 4) >> 2] | 0;
+              k = RA(b, i) | 0;
+              do
+                if (a[k >> 0] | 0) {
+                  if ((c[e >> 2] | 0) != (b | 0)) {
+                    e = RA(QD(b) | 0, i) | 0;
+                    if ((e | 0) == (k | 0)) break;
+                    if (!(s2(k, e) | 0)) break;
+                  }
+                  a[o >> 0] = 0;
+                  e = (p + 8) | 0;
+                  i = (p + 16) | 0;
+                  j = (p + 24) | 0;
+                  c[m >> 2] = p;
+                  c[(m + 4) >> 2] = e;
+                  c[(m + 8) >> 2] = i;
+                  c[(m + 12) >> 2] = j;
+                  c[(m + 16) >> 2] = o;
+                  if ((b5(k, 90937, m) | 0) <= 3) {
+                    c[n >> 2] = KB(b) | 0;
+                    c[(n + 4) >> 2] = k;
+                    gA(0, 90955, n) | 0;
+                    break;
+                  }
+                  g = +h[23293];
+                  if (g > 0.0) {
+                    h[p >> 3] = +h[p >> 3] / g;
+                    h[e >> 3] = +h[e >> 3] / g;
+                    h[i >> 3] = +h[i >> 3] / g;
+                    h[j >> 3] = +h[j >> 3] / g;
+                  }
+                  e = a[o >> 0] | 0;
+                  if ((e << 24) >> 24 == 33) a[((c[(d + 16) >> 2] | 0) + 119) >> 0] = 3;
+                  else a[((c[(d + 16) >> 2] | 0) + 119) >> 0] = (e << 24) >> 24 == 63 ? 2 : 1;
+                  c[f >> 2] = c[p >> 2];
+                  c[(f + 4) >> 2] = c[(p + 4) >> 2];
+                  c[(f + 8) >> 2] = c[(p + 8) >> 2];
+                  c[(f + 12) >> 2] = c[(p + 12) >> 2];
+                  c[(f + 16) >> 2] = c[(p + 16) >> 2];
+                  c[(f + 20) >> 2] = c[(p + 20) >> 2];
+                  c[(f + 24) >> 2] = c[(p + 24) >> 2];
+                  c[(f + 28) >> 2] = c[(p + 28) >> 2];
+                }
+              while (0);
+              l = q;
+              return;
+            }
+            function bp(a, d) {
+              a = a | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              g = (a + 16) | 0;
+              f = c[g >> 2] | 0;
+              a = b[(f + 168) >> 1] | 0;
+              f = c[(f + 172) >> 2] | 0;
+              if (!f) {
+                a = (a << 16) >> 16;
+                e = a;
+                a = KK(((a << 2) + 4) | 0) | 0;
+              } else {
+                a = (a << 16) >> 16;
+                e = a;
+                a = MK(f, ((a << 2) + 4) | 0) | 0;
+              }
+              c[(a + (e << 2)) >> 2] = d;
+              d = c[g >> 2] | 0;
+              c[(d + 172) >> 2] = a;
+              d = (d + 168) | 0;
+              b[d >> 1] = (((b[d >> 1] | 0) + 1) << 16) >> 16;
+              return;
+            }
+            function cp(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              i = l;
+              l = (l + 48) | 0;
+              h = (i + 24) | 0;
+              g = i;
+              e = c[b >> 2] | 0;
+              d = c[e >> 2] & 3;
+              f = c[(((d | 0) == 2 ? e : (e + -48) | 0) + 40) >> 2] | 0;
+              d = c[(((d | 0) == 3 ? e : (e + 48) | 0) + 40) >> 2] | 0;
+              b = l2(KB(a) | 0) | 0;
+              j = l2(KB(f) | 0) | 0;
+              j = ((b + 8 + j + (l2(KB(d) | 0) | 0)) | 0) > 999;
+              b = KB(a) | 0;
+              if (j) {
+                d = KB(d) | 0;
+                j = KB(f) | 0;
+                h = (c[e >> 2] | 0) >>> 4;
+                c[g >> 2] = b;
+                c[(g + 4) >> 2] = d;
+                c[(g + 8) >> 2] = j;
+                j = (g + 16) | 0;
+                c[j >> 2] = h;
+                c[(j + 4) >> 2] = 0;
+                m4(193772, 90895, g) | 0;
+              } else {
+                d = c[((c[(d + 16) >> 2] | 0) + 120) >> 2] | 0;
+                j = c[((c[(f + 16) >> 2] | 0) + 120) >> 2] | 0;
+                g = (c[e >> 2] | 0) >>> 4;
+                c[h >> 2] = b;
+                c[(h + 4) >> 2] = d;
+                c[(h + 8) >> 2] = j;
+                j = (h + 16) | 0;
+                c[j >> 2] = g;
+                c[(j + 4) >> 2] = 0;
+                m4(193772, 90914, h) | 0;
+              }
+              l = i;
+              return;
+            }
+            function dp(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0,
+                f = 0.0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0;
+              j = 4;
+              i = T1(40) | 0;
+              c[i >> 2] = 0;
+              g = +h[23293];
+              o = 0;
+              f = +Z(1, a | 0);
+              d = o;
+              o = 0;
+              if (((d | 0) != 0) & ((p | 0) != 0)) {
+                e = V6(c[d >> 2] | 0, i | 0, j | 0) | 0;
+                if (!e) bb(d | 0, p | 0);
+                z = p;
+              } else e = -1;
+              if ((e | 0) != 1) {
+                h[23293] = f;
+                o = 0;
+                ia(102, a | 0);
+                d = o;
+                o = 0;
+                if (((d | 0) != 0) & ((p | 0) != 0)) {
+                  e = V6(c[d >> 2] | 0, i | 0, j | 0) | 0;
+                  if (!e) bb(d | 0, p | 0);
+                  z = p;
+                } else e = -1;
+                if ((e | 0) != 1) {
+                  i = U6(187212, 1, i | 0, j | 0) | 0;
+                  j = z;
+                  o = 0;
+                  e = o;
+                  o = 0;
+                  if (((e | 0) != 0) & ((p | 0) != 0)) {
+                    d = V6(c[e >> 2] | 0, i | 0, j | 0) | 0;
+                    if (!d) bb(e | 0, p | 0);
+                    z = p;
+                  } else d = -1;
+                  if ((d | 0) != 1) d = 0;
+                  else d = z;
+                } else d = z;
+              } else d = z;
+              while (1) {
+                if (d | 0) break;
+                o = 0;
+                ia(103, a | 0);
+                d = o;
+                o = 0;
+                if (((d | 0) != 0) & ((p | 0) != 0)) {
+                  e = V6(c[d >> 2] | 0, i | 0, j | 0) | 0;
+                  if (!e) bb(d | 0, p | 0);
+                  z = p;
+                } else e = -1;
+                if ((e | 0) == 1) {
+                  d = z;
+                  continue;
+                }
+                o = 0;
+                $(22, a | 0) | 0;
+                d = o;
+                o = 0;
+                if (((d | 0) != 0) & ((p | 0) != 0)) {
+                  e = V6(c[d >> 2] | 0, i | 0, j | 0) | 0;
+                  if (!e) bb(d | 0, p | 0);
+                  z = p;
+                } else e = -1;
+                if ((e | 0) == 1) {
+                  d = z;
+                  continue;
+                }
+                if (b[((c[(a + 16) >> 2] | 0) + 136) >> 1] & 14) {
+                  o = 0;
+                  ia(104, a | 0);
+                  d = o;
+                  o = 0;
+                  if (((d | 0) != 0) & ((p | 0) != 0)) {
+                    e = V6(c[d >> 2] | 0, i | 0, j | 0) | 0;
+                    if (!e) bb(d | 0, p | 0);
+                    z = p;
+                  } else e = -1;
+                  if ((e | 0) == 1) {
+                    d = z;
+                    continue;
+                  }
+                }
+                o = 0;
+                ja(22, a | 0, 0);
+                d = o;
+                o = 0;
+                if (((d | 0) != 0) & ((p | 0) != 0)) {
+                  e = V6(c[d >> 2] | 0, i | 0, j | 0) | 0;
+                  if (!e) bb(d | 0, p | 0);
+                  z = p;
+                } else e = -1;
+                if ((e | 0) == 1) d = z;
+                else {
+                  k = 12;
+                  break;
+                }
+              }
+              if ((k | 0) == 12) h[23293] = g;
+              U1(i | 0);
+              return;
+            }
+            function ep(a) {
+              a = a | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 16) | 0;
+              g = i;
+              e = (a + 16) | 0;
+              f = b[((c[e >> 2] | 0) + 136) >> 1] & 14;
+              d = f & 65535;
+              if ((f & 65535) > 8) {
+                if ((f << 16) >> 16 == 12) {
+                  if (Um(a, 22, 10) | 0) {
+                    c[47134] = 2;
+                    h = 5;
+                  }
+                } else h = 5;
+                do
+                  if ((h | 0) == 5)
+                    if (!(b[((c[e >> 2] | 0) + 136) >> 1] & 1)) {
+                      Wm(a, d) | 0;
+                      break;
+                    } else {
+                      gA(0, 90998, g) | 0;
+                      d = 2;
+                      break;
+                    }
+                while (0);
+                c[47134] = 0;
+              }
+              if ((c[47138] | 0) < 1) Wm(a, d) | 0;
+              l = i;
+              return;
+            }
+            function fp(a) {
+              a = a | 0;
+              var b = 0.0,
+                d = 0.0,
+                e = 0;
+              e = l;
+              l = (l + 16) | 0;
+              c[46474] = 1;
+              c[46475] = 1;
+              c[46477] = -1;
+              c[46479] = 50;
+              h[23245] = 0.0;
+              h[23240] = 0.0;
+              h[23241] = 1.0;
+              c[46478] = ZO(a, GA(a, 0, 91061, 0) | 0, 600, 0) | 0;
+              d = +_O(a, GA(a, 0, 91202, 0) | 0, 0.3, 0.0);
+              h[23242] = d;
+              h[1371] = d;
+              if (-1.0 == -1.0) b = +_O(a, GA(a, 0, 91069, 0) | 0, -1.0, 0.0);
+              else b = -1.0;
+              h[23243] = b;
+              c[46476] = 1;
+              a = mm(a, 2, 185904) | 0;
+              c[46488] = a;
+              if (!a) {
+                gA(0, 91072, e) | 0;
+                c[46476] = 2;
+              }
+              c[46504] = ((O(c[46478] | 0, c[46479] | 0) | 0) / 100) | 0;
+              d = +h[23242];
+              h[23247] = d * d;
+              if (c[46474] | 0) {
+                b = +h[23245];
+                if (b <= 0.0) {
+                  b = d * 3.0;
+                  h[23245] = b;
+                }
+                h[23246] = b * b;
+              }
+              l = e;
+              return;
+            }
+            function gp(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0.0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 16) | 0;
+              d = j;
+              g = c[c[((c[(a + 16) >> 2] | 0) + 140) >> 2] >> 2] | 0;
+              i = hp(a, b) | 0;
+              ip(d, a, g);
+              e = +h[d >> 3];
+              f = +h[(d + 8) >> 3];
+              a: do
+                if (!(c[46474] | 0)) {
+                  b = 0;
+                  while (1) {
+                    if ((b | 0) >= (c[46505] | 0)) break a;
+                    lp(a, +jp(b), g);
+                    b = (b + 1) | 0;
+                  }
+                } else {
+                  d = Kv(tB(a) | 0) | 0;
+                  Pv(d, tB(a) | 0);
+                  b = 0;
+                  while (1) {
+                    if ((b | 0) >= (c[46505] | 0)) break;
+                    kp(a, +jp(b), g, d);
+                    b = (b + 1) | 0;
+                  }
+                  Rv(d);
+                }
+              while (0);
+              b: do
+                if ((e != 0.0) | (f != 0.0)) {
+                  b = jC(a) | 0;
+                  while (1) {
+                    if (!b) break b;
+                    g = c[((c[(b + 16) >> 2] | 0) + 132) >> 2] | 0;
+                    h[g >> 3] = +h[g >> 3] + e;
+                    g = (g + 8) | 0;
+                    h[g >> 3] = +h[g >> 3] + f;
+                    b = kC(a, b) | 0;
+                  }
+                }
+              while (0);
+              if (i | 0) mp();
+              l = j;
+              return;
+            }
+            function hp(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0;
+              if (+h[23243] == -1.0) {
+                i = tB(a) | 0;
+                d = +h[23242];
+                h[23243] = +h[23241] * 0.2 * d * +C(+(+(i | 0)));
+                i = 1;
+              } else {
+                i = 0;
+                d = +h[23242];
+              }
+              g = c[46504] | 0;
+              h[(b + 8) >> 3] = +jp(g);
+              h[(b + 16) >> 3] = d;
+              h[(b + 24) >> 3] = +h[23240];
+              e = c[46478] | 0;
+              a = (e - g) | 0;
+              c[b >> 2] = a;
+              f = c[46477] | 0;
+              do
+                if ((f | 0) > -1) {
+                  if ((f | 0) <= (g | 0)) {
+                    c[46505] = f;
+                    a = 0;
+                    j = 10;
+                    break;
+                  }
+                  if ((f | 0) <= (e | 0)) {
+                    c[46505] = g;
+                    a = (f - g) | 0;
+                    j = 10;
+                  }
+                } else {
+                  c[46505] = g;
+                  j = 10;
+                }
+              while (0);
+              if ((j | 0) == 10) c[(b + 32) >> 2] = a;
+              return i | 0;
+            }
+            function ip(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0.0,
+                j = 0.0,
+                k = 0,
+                l = 0.0,
+                m = 0.0,
+                n = 0,
+                o = 0.0,
+                p = 0.0,
+                q = 0,
+                r = 0,
+                s = 0.0,
+                t = 0.0,
+                u = 0,
+                v = 0,
+                w = 0.0,
+                x = 0,
+                y = 0,
+                z = 0;
+              v = tB(d) | 0;
+              x = c[((c[((c[(d + 16) >> 2] | 0) + 140) >> 2] | 0) + 4) >> 2] | 0;
+              u = jC(d) | 0;
+              q = 0;
+              r = 0;
+              g = 0;
+              k = 0;
+              n = 0;
+              while (1) {
+                if (!u) break;
+                f = c[(u + 16) >> 2] | 0;
+                if (!(a[(f + 119) >> 0] | 0)) f = r;
+                else {
+                  f = c[(f + 132) >> 2] | 0;
+                  i = +h[f >> 3];
+                  if (!q) {
+                    k = ~~i;
+                    g = ~~+h[(f + 8) >> 3];
+                    n = g;
+                    f = k;
+                  } else {
+                    p = +(r | 0);
+                    s = +h[(f + 8) >> 3];
+                    t = +(g | 0);
+                    w = +(k | 0);
+                    o = +(n | 0);
+                    n = ~~(s > o ? s : o);
+                    f = ~~(i < p ? i : p);
+                    g = ~~(s < t ? s : t);
+                    k = ~~(i > w ? i : w);
+                  }
+                  q = (q + 1) | 0;
+                }
+                u = kC(d, u) | 0;
+                r = f;
+              }
+              i = +h[23242] * (+C(+(+((v - x) | 0))) + 1.0);
+              s = i * 0.6;
+              h[23249] = s;
+              h[23248] = s;
+              if ((q | 0) != 1)
+                if ((q | 0) > 1) {
+                  t = +((k + r) | 0) * 0.5;
+                  w = +((n + g) | 0) * 0.5;
+                  o = +((k - r) | 0);
+                  p = o * 1.2;
+                  l = +((n - g) | 0);
+                  m = l * 1.2;
+                  i = i * 2.4 * s;
+                  j = (m * p) / i;
+                  do
+                    if (!(j >= 1.0)) {
+                      if (j > 0.0) {
+                        i = +C(+j) * 2.0;
+                        j = p / i;
+                        h[23248] = j;
+                        i = m / i;
+                        z = 20;
+                        break;
+                      }
+                      if (p > 0.0) {
+                        j = o * 0.6;
+                        h[23248] = j;
+                        i = (i / p) * 0.5;
+                        z = 20;
+                        break;
+                      }
+                      if (m > 0.0) {
+                        j = (i / m) * 0.5;
+                        h[23248] = j;
+                        i = l * 0.6;
+                        z = 20;
+                      } else {
+                        i = s;
+                        j = s;
+                      }
+                    } else {
+                      j = o * 0.6;
+                      h[23248] = j;
+                      i = l * 0.6;
+                      z = 20;
+                    }
+                  while (0);
+                  if ((z | 0) == 20) h[23249] = i;
+                  s = +K(+i, +j);
+                  j = j / +E(+s);
+                  h[23248] = j;
+                  i = i / +F(+s);
+                  h[23249] = i;
+                } else {
+                  t = 0.0;
+                  w = 0.0;
+                  j = s;
+                  i = s;
+                }
+              else {
+                t = +(r | 0);
+                w = +(g | 0);
+                j = s;
+                i = s;
+              }
+              h[23250] = j * j;
+              h[23251] = i * i;
+              if ((c[46488] | 0) == 2) f = c[46476] | 0;
+              else {
+                f = X4() | 0;
+                f = (db(0) | 0) ^ f;
+              }
+              z5(f);
+              a: do
+                if (!e) {
+                  e = jC(d) | 0;
+                  if (!q)
+                    while (1) {
+                      if (!e) break a;
+                      s = +h[23248];
+                      s = (+B5() * 2.0 + -1.0) * s;
+                      z = (e + 16) | 0;
+                      h[c[((c[z >> 2] | 0) + 132) >> 2] >> 3] = s;
+                      s = +h[23249];
+                      s = (+B5() * 2.0 + -1.0) * s;
+                      h[((c[((c[z >> 2] | 0) + 132) >> 2] | 0) + 8) >> 3] = s;
+                      e = kC(d, e) | 0;
+                    }
+                  while (1) {
+                    if (!e) break a;
+                    f = (e + 16) | 0;
+                    g = c[f >> 2] | 0;
+                    if (!(a[(g + 119) >> 0] | 0)) {
+                      s = +h[23248];
+                      s = (+B5() * 2.0 + -1.0) * s;
+                      h[c[((c[f >> 2] | 0) + 132) >> 2] >> 3] = s;
+                      s = +h[23249];
+                      s = (+B5() * 2.0 + -1.0) * s;
+                      h[((c[((c[f >> 2] | 0) + 132) >> 2] | 0) + 8) >> 3] = s;
+                    } else {
+                      z = c[(g + 132) >> 2] | 0;
+                      h[z >> 3] = +h[z >> 3] - t;
+                      z = (z + 8) | 0;
+                      h[z >> 3] = +h[z >> 3] - w;
+                    }
+                    e = kC(d, e) | 0;
+                  }
+                } else {
+                  while (1) {
+                    if (!(c[e >> 2] | 0)) break;
+                    u = (e + 8) | 0;
+                    s = +E(+(+h[u >> 3])) * +h[23248] + t;
+                    x = c[((c[(e + 4) >> 2] | 0) + 16) >> 2] | 0;
+                    v = c[(x + 132) >> 2] | 0;
+                    h[v >> 3] = s;
+                    h[(v + 8) >> 3] = +F(+(+h[u >> 3])) * +h[23249] + w;
+                    a[(x + 119) >> 0] = 1;
+                    e = (e + 16) | 0;
+                  }
+                  l = t * 0.1;
+                  m = w * 0.1;
+                  r = jC(d) | 0;
+                  while (1) {
+                    if (!r) break a;
+                    q = (r + 16) | 0;
+                    e = c[q >> 2] | 0;
+                    if (!((c[((c[(e + 112) >> 2] | 0) + 8) >> 2] | 0) == 0 ? !(c[(e + 212) >> 2] | 0) : 0)) z = 32;
+                    do
+                      if ((z | 0) == 32) {
+                        z = 0;
+                        if (a[(e + 119) >> 0] | 0) {
+                          x = c[(e + 132) >> 2] | 0;
+                          h[x >> 3] = +h[x >> 3] - t;
+                          x = (x + 8) | 0;
+                          h[x >> 3] = +h[x >> 3] - w;
+                          break;
+                        }
+                        n = aB(d, r) | 0;
+                        e = 0;
+                        j = 0.0;
+                        i = 0.0;
+                        while (1) {
+                          if (!n) break;
+                          k = c[n >> 2] & 3;
+                          f = (k | 0) == 2 ? n : (n + -48) | 0;
+                          g = c[(f + 40) >> 2] | 0;
+                          k = (k | 0) == 3 ? n : (n + 48) | 0;
+                          do
+                            if (
+                              (g | 0) != (c[(k + 40) >> 2] | 0)
+                                ? ((y = c[((c[(((g | 0) == (r | 0) ? k : f) + 40) >> 2] | 0) + 16) >> 2] | 0),
+                                  (a[(y + 119) >> 0] | 0) != 0)
+                                : 0
+                            )
+                              if (!e) {
+                                x = c[(y + 132) >> 2] | 0;
+                                e = 1;
+                                j = +h[x >> 3];
+                                i = +h[(x + 8) >> 3];
+                                break;
+                              } else {
+                                p = +(e | 0);
+                                x = c[(y + 132) >> 2] | 0;
+                                e = (e + 1) | 0;
+                                s = +(e | 0);
+                                j = (+h[x >> 3] + j * p) / s;
+                                i = (+h[(x + 8) >> 3] + i * p) / s;
+                                break;
+                              }
+                          while (0);
+                          n = bB(d, n, r) | 0;
+                        }
+                        do
+                          if ((e | 0) <= 1)
+                            if ((e | 0) == 1) {
+                              f = c[q >> 2] | 0;
+                              e = c[(f + 132) >> 2] | 0;
+                              h[e >> 3] = j * 0.98 + l;
+                              i = i * 0.9 + m;
+                              break;
+                            } else {
+                              i = +B5() * 6.283185307179586;
+                              s = +B5() * 0.9;
+                              p = s * +h[23248] * +E(+i);
+                              f = c[q >> 2] | 0;
+                              e = c[(f + 132) >> 2] | 0;
+                              h[e >> 3] = p;
+                              i = +h[23249] * s * +F(+i);
+                              break;
+                            }
+                          else {
+                            f = c[q >> 2] | 0;
+                            e = c[(f + 132) >> 2] | 0;
+                            h[e >> 3] = j;
+                          }
+                        while (0);
+                        h[(e + 8) >> 3] = i;
+                        a[(f + 119) >> 0] = 1;
+                      }
+                    while (0);
+                    r = kC(d, r) | 0;
+                  }
+                }
+              while (0);
+              h[b >> 3] = t;
+              h[(b + 8) >> 3] = w;
+              return;
+            }
+            function jp(a) {
+              a = a | 0;
+              var b = 0;
+              b = c[46478] | 0;
+              return +((+h[23243] * +((b - a) | 0)) / +(b | 0));
+            }
+            function kp(a, b, d, e) {
+              a = a | 0;
+              b = +b;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0.0;
+              if (!(b <= 0.0)) {
+                Qv(e);
+                f = jC(a) | 0;
+                while (1) {
+                  if (!f) break;
+                  i = c[(f + 16) >> 2] | 0;
+                  g = ((c[(i + 112) >> 2] | 0) + 16) | 0;
+                  c[g >> 2] = 0;
+                  c[(g + 4) >> 2] = 0;
+                  c[(g + 8) >> 2] = 0;
+                  c[(g + 12) >> 2] = 0;
+                  i = c[(i + 132) >> 2] | 0;
+                  j = +h[23245];
+                  g = ~~+A(+(+h[i >> 3] / j));
+                  Tv(e, g, ~~+A(+(+h[(i + 8) >> 3] / j)), f);
+                  f = kC(a, f) | 0;
+                }
+                g = jC(a) | 0;
+                while (1) {
+                  if (!g) break;
+                  f = XA(a, g) | 0;
+                  while (1) {
+                    if (!f) break;
+                    i = c[((((c[f >> 2] & 3) | 0) == 2 ? f : (f + -48) | 0) + 40) >> 2] | 0;
+                    if ((g | 0) != (i | 0)) op(g, i, f);
+                    f = ZA(a, f) | 0;
+                  }
+                  g = kC(a, g) | 0;
+                }
+                Vv(e, 23);
+                pp(a, b, d);
+              }
+              return;
+            }
+            function lp(a, b, d) {
+              a = a | 0;
+              b = +b;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              if (!(b <= 0.0)) {
+                e = jC(a) | 0;
+                while (1) {
+                  if (!e) break;
+                  g = ((c[((c[(e + 16) >> 2] | 0) + 112) >> 2] | 0) + 16) | 0;
+                  c[g >> 2] = 0;
+                  c[(g + 4) >> 2] = 0;
+                  c[(g + 8) >> 2] = 0;
+                  c[(g + 12) >> 2] = 0;
+                  e = kC(a, e) | 0;
+                }
+                g = jC(a) | 0;
+                while (1) {
+                  if (!g) break;
+                  else e = g;
+                  while (1) {
+                    e = kC(a, e) | 0;
+                    if (!e) break;
+                    np(g, e);
+                  }
+                  e = XA(a, g) | 0;
+                  while (1) {
+                    if (!e) break;
+                    f = c[((((c[e >> 2] & 3) | 0) == 2 ? e : (e + -48) | 0) + 40) >> 2] | 0;
+                    if ((g | 0) != (f | 0)) op(g, f, e);
+                    e = ZA(a, e) | 0;
+                  }
+                  g = kC(a, g) | 0;
+                }
+                pp(a, b, d);
+              }
+              return;
+            }
+            function mp() {
+              h[23243] = -1.0;
+              return;
+            }
+            function np(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0,
+                g = 0;
+              g = c[((c[(b + 16) >> 2] | 0) + 132) >> 2] | 0;
+              f = c[((c[(a + 16) >> 2] | 0) + 132) >> 2] | 0;
+              d = +h[g >> 3] - +h[f >> 3];
+              e = +h[(g + 8) >> 3] - +h[(f + 8) >> 3];
+              qp(a, b, d, e, e * e + d * d);
+              return;
+            }
+            function op(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0;
+              j = (b + 16) | 0;
+              k = c[((c[j >> 2] | 0) + 132) >> 2] | 0;
+              a = (a + 16) | 0;
+              b = c[((c[a >> 2] | 0) + 132) >> 2] | 0;
+              e = +h[k >> 3] - +h[b >> 3];
+              f = +h[(k + 8) >> 3] - +h[(b + 8) >> 3];
+              g = e;
+              i = f;
+              e = e * e;
+              f = f * f;
+              while (1) {
+                e = e + f;
+                if (!(e == 0.0)) break;
+                e = +((5 - ((x5() | 0) % 10 | 0)) | 0);
+                f = +((5 - ((x5() | 0) % 10 | 0)) | 0);
+                g = e;
+                i = f;
+                e = e * e;
+                f = f * f;
+              }
+              f = +C(+e);
+              b = c[(d + 16) >> 2] | 0;
+              e = +h[(b + 128) >> 3];
+              if (!(c[46475] | 0)) e = (e * f) / +h[(b + 136) >> 3];
+              else e = ((f - +h[(b + 136) >> 3]) * e) / f;
+              g = e * g;
+              k = c[((c[j >> 2] | 0) + 112) >> 2] | 0;
+              j = (k + 16) | 0;
+              h[j >> 3] = +h[j >> 3] - g;
+              i = e * i;
+              k = (k + 24) | 0;
+              h[k >> 3] = +h[k >> 3] - i;
+              k = c[((c[a >> 2] | 0) + 112) >> 2] | 0;
+              j = (k + 16) | 0;
+              h[j >> 3] = +h[j >> 3] + g;
+              k = (k + 24) | 0;
+              h[k >> 3] = +h[k >> 3] + i;
+              return;
+            }
+            function pp(b, d, e) {
+              b = b | 0;
+              d = +d;
+              e = e | 0;
+              var f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0.0;
+              o = d * d;
+              n = (e | 0) == 0;
+              m = jC(b) | 0;
+              while (1) {
+                if (!m) break;
+                l = c[(m + 16) >> 2] | 0;
+                if (!(a[(l + 119) >> 0] & 2)) {
+                  k = c[(l + 112) >> 2] | 0;
+                  f = +h[(k + 16) >> 3];
+                  i = +h[(k + 24) >> 3];
+                  g = i * i + f * f;
+                  if (g < o) {
+                    e = c[(l + 132) >> 2] | 0;
+                    j = +h[e >> 3] + f;
+                    f = +h[(e + 8) >> 3] + i;
+                  } else {
+                    g = d / +C(+g);
+                    e = c[(l + 132) >> 2] | 0;
+                    j = +h[e >> 3] + g * f;
+                    f = +h[(e + 8) >> 3] + g * i;
+                  }
+                  do
+                    if (!n) {
+                      g = +C(+((f * f) / +h[23251] + (j * j) / +h[23250]));
+                      if ((c[(k + 8) >> 2] | 0) == 0 ? (c[(l + 212) >> 2] | 0) == 0 : 0) {
+                        h[e >> 3] = j / g;
+                        f = f / g;
+                        break;
+                      }
+                      if (!(g >= 1.0)) {
+                        h[e >> 3] = j;
+                        break;
+                      } else {
+                        h[e >> 3] = (j * 0.95) / g;
+                        f = (f * 0.95) / g;
+                        break;
+                      }
+                    } else h[e >> 3] = j;
+                  while (0);
+                  h[(e + 8) >> 3] = f;
+                }
+                m = kC(b, m) | 0;
+              }
+              return;
+            }
+            function qp(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = +d;
+              e = +e;
+              f = +f;
+              var g = 0.0,
+                i = 0,
+                j = 0;
+              g = d;
+              d = f;
+              while (1) {
+                if (!(d == 0.0)) break;
+                d = +((5 - ((x5() | 0) % 10 | 0)) | 0);
+                e = +((5 - ((x5() | 0) % 10 | 0)) | 0);
+                g = d;
+                d = e * e + d * d;
+              }
+              if (!(c[46475] | 0)) d = +h[23247] / d;
+              else {
+                f = +C(+d);
+                d = +h[23247] / (f * d);
+              }
+              j = c[(a + 16) >> 2] | 0;
+              a = c[(j + 112) >> 2] | 0;
+              if (
+                ((c[(a + 8) >> 2] | 0) == 0 ? (c[(j + 212) >> 2] | 0) == 0 : 0)
+                  ? ((i = c[(b + 16) >> 2] | 0), (c[((c[(i + 112) >> 2] | 0) + 8) >> 2] | 0) == 0)
+                  : 0
+              )
+                d = (c[(i + 212) >> 2] | 0) == 0 ? d * 10.0 : d;
+              f = d * g;
+              j = c[((c[(b + 16) >> 2] | 0) + 112) >> 2] | 0;
+              b = (j + 16) | 0;
+              h[b >> 3] = +h[b >> 3] + f;
+              g = d * e;
+              j = (j + 24) | 0;
+              h[j >> 3] = +h[j >> 3] + g;
+              j = (a + 16) | 0;
+              h[j >> 3] = +h[j >> 3] - f;
+              j = (a + 24) | 0;
+              h[j >> 3] = +h[j >> 3] - g;
+              return;
+            }
+            function rp(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              f = c[(b + 8) >> 2] | 0;
+              g = c[b >> 2] | 0;
+              e = c[(b + 4) >> 2] | 0;
+              b = f;
+              while (1) {
+                if (!b) break;
+                a = f;
+                while (1) {
+                  if (!a) break;
+                  if ((b | 0) != (a | 0)) np(c[b >> 2] | 0, c[a >> 2] | 0);
+                  a = c[(a + 4) >> 2] | 0;
+                }
+                b = c[(b + 4) >> 2] | 0;
+              }
+              h = (g + -1) | 0;
+              a = (e + -1) | 0;
+              sp(d, h, a, f);
+              sp(d, h, e, f);
+              b = (e + 1) | 0;
+              sp(d, h, b, f);
+              sp(d, g, a, f);
+              sp(d, g, b, f);
+              g = (g + 1) | 0;
+              sp(d, g, a, f);
+              sp(d, g, e, f);
+              sp(d, g, b, f);
+              return 0;
+            }
+            function sp(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              a = Wv(a, b, d) | 0;
+              if (((e | 0) != 0) & ((a | 0) != 0)) {
+                k = (a + 8) | 0;
+                do {
+                  d = c[e >> 2] | 0;
+                  j = (d + 16) | 0;
+                  a = k;
+                  while (1) {
+                    a = c[a >> 2] | 0;
+                    if (!a) break;
+                    b = c[a >> 2] | 0;
+                    m = c[((c[(b + 16) >> 2] | 0) + 132) >> 2] | 0;
+                    l = c[((c[j >> 2] | 0) + 132) >> 2] | 0;
+                    f = +h[m >> 3] - +h[l >> 3];
+                    g = +h[(m + 8) >> 3] - +h[(l + 8) >> 3];
+                    i = g * g + f * f;
+                    if (i < +h[23246]) qp(d, b, f, g, i);
+                    a = (a + 4) | 0;
+                  }
+                  e = c[(e + 4) >> 2] | 0;
+                } while ((e | 0) != 0);
+              }
+              return;
+            }
+            function tp(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              h = l;
+              l = (l + 16) | 0;
+              g = h;
+              e = QA(b, 92507) | 0;
+              if (0) U4(91116, 8, 1, c[15712] | 0) | 0;
+              if (!((e | 0) != 0 ? (a[e >> 0] | 0) != 0 : 0)) e = 91125;
+              f = R2(e, 58) | 0;
+              do
+                if (!f) f = 0;
+                else {
+                  if ((f | 0) != (e | 0) ? (((a[e >> 0] | 0) + -48) | 0) >>> 0 >= 10 : 0) {
+                    f = 0;
+                    break;
+                  }
+                  i = q5(e) | 0;
+                  e = (f + 1) | 0;
+                  f = (i | 0) > 0 ? i : 0;
+                }
+              while (0);
+              if (0) {
+                i = c[15712] | 0;
+                c[g >> 2] = f;
+                c[(g + 4) >> 2] = e;
+                w4(i, 91133, g) | 0;
+              }
+              if (!((f | 0) != 0 ? !(up(b, d, f) | 0) : 0)) nr(b, e) | 0;
+              l = h;
+              return;
+            }
+            function up(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0,
+                r = 0,
+                s = 0,
+                t = 0;
+              t = l;
+              l = (l + 64) | 0;
+              r = t;
+              j = (t + 40) | 0;
+              s = tB(b) | 0;
+              k = uB(b) | 0;
+              lr(j, b);
+              c[46842] = c[j >> 2];
+              c[46843] = c[(j + 4) >> 2];
+              c[46844] = c[(j + 8) >> 2];
+              if (a[187376] | 0) {
+                g[46842] = +g[46842] * 0.013888888888888888;
+                g[46843] = +g[46843] * 0.013888888888888888;
+              }
+              f = vp(b) | 0;
+              a: do
+                if (!f) f = 0;
+                else {
+                  j = r;
+                  i = (j + 40) | 0;
+                  do {
+                    c[j >> 2] = c[d >> 2];
+                    j = (j + 4) | 0;
+                    d = (d + 4) | 0;
+                  } while ((j | 0) < (i | 0));
+                  j = (r + 16) | 0;
+                  q = +h[j >> 3];
+                  o = +(k | 0) * 2.0;
+                  p = 1.0 / +(O((s + -1) | 0, s) | 0);
+                  i = 0;
+                  n = q;
+                  while (1) {
+                    if (!(((f | 0) != 0) & ((i | 0) < (e | 0)))) break a;
+                    wp(s, r);
+                    m = +h[23253] * +h[170];
+                    h[23254] = m;
+                    h[23255] = o * m * p;
+                    d = 0;
+                    while (1) {
+                      if ((d | 0) >= (c[46512] | 0)) break;
+                      m = +xp(d);
+                      if (m <= 0.0) break;
+                      f = yp(b, m) | 0;
+                      if (!f) {
+                        f = 0;
+                        break;
+                      } else d = (d + 1) | 0;
+                    }
+                    m = n + q;
+                    h[j >> 3] = m;
+                    i = (i + 1) | 0;
+                    n = m;
+                  }
+                }
+              while (0);
+              l = t;
+              return f | 0;
+            }
+            function vp(a) {
+              a = a | 0;
+              var b = 0,
+                c = 0,
+                d = 0,
+                e = 0;
+              b = 0;
+              e = jC(a) | 0;
+              while (1) {
+                if (!e) break;
+                else d = e;
+                while (1) {
+                  c = kC(a, d) | 0;
+                  if (!c) break;
+                  d = c;
+                  b = ((Bp(e, c) | 0) + b) | 0;
+                }
+                e = kC(a, e) | 0;
+              }
+              return b | 0;
+            }
+            function wp(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0.0;
+              e = +h[(b + 16) >> 3];
+              h[171] = e;
+              c[344] = c[b >> 2];
+              f = +h[(b + 8) >> 3];
+              h[23257] = f;
+              c[46512] = c[(b + 32) >> 2];
+              d = +h[(b + 24) >> 3];
+              if (d > 0.0) h[170] = d;
+              h[23253] = e * e;
+              if (f == 0.0) h[23257] = +C(+(+(a | 0))) * 0.2 * e;
+              return;
+            }
+            function xp(a) {
+              a = a | 0;
+              var b = 0;
+              b = c[344] | 0;
+              return +((+h[23257] * +((b - a) | 0)) / +(b | 0));
+            }
+            function yp(b, d) {
+              b = b | 0;
+              d = +d;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0.0,
+                j = 0,
+                k = 0.0,
+                l = 0.0,
+                m = 0.0;
+              e = jC(b) | 0;
+              while (1) {
+                if (!e) break;
+                j = ((c[((c[(e + 16) >> 2] | 0) + 112) >> 2] | 0) + 16) | 0;
+                c[j >> 2] = 0;
+                c[(j + 4) >> 2] = 0;
+                c[(j + 8) >> 2] = 0;
+                c[(j + 12) >> 2] = 0;
+                e = kC(b, e) | 0;
+              }
+              e = 0;
+              j = jC(b) | 0;
+              while (1) {
+                if (!j) break;
+                else g = j;
+                while (1) {
+                  f = kC(b, g) | 0;
+                  if (!f) break;
+                  g = f;
+                  e = ((zp(j, f) | 0) + e) | 0;
+                }
+                f = XA(b, j) | 0;
+                while (1) {
+                  if (!f) break;
+                  Ap(j, c[((((c[f >> 2] & 3) | 0) == 2 ? f : (f + -48) | 0) + 40) >> 2] | 0);
+                  f = ZA(b, f) | 0;
+                }
+                j = kC(b, j) | 0;
+              }
+              a: do
+                if (!e) e = 0;
+                else {
+                  m = d * d;
+                  g = jC(b) | 0;
+                  while (1) {
+                    if (!g) break a;
+                    f = c[(g + 16) >> 2] | 0;
+                    if ((a[(f + 119) >> 0] | 0) != 3) {
+                      j = c[(f + 112) >> 2] | 0;
+                      k = +h[(j + 16) >> 3];
+                      i = +h[(j + 24) >> 3];
+                      l = i * i + k * k;
+                      if (l < m) {
+                        f = c[(f + 132) >> 2] | 0;
+                        h[f >> 3] = +h[f >> 3] + k;
+                      } else {
+                        l = +C(+l);
+                        f = c[(f + 132) >> 2] | 0;
+                        h[f >> 3] = +h[f >> 3] + (k * d) / l;
+                        i = (i * d) / l;
+                      }
+                      j = (f + 8) | 0;
+                      h[j >> 3] = +h[j >> 3] + i;
+                    }
+                    g = kC(b, g) | 0;
+                  }
+                }
+              while (0);
+              return e | 0;
+            }
+            function zp(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0,
+                g = 0;
+              g = c[((c[(b + 16) >> 2] | 0) + 132) >> 2] | 0;
+              f = c[((c[(a + 16) >> 2] | 0) + 132) >> 2] | 0;
+              d = +h[g >> 3] - +h[f >> 3];
+              e = +h[(g + 8) >> 3] - +h[(f + 8) >> 3];
+              return Dp(a, b, d, e, e * e + d * d) | 0;
+            }
+            function Ap(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0,
+                g = 0.0,
+                i = 0,
+                j = 0.0,
+                k = 0.0,
+                l = 0,
+                m = 0;
+              if (!(Bp(a, b) | 0)) {
+                i = c[(b + 16) >> 2] | 0;
+                m = c[(i + 132) >> 2] | 0;
+                f = c[(a + 16) >> 2] | 0;
+                l = c[(f + 132) >> 2] | 0;
+                e = +h[m >> 3] - +h[l >> 3];
+                d = +h[(m + 8) >> 3] - +h[(l + 8) >> 3];
+                g = +C(+(d * d + e * e));
+                j = +Cp(a);
+                j = +Cp(b) + j;
+                k = g - j;
+                g = (k * k) / ((+h[171] + j) * g);
+                e = g * e;
+                b = c[(i + 112) >> 2] | 0;
+                a = (b + 16) | 0;
+                h[a >> 3] = +h[a >> 3] - e;
+                d = g * d;
+                b = (b + 24) | 0;
+                h[b >> 3] = +h[b >> 3] - d;
+                b = c[(f + 112) >> 2] | 0;
+                a = (b + 16) | 0;
+                h[a >> 3] = +h[a >> 3] + e;
+                b = (b + 24) | 0;
+                h[b >> 3] = +h[b >> 3] + d;
+              }
+              return;
+            }
+            function Bp(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0,
+                l = 0;
+              k = c[(d + 16) >> 2] | 0;
+              l = c[(k + 132) >> 2] | 0;
+              d = c[(b + 16) >> 2] | 0;
+              b = c[(d + 132) >> 2] | 0;
+              i = +h[l >> 3] - +h[b >> 3];
+              j = +h[(l + 8) >> 3] - +h[(b + 8) >> 3];
+              j = j < 0.0 ? -j : j;
+              b = (a[187376] | 0) == 0;
+              e = +h[(d + 32) >> 3];
+              if (b) {
+                f = +g[46842];
+                e = e * 0.5 * f;
+                f = +h[(k + 32) >> 3] * 0.5 * f;
+              } else {
+                f = +g[46842];
+                e = e * 0.5 + f;
+                f = +h[(k + 32) >> 3] * 0.5 + f;
+              }
+              if (!((i < 0.0 ? -i : i) <= f + e)) d = 0;
+              else {
+                e = +h[(d + 40) >> 3];
+                if (b) {
+                  i = +g[46843];
+                  f = e * 0.5 * i;
+                  e = +h[(k + 40) >> 3] * 0.5 * i;
+                } else {
+                  i = +g[46843];
+                  f = e * 0.5 + i;
+                  e = +h[(k + 40) >> 3] * 0.5 + i;
+                }
+                d = (j <= e + f) & 1;
+              }
+              return d | 0;
+            }
+            function Cp(b) {
+              b = b | 0;
+              var d = 0.0,
+                e = 0.0;
+              b = c[(b + 16) >> 2] | 0;
+              d = +h[(b + 32) >> 3];
+              if (!(a[187376] | 0)) {
+                e = d * 0.5 * +g[46842];
+                d = +h[(b + 40) >> 3] * 0.5 * +g[46843];
+              } else {
+                e = d * 0.5 + +g[46842];
+                d = +h[(b + 40) >> 3] * 0.5 + +g[46843];
+              }
+              return +(+C(+(d * d + e * e)));
+            }
+            function Dp(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = +d;
+              e = +e;
+              f = +f;
+              var g = 0,
+                i = 0;
+              while (1) {
+                if (!(f == 0.0)) break;
+                f = +((5 - ((x5() | 0) % 10 | 0)) | 0);
+                e = +((5 - ((x5() | 0) % 10 | 0)) | 0);
+                d = f;
+                f = e * e + f * f;
+              }
+              g = Bp(a, b) | 0;
+              f = ((g | 0) == 0 ? +h[23255] : +h[23254]) / f;
+              d = f * d;
+              b = c[((c[(b + 16) >> 2] | 0) + 112) >> 2] | 0;
+              i = (b + 16) | 0;
+              h[i >> 3] = +h[i >> 3] + d;
+              f = f * e;
+              b = (b + 24) | 0;
+              h[b >> 3] = +h[b >> 3] + f;
+              b = c[((c[(a + 16) >> 2] | 0) + 112) >> 2] | 0;
+              a = (b + 16) | 0;
+              h[a >> 3] = +h[a >> 3] - d;
+              b = (b + 24) | 0;
+              h[b >> 3] = +h[b >> 3] - f;
+              return g | 0;
+            }
+            function Ep(a) {
+              a = a | 0;
+              oQ(a, 2);
+              b[((c[(a + 16) >> 2] | 0) + 176) >> 1] = 2;
+              c[47137] = 2;
+              Fp(a);
+              return;
+            }
+            function Fp(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              e = JK((tB(a) | 0) << 2) | 0;
+              b = JK((((tB(a) | 0) << 2) + 4) | 0) | 0;
+              f = (a + 16) | 0;
+              c[((c[f >> 2] | 0) + 152) >> 2] = b;
+              b = jC(a) | 0;
+              d = 0;
+              while (1) {
+                if (!b) break;
+                Zl(b);
+                c[((c[(b + 16) >> 2] | 0) + 112) >> 2] = e + (d << 2);
+                c[((c[((c[f >> 2] | 0) + 152) >> 2] | 0) + (d << 2)) >> 2] = b;
+                b = kC(a, b) | 0;
+                d = (d + 1) | 0;
+              }
+              d = jC(a) | 0;
+              while (1) {
+                if (!d) break;
+                b = XA(a, d) | 0;
+                while (1) {
+                  if (!b) break;
+                  Gp(b);
+                  b = ZA(a, b) | 0;
+                }
+                d = kC(a, d) | 0;
+              }
+              return;
+            }
+            function Gp(a) {
+              a = a | 0;
+              var b = 0.0;
+              TC(a, 137460, 176, 1) | 0;
+              tP(a) | 0;
+              b = +_O(a, c[47174] | 0, 1.0, 0.0);
+              h[((c[(a + 16) >> 2] | 0) + 128) >> 3] = b;
+              return;
+            }
+            function Hp(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              n = l;
+              l = (l + 16) | 0;
+              m = (n + 4) | 0;
+              k = n;
+              a[m >> 0] = a[18596] | 0;
+              a[(m + 1) >> 0] = a[18597] | 0;
+              a[(m + 2) >> 0] = a[18598] | 0;
+              a[(m + 3) >> 0] = a[18599] | 0;
+              m = oB(91156, m, 0) | 0;
+              TC(m, 91164, 280, 1) | 0;
+              c[((c[(b + 16) >> 2] | 0) + 140) >> 2] = m;
+              e = jC(b) | 0;
+              while (1) {
+                if (!e) break;
+                f = (e + 16) | 0;
+                if (!(c[c[((c[f >> 2] | 0) + 112) >> 2] >> 2] | 0)) {
+                  j = Ip(m, KB(e) | 0, e) | 0;
+                  c[c[((c[f >> 2] | 0) + 112) >> 2] >> 2] = j;
+                }
+                e = kC(b, e) | 0;
+              }
+              f = jC(b) | 0;
+              while (1) {
+                if (!f) break;
+                e = XA(b, f) | 0;
+                while (1) {
+                  if (!e) break;
+                  h = c[e >> 2] & 3;
+                  g =
+                    c[
+                      c[((c[((c[(((h | 0) == 3 ? e : (e + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 112) >> 2] >> 2
+                    ] | 0;
+                  h =
+                    c[
+                      c[((c[((c[(((h | 0) == 2 ? e : (e + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 112) >> 2] >> 2
+                    ] | 0;
+                  if ((g | 0) != (h | 0)) TC(iB(m, g, h, 0, 1) | 0, 137460, 176, 1) | 0;
+                  e = ZA(b, e) | 0;
+                }
+                f = kC(b, f) | 0;
+              }
+              j = DG(m, k, 0) | 0;
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (c[k >> 2] | 0)) break;
+                h = c[(j + (f << 2)) >> 2] | 0;
+                e = jC(h) | 0;
+                while (1) {
+                  if (!e) break;
+                  g = XA(b, c[c[((c[(e + 16) >> 2] | 0) + 112) >> 2] >> 2] | 0) | 0;
+                  while (1) {
+                    if (!g) break;
+                    i =
+                      c[
+                        c[
+                          ((c[((c[((((c[g >> 2] & 3) | 0) == 2 ? g : (g + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                            112) >>
+                            2
+                        ] >> 2
+                      ] | 0;
+                    if ((e | 0) != (i | 0)) {
+                      i = iB(m, e, i, 0, 1) | 0;
+                      TC(i, 137460, 176, 1) | 0;
+                      mB(h, i, 1) | 0;
+                    }
+                    g = ZA(b, g) | 0;
+                  }
+                  e = kC(h, e) | 0;
+                }
+                f = (f + 1) | 0;
+              }
+              e = jC(m) | 0;
+              while (1) {
+                if (!e) break;
+                f = XA(m, e) | 0;
+                while (1) {
+                  if (!f) break;
+                  b = JK(8) | 0;
+                  c[((c[(f + 16) >> 2] | 0) + 120) >> 2] = b;
+                  f = ZA(m, f) | 0;
+                }
+                e = kC(m, e) | 0;
+              }
+              c[d >> 2] = c[k >> 2];
+              l = n;
+              return j | 0;
+            }
+            function Ip(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              b = tC(a, b, 1) | 0;
+              TC(b, 137447, 304, 1) | 0;
+              e = JK(40) | 0;
+              a = (b + 16) | 0;
+              c[((c[a >> 2] | 0) + 112) >> 2] = e;
+              e = JK(c[47137] << 3) | 0;
+              a = c[a >> 2] | 0;
+              c[(a + 132) >> 2] = e;
+              e = c[(d + 16) >> 2] | 0;
+              h[(a + 88) >> 3] = +h[(e + 88) >> 3];
+              h[(a + 96) >> 3] = +h[(e + 96) >> 3];
+              h[(a + 80) >> 3] = +h[(e + 80) >> 3];
+              c[c[(a + 112) >> 2] >> 2] = d;
+              return b | 0;
+            }
+            function Jp(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              h = l;
+              l = (l + 48) | 0;
+              b = (h + 32) | 0;
+              e = h;
+              if (tB(a) | 0) {
+                g = Hp(a, b) | 0;
+                f = c[b >> 2] | 0;
+                b = c[g >> 2] | 0;
+                if ((f | 0) == 1) {
+                  bx(b, a);
+                  Kp(c[g >> 2] | 0);
+                  or(a) | 0;
+                } else {
+                  d = c[(b + 60) >> 2] | 0;
+                  kH(a, 2, 8, e) | 0;
+                  b = 0;
+                  while (1) {
+                    if ((b | 0) >= (f | 0)) break;
+                    i = c[(g + (b << 2)) >> 2] | 0;
+                    bx(i, a);
+                    or(i) | 0;
+                    b = (b + 1) | 0;
+                  }
+                  jH(f, g, d, e) | 0;
+                  b = 0;
+                  while (1) {
+                    if ((b | 0) >= (f | 0)) break;
+                    Kp(c[(g + (b << 2)) >> 2] | 0);
+                    b = (b + 1) | 0;
+                  }
+                }
+                U1(g);
+              }
+              l = h;
+              return;
+            }
+            function Kp(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              b = jC(a) | 0;
+              while (1) {
+                if (!b) break;
+                d = c[(b + 16) >> 2] | 0;
+                e = c[(d + 132) >> 2] | 0;
+                d = c[((c[((c[c[(d + 112) >> 2] >> 2] | 0) + 16) >> 2] | 0) + 132) >> 2] | 0;
+                h[d >> 3] = +h[e >> 3];
+                h[(d + 8) >> 3] = +h[(e + 8) >> 3];
+                b = kC(a, b) | 0;
+              }
+              return;
+            }
+            function Lp(a) {
+              a = a | 0;
+              if (tB(a) | 0) {
+                Ep(a);
+                Jp(a);
+                U1(c[((c[((jC(a) | 0) + 16) >> 2] | 0) + 112) >> 2] | 0);
+                fn(a);
+                tM(a);
+              }
+              return;
+            }
+            function Mp(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              b = jC(a) | 0;
+              if (b | 0) {
+                e = (a + 16) | 0;
+                Np(c[((c[e >> 2] | 0) + 140) >> 2] | 0);
+                while (1) {
+                  if (!b) break;
+                  d = XA(a, b) | 0;
+                  while (1) {
+                    if (!d) break;
+                    YP(d);
+                    d = ZA(a, d) | 0;
+                  }
+                  WP(b);
+                  b = kC(a, b) | 0;
+                }
+                U1(c[((c[e >> 2] | 0) + 152) >> 2] | 0);
+                if ((yC(a) | 0) != (a | 0)) ZC(a, 0, 137483);
+              }
+              return;
+            }
+            function Np(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              d = jC(a) | 0;
+              while (1) {
+                if (!d) break;
+                b = XA(a, d) | 0;
+                while (1) {
+                  if (!b) break;
+                  U1(c[((c[(b + 16) >> 2] | 0) + 120) >> 2] | 0);
+                  b = ZA(a, b) | 0;
+                }
+                b = (d + 16) | 0;
+                U1(c[((c[b >> 2] | 0) + 112) >> 2] | 0);
+                U1(c[((c[b >> 2] | 0) + 132) >> 2] | 0);
+                d = kC(a, d) | 0;
+              }
+              sB(a) | 0;
+              return;
+            }
+            function Op(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0.0,
+                f = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0;
+              s = l;
+              l = (l + 112) | 0;
+              m = (s + 40) | 0;
+              n = (s + 16) | 0;
+              r = (s + 100) | 0;
+              o = s;
+              j = (s + 88) | 0;
+              p = (s + 56) | 0;
+              Pp(b);
+              i = (c[47137] | 0) == 2;
+              d = i & 1;
+              if (tB(b) | 0) {
+                q = Yp() | 0;
+                Qp(b, q);
+                Nq(b, n, 0) | 0;
+                if (i & ((c[n >> 2] | 0) == 18)) {
+                  c[(q + 124) >> 2] = c[(n + 8) >> 2];
+                  h[(q + 144) >> 3] = +h[(n + 16) >> 3];
+                  lr(j, b);
+                  if (!(a[(j + 8) >> 0] | 0)) {
+                    f = 0.05555555555555555;
+                    e = 0.05555555555555555;
+                  } else {
+                    f = +g[(j + 4) >> 2] * 0.013888888888888888;
+                    e = +g[j >> 2] * 0.013888888888888888;
+                  }
+                  h[o >> 3] = e;
+                  h[(o + 8) >> 3] = f;
+                  d = 0;
+                } else c[(q + 124) >> 2] = -1;
+                if (0) _p(q);
+                k = DG(b, r, 0) | 0;
+                if ((c[r >> 2] | 0) == 1) {
+                  c[m >> 2] = c[o >> 2];
+                  c[(m + 4) >> 2] = c[(o + 4) >> 2];
+                  c[(m + 8) >> 2] = c[(o + 8) >> 2];
+                  c[(m + 12) >> 2] = c[(o + 12) >> 2];
+                  Rp(b, q, m);
+                  if (d | 0) Qq(b, n) | 0;
+                  fn(b);
+                  d = 0;
+                } else {
+                  kH(b, 2, 8, p) | 0;
+                  c[(p + 12) >> 2] = 1;
+                  j = (d | 0) == 0;
+                  i = 0;
+                  while (1) {
+                    d = c[r >> 2] | 0;
+                    if ((i | 0) >= (d | 0)) break;
+                    d = c[(k + (i << 2)) >> 2] | 0;
+                    KG(d) | 0;
+                    c[m >> 2] = c[o >> 2];
+                    c[(m + 4) >> 2] = c[(o + 4) >> 2];
+                    c[(m + 8) >> 2] = c[(o + 8) >> 2];
+                    c[(m + 12) >> 2] = c[(o + 12) >> 2];
+                    Rp(d, q, m);
+                    if (!j) Qq(d, n) | 0;
+                    oQ(d, 2);
+                    fn(d);
+                    i = (i + 1) | 0;
+                  }
+                  jH(d, k, b, p) | 0;
+                  d = 0;
+                }
+                while (1) {
+                  if ((d | 0) >= (c[r >> 2] | 0)) break;
+                  wC(b, c[(k + (d << 2)) >> 2] | 0) | 0;
+                  d = (d + 1) | 0;
+                }
+                U1(k);
+                Zp(q);
+              }
+              tM(b);
+              l = s;
+              return;
+            }
+            function Pp(a) {
+              a = a | 0;
+              var d = 0,
+                f = 0;
+              oQ(a, 2);
+              d = ZO(a, GA(a, 0, 91368, 0) | 0, 2, 2) | 0;
+              f = (ZO(a, GA(a, 0, 91374, 0) | 0, d, 2) | 0) & 65535;
+              b[((c[((yC(a) | 0) + 16) >> 2] | 0) + 176) >> 1] = f;
+              if ((e[((c[((yC(a) | 0) + 16) >> 2] | 0) + 176) >> 1] | 0) < 10)
+                f = b[((c[((yC(a) | 0) + 16) >> 2] | 0) + 176) >> 1] | 0;
+              else f = 10;
+              b[((c[((yC(a) | 0) + 16) >> 2] | 0) + 176) >> 1] = f;
+              f = f & 65535;
+              c[47137] = f;
+              b[((c[((yC(a) | 0) + 16) >> 2] | 0) + 178) >> 1] = (d | 0) < (f | 0) ? d : f;
+              Vp(a);
+              return;
+            }
+            function Qp(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              g = l;
+              l = (l + 16) | 0;
+              f = (g + 8) | 0;
+              d = (g + 12) | 0;
+              e = (b + 108) | 0;
+              c[d >> 2] = c[e >> 2];
+              if ((mm(a, 2, d) | 0) != 2) gA(0, 91169, g) | 0;
+              c[e >> 2] = c[d >> 2];
+              h[(b + 24) >> 3] = +_O(a, GA(a, 0, 91202, 0) | 0, -1.0, 0.0);
+              h[b >> 3] = -+_O(a, GA(a, 0, 91204, 0) | 0, 1.0001234, 0.0);
+              c[(b + 40) >> 2] = ZO(a, GA(a, 0, 91219, 0) | 0, 2147483647, 0) | 0;
+              c[(b + 120) >> 2] = Tp(a, GA(a, 0, 91226, 0) | 0) | 0;
+              c[(b + 132) >> 2] = Up(a, GA(a, 0, 91236, 0) | 0) | 0;
+              c[(b + 136) >> 2] = 0;
+              c[(b + 112) >> 2] = (eP(QA(a, 91245) | 0, 0) | 0) & 255;
+              c[(b + 128) >> 2] = (eP(QA(a, 91254) | 0, 1) | 0) & 255;
+              h[(b + 152) >> 3] = +_O(a, GA(a, 0, 91269, 0) | 0, 0.0, -1797693134862315708145274.0e284);
+              d = ZO(a, GA(a, 0, 91278, 0) | 0, 0, 0) | 0;
+              a = (b + 160) | 0;
+              c[a >> 2] = d;
+              if ((d | 0) > 4) {
+                c[f >> 2] = d;
+                gA(0, 91291, f) | 0;
+                c[a >> 2] = 0;
+              }
+              l = g;
+              return;
+            }
+            function Rp(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              q = l;
+              l = (l + 48) | 0;
+              f = q;
+              n = (q + 32) | 0;
+              j = (q + 28) | 0;
+              g = (q + 24) | 0;
+              p = (q + 20) | 0;
+              o = (q + 16) | 0;
+              c[g >> 2] = 0;
+              c[p >> 2] = 0;
+              c[o >> 2] = 0;
+              i = (b + 136) | 0;
+              e = c[47137] | 0;
+              if ((c[i >> 2] | 0) == 1) m = Kq(a, e, o) | 0;
+              else m = Kq(a, e, 0) | 0;
+              do
+                if ((c[(b + 124) >> 2] | 0) > -1)
+                  if ((c[(b + 160) >> 2] | 0) > 0) {
+                    c[f >> 2] = c[d >> 2];
+                    c[(f + 4) >> 2] = c[(d + 4) >> 2];
+                    c[(f + 8) >> 2] = c[(d + 8) >> 2];
+                    c[(f + 12) >> 2] = c[(d + 12) >> 2];
+                    k = Jq(a, f, g, p) | 0;
+                    break;
+                  } else {
+                    c[f >> 2] = c[d >> 2];
+                    c[(f + 4) >> 2] = c[(d + 4) >> 2];
+                    c[(f + 8) >> 2] = c[(d + 8) >> 2];
+                    c[(f + 12) >> 2] = c[(d + 12) >> 2];
+                    k = Jq(a, f, 0, 0) | 0;
+                    break;
+                  }
+                else k = 0;
+              while (0);
+              e = Sp(a) | 0;
+              c[n >> 2] = e;
+              switch (c[i >> 2] | 0) {
+                case 1:
+                case 0: {
+                  wq(c[47137] | 0, m, c[o >> 2] | 0, b, 0, k, e, c[g >> 2] | 0, c[p >> 2] | 0, j);
+                  break;
+                }
+                case 5: {
+                  Iq(c[47137] | 0, m, e, j);
+                  break;
+                }
+                case 4: {
+                  e = c[o >> 2] | 0;
+                  if (!e) e = Qw(m) | 0;
+                  else e = Aw(e, 0) | 0;
+                  c[o >> 2] = e;
+                  Dq(c[47137] | 0, m, e, n, 1, 200, 0.001, j);
+                  break;
+                }
+                default: {
+                }
+              }
+              e = jC(a) | 0;
+              while (1) {
+                if (!e) break;
+                d = c[47137] | 0;
+                g = c[(e + 16) >> 2] | 0;
+                b = ((c[n >> 2] | 0) + ((O(c[(g + 120) >> 2] | 0, d) | 0) << 3)) | 0;
+                g = (g + 132) | 0;
+                f = 0;
+                while (1) {
+                  if ((f | 0) >= (d | 0)) break;
+                  h[((c[g >> 2] | 0) + (f << 3)) >> 3] = +h[(b + (f << 3)) >> 3];
+                  f = (f + 1) | 0;
+                }
+                e = kC(a, e) | 0;
+              }
+              U1(k);
+              U1(c[n >> 2] | 0);
+              qw(m);
+              e = c[o >> 2] | 0;
+              if (e | 0) qw(e);
+              e = c[p >> 2] | 0;
+              if (e | 0) U1(e);
+              l = q;
+              return;
+            }
+            function Sp(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0;
+              j = c[47137] | 0;
+              j = JK(O(j << 3, tB(b) | 0) | 0) | 0;
+              a: do
+                if (GA(b, 1, 102623, 0) | 0) {
+                  f = jC(b) | 0;
+                  while (1) {
+                    if (!f) break a;
+                    d = c[(f + 16) >> 2] | 0;
+                    b: do
+                      if (a[(d + 119) >> 0] | 0) {
+                        g = c[47137] | 0;
+                        i = O(g, c[(d + 120) >> 2] | 0) | 0;
+                        e = (d + 132) | 0;
+                        d = 0;
+                        while (1) {
+                          if ((d | 0) >= (g | 0)) break b;
+                          h[(j + ((i + d) << 3)) >> 3] = +h[((c[e >> 2] | 0) + (d << 3)) >> 3];
+                          d = (d + 1) | 0;
+                        }
+                      }
+                    while (0);
+                    f = kC(b, f) | 0;
+                  }
+                }
+              while (0);
+              return j | 0;
+            }
+            function Tp(b, c) {
+              b = b | 0;
+              c = c | 0;
+              do
+                if (c) {
+                  b = RA(b, c) | 0;
+                  c = a[b >> 0] | 0;
+                  if (((c + -48) | 0) >>> 0 < 10) {
+                    b = q5(b) | 0;
+                    b = (b | 0) < 5 ? b : 0;
+                    break;
+                  }
+                  if (b3(c) | 0)
+                    if (c3(b, 91330) | 0)
+                      if (c3(b, 91339) | 0)
+                        if (c3(b, 135709) | 0)
+                          if (!(c3(b, 91350) | 0)) b = 3;
+                          else {
+                            b = (c3(b, 91361) | 0) == 0;
+                            b = b ? 4 : 0;
+                          }
+                        else b = 0;
+                      else b = 1;
+                    else b = 2;
+                  else b = 0;
+                } else b = 0;
+              while (0);
+              return b | 0;
+            }
+            function Up(b, c) {
+              b = b | 0;
+              c = c | 0;
+              do
+                if (c) {
+                  b = RA(b, c) | 0;
+                  c = a[b >> 0] | 0;
+                  if (((c + -48) | 0) >>> 0 < 10) {
+                    b = q5(b) | 0;
+                    b = b >>> 0 < 3 ? b : 1;
+                    break;
+                  }
+                  if (b3(c) | 0)
+                    if ((c3(b, 135709) | 0) != 0 ? (c3(b, 137308) | 0) != 0 : 0)
+                      if (((c3(b, 99730) | 0) != 0 ? (c3(b, 107652) | 0) != 0 : 0) ? (c3(b, 107657) | 0) != 0 : 0) {
+                        b = (c3(b, 91325) | 0) == 0;
+                        b = b ? 2 : 1;
+                      } else b = 1;
+                    else b = 0;
+                  else b = 1;
+                } else b = 1;
+              while (0);
+              return b | 0;
+            }
+            function Vp(a) {
+              a = a | 0;
+              var b = 0,
+                c = 0;
+              b = jC(a) | 0;
+              while (1) {
+                if (!b) break;
+                Zl(b);
+                b = kC(a, b) | 0;
+              }
+              c = jC(a) | 0;
+              while (1) {
+                if (!c) break;
+                b = XA(a, c) | 0;
+                while (1) {
+                  if (!b) break;
+                  Wp(b);
+                  b = ZA(a, b) | 0;
+                }
+                c = kC(a, c) | 0;
+              }
+              return;
+            }
+            function Wp(a) {
+              a = a | 0;
+              TC(a, 137460, 176, 1) | 0;
+              tP(a) | 0;
+              return;
+            }
+            function Xp(a) {
+              a = a | 0;
+              var b = 0,
+                c = 0;
+              c = jC(a) | 0;
+              while (1) {
+                if (!c) break;
+                b = XA(a, c) | 0;
+                while (1) {
+                  if (!b) break;
+                  YP(b);
+                  b = ZA(a, b) | 0;
+                }
+                WP(c);
+                c = kC(a, c) | 0;
+              }
+              return;
+            }
+            function Yp() {
+              var a = 0,
+                b = 0;
+              a = KK(168) | 0;
+              h[a >> 3] = -1.0001234;
+              h[(a + 8) >> 3] = 1.0;
+              c[(a + 16) >> 2] = 1;
+              h[(a + 24) >> 3] = -1.0;
+              h[(a + 32) >> 3] = 0.2;
+              c[(a + 40) >> 2] = 0;
+              c[(a + 44) >> 2] = 4;
+              c[(a + 48) >> 2] = 1;
+              c[(a + 52) >> 2] = 45;
+              c[(a + 56) >> 2] = 10;
+              h[(a + 64) >> 3] = 0.6;
+              h[(a + 72) >> 3] = 0.001;
+              c[(a + 80) >> 2] = 500;
+              h[(a + 88) >> 3] = 0.9;
+              h[(a + 96) >> 3] = 0.1;
+              c[(a + 104) >> 2] = 1;
+              c[(a + 108) >> 2] = 123;
+              b = (a + 112) | 0;
+              c[b >> 2] = 0;
+              c[(b + 4) >> 2] = 0;
+              c[(b + 8) >> 2] = 0;
+              c[(b + 12) >> 2] = 0;
+              c[(a + 128) >> 2] = 1;
+              c[(a + 132) >> 2] = 3;
+              c[(a + 136) >> 2] = 0;
+              h[(a + 144) >> 3] = -4.0;
+              h[(a + 152) >> 3] = 0.0;
+              c[(a + 160) >> 2] = 0;
+              return a | 0;
+            }
+            function Zp(a) {
+              a = a | 0;
+              U1(a);
+              return;
+            }
+            function _p(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0;
+              b = l;
+              l = (l + 176) | 0;
+              d = (b + 160) | 0;
+              f = (b + 152) | 0;
+              g = (b + 128) | 0;
+              k = (b + 112) | 0;
+              j = (b + 88) | 0;
+              m = (b + 64) | 0;
+              n = (b + 56) | 0;
+              o = (b + 40) | 0;
+              q = (b + 24) | 0;
+              p = (b + 16) | 0;
+              r = b;
+              e = c[15712] | 0;
+              U4(91378, 27, 1, e) | 0;
+              i = +h[(a + 8) >> 3];
+              h[r >> 3] = +h[a >> 3];
+              h[(r + 8) >> 3] = i;
+              w4(e, 91406, r) | 0;
+              r = c[(a + 108) >> 2] | 0;
+              c[p >> 2] = c[(a + 16) >> 2];
+              c[(p + 4) >> 2] = r;
+              w4(e, 91457, p) | 0;
+              i = +h[(a + 32) >> 3];
+              h[q >> 3] = +h[(a + 24) >> 3];
+              h[(q + 8) >> 3] = i;
+              w4(e, 91484, q) | 0;
+              q = c[(a + 44) >> 2] | 0;
+              p = c[(a + 48) >> 2] | 0;
+              c[o >> 2] = c[(a + 40) >> 2];
+              c[(o + 4) >> 2] = q;
+              c[(o + 8) >> 2] = p;
+              w4(e, 91507, o) | 0;
+              o = c[(a + 56) >> 2] | 0;
+              c[n >> 2] = c[(a + 52) >> 2];
+              c[(n + 4) >> 2] = o;
+              w4(e, 91558, n) | 0;
+              i = +h[(a + 72) >> 3];
+              n = c[(a + 80) >> 2] | 0;
+              h[m >> 3] = +h[(a + 64) >> 3];
+              h[(m + 8) >> 3] = i;
+              c[(m + 16) >> 2] = n;
+              w4(e, 91591, m) | 0;
+              i = +h[(a + 96) >> 3];
+              m = c[(a + 104) >> 2] | 0;
+              h[j >> 3] = +h[(a + 88) >> 3];
+              h[(j + 8) >> 3] = i;
+              c[(j + 16) >> 2] = m;
+              w4(e, 91649, j) | 0;
+              j = c[(a + 116) >> 2] | 0;
+              i = +h[(a + 152) >> 3];
+              c[k >> 2] = c[(a + 112) >> 2];
+              c[(k + 4) >> 2] = j;
+              h[(k + 8) >> 3] = i;
+              w4(e, 91695, k) | 0;
+              k = c[(a + 124) >> 2] | 0;
+              j = c[(a + 128) >> 2] | 0;
+              i = +h[(a + 144) >> 3];
+              c[g >> 2] = c[(17804 + (c[(a + 120) >> 2] << 2)) >> 2];
+              c[(g + 4) >> 2] = k;
+              c[(g + 8) >> 2] = j;
+              h[(g + 16) >> 3] = i;
+              w4(e, 91748, g) | 0;
+              g = c[(17848 + (c[(a + 136) >> 2] << 2)) >> 2] | 0;
+              c[f >> 2] = c[(17832 + (c[(a + 132) >> 2] << 2)) >> 2];
+              c[(f + 4) >> 2] = g;
+              w4(e, 91813, f) | 0;
+              c[d >> 2] = c[(a + 160) >> 2];
+              w4(e, 91843, d) | 0;
+              l = b;
+              return;
+            }
+            function $p(a) {
+              a = a | 0;
+              U1(a);
+              return;
+            }
+            function aq(a) {
+              a = a | 0;
+              var b = 0;
+              b = KK(184) | 0;
+              c[b >> 2] = a;
+              c[(b + 176) >> 2] = 0;
+              return b | 0;
+            }
+            function bq(a, b) {
+              a = a | 0;
+              b = +b;
+              var d = 0,
+                e = 0,
+                f = 0;
+              e = c[a >> 2] | 0;
+              h[(a + 8 + (e << 3)) >> 3] = b;
+              f = (a + 176) | 0;
+              a: do
+                switch (c[f >> 2] | 0) {
+                  case 0: {
+                    d = c[a >> 2] | 0;
+                    if ((d | 0) == 20) {
+                      c[f >> 2] = -1;
+                      d = 19;
+                    } else {
+                      c[f >> 2] = 1;
+                      d = (d | 0) > 19 ? 20 : (d + 1) | 0;
+                    }
+                    c[a >> 2] = d;
+                    break;
+                  }
+                  case 1: {
+                    d = c[a >> 2] | 0;
+                    if ((d | 0) < 20 ? +h[(a + 8 + ((e + -1) << 3)) >> 3] > b : 0) {
+                      c[a >> 2] = d + 1;
+                      break a;
+                    } else {
+                      c[a >> 2] = d + -1;
+                      c[f >> 2] = -1;
+                      break a;
+                    }
+                  }
+                  default: {
+                    d = c[a >> 2] | 0;
+                    if ((d | 0) > 0 ? +h[(a + 8 + ((e + 1) << 3)) >> 3] > b : 0) {
+                      c[a >> 2] = d + -1;
+                      break a;
+                    } else {
+                      c[a >> 2] = d + 1;
+                      c[f >> 2] = 1;
+                      break a;
+                    }
+                  }
+                }
+              while (0);
+              return;
+            }
+            function cq(a) {
+              a = a | 0;
+              return c[a >> 2] | 0;
+            }
+            function dq(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0.0;
+              o = c[(a + 20) >> 2] | 0;
+              p = c[(a + 24) >> 2] | 0;
+              m = c[a >> 2] | 0;
+              n = c[(o + (m << 2)) >> 2] | 0;
+              if (!n) e = 1.0;
+              else {
+                a = 0;
+                e = 0.0;
+                a: while (1) {
+                  if ((a | 0) >= (m | 0)) break;
+                  j = (a + 1) | 0;
+                  k = c[(o + (j << 2)) >> 2] | 0;
+                  l = O(a, b) | 0;
+                  i = c[(o + (a << 2)) >> 2] | 0;
+                  while (1) {
+                    if ((i | 0) >= (k | 0)) {
+                      a = j;
+                      continue a;
+                    }
+                    g = (p + (i << 2)) | 0;
+                    a = 0;
+                    f = 0.0;
+                    while (1) {
+                      if ((a | 0) >= (b | 0)) break;
+                      q = +h[(d + ((a + l) << 3)) >> 3] - +h[(d + ((O(c[g >> 2] | 0, b) | 0) << 3)) >> 3];
+                      a = (a + 1) | 0;
+                      f = q * q + f;
+                    }
+                    i = (i + 1) | 0;
+                    e = +C(+f) + e;
+                  }
+                }
+                e = e / +(n | 0);
+              }
+              return +e;
+            }
+            function eq(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              e = (b + 10) | 0;
+              if ((c[d >> 2] | 0) <= (b | 0)) {
+                c[d >> 2] = e;
+                c[a >> 2] = MK(c[a >> 2] | 0, e << 3) | 0;
+              }
+              return;
+            }
+            function fq(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              e = (b + 10) | 0;
+              if ((c[d >> 2] | 0) <= (b | 0)) {
+                c[d >> 2] = e;
+                c[a >> 2] = MK(c[a >> 2] | 0, e << 2) | 0;
+              }
+              return;
+            }
+            function gq(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 16) | 0;
+              j = k;
+              i = O(d, b) | 0;
+              b = O(c, b) | 0;
+              d = 0;
+              while (1) {
+                if ((d | 0) == 2) break;
+                h[(j + (d << 3)) >> 3] = +h[(a + ((d + i) << 3)) >> 3] - +h[(a + ((d + b) << 3)) >> 3];
+                d = (d + 1) | 0;
+              }
+              g = +h[j >> 3];
+              f = +h[(j + 8) >> 3];
+              do
+                if (!((g >= 0.0 ? g : -g) <= (f >= 0.0 ? f : -f) * 1.0e-5)) {
+                  e = +J(+(f / g));
+                  if (g > 0.0) {
+                    if (!(f < 0.0)) break;
+                    e = e + 6.283185307179586;
+                    break;
+                  } else {
+                    if (!(g < 0.0)) break;
+                    e = e + 3.141592653589793;
+                    break;
+                  }
+                } else e = f > 0.0 ? 1.5707963267948966 : 4.71238898038469;
+              while (0);
+              l = k;
+              return +e;
+            }
+            function hq(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0,
+                d = 0.0;
+              d = +h[a >> 3];
+              c = +h[b >> 3];
+              return (d > c ? 1 : ((d < c) << 31) >> 31) | 0;
+            }
+            function iq(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0.0,
+                k = 0,
+                m = 0,
+                n = 0.0,
+                o = 0,
+                p = 0.0,
+                q = 0.0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0.0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0.0,
+                A = 0.0,
+                B = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0.0,
+                N = 0,
+                P = 0,
+                Q = 0,
+                R = 0.0,
+                S = 0,
+                T = 0.0,
+                U = 0,
+                V = 0,
+                W = 0,
+                X = 0,
+                Y = 0,
+                Z = 0,
+                _ = 0,
+                $ = 0,
+                aa = 0.0;
+              _ = l;
+              l = (l + 80) | 0;
+              Z = (_ + 32) | 0;
+              Y = _;
+              p = +h[d >> 3];
+              m = (d + 24) | 0;
+              n = +h[m >> 3];
+              o = (d + 32) | 0;
+              j = +h[o >> 3];
+              R = +h[(d + 72) >> 3];
+              S = c[(d + 80) >> 2] | 0;
+              T = +h[(d + 88) >> 3];
+              q = +h[(d + 96) >> 3];
+              U = c[(d + 104) >> 2] | 0;
+              V = (d + 56) | 0;
+              i = c[V >> 2] | 0;
+              do
+                if (
+                  !(((b | 0) == 0) | ((S | 0) < 1)) ? ((W = c[(b + 4) >> 2] | 0), !(((a | 0) < 1) | ((W | 0) < 1))) : 0
+                ) {
+                  Q = c[b >> 2] | 0;
+                  X = aq(i) | 0;
+                  c[g >> 2] = 0;
+                  if ((Q | 0) != (W | 0)) {
+                    c[g >> 2] = -100;
+                    $p(X);
+                    c[V >> 2] = i;
+                    break;
+                  }
+                  N = vw(b, 1) | 0;
+                  P = c[(N + 20) >> 2] | 0;
+                  Q = c[(N + 24) >> 2] | 0;
+                  a: do
+                    if (c[(d + 16) >> 2] | 0) {
+                      w5(c[(d + 108) >> 2] | 0);
+                      k = O(W, a) | 0;
+                      i = 0;
+                      while (1) {
+                        if ((i | 0) >= (k | 0)) break a;
+                        h[(f + (i << 3)) >> 3] = +Sw();
+                        i = (i + 1) | 0;
+                      }
+                    }
+                  while (0);
+                  if (n < 0.0) {
+                    n = +dq(N, a, f);
+                    h[m >> 3] = n;
+                  }
+                  if (j < 0.0) {
+                    h[o >> 3] = 0.2;
+                    j = 0.2;
+                  }
+                  if (p >= 0.0) {
+                    h[d >> 3] = -1.0;
+                    p = -1.0;
+                  }
+                  M = +D(+n, +(1.0 - p));
+                  A = +D(+j, +((2.0 - p) * 0.3333333333333333)) / n;
+                  B = O(W, a << 3) | 0;
+                  E = KK(B) | 0;
+                  F = KK(B) | 0;
+                  G = (d + 116) | 0;
+                  H = (d + 64) | 0;
+                  I = c[15712] | 0;
+                  J = (N + 8) | 0;
+                  K = (Y + 8) | 0;
+                  L = (Y + 16) | 0;
+                  y = 0;
+                  z = 0.0;
+                  v = q;
+                  while (1) {
+                    W6(E | 0, f | 0, B | 0) | 0;
+                    w = cq(X) | 0;
+                    x = hw(a, W, w, f, (c[G >> 2] | 0) == 0 ? 0 : e) | 0;
+                    cw(x, F, f, +h[H >> 3], p, M, Y, g);
+                    m = 0;
+                    b: while (1) {
+                      if ((m | 0) >= (W | 0)) {
+                        q = 0.0;
+                        k = 0;
+                        break;
+                      }
+                      o = O(m, a) | 0;
+                      r = (F + (o << 3)) | 0;
+                      s = (m + 1) | 0;
+                      t = (P + (s << 2)) | 0;
+                      k = c[(P + (m << 2)) >> 2] | 0;
+                      while (1) {
+                        if ((k | 0) >= (c[t >> 2] | 0)) {
+                          m = s;
+                          continue b;
+                        }
+                        u = (Q + (k << 2)) | 0;
+                        i = c[u >> 2] | 0;
+                        c: do
+                          if ((i | 0) != (m | 0)) {
+                            j = +_w(f, a, m, i) * A;
+                            i = 0;
+                            while (1) {
+                              if ((i | 0) >= (a | 0)) break c;
+                              q =
+                                j *
+                                (+h[(f + ((i + o) << 3)) >> 3] - +h[(f + (((O(c[u >> 2] | 0, a) | 0) + i) << 3)) >> 3]);
+                              $ = (r + (i << 3)) | 0;
+                              h[$ >> 3] = +h[$ >> 3] - q;
+                              i = (i + 1) | 0;
+                            }
+                          }
+                        while (0);
+                        k = (k + 1) | 0;
+                      }
+                    }
+                    while (1) {
+                      if ((k | 0) >= (W | 0)) break;
+                      m = O(k, a) | 0;
+                      o = (F + (m << 3)) | 0;
+                      j = 0.0;
+                      i = 0;
+                      while (1) {
+                        if ((i | 0) >= (a | 0)) break;
+                        aa = +h[(o + (i << 3)) >> 3];
+                        j = aa * aa + j;
+                        i = (i + 1) | 0;
+                      }
+                      j = +C(+j);
+                      q = j + q;
+                      d: do
+                        if (j > 0.0) {
+                          j = 1.0 / j;
+                          i = 0;
+                          while (1) {
+                            if ((i | 0) >= (a | 0)) {
+                              i = 0;
+                              break d;
+                            }
+                            $ = (o + (i << 3)) | 0;
+                            h[$ >> 3] = +h[$ >> 3] * j;
+                            i = (i + 1) | 0;
+                          }
+                        } else i = 0;
+                      while (0);
+                      while (1) {
+                        if ((i | 0) >= (a | 0)) break;
+                        $ = (f + ((i + m) << 3)) | 0;
+                        h[$ >> 3] = +h[$ >> 3] + +h[(o + (i << 3)) >> 3] * v;
+                        i = (i + 1) | 0;
+                      }
+                      k = (k + 1) | 0;
+                    }
+                    y = (y + 1) | 0;
+                    if (!x) {
+                      if (0) {
+                        $ = c[J >> 2] | 0;
+                        c[Z >> 2] = y;
+                        h[(Z + 8) >> 3] = v;
+                        h[(Z + 16) >> 3] = q;
+                        c[(Z + 24) >> 2] = $;
+                        h[(Z + 32) >> 3] = n;
+                        w4(I, 92099, Z) | 0;
+                      }
+                    } else {
+                      ow(x);
+                      bq(X, +h[K >> 3] * 0.85 + +h[Y >> 3] + +h[L >> 3] * 3.3);
+                    }
+                    v = +jq(U, v, q, z, T);
+                    if (!(((y | 0) < (S | 0)) & (v > R))) break;
+                    else z = q;
+                  }
+                  if (c[(d + 112) >> 2] | 0) kq(a, N, f);
+                  $p(X);
+                  c[V >> 2] = w;
+                  U1(E);
+                  if ((N | 0) != (b | 0)) qw(N);
+                  U1(F);
+                }
+              while (0);
+              l = _;
+              return;
+            }
+            function jq(a, b, c, d, e) {
+              a = a | 0;
+              b = +b;
+              c = +c;
+              d = +d;
+              e = +e;
+              do
+                if (a) {
+                  if (c >= d) {
+                    b = e * b;
+                    break;
+                  }
+                  if (!(d * 0.95 < c)) b = (b * 0.99) / e;
+                } else b = e * b;
+              while (0);
+              return +b;
+            }
+            function kq(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0;
+              D = l;
+              l = (l + 16) | 0;
+              v = (D + 12) | 0;
+              y = (D + 8) | 0;
+              z = (D + 4) | 0;
+              A = D;
+              B = c[b >> 2] | 0;
+              C = c[(b + 20) >> 2] | 0;
+              t = c[(b + 24) >> 2] | 0;
+              c[v >> 2] = 10;
+              c[A >> 2] = 10;
+              u = KK(B << 2) | 0;
+              f = KK(80) | 0;
+              c[y >> 2] = f;
+              e = KK(40) | 0;
+              c[z >> 2] = e;
+              b = 0;
+              while (1) {
+                if ((b | 0) >= (B | 0)) {
+                  n = 0;
+                  r = f;
+                  k = e;
+                  o = e;
+                  m = f;
+                  break;
+                }
+                c[(u + (b << 2)) >> 2] = 0;
+                b = (b + 1) | 0;
+              }
+              while (1) {
+                if ((n | 0) >= (B | 0)) break;
+                b = c[(C + (n << 2)) >> 2] | 0;
+                a: do
+                  if (
+                    ((((c[(C + ((n + 1) << 2)) >> 2] | 0) - b) | 0) == 1 ? (c[(u + (n << 2)) >> 2] | 0) == 0 : 0)
+                      ? ((w = c[(t + (b << 2)) >> 2] | 0), (x = (u + (w << 2)) | 0), (c[x >> 2] | 0) == 0)
+                      : 0
+                  ) {
+                    c[x >> 2] = 1;
+                    q = (C + ((w + 1) << 2)) | 0;
+                    n = 0;
+                    s = 0;
+                    g = 0.0;
+                    p = c[(C + (w << 2)) >> 2] | 0;
+                    k = o;
+                    b = r;
+                    while (1) {
+                      if ((p | 0) >= (c[q >> 2] | 0)) break;
+                      e = (t + (p << 2)) | 0;
+                      f = c[e >> 2] | 0;
+                      if ((((c[(C + ((f + 1) << 2)) >> 2] | 0) - (c[(C + (f << 2)) >> 2] | 0)) | 0) == 1) {
+                        c[(u + (f << 2)) >> 2] = 1;
+                        fq(z, s, v);
+                        g = +_w(d, a, w, c[e >> 2] | 0) + g;
+                        k = c[z >> 2] | 0;
+                        c[(k + (s << 2)) >> 2] = c[e >> 2];
+                        e = n;
+                        f = (s + 1) | 0;
+                      } else {
+                        eq(y, n, A);
+                        j = +gq(d, a, w, c[e >> 2] | 0);
+                        b = c[y >> 2] | 0;
+                        h[(b + (n << 3)) >> 3] = j;
+                        e = (n + 1) | 0;
+                        f = s;
+                        m = b;
+                      }
+                      n = e;
+                      s = f;
+                      p = (p + 1) | 0;
+                    }
+                    j = g / +(s | 0);
+                    if ((n | 0) > 0) {
+                      lq(n, m);
+                      b = m;
+                    }
+                    g = (s | 0) > 1 ? 6.283185307179586 / +((s + -1) | 0) : 0.0;
+                    e = 0;
+                    i = 0.0;
+                    while (1) {
+                      if ((e | 0) >= (s | 0)) {
+                        o = k;
+                        f = k;
+                        break a;
+                      }
+                      mq(d, a, j, i, w, c[(k + (e << 2)) >> 2] | 0);
+                      e = (e + 1) | 0;
+                      i = i + g;
+                    }
+                  } else {
+                    e = n;
+                    f = k;
+                    b = r;
+                  }
+                while (0);
+                n = (e + 1) | 0;
+                r = b;
+                k = f;
+              }
+              U1(u);
+              U1(r);
+              U1(k);
+              l = D;
+              return;
+            }
+            function lq(a, b) {
+              a = a | 0;
+              b = b | 0;
+              o4(b, a, 8, 68);
+              return;
+            }
+            function mq(a, b, c, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              c = +c;
+              d = +d;
+              e = e | 0;
+              f = f | 0;
+              var g = 0.0;
+              g = +E(+d) * c;
+              e = O(e, b) | 0;
+              f = O(f, b) | 0;
+              h[(a + (f << 3)) >> 3] = g + +h[(a + (e << 3)) >> 3];
+              d = +F(+d) * c;
+              h[(a + ((f + 1) << 3)) >> 3] = d + +h[(a + ((e + 1) << 3)) >> 3];
+              return;
+            }
+            function nq(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0.0,
+                l = 0.0,
+                m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0,
+                q = 0,
+                r = 0.0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0.0,
+                A = 0,
+                B = 0.0,
+                E = 0.0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                P = 0.0,
+                Q = 0,
+                R = 0.0,
+                S = 0,
+                T = 0,
+                U = 0,
+                V = 0,
+                W = 0.0;
+              o = +h[d >> 3];
+              m = (d + 24) | 0;
+              l = +h[m >> 3];
+              n = (d + 32) | 0;
+              k = +h[n >> 3];
+              P = +h[(d + 72) >> 3];
+              Q = c[(d + 80) >> 2] | 0;
+              R = +h[(d + 88) >> 3];
+              r = +h[(d + 96) >> 3];
+              S = c[(d + 104) >> 2] | 0;
+              i = c[(d + 56) >> 2] | 0;
+              U4(92198, 32, 1, c[15712] | 0) | 0;
+              if (
+                !(((b | 0) == 0) | ((Q | 0) < 1))
+                  ? ((T = c[b >> 2] | 0), (j = c[(b + 4) >> 2] | 0), !(((a | 0) < 1) | ((j | 0) < 1)))
+                  : 0
+              ) {
+                p = a << 3;
+                U = KK(O(p, j) | 0) | 0;
+                if ((j | 0) < (c[(d + 52) >> 2] | 0)) {
+                  I = 0;
+                  J = 0;
+                  K = 0;
+                  L = 0;
+                  M = 0;
+                  N = 0;
+                } else {
+                  aq(i) | 0;
+                  L = KK((a * 80) | 0) | 0;
+                  M = KK(80) | 0;
+                  N = KK(80) | 0;
+                  I = N;
+                  J = M;
+                  K = L;
+                }
+                c[g >> 2] = 0;
+                if ((T | 0) == (j | 0)) {
+                  F = vw(b, 1) | 0;
+                  G = c[(F + 20) >> 2] | 0;
+                  H = c[(F + 24) >> 2] | 0;
+                  a: do
+                    if (c[(d + 16) >> 2] | 0) {
+                      w5(c[(d + 108) >> 2] | 0);
+                      j = O(T, a) | 0;
+                      i = 0;
+                      while (1) {
+                        if ((i | 0) >= (j | 0)) break a;
+                        h[(f + (i << 3)) >> 3] = +Sw();
+                        i = (i + 1) | 0;
+                      }
+                    }
+                  while (0);
+                  if (l < 0.0) {
+                    l = +dq(F, a, f);
+                    h[m >> 3] = l;
+                  }
+                  if (k < 0.0) {
+                    h[n >> 3] = 0.2;
+                    k = 0.2;
+                  }
+                  if (o >= 0.0) {
+                    h[d >> 3] = -1.0;
+                    o = -1.0;
+                  }
+                  B = 1.0 - o;
+                  E = +D(+l, +B);
+                  z = +D(+k, +((2.0 - o) * 0.3333333333333333)) / l;
+                  A = KK(p) | 0;
+                  u = O(T, p) | 0;
+                  v = KK(u) | 0;
+                  w = O(T, a) | 0;
+                  x = (d + 116) | 0;
+                  y = (e | 0) != 0;
+                  t = o == -1.0;
+                  s = 0;
+                  o = 0.0;
+                  while (1) {
+                    i = 0;
+                    while (1) {
+                      if ((i | 0) >= (w | 0)) break;
+                      h[(U + (i << 3)) >> 3] = 0.0;
+                      i = (i + 1) | 0;
+                    }
+                    W6(v | 0, f | 0, u | 0) | 0;
+                    p = 0;
+                    while (1) {
+                      if ((p | 0) < (T | 0)) i = 0;
+                      else {
+                        n = 0;
+                        break;
+                      }
+                      while (1) {
+                        if ((i | 0) >= (a | 0)) break;
+                        h[(A + (i << 3)) >> 3] = 0.0;
+                        i = (i + 1) | 0;
+                      }
+                      n = O(p, a) | 0;
+                      b: do
+                        if (y & ((c[x >> 2] | 0) != 0)) {
+                          i = 0;
+                          while (1) {
+                            if ((i | 0) == (T | 0)) {
+                              i = 0;
+                              break b;
+                            }
+                            c: do
+                              if ((i | 0) != (p | 0)) {
+                                l = +Zw(f, a, p, i);
+                                g = (e + (i << 3)) | 0;
+                                m = O(i, a) | 0;
+                                k = +D(+l, +B);
+                                k = 1.0 / (t ? l * l : k);
+                                j = 0;
+                                while (1) {
+                                  if ((j | 0) >= (a | 0)) break c;
+                                  q = (A + (j << 3)) | 0;
+                                  h[q >> 3] =
+                                    +h[g >> 3] *
+                                      E *
+                                      (+h[(f + ((j + n) << 3)) >> 3] - +h[(f + ((j + m) << 3)) >> 3]) *
+                                      k +
+                                    +h[q >> 3];
+                                  j = (j + 1) | 0;
+                                }
+                              }
+                            while (0);
+                            i = (i + 1) | 0;
+                          }
+                        } else {
+                          i = 0;
+                          while (1) {
+                            if ((i | 0) == (T | 0)) {
+                              i = 0;
+                              break b;
+                            }
+                            d: do
+                              if ((i | 0) != (p | 0)) {
+                                l = +Zw(f, a, p, i);
+                                g = O(i, a) | 0;
+                                k = +D(+l, +B);
+                                k = 1.0 / (t ? l * l : k);
+                                j = 0;
+                                while (1) {
+                                  if ((j | 0) >= (a | 0)) break d;
+                                  q = (A + (j << 3)) | 0;
+                                  h[q >> 3] =
+                                    (+h[(f + ((j + n) << 3)) >> 3] - +h[(f + ((j + g) << 3)) >> 3]) * E * k +
+                                    +h[q >> 3];
+                                  j = (j + 1) | 0;
+                                }
+                              }
+                            while (0);
+                            i = (i + 1) | 0;
+                          }
+                        }
+                      while (0);
+                      while (1) {
+                        if ((i | 0) >= (a | 0)) break;
+                        q = (U + ((i + n) << 3)) | 0;
+                        h[q >> 3] = +h[q >> 3] + +h[(A + (i << 3)) >> 3];
+                        i = (i + 1) | 0;
+                      }
+                      p = (p + 1) | 0;
+                    }
+                    e: while (1) {
+                      if ((n | 0) < (T | 0)) i = 0;
+                      else {
+                        l = 0.0;
+                        j = 0;
+                        break;
+                      }
+                      while (1) {
+                        if ((i | 0) >= (a | 0)) break;
+                        h[(A + (i << 3)) >> 3] = 0.0;
+                        i = (i + 1) | 0;
+                      }
+                      p = (n + 1) | 0;
+                      g = (G + (p << 2)) | 0;
+                      q = O(n, a) | 0;
+                      j = c[(G + (n << 2)) >> 2] | 0;
+                      while (1) {
+                        if ((j | 0) >= (c[g >> 2] | 0)) {
+                          i = 0;
+                          break;
+                        }
+                        m = (H + (j << 2)) | 0;
+                        i = c[m >> 2] | 0;
+                        f: do
+                          if ((i | 0) != (n | 0)) {
+                            k = +_w(f, a, n, i) * z;
+                            i = 0;
+                            while (1) {
+                              if ((i | 0) >= (a | 0)) break f;
+                              l =
+                                k *
+                                (+h[(f + ((i + q) << 3)) >> 3] - +h[(f + (((O(c[m >> 2] | 0, a) | 0) + i) << 3)) >> 3]);
+                              V = (A + (i << 3)) | 0;
+                              h[V >> 3] = +h[V >> 3] - l;
+                              i = (i + 1) | 0;
+                            }
+                          }
+                        while (0);
+                        j = (j + 1) | 0;
+                      }
+                      while (1) {
+                        if ((i | 0) >= (a | 0)) {
+                          n = p;
+                          continue e;
+                        }
+                        V = (U + ((i + q) << 3)) | 0;
+                        h[V >> 3] = +h[V >> 3] + +h[(A + (i << 3)) >> 3];
+                        i = (i + 1) | 0;
+                      }
+                    }
+                    while (1) {
+                      if ((j | 0) >= (T | 0)) break;
+                      g = O(j, a) | 0;
+                      i = 0;
+                      while (1) {
+                        if ((i | 0) >= (a | 0)) {
+                          k = 0.0;
+                          i = 0;
+                          break;
+                        }
+                        h[(A + (i << 3)) >> 3] = +h[(U + ((i + g) << 3)) >> 3];
+                        i = (i + 1) | 0;
+                      }
+                      while (1) {
+                        if ((i | 0) >= (a | 0)) break;
+                        W = +h[(A + (i << 3)) >> 3];
+                        k = W * W + k;
+                        i = (i + 1) | 0;
+                      }
+                      k = +C(+k);
+                      l = k + l;
+                      g: do
+                        if (k > 0.0) {
+                          k = 1.0 / k;
+                          i = 0;
+                          while (1) {
+                            if ((i | 0) >= (a | 0)) {
+                              i = 0;
+                              break g;
+                            }
+                            V = (A + (i << 3)) | 0;
+                            h[V >> 3] = +h[V >> 3] * k;
+                            i = (i + 1) | 0;
+                          }
+                        } else i = 0;
+                      while (0);
+                      while (1) {
+                        if ((i | 0) >= (a | 0)) break;
+                        V = (f + ((i + g) << 3)) | 0;
+                        h[V >> 3] = +h[V >> 3] + +h[(A + (i << 3)) >> 3] * r;
+                        i = (i + 1) | 0;
+                      }
+                      j = (j + 1) | 0;
+                    }
+                    s = (s + 1) | 0;
+                    r = +jq(S, r, l, o, R);
+                    if (!(((s | 0) < (Q | 0)) & (r > P))) break;
+                    else o = l;
+                  }
+                  if (c[(d + 112) >> 2] | 0) kq(a, F, f);
+                  U1(v);
+                  if ((F | 0) != (b | 0)) qw(F);
+                  U1(A);
+                } else c[g >> 2] = -100;
+                if (K | 0) U1(L);
+                if (J | 0) U1(M);
+                if (I | 0) U1(N);
+                U1(U);
+              }
+              return;
+            }
+            function oq(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0.0,
+                r = 0.0,
+                s = 0.0,
+                t = 0.0,
+                u = 0.0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                E = 0.0,
+                F = 0,
+                G = 0,
+                H = 0.0,
+                I = 0.0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0.0,
+                P = 0.0,
+                Q = 0,
+                R = 0,
+                S = 0,
+                T = 0,
+                U = 0,
+                V = 0.0,
+                W = 0,
+                X = 0.0,
+                Y = 0,
+                Z = 0,
+                _ = 0,
+                $ = 0,
+                aa = 0,
+                ba = 0,
+                ca = 0,
+                da = 0,
+                ea = 0,
+                fa = 0,
+                ga = 0,
+                ha = 0.0,
+                ia = 0;
+              ga = l;
+              l = (l + 32) | 0;
+              _ = (ga + 24) | 0;
+              $ = (ga + 20) | 0;
+              da = (ga + 16) | 0;
+              ea = (ga + 12) | 0;
+              fa = (ga + 8) | 0;
+              U = ga;
+              s = +h[d >> 3];
+              k = (d + 24) | 0;
+              r = +h[k >> 3];
+              m = (d + 32) | 0;
+              q = +h[m >> 3];
+              V = +h[(d + 72) >> 3];
+              W = c[(d + 80) >> 2] | 0;
+              X = +h[(d + 88) >> 3];
+              t = +h[(d + 96) >> 3];
+              Y = c[(d + 104) >> 2] | 0;
+              c[_ >> 2] = 0;
+              c[$ >> 2] = 10;
+              c[da >> 2] = 0;
+              c[ea >> 2] = 0;
+              c[fa >> 2] = 0;
+              h[U >> 3] = 0.0;
+              ca = (d + 56) | 0;
+              n = c[ca >> 2] | 0;
+              if (
+                !(((b | 0) == 0) | ((W | 0) < 1))
+                  ? ((Z = c[b >> 2] | 0), (i = c[(b + 4) >> 2] | 0), !(((a | 0) < 1) | ((i | 0) < 1)))
+                  : 0
+              ) {
+                if ((i | 0) < (c[(d + 52) >> 2] | 0)) {
+                  ba = 0;
+                  aa = 0;
+                } else {
+                  ba = aq(n) | 0;
+                  c[da >> 2] = KK((a * 80) | 0) | 0;
+                  c[ea >> 2] = KK(80) | 0;
+                  c[fa >> 2] = KK(80) | 0;
+                  aa = 1;
+                }
+                c[g >> 2] = 0;
+                a: do
+                  if ((Z | 0) == (i | 0)) {
+                    o = vw(b, 1) | 0;
+                    Q = c[(o + 20) >> 2] | 0;
+                    R = c[(o + 24) >> 2] | 0;
+                    b: do
+                      if (c[(d + 16) >> 2] | 0) {
+                        w5(c[(d + 108) >> 2] | 0);
+                        j = O(Z, a) | 0;
+                        i = 0;
+                        while (1) {
+                          if ((i | 0) >= (j | 0)) break b;
+                          h[(f + (i << 3)) >> 3] = +Sw();
+                          i = (i + 1) | 0;
+                        }
+                      }
+                    while (0);
+                    if (r < 0.0) {
+                      r = +dq(o, a, f);
+                      h[k >> 3] = r;
+                    }
+                    if (q < 0.0) {
+                      h[m >> 3] = 0.2;
+                      q = 0.2;
+                    }
+                    if (s >= 0.0) {
+                      h[d >> 3] = -1.0;
+                      s = -1.0;
+                    }
+                    N = 1.0 - s;
+                    P = +D(+r, +N);
+                    I = +D(+q, +((2.0 - s) * 0.3333333333333333)) / r;
+                    J = a << 3;
+                    S = KK(J) | 0;
+                    J = O(Z, J) | 0;
+                    T = KK(J) | 0;
+                    K = (aa | 0) != 0;
+                    L = (d + 116) | 0;
+                    M = (d + 64) | 0;
+                    F = s == -1.0;
+                    G = (e | 0) != 0;
+                    H = 1.0 / +(Z | 0);
+                    i = 0;
+                    B = 0;
+                    E = 0.0;
+                    while (1) {
+                      B = (B + 1) | 0;
+                      W6(T | 0, f | 0, J | 0) | 0;
+                      if (K) {
+                        i = cq(ba) | 0;
+                        n = i;
+                        i = hw(a, Z, i, f, (c[L >> 2] | 0) == 0 ? 0 : e) | 0;
+                      }
+                      u = 0.0;
+                      s = 0.0;
+                      v = 0;
+                      r = 0.0;
+                      c: while (1) {
+                        if ((v | 0) < (Z | 0)) j = 0;
+                        else break;
+                        while (1) {
+                          if ((j | 0) >= (a | 0)) break;
+                          h[(S + (j << 3)) >> 3] = 0.0;
+                          j = (j + 1) | 0;
+                        }
+                        z = (v + 1) | 0;
+                        m = (Q + (z << 2)) | 0;
+                        A = O(v, a) | 0;
+                        k = c[(Q + (v << 2)) >> 2] | 0;
+                        while (1) {
+                          if ((k | 0) >= (c[m >> 2] | 0)) break;
+                          p = (R + (k << 2)) | 0;
+                          j = c[p >> 2] | 0;
+                          d: do
+                            if ((j | 0) != (v | 0)) {
+                              q = +_w(f, a, v, j) * I;
+                              j = 0;
+                              while (1) {
+                                if ((j | 0) >= (a | 0)) break d;
+                                ha =
+                                  q *
+                                  (+h[(f + ((j + A) << 3)) >> 3] -
+                                    +h[(f + (((O(c[p >> 2] | 0, a) | 0) + j) << 3)) >> 3]);
+                                y = (S + (j << 3)) | 0;
+                                h[y >> 3] = +h[y >> 3] - ha;
+                                j = (j + 1) | 0;
+                              }
+                            }
+                          while (0);
+                          k = (k + 1) | 0;
+                        }
+                        e: do
+                          if (!K)
+                            if (G & ((c[L >> 2] | 0) != 0)) {
+                              j = 0;
+                              while (1) {
+                                if ((j | 0) == (Z | 0)) break e;
+                                f: do
+                                  if ((j | 0) != (v | 0)) {
+                                    ha = +Zw(f, a, v, j);
+                                    m = (e + (j << 3)) | 0;
+                                    p = O(j, a) | 0;
+                                    q = +D(+ha, +N);
+                                    q = 1.0 / (F ? ha * ha : q);
+                                    k = 0;
+                                    while (1) {
+                                      if ((k | 0) >= (a | 0)) break f;
+                                      y = (S + (k << 3)) | 0;
+                                      h[y >> 3] =
+                                        +h[m >> 3] *
+                                          P *
+                                          (+h[(f + ((k + A) << 3)) >> 3] - +h[(f + ((k + p) << 3)) >> 3]) *
+                                          q +
+                                        +h[y >> 3];
+                                      k = (k + 1) | 0;
+                                    }
+                                  }
+                                while (0);
+                                j = (j + 1) | 0;
+                              }
+                            } else {
+                              j = 0;
+                              while (1) {
+                                if ((j | 0) == (Z | 0)) break e;
+                                g: do
+                                  if ((j | 0) != (v | 0)) {
+                                    ha = +Zw(f, a, v, j);
+                                    m = O(j, a) | 0;
+                                    q = +D(+ha, +N);
+                                    q = 1.0 / (F ? ha * ha : q);
+                                    k = 0;
+                                    while (1) {
+                                      if ((k | 0) >= (a | 0)) break g;
+                                      y = (S + (k << 3)) | 0;
+                                      h[y >> 3] =
+                                        (+h[(f + ((k + A) << 3)) >> 3] - +h[(f + ((k + m) << 3)) >> 3]) * P * q +
+                                        +h[y >> 3];
+                                      k = (k + 1) | 0;
+                                    }
+                                  }
+                                while (0);
+                                j = (j + 1) | 0;
+                              }
+                            }
+                          else {
+                            bw(i, +h[M >> 3], (f + (A << 3)) | 0, v, _, $, da, ea, fa, U, g);
+                            u = +h[U >> 3] + u;
+                            y = c[_ >> 2] | 0;
+                            s = s + +(y | 0);
+                            if (c[g >> 2] | 0) {
+                              m = S;
+                              k = T;
+                              i = S;
+                              j = T;
+                              p = 67;
+                              break a;
+                            }
+                            m = c[fa >> 2] | 0;
+                            p = c[ea >> 2] | 0;
+                            v = c[da >> 2] | 0;
+                            j = 0;
+                            while (1) {
+                              if ((j | 0) >= (y | 0)) break e;
+                              ha = +h[(m + (j << 3)) >> 3];
+                              ha = ha > 1.0e-15 ? ha : 1.0e-15;
+                              w = (p + (j << 3)) | 0;
+                              x = O(j, a) | 0;
+                              q = +D(+ha, +N);
+                              q = 1.0 / (F ? ha * ha : q);
+                              k = 0;
+                              while (1) {
+                                if ((k | 0) >= (a | 0)) break;
+                                ia = (S + (k << 3)) | 0;
+                                h[ia >> 3] =
+                                  +h[w >> 3] * P * (+h[(f + ((k + A) << 3)) >> 3] - +h[(v + ((k + x) << 3)) >> 3]) * q +
+                                  +h[ia >> 3];
+                                k = (k + 1) | 0;
+                              }
+                              j = (j + 1) | 0;
+                            }
+                          }
+                        while (0);
+                        q = 0.0;
+                        j = 0;
+                        while (1) {
+                          if ((j | 0) >= (a | 0)) break;
+                          ha = +h[(S + (j << 3)) >> 3];
+                          q = ha * ha + q;
+                          j = (j + 1) | 0;
+                        }
+                        q = +C(+q);
+                        r = q + r;
+                        h: do
+                          if (q > 0.0) {
+                            q = 1.0 / q;
+                            j = 0;
+                            while (1) {
+                              if ((j | 0) >= (a | 0)) {
+                                j = 0;
+                                break h;
+                              }
+                              ia = (S + (j << 3)) | 0;
+                              h[ia >> 3] = +h[ia >> 3] * q;
+                              j = (j + 1) | 0;
+                            }
+                          } else j = 0;
+                        while (0);
+                        while (1) {
+                          if ((j | 0) >= (a | 0)) {
+                            v = z;
+                            continue c;
+                          }
+                          ia = (f + ((j + A) << 3)) | 0;
+                          h[ia >> 3] = +h[ia >> 3] + +h[(S + (j << 3)) >> 3] * t;
+                          j = (j + 1) | 0;
+                        }
+                      }
+                      if (i | 0) {
+                        ow(i);
+                        bq(ba, s * H * 5.0 + u * H);
+                      }
+                      t = +jq(Y, t, r, E, X);
+                      if (!(((B | 0) < (W | 0)) & (t > V))) break;
+                      else E = r;
+                    }
+                    if (!(c[(d + 112) >> 2] | 0)) {
+                      m = S;
+                      k = T;
+                      j = T;
+                      i = S;
+                      p = 66;
+                    } else {
+                      kq(a, o, f);
+                      m = S;
+                      k = T;
+                      j = T;
+                      i = S;
+                      p = 66;
+                    }
+                  } else {
+                    c[g >> 2] = -100;
+                    o = b;
+                    m = 0;
+                    k = 0;
+                    j = 0;
+                    i = 0;
+                    p = 66;
+                  }
+                while (0);
+                if ((p | 0) == 66) if (aa) p = 67;
+                if ((p | 0) == 67) {
+                  $p(ba);
+                  c[ca >> 2] = n;
+                }
+                if (k | 0) U1(j);
+                if ((o | 0) != (b | 0)) qw(o);
+                if (m | 0) U1(i);
+                i = c[da >> 2] | 0;
+                if (i | 0) U1(i);
+                i = c[ea >> 2] | 0;
+                if (i | 0) U1(i);
+                i = c[fa >> 2] | 0;
+                if (i | 0) U1(i);
+              }
+              l = ga;
+              return;
+            }
+            function pq(a, b, d, e, f, g, i, j) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = +i;
+              j = j | 0;
+              var k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0.0,
+                q = 0,
+                r = 0.0,
+                s = 0,
+                t = 0.0,
+                u = 0.0,
+                v = 0.0,
+                w = 0,
+                x = 0,
+                y = 0.0,
+                z = 0,
+                A = 0,
+                B = 0.0,
+                E = 0,
+                F = 0.0,
+                G = 0.0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                P = 0,
+                Q = 0,
+                R = 0,
+                S = 0,
+                T = 0,
+                U = 0,
+                V = 0,
+                W = 0,
+                X = 0,
+                Y = 0.0,
+                Z = 0,
+                _ = 0.0,
+                $ = 0,
+                aa = 0,
+                ba = 0,
+                ca = 0,
+                da = 0,
+                ea = 0,
+                fa = 0,
+                ga = 0,
+                ha = 0.0,
+                ia = 0;
+              ga = l;
+              l = (l + 48) | 0;
+              o = (ga + 8) | 0;
+              ba = (ga + 40) | 0;
+              ca = (ga + 36) | 0;
+              W = (ga + 32) | 0;
+              ea = (ga + 28) | 0;
+              fa = (ga + 24) | 0;
+              X = ga;
+              p = +h[e >> 3];
+              q = (e + 32) | 0;
+              r = +h[q >> 3];
+              Y = +h[(e + 72) >> 3];
+              Z = c[(e + 80) >> 2] | 0;
+              _ = +h[(e + 88) >> 3];
+              t = +h[(e + 96) >> 3];
+              $ = c[(e + 104) >> 2] | 0;
+              c[ba >> 2] = 0;
+              c[ca >> 2] = 10;
+              c[W >> 2] = 0;
+              c[ea >> 2] = 0;
+              c[fa >> 2] = 0;
+              h[X >> 3] = 0.0;
+              if (
+                !(((b | 0) == 0) | ((Z | 0) < 1))
+                  ? ((aa = c[b >> 2] | 0), (n = c[(b + 4) >> 2] | 0), !(((a | 0) < 1) | ((n | 0) < 1)))
+                  : 0
+              ) {
+                if ((c[(e + 132) >> 2] | 0) != 0 ? (n | 0) >= (c[(e + 52) >> 2] | 0) : 0) {
+                  m = KK((a * 80) | 0) | 0;
+                  c[W >> 2] = m;
+                  c[ea >> 2] = KK(80) | 0;
+                  c[fa >> 2] = KK(80) | 0;
+                  s = 1;
+                  k = m;
+                } else {
+                  s = 0;
+                  k = 0;
+                  m = 0;
+                }
+                c[j >> 2] = 0;
+                if ((aa | 0) == (n | 0)) {
+                  V = vw(b, 1) | 0;
+                  if (!d) {
+                    U = 0;
+                    k = V;
+                  } else {
+                    U = c[(d + 28) >> 2] | 0;
+                    k = d;
+                  }
+                  T = c[(k + 24) >> 2] | 0;
+                  S = c[(k + 20) >> 2] | 0;
+                  if (i < 0.0) {
+                    G = +qq(aa, S, U);
+                    F = +(c[(S + (aa << 2)) >> 2] | 0);
+                    B = +(aa | 0);
+                    i = ((F / (B * B - F)) * i) / +D(+G, +(p + 1.0));
+                    R = c[15712] | 0;
+                    h[o >> 3] = G;
+                    h[(o + 8) >> 3] = i;
+                    w4(R, 92231, o) | 0;
+                  }
+                  a: do
+                    if (c[(e + 16) >> 2] | 0) {
+                      U4(92253, 24, 1, c[15712] | 0) | 0;
+                      w5(c[(e + 108) >> 2] | 0);
+                      m = O(aa, a) | 0;
+                      k = 0;
+                      while (1) {
+                        if ((k | 0) >= (m | 0)) break a;
+                        h[(g + (k << 3)) >> 3] = +Sw();
+                        k = (k + 1) | 0;
+                      }
+                    }
+                  while (0);
+                  rq(aa, a, g, S, T, U);
+                  if (r < 0.0) h[q >> 3] = 0.2;
+                  if (p >= 0.0) {
+                    h[e >> 3] = -1.0;
+                    p = -1.0;
+                  }
+                  Q = a << 3;
+                  P = KK(Q) | 0;
+                  Q = O(aa, Q) | 0;
+                  R = KK(Q) | 0;
+                  I = (s | 0) != 0;
+                  J = (e + 116) | 0;
+                  K = (U | 0) == 0;
+                  L = (e + 8) | 0;
+                  M = (f | 0) != 0;
+                  N = p == -1.0;
+                  G = 1.0 - p;
+                  H = (e + 64) | 0;
+                  k = 0;
+                  E = 0;
+                  F = 0.0;
+                  p = 1.0;
+                  B = t;
+                  b: while (1) {
+                    E = (E + 1) | 0;
+                    W6(R | 0, g | 0, Q | 0) | 0;
+                    if (I) k = hw(a, aa, 10, g, (c[J >> 2] | 0) == 0 ? 0 : f) | 0;
+                    s = 0;
+                    t = 0.0;
+                    c: while (1) {
+                      if ((s | 0) < (aa | 0)) m = 0;
+                      else break;
+                      while (1) {
+                        if ((m | 0) >= (a | 0)) break;
+                        h[(P + (m << 3)) >> 3] = 0.0;
+                        m = (m + 1) | 0;
+                      }
+                      A = (s + 1) | 0;
+                      q = (S + (A << 2)) | 0;
+                      z = O(s, a) | 0;
+                      o = c[(S + (s << 2)) >> 2] | 0;
+                      while (1) {
+                        if ((o | 0) >= (c[q >> 2] | 0)) break;
+                        d = (T + (o << 2)) | 0;
+                        m = c[d >> 2] | 0;
+                        d: do
+                          if ((m | 0) != (s | 0)) {
+                            y = +Zw(g, a, s, m);
+                            if (!K) p = +h[(U + (o << 3)) >> 3];
+                            r = +h[L >> 3];
+                            e: do
+                              if (!(r == 2.0))
+                                if (r == 1.0) {
+                                  r = (y - p) * (1.0 / (p * p));
+                                  u = 1.0 / y;
+                                  m = 0;
+                                  while (1) {
+                                    if ((m | 0) >= (a | 0)) break e;
+                                    v =
+                                      r *
+                                      (+h[(g + ((m + z) << 3)) >> 3] -
+                                        +h[(g + (((O(c[d >> 2] | 0, a) | 0) + m) << 3)) >> 3]) *
+                                      u;
+                                    x = (P + (m << 3)) | 0;
+                                    h[x >> 3] = +h[x >> 3] - v;
+                                    m = (m + 1) | 0;
+                                  }
+                                } else {
+                                  r = 1.0 / +D(+p, +(r + 1.0));
+                                  u = y - p;
+                                  v = 1.0 / y;
+                                  m = 0;
+                                  while (1) {
+                                    if ((m | 0) >= (a | 0)) break e;
+                                    ha =
+                                      +h[(g + ((m + z) << 3)) >> 3] -
+                                      +h[(g + (((O(c[d >> 2] | 0, a) | 0) + m) << 3)) >> 3];
+                                    ha = r * ha * +D(+u, +(+h[L >> 3])) * v;
+                                    x = (P + (m << 3)) | 0;
+                                    h[x >> 3] = +h[x >> 3] - ha;
+                                    m = (m + 1) | 0;
+                                  }
+                                }
+                              else {
+                                r = y - p;
+                                r = r * r * (1.0 / (p * p * p));
+                                u = 1.0 / y;
+                                m = 0;
+                                while (1) {
+                                  if ((m | 0) >= (a | 0)) break e;
+                                  ha =
+                                    r *
+                                    (+h[(g + ((m + z) << 3)) >> 3] -
+                                      +h[(g + (((O(c[d >> 2] | 0, a) | 0) + m) << 3)) >> 3]) *
+                                    u;
+                                  x = (P + (m << 3)) | 0;
+                                  h[x >> 3] = +h[x >> 3] - ha;
+                                  m = (m + 1) | 0;
+                                }
+                              }
+                            while (0);
+                            if (M & ((c[J >> 2] | 0) != 0)) {
+                              n = (f + (o << 3)) | 0;
+                              r = +D(+y, +G);
+                              r = 1.0 / (N ? y * y : r);
+                              m = 0;
+                              while (1) {
+                                if ((m | 0) >= (a | 0)) break d;
+                                ha =
+                                  +h[n >> 3] *
+                                  i *
+                                  (+h[(g + ((m + z) << 3)) >> 3] -
+                                    +h[(g + (((O(c[d >> 2] | 0, a) | 0) + m) << 3)) >> 3]) *
+                                  r;
+                                x = (P + (m << 3)) | 0;
+                                h[x >> 3] = +h[x >> 3] - ha;
+                                m = (m + 1) | 0;
+                              }
+                            } else {
+                              r = +D(+y, +G);
+                              r = 1.0 / (N ? y * y : r);
+                              m = 0;
+                              while (1) {
+                                if ((m | 0) >= (a | 0)) break d;
+                                ha =
+                                  (+h[(g + ((m + z) << 3)) >> 3] -
+                                    +h[(g + (((O(c[d >> 2] | 0, a) | 0) + m) << 3)) >> 3]) *
+                                  i *
+                                  r;
+                                x = (P + (m << 3)) | 0;
+                                h[x >> 3] = +h[x >> 3] - ha;
+                                m = (m + 1) | 0;
+                              }
+                            }
+                          }
+                        while (0);
+                        o = (o + 1) | 0;
+                      }
+                      f: do
+                        if (!I)
+                          if (M & ((c[J >> 2] | 0) != 0)) {
+                            m = 0;
+                            while (1) {
+                              if ((m | 0) == (aa | 0)) {
+                                r = 0.0;
+                                m = 0;
+                                break f;
+                              }
+                              g: do
+                                if ((m | 0) != (s | 0)) {
+                                  ha = +Zw(g, a, s, m);
+                                  d = (f + (m << 3)) | 0;
+                                  o = O(m, a) | 0;
+                                  r = +D(+ha, +G);
+                                  r = 1.0 / (N ? ha * ha : r);
+                                  n = 0;
+                                  while (1) {
+                                    if ((n | 0) >= (a | 0)) break g;
+                                    x = (P + (n << 3)) | 0;
+                                    h[x >> 3] =
+                                      +h[d >> 3] *
+                                        i *
+                                        (+h[(g + ((n + z) << 3)) >> 3] - +h[(g + ((n + o) << 3)) >> 3]) *
+                                        r +
+                                      +h[x >> 3];
+                                    n = (n + 1) | 0;
+                                  }
+                                }
+                              while (0);
+                              m = (m + 1) | 0;
+                            }
+                          } else {
+                            m = 0;
+                            while (1) {
+                              if ((m | 0) == (aa | 0)) {
+                                r = 0.0;
+                                m = 0;
+                                break f;
+                              }
+                              h: do
+                                if ((m | 0) != (s | 0)) {
+                                  ha = +Zw(g, a, s, m);
+                                  d = O(m, a) | 0;
+                                  r = +D(+ha, +G);
+                                  r = 1.0 / (N ? ha * ha : r);
+                                  n = 0;
+                                  while (1) {
+                                    if ((n | 0) >= (a | 0)) break h;
+                                    x = (P + (n << 3)) | 0;
+                                    h[x >> 3] =
+                                      (+h[(g + ((n + z) << 3)) >> 3] - +h[(g + ((n + d) << 3)) >> 3]) * i * r +
+                                      +h[x >> 3];
+                                    n = (n + 1) | 0;
+                                  }
+                                }
+                              while (0);
+                              m = (m + 1) | 0;
+                            }
+                          }
+                        else {
+                          bw(k, +h[H >> 3], (g + (z << 3)) | 0, s, ba, ca, W, ea, fa, X, j);
+                          d = c[ba >> 2] | 0;
+                          if (c[j >> 2] | 0) break b;
+                          o = c[fa >> 2] | 0;
+                          q = c[ea >> 2] | 0;
+                          s = c[W >> 2] | 0;
+                          m = 0;
+                          while (1) {
+                            if ((m | 0) >= (d | 0)) {
+                              r = 0.0;
+                              m = 0;
+                              break f;
+                            }
+                            ha = +h[(o + (m << 3)) >> 3];
+                            ha = ha > 1.0e-15 ? ha : 1.0e-15;
+                            w = (q + (m << 3)) | 0;
+                            x = O(m, a) | 0;
+                            r = +D(+ha, +G);
+                            r = 1.0 / (N ? ha * ha : r);
+                            n = 0;
+                            while (1) {
+                              if ((n | 0) >= (a | 0)) break;
+                              ia = (P + (n << 3)) | 0;
+                              h[ia >> 3] =
+                                +h[w >> 3] * i * (+h[(g + ((n + z) << 3)) >> 3] - +h[(s + ((n + x) << 3)) >> 3]) * r +
+                                +h[ia >> 3];
+                              n = (n + 1) | 0;
+                            }
+                            m = (m + 1) | 0;
+                          }
+                        }
+                      while (0);
+                      while (1) {
+                        if ((m | 0) >= (a | 0)) break;
+                        ha = +h[(P + (m << 3)) >> 3];
+                        r = ha * ha + r;
+                        m = (m + 1) | 0;
+                      }
+                      r = +C(+r);
+                      t = r + t;
+                      i: do
+                        if (r > 0.0) {
+                          r = 1.0 / r;
+                          m = 0;
+                          while (1) {
+                            if ((m | 0) >= (a | 0)) {
+                              m = 0;
+                              break i;
+                            }
+                            ia = (P + (m << 3)) | 0;
+                            h[ia >> 3] = +h[ia >> 3] * r;
+                            m = (m + 1) | 0;
+                          }
+                        } else m = 0;
+                      while (0);
+                      while (1) {
+                        if ((m | 0) >= (a | 0)) {
+                          s = A;
+                          continue c;
+                        }
+                        ia = (g + ((m + z) << 3)) | 0;
+                        h[ia >> 3] = +h[ia >> 3] + +h[(P + (m << 3)) >> 3] * B;
+                        m = (m + 1) | 0;
+                      }
+                    }
+                    if (k | 0) ow(k);
+                    B = +jq($, B, t, F, _);
+                    if (!(((E | 0) < (Z | 0)) & (B > Y))) {
+                      da = 83;
+                      break;
+                    } else F = t;
+                  }
+                  if ((da | 0) == 83 ? c[(e + 112) >> 2] | 0 : 0) kq(a, V, g);
+                  U1(R);
+                  if ((V | 0) != (b | 0)) qw(V);
+                  U1(P);
+                  k = c[W >> 2] | 0;
+                  m = k;
+                } else c[j >> 2] = -100;
+                if (m | 0) U1(k);
+                k = c[ea >> 2] | 0;
+                if (k | 0) U1(k);
+                k = c[fa >> 2] | 0;
+                if (k | 0) U1(k);
+              }
+              l = ga;
+              return;
+            }
+            function qq(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0.0;
+              if (!d) e = 1.0;
+              else {
+                f = 0;
+                e = 0.0;
+                a: while (1) {
+                  if ((f | 0) >= (a | 0)) break;
+                  g = (f + 1) | 0;
+                  i = c[(b + (g << 2)) >> 2] | 0;
+                  f = c[(b + (f << 2)) >> 2] | 0;
+                  while (1) {
+                    if ((f | 0) >= (i | 0)) {
+                      f = g;
+                      continue a;
+                    }
+                    j = +h[(d + (f << 3)) >> 3] + e;
+                    f = (f + 1) | 0;
+                    e = j;
+                  }
+                }
+                e = e / +(c[(b + (a << 2)) >> 2] | 0);
+              }
+              return +e;
+            }
+            function rq(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0.0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0.0;
+              v = l;
+              l = (l + 16) | 0;
+              u = v;
+              t = (g | 0) == 0;
+              k = 0.0;
+              m = 0.0;
+              n = 1.0;
+              j = 0;
+              a: while (1) {
+                if ((j | 0) >= (a | 0)) break;
+                r = (j + 1) | 0;
+                s = (e + (r << 2)) | 0;
+                q = c[(e + (j << 2)) >> 2] | 0;
+                while (1) {
+                  if ((q | 0) >= (c[s >> 2] | 0)) {
+                    j = r;
+                    continue a;
+                  }
+                  i = c[(f + (q << 2)) >> 2] | 0;
+                  b: do
+                    if ((i | 0) != (j | 0)) {
+                      o = +Zw(d, b, j, i);
+                      if (!t) n = +h[(g + (q << 3)) >> 3];
+                      w = 1.0 / (n * n);
+                      p = n * o * w;
+                      o = o * o * w;
+                      i = 0;
+                      while (1) {
+                        if ((i | 0) >= (b | 0)) break b;
+                        i = (i + 1) | 0;
+                        k = k + o;
+                        m = m + p;
+                      }
+                    }
+                  while (0);
+                  q = (q + 1) | 0;
+                }
+              }
+              k = m / k;
+              j = O(b, a) | 0;
+              i = 0;
+              while (1) {
+                if ((i | 0) >= (j | 0)) break;
+                b = (d + (i << 3)) | 0;
+                h[b >> 3] = +h[b >> 3] * k;
+                i = (i + 1) | 0;
+              }
+              d = c[15712] | 0;
+              h[u >> 3] = k;
+              w4(d, 92278, u) | 0;
+              l = v;
+              return;
+            }
+            function sq(a, b, d, e, f, g, i) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              var j = 0,
+                k = 0,
+                m = 0,
+                n = 0.0,
+                o = 0.0,
+                p = 0,
+                q = 0,
+                r = 0.0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0.0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0.0,
+                A = 0,
+                B = 0,
+                E = 0,
+                F = 0,
+                G = 0.0,
+                H = 0,
+                I = 0.0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0.0,
+                N = 0.0,
+                P = 0,
+                Q = 0,
+                R = 0,
+                S = 0,
+                T = 0,
+                U = 0,
+                V = 0,
+                W = 0.0,
+                X = 0,
+                Y = 0.0,
+                Z = 0,
+                _ = 0,
+                $ = 0,
+                aa = 0,
+                ba = 0,
+                ca = 0,
+                da = 0,
+                ea = 0,
+                fa = 0,
+                ga = 0.0,
+                ha = 0.0,
+                ia = 0;
+              fa = l;
+              l = (l + 32) | 0;
+              $ = (fa + 24) | 0;
+              aa = (fa + 20) | 0;
+              ba = (fa + 16) | 0;
+              da = (fa + 12) | 0;
+              ea = (fa + 8) | 0;
+              V = fa;
+              r = +h[e >> 3];
+              p = (e + 24) | 0;
+              o = +h[p >> 3];
+              q = (e + 32) | 0;
+              n = +h[q >> 3];
+              W = +h[(e + 72) >> 3];
+              X = c[(e + 80) >> 2] | 0;
+              Y = +h[(e + 88) >> 3];
+              v = +h[(e + 96) >> 3];
+              Z = c[(e + 104) >> 2] | 0;
+              c[$ >> 2] = 0;
+              c[aa >> 2] = 10;
+              c[ba >> 2] = 0;
+              c[da >> 2] = 0;
+              c[ea >> 2] = 0;
+              h[V >> 3] = 0.0;
+              if (
+                !(((b | 0) == 0) | ((X | 0) < 1))
+                  ? ((_ = c[b >> 2] | 0), (m = c[(b + 4) >> 2] | 0), !(((a | 0) < 1) | ((m | 0) < 1)))
+                  : 0
+              ) {
+                if ((m | 0) < (c[(e + 52) >> 2] | 0)) {
+                  s = 0;
+                  j = 0;
+                  k = 0;
+                } else {
+                  k = KK((a * 80) | 0) | 0;
+                  c[ba >> 2] = k;
+                  c[da >> 2] = KK(80) | 0;
+                  c[ea >> 2] = KK(80) | 0;
+                  s = 1;
+                  j = k;
+                }
+                c[i >> 2] = 0;
+                if ((_ | 0) == (m | 0)) {
+                  Q = vw(b, 1) | 0;
+                  R = c[(Q + 20) >> 2] | 0;
+                  S = c[(Q + 24) >> 2] | 0;
+                  T = c[(d + 20) >> 2] | 0;
+                  U = c[(d + 24) >> 2] | 0;
+                  P = c[(d + 28) >> 2] | 0;
+                  a: do
+                    if (c[(e + 16) >> 2] | 0) {
+                      w5(c[(e + 108) >> 2] | 0);
+                      k = O(_, a) | 0;
+                      j = 0;
+                      while (1) {
+                        if ((j | 0) >= (k | 0)) break a;
+                        h[(g + (j << 3)) >> 3] = +Sw();
+                        j = (j + 1) | 0;
+                      }
+                    }
+                  while (0);
+                  if (o < 0.0) {
+                    o = +dq(Q, a, g);
+                    h[p >> 3] = o;
+                  }
+                  if (n < 0.0) {
+                    h[q >> 3] = 0.2;
+                    n = 0.2;
+                  }
+                  if (r >= 0.0) {
+                    h[e >> 3] = -1.0;
+                    r = -1.0;
+                  }
+                  M = 1.0 - r;
+                  N = +D(+o, +M);
+                  I = +D(+n, +((2.0 - r) * 0.3333333333333333)) / o;
+                  K = a << 3;
+                  J = KK(K) | 0;
+                  K = O(_, K) | 0;
+                  L = KK(K) | 0;
+                  E = (s | 0) != 0;
+                  F = (e + 116) | 0;
+                  G = I * 0.2;
+                  H = (e + 64) | 0;
+                  A = r == -1.0;
+                  B = (f | 0) != 0;
+                  j = 0;
+                  y = 0;
+                  z = 0.0;
+                  b: while (1) {
+                    y = (y + 1) | 0;
+                    W6(L | 0, g | 0, K | 0) | 0;
+                    if (E) j = hw(a, _, 10, g, (c[F >> 2] | 0) == 0 ? 0 : f) | 0;
+                    s = 0;
+                    o = 0.0;
+                    c: while (1) {
+                      if ((s | 0) < (_ | 0)) k = 0;
+                      else break;
+                      while (1) {
+                        if ((k | 0) >= (a | 0)) break;
+                        h[(J + (k << 3)) >> 3] = 0.0;
+                        k = (k + 1) | 0;
+                      }
+                      w = (s + 1) | 0;
+                      d = (R + (w << 2)) | 0;
+                      x = O(s, a) | 0;
+                      m = c[(R + (s << 2)) >> 2] | 0;
+                      while (1) {
+                        if ((m | 0) >= (c[d >> 2] | 0)) break;
+                        p = (S + (m << 2)) | 0;
+                        k = c[p >> 2] | 0;
+                        d: do
+                          if ((k | 0) != (s | 0)) {
+                            n = +_w(g, a, s, k) * I;
+                            k = 0;
+                            while (1) {
+                              if ((k | 0) >= (a | 0)) break d;
+                              r =
+                                n *
+                                (+h[(g + ((k + x) << 3)) >> 3] - +h[(g + (((O(c[p >> 2] | 0, a) | 0) + k) << 3)) >> 3]);
+                              u = (J + (k << 3)) | 0;
+                              h[u >> 3] = +h[u >> 3] - r;
+                              k = (k + 1) | 0;
+                            }
+                          }
+                        while (0);
+                        m = (m + 1) | 0;
+                      }
+                      p = (T + (w << 2)) | 0;
+                      d = c[(T + (s << 2)) >> 2] | 0;
+                      while (1) {
+                        if ((d | 0) >= (c[p >> 2] | 0)) break;
+                        q = (U + (d << 2)) | 0;
+                        k = c[q >> 2] | 0;
+                        e: do
+                          if ((k | 0) != (s | 0)) {
+                            n = +Zw(g, a, s, k);
+                            m = (P + (d << 3)) | 0;
+                            r = 1.0 / n;
+                            k = 0;
+                            while (1) {
+                              if ((k | 0) >= (a | 0)) break e;
+                              ha = +h[m >> 3];
+                              ga = n - ha;
+                              ga =
+                                ga *
+                                ga *
+                                G *
+                                (+h[(g + ((k + x) << 3)) >> 3] -
+                                  +h[(g + (((O(c[q >> 2] | 0, a) | 0) + k) << 3)) >> 3]) *
+                                r;
+                              u = (J + (k << 3)) | 0;
+                              h[u >> 3] = (n < ha ? ga : -ga) + +h[u >> 3];
+                              k = (k + 1) | 0;
+                            }
+                          }
+                        while (0);
+                        d = (d + 1) | 0;
+                      }
+                      f: do
+                        if (!E)
+                          if (B & ((c[F >> 2] | 0) != 0)) {
+                            k = 0;
+                            while (1) {
+                              if ((k | 0) == (_ | 0)) {
+                                n = 0.0;
+                                k = 0;
+                                break f;
+                              }
+                              g: do
+                                if ((k | 0) != (s | 0)) {
+                                  ha = +Zw(g, a, s, k);
+                                  d = (f + (k << 3)) | 0;
+                                  p = O(k, a) | 0;
+                                  n = +D(+ha, +M);
+                                  n = 1.0 / (A ? ha * ha : n);
+                                  m = 0;
+                                  while (1) {
+                                    if ((m | 0) >= (a | 0)) break g;
+                                    u = (J + (m << 3)) | 0;
+                                    h[u >> 3] =
+                                      +h[d >> 3] *
+                                        N *
+                                        (+h[(g + ((m + x) << 3)) >> 3] - +h[(g + ((m + p) << 3)) >> 3]) *
+                                        n +
+                                      +h[u >> 3];
+                                    m = (m + 1) | 0;
+                                  }
+                                }
+                              while (0);
+                              k = (k + 1) | 0;
+                            }
+                          } else {
+                            k = 0;
+                            while (1) {
+                              if ((k | 0) == (_ | 0)) {
+                                n = 0.0;
+                                k = 0;
+                                break f;
+                              }
+                              h: do
+                                if ((k | 0) != (s | 0)) {
+                                  ha = +Zw(g, a, s, k);
+                                  d = O(k, a) | 0;
+                                  n = +D(+ha, +M);
+                                  n = 1.0 / (A ? ha * ha : n);
+                                  m = 0;
+                                  while (1) {
+                                    if ((m | 0) >= (a | 0)) break h;
+                                    u = (J + (m << 3)) | 0;
+                                    h[u >> 3] =
+                                      (+h[(g + ((m + x) << 3)) >> 3] - +h[(g + ((m + d) << 3)) >> 3]) * N * n +
+                                      +h[u >> 3];
+                                    m = (m + 1) | 0;
+                                  }
+                                }
+                              while (0);
+                              k = (k + 1) | 0;
+                            }
+                          }
+                        else {
+                          bw(j, +h[H >> 3], (g + (x << 3)) | 0, s, $, aa, ba, da, ea, V, i);
+                          d = c[$ >> 2] | 0;
+                          if (c[i >> 2] | 0) break b;
+                          p = c[ea >> 2] | 0;
+                          q = c[da >> 2] | 0;
+                          s = c[ba >> 2] | 0;
+                          k = 0;
+                          while (1) {
+                            if ((k | 0) >= (d | 0)) {
+                              n = 0.0;
+                              k = 0;
+                              break f;
+                            }
+                            ha = +h[(p + (k << 3)) >> 3];
+                            ha = ha > 1.0e-15 ? ha : 1.0e-15;
+                            t = (q + (k << 3)) | 0;
+                            u = O(k, a) | 0;
+                            n = +D(+ha, +M);
+                            n = 1.0 / (A ? ha * ha : n);
+                            m = 0;
+                            while (1) {
+                              if ((m | 0) >= (a | 0)) break;
+                              ia = (J + (m << 3)) | 0;
+                              h[ia >> 3] =
+                                +h[t >> 3] * N * (+h[(g + ((m + x) << 3)) >> 3] - +h[(s + ((m + u) << 3)) >> 3]) * n +
+                                +h[ia >> 3];
+                              m = (m + 1) | 0;
+                            }
+                            k = (k + 1) | 0;
+                          }
+                        }
+                      while (0);
+                      while (1) {
+                        if ((k | 0) >= (a | 0)) break;
+                        ha = +h[(J + (k << 3)) >> 3];
+                        n = ha * ha + n;
+                        k = (k + 1) | 0;
+                      }
+                      n = +C(+n);
+                      o = n + o;
+                      i: do
+                        if (n > 0.0) {
+                          n = 1.0 / n;
+                          k = 0;
+                          while (1) {
+                            if ((k | 0) >= (a | 0)) {
+                              k = 0;
+                              break i;
+                            }
+                            ia = (J + (k << 3)) | 0;
+                            h[ia >> 3] = +h[ia >> 3] * n;
+                            k = (k + 1) | 0;
+                          }
+                        } else k = 0;
+                      while (0);
+                      while (1) {
+                        if ((k | 0) >= (a | 0)) {
+                          s = w;
+                          continue c;
+                        }
+                        ia = (g + ((k + x) << 3)) | 0;
+                        h[ia >> 3] = +h[ia >> 3] + +h[(J + (k << 3)) >> 3] * v;
+                        k = (k + 1) | 0;
+                      }
+                    }
+                    if (j | 0) ow(j);
+                    v = +jq(Z, v, o, z, Y);
+                    if (!(((y | 0) < (X | 0)) & (v > W))) {
+                      ca = 70;
+                      break;
+                    } else z = o;
+                  }
+                  if ((ca | 0) == 70 ? c[(e + 112) >> 2] | 0 : 0) kq(a, Q, g);
+                  U1(L);
+                  if ((Q | 0) != (b | 0)) qw(Q);
+                  U1(J);
+                  j = c[ba >> 2] | 0;
+                  k = j;
+                } else c[i >> 2] = -100;
+                if (k | 0) U1(j);
+                j = c[da >> 2] | 0;
+                if (j | 0) U1(j);
+                j = c[ea >> 2] | 0;
+                if (j | 0) U1(j);
+              }
+              l = fa;
+              return;
+            }
+            function tq(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              n = c[(b + 20) >> 2] | 0;
+              o = c[(b + 24) >> 2] | 0;
+              p = KK(a << 3) | 0;
+              m = c[b >> 2] | 0;
+              k = 0;
+              a: while (1) {
+                if ((k | 0) < (m | 0)) b = 0;
+                else break;
+                while (1) {
+                  if ((b | 0) >= (a | 0)) break;
+                  h[(p + (b << 3)) >> 3] = 0.0;
+                  b = (b + 1) | 0;
+                }
+                l = (k + 1) | 0;
+                j = c[(n + (l << 2)) >> 2] | 0;
+                i = c[(n + (k << 2)) >> 2] | 0;
+                b = 0;
+                while (1) {
+                  if ((i | 0) >= (j | 0)) break;
+                  e = c[(o + (i << 2)) >> 2] | 0;
+                  if ((e | 0) != (k | 0)) {
+                    g = O(e, a) | 0;
+                    e = 0;
+                    while (1) {
+                      if ((e | 0) >= (a | 0)) break;
+                      q = (p + (e << 3)) | 0;
+                      h[q >> 3] = +h[q >> 3] + +h[(d + ((g + e) << 3)) >> 3];
+                      e = (e + 1) | 0;
+                    }
+                    b = (b + 1) | 0;
+                  }
+                  i = (i + 1) | 0;
+                }
+                if ((b | 0) <= 0) {
+                  k = l;
+                  continue;
+                }
+                f = 0.5 / +(b | 0);
+                e = O(k, a) | 0;
+                b = 0;
+                while (1) {
+                  if ((b | 0) >= (a | 0)) {
+                    k = l;
+                    continue a;
+                  }
+                  q = (d + ((b + e) << 3)) | 0;
+                  h[q >> 3] = +h[(p + (b << 3)) >> 3] * f + +h[q >> 3] * 0.5;
+                  b = (b + 1) | 0;
+                }
+              }
+              U1(p);
+              return;
+            }
+            function uq(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0.0;
+              i = c[(a + 20) >> 2] | 0;
+              j = c[(a + 24) >> 2] | 0;
+              h = c[a >> 2] | 0;
+              k = KK(((h << 2) + 4) | 0) | 0;
+              a = 0;
+              while (1) {
+                if ((a | 0) > (h | 0)) {
+                  d = 0;
+                  e = 0;
+                  break;
+                }
+                c[(k + (a << 2)) >> 2] = 0;
+                a = (a + 1) | 0;
+              }
+              while (1) {
+                if ((e | 0) >= (h | 0)) break;
+                f = (e + 1) | 0;
+                g = c[(i + (f << 2)) >> 2] | 0;
+                a = 0;
+                b = c[(i + (e << 2)) >> 2] | 0;
+                while (1) {
+                  if ((b | 0) >= (g | 0)) break;
+                  a = (a + (((e | 0) != (c[(j + (b << 2)) >> 2] | 0)) & 1)) | 0;
+                  b = (b + 1) | 0;
+                }
+                g = (k + (a << 2)) | 0;
+                e = ((c[g >> 2] | 0) + 1) | 0;
+                c[g >> 2] = e;
+                d = (d | 0) > (e | 0) ? d : e;
+                e = f;
+              }
+              l = +(c[(k + 4) >> 2] | 0);
+              if (+(d | 0) * 0.8 < l ? +(h | 0) * 0.3 < l : 0) a = 1;
+              else a = 0;
+              U1(k);
+              return a | 0;
+            }
+            function vq(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0,
+                e = 0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0.0,
+                r = 0.0;
+              o = l;
+              l = (l + 48) | 0;
+              n = (o + 16) | 0;
+              j = o;
+              g = O(b, b) | 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (g | 0)) {
+                  e = 0;
+                  break;
+                }
+                h[(n + (e << 3)) >> 3] = 0.0;
+                e = (e + 1) | 0;
+              }
+              while (1) {
+                if ((e | 0) >= (b | 0)) {
+                  g = 0;
+                  break;
+                }
+                h[(j + (e << 3)) >> 3] = 0.0;
+                e = (e + 1) | 0;
+              }
+              while (1) {
+                if ((g | 0) >= (a | 0)) break;
+                i = O(g, b) | 0;
+                e = 0;
+                while (1) {
+                  if ((e | 0) >= (b | 0)) break;
+                  m = (j + (e << 3)) | 0;
+                  h[m >> 3] = +h[m >> 3] + +h[(c + ((e + i) << 3)) >> 3];
+                  e = (e + 1) | 0;
+                }
+                g = (g + 1) | 0;
+              }
+              d = 1.0 / +(a | 0);
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (b | 0)) {
+                  g = 0;
+                  break;
+                }
+                m = (j + (e << 3)) | 0;
+                h[m >> 3] = +h[m >> 3] * d;
+                e = (e + 1) | 0;
+              }
+              while (1) {
+                if ((g | 0) >= (a | 0)) {
+                  i = 0;
+                  break;
+                }
+                i = O(g, b) | 0;
+                e = 0;
+                while (1) {
+                  if ((e | 0) >= (b | 0)) break;
+                  m = (c + ((e + i) << 3)) | 0;
+                  h[m >> 3] = +h[m >> 3] - +h[(j + (e << 3)) >> 3];
+                  e = (e + 1) | 0;
+                }
+                g = (g + 1) | 0;
+              }
+              while (1) {
+                if ((i | 0) >= (a | 0)) break;
+                j = O(i, b) | 0;
+                g = 0;
+                while (1) {
+                  if ((g | 0) >= (b | 0)) break;
+                  k = (c + ((g + j) << 3)) | 0;
+                  m = O(g, b) | 0;
+                  e = 0;
+                  while (1) {
+                    if ((e | 0) == (b | 0)) break;
+                    p = (n + ((e + m) << 3)) | 0;
+                    h[p >> 3] = +h[p >> 3] + +h[(c + ((e + j) << 3)) >> 3] * +h[k >> 3];
+                    e = (e + 1) | 0;
+                  }
+                  g = (g + 1) | 0;
+                }
+                i = (i + 1) | 0;
+              }
+              d = +h[(n + 8) >> 3];
+              if (d == 0.0) d = 0.0;
+              else {
+                q = +h[n >> 3];
+                f = +h[(n + 24) >> 3];
+                d = -(f - q - +C(+(q * q + d * d * 4.0 + (q * -2.0 + f) * f))) / (d * 2.0);
+              }
+              f = +C(+(d * d + 1.0));
+              d = d / f;
+              f = 1.0 / f;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (a | 0)) break;
+                p = O(e, b) | 0;
+                n = (c + (p << 3)) | 0;
+                q = +h[n >> 3];
+                p = (c + ((p + 1) << 3)) | 0;
+                r = +h[p >> 3];
+                h[n >> 3] = r * f + q * d;
+                h[p >> 3] = r * d - q * f;
+                e = (e + 1) | 0;
+              }
+              l = o;
+              return;
+            }
+            function wq(a, b, c, d, e, f, g, h, i, j) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              i = i | 0;
+              j = j | 0;
+              xq(a, b, c, d, e, f, g, h, i, j);
+              return;
+            }
+            function xq(a, b, d, e, f, g, i, j, k, m) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              j = j | 0;
+              k = k | 0;
+              m = m | 0;
+              var n = 0.0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0;
+              M = l;
+              l = (l + 192) | 0;
+              I = (M + 176) | 0;
+              H = (M + 168) | 0;
+              K = M;
+              W6(K | 0, e | 0, 168) | 0;
+              c[m >> 2] = 0;
+              do
+                if (b | 0 ? ((L = c[(b + 4) >> 2] | 0), !(((a | 0) < 1) | ((L | 0) < 1))) : 0) {
+                  if ((ww(b, 0) | 0) != 0 ? (c[(b + 16) >> 2] | 0) == 1 : 0) {
+                    if ((c[(e + 136) >> 2] | 0) == 1) o = Bw(d) | 0;
+                    else o = d;
+                    J = Bw(b) | 0;
+                  } else t = 5;
+                  do
+                    if ((t | 0) == 5)
+                      if ((c[(e + 136) >> 2] | 0) == 1) {
+                        J = Aw(b, 0) | 0;
+                        o = Aw(d, 0) | 0;
+                        break;
+                      } else {
+                        J = Qw(b) | 0;
+                        o = d;
+                        break;
+                      }
+                  while (0);
+                  G = (e + 160) | 0;
+                  p = c[G >> 2] | 0;
+                  if ((p | 0) == 3) {
+                    if ((j | 0) > 0) t = 14;
+                  } else if (((j | 0) > 0) & ((p | 0) == 4)) t = 14;
+                  if ((t | 0) == 14) {
+                    d = KK(O(a << 3, c[J >> 2] | 0) | 0) | 0;
+                    L = yq(J, j, k) | 0;
+                    wq(a, L, 0, e, 0, 0, d, 0, 0, m);
+                    zq(a, J, j, k, i, d);
+                    lu(a, J, i, g, c[(e + 124) >> 2] | 0, +h[(e + 144) >> 3], c[G >> 2] | 0, j, k);
+                    qw(L);
+                    U1(d);
+                    if ((J | 0) == (b | 0)) break;
+                    qw(J);
+                    break;
+                  }
+                  E = fx(c[(e + 44) >> 2] | 0, c[(e + 48) >> 2] | 0) | 0;
+                  c[(E + 16) >> 2] = c[(e + 40) >> 2];
+                  F = tx(J, o, f, E) | 0;
+                  q = wx(F) | 0;
+                  if (!(c[(q + 32) >> 2] | 0)) r = i;
+                  else r = KK(O(a << 3, c[(q + 4) >> 2] | 0) | 0) | 0;
+                  p = uq(J) | 0;
+                  if (+h[e >> 3] == -1.0001234) h[e >> 3] = (p | 0) == 0 ? -1.0 : -1.8;
+                  v = (e + 136) | 0;
+                  w = (e + 24) | 0;
+                  x = (e + 16) | 0;
+                  y = (e + 104) | 0;
+                  z = (e + 96) | 0;
+                  A = a << 3;
+                  B = (e + 132) | 0;
+                  C = c[15712] | 0;
+                  D = (e + 80) | 0;
+                  while (1) {
+                    a: do
+                      switch (c[v >> 2] | 0) {
+                        case 0: {
+                          switch (c[B >> 2] | 0) {
+                            case 0: {
+                              nq(a, c[(q + 8) >> 2] | 0, e, c[(q + 24) >> 2] | 0, r, m);
+                              break a;
+                            }
+                            case 2: {
+                              p = (q + 8) | 0;
+                              t = 29;
+                              break;
+                            }
+                            case 3: {
+                              p = (q + 8) | 0;
+                              s = c[p >> 2] | 0;
+                              if ((c[s >> 2] | 0) > 1e4)
+                                if (!0) t = 29;
+                                else {
+                                  c[H >> 2] = 1e4;
+                                  w4(C, 92299, H) | 0;
+                                  t = 29;
+                                }
+                              else t = 30;
+                              break;
+                            }
+                            default: {
+                              s = c[(q + 8) >> 2] | 0;
+                              t = 30;
+                            }
+                          }
+                          if ((t | 0) == 29) {
+                            iq(a, c[p >> 2] | 0, e, c[(q + 24) >> 2] | 0, r, m);
+                            break a;
+                          } else if ((t | 0) == 30) {
+                            oq(a, s, e, c[(q + 24) >> 2] | 0, r, m);
+                            break a;
+                          }
+                          break;
+                        }
+                        case 1: {
+                          h[z >> 3] = 1.0;
+                          c[y >> 2] = 1;
+                          u = (c[(q + 28) >> 2] | 0) == 0;
+                          n = u ? 0.5 : 0.05;
+                          c[D >> 2] = u ? 500 : 100;
+                          u = (c[(q + 32) >> 2] | 0) == 0;
+                          p = (q + 8) | 0;
+                          s = (q + 12) | 0;
+                          t = (q + 24) | 0;
+                          pq(a, c[p >> 2] | 0, c[s >> 2] | 0, e, c[t >> 2] | 0, r, n, m);
+                          if (u) {
+                            c[x >> 2] = 0;
+                            h[z >> 3] = 0.05;
+                            c[y >> 2] = 0;
+                            pq(a, c[p >> 2] | 0, c[s >> 2] | 0, e, c[t >> 2] | 0, r, n * 0.5, m);
+                            pq(a, c[p >> 2] | 0, c[s >> 2] | 0, e, c[t >> 2] | 0, r, n * 0.125, m);
+                            pq(a, c[p >> 2] | 0, c[s >> 2] | 0, e, c[t >> 2] | 0, r, n * 0.03125, m);
+                          }
+                          break;
+                        }
+                        default: {
+                        }
+                      }
+                    while (0);
+                    t = c[(q + 32) >> 2] | 0;
+                    if (!t) {
+                      t = 39;
+                      break;
+                    }
+                    if (c[m >> 2] | 0) {
+                      t = 35;
+                      break;
+                    }
+                    u = c[(q + 16) >> 2] | 0;
+                    p = c[(q + 40) >> 2] | 0;
+                    if (!(c[(t + 32) >> 2] | 0)) s = i;
+                    else s = KK(O(A, c[(t + 4) >> 2] | 0) | 0) | 0;
+                    Aq(a, c[(t + 8) >> 2] | 0, u, c[(t + 20) >> 2] | 0, r, s, p, +h[w >> 3] * 0.001);
+                    U1(r);
+                    c[x >> 2] = 0;
+                    h[w >> 3] = +h[w >> 3] * 0.75;
+                    c[y >> 2] = 0;
+                    h[z >> 3] = (((c[((c[(t + 28) >> 2] | 0) + 40) >> 2] | 0) + -9) | 0) >>> 0 < 2 ? 1.0 : 0.1;
+                    q = t;
+                    r = s;
+                  }
+                  if ((t | 0) == 35) U1(r);
+                  else if ((t | 0) == 39) {
+                    Ux(a, J, e, f, i, m);
+                    if (0) {
+                      c[I >> 2] = c[(e + 124) >> 2];
+                      w4(C, 92362, I) | 0;
+                    }
+                    if ((a | 0) == 2) vq(L, 2, i);
+                    n = +h[(e + 152) >> 3];
+                    if (n != 0.0) Bq(L, a, i, n);
+                    lu(a, J, i, g, c[(e + 124) >> 2] | 0, +h[(e + 144) >> 3], c[G >> 2] | 0, j, k);
+                  }
+                  W6(e | 0, K | 0, 168) | 0;
+                  if ((J | 0) != (b | 0)) qw(J);
+                  if (!(((o | 0) == 0) | ((o | 0) == (d | 0)))) qw(o);
+                  gx(E);
+                  hx(F);
+                }
+              while (0);
+              l = M;
+              return;
+            }
+            function yq(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0;
+              y = l;
+              l = (l + 16) | 0;
+              x = y;
+              u = c[(a + 20) >> 2] | 0;
+              v = c[(a + 24) >> 2] | 0;
+              w = KK(c[a >> 2] << 2) | 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (c[a >> 2] | 0)) {
+                  e = 0;
+                  break;
+                }
+                c[(w + (e << 2)) >> 2] = 1;
+                e = (e + 1) | 0;
+              }
+              while (1) {
+                if ((e | 0) >= (b | 0)) {
+                  e = 0;
+                  d = 0;
+                  break;
+                }
+                c[(w + (c[(d + (e << 2)) >> 2] << 2)) >> 2] = -1;
+                e = (e + 1) | 0;
+              }
+              while (1) {
+                m = c[a >> 2] | 0;
+                if ((d | 0) >= (m | 0)) {
+                  d = 0;
+                  b = 0;
+                  break;
+                }
+                b = (w + (d << 2)) | 0;
+                if ((c[b >> 2] | 0) > 0) {
+                  c[b >> 2] = e;
+                  e = (e + 1) | 0;
+                }
+                d = (d + 1) | 0;
+              }
+              a: while (1) {
+                while (1) {
+                  if ((b | 0) >= (m | 0)) break a;
+                  if ((c[(w + (b << 2)) >> 2] | 0) >= 0) break;
+                  b = (b + 1) | 0;
+                }
+                j = (b + 1) | 0;
+                k = c[(u + (j << 2)) >> 2] | 0;
+                i = c[(u + (b << 2)) >> 2] | 0;
+                while (1) {
+                  if ((i | 0) >= (k | 0)) {
+                    b = j;
+                    continue a;
+                  }
+                  f = c[(v + (i << 2)) >> 2] | 0;
+                  b: do
+                    if ((c[(w + (f << 2)) >> 2] | 0) > -1) d = (d + 1) | 0;
+                    else {
+                      h = c[(u + ((f + 1) << 2)) >> 2] | 0;
+                      g = c[(u + (f << 2)) >> 2] | 0;
+                      while (1) {
+                        if ((g | 0) >= (h | 0)) break b;
+                        f = c[(v + (g << 2)) >> 2] | 0;
+                        if ((f | 0) != (b | 0)) d = ((((c[(w + (f << 2)) >> 2] | 0) >>> 31) ^ 1) + d) | 0;
+                        g = (g + 1) | 0;
+                      }
+                    }
+                  while (0);
+                  i = (i + 1) | 0;
+                }
+              }
+              b = d << 2;
+              if ((d | 0) > 0) {
+                r = KK(b) | 0;
+                s = KK(b) | 0;
+                p = s;
+                q = r;
+              } else {
+                p = 0;
+                q = 0;
+                r = 0;
+                s = 0;
+              }
+              t = c[15712] | 0;
+              b = 0;
+              f = 0;
+              c: while (1) {
+                d = c[a >> 2] | 0;
+                while (1) {
+                  if ((b | 0) >= (d | 0)) break c;
+                  o = (w + (b << 2)) | 0;
+                  if ((c[o >> 2] | 0) >= 0) break;
+                  b = (b + 1) | 0;
+                }
+                m = (b + 1) | 0;
+                n = (u + (m << 2)) | 0;
+                k = c[(u + (b << 2)) >> 2] | 0;
+                d = f;
+                while (1) {
+                  if ((k | 0) >= (c[n >> 2] | 0)) {
+                    b = m;
+                    f = d;
+                    continue c;
+                  }
+                  f = (v + (k << 2)) | 0;
+                  g = c[f >> 2] | 0;
+                  d: do
+                    if ((c[(w + (g << 2)) >> 2] | 0) > -1) {
+                      c[(q + (d << 2)) >> 2] = c[o >> 2];
+                      c[(p + (d << 2)) >> 2] = c[(w + (c[f >> 2] << 2)) >> 2];
+                      d = (d + 1) | 0;
+                    } else {
+                      j = (u + ((g + 1) << 2)) | 0;
+                      i = c[(u + (g << 2)) >> 2] | 0;
+                      while (1) {
+                        if ((i | 0) >= (c[j >> 2] | 0)) break d;
+                        f = (v + (i << 2)) | 0;
+                        h = c[f >> 2] | 0;
+                        do
+                          if ((h | 0) != (b | 0) ? (c[(w + (h << 2)) >> 2] | 0) > -1 : 0) {
+                            c[(q + (d << 2)) >> 2] = c[o >> 2];
+                            h = (d + 1) | 0;
+                            c[(p + (d << 2)) >> 2] = c[(w + (c[f >> 2] << 2)) >> 2];
+                            g = c[o >> 2] | 0;
+                            d = c[(w + (c[f >> 2] << 2)) >> 2] | 0;
+                            if ((g | 0) != 68)
+                              if ((d | 0) == 68) d = 68;
+                              else {
+                                d = h;
+                                break;
+                              }
+                            c[x >> 2] = g;
+                            c[(x + 4) >> 2] = d;
+                            w4(t, 92380, x) | 0;
+                            d = h;
+                          }
+                        while (0);
+                        i = (i + 1) | 0;
+                      }
+                    }
+                  while (0);
+                  k = (k + 1) | 0;
+                }
+              }
+              x = Dw(f, e, e, q, p, 0, 8, 8) | 0;
+              U1(r);
+              U1(s);
+              U1(w);
+              l = y;
+              return x | 0;
+            }
+            function zq(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0.0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              p = KK(c[b >> 2] << 2) | 0;
+              i = 0;
+              while (1) {
+                if ((i | 0) >= (c[b >> 2] | 0)) {
+                  i = 0;
+                  break;
+                }
+                c[(p + (i << 2)) >> 2] = 1;
+                i = (i + 1) | 0;
+              }
+              while (1) {
+                if ((i | 0) >= (d | 0)) {
+                  i = 0;
+                  l = 0;
+                  break;
+                }
+                j = c[(e + (i << 2)) >> 2] | 0;
+                if ((j | 0) > -1 ? (j | 0) < (c[b >> 2] | 0) : 0) c[(p + (j << 2)) >> 2] = -1;
+                i = (i + 1) | 0;
+              }
+              while (1) {
+                n = c[b >> 2] | 0;
+                if ((l | 0) >= (n | 0)) {
+                  l = 0;
+                  break;
+                }
+                j = (p + (l << 2)) | 0;
+                if ((c[j >> 2] | 0) > -1) {
+                  c[j >> 2] = i;
+                  i = (i + 1) | 0;
+                }
+                l = (l + 1) | 0;
+              }
+              while (1) {
+                if ((l | 0) >= (n | 0)) break;
+                i = c[(p + (l << 2)) >> 2] | 0;
+                a: do
+                  if ((i | 0) > -1) {
+                    m = O(l, a) | 0;
+                    j = O(i, a) | 0;
+                    i = 0;
+                    while (1) {
+                      if ((i | 0) >= (a | 0)) break a;
+                      h[(f + ((i + m) << 3)) >> 3] = +h[(g + ((j + i) << 3)) >> 3];
+                      i = (i + 1) | 0;
+                    }
+                  }
+                while (0);
+                l = (l + 1) | 0;
+              }
+              o = (b + 20) | 0;
+              g = (b + 24) | 0;
+              n = 0;
+              while (1) {
+                if ((n | 0) >= (d | 0)) break;
+                b = c[(e + (n << 2)) >> 2] | 0;
+                i = c[o >> 2] | 0;
+                l = c[(i + ((b + 1) << 2)) >> 2] | 0;
+                i = c[(i + (b << 2)) >> 2] | 0;
+                m = (l - i) | 0;
+                b = O(b, a) | 0;
+                j = 0;
+                while (1) {
+                  if ((j | 0) >= (a | 0)) break;
+                  h[(f + ((j + b) << 3)) >> 3] = 0.0;
+                  j = (j + 1) | 0;
+                }
+                while (1) {
+                  if ((i | 0) < (l | 0)) j = 0;
+                  else break;
+                  while (1) {
+                    if ((j | 0) >= (a | 0)) break;
+                    k = +h[(f + (((O(c[((c[g >> 2] | 0) + (i << 2)) >> 2] | 0, a) | 0) + j) << 3)) >> 3];
+                    q = (f + ((j + b) << 3)) | 0;
+                    h[q >> 3] = +h[q >> 3] + k;
+                    j = (j + 1) | 0;
+                  }
+                  i = (i + 1) | 0;
+                }
+                k = 1.0 / +(m | 0);
+                i = 0;
+                while (1) {
+                  if ((i | 0) >= (a | 0)) break;
+                  q = (f + ((i + b) << 3)) | 0;
+                  h[q >> 3] = +h[q >> 3] * k;
+                  i = (i + 1) | 0;
+                }
+                n = (n + 1) | 0;
+              }
+              U1(p);
+              return;
+            }
+            function Aq(a, b, d, e, f, g, i, j) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              j = +j;
+              var k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0.0;
+              o = l;
+              l = (l + 16) | 0;
+              n = o;
+              c[n >> 2] = g;
+              Gw(d, 0, f, 0, n, 0, a);
+              a: do
+                if (((i + -1) | 0) >>> 0 < 6) {
+                  tq(a, b, c[n >> 2] | 0);
+                  k = c[e >> 2] | 0;
+                  m = c[(e + 20) >> 2] | 0;
+                  g = c[(e + 24) >> 2] | 0;
+                  b = 0;
+                  b: while (1) {
+                    if ((b | 0) >= (k | 0)) break a;
+                    i = (b + 1) | 0;
+                    e = (m + (i << 2)) | 0;
+                    b = c[(m + (b << 2)) >> 2] | 0;
+                    c: while (1) {
+                      b = (b + 1) | 0;
+                      if ((b | 0) >= (c[e >> 2] | 0)) {
+                        b = i;
+                        continue b;
+                      }
+                      f = (g + (b << 2)) | 0;
+                      d = 0;
+                      while (1) {
+                        if ((d | 0) >= (a | 0)) continue c;
+                        q = (+Sw() + -0.5) * j;
+                        p = ((c[n >> 2] | 0) + (((O(c[f >> 2] | 0, a) | 0) + d) << 3)) | 0;
+                        h[p >> 3] = +h[p >> 3] + q;
+                        d = (d + 1) | 0;
+                      }
+                    }
+                  }
+                }
+              while (0);
+              l = o;
+              return;
+            }
+            function Bq(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = +d;
+              var e = 0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0.0,
+                o = 0.0;
+              k = l;
+              l = (l + 16) | 0;
+              j = k;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (b | 0)) {
+                  g = 0;
+                  break;
+                }
+                h[(j + (e << 3)) >> 3] = 0.0;
+                e = (e + 1) | 0;
+              }
+              while (1) {
+                if ((g | 0) >= (a | 0)) break;
+                i = O(g, b) | 0;
+                e = 0;
+                while (1) {
+                  if ((e | 0) >= (b | 0)) break;
+                  m = (j + (e << 3)) | 0;
+                  h[m >> 3] = +h[m >> 3] + +h[(c + ((e + i) << 3)) >> 3];
+                  e = (e + 1) | 0;
+                }
+                g = (g + 1) | 0;
+              }
+              f = 1.0 / +(a | 0);
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (b | 0)) {
+                  g = 0;
+                  break;
+                }
+                m = (j + (e << 3)) | 0;
+                h[m >> 3] = +h[m >> 3] * f;
+                e = (e + 1) | 0;
+              }
+              while (1) {
+                if ((g | 0) >= (a | 0)) break;
+                i = O(g, b) | 0;
+                e = 0;
+                while (1) {
+                  if ((e | 0) >= (b | 0)) break;
+                  m = (c + ((e + i) << 3)) | 0;
+                  h[m >> 3] = +h[m >> 3] - +h[(j + (e << 3)) >> 3];
+                  e = (e + 1) | 0;
+                }
+                g = (g + 1) | 0;
+              }
+              d = d * -0.017453277777777776;
+              f = +E(+d);
+              d = +F(+d);
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (a | 0)) break;
+                m = O(e, b) | 0;
+                j = (c + (m << 3)) | 0;
+                n = +h[j >> 3];
+                m = (c + ((m + 1) << 3)) | 0;
+                o = +h[m >> 3];
+                h[j >> 3] = o * d + n * f;
+                h[m >> 3] = o * f - n * d;
+                e = (e + 1) | 0;
+              }
+              l = k;
+              return;
+            }
+            function Cq(a, b, d, e, f, g, i) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = +g;
+              i = i | 0;
+              var j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              m = (ww(b, 0) | 0) == 0;
+              j = (c[(b + 16) >> 2] | 0) == 1;
+              if (m)
+                if (j) j = Bw(vw(b, 0) | 0) | 0;
+                else k = 5;
+              else if (j) j = b;
+              else k = 5;
+              if ((k | 0) == 5) j = Qw(b) | 0;
+              m = Bw(j) | 0;
+              c[i >> 2] = 0;
+              j = c[m >> 2] | 0;
+              if (!d) {
+                KK(O(a << 3, j) | 0) | 0;
+                ab();
+              }
+              l = Gx(m, a, 0.0, c[d >> 2] | 0, (e | 0) == 0 ? 0 : 2, 1) | 0;
+              if (!l) c[i >> 2] = -1;
+              else {
+                h[(l + 40) >> 3] = 0.1;
+                c[(l + 24) >> 2] = 5;
+                +Ix(l, a, c[d >> 2] | 0, f, g);
+                k = O(j, a) | 0;
+                e = (l + 32) | 0;
+                j = 0;
+                while (1) {
+                  if ((j | 0) >= (k | 0)) break;
+                  i = ((c[d >> 2] | 0) + (j << 3)) | 0;
+                  h[i >> 3] = +h[i >> 3] / +h[e >> 3];
+                  j = (j + 1) | 0;
+                }
+                Hx(l);
+              }
+              if ((m | 0) != (b | 0)) qw(m);
+              return;
+            }
+            function Dq(a, b, c, d, e, f, g, h) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = +g;
+              h = h | 0;
+              Cq(a, c, d, e, f, g, h);
+              return;
+            }
+            function Eq(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = +e;
+              f = +f;
+              g = g | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0.0;
+              v = c[b >> 2] | 0;
+              w = c[(b + 20) >> 2] | 0;
+              t = c[(b + 24) >> 2] | 0;
+              u = c[(b + 28) >> 2] | 0;
+              if (!(ww(b, 0) | 0)) qa(95795, 92387, 37, 92404);
+              a = KK(56) | 0;
+              k = (a + 20) | 0;
+              c[k >> 2] = 0;
+              c[(a + 24) >> 2] = 2;
+              c[(a + 12) >> 2] = 0;
+              j = KK(16) | 0;
+              c[k >> 2] = j;
+              h[j >> 3] = e;
+              h[(j + 8) >> 3] = f;
+              c[(a + 16) >> 2] = 105;
+              h[(a + 40) >> 3] = 0.01;
+              c[(a + 48) >> 2] = ~~+C(+(+(c[b >> 2] | 0)));
+              j = (b + 8) | 0;
+              k = (a + 4) | 0;
+              c[k >> 2] = rw(v, v, ((c[j >> 2] | 0) + v) | 0, 1, 1) | 0;
+              j = rw(v, v, ((c[j >> 2] | 0) + v) | 0, 1, 1) | 0;
+              c[(a + 8) >> 2] = j;
+              k = c[k >> 2] | 0;
+              l = c[(k + 28) >> 2] | 0;
+              m = c[(j + 28) >> 2] | 0;
+              if (((j | 0) == 0) | ((k | 0) == 0)) {
+                Fx(a);
+                a = 0;
+              } else {
+                n = c[(k + 20) >> 2] | 0;
+                o = c[(k + 24) >> 2] | 0;
+                p = c[(j + 20) >> 2] | 0;
+                q = c[(j + 24) >> 2] | 0;
+                c[p >> 2] = 0;
+                c[n >> 2] = 0;
+                b = 0;
+                d = 0;
+                while (1) {
+                  if ((b | 0) >= (v | 0)) break;
+                  r = (b + 1) | 0;
+                  s = (w + (r << 2)) | 0;
+                  e = 0.0;
+                  f = 0.0;
+                  i = c[(w + (b << 2)) >> 2] | 0;
+                  while (1) {
+                    if ((i | 0) >= (c[s >> 2] | 0)) break;
+                    g = c[(t + (i << 2)) >> 2] | 0;
+                    if ((g | 0) != (b | 0)) {
+                      x = +h[(u + (i << 3)) >> 3];
+                      x = x >= 0.0 ? x : -x;
+                      x = x > 0.01 ? x : 0.01;
+                      c[(o + (d << 2)) >> 2] = g;
+                      c[(q + (d << 2)) >> 2] = g;
+                      g = (l + (d << 3)) | 0;
+                      h[g >> 3] = -1.0;
+                      h[(m + (d << 3)) >> 3] = -x;
+                      e = +h[g >> 3] + e;
+                      f = f - x;
+                      d = (d + 1) | 0;
+                    }
+                    i = (i + 1) | 0;
+                  }
+                  c[(o + (d << 2)) >> 2] = b;
+                  c[(q + (d << 2)) >> 2] = b;
+                  h[(l + (d << 3)) >> 3] = -e;
+                  h[(m + (d << 3)) >> 3] = -f;
+                  d = (d + 1) | 0;
+                  c[(n + (r << 2)) >> 2] = d;
+                  c[(p + (r << 2)) >> 2] = d;
+                  b = r;
+                }
+                c[(k + 8) >> 2] = d;
+                c[(j + 8) >> 2] = d;
+              }
+              return a | 0;
+            }
+            function Fq(a) {
+              a = a | 0;
+              Fx(a);
+              return;
+            }
+            function Gq(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              return +(+Jx(a, b, c, d, 0.001));
+            }
+            function Hq(a, b) {
+              a = a | 0;
+              b = +b;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              if ((c[(a + 16) >> 2] | 0) == 1) d = vw(a, 0) | 0;
+              else d = Qw(a) | 0;
+              f = c[(d + 28) >> 2] | 0;
+              a: do
+                if (b != 1.0) {
+                  e = c[(d + 8) >> 2] | 0;
+                  a = 0;
+                  while (1) {
+                    if ((a | 0) >= (e | 0)) break a;
+                    g = (f + (a << 3)) | 0;
+                    h[g >> 3] = +h[g >> 3] * b;
+                    a = (a + 1) | 0;
+                  }
+                }
+              while (0);
+              return d | 0;
+            }
+            function Iq(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0.0;
+              j = c[b >> 2] | 0;
+              c[e >> 2] = 0;
+              k = O(j, a) | 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (k | 0)) {
+                  e = 1;
+                  f = 1;
+                  break;
+                }
+                h[(d + (e << 3)) >> 3] = +Sw() * 100.0;
+                e = (e + 1) | 0;
+              }
+              while (1) {
+                if ((f | 0) >= (j | 0)) break;
+                i = O(f, a) | 0;
+                g = 0;
+                while (1) {
+                  if ((g | 0) >= (a | 0)) break;
+                  l = +h[(d + (g << 3)) >> 3] - +h[(d + ((g + i) << 3)) >> 3];
+                  if ((l >= 0.0 ? l : -l) > 1.0e-16) {
+                    e = 0;
+                    f = j;
+                    break;
+                  } else g = (g + 1) | 0;
+                }
+                f = (f + 1) | 0;
+              }
+              a: do
+                if (e | 0) {
+                  w5(1);
+                  e = 0;
+                  while (1) {
+                    if ((e | 0) >= (k | 0)) break a;
+                    h[(d + (e << 3)) >> 3] = +Sw() * 100.0;
+                    e = (e + 1) | 0;
+                  }
+                }
+              while (0);
+              e = Hq(b, 1.0) | 0;
+              if (!(ww(e, 0) | 0)) qa(92430, 92387, 164, 92466);
+              else {
+                k = Eq(0, e, 0, 101.0e5, 100.0, 0) | 0;
+                +Gq(k, a, d, 300);
+                Fq(k);
+                k = Eq(0, e, 0, 101.0e3, 100.0, 0) | 0;
+                +Gq(k, a, d, 300);
+                Fq(k);
+                k = Eq(0, e, 0, 1010.0, 100.0, 0) | 0;
+                +Gq(k, a, d, 300);
+                Fq(k);
+                k = Eq(0, e, 0, 10.1, 100.0, 0) | 0;
+                +Gq(k, a, d, 300);
+                Fq(k);
+                ax(0.0, 0.0, 490.0, 700.0, c[b >> 2] | 0, a, d);
+                qw(e);
+                return;
+              }
+            }
+            function Jq(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              k = KK((tB(a) | 0) << 4) | 0;
+              i = (e | 0) != 0;
+              j = (b + 8) | 0;
+              g = jC(a) | 0;
+              f = 0;
+              while (1) {
+                if (!g) break;
+                if (i) f = (f + (((Q2(KB(g) | 0, 92481, 11) | 0) == 0) & 1)) | 0;
+                m = c[(g + 16) >> 2] | 0;
+                l = c[(m + 120) >> 2] << 1;
+                h[(k + (l << 3)) >> 3] = +h[(m + 32) >> 3] * 0.5 + +h[b >> 3];
+                h[(k + ((l | 1) << 3)) >> 3] = +h[(m + 40) >> 3] * 0.5 + +h[j >> 3];
+                g = kC(a, g) | 0;
+              }
+              if (i & ((f | 0) != 0)) {
+                b = KK(f << 2) | 0;
+                g = jC(a) | 0;
+                f = 0;
+                while (1) {
+                  if (!g) break;
+                  if (!(Q2(KB(g) | 0, 92481, 11) | 0)) {
+                    c[(b + (f << 2)) >> 2] = c[((c[(g + 16) >> 2] | 0) + 120) >> 2];
+                    f = (f + 1) | 0;
+                  }
+                  g = kC(a, g) | 0;
+                }
+                c[e >> 2] = b;
+                c[d >> 2] = f;
+              }
+              return k | 0;
+            }
+            function Kq(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0;
+              z = l;
+              l = (l + 32) | 0;
+              w = (z + 16) | 0;
+              v = (z + 8) | 0;
+              u = z;
+              if (a) {
+                x = tB(a) | 0;
+                y = uB(a) | 0;
+                b = jC(a) | 0;
+                e = 0;
+                while (1) {
+                  if (!b) break;
+                  c[((c[(b + 16) >> 2] | 0) + 120) >> 2] = e;
+                  b = kC(a, b) | 0;
+                  e = (e + 1) | 0;
+                }
+                r = y << 2;
+                q = KK(r) | 0;
+                r = KK(r) | 0;
+                b = y << 3;
+                s = KK(b) | 0;
+                o = GA(a, 2, 101541, 0) | 0;
+                t = (d | 0) != 0;
+                if (t) {
+                  e = GA(a, 2, 92493, 0) | 0;
+                  p = JK(b) | 0;
+                  n = p;
+                } else {
+                  n = 0;
+                  e = 0;
+                  p = 0;
+                }
+                j = (o | 0) == 0;
+                k = (e | 0) == 0;
+                i = jC(a) | 0;
+                b = 0;
+                while (1) {
+                  if (!i) break;
+                  m = c[((c[(i + 16) >> 2] | 0) + 120) >> 2] | 0;
+                  g = XA(a, i) | 0;
+                  while (1) {
+                    if (!g) break;
+                    c[(q + (b << 2)) >> 2] = m;
+                    c[(r + (b << 2)) >> 2] =
+                      c[
+                        ((c[((c[((((c[g >> 2] & 3) | 0) == 2 ? g : (g + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                          120) >>
+                          2
+                      ];
+                    if (!j ? ((A = RA(g, o) | 0), (c[v >> 2] = u), (b5(A, 101209, v) | 0) == 1) : 0) f = +h[u >> 3];
+                    else {
+                      h[u >> 3] = 1.0;
+                      f = 1.0;
+                    }
+                    h[(s + (b << 3)) >> 3] = f;
+                    if (!k) {
+                      A = RA(g, e) | 0;
+                      c[w >> 2] = u;
+                      if ((b5(A, 101209, w) | 0) == 1) f = +h[u >> 3];
+                      else {
+                        h[u >> 3] = 1.0;
+                        f = 1.0;
+                      }
+                      h[(n + (b << 3)) >> 3] = f;
+                    }
+                    g = ZA(a, g) | 0;
+                    b = (b + 1) | 0;
+                  }
+                  i = kC(a, i) | 0;
+                }
+                b = Dw(y, x, x, q, r, s, 1, 8) | 0;
+                if (t) c[d >> 2] = Dw(y, x, x, q, r, p, 1, 8) | 0;
+                U1(q);
+                U1(r);
+                U1(s);
+                if (n) U1(p);
+              } else b = 0;
+              l = z;
+              return b | 0;
+            }
+            function Lq(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0.0,
+                f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0.0;
+              m = l;
+              l = (l + 16) | 0;
+              k = m;
+              a: do
+                if (Mq(a, k) | 0) {
+                  b = c[((c[((jC(a) | 0) + 16) >> 2] | 0) + 132) >> 2] | 0;
+                  g = +h[b >> 3];
+                  e = +h[(b + 8) >> 3];
+                  b = jC(a) | 0;
+                  while (1) {
+                    if (!b) break;
+                    f = c[((c[(b + 16) >> 2] | 0) + 132) >> 2] | 0;
+                    h[f >> 3] = +h[f >> 3] - g;
+                    f = (f + 8) | 0;
+                    h[f >> 3] = +h[f >> 3] - e;
+                    b = kC(a, b) | 0;
+                  }
+                  b = ((g != 0.0) | (e != 0.0)) & 1;
+                  d = jC(a) | 0;
+                  while (1) {
+                    if (!d) break a;
+                    f = XA(a, d) | 0;
+                    if (f | 0) break;
+                    d = kC(a, d) | 0;
+                  }
+                  n = c[f >> 2] & 3;
+                  d = c[((c[((c[(((n | 0) == 2 ? f : (f + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 132) >> 2] | 0;
+                  f = c[((c[((c[(((n | 0) == 3 ? f : (f + 48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) + 132) >> 2] | 0;
+                  i = +h[(f + 8) >> 3];
+                  j = +h[f >> 3];
+                  e = +K(+(+h[(d + 8) >> 3] - i), +(+h[d >> 3] - j));
+                  e = +h[k >> 3] - e;
+                  h[k >> 3] = e;
+                  if (e != 0.0) {
+                    g = +E(+e);
+                    e = +F(+e);
+                    b = jC(a) | 0;
+                    while (1) {
+                      if (!b) {
+                        b = 1;
+                        break a;
+                      }
+                      k = c[((c[(b + 16) >> 2] | 0) + 132) >> 2] | 0;
+                      p = +h[k >> 3] - j;
+                      n = (k + 8) | 0;
+                      o = +h[n >> 3] - i;
+                      h[k >> 3] = p * g + j - o * e;
+                      h[n >> 3] = p * e + i + o * g;
+                      b = kC(a, b) | 0;
+                    }
+                  }
+                } else b = 0;
+              while (0);
+              l = m;
+              return b | 0;
+            }
+            function Mq(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0,
+                g = 0;
+              g = l;
+              l = (l + 16) | 0;
+              f = g;
+              b = QA(b, 92497) | 0;
+              do
+                if ((b | 0) != 0 ? (a[b >> 0] | 0) != 0 : 0) {
+                  e = +s5(b, f);
+                  if ((c[f >> 2] | 0) == (b | 0))
+                    if (!(((dP(b) | 0) << 24) >> 24)) {
+                      b = 0;
+                      break;
+                    } else e = 0.0;
+                  while (1) {
+                    if (!(e > 180.0)) break;
+                    e = e + -360.0;
+                  }
+                  while (1) {
+                    if (!(e <= -180.0)) break;
+                    e = e + 360.0;
+                  }
+                  h[d >> 3] = e * 0.017453292519943295;
+                  b = 1;
+                } else b = 0;
+              while (0);
+              l = g;
+              return b | 0;
+            }
+            function Nq(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0;
+              d = QA(a, 92507) | 0;
+              return Oq(a, (d | 0) == 0 ? (c | 0 ? c : 195059) : d, b) | 0;
+            }
+            function Oq(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0.0;
+              n = l;
+              l = (l + 32) | 0;
+              m = (n + 16) | 0;
+              j = (n + 8) | 0;
+              i = n;
+              if ((d | 0) != 0 ? (a[d >> 0] | 0) != 0 : 0) {
+                f = 17896;
+                while (1) {
+                  g = c[(f + 4) >> 2] | 0;
+                  if (!g) break;
+                  if (!(j3(d, g, c[(f + 8) >> 2] | 0) | 0)) {
+                    k = 6;
+                    break;
+                  }
+                  f = (f + 16) | 0;
+                }
+                if ((k | 0) == 6) {
+                  if (!(c[(f + 12) >> 2] | 0)) {
+                    c[i >> 2] = g;
+                    gA(0, 92515, i) | 0;
+                    f = 17896;
+                  }
+                  i = c[f >> 2] | 0;
+                  c[e >> 2] = i;
+                  c[(e + 4) >> 2] = c[(f + 12) >> 2];
+                  if ((i | 0) == 18) Pq(b, (d + (c[(f + 8) >> 2] | 0)) | 0, e);
+                }
+                if (!(c[(f + 4) >> 2] | 0)) {
+                  f = eP(d, 63) | 0;
+                  if ((f << 24) >> 24 == 63) {
+                    c[j >> 2] = d;
+                    gA(0, 92557, j) | 0;
+                    f = 0;
+                  } else f = f & 255;
+                  f = (f | 0) == 0;
+                  c[e >> 2] = f & 1;
+                  f = f ? 92604 : 135709;
+                  k = 15;
+                }
+              } else {
+                c[e >> 2] = 0;
+                f = 135709;
+                k = 15;
+              }
+              if ((k | 0) == 15) c[(e + 4) >> 2] = f;
+              if (0) {
+                k = c[15712] | 0;
+                j = c[(e + 8) >> 2] | 0;
+                o = +h[(e + 16) >> 3];
+                c[m >> 2] = c[(e + 4) >> 2];
+                c[(m + 4) >> 2] = j;
+                h[(m + 8) >> 3] = o;
+                w4(k, 92612, m) | 0;
+              }
+              l = n;
+              return e | 0;
+            }
+            function Pq(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              e = l;
+              l = (l + 16) | 0;
+              f = e;
+              g = (e + 4) | 0;
+              c[f >> 2] = g;
+              f = (b5(b, 137395, f) | 0) > 0;
+              b = c[g >> 2] | 0;
+              c[(d + 8) >> 2] = f & ((b | 0) > -1) ? b : 1e3;
+              h[(d + 16) >> 3] = +_O(a, GA(a, 0, 92648, 0) | 0, -4.0, -1.0e10);
+              l = e;
+              return;
+            }
+            function Qq(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              h = l;
+              l = (l + 16) | 0;
+              g = (h + 8) | 0;
+              f = h;
+              do
+                if ((tB(a) | 0) >= 2) {
+                  d = Lq(a) | 0;
+                  d = ((Rq(a) | 0) + d) | 0;
+                  e = c[b >> 2] | 0;
+                  if (e) {
+                    if (0) {
+                      e = c[15712] | 0;
+                      j = KB(a) | 0;
+                      i = c[(b + 4) >> 2] | 0;
+                      c[f >> 2] = j;
+                      c[(f + 4) >> 2] = i;
+                      w4(e, 92977, f) | 0;
+                      e = c[b >> 2] | 0;
+                    }
+                    if (e >>> 0 > 2) {
+                      switch (e | 0) {
+                        case 3: {
+                          e = Sr(a, 1) | 0;
+                          break;
+                        }
+                        case 4: {
+                          e = Sr(a, 0) | 0;
+                          break;
+                        }
+                        case 6:
+                        case 5: {
+                          e = 0;
+                          break;
+                        }
+                        case 10:
+                        case 9:
+                        case 7:
+                        case 8:
+                        case 14:
+                        case 13:
+                        case 11:
+                        case 12: {
+                          Cr(a, e) | 0;
+                          e = 0;
+                          break;
+                        }
+                        case 15: {
+                          e = Sr(a, -1) | 0;
+                          break;
+                        }
+                        default: {
+                          c[g >> 2] = c[(b + 4) >> 2];
+                          gA(0, 93e3, g) | 0;
+                          e = 0;
+                        }
+                      }
+                      d = (e + d) | 0;
+                      break;
+                    }
+                    if (Sq(a) | 0) {
+                      Tq();
+                      U1(c[46845] | 0);
+                      c[46845] = 0;
+                      break;
+                    }
+                    Uq(a);
+                    if ((c[b >> 2] | 0) == 2) e = Vq() | 0;
+                    else e = Wq() | 0;
+                    if (e | 0) Xq();
+                    Tq();
+                    U1(c[46845] | 0);
+                    c[46845] = 0;
+                    d = (e + d) | 0;
+                  }
+                } else d = 0;
+              while (0);
+              l = h;
+              return d | 0;
+            }
+            function Rq(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0.0,
+                e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              m = l;
+              l = (l + 48) | 0;
+              i = (m + 24) | 0;
+              f = (m + 16) | 0;
+              j = m;
+              b = QA(a, 140742) | 0;
+              a: do
+                if (
+                  (
+                    (b | 0) != 0
+                      ? ((k = (j + 8) | 0),
+                        (c[f >> 2] = j),
+                        (c[(f + 4) >> 2] = k),
+                        (e = b5(b, 105503, f) | 0),
+                        (e | 0) != 0)
+                      : 0
+                  )
+                    ? ((g = +h[j >> 3]), !(+B(+g) < 1.0e-9))
+                    : 0
+                ) {
+                  if ((e | 0) != 1) {
+                    d = +h[k >> 3];
+                    if (+B(+d) < 1.0e-9) {
+                      b = 0;
+                      break;
+                    }
+                  } else {
+                    h[k >> 3] = g;
+                    d = g;
+                  }
+                  if (!((d == 1.0) & (g == 1.0))) {
+                    if (0) {
+                      f = c[15712] | 0;
+                      h[i >> 3] = g;
+                      h[(i + 8) >> 3] = d;
+                      w4(f, 93160, i) | 0;
+                    }
+                    b = jC(a) | 0;
+                    while (1) {
+                      if (!b) {
+                        b = 1;
+                        break a;
+                      }
+                      i = c[((c[(b + 16) >> 2] | 0) + 132) >> 2] | 0;
+                      h[i >> 3] = +h[i >> 3] * +h[j >> 3];
+                      i = (i + 8) | 0;
+                      h[i >> 3] = +h[i >> 3] * +h[k >> 3];
+                      b = kC(a, b) | 0;
+                    }
+                  } else b = 0;
+                } else b = 0;
+              while (0);
+              l = m;
+              return b | 0;
+            }
+            function Sq(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                i = 0.0,
+                j = 0.0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              n = l;
+              l = (l + 16) | 0;
+              k = n;
+              c[46854] = tB(b) | 0;
+              ts();
+              c[46869] = KK(((c[46854] | 0) * 96) | 0) | 0;
+              f = jC(b) | 0;
+              d = c[46869] | 0;
+              lr(k, b);
+              i = +g[k >> 2];
+              j = +g[(k + 4) >> 2];
+              k = (a[(k + 8) >> 0] | 0) == 0;
+              j = k ? j : j * 0.013888888888888888;
+              i = k ? i : i * 0.013888888888888888;
+              k = k ? 2 : 1;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (c[46854] | 0)) {
+                  d = 0;
+                  break;
+                }
+                o = c[((c[(f + 16) >> 2] | 0) + 132) >> 2] | 0;
+                h[(d + 8) >> 3] = +h[o >> 3];
+                h[(d + 16) >> 3] = +h[(o + 8) >> 3];
+                if (mb[k & 3]((d + 40) | 0, f, i, j) | 0) {
+                  m = 4;
+                  break;
+                }
+                c[(d + 24) >> 2] = e;
+                c[(d + 28) >> 2] = 1;
+                c[d >> 2] = f;
+                c[(d + 88) >> 2] = 0;
+                d = (d + 96) | 0;
+                e = (e + 1) | 0;
+                f = kC(b, f) | 0;
+              }
+              if ((m | 0) == 4) {
+                U1(c[46869] | 0);
+                c[46869] = 0;
+                d = 1;
+              }
+              l = n;
+              return d | 0;
+            }
+            function Tq() {
+              var a = 0,
+                b = 0;
+              a = c[46869] | 0;
+              b = 0;
+              while (1) {
+                if ((b | 0) >= (c[46854] | 0)) break;
+                pu((a + 40) | 0);
+                a = (a + 96) | 0;
+                b = (b + 1) | 0;
+              }
+              ou();
+              Vs();
+              U1(c[46869] | 0);
+              return;
+            }
+            function Uq(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0.0,
+                r = 0.0,
+                s = 0.0,
+                t = 0.0;
+              o = l;
+              l = (l + 32) | 0;
+              m = (o + 16) | 0;
+              n = o;
+              p = c[46869] | 0;
+              i = +h[(p + 8) >> 3];
+              k = +h[(p + 16) >> 3];
+              f = c[46854] | 0;
+              d = p;
+              e = 1;
+              g = +h[(p + 40) >> 3] + i;
+              i = +h[(p + 56) >> 3] + i;
+              j = +h[(p + 48) >> 3] + k;
+              k = +h[(p + 64) >> 3] + k;
+              while (1) {
+                if ((e | 0) >= (f | 0)) break;
+                s = +h[(d + 104) >> 3];
+                q = +h[(d + 112) >> 3];
+                t = +h[(d + 136) >> 3] + s;
+                r = +h[(d + 144) >> 3] + q;
+                s = +h[(d + 152) >> 3] + s;
+                q = +h[(d + 160) >> 3] + q;
+                d = (d + 96) | 0;
+                e = (e + 1) | 0;
+                g = t < g ? t : g;
+                i = s > i ? s : i;
+                j = r < j ? r : j;
+                k = q > k ? q : k;
+              }
+              d = QA(b, 93100) | 0;
+              if (d | 0 ? a[d >> 0] | 0 : 0) h[173] = +r5(d);
+              s = +h[173];
+              t = s * (k - j);
+              s = s * (i - g);
+              h[m >> 3] = g - s;
+              h[(m + 8) >> 3] = j - t;
+              h[n >> 3] = s + i;
+              h[(n + 8) >> 3] = t + k;
+              dr(m, n);
+              l = o;
+              return;
+            }
+            function Vq() {
+              var a = 0,
+                b = 0,
+                d = 0,
+                e = 0;
+              d = l;
+              l = (l + 16) | 0;
+              b = d;
+              if (Yq(0) | 0) {
+                Zq();
+                a = 0;
+                do {
+                  kr();
+                  a = (a + 1) | 0;
+                } while ((Yq(a) | 0) != 0);
+                if (!0) a = 1;
+                else {
+                  e = c[15712] | 0;
+                  c[b >> 2] = a;
+                  w4(e, 93028, b) | 0;
+                  a = 1;
+                }
+              } else a = 0;
+              l = d;
+              return a | 0;
+            }
+            function Wq() {
+              var a = 0,
+                b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 16) | 0;
+              h = (i + 8) | 0;
+              g = i;
+              b = Yq(0) | 0;
+              if (!b) a = 0;
+              else {
+                Zq();
+                _q(0);
+                Yu(0, 1);
+                a = 0;
+                e = 0;
+                d = 0;
+                while (1) {
+                  ar();
+                  d = (d + 1) | 0;
+                  f = Yq(d) | 0;
+                  if (!f) break;
+                  b = (f | 0) < (b | 0) ? 0 : (e + 1) | 0;
+                  c[46846] = 1;
+                  if (b) {
+                    br();
+                    a = (a + 1) | 0;
+                  }
+                  _q(1);
+                  Yu(0, 1);
+                  e = b;
+                  b = f;
+                }
+                if (0) {
+                  f = c[15712] | 0;
+                  c[g >> 2] = d;
+                  w4(f, 93028, g) | 0;
+                  c[h >> 2] = a;
+                  w4(f, 93055, h) | 0;
+                }
+                cr();
+                a = 1;
+              }
+              l = i;
+              return a | 0;
+            }
+            function Xq() {
+              var a = 0,
+                b = 0,
+                d = 0,
+                e = 0;
+              d = c[46854] | 0;
+              a = c[46869] | 0;
+              b = 0;
+              while (1) {
+                if ((b | 0) >= (d | 0)) break;
+                e = c[((c[((c[a >> 2] | 0) + 16) >> 2] | 0) + 132) >> 2] | 0;
+                h[e >> 3] = +h[(a + 8) >> 3];
+                h[(e + 8) >> 3] = +h[(a + 16) >> 3];
+                a = (a + 96) | 0;
+                b = (b + 1) | 0;
+              }
+              return;
+            }
+            function Yq(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              q = l;
+              l = (l + 48) | 0;
+              o = (q + 24) | 0;
+              n = (q + 8) | 0;
+              p = q;
+              d = c[46869] | 0;
+              e = c[46854] | 0;
+              b = 0;
+              while (1) {
+                if ((b | 0) >= (e | 0)) {
+                  f = 0;
+                  b = 0;
+                  break;
+                }
+                c[(d + ((b * 96) | 0) + 32) >> 2] = 0;
+                b = (b + 1) | 0;
+              }
+              a: while (1) {
+                if ((b | 0) >= ((e + -1) | 0)) break;
+                m = (d + 96) | 0;
+                b = (b + 1) | 0;
+                j = (d + 8) | 0;
+                k = (d + 40) | 0;
+                i = (d + 32) | 0;
+                g = m;
+                h = b;
+                while (1) {
+                  if ((h | 0) >= (e | 0)) {
+                    d = m;
+                    continue a;
+                  }
+                  e = (g + 8) | 0;
+                  c[n >> 2] = c[j >> 2];
+                  c[(n + 4) >> 2] = c[(j + 4) >> 2];
+                  c[(n + 8) >> 2] = c[(j + 8) >> 2];
+                  c[(n + 12) >> 2] = c[(j + 12) >> 2];
+                  c[o >> 2] = c[e >> 2];
+                  c[(o + 4) >> 2] = c[(e + 4) >> 2];
+                  c[(o + 8) >> 2] = c[(e + 8) >> 2];
+                  c[(o + 12) >> 2] = c[(e + 12) >> 2];
+                  if (!(yu(n, k, o, (g + 40) | 0) | 0)) d = f;
+                  else {
+                    c[i >> 2] = 1;
+                    c[(g + 32) >> 2] = 1;
+                    d = (f + 1) | 0;
+                  }
+                  g = (g + 96) | 0;
+                  h = (h + 1) | 0;
+                  f = d;
+                  e = c[46854] | 0;
+                }
+              }
+              if (0 > 1) {
+                o = c[15712] | 0;
+                c[p >> 2] = a;
+                c[(p + 4) >> 2] = f;
+                w4(o, 93081, p) | 0;
+              }
+              l = q;
+              return f | 0;
+            }
+            function Zq() {
+              var a = 0,
+                b = 0,
+                d = 0,
+                e = 0.0,
+                f = 0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0;
+              ir();
+              k = c[46848] | 0;
+              l = c[46869] | 0;
+              a = c[46845] | 0;
+              a: while (1) {
+                i = a;
+                if (a >>> 0 >= k >>> 0) break;
+                b = (a + 4) | 0;
+                if (b >>> 0 >= k >>> 0) {
+                  a = b;
+                  continue;
+                }
+                f = c[b >> 2] | 0;
+                d = c[a >> 2] | 0;
+                g = +h[d >> 3];
+                if (+h[f >> 3] != g) {
+                  a = b;
+                  continue;
+                }
+                e = +h[(d + 8) >> 3];
+                if (+h[(f + 8) >> 3] != e) {
+                  a = b;
+                  continue;
+                }
+                j = (a + 8) | 0;
+                f = 2;
+                while (1) {
+                  if (j >>> 0 >= k >>> 0) break;
+                  d = c[j >> 2] | 0;
+                  if (!(+h[d >> 3] == g)) {
+                    m = 11;
+                    break;
+                  }
+                  if (!(+h[(d + 8) >> 3] == e)) {
+                    m = 11;
+                    break;
+                  }
+                  j = (j + 4) | 0;
+                  f = (f + 1) | 0;
+                }
+                if ((m | 0) == 11) {
+                  m = 0;
+                  d = c[j >> 2] | 0;
+                  if (+h[(d + 8) >> 3] == e) {
+                    e = (+h[d >> 3] - g) / +(f | 0);
+                    d = (((((j >>> 0 > b >>> 0 ? j : b) + -1 + (0 - i)) | 0) >>> 2) + 1) | 0;
+                    a = 1;
+                    while (1) {
+                      if ((a | 0) == (d | 0)) {
+                        a = j;
+                        continue a;
+                      }
+                      i = c[b >> 2] | 0;
+                      h[i >> 3] = +h[i >> 3] + e * +(a | 0);
+                      a = (a + 1) | 0;
+                      b = (b + 4) | 0;
+                    }
+                  }
+                }
+                while (1) {
+                  if (b >>> 0 >= j >>> 0) {
+                    a = j;
+                    continue a;
+                  }
+                  f = c[a >> 2] | 0;
+                  n = c[(f + 16) >> 2] | 0;
+                  i = c[b >> 2] | 0;
+                  d = c[(i + 16) >> 2] | 0;
+                  h[i >> 3] =
+                    (+h[(l + ((n * 96) | 0) + 56) >> 3] -
+                      +h[(l + ((n * 96) | 0) + 40) >> 3] +
+                      +h[(l + ((d * 96) | 0) + 56) >> 3] -
+                      +h[(l + ((d * 96) | 0) + 40) >> 3]) *
+                      0.5 +
+                    +h[f >> 3];
+                  b = (b + 4) | 0;
+                  a = (a + 4) | 0;
+                }
+              }
+              return;
+            }
+            function _q(a) {
+              a = a | 0;
+              var b = 0.0,
+                d = 0.0,
+                e = 0.0,
+                f = 0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0;
+              if (a | 0) ir();
+              i = c[46845] | 0;
+              j = c[i >> 2] | 0;
+              d = +h[j >> 3];
+              h[23272] = d;
+              k = c[46854] | 0;
+              f = 1;
+              g = +h[j >> 3];
+              while (1) {
+                if ((f | 0) >= (k | 0)) break;
+                a = c[(i + (f << 2)) >> 2] | 0;
+                b = +h[a >> 3];
+                if (b < d) {
+                  h[23272] = b;
+                  e = +h[a >> 3];
+                } else {
+                  e = b;
+                  b = d;
+                }
+                f = (f + 1) | 0;
+                d = b;
+                g = e > g ? e : g;
+              }
+              e = +h[(j + 8) >> 3];
+              h[23273] = e;
+              h[23275] = +h[((c[(i + ((k + -1) << 2)) >> 2] | 0) + 8) >> 3] - e;
+              h[23274] = g - d;
+              return;
+            }
+            function $q() {
+              var a = 0;
+              a = c[46847] | 0;
+              if (a >>> 0 < (c[46848] | 0) >>> 0) {
+                c[46847] = a + 4;
+                a = c[a >> 2] | 0;
+              } else a = 0;
+              return a | 0;
+            }
+            function ar() {
+              var a = 0,
+                b = 0,
+                d = 0;
+              a = c[46869] | 0;
+              er();
+              d = (c[46846] | 0) == 0;
+              b = 0;
+              while (1) {
+                if ((b | 0) >= (c[46854] | 0)) break;
+                if (!(d ? !(c[(a + 32) >> 2] | 0) : 0)) fr(a);
+                a = (a + 96) | 0;
+                b = (b + 1) | 0;
+              }
+              return;
+            }
+            function br() {
+              var a = 0,
+                b = 0,
+                c = 0,
+                d = 0.0,
+                e = 0.0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0;
+              a = l;
+              l = (l + 32) | 0;
+              c = (a + 16) | 0;
+              b = a;
+              j = +h[23268];
+              i = +h[23266];
+              g = +h[23269];
+              e = +h[23267];
+              d = (i - e) * 0.05;
+              f = (j - g) * 0.05;
+              h[b >> 3] = f + j;
+              h[(b + 8) >> 3] = i + d;
+              h[c >> 3] = g - f;
+              h[(c + 8) >> 3] = e - d;
+              dr(c, b);
+              l = a;
+              return;
+            }
+            function cr() {
+              Gs();
+              Is();
+              Ku();
+              ms();
+              return;
+            }
+            function dr(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0,
+                d = 0.0,
+                e = 0.0,
+                f = 0.0;
+              f = +h[a >> 3];
+              h[23269] = f;
+              e = +h[b >> 3];
+              h[23268] = e;
+              c = +h[(a + 8) >> 3];
+              h[23267] = c;
+              d = +h[(b + 8) >> 3];
+              h[23266] = d;
+              h[23258] = f;
+              h[23260] = f;
+              h[23262] = e;
+              h[23264] = e;
+              h[23265] = d;
+              h[23261] = d;
+              h[23263] = c;
+              h[23259] = c;
+              return;
+            }
+            function er() {
+              var a = 0,
+                b = 0.0,
+                d = 0.0,
+                e = 0.0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0.0,
+                s = 0.0,
+                t = 0.0,
+                u = 0.0;
+              m = c[46869] | 0;
+              g = (m + 8) | 0;
+              f = +us(g, 186064);
+              e = +us(g, 186080);
+              d = +us(g, 186096);
+              a = 1;
+              b = +us(g, 186112);
+              g = m;
+              i = m;
+              j = m;
+              k = m;
+              while (1) {
+                l = (m + 96) | 0;
+                if ((a | 0) >= (c[46854] | 0)) break;
+                q = (m + 104) | 0;
+                r = +us(q, 186064);
+                n = r < f;
+                t = +us(q, 186096);
+                p = t < d;
+                s = +us(q, 186080);
+                o = s < e;
+                u = +us(q, 186112);
+                q = u < b;
+                a = (a + 1) | 0;
+                b = q ? u : b;
+                d = p ? t : d;
+                e = o ? s : e;
+                f = n ? r : f;
+                g = q ? l : g;
+                i = p ? l : i;
+                j = o ? l : j;
+                k = n ? l : k;
+                m = l;
+              }
+              Ws((k + 8) | 0, +h[23258], +h[23259]);
+              Ws((i + 8) | 0, +h[23262], +h[23263]);
+              Ws((j + 8) | 0, +h[23260], +h[23261]);
+              Ws((g + 8) | 0, +h[23264], +h[23265]);
+              return;
+            }
+            function fr(a) {
+              a = a | 0;
+              var b = 0.0,
+                d = 0.0,
+                e = 0.0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0.0,
+                r = 0,
+                s = 0;
+              p = l;
+              l = (l + 64) | 0;
+              j = (p + 48) | 0;
+              i = (p + 32) | 0;
+              g = (p + 16) | 0;
+              m = (p + 8) | 0;
+              n = p;
+              k = c[(a + 88) >> 2] | 0;
+              o = (k + 8) | 0;
+              b = 0.0;
+              d = 0.0;
+              e = 0.0;
+              k = c[k >> 2] | 0;
+              while (1) {
+                f = c[k >> 2] | 0;
+                if (!f) break;
+                s = (k + 8) | 0;
+                r = (f + 8) | 0;
+                c[g >> 2] = c[o >> 2];
+                c[(g + 4) >> 2] = c[(o + 4) >> 2];
+                c[(g + 8) >> 2] = c[(o + 8) >> 2];
+                c[(g + 12) >> 2] = c[(o + 12) >> 2];
+                c[i >> 2] = c[s >> 2];
+                c[(i + 4) >> 2] = c[(s + 4) >> 2];
+                c[(i + 8) >> 2] = c[(s + 8) >> 2];
+                c[(i + 12) >> 2] = c[(s + 12) >> 2];
+                c[j >> 2] = c[r >> 2];
+                c[(j + 4) >> 2] = c[(r + 4) >> 2];
+                c[(j + 8) >> 2] = c[(r + 8) >> 2];
+                c[(j + 12) >> 2] = c[(r + 12) >> 2];
+                q = +gr(g, i, j);
+                c[g >> 2] = c[o >> 2];
+                c[(g + 4) >> 2] = c[(o + 4) >> 2];
+                c[(g + 8) >> 2] = c[(o + 8) >> 2];
+                c[(g + 12) >> 2] = c[(o + 12) >> 2];
+                c[i >> 2] = c[s >> 2];
+                c[(i + 4) >> 2] = c[(s + 4) >> 2];
+                c[(i + 8) >> 2] = c[(s + 8) >> 2];
+                c[(i + 12) >> 2] = c[(s + 12) >> 2];
+                c[j >> 2] = c[r >> 2];
+                c[(j + 4) >> 2] = c[(r + 4) >> 2];
+                c[(j + 8) >> 2] = c[(r + 8) >> 2];
+                c[(j + 12) >> 2] = c[(r + 12) >> 2];
+                hr(g, i, j, m, n);
+                b = +h[n >> 3] * q + b;
+                d = +h[m >> 3] * q + d;
+                e = q + e;
+                k = f;
+              }
+              h[(a + 8) >> 3] = d / e;
+              h[(a + 16) >> 3] = b / e;
+              l = p;
+              return;
+            }
+            function gr(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0.0;
+              d = +h[(b + 8) >> 3];
+              f = +h[(c + 8) >> 3];
+              e = +h[(a + 8) >> 3];
+              return +(+B(+((f - e) * +h[b >> 3] + (d - f) * +h[a >> 3] + +h[c >> 3] * (e - d))) * 0.5);
+            }
+            function hr(a, b, c, d, e) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              h[d >> 3] = (+h[b >> 3] + +h[a >> 3] + +h[c >> 3]) * 0.3333333333333333;
+              h[e >> 3] = (+h[(b + 8) >> 3] + +h[(a + 8) >> 3] + +h[(c + 8) >> 3]) * 0.3333333333333333;
+              return;
+            }
+            function ir() {
+              var a = 0,
+                b = 0,
+                d = 0,
+                e = 0;
+              a = c[46845] | 0;
+              if (!a) {
+                a = KK(c[46854] << 2) | 0;
+                c[46845] = a;
+                c[46848] = a + (c[46854] << 2);
+              }
+              d = c[46869] | 0;
+              Vs();
+              e = c[46854] | 0;
+              b = 0;
+              while (1) {
+                if ((b | 0) >= (e | 0)) break;
+                c[a >> 2] = d + 8;
+                c[(d + 88) >> 2] = 0;
+                c[(d + 28) >> 2] = 1;
+                d = (d + 96) | 0;
+                a = (a + 4) | 0;
+                b = (b + 1) | 0;
+              }
+              o4(c[46845] | 0, e, 4, 69);
+              c[46847] = c[46845];
+              return;
+            }
+            function jr(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0.0;
+              a = c[a >> 2] | 0;
+              b = c[b >> 2] | 0;
+              d = +h[(a + 8) >> 3];
+              e = +h[(b + 8) >> 3];
+              if (!(d < e))
+                if (!(d > e)) {
+                  e = +h[a >> 3];
+                  d = +h[b >> 3];
+                  if (e < d) a = -1;
+                  else a = (e > d) & 1;
+                } else a = 1;
+              else a = -1;
+              return a | 0;
+            }
+            function kr() {
+              var a = 0,
+                b = 0,
+                d = 0,
+                e = 0;
+              d = c[46854] | 0;
+              a = 0;
+              b = c[46869] | 0;
+              while (1) {
+                if ((a | 0) >= (d | 0)) break;
+                e = (b + 8) | 0;
+                h[e >> 3] = +h[e >> 3] * 1.05;
+                e = (b + 16) | 0;
+                h[e >> 3] = +h[e >> 3] * 1.05;
+                a = (a + 1) | 0;
+                b = (b + 96) | 0;
+              }
+              return;
+            }
+            function lr(b, e) {
+              b = b | 0;
+              e = e | 0;
+              var f = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0.0,
+                o = 0.0;
+              m = l;
+              l = (l + 48) | 0;
+              k = m;
+              j = (m + 24) | 0;
+              f = QA(e, 93112) | 0;
+              if (!((f | 0) != 0 ? (mr(f, j, 1.0, 0.0) | 0) != 0 : 0)) i = 3;
+              do
+                if ((i | 0) == 3) {
+                  e = QA(e, 93116) | 0;
+                  if (e | 0 ? mr(e, j, 0.800000011920929, 4.0) | 0 : 0) break;
+                  g[(j + 4) >> 2] = 4.0;
+                  g[j >> 2] = 4.0;
+                  a[(j + 8) >> 0] = 1;
+                }
+              while (0);
+              if (0) {
+                i = c[15712] | 0;
+                o = +g[j >> 2];
+                n = +g[(j + 4) >> 2];
+                c[k >> 2] = d[(j + 8) >> 0];
+                h[(k + 8) >> 3] = o;
+                h[(k + 16) >> 3] = n;
+                w4(i, 93121, k) | 0;
+              }
+              c[b >> 2] = c[j >> 2];
+              c[(b + 4) >> 2] = c[(j + 4) >> 2];
+              c[(b + 8) >> 2] = c[(j + 8) >> 2];
+              l = m;
+              return;
+            }
+            function mr(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = +e;
+              f = +f;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0.0;
+              o = l;
+              l = (l + 16) | 0;
+              m = o;
+              j = (o + 12) | 0;
+              k = (o + 8) | 0;
+              while (1) {
+                h = a[b >> 0] | 0;
+                i = (b + 1) | 0;
+                if (!(S2((h << 24) >> 24) | 0)) break;
+                else b = i;
+              }
+              p = (h << 24) >> 24 == 43;
+              h = (d + 8) | 0;
+              a[h >> 0] = p & 1;
+              c[m >> 2] = j;
+              c[(m + 4) >> 2] = k;
+              switch (b5(p ? i : b, 93154, m) | 0) {
+                case 0: {
+                  b = 0;
+                  break;
+                }
+                case 1: {
+                  c[k >> 2] = c[j >> 2];
+                  n = 5;
+                  break;
+                }
+                default:
+                  n = 5;
+              }
+              if ((n | 0) == 5) {
+                do
+                  if (a[h >> 0] | 0) {
+                    if (e > 1.0) {
+                      q = +g[j >> 2] / e;
+                      g[d >> 2] = q > f ? f : q;
+                      e = +g[k >> 2] / e;
+                      e = e > f ? f : e;
+                      break;
+                    }
+                    if (e < 1.0) {
+                      q = +g[j >> 2] / e;
+                      g[d >> 2] = q < f ? f : q;
+                      e = +g[k >> 2] / e;
+                      e = e < f ? f : e;
+                      break;
+                    } else {
+                      c[d >> 2] = c[j >> 2];
+                      e = +g[k >> 2];
+                      break;
+                    }
+                  } else {
+                    g[d >> 2] = +g[j >> 2] / e + 1.0;
+                    e = +g[k >> 2] / e + 1.0;
+                  }
+                while (0);
+                g[(d + 4) >> 2] = e;
+                b = 1;
+              }
+              l = o;
+              return b | 0;
+            }
+            function nr(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0,
+                d = 0;
+              d = l;
+              l = (l + 32) | 0;
+              c = d;
+              if ((tB(a) | 0) < 2) a = 0;
+              else {
+                Oq(a, b, c) | 0;
+                a = Qq(a, c) | 0;
+              }
+              l = d;
+              return a | 0;
+            }
+            function or(a) {
+              a = a | 0;
+              return nr(a, QA(a, 92507) | 0) | 0;
+            }
+            function pr(b, e) {
+              b = b | 0;
+              e = e | 0;
+              var f = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0.0,
+                o = 0.0;
+              m = l;
+              l = (l + 48) | 0;
+              k = m;
+              j = (m + 24) | 0;
+              f = QA(e, 93116) | 0;
+              if (!((f | 0) != 0 ? (mr(f, j, 1.0, 0.0) | 0) != 0 : 0)) i = 3;
+              do
+                if ((i | 0) == 3) {
+                  e = QA(e, 93112) | 0;
+                  if (e | 0 ? mr(e, j, 1.25, 3.200000047683716) | 0 : 0) break;
+                  g[(j + 4) >> 2] = 3.200000047683716;
+                  g[j >> 2] = 3.200000047683716;
+                  a[(j + 8) >> 0] = 1;
+                }
+              while (0);
+              if (0) {
+                i = c[15712] | 0;
+                o = +g[j >> 2];
+                n = +g[(j + 4) >> 2];
+                c[k >> 2] = d[(j + 8) >> 0];
+                h[(k + 8) >> 3] = o;
+                h[(k + 16) >> 3] = n;
+                w4(i, 93183, k) | 0;
+              }
+              c[b >> 2] = c[j >> 2];
+              c[(b + 4) >> 2] = c[(j + 4) >> 2];
+              c[(b + 8) >> 2] = c[(j + 8) >> 2];
+              l = m;
+              return;
+            }
+            function qr(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              p = l;
+              l = (l + 16) | 0;
+              o = p;
+              h = 0;
+              while (1) {
+                if ((h | 0) >= (d | 0)) break;
+                c[(e + (h << 2)) >> 2] = -1;
+                h = (h + 1) | 0;
+              }
+              c[(e + (a << 2)) >> 2] = 0;
+              rr(f, a);
+              a: do
+                if (!(c[(b + 8) >> 2] | 0)) {
+                  h = 2147483647;
+                  b: while (1) {
+                    if (!(((sr(f, o) | 0) << 24) >> 24)) break a;
+                    j = c[o >> 2] | 0;
+                    h = c[(e + (j << 2)) >> 2] | 0;
+                    i = (b + ((j * 20) | 0)) | 0;
+                    j = (b + ((j * 20) | 0) + 4) | 0;
+                    k = (h + 1) | 0;
+                    a = 1;
+                    while (1) {
+                      if ((a | 0) >= (c[i >> 2] | 0)) continue b;
+                      m = c[((c[j >> 2] | 0) + (a << 2)) >> 2] | 0;
+                      n = (e + (m << 2)) | 0;
+                      if ((c[n >> 2] | 0) < 0) {
+                        c[n >> 2] = k;
+                        tr(f, m) | 0;
+                      }
+                      a = (a + 1) | 0;
+                    }
+                  }
+                } else {
+                  h = 2147483647;
+                  c: while (1) {
+                    if (!(((sr(f, o) | 0) << 24) >> 24)) break a;
+                    k = c[o >> 2] | 0;
+                    h = c[(e + (k << 2)) >> 2] | 0;
+                    i = (b + ((k * 20) | 0)) | 0;
+                    j = (b + ((k * 20) | 0) + 4) | 0;
+                    k = (b + ((k * 20) | 0) + 8) | 0;
+                    a = 1;
+                    while (1) {
+                      if ((a | 0) >= (c[i >> 2] | 0)) continue c;
+                      m = c[((c[j >> 2] | 0) + (a << 2)) >> 2] | 0;
+                      n = (e + (m << 2)) | 0;
+                      if ((c[n >> 2] | 0) < 0) {
+                        c[n >> 2] = h + ~~+g[((c[k >> 2] | 0) + (a << 2)) >> 2];
+                        tr(f, m) | 0;
+                      }
+                      a = (a + 1) | 0;
+                    }
+                  }
+                }
+              while (0);
+              a = (h + 10) | 0;
+              h = 0;
+              while (1) {
+                if ((h | 0) >= (d | 0)) break;
+                i = (e + (h << 2)) | 0;
+                if ((c[i >> 2] | 0) < 0) c[i >> 2] = a;
+                h = (h + 1) | 0;
+              }
+              l = p;
+              return;
+            }
+            function rr(a, b) {
+              a = a | 0;
+              b = b | 0;
+              c[c[a >> 2] >> 2] = b;
+              c[(a + 12) >> 2] = 0;
+              c[(a + 8) >> 2] = 1;
+              return;
+            }
+            function sr(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = (a + 12) | 0;
+              e = c[d >> 2] | 0;
+              if ((e | 0) < (c[(a + 8) >> 2] | 0)) {
+                a = c[a >> 2] | 0;
+                c[d >> 2] = e + 1;
+                c[b >> 2] = c[(a + (e << 2)) >> 2];
+                a = 1;
+              } else a = 0;
+              return a | 0;
+            }
+            function tr(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = (a + 8) | 0;
+              e = c[d >> 2] | 0;
+              if ((e | 0) < (c[(a + 4) >> 2] | 0)) {
+                a = c[a >> 2] | 0;
+                c[d >> 2] = e + 1;
+                c[(a + (e << 2)) >> 2] = b;
+                a = 1;
+              } else a = 0;
+              return a | 0;
+            }
+            function ur(a, b) {
+              a = a | 0;
+              b = b | 0;
+              c[a >> 2] = KK(b << 2) | 0;
+              c[(a + 4) >> 2] = b;
+              c[(a + 8) >> 2] = 0;
+              c[(a + 12) >> 2] = 0;
+              return;
+            }
+            function vr(a) {
+              a = a | 0;
+              U1(c[a >> 2] | 0);
+              return;
+            }
+            function wr(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0,
+                g = 0,
+                i = 0;
+              if (!0) g = 0;
+              else {
+                U4(93216, 25, 1, c[15712] | 0) | 0;
+                g = 0;
+              }
+              while (1) {
+                if ((g | 0) >= (a | 0)) break;
+                i = (b + (g << 2)) | 0;
+                f = 0;
+                e = 0.0;
+                while (1) {
+                  if ((f | 0) == (a | 0)) break;
+                  if ((g | 0) != (f | 0)) e = +h[((c[i >> 2] | 0) + (f << 3)) >> 3] + e;
+                  f = (f + 1) | 0;
+                }
+                h[((c[i >> 2] | 0) + (g << 3)) >> 3] = -e;
+                g = (g + 1) | 0;
+              }
+              return wt(b, d, (a + -1) | 0) | 0;
+            }
+            function xr(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0.0;
+              j = un(b, b, 0.0) | 0;
+              k = un(b, b, 0.0) | 0;
+              e = jC(a) | 0;
+              while (1) {
+                if (!e) break;
+                d = aB(a, e) | 0;
+                while (1) {
+                  if (!d) break;
+                  g = c[d >> 2] & 3;
+                  f = (c[c[(((g | 0) == 3 ? d : (d + 48) | 0) + 40) >> 2] >> 2] | 0) >>> 4;
+                  g = (c[c[(((g | 0) == 2 ? d : (d + -48) | 0) + 40) >> 2] >> 2] | 0) >>> 4;
+                  if ((f | 0) != (g | 0)) {
+                    l = -1.0 / +h[((c[(d + 16) >> 2] | 0) + 136) >> 3];
+                    h[((c[(j + (g << 2)) >> 2] | 0) + (f << 3)) >> 3] = l;
+                    h[((c[(j + (f << 2)) >> 2] | 0) + (g << 3)) >> 3] = l;
+                  }
+                  d = bB(a, d, e) | 0;
+                }
+                e = kC(a, e) | 0;
+              }
+              i = wr(b, j, k) | 0;
+              a: do
+                if (i | 0) {
+                  f = (a + 16) | 0;
+                  e = 0;
+                  while (1) {
+                    if ((e | 0) >= (b | 0)) break a;
+                    g = (k + (e << 2)) | 0;
+                    d = 0;
+                    while (1) {
+                      if ((d | 0) == (b | 0)) break;
+                      a = c[g >> 2] | 0;
+                      h[((c[((c[((c[f >> 2] | 0) + 160) >> 2] | 0) + (e << 2)) >> 2] | 0) + (d << 3)) >> 3] =
+                        +h[((c[(k + (d << 2)) >> 2] | 0) + (d << 3)) >> 3] +
+                        +h[(a + (e << 3)) >> 3] +
+                        +h[(a + (d << 3)) >> 3] * -2.0;
+                      d = (d + 1) | 0;
+                    }
+                    e = (e + 1) | 0;
+                  }
+                }
+              while (0);
+              vn(j);
+              vn(k);
+              return i | 0;
+            }
+            function yr(a, b, c, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = +e;
+              f = f | 0;
+              var g = 0.0,
+                h = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0;
+              s = l;
+              l = (l + 16) | 0;
+              j = s;
+              n = d << 3;
+              o = KK(n) | 0;
+              p = KK(n) | 0;
+              q = KK(n) | 0;
+              k = KK(n) | 0;
+              m = KK(n) | 0;
+              n = KK(n) | 0;
+              Ot(d, c, n);
+              Ht(d, n);
+              Ht(d, b);
+              Jt(a, d, b, k);
+              Lt(d, n, k, o);
+              Ot(d, o, p);
+              i = (f + -1) | 0;
+              c = 0;
+              g = +Pt(d, o, o);
+              while (1) {
+                if ((c | 0) >= (f | 0)) {
+                  c = 0;
+                  break;
+                }
+                if (!(+Qt(d, o) > e)) {
+                  c = 0;
+                  break;
+                }
+                Jt(a, d, p, q);
+                h = +Pt(d, p, q);
+                if (h == 0.0) {
+                  c = 0;
+                  break;
+                }
+                h = g / h;
+                Nt(d, p, h, m);
+                Mt(d, b, m, b);
+                if ((c | 0) < (i | 0)) {
+                  Nt(d, q, h, q);
+                  Lt(d, o, q, o);
+                  h = +Pt(d, o, o);
+                  if (g == 0.0) {
+                    r = 7;
+                    break;
+                  }
+                  Nt(d, p, h / g, p);
+                  Mt(d, o, p, p);
+                  g = h;
+                }
+                c = (c + 1) | 0;
+              }
+              if ((r | 0) == 7) {
+                gA(1, 93242, j) | 0;
+                c = 1;
+              }
+              U1(o);
+              U1(p);
+              U1(q);
+              U1(k);
+              U1(m);
+              U1(n);
+              l = s;
+              return c | 0;
+            }
+            function zr(a, b, c, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = +e;
+              f = f | 0;
+              g = g | 0;
+              var h = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0;
+              s = l;
+              l = (l + 16) | 0;
+              j = s;
+              o = d << 3;
+              p = KK(o) | 0;
+              q = KK(o) | 0;
+              k = KK(o) | 0;
+              m = KK(o) | 0;
+              n = KK(o) | 0;
+              o = KK(o) | 0;
+              Ot(d, c, o);
+              if ((g << 24) >> 24) {
+                Ht(d, o);
+                Ht(d, b);
+              }
+              Kt(a, d, b, m);
+              Lt(d, o, m, p);
+              Ot(d, p, q);
+              g = (f + -1) | 0;
+              c = 0;
+              h = +Pt(d, p, p);
+              while (1) {
+                if ((c | 0) >= (f | 0)) {
+                  c = 0;
+                  break;
+                }
+                if (!(+Qt(d, p) > e)) {
+                  c = 0;
+                  break;
+                }
+                Kt(a, d, q, k);
+                i = +Pt(d, q, k);
+                if (i == 0.0) {
+                  c = 0;
+                  break;
+                }
+                i = h / i;
+                Nt(d, q, i, n);
+                Mt(d, b, n, b);
+                if ((c | 0) < (g | 0)) {
+                  Nt(d, k, i, k);
+                  Lt(d, p, k, p);
+                  i = +Pt(d, p, p);
+                  if (h == 0.0) {
+                    r = 9;
+                    break;
+                  }
+                  Nt(d, q, i / h, q);
+                  Mt(d, p, q, q);
+                  h = i;
+                }
+                c = (c + 1) | 0;
+              }
+              if ((r | 0) == 9) {
+                gA(1, 93242, j) | 0;
+                c = 1;
+              }
+              U1(p);
+              U1(q);
+              U1(k);
+              U1(m);
+              U1(n);
+              U1(o);
+              l = s;
+              return c | 0;
+            }
+            function Ar(a, b, c, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = +e;
+              f = f | 0;
+              var g = 0.0,
+                h = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              q = l;
+              l = (l + 16) | 0;
+              j = q;
+              k = d << 2;
+              m = JK(k) | 0;
+              n = JK(k) | 0;
+              o = JK(k) | 0;
+              k = JK(k) | 0;
+              St(d, b);
+              St(d, c);
+              Tt(a, d, b, k);
+              St(d, k);
+              Ut(d, c, k, m);
+              Yt(d, m, n);
+              i = (f + -1) | 0;
+              c = 0;
+              g = +Zt(d, m, m);
+              while (1) {
+                if ((c | 0) >= (f | 0)) {
+                  c = 0;
+                  break;
+                }
+                if (!(+au(d, m) > e)) {
+                  c = 0;
+                  break;
+                }
+                St(d, n);
+                St(d, b);
+                St(d, m);
+                Tt(a, d, n, o);
+                St(d, o);
+                h = +Zt(d, n, o);
+                if (h == 0.0) {
+                  c = 0;
+                  break;
+                }
+                h = g / h;
+                Wt(d, b, h, n);
+                if ((c | 0) < (i | 0)) {
+                  Wt(d, m, -h, o);
+                  h = +Zt(d, m, m);
+                  if (g == 0.0) {
+                    p = 7;
+                    break;
+                  }
+                  Xt(d, n, h / g, n);
+                  Vt(d, m, n, n);
+                  g = h;
+                }
+                c = (c + 1) | 0;
+              }
+              if ((p | 0) == 7) {
+                gA(1, 93242, j) | 0;
+                c = 1;
+              }
+              U1(m);
+              U1(n);
+              U1(o);
+              U1(k);
+              l = q;
+              return c | 0;
+            }
+            function Br(a, b, d, e, f, i, j, k, m, n) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              i = i | 0;
+              j = j | 0;
+              k = k | 0;
+              m = m | 0;
+              n = +n;
+              var o = 0,
+                p = 0,
+                q = 0.0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0.0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0.0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0.0;
+              M = l;
+              l = (l + 48) | 0;
+              F = (M + 24) | 0;
+              E = (M + 16) | 0;
+              D = (M + 8) | 0;
+              C = M;
+              J = (M + 40) | 0;
+              K = (M + 36) | 0;
+              H = (M + 32) | 0;
+              s = j & 4;
+              c[J >> 2] = 0;
+              c[K >> 2] = 0;
+              a: do
+                if (c[(a + 16) >> 2] | 0) {
+                  p = 0;
+                  o = 0;
+                  while (1) {
+                    if ((p | 0) >= (b | 0)) break;
+                    t = c[(a + ((p * 20) | 0)) >> 2] | 0;
+                    u = (a + ((p * 20) | 0) + 16) | 0;
+                    r = 1;
+                    while (1) {
+                      if ((r | 0) >= (t | 0)) break;
+                      if (!((o << 24) >> 24)) o = +g[((c[u >> 2] | 0) + (r << 2)) >> 2] != 0.0;
+                      else o = 1;
+                      r = (r + 1) | 0;
+                      o = o & 1;
+                    }
+                    p = (p + 1) | 0;
+                  }
+                  if ((o << 24) >> 24) {
+                    z = (s | 0) != 0;
+                    if (z) {
+                      r = (e + 4) | 0;
+                      b: do
+                        if ((i | 0) > 2) {
+                          o = (i + -1) | 0;
+                          if ((on(a, b, d, r, f, o, j, k, 15) | 0) < 0) {
+                            o = -1;
+                            break a;
+                          }
+                          p = (e + (o << 2)) | 0;
+                          o = 0;
+                          while (1) {
+                            if ((o | 0) >= (b | 0)) break b;
+                            h[((c[p >> 2] | 0) + (o << 3)) >> 3] = +h[((c[r >> 2] | 0) + (o << 3)) >> 3];
+                            o = (o + 1) | 0;
+                          }
+                        }
+                      while (0);
+                      y = c[e >> 2] | 0;
+                      w = c[r >> 2] | 0;
+                      if ((ju(a, b, w, b) | 0) == 0 ? (ty(a, b, 0.01, 0.1, w, J, K, H) | 0) == 0 : 0) {
+                        x = c[H >> 2] | 0;
+                        if ((x | 0) < 1) {
+                          o = on(a, b, d, e, f, i, j, k, m) | 0;
+                          break;
+                        }
+                        c: do
+                          if (n > 0.0) {
+                            s = c[J >> 2] | 0;
+                            t = c[K >> 2] | 0;
+                            u = (x + -1) | 0;
+                            q = 0.0;
+                            r = 0;
+                            while (1) {
+                              if ((r | 0) >= (x | 0)) break c;
+                              o = c[(t + (r << 2)) >> 2] | 0;
+                              A =
+                                n -
+                                q -
+                                +h[(w + (c[(s + (o << 2)) >> 2] << 3)) >> 3] +
+                                +h[(w + (c[(s + ((o + -1) << 2)) >> 2] << 3)) >> 3];
+                              q = (A < 0.0 ? 0.0 : A) + q;
+                              if ((r | 0) < (u | 0)) p = c[(t + ((r + 1) << 2)) >> 2] | 0;
+                              else p = b;
+                              while (1) {
+                                if ((o | 0) >= (p | 0)) break;
+                                I = (w + (c[(s + (o << 2)) >> 2] << 3)) | 0;
+                                h[I >> 3] = +h[I >> 3] + q;
+                                o = (o + 1) | 0;
+                              }
+                              r = (r + 1) | 0;
+                            }
+                          }
+                        while (0);
+                        if ((i | 0) == 2 ? (Qu(a, b, w, y, +h[23294]) | 0) != 0 : 0) {
+                          p = 0;
+                          o = -1;
+                        } else L = 33;
+                      } else {
+                        p = 0;
+                        o = -1;
+                      }
+                    } else {
+                      hn(a, b, i, e, f) | 0;
+                      if (!(ty(a, b, 0.01, 0.1, 0, J, K, H) | 0)) L = 33;
+                      else {
+                        p = 0;
+                        o = -1;
+                      }
+                    }
+                    d: do
+                      if ((L | 0) == 33) {
+                        if ((b | 0) == 1) {
+                          o = 0;
+                          break a;
+                        }
+                        I = KK(c[H >> 2] << 2) | 0;
+                        if (!m) {
+                          o = 0;
+                          break a;
+                        }
+                        if (0) TO();
+                        switch (k | 0) {
+                          case 2: {
+                            if (0) U4(93290, 24, 1, c[15712] | 0) | 0;
+                            o = nn(a, b) | 0;
+                            L = 46;
+                            break;
+                          }
+                          case 1: {
+                            o = jn(a, b) | 0;
+                            if (!o) {
+                              gA(0, 93315, C) | 0;
+                              gA(3, 93364, D) | 0;
+                              L = 47;
+                            } else G = o;
+                            break;
+                          }
+                          case 3: {
+                            if (0) U4(93417, 21, 1, c[15712] | 0) | 0;
+                            o = kn(a, b) | 0;
+                            L = 46;
+                            break;
+                          }
+                          default:
+                            L = 47;
+                        }
+                        if ((L | 0) == 46)
+                          if (!o) L = 47;
+                          else G = o;
+                        if ((L | 0) == 47) {
+                          if (0) U4(93439, 26, 1, c[15712] | 0) | 0;
+                          G = mn(a, b) | 0;
+                        }
+                        if (0) {
+                          a = c[15712] | 0;
+                          h[E >> 3] = +UO();
+                          w4(a, 93466, E) | 0;
+                          U4(93478, 25, 1, a) | 0;
+                          TO();
+                        }
+                        a = (b + -1) | 0;
+                        y = ((O(a, b) | 0) / 2) | 0;
+                        E = (y + b) | 0;
+                        e: do
+                          if (!z) {
+                            q = 1.0;
+                            p = 0;
+                            while (1) {
+                              if ((p | 0) >= (i | 0)) break;
+                              r = (e + (p << 2)) | 0;
+                              o = 0;
+                              while (1) {
+                                if ((o | 0) >= (b | 0)) break;
+                                A = +B(+(+h[((c[r >> 2] | 0) + (o << 3)) >> 3]));
+                                q = A > q ? A : q;
+                                o = (o + 1) | 0;
+                              }
+                              p = (p + 1) | 0;
+                            }
+                            q = 1.0 / q;
+                            p = 0;
+                            while (1) {
+                              if ((p | 0) >= (i | 0)) break e;
+                              r = (e + (p << 2)) | 0;
+                              o = 0;
+                              while (1) {
+                                if ((o | 0) >= (b | 0)) break;
+                                D = ((c[r >> 2] | 0) + (o << 3)) | 0;
+                                h[D >> 3] = +h[D >> 3] * (10.0 * q);
+                                o = (o + 1) | 0;
+                              }
+                              p = (p + 1) | 0;
+                            }
+                          }
+                        while (0);
+                        f: do
+                          if (n > 0.0) {
+                            v = +(y | 0);
+                            o = 0;
+                            q = 0.0;
+                            s = 0;
+                            g: while (1) {
+                              if ((s | 0) >= (a | 0)) break;
+                              t = (s + 1) | 0;
+                              r = o;
+                              p = t;
+                              while (1) {
+                                o = (r + 1) | 0;
+                                if ((p | 0) >= (b | 0)) {
+                                  s = t;
+                                  continue g;
+                                }
+                                A = +ft(e, i, s, p);
+                                r = o;
+                                q = A / +g[(G + (o << 2)) >> 2] + q;
+                                p = (p + 1) | 0;
+                              }
+                            }
+                            q = q / v;
+                            o = 0;
+                            while (1) {
+                              if ((o | 0) >= (E | 0)) {
+                                o = 0;
+                                break f;
+                              }
+                              D = (G + (o << 2)) | 0;
+                              g[D >> 2] = +g[D >> 2] * q;
+                              o = (o + 1) | 0;
+                            }
+                          } else o = 0;
+                        while (0);
+                        while (1) {
+                          if ((o | 0) >= (i | 0)) break;
+                          Ht(b, c[(e + (o << 2)) >> 2] | 0);
+                          o = (o + 1) | 0;
+                        }
+                        p = c[(e + 4) >> 2] | 0;
+                        q = +h[p >> 3];
+                        o = 0;
+                        while (1) {
+                          if ((o | 0) >= (b | 0)) break;
+                          D = (p + (o << 3)) | 0;
+                          h[D >> 3] = +h[D >> 3] - q;
+                          o = (o + 1) | 0;
+                        }
+                        u = i << 2;
+                        D = KK(u) | 0;
+                        x = b << 2;
+                        w = O(x, i) | 0;
+                        r = KK(w) | 0;
+                        o = 0;
+                        while (1) {
+                          if ((o | 0) >= (i | 0)) break;
+                          s = (r + ((O(o, b) | 0) << 2)) | 0;
+                          c[(D + (o << 2)) >> 2] = s;
+                          t = (e + (o << 2)) | 0;
+                          p = 0;
+                          while (1) {
+                            if ((p | 0) >= (b | 0)) break;
+                            g[(s + (p << 2)) >> 2] = +h[((c[t >> 2] | 0) + (p << 3)) >> 3];
+                            p = (p + 1) | 0;
+                          }
+                          o = (o + 1) | 0;
+                        }
+                        v = +(y | 0);
+                        if (0) {
+                          C = c[15712] | 0;
+                          h[F >> 3] = +UO();
+                          w4(C, 93504, F) | 0;
+                        }
+                        bu(E, G);
+                        cu(E, G);
+                        C = KK(b << 3) | 0;
+                        _t(b, 0.0, C);
+                        o = 0;
+                        r = 0;
+                        while (1) {
+                          if ((r | 0) >= (a | 0)) {
+                            o = b;
+                            p = 0;
+                            r = 0;
+                            break;
+                          }
+                          s = (b - r) | 0;
+                          q = 0.0;
+                          p = 1;
+                          while (1) {
+                            o = (o + 1) | 0;
+                            if ((p | 0) >= (s | 0)) break;
+                            A = +g[(G + (o << 2)) >> 2];
+                            F = (C + ((p + r) << 3)) | 0;
+                            h[F >> 3] = +h[F >> 3] - A;
+                            q = q + A;
+                            p = (p + 1) | 0;
+                          }
+                          F = (C + (r << 3)) | 0;
+                          h[F >> 3] = +h[F >> 3] - q;
+                          r = (r + 1) | 0;
+                        }
+                        while (1) {
+                          if ((p | 0) >= (b | 0)) break;
+                          g[(G + (r << 2)) >> 2] = +h[(C + (p << 3)) >> 3];
+                          F = (o + r) | 0;
+                          o = (o + -1) | 0;
+                          p = (p + 1) | 0;
+                          r = F;
+                        }
+                        k = KK(u) | 0;
+                        c[k >> 2] = KK(w) | 0;
+                        o = 1;
+                        while (1) {
+                          if ((o | 0) >= (i | 0)) break;
+                          c[(k + (o << 2)) >> 2] = (c[k >> 2] | 0) + ((O(o, b) | 0) << 2);
+                          o = (o + 1) | 0;
+                        }
+                        z = KK(x) | 0;
+                        f = KK(x) | 0;
+                        j = KK(E << 2) | 0;
+                        p = Eu(G, b) | 0;
+                        d = Ju(G, b, c[J >> 2] | 0, c[K >> 2] | 0, c[H >> 2] | 0) | 0;
+                        y = (k + 4) | 0;
+                        r = 0;
+                        A = 1797693134862315708145274.0e284;
+                        o = 0;
+                        while (1) {
+                          if (!(((r << 24) >> 24 == 0) & ((o | 0) < (m | 0)))) break;
+                          _t(b, 0.0, C);
+                          du(E, G, j);
+                          w = 0;
+                          t = 0;
+                          while (1) {
+                            if ((w | 0) >= (a | 0)) {
+                              r = 0;
+                              s = b;
+                              t = 0;
+                              break;
+                            }
+                            x = (b - w + -1) | 0;
+                            $t(b, 0.0, f);
+                            r = 0;
+                            while (1) {
+                              if ((r | 0) >= (i | 0)) break;
+                              H = (D + (r << 2)) | 0;
+                              $t(x, +g[((c[H >> 2] | 0) + (w << 2)) >> 2], z);
+                              Wt(x, z, -1.0, ((c[H >> 2] | 0) + (w << 2) + 4) | 0);
+                              bu(x, z);
+                              Vt(x, z, f, f);
+                              r = (r + 1) | 0;
+                            }
+                            eu(x, f);
+                            r = 0;
+                            while (1) {
+                              if ((r | 0) >= (x | 0)) break;
+                              s = (f + (r << 2)) | 0;
+                              q = +g[s >> 2];
+                              if ((q >= 3402823466385288598117041.0e14) | (q < 0.0)) g[s >> 2] = 0.0;
+                              r = (r + 1) | 0;
+                            }
+                            u = (w + 1) | 0;
+                            q = 0.0;
+                            r = t;
+                            s = 0;
+                            while (1) {
+                              r = (r + 1) | 0;
+                              if ((s | 0) >= (x | 0)) break;
+                              H = (j + (r << 2)) | 0;
+                              N = +g[H >> 2] * +g[(f + (s << 2)) >> 2];
+                              g[H >> 2] = N;
+                              H = (C + ((u + s) << 3)) | 0;
+                              h[H >> 3] = +h[H >> 3] - N;
+                              q = q + N;
+                              s = (s + 1) | 0;
+                            }
+                            t = (C + (w << 3)) | 0;
+                            h[t >> 3] = +h[t >> 3] - q;
+                            w = u;
+                            t = r;
+                          }
+                          while (1) {
+                            if ((r | 0) >= (b | 0)) {
+                              r = 0;
+                              break;
+                            }
+                            g[(j + (t << 2)) >> 2] = +h[(C + (r << 3)) >> 3];
+                            H = (s + t) | 0;
+                            r = (r + 1) | 0;
+                            s = (s + -1) | 0;
+                            t = H;
+                          }
+                          while (1) {
+                            if ((r | 0) >= (i | 0)) {
+                              q = 0.0;
+                              r = 0;
+                              break;
+                            }
+                            Tt(j, b, c[(D + (r << 2)) >> 2] | 0, c[(k + (r << 2)) >> 2] | 0);
+                            r = (r + 1) | 0;
+                          }
+                          while (1) {
+                            if ((r | 0) >= (i | 0)) break;
+                            q = +Zt(b, c[(D + (r << 2)) >> 2] | 0, c[(k + (r << 2)) >> 2] | 0) + q;
+                            r = (r + 1) | 0;
+                          }
+                          q = q * 2.0 + v;
+                          r = 0;
+                          while (1) {
+                            if ((r | 0) >= (i | 0)) break;
+                            H = (D + (r << 2)) | 0;
+                            Tt(G, b, c[H >> 2] | 0, z);
+                            q = q - +Zt(b, c[H >> 2] | 0, z);
+                            r = (r + 1) | 0;
+                          }
+                          N = +B(+(q - A)) / +B(+(A + 1.0e-10));
+                          r = ((((o | 0) > 1) & (q > A)) | (N < +h[23294])) & 1;
+                          s = 0;
+                          while (1) {
+                            if ((s | 0) >= (i | 0)) break;
+                            if ((s | 0) != 1) {
+                              if (Ar(G, c[(D + (s << 2)) >> 2] | 0, c[(k + (s << 2)) >> 2] | 0, b, 0.001, b) | 0) {
+                                o = -1;
+                                break d;
+                              }
+                            } else Fu(d, c[y >> 2] | 0, D, i, 1, 15, I, n) | 0;
+                            s = (s + 1) | 0;
+                          }
+                          A = q;
+                          o = (o + 1) | 0;
+                        }
+                        U1(I);
+                        Iu(d);
+                        if (D | 0) {
+                          r = 0;
+                          while (1) {
+                            if ((r | 0) >= (i | 0)) break;
+                            t = (D + (r << 2)) | 0;
+                            u = (e + (r << 2)) | 0;
+                            s = 0;
+                            while (1) {
+                              if ((s | 0) >= (b | 0)) break;
+                              h[((c[u >> 2] | 0) + (s << 3)) >> 3] = +g[((c[t >> 2] | 0) + (s << 2)) >> 2];
+                              s = (s + 1) | 0;
+                            }
+                            r = (r + 1) | 0;
+                          }
+                          U1(c[D >> 2] | 0);
+                          U1(D);
+                        }
+                        if (k | 0) {
+                          U1(c[k >> 2] | 0);
+                          U1(k);
+                        }
+                        U1(z);
+                        U1(f);
+                        U1(C);
+                        U1(G);
+                        U1(j);
+                      }
+                    while (0);
+                    U1(c[J >> 2] | 0);
+                    U1(c[K >> 2] | 0);
+                    if (p) {
+                      U1(c[p >> 2] | 0);
+                      U1(p);
+                    }
+                  } else L = 10;
+                } else L = 10;
+              while (0);
+              if ((L | 0) == 10) o = on(a, b, d, e, f, i, j, k, m) | 0;
+              l = M;
+              return o | 0;
+            }
+            function Cr(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              m = l;
+              l = (l + 48) | 0;
+              f = (m + 24) | 0;
+              g = (m + 12) | 0;
+              d = m;
+              i = tB(a) | 0;
+              k = KK((i * 48) | 0) | 0;
+              lr(d, a);
+              c[g >> 2] = c[d >> 2];
+              c[(g + 4) >> 2] = c[(d + 4) >> 2];
+              c[(g + 8) >> 2] = c[(d + 8) >> 2];
+              d = jC(a) | 0;
+              e = k;
+              while (1) {
+                if (!d) break;
+                c[f >> 2] = c[g >> 2];
+                c[(f + 4) >> 2] = c[(g + 4) >> 2];
+                c[(f + 8) >> 2] = c[(g + 8) >> 2];
+                Dr(d, e, f);
+                d = kC(a, d) | 0;
+                e = (e + 48) | 0;
+              }
+              a: do
+                if (!(Er(k, i) | 0)) d = 0;
+                else {
+                  switch (b | 0) {
+                    case 9: {
+                      Gr(a, k, i, 70, 1);
+                      Ir(a, k, i, 71, 1);
+                      d = 0;
+                      e = k;
+                      break;
+                    }
+                    case 10: {
+                      Ir(a, k, i, 71, 1);
+                      Gr(a, k, i, 70, 1);
+                      d = 0;
+                      e = k;
+                      break;
+                    }
+                    case 7: {
+                      Gr(a, k, i, 72, 1);
+                      Ir(a, k, i, 71, 1);
+                      j = 9;
+                      break;
+                    }
+                    case 8: {
+                      j = 9;
+                      break;
+                    }
+                    case 13: {
+                      j = 10;
+                      break;
+                    }
+                    case 14: {
+                      Ir(a, k, i, 71, 0);
+                      Gr(a, k, i, 70, 0);
+                      d = 0;
+                      e = k;
+                      break;
+                    }
+                    case 12: {
+                      Ir(a, k, i, 73, 0);
+                      Gr(a, k, i, 70, 0);
+                      d = 0;
+                      e = k;
+                      break;
+                    }
+                    default: {
+                      Gr(a, k, i, 72, 0);
+                      Ir(a, k, i, 71, 0);
+                      d = 0;
+                      e = k;
+                    }
+                  }
+                  if ((j | 0) == 9) {
+                    Ir(a, k, i, 73, 1);
+                    Gr(a, k, i, 70, 1);
+                    j = 10;
+                  }
+                  if ((j | 0) == 10) {
+                    Gr(a, k, i, 70, 0);
+                    Ir(a, k, i, 71, 0);
+                    d = 0;
+                    e = k;
+                  }
+                  while (1) {
+                    if ((d | 0) >= (i | 0)) {
+                      d = 1;
+                      break a;
+                    }
+                    g = c[(e + 16) >> 2] | 0;
+                    j = c[((c[((c[(e + 20) >> 2] | 0) + 16) >> 2] | 0) + 132) >> 2] | 0;
+                    h[j >> 3] = +(c[(e + 12) >> 2] | 0) * 1.3888888888888887e-3;
+                    h[(j + 8) >> 3] = +(g | 0) * 1.3888888888888887e-3;
+                    d = (d + 1) | 0;
+                    e = (e + 48) | 0;
+                  }
+                }
+              while (0);
+              U1(k);
+              l = m;
+              return d | 0;
+            }
+            function Dr(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0.0,
+                m = 0.0;
+              f = c[(b + 16) >> 2] | 0;
+              k = c[(f + 132) >> 2] | 0;
+              l = +h[k >> 3] * 720.0;
+              j = ~~(l + (l >= 0.0 ? 0.5 : -0.5));
+              l = +h[(k + 8) >> 3] * 720.0;
+              k = ~~(l + (l >= 0.0 ? 0.5 : -0.5));
+              if (!(a[(e + 8) >> 0] | 0)) {
+                m = +h[(f + 32) >> 3] * 72.0 * (+g[e >> 2] * 5.0);
+                l = +h[(f + 40) >> 3] * 72.0 * (+g[(e + 4) >> 2] * 5.0);
+                i = ~~(m + (m >= 0.0 ? 0.5 : -0.5));
+                f = ~~(l + (l >= 0.0 ? 0.5 : -0.5));
+              } else {
+                l = +h[(f + 32) >> 3] * 36.0;
+                m = +h[(f + 40) >> 3] * 36.0;
+                i = ~~((+g[e >> 2] + +(~~(l + (l >= 0.0 ? 0.5 : -0.5)) | 0)) * 10.0);
+                f = ~~((+g[(e + 4) >> 2] + +(~~(m + (m >= 0.0 ? 0.5 : -0.5)) | 0)) * 10.0);
+              }
+              c[(d + 12) >> 2] = j;
+              c[(d + 16) >> 2] = k;
+              c[(d + 20) >> 2] = b;
+              c[(d + 32) >> 2] = j - i;
+              c[(d + 36) >> 2] = k - f;
+              c[(d + 40) >> 2] = i + j;
+              c[(d + 44) >> 2] = f + k;
+              return;
+            }
+            function Er(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = (b + -1) | 0;
+              d = 0;
+              a: while (1) {
+                if ((d | 0) >= (k | 0)) {
+                  a = 0;
+                  break;
+                }
+                j = (a + 48) | 0;
+                d = (d + 1) | 0;
+                g = (a + 32) | 0;
+                h = (a + 40) | 0;
+                i = (a + 36) | 0;
+                f = (a + 44) | 0;
+                a = j;
+                e = d;
+                while (1) {
+                  if ((e | 0) >= (b | 0)) {
+                    a = j;
+                    continue a;
+                  }
+                  if (
+                    (
+                      ((c[g >> 2] | 0) <= (c[(a + 40) >> 2] | 0) ? (c[(a + 32) >> 2] | 0) <= (c[h >> 2] | 0) : 0)
+                        ? (c[i >> 2] | 0) <= (c[(a + 44) >> 2] | 0)
+                        : 0
+                    )
+                      ? (c[(a + 36) >> 2] | 0) <= (c[f >> 2] | 0)
+                      : 0
+                  ) {
+                    a = 1;
+                    break a;
+                  }
+                  a = (a + 48) | 0;
+                  e = (e + 1) | 0;
+                }
+              }
+              return a | 0;
+            }
+            function Fr(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if ((c[(a + 36) >> 2] | 0) > (c[(b + 44) >> 2] | 0)) a = 0;
+              else a = ((c[(b + 36) >> 2] | 0) <= (c[(a + 44) >> 2] | 0)) & 1;
+              return a | 0;
+            }
+            function Gr(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0;
+              i = Vz(18168, c[4584] | 0) | 0;
+              g = b;
+              h = 0;
+              while (1) {
+                if ((h | 0) >= (d | 0)) break;
+                c[(g + 8) >> 2] = c[(g + 12) >> 2];
+                nb[c[i >> 2] & 63](i, g, 1) | 0;
+                g = (g + 48) | 0;
+                h = (h + 1) | 0;
+              }
+              if (!f) h = Or(a, i, e, 74) | 0;
+              else h = Nr(i, e, 74) | 0;
+              uL(h, 2, 2147483647) | 0;
+              g = 0;
+              while (1) {
+                if ((g | 0) >= (d | 0)) break;
+                f = (b + 12) | 0;
+                a = c[((c[((c[(b + 24) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0;
+                e = (a - (c[f >> 2] | 0)) | 0;
+                c[f >> 2] = a;
+                f = (b + 32) | 0;
+                c[f >> 2] = (c[f >> 2] | 0) + e;
+                f = (b + 40) | 0;
+                c[f >> 2] = (c[f >> 2] | 0) + e;
+                b = (b + 48) | 0;
+                g = (g + 1) | 0;
+              }
+              Pr(h);
+              Rz(i) | 0;
+              return;
+            }
+            function Hr(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if ((c[(a + 32) >> 2] | 0) > (c[(b + 40) >> 2] | 0)) a = 0;
+              else a = ((c[(b + 32) >> 2] | 0) <= (c[(a + 40) >> 2] | 0)) & 1;
+              return a | 0;
+            }
+            function Ir(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0;
+              i = Vz(18168, c[4584] | 0) | 0;
+              g = b;
+              h = 0;
+              while (1) {
+                if ((h | 0) >= (d | 0)) break;
+                c[(g + 8) >> 2] = c[(g + 16) >> 2];
+                nb[c[i >> 2] & 63](i, g, 1) | 0;
+                g = (g + 48) | 0;
+                h = (h + 1) | 0;
+              }
+              if (!f) h = Or(a, i, e, 75) | 0;
+              else h = Nr(i, e, 75) | 0;
+              uL(h, 2, 2147483647) | 0;
+              g = 0;
+              while (1) {
+                if ((g | 0) >= (d | 0)) break;
+                f = (b + 16) | 0;
+                a = c[((c[((c[(b + 24) >> 2] | 0) + 16) >> 2] | 0) + 232) >> 2] | 0;
+                e = (a - (c[f >> 2] | 0)) | 0;
+                c[f >> 2] = a;
+                f = (b + 36) | 0;
+                c[f >> 2] = (c[f >> 2] | 0) + e;
+                f = (b + 44) | 0;
+                c[f >> 2] = (c[f >> 2] | 0) + e;
+                b = (b + 48) | 0;
+                g = (g + 1) | 0;
+              }
+              Pr(h);
+              Rz(i) | 0;
+              return;
+            }
+            function Jr(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              d = (a + 32) | 0;
+              e = (b + 32) | 0;
+              if (
+                (c[(a + 36) >> 2] | 0) <= (c[(b + 44) >> 2] | 0) ? (c[(b + 36) >> 2] | 0) <= (c[(a + 44) >> 2] | 0) : 0
+              )
+                if ((c[(a + 40) >> 2] | 0) < (c[e >> 2] | 0)) a = 1;
+                else {
+                  g = Mr(d, e) | 0;
+                  g = (g - (c[(b + 12) >> 2] | 0) + (c[(a + 12) >> 2] | 0)) | 0;
+                  b = c[(b + 16) >> 2] | 0;
+                  a = c[(a + 16) >> 2] | 0;
+                  f = (b | 0) < (a | 0);
+                  e = Lr(d, e) | 0;
+                  a = ((g | 0) <= ((e - (f ? a : b) + (f ? b : a)) | 0)) & 1;
+                }
+              else a = 0;
+              return a | 0;
+            }
+            function Kr(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              d = (a + 32) | 0;
+              e = (b + 32) | 0;
+              if ((c[d >> 2] | 0) <= (c[(b + 40) >> 2] | 0) ? (c[e >> 2] | 0) <= (c[(a + 40) >> 2] | 0) : 0)
+                if ((c[(a + 44) >> 2] | 0) < (c[(b + 36) >> 2] | 0)) a = 1;
+                else {
+                  g = Lr(d, e) | 0;
+                  g = (g - (c[(b + 16) >> 2] | 0) + (c[(a + 16) >> 2] | 0)) | 0;
+                  b = c[(b + 12) >> 2] | 0;
+                  a = c[(a + 12) >> 2] | 0;
+                  f = (b | 0) < (a | 0);
+                  e = Mr(d, e) | 0;
+                  a = ((g | 0) <= ((e - (f ? a : b) + (f ? b : a)) | 0)) & 1;
+                }
+              else a = 0;
+              return a | 0;
+            }
+            function Lr(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return (
+                ((((c[(a + 12) >> 2] | 0) - (c[(a + 4) >> 2] | 0) + (c[(b + 12) >> 2] | 0) - (c[(b + 4) >> 2] | 0)) |
+                  0) /
+                  2) |
+                0 |
+                0
+              );
+            }
+            function Mr(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return (
+                ((((c[(a + 8) >> 2] | 0) - (c[a >> 2] | 0) + (c[(b + 8) >> 2] | 0) - (c[b >> 2] | 0)) | 0) / 2) | 0 | 0
+              );
+            }
+            function Nr(d, e, f) {
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0;
+              x = l;
+              l = (l + 16) | 0;
+              v = x;
+              a[v >> 0] = a[18588] | 0;
+              a[(v + 1) >> 0] = a[18589] | 0;
+              a[(v + 2) >> 0] = a[18590] | 0;
+              a[(v + 3) >> 0] = a[18591] | 0;
+              w = oB(93515, v, 0) | 0;
+              TC(w, 137483, 280, 1) | 0;
+              g = Tz(d) | 0;
+              h = -2147483647;
+              u = 0;
+              while (1) {
+                if (!g) break;
+                s = c[(g + 8) >> 2] | 0;
+                t = (u + (((h | 0) != (s | 0)) & 1)) | 0;
+                g = c[g >> 2] | 0;
+                h = s;
+                u = t;
+              }
+              s = (w + 16) | 0;
+              t = ((u << 3) + -4) | 0;
+              n = 0;
+              j = 0;
+              g = 0;
+              h = 0;
+              m = 0;
+              r = Tz(d) | 0;
+              i = -2147483647;
+              while (1) {
+                if (!r) break;
+                q = c[(r + 8) >> 2] | 0;
+                if ((i | 0) != (q | 0)) {
+                  p = tC(w, KB(c[(r + 20) >> 2] | 0) | 0, 1) | 0;
+                  TC(p, 137447, 304, 1) | 0;
+                  o = (p + 16) | 0;
+                  g = c[o >> 2] | 0;
+                  c[(g + 112) >> 2] = r;
+                  if (!h) {
+                    c[((c[s >> 2] | 0) + 192) >> 2] = p;
+                    n = p;
+                  } else {
+                    c[((c[(n + 16) >> 2] | 0) + 164) >> 2] = p;
+                    n = h;
+                  }
+                  c[(g + 176) >> 2] = 0;
+                  k = (j + 1) | 0;
+                  i = JK(k << 2) | 0;
+                  c[((c[o >> 2] | 0) + 172) >> 2] = i;
+                  if (!m) {
+                    j = k;
+                    k = p;
+                    m = p;
+                    g = p;
+                    h = n;
+                    i = q;
+                  } else {
+                    i = (m + 16) | 0;
+                    c[((c[i >> 2] | 0) + 184) >> 2] = 0;
+                    j = JK((m | 0) == (n | 0) ? t : (u - j) << 2) | 0;
+                    c[((c[i >> 2] | 0) + 180) >> 2] = j;
+                    j = iB(w, m, p, 0, 1) | 0;
+                    TC(j, 137460, 176, 1) | 0;
+                    g = c[(j + 16) >> 2] | 0;
+                    b[(g + 170) >> 1] = 10;
+                    c[(g + 156) >> 2] = 1;
+                    g = c[i >> 2] | 0;
+                    h = c[(g + 180) >> 2] | 0;
+                    if (!h) g = KK(((c[(g + 184) >> 2] << 2) + 8) | 0) | 0;
+                    else g = MK(h, ((c[(g + 184) >> 2] << 2) + 8) | 0) | 0;
+                    m = c[i >> 2] | 0;
+                    c[(m + 180) >> 2] = g;
+                    m = (m + 184) | 0;
+                    h = c[m >> 2] | 0;
+                    c[m >> 2] = h + 1;
+                    c[(g + (h << 2)) >> 2] = j;
+                    g = c[i >> 2] | 0;
+                    c[((c[(g + 180) >> 2] | 0) + (c[(g + 184) >> 2] << 2)) >> 2] = 0;
+                    g = c[o >> 2] | 0;
+                    h = c[(g + 172) >> 2] | 0;
+                    if (!h) g = KK(((c[(g + 176) >> 2] << 2) + 8) | 0) | 0;
+                    else g = MK(h, ((c[(g + 176) >> 2] << 2) + 8) | 0) | 0;
+                    h = c[o >> 2] | 0;
+                    c[(h + 172) >> 2] = g;
+                    h = (h + 176) | 0;
+                    m = c[h >> 2] | 0;
+                    c[h >> 2] = m + 1;
+                    c[(g + (m << 2)) >> 2] = j;
+                    j = c[o >> 2] | 0;
+                    c[((c[(j + 172) >> 2] | 0) + (c[(j + 176) >> 2] << 2)) >> 2] = 0;
+                    j = k;
+                    k = p;
+                    m = p;
+                    g = p;
+                    h = n;
+                    i = q;
+                  }
+                } else {
+                  k = g;
+                  g = n;
+                }
+                c[(r + 24) >> 2] = k;
+                n = g;
+                g = k;
+                r = c[r >> 2] | 0;
+              }
+              m = (m + 16) | 0;
+              c[((c[m >> 2] | 0) + 184) >> 2] = 0;
+              g = JK(4) | 0;
+              c[((c[m >> 2] | 0) + 180) >> 2] = g;
+              a[v >> 0] = a[18588] | 0;
+              a[(v + 1) >> 0] = a[18589] | 0;
+              a[(v + 2) >> 0] = a[18590] | 0;
+              a[(v + 3) >> 0] = a[18591] | 0;
+              m = oB(93562, v, 0) | 0;
+              g = Tz(d) | 0;
+              while (1) {
+                if (!g) break;
+                v = tC(m, KB(c[(g + 20) >> 2] | 0) | 0, 1) | 0;
+                TC(v, 137447, 304, 1) | 0;
+                c[(g + 28) >> 2] = v;
+                c[((c[(v + 16) >> 2] | 0) + 112) >> 2] = g;
+                g = c[g >> 2] | 0;
+              }
+              g = 0;
+              k = Tz(d) | 0;
+              h = -2147483647;
+              a: while (1) {
+                if (!k) break;
+                j = c[(k + 8) >> 2] | 0;
+                b: do
+                  if ((h | 0) == (j | 0)) j = h;
+                  else {
+                    g = k;
+                    while (1) {
+                      g = c[g >> 2] | 0;
+                      if (!g) break a;
+                      if ((c[(g + 8) >> 2] | 0) != (j | 0)) break b;
+                    }
+                  }
+                while (0);
+                i = (k + 28) | 0;
+                h = g;
+                while (1) {
+                  if (!h) break;
+                  if (lb[e & 127](k, h) | 0) iB(m, c[i >> 2] | 0, c[(h + 28) >> 2] | 0, 0, 1) | 0;
+                  h = c[h >> 2] | 0;
+                }
+                k = c[k >> 2] | 0;
+                h = j;
+              }
+              Qr(m, w, f);
+              sB(m) | 0;
+              l = x;
+              return w | 0;
+            }
+            function Or(d, e, f, g) {
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0;
+              s = l;
+              l = (l + 16) | 0;
+              r = s;
+              a[r >> 0] = a[18588] | 0;
+              a[(r + 1) >> 0] = a[18589] | 0;
+              a[(r + 2) >> 0] = a[18590] | 0;
+              a[(r + 3) >> 0] = a[18591] | 0;
+              r = oB(93515, r, 0) | 0;
+              TC(r, 137483, 280, 1) | 0;
+              k = (r + 16) | 0;
+              h = Tz(e) | 0;
+              i = 0;
+              while (1) {
+                if (!h) break;
+                j = tC(r, KB(c[(h + 20) >> 2] | 0) | 0, 1) | 0;
+                TC(j, 137447, 304, 1) | 0;
+                p = (j + 16) | 0;
+                n = c[p >> 2] | 0;
+                c[(n + 112) >> 2] = h;
+                c[(h + 24) >> 2] = j;
+                c[(n + 176) >> 2] = 0;
+                n = JK(4) | 0;
+                o = c[p >> 2] | 0;
+                c[(o + 172) >> 2] = n;
+                c[(o + 184) >> 2] = 0;
+                o = JK(4) | 0;
+                c[((c[p >> 2] | 0) + 180) >> 2] = o;
+                if (!i) c[((c[k >> 2] | 0) + 192) >> 2] = j;
+                else c[((c[(i + 16) >> 2] | 0) + 164) >> 2] = j;
+                h = c[h >> 2] | 0;
+                i = j;
+              }
+              m = Tz(e) | 0;
+              a: while (1) {
+                if (!m) break;
+                n = (m + 32) | 0;
+                o = (m + 24) | 0;
+                p = (m + 20) | 0;
+                h = m;
+                while (1) {
+                  h = c[h >> 2] | 0;
+                  if (!h) break;
+                  if (lb[f & 127](m, h) | 0) {
+                    i = lb[g & 127](n, (h + 32) | 0) | 0;
+                    j = iB(r, c[o >> 2] | 0, c[(h + 24) >> 2] | 0, 0, 1) | 0;
+                    TC(j, 137460, 176, 1) | 0;
+                    if ((i | 0) >= 65536) {
+                      q = 13;
+                      break a;
+                    }
+                    k = (j + 16) | 0;
+                    t = c[k >> 2] | 0;
+                    b[(t + 170) >> 1] = i;
+                    c[(t + 156) >> 2] = 1;
+                    if (j | 0 ? iB(d, c[p >> 2] | 0, c[(h + 20) >> 2] | 0, 0, 0) | 0 : 0)
+                      c[((c[k >> 2] | 0) + 156) >> 2] = 100;
+                  }
+                }
+                m = c[m >> 2] | 0;
+              }
+              if ((q | 0) == 13) qa(93518, 93534, 254, 93547);
+              m = Tz(e) | 0;
+              while (1) {
+                if (!m) break;
+                k = c[(m + 24) >> 2] | 0;
+                n = (k + 16) | 0;
+                k = XA(r, k) | 0;
+                while (1) {
+                  if (!k) break;
+                  h = c[n >> 2] | 0;
+                  i = c[(h + 180) >> 2] | 0;
+                  if (!i) h = KK(((c[(h + 184) >> 2] << 2) + 8) | 0) | 0;
+                  else h = MK(i, ((c[(h + 184) >> 2] << 2) + 8) | 0) | 0;
+                  i = c[n >> 2] | 0;
+                  c[(i + 180) >> 2] = h;
+                  i = (i + 184) | 0;
+                  j = c[i >> 2] | 0;
+                  c[i >> 2] = j + 1;
+                  c[(h + (j << 2)) >> 2] = k;
+                  j = c[n >> 2] | 0;
+                  c[((c[(j + 180) >> 2] | 0) + (c[(j + 184) >> 2] << 2)) >> 2] = 0;
+                  j = (k + -48) | 0;
+                  h = c[((c[((((c[k >> 2] & 3) | 0) == 2 ? k : j) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                  i = c[(h + 172) >> 2] | 0;
+                  if (!i) h = KK(((c[(h + 176) >> 2] << 2) + 8) | 0) | 0;
+                  else h = MK(i, ((c[(h + 176) >> 2] << 2) + 8) | 0) | 0;
+                  c[((c[((c[((((c[k >> 2] & 3) | 0) == 2 ? k : j) + 40) >> 2] | 0) + 16) >> 2] | 0) + 172) >> 2] = h;
+                  g = c[((c[((((c[k >> 2] & 3) | 0) == 2 ? k : j) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                  q = c[(g + 172) >> 2] | 0;
+                  g = (g + 176) | 0;
+                  t = c[g >> 2] | 0;
+                  c[g >> 2] = t + 1;
+                  c[(q + (t << 2)) >> 2] = k;
+                  t = c[((c[((((c[k >> 2] & 3) | 0) == 2 ? k : j) + 40) >> 2] | 0) + 16) >> 2] | 0;
+                  c[((c[(t + 172) >> 2] | 0) + (c[(t + 176) >> 2] << 2)) >> 2] = 0;
+                  k = ZA(r, k) | 0;
+                }
+                m = c[m >> 2] | 0;
+              }
+              l = s;
+              return r | 0;
+            }
+            function Pr(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              f = jC(a) | 0;
+              while (1) {
+                if (!f) break;
+                d = (f + 16) | 0;
+                b = c[d >> 2] | 0;
+                e = c[(b + 172) >> 2] | 0;
+                if (e) {
+                  U1(e);
+                  b = c[d >> 2] | 0;
+                }
+                b = c[(b + 180) >> 2] | 0;
+                if (b | 0) U1(b);
+                f = kC(a, f) | 0;
+              }
+              sB(a) | 0;
+              return;
+            }
+            function Qr(a, d, e) {
+              a = a | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              k = jC(a) | 0;
+              while (1) {
+                if (!k) break;
+                n = c[((c[(k + 16) >> 2] | 0) + 112) >> 2] | 0;
+                m = c[(n + 24) >> 2] | 0;
+                n = (n + 32) | 0;
+                o = (m + 16) | 0;
+                l = XA(a, k) | 0;
+                while (1) {
+                  if (!l) break;
+                  h =
+                    c[
+                      ((c[((c[((((c[l >> 2] & 3) | 0) == 2 ? l : (l + -48) | 0) + 40) >> 2] | 0) + 16) >> 2] | 0) +
+                        112) >>
+                        2
+                    ] | 0;
+                  p = lb[e & 127](n, (h + 32) | 0) | 0;
+                  h = c[(h + 24) >> 2] | 0;
+                  i = iB(d, m, h, 0, 1) | 0;
+                  TC(i, 137460, 176, 1) | 0;
+                  j = (i + 16) | 0;
+                  f = c[j >> 2] | 0;
+                  c[(f + 156) >> 2] = 1;
+                  g = b[(f + 170) >> 1] | 0;
+                  if ((p | 0) > ((g & 65535) | 0)) {
+                    if (!((g << 16) >> 16)) {
+                      f = c[o >> 2] | 0;
+                      g = c[(f + 180) >> 2] | 0;
+                      if (!g) f = KK(((c[(f + 184) >> 2] << 2) + 8) | 0) | 0;
+                      else f = MK(g, ((c[(f + 184) >> 2] << 2) + 8) | 0) | 0;
+                      q = c[o >> 2] | 0;
+                      c[(q + 180) >> 2] = f;
+                      q = (q + 184) | 0;
+                      g = c[q >> 2] | 0;
+                      c[q >> 2] = g + 1;
+                      c[(f + (g << 2)) >> 2] = i;
+                      f = c[o >> 2] | 0;
+                      c[((c[(f + 180) >> 2] | 0) + (c[(f + 184) >> 2] << 2)) >> 2] = 0;
+                      h = (h + 16) | 0;
+                      f = c[h >> 2] | 0;
+                      g = c[(f + 172) >> 2] | 0;
+                      if (!g) f = KK(((c[(f + 176) >> 2] << 2) + 8) | 0) | 0;
+                      else f = MK(g, ((c[(f + 176) >> 2] << 2) + 8) | 0) | 0;
+                      g = c[h >> 2] | 0;
+                      c[(g + 172) >> 2] = f;
+                      g = (g + 176) | 0;
+                      q = c[g >> 2] | 0;
+                      c[g >> 2] = q + 1;
+                      c[(f + (q << 2)) >> 2] = i;
+                      f = c[h >> 2] | 0;
+                      c[((c[(f + 172) >> 2] | 0) + (c[(f + 176) >> 2] << 2)) >> 2] = 0;
+                      f = c[j >> 2] | 0;
+                    }
+                    b[(f + 170) >> 1] = p;
+                  }
+                  l = ZA(a, l) | 0;
+                }
+                k = kC(a, k) | 0;
+              }
+              return;
+            }
+            function Rr(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              return ((c[b >> 2] | 0) - (c[d >> 2] | 0)) | 0;
+            }
+            function Sr(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0.0,
+                A = 0.0;
+              y = l;
+              l = (l + 64) | 0;
+              u = (y + 24) | 0;
+              s = (y + 16) | 0;
+              r = (y + 52) | 0;
+              q = (y + 40) | 0;
+              t = y;
+              w = tB(b) | 0;
+              x = KK((w * 72) | 0) | 0;
+              lr(q, b);
+              k = +g[q >> 2];
+              m = +g[(q + 4) >> 2];
+              q = (a[(q + 8) >> 0] | 0) != 0;
+              k = q ? k * 0.013888888888888888 : k;
+              m = q ? m * 0.013888888888888888 : m;
+              n = k * 0.5;
+              o = m * 0.5;
+              e = x;
+              f = jC(b) | 0;
+              while (1) {
+                if (!f) break;
+                p = c[(f + 16) >> 2] | 0;
+                i = +h[(p + 32) >> 3];
+                if (q) {
+                  j = +h[(p + 40) >> 3] * 0.5 + m;
+                  i = i * 0.5 + k;
+                } else {
+                  j = o * +h[(p + 40) >> 3];
+                  i = n * i;
+                }
+                p = c[(p + 132) >> 2] | 0;
+                A = +h[p >> 3];
+                h[e >> 3] = A;
+                z = +h[(p + 8) >> 3];
+                h[(e + 8) >> 3] = z;
+                h[(e + 16) >> 3] = A - i;
+                h[(e + 24) >> 3] = z - j;
+                h[(e + 32) >> 3] = A + i;
+                h[(e + 40) >> 3] = z + j;
+                h[(e + 48) >> 3] = i;
+                h[(e + 56) >> 3] = j;
+                c[(e + 64) >> 2] = f;
+                e = (e + 72) | 0;
+                f = kC(b, f) | 0;
+              }
+              do
+                if ((d | 0) < 0) {
+                  i = +Tr(x, w);
+                  if (i == 0.0) {
+                    U1(x);
+                    e = 0;
+                    break;
+                  }
+                  if (!0) {
+                    k = i;
+                    j = i;
+                    v = 19;
+                  } else {
+                    v = c[15712] | 0;
+                    h[s >> 3] = i;
+                    w4(v, 93565, s) | 0;
+                    k = i;
+                    j = i;
+                    v = 19;
+                  }
+                } else {
+                  f = Ur(x, w, r) | 0;
+                  e = c[r >> 2] | 0;
+                  if (!e) {
+                    U1(f);
+                    U1(x);
+                    e = 0;
+                    break;
+                  }
+                  if (!d) {
+                    Wr(t, f, e);
+                    i = +h[t >> 3];
+                    j = +h[(t + 8) >> 3];
+                  } else {
+                    j = +Vr(f, e);
+                    i = j;
+                  }
+                  U1(f);
+                  if (!0) {
+                    k = i;
+                    v = 19;
+                  } else {
+                    v = c[15712] | 0;
+                    h[u >> 3] = i;
+                    h[(u + 8) >> 3] = j;
+                    w4(v, 93579, u) | 0;
+                    k = i;
+                    v = 19;
+                  }
+                }
+              while (0);
+              if ((v | 0) == 19) {
+                e = 0;
+                f = x;
+                while (1) {
+                  if ((e | 0) >= (w | 0)) break;
+                  v = c[((c[((c[(f + 64) >> 2] | 0) + 16) >> 2] | 0) + 132) >> 2] | 0;
+                  h[v >> 3] = +h[f >> 3] * k;
+                  h[(v + 8) >> 3] = +h[(f + 8) >> 3] * j;
+                  e = (e + 1) | 0;
+                  f = (f + 72) | 0;
+                }
+                U1(x);
+                e = 1;
+              }
+              l = y;
+              return e | 0;
+            }
+            function Tr(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0,
+                d = 0,
+                e = 0.0,
+                f = 0.0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0;
+              c = 0.0;
+              d = 0;
+              a: while (1) {
+                if ((d | 0) >= (b | 0)) break;
+                r = (a + 72) | 0;
+                d = (d + 1) | 0;
+                m = (a + 16) | 0;
+                n = (a + 8) | 0;
+                o = (a + 56) | 0;
+                p = (a + 48) | 0;
+                q = (a + 32) | 0;
+                k = (a + 24) | 0;
+                l = (a + 40) | 0;
+                i = d;
+                j = r;
+                while (1) {
+                  if ((i | 0) >= (b | 0)) {
+                    a = r;
+                    continue a;
+                  }
+                  if (
+                    (
+                      (+h[m >> 3] <= +h[(j + 32) >> 3] ? +h[(j + 16) >> 3] <= +h[q >> 3] : 0)
+                        ? +h[k >> 3] <= +h[(j + 40) >> 3]
+                        : 0
+                    )
+                      ? +h[(j + 24) >> 3] <= +h[l >> 3]
+                      : 0
+                  ) {
+                    c = 0.0;
+                    break a;
+                  }
+                  e = +h[a >> 3];
+                  f = +h[j >> 3];
+                  if (e == f) g = t;
+                  else {
+                    g = +B(+(e - f));
+                    g = (+h[(j + 48) >> 3] + +h[p >> 3]) / g;
+                  }
+                  e = +h[n >> 3];
+                  f = +h[(j + 8) >> 3];
+                  if (e == f) e = t;
+                  else {
+                    e = +B(+(e - f));
+                    e = (+h[(j + 56) >> 3] + +h[o >> 3]) / e;
+                  }
+                  g = e < g ? e : g;
+                  i = (i + 1) | 0;
+                  j = (j + 72) | 0;
+                  c = g > c ? g : c;
+                }
+              }
+              return +c;
+            }
+            function Ur(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                g = 0.0,
+                i = 0,
+                j = 0.0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0;
+              k = KK(((b << 4) + 16) | 0) | 0;
+              m = 0;
+              e = 0;
+              n = k;
+              o = b;
+              i = k;
+              a: while (1) {
+                if ((e | 0) >= (b | 0)) break;
+                z = (a + 72) | 0;
+                e = (e + 1) | 0;
+                y = (a + 16) | 0;
+                r = (a + 32) | 0;
+                s = (a + 24) | 0;
+                u = (a + 40) | 0;
+                v = (a + 8) | 0;
+                w = (a + 56) | 0;
+                x = (a + 48) | 0;
+                p = e;
+                q = z;
+                l = i;
+                while (1) {
+                  if ((p | 0) == (b | 0)) {
+                    a = z;
+                    i = l;
+                    continue a;
+                  }
+                  if (
+                    (
+                      (+h[y >> 3] <= +h[(q + 32) >> 3] ? +h[(q + 16) >> 3] <= +h[r >> 3] : 0)
+                        ? +h[s >> 3] <= +h[(q + 40) >> 3]
+                        : 0
+                    )
+                      ? +h[(q + 24) >> 3] <= +h[u >> 3]
+                      : 0
+                  ) {
+                    i = (o + b) | 0;
+                    if ((m | 0) == (o | 0)) {
+                      k = MK(k, ((i << 4) + 16) | 0) | 0;
+                      n = k;
+                      l = k;
+                    } else i = o;
+                    f = +h[a >> 3];
+                    g = +h[q >> 3];
+                    if (!(f == g)) {
+                      f = (+h[(q + 48) >> 3] + +h[x >> 3]) / +B(+(f - g));
+                      if (f < 1.0) {
+                        f = 1.0;
+                        A = 13;
+                      }
+                    } else {
+                      f = t;
+                      A = 13;
+                    }
+                    if ((A | 0) == 13) A = 0;
+                    g = +h[v >> 3];
+                    j = +h[(q + 8) >> 3];
+                    if (!(g == j)) {
+                      g = (+h[(q + 56) >> 3] + +h[w >> 3]) / +B(+(g - j));
+                      if (g < 1.0) {
+                        g = 1.0;
+                        A = 16;
+                      }
+                    } else {
+                      g = t;
+                      A = 16;
+                    }
+                    if ((A | 0) == 16) A = 0;
+                    m = (m + 1) | 0;
+                    h[(n + (m << 4)) >> 3] = f;
+                    h[(n + (m << 4) + 8) >> 3] = g;
+                  } else i = o;
+                  p = (p + 1) | 0;
+                  q = (q + 72) | 0;
+                  o = i;
+                }
+              }
+              A = MK(i, ((m << 4) + 16) | 0) | 0;
+              c[d >> 2] = m;
+              return A | 0;
+            }
+            function Vr(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0,
+                d = 0,
+                e = 0.0,
+                f = 0.0,
+                g = 0.0;
+              d = 1;
+              e = 0.0;
+              while (1) {
+                c = (a + 16) | 0;
+                if ((d | 0) > (b | 0)) break;
+                g = +h[c >> 3];
+                f = +h[(a + 24) >> 3];
+                f = g < f ? g : f;
+                d = (d + 1) | 0;
+                e = f > e ? f : e;
+                a = c;
+              }
+              return +e;
+            }
+            function Wr(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0.0;
+              h[b >> 3] = 1.0;
+              h[(b + 8) >> 3] = t;
+              o4((b + 16) | 0, c, 16, 76);
+              g = KK(((c << 4) + 16) | 0) | 0;
+              h[(g + (c << 4)) >> 3] = +h[(b + (c << 4)) >> 3];
+              f = c;
+              d = 1.0;
+              while (1) {
+                h[(g + (f << 4) + 8) >> 3] = d;
+                e = (f + -1) | 0;
+                if ((f | 0) <= 0) {
+                  d = t;
+                  e = 0;
+                  f = 0;
+                  break;
+                }
+                h[(g + (e << 4)) >> 3] = +h[(b + (e << 4)) >> 3];
+                i = +h[((+h[(b + (f << 4) + 8) >> 3] > d ? b : g) + (f << 4) + 8) >> 3];
+                f = e;
+                d = i;
+              }
+              while (1) {
+                if ((f | 0) > (c | 0)) break;
+                i = +h[(g + (f << 4) + 8) >> 3] * +h[(g + (f << 4)) >> 3];
+                b = i < d;
+                d = b ? i : d;
+                e = b ? f : e;
+                f = (f + 1) | 0;
+              }
+              if (d < t) {
+                i = +h[(g + (e << 4) + 8) >> 3];
+                h[a >> 3] = +h[(g + (e << 4)) >> 3];
+                h[(a + 8) >> 3] = i;
+                return;
+              } else qa(93596, 93534, 832, 93616);
+            }
+            function Xr(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0,
+                d = 0.0;
+              c = +h[a >> 3];
+              d = +h[b >> 3];
+              if (!(c < d))
+                if (!(c > d)) {
+                  d = +h[(a + 8) >> 3];
+                  c = +h[(b + 8) >> 3];
+                  if (d < c) a = -1;
+                  else a = (d > c) & 1;
+                } else a = 1;
+              else a = -1;
+              return a | 0;
+            }
+            function Yr(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              d = l;
+              l = (l + 16) | 0;
+              b = d;
+              c[b >> 2] = 93631;
+              gA(1, 93681, b) | 0;
+              l = d;
+              return 0;
+            }
+            function Zr(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              e = l;
+              l = (l + 16) | 0;
+              d = e;
+              c[d >> 2] = 93631;
+              gA(1, 93709, d) | 0;
+              l = e;
+              return 0;
+            }
+            function _r(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0;
+              a: do
+                switch (d | 0) {
+                  case 2: {
+                    e = KK(16) | 0;
+                    f = KK(24) | 0;
+                    c[(f + 8) >> 2] = 0;
+                    c[(f + 4) >> 2] = e;
+                    c[f >> 2] = 2;
+                    c[e >> 2] = 0;
+                    c[(e + 4) >> 2] = 1;
+                    d = (e + 8) | 0;
+                    c[(f + 16) >> 2] = d;
+                    c[(f + 20) >> 2] = 0;
+                    c[(f + 12) >> 2] = 2;
+                    c[d >> 2] = 1;
+                    c[(e + 12) >> 2] = 0;
+                    break;
+                  }
+                  case 1: {
+                    e = KK(4) | 0;
+                    f = KK(12) | 0;
+                    c[(f + 8) >> 2] = 0;
+                    c[(f + 4) >> 2] = e;
+                    c[f >> 2] = 1;
+                    c[e >> 2] = 0;
+                    break;
+                  }
+                  default: {
+                    Yr(0, 0, 0) | 0;
+                    a = (d | 0) > 0;
+                    if (!e) {
+                      if (!a) {
+                        f = 0;
+                        break a;
+                      }
+                      ab();
+                    } else {
+                      if (!a) {
+                        f = 0;
+                        break a;
+                      }
+                      ab();
+                    }
+                  }
+                }
+              while (0);
+              return f | 0;
+            }
+            function $r(a) {
+              a = a | 0;
+              var b = 0;
+              if (a | 0) {
+                b = c[(a + 4) >> 2] | 0;
+                if (b | 0) U1(b);
+                b = c[(a + 8) >> 2] | 0;
+                if (b | 0) U1(b);
+                U1(a);
+              }
+              return;
+            }
+            function as(a) {
+              a = a | 0;
+              var b = 0;
+              if (a | 0) {
+                b = c[(a + 4) >> 2] | 0;
+                if (b | 0) U1(b);
+                b = c[(a + 8) >> 2] | 0;
+                if (b | 0) U1(b);
+                b = c[(a + 16) >> 2] | 0;
+                if (b | 0) U1(b);
+                U1(a);
+              }
+              return;
+            }
+            function bs(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              o = l;
+              l = (l + 16) | 0;
+              n = (o + 8) | 0;
+              m = o;
+              k = W1(c[46849] | 0, d << 2) | 0;
+              c[46849] = k;
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (d | 0)) break;
+                c[(e + (f << 2)) >> 2] = 2147483647;
+                f = (f + 1) | 0;
+              }
+              c[(e + (a << 2)) >> 2] = 0;
+              h = (b + ((a * 20) | 0)) | 0;
+              i = (b + ((a * 20) | 0) + 8) | 0;
+              j = (b + ((a * 20) | 0) + 4) | 0;
+              f = 1;
+              while (1) {
+                if ((f | 0) >= (c[h >> 2] | 0)) break;
+                c[(e + (c[((c[j >> 2] | 0) + (f << 2)) >> 2] << 2)) >> 2] = ~~+g[((c[i >> 2] | 0) + (f << 2)) >> 2];
+                f = (f + 1) | 0;
+              }
+              cs(n, a, k, e, d);
+              i = -2147483639;
+              while (1) {
+                if (!(((ds(n, m, c[46849] | 0, e) | 0) << 24) >> 24)) {
+                  f = 0;
+                  break;
+                }
+                f = c[m >> 2] | 0;
+                a = c[(e + (f << 2)) >> 2] | 0;
+                if ((a | 0) == 2147483647) {
+                  f = 0;
+                  break;
+                }
+                i = (b + ((f * 20) | 0)) | 0;
+                j = (b + ((f * 20) | 0) + 4) | 0;
+                h = (b + ((f * 20) | 0) + 8) | 0;
+                f = 1;
+                while (1) {
+                  if ((f | 0) >= (c[i >> 2] | 0)) break;
+                  es(
+                    n,
+                    c[((c[j >> 2] | 0) + (f << 2)) >> 2] | 0,
+                    (a + ~~+g[((c[h >> 2] | 0) + (f << 2)) >> 2]) | 0,
+                    c[46849] | 0,
+                    e
+                  );
+                  f = (f + 1) | 0;
+                }
+                i = (a + 10) | 0;
+              }
+              while (1) {
+                if ((f | 0) >= (d | 0)) break;
+                h = (e + (f << 2)) | 0;
+                if ((c[h >> 2] | 0) == 2147483647) c[h >> 2] = i;
+                f = (f + 1) | 0;
+              }
+              fs(n);
+              l = o;
+              return;
+            }
+            function cs(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              if ((f | 0) == 1) i = 0;
+              else i = KK(((f << 2) + -4) | 0) | 0;
+              c[a >> 2] = i;
+              j = (f + -1) | 0;
+              c[(a + 4) >> 2] = j;
+              g = 0;
+              h = 0;
+              while (1) {
+                if ((h | 0) >= (f | 0)) break;
+                if ((h | 0) != (b | 0)) {
+                  c[(i + (g << 2)) >> 2] = h;
+                  c[(d + (h << 2)) >> 2] = g;
+                  g = (g + 1) | 0;
+                }
+                h = (h + 1) | 0;
+              }
+              g = ((j | 0) / 2) | 0;
+              while (1) {
+                if ((g | 0) <= -1) break;
+                gs(a, g, d, e);
+                g = (g + -1) | 0;
+              }
+              return;
+            }
+            function ds(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              f = (a + 4) | 0;
+              if (!(c[f >> 2] | 0)) a = 0;
+              else {
+                g = c[a >> 2] | 0;
+                c[b >> 2] = c[g >> 2];
+                b = c[(g + (((c[f >> 2] | 0) + -1) << 2)) >> 2] | 0;
+                c[g >> 2] = b;
+                c[(d + (b << 2)) >> 2] = 0;
+                c[f >> 2] = (c[f >> 2] | 0) + -1;
+                gs(a, 0, d, e);
+                a = 1;
+              }
+              return a | 0;
+            }
+            function es(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              g = (f + (b << 2)) | 0;
+              if ((c[g >> 2] | 0) > (d | 0)) {
+                j = (e + (b << 2)) | 0;
+                i = c[j >> 2] | 0;
+                c[g >> 2] = d;
+                g = c[a >> 2] | 0;
+                a = i;
+                while (1) {
+                  if ((a | 0) <= 0) break;
+                  h = a >>> 1;
+                  i = c[(g + (h << 2)) >> 2] | 0;
+                  if ((c[(f + (i << 2)) >> 2] | 0) <= (d | 0)) break;
+                  c[(g + (a << 2)) >> 2] = i;
+                  c[(e + (i << 2)) >> 2] = a;
+                  a = h;
+                }
+                c[(g + (a << 2)) >> 2] = b;
+                c[j >> 2] = a;
+              }
+              return;
+            }
+            function fs(a) {
+              a = a | 0;
+              a = c[a >> 2] | 0;
+              if (a | 0) U1(a);
+              return;
+            }
+            function gs(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              i = (a + 4) | 0;
+              while (1) {
+                f = b << 1;
+                g = f | 1;
+                h = c[i >> 2] | 0;
+                if (
+                  !((f | 0) < (h | 0)
+                    ? ((j = c[a >> 2] | 0),
+                      (c[(e + (c[(j + (f << 2)) >> 2] << 2)) >> 2] | 0) <
+                        (c[(e + (c[(j + (b << 2)) >> 2] << 2)) >> 2] | 0))
+                    : 0)
+                )
+                  f = b;
+                if ((g | 0) < (h | 0)) {
+                  j = c[a >> 2] | 0;
+                  f =
+                    (c[(e + (c[(j + (g << 2)) >> 2] << 2)) >> 2] | 0) <
+                    (c[(e + (c[(j + (f << 2)) >> 2] << 2)) >> 2] | 0)
+                      ? g
+                      : f;
+                }
+                if ((f | 0) == (b | 0)) break;
+                j = c[a >> 2] | 0;
+                h = (j + (f << 2)) | 0;
+                g = c[h >> 2] | 0;
+                j = (j + (b << 2)) | 0;
+                c[h >> 2] = c[j >> 2];
+                c[j >> 2] = g;
+                c[(d + (c[h >> 2] << 2)) >> 2] = f;
+                c[(d + (c[j >> 2] << 2)) >> 2] = b;
+                b = f;
+              }
+              return;
+            }
+            function hs(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0.0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              p = l;
+              l = (l + 16) | 0;
+              m = (p + 8) | 0;
+              n = p;
+              c[n >> 2] = 0;
+              o = KK(d << 2) | 0;
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (d | 0)) break;
+                g[(e + (f << 2)) >> 2] = 3402823466385288598117041.0e14;
+                f = (f + 1) | 0;
+              }
+              g[(e + (a << 2)) >> 2] = 0.0;
+              h = c[(b + ((a * 20) | 0)) >> 2] | 0;
+              i = (b + ((a * 20) | 0) + 8) | 0;
+              j = (b + ((a * 20) | 0) + 4) | 0;
+              f = 1;
+              while (1) {
+                if ((f | 0) >= (h | 0)) break;
+                c[(e + (c[((c[j >> 2] | 0) + (f << 2)) >> 2] << 2)) >> 2] = c[((c[i >> 2] | 0) + (f << 2)) >> 2];
+                f = (f + 1) | 0;
+              }
+              is(m, a, o, e, d);
+              a: while (1) {
+                if (!(((js(m, n, o, e) | 0) << 24) >> 24)) break;
+                f = c[n >> 2] | 0;
+                k = +g[(e + (f << 2)) >> 2];
+                if (k == 3402823466385288598117041.0e14) break;
+                i = (b + ((f * 20) | 0)) | 0;
+                j = (b + ((f * 20) | 0) + 4) | 0;
+                h = (b + ((f * 20) | 0) + 8) | 0;
+                f = 1;
+                while (1) {
+                  if ((f | 0) >= (c[i >> 2] | 0)) continue a;
+                  ks(m, c[((c[j >> 2] | 0) + (f << 2)) >> 2] | 0, +g[((c[h >> 2] | 0) + (f << 2)) >> 2] + k, o, e);
+                  f = (f + 1) | 0;
+                }
+              }
+              fs(m);
+              U1(o);
+              l = p;
+              return;
+            }
+            function is(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              i = (f + -1) | 0;
+              j = KK(i << 2) | 0;
+              c[a >> 2] = j;
+              c[(a + 4) >> 2] = i;
+              g = 0;
+              h = 0;
+              while (1) {
+                if ((h | 0) >= (f | 0)) break;
+                if ((h | 0) != (b | 0)) {
+                  c[(j + (g << 2)) >> 2] = h;
+                  c[(d + (h << 2)) >> 2] = g;
+                  g = (g + 1) | 0;
+                }
+                h = (h + 1) | 0;
+              }
+              g = ((i | 0) / 2) | 0;
+              while (1) {
+                if ((g | 0) <= -1) break;
+                ls(a, g, d, e);
+                g = (g + -1) | 0;
+              }
+              return;
+            }
+            function js(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              f = (a + 4) | 0;
+              if (!(c[f >> 2] | 0)) a = 0;
+              else {
+                g = c[a >> 2] | 0;
+                c[b >> 2] = c[g >> 2];
+                b = c[(g + (((c[f >> 2] | 0) + -1) << 2)) >> 2] | 0;
+                c[g >> 2] = b;
+                c[(d + (b << 2)) >> 2] = 0;
+                c[f >> 2] = (c[f >> 2] | 0) + -1;
+                ls(a, 0, d, e);
+                a = 1;
+              }
+              return a | 0;
+            }
+            function ks(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = +d;
+              e = e | 0;
+              f = f | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              h = (f + (b << 2)) | 0;
+              if (!(+g[h >> 2] <= d)) {
+                k = (e + (b << 2)) | 0;
+                j = c[k >> 2] | 0;
+                g[h >> 2] = d;
+                h = c[a >> 2] | 0;
+                a = j;
+                while (1) {
+                  if ((a | 0) <= 0) break;
+                  i = a >>> 1;
+                  j = c[(h + (i << 2)) >> 2] | 0;
+                  if (!(+g[(f + (j << 2)) >> 2] > d)) break;
+                  c[(h + (a << 2)) >> 2] = j;
+                  c[(e + (j << 2)) >> 2] = a;
+                  a = i;
+                }
+                c[(h + (a << 2)) >> 2] = b;
+                c[k >> 2] = a;
+              }
+              return;
+            }
+            function ls(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              j = (a + 4) | 0;
+              while (1) {
+                f = b << 1;
+                h = f | 1;
+                i = c[j >> 2] | 0;
+                if (
+                  !((f | 0) < (i | 0)
+                    ? ((k = c[a >> 2] | 0),
+                      +g[(e + (c[(k + (f << 2)) >> 2] << 2)) >> 2] < +g[(e + (c[(k + (b << 2)) >> 2] << 2)) >> 2])
+                    : 0)
+                )
+                  f = b;
+                if (
+                  (h | 0) < (i | 0)
+                    ? ((k = c[a >> 2] | 0),
+                      +g[(e + (c[(k + (h << 2)) >> 2] << 2)) >> 2] < +g[(e + (c[(k + (f << 2)) >> 2] << 2)) >> 2])
+                    : 0
+                )
+                  f = h;
+                if ((f | 0) == (b | 0)) break;
+                k = c[a >> 2] | 0;
+                i = (k + (f << 2)) | 0;
+                h = c[i >> 2] | 0;
+                k = (k + (b << 2)) | 0;
+                c[i >> 2] = c[k >> 2];
+                c[k >> 2] = h;
+                c[(d + (c[i >> 2] << 2)) >> 2] = f;
+                c[(d + (c[k >> 2] << 2)) >> 2] = b;
+                b = f;
+              }
+              return;
+            }
+            function ms() {
+              fu(187400, 48);
+              c[46853] = 0;
+              return;
+            }
+            function ns(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0.0,
+                g = 0.0,
+                i = 0;
+              i = hu(187400) | 0;
+              c[(i + 32) >> 2] = a;
+              c[(i + 36) >> 2] = b;
+              Pu(a);
+              Pu(b);
+              c[(i + 24) >> 2] = 0;
+              c[(i + 28) >> 2] = 0;
+              f = +h[a >> 3];
+              g = +h[b >> 3] - f;
+              e = +h[(a + 8) >> 3];
+              d = +h[(b + 8) >> 3] - e;
+              f = d * e + g * f + (d * d + g * g) * 0.5;
+              b = (i + 16) | 0;
+              h[b >> 3] = f;
+              if ((g > 0.0 ? g : -g) > (d > 0.0 ? d : -d)) {
+                h[i >> 3] = 1.0;
+                e = d / g;
+                d = g;
+                a = (i + 8) | 0;
+              } else {
+                h[(i + 8) >> 3] = 1.0;
+                e = g / d;
+                a = i;
+              }
+              h[a >> 3] = e;
+              h[b >> 3] = f / d;
+              b = c[46853] | 0;
+              c[(i + 40) >> 2] = b;
+              c[46853] = b + 1;
+              return i | 0;
+            }
+            function os(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0.0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                l = 0.0,
+                m = 0;
+              l = +h[a >> 3];
+              a: do
+                if (l == 1.0) {
+                  if (!(+h[(a + 8) >> 3] >= 0.0)) {
+                    b = c[(a + 28) >> 2] | 0;
+                    d = c[(a + 24) >> 2] | 0;
+                    if (!d) m = 9;
+                    else m = 5;
+                  } else {
+                    b = c[(a + 24) >> 2] | 0;
+                    d = c[(a + 28) >> 2] | 0;
+                    if (!d) m = 9;
+                    else m = 5;
+                  }
+                  do
+                    if ((m | 0) == 5) {
+                      e = +h[(d + 8) >> 3];
+                      if (e > +h[23266]) break a;
+                      f = +h[23267];
+                      if (!(e >= f)) {
+                        i = f;
+                        e = +h[(a + 16) >> 3] - +h[(a + 8) >> 3] * f;
+                        break;
+                      } else {
+                        i = e;
+                        e = +h[d >> 3];
+                        break;
+                      }
+                    } else if ((m | 0) == 9) {
+                      f = +h[23267];
+                      i = f;
+                      e = +h[(a + 16) >> 3] - +h[(a + 8) >> 3] * f;
+                    }
+                  while (0);
+                  do
+                    if (b) {
+                      g = +h[(b + 8) >> 3];
+                      if (g < f) break a;
+                      f = +h[23266];
+                      if (!(g <= f)) {
+                        g = f;
+                        f = +h[(a + 16) >> 3] - +h[(a + 8) >> 3] * f;
+                        break;
+                      } else {
+                        f = +h[b >> 3];
+                        break;
+                      }
+                    } else {
+                      f = +h[23266];
+                      g = f;
+                      f = +h[(a + 16) >> 3] - +h[(a + 8) >> 3] * f;
+                    }
+                  while (0);
+                  j = +h[23268];
+                  b = e > j;
+                  d = f > j;
+                  k = +h[23269];
+                  if (!((b & d) | ((e < k) & (f < k)))) {
+                    if (b) {
+                      i = (+h[(a + 16) >> 3] - j) / +h[(a + 8) >> 3];
+                      e = j;
+                    }
+                    if (e < k) {
+                      i = (+h[(a + 16) >> 3] - k) / +h[(a + 8) >> 3];
+                      e = k;
+                    }
+                    if (d) {
+                      g = (+h[(a + 16) >> 3] - j) / +h[(a + 8) >> 3];
+                      f = j;
+                    }
+                    if (f < k) {
+                      g = (+h[(a + 16) >> 3] - k) / +h[(a + 8) >> 3];
+                      f = k;
+                      m = 46;
+                    } else m = 46;
+                  }
+                } else {
+                  d = c[(a + 28) >> 2] | 0;
+                  b = c[(a + 24) >> 2] | 0;
+                  do
+                    if (b) {
+                      e = +h[b >> 3];
+                      if (e > +h[23268]) break a;
+                      g = +h[23269];
+                      if (!(e >= g)) {
+                        i = +h[(a + 16) >> 3] - g * l;
+                        e = g;
+                        break;
+                      } else {
+                        i = +h[(b + 8) >> 3];
+                        break;
+                      }
+                    } else {
+                      g = +h[23269];
+                      i = +h[(a + 16) >> 3] - g * l;
+                      e = g;
+                    }
+                  while (0);
+                  do
+                    if (d) {
+                      f = +h[d >> 3];
+                      if (f < g) break a;
+                      j = +h[23268];
+                      if (!(f <= j)) {
+                        g = +h[(a + 16) >> 3] - l * j;
+                        f = j;
+                        break;
+                      } else {
+                        g = +h[(d + 8) >> 3];
+                        break;
+                      }
+                    } else {
+                      f = +h[23268];
+                      g = +h[(a + 16) >> 3] - l * f;
+                    }
+                  while (0);
+                  j = +h[23266];
+                  b = i > j;
+                  d = g > j;
+                  k = +h[23267];
+                  if (!((b & d) | ((i < k) & (g < k)))) {
+                    if (b) {
+                      i = j;
+                      e = (+h[(a + 16) >> 3] - j) / l;
+                    }
+                    if (i < k) {
+                      i = k;
+                      e = (+h[(a + 16) >> 3] - k) / l;
+                    }
+                    if (d) {
+                      g = j;
+                      f = (+h[(a + 16) >> 3] - j) / l;
+                    }
+                    if (g < k) {
+                      g = k;
+                      f = (+h[(a + 16) >> 3] - k) / l;
+                      m = 46;
+                    } else m = 46;
+                  }
+                }
+              while (0);
+              if ((m | 0) == 46) ps(a, e, i, f, g);
+              return;
+            }
+            function ps(a, b, d, e, f) {
+              a = a | 0;
+              b = +b;
+              d = +d;
+              e = +e;
+              f = +f;
+              var g = 0;
+              g = (a + 32) | 0;
+              Ws(c[g >> 2] | 0, b, d);
+              Ws(c[g >> 2] | 0, e, f);
+              a = (a + 36) | 0;
+              Ws(c[a >> 2] | 0, b, d);
+              Ws(c[a >> 2] | 0, e, f);
+              return;
+            }
+            function qs(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              c[(a + 24 + (b << 2)) >> 2] = d;
+              Pu(d);
+              if (c[(a + 24 + ((1 - b) << 2)) >> 2] | 0) {
+                os(a);
+                Ou(c[(a + 32) >> 2] | 0);
+                Ou(c[(a + 36) >> 2] | 0);
+                iu(a, 187400);
+              }
+              return;
+            }
+            function rs(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0;
+              p = l;
+              l = (l + 16) | 0;
+              o = p;
+              m = b << 2;
+              h = KK(O(m, d) | 0) | 0;
+              g = c[e >> 2] | 0;
+              m = KK(m) | 0;
+              n = c[(a + 8) >> 2] | 0;
+              if (g | 0) {
+                U1(c[g >> 2] | 0);
+                U1(g);
+              }
+              k = KK(d << 2) | 0;
+              c[e >> 2] = k;
+              g = 0;
+              while (1) {
+                if ((g | 0) >= (d | 0)) break;
+                c[(k + (g << 2)) >> 2] = h + ((O(g, b) | 0) << 2);
+                g = (g + 1) | 0;
+              }
+              j = (f | 0) != 0;
+              if (j) dt(a, b);
+              e = (x5() | 0) % (b | 0) | 0;
+              ur(o, b);
+              g = c[k >> 2] | 0;
+              if (j) {
+                bs(e, a, b, g);
+                f = 0;
+                g = 0;
+              } else {
+                qr(e, a, b, g, o);
+                f = 0;
+                g = 0;
+              }
+              while (1) {
+                if ((g | 0) >= (b | 0)) {
+                  i = 1;
+                  break;
+                }
+                h = c[((c[k >> 2] | 0) + (g << 2)) >> 2] | 0;
+                c[(m + (g << 2)) >> 2] = h;
+                i = (h | 0) > (f | 0);
+                f = i ? h : f;
+                e = i ? g : e;
+                g = (g + 1) | 0;
+              }
+              while (1) {
+                if ((i | 0) >= (d | 0)) break;
+                h = (k + (i << 2)) | 0;
+                g = c[h >> 2] | 0;
+                if (j) {
+                  bs(e, a, b, g);
+                  g = 0;
+                  f = 0;
+                } else {
+                  qr(e, a, b, g, o);
+                  g = 0;
+                  f = 0;
+                }
+                while (1) {
+                  if ((g | 0) >= (b | 0)) break;
+                  s = (m + (g << 2)) | 0;
+                  q = c[s >> 2] | 0;
+                  r = c[((c[h >> 2] | 0) + (g << 2)) >> 2] | 0;
+                  r = (q | 0) < (r | 0) ? q : r;
+                  c[s >> 2] = r;
+                  s = (r | 0) > (f | 0);
+                  q = s ? g : e;
+                  g = (g + 1) | 0;
+                  f = s ? r : f;
+                  e = q;
+                }
+                i = (i + 1) | 0;
+              }
+              U1(m);
+              if (j) et(a, b, n);
+              l = p;
+              return;
+            }
+            function ss(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0.0,
+                j = 0,
+                k = 0;
+              i = 1.0 / +(b | 0);
+              h = 0;
+              while (1) {
+                if ((h | 0) >= (d | 0)) break;
+                j = (a + (h << 2)) | 0;
+                e = 0.0;
+                f = 0;
+                while (1) {
+                  if ((f | 0) >= (b | 0)) break;
+                  e = e + +(c[((c[j >> 2] | 0) + (f << 2)) >> 2] | 0);
+                  f = (f + 1) | 0;
+                }
+                g = ~~(e * i);
+                f = 0;
+                while (1) {
+                  if ((f | 0) >= (b | 0)) break;
+                  k = ((c[j >> 2] | 0) + (f << 2)) | 0;
+                  c[k >> 2] = (c[k >> 2] | 0) - g;
+                  f = (f + 1) | 0;
+                }
+                h = (h + 1) | 0;
+              }
+              return;
+            }
+            function ts() {
+              c[46855] = ~~+C(+(+(((c[46854] | 0) + 4) | 0)));
+              return;
+            }
+            function us(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0,
+                d = 0.0;
+              c = +h[a >> 3] - +h[b >> 3];
+              d = +h[(a + 8) >> 3] - +h[(b + 8) >> 3];
+              return +(d * d + c * c);
+            }
+            function vs(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              h[a >> 3] = +h[b >> 3] - +h[c >> 3];
+              h[(a + 8) >> 3] = +h[(b + 8) >> 3] - +h[(c + 8) >> 3];
+              return;
+            }
+            function ws(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              h[a >> 3] = +h[c >> 3] + +h[b >> 3];
+              h[(a + 8) >> 3] = +h[(c + 8) >> 3] + +h[(b + 8) >> 3];
+              return;
+            }
+            function xs(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0,
+                e = 0.0;
+              d = +h[(b + 8) >> 3];
+              e = +h[b >> 3];
+              return +((+h[c >> 3] - e) * (+h[(a + 8) >> 3] - d) - (+h[a >> 3] - e) * (+h[(c + 8) >> 3] - d));
+            }
+            function ys(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              e = l;
+              l = (l + 48) | 0;
+              f = (e + 32) | 0;
+              g = (e + 16) | 0;
+              h = e;
+              c[h >> 2] = c[a >> 2];
+              c[(h + 4) >> 2] = c[(a + 4) >> 2];
+              c[(h + 8) >> 2] = c[(a + 8) >> 2];
+              c[(h + 12) >> 2] = c[(a + 12) >> 2];
+              c[g >> 2] = c[b >> 2];
+              c[(g + 4) >> 2] = c[(b + 4) >> 2];
+              c[(g + 8) >> 2] = c[(b + 8) >> 2];
+              c[(g + 12) >> 2] = c[(b + 12) >> 2];
+              c[f >> 2] = c[d >> 2];
+              c[(f + 4) >> 2] = c[(d + 4) >> 2];
+              c[(f + 8) >> 2] = c[(d + 8) >> 2];
+              c[(f + 12) >> 2] = c[(d + 12) >> 2];
+              d = (+xs(h, g, f) > 0.0) & 1;
+              l = e;
+              return d | 0;
+            }
+            function zs(a, b, c, d, e) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                l = 0.0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0.0;
+              o = +h[a >> 3];
+              p = +h[(d + 8) >> 3];
+              q = +h[(c + 8) >> 3];
+              m = (p - q) * o;
+              n = +h[b >> 3];
+              l = +h[d >> 3];
+              k = +h[(b + 8) >> 3];
+              i = +h[(a + 8) >> 3];
+              j = k - i;
+              f = +h[c >> 3];
+              g = m + n * (q - p) + j * l + f * (i - k);
+              if (g == 0.0) d = 0;
+              else {
+                p = (f * (i - p) + m + (q - i) * l) / g;
+                q = -(f * j + ((q - k) * o + (i - q) * n)) / g;
+                h[e >> 3] = p * (n - o) + o;
+                h[(e + 8) >> 3] = j * p + i;
+                d = (q <= 1.0) & ((q >= 0.0) & ((p >= 0.0) & (p <= 1.0))) & 1;
+              }
+              return d | 0;
+            }
+            function As(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = +d;
+              var e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0;
+              c[(a + 20) >> 2] = b;
+              Pu(b);
+              i = (a + 24) | 0;
+              h[i >> 3] = +h[(b + 8) >> 3] + d;
+              e = c[46856] | 0;
+              e = (e + (((Bs(a) | 0) * 40) | 0)) | 0;
+              while (1) {
+                f = (e + 32) | 0;
+                e = c[f >> 2] | 0;
+                if (!e) break;
+                d = +h[i >> 3];
+                g = +h[(e + 24) >> 3];
+                if (d > g) continue;
+                if (!(d == g)) break;
+                if (!(+h[b >> 3] > +h[c[(e + 20) >> 2] >> 3])) break;
+              }
+              c[(a + 32) >> 2] = e;
+              c[f >> 2] = a;
+              c[46857] = (c[46857] | 0) + 1;
+              return;
+            }
+            function Bs(a) {
+              a = a | 0;
+              var b = 0.0,
+                d = 0,
+                e = 0.0;
+              d = c[46858] | 0;
+              e = +(d | 0);
+              b = ((+h[(a + 24) >> 3] - +h[23273]) / +h[23275]) * e;
+              do
+                if (!(b < 0.0))
+                  if (!(b >= e)) {
+                    a = ~~b;
+                    break;
+                  } else {
+                    a = (d + -1) | 0;
+                    break;
+                  }
+                else a = 0;
+              while (0);
+              if ((a | 0) < (c[46859] | 0)) c[46859] = a;
+              return a | 0;
+            }
+            function Cs(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              d = (a + 20) | 0;
+              if (c[d >> 2] | 0) {
+                b = c[46856] | 0;
+                b = (b + (((Bs(a) | 0) * 40) | 0)) | 0;
+                do {
+                  e = (b + 32) | 0;
+                  b = c[e >> 2] | 0;
+                } while ((b | 0) != (a | 0));
+                c[e >> 2] = c[(a + 32) >> 2];
+                c[46857] = (c[46857] | 0) + -1;
+                Ou(c[d >> 2] | 0);
+                c[d >> 2] = 0;
+              }
+              return;
+            }
+            function Ds() {
+              return ((c[46857] | 0) == 0) | 0;
+            }
+            function Es(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0.0;
+              b = c[46856] | 0;
+              d = c[46859] | 0;
+              while (1) {
+                e = c[(b + ((d * 40) | 0) + 32) >> 2] | 0;
+                if (e | 0) break;
+                e = (d + 1) | 0;
+                c[46859] = e;
+                d = e;
+              }
+              f = +h[(e + 24) >> 3];
+              h[a >> 3] = +h[c[(e + 20) >> 2] >> 3];
+              h[(a + 8) >> 3] = f;
+              return;
+            }
+            function Fs() {
+              var a = 0,
+                b = 0;
+              b = ((c[46856] | 0) + (((c[46859] | 0) * 40) | 0) + 32) | 0;
+              a = c[b >> 2] | 0;
+              c[b >> 2] = c[(a + 32) >> 2];
+              c[46857] = (c[46857] | 0) + -1;
+              return a | 0;
+            }
+            function Gs() {
+              U1(c[46856] | 0);
+              c[46856] = 0;
+              return;
+            }
+            function Hs() {
+              var a = 0,
+                b = 0,
+                d = 0;
+              c[46857] = 0;
+              c[46859] = 0;
+              a = c[46855] | 0;
+              b = a << 2;
+              c[46858] = b;
+              d = c[46856] | 0;
+              if (!d) {
+                d = KK((a * 160) | 0) | 0;
+                c[46856] = d;
+                b = c[46858] | 0;
+              }
+              a = 0;
+              while (1) {
+                if ((a | 0) >= (b | 0)) break;
+                c[(d + ((a * 40) | 0) + 32) >> 2] = 0;
+                a = (a + 1) | 0;
+              }
+              return;
+            }
+            function Is() {
+              fu(187448, 40);
+              U1(c[46865] | 0);
+              c[46865] = 0;
+              return;
+            }
+            function Js() {
+              var a = 0,
+                b = 0,
+                d = 0;
+              fu(187448, 40);
+              a = c[46855] | 0;
+              b = a << 1;
+              c[46866] = b;
+              d = c[46865] | 0;
+              if (!d) {
+                d = KK(a << 3) | 0;
+                c[46865] = d;
+                b = c[46866] | 0;
+              }
+              a = 0;
+              while (1) {
+                if ((a | 0) >= (b | 0)) break;
+                c[(d + (a << 2)) >> 2] = 0;
+                a = (a + 1) | 0;
+              }
+              c[46860] = Ks(0, 0) | 0;
+              c[46861] = Ks(0, 0) | 0;
+              c[c[46860] >> 2] = 0;
+              d = c[46861] | 0;
+              b = c[46860] | 0;
+              c[(b + 4) >> 2] = d;
+              c[d >> 2] = b;
+              c[((c[46861] | 0) + 4) >> 2] = 0;
+              d = c[46865] | 0;
+              c[d >> 2] = c[46860];
+              c[(d + (((c[46866] | 0) + -1) << 2)) >> 2] = c[46861];
+              return;
+            }
+            function Ks(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              e = hu(187448) | 0;
+              c[(e + 8) >> 2] = b;
+              a[(e + 16) >> 0] = d;
+              c[(e + 32) >> 2] = 0;
+              c[(e + 20) >> 2] = 0;
+              c[(e + 12) >> 2] = 0;
+              return e | 0;
+            }
+            function Ls(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                g = 0.0,
+                i = 0,
+                j = 0.0,
+                k = 0,
+                l = 0.0,
+                m = 0.0,
+                n = 0.0,
+                o = 0,
+                p = 0.0,
+                q = 0.0;
+              i = c[(b + 8) >> 2] | 0;
+              k = c[(d + 8) >> 2] | 0;
+              do
+                if (
+                  (
+                    !(((i | 0) == 0) | ((k | 0) == 0))
+                      ? ((o = c[(i + 36) >> 2] | 0), (e = c[(k + 36) >> 2] | 0), (o | 0) != (e | 0))
+                      : 0
+                  )
+                    ? ((j = +h[i >> 3]),
+                      (f = +h[(k + 8) >> 3]),
+                      (g = +h[(i + 8) >> 3]),
+                      (l = +h[k >> 3]),
+                      (m = f * j - l * g),
+                      !((m > -1.0e-10) & (m < 1.0e-10)))
+                    : 0
+                ) {
+                  p = +h[(i + 16) >> 3];
+                  q = +h[(k + 16) >> 3];
+                  n = (p * f - q * g) / m;
+                  j = (q * j - p * l) / m;
+                  f = +h[(o + 8) >> 3];
+                  g = +h[(e + 8) >> 3];
+                  do
+                    if (f < g) e = o;
+                    else {
+                      if (f == g ? +h[o >> 3] < +h[e >> 3] : 0) {
+                        e = o;
+                        break;
+                      }
+                      b = d;
+                    }
+                  while (0);
+                  b = a[(b + 16) >> 0] | 0;
+                  if (!(n >= +h[e >> 3])) {
+                    if ((b << 24) >> 24 == 1) {
+                      b = 0;
+                      break;
+                    }
+                  } else if (!((b << 24) >> 24)) {
+                    b = 0;
+                    break;
+                  }
+                  b = Lu() | 0;
+                  c[(b + 20) >> 2] = 0;
+                  h[b >> 3] = n;
+                  h[(b + 8) >> 3] = j;
+                } else b = 0;
+              while (0);
+              return b | 0;
+            }
+            function Ms(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0,
+                l = 0.0,
+                m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0;
+              n = c[(b + 8) >> 2] | 0;
+              k = c[(n + 36) >> 2] | 0;
+              l = +h[d >> 3];
+              o = +h[k >> 3];
+              m = l > o;
+              p = a[(b + 16) >> 0] | 0;
+              if (m)
+                if (!((p << 24) >> 24)) b = 1;
+                else f = 4;
+              else if ((p << 24) >> 24 == 1) b = 0;
+              else f = 4;
+              if ((f | 0) == 4) {
+                e = +h[n >> 3];
+                a: do
+                  if (e == 1.0) {
+                    e = +h[(d + 8) >> 3];
+                    g = e - +h[(k + 8) >> 3];
+                    i = l - o;
+                    j = +h[(n + 8) >> 3];
+                    d = j < 0.0;
+                    do
+                      if (m ? j >= 0.0 : d) {
+                        if (g >= j * i) {
+                          b = 1;
+                          break a;
+                        }
+                      } else {
+                        b = j * e + l > +h[(n + 16) >> 3];
+                        if (d)
+                          if (b) {
+                            b = 0;
+                            break a;
+                          } else break;
+                        else if (b) break;
+                        else {
+                          b = 0;
+                          break a;
+                        }
+                      }
+                    while (0);
+                    o = o - +h[c[(n + 32) >> 2] >> 3];
+                    b = j * (i * i - g * g) < o * g * ((i * 2.0) / o + 1.0 + j * j);
+                    if (d) b = b ^ 1;
+                  } else {
+                    i = +h[(n + 16) >> 3] - l * e;
+                    j = +h[(d + 8) >> 3] - i;
+                    o = l - o;
+                    l = i - +h[(k + 8) >> 3];
+                    b = j * j > l * l + o * o;
+                  }
+                while (0);
+                b = (b ^ ((p << 24) >> 24 != 0)) & 1;
+              }
+              return b | 0;
+            }
+            function Ns(a, b) {
+              a = a | 0;
+              b = b | 0;
+              c[b >> 2] = a;
+              a = (a + 4) | 0;
+              c[(b + 4) >> 2] = c[a >> 2];
+              c[c[a >> 2] >> 2] = b;
+              c[a >> 2] = b;
+              return;
+            }
+            function Os(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              f = c[46866] | 0;
+              b = ~~(((+h[a >> 3] - +h[23272]) / +h[23274]) * +(f | 0));
+              b = (b | 0) > 0 ? b : 0;
+              f = (b | 0) < (f | 0) ? b : (f + -1) | 0;
+              b = Ps(f) | 0;
+              if (!b) {
+                d = 1;
+                while (1) {
+                  b = Ps((f - d) | 0) | 0;
+                  if (b | 0) break;
+                  b = Ps((d + f) | 0) | 0;
+                  if (b | 0) break;
+                  d = (d + 1) | 0;
+                }
+                c[46867] = (c[46867] | 0) + d;
+              }
+              c[46868] = (c[46868] | 0) + 1;
+              e = c[46860] | 0;
+              d = c[46861] | 0;
+              a: do
+                if ((b | 0) == (e | 0)) g = 9;
+                else {
+                  if ((b | 0) != (d | 0) ? (Ms(b, a) | 0) != 0 : 0) {
+                    g = 9;
+                    break;
+                  }
+                  while (1) {
+                    b = c[b >> 2] | 0;
+                    if ((b | 0) == (e | 0)) break a;
+                    if (Ms(b, a) | 0) {
+                      e = b;
+                      break;
+                    }
+                  }
+                }
+              while (0);
+              if ((g | 0) == 9) {
+                while (1) {
+                  b = c[(b + 4) >> 2] | 0;
+                  if ((b | 0) == (d | 0)) break;
+                  if (!(Ms(b, a) | 0)) break;
+                  else g = 9;
+                }
+                e = c[b >> 2] | 0;
+              }
+              if ((f | 0) > 0 ? (f | 0) < (((c[46866] | 0) + -1) | 0) : 0) {
+                b = ((c[46865] | 0) + (f << 2)) | 0;
+                d = c[b >> 2] | 0;
+                if (d | 0) {
+                  g = (d + 12) | 0;
+                  c[g >> 2] = (c[g >> 2] | 0) + -1;
+                }
+                c[b >> 2] = e;
+                g = (e + 12) | 0;
+                c[g >> 2] = (c[g >> 2] | 0) + 1;
+              }
+              return e | 0;
+            }
+            function Ps(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              if (
+                ((a | 0) > -1) & ((c[46866] | 0) > (a | 0))
+                  ? ((d = ((c[46865] | 0) + (a << 2)) | 0), (b = c[d >> 2] | 0), (b | 0) != 0)
+                  : 0
+              ) {
+                if ((c[(b + 8) >> 2] | 0) == (-2 | 0)) {
+                  c[d >> 2] = 0;
+                  a = (b + 12) | 0;
+                  d = ((c[a >> 2] | 0) + -1) | 0;
+                  c[a >> 2] = d;
+                  if (!d) {
+                    iu(b, 187448);
+                    b = 0;
+                  } else b = 0;
+                }
+              } else b = 0;
+              return b | 0;
+            }
+            function Qs(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = (a + 4) | 0;
+              d = c[a >> 2] | 0;
+              c[(d + 4) >> 2] = c[b >> 2];
+              c[c[b >> 2] >> 2] = d;
+              c[(a + 8) >> 2] = -2;
+              return;
+            }
+            function Rs(a) {
+              a = a | 0;
+              return c[(a + 4) >> 2] | 0;
+            }
+            function Ss(a) {
+              a = a | 0;
+              return c[a >> 2] | 0;
+            }
+            function Ts(b) {
+              b = b | 0;
+              var d = 0;
+              d = c[(b + 8) >> 2] | 0;
+              if (!d) b = 187672;
+              else b = (a[(b + 16) >> 0] | 0) == 0 ? (d + 32) | 0 : (d + 36) | 0;
+              return c[b >> 2] | 0;
+            }
+            function Us(b) {
+              b = b | 0;
+              var d = 0;
+              d = c[(b + 8) >> 2] | 0;
+              if (!d) b = 187672;
+              else b = (a[(b + 16) >> 0] | 0) == 0 ? (d + 36) | 0 : (d + 32) | 0;
+              return c[b >> 2] | 0;
+            }
+            function Vs() {
+              fu(187480, 24);
+              return;
+            }
+            function Ws(a, b, d) {
+              a = a | 0;
+              b = +b;
+              d = +d;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 32) | 0;
+              i = j;
+              g = ((c[46869] | 0) + (((c[(a + 16) >> 2] | 0) * 96) | 0) + 88) | 0;
+              f = c[g >> 2] | 0;
+              h[(i + 8) >> 3] = b;
+              h[(i + 16) >> 3] = d;
+              e = Xs(a, i, f) | 0;
+              do
+                if (e | 0) {
+                  if ((e | 0) < 0) {
+                    i = hu(187480) | 0;
+                    h[(i + 8) >> 3] = b;
+                    h[(i + 16) >> 3] = d;
+                    c[i >> 2] = f;
+                    c[g >> 2] = i;
+                    break;
+                  }
+                  while (1) {
+                    e = c[f >> 2] | 0;
+                    g = Xs(a, i, e) | 0;
+                    if ((g | 0) > 0) f = e;
+                    else break;
+                  }
+                  if (g | 0) {
+                    i = hu(187480) | 0;
+                    h[(i + 8) >> 3] = b;
+                    h[(i + 16) >> 3] = d;
+                    c[f >> 2] = i;
+                    c[i >> 2] = e;
+                  }
+                }
+              while (0);
+              l = j;
+              return;
+            }
+            function Xs(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0;
+              do
+                if (c) {
+                  e = +h[(b + 8) >> 3];
+                  i = +h[(c + 8) >> 3];
+                  d = +h[(b + 16) >> 3];
+                  f = +h[(c + 16) >> 3];
+                  if (!((e == i) & (d == f))) {
+                    k = +h[a >> 3];
+                    j = e - k;
+                    e = +h[(a + 8) >> 3];
+                    g = d - e;
+                    i = i - k;
+                    d = f - e;
+                    if (!(j >= 0.0)) {
+                      if (i >= 0.0) {
+                        b = 1;
+                        break;
+                      }
+                      e = d / i;
+                      d = g / j;
+                      if (d < e) {
+                        b = -1;
+                        break;
+                      }
+                      if (d > e) {
+                        b = 1;
+                        break;
+                      }
+                      b = j > i ? -1 : 1;
+                      break;
+                    }
+                    if (!(i < 0.0)) {
+                      b = i > 0.0;
+                      if (!(j > 0.0)) {
+                        if (b) {
+                          b = !(g <= 0.0) ? 1 : -1;
+                          break;
+                        }
+                        if (g < d) {
+                          b = !(d <= 0.0) ? -1 : 1;
+                          break;
+                        } else {
+                          b = !(g <= 0.0) ? 1 : -1;
+                          break;
+                        }
+                      } else {
+                        if (!b) {
+                          b = d > 0.0 ? -1 : 1;
+                          break;
+                        }
+                        e = d / i;
+                        d = g / j;
+                        if (d < e) {
+                          b = -1;
+                          break;
+                        }
+                        if (d > e) {
+                          b = 1;
+                          break;
+                        }
+                        b = j < i ? -1 : 1;
+                        break;
+                      }
+                    } else b = -1;
+                  } else b = 0;
+                } else b = -1;
+              while (0);
+              return b | 0;
+            }
+            function Ys(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              f = c[(a + ((d * 20) | 0)) >> 2] | 0;
+              d = (a + ((d * 20) | 0) + 4) | 0;
+              b = 1;
+              a = 0;
+              while (1) {
+                if ((b | 0) >= (f | 0)) break;
+                g = (a + (((c[(e + (c[((c[d >> 2] | 0) + (b << 2)) >> 2] << 2)) >> 2] | 0) > 0) & 1)) | 0;
+                b = (b + 1) | 0;
+                a = g;
+              }
+              return a | 0;
+            }
+            function Zs(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              e = (a + ((b * 20) | 0)) | 0;
+              b = (a + ((b * 20) | 0) + 4) | 0;
+              a = 1;
+              while (1) {
+                if ((a | 0) >= (c[e >> 2] | 0)) break;
+                c[(d + (c[((c[b >> 2] | 0) + (a << 2)) >> 2] << 2)) >> 2] = 1;
+                a = (a + 1) | 0;
+              }
+              return;
+            }
+            function _s(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              e = (a + ((b * 20) | 0)) | 0;
+              b = (a + ((b * 20) | 0) + 4) | 0;
+              a = 1;
+              while (1) {
+                if ((a | 0) >= (c[e >> 2] | 0)) break;
+                c[(d + (c[((c[b >> 2] | 0) + (a << 2)) >> 2] << 2)) >> 2] = 0;
+                a = (a + 1) | 0;
+              }
+              return;
+            }
+            function $s(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if (!(c[(a + 8) >> 2] | 0)) a = bt(a, b) | 0;
+              else a = at(a, b) | 0;
+              return a | 0;
+            }
+            function at(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              f = b << 2;
+              e = KK(O(f, b) | 0) | 0;
+              f = KK(f) | 0;
+              d = 0;
+              while (1) {
+                if ((d | 0) >= (b | 0)) {
+                  d = 0;
+                  break;
+                }
+                c[(f + (d << 2)) >> 2] = e + ((O(d, b) | 0) << 2);
+                d = (d + 1) | 0;
+              }
+              while (1) {
+                if ((d | 0) >= (b | 0)) break;
+                bs(d, a, b, c[(f + (d << 2)) >> 2] | 0);
+                d = (d + 1) | 0;
+              }
+              return f | 0;
+            }
+            function bt(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 16) | 0;
+              f = h;
+              g = b << 2;
+              e = KK(O(g, b) | 0) | 0;
+              g = KK(g) | 0;
+              d = 0;
+              while (1) {
+                if ((d | 0) >= (b | 0)) break;
+                c[(g + (d << 2)) >> 2] = e + ((O(d, b) | 0) << 2);
+                d = (d + 1) | 0;
+              }
+              ur(f, b);
+              d = 0;
+              while (1) {
+                if ((d | 0) >= (b | 0)) break;
+                qr(d, a, b, c[(g + (d << 2)) >> 2] | 0, f);
+                d = (d + 1) | 0;
+              }
+              vr(f);
+              l = h;
+              return g | 0;
+            }
+            function ct(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              e = c[(a + 8) >> 2] | 0;
+              dt(a, b);
+              d = at(a, b) | 0;
+              et(a, b, e);
+              return d | 0;
+            }
+            function dt(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0;
+              l = KK(b << 2) | 0;
+              d = 0;
+              e = 0;
+              while (1) {
+                if ((d | 0) >= (b | 0)) break;
+                k = ((c[(a + ((d * 20) | 0)) >> 2] | 0) + e) | 0;
+                d = (d + 1) | 0;
+                e = k;
+              }
+              e = KK(e << 2) | 0;
+              d = 0;
+              while (1) {
+                if ((d | 0) >= (b | 0)) break;
+                c[(l + (d << 2)) >> 2] = 0;
+                d = (d + 1) | 0;
+              }
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (b | 0)) break;
+                c[(a + ((f * 20) | 0) + 8) >> 2] = e;
+                Zs(a, f, l);
+                h = (a + ((f * 20) | 0)) | 0;
+                i = c[h >> 2] | 0;
+                j = (a + ((f * 20) | 0) + 4) | 0;
+                k = (i + -2) | 0;
+                d = 1;
+                while (1) {
+                  if ((d | 0) >= (i | 0)) break;
+                  m = c[((c[j >> 2] | 0) + (d << 2)) >> 2] | 0;
+                  n = c[(a + ((m * 20) | 0)) >> 2] | 0;
+                  g[(e + (d << 2)) >> 2] = +((k + n - ((Ys(a, 0, m, l) | 0) << 1)) | 0);
+                  d = (d + 1) | 0;
+                }
+                _s(a, f, l);
+                e = (e + (c[h >> 2] << 2)) | 0;
+                f = (f + 1) | 0;
+              }
+              U1(l);
+              return;
+            }
+            function et(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = (a + 8) | 0;
+              U1(c[e >> 2] | 0);
+              c[e >> 2] = 0;
+              a: do
+                if (d | 0) {
+                  e = 0;
+                  while (1) {
+                    if ((e | 0) >= (b | 0)) break a;
+                    c[(a + ((e * 20) | 0) + 8) >> 2] = d;
+                    f = (d + (c[(a + ((e * 20) | 0)) >> 2] << 2)) | 0;
+                    e = (e + 1) | 0;
+                    d = f;
+                  }
+                }
+              while (0);
+              return;
+            }
+            function ft(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0;
+              f = 0;
+              g = 0.0;
+              while (1) {
+                if ((f | 0) >= (b | 0)) break;
+                j = c[(a + (f << 2)) >> 2] | 0;
+                i = +h[(j + (d << 3)) >> 3] - +h[(j + (e << 3)) >> 3];
+                f = (f + 1) | 0;
+                g = i * i + g;
+              }
+              return +(+C(+g));
+            }
+            function gt(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              if ((e | 0) > (d | 0)) {
+                c[46873] = a;
+                o4((b + (d << 2)) | 0, (1 - d + e) | 0, 4, 77);
+              }
+              return;
+            }
+            function ht(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0;
+              f = c[46873] | 0;
+              e = +g[(f + (c[a >> 2] << 2)) >> 2];
+              d = +g[(f + (c[b >> 2] << 2)) >> 2];
+              return (e < d ? -1 : (e > d) & 1) | 0;
+            }
+            function it(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 16) | 0;
+              f = h;
+              if ((d | 0) < (e | 0)) {
+                jt(a, b, d, e, f);
+                g = c[f >> 2] | 0;
+                f = (g + -1) | 0;
+                it(a, b, d, f);
+                g = (g + 1) | 0;
+                it(a, b, g, e);
+                if (!(kt(a, b, d, f) | 0)) it(a, b, d, f);
+                if (!(kt(a, b, g, e) | 0)) it(a, b, g, e);
+              }
+              l = h;
+              return;
+            }
+            function jt(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0.0,
+                m = 0,
+                n = 0;
+              g = x5() | 0;
+              g = (b + (((((((x5() | 0) << 16) | g) >>> 0) % (((1 - d + e) | 0) >>> 0) | 0) + d) << 2)) | 0;
+              j = c[g >> 2] | 0;
+              k = (b + (d << 2)) | 0;
+              c[g >> 2] = c[k >> 2];
+              c[k >> 2] = j;
+              l = +h[(a + (j << 3)) >> 3];
+              g = (d + 1) | 0;
+              d = e;
+              a: while (1) {
+                if ((g | 0) >= (d | 0)) break;
+                while (1) {
+                  if ((g | 0) >= (d | 0)) break;
+                  if (!(+h[(a + (c[(b + (g << 2)) >> 2] << 3)) >> 3] <= l)) break;
+                  g = (g + 1) | 0;
+                }
+                while (1) {
+                  if ((g | 0) >= (d | 0)) continue a;
+                  e = (b + (d << 2)) | 0;
+                  i = c[e >> 2] | 0;
+                  if (!(+h[(a + (i << 3)) >> 3] > l)) break;
+                  d = (d + -1) | 0;
+                }
+                n = (b + (g << 2)) | 0;
+                m = c[n >> 2] | 0;
+                c[n >> 2] = i;
+                c[e >> 2] = m;
+                g = (g + 1) | 0;
+                d = (d + -1) | 0;
+              }
+              n = (g + (((+h[(a + (c[(b + (g << 2)) >> 2] << 3)) >> 3] > l) << 31) >> 31)) | 0;
+              c[f >> 2] = n;
+              n = (b + (n << 2)) | 0;
+              c[k >> 2] = c[n >> 2];
+              c[n >> 2] = j;
+              return;
+            }
+            function kt(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              g = 1;
+              while (1) {
+                f = (d + 1) | 0;
+                if (!(((d | 0) < (e | 0)) & ((g | 0) != 0))) break;
+                g = +h[(a + (c[(b + (d << 2)) >> 2] << 3)) >> 3] > +h[(a + (c[(b + (f << 2)) >> 2] << 3)) >> 3] ? 0 : g;
+                d = f;
+              }
+              return g | 0;
+            }
+            function lt(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                m = 0,
+                n = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0.0,
+                A = 0.0;
+              x = l;
+              l = (l + 16) | 0;
+              v = 4;
+              w = T1(40) | 0;
+              c[w >> 2] = 0;
+              t = x;
+              o = 0;
+              u = $(23, (b * 40) | 0) | 0;
+              d = o;
+              o = 0;
+              if (((d | 0) != 0) & ((p | 0) != 0)) {
+                e = V6(c[d >> 2] | 0, w | 0, v | 0) | 0;
+                if (!e) bb(d | 0, p | 0);
+                z = p;
+              } else e = -1;
+              if ((e | 0) != 1) {
+                d = 0;
+                r = 0;
+                while (1) {
+                  if ((d | 0) >= (b | 0)) break;
+                  s = ((c[((c[(a + (d << 2)) >> 2] | 0) + 4) >> 2] | 0) + r) | 0;
+                  d = (d + 1) | 0;
+                  r = s;
+                }
+                o = 0;
+                s = $(23, (r * 24) | 0) | 0;
+                d = o;
+                o = 0;
+                if (((d | 0) != 0) & ((p | 0) != 0)) {
+                  e = V6(c[d >> 2] | 0, w | 0, v | 0) | 0;
+                  if (!e) bb(d | 0, p | 0);
+                  z = p;
+                } else e = -1;
+                if ((e | 0) != 1) {
+                  d = 0;
+                  m = 0;
+                  while (1) {
+                    if ((m | 0) >= (b | 0)) break;
+                    n = (u + ((m * 40) | 0)) | 0;
+                    c[n >> 2] = s + ((d * 24) | 0);
+                    q = (a + (m << 2)) | 0;
+                    f = 0;
+                    g = 1797693134862315708145274.0e284;
+                    i = -1797693134862315708145274.0e284;
+                    j = -1797693134862315708145274.0e284;
+                    k = 1797693134862315708145274.0e284;
+                    while (1) {
+                      e = c[q >> 2] | 0;
+                      if ((f | 0) >= (c[(e + 4) >> 2] | 0)) break;
+                      e = c[e >> 2] | 0;
+                      A = +h[(e + (f << 4)) >> 3];
+                      y = +h[(e + (f << 4) + 8) >> 3];
+                      h[(s + ((d * 24) | 0)) >> 3] = A;
+                      h[(s + ((d * 24) | 0) + 8) >> 3] = y;
+                      c[(s + ((d * 24) | 0) + 16) >> 2] = n;
+                      c[(s + ((d * 24) | 0) + 20) >> 2] = 0;
+                      f = (f + 1) | 0;
+                      d = (d + 1) | 0;
+                      g = g < A ? g : A;
+                      i = i > A ? i : A;
+                      j = j > y ? j : y;
+                      k = k < y ? k : y;
+                    }
+                    c[(u + ((m * 40) | 0) + 4) >> 2] = s + ((((d + -1) | 0) * 24) | 0);
+                    h[(u + ((m * 40) | 0) + 8) >> 3] = g;
+                    h[(u + ((m * 40) | 0) + 16) >> 3] = k;
+                    h[(u + ((m * 40) | 0) + 24) >> 3] = i;
+                    h[(u + ((m * 40) | 0) + 32) >> 3] = j;
+                    m = (m + 1) | 0;
+                  }
+                  c[t >> 2] = r;
+                  c[(t + 4) >> 2] = b;
+                  w = U6(187496, 1, w | 0, v | 0) | 0;
+                  v = z;
+                  o = 0;
+                  d = o;
+                  o = 0;
+                  if (((d | 0) != 0) & ((p | 0) != 0)) {
+                    e = V6(c[d >> 2] | 0, w | 0, v | 0) | 0;
+                    if (!e) bb(d | 0, p | 0);
+                    z = p;
+                  } else e = -1;
+                  if ((e | 0) == 1) {
+                    d = z;
+                    q = s;
+                    m = s;
+                    n = u;
+                  } else {
+                    d = 0;
+                    q = s;
+                    m = s;
+                    n = u;
+                  }
+                } else {
+                  d = z;
+                  q = 0;
+                  m = s;
+                  n = u;
+                }
+              } else {
+                d = z;
+                q = 0;
+                m = 0;
+                n = 0;
+              }
+              while (1) {
+                if (d | 0) {
+                  o = 0;
+                  ia(105, u | 0);
+                  d = o;
+                  o = 0;
+                  if (((d | 0) != 0) & ((p | 0) != 0)) {
+                    e = V6(c[d >> 2] | 0, w | 0, v | 0) | 0;
+                    if (!e) bb(d | 0, p | 0);
+                    z = p;
+                  } else e = -1;
+                  if ((e | 0) == 1) {
+                    f = n;
+                    r = m;
+                    s = q;
+                    d = z;
+                    n = f;
+                    m = r;
+                    q = s;
+                    continue;
+                  }
+                  o = 0;
+                  ia(105, m | 0);
+                  d = o;
+                  o = 0;
+                  if (((d | 0) != 0) & ((p | 0) != 0)) {
+                    e = V6(c[d >> 2] | 0, w | 0, v | 0) | 0;
+                    if (!e) bb(d | 0, p | 0);
+                    z = p;
+                  } else e = -1;
+                  if ((e | 0) == 1) {
+                    f = n;
+                    r = m;
+                    s = q;
+                    d = z;
+                    n = f;
+                    m = r;
+                    q = s;
+                    continue;
+                  } else {
+                    e = 17;
+                    break;
+                  }
+                }
+                o = 0;
+                d = aa(78, q | 0, t | 0) | 0;
+                e = o;
+                o = 0;
+                if (((e | 0) != 0) & ((p | 0) != 0)) {
+                  f = V6(c[e >> 2] | 0, w | 0, v | 0) | 0;
+                  if (!f) bb(e | 0, p | 0);
+                  z = p;
+                } else f = -1;
+                if ((f | 0) == 1) {
+                  f = n;
+                  r = m;
+                  s = q;
+                  d = z;
+                  n = f;
+                  m = r;
+                  q = s;
+                  continue;
+                }
+                if (!d) {
+                  o = 0;
+                  d = ca(24, a | 0, b | 0, n | 0) | 0;
+                  e = o;
+                  o = 0;
+                  if (((e | 0) != 0) & ((p | 0) != 0)) {
+                    f = V6(c[e >> 2] | 0, w | 0, v | 0) | 0;
+                    if (!f) bb(e | 0, p | 0);
+                    z = p;
+                  } else f = -1;
+                  if ((f | 0) == 1) {
+                    f = n;
+                    r = m;
+                    s = q;
+                    d = z;
+                    n = f;
+                    m = r;
+                    q = s;
+                    continue;
+                  }
+                }
+                o = 0;
+                ia(105, u | 0);
+                e = o;
+                o = 0;
+                if (((e | 0) != 0) & ((p | 0) != 0)) {
+                  f = V6(c[e >> 2] | 0, w | 0, v | 0) | 0;
+                  if (!f) bb(e | 0, p | 0);
+                  z = p;
+                } else f = -1;
+                if ((f | 0) == 1) {
+                  f = n;
+                  r = m;
+                  s = q;
+                  d = z;
+                  n = f;
+                  m = r;
+                  q = s;
+                  continue;
+                }
+                o = 0;
+                ia(105, m | 0);
+                e = o;
+                o = 0;
+                if (((e | 0) != 0) & ((p | 0) != 0)) {
+                  f = V6(c[e >> 2] | 0, w | 0, v | 0) | 0;
+                  if (!f) bb(e | 0, p | 0);
+                  z = p;
+                } else f = -1;
+                if ((f | 0) == 1) {
+                  f = n;
+                  r = m;
+                  s = q;
+                  d = z;
+                  n = f;
+                  m = r;
+                  q = s;
+                } else {
+                  e = 24;
+                  break;
+                }
+              }
+              if ((e | 0) == 17) d = 0;
+              else if ((e | 0) == 24) d = ((d | 0) == 0) & 1;
+              U1(w | 0);
+              l = x;
+              return d | 0;
+            }
+            function mt(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0;
+              v = l;
+              l = (l + 16) | 0;
+              q = v;
+              o = (v + 8) | 0;
+              p = (v + 4) | 0;
+              c[(b + 8) >> 2] = 0;
+              u = KK(c[b >> 2] << 2) | 0;
+              f = c[b >> 2] | 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (f | 0)) break;
+                c[(u + (e << 2)) >> 2] = a + ((e * 24) | 0);
+                e = (e + 1) | 0;
+              }
+              o4(u, f, 4, 79);
+              m = 0;
+              g = 0;
+              f = 0;
+              h = 0;
+              a: while (1) {
+                if ((m | 0) >= (c[b >> 2] | 0)) {
+                  s = 0;
+                  d = g;
+                  t = h;
+                  break;
+                }
+                n = (u + (m << 2)) | 0;
+                e = c[n >> 2] | 0;
+                c[o >> 2] = e;
+                a = c[(e + 16) >> 2] | 0;
+                if ((c[a >> 2] | 0) == (e | 0)) e = c[(a + 4) >> 2] | 0;
+                else e = (e + -24) | 0;
+                c[p >> 2] = e;
+                k = 0;
+                a = g;
+                j = h;
+                while (1) {
+                  if ((k | 0) >= 2) break;
+                  switch (ot(o, p) | 0) {
+                    case -1: {
+                      g = 0;
+                      h = a;
+                      while (1) {
+                        if ((g | 0) >= (j | 0)) break;
+                        i = pt(c[h >> 2] | 0, e) | 0;
+                        if (i | 0) {
+                          s = i;
+                          d = a;
+                          t = j;
+                          break a;
+                        }
+                        g = (g + 1) | 0;
+                        h = c[(h + 4) >> 2] | 0;
+                      }
+                      g = KK(12) | 0;
+                      if (!j) {
+                        f = 0;
+                        a = g;
+                      } else c[(f + 4) >> 2] = g;
+                      c[(g + 8) >> 2] = f;
+                      c[g >> 2] = e;
+                      c[(g + 4) >> 2] = 0;
+                      c[(e + 20) >> 2] = g;
+                      h = (j + 1) | 0;
+                      break;
+                    }
+                    case 1: {
+                      e = (e + 20) | 0;
+                      g = c[e >> 2] | 0;
+                      if (!g) {
+                        r = 19;
+                        break a;
+                      }
+                      do
+                        if ((j | 0) != 1) {
+                          if ((g | 0) == (a | 0)) {
+                            a = c[(a + 4) >> 2] | 0;
+                            c[(a + 8) >> 2] = 0;
+                            break;
+                          }
+                          if ((g | 0) == (f | 0)) {
+                            f = c[(f + 8) >> 2] | 0;
+                            c[(f + 4) >> 2] = 0;
+                            break;
+                          } else {
+                            i = (g + 4) | 0;
+                            h = c[(g + 8) >> 2] | 0;
+                            c[(h + 4) >> 2] = c[i >> 2];
+                            c[((c[i >> 2] | 0) + 8) >> 2] = h;
+                            break;
+                          }
+                        } else {
+                          a = 0;
+                          f = 0;
+                        }
+                      while (0);
+                      U1(g);
+                      c[e >> 2] = 0;
+                      g = f;
+                      h = (j + -1) | 0;
+                      break;
+                    }
+                    default: {
+                      g = f;
+                      h = j;
+                    }
+                  }
+                  e = c[n >> 2] | 0;
+                  f = c[(e + 16) >> 2] | 0;
+                  if ((e | 0) == (c[(f + 4) >> 2] | 0)) f = c[f >> 2] | 0;
+                  else f = (e + 24) | 0;
+                  c[p >> 2] = f;
+                  k = (k + 1) | 0;
+                  f = g;
+                  j = h;
+                }
+                m = (m + 1) | 0;
+                g = a;
+                h = j;
+              }
+              if ((r | 0) == 19) {
+                gA(1, 93727, q) | 0;
+                bb(187496, 1);
+              }
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (t | 0)) break;
+                r = c[(d + 4) >> 2] | 0;
+                U1(d);
+                e = (e + 1) | 0;
+                d = r;
+              }
+              U1(u);
+              l = v;
+              return s | 0;
+            }
+            function nt(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0.0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0.0,
+                s = 0.0,
+                t = 0.0,
+                u = 0,
+                v = 0.0,
+                w = 0.0,
+                x = 0.0,
+                y = 0.0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0.0;
+              D = l;
+              l = (l + 48) | 0;
+              o = (D + 24) | 0;
+              n = (D + 16) | 0;
+              u = D;
+              e = 0;
+              a: while (1) {
+                if ((e | 0) >= (b | 0)) {
+                  e = 0;
+                  break;
+                }
+                z = c[(a + (e << 2)) >> 2] | 0;
+                A = c[z >> 2] | 0;
+                c[u >> 2] = c[A >> 2];
+                c[(u + 4) >> 2] = c[(A + 4) >> 2];
+                c[(u + 8) >> 2] = c[(A + 8) >> 2];
+                c[(u + 12) >> 2] = c[(A + 12) >> 2];
+                A = (e + 1) | 0;
+                B = (d + ((e * 40) | 0) + 8) | 0;
+                p = (d + ((e * 40) | 0) + 24) | 0;
+                q = (d + ((e * 40) | 0) + 32) | 0;
+                g = (d + ((e * 40) | 0) + 16) | 0;
+                e = A;
+                while (1) {
+                  if ((e | 0) >= (b | 0)) {
+                    e = A;
+                    continue a;
+                  }
+                  i = c[(a + (e << 2)) >> 2] | 0;
+                  j = +h[B >> 3];
+                  k = +h[(d + ((e * 40) | 0) + 24) >> 3];
+                  m = !(j <= k);
+                  f = +h[(d + ((e * 40) | 0) + 8) >> 3];
+                  if (
+                    (
+                      (
+                        (!(m | !(j >= f)) ? ((r = +h[g >> 3]), (s = +h[(d + ((e * 40) | 0) + 32) >> 3]), r <= s) : 0)
+                          ? ((t = +h[(d + ((e * 40) | 0) + 16) >> 3]), r >= t)
+                          : 0
+                      )
+                        ? ((E = +h[p >> 3]), !(!(E <= k) | !(E >= f)))
+                        : 0
+                    )
+                      ? ((E = +h[q >> 3]), !(!(E <= s) | !(E >= t)))
+                      : 0
+                  ) {
+                    c[n >> 2] = c[i >> 2];
+                    c[(n + 4) >> 2] = c[(i + 4) >> 2];
+                    c[o >> 2] = c[u >> 2];
+                    c[(o + 4) >> 2] = c[(u + 4) >> 2];
+                    c[(o + 8) >> 2] = c[(u + 8) >> 2];
+                    c[(o + 12) >> 2] = c[(u + 12) >> 2];
+                    if (NX(n, o) | 0) {
+                      e = 1;
+                      break a;
+                    }
+                  } else C = 11;
+                  if (
+                    (
+                      (
+                        (
+                          ((C | 0) == 11 ? ((C = 0), (v = +h[p >> 3]), !(!(f <= v) | !(f >= j))) : 0)
+                            ? ((w = +h[(d + ((e * 40) | 0) + 16) >> 3]), (x = +h[q >> 3]), w <= x)
+                            : 0
+                        )
+                          ? ((y = +h[g >> 3]), !(!(w >= y) | (!(k <= v) | m)))
+                          : 0
+                      )
+                        ? ((E = +h[(d + ((e * 40) | 0) + 32) >> 3]), !(!(E <= x) | !(E >= y)))
+                        : 0
+                    )
+                      ? ((m = c[i >> 2] | 0),
+                        (c[n >> 2] = c[z >> 2]),
+                        (c[(n + 4) >> 2] = c[(z + 4) >> 2]),
+                        (c[o >> 2] = c[m >> 2]),
+                        (c[(o + 4) >> 2] = c[(m + 4) >> 2]),
+                        (c[(o + 8) >> 2] = c[(m + 8) >> 2]),
+                        (c[(o + 12) >> 2] = c[(m + 12) >> 2]),
+                        NX(n, o) | 0)
+                      : 0
+                  ) {
+                    e = 1;
+                    break a;
+                  }
+                  e = (e + 1) | 0;
+                }
+              }
+              l = D;
+              return e | 0;
+            }
+            function ot(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0,
+                e = 0;
+              e = c[a >> 2] | 0;
+              a = c[b >> 2] | 0;
+              d = +h[e >> 3] - +h[a >> 3];
+              if (!(d != 0.0)) {
+                d = +h[(e + 8) >> 3] - +h[(a + 8) >> 3];
+                if (d == 0.0) a = 0;
+                else a = d > 0.0 ? 1 : -1;
+              } else a = d > 0.0 ? 1 : -1;
+              return a | 0;
+            }
+            function pt(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              m = l;
+              l = (l + 64) | 0;
+              g = (m + 32) | 0;
+              i = (m + 24) | 0;
+              j = (m + 16) | 0;
+              k = m;
+              f = (m + 48) | 0;
+              qt(a, b, f);
+              d = (f + 8) | 0;
+              e = c[d >> 2] | 0;
+              do
+                if ((e | 0) > 0) d = 0;
+                else {
+                  if ((e | 0) < 0) {
+                    qt(b, a, f);
+                    d = c[d >> 2] | 0;
+                    if ((d | 0) > 0) {
+                      d = 0;
+                      break;
+                    }
+                    if ((d | 0) < 0) d = 3;
+                    else {
+                      d = c[f >> 2] | 0;
+                      d = rt(b, a, (d | 0) > -1 ? d : (0 - d) | 0) | 0;
+                    }
+                    if (!(st(a, b, i, j, d) | 0)) {
+                      d = 0;
+                      break;
+                    }
+                  } else {
+                    d = c[f >> 2] | 0;
+                    if ((d | 0) == (c[(f + 4) >> 2] | 0)) {
+                      d = rt(a, b, 0) | 0;
+                      d = (rt(a, b, ((d | 0) <= (rt(a, b, 1) | 0)) & 1) | 0) << 1;
+                    } else d = rt(a, b, (d | 0) > -1 ? d : (0 - d) | 0) | 0;
+                    if (!(st(a, b, i, j, d) | 0)) {
+                      d = 0;
+                      break;
+                    }
+                  }
+                  h[k >> 3] = +h[i >> 3];
+                  h[(k + 8) >> 3] = +h[j >> 3];
+                  c[g >> 2] = c[k >> 2];
+                  c[(g + 4) >> 2] = c[(k + 4) >> 2];
+                  c[(g + 8) >> 2] = c[(k + 8) >> 2];
+                  c[(g + 12) >> 2] = c[(k + 12) >> 2];
+                  d = tt(a, b, g) | 0;
+                }
+              while (0);
+              l = m;
+              return d | 0;
+            }
+            function qt(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                l = 0.0;
+              i = +h[a >> 3];
+              j = +h[(a + 8) >> 3];
+              e = c[(a + 16) >> 2] | 0;
+              if ((c[(e + 4) >> 2] | 0) == (a | 0)) {
+                a = c[e >> 2] | 0;
+                e = a;
+              } else {
+                e = (a + 24) | 0;
+                a = (a + 24) | 0;
+              }
+              g = +h[e >> 3] - i;
+              f = +h[(a + 8) >> 3] - j;
+              e = c[(b + 16) >> 2] | 0;
+              if ((c[(e + 4) >> 2] | 0) == (b | 0)) {
+                a = c[e >> 2] | 0;
+                e = a;
+              } else {
+                e = (b + 24) | 0;
+                a = (b + 24) | 0;
+              }
+              k = +h[e >> 3] - i;
+              l = +h[(a + 8) >> 3] - j;
+              j = (+h[(b + 8) >> 3] - j) * g - (+h[b >> 3] - i) * f;
+              b = j == 0.0 ? 0 : j > 0.0 ? 1 : -1;
+              c[d >> 2] = b;
+              j = l * g - k * f;
+              a = j == 0.0 ? 0 : j > 0.0 ? 1 : -1;
+              c[(d + 4) >> 2] = a;
+              c[(d + 8) >> 2] = O(a, b) | 0;
+              return;
+            }
+            function rt(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                l = 0.0;
+              k = +h[a >> 3];
+              l = +h[(a + 8) >> 3];
+              f = c[(a + 16) >> 2] | 0;
+              if ((c[(f + 4) >> 2] | 0) == (a | 0)) a = c[f >> 2] | 0;
+              else a = (a + 24) | 0;
+              j = +h[a >> 3];
+              i = +h[(a + 8) >> 3];
+              do
+                if (d) {
+                  a = c[(b + 16) >> 2] | 0;
+                  if ((c[(a + 4) >> 2] | 0) == (b | 0)) {
+                    b = c[a >> 2] | 0;
+                    break;
+                  } else {
+                    b = (b + 24) | 0;
+                    break;
+                  }
+                }
+              while (0);
+              g = +h[b >> 3];
+              e = +h[(b + 8) >> 3];
+              if (k == j)
+                if (k == g) b = ((vt(l, e, i) | 0) != -1) & 1;
+                else b = 0;
+              else b = vt(k, g, j) | 0;
+              return b | 0;
+            }
+            function st(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                l = 0.0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0;
+              a: do
+                if ((f | 0) < 1) g = 0;
+                else {
+                  n = +h[a >> 3];
+                  p = +h[(a + 8) >> 3];
+                  g = c[(a + 16) >> 2] | 0;
+                  if ((c[(g + 4) >> 2] | 0) == (a | 0)) g = c[g >> 2] | 0;
+                  else g = (a + 24) | 0;
+                  l = +h[g >> 3];
+                  j = +h[(g + 8) >> 3];
+                  m = +h[b >> 3];
+                  o = +h[(b + 8) >> 3];
+                  g = c[(b + 16) >> 2] | 0;
+                  if ((c[(g + 4) >> 2] | 0) == (b | 0)) g = c[g >> 2] | 0;
+                  else g = (b + 24) | 0;
+                  k = +h[g >> 3];
+                  i = +h[(g + 8) >> 3];
+                  b: do
+                    switch (f | 0) {
+                      case 3: {
+                        if (n == l) {
+                          h[d >> 3] = n;
+                          i = ((o - i) / (m - k)) * (n - k) + i;
+                          break b;
+                        }
+                        if (m == k) {
+                          h[d >> 3] = m;
+                          i = ((p - j) / (n - l)) * (m - l) + j;
+                          break b;
+                        } else {
+                          k = (o - i) / (m - k);
+                          l = (p - j) / (n - l);
+                          o = o - k * m;
+                          p = p - l * n;
+                          i = k - l;
+                          h[d >> 3] = (p - o) / i;
+                          i = (k * p - o * l) / i;
+                          break b;
+                        }
+                      }
+                      case 2: {
+                        if ((rt(a, b, 0) | 0) == -1)
+                          if ((rt(b, a, 1) | 0) == -1) {
+                            f = (rt(b, a, 0) | 0) == -1;
+                            l = f ? l : n;
+                            k = m;
+                            j = f ? j : p;
+                            i = o;
+                          } else {
+                            l = k;
+                            k = m;
+                            j = i;
+                            i = o;
+                          }
+                        else if ((rt(a, b, 1) | 0) != -1)
+                          if ((rt(b, a, 0) | 0) == -1) {
+                            k = n;
+                            i = p;
+                          } else {
+                            g = 0;
+                            break a;
+                          }
+                        else {
+                          l = m;
+                          j = o;
+                        }
+                        h[d >> 3] = (k + l) * 0.5;
+                        i = (i + j) * 0.5;
+                        break;
+                      }
+                      case 1:
+                        if ((o - p) * (n - l) == (m - n) * (p - j)) {
+                          h[d >> 3] = m;
+                          i = o;
+                          break b;
+                        } else {
+                          h[d >> 3] = k;
+                          break b;
+                        }
+                      default: {
+                        g = 1;
+                        break a;
+                      }
+                    }
+                  while (0);
+                  h[e >> 3] = i;
+                  g = 1;
+                }
+              while (0);
+              return g | 0;
+            }
+            function tt(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0,
+                r = 0,
+                s = 0;
+              s = l;
+              l = (l + 16) | 0;
+              q = s;
+              o = +h[a >> 3];
+              p = +h[(a + 8) >> 3];
+              e = c[(a + 16) >> 2] | 0;
+              if ((c[(e + 4) >> 2] | 0) == (a | 0)) e = c[e >> 2] | 0;
+              else e = (a + 24) | 0;
+              m = +h[e >> 3];
+              j = +h[(e + 8) >> 3];
+              k = +h[b >> 3];
+              n = +h[(b + 8) >> 3];
+              e = c[(b + 16) >> 2] | 0;
+              if ((c[(e + 4) >> 2] | 0) == (b | 0)) e = c[e >> 2] | 0;
+              else e = (b + 24) | 0;
+              i = +h[e >> 3];
+              g = +h[(e + 8) >> 3];
+              a: do
+                if (!((o != m) & (k != i))) {
+                  do
+                    if (o == m) {
+                      f = +h[d >> 3];
+                      if (o == f ? p == +h[(d + 8) >> 3] : 0) break;
+                      if (!(m == f)) {
+                        r = 18;
+                        break a;
+                      }
+                      if (!(j == +h[(d + 8) >> 3])) {
+                        r = 18;
+                        break a;
+                      }
+                    }
+                  while (0);
+                  if (k == i) {
+                    f = +h[d >> 3];
+                    if (k == f ? n == +h[(d + 8) >> 3] : 0) {
+                      e = 0;
+                      break;
+                    }
+                    if (i == f ? g == +h[(d + 8) >> 3] : 0) e = 0;
+                    else r = 18;
+                  } else e = 0;
+                } else r = 18;
+              while (0);
+              if ((r | 0) == 18)
+                if (0 > 1) {
+                  e = c[15712] | 0;
+                  p = +h[(d + 8) >> 3];
+                  h[q >> 3] = +h[d >> 3];
+                  h[(q + 8) >> 3] = p;
+                  w4(e, 93756, q) | 0;
+                  ut(1, a);
+                  ut(2, b);
+                  e = 1;
+                } else e = 1;
+              l = s;
+              return e | 0;
+            }
+            function ut(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0.0,
+                n = 0.0;
+              k = l;
+              l = (l + 48) | 0;
+              j = k;
+              f = c[15712] | 0;
+              g = +h[b >> 3];
+              i = +h[(b + 8) >> 3];
+              d = c[(b + 16) >> 2] | 0;
+              if ((c[(d + 4) >> 2] | 0) == (b | 0)) {
+                d = c[d >> 2] | 0;
+                e = d;
+              } else {
+                e = (b + 24) | 0;
+                d = (b + 24) | 0;
+              }
+              n = +h[e >> 3];
+              m = +h[(d + 8) >> 3];
+              c[j >> 2] = a;
+              h[(j + 8) >> 3] = g;
+              h[(j + 16) >> 3] = i;
+              h[(j + 24) >> 3] = n;
+              h[(j + 32) >> 3] = m;
+              w4(f, 93784, j) | 0;
+              l = k;
+              return;
+            }
+            function vt(a, b, c) {
+              a = +a;
+              b = +b;
+              c = +c;
+              return ((a == b) | (b == c) ? 0 : (a < b ? b < c : c < b) ? 1 : -1) | 0;
+            }
+            function wt(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                i = 0.0,
+                j = 0;
+              a: do
+                if (!(uy(a, d) | 0)) a = 0;
+                else {
+                  f = JK(d << 3) | 0;
+                  a = 0;
+                  while (1) {
+                    if ((a | 0) < (d | 0)) e = 0;
+                    else break;
+                    while (1) {
+                      if ((e | 0) == (d | 0)) break;
+                      h[(f + (e << 3)) >> 3] = 0.0;
+                      e = (e + 1) | 0;
+                    }
+                    h[(f + (a << 3)) >> 3] = 1.0;
+                    vy(c[(b + (a << 2)) >> 2] | 0, f, d);
+                    a = (a + 1) | 0;
+                  }
+                  U1(f);
+                  f = 0;
+                  while (1) {
+                    if ((f | 0) >= (d | 0)) {
+                      a = 1;
+                      break a;
+                    }
+                    e = (b + (f << 2)) | 0;
+                    a = 0;
+                    while (1) {
+                      if ((a | 0) == (f | 0)) break;
+                      j = ((c[e >> 2] | 0) + (a << 3)) | 0;
+                      i = +h[j >> 3];
+                      g = ((c[(b + (a << 2)) >> 2] | 0) + (f << 3)) | 0;
+                      h[j >> 3] = +h[g >> 3];
+                      h[g >> 3] = i;
+                      a = (a + 1) | 0;
+                    }
+                    f = (f + 1) | 0;
+                  }
+                }
+              while (0);
+              return a | 0;
+            }
+            function xt(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var i = 0,
+                j = 0.0,
+                k = 0,
+                l = 0.0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0;
+              q = b << 3;
+              p = KK(q) | 0;
+              q = KK(q) | 0;
+              r = (b * 30) | 0;
+              n = (d | 0) < (b | 0) ? d : b;
+              o = (b + -1) | 0;
+              m = (g | 0) == 0;
+              d = 0;
+              i = 0;
+              a: while (1) {
+                if ((i | 0) >= (n | 0)) break;
+                k = c[(e + (i << 2)) >> 2] | 0;
+                do {
+                  b: do
+                    if (m) d = 0;
+                    else {
+                      d = 0;
+                      while (1) {
+                        if ((d | 0) == (b | 0)) {
+                          d = 0;
+                          break b;
+                        }
+                        h[(k + (d << 3)) >> 3] = +((x5() | 0) % 100 | 0 | 0);
+                        d = (d + 1) | 0;
+                      }
+                    }
+                  while (0);
+                  while (1) {
+                    if ((d | 0) == (i | 0)) break;
+                    g = c[(e + (d << 2)) >> 2] | 0;
+                    zt(k, 0, o, -+yt(g, 0, o, k), g);
+                    d = (d + 1) | 0;
+                  }
+                  j = +At(k, 0, o);
+                } while (j < 1.0e-10);
+                Bt(k, 0, o, 1.0 / j, k);
+                d = 0;
+                do {
+                  Ct(q, 0, o, k);
+                  Dt(a, b, b, k, p);
+                  Ct(k, 0, o, p);
+                  g = 0;
+                  while (1) {
+                    if ((g | 0) == (i | 0)) break;
+                    s = c[(e + (g << 2)) >> 2] | 0;
+                    zt(k, 0, o, -+yt(s, 0, o, k), s);
+                    g = (g + 1) | 0;
+                  }
+                  s = d;
+                  d = (d + 1) | 0;
+                  j = +At(k, 0, o);
+                  if (!(((s | 0) < (r | 0)) & !(j < 1.0e-10))) break a;
+                  Bt(k, 0, o, 1.0 / j, k);
+                  l = +yt(k, 0, o, q);
+                } while (+B(+l) < 0.999);
+                h[(f + (i << 3)) >> 3] = l * j;
+                i = (i + 1) | 0;
+              }
+              while (1) {
+                if ((i | 0) >= (n | 0)) break;
+                k = c[(e + (i << 2)) >> 2] | 0;
+                g = 0;
+                while (1) {
+                  if ((g | 0) >= (b | 0)) {
+                    g = 0;
+                    break;
+                  }
+                  h[(k + (g << 3)) >> 3] = +((x5() | 0) % 100 | 0 | 0);
+                  g = (g + 1) | 0;
+                }
+                while (1) {
+                  if ((g | 0) >= (i | 0)) break;
+                  s = c[(e + (g << 2)) >> 2] | 0;
+                  zt(k, 0, o, -+yt(s, 0, o, k), s);
+                  g = (g + 1) | 0;
+                }
+                Bt(k, 0, o, 1.0 / +At(k, 0, o), k);
+                h[(f + (i << 3)) >> 3] = 0.0;
+                i = (i + 1) | 0;
+              }
+              m = (n + -1) | 0;
+              i = 0;
+              while (1) {
+                if ((i | 0) >= (m | 0)) break;
+                a = (f + (i << 3)) | 0;
+                b = (i + 1) | 0;
+                j = +h[a >> 3];
+                g = i;
+                k = b;
+                while (1) {
+                  if ((k | 0) >= (n | 0)) break;
+                  l = +h[(f + (k << 3)) >> 3];
+                  s = j < l;
+                  j = s ? l : j;
+                  g = s ? k : g;
+                  k = (k + 1) | 0;
+                }
+                if ((g | 0) == (i | 0)) {
+                  i = b;
+                  continue;
+                }
+                k = (e + (i << 2)) | 0;
+                Ct(p, 0, o, c[k >> 2] | 0);
+                s = (e + (g << 2)) | 0;
+                Ct(c[k >> 2] | 0, 0, o, c[s >> 2] | 0);
+                Ct(c[s >> 2] | 0, 0, o, p);
+                h[(f + (g << 3)) >> 3] = +h[a >> 3];
+                h[a >> 3] = j;
+                i = b;
+              }
+              U1(p);
+              U1(q);
+              return ((d | 0) <= (r | 0)) | 0;
+            }
+            function yt(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0;
+              f = 0.0;
+              e = (1 - b + c) | 0;
+              d = (d + (b << 3)) | 0;
+              c = (a + (b << 3)) | 0;
+              while (1) {
+                if (!e) break;
+                f = +h[d >> 3] * +h[c >> 3] + f;
+                e = (e + -1) | 0;
+                d = (d + 8) | 0;
+                c = (c + 8) | 0;
+              }
+              return +f;
+            }
+            function zt(a, b, c, d, e) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = +d;
+              e = e | 0;
+              var f = 0;
+              f = (1 - b + c) | 0;
+              e = (e + (b << 3)) | 0;
+              c = (a + (b << 3)) | 0;
+              while (1) {
+                if (!f) break;
+                h[c >> 3] = +h[c >> 3] + +h[e >> 3] * d;
+                f = (f + -1) | 0;
+                e = (e + 8) | 0;
+                c = (c + 8) | 0;
+              }
+              return;
+            }
+            function At(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              return +(+C(+(+yt(a, b, c, a))));
+            }
+            function Bt(a, b, c, d, e) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = +d;
+              e = e | 0;
+              var f = 0;
+              f = (1 - b + c) | 0;
+              e = (e + (b << 3)) | 0;
+              c = (a + (b << 3)) | 0;
+              while (1) {
+                if (!f) break;
+                h[c >> 3] = +h[e >> 3] * d;
+                f = (f + -1) | 0;
+                e = (e + 8) | 0;
+                c = (c + 8) | 0;
+              }
+              return;
+            }
+            function Ct(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0;
+              e = (1 - b + c) | 0;
+              d = (d + (b << 3)) | 0;
+              c = (a + (b << 3)) | 0;
+              while (1) {
+                if (!e) break;
+                h[c >> 3] = +h[d >> 3];
+                e = (e + -1) | 0;
+                d = (d + 8) | 0;
+                c = (c + 8) | 0;
+              }
+              return;
+            }
+            function Dt(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0;
+              j = 0;
+              while (1) {
+                if ((j | 0) >= (b | 0)) break;
+                k = (a + (j << 2)) | 0;
+                g = 0.0;
+                i = 0;
+                while (1) {
+                  if ((i | 0) >= (d | 0)) break;
+                  g = +h[(e + (i << 3)) >> 3] * +h[((c[k >> 2] | 0) + (i << 3)) >> 3] + g;
+                  i = (i + 1) | 0;
+                }
+                h[(f + (j << 3)) >> 3] = g;
+                j = (j + 1) | 0;
+              }
+              return;
+            }
+            function Et(a, b, d, e, f, i) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              i = i | 0;
+              var j = 0,
+                k = 0,
+                l = 0.0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0.0;
+              k = c[i >> 2] | 0;
+              if (!k) {
+                o = d << 2;
+                j = T1(O(o, f) | 0) | 0;
+                o = T1(o) | 0;
+              } else {
+                o = d << 2;
+                j = W1(c[k >> 2] | 0, O(o, f) | 0) | 0;
+                o = W1(k, o) | 0;
+              }
+              c[i >> 2] = o;
+              k = 0;
+              while (1) {
+                if ((k | 0) >= (d | 0)) {
+                  i = 0;
+                  break;
+                }
+                c[(o + (k << 2)) >> 2] = j;
+                k = (k + 1) | 0;
+                j = (j + (f << 2)) | 0;
+              }
+              while (1) {
+                if ((i | 0) >= (d | 0)) break;
+                m = (a + (i << 2)) | 0;
+                n = (o + (i << 2)) | 0;
+                k = 0;
+                while (1) {
+                  if ((k | 0) < (f | 0)) {
+                    j = 0;
+                    l = 0.0;
+                  } else break;
+                  while (1) {
+                    if ((j | 0) >= (e | 0)) break;
+                    p = +h[((c[m >> 2] | 0) + (j << 3)) >> 3] * +g[((c[(b + (j << 2)) >> 2] | 0) + (k << 2)) >> 2] + l;
+                    j = (j + 1) | 0;
+                    l = p;
+                  }
+                  g[((c[n >> 2] | 0) + (k << 2)) >> 2] = l;
+                  k = (k + 1) | 0;
+                }
+                i = (i + 1) | 0;
+              }
+              return;
+            }
+            function Ft(a, b, d, e, f, i) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              i = i | 0;
+              var j = 0,
+                k = 0,
+                l = 0.0,
+                m = 0,
+                n = 0,
+                o = 0;
+              k = c[i >> 2] | 0;
+              if (!k) {
+                j = T1(O(d << 3, f) | 0) | 0;
+                o = T1(d << 2) | 0;
+              } else {
+                j = W1(c[k >> 2] | 0, O(d << 3, f) | 0) | 0;
+                o = W1(k, d << 2) | 0;
+              }
+              c[i >> 2] = o;
+              k = 0;
+              while (1) {
+                if ((k | 0) >= (d | 0)) {
+                  i = 0;
+                  break;
+                }
+                c[(o + (k << 2)) >> 2] = j;
+                k = (k + 1) | 0;
+                j = (j + (f << 3)) | 0;
+              }
+              while (1) {
+                if ((i | 0) >= (d | 0)) break;
+                m = (a + (i << 2)) | 0;
+                n = (o + (i << 2)) | 0;
+                k = 0;
+                while (1) {
+                  if ((k | 0) < (f | 0)) {
+                    l = 0.0;
+                    j = 0;
+                  } else break;
+                  while (1) {
+                    if ((j | 0) >= (e | 0)) break;
+                    l = +h[((c[m >> 2] | 0) + (j << 3)) >> 3] * +g[((c[(b + (j << 2)) >> 2] | 0) + (k << 2)) >> 2] + l;
+                    j = (j + 1) | 0;
+                  }
+                  h[((c[n >> 2] | 0) + (k << 3)) >> 3] = l;
+                  k = (k + 1) | 0;
+                }
+                i = (i + 1) | 0;
+              }
+              return;
+            }
+            function Gt(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var i = 0,
+                j = 0,
+                k = 0.0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              j = c[f >> 2] | 0;
+              if (!j) {
+                i = T1(O((d * 20) | 0, e) | 0) | 0;
+                q = T1(d << 2) | 0;
+              } else {
+                i = W1(c[j >> 2] | 0, O((d * 20) | 0, e) | 0) | 0;
+                q = W1(j, d << 2) | 0;
+              }
+              c[f >> 2] = q;
+              j = 0;
+              while (1) {
+                if ((j | 0) >= (d | 0)) {
+                  f = 0;
+                  break;
+                }
+                c[(q + (j << 2)) >> 2] = i;
+                j = (j + 1) | 0;
+                i = (i + (e << 2)) | 0;
+              }
+              while (1) {
+                if ((f | 0) >= (d | 0)) break;
+                l = c[(a + ((f * 20) | 0) + 4) >> 2] | 0;
+                m = c[(a + ((f * 20) | 0) + 8) >> 2] | 0;
+                n = c[(a + ((f * 20) | 0)) >> 2] | 0;
+                o = (q + (f << 2)) | 0;
+                i = 0;
+                while (1) {
+                  if ((i | 0) >= (e | 0)) break;
+                  p = (b + (i << 2)) | 0;
+                  k = 0.0;
+                  j = 0;
+                  while (1) {
+                    if ((j | 0) >= (n | 0)) break;
+                    k = +h[((c[p >> 2] | 0) + (c[(l + (j << 2)) >> 2] << 3)) >> 3] * +g[(m + (j << 2)) >> 2] + k;
+                    j = (j + 1) | 0;
+                  }
+                  g[((c[o >> 2] | 0) + (i << 2)) >> 2] = k;
+                  i = (i + 1) | 0;
+                }
+                f = (f + 1) | 0;
+              }
+              return;
+            }
+            function Ht(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0,
+                d = 0,
+                e = 0;
+              c = 0.0;
+              d = b;
+              e = a;
+              while (1) {
+                if (!e) break;
+                c = +h[d >> 3] + c;
+                d = (d + 8) | 0;
+                e = (e + -1) | 0;
+              }
+              c = c / +(a | 0);
+              while (1) {
+                if (!a) break;
+                h[b >> 3] = +h[b >> 3] - c;
+                b = (b + 8) | 0;
+                a = (a + -1) | 0;
+              }
+              return;
+            }
+            function It(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0;
+              c = 0;
+              while (1) {
+                if ((c | 0) >= (a | 0)) break;
+                h[(b + (c << 3)) >> 3] = +((x5() | 0) % 500 | 0 | 0);
+                c = (c + 1) | 0;
+              }
+              Ht(a, b);
+              return;
+            }
+            function Jt(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              j = 0;
+              while (1) {
+                if ((j | 0) >= (b | 0)) break;
+                k = c[(a + ((j * 20) | 0)) >> 2] | 0;
+                l = (a + ((j * 20) | 0) + 8) | 0;
+                m = (a + ((j * 20) | 0) + 4) | 0;
+                f = 0.0;
+                i = 0;
+                while (1) {
+                  if ((i | 0) >= (k | 0)) break;
+                  f =
+                    +h[(d + (c[((c[m >> 2] | 0) + (i << 2)) >> 2] << 3)) >> 3] * +g[((c[l >> 2] | 0) + (i << 2)) >> 2] +
+                    f;
+                  i = (i + 1) | 0;
+                }
+                h[(e + (j << 3)) >> 3] = f;
+                j = (j + 1) | 0;
+              }
+              return;
+            }
+            function Kt(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0.0,
+                i = 0,
+                j = 0,
+                k = 0;
+              j = 0;
+              while (1) {
+                if ((j | 0) >= (b | 0)) break;
+                k = (a + (j << 2)) | 0;
+                f = 0.0;
+                i = 0;
+                while (1) {
+                  if ((i | 0) == (b | 0)) break;
+                  f = +h[(d + (i << 3)) >> 3] * +g[((c[k >> 2] | 0) + (i << 2)) >> 2] + f;
+                  i = (i + 1) | 0;
+                }
+                h[(e + (j << 3)) >> 3] = f;
+                j = (j + 1) | 0;
+              }
+              return;
+            }
+            function Lt(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (a | 0)) break;
+                h[(d + (e << 3)) >> 3] = +h[(b + (e << 3)) >> 3] - +h[(c + (e << 3)) >> 3];
+                e = (e + 1) | 0;
+              }
+              return;
+            }
+            function Mt(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (a | 0)) break;
+                h[(d + (e << 3)) >> 3] = +h[(c + (e << 3)) >> 3] + +h[(b + (e << 3)) >> 3];
+                e = (e + 1) | 0;
+              }
+              return;
+            }
+            function Nt(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = +c;
+              d = d | 0;
+              var e = 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (a | 0)) break;
+                h[(d + (e << 3)) >> 3] = +h[(b + (e << 3)) >> 3] * c;
+                e = (e + 1) | 0;
+              }
+              return;
+            }
+            function Ot(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0;
+              d = 0;
+              while (1) {
+                if ((d | 0) >= (a | 0)) break;
+                h[(c + (d << 3)) >> 3] = +h[(b + (d << 3)) >> 3];
+                d = (d + 1) | 0;
+              }
+              return;
+            }
+            function Pt(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0,
+                e = 0;
+              d = 0.0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (a | 0)) break;
+                d = +h[(c + (e << 3)) >> 3] * +h[(b + (e << 3)) >> 3] + d;
+                e = (e + 1) | 0;
+              }
+              return +d;
+            }
+            function Qt(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0,
+                d = 0.0,
+                e = 0.0;
+              c = 0;
+              d = -1e50;
+              while (1) {
+                if ((c | 0) >= (a | 0)) break;
+                e = +B(+(+h[(b + (c << 3)) >> 3]));
+                c = (c + 1) | 0;
+                d = e > d ? e : d;
+              }
+              return +d;
+            }
+            function Rt(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0.0,
+                i = 0,
+                j = 0;
+              j = 0;
+              while (1) {
+                if ((j | 0) < (b | 0)) {
+                  g = 0.0;
+                  i = 0;
+                } else break;
+                while (1) {
+                  if ((i | 0) >= (d | 0)) break;
+                  g = +h[(e + (i << 3)) >> 3] * +h[((c[(a + (i << 2)) >> 2] | 0) + (j << 3)) >> 3] + g;
+                  i = (i + 1) | 0;
+                }
+                h[(f + (j << 3)) >> 3] = g;
+                j = (j + 1) | 0;
+              }
+              return;
+            }
+            function St(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0,
+                d = 0,
+                e = 0;
+              c = 0.0;
+              d = b;
+              e = a;
+              while (1) {
+                if (!e) break;
+                c = +g[d >> 2] + c;
+                d = (d + 4) | 0;
+                e = (e + -1) | 0;
+              }
+              c = c / +(a | 0);
+              while (1) {
+                if (!a) break;
+                g[b >> 2] = +g[b >> 2] - c;
+                b = (b + 4) | 0;
+                a = (a + -1) | 0;
+              }
+              return;
+            }
+            function Tt(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0.0,
+                m = 0,
+                n = 0.0,
+                o = 0,
+                p = 0.0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (b | 0)) {
+                  h = 0;
+                  j = 0;
+                  m = b;
+                  break;
+                }
+                g[(d + (e << 2)) >> 2] = 0.0;
+                e = (e + 1) | 0;
+              }
+              while (1) {
+                if ((j | 0) >= (b | 0)) break;
+                l = +g[(c + (j << 2)) >> 2];
+                k = (j + 1) | 0;
+                f = +g[(a + (h << 2)) >> 2] * l;
+                i = k;
+                e = h;
+                while (1) {
+                  e = (e + 1) | 0;
+                  if ((i | 0) == (b | 0)) break;
+                  p = +g[(a + (e << 2)) >> 2];
+                  n = +g[(c + (i << 2)) >> 2] * p + f;
+                  o = (d + (i << 2)) | 0;
+                  g[o >> 2] = +g[o >> 2] + p * l;
+                  f = n;
+                  i = (i + 1) | 0;
+                }
+                o = (d + (j << 2)) | 0;
+                g[o >> 2] = +g[o >> 2] + f;
+                h = (h + m) | 0;
+                j = k;
+                m = (m + -1) | 0;
+              }
+              return;
+            }
+            function Ut(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (a | 0)) break;
+                g[(d + (e << 2)) >> 2] = +g[(b + (e << 2)) >> 2] - +g[(c + (e << 2)) >> 2];
+                e = (e + 1) | 0;
+              }
+              return;
+            }
+            function Vt(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (a | 0)) break;
+                g[(d + (e << 2)) >> 2] = +g[(c + (e << 2)) >> 2] + +g[(b + (e << 2)) >> 2];
+                e = (e + 1) | 0;
+              }
+              return;
+            }
+            function Wt(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = +c;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (a | 0)) break;
+                f = (b + (e << 2)) | 0;
+                g[f >> 2] = +g[(d + (e << 2)) >> 2] * c + +g[f >> 2];
+                e = (e + 1) | 0;
+              }
+              return;
+            }
+            function Xt(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = +c;
+              d = d | 0;
+              var e = 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (a | 0)) break;
+                g[(d + (e << 2)) >> 2] = +g[(b + (e << 2)) >> 2] * c;
+                e = (e + 1) | 0;
+              }
+              return;
+            }
+            function Yt(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (a | 0)) break;
+                c[(d + (e << 2)) >> 2] = c[(b + (e << 2)) >> 2];
+                e = (e + 1) | 0;
+              }
+              return;
+            }
+            function Zt(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0,
+                e = 0;
+              d = 0.0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (a | 0)) break;
+                d = d + +g[(c + (e << 2)) >> 2] * +g[(b + (e << 2)) >> 2];
+                e = (e + 1) | 0;
+              }
+              return +d;
+            }
+            function _t(a, b, c) {
+              a = a | 0;
+              b = +b;
+              c = c | 0;
+              var d = 0;
+              d = 0;
+              while (1) {
+                if ((d | 0) >= (a | 0)) break;
+                h[(c + (d << 3)) >> 3] = b;
+                d = (d + 1) | 0;
+              }
+              return;
+            }
+            function $t(a, b, c) {
+              a = a | 0;
+              b = +b;
+              c = c | 0;
+              var d = 0;
+              d = 0;
+              while (1) {
+                if ((d | 0) >= (a | 0)) break;
+                g[(c + (d << 2)) >> 2] = b;
+                d = (d + 1) | 0;
+              }
+              return;
+            }
+            function au(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0,
+                d = 0,
+                e = 0.0;
+              c = -1000000015047466219876688.0e6;
+              d = 0;
+              while (1) {
+                if ((d | 0) >= (a | 0)) break;
+                e = +B(+(+g[(b + (d << 2)) >> 2]));
+                c = e > c ? e : c;
+                d = (d + 1) | 0;
+              }
+              return +c;
+            }
+            function bu(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0,
+                d = 0,
+                e = 0.0;
+              c = 0;
+              while (1) {
+                if ((c | 0) >= (a | 0)) break;
+                d = (b + (c << 2)) | 0;
+                e = +g[d >> 2];
+                g[d >> 2] = e * e;
+                c = (c + 1) | 0;
+              }
+              return;
+            }
+            function cu(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0,
+                d = 0,
+                e = 0.0;
+              c = 0;
+              while (1) {
+                if ((c | 0) >= (a | 0)) break;
+                d = (b + (c << 2)) | 0;
+                e = +g[d >> 2];
+                if (e != 0.0) g[d >> 2] = 1.0 / e;
+                c = (c + 1) | 0;
+              }
+              return;
+            }
+            function du(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0,
+                e = 0.0;
+              d = 0;
+              while (1) {
+                if ((d | 0) >= (a | 0)) break;
+                e = +g[(b + (d << 2)) >> 2];
+                if (e >= 0.0) g[(c + (d << 2)) >> 2] = +C(+e);
+                d = (d + 1) | 0;
+              }
+              return;
+            }
+            function eu(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0,
+                d = 0,
+                e = 0.0;
+              c = 0;
+              while (1) {
+                if ((c | 0) >= (a | 0)) break;
+                d = (b + (c << 2)) | 0;
+                e = +g[d >> 2];
+                if (e > 0.0) g[d >> 2] = 1.0 / +C(+e);
+                c = (c + 1) | 0;
+              }
+              return;
+            }
+            function fu(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              c[a >> 2] = 0;
+              if (b & 3)
+                if (!(4 % (b >>> 0) | 0)) b = 4;
+                else b = O((4 / ((gu(b) | 0) >>> 0)) | 0, b) | 0;
+              c[(a + 8) >> 2] = b;
+              a = (a + 4) | 0;
+              b = c[a >> 2] | 0;
+              a: do
+                if (b | 0)
+                  while (1) {
+                    if (!b) break a;
+                    d = c[b >> 2] | 0;
+                    U1(c[(b + 4) >> 2] | 0);
+                    U1(b);
+                    b = d;
+                  }
+              while (0);
+              c[a >> 2] = 0;
+              return;
+            }
+            function gu(a) {
+              a = a | 0;
+              var b = 0,
+                c = 0;
+              c = 4;
+              a: while (1) {
+                b = c;
+                while (1) {
+                  if ((b | 0) == (a | 0)) break a;
+                  if ((b | 0) <= (a | 0)) break;
+                  b = (b - a) | 0;
+                }
+                c = b;
+                a = (a - b) | 0;
+              }
+              return a | 0;
+            }
+            function hu(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              b = c[a >> 2] | 0;
+              if (!b) {
+                d = c[(a + 8) >> 2] | 0;
+                e = KK(8) | 0;
+                f = KK(O(c[46855] | 0, d) | 0) | 0;
+                c[(e + 4) >> 2] = f;
+                b = 0;
+                while (1) {
+                  if ((b | 0) >= (c[46855] | 0)) break;
+                  iu((f + (O(b, d) | 0)) | 0, a);
+                  b = (b + 1) | 0;
+                }
+                b = (a + 4) | 0;
+                c[e >> 2] = c[b >> 2];
+                c[b >> 2] = e;
+                b = c[a >> 2] | 0;
+              }
+              c[a >> 2] = c[b >> 2];
+              return b | 0;
+            }
+            function iu(a, b) {
+              a = a | 0;
+              b = b | 0;
+              c[a >> 2] = c[b >> 2];
+              c[b >> 2] = a;
+              return;
+            }
+            function ju(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              m = JK(b << 3) | 0;
+              l = (a + 8) | 0;
+              f = c[l >> 2] | 0;
+              ku(a, b, m);
+              It(b, d);
+              h = 0;
+              i = 0;
+              while (1) {
+                if ((i | 0) >= (b | 0)) break;
+                h = ((c[(a + ((i * 20) | 0)) >> 2] | 0) + h) | 0;
+                i = (i + 1) | 0;
+              }
+              h = KK(h << 2) | 0;
+              j = 0;
+              while (1) {
+                if ((j | 0) >= (b | 0)) break;
+                c[(a + ((j * 20) | 0) + 8) >> 2] = h;
+                k = c[(a + ((j * 20) | 0)) >> 2] | 0;
+                g[h >> 2] = +((1 - k) | 0);
+                i = 1;
+                while (1) {
+                  if ((i | 0) >= (k | 0)) break;
+                  g[(h + (i << 2)) >> 2] = 1.0;
+                  i = (i + 1) | 0;
+                }
+                h = (h + (k << 2)) | 0;
+                j = (j + 1) | 0;
+              }
+              i = yr(a, d, m, b, 0.001, e) | 0;
+              U1(c[l >> 2] | 0);
+              h = 0;
+              while (1) {
+                if ((h | 0) >= (b | 0)) break;
+                c[(a + ((h * 20) | 0) + 8) >> 2] = f;
+                f = (f + (c[(a + ((h * 20) | 0)) >> 2] << 2)) | 0;
+                h = (h + 1) | 0;
+              }
+              U1(m);
+              return (i >>> 31) | 0;
+            }
+            function ku(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              k = (a + 16) | 0;
+              i = 0;
+              while (1) {
+                if ((i | 0) >= (b | 0)) break;
+                if (c[k >> 2] | 0) {
+                  l = c[(a + ((i * 20) | 0)) >> 2] | 0;
+                  m = (a + ((i * 20) | 0) + 8) | 0;
+                  j = (a + ((i * 20) | 0) + 16) | 0;
+                  e = 0.0;
+                  f = 1;
+                  while (1) {
+                    if ((f | 0) >= (l | 0)) break;
+                    e = e + +g[((c[j >> 2] | 0) + (f << 2)) >> 2] * +g[((c[m >> 2] | 0) + (f << 2)) >> 2];
+                    f = (f + 1) | 0;
+                  }
+                  h[(d + (i << 3)) >> 3] = e;
+                }
+                i = (i + 1) | 0;
+              }
+              return;
+            }
+            function lu(a, b, d, e, f, g, h, i, j) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = +h;
+              i = i | 0;
+              j = j | 0;
+              a = l;
+              l = (l + 16) | 0;
+              if (!(c[46913] | 0)) {
+                c[46913] = 1;
+                gA(1, 93820, a) | 0;
+              }
+              l = a;
+              return;
+            }
+            function mu(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0.0;
+              r = KK(f << 2) | 0;
+              i = b << 3;
+              g = 0;
+              while (1) {
+                if ((g | 0) >= (f | 0)) break;
+                c[(r + (g << 2)) >> 2] = KK(i) | 0;
+                g = (g + 1) | 0;
+              }
+              p = KK(f << 3) | 0;
+              q = KK(b << 2) | 0;
+              g = KK(O(i, b) | 0) | 0;
+              i = 0;
+              while (1) {
+                if ((i | 0) >= (b | 0)) break;
+                c[(q + (i << 2)) >> 2] = g;
+                g = (g + (b << 3)) | 0;
+                i = (i + 1) | 0;
+              }
+              k = 0;
+              o = 1;
+              while (1) {
+                if ((k | 0) >= (b | 0)) break;
+                l = (a + (k << 2)) | 0;
+                m = (q + (k << 2)) | 0;
+                i = 0;
+                while (1) {
+                  if ((i | 0) == (o | 0)) break;
+                  n = (a + (i << 2)) | 0;
+                  g = 0;
+                  j = 0.0;
+                  while (1) {
+                    if ((g | 0) >= (d | 0)) break;
+                    s =
+                      j + +(O(c[((c[n >> 2] | 0) + (g << 2)) >> 2] | 0, c[((c[l >> 2] | 0) + (g << 2)) >> 2] | 0) | 0);
+                    g = (g + 1) | 0;
+                    j = s;
+                  }
+                  h[((c[(q + (i << 2)) >> 2] | 0) + (k << 3)) >> 3] = j;
+                  h[((c[m >> 2] | 0) + (i << 3)) >> 3] = j;
+                  i = (i + 1) | 0;
+                }
+                k = (k + 1) | 0;
+                o = (o + 1) | 0;
+              }
+              xt(q, b, f, r, p, 1) | 0;
+              i = 0;
+              while (1) {
+                if ((i | 0) >= (f | 0)) {
+                  g = 0;
+                  break;
+                }
+                l = (r + (i << 2)) | 0;
+                m = (e + (i << 2)) | 0;
+                k = 0;
+                while (1) {
+                  if ((k | 0) < (d | 0)) {
+                    g = 0;
+                    j = 0.0;
+                  } else break;
+                  while (1) {
+                    if ((g | 0) >= (b | 0)) break;
+                    s =
+                      +h[((c[l >> 2] | 0) + (g << 3)) >> 3] * +(c[((c[(a + (g << 2)) >> 2] | 0) + (k << 2)) >> 2] | 0) +
+                      j;
+                    g = (g + 1) | 0;
+                    j = s;
+                  }
+                  h[((c[m >> 2] | 0) + (k << 3)) >> 3] = j;
+                  k = (k + 1) | 0;
+                }
+                i = (i + 1) | 0;
+              }
+              while (1) {
+                if ((g | 0) >= (f | 0)) break;
+                U1(c[(r + (g << 2)) >> 2] | 0);
+                g = (g + 1) | 0;
+              }
+              U1(r);
+              U1(p);
+              U1(c[q >> 2] | 0);
+              U1(q);
+              return;
+            }
+            function nu(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              f = l;
+              l = (l + 32) | 0;
+              g = (f + 16) | 0;
+              j = (f + 20) | 0;
+              i = (f + 12) | 0;
+              h = (f + 8) | 0;
+              c[g >> 2] = e;
+              c[i >> 2] = 0;
+              c[h >> 2] = 0;
+              iy(c[a >> 2] | 0, d, d << 2, j);
+              Gt(c[j >> 2] | 0, a, d, b, i);
+              Ft(a, c[i >> 2] | 0, b, d, b, h);
+              U1(c[c[i >> 2] >> 2] | 0);
+              U1(c[i >> 2] | 0);
+              e = (xt(c[h >> 2] | 0, b, 1, g, f, 1) | 0) & 255;
+              l = f;
+              return e | 0;
+            }
+            function ou() {
+              c[46914] = 0;
+              U1(c[46915] | 0);
+              U1(c[46916] | 0);
+              U1(c[46917] | 0);
+              c[46915] = 0;
+              c[46916] = 0;
+              c[46917] = 0;
+              return;
+            }
+            function pu(a) {
+              a = a | 0;
+              U1(c[(a + 36) >> 2] | 0);
+              return;
+            }
+            function qu(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = +e;
+              f = +f;
+              var g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0.0,
+                t = 0.0,
+                u = 0.0,
+                v = 0.0;
+              r = l;
+              l = (l + 80) | 0;
+              o = (r + 64) | 0;
+              q = (r + 68) | 0;
+              i = (r + 48) | 0;
+              j = (r + 32) | 0;
+              k = (r + 16) | 0;
+              m = r;
+              n = (d + 16) | 0;
+              g = c[n >> 2] | 0;
+              a: do
+                if (!(c[(g + 212) >> 2] | 0))
+                  switch (WM(d) | 0) {
+                    case 1: {
+                      g = c[n >> 2] | 0;
+                      j = c[(g + 12) >> 2] | 0;
+                      k = c[(j + 8) >> 2] | 0;
+                      c[q >> 2] = k;
+                      g = c[c[(g + 8) >> 2] >> 2] | 0;
+                      switch (a[g >> 0] | 0) {
+                        case 98: {
+                          if (!(s2(g, 108236) | 0)) p = 11;
+                          else p = 8;
+                          break;
+                        }
+                        case 112: {
+                          if ((s2(g, 105721) | 0) == 0 ? (ru(c[(j + 44) >> 2] | 0, k) | 0) != 0 : 0) p = 11;
+                          else p = 8;
+                          break;
+                        }
+                        default:
+                          p = 8;
+                      }
+                      do
+                        if ((p | 0) == 8)
+                          if ((k | 0) < 3) {
+                            c[(b + 40) >> 2] = (c[j >> 2] | 0) == 0 ? 0 : 2;
+                            p = 17;
+                            break;
+                          } else {
+                            g = (b + 40) | 0;
+                            c[g >> 2] = 0;
+                            break;
+                          }
+                        else if ((p | 0) == 11) {
+                          g = (b + 40) | 0;
+                          c[g >> 2] = 1;
+                          if ((k | 0) <= 2) p = 17;
+                        }
+                      while (0);
+                      if ((p | 0) == 17) {
+                        i = su(d, q, e, f) | 0;
+                        p = 21;
+                        break a;
+                      }
+                      i = KK(k << 4) | 0;
+                      j = (j + 44) | 0;
+                      if ((c[g >> 2] | 0) == 1) {
+                        p = c[j >> 2] | 0;
+                        s = e;
+                        h[i >> 3] = +h[p >> 3] * 0.013888888888888888 + s;
+                        e = f;
+                        h[(i + 8) >> 3] = +h[(p + 8) >> 3] * 0.013888888888888888 + e;
+                        h[(i + 16) >> 3] = +h[(p + 16) >> 3] * 0.013888888888888888 - s;
+                        h[(i + 24) >> 3] = +h[(p + 24) >> 3] * 0.013888888888888888 + e;
+                        h[(i + 32) >> 3] = +h[(p + 32) >> 3] * 0.013888888888888888 - s;
+                        h[(i + 40) >> 3] = +h[(p + 40) >> 3] * 0.013888888888888888 - e;
+                        h[(i + 48) >> 3] = +h[(p + 48) >> 3] * 0.013888888888888888 + s;
+                        h[(i + 56) >> 3] = +h[(p + 56) >> 3] * 0.013888888888888888 - e;
+                        p = 21;
+                        break a;
+                      }
+                      g = 0;
+                      while (1) {
+                        if ((g | 0) >= (k | 0)) {
+                          p = 21;
+                          break a;
+                        }
+                        p = c[j >> 2] | 0;
+                        u = +h[(p + (g << 4)) >> 3];
+                        s = +h[(p + (g << 4) + 8) >> 3];
+                        t = +C(+(s * s + u * u));
+                        h[(i + (g << 4)) >> 3] = (e / t + 1.0) * u * 0.013888888888888888;
+                        h[(i + (g << 4) + 8) >> 3] = (f / t + 1.0) * s * 0.013888888888888888;
+                        g = (g + 1) | 0;
+                      }
+                    }
+                    case 2: {
+                      c[q >> 2] = 4;
+                      p = KK(64) | 0;
+                      d = c[((c[n >> 2] | 0) + 12) >> 2] | 0;
+                      v = +h[(d + 32) >> 3];
+                      t = +h[(d + 40) >> 3];
+                      o = ~~+h[(d + 16) >> 3];
+                      d = ~~+h[(d + 24) >> 3];
+                      u = -e;
+                      s = -f;
+                      tu(i, o, d, u, s);
+                      c[p >> 2] = c[i >> 2];
+                      c[(p + 4) >> 2] = c[(i + 4) >> 2];
+                      c[(p + 8) >> 2] = c[(i + 8) >> 2];
+                      c[(p + 12) >> 2] = c[(i + 12) >> 2];
+                      i = (p + 16) | 0;
+                      n = ~~v;
+                      tu(j, n, d, e, s);
+                      c[i >> 2] = c[j >> 2];
+                      c[(i + 4) >> 2] = c[(j + 4) >> 2];
+                      c[(i + 8) >> 2] = c[(j + 8) >> 2];
+                      c[(i + 12) >> 2] = c[(j + 12) >> 2];
+                      i = (p + 32) | 0;
+                      d = ~~t;
+                      tu(k, n, d, e, f);
+                      c[i >> 2] = c[k >> 2];
+                      c[(i + 4) >> 2] = c[(k + 4) >> 2];
+                      c[(i + 8) >> 2] = c[(k + 8) >> 2];
+                      c[(i + 12) >> 2] = c[(k + 12) >> 2];
+                      i = (p + 48) | 0;
+                      tu(m, o, d, u, f);
+                      c[i >> 2] = c[m >> 2];
+                      c[(i + 4) >> 2] = c[(m + 4) >> 2];
+                      c[(i + 8) >> 2] = c[(m + 8) >> 2];
+                      c[(i + 12) >> 2] = c[(m + 12) >> 2];
+                      c[(b + 40) >> 2] = 1;
+                      i = p;
+                      p = 21;
+                      break a;
+                    }
+                    case 3: {
+                      c[(b + 40) >> 2] = 2;
+                      i = su(d, q, e, f) | 0;
+                      p = 21;
+                      break a;
+                    }
+                    default: {
+                      c[o >> 2] = c[c[((c[n >> 2] | 0) + 8) >> 2] >> 2];
+                      gA(1, 93883, o) | 0;
+                      g = 1;
+                      break a;
+                    }
+                  }
+                else {
+                  c[q >> 2] = 4;
+                  u = +h[(g + 32) >> 3] * 0.5 + e;
+                  v = +h[(g + 40) >> 3] * 0.5 + f;
+                  c[(b + 40) >> 2] = 1;
+                  i = KK(64) | 0;
+                  h[i >> 3] = u;
+                  h[(i + 8) >> 3] = v;
+                  t = -u;
+                  h[(i + 16) >> 3] = t;
+                  h[(i + 24) >> 3] = v;
+                  h[(i + 32) >> 3] = t;
+                  v = -v;
+                  h[(i + 40) >> 3] = v;
+                  h[(i + 48) >> 3] = u;
+                  h[(i + 56) >> 3] = v;
+                  p = 21;
+                }
+              while (0);
+              if ((p | 0) == 21) {
+                c[(b + 36) >> 2] = i;
+                g = c[q >> 2] | 0;
+                c[(b + 32) >> 2] = g;
+                uu(i, g, b, (b + 16) | 0);
+                if ((g | 0) > (c[46914] | 0)) {
+                  c[46914] = g;
+                  g = 0;
+                } else g = 0;
+              }
+              l = r;
+              return g | 0;
+            }
+            function ru(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0,
+                d = 0.0;
+              do
+                if ((b | 0) == 4) {
+                  c = +h[(a + 8) >> 3];
+                  b = (a + 16) | 0;
+                  d = +h[(a + 24) >> 3];
+                  if (c == d) {
+                    if (!(+h[(a + 40) >> 3] == +h[(a + 56) >> 3])) {
+                      b = 0;
+                      break;
+                    }
+                    if (!(+h[a >> 3] == +h[(a + 48) >> 3])) {
+                      b = 0;
+                      break;
+                    }
+                    b = +h[b >> 3] == +h[(a + 32) >> 3];
+                    break;
+                  }
+                  if (
+                    (+h[a >> 3] == +h[b >> 3] ? +h[(a + 32) >> 3] == +h[(a + 48) >> 3] : 0) ? c == +h[(a + 56) >> 3] : 0
+                  )
+                    b = d == +h[(a + 40) >> 3];
+                  else b = 0;
+                } else b = 0;
+              while (0);
+              return (b & 1) | 0;
+            }
+            function su(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = +d;
+              e = +e;
+              var f = 0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0.0,
+                l = 0;
+              f = QA(a, 102705) | 0;
+              if (!f) f = 0;
+              else f = q5(f) | 0;
+              i = (f | 0) < 3 ? 20 : f;
+              j = KK(i << 4) | 0;
+              a = (a + 16) | 0;
+              g = 1.0 / +(i | 0);
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (i | 0)) break;
+                l = c[a >> 2] | 0;
+                k = g * +(f | 0) * 6.283185307179586;
+                h[(j + (f << 4)) >> 3] = (+h[(l + 32) >> 3] * 0.5 + d) * +E(+k);
+                h[(j + (f << 4) + 8) >> 3] = (+h[(l + 40) >> 3] * 0.5 + e) * +F(+k);
+                f = (f + 1) | 0;
+              }
+              c[b >> 2] = i;
+              return j | 0;
+            }
+            function tu(a, b, c, d, e) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = +d;
+              e = +e;
+              h[a >> 3] = +(b | 0) * 0.013888888888888888 + d;
+              h[(a + 8) >> 3] = +(c | 0) * 0.013888888888888888 + e;
+              return;
+            }
+            function uu(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                g = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0,
+                l = 0.0,
+                m = 0.0;
+              j = +h[a >> 3];
+              i = +h[(a + 8) >> 3];
+              e = 1;
+              f = i;
+              g = j;
+              while (1) {
+                if ((e | 0) >= (b | 0)) break;
+                k = (a + 16) | 0;
+                l = +h[k >> 3];
+                m = +h[(a + 24) >> 3];
+                e = (e + 1) | 0;
+                f = m > f ? m : f;
+                g = l > g ? l : g;
+                i = m < i ? m : i;
+                j = l < j ? l : j;
+                a = k;
+              }
+              h[c >> 3] = j;
+              h[(c + 8) >> 3] = i;
+              h[d >> 3] = g;
+              h[(d + 8) >> 3] = f;
+              return;
+            }
+            function vu(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = +e;
+              f = +f;
+              var g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0.0,
+                t = 0.0,
+                u = 0.0,
+                v = 0.0;
+              r = l;
+              l = (l + 80) | 0;
+              n = (r + 64) | 0;
+              p = (r + 68) | 0;
+              i = (r + 48) | 0;
+              j = (r + 32) | 0;
+              k = (r + 16) | 0;
+              m = r;
+              o = (d + 16) | 0;
+              g = c[o >> 2] | 0;
+              a: do
+                if (!(c[(g + 212) >> 2] | 0))
+                  switch (WM(d) | 0) {
+                    case 1: {
+                      m = c[((c[o >> 2] | 0) + 12) >> 2] | 0;
+                      n = (m + 8) | 0;
+                      k = c[n >> 2] | 0;
+                      c[p >> 2] = k;
+                      b: do
+                        if ((k | 0) > 2) {
+                          i = KK(k << 4) | 0;
+                          j = (m + 44) | 0;
+                          g = 0;
+                          while (1) {
+                            if ((g | 0) >= (k | 0)) break b;
+                            d = c[j >> 2] | 0;
+                            h[(i + (g << 4)) >> 3] = +h[(d + (g << 4)) >> 3] * 0.013888888888888888;
+                            h[(i + (g << 4) + 8) >> 3] = +h[(d + (g << 4) + 8) >> 3] * 0.013888888888888888;
+                            g = (g + 1) | 0;
+                          }
+                        } else i = su(d, p, 0.0, 0.0) | 0;
+                      while (0);
+                      g = c[c[((c[o >> 2] | 0) + 8) >> 2] >> 2] | 0;
+                      switch (a[g >> 0] | 0) {
+                        case 98: {
+                          if (!(s2(g, 108236) | 0)) g = 1;
+                          else q = 13;
+                          break;
+                        }
+                        case 112: {
+                          if ((s2(g, 105721) | 0) == 0 ? (ru(i, c[p >> 2] | 0) | 0) != 0 : 0) g = 1;
+                          else q = 13;
+                          break;
+                        }
+                        default:
+                          q = 13;
+                      }
+                      do
+                        if ((q | 0) == 13) {
+                          if ((c[n >> 2] | 0) < 3 ? c[m >> 2] | 0 : 0) {
+                            g = 2;
+                            break;
+                          }
+                          g = 0;
+                        }
+                      while (0);
+                      c[(b + 40) >> 2] = g;
+                      q = 20;
+                      break a;
+                    }
+                    case 2: {
+                      c[p >> 2] = 4;
+                      q = KK(64) | 0;
+                      o = c[((c[o >> 2] | 0) + 12) >> 2] | 0;
+                      t = +h[(o + 16) >> 3];
+                      v = +h[(o + 24) >> 3];
+                      u = +h[(o + 32) >> 3];
+                      s = +h[(o + 40) >> 3];
+                      wu(i, t, v);
+                      c[q >> 2] = c[i >> 2];
+                      c[(q + 4) >> 2] = c[(i + 4) >> 2];
+                      c[(q + 8) >> 2] = c[(i + 8) >> 2];
+                      c[(q + 12) >> 2] = c[(i + 12) >> 2];
+                      i = (q + 16) | 0;
+                      wu(j, u, v);
+                      c[i >> 2] = c[j >> 2];
+                      c[(i + 4) >> 2] = c[(j + 4) >> 2];
+                      c[(i + 8) >> 2] = c[(j + 8) >> 2];
+                      c[(i + 12) >> 2] = c[(j + 12) >> 2];
+                      i = (q + 32) | 0;
+                      wu(k, u, s);
+                      c[i >> 2] = c[k >> 2];
+                      c[(i + 4) >> 2] = c[(k + 4) >> 2];
+                      c[(i + 8) >> 2] = c[(k + 8) >> 2];
+                      c[(i + 12) >> 2] = c[(k + 12) >> 2];
+                      i = (q + 48) | 0;
+                      wu(m, t, s);
+                      c[i >> 2] = c[m >> 2];
+                      c[(i + 4) >> 2] = c[(m + 4) >> 2];
+                      c[(i + 8) >> 2] = c[(m + 8) >> 2];
+                      c[(i + 12) >> 2] = c[(m + 12) >> 2];
+                      c[(b + 40) >> 2] = 1;
+                      i = q;
+                      q = 20;
+                      break a;
+                    }
+                    case 3: {
+                      c[(b + 40) >> 2] = 2;
+                      i = su(d, p, 0.0, 0.0) | 0;
+                      q = 20;
+                      break a;
+                    }
+                    default: {
+                      c[n >> 2] = c[c[((c[o >> 2] | 0) + 8) >> 2] >> 2];
+                      gA(1, 93919, n) | 0;
+                      g = 1;
+                      break a;
+                    }
+                  }
+                else {
+                  c[p >> 2] = 4;
+                  u = +h[(g + 32) >> 3] * 0.5;
+                  v = +h[(g + 40) >> 3] * 0.5;
+                  c[(b + 40) >> 2] = 1;
+                  i = KK(64) | 0;
+                  h[i >> 3] = u;
+                  h[(i + 8) >> 3] = v;
+                  t = -u;
+                  h[(i + 16) >> 3] = t;
+                  h[(i + 24) >> 3] = v;
+                  h[(i + 32) >> 3] = t;
+                  v = -v;
+                  h[(i + 40) >> 3] = v;
+                  h[(i + 48) >> 3] = u;
+                  h[(i + 56) >> 3] = v;
+                  q = 20;
+                }
+              while (0);
+              if ((q | 0) == 20) {
+                g = c[p >> 2] | 0;
+                if ((e != 1.0) | (f != 1.0)) xu(i, g, e, f);
+                c[(b + 36) >> 2] = i;
+                c[(b + 32) >> 2] = g;
+                uu(i, g, b, (b + 16) | 0);
+                if ((g | 0) > (c[46914] | 0)) {
+                  c[46914] = g;
+                  g = 0;
+                } else g = 0;
+              }
+              l = r;
+              return g | 0;
+            }
+            function wu(a, b, c) {
+              a = a | 0;
+              b = +b;
+              c = +c;
+              h[a >> 3] = b * 0.013888888888888888;
+              h[(a + 8) >> 3] = c * 0.013888888888888888;
+              return;
+            }
+            function xu(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = +c;
+              d = +d;
+              var e = 0,
+                f = 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (b | 0)) break;
+                h[a >> 3] = +h[a >> 3] * c;
+                f = (a + 8) | 0;
+                h[f >> 3] = +h[f >> 3] * d;
+                a = (a + 16) | 0;
+                e = (e + 1) | 0;
+              }
+              return;
+            }
+            function yu(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0.0,
+                t = 0.0,
+                u = 0.0,
+                v = 0;
+              r = l;
+              l = (l + 128) | 0;
+              o = (r + 112) | 0;
+              n = (r + 96) | 0;
+              m = (r + 80) | 0;
+              f = (r + 64) | 0;
+              p = (r + 48) | 0;
+              q = (r + 32) | 0;
+              j = (r + 16) | 0;
+              k = r;
+              c[n >> 2] = c[a >> 2];
+              c[(n + 4) >> 2] = c[(a + 4) >> 2];
+              c[(n + 8) >> 2] = c[(a + 8) >> 2];
+              c[(n + 12) >> 2] = c[(a + 12) >> 2];
+              c[o >> 2] = c[b >> 2];
+              c[(o + 4) >> 2] = c[(b + 4) >> 2];
+              c[(o + 8) >> 2] = c[(b + 8) >> 2];
+              c[(o + 12) >> 2] = c[(b + 12) >> 2];
+              ws(p, n, o);
+              g = (b + 16) | 0;
+              c[n >> 2] = c[a >> 2];
+              c[(n + 4) >> 2] = c[(a + 4) >> 2];
+              c[(n + 8) >> 2] = c[(a + 8) >> 2];
+              c[(n + 12) >> 2] = c[(a + 12) >> 2];
+              c[o >> 2] = c[g >> 2];
+              c[(o + 4) >> 2] = c[(g + 4) >> 2];
+              c[(o + 8) >> 2] = c[(g + 8) >> 2];
+              c[(o + 12) >> 2] = c[(g + 12) >> 2];
+              ws(q, n, o);
+              c[n >> 2] = c[d >> 2];
+              c[(n + 4) >> 2] = c[(d + 4) >> 2];
+              c[(n + 8) >> 2] = c[(d + 8) >> 2];
+              c[(n + 12) >> 2] = c[(d + 12) >> 2];
+              c[o >> 2] = c[e >> 2];
+              c[(o + 4) >> 2] = c[(e + 4) >> 2];
+              c[(o + 8) >> 2] = c[(e + 8) >> 2];
+              c[(o + 12) >> 2] = c[(e + 12) >> 2];
+              ws(j, n, o);
+              i = (e + 16) | 0;
+              c[n >> 2] = c[d >> 2];
+              c[(n + 4) >> 2] = c[(d + 4) >> 2];
+              c[(n + 8) >> 2] = c[(d + 8) >> 2];
+              c[(n + 12) >> 2] = c[(d + 12) >> 2];
+              c[o >> 2] = c[i >> 2];
+              c[(o + 4) >> 2] = c[(i + 4) >> 2];
+              c[(o + 8) >> 2] = c[(i + 8) >> 2];
+              c[(o + 12) >> 2] = c[(i + 12) >> 2];
+              ws(k, n, o);
+              c[f >> 2] = c[p >> 2];
+              c[(f + 4) >> 2] = c[(p + 4) >> 2];
+              c[(f + 8) >> 2] = c[(p + 8) >> 2];
+              c[(f + 12) >> 2] = c[(p + 12) >> 2];
+              c[m >> 2] = c[q >> 2];
+              c[(m + 4) >> 2] = c[(q + 4) >> 2];
+              c[(m + 8) >> 2] = c[(q + 8) >> 2];
+              c[(m + 12) >> 2] = c[(q + 12) >> 2];
+              c[n >> 2] = c[j >> 2];
+              c[(n + 4) >> 2] = c[(j + 4) >> 2];
+              c[(n + 8) >> 2] = c[(j + 8) >> 2];
+              c[(n + 12) >> 2] = c[(j + 12) >> 2];
+              c[o >> 2] = c[k >> 2];
+              c[(o + 4) >> 2] = c[(k + 4) >> 2];
+              c[(o + 8) >> 2] = c[(k + 8) >> 2];
+              c[(o + 12) >> 2] = c[(k + 12) >> 2];
+              do
+                if (zu(f, m, n, o) | 0) {
+                  f = c[(b + 40) >> 2] | 0;
+                  if ((f & 1) | 0 ? (c[(e + 40) >> 2] & 1) | 0 : 0) {
+                    f = 1;
+                    break;
+                  }
+                  if ((f & 2) | 0 ? (c[(e + 40) >> 2] & 2) | 0 : 0) {
+                    s = +h[g >> 3] - +h[b >> 3] + +h[i >> 3] - +h[e >> 3];
+                    t = +h[a >> 3] - +h[d >> 3];
+                    u = +h[(a + 8) >> 3] - +h[(d + 8) >> 3];
+                    f = !(u * u + t * t > s * s * 0.25);
+                    break;
+                  }
+                  f = c[46915] | 0;
+                  if (!f) {
+                    c[46915] = KK(c[46914] << 4) | 0;
+                    i = KK(c[46914] << 4) | 0;
+                    c[46916] = i;
+                    f = c[46915] | 0;
+                  } else i = c[46916] | 0;
+                  v = c[(b + 36) >> 2] | 0;
+                  b = (b + 32) | 0;
+                  g = c[b >> 2] | 0;
+                  c[o >> 2] = c[a >> 2];
+                  c[(o + 4) >> 2] = c[(a + 4) >> 2];
+                  c[(o + 8) >> 2] = c[(a + 8) >> 2];
+                  c[(o + 12) >> 2] = c[(a + 12) >> 2];
+                  Au(v, g, o, f);
+                  a = c[(e + 36) >> 2] | 0;
+                  g = (e + 32) | 0;
+                  e = c[g >> 2] | 0;
+                  c[o >> 2] = c[d >> 2];
+                  c[(o + 4) >> 2] = c[(d + 4) >> 2];
+                  c[(o + 8) >> 2] = c[(d + 8) >> 2];
+                  c[(o + 12) >> 2] = c[(d + 12) >> 2];
+                  Au(a, e, o, i);
+                  if (!(Bu(f, i, c[b >> 2] | 0, c[g >> 2] | 0) | 0)) {
+                    f = c[46915] | 0;
+                    c[m >> 2] = c[f >> 2];
+                    c[(m + 4) >> 2] = c[(f + 4) >> 2];
+                    c[(m + 8) >> 2] = c[(f + 8) >> 2];
+                    c[(m + 12) >> 2] = c[(f + 12) >> 2];
+                    c[n >> 2] = c[j >> 2];
+                    c[(n + 4) >> 2] = c[(j + 4) >> 2];
+                    c[(n + 8) >> 2] = c[(j + 8) >> 2];
+                    c[(n + 12) >> 2] = c[(j + 12) >> 2];
+                    c[o >> 2] = c[k >> 2];
+                    c[(o + 4) >> 2] = c[(k + 4) >> 2];
+                    c[(o + 8) >> 2] = c[(k + 8) >> 2];
+                    c[(o + 12) >> 2] = c[(k + 12) >> 2];
+                    if (
+                      Cu(m, n, o) | 0
+                        ? ((k = c[46916] | 0),
+                          (v = c[g >> 2] | 0),
+                          (c[o >> 2] = c[f >> 2]),
+                          (c[(o + 4) >> 2] = c[(f + 4) >> 2]),
+                          (c[(o + 8) >> 2] = c[(f + 8) >> 2]),
+                          (c[(o + 12) >> 2] = c[(f + 12) >> 2]),
+                          Du(k, v, o) | 0)
+                        : 0
+                    ) {
+                      f = 1;
+                      break;
+                    }
+                    f = c[46916] | 0;
+                    c[m >> 2] = c[f >> 2];
+                    c[(m + 4) >> 2] = c[(f + 4) >> 2];
+                    c[(m + 8) >> 2] = c[(f + 8) >> 2];
+                    c[(m + 12) >> 2] = c[(f + 12) >> 2];
+                    c[n >> 2] = c[p >> 2];
+                    c[(n + 4) >> 2] = c[(p + 4) >> 2];
+                    c[(n + 8) >> 2] = c[(p + 8) >> 2];
+                    c[(n + 12) >> 2] = c[(p + 12) >> 2];
+                    c[o >> 2] = c[q >> 2];
+                    c[(o + 4) >> 2] = c[(q + 4) >> 2];
+                    c[(o + 8) >> 2] = c[(q + 8) >> 2];
+                    c[(o + 12) >> 2] = c[(q + 12) >> 2];
+                    if (!(Cu(m, n, o) | 0)) f = 0;
+                    else {
+                      q = c[46915] | 0;
+                      v = c[b >> 2] | 0;
+                      c[o >> 2] = c[f >> 2];
+                      c[(o + 4) >> 2] = c[(f + 4) >> 2];
+                      c[(o + 8) >> 2] = c[(f + 8) >> 2];
+                      c[(o + 12) >> 2] = c[(f + 12) >> 2];
+                      f = (Du(q, v, o) | 0) != 0;
+                    }
+                  } else f = 1;
+                } else f = 0;
+              while (0);
+              l = r;
+              return (f & 1) | 0;
+            }
+            function zu(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              if ((+h[a >> 3] <= +h[d >> 3] ? +h[c >> 3] <= +h[b >> 3] : 0) ? +h[(a + 8) >> 3] <= +h[(d + 8) >> 3] : 0)
+                a = (+h[(c + 8) >> 3] <= +h[(b + 8) >> 3]) & 1;
+              else a = 0;
+              return a | 0;
+            }
+            function Au(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              f = (c + 8) | 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (b | 0)) break;
+                h[d >> 3] = +h[c >> 3] + +h[a >> 3];
+                h[(d + 8) >> 3] = +h[f >> 3] + +h[(a + 8) >> 3];
+                e = (e + 1) | 0;
+                a = (a + 16) | 0;
+                d = (d + 16) | 0;
+              }
+              return;
+            }
+            function Bu(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0.0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0;
+              A = l;
+              l = (l + 112) | 0;
+              s = (A + 96) | 0;
+              r = (A + 80) | 0;
+              q = (A + 64) | 0;
+              p = (A + 48) | 0;
+              u = (A + 32) | 0;
+              v = (A + 16) | 0;
+              w = A;
+              x = (d + -1) | 0;
+              y = (e + -1) | 0;
+              z = d << 1;
+              t = e << 1;
+              f = 0;
+              g = 0;
+              h = 0;
+              i = 0;
+              while (1) {
+                B = (a + (f << 4)) | 0;
+                C = (a + ((((x + f) | 0) % (d | 0) | 0) << 4)) | 0;
+                c[r >> 2] = c[B >> 2];
+                c[(r + 4) >> 2] = c[(B + 4) >> 2];
+                c[(r + 8) >> 2] = c[(B + 8) >> 2];
+                c[(r + 12) >> 2] = c[(B + 12) >> 2];
+                c[s >> 2] = c[C >> 2];
+                c[(s + 4) >> 2] = c[(C + 4) >> 2];
+                c[(s + 8) >> 2] = c[(C + 8) >> 2];
+                c[(s + 12) >> 2] = c[(C + 12) >> 2];
+                vs(u, r, s);
+                o = (b + (g << 4)) | 0;
+                n = (b + ((((y + g) | 0) % (e | 0) | 0) << 4)) | 0;
+                c[r >> 2] = c[o >> 2];
+                c[(r + 4) >> 2] = c[(o + 4) >> 2];
+                c[(r + 8) >> 2] = c[(o + 8) >> 2];
+                c[(r + 12) >> 2] = c[(o + 12) >> 2];
+                c[s >> 2] = c[n >> 2];
+                c[(s + 4) >> 2] = c[(n + 4) >> 2];
+                c[(s + 8) >> 2] = c[(n + 8) >> 2];
+                c[(s + 12) >> 2] = c[(n + 12) >> 2];
+                vs(v, r, s);
+                c[q >> 2] = c[46540];
+                c[(q + 4) >> 2] = c[46541];
+                c[(q + 8) >> 2] = c[46542];
+                c[(q + 12) >> 2] = c[46543];
+                c[r >> 2] = c[u >> 2];
+                c[(r + 4) >> 2] = c[(u + 4) >> 2];
+                c[(r + 8) >> 2] = c[(u + 8) >> 2];
+                c[(r + 12) >> 2] = c[(u + 12) >> 2];
+                c[s >> 2] = c[v >> 2];
+                c[(s + 4) >> 2] = c[(v + 4) >> 2];
+                c[(s + 8) >> 2] = c[(v + 8) >> 2];
+                c[(s + 12) >> 2] = c[(v + 12) >> 2];
+                j = +xs(q, r, s);
+                c[q >> 2] = c[C >> 2];
+                c[(q + 4) >> 2] = c[(C + 4) >> 2];
+                c[(q + 8) >> 2] = c[(C + 8) >> 2];
+                c[(q + 12) >> 2] = c[(C + 12) >> 2];
+                c[r >> 2] = c[B >> 2];
+                c[(r + 4) >> 2] = c[(B + 4) >> 2];
+                c[(r + 8) >> 2] = c[(B + 8) >> 2];
+                c[(r + 12) >> 2] = c[(B + 12) >> 2];
+                c[s >> 2] = c[o >> 2];
+                c[(s + 4) >> 2] = c[(o + 4) >> 2];
+                c[(s + 8) >> 2] = c[(o + 8) >> 2];
+                c[(s + 12) >> 2] = c[(o + 12) >> 2];
+                k = ys(q, r, s) | 0;
+                c[q >> 2] = c[n >> 2];
+                c[(q + 4) >> 2] = c[(n + 4) >> 2];
+                c[(q + 8) >> 2] = c[(n + 8) >> 2];
+                c[(q + 12) >> 2] = c[(n + 12) >> 2];
+                c[r >> 2] = c[o >> 2];
+                c[(r + 4) >> 2] = c[(o + 4) >> 2];
+                c[(r + 8) >> 2] = c[(o + 8) >> 2];
+                c[(r + 12) >> 2] = c[(o + 12) >> 2];
+                c[s >> 2] = c[B >> 2];
+                c[(s + 4) >> 2] = c[(B + 4) >> 2];
+                c[(s + 8) >> 2] = c[(B + 8) >> 2];
+                c[(s + 12) >> 2] = c[(B + 12) >> 2];
+                m = ys(q, r, s) | 0;
+                c[p >> 2] = c[C >> 2];
+                c[(p + 4) >> 2] = c[(C + 4) >> 2];
+                c[(p + 8) >> 2] = c[(C + 8) >> 2];
+                c[(p + 12) >> 2] = c[(C + 12) >> 2];
+                c[q >> 2] = c[B >> 2];
+                c[(q + 4) >> 2] = c[(B + 4) >> 2];
+                c[(q + 8) >> 2] = c[(B + 8) >> 2];
+                c[(q + 12) >> 2] = c[(B + 12) >> 2];
+                c[r >> 2] = c[n >> 2];
+                c[(r + 4) >> 2] = c[(n + 4) >> 2];
+                c[(r + 8) >> 2] = c[(n + 8) >> 2];
+                c[(r + 12) >> 2] = c[(n + 12) >> 2];
+                c[s >> 2] = c[o >> 2];
+                c[(s + 4) >> 2] = c[(o + 4) >> 2];
+                c[(s + 8) >> 2] = c[(o + 8) >> 2];
+                c[(s + 12) >> 2] = c[(o + 12) >> 2];
+                if (zs(p, q, r, s, w) | 0) {
+                  f = 1;
+                  break;
+                }
+                n = (k | 0) == 0;
+                o = (m | 0) == 0;
+                do
+                  if ((j != 0.0) | ((m | k | 0) != 0))
+                    if (!(j >= 0.0))
+                      if (o) {
+                        f = ((f + 1) | 0) % (d | 0) | 0;
+                        h = (h + 1) | 0;
+                        break;
+                      } else {
+                        g = ((g + 1) | 0) % (e | 0) | 0;
+                        i = (i + 1) | 0;
+                        break;
+                      }
+                    else if (n) {
+                      g = ((g + 1) | 0) % (e | 0) | 0;
+                      i = (i + 1) | 0;
+                      break;
+                    } else {
+                      f = ((f + 1) | 0) % (d | 0) | 0;
+                      h = (h + 1) | 0;
+                      break;
+                    }
+                  else {
+                    f = ((f + 1) | 0) % (d | 0) | 0;
+                    h = (h + 1) | 0;
+                  }
+                while (0);
+                if (!(((i | 0) < (t | 0)) & (((h | 0) < (z | 0)) & (((i | 0) < (e | 0)) | ((h | 0) < (d | 0)))))) {
+                  f = 0;
+                  break;
+                }
+              }
+              l = A;
+              return f | 0;
+            }
+            function Cu(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0.0,
+                e = 0.0;
+              e = +h[a >> 3];
+              if ((e <= +h[c >> 3] ? e >= +h[b >> 3] : 0) ? ((d = +h[(a + 8) >> 3]), d <= +h[(c + 8) >> 3]) : 0)
+                a = (d >= +h[(b + 8) >> 3]) & 1;
+              else a = 0;
+              return a | 0;
+            }
+            function Du(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0.0,
+                l = 0;
+              e = c[46917] | 0;
+              if (!e) {
+                e = KK(c[46914] << 4) | 0;
+                c[46917] = e;
+              }
+              i = (d + 8) | 0;
+              g = 0;
+              while (1) {
+                if ((g | 0) >= (b | 0)) break;
+                h[(e + (g << 4)) >> 3] = +h[(a + (g << 4)) >> 3] - +h[d >> 3];
+                h[(e + (g << 4) + 8) >> 3] = +h[(a + (g << 4) + 8) >> 3] - +h[i >> 3];
+                g = (g + 1) | 0;
+              }
+              d = (b + -1) | 0;
+              f = 0.0;
+              a = 0;
+              a: while (1) {
+                if ((a | 0) >= (b | 0)) {
+                  l = 19;
+                  break;
+                }
+                g = ((d + a) | 0) % (b | 0) | 0;
+                j = +h[(e + (a << 4) + 8) >> 3];
+                i = j == 0.0;
+                if (i ? +h[(e + (g << 4) + 8) >> 3] == 0.0 : 0) {
+                  if (+h[(e + (g << 4)) >> 3] * +h[(e + (a << 4)) >> 3] < 0.0) {
+                    e = 1;
+                    break;
+                  }
+                } else l = 11;
+                do
+                  if ((l | 0) == 11) {
+                    l = 0;
+                    k = +h[(e + (g << 4) + 8) >> 3];
+                    if (!(j >= 0.0) | !(k <= 0.0) ? !(k >= 0.0) | !(j <= 0.0) : 0) break;
+                    j = (k * +h[(e + (a << 4)) >> 3] - j * +h[(e + (g << 4)) >> 3]) / (k - j);
+                    if (j == 0.0) {
+                      e = 1;
+                      break a;
+                    }
+                    if (j > 0.0)
+                      if ((k == 0.0) | i) {
+                        f = f + 0.5;
+                        break;
+                      } else {
+                        f = f + 1.0;
+                        break;
+                      }
+                  }
+                while (0);
+                a = (a + 1) | 0;
+              }
+              if ((l | 0) == 19) e = (((~~f | 0) % 2 | 0 | 0) == 1) & 1;
+              return e | 0;
+            }
+            function Eu(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              j = KK(b << 2) | 0;
+              i = O(b, b) | 0;
+              d = KK(i << 2) | 0;
+              c[j >> 2] = d;
+              $t(i, 0.0, d);
+              d = 1;
+              while (1) {
+                if ((d | 0) >= (b | 0)) {
+                  d = 0;
+                  g = 0;
+                  i = b;
+                  break;
+                }
+                c[(j + (d << 2)) >> 2] = (c[j >> 2] | 0) + ((O(d, b) | 0) << 2);
+                d = (d + 1) | 0;
+              }
+              while (1) {
+                if ((g | 0) >= (b | 0)) break;
+                h = (j + (g << 2)) | 0;
+                e = g;
+                f = d;
+                while (1) {
+                  if ((e | 0) == (b | 0)) break;
+                  k = c[(a + (f << 2)) >> 2] | 0;
+                  c[((c[h >> 2] | 0) + (e << 2)) >> 2] = k;
+                  c[((c[(j + (e << 2)) >> 2] | 0) + (g << 2)) >> 2] = k;
+                  e = (e + 1) | 0;
+                  f = (f + 1) | 0;
+                }
+                d = (d + i) | 0;
+                g = (g + 1) | 0;
+                i = (i + -1) | 0;
+              }
+              return j | 0;
+            }
+            function Fu(a, b, d, e, f, h, i, j) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              h = h | 0;
+              i = i | 0;
+              j = +j;
+              var k = 0.0,
+                l = 0.0,
+                m = 0.0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0.0,
+                r = 0,
+                s = 0.0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0.0,
+                z = 0,
+                A = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0.0;
+              M = c[(d + (f << 2)) >> 2] | 0;
+              C = c[(a + 4) >> 2] | 0;
+              D = c[a >> 2] | 0;
+              E = c[(a + 48) >> 2] | 0;
+              F = c[(a + 52) >> 2] | 0;
+              G = c[(a + 56) >> 2] | 0;
+              a: do
+                if ((h | 0) < 1) d = 0;
+                else {
+                  Hu(M, C, E, F, G, j);
+                  H = c[(a + 28) >> 2] | 0;
+                  I = c[(a + 32) >> 2] | 0;
+                  J = c[(a + 36) >> 2] | 0;
+                  K = c[(a + 12) >> 2] | 0;
+                  L = c[(a + 16) >> 2] | 0;
+                  f = 0;
+                  e = 0;
+                  d = -1;
+                  while (1) {
+                    if ((f | 0) >= (C | 0)) break;
+                    if ((f | 0) >= (e | 0)) {
+                      d = (d + 1) | 0;
+                      if ((d | 0) == (G | 0)) {
+                        e = C;
+                        d = G;
+                      } else e = c[(F + (d << 2)) >> 2] | 0;
+                    }
+                    c[(L + (c[(E + (f << 2)) >> 2] << 2)) >> 2] = d;
+                    f = (f + 1) | 0;
+                  }
+                  z = c[(a + 40) >> 2] | 0;
+                  A = (I + ((C + -1) << 2)) | 0;
+                  d = 0;
+                  e = 0;
+                  while (1) {
+                    if (((e << 24) >> 24 == 0) & ((d | 0) < (h | 0))) {
+                      k = -1.0e9;
+                      f = 0;
+                      e = 1;
+                    } else break a;
+                    b: while (1) {
+                      x = f;
+                      while (1) {
+                        if ((x | 0) >= (C | 0)) break b;
+                        f = c[(E + (x << 2)) >> 2] | 0;
+                        y = +g[(M + (f << 2)) >> 2];
+                        l = y;
+                        w = x;
+                        m = 0.0;
+                        while (1) {
+                          g[(z + (f << 2)) >> 2] = m;
+                          f = (w + 1) | 0;
+                          if ((f | 0) >= (C | 0)) {
+                            v = 0;
+                            break;
+                          }
+                          l = (c[(L + (f << 2)) >> 2] | 0) > (c[(L + (w << 2)) >> 2] | 0) ? l + j : l;
+                          a = c[(E + (f << 2)) >> 2] | 0;
+                          m = +g[(M + (a << 2)) >> 2];
+                          if (+B(+(m - l)) > 1.0e-9) {
+                            v = 1;
+                            break;
+                          }
+                          w = f;
+                          m = m - y;
+                          f = a;
+                        }
+                        n = x;
+                        while (1) {
+                          if ((n | 0) > (w | 0)) {
+                            a = 0;
+                            o = x;
+                            break;
+                          }
+                          o = c[(E + (n << 2)) >> 2] | 0;
+                          p = c[(D + (o << 2)) >> 2] | 0;
+                          a = 0;
+                          l = -+g[(b + (o << 2)) >> 2];
+                          while (1) {
+                            if ((a | 0) >= (C | 0)) break;
+                            if ((a | 0) != (o | 0)) l = +g[(M + (a << 2)) >> 2] * +g[(p + (a << 2)) >> 2] + l;
+                            a = (a + 1) | 0;
+                          }
+                          g[(H + (o << 2)) >> 2] = l / -+g[(p + (o << 2)) >> 2] - +g[(z + (o << 2)) >> 2];
+                          n = (n + 1) | 0;
+                        }
+                        c: while (1) {
+                          if ((o | 0) > (w | 0)) {
+                            m = 0.0;
+                            q = 0.0;
+                            r = 0;
+                            break;
+                          }
+                          n = c[(L + (c[(E + (o << 2)) >> 2] << 2)) >> 2] | 0;
+                          if ((n | 0) == (G | 0)) r = f;
+                          else {
+                            r = c[(F + (n << 2)) >> 2] | 0;
+                            r = (f | 0) < (r | 0) ? f : r;
+                          }
+                          p = o;
+                          while (1) {
+                            if ((p | 0) >= (r | 0)) {
+                              p = o;
+                              break;
+                            }
+                            n = c[(E + (p << 2)) >> 2] | 0;
+                            if (+g[(H + (n << 2)) >> 2] < y) {
+                              c[(K + (a << 2)) >> 2] = n;
+                              a = (a + 1) | 0;
+                            }
+                            p = (p + 1) | 0;
+                          }
+                          while (1) {
+                            if ((p | 0) >= (r | 0)) break;
+                            n = c[(E + (p << 2)) >> 2] | 0;
+                            if (+g[(H + (n << 2)) >> 2] == y) {
+                              c[(K + (a << 2)) >> 2] = n;
+                              a = (a + 1) | 0;
+                            }
+                            p = (p + 1) | 0;
+                          }
+                          while (1) {
+                            if ((o | 0) >= (r | 0)) {
+                              o = r;
+                              continue c;
+                            }
+                            n = c[(E + (o << 2)) >> 2] | 0;
+                            if (+g[(H + (n << 2)) >> 2] > y) {
+                              c[(K + (a << 2)) >> 2] = n;
+                              a = (a + 1) | 0;
+                            }
+                            o = (o + 1) | 0;
+                          }
+                        }
+                        while (1) {
+                          if ((r | 0) >= (a | 0)) break;
+                          o = c[(K + (r << 2)) >> 2] | 0;
+                          p = c[(D + (o << 2)) >> 2] | 0;
+                          l = 0.0;
+                          n = 0;
+                          while (1) {
+                            if ((n | 0) == (r | 0)) break;
+                            l = l - +g[(p + (c[(K + (n << 2)) >> 2] << 2)) >> 2];
+                            n = (n + 1) | 0;
+                          }
+                          N = l * 2.0;
+                          u = (p + (o << 2)) | 0;
+                          s = +g[u >> 2];
+                          l = N + m;
+                          s = (N * y + m * q - +g[(H + (o << 2)) >> 2] * s) / (l - s);
+                          g[(I + (r << 2)) >> 2] = s;
+                          m = l - +g[u >> 2];
+                          q = s;
+                          r = (r + 1) | 0;
+                        }
+                        p = (a | 0) == (C | 0);
+                        if (p) g[A >> 2] = y;
+                        u = (a + -1) | 0;
+                        m = 0.0;
+                        q = 0.0;
+                        o = u;
+                        while (1) {
+                          if ((o | 0) <= -1) break;
+                          r = c[(K + (o << 2)) >> 2] | 0;
+                          t = c[(D + (r << 2)) >> 2] | 0;
+                          l = 0.0;
+                          n = o;
+                          while (1) {
+                            n = (n + 1) | 0;
+                            if ((n | 0) >= (a | 0)) break;
+                            l = l - +g[(t + (c[(K + (n << 2)) >> 2] << 2)) >> 2];
+                          }
+                          l = l * 2.0;
+                          t = (t + (r << 2)) | 0;
+                          N = +g[t >> 2];
+                          s = l + m;
+                          N = (l * y + m * q - +g[(H + (r << 2)) >> 2] * N) / (s - N);
+                          g[(J + (o << 2)) >> 2] = N;
+                          m = s - +g[t >> 2];
+                          q = N;
+                          o = (o + -1) | 0;
+                        }
+                        if (p) {
+                          g[J >> 2] = y;
+                          s = 0.0;
+                          n = -1;
+                          p = 0;
+                        } else {
+                          s = 0.0;
+                          n = -1;
+                          p = 0;
+                        }
+                        while (1) {
+                          if ((a | 0) <= (p | 0)) break;
+                          q = +g[(J + (p << 2)) >> 2];
+                          if ((p | 0) > 0) l = +g[(I + ((p + -1) << 2)) >> 2];
+                          else l = q;
+                          do
+                            if (q < l) {
+                              o = l > y;
+                              if (q < y) {
+                                l = o ? y : l;
+                                m = l;
+                                break;
+                              }
+                              if (o) {
+                                m = q;
+                                l = q;
+                              } else m = q;
+                            } else m = q;
+                          while (0);
+                          N = +B(+(m - y)) * +((a - p) | 0) + +B(+(l - y)) * +(p | 0);
+                          t = N > s;
+                          s = t ? N : s;
+                          n = t ? p : n;
+                          p = (p + 1) | 0;
+                        }
+                        if ((n | 0) > -1) break;
+                        if (
+                          v
+                            ? (c[(L + (c[(E + (f << 2)) >> 2] << 2)) >> 2] | 0) >
+                              (c[(L + (c[(E + (w << 2)) >> 2] << 2)) >> 2] | 0)
+                            : 0
+                        ) {
+                          k = +g[(M + (c[(K + (u << 2)) >> 2] << 2)) >> 2] + j;
+                          x = f;
+                          continue;
+                        }
+                        k = +g[(M + (c[(K + (u << 2)) >> 2] << 2)) >> 2];
+                        x = f;
+                      }
+                      m = +g[(J + (n << 2)) >> 2];
+                      if (!n) q = m;
+                      else q = +g[(I + ((n + -1) << 2)) >> 2];
+                      if (v) {
+                        t = c[(E + (f << 2)) >> 2] | 0;
+                        l = +g[(M + (t << 2)) >> 2];
+                        l =
+                          ((c[(L + (t << 2)) >> 2] | 0) > (c[(L + (c[(E + (w << 2)) >> 2] << 2)) >> 2] | 0)
+                            ? l - j
+                            : l) - +g[(z + (c[(K + (u << 2)) >> 2] << 2)) >> 2];
+                      } else l = 1.0e9;
+                      l = m < l ? m : l;
+                      k = q > k ? q : k;
+                      do
+                        if (l < k) {
+                          o = k > y;
+                          if (l < y) {
+                            l = o ? y : k;
+                            m = l;
+                            break;
+                          }
+                          if (o) m = l;
+                          else {
+                            m = l;
+                            l = k;
+                          }
+                        } else {
+                          m = l;
+                          l = k;
+                        }
+                      while (0);
+                      o = 0;
+                      while (1) {
+                        if ((o | 0) >= (n | 0)) break;
+                        t = c[(K + (o << 2)) >> 2] | 0;
+                        g[(M + (t << 2)) >> 2] = +g[(z + (t << 2)) >> 2] + l;
+                        o = (o + 1) | 0;
+                      }
+                      while (1) {
+                        if ((n | 0) >= (a | 0)) break;
+                        t = c[(K + (n << 2)) >> 2] | 0;
+                        g[(M + (t << 2)) >> 2] = +g[(z + (t << 2)) >> 2] + m;
+                        n = (n + 1) | 0;
+                      }
+                      if (
+                        v
+                          ? (c[(L + (c[(E + (f << 2)) >> 2] << 2)) >> 2] | 0) >
+                            (c[(L + (c[(E + (w << 2)) >> 2] << 2)) >> 2] | 0)
+                          : 0
+                      )
+                        k = +g[(M + (c[(K + (u << 2)) >> 2] << 2)) >> 2] + j;
+                      else k = +g[(M + (c[(K + (u << 2)) >> 2] << 2)) >> 2];
+                      a = x;
+                      while (1) {
+                        if ((a | 0) > (w | 0)) break;
+                        c[(E + (a << 2)) >> 2] = c[(K + ((a - x) << 2)) >> 2];
+                        a = (a + 1) | 0;
+                      }
+                      if ((e << 24) >> 24 != 0 ? +B(+(l - y)) < 0.01 : 0) e = +B(+(m - y)) < 0.01;
+                      else e = 0;
+                      e = e & 1;
+                    }
+                    St(C, M);
+                    Gu(M, E, F, G, i);
+                    d = (d + 1) | 0;
+                  }
+                }
+              while (0);
+              return d | 0;
+            }
+            function Gu(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0;
+              g = 0;
+              while (1) {
+                if ((g | 0) >= (e | 0)) break;
+                c[(f + (g << 2)) >> 2] = c[(a + (c[(b + (((c[(d + (g << 2)) >> 2] | 0) + -1) << 2)) >> 2] << 2)) >> 2];
+                g = (g + 1) | 0;
+              }
+              return;
+            }
+            function Hu(a, b, d, e, f, h) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              h = +h;
+              var i = 0.0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              i = -1.0e9;
+              k = 0;
+              j = -1;
+              m = 0;
+              while (1) {
+                if ((m | 0) >= (b | 0)) break;
+                if ((m | 0) < (k | 0)) l = k;
+                else {
+                  j = (j + 1) | 0;
+                  if ((j | 0) == (f | 0)) k = b;
+                  else k = c[(e + (j << 2)) >> 2] | 0;
+                  if ((m | 0) > 0) i = +g[(a + (c[(d + ((m + -1) << 2)) >> 2] << 2)) >> 2] + h;
+                  else i = -1.0e9;
+                  gt(a, d, m, (k + -1) | 0);
+                  l = k;
+                }
+                k = (a + (c[(d + (m << 2)) >> 2] << 2)) | 0;
+                if (+g[k >> 2] < i) g[k >> 2] = i;
+                k = l;
+                m = (m + 1) | 0;
+              }
+              return;
+            }
+            function Iu(a) {
+              a = a | 0;
+              U1(c[c[a >> 2] >> 2] | 0);
+              U1(c[a >> 2] | 0);
+              U1(c[(a + 8) >> 2] | 0);
+              U1(c[(a + 28) >> 2] | 0);
+              U1(c[(a + 32) >> 2] | 0);
+              U1(c[(a + 36) >> 2] | 0);
+              U1(c[(a + 40) >> 2] | 0);
+              U1(c[(a + 12) >> 2] | 0);
+              U1(c[(a + 16) >> 2] | 0);
+              U1(c[(a + 20) >> 2] | 0);
+              U1(c[(a + 24) >> 2] | 0);
+              U1(a);
+              return;
+            }
+            function Ju(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              k = KK(60) | 0;
+              c[k >> 2] = 0;
+              l = (k + 4) | 0;
+              c[l >> 2] = b;
+              c[(k + 48) >> 2] = d;
+              c[(k + 52) >> 2] = e;
+              c[(k + 56) >> 2] = f;
+              c[k >> 2] = Eu(a, b) | 0;
+              i = b << 2;
+              j = KK(i) | 0;
+              c[(k + 8) >> 2] = j;
+              h = 0;
+              b = 0;
+              a = -1;
+              while (1) {
+                if ((h | 0) >= (c[l >> 2] | 0)) break;
+                g = (a + 1) | 0;
+                if ((h | 0) >= (b | 0)) {
+                  b = c[((g | 0) == (f | 0) ? l : (e + (g << 2)) | 0) >> 2] | 0;
+                  a = g;
+                }
+                c[(j + (c[(d + (h << 2)) >> 2] << 2)) >> 2] = a;
+                h = (h + 1) | 0;
+              }
+              c[(k + 28) >> 2] = KK(i) | 0;
+              c[(k + 32) >> 2] = KK(i) | 0;
+              c[(k + 36) >> 2] = KK(i) | 0;
+              c[(k + 40) >> 2] = KK(i) | 0;
+              c[(k + 12) >> 2] = KK(i) | 0;
+              c[(k + 16) >> 2] = KK(i) | 0;
+              c[(k + 20) >> 2] = KK(i) | 0;
+              c[(k + 24) >> 2] = KK(i) | 0;
+              return k | 0;
+            }
+            function Ku() {
+              fu(187676, 24);
+              c[46922] = 0;
+              return;
+            }
+            function Lu() {
+              return hu(187676) | 0;
+            }
+            function Mu(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0,
+                d = 0.0;
+              c = +h[a >> 3] - +h[b >> 3];
+              d = +h[(a + 8) >> 3] - +h[(b + 8) >> 3];
+              return +(+C(+(d * d + c * c)));
+            }
+            function Nu(a) {
+              a = a | 0;
+              var b = 0;
+              b = c[46922] | 0;
+              c[(a + 16) >> 2] = b;
+              c[46922] = b + 1;
+              return;
+            }
+            function Ou(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              d = (a + 20) | 0;
+              b = ((c[d >> 2] | 0) + -1) | 0;
+              c[d >> 2] = b;
+              if (!b) iu(a, 187676);
+              return;
+            }
+            function Pu(a) {
+              a = a | 0;
+              a = (a + 20) | 0;
+              c[a >> 2] = (c[a >> 2] | 0) + 1;
+              return;
+            }
+            function Qu(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = +f;
+              var i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0.0,
+                o = 0,
+                p = 0.0,
+                q = 0,
+                r = 0.0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0;
+              x = l;
+              l = (l + 16) | 0;
+              o = x;
+              c[o >> 2] = e;
+              q = b << 2;
+              v = KK(q) | 0;
+              m = b << 3;
+              w = KK(m) | 0;
+              u = $s(a, b) | 0;
+              a = 0;
+              while (1) {
+                if ((a | 0) >= (b | 0)) break;
+                k = (u + (a << 2)) | 0;
+                j = 0;
+                while (1) {
+                  if ((j | 0) == (b | 0)) break;
+                  s = ((c[k >> 2] | 0) + (j << 2)) | 0;
+                  c[s >> 2] = c[s >> 2] << 8;
+                  j = (j + 1) | 0;
+                }
+                a = (a + 1) | 0;
+              }
+              if (!d) qa(93952, 93960, 283, 93974);
+              s = KK(m) | 0;
+              a = 0;
+              while (1) {
+                if ((a | 0) >= (b | 0)) break;
+                h[(s + (a << 3)) >> 3] = +h[(d + (a << 3)) >> 3];
+                a = (a + 1) | 0;
+              }
+              Ru(s, b);
+              i = 0.0;
+              n = 0.0;
+              m = 1;
+              while (1) {
+                if ((m | 0) >= (b | 0)) break;
+                j = (u + (m << 2)) | 0;
+                k = (d + (m << 3)) | 0;
+                a = 0;
+                while (1) {
+                  if ((a | 0) == (m | 0)) break;
+                  y = c[((c[j >> 2] | 0) + (a << 2)) >> 2] | 0;
+                  r = +h[k >> 3] - +h[(d + (a << 3)) >> 3];
+                  i = r * r * (1.0 / +(O(y, y) | 0)) + i;
+                  n = +B(+r) * (1.0 / +(y | 0)) + n;
+                  a = (a + 1) | 0;
+                }
+                m = (m + 1) | 0;
+              }
+              r = n / i;
+              a = 0;
+              while (1) {
+                if ((a | 0) >= (b | 0)) break;
+                y = (d + (a << 3)) | 0;
+                h[y >> 3] = +h[y >> 3] * r;
+                a = (a + 1) | 0;
+              }
+              Su(b, o, f, d, u);
+              k = KK(O(q, b) | 0) | 0;
+              j = 0;
+              while (1) {
+                if ((j | 0) >= (b | 0)) {
+                  k = 1;
+                  break;
+                }
+                m = (k + ((O(j, b) | 0) << 2)) | 0;
+                c[(v + (j << 2)) >> 2] = m;
+                o = (u + (j << 2)) | 0;
+                i = 0.0;
+                a = 0;
+                while (1) {
+                  if ((a | 0) == (b | 0)) break;
+                  if ((a | 0) != (j | 0)) {
+                    p = +(c[((c[o >> 2] | 0) + (a << 2)) >> 2] | 0);
+                    p = -1.0 / (p * p);
+                    g[(m + (a << 2)) >> 2] = p;
+                    i = i - p;
+                  }
+                  a = (a + 1) | 0;
+                }
+                g[(m + (j << 2)) >> 2] = i;
+                j = (j + 1) | 0;
+              }
+              while (1) {
+                if ((k | 0) >= (b | 0)) {
+                  j = 0;
+                  break;
+                }
+                i = +h[(d + (k << 3)) >> 3];
+                j = (u + (k << 2)) | 0;
+                a = 0;
+                while (1) {
+                  if ((a | 0) == (k | 0)) break;
+                  y = ((c[j >> 2] | 0) + (a << 2)) | 0;
+                  n = +(c[y >> 2] | 0);
+                  p = i - +h[(d + (a << 3)) >> 3];
+                  p = n * n - p * p;
+                  q = ~~+C(+p);
+                  q = p > 0.0 ? q : 0;
+                  c[((c[(u + (a << 2)) >> 2] | 0) + (k << 2)) >> 2] = q;
+                  c[y >> 2] = q;
+                  a = (a + 1) | 0;
+                }
+                k = (k + 1) | 0;
+              }
+              while (1) {
+                if ((j | 0) >= (b | 0)) {
+                  q = 0;
+                  a = 0;
+                  break;
+                }
+                n = +h[(e + (j << 3)) >> 3];
+                m = (w + (j << 3)) | 0;
+                h[m >> 3] = 0.0;
+                o = (u + (j << 2)) | 0;
+                k = (v + (j << 2)) | 0;
+                a = 0;
+                i = 0.0;
+                while (1) {
+                  if ((a | 0) == (b | 0)) break;
+                  if ((a | 0) != (j | 0)) {
+                    p = +g[((c[k >> 2] | 0) + (a << 2)) >> 2] * +(c[((c[o >> 2] | 0) + (a << 2)) >> 2] | 0);
+                    i = i + (n >= +h[(e + (a << 3)) >> 3] ? -p : p);
+                    h[m >> 3] = i;
+                  }
+                  a = (a + 1) | 0;
+                }
+                j = (j + 1) | 0;
+              }
+              while (1) {
+                if (!(((a << 24) >> 24 == 0) & ((q | 0) < 200))) {
+                  t = 42;
+                  break;
+                }
+                if ((zr(v, e, w, b, f, b, 1) | 0) < 0) {
+                  a = 1;
+                  break;
+                } else {
+                  a = 1;
+                  o = 0;
+                }
+                while (1) {
+                  if ((o | 0) >= (b | 0)) break;
+                  p = +h[(e + (o << 3)) >> 3];
+                  k = (u + (o << 2)) | 0;
+                  m = (v + (o << 2)) | 0;
+                  i = 0.0;
+                  j = 0;
+                  while (1) {
+                    if ((j | 0) == (b | 0)) break;
+                    do
+                      if ((j | 0) != (o | 0)) {
+                        n = +g[((c[m >> 2] | 0) + (j << 2)) >> 2] * +(c[((c[k >> 2] | 0) + (j << 2)) >> 2] | 0);
+                        if (!(p >= +h[(e + (j << 3)) >> 3])) {
+                          i = i + n;
+                          break;
+                        } else {
+                          i = i + -n;
+                          break;
+                        }
+                      }
+                    while (0);
+                    j = (j + 1) | 0;
+                  }
+                  j = (w + (o << 3)) | 0;
+                  p = +h[j >> 3];
+                  if (i != p ? +B(+(1.0 - i / p)) > 1.0e-5 : 0) {
+                    h[j >> 3] = i;
+                    a = 0;
+                  }
+                  o = (o + 1) | 0;
+                }
+                q = (q + 1) | 0;
+              }
+              a: do
+                if ((t | 0) == 42) {
+                  i = 1.0 / r;
+                  a = 0;
+                  while (1) {
+                    if ((a | 0) >= (b | 0)) {
+                      a = 0;
+                      break a;
+                    }
+                    y = (d + (a << 3)) | 0;
+                    h[y >> 3] = +h[y >> 3] * i;
+                    y = (e + (a << 3)) | 0;
+                    h[y >> 3] = +h[y >> 3] * i;
+                    a = (a + 1) | 0;
+                  }
+                }
+              while (0);
+              U1(c[u >> 2] | 0);
+              U1(u);
+              U1(c[v >> 2] | 0);
+              U1(v);
+              U1(s);
+              U1(w);
+              l = x;
+              return a | 0;
+            }
+            function Ru(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0,
+                d = 0.0,
+                e = 0.0,
+                f = 0;
+              c = 0;
+              d = 0.0;
+              while (1) {
+                if ((c | 0) >= (b | 0)) break;
+                e = +h[(a + (c << 3)) >> 3] + d;
+                c = (c + 1) | 0;
+                d = e;
+              }
+              d = d / +(b | 0);
+              c = 0;
+              while (1) {
+                if ((c | 0) >= (b | 0)) break;
+                f = (a + (c << 3)) | 0;
+                h[f >> 3] = +h[f >> 3] - d;
+                c = (c + 1) | 0;
+              }
+              f = (b + -1) | 0;
+              Bt(a, 0, f, 1.0 / +At(a, 0, f), a);
+              return;
+            }
+            function Su(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = +d;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              k = Tu(f, a) | 0;
+              l = KK(8) | 0;
+              if (!e) {
+                f = 0;
+                j = 0;
+              } else {
+                g = KK(a << 3) | 0;
+                f = 0;
+                while (1) {
+                  if ((f | 0) >= (a | 0)) break;
+                  h[(g + (f << 3)) >> 3] = +h[(e + (f << 3)) >> 3];
+                  f = (f + 1) | 0;
+                }
+                Ru(g, a);
+                f = g;
+                j = g;
+              }
+              Uu(k, a, b, l, f, d);
+              e = 0;
+              while (1) {
+                if ((e | 0) == 1) break;
+                g = (l + (e << 3)) | 0;
+                i = (b + (e << 2)) | 0;
+                f = 0;
+                while (1) {
+                  if ((f | 0) >= (a | 0)) break;
+                  d = +C(+(+B(+(+h[g >> 3]))));
+                  m = ((c[i >> 2] | 0) + (f << 3)) | 0;
+                  h[m >> 3] = +h[m >> 3] * d;
+                  f = (f + 1) | 0;
+                }
+                e = (e + 1) | 0;
+              }
+              U1(c[k >> 2] | 0);
+              U1(k);
+              U1(l);
+              U1(j);
+              return;
+            }
+            function Tu(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                h = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0.0;
+              o = l;
+              l = (l + 16) | 0;
+              f = o;
+              n = b << 2;
+              e = KK(O(n, b) | 0) | 0;
+              n = KK(n) | 0;
+              d = 0;
+              while (1) {
+                if ((d | 0) >= (b | 0)) break;
+                c[(n + (d << 2)) >> 2] = e + ((O(d, b) | 0) << 2);
+                d = (d + 1) | 0;
+              }
+              m = Wu(a, b, f) | 0;
+              h = +g[f >> 2];
+              e = 0;
+              k = 1;
+              while (1) {
+                if ((e | 0) >= (b | 0)) break;
+                f = (a + (e << 2)) | 0;
+                i = (m + (e << 2)) | 0;
+                j = (n + (e << 2)) | 0;
+                d = 0;
+                while (1) {
+                  if ((d | 0) == (k | 0)) break;
+                  p = +(c[((c[f >> 2] | 0) + (d << 2)) >> 2] | 0);
+                  p = +g[(m + (d << 2)) >> 2] + +g[i >> 2] - p * p - h;
+                  g[((c[j >> 2] | 0) + (d << 2)) >> 2] = p;
+                  g[((c[(n + (d << 2)) >> 2] | 0) + (e << 2)) >> 2] = p;
+                  d = (d + 1) | 0;
+                }
+                e = (e + 1) | 0;
+                k = (k + 1) | 0;
+              }
+              U1(m);
+              l = o;
+              return n | 0;
+            }
+            function Uu(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = +g;
+              var i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0.0,
+                n = 0.0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0;
+              r = b << 3;
+              q = KK(r) | 0;
+              r = KK(r) | 0;
+              n = 1.0 - g;
+              o = (b | 0) < 1 ? b : 1;
+              p = (b + -1) | 0;
+              k = (f | 0) == 0;
+              j = 0;
+              a: while (1) {
+                if ((j | 0) >= (o | 0)) break;
+                l = c[(d + (j << 2)) >> 2] | 0;
+                do {
+                  i = 0;
+                  while (1) {
+                    if ((i | 0) == (b | 0)) break;
+                    h[(l + (i << 3)) >> 3] = +((x5() | 0) % 100 | 0 | 0);
+                    i = (i + 1) | 0;
+                  }
+                  if (k) i = 0;
+                  else {
+                    zt(l, 0, p, -+yt(f, 0, p, l), f);
+                    i = 0;
+                  }
+                  while (1) {
+                    if ((i | 0) == (j | 0)) break;
+                    s = (d + (i << 2)) | 0;
+                    m = -+yt(c[s >> 2] | 0, 0, p, l);
+                    zt(l, 0, p, m, c[s >> 2] | 0);
+                    i = (i + 1) | 0;
+                  }
+                  g = +At(l, 0, p);
+                } while (g < 1.0e-10);
+                Bt(l, 0, p, 1.0 / g, l);
+                do {
+                  Ct(r, 0, p, l);
+                  Vu(a, b, b, l, q, f);
+                  Ct(l, 0, p, q);
+                  i = 0;
+                  while (1) {
+                    if ((i | 0) == (j | 0)) break;
+                    s = (d + (i << 2)) | 0;
+                    m = -+yt(c[s >> 2] | 0, 0, p, l);
+                    zt(l, 0, p, m, c[s >> 2] | 0);
+                    i = (i + 1) | 0;
+                  }
+                  g = +At(l, 0, p);
+                  if (g < 1.0e-10) break a;
+                  Bt(l, 0, p, 1.0 / g, l);
+                  m = +yt(l, 0, p, r);
+                } while (+B(+m) < n);
+                h[(e + (j << 3)) >> 3] = m * g;
+                j = (j + 1) | 0;
+              }
+              while (1) {
+                if ((j | 0) >= (o | 0)) break;
+                k = c[(d + (j << 2)) >> 2] | 0;
+                i = 0;
+                while (1) {
+                  if ((i | 0) >= (b | 0)) {
+                    i = 0;
+                    break;
+                  }
+                  h[(k + (i << 3)) >> 3] = +((x5() | 0) % 100 | 0 | 0);
+                  i = (i + 1) | 0;
+                }
+                while (1) {
+                  if ((i | 0) >= (j | 0)) break;
+                  s = (d + (i << 2)) | 0;
+                  n = -+yt(c[s >> 2] | 0, 0, p, k);
+                  zt(k, 0, p, n, c[s >> 2] | 0);
+                  i = (i + 1) | 0;
+                }
+                Bt(k, 0, p, 1.0 / +At(k, 0, p), k);
+                h[(e + (j << 3)) >> 3] = 0.0;
+                j = (j + 1) | 0;
+              }
+              l = (o + -1) | 0;
+              j = 0;
+              while (1) {
+                if ((j | 0) >= (l | 0)) break;
+                a = (e + (j << 3)) | 0;
+                f = (j + 1) | 0;
+                g = +h[a >> 3];
+                i = j;
+                k = f;
+                while (1) {
+                  if ((k | 0) >= (o | 0)) break;
+                  n = +h[(e + (k << 3)) >> 3];
+                  s = g < n;
+                  g = s ? n : g;
+                  i = s ? k : i;
+                  k = (k + 1) | 0;
+                }
+                if ((i | 0) == (j | 0)) {
+                  j = f;
+                  continue;
+                }
+                b = (d + (j << 2)) | 0;
+                Ct(q, 0, p, c[b >> 2] | 0);
+                s = (d + (i << 2)) | 0;
+                Ct(c[b >> 2] | 0, 0, p, c[s >> 2] | 0);
+                Ct(c[s >> 2] | 0, 0, p, q);
+                h[(e + (i << 3)) >> 3] = +h[a >> 3];
+                h[a >> 3] = g;
+                j = f;
+              }
+              U1(q);
+              U1(r);
+              return;
+            }
+            function Vu(a, b, d, e, f, i) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              i = i | 0;
+              var j = 0,
+                k = 0.0,
+                l = 0,
+                m = 0;
+              j = 0;
+              while (1) {
+                if ((j | 0) >= (b | 0)) break;
+                m = (a + (j << 2)) | 0;
+                k = 0.0;
+                l = 0;
+                while (1) {
+                  if ((l | 0) >= (d | 0)) break;
+                  k = +h[(e + (l << 3)) >> 3] * +g[((c[m >> 2] | 0) + (l << 2)) >> 2] + k;
+                  l = (l + 1) | 0;
+                }
+                h[(f + (j << 3)) >> 3] = k;
+                j = (j + 1) | 0;
+              }
+              j = (b + -1) | 0;
+              if (i | 0) zt(f, 0, j, -+yt(f, 0, j, i), i);
+              return;
+            }
+            function Wu(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0.0,
+                l = 0,
+                m = 0.0;
+              j = KK(b << 2) | 0;
+              k = 1.0 / +(b | 0);
+              e = 0.0;
+              i = 0;
+              while (1) {
+                if ((i | 0) >= (b | 0)) break;
+                l = (a + (i << 2)) | 0;
+                f = 0.0;
+                h = 0;
+                while (1) {
+                  if ((h | 0) == (b | 0)) break;
+                  m = +(c[((c[l >> 2] | 0) + (h << 2)) >> 2] | 0);
+                  m = m * m;
+                  f = m + f;
+                  h = (h + 1) | 0;
+                  e = m + e;
+                }
+                g[(j + (i << 2)) >> 2] = k * f;
+                i = (i + 1) | 0;
+              }
+              g[d >> 2] = e / +(O(b, b) | 0);
+              return j | 0;
+            }
+            function Xu(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0.0,
+                u = 0;
+              q = O(d, d) | 0;
+              r = KK(q << 3) | 0;
+              s = KK(d << 3) | 0;
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (d | 0)) break;
+                h[(s + (e << 3)) >> 3] = +h[(c + (e << 3)) >> 3];
+                e = (e + 1) | 0;
+              }
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (q | 0)) break;
+                h[(r + (e << 3)) >> 3] = +h[(a + (e << 3)) >> 3];
+                e = (e + 1) | 0;
+              }
+              p = (d + -1) | 0;
+              g = 0;
+              o = 0;
+              a: while (1) {
+                if ((o | 0) < (p | 0)) {
+                  f = 0.0;
+                  e = o;
+                } else {
+                  l = 21;
+                  break;
+                }
+                while (1) {
+                  if ((e | 0) >= (d | 0)) break;
+                  t = +B(+(+h[(a + (((O(e, d) | 0) + o) << 3)) >> 3]));
+                  m = t < f;
+                  n = m ? g : e;
+                  f = m ? f : t;
+                  e = (e + 1) | 0;
+                  g = n;
+                }
+                if (f < 1.0e-10) {
+                  l = 33;
+                  break;
+                }
+                i = O(g, d) | 0;
+                n = O(o, d) | 0;
+                e = o;
+                while (1) {
+                  if ((e | 0) >= (d | 0)) break;
+                  l = (a + ((e + i) << 3)) | 0;
+                  t = +h[l >> 3];
+                  m = (a + ((e + n) << 3)) | 0;
+                  h[l >> 3] = +h[m >> 3];
+                  h[m >> 3] = t;
+                  e = (e + 1) | 0;
+                }
+                m = (c + (g << 3)) | 0;
+                t = +h[m >> 3];
+                j = (c + (o << 3)) | 0;
+                h[m >> 3] = +h[j >> 3];
+                h[j >> 3] = t;
+                m = (o + 1) | 0;
+                k = (a + ((n + o) << 3)) | 0;
+                e = m;
+                while (1) {
+                  if ((e | 0) >= (d | 0)) {
+                    o = m;
+                    continue a;
+                  }
+                  l = O(e, d) | 0;
+                  f = +h[(a + ((l + o) << 3)) >> 3] / +h[k >> 3];
+                  i = (c + (e << 3)) | 0;
+                  h[i >> 3] = +h[i >> 3] - +h[j >> 3] * f;
+                  i = 0;
+                  while (1) {
+                    if ((i | 0) >= (d | 0)) break;
+                    u = (a + ((i + l) << 3)) | 0;
+                    h[u >> 3] = +h[u >> 3] - +h[(a + ((i + n) << 3)) >> 3] * f;
+                    i = (i + 1) | 0;
+                  }
+                  e = (e + 1) | 0;
+                }
+              }
+              if ((l | 0) == 21) {
+                f = +h[(a + ((q + -1) << 3)) >> 3];
+                if (+B(+f) < 1.0e-10) l = 33;
+                else {
+                  h[(b + (p << 3)) >> 3] = +h[(c + (p << 3)) >> 3] / f;
+                  e = 0;
+                  while (1) {
+                    if ((e | 0) >= (p | 0)) {
+                      e = 0;
+                      break;
+                    }
+                    g = (d - e) | 0;
+                    i = (g + -2) | 0;
+                    f = +h[(c + (i << 3)) >> 3];
+                    j = (b + (i << 3)) | 0;
+                    h[j >> 3] = f;
+                    k = O(i, d) | 0;
+                    g = (g + -1) | 0;
+                    while (1) {
+                      if ((g | 0) >= (d | 0)) break;
+                      t = f - +h[(b + (g << 3)) >> 3] * +h[(a + ((g + k) << 3)) >> 3];
+                      h[j >> 3] = t;
+                      g = (g + 1) | 0;
+                      f = t;
+                    }
+                    h[j >> 3] = f / +h[(a + ((k + i) << 3)) >> 3];
+                    e = (e + 1) | 0;
+                  }
+                  while (1) {
+                    if ((e | 0) >= (d | 0)) {
+                      e = 0;
+                      break;
+                    }
+                    h[(c + (e << 3)) >> 3] = +h[(s + (e << 3)) >> 3];
+                    e = (e + 1) | 0;
+                  }
+                  while (1) {
+                    if ((e | 0) >= (q | 0)) break;
+                    h[(a + (e << 3)) >> 3] = +h[(r + (e << 3)) >> 3];
+                    e = (e + 1) | 0;
+                  }
+                  U1(r);
+                  U1(s);
+                }
+              }
+              if ((l | 0) == 33) {
+                B6(93989) | 0;
+                U1(r);
+                U1(s);
+              }
+              return;
+            }
+            function Yu(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0;
+              s = l;
+              l = (l + 16) | 0;
+              r = s;
+              ms();
+              Ku();
+              Hs();
+              c[46918] = jb[d & 3]() | 0;
+              Js();
+              q = (r + 8) | 0;
+              p = jb[d & 3]() | 0;
+              e = 0.0;
+              f = 0.0;
+              a: while (1) {
+                n = (p | 0) == 0;
+                o = (p + 8) | 0;
+                while (1) {
+                  if (!(Ds() | 0)) {
+                    Es(r);
+                    e = +h[r >> 3];
+                    f = +h[q >> 3];
+                  }
+                  if (!n) {
+                    if (Ds() | 0) break;
+                    g = +h[o >> 3];
+                    if (g < f) break;
+                    if (g == f ? +h[p >> 3] < e : 0) break;
+                  }
+                  if (Ds() | 0) break a;
+                  t = Fs() | 0;
+                  b = Ss(t) | 0;
+                  v = Rs(t) | 0;
+                  i = Rs(v) | 0;
+                  m = Ts(t) | 0;
+                  u = Us(v) | 0;
+                  j = c[(t + 20) >> 2] | 0;
+                  Nu(j);
+                  qs(c[(t + 8) >> 2] | 0, a[(t + 16) >> 0] | 0, j);
+                  qs(c[(v + 8) >> 2] | 0, a[(v + 16) >> 0] | 0, j);
+                  Qs(t);
+                  Cs(v);
+                  Qs(v);
+                  v = +h[(m + 8) >> 3] > +h[(u + 8) >> 3];
+                  t = v & 1;
+                  k = v ? u : m;
+                  u = ns(k, v ? m : u) | 0;
+                  m = Ks(u, t) | 0;
+                  Ns(b, m);
+                  qs(u, (t ^ 1) & 255, j);
+                  Ou(j);
+                  j = Ls(b, m) | 0;
+                  if (j | 0) {
+                    Cs(b);
+                    As(b, j, +Mu(j, k));
+                  }
+                  b = Ls(m, i) | 0;
+                  if (!b) continue;
+                  As(m, b, +Mu(b, k));
+                }
+                b = Os(p) | 0;
+                k = Rs(b) | 0;
+                i = ns(Us(b) | 0, p) | 0;
+                m = Ks(i, 0) | 0;
+                Ns(b, m);
+                j = Ls(b, m) | 0;
+                if (j | 0) {
+                  Cs(b);
+                  As(b, j, +Mu(j, p));
+                }
+                i = Ks(i, 1) | 0;
+                Ns(m, i);
+                b = Ls(i, k) | 0;
+                if (b | 0) As(i, b, +Mu(b, p));
+                p = jb[d & 3]() | 0;
+              }
+              b = c[46860] | 0;
+              while (1) {
+                b = Rs(b) | 0;
+                if ((b | 0) == (c[46861] | 0)) break;
+                os(c[(b + 8) >> 2] | 0);
+              }
+              l = s;
+              return;
+            }
+            function Zu(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              g = l;
+              l = (l + 16) | 0;
+              f = (g + 8) | 0;
+              e = g;
+              do
+                if ((tB(a) | 0) != 1) {
+                  _u(a);
+                  if (!b) b = $u(a) | 0;
+                  d = av(a, b) | 0;
+                  if (0) {
+                    h = c[15712] | 0;
+                    c[e >> 2] = KB(b) | 0;
+                    c[(e + 4) >> 2] = d;
+                    w4(h, 94005, e) | 0;
+                  }
+                  if ((d | 0) < 0) {
+                    gA(1, 94039, f) | 0;
+                    break;
+                  } else {
+                    bv(a);
+                    cv(a, b);
+                    dv(a, b);
+                    ev(a, d);
+                    break;
+                  }
+                } else {
+                  h = c[((c[((jC(a) | 0) + 16) >> 2] | 0) + 132) >> 2] | 0;
+                  c[h >> 2] = 0;
+                  c[(h + 4) >> 2] = 0;
+                  c[(h + 8) >> 2] = 0;
+                  c[(h + 12) >> 2] = 0;
+                }
+              while (0);
+              l = g;
+              return b | 0;
+            }
+            function _u(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              d = tB(a) | 0;
+              d = O(d, d) | 0;
+              b = jC(a) | 0;
+              while (1) {
+                if (!b) break;
+                e = (b + 16) | 0;
+                f = c[((c[e >> 2] | 0) + 112) >> 2] | 0;
+                g = (f + 24) | 0;
+                c[g >> 2] = d;
+                c[(g + 4) >> 2] = 0;
+                h[(f + 48) >> 3] = 10.0;
+                f = (mv(a, b) | 0) == 0;
+                e = c[((c[e >> 2] | 0) + 112) >> 2] | 0;
+                c[e >> 2] = f ? d : 0;
+                c[(e + 4) >> 2] = f ? 0 : 0;
+                b = kC(a, b) | 0;
+              }
+              return;
+            }
+            function $u(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              e = (tB(a) | 0) < 3;
+              b = jC(a) | 0;
+              a: do
+                if (!e) {
+                  while (1) {
+                    if (!b) break;
+                    e = c[((c[(b + 16) >> 2] | 0) + 112) >> 2] | 0;
+                    if (((c[e >> 2] | 0) == 0) & ((c[(e + 4) >> 2] | 0) == 0)) lv(a, b, 0);
+                    b = kC(a, b) | 0;
+                  }
+                  d = 0;
+                  b = 0;
+                  e = jC(a) | 0;
+                  while (1) {
+                    if (!e) break a;
+                    h = c[((c[(e + 16) >> 2] | 0) + 112) >> 2] | 0;
+                    g = c[h >> 2] | 0;
+                    h = c[(h + 4) >> 2] | 0;
+                    f = (((d | 0) < 0) << 31) >> 31;
+                    f = (h >>> 0 > f >>> 0) | (((h | 0) == (f | 0)) & (g >>> 0 > d >>> 0));
+                    d = f ? g : d;
+                    b = f ? e : b;
+                    e = kC(a, e) | 0;
+                  }
+                }
+              while (0);
+              return b | 0;
+            }
+            function av(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              d = c[((c[(b + 16) >> 2] | 0) + 112) >> 2] | 0;
+              f = (d + 24) | 0;
+              e = c[f >> 2] | 0;
+              c[f >> 2] = 0;
+              c[(f + 4) >> 2] = 0;
+              c[(d + 32) >> 2] = 0;
+              iv(a, b);
+              d = jC(a) | 0;
+              e = P6(0, e | 0, 32) | 0;
+              f = z;
+              b = 0;
+              while (1) {
+                if (!d) break;
+                h = ((c[((c[(d + 16) >> 2] | 0) + 112) >> 2] | 0) + 24) | 0;
+                g = c[h >> 2] | 0;
+                h = c[(h + 4) >> 2] | 0;
+                if (((g | 0) == (e | 0)) & ((h | 0) == (f | 0))) {
+                  b = -1;
+                  break;
+                }
+                i = (((b | 0) < 0) << 31) >> 31;
+                b = (h >>> 0 > i >>> 0) | (((h | 0) == (i | 0)) & (g >>> 0 > b >>> 0)) ? g : b;
+                d = kC(a, d) | 0;
+              }
+              return b | 0;
+            }
+            function bv(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              d = jC(a) | 0;
+              while (1) {
+                if (!d) break;
+                b = c[((c[(d + 16) >> 2] | 0) + 112) >> 2] | 0;
+                e = (b + 16) | 0;
+                a: do
+                  if (((c[e >> 2] | 0) == 0) & ((c[(e + 4) >> 2] | 0) == 0))
+                    while (1) {
+                      e = (b + 8) | 0;
+                      f = e;
+                      f = J6(c[f >> 2] | 0, c[(f + 4) >> 2] | 0, 1, 0) | 0;
+                      c[e >> 2] = f;
+                      c[(e + 4) >> 2] = z;
+                      b = c[(b + 32) >> 2] | 0;
+                      if (!b) break a;
+                      b = c[((c[(b + 16) >> 2] | 0) + 112) >> 2] | 0;
+                    }
+                while (0);
+                d = kC(a, d) | 0;
+              }
+              return;
+            }
+            function cv(a, b) {
+              a = a | 0;
+              b = b | 0;
+              h[((c[((c[(b + 16) >> 2] | 0) + 112) >> 2] | 0) + 40) >> 3] = 6.283185307179586;
+              hv(a, b);
+              return;
+            }
+            function dv(a, b) {
+              a = a | 0;
+              b = b | 0;
+              h[((c[((c[(b + 16) >> 2] | 0) + 112) >> 2] | 0) + 48) >> 3] = 0.0;
+              gv(a, b);
+              return;
+            }
+            function ev(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0.0,
+                k = 0.0;
+              i = l;
+              l = (l + 16) | 0;
+              f = i;
+              g = fv(a, b) | 0;
+              if (0) {
+                e = c[15712] | 0;
+                T4(94095, e) | 0;
+                d = 0;
+                while (1) {
+                  if ((d | 0) > (b | 0)) break;
+                  h[f >> 3] = +h[(g + (d << 3)) >> 3];
+                  w4(e, 94114, f) | 0;
+                  d = (d + 1) | 0;
+                }
+                T4(153599, e) | 0;
+              }
+              d = jC(a) | 0;
+              while (1) {
+                if (!d) break;
+                f = c[(d + 16) >> 2] | 0;
+                e = c[(f + 112) >> 2] | 0;
+                j = +h[(g + (c[(e + 24) >> 2] << 3)) >> 3];
+                e = (e + 48) | 0;
+                k = +E(+(+h[e >> 3])) * j;
+                f = c[(f + 132) >> 2] | 0;
+                h[f >> 3] = k;
+                h[(f + 8) >> 3] = +F(+(+h[e >> 3])) * j;
+                d = kC(a, d) | 0;
+              }
+              U1(g);
+              l = i;
+              return;
+            }
+            function fv(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0,
+                g = 0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              n = l;
+              l = (l + 16) | 0;
+              k = n;
+              m = JK(((d << 3) + 8) | 0) | 0;
+              b = aP(b, GA(c[(b + 60) >> 2] | 0, 0, 101288, 0) | 0, 0) | 0;
+              a: do
+                if (!b) {
+                  f = 1.0;
+                  e = 0.0;
+                  b = 1;
+                } else {
+                  i = 0.0;
+                  e = 0.0;
+                  g = 1;
+                  b: while (1) {
+                    if ((g | 0) > (d | 0)) {
+                      f = i;
+                      b = g;
+                      break a;
+                    }
+                    f = +s5(b, k);
+                    if (!(f > 0.0)) {
+                      f = i;
+                      b = g;
+                      break a;
+                    }
+                    i = f > 0.02 ? f : 0.02;
+                    e = i + e;
+                    j = (g + 1) | 0;
+                    h[(m + (g << 3)) >> 3] = e;
+                    b = c[k >> 2] | 0;
+                    while (1) {
+                      g = a[b >> 0] | 0;
+                      if (!((g << 24) >> 24)) {
+                        g = j;
+                        continue b;
+                      }
+                      if (!(((g << 24) >> 24 == 58) | ((S2((g << 24) >> 24) | 0) != 0))) {
+                        g = j;
+                        continue b;
+                      }
+                      b = (b + 1) | 0;
+                    }
+                  }
+                }
+              while (0);
+              while (1) {
+                if ((b | 0) > (d | 0)) break;
+                i = e + f;
+                h[(m + (b << 3)) >> 3] = i;
+                b = (b + 1) | 0;
+                e = i;
+              }
+              l = n;
+              return m | 0;
+            }
+            function gv(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0.0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0.0;
+              d = c[((c[(b + 16) >> 2] | 0) + 112) >> 2] | 0;
+              if (!(c[(d + 32) >> 2] | 0)) e = 0.0;
+              else e = +h[(d + 48) >> 3] - +h[(d + 40) >> 3] * 0.5;
+              g = aB(a, b) | 0;
+              while (1) {
+                if (!g) break;
+                d = c[g >> 2] & 3;
+                f = c[(((d | 0) == 3 ? g : (g + 48) | 0) + 40) >> 2] | 0;
+                if ((f | 0) == (b | 0)) f = c[(((d | 0) == 2 ? g : (g + -48) | 0) + 40) >> 2] | 0;
+                d = c[((c[(f + 16) >> 2] | 0) + 112) >> 2] | 0;
+                if ((c[(d + 32) >> 2] | 0) == (b | 0) ? ((i = (d + 48) | 0), !(+h[i >> 3] != 10.0)) : 0) {
+                  j = +h[(d + 40) >> 3];
+                  h[i >> 3] = j * 0.5 + e;
+                  e = j + e;
+                  d = (d + 16) | 0;
+                  if (!(((c[d >> 2] | 0) == 0) & ((c[(d + 4) >> 2] | 0) == 0))) gv(a, f);
+                }
+                g = bB(a, g, b) | 0;
+              }
+              return;
+            }
+            function hv(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0,
+                j = 0;
+              e = c[((c[(b + 16) >> 2] | 0) + 112) >> 2] | 0;
+              f = (e + 8) | 0;
+              g = +h[(e + 40) >> 3] / (+((c[f >> 2] | 0) >>> 0) + 4294967296.0 * +((c[(f + 4) >> 2] | 0) >>> 0));
+              f = aB(a, b) | 0;
+              while (1) {
+                if (!f) break;
+                e = c[f >> 2] & 3;
+                d = c[(((e | 0) == 3 ? f : (f + 48) | 0) + 40) >> 2] | 0;
+                if ((d | 0) == (b | 0)) d = c[(((e | 0) == 2 ? f : (f + -48) | 0) + 40) >> 2] | 0;
+                e = c[((c[(d + 16) >> 2] | 0) + 112) >> 2] | 0;
+                if (
+                  ((c[(e + 32) >> 2] | 0) == (b | 0) ? ((i = (e + 40) | 0), !(+h[i >> 3] != 0.0)) : 0)
+                    ? ((j = (e + 8) | 0),
+                      (h[i >> 3] = g * (+((c[j >> 2] | 0) >>> 0) + 4294967296.0 * +((c[(j + 4) >> 2] | 0) >>> 0))),
+                      (e = (e + 16) | 0),
+                      !(((c[e >> 2] | 0) == 0) & ((c[(e + 4) >> 2] | 0) == 0)))
+                    : 0
+                )
+                  hv(a, d);
+                f = bB(a, f, b) | 0;
+              }
+              return;
+            }
+            function iv(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0;
+              p = l;
+              l = (l + 16) | 0;
+              n = p;
+              o = GA(b, 2, 101541, 0) | 0;
+              c[(n + 4) >> 2] = 0;
+              c[n >> 2] = 0;
+              jv(n, d);
+              j = (o | 0) == 0;
+              a: while (1) {
+                k = kv(n) | 0;
+                if (!k) break;
+                m = (k + 16) | 0;
+                h = c[((c[((c[m >> 2] | 0) + 112) >> 2] | 0) + 24) >> 2] | 0;
+                g = aB(b, k) | 0;
+                h = J6(0, h | 0, 0, 1) | 0;
+                h = P6(h | 0, z | 0, 32) | 0;
+                i = z;
+                while (1) {
+                  if (!g) continue a;
+                  if (!((!j ? (a[(RA(g, o) | 0) >> 0] | 0) == 48 : 0) ? !(s2(RA(g, o) | 0, 138394) | 0) : 0)) {
+                    d = c[g >> 2] & 3;
+                    e = c[(((d | 0) == 3 ? g : (g + 48) | 0) + 40) >> 2] | 0;
+                    if ((e | 0) == (k | 0)) e = c[(((d | 0) == 2 ? g : (g + -48) | 0) + 40) >> 2] | 0;
+                    d = c[((c[(e + 16) >> 2] | 0) + 112) >> 2] | 0;
+                    f = (d + 24) | 0;
+                    q = f;
+                    r = c[(q + 4) >> 2] | 0;
+                    if ((i >>> 0 < r >>> 0) | ((i | 0) == (r | 0) ? h >>> 0 < (c[q >> 2] | 0) >>> 0 : 0)) {
+                      r = f;
+                      c[r >> 2] = h;
+                      c[(r + 4) >> 2] = i;
+                      c[(d + 32) >> 2] = k;
+                      r = ((c[((c[m >> 2] | 0) + 112) >> 2] | 0) + 16) | 0;
+                      q = r;
+                      q = J6(c[q >> 2] | 0, c[(q + 4) >> 2] | 0, 1, 0) | 0;
+                      c[r >> 2] = q;
+                      c[(r + 4) >> 2] = z;
+                      jv(n, e);
+                    }
+                  }
+                  g = bB(b, g, k) | 0;
+                }
+              }
+              l = p;
+              return;
+            }
+            function jv(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = JK(8) | 0;
+              c[d >> 2] = b;
+              b = (a + 4) | 0;
+              e = c[b >> 2] | 0;
+              c[((e | 0) == 0 ? a : (e + 4) | 0) >> 2] = d;
+              c[b >> 2] = d;
+              return;
+            }
+            function kv(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              d = c[a >> 2] | 0;
+              if (d) {
+                b = c[d >> 2] | 0;
+                c[a >> 2] = c[(d + 4) >> 2];
+                U1(d);
+                if (!(c[a >> 2] | 0)) c[(a + 4) >> 2] = 0;
+              } else b = 0;
+              return b | 0;
+            }
+            function lv(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              h = c[c[((c[(b + 16) >> 2] | 0) + 112) >> 2] >> 2] | 0;
+              g = aB(a, b) | 0;
+              h = J6(0, h | 0, 0, 1) | 0;
+              h = P6(h | 0, z | 0, 32) | 0;
+              i = z;
+              while (1) {
+                if (!g) break;
+                f = c[g >> 2] & 3;
+                e = c[(((f | 0) == 3 ? g : (g + 48) | 0) + 40) >> 2] | 0;
+                if ((e | 0) == (b | 0)) e = c[(((f | 0) == 2 ? g : (g + -48) | 0) + 40) >> 2] | 0;
+                if (
+                  (e | 0) != (d | 0)
+                    ? ((j = c[((c[(e + 16) >> 2] | 0) + 112) >> 2] | 0),
+                      (f = j),
+                      (k = c[(f + 4) >> 2] | 0),
+                      (i >>> 0 < k >>> 0) | ((i | 0) == (k | 0) ? h >>> 0 < (c[f >> 2] | 0) >>> 0 : 0))
+                    : 0
+                ) {
+                  k = j;
+                  c[k >> 2] = h;
+                  c[(k + 4) >> 2] = i;
+                  lv(a, e, b);
+                }
+                g = bB(a, g, b) | 0;
+              }
+              return;
+            }
+            function mv(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              f = 0;
+              g = aB(a, b) | 0;
+              while (1) {
+                if (!g) {
+                  d = 1;
+                  break;
+                }
+                e = c[g >> 2] & 3;
+                d = c[(((e | 0) == 3 ? g : (g + 48) | 0) + 40) >> 2] | 0;
+                if ((d | 0) == (b | 0)) d = c[(((e | 0) == 2 ? g : (g + -48) | 0) + 40) >> 2] | 0;
+                if ((d | 0) != (b | 0)) {
+                  if (f)
+                    if ((f | 0) == (d | 0)) d = f;
+                    else {
+                      d = 0;
+                      break;
+                    }
+                } else d = f;
+                f = d;
+                g = bB(a, g, b) | 0;
+              }
+              return d | 0;
+            }
+            function nv(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0.0,
+                g = 0;
+              b = l;
+              l = (l + 32) | 0;
+              e = b;
+              d = GA(a, 1, 94122, 0) | 0;
+              g = GA(a, 0, 94122, 0) | 0;
+              a = ov(a, g, d, GA(a, 0, 94127, 0) | 0) | 0;
+              d = (a + 16) | 0;
+              f = +C(+(+h[a >> 3] + 0.1));
+              zv(e, 0.0, 0.0, f, f);
+              c[d >> 2] = c[e >> 2];
+              c[(d + 4) >> 2] = c[(e + 4) >> 2];
+              c[(d + 8) >> 2] = c[(e + 8) >> 2];
+              c[(d + 12) >> 2] = c[(e + 12) >> 2];
+              c[(d + 16) >> 2] = c[(e + 16) >> 2];
+              c[(d + 20) >> 2] = c[(e + 20) >> 2];
+              c[(d + 24) >> 2] = c[(e + 24) >> 2];
+              c[(d + 28) >> 2] = c[(e + 28) >> 2];
+              pv(a);
+              qv(a);
+              rv(a);
+              l = b;
+              return;
+            }
+            function ov(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              o = JK(72) | 0;
+              c[(o + 60) >> 2] = 0;
+              c[(o + 56) >> 2] = a;
+              k = (a + 16) | 0;
+              f = 0.0;
+              l = 0;
+              i = 1;
+              j = 0;
+              m = 0;
+              while (1) {
+                g = c[k >> 2] | 0;
+                if ((i | 0) > (c[(g + 180) >> 2] | 0)) break;
+                g = ov(c[((c[(g + 184) >> 2] | 0) + (i << 2)) >> 2] | 0, b, d, e) | 0;
+                f = +h[g >> 3] + f;
+                if (j | 0) c[(j + 52) >> 2] = g;
+                l = (l + 1) | 0;
+                i = (i + 1) | 0;
+                j = g;
+                m = (m | 0) == 0 ? g : m;
+              }
+              n = jC(a) | 0;
+              g = m;
+              while (1) {
+                if (!n) break;
+                i = (n + 16) | 0;
+                if (!(c[c[((c[i >> 2] | 0) + 112) >> 2] >> 2] | 0)) {
+                  k = uv(n, d) | 0;
+                  f = +h[k >> 3] + f;
+                  if (j | 0) c[(j + 52) >> 2] = k;
+                  c[c[((c[i >> 2] | 0) + 112) >> 2] >> 2] = a;
+                  i = (l + 1) | 0;
+                  j = k;
+                  g = (g | 0) == 0 ? k : g;
+                } else i = l;
+                n = kC(a, n) | 0;
+                l = i;
+              }
+              c[(o + 64) >> 2] = l;
+              if (!l) f = +wv(a, b);
+              else {
+                h[(o + 8) >> 3] = f;
+                f = +vv(o, e);
+              }
+              h[o >> 3] = f;
+              c[(o + 48) >> 2] = g;
+              return o | 0;
+            }
+            function pv(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0.0,
+                r = 0.0,
+                s = 0.0,
+                t = 0.0,
+                u = 0.0;
+              p = l;
+              l = (l + 176) | 0;
+              f = (p + 144) | 0;
+              n = (p + 64) | 0;
+              k = (p + 32) | 0;
+              i = p;
+              o = c[(a + 64) >> 2] | 0;
+              a: do
+                if (o | 0) {
+                  m = JK(o << 2) | 0;
+                  b = (a + 48) | 0;
+                  e = 0;
+                  d = b;
+                  while (1) {
+                    d = c[d >> 2] | 0;
+                    if ((e | 0) >= (o | 0)) break;
+                    c[(m + (e << 2)) >> 2] = d;
+                    e = (e + 1) | 0;
+                    d = (d + 52) | 0;
+                  }
+                  o4(m, o, 4, 80);
+                  j = JK(o << 3) | 0;
+                  d = 0;
+                  while (1) {
+                    if ((d | 0) >= (o | 0)) break;
+                    h[(j + (d << 3)) >> 3] = +h[c[(m + (d << 2)) >> 2] >> 3];
+                    d = (d + 1) | 0;
+                  }
+                  g = +h[(a + 8) >> 3];
+                  if (+h[a >> 3] == g) {
+                    i = (a + 16) | 0;
+                    c[f >> 2] = c[i >> 2];
+                    c[(f + 4) >> 2] = c[(i + 4) >> 2];
+                    c[(f + 8) >> 2] = c[(i + 8) >> 2];
+                    c[(f + 12) >> 2] = c[(i + 12) >> 2];
+                    c[(f + 16) >> 2] = c[(i + 16) >> 2];
+                    c[(f + 20) >> 2] = c[(i + 20) >> 2];
+                    c[(f + 24) >> 2] = c[(i + 24) >> 2];
+                    c[(f + 28) >> 2] = c[(i + 28) >> 2];
+                    i = xv(o, j, f) | 0;
+                  } else {
+                    q = +h[(a + 40) >> 3];
+                    r = +h[(a + 32) >> 3];
+                    h[i >> 3] = +h[(a + 16) >> 3];
+                    h[(i + 8) >> 3] = +h[(a + 24) >> 3];
+                    s = q - r;
+                    g = (r + q - +C(+(g * 4.0 + s * s))) * 0.5;
+                    h[(i + 16) >> 3] = r - g;
+                    h[(i + 24) >> 3] = q - g;
+                    c[f >> 2] = c[i >> 2];
+                    c[(f + 4) >> 2] = c[(i + 4) >> 2];
+                    c[(f + 8) >> 2] = c[(i + 8) >> 2];
+                    c[(f + 12) >> 2] = c[(i + 12) >> 2];
+                    c[(f + 16) >> 2] = c[(i + 16) >> 2];
+                    c[(f + 20) >> 2] = c[(i + 20) >> 2];
+                    c[(f + 24) >> 2] = c[(i + 24) >> 2];
+                    c[(f + 28) >> 2] = c[(i + 28) >> 2];
+                    i = xv(o, j, f) | 0;
+                  }
+                  if (0) {
+                    f = c[15712] | 0;
+                    q = +h[(a + 24) >> 3];
+                    r = +h[(a + 32) >> 3];
+                    s = +h[(a + 40) >> 3];
+                    h[k >> 3] = +h[(a + 16) >> 3];
+                    h[(k + 8) >> 3] = q;
+                    h[(k + 16) >> 3] = r;
+                    h[(k + 24) >> 3] = s;
+                    w4(f, 94174, k) | 0;
+                  }
+                  e = c[15712] | 0;
+                  d = 0;
+                  while (1) {
+                    if ((d | 0) >= (o | 0)) break;
+                    k = ((c[(m + (d << 2)) >> 2] | 0) + 16) | 0;
+                    f = (i + (d << 5)) | 0;
+                    c[k >> 2] = c[f >> 2];
+                    c[(k + 4) >> 2] = c[(f + 4) >> 2];
+                    c[(k + 8) >> 2] = c[(f + 8) >> 2];
+                    c[(k + 12) >> 2] = c[(f + 12) >> 2];
+                    c[(k + 16) >> 2] = c[(f + 16) >> 2];
+                    c[(k + 20) >> 2] = c[(f + 20) >> 2];
+                    c[(k + 24) >> 2] = c[(f + 24) >> 2];
+                    c[(k + 28) >> 2] = c[(f + 28) >> 2];
+                    if (0) {
+                      g = +h[f >> 3];
+                      r = +h[(i + (d << 5) + 16) >> 3];
+                      u = r * 0.5;
+                      q = +h[(i + (d << 5) + 8) >> 3];
+                      s = +h[(i + (d << 5) + 24) >> 3];
+                      t = s * 0.5;
+                      h[n >> 3] = +h[(j + (d << 3)) >> 3];
+                      h[(n + 8) >> 3] = g - u;
+                      h[(n + 16) >> 3] = q - t;
+                      h[(n + 24) >> 3] = u + g;
+                      h[(n + 32) >> 3] = t + q;
+                      h[(n + 40) >> 3] = s * r;
+                      h[(n + 48) >> 3] = g;
+                      h[(n + 56) >> 3] = q;
+                      h[(n + 64) >> 3] = r;
+                      h[(n + 72) >> 3] = s;
+                      w4(e, 94191, n) | 0;
+                    }
+                    d = (d + 1) | 0;
+                  }
+                  U1(m);
+                  U1(j);
+                  U1(i);
+                  d = 0;
+                  while (1) {
+                    b = c[b >> 2] | 0;
+                    if ((d | 0) >= (o | 0)) break a;
+                    if (!(c[(b + 60) >> 2] | 0)) pv(b);
+                    b = (b + 52) | 0;
+                    d = (d + 1) | 0;
+                  }
+                }
+              while (0);
+              l = p;
+              return;
+            }
+            function qv(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0.0,
+                m = 0.0;
+              f = l;
+              l = (l + 48) | 0;
+              e = f;
+              if (c[(a + 60) >> 2] | 0) {
+                k = +h[(a + 24) >> 3];
+                i = +h[(a + 32) >> 3];
+                g = +h[(a + 40) >> 3];
+                b = c[(a + 56) >> 2] | 0;
+                d = (b + 16) | 0;
+                j = c[d >> 2] | 0;
+                h[(j + 16) >> 3] = +h[(a + 16) >> 3];
+                h[(j + 24) >> 3] = k;
+                a = c[d >> 2] | 0;
+                h[(a + 32) >> 3] = i * 0.013888888888888888;
+                h[(a + 40) >> 3] = g * 0.013888888888888888;
+                qQ(b, c[((c[((xC(b) | 0) + 16) >> 2] | 0) + 116) >> 2] & 1);
+                sv(b);
+                if (0) {
+                  j = c[15712] | 0;
+                  a = KB(b) | 0;
+                  d = c[d >> 2] | 0;
+                  m = +h[(d + 16) >> 3];
+                  g = +h[(d + 24) >> 3];
+                  i = +h[(d + 80) >> 3];
+                  k = +h[(d + 96) >> 3] + +h[(d + 88) >> 3];
+                  c[e >> 2] = a;
+                  h[(e + 8) >> 3] = m;
+                  h[(e + 16) >> 3] = g;
+                  h[(e + 24) >> 3] = i;
+                  h[(e + 32) >> 3] = k;
+                  w4(j, 94133, e) | 0;
+                }
+              } else {
+                b = (a + 48) | 0;
+                while (1) {
+                  b = c[b >> 2] | 0;
+                  if (!b) break;
+                  qv(b);
+                  b = (b + 52) | 0;
+                }
+                i = +h[(a + 32) >> 3];
+                m = +h[(a + 40) >> 3];
+                g = +h[(a + 16) >> 3] - i * 0.5;
+                k = +h[(a + 24) >> 3] - m * 0.5;
+                j = c[((c[(a + 56) >> 2] | 0) + 16) >> 2] | 0;
+                h[(j + 16) >> 3] = g;
+                h[(j + 24) >> 3] = k;
+                h[(j + 32) >> 3] = g + i;
+                h[(j + 40) >> 3] = k + m;
+              }
+              l = f;
+              return;
+            }
+            function rv(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0;
+              e = c[(a + 64) >> 2] | 0;
+              b = (a + 48) | 0;
+              d = 0;
+              while (1) {
+                b = c[b >> 2] | 0;
+                if ((d | 0) >= (e | 0)) break;
+                rv(b);
+                b = (b + 52) | 0;
+                d = (d + 1) | 0;
+              }
+              U1(a);
+              return;
+            }
+            function sv(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              g = l;
+              l = (l + 48) | 0;
+              f = g;
+              d = (g + 8) | 0;
+              e = c[47150] | 0;
+              if (e | 0 ? (a[(RA(b, e) | 0) >> 0] | 0) == 0 : 0) {
+                h[f >> 3] = +h[((c[(b + 16) >> 2] | 0) + 80) >> 3] * 0.7;
+                m4(d, 94168, f) | 0;
+                KA(b, c[47150] | 0, d) | 0;
+              }
+              sP(b);
+              l = g;
+              return;
+            }
+            function tv(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0;
+              d = +h[c[a >> 2] >> 3] - +h[c[b >> 2] >> 3];
+              return (d < 0.0 ? 1 : ((d > 0.0) << 31) >> 31) | 0;
+            }
+            function uv(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = JK(72) | 0;
+              h[d >> 3] = +wv(a, b);
+              c[(d + 60) >> 2] = 1;
+              c[(d + 56) >> 2] = a;
+              return d | 0;
+            }
+            function vv(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0.0;
+              d = +_O(c[(a + 56) >> 2] | 0, b, 0.0, 0.0);
+              if (d == 0.0) d = +h[(a + 8) >> 3];
+              else {
+                d = +C(+(+h[(a + 8) >> 3])) + d * 2.0;
+                d = d * d;
+              }
+              return +d;
+            }
+            function wv(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0.0;
+              c = +_O(a, b, 1.0, 0.0);
+              return +(c == 0.0 ? 1.0e3 : c * 1.0e3);
+            }
+            function xv(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0.0,
+                g = 0,
+                i = 0,
+                j = 0.0;
+              i = l;
+              l = (l + 32) | 0;
+              g = i;
+              e = 0;
+              f = 0.0;
+              while (1) {
+                if ((e | 0) >= (a | 0)) break;
+                j = +h[(b + (e << 3)) >> 3] + f;
+                e = (e + 1) | 0;
+                f = j;
+              }
+              if (f > +h[(d + 24) >> 3] * +h[(d + 16) >> 3] + 0.001) e = 0;
+              else {
+                e = JK(a << 5) | 0;
+                c[g >> 2] = c[d >> 2];
+                c[(g + 4) >> 2] = c[(d + 4) >> 2];
+                c[(g + 8) >> 2] = c[(d + 8) >> 2];
+                c[(g + 12) >> 2] = c[(d + 12) >> 2];
+                c[(g + 16) >> 2] = c[(d + 16) >> 2];
+                c[(g + 20) >> 2] = c[(d + 20) >> 2];
+                c[(g + 24) >> 2] = c[(d + 24) >> 2];
+                c[(g + 28) >> 2] = c[(d + 28) >> 2];
+                yv(a, b, e, 0, 0.0, 1.0, 0.0, 1.0, g);
+              }
+              l = i;
+              return e | 0;
+            }
+            function yv(a, b, d, e, f, g, i, j, k) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = +f;
+              g = +g;
+              i = +i;
+              j = +j;
+              k = k | 0;
+              var m = 0,
+                n = 0.0,
+                o = 0.0,
+                p = 0,
+                q = 0.0,
+                r = 0.0,
+                s = 0.0,
+                t = 0.0,
+                u = 0,
+                v = 0.0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0.0;
+              z = l;
+              l = (l + 112) | 0;
+              y = (z + 72) | 0;
+              u = (z + 40) | 0;
+              p = (z + 32) | 0;
+              m = z;
+              w = (k + 16) | 0;
+              q = +h[w >> 3];
+              x = (k + 24) | 0;
+              r = +h[x >> 3];
+              v = +h[(k + 16 + ((!(q < r) & 1) << 3)) >> 3];
+              do
+                if ((a | 0) >= 1) {
+                  if (0) {
+                    A = c[15712] | 0;
+                    B = +h[(k + 8) >> 3];
+                    h[m >> 3] = +h[k >> 3];
+                    h[(m + 8) >> 3] = q;
+                    h[(m + 16) >> 3] = B;
+                    h[(m + 24) >> 3] = r;
+                    w4(A, 94228, m) | 0;
+                    c[p >> 2] = e;
+                    w4(A, 94274, p) | 0;
+                  }
+                  if (!e) {
+                    i = +h[b >> 3];
+                    B = v * v;
+                    v = i / B;
+                    B = B / i;
+                    c[y >> 2] = c[k >> 2];
+                    c[(y + 4) >> 2] = c[(k + 4) >> 2];
+                    c[(y + 8) >> 2] = c[(k + 8) >> 2];
+                    c[(y + 12) >> 2] = c[(k + 12) >> 2];
+                    c[(y + 16) >> 2] = c[(k + 16) >> 2];
+                    c[(y + 20) >> 2] = c[(k + 20) >> 2];
+                    c[(y + 24) >> 2] = c[(k + 24) >> 2];
+                    c[(y + 28) >> 2] = c[(k + 28) >> 2];
+                    yv(a, b, d, 1, i, i, i, v > B ? v : B, y);
+                    break;
+                  }
+                  if (
+                    (a | 0) > (e | 0)
+                      ? ((t = +h[(b + (e << 3)) >> 3]),
+                        (n = t < f ? f : t),
+                        (s = t > g ? g : t),
+                        (t = t + i),
+                        (o = t / v),
+                        (o = o * o),
+                        (B = o / s),
+                        (o = n / o),
+                        (o = B > o ? B : o),
+                        o <= j)
+                      : 0
+                  ) {
+                    c[y >> 2] = c[k >> 2];
+                    c[(y + 4) >> 2] = c[(k + 4) >> 2];
+                    c[(y + 8) >> 2] = c[(k + 8) >> 2];
+                    c[(y + 12) >> 2] = c[(k + 12) >> 2];
+                    c[(y + 16) >> 2] = c[(k + 16) >> 2];
+                    c[(y + 20) >> 2] = c[(k + 20) >> 2];
+                    c[(y + 24) >> 2] = c[(k + 24) >> 2];
+                    c[(y + 28) >> 2] = c[(k + 28) >> 2];
+                    yv(a, b, d, (e + 1) | 0, n, s, t, o, y);
+                    break;
+                  }
+                  q = i / v;
+                  if (0) {
+                    A = c[15712] | 0;
+                    c[u >> 2] = e;
+                    h[(u + 8) >> 3] = i;
+                    h[(u + 16) >> 3] = v;
+                    h[(u + 24) >> 3] = q;
+                    w4(A, 94299, u) | 0;
+                  }
+                  n = +h[w >> 3];
+                  if (v == n) {
+                    o = 1.0 / q;
+                    p = (k + 8) | 0;
+                    n = +h[k >> 3] - n * 0.5;
+                    m = 0;
+                    while (1) {
+                      if ((m | 0) >= (e | 0)) break;
+                      h[(d + (m << 5) + 24) >> 3] = q;
+                      B = +h[(b + (m << 3)) >> 3] * o;
+                      h[(d + (m << 5) + 16) >> 3] = B;
+                      h[(d + (m << 5) + 8) >> 3] = (+h[x >> 3] - q) * 0.5 + +h[p >> 3];
+                      h[(d + (m << 5)) >> 3] = B * 0.5 + n;
+                      n = B + n;
+                      m = (m + 1) | 0;
+                    }
+                    h[p >> 3] = +h[p >> 3] - q * 0.5;
+                    m = 1;
+                  } else {
+                    o = 1.0 / q;
+                    n = +h[x >> 3] * 0.5 + +h[(k + 8) >> 3];
+                    m = 0;
+                    while (1) {
+                      if ((m | 0) >= (e | 0)) break;
+                      h[(d + (m << 5) + 16) >> 3] = q;
+                      B = +h[(b + (m << 3)) >> 3] * o;
+                      h[(d + (m << 5) + 24) >> 3] = B;
+                      h[(d + (m << 5)) >> 3] = (q - +h[w >> 3]) * 0.5 + +h[k >> 3];
+                      h[(d + (m << 5) + 8) >> 3] = n - B * 0.5;
+                      n = n - B;
+                      m = (m + 1) | 0;
+                    }
+                    h[k >> 3] = +h[k >> 3] + q * 0.5;
+                    m = 0;
+                  }
+                  A = (k + 16 + (m << 3)) | 0;
+                  h[A >> 3] = +h[A >> 3] - q;
+                  c[y >> 2] = c[k >> 2];
+                  c[(y + 4) >> 2] = c[(k + 4) >> 2];
+                  c[(y + 8) >> 2] = c[(k + 8) >> 2];
+                  c[(y + 12) >> 2] = c[(k + 12) >> 2];
+                  c[(y + 16) >> 2] = c[(k + 16) >> 2];
+                  c[(y + 20) >> 2] = c[(k + 20) >> 2];
+                  c[(y + 24) >> 2] = c[(k + 24) >> 2];
+                  c[(y + 28) >> 2] = c[(k + 28) >> 2];
+                  yv((a - e) | 0, (b + (e << 3)) | 0, (d + (e << 5)) | 0, 0, 0.0, 0.0, 0.0, 1.0, y);
+                }
+              while (0);
+              l = z;
+              return;
+            }
+            function zv(a, b, c, d, e) {
+              a = a | 0;
+              b = +b;
+              c = +c;
+              d = +d;
+              e = +e;
+              h[a >> 3] = b;
+              h[(a + 8) >> 3] = c;
+              h[(a + 16) >> 3] = d;
+              h[(a + 24) >> 3] = e;
+              return;
+            }
+            function Av(a, d, e) {
+              a = a | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0.0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0;
+              D = l;
+              l = (l + 96) | 0;
+              C = (D + 48) | 0;
+              B = (D + 24) | 0;
+              A = (D + 16) | 0;
+              z = (D + 8) | 0;
+              u = (D + 80) | 0;
+              v = D;
+              w = (a + 16) | 0;
+              x = (d + 4) | 0;
+              y = (u + 4) | 0;
+              s = jC(a) | 0;
+              e = 0;
+              f = 0;
+              i = 0;
+              j = 0;
+              while (1) {
+                if (!s) break;
+                t = XA(a, s) | 0;
+                q = e;
+                r = j;
+                while (1) {
+                  if (!t) break;
+                  e = (b[((c[(t + 16) >> 2] | 0) + 168) >> 1] | 0) == 0;
+                  do
+                    if ((s | 0) == (c[((((c[t >> 2] & 3) | 0) == 2 ? t : (t + -48) | 0) + 40) >> 2] | 0))
+                      if (e) {
+                        j = q;
+                        e = r;
+                      } else {
+                        if (!f) {
+                          e = JK(96) | 0;
+                          c[(e + 84) >> 2] = JK((((tB(a) | 0) << 5) + 11520) | 0) | 0;
+                          f = e;
+                        } else e = r;
+                        Km(f, t, c[((c[w >> 2] | 0) + 248) >> 2] | 0);
+                        j = q;
+                      }
+                    else if (!e) {
+                      i = Bv(t, d) | 0;
+                      j = (i + 8) | 0;
+                      if (lt(c[j >> 2] | 0, c[i >> 2] | 0) | 0) {
+                        k = JX(c[j >> 2] | 0, c[i >> 2] | 0) | 0;
+                        if (!k) {
+                          gA(0, 94352, z) | 0;
+                          j = 1;
+                          e = r;
+                          break;
+                        } else e = t;
+                        while (1) {
+                          if (!e) break;
+                          E = (e + 16) | 0;
+                          F = ((c[E >> 2] | 0) + 144) | 0;
+                          Qm(v, e, k, 0, c[j >> 2] | 0, c[i >> 2] | 0);
+                          H = v;
+                          G = c[(H + 4) >> 2] | 0;
+                          c[F >> 2] = c[H >> 2];
+                          c[(F + 4) >> 2] = G;
+                          Sm(a, e, c[j >> 2] | 0, c[i >> 2] | 0, 0);
+                          e = c[((c[E >> 2] | 0) + 172) >> 2] | 0;
+                        }
+                        Cv(i);
+                        j = q;
+                        e = r;
+                        break;
+                      }
+                      if (!q) {
+                        lr(u, a);
+                        e = lH(a, 8, 8) | 0;
+                        gA(0, 94436, A) | 0;
+                        n = +(e | 0);
+                        o = +g[d >> 2];
+                        p = +g[x >> 2];
+                        if (!(o >= n) & !(p >= n)) {
+                          m = +g[u >> 2];
+                          n = +g[y >> 2];
+                          if (!(!(m <= o) & !(n <= p))) {
+                            h[C >> 3] = m;
+                            h[(C + 8) >> 3] = n;
+                            h[(C + 16) >> 3] = o;
+                            h[(C + 24) >> 3] = p;
+                            gA(3, 94552, C) | 0;
+                          }
+                        } else {
+                          c[B >> 2] = e;
+                          h[(B + 8) >> 3] = o;
+                          h[(B + 16) >> 3] = p;
+                          gA(3, 94502, B) | 0;
+                        }
+                        j = 1;
+                        e = r;
+                      } else {
+                        j = q;
+                        e = r;
+                      }
+                    } else {
+                      j = q;
+                      e = r;
+                    }
+                  while (0);
+                  t = ZA(a, t) | 0;
+                  q = j;
+                  r = e;
+                }
+                s = kC(a, s) | 0;
+                e = q;
+                j = r;
+              }
+              Dv(i);
+              if (f | 0) {
+                U1(c[(f + 84) >> 2] | 0);
+                U1(j);
+              }
+              l = D;
+              return e | 0;
+            }
+            function Bv(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              p = l;
+              l = (l + 16) | 0;
+              m = (p + 4) | 0;
+              n = p;
+              e = c[b >> 2] & 3;
+              f = c[(((e | 0) == 2 ? b : (b + -48) | 0) + 40) >> 2] | 0;
+              e = c[(((e | 0) == 3 ? b : (b + 48) | 0) + 40) >> 2] | 0;
+              q = (f + 16) | 0;
+              h = c[((c[q >> 2] | 0) + 212) >> 2] | 0;
+              c[m >> 2] = h;
+              i = (e + 16) | 0;
+              g = c[((c[i >> 2] | 0) + 212) >> 2] | 0;
+              c[n >> 2] = g;
+              k = JK(12) | 0;
+              b = h;
+              j = g;
+              if (a[((c[q >> 2] | 0) + 118) >> 0] | 0) {
+                b = c[((c[((c[(b + 16) >> 2] | 0) + 140) >> 2] | 0) + 48) >> 2] | 0;
+                c[m >> 2] = b;
+                f = h;
+                h = b;
+              }
+              if (!(a[((c[i >> 2] | 0) + 118) >> 0] | 0)) i = j;
+              else {
+                i = c[((c[((c[(j + 16) >> 2] | 0) + 140) >> 2] | 0) + 48) >> 2] | 0;
+                c[n >> 2] = i;
+                e = g;
+                g = i;
+              }
+              h = c[((c[((c[(h + 16) >> 2] | 0) + 140) >> 2] | 0) + 44) >> 2] | 0;
+              g = c[((c[((c[(g + 16) >> 2] | 0) + 140) >> 2] | 0) + 44) >> 2] | 0;
+              if ((h | 0) <= (g | 0))
+                if ((g | 0) > (h | 0)) {
+                  Ev(k, g, e, h, n, d);
+                  b = c[n >> 2] | 0;
+                  g = b;
+                  e = n;
+                  o = 11;
+                } else h = i;
+              else {
+                Ev(k, h, f, g, m, d);
+                b = c[m >> 2] | 0;
+                f = b;
+                g = e;
+                e = m;
+                o = 11;
+              }
+              while (1) {
+                if ((o | 0) == 11) {
+                  c[e >> 2] = c[((c[((c[(b + 16) >> 2] | 0) + 140) >> 2] | 0) + 48) >> 2];
+                  e = g;
+                  b = c[m >> 2] | 0;
+                  h = c[n >> 2] | 0;
+                }
+                if ((b | 0) == (h | 0)) break;
+                Fv(k, b, 0, f, d);
+                Fv(k, h, e, 0, d);
+                c[m >> 2] = c[((c[((c[(b + 16) >> 2] | 0) + 140) >> 2] | 0) + 48) >> 2];
+                f = b;
+                g = h;
+                e = n;
+                b = h;
+                o = 11;
+              }
+              Fv(k, h, e, f, d);
+              l = p;
+              return k | 0;
+            }
+            function Cv(a) {
+              a = a | 0;
+              c[a >> 2] = 0;
+              return;
+            }
+            function Dv(a) {
+              a = a | 0;
+              if (a | 0) {
+                U1(c[(a + 8) >> 2] | 0);
+                U1(a);
+              }
+              return;
+            }
+            function Ev(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0;
+              i = f;
+              while (1) {
+                h = c[i >> 2] | 0;
+                if ((b | 0) <= (e | 0)) break;
+                Fv(a, h, d, 0, g);
+                b = (b + -1) | 0;
+                i = ((c[((c[(h + 16) >> 2] | 0) + 140) >> 2] | 0) + 48) | 0;
+                d = h;
+              }
+              c[f >> 2] = d;
+              return;
+            }
+            function Fv(b, d, e, f, g) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0;
+              h = jC(d) | 0;
+              while (1) {
+                if (!h) break;
+                i = c[(h + 16) >> 2] | 0;
+                if (
+                  !(((h | 0) == (f | 0)) | ((h | 0) == (e | 0) ? 1 : (c[(i + 212) >> 2] | 0) != (d | 0)))
+                    ? (a[(i + 118) >> 0] | 0) == 0
+                    : 0
+                )
+                  Gv(b, Nm(h, g, 0) | 0);
+                h = kC(d, h) | 0;
+              }
+              i = (d + 16) | 0;
+              d = 1;
+              while (1) {
+                h = c[i >> 2] | 0;
+                if ((d | 0) > (c[(h + 180) >> 2] | 0)) break;
+                h = c[((c[(h + 184) >> 2] | 0) + (d << 2)) >> 2] | 0;
+                if (!(((h | 0) == (e | 0)) | ((h | 0) == (f | 0)))) Gv(b, Hv(h, g) | 0);
+                d = (d + 1) | 0;
+              }
+              return;
+            }
+            function Gv(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              e = (a + 4) | 0;
+              f = c[e >> 2] | 0;
+              g = (a + 8) | 0;
+              d = c[g >> 2] | 0;
+              do
+                if ((f | 0) == (c[a >> 2] | 0))
+                  if (!d) {
+                    d = KK(400) | 0;
+                    c[g >> 2] = d;
+                    c[e >> 2] = 100;
+                    break;
+                  } else {
+                    c[e >> 2] = f << 1;
+                    d = MK(d, f << 3) | 0;
+                    c[g >> 2] = d;
+                    break;
+                  }
+              while (0);
+              g = c[a >> 2] | 0;
+              c[a >> 2] = g + 1;
+              c[(d + (g << 2)) >> 2] = b;
+              return;
+            }
+            function Hv(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0.0,
+                i = 0.0,
+                j = 0.0,
+                k = 0.0,
+                l = 0.0,
+                m = 0,
+                n = 0.0,
+                o = 0.0,
+                p = 0.0;
+              m = JK(8) | 0;
+              b = c[(b + 16) >> 2] | 0;
+              e = +h[(b + 16) >> 3];
+              l = +h[(b + 24) >> 3];
+              f = +h[(b + 32) >> 3];
+              k = +h[(b + 40) >> 3];
+              c[(m + 4) >> 2] = 4;
+              b = JK(64) | 0;
+              c[m >> 2] = b;
+              if (!(a[(d + 8) >> 0] | 0)) {
+                p = +g[d >> 2];
+                o = +g[(d + 4) >> 2];
+                i = (f + e) * 0.5 * (p + -1.0);
+                n = (k + l) * 0.5 * (o + -1.0);
+                j = e * p - i;
+                i = f * p - i;
+                f = k * o - n;
+                e = l * o - n;
+              } else {
+                i = +g[d >> 2];
+                p = +g[(d + 4) >> 2];
+                j = e - i;
+                i = f + i;
+                f = k + p;
+                e = l - p;
+              }
+              h[b >> 3] = j;
+              h[(b + 8) >> 3] = e;
+              h[(b + 16) >> 3] = j;
+              h[(b + 24) >> 3] = f;
+              h[(b + 32) >> 3] = i;
+              h[(b + 40) >> 3] = f;
+              h[(b + 48) >> 3] = i;
+              h[(b + 56) >> 3] = e;
+              return m | 0;
+            }
+            function Iv(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              o = l;
+              l = (l + 160) | 0;
+              n = (o + 16) | 0;
+              j = (o + 8) | 0;
+              g = o;
+              k = (o + 24) | 0;
+              m = JK(tB(b) | 0) | 0;
+              h = (b + 16) | 0;
+              f = c[c[((c[h >> 2] | 0) + 140) >> 2] >> 2] | 0;
+              a: do
+                if (!f) {
+                  g = 0;
+                  f = 0;
+                } else {
+                  p = KB(b) | 0;
+                  i = c[46923] | 0;
+                  c[g >> 2] = p;
+                  c[(g + 4) >> 2] = i;
+                  m4(k, 94612, g) | 0;
+                  i = ND(b, k, 1) | 0;
+                  TC(i, 137483, 280, 1) | 0;
+                  g = JK(56) | 0;
+                  c[((c[(i + 16) >> 2] | 0) + 140) >> 2] = g;
+                  c[g >> 2] = f;
+                  c[(g + 4) >> 2] = c[((c[((c[h >> 2] | 0) + 140) >> 2] | 0) + 4) >> 2];
+                  while (1) {
+                    g = c[(f + 4) >> 2] | 0;
+                    if (!g) {
+                      g = i;
+                      f = 1;
+                      break a;
+                    }
+                    if (!(a[(m + (c[((c[(g + 16) >> 2] | 0) + 120) >> 2] | 0)) >> 0] | 0)) Jv(b, g, i, m);
+                    f = (f + 16) | 0;
+                  }
+                }
+              while (0);
+              h = 0;
+              i = jC(b) | 0;
+              while (1) {
+                if (!i) break;
+                p = c[(i + 16) >> 2] | 0;
+                if ((a[(m + (c[(p + 120) >> 2] | 0)) >> 0] | 0) == 0 ? (a[(p + 119) >> 0] | 0) == 3 : 0) {
+                  if (!g) {
+                    p = KB(b) | 0;
+                    g = ((c[46923] | 0) + f) | 0;
+                    c[j >> 2] = p;
+                    c[(j + 4) >> 2] = g;
+                    m4(k, 94612, j) | 0;
+                    g = ND(b, k, 1) | 0;
+                    TC(g, 137483, 280, 1) | 0;
+                    p = JK(56) | 0;
+                    c[((c[(g + 16) >> 2] | 0) + 140) >> 2] = p;
+                    f = (f + 1) | 0;
+                  }
+                  Jv(b, i, g, m);
+                  h = 1;
+                }
+                i = kC(b, i) | 0;
+              }
+              if (g | 0) KG(g) | 0;
+              g = jC(b) | 0;
+              while (1) {
+                if (!g) break;
+                if (!(a[(m + (c[((c[(g + 16) >> 2] | 0) + 120) >> 2] | 0)) >> 0] | 0)) {
+                  j = KB(b) | 0;
+                  p = ((c[46923] | 0) + f) | 0;
+                  c[n >> 2] = j;
+                  c[(n + 4) >> 2] = p;
+                  m4(k, 94620, n) | 0;
+                  p = ND(b, k, 1) | 0;
+                  TC(p, 137483, 280, 1) | 0;
+                  j = JK(56) | 0;
+                  c[((c[(p + 16) >> 2] | 0) + 140) >> 2] = j;
+                  Jv(b, g, p, m);
+                  KG(p) | 0;
+                  f = (f + 1) | 0;
+                }
+                g = kC(b, g) | 0;
+              }
+              U1(m);
+              c[46923] = (c[46923] | 0) + f;
+              if (d | 0) c[d >> 2] = f;
+              if (e | 0) c[e >> 2] = h;
+              i = JK(((f << 2) + 4) | 0) | 0;
+              h = i;
+              g = OD(b) | 0;
+              while (1) {
+                if (!g) break;
+                c[h >> 2] = g;
+                h = (h + 4) | 0;
+                g = PD(g) | 0;
+                f = (f + -1) | 0;
+              }
+              if (!f) {
+                c[h >> 2] = 0;
+                l = o;
+                return i | 0;
+              } else qa(94628, 94639, 134, 94646);
+              return 0;
+            }
+            function Jv(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0;
+              a[(f + (c[((c[(d + 16) >> 2] | 0) + 120) >> 2] | 0)) >> 0] = 1;
+              oC(e, d, 1) | 0;
+              i = aB(b, d) | 0;
+              while (1) {
+                if (!i) break;
+                h = c[i >> 2] & 3;
+                g = c[(((h | 0) == 3 ? i : (i + 48) | 0) + 40) >> 2] | 0;
+                if ((g | 0) == (d | 0)) g = c[(((h | 0) == 2 ? i : (i + -48) | 0) + 40) >> 2] | 0;
+                if (!(a[(f + (c[((c[(g + 16) >> 2] | 0) + 120) >> 2] | 0)) >> 0] | 0)) Jv(b, g, e, f);
+                i = bB(b, i, d) | 0;
+              }
+              return;
+            }
+            function Kv(a) {
+              a = a | 0;
+              var b = 0;
+              b = KK(24) | 0;
+              c[46924] = b;
+              c[b >> 2] = Vz(18204, c[4581] | 0) | 0;
+              c[(b + 16) >> 2] = 0;
+              c[(b + 12) >> 2] = 0;
+              c[(b + 4) >> 2] = Lv(a) | 0;
+              return b | 0;
+            }
+            function Lv(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = KK(16) | 0;
+              c[(b + 12) >> 2] = 0;
+              d = KK((a * 20) | 0) | 0;
+              c[b >> 2] = d;
+              c[(b + 8) >> 2] = d + ((a * 20) | 0);
+              c[(b + 4) >> 2] = d;
+              return b | 0;
+            }
+            function Mv(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              d = Ov(c[46924] | 0) | 0;
+              c[d >> 2] = c[b >> 2];
+              c[(d + 4) >> 2] = c[(b + 4) >> 2];
+              c[(d + 8) >> 2] = 0;
+              return d | 0;
+            }
+            function Nv(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              a = ((c[b >> 2] | 0) - (c[d >> 2] | 0)) | 0;
+              if (!a) a = ((c[(b + 4) >> 2] | 0) - (c[(d + 4) >> 2] | 0)) | 0;
+              return a | 0;
+            }
+            function Ov(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              f = (a + 8) | 0;
+              a = c[f >> 2] | 0;
+              b = c[(a + 4) >> 2] | 0;
+              if ((b | 0) == (c[(a + 8) >> 2] | 0)) {
+                d = (a + 12) | 0;
+                e = c[d >> 2] | 0;
+                if (!e) {
+                  a = Lv(((((b - (c[a >> 2] | 0)) | 0) / 20) | 0) << 1) | 0;
+                  c[d >> 2] = a;
+                } else a = e;
+                c[f >> 2] = a;
+                b = c[a >> 2] | 0;
+                c[(a + 4) >> 2] = b;
+              }
+              c[(a + 4) >> 2] = b + 20;
+              return b | 0;
+            }
+            function Pv(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              f = (a + 12) | 0;
+              d = c[f >> 2] | 0;
+              if ((d | 0) < (b | 0)) {
+                e = d << 1;
+                e = (e | 0) < (b | 0) ? b : e;
+                b = (a + 16) | 0;
+                d = c[b >> 2] | 0;
+                if (d | 0) U1(d);
+                c[b >> 2] = KK(e << 3) | 0;
+                c[f >> 2] = e;
+              }
+              return;
+            }
+            function Qv(a) {
+              a = a | 0;
+              var b = 0;
+              b = c[a >> 2] | 0;
+              nb[c[b >> 2] & 63](b, 0, 64) | 0;
+              c[(a + 20) >> 2] = c[(a + 16) >> 2];
+              b = c[(a + 4) >> 2] | 0;
+              c[(a + 8) >> 2] = b;
+              c[(b + 4) >> 2] = c[b >> 2];
+              return;
+            }
+            function Rv(a) {
+              a = a | 0;
+              Rz(c[a >> 2] | 0) | 0;
+              Sv(c[(a + 4) >> 2] | 0);
+              U1(c[(a + 16) >> 2] | 0);
+              U1(a);
+              return;
+            }
+            function Sv(a) {
+              a = a | 0;
+              var b = 0;
+              while (1) {
+                if (!a) break;
+                b = c[(a + 12) >> 2] | 0;
+                U1(c[a >> 2] | 0);
+                U1(a);
+                a = b;
+              }
+              return;
+            }
+            function Tv(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              g = l;
+              l = (l + 32) | 0;
+              f = g;
+              h = (g + 12) | 0;
+              c[h >> 2] = b;
+              c[(h + 4) >> 2] = d;
+              i = c[a >> 2] | 0;
+              h = ((nb[c[i >> 2] & 63](i, h, 1) | 0) + 8) | 0;
+              c[h >> 2] = Uv(a, e, c[h >> 2] | 0) | 0;
+              if (0 > 2) {
+                i = c[15712] | 0;
+                h = KB(e) | 0;
+                c[f >> 2] = b;
+                c[(f + 4) >> 2] = d;
+                c[(f + 8) >> 2] = h;
+                w4(i, 94656, f) | 0;
+              }
+              l = g;
+              return;
+            }
+            function Uv(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              e = (a + 20) | 0;
+              a = c[e >> 2] | 0;
+              c[e >> 2] = a + 8;
+              c[a >> 2] = b;
+              c[(a + 4) >> 2] = d;
+              return a | 0;
+            }
+            function Vv(a, b) {
+              a = a | 0;
+              b = b | 0;
+              aA(c[a >> 2] | 0, b, a) | 0;
+              return;
+            }
+            function Wv(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = l;
+              l = (l + 32) | 0;
+              f = e;
+              c[f >> 2] = b;
+              c[(f + 4) >> 2] = d;
+              d = c[a >> 2] | 0;
+              d = nb[c[d >> 2] & 63](d, f, 4) | 0;
+              l = e;
+              return d | 0;
+            }
+            function Xv(a) {
+              a = a | 0;
+              U1(c[(a + 8) >> 2] | 0);
+              U1(a);
+              return;
+            }
+            function Yv(a) {
+              a = a | 0;
+              return +(+h[a >> 3]);
+            }
+            function Zv(a) {
+              a = a | 0;
+              return c[(a + 8) >> 2] | 0;
+            }
+            function _v(a) {
+              a = a | 0;
+              return ~~+h[(a + 16) >> 3] | 0;
+            }
+            function $v(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              b = c[b >> 2] | 0;
+              if ((b | 0) >= (c[d >> 2] | 0)) {
+                b = (b + 10) | 0;
+                c[d >> 2] = b;
+                c[e >> 2] = MK(c[e >> 2] | 0, O(a << 3, b) | 0) | 0;
+                c[f >> 2] = MK(c[f >> 2] | 0, c[d >> 2] << 3) | 0;
+                c[g >> 2] = MK(c[g >> 2] | 0, c[d >> 2] << 3) | 0;
+              }
+              return;
+            }
+            function aw(a, b, d, e, f, g, i, j, k, l, m) {
+              a = a | 0;
+              b = +b;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              j = j | 0;
+              k = k | 0;
+              l = l | 0;
+              m = m | 0;
+              var n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0.0;
+              h[l >> 3] = +h[l >> 3] + 1.0;
+              a: do
+                if (a | 0) {
+                  q = c[(a + 16) >> 2] | 0;
+                  n = c[(a + 40) >> 2] | 0;
+                  if (n | 0)
+                    do {
+                      $v(q, f, g, i, j, k);
+                      if ((_v(zy(n) | 0) | 0) != (e | 0)) {
+                        p = Zv(zy(n) | 0) | 0;
+                        o = 0;
+                        while (1) {
+                          if ((o | 0) >= (q | 0)) break;
+                          h[((c[i >> 2] | 0) + (((O(c[f >> 2] | 0, q) | 0) + o) << 3)) >> 3] = +h[(p + (o << 3)) >> 3];
+                          o = (o + 1) | 0;
+                        }
+                        r = +Yv(zy(n) | 0);
+                        h[((c[j >> 2] | 0) + (c[f >> 2] << 3)) >> 3] = r;
+                        r = +$w(d, p, q);
+                        p = c[f >> 2] | 0;
+                        h[((c[k >> 2] | 0) + (p << 3)) >> 3] = r;
+                        c[f >> 2] = p + 1;
+                      }
+                      n = Ay(n) | 0;
+                    } while ((n | 0) != 0);
+                  p = (a + 36) | 0;
+                  if (c[p >> 2] | 0) {
+                    r = +$w(c[(a + 20) >> 2] | 0, d, q);
+                    if (!(+h[(a + 24) >> 3] < r * b)) {
+                      o = 1 << q;
+                      n = 0;
+                      while (1) {
+                        if ((n | 0) >= (o | 0)) break a;
+                        aw(c[((c[p >> 2] | 0) + (n << 2)) >> 2] | 0, b, d, e, f, g, i, j, k, l, m);
+                        n = (n + 1) | 0;
+                      }
+                    }
+                    $v(q, f, g, i, j, k);
+                    o = (a + 32) | 0;
+                    n = 0;
+                    while (1) {
+                      if ((n | 0) >= (q | 0)) break;
+                      h[((c[i >> 2] | 0) + (((O(c[f >> 2] | 0, q) | 0) + n) << 3)) >> 3] =
+                        +h[((c[o >> 2] | 0) + (n << 3)) >> 3];
+                      n = (n + 1) | 0;
+                    }
+                    h[((c[j >> 2] | 0) + (c[f >> 2] << 3)) >> 3] = +h[(a + 8) >> 3];
+                    r = +$w(c[o >> 2] | 0, d, q);
+                    j = c[f >> 2] | 0;
+                    h[((c[k >> 2] | 0) + (j << 3)) >> 3] = r;
+                    c[f >> 2] = j + 1;
+                  }
+                }
+              while (0);
+              return;
+            }
+            function bw(a, b, d, e, f, g, i, j, k, l, m) {
+              a = a | 0;
+              b = +b;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              j = j | 0;
+              k = k | 0;
+              l = l | 0;
+              m = m | 0;
+              var n = 0;
+              n = c[(a + 16) >> 2] | 0;
+              h[l >> 3] = 0.0;
+              c[f >> 2] = 0;
+              c[m >> 2] = 0;
+              c[g >> 2] = 10;
+              if (!(c[i >> 2] | 0)) c[i >> 2] = KK((n * 80) | 0) | 0;
+              if (!(c[j >> 2] | 0)) c[j >> 2] = KK(c[g >> 2] << 3) | 0;
+              if (!(c[k >> 2] | 0)) c[k >> 2] = KK(c[g >> 2] << 3) | 0;
+              aw(a, b, d, e, f, g, i, j, k, l, m);
+              return;
+            }
+            function cw(a, b, d, e, f, g, i, j) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = +e;
+              f = +f;
+              g = +g;
+              i = i | 0;
+              j = j | 0;
+              var k = 0,
+                l = 0,
+                m = 0;
+              m = c[a >> 2] | 0;
+              l = c[(a + 16) >> 2] | 0;
+              k = 0;
+              while (1) {
+                if ((k | 0) == 4) break;
+                h[(i + (k << 3)) >> 3] = 0.0;
+                k = (k + 1) | 0;
+              }
+              c[j >> 2] = 0;
+              l = O(l, m) | 0;
+              k = 0;
+              while (1) {
+                if ((k | 0) >= (l | 0)) break;
+                h[(b + (k << 3)) >> 3] = 0.0;
+                k = (k + 1) | 0;
+              }
+              dw(a, a, d, b, e, f, g, i);
+              ew(a, b, i);
+              e = 1.0 / +(m | 0);
+              k = 0;
+              while (1) {
+                if ((k | 0) == 4) break;
+                m = (i + (k << 3)) | 0;
+                h[m >> 3] = +h[m >> 3] * e;
+                k = (k + 1) | 0;
+              }
+              return;
+            }
+            function dw(a, b, d, e, f, g, i, j) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = +f;
+              g = +g;
+              i = +i;
+              j = j | 0;
+              var k = 0,
+                l = 0.0,
+                m = 0,
+                n = 0.0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0.0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0;
+              a: do
+                if (((a | 0) != 0) & ((b | 0) != 0)) {
+                  if ((c[a >> 2] | 0) > 0 ? (c[b >> 2] | 0) > 0 : 0) {
+                    w = c[(a + 16) >> 2] | 0;
+                    p = c[(a + 40) >> 2] | 0;
+                    v = (b + 40) | 0;
+                    o = c[v >> 2] | 0;
+                    k = (a + 32) | 0;
+                    m = (b + 32) | 0;
+                    r = +$w(c[k >> 2] | 0, c[m >> 2] | 0, w);
+                    l = +h[(a + 24) >> 3];
+                    n = +h[(b + 24) >> 3];
+                    if (n + l < r * f) {
+                      h[j >> 3] = +h[j >> 3] + 1.0;
+                      q = c[k >> 2] | 0;
+                      n = +h[(a + 8) >> 3];
+                      p = fw(a, w) | 0;
+                      o = c[m >> 2] | 0;
+                      l = +h[(b + 8) >> 3];
+                      m = fw(b, w) | 0;
+                      if (!(r > 0.0)) qa(94798, 94681, 191, 94764);
+                      n = n * i * l;
+                      l = +D(+r, +(1.0 - g));
+                      l = 1.0 / (g == -1.0 ? r * r : l);
+                      k = 0;
+                      while (1) {
+                        if ((k | 0) >= (w | 0)) break a;
+                        i = n * (+h[(q + (k << 3)) >> 3] - +h[(o + (k << 3)) >> 3]) * l;
+                        e = (p + (k << 3)) | 0;
+                        h[e >> 3] = i + +h[e >> 3];
+                        e = (m + (k << 3)) | 0;
+                        h[e >> 3] = +h[e >> 3] - i;
+                        k = (k + 1) | 0;
+                      }
+                    }
+                    m = (p | 0) != 0;
+                    k = (o | 0) != 0;
+                    u = (a | 0) == (b | 0);
+                    if (m & k) {
+                      s = (j + 8) | 0;
+                      t = g == -1.0;
+                      f = 1.0 - g;
+                      m = p;
+                      while (1) {
+                        if (!m) break a;
+                        p = Zv(zy(m) | 0) | 0;
+                        r = +Yv(zy(m) | 0);
+                        q = _v(zy(m) | 0) | 0;
+                        a = gw(e, q, m, w) | 0;
+                        r = r * i;
+                        o = c[v >> 2] | 0;
+                        while (1) {
+                          if (!o) break;
+                          b = Zv(zy(o) | 0) | 0;
+                          l = +Yv(zy(o) | 0);
+                          k = _v(zy(o) | 0) | 0;
+                          j = gw(e, k, o, w) | 0;
+                          b: do
+                            if (!(((q | 0) == (k | 0)) | (u & ((k | 0) < (q | 0))))) {
+                              h[s >> 3] = +h[s >> 3] + 1.0;
+                              g = +Zw(d, w, q, k);
+                              l = r * l;
+                              n = +D(+g, +f);
+                              n = 1.0 / (t ? g * g : n);
+                              k = 0;
+                              while (1) {
+                                if ((k | 0) >= (w | 0)) break b;
+                                g = l * (+h[(p + (k << 3)) >> 3] - +h[(b + (k << 3)) >> 3]) * n;
+                                x = (a + (k << 3)) | 0;
+                                h[x >> 3] = g + +h[x >> 3];
+                                x = (j + (k << 3)) | 0;
+                                h[x >> 3] = +h[x >> 3] - g;
+                                k = (k + 1) | 0;
+                              }
+                            }
+                          while (0);
+                          o = Ay(o) | 0;
+                        }
+                        m = Ay(m) | 0;
+                      }
+                    }
+                    if (u) {
+                      q = 1 << w;
+                      o = (a + 36) | 0;
+                      m = 0;
+                      while (1) {
+                        if ((m | 0) >= (q | 0)) break a;
+                        p = c[((c[o >> 2] | 0) + (m << 2)) >> 2] | 0;
+                        k = m;
+                        while (1) {
+                          if ((k | 0) == (q | 0)) break;
+                          dw(p, c[((c[o >> 2] | 0) + (k << 2)) >> 2] | 0, d, e, f, g, i, j);
+                          k = (k + 1) | 0;
+                        }
+                        m = (m + 1) | 0;
+                      }
+                    }
+                    if (!(m | !(l > n))) {
+                      o = 1 << w;
+                      m = (a + 36) | 0;
+                      k = 0;
+                      while (1) {
+                        if ((k | 0) >= (o | 0)) break a;
+                        dw(c[((c[m >> 2] | 0) + (k << 2)) >> 2] | 0, b, d, e, f, g, i, j);
+                        k = (k + 1) | 0;
+                      }
+                    }
+                    if (!(k | !(n > l))) {
+                      o = 1 << w;
+                      m = (b + 36) | 0;
+                      k = 0;
+                      while (1) {
+                        if ((k | 0) >= (o | 0)) break a;
+                        dw(c[((c[m >> 2] | 0) + (k << 2)) >> 2] | 0, a, d, e, f, g, i, j);
+                        k = (k + 1) | 0;
+                      }
+                    }
+                    if (!m) {
+                      o = 1 << w;
+                      m = (a + 36) | 0;
+                      k = 0;
+                      while (1) {
+                        if ((k | 0) >= (o | 0)) break a;
+                        dw(c[((c[m >> 2] | 0) + (k << 2)) >> 2] | 0, b, d, e, f, g, i, j);
+                        k = (k + 1) | 0;
+                      }
+                    }
+                    if (k) qa(138394, 94681, 273, 94764);
+                    o = 1 << w;
+                    m = (b + 36) | 0;
+                    k = 0;
+                    while (1) {
+                      if ((k | 0) >= (o | 0)) break a;
+                      dw(c[((c[m >> 2] | 0) + (k << 2)) >> 2] | 0, a, d, e, f, g, i, j);
+                      k = (k + 1) | 0;
+                    }
+                  }
+                  qa(94739, 94681, 175, 94764);
+                }
+              while (0);
+              return;
+            }
+            function ew(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              e = c[(a + 40) >> 2] | 0;
+              m = c[(a + 16) >> 2] | 0;
+              g = +h[(a + 8) >> 3];
+              n = fw(a, m) | 0;
+              if (!(g > 0.0)) qa(94673, 94681, 289, 94692);
+              l = (d + 16) | 0;
+              h[l >> 3] = +h[l >> 3] + 1.0;
+              a: do
+                if (!e) {
+                  l = 1 << m;
+                  k = (a + 36) | 0;
+                  g = 1.0 / g;
+                  a = 0;
+                  while (1) {
+                    if ((a | 0) >= (l | 0)) break a;
+                    f = c[((c[k >> 2] | 0) + (a << 2)) >> 2] | 0;
+                    if (f | 0) {
+                      if ((c[f >> 2] | 0) <= 0) break;
+                      j = fw(f, m) | 0;
+                      i = +h[(f + 8) >> 3] * g;
+                      e = 0;
+                      while (1) {
+                        if ((e | 0) >= (m | 0)) break;
+                        o = (j + (e << 3)) | 0;
+                        h[o >> 3] = +h[o >> 3] + +h[(n + (e << 3)) >> 3] * i;
+                        e = (e + 1) | 0;
+                      }
+                      ew(f, b, d);
+                    }
+                    a = (a + 1) | 0;
+                  }
+                  qa(94728, 94681, 307, 94692);
+                } else {
+                  i = 1.0 / g;
+                  while (1) {
+                    if (!e) break a;
+                    f = gw(b, _v(zy(e) | 0) | 0, e, m) | 0;
+                    g = +Yv(zy(e) | 0) * i;
+                    a = 0;
+                    while (1) {
+                      if ((a | 0) >= (m | 0)) break;
+                      o = (f + (a << 3)) | 0;
+                      h[o >> 3] = +h[o >> 3] + +h[(n + (a << 3)) >> 3] * g;
+                      a = (a + 1) | 0;
+                    }
+                    e = Ay(e) | 0;
+                  }
+                }
+              while (0);
+              return;
+            }
+            function fw(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              d = (a + 48) | 0;
+              a = c[d >> 2] | 0;
+              a: do
+                if (!a) {
+                  a = KK(b << 3) | 0;
+                  c[d >> 2] = a;
+                  d = 0;
+                  while (1) {
+                    if ((d | 0) >= (b | 0)) break a;
+                    h[(a + (d << 3)) >> 3] = 0.0;
+                    d = (d + 1) | 0;
+                  }
+                }
+              while (0);
+              return a | 0;
+            }
+            function gw(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0;
+              f = c[((zy(d) | 0) + 24) >> 2] | 0;
+              if (!f) {
+                f = (a + ((O(e, b) | 0) << 3)) | 0;
+                c[((zy(d) | 0) + 24) >> 2] = f;
+                f = c[((zy(d) | 0) + 24) >> 2] | 0;
+              }
+              return f | 0;
+            }
+            function hw(a, b, c, d, e) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0;
+              m = a << 3;
+              k = KK(m) | 0;
+              l = KK(m) | 0;
+              m = KK(m) | 0;
+              if (((k | 0) != 0) & ((l | 0) != 0) & ((m | 0) != 0)) {
+                f = 0;
+                while (1) {
+                  if ((f | 0) >= (a | 0)) {
+                    f = 0;
+                    break;
+                  }
+                  h[(k + (f << 3)) >> 3] = +h[(d + (f << 3)) >> 3];
+                  f = (f + 1) | 0;
+                }
+                while (1) {
+                  if ((f | 0) >= (a | 0)) {
+                    g = 1;
+                    break;
+                  }
+                  h[(l + (f << 3)) >> 3] = +h[(d + (f << 3)) >> 3];
+                  f = (f + 1) | 0;
+                }
+                while (1) {
+                  if ((g | 0) >= (b | 0)) break;
+                  j = O(g, a) | 0;
+                  f = 0;
+                  while (1) {
+                    if ((f | 0) >= (a | 0)) break;
+                    n = (k + (f << 3)) | 0;
+                    i = +h[n >> 3];
+                    p = (d + ((f + j) << 3)) | 0;
+                    o = +h[p >> 3];
+                    h[n >> 3] = i < o ? i : o;
+                    n = (l + (f << 3)) | 0;
+                    o = +h[n >> 3];
+                    i = +h[p >> 3];
+                    h[n >> 3] = o > i ? o : i;
+                    f = (f + 1) | 0;
+                  }
+                  g = (g + 1) | 0;
+                }
+                i = +h[l >> 3] - +h[k >> 3];
+                f = 0;
+                while (1) {
+                  if ((f | 0) >= (a | 0)) break;
+                  p = (k + (f << 3)) | 0;
+                  n = (l + (f << 3)) | 0;
+                  h[(m + (f << 3)) >> 3] = (+h[n >> 3] + +h[p >> 3]) * 0.5;
+                  o = +h[n >> 3] - +h[p >> 3];
+                  i = i > o ? i : o;
+                  f = (f + 1) | 0;
+                }
+                f = iw(a, m, i == 0.0 ? 5.2e-6 : i * 0.52, c) | 0;
+                a: do
+                  if (!e) {
+                    g = 0;
+                    while (1) {
+                      if ((g | 0) >= (b | 0)) break a;
+                      f = jw(f, (d + ((O(g, a) | 0) << 3)) | 0, 1.0, g) | 0;
+                      g = (g + 1) | 0;
+                    }
+                  } else {
+                    g = 0;
+                    while (1) {
+                      if ((g | 0) >= (b | 0)) break a;
+                      p = (d + ((O(g, a) | 0) << 3)) | 0;
+                      f = jw(f, p, +h[(e + (g << 3)) >> 3], g) | 0;
+                      g = (g + 1) | 0;
+                    }
+                  }
+                while (0);
+                U1(k);
+                U1(l);
+                U1(m);
+              } else {
+                U1(k);
+                U1(l);
+                U1(m);
+                f = 0;
+              }
+              return f | 0;
+            }
+            function iw(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = +d;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                i = 0;
+              g = KK(56) | 0;
+              c[(g + 16) >> 2] = a;
+              c[g >> 2] = 0;
+              i = KK(a << 3) | 0;
+              c[(g + 20) >> 2] = i;
+              f = 0;
+              while (1) {
+                if ((f | 0) >= (a | 0)) break;
+                h[(i + (f << 3)) >> 3] = +h[(b + (f << 3)) >> 3];
+                f = (f + 1) | 0;
+              }
+              if (d > 0.0) {
+                h[(g + 24) >> 3] = d;
+                h[(g + 8) >> 3] = 0.0;
+                c[(g + 32) >> 2] = 0;
+                c[(g + 36) >> 2] = 0;
+                c[(g + 40) >> 2] = 0;
+                c[(g + 44) >> 2] = e;
+                c[(g + 48) >> 2] = 0;
+                return g | 0;
+              } else qa(94896, 94681, 410, 94906);
+              return 0;
+            }
+            function jw(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = +c;
+              d = d | 0;
+              if (!a) a = 0;
+              else kw(a, b, c, d, 0) | 0;
+              return a | 0;
+            }
+            function kw(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = +d;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0,
+                k = 0.0,
+                l = 0.0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0;
+              t = (a + 16) | 0;
+              r = c[t >> 2] | 0;
+              s = c[(a + 44) >> 2] | 0;
+              m = c[a >> 2] | 0;
+              do
+                if (!m) {
+                  c[a >> 2] = 1;
+                  h[(a + 8) >> 3] = d;
+                  j = KK(r << 3) | 0;
+                  c[(a + 32) >> 2] = j;
+                  i = c[t >> 2] | 0;
+                  g = 0;
+                  while (1) {
+                    if ((g | 0) >= (i | 0)) break;
+                    h[(j + (g << 3)) >> 3] = +h[(b + (g << 3)) >> 3];
+                    g = (g + 1) | 0;
+                  }
+                  g = lw(i, d, b, e) | 0;
+                  i = (a + 40) | 0;
+                  if (!(c[i >> 2] | 0)) {
+                    c[i >> 2] = wy(g) | 0;
+                    break;
+                  } else qa(94807, 94681, 502, 94815);
+                } else {
+                  if ((s | 0) <= (f | 0)) {
+                    if (c[(a + 36) >> 2] | 0) qa(94881, 94681, 541, 94815);
+                    g = (m + 1) | 0;
+                    c[a >> 2] = g;
+                    i = (a + 8) | 0;
+                    h[i >> 3] = +h[i >> 3] + d;
+                    i = (a + 32) | 0;
+                    k = +(g | 0);
+                    l = 1.0 / +((m + 2) | 0);
+                    g = 0;
+                    while (1) {
+                      if ((g | 0) >= (r | 0)) break;
+                      q = ((c[i >> 2] | 0) + (g << 3)) | 0;
+                      h[q >> 3] = (+h[q >> 3] * k + +h[(b + (g << 3)) >> 3]) * l;
+                      g = (g + 1) | 0;
+                    }
+                    g = lw(r, d, b, e) | 0;
+                    i = (a + 40) | 0;
+                    j = c[i >> 2] | 0;
+                    if (!j) qa(94891, 94681, 547, 94815);
+                    else {
+                      c[i >> 2] = yy(j, g) | 0;
+                      break;
+                    }
+                  }
+                  i = (a + 8) | 0;
+                  h[i >> 3] = +h[i >> 3] + d;
+                  i = (a + 32) | 0;
+                  l = +(m | 0);
+                  k = 1.0 / +((m + 1) | 0);
+                  g = 0;
+                  while (1) {
+                    if ((g | 0) >= (r | 0)) break;
+                    q = ((c[i >> 2] | 0) + (g << 3)) | 0;
+                    h[q >> 3] = (+h[q >> 3] * l + +h[(b + (g << 3)) >> 3]) * k;
+                    g = (g + 1) | 0;
+                  }
+                  q = (a + 36) | 0;
+                  p = 1 << r;
+                  a: do
+                    if (!(c[q >> 2] | 0)) {
+                      c[q >> 2] = KK(p << 2) | 0;
+                      g = 0;
+                      while (1) {
+                        if ((g | 0) >= (p | 0)) break a;
+                        c[((c[q >> 2] | 0) + (g << 2)) >> 2] = 0;
+                        g = (g + 1) | 0;
+                      }
+                    }
+                  while (0);
+                  n = (a + 20) | 0;
+                  g = c[n >> 2] | 0;
+                  j = mw(r, g, b) | 0;
+                  if (!(((j | 0) < (p | 0)) & ((j | 0) > -1))) qa(94837, 94681, 515, 94815);
+                  i = c[((c[q >> 2] | 0) + (j << 2)) >> 2] | 0;
+                  if (!i) {
+                    i = nw(c[t >> 2] | 0, g, +h[(a + 24) >> 3] * 0.5, s, j) | 0;
+                    c[((c[q >> 2] | 0) + (j << 2)) >> 2] = i;
+                    i = c[((c[q >> 2] | 0) + (j << 2)) >> 2] | 0;
+                  }
+                  o = (f + 1) | 0;
+                  e = kw(i, b, d, e, o) | 0;
+                  c[((c[q >> 2] | 0) + (j << 2)) >> 2] = e;
+                  if (!(c[((c[q >> 2] | 0) + (j << 2)) >> 2] | 0)) qa(94860, 94681, 519, 94815);
+                  b = (a + 40) | 0;
+                  g = c[b >> 2] | 0;
+                  do
+                    if (g | 0) {
+                      m = _v(zy(g) | 0) | 0;
+                      if ((c[a >> 2] | 0) != 1) qa(94871, 94681, 523, 94815);
+                      f = Zv(zy(c[b >> 2] | 0) | 0) | 0;
+                      k = +Yv(zy(c[b >> 2] | 0) | 0);
+                      i = c[n >> 2] | 0;
+                      j = mw(r, i, f) | 0;
+                      if (!(((j | 0) < (p | 0)) & ((j | 0) > -1))) qa(94837, 94681, 527, 94815);
+                      g = c[((c[q >> 2] | 0) + (j << 2)) >> 2] | 0;
+                      if (!g) {
+                        g = nw(c[t >> 2] | 0, i, +h[(a + 24) >> 3] * 0.5, s, j) | 0;
+                        c[((c[q >> 2] | 0) + (j << 2)) >> 2] = g;
+                        g = c[((c[q >> 2] | 0) + (j << 2)) >> 2] | 0;
+                      }
+                      t = kw(g, f, k, m, o) | 0;
+                      c[((c[q >> 2] | 0) + (j << 2)) >> 2] = t;
+                      if (!(c[((c[q >> 2] | 0) + (j << 2)) >> 2] | 0)) qa(94860, 94681, 532, 94815);
+                      else {
+                        xy(c[b >> 2] | 0, 106);
+                        c[b >> 2] = 0;
+                        break;
+                      }
+                    }
+                  while (0);
+                  c[a >> 2] = (c[a >> 2] | 0) + 1;
+                }
+              while (0);
+              return a | 0;
+            }
+            function lw(a, b, d, e) {
+              a = a | 0;
+              b = +b;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              g = KK(32) | 0;
+              h[g >> 3] = b;
+              f = KK(a << 3) | 0;
+              c[(g + 8) >> 2] = f;
+              h[(g + 16) >> 3] = +(e | 0);
+              e = 0;
+              while (1) {
+                if ((e | 0) >= (a | 0)) break;
+                h[(f + (e << 3)) >> 3] = +h[(d + (e << 3)) >> 3];
+                e = (e + 1) | 0;
+              }
+              c[(g + 24) >> 2] = 0;
+              return g | 0;
+            }
+            function mw(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              var d = 0,
+                e = 0;
+              e = 0;
+              while (1) {
+                d = (a + -1) | 0;
+                if ((a | 0) <= 0) break;
+                a = d;
+                e = (e << 1) | (!(+h[(c + (d << 3)) >> 3] - +h[(b + (d << 3)) >> 3] < 0.0) & 1);
+              }
+              return e | 0;
+            }
+            function nw(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = +d;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                i = 0,
+                j = 0.0;
+              g = iw(a, b, d, e) | 0;
+              i = c[(g + 20) >> 2] | 0;
+              j = -d;
+              e = 0;
+              b = f;
+              while (1) {
+                if ((e | 0) >= (a | 0)) break;
+                f = (i + (e << 3)) | 0;
+                h[f >> 3] = +h[f >> 3] + (((b & 1) | 0) == 0 ? j : d);
+                e = (e + 1) | 0;
+                b = ((b | 0) / 2) | 0;
+              }
+              return g | 0;
+            }
+            function ow(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              if (a | 0) {
+                b = c[(a + 16) >> 2] | 0;
+                U1(c[(a + 20) >> 2] | 0);
+                U1(c[(a + 32) >> 2] | 0);
+                U1(c[(a + 48) >> 2] | 0);
+                g = (a + 36) | 0;
+                e = c[g >> 2] | 0;
+                if (e | 0) {
+                  f = 1 << b;
+                  d = 0;
+                  b = e;
+                  while (1) {
+                    if ((d | 0) >= (f | 0)) break;
+                    ow(c[(b + (d << 2)) >> 2] | 0);
+                    d = (d + 1) | 0;
+                    b = c[g >> 2] | 0;
+                  }
+                  U1(b);
+                }
+                xy(c[(a + 40) >> 2] | 0, 106);
+                U1(a);
+              }
+              return;
+            }
+            function pw(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0.0,
+                r = 0,
+                s = 0,
+                t = 0;
+              a: do
+                if (!a) b = 0;
+                else {
+                  l = c[(a + 20) >> 2] | 0;
+                  m = c[(a + 24) >> 2] | 0;
+                  d = c[(a + 8) >> 2] | 0;
+                  n = c[a >> 2] | 0;
+                  e = c[(a + 4) >> 2] | 0;
+                  i = (a + 16) | 0;
+                  if ((c[(a + 32) >> 2] | 0) != 1) qa(94919, 94943, 76, 94958);
+                  b = rw(e, n, d, c[i >> 2] | 0, 1) | 0;
+                  c[(b + 8) >> 2] = d;
+                  o = c[(b + 20) >> 2] | 0;
+                  k = c[(b + 24) >> 2] | 0;
+                  d = 0;
+                  while (1) {
+                    if ((d | 0) > (e | 0)) {
+                      d = 0;
+                      break;
+                    }
+                    c[(o + (d << 2)) >> 2] = 0;
+                    d = (d + 1) | 0;
+                  }
+                  b: while (1) {
+                    if ((d | 0) >= (n | 0)) {
+                      d = 0;
+                      break;
+                    }
+                    f = (d + 1) | 0;
+                    g = (l + (f << 2)) | 0;
+                    d = c[(l + (d << 2)) >> 2] | 0;
+                    while (1) {
+                      if ((d | 0) >= (c[g >> 2] | 0)) {
+                        d = f;
+                        continue b;
+                      }
+                      j = (o + (((c[(m + (d << 2)) >> 2] | 0) + 1) << 2)) | 0;
+                      c[j >> 2] = (c[j >> 2] | 0) + 1;
+                      d = (d + 1) | 0;
+                    }
+                  }
+                  while (1) {
+                    if ((d | 0) >= (e | 0)) break;
+                    j = (d + 1) | 0;
+                    g = (o + (j << 2)) | 0;
+                    c[g >> 2] = (c[g >> 2] | 0) + (c[(o + (d << 2)) >> 2] | 0);
+                    d = j;
+                  }
+                  c: do
+                    switch (c[i >> 2] | 0) {
+                      case 1: {
+                        g = c[(a + 28) >> 2] | 0;
+                        a = c[(b + 28) >> 2] | 0;
+                        f = 0;
+                        d: while (1) {
+                          if ((f | 0) >= (n | 0)) break c;
+                          i = (f + 1) | 0;
+                          j = (l + (i << 2)) | 0;
+                          d = c[(l + (f << 2)) >> 2] | 0;
+                          while (1) {
+                            if ((d | 0) >= (c[j >> 2] | 0)) {
+                              f = i;
+                              continue d;
+                            }
+                            r = (m + (d << 2)) | 0;
+                            c[(k + (c[(o + (c[r >> 2] << 2)) >> 2] << 2)) >> 2] = f;
+                            q = +h[(g + (d << 3)) >> 3];
+                            r = (o + (c[r >> 2] << 2)) | 0;
+                            p = c[r >> 2] | 0;
+                            c[r >> 2] = p + 1;
+                            h[(a + (p << 3)) >> 3] = q;
+                            d = (d + 1) | 0;
+                          }
+                        }
+                      }
+                      case 2: {
+                        g = c[(a + 28) >> 2] | 0;
+                        a = c[(b + 28) >> 2] | 0;
+                        f = 0;
+                        e: while (1) {
+                          if ((f | 0) >= (n | 0)) break c;
+                          i = (f + 1) | 0;
+                          j = (l + (i << 2)) | 0;
+                          d = c[(l + (f << 2)) >> 2] | 0;
+                          while (1) {
+                            if ((d | 0) >= (c[j >> 2] | 0)) {
+                              f = i;
+                              continue e;
+                            }
+                            r = (m + (d << 2)) | 0;
+                            c[(k + (c[(o + (c[r >> 2] << 2)) >> 2] << 2)) >> 2] = f;
+                            t = d << 1;
+                            r = (o + (c[r >> 2] << 2)) | 0;
+                            p = c[r >> 2] | 0;
+                            s = p << 1;
+                            h[(a + (s << 3)) >> 3] = +h[(g + (t << 3)) >> 3];
+                            h[(a + ((s | 1) << 3)) >> 3] = +h[(g + ((t | 1) << 3)) >> 3];
+                            c[r >> 2] = p + 1;
+                            d = (d + 1) | 0;
+                          }
+                        }
+                      }
+                      case 4: {
+                        g = c[(a + 28) >> 2] | 0;
+                        a = c[(b + 28) >> 2] | 0;
+                        f = 0;
+                        f: while (1) {
+                          if ((f | 0) >= (n | 0)) break c;
+                          i = (f + 1) | 0;
+                          j = (l + (i << 2)) | 0;
+                          d = c[(l + (f << 2)) >> 2] | 0;
+                          while (1) {
+                            if ((d | 0) >= (c[j >> 2] | 0)) {
+                              f = i;
+                              continue f;
+                            }
+                            r = (m + (d << 2)) | 0;
+                            c[(k + (c[(o + (c[r >> 2] << 2)) >> 2] << 2)) >> 2] = f;
+                            s = c[(g + (d << 2)) >> 2] | 0;
+                            r = (o + (c[r >> 2] << 2)) | 0;
+                            t = c[r >> 2] | 0;
+                            c[r >> 2] = t + 1;
+                            c[(a + (t << 2)) >> 2] = s;
+                            d = (d + 1) | 0;
+                          }
+                        }
+                      }
+                      case 8: {
+                        f = 0;
+                        g: while (1) {
+                          if ((f | 0) >= (n | 0)) break c;
+                          g = (f + 1) | 0;
+                          a = (l + (g << 2)) | 0;
+                          d = c[(l + (f << 2)) >> 2] | 0;
+                          while (1) {
+                            if ((d | 0) >= (c[a >> 2] | 0)) {
+                              f = g;
+                              continue g;
+                            }
+                            s = (o + (c[(m + (d << 2)) >> 2] << 2)) | 0;
+                            t = c[s >> 2] | 0;
+                            c[s >> 2] = t + 1;
+                            c[(k + (t << 2)) >> 2] = f;
+                            d = (d + 1) | 0;
+                          }
+                        }
+                      }
+                      case 16: {
+                        qw(b);
+                        b = 0;
+                        break a;
+                      }
+                      default: {
+                        qw(b);
+                        b = 0;
+                        break a;
+                      }
+                    }
+                  while (0);
+                  while (1) {
+                    d = (e + -1) | 0;
+                    if ((e | 0) <= 0) break;
+                    c[(o + (e << 2)) >> 2] = c[(o + (d << 2)) >> 2];
+                    e = d;
+                  }
+                  c[o >> 2] = 0;
+                }
+              while (0);
+              return b | 0;
+            }
+            function qw(a) {
+              a = a | 0;
+              var b = 0;
+              if (a | 0) {
+                b = c[(a + 20) >> 2] | 0;
+                if (b | 0) U1(b);
+                b = c[(a + 24) >> 2] | 0;
+                if (b | 0) U1(b);
+                U1(c[(a + 28) >> 2] | 0);
+                U1(a);
+              }
+              return;
+            }
+            function rw(a, b, c, d, e) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              a = tw(a, b, d, sw(d) | 0, e) | 0;
+              if ((c | 0) > 0) uw(a, c) | 0;
+              return a | 0;
+            }
+            function sw(a) {
+              a = a | 0;
+              switch (a | 0) {
+                case 1: {
+                  a = 8;
+                  break;
+                }
+                case 2: {
+                  a = 16;
+                  break;
+                }
+                case 4: {
+                  a = 4;
+                  break;
+                }
+                case 8: {
+                  a = 0;
+                  break;
+                }
+                case 16: {
+                  a = 0;
+                  break;
+                }
+                default:
+                  a = 0;
+              }
+              return a | 0;
+            }
+            function tw(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0;
+              g = KK(44) | 0;
+              c[g >> 2] = a;
+              c[(g + 4) >> 2] = b;
+              c[(g + 8) >> 2] = 0;
+              c[(g + 12) >> 2] = 0;
+              c[(g + 16) >> 2] = d;
+              c[(g + 40) >> 2] = e;
+              if ((f | 0) == 2) a = 0;
+              else a = KK(((a << 2) + 4) | 0) | 0;
+              c[(g + 20) >> 2] = a;
+              c[(g + 24) >> 2] = 0;
+              c[(g + 28) >> 2] = 0;
+              c[(g + 32) >> 2] = f;
+              c[(g + 36) >> 2] = 0;
+              return g | 0;
+            }
+            function uw(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = c[(a + 32) >> 2] | 0;
+              f = (a + 28) | 0;
+              c[f >> 2] = 0;
+              d = b << 2;
+              e = KK(d) | 0;
+              if ((h | 0) != 2) {
+                c[(a + 24) >> 2] = e;
+                d = c[(a + 40) >> 2] | 0;
+                if (((b | 0) != 0) & ((d | 0) > 0)) g = 4;
+              } else {
+                c[(a + 20) >> 2] = e;
+                c[(a + 24) >> 2] = KK(d) | 0;
+                d = c[(a + 40) >> 2] | 0;
+                g = 4;
+              }
+              if ((g | 0) == 4) c[f >> 2] = KK(O(d, b) | 0) | 0;
+              c[(a + 12) >> 2] = b;
+              return a | 0;
+            }
+            function vw(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if (!(ww(a, b) | 0)) {
+                b = pw(a) | 0;
+                if (!b) b = 0;
+                else {
+                  a = yw(a, b) | 0;
+                  qw(b);
+                  b = (a + 36) | 0;
+                  c[b >> 2] = c[b >> 2] | 3;
+                  b = a;
+                }
+              } else b = xw(a) | 0;
+              return b | 0;
+            }
+            function ww(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0.0;
+              if (a) {
+                if ((c[(a + 32) >> 2] | 0) != 1) qa(94919, 94943, 187, 95074);
+                s = (a + 36) | 0;
+                d = c[s >> 2] | 0;
+                if (((d & 2) | 0) == 0 ? ((p = (b | 0) != 0), (((d & 1) | 0) == 0) | (p ^ 1)) : 0)
+                  if ((c[a >> 2] | 0) == (c[(a + 4) >> 2] | 0) ? ((t = pw(a) | 0), (t | 0) != 0) : 0) {
+                    k = c[(a + 20) >> 2] | 0;
+                    l = c[(a + 24) >> 2] | 0;
+                    m = c[(t + 20) >> 2] | 0;
+                    n = c[(t + 24) >> 2] | 0;
+                    o = c[a >> 2] | 0;
+                    q = KK(o << 2) | 0;
+                    b = 0;
+                    while (1) {
+                      if ((b | 0) >= (o | 0)) break;
+                      c[(q + (b << 2)) >> 2] = -1;
+                      b = (b + 1) | 0;
+                    }
+                    a: do
+                      switch ((p ? 8 : c[(a + 16) >> 2] | 0) | 0) {
+                        case 1: {
+                          g = c[(a + 28) >> 2] | 0;
+                          i = c[(t + 28) >> 2] | 0;
+                          b = 0;
+                          while (1) {
+                            if ((b | 0) > (o | 0)) {
+                              d = 0;
+                              break;
+                            }
+                            if ((c[(k + (b << 2)) >> 2] | 0) == (c[(m + (b << 2)) >> 2] | 0)) b = (b + 1) | 0;
+                            else {
+                              b = 0;
+                              break a;
+                            }
+                          }
+                          b: while (1) {
+                            if ((d | 0) >= (o | 0)) {
+                              r = 54;
+                              break a;
+                            }
+                            e = (k + (d << 2)) | 0;
+                            f = (d + 1) | 0;
+                            a = (k + (f << 2)) | 0;
+                            b = c[e >> 2] | 0;
+                            while (1) {
+                              if ((b | 0) >= (c[a >> 2] | 0)) break;
+                              c[(q + (c[(l + (b << 2)) >> 2] << 2)) >> 2] = b;
+                              b = (b + 1) | 0;
+                            }
+                            b = c[(m + (d << 2)) >> 2] | 0;
+                            a = c[(m + (f << 2)) >> 2] | 0;
+                            d = b;
+                            while (1) {
+                              if ((d | 0) >= (a | 0)) break;
+                              if ((c[(q + (c[(n + (d << 2)) >> 2] << 2)) >> 2] | 0) < (c[e >> 2] | 0)) {
+                                b = 0;
+                                break a;
+                              } else d = (d + 1) | 0;
+                            }
+                            while (1) {
+                              if ((b | 0) >= (a | 0)) {
+                                d = f;
+                                continue b;
+                              }
+                              u =
+                                +h[(i + (b << 3)) >> 3] -
+                                +h[(g + (c[(q + (c[(n + (b << 2)) >> 2] << 2)) >> 2] << 3)) >> 3];
+                              if ((u >= 0.0 ? u : -u) > 1.0e-7) {
+                                b = 0;
+                                break a;
+                              } else b = (b + 1) | 0;
+                            }
+                          }
+                        }
+                        case 2: {
+                          i = c[(a + 28) >> 2] | 0;
+                          j = c[(t + 28) >> 2] | 0;
+                          b = 0;
+                          while (1) {
+                            if ((b | 0) > (o | 0)) {
+                              d = 0;
+                              break;
+                            }
+                            if ((c[(k + (b << 2)) >> 2] | 0) == (c[(m + (b << 2)) >> 2] | 0)) b = (b + 1) | 0;
+                            else {
+                              b = 0;
+                              break a;
+                            }
+                          }
+                          c: while (1) {
+                            if ((d | 0) >= (o | 0)) {
+                              r = 54;
+                              break a;
+                            }
+                            f = (k + (d << 2)) | 0;
+                            g = (d + 1) | 0;
+                            a = (k + (g << 2)) | 0;
+                            b = c[f >> 2] | 0;
+                            while (1) {
+                              if ((b | 0) >= (c[a >> 2] | 0)) break;
+                              c[(q + (c[(l + (b << 2)) >> 2] << 2)) >> 2] = b;
+                              b = (b + 1) | 0;
+                            }
+                            d = c[(m + (d << 2)) >> 2] | 0;
+                            e = c[(m + (g << 2)) >> 2] | 0;
+                            b = d;
+                            while (1) {
+                              if ((b | 0) >= (e | 0)) {
+                                b = d;
+                                break;
+                              }
+                              if ((c[(q + (c[(n + (b << 2)) >> 2] << 2)) >> 2] | 0) < (c[f >> 2] | 0)) {
+                                b = 0;
+                                break a;
+                              } else b = (b + 1) | 0;
+                            }
+                            while (1) {
+                              if ((b | 0) >= (e | 0)) {
+                                d = g;
+                                continue c;
+                              }
+                              d = b << 1;
+                              a = c[(q + (c[(n + (b << 2)) >> 2] << 2)) >> 2] << 1;
+                              u = +h[(j + (d << 3)) >> 3] - +h[(i + (a << 3)) >> 3];
+                              if ((u >= 0.0 ? u : -u) > 1.0e-7) {
+                                b = 0;
+                                break a;
+                              }
+                              u = +h[(j + ((d | 1) << 3)) >> 3] - +h[(i + ((a | 1) << 3)) >> 3];
+                              if ((u >= 0.0 ? u : -u) > 1.0e-7) {
+                                b = 0;
+                                break a;
+                              } else b = (b + 1) | 0;
+                            }
+                          }
+                        }
+                        case 4: {
+                          f = c[(a + 28) >> 2] | 0;
+                          g = c[(t + 28) >> 2] | 0;
+                          b = 0;
+                          d: while (1) {
+                            if ((b | 0) >= (o | 0)) {
+                              r = 54;
+                              break a;
+                            }
+                            e = (k + (b << 2)) | 0;
+                            i = (b + 1) | 0;
+                            a = (k + (i << 2)) | 0;
+                            d = c[e >> 2] | 0;
+                            while (1) {
+                              if ((d | 0) >= (c[a >> 2] | 0)) break;
+                              c[(q + (c[(l + (d << 2)) >> 2] << 2)) >> 2] = d;
+                              d = (d + 1) | 0;
+                            }
+                            b = c[(m + (b << 2)) >> 2] | 0;
+                            a = c[(m + (i << 2)) >> 2] | 0;
+                            d = b;
+                            while (1) {
+                              if ((d | 0) >= (a | 0)) break;
+                              if ((c[(q + (c[(n + (d << 2)) >> 2] << 2)) >> 2] | 0) < (c[e >> 2] | 0)) {
+                                b = 0;
+                                break a;
+                              } else d = (d + 1) | 0;
+                            }
+                            while (1) {
+                              if ((b | 0) >= (a | 0)) {
+                                b = i;
+                                continue d;
+                              }
+                              if (
+                                (c[(g + (b << 2)) >> 2] | 0) ==
+                                (c[(f + (c[(q + (c[(n + (b << 2)) >> 2] << 2)) >> 2] << 2)) >> 2] | 0)
+                              )
+                                b = (b + 1) | 0;
+                              else {
+                                b = 0;
+                                break a;
+                              }
+                            }
+                          }
+                        }
+                        case 8: {
+                          a = 0;
+                          e: while (1) {
+                            if ((a | 0) >= (o | 0)) {
+                              r = 54;
+                              break a;
+                            }
+                            e = (k + (a << 2)) | 0;
+                            f = (a + 1) | 0;
+                            d = (k + (f << 2)) | 0;
+                            b = c[e >> 2] | 0;
+                            while (1) {
+                              if ((b | 0) >= (c[d >> 2] | 0)) break;
+                              c[(q + (c[(l + (b << 2)) >> 2] << 2)) >> 2] = b;
+                              b = (b + 1) | 0;
+                            }
+                            d = c[(m + (f << 2)) >> 2] | 0;
+                            b = c[(m + (a << 2)) >> 2] | 0;
+                            while (1) {
+                              if ((b | 0) >= (d | 0)) {
+                                a = f;
+                                continue e;
+                              }
+                              if ((c[(q + (c[(n + (b << 2)) >> 2] << 2)) >> 2] | 0) < (c[e >> 2] | 0)) {
+                                b = 0;
+                                break a;
+                              } else b = (b + 1) | 0;
+                            }
+                          }
+                        }
+                        default:
+                          b = 0;
+                      }
+                    while (0);
+                    if ((r | 0) == 54) {
+                      d = c[s >> 2] | 0;
+                      if (p) b = 1;
+                      else {
+                        c[s >> 2] = d | 2;
+                        b = 3;
+                      }
+                      c[s >> 2] = b | d;
+                      b = 1;
+                    }
+                    U1(q);
+                    qw(t);
+                  } else b = 0;
+                else b = 1;
+              } else b = 0;
+              return b | 0;
+            }
+            function xw(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              if (!a) b = 0;
+              else {
+                e = (a + 8) | 0;
+                f = (a + 40) | 0;
+                b =
+                  zw(
+                    c[a >> 2] | 0,
+                    c[(a + 4) >> 2] | 0,
+                    c[e >> 2] | 0,
+                    c[(a + 16) >> 2] | 0,
+                    c[f >> 2] | 0,
+                    c[(a + 32) >> 2] | 0
+                  ) | 0;
+                d = (a + 20) | 0;
+                W6(c[(b + 20) >> 2] | 0, c[d >> 2] | 0, ((c[a >> 2] << 2) + 4) | 0) | 0;
+                W6(
+                  c[(b + 24) >> 2] | 0,
+                  c[(a + 24) >> 2] | 0,
+                  (c[((c[d >> 2] | 0) + (c[a >> 2] << 2)) >> 2] << 2) | 0
+                ) | 0;
+                d = c[(a + 28) >> 2] | 0;
+                if (d | 0) W6(c[(b + 28) >> 2] | 0, d | 0, O(c[e >> 2] | 0, c[f >> 2] | 0) | 0) | 0;
+                c[(b + 36) >> 2] = c[(a + 36) >> 2];
+                c[(b + 8) >> 2] = c[e >> 2];
+              }
+              return b | 0;
+            }
+            function yw(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0;
+              p = c[(a + 20) >> 2] | 0;
+              r = c[(a + 24) >> 2] | 0;
+              s = c[(b + 20) >> 2] | 0;
+              t = c[(b + 24) >> 2] | 0;
+              if (!(((a | 0) != 0) & ((b | 0) != 0))) qa(94981, 94943, 973, 94988);
+              q = c[(a + 32) >> 2] | 0;
+              if (!((q | 0) == 1 ? (q | 0) == (c[(b + 32) >> 2] | 0) : 0)) qa(95005, 94943, 974, 94988);
+              e = (a + 16) | 0;
+              d = c[e >> 2] | 0;
+              if ((d | 0) != (c[(b + 16) >> 2] | 0)) qa(95055, 94943, 975, 94988);
+              o = c[a >> 2] | 0;
+              f = c[(a + 4) >> 2] | 0;
+              if (
+                ((o | 0) == (c[b >> 2] | 0) ? (f | 0) == (c[(b + 4) >> 2] | 0) : 0)
+                  ? ((u = rw(o, f, ((c[(b + 8) >> 2] | 0) + (c[(a + 8) >> 2] | 0)) | 0, d, 1) | 0), u | 0)
+                  : 0
+              ) {
+                m = c[(u + 20) >> 2] | 0;
+                n = c[(u + 24) >> 2] | 0;
+                q = KK(f << 2) | 0;
+                d = 0;
+                while (1) {
+                  if ((d | 0) >= (f | 0)) break;
+                  c[(q + (d << 2)) >> 2] = -1;
+                  d = (d + 1) | 0;
+                }
+                c[m >> 2] = 0;
+                a: do
+                  switch (c[e >> 2] | 0) {
+                    case 1: {
+                      l = c[(a + 28) >> 2] | 0;
+                      i = c[(b + 28) >> 2] | 0;
+                      j = c[(u + 28) >> 2] | 0;
+                      d = 0;
+                      f = 0;
+                      while (1) {
+                        if ((f | 0) >= (o | 0)) break a;
+                        k = (f + 1) | 0;
+                        e = (p + (k << 2)) | 0;
+                        a = c[(p + (f << 2)) >> 2] | 0;
+                        while (1) {
+                          if ((a | 0) >= (c[e >> 2] | 0)) break;
+                          g = (r + (a << 2)) | 0;
+                          c[(q + (c[g >> 2] << 2)) >> 2] = d;
+                          c[(n + (d << 2)) >> 2] = c[g >> 2];
+                          h[(j + (d << 3)) >> 3] = +h[(l + (a << 3)) >> 3];
+                          a = (a + 1) | 0;
+                          d = (d + 1) | 0;
+                        }
+                        b = (s + (k << 2)) | 0;
+                        g = (m + (f << 2)) | 0;
+                        f = c[(s + (f << 2)) >> 2] | 0;
+                        while (1) {
+                          if ((f | 0) >= (c[b >> 2] | 0)) break;
+                          a = c[(t + (f << 2)) >> 2] | 0;
+                          e = c[(q + (a << 2)) >> 2] | 0;
+                          if ((e | 0) < (c[g >> 2] | 0)) {
+                            c[(n + (d << 2)) >> 2] = a;
+                            h[(j + (d << 3)) >> 3] = +h[(i + (f << 3)) >> 3];
+                            d = (d + 1) | 0;
+                          } else {
+                            e = (j + (e << 3)) | 0;
+                            h[e >> 3] = +h[e >> 3] + +h[(i + (f << 3)) >> 3];
+                          }
+                          f = (f + 1) | 0;
+                        }
+                        c[(m + (k << 2)) >> 2] = d;
+                        f = k;
+                      }
+                    }
+                    case 2: {
+                      l = c[(a + 28) >> 2] | 0;
+                      k = c[(b + 28) >> 2] | 0;
+                      i = c[(u + 28) >> 2] | 0;
+                      f = 0;
+                      d = 0;
+                      while (1) {
+                        if ((f | 0) >= (o | 0)) break a;
+                        j = (f + 1) | 0;
+                        e = (p + (j << 2)) | 0;
+                        a = c[(p + (f << 2)) >> 2] | 0;
+                        while (1) {
+                          if ((a | 0) >= (c[e >> 2] | 0)) break;
+                          b = (r + (a << 2)) | 0;
+                          c[(q + (c[b >> 2] << 2)) >> 2] = d;
+                          c[(n + (d << 2)) >> 2] = c[b >> 2];
+                          b = a << 1;
+                          g = d << 1;
+                          h[(i + (g << 3)) >> 3] = +h[(l + (b << 3)) >> 3];
+                          h[(i + ((g | 1) << 3)) >> 3] = +h[(l + ((b | 1) << 3)) >> 3];
+                          a = (a + 1) | 0;
+                          d = (d + 1) | 0;
+                        }
+                        b = (s + (j << 2)) | 0;
+                        g = (m + (f << 2)) | 0;
+                        f = c[(s + (f << 2)) >> 2] | 0;
+                        while (1) {
+                          if ((f | 0) >= (c[b >> 2] | 0)) break;
+                          a = c[(t + (f << 2)) >> 2] | 0;
+                          e = c[(q + (a << 2)) >> 2] | 0;
+                          if ((e | 0) < (c[g >> 2] | 0)) {
+                            c[(n + (d << 2)) >> 2] = a;
+                            a = f << 1;
+                            e = d << 1;
+                            h[(i + (e << 3)) >> 3] = +h[(k + (a << 3)) >> 3];
+                            h[(i + ((e | 1) << 3)) >> 3] = +h[(k + ((a | 1) << 3)) >> 3];
+                            d = (d + 1) | 0;
+                          } else {
+                            a = f << 1;
+                            e = e << 1;
+                            v = (i + (e << 3)) | 0;
+                            h[v >> 3] = +h[v >> 3] + +h[(k + (a << 3)) >> 3];
+                            e = (i + ((e | 1) << 3)) | 0;
+                            h[e >> 3] = +h[e >> 3] + +h[(k + ((a | 1) << 3)) >> 3];
+                          }
+                          f = (f + 1) | 0;
+                        }
+                        c[(m + (j << 2)) >> 2] = d;
+                        f = j;
+                      }
+                    }
+                    case 4: {
+                      l = c[(a + 28) >> 2] | 0;
+                      i = c[(b + 28) >> 2] | 0;
+                      j = c[(u + 28) >> 2] | 0;
+                      f = 0;
+                      d = 0;
+                      while (1) {
+                        if ((f | 0) >= (o | 0)) break a;
+                        k = (f + 1) | 0;
+                        e = (p + (k << 2)) | 0;
+                        a = c[(p + (f << 2)) >> 2] | 0;
+                        while (1) {
+                          if ((a | 0) >= (c[e >> 2] | 0)) break;
+                          v = (r + (a << 2)) | 0;
+                          c[(q + (c[v >> 2] << 2)) >> 2] = d;
+                          c[(n + (d << 2)) >> 2] = c[v >> 2];
+                          c[(j + (d << 2)) >> 2] = c[(l + (a << 2)) >> 2];
+                          a = (a + 1) | 0;
+                          d = (d + 1) | 0;
+                        }
+                        b = (s + (k << 2)) | 0;
+                        g = (m + (f << 2)) | 0;
+                        f = c[(s + (f << 2)) >> 2] | 0;
+                        while (1) {
+                          if ((f | 0) >= (c[b >> 2] | 0)) break;
+                          a = c[(t + (f << 2)) >> 2] | 0;
+                          e = c[(q + (a << 2)) >> 2] | 0;
+                          if ((e | 0) < (c[g >> 2] | 0)) {
+                            c[(n + (d << 2)) >> 2] = a;
+                            c[(j + (d << 2)) >> 2] = c[(i + (f << 2)) >> 2];
+                            d = (d + 1) | 0;
+                          } else {
+                            v = (j + (e << 2)) | 0;
+                            c[v >> 2] = (c[v >> 2] | 0) + (c[(i + (f << 2)) >> 2] | 0);
+                          }
+                          f = (f + 1) | 0;
+                        }
+                        c[(m + (k << 2)) >> 2] = d;
+                        f = k;
+                      }
+                    }
+                    case 8: {
+                      d = 0;
+                      f = 0;
+                      while (1) {
+                        if ((f | 0) >= (o | 0)) break a;
+                        i = (f + 1) | 0;
+                        e = (p + (i << 2)) | 0;
+                        a = c[(p + (f << 2)) >> 2] | 0;
+                        while (1) {
+                          if ((a | 0) >= (c[e >> 2] | 0)) break;
+                          v = (r + (a << 2)) | 0;
+                          c[(q + (c[v >> 2] << 2)) >> 2] = d;
+                          c[(n + (d << 2)) >> 2] = c[v >> 2];
+                          d = (d + 1) | 0;
+                          a = (a + 1) | 0;
+                        }
+                        b = (s + (i << 2)) | 0;
+                        g = (m + (f << 2)) | 0;
+                        e = c[(s + (f << 2)) >> 2] | 0;
+                        while (1) {
+                          if ((e | 0) >= (c[b >> 2] | 0)) break;
+                          a = c[(t + (e << 2)) >> 2] | 0;
+                          if ((c[(q + (a << 2)) >> 2] | 0) < (c[g >> 2] | 0)) {
+                            c[(n + (d << 2)) >> 2] = a;
+                            d = (d + 1) | 0;
+                          }
+                          e = (e + 1) | 0;
+                        }
+                        c[(m + (i << 2)) >> 2] = d;
+                        f = i;
+                      }
+                    }
+                    default:
+                      d = 0;
+                  }
+                while (0);
+                c[(u + 8) >> 2] = d;
+                U1(q);
+                return u | 0;
+              }
+              return 0;
+            }
+            function zw(a, b, c, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              a = tw(a, b, d, e, f) | 0;
+              if ((c | 0) > 0) uw(a, c) | 0;
+              return a | 0;
+            }
+            function Aw(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              if (!(ww(a, b) | 0)) {
+                b = pw(a) | 0;
+                if (!b) b = 0;
+                else {
+                  d = yw(a, b) | 0;
+                  qw(b);
+                  b = (d + 36) | 0;
+                  c[b >> 2] = c[b >> 2] | 3;
+                  b = d;
+                  d = 5;
+                }
+              } else {
+                b = xw(a) | 0;
+                d = 5;
+              }
+              if ((d | 0) == 5) b = Bw(b) | 0;
+              return b | 0;
+            }
+            function Bw(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              a: do
+                if (!a) a = 0;
+                else {
+                  k = c[(a + 20) >> 2] | 0;
+                  l = c[(a + 24) >> 2] | 0;
+                  d = c[k >> 2] | 0;
+                  b: do
+                    switch (c[(a + 16) >> 2] | 0) {
+                      case 1: {
+                        j = c[(a + 28) >> 2] | 0;
+                        i = 0;
+                        b = 0;
+                        while (1) {
+                          if ((i | 0) >= (c[a >> 2] | 0)) break b;
+                          f = (i + 1) | 0;
+                          g = (k + (f << 2)) | 0;
+                          while (1) {
+                            e = c[g >> 2] | 0;
+                            if ((d | 0) >= (e | 0)) break;
+                            e = c[(l + (d << 2)) >> 2] | 0;
+                            if ((e | 0) != (i | 0)) {
+                              c[(l + (b << 2)) >> 2] = e;
+                              h[(j + (b << 3)) >> 3] = +h[(j + (d << 3)) >> 3];
+                              b = (b + 1) | 0;
+                            }
+                            d = (d + 1) | 0;
+                          }
+                          c[g >> 2] = b;
+                          i = f;
+                          d = e;
+                        }
+                      }
+                      case 2: {
+                        j = c[(a + 28) >> 2] | 0;
+                        i = 0;
+                        b = 0;
+                        while (1) {
+                          if ((i | 0) >= (c[a >> 2] | 0)) break b;
+                          f = (i + 1) | 0;
+                          g = (k + (f << 2)) | 0;
+                          while (1) {
+                            e = c[g >> 2] | 0;
+                            if ((d | 0) >= (e | 0)) break;
+                            e = c[(l + (d << 2)) >> 2] | 0;
+                            if ((e | 0) != (i | 0)) {
+                              c[(l + (b << 2)) >> 2] = e;
+                              m = d << 1;
+                              e = b << 1;
+                              h[(j + (e << 3)) >> 3] = +h[(j + (m << 3)) >> 3];
+                              h[(j + ((e | 1) << 3)) >> 3] = +h[(j + ((m | 1) << 3)) >> 3];
+                              b = (b + 1) | 0;
+                            }
+                            d = (d + 1) | 0;
+                          }
+                          c[g >> 2] = b;
+                          i = f;
+                          d = e;
+                        }
+                      }
+                      case 4: {
+                        j = c[(a + 28) >> 2] | 0;
+                        i = 0;
+                        b = 0;
+                        while (1) {
+                          if ((i | 0) >= (c[a >> 2] | 0)) break b;
+                          f = (i + 1) | 0;
+                          g = (k + (f << 2)) | 0;
+                          while (1) {
+                            e = c[g >> 2] | 0;
+                            if ((d | 0) >= (e | 0)) break;
+                            e = c[(l + (d << 2)) >> 2] | 0;
+                            if ((e | 0) != (i | 0)) {
+                              c[(l + (b << 2)) >> 2] = e;
+                              c[(j + (b << 2)) >> 2] = c[(j + (d << 2)) >> 2];
+                              b = (b + 1) | 0;
+                            }
+                            d = (d + 1) | 0;
+                          }
+                          c[g >> 2] = b;
+                          i = f;
+                          d = e;
+                        }
+                      }
+                      case 8: {
+                        i = 0;
+                        b = 0;
+                        while (1) {
+                          if ((i | 0) >= (c[a >> 2] | 0)) break b;
+                          f = (i + 1) | 0;
+                          g = (k + (f << 2)) | 0;
+                          while (1) {
+                            e = c[g >> 2] | 0;
+                            if ((d | 0) >= (e | 0)) break;
+                            e = c[(l + (d << 2)) >> 2] | 0;
+                            if ((e | 0) != (i | 0)) {
+                              c[(l + (b << 2)) >> 2] = e;
+                              b = (b + 1) | 0;
+                            }
+                            d = (d + 1) | 0;
+                          }
+                          c[g >> 2] = b;
+                          i = f;
+                          d = e;
+                        }
+                      }
+                      default: {
+                        a = 0;
+                        break a;
+                      }
+                    }
+                  while (0);
+                  c[(a + 8) >> 2] = b;
+                }
+              while (0);
+              return a | 0;
+            }
+            function Cw(a) {
+              a = a | 0;
+              if ((c[(a + 32) >> 2] | 0) == 2)
+                return (
+                  Dw(
+                    c[(a + 8) >> 2] | 0,
+                    c[a >> 2] | 0,
+                    c[(a + 4) >> 2] | 0,
+                    c[(a + 20) >> 2] | 0,
+                    c[(a + 24) >> 2] | 0,
+                    c[(a + 28) >> 2] | 0,
+                    c[(a + 16) >> 2] | 0,
+                    c[(a + 40) >> 2] | 0
+                  ) | 0
+                );
+              else qa(95100, 94943, 803, 95126);
+              return 0;
+            }
+            function Dw(a, b, c, d, e, f, g, h) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              return Ew(a, b, c, d, e, f, g, h, 1) | 0;
+            }
+            function J_(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              j = (b + 72) | 0;
+              k = (b + 352) | 0;
+              l = (b + 356) | 0;
+              m = (b + 360) | 0;
+              i = 0;
+              a: while (1) {
+                h = (f - e) | 0;
+                if ((h | 0) <= 0) {
+                  f = -1;
+                  break;
+                }
+                switch (a[(j + (d[e >> 0] | 0)) >> 0] | 0) {
+                  case 8:
+                  case 1:
+                  case 0: {
+                    n = 16;
+                    break a;
+                  }
+                  case 5: {
+                    if ((h | 0) < 2) {
+                      f = -2;
+                      break a;
+                    }
+                    if (lb[c[k >> 2] & 127](b, e) | 0) {
+                      n = 6;
+                      break a;
+                    }
+                    h = i;
+                    e = (e + 2) | 0;
+                    i = h;
+                    continue a;
+                  }
+                  case 6: {
+                    if ((h | 0) < 3) {
+                      f = -2;
+                      break a;
+                    }
+                    if (lb[c[l >> 2] & 127](b, e) | 0) {
+                      n = 10;
+                      break a;
+                    }
+                    h = i;
+                    e = (e + 3) | 0;
+                    i = h;
+                    continue a;
+                  }
+                  case 7: {
+                    if ((h | 0) < 4) {
+                      f = -2;
+                      break a;
+                    }
+                    if (lb[c[m >> 2] & 127](b, e) | 0) {
+                      n = 14;
+                      break a;
+                    }
+                    h = i;
+                    e = (e + 4) | 0;
+                    i = h;
+                    continue a;
+                  }
+                  case 2: {
+                    h = (e + 1) | 0;
+                    if (((f - h) | 0) <= 0) {
+                      f = -1;
+                      break a;
+                    }
+                    if ((a[h >> 0] | 0) != 33) {
+                      o = i;
+                      e = h;
+                      i = o;
+                      continue a;
+                    }
+                    h = (e + 2) | 0;
+                    if (((f - h) | 0) <= 0) {
+                      f = -1;
+                      break a;
+                    }
+                    o = (a[h >> 0] | 0) == 91;
+                    i = (i + (o & 1)) | 0;
+                    e = o ? (e + 3) | 0 : h;
+                    continue a;
+                  }
+                  case 4: {
+                    h = (e + 1) | 0;
+                    if (((f - h) | 0) <= 0) {
+                      f = -1;
+                      break a;
+                    }
+                    if ((a[h >> 0] | 0) != 93) {
+                      o = i;
+                      e = h;
+                      i = o;
+                      continue a;
+                    }
+                    h = (e + 2) | 0;
+                    if (((f - h) | 0) <= 0) {
+                      f = -1;
+                      break a;
+                    }
+                    if ((a[h >> 0] | 0) != 62) {
+                      o = i;
+                      e = h;
+                      i = o;
+                      continue a;
+                    }
+                    e = (e + 3) | 0;
+                    if (!i) {
+                      n = 26;
+                      break a;
+                    }
+                    i = (i + -1) | 0;
+                    continue a;
+                  }
+                  default: {
+                    o = i;
+                    e = (e + 1) | 0;
+                    i = o;
+                    continue a;
+                  }
+                }
+              }
+              if ((n | 0) == 6) {
+                c[g >> 2] = e;
+                f = 0;
+              } else if ((n | 0) == 10) {
+                c[g >> 2] = e;
+                f = 0;
+              } else if ((n | 0) == 14) {
+                c[g >> 2] = e;
+                f = 0;
+              } else if ((n | 0) == 16) {
+                c[g >> 2] = e;
+                f = 0;
+              } else if ((n | 0) == 26) {
+                c[g >> 2] = e;
+                f = 42;
+              }
+              return f | 0;
+            }
+            function K_(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              do
+                if (e >>> 0 < f >>> 0) {
+                  k = f;
+                  if (((k - e) | 0) > 0) {
+                    l = (b + 72) | 0;
+                    i = e;
+                    a: while (1) {
+                      if (((k - i) | 0) <= 0) {
+                        j = 24;
+                        break;
+                      }
+                      switch (a[(l + (d[i >> 0] | 0)) >> 0] | 0) {
+                        case 3: {
+                          j = 8;
+                          break a;
+                        }
+                        case 2: {
+                          j = 11;
+                          break a;
+                        }
+                        case 10: {
+                          j = 12;
+                          break a;
+                        }
+                        case 9: {
+                          j = 15;
+                          break a;
+                        }
+                        case 21: {
+                          j = 19;
+                          break a;
+                        }
+                        case 5: {
+                          h = 2;
+                          break;
+                        }
+                        case 6: {
+                          h = 3;
+                          break;
+                        }
+                        case 7: {
+                          h = 4;
+                          break;
+                        }
+                        default:
+                          h = 1;
+                      }
+                      i = (i + h) | 0;
+                    }
+                    if ((j | 0) == 8)
+                      if ((i | 0) == (e | 0)) {
+                        h = W_(b, (e + 1) | 0, f, g) | 0;
+                        break;
+                      } else {
+                        c[g >> 2] = i;
+                        h = 6;
+                        break;
+                      }
+                    else if ((j | 0) == 11) {
+                      c[g >> 2] = i;
+                      h = 0;
+                      break;
+                    } else if ((j | 0) == 12)
+                      if ((i | 0) == (e | 0)) {
+                        c[g >> 2] = e + 1;
+                        h = 7;
+                        break;
+                      } else {
+                        c[g >> 2] = i;
+                        h = 6;
+                        break;
+                      }
+                    else if ((j | 0) == 15) {
+                      if ((i | 0) != (e | 0)) {
+                        c[g >> 2] = i;
+                        h = 6;
+                        break;
+                      }
+                      h = (e + 1) | 0;
+                      if (((k - h) | 0) <= 0) {
+                        h = -3;
+                        break;
+                      }
+                      c[g >> 2] = (a[(l + (d[h >> 0] | 0)) >> 0] | 0) == 10 ? (e + 2) | 0 : h;
+                      h = 7;
+                      break;
+                    } else if ((j | 0) == 19)
+                      if ((i | 0) == (e | 0)) {
+                        c[g >> 2] = e + 1;
+                        h = 39;
+                        break;
+                      } else {
+                        c[g >> 2] = i;
+                        h = 6;
+                        break;
+                      }
+                    else if ((j | 0) == 24) {
+                      c[g >> 2] = i;
+                      h = 6;
+                      break;
+                    }
+                  } else h = -1;
+                } else h = -4;
+              while (0);
+              return h | 0;
+            }
+            function L_(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              do
+                if (e >>> 0 < f >>> 0) {
+                  k = f;
+                  if (((k - e) | 0) > 0) {
+                    l = (b + 72) | 0;
+                    i = e;
+                    a: while (1) {
+                      if (((k - i) | 0) <= 0) {
+                        j = 23;
+                        break;
+                      }
+                      switch (a[(l + (d[i >> 0] | 0)) >> 0] | 0) {
+                        case 3: {
+                          j = 8;
+                          break a;
+                        }
+                        case 30: {
+                          j = 11;
+                          break a;
+                        }
+                        case 10: {
+                          j = 14;
+                          break a;
+                        }
+                        case 9: {
+                          j = 17;
+                          break a;
+                        }
+                        case 5: {
+                          h = 2;
+                          break;
+                        }
+                        case 6: {
+                          h = 3;
+                          break;
+                        }
+                        case 7: {
+                          h = 4;
+                          break;
+                        }
+                        default:
+                          h = 1;
+                      }
+                      i = (i + h) | 0;
+                    }
+                    if ((j | 0) == 8)
+                      if ((i | 0) == (e | 0)) {
+                        h = W_(b, (e + 1) | 0, f, g) | 0;
+                        break;
+                      } else {
+                        c[g >> 2] = i;
+                        h = 6;
+                        break;
+                      }
+                    else if ((j | 0) == 11)
+                      if ((i | 0) == (e | 0)) {
+                        h = X_(b, (e + 1) | 0, f, g) | 0;
+                        h = (h | 0) == 22 ? 0 : h;
+                        break;
+                      } else {
+                        c[g >> 2] = i;
+                        h = 6;
+                        break;
+                      }
+                    else if ((j | 0) == 14)
+                      if ((i | 0) == (e | 0)) {
+                        c[g >> 2] = e + 1;
+                        h = 7;
+                        break;
+                      } else {
+                        c[g >> 2] = i;
+                        h = 6;
+                        break;
+                      }
+                    else if ((j | 0) == 17) {
+                      if ((i | 0) != (e | 0)) {
+                        c[g >> 2] = i;
+                        h = 6;
+                        break;
+                      }
+                      h = (e + 1) | 0;
+                      if (((k - h) | 0) <= 0) {
+                        h = -3;
+                        break;
+                      }
+                      c[g >> 2] = (a[(l + (d[h >> 0] | 0)) >> 0] | 0) == 10 ? (e + 2) | 0 : h;
+                      h = 7;
+                      break;
+                    } else if ((j | 0) == 23) {
+                      c[g >> 2] = i;
+                      h = 6;
+                      break;
+                    }
+                  } else h = -1;
+                } else h = -4;
+              while (0);
+              return h | 0;
+            }
+            function M_(b, c, d, e) {
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              f = d;
+              b = c;
+              while (1) {
+                c = a[e >> 0] | 0;
+                if (!((c << 24) >> 24)) {
+                  g = 6;
+                  break;
+                }
+                if (((f - b) | 0) < 1) {
+                  b = 0;
+                  break;
+                }
+                if ((a[b >> 0] | 0) != (c << 24) >> 24) {
+                  b = 0;
+                  break;
+                }
+                e = (e + 1) | 0;
+                b = (b + 1) | 0;
+              }
+              if ((g | 0) == 6) b = ((b | 0) == (d | 0)) & 1;
+              return b | 0;
+            }
+            function N_(b, c) {
+              b = b | 0;
+              c = c | 0;
+              var e = 0,
+                f = 0;
+              f = (b + 72) | 0;
+              b = c;
+              a: while (1) {
+                switch (a[(f + (d[b >> 0] | 0)) >> 0] | 0) {
+                  case 5: {
+                    e = 2;
+                    break;
+                  }
+                  case 6: {
+                    e = 3;
+                    break;
+                  }
+                  case 7: {
+                    e = 4;
+                    break;
+                  }
+                  case 27:
+                  case 26:
+                  case 25:
+                  case 24:
+                  case 23:
+                  case 22:
+                  case 29: {
+                    e = 1;
+                    break;
+                  }
+                  default:
+                    break a;
+                }
+                b = (b + e) | 0;
+              }
+              return (b - c) | 0;
+            }
+            function O_(b, c) {
+              b = b | 0;
+              c = c | 0;
+              b = (b + 72) | 0;
+              a: while (1) {
+                switch (a[(b + (d[c >> 0] | 0)) >> 0] | 0) {
+                  case 21:
+                  case 9:
+                  case 10:
+                    break;
+                  default:
+                    break a;
+                }
+                c = (c + 1) | 0;
+              }
+              return c | 0;
+            }
+            function P_(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              l = (b + 72) | 0;
+              j = 0;
+              k = 0;
+              b = 1;
+              a: while (1) {
+                h = (e + 1) | 0;
+                i = a[h >> 0] | 0;
+                do
+                  switch (a[(l + (i & 255)) >> 0] | 0) {
+                    case 5: {
+                      if (!b)
+                        if ((k | 0) < (f | 0)) {
+                          c[(g + (k << 4)) >> 2] = h;
+                          a[(g + (k << 4) + 12) >> 0] = 1;
+                          b = 1;
+                        } else b = 1;
+                      h = k;
+                      i = j;
+                      e = (e + 2) | 0;
+                      k = h;
+                      j = i;
+                      continue a;
+                    }
+                    case 6: {
+                      if (!b)
+                        if ((k | 0) < (f | 0)) {
+                          c[(g + (k << 4)) >> 2] = h;
+                          a[(g + (k << 4) + 12) >> 0] = 1;
+                          b = 1;
+                        } else b = 1;
+                      h = k;
+                      i = j;
+                      e = (e + 3) | 0;
+                      k = h;
+                      j = i;
+                      continue a;
+                    }
+                    case 7: {
+                      if (!b)
+                        if ((k | 0) < (f | 0)) {
+                          c[(g + (k << 4)) >> 2] = h;
+                          a[(g + (k << 4) + 12) >> 0] = 1;
+                          b = 1;
+                        } else b = 1;
+                      h = k;
+                      i = j;
+                      e = (e + 4) | 0;
+                      k = h;
+                      j = i;
+                      continue a;
+                    }
+                    case 24:
+                    case 22:
+                    case 29: {
+                      if (b | 0) {
+                        o = b;
+                        n = k;
+                        i = j;
+                        e = h;
+                        b = o;
+                        k = n;
+                        j = i;
+                        continue a;
+                      }
+                      if ((k | 0) >= (f | 0)) {
+                        n = k;
+                        o = j;
+                        b = 1;
+                        e = h;
+                        k = n;
+                        j = o;
+                        continue a;
+                      }
+                      c[(g + (k << 4)) >> 2] = h;
+                      a[(g + (k << 4) + 12) >> 0] = 1;
+                      n = k;
+                      o = j;
+                      b = 1;
+                      e = h;
+                      k = n;
+                      j = o;
+                      continue a;
+                    }
+                    case 12: {
+                      if ((b | 0) != 2) {
+                        if ((k | 0) >= (f | 0)) {
+                          o = k;
+                          j = 12;
+                          b = 2;
+                          e = h;
+                          k = o;
+                          continue a;
+                        }
+                        c[(g + (k << 4) + 4) >> 2] = e + 2;
+                        o = k;
+                        j = 12;
+                        b = 2;
+                        e = h;
+                        k = o;
+                        continue a;
+                      }
+                      if ((j | 0) != 12) {
+                        n = k;
+                        o = j;
+                        b = 2;
+                        e = h;
+                        k = n;
+                        j = o;
+                        continue a;
+                      }
+                      if ((k | 0) < (f | 0)) c[(g + (k << 4) + 8) >> 2] = h;
+                      j = 12;
+                      k = (k + 1) | 0;
+                      b = 0;
+                      e = h;
+                      continue a;
+                    }
+                    case 13: {
+                      if ((b | 0) != 2) {
+                        if ((k | 0) >= (f | 0)) {
+                          o = k;
+                          j = 13;
+                          b = 2;
+                          e = h;
+                          k = o;
+                          continue a;
+                        }
+                        c[(g + (k << 4) + 4) >> 2] = e + 2;
+                        o = k;
+                        j = 13;
+                        b = 2;
+                        e = h;
+                        k = o;
+                        continue a;
+                      }
+                      if ((j | 0) != 13) {
+                        n = k;
+                        o = j;
+                        b = 2;
+                        e = h;
+                        k = n;
+                        j = o;
+                        continue a;
+                      }
+                      if ((k | 0) < (f | 0)) c[(g + (k << 4) + 8) >> 2] = h;
+                      j = 13;
+                      k = (k + 1) | 0;
+                      b = 0;
+                      e = h;
+                      continue a;
+                    }
+                    case 3: {
+                      if ((k | 0) >= (f | 0)) {
+                        i = b;
+                        n = k;
+                        o = j;
+                        e = h;
+                        b = i;
+                        k = n;
+                        j = o;
+                        continue a;
+                      }
+                      a[(g + (k << 4) + 12) >> 0] = 0;
+                      i = b;
+                      n = k;
+                      o = j;
+                      e = h;
+                      b = i;
+                      k = n;
+                      j = o;
+                      continue a;
+                    }
+                    case 21: {
+                      switch (b | 0) {
+                        case 1: {
+                          n = k;
+                          o = j;
+                          b = 0;
+                          e = h;
+                          k = n;
+                          j = o;
+                          continue a;
+                        }
+                        case 2:
+                          break;
+                        default: {
+                          i = b;
+                          n = k;
+                          o = j;
+                          e = h;
+                          b = i;
+                          k = n;
+                          j = o;
+                          continue a;
+                        }
+                      }
+                      if ((k | 0) >= (f | 0)) {
+                        n = k;
+                        o = j;
+                        b = 2;
+                        e = h;
+                        k = n;
+                        j = o;
+                        continue a;
+                      }
+                      b = (g + (k << 4) + 12) | 0;
+                      if (!(a[b >> 0] | 0)) {
+                        n = k;
+                        o = j;
+                        b = 2;
+                        e = h;
+                        k = n;
+                        j = o;
+                        continue a;
+                      }
+                      if (
+                        (
+                          ((i << 24) >> 24 == 32 ? (h | 0) != (c[(g + (k << 4) + 4) >> 2] | 0) : 0)
+                            ? ((m = a[(e + 2) >> 0] | 0), (m << 24) >> 24 != 32)
+                            : 0
+                        )
+                          ? (j | 0) != (d[(l + (m & 255)) >> 0] | 0)
+                          : 0
+                      ) {
+                        n = k;
+                        o = j;
+                        b = 2;
+                        e = h;
+                        k = n;
+                        j = o;
+                        continue a;
+                      }
+                      a[b >> 0] = 0;
+                      n = k;
+                      o = j;
+                      b = 2;
+                      e = h;
+                      k = n;
+                      j = o;
+                      continue a;
+                    }
+                    case 10:
+                    case 9: {
+                      switch (b | 0) {
+                        case 1: {
+                          n = k;
+                          o = j;
+                          b = 0;
+                          e = h;
+                          k = n;
+                          j = o;
+                          continue a;
+                        }
+                        case 2:
+                          break;
+                        default: {
+                          i = b;
+                          n = k;
+                          o = j;
+                          e = h;
+                          b = i;
+                          k = n;
+                          j = o;
+                          continue a;
+                        }
+                      }
+                      if ((k | 0) >= (f | 0)) {
+                        n = k;
+                        o = j;
+                        b = 2;
+                        e = h;
+                        k = n;
+                        j = o;
+                        continue a;
+                      }
+                      a[(g + (k << 4) + 12) >> 0] = 0;
+                      n = k;
+                      o = j;
+                      b = 2;
+                      e = h;
+                      k = n;
+                      j = o;
+                      continue a;
+                    }
+                    case 17:
+                    case 11:
+                      if ((b | 0) == 2) {
+                        n = k;
+                        o = j;
+                        b = 2;
+                        e = h;
+                        k = n;
+                        j = o;
+                        continue a;
+                      } else break a;
+                    default: {
+                      i = b;
+                      n = k;
+                      o = j;
+                      e = h;
+                      b = i;
+                      k = n;
+                      j = o;
+                      continue a;
+                    }
+                  }
+                while (0);
+              }
+              return k | 0;
+            }
+            function Q_(b, c) {
+              b = b | 0;
+              c = c | 0;
+              var d = 0,
+                e = 0;
+              b = (c + 2) | 0;
+              d = a[b >> 0] | 0;
+              a: do
+                if ((d << 24) >> 24 == 120) {
+                  d = (c + 3) | 0;
+                  b = 0;
+                  while (1) {
+                    b: while (1) {
+                      e = a[d >> 0] | 0;
+                      c = (e << 24) >> 24;
+                      if ((e << 24) >> 24 == 59) {
+                        e = 14;
+                        break a;
+                      }
+                      switch (c | 0) {
+                        case 57:
+                        case 56:
+                        case 55:
+                        case 54:
+                        case 53:
+                        case 52:
+                        case 51:
+                        case 50:
+                        case 49:
+                        case 48: {
+                          e = 7;
+                          break b;
+                        }
+                        case 70:
+                        case 69:
+                        case 68:
+                        case 67:
+                        case 66:
+                        case 65: {
+                          e = 8;
+                          break b;
+                        }
+                        case 102:
+                        case 101:
+                        case 100:
+                        case 99:
+                        case 98:
+                        case 97: {
+                          e = 9;
+                          break b;
+                        }
+                        default: {
+                        }
+                      }
+                      d = (d + 1) | 0;
+                    }
+                    if ((e | 0) == 7) {
+                      e = 0;
+                      b = (c + -48) | (b << 4);
+                    } else if ((e | 0) == 8) {
+                      e = 0;
+                      b = ((b << 4) + -55 + c) | 0;
+                    } else if ((e | 0) == 9) {
+                      e = 0;
+                      b = ((b << 4) + -87 + c) | 0;
+                    }
+                    if ((b | 0) < 1114112) d = (d + 1) | 0;
+                    else {
+                      b = -1;
+                      break;
+                    }
+                  }
+                } else {
+                  c = b;
+                  b = 0;
+                  while (1) {
+                    if ((d << 24) >> 24 == 59) {
+                      e = 14;
+                      break a;
+                    }
+                    b = (((d << 24) >> 24) + -48 + ((b * 10) | 0)) | 0;
+                    if ((b | 0) >= 1114112) {
+                      b = -1;
+                      break a;
+                    }
+                    d = (c + 1) | 0;
+                    c = d;
+                    d = a[d >> 0] | 0;
+                  }
+                }
+              while (0);
+              if ((e | 0) == 14) b = A_(b) | 0;
+              return b | 0;
+            }
+            function R_(b, c, d) {
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0;
+              a: do
+                switch ((d - c) | 0) {
+                  case 2: {
+                    if ((a[(c + 1) >> 0] | 0) == 116) {
+                      b = a[c >> 0] | 0;
+                      b = (b << 24) >> 24 == 108 ? 60 : (b << 24) >> 24 == 103 ? 62 : 0;
+                    } else e = 14;
+                    break;
+                  }
+                  case 3: {
+                    if (((a[c >> 0] | 0) == 97 ? (a[(c + 1) >> 0] | 0) == 109 : 0) ? (a[(c + 2) >> 0] | 0) == 112 : 0)
+                      b = 38;
+                    else e = 14;
+                    break;
+                  }
+                  case 4:
+                    switch (a[c >> 0] | 0) {
+                      case 113: {
+                        if ((a[(c + 1) >> 0] | 0) != 117) {
+                          e = 14;
+                          break a;
+                        }
+                        if ((a[(c + 2) >> 0] | 0) != 111) {
+                          e = 14;
+                          break a;
+                        }
+                        if ((a[(c + 3) >> 0] | 0) == 116) {
+                          b = 34;
+                          break a;
+                        } else {
+                          e = 14;
+                          break a;
+                        }
+                      }
+                      case 97: {
+                        if ((a[(c + 1) >> 0] | 0) != 112) {
+                          e = 14;
+                          break a;
+                        }
+                        if ((a[(c + 2) >> 0] | 0) != 111) {
+                          e = 14;
+                          break a;
+                        }
+                        if ((a[(c + 3) >> 0] | 0) == 115) {
+                          b = 39;
+                          break a;
+                        } else {
+                          e = 14;
+                          break a;
+                        }
+                      }
+                      default: {
+                        e = 14;
+                        break a;
+                      }
+                    }
+                  default:
+                    e = 14;
+                }
+              while (0);
+              if ((e | 0) == 14) b = 0;
+              return b | 0;
+            }
+            function S_(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0;
+              h = (b + 72) | 0;
+              i = (g + 4) | 0;
+              while (1) {
+                if (((f - e) | 0) <= 0) break;
+                switch (a[(h + (d[e >> 0] | 0)) >> 0] | 0) {
+                  case 5: {
+                    e = (e + 2) | 0;
+                    break;
+                  }
+                  case 6: {
+                    e = (e + 3) | 0;
+                    break;
+                  }
+                  case 7: {
+                    e = (e + 4) | 0;
+                    break;
+                  }
+                  case 10: {
+                    c[i >> 2] = -1;
+                    c[g >> 2] = (c[g >> 2] | 0) + 1;
+                    e = (e + 1) | 0;
+                    break;
+                  }
+                  case 9: {
+                    c[g >> 2] = (c[g >> 2] | 0) + 1;
+                    b = (e + 1) | 0;
+                    if (((f - b) | 0) > 0) e = (a[(h + (d[b >> 0] | 0)) >> 0] | 0) == 10 ? (e + 2) | 0 : b;
+                    else e = b;
+                    c[i >> 2] = -1;
+                    break;
+                  }
+                  default:
+                    e = (e + 1) | 0;
+                }
+                c[i >> 2] = (c[i >> 2] | 0) + 1;
+              }
+              return;
+            }
+            function T_(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0;
+              g = (e + -1) | 0;
+              b = (b + 72) | 0;
+              a: while (1) {
+                d = (d + 1) | 0;
+                if (((g - d) | 0) <= 0) {
+                  d = 1;
+                  break;
+                }
+                e = a[d >> 0] | 0;
+                switch (a[(b + (e & 255)) >> 0] | 0) {
+                  case 23:
+                  case 19:
+                  case 30:
+                  case 33:
+                  case 16:
+                  case 18:
+                  case 10:
+                  case 9:
+                  case 15:
+                  case 14:
+                  case 17:
+                  case 35:
+                  case 34:
+                  case 32:
+                  case 31:
+                  case 13:
+                  case 27:
+                  case 24:
+                  case 25:
+                    continue a;
+                  case 21:
+                    if ((e << 24) >> 24 == 9) {
+                      h = 7;
+                      break a;
+                    } else continue a;
+                  case 22:
+                  case 26: {
+                    if ((e << 24) >> 24 >= 0) continue a;
+                    break;
+                  }
+                  default: {
+                  }
+                }
+                switch (((e << 24) >> 24) | 0) {
+                  case 64:
+                  case 36:
+                    break;
+                  default: {
+                    h = 7;
+                    break a;
+                  }
+                }
+              }
+              if ((h | 0) == 7) {
+                c[f >> 2] = d;
+                d = 0;
+              }
+              return d | 0;
+            }
+            function U_(b, e, f, g, h) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              var i = 0,
+                j = 0,
+                k = 0;
+              i = h;
+              while (1) {
+                j = c[e >> 2] | 0;
+                if ((j | 0) == (f | 0)) {
+                  b = 0;
+                  break;
+                }
+                k = d[j >> 0] | 0;
+                b = c[g >> 2] | 0;
+                if (!(k & 128)) {
+                  if ((b | 0) == (h | 0)) {
+                    b = 2;
+                    break;
+                  }
+                  c[e >> 2] = j + 1;
+                  j = a[j >> 0] | 0;
+                  k = c[g >> 2] | 0;
+                  c[g >> 2] = k + 1;
+                  a[k >> 0] = j;
+                  continue;
+                } else {
+                  if (((i - b) | 0) < 2) {
+                    b = 2;
+                    break;
+                  }
+                  c[g >> 2] = b + 1;
+                  a[b >> 0] = (k >>> 6) | 192;
+                  j = c[g >> 2] | 0;
+                  c[g >> 2] = j + 1;
+                  a[j >> 0] = (k & 63) | 128;
+                  c[e >> 2] = (c[e >> 2] | 0) + 1;
+                  continue;
+                }
+              }
+              return b | 0;
+            }
+            function V_(a, e, f, g, h) {
+              a = a | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              var i = 0,
+                j = 0;
+              while (1) {
+                a = c[e >> 2] | 0;
+                i = a >>> 0 < f >>> 0;
+                j = c[g >> 2] | 0;
+                if (!(i & (j >>> 0 < h >>> 0))) break;
+                c[e >> 2] = a + 1;
+                i = d[a >> 0] | 0;
+                j = c[g >> 2] | 0;
+                c[g >> 2] = j + 2;
+                b[j >> 1] = i;
+              }
+              return (((j | 0) != (h | 0)) | (i ^ 1) ? 0 : 2) | 0;
+            }
+            function W_(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              k = f;
+              h = (k - e) | 0;
+              a: do
+                if ((h | 0) > 0) {
+                  l = (b + 72) | 0;
+                  switch (a[(l + (d[e >> 0] | 0)) >> 0] | 0) {
+                    case 29: {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    case 24:
+                    case 22: {
+                      f = 1;
+                      break;
+                    }
+                    case 5: {
+                      if ((h | 0) < 2) {
+                        f = -2;
+                        break a;
+                      }
+                      if (!(lb[c[(b + 340) >> 2] & 127](b, e) | 0)) {
+                        c[g >> 2] = e;
+                        f = 0;
+                        break a;
+                      } else f = 2;
+                      break;
+                    }
+                    case 6: {
+                      if ((h | 0) < 3) {
+                        f = -2;
+                        break a;
+                      }
+                      if (!(lb[c[(b + 344) >> 2] & 127](b, e) | 0)) {
+                        c[g >> 2] = e;
+                        f = 0;
+                        break a;
+                      } else f = 3;
+                      break;
+                    }
+                    case 7: {
+                      if ((h | 0) < 4) {
+                        f = -2;
+                        break a;
+                      }
+                      if (!(lb[c[(b + 348) >> 2] & 127](b, e) | 0)) {
+                        c[g >> 2] = e;
+                        f = 0;
+                        break a;
+                      } else f = 4;
+                      break;
+                    }
+                    case 19: {
+                      f = Y_(b, (e + 1) | 0, f, g) | 0;
+                      break a;
+                    }
+                    default: {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                  }
+                  h = (b + 328) | 0;
+                  i = (b + 332) | 0;
+                  j = (b + 336) | 0;
+                  e = (e + f) | 0;
+                  b: while (1) {
+                    f = (k - e) | 0;
+                    if ((f | 0) <= 0) {
+                      f = -1;
+                      break a;
+                    }
+                    switch (a[(l + (d[e >> 0] | 0)) >> 0] | 0) {
+                      case 29: {
+                        h = 18;
+                        break b;
+                      }
+                      case 18: {
+                        h = 29;
+                        break b;
+                      }
+                      case 27:
+                      case 26:
+                      case 25:
+                      case 24:
+                      case 22: {
+                        f = 1;
+                        break;
+                      }
+                      case 5: {
+                        if ((f | 0) < 2) {
+                          f = -2;
+                          break a;
+                        }
+                        if (!(lb[c[h >> 2] & 127](b, e) | 0)) {
+                          h = 21;
+                          break b;
+                        } else f = 2;
+                        break;
+                      }
+                      case 6: {
+                        if ((f | 0) < 3) {
+                          f = -2;
+                          break a;
+                        }
+                        if (!(lb[c[i >> 2] & 127](b, e) | 0)) {
+                          h = 24;
+                          break b;
+                        } else f = 3;
+                        break;
+                      }
+                      case 7: {
+                        if ((f | 0) < 4) {
+                          f = -2;
+                          break a;
+                        }
+                        if (!(lb[c[j >> 2] & 127](b, e) | 0)) {
+                          h = 27;
+                          break b;
+                        } else f = 4;
+                        break;
+                      }
+                      default: {
+                        h = 30;
+                        break b;
+                      }
+                    }
+                    e = (e + f) | 0;
+                  }
+                  if ((h | 0) == 18) {
+                    c[g >> 2] = e;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 21) {
+                    c[g >> 2] = e;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 24) {
+                    c[g >> 2] = e;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 27) {
+                    c[g >> 2] = e;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 29) {
+                    c[g >> 2] = e + 1;
+                    f = 9;
+                    break;
+                  } else if ((h | 0) == 30) {
+                    c[g >> 2] = e;
+                    f = 0;
+                    break;
+                  }
+                } else f = -1;
+              while (0);
+              return f | 0;
+            }
+            function X_(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              h = (f - e) | 0;
+              a: do
+                if ((h | 0) > 0) {
+                  l = (b + 72) | 0;
+                  switch (a[(l + (d[e >> 0] | 0)) >> 0] | 0) {
+                    case 29: {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    case 24:
+                    case 22: {
+                      h = 1;
+                      break;
+                    }
+                    case 5: {
+                      if ((h | 0) < 2) {
+                        f = -2;
+                        break a;
+                      }
+                      if (!(lb[c[(b + 340) >> 2] & 127](b, e) | 0)) {
+                        c[g >> 2] = e;
+                        f = 0;
+                        break a;
+                      } else h = 2;
+                      break;
+                    }
+                    case 6: {
+                      if ((h | 0) < 3) {
+                        f = -2;
+                        break a;
+                      }
+                      if (!(lb[c[(b + 344) >> 2] & 127](b, e) | 0)) {
+                        c[g >> 2] = e;
+                        f = 0;
+                        break a;
+                      } else h = 3;
+                      break;
+                    }
+                    case 7: {
+                      if ((h | 0) < 4) {
+                        f = -2;
+                        break a;
+                      }
+                      if (!(lb[c[(b + 348) >> 2] & 127](b, e) | 0)) {
+                        c[g >> 2] = e;
+                        f = 0;
+                        break a;
+                      } else h = 4;
+                      break;
+                    }
+                    case 30:
+                    case 9:
+                    case 10:
+                    case 21: {
+                      c[g >> 2] = e;
+                      f = 22;
+                      break a;
+                    }
+                    default: {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                  }
+                  i = (b + 328) | 0;
+                  j = (b + 332) | 0;
+                  k = (b + 336) | 0;
+                  e = (e + h) | 0;
+                  b: while (1) {
+                    h = (f - e) | 0;
+                    if ((h | 0) <= 0) {
+                      f = -1;
+                      break a;
+                    }
+                    switch (a[(l + (d[e >> 0] | 0)) >> 0] | 0) {
+                      case 29: {
+                        h = 18;
+                        break b;
+                      }
+                      case 18: {
+                        h = 29;
+                        break b;
+                      }
+                      case 27:
+                      case 26:
+                      case 25:
+                      case 24:
+                      case 22: {
+                        h = 1;
+                        break;
+                      }
+                      case 5: {
+                        if ((h | 0) < 2) {
+                          f = -2;
+                          break a;
+                        }
+                        if (!(lb[c[i >> 2] & 127](b, e) | 0)) {
+                          h = 21;
+                          break b;
+                        } else h = 2;
+                        break;
+                      }
+                      case 6: {
+                        if ((h | 0) < 3) {
+                          f = -2;
+                          break a;
+                        }
+                        if (!(lb[c[j >> 2] & 127](b, e) | 0)) {
+                          h = 24;
+                          break b;
+                        } else h = 3;
+                        break;
+                      }
+                      case 7: {
+                        if ((h | 0) < 4) {
+                          f = -2;
+                          break a;
+                        }
+                        if (!(lb[c[k >> 2] & 127](b, e) | 0)) {
+                          h = 27;
+                          break b;
+                        } else h = 4;
+                        break;
+                      }
+                      default: {
+                        h = 30;
+                        break b;
+                      }
+                    }
+                    e = (e + h) | 0;
+                  }
+                  if ((h | 0) == 18) {
+                    c[g >> 2] = e;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 21) {
+                    c[g >> 2] = e;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 24) {
+                    c[g >> 2] = e;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 27) {
+                    c[g >> 2] = e;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 29) {
+                    c[g >> 2] = e + 1;
+                    f = 28;
+                    break;
+                  } else if ((h | 0) == 30) {
+                    c[g >> 2] = e;
+                    f = 0;
+                    break;
+                  }
+                } else f = -1;
+              while (0);
+              return f | 0;
+            }
+            function Y_(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0;
+              i = f;
+              a: do
+                if (((i - e) | 0) > 0) {
+                  h = a[e >> 0] | 0;
+                  if ((h << 24) >> 24 == 120) {
+                    b = Z_(b, (e + 1) | 0, f, g) | 0;
+                    break;
+                  }
+                  f = (b + 72) | 0;
+                  if ((a[(f + (h & 255)) >> 0] | 0) != 25) {
+                    c[g >> 2] = e;
+                    b = 0;
+                    break;
+                  }
+                  b: while (1) {
+                    b = (e + 1) | 0;
+                    if (((i - b) | 0) <= 0) {
+                      b = -1;
+                      break a;
+                    }
+                    switch (a[(f + (d[b >> 0] | 0)) >> 0] | 0) {
+                      case 25: {
+                        e = b;
+                        break;
+                      }
+                      case 18: {
+                        f = 8;
+                        break b;
+                      }
+                      default: {
+                        f = 9;
+                        break b;
+                      }
+                    }
+                  }
+                  if ((f | 0) == 8) {
+                    c[g >> 2] = e + 2;
+                    b = 10;
+                    break;
+                  } else if ((f | 0) == 9) {
+                    c[g >> 2] = b;
+                    b = 0;
+                    break;
+                  }
+                } else b = -1;
+              while (0);
+              return b | 0;
+            }
+            function Z_(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0;
+              a: do
+                if (((f - e) | 0) > 0) {
+                  b = (b + 72) | 0;
+                  if (((a[(b + (d[e >> 0] | 0)) >> 0] & -2) << 24) >> 24 != 24) {
+                    c[g >> 2] = e;
+                    f = 0;
+                    break;
+                  }
+                  b: while (1) {
+                    h = (e + 1) | 0;
+                    if (((f - h) | 0) <= 0) {
+                      f = -1;
+                      break a;
+                    }
+                    switch (a[(b + (d[h >> 0] | 0)) >> 0] | 0) {
+                      case 24:
+                      case 25: {
+                        e = h;
+                        break;
+                      }
+                      case 18: {
+                        b = 6;
+                        break b;
+                      }
+                      default: {
+                        b = 7;
+                        break b;
+                      }
+                    }
+                  }
+                  if ((b | 0) == 6) {
+                    c[g >> 2] = e + 2;
+                    f = 10;
+                    break;
+                  } else if ((b | 0) == 7) {
+                    c[g >> 2] = h;
+                    f = 0;
+                    break;
+                  }
+                } else f = -1;
+              while (0);
+              return f | 0;
+            }
+            function __(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0;
+              q = f;
+              h = (q - e) | 0;
+              a: do
+                if ((h | 0) > 0) {
+                  p = (b + 72) | 0;
+                  switch (a[(p + (d[e >> 0] | 0)) >> 0] | 0) {
+                    case 29: {
+                      c[g >> 2] = e;
+                      h = 0;
+                      break a;
+                    }
+                    case 24:
+                    case 22: {
+                      h = 1;
+                      break;
+                    }
+                    case 5: {
+                      if ((h | 0) < 2) {
+                        h = -2;
+                        break a;
+                      }
+                      if (!(lb[c[(b + 340) >> 2] & 127](b, e) | 0)) {
+                        c[g >> 2] = e;
+                        h = 0;
+                        break a;
+                      } else h = 2;
+                      break;
+                    }
+                    case 6: {
+                      if ((h | 0) < 3) {
+                        h = -2;
+                        break a;
+                      }
+                      if (!(lb[c[(b + 344) >> 2] & 127](b, e) | 0)) {
+                        c[g >> 2] = e;
+                        h = 0;
+                        break a;
+                      } else h = 3;
+                      break;
+                    }
+                    case 7: {
+                      if ((h | 0) < 4) {
+                        h = -2;
+                        break a;
+                      }
+                      if (!(lb[c[(b + 348) >> 2] & 127](b, e) | 0)) {
+                        c[g >> 2] = e;
+                        h = 0;
+                        break a;
+                      } else h = 4;
+                      break;
+                    }
+                    case 16: {
+                      h = (e + 1) | 0;
+                      if (((q - h) | 0) <= 0) {
+                        h = -1;
+                        break a;
+                      }
+                      switch (a[(p + (d[h >> 0] | 0)) >> 0] | 0) {
+                        case 27: {
+                          h = $_(b, (e + 2) | 0, f, g) | 0;
+                          break a;
+                        }
+                        case 20: {
+                          h = a$((e + 2) | 0, f, g) | 0;
+                          break a;
+                        }
+                        default: {
+                          c[g >> 2] = h;
+                          h = 0;
+                          break a;
+                        }
+                      }
+                    }
+                    case 15: {
+                      h = b$(b, (e + 1) | 0, f, g) | 0;
+                      break a;
+                    }
+                    case 17: {
+                      h = c$(b, (e + 1) | 0, f, g) | 0;
+                      break a;
+                    }
+                    default: {
+                      c[g >> 2] = e;
+                      h = 0;
+                      break a;
+                    }
+                  }
+                  j = (b + 328) | 0;
+                  k = (b + 332) | 0;
+                  l = (b + 336) | 0;
+                  m = (b + 340) | 0;
+                  n = (b + 344) | 0;
+                  o = (b + 348) | 0;
+                  i = 0;
+                  h = (e + h) | 0;
+                  b: while (1) {
+                    e = (q - h) | 0;
+                    if ((e | 0) <= 0) {
+                      h = -1;
+                      break a;
+                    }
+                    c: do
+                      switch (a[(p + (d[h >> 0] | 0)) >> 0] | 0) {
+                        case 29: {
+                          r = 24;
+                          break b;
+                        }
+                        case 10:
+                        case 9:
+                        case 21: {
+                          r = 50;
+                          break b;
+                        }
+                        case 11: {
+                          r = 64;
+                          break b;
+                        }
+                        case 17:
+                          break b;
+                        case 27:
+                        case 26:
+                        case 25:
+                        case 24:
+                        case 22: {
+                          e = 1;
+                          break;
+                        }
+                        case 5: {
+                          if ((e | 0) < 2) {
+                            h = -2;
+                            break a;
+                          }
+                          if (!(lb[c[j >> 2] & 127](b, h) | 0)) {
+                            r = 27;
+                            break b;
+                          } else e = 2;
+                          break;
+                        }
+                        case 6: {
+                          if ((e | 0) < 3) {
+                            h = -2;
+                            break a;
+                          }
+                          if (!(lb[c[k >> 2] & 127](b, h) | 0)) {
+                            r = 30;
+                            break b;
+                          } else e = 3;
+                          break;
+                        }
+                        case 7: {
+                          if ((e | 0) < 4) {
+                            h = -2;
+                            break a;
+                          }
+                          if (!(lb[c[l >> 2] & 127](b, h) | 0)) {
+                            r = 33;
+                            break b;
+                          } else e = 4;
+                          break;
+                        }
+                        case 23: {
+                          if (i | 0) {
+                            r = 35;
+                            break b;
+                          }
+                          i = (h + 1) | 0;
+                          e = (q - i) | 0;
+                          if ((e | 0) <= 0) {
+                            h = -1;
+                            break a;
+                          }
+                          switch (a[(p + (d[i >> 0] | 0)) >> 0] | 0) {
+                            case 29: {
+                              r = 38;
+                              break b;
+                            }
+                            case 24:
+                            case 22: {
+                              i = 1;
+                              e = 2;
+                              break c;
+                            }
+                            case 5: {
+                              if ((e | 0) < 2) {
+                                h = -2;
+                                break a;
+                              }
+                              if (!(lb[c[m >> 2] & 127](b, i) | 0)) {
+                                r = 42;
+                                break b;
+                              } else {
+                                i = 1;
+                                e = 3;
+                                break c;
+                              }
+                            }
+                            case 6: {
+                              if ((e | 0) < 3) {
+                                h = -2;
+                                break a;
+                              }
+                              if (!(lb[c[n >> 2] & 127](b, i) | 0)) {
+                                r = 45;
+                                break b;
+                              } else {
+                                i = 1;
+                                e = 4;
+                                break c;
+                              }
+                            }
+                            case 7: {
+                              if ((e | 0) < 4) {
+                                h = -2;
+                                break a;
+                              }
+                              if (!(lb[c[o >> 2] & 127](b, i) | 0)) {
+                                r = 48;
+                                break b;
+                              } else {
+                                i = 1;
+                                e = 5;
+                                break c;
+                              }
+                            }
+                            default: {
+                              r = 49;
+                              break b;
+                            }
+                          }
+                        }
+                        default: {
+                          r = 69;
+                          break b;
+                        }
+                      }
+                    while (0);
+                    h = (h + e) | 0;
+                  }
+                  d: switch (r | 0) {
+                    case 24: {
+                      c[g >> 2] = h;
+                      h = 0;
+                      break a;
+                    }
+                    case 27: {
+                      c[g >> 2] = h;
+                      h = 0;
+                      break a;
+                    }
+                    case 30: {
+                      c[g >> 2] = h;
+                      h = 0;
+                      break a;
+                    }
+                    case 33: {
+                      c[g >> 2] = h;
+                      h = 0;
+                      break a;
+                    }
+                    case 35: {
+                      c[g >> 2] = h;
+                      h = 0;
+                      break a;
+                    }
+                    case 38: {
+                      c[g >> 2] = i;
+                      h = 0;
+                      break a;
+                    }
+                    case 42: {
+                      c[g >> 2] = i;
+                      h = 0;
+                      break a;
+                    }
+                    case 45: {
+                      c[g >> 2] = i;
+                      h = 0;
+                      break a;
+                    }
+                    case 48: {
+                      c[g >> 2] = i;
+                      h = 0;
+                      break a;
+                    }
+                    case 49: {
+                      c[g >> 2] = i;
+                      h = 0;
+                      break a;
+                    }
+                    case 50: {
+                      e: while (1) {
+                        r = 0;
+                        i = (h + 1) | 0;
+                        e = (q - i) | 0;
+                        if ((e | 0) <= 0) {
+                          h = -1;
+                          break a;
+                        }
+                        switch (a[(p + (d[i >> 0] | 0)) >> 0] | 0) {
+                          case 11: {
+                            h = i;
+                            r = 64;
+                            break d;
+                          }
+                          case 17: {
+                            h = i;
+                            break d;
+                          }
+                          case 10:
+                          case 9:
+                          case 21: {
+                            h = i;
+                            r = 50;
+                            break;
+                          }
+                          case 29: {
+                            r = 52;
+                            break e;
+                          }
+                          case 24:
+                          case 22: {
+                            i = 2;
+                            break e;
+                          }
+                          case 5: {
+                            r = 53;
+                            break e;
+                          }
+                          case 6: {
+                            r = 56;
+                            break e;
+                          }
+                          case 7: {
+                            r = 59;
+                            break e;
+                          }
+                          default: {
+                            r = 62;
+                            break e;
+                          }
+                        }
+                      }
+                      if ((r | 0) == 52) {
+                        c[g >> 2] = i;
+                        h = 0;
+                        break a;
+                      } else if ((r | 0) == 53) {
+                        if ((e | 0) < 2) {
+                          h = -2;
+                          break a;
+                        }
+                        if (!(lb[c[m >> 2] & 127](b, i) | 0)) {
+                          c[g >> 2] = i;
+                          h = 0;
+                          break a;
+                        } else i = 3;
+                      } else if ((r | 0) == 56) {
+                        if ((e | 0) < 3) {
+                          h = -2;
+                          break a;
+                        }
+                        if (!(lb[c[n >> 2] & 127](b, i) | 0)) {
+                          c[g >> 2] = i;
+                          h = 0;
+                          break a;
+                        } else i = 4;
+                      } else if ((r | 0) == 59) {
+                        if ((e | 0) < 4) {
+                          h = -2;
+                          break a;
+                        }
+                        if (!(lb[c[o >> 2] & 127](b, i) | 0)) {
+                          c[g >> 2] = i;
+                          h = 0;
+                          break a;
+                        } else i = 5;
+                      } else if ((r | 0) == 62) {
+                        c[g >> 2] = i;
+                        h = 0;
+                        break a;
+                      }
+                      h = d$(b, (h + i) | 0, f, g) | 0;
+                      break a;
+                    }
+                    case 69: {
+                      c[g >> 2] = h;
+                      h = 0;
+                      break a;
+                    }
+                  }
+                  if ((r | 0) == 64) {
+                    c[g >> 2] = h + 1;
+                    h = 2;
+                    break;
+                  }
+                  i = (h + 1) | 0;
+                  if (((q - i) | 0) > 0)
+                    if ((a[i >> 0] | 0) == 62) {
+                      c[g >> 2] = h + 2;
+                      h = 4;
+                      break;
+                    } else {
+                      c[g >> 2] = i;
+                      h = 0;
+                      break;
+                    }
+                  else h = -1;
+                } else h = -1;
+              while (0);
+              return h | 0;
+            }
+            function $_(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              a: do
+                if (((f - e) | 0) > 0) {
+                  if ((a[e >> 0] | 0) != 45) {
+                    c[g >> 2] = e;
+                    f = 0;
+                    break;
+                  }
+                  h = (b + 72) | 0;
+                  i = (b + 352) | 0;
+                  j = (b + 356) | 0;
+                  k = (b + 360) | 0;
+                  l = (e + 1) | 0;
+                  b: while (1) {
+                    e = (f - l) | 0;
+                    if ((e | 0) <= 0) {
+                      f = -1;
+                      break a;
+                    }
+                    switch (a[(h + (d[l >> 0] | 0)) >> 0] | 0) {
+                      case 8:
+                      case 1:
+                      case 0: {
+                        e = 19;
+                        break b;
+                      }
+                      case 5: {
+                        if ((e | 0) < 2) {
+                          f = -2;
+                          break a;
+                        }
+                        if (lb[c[i >> 2] & 127](b, l) | 0) {
+                          e = 9;
+                          break b;
+                        }
+                        l = (l + 2) | 0;
+                        continue b;
+                      }
+                      case 6: {
+                        if ((e | 0) < 3) {
+                          f = -2;
+                          break a;
+                        }
+                        if (lb[c[j >> 2] & 127](b, l) | 0) {
+                          e = 13;
+                          break b;
+                        }
+                        l = (l + 3) | 0;
+                        continue b;
+                      }
+                      case 7: {
+                        if ((e | 0) < 4) {
+                          f = -2;
+                          break a;
+                        }
+                        if (lb[c[k >> 2] & 127](b, l) | 0) {
+                          e = 17;
+                          break b;
+                        }
+                        l = (l + 4) | 0;
+                        continue b;
+                      }
+                      case 27: {
+                        e = (l + 1) | 0;
+                        if (((f - e) | 0) <= 0) {
+                          f = -1;
+                          break a;
+                        }
+                        if ((a[e >> 0] | 0) == 45) {
+                          e = 22;
+                          break b;
+                        } else {
+                          l = e;
+                          continue b;
+                        }
+                      }
+                      default: {
+                        l = (l + 1) | 0;
+                        continue b;
+                      }
+                    }
+                  }
+                  if ((e | 0) == 9) {
+                    c[g >> 2] = l;
+                    f = 0;
+                    break;
+                  } else if ((e | 0) == 13) {
+                    c[g >> 2] = l;
+                    f = 0;
+                    break;
+                  } else if ((e | 0) == 17) {
+                    c[g >> 2] = l;
+                    f = 0;
+                    break;
+                  } else if ((e | 0) == 19) {
+                    c[g >> 2] = l;
+                    f = 0;
+                    break;
+                  } else if ((e | 0) == 22) {
+                    e = (l + 2) | 0;
+                    if (((f - e) | 0) <= 0) {
+                      f = -1;
+                      break;
+                    }
+                    if ((a[e >> 0] | 0) == 62) {
+                      c[g >> 2] = l + 3;
+                      f = 13;
+                      break;
+                    } else {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break;
+                    }
+                  }
+                } else f = -1;
+              while (0);
+              return f | 0;
+            }
+            function a$(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              if (((d - b) | 0) > 5) {
+                d = 0;
+                while (1) {
+                  if ((d | 0) >= 6) {
+                    d = 8;
+                    break;
+                  }
+                  if ((a[b >> 0] | 0) != (a[(144300 + d) >> 0] | 0)) {
+                    d = 0;
+                    break;
+                  }
+                  d = (d + 1) | 0;
+                  b = (b + 1) | 0;
+                }
+                c[e >> 2] = b;
+              } else d = -1;
+              return d | 0;
+            }
+            function b$(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              q = l;
+              l = (l + 16) | 0;
+              p = q;
+              o = f;
+              f = (o - e) | 0;
+              a: do
+                if ((f | 0) > 0) {
+                  n = (b + 72) | 0;
+                  switch (a[(n + (d[e >> 0] | 0)) >> 0] | 0) {
+                    case 29: {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    case 24:
+                    case 22: {
+                      f = 1;
+                      break;
+                    }
+                    case 5: {
+                      if ((f | 0) < 2) {
+                        f = -2;
+                        break a;
+                      }
+                      if (!(lb[c[(b + 340) >> 2] & 127](b, e) | 0)) {
+                        c[g >> 2] = e;
+                        f = 0;
+                        break a;
+                      } else f = 2;
+                      break;
+                    }
+                    case 6: {
+                      if ((f | 0) < 3) {
+                        f = -2;
+                        break a;
+                      }
+                      if (!(lb[c[(b + 344) >> 2] & 127](b, e) | 0)) {
+                        c[g >> 2] = e;
+                        f = 0;
+                        break a;
+                      } else f = 3;
+                      break;
+                    }
+                    case 7: {
+                      if ((f | 0) < 4) {
+                        f = -2;
+                        break a;
+                      }
+                      if (!(lb[c[(b + 348) >> 2] & 127](b, e) | 0)) {
+                        c[g >> 2] = e;
+                        f = 0;
+                        break a;
+                      } else f = 4;
+                      break;
+                    }
+                    default: {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                  }
+                  i = (b + 328) | 0;
+                  j = (b + 332) | 0;
+                  k = (b + 336) | 0;
+                  f = (e + f) | 0;
+                  b: while (1) {
+                    h = (o - f) | 0;
+                    if ((h | 0) <= 0) {
+                      f = -1;
+                      break a;
+                    }
+                    switch (a[(n + (d[f >> 0] | 0)) >> 0] | 0) {
+                      case 29: {
+                        m = 17;
+                        break b;
+                      }
+                      case 10:
+                      case 9:
+                      case 21: {
+                        m = 28;
+                        break b;
+                      }
+                      case 15: {
+                        m = 50;
+                        break b;
+                      }
+                      case 27:
+                      case 26:
+                      case 25:
+                      case 24:
+                      case 22: {
+                        h = 1;
+                        break;
+                      }
+                      case 5: {
+                        if ((h | 0) < 2) {
+                          f = -2;
+                          break a;
+                        }
+                        if (!(lb[c[i >> 2] & 127](b, f) | 0)) {
+                          m = 20;
+                          break b;
+                        } else h = 2;
+                        break;
+                      }
+                      case 6: {
+                        if ((h | 0) < 3) {
+                          f = -2;
+                          break a;
+                        }
+                        if (!(lb[c[j >> 2] & 127](b, f) | 0)) {
+                          m = 23;
+                          break b;
+                        } else h = 3;
+                        break;
+                      }
+                      case 7: {
+                        if ((h | 0) < 4) {
+                          f = -2;
+                          break a;
+                        }
+                        if (!(lb[c[k >> 2] & 127](b, f) | 0)) {
+                          m = 26;
+                          break b;
+                        } else h = 4;
+                        break;
+                      }
+                      default:
+                        break b;
+                    }
+                    f = (f + h) | 0;
+                  }
+                  if ((m | 0) == 17) {
+                    c[g >> 2] = f;
+                    f = 0;
+                    break;
+                  } else if ((m | 0) == 20) {
+                    c[g >> 2] = f;
+                    f = 0;
+                    break;
+                  } else if ((m | 0) == 23) {
+                    c[g >> 2] = f;
+                    f = 0;
+                    break;
+                  } else if ((m | 0) == 26) {
+                    c[g >> 2] = f;
+                    f = 0;
+                    break;
+                  } else if ((m | 0) == 28) {
+                    if (!(e$(e, f, p) | 0)) {
+                      c[g >> 2] = f;
+                      f = 0;
+                      break;
+                    }
+                    i = (b + 352) | 0;
+                    j = (b + 356) | 0;
+                    k = (b + 360) | 0;
+                    h = (f + 1) | 0;
+                    c: while (1) {
+                      f = (o - h) | 0;
+                      if ((f | 0) <= 0) {
+                        f = -1;
+                        break a;
+                      }
+                      switch (a[(n + (d[h >> 0] | 0)) >> 0] | 0) {
+                        case 8:
+                        case 1:
+                        case 0: {
+                          m = 45;
+                          break c;
+                        }
+                        case 5: {
+                          if ((f | 0) < 2) {
+                            f = -2;
+                            break a;
+                          }
+                          if (lb[c[i >> 2] & 127](b, h) | 0) {
+                            m = 35;
+                            break c;
+                          }
+                          h = (h + 2) | 0;
+                          continue c;
+                        }
+                        case 6: {
+                          if ((f | 0) < 3) {
+                            f = -2;
+                            break a;
+                          }
+                          if (lb[c[j >> 2] & 127](b, h) | 0) {
+                            m = 39;
+                            break c;
+                          }
+                          h = (h + 3) | 0;
+                          continue c;
+                        }
+                        case 7: {
+                          if ((f | 0) < 4) {
+                            f = -2;
+                            break a;
+                          }
+                          if (lb[c[k >> 2] & 127](b, h) | 0) {
+                            m = 43;
+                            break c;
+                          }
+                          h = (h + 4) | 0;
+                          continue c;
+                        }
+                        case 15: {
+                          f = (h + 1) | 0;
+                          if (((o - f) | 0) <= 0) {
+                            f = -1;
+                            break a;
+                          }
+                          if ((a[f >> 0] | 0) == 62) {
+                            m = 48;
+                            break c;
+                          } else {
+                            h = f;
+                            continue c;
+                          }
+                        }
+                        default: {
+                          h = (h + 1) | 0;
+                          continue c;
+                        }
+                      }
+                    }
+                    if ((m | 0) == 35) {
+                      c[g >> 2] = h;
+                      f = 0;
+                      break;
+                    } else if ((m | 0) == 39) {
+                      c[g >> 2] = h;
+                      f = 0;
+                      break;
+                    } else if ((m | 0) == 43) {
+                      c[g >> 2] = h;
+                      f = 0;
+                      break;
+                    } else if ((m | 0) == 45) {
+                      c[g >> 2] = h;
+                      f = 0;
+                      break;
+                    } else if ((m | 0) == 48) {
+                      c[g >> 2] = h + 2;
+                      f = c[p >> 2] | 0;
+                      break;
+                    }
+                  } else if ((m | 0) == 50) {
+                    if (!(e$(e, f, p) | 0)) {
+                      c[g >> 2] = f;
+                      f = 0;
+                      break;
+                    }
+                    h = (f + 1) | 0;
+                    if (((o - h) | 0) <= 0) {
+                      f = -1;
+                      break;
+                    }
+                    if ((a[h >> 0] | 0) == 62) {
+                      c[g >> 2] = f + 2;
+                      f = c[p >> 2] | 0;
+                      break;
+                    } else f = h;
+                  }
+                  c[g >> 2] = f;
+                  f = 0;
+                } else f = -1;
+              while (0);
+              l = q;
+              return f | 0;
+            }
+            function c$(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              h = (f - e) | 0;
+              a: do
+                if ((h | 0) > 0) {
+                  l = (b + 72) | 0;
+                  switch (a[(l + (d[e >> 0] | 0)) >> 0] | 0) {
+                    case 29: {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    case 24:
+                    case 22: {
+                      h = 1;
+                      break;
+                    }
+                    case 5: {
+                      if ((h | 0) < 2) {
+                        f = -2;
+                        break a;
+                      }
+                      if (!(lb[c[(b + 340) >> 2] & 127](b, e) | 0)) {
+                        c[g >> 2] = e;
+                        f = 0;
+                        break a;
+                      } else h = 2;
+                      break;
+                    }
+                    case 6: {
+                      if ((h | 0) < 3) {
+                        f = -2;
+                        break a;
+                      }
+                      if (!(lb[c[(b + 344) >> 2] & 127](b, e) | 0)) {
+                        c[g >> 2] = e;
+                        f = 0;
+                        break a;
+                      } else h = 3;
+                      break;
+                    }
+                    case 7: {
+                      if ((h | 0) < 4) {
+                        f = -2;
+                        break a;
+                      }
+                      if (!(lb[c[(b + 348) >> 2] & 127](b, e) | 0)) {
+                        c[g >> 2] = e;
+                        f = 0;
+                        break a;
+                      } else h = 4;
+                      break;
+                    }
+                    default: {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                  }
+                  i = (b + 328) | 0;
+                  j = (b + 332) | 0;
+                  k = (b + 336) | 0;
+                  h = (e + h) | 0;
+                  b: while (1) {
+                    e = (f - h) | 0;
+                    if ((e | 0) <= 0) {
+                      f = -1;
+                      break a;
+                    }
+                    switch (a[(l + (d[h >> 0] | 0)) >> 0] | 0) {
+                      case 29: {
+                        i = 17;
+                        break b;
+                      }
+                      case 10:
+                      case 9:
+                      case 21: {
+                        i = 27;
+                        break b;
+                      }
+                      case 11: {
+                        i = 32;
+                        break b;
+                      }
+                      case 23:
+                      case 27:
+                      case 26:
+                      case 25:
+                      case 24:
+                      case 22: {
+                        e = 1;
+                        break;
+                      }
+                      case 5: {
+                        if ((e | 0) < 2) {
+                          f = -2;
+                          break a;
+                        }
+                        if (!(lb[c[i >> 2] & 127](b, h) | 0)) {
+                          i = 20;
+                          break b;
+                        } else e = 2;
+                        break;
+                      }
+                      case 6: {
+                        if ((e | 0) < 3) {
+                          f = -2;
+                          break a;
+                        }
+                        if (!(lb[c[j >> 2] & 127](b, h) | 0)) {
+                          i = 23;
+                          break b;
+                        } else e = 3;
+                        break;
+                      }
+                      case 7: {
+                        if ((e | 0) < 4) {
+                          f = -2;
+                          break a;
+                        }
+                        if (!(lb[c[k >> 2] & 127](b, h) | 0)) {
+                          i = 26;
+                          break b;
+                        } else e = 4;
+                        break;
+                      }
+                      default: {
+                        i = 33;
+                        break b;
+                      }
+                    }
+                    h = (h + e) | 0;
+                  }
+                  if ((i | 0) == 17) {
+                    c[g >> 2] = h;
+                    f = 0;
+                    break;
+                  } else if ((i | 0) == 20) {
+                    c[g >> 2] = h;
+                    f = 0;
+                    break;
+                  } else if ((i | 0) == 23) {
+                    c[g >> 2] = h;
+                    f = 0;
+                    break;
+                  } else if ((i | 0) == 26) {
+                    c[g >> 2] = h;
+                    f = 0;
+                    break;
+                  } else if ((i | 0) == 27) {
+                    c: while (1) {
+                      e = (h + 1) | 0;
+                      if (((f - e) | 0) <= 0) {
+                        f = -1;
+                        break a;
+                      }
+                      switch (a[(l + (d[e >> 0] | 0)) >> 0] | 0) {
+                        case 10:
+                        case 9:
+                        case 21: {
+                          h = e;
+                          i = 27;
+                          break;
+                        }
+                        case 11: {
+                          i = 29;
+                          break c;
+                        }
+                        default: {
+                          i = 30;
+                          break c;
+                        }
+                      }
+                    }
+                    if ((i | 0) == 29) {
+                      c[g >> 2] = h + 2;
+                      f = 5;
+                      break;
+                    } else if ((i | 0) == 30) {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break;
+                    }
+                  } else if ((i | 0) == 32) {
+                    c[g >> 2] = h + 1;
+                    f = 5;
+                    break;
+                  } else if ((i | 0) == 33) {
+                    c[g >> 2] = h;
+                    f = 0;
+                    break;
+                  }
+                } else f = -1;
+              while (0);
+              return f | 0;
+            }
+            function d$(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0;
+              y = l;
+              l = (l + 16) | 0;
+              v = y;
+              c[v >> 2] = e;
+              w = f;
+              r = (b + 72) | 0;
+              s = (b + 328) | 0;
+              t = (b + 332) | 0;
+              u = (b + 336) | 0;
+              k = (b + 340) | 0;
+              m = (b + 344) | 0;
+              n = (b + 348) | 0;
+              o = (b + 352) | 0;
+              p = (b + 356) | 0;
+              q = (b + 360) | 0;
+              i = 0;
+              a: while (1) {
+                h = (w - e) | 0;
+                if ((h | 0) <= 0) {
+                  e = -1;
+                  break;
+                }
+                b: do
+                  switch (a[(r + (d[e >> 0] | 0)) >> 0] | 0) {
+                    case 29: {
+                      x = 4;
+                      break a;
+                    }
+                    case 27:
+                    case 26:
+                    case 25:
+                    case 24:
+                    case 22: {
+                      h = (e + 1) | 0;
+                      c[v >> 2] = h;
+                      j = i;
+                      e = h;
+                      i = j;
+                      continue a;
+                    }
+                    case 5: {
+                      if ((h | 0) < 2) {
+                        e = -2;
+                        break a;
+                      }
+                      if (!(lb[c[s >> 2] & 127](b, e) | 0)) {
+                        x = 8;
+                        break a;
+                      }
+                      h = (e + 2) | 0;
+                      c[v >> 2] = h;
+                      j = i;
+                      e = h;
+                      i = j;
+                      continue a;
+                    }
+                    case 6: {
+                      if ((h | 0) < 3) {
+                        e = -2;
+                        break a;
+                      }
+                      if (!(lb[c[t >> 2] & 127](b, e) | 0)) {
+                        x = 12;
+                        break a;
+                      }
+                      h = (e + 3) | 0;
+                      c[v >> 2] = h;
+                      j = i;
+                      e = h;
+                      i = j;
+                      continue a;
+                    }
+                    case 7: {
+                      if ((h | 0) < 4) {
+                        e = -2;
+                        break a;
+                      }
+                      if (!(lb[c[u >> 2] & 127](b, e) | 0)) {
+                        x = 16;
+                        break a;
+                      }
+                      h = (e + 4) | 0;
+                      c[v >> 2] = h;
+                      j = i;
+                      e = h;
+                      i = j;
+                      continue a;
+                    }
+                    case 23: {
+                      if (i | 0) {
+                        x = 19;
+                        break a;
+                      }
+                      h = (e + 1) | 0;
+                      c[v >> 2] = h;
+                      i = (w - h) | 0;
+                      if ((i | 0) <= 0) {
+                        e = -1;
+                        break a;
+                      }
+                      switch (a[(r + (d[h >> 0] | 0)) >> 0] | 0) {
+                        case 29: {
+                          x = 22;
+                          break a;
+                        }
+                        case 24:
+                        case 22: {
+                          j = (e + 2) | 0;
+                          c[v >> 2] = j;
+                          i = 1;
+                          e = j;
+                          continue a;
+                        }
+                        case 5: {
+                          if ((i | 0) < 2) {
+                            e = -2;
+                            break a;
+                          }
+                          if (!(lb[c[k >> 2] & 127](b, h) | 0)) {
+                            x = 26;
+                            break a;
+                          }
+                          j = (e + 3) | 0;
+                          c[v >> 2] = j;
+                          i = 1;
+                          e = j;
+                          continue a;
+                        }
+                        case 6: {
+                          if ((i | 0) < 3) {
+                            e = -2;
+                            break a;
+                          }
+                          if (!(lb[c[m >> 2] & 127](b, h) | 0)) {
+                            x = 30;
+                            break a;
+                          }
+                          j = (e + 4) | 0;
+                          c[v >> 2] = j;
+                          i = 1;
+                          e = j;
+                          continue a;
+                        }
+                        case 7: {
+                          if ((i | 0) < 4) {
+                            e = -2;
+                            break a;
+                          }
+                          if (!(lb[c[n >> 2] & 127](b, h) | 0)) {
+                            x = 34;
+                            break a;
+                          }
+                          j = (e + 5) | 0;
+                          c[v >> 2] = j;
+                          i = 1;
+                          e = j;
+                          continue a;
+                        }
+                        default: {
+                          x = 36;
+                          break a;
+                        }
+                      }
+                    }
+                    case 10:
+                    case 9:
+                    case 21:
+                      while (1) {
+                        e = (e + 1) | 0;
+                        c[v >> 2] = e;
+                        if (((w - e) | 0) <= 0) {
+                          e = -1;
+                          break a;
+                        }
+                        switch (a[(r + (d[e >> 0] | 0)) >> 0] | 0) {
+                          case 14:
+                            break b;
+                          case 9:
+                          case 10:
+                          case 21:
+                            break;
+                          default: {
+                            x = 39;
+                            break a;
+                          }
+                        }
+                      }
+                    case 14:
+                      break;
+                    default: {
+                      x = 92;
+                      break a;
+                    }
+                  }
+                while (0);
+                while (1) {
+                  h = (e + 1) | 0;
+                  c[v >> 2] = h;
+                  if (((w - h) | 0) <= 0) {
+                    e = -1;
+                    break a;
+                  }
+                  j = a[(r + (d[h >> 0] | 0)) >> 0] | 0;
+                  if (((j | 1) << 24) >> 24 == 13) break;
+                  switch ((j << 24) >> 24) {
+                    case 9:
+                    case 10:
+                    case 21: {
+                      e = h;
+                      break;
+                    }
+                    default: {
+                      x = 43;
+                      break a;
+                    }
+                  }
+                }
+                e = (e + 2) | 0;
+                c[v >> 2] = e;
+                c: while (1) {
+                  h = (w - e) | 0;
+                  if ((h | 0) <= 0) {
+                    e = -1;
+                    break a;
+                  }
+                  i = a[(r + (d[e >> 0] | 0)) >> 0] | 0;
+                  if ((i << 24) >> 24 == (j << 24) >> 24) break;
+                  switch ((i << 24) >> 24) {
+                    case 8:
+                    case 1:
+                    case 0: {
+                      x = 60;
+                      break a;
+                    }
+                    case 2: {
+                      x = 65;
+                      break a;
+                    }
+                    case 5: {
+                      if ((h | 0) < 2) {
+                        e = -2;
+                        break a;
+                      }
+                      if (lb[c[o >> 2] & 127](b, e) | 0) {
+                        x = 50;
+                        break a;
+                      }
+                      i = (e + 2) | 0;
+                      c[v >> 2] = i;
+                      e = i;
+                      continue c;
+                    }
+                    case 6: {
+                      if ((h | 0) < 3) {
+                        e = -2;
+                        break a;
+                      }
+                      if (lb[c[p >> 2] & 127](b, e) | 0) {
+                        x = 54;
+                        break a;
+                      }
+                      i = (e + 3) | 0;
+                      c[v >> 2] = i;
+                      e = i;
+                      continue c;
+                    }
+                    case 7: {
+                      if ((h | 0) < 4) {
+                        e = -2;
+                        break a;
+                      }
+                      if (lb[c[q >> 2] & 127](b, e) | 0) {
+                        x = 58;
+                        break a;
+                      }
+                      i = (e + 4) | 0;
+                      c[v >> 2] = i;
+                      e = i;
+                      continue c;
+                    }
+                    case 3: {
+                      e = W_(b, (e + 1) | 0, f, v) | 0;
+                      if ((e | 0) < 1) {
+                        x = 63;
+                        break a;
+                      }
+                      e = c[v >> 2] | 0;
+                      continue c;
+                    }
+                    default: {
+                      i = (e + 1) | 0;
+                      c[v >> 2] = i;
+                      e = i;
+                      continue c;
+                    }
+                  }
+                }
+                h = (e + 1) | 0;
+                c[v >> 2] = h;
+                if (((w - h) | 0) <= 0) {
+                  e = -1;
+                  break;
+                }
+                switch (a[(r + (d[h >> 0] | 0)) >> 0] | 0) {
+                  case 11: {
+                    x = 86;
+                    break a;
+                  }
+                  case 17: {
+                    x = 87;
+                    break a;
+                  }
+                  case 10:
+                  case 9:
+                  case 21: {
+                    e = h;
+                    break;
+                  }
+                  default: {
+                    x = 69;
+                    break a;
+                  }
+                }
+                d: while (1) {
+                  h = (e + 1) | 0;
+                  c[v >> 2] = h;
+                  i = (w - h) | 0;
+                  if ((i | 0) <= 0) {
+                    e = -1;
+                    break a;
+                  }
+                  switch (a[(r + (d[h >> 0] | 0)) >> 0] | 0) {
+                    case 29: {
+                      x = 72;
+                      break a;
+                    }
+                    case 11: {
+                      x = 86;
+                      break a;
+                    }
+                    case 17: {
+                      x = 87;
+                      break a;
+                    }
+                    case 10:
+                    case 9:
+                    case 21: {
+                      e = h;
+                      break;
+                    }
+                    case 24:
+                    case 22: {
+                      x = 73;
+                      break d;
+                    }
+                    case 5: {
+                      x = 74;
+                      break d;
+                    }
+                    case 6: {
+                      x = 78;
+                      break d;
+                    }
+                    case 7: {
+                      x = 82;
+                      break d;
+                    }
+                    default: {
+                      x = 91;
+                      break a;
+                    }
+                  }
+                }
+                if ((x | 0) == 73) {
+                  x = 0;
+                  e = (e + 2) | 0;
+                  c[v >> 2] = e;
+                  i = 0;
+                  continue;
+                } else if ((x | 0) == 74) {
+                  x = 0;
+                  if ((i | 0) < 2) {
+                    e = -2;
+                    break;
+                  }
+                  if (!(lb[c[k >> 2] & 127](b, h) | 0)) {
+                    x = 76;
+                    break;
+                  }
+                  e = (e + 3) | 0;
+                  c[v >> 2] = e;
+                  i = 0;
+                  continue;
+                } else if ((x | 0) == 78) {
+                  x = 0;
+                  if ((i | 0) < 3) {
+                    e = -2;
+                    break;
+                  }
+                  if (!(lb[c[m >> 2] & 127](b, h) | 0)) {
+                    x = 80;
+                    break;
+                  }
+                  e = (e + 4) | 0;
+                  c[v >> 2] = e;
+                  i = 0;
+                  continue;
+                } else if ((x | 0) == 82) {
+                  x = 0;
+                  if ((i | 0) < 4) {
+                    e = -2;
+                    break;
+                  }
+                  if (!(lb[c[n >> 2] & 127](b, h) | 0)) {
+                    x = 84;
+                    break;
+                  }
+                  e = (e + 5) | 0;
+                  c[v >> 2] = e;
+                  i = 0;
+                  continue;
+                }
+              }
+              switch (x | 0) {
+                case 4: {
+                  c[g >> 2] = e;
+                  e = 0;
+                  break;
+                }
+                case 8: {
+                  c[g >> 2] = e;
+                  e = 0;
+                  break;
+                }
+                case 12: {
+                  c[g >> 2] = e;
+                  e = 0;
+                  break;
+                }
+                case 16: {
+                  c[g >> 2] = e;
+                  e = 0;
+                  break;
+                }
+                case 19: {
+                  c[g >> 2] = e;
+                  e = 0;
+                  break;
+                }
+                case 22: {
+                  c[g >> 2] = h;
+                  e = 0;
+                  break;
+                }
+                case 26: {
+                  c[g >> 2] = h;
+                  e = 0;
+                  break;
+                }
+                case 30: {
+                  c[g >> 2] = h;
+                  e = 0;
+                  break;
+                }
+                case 34: {
+                  c[g >> 2] = h;
+                  e = 0;
+                  break;
+                }
+                case 36: {
+                  c[g >> 2] = h;
+                  e = 0;
+                  break;
+                }
+                case 39: {
+                  c[g >> 2] = e;
+                  e = 0;
+                  break;
+                }
+                case 43: {
+                  c[g >> 2] = h;
+                  e = 0;
+                  break;
+                }
+                case 50: {
+                  c[g >> 2] = e;
+                  e = 0;
+                  break;
+                }
+                case 54: {
+                  c[g >> 2] = e;
+                  e = 0;
+                  break;
+                }
+                case 58: {
+                  c[g >> 2] = e;
+                  e = 0;
+                  break;
+                }
+                case 60: {
+                  c[g >> 2] = e;
+                  e = 0;
+                  break;
+                }
+                case 63: {
+                  if (!e) {
+                    c[g >> 2] = c[v >> 2];
+                    e = 0;
+                  }
+                  break;
+                }
+                case 65: {
+                  c[g >> 2] = e;
+                  e = 0;
+                  break;
+                }
+                case 69: {
+                  c[g >> 2] = h;
+                  e = 0;
+                  break;
+                }
+                case 72: {
+                  c[g >> 2] = h;
+                  e = 0;
+                  break;
+                }
+                case 76: {
+                  c[g >> 2] = h;
+                  e = 0;
+                  break;
+                }
+                case 80: {
+                  c[g >> 2] = h;
+                  e = 0;
+                  break;
+                }
+                case 84: {
+                  c[g >> 2] = h;
+                  e = 0;
+                  break;
+                }
+                case 86: {
+                  c[g >> 2] = e + 2;
+                  e = 1;
+                  break;
+                }
+                case 87: {
+                  e = (h + 1) | 0;
+                  c[v >> 2] = e;
+                  if (((w - e) | 0) > 0)
+                    if ((a[e >> 0] | 0) == 62) {
+                      c[g >> 2] = h + 2;
+                      e = 3;
+                      break;
+                    } else {
+                      c[g >> 2] = e;
+                      e = 0;
+                      break;
+                    }
+                  else e = -1;
+                  break;
+                }
+                case 91: {
+                  c[g >> 2] = h;
+                  e = 0;
+                  break;
+                }
+                case 92: {
+                  c[g >> 2] = e;
+                  e = 0;
+                  break;
+                }
+              }
+              l = y;
+              return e | 0;
+            }
+            function e$(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              c[e >> 2] = 11;
+              a: do
+                if (((d - b) | 0) == 3) {
+                  switch (a[b >> 0] | 0) {
+                    case 120: {
+                      d = 0;
+                      break;
+                    }
+                    case 88: {
+                      d = 1;
+                      break;
+                    }
+                    default: {
+                      d = 1;
+                      break a;
+                    }
+                  }
+                  switch (a[(b + 1) >> 0] | 0) {
+                    case 109:
+                      break;
+                    case 77: {
+                      d = 1;
+                      break;
+                    }
+                    default: {
+                      d = 1;
+                      break a;
+                    }
+                  }
+                  switch (a[(b + 2) >> 0] | 0) {
+                    case 108:
+                      break;
+                    case 76: {
+                      d = 0;
+                      break a;
+                    }
+                    default: {
+                      d = 1;
+                      break a;
+                    }
+                  }
+                  if (!d) {
+                    c[e >> 2] = 12;
+                    d = 1;
+                  } else d = 0;
+                } else d = 1;
+              while (0);
+              return d | 0;
+            }
+            function f$(b, e, f, g, h) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              k = (e + 72) | 0;
+              l = (e + 352) | 0;
+              m = (e + 356) | 0;
+              n = (e + 360) | 0;
+              a: while (1) {
+                i = (g - f) | 0;
+                if ((i | 0) <= 0) {
+                  g = -1;
+                  break;
+                }
+                j = a[(k + (d[f >> 0] | 0)) >> 0] | 0;
+                switch ((j << 24) >> 24) {
+                  case 8:
+                  case 1:
+                  case 0: {
+                    o = 16;
+                    break a;
+                  }
+                  case 5: {
+                    if ((i | 0) < 2) {
+                      g = -2;
+                      break a;
+                    }
+                    if (lb[c[l >> 2] & 127](e, f) | 0) {
+                      o = 6;
+                      break a;
+                    }
+                    f = (f + 2) | 0;
+                    continue a;
+                  }
+                  case 6: {
+                    if ((i | 0) < 3) {
+                      g = -2;
+                      break a;
+                    }
+                    if (lb[c[m >> 2] & 127](e, f) | 0) {
+                      o = 10;
+                      break a;
+                    }
+                    f = (f + 3) | 0;
+                    continue a;
+                  }
+                  case 7: {
+                    if ((i | 0) < 4) {
+                      g = -2;
+                      break a;
+                    }
+                    if (lb[c[n >> 2] & 127](e, f) | 0) {
+                      o = 14;
+                      break a;
+                    }
+                    f = (f + 4) | 0;
+                    continue a;
+                  }
+                  case 13:
+                  case 12: {
+                    f = (f + 1) | 0;
+                    if (((j & 255) | 0) == (b | 0)) {
+                      o = 18;
+                      break a;
+                    } else continue a;
+                  }
+                  default: {
+                    f = (f + 1) | 0;
+                    continue a;
+                  }
+                }
+              }
+              b: do
+                if ((o | 0) == 6) {
+                  c[h >> 2] = f;
+                  g = 0;
+                } else if ((o | 0) == 10) {
+                  c[h >> 2] = f;
+                  g = 0;
+                } else if ((o | 0) == 14) {
+                  c[h >> 2] = f;
+                  g = 0;
+                } else if ((o | 0) == 16) {
+                  c[h >> 2] = f;
+                  g = 0;
+                } else if ((o | 0) == 18)
+                  if (((g - f) | 0) > 0) {
+                    c[h >> 2] = f;
+                    switch (a[(k + (d[f >> 0] | 0)) >> 0] | 0) {
+                      case 20:
+                      case 30:
+                      case 11:
+                      case 10:
+                      case 9:
+                      case 21: {
+                        g = 27;
+                        break b;
+                      }
+                      default: {
+                      }
+                    }
+                    g = 0;
+                  } else g = -27;
+              while (0);
+              return g | 0;
+            }
+            function g$(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0;
+              h = f;
+              a: do
+                if (((h - e) | 0) > 0) {
+                  i = (b + 72) | 0;
+                  switch (a[(i + (d[e >> 0] | 0)) >> 0] | 0) {
+                    case 27: {
+                      b = $_(b, (e + 1) | 0, f, g) | 0;
+                      break a;
+                    }
+                    case 20: {
+                      c[g >> 2] = e + 1;
+                      b = 33;
+                      break a;
+                    }
+                    case 24:
+                    case 22: {
+                      b: while (1) {
+                        b = (e + 1) | 0;
+                        f = (h - b) | 0;
+                        if ((f | 0) <= 0) {
+                          b = -1;
+                          break a;
+                        }
+                        switch (a[(i + (d[b >> 0] | 0)) >> 0] | 0) {
+                          case 24:
+                          case 22: {
+                            e = b;
+                            break;
+                          }
+                          case 30: {
+                            j = 8;
+                            break b;
+                          }
+                          case 10:
+                          case 9:
+                          case 21:
+                            break b;
+                          default: {
+                            j = 12;
+                            break b;
+                          }
+                        }
+                      }
+                      if ((j | 0) == 12) {
+                        c[g >> 2] = b;
+                        b = 0;
+                        break a;
+                      }
+                      c: do
+                        if ((j | 0) == 8) {
+                          if ((f | 0) <= 1) {
+                            b = -1;
+                            break a;
+                          }
+                          switch (a[(i + (d[(e + 2) >> 0] | 0)) >> 0] | 0) {
+                            case 30:
+                            case 10:
+                            case 9:
+                            case 21:
+                              break;
+                            default:
+                              break c;
+                          }
+                          c[g >> 2] = b;
+                          b = 0;
+                          break a;
+                        }
+                      while (0);
+                      c[g >> 2] = b;
+                      b = 16;
+                      break a;
+                    }
+                    default: {
+                      c[g >> 2] = e;
+                      b = 0;
+                      break a;
+                    }
+                  }
+                } else b = -1;
+              while (0);
+              return b | 0;
+            }
+            function h$(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              h = (f - e) | 0;
+              a: do
+                if ((h | 0) > 0) {
+                  l = (b + 72) | 0;
+                  switch (a[(l + (d[e >> 0] | 0)) >> 0] | 0) {
+                    case 29: {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    case 24:
+                    case 22: {
+                      h = 1;
+                      break;
+                    }
+                    case 5: {
+                      if ((h | 0) < 2) {
+                        f = -2;
+                        break a;
+                      }
+                      if (!(lb[c[(b + 340) >> 2] & 127](b, e) | 0)) {
+                        c[g >> 2] = e;
+                        f = 0;
+                        break a;
+                      } else h = 2;
+                      break;
+                    }
+                    case 6: {
+                      if ((h | 0) < 3) {
+                        f = -2;
+                        break a;
+                      }
+                      if (!(lb[c[(b + 344) >> 2] & 127](b, e) | 0)) {
+                        c[g >> 2] = e;
+                        f = 0;
+                        break a;
+                      } else h = 3;
+                      break;
+                    }
+                    case 7: {
+                      if ((h | 0) < 4) {
+                        f = -2;
+                        break a;
+                      }
+                      if (!(lb[c[(b + 348) >> 2] & 127](b, e) | 0)) {
+                        c[g >> 2] = e;
+                        f = 0;
+                        break a;
+                      } else h = 4;
+                      break;
+                    }
+                    default: {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                  }
+                  i = (b + 328) | 0;
+                  j = (b + 332) | 0;
+                  k = (b + 336) | 0;
+                  e = (e + h) | 0;
+                  b: while (1) {
+                    h = (f - e) | 0;
+                    if ((h | 0) <= 0) {
+                      f = -20;
+                      break a;
+                    }
+                    switch (a[(l + (d[e >> 0] | 0)) >> 0] | 0) {
+                      case 29: {
+                        h = 17;
+                        break b;
+                      }
+                      case 36:
+                      case 30:
+                      case 11:
+                      case 32:
+                      case 21:
+                      case 10:
+                      case 9: {
+                        h = 28;
+                        break b;
+                      }
+                      case 27:
+                      case 26:
+                      case 25:
+                      case 24:
+                      case 22: {
+                        h = 1;
+                        break;
+                      }
+                      case 5: {
+                        if ((h | 0) < 2) {
+                          f = -2;
+                          break a;
+                        }
+                        if (!(lb[c[i >> 2] & 127](b, e) | 0)) {
+                          h = 20;
+                          break b;
+                        } else h = 2;
+                        break;
+                      }
+                      case 6: {
+                        if ((h | 0) < 3) {
+                          f = -2;
+                          break a;
+                        }
+                        if (!(lb[c[j >> 2] & 127](b, e) | 0)) {
+                          h = 23;
+                          break b;
+                        } else h = 3;
+                        break;
+                      }
+                      case 7: {
+                        if ((h | 0) < 4) {
+                          f = -2;
+                          break a;
+                        }
+                        if (!(lb[c[k >> 2] & 127](b, e) | 0)) {
+                          h = 26;
+                          break b;
+                        } else h = 4;
+                        break;
+                      }
+                      default: {
+                        h = 29;
+                        break b;
+                      }
+                    }
+                    e = (e + h) | 0;
+                  }
+                  if ((h | 0) == 17) {
+                    c[g >> 2] = e;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 20) {
+                    c[g >> 2] = e;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 23) {
+                    c[g >> 2] = e;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 26) {
+                    c[g >> 2] = e;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 28) {
+                    c[g >> 2] = e;
+                    f = 20;
+                    break;
+                  } else if ((h | 0) == 29) {
+                    c[g >> 2] = e;
+                    f = 0;
+                    break;
+                  }
+                } else f = -1;
+              while (0);
+              return f | 0;
+            }
+            function i$() {
+              return 58220;
+            }
+            function j$(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 16) | 0;
+              g = i;
+              c[g >> 2] = d;
+              h = c[b >> 2] | 0;
+              a = (f - (c[e >> 2] | 0)) | 0;
+              if (((d - h) | 0) > (a | 0)) {
+                a = (h + a) | 0;
+                c[g >> 2] = a;
+                f = 1;
+              } else {
+                f = 0;
+                a = d;
+              }
+              w_(h, g);
+              h = c[g >> 2] | 0;
+              d = c[b >> 2] | 0;
+              g = (h - d) | 0;
+              W6(c[e >> 2] | 0, d | 0, g | 0) | 0;
+              c[b >> 2] = (c[b >> 2] | 0) + g;
+              c[e >> 2] = (c[e >> 2] | 0) + g;
+              l = i;
+              return (f ? 2 : (h >>> 0 < a >>> 0) & 1) | 0;
+            }
+            function k$(d, e, f, g, h) {
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              j = (d + 72) | 0;
+              k = f;
+              l = h;
+              m = c[e >> 2] | 0;
+              n = c[g >> 2] | 0;
+              a: while (1) {
+                d = m >>> 0 < f >>> 0;
+                if (!((n >>> 0 < h >>> 0) & d)) {
+                  o = 12;
+                  break;
+                }
+                d = a[m >> 0] | 0;
+                i = d & 255;
+                switch (a[(j + i) >> 0] | 0) {
+                  case 5: {
+                    if (((k - m) | 0) < 2) {
+                      d = 1;
+                      break a;
+                    }
+                    b[n >> 1] = ((d & 31) << 6) | (a[(m + 1) >> 0] & 63);
+                    m = (m + 2) | 0;
+                    n = (n + 2) | 0;
+                    continue a;
+                  }
+                  case 6: {
+                    if (((k - m) | 0) < 3) {
+                      d = 1;
+                      break a;
+                    }
+                    b[n >> 1] = ((a[(m + 1) >> 0] & 63) << 6) | (i << 12) | (a[(m + 2) >> 0] & 63);
+                    m = (m + 3) | 0;
+                    n = (n + 2) | 0;
+                    continue a;
+                  }
+                  case 7: {
+                    if (((l - n) | 0) < 4) {
+                      d = 2;
+                      break a;
+                    }
+                    if (((k - m) | 0) < 4) {
+                      d = 1;
+                      break a;
+                    }
+                    i =
+                      ((((a[(m + 1) >> 0] & 63) << 12) |
+                        ((d & 7) << 18) |
+                        ((a[(m + 2) >> 0] & 63) << 6) |
+                        (a[(m + 3) >> 0] & 63)) +
+                        -65536) |
+                      0;
+                    b[n >> 1] = (i >>> 10) | 55296;
+                    b[(n + 2) >> 1] = (i & 1023) | 56320;
+                    m = (m + 4) | 0;
+                    n = (n + 4) | 0;
+                    continue a;
+                  }
+                  default: {
+                    b[n >> 1] = (d << 24) >> 24;
+                    m = (m + 1) | 0;
+                    n = (n + 2) | 0;
+                    continue a;
+                  }
+                }
+              }
+              if ((o | 0) == 12) d = d ? 2 : 0;
+              c[e >> 2] = m;
+              c[g >> 2] = n;
+              return d | 0;
+            }
+            function l$(a, b) {
+              a = a | 0;
+              b = b | 0;
+              a = d[b >> 0] | 0;
+              b = d[(b + 1) >> 0] | 0;
+              return (
+                ((1 << (b & 31)) &
+                  c[
+                    (56940 +
+                      ((((d[(144044 + ((a >>> 2) & 7)) >> 0] | 0) << 3) | ((a << 1) & 6) | ((b >>> 5) & 1)) << 2)) >>
+                      2
+                  ]) |
+                0
+              );
+            }
+            function m$(b, e) {
+              b = b | 0;
+              e = e | 0;
+              var f = 0;
+              f = d[(e + 1) >> 0] | 0;
+              b = d[(e + 2) >> 0] | 0;
+              return (
+                ((1 << (b & 31)) &
+                  c[
+                    (56940 +
+                      ((((d[(144044 + (((f >>> 2) & 15) | ((a[e >> 0] << 4) & 255))) >> 0] | 0) << 3) |
+                        ((f << 1) & 6) |
+                        ((b >>> 5) & 1)) <<
+                        2)) >>
+                      2
+                  ]) |
+                0
+              );
+            }
+            function n$(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return 0;
+            }
+            function o$(a, b) {
+              a = a | 0;
+              b = b | 0;
+              a = d[b >> 0] | 0;
+              b = d[(b + 1) >> 0] | 0;
+              return (
+                ((1 << (b & 31)) &
+                  c[
+                    (56940 +
+                      ((((d[(143788 + ((a >>> 2) & 7)) >> 0] | 0) << 3) | ((a << 1) & 6) | ((b >>> 5) & 1)) << 2)) >>
+                      2
+                  ]) |
+                0
+              );
+            }
+            function p$(b, e) {
+              b = b | 0;
+              e = e | 0;
+              var f = 0;
+              f = d[(e + 1) >> 0] | 0;
+              b = d[(e + 2) >> 0] | 0;
+              return (
+                ((1 << (b & 31)) &
+                  c[
+                    (56940 +
+                      ((((d[(143788 + (((f >>> 2) & 15) | ((a[e >> 0] << 4) & 255))) >> 0] | 0) << 3) |
+                        ((f << 1) & 6) |
+                        ((b >>> 5) & 1)) <<
+                        2)) >>
+                      2
+                  ]) |
+                0
+              );
+            }
+            function q$(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if ((d[b >> 0] | 0) < 194) return 1;
+              else {
+                b = d[(b + 1) >> 0] | 0;
+                return ((b >>> 7) ^ 1) | (((b & 192) | 0) == 192) | 0;
+              }
+              return 0;
+            }
+            function r$(b, c) {
+              b = b | 0;
+              c = c | 0;
+              var d = 0;
+              b = a[(c + 2) >> 0] | 0;
+              do
+                if ((b << 24) >> 24 > -1) b = 1;
+                else {
+                  d = a[c >> 0] | 0;
+                  if ((d << 24) >> 24 == -17 ? (a[(c + 1) >> 0] | 0) == -65 : 0)
+                    if ((b & 255) > 189) {
+                      b = 1;
+                      break;
+                    } else {
+                      b = 191;
+                      c = -65;
+                    }
+                  else {
+                    if ((b & 255) > 191) {
+                      b = 1;
+                      break;
+                    }
+                    c = a[(c + 1) >> 0] | 0;
+                    b = c & 255;
+                    if ((d << 24) >> 24 == -32) {
+                      b = ((c & 255) < 160) | (((b & 192) | 0) == 192);
+                      break;
+                    }
+                  }
+                  b = ((b & 128) | 0) == 0 ? 1 : (d << 24) >> 24 == -19 ? (c & 255) > 159 : ((b & 192) | 0) == 192;
+                }
+              while (0);
+              return (b & 1) | 0;
+            }
+            function s$(b, c) {
+              b = b | 0;
+              c = c | 0;
+              var e = 0;
+              e = d[(c + 3) >> 0] | 0;
+              do
+                if (
+                  !((((e & 128) | 0) == 0) | (((e & 192) | 0) == 192))
+                    ? ((e = d[(c + 2) >> 0] | 0), !((((e & 128) | 0) == 0) | (((e & 192) | 0) == 192)))
+                    : 0
+                ) {
+                  e = a[c >> 0] | 0;
+                  b = a[(c + 1) >> 0] | 0;
+                  c = b & 255;
+                  if ((e << 24) >> 24 == -16) {
+                    b = ((b & 255) < 144) | (((c & 192) | 0) == 192);
+                    break;
+                  } else {
+                    b = ((c & 128) | 0) == 0 ? 1 : (e << 24) >> 24 == -12 ? (b & 255) > 143 : ((c & 192) | 0) == 192;
+                    break;
+                  }
+                } else b = 1;
+              while (0);
+              return (b & 1) | 0;
+            }
+            function t$(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              a: do
+                if (e >>> 0 < f >>> 0) {
+                  i = e;
+                  m = (f - i) | 0;
+                  k = ((m & 1) | 0) == 0;
+                  m = m & -2;
+                  l = (m | 0) == 0;
+                  m = k | l ? f : (e + m) | 0;
+                  if (k | (l ^ 1)) {
+                    f = a[(e + 1) >> 0] | 0;
+                    if (!((f << 24) >> 24)) {
+                      h = a[e >> 0] | 0;
+                      j = h;
+                      h = d[(b + 72 + (h & 255)) >> 0] | 0;
+                    } else {
+                      h = a[e >> 0] | 0;
+                      j = h;
+                      h = J$(f, h) | 0;
+                    }
+                    do
+                      switch (h | 0) {
+                        case 12: {
+                          f = V$(12, b, (e + 2) | 0, m, g) | 0;
+                          break a;
+                        }
+                        case 13: {
+                          f = V$(13, b, (e + 2) | 0, m, g) | 0;
+                          break a;
+                        }
+                        case 2: {
+                          h = (e + 2) | 0;
+                          if (((m - h) | 0) <= 1) {
+                            f = -1;
+                            break a;
+                          }
+                          f = a[(e + 3) >> 0] | 0;
+                          if (!((f << 24) >> 24)) f = d[(b + 72 + (d[h >> 0] | 0)) >> 0] | 0;
+                          else f = J$(f, a[h >> 0] | 0) | 0;
+                          switch (f | 0) {
+                            case 16: {
+                              f = W$(b, (e + 4) | 0, m, g) | 0;
+                              break a;
+                            }
+                            case 15: {
+                              f = R$(b, (e + 4) | 0, m, g) | 0;
+                              break a;
+                            }
+                            case 7:
+                            case 6:
+                            case 5:
+                            case 29:
+                            case 24:
+                            case 22: {
+                              c[g >> 2] = e;
+                              f = 29;
+                              break a;
+                            }
+                            default: {
+                              c[g >> 2] = h;
+                              f = 0;
+                              break a;
+                            }
+                          }
+                        }
+                        case 9: {
+                          if (((e + 2) | 0) == (m | 0)) {
+                            c[g >> 2] = m;
+                            f = -15;
+                            break a;
+                          } else i = 7;
+                          break;
+                        }
+                        case 10:
+                        case 21: {
+                          i = 7;
+                          break;
+                        }
+                        case 30: {
+                          f = L$(b, (e + 2) | 0, m, g) | 0;
+                          break a;
+                        }
+                        case 35: {
+                          c[g >> 2] = e + 2;
+                          f = 38;
+                          break a;
+                        }
+                        case 20: {
+                          c[g >> 2] = e + 2;
+                          f = 25;
+                          break a;
+                        }
+                        case 4: {
+                          h = (e + 2) | 0;
+                          f = (m - h) | 0;
+                          if ((f | 0) <= 1) {
+                            f = -26;
+                            break a;
+                          }
+                          if ((a[(e + 3) >> 0] | 0) == 0 ? (a[h >> 0] | 0) == 93 : 0) {
+                            if ((f | 0) <= 3) {
+                              f = -1;
+                              break a;
+                            }
+                            if ((a[(e + 5) >> 0] | 0) == 0 ? (a[(e + 4) >> 0] | 0) == 62 : 0) {
+                              c[g >> 2] = e + 6;
+                              f = 34;
+                              break a;
+                            }
+                          }
+                          c[g >> 2] = h;
+                          f = 26;
+                          break a;
+                        }
+                        case 31: {
+                          c[g >> 2] = e + 2;
+                          f = 23;
+                          break a;
+                        }
+                        case 32: {
+                          h = (e + 2) | 0;
+                          if (((m - h) | 0) <= 1) {
+                            f = -24;
+                            break a;
+                          }
+                          f = a[(e + 3) >> 0] | 0;
+                          if (!((f << 24) >> 24)) f = d[(b + 72 + (d[h >> 0] | 0)) >> 0] | 0;
+                          else f = J$(f, a[h >> 0] | 0) | 0;
+                          switch (f | 0) {
+                            case 33: {
+                              c[g >> 2] = e + 4;
+                              f = 36;
+                              break a;
+                            }
+                            case 15: {
+                              c[g >> 2] = e + 4;
+                              f = 35;
+                              break a;
+                            }
+                            case 34: {
+                              c[g >> 2] = e + 4;
+                              f = 37;
+                              break a;
+                            }
+                            case 32:
+                            case 36:
+                            case 35:
+                            case 11:
+                            case 21:
+                            case 10:
+                            case 9: {
+                              c[g >> 2] = h;
+                              f = 24;
+                              break a;
+                            }
+                            default: {
+                              c[g >> 2] = h;
+                              f = 0;
+                              break a;
+                            }
+                          }
+                        }
+                        case 36: {
+                          c[g >> 2] = e + 2;
+                          f = 21;
+                          break a;
+                        }
+                        case 11: {
+                          c[g >> 2] = e + 2;
+                          f = 17;
+                          break a;
+                        }
+                        case 19: {
+                          f = X$(b, (e + 2) | 0, m, g) | 0;
+                          break a;
+                        }
+                        case 5: {
+                          if (((m - i) | 0) < 2) {
+                            f = -2;
+                            break a;
+                          }
+                          c[g >> 2] = e;
+                          f = 0;
+                          break a;
+                        }
+                        case 6: {
+                          if (((m - i) | 0) < 3) {
+                            f = -2;
+                            break a;
+                          }
+                          c[g >> 2] = e;
+                          f = 0;
+                          break a;
+                        }
+                        case 7: {
+                          if (((m - i) | 0) < 4) {
+                            f = -2;
+                            break a;
+                          }
+                          c[g >> 2] = e;
+                          f = 0;
+                          break a;
+                        }
+                        case 24:
+                        case 22: {
+                          f = 18;
+                          i = 61;
+                          break;
+                        }
+                        case 23:
+                        case 27:
+                        case 26:
+                        case 25: {
+                          f = 19;
+                          i = 61;
+                          break;
+                        }
+                        case 29: {
+                          i = f & 255;
+                          h = j & 255;
+                          f = h >>> 5;
+                          h = 1 << (h & 31);
+                          if (!(h & c[(56940 + ((f | (d[(143788 + i) >> 0] << 3)) << 2)) >> 2]))
+                            if (!(c[(56940 + (((d[(144044 + i) >> 0] << 3) | f) << 2)) >> 2] & h)) i = 64;
+                            else {
+                              f = 19;
+                              i = 61;
+                            }
+                          else {
+                            f = 18;
+                            i = 61;
+                          }
+                          break;
+                        }
+                        default:
+                          i = 64;
+                      }
+                    while (0);
+                    if ((i | 0) == 7) {
+                      k = m;
+                      b = (b + 72) | 0;
+                      j = e;
+                      b: while (1) {
+                        i = j;
+                        j = (j + 2) | 0;
+                        if (((k - j) | 0) <= 1) {
+                          i = 28;
+                          break;
+                        }
+                        f = a[(i + 3) >> 0] | 0;
+                        h = a[j >> 0] | 0;
+                        if (!((f << 24) >> 24)) f = d[(b + (h & 255)) >> 0] | 0;
+                        else f = J$(f, h) | 0;
+                        switch (f | 0) {
+                          case 10:
+                          case 21:
+                            continue b;
+                          case 9:
+                            break;
+                          default: {
+                            i = 27;
+                            break b;
+                          }
+                        }
+                        if (((i + 4) | 0) == (m | 0)) {
+                          i = 27;
+                          break;
+                        }
+                      }
+                      if ((i | 0) == 27) {
+                        c[g >> 2] = j;
+                        f = 15;
+                        break;
+                      } else if ((i | 0) == 28) {
+                        c[g >> 2] = j;
+                        f = 15;
+                        break;
+                      }
+                    } else if ((i | 0) == 61) {
+                      l = (b + 72) | 0;
+                      h = (e + 2) | 0;
+                      c: while (1) {
+                        e = f & 255;
+                        d: while (1) {
+                          k = (m - h) | 0;
+                          if ((k | 0) <= 1) {
+                            i = 104;
+                            break c;
+                          }
+                          i = a[(h + 1) >> 0] | 0;
+                          j = a[h >> 0] | 0;
+                          if (!((i << 24) >> 24)) b = d[(l + (j & 255)) >> 0] | 0;
+                          else b = J$(i, j) | 0;
+                          switch (b | 0) {
+                            case 5: {
+                              i = 73;
+                              break c;
+                            }
+                            case 6: {
+                              i = 74;
+                              break c;
+                            }
+                            case 7: {
+                              i = 76;
+                              break c;
+                            }
+                            case 10:
+                            case 9:
+                            case 21:
+                            case 30:
+                            case 20:
+                            case 36:
+                            case 35:
+                            case 32:
+                            case 11: {
+                              i = 78;
+                              break c;
+                            }
+                            case 34: {
+                              i = 94;
+                              break c;
+                            }
+                            case 33: {
+                              i = 97;
+                              break c;
+                            }
+                            case 15: {
+                              i = 100;
+                              break c;
+                            }
+                            case 29: {
+                              k = j & 255;
+                              if (
+                                !(
+                                  (1 << (k & 31)) &
+                                  c[(56940 + (((k >>> 5) | (d[(144044 + (i & 255)) >> 0] << 3)) << 2)) >> 2]
+                                )
+                              ) {
+                                i = 71;
+                                break c;
+                              }
+                              break;
+                            }
+                            case 27:
+                            case 26:
+                            case 25:
+                            case 24:
+                            case 22:
+                              break;
+                            case 23: {
+                              k = (h + 2) | 0;
+                              switch (e & 63) {
+                                case 41: {
+                                  f = 19;
+                                  h = k;
+                                  continue c;
+                                }
+                                case 18:
+                                  break d;
+                                default: {
+                                  h = k;
+                                  continue d;
+                                }
+                              }
+                            }
+                            default: {
+                              i = 103;
+                              break c;
+                            }
+                          }
+                          h = (h + 2) | 0;
+                        }
+                        b = (m - k) | 0;
+                        if ((b | 0) <= 1) {
+                          f = -1;
+                          break a;
+                        }
+                        f = a[(h + 3) >> 0] | 0;
+                        i = a[k >> 0] | 0;
+                        if (!((f << 24) >> 24)) j = d[(l + (i & 255)) >> 0] | 0;
+                        else j = J$(f, i) | 0;
+                        switch (j | 0) {
+                          case 5: {
+                            i = 89;
+                            break c;
+                          }
+                          case 6: {
+                            i = 90;
+                            break c;
+                          }
+                          case 7: {
+                            i = 92;
+                            break c;
+                          }
+                          case 29: {
+                            e = i & 255;
+                            if (
+                              !(
+                                (1 << (e & 31)) &
+                                c[(56940 + (((e >>> 5) | (d[(144044 + (f & 255)) >> 0] << 3)) << 2)) >> 2]
+                              )
+                            ) {
+                              i = 87;
+                              break c;
+                            }
+                            break;
+                          }
+                          case 27:
+                          case 26:
+                          case 25:
+                          case 24:
+                          case 22:
+                            break;
+                          default: {
+                            f = 19;
+                            h = k;
+                            continue c;
+                          }
+                        }
+                        f = 41;
+                        h = (h + 4) | 0;
+                      }
+                      switch (i | 0) {
+                        case 71: {
+                          c[g >> 2] = h;
+                          f = 0;
+                          break a;
+                        }
+                        case 73: {
+                          c[g >> 2] = h;
+                          f = 0;
+                          break a;
+                        }
+                        case 74: {
+                          if ((k | 0) < 3) {
+                            f = -2;
+                            break a;
+                          }
+                          c[g >> 2] = h;
+                          f = 0;
+                          break a;
+                        }
+                        case 76: {
+                          if ((k | 0) < 4) {
+                            f = -2;
+                            break a;
+                          }
+                          c[g >> 2] = h;
+                          f = 0;
+                          break a;
+                        }
+                        case 78: {
+                          c[g >> 2] = h;
+                          break a;
+                        }
+                        case 87: {
+                          c[g >> 2] = k;
+                          f = 0;
+                          break a;
+                        }
+                        case 89: {
+                          c[g >> 2] = k;
+                          f = 0;
+                          break a;
+                        }
+                        case 90: {
+                          if ((b | 0) < 3) {
+                            f = -2;
+                            break a;
+                          }
+                          c[g >> 2] = k;
+                          f = 0;
+                          break a;
+                        }
+                        case 92: {
+                          if ((b | 0) < 4) {
+                            f = -2;
+                            break a;
+                          }
+                          c[g >> 2] = k;
+                          f = 0;
+                          break a;
+                        }
+                        case 94:
+                          if ((f | 0) == 19) {
+                            c[g >> 2] = h;
+                            f = 0;
+                            break a;
+                          } else {
+                            c[g >> 2] = h + 2;
+                            f = 32;
+                            break a;
+                          }
+                        case 97:
+                          if ((f | 0) == 19) {
+                            c[g >> 2] = h;
+                            f = 0;
+                            break a;
+                          } else {
+                            c[g >> 2] = h + 2;
+                            f = 31;
+                            break a;
+                          }
+                        case 100:
+                          if ((f | 0) == 19) {
+                            c[g >> 2] = h;
+                            f = 0;
+                            break a;
+                          } else {
+                            c[g >> 2] = h + 2;
+                            f = 30;
+                            break a;
+                          }
+                        case 103: {
+                          c[g >> 2] = h;
+                          f = 0;
+                          break a;
+                        }
+                        case 104: {
+                          f = (0 - f) | 0;
+                          break a;
+                        }
+                      }
+                    } else if ((i | 0) == 64) {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break;
+                    }
+                  } else f = -1;
+                } else f = -4;
+              while (0);
+              return f | 0;
+            }
+            function u$(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              a: do
+                if (e >>> 0 < f >>> 0) {
+                  h = e;
+                  i = (f - h) | 0;
+                  k = ((i & 1) | 0) == 0;
+                  i = i & -2;
+                  j = (i | 0) == 0;
+                  i = k | j ? f : (e + i) | 0;
+                  if (k | (j ^ 1)) {
+                    f = a[(e + 1) >> 0] | 0;
+                    if (!((f << 24) >> 24)) f = d[(b + 72 + (d[e >> 0] | 0)) >> 0] | 0;
+                    else f = J$(f, a[e >> 0] | 0) | 0;
+                    do
+                      switch (f | 0) {
+                        case 2: {
+                          f = O$(b, (e + 2) | 0, i, g) | 0;
+                          break a;
+                        }
+                        case 3: {
+                          f = K$(b, (e + 2) | 0, i, g) | 0;
+                          break a;
+                        }
+                        case 9: {
+                          h = (e + 2) | 0;
+                          if (((i - h) | 0) <= 1) {
+                            f = -3;
+                            break a;
+                          }
+                          f = a[(e + 3) >> 0] | 0;
+                          if (!((f << 24) >> 24)) f = d[(b + 72 + (d[h >> 0] | 0)) >> 0] | 0;
+                          else f = J$(f, a[h >> 0] | 0) | 0;
+                          c[g >> 2] = (f | 0) == 10 ? (e + 4) | 0 : h;
+                          f = 7;
+                          break a;
+                        }
+                        case 10: {
+                          c[g >> 2] = e + 2;
+                          f = 7;
+                          break a;
+                        }
+                        case 4: {
+                          h = (e + 2) | 0;
+                          if (((i - h) | 0) <= 1) {
+                            f = -5;
+                            break a;
+                          }
+                          if ((a[(e + 3) >> 0] | 0) == 0 ? (a[h >> 0] | 0) == 93 : 0) {
+                            f = (e + 4) | 0;
+                            if (((i - f) | 0) <= 1) {
+                              f = -5;
+                              break a;
+                            }
+                            if ((a[(e + 5) >> 0] | 0) == 0 ? (a[f >> 0] | 0) == 62 : 0) {
+                              c[g >> 2] = f;
+                              f = 0;
+                              break a;
+                            } else f = i;
+                          } else f = i;
+                          break;
+                        }
+                        case 5: {
+                          f = i;
+                          if (((f - h) | 0) < 2) {
+                            f = -2;
+                            break a;
+                          }
+                          h = (e + 2) | 0;
+                          break;
+                        }
+                        case 6: {
+                          f = i;
+                          if (((f - h) | 0) < 3) {
+                            f = -2;
+                            break a;
+                          }
+                          h = (e + 3) | 0;
+                          break;
+                        }
+                        case 7: {
+                          f = i;
+                          if (((f - h) | 0) < 4) {
+                            f = -2;
+                            break a;
+                          }
+                          h = (e + 4) | 0;
+                          break;
+                        }
+                        case 8:
+                        case 1:
+                        case 0: {
+                          c[g >> 2] = e;
+                          f = 0;
+                          break a;
+                        }
+                        default: {
+                          h = (e + 2) | 0;
+                          f = i;
+                        }
+                      }
+                    while (0);
+                    j = (b + 72) | 0;
+                    b = h;
+                    b: while (1) {
+                      e = (f - b) | 0;
+                      if ((e | 0) <= 1) {
+                        h = 52;
+                        break;
+                      }
+                      h = a[(b + 1) >> 0] | 0;
+                      i = a[b >> 0] | 0;
+                      if (!((h << 24) >> 24)) h = d[(j + (i & 255)) >> 0] | 0;
+                      else h = J$(h, i) | 0;
+                      switch (h | 0) {
+                        case 10:
+                        case 9:
+                        case 8:
+                        case 1:
+                        case 0:
+                        case 2:
+                        case 3: {
+                          h = 50;
+                          break b;
+                        }
+                        case 5: {
+                          b = (b + 2) | 0;
+                          continue b;
+                        }
+                        case 6: {
+                          if ((e | 0) < 3) {
+                            h = 38;
+                            break b;
+                          }
+                          b = (b + 3) | 0;
+                          continue b;
+                        }
+                        case 7: {
+                          if ((e | 0) < 4) {
+                            h = 41;
+                            break b;
+                          }
+                          b = (b + 4) | 0;
+                          continue b;
+                        }
+                        case 4: {
+                          if ((e | 0) <= 3) {
+                            h = 50;
+                            break b;
+                          }
+                          h = (b + 2) | 0;
+                          if (a[(b + 3) >> 0] | 0) {
+                            b = h;
+                            continue b;
+                          }
+                          if ((a[h >> 0] | 0) != 93) {
+                            b = h;
+                            continue b;
+                          }
+                          if ((e | 0) <= 5) {
+                            h = 50;
+                            break b;
+                          }
+                          i = (b + 4) | 0;
+                          if (a[(b + 5) >> 0] | 0) {
+                            b = h;
+                            continue b;
+                          }
+                          if ((a[i >> 0] | 0) == 62) {
+                            h = 49;
+                            break b;
+                          } else {
+                            b = h;
+                            continue b;
+                          }
+                        }
+                        default: {
+                          b = (b + 2) | 0;
+                          continue b;
+                        }
+                      }
+                    }
+                    if ((h | 0) == 38) {
+                      c[g >> 2] = b;
+                      f = 6;
+                      break;
+                    } else if ((h | 0) == 41) {
+                      c[g >> 2] = b;
+                      f = 6;
+                      break;
+                    } else if ((h | 0) == 49) {
+                      c[g >> 2] = i;
+                      f = 0;
+                      break;
+                    } else if ((h | 0) == 50) {
+                      c[g >> 2] = b;
+                      f = 6;
+                      break;
+                    } else if ((h | 0) == 52) {
+                      c[g >> 2] = b;
+                      f = 6;
+                      break;
+                    }
+                  } else f = -1;
+                } else f = -4;
+              while (0);
+              return f | 0;
+            }
+            function v$(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              a: do
+                if (e >>> 0 < f >>> 0) {
+                  h = e;
+                  i = (f - h) | 0;
+                  k = ((i & 1) | 0) == 0;
+                  i = i & -2;
+                  j = (i | 0) == 0;
+                  i = k | j ? f : (e + i) | 0;
+                  if (k | (j ^ 1)) {
+                    f = a[(e + 1) >> 0] | 0;
+                    if (!((f << 24) >> 24)) f = d[(b + 72 + (d[e >> 0] | 0)) >> 0] | 0;
+                    else f = J$(f, a[e >> 0] | 0) | 0;
+                    switch (f | 0) {
+                      case 4: {
+                        h = (e + 2) | 0;
+                        if (((i - h) | 0) <= 1) {
+                          f = -1;
+                          break a;
+                        }
+                        if ((a[(e + 3) >> 0] | 0) == 0 ? (a[h >> 0] | 0) == 93 : 0) {
+                          f = (e + 4) | 0;
+                          if (((i - f) | 0) <= 1) {
+                            f = -1;
+                            break a;
+                          }
+                          if ((a[(e + 5) >> 0] | 0) == 0 ? (a[f >> 0] | 0) == 62 : 0) {
+                            c[g >> 2] = e + 6;
+                            f = 40;
+                            break a;
+                          }
+                        }
+                        break;
+                      }
+                      case 9: {
+                        h = (e + 2) | 0;
+                        if (((i - h) | 0) <= 1) {
+                          f = -1;
+                          break a;
+                        }
+                        f = a[(e + 3) >> 0] | 0;
+                        if (!((f << 24) >> 24)) f = d[(b + 72 + (d[h >> 0] | 0)) >> 0] | 0;
+                        else f = J$(f, a[h >> 0] | 0) | 0;
+                        c[g >> 2] = (f | 0) == 10 ? (e + 4) | 0 : h;
+                        f = 7;
+                        break a;
+                      }
+                      case 10: {
+                        c[g >> 2] = e + 2;
+                        f = 7;
+                        break a;
+                      }
+                      case 5: {
+                        f = i;
+                        if (((f - h) | 0) < 2) {
+                          f = -2;
+                          break a;
+                        }
+                        h = (e + 2) | 0;
+                        i = f;
+                        break;
+                      }
+                      case 6: {
+                        f = i;
+                        if (((f - h) | 0) < 3) {
+                          f = -2;
+                          break a;
+                        }
+                        h = (e + 3) | 0;
+                        i = f;
+                        break;
+                      }
+                      case 7: {
+                        f = i;
+                        if (((f - h) | 0) < 4) {
+                          f = -2;
+                          break a;
+                        }
+                        h = (e + 4) | 0;
+                        i = f;
+                        break;
+                      }
+                      case 8:
+                      case 1:
+                      case 0: {
+                        c[g >> 2] = e;
+                        f = 0;
+                        break a;
+                      }
+                      default:
+                        h = (e + 2) | 0;
+                    }
+                    j = (b + 72) | 0;
+                    b = h;
+                    b: while (1) {
+                      e = (i - b) | 0;
+                      if ((e | 0) <= 1) {
+                        h = 40;
+                        break;
+                      }
+                      f = a[(b + 1) >> 0] | 0;
+                      h = a[b >> 0] | 0;
+                      if (!((f << 24) >> 24)) f = d[(j + (h & 255)) >> 0] | 0;
+                      else f = J$(f, h) | 0;
+                      switch (f | 0) {
+                        case 10:
+                        case 9:
+                        case 8:
+                        case 1:
+                        case 0:
+                        case 4: {
+                          h = 38;
+                          break b;
+                        }
+                        case 6: {
+                          if ((e | 0) < 3) {
+                            h = 35;
+                            break b;
+                          } else f = 3;
+                          break;
+                        }
+                        case 7: {
+                          if ((e | 0) < 4) {
+                            h = 37;
+                            break b;
+                          } else f = 4;
+                          break;
+                        }
+                        default:
+                          f = 2;
+                      }
+                      b = (b + f) | 0;
+                    }
+                    if ((h | 0) == 35) {
+                      c[g >> 2] = b;
+                      f = 6;
+                      break;
+                    } else if ((h | 0) == 37) {
+                      c[g >> 2] = b;
+                      f = 6;
+                      break;
+                    } else if ((h | 0) == 38) {
+                      c[g >> 2] = b;
+                      f = 6;
+                      break;
+                    } else if ((h | 0) == 40) {
+                      c[g >> 2] = b;
+                      f = 6;
+                      break;
+                    }
+                  } else f = -1;
+                } else f = -4;
+              while (0);
+              return f | 0;
+            }
+            function w$(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              k = (f - e) | 0;
+              k = ((k & 1) | 0) == 0 ? f : (e + (k & -2)) | 0;
+              j = (b + 72) | 0;
+              i = 0;
+              f = e;
+              a: while (1) {
+                h = (k - f) | 0;
+                if ((h | 0) <= 1) {
+                  f = -1;
+                  break;
+                }
+                b = a[(f + 1) >> 0] | 0;
+                e = a[f >> 0] | 0;
+                if (!((b << 24) >> 24)) b = d[(j + (e & 255)) >> 0] | 0;
+                else b = J$(b, e) | 0;
+                switch (b | 0) {
+                  case 8:
+                  case 1:
+                  case 0: {
+                    l = 12;
+                    break a;
+                  }
+                  case 5: {
+                    h = i;
+                    f = (f + 2) | 0;
+                    i = h;
+                    continue a;
+                  }
+                  case 6: {
+                    if ((h | 0) < 3) {
+                      f = -2;
+                      break a;
+                    }
+                    h = i;
+                    f = (f + 3) | 0;
+                    i = h;
+                    continue a;
+                  }
+                  case 7: {
+                    if ((h | 0) < 4) {
+                      f = -2;
+                      break a;
+                    }
+                    h = i;
+                    f = (f + 4) | 0;
+                    i = h;
+                    continue a;
+                  }
+                  case 2: {
+                    b = (f + 2) | 0;
+                    if (((k - b) | 0) <= 1) {
+                      f = -1;
+                      break a;
+                    }
+                    if (a[(f + 3) >> 0] | 0) {
+                      h = i;
+                      f = b;
+                      i = h;
+                      continue a;
+                    }
+                    if ((a[b >> 0] | 0) != 33) {
+                      h = i;
+                      f = b;
+                      i = h;
+                      continue a;
+                    }
+                    b = (f + 4) | 0;
+                    if (((k - b) | 0) <= 1) {
+                      f = -1;
+                      break a;
+                    }
+                    if (a[(f + 5) >> 0] | 0) {
+                      h = i;
+                      f = b;
+                      i = h;
+                      continue a;
+                    }
+                    h = (a[b >> 0] | 0) == 91;
+                    i = (i + (h & 1)) | 0;
+                    f = h ? (f + 6) | 0 : b;
+                    continue a;
+                  }
+                  case 4: {
+                    b = (f + 2) | 0;
+                    if (((k - b) | 0) <= 1) {
+                      f = -1;
+                      break a;
+                    }
+                    if (a[(f + 3) >> 0] | 0) {
+                      h = i;
+                      f = b;
+                      i = h;
+                      continue a;
+                    }
+                    if ((a[b >> 0] | 0) != 93) {
+                      h = i;
+                      f = b;
+                      i = h;
+                      continue a;
+                    }
+                    b = (f + 4) | 0;
+                    if (((k - b) | 0) <= 1) {
+                      f = -1;
+                      break a;
+                    }
+                    if (a[(f + 5) >> 0] | 0) {
+                      h = i;
+                      f = b;
+                      i = h;
+                      continue a;
+                    }
+                    if ((a[b >> 0] | 0) != 62) {
+                      h = i;
+                      f = b;
+                      i = h;
+                      continue a;
+                    }
+                    f = (f + 6) | 0;
+                    if (!i) {
+                      l = 26;
+                      break a;
+                    }
+                    i = (i + -1) | 0;
+                    continue a;
+                  }
+                  default: {
+                    h = i;
+                    f = (f + 2) | 0;
+                    i = h;
+                    continue a;
+                  }
+                }
+              }
+              if ((l | 0) == 12) {
+                c[g >> 2] = f;
+                f = 0;
+              } else if ((l | 0) == 26) {
+                c[g >> 2] = f;
+                f = 42;
+              }
+              return f | 0;
+            }
+            function x$(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              do
+                if (e >>> 0 < f >>> 0) {
+                  k = f;
+                  if (((k - e) | 0) > 1) {
+                    l = (b + 72) | 0;
+                    j = e;
+                    a: while (1) {
+                      if (((k - j) | 0) <= 1) {
+                        i = 30;
+                        break;
+                      }
+                      h = a[(j + 1) >> 0] | 0;
+                      i = a[j >> 0] | 0;
+                      if (!((h << 24) >> 24)) h = d[(l + (i & 255)) >> 0] | 0;
+                      else h = J$(h, i) | 0;
+                      switch (h | 0) {
+                        case 3: {
+                          i = 11;
+                          break a;
+                        }
+                        case 2: {
+                          i = 14;
+                          break a;
+                        }
+                        case 10: {
+                          i = 15;
+                          break a;
+                        }
+                        case 9: {
+                          i = 18;
+                          break a;
+                        }
+                        case 21: {
+                          i = 25;
+                          break a;
+                        }
+                        case 5: {
+                          h = 2;
+                          break;
+                        }
+                        case 6: {
+                          h = 3;
+                          break;
+                        }
+                        case 7: {
+                          h = 4;
+                          break;
+                        }
+                        default:
+                          h = 2;
+                      }
+                      j = (j + h) | 0;
+                    }
+                    if ((i | 0) == 11)
+                      if ((j | 0) == (e | 0)) {
+                        h = K$(b, (e + 2) | 0, f, g) | 0;
+                        break;
+                      } else {
+                        c[g >> 2] = j;
+                        h = 6;
+                        break;
+                      }
+                    else if ((i | 0) == 14) {
+                      c[g >> 2] = j;
+                      h = 0;
+                      break;
+                    } else if ((i | 0) == 15)
+                      if ((j | 0) == (e | 0)) {
+                        c[g >> 2] = e + 2;
+                        h = 7;
+                        break;
+                      } else {
+                        c[g >> 2] = j;
+                        h = 6;
+                        break;
+                      }
+                    else if ((i | 0) == 18) {
+                      if ((j | 0) != (e | 0)) {
+                        c[g >> 2] = j;
+                        h = 6;
+                        break;
+                      }
+                      j = (e + 2) | 0;
+                      if (((k - j) | 0) <= 1) {
+                        h = -3;
+                        break;
+                      }
+                      h = a[(e + 3) >> 0] | 0;
+                      i = a[j >> 0] | 0;
+                      if (!((h << 24) >> 24)) h = d[(l + (i & 255)) >> 0] | 0;
+                      else h = J$(h, i) | 0;
+                      c[g >> 2] = (h | 0) == 10 ? (e + 4) | 0 : j;
+                      h = 7;
+                      break;
+                    } else if ((i | 0) == 25)
+                      if ((j | 0) == (e | 0)) {
+                        c[g >> 2] = e + 2;
+                        h = 39;
+                        break;
+                      } else {
+                        c[g >> 2] = j;
+                        h = 6;
+                        break;
+                      }
+                    else if ((i | 0) == 30) {
+                      c[g >> 2] = j;
+                      h = 6;
+                      break;
+                    }
+                  } else h = -1;
+                } else h = -4;
+              while (0);
+              return h | 0;
+            }
+            function y$(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              do
+                if (e >>> 0 < f >>> 0) {
+                  k = f;
+                  if (((k - e) | 0) > 1) {
+                    l = (b + 72) | 0;
+                    j = e;
+                    a: while (1) {
+                      if (((k - j) | 0) <= 1) {
+                        i = 29;
+                        break;
+                      }
+                      h = a[(j + 1) >> 0] | 0;
+                      i = a[j >> 0] | 0;
+                      if (!((h << 24) >> 24)) h = d[(l + (i & 255)) >> 0] | 0;
+                      else h = J$(h, i) | 0;
+                      switch (h | 0) {
+                        case 3: {
+                          i = 11;
+                          break a;
+                        }
+                        case 30: {
+                          i = 14;
+                          break a;
+                        }
+                        case 10: {
+                          i = 17;
+                          break a;
+                        }
+                        case 9: {
+                          i = 20;
+                          break a;
+                        }
+                        case 5: {
+                          h = 2;
+                          break;
+                        }
+                        case 6: {
+                          h = 3;
+                          break;
+                        }
+                        case 7: {
+                          h = 4;
+                          break;
+                        }
+                        default:
+                          h = 2;
+                      }
+                      j = (j + h) | 0;
+                    }
+                    if ((i | 0) == 11)
+                      if ((j | 0) == (e | 0)) {
+                        h = K$(b, (e + 2) | 0, f, g) | 0;
+                        break;
+                      } else {
+                        c[g >> 2] = j;
+                        h = 6;
+                        break;
+                      }
+                    else if ((i | 0) == 14)
+                      if ((j | 0) == (e | 0)) {
+                        h = L$(b, (e + 2) | 0, f, g) | 0;
+                        h = (h | 0) == 22 ? 0 : h;
+                        break;
+                      } else {
+                        c[g >> 2] = j;
+                        h = 6;
+                        break;
+                      }
+                    else if ((i | 0) == 17)
+                      if ((j | 0) == (e | 0)) {
+                        c[g >> 2] = e + 2;
+                        h = 7;
+                        break;
+                      } else {
+                        c[g >> 2] = j;
+                        h = 6;
+                        break;
+                      }
+                    else if ((i | 0) == 20) {
+                      if ((j | 0) != (e | 0)) {
+                        c[g >> 2] = j;
+                        h = 6;
+                        break;
+                      }
+                      j = (e + 2) | 0;
+                      if (((k - j) | 0) <= 1) {
+                        h = -3;
+                        break;
+                      }
+                      h = a[(e + 3) >> 0] | 0;
+                      i = a[j >> 0] | 0;
+                      if (!((h << 24) >> 24)) h = d[(l + (i & 255)) >> 0] | 0;
+                      else h = J$(h, i) | 0;
+                      c[g >> 2] = (h | 0) == 10 ? (e + 4) | 0 : j;
+                      h = 7;
+                      break;
+                    } else if ((i | 0) == 29) {
+                      c[g >> 2] = j;
+                      h = 6;
+                      break;
+                    }
+                  } else h = -1;
+                } else h = -4;
+              while (0);
+              return h | 0;
+            }
+            function z$(b, c, d, e) {
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              f = d;
+              b = c;
+              while (1) {
+                c = a[e >> 0] | 0;
+                if (!((c << 24) >> 24)) {
+                  g = 7;
+                  break;
+                }
+                if (((f - b) | 0) < 2) {
+                  b = 0;
+                  break;
+                }
+                if (a[(b + 1) >> 0] | 0) {
+                  b = 0;
+                  break;
+                }
+                if ((a[b >> 0] | 0) != (c << 24) >> 24) {
+                  b = 0;
+                  break;
+                }
+                e = (e + 1) | 0;
+                b = (b + 2) | 0;
+              }
+              if ((g | 0) == 7) b = ((b | 0) == (d | 0)) & 1;
+              return b | 0;
+            }
+            function A$(b, c) {
+              b = b | 0;
+              c = c | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              g = (b + 72) | 0;
+              f = c;
+              a: while (1) {
+                b = a[(f + 1) >> 0] | 0;
+                e = a[f >> 0] | 0;
+                if (!((b << 24) >> 24)) b = d[(g + (e & 255)) >> 0] | 0;
+                else b = J$(b, e) | 0;
+                switch (b | 0) {
+                  case 5: {
+                    b = 2;
+                    break;
+                  }
+                  case 6: {
+                    b = 3;
+                    break;
+                  }
+                  case 7: {
+                    b = 4;
+                    break;
+                  }
+                  case 27:
+                  case 26:
+                  case 25:
+                  case 24:
+                  case 23:
+                  case 22:
+                  case 29: {
+                    b = 2;
+                    break;
+                  }
+                  default:
+                    break a;
+                }
+                f = (f + b) | 0;
+              }
+              return (f - c) | 0;
+            }
+            function B$(b, c) {
+              b = b | 0;
+              c = c | 0;
+              var e = 0,
+                f = 0;
+              f = (b + 72) | 0;
+              a: while (1) {
+                b = a[(c + 1) >> 0] | 0;
+                e = a[c >> 0] | 0;
+                if (!((b << 24) >> 24)) b = d[(f + (e & 255)) >> 0] | 0;
+                else b = J$(b, e) | 0;
+                switch (b | 0) {
+                  case 21:
+                  case 9:
+                  case 10:
+                    break;
+                  default:
+                    break a;
+                }
+                c = (c + 2) | 0;
+              }
+              return c | 0;
+            }
+            function C$(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              o = (b + 72) | 0;
+              m = 0;
+              n = 0;
+              b = 1;
+              a: while (1) {
+                l = (e + 2) | 0;
+                i = (e + 3) | 0;
+                h = a[i >> 0] | 0;
+                j = (h << 24) >> 24 == 0;
+                k = a[l >> 0] | 0;
+                if (j) h = d[(o + (k & 255)) >> 0] | 0;
+                else h = J$(h, k) | 0;
+                do
+                  switch (h | 0) {
+                    case 5: {
+                      if (b | 0) {
+                        i = b;
+                        j = n;
+                        k = m;
+                        e = l;
+                        b = i;
+                        n = j;
+                        m = k;
+                        continue a;
+                      }
+                      if ((n | 0) >= (f | 0)) {
+                        j = n;
+                        k = m;
+                        b = 1;
+                        e = l;
+                        n = j;
+                        m = k;
+                        continue a;
+                      }
+                      c[(g + (n << 4)) >> 2] = l;
+                      a[(g + (n << 4) + 12) >> 0] = 1;
+                      j = n;
+                      k = m;
+                      b = 1;
+                      e = l;
+                      n = j;
+                      m = k;
+                      continue a;
+                    }
+                    case 6: {
+                      if (b | 0) {
+                        j = b;
+                        k = n;
+                        l = m;
+                        e = i;
+                        b = j;
+                        n = k;
+                        m = l;
+                        continue a;
+                      }
+                      if ((n | 0) >= (f | 0)) {
+                        k = n;
+                        l = m;
+                        b = 1;
+                        e = i;
+                        n = k;
+                        m = l;
+                        continue a;
+                      }
+                      c[(g + (n << 4)) >> 2] = l;
+                      a[(g + (n << 4) + 12) >> 0] = 1;
+                      k = n;
+                      l = m;
+                      b = 1;
+                      e = i;
+                      n = k;
+                      m = l;
+                      continue a;
+                    }
+                    case 7: {
+                      if (!b)
+                        if ((n | 0) < (f | 0)) {
+                          c[(g + (n << 4)) >> 2] = l;
+                          a[(g + (n << 4) + 12) >> 0] = 1;
+                          b = 1;
+                        } else b = 1;
+                      k = n;
+                      l = m;
+                      e = (e + 4) | 0;
+                      n = k;
+                      m = l;
+                      continue a;
+                    }
+                    case 24:
+                    case 22:
+                    case 29: {
+                      if (b | 0) {
+                        i = b;
+                        j = n;
+                        k = m;
+                        e = l;
+                        b = i;
+                        n = j;
+                        m = k;
+                        continue a;
+                      }
+                      if ((n | 0) >= (f | 0)) {
+                        j = n;
+                        k = m;
+                        b = 1;
+                        e = l;
+                        n = j;
+                        m = k;
+                        continue a;
+                      }
+                      c[(g + (n << 4)) >> 2] = l;
+                      a[(g + (n << 4) + 12) >> 0] = 1;
+                      j = n;
+                      k = m;
+                      b = 1;
+                      e = l;
+                      n = j;
+                      m = k;
+                      continue a;
+                    }
+                    case 12: {
+                      if ((b | 0) != 2) {
+                        if ((n | 0) >= (f | 0)) {
+                          k = n;
+                          m = 12;
+                          b = 2;
+                          e = l;
+                          n = k;
+                          continue a;
+                        }
+                        c[(g + (n << 4) + 4) >> 2] = e + 4;
+                        k = n;
+                        m = 12;
+                        b = 2;
+                        e = l;
+                        n = k;
+                        continue a;
+                      }
+                      if ((m | 0) != 12) {
+                        j = n;
+                        k = m;
+                        b = 2;
+                        e = l;
+                        n = j;
+                        m = k;
+                        continue a;
+                      }
+                      if ((n | 0) < (f | 0)) c[(g + (n << 4) + 8) >> 2] = l;
+                      m = 12;
+                      n = (n + 1) | 0;
+                      b = 0;
+                      e = l;
+                      continue a;
+                    }
+                    case 13: {
+                      if ((b | 0) != 2) {
+                        if ((n | 0) >= (f | 0)) {
+                          k = n;
+                          m = 13;
+                          b = 2;
+                          e = l;
+                          n = k;
+                          continue a;
+                        }
+                        c[(g + (n << 4) + 4) >> 2] = e + 4;
+                        k = n;
+                        m = 13;
+                        b = 2;
+                        e = l;
+                        n = k;
+                        continue a;
+                      }
+                      if ((m | 0) != 13) {
+                        j = n;
+                        k = m;
+                        b = 2;
+                        e = l;
+                        n = j;
+                        m = k;
+                        continue a;
+                      }
+                      if ((n | 0) < (f | 0)) c[(g + (n << 4) + 8) >> 2] = l;
+                      m = 13;
+                      n = (n + 1) | 0;
+                      b = 0;
+                      e = l;
+                      continue a;
+                    }
+                    case 3: {
+                      if ((n | 0) >= (f | 0)) {
+                        i = b;
+                        j = n;
+                        k = m;
+                        e = l;
+                        b = i;
+                        n = j;
+                        m = k;
+                        continue a;
+                      }
+                      a[(g + (n << 4) + 12) >> 0] = 0;
+                      i = b;
+                      j = n;
+                      k = m;
+                      e = l;
+                      b = i;
+                      n = j;
+                      m = k;
+                      continue a;
+                    }
+                    case 21: {
+                      switch (b | 0) {
+                        case 1: {
+                          j = n;
+                          k = m;
+                          b = 0;
+                          e = l;
+                          n = j;
+                          m = k;
+                          continue a;
+                        }
+                        case 2:
+                          break;
+                        default: {
+                          i = b;
+                          j = n;
+                          k = m;
+                          e = l;
+                          b = i;
+                          n = j;
+                          m = k;
+                          continue a;
+                        }
+                      }
+                      if ((n | 0) >= (f | 0)) {
+                        j = n;
+                        k = m;
+                        b = 2;
+                        e = l;
+                        n = j;
+                        m = k;
+                        continue a;
+                      }
+                      i = (g + (n << 4) + 12) | 0;
+                      if (!(a[i >> 0] | 0)) {
+                        j = n;
+                        k = m;
+                        b = 2;
+                        e = l;
+                        n = j;
+                        m = k;
+                        continue a;
+                      }
+                      do
+                        if (j & ((l | 0) != (c[(g + (n << 4) + 4) >> 2] | 0)) & ((k << 24) >> 24 == 32)) {
+                          h = a[(e + 5) >> 0] | 0;
+                          b = a[(e + 4) >> 0] | 0;
+                          if (!((h << 24) >> 24)) {
+                            if ((b << 24) >> 24 == 32) break;
+                            b = d[(o + (b & 255)) >> 0] | 0;
+                          } else b = J$(h, b) | 0;
+                          if ((b | 0) != (m | 0)) {
+                            j = n;
+                            k = m;
+                            b = 2;
+                            e = l;
+                            n = j;
+                            m = k;
+                            continue a;
+                          }
+                        }
+                      while (0);
+                      a[i >> 0] = 0;
+                      j = n;
+                      k = m;
+                      b = 2;
+                      e = l;
+                      n = j;
+                      m = k;
+                      continue a;
+                    }
+                    case 10:
+                    case 9: {
+                      switch (b | 0) {
+                        case 1: {
+                          j = n;
+                          k = m;
+                          b = 0;
+                          e = l;
+                          n = j;
+                          m = k;
+                          continue a;
+                        }
+                        case 2:
+                          break;
+                        default: {
+                          i = b;
+                          j = n;
+                          k = m;
+                          e = l;
+                          b = i;
+                          n = j;
+                          m = k;
+                          continue a;
+                        }
+                      }
+                      if ((n | 0) >= (f | 0)) {
+                        j = n;
+                        k = m;
+                        b = 2;
+                        e = l;
+                        n = j;
+                        m = k;
+                        continue a;
+                      }
+                      a[(g + (n << 4) + 12) >> 0] = 0;
+                      j = n;
+                      k = m;
+                      b = 2;
+                      e = l;
+                      n = j;
+                      m = k;
+                      continue a;
+                    }
+                    case 17:
+                    case 11:
+                      if ((b | 0) == 2) {
+                        j = n;
+                        k = m;
+                        b = 2;
+                        e = l;
+                        n = j;
+                        m = k;
+                        continue a;
+                      } else break a;
+                    default: {
+                      i = b;
+                      j = n;
+                      k = m;
+                      e = l;
+                      b = i;
+                      n = j;
+                      m = k;
+                      continue a;
+                    }
+                  }
+                while (0);
+              }
+              return n | 0;
+            }
+            function D$(b, c) {
+              b = b | 0;
+              c = c | 0;
+              var d = 0,
+                e = 0;
+              b = (c + 4) | 0;
+              a: do
+                if ((a[(c + 5) >> 0] | 0) == 0 ? (a[b >> 0] | 0) == 120 : 0) {
+                  c = (c + 6) | 0;
+                  b = 0;
+                  while (1) {
+                    b: while (1) {
+                      if (!(a[(c + 1) >> 0] | 0)) {
+                        d = a[c >> 0] | 0;
+                        if ((d << 24) >> 24 == 59) {
+                          e = 17;
+                          break a;
+                        }
+                        d = (d << 24) >> 24;
+                        switch (d | 0) {
+                          case 57:
+                          case 56:
+                          case 55:
+                          case 54:
+                          case 53:
+                          case 52:
+                          case 51:
+                          case 50:
+                          case 49:
+                          case 48: {
+                            e = 8;
+                            break b;
+                          }
+                          case 70:
+                          case 69:
+                          case 68:
+                          case 67:
+                          case 66:
+                          case 65: {
+                            e = 9;
+                            break b;
+                          }
+                          case 102:
+                          case 101:
+                          case 100:
+                          case 99:
+                          case 98:
+                          case 97: {
+                            e = 10;
+                            break b;
+                          }
+                          default: {
+                          }
+                        }
+                      }
+                      c = (c + 2) | 0;
+                    }
+                    if ((e | 0) == 8) {
+                      e = 0;
+                      b = (d + -48) | (b << 4);
+                    } else if ((e | 0) == 9) {
+                      e = 0;
+                      b = ((b << 4) + -55 + d) | 0;
+                    } else if ((e | 0) == 10) {
+                      e = 0;
+                      b = ((b << 4) + -87 + d) | 0;
+                    }
+                    if ((b | 0) < 1114112) c = (c + 2) | 0;
+                    else {
+                      b = -1;
+                      break;
+                    }
+                  }
+                } else {
+                  d = b;
+                  b = 0;
+                  e = 13;
+                }
+              while (0);
+              c: do
+                if ((e | 0) == 13)
+                  while (1) {
+                    e = 0;
+                    if (!(a[(d + 1) >> 0] | 0)) {
+                      c = a[d >> 0] | 0;
+                      if ((c << 24) >> 24 == 59) {
+                        e = 17;
+                        break c;
+                      }
+                      c = (c << 24) >> 24;
+                    } else c = -1;
+                    b = (((b * 10) | 0) + -48 + c) | 0;
+                    if ((b | 0) >= 1114112) {
+                      b = -1;
+                      break;
+                    } else {
+                      d = (d + 2) | 0;
+                      e = 13;
+                    }
+                  }
+              while (0);
+              if ((e | 0) == 17) b = A_(b) | 0;
+              return b | 0;
+            }
+            function E$(b, c, d) {
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0;
+              a: do
+                switch ((((d - c) | 0) / 2) | 0 | 0) {
+                  case 2: {
+                    if ((a[(c + 3) >> 0] | 0) == 0 ? (a[(c + 2) >> 0] | 0) == 116 : 0) {
+                      if (!(a[(c + 1) >> 0] | 0)) b = a[c >> 0] | 0;
+                      else b = -1;
+                      b = (b | 0) == 108 ? 60 : (b | 0) == 103 ? 62 : 0;
+                    } else e = 27;
+                    break;
+                  }
+                  case 3: {
+                    if (
+                      (
+                        (
+                          (((a[(c + 1) >> 0] | 0) == 0 ? (a[c >> 0] | 0) == 97 : 0) ? (a[(c + 3) >> 0] | 0) == 0 : 0)
+                            ? (a[(c + 2) >> 0] | 0) == 109
+                            : 0
+                        )
+                          ? (a[(c + 5) >> 0] | 0) == 0
+                          : 0
+                      )
+                        ? (a[(c + 4) >> 0] | 0) == 112
+                        : 0
+                    )
+                      b = 38;
+                    else e = 27;
+                    break;
+                  }
+                  case 4: {
+                    if (!(a[(c + 1) >> 0] | 0))
+                      switch (a[c >> 0] | 0) {
+                        case 113: {
+                          if (a[(c + 3) >> 0] | 0) {
+                            e = 27;
+                            break a;
+                          }
+                          if ((a[(c + 2) >> 0] | 0) != 117) {
+                            e = 27;
+                            break a;
+                          }
+                          if (a[(c + 5) >> 0] | 0) {
+                            e = 27;
+                            break a;
+                          }
+                          if ((a[(c + 4) >> 0] | 0) != 111) {
+                            e = 27;
+                            break a;
+                          }
+                          if (a[(c + 7) >> 0] | 0) {
+                            e = 27;
+                            break a;
+                          }
+                          if ((a[(c + 6) >> 0] | 0) == 116) {
+                            b = 34;
+                            break a;
+                          } else {
+                            e = 27;
+                            break a;
+                          }
+                        }
+                        case 97: {
+                          if (a[(c + 3) >> 0] | 0) {
+                            e = 27;
+                            break a;
+                          }
+                          if ((a[(c + 2) >> 0] | 0) != 112) {
+                            e = 27;
+                            break a;
+                          }
+                          if (a[(c + 5) >> 0] | 0) {
+                            e = 27;
+                            break a;
+                          }
+                          if ((a[(c + 4) >> 0] | 0) != 111) {
+                            e = 27;
+                            break a;
+                          }
+                          if (a[(c + 7) >> 0] | 0) {
+                            e = 27;
+                            break a;
+                          }
+                          if ((a[(c + 6) >> 0] | 0) == 115) {
+                            b = 39;
+                            break a;
+                          } else {
+                            e = 27;
+                            break a;
+                          }
+                        }
+                        default: {
+                          e = 27;
+                          break a;
+                        }
+                      }
+                    else e = 27;
+                    break;
+                  }
+                  default:
+                    e = 27;
+                }
+              while (0);
+              if ((e | 0) == 27) b = 0;
+              return b | 0;
+            }
+            function F$(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              j = (b + 72) | 0;
+              k = (g + 4) | 0;
+              while (1) {
+                if (((f - e) | 0) <= 1) break;
+                b = a[(e + 1) >> 0] | 0;
+                h = a[e >> 0] | 0;
+                if (!((b << 24) >> 24)) b = d[(j + (h & 255)) >> 0] | 0;
+                else b = J$(b, h) | 0;
+                switch (b | 0) {
+                  case 5: {
+                    e = (e + 2) | 0;
+                    break;
+                  }
+                  case 6: {
+                    e = (e + 3) | 0;
+                    break;
+                  }
+                  case 7: {
+                    e = (e + 4) | 0;
+                    break;
+                  }
+                  case 10: {
+                    c[k >> 2] = -1;
+                    c[g >> 2] = (c[g >> 2] | 0) + 1;
+                    e = (e + 2) | 0;
+                    break;
+                  }
+                  case 9: {
+                    c[g >> 2] = (c[g >> 2] | 0) + 1;
+                    i = (e + 2) | 0;
+                    if (((f - i) | 0) > 1) {
+                      b = a[(e + 3) >> 0] | 0;
+                      h = a[i >> 0] | 0;
+                      if (!((b << 24) >> 24)) b = d[(j + (h & 255)) >> 0] | 0;
+                      else b = J$(b, h) | 0;
+                      e = (b | 0) == 10 ? (e + 4) | 0 : i;
+                    } else e = i;
+                    c[k >> 2] = -1;
+                    break;
+                  }
+                  default:
+                    e = (e + 2) | 0;
+                }
+                c[k >> 2] = (c[k >> 2] | 0) + 1;
+              }
+              return;
+            }
+            function G$(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              j = (f + -2) | 0;
+              i = (b + 72) | 0;
+              f = e;
+              a: while (1) {
+                h = (f + 2) | 0;
+                if (((j - h) | 0) <= 1) {
+                  f = 1;
+                  break;
+                }
+                f = a[(f + 3) >> 0] | 0;
+                b = (f << 24) >> 24 == 0;
+                e = a[h >> 0] | 0;
+                if (b) f = d[(i + (e & 255)) >> 0] | 0;
+                else f = J$(f, e) | 0;
+                switch (f | 0) {
+                  case 23:
+                  case 19:
+                  case 30:
+                  case 33:
+                  case 16:
+                  case 18:
+                  case 10:
+                  case 9:
+                  case 15:
+                  case 14:
+                  case 17:
+                  case 35:
+                  case 34:
+                  case 32:
+                  case 31:
+                  case 13:
+                  case 27:
+                  case 24:
+                  case 25: {
+                    f = h;
+                    continue a;
+                  }
+                  case 21:
+                    if (b & ((e << 24) >> 24 == 9)) {
+                      k = 12;
+                      break a;
+                    } else {
+                      f = h;
+                      continue a;
+                    }
+                  case 22:
+                  case 26: {
+                    if (!b) {
+                      k = 12;
+                      break a;
+                    }
+                    if ((e << 24) >> 24 >= 0) {
+                      f = h;
+                      continue a;
+                    }
+                    break;
+                  }
+                  default:
+                    if (!b) {
+                      k = 12;
+                      break a;
+                    }
+                }
+                switch (((e << 24) >> 24) | 0) {
+                  case 64:
+                  case 36: {
+                    f = h;
+                    break;
+                  }
+                  default: {
+                    k = 12;
+                    break a;
+                  }
+                }
+              }
+              if ((k | 0) == 12) {
+                c[g >> 2] = h;
+                f = 0;
+              }
+              return f | 0;
+            }
+            function H$(b, e, f, g, h) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              j = c[e >> 2] | 0;
+              k = (j + ((f - j) & -2)) | 0;
+              l = k;
+              m = h;
+              a: while (1) {
+                if (j >>> 0 >= k >>> 0) {
+                  b = 0;
+                  break;
+                }
+                i = a[j >> 0] | 0;
+                b = a[(j + 1) >> 0] | 0;
+                f = b & 255;
+                switch ((b << 24) >> 24) {
+                  case 0: {
+                    if ((i << 24) >> 24 > -1) {
+                      b = c[g >> 2] | 0;
+                      if ((b | 0) == (h | 0)) {
+                        b = 2;
+                        break a;
+                      }
+                      c[g >> 2] = b + 1;
+                      a[b >> 0] = i;
+                      b = j;
+                    } else n = 7;
+                    break;
+                  }
+                  case 7:
+                  case 6:
+                  case 5:
+                  case 4:
+                  case 3:
+                  case 2:
+                  case 1: {
+                    n = 7;
+                    break;
+                  }
+                  case -37:
+                  case -38:
+                  case -39:
+                  case -40: {
+                    b = c[g >> 2] | 0;
+                    if (((m - b) | 0) < 4) {
+                      b = 2;
+                      break a;
+                    }
+                    if (((l - j) | 0) < 4) {
+                      b = 1;
+                      break a;
+                    }
+                    o = i & 255;
+                    i = ((((f << 2) & 12) | (o >>> 6)) + 1) | 0;
+                    c[g >> 2] = b + 1;
+                    a[b >> 0] = (i >>> 2) | 240;
+                    b = c[g >> 2] | 0;
+                    c[g >> 2] = b + 1;
+                    a[b >> 0] = ((o >>> 2) & 15) | ((i << 4) & 48) | 128;
+                    b = (j + 2) | 0;
+                    i = d[b >> 0] | 0;
+                    f = (((o << 4) & 48) | (i >>> 6) | ((a[(j + 3) >> 0] << 2) & 12) | 128) & 255;
+                    j = c[g >> 2] | 0;
+                    c[g >> 2] = j + 1;
+                    a[j >> 0] = f;
+                    j = c[g >> 2] | 0;
+                    c[g >> 2] = j + 1;
+                    a[j >> 0] = (i & 63) | 128;
+                    break;
+                  }
+                  default: {
+                    b = c[g >> 2] | 0;
+                    if (((m - b) | 0) < 3) {
+                      b = 2;
+                      break a;
+                    }
+                    c[g >> 2] = b + 1;
+                    a[b >> 0] = (f >>> 4) | 224;
+                    o = i & 255;
+                    b = c[g >> 2] | 0;
+                    c[g >> 2] = b + 1;
+                    a[b >> 0] = (o >>> 6) | ((f << 2) & 60) | 128;
+                    b = c[g >> 2] | 0;
+                    c[g >> 2] = b + 1;
+                    a[b >> 0] = (o & 63) | 128;
+                    b = j;
+                  }
+                }
+                if ((n | 0) == 7) {
+                  n = 0;
+                  b = c[g >> 2] | 0;
+                  if (((m - b) | 0) < 2) {
+                    b = 2;
+                    break;
+                  }
+                  o = i & 255;
+                  c[g >> 2] = b + 1;
+                  a[b >> 0] = (o >>> 6) | (f << 2) | 192;
+                  b = c[g >> 2] | 0;
+                  c[g >> 2] = b + 1;
+                  a[b >> 0] = (o & 63) | 128;
+                  b = j;
+                }
+                j = (b + 2) | 0;
+              }
+              c[e >> 2] = j;
+              return b | 0;
+            }
+            function I$(e, f, g, h, i) {
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              i = i | 0;
+              var j = 0,
+                k = 0,
+                l = 0;
+              j = c[f >> 2] | 0;
+              l = (g - j) & -2;
+              e = (j + l) | 0;
+              if ((l | 0) > ((i - (c[h >> 2] | 0)) | 0)) {
+                k = (e + -2) | 0;
+                g = ((a[(k + 1) >> 0] & -8) << 24) >> 24 == -40;
+                l = g & 1;
+                e = g ? k : e;
+              } else l = 0;
+              g = j;
+              while (1) {
+                j = g >>> 0 < e >>> 0;
+                k = c[h >> 2] | 0;
+                if (!(j & (k >>> 0 < i >>> 0))) break;
+                j = (((d[(g + 1) >> 0] | 0) << 8) | (d[g >> 0] | 0)) & 65535;
+                c[h >> 2] = k + 2;
+                b[k >> 1] = j;
+                k = ((c[f >> 2] | 0) + 2) | 0;
+                c[f >> 2] = k;
+                g = k;
+              }
+              return (((k | 0) != (i | 0)) | (j ^ 1) ? l : 2) | 0;
+            }
+            function J$(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0;
+              switch ((a << 24) >> 24) {
+                case -37:
+                case -38:
+                case -39:
+                case -40: {
+                  a = 7;
+                  break;
+                }
+                case -33:
+                case -34:
+                case -35:
+                case -36: {
+                  a = 8;
+                  break;
+                }
+                case -1: {
+                  if ((b & 255) > 253) a = 0;
+                  else c = 4;
+                  break;
+                }
+                default:
+                  c = 4;
+              }
+              if ((c | 0) == 4) a = 29;
+              return a | 0;
+            }
+            function K$(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              l = f;
+              j = (l - e) | 0;
+              a: do
+                if ((j | 0) > 1) {
+                  k = a[(e + 1) >> 0] | 0;
+                  if (!((k << 24) >> 24)) {
+                    i = a[e >> 0] | 0;
+                    h = d[(b + 72 + (i & 255)) >> 0] | 0;
+                  } else {
+                    i = a[e >> 0] | 0;
+                    h = J$(k, i) | 0;
+                  }
+                  switch (h | 0) {
+                    case 29: {
+                      j = i & 255;
+                      if (
+                        !(
+                          (1 << (j & 31)) &
+                          c[(56940 + (((j >>> 5) | ((d[(143788 + (k & 255)) >> 0] | 0) << 3)) << 2)) >> 2]
+                        )
+                      ) {
+                        c[g >> 2] = e;
+                        b = 0;
+                        break a;
+                      }
+                      break;
+                    }
+                    case 24:
+                    case 22:
+                      break;
+                    case 5: {
+                      c[g >> 2] = e;
+                      b = 0;
+                      break a;
+                    }
+                    case 6: {
+                      if ((j | 0) < 3) {
+                        b = -2;
+                        break a;
+                      }
+                      c[g >> 2] = e;
+                      b = 0;
+                      break a;
+                    }
+                    case 7: {
+                      if ((j | 0) < 4) {
+                        b = -2;
+                        break a;
+                      }
+                      c[g >> 2] = e;
+                      b = 0;
+                      break a;
+                    }
+                    case 19: {
+                      b = M$(b, (e + 2) | 0, f, g) | 0;
+                      break a;
+                    }
+                    default: {
+                      c[g >> 2] = e;
+                      b = 0;
+                      break a;
+                    }
+                  }
+                  k = (b + 72) | 0;
+                  j = e;
+                  b: while (1) {
+                    i = (j + 2) | 0;
+                    e = (l - i) | 0;
+                    if ((e | 0) <= 1) {
+                      b = -1;
+                      break a;
+                    }
+                    b = a[(j + 3) >> 0] | 0;
+                    h = a[i >> 0] | 0;
+                    if (!((b << 24) >> 24)) f = d[(k + (h & 255)) >> 0] | 0;
+                    else f = J$(b, h) | 0;
+                    switch (f | 0) {
+                      case 27:
+                      case 26:
+                      case 25:
+                      case 24:
+                      case 22: {
+                        j = i;
+                        continue b;
+                      }
+                      case 5: {
+                        h = 23;
+                        break b;
+                      }
+                      case 6: {
+                        h = 24;
+                        break b;
+                      }
+                      case 7: {
+                        h = 26;
+                        break b;
+                      }
+                      case 18: {
+                        h = 28;
+                        break b;
+                      }
+                      case 29:
+                        break;
+                      default: {
+                        h = 29;
+                        break b;
+                      }
+                    }
+                    e = h & 255;
+                    if (
+                      !(
+                        (1 << (e & 31)) &
+                        c[(56940 + (((e >>> 5) | ((d[(144044 + (b & 255)) >> 0] | 0) << 3)) << 2)) >> 2]
+                      )
+                    ) {
+                      h = 22;
+                      break;
+                    } else j = i;
+                  }
+                  if ((h | 0) == 22) {
+                    c[g >> 2] = i;
+                    b = 0;
+                    break;
+                  } else if ((h | 0) == 23) {
+                    c[g >> 2] = i;
+                    b = 0;
+                    break;
+                  } else if ((h | 0) == 24) {
+                    if ((e | 0) < 3) {
+                      b = -2;
+                      break;
+                    }
+                    c[g >> 2] = i;
+                    b = 0;
+                    break;
+                  } else if ((h | 0) == 26) {
+                    if ((e | 0) < 4) {
+                      b = -2;
+                      break;
+                    }
+                    c[g >> 2] = i;
+                    b = 0;
+                    break;
+                  } else if ((h | 0) == 28) {
+                    c[g >> 2] = j + 4;
+                    b = 9;
+                    break;
+                  } else if ((h | 0) == 29) {
+                    c[g >> 2] = i;
+                    b = 0;
+                    break;
+                  }
+                } else b = -1;
+              while (0);
+              return b | 0;
+            }
+            function L$(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              j = (f - e) | 0;
+              a: do
+                if ((j | 0) > 1) {
+                  k = a[(e + 1) >> 0] | 0;
+                  if (!((k << 24) >> 24)) {
+                    i = a[e >> 0] | 0;
+                    h = d[(b + 72 + (i & 255)) >> 0] | 0;
+                  } else {
+                    i = a[e >> 0] | 0;
+                    h = J$(k, i) | 0;
+                  }
+                  switch (h | 0) {
+                    case 29: {
+                      l = i & 255;
+                      if (
+                        !(
+                          (1 << (l & 31)) &
+                          c[(56940 + (((l >>> 5) | ((d[(143788 + (k & 255)) >> 0] | 0) << 3)) << 2)) >> 2]
+                        )
+                      ) {
+                        c[g >> 2] = e;
+                        f = 0;
+                        break a;
+                      }
+                      break;
+                    }
+                    case 24:
+                    case 22:
+                      break;
+                    case 5: {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    case 6: {
+                      if ((j | 0) < 3) {
+                        f = -2;
+                        break a;
+                      }
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    case 7: {
+                      if ((j | 0) < 4) {
+                        f = -2;
+                        break a;
+                      }
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    case 30:
+                    case 9:
+                    case 10:
+                    case 21: {
+                      c[g >> 2] = e;
+                      f = 22;
+                      break a;
+                    }
+                    default: {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                  }
+                  l = (b + 72) | 0;
+                  b = e;
+                  b: while (1) {
+                    k = (b + 2) | 0;
+                    e = (f - k) | 0;
+                    if ((e | 0) <= 1) {
+                      f = -1;
+                      break a;
+                    }
+                    h = a[(b + 3) >> 0] | 0;
+                    i = a[k >> 0] | 0;
+                    if (!((h << 24) >> 24)) j = d[(l + (i & 255)) >> 0] | 0;
+                    else j = J$(h, i) | 0;
+                    switch (j | 0) {
+                      case 27:
+                      case 26:
+                      case 25:
+                      case 24:
+                      case 22: {
+                        b = k;
+                        continue b;
+                      }
+                      case 5: {
+                        h = 23;
+                        break b;
+                      }
+                      case 6: {
+                        h = 24;
+                        break b;
+                      }
+                      case 7: {
+                        h = 26;
+                        break b;
+                      }
+                      case 18: {
+                        h = 28;
+                        break b;
+                      }
+                      case 29:
+                        break;
+                      default: {
+                        h = 29;
+                        break b;
+                      }
+                    }
+                    e = i & 255;
+                    if (
+                      !(
+                        (1 << (e & 31)) &
+                        c[(56940 + (((e >>> 5) | ((d[(144044 + (h & 255)) >> 0] | 0) << 3)) << 2)) >> 2]
+                      )
+                    ) {
+                      h = 22;
+                      break;
+                    } else b = k;
+                  }
+                  if ((h | 0) == 22) {
+                    c[g >> 2] = k;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 23) {
+                    c[g >> 2] = k;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 24) {
+                    if ((e | 0) < 3) {
+                      f = -2;
+                      break;
+                    }
+                    c[g >> 2] = k;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 26) {
+                    if ((e | 0) < 4) {
+                      f = -2;
+                      break;
+                    }
+                    c[g >> 2] = k;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 28) {
+                    c[g >> 2] = b + 4;
+                    f = 28;
+                    break;
+                  } else if ((h | 0) == 29) {
+                    c[g >> 2] = k;
+                    f = 0;
+                    break;
+                  }
+                } else f = -1;
+              while (0);
+              return f | 0;
+            }
+            function M$(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = f;
+              a: do
+                if (((k - e) | 0) > 1) {
+                  i = a[(e + 1) >> 0] | 0;
+                  h = a[e >> 0] | 0;
+                  do
+                    if (!((i << 24) >> 24))
+                      if ((h << 24) >> 24 == 120) {
+                        h = N$(b, (e + 2) | 0, f, g) | 0;
+                        break a;
+                      } else {
+                        h = d[(b + 72 + (h & 255)) >> 0] | 0;
+                        break;
+                      }
+                    else h = J$(i, h) | 0;
+                  while (0);
+                  if ((h | 0) != 25) {
+                    c[g >> 2] = e;
+                    h = 0;
+                    break;
+                  }
+                  j = (b + 72) | 0;
+                  b = e;
+                  b: while (1) {
+                    i = (b + 2) | 0;
+                    if (((k - i) | 0) <= 1) {
+                      h = -1;
+                      break a;
+                    }
+                    h = a[(b + 3) >> 0] | 0;
+                    f = a[i >> 0] | 0;
+                    if (!((h << 24) >> 24)) h = d[(j + (f & 255)) >> 0] | 0;
+                    else h = J$(h, f) | 0;
+                    switch (h | 0) {
+                      case 25: {
+                        b = i;
+                        break;
+                      }
+                      case 18: {
+                        f = 15;
+                        break b;
+                      }
+                      default: {
+                        f = 16;
+                        break b;
+                      }
+                    }
+                  }
+                  if ((f | 0) == 15) {
+                    c[g >> 2] = b + 4;
+                    h = 10;
+                    break;
+                  } else if ((f | 0) == 16) {
+                    c[g >> 2] = i;
+                    h = 0;
+                    break;
+                  }
+                } else h = -1;
+              while (0);
+              return h | 0;
+            }
+            function N$(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0;
+              a: do
+                if (((f - e) | 0) > 1) {
+                  h = a[(e + 1) >> 0] | 0;
+                  if (!((h << 24) >> 24)) h = d[(b + 72 + (d[e >> 0] | 0)) >> 0] | 0;
+                  else h = J$(h, a[e >> 0] | 0) | 0;
+                  if (((h & -2) | 0) != 24) {
+                    c[g >> 2] = e;
+                    f = 0;
+                    break;
+                  }
+                  j = (b + 72) | 0;
+                  b: while (1) {
+                    i = (e + 2) | 0;
+                    if (((f - i) | 0) <= 1) {
+                      f = -1;
+                      break a;
+                    }
+                    h = a[(e + 3) >> 0] | 0;
+                    b = a[i >> 0] | 0;
+                    if (!((h << 24) >> 24)) h = d[(j + (b & 255)) >> 0] | 0;
+                    else h = J$(h, b) | 0;
+                    switch (h | 0) {
+                      case 24:
+                      case 25: {
+                        e = i;
+                        break;
+                      }
+                      case 18: {
+                        h = 13;
+                        break b;
+                      }
+                      default: {
+                        h = 14;
+                        break b;
+                      }
+                    }
+                  }
+                  if ((h | 0) == 13) {
+                    c[g >> 2] = e + 4;
+                    f = 10;
+                    break;
+                  } else if ((h | 0) == 14) {
+                    c[g >> 2] = i;
+                    f = 0;
+                    break;
+                  }
+                } else f = -1;
+              while (0);
+              return f | 0;
+            }
+            function O$(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              o = f;
+              j = (o - e) | 0;
+              a: do
+                if ((j | 0) > 1) {
+                  k = a[(e + 1) >> 0] | 0;
+                  if (!((k << 24) >> 24)) {
+                    i = a[e >> 0] | 0;
+                    h = d[(b + 72 + (i & 255)) >> 0] | 0;
+                  } else {
+                    i = a[e >> 0] | 0;
+                    h = J$(k, i) | 0;
+                  }
+                  switch (h | 0) {
+                    case 29: {
+                      m = i & 255;
+                      if (
+                        !((1 << (m & 31)) & c[(56940 + (((m >>> 5) | (d[(143788 + (k & 255)) >> 0] << 3)) << 2)) >> 2])
+                      ) {
+                        c[g >> 2] = e;
+                        h = 0;
+                        break a;
+                      }
+                      break;
+                    }
+                    case 24:
+                    case 22:
+                      break;
+                    case 5: {
+                      c[g >> 2] = e;
+                      h = 0;
+                      break a;
+                    }
+                    case 6: {
+                      if ((j | 0) < 3) {
+                        h = -2;
+                        break a;
+                      }
+                      c[g >> 2] = e;
+                      h = 0;
+                      break a;
+                    }
+                    case 7: {
+                      if ((j | 0) < 4) {
+                        h = -2;
+                        break a;
+                      }
+                      c[g >> 2] = e;
+                      h = 0;
+                      break a;
+                    }
+                    case 16: {
+                      i = (e + 2) | 0;
+                      if (((o - i) | 0) <= 1) {
+                        h = -1;
+                        break a;
+                      }
+                      h = a[(e + 3) >> 0] | 0;
+                      if (!((h << 24) >> 24)) h = d[(b + 72 + (d[i >> 0] | 0)) >> 0] | 0;
+                      else h = J$(h, a[i >> 0] | 0) | 0;
+                      switch (h | 0) {
+                        case 27: {
+                          h = P$(b, (e + 4) | 0, f, g) | 0;
+                          break a;
+                        }
+                        case 20: {
+                          h = Q$((e + 4) | 0, f, g) | 0;
+                          break a;
+                        }
+                        default: {
+                          c[g >> 2] = i;
+                          h = 0;
+                          break a;
+                        }
+                      }
+                    }
+                    case 15: {
+                      h = R$(b, (e + 2) | 0, f, g) | 0;
+                      break a;
+                    }
+                    case 17: {
+                      h = S$(b, (e + 2) | 0, f, g) | 0;
+                      break a;
+                    }
+                    default: {
+                      c[g >> 2] = e;
+                      h = 0;
+                      break a;
+                    }
+                  }
+                  m = (b + 72) | 0;
+                  l = 0;
+                  h = (e + 2) | 0;
+                  b: while (1) {
+                    c: while (1) {
+                      i = (o - h) | 0;
+                      if ((i | 0) <= 1) {
+                        h = -1;
+                        break a;
+                      }
+                      j = a[(h + 1) >> 0] | 0;
+                      k = a[h >> 0] | 0;
+                      if (!((j << 24) >> 24)) e = d[(m + (k & 255)) >> 0] | 0;
+                      else e = J$(j, k) | 0;
+                      switch (e | 0) {
+                        case 5: {
+                          n = 34;
+                          break b;
+                        }
+                        case 6: {
+                          n = 35;
+                          break b;
+                        }
+                        case 7: {
+                          n = 37;
+                          break b;
+                        }
+                        case 10:
+                        case 9:
+                        case 21: {
+                          n = 55;
+                          break b;
+                        }
+                        case 11: {
+                          n = 69;
+                          break b;
+                        }
+                        case 17:
+                          break b;
+                        case 23:
+                          break c;
+                        case 29: {
+                          e = k & 255;
+                          if (
+                            !(
+                              (1 << (e & 31)) &
+                              c[(56940 + (((e >>> 5) | (d[(144044 + (j & 255)) >> 0] << 3)) << 2)) >> 2]
+                            )
+                          ) {
+                            n = 32;
+                            break b;
+                          }
+                          break;
+                        }
+                        case 27:
+                        case 26:
+                        case 25:
+                        case 24:
+                        case 22:
+                          break;
+                        default: {
+                          n = 75;
+                          break b;
+                        }
+                      }
+                      h = (h + 2) | 0;
+                    }
+                    if (l | 0) {
+                      n = 40;
+                      break;
+                    }
+                    k = (h + 2) | 0;
+                    e = (o - k) | 0;
+                    if ((e | 0) <= 1) {
+                      h = -1;
+                      break a;
+                    }
+                    l = a[(h + 3) >> 0] | 0;
+                    i = a[k >> 0] | 0;
+                    if (!((l << 24) >> 24)) j = d[(m + (i & 255)) >> 0] | 0;
+                    else j = J$(l, i) | 0;
+                    switch (j | 0) {
+                      case 5: {
+                        n = 49;
+                        break b;
+                      }
+                      case 6: {
+                        n = 50;
+                        break b;
+                      }
+                      case 7: {
+                        n = 52;
+                        break b;
+                      }
+                      case 29: {
+                        e = i & 255;
+                        if (
+                          !(
+                            (1 << (e & 31)) &
+                            c[(56940 + (((e >>> 5) | (d[(143788 + (l & 255)) >> 0] << 3)) << 2)) >> 2]
+                          )
+                        ) {
+                          n = 47;
+                          break b;
+                        }
+                        break;
+                      }
+                      case 24:
+                      case 22:
+                        break;
+                      default: {
+                        n = 54;
+                        break b;
+                      }
+                    }
+                    l = 1;
+                    h = (h + 4) | 0;
+                  }
+                  d: switch (n | 0) {
+                    case 32: {
+                      c[g >> 2] = h;
+                      h = 0;
+                      break a;
+                    }
+                    case 34: {
+                      c[g >> 2] = h;
+                      h = 0;
+                      break a;
+                    }
+                    case 35: {
+                      if ((i | 0) < 3) {
+                        h = -2;
+                        break a;
+                      }
+                      c[g >> 2] = h;
+                      h = 0;
+                      break a;
+                    }
+                    case 37: {
+                      if ((i | 0) < 4) {
+                        h = -2;
+                        break a;
+                      }
+                      c[g >> 2] = h;
+                      h = 0;
+                      break a;
+                    }
+                    case 40: {
+                      c[g >> 2] = h;
+                      h = 0;
+                      break a;
+                    }
+                    case 47: {
+                      c[g >> 2] = k;
+                      h = 0;
+                      break a;
+                    }
+                    case 49: {
+                      c[g >> 2] = k;
+                      h = 0;
+                      break a;
+                    }
+                    case 50: {
+                      if ((e | 0) < 3) {
+                        h = -2;
+                        break a;
+                      }
+                      c[g >> 2] = k;
+                      h = 0;
+                      break a;
+                    }
+                    case 52: {
+                      if ((e | 0) < 4) {
+                        h = -2;
+                        break a;
+                      }
+                      c[g >> 2] = k;
+                      h = 0;
+                      break a;
+                    }
+                    case 54: {
+                      c[g >> 2] = k;
+                      h = 0;
+                      break a;
+                    }
+                    case 55: {
+                      e: while (1) {
+                        n = 0;
+                        i = (h + 2) | 0;
+                        j = (o - i) | 0;
+                        if ((j | 0) <= 1) {
+                          h = -1;
+                          break a;
+                        }
+                        k = a[(h + 3) >> 0] | 0;
+                        e = a[i >> 0] | 0;
+                        if (!((k << 24) >> 24)) l = d[(m + (e & 255)) >> 0] | 0;
+                        else l = J$(k, e) | 0;
+                        switch (l | 0) {
+                          case 11: {
+                            h = i;
+                            n = 69;
+                            break d;
+                          }
+                          case 17: {
+                            h = i;
+                            break d;
+                          }
+                          case 10:
+                          case 9:
+                          case 21: {
+                            h = i;
+                            n = 55;
+                            break;
+                          }
+                          case 29: {
+                            n = 60;
+                            break e;
+                          }
+                          case 24:
+                          case 22:
+                            break e;
+                          case 5: {
+                            n = 63;
+                            break e;
+                          }
+                          case 6: {
+                            n = 64;
+                            break e;
+                          }
+                          case 7: {
+                            n = 66;
+                            break e;
+                          }
+                          default: {
+                            n = 68;
+                            break e;
+                          }
+                        }
+                      }
+                      if ((n | 0) == 60) {
+                        o = e & 255;
+                        if (
+                          !(
+                            (1 << (o & 31)) &
+                            c[(56940 + (((o >>> 5) | (d[(143788 + (k & 255)) >> 0] << 3)) << 2)) >> 2]
+                          )
+                        ) {
+                          c[g >> 2] = i;
+                          h = 0;
+                          break a;
+                        }
+                      } else if ((n | 0) == 63) {
+                        c[g >> 2] = i;
+                        h = 0;
+                        break a;
+                      } else if ((n | 0) == 64) {
+                        if ((j | 0) < 3) {
+                          h = -2;
+                          break a;
+                        }
+                        c[g >> 2] = i;
+                        h = 0;
+                        break a;
+                      } else if ((n | 0) == 66) {
+                        if ((j | 0) < 4) {
+                          h = -2;
+                          break a;
+                        }
+                        c[g >> 2] = i;
+                        h = 0;
+                        break a;
+                      } else if ((n | 0) == 68) {
+                        c[g >> 2] = i;
+                        h = 0;
+                        break a;
+                      }
+                      h = T$(b, (h + 4) | 0, f, g) | 0;
+                      break a;
+                    }
+                    case 75: {
+                      c[g >> 2] = h;
+                      h = 0;
+                      break a;
+                    }
+                  }
+                  if ((n | 0) == 69) {
+                    c[g >> 2] = h + 2;
+                    h = 2;
+                    break;
+                  }
+                  i = (h + 2) | 0;
+                  if (((o - i) | 0) > 1) {
+                    if ((a[(h + 3) >> 0] | 0) == 0 ? (a[i >> 0] | 0) == 62 : 0) {
+                      c[g >> 2] = h + 4;
+                      h = 4;
+                      break;
+                    }
+                    c[g >> 2] = i;
+                    h = 0;
+                  } else h = -1;
+                } else h = -1;
+              while (0);
+              return h | 0;
+            }
+            function P$(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              j = f;
+              a: do
+                if (((j - e) | 0) > 1) {
+                  if ((a[(e + 1) >> 0] | 0) == 0 ? (a[e >> 0] | 0) == 45 : 0) {
+                    i = (b + 72) | 0;
+                    h = (e + 2) | 0;
+                    b: while (1) {
+                      e = (j - h) | 0;
+                      if ((e | 0) <= 1) {
+                        f = -1;
+                        break a;
+                      }
+                      f = a[(h + 1) >> 0] | 0;
+                      b = a[h >> 0] | 0;
+                      if (!((f << 24) >> 24)) f = d[(i + (b & 255)) >> 0] | 0;
+                      else f = J$(f, b) | 0;
+                      switch (f | 0) {
+                        case 8:
+                        case 1:
+                        case 0: {
+                          k = 16;
+                          break b;
+                        }
+                        case 5: {
+                          h = (h + 2) | 0;
+                          continue b;
+                        }
+                        case 6: {
+                          if ((e | 0) < 3) {
+                            f = -2;
+                            break a;
+                          }
+                          h = (h + 3) | 0;
+                          continue b;
+                        }
+                        case 7: {
+                          if ((e | 0) < 4) {
+                            f = -2;
+                            break a;
+                          }
+                          h = (h + 4) | 0;
+                          continue b;
+                        }
+                        case 27: {
+                          f = (h + 2) | 0;
+                          if (((j - f) | 0) <= 1) {
+                            f = -1;
+                            break a;
+                          }
+                          if (a[(h + 3) >> 0] | 0) {
+                            h = f;
+                            continue b;
+                          }
+                          if ((a[f >> 0] | 0) == 45) break b;
+                          else {
+                            h = f;
+                            continue b;
+                          }
+                        }
+                        default: {
+                          h = (h + 2) | 0;
+                          continue b;
+                        }
+                      }
+                    }
+                    if ((k | 0) == 16) {
+                      c[g >> 2] = h;
+                      f = 0;
+                      break;
+                    }
+                    f = (h + 4) | 0;
+                    if (((j - f) | 0) <= 1) {
+                      f = -1;
+                      break;
+                    }
+                    if ((a[(h + 5) >> 0] | 0) == 0 ? (a[f >> 0] | 0) == 62 : 0) {
+                      c[g >> 2] = h + 6;
+                      f = 13;
+                      break;
+                    }
+                    c[g >> 2] = f;
+                    f = 0;
+                    break;
+                  }
+                  c[g >> 2] = e;
+                  f = 0;
+                } else f = -1;
+              while (0);
+              return f | 0;
+            }
+            function Q$(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              if (((d - b) | 0) > 11) {
+                d = 0;
+                while (1) {
+                  if ((d | 0) >= 6) {
+                    d = 8;
+                    break;
+                  }
+                  if (a[(b + 1) >> 0] | 0) {
+                    d = 0;
+                    break;
+                  }
+                  if ((a[b >> 0] | 0) != (a[(144300 + d) >> 0] | 0)) {
+                    d = 0;
+                    break;
+                  }
+                  d = (d + 1) | 0;
+                  b = (b + 2) | 0;
+                }
+                c[e >> 2] = b;
+              } else d = -1;
+              return d | 0;
+            }
+            function R$(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              q = l;
+              l = (l + 16) | 0;
+              p = q;
+              o = f;
+              j = (o - e) | 0;
+              a: do
+                if ((j | 0) > 1) {
+                  f = a[(e + 1) >> 0] | 0;
+                  if (!((f << 24) >> 24)) {
+                    i = a[e >> 0] | 0;
+                    h = d[(b + 72 + (i & 255)) >> 0] | 0;
+                  } else {
+                    i = a[e >> 0] | 0;
+                    h = J$(f, i) | 0;
+                  }
+                  switch (h | 0) {
+                    case 29: {
+                      m = i & 255;
+                      if (
+                        !((1 << (m & 31)) & c[(56940 + (((m >>> 5) | (d[(143788 + (f & 255)) >> 0] << 3)) << 2)) >> 2])
+                      ) {
+                        c[g >> 2] = e;
+                        f = 0;
+                        break a;
+                      }
+                      break;
+                    }
+                    case 24:
+                    case 22:
+                      break;
+                    case 5: {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    case 6: {
+                      if ((j | 0) < 3) {
+                        f = -2;
+                        break a;
+                      }
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    case 7: {
+                      if ((j | 0) < 4) {
+                        f = -2;
+                        break a;
+                      }
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    default: {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                  }
+                  m = (b + 72) | 0;
+                  k = e;
+                  b: while (1) {
+                    f = (k + 2) | 0;
+                    h = (o - f) | 0;
+                    if ((h | 0) <= 1) {
+                      f = -1;
+                      break a;
+                    }
+                    i = a[(k + 3) >> 0] | 0;
+                    j = a[f >> 0] | 0;
+                    if (!((i << 24) >> 24)) b = d[(m + (j & 255)) >> 0] | 0;
+                    else b = J$(i, j) | 0;
+                    switch (b | 0) {
+                      case 27:
+                      case 26:
+                      case 25:
+                      case 24:
+                      case 22: {
+                        k = f;
+                        continue b;
+                      }
+                      case 5: {
+                        n = 22;
+                        break b;
+                      }
+                      case 6: {
+                        n = 23;
+                        break b;
+                      }
+                      case 7: {
+                        n = 25;
+                        break b;
+                      }
+                      case 10:
+                      case 9:
+                      case 21: {
+                        n = 27;
+                        break b;
+                      }
+                      case 15: {
+                        n = 46;
+                        break b;
+                      }
+                      case 29:
+                        break;
+                      default:
+                        break b;
+                    }
+                    k = j & 255;
+                    if (
+                      !((1 << (k & 31)) & c[(56940 + (((k >>> 5) | (d[(144044 + (i & 255)) >> 0] << 3)) << 2)) >> 2])
+                    ) {
+                      n = 21;
+                      break;
+                    } else k = f;
+                  }
+                  if ((n | 0) == 21) {
+                    c[g >> 2] = f;
+                    f = 0;
+                    break;
+                  } else if ((n | 0) == 22) {
+                    c[g >> 2] = f;
+                    f = 0;
+                    break;
+                  } else if ((n | 0) == 23) {
+                    if ((h | 0) < 3) {
+                      f = -2;
+                      break;
+                    }
+                    c[g >> 2] = f;
+                    f = 0;
+                    break;
+                  } else if ((n | 0) == 25) {
+                    if ((h | 0) < 4) {
+                      f = -2;
+                      break;
+                    }
+                    c[g >> 2] = f;
+                    f = 0;
+                    break;
+                  } else if ((n | 0) == 27) {
+                    if (!(U$(e, f, p) | 0)) {
+                      c[g >> 2] = f;
+                      f = 0;
+                      break;
+                    }
+                    j = (k + 4) | 0;
+                    c: while (1) {
+                      i = (o - j) | 0;
+                      if ((i | 0) <= 1) {
+                        f = -1;
+                        break a;
+                      }
+                      f = a[(j + 1) >> 0] | 0;
+                      h = a[j >> 0] | 0;
+                      if (!((f << 24) >> 24)) f = d[(m + (h & 255)) >> 0] | 0;
+                      else f = J$(f, h) | 0;
+                      switch (f | 0) {
+                        case 8:
+                        case 1:
+                        case 0: {
+                          n = 40;
+                          break c;
+                        }
+                        case 5: {
+                          j = (j + 2) | 0;
+                          continue c;
+                        }
+                        case 6: {
+                          if ((i | 0) < 3) {
+                            f = -2;
+                            break a;
+                          }
+                          j = (j + 3) | 0;
+                          continue c;
+                        }
+                        case 7: {
+                          if ((i | 0) < 4) {
+                            f = -2;
+                            break a;
+                          }
+                          j = (j + 4) | 0;
+                          continue c;
+                        }
+                        case 15: {
+                          f = (j + 2) | 0;
+                          if (((o - f) | 0) <= 1) {
+                            f = -1;
+                            break a;
+                          }
+                          if (a[(j + 3) >> 0] | 0) {
+                            j = f;
+                            continue c;
+                          }
+                          if ((a[f >> 0] | 0) == 62) {
+                            n = 44;
+                            break c;
+                          } else {
+                            j = f;
+                            continue c;
+                          }
+                        }
+                        default: {
+                          j = (j + 2) | 0;
+                          continue c;
+                        }
+                      }
+                    }
+                    if ((n | 0) == 40) {
+                      c[g >> 2] = j;
+                      f = 0;
+                      break;
+                    } else if ((n | 0) == 44) {
+                      c[g >> 2] = j + 4;
+                      f = c[p >> 2] | 0;
+                      break;
+                    }
+                  } else if ((n | 0) == 46) {
+                    if (!(U$(e, f, p) | 0)) {
+                      c[g >> 2] = f;
+                      f = 0;
+                      break;
+                    }
+                    f = (k + 4) | 0;
+                    if (((o - f) | 0) <= 1) {
+                      f = -1;
+                      break;
+                    }
+                    if ((a[(k + 5) >> 0] | 0) == 0 ? (a[f >> 0] | 0) == 62 : 0) {
+                      c[g >> 2] = k + 6;
+                      f = c[p >> 2] | 0;
+                      break;
+                    }
+                  }
+                  c[g >> 2] = f;
+                  f = 0;
+                } else f = -1;
+              while (0);
+              l = q;
+              return f | 0;
+            }
+            function S$(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              j = (f - e) | 0;
+              a: do
+                if ((j | 0) > 1) {
+                  k = a[(e + 1) >> 0] | 0;
+                  if (!((k << 24) >> 24)) {
+                    i = a[e >> 0] | 0;
+                    h = d[(b + 72 + (i & 255)) >> 0] | 0;
+                  } else {
+                    i = a[e >> 0] | 0;
+                    h = J$(k, i) | 0;
+                  }
+                  switch (h | 0) {
+                    case 29: {
+                      l = i & 255;
+                      if (
+                        !(
+                          (1 << (l & 31)) &
+                          c[(56940 + (((l >>> 5) | ((d[(143788 + (k & 255)) >> 0] | 0) << 3)) << 2)) >> 2]
+                        )
+                      ) {
+                        c[g >> 2] = e;
+                        f = 0;
+                        break a;
+                      }
+                      break;
+                    }
+                    case 24:
+                    case 22:
+                      break;
+                    case 5: {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    case 6: {
+                      if ((j | 0) < 3) {
+                        f = -2;
+                        break a;
+                      }
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    case 7: {
+                      if ((j | 0) < 4) {
+                        f = -2;
+                        break a;
+                      }
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    default: {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                  }
+                  l = (b + 72) | 0;
+                  b = e;
+                  b: while (1) {
+                    j = (b + 2) | 0;
+                    e = (f - j) | 0;
+                    if ((e | 0) <= 1) {
+                      f = -1;
+                      break a;
+                    }
+                    h = a[(b + 3) >> 0] | 0;
+                    i = a[j >> 0] | 0;
+                    if (!((h << 24) >> 24)) k = d[(l + (i & 255)) >> 0] | 0;
+                    else k = J$(h, i) | 0;
+                    switch (k | 0) {
+                      case 23:
+                      case 27:
+                      case 26:
+                      case 25:
+                      case 24:
+                      case 22: {
+                        b = j;
+                        continue b;
+                      }
+                      case 5: {
+                        h = 22;
+                        break b;
+                      }
+                      case 6: {
+                        h = 23;
+                        break b;
+                      }
+                      case 7: {
+                        h = 25;
+                        break b;
+                      }
+                      case 10:
+                      case 9:
+                      case 21: {
+                        h = 27;
+                        break b;
+                      }
+                      case 11: {
+                        h = 34;
+                        break b;
+                      }
+                      case 29:
+                        break;
+                      default: {
+                        h = 35;
+                        break b;
+                      }
+                    }
+                    e = i & 255;
+                    if (
+                      !(
+                        (1 << (e & 31)) &
+                        c[(56940 + (((e >>> 5) | ((d[(144044 + (h & 255)) >> 0] | 0) << 3)) << 2)) >> 2]
+                      )
+                    ) {
+                      h = 21;
+                      break;
+                    } else b = j;
+                  }
+                  if ((h | 0) == 21) {
+                    c[g >> 2] = j;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 22) {
+                    c[g >> 2] = j;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 23) {
+                    if ((e | 0) < 3) {
+                      f = -2;
+                      break;
+                    }
+                    c[g >> 2] = j;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 25) {
+                    if ((e | 0) < 4) {
+                      f = -2;
+                      break;
+                    }
+                    c[g >> 2] = j;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 27) {
+                    c: while (1) {
+                      k = (j + 2) | 0;
+                      if (((f - k) | 0) <= 1) {
+                        f = -1;
+                        break a;
+                      }
+                      h = a[(j + 3) >> 0] | 0;
+                      i = a[k >> 0] | 0;
+                      if (!((h << 24) >> 24)) h = d[(l + (i & 255)) >> 0] | 0;
+                      else h = J$(h, i) | 0;
+                      switch (h | 0) {
+                        case 10:
+                        case 9:
+                        case 21: {
+                          j = k;
+                          h = 27;
+                          break;
+                        }
+                        case 11: {
+                          h = 32;
+                          break c;
+                        }
+                        default: {
+                          h = 33;
+                          break c;
+                        }
+                      }
+                    }
+                    if ((h | 0) == 32) {
+                      c[g >> 2] = j + 4;
+                      f = 5;
+                      break;
+                    } else if ((h | 0) == 33) {
+                      c[g >> 2] = k;
+                      f = 0;
+                      break;
+                    }
+                  } else if ((h | 0) == 34) {
+                    c[g >> 2] = b + 4;
+                    f = 5;
+                    break;
+                  } else if ((h | 0) == 35) {
+                    c[g >> 2] = j;
+                    f = 0;
+                    break;
+                  }
+                } else f = -1;
+              while (0);
+              return f | 0;
+            }
+            function T$(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0;
+              s = l;
+              l = (l + 16) | 0;
+              q = s;
+              c[q >> 2] = e;
+              r = f;
+              o = (b + 72) | 0;
+              h = 0;
+              a: while (1) {
+                b: while (1) {
+                  m = (r - e) | 0;
+                  if ((m | 0) <= 1) {
+                    e = -1;
+                    break a;
+                  }
+                  i = a[(e + 1) >> 0] | 0;
+                  j = a[e >> 0] | 0;
+                  if (!((i << 24) >> 24)) k = d[(o + (j & 255)) >> 0] | 0;
+                  else k = J$(i, j) | 0;
+                  switch (k | 0) {
+                    case 5: {
+                      p = 11;
+                      break a;
+                    }
+                    case 6: {
+                      p = 12;
+                      break a;
+                    }
+                    case 7: {
+                      p = 14;
+                      break a;
+                    }
+                    case 23: {
+                      p = 16;
+                      break b;
+                    }
+                    case 10:
+                    case 9:
+                    case 21: {
+                      p = 31;
+                      break b;
+                    }
+                    case 14: {
+                      p = 37;
+                      break b;
+                    }
+                    case 29: {
+                      n = j & 255;
+                      if (
+                        !((1 << (n & 31)) & c[(56940 + (((n >>> 5) | (d[(144044 + (i & 255)) >> 0] << 3)) << 2)) >> 2])
+                      ) {
+                        p = 9;
+                        break a;
+                      }
+                      break;
+                    }
+                    case 27:
+                    case 26:
+                    case 25:
+                    case 24:
+                    case 22:
+                      break;
+                    default: {
+                      p = 89;
+                      break a;
+                    }
+                  }
+                  n = (e + 2) | 0;
+                  c[q >> 2] = n;
+                  e = n;
+                }
+                c: do
+                  if ((p | 0) == 16) {
+                    p = 0;
+                    if (h | 0) {
+                      p = 17;
+                      break a;
+                    }
+                    h = (e + 2) | 0;
+                    c[q >> 2] = h;
+                    i = h;
+                    j = (r - i) | 0;
+                    if ((j | 0) <= 1) {
+                      e = -1;
+                      break a;
+                    }
+                    k = a[(e + 3) >> 0] | 0;
+                    m = a[h >> 0] | 0;
+                    if (!((k << 24) >> 24)) n = d[(o + (m & 255)) >> 0] | 0;
+                    else n = J$(k, m) | 0;
+                    switch (n | 0) {
+                      case 5: {
+                        p = 25;
+                        break a;
+                      }
+                      case 6: {
+                        p = 26;
+                        break a;
+                      }
+                      case 7: {
+                        p = 28;
+                        break a;
+                      }
+                      case 24:
+                      case 22: {
+                        h = 1;
+                        break c;
+                      }
+                      case 29:
+                        break;
+                      default: {
+                        p = 30;
+                        break a;
+                      }
+                    }
+                    n = m & 255;
+                    if (
+                      !((1 << (n & 31)) & c[(56940 + (((n >>> 5) | (d[(143788 + (k & 255)) >> 0] << 3)) << 2)) >> 2])
+                    ) {
+                      p = 24;
+                      break a;
+                    } else h = 1;
+                  } else if ((p | 0) == 31)
+                    while (1) {
+                      p = 0;
+                      i = (e + 2) | 0;
+                      c[q >> 2] = i;
+                      j = i;
+                      if (((r - j) | 0) <= 1) {
+                        e = -1;
+                        break a;
+                      }
+                      e = a[(e + 3) >> 0] | 0;
+                      h = a[i >> 0] | 0;
+                      if (!((e << 24) >> 24)) e = d[(o + (h & 255)) >> 0] | 0;
+                      else e = J$(e, h) | 0;
+                      switch (e | 0) {
+                        case 14: {
+                          e = i;
+                          p = 37;
+                          break c;
+                        }
+                        case 9:
+                        case 10:
+                        case 21: {
+                          e = i;
+                          p = 31;
+                          break;
+                        }
+                        default: {
+                          p = 36;
+                          break a;
+                        }
+                      }
+                    }
+                while (0);
+                d: do
+                  if ((p | 0) == 37) {
+                    while (1) {
+                      p = 0;
+                      j = (e + 2) | 0;
+                      c[q >> 2] = j;
+                      k = j;
+                      if (((r - k) | 0) <= 1) {
+                        e = -1;
+                        break a;
+                      }
+                      h = a[(e + 3) >> 0] | 0;
+                      i = a[j >> 0] | 0;
+                      if (!((h << 24) >> 24)) m = d[(o + (i & 255)) >> 0] | 0;
+                      else m = J$(h, i) | 0;
+                      if ((m | 1 | 0) == 13) break;
+                      switch (m | 0) {
+                        case 9:
+                        case 10:
+                        case 21: {
+                          e = j;
+                          p = 37;
+                          break;
+                        }
+                        default: {
+                          p = 43;
+                          break a;
+                        }
+                      }
+                    }
+                    e = (e + 4) | 0;
+                    c[q >> 2] = e;
+                    e: while (1) {
+                      j = (r - e) | 0;
+                      if ((j | 0) <= 1) {
+                        e = -1;
+                        break a;
+                      }
+                      h = a[(e + 1) >> 0] | 0;
+                      i = a[e >> 0] | 0;
+                      if (!((h << 24) >> 24)) h = d[(o + (i & 255)) >> 0] | 0;
+                      else h = J$(h, i) | 0;
+                      if ((h | 0) == (m | 0)) break;
+                      switch (h | 0) {
+                        case 8:
+                        case 1:
+                        case 0: {
+                          p = 56;
+                          break a;
+                        }
+                        case 2: {
+                          p = 61;
+                          break a;
+                        }
+                        case 5: {
+                          n = (e + 2) | 0;
+                          c[q >> 2] = n;
+                          e = n;
+                          continue e;
+                        }
+                        case 6: {
+                          if ((j | 0) < 3) {
+                            e = -2;
+                            break a;
+                          }
+                          n = (e + 3) | 0;
+                          c[q >> 2] = n;
+                          e = n;
+                          continue e;
+                        }
+                        case 7: {
+                          if ((j | 0) < 4) {
+                            e = -2;
+                            break a;
+                          }
+                          n = (e + 4) | 0;
+                          c[q >> 2] = n;
+                          e = n;
+                          continue e;
+                        }
+                        case 3: {
+                          e = K$(b, (e + 2) | 0, f, q) | 0;
+                          if ((e | 0) < 1) {
+                            p = 59;
+                            break a;
+                          }
+                          e = c[q >> 2] | 0;
+                          continue e;
+                        }
+                        default: {
+                          n = (e + 2) | 0;
+                          c[q >> 2] = n;
+                          e = n;
+                          continue e;
+                        }
+                      }
+                    }
+                    i = (e + 2) | 0;
+                    c[q >> 2] = i;
+                    k = i;
+                    if (((r - k) | 0) <= 1) {
+                      e = -1;
+                      break a;
+                    }
+                    h = a[(e + 3) >> 0] | 0;
+                    j = a[i >> 0] | 0;
+                    if (!((h << 24) >> 24)) h = d[(o + (j & 255)) >> 0] | 0;
+                    else h = J$(h, j) | 0;
+                    switch (h | 0) {
+                      case 11: {
+                        p = 81;
+                        break a;
+                      }
+                      case 17: {
+                        p = 82;
+                        break a;
+                      }
+                      case 10:
+                      case 9:
+                      case 21: {
+                        e = i;
+                        break;
+                      }
+                      default: {
+                        p = 68;
+                        break a;
+                      }
+                    }
+                    f: while (1) {
+                      i = (e + 2) | 0;
+                      c[q >> 2] = i;
+                      h = i;
+                      j = (r - h) | 0;
+                      if ((j | 0) <= 1) {
+                        e = -1;
+                        break a;
+                      }
+                      k = a[(e + 3) >> 0] | 0;
+                      m = a[i >> 0] | 0;
+                      if (!((k << 24) >> 24)) n = d[(o + (m & 255)) >> 0] | 0;
+                      else n = J$(k, m) | 0;
+                      switch (n | 0) {
+                        case 5: {
+                          p = 76;
+                          break a;
+                        }
+                        case 6: {
+                          p = 77;
+                          break a;
+                        }
+                        case 7: {
+                          p = 79;
+                          break a;
+                        }
+                        case 11: {
+                          p = 81;
+                          break a;
+                        }
+                        case 17: {
+                          p = 82;
+                          break a;
+                        }
+                        case 24:
+                        case 22: {
+                          h = 0;
+                          break d;
+                        }
+                        case 10:
+                        case 9:
+                        case 21: {
+                          e = i;
+                          break;
+                        }
+                        case 29:
+                          break f;
+                        default: {
+                          p = 87;
+                          break a;
+                        }
+                      }
+                    }
+                    n = m & 255;
+                    if (
+                      !((1 << (n & 31)) & c[(56940 + (((n >>> 5) | (d[(143788 + (k & 255)) >> 0] << 3)) << 2)) >> 2])
+                    ) {
+                      p = 75;
+                      break a;
+                    } else h = 0;
+                  }
+                while (0);
+                e = (e + 4) | 0;
+                c[q >> 2] = e;
+              }
+              switch (p | 0) {
+                case 9: {
+                  c[g >> 2] = e;
+                  e = 0;
+                  break;
+                }
+                case 11: {
+                  c[g >> 2] = e;
+                  e = 0;
+                  break;
+                }
+                case 12: {
+                  if ((m | 0) < 3) e = -2;
+                  else {
+                    c[g >> 2] = e;
+                    e = 0;
+                  }
+                  break;
+                }
+                case 14: {
+                  if ((m | 0) < 4) e = -2;
+                  else {
+                    c[g >> 2] = e;
+                    e = 0;
+                  }
+                  break;
+                }
+                case 17: {
+                  c[g >> 2] = e;
+                  e = 0;
+                  break;
+                }
+                case 24: {
+                  c[g >> 2] = h;
+                  e = 0;
+                  break;
+                }
+                case 25: {
+                  c[g >> 2] = h;
+                  e = 0;
+                  break;
+                }
+                case 26: {
+                  if ((j | 0) < 3) e = -2;
+                  else {
+                    c[g >> 2] = h;
+                    e = 0;
+                  }
+                  break;
+                }
+                case 28: {
+                  if ((j | 0) < 4) e = -2;
+                  else {
+                    c[g >> 2] = h;
+                    e = 0;
+                  }
+                  break;
+                }
+                case 30: {
+                  c[g >> 2] = i;
+                  e = 0;
+                  break;
+                }
+                case 36: {
+                  c[g >> 2] = j;
+                  e = 0;
+                  break;
+                }
+                case 43: {
+                  c[g >> 2] = k;
+                  e = 0;
+                  break;
+                }
+                case 56: {
+                  c[g >> 2] = e;
+                  e = 0;
+                  break;
+                }
+                case 59: {
+                  if (!e) {
+                    c[g >> 2] = c[q >> 2];
+                    e = 0;
+                  }
+                  break;
+                }
+                case 61: {
+                  c[g >> 2] = e;
+                  e = 0;
+                  break;
+                }
+                case 68: {
+                  c[g >> 2] = k;
+                  e = 0;
+                  break;
+                }
+                case 75: {
+                  c[g >> 2] = i;
+                  e = 0;
+                  break;
+                }
+                case 76: {
+                  c[g >> 2] = i;
+                  e = 0;
+                  break;
+                }
+                case 77: {
+                  if ((j | 0) < 3) e = -2;
+                  else {
+                    c[g >> 2] = i;
+                    e = 0;
+                  }
+                  break;
+                }
+                case 79: {
+                  if ((j | 0) < 4) e = -2;
+                  else {
+                    c[g >> 2] = i;
+                    e = 0;
+                  }
+                  break;
+                }
+                case 81: {
+                  c[g >> 2] = e + 4;
+                  e = 1;
+                  break;
+                }
+                case 82: {
+                  h = (i + 2) | 0;
+                  c[q >> 2] = h;
+                  e = h;
+                  if (((r - e) | 0) > 1) {
+                    if ((a[(i + 3) >> 0] | 0) == 0 ? (a[h >> 0] | 0) == 62 : 0) {
+                      c[g >> 2] = i + 4;
+                      e = 3;
+                      break;
+                    }
+                    c[g >> 2] = e;
+                    e = 0;
+                  } else e = -1;
+                  break;
+                }
+                case 87: {
+                  c[g >> 2] = h;
+                  e = 0;
+                  break;
+                }
+                case 89: {
+                  c[g >> 2] = e;
+                  e = 0;
+                  break;
+                }
+              }
+              l = s;
+              return e | 0;
+            }
+            function U$(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              c[e >> 2] = 11;
+              a: do
+                if (((d - b) | 0) == 6 ? (a[(b + 1) >> 0] | 0) == 0 : 0) {
+                  switch (a[b >> 0] | 0) {
+                    case 120: {
+                      d = 0;
+                      break;
+                    }
+                    case 88: {
+                      d = 1;
+                      break;
+                    }
+                    default: {
+                      d = 1;
+                      break a;
+                    }
+                  }
+                  if (!(a[(b + 3) >> 0] | 0)) {
+                    switch (a[(b + 2) >> 0] | 0) {
+                      case 109:
+                        break;
+                      case 77: {
+                        d = 1;
+                        break;
+                      }
+                      default: {
+                        d = 1;
+                        break a;
+                      }
+                    }
+                    if (!(a[(b + 5) >> 0] | 0)) {
+                      switch (a[(b + 4) >> 0] | 0) {
+                        case 108:
+                          break;
+                        case 76: {
+                          d = 0;
+                          break a;
+                        }
+                        default: {
+                          d = 1;
+                          break a;
+                        }
+                      }
+                      if (!d) {
+                        c[e >> 2] = 12;
+                        d = 1;
+                      } else d = 0;
+                    } else d = 1;
+                  } else d = 1;
+                } else d = 1;
+              while (0);
+              return d | 0;
+            }
+            function V$(b, e, f, g, h) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              k = (e + 72) | 0;
+              a: while (1) {
+                b: while (1) {
+                  j = (g - f) | 0;
+                  if ((j | 0) <= 1) {
+                    f = -1;
+                    break a;
+                  }
+                  e = a[(f + 1) >> 0] | 0;
+                  i = a[f >> 0] | 0;
+                  if (!((e << 24) >> 24)) e = d[(k + (i & 255)) >> 0] | 0;
+                  else e = J$(e, i) | 0;
+                  switch (e | 0) {
+                    case 8:
+                    case 1:
+                    case 0: {
+                      l = 10;
+                      break a;
+                    }
+                    case 6: {
+                      l = 9;
+                      break b;
+                    }
+                    case 7: {
+                      l = 19;
+                      break b;
+                    }
+                    case 5: {
+                      f = (f + 2) | 0;
+                      continue b;
+                    }
+                    case 13:
+                    case 12: {
+                      i = (f + 2) | 0;
+                      if ((e | 0) == (b | 0)) {
+                        l = 12;
+                        break a;
+                      } else {
+                        f = i;
+                        continue b;
+                      }
+                    }
+                    default: {
+                      f = (f + 2) | 0;
+                      continue b;
+                    }
+                  }
+                }
+                if ((l | 0) == 9) {
+                  l = 0;
+                  if ((j | 0) < 3) {
+                    f = -2;
+                    break;
+                  } else {
+                    f = (f + 3) | 0;
+                    continue;
+                  }
+                } else if ((l | 0) == 19) {
+                  l = 0;
+                  if ((j | 0) < 4) {
+                    f = -2;
+                    break;
+                  } else {
+                    f = (f + 4) | 0;
+                    continue;
+                  }
+                }
+              }
+              c: do
+                if ((l | 0) == 10) {
+                  c[h >> 2] = f;
+                  f = 0;
+                } else if ((l | 0) == 12)
+                  if (((g - i) | 0) > 1) {
+                    c[h >> 2] = i;
+                    g = a[(f + 3) >> 0] | 0;
+                    f = a[i >> 0] | 0;
+                    if (!((g << 24) >> 24)) f = d[(k + (f & 255)) >> 0] | 0;
+                    else f = J$(g, f) | 0;
+                    switch (f | 0) {
+                      case 20:
+                      case 30:
+                      case 11:
+                      case 10:
+                      case 9:
+                      case 21: {
+                        f = 27;
+                        break c;
+                      }
+                      default: {
+                      }
+                    }
+                    f = 0;
+                  } else f = -27;
+              while (0);
+              return f | 0;
+            }
+            function W$(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              k = f;
+              a: do
+                if (((k - e) | 0) > 1) {
+                  h = a[(e + 1) >> 0] | 0;
+                  if (!((h << 24) >> 24)) h = d[(b + 72 + (d[e >> 0] | 0)) >> 0] | 0;
+                  else h = J$(h, a[e >> 0] | 0) | 0;
+                  switch (h | 0) {
+                    case 27: {
+                      h = P$(b, (e + 2) | 0, f, g) | 0;
+                      break a;
+                    }
+                    case 20: {
+                      c[g >> 2] = e + 2;
+                      h = 33;
+                      break a;
+                    }
+                    case 24:
+                    case 22: {
+                      j = (b + 72) | 0;
+                      b: while (1) {
+                        i = (e + 2) | 0;
+                        f = (k - i) | 0;
+                        if ((f | 0) <= 1) {
+                          h = -1;
+                          break a;
+                        }
+                        h = a[(e + 3) >> 0] | 0;
+                        b = a[i >> 0] | 0;
+                        if (!((h << 24) >> 24)) h = d[(j + (b & 255)) >> 0] | 0;
+                        else h = J$(h, b) | 0;
+                        switch (h | 0) {
+                          case 24:
+                          case 22: {
+                            e = i;
+                            break;
+                          }
+                          case 30: {
+                            l = 15;
+                            break b;
+                          }
+                          case 10:
+                          case 9:
+                          case 21:
+                            break b;
+                          default: {
+                            l = 22;
+                            break b;
+                          }
+                        }
+                      }
+                      if ((l | 0) == 22) {
+                        c[g >> 2] = i;
+                        h = 0;
+                        break a;
+                      }
+                      c: do
+                        if ((l | 0) == 15) {
+                          if ((f | 0) <= 3) {
+                            h = -1;
+                            break a;
+                          }
+                          b = a[(e + 5) >> 0] | 0;
+                          h = a[(e + 4) >> 0] | 0;
+                          if (!((b << 24) >> 24)) h = d[(j + (h & 255)) >> 0] | 0;
+                          else h = J$(b, h) | 0;
+                          switch (h | 0) {
+                            case 30:
+                            case 10:
+                            case 9:
+                            case 21:
+                              break;
+                            default:
+                              break c;
+                          }
+                          c[g >> 2] = i;
+                          h = 0;
+                          break a;
+                        }
+                      while (0);
+                      c[g >> 2] = i;
+                      h = 16;
+                      break a;
+                    }
+                    default: {
+                      c[g >> 2] = e;
+                      h = 0;
+                      break a;
+                    }
+                  }
+                } else h = -1;
+              while (0);
+              return h | 0;
+            }
+            function X$(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              j = (f - e) | 0;
+              a: do
+                if ((j | 0) > 1) {
+                  k = a[(e + 1) >> 0] | 0;
+                  if (!((k << 24) >> 24)) {
+                    i = a[e >> 0] | 0;
+                    h = d[(b + 72 + (i & 255)) >> 0] | 0;
+                  } else {
+                    i = a[e >> 0] | 0;
+                    h = J$(k, i) | 0;
+                  }
+                  switch (h | 0) {
+                    case 29: {
+                      j = i & 255;
+                      if (
+                        !(
+                          (1 << (j & 31)) &
+                          c[(56940 + (((j >>> 5) | ((d[(143788 + (k & 255)) >> 0] | 0) << 3)) << 2)) >> 2]
+                        )
+                      ) {
+                        c[g >> 2] = e;
+                        f = 0;
+                        break a;
+                      }
+                      break;
+                    }
+                    case 24:
+                    case 22:
+                      break;
+                    case 5: {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    case 6: {
+                      if ((j | 0) < 3) {
+                        f = -2;
+                        break a;
+                      }
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    case 7: {
+                      if ((j | 0) < 4) {
+                        f = -2;
+                        break a;
+                      }
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    default: {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                  }
+                  b = (b + 72) | 0;
+                  k = e;
+                  b: while (1) {
+                    h = k;
+                    k = (k + 2) | 0;
+                    e = (f - k) | 0;
+                    if ((e | 0) <= 1) {
+                      f = -20;
+                      break a;
+                    }
+                    h = a[(h + 3) >> 0] | 0;
+                    i = a[k >> 0] | 0;
+                    if (!((h << 24) >> 24)) j = d[(b + (i & 255)) >> 0] | 0;
+                    else j = J$(h, i) | 0;
+                    switch (j | 0) {
+                      case 27:
+                      case 26:
+                      case 25:
+                      case 24:
+                      case 22:
+                        continue b;
+                      case 5: {
+                        h = 22;
+                        break b;
+                      }
+                      case 6: {
+                        h = 23;
+                        break b;
+                      }
+                      case 7: {
+                        h = 25;
+                        break b;
+                      }
+                      case 36:
+                      case 30:
+                      case 11:
+                      case 32:
+                      case 21:
+                      case 10:
+                      case 9: {
+                        h = 27;
+                        break b;
+                      }
+                      case 29:
+                        break;
+                      default: {
+                        h = 28;
+                        break b;
+                      }
+                    }
+                    e = i & 255;
+                    if (
+                      !(
+                        (1 << (e & 31)) &
+                        c[(56940 + (((e >>> 5) | ((d[(144044 + (h & 255)) >> 0] | 0) << 3)) << 2)) >> 2]
+                      )
+                    ) {
+                      h = 21;
+                      break;
+                    }
+                  }
+                  if ((h | 0) == 21) {
+                    c[g >> 2] = k;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 22) {
+                    c[g >> 2] = k;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 23) {
+                    if ((e | 0) < 3) {
+                      f = -2;
+                      break;
+                    }
+                    c[g >> 2] = k;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 25) {
+                    if ((e | 0) < 4) {
+                      f = -2;
+                      break;
+                    }
+                    c[g >> 2] = k;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 27) {
+                    c[g >> 2] = k;
+                    f = 20;
+                    break;
+                  } else if ((h | 0) == 28) {
+                    c[g >> 2] = k;
+                    f = 0;
+                    break;
+                  }
+                } else f = -1;
+              while (0);
+              return f | 0;
+            }
+            function Y$(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              e = Z$(e) | 0;
+              if ((e | 0) == -1) e = 0;
+              else {
+                a[(b + 69) >> 0] = e;
+                c[b >> 2] = 67;
+                c[(b + 4) >> 2] = 68;
+                c[(b + 48) >> 2] = 31;
+                c[(b + 72) >> 2] = d;
+                c[d >> 2] = b;
+                e = 1;
+              }
+              return e | 0;
+            }
+            function Z$(a) {
+              a = a | 0;
+              var b = 0;
+              a: do
+                if (!a) b = 6;
+                else {
+                  b = 0;
+                  while (1) {
+                    if ((b | 0) >= 6) {
+                      b = -1;
+                      break a;
+                    }
+                    if (H0(a, c[(60068 + (b << 2)) >> 2] | 0) | 0) break a;
+                    b = (b + 1) | 0;
+                  }
+                }
+              while (0);
+              return b | 0;
+            }
+            function _$(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              return b0(58948, a, 0, b, c, d) | 0;
+            }
+            function $(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              return b0(58948, a, 1, b, c, d) | 0;
+            }
+            function a0(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              S_(58584, b, c, d);
+              return;
+            }
+            function b0(b, d, e, f, g, h) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              a: do
+                if (f >>> 0 < g >>> 0) {
+                  l = c[(d + 72) >> 2] | 0;
+                  i = (f + 1) | 0;
+                  b: do
+                    if ((i | 0) == (g | 0)) {
+                      i = a[(d + 69) >> 0] | 0;
+                      if (((((i << 24) >> 24) + -3) | 0) >>> 0 < 3) {
+                        i = -1;
+                        break a;
+                      }
+                      switch (a[f >> 0] | 0) {
+                        case 60:
+                        case 0: {
+                          i = -1;
+                          break a;
+                        }
+                        case -17:
+                        case -1:
+                        case -2:
+                          break;
+                        default:
+                          break b;
+                      }
+                      if (!(((e | 0) == 1) & ((i << 24) >> 24 == 0))) {
+                        i = -1;
+                        break a;
+                      }
+                    } else {
+                      k = a[f >> 0] | 0;
+                      i = a[i >> 0] | 0;
+                      j = (((k & 255) << 8) | (i & 255)) & 65535;
+                      c: do
+                        if ((j << 16) >> 16 < -2) {
+                          if ((j << 16) >> 16 >= -257) {
+                            switch ((j << 16) >> 16) {
+                              case -257:
+                                break;
+                              default:
+                                break c;
+                            }
+                            if (((e | 0) == 1) & ((a[(d + 69) >> 0] | 0) == 0)) break b;
+                            c[h >> 2] = f + 2;
+                            c[l >> 2] = c[(b + 16) >> 2];
+                            i = 14;
+                            break a;
+                          }
+                          switch ((j << 16) >> 16) {
+                            case -4165:
+                              break;
+                            default:
+                              break c;
+                          }
+                          if ((e | 0) == 1)
+                            switch (a[(d + 69) >> 0] | 0) {
+                              case 0:
+                              case 3:
+                              case 4:
+                              case 5:
+                                break b;
+                              default: {
+                              }
+                            }
+                          i = (f + 2) | 0;
+                          if ((i | 0) == (g | 0)) {
+                            i = -1;
+                            break a;
+                          }
+                          if ((a[i >> 0] | 0) != -65) break b;
+                          c[h >> 2] = f + 3;
+                          c[l >> 2] = c[(b + 8) >> 2];
+                          i = 14;
+                          break a;
+                        } else {
+                          if ((j << 16) >> 16 < 15360) {
+                            switch ((j << 16) >> 16) {
+                              case -2:
+                                break;
+                              default:
+                                break c;
+                            }
+                            if (((e | 0) == 1) & ((a[(d + 69) >> 0] | 0) == 0)) break b;
+                            c[h >> 2] = f + 2;
+                            c[l >> 2] = c[(b + 20) >> 2];
+                            i = 14;
+                            break a;
+                          }
+                          switch ((j << 16) >> 16) {
+                            case 15360:
+                              break;
+                            default:
+                              break c;
+                          }
+                          i = a[(d + 69) >> 0] | 0;
+                          if ((i << 24) >> 24 == 4) {
+                            if ((e | 0) == 1) break b;
+                          } else if (((e | 0) == 1) & ((i << 24) >> 24 == 3)) break b;
+                          i = c[(b + 20) >> 2] | 0;
+                          c[l >> 2] = i;
+                          i = ob[c[(i + (e << 2)) >> 2] & 127](i, f, g, h) | 0;
+                          break a;
+                        }
+                      while (0);
+                      if ((k << 24) >> 24) {
+                        if (((e | 0) == 1) | ((i << 24) >> 24 != 0)) break;
+                        i = c[(b + 20) >> 2] | 0;
+                        c[l >> 2] = i;
+                        i = ob[c[(i + (e << 2)) >> 2] & 127](i, f, g, h) | 0;
+                        break a;
+                      }
+                      if ((e | 0) == 1 ? (a[(d + 69) >> 0] | 0) == 5 : 0) break;
+                      i = c[(b + 16) >> 2] | 0;
+                      c[l >> 2] = i;
+                      i = ob[c[(i + (e << 2)) >> 2] & 127](i, f, g, h) | 0;
+                      break a;
+                    }
+                  while (0);
+                  i = c[(b + (a[(d + 69) >> 0] << 2)) >> 2] | 0;
+                  c[l >> 2] = i;
+                  i = ob[c[(i + (e << 2)) >> 2] & 127](i, f, g, h) | 0;
+                } else i = -4;
+              while (0);
+              return i | 0;
+            }
+            function c0(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              a: do
+                if (e >>> 0 < f >>> 0) {
+                  i = e;
+                  m = (f - i) | 0;
+                  k = ((m & 1) | 0) == 0;
+                  m = m & -2;
+                  l = (m | 0) == 0;
+                  m = k | l ? f : (e + m) | 0;
+                  if (k | (l ^ 1)) {
+                    f = a[e >> 0] | 0;
+                    if (!((f << 24) >> 24)) {
+                      h = a[(e + 1) >> 0] | 0;
+                      j = h;
+                      h = d[(b + 72 + (h & 255)) >> 0] | 0;
+                    } else {
+                      h = a[(e + 1) >> 0] | 0;
+                      j = h;
+                      h = J$(f, h) | 0;
+                    }
+                    do
+                      switch (h | 0) {
+                        case 12: {
+                          f = D0(12, b, (e + 2) | 0, m, g) | 0;
+                          break a;
+                        }
+                        case 13: {
+                          f = D0(13, b, (e + 2) | 0, m, g) | 0;
+                          break a;
+                        }
+                        case 2: {
+                          h = (e + 2) | 0;
+                          if (((m - h) | 0) <= 1) {
+                            f = -1;
+                            break a;
+                          }
+                          f = a[h >> 0] | 0;
+                          if (!((f << 24) >> 24)) f = d[(b + 72 + (d[(e + 3) >> 0] | 0)) >> 0] | 0;
+                          else f = J$(f, a[(e + 3) >> 0] | 0) | 0;
+                          switch (f | 0) {
+                            case 16: {
+                              f = E0(b, (e + 4) | 0, m, g) | 0;
+                              break a;
+                            }
+                            case 15: {
+                              f = z0(b, (e + 4) | 0, m, g) | 0;
+                              break a;
+                            }
+                            case 7:
+                            case 6:
+                            case 5:
+                            case 29:
+                            case 24:
+                            case 22: {
+                              c[g >> 2] = e;
+                              f = 29;
+                              break a;
+                            }
+                            default: {
+                              c[g >> 2] = h;
+                              f = 0;
+                              break a;
+                            }
+                          }
+                        }
+                        case 9: {
+                          if (((e + 2) | 0) == (m | 0)) {
+                            c[g >> 2] = m;
+                            f = -15;
+                            break a;
+                          } else i = 7;
+                          break;
+                        }
+                        case 10:
+                        case 21: {
+                          i = 7;
+                          break;
+                        }
+                        case 30: {
+                          f = t0(b, (e + 2) | 0, m, g) | 0;
+                          break a;
+                        }
+                        case 35: {
+                          c[g >> 2] = e + 2;
+                          f = 38;
+                          break a;
+                        }
+                        case 20: {
+                          c[g >> 2] = e + 2;
+                          f = 25;
+                          break a;
+                        }
+                        case 4: {
+                          h = (e + 2) | 0;
+                          f = (m - h) | 0;
+                          if ((f | 0) <= 1) {
+                            f = -26;
+                            break a;
+                          }
+                          if ((a[h >> 0] | 0) == 0 ? (a[(e + 3) >> 0] | 0) == 93 : 0) {
+                            if ((f | 0) <= 3) {
+                              f = -1;
+                              break a;
+                            }
+                            if ((a[(e + 4) >> 0] | 0) == 0 ? (a[(e + 5) >> 0] | 0) == 62 : 0) {
+                              c[g >> 2] = e + 6;
+                              f = 34;
+                              break a;
+                            }
+                          }
+                          c[g >> 2] = h;
+                          f = 26;
+                          break a;
+                        }
+                        case 31: {
+                          c[g >> 2] = e + 2;
+                          f = 23;
+                          break a;
+                        }
+                        case 32: {
+                          h = (e + 2) | 0;
+                          if (((m - h) | 0) <= 1) {
+                            f = -24;
+                            break a;
+                          }
+                          f = a[h >> 0] | 0;
+                          if (!((f << 24) >> 24)) f = d[(b + 72 + (d[(e + 3) >> 0] | 0)) >> 0] | 0;
+                          else f = J$(f, a[(e + 3) >> 0] | 0) | 0;
+                          switch (f | 0) {
+                            case 33: {
+                              c[g >> 2] = e + 4;
+                              f = 36;
+                              break a;
+                            }
+                            case 15: {
+                              c[g >> 2] = e + 4;
+                              f = 35;
+                              break a;
+                            }
+                            case 34: {
+                              c[g >> 2] = e + 4;
+                              f = 37;
+                              break a;
+                            }
+                            case 32:
+                            case 36:
+                            case 35:
+                            case 11:
+                            case 21:
+                            case 10:
+                            case 9: {
+                              c[g >> 2] = h;
+                              f = 24;
+                              break a;
+                            }
+                            default: {
+                              c[g >> 2] = h;
+                              f = 0;
+                              break a;
+                            }
+                          }
+                        }
+                        case 36: {
+                          c[g >> 2] = e + 2;
+                          f = 21;
+                          break a;
+                        }
+                        case 11: {
+                          c[g >> 2] = e + 2;
+                          f = 17;
+                          break a;
+                        }
+                        case 19: {
+                          f = F0(b, (e + 2) | 0, m, g) | 0;
+                          break a;
+                        }
+                        case 5: {
+                          if (((m - i) | 0) < 2) {
+                            f = -2;
+                            break a;
+                          }
+                          c[g >> 2] = e;
+                          f = 0;
+                          break a;
+                        }
+                        case 6: {
+                          if (((m - i) | 0) < 3) {
+                            f = -2;
+                            break a;
+                          }
+                          c[g >> 2] = e;
+                          f = 0;
+                          break a;
+                        }
+                        case 7: {
+                          if (((m - i) | 0) < 4) {
+                            f = -2;
+                            break a;
+                          }
+                          c[g >> 2] = e;
+                          f = 0;
+                          break a;
+                        }
+                        case 24:
+                        case 22: {
+                          f = 18;
+                          i = 61;
+                          break;
+                        }
+                        case 23:
+                        case 27:
+                        case 26:
+                        case 25: {
+                          f = 19;
+                          i = 61;
+                          break;
+                        }
+                        case 29: {
+                          i = f & 255;
+                          h = j & 255;
+                          f = h >>> 5;
+                          h = 1 << (h & 31);
+                          if (!(h & c[(56940 + ((f | (d[(143788 + i) >> 0] << 3)) << 2)) >> 2]))
+                            if (!(c[(56940 + (((d[(144044 + i) >> 0] << 3) | f) << 2)) >> 2] & h)) i = 64;
+                            else {
+                              f = 19;
+                              i = 61;
+                            }
+                          else {
+                            f = 18;
+                            i = 61;
+                          }
+                          break;
+                        }
+                        default:
+                          i = 64;
+                      }
+                    while (0);
+                    if ((i | 0) == 7) {
+                      k = m;
+                      b = (b + 72) | 0;
+                      j = e;
+                      b: while (1) {
+                        i = j;
+                        j = (j + 2) | 0;
+                        if (((k - j) | 0) <= 1) {
+                          i = 28;
+                          break;
+                        }
+                        f = a[j >> 0] | 0;
+                        h = a[(i + 3) >> 0] | 0;
+                        if (!((f << 24) >> 24)) f = d[(b + (h & 255)) >> 0] | 0;
+                        else f = J$(f, h) | 0;
+                        switch (f | 0) {
+                          case 10:
+                          case 21:
+                            continue b;
+                          case 9:
+                            break;
+                          default: {
+                            i = 27;
+                            break b;
+                          }
+                        }
+                        if (((i + 4) | 0) == (m | 0)) {
+                          i = 27;
+                          break;
+                        }
+                      }
+                      if ((i | 0) == 27) {
+                        c[g >> 2] = j;
+                        f = 15;
+                        break;
+                      } else if ((i | 0) == 28) {
+                        c[g >> 2] = j;
+                        f = 15;
+                        break;
+                      }
+                    } else if ((i | 0) == 61) {
+                      l = (b + 72) | 0;
+                      h = (e + 2) | 0;
+                      c: while (1) {
+                        e = f & 255;
+                        d: while (1) {
+                          k = (m - h) | 0;
+                          if ((k | 0) <= 1) {
+                            i = 104;
+                            break c;
+                          }
+                          i = a[h >> 0] | 0;
+                          j = a[(h + 1) >> 0] | 0;
+                          if (!((i << 24) >> 24)) b = d[(l + (j & 255)) >> 0] | 0;
+                          else b = J$(i, j) | 0;
+                          switch (b | 0) {
+                            case 5: {
+                              i = 73;
+                              break c;
+                            }
+                            case 6: {
+                              i = 74;
+                              break c;
+                            }
+                            case 7: {
+                              i = 76;
+                              break c;
+                            }
+                            case 10:
+                            case 9:
+                            case 21:
+                            case 30:
+                            case 20:
+                            case 36:
+                            case 35:
+                            case 32:
+                            case 11: {
+                              i = 78;
+                              break c;
+                            }
+                            case 34: {
+                              i = 94;
+                              break c;
+                            }
+                            case 33: {
+                              i = 97;
+                              break c;
+                            }
+                            case 15: {
+                              i = 100;
+                              break c;
+                            }
+                            case 29: {
+                              k = j & 255;
+                              if (
+                                !(
+                                  (1 << (k & 31)) &
+                                  c[(56940 + (((k >>> 5) | (d[(144044 + (i & 255)) >> 0] << 3)) << 2)) >> 2]
+                                )
+                              ) {
+                                i = 71;
+                                break c;
+                              }
+                              break;
+                            }
+                            case 27:
+                            case 26:
+                            case 25:
+                            case 24:
+                            case 22:
+                              break;
+                            case 23: {
+                              k = (h + 2) | 0;
+                              switch (e & 63) {
+                                case 41: {
+                                  f = 19;
+                                  h = k;
+                                  continue c;
+                                }
+                                case 18:
+                                  break d;
+                                default: {
+                                  h = k;
+                                  continue d;
+                                }
+                              }
+                            }
+                            default: {
+                              i = 103;
+                              break c;
+                            }
+                          }
+                          h = (h + 2) | 0;
+                        }
+                        b = (m - k) | 0;
+                        if ((b | 0) <= 1) {
+                          f = -1;
+                          break a;
+                        }
+                        f = a[k >> 0] | 0;
+                        i = a[(h + 3) >> 0] | 0;
+                        if (!((f << 24) >> 24)) j = d[(l + (i & 255)) >> 0] | 0;
+                        else j = J$(f, i) | 0;
+                        switch (j | 0) {
+                          case 5: {
+                            i = 89;
+                            break c;
+                          }
+                          case 6: {
+                            i = 90;
+                            break c;
+                          }
+                          case 7: {
+                            i = 92;
+                            break c;
+                          }
+                          case 29: {
+                            e = i & 255;
+                            if (
+                              !(
+                                (1 << (e & 31)) &
+                                c[(56940 + (((e >>> 5) | (d[(144044 + (f & 255)) >> 0] << 3)) << 2)) >> 2]
+                              )
+                            ) {
+                              i = 87;
+                              break c;
+                            }
+                            break;
+                          }
+                          case 27:
+                          case 26:
+                          case 25:
+                          case 24:
+                          case 22:
+                            break;
+                          default: {
+                            f = 19;
+                            h = k;
+                            continue c;
+                          }
+                        }
+                        f = 41;
+                        h = (h + 4) | 0;
+                      }
+                      switch (i | 0) {
+                        case 71: {
+                          c[g >> 2] = h;
+                          f = 0;
+                          break a;
+                        }
+                        case 73: {
+                          c[g >> 2] = h;
+                          f = 0;
+                          break a;
+                        }
+                        case 74: {
+                          if ((k | 0) < 3) {
+                            f = -2;
+                            break a;
+                          }
+                          c[g >> 2] = h;
+                          f = 0;
+                          break a;
+                        }
+                        case 76: {
+                          if ((k | 0) < 4) {
+                            f = -2;
+                            break a;
+                          }
+                          c[g >> 2] = h;
+                          f = 0;
+                          break a;
+                        }
+                        case 78: {
+                          c[g >> 2] = h;
+                          break a;
+                        }
+                        case 87: {
+                          c[g >> 2] = k;
+                          f = 0;
+                          break a;
+                        }
+                        case 89: {
+                          c[g >> 2] = k;
+                          f = 0;
+                          break a;
+                        }
+                        case 90: {
+                          if ((b | 0) < 3) {
+                            f = -2;
+                            break a;
+                          }
+                          c[g >> 2] = k;
+                          f = 0;
+                          break a;
+                        }
+                        case 92: {
+                          if ((b | 0) < 4) {
+                            f = -2;
+                            break a;
+                          }
+                          c[g >> 2] = k;
+                          f = 0;
+                          break a;
+                        }
+                        case 94:
+                          if ((f | 0) == 19) {
+                            c[g >> 2] = h;
+                            f = 0;
+                            break a;
+                          } else {
+                            c[g >> 2] = h + 2;
+                            f = 32;
+                            break a;
+                          }
+                        case 97:
+                          if ((f | 0) == 19) {
+                            c[g >> 2] = h;
+                            f = 0;
+                            break a;
+                          } else {
+                            c[g >> 2] = h + 2;
+                            f = 31;
+                            break a;
+                          }
+                        case 100:
+                          if ((f | 0) == 19) {
+                            c[g >> 2] = h;
+                            f = 0;
+                            break a;
+                          } else {
+                            c[g >> 2] = h + 2;
+                            f = 30;
+                            break a;
+                          }
+                        case 103: {
+                          c[g >> 2] = h;
+                          f = 0;
+                          break a;
+                        }
+                        case 104: {
+                          f = (0 - f) | 0;
+                          break a;
+                        }
+                      }
+                    } else if ((i | 0) == 64) {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break;
+                    }
+                  } else f = -1;
+                } else f = -4;
+              while (0);
+              return f | 0;
+            }
+            function d0(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              a: do
+                if (e >>> 0 < f >>> 0) {
+                  h = e;
+                  i = (f - h) | 0;
+                  k = ((i & 1) | 0) == 0;
+                  i = i & -2;
+                  j = (i | 0) == 0;
+                  i = k | j ? f : (e + i) | 0;
+                  if (k | (j ^ 1)) {
+                    f = a[e >> 0] | 0;
+                    if (!((f << 24) >> 24)) f = d[(b + 72 + (d[(e + 1) >> 0] | 0)) >> 0] | 0;
+                    else f = J$(f, a[(e + 1) >> 0] | 0) | 0;
+                    do
+                      switch (f | 0) {
+                        case 2: {
+                          f = w0(b, (e + 2) | 0, i, g) | 0;
+                          break a;
+                        }
+                        case 3: {
+                          f = s0(b, (e + 2) | 0, i, g) | 0;
+                          break a;
+                        }
+                        case 9: {
+                          h = (e + 2) | 0;
+                          if (((i - h) | 0) <= 1) {
+                            f = -3;
+                            break a;
+                          }
+                          f = a[h >> 0] | 0;
+                          if (!((f << 24) >> 24)) f = d[(b + 72 + (d[(e + 3) >> 0] | 0)) >> 0] | 0;
+                          else f = J$(f, a[(e + 3) >> 0] | 0) | 0;
+                          c[g >> 2] = (f | 0) == 10 ? (e + 4) | 0 : h;
+                          f = 7;
+                          break a;
+                        }
+                        case 10: {
+                          c[g >> 2] = e + 2;
+                          f = 7;
+                          break a;
+                        }
+                        case 4: {
+                          h = (e + 2) | 0;
+                          if (((i - h) | 0) <= 1) {
+                            f = -5;
+                            break a;
+                          }
+                          if ((a[h >> 0] | 0) == 0 ? (a[(e + 3) >> 0] | 0) == 93 : 0) {
+                            f = (e + 4) | 0;
+                            if (((i - f) | 0) <= 1) {
+                              f = -5;
+                              break a;
+                            }
+                            if ((a[f >> 0] | 0) == 0 ? (a[(e + 5) >> 0] | 0) == 62 : 0) {
+                              c[g >> 2] = f;
+                              f = 0;
+                              break a;
+                            } else f = i;
+                          } else f = i;
+                          break;
+                        }
+                        case 5: {
+                          f = i;
+                          if (((f - h) | 0) < 2) {
+                            f = -2;
+                            break a;
+                          }
+                          h = (e + 2) | 0;
+                          break;
+                        }
+                        case 6: {
+                          f = i;
+                          if (((f - h) | 0) < 3) {
+                            f = -2;
+                            break a;
+                          }
+                          h = (e + 3) | 0;
+                          break;
+                        }
+                        case 7: {
+                          f = i;
+                          if (((f - h) | 0) < 4) {
+                            f = -2;
+                            break a;
+                          }
+                          h = (e + 4) | 0;
+                          break;
+                        }
+                        case 8:
+                        case 1:
+                        case 0: {
+                          c[g >> 2] = e;
+                          f = 0;
+                          break a;
+                        }
+                        default: {
+                          h = (e + 2) | 0;
+                          f = i;
+                        }
+                      }
+                    while (0);
+                    j = (b + 72) | 0;
+                    b = h;
+                    b: while (1) {
+                      e = (f - b) | 0;
+                      if ((e | 0) <= 1) {
+                        h = 52;
+                        break;
+                      }
+                      h = a[b >> 0] | 0;
+                      i = a[(b + 1) >> 0] | 0;
+                      if (!((h << 24) >> 24)) h = d[(j + (i & 255)) >> 0] | 0;
+                      else h = J$(h, i) | 0;
+                      switch (h | 0) {
+                        case 10:
+                        case 9:
+                        case 8:
+                        case 1:
+                        case 0:
+                        case 2:
+                        case 3: {
+                          h = 50;
+                          break b;
+                        }
+                        case 5: {
+                          b = (b + 2) | 0;
+                          continue b;
+                        }
+                        case 6: {
+                          if ((e | 0) < 3) {
+                            h = 38;
+                            break b;
+                          }
+                          b = (b + 3) | 0;
+                          continue b;
+                        }
+                        case 7: {
+                          if ((e | 0) < 4) {
+                            h = 41;
+                            break b;
+                          }
+                          b = (b + 4) | 0;
+                          continue b;
+                        }
+                        case 4: {
+                          if ((e | 0) <= 3) {
+                            h = 50;
+                            break b;
+                          }
+                          h = (b + 2) | 0;
+                          if (a[h >> 0] | 0) {
+                            b = h;
+                            continue b;
+                          }
+                          if ((a[(b + 3) >> 0] | 0) != 93) {
+                            b = h;
+                            continue b;
+                          }
+                          if ((e | 0) <= 5) {
+                            h = 50;
+                            break b;
+                          }
+                          i = (b + 4) | 0;
+                          if (a[i >> 0] | 0) {
+                            b = h;
+                            continue b;
+                          }
+                          if ((a[(b + 5) >> 0] | 0) == 62) {
+                            h = 49;
+                            break b;
+                          } else {
+                            b = h;
+                            continue b;
+                          }
+                        }
+                        default: {
+                          b = (b + 2) | 0;
+                          continue b;
+                        }
+                      }
+                    }
+                    if ((h | 0) == 38) {
+                      c[g >> 2] = b;
+                      f = 6;
+                      break;
+                    } else if ((h | 0) == 41) {
+                      c[g >> 2] = b;
+                      f = 6;
+                      break;
+                    } else if ((h | 0) == 49) {
+                      c[g >> 2] = i;
+                      f = 0;
+                      break;
+                    } else if ((h | 0) == 50) {
+                      c[g >> 2] = b;
+                      f = 6;
+                      break;
+                    } else if ((h | 0) == 52) {
+                      c[g >> 2] = b;
+                      f = 6;
+                      break;
+                    }
+                  } else f = -1;
+                } else f = -4;
+              while (0);
+              return f | 0;
+            }
+            function e0(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              a: do
+                if (e >>> 0 < f >>> 0) {
+                  h = e;
+                  i = (f - h) | 0;
+                  k = ((i & 1) | 0) == 0;
+                  i = i & -2;
+                  j = (i | 0) == 0;
+                  i = k | j ? f : (e + i) | 0;
+                  if (k | (j ^ 1)) {
+                    f = a[e >> 0] | 0;
+                    if (!((f << 24) >> 24)) f = d[(b + 72 + (d[(e + 1) >> 0] | 0)) >> 0] | 0;
+                    else f = J$(f, a[(e + 1) >> 0] | 0) | 0;
+                    switch (f | 0) {
+                      case 4: {
+                        h = (e + 2) | 0;
+                        if (((i - h) | 0) <= 1) {
+                          f = -1;
+                          break a;
+                        }
+                        if ((a[h >> 0] | 0) == 0 ? (a[(e + 3) >> 0] | 0) == 93 : 0) {
+                          f = (e + 4) | 0;
+                          if (((i - f) | 0) <= 1) {
+                            f = -1;
+                            break a;
+                          }
+                          if ((a[f >> 0] | 0) == 0 ? (a[(e + 5) >> 0] | 0) == 62 : 0) {
+                            c[g >> 2] = e + 6;
+                            f = 40;
+                            break a;
+                          }
+                        }
+                        break;
+                      }
+                      case 9: {
+                        h = (e + 2) | 0;
+                        if (((i - h) | 0) <= 1) {
+                          f = -1;
+                          break a;
+                        }
+                        f = a[h >> 0] | 0;
+                        if (!((f << 24) >> 24)) f = d[(b + 72 + (d[(e + 3) >> 0] | 0)) >> 0] | 0;
+                        else f = J$(f, a[(e + 3) >> 0] | 0) | 0;
+                        c[g >> 2] = (f | 0) == 10 ? (e + 4) | 0 : h;
+                        f = 7;
+                        break a;
+                      }
+                      case 10: {
+                        c[g >> 2] = e + 2;
+                        f = 7;
+                        break a;
+                      }
+                      case 5: {
+                        f = i;
+                        if (((f - h) | 0) < 2) {
+                          f = -2;
+                          break a;
+                        }
+                        h = (e + 2) | 0;
+                        i = f;
+                        break;
+                      }
+                      case 6: {
+                        f = i;
+                        if (((f - h) | 0) < 3) {
+                          f = -2;
+                          break a;
+                        }
+                        h = (e + 3) | 0;
+                        i = f;
+                        break;
+                      }
+                      case 7: {
+                        f = i;
+                        if (((f - h) | 0) < 4) {
+                          f = -2;
+                          break a;
+                        }
+                        h = (e + 4) | 0;
+                        i = f;
+                        break;
+                      }
+                      case 8:
+                      case 1:
+                      case 0: {
+                        c[g >> 2] = e;
+                        f = 0;
+                        break a;
+                      }
+                      default:
+                        h = (e + 2) | 0;
+                    }
+                    j = (b + 72) | 0;
+                    b = h;
+                    b: while (1) {
+                      e = (i - b) | 0;
+                      if ((e | 0) <= 1) {
+                        h = 40;
+                        break;
+                      }
+                      f = a[b >> 0] | 0;
+                      h = a[(b + 1) >> 0] | 0;
+                      if (!((f << 24) >> 24)) f = d[(j + (h & 255)) >> 0] | 0;
+                      else f = J$(f, h) | 0;
+                      switch (f | 0) {
+                        case 10:
+                        case 9:
+                        case 8:
+                        case 1:
+                        case 0:
+                        case 4: {
+                          h = 38;
+                          break b;
+                        }
+                        case 6: {
+                          if ((e | 0) < 3) {
+                            h = 35;
+                            break b;
+                          } else f = 3;
+                          break;
+                        }
+                        case 7: {
+                          if ((e | 0) < 4) {
+                            h = 37;
+                            break b;
+                          } else f = 4;
+                          break;
+                        }
+                        default:
+                          f = 2;
+                      }
+                      b = (b + f) | 0;
+                    }
+                    if ((h | 0) == 35) {
+                      c[g >> 2] = b;
+                      f = 6;
+                      break;
+                    } else if ((h | 0) == 37) {
+                      c[g >> 2] = b;
+                      f = 6;
+                      break;
+                    } else if ((h | 0) == 38) {
+                      c[g >> 2] = b;
+                      f = 6;
+                      break;
+                    } else if ((h | 0) == 40) {
+                      c[g >> 2] = b;
+                      f = 6;
+                      break;
+                    }
+                  } else f = -1;
+                } else f = -4;
+              while (0);
+              return f | 0;
+            }
+            function f0(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              k = (f - e) | 0;
+              k = ((k & 1) | 0) == 0 ? f : (e + (k & -2)) | 0;
+              j = (b + 72) | 0;
+              i = 0;
+              f = e;
+              a: while (1) {
+                h = (k - f) | 0;
+                if ((h | 0) <= 1) {
+                  f = -1;
+                  break;
+                }
+                b = a[f >> 0] | 0;
+                e = a[(f + 1) >> 0] | 0;
+                if (!((b << 24) >> 24)) b = d[(j + (e & 255)) >> 0] | 0;
+                else b = J$(b, e) | 0;
+                switch (b | 0) {
+                  case 8:
+                  case 1:
+                  case 0: {
+                    l = 12;
+                    break a;
+                  }
+                  case 5: {
+                    h = i;
+                    f = (f + 2) | 0;
+                    i = h;
+                    continue a;
+                  }
+                  case 6: {
+                    if ((h | 0) < 3) {
+                      f = -2;
+                      break a;
+                    }
+                    h = i;
+                    f = (f + 3) | 0;
+                    i = h;
+                    continue a;
+                  }
+                  case 7: {
+                    if ((h | 0) < 4) {
+                      f = -2;
+                      break a;
+                    }
+                    h = i;
+                    f = (f + 4) | 0;
+                    i = h;
+                    continue a;
+                  }
+                  case 2: {
+                    b = (f + 2) | 0;
+                    if (((k - b) | 0) <= 1) {
+                      f = -1;
+                      break a;
+                    }
+                    if (a[b >> 0] | 0) {
+                      h = i;
+                      f = b;
+                      i = h;
+                      continue a;
+                    }
+                    if ((a[(f + 3) >> 0] | 0) != 33) {
+                      h = i;
+                      f = b;
+                      i = h;
+                      continue a;
+                    }
+                    b = (f + 4) | 0;
+                    if (((k - b) | 0) <= 1) {
+                      f = -1;
+                      break a;
+                    }
+                    if (a[b >> 0] | 0) {
+                      h = i;
+                      f = b;
+                      i = h;
+                      continue a;
+                    }
+                    h = (a[(f + 5) >> 0] | 0) == 91;
+                    i = (i + (h & 1)) | 0;
+                    f = h ? (f + 6) | 0 : b;
+                    continue a;
+                  }
+                  case 4: {
+                    b = (f + 2) | 0;
+                    if (((k - b) | 0) <= 1) {
+                      f = -1;
+                      break a;
+                    }
+                    if (a[b >> 0] | 0) {
+                      h = i;
+                      f = b;
+                      i = h;
+                      continue a;
+                    }
+                    if ((a[(f + 3) >> 0] | 0) != 93) {
+                      h = i;
+                      f = b;
+                      i = h;
+                      continue a;
+                    }
+                    b = (f + 4) | 0;
+                    if (((k - b) | 0) <= 1) {
+                      f = -1;
+                      break a;
+                    }
+                    if (a[b >> 0] | 0) {
+                      h = i;
+                      f = b;
+                      i = h;
+                      continue a;
+                    }
+                    if ((a[(f + 5) >> 0] | 0) != 62) {
+                      h = i;
+                      f = b;
+                      i = h;
+                      continue a;
+                    }
+                    f = (f + 6) | 0;
+                    if (!i) {
+                      l = 26;
+                      break a;
+                    }
+                    i = (i + -1) | 0;
+                    continue a;
+                  }
+                  default: {
+                    h = i;
+                    f = (f + 2) | 0;
+                    i = h;
+                    continue a;
+                  }
+                }
+              }
+              if ((l | 0) == 12) {
+                c[g >> 2] = f;
+                f = 0;
+              } else if ((l | 0) == 26) {
+                c[g >> 2] = f;
+                f = 42;
+              }
+              return f | 0;
+            }
+            function g0(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              do
+                if (e >>> 0 < f >>> 0) {
+                  k = f;
+                  if (((k - e) | 0) > 1) {
+                    l = (b + 72) | 0;
+                    j = e;
+                    a: while (1) {
+                      if (((k - j) | 0) <= 1) {
+                        i = 30;
+                        break;
+                      }
+                      h = a[j >> 0] | 0;
+                      i = a[(j + 1) >> 0] | 0;
+                      if (!((h << 24) >> 24)) h = d[(l + (i & 255)) >> 0] | 0;
+                      else h = J$(h, i) | 0;
+                      switch (h | 0) {
+                        case 3: {
+                          i = 11;
+                          break a;
+                        }
+                        case 2: {
+                          i = 14;
+                          break a;
+                        }
+                        case 10: {
+                          i = 15;
+                          break a;
+                        }
+                        case 9: {
+                          i = 18;
+                          break a;
+                        }
+                        case 21: {
+                          i = 25;
+                          break a;
+                        }
+                        case 5: {
+                          h = 2;
+                          break;
+                        }
+                        case 6: {
+                          h = 3;
+                          break;
+                        }
+                        case 7: {
+                          h = 4;
+                          break;
+                        }
+                        default:
+                          h = 2;
+                      }
+                      j = (j + h) | 0;
+                    }
+                    if ((i | 0) == 11)
+                      if ((j | 0) == (e | 0)) {
+                        h = s0(b, (e + 2) | 0, f, g) | 0;
+                        break;
+                      } else {
+                        c[g >> 2] = j;
+                        h = 6;
+                        break;
+                      }
+                    else if ((i | 0) == 14) {
+                      c[g >> 2] = j;
+                      h = 0;
+                      break;
+                    } else if ((i | 0) == 15)
+                      if ((j | 0) == (e | 0)) {
+                        c[g >> 2] = e + 2;
+                        h = 7;
+                        break;
+                      } else {
+                        c[g >> 2] = j;
+                        h = 6;
+                        break;
+                      }
+                    else if ((i | 0) == 18) {
+                      if ((j | 0) != (e | 0)) {
+                        c[g >> 2] = j;
+                        h = 6;
+                        break;
+                      }
+                      j = (e + 2) | 0;
+                      if (((k - j) | 0) <= 1) {
+                        h = -3;
+                        break;
+                      }
+                      h = a[j >> 0] | 0;
+                      i = a[(e + 3) >> 0] | 0;
+                      if (!((h << 24) >> 24)) h = d[(l + (i & 255)) >> 0] | 0;
+                      else h = J$(h, i) | 0;
+                      c[g >> 2] = (h | 0) == 10 ? (e + 4) | 0 : j;
+                      h = 7;
+                      break;
+                    } else if ((i | 0) == 25)
+                      if ((j | 0) == (e | 0)) {
+                        c[g >> 2] = e + 2;
+                        h = 39;
+                        break;
+                      } else {
+                        c[g >> 2] = j;
+                        h = 6;
+                        break;
+                      }
+                    else if ((i | 0) == 30) {
+                      c[g >> 2] = j;
+                      h = 6;
+                      break;
+                    }
+                  } else h = -1;
+                } else h = -4;
+              while (0);
+              return h | 0;
+            }
+            function h0(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              do
+                if (e >>> 0 < f >>> 0) {
+                  k = f;
+                  if (((k - e) | 0) > 1) {
+                    l = (b + 72) | 0;
+                    j = e;
+                    a: while (1) {
+                      if (((k - j) | 0) <= 1) {
+                        i = 29;
+                        break;
+                      }
+                      h = a[j >> 0] | 0;
+                      i = a[(j + 1) >> 0] | 0;
+                      if (!((h << 24) >> 24)) h = d[(l + (i & 255)) >> 0] | 0;
+                      else h = J$(h, i) | 0;
+                      switch (h | 0) {
+                        case 3: {
+                          i = 11;
+                          break a;
+                        }
+                        case 30: {
+                          i = 14;
+                          break a;
+                        }
+                        case 10: {
+                          i = 17;
+                          break a;
+                        }
+                        case 9: {
+                          i = 20;
+                          break a;
+                        }
+                        case 5: {
+                          h = 2;
+                          break;
+                        }
+                        case 6: {
+                          h = 3;
+                          break;
+                        }
+                        case 7: {
+                          h = 4;
+                          break;
+                        }
+                        default:
+                          h = 2;
+                      }
+                      j = (j + h) | 0;
+                    }
+                    if ((i | 0) == 11)
+                      if ((j | 0) == (e | 0)) {
+                        h = s0(b, (e + 2) | 0, f, g) | 0;
+                        break;
+                      } else {
+                        c[g >> 2] = j;
+                        h = 6;
+                        break;
+                      }
+                    else if ((i | 0) == 14)
+                      if ((j | 0) == (e | 0)) {
+                        h = t0(b, (e + 2) | 0, f, g) | 0;
+                        h = (h | 0) == 22 ? 0 : h;
+                        break;
+                      } else {
+                        c[g >> 2] = j;
+                        h = 6;
+                        break;
+                      }
+                    else if ((i | 0) == 17)
+                      if ((j | 0) == (e | 0)) {
+                        c[g >> 2] = e + 2;
+                        h = 7;
+                        break;
+                      } else {
+                        c[g >> 2] = j;
+                        h = 6;
+                        break;
+                      }
+                    else if ((i | 0) == 20) {
+                      if ((j | 0) != (e | 0)) {
+                        c[g >> 2] = j;
+                        h = 6;
+                        break;
+                      }
+                      j = (e + 2) | 0;
+                      if (((k - j) | 0) <= 1) {
+                        h = -3;
+                        break;
+                      }
+                      h = a[j >> 0] | 0;
+                      i = a[(e + 3) >> 0] | 0;
+                      if (!((h << 24) >> 24)) h = d[(l + (i & 255)) >> 0] | 0;
+                      else h = J$(h, i) | 0;
+                      c[g >> 2] = (h | 0) == 10 ? (e + 4) | 0 : j;
+                      h = 7;
+                      break;
+                    } else if ((i | 0) == 29) {
+                      c[g >> 2] = j;
+                      h = 6;
+                      break;
+                    }
+                  } else h = -1;
+                } else h = -4;
+              while (0);
+              return h | 0;
+            }
+            function i0(b, c, d, e) {
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              f = d;
+              b = c;
+              while (1) {
+                c = a[e >> 0] | 0;
+                if (!((c << 24) >> 24)) {
+                  g = 7;
+                  break;
+                }
+                if (((f - b) | 0) < 2) {
+                  b = 0;
+                  break;
+                }
+                if (a[b >> 0] | 0) {
+                  b = 0;
+                  break;
+                }
+                if ((a[(b + 1) >> 0] | 0) != (c << 24) >> 24) {
+                  b = 0;
+                  break;
+                }
+                e = (e + 1) | 0;
+                b = (b + 2) | 0;
+              }
+              if ((g | 0) == 7) b = ((b | 0) == (d | 0)) & 1;
+              return b | 0;
+            }
+            function j0(b, c) {
+              b = b | 0;
+              c = c | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              g = (b + 72) | 0;
+              f = c;
+              a: while (1) {
+                b = a[f >> 0] | 0;
+                e = a[(f + 1) >> 0] | 0;
+                if (!((b << 24) >> 24)) b = d[(g + (e & 255)) >> 0] | 0;
+                else b = J$(b, e) | 0;
+                switch (b | 0) {
+                  case 5: {
+                    b = 2;
+                    break;
+                  }
+                  case 6: {
+                    b = 3;
+                    break;
+                  }
+                  case 7: {
+                    b = 4;
+                    break;
+                  }
+                  case 27:
+                  case 26:
+                  case 25:
+                  case 24:
+                  case 23:
+                  case 22:
+                  case 29: {
+                    b = 2;
+                    break;
+                  }
+                  default:
+                    break a;
+                }
+                f = (f + b) | 0;
+              }
+              return (f - c) | 0;
+            }
+            function k0(b, c) {
+              b = b | 0;
+              c = c | 0;
+              var e = 0,
+                f = 0;
+              f = (b + 72) | 0;
+              a: while (1) {
+                b = a[c >> 0] | 0;
+                e = a[(c + 1) >> 0] | 0;
+                if (!((b << 24) >> 24)) b = d[(f + (e & 255)) >> 0] | 0;
+                else b = J$(b, e) | 0;
+                switch (b | 0) {
+                  case 21:
+                  case 9:
+                  case 10:
+                    break;
+                  default:
+                    break a;
+                }
+                c = (c + 2) | 0;
+              }
+              return c | 0;
+            }
+            function l0(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              o = (b + 72) | 0;
+              m = 0;
+              n = 0;
+              b = 1;
+              a: while (1) {
+                l = (e + 2) | 0;
+                h = a[l >> 0] | 0;
+                j = (h << 24) >> 24 == 0;
+                i = (e + 3) | 0;
+                k = a[i >> 0] | 0;
+                if (j) h = d[(o + (k & 255)) >> 0] | 0;
+                else h = J$(h, k) | 0;
+                do
+                  switch (h | 0) {
+                    case 5: {
+                      if (b | 0) {
+                        i = b;
+                        j = n;
+                        k = m;
+                        e = l;
+                        b = i;
+                        n = j;
+                        m = k;
+                        continue a;
+                      }
+                      if ((n | 0) >= (f | 0)) {
+                        j = n;
+                        k = m;
+                        b = 1;
+                        e = l;
+                        n = j;
+                        m = k;
+                        continue a;
+                      }
+                      c[(g + (n << 4)) >> 2] = l;
+                      a[(g + (n << 4) + 12) >> 0] = 1;
+                      j = n;
+                      k = m;
+                      b = 1;
+                      e = l;
+                      n = j;
+                      m = k;
+                      continue a;
+                    }
+                    case 6: {
+                      if (b | 0) {
+                        j = b;
+                        k = n;
+                        l = m;
+                        e = i;
+                        b = j;
+                        n = k;
+                        m = l;
+                        continue a;
+                      }
+                      if ((n | 0) >= (f | 0)) {
+                        k = n;
+                        l = m;
+                        b = 1;
+                        e = i;
+                        n = k;
+                        m = l;
+                        continue a;
+                      }
+                      c[(g + (n << 4)) >> 2] = l;
+                      a[(g + (n << 4) + 12) >> 0] = 1;
+                      k = n;
+                      l = m;
+                      b = 1;
+                      e = i;
+                      n = k;
+                      m = l;
+                      continue a;
+                    }
+                    case 7: {
+                      if (!b)
+                        if ((n | 0) < (f | 0)) {
+                          c[(g + (n << 4)) >> 2] = l;
+                          a[(g + (n << 4) + 12) >> 0] = 1;
+                          b = 1;
+                        } else b = 1;
+                      k = n;
+                      l = m;
+                      e = (e + 4) | 0;
+                      n = k;
+                      m = l;
+                      continue a;
+                    }
+                    case 24:
+                    case 22:
+                    case 29: {
+                      if (b | 0) {
+                        i = b;
+                        j = n;
+                        k = m;
+                        e = l;
+                        b = i;
+                        n = j;
+                        m = k;
+                        continue a;
+                      }
+                      if ((n | 0) >= (f | 0)) {
+                        j = n;
+                        k = m;
+                        b = 1;
+                        e = l;
+                        n = j;
+                        m = k;
+                        continue a;
+                      }
+                      c[(g + (n << 4)) >> 2] = l;
+                      a[(g + (n << 4) + 12) >> 0] = 1;
+                      j = n;
+                      k = m;
+                      b = 1;
+                      e = l;
+                      n = j;
+                      m = k;
+                      continue a;
+                    }
+                    case 12: {
+                      if ((b | 0) != 2) {
+                        if ((n | 0) >= (f | 0)) {
+                          k = n;
+                          m = 12;
+                          b = 2;
+                          e = l;
+                          n = k;
+                          continue a;
+                        }
+                        c[(g + (n << 4) + 4) >> 2] = e + 4;
+                        k = n;
+                        m = 12;
+                        b = 2;
+                        e = l;
+                        n = k;
+                        continue a;
+                      }
+                      if ((m | 0) != 12) {
+                        j = n;
+                        k = m;
+                        b = 2;
+                        e = l;
+                        n = j;
+                        m = k;
+                        continue a;
+                      }
+                      if ((n | 0) < (f | 0)) c[(g + (n << 4) + 8) >> 2] = l;
+                      m = 12;
+                      n = (n + 1) | 0;
+                      b = 0;
+                      e = l;
+                      continue a;
+                    }
+                    case 13: {
+                      if ((b | 0) != 2) {
+                        if ((n | 0) >= (f | 0)) {
+                          k = n;
+                          m = 13;
+                          b = 2;
+                          e = l;
+                          n = k;
+                          continue a;
+                        }
+                        c[(g + (n << 4) + 4) >> 2] = e + 4;
+                        k = n;
+                        m = 13;
+                        b = 2;
+                        e = l;
+                        n = k;
+                        continue a;
+                      }
+                      if ((m | 0) != 13) {
+                        j = n;
+                        k = m;
+                        b = 2;
+                        e = l;
+                        n = j;
+                        m = k;
+                        continue a;
+                      }
+                      if ((n | 0) < (f | 0)) c[(g + (n << 4) + 8) >> 2] = l;
+                      m = 13;
+                      n = (n + 1) | 0;
+                      b = 0;
+                      e = l;
+                      continue a;
+                    }
+                    case 3: {
+                      if ((n | 0) >= (f | 0)) {
+                        i = b;
+                        j = n;
+                        k = m;
+                        e = l;
+                        b = i;
+                        n = j;
+                        m = k;
+                        continue a;
+                      }
+                      a[(g + (n << 4) + 12) >> 0] = 0;
+                      i = b;
+                      j = n;
+                      k = m;
+                      e = l;
+                      b = i;
+                      n = j;
+                      m = k;
+                      continue a;
+                    }
+                    case 21: {
+                      switch (b | 0) {
+                        case 1: {
+                          j = n;
+                          k = m;
+                          b = 0;
+                          e = l;
+                          n = j;
+                          m = k;
+                          continue a;
+                        }
+                        case 2:
+                          break;
+                        default: {
+                          i = b;
+                          j = n;
+                          k = m;
+                          e = l;
+                          b = i;
+                          n = j;
+                          m = k;
+                          continue a;
+                        }
+                      }
+                      if ((n | 0) >= (f | 0)) {
+                        j = n;
+                        k = m;
+                        b = 2;
+                        e = l;
+                        n = j;
+                        m = k;
+                        continue a;
+                      }
+                      i = (g + (n << 4) + 12) | 0;
+                      if (!(a[i >> 0] | 0)) {
+                        j = n;
+                        k = m;
+                        b = 2;
+                        e = l;
+                        n = j;
+                        m = k;
+                        continue a;
+                      }
+                      do
+                        if (j & ((l | 0) != (c[(g + (n << 4) + 4) >> 2] | 0)) & ((k << 24) >> 24 == 32)) {
+                          h = a[(e + 4) >> 0] | 0;
+                          b = a[(e + 5) >> 0] | 0;
+                          if (!((h << 24) >> 24)) {
+                            if ((b << 24) >> 24 == 32) break;
+                            b = d[(o + (b & 255)) >> 0] | 0;
+                          } else b = J$(h, b) | 0;
+                          if ((b | 0) != (m | 0)) {
+                            j = n;
+                            k = m;
+                            b = 2;
+                            e = l;
+                            n = j;
+                            m = k;
+                            continue a;
+                          }
+                        }
+                      while (0);
+                      a[i >> 0] = 0;
+                      j = n;
+                      k = m;
+                      b = 2;
+                      e = l;
+                      n = j;
+                      m = k;
+                      continue a;
+                    }
+                    case 10:
+                    case 9: {
+                      switch (b | 0) {
+                        case 1: {
+                          j = n;
+                          k = m;
+                          b = 0;
+                          e = l;
+                          n = j;
+                          m = k;
+                          continue a;
+                        }
+                        case 2:
+                          break;
+                        default: {
+                          i = b;
+                          j = n;
+                          k = m;
+                          e = l;
+                          b = i;
+                          n = j;
+                          m = k;
+                          continue a;
+                        }
+                      }
+                      if ((n | 0) >= (f | 0)) {
+                        j = n;
+                        k = m;
+                        b = 2;
+                        e = l;
+                        n = j;
+                        m = k;
+                        continue a;
+                      }
+                      a[(g + (n << 4) + 12) >> 0] = 0;
+                      j = n;
+                      k = m;
+                      b = 2;
+                      e = l;
+                      n = j;
+                      m = k;
+                      continue a;
+                    }
+                    case 17:
+                    case 11:
+                      if ((b | 0) == 2) {
+                        j = n;
+                        k = m;
+                        b = 2;
+                        e = l;
+                        n = j;
+                        m = k;
+                        continue a;
+                      } else break a;
+                    default: {
+                      i = b;
+                      j = n;
+                      k = m;
+                      e = l;
+                      b = i;
+                      n = j;
+                      m = k;
+                      continue a;
+                    }
+                  }
+                while (0);
+              }
+              return n | 0;
+            }
+            function m0(b, c) {
+              b = b | 0;
+              c = c | 0;
+              var d = 0,
+                e = 0;
+              b = (c + 4) | 0;
+              a: do
+                if (!(a[b >> 0] | 0))
+                  if ((a[(c + 5) >> 0] | 0) == 120) {
+                    c = (c + 6) | 0;
+                    b = 0;
+                    while (1) {
+                      b: while (1) {
+                        if (!(a[c >> 0] | 0)) {
+                          d = a[(c + 1) >> 0] | 0;
+                          if ((d << 24) >> 24 == 59) {
+                            e = 18;
+                            break a;
+                          }
+                          d = (d << 24) >> 24;
+                          switch (d | 0) {
+                            case 57:
+                            case 56:
+                            case 55:
+                            case 54:
+                            case 53:
+                            case 52:
+                            case 51:
+                            case 50:
+                            case 49:
+                            case 48: {
+                              e = 8;
+                              break b;
+                            }
+                            case 70:
+                            case 69:
+                            case 68:
+                            case 67:
+                            case 66:
+                            case 65: {
+                              e = 9;
+                              break b;
+                            }
+                            case 102:
+                            case 101:
+                            case 100:
+                            case 99:
+                            case 98:
+                            case 97: {
+                              e = 10;
+                              break b;
+                            }
+                            default: {
+                            }
+                          }
+                        }
+                        c = (c + 2) | 0;
+                      }
+                      if ((e | 0) == 8) b = (d + -48) | (b << 4);
+                      else if ((e | 0) == 9) b = ((b << 4) + -55 + d) | 0;
+                      else if ((e | 0) == 10) b = ((b << 4) + -87 + d) | 0;
+                      if ((b | 0) < 1114112) c = (c + 2) | 0;
+                      else {
+                        b = -1;
+                        e = 19;
+                        break;
+                      }
+                    }
+                  } else {
+                    c = b;
+                    b = 0;
+                    e = 13;
+                  }
+                else {
+                  d = b;
+                  b = 0;
+                  c = -1;
+                  e = 16;
+                }
+              while (0);
+              while (1)
+                if ((e | 0) == 13) {
+                  if (a[c >> 0] | 0) {
+                    d = c;
+                    c = -1;
+                    e = 16;
+                    continue;
+                  }
+                  if ((a[(c + 1) >> 0] | 0) == 59) {
+                    e = 18;
+                    continue;
+                  }
+                  d = c;
+                  c = a[(c + 1) >> 0] | 0;
+                  e = 16;
+                  continue;
+                } else if ((e | 0) == 16) {
+                  b = (((b * 10) | 0) + -48 + c) | 0;
+                  if ((b | 0) >= 1114112) {
+                    b = -1;
+                    e = 19;
+                    continue;
+                  }
+                  c = (d + 2) | 0;
+                  e = 13;
+                  continue;
+                } else if ((e | 0) == 18) {
+                  b = A_(b) | 0;
+                  e = 19;
+                  continue;
+                } else if ((e | 0) == 19) return b | 0;
+              return 0;
+            }
+            function n0(b, c, d) {
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0;
+              a: do
+                switch ((((d - c) | 0) / 2) | 0 | 0) {
+                  case 2: {
+                    if ((a[(c + 2) >> 0] | 0) == 0 ? (a[(c + 3) >> 0] | 0) == 116 : 0) {
+                      if (!(a[c >> 0] | 0)) b = a[(c + 1) >> 0] | 0;
+                      else b = -1;
+                      b = (b | 0) == 108 ? 60 : (b | 0) == 103 ? 62 : 0;
+                    } else e = 27;
+                    break;
+                  }
+                  case 3: {
+                    if (
+                      (
+                        (
+                          (((a[c >> 0] | 0) == 0 ? (a[(c + 1) >> 0] | 0) == 97 : 0) ? (a[(c + 2) >> 0] | 0) == 0 : 0)
+                            ? (a[(c + 3) >> 0] | 0) == 109
+                            : 0
+                        )
+                          ? (a[(c + 4) >> 0] | 0) == 0
+                          : 0
+                      )
+                        ? (a[(c + 5) >> 0] | 0) == 112
+                        : 0
+                    )
+                      b = 38;
+                    else e = 27;
+                    break;
+                  }
+                  case 4: {
+                    if (!(a[c >> 0] | 0))
+                      switch (a[(c + 1) >> 0] | 0) {
+                        case 113: {
+                          if (a[(c + 2) >> 0] | 0) {
+                            e = 27;
+                            break a;
+                          }
+                          if ((a[(c + 3) >> 0] | 0) != 117) {
+                            e = 27;
+                            break a;
+                          }
+                          if (a[(c + 4) >> 0] | 0) {
+                            e = 27;
+                            break a;
+                          }
+                          if ((a[(c + 5) >> 0] | 0) != 111) {
+                            e = 27;
+                            break a;
+                          }
+                          if (a[(c + 6) >> 0] | 0) {
+                            e = 27;
+                            break a;
+                          }
+                          if ((a[(c + 7) >> 0] | 0) == 116) {
+                            b = 34;
+                            break a;
+                          } else {
+                            e = 27;
+                            break a;
+                          }
+                        }
+                        case 97: {
+                          if (a[(c + 2) >> 0] | 0) {
+                            e = 27;
+                            break a;
+                          }
+                          if ((a[(c + 3) >> 0] | 0) != 112) {
+                            e = 27;
+                            break a;
+                          }
+                          if (a[(c + 4) >> 0] | 0) {
+                            e = 27;
+                            break a;
+                          }
+                          if ((a[(c + 5) >> 0] | 0) != 111) {
+                            e = 27;
+                            break a;
+                          }
+                          if (a[(c + 6) >> 0] | 0) {
+                            e = 27;
+                            break a;
+                          }
+                          if ((a[(c + 7) >> 0] | 0) == 115) {
+                            b = 39;
+                            break a;
+                          } else {
+                            e = 27;
+                            break a;
+                          }
+                        }
+                        default: {
+                          e = 27;
+                          break a;
+                        }
+                      }
+                    else e = 27;
+                    break;
+                  }
+                  default:
+                    e = 27;
+                }
+              while (0);
+              if ((e | 0) == 27) b = 0;
+              return b | 0;
+            }
+            function o0(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              j = (b + 72) | 0;
+              k = (g + 4) | 0;
+              while (1) {
+                if (((f - e) | 0) <= 1) break;
+                b = a[e >> 0] | 0;
+                h = a[(e + 1) >> 0] | 0;
+                if (!((b << 24) >> 24)) b = d[(j + (h & 255)) >> 0] | 0;
+                else b = J$(b, h) | 0;
+                switch (b | 0) {
+                  case 5: {
+                    e = (e + 2) | 0;
+                    break;
+                  }
+                  case 6: {
+                    e = (e + 3) | 0;
+                    break;
+                  }
+                  case 7: {
+                    e = (e + 4) | 0;
+                    break;
+                  }
+                  case 10: {
+                    c[k >> 2] = -1;
+                    c[g >> 2] = (c[g >> 2] | 0) + 1;
+                    e = (e + 2) | 0;
+                    break;
+                  }
+                  case 9: {
+                    c[g >> 2] = (c[g >> 2] | 0) + 1;
+                    i = (e + 2) | 0;
+                    if (((f - i) | 0) > 1) {
+                      b = a[i >> 0] | 0;
+                      h = a[(e + 3) >> 0] | 0;
+                      if (!((b << 24) >> 24)) b = d[(j + (h & 255)) >> 0] | 0;
+                      else b = J$(b, h) | 0;
+                      e = (b | 0) == 10 ? (e + 4) | 0 : i;
+                    } else e = i;
+                    c[k >> 2] = -1;
+                    break;
+                  }
+                  default:
+                    e = (e + 2) | 0;
+                }
+                c[k >> 2] = (c[k >> 2] | 0) + 1;
+              }
+              return;
+            }
+            function p0(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              k = (f + -2) | 0;
+              j = (b + 72) | 0;
+              a: while (1) {
+                h = (e + 2) | 0;
+                if (((k - h) | 0) <= 1) {
+                  f = 1;
+                  break;
+                }
+                f = a[h >> 0] | 0;
+                i = (f << 24) >> 24 == 0;
+                b = a[(e + 3) >> 0] | 0;
+                if (i) f = d[(j + (b & 255)) >> 0] | 0;
+                else f = J$(f, b) | 0;
+                switch (f | 0) {
+                  case 23:
+                  case 19:
+                  case 30:
+                  case 33:
+                  case 16:
+                  case 18:
+                  case 10:
+                  case 9:
+                  case 15:
+                  case 14:
+                  case 17:
+                  case 35:
+                  case 34:
+                  case 32:
+                  case 31:
+                  case 13:
+                  case 27:
+                  case 24:
+                  case 25: {
+                    e = h;
+                    continue a;
+                  }
+                  case 21:
+                    if (i & ((b << 24) >> 24 == 9)) {
+                      l = 12;
+                      break a;
+                    } else {
+                      e = h;
+                      continue a;
+                    }
+                  case 22:
+                  case 26: {
+                    if (!i) {
+                      l = 12;
+                      break a;
+                    }
+                    if ((b << 24) >> 24 >= 0) {
+                      e = h;
+                      continue a;
+                    }
+                    break;
+                  }
+                  default:
+                    if (!i) {
+                      l = 12;
+                      break a;
+                    }
+                }
+                switch (((b << 24) >> 24) | 0) {
+                  case 64:
+                  case 36: {
+                    e = h;
+                    break;
+                  }
+                  default: {
+                    l = 12;
+                    break a;
+                  }
+                }
+              }
+              if ((l | 0) == 12) {
+                c[g >> 2] = h;
+                f = 0;
+              }
+              return f | 0;
+            }
+            function q0(b, e, f, g, h) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              j = c[e >> 2] | 0;
+              k = (j + ((f - j) & -2)) | 0;
+              l = k;
+              m = h;
+              a: while (1) {
+                if (j >>> 0 >= k >>> 0) {
+                  b = 0;
+                  break;
+                }
+                i = a[(j + 1) >> 0] | 0;
+                b = a[j >> 0] | 0;
+                f = b & 255;
+                switch ((b << 24) >> 24) {
+                  case 0: {
+                    if ((i << 24) >> 24 > -1) {
+                      b = c[g >> 2] | 0;
+                      if ((b | 0) == (h | 0)) {
+                        b = 2;
+                        break a;
+                      }
+                      c[g >> 2] = b + 1;
+                      a[b >> 0] = i;
+                      b = j;
+                    } else n = 7;
+                    break;
+                  }
+                  case 7:
+                  case 6:
+                  case 5:
+                  case 4:
+                  case 3:
+                  case 2:
+                  case 1: {
+                    n = 7;
+                    break;
+                  }
+                  case -37:
+                  case -38:
+                  case -39:
+                  case -40: {
+                    b = c[g >> 2] | 0;
+                    if (((m - b) | 0) < 4) {
+                      b = 2;
+                      break a;
+                    }
+                    if (((l - j) | 0) < 4) {
+                      b = 1;
+                      break a;
+                    }
+                    o = i & 255;
+                    i = ((((f << 2) & 12) | (o >>> 6)) + 1) | 0;
+                    c[g >> 2] = b + 1;
+                    a[b >> 0] = (i >>> 2) | 240;
+                    b = c[g >> 2] | 0;
+                    c[g >> 2] = b + 1;
+                    a[b >> 0] = ((o >>> 2) & 15) | ((i << 4) & 48) | 128;
+                    b = (j + 2) | 0;
+                    i = d[(j + 3) >> 0] | 0;
+                    f = (((o << 4) & 48) | (i >>> 6) | ((a[b >> 0] << 2) & 12) | 128) & 255;
+                    j = c[g >> 2] | 0;
+                    c[g >> 2] = j + 1;
+                    a[j >> 0] = f;
+                    j = c[g >> 2] | 0;
+                    c[g >> 2] = j + 1;
+                    a[j >> 0] = (i & 63) | 128;
+                    break;
+                  }
+                  default: {
+                    b = c[g >> 2] | 0;
+                    if (((m - b) | 0) < 3) {
+                      b = 2;
+                      break a;
+                    }
+                    c[g >> 2] = b + 1;
+                    a[b >> 0] = (f >>> 4) | 224;
+                    o = i & 255;
+                    b = c[g >> 2] | 0;
+                    c[g >> 2] = b + 1;
+                    a[b >> 0] = (o >>> 6) | ((f << 2) & 60) | 128;
+                    b = c[g >> 2] | 0;
+                    c[g >> 2] = b + 1;
+                    a[b >> 0] = (o & 63) | 128;
+                    b = j;
+                  }
+                }
+                if ((n | 0) == 7) {
+                  n = 0;
+                  b = c[g >> 2] | 0;
+                  if (((m - b) | 0) < 2) {
+                    b = 2;
+                    break;
+                  }
+                  o = i & 255;
+                  c[g >> 2] = b + 1;
+                  a[b >> 0] = (o >>> 6) | (f << 2) | 192;
+                  b = c[g >> 2] | 0;
+                  c[g >> 2] = b + 1;
+                  a[b >> 0] = (o & 63) | 128;
+                  b = j;
+                }
+                j = (b + 2) | 0;
+              }
+              c[e >> 2] = j;
+              return b | 0;
+            }
+            function r0(e, f, g, h, i) {
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              i = i | 0;
+              var j = 0,
+                k = 0,
+                l = 0;
+              j = c[f >> 2] | 0;
+              l = (g - j) & -2;
+              e = (j + l) | 0;
+              if ((l | 0) > ((i - (c[h >> 2] | 0)) | 0)) {
+                k = (e + -2) | 0;
+                g = ((a[k >> 0] & -8) << 24) >> 24 == -40;
+                l = g & 1;
+                e = g ? k : e;
+              } else l = 0;
+              g = j;
+              while (1) {
+                j = g >>> 0 < e >>> 0;
+                k = c[h >> 2] | 0;
+                if (!(j & (k >>> 0 < i >>> 0))) break;
+                j = (((d[g >> 0] | 0) << 8) | (d[(g + 1) >> 0] | 0)) & 65535;
+                c[h >> 2] = k + 2;
+                b[k >> 1] = j;
+                k = ((c[f >> 2] | 0) + 2) | 0;
+                c[f >> 2] = k;
+                g = k;
+              }
+              return (((k | 0) != (i | 0)) | (j ^ 1) ? l : 2) | 0;
+            }
+            function s0(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              l = f;
+              j = (l - e) | 0;
+              a: do
+                if ((j | 0) > 1) {
+                  k = a[e >> 0] | 0;
+                  if (!((k << 24) >> 24)) {
+                    i = a[(e + 1) >> 0] | 0;
+                    h = d[(b + 72 + (i & 255)) >> 0] | 0;
+                  } else {
+                    i = a[(e + 1) >> 0] | 0;
+                    h = J$(k, i) | 0;
+                  }
+                  switch (h | 0) {
+                    case 29: {
+                      j = i & 255;
+                      if (
+                        !(
+                          (1 << (j & 31)) &
+                          c[(56940 + (((j >>> 5) | ((d[(143788 + (k & 255)) >> 0] | 0) << 3)) << 2)) >> 2]
+                        )
+                      ) {
+                        c[g >> 2] = e;
+                        b = 0;
+                        break a;
+                      }
+                      break;
+                    }
+                    case 24:
+                    case 22:
+                      break;
+                    case 5: {
+                      c[g >> 2] = e;
+                      b = 0;
+                      break a;
+                    }
+                    case 6: {
+                      if ((j | 0) < 3) {
+                        b = -2;
+                        break a;
+                      }
+                      c[g >> 2] = e;
+                      b = 0;
+                      break a;
+                    }
+                    case 7: {
+                      if ((j | 0) < 4) {
+                        b = -2;
+                        break a;
+                      }
+                      c[g >> 2] = e;
+                      b = 0;
+                      break a;
+                    }
+                    case 19: {
+                      b = u0(b, (e + 2) | 0, f, g) | 0;
+                      break a;
+                    }
+                    default: {
+                      c[g >> 2] = e;
+                      b = 0;
+                      break a;
+                    }
+                  }
+                  k = (b + 72) | 0;
+                  j = e;
+                  b: while (1) {
+                    i = (j + 2) | 0;
+                    e = (l - i) | 0;
+                    if ((e | 0) <= 1) {
+                      b = -1;
+                      break a;
+                    }
+                    b = a[i >> 0] | 0;
+                    f = a[(j + 3) >> 0] | 0;
+                    if (!((b << 24) >> 24)) h = d[(k + (f & 255)) >> 0] | 0;
+                    else h = J$(b, f) | 0;
+                    switch (h | 0) {
+                      case 27:
+                      case 26:
+                      case 25:
+                      case 24:
+                      case 22: {
+                        j = i;
+                        continue b;
+                      }
+                      case 5: {
+                        f = 23;
+                        break b;
+                      }
+                      case 6: {
+                        f = 24;
+                        break b;
+                      }
+                      case 7: {
+                        f = 26;
+                        break b;
+                      }
+                      case 18: {
+                        f = 28;
+                        break b;
+                      }
+                      case 29:
+                        break;
+                      default: {
+                        f = 29;
+                        break b;
+                      }
+                    }
+                    e = f & 255;
+                    if (
+                      !(
+                        (1 << (e & 31)) &
+                        c[(56940 + (((e >>> 5) | ((d[(144044 + (b & 255)) >> 0] | 0) << 3)) << 2)) >> 2]
+                      )
+                    ) {
+                      f = 22;
+                      break;
+                    } else j = i;
+                  }
+                  if ((f | 0) == 22) {
+                    c[g >> 2] = i;
+                    b = 0;
+                    break;
+                  } else if ((f | 0) == 23) {
+                    c[g >> 2] = i;
+                    b = 0;
+                    break;
+                  } else if ((f | 0) == 24) {
+                    if ((e | 0) < 3) {
+                      b = -2;
+                      break;
+                    }
+                    c[g >> 2] = i;
+                    b = 0;
+                    break;
+                  } else if ((f | 0) == 26) {
+                    if ((e | 0) < 4) {
+                      b = -2;
+                      break;
+                    }
+                    c[g >> 2] = i;
+                    b = 0;
+                    break;
+                  } else if ((f | 0) == 28) {
+                    c[g >> 2] = j + 4;
+                    b = 9;
+                    break;
+                  } else if ((f | 0) == 29) {
+                    c[g >> 2] = i;
+                    b = 0;
+                    break;
+                  }
+                } else b = -1;
+              while (0);
+              return b | 0;
+            }
+            function t0(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              j = (f - e) | 0;
+              a: do
+                if ((j | 0) > 1) {
+                  k = a[e >> 0] | 0;
+                  if (!((k << 24) >> 24)) {
+                    i = a[(e + 1) >> 0] | 0;
+                    h = d[(b + 72 + (i & 255)) >> 0] | 0;
+                  } else {
+                    i = a[(e + 1) >> 0] | 0;
+                    h = J$(k, i) | 0;
+                  }
+                  switch (h | 0) {
+                    case 29: {
+                      l = i & 255;
+                      if (
+                        !(
+                          (1 << (l & 31)) &
+                          c[(56940 + (((l >>> 5) | ((d[(143788 + (k & 255)) >> 0] | 0) << 3)) << 2)) >> 2]
+                        )
+                      ) {
+                        c[g >> 2] = e;
+                        f = 0;
+                        break a;
+                      }
+                      break;
+                    }
+                    case 24:
+                    case 22:
+                      break;
+                    case 5: {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    case 6: {
+                      if ((j | 0) < 3) {
+                        f = -2;
+                        break a;
+                      }
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    case 7: {
+                      if ((j | 0) < 4) {
+                        f = -2;
+                        break a;
+                      }
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    case 30:
+                    case 9:
+                    case 10:
+                    case 21: {
+                      c[g >> 2] = e;
+                      f = 22;
+                      break a;
+                    }
+                    default: {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                  }
+                  l = (b + 72) | 0;
+                  b = e;
+                  b: while (1) {
+                    k = (b + 2) | 0;
+                    e = (f - k) | 0;
+                    if ((e | 0) <= 1) {
+                      f = -1;
+                      break a;
+                    }
+                    h = a[k >> 0] | 0;
+                    i = a[(b + 3) >> 0] | 0;
+                    if (!((h << 24) >> 24)) j = d[(l + (i & 255)) >> 0] | 0;
+                    else j = J$(h, i) | 0;
+                    switch (j | 0) {
+                      case 27:
+                      case 26:
+                      case 25:
+                      case 24:
+                      case 22: {
+                        b = k;
+                        continue b;
+                      }
+                      case 5: {
+                        h = 23;
+                        break b;
+                      }
+                      case 6: {
+                        h = 24;
+                        break b;
+                      }
+                      case 7: {
+                        h = 26;
+                        break b;
+                      }
+                      case 18: {
+                        h = 28;
+                        break b;
+                      }
+                      case 29:
+                        break;
+                      default: {
+                        h = 29;
+                        break b;
+                      }
+                    }
+                    e = i & 255;
+                    if (
+                      !(
+                        (1 << (e & 31)) &
+                        c[(56940 + (((e >>> 5) | ((d[(144044 + (h & 255)) >> 0] | 0) << 3)) << 2)) >> 2]
+                      )
+                    ) {
+                      h = 22;
+                      break;
+                    } else b = k;
+                  }
+                  if ((h | 0) == 22) {
+                    c[g >> 2] = k;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 23) {
+                    c[g >> 2] = k;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 24) {
+                    if ((e | 0) < 3) {
+                      f = -2;
+                      break;
+                    }
+                    c[g >> 2] = k;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 26) {
+                    if ((e | 0) < 4) {
+                      f = -2;
+                      break;
+                    }
+                    c[g >> 2] = k;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 28) {
+                    c[g >> 2] = b + 4;
+                    f = 28;
+                    break;
+                  } else if ((h | 0) == 29) {
+                    c[g >> 2] = k;
+                    f = 0;
+                    break;
+                  }
+                } else f = -1;
+              while (0);
+              return f | 0;
+            }
+            function u0(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = f;
+              a: do
+                if (((k - e) | 0) > 1) {
+                  i = a[e >> 0] | 0;
+                  h = a[(e + 1) >> 0] | 0;
+                  do
+                    if (!((i << 24) >> 24))
+                      if ((h << 24) >> 24 == 120) {
+                        h = v0(b, (e + 2) | 0, f, g) | 0;
+                        break a;
+                      } else {
+                        h = d[(b + 72 + (h & 255)) >> 0] | 0;
+                        break;
+                      }
+                    else h = J$(i, h) | 0;
+                  while (0);
+                  if ((h | 0) != 25) {
+                    c[g >> 2] = e;
+                    h = 0;
+                    break;
+                  }
+                  j = (b + 72) | 0;
+                  b = e;
+                  b: while (1) {
+                    i = (b + 2) | 0;
+                    if (((k - i) | 0) <= 1) {
+                      h = -1;
+                      break a;
+                    }
+                    h = a[i >> 0] | 0;
+                    f = a[(b + 3) >> 0] | 0;
+                    if (!((h << 24) >> 24)) h = d[(j + (f & 255)) >> 0] | 0;
+                    else h = J$(h, f) | 0;
+                    switch (h | 0) {
+                      case 25: {
+                        b = i;
+                        break;
+                      }
+                      case 18: {
+                        f = 15;
+                        break b;
+                      }
+                      default: {
+                        f = 16;
+                        break b;
+                      }
+                    }
+                  }
+                  if ((f | 0) == 15) {
+                    c[g >> 2] = b + 4;
+                    h = 10;
+                    break;
+                  } else if ((f | 0) == 16) {
+                    c[g >> 2] = i;
+                    h = 0;
+                    break;
+                  }
+                } else h = -1;
+              while (0);
+              return h | 0;
+            }
+            function v0(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0;
+              a: do
+                if (((f - e) | 0) > 1) {
+                  h = a[e >> 0] | 0;
+                  if (!((h << 24) >> 24)) h = d[(b + 72 + (d[(e + 1) >> 0] | 0)) >> 0] | 0;
+                  else h = J$(h, a[(e + 1) >> 0] | 0) | 0;
+                  if (((h & -2) | 0) != 24) {
+                    c[g >> 2] = e;
+                    f = 0;
+                    break;
+                  }
+                  j = (b + 72) | 0;
+                  b: while (1) {
+                    i = (e + 2) | 0;
+                    if (((f - i) | 0) <= 1) {
+                      f = -1;
+                      break a;
+                    }
+                    h = a[i >> 0] | 0;
+                    b = a[(e + 3) >> 0] | 0;
+                    if (!((h << 24) >> 24)) h = d[(j + (b & 255)) >> 0] | 0;
+                    else h = J$(h, b) | 0;
+                    switch (h | 0) {
+                      case 24:
+                      case 25: {
+                        e = i;
+                        break;
+                      }
+                      case 18: {
+                        h = 13;
+                        break b;
+                      }
+                      default: {
+                        h = 14;
+                        break b;
+                      }
+                    }
+                  }
+                  if ((h | 0) == 13) {
+                    c[g >> 2] = e + 4;
+                    f = 10;
+                    break;
+                  } else if ((h | 0) == 14) {
+                    c[g >> 2] = i;
+                    f = 0;
+                    break;
+                  }
+                } else f = -1;
+              while (0);
+              return f | 0;
+            }
+            function w0(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              o = f;
+              j = (o - e) | 0;
+              a: do
+                if ((j | 0) > 1) {
+                  k = a[e >> 0] | 0;
+                  if (!((k << 24) >> 24)) {
+                    i = a[(e + 1) >> 0] | 0;
+                    h = d[(b + 72 + (i & 255)) >> 0] | 0;
+                  } else {
+                    i = a[(e + 1) >> 0] | 0;
+                    h = J$(k, i) | 0;
+                  }
+                  switch (h | 0) {
+                    case 29: {
+                      m = i & 255;
+                      if (
+                        !((1 << (m & 31)) & c[(56940 + (((m >>> 5) | (d[(143788 + (k & 255)) >> 0] << 3)) << 2)) >> 2])
+                      ) {
+                        c[g >> 2] = e;
+                        h = 0;
+                        break a;
+                      }
+                      break;
+                    }
+                    case 24:
+                    case 22:
+                      break;
+                    case 5: {
+                      c[g >> 2] = e;
+                      h = 0;
+                      break a;
+                    }
+                    case 6: {
+                      if ((j | 0) < 3) {
+                        h = -2;
+                        break a;
+                      }
+                      c[g >> 2] = e;
+                      h = 0;
+                      break a;
+                    }
+                    case 7: {
+                      if ((j | 0) < 4) {
+                        h = -2;
+                        break a;
+                      }
+                      c[g >> 2] = e;
+                      h = 0;
+                      break a;
+                    }
+                    case 16: {
+                      i = (e + 2) | 0;
+                      if (((o - i) | 0) <= 1) {
+                        h = -1;
+                        break a;
+                      }
+                      h = a[i >> 0] | 0;
+                      if (!((h << 24) >> 24)) h = d[(b + 72 + (d[(e + 3) >> 0] | 0)) >> 0] | 0;
+                      else h = J$(h, a[(e + 3) >> 0] | 0) | 0;
+                      switch (h | 0) {
+                        case 27: {
+                          h = x0(b, (e + 4) | 0, f, g) | 0;
+                          break a;
+                        }
+                        case 20: {
+                          h = y0((e + 4) | 0, f, g) | 0;
+                          break a;
+                        }
+                        default: {
+                          c[g >> 2] = i;
+                          h = 0;
+                          break a;
+                        }
+                      }
+                    }
+                    case 15: {
+                      h = z0(b, (e + 2) | 0, f, g) | 0;
+                      break a;
+                    }
+                    case 17: {
+                      h = A0(b, (e + 2) | 0, f, g) | 0;
+                      break a;
+                    }
+                    default: {
+                      c[g >> 2] = e;
+                      h = 0;
+                      break a;
+                    }
+                  }
+                  m = (b + 72) | 0;
+                  l = 0;
+                  h = (e + 2) | 0;
+                  b: while (1) {
+                    c: while (1) {
+                      i = (o - h) | 0;
+                      if ((i | 0) <= 1) {
+                        h = -1;
+                        break a;
+                      }
+                      j = a[h >> 0] | 0;
+                      k = a[(h + 1) >> 0] | 0;
+                      if (!((j << 24) >> 24)) e = d[(m + (k & 255)) >> 0] | 0;
+                      else e = J$(j, k) | 0;
+                      switch (e | 0) {
+                        case 5: {
+                          n = 34;
+                          break b;
+                        }
+                        case 6: {
+                          n = 35;
+                          break b;
+                        }
+                        case 7: {
+                          n = 37;
+                          break b;
+                        }
+                        case 10:
+                        case 9:
+                        case 21: {
+                          n = 55;
+                          break b;
+                        }
+                        case 11: {
+                          n = 69;
+                          break b;
+                        }
+                        case 17:
+                          break b;
+                        case 23:
+                          break c;
+                        case 29: {
+                          e = k & 255;
+                          if (
+                            !(
+                              (1 << (e & 31)) &
+                              c[(56940 + (((e >>> 5) | (d[(144044 + (j & 255)) >> 0] << 3)) << 2)) >> 2]
+                            )
+                          ) {
+                            n = 32;
+                            break b;
+                          }
+                          break;
+                        }
+                        case 27:
+                        case 26:
+                        case 25:
+                        case 24:
+                        case 22:
+                          break;
+                        default: {
+                          n = 75;
+                          break b;
+                        }
+                      }
+                      h = (h + 2) | 0;
+                    }
+                    if (l | 0) {
+                      n = 40;
+                      break;
+                    }
+                    e = (h + 2) | 0;
+                    l = (o - e) | 0;
+                    if ((l | 0) <= 1) {
+                      h = -1;
+                      break a;
+                    }
+                    i = a[e >> 0] | 0;
+                    j = a[(h + 3) >> 0] | 0;
+                    if (!((i << 24) >> 24)) k = d[(m + (j & 255)) >> 0] | 0;
+                    else k = J$(i, j) | 0;
+                    switch (k | 0) {
+                      case 5: {
+                        n = 49;
+                        break b;
+                      }
+                      case 6: {
+                        n = 50;
+                        break b;
+                      }
+                      case 7: {
+                        n = 52;
+                        break b;
+                      }
+                      case 29: {
+                        l = j & 255;
+                        if (
+                          !(
+                            (1 << (l & 31)) &
+                            c[(56940 + (((l >>> 5) | (d[(143788 + (i & 255)) >> 0] << 3)) << 2)) >> 2]
+                          )
+                        ) {
+                          n = 47;
+                          break b;
+                        }
+                        break;
+                      }
+                      case 24:
+                      case 22:
+                        break;
+                      default: {
+                        n = 54;
+                        break b;
+                      }
+                    }
+                    l = 1;
+                    h = (h + 4) | 0;
+                  }
+                  d: switch (n | 0) {
+                    case 32: {
+                      c[g >> 2] = h;
+                      h = 0;
+                      break a;
+                    }
+                    case 34: {
+                      c[g >> 2] = h;
+                      h = 0;
+                      break a;
+                    }
+                    case 35: {
+                      if ((i | 0) < 3) {
+                        h = -2;
+                        break a;
+                      }
+                      c[g >> 2] = h;
+                      h = 0;
+                      break a;
+                    }
+                    case 37: {
+                      if ((i | 0) < 4) {
+                        h = -2;
+                        break a;
+                      }
+                      c[g >> 2] = h;
+                      h = 0;
+                      break a;
+                    }
+                    case 40: {
+                      c[g >> 2] = h;
+                      h = 0;
+                      break a;
+                    }
+                    case 47: {
+                      c[g >> 2] = e;
+                      h = 0;
+                      break a;
+                    }
+                    case 49: {
+                      c[g >> 2] = e;
+                      h = 0;
+                      break a;
+                    }
+                    case 50: {
+                      if ((l | 0) < 3) {
+                        h = -2;
+                        break a;
+                      }
+                      c[g >> 2] = e;
+                      h = 0;
+                      break a;
+                    }
+                    case 52: {
+                      if ((l | 0) < 4) {
+                        h = -2;
+                        break a;
+                      }
+                      c[g >> 2] = e;
+                      h = 0;
+                      break a;
+                    }
+                    case 54: {
+                      c[g >> 2] = e;
+                      h = 0;
+                      break a;
+                    }
+                    case 55: {
+                      e: while (1) {
+                        n = 0;
+                        i = (h + 2) | 0;
+                        j = (o - i) | 0;
+                        if ((j | 0) <= 1) {
+                          h = -1;
+                          break a;
+                        }
+                        k = a[i >> 0] | 0;
+                        e = a[(h + 3) >> 0] | 0;
+                        if (!((k << 24) >> 24)) l = d[(m + (e & 255)) >> 0] | 0;
+                        else l = J$(k, e) | 0;
+                        switch (l | 0) {
+                          case 11: {
+                            h = i;
+                            n = 69;
+                            break d;
+                          }
+                          case 17: {
+                            h = i;
+                            break d;
+                          }
+                          case 10:
+                          case 9:
+                          case 21: {
+                            h = i;
+                            n = 55;
+                            break;
+                          }
+                          case 29: {
+                            n = 60;
+                            break e;
+                          }
+                          case 24:
+                          case 22:
+                            break e;
+                          case 5: {
+                            n = 63;
+                            break e;
+                          }
+                          case 6: {
+                            n = 64;
+                            break e;
+                          }
+                          case 7: {
+                            n = 66;
+                            break e;
+                          }
+                          default: {
+                            n = 68;
+                            break e;
+                          }
+                        }
+                      }
+                      if ((n | 0) == 60) {
+                        o = e & 255;
+                        if (
+                          !(
+                            (1 << (o & 31)) &
+                            c[(56940 + (((o >>> 5) | (d[(143788 + (k & 255)) >> 0] << 3)) << 2)) >> 2]
+                          )
+                        ) {
+                          c[g >> 2] = i;
+                          h = 0;
+                          break a;
+                        }
+                      } else if ((n | 0) == 63) {
+                        c[g >> 2] = i;
+                        h = 0;
+                        break a;
+                      } else if ((n | 0) == 64) {
+                        if ((j | 0) < 3) {
+                          h = -2;
+                          break a;
+                        }
+                        c[g >> 2] = i;
+                        h = 0;
+                        break a;
+                      } else if ((n | 0) == 66) {
+                        if ((j | 0) < 4) {
+                          h = -2;
+                          break a;
+                        }
+                        c[g >> 2] = i;
+                        h = 0;
+                        break a;
+                      } else if ((n | 0) == 68) {
+                        c[g >> 2] = i;
+                        h = 0;
+                        break a;
+                      }
+                      h = B0(b, (h + 4) | 0, f, g) | 0;
+                      break a;
+                    }
+                    case 75: {
+                      c[g >> 2] = h;
+                      h = 0;
+                      break a;
+                    }
+                  }
+                  if ((n | 0) == 69) {
+                    c[g >> 2] = h + 2;
+                    h = 2;
+                    break;
+                  }
+                  i = (h + 2) | 0;
+                  if (((o - i) | 0) > 1) {
+                    if ((a[i >> 0] | 0) == 0 ? (a[(h + 3) >> 0] | 0) == 62 : 0) {
+                      c[g >> 2] = h + 4;
+                      h = 4;
+                      break;
+                    }
+                    c[g >> 2] = i;
+                    h = 0;
+                  } else h = -1;
+                } else h = -1;
+              while (0);
+              return h | 0;
+            }
+            function x0(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              j = f;
+              a: do
+                if (((j - e) | 0) > 1) {
+                  if ((a[e >> 0] | 0) == 0 ? (a[(e + 1) >> 0] | 0) == 45 : 0) {
+                    i = (b + 72) | 0;
+                    h = (e + 2) | 0;
+                    b: while (1) {
+                      e = (j - h) | 0;
+                      if ((e | 0) <= 1) {
+                        f = -1;
+                        break a;
+                      }
+                      f = a[h >> 0] | 0;
+                      b = a[(h + 1) >> 0] | 0;
+                      if (!((f << 24) >> 24)) f = d[(i + (b & 255)) >> 0] | 0;
+                      else f = J$(f, b) | 0;
+                      switch (f | 0) {
+                        case 8:
+                        case 1:
+                        case 0: {
+                          k = 16;
+                          break b;
+                        }
+                        case 5: {
+                          h = (h + 2) | 0;
+                          continue b;
+                        }
+                        case 6: {
+                          if ((e | 0) < 3) {
+                            f = -2;
+                            break a;
+                          }
+                          h = (h + 3) | 0;
+                          continue b;
+                        }
+                        case 7: {
+                          if ((e | 0) < 4) {
+                            f = -2;
+                            break a;
+                          }
+                          h = (h + 4) | 0;
+                          continue b;
+                        }
+                        case 27: {
+                          f = (h + 2) | 0;
+                          if (((j - f) | 0) <= 1) {
+                            f = -1;
+                            break a;
+                          }
+                          if (a[f >> 0] | 0) {
+                            h = f;
+                            continue b;
+                          }
+                          if ((a[(h + 3) >> 0] | 0) == 45) break b;
+                          else {
+                            h = f;
+                            continue b;
+                          }
+                        }
+                        default: {
+                          h = (h + 2) | 0;
+                          continue b;
+                        }
+                      }
+                    }
+                    if ((k | 0) == 16) {
+                      c[g >> 2] = h;
+                      f = 0;
+                      break;
+                    }
+                    f = (h + 4) | 0;
+                    if (((j - f) | 0) <= 1) {
+                      f = -1;
+                      break;
+                    }
+                    if ((a[f >> 0] | 0) == 0 ? (a[(h + 5) >> 0] | 0) == 62 : 0) {
+                      c[g >> 2] = h + 6;
+                      f = 13;
+                      break;
+                    }
+                    c[g >> 2] = f;
+                    f = 0;
+                    break;
+                  }
+                  c[g >> 2] = e;
+                  f = 0;
+                } else f = -1;
+              while (0);
+              return f | 0;
+            }
+            function y0(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              if (((d - b) | 0) > 11) {
+                d = 0;
+                while (1) {
+                  if ((d | 0) >= 6) {
+                    d = 8;
+                    break;
+                  }
+                  if (a[b >> 0] | 0) {
+                    d = 0;
+                    break;
+                  }
+                  if ((a[(b + 1) >> 0] | 0) != (a[(144300 + d) >> 0] | 0)) {
+                    d = 0;
+                    break;
+                  }
+                  d = (d + 1) | 0;
+                  b = (b + 2) | 0;
+                }
+                c[e >> 2] = b;
+              } else d = -1;
+              return d | 0;
+            }
+            function z0(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              q = l;
+              l = (l + 16) | 0;
+              p = q;
+              o = f;
+              i = (o - e) | 0;
+              a: do
+                if ((i | 0) > 1) {
+                  j = a[e >> 0] | 0;
+                  if (!((j << 24) >> 24)) {
+                    h = a[(e + 1) >> 0] | 0;
+                    f = d[(b + 72 + (h & 255)) >> 0] | 0;
+                  } else {
+                    h = a[(e + 1) >> 0] | 0;
+                    f = J$(j, h) | 0;
+                  }
+                  switch (f | 0) {
+                    case 29: {
+                      m = h & 255;
+                      if (
+                        !((1 << (m & 31)) & c[(56940 + (((m >>> 5) | (d[(143788 + (j & 255)) >> 0] << 3)) << 2)) >> 2])
+                      ) {
+                        c[g >> 2] = e;
+                        f = 0;
+                        break a;
+                      }
+                      break;
+                    }
+                    case 24:
+                    case 22:
+                      break;
+                    case 5: {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    case 6: {
+                      if ((i | 0) < 3) {
+                        f = -2;
+                        break a;
+                      }
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    case 7: {
+                      if ((i | 0) < 4) {
+                        f = -2;
+                        break a;
+                      }
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    default: {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                  }
+                  m = (b + 72) | 0;
+                  k = e;
+                  b: while (1) {
+                    f = (k + 2) | 0;
+                    h = (o - f) | 0;
+                    if ((h | 0) <= 1) {
+                      f = -1;
+                      break a;
+                    }
+                    i = a[f >> 0] | 0;
+                    j = a[(k + 3) >> 0] | 0;
+                    if (!((i << 24) >> 24)) b = d[(m + (j & 255)) >> 0] | 0;
+                    else b = J$(i, j) | 0;
+                    switch (b | 0) {
+                      case 27:
+                      case 26:
+                      case 25:
+                      case 24:
+                      case 22: {
+                        k = f;
+                        continue b;
+                      }
+                      case 5: {
+                        n = 22;
+                        break b;
+                      }
+                      case 6: {
+                        n = 23;
+                        break b;
+                      }
+                      case 7: {
+                        n = 25;
+                        break b;
+                      }
+                      case 10:
+                      case 9:
+                      case 21: {
+                        n = 27;
+                        break b;
+                      }
+                      case 15: {
+                        n = 46;
+                        break b;
+                      }
+                      case 29:
+                        break;
+                      default:
+                        break b;
+                    }
+                    k = j & 255;
+                    if (
+                      !((1 << (k & 31)) & c[(56940 + (((k >>> 5) | (d[(144044 + (i & 255)) >> 0] << 3)) << 2)) >> 2])
+                    ) {
+                      n = 21;
+                      break;
+                    } else k = f;
+                  }
+                  if ((n | 0) == 21) {
+                    c[g >> 2] = f;
+                    f = 0;
+                    break;
+                  } else if ((n | 0) == 22) {
+                    c[g >> 2] = f;
+                    f = 0;
+                    break;
+                  } else if ((n | 0) == 23) {
+                    if ((h | 0) < 3) {
+                      f = -2;
+                      break;
+                    }
+                    c[g >> 2] = f;
+                    f = 0;
+                    break;
+                  } else if ((n | 0) == 25) {
+                    if ((h | 0) < 4) {
+                      f = -2;
+                      break;
+                    }
+                    c[g >> 2] = f;
+                    f = 0;
+                    break;
+                  } else if ((n | 0) == 27) {
+                    if (!(C0(e, f, p) | 0)) {
+                      c[g >> 2] = f;
+                      f = 0;
+                      break;
+                    }
+                    j = (k + 4) | 0;
+                    c: while (1) {
+                      i = (o - j) | 0;
+                      if ((i | 0) <= 1) {
+                        f = -1;
+                        break a;
+                      }
+                      f = a[j >> 0] | 0;
+                      h = a[(j + 1) >> 0] | 0;
+                      if (!((f << 24) >> 24)) f = d[(m + (h & 255)) >> 0] | 0;
+                      else f = J$(f, h) | 0;
+                      switch (f | 0) {
+                        case 8:
+                        case 1:
+                        case 0: {
+                          n = 40;
+                          break c;
+                        }
+                        case 5: {
+                          j = (j + 2) | 0;
+                          continue c;
+                        }
+                        case 6: {
+                          if ((i | 0) < 3) {
+                            f = -2;
+                            break a;
+                          }
+                          j = (j + 3) | 0;
+                          continue c;
+                        }
+                        case 7: {
+                          if ((i | 0) < 4) {
+                            f = -2;
+                            break a;
+                          }
+                          j = (j + 4) | 0;
+                          continue c;
+                        }
+                        case 15: {
+                          f = (j + 2) | 0;
+                          if (((o - f) | 0) <= 1) {
+                            f = -1;
+                            break a;
+                          }
+                          if (a[f >> 0] | 0) {
+                            j = f;
+                            continue c;
+                          }
+                          if ((a[(j + 3) >> 0] | 0) == 62) {
+                            n = 44;
+                            break c;
+                          } else {
+                            j = f;
+                            continue c;
+                          }
+                        }
+                        default: {
+                          j = (j + 2) | 0;
+                          continue c;
+                        }
+                      }
+                    }
+                    if ((n | 0) == 40) {
+                      c[g >> 2] = j;
+                      f = 0;
+                      break;
+                    } else if ((n | 0) == 44) {
+                      c[g >> 2] = j + 4;
+                      f = c[p >> 2] | 0;
+                      break;
+                    }
+                  } else if ((n | 0) == 46) {
+                    if (!(C0(e, f, p) | 0)) {
+                      c[g >> 2] = f;
+                      f = 0;
+                      break;
+                    }
+                    f = (k + 4) | 0;
+                    if (((o - f) | 0) <= 1) {
+                      f = -1;
+                      break;
+                    }
+                    if ((a[f >> 0] | 0) == 0 ? (a[(k + 5) >> 0] | 0) == 62 : 0) {
+                      c[g >> 2] = k + 6;
+                      f = c[p >> 2] | 0;
+                      break;
+                    }
+                  }
+                  c[g >> 2] = f;
+                  f = 0;
+                } else f = -1;
+              while (0);
+              l = q;
+              return f | 0;
+            }
+            function A0(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              j = (f - e) | 0;
+              a: do
+                if ((j | 0) > 1) {
+                  k = a[e >> 0] | 0;
+                  if (!((k << 24) >> 24)) {
+                    i = a[(e + 1) >> 0] | 0;
+                    h = d[(b + 72 + (i & 255)) >> 0] | 0;
+                  } else {
+                    i = a[(e + 1) >> 0] | 0;
+                    h = J$(k, i) | 0;
+                  }
+                  switch (h | 0) {
+                    case 29: {
+                      l = i & 255;
+                      if (
+                        !(
+                          (1 << (l & 31)) &
+                          c[(56940 + (((l >>> 5) | ((d[(143788 + (k & 255)) >> 0] | 0) << 3)) << 2)) >> 2]
+                        )
+                      ) {
+                        c[g >> 2] = e;
+                        f = 0;
+                        break a;
+                      }
+                      break;
+                    }
+                    case 24:
+                    case 22:
+                      break;
+                    case 5: {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    case 6: {
+                      if ((j | 0) < 3) {
+                        f = -2;
+                        break a;
+                      }
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    case 7: {
+                      if ((j | 0) < 4) {
+                        f = -2;
+                        break a;
+                      }
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    default: {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                  }
+                  l = (b + 72) | 0;
+                  b = e;
+                  b: while (1) {
+                    j = (b + 2) | 0;
+                    e = (f - j) | 0;
+                    if ((e | 0) <= 1) {
+                      f = -1;
+                      break a;
+                    }
+                    h = a[j >> 0] | 0;
+                    i = a[(b + 3) >> 0] | 0;
+                    if (!((h << 24) >> 24)) k = d[(l + (i & 255)) >> 0] | 0;
+                    else k = J$(h, i) | 0;
+                    switch (k | 0) {
+                      case 23:
+                      case 27:
+                      case 26:
+                      case 25:
+                      case 24:
+                      case 22: {
+                        b = j;
+                        continue b;
+                      }
+                      case 5: {
+                        h = 22;
+                        break b;
+                      }
+                      case 6: {
+                        h = 23;
+                        break b;
+                      }
+                      case 7: {
+                        h = 25;
+                        break b;
+                      }
+                      case 10:
+                      case 9:
+                      case 21: {
+                        h = 27;
+                        break b;
+                      }
+                      case 11: {
+                        h = 34;
+                        break b;
+                      }
+                      case 29:
+                        break;
+                      default: {
+                        h = 35;
+                        break b;
+                      }
+                    }
+                    e = i & 255;
+                    if (
+                      !(
+                        (1 << (e & 31)) &
+                        c[(56940 + (((e >>> 5) | ((d[(144044 + (h & 255)) >> 0] | 0) << 3)) << 2)) >> 2]
+                      )
+                    ) {
+                      h = 21;
+                      break;
+                    } else b = j;
+                  }
+                  if ((h | 0) == 21) {
+                    c[g >> 2] = j;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 22) {
+                    c[g >> 2] = j;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 23) {
+                    if ((e | 0) < 3) {
+                      f = -2;
+                      break;
+                    }
+                    c[g >> 2] = j;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 25) {
+                    if ((e | 0) < 4) {
+                      f = -2;
+                      break;
+                    }
+                    c[g >> 2] = j;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 27) {
+                    c: while (1) {
+                      k = (j + 2) | 0;
+                      if (((f - k) | 0) <= 1) {
+                        f = -1;
+                        break a;
+                      }
+                      h = a[k >> 0] | 0;
+                      i = a[(j + 3) >> 0] | 0;
+                      if (!((h << 24) >> 24)) h = d[(l + (i & 255)) >> 0] | 0;
+                      else h = J$(h, i) | 0;
+                      switch (h | 0) {
+                        case 10:
+                        case 9:
+                        case 21: {
+                          j = k;
+                          h = 27;
+                          break;
+                        }
+                        case 11: {
+                          h = 32;
+                          break c;
+                        }
+                        default: {
+                          h = 33;
+                          break c;
+                        }
+                      }
+                    }
+                    if ((h | 0) == 32) {
+                      c[g >> 2] = j + 4;
+                      f = 5;
+                      break;
+                    } else if ((h | 0) == 33) {
+                      c[g >> 2] = k;
+                      f = 0;
+                      break;
+                    }
+                  } else if ((h | 0) == 34) {
+                    c[g >> 2] = b + 4;
+                    f = 5;
+                    break;
+                  } else if ((h | 0) == 35) {
+                    c[g >> 2] = j;
+                    f = 0;
+                    break;
+                  }
+                } else f = -1;
+              while (0);
+              return f | 0;
+            }
+            function B0(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0;
+              s = l;
+              l = (l + 16) | 0;
+              q = s;
+              c[q >> 2] = e;
+              r = f;
+              o = (b + 72) | 0;
+              h = 0;
+              a: while (1) {
+                b: while (1) {
+                  m = (r - e) | 0;
+                  if ((m | 0) <= 1) {
+                    e = -1;
+                    break a;
+                  }
+                  i = a[e >> 0] | 0;
+                  j = a[(e + 1) >> 0] | 0;
+                  if (!((i << 24) >> 24)) k = d[(o + (j & 255)) >> 0] | 0;
+                  else k = J$(i, j) | 0;
+                  switch (k | 0) {
+                    case 5: {
+                      p = 11;
+                      break a;
+                    }
+                    case 6: {
+                      p = 12;
+                      break a;
+                    }
+                    case 7: {
+                      p = 14;
+                      break a;
+                    }
+                    case 23: {
+                      p = 16;
+                      break b;
+                    }
+                    case 10:
+                    case 9:
+                    case 21: {
+                      p = 31;
+                      break b;
+                    }
+                    case 14: {
+                      p = 37;
+                      break b;
+                    }
+                    case 29: {
+                      n = j & 255;
+                      if (
+                        !((1 << (n & 31)) & c[(56940 + (((n >>> 5) | (d[(144044 + (i & 255)) >> 0] << 3)) << 2)) >> 2])
+                      ) {
+                        p = 9;
+                        break a;
+                      }
+                      break;
+                    }
+                    case 27:
+                    case 26:
+                    case 25:
+                    case 24:
+                    case 22:
+                      break;
+                    default: {
+                      p = 89;
+                      break a;
+                    }
+                  }
+                  n = (e + 2) | 0;
+                  c[q >> 2] = n;
+                  e = n;
+                }
+                c: do
+                  if ((p | 0) == 16) {
+                    p = 0;
+                    if (h | 0) {
+                      p = 17;
+                      break a;
+                    }
+                    h = (e + 2) | 0;
+                    c[q >> 2] = h;
+                    i = h;
+                    j = (r - i) | 0;
+                    if ((j | 0) <= 1) {
+                      e = -1;
+                      break a;
+                    }
+                    k = a[h >> 0] | 0;
+                    m = a[(e + 3) >> 0] | 0;
+                    if (!((k << 24) >> 24)) n = d[(o + (m & 255)) >> 0] | 0;
+                    else n = J$(k, m) | 0;
+                    switch (n | 0) {
+                      case 5: {
+                        p = 25;
+                        break a;
+                      }
+                      case 6: {
+                        p = 26;
+                        break a;
+                      }
+                      case 7: {
+                        p = 28;
+                        break a;
+                      }
+                      case 24:
+                      case 22: {
+                        h = 1;
+                        break c;
+                      }
+                      case 29:
+                        break;
+                      default: {
+                        p = 30;
+                        break a;
+                      }
+                    }
+                    n = m & 255;
+                    if (
+                      !((1 << (n & 31)) & c[(56940 + (((n >>> 5) | (d[(143788 + (k & 255)) >> 0] << 3)) << 2)) >> 2])
+                    ) {
+                      p = 24;
+                      break a;
+                    } else h = 1;
+                  } else if ((p | 0) == 31)
+                    while (1) {
+                      p = 0;
+                      i = (e + 2) | 0;
+                      c[q >> 2] = i;
+                      j = i;
+                      if (((r - j) | 0) <= 1) {
+                        e = -1;
+                        break a;
+                      }
+                      h = a[i >> 0] | 0;
+                      e = a[(e + 3) >> 0] | 0;
+                      if (!((h << 24) >> 24)) e = d[(o + (e & 255)) >> 0] | 0;
+                      else e = J$(h, e) | 0;
+                      switch (e | 0) {
+                        case 14: {
+                          e = i;
+                          p = 37;
+                          break c;
+                        }
+                        case 9:
+                        case 10:
+                        case 21: {
+                          e = i;
+                          p = 31;
+                          break;
+                        }
+                        default: {
+                          p = 36;
+                          break a;
+                        }
+                      }
+                    }
+                while (0);
+                d: do
+                  if ((p | 0) == 37) {
+                    while (1) {
+                      p = 0;
+                      j = (e + 2) | 0;
+                      c[q >> 2] = j;
+                      k = j;
+                      if (((r - k) | 0) <= 1) {
+                        e = -1;
+                        break a;
+                      }
+                      h = a[j >> 0] | 0;
+                      i = a[(e + 3) >> 0] | 0;
+                      if (!((h << 24) >> 24)) m = d[(o + (i & 255)) >> 0] | 0;
+                      else m = J$(h, i) | 0;
+                      if ((m | 1 | 0) == 13) break;
+                      switch (m | 0) {
+                        case 9:
+                        case 10:
+                        case 21: {
+                          e = j;
+                          p = 37;
+                          break;
+                        }
+                        default: {
+                          p = 43;
+                          break a;
+                        }
+                      }
+                    }
+                    e = (e + 4) | 0;
+                    c[q >> 2] = e;
+                    e: while (1) {
+                      j = (r - e) | 0;
+                      if ((j | 0) <= 1) {
+                        e = -1;
+                        break a;
+                      }
+                      h = a[e >> 0] | 0;
+                      i = a[(e + 1) >> 0] | 0;
+                      if (!((h << 24) >> 24)) h = d[(o + (i & 255)) >> 0] | 0;
+                      else h = J$(h, i) | 0;
+                      if ((h | 0) == (m | 0)) break;
+                      switch (h | 0) {
+                        case 8:
+                        case 1:
+                        case 0: {
+                          p = 56;
+                          break a;
+                        }
+                        case 2: {
+                          p = 61;
+                          break a;
+                        }
+                        case 5: {
+                          n = (e + 2) | 0;
+                          c[q >> 2] = n;
+                          e = n;
+                          continue e;
+                        }
+                        case 6: {
+                          if ((j | 0) < 3) {
+                            e = -2;
+                            break a;
+                          }
+                          n = (e + 3) | 0;
+                          c[q >> 2] = n;
+                          e = n;
+                          continue e;
+                        }
+                        case 7: {
+                          if ((j | 0) < 4) {
+                            e = -2;
+                            break a;
+                          }
+                          n = (e + 4) | 0;
+                          c[q >> 2] = n;
+                          e = n;
+                          continue e;
+                        }
+                        case 3: {
+                          e = s0(b, (e + 2) | 0, f, q) | 0;
+                          if ((e | 0) < 1) {
+                            p = 59;
+                            break a;
+                          }
+                          e = c[q >> 2] | 0;
+                          continue e;
+                        }
+                        default: {
+                          n = (e + 2) | 0;
+                          c[q >> 2] = n;
+                          e = n;
+                          continue e;
+                        }
+                      }
+                    }
+                    i = (e + 2) | 0;
+                    c[q >> 2] = i;
+                    k = i;
+                    if (((r - k) | 0) <= 1) {
+                      e = -1;
+                      break a;
+                    }
+                    h = a[i >> 0] | 0;
+                    j = a[(e + 3) >> 0] | 0;
+                    if (!((h << 24) >> 24)) h = d[(o + (j & 255)) >> 0] | 0;
+                    else h = J$(h, j) | 0;
+                    switch (h | 0) {
+                      case 11: {
+                        p = 81;
+                        break a;
+                      }
+                      case 17: {
+                        p = 82;
+                        break a;
+                      }
+                      case 10:
+                      case 9:
+                      case 21: {
+                        e = i;
+                        break;
+                      }
+                      default: {
+                        p = 68;
+                        break a;
+                      }
+                    }
+                    f: while (1) {
+                      i = (e + 2) | 0;
+                      c[q >> 2] = i;
+                      h = i;
+                      j = (r - h) | 0;
+                      if ((j | 0) <= 1) {
+                        e = -1;
+                        break a;
+                      }
+                      k = a[i >> 0] | 0;
+                      m = a[(e + 3) >> 0] | 0;
+                      if (!((k << 24) >> 24)) n = d[(o + (m & 255)) >> 0] | 0;
+                      else n = J$(k, m) | 0;
+                      switch (n | 0) {
+                        case 5: {
+                          p = 76;
+                          break a;
+                        }
+                        case 6: {
+                          p = 77;
+                          break a;
+                        }
+                        case 7: {
+                          p = 79;
+                          break a;
+                        }
+                        case 11: {
+                          p = 81;
+                          break a;
+                        }
+                        case 17: {
+                          p = 82;
+                          break a;
+                        }
+                        case 24:
+                        case 22: {
+                          h = 0;
+                          break d;
+                        }
+                        case 10:
+                        case 9:
+                        case 21: {
+                          e = i;
+                          break;
+                        }
+                        case 29:
+                          break f;
+                        default: {
+                          p = 87;
+                          break a;
+                        }
+                      }
+                    }
+                    n = m & 255;
+                    if (
+                      !((1 << (n & 31)) & c[(56940 + (((n >>> 5) | (d[(143788 + (k & 255)) >> 0] << 3)) << 2)) >> 2])
+                    ) {
+                      p = 75;
+                      break a;
+                    } else h = 0;
+                  }
+                while (0);
+                e = (e + 4) | 0;
+                c[q >> 2] = e;
+              }
+              switch (p | 0) {
+                case 9: {
+                  c[g >> 2] = e;
+                  e = 0;
+                  break;
+                }
+                case 11: {
+                  c[g >> 2] = e;
+                  e = 0;
+                  break;
+                }
+                case 12: {
+                  if ((m | 0) < 3) e = -2;
+                  else {
+                    c[g >> 2] = e;
+                    e = 0;
+                  }
+                  break;
+                }
+                case 14: {
+                  if ((m | 0) < 4) e = -2;
+                  else {
+                    c[g >> 2] = e;
+                    e = 0;
+                  }
+                  break;
+                }
+                case 17: {
+                  c[g >> 2] = e;
+                  e = 0;
+                  break;
+                }
+                case 24: {
+                  c[g >> 2] = h;
+                  e = 0;
+                  break;
+                }
+                case 25: {
+                  c[g >> 2] = h;
+                  e = 0;
+                  break;
+                }
+                case 26: {
+                  if ((j | 0) < 3) e = -2;
+                  else {
+                    c[g >> 2] = h;
+                    e = 0;
+                  }
+                  break;
+                }
+                case 28: {
+                  if ((j | 0) < 4) e = -2;
+                  else {
+                    c[g >> 2] = h;
+                    e = 0;
+                  }
+                  break;
+                }
+                case 30: {
+                  c[g >> 2] = i;
+                  e = 0;
+                  break;
+                }
+                case 36: {
+                  c[g >> 2] = j;
+                  e = 0;
+                  break;
+                }
+                case 43: {
+                  c[g >> 2] = k;
+                  e = 0;
+                  break;
+                }
+                case 56: {
+                  c[g >> 2] = e;
+                  e = 0;
+                  break;
+                }
+                case 59: {
+                  if (!e) {
+                    c[g >> 2] = c[q >> 2];
+                    e = 0;
+                  }
+                  break;
+                }
+                case 61: {
+                  c[g >> 2] = e;
+                  e = 0;
+                  break;
+                }
+                case 68: {
+                  c[g >> 2] = k;
+                  e = 0;
+                  break;
+                }
+                case 75: {
+                  c[g >> 2] = i;
+                  e = 0;
+                  break;
+                }
+                case 76: {
+                  c[g >> 2] = i;
+                  e = 0;
+                  break;
+                }
+                case 77: {
+                  if ((j | 0) < 3) e = -2;
+                  else {
+                    c[g >> 2] = i;
+                    e = 0;
+                  }
+                  break;
+                }
+                case 79: {
+                  if ((j | 0) < 4) e = -2;
+                  else {
+                    c[g >> 2] = i;
+                    e = 0;
+                  }
+                  break;
+                }
+                case 81: {
+                  c[g >> 2] = e + 4;
+                  e = 1;
+                  break;
+                }
+                case 82: {
+                  h = (i + 2) | 0;
+                  c[q >> 2] = h;
+                  e = h;
+                  if (((r - e) | 0) > 1) {
+                    if ((a[h >> 0] | 0) == 0 ? (a[(i + 3) >> 0] | 0) == 62 : 0) {
+                      c[g >> 2] = i + 4;
+                      e = 3;
+                      break;
+                    }
+                    c[g >> 2] = e;
+                    e = 0;
+                  } else e = -1;
+                  break;
+                }
+                case 87: {
+                  c[g >> 2] = h;
+                  e = 0;
+                  break;
+                }
+                case 89: {
+                  c[g >> 2] = e;
+                  e = 0;
+                  break;
+                }
+              }
+              l = s;
+              return e | 0;
+            }
+            function C0(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              c[e >> 2] = 11;
+              a: do
+                if (((d - b) | 0) == 6 ? (a[b >> 0] | 0) == 0 : 0) {
+                  switch (a[(b + 1) >> 0] | 0) {
+                    case 120: {
+                      d = 0;
+                      break;
+                    }
+                    case 88: {
+                      d = 1;
+                      break;
+                    }
+                    default: {
+                      d = 1;
+                      break a;
+                    }
+                  }
+                  if (!(a[(b + 2) >> 0] | 0)) {
+                    switch (a[(b + 3) >> 0] | 0) {
+                      case 109:
+                        break;
+                      case 77: {
+                        d = 1;
+                        break;
+                      }
+                      default: {
+                        d = 1;
+                        break a;
+                      }
+                    }
+                    if (!(a[(b + 4) >> 0] | 0)) {
+                      switch (a[(b + 5) >> 0] | 0) {
+                        case 108:
+                          break;
+                        case 76: {
+                          d = 0;
+                          break a;
+                        }
+                        default: {
+                          d = 1;
+                          break a;
+                        }
+                      }
+                      if (!d) {
+                        c[e >> 2] = 12;
+                        d = 1;
+                      } else d = 0;
+                    } else d = 1;
+                  } else d = 1;
+                } else d = 1;
+              while (0);
+              return d | 0;
+            }
+            function D0(b, e, f, g, h) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              k = (e + 72) | 0;
+              a: while (1) {
+                b: while (1) {
+                  j = (g - f) | 0;
+                  if ((j | 0) <= 1) {
+                    f = -1;
+                    break a;
+                  }
+                  e = a[f >> 0] | 0;
+                  i = a[(f + 1) >> 0] | 0;
+                  if (!((e << 24) >> 24)) i = d[(k + (i & 255)) >> 0] | 0;
+                  else i = J$(e, i) | 0;
+                  switch (i | 0) {
+                    case 8:
+                    case 1:
+                    case 0: {
+                      l = 10;
+                      break a;
+                    }
+                    case 6: {
+                      l = 9;
+                      break b;
+                    }
+                    case 7: {
+                      l = 19;
+                      break b;
+                    }
+                    case 5: {
+                      f = (f + 2) | 0;
+                      continue b;
+                    }
+                    case 13:
+                    case 12: {
+                      e = (f + 2) | 0;
+                      if ((i | 0) == (b | 0)) {
+                        l = 12;
+                        break a;
+                      } else {
+                        f = e;
+                        continue b;
+                      }
+                    }
+                    default: {
+                      f = (f + 2) | 0;
+                      continue b;
+                    }
+                  }
+                }
+                if ((l | 0) == 9) {
+                  l = 0;
+                  if ((j | 0) < 3) {
+                    f = -2;
+                    break;
+                  } else {
+                    f = (f + 3) | 0;
+                    continue;
+                  }
+                } else if ((l | 0) == 19) {
+                  l = 0;
+                  if ((j | 0) < 4) {
+                    f = -2;
+                    break;
+                  } else {
+                    f = (f + 4) | 0;
+                    continue;
+                  }
+                }
+              }
+              c: do
+                if ((l | 0) == 10) {
+                  c[h >> 2] = f;
+                  f = 0;
+                } else if ((l | 0) == 12)
+                  if (((g - e) | 0) > 1) {
+                    c[h >> 2] = e;
+                    g = a[e >> 0] | 0;
+                    f = a[(f + 3) >> 0] | 0;
+                    if (!((g << 24) >> 24)) f = d[(k + (f & 255)) >> 0] | 0;
+                    else f = J$(g, f) | 0;
+                    switch (f | 0) {
+                      case 20:
+                      case 30:
+                      case 11:
+                      case 10:
+                      case 9:
+                      case 21: {
+                        f = 27;
+                        break c;
+                      }
+                      default: {
+                      }
+                    }
+                    f = 0;
+                  } else f = -27;
+              while (0);
+              return f | 0;
+            }
+            function E0(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0;
+              k = f;
+              a: do
+                if (((k - e) | 0) > 1) {
+                  h = a[e >> 0] | 0;
+                  if (!((h << 24) >> 24)) h = d[(b + 72 + (d[(e + 1) >> 0] | 0)) >> 0] | 0;
+                  else h = J$(h, a[(e + 1) >> 0] | 0) | 0;
+                  switch (h | 0) {
+                    case 27: {
+                      h = x0(b, (e + 2) | 0, f, g) | 0;
+                      break a;
+                    }
+                    case 20: {
+                      c[g >> 2] = e + 2;
+                      h = 33;
+                      break a;
+                    }
+                    case 24:
+                    case 22: {
+                      j = (b + 72) | 0;
+                      b: while (1) {
+                        i = (e + 2) | 0;
+                        f = (k - i) | 0;
+                        if ((f | 0) <= 1) {
+                          h = -1;
+                          break a;
+                        }
+                        h = a[i >> 0] | 0;
+                        b = a[(e + 3) >> 0] | 0;
+                        if (!((h << 24) >> 24)) h = d[(j + (b & 255)) >> 0] | 0;
+                        else h = J$(h, b) | 0;
+                        switch (h | 0) {
+                          case 24:
+                          case 22: {
+                            e = i;
+                            break;
+                          }
+                          case 30: {
+                            l = 15;
+                            break b;
+                          }
+                          case 10:
+                          case 9:
+                          case 21:
+                            break b;
+                          default: {
+                            l = 22;
+                            break b;
+                          }
+                        }
+                      }
+                      if ((l | 0) == 22) {
+                        c[g >> 2] = i;
+                        h = 0;
+                        break a;
+                      }
+                      c: do
+                        if ((l | 0) == 15) {
+                          if ((f | 0) <= 3) {
+                            h = -1;
+                            break a;
+                          }
+                          b = a[(e + 4) >> 0] | 0;
+                          h = a[(e + 5) >> 0] | 0;
+                          if (!((b << 24) >> 24)) h = d[(j + (h & 255)) >> 0] | 0;
+                          else h = J$(b, h) | 0;
+                          switch (h | 0) {
+                            case 30:
+                            case 10:
+                            case 9:
+                            case 21:
+                              break;
+                            default:
+                              break c;
+                          }
+                          c[g >> 2] = i;
+                          h = 0;
+                          break a;
+                        }
+                      while (0);
+                      c[g >> 2] = i;
+                      h = 16;
+                      break a;
+                    }
+                    default: {
+                      c[g >> 2] = e;
+                      h = 0;
+                      break a;
+                    }
+                  }
+                } else h = -1;
+              while (0);
+              return h | 0;
+            }
+            function F0(b, e, f, g) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              j = (f - e) | 0;
+              a: do
+                if ((j | 0) > 1) {
+                  k = a[e >> 0] | 0;
+                  if (!((k << 24) >> 24)) {
+                    i = a[(e + 1) >> 0] | 0;
+                    h = d[(b + 72 + (i & 255)) >> 0] | 0;
+                  } else {
+                    i = a[(e + 1) >> 0] | 0;
+                    h = J$(k, i) | 0;
+                  }
+                  switch (h | 0) {
+                    case 29: {
+                      j = i & 255;
+                      if (
+                        !(
+                          (1 << (j & 31)) &
+                          c[(56940 + (((j >>> 5) | ((d[(143788 + (k & 255)) >> 0] | 0) << 3)) << 2)) >> 2]
+                        )
+                      ) {
+                        c[g >> 2] = e;
+                        f = 0;
+                        break a;
+                      }
+                      break;
+                    }
+                    case 24:
+                    case 22:
+                      break;
+                    case 5: {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    case 6: {
+                      if ((j | 0) < 3) {
+                        f = -2;
+                        break a;
+                      }
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    case 7: {
+                      if ((j | 0) < 4) {
+                        f = -2;
+                        break a;
+                      }
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                    default: {
+                      c[g >> 2] = e;
+                      f = 0;
+                      break a;
+                    }
+                  }
+                  b = (b + 72) | 0;
+                  k = e;
+                  b: while (1) {
+                    h = k;
+                    k = (k + 2) | 0;
+                    e = (f - k) | 0;
+                    if ((e | 0) <= 1) {
+                      f = -20;
+                      break a;
+                    }
+                    j = a[k >> 0] | 0;
+                    h = a[(h + 3) >> 0] | 0;
+                    if (!((j << 24) >> 24)) i = d[(b + (h & 255)) >> 0] | 0;
+                    else i = J$(j, h) | 0;
+                    switch (i | 0) {
+                      case 27:
+                      case 26:
+                      case 25:
+                      case 24:
+                      case 22:
+                        continue b;
+                      case 5: {
+                        h = 22;
+                        break b;
+                      }
+                      case 6: {
+                        h = 23;
+                        break b;
+                      }
+                      case 7: {
+                        h = 25;
+                        break b;
+                      }
+                      case 36:
+                      case 30:
+                      case 11:
+                      case 32:
+                      case 21:
+                      case 10:
+                      case 9: {
+                        h = 27;
+                        break b;
+                      }
+                      case 29:
+                        break;
+                      default: {
+                        h = 28;
+                        break b;
+                      }
+                    }
+                    e = h & 255;
+                    if (
+                      !(
+                        (1 << (e & 31)) &
+                        c[(56940 + (((e >>> 5) | ((d[(144044 + (j & 255)) >> 0] | 0) << 3)) << 2)) >> 2]
+                      )
+                    ) {
+                      h = 21;
+                      break;
+                    }
+                  }
+                  if ((h | 0) == 21) {
+                    c[g >> 2] = k;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 22) {
+                    c[g >> 2] = k;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 23) {
+                    if ((e | 0) < 3) {
+                      f = -2;
+                      break;
+                    }
+                    c[g >> 2] = k;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 25) {
+                    if ((e | 0) < 4) {
+                      f = -2;
+                      break;
+                    }
+                    c[g >> 2] = k;
+                    f = 0;
+                    break;
+                  } else if ((h | 0) == 27) {
+                    c[g >> 2] = k;
+                    f = 20;
+                    break;
+                  } else if ((h | 0) == 28) {
+                    c[g >> 2] = k;
+                    f = 0;
+                    break;
+                  }
+                } else f = -1;
+              while (0);
+              return f | 0;
+            }
+            function G0(b, d, e, f, g) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0;
+              while (1) {
+                b = c[d >> 2] | 0;
+                h = b >>> 0 < e >>> 0;
+                i = c[f >> 2] | 0;
+                if (!(h & (i >>> 0 < g >>> 0))) break;
+                c[d >> 2] = b + 1;
+                h = a[b >> 0] | 0;
+                i = c[f >> 2] | 0;
+                c[f >> 2] = i + 1;
+                a[i >> 0] = h;
+              }
+              return (((i | 0) != (g | 0)) | (h ^ 1) ? 0 : 2) | 0;
+            }
+            function H0(b, c) {
+              b = b | 0;
+              c = c | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              a: while (1) {
+                f = a[b >> 0] | 0;
+                g = a[c >> 0] | 0;
+                f = ((f + -97) & 255) < 26 ? ((f & 255) + 224) & 255 : f;
+                switch (
+                  ((f << 24) >> 24 == ((((g + -97) & 255) < 26 ? ((g & 255) + 224) & 255 : g) << 24) >> 24
+                    ? (f << 24) >> 24 == 0
+                      ? 2
+                      : 0
+                    : 1) & 3
+                ) {
+                  case 0: {
+                    c = (c + 1) | 0;
+                    b = (b + 1) | 0;
+                    break;
+                  }
+                  case 1: {
+                    e = 3;
+                    break a;
+                  }
+                  case 2: {
+                    d = 1;
+                    break a;
+                  }
+                  default: {
+                    e = 5;
+                    break a;
+                  }
+                }
+              }
+              if ((e | 0) == 3) d = 0;
+              return d | 0;
+            }
+            function I0(a, b, c, d, e, f, g, h, i, j) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              i = i | 0;
+              j = j | 0;
+              return K0(39, a, b, c, d, e, f, g, h, i, j) | 0;
+            }
+            function J0(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              h = l;
+              l = (l + 144) | 0;
+              i = (h + 4) | 0;
+              f = (h + 8) | 0;
+              g = h;
+              c[i >> 2] = d;
+              c[g >> 2] = f;
+              pb[c[(b + 56) >> 2] & 127](b, i, e, g, (f + 127) | 0) | 0;
+              do
+                if ((c[i >> 2] | 0) == (e | 0)) {
+                  a[c[g >> 2] >> 0] = 0;
+                  if (H0(f, 144315) | 0 ? (c[(b + 64) >> 2] | 0) == 2 : 0) break;
+                  b = Z$(f) | 0;
+                  if ((b | 0) != -1) b = c[(58948 + (b << 2)) >> 2] | 0;
+                  else b = 0;
+                } else b = 0;
+              while (0);
+              l = h;
+              return b | 0;
+            }
+            function K0(a, b, d, e, f, g, h, i, j, k, m) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              i = i | 0;
+              j = j | 0;
+              k = k | 0;
+              m = m | 0;
+              var n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0;
+              v = l;
+              l = (l + 16) | 0;
+              t = (v + 8) | 0;
+              q = (v + 12) | 0;
+              o = (v + 4) | 0;
+              p = v;
+              c[q >> 2] = 0;
+              c[o >> 2] = 0;
+              c[p >> 2] = 0;
+              u = (d + 64) | 0;
+              s = c[u >> 2] | 0;
+              r = (e + ((s * 5) | 0)) | 0;
+              c[t >> 2] = r;
+              s = (f + (0 - (s << 1))) | 0;
+              r = (L0(d, r, s, o, p, q, t) | 0) != 0;
+              n = c[o >> 2] | 0;
+              e = n;
+              a: do
+                if (r & ((n | 0) != 0)) {
+                  r = (d + 24) | 0;
+                  f = c[p >> 2] | 0;
+                  do
+                    if (!(ob[c[r >> 2] & 127](d, n, f, 144340) | 0)) {
+                      if (!b) {
+                        c[g >> 2] = e;
+                        e = 0;
+                        break a;
+                      }
+                    } else {
+                      if (h | 0) c[h >> 2] = c[q >> 2];
+                      if (!i) e = c[t >> 2] | 0;
+                      else {
+                        e = c[t >> 2] | 0;
+                        c[i >> 2] = e;
+                      }
+                      if (!(L0(d, e, s, o, p, q, t) | 0)) {
+                        c[g >> 2] = c[t >> 2];
+                        e = 0;
+                        break a;
+                      }
+                      f = c[o >> 2] | 0;
+                      if (f | 0) {
+                        e = f;
+                        n = f;
+                        f = c[p >> 2] | 0;
+                        break;
+                      }
+                      if (!b) {
+                        e = 1;
+                        break a;
+                      }
+                      c[g >> 2] = c[t >> 2];
+                      e = 0;
+                      break a;
+                    }
+                  while (0);
+                  if (ob[c[r >> 2] & 127](d, n, f, 144348) | 0) {
+                    f = c[q >> 2] | 0;
+                    e = f;
+                    if (((((M0(d, f, s) | 0) & -33) + -65) | 0) >>> 0 >= 26) {
+                      c[g >> 2] = e;
+                      e = 0;
+                      break;
+                    }
+                    if (j | 0) c[j >> 2] = e;
+                    e = c[t >> 2] | 0;
+                    if (k | 0) c[k >> 2] = nb[a & 63](d, f, (e + (0 - (c[u >> 2] | 0))) | 0) | 0;
+                    if (!(L0(d, e, s, o, p, q, t) | 0)) {
+                      c[g >> 2] = c[t >> 2];
+                      e = 0;
+                      break;
+                    }
+                    e = c[o >> 2] | 0;
+                    if (!e) {
+                      e = 1;
+                      break;
+                    }
+                    n = e;
+                    f = c[p >> 2] | 0;
+                  }
+                  if (((b | 0) != 0) | ((ob[c[r >> 2] & 127](d, n, f, 144357) | 0) == 0)) {
+                    c[g >> 2] = e;
+                    e = 0;
+                    break;
+                  }
+                  f = c[q >> 2] | 0;
+                  e = c[t >> 2] | 0;
+                  n = f;
+                  if (!(ob[c[r >> 2] & 127](d, f, (e + (0 - (c[u >> 2] | 0))) | 0, 107657) | 0)) {
+                    if (!(ob[c[r >> 2] & 127](d, f, (e + (0 - (c[u >> 2] | 0))) | 0, 107649) | 0)) {
+                      c[g >> 2] = n;
+                      e = 0;
+                      break;
+                    }
+                    if (m) c[m >> 2] = 0;
+                  } else if (m) c[m >> 2] = 1;
+                  while (1) {
+                    if (!(N0(M0(d, e, s) | 0) | 0)) break;
+                    e = (e + (c[u >> 2] | 0)) | 0;
+                  }
+                  c[t >> 2] = e;
+                  if ((e | 0) == (s | 0)) e = 1;
+                  else {
+                    c[g >> 2] = e;
+                    e = 0;
+                  }
+                } else {
+                  c[g >> 2] = c[t >> 2];
+                  e = 0;
+                }
+              while (0);
+              l = v;
+              return e | 0;
+            }
+            function L0(a, b, d, e, f, g, h) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              var i = 0,
+                j = 0;
+              a: do
+                if ((b | 0) != (d | 0)) {
+                  if (!(N0(M0(a, b, d) | 0) | 0)) {
+                    c[h >> 2] = b;
+                    b = 0;
+                    break;
+                  }
+                  j = (a + 64) | 0;
+                  do b = (b + (c[j >> 2] | 0)) | 0;
+                  while ((N0(M0(a, b, d) | 0) | 0) != 0);
+                  if ((b | 0) == (d | 0)) {
+                    c[e >> 2] = 0;
+                    b = 1;
+                    break;
+                  }
+                  c[e >> 2] = b;
+                  b: while (1) {
+                    i = M0(a, b, d) | 0;
+                    switch (i | 0) {
+                      case -1: {
+                        i = 11;
+                        break b;
+                      }
+                      case 61: {
+                        i = 12;
+                        break b;
+                      }
+                      default: {
+                      }
+                    }
+                    if (N0(i) | 0) {
+                      i = 14;
+                      break;
+                    }
+                    b = (b + (c[j >> 2] | 0)) | 0;
+                  }
+                  if ((i | 0) == 11) {
+                    c[h >> 2] = b;
+                    b = 0;
+                    break;
+                  } else if ((i | 0) == 12) c[f >> 2] = b;
+                  else if ((i | 0) == 14) {
+                    c[f >> 2] = b;
+                    do {
+                      b = (b + (c[j >> 2] | 0)) | 0;
+                      i = M0(a, b, d) | 0;
+                    } while ((N0(i) | 0) != 0);
+                    if ((i | 0) != 61) {
+                      c[h >> 2] = b;
+                      b = 0;
+                      break;
+                    }
+                  }
+                  if ((b | 0) == (c[e >> 2] | 0)) {
+                    c[h >> 2] = b;
+                    b = 0;
+                    break;
+                  }
+                  do {
+                    b = (b + (c[j >> 2] | 0)) | 0;
+                    i = M0(a, b, d) | 0;
+                  } while ((N0(i) | 0) != 0);
+                  switch (i | 0) {
+                    case 34:
+                    case 39:
+                      break;
+                    default: {
+                      c[h >> 2] = b;
+                      b = 0;
+                      break a;
+                    }
+                  }
+                  f = (b + (c[j >> 2] | 0)) | 0;
+                  c[g >> 2] = f;
+                  b = (i << 24) >> 24;
+                  c: while (1) {
+                    i = M0(a, f, d) | 0;
+                    if ((i | 0) == (b | 0)) {
+                      i = 30;
+                      break;
+                    }
+                    if ((((i + -48) | 0) >>> 0 > 9) & ((((i & -33) + -65) | 0) >>> 0 > 25))
+                      switch (i | 0) {
+                        case 45:
+                        case 46:
+                        case 95:
+                          break;
+                        default: {
+                          i = 28;
+                          break c;
+                        }
+                      }
+                    f = (f + (c[j >> 2] | 0)) | 0;
+                  }
+                  if ((i | 0) == 28) {
+                    c[h >> 2] = f;
+                    b = 0;
+                    break;
+                  } else if ((i | 0) == 30) {
+                    c[h >> 2] = f + (c[j >> 2] | 0);
+                    b = 1;
+                    break;
+                  }
+                } else {
+                  c[e >> 2] = 0;
+                  b = 1;
+                }
+              while (0);
+              return b | 0;
+            }
+            function M0(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              h = l;
+              l = (l + 16) | 0;
+              i = (h + 4) | 0;
+              f = (h + 8) | 0;
+              g = h;
+              c[i >> 2] = d;
+              c[g >> 2] = f;
+              pb[c[(b + 56) >> 2] & 127](b, i, e, g, (f + 1) | 0) | 0;
+              l = h;
+              return ((c[g >> 2] | 0) == (f | 0) ? -1 : a[f >> 0] | 0) | 0;
+            }
+            function N0(a) {
+              a = a | 0;
+              switch (a | 0) {
+                case 9:
+                case 10:
+                case 13:
+                case 32: {
+                  a = 1;
+                  break;
+                }
+                default:
+                  a = 0;
+              }
+              return a | 0;
+            }
+            function O0() {
+              return 60092;
+            }
+            function P0(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              e = Z$(e) | 0;
+              if ((e | 0) == -1) e = 0;
+              else {
+                a[(b + 69) >> 0] = e;
+                c[b >> 2] = 69;
+                c[(b + 4) >> 2] = 70;
+                c[(b + 48) >> 2] = 31;
+                c[(b + 72) >> 2] = d;
+                c[d >> 2] = b;
+                e = 1;
+              }
+              return e | 0;
+            }
+            function Q0(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              return b0(60456, a, 0, b, c, d) | 0;
+            }
+            function R0(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              return b0(60456, a, 1, b, c, d) | 0;
+            }
+            function S0(a, b, c, d, e, f, g, h, i, j) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              i = i | 0;
+              j = j | 0;
+              return K0(40, a, b, c, d, e, f, g, h, i, j) | 0;
+            }
+            function T0(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              h = l;
+              l = (l + 144) | 0;
+              i = (h + 4) | 0;
+              f = (h + 8) | 0;
+              g = h;
+              c[i >> 2] = d;
+              c[g >> 2] = f;
+              pb[c[(b + 56) >> 2] & 127](b, i, e, g, (f + 127) | 0) | 0;
+              do
+                if ((c[i >> 2] | 0) == (e | 0)) {
+                  a[c[g >> 2] >> 0] = 0;
+                  if (H0(f, 144315) | 0 ? (c[(b + 64) >> 2] | 0) == 2 : 0) break;
+                  b = Z$(f) | 0;
+                  if ((b | 0) != -1) b = c[(60456 + (b << 2)) >> 2] | 0;
+                  else b = 0;
+                } else b = 0;
+              while (0);
+              l = h;
+              return b | 0;
+            }
+            function U0(b, c, d, e) {
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              b = z_(b, c, d, e) | 0;
+              if (b | 0) a[(b + 72 + 58) >> 0] = 23;
+              return b | 0;
+            }
+            function V0(a) {
+              a = a | 0;
+              c[a >> 2] = 15;
+              c[(a + 16) >> 2] = 1;
+              c[(a + 12) >> 2] = 0;
+              c[(a + 20) >> 2] = 0;
+              return;
+            }
+            function W0(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0;
+              switch (b | 0) {
+                case 15: {
+                  c[a >> 2] = 16;
+                  a = 0;
+                  break;
+                }
+                case 12: {
+                  c[a >> 2] = 16;
+                  a = 1;
+                  break;
+                }
+                case 11: {
+                  c[a >> 2] = 16;
+                  a = 55;
+                  break;
+                }
+                case 13: {
+                  c[a >> 2] = 16;
+                  a = 56;
+                  break;
+                }
+                case 14: {
+                  a = 0;
+                  break;
+                }
+                case 16: {
+                  if (!(ob[c[(f + 24) >> 2] & 127](f, (d + (c[(f + 64) >> 2] << 1)) | 0, e, 144368) | 0)) g = 9;
+                  else {
+                    c[a >> 2] = 17;
+                    a = 3;
+                  }
+                  break;
+                }
+                case 29: {
+                  c[a >> 2] = 18;
+                  a = 2;
+                  break;
+                }
+                default:
+                  g = 9;
+              }
+              if ((g | 0) == 9) a = _0(a, b) | 0;
+              return a | 0;
+            }
+            function X0(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0;
+              switch (b | 0) {
+                case 14:
+                case 15: {
+                  a = 0;
+                  break;
+                }
+                case 11: {
+                  a = 55;
+                  break;
+                }
+                case 13: {
+                  a = 56;
+                  break;
+                }
+                case 16: {
+                  if (!(ob[c[(f + 24) >> 2] & 127](f, (d + (c[(f + 64) >> 2] << 1)) | 0, e, 144368) | 0)) g = 7;
+                  else {
+                    c[a >> 2] = 17;
+                    a = 3;
+                  }
+                  break;
+                }
+                case 29: {
+                  c[a >> 2] = 18;
+                  a = 2;
+                  break;
+                }
+                default:
+                  g = 7;
+              }
+              if ((g | 0) == 7) a = _0(a, b) | 0;
+              return a | 0;
+            }
+            function Y0(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 3;
+                  break;
+                }
+                case 41:
+                case 18: {
+                  c[a >> 2] = 19;
+                  a = 4;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function Z0(a, b, c, d, e) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              return 0;
+            }
+            function _0(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if (((b | 0) == 28) & ((c[(a + 16) >> 2] | 0) == 0)) a = 59;
+              else {
+                c[a >> 2] = 18;
+                a = -1;
+              }
+              return a | 0;
+            }
+            function $0(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0;
+              a: do
+                switch (b | 0) {
+                  case 15: {
+                    a = 3;
+                    break;
+                  }
+                  case 25: {
+                    c[a >> 2] = 20;
+                    a = 7;
+                    break;
+                  }
+                  case 17: {
+                    c[a >> 2] = 21;
+                    a = 8;
+                    break;
+                  }
+                  case 18: {
+                    g = (f + 24) | 0;
+                    if (ob[c[g >> 2] & 127](f, d, e, 144376) | 0) {
+                      c[a >> 2] = 22;
+                      a = 3;
+                      break a;
+                    }
+                    if (!(ob[c[g >> 2] & 127](f, d, e, 144383) | 0)) h = 8;
+                    else {
+                      c[a >> 2] = 23;
+                      a = 3;
+                    }
+                    break;
+                  }
+                  default:
+                    h = 8;
+                }
+              while (0);
+              if ((h | 0) == 8) a = _0(a, b) | 0;
+              return a | 0;
+            }
+            function a1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0;
+              a: do
+                switch (b | 0) {
+                  case -4:
+                  case 15: {
+                    a = 0;
+                    break;
+                  }
+                  case 16: {
+                    g = (f + 24) | 0;
+                    h = (f + 64) | 0;
+                    if (ob[c[g >> 2] & 127](f, (d + (c[h >> 2] << 1)) | 0, e, 144390) | 0) {
+                      c[a >> 2] = 24;
+                      a = 11;
+                      break a;
+                    }
+                    if (ob[c[g >> 2] & 127](f, (d + (c[h >> 2] << 1)) | 0, e, 144397) | 0) {
+                      c[a >> 2] = 25;
+                      a = 33;
+                      break a;
+                    }
+                    if (ob[c[g >> 2] & 127](f, (d + (c[h >> 2] << 1)) | 0, e, 144405) | 0) {
+                      c[a >> 2] = 26;
+                      a = 39;
+                      break a;
+                    }
+                    if (!(ob[c[g >> 2] & 127](f, (d + (c[h >> 2] << 1)) | 0, e, 144413) | 0)) i = 14;
+                    else {
+                      c[a >> 2] = 27;
+                      a = 17;
+                    }
+                    break;
+                  }
+                  case 11: {
+                    a = 55;
+                    break;
+                  }
+                  case 13: {
+                    a = 56;
+                    break;
+                  }
+                  case 28: {
+                    a = 60;
+                    break;
+                  }
+                  case 26: {
+                    c[a >> 2] = 28;
+                    a = 3;
+                    break;
+                  }
+                  default:
+                    i = 14;
+                }
+              while (0);
+              if ((i | 0) == 14) a = _0(a, b) | 0;
+              return a | 0;
+            }
+            function b1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              f = (b + -11) | 0;
+              switch ((f >>> 1) | (f << 31) | 0) {
+                case 2: {
+                  a = 0;
+                  break;
+                }
+                case 0: {
+                  a = 55;
+                  break;
+                }
+                case 1: {
+                  a = 56;
+                  break;
+                }
+                case 9: {
+                  c[a >> 2] = 18;
+                  a = 2;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function c1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 3;
+                  break;
+                }
+                case 27: {
+                  c[a >> 2] = 29;
+                  a = 5;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function d1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 3;
+                  break;
+                }
+                case 27: {
+                  c[a >> 2] = 22;
+                  a = 6;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function e1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 3;
+                  break;
+                }
+                case 25: {
+                  c[a >> 2] = 20;
+                  a = 7;
+                  break;
+                }
+                case 17: {
+                  c[a >> 2] = 21;
+                  a = 8;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function f1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 11;
+                  break;
+                }
+                case 22: {
+                  c[a >> 2] = 30;
+                  a = 11;
+                  break;
+                }
+                case 18: {
+                  c[a >> 2] = 31;
+                  a = 9;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function g1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 33;
+                  break;
+                }
+                case 41:
+                case 18: {
+                  c[a >> 2] = 32;
+                  a = 34;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function h1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 39;
+                  break;
+                }
+                case 41:
+                case 18: {
+                  c[a >> 2] = 33;
+                  a = 40;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function i1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 17;
+                  break;
+                }
+                case 18: {
+                  c[a >> 2] = 34;
+                  a = 18;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function j1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 3;
+                  break;
+                }
+                case 17: {
+                  c[a >> 2] = 21;
+                  a = 8;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function k1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0;
+              a: do
+                switch (b | 0) {
+                  case 15: {
+                    a = 17;
+                    break;
+                  }
+                  case 18: {
+                    g = (f + 24) | 0;
+                    if (ob[c[g >> 2] & 127](f, d, e, 144376) | 0) {
+                      c[a >> 2] = 35;
+                      a = 17;
+                      break a;
+                    }
+                    if (!(ob[c[g >> 2] & 127](f, d, e, 144383) | 0)) h = 6;
+                    else {
+                      c[a >> 2] = 36;
+                      a = 17;
+                    }
+                    break;
+                  }
+                  default:
+                    h = 6;
+                }
+              while (0);
+              if ((h | 0) == 6) a = _0(a, b) | 0;
+              return a | 0;
+            }
+            function l1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 17;
+                  break;
+                }
+                case 27: {
+                  c[a >> 2] = 37;
+                  c[(a + 8) >> 2] = 17;
+                  a = 19;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function m1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 17;
+                  break;
+                }
+                case 27: {
+                  c[a >> 2] = 38;
+                  a = 21;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function n1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 17;
+                  break;
+                }
+                case 27: {
+                  c[a >> 2] = 37;
+                  c[(a + 8) >> 2] = 17;
+                  a = 19;
+                  break;
+                }
+                case 17: {
+                  c[a >> 2] = c[(a + 16) >> 2] | 0 ? 20 : 39;
+                  a = 20;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function o1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = c[(a + 8) >> 2] | 0;
+                  break;
+                }
+                case 17: {
+                  c[a >> 2] = c[(a + 16) >> 2] | 0 ? 20 : 39;
+                  a = c[(a + 8) >> 2] | 0;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function p1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0;
+              switch (b | 0) {
+                case 33: {
+                  c[a >> 2] = 40;
+                  d = 0;
+                  break;
+                }
+                case 34: {
+                  d = (a + 12) | 0;
+                  e = c[d >> 2] | 0;
+                  if (!e) g = 7;
+                  else {
+                    c[d >> 2] = e + -1;
+                    d = 0;
+                  }
+                  break;
+                }
+                case 15: {
+                  d = 0;
+                  break;
+                }
+                case 26: {
+                  g = 7;
+                  break;
+                }
+                case -4: {
+                  if (!(c[(a + 12) >> 2] | 0)) d = 0;
+                  else g = 7;
+                  break;
+                }
+                default:
+                  d = a1(a, b, d, e, f) | 0;
+              }
+              if ((g | 0) == 7) d = _0(a, b) | 0;
+              return d | 0;
+            }
+            function q1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0;
+              a: do
+                switch (b | 0) {
+                  case 15: {
+                    a = 0;
+                    break;
+                  }
+                  case 18: {
+                    g = (f + 24) | 0;
+                    if (ob[c[g >> 2] & 127](f, d, e, 144422) | 0) {
+                      c[a >> 2] = 41;
+                      a = 0;
+                      break a;
+                    }
+                    if (!(ob[c[g >> 2] & 127](f, d, e, 144430) | 0)) h = 6;
+                    else {
+                      c[a >> 2] = 42;
+                      a = 0;
+                    }
+                    break;
+                  }
+                  default:
+                    h = 6;
+                }
+              while (0);
+              if ((h | 0) == 6) a = _0(a, b) | 0;
+              return a | 0;
+            }
+            function r1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 0;
+                  break;
+                }
+                case 25: {
+                  c[a >> 2] = 39;
+                  a = (a + 12) | 0;
+                  c[a >> 2] = (c[a >> 2] | 0) + 1;
+                  a = 0;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function s1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 0;
+                  break;
+                }
+                case 25: {
+                  c[a >> 2] = 39;
+                  a = 58;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function t1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0;
+              a: do
+                switch (b | 0) {
+                  case 15: {
+                    a = 39;
+                    break;
+                  }
+                  case 18: {
+                    g = (f + 24) | 0;
+                    if (ob[c[g >> 2] & 127](f, d, e, 144437) | 0) {
+                      c[a >> 2] = 37;
+                      c[(a + 8) >> 2] = 39;
+                      a = 42;
+                      break a;
+                    }
+                    if (!(ob[c[g >> 2] & 127](f, d, e, 144443) | 0)) h = 7;
+                    else {
+                      c[a >> 2] = 37;
+                      c[(a + 8) >> 2] = 39;
+                      a = 41;
+                    }
+                    break;
+                  }
+                  case 23: {
+                    c[a >> 2] = 43;
+                    c[(a + 4) >> 2] = 1;
+                    a = 44;
+                    break;
+                  }
+                  default:
+                    h = 7;
+                }
+              while (0);
+              if ((h | 0) == 7) a = _0(a, b) | 0;
+              return a | 0;
+            }
+            function u1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 39;
+                  break;
+                }
+                case 20: {
+                  if (!(ob[c[(f + 24) >> 2] & 127](f, (d + (c[(f + 64) >> 2] | 0)) | 0, e, 144447) | 0)) g = 9;
+                  else {
+                    c[a >> 2] = 44;
+                    a = 43;
+                  }
+                  break;
+                }
+                case 23: {
+                  c[(a + 4) >> 2] = 2;
+                  c[a >> 2] = 45;
+                  a = 44;
+                  break;
+                }
+                case 41:
+                case 18: {
+                  c[a >> 2] = 46;
+                  a = 51;
+                  break;
+                }
+                case 30: {
+                  c[a >> 2] = 46;
+                  a = 53;
+                  break;
+                }
+                case 31: {
+                  c[a >> 2] = 46;
+                  a = 52;
+                  break;
+                }
+                case 32: {
+                  c[a >> 2] = 46;
+                  a = 54;
+                  break;
+                }
+                default:
+                  g = 9;
+              }
+              if ((g | 0) == 9) a = _0(a, b) | 0;
+              return a | 0;
+            }
+            function v1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 39;
+                  break;
+                }
+                case 24: {
+                  c[a >> 2] = 37;
+                  c[(a + 8) >> 2] = 39;
+                  a = 45;
+                  break;
+                }
+                case 36: {
+                  c[a >> 2] = 37;
+                  c[(a + 8) >> 2] = 39;
+                  a = 46;
+                  break;
+                }
+                case 21: {
+                  c[a >> 2] = 47;
+                  a = 39;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function w1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 39;
+                  break;
+                }
+                case 23: {
+                  a = (a + 4) | 0;
+                  c[a >> 2] = (c[a >> 2] | 0) + 1;
+                  a = 44;
+                  break;
+                }
+                case 41:
+                case 18: {
+                  c[a >> 2] = 46;
+                  a = 51;
+                  break;
+                }
+                case 30: {
+                  c[a >> 2] = 46;
+                  a = 53;
+                  break;
+                }
+                case 31: {
+                  c[a >> 2] = 46;
+                  a = 52;
+                  break;
+                }
+                case 32: {
+                  c[a >> 2] = 46;
+                  a = 54;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function x1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 39;
+                  break;
+                }
+                case 24: {
+                  e = (a + 4) | 0;
+                  f = ((c[e >> 2] | 0) + -1) | 0;
+                  c[e >> 2] = f;
+                  if (!f) {
+                    c[a >> 2] = 37;
+                    c[(a + 8) >> 2] = 39;
+                    a = 45;
+                  } else a = 45;
+                  break;
+                }
+                case 36: {
+                  e = (a + 4) | 0;
+                  f = ((c[e >> 2] | 0) + -1) | 0;
+                  c[e >> 2] = f;
+                  if (!f) {
+                    c[a >> 2] = 37;
+                    c[(a + 8) >> 2] = 39;
+                    a = 46;
+                  } else a = 46;
+                  break;
+                }
+                case 35: {
+                  e = (a + 4) | 0;
+                  f = ((c[e >> 2] | 0) + -1) | 0;
+                  c[e >> 2] = f;
+                  if (!f) {
+                    c[a >> 2] = 37;
+                    c[(a + 8) >> 2] = 39;
+                    a = 47;
+                  } else a = 47;
+                  break;
+                }
+                case 37: {
+                  e = (a + 4) | 0;
+                  f = ((c[e >> 2] | 0) + -1) | 0;
+                  c[e >> 2] = f;
+                  if (!f) {
+                    c[a >> 2] = 37;
+                    c[(a + 8) >> 2] = 39;
+                    a = 48;
+                  } else a = 48;
+                  break;
+                }
+                case 38: {
+                  c[a >> 2] = 45;
+                  a = 50;
+                  break;
+                }
+                case 21: {
+                  c[a >> 2] = 45;
+                  a = 49;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function y1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 39;
+                  break;
+                }
+                case 41:
+                case 18: {
+                  c[a >> 2] = 48;
+                  a = 51;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function z1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 39;
+                  break;
+                }
+                case 36: {
+                  c[a >> 2] = 37;
+                  c[(a + 8) >> 2] = 39;
+                  a = 46;
+                  break;
+                }
+                case 21: {
+                  c[a >> 2] = 47;
+                  a = 39;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function A1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 33;
+                  break;
+                }
+                case 17: {
+                  c[a >> 2] = c[(a + 16) >> 2] | 0 ? 20 : 39;
+                  a = 33;
+                  break;
+                }
+                case 41:
+                case 18: {
+                  c[a >> 2] = 49;
+                  a = 22;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function B1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              a: do
+                switch (b | 0) {
+                  case 15: {
+                    g = 33;
+                    break;
+                  }
+                  case 18: {
+                    h = (f + 24) | 0;
+                    g = 0;
+                    while (1) {
+                      i = c[h >> 2] | 0;
+                      if ((g | 0) >= 8) break;
+                      if (ob[i & 127](f, d, e, c[(62304 + (g << 2)) >> 2] | 0) | 0) {
+                        j = 6;
+                        break;
+                      }
+                      g = (g + 1) | 0;
+                    }
+                    if ((j | 0) == 6) {
+                      c[a >> 2] = 50;
+                      g = (g + 23) | 0;
+                      break a;
+                    }
+                    if (!(ob[i & 127](f, d, e, 144413) | 0)) j = 10;
+                    else {
+                      c[a >> 2] = 51;
+                      g = 33;
+                    }
+                    break;
+                  }
+                  case 23: {
+                    c[a >> 2] = 52;
+                    g = 33;
+                    break;
+                  }
+                  default:
+                    j = 10;
+                }
+              while (0);
+              if ((j | 0) == 10) g = _0(a, b) | 0;
+              return g | 0;
+            }
+            function C1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0;
+              a: do
+                switch (b | 0) {
+                  case 15: {
+                    a = 33;
+                    break;
+                  }
+                  case 20: {
+                    g = (f + 24) | 0;
+                    h = (f + 64) | 0;
+                    if (ob[c[g >> 2] & 127](f, (d + (c[h >> 2] | 0)) | 0, e, 144454) | 0) {
+                      c[a >> 2] = 32;
+                      a = 35;
+                      break a;
+                    }
+                    if (ob[c[g >> 2] & 127](f, (d + (c[h >> 2] | 0)) | 0, e, 144462) | 0) {
+                      c[a >> 2] = 32;
+                      a = 36;
+                      break a;
+                    }
+                    if (!(ob[c[g >> 2] & 127](f, (d + (c[h >> 2] | 0)) | 0, e, 144471) | 0)) i = 9;
+                    else {
+                      c[a >> 2] = 53;
+                      a = 33;
+                    }
+                    break;
+                  }
+                  case 27: {
+                    c[a >> 2] = 32;
+                    a = 37;
+                    break;
+                  }
+                  default:
+                    i = 9;
+                }
+              while (0);
+              if ((i | 0) == 9) a = _0(a, b) | 0;
+              return a | 0;
+            }
+            function D1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 33;
+                  break;
+                }
+                case 23: {
+                  c[a >> 2] = 54;
+                  a = 33;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function E1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 33;
+                  break;
+                }
+                case 41:
+                case 18:
+                case 19: {
+                  c[a >> 2] = 55;
+                  a = 31;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function F1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 33;
+                  break;
+                }
+                case 24: {
+                  c[a >> 2] = 50;
+                  a = 33;
+                  break;
+                }
+                case 21: {
+                  c[a >> 2] = 52;
+                  a = 33;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function G1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 33;
+                  break;
+                }
+                case 18: {
+                  c[a >> 2] = 56;
+                  a = 32;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function H1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 33;
+                  break;
+                }
+                case 24: {
+                  c[a >> 2] = 50;
+                  a = 33;
+                  break;
+                }
+                case 21: {
+                  c[a >> 2] = 54;
+                  a = 33;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function I1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 33;
+                  break;
+                }
+                case 27: {
+                  c[a >> 2] = 32;
+                  a = 38;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function J1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 11;
+                  break;
+                }
+                case 18: {
+                  c[a >> 2] = 57;
+                  a = 10;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function K1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0;
+              a: do
+                switch (b | 0) {
+                  case 15: {
+                    a = 11;
+                    break;
+                  }
+                  case 18: {
+                    g = (f + 24) | 0;
+                    if (ob[c[g >> 2] & 127](f, d, e, 144376) | 0) {
+                      c[a >> 2] = 58;
+                      a = 11;
+                      break a;
+                    }
+                    if (!(ob[c[g >> 2] & 127](f, d, e, 144383) | 0)) h = 7;
+                    else {
+                      c[a >> 2] = 59;
+                      a = 11;
+                    }
+                    break;
+                  }
+                  case 27: {
+                    c[a >> 2] = 37;
+                    c[(a + 8) >> 2] = 11;
+                    a = 12;
+                    break;
+                  }
+                  default:
+                    h = 7;
+                }
+              while (0);
+              if ((h | 0) == 7) a = _0(a, b) | 0;
+              return a | 0;
+            }
+            function L1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 11;
+                  break;
+                }
+                case 27: {
+                  c[a >> 2] = 60;
+                  a = 13;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function M1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 11;
+                  break;
+                }
+                case 27: {
+                  c[a >> 2] = 58;
+                  a = 14;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function N1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 11;
+                  break;
+                }
+                case 17: {
+                  c[a >> 2] = c[(a + 16) >> 2] | 0 ? 20 : 39;
+                  a = 15;
+                  break;
+                }
+                case 18: {
+                  if (!(ob[c[(f + 24) >> 2] & 127](f, d, e, 144525) | 0)) g = 5;
+                  else {
+                    c[a >> 2] = 61;
+                    a = 11;
+                  }
+                  break;
+                }
+                default:
+                  g = 5;
+              }
+              if ((g | 0) == 5) a = _0(a, b) | 0;
+              return a | 0;
+            }
+            function O1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 11;
+                  break;
+                }
+                case 18: {
+                  c[a >> 2] = 37;
+                  c[(a + 8) >> 2] = 11;
+                  a = 16;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function P1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0;
+              a: do
+                switch (b | 0) {
+                  case 15: {
+                    a = 11;
+                    break;
+                  }
+                  case 18: {
+                    g = (f + 24) | 0;
+                    if (ob[c[g >> 2] & 127](f, d, e, 144376) | 0) {
+                      c[a >> 2] = 62;
+                      a = 11;
+                      break a;
+                    }
+                    if (!(ob[c[g >> 2] & 127](f, d, e, 144383) | 0)) h = 7;
+                    else {
+                      c[a >> 2] = 63;
+                      a = 11;
+                    }
+                    break;
+                  }
+                  case 27: {
+                    c[a >> 2] = 37;
+                    c[(a + 8) >> 2] = 11;
+                    a = 12;
+                    break;
+                  }
+                  default:
+                    h = 7;
+                }
+              while (0);
+              if ((h | 0) == 7) a = _0(a, b) | 0;
+              return a | 0;
+            }
+            function Q1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 11;
+                  break;
+                }
+                case 27: {
+                  c[a >> 2] = 64;
+                  a = 13;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function R1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 11;
+                  break;
+                }
+                case 27: {
+                  c[a >> 2] = 62;
+                  a = 14;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function S1(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              switch (b | 0) {
+                case 15: {
+                  a = 11;
+                  break;
+                }
+                case 17: {
+                  c[a >> 2] = c[(a + 16) >> 2] | 0 ? 20 : 39;
+                  a = 15;
+                  break;
+                }
+                default:
+                  a = _0(a, b) | 0;
+              }
+              return a | 0;
+            }
+            function T1(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0;
+              x = l;
+              l = (l + 16) | 0;
+              p = x;
+              do
+                if (a >>> 0 < 245) {
+                  m = a >>> 0 < 11 ? 16 : (a + 11) & -8;
+                  a = m >>> 3;
+                  o = c[47519] | 0;
+                  d = o >>> a;
+                  if ((d & 3) | 0) {
+                    b = (((d & 1) ^ 1) + a) | 0;
+                    a = (190116 + ((b << 1) << 2)) | 0;
+                    d = (a + 8) | 0;
+                    e = c[d >> 2] | 0;
+                    f = (e + 8) | 0;
+                    g = c[f >> 2] | 0;
+                    if ((g | 0) == (a | 0)) c[47519] = o & ~(1 << b);
+                    else {
+                      c[(g + 12) >> 2] = a;
+                      c[d >> 2] = g;
+                    }
+                    w = b << 3;
+                    c[(e + 4) >> 2] = w | 3;
+                    w = (e + w + 4) | 0;
+                    c[w >> 2] = c[w >> 2] | 1;
+                    w = f;
+                    l = x;
+                    return w | 0;
+                  }
+                  n = c[47521] | 0;
+                  if (m >>> 0 > n >>> 0) {
+                    if (d | 0) {
+                      b = 2 << a;
+                      b = (d << a) & (b | (0 - b));
+                      b = ((b & (0 - b)) + -1) | 0;
+                      i = (b >>> 12) & 16;
+                      b = b >>> i;
+                      d = (b >>> 5) & 8;
+                      b = b >>> d;
+                      g = (b >>> 2) & 4;
+                      b = b >>> g;
+                      a = (b >>> 1) & 2;
+                      b = b >>> a;
+                      e = (b >>> 1) & 1;
+                      e = ((d | i | g | a | e) + (b >>> e)) | 0;
+                      b = (190116 + ((e << 1) << 2)) | 0;
+                      a = (b + 8) | 0;
+                      g = c[a >> 2] | 0;
+                      i = (g + 8) | 0;
+                      d = c[i >> 2] | 0;
+                      if ((d | 0) == (b | 0)) {
+                        a = o & ~(1 << e);
+                        c[47519] = a;
+                      } else {
+                        c[(d + 12) >> 2] = b;
+                        c[a >> 2] = d;
+                        a = o;
+                      }
+                      w = e << 3;
+                      h = (w - m) | 0;
+                      c[(g + 4) >> 2] = m | 3;
+                      f = (g + m) | 0;
+                      c[(f + 4) >> 2] = h | 1;
+                      c[(g + w) >> 2] = h;
+                      if (n | 0) {
+                        e = c[47524] | 0;
+                        b = n >>> 3;
+                        d = (190116 + ((b << 1) << 2)) | 0;
+                        b = 1 << b;
+                        if (!(a & b)) {
+                          c[47519] = a | b;
+                          b = d;
+                          a = (d + 8) | 0;
+                        } else {
+                          a = (d + 8) | 0;
+                          b = c[a >> 2] | 0;
+                        }
+                        c[a >> 2] = e;
+                        c[(b + 12) >> 2] = e;
+                        c[(e + 8) >> 2] = b;
+                        c[(e + 12) >> 2] = d;
+                      }
+                      c[47521] = h;
+                      c[47524] = f;
+                      w = i;
+                      l = x;
+                      return w | 0;
+                    }
+                    j = c[47520] | 0;
+                    if (j) {
+                      d = ((j & (0 - j)) + -1) | 0;
+                      i = (d >>> 12) & 16;
+                      d = d >>> i;
+                      h = (d >>> 5) & 8;
+                      d = d >>> h;
+                      k = (d >>> 2) & 4;
+                      d = d >>> k;
+                      e = (d >>> 1) & 2;
+                      d = d >>> e;
+                      a = (d >>> 1) & 1;
+                      a = c[(190380 + (((h | i | k | e | a) + (d >>> a)) << 2)) >> 2] | 0;
+                      d = ((c[(a + 4) >> 2] & -8) - m) | 0;
+                      e = c[(a + 16 + ((((c[(a + 16) >> 2] | 0) == 0) & 1) << 2)) >> 2] | 0;
+                      if (!e) {
+                        k = a;
+                        h = d;
+                      } else {
+                        do {
+                          i = ((c[(e + 4) >> 2] & -8) - m) | 0;
+                          k = i >>> 0 < d >>> 0;
+                          d = k ? i : d;
+                          a = k ? e : a;
+                          e = c[(e + 16 + ((((c[(e + 16) >> 2] | 0) == 0) & 1) << 2)) >> 2] | 0;
+                        } while ((e | 0) != 0);
+                        k = a;
+                        h = d;
+                      }
+                      i = (k + m) | 0;
+                      if (i >>> 0 > k >>> 0) {
+                        f = c[(k + 24) >> 2] | 0;
+                        b = c[(k + 12) >> 2] | 0;
+                        do
+                          if ((b | 0) == (k | 0)) {
+                            a = (k + 20) | 0;
+                            b = c[a >> 2] | 0;
+                            if (!b) {
+                              a = (k + 16) | 0;
+                              b = c[a >> 2] | 0;
+                              if (!b) {
+                                d = 0;
+                                break;
+                              }
+                            }
+                            while (1) {
+                              d = (b + 20) | 0;
+                              e = c[d >> 2] | 0;
+                              if (e | 0) {
+                                b = e;
+                                a = d;
+                                continue;
+                              }
+                              d = (b + 16) | 0;
+                              e = c[d >> 2] | 0;
+                              if (!e) break;
+                              else {
+                                b = e;
+                                a = d;
+                              }
+                            }
+                            c[a >> 2] = 0;
+                            d = b;
+                          } else {
+                            d = c[(k + 8) >> 2] | 0;
+                            c[(d + 12) >> 2] = b;
+                            c[(b + 8) >> 2] = d;
+                            d = b;
+                          }
+                        while (0);
+                        do
+                          if (f | 0) {
+                            b = c[(k + 28) >> 2] | 0;
+                            a = (190380 + (b << 2)) | 0;
+                            if ((k | 0) == (c[a >> 2] | 0)) {
+                              c[a >> 2] = d;
+                              if (!d) {
+                                c[47520] = j & ~(1 << b);
+                                break;
+                              }
+                            } else {
+                              c[(f + 16 + ((((c[(f + 16) >> 2] | 0) != (k | 0)) & 1) << 2)) >> 2] = d;
+                              if (!d) break;
+                            }
+                            c[(d + 24) >> 2] = f;
+                            b = c[(k + 16) >> 2] | 0;
+                            if (b | 0) {
+                              c[(d + 16) >> 2] = b;
+                              c[(b + 24) >> 2] = d;
+                            }
+                            b = c[(k + 20) >> 2] | 0;
+                            if (b | 0) {
+                              c[(d + 20) >> 2] = b;
+                              c[(b + 24) >> 2] = d;
+                            }
+                          }
+                        while (0);
+                        if (h >>> 0 < 16) {
+                          w = (h + m) | 0;
+                          c[(k + 4) >> 2] = w | 3;
+                          w = (k + w + 4) | 0;
+                          c[w >> 2] = c[w >> 2] | 1;
+                        } else {
+                          c[(k + 4) >> 2] = m | 3;
+                          c[(i + 4) >> 2] = h | 1;
+                          c[(i + h) >> 2] = h;
+                          if (n | 0) {
+                            e = c[47524] | 0;
+                            b = n >>> 3;
+                            d = (190116 + ((b << 1) << 2)) | 0;
+                            b = 1 << b;
+                            if (!(o & b)) {
+                              c[47519] = o | b;
+                              b = d;
+                              a = (d + 8) | 0;
+                            } else {
+                              a = (d + 8) | 0;
+                              b = c[a >> 2] | 0;
+                            }
+                            c[a >> 2] = e;
+                            c[(b + 12) >> 2] = e;
+                            c[(e + 8) >> 2] = b;
+                            c[(e + 12) >> 2] = d;
+                          }
+                          c[47521] = h;
+                          c[47524] = i;
+                        }
+                        w = (k + 8) | 0;
+                        l = x;
+                        return w | 0;
+                      } else n = m;
+                    } else n = m;
+                  } else n = m;
+                } else if (a >>> 0 <= 4294967231) {
+                  a = (a + 11) | 0;
+                  m = a & -8;
+                  k = c[47520] | 0;
+                  if (k) {
+                    e = (0 - m) | 0;
+                    a = a >>> 8;
+                    if (a)
+                      if (m >>> 0 > 16777215) j = 31;
+                      else {
+                        o = (((a + 1048320) | 0) >>> 16) & 8;
+                        v = a << o;
+                        n = (((v + 520192) | 0) >>> 16) & 4;
+                        v = v << n;
+                        j = (((v + 245760) | 0) >>> 16) & 2;
+                        j = (14 - (n | o | j) + ((v << j) >>> 15)) | 0;
+                        j = ((m >>> ((j + 7) | 0)) & 1) | (j << 1);
+                      }
+                    else j = 0;
+                    d = c[(190380 + (j << 2)) >> 2] | 0;
+                    a: do
+                      if (!d) {
+                        d = 0;
+                        a = 0;
+                        v = 57;
+                      } else {
+                        a = 0;
+                        i = d;
+                        h = m << ((j | 0) == 31 ? 0 : (25 - (j >>> 1)) | 0);
+                        d = 0;
+                        while (1) {
+                          f = ((c[(i + 4) >> 2] & -8) - m) | 0;
+                          if (f >>> 0 < e >>> 0)
+                            if (!f) {
+                              e = 0;
+                              d = i;
+                              a = i;
+                              v = 61;
+                              break a;
+                            } else {
+                              a = i;
+                              e = f;
+                            }
+                          f = c[(i + 20) >> 2] | 0;
+                          i = c[(i + 16 + ((h >>> 31) << 2)) >> 2] | 0;
+                          d = ((f | 0) == 0) | ((f | 0) == (i | 0)) ? d : f;
+                          f = (i | 0) == 0;
+                          if (f) {
+                            v = 57;
+                            break;
+                          } else h = h << ((f ^ 1) & 1);
+                        }
+                      }
+                    while (0);
+                    if ((v | 0) == 57) {
+                      if (((d | 0) == 0) & ((a | 0) == 0)) {
+                        a = 2 << j;
+                        a = k & (a | (0 - a));
+                        if (!a) {
+                          n = m;
+                          break;
+                        }
+                        o = ((a & (0 - a)) + -1) | 0;
+                        i = (o >>> 12) & 16;
+                        o = o >>> i;
+                        h = (o >>> 5) & 8;
+                        o = o >>> h;
+                        j = (o >>> 2) & 4;
+                        o = o >>> j;
+                        n = (o >>> 1) & 2;
+                        o = o >>> n;
+                        d = (o >>> 1) & 1;
+                        a = 0;
+                        d = c[(190380 + (((h | i | j | n | d) + (o >>> d)) << 2)) >> 2] | 0;
+                      }
+                      if (!d) {
+                        i = a;
+                        h = e;
+                      } else v = 61;
+                    }
+                    if ((v | 0) == 61)
+                      while (1) {
+                        v = 0;
+                        n = ((c[(d + 4) >> 2] & -8) - m) | 0;
+                        o = n >>> 0 < e >>> 0;
+                        e = o ? n : e;
+                        a = o ? d : a;
+                        d = c[(d + 16 + ((((c[(d + 16) >> 2] | 0) == 0) & 1) << 2)) >> 2] | 0;
+                        if (!d) {
+                          i = a;
+                          h = e;
+                          break;
+                        } else v = 61;
+                      }
+                    if ((i | 0) != 0 ? h >>> 0 < (((c[47521] | 0) - m) | 0) >>> 0 : 0) {
+                      g = (i + m) | 0;
+                      if (g >>> 0 <= i >>> 0) {
+                        w = 0;
+                        l = x;
+                        return w | 0;
+                      }
+                      f = c[(i + 24) >> 2] | 0;
+                      b = c[(i + 12) >> 2] | 0;
+                      do
+                        if ((b | 0) == (i | 0)) {
+                          a = (i + 20) | 0;
+                          b = c[a >> 2] | 0;
+                          if (!b) {
+                            a = (i + 16) | 0;
+                            b = c[a >> 2] | 0;
+                            if (!b) {
+                              b = 0;
+                              break;
+                            }
+                          }
+                          while (1) {
+                            d = (b + 20) | 0;
+                            e = c[d >> 2] | 0;
+                            if (e | 0) {
+                              b = e;
+                              a = d;
+                              continue;
+                            }
+                            d = (b + 16) | 0;
+                            e = c[d >> 2] | 0;
+                            if (!e) break;
+                            else {
+                              b = e;
+                              a = d;
+                            }
+                          }
+                          c[a >> 2] = 0;
+                        } else {
+                          w = c[(i + 8) >> 2] | 0;
+                          c[(w + 12) >> 2] = b;
+                          c[(b + 8) >> 2] = w;
+                        }
+                      while (0);
+                      do
+                        if (f) {
+                          a = c[(i + 28) >> 2] | 0;
+                          d = (190380 + (a << 2)) | 0;
+                          if ((i | 0) == (c[d >> 2] | 0)) {
+                            c[d >> 2] = b;
+                            if (!b) {
+                              e = k & ~(1 << a);
+                              c[47520] = e;
+                              break;
+                            }
+                          } else {
+                            c[(f + 16 + ((((c[(f + 16) >> 2] | 0) != (i | 0)) & 1) << 2)) >> 2] = b;
+                            if (!b) {
+                              e = k;
+                              break;
+                            }
+                          }
+                          c[(b + 24) >> 2] = f;
+                          a = c[(i + 16) >> 2] | 0;
+                          if (a | 0) {
+                            c[(b + 16) >> 2] = a;
+                            c[(a + 24) >> 2] = b;
+                          }
+                          a = c[(i + 20) >> 2] | 0;
+                          if (a) {
+                            c[(b + 20) >> 2] = a;
+                            c[(a + 24) >> 2] = b;
+                            e = k;
+                          } else e = k;
+                        } else e = k;
+                      while (0);
+                      do
+                        if (h >>> 0 >= 16) {
+                          c[(i + 4) >> 2] = m | 3;
+                          c[(g + 4) >> 2] = h | 1;
+                          c[(g + h) >> 2] = h;
+                          b = h >>> 3;
+                          if (h >>> 0 < 256) {
+                            d = (190116 + ((b << 1) << 2)) | 0;
+                            a = c[47519] | 0;
+                            b = 1 << b;
+                            if (!(a & b)) {
+                              c[47519] = a | b;
+                              b = d;
+                              a = (d + 8) | 0;
+                            } else {
+                              a = (d + 8) | 0;
+                              b = c[a >> 2] | 0;
+                            }
+                            c[a >> 2] = g;
+                            c[(b + 12) >> 2] = g;
+                            c[(g + 8) >> 2] = b;
+                            c[(g + 12) >> 2] = d;
+                            break;
+                          }
+                          b = h >>> 8;
+                          if (b)
+                            if (h >>> 0 > 16777215) b = 31;
+                            else {
+                              v = (((b + 1048320) | 0) >>> 16) & 8;
+                              w = b << v;
+                              u = (((w + 520192) | 0) >>> 16) & 4;
+                              w = w << u;
+                              b = (((w + 245760) | 0) >>> 16) & 2;
+                              b = (14 - (u | v | b) + ((w << b) >>> 15)) | 0;
+                              b = ((h >>> ((b + 7) | 0)) & 1) | (b << 1);
+                            }
+                          else b = 0;
+                          d = (190380 + (b << 2)) | 0;
+                          c[(g + 28) >> 2] = b;
+                          a = (g + 16) | 0;
+                          c[(a + 4) >> 2] = 0;
+                          c[a >> 2] = 0;
+                          a = 1 << b;
+                          if (!(e & a)) {
+                            c[47520] = e | a;
+                            c[d >> 2] = g;
+                            c[(g + 24) >> 2] = d;
+                            c[(g + 12) >> 2] = g;
+                            c[(g + 8) >> 2] = g;
+                            break;
+                          }
+                          a = h << ((b | 0) == 31 ? 0 : (25 - (b >>> 1)) | 0);
+                          d = c[d >> 2] | 0;
+                          while (1) {
+                            if (((c[(d + 4) >> 2] & -8) | 0) == (h | 0)) {
+                              v = 97;
+                              break;
+                            }
+                            e = (d + 16 + ((a >>> 31) << 2)) | 0;
+                            b = c[e >> 2] | 0;
+                            if (!b) {
+                              v = 96;
+                              break;
+                            } else {
+                              a = a << 1;
+                              d = b;
+                            }
+                          }
+                          if ((v | 0) == 96) {
+                            c[e >> 2] = g;
+                            c[(g + 24) >> 2] = d;
+                            c[(g + 12) >> 2] = g;
+                            c[(g + 8) >> 2] = g;
+                            break;
+                          } else if ((v | 0) == 97) {
+                            v = (d + 8) | 0;
+                            w = c[v >> 2] | 0;
+                            c[(w + 12) >> 2] = g;
+                            c[v >> 2] = g;
+                            c[(g + 8) >> 2] = w;
+                            c[(g + 12) >> 2] = d;
+                            c[(g + 24) >> 2] = 0;
+                            break;
+                          }
+                        } else {
+                          w = (h + m) | 0;
+                          c[(i + 4) >> 2] = w | 3;
+                          w = (i + w + 4) | 0;
+                          c[w >> 2] = c[w >> 2] | 1;
+                        }
+                      while (0);
+                      w = (i + 8) | 0;
+                      l = x;
+                      return w | 0;
+                    } else n = m;
+                  } else n = m;
+                } else n = -1;
+              while (0);
+              d = c[47521] | 0;
+              if (d >>> 0 >= n >>> 0) {
+                b = (d - n) | 0;
+                a = c[47524] | 0;
+                if (b >>> 0 > 15) {
+                  w = (a + n) | 0;
+                  c[47524] = w;
+                  c[47521] = b;
+                  c[(w + 4) >> 2] = b | 1;
+                  c[(a + d) >> 2] = b;
+                  c[(a + 4) >> 2] = n | 3;
+                } else {
+                  c[47521] = 0;
+                  c[47524] = 0;
+                  c[(a + 4) >> 2] = d | 3;
+                  w = (a + d + 4) | 0;
+                  c[w >> 2] = c[w >> 2] | 1;
+                }
+                w = (a + 8) | 0;
+                l = x;
+                return w | 0;
+              }
+              i = c[47522] | 0;
+              if (i >>> 0 > n >>> 0) {
+                u = (i - n) | 0;
+                c[47522] = u;
+                w = c[47525] | 0;
+                v = (w + n) | 0;
+                c[47525] = v;
+                c[(v + 4) >> 2] = u | 1;
+                c[(w + 4) >> 2] = n | 3;
+                w = (w + 8) | 0;
+                l = x;
+                return w | 0;
+              }
+              if (!(c[47637] | 0)) {
+                c[47639] = 4096;
+                c[47638] = 4096;
+                c[47640] = -1;
+                c[47641] = -1;
+                c[47642] = 0;
+                c[47630] = 0;
+                c[47637] = (p & -16) ^ 1431655768;
+                a = 4096;
+              } else a = c[47639] | 0;
+              j = (n + 48) | 0;
+              k = (n + 47) | 0;
+              h = (a + k) | 0;
+              f = (0 - a) | 0;
+              m = h & f;
+              if (m >>> 0 <= n >>> 0) {
+                w = 0;
+                l = x;
+                return w | 0;
+              }
+              a = c[47629] | 0;
+              if (a | 0 ? ((o = c[47627] | 0), (p = (o + m) | 0), (p >>> 0 <= o >>> 0) | (p >>> 0 > a >>> 0)) : 0) {
+                w = 0;
+                l = x;
+                return w | 0;
+              }
+              b: do
+                if (!(c[47630] & 4)) {
+                  d = c[47525] | 0;
+                  c: do
+                    if (d) {
+                      e = 190524;
+                      while (1) {
+                        a = c[e >> 2] | 0;
+                        if (a >>> 0 <= d >>> 0 ? ((s = (e + 4) | 0), ((a + (c[s >> 2] | 0)) | 0) >>> 0 > d >>> 0) : 0)
+                          break;
+                        a = c[(e + 8) >> 2] | 0;
+                        if (!a) {
+                          v = 118;
+                          break c;
+                        } else e = a;
+                      }
+                      b = (h - i) & f;
+                      if (b >>> 0 < 2147483647) {
+                        a = Z6(b | 0) | 0;
+                        if ((a | 0) == (((c[e >> 2] | 0) + (c[s >> 2] | 0)) | 0)) {
+                          if ((a | 0) != (-1 | 0)) {
+                            h = b;
+                            g = a;
+                            v = 135;
+                            break b;
+                          }
+                        } else {
+                          e = a;
+                          v = 126;
+                        }
+                      } else b = 0;
+                    } else v = 118;
+                  while (0);
+                  do
+                    if ((v | 0) == 118) {
+                      d = Z6(0) | 0;
+                      if (
+                        (d | 0) != (-1 | 0)
+                          ? ((b = d),
+                            (q = c[47638] | 0),
+                            (r = (q + -1) | 0),
+                            (b = ((((r & b) | 0) == 0 ? 0 : (((r + b) & (0 - q)) - b) | 0) + m) | 0),
+                            (q = c[47627] | 0),
+                            (r = (b + q) | 0),
+                            (b >>> 0 > n >>> 0) & (b >>> 0 < 2147483647))
+                          : 0
+                      ) {
+                        s = c[47629] | 0;
+                        if (s | 0 ? (r >>> 0 <= q >>> 0) | (r >>> 0 > s >>> 0) : 0) {
+                          b = 0;
+                          break;
+                        }
+                        a = Z6(b | 0) | 0;
+                        if ((a | 0) == (d | 0)) {
+                          h = b;
+                          g = d;
+                          v = 135;
+                          break b;
+                        } else {
+                          e = a;
+                          v = 126;
+                        }
+                      } else b = 0;
+                    }
+                  while (0);
+                  do
+                    if ((v | 0) == 126) {
+                      d = (0 - b) | 0;
+                      if (!((j >>> 0 > b >>> 0) & ((b >>> 0 < 2147483647) & ((e | 0) != (-1 | 0)))))
+                        if ((e | 0) == (-1 | 0)) {
+                          b = 0;
+                          break;
+                        } else {
+                          h = b;
+                          g = e;
+                          v = 135;
+                          break b;
+                        }
+                      a = c[47639] | 0;
+                      a = (k - b + a) & (0 - a);
+                      if (a >>> 0 >= 2147483647) {
+                        h = b;
+                        g = e;
+                        v = 135;
+                        break b;
+                      }
+                      if ((Z6(a | 0) | 0) == (-1 | 0)) {
+                        Z6(d | 0) | 0;
+                        b = 0;
+                        break;
+                      } else {
+                        h = (a + b) | 0;
+                        g = e;
+                        v = 135;
+                        break b;
+                      }
+                    }
+                  while (0);
+                  c[47630] = c[47630] | 4;
+                  v = 133;
+                } else {
+                  b = 0;
+                  v = 133;
+                }
+              while (0);
+              if (
+                ((v | 0) == 133 ? m >>> 0 < 2147483647 : 0)
+                  ? ((g = Z6(m | 0) | 0),
+                    (s = Z6(0) | 0),
+                    (t = (s - g) | 0),
+                    (u = t >>> 0 > ((n + 40) | 0) >>> 0),
+                    !(
+                      ((g | 0) == (-1 | 0)) |
+                      (u ^ 1) |
+                      (((g >>> 0 < s >>> 0) & (((g | 0) != (-1 | 0)) & ((s | 0) != (-1 | 0)))) ^ 1)
+                    ))
+                  : 0
+              ) {
+                h = u ? t : b;
+                v = 135;
+              }
+              if ((v | 0) == 135) {
+                b = ((c[47627] | 0) + h) | 0;
+                c[47627] = b;
+                if (b >>> 0 > (c[47628] | 0) >>> 0) c[47628] = b;
+                j = c[47525] | 0;
+                do
+                  if (j) {
+                    b = 190524;
+                    while (1) {
+                      a = c[b >> 2] | 0;
+                      d = (b + 4) | 0;
+                      e = c[d >> 2] | 0;
+                      if ((g | 0) == ((a + e) | 0)) {
+                        v = 143;
+                        break;
+                      }
+                      f = c[(b + 8) >> 2] | 0;
+                      if (!f) break;
+                      else b = f;
+                    }
+                    if (
+                      ((v | 0) == 143 ? ((c[(b + 12) >> 2] & 8) | 0) == 0 : 0)
+                        ? (g >>> 0 > j >>> 0) & (a >>> 0 <= j >>> 0)
+                        : 0
+                    ) {
+                      c[d >> 2] = e + h;
+                      w = ((c[47522] | 0) + h) | 0;
+                      u = (j + 8) | 0;
+                      u = ((u & 7) | 0) == 0 ? 0 : (0 - u) & 7;
+                      v = (j + u) | 0;
+                      u = (w - u) | 0;
+                      c[47525] = v;
+                      c[47522] = u;
+                      c[(v + 4) >> 2] = u | 1;
+                      c[(j + w + 4) >> 2] = 40;
+                      c[47526] = c[47641];
+                      break;
+                    }
+                    if (g >>> 0 < (c[47523] | 0) >>> 0) c[47523] = g;
+                    a = (g + h) | 0;
+                    b = 190524;
+                    while (1) {
+                      if ((c[b >> 2] | 0) == (a | 0)) {
+                        v = 151;
+                        break;
+                      }
+                      b = c[(b + 8) >> 2] | 0;
+                      if (!b) {
+                        a = 190524;
+                        break;
+                      }
+                    }
+                    if ((v | 0) == 151)
+                      if (!(c[(b + 12) >> 2] & 8)) {
+                        c[b >> 2] = g;
+                        m = (b + 4) | 0;
+                        c[m >> 2] = (c[m >> 2] | 0) + h;
+                        m = (g + 8) | 0;
+                        m = (g + (((m & 7) | 0) == 0 ? 0 : (0 - m) & 7)) | 0;
+                        b = (a + 8) | 0;
+                        b = (a + (((b & 7) | 0) == 0 ? 0 : (0 - b) & 7)) | 0;
+                        k = (m + n) | 0;
+                        i = (b - m - n) | 0;
+                        c[(m + 4) >> 2] = n | 3;
+                        do
+                          if ((j | 0) != (b | 0)) {
+                            if ((c[47524] | 0) == (b | 0)) {
+                              w = ((c[47521] | 0) + i) | 0;
+                              c[47521] = w;
+                              c[47524] = k;
+                              c[(k + 4) >> 2] = w | 1;
+                              c[(k + w) >> 2] = w;
+                              break;
+                            }
+                            a = c[(b + 4) >> 2] | 0;
+                            if (((a & 3) | 0) == 1) {
+                              h = a & -8;
+                              e = a >>> 3;
+                              d: do
+                                if (a >>> 0 < 256) {
+                                  a = c[(b + 8) >> 2] | 0;
+                                  d = c[(b + 12) >> 2] | 0;
+                                  if ((d | 0) == (a | 0)) {
+                                    c[47519] = c[47519] & ~(1 << e);
+                                    break;
+                                  } else {
+                                    c[(a + 12) >> 2] = d;
+                                    c[(d + 8) >> 2] = a;
+                                    break;
+                                  }
+                                } else {
+                                  g = c[(b + 24) >> 2] | 0;
+                                  a = c[(b + 12) >> 2] | 0;
+                                  do
+                                    if ((a | 0) == (b | 0)) {
+                                      e = (b + 16) | 0;
+                                      d = (e + 4) | 0;
+                                      a = c[d >> 2] | 0;
+                                      if (!a) {
+                                        a = c[e >> 2] | 0;
+                                        if (!a) {
+                                          a = 0;
+                                          break;
+                                        } else d = e;
+                                      }
+                                      while (1) {
+                                        e = (a + 20) | 0;
+                                        f = c[e >> 2] | 0;
+                                        if (f | 0) {
+                                          a = f;
+                                          d = e;
+                                          continue;
+                                        }
+                                        e = (a + 16) | 0;
+                                        f = c[e >> 2] | 0;
+                                        if (!f) break;
+                                        else {
+                                          a = f;
+                                          d = e;
+                                        }
+                                      }
+                                      c[d >> 2] = 0;
+                                    } else {
+                                      w = c[(b + 8) >> 2] | 0;
+                                      c[(w + 12) >> 2] = a;
+                                      c[(a + 8) >> 2] = w;
+                                    }
+                                  while (0);
+                                  if (!g) break;
+                                  d = c[(b + 28) >> 2] | 0;
+                                  e = (190380 + (d << 2)) | 0;
+                                  do
+                                    if ((c[e >> 2] | 0) != (b | 0)) {
+                                      c[(g + 16 + ((((c[(g + 16) >> 2] | 0) != (b | 0)) & 1) << 2)) >> 2] = a;
+                                      if (!a) break d;
+                                    } else {
+                                      c[e >> 2] = a;
+                                      if (a | 0) break;
+                                      c[47520] = c[47520] & ~(1 << d);
+                                      break d;
+                                    }
+                                  while (0);
+                                  c[(a + 24) >> 2] = g;
+                                  d = (b + 16) | 0;
+                                  e = c[d >> 2] | 0;
+                                  if (e | 0) {
+                                    c[(a + 16) >> 2] = e;
+                                    c[(e + 24) >> 2] = a;
+                                  }
+                                  d = c[(d + 4) >> 2] | 0;
+                                  if (!d) break;
+                                  c[(a + 20) >> 2] = d;
+                                  c[(d + 24) >> 2] = a;
+                                }
+                              while (0);
+                              b = (b + h) | 0;
+                              f = (h + i) | 0;
+                            } else f = i;
+                            b = (b + 4) | 0;
+                            c[b >> 2] = c[b >> 2] & -2;
+                            c[(k + 4) >> 2] = f | 1;
+                            c[(k + f) >> 2] = f;
+                            b = f >>> 3;
+                            if (f >>> 0 < 256) {
+                              d = (190116 + ((b << 1) << 2)) | 0;
+                              a = c[47519] | 0;
+                              b = 1 << b;
+                              if (!(a & b)) {
+                                c[47519] = a | b;
+                                b = d;
+                                a = (d + 8) | 0;
+                              } else {
+                                a = (d + 8) | 0;
+                                b = c[a >> 2] | 0;
+                              }
+                              c[a >> 2] = k;
+                              c[(b + 12) >> 2] = k;
+                              c[(k + 8) >> 2] = b;
+                              c[(k + 12) >> 2] = d;
+                              break;
+                            }
+                            b = f >>> 8;
+                            do
+                              if (!b) b = 0;
+                              else {
+                                if (f >>> 0 > 16777215) {
+                                  b = 31;
+                                  break;
+                                }
+                                v = (((b + 1048320) | 0) >>> 16) & 8;
+                                w = b << v;
+                                u = (((w + 520192) | 0) >>> 16) & 4;
+                                w = w << u;
+                                b = (((w + 245760) | 0) >>> 16) & 2;
+                                b = (14 - (u | v | b) + ((w << b) >>> 15)) | 0;
+                                b = ((f >>> ((b + 7) | 0)) & 1) | (b << 1);
+                              }
+                            while (0);
+                            e = (190380 + (b << 2)) | 0;
+                            c[(k + 28) >> 2] = b;
+                            a = (k + 16) | 0;
+                            c[(a + 4) >> 2] = 0;
+                            c[a >> 2] = 0;
+                            a = c[47520] | 0;
+                            d = 1 << b;
+                            if (!(a & d)) {
+                              c[47520] = a | d;
+                              c[e >> 2] = k;
+                              c[(k + 24) >> 2] = e;
+                              c[(k + 12) >> 2] = k;
+                              c[(k + 8) >> 2] = k;
+                              break;
+                            }
+                            a = f << ((b | 0) == 31 ? 0 : (25 - (b >>> 1)) | 0);
+                            d = c[e >> 2] | 0;
+                            while (1) {
+                              if (((c[(d + 4) >> 2] & -8) | 0) == (f | 0)) {
+                                v = 192;
+                                break;
+                              }
+                              e = (d + 16 + ((a >>> 31) << 2)) | 0;
+                              b = c[e >> 2] | 0;
+                              if (!b) {
+                                v = 191;
+                                break;
+                              } else {
+                                a = a << 1;
+                                d = b;
+                              }
+                            }
+                            if ((v | 0) == 191) {
+                              c[e >> 2] = k;
+                              c[(k + 24) >> 2] = d;
+                              c[(k + 12) >> 2] = k;
+                              c[(k + 8) >> 2] = k;
+                              break;
+                            } else if ((v | 0) == 192) {
+                              v = (d + 8) | 0;
+                              w = c[v >> 2] | 0;
+                              c[(w + 12) >> 2] = k;
+                              c[v >> 2] = k;
+                              c[(k + 8) >> 2] = w;
+                              c[(k + 12) >> 2] = d;
+                              c[(k + 24) >> 2] = 0;
+                              break;
+                            }
+                          } else {
+                            w = ((c[47522] | 0) + i) | 0;
+                            c[47522] = w;
+                            c[47525] = k;
+                            c[(k + 4) >> 2] = w | 1;
+                          }
+                        while (0);
+                        w = (m + 8) | 0;
+                        l = x;
+                        return w | 0;
+                      } else a = 190524;
+                    while (1) {
+                      b = c[a >> 2] | 0;
+                      if (b >>> 0 <= j >>> 0 ? ((w = (b + (c[(a + 4) >> 2] | 0)) | 0), w >>> 0 > j >>> 0) : 0) break;
+                      a = c[(a + 8) >> 2] | 0;
+                    }
+                    f = (w + -47) | 0;
+                    a = (f + 8) | 0;
+                    a = (f + (((a & 7) | 0) == 0 ? 0 : (0 - a) & 7)) | 0;
+                    f = (j + 16) | 0;
+                    a = a >>> 0 < f >>> 0 ? j : a;
+                    b = (a + 8) | 0;
+                    d = (h + -40) | 0;
+                    u = (g + 8) | 0;
+                    u = ((u & 7) | 0) == 0 ? 0 : (0 - u) & 7;
+                    v = (g + u) | 0;
+                    u = (d - u) | 0;
+                    c[47525] = v;
+                    c[47522] = u;
+                    c[(v + 4) >> 2] = u | 1;
+                    c[(g + d + 4) >> 2] = 40;
+                    c[47526] = c[47641];
+                    d = (a + 4) | 0;
+                    c[d >> 2] = 27;
+                    c[b >> 2] = c[47631];
+                    c[(b + 4) >> 2] = c[47632];
+                    c[(b + 8) >> 2] = c[47633];
+                    c[(b + 12) >> 2] = c[47634];
+                    c[47631] = g;
+                    c[47632] = h;
+                    c[47634] = 0;
+                    c[47633] = b;
+                    b = (a + 24) | 0;
+                    do {
+                      v = b;
+                      b = (b + 4) | 0;
+                      c[b >> 2] = 7;
+                    } while (((v + 8) | 0) >>> 0 < w >>> 0);
+                    if ((a | 0) != (j | 0)) {
+                      g = (a - j) | 0;
+                      c[d >> 2] = c[d >> 2] & -2;
+                      c[(j + 4) >> 2] = g | 1;
+                      c[a >> 2] = g;
+                      b = g >>> 3;
+                      if (g >>> 0 < 256) {
+                        d = (190116 + ((b << 1) << 2)) | 0;
+                        a = c[47519] | 0;
+                        b = 1 << b;
+                        if (!(a & b)) {
+                          c[47519] = a | b;
+                          b = d;
+                          a = (d + 8) | 0;
+                        } else {
+                          a = (d + 8) | 0;
+                          b = c[a >> 2] | 0;
+                        }
+                        c[a >> 2] = j;
+                        c[(b + 12) >> 2] = j;
+                        c[(j + 8) >> 2] = b;
+                        c[(j + 12) >> 2] = d;
+                        break;
+                      }
+                      b = g >>> 8;
+                      if (b)
+                        if (g >>> 0 > 16777215) d = 31;
+                        else {
+                          v = (((b + 1048320) | 0) >>> 16) & 8;
+                          w = b << v;
+                          u = (((w + 520192) | 0) >>> 16) & 4;
+                          w = w << u;
+                          d = (((w + 245760) | 0) >>> 16) & 2;
+                          d = (14 - (u | v | d) + ((w << d) >>> 15)) | 0;
+                          d = ((g >>> ((d + 7) | 0)) & 1) | (d << 1);
+                        }
+                      else d = 0;
+                      e = (190380 + (d << 2)) | 0;
+                      c[(j + 28) >> 2] = d;
+                      c[(j + 20) >> 2] = 0;
+                      c[f >> 2] = 0;
+                      b = c[47520] | 0;
+                      a = 1 << d;
+                      if (!(b & a)) {
+                        c[47520] = b | a;
+                        c[e >> 2] = j;
+                        c[(j + 24) >> 2] = e;
+                        c[(j + 12) >> 2] = j;
+                        c[(j + 8) >> 2] = j;
+                        break;
+                      }
+                      a = g << ((d | 0) == 31 ? 0 : (25 - (d >>> 1)) | 0);
+                      d = c[e >> 2] | 0;
+                      while (1) {
+                        if (((c[(d + 4) >> 2] & -8) | 0) == (g | 0)) {
+                          v = 213;
+                          break;
+                        }
+                        e = (d + 16 + ((a >>> 31) << 2)) | 0;
+                        b = c[e >> 2] | 0;
+                        if (!b) {
+                          v = 212;
+                          break;
+                        } else {
+                          a = a << 1;
+                          d = b;
+                        }
+                      }
+                      if ((v | 0) == 212) {
+                        c[e >> 2] = j;
+                        c[(j + 24) >> 2] = d;
+                        c[(j + 12) >> 2] = j;
+                        c[(j + 8) >> 2] = j;
+                        break;
+                      } else if ((v | 0) == 213) {
+                        v = (d + 8) | 0;
+                        w = c[v >> 2] | 0;
+                        c[(w + 12) >> 2] = j;
+                        c[v >> 2] = j;
+                        c[(j + 8) >> 2] = w;
+                        c[(j + 12) >> 2] = d;
+                        c[(j + 24) >> 2] = 0;
+                        break;
+                      }
+                    }
+                  } else {
+                    w = c[47523] | 0;
+                    if (((w | 0) == 0) | (g >>> 0 < w >>> 0)) c[47523] = g;
+                    c[47631] = g;
+                    c[47632] = h;
+                    c[47634] = 0;
+                    c[47528] = c[47637];
+                    c[47527] = -1;
+                    c[47532] = 190116;
+                    c[47531] = 190116;
+                    c[47534] = 190124;
+                    c[47533] = 190124;
+                    c[47536] = 190132;
+                    c[47535] = 190132;
+                    c[47538] = 190140;
+                    c[47537] = 190140;
+                    c[47540] = 190148;
+                    c[47539] = 190148;
+                    c[47542] = 190156;
+                    c[47541] = 190156;
+                    c[47544] = 190164;
+                    c[47543] = 190164;
+                    c[47546] = 190172;
+                    c[47545] = 190172;
+                    c[47548] = 190180;
+                    c[47547] = 190180;
+                    c[47550] = 190188;
+                    c[47549] = 190188;
+                    c[47552] = 190196;
+                    c[47551] = 190196;
+                    c[47554] = 190204;
+                    c[47553] = 190204;
+                    c[47556] = 190212;
+                    c[47555] = 190212;
+                    c[47558] = 190220;
+                    c[47557] = 190220;
+                    c[47560] = 190228;
+                    c[47559] = 190228;
+                    c[47562] = 190236;
+                    c[47561] = 190236;
+                    c[47564] = 190244;
+                    c[47563] = 190244;
+                    c[47566] = 190252;
+                    c[47565] = 190252;
+                    c[47568] = 190260;
+                    c[47567] = 190260;
+                    c[47570] = 190268;
+                    c[47569] = 190268;
+                    c[47572] = 190276;
+                    c[47571] = 190276;
+                    c[47574] = 190284;
+                    c[47573] = 190284;
+                    c[47576] = 190292;
+                    c[47575] = 190292;
+                    c[47578] = 190300;
+                    c[47577] = 190300;
+                    c[47580] = 190308;
+                    c[47579] = 190308;
+                    c[47582] = 190316;
+                    c[47581] = 190316;
+                    c[47584] = 190324;
+                    c[47583] = 190324;
+                    c[47586] = 190332;
+                    c[47585] = 190332;
+                    c[47588] = 190340;
+                    c[47587] = 190340;
+                    c[47590] = 190348;
+                    c[47589] = 190348;
+                    c[47592] = 190356;
+                    c[47591] = 190356;
+                    c[47594] = 190364;
+                    c[47593] = 190364;
+                    w = (h + -40) | 0;
+                    u = (g + 8) | 0;
+                    u = ((u & 7) | 0) == 0 ? 0 : (0 - u) & 7;
+                    v = (g + u) | 0;
+                    u = (w - u) | 0;
+                    c[47525] = v;
+                    c[47522] = u;
+                    c[(v + 4) >> 2] = u | 1;
+                    c[(g + w + 4) >> 2] = 40;
+                    c[47526] = c[47641];
+                  }
+                while (0);
+                b = c[47522] | 0;
+                if (b >>> 0 > n >>> 0) {
+                  u = (b - n) | 0;
+                  c[47522] = u;
+                  w = c[47525] | 0;
+                  v = (w + n) | 0;
+                  c[47525] = v;
+                  c[(v + 4) >> 2] = u | 1;
+                  c[(w + 4) >> 2] = n | 3;
+                  w = (w + 8) | 0;
+                  l = x;
+                  return w | 0;
+                }
+              }
+              c[(d2() | 0) >> 2] = 12;
+              w = 0;
+              l = x;
+              return w | 0;
+            }
+            function U1(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              if (!a) return;
+              d = (a + -8) | 0;
+              f = c[47523] | 0;
+              a = c[(a + -4) >> 2] | 0;
+              b = a & -8;
+              j = (d + b) | 0;
+              do
+                if (!(a & 1)) {
+                  e = c[d >> 2] | 0;
+                  if (!(a & 3)) return;
+                  h = (d + (0 - e)) | 0;
+                  g = (e + b) | 0;
+                  if (h >>> 0 < f >>> 0) return;
+                  if ((c[47524] | 0) == (h | 0)) {
+                    a = (j + 4) | 0;
+                    b = c[a >> 2] | 0;
+                    if (((b & 3) | 0) != 3) {
+                      i = h;
+                      b = g;
+                      break;
+                    }
+                    c[47521] = g;
+                    c[a >> 2] = b & -2;
+                    c[(h + 4) >> 2] = g | 1;
+                    c[(h + g) >> 2] = g;
+                    return;
+                  }
+                  d = e >>> 3;
+                  if (e >>> 0 < 256) {
+                    a = c[(h + 8) >> 2] | 0;
+                    b = c[(h + 12) >> 2] | 0;
+                    if ((b | 0) == (a | 0)) {
+                      c[47519] = c[47519] & ~(1 << d);
+                      i = h;
+                      b = g;
+                      break;
+                    } else {
+                      c[(a + 12) >> 2] = b;
+                      c[(b + 8) >> 2] = a;
+                      i = h;
+                      b = g;
+                      break;
+                    }
+                  }
+                  f = c[(h + 24) >> 2] | 0;
+                  a = c[(h + 12) >> 2] | 0;
+                  do
+                    if ((a | 0) == (h | 0)) {
+                      d = (h + 16) | 0;
+                      b = (d + 4) | 0;
+                      a = c[b >> 2] | 0;
+                      if (!a) {
+                        a = c[d >> 2] | 0;
+                        if (!a) {
+                          a = 0;
+                          break;
+                        } else b = d;
+                      }
+                      while (1) {
+                        d = (a + 20) | 0;
+                        e = c[d >> 2] | 0;
+                        if (e | 0) {
+                          a = e;
+                          b = d;
+                          continue;
+                        }
+                        d = (a + 16) | 0;
+                        e = c[d >> 2] | 0;
+                        if (!e) break;
+                        else {
+                          a = e;
+                          b = d;
+                        }
+                      }
+                      c[b >> 2] = 0;
+                    } else {
+                      i = c[(h + 8) >> 2] | 0;
+                      c[(i + 12) >> 2] = a;
+                      c[(a + 8) >> 2] = i;
+                    }
+                  while (0);
+                  if (f) {
+                    b = c[(h + 28) >> 2] | 0;
+                    d = (190380 + (b << 2)) | 0;
+                    if ((c[d >> 2] | 0) == (h | 0)) {
+                      c[d >> 2] = a;
+                      if (!a) {
+                        c[47520] = c[47520] & ~(1 << b);
+                        i = h;
+                        b = g;
+                        break;
+                      }
+                    } else {
+                      c[(f + 16 + ((((c[(f + 16) >> 2] | 0) != (h | 0)) & 1) << 2)) >> 2] = a;
+                      if (!a) {
+                        i = h;
+                        b = g;
+                        break;
+                      }
+                    }
+                    c[(a + 24) >> 2] = f;
+                    b = (h + 16) | 0;
+                    d = c[b >> 2] | 0;
+                    if (d | 0) {
+                      c[(a + 16) >> 2] = d;
+                      c[(d + 24) >> 2] = a;
+                    }
+                    b = c[(b + 4) >> 2] | 0;
+                    if (b) {
+                      c[(a + 20) >> 2] = b;
+                      c[(b + 24) >> 2] = a;
+                      i = h;
+                      b = g;
+                    } else {
+                      i = h;
+                      b = g;
+                    }
+                  } else {
+                    i = h;
+                    b = g;
+                  }
+                } else {
+                  i = d;
+                  h = d;
+                }
+              while (0);
+              if (h >>> 0 >= j >>> 0) return;
+              a = (j + 4) | 0;
+              e = c[a >> 2] | 0;
+              if (!(e & 1)) return;
+              if (!(e & 2)) {
+                if ((c[47525] | 0) == (j | 0)) {
+                  j = ((c[47522] | 0) + b) | 0;
+                  c[47522] = j;
+                  c[47525] = i;
+                  c[(i + 4) >> 2] = j | 1;
+                  if ((i | 0) != (c[47524] | 0)) return;
+                  c[47524] = 0;
+                  c[47521] = 0;
+                  return;
+                }
+                if ((c[47524] | 0) == (j | 0)) {
+                  j = ((c[47521] | 0) + b) | 0;
+                  c[47521] = j;
+                  c[47524] = h;
+                  c[(i + 4) >> 2] = j | 1;
+                  c[(h + j) >> 2] = j;
+                  return;
+                }
+                f = ((e & -8) + b) | 0;
+                d = e >>> 3;
+                do
+                  if (e >>> 0 < 256) {
+                    b = c[(j + 8) >> 2] | 0;
+                    a = c[(j + 12) >> 2] | 0;
+                    if ((a | 0) == (b | 0)) {
+                      c[47519] = c[47519] & ~(1 << d);
+                      break;
+                    } else {
+                      c[(b + 12) >> 2] = a;
+                      c[(a + 8) >> 2] = b;
+                      break;
+                    }
+                  } else {
+                    g = c[(j + 24) >> 2] | 0;
+                    a = c[(j + 12) >> 2] | 0;
+                    do
+                      if ((a | 0) == (j | 0)) {
+                        d = (j + 16) | 0;
+                        b = (d + 4) | 0;
+                        a = c[b >> 2] | 0;
+                        if (!a) {
+                          a = c[d >> 2] | 0;
+                          if (!a) {
+                            d = 0;
+                            break;
+                          } else b = d;
+                        }
+                        while (1) {
+                          d = (a + 20) | 0;
+                          e = c[d >> 2] | 0;
+                          if (e | 0) {
+                            a = e;
+                            b = d;
+                            continue;
+                          }
+                          d = (a + 16) | 0;
+                          e = c[d >> 2] | 0;
+                          if (!e) break;
+                          else {
+                            a = e;
+                            b = d;
+                          }
+                        }
+                        c[b >> 2] = 0;
+                        d = a;
+                      } else {
+                        d = c[(j + 8) >> 2] | 0;
+                        c[(d + 12) >> 2] = a;
+                        c[(a + 8) >> 2] = d;
+                        d = a;
+                      }
+                    while (0);
+                    if (g | 0) {
+                      a = c[(j + 28) >> 2] | 0;
+                      b = (190380 + (a << 2)) | 0;
+                      if ((c[b >> 2] | 0) == (j | 0)) {
+                        c[b >> 2] = d;
+                        if (!d) {
+                          c[47520] = c[47520] & ~(1 << a);
+                          break;
+                        }
+                      } else {
+                        c[(g + 16 + ((((c[(g + 16) >> 2] | 0) != (j | 0)) & 1) << 2)) >> 2] = d;
+                        if (!d) break;
+                      }
+                      c[(d + 24) >> 2] = g;
+                      a = (j + 16) | 0;
+                      b = c[a >> 2] | 0;
+                      if (b | 0) {
+                        c[(d + 16) >> 2] = b;
+                        c[(b + 24) >> 2] = d;
+                      }
+                      a = c[(a + 4) >> 2] | 0;
+                      if (a | 0) {
+                        c[(d + 20) >> 2] = a;
+                        c[(a + 24) >> 2] = d;
+                      }
+                    }
+                  }
+                while (0);
+                c[(i + 4) >> 2] = f | 1;
+                c[(h + f) >> 2] = f;
+                if ((i | 0) == (c[47524] | 0)) {
+                  c[47521] = f;
+                  return;
+                }
+              } else {
+                c[a >> 2] = e & -2;
+                c[(i + 4) >> 2] = b | 1;
+                c[(h + b) >> 2] = b;
+                f = b;
+              }
+              a = f >>> 3;
+              if (f >>> 0 < 256) {
+                d = (190116 + ((a << 1) << 2)) | 0;
+                b = c[47519] | 0;
+                a = 1 << a;
+                if (!(b & a)) {
+                  c[47519] = b | a;
+                  a = d;
+                  b = (d + 8) | 0;
+                } else {
+                  b = (d + 8) | 0;
+                  a = c[b >> 2] | 0;
+                }
+                c[b >> 2] = i;
+                c[(a + 12) >> 2] = i;
+                c[(i + 8) >> 2] = a;
+                c[(i + 12) >> 2] = d;
+                return;
+              }
+              a = f >>> 8;
+              if (a)
+                if (f >>> 0 > 16777215) a = 31;
+                else {
+                  h = (((a + 1048320) | 0) >>> 16) & 8;
+                  j = a << h;
+                  g = (((j + 520192) | 0) >>> 16) & 4;
+                  j = j << g;
+                  a = (((j + 245760) | 0) >>> 16) & 2;
+                  a = (14 - (g | h | a) + ((j << a) >>> 15)) | 0;
+                  a = ((f >>> ((a + 7) | 0)) & 1) | (a << 1);
+                }
+              else a = 0;
+              e = (190380 + (a << 2)) | 0;
+              c[(i + 28) >> 2] = a;
+              c[(i + 20) >> 2] = 0;
+              c[(i + 16) >> 2] = 0;
+              b = c[47520] | 0;
+              d = 1 << a;
+              do
+                if (b & d) {
+                  b = f << ((a | 0) == 31 ? 0 : (25 - (a >>> 1)) | 0);
+                  d = c[e >> 2] | 0;
+                  while (1) {
+                    if (((c[(d + 4) >> 2] & -8) | 0) == (f | 0)) {
+                      a = 73;
+                      break;
+                    }
+                    e = (d + 16 + ((b >>> 31) << 2)) | 0;
+                    a = c[e >> 2] | 0;
+                    if (!a) {
+                      a = 72;
+                      break;
+                    } else {
+                      b = b << 1;
+                      d = a;
+                    }
+                  }
+                  if ((a | 0) == 72) {
+                    c[e >> 2] = i;
+                    c[(i + 24) >> 2] = d;
+                    c[(i + 12) >> 2] = i;
+                    c[(i + 8) >> 2] = i;
+                    break;
+                  } else if ((a | 0) == 73) {
+                    h = (d + 8) | 0;
+                    j = c[h >> 2] | 0;
+                    c[(j + 12) >> 2] = i;
+                    c[h >> 2] = i;
+                    c[(i + 8) >> 2] = j;
+                    c[(i + 12) >> 2] = d;
+                    c[(i + 24) >> 2] = 0;
+                    break;
+                  }
+                } else {
+                  c[47520] = b | d;
+                  c[e >> 2] = i;
+                  c[(i + 24) >> 2] = e;
+                  c[(i + 12) >> 2] = i;
+                  c[(i + 8) >> 2] = i;
+                }
+              while (0);
+              j = ((c[47527] | 0) + -1) | 0;
+              c[47527] = j;
+              if (!j) a = 190532;
+              else return;
+              while (1) {
+                a = c[a >> 2] | 0;
+                if (!a) break;
+                else a = (a + 8) | 0;
+              }
+              c[47527] = -1;
+              return;
+            }
+            function V1(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              if (a) {
+                d = O(b, a) | 0;
+                if ((b | a) >>> 0 > 65535) d = (((d >>> 0) / (a >>> 0)) | 0 | 0) == (b | 0) ? d : -1;
+              } else d = 0;
+              a = T1(d) | 0;
+              if (!a) return a | 0;
+              if (!(c[(a + -4) >> 2] & 3)) return a | 0;
+              Y6(a | 0, 0, d | 0) | 0;
+              return a | 0;
+            }
+            function W1(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              if (!a) {
+                b = T1(b) | 0;
+                return b | 0;
+              }
+              if (b >>> 0 > 4294967231) {
+                c[(d2() | 0) >> 2] = 12;
+                b = 0;
+                return b | 0;
+              }
+              d = X1((a + -8) | 0, b >>> 0 < 11 ? 16 : (b + 11) & -8) | 0;
+              if (d | 0) {
+                b = (d + 8) | 0;
+                return b | 0;
+              }
+              d = T1(b) | 0;
+              if (!d) {
+                b = 0;
+                return b | 0;
+              }
+              e = c[(a + -4) >> 2] | 0;
+              e = ((e & -8) - (((e & 3) | 0) == 0 ? 8 : 4)) | 0;
+              W6(d | 0, a | 0, (e >>> 0 < b >>> 0 ? e : b) | 0) | 0;
+              U1(a);
+              b = d;
+              return b | 0;
+            }
+            function X1(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              l = (a + 4) | 0;
+              m = c[l >> 2] | 0;
+              d = m & -8;
+              i = (a + d) | 0;
+              if (!(m & 3)) {
+                if (b >>> 0 < 256) {
+                  a = 0;
+                  return a | 0;
+                }
+                if (d >>> 0 >= ((b + 4) | 0) >>> 0 ? ((d - b) | 0) >>> 0 <= (c[47639] << 1) >>> 0 : 0) return a | 0;
+                a = 0;
+                return a | 0;
+              }
+              if (d >>> 0 >= b >>> 0) {
+                d = (d - b) | 0;
+                if (d >>> 0 <= 15) return a | 0;
+                k = (a + b) | 0;
+                c[l >> 2] = (m & 1) | b | 2;
+                c[(k + 4) >> 2] = d | 3;
+                m = (i + 4) | 0;
+                c[m >> 2] = c[m >> 2] | 1;
+                Y1(k, d);
+                return a | 0;
+              }
+              if ((c[47525] | 0) == (i | 0)) {
+                k = ((c[47522] | 0) + d) | 0;
+                d = (k - b) | 0;
+                e = (a + b) | 0;
+                if (k >>> 0 <= b >>> 0) {
+                  a = 0;
+                  return a | 0;
+                }
+                c[l >> 2] = (m & 1) | b | 2;
+                c[(e + 4) >> 2] = d | 1;
+                c[47525] = e;
+                c[47522] = d;
+                return a | 0;
+              }
+              if ((c[47524] | 0) == (i | 0)) {
+                e = ((c[47521] | 0) + d) | 0;
+                if (e >>> 0 < b >>> 0) {
+                  a = 0;
+                  return a | 0;
+                }
+                d = (e - b) | 0;
+                if (d >>> 0 > 15) {
+                  k = (a + b) | 0;
+                  e = (a + e) | 0;
+                  c[l >> 2] = (m & 1) | b | 2;
+                  c[(k + 4) >> 2] = d | 1;
+                  c[e >> 2] = d;
+                  e = (e + 4) | 0;
+                  c[e >> 2] = c[e >> 2] & -2;
+                  e = k;
+                } else {
+                  c[l >> 2] = (m & 1) | e | 2;
+                  e = (a + e + 4) | 0;
+                  c[e >> 2] = c[e >> 2] | 1;
+                  e = 0;
+                  d = 0;
+                }
+                c[47521] = d;
+                c[47524] = e;
+                return a | 0;
+              }
+              e = c[(i + 4) >> 2] | 0;
+              if ((e & 2) | 0) {
+                a = 0;
+                return a | 0;
+              }
+              j = ((e & -8) + d) | 0;
+              if (j >>> 0 < b >>> 0) {
+                a = 0;
+                return a | 0;
+              }
+              k = (j - b) | 0;
+              f = e >>> 3;
+              do
+                if (e >>> 0 < 256) {
+                  e = c[(i + 8) >> 2] | 0;
+                  d = c[(i + 12) >> 2] | 0;
+                  if ((d | 0) == (e | 0)) {
+                    c[47519] = c[47519] & ~(1 << f);
+                    break;
+                  } else {
+                    c[(e + 12) >> 2] = d;
+                    c[(d + 8) >> 2] = e;
+                    break;
+                  }
+                } else {
+                  h = c[(i + 24) >> 2] | 0;
+                  d = c[(i + 12) >> 2] | 0;
+                  do
+                    if ((d | 0) == (i | 0)) {
+                      f = (i + 16) | 0;
+                      e = (f + 4) | 0;
+                      d = c[e >> 2] | 0;
+                      if (!d) {
+                        d = c[f >> 2] | 0;
+                        if (!d) {
+                          f = 0;
+                          break;
+                        } else g = f;
+                      } else g = e;
+                      while (1) {
+                        f = (d + 20) | 0;
+                        e = c[f >> 2] | 0;
+                        if (e | 0) {
+                          d = e;
+                          g = f;
+                          continue;
+                        }
+                        e = (d + 16) | 0;
+                        f = c[e >> 2] | 0;
+                        if (!f) break;
+                        else {
+                          d = f;
+                          g = e;
+                        }
+                      }
+                      c[g >> 2] = 0;
+                      f = d;
+                    } else {
+                      f = c[(i + 8) >> 2] | 0;
+                      c[(f + 12) >> 2] = d;
+                      c[(d + 8) >> 2] = f;
+                      f = d;
+                    }
+                  while (0);
+                  if (h | 0) {
+                    d = c[(i + 28) >> 2] | 0;
+                    e = (190380 + (d << 2)) | 0;
+                    if ((c[e >> 2] | 0) == (i | 0)) {
+                      c[e >> 2] = f;
+                      if (!f) {
+                        c[47520] = c[47520] & ~(1 << d);
+                        break;
+                      }
+                    } else {
+                      c[(h + 16 + ((((c[(h + 16) >> 2] | 0) != (i | 0)) & 1) << 2)) >> 2] = f;
+                      if (!f) break;
+                    }
+                    c[(f + 24) >> 2] = h;
+                    d = (i + 16) | 0;
+                    e = c[d >> 2] | 0;
+                    if (e | 0) {
+                      c[(f + 16) >> 2] = e;
+                      c[(e + 24) >> 2] = f;
+                    }
+                    d = c[(d + 4) >> 2] | 0;
+                    if (d | 0) {
+                      c[(f + 20) >> 2] = d;
+                      c[(d + 24) >> 2] = f;
+                    }
+                  }
+                }
+              while (0);
+              if (k >>> 0 < 16) {
+                c[l >> 2] = j | (m & 1) | 2;
+                m = (a + j + 4) | 0;
+                c[m >> 2] = c[m >> 2] | 1;
+                return a | 0;
+              } else {
+                i = (a + b) | 0;
+                c[l >> 2] = (m & 1) | b | 2;
+                c[(i + 4) >> 2] = k | 3;
+                m = (a + j + 4) | 0;
+                c[m >> 2] = c[m >> 2] | 1;
+                Y1(i, k);
+                return a | 0;
+              }
+              return 0;
+            }
+            function Y1(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = (a + b) | 0;
+              d = c[(a + 4) >> 2] | 0;
+              do
+                if (!(d & 1)) {
+                  f = c[a >> 2] | 0;
+                  if (!(d & 3)) return;
+                  h = (a + (0 - f)) | 0;
+                  b = (f + b) | 0;
+                  if ((c[47524] | 0) == (h | 0)) {
+                    a = (i + 4) | 0;
+                    d = c[a >> 2] | 0;
+                    if (((d & 3) | 0) != 3) break;
+                    c[47521] = b;
+                    c[a >> 2] = d & -2;
+                    c[(h + 4) >> 2] = b | 1;
+                    c[i >> 2] = b;
+                    return;
+                  }
+                  e = f >>> 3;
+                  if (f >>> 0 < 256) {
+                    a = c[(h + 8) >> 2] | 0;
+                    d = c[(h + 12) >> 2] | 0;
+                    if ((d | 0) == (a | 0)) {
+                      c[47519] = c[47519] & ~(1 << e);
+                      break;
+                    } else {
+                      c[(a + 12) >> 2] = d;
+                      c[(d + 8) >> 2] = a;
+                      break;
+                    }
+                  }
+                  g = c[(h + 24) >> 2] | 0;
+                  a = c[(h + 12) >> 2] | 0;
+                  do
+                    if ((a | 0) == (h | 0)) {
+                      e = (h + 16) | 0;
+                      d = (e + 4) | 0;
+                      a = c[d >> 2] | 0;
+                      if (!a) {
+                        a = c[e >> 2] | 0;
+                        if (!a) {
+                          a = 0;
+                          break;
+                        } else d = e;
+                      }
+                      while (1) {
+                        e = (a + 20) | 0;
+                        f = c[e >> 2] | 0;
+                        if (f | 0) {
+                          a = f;
+                          d = e;
+                          continue;
+                        }
+                        e = (a + 16) | 0;
+                        f = c[e >> 2] | 0;
+                        if (!f) break;
+                        else {
+                          a = f;
+                          d = e;
+                        }
+                      }
+                      c[d >> 2] = 0;
+                    } else {
+                      f = c[(h + 8) >> 2] | 0;
+                      c[(f + 12) >> 2] = a;
+                      c[(a + 8) >> 2] = f;
+                    }
+                  while (0);
+                  if (g) {
+                    d = c[(h + 28) >> 2] | 0;
+                    e = (190380 + (d << 2)) | 0;
+                    if ((c[e >> 2] | 0) == (h | 0)) {
+                      c[e >> 2] = a;
+                      if (!a) {
+                        c[47520] = c[47520] & ~(1 << d);
+                        break;
+                      }
+                    } else {
+                      c[(g + 16 + ((((c[(g + 16) >> 2] | 0) != (h | 0)) & 1) << 2)) >> 2] = a;
+                      if (!a) break;
+                    }
+                    c[(a + 24) >> 2] = g;
+                    d = (h + 16) | 0;
+                    e = c[d >> 2] | 0;
+                    if (e | 0) {
+                      c[(a + 16) >> 2] = e;
+                      c[(e + 24) >> 2] = a;
+                    }
+                    d = c[(d + 4) >> 2] | 0;
+                    if (d) {
+                      c[(a + 20) >> 2] = d;
+                      c[(d + 24) >> 2] = a;
+                    }
+                  }
+                } else h = a;
+              while (0);
+              a = (i + 4) | 0;
+              e = c[a >> 2] | 0;
+              if (!(e & 2)) {
+                if ((c[47525] | 0) == (i | 0)) {
+                  i = ((c[47522] | 0) + b) | 0;
+                  c[47522] = i;
+                  c[47525] = h;
+                  c[(h + 4) >> 2] = i | 1;
+                  if ((h | 0) != (c[47524] | 0)) return;
+                  c[47524] = 0;
+                  c[47521] = 0;
+                  return;
+                }
+                if ((c[47524] | 0) == (i | 0)) {
+                  i = ((c[47521] | 0) + b) | 0;
+                  c[47521] = i;
+                  c[47524] = h;
+                  c[(h + 4) >> 2] = i | 1;
+                  c[(h + i) >> 2] = i;
+                  return;
+                }
+                f = ((e & -8) + b) | 0;
+                d = e >>> 3;
+                do
+                  if (e >>> 0 < 256) {
+                    a = c[(i + 8) >> 2] | 0;
+                    b = c[(i + 12) >> 2] | 0;
+                    if ((b | 0) == (a | 0)) {
+                      c[47519] = c[47519] & ~(1 << d);
+                      break;
+                    } else {
+                      c[(a + 12) >> 2] = b;
+                      c[(b + 8) >> 2] = a;
+                      break;
+                    }
+                  } else {
+                    g = c[(i + 24) >> 2] | 0;
+                    b = c[(i + 12) >> 2] | 0;
+                    do
+                      if ((b | 0) == (i | 0)) {
+                        d = (i + 16) | 0;
+                        a = (d + 4) | 0;
+                        b = c[a >> 2] | 0;
+                        if (!b) {
+                          b = c[d >> 2] | 0;
+                          if (!b) {
+                            d = 0;
+                            break;
+                          } else a = d;
+                        }
+                        while (1) {
+                          d = (b + 20) | 0;
+                          e = c[d >> 2] | 0;
+                          if (e | 0) {
+                            b = e;
+                            a = d;
+                            continue;
+                          }
+                          d = (b + 16) | 0;
+                          e = c[d >> 2] | 0;
+                          if (!e) break;
+                          else {
+                            b = e;
+                            a = d;
+                          }
+                        }
+                        c[a >> 2] = 0;
+                        d = b;
+                      } else {
+                        d = c[(i + 8) >> 2] | 0;
+                        c[(d + 12) >> 2] = b;
+                        c[(b + 8) >> 2] = d;
+                        d = b;
+                      }
+                    while (0);
+                    if (g | 0) {
+                      b = c[(i + 28) >> 2] | 0;
+                      a = (190380 + (b << 2)) | 0;
+                      if ((c[a >> 2] | 0) == (i | 0)) {
+                        c[a >> 2] = d;
+                        if (!d) {
+                          c[47520] = c[47520] & ~(1 << b);
+                          break;
+                        }
+                      } else {
+                        c[(g + 16 + ((((c[(g + 16) >> 2] | 0) != (i | 0)) & 1) << 2)) >> 2] = d;
+                        if (!d) break;
+                      }
+                      c[(d + 24) >> 2] = g;
+                      b = (i + 16) | 0;
+                      a = c[b >> 2] | 0;
+                      if (a | 0) {
+                        c[(d + 16) >> 2] = a;
+                        c[(a + 24) >> 2] = d;
+                      }
+                      b = c[(b + 4) >> 2] | 0;
+                      if (b | 0) {
+                        c[(d + 20) >> 2] = b;
+                        c[(b + 24) >> 2] = d;
+                      }
+                    }
+                  }
+                while (0);
+                c[(h + 4) >> 2] = f | 1;
+                c[(h + f) >> 2] = f;
+                if ((h | 0) == (c[47524] | 0)) {
+                  c[47521] = f;
+                  return;
+                }
+              } else {
+                c[a >> 2] = e & -2;
+                c[(h + 4) >> 2] = b | 1;
+                c[(h + b) >> 2] = b;
+                f = b;
+              }
+              b = f >>> 3;
+              if (f >>> 0 < 256) {
+                d = (190116 + ((b << 1) << 2)) | 0;
+                a = c[47519] | 0;
+                b = 1 << b;
+                if (!(a & b)) {
+                  c[47519] = a | b;
+                  b = d;
+                  a = (d + 8) | 0;
+                } else {
+                  a = (d + 8) | 0;
+                  b = c[a >> 2] | 0;
+                }
+                c[a >> 2] = h;
+                c[(b + 12) >> 2] = h;
+                c[(h + 8) >> 2] = b;
+                c[(h + 12) >> 2] = d;
+                return;
+              }
+              b = f >>> 8;
+              if (b)
+                if (f >>> 0 > 16777215) b = 31;
+                else {
+                  g = (((b + 1048320) | 0) >>> 16) & 8;
+                  i = b << g;
+                  e = (((i + 520192) | 0) >>> 16) & 4;
+                  i = i << e;
+                  b = (((i + 245760) | 0) >>> 16) & 2;
+                  b = (14 - (e | g | b) + ((i << b) >>> 15)) | 0;
+                  b = ((f >>> ((b + 7) | 0)) & 1) | (b << 1);
+                }
+              else b = 0;
+              e = (190380 + (b << 2)) | 0;
+              c[(h + 28) >> 2] = b;
+              c[(h + 20) >> 2] = 0;
+              c[(h + 16) >> 2] = 0;
+              a = c[47520] | 0;
+              d = 1 << b;
+              if (!(a & d)) {
+                c[47520] = a | d;
+                c[e >> 2] = h;
+                c[(h + 24) >> 2] = e;
+                c[(h + 12) >> 2] = h;
+                c[(h + 8) >> 2] = h;
+                return;
+              }
+              a = f << ((b | 0) == 31 ? 0 : (25 - (b >>> 1)) | 0);
+              d = c[e >> 2] | 0;
+              while (1) {
+                if (((c[(d + 4) >> 2] & -8) | 0) == (f | 0)) {
+                  b = 69;
+                  break;
+                }
+                e = (d + 16 + ((a >>> 31) << 2)) | 0;
+                b = c[e >> 2] | 0;
+                if (!b) {
+                  b = 68;
+                  break;
+                } else {
+                  a = a << 1;
+                  d = b;
+                }
+              }
+              if ((b | 0) == 68) {
+                c[e >> 2] = h;
+                c[(h + 24) >> 2] = d;
+                c[(h + 12) >> 2] = h;
+                c[(h + 8) >> 2] = h;
+                return;
+              } else if ((b | 0) == 69) {
+                g = (d + 8) | 0;
+                i = c[g >> 2] | 0;
+                c[(i + 12) >> 2] = h;
+                c[g >> 2] = h;
+                c[(h + 8) >> 2] = i;
+                c[(h + 12) >> 2] = d;
+                c[(h + 24) >> 2] = 0;
+                return;
+              }
+            }
+            function Z1(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if (a >>> 0 < 9) {
+                b = T1(b) | 0;
+                return b | 0;
+              } else {
+                b = _1(a, b) | 0;
+                return b | 0;
+              }
+              return 0;
+            }
+            function _1(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              a = a >>> 0 > 16 ? a : 16;
+              if ((a + -1) & a) {
+                d = 16;
+                while (1)
+                  if (d >>> 0 < a >>> 0) d = d << 1;
+                  else {
+                    a = d;
+                    break;
+                  }
+              }
+              if (((-64 - a) | 0) >>> 0 <= b >>> 0) {
+                c[(d2() | 0) >> 2] = 12;
+                h = 0;
+                return h | 0;
+              }
+              g = b >>> 0 < 11 ? 16 : (b + 11) & -8;
+              d = T1((g + 12 + a) | 0) | 0;
+              if (!d) {
+                h = 0;
+                return h | 0;
+              }
+              f = (d + -8) | 0;
+              do
+                if ((a + -1) & d) {
+                  e = (((d + a + -1) & (0 - a)) + -8) | 0;
+                  b = f;
+                  e = ((e - b) | 0) >>> 0 > 15 ? e : (e + a) | 0;
+                  b = (e - b) | 0;
+                  a = (d + -4) | 0;
+                  i = c[a >> 2] | 0;
+                  d = ((i & -8) - b) | 0;
+                  if (!(i & 3)) {
+                    c[e >> 2] = (c[f >> 2] | 0) + b;
+                    c[(e + 4) >> 2] = d;
+                    a = e;
+                    b = e;
+                    break;
+                  } else {
+                    i = (e + 4) | 0;
+                    c[i >> 2] = d | (c[i >> 2] & 1) | 2;
+                    d = (e + d + 4) | 0;
+                    c[d >> 2] = c[d >> 2] | 1;
+                    c[a >> 2] = b | (c[a >> 2] & 1) | 2;
+                    c[i >> 2] = c[i >> 2] | 1;
+                    Y1(f, b);
+                    a = e;
+                    b = e;
+                    break;
+                  }
+                } else {
+                  a = f;
+                  b = f;
+                }
+              while (0);
+              a = (a + 4) | 0;
+              d = c[a >> 2] | 0;
+              if ((d & 3) | 0 ? ((h = d & -8), h >>> 0 > ((g + 16) | 0) >>> 0) : 0) {
+                i = (h - g) | 0;
+                f = (b + g) | 0;
+                c[a >> 2] = g | (d & 1) | 2;
+                c[(f + 4) >> 2] = i | 3;
+                h = (b + h + 4) | 0;
+                c[h >> 2] = c[h >> 2] | 1;
+                Y1(f, i);
+              }
+              i = (b + 8) | 0;
+              return i | 0;
+            }
+            function $1(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = l;
+              l = (l + 16) | 0;
+              d = b;
+              c[d >> 2] = e2(c[(a + 60) >> 2] | 0) | 0;
+              a = c2(Ja(6, d | 0) | 0) | 0;
+              l = b;
+              return a | 0;
+            }
+            function a2(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              k = l;
+              l = (l + 32) | 0;
+              f = k;
+              i = (k + 16) | 0;
+              c[i >> 2] = d;
+              g = (i + 4) | 0;
+              j = (b + 48) | 0;
+              m = c[j >> 2] | 0;
+              c[g >> 2] = e - (((m | 0) != 0) & 1);
+              h = (b + 44) | 0;
+              c[(i + 8) >> 2] = c[h >> 2];
+              c[(i + 12) >> 2] = m;
+              c[f >> 2] = c[(b + 60) >> 2];
+              c[(f + 4) >> 2] = i;
+              c[(f + 8) >> 2] = 2;
+              f = c2(ya(145, f | 0) | 0) | 0;
+              if ((f | 0) >= 1) {
+                i = c[g >> 2] | 0;
+                if (f >>> 0 > i >>> 0) {
+                  g = c[h >> 2] | 0;
+                  h = (b + 4) | 0;
+                  c[h >> 2] = g;
+                  c[(b + 8) >> 2] = g + (f - i);
+                  if (!(c[j >> 2] | 0)) f = e;
+                  else {
+                    c[h >> 2] = g + 1;
+                    a[(d + (e + -1)) >> 0] = a[g >> 0] | 0;
+                    f = e;
+                  }
+                }
+              } else c[b >> 2] = c[b >> 2] | ((f & 48) ^ 16);
+              l = k;
+              return f | 0;
+            }
+            function b2(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              f = l;
+              l = (l + 32) | 0;
+              g = f;
+              e = (f + 20) | 0;
+              c[g >> 2] = c[(a + 60) >> 2];
+              c[(g + 4) >> 2] = 0;
+              c[(g + 8) >> 2] = b;
+              c[(g + 12) >> 2] = e;
+              c[(g + 16) >> 2] = d;
+              if ((c2(xa(140, g | 0) | 0) | 0) < 0) {
+                c[e >> 2] = -1;
+                a = -1;
+              } else a = c[e >> 2] | 0;
+              l = f;
+              return a | 0;
+            }
+            function c2(a) {
+              a = a | 0;
+              if (a >>> 0 > 4294963200) {
+                c[(d2() | 0) >> 2] = 0 - a;
+                a = -1;
+              }
+              return a | 0;
+            }
+            function d2() {
+              return 190572;
+            }
+            function e2(a) {
+              a = a | 0;
+              return a | 0;
+            }
+            function f2(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              g = l;
+              l = (l + 32) | 0;
+              f = g;
+              c[(b + 36) >> 2] = 18;
+              if (
+                ((c[b >> 2] & 64) | 0) == 0
+                  ? ((c[f >> 2] = c[(b + 60) >> 2]),
+                    (c[(f + 4) >> 2] = 21523),
+                    (c[(f + 8) >> 2] = g + 16),
+                    Ia(54, f | 0) | 0)
+                  : 0
+              )
+                a[(b + 75) >> 0] = -1;
+              f = g2(b, d, e) | 0;
+              l = g;
+              return f | 0;
+            }
+            function g2(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              n = l;
+              l = (l + 48) | 0;
+              k = (n + 16) | 0;
+              g = n;
+              f = (n + 32) | 0;
+              i = (a + 28) | 0;
+              e = c[i >> 2] | 0;
+              c[f >> 2] = e;
+              j = (a + 20) | 0;
+              e = ((c[j >> 2] | 0) - e) | 0;
+              c[(f + 4) >> 2] = e;
+              c[(f + 8) >> 2] = b;
+              c[(f + 12) >> 2] = d;
+              e = (e + d) | 0;
+              h = (a + 60) | 0;
+              c[g >> 2] = c[h >> 2];
+              c[(g + 4) >> 2] = f;
+              c[(g + 8) >> 2] = 2;
+              g = c2(za(146, g | 0) | 0) | 0;
+              a: do
+                if ((e | 0) != (g | 0)) {
+                  b = 2;
+                  while (1) {
+                    if ((g | 0) < 0) break;
+                    e = (e - g) | 0;
+                    p = c[(f + 4) >> 2] | 0;
+                    o = g >>> 0 > p >>> 0;
+                    f = o ? (f + 8) | 0 : f;
+                    b = (b + ((o << 31) >> 31)) | 0;
+                    p = (g - (o ? p : 0)) | 0;
+                    c[f >> 2] = (c[f >> 2] | 0) + p;
+                    o = (f + 4) | 0;
+                    c[o >> 2] = (c[o >> 2] | 0) - p;
+                    c[k >> 2] = c[h >> 2];
+                    c[(k + 4) >> 2] = f;
+                    c[(k + 8) >> 2] = b;
+                    g = c2(za(146, k | 0) | 0) | 0;
+                    if ((e | 0) == (g | 0)) {
+                      m = 3;
+                      break a;
+                    }
+                  }
+                  c[(a + 16) >> 2] = 0;
+                  c[i >> 2] = 0;
+                  c[j >> 2] = 0;
+                  c[a >> 2] = c[a >> 2] | 32;
+                  if ((b | 0) == 2) d = 0;
+                  else d = (d - (c[(f + 4) >> 2] | 0)) | 0;
+                } else m = 3;
+              while (0);
+              if ((m | 0) == 3) {
+                p = c[(a + 44) >> 2] | 0;
+                c[(a + 16) >> 2] = p + (c[(a + 48) >> 2] | 0);
+                c[i >> 2] = p;
+                c[j >> 2] = p;
+              }
+              l = n;
+              return d | 0;
+            }
+            function h2(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = l;
+              l = (l + 16) | 0;
+              e = d;
+              c[e >> 2] = a;
+              c[(e + 4) >> 2] = b;
+              b = c2(Ka(91, e | 0) | 0) | 0;
+              l = d;
+              return b | 0;
+            }
+            function i2() {
+              return;
+            }
+            function j2(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0;
+              i = l;
+              l = (l + 32) | 0;
+              h = i;
+              do
+                if ((((g & 4095) | 0) == 0) & (((((((g | 0) < 0) << 31) >> 31) & -4096) | 0) == 0)) {
+                  if (b >>> 0 > 2147483646) {
+                    c[(d2() | 0) >> 2] = 12;
+                    a = -1;
+                    break;
+                  }
+                  c[h >> 2] = a;
+                  c[(h + 4) >> 2] = b;
+                  c[(h + 8) >> 2] = d;
+                  c[(h + 12) >> 2] = e;
+                  c[(h + 16) >> 2] = f;
+                  c[(h + 20) >> 2] = g >> 12;
+                  a = c2(Aa(192, h | 0) | 0) | 0;
+                } else {
+                  c[(d2() | 0) >> 2] = 22;
+                  a = -1;
+                }
+              while (0);
+              l = i;
+              return a | 0;
+            }
+            function k2(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              f = d & 255;
+              a: do
+                if (!f) b = (b + (l2(b) | 0)) | 0;
+                else {
+                  if (b & 3) {
+                    e = d & 255;
+                    do {
+                      g = a[b >> 0] | 0;
+                      if ((g << 24) >> 24 == 0 ? 1 : (g << 24) >> 24 == (e << 24) >> 24) break a;
+                      b = (b + 1) | 0;
+                    } while (((b & 3) | 0) != 0);
+                  }
+                  f = O(f, 16843009) | 0;
+                  e = c[b >> 2] | 0;
+                  b: do
+                    if (!(((e & -2139062144) ^ -2139062144) & (e + -16843009)))
+                      do {
+                        g = e ^ f;
+                        if ((((g & -2139062144) ^ -2139062144) & (g + -16843009)) | 0) break b;
+                        b = (b + 4) | 0;
+                        e = c[b >> 2] | 0;
+                      } while (!((((e & -2139062144) ^ -2139062144) & (e + -16843009)) | 0));
+                  while (0);
+                  e = d & 255;
+                  while (1) {
+                    g = a[b >> 0] | 0;
+                    if ((g << 24) >> 24 == 0 ? 1 : (g << 24) >> 24 == (e << 24) >> 24) break;
+                    else b = (b + 1) | 0;
+                  }
+                }
+              while (0);
+              return b | 0;
+            }
+            function l2(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              f = b;
+              a: do
+                if (!(f & 3)) e = 4;
+                else {
+                  d = f;
+                  while (1) {
+                    if (!(a[b >> 0] | 0)) {
+                      b = d;
+                      break a;
+                    }
+                    b = (b + 1) | 0;
+                    d = b;
+                    if (!(d & 3)) {
+                      e = 4;
+                      break;
+                    }
+                  }
+                }
+              while (0);
+              if ((e | 0) == 4) {
+                while (1) {
+                  d = c[b >> 2] | 0;
+                  if (!(((d & -2139062144) ^ -2139062144) & (d + -16843009))) b = (b + 4) | 0;
+                  else break;
+                }
+                if (((d & 255) << 24) >> 24)
+                  do b = (b + 1) | 0;
+                  while ((a[b >> 0] | 0) != 0);
+              }
+              return (b - f) | 0;
+            }
+            function m2(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              h = l;
+              l = (l + 48) | 0;
+              g = (h + 16) | 0;
+              f = h;
+              e = (h + 32) | 0;
+              if (!(b & 4194368)) e = 0;
+              else {
+                c[e >> 2] = d;
+                i = ((c[e >> 2] | 0) + (4 - 1)) & ~(4 - 1);
+                d = c[i >> 2] | 0;
+                c[e >> 2] = i + 4;
+                e = d;
+              }
+              c[f >> 2] = a;
+              c[(f + 4) >> 2] = b | 32768;
+              c[(f + 8) >> 2] = e;
+              e = Ha(5, f | 0) | 0;
+              if (!((((b & 524288) | 0) == 0) | ((e | 0) < 0))) {
+                c[g >> 2] = e;
+                c[(g + 4) >> 2] = 2;
+                c[(g + 8) >> 2] = 1;
+                Ea(221, g | 0) | 0;
+              }
+              i = c2(e) | 0;
+              l = h;
+              return i | 0;
+            }
+            function n2(b, e) {
+              b = b | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              g = 0;
+              while (1) {
+                if ((d[(144531 + g) >> 0] | 0) == (b | 0)) {
+                  b = 2;
+                  break;
+                }
+                f = (g + 1) | 0;
+                if ((f | 0) == 87) {
+                  f = 144619;
+                  g = 87;
+                  b = 5;
+                  break;
+                } else g = f;
+              }
+              if ((b | 0) == 2)
+                if (!g) f = 144619;
+                else {
+                  f = 144619;
+                  b = 5;
+                }
+              if ((b | 0) == 5)
+                while (1) {
+                  do {
+                    b = f;
+                    f = (f + 1) | 0;
+                  } while ((a[b >> 0] | 0) != 0);
+                  g = (g + -1) | 0;
+                  if (!g) break;
+                  else b = 5;
+                }
+              return o2(f, c[(e + 20) >> 2] | 0) | 0;
+            }
+            function o2(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return p2(a, b) | 0;
+            }
+            function p2(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if (!b) b = 0;
+              else b = q2(c[b >> 2] | 0, c[(b + 4) >> 2] | 0, a) | 0;
+              return (b | 0 ? b : a) | 0;
+            }
+            function q2(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              o = ((c[b >> 2] | 0) + 1794895138) | 0;
+              h = r2(c[(b + 8) >> 2] | 0, o) | 0;
+              f = r2(c[(b + 12) >> 2] | 0, o) | 0;
+              g = r2(c[(b + 16) >> 2] | 0, o) | 0;
+              a: do
+                if (
+                  (
+                    h >>> 0 < (d >>> 2) >>> 0
+                      ? ((n = (d - (h << 2)) | 0), (f >>> 0 < n >>> 0) & (g >>> 0 < n >>> 0))
+                      : 0
+                  )
+                    ? (((g | f) & 3) | 0) == 0
+                    : 0
+                ) {
+                  n = f >>> 2;
+                  m = g >>> 2;
+                  l = 0;
+                  while (1) {
+                    j = h >>> 1;
+                    k = (l + j) | 0;
+                    i = k << 1;
+                    g = (i + n) | 0;
+                    f = r2(c[(b + (g << 2)) >> 2] | 0, o) | 0;
+                    g = r2(c[(b + ((g + 1) << 2)) >> 2] | 0, o) | 0;
+                    if (!((g >>> 0 < d >>> 0) & (f >>> 0 < ((d - g) | 0) >>> 0))) {
+                      f = 0;
+                      break a;
+                    }
+                    if (a[(b + (g + f)) >> 0] | 0) {
+                      f = 0;
+                      break a;
+                    }
+                    f = s2(e, (b + g) | 0) | 0;
+                    if (!f) break;
+                    f = (f | 0) < 0;
+                    if ((h | 0) == 1) {
+                      f = 0;
+                      break a;
+                    } else {
+                      l = f ? l : k;
+                      h = f ? j : (h - j) | 0;
+                    }
+                  }
+                  f = (i + m) | 0;
+                  g = r2(c[(b + (f << 2)) >> 2] | 0, o) | 0;
+                  f = r2(c[(b + ((f + 1) << 2)) >> 2] | 0, o) | 0;
+                  if ((f >>> 0 < d >>> 0) & (g >>> 0 < ((d - f) | 0) >>> 0))
+                    f = (a[(b + (f + g)) >> 0] | 0) == 0 ? (b + f) | 0 : 0;
+                  else f = 0;
+                } else f = 0;
+              while (0);
+              return f | 0;
+            }
+            function r2(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0;
+              c = T6(a | 0) | 0;
+              return ((b | 0) == 0 ? a : c) | 0;
+            }
+            function s2(b, c) {
+              b = b | 0;
+              c = c | 0;
+              var d = 0,
+                e = 0;
+              d = a[b >> 0] | 0;
+              e = a[c >> 0] | 0;
+              if ((d << 24) >> 24 == 0 ? 1 : (d << 24) >> 24 != (e << 24) >> 24) b = e;
+              else {
+                do {
+                  b = (b + 1) | 0;
+                  c = (c + 1) | 0;
+                  d = a[b >> 0] | 0;
+                  e = a[c >> 0] | 0;
+                } while (!((d << 24) >> 24 == 0 ? 1 : (d << 24) >> 24 != (e << 24) >> 24));
+                b = e;
+              }
+              return ((d & 255) - (b & 255)) | 0;
+            }
+            function t2(a) {
+              a = a | 0;
+              return n2(a, c[((u2() | 0) + 188) >> 2] | 0) | 0;
+            }
+            function u2() {
+              return v2() | 0;
+            }
+            function v2() {
+              return 62976;
+            }
+            function w2(a, b, c) {
+              a = +a;
+              b = +b;
+              c = c | 0;
+              var d = 0.0,
+                e = 0.0,
+                f = 0.0;
+              f = a * a;
+              d =
+                f * (f * f) * (f * 1.58969099521155e-10 + -2.5050760253406863e-8) +
+                (f * (f * 2.7557313707070068e-6 + -1.984126982985795e-4) + 0.00833333333332249);
+              e = f * a;
+              if (!c) a = e * (f * d + -0.16666666666666632) + a;
+              else a = a - (e * 0.16666666666666632 + (f * (b * 0.5 - e * d) - b));
+              return +a;
+            }
+            function x2(a) {
+              a = +a;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0.0,
+                k = 0.0,
+                l = 0.0,
+                m = 0.0;
+              h[j >> 3] = a;
+              b = c[j >> 2] | 0;
+              d = c[(j + 4) >> 2] | 0;
+              e = (d | 0) < 0;
+              do
+                if (e | (d >>> 0 < 1048576)) {
+                  if (((b | 0) == 0) & (((d & 2147483647) | 0) == 0)) {
+                    a = -1.0 / (a * a);
+                    break;
+                  }
+                  if (e) {
+                    a = (a - a) / 0.0;
+                    break;
+                  } else {
+                    h[j >> 3] = a * 18014398509481984.0;
+                    d = c[(j + 4) >> 2] | 0;
+                    e = -1077;
+                    b = c[j >> 2] | 0;
+                    f = 9;
+                    break;
+                  }
+                } else if (d >>> 0 <= 2146435071)
+                  if (((b | 0) == 0) & (0 == 0) & ((d | 0) == 1072693248)) a = 0.0;
+                  else {
+                    e = -1023;
+                    f = 9;
+                  }
+              while (0);
+              if ((f | 0) == 9) {
+                f = (d + 614242) | 0;
+                c[j >> 2] = b;
+                c[(j + 4) >> 2] = (f & 1048575) + 1072079006;
+                m = +h[j >> 3] + -1.0;
+                k = m * (m * 0.5);
+                i = m / (m + 2.0);
+                l = i * i;
+                g = l * l;
+                h[j >> 3] = m - k;
+                d = c[(j + 4) >> 2] | 0;
+                c[j >> 2] = 0;
+                c[(j + 4) >> 2] = d;
+                a = +h[j >> 3];
+                g =
+                  m -
+                  a -
+                  k +
+                  i *
+                    (k +
+                      (g * (g * (g * 0.15313837699209373 + 0.22222198432149784) + 0.3999999999940942) +
+                        l *
+                          (g * (g * (g * 0.14798198605116586 + 0.1818357216161805) + 0.2857142874366239) +
+                            0.6666666666666735)));
+                l = a * 1.4426950407214463;
+                k = +((e + (f >>> 20)) | 0);
+                i = l + k;
+                a = i + (l + (k - i) + (g * 1.4426950407214463 + (g + a) * 1.6751713164886512e-10));
+              }
+              return +a;
+            }
+            function y2(a, b) {
+              a = +a;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              h[j >> 3] = a;
+              d = c[j >> 2] | 0;
+              e = c[(j + 4) >> 2] | 0;
+              f = Q6(d | 0, e | 0, 52) | 0;
+              switch (f & 2047) {
+                case 0: {
+                  if (a != 0.0) {
+                    a = +y2(a * 18446744073709551616.0, b);
+                    d = ((c[b >> 2] | 0) + -64) | 0;
+                  } else d = 0;
+                  c[b >> 2] = d;
+                  break;
+                }
+                case 2047:
+                  break;
+                default: {
+                  c[b >> 2] = (f & 2047) + -1022;
+                  c[j >> 2] = d;
+                  c[(j + 4) >> 2] = (e & -2146435073) | 1071644672;
+                  a = +h[j >> 3];
+                }
+              }
+              return +a;
+            }
+            function z2(a, b) {
+              a = +a;
+              b = +b;
+              var c = 0.0,
+                d = 0.0,
+                e = 0.0,
+                f = 0.0;
+              c = a * a;
+              d = c * c;
+              e = c * 0.5;
+              f = 1.0 - e;
+              return +(
+                f +
+                (1.0 -
+                  f -
+                  e +
+                  (c *
+                    (c * (c * (c * 2.480158728947673e-5 + -0.001388888888887411) + 0.0416666666666666) +
+                      d * d * (c * (2.087572321298175e-9 - c * 1.1359647557788195e-11) + -2.7557314351390663e-7)) -
+                    a * b))
+              );
+            }
+            function A2(a) {
+              a = +a;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0.0,
+                i = 0.0,
+                k = 0.0,
+                l = 0.0,
+                m = 0.0;
+              h[j >> 3] = a;
+              b = c[j >> 2] | 0;
+              d = c[(j + 4) >> 2] | 0;
+              e = (d | 0) < 0;
+              do
+                if (e | (d >>> 0 < 1048576)) {
+                  if (((b | 0) == 0) & (((d & 2147483647) | 0) == 0)) {
+                    a = -1.0 / (a * a);
+                    break;
+                  }
+                  if (e) {
+                    a = (a - a) / 0.0;
+                    break;
+                  } else {
+                    h[j >> 3] = a * 18014398509481984.0;
+                    d = c[(j + 4) >> 2] | 0;
+                    e = -1077;
+                    b = c[j >> 2] | 0;
+                    f = 9;
+                    break;
+                  }
+                } else if (d >>> 0 <= 2146435071)
+                  if (((b | 0) == 0) & (0 == 0) & ((d | 0) == 1072693248)) a = 0.0;
+                  else {
+                    e = -1023;
+                    f = 9;
+                  }
+              while (0);
+              if ((f | 0) == 9) {
+                f = (d + 614242) | 0;
+                c[j >> 2] = b;
+                c[(j + 4) >> 2] = (f & 1048575) + 1072079006;
+                k = +h[j >> 3] + -1.0;
+                i = k * (k * 0.5);
+                l = k / (k + 2.0);
+                m = l * l;
+                g = m * m;
+                h[j >> 3] = k - i;
+                d = c[(j + 4) >> 2] | 0;
+                c[j >> 2] = 0;
+                c[(j + 4) >> 2] = d;
+                a = +h[j >> 3];
+                g =
+                  k -
+                  a -
+                  i +
+                  l *
+                    (i +
+                      (g * (g * (g * 0.15313837699209373 + 0.22222198432149784) + 0.3999999999940942) +
+                        m *
+                          (g * (g * (g * 0.14798198605116586 + 0.1818357216161805) + 0.2857142874366239) +
+                            0.6666666666666735)));
+                m = a * 0.4342944818781689;
+                i = +((e + (f >>> 20)) | 0);
+                l = i * 0.30102999566361177;
+                k = l + m;
+                a =
+                  k +
+                  (m +
+                    (l - k) +
+                    (g * 0.4342944818781689 + (i * 3.694239077158931e-13 + (g + a) * 2.5082946711645275e-11)));
+              }
+              return +a;
+            }
+            function B2(a, b) {
+              a = +a;
+              b = b | 0;
+              var d = 0,
+                e = 0.0,
+                f = 0.0,
+                g = 0.0,
+                i = 0,
+                k = 0.0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0.0;
+              r = l;
+              l = (l + 48) | 0;
+              m = (r + 16) | 0;
+              n = r;
+              h[j >> 3] = a;
+              d = c[j >> 2] | 0;
+              i = c[(j + 4) >> 2] | 0;
+              o = Q6(d | 0, i | 0, 63) | 0;
+              q = i & 2147483647;
+              do
+                if (q >>> 0 < 1074752123)
+                  if (((i & 1048575) | 0) != 598523) {
+                    d = (o | 0) != 0;
+                    if (q >>> 0 < 1073928573)
+                      if (d) {
+                        g = a + 1.5707963267341256;
+                        k = g + 6.077100506506192e-11;
+                        h[b >> 3] = k;
+                        h[(b + 8) >> 3] = g - k + 6.077100506506192e-11;
+                        d = -1;
+                        break;
+                      } else {
+                        g = a + -1.5707963267341256;
+                        k = g + -6.077100506506192e-11;
+                        h[b >> 3] = k;
+                        h[(b + 8) >> 3] = g - k + -6.077100506506192e-11;
+                        d = 1;
+                        break;
+                      }
+                    else if (d) {
+                      g = a + 3.1415926534682512;
+                      k = g + 1.2154201013012384e-10;
+                      h[b >> 3] = k;
+                      h[(b + 8) >> 3] = g - k + 1.2154201013012384e-10;
+                      d = -2;
+                      break;
+                    } else {
+                      g = a + -3.1415926534682512;
+                      k = g + -1.2154201013012384e-10;
+                      h[b >> 3] = k;
+                      h[(b + 8) >> 3] = g - k + -1.2154201013012384e-10;
+                      d = 2;
+                      break;
+                    }
+                  } else p = 21;
+                else {
+                  if (q >>> 0 < 1075594812)
+                    if (q >>> 0 < 1075183037) {
+                      if ((q | 0) == 1074977148) {
+                        p = 21;
+                        break;
+                      }
+                      if (!o) {
+                        g = a + -4.712388980202377;
+                        k = g + -1.8231301519518578e-10;
+                        h[b >> 3] = k;
+                        h[(b + 8) >> 3] = g - k + -1.8231301519518578e-10;
+                        d = 3;
+                        break;
+                      } else {
+                        g = a + 4.712388980202377;
+                        k = g + 1.8231301519518578e-10;
+                        h[b >> 3] = k;
+                        h[(b + 8) >> 3] = g - k + 1.8231301519518578e-10;
+                        d = -3;
+                        break;
+                      }
+                    } else {
+                      if ((q | 0) == 1075388923) {
+                        p = 21;
+                        break;
+                      }
+                      if (!o) {
+                        g = a + -6.2831853069365025;
+                        k = g + -2.430840202602477e-10;
+                        h[b >> 3] = k;
+                        h[(b + 8) >> 3] = g - k + -2.430840202602477e-10;
+                        d = 4;
+                        break;
+                      } else {
+                        g = a + 6.2831853069365025;
+                        k = g + 2.430840202602477e-10;
+                        h[b >> 3] = k;
+                        h[(b + 8) >> 3] = g - k + 2.430840202602477e-10;
+                        d = -4;
+                        break;
+                      }
+                    }
+                  if (q >>> 0 >= 1094263291) {
+                    if (q >>> 0 > 2146435071) {
+                      k = a - a;
+                      h[(b + 8) >> 3] = k;
+                      h[b >> 3] = k;
+                      d = 0;
+                      break;
+                    }
+                    c[j >> 2] = d;
+                    c[(j + 4) >> 2] = (i & 1048575) | 1096810496;
+                    a = +h[j >> 3];
+                    d = 0;
+                    do {
+                      k = +(~~a | 0);
+                      h[(m + (d << 3)) >> 3] = k;
+                      a = (a - k) * 16777216.0;
+                      d = (d + 1) | 0;
+                    } while ((d | 0) != 2);
+                    h[(m + 16) >> 3] = a;
+                    if (a == 0.0) {
+                      d = 1;
+                      while (1)
+                        if (+h[(m + (d << 3)) >> 3] == 0.0) d = (d + -1) | 0;
+                        else break;
+                    } else d = 2;
+                    d = C2(m, n, ((q >>> 20) + -1046) | 0, (d + 1) | 0, 1) | 0;
+                    a = +h[n >> 3];
+                    if (!o) {
+                      h[b >> 3] = a;
+                      h[(b + 8) >> 3] = +h[(n + 8) >> 3];
+                      break;
+                    } else {
+                      h[b >> 3] = -a;
+                      h[(b + 8) >> 3] = -+h[(n + 8) >> 3];
+                      d = (0 - d) | 0;
+                      break;
+                    }
+                  } else p = 21;
+                }
+              while (0);
+              if ((p | 0) == 21) {
+                g = a * 0.6366197723675814 + 6755399441055744.0 + -6755399441055744.0;
+                d = ~~g;
+                e = a - g * 1.5707963267341256;
+                f = g * 6.077100506506192e-11;
+                a = e - f;
+                h[b >> 3] = a;
+                h[j >> 3] = a;
+                p = Q6(c[j >> 2] | 0, c[(j + 4) >> 2] | 0, 52) | 0;
+                i = q >>> 20;
+                if (((i - (p & 2047)) | 0) > 16) {
+                  f = g * 6.077100506303966e-11;
+                  k = e - f;
+                  f = g * 2.0222662487959506e-21 - (e - k - f);
+                  a = k - f;
+                  h[b >> 3] = a;
+                  h[j >> 3] = a;
+                  q = Q6(c[j >> 2] | 0, c[(j + 4) >> 2] | 0, 52) | 0;
+                  s = g * 2.0222662487111665e-21;
+                  e = k - s;
+                  g = g * 8.4784276603689e-32 - (k - e - s);
+                  if (((i - (q & 2047)) | 0) > 49) {
+                    a = e - g;
+                    h[b >> 3] = a;
+                    f = g;
+                  } else e = k;
+                }
+                h[(b + 8) >> 3] = e - a - f;
+              }
+              l = r;
+              return d | 0;
+            }
+            function C2(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0.0,
+                i = 0.0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0.0;
+              H = l;
+              l = (l + 560) | 0;
+              C = (H + 480) | 0;
+              z = (H + 320) | 0;
+              G = (H + 160) | 0;
+              E = H;
+              D = c[(63220 + (f << 2)) >> 2] | 0;
+              p = (e + -1) | 0;
+              y = (((d + -3) | 0) / 24) | 0;
+              y = (y | 0) > 0 ? y : 0;
+              B = O(y, -24) | 0;
+              j = (d + -24 + B) | 0;
+              if (((D + p) | 0) >= 0) {
+                n = (D + e) | 0;
+                k = (y - p) | 0;
+                m = 0;
+                while (1) {
+                  if ((k | 0) < 0) g = 0.0;
+                  else g = +(c[(63236 + (k << 2)) >> 2] | 0);
+                  h[(z + (m << 3)) >> 3] = g;
+                  m = (m + 1) | 0;
+                  if ((m | 0) == (n | 0)) break;
+                  else k = (k + 1) | 0;
+                }
+              }
+              o = (e | 0) > 0;
+              n = 0;
+              while (1) {
+                if (o) {
+                  m = (n + p) | 0;
+                  g = 0.0;
+                  k = 0;
+                  do {
+                    g = g + +h[(a + (k << 3)) >> 3] * +h[(z + ((m - k) << 3)) >> 3];
+                    k = (k + 1) | 0;
+                  } while ((k | 0) != (e | 0));
+                } else g = 0.0;
+                h[(E + (n << 3)) >> 3] = g;
+                if ((n | 0) < (D | 0)) n = (n + 1) | 0;
+                else break;
+              }
+              t = (j | 0) > 0;
+              u = (24 - j) | 0;
+              v = (23 - j) | 0;
+              w = (e | 0) > 0;
+              x = (j | 0) == 0;
+              k = D;
+              a: while (1) {
+                g = +h[(E + (k << 3)) >> 3];
+                o = (k | 0) > 0;
+                if (o) {
+                  m = k;
+                  n = 0;
+                  while (1) {
+                    i = +(~~(g * 5.9604644775390625e-8) | 0);
+                    c[(C + (n << 2)) >> 2] = ~~(g - i * 16777216.0);
+                    s = m;
+                    m = (m + -1) | 0;
+                    g = +h[(E + (m << 3)) >> 3] + i;
+                    if ((s | 0) <= 1) break;
+                    else n = (n + 1) | 0;
+                  }
+                }
+                g = +D2(g, j);
+                g = g - +A(+(g * 0.125)) * 8.0;
+                m = ~~g;
+                g = g - +(m | 0);
+                do
+                  if (!t)
+                    if (!x)
+                      if (!(g >= 0.5)) {
+                        p = 0;
+                        s = m;
+                        break;
+                      } else {
+                        n = 2;
+                        F = 20;
+                        break;
+                      }
+                    else {
+                      n = c[(C + ((k + -1) << 2)) >> 2] >> 23;
+                      F = 19;
+                      break;
+                    }
+                  else {
+                    s = (C + ((k + -1) << 2)) | 0;
+                    n = c[s >> 2] | 0;
+                    F = n >> u;
+                    n = (n - (F << u)) | 0;
+                    c[s >> 2] = n;
+                    n = n >> v;
+                    m = (F + m) | 0;
+                    F = 19;
+                  }
+                while (0);
+                if ((F | 0) == 19) {
+                  F = 0;
+                  if ((n | 0) > 0) F = 20;
+                  else {
+                    p = n;
+                    s = m;
+                  }
+                }
+                if ((F | 0) == 20) {
+                  F = 0;
+                  s = (m + 1) | 0;
+                  if (o) {
+                    m = 0;
+                    r = 0;
+                    do {
+                      p = (C + (r << 2)) | 0;
+                      q = c[p >> 2] | 0;
+                      if (!m)
+                        if (!q) m = 0;
+                        else {
+                          m = 1;
+                          o = 16777216;
+                          F = 23;
+                        }
+                      else {
+                        o = 16777215;
+                        F = 23;
+                      }
+                      if ((F | 0) == 23) {
+                        F = 0;
+                        c[p >> 2] = o - q;
+                      }
+                      r = (r + 1) | 0;
+                    } while ((r | 0) != (k | 0));
+                  } else m = 0;
+                  b: do
+                    if (t) {
+                      switch (j | 0) {
+                        case 1: {
+                          o = 8388607;
+                          break;
+                        }
+                        case 2: {
+                          o = 4194303;
+                          break;
+                        }
+                        default:
+                          break b;
+                      }
+                      r = (C + ((k + -1) << 2)) | 0;
+                      c[r >> 2] = c[r >> 2] & o;
+                    }
+                  while (0);
+                  if ((n | 0) == 2) {
+                    g = 1.0 - g;
+                    if (!m) p = 2;
+                    else {
+                      p = 2;
+                      g = g - +D2(1.0, j);
+                    }
+                  } else p = n;
+                }
+                if (!(g == 0.0)) {
+                  F = 42;
+                  break;
+                }
+                if ((k | 0) > (D | 0)) {
+                  m = 0;
+                  n = k;
+                  do {
+                    n = (n + -1) | 0;
+                    m = c[(C + (n << 2)) >> 2] | m;
+                  } while ((n | 0) > (D | 0));
+                  if (m) {
+                    F = 41;
+                    break;
+                  } else m = 1;
+                } else m = 1;
+                while (1)
+                  if (!(c[(C + ((D - m) << 2)) >> 2] | 0)) m = (m + 1) | 0;
+                  else break;
+                o = (m + k) | 0;
+                if ((m | 0) <= 0) {
+                  k = o;
+                  continue;
+                }
+                while (1) {
+                  n = (k + 1) | 0;
+                  m = (k + e) | 0;
+                  h[(z + (m << 3)) >> 3] = +(c[(63236 + ((n + y) << 2)) >> 2] | 0);
+                  if (w) {
+                    g = 0.0;
+                    k = 0;
+                    do {
+                      g = g + +h[(a + (k << 3)) >> 3] * +h[(z + ((m - k) << 3)) >> 3];
+                      k = (k + 1) | 0;
+                    } while ((k | 0) != (e | 0));
+                  } else g = 0.0;
+                  h[(E + (n << 3)) >> 3] = g;
+                  if ((n | 0) < (o | 0)) k = n;
+                  else {
+                    k = o;
+                    continue a;
+                  }
+                }
+              }
+              if ((F | 0) == 41)
+                while (1) {
+                  F = 0;
+                  j = (j + -24) | 0;
+                  k = (k + -1) | 0;
+                  if (!(c[(C + (k << 2)) >> 2] | 0)) F = 41;
+                  else {
+                    o = k;
+                    break;
+                  }
+                }
+              else if ((F | 0) == 42) {
+                g = +D2(g, (0 - j) | 0);
+                if (g >= 16777216.0) {
+                  i = +(~~(g * 5.9604644775390625e-8) | 0);
+                  c[(C + (k << 2)) >> 2] = ~~(g - i * 16777216.0);
+                  j = (B + d) | 0;
+                  k = (k + 1) | 0;
+                  g = i;
+                }
+                c[(C + (k << 2)) >> 2] = ~~g;
+                o = k;
+              }
+              n = (o | 0) > -1;
+              if (n) {
+                g = +D2(1.0, j);
+                j = o;
+                while (1) {
+                  h[(E + (j << 3)) >> 3] = g * +(c[(C + (j << 2)) >> 2] | 0);
+                  if ((j | 0) > 0) {
+                    g = g * 5.9604644775390625e-8;
+                    j = (j + -1) | 0;
+                  } else break;
+                }
+                if (n) {
+                  k = o;
+                  while (1) {
+                    m = (o - k) | 0;
+                    j = 0;
+                    g = 0.0;
+                    while (1) {
+                      g = g + +h[(10904 + (j << 3)) >> 3] * +h[(E + ((j + k) << 3)) >> 3];
+                      if (((j | 0) >= (D | 0)) | ((j | 0) >= (m | 0))) break;
+                      else j = (j + 1) | 0;
+                    }
+                    h[(G + (m << 3)) >> 3] = g;
+                    if ((k | 0) > 0) k = (k + -1) | 0;
+                    else break;
+                  }
+                }
+              }
+              switch (f | 0) {
+                case 0: {
+                  if (n) {
+                    g = 0.0;
+                    j = o;
+                    while (1) {
+                      g = g + +h[(G + (j << 3)) >> 3];
+                      if ((j | 0) > 0) j = (j + -1) | 0;
+                      else break;
+                    }
+                  } else g = 0.0;
+                  i = (p | 0) == 0 ? g : -g;
+                  F = 73;
+                  break;
+                }
+                case 2:
+                case 1: {
+                  if (n) {
+                    g = 0.0;
+                    j = o;
+                    while (1) {
+                      g = g + +h[(G + (j << 3)) >> 3];
+                      if ((j | 0) > 0) j = (j + -1) | 0;
+                      else break;
+                    }
+                  } else g = 0.0;
+                  k = (p | 0) == 0;
+                  h[b >> 3] = k ? g : -g;
+                  g = +h[G >> 3] - g;
+                  if ((o | 0) >= 1) {
+                    j = 1;
+                    while (1) {
+                      g = g + +h[(G + (j << 3)) >> 3];
+                      if ((j | 0) == (o | 0)) break;
+                      else j = (j + 1) | 0;
+                    }
+                  }
+                  i = k ? g : -g;
+                  b = (b + 8) | 0;
+                  F = 73;
+                  break;
+                }
+                case 3: {
+                  if ((o | 0) > 0) {
+                    j = o;
+                    g = +h[(G + (o << 3)) >> 3];
+                    do {
+                      F = j;
+                      j = (j + -1) | 0;
+                      E = (G + (j << 3)) | 0;
+                      i = +h[E >> 3];
+                      I = g;
+                      g = i + g;
+                      h[(G + (F << 3)) >> 3] = I + (i - g);
+                      h[E >> 3] = g;
+                    } while ((F | 0) > 1);
+                    k = (o | 0) > 1;
+                    if (k) {
+                      j = o;
+                      g = +h[(G + (o << 3)) >> 3];
+                      do {
+                        F = j;
+                        j = (j + -1) | 0;
+                        E = (G + (j << 3)) | 0;
+                        I = +h[E >> 3];
+                        i = g;
+                        g = I + g;
+                        h[(G + (F << 3)) >> 3] = i + (I - g);
+                        h[E >> 3] = g;
+                      } while ((F | 0) > 2);
+                      if (k) {
+                        j = o;
+                        i = 0.0;
+                        while (1) {
+                          i = i + +h[(G + (j << 3)) >> 3];
+                          if ((j | 0) > 2) j = (j + -1) | 0;
+                          else break;
+                        }
+                      } else i = 0.0;
+                    } else i = 0.0;
+                  } else i = 0.0;
+                  g = +h[G >> 3];
+                  if (!p) {
+                    h[b >> 3] = g;
+                    g = +h[(G + 8) >> 3];
+                  } else {
+                    h[b >> 3] = -g;
+                    i = -i;
+                    g = -+h[(G + 8) >> 3];
+                  }
+                  h[(b + 8) >> 3] = g;
+                  b = (b + 16) | 0;
+                  F = 73;
+                  break;
+                }
+                default: {
+                }
+              }
+              if ((F | 0) == 73) h[b >> 3] = i;
+              l = H;
+              return (s & 7) | 0;
+            }
+            function D2(a, b) {
+              a = +a;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              if ((b | 0) <= 1023) {
+                if ((b | 0) < -1022) {
+                  a = a * 2.2250738585072014e-308;
+                  e = (b | 0) < -2044;
+                  d = (b + 2044) | 0;
+                  a = e ? a * 2.2250738585072014e-308 : a;
+                  b = e ? ((d | 0) > -1022 ? d : -1022) : (b + 1022) | 0;
+                }
+              } else {
+                a = a * 8988465674311579538646525.0e283;
+                d = (b | 0) > 2046;
+                e = (b + -2046) | 0;
+                a = d ? a * 8988465674311579538646525.0e283 : a;
+                b = d ? ((e | 0) < 1023 ? e : 1023) : (b + -1023) | 0;
+              }
+              d = R6((b + 1023) | 0, 0, 52) | 0;
+              e = z;
+              c[j >> 2] = d;
+              c[(j + 4) >> 2] = e;
+              return +(a * +h[j >> 3]);
+            }
+            function E2(a) {
+              a = +a;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0.0,
+                g = 0.0;
+              h[j >> 3] = a;
+              d = c[(j + 4) >> 2] | 0;
+              b = d & 2147483647;
+              do
+                if (b >>> 0 > 2146435071) a = a + a;
+                else {
+                  if (b >>> 0 < 1048576) {
+                    h[j >> 3] = a * 18014398509481984.0;
+                    d = c[(j + 4) >> 2] | 0;
+                    b = d & 2147483647;
+                    if (!b) break;
+                    else e = 696219795;
+                  } else e = 715094163;
+                  c[j >> 2] = 0;
+                  c[(j + 4) >> 2] = ((((b >>> 0) / 3) | 0) + e) | (d & -2147483648);
+                  f = +h[j >> 3];
+                  g = f * f * (f / a);
+                  h[j >> 3] =
+                    (g * (g * g) * (g * 0.14599619288661245 + -0.758397934778766) +
+                      (g * (g * 1.6214297201053545 + -1.8849797954337717) + 1.87595182427177)) *
+                    f;
+                  d = J6(c[j >> 2] | 0, c[(j + 4) >> 2] | 0, -2147483648, 0) | 0;
+                  e = z;
+                  c[j >> 2] = d & -1073741824;
+                  c[(j + 4) >> 2] = e;
+                  f = +h[j >> 3];
+                  a = a / (f * f);
+                  a = ((a - f) / (f + f + a)) * f + f;
+                }
+              while (0);
+              return +a;
+            }
+            function F2(a, b) {
+              a = +a;
+              b = +b;
+              var d = 0,
+                e = 0;
+              h[j >> 3] = a;
+              e = c[j >> 2] | 0;
+              d = c[(j + 4) >> 2] | 0;
+              h[j >> 3] = b;
+              d = (c[(j + 4) >> 2] & -2147483648) | (d & 2147483647);
+              c[j >> 2] = e;
+              c[(j + 4) >> 2] = d;
+              return +(+h[j >> 3]);
+            }
+            function G2(a, b) {
+              a = +a;
+              b = +b;
+              return +(+F2(a, b));
+            }
+            function H2(a, b) {
+              a = +a;
+              b = b | 0;
+              return +(+D2(a, b));
+            }
+            function I2(a, b) {
+              a = +a;
+              b = +b;
+              return +(+J2(a, b));
+            }
+            function J2(a, b) {
+              a = +a;
+              b = +b;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              h[j >> 3] = a;
+              i = c[j >> 2] | 0;
+              l = c[(j + 4) >> 2] | 0;
+              h[j >> 3] = b;
+              n = c[j >> 2] | 0;
+              o = c[(j + 4) >> 2] | 0;
+              e = Q6(i | 0, l | 0, 52) | 0;
+              e = e & 2047;
+              m = Q6(n | 0, o | 0, 52) | 0;
+              m = m & 2047;
+              p = l & -2147483648;
+              g = R6(n | 0, o | 0, 1) | 0;
+              k = z;
+              a: do
+                if (
+                  !(((g | 0) == 0) & ((k | 0) == 0))
+                    ? ((f = K2(b) | 0),
+                      (d = z & 2147483647),
+                      !(((e | 0) == 2047) | ((d >>> 0 > 2146435072) | (((d | 0) == 2146435072) & (f >>> 0 > 0)))))
+                    : 0
+                ) {
+                  d = R6(i | 0, l | 0, 1) | 0;
+                  f = z;
+                  if (!((f >>> 0 > k >>> 0) | (((f | 0) == (k | 0)) & (d >>> 0 > g >>> 0))))
+                    return +(((d | 0) == (g | 0)) & ((f | 0) == (k | 0)) ? a * 0.0 : a);
+                  if (!e) {
+                    d = R6(i | 0, l | 0, 12) | 0;
+                    f = z;
+                    if (((f | 0) > -1) | (((f | 0) == -1) & (d >>> 0 > 4294967295))) {
+                      e = 0;
+                      do {
+                        e = (e + -1) | 0;
+                        d = R6(d | 0, f | 0, 1) | 0;
+                        f = z;
+                      } while (((f | 0) > -1) | (((f | 0) == -1) & (d >>> 0 > 4294967295)));
+                    } else e = 0;
+                    i = R6(i | 0, l | 0, (1 - e) | 0) | 0;
+                    g = z;
+                  } else g = (l & 1048575) | 1048576;
+                  if (!m) {
+                    f = R6(n | 0, o | 0, 12) | 0;
+                    k = z;
+                    if (((k | 0) > -1) | (((k | 0) == -1) & (f >>> 0 > 4294967295))) {
+                      d = 0;
+                      do {
+                        d = (d + -1) | 0;
+                        f = R6(f | 0, k | 0, 1) | 0;
+                        k = z;
+                      } while (((k | 0) > -1) | (((k | 0) == -1) & (f >>> 0 > 4294967295)));
+                    } else d = 0;
+                    n = R6(n | 0, o | 0, (1 - d) | 0) | 0;
+                    m = d;
+                    l = z;
+                  } else l = (o & 1048575) | 1048576;
+                  f = K6(i | 0, g | 0, n | 0, l | 0) | 0;
+                  d = z;
+                  k = ((d | 0) > -1) | (((d | 0) == -1) & (f >>> 0 > 4294967295));
+                  b: do
+                    if ((e | 0) > (m | 0)) {
+                      while (1) {
+                        if (k) {
+                          if (((f | 0) == 0) & ((d | 0) == 0)) break;
+                        } else {
+                          f = i;
+                          d = g;
+                        }
+                        i = R6(f | 0, d | 0, 1) | 0;
+                        g = z;
+                        e = (e + -1) | 0;
+                        f = K6(i | 0, g | 0, n | 0, l | 0) | 0;
+                        d = z;
+                        k = ((d | 0) > -1) | (((d | 0) == -1) & (f >>> 0 > 4294967295));
+                        if ((e | 0) <= (m | 0)) break b;
+                      }
+                      b = a * 0.0;
+                      break a;
+                    }
+                  while (0);
+                  if (k) {
+                    if (((f | 0) == 0) & ((d | 0) == 0)) {
+                      b = a * 0.0;
+                      break;
+                    }
+                  } else {
+                    d = g;
+                    f = i;
+                  }
+                  if ((d >>> 0 < 1048576) | (((d | 0) == 1048576) & (f >>> 0 < 0)))
+                    do {
+                      f = R6(f | 0, d | 0, 1) | 0;
+                      d = z;
+                      e = (e + -1) | 0;
+                    } while ((d >>> 0 < 1048576) | (((d | 0) == 1048576) & (f >>> 0 < 0)));
+                  if ((e | 0) > 0) {
+                    o = J6(f | 0, d | 0, 0, -1048576) | 0;
+                    d = z;
+                    e = R6(e | 0, 0, 52) | 0;
+                    d = d | z;
+                    e = o | e;
+                  } else {
+                    e = Q6(f | 0, d | 0, (1 - e) | 0) | 0;
+                    d = z;
+                  }
+                  c[j >> 2] = e;
+                  c[(j + 4) >> 2] = d | p;
+                  b = +h[j >> 3];
+                } else q = 3;
+              while (0);
+              if ((q | 0) == 3) {
+                b = a * b;
+                b = b / b;
+              }
+              return +b;
+            }
+            function K2(a) {
+              a = +a;
+              var b = 0;
+              h[j >> 3] = a;
+              b = c[j >> 2] | 0;
+              z = c[(j + 4) >> 2] | 0;
+              return b | 0;
+            }
+            function L2(a, b) {
+              a = +a;
+              b = +b;
+              var d = 0.0,
+                e = 0,
+                f = 0,
+                g = 0,
+                i = 0,
+                k = 0.0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0;
+              q = l;
+              l = (l + 32) | 0;
+              m = (q + 24) | 0;
+              n = (q + 16) | 0;
+              o = (q + 8) | 0;
+              p = q;
+              h[j >> 3] = a;
+              t = c[j >> 2] | 0;
+              g = c[(j + 4) >> 2] | 0;
+              h[j >> 3] = b;
+              e = c[j >> 2] | 0;
+              g = g & 2147483647;
+              f = c[(j + 4) >> 2] & 2147483647;
+              i = (g >>> 0 < f >>> 0) | (((g | 0) == (f | 0)) & (t >>> 0 < e >>> 0));
+              s = i ? e : t;
+              r = i ? f : g;
+              e = i ? t : e;
+              f = i ? g : f;
+              g = Q6(s | 0, r | 0, 52) | 0;
+              i = Q6(e | 0, f | 0, 52) | 0;
+              c[j >> 2] = s;
+              c[(j + 4) >> 2] = r;
+              a = +h[j >> 3];
+              c[j >> 2] = e;
+              c[(j + 4) >> 2] = f;
+              k = +h[j >> 3];
+              do
+                if ((i | 0) != 2047) {
+                  if (!((((e | 0) == 0) & ((f | 0) == 0)) | ((g | 0) == 2047))) {
+                    if (((g - i) | 0) > 64) {
+                      a = a + k;
+                      break;
+                    }
+                    if ((g | 0) > 1533) {
+                      d = 5260135901548373507240989.0e186;
+                      b = a * 1.90109156629516e-211;
+                      a = k * 1.90109156629516e-211;
+                    } else {
+                      t = (i | 0) < 573;
+                      d = t ? 1.90109156629516e-211 : 1.0;
+                      b = t ? a * 5260135901548373507240989.0e186 : a;
+                      a = t ? k * 5260135901548373507240989.0e186 : k;
+                    }
+                    M2(m, n, b);
+                    M2(o, p, a);
+                    a = d * +C(+(+h[p >> 3] + +h[n >> 3] + +h[o >> 3] + +h[m >> 3]));
+                  }
+                } else a = k;
+              while (0);
+              l = q;
+              return +a;
+            }
+            function M2(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = +c;
+              var d = 0.0,
+                e = 0.0;
+              e = c * 134217729.0;
+              e = e + (c - e);
+              d = c - e;
+              c = c * c;
+              h[a >> 3] = c;
+              h[b >> 3] = d * d + (e * e - c + e * 2.0 * d);
+              return;
+            }
+            function N2(a, b, d) {
+              a = +a;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0,
+                g = 0,
+                i = 0.0,
+                k = 0,
+                m = 0;
+              k = l;
+              l = (l + 16) | 0;
+              g = k;
+              h[j >> 3] = a;
+              f = c[(j + 4) >> 2] & 2147483647;
+              do
+                if (f >>> 0 < 1072243196)
+                  if (f >>> 0 < 1044816030) {
+                    h[b >> 3] = a;
+                    h[d >> 3] = 1.0;
+                    break;
+                  } else {
+                    h[b >> 3] = +w2(a, 0.0, 0);
+                    h[d >> 3] = +z2(a, 0.0);
+                    break;
+                  }
+                else {
+                  if (f >>> 0 > 2146435071) {
+                    i = a - a;
+                    h[d >> 3] = i;
+                    h[b >> 3] = i;
+                    break;
+                  }
+                  f = B2(a, g) | 0;
+                  m = (g + 8) | 0;
+                  e = +w2(+h[g >> 3], +h[m >> 3], 1);
+                  a = +z2(+h[g >> 3], +h[m >> 3]);
+                  switch (f & 3) {
+                    case 0: {
+                      h[b >> 3] = e;
+                      i = a;
+                      break;
+                    }
+                    case 1: {
+                      h[b >> 3] = a;
+                      i = -e;
+                      break;
+                    }
+                    case 2: {
+                      h[b >> 3] = -e;
+                      i = -a;
+                      break;
+                    }
+                    case 3: {
+                      h[b >> 3] = -a;
+                      i = e;
+                      break;
+                    }
+                    default: {
+                    }
+                  }
+                  h[d >> 3] = i;
+                }
+              while (0);
+              l = k;
+              return;
+            }
+            function O2(a, b) {
+              a = +a;
+              b = b | 0;
+              return +(+y2(a, b));
+            }
+            function P2(a) {
+              a = a | 0;
+              if (a >>> 0 < 131072)
+                a =
+                  ((d[(146423 + (((d[(146423 + (a >>> 8)) >> 0] | 0) << 5) | ((a >>> 3) & 31))) >> 0] | 0) >>>
+                    (a & 7)) &
+                  1;
+              else a = 0;
+              return a | 0;
+            }
+            function Q2(b, c, e) {
+              b = b | 0;
+              c = c | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              if (!e) f = 0;
+              else {
+                f = a[b >> 0] | 0;
+                a: do
+                  if (!((f << 24) >> 24)) f = 0;
+                  else
+                    while (1) {
+                      e = (e + -1) | 0;
+                      g = a[c >> 0] | 0;
+                      if (!(((f << 24) >> 24 == (g << 24) >> 24) & (((e | 0) != 0) & ((g << 24) >> 24 != 0)))) break a;
+                      b = (b + 1) | 0;
+                      c = (c + 1) | 0;
+                      f = a[b >> 0] | 0;
+                      if (!((f << 24) >> 24)) {
+                        f = 0;
+                        break;
+                      }
+                    }
+                while (0);
+                f = ((f & 255) - (d[c >> 0] | 0)) | 0;
+              }
+              return f | 0;
+            }
+            function R2(b, c) {
+              b = b | 0;
+              c = c | 0;
+              b = k2(b, c) | 0;
+              return ((a[b >> 0] | 0) == ((c & 255) << 24) >> 24 ? b : 0) | 0;
+            }
+            function S2(a) {
+              a = a | 0;
+              return ((((a | 0) == 32) | (((a + -9) | 0) >>> 0 < 5)) & 1) | 0;
+            }
+            function T2(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              c = V2(a, b, c, -1, 0) | 0;
+              return c | 0;
+            }
+            function U2(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              h = d & 255;
+              f = (e | 0) != 0;
+              a: do
+                if (f & (((b & 3) | 0) != 0)) {
+                  g = d & 255;
+                  while (1) {
+                    if ((a[b >> 0] | 0) == (g << 24) >> 24) {
+                      i = 6;
+                      break a;
+                    }
+                    b = (b + 1) | 0;
+                    e = (e + -1) | 0;
+                    f = (e | 0) != 0;
+                    if (!(f & (((b & 3) | 0) != 0))) {
+                      i = 5;
+                      break;
+                    }
+                  }
+                } else i = 5;
+              while (0);
+              if ((i | 0) == 5)
+                if (f) i = 6;
+                else e = 0;
+              b: do
+                if ((i | 0) == 6) {
+                  g = d & 255;
+                  if ((a[b >> 0] | 0) != (g << 24) >> 24) {
+                    f = O(h, 16843009) | 0;
+                    c: do
+                      if (e >>> 0 > 3)
+                        while (1) {
+                          h = c[b >> 2] ^ f;
+                          if ((((h & -2139062144) ^ -2139062144) & (h + -16843009)) | 0) break;
+                          b = (b + 4) | 0;
+                          e = (e + -4) | 0;
+                          if (e >>> 0 <= 3) {
+                            i = 11;
+                            break c;
+                          }
+                        }
+                      else i = 11;
+                    while (0);
+                    if ((i | 0) == 11)
+                      if (!e) {
+                        e = 0;
+                        break;
+                      }
+                    while (1) {
+                      if ((a[b >> 0] | 0) == (g << 24) >> 24) break b;
+                      b = (b + 1) | 0;
+                      e = (e + -1) | 0;
+                      if (!e) {
+                        e = 0;
+                        break;
+                      }
+                    }
+                  }
+                }
+              while (0);
+              return (e | 0 ? b : 0) | 0;
+            }
+            function V2(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 128) | 0;
+              h = j;
+              c[h >> 2] = 0;
+              i = (h + 4) | 0;
+              c[i >> 2] = a;
+              c[(h + 44) >> 2] = a;
+              g = (h + 8) | 0;
+              c[g >> 2] = (a | 0) < 0 ? -1 : (a + 2147483647) | 0;
+              c[(h + 76) >> 2] = -1;
+              W2(h, 0);
+              d = X2(h, d, 1, e, f) | 0;
+              if (b | 0) c[b >> 2] = a + ((c[i >> 2] | 0) + (c[(h + 108) >> 2] | 0) - (c[g >> 2] | 0));
+              l = j;
+              return d | 0;
+            }
+            function W2(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              c[(a + 104) >> 2] = b;
+              d = c[(a + 8) >> 2] | 0;
+              e = c[(a + 4) >> 2] | 0;
+              f = (d - e) | 0;
+              c[(a + 108) >> 2] = f;
+              c[(a + 100) >> 2] = ((b | 0) != 0) & ((f | 0) > (b | 0)) ? (e + b) | 0 : d;
+              return;
+            }
+            function X2(b, e, f, g, h) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0;
+              a: do
+                if (e >>> 0 > 36) {
+                  c[(d2() | 0) >> 2] = 22;
+                  h = 0;
+                  g = 0;
+                } else {
+                  r = (b + 4) | 0;
+                  q = (b + 100) | 0;
+                  do {
+                    i = c[r >> 2] | 0;
+                    if (i >>> 0 < (c[q >> 2] | 0) >>> 0) {
+                      c[r >> 2] = i + 1;
+                      i = d[i >> 0] | 0;
+                    } else i = Y2(b) | 0;
+                  } while ((S2(i) | 0) != 0);
+                  b: do
+                    switch (i | 0) {
+                      case 43:
+                      case 45: {
+                        i = (((i | 0) == 45) << 31) >> 31;
+                        j = c[r >> 2] | 0;
+                        if (j >>> 0 < (c[q >> 2] | 0) >>> 0) {
+                          c[r >> 2] = j + 1;
+                          p = i;
+                          i = d[j >> 0] | 0;
+                          break b;
+                        } else {
+                          p = i;
+                          i = Y2(b) | 0;
+                          break b;
+                        }
+                      }
+                      default:
+                        p = 0;
+                    }
+                  while (0);
+                  j = (e | 0) == 0;
+                  do
+                    if (((e | 16 | 0) == 16) & ((i | 0) == 48)) {
+                      i = c[r >> 2] | 0;
+                      if (i >>> 0 < (c[q >> 2] | 0) >>> 0) {
+                        c[r >> 2] = i + 1;
+                        i = d[i >> 0] | 0;
+                      } else i = Y2(b) | 0;
+                      if ((i | 32 | 0) != 120)
+                        if (j) {
+                          e = 8;
+                          n = 46;
+                          break;
+                        } else {
+                          n = 32;
+                          break;
+                        }
+                      i = c[r >> 2] | 0;
+                      if (i >>> 0 < (c[q >> 2] | 0) >>> 0) {
+                        c[r >> 2] = i + 1;
+                        i = d[i >> 0] | 0;
+                      } else i = Y2(b) | 0;
+                      if ((d[(149592 + i) >> 0] | 0) > 15) {
+                        g = (c[q >> 2] | 0) == 0;
+                        if (!g) c[r >> 2] = (c[r >> 2] | 0) + -1;
+                        if (!f) {
+                          W2(b, 0);
+                          h = 0;
+                          g = 0;
+                          break a;
+                        }
+                        if (g) {
+                          h = 0;
+                          g = 0;
+                          break a;
+                        }
+                        c[r >> 2] = (c[r >> 2] | 0) + -1;
+                        h = 0;
+                        g = 0;
+                        break a;
+                      } else {
+                        e = 16;
+                        n = 46;
+                      }
+                    } else {
+                      e = j ? 10 : e;
+                      if (e >>> 0 > (d[(149592 + i) >> 0] | 0) >>> 0) n = 32;
+                      else {
+                        if (c[q >> 2] | 0) c[r >> 2] = (c[r >> 2] | 0) + -1;
+                        W2(b, 0);
+                        c[(d2() | 0) >> 2] = 22;
+                        h = 0;
+                        g = 0;
+                        break a;
+                      }
+                    }
+                  while (0);
+                  c: do
+                    if ((n | 0) == 32)
+                      if ((e | 0) == 10) {
+                        e = (i + -48) | 0;
+                        if (e >>> 0 < 10) {
+                          i = 0;
+                          j = e;
+                          do {
+                            i = (((i * 10) | 0) + j) | 0;
+                            e = c[r >> 2] | 0;
+                            if (e >>> 0 < (c[q >> 2] | 0) >>> 0) {
+                              c[r >> 2] = e + 1;
+                              e = d[e >> 0] | 0;
+                            } else e = Y2(b) | 0;
+                            j = (e + -48) | 0;
+                          } while ((j >>> 0 < 10) & (i >>> 0 < 429496729));
+                          f = 0;
+                        } else {
+                          e = i;
+                          i = 0;
+                          f = 0;
+                        }
+                        k = (e + -48) | 0;
+                        if (k >>> 0 < 10) {
+                          j = e;
+                          do {
+                            e = I6(i | 0, f | 0, 10, 0) | 0;
+                            l = z;
+                            m = (((k | 0) < 0) << 31) >> 31;
+                            o = ~m;
+                            if ((l >>> 0 > o >>> 0) | (((l | 0) == (o | 0)) & (e >>> 0 > ~k >>> 0))) {
+                              e = 10;
+                              n = 72;
+                              break c;
+                            }
+                            i = J6(e | 0, l | 0, k | 0, m | 0) | 0;
+                            f = z;
+                            e = c[r >> 2] | 0;
+                            if (e >>> 0 < (c[q >> 2] | 0) >>> 0) {
+                              c[r >> 2] = e + 1;
+                              j = d[e >> 0] | 0;
+                            } else j = Y2(b) | 0;
+                            k = (j + -48) | 0;
+                          } while (
+                            (k >>> 0 < 10) &
+                            ((f >>> 0 < 429496729) | (((f | 0) == 429496729) & (i >>> 0 < 2576980378)))
+                          );
+                          if (k >>> 0 > 9) {
+                            j = p;
+                            e = f;
+                          } else {
+                            e = 10;
+                            n = 72;
+                          }
+                        } else {
+                          j = p;
+                          e = f;
+                        }
+                      } else n = 46;
+                  while (0);
+                  d: do
+                    if ((n | 0) == 46) {
+                      if (!((e + -1) & e)) {
+                        n = a[(149848 + ((((e * 23) | 0) >>> 5) & 7)) >> 0] | 0;
+                        f = a[(149592 + i) >> 0] | 0;
+                        j = f & 255;
+                        if (e >>> 0 > j >>> 0) {
+                          i = 0;
+                          k = j;
+                          do {
+                            i = k | (i << n);
+                            j = c[r >> 2] | 0;
+                            if (j >>> 0 < (c[q >> 2] | 0) >>> 0) {
+                              c[r >> 2] = j + 1;
+                              j = d[j >> 0] | 0;
+                            } else j = Y2(b) | 0;
+                            f = a[(149592 + j) >> 0] | 0;
+                            k = f & 255;
+                          } while ((i >>> 0 < 134217728) & (e >>> 0 > k >>> 0));
+                          k = 0;
+                        } else {
+                          j = i;
+                          k = 0;
+                          i = 0;
+                        }
+                        l = Q6(-1, -1, n | 0) | 0;
+                        m = z;
+                        if (
+                          (e >>> 0 <= (f & 255) >>> 0) |
+                          ((m >>> 0 < k >>> 0) | (((m | 0) == (k | 0)) & (l >>> 0 < i >>> 0)))
+                        ) {
+                          f = k;
+                          n = 72;
+                          break;
+                        } else j = k;
+                        while (1) {
+                          i = R6(i | 0, j | 0, n | 0) | 0;
+                          k = z;
+                          i = i | (f & 255);
+                          j = c[r >> 2] | 0;
+                          if (j >>> 0 < (c[q >> 2] | 0) >>> 0) {
+                            c[r >> 2] = j + 1;
+                            j = d[j >> 0] | 0;
+                          } else j = Y2(b) | 0;
+                          f = a[(149592 + j) >> 0] | 0;
+                          if (
+                            (e >>> 0 <= (f & 255) >>> 0) |
+                            ((k >>> 0 > m >>> 0) | (((k | 0) == (m | 0)) & (i >>> 0 > l >>> 0)))
+                          ) {
+                            f = k;
+                            n = 72;
+                            break d;
+                          } else j = k;
+                        }
+                      }
+                      f = a[(149592 + i) >> 0] | 0;
+                      j = f & 255;
+                      if (e >>> 0 > j >>> 0) {
+                        i = 0;
+                        k = j;
+                        do {
+                          i = (k + (O(i, e) | 0)) | 0;
+                          j = c[r >> 2] | 0;
+                          if (j >>> 0 < (c[q >> 2] | 0) >>> 0) {
+                            c[r >> 2] = j + 1;
+                            j = d[j >> 0] | 0;
+                          } else j = Y2(b) | 0;
+                          f = a[(149592 + j) >> 0] | 0;
+                          k = f & 255;
+                        } while ((i >>> 0 < 119304647) & (e >>> 0 > k >>> 0));
+                        k = 0;
+                      } else {
+                        j = i;
+                        i = 0;
+                        k = 0;
+                      }
+                      if (e >>> 0 > (f & 255) >>> 0) {
+                        n = N6(-1, -1, e | 0, 0) | 0;
+                        o = z;
+                        m = k;
+                        while (1) {
+                          if ((m >>> 0 > o >>> 0) | (((m | 0) == (o | 0)) & (i >>> 0 > n >>> 0))) {
+                            f = m;
+                            n = 72;
+                            break d;
+                          }
+                          k = I6(i | 0, m | 0, e | 0, 0) | 0;
+                          l = z;
+                          f = f & 255;
+                          if ((l >>> 0 > 4294967295) | (((l | 0) == -1) & (k >>> 0 > ~f >>> 0))) {
+                            f = m;
+                            n = 72;
+                            break d;
+                          }
+                          i = J6(k | 0, l | 0, f | 0, 0) | 0;
+                          k = z;
+                          j = c[r >> 2] | 0;
+                          if (j >>> 0 < (c[q >> 2] | 0) >>> 0) {
+                            c[r >> 2] = j + 1;
+                            j = d[j >> 0] | 0;
+                          } else j = Y2(b) | 0;
+                          f = a[(149592 + j) >> 0] | 0;
+                          if (e >>> 0 <= (f & 255) >>> 0) {
+                            f = k;
+                            n = 72;
+                            break;
+                          } else m = k;
+                        }
+                      } else {
+                        f = k;
+                        n = 72;
+                      }
+                    }
+                  while (0);
+                  if ((n | 0) == 72)
+                    if (e >>> 0 > (d[(149592 + j) >> 0] | 0) >>> 0) {
+                      do {
+                        i = c[r >> 2] | 0;
+                        if (i >>> 0 < (c[q >> 2] | 0) >>> 0) {
+                          c[r >> 2] = i + 1;
+                          i = d[i >> 0] | 0;
+                        } else i = Y2(b) | 0;
+                      } while (e >>> 0 > (d[(149592 + i) >> 0] | 0) >>> 0);
+                      c[(d2() | 0) >> 2] = 34;
+                      j = (((g & 1) | 0) == 0) & (0 == 0) ? p : 0;
+                      e = h;
+                      i = g;
+                    } else {
+                      j = p;
+                      e = f;
+                    }
+                  if (c[q >> 2] | 0) c[r >> 2] = (c[r >> 2] | 0) + -1;
+                  if (!((e >>> 0 < h >>> 0) | (((e | 0) == (h | 0)) & (i >>> 0 < g >>> 0)))) {
+                    if (!((((g & 1) | 0) != 0) | (0 != 0) | ((j | 0) != 0))) {
+                      c[(d2() | 0) >> 2] = 34;
+                      g = J6(g | 0, h | 0, -1, -1) | 0;
+                      h = z;
+                      break;
+                    }
+                    if ((e >>> 0 > h >>> 0) | (((e | 0) == (h | 0)) & (i >>> 0 > g >>> 0))) {
+                      c[(d2() | 0) >> 2] = 34;
+                      break;
+                    }
+                  }
+                  g = (((j | 0) < 0) << 31) >> 31;
+                  g = K6((i ^ j) | 0, (e ^ g) | 0, j | 0, g | 0) | 0;
+                  h = z;
+                }
+              while (0);
+              z = h;
+              return g | 0;
+            }
+            function Y2(b) {
+              b = b | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              f = (b + 104) | 0;
+              h = c[f >> 2] | 0;
+              if ((h | 0) != 0 ? (c[(b + 108) >> 2] | 0) >= (h | 0) : 0) i = 4;
+              else {
+                e = Z2(b) | 0;
+                if ((e | 0) >= 0) {
+                  g = c[f >> 2] | 0;
+                  f = (b + 8) | 0;
+                  if (g) {
+                    j = c[f >> 2] | 0;
+                    h = c[(b + 4) >> 2] | 0;
+                    f = (g - (c[(b + 108) >> 2] | 0)) | 0;
+                    g = j;
+                    if (((j - h) | 0) < (f | 0)) f = g;
+                    else f = (h + (f + -1)) | 0;
+                  } else {
+                    g = c[f >> 2] | 0;
+                    f = g;
+                  }
+                  c[(b + 100) >> 2] = f;
+                  f = (b + 4) | 0;
+                  if (!g) f = c[f >> 2] | 0;
+                  else {
+                    f = c[f >> 2] | 0;
+                    j = (b + 108) | 0;
+                    c[j >> 2] = g + 1 - f + (c[j >> 2] | 0);
+                  }
+                  f = (f + -1) | 0;
+                  if ((e | 0) != (d[f >> 0] | 0 | 0)) a[f >> 0] = e;
+                } else i = 4;
+              }
+              if ((i | 0) == 4) {
+                c[(b + 100) >> 2] = 0;
+                e = -1;
+              }
+              return e | 0;
+            }
+            function Z2(a) {
+              a = a | 0;
+              var b = 0,
+                e = 0;
+              e = l;
+              l = (l + 16) | 0;
+              b = e;
+              if ((_2(a) | 0) == 0 ? (nb[c[(a + 32) >> 2] & 63](a, b, 1) | 0) == 1 : 0) a = d[b >> 0] | 0;
+              else a = -1;
+              l = e;
+              return a | 0;
+            }
+            function _2(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = (b + 74) | 0;
+              e = a[d >> 0] | 0;
+              a[d >> 0] = (e + 255) | e;
+              d = (b + 20) | 0;
+              e = (b + 28) | 0;
+              if ((c[d >> 2] | 0) >>> 0 > (c[e >> 2] | 0) >>> 0) nb[c[(b + 36) >> 2] & 63](b, 0, 0) | 0;
+              c[(b + 16) >> 2] = 0;
+              c[e >> 2] = 0;
+              c[d >> 2] = 0;
+              d = c[b >> 2] | 0;
+              if (!(d & 4)) {
+                e = ((c[(b + 44) >> 2] | 0) + (c[(b + 48) >> 2] | 0)) | 0;
+                c[(b + 8) >> 2] = e;
+                c[(b + 4) >> 2] = e;
+                d = (d << 27) >> 31;
+              } else {
+                c[b >> 2] = d | 32;
+                d = -1;
+              }
+              return d | 0;
+            }
+            function $2(a) {
+              a = a | 0;
+              return (((a + -48) | 0) >>> 0 < 10) | 0;
+            }
+            function a3(a) {
+              a = a | 0;
+              return (((((a + -48) | 0) >>> 0 < 10) | ((b3(a) | 0) != 0)) & 1) | 0;
+            }
+            function b3(a) {
+              a = a | 0;
+              return ((((a | 32) + -97) | 0) >>> 0 < 26) | 0;
+            }
+            function c3(b, c) {
+              b = b | 0;
+              c = c | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              e = a[b >> 0] | 0;
+              a: do
+                if (!((e << 24) >> 24)) e = 0;
+                else {
+                  g = e & 255;
+                  while (1) {
+                    f = a[c >> 0] | 0;
+                    if (!((f << 24) >> 24)) break a;
+                    if ((e << 24) >> 24 != (f << 24) >> 24 ? ((g = d3(g) | 0), (g | 0) != (d3(f & 255) | 0)) : 0)
+                      break a;
+                    b = (b + 1) | 0;
+                    c = (c + 1) | 0;
+                    e = a[b >> 0] | 0;
+                    if (!((e << 24) >> 24)) {
+                      e = 0;
+                      break;
+                    } else g = e & 255;
+                  }
+                }
+              while (0);
+              g = d3(e & 255) | 0;
+              return (g - (d3(d[c >> 0] | 0) | 0)) | 0;
+            }
+            function d3(a) {
+              a = a | 0;
+              var b = 0;
+              b = (e3(a) | 0) == 0;
+              return (b ? a : a | 32) | 0;
+            }
+            function e3(a) {
+              a = a | 0;
+              return (((a + -65) | 0) >>> 0 < 26) | 0;
+            }
+            function f3(a) {
+              a = a | 0;
+              return g3(a, 0) | 0;
+            }
+            function g3(c, f) {
+              c = c | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              k = ((f << 1) + -1) | 0;
+              l = (f + -1) | 0;
+              a: do
+                if (
+                  !(
+                    (((c + -43008) | 0) >>> 0 < 22272) |
+                    ((((c + -11776) | 0) >>> 0 < 30784) | ((((c + -1536) | 0) >>> 0 < 2560) | ((h3(c) | 0) == 0)))
+                  )
+                ) {
+                  g = (f | 0) != 0;
+                  if (g & (((c + -4256) | 0) >>> 0 < 46)) {
+                    if ((c | 0) > 4293)
+                      switch (c | 0) {
+                        case 4295:
+                        case 4301:
+                          break;
+                        default:
+                          break a;
+                      }
+                    c = (c + 7264) | 0;
+                    break;
+                  }
+                  if ((((c + -11520) | 0) >>> 0 < 38) & (g ^ 1)) {
+                    c = (c + -7264) | 0;
+                    break;
+                  } else g = 0;
+                  do {
+                    i = a[(66346 + (g << 2) + 2) >> 0] | 0;
+                    j = (i << 24) >> 24;
+                    h = (c - (e[(66346 + (g << 2)) >> 1] | 0)) | 0;
+                    if (((h - (l & j)) | 0) >>> 0 < (d[(66346 + (g << 2) + 3) >> 0] | 0) >>> 0) {
+                      m = 11;
+                      break;
+                    }
+                    g = (g + 1) | 0;
+                  } while ((g | 0) != 61);
+                  if ((m | 0) == 11)
+                    if ((i << 24) >> 24 == 1) {
+                      c = (f + c - (h & 1)) | 0;
+                      break;
+                    } else {
+                      c = ((O(k, j) | 0) + c) | 0;
+                      break;
+                    }
+                  i = (1 - f) | 0;
+                  g = b[(65858 + (i << 1)) >> 1] | 0;
+                  b: do
+                    if ((g << 16) >> 16) {
+                      h = 0;
+                      while (1) {
+                        if (((g & 65535) | 0) == (c | 0)) break;
+                        h = (h + 1) | 0;
+                        g = b[(65858 + (h << 2) + (i << 1)) >> 1] | 0;
+                        if (!((g << 16) >> 16)) break b;
+                      }
+                      c = e[(65858 + (h << 2) + (f << 1)) >> 1] | 0;
+                      break a;
+                    }
+                  while (0);
+                  return (((c + -66600 + ((f * 40) | 0)) | 0) >>> 0 < 40 ? (c + -40 + ((f * 80) | 0)) | 0 : c) | 0;
+                }
+              while (0);
+              return c | 0;
+            }
+            function h3(a) {
+              a = a | 0;
+              if (a >>> 0 < 131072)
+                a =
+                  ((d[(149857 + (((d[(149857 + (a >>> 8)) >> 0] | 0) << 5) | ((a >>> 3) & 31))) >> 0] | 0) >>>
+                    (a & 7)) &
+                  1;
+              else a = (a >>> 0 < 196606) & 1;
+              return a | 0;
+            }
+            function i3(a) {
+              a = a | 0;
+              var b = 0;
+              b = a;
+              while (1)
+                if (!(c[b >> 2] | 0)) break;
+                else b = (b + 4) | 0;
+              return ((b - a) >> 2) | 0;
+            }
+            function j3(b, c, e) {
+              b = b | 0;
+              c = c | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              if (!e) b = 0;
+              else {
+                f = a[b >> 0] | 0;
+                a: do
+                  if (!((f << 24) >> 24)) b = 0;
+                  else {
+                    h = b;
+                    b = f;
+                    f = f & 255;
+                    while (1) {
+                      e = (e + -1) | 0;
+                      g = a[c >> 0] | 0;
+                      if (!(((e | 0) != 0) & ((g << 24) >> 24 != 0))) break a;
+                      if ((b << 24) >> 24 != (g << 24) >> 24 ? ((f = d3(f) | 0), (f | 0) != (d3(g & 255) | 0)) : 0)
+                        break a;
+                      h = (h + 1) | 0;
+                      c = (c + 1) | 0;
+                      f = a[h >> 0] | 0;
+                      if (!((f << 24) >> 24)) {
+                        b = 0;
+                        break;
+                      } else {
+                        b = f;
+                        f = f & 255;
+                      }
+                    }
+                  }
+                while (0);
+                b = d3(b & 255) | 0;
+                b = (b - (d3(d[c >> 0] | 0) | 0)) | 0;
+              }
+              return b | 0;
+            }
+            function k3(a) {
+              a = a | 0;
+              if (a >>> 0 >= 255)
+                if ((((a + -57344) | 0) >>> 0 < 8185) | ((a >>> 0 < 8232) | (((a + -8234) | 0) >>> 0 < 47062))) a = 1;
+                else return ((((a & 65534) | 0) != 65534) & (((a + -65532) | 0) >>> 0 < 1048580) & 1) | 0;
+              else a = (((a + 1) & 127) >>> 0 > 32) & 1;
+              return a | 0;
+            }
+            function l3(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              k = l;
+              l = (l + 16) | 0;
+              g = k;
+              i = (f | 0) == 0 ? 190640 : f;
+              f = c[i >> 2] | 0;
+              a: do
+                if (!d)
+                  if (!f) f = 0;
+                  else j = 17;
+                else {
+                  h = (b | 0) == 0 ? g : b;
+                  if (!e) f = -2;
+                  else {
+                    if (!f) {
+                      f = a[d >> 0] | 0;
+                      if ((f << 24) >> 24 > -1) {
+                        c[h >> 2] = f & 255;
+                        f = ((f << 24) >> 24 != 0) & 1;
+                        break;
+                      }
+                      g = (c[c[((p3() | 0) + 188) >> 2] >> 2] | 0) == 0;
+                      f = a[d >> 0] | 0;
+                      if (g) {
+                        c[h >> 2] = ((f << 24) >> 24) & 57343;
+                        f = 1;
+                        break;
+                      }
+                      f = ((f & 255) + -194) | 0;
+                      if (f >>> 0 > 50) {
+                        j = 17;
+                        break;
+                      }
+                      f = c[(62384 + (f << 2)) >> 2] | 0;
+                      g = (e + -1) | 0;
+                      if (g) {
+                        d = (d + 1) | 0;
+                        j = 11;
+                      }
+                    } else {
+                      g = e;
+                      j = 11;
+                    }
+                    b: do
+                      if ((j | 0) == 11) {
+                        b = a[d >> 0] | 0;
+                        m = (b & 255) >>> 3;
+                        if (((m + -16) | (m + (f >> 26))) >>> 0 > 7) {
+                          j = 17;
+                          break a;
+                        }
+                        while (1) {
+                          d = (d + 1) | 0;
+                          f = ((b & 255) + -128) | (f << 6);
+                          g = (g + -1) | 0;
+                          if ((f | 0) >= 0) break;
+                          if (!g) break b;
+                          b = a[d >> 0] | 0;
+                          if (((b & -64) << 24) >> 24 != -128) {
+                            j = 17;
+                            break a;
+                          }
+                        }
+                        c[i >> 2] = 0;
+                        c[h >> 2] = f;
+                        f = (e - g) | 0;
+                        break a;
+                      }
+                    while (0);
+                    c[i >> 2] = f;
+                    f = -2;
+                  }
+                }
+              while (0);
+              if ((j | 0) == 17) {
+                c[i >> 2] = 0;
+                c[(d2() | 0) >> 2] = 84;
+                f = -1;
+              }
+              l = k;
+              return f | 0;
+            }
+            function m3(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if (!a) a = 0;
+              else a = n3(a, b, 0) | 0;
+              return a | 0;
+            }
+            function n3(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              do
+                if (b) {
+                  if (d >>> 0 < 128) {
+                    a[b >> 0] = d;
+                    b = 1;
+                    break;
+                  }
+                  if (!(c[c[((o3() | 0) + 188) >> 2] >> 2] | 0))
+                    if (((d & -128) | 0) == 57216) {
+                      a[b >> 0] = d;
+                      b = 1;
+                      break;
+                    } else {
+                      c[(d2() | 0) >> 2] = 84;
+                      b = -1;
+                      break;
+                    }
+                  if (d >>> 0 < 2048) {
+                    a[b >> 0] = (d >>> 6) | 192;
+                    a[(b + 1) >> 0] = (d & 63) | 128;
+                    b = 2;
+                    break;
+                  }
+                  if ((d >>> 0 < 55296) | (((d & -8192) | 0) == 57344)) {
+                    a[b >> 0] = (d >>> 12) | 224;
+                    a[(b + 1) >> 0] = ((d >>> 6) & 63) | 128;
+                    a[(b + 2) >> 0] = (d & 63) | 128;
+                    b = 3;
+                    break;
+                  }
+                  if (((d + -65536) | 0) >>> 0 < 1048576) {
+                    a[b >> 0] = (d >>> 18) | 240;
+                    a[(b + 1) >> 0] = ((d >>> 12) & 63) | 128;
+                    a[(b + 2) >> 0] = ((d >>> 6) & 63) | 128;
+                    a[(b + 3) >> 0] = (d & 63) | 128;
+                    b = 4;
+                    break;
+                  } else {
+                    c[(d2() | 0) >> 2] = 84;
+                    b = -1;
+                    break;
+                  }
+                } else b = 1;
+              while (0);
+              return b | 0;
+            }
+            function o3() {
+              return v2() | 0;
+            }
+            function p3() {
+              return v2() | 0;
+            }
+            function q3(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              p = l;
+              l = (l + 272) | 0;
+              n = (p + 8) | 0;
+              o = p;
+              do
+                if (!(a[d >> 0] | 0)) {
+                  d = Ta(152833) | 0;
+                  if (d | 0 ? a[d >> 0] | 0 : 0) break;
+                  d = Ta((152840 + ((b * 12) | 0)) | 0) | 0;
+                  if (d | 0 ? a[d >> 0] | 0 : 0) break;
+                  d = Ta(152912) | 0;
+                  if (d | 0 ? a[d >> 0] | 0 : 0) break;
+                  d = 152917;
+                }
+              while (0);
+              e = 0;
+              a: do {
+                switch (a[(d + e) >> 0] | 0) {
+                  case 47:
+                  case 0:
+                    break a;
+                  default: {
+                  }
+                }
+                e = (e + 1) | 0;
+              } while (e >>> 0 < 15);
+              f = a[d >> 0] | 0;
+              if ((f << 24) >> 24 != 46 ? (a[(d + e) >> 0] | 0) == 0 : 0)
+                if ((f << 24) >> 24 == 67) m = 15;
+                else {
+                  k = d;
+                  m = 16;
+                }
+              else {
+                d = 152917;
+                m = 15;
+              }
+              if ((m | 0) == 15)
+                if (!(a[(d + 1) >> 0] | 0)) m = 18;
+                else {
+                  k = d;
+                  m = 16;
+                }
+              b: do
+                if ((m | 0) == 16)
+                  if ((s2(k, 152917) | 0) != 0 ? (s2(k, 152925) | 0) != 0 : 0) {
+                    d = c[47661] | 0;
+                    if (d | 0)
+                      do {
+                        if (!(s2(k, (d + 8) | 0) | 0)) break b;
+                        d = c[(d + 24) >> 2] | 0;
+                      } while ((d | 0) != 0);
+                    ta(190648);
+                    d = c[47661] | 0;
+                    c: do
+                      if (d | 0) {
+                        while (1) {
+                          if (!(s2(k, (d + 8) | 0) | 0)) break;
+                          d = c[(d + 24) >> 2] | 0;
+                          if (!d) break c;
+                        }
+                        La(190648);
+                        break b;
+                      }
+                    while (0);
+                    d: do
+                      if (((c[47646] | 0) == 0 ? ((g = Ta(152931) | 0), (g | 0) != 0) : 0) ? (a[g >> 0] | 0) != 0 : 0) {
+                        i = (254 - e) | 0;
+                        j = (e + 1) | 0;
+                        f = g;
+                        while (1) {
+                          h = k2(f, 58) | 0;
+                          d = a[h >> 0] | 0;
+                          g = (h - f + ((((d << 24) >> 24 != 0) << 31) >> 31)) | 0;
+                          if (g >>> 0 < i >>> 0) {
+                            W6(n | 0, f | 0, g | 0) | 0;
+                            f = (n + g) | 0;
+                            a[f >> 0] = 47;
+                            W6((f + 1) | 0, k | 0, e | 0) | 0;
+                            a[(n + (j + g)) >> 0] = 0;
+                            f = ua(n | 0, o | 0) | 0;
+                            if (f | 0) break;
+                            d = a[h >> 0] | 0;
+                          }
+                          f = (h + (((d << 24) >> 24 != 0) & 1)) | 0;
+                          if (!(a[f >> 0] | 0)) {
+                            m = 41;
+                            break d;
+                          }
+                        }
+                        d = T1(28) | 0;
+                        if (!d) {
+                          h2(f, c[o >> 2] | 0) | 0;
+                          m = 41;
+                          break;
+                        } else {
+                          c[d >> 2] = f;
+                          c[(d + 4) >> 2] = c[o >> 2];
+                          o = (d + 8) | 0;
+                          W6(o | 0, k | 0, e | 0) | 0;
+                          a[(o + e) >> 0] = 0;
+                          c[(d + 24) >> 2] = c[47661];
+                          c[47661] = d;
+                          break;
+                        }
+                      } else m = 41;
+                    while (0);
+                    if ((m | 0) == 41) {
+                      d = T1(28) | 0;
+                      if (d) {
+                        c[d >> 2] = c[15584];
+                        c[(d + 4) >> 2] = c[15585];
+                        o = (d + 8) | 0;
+                        W6(o | 0, k | 0, e | 0) | 0;
+                        a[(o + e) >> 0] = 0;
+                        c[(d + 24) >> 2] = c[47661];
+                        c[47661] = d;
+                      }
+                    }
+                    La(190648);
+                    d = ((b | 0) == 0) & ((d | 0) == 0) ? 62336 : d;
+                  } else {
+                    d = k;
+                    m = 18;
+                  }
+              while (0);
+              do
+                if ((m | 0) == 18) {
+                  if ((b | 0) == 0 ? (a[(d + 1) >> 0] | 0) == 46 : 0) {
+                    d = 62336;
+                    break;
+                  }
+                  d = 0;
+                }
+              while (0);
+              l = p;
+              return d | 0;
+            }
+            function r3(a, b) {
+              a = a | 0;
+              b = b | 0;
+              s3(a, b) | 0;
+              return a | 0;
+            }
+            function s3(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = d;
+              a: do
+                if (!((e ^ b) & 3)) {
+                  if (e & 3)
+                    do {
+                      e = a[d >> 0] | 0;
+                      a[b >> 0] = e;
+                      if (!((e << 24) >> 24)) break a;
+                      d = (d + 1) | 0;
+                      b = (b + 1) | 0;
+                    } while (((d & 3) | 0) != 0);
+                  e = c[d >> 2] | 0;
+                  if (!(((e & -2139062144) ^ -2139062144) & (e + -16843009))) {
+                    f = b;
+                    while (1) {
+                      d = (d + 4) | 0;
+                      b = (f + 4) | 0;
+                      c[f >> 2] = e;
+                      e = c[d >> 2] | 0;
+                      if ((((e & -2139062144) ^ -2139062144) & (e + -16843009)) | 0) break;
+                      else f = b;
+                    }
+                  }
+                  f = 8;
+                } else f = 8;
+              while (0);
+              if ((f | 0) == 8) {
+                f = a[d >> 0] | 0;
+                a[b >> 0] = f;
+                if ((f << 24) >> 24)
+                  do {
+                    d = (d + 1) | 0;
+                    b = (b + 1) | 0;
+                    f = a[d >> 0] | 0;
+                    a[b >> 0] = f;
+                  } while ((f << 24) >> 24 != 0);
+              }
+              return b | 0;
+            }
+            function t3(a) {
+              a = a | 0;
+              return ((((a | 0) == 32) | ((a | 0) == 9)) & 1) | 0;
+            }
+            function u3(a) {
+              a = a | 0;
+              if (!a) a = 0;
+              else a = ((v3(63500, a) | 0) != 0) & 1;
+              return a | 0;
+            }
+            function v3(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0;
+              if (!b) a = (a + ((i3(a) | 0) << 2)) | 0;
+              else {
+                while (1) {
+                  d = c[a >> 2] | 0;
+                  if (((d | 0) == 0) | ((d | 0) == (b | 0))) break;
+                  else a = (a + 4) | 0;
+                }
+                a = d | 0 ? a : 0;
+              }
+              return a | 0;
+            }
+            function w3(a, b) {
+              a = a | 0;
+              b = b | 0;
+              do
+                switch (b | 0) {
+                  case 1: {
+                    a = x3(a) | 0;
+                    break;
+                  }
+                  case 2: {
+                    a = h3(a) | 0;
+                    break;
+                  }
+                  case 3: {
+                    a = y3(a) | 0;
+                    break;
+                  }
+                  case 4: {
+                    a = z3(a) | 0;
+                    break;
+                  }
+                  case 5: {
+                    a = $2(a) | 0;
+                    break;
+                  }
+                  case 6: {
+                    a = A3(a) | 0;
+                    break;
+                  }
+                  case 7: {
+                    a = B3(a) | 0;
+                    break;
+                  }
+                  case 8: {
+                    a = k3(a) | 0;
+                    break;
+                  }
+                  case 9: {
+                    a = P2(a) | 0;
+                    break;
+                  }
+                  case 10: {
+                    a = u3(a) | 0;
+                    break;
+                  }
+                  case 11: {
+                    a = C3(a) | 0;
+                    break;
+                  }
+                  case 12: {
+                    a = D3(a) | 0;
+                    break;
+                  }
+                  default:
+                    a = 0;
+                }
+              while (0);
+              return a | 0;
+            }
+            function x3(a) {
+              a = a | 0;
+              if (!($2(a) | 0)) a = ((h3(a) | 0) != 0) & 1;
+              else a = 1;
+              return a | 0;
+            }
+            function y3(a) {
+              a = a | 0;
+              return t3(a) | 0;
+            }
+            function z3(a) {
+              a = a | 0;
+              return (
+                (((((a + -65529) | 0) >>> 0 < 3) |
+                  ((((a & -2) | 0) == 8232) | ((a >>> 0 < 32) | (((a + -127) | 0) >>> 0 < 33)))) &
+                  1) |
+                0
+              );
+            }
+            function A3(a) {
+              a = a | 0;
+              if (!(u3(a) | 0)) a = ((k3(a) | 0) != 0) & 1;
+              else a = 0;
+              return a | 0;
+            }
+            function B3(a) {
+              a = a | 0;
+              return ((f3(a) | 0) != (a | 0)) | 0;
+            }
+            function C3(a) {
+              a = a | 0;
+              return ((E3(a) | 0) != (a | 0)) | 0;
+            }
+            function D3(a) {
+              a = a | 0;
+              return (((((a + -48) | 0) >>> 0 < 10) | ((((a | 32) + -97) | 0) >>> 0 < 6)) & 1) | 0;
+            }
+            function E3(a) {
+              a = a | 0;
+              return g3(a, 1) | 0;
+            }
+            function F3(a) {
+              a = a | 0;
+              return (((a + -97) | 0) >>> 0 < 26) | 0;
+            }
+            function G3(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              n = l;
+              l = (l + 128) | 0;
+              g = (n + 124) | 0;
+              m = n;
+              h = m;
+              i = 63588;
+              j = (h + 124) | 0;
+              do {
+                c[h >> 2] = c[i >> 2];
+                h = (h + 4) | 0;
+                i = (i + 4) | 0;
+              } while ((h | 0) < (j | 0));
+              if (((d + -1) | 0) >>> 0 > 2147483646)
+                if (!d) {
+                  b = g;
+                  d = 1;
+                  k = 4;
+                } else {
+                  c[(d2() | 0) >> 2] = 75;
+                  d = -1;
+                }
+              else k = 4;
+              if ((k | 0) == 4) {
+                k = (-2 - b) | 0;
+                k = d >>> 0 > k >>> 0 ? k : d;
+                c[(m + 48) >> 2] = k;
+                g = (m + 20) | 0;
+                c[g >> 2] = b;
+                c[(m + 44) >> 2] = b;
+                d = (b + k) | 0;
+                b = (m + 16) | 0;
+                c[b >> 2] = d;
+                c[(m + 28) >> 2] = d;
+                d = H3(m, e, f) | 0;
+                if (k) {
+                  m = c[g >> 2] | 0;
+                  a[(m + ((((m | 0) == (c[b >> 2] | 0)) << 31) >> 31)) >> 0] = 0;
+                }
+              }
+              l = n;
+              return d | 0;
+            }
+            function H3(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0;
+              s = l;
+              l = (l + 224) | 0;
+              n = (s + 120) | 0;
+              p = (s + 80) | 0;
+              q = s;
+              r = (s + 136) | 0;
+              f = p;
+              g = (f + 40) | 0;
+              do {
+                c[f >> 2] = 0;
+                f = (f + 4) | 0;
+              } while ((f | 0) < (g | 0));
+              c[n >> 2] = c[e >> 2];
+              if ((I3(0, d, n, q, p) | 0) < 0) e = -1;
+              else {
+                if ((c[(b + 76) >> 2] | 0) > -1) o = J3(b) | 0;
+                else o = 0;
+                e = c[b >> 2] | 0;
+                m = e & 32;
+                if ((a[(b + 74) >> 0] | 0) < 1) c[b >> 2] = e & -33;
+                f = (b + 48) | 0;
+                if (!(c[f >> 2] | 0)) {
+                  g = (b + 44) | 0;
+                  h = c[g >> 2] | 0;
+                  c[g >> 2] = r;
+                  i = (b + 28) | 0;
+                  c[i >> 2] = r;
+                  j = (b + 20) | 0;
+                  c[j >> 2] = r;
+                  c[f >> 2] = 80;
+                  k = (b + 16) | 0;
+                  c[k >> 2] = r + 80;
+                  e = I3(b, d, n, q, p) | 0;
+                  if (h) {
+                    nb[c[(b + 36) >> 2] & 63](b, 0, 0) | 0;
+                    e = (c[j >> 2] | 0) == 0 ? -1 : e;
+                    c[g >> 2] = h;
+                    c[f >> 2] = 0;
+                    c[k >> 2] = 0;
+                    c[i >> 2] = 0;
+                    c[j >> 2] = 0;
+                  }
+                } else e = I3(b, d, n, q, p) | 0;
+                f = c[b >> 2] | 0;
+                c[b >> 2] = f | m;
+                if (o | 0) K3(b);
+                e = ((f & 32) | 0) == 0 ? e : -1;
+              }
+              l = s;
+              return e | 0;
+            }
+            function I3(d, e, f, g, i) {
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              i = i | 0;
+              var j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0;
+              H = l;
+              l = (l + 64) | 0;
+              D = (H + 16) | 0;
+              E = H;
+              B = (H + 24) | 0;
+              F = (H + 8) | 0;
+              G = (H + 20) | 0;
+              c[D >> 2] = e;
+              x = (d | 0) != 0;
+              y = (B + 40) | 0;
+              A = y;
+              B = (B + 39) | 0;
+              C = (F + 4) | 0;
+              k = 0;
+              j = 0;
+              p = 0;
+              a: while (1) {
+                do
+                  if ((j | 0) > -1)
+                    if ((k | 0) > ((2147483647 - j) | 0)) {
+                      c[(d2() | 0) >> 2] = 75;
+                      j = -1;
+                      break;
+                    } else {
+                      j = (k + j) | 0;
+                      break;
+                    }
+                while (0);
+                k = a[e >> 0] | 0;
+                if (!((k << 24) >> 24)) {
+                  w = 86;
+                  break;
+                } else m = e;
+                b: while (1) {
+                  switch ((k << 24) >> 24) {
+                    case 37: {
+                      k = m;
+                      w = 9;
+                      break b;
+                    }
+                    case 0: {
+                      k = m;
+                      break b;
+                    }
+                    default: {
+                    }
+                  }
+                  v = (m + 1) | 0;
+                  c[D >> 2] = v;
+                  k = a[v >> 0] | 0;
+                  m = v;
+                }
+                c: do
+                  if ((w | 0) == 9)
+                    while (1) {
+                      w = 0;
+                      if ((a[(m + 1) >> 0] | 0) != 37) break c;
+                      k = (k + 1) | 0;
+                      m = (m + 2) | 0;
+                      c[D >> 2] = m;
+                      if ((a[m >> 0] | 0) == 37) w = 9;
+                      else break;
+                    }
+                while (0);
+                k = (k - e) | 0;
+                if (x) L3(d, e, k);
+                if (k | 0) {
+                  e = m;
+                  continue;
+                }
+                n = (m + 1) | 0;
+                k = ((a[n >> 0] | 0) + -48) | 0;
+                if (k >>> 0 < 10) {
+                  v = (a[(m + 2) >> 0] | 0) == 36;
+                  t = v ? k : -1;
+                  p = v ? 1 : p;
+                  n = v ? (m + 3) | 0 : n;
+                } else t = -1;
+                c[D >> 2] = n;
+                k = a[n >> 0] | 0;
+                v = (((k << 24) >> 24) + -32) | 0;
+                if ((v >>> 0 > 31) | ((((1 << v) & 75913) | 0) == 0)) m = 0;
+                else {
+                  m = 0;
+                  do {
+                    m = (1 << (((k << 24) >> 24) + -32)) | m;
+                    n = (n + 1) | 0;
+                    c[D >> 2] = n;
+                    k = a[n >> 0] | 0;
+                    v = (((k << 24) >> 24) + -32) | 0;
+                  } while (!((v >>> 0 > 31) | ((((1 << v) & 75913) | 0) == 0)));
+                }
+                if ((k << 24) >> 24 == 42) {
+                  o = (n + 1) | 0;
+                  k = ((a[o >> 0] | 0) + -48) | 0;
+                  if (k >>> 0 < 10 ? (a[(n + 2) >> 0] | 0) == 36 : 0) {
+                    c[(i + (k << 2)) >> 2] = 10;
+                    k = c[(g + (((a[o >> 0] | 0) + -48) << 3)) >> 2] | 0;
+                    p = 1;
+                    n = (n + 3) | 0;
+                  } else {
+                    if (p | 0) {
+                      j = -1;
+                      break;
+                    }
+                    if (x) {
+                      p = ((c[f >> 2] | 0) + (4 - 1)) & ~(4 - 1);
+                      k = c[p >> 2] | 0;
+                      c[f >> 2] = p + 4;
+                      p = 0;
+                      n = o;
+                    } else {
+                      k = 0;
+                      p = 0;
+                      n = o;
+                    }
+                  }
+                  c[D >> 2] = n;
+                  u = (k | 0) < 0;
+                  k = u ? (0 - k) | 0 : k;
+                  u = u ? m | 8192 : m;
+                } else {
+                  k = M3(D) | 0;
+                  if ((k | 0) < 0) {
+                    j = -1;
+                    break;
+                  }
+                  u = m;
+                  n = c[D >> 2] | 0;
+                }
+                do
+                  if ((a[n >> 0] | 0) == 46) {
+                    if ((a[(n + 1) >> 0] | 0) != 42) {
+                      c[D >> 2] = n + 1;
+                      m = M3(D) | 0;
+                      n = c[D >> 2] | 0;
+                      break;
+                    }
+                    o = (n + 2) | 0;
+                    m = ((a[o >> 0] | 0) + -48) | 0;
+                    if (m >>> 0 < 10 ? (a[(n + 3) >> 0] | 0) == 36 : 0) {
+                      c[(i + (m << 2)) >> 2] = 10;
+                      m = c[(g + (((a[o >> 0] | 0) + -48) << 3)) >> 2] | 0;
+                      n = (n + 4) | 0;
+                      c[D >> 2] = n;
+                      break;
+                    }
+                    if (p | 0) {
+                      j = -1;
+                      break a;
+                    }
+                    if (x) {
+                      v = ((c[f >> 2] | 0) + (4 - 1)) & ~(4 - 1);
+                      m = c[v >> 2] | 0;
+                      c[f >> 2] = v + 4;
+                    } else m = 0;
+                    c[D >> 2] = o;
+                    n = o;
+                  } else m = -1;
+                while (0);
+                s = 0;
+                while (1) {
+                  if ((((a[n >> 0] | 0) + -65) | 0) >>> 0 > 57) {
+                    j = -1;
+                    break a;
+                  }
+                  v = (n + 1) | 0;
+                  c[D >> 2] = v;
+                  o = a[((a[n >> 0] | 0) + -65 + (152944 + ((s * 58) | 0))) >> 0] | 0;
+                  q = o & 255;
+                  if (((q + -1) | 0) >>> 0 < 8) {
+                    s = q;
+                    n = v;
+                  } else break;
+                }
+                if (!((o << 24) >> 24)) {
+                  j = -1;
+                  break;
+                }
+                r = (t | 0) > -1;
+                do
+                  if ((o << 24) >> 24 == 19)
+                    if (r) {
+                      j = -1;
+                      break a;
+                    } else w = 48;
+                  else {
+                    if (r) {
+                      c[(i + (t << 2)) >> 2] = q;
+                      r = (g + (t << 3)) | 0;
+                      t = c[(r + 4) >> 2] | 0;
+                      w = E;
+                      c[w >> 2] = c[r >> 2];
+                      c[(w + 4) >> 2] = t;
+                      w = 48;
+                      break;
+                    }
+                    if (!x) {
+                      j = 0;
+                      break a;
+                    }
+                    N3(E, q, f);
+                  }
+                while (0);
+                if ((w | 0) == 48 ? ((w = 0), !x) : 0) {
+                  k = 0;
+                  e = v;
+                  continue;
+                }
+                n = a[n >> 0] | 0;
+                n = ((s | 0) != 0) & (((n & 15) | 0) == 3) ? n & -33 : n;
+                t = u & -65537;
+                u = ((u & 8192) | 0) == 0 ? u : t;
+                d: do
+                  switch (n | 0) {
+                    case 110:
+                      switch (((s & 255) << 24) >> 24) {
+                        case 0: {
+                          c[c[E >> 2] >> 2] = j;
+                          k = 0;
+                          e = v;
+                          continue a;
+                        }
+                        case 1: {
+                          c[c[E >> 2] >> 2] = j;
+                          k = 0;
+                          e = v;
+                          continue a;
+                        }
+                        case 2: {
+                          k = c[E >> 2] | 0;
+                          c[k >> 2] = j;
+                          c[(k + 4) >> 2] = (((j | 0) < 0) << 31) >> 31;
+                          k = 0;
+                          e = v;
+                          continue a;
+                        }
+                        case 3: {
+                          b[c[E >> 2] >> 1] = j;
+                          k = 0;
+                          e = v;
+                          continue a;
+                        }
+                        case 4: {
+                          a[c[E >> 2] >> 0] = j;
+                          k = 0;
+                          e = v;
+                          continue a;
+                        }
+                        case 6: {
+                          c[c[E >> 2] >> 2] = j;
+                          k = 0;
+                          e = v;
+                          continue a;
+                        }
+                        case 7: {
+                          k = c[E >> 2] | 0;
+                          c[k >> 2] = j;
+                          c[(k + 4) >> 2] = (((j | 0) < 0) << 31) >> 31;
+                          k = 0;
+                          e = v;
+                          continue a;
+                        }
+                        default: {
+                          k = 0;
+                          e = v;
+                          continue a;
+                        }
+                      }
+                    case 112: {
+                      n = 120;
+                      m = m >>> 0 > 8 ? m : 8;
+                      e = u | 8;
+                      w = 60;
+                      break;
+                    }
+                    case 88:
+                    case 120: {
+                      e = u;
+                      w = 60;
+                      break;
+                    }
+                    case 111: {
+                      n = E;
+                      e = c[n >> 2] | 0;
+                      n = c[(n + 4) >> 2] | 0;
+                      r = P3(e, n, y) | 0;
+                      s = (A - r) | 0;
+                      o = 0;
+                      q = 153408;
+                      m = (((u & 8) | 0) == 0) | ((m | 0) > (s | 0)) ? m : (s + 1) | 0;
+                      s = u;
+                      w = 66;
+                      break;
+                    }
+                    case 105:
+                    case 100: {
+                      n = E;
+                      e = c[n >> 2] | 0;
+                      n = c[(n + 4) >> 2] | 0;
+                      if ((n | 0) < 0) {
+                        e = K6(0, 0, e | 0, n | 0) | 0;
+                        n = z;
+                        o = E;
+                        c[o >> 2] = e;
+                        c[(o + 4) >> 2] = n;
+                        o = 1;
+                        q = 153408;
+                        w = 65;
+                        break d;
+                      } else {
+                        o = (((u & 2049) | 0) != 0) & 1;
+                        q = ((u & 2048) | 0) == 0 ? (((u & 1) | 0) == 0 ? 153408 : 153410) : 153409;
+                        w = 65;
+                        break d;
+                      }
+                    }
+                    case 117: {
+                      n = E;
+                      o = 0;
+                      q = 153408;
+                      e = c[n >> 2] | 0;
+                      n = c[(n + 4) >> 2] | 0;
+                      w = 65;
+                      break;
+                    }
+                    case 99: {
+                      a[B >> 0] = c[E >> 2];
+                      e = B;
+                      o = 0;
+                      q = 153408;
+                      r = y;
+                      n = 1;
+                      m = t;
+                      break;
+                    }
+                    case 109: {
+                      n = t2(c[(d2() | 0) >> 2] | 0) | 0;
+                      w = 70;
+                      break;
+                    }
+                    case 115: {
+                      n = c[E >> 2] | 0;
+                      n = n | 0 ? n : 153418;
+                      w = 70;
+                      break;
+                    }
+                    case 67: {
+                      c[F >> 2] = c[E >> 2];
+                      c[C >> 2] = 0;
+                      c[E >> 2] = F;
+                      r = -1;
+                      n = F;
+                      w = 74;
+                      break;
+                    }
+                    case 83: {
+                      e = c[E >> 2] | 0;
+                      if (!m) {
+                        R3(d, 32, k, 0, u);
+                        e = 0;
+                        w = 83;
+                      } else {
+                        r = m;
+                        n = e;
+                        w = 74;
+                      }
+                      break;
+                    }
+                    case 65:
+                    case 71:
+                    case 70:
+                    case 69:
+                    case 97:
+                    case 103:
+                    case 102:
+                    case 101: {
+                      k = S3(d, +h[E >> 3], k, m, u, n) | 0;
+                      e = v;
+                      continue a;
+                    }
+                    default: {
+                      o = 0;
+                      q = 153408;
+                      r = y;
+                      n = m;
+                      m = u;
+                    }
+                  }
+                while (0);
+                e: do
+                  if ((w | 0) == 60) {
+                    u = E;
+                    t = c[u >> 2] | 0;
+                    u = c[(u + 4) >> 2] | 0;
+                    r = O3(t, u, y, n & 32) | 0;
+                    q = (((e & 8) | 0) == 0) | (((t | 0) == 0) & ((u | 0) == 0));
+                    o = q ? 0 : 2;
+                    q = q ? 153408 : (153408 + (n >> 4)) | 0;
+                    s = e;
+                    e = t;
+                    n = u;
+                    w = 66;
+                  } else if ((w | 0) == 65) {
+                    r = Q3(e, n, y) | 0;
+                    s = u;
+                    w = 66;
+                  } else if ((w | 0) == 70) {
+                    w = 0;
+                    u = U2(n, 0, m) | 0;
+                    s = (u | 0) == 0;
+                    e = n;
+                    o = 0;
+                    q = 153408;
+                    r = s ? (n + m) | 0 : u;
+                    n = s ? m : (u - n) | 0;
+                    m = t;
+                  } else if ((w | 0) == 74) {
+                    w = 0;
+                    q = n;
+                    e = 0;
+                    m = 0;
+                    while (1) {
+                      o = c[q >> 2] | 0;
+                      if (!o) break;
+                      m = m3(G, o) | 0;
+                      if (((m | 0) < 0) | (m >>> 0 > ((r - e) | 0) >>> 0)) break;
+                      e = (m + e) | 0;
+                      if (r >>> 0 > e >>> 0) q = (q + 4) | 0;
+                      else break;
+                    }
+                    if ((m | 0) < 0) {
+                      j = -1;
+                      break a;
+                    }
+                    R3(d, 32, k, e, u);
+                    if (!e) {
+                      e = 0;
+                      w = 83;
+                    } else {
+                      o = 0;
+                      while (1) {
+                        m = c[n >> 2] | 0;
+                        if (!m) {
+                          w = 83;
+                          break e;
+                        }
+                        m = m3(G, m) | 0;
+                        o = (m + o) | 0;
+                        if ((o | 0) > (e | 0)) {
+                          w = 83;
+                          break e;
+                        }
+                        L3(d, G, m);
+                        if (o >>> 0 >= e >>> 0) {
+                          w = 83;
+                          break;
+                        } else n = (n + 4) | 0;
+                      }
+                    }
+                  }
+                while (0);
+                if ((w | 0) == 66) {
+                  w = 0;
+                  n = ((e | 0) != 0) | ((n | 0) != 0);
+                  u = ((m | 0) != 0) | n;
+                  n = (A - r + ((n ^ 1) & 1)) | 0;
+                  e = u ? r : y;
+                  r = y;
+                  n = u ? ((m | 0) > (n | 0) ? m : n) : m;
+                  m = (m | 0) > -1 ? s & -65537 : s;
+                } else if ((w | 0) == 83) {
+                  w = 0;
+                  R3(d, 32, k, e, u ^ 8192);
+                  k = (k | 0) > (e | 0) ? k : e;
+                  e = v;
+                  continue;
+                }
+                t = (r - e) | 0;
+                s = (n | 0) < (t | 0) ? t : n;
+                u = (s + o) | 0;
+                k = (k | 0) < (u | 0) ? u : k;
+                R3(d, 32, k, u, m);
+                L3(d, q, o);
+                R3(d, 48, k, u, m ^ 65536);
+                R3(d, 48, s, t, 0);
+                L3(d, e, t);
+                R3(d, 32, k, u, m ^ 8192);
+                e = v;
+              }
+              f: do
+                if ((w | 0) == 86)
+                  if (!d)
+                    if (p) {
+                      j = 1;
+                      while (1) {
+                        e = c[(i + (j << 2)) >> 2] | 0;
+                        if (!e) break;
+                        N3((g + (j << 3)) | 0, e, f);
+                        e = (j + 1) | 0;
+                        if ((j | 0) < 9) j = e;
+                        else {
+                          j = e;
+                          break;
+                        }
+                      }
+                      if ((j | 0) < 10)
+                        while (1) {
+                          if (c[(i + (j << 2)) >> 2] | 0) {
+                            j = -1;
+                            break f;
+                          }
+                          if ((j | 0) < 9) j = (j + 1) | 0;
+                          else {
+                            j = 1;
+                            break;
+                          }
+                        }
+                      else j = 1;
+                    } else j = 0;
+              while (0);
+              l = H;
+              return j | 0;
+            }
+            function J3(a) {
+              a = a | 0;
+              return 0;
+            }
+            function K3(a) {
+              a = a | 0;
+              return;
+            }
+            function L3(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              if (!(c[a >> 2] & 32)) U3(b, d, a) | 0;
+              return;
+            }
+            function M3(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              e = c[b >> 2] | 0;
+              f = ((a[e >> 0] | 0) + -48) | 0;
+              if (f >>> 0 < 10) {
+                d = 0;
+                do {
+                  d = (f + ((d * 10) | 0)) | 0;
+                  e = (e + 1) | 0;
+                  c[b >> 2] = e;
+                  f = ((a[e >> 0] | 0) + -48) | 0;
+                } while (f >>> 0 < 10);
+              } else d = 0;
+              return d | 0;
+            }
+            function N3(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0.0;
+              a: do
+                if (b >>> 0 <= 20)
+                  do
+                    switch (b | 0) {
+                      case 9: {
+                        e = ((c[d >> 2] | 0) + (4 - 1)) & ~(4 - 1);
+                        b = c[e >> 2] | 0;
+                        c[d >> 2] = e + 4;
+                        c[a >> 2] = b;
+                        break a;
+                      }
+                      case 10: {
+                        e = ((c[d >> 2] | 0) + (4 - 1)) & ~(4 - 1);
+                        b = c[e >> 2] | 0;
+                        c[d >> 2] = e + 4;
+                        e = a;
+                        c[e >> 2] = b;
+                        c[(e + 4) >> 2] = (((b | 0) < 0) << 31) >> 31;
+                        break a;
+                      }
+                      case 11: {
+                        e = ((c[d >> 2] | 0) + (4 - 1)) & ~(4 - 1);
+                        b = c[e >> 2] | 0;
+                        c[d >> 2] = e + 4;
+                        e = a;
+                        c[e >> 2] = b;
+                        c[(e + 4) >> 2] = 0;
+                        break a;
+                      }
+                      case 12: {
+                        e = ((c[d >> 2] | 0) + (8 - 1)) & ~(8 - 1);
+                        b = e;
+                        f = c[b >> 2] | 0;
+                        b = c[(b + 4) >> 2] | 0;
+                        c[d >> 2] = e + 8;
+                        e = a;
+                        c[e >> 2] = f;
+                        c[(e + 4) >> 2] = b;
+                        break a;
+                      }
+                      case 13: {
+                        f = ((c[d >> 2] | 0) + (4 - 1)) & ~(4 - 1);
+                        e = c[f >> 2] | 0;
+                        c[d >> 2] = f + 4;
+                        e = ((e & 65535) << 16) >> 16;
+                        f = a;
+                        c[f >> 2] = e;
+                        c[(f + 4) >> 2] = (((e | 0) < 0) << 31) >> 31;
+                        break a;
+                      }
+                      case 14: {
+                        f = ((c[d >> 2] | 0) + (4 - 1)) & ~(4 - 1);
+                        e = c[f >> 2] | 0;
+                        c[d >> 2] = f + 4;
+                        f = a;
+                        c[f >> 2] = e & 65535;
+                        c[(f + 4) >> 2] = 0;
+                        break a;
+                      }
+                      case 15: {
+                        f = ((c[d >> 2] | 0) + (4 - 1)) & ~(4 - 1);
+                        e = c[f >> 2] | 0;
+                        c[d >> 2] = f + 4;
+                        e = ((e & 255) << 24) >> 24;
+                        f = a;
+                        c[f >> 2] = e;
+                        c[(f + 4) >> 2] = (((e | 0) < 0) << 31) >> 31;
+                        break a;
+                      }
+                      case 16: {
+                        f = ((c[d >> 2] | 0) + (4 - 1)) & ~(4 - 1);
+                        e = c[f >> 2] | 0;
+                        c[d >> 2] = f + 4;
+                        f = a;
+                        c[f >> 2] = e & 255;
+                        c[(f + 4) >> 2] = 0;
+                        break a;
+                      }
+                      case 17: {
+                        f = ((c[d >> 2] | 0) + (8 - 1)) & ~(8 - 1);
+                        g = +h[f >> 3];
+                        c[d >> 2] = f + 8;
+                        h[a >> 3] = g;
+                        break a;
+                      }
+                      case 18: {
+                        f = ((c[d >> 2] | 0) + (8 - 1)) & ~(8 - 1);
+                        g = +h[f >> 3];
+                        c[d >> 2] = f + 8;
+                        h[a >> 3] = g;
+                        break a;
+                      }
+                      default:
+                        break a;
+                    }
+                  while (0);
+              while (0);
+              return;
+            }
+            function O3(b, c, e, f) {
+              b = b | 0;
+              c = c | 0;
+              e = e | 0;
+              f = f | 0;
+              if (!(((b | 0) == 0) & ((c | 0) == 0)))
+                do {
+                  e = (e + -1) | 0;
+                  a[e >> 0] = d[(153456 + (b & 15)) >> 0] | 0 | f;
+                  b = Q6(b | 0, c | 0, 4) | 0;
+                  c = z;
+                } while (!(((b | 0) == 0) & ((c | 0) == 0)));
+              return e | 0;
+            }
+            function P3(b, c, d) {
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              if (!(((b | 0) == 0) & ((c | 0) == 0)))
+                do {
+                  d = (d + -1) | 0;
+                  a[d >> 0] = (b & 7) | 48;
+                  b = Q6(b | 0, c | 0, 3) | 0;
+                  c = z;
+                } while (!(((b | 0) == 0) & ((c | 0) == 0)));
+              return d | 0;
+            }
+            function Q3(b, c, d) {
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0;
+              if ((c >>> 0 > 0) | (((c | 0) == 0) & (b >>> 0 > 4294967295))) {
+                while (1) {
+                  e = O6(b | 0, c | 0, 10, 0) | 0;
+                  d = (d + -1) | 0;
+                  a[d >> 0] = (e & 255) | 48;
+                  e = b;
+                  b = N6(b | 0, c | 0, 10, 0) | 0;
+                  if (!((c >>> 0 > 9) | (((c | 0) == 9) & (e >>> 0 > 4294967295)))) break;
+                  else c = z;
+                }
+                c = b;
+              } else c = b;
+              if (c)
+                while (1) {
+                  d = (d + -1) | 0;
+                  a[d >> 0] = (c >>> 0) % 10 | 0 | 48;
+                  if (c >>> 0 < 10) break;
+                  else c = ((c >>> 0) / 10) | 0;
+                }
+              return d | 0;
+            }
+            function R3(a, b, c, d, e) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              g = l;
+              l = (l + 256) | 0;
+              f = g;
+              if (((c | 0) > (d | 0)) & (((e & 73728) | 0) == 0)) {
+                e = (c - d) | 0;
+                Y6(f | 0, b | 0, (e >>> 0 < 256 ? e : 256) | 0) | 0;
+                if (e >>> 0 > 255) {
+                  b = (c - d) | 0;
+                  do {
+                    L3(a, f, 256);
+                    e = (e + -256) | 0;
+                  } while (e >>> 0 > 255);
+                  e = b & 255;
+                }
+                L3(a, f, e);
+              }
+              l = g;
+              return;
+            }
+            function S3(b, e, f, g, h, i) {
+              b = b | 0;
+              e = +e;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              i = i | 0;
+              var j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0.0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0;
+              H = l;
+              l = (l + 560) | 0;
+              m = (H + 8) | 0;
+              u = H;
+              G = (H + 524) | 0;
+              F = G;
+              n = (H + 512) | 0;
+              c[u >> 2] = 0;
+              E = (n + 12) | 0;
+              T3(e) | 0;
+              if ((z | 0) < 0) {
+                e = -e;
+                C = 1;
+                B = 153425;
+              } else {
+                C = (((h & 2049) | 0) != 0) & 1;
+                B = ((h & 2048) | 0) == 0 ? (((h & 1) | 0) == 0 ? 153426 : 153431) : 153428;
+              }
+              T3(e) | 0;
+              do
+                if ((0 == 0) & (((z & 2146435072) | 0) == 2146435072)) {
+                  G = ((i & 32) | 0) != 0;
+                  j = (C + 3) | 0;
+                  R3(b, 32, f, j, h & -65537);
+                  L3(b, B, C);
+                  L3(b, (e != e) | (0.0 != 0.0) ? (G ? 153593 : 153452) : G ? 153444 : 153448, 3);
+                  R3(b, 32, f, j, h ^ 8192);
+                } else {
+                  r = +O2(e, u) * 2.0;
+                  j = r != 0.0;
+                  if (j) c[u >> 2] = (c[u >> 2] | 0) + -1;
+                  w = i | 32;
+                  if ((w | 0) == 97) {
+                    p = i & 32;
+                    s = (p | 0) == 0 ? B : (B + 9) | 0;
+                    q = C | 2;
+                    j = (12 - g) | 0;
+                    do
+                      if (!((g >>> 0 > 11) | ((j | 0) == 0))) {
+                        e = 8.0;
+                        do {
+                          j = (j + -1) | 0;
+                          e = e * 16.0;
+                        } while ((j | 0) != 0);
+                        if ((a[s >> 0] | 0) == 45) {
+                          e = -(e + (-r - e));
+                          break;
+                        } else {
+                          e = r + e - e;
+                          break;
+                        }
+                      } else e = r;
+                    while (0);
+                    k = c[u >> 2] | 0;
+                    j = (k | 0) < 0 ? (0 - k) | 0 : k;
+                    j = Q3(j, (((j | 0) < 0) << 31) >> 31, E) | 0;
+                    if ((j | 0) == (E | 0)) {
+                      j = (n + 11) | 0;
+                      a[j >> 0] = 48;
+                    }
+                    a[(j + -1) >> 0] = ((k >> 31) & 2) + 43;
+                    o = (j + -2) | 0;
+                    a[o >> 0] = i + 15;
+                    m = (g | 0) < 1;
+                    n = ((h & 8) | 0) == 0;
+                    j = G;
+                    do {
+                      D = ~~e;
+                      k = (j + 1) | 0;
+                      a[j >> 0] = p | d[(153456 + D) >> 0];
+                      e = (e - +(D | 0)) * 16.0;
+                      if (((k - F) | 0) == 1 ? !(n & (m & (e == 0.0))) : 0) {
+                        a[k >> 0] = 46;
+                        j = (j + 2) | 0;
+                      } else j = k;
+                    } while (e != 0.0);
+                    if ((g | 0) != 0 ? ((-2 - F + j) | 0) < (g | 0) : 0) {
+                      k = (j - F) | 0;
+                      j = (g + 2) | 0;
+                    } else {
+                      j = (j - F) | 0;
+                      k = j;
+                    }
+                    E = (E - o) | 0;
+                    F = (E + q + j) | 0;
+                    R3(b, 32, f, F, h);
+                    L3(b, s, q);
+                    R3(b, 48, f, F, h ^ 65536);
+                    L3(b, G, k);
+                    R3(b, 48, (j - k) | 0, 0, 0);
+                    L3(b, o, E);
+                    R3(b, 32, f, F, h ^ 8192);
+                    j = F;
+                    break;
+                  }
+                  k = (g | 0) < 0 ? 6 : g;
+                  if (j) {
+                    j = ((c[u >> 2] | 0) + -28) | 0;
+                    c[u >> 2] = j;
+                    e = r * 268435456.0;
+                  } else {
+                    e = r;
+                    j = c[u >> 2] | 0;
+                  }
+                  D = (j | 0) < 0 ? m : (m + 288) | 0;
+                  m = D;
+                  do {
+                    y = ~~e >>> 0;
+                    c[m >> 2] = y;
+                    m = (m + 4) | 0;
+                    e = (e - +(y >>> 0)) * 1.0e9;
+                  } while (e != 0.0);
+                  if ((j | 0) > 0) {
+                    n = D;
+                    p = m;
+                    while (1) {
+                      o = (j | 0) < 29 ? j : 29;
+                      j = (p + -4) | 0;
+                      if (j >>> 0 >= n >>> 0) {
+                        m = 0;
+                        do {
+                          x = R6(c[j >> 2] | 0, 0, o | 0) | 0;
+                          x = J6(x | 0, z | 0, m | 0, 0) | 0;
+                          y = z;
+                          v = O6(x | 0, y | 0, 1e9, 0) | 0;
+                          c[j >> 2] = v;
+                          m = N6(x | 0, y | 0, 1e9, 0) | 0;
+                          j = (j + -4) | 0;
+                        } while (j >>> 0 >= n >>> 0);
+                        if (m) {
+                          n = (n + -4) | 0;
+                          c[n >> 2] = m;
+                        }
+                      }
+                      m = p;
+                      while (1) {
+                        if (m >>> 0 <= n >>> 0) break;
+                        j = (m + -4) | 0;
+                        if (!(c[j >> 2] | 0)) m = j;
+                        else break;
+                      }
+                      j = ((c[u >> 2] | 0) - o) | 0;
+                      c[u >> 2] = j;
+                      if ((j | 0) > 0) p = m;
+                      else break;
+                    }
+                  } else n = D;
+                  if ((j | 0) < 0) {
+                    g = (((((k + 25) | 0) / 9) | 0) + 1) | 0;
+                    t = (w | 0) == 102;
+                    do {
+                      s = (0 - j) | 0;
+                      s = (s | 0) < 9 ? s : 9;
+                      if (n >>> 0 < m >>> 0) {
+                        o = ((1 << s) + -1) | 0;
+                        p = 1e9 >>> s;
+                        q = 0;
+                        j = n;
+                        do {
+                          y = c[j >> 2] | 0;
+                          c[j >> 2] = (y >>> s) + q;
+                          q = O(y & o, p) | 0;
+                          j = (j + 4) | 0;
+                        } while (j >>> 0 < m >>> 0);
+                        j = (c[n >> 2] | 0) == 0 ? (n + 4) | 0 : n;
+                        if (!q) {
+                          n = j;
+                          j = m;
+                        } else {
+                          c[m >> 2] = q;
+                          n = j;
+                          j = (m + 4) | 0;
+                        }
+                      } else {
+                        n = (c[n >> 2] | 0) == 0 ? (n + 4) | 0 : n;
+                        j = m;
+                      }
+                      m = t ? D : n;
+                      m = (((j - m) >> 2) | 0) > (g | 0) ? (m + (g << 2)) | 0 : j;
+                      j = ((c[u >> 2] | 0) + s) | 0;
+                      c[u >> 2] = j;
+                    } while ((j | 0) < 0);
+                    j = n;
+                    g = m;
+                  } else {
+                    j = n;
+                    g = m;
+                  }
+                  y = D;
+                  if (j >>> 0 < g >>> 0) {
+                    m = (((y - j) >> 2) * 9) | 0;
+                    o = c[j >> 2] | 0;
+                    if (o >>> 0 >= 10) {
+                      n = 10;
+                      do {
+                        n = (n * 10) | 0;
+                        m = (m + 1) | 0;
+                      } while (o >>> 0 >= n >>> 0);
+                    }
+                  } else m = 0;
+                  t = (w | 0) == 103;
+                  v = (k | 0) != 0;
+                  n = (k - ((w | 0) != 102 ? m : 0) + (((v & t) << 31) >> 31)) | 0;
+                  if ((n | 0) < ((((((g - y) >> 2) * 9) | 0) + -9) | 0)) {
+                    n = (n + 9216) | 0;
+                    s = (D + 4 + (((((n | 0) / 9) | 0) + -1024) << 2)) | 0;
+                    n = (n | 0) % 9 | 0;
+                    if ((n | 0) < 8) {
+                      o = 10;
+                      while (1) {
+                        o = (o * 10) | 0;
+                        if ((n | 0) < 7) n = (n + 1) | 0;
+                        else break;
+                      }
+                    } else o = 10;
+                    p = c[s >> 2] | 0;
+                    q = (p >>> 0) % (o >>> 0) | 0;
+                    n = ((s + 4) | 0) == (g | 0);
+                    if (!(n & ((q | 0) == 0))) {
+                      r = (((((p >>> 0) / (o >>> 0)) | 0) & 1) | 0) == 0 ? 9007199254740992.0 : 9007199254740994.0;
+                      x = ((o | 0) / 2) | 0;
+                      e = q >>> 0 < x >>> 0 ? 0.5 : n & ((q | 0) == (x | 0)) ? 1.0 : 1.5;
+                      if (C) {
+                        x = (a[B >> 0] | 0) == 45;
+                        e = x ? -e : e;
+                        r = x ? -r : r;
+                      }
+                      n = (p - q) | 0;
+                      c[s >> 2] = n;
+                      if (r + e != r) {
+                        x = (n + o) | 0;
+                        c[s >> 2] = x;
+                        if (x >>> 0 > 999999999) {
+                          m = s;
+                          while (1) {
+                            n = (m + -4) | 0;
+                            c[m >> 2] = 0;
+                            if (n >>> 0 < j >>> 0) {
+                              j = (j + -4) | 0;
+                              c[j >> 2] = 0;
+                            }
+                            x = ((c[n >> 2] | 0) + 1) | 0;
+                            c[n >> 2] = x;
+                            if (x >>> 0 > 999999999) m = n;
+                            else break;
+                          }
+                        } else n = s;
+                        m = (((y - j) >> 2) * 9) | 0;
+                        p = c[j >> 2] | 0;
+                        if (p >>> 0 >= 10) {
+                          o = 10;
+                          do {
+                            o = (o * 10) | 0;
+                            m = (m + 1) | 0;
+                          } while (p >>> 0 >= o >>> 0);
+                        }
+                      } else n = s;
+                    } else n = s;
+                    n = (n + 4) | 0;
+                    n = g >>> 0 > n >>> 0 ? n : g;
+                    x = j;
+                  } else {
+                    n = g;
+                    x = j;
+                  }
+                  w = n;
+                  while (1) {
+                    if (w >>> 0 <= x >>> 0) {
+                      u = 0;
+                      break;
+                    }
+                    j = (w + -4) | 0;
+                    if (!(c[j >> 2] | 0)) w = j;
+                    else {
+                      u = 1;
+                      break;
+                    }
+                  }
+                  g = (0 - m) | 0;
+                  do
+                    if (t) {
+                      j = (k + ((v ^ 1) & 1)) | 0;
+                      if (((j | 0) > (m | 0)) & ((m | 0) > -5)) {
+                        o = (i + -1) | 0;
+                        k = (j + -1 - m) | 0;
+                      } else {
+                        o = (i + -2) | 0;
+                        k = (j + -1) | 0;
+                      }
+                      j = h & 8;
+                      if (!j) {
+                        if (u ? ((A = c[(w + -4) >> 2] | 0), (A | 0) != 0) : 0)
+                          if (!((A >>> 0) % 10 | 0)) {
+                            n = 0;
+                            j = 10;
+                            do {
+                              j = (j * 10) | 0;
+                              n = (n + 1) | 0;
+                            } while (!((A >>> 0) % (j >>> 0) | 0 | 0));
+                          } else n = 0;
+                        else n = 9;
+                        j = (((((w - y) >> 2) * 9) | 0) + -9) | 0;
+                        if ((o | 32 | 0) == 102) {
+                          s = (j - n) | 0;
+                          s = (s | 0) > 0 ? s : 0;
+                          k = (k | 0) < (s | 0) ? k : s;
+                          s = 0;
+                          break;
+                        } else {
+                          s = (j + m - n) | 0;
+                          s = (s | 0) > 0 ? s : 0;
+                          k = (k | 0) < (s | 0) ? k : s;
+                          s = 0;
+                          break;
+                        }
+                      } else s = j;
+                    } else {
+                      o = i;
+                      s = h & 8;
+                    }
+                  while (0);
+                  t = k | s;
+                  p = ((t | 0) != 0) & 1;
+                  q = (o | 32 | 0) == 102;
+                  if (q) {
+                    v = 0;
+                    j = (m | 0) > 0 ? m : 0;
+                  } else {
+                    j = (m | 0) < 0 ? g : m;
+                    j = Q3(j, (((j | 0) < 0) << 31) >> 31, E) | 0;
+                    n = E;
+                    if (((n - j) | 0) < 2)
+                      do {
+                        j = (j + -1) | 0;
+                        a[j >> 0] = 48;
+                      } while (((n - j) | 0) < 2);
+                    a[(j + -1) >> 0] = ((m >> 31) & 2) + 43;
+                    j = (j + -2) | 0;
+                    a[j >> 0] = o;
+                    v = j;
+                    j = (n - j) | 0;
+                  }
+                  j = (C + 1 + k + p + j) | 0;
+                  R3(b, 32, f, j, h);
+                  L3(b, B, C);
+                  R3(b, 48, f, j, h ^ 65536);
+                  if (q) {
+                    o = x >>> 0 > D >>> 0 ? D : x;
+                    s = (G + 9) | 0;
+                    p = s;
+                    q = (G + 8) | 0;
+                    n = o;
+                    do {
+                      m = Q3(c[n >> 2] | 0, 0, s) | 0;
+                      if ((n | 0) == (o | 0)) {
+                        if ((m | 0) == (s | 0)) {
+                          a[q >> 0] = 48;
+                          m = q;
+                        }
+                      } else if (m >>> 0 > G >>> 0) {
+                        Y6(G | 0, 48, (m - F) | 0) | 0;
+                        do m = (m + -1) | 0;
+                        while (m >>> 0 > G >>> 0);
+                      }
+                      L3(b, m, (p - m) | 0);
+                      n = (n + 4) | 0;
+                    } while (n >>> 0 <= D >>> 0);
+                    if (t | 0) L3(b, 153472, 1);
+                    if ((n >>> 0 < w >>> 0) & ((k | 0) > 0))
+                      while (1) {
+                        m = Q3(c[n >> 2] | 0, 0, s) | 0;
+                        if (m >>> 0 > G >>> 0) {
+                          Y6(G | 0, 48, (m - F) | 0) | 0;
+                          do m = (m + -1) | 0;
+                          while (m >>> 0 > G >>> 0);
+                        }
+                        L3(b, m, (k | 0) < 9 ? k : 9);
+                        n = (n + 4) | 0;
+                        m = (k + -9) | 0;
+                        if (!((n >>> 0 < w >>> 0) & ((k | 0) > 9))) {
+                          k = m;
+                          break;
+                        } else k = m;
+                      }
+                    R3(b, 48, (k + 9) | 0, 9, 0);
+                  } else {
+                    t = u ? w : (x + 4) | 0;
+                    if ((k | 0) > -1) {
+                      u = (G + 9) | 0;
+                      s = (s | 0) == 0;
+                      g = u;
+                      p = (0 - F) | 0;
+                      q = (G + 8) | 0;
+                      o = x;
+                      do {
+                        m = Q3(c[o >> 2] | 0, 0, u) | 0;
+                        if ((m | 0) == (u | 0)) {
+                          a[q >> 0] = 48;
+                          m = q;
+                        }
+                        do
+                          if ((o | 0) == (x | 0)) {
+                            n = (m + 1) | 0;
+                            L3(b, m, 1);
+                            if (s & ((k | 0) < 1)) {
+                              m = n;
+                              break;
+                            }
+                            L3(b, 153472, 1);
+                            m = n;
+                          } else {
+                            if (m >>> 0 <= G >>> 0) break;
+                            Y6(G | 0, 48, (m + p) | 0) | 0;
+                            do m = (m + -1) | 0;
+                            while (m >>> 0 > G >>> 0);
+                          }
+                        while (0);
+                        F = (g - m) | 0;
+                        L3(b, m, (k | 0) > (F | 0) ? F : k);
+                        k = (k - F) | 0;
+                        o = (o + 4) | 0;
+                      } while ((o >>> 0 < t >>> 0) & ((k | 0) > -1));
+                    }
+                    R3(b, 48, (k + 18) | 0, 18, 0);
+                    L3(b, v, (E - v) | 0);
+                  }
+                  R3(b, 32, f, j, h ^ 8192);
+                }
+              while (0);
+              l = H;
+              return ((j | 0) < (f | 0) ? f : j) | 0;
+            }
+            function T3(a) {
+              a = +a;
+              var b = 0;
+              h[j >> 3] = a;
+              b = c[j >> 2] | 0;
+              z = c[(j + 4) >> 2] | 0;
+              return b | 0;
+            }
+            function U3(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              f = (e + 16) | 0;
+              g = c[f >> 2] | 0;
+              if (!g)
+                if (!(V3(e) | 0)) {
+                  g = c[f >> 2] | 0;
+                  h = 5;
+                } else f = 0;
+              else h = 5;
+              a: do
+                if ((h | 0) == 5) {
+                  j = (e + 20) | 0;
+                  i = c[j >> 2] | 0;
+                  f = i;
+                  if (((g - i) | 0) >>> 0 < d >>> 0) {
+                    f = nb[c[(e + 36) >> 2] & 63](e, b, d) | 0;
+                    break;
+                  }
+                  b: do
+                    if ((a[(e + 75) >> 0] | 0) > -1) {
+                      i = d;
+                      while (1) {
+                        if (!i) {
+                          h = 0;
+                          g = b;
+                          break b;
+                        }
+                        g = (i + -1) | 0;
+                        if ((a[(b + g) >> 0] | 0) == 10) break;
+                        else i = g;
+                      }
+                      f = nb[c[(e + 36) >> 2] & 63](e, b, i) | 0;
+                      if (f >>> 0 < i >>> 0) break a;
+                      h = i;
+                      g = (b + i) | 0;
+                      d = (d - i) | 0;
+                      f = c[j >> 2] | 0;
+                    } else {
+                      h = 0;
+                      g = b;
+                    }
+                  while (0);
+                  W6(f | 0, g | 0, d | 0) | 0;
+                  c[j >> 2] = (c[j >> 2] | 0) + d;
+                  f = (h + d) | 0;
+                }
+              while (0);
+              return f | 0;
+            }
+            function V3(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = (b + 74) | 0;
+              e = a[d >> 0] | 0;
+              a[d >> 0] = (e + 255) | e;
+              d = c[b >> 2] | 0;
+              if (!(d & 8)) {
+                c[(b + 8) >> 2] = 0;
+                c[(b + 4) >> 2] = 0;
+                e = c[(b + 44) >> 2] | 0;
+                c[(b + 28) >> 2] = e;
+                c[(b + 20) >> 2] = e;
+                c[(b + 16) >> 2] = e + (c[(b + 48) >> 2] | 0);
+                b = 0;
+              } else {
+                c[b >> 2] = d | 32;
+                b = -1;
+              }
+              return b | 0;
+            }
+            function W3(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = (a + 20) | 0;
+              f = c[e >> 2] | 0;
+              a = ((c[(a + 16) >> 2] | 0) - f) | 0;
+              a = a >>> 0 > d >>> 0 ? d : a;
+              W6(f | 0, b | 0, a | 0) | 0;
+              c[e >> 2] = (c[e >> 2] | 0) + a;
+              return d | 0;
+            }
+            function X3(b) {
+              b = b | 0;
+              var c = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              e = a[b >> 0] | 0;
+              c = 1;
+              d = 153474;
+              f = 97;
+              while (1) {
+                if ((e << 24) >> 24 == (f << 24) >> 24 ? (s2(b, d) | 0) == 0 : 0) break;
+                d = (d + 6) | 0;
+                f = a[d >> 0] | 0;
+                if (!((f << 24) >> 24)) {
+                  c = 0;
+                  break;
+                } else c = (c + 1) | 0;
+              }
+              return c | 0;
+            }
+            function Y3(a) {
+              a = a | 0;
+              var b = 0;
+              b = (F3(a) | 0) == 0;
+              return (b ? a : a & 95) | 0;
+            }
+            function Z3(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = l;
+              l = (l + 16) | 0;
+              g = h;
+              do
+                if (b >>> 0 > 6) d = 0;
+                else {
+                  ta(190656);
+                  if ((b | 0) != 6) {
+                    d = _3(b, d) | 0;
+                    La(190656);
+                    break;
+                  }
+                  if (!d) {
+                    d = 197132;
+                    b = 0;
+                  } else {
+                    b = g;
+                    e = 153547;
+                    f = (b + 16) | 0;
+                    do {
+                      a[b >> 0] = a[e >> 0] | 0;
+                      b = (b + 1) | 0;
+                      e = (e + 1) | 0;
+                    } while ((b | 0) < (f | 0));
+                    f = 0;
+                    do {
+                      b = k2(d, 59) | 0;
+                      e = (b - d) | 0;
+                      if ((e | 0) < 16) {
+                        W6(g | 0, d | 0, e | 0) | 0;
+                        a[(g + e) >> 0] = 0;
+                        d = (a[b >> 0] | 0) == 0 ? d : (b + 1) | 0;
+                      }
+                      _3(f, g) | 0;
+                      f = (f + 1) | 0;
+                    } while ((f | 0) != 6);
+                    d = 197132;
+                    b = 0;
+                  }
+                  while (1) {
+                    f = c[(190616 + (b << 2)) >> 2] | 0;
+                    f = f | 0 ? (f + 8) | 0 : 153563;
+                    e = l2(f) | 0;
+                    W6(d | 0, f | 0, e | 0) | 0;
+                    f = (d + e) | 0;
+                    a[f >> 0] = 59;
+                    b = (b + 1) | 0;
+                    if ((b | 0) == 6) break;
+                    else d = (d + (e + 1)) | 0;
+                  }
+                  a[f >> 0] = 0;
+                  La(190656);
+                  d = 197132;
+                }
+              while (0);
+              l = h;
+              return d | 0;
+            }
+            function _3(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if (!b) a = c[(190616 + (a << 2)) >> 2] | 0;
+              else {
+                b = q3(a, b) | 0;
+                c[(190616 + (a << 2)) >> 2] = b;
+                a = b;
+              }
+              return (a | 0 ? (a + 8) | 0 : 153563) | 0;
+            }
+            function $3(b, c, d) {
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              a: do
+                if (!d) b = 0;
+                else {
+                  while (1) {
+                    e = a[b >> 0] | 0;
+                    f = a[c >> 0] | 0;
+                    if ((e << 24) >> 24 != (f << 24) >> 24) break;
+                    d = (d + -1) | 0;
+                    if (!d) {
+                      b = 0;
+                      break a;
+                    } else {
+                      b = (b + 1) | 0;
+                      c = (c + 1) | 0;
+                    }
+                  }
+                  b = ((e & 255) - (f & 255)) | 0;
+                }
+              while (0);
+              return b | 0;
+            }
+            function a4(a) {
+              a = a | 0;
+              return b4(a) | 0;
+            }
+            function b4(a) {
+              a = a | 0;
+              return S6(a | 0) | 0;
+            }
+            function c4(b, e, f) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              if ((c[(f + 76) >> 2] | 0) > -1) m = J3(f) | 0;
+              else m = 0;
+              g = (e + -1) | 0;
+              if ((e | 0) < 2) {
+                n = (f + 74) | 0;
+                l = a[n >> 0] | 0;
+                a[n >> 0] = (l + 255) | l;
+                if (m | 0) K3(f);
+                if (!g) a[b >> 0] = 0;
+                else b = 0;
+              } else {
+                a: do
+                  if (g) {
+                    k = (f + 4) | 0;
+                    l = (f + 8) | 0;
+                    e = b;
+                    while (1) {
+                      h = c[k >> 2] | 0;
+                      o = h;
+                      p = ((c[l >> 2] | 0) - o) | 0;
+                      i = U2(h, 10, p) | 0;
+                      j = (i | 0) == 0;
+                      i = j ? p : (1 - o + i) | 0;
+                      i = i >>> 0 < g >>> 0 ? i : g;
+                      W6(e | 0, h | 0, i | 0) | 0;
+                      h = ((c[k >> 2] | 0) + i) | 0;
+                      c[k >> 2] = h;
+                      e = (e + i) | 0;
+                      i = (g - i) | 0;
+                      if (!(j & ((i | 0) != 0))) {
+                        n = 17;
+                        break a;
+                      }
+                      if (h >>> 0 >= (c[l >> 2] | 0) >>> 0) {
+                        g = Z2(f) | 0;
+                        if ((g | 0) < 0) break;
+                        else j = g;
+                      } else {
+                        c[k >> 2] = h + 1;
+                        j = d[h >> 0] | 0;
+                      }
+                      g = (i + -1) | 0;
+                      h = (e + 1) | 0;
+                      a[e >> 0] = j;
+                      if (!(((g | 0) != 0) & (((j & 255) | 0) != 10))) {
+                        e = h;
+                        n = 17;
+                        break a;
+                      } else e = h;
+                    }
+                    if ((e | 0) != (b | 0) ? ((c[f >> 2] & 16) | 0) != 0 : 0) n = 17;
+                    else b = 0;
+                  } else {
+                    e = b;
+                    n = 17;
+                  }
+                while (0);
+                if ((n | 0) == 17)
+                  if (!b) b = 0;
+                  else a[e >> 0] = 0;
+                if (m) K3(f);
+              }
+              return b | 0;
+            }
+            function d4(b, c) {
+              b = b | 0;
+              c = c | 0;
+              var d = 0;
+              d = a[c >> 0] | 0;
+              do
+                if ((d << 24) >> 24) {
+                  b = R2(b, (d << 24) >> 24) | 0;
+                  if (b) {
+                    if (a[(c + 1) >> 0] | 0)
+                      if (a[(b + 1) >> 0] | 0) {
+                        if (!(a[(c + 2) >> 0] | 0)) {
+                          b = e4(b, c) | 0;
+                          break;
+                        }
+                        if (a[(b + 2) >> 0] | 0) {
+                          if (!(a[(c + 3) >> 0] | 0)) {
+                            b = f4(b, c) | 0;
+                            break;
+                          }
+                          if (a[(b + 3) >> 0] | 0)
+                            if (!(a[(c + 4) >> 0] | 0)) {
+                              b = g4(b, c) | 0;
+                              break;
+                            } else {
+                              b = h4(b, c) | 0;
+                              break;
+                            }
+                          else b = 0;
+                        } else b = 0;
+                      } else b = 0;
+                  } else b = 0;
+                }
+              while (0);
+              return b | 0;
+            }
+            function e4(b, c) {
+              b = b | 0;
+              c = c | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              g = ((d[c >> 0] | 0) << 8) | (d[(c + 1) >> 0] | 0);
+              f = d[b >> 0] | 0;
+              while (1) {
+                c = (b + 1) | 0;
+                e = a[c >> 0] | 0;
+                if (!((e << 24) >> 24)) break;
+                f = ((f << 8) & 65280) | (e & 255);
+                if ((f | 0) == (g | 0)) break;
+                else b = c;
+              }
+              return ((e << 24) >> 24 ? b : 0) | 0;
+            }
+            function f4(b, c) {
+              b = b | 0;
+              c = c | 0;
+              var e = 0,
+                f = 0;
+              f = ((d[(c + 1) >> 0] | 0) << 16) | ((d[c >> 0] | 0) << 24) | ((d[(c + 2) >> 0] | 0) << 8);
+              e = (b + 2) | 0;
+              c = a[e >> 0] | 0;
+              b = ((d[(b + 1) >> 0] | 0) << 16) | ((d[b >> 0] | 0) << 24) | ((c & 255) << 8);
+              if (!(((b | 0) == (f | 0)) | ((c << 24) >> 24 == 0)))
+                do {
+                  e = (e + 1) | 0;
+                  c = a[e >> 0] | 0;
+                  b = (b | (c & 255)) << 8;
+                } while (!(((b | 0) == (f | 0)) | ((c << 24) >> 24 == 0)));
+              return ((c << 24) >> 24 ? (e + -2) | 0 : 0) | 0;
+            }
+            function g4(b, c) {
+              b = b | 0;
+              c = c | 0;
+              var e = 0,
+                f = 0;
+              f =
+                ((d[(c + 1) >> 0] | 0) << 16) |
+                ((d[c >> 0] | 0) << 24) |
+                ((d[(c + 2) >> 0] | 0) << 8) |
+                (d[(c + 3) >> 0] | 0);
+              c = (b + 3) | 0;
+              e = a[c >> 0] | 0;
+              b = ((d[(b + 1) >> 0] | 0) << 16) | ((d[b >> 0] | 0) << 24) | ((d[(b + 2) >> 0] | 0) << 8) | (e & 255);
+              if (!(((e << 24) >> 24 == 0) | ((b | 0) == (f | 0))))
+                do {
+                  c = (c + 1) | 0;
+                  e = a[c >> 0] | 0;
+                  b = (b << 8) | (e & 255);
+                } while (!(((e << 24) >> 24 == 0) | ((b | 0) == (f | 0))));
+              return ((e << 24) >> 24 ? (c + -3) | 0 : 0) | 0;
+            }
+            function h4(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0;
+              v = l;
+              l = (l + 1056) | 0;
+              t = (v + 1024) | 0;
+              u = v;
+              c[t >> 2] = 0;
+              c[(t + 4) >> 2] = 0;
+              c[(t + 8) >> 2] = 0;
+              c[(t + 12) >> 2] = 0;
+              c[(t + 16) >> 2] = 0;
+              c[(t + 20) >> 2] = 0;
+              c[(t + 24) >> 2] = 0;
+              c[(t + 28) >> 2] = 0;
+              e = a[d >> 0] | 0;
+              a: do
+                if ((e << 24) >> 24) {
+                  s = 0;
+                  do {
+                    if (!(a[(b + s) >> 0] | 0)) {
+                      e = 0;
+                      break a;
+                    }
+                    r = (t + ((((e & 255) >>> 5) & 255) << 2)) | 0;
+                    c[r >> 2] = c[r >> 2] | (1 << (e & 31));
+                    s = (s + 1) | 0;
+                    c[(u + ((e & 255) << 2)) >> 2] = s;
+                    e = a[(d + s) >> 0] | 0;
+                  } while ((e << 24) >> 24 != 0);
+                  m = s >>> 0 > 1;
+                  if (m) {
+                    f = 0;
+                    k = -1;
+                    g = 1;
+                    b: while (1) {
+                      h = 1;
+                      e = f;
+                      while (1) {
+                        f = g;
+                        c: while (1) {
+                          j = 1;
+                          while (1) {
+                            g = a[(d + (j + k)) >> 0] | 0;
+                            i = a[(d + f) >> 0] | 0;
+                            if ((g << 24) >> 24 != (i << 24) >> 24) break c;
+                            if ((j | 0) == (h | 0)) break;
+                            j = (j + 1) | 0;
+                            f = (j + e) | 0;
+                            if (f >>> 0 >= s >>> 0) {
+                              n = h;
+                              e = k;
+                              break b;
+                            }
+                          }
+                          e = (h + e) | 0;
+                          f = (e + 1) | 0;
+                          if (f >>> 0 >= s >>> 0) {
+                            n = h;
+                            e = k;
+                            break b;
+                          }
+                        }
+                        h = (f - k) | 0;
+                        if ((g & 255) <= (i & 255)) break;
+                        g = (f + 1) | 0;
+                        if (g >>> 0 >= s >>> 0) {
+                          n = h;
+                          e = k;
+                          break b;
+                        } else e = f;
+                      }
+                      g = (e + 2) | 0;
+                      if (g >>> 0 >= s >>> 0) {
+                        n = 1;
+                        break;
+                      } else {
+                        f = (e + 1) | 0;
+                        k = e;
+                      }
+                    }
+                    if (m) {
+                      h = 0;
+                      m = -1;
+                      i = 1;
+                      while (1) {
+                        f = 1;
+                        g = h;
+                        while (1) {
+                          h = i;
+                          d: while (1) {
+                            k = 1;
+                            while (1) {
+                              i = a[(d + (k + m)) >> 0] | 0;
+                              j = a[(d + h) >> 0] | 0;
+                              if ((i << 24) >> 24 != (j << 24) >> 24) break d;
+                              if ((k | 0) == (f | 0)) break;
+                              k = (k + 1) | 0;
+                              h = (k + g) | 0;
+                              if (h >>> 0 >= s >>> 0) {
+                                i = n;
+                                g = m;
+                                h = 26;
+                                break a;
+                              }
+                            }
+                            g = (f + g) | 0;
+                            h = (g + 1) | 0;
+                            if (h >>> 0 >= s >>> 0) {
+                              i = n;
+                              g = m;
+                              h = 26;
+                              break a;
+                            }
+                          }
+                          f = (h - m) | 0;
+                          if ((i & 255) >= (j & 255)) break;
+                          i = (h + 1) | 0;
+                          if (i >>> 0 >= s >>> 0) {
+                            i = n;
+                            g = m;
+                            h = 26;
+                            break a;
+                          } else g = h;
+                        }
+                        i = (g + 2) | 0;
+                        if (i >>> 0 >= s >>> 0) {
+                          i = n;
+                          f = 1;
+                          h = 26;
+                          break;
+                        } else {
+                          h = (g + 1) | 0;
+                          m = g;
+                        }
+                      }
+                    } else {
+                      i = n;
+                      f = 1;
+                      g = -1;
+                      h = 26;
+                    }
+                  } else {
+                    i = 1;
+                    e = -1;
+                    f = 1;
+                    g = -1;
+                    h = 26;
+                  }
+                } else {
+                  i = 1;
+                  e = -1;
+                  s = 0;
+                  f = 1;
+                  g = -1;
+                  h = 26;
+                }
+              while (0);
+              e: do
+                if ((h | 0) == 26) {
+                  q = ((g + 1) | 0) >>> 0 > ((e + 1) | 0) >>> 0;
+                  f = q ? f : i;
+                  q = q ? g : e;
+                  r = (q + 1) | 0;
+                  if (!($3(d, (d + f) | 0, r) | 0)) p = (s - f) | 0;
+                  else {
+                    f = (s - q + -1) | 0;
+                    p = 0;
+                    f = ((q >>> 0 > f >>> 0 ? q : f) + 1) | 0;
+                  }
+                  k = s | 63;
+                  m = (s + -1) | 0;
+                  n = (p | 0) != 0;
+                  o = (s - f) | 0;
+                  e = b;
+                  j = 0;
+                  g = b;
+                  while (1) {
+                    h = e;
+                    do
+                      if (((g - h) | 0) >>> 0 < s >>> 0) {
+                        i = U2(g, 0, k) | 0;
+                        if (i)
+                          if (((i - h) | 0) >>> 0 < s >>> 0) {
+                            e = 0;
+                            break e;
+                          } else break;
+                        else {
+                          i = (g + k) | 0;
+                          break;
+                        }
+                      } else i = g;
+                    while (0);
+                    g = a[(e + m) >> 0] | 0;
+                    f: do
+                      if (!((1 << (g & 31)) & c[(t + ((((g & 255) >>> 5) & 255) << 2)) >> 2])) {
+                        h = 0;
+                        g = s;
+                      } else {
+                        g = (s - (c[(u + ((g & 255) << 2)) >> 2] | 0)) | 0;
+                        if (g | 0) {
+                          h = 0;
+                          g = n & ((j | 0) != 0) & (g >>> 0 < f >>> 0) ? o : g;
+                          break;
+                        }
+                        g = r >>> 0 > j >>> 0 ? r : j;
+                        h = a[(d + g) >> 0] | 0;
+                        g: do
+                          if (!((h << 24) >> 24)) g = r;
+                          else {
+                            while (1) {
+                              if ((h << 24) >> 24 != (a[(e + g) >> 0] | 0)) break;
+                              g = (g + 1) | 0;
+                              h = a[(d + g) >> 0] | 0;
+                              if (!((h << 24) >> 24)) {
+                                g = r;
+                                break g;
+                              }
+                            }
+                            h = 0;
+                            g = (g - q) | 0;
+                            break f;
+                          }
+                        while (0);
+                        while (1) {
+                          if (g >>> 0 <= j >>> 0) break e;
+                          g = (g + -1) | 0;
+                          if ((a[(d + g) >> 0] | 0) != (a[(e + g) >> 0] | 0)) {
+                            h = p;
+                            g = f;
+                            break;
+                          }
+                        }
+                      }
+                    while (0);
+                    e = (e + g) | 0;
+                    j = h;
+                    g = i;
+                  }
+                }
+              while (0);
+              l = v;
+              return e | 0;
+            }
+            function i4(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              j4(a, b, c) | 0;
+              return a | 0;
+            }
+            function j4(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              g = d;
+              a: do
+                if (!((g ^ b) & 3)) {
+                  f = (e | 0) != 0;
+                  if (f & (((g & 3) | 0) != 0))
+                    do {
+                      g = a[d >> 0] | 0;
+                      a[b >> 0] = g;
+                      if (!((g << 24) >> 24)) break a;
+                      e = (e + -1) | 0;
+                      d = (d + 1) | 0;
+                      b = (b + 1) | 0;
+                      f = (e | 0) != 0;
+                    } while (f & (((d & 3) | 0) != 0));
+                  if (f) {
+                    if (a[d >> 0] | 0) {
+                      b: do
+                        if (e >>> 0 > 3) {
+                          f = d;
+                          while (1) {
+                            d = c[f >> 2] | 0;
+                            if ((((d & -2139062144) ^ -2139062144) & (d + -16843009)) | 0) {
+                              d = f;
+                              break b;
+                            }
+                            c[b >> 2] = d;
+                            e = (e + -4) | 0;
+                            d = (f + 4) | 0;
+                            b = (b + 4) | 0;
+                            if (e >>> 0 > 3) f = d;
+                            else break;
+                          }
+                        }
+                      while (0);
+                      h = 11;
+                    }
+                  } else e = 0;
+                } else h = 11;
+              while (0);
+              c: do
+                if ((h | 0) == 11)
+                  if (!e) e = 0;
+                  else
+                    while (1) {
+                      h = a[d >> 0] | 0;
+                      a[b >> 0] = h;
+                      if (!((h << 24) >> 24)) break c;
+                      e = (e + -1) | 0;
+                      b = (b + 1) | 0;
+                      if (!e) {
+                        e = 0;
+                        break;
+                      } else d = (d + 1) | 0;
+                    }
+              while (0);
+              Y6(b | 0, 0, e | 0) | 0;
+              return b | 0;
+            }
+            function k4(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              g = l;
+              l = (l + 32) | 0;
+              f = g;
+              c[f >> 2] = 0;
+              c[(f + 4) >> 2] = 0;
+              c[(f + 8) >> 2] = 0;
+              c[(f + 12) >> 2] = 0;
+              c[(f + 16) >> 2] = 0;
+              c[(f + 20) >> 2] = 0;
+              c[(f + 24) >> 2] = 0;
+              c[(f + 28) >> 2] = 0;
+              e = a[d >> 0] | 0;
+              do
+                if (!((e << 24) >> 24)) d = 0;
+                else {
+                  if (!(a[(d + 1) >> 0] | 0)) {
+                    d = b;
+                    while (1)
+                      if ((a[d >> 0] | 0) == (e << 24) >> 24) d = (d + 1) | 0;
+                      else break;
+                    d = (d - b) | 0;
+                    break;
+                  }
+                  do {
+                    h = (f + ((((e & 255) >>> 5) & 255) << 2)) | 0;
+                    c[h >> 2] = c[h >> 2] | (1 << (e & 31));
+                    d = (d + 1) | 0;
+                    e = a[d >> 0] | 0;
+                  } while ((e << 24) >> 24 != 0);
+                  e = a[b >> 0] | 0;
+                  a: do
+                    if (!((e << 24) >> 24)) d = b;
+                    else {
+                      d = b;
+                      do {
+                        if (!(c[(f + ((((e & 255) >>> 5) & 255) << 2)) >> 2] & (1 << (e & 31)))) break a;
+                        d = (d + 1) | 0;
+                        e = a[d >> 0] | 0;
+                      } while ((e << 24) >> 24 != 0);
+                    }
+                  while (0);
+                  d = (d - b) | 0;
+                }
+              while (0);
+              l = g;
+              return d | 0;
+            }
+            function l4(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = l;
+              l = (l + 16) | 0;
+              d = b;
+              c[d >> 2] = e2(a) | 0;
+              a = Ja(6, d | 0) | 0;
+              a = c2((a | 0) == -4 ? 0 : a) | 0;
+              l = b;
+              return a | 0;
+            }
+            function m4(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = l;
+              l = (l + 16) | 0;
+              f = e;
+              c[f >> 2] = d;
+              d = n4(a, b, f) | 0;
+              l = e;
+              return d | 0;
+            }
+            function n4(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              return G3(a, 2147483647, b, c) | 0;
+            }
+            function o4(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              m = l;
+              l = (l + 208) | 0;
+              j = (m + 8) | 0;
+              k = m;
+              h = O(d, b) | 0;
+              i = k;
+              c[i >> 2] = 1;
+              c[(i + 4) >> 2] = 0;
+              a: do
+                if (h | 0) {
+                  i = (0 - d) | 0;
+                  c[(j + 4) >> 2] = d;
+                  c[j >> 2] = d;
+                  f = 2;
+                  b = d;
+                  g = d;
+                  while (1) {
+                    b = (b + d + g) | 0;
+                    c[(j + (f << 2)) >> 2] = b;
+                    if (b >>> 0 < h >>> 0) {
+                      n = g;
+                      f = (f + 1) | 0;
+                      g = b;
+                      b = n;
+                    } else break;
+                  }
+                  g = (a + h + i) | 0;
+                  if (g >>> 0 > a >>> 0) {
+                    h = g;
+                    f = 1;
+                    b = 1;
+                    do {
+                      do
+                        if (((b & 3) | 0) != 3) {
+                          b = (f + -1) | 0;
+                          if ((c[(j + (b << 2)) >> 2] | 0) >>> 0 < ((h - a) | 0) >>> 0) p4(a, d, e, f, j);
+                          else r4(a, d, e, k, f, 0, j);
+                          if ((f | 0) == 1) {
+                            s4(k, 1);
+                            f = 0;
+                            break;
+                          } else {
+                            s4(k, b);
+                            f = 1;
+                            break;
+                          }
+                        } else {
+                          p4(a, d, e, f, j);
+                          q4(k, 2);
+                          f = (f + 2) | 0;
+                        }
+                      while (0);
+                      b = c[k >> 2] | 1;
+                      c[k >> 2] = b;
+                      a = (a + d) | 0;
+                    } while (a >>> 0 < g >>> 0);
+                  } else {
+                    f = 1;
+                    b = 1;
+                  }
+                  r4(a, d, e, k, f, 0, j);
+                  g = (k + 4) | 0;
+                  while (1) {
+                    if (((f | 0) == 1) & ((b | 0) == 1)) {
+                      if (!(c[g >> 2] | 0)) break a;
+                    } else if ((f | 0) >= 2) {
+                      s4(k, 2);
+                      n = (f + -2) | 0;
+                      c[k >> 2] = c[k >> 2] ^ 7;
+                      q4(k, 1);
+                      r4((a + (0 - (c[(j + (n << 2)) >> 2] | 0)) + i) | 0, d, e, k, (f + -1) | 0, 1, j);
+                      s4(k, 1);
+                      b = c[k >> 2] | 1;
+                      c[k >> 2] = b;
+                      h = (a + i) | 0;
+                      r4(h, d, e, k, n, 1, j);
+                      a = h;
+                      f = n;
+                      continue;
+                    }
+                    b = t4(k) | 0;
+                    q4(k, b);
+                    a = (a + i) | 0;
+                    f = (b + f) | 0;
+                    b = c[k >> 2] | 0;
+                  }
+                }
+              while (0);
+              l = m;
+              return;
+            }
+            function p4(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              n = l;
+              l = (l + 240) | 0;
+              m = n;
+              c[m >> 2] = a;
+              a: do
+                if ((e | 0) > 1) {
+                  k = (0 - b) | 0;
+                  g = a;
+                  j = e;
+                  e = 1;
+                  while (1) {
+                    h = (g + k) | 0;
+                    i = (j + -2) | 0;
+                    g = (h + (0 - (c[(f + (i << 2)) >> 2] | 0))) | 0;
+                    if ((lb[d & 127](a, g) | 0) > -1 ? (lb[d & 127](a, h) | 0) > -1 : 0) break a;
+                    a = (e + 1) | 0;
+                    e = (m + (e << 2)) | 0;
+                    if ((lb[d & 127](g, h) | 0) > -1) {
+                      c[e >> 2] = g;
+                      e = (j + -1) | 0;
+                    } else {
+                      c[e >> 2] = h;
+                      g = h;
+                      e = i;
+                    }
+                    if ((e | 0) <= 1) {
+                      e = a;
+                      break a;
+                    }
+                    j = e;
+                    e = a;
+                    a = c[m >> 2] | 0;
+                  }
+                } else e = 1;
+              while (0);
+              v4(b, m, e);
+              l = n;
+              return;
+            }
+            function q4(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              f = (a + 4) | 0;
+              if (b >>> 0 > 31) {
+                e = c[f >> 2] | 0;
+                c[a >> 2] = e;
+                c[f >> 2] = 0;
+                b = (b + -32) | 0;
+                d = 0;
+              } else {
+                d = c[f >> 2] | 0;
+                e = c[a >> 2] | 0;
+              }
+              c[a >> 2] = (d << (32 - b)) | (e >>> b);
+              c[f >> 2] = d >>> b;
+              return;
+            }
+            function r4(a, b, d, e, f, g, h) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0;
+              p = l;
+              l = (l + 240) | 0;
+              n = (p + 232) | 0;
+              o = p;
+              q = c[e >> 2] | 0;
+              c[n >> 2] = q;
+              j = c[(e + 4) >> 2] | 0;
+              k = (n + 4) | 0;
+              c[k >> 2] = j;
+              c[o >> 2] = a;
+              a: do
+                if (
+                  ((q | 0) != 1) | ((j | 0) != 0)
+                    ? ((m = (0 - b) | 0),
+                      (i = (a + (0 - (c[(h + (f << 2)) >> 2] | 0))) | 0),
+                      (lb[d & 127](i, a) | 0) >= 1)
+                    : 0
+                ) {
+                  e = 1;
+                  g = (g | 0) == 0;
+                  j = i;
+                  while (1) {
+                    if (g & ((f | 0) > 1)) {
+                      g = (a + m) | 0;
+                      i = c[(h + ((f + -2) << 2)) >> 2] | 0;
+                      if ((lb[d & 127](g, j) | 0) > -1) {
+                        i = 10;
+                        break a;
+                      }
+                      if ((lb[d & 127]((g + (0 - i)) | 0, j) | 0) > -1) {
+                        i = 10;
+                        break a;
+                      }
+                    }
+                    g = (e + 1) | 0;
+                    c[(o + (e << 2)) >> 2] = j;
+                    q = t4(n) | 0;
+                    q4(n, q);
+                    f = (q + f) | 0;
+                    if (!(((c[n >> 2] | 0) != 1) | ((c[k >> 2] | 0) != 0))) {
+                      e = g;
+                      a = j;
+                      i = 10;
+                      break a;
+                    }
+                    a = (j + (0 - (c[(h + (f << 2)) >> 2] | 0))) | 0;
+                    if ((lb[d & 127](a, c[o >> 2] | 0) | 0) < 1) {
+                      a = j;
+                      e = g;
+                      g = 0;
+                      i = 9;
+                      break;
+                    } else {
+                      q = j;
+                      e = g;
+                      g = 1;
+                      j = a;
+                      a = q;
+                    }
+                  }
+                } else {
+                  e = 1;
+                  i = 9;
+                }
+              while (0);
+              if ((i | 0) == 9 ? (g | 0) == 0 : 0) i = 10;
+              if ((i | 0) == 10) {
+                v4(b, o, e);
+                p4(a, b, d, f, h);
+              }
+              l = p;
+              return;
+            }
+            function s4(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              f = (a + 4) | 0;
+              if (b >>> 0 > 31) {
+                e = c[a >> 2] | 0;
+                c[f >> 2] = e;
+                c[a >> 2] = 0;
+                b = (b + -32) | 0;
+                d = 0;
+              } else {
+                d = c[a >> 2] | 0;
+                e = c[f >> 2] | 0;
+              }
+              c[f >> 2] = (d >>> ((32 - b) | 0)) | (e << b);
+              c[a >> 2] = d << b;
+              return;
+            }
+            function t4(a) {
+              a = a | 0;
+              var b = 0;
+              b = u4(((c[a >> 2] | 0) + -1) | 0) | 0;
+              if (!b) {
+                b = u4(c[(a + 4) >> 2] | 0) | 0;
+                return ((b | 0) == 0 ? 0 : (b + 32) | 0) | 0;
+              } else return b | 0;
+              return 0;
+            }
+            function u4(a) {
+              a = a | 0;
+              var b = 0;
+              if (a)
+                if (!(a & 1)) {
+                  b = a;
+                  a = 0;
+                  do {
+                    a = (a + 1) | 0;
+                    b = b >>> 1;
+                  } while (!((b & 1) | 0));
+                } else a = 0;
+              else a = 32;
+              return a | 0;
+            }
+            function v4(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              h = l;
+              l = (l + 256) | 0;
+              e = h;
+              a: do
+                if ((d | 0) >= 2 ? ((g = (b + (d << 2)) | 0), (c[g >> 2] = e), a | 0) : 0)
+                  while (1) {
+                    f = a >>> 0 < 256 ? a : 256;
+                    W6(e | 0, c[b >> 2] | 0, f | 0) | 0;
+                    e = 0;
+                    do {
+                      i = (b + (e << 2)) | 0;
+                      e = (e + 1) | 0;
+                      W6(c[i >> 2] | 0, c[(b + (e << 2)) >> 2] | 0, f | 0) | 0;
+                      c[i >> 2] = (c[i >> 2] | 0) + f;
+                    } while ((e | 0) != (d | 0));
+                    a = (a - f) | 0;
+                    if (!a) break a;
+                    e = c[g >> 2] | 0;
+                  }
+              while (0);
+              l = h;
+              return;
+            }
+            function w4(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = l;
+              l = (l + 16) | 0;
+              f = e;
+              c[f >> 2] = d;
+              d = H3(a, b, f) | 0;
+              l = e;
+              return d | 0;
+            }
+            function x4(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              f = l;
+              l = (l + 16) | 0;
+              e = f;
+              sa(0, e | 0) | 0;
+              d = 0;
+              e = ((c[(e + 4) >> 2] | 0) * 65537) ^ ((e >>> 4) + b);
+              while (1) {
+                a[(b + d) >> 0] = ((e & 15) + 65) | ((e << 1) & 32);
+                d = (d + 1) | 0;
+                if ((d | 0) == 6) break;
+                else e = e >>> 5;
+              }
+              l = f;
+              return b | 0;
+            }
+            function y4(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              c = V2(a, b, c, -2147483648, 0) | 0;
+              return c | 0;
+            }
+            function z4(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              h = l;
+              l = (l + 32) | 0;
+              f = h;
+              e = a[d >> 0] | 0;
+              a: do
+                if ((e << 24) >> 24 != 0 ? (a[(d + 1) >> 0] | 0) != 0 : 0) {
+                  c[f >> 2] = 0;
+                  c[(f + 4) >> 2] = 0;
+                  c[(f + 8) >> 2] = 0;
+                  c[(f + 12) >> 2] = 0;
+                  c[(f + 16) >> 2] = 0;
+                  c[(f + 20) >> 2] = 0;
+                  c[(f + 24) >> 2] = 0;
+                  c[(f + 28) >> 2] = 0;
+                  do {
+                    i = (f + ((((e & 255) >>> 5) & 255) << 2)) | 0;
+                    c[i >> 2] = c[i >> 2] | (1 << (e & 31));
+                    d = (d + 1) | 0;
+                    e = a[d >> 0] | 0;
+                  } while ((e << 24) >> 24 != 0);
+                  e = a[b >> 0] | 0;
+                  if (!((e << 24) >> 24)) d = b;
+                  else {
+                    d = b;
+                    do {
+                      if ((c[(f + ((((e & 255) >>> 5) & 255) << 2)) >> 2] & (1 << (e & 31))) | 0) break a;
+                      d = (d + 1) | 0;
+                      e = a[d >> 0] | 0;
+                    } while ((e << 24) >> 24 != 0);
+                  }
+                } else g = 3;
+              while (0);
+              if ((g | 0) == 3) d = k2(b, (e << 24) >> 24) | 0;
+              l = h;
+              return (d - b) | 0;
+            }
+            function A4(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              if (!b) {
+                b = c[47666] | 0;
+                if (!b) b = 0;
+                else e = 3;
+              } else e = 3;
+              do
+                if ((e | 0) == 3) {
+                  b = (b + (k4(b, d) | 0)) | 0;
+                  if (!(a[b >> 0] | 0)) {
+                    c[47666] = 0;
+                    b = 0;
+                    break;
+                  }
+                  d = (b + (z4(b, d) | 0)) | 0;
+                  c[47666] = d;
+                  if (!(a[d >> 0] | 0)) {
+                    c[47666] = 0;
+                    break;
+                  } else {
+                    c[47666] = d + 1;
+                    a[d >> 0] = 0;
+                    break;
+                  }
+                }
+              while (0);
+              return b | 0;
+            }
+            function B4(b, c, d) {
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0;
+              e = c & 255;
+              do {
+                if (!d) {
+                  c = 0;
+                  break;
+                }
+                d = (d + -1) | 0;
+                c = (b + d) | 0;
+              } while ((a[c >> 0] | 0) != (e << 24) >> 24);
+              return c | 0;
+            }
+            function C4(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0;
+              if (!b) {
+                b = c[e >> 2] | 0;
+                if (!b) b = 0;
+                else f = 3;
+              } else f = 3;
+              do
+                if ((f | 0) == 3) {
+                  b = (b + (k4(b, d) | 0)) | 0;
+                  if (!(a[b >> 0] | 0)) {
+                    c[e >> 2] = 0;
+                    b = 0;
+                    break;
+                  }
+                  d = (b + (z4(b, d) | 0)) | 0;
+                  c[e >> 2] = d;
+                  if (!(a[d >> 0] | 0)) {
+                    c[e >> 2] = 0;
+                    break;
+                  } else {
+                    c[e >> 2] = d + 1;
+                    a[d >> 0] = 0;
+                    break;
+                  }
+                }
+              while (0);
+              return b | 0;
+            }
+            function D4(a) {
+              a = a | 0;
+              var b = 0,
+                c = 0;
+              c = ((l2(a) | 0) + 1) | 0;
+              b = T1(c) | 0;
+              if (!b) b = 0;
+              else W6(b | 0, a | 0, c | 0) | 0;
+              return b | 0;
+            }
+            function E4(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return B4(a, b, ((l2(a) | 0) + 1) | 0) | 0;
+            }
+            function F4(a, b) {
+              a = a | 0;
+              b = b | 0;
+              r3((a + (l2(a) | 0)) | 0, b) | 0;
+              return a | 0;
+            }
+            function G4(b, c) {
+              b = b | 0;
+              c = c | 0;
+              c = (b + (z4(b, c) | 0)) | 0;
+              return (a[c >> 0] | 0 ? c : 0) | 0;
+            }
+            function H4(a) {
+              a = a | 0;
+              var b = 0;
+              if ((c[(a + 76) >> 2] | 0) > -1) {
+                b = (J3(a) | 0) == 0;
+                a = ((c[a >> 2] | 0) >>> 4) & 1;
+              } else a = ((c[a >> 2] | 0) >>> 4) & 1;
+              return a | 0;
+            }
+            function I4(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              if ((c[(a + 76) >> 2] | 0) > -1) f = J3(a) | 0;
+              else f = 0;
+              J4(a);
+              g = ((c[a >> 2] & 1) | 0) != 0;
+              if (!g) {
+                e = K4() | 0;
+                d = c[(a + 52) >> 2] | 0;
+                b = (a + 56) | 0;
+                if (d | 0) c[(d + 56) >> 2] = c[b >> 2];
+                b = c[b >> 2] | 0;
+                if (b | 0) c[(b + 52) >> 2] = d;
+                if ((c[e >> 2] | 0) == (a | 0)) c[e >> 2] = b;
+                L4();
+              }
+              b = M4(a) | 0;
+              b = kb[c[(a + 12) >> 2] & 63](a) | 0 | b;
+              d = c[(a + 92) >> 2] | 0;
+              if (d | 0) U1(d);
+              if (g) {
+                if (f | 0) K3(a);
+              } else U1(a);
+              return b | 0;
+            }
+            function J4(a) {
+              a = a | 0;
+              var b = 0;
+              if (c[(a + 68) >> 2] | 0) {
+                b = c[(a + 116) >> 2] | 0;
+                a = (a + 112) | 0;
+                if (b | 0) c[(b + 112) >> 2] = c[a >> 2];
+                a = c[a >> 2] | 0;
+                if (!a) a = ((O4() | 0) + 232) | 0;
+                else a = (a + 116) | 0;
+                c[a >> 2] = b;
+              }
+              return;
+            }
+            function K4() {
+              ta(190668);
+              return 190676;
+            }
+            function L4() {
+              La(190668);
+              return;
+            }
+            function M4(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              do
+                if (a) {
+                  if ((c[(a + 76) >> 2] | 0) <= -1) {
+                    b = N4(a) | 0;
+                    break;
+                  }
+                  d = (J3(a) | 0) == 0;
+                  b = N4(a) | 0;
+                  if (!d) K3(a);
+                } else {
+                  if (!(c[15711] | 0)) b = 0;
+                  else b = M4(c[15711] | 0) | 0;
+                  a = c[(K4() | 0) >> 2] | 0;
+                  if (a)
+                    do {
+                      if ((c[(a + 76) >> 2] | 0) > -1) d = J3(a) | 0;
+                      else d = 0;
+                      if ((c[(a + 20) >> 2] | 0) >>> 0 > (c[(a + 28) >> 2] | 0) >>> 0) b = N4(a) | 0 | b;
+                      if (d | 0) K3(a);
+                      a = c[(a + 56) >> 2] | 0;
+                    } while ((a | 0) != 0);
+                  L4();
+                }
+              while (0);
+              return b | 0;
+            }
+            function N4(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              b = (a + 20) | 0;
+              h = (a + 28) | 0;
+              if (
+                (c[b >> 2] | 0) >>> 0 > (c[h >> 2] | 0) >>> 0
+                  ? (nb[c[(a + 36) >> 2] & 63](a, 0, 0) | 0, (c[b >> 2] | 0) == 0)
+                  : 0
+              )
+                a = -1;
+              else {
+                d = (a + 4) | 0;
+                e = c[d >> 2] | 0;
+                f = (a + 8) | 0;
+                g = c[f >> 2] | 0;
+                if (e >>> 0 < g >>> 0) nb[c[(a + 40) >> 2] & 63](a, (e - g) | 0, 1) | 0;
+                c[(a + 16) >> 2] = 0;
+                c[h >> 2] = 0;
+                c[b >> 2] = 0;
+                c[f >> 2] = 0;
+                c[d >> 2] = 0;
+                a = 0;
+              }
+              return a | 0;
+            }
+            function O4() {
+              return v2() | 0;
+            }
+            function P4(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              o = l;
+              l = (l + 64) | 0;
+              n = (o + 40) | 0;
+              k = (o + 24) | 0;
+              j = (o + 16) | 0;
+              g = o;
+              m = (o + 56) | 0;
+              f = a[d >> 0] | 0;
+              if (U2(153580, (f << 24) >> 24, 4) | 0) {
+                e = T1(1156) | 0;
+                if (!e) e = 0;
+                else {
+                  h = e;
+                  i = (h + 124) | 0;
+                  do {
+                    c[h >> 2] = 0;
+                    h = (h + 4) | 0;
+                  } while ((h | 0) < (i | 0));
+                  if (!(R2(d, 43) | 0)) c[e >> 2] = (f << 24) >> 24 == 114 ? 8 : 4;
+                  if (R2(d, 101) | 0) {
+                    c[g >> 2] = b;
+                    c[(g + 4) >> 2] = 2;
+                    c[(g + 8) >> 2] = 1;
+                    Ea(221, g | 0) | 0;
+                    f = a[d >> 0] | 0;
+                  }
+                  if ((f << 24) >> 24 == 97) {
+                    c[j >> 2] = b;
+                    c[(j + 4) >> 2] = 3;
+                    f = Ea(221, j | 0) | 0;
+                    if (!(f & 1024)) {
+                      c[k >> 2] = b;
+                      c[(k + 4) >> 2] = 4;
+                      c[(k + 8) >> 2] = f | 1024;
+                      Ea(221, k | 0) | 0;
+                    }
+                    d = c[e >> 2] | 128;
+                    c[e >> 2] = d;
+                  } else d = c[e >> 2] | 0;
+                  c[(e + 60) >> 2] = b;
+                  c[(e + 44) >> 2] = e + 132;
+                  c[(e + 48) >> 2] = 1024;
+                  f = (e + 75) | 0;
+                  a[f >> 0] = -1;
+                  if (
+                    ((d & 8) | 0) == 0
+                      ? ((c[n >> 2] = b), (c[(n + 4) >> 2] = 21523), (c[(n + 8) >> 2] = m), (Ia(54, n | 0) | 0) == 0)
+                      : 0
+                  )
+                    a[f >> 0] = 10;
+                  c[(e + 32) >> 2] = 15;
+                  c[(e + 36) >> 2] = 18;
+                  c[(e + 40) >> 2] = 16;
+                  c[(e + 12) >> 2] = 17;
+                  if (!(c[47645] | 0)) c[(e + 76) >> 2] = -1;
+                  Q4(e) | 0;
+                }
+              } else {
+                c[(d2() | 0) >> 2] = 22;
+                e = 0;
+              }
+              l = o;
+              return e | 0;
+            }
+            function Q4(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = K4() | 0;
+              c[(a + 56) >> 2] = c[b >> 2];
+              d = c[b >> 2] | 0;
+              if (d | 0) c[(d + 52) >> 2] = a;
+              c[b >> 2] = a;
+              L4();
+              return a | 0;
+            }
+            function R4(b, e, f) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 16) | 0;
+              g = j;
+              a: do
+                if (!e) b = 0;
+                else {
+                  do
+                    if (f | 0) {
+                      i = (b | 0) == 0 ? g : b;
+                      b = a[e >> 0] | 0;
+                      if ((b << 24) >> 24 > -1) {
+                        c[i >> 2] = b & 255;
+                        b = ((b << 24) >> 24 != 0) & 1;
+                        break a;
+                      }
+                      h = (c[c[((S4() | 0) + 188) >> 2] >> 2] | 0) == 0;
+                      b = a[e >> 0] | 0;
+                      if (h) {
+                        c[i >> 2] = ((b << 24) >> 24) & 57343;
+                        b = 1;
+                        break a;
+                      }
+                      b = ((b & 255) + -194) | 0;
+                      if (b >>> 0 <= 50) {
+                        g = (e + 1) | 0;
+                        h = c[(62384 + (b << 2)) >> 2] | 0;
+                        if (f >>> 0 < 4 ? (h & (-2147483648 >>> ((((f * 6) | 0) + -6) | 0))) | 0 : 0) break;
+                        b = d[g >> 0] | 0;
+                        f = b >>> 3;
+                        if (((f + -16) | (f + (h >> 26))) >>> 0 <= 7) {
+                          b = (b + -128) | (h << 6);
+                          if ((b | 0) >= 0) {
+                            c[i >> 2] = b;
+                            b = 2;
+                            break a;
+                          }
+                          g = ((d[(e + 2) >> 0] | 0) + -128) | 0;
+                          if (g >>> 0 <= 63) {
+                            g = g | (b << 6);
+                            if ((g | 0) >= 0) {
+                              c[i >> 2] = g;
+                              b = 3;
+                              break a;
+                            }
+                            b = ((d[(e + 3) >> 0] | 0) + -128) | 0;
+                            if (b >>> 0 <= 63) {
+                              c[i >> 2] = b | (g << 6);
+                              b = 4;
+                              break a;
+                            }
+                          }
+                        }
+                      }
+                    }
+                  while (0);
+                  c[(d2() | 0) >> 2] = 84;
+                  b = -1;
+                }
+              while (0);
+              l = j;
+              return b | 0;
+            }
+            function S4() {
+              return v2() | 0;
+            }
+            function T4(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0;
+              c = l2(a) | 0;
+              return ((((U4(a, 1, c, b) | 0) != (c | 0)) << 31) >> 31) | 0;
+            }
+            function U4(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              f = O(d, b) | 0;
+              d = (b | 0) == 0 ? 0 : d;
+              if ((c[(e + 76) >> 2] | 0) > -1) {
+                g = (J3(e) | 0) == 0;
+                a = U3(a, f, e) | 0;
+                if (!g) K3(e);
+              } else a = U3(a, f, e) | 0;
+              if ((a | 0) != (f | 0)) d = ((a >>> 0) / (b >>> 0)) | 0;
+              return d | 0;
+            }
+            function V4(b, e) {
+              b = b | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0;
+              m = l;
+              l = (l + 16) | 0;
+              j = m;
+              k = e & 255;
+              a[j >> 0] = k;
+              g = (b + 16) | 0;
+              h = c[g >> 2] | 0;
+              if (!h)
+                if (!(V3(b) | 0)) {
+                  h = c[g >> 2] | 0;
+                  i = 4;
+                } else f = -1;
+              else i = 4;
+              do
+                if ((i | 0) == 4) {
+                  i = (b + 20) | 0;
+                  g = c[i >> 2] | 0;
+                  if (g >>> 0 < h >>> 0 ? ((f = e & 255), (f | 0) != (a[(b + 75) >> 0] | 0)) : 0) {
+                    c[i >> 2] = g + 1;
+                    a[g >> 0] = k;
+                    break;
+                  }
+                  if ((nb[c[(b + 36) >> 2] & 63](b, j, 1) | 0) == 1) f = d[j >> 0] | 0;
+                  else f = -1;
+                }
+              while (0);
+              l = m;
+              return f | 0;
+            }
+            function W4(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = l;
+              l = (l + 16) | 0;
+              f = e;
+              c[f >> 2] = a;
+              c[(f + 4) >> 2] = b;
+              c[(f + 8) >> 2] = d;
+              d = c2(Fa(3, f | 0) | 0) | 0;
+              l = e;
+              return d | 0;
+            }
+            function X4() {
+              var a = 0,
+                b = 0;
+              b = l;
+              l = (l + 16) | 0;
+              a = Da(20, b | 0) | 0;
+              l = b;
+              return a | 0;
+            }
+            function Y4(b, c) {
+              b = b | 0;
+              c = c | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              d = b;
+              e = 153565;
+              f = (d + 15) | 0;
+              do {
+                a[d >> 0] = a[e >> 0] | 0;
+                d = (d + 1) | 0;
+                e = (e + 1) | 0;
+              } while ((d | 0) < (f | 0));
+              if (!c) {
+                a[(b + 14) >> 0] = 48;
+                a[(b + 15) >> 0] = 0;
+              } else {
+                e = c;
+                d = 14;
+                while (1) {
+                  d = (d + 1) | 0;
+                  if (e >>> 0 < 10) break;
+                  else e = ((e >>> 0) / 10) | 0;
+                }
+                a[(b + d) >> 0] = 0;
+                while (1) {
+                  d = (d + -1) | 0;
+                  a[(b + d) >> 0] = (c >>> 0) % 10 | 0 | 48;
+                  if (c >>> 0 < 10) break;
+                  else c = ((c >>> 0) / 10) | 0;
+                }
+              }
+              return;
+            }
+            function Z4(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              g = l;
+              l = (l + 48) | 0;
+              f = (g + 40) | 0;
+              e = (g + 8) | 0;
+              d = g;
+              c[d >> 2] = a;
+              c[(d + 4) >> 2] = b;
+              d = Ca(197, d | 0) | 0;
+              if ((d | 0) == -9 ? ((c[e >> 2] = a), (c[(e + 4) >> 2] = 1), (Ea(221, e | 0) | 0) >= 0) : 0) {
+                Y4(e, a);
+                c[f >> 2] = e;
+                c[(f + 4) >> 2] = b;
+                b = c2(Ba(195, f | 0) | 0) | 0;
+              } else b = c2(d) | 0;
+              l = g;
+              return b | 0;
+            }
+            function _4(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0;
+              d = l;
+              l = (l + 16) | 0;
+              e = d;
+              c[e >> 2] = a;
+              c[(e + 4) >> 2] = b;
+              b = c2(Ga(33, e | 0) | 0) | 0;
+              l = d;
+              return b | 0;
+            }
+            function $4(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 48) | 0;
+              h = (i + 32) | 0;
+              g = (i + 16) | 0;
+              e = i;
+              if (U2(153580, a[d >> 0] | 0, 4) | 0) {
+                f = a5(d) | 0;
+                c[e >> 2] = b;
+                c[(e + 4) >> 2] = f | 32768;
+                c[(e + 8) >> 2] = 438;
+                e = c2(Ha(5, e | 0) | 0) | 0;
+                if ((e | 0) >= 0) {
+                  if ((f & 524288) | 0) {
+                    c[g >> 2] = e;
+                    c[(g + 4) >> 2] = 2;
+                    c[(g + 8) >> 2] = 1;
+                    Ea(221, g | 0) | 0;
+                  }
+                  b = P4(e, d) | 0;
+                  if (!b) {
+                    c[h >> 2] = e;
+                    Ja(6, h | 0) | 0;
+                    b = 0;
+                  }
+                } else b = 0;
+              } else {
+                c[(d2() | 0) >> 2] = 22;
+                b = 0;
+              }
+              l = i;
+              return b | 0;
+            }
+            function a5(b) {
+              b = b | 0;
+              var c = 0,
+                d = 0,
+                e = 0;
+              d = (R2(b, 43) | 0) == 0;
+              c = a[b >> 0] | 0;
+              d = d ? ((c << 24) >> 24 != 114) & 1 : 2;
+              e = (R2(b, 120) | 0) == 0;
+              d = e ? d : d | 128;
+              b = (R2(b, 101) | 0) == 0;
+              b = b ? d : d | 524288;
+              b = (c << 24) >> 24 == 114 ? b : b | 64;
+              b = (c << 24) >> 24 == 119 ? b | 512 : b;
+              return ((c << 24) >> 24 == 97 ? b | 1024 : b) | 0;
+            }
+            function b5(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = l;
+              l = (l + 16) | 0;
+              f = e;
+              c[f >> 2] = d;
+              d = c5(a, b, f) | 0;
+              l = e;
+              return d | 0;
+            }
+            function c5(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              g = l;
+              l = (l + 128) | 0;
+              e = g;
+              f = e;
+              h = (f + 124) | 0;
+              do {
+                c[f >> 2] = 0;
+                f = (f + 4) | 0;
+              } while ((f | 0) < (h | 0));
+              c[(e + 32) >> 2] = 41;
+              c[(e + 44) >> 2] = a;
+              c[(e + 76) >> 2] = -1;
+              c[(e + 84) >> 2] = a;
+              h = e5(e, b, d) | 0;
+              l = g;
+              return h | 0;
+            }
+            function d5(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              return m5(a, b, c) | 0;
+            }
+            function e5(b, e, f) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              var i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                O = 0,
+                P = 0;
+              P = l;
+              l = (l + 288) | 0;
+              J = (P + 8) | 0;
+              K = (P + 17) | 0;
+              L = P;
+              M = (P + 16) | 0;
+              if ((c[(b + 76) >> 2] | 0) > -1) O = J3(b) | 0;
+              else O = 0;
+              i = a[e >> 0] | 0;
+              a: do
+                if ((i << 24) >> 24) {
+                  B = (b + 4) | 0;
+                  C = (b + 100) | 0;
+                  D = (b + 108) | 0;
+                  E = (b + 8) | 0;
+                  F = (K + 10) | 0;
+                  G = (K + 33) | 0;
+                  A = (J + 4) | 0;
+                  H = (K + 1) | 0;
+                  I = (K + 1) | 0;
+                  m = e;
+                  t = 0;
+                  e = 0;
+                  k = 0;
+                  j = 0;
+                  b: while (1) {
+                    c: do
+                      if (!(S2(i & 255) | 0)) {
+                        i = (i << 24) >> 24 == 37;
+                        d: do
+                          if (i) {
+                            p = (m + 1) | 0;
+                            n = a[p >> 0] | 0;
+                            e: do
+                              switch ((n << 24) >> 24) {
+                                case 37:
+                                  break d;
+                                case 42: {
+                                  y = 0;
+                                  m = (m + 2) | 0;
+                                  break;
+                                }
+                                default: {
+                                  i = ((n & 255) + -48) | 0;
+                                  if (i >>> 0 < 10 ? (a[(m + 2) >> 0] | 0) == 36 : 0) {
+                                    y = f5(f, i) | 0;
+                                    m = (m + 3) | 0;
+                                    break e;
+                                  }
+                                  m = ((c[f >> 2] | 0) + (4 - 1)) & ~(4 - 1);
+                                  y = c[m >> 2] | 0;
+                                  c[f >> 2] = m + 4;
+                                  m = p;
+                                }
+                              }
+                            while (0);
+                            i = a[m >> 0] | 0;
+                            n = i & 255;
+                            if (((n + -48) | 0) >>> 0 < 10) {
+                              p = 0;
+                              do {
+                                p = (((p * 10) | 0) + -48 + n) | 0;
+                                m = (m + 1) | 0;
+                                i = a[m >> 0] | 0;
+                                n = i & 255;
+                              } while (((n + -48) | 0) >>> 0 < 10);
+                            } else p = 0;
+                            i = (i << 24) >> 24 == 109;
+                            x = (y | 0) != 0;
+                            k = i ? 0 : k;
+                            j = i ? 0 : j;
+                            m = i ? (m + 1) | 0 : m;
+                            i = x & i;
+                            n = (m + 1) | 0;
+                            switch (a[m >> 0] | 0) {
+                              case 104: {
+                                w = (a[n >> 0] | 0) == 104;
+                                q = w ? -2 : -1;
+                                m = w ? (m + 2) | 0 : n;
+                                break;
+                              }
+                              case 108: {
+                                w = (a[n >> 0] | 0) == 108;
+                                q = w ? 3 : 1;
+                                m = w ? (m + 2) | 0 : n;
+                                break;
+                              }
+                              case 106: {
+                                q = 3;
+                                m = n;
+                                break;
+                              }
+                              case 116:
+                              case 122: {
+                                q = 1;
+                                m = n;
+                                break;
+                              }
+                              case 76: {
+                                q = 2;
+                                m = n;
+                                break;
+                              }
+                              case 110:
+                              case 112:
+                              case 67:
+                              case 83:
+                              case 91:
+                              case 99:
+                              case 115:
+                              case 88:
+                              case 71:
+                              case 70:
+                              case 69:
+                              case 65:
+                              case 103:
+                              case 102:
+                              case 101:
+                              case 97:
+                              case 120:
+                              case 117:
+                              case 111:
+                              case 105:
+                              case 100: {
+                                q = 0;
+                                break;
+                              }
+                              default: {
+                                N = 135;
+                                break b;
+                              }
+                            }
+                            s = d[m >> 0] | 0;
+                            u = ((s & 47) | 0) == 3;
+                            s = u ? s | 32 : s;
+                            u = u ? 1 : q;
+                            r = s & 255;
+                            switch ((r << 24) >> 24) {
+                              case 99: {
+                                p = (p | 0) > 1 ? p : 1;
+                                w = t;
+                                break;
+                              }
+                              case 91: {
+                                w = t;
+                                break;
+                              }
+                              case 110: {
+                                g5(y, u, t, (((t | 0) < 0) << 31) >> 31);
+                                n = t;
+                                break c;
+                              }
+                              default: {
+                                W2(b, 0);
+                                do {
+                                  n = c[B >> 2] | 0;
+                                  if (n >>> 0 < (c[C >> 2] | 0) >>> 0) {
+                                    c[B >> 2] = n + 1;
+                                    n = d[n >> 0] | 0;
+                                  } else n = Y2(b) | 0;
+                                } while ((S2(n) | 0) != 0);
+                                if (!(c[C >> 2] | 0)) n = c[B >> 2] | 0;
+                                else {
+                                  n = ((c[B >> 2] | 0) + -1) | 0;
+                                  c[B >> 2] = n;
+                                }
+                                w = ((c[D >> 2] | 0) + t + n - (c[E >> 2] | 0)) | 0;
+                              }
+                            }
+                            W2(b, p);
+                            n = c[B >> 2] | 0;
+                            q = c[C >> 2] | 0;
+                            if (n >>> 0 < q >>> 0) c[B >> 2] = n + 1;
+                            else {
+                              if ((Y2(b) | 0) < 0) {
+                                N = 135;
+                                break b;
+                              }
+                              q = c[C >> 2] | 0;
+                            }
+                            if (q | 0) c[B >> 2] = (c[B >> 2] | 0) + -1;
+                            f: do
+                              switch ((r << 24) >> 24) {
+                                case 91:
+                                case 99:
+                                case 115: {
+                                  v = (s | 0) == 99;
+                                  g: do
+                                    if ((s | 16 | 0) == 115) {
+                                      Y6(H | 0, -1, 256) | 0;
+                                      a[K >> 0] = 0;
+                                      if ((s | 0) == 115) {
+                                        a[G >> 0] = 0;
+                                        a[F >> 0] = 0;
+                                        a[(F + 1) >> 0] = 0;
+                                        a[(F + 2) >> 0] = 0;
+                                        a[(F + 3) >> 0] = 0;
+                                        a[(F + 4) >> 0] = 0;
+                                      }
+                                    } else {
+                                      s = (m + 1) | 0;
+                                      n = (a[s >> 0] | 0) == 94;
+                                      t = n & 1;
+                                      m = n ? (m + 2) | 0 : s;
+                                      Y6(I | 0, (n & 1) | 0, 256) | 0;
+                                      a[K >> 0] = 0;
+                                      n = a[m >> 0] | 0;
+                                      switch ((n << 24) >> 24) {
+                                        case 45: {
+                                          n = 46;
+                                          N = 63;
+                                          break;
+                                        }
+                                        case 93: {
+                                          n = 94;
+                                          N = 63;
+                                          break;
+                                        }
+                                        default: {
+                                        }
+                                      }
+                                      while (1) {
+                                        if ((N | 0) == 63) {
+                                          N = 0;
+                                          a[(K + n) >> 0] = t ^ 1;
+                                          n = (m + 1) | 0;
+                                          m = n;
+                                          n = a[n >> 0] | 0;
+                                        }
+                                        h: do
+                                          switch ((n << 24) >> 24) {
+                                            case 0: {
+                                              N = 135;
+                                              break b;
+                                            }
+                                            case 93:
+                                              break g;
+                                            case 45: {
+                                              s = (m + 1) | 0;
+                                              n = a[s >> 0] | 0;
+                                              switch ((n << 24) >> 24) {
+                                                case 93:
+                                                case 0: {
+                                                  n = 45;
+                                                  break h;
+                                                }
+                                                default: {
+                                                }
+                                              }
+                                              m = a[(m + -1) >> 0] | 0;
+                                              if ((m & 255) < (n & 255)) {
+                                                r = (t ^ 1) & 255;
+                                                m = m & 255;
+                                                do {
+                                                  m = (m + 1) | 0;
+                                                  a[(K + m) >> 0] = r;
+                                                  n = a[s >> 0] | 0;
+                                                } while ((m | 0) < ((n & 255) | 0));
+                                                m = s;
+                                              } else m = s;
+                                              break;
+                                            }
+                                            default: {
+                                            }
+                                          }
+                                        while (0);
+                                        n = ((n & 255) + 1) | 0;
+                                        N = 63;
+                                      }
+                                    }
+                                  while (0);
+                                  n = v ? (p + 1) | 0 : 31;
+                                  s = (u | 0) == 1;
+                                  i: do
+                                    if (s) {
+                                      if (i) {
+                                        j = T1(n << 2) | 0;
+                                        if (!j) {
+                                          k = 0;
+                                          j = 0;
+                                          i = 1;
+                                          N = 135;
+                                          break b;
+                                        }
+                                      } else j = y;
+                                      c[J >> 2] = 0;
+                                      c[A >> 2] = 0;
+                                      r = n;
+                                      k = 0;
+                                      j: while (1) {
+                                        q = (j | 0) == 0;
+                                        do {
+                                          k: while (1) {
+                                            n = c[B >> 2] | 0;
+                                            if (n >>> 0 < (c[C >> 2] | 0) >>> 0) {
+                                              c[B >> 2] = n + 1;
+                                              n = d[n >> 0] | 0;
+                                            } else n = Y2(b) | 0;
+                                            if (!(a[(K + (n + 1)) >> 0] | 0)) break j;
+                                            a[M >> 0] = n;
+                                            switch (l3(L, M, 1, J) | 0) {
+                                              case -1: {
+                                                k = 0;
+                                                N = 135;
+                                                break b;
+                                              }
+                                              case -2:
+                                                break;
+                                              default:
+                                                break k;
+                                            }
+                                          }
+                                          if (!q) {
+                                            c[(j + (k << 2)) >> 2] = c[L >> 2];
+                                            k = (k + 1) | 0;
+                                          }
+                                        } while (!(i & ((k | 0) == (r | 0))));
+                                        k = (r << 1) | 1;
+                                        n = W1(j, k << 2) | 0;
+                                        if (!n) {
+                                          k = 0;
+                                          i = 1;
+                                          N = 135;
+                                          break b;
+                                        } else {
+                                          u = r;
+                                          r = k;
+                                          j = n;
+                                          k = u;
+                                        }
+                                      }
+                                      if (!(h5(J) | 0)) {
+                                        k = 0;
+                                        N = 135;
+                                        break b;
+                                      } else {
+                                        n = k;
+                                        k = 0;
+                                        r = j;
+                                      }
+                                    } else {
+                                      if (i) {
+                                        k = T1(n) | 0;
+                                        if (!k) {
+                                          k = 0;
+                                          j = 0;
+                                          i = 1;
+                                          N = 135;
+                                          break b;
+                                        } else {
+                                          q = n;
+                                          j = 0;
+                                        }
+                                        while (1) {
+                                          do {
+                                            n = c[B >> 2] | 0;
+                                            if (n >>> 0 < (c[C >> 2] | 0) >>> 0) {
+                                              c[B >> 2] = n + 1;
+                                              n = d[n >> 0] | 0;
+                                            } else n = Y2(b) | 0;
+                                            if (!(a[(K + (n + 1)) >> 0] | 0)) {
+                                              n = j;
+                                              r = 0;
+                                              j = 0;
+                                              break i;
+                                            }
+                                            a[(k + j) >> 0] = n;
+                                            j = (j + 1) | 0;
+                                          } while ((j | 0) != (q | 0));
+                                          j = (q << 1) | 1;
+                                          n = W1(k, j) | 0;
+                                          if (!n) {
+                                            j = 0;
+                                            i = 1;
+                                            N = 135;
+                                            break b;
+                                          } else {
+                                            u = q;
+                                            q = j;
+                                            k = n;
+                                            j = u;
+                                          }
+                                        }
+                                      }
+                                      if (!y) {
+                                        k = q;
+                                        while (1) {
+                                          j = c[B >> 2] | 0;
+                                          if (j >>> 0 < k >>> 0) {
+                                            c[B >> 2] = j + 1;
+                                            j = d[j >> 0] | 0;
+                                          } else j = Y2(b) | 0;
+                                          if (!(a[(K + (j + 1)) >> 0] | 0)) {
+                                            n = 0;
+                                            k = 0;
+                                            r = 0;
+                                            j = 0;
+                                            break i;
+                                          }
+                                          k = c[C >> 2] | 0;
+                                        }
+                                      } else {
+                                        n = 0;
+                                        k = q;
+                                        while (1) {
+                                          j = c[B >> 2] | 0;
+                                          if (j >>> 0 < k >>> 0) {
+                                            c[B >> 2] = j + 1;
+                                            j = d[j >> 0] | 0;
+                                          } else j = Y2(b) | 0;
+                                          if (!(a[(K + (j + 1)) >> 0] | 0)) {
+                                            k = y;
+                                            r = 0;
+                                            j = 0;
+                                            break i;
+                                          }
+                                          a[(y + n) >> 0] = j;
+                                          n = (n + 1) | 0;
+                                          k = c[C >> 2] | 0;
+                                        }
+                                      }
+                                    }
+                                  while (0);
+                                  if (!(c[C >> 2] | 0)) q = c[B >> 2] | 0;
+                                  else {
+                                    q = ((c[B >> 2] | 0) + -1) | 0;
+                                    c[B >> 2] = q;
+                                  }
+                                  q = (q - (c[E >> 2] | 0) + (c[D >> 2] | 0)) | 0;
+                                  if (!q) {
+                                    N = 137;
+                                    break b;
+                                  }
+                                  if (!(((q | 0) == (p | 0)) | (v ^ 1))) {
+                                    N = 137;
+                                    break b;
+                                  }
+                                  do
+                                    if (i)
+                                      if (s) {
+                                        c[y >> 2] = r;
+                                        break;
+                                      } else {
+                                        c[y >> 2] = k;
+                                        break;
+                                      }
+                                  while (0);
+                                  if (!v) {
+                                    if (r | 0) c[(r + (n << 2)) >> 2] = 0;
+                                    if (!k) {
+                                      k = 0;
+                                      break f;
+                                    }
+                                    a[(k + n) >> 0] = 0;
+                                  }
+                                  break;
+                                }
+                                case 120:
+                                case 88:
+                                case 112: {
+                                  n = 16;
+                                  N = 123;
+                                  break;
+                                }
+                                case 111: {
+                                  n = 8;
+                                  N = 123;
+                                  break;
+                                }
+                                case 117:
+                                case 100: {
+                                  n = 10;
+                                  N = 123;
+                                  break;
+                                }
+                                case 105: {
+                                  n = 0;
+                                  N = 123;
+                                  break;
+                                }
+                                case 71:
+                                case 103:
+                                case 70:
+                                case 102:
+                                case 69:
+                                case 101:
+                                case 65:
+                                case 97: {
+                                  o = +i5(b, u, 0);
+                                  if ((c[D >> 2] | 0) == (((c[E >> 2] | 0) - (c[B >> 2] | 0)) | 0)) {
+                                    N = 137;
+                                    break b;
+                                  }
+                                  if (y)
+                                    switch (u | 0) {
+                                      case 0: {
+                                        g[y >> 2] = o;
+                                        break f;
+                                      }
+                                      case 1: {
+                                        h[y >> 3] = o;
+                                        break f;
+                                      }
+                                      case 2: {
+                                        h[y >> 3] = o;
+                                        break f;
+                                      }
+                                      default:
+                                        break f;
+                                    }
+                                  break;
+                                }
+                                default: {
+                                }
+                              }
+                            while (0);
+                            do
+                              if ((N | 0) == 123) {
+                                N = 0;
+                                n = X2(b, n, 0, -1, -1) | 0;
+                                if ((c[D >> 2] | 0) == (((c[E >> 2] | 0) - (c[B >> 2] | 0)) | 0)) {
+                                  N = 137;
+                                  break b;
+                                }
+                                if (x & ((s | 0) == 112)) {
+                                  c[y >> 2] = n;
+                                  break;
+                                } else {
+                                  g5(y, u, n, z);
+                                  break;
+                                }
+                              }
+                            while (0);
+                            e = (e + (x & 1)) | 0;
+                            n = ((c[D >> 2] | 0) + w + (c[B >> 2] | 0) - (c[E >> 2] | 0)) | 0;
+                            break c;
+                          }
+                        while (0);
+                        m = (m + (i & 1)) | 0;
+                        W2(b, 0);
+                        i = c[B >> 2] | 0;
+                        if (i >>> 0 < (c[C >> 2] | 0) >>> 0) {
+                          c[B >> 2] = i + 1;
+                          i = d[i >> 0] | 0;
+                        } else i = Y2(b) | 0;
+                        if ((i | 0) != (d[m >> 0] | 0)) {
+                          N = 22;
+                          break b;
+                        }
+                        n = (t + 1) | 0;
+                      } else {
+                        while (1) {
+                          i = (m + 1) | 0;
+                          if (!(S2(d[i >> 0] | 0) | 0)) break;
+                          else m = i;
+                        }
+                        W2(b, 0);
+                        do {
+                          i = c[B >> 2] | 0;
+                          if (i >>> 0 < (c[C >> 2] | 0) >>> 0) {
+                            c[B >> 2] = i + 1;
+                            i = d[i >> 0] | 0;
+                          } else i = Y2(b) | 0;
+                        } while ((S2(i) | 0) != 0);
+                        if (!(c[C >> 2] | 0)) i = c[B >> 2] | 0;
+                        else {
+                          i = ((c[B >> 2] | 0) + -1) | 0;
+                          c[B >> 2] = i;
+                        }
+                        n = ((c[D >> 2] | 0) + t + i - (c[E >> 2] | 0)) | 0;
+                      }
+                    while (0);
+                    m = (m + 1) | 0;
+                    i = a[m >> 0] | 0;
+                    if (!((i << 24) >> 24)) break a;
+                    else t = n;
+                  }
+                  if ((N | 0) == 22) {
+                    if (c[C >> 2] | 0) c[B >> 2] = (c[B >> 2] | 0) + -1;
+                    if (((e | 0) != 0) | ((i | 0) > -1)) break;
+                    else {
+                      i = 0;
+                      N = 136;
+                    }
+                  } else if ((N | 0) == 135) {
+                    i = i & 1;
+                    if (!e) N = 136;
+                  } else if ((N | 0) == 137) i = i & 1;
+                  if ((N | 0) == 136) e = -1;
+                  if (i) {
+                    U1(k);
+                    U1(j);
+                  }
+                } else e = 0;
+              while (0);
+              if (O | 0) K3(b);
+              l = P;
+              return e | 0;
+            }
+            function f5(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              e = l;
+              l = (l + 16) | 0;
+              d = e;
+              c[d >> 2] = c[a >> 2];
+              while (1) {
+                f = ((c[d >> 2] | 0) + (4 - 1)) & ~(4 - 1);
+                a = c[f >> 2] | 0;
+                c[d >> 2] = f + 4;
+                if (b >>> 0 > 1) b = (b + -1) | 0;
+                else break;
+              }
+              l = e;
+              return a | 0;
+            }
+            function g5(d, e, f, g) {
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              a: do
+                if (d | 0)
+                  switch (e | 0) {
+                    case -2: {
+                      a[d >> 0] = f;
+                      break a;
+                    }
+                    case -1: {
+                      b[d >> 1] = f;
+                      break a;
+                    }
+                    case 0: {
+                      c[d >> 2] = f;
+                      break a;
+                    }
+                    case 1: {
+                      c[d >> 2] = f;
+                      break a;
+                    }
+                    case 3: {
+                      e = d;
+                      c[e >> 2] = f;
+                      c[(e + 4) >> 2] = g;
+                      break a;
+                    }
+                    default:
+                      break a;
+                  }
+              while (0);
+              return;
+            }
+            function h5(a) {
+              a = a | 0;
+              if (!a) a = 1;
+              else a = ((c[a >> 2] | 0) == 0) & 1;
+              return a | 0;
+            }
+            function i5(b, e, f) {
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0.0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              switch (e | 0) {
+                case 0: {
+                  l = -149;
+                  m = 24;
+                  j = 4;
+                  break;
+                }
+                case 1: {
+                  l = -1074;
+                  m = 53;
+                  j = 4;
+                  break;
+                }
+                case 2: {
+                  l = -1074;
+                  m = 53;
+                  j = 4;
+                  break;
+                }
+                default:
+                  g = 0.0;
+              }
+              a: do
+                if ((j | 0) == 4) {
+                  o = (b + 4) | 0;
+                  n = (b + 100) | 0;
+                  do {
+                    e = c[o >> 2] | 0;
+                    if (e >>> 0 < (c[n >> 2] | 0) >>> 0) {
+                      c[o >> 2] = e + 1;
+                      e = d[e >> 0] | 0;
+                    } else e = Y2(b) | 0;
+                  } while ((S2(e) | 0) != 0);
+                  b: do
+                    switch (e | 0) {
+                      case 43:
+                      case 45: {
+                        i = (1 - ((((e | 0) == 45) & 1) << 1)) | 0;
+                        e = c[o >> 2] | 0;
+                        if (e >>> 0 < (c[n >> 2] | 0) >>> 0) {
+                          c[o >> 2] = e + 1;
+                          h = d[e >> 0] | 0;
+                          break b;
+                        } else {
+                          h = Y2(b) | 0;
+                          break b;
+                        }
+                      }
+                      default: {
+                        h = e;
+                        i = 1;
+                      }
+                    }
+                  while (0);
+                  e = 0;
+                  do {
+                    if ((h | 32 | 0) != (a[(153584 + e) >> 0] | 0)) break;
+                    do
+                      if (e >>> 0 < 7) {
+                        h = c[o >> 2] | 0;
+                        if (h >>> 0 < (c[n >> 2] | 0) >>> 0) {
+                          c[o >> 2] = h + 1;
+                          h = d[h >> 0] | 0;
+                          break;
+                        } else {
+                          h = Y2(b) | 0;
+                          break;
+                        }
+                      }
+                    while (0);
+                    e = (e + 1) | 0;
+                  } while (e >>> 0 < 8);
+                  c: do
+                    switch (e | 0) {
+                      case 8:
+                        break;
+                      case 3: {
+                        j = 23;
+                        break;
+                      }
+                      default: {
+                        k = (f | 0) != 0;
+                        if (k & (e >>> 0 > 3))
+                          if ((e | 0) == 8) break c;
+                          else {
+                            j = 23;
+                            break c;
+                          }
+                        d: do
+                          if (!e) {
+                            e = 0;
+                            do {
+                              if ((h | 32 | 0) != (a[(153593 + e) >> 0] | 0)) break d;
+                              do
+                                if (e >>> 0 < 2) {
+                                  h = c[o >> 2] | 0;
+                                  if (h >>> 0 < (c[n >> 2] | 0) >>> 0) {
+                                    c[o >> 2] = h + 1;
+                                    h = d[h >> 0] | 0;
+                                    break;
+                                  } else {
+                                    h = Y2(b) | 0;
+                                    break;
+                                  }
+                                }
+                              while (0);
+                              e = (e + 1) | 0;
+                            } while (e >>> 0 < 3);
+                          }
+                        while (0);
+                        switch (e | 0) {
+                          case 3: {
+                            e = c[o >> 2] | 0;
+                            if (e >>> 0 < (c[n >> 2] | 0) >>> 0) {
+                              c[o >> 2] = e + 1;
+                              e = d[e >> 0] | 0;
+                            } else e = Y2(b) | 0;
+                            if ((e | 0) == 40) e = 1;
+                            else {
+                              if (!(c[n >> 2] | 0)) {
+                                g = s;
+                                break a;
+                              }
+                              c[o >> 2] = (c[o >> 2] | 0) + -1;
+                              g = s;
+                              break a;
+                            }
+                            while (1) {
+                              h = c[o >> 2] | 0;
+                              if (h >>> 0 < (c[n >> 2] | 0) >>> 0) {
+                                c[o >> 2] = h + 1;
+                                h = d[h >> 0] | 0;
+                              } else h = Y2(b) | 0;
+                              if (
+                                !((((h + -48) | 0) >>> 0 < 10) | (((h + -65) | 0) >>> 0 < 26))
+                                  ? !(((h | 0) == 95) | (((h + -97) | 0) >>> 0 < 26))
+                                  : 0
+                              )
+                                break;
+                              e = (e + 1) | 0;
+                            }
+                            if ((h | 0) == 41) {
+                              g = s;
+                              break a;
+                            }
+                            h = (c[n >> 2] | 0) == 0;
+                            if (!h) c[o >> 2] = (c[o >> 2] | 0) + -1;
+                            if (!k) {
+                              c[(d2() | 0) >> 2] = 22;
+                              W2(b, 0);
+                              g = 0.0;
+                              break a;
+                            }
+                            if (!e) {
+                              g = s;
+                              break a;
+                            }
+                            while (1) {
+                              e = (e + -1) | 0;
+                              if (!h) c[o >> 2] = (c[o >> 2] | 0) + -1;
+                              if (!e) {
+                                g = s;
+                                break a;
+                              }
+                            }
+                          }
+                          case 0: {
+                            if ((h | 0) == 48) {
+                              e = c[o >> 2] | 0;
+                              if (e >>> 0 < (c[n >> 2] | 0) >>> 0) {
+                                c[o >> 2] = e + 1;
+                                e = d[e >> 0] | 0;
+                              } else e = Y2(b) | 0;
+                              if ((e | 32 | 0) == 120) {
+                                g = +j5(b, m, l, i, f);
+                                break a;
+                              }
+                              if (!(c[n >> 2] | 0)) e = 48;
+                              else {
+                                c[o >> 2] = (c[o >> 2] | 0) + -1;
+                                e = 48;
+                              }
+                            } else e = h;
+                            g = +k5(b, e, m, l, i, f);
+                            break a;
+                          }
+                          default: {
+                            if (c[n >> 2] | 0) c[o >> 2] = (c[o >> 2] | 0) + -1;
+                            c[(d2() | 0) >> 2] = 22;
+                            W2(b, 0);
+                            g = 0.0;
+                            break a;
+                          }
+                        }
+                      }
+                    }
+                  while (0);
+                  if ((j | 0) == 23) {
+                    h = (c[n >> 2] | 0) == 0;
+                    if (!h) c[o >> 2] = (c[o >> 2] | 0) + -1;
+                    if (((f | 0) != 0) & (e >>> 0 > 3))
+                      do {
+                        if (!h) c[o >> 2] = (c[o >> 2] | 0) + -1;
+                        e = (e + -1) | 0;
+                      } while (e >>> 0 > 3);
+                  }
+                  g = +(i | 0) * t;
+                }
+              while (0);
+              return +g;
+            }
+            function j5(a, b, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0.0,
+                i = 0,
+                j = 0,
+                k = 0.0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0.0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0;
+              y = (a + 4) | 0;
+              i = c[y >> 2] | 0;
+              x = (a + 100) | 0;
+              if (i >>> 0 < (c[x >> 2] | 0) >>> 0) {
+                c[y >> 2] = i + 1;
+                j = d[i >> 0] | 0;
+                l = 0;
+              } else {
+                j = Y2(a) | 0;
+                l = 0;
+              }
+              a: while (1) {
+                switch (j | 0) {
+                  case 46: {
+                    w = 8;
+                    break a;
+                  }
+                  case 48:
+                    break;
+                  default: {
+                    s = 0;
+                    n = 0;
+                    o = 1.0;
+                    h = 0.0;
+                    i = 0;
+                    m = j;
+                    t = l;
+                    v = 0;
+                    u = 0;
+                    l = 0;
+                    j = 0;
+                    break a;
+                  }
+                }
+                i = c[y >> 2] | 0;
+                if (i >>> 0 < (c[x >> 2] | 0) >>> 0) {
+                  c[y >> 2] = i + 1;
+                  j = d[i >> 0] | 0;
+                  l = 1;
+                  continue;
+                } else {
+                  j = Y2(a) | 0;
+                  l = 1;
+                  continue;
+                }
+              }
+              if ((w | 0) == 8) {
+                i = c[y >> 2] | 0;
+                if (i >>> 0 < (c[x >> 2] | 0) >>> 0) {
+                  c[y >> 2] = i + 1;
+                  j = d[i >> 0] | 0;
+                } else j = Y2(a) | 0;
+                if ((j | 0) == 48) {
+                  l = 0;
+                  j = 0;
+                  do {
+                    i = c[y >> 2] | 0;
+                    if (i >>> 0 < (c[x >> 2] | 0) >>> 0) {
+                      c[y >> 2] = i + 1;
+                      m = d[i >> 0] | 0;
+                    } else m = Y2(a) | 0;
+                    l = J6(l | 0, j | 0, -1, -1) | 0;
+                    j = z;
+                  } while ((m | 0) == 48);
+                  s = 1;
+                  n = 0;
+                  o = 1.0;
+                  h = 0.0;
+                  i = 0;
+                  t = 1;
+                  v = 0;
+                  u = 0;
+                } else {
+                  s = 1;
+                  n = 0;
+                  o = 1.0;
+                  h = 0.0;
+                  i = 0;
+                  m = j;
+                  t = l;
+                  v = 0;
+                  u = 0;
+                  l = 0;
+                  j = 0;
+                }
+              }
+              while (1) {
+                q = (m + -48) | 0;
+                p = m | 32;
+                if (q >>> 0 >= 10) {
+                  r = (m | 0) == 46;
+                  if (!(r | (((p + -97) | 0) >>> 0 < 6))) break;
+                  if (r)
+                    if (!s) {
+                      s = 1;
+                      k = o;
+                      r = t;
+                      l = u;
+                      j = v;
+                      q = u;
+                      p = v;
+                    } else {
+                      m = 46;
+                      break;
+                    }
+                  else w = 20;
+                } else w = 20;
+                if ((w | 0) == 20) {
+                  w = 0;
+                  m = (m | 0) > 57 ? (p + -87) | 0 : q;
+                  do
+                    if (!(((v | 0) < 0) | (((v | 0) == 0) & (u >>> 0 < 8))))
+                      if (((v | 0) < 0) | (((v | 0) == 0) & (u >>> 0 < 14))) {
+                        o = o * 0.0625;
+                        k = o;
+                        h = h + o * +(m | 0);
+                        break;
+                      } else {
+                        t = ((n | 0) != 0) | ((m | 0) == 0);
+                        n = t ? n : 1;
+                        k = o;
+                        h = t ? h : h + o * 0.5;
+                        break;
+                      }
+                    else {
+                      k = o;
+                      i = (m + (i << 4)) | 0;
+                    }
+                  while (0);
+                  q = J6(u | 0, v | 0, 1, 0) | 0;
+                  r = 1;
+                  p = z;
+                }
+                m = c[y >> 2] | 0;
+                if (m >>> 0 < (c[x >> 2] | 0) >>> 0) {
+                  c[y >> 2] = m + 1;
+                  o = k;
+                  m = d[m >> 0] | 0;
+                  t = r;
+                  v = p;
+                  u = q;
+                  continue;
+                } else {
+                  o = k;
+                  m = Y2(a) | 0;
+                  t = r;
+                  v = p;
+                  u = q;
+                  continue;
+                }
+              }
+              do
+                if (!t) {
+                  i = (c[x >> 2] | 0) == 0;
+                  if (!i) c[y >> 2] = (c[y >> 2] | 0) + -1;
+                  if (g) {
+                    if (!i) c[y >> 2] = (c[y >> 2] | 0) + -1;
+                    if (!(((s | 0) == 0) | i)) c[y >> 2] = (c[y >> 2] | 0) + -1;
+                  } else W2(a, 0);
+                  h = +(f | 0) * 0.0;
+                } else {
+                  p = (s | 0) == 0;
+                  q = p ? u : l;
+                  p = p ? v : j;
+                  if (((v | 0) < 0) | (((v | 0) == 0) & (u >>> 0 < 8))) {
+                    l = u;
+                    j = v;
+                    while (1) {
+                      i = i << 4;
+                      w = l;
+                      l = J6(l | 0, j | 0, 1, 0) | 0;
+                      if (!(((j | 0) < 0) | (((j | 0) == 0) & (w >>> 0 < 7)))) {
+                        n = i;
+                        break;
+                      } else j = z;
+                    }
+                  } else n = i;
+                  if ((m | 32 | 0) == 112) {
+                    j = l5(a, g) | 0;
+                    i = z;
+                    if (((j | 0) == 0) & ((i | 0) == -2147483648)) {
+                      if (!g) {
+                        W2(a, 0);
+                        h = 0.0;
+                        break;
+                      }
+                      if (!(c[x >> 2] | 0)) {
+                        j = 0;
+                        i = 0;
+                      } else {
+                        c[y >> 2] = (c[y >> 2] | 0) + -1;
+                        j = 0;
+                        i = 0;
+                      }
+                    }
+                  } else if (!(c[x >> 2] | 0)) {
+                    j = 0;
+                    i = 0;
+                  } else {
+                    c[y >> 2] = (c[y >> 2] | 0) + -1;
+                    j = 0;
+                    i = 0;
+                  }
+                  l = R6(q | 0, p | 0, 2) | 0;
+                  l = J6(l | 0, z | 0, -32, -1) | 0;
+                  l = J6(l | 0, z | 0, j | 0, i | 0) | 0;
+                  i = z;
+                  if (!n) {
+                    h = +(f | 0) * 0.0;
+                    break;
+                  }
+                  y = (0 - e) | 0;
+                  g = (((y | 0) < 0) << 31) >> 31;
+                  if (((i | 0) > (g | 0)) | (((i | 0) == (g | 0)) & (l >>> 0 > y >>> 0))) {
+                    c[(d2() | 0) >> 2] = 34;
+                    h = +(f | 0) * 1797693134862315708145274.0e284 * 1797693134862315708145274.0e284;
+                    break;
+                  }
+                  y = (e + -106) | 0;
+                  g = (((y | 0) < 0) << 31) >> 31;
+                  if (((i | 0) < (g | 0)) | (((i | 0) == (g | 0)) & (l >>> 0 < y >>> 0))) {
+                    c[(d2() | 0) >> 2] = 34;
+                    h = +(f | 0) * 2.2250738585072014e-308 * 2.2250738585072014e-308;
+                    break;
+                  }
+                  if ((n | 0) > -1) {
+                    j = n;
+                    do {
+                      y = !(h >= 0.5);
+                      j = (j << 1) | ((y ^ 1) & 1);
+                      h = h + (y ? h : h + -1.0);
+                      l = J6(l | 0, i | 0, -1, -1) | 0;
+                      i = z;
+                    } while ((j | 0) > -1);
+                    o = h;
+                    m = j;
+                  } else {
+                    o = h;
+                    m = n;
+                  }
+                  y = (((b | 0) < 0) << 31) >> 31;
+                  e = K6(32, 0, e | 0, ((((e | 0) < 0) << 31) >> 31) | 0) | 0;
+                  i = J6(e | 0, z | 0, l | 0, i | 0) | 0;
+                  e = z;
+                  if (((e | 0) < (y | 0)) | (((e | 0) == (y | 0)) & (i >>> 0 < b >>> 0)))
+                    if ((i | 0) > 0) w = 59;
+                    else {
+                      j = 0;
+                      i = 84;
+                      w = 61;
+                    }
+                  else {
+                    i = b;
+                    w = 59;
+                  }
+                  if ((w | 0) == 59)
+                    if ((i | 0) < 53) {
+                      j = i;
+                      i = (84 - i) | 0;
+                      w = 61;
+                    } else {
+                      k = 0.0;
+                      h = +(f | 0);
+                    }
+                  if ((w | 0) == 61) {
+                    h = +(f | 0);
+                    k = +G2(+D2(1.0, i), h);
+                    i = j;
+                  }
+                  f = (((m & 1) | 0) == 0) & ((o != 0.0) & ((i | 0) < 32));
+                  h = (f ? 0.0 : o) * h + (k + h * +(((m + (f & 1)) | 0) >>> 0)) - k;
+                  if (!(h != 0.0)) c[(d2() | 0) >> 2] = 34;
+                  h = +H2(h, l);
+                }
+              while (0);
+              return +h;
+            }
+            function k5(a, b, e, f, g, h) {
+              a = a | 0;
+              b = b | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              var i = 0.0,
+                j = 0.0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0.0,
+                s = 0.0,
+                t = 0.0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                A = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0.0;
+              J = l;
+              l = (l + 512) | 0;
+              G = J;
+              H = (f + e) | 0;
+              I = (0 - H) | 0;
+              D = (a + 4) | 0;
+              E = (a + 100) | 0;
+              k = 0;
+              a: while (1) {
+                switch (b | 0) {
+                  case 46: {
+                    A = 6;
+                    break a;
+                  }
+                  case 48:
+                    break;
+                  default: {
+                    v = 0;
+                    p = k;
+                    q = 0;
+                    o = 0;
+                    break a;
+                  }
+                }
+                b = c[D >> 2] | 0;
+                if (b >>> 0 < (c[E >> 2] | 0) >>> 0) {
+                  c[D >> 2] = b + 1;
+                  b = d[b >> 0] | 0;
+                  k = 1;
+                  continue;
+                } else {
+                  b = Y2(a) | 0;
+                  k = 1;
+                  continue;
+                }
+              }
+              if ((A | 0) == 6) {
+                b = c[D >> 2] | 0;
+                if (b >>> 0 < (c[E >> 2] | 0) >>> 0) {
+                  c[D >> 2] = b + 1;
+                  b = d[b >> 0] | 0;
+                } else b = Y2(a) | 0;
+                if ((b | 0) == 48) {
+                  k = 0;
+                  b = 0;
+                  while (1) {
+                    k = J6(k | 0, b | 0, -1, -1) | 0;
+                    o = z;
+                    b = c[D >> 2] | 0;
+                    if (b >>> 0 < (c[E >> 2] | 0) >>> 0) {
+                      c[D >> 2] = b + 1;
+                      b = d[b >> 0] | 0;
+                    } else b = Y2(a) | 0;
+                    if ((b | 0) == 48) b = o;
+                    else {
+                      v = 1;
+                      p = 1;
+                      q = k;
+                      break;
+                    }
+                  }
+                } else {
+                  v = 1;
+                  p = k;
+                  q = 0;
+                  o = 0;
+                }
+              }
+              c[G >> 2] = 0;
+              n = (b + -48) | 0;
+              m = (b | 0) == 46;
+              b: do
+                if (m | (n >>> 0 < 10)) {
+                  C = (G + 496) | 0;
+                  w = 0;
+                  k = 0;
+                  u = 0;
+                  x = v;
+                  y = p;
+                  A = n;
+                  p = 0;
+                  n = 0;
+                  c: while (1) {
+                    do
+                      if (m)
+                        if (!x) {
+                          x = 1;
+                          q = p;
+                          o = n;
+                        } else break c;
+                      else {
+                        p = J6(p | 0, n | 0, 1, 0) | 0;
+                        n = z;
+                        v = (b | 0) != 48;
+                        if ((k | 0) >= 125) {
+                          if (!v) break;
+                          c[C >> 2] = c[C >> 2] | 1;
+                          break;
+                        }
+                        m = (G + (k << 2)) | 0;
+                        if (!w) b = A;
+                        else b = (b + -48 + (((c[m >> 2] | 0) * 10) | 0)) | 0;
+                        c[m >> 2] = b;
+                        w = (w + 1) | 0;
+                        y = (w | 0) == 9;
+                        w = y ? 0 : w;
+                        k = (k + (y & 1)) | 0;
+                        u = v ? p : u;
+                        y = 1;
+                      }
+                    while (0);
+                    b = c[D >> 2] | 0;
+                    if (b >>> 0 < (c[E >> 2] | 0) >>> 0) {
+                      c[D >> 2] = b + 1;
+                      b = d[b >> 0] | 0;
+                    } else b = Y2(a) | 0;
+                    A = (b + -48) | 0;
+                    m = (b | 0) == 46;
+                    if (!(m | (A >>> 0 < 10))) {
+                      v = x;
+                      m = y;
+                      A = 29;
+                      break b;
+                    }
+                  }
+                  b = w;
+                  m = (y | 0) != 0;
+                  A = 37;
+                } else {
+                  w = 0;
+                  k = 0;
+                  u = 0;
+                  m = p;
+                  p = 0;
+                  n = 0;
+                  A = 29;
+                }
+              while (0);
+              do
+                if ((A | 0) == 29) {
+                  C = (v | 0) == 0;
+                  q = C ? p : q;
+                  o = C ? n : o;
+                  m = (m | 0) != 0;
+                  if (!(m & ((b | 32 | 0) == 101)))
+                    if ((b | 0) > -1) {
+                      b = w;
+                      A = 37;
+                      break;
+                    } else {
+                      b = w;
+                      A = 39;
+                      break;
+                    }
+                  m = l5(a, h) | 0;
+                  b = z;
+                  if (((m | 0) == 0) & ((b | 0) == -2147483648)) {
+                    if (!h) {
+                      W2(a, 0);
+                      i = 0.0;
+                      break;
+                    }
+                    if (!(c[E >> 2] | 0)) {
+                      m = 0;
+                      b = 0;
+                    } else {
+                      c[D >> 2] = (c[D >> 2] | 0) + -1;
+                      m = 0;
+                      b = 0;
+                    }
+                  }
+                  y = J6(m | 0, b | 0, q | 0, o | 0) | 0;
+                  b = w;
+                  o = z;
+                  A = 41;
+                }
+              while (0);
+              if ((A | 0) == 37)
+                if (c[E >> 2] | 0) {
+                  c[D >> 2] = (c[D >> 2] | 0) + -1;
+                  if (m) {
+                    y = q;
+                    A = 41;
+                  } else A = 40;
+                } else A = 39;
+              if ((A | 0) == 39)
+                if (m) {
+                  y = q;
+                  A = 41;
+                } else A = 40;
+              do
+                if ((A | 0) == 40) {
+                  c[(d2() | 0) >> 2] = 22;
+                  W2(a, 0);
+                  i = 0.0;
+                } else if ((A | 0) == 41) {
+                  m = c[G >> 2] | 0;
+                  if (!m) {
+                    i = +(g | 0) * 0.0;
+                    break;
+                  }
+                  if (
+                    (((n | 0) < 0) | (((n | 0) == 0) & (p >>> 0 < 10))) & (((y | 0) == (p | 0)) & ((o | 0) == (n | 0)))
+                      ? ((e | 0) > 30) | (((m >>> e) | 0) == 0)
+                      : 0
+                  ) {
+                    i = +(g | 0) * +(m >>> 0);
+                    break;
+                  }
+                  a = ((f | 0) / -2) | 0;
+                  E = (((a | 0) < 0) << 31) >> 31;
+                  if (((o | 0) > (E | 0)) | (((o | 0) == (E | 0)) & (y >>> 0 > a >>> 0))) {
+                    c[(d2() | 0) >> 2] = 34;
+                    i = +(g | 0) * 1797693134862315708145274.0e284 * 1797693134862315708145274.0e284;
+                    break;
+                  }
+                  a = (f + -106) | 0;
+                  E = (((a | 0) < 0) << 31) >> 31;
+                  if (((o | 0) < (E | 0)) | (((o | 0) == (E | 0)) & (y >>> 0 < a >>> 0))) {
+                    c[(d2() | 0) >> 2] = 34;
+                    i = +(g | 0) * 2.2250738585072014e-308 * 2.2250738585072014e-308;
+                    break;
+                  }
+                  if (b) {
+                    if ((b | 0) < 9) {
+                      n = (G + (k << 2)) | 0;
+                      m = c[n >> 2] | 0;
+                      while (1) {
+                        m = (m * 10) | 0;
+                        if ((b | 0) >= 8) break;
+                        else b = (b + 1) | 0;
+                      }
+                      c[n >> 2] = m;
+                    }
+                    k = (k + 1) | 0;
+                  }
+                  if ((u | 0) < 9 ? ((u | 0) <= (y | 0)) & ((y | 0) < 18) : 0) {
+                    if ((y | 0) == 9) {
+                      i = +(g | 0) * +((c[G >> 2] | 0) >>> 0);
+                      break;
+                    }
+                    if ((y | 0) < 9) {
+                      i = (+(g | 0) * +((c[G >> 2] | 0) >>> 0)) / +(c[(63712 + ((8 - y) << 2)) >> 2] | 0);
+                      break;
+                    }
+                    a = (e + 27 + (O(y, -3) | 0)) | 0;
+                    b = c[G >> 2] | 0;
+                    if (((a | 0) > 30) | (((b >>> a) | 0) == 0)) {
+                      i = +(g | 0) * +(b >>> 0) * +(c[(63712 + ((y + -10) << 2)) >> 2] | 0);
+                      break;
+                    }
+                  }
+                  b = (y | 0) % 9 | 0;
+                  if (!b) {
+                    b = 0;
+                    n = 0;
+                  } else {
+                    u = (y | 0) > -1 ? b : (b + 9) | 0;
+                    p = c[(63712 + ((8 - u) << 2)) >> 2] | 0;
+                    if (k) {
+                      q = (1e9 / (p | 0)) | 0;
+                      n = 0;
+                      o = 0;
+                      m = y;
+                      b = 0;
+                      do {
+                        D = (G + (b << 2)) | 0;
+                        E = c[D >> 2] | 0;
+                        a = ((((E >>> 0) / (p >>> 0)) | 0) + n) | 0;
+                        c[D >> 2] = a;
+                        n = O(q, (E >>> 0) % (p >>> 0) | 0) | 0;
+                        a = ((b | 0) == (o | 0)) & ((a | 0) == 0);
+                        m = a ? (m + -9) | 0 : m;
+                        o = a ? (o + 1) & 127 : o;
+                        b = (b + 1) | 0;
+                      } while ((b | 0) != (k | 0));
+                      if (!n) n = o;
+                      else {
+                        c[(G + (k << 2)) >> 2] = n;
+                        n = o;
+                        k = (k + 1) | 0;
+                      }
+                    } else {
+                      n = 0;
+                      k = 0;
+                      m = y;
+                    }
+                    b = 0;
+                    y = (9 - u + m) | 0;
+                  }
+                  d: while (1) {
+                    u = (y | 0) < 18;
+                    v = (y | 0) == 18;
+                    w = (G + (n << 2)) | 0;
+                    while (1) {
+                      if (!u) {
+                        if (!v) {
+                          m = y;
+                          break d;
+                        }
+                        if ((c[w >> 2] | 0) >>> 0 >= 9007199) {
+                          m = 18;
+                          break d;
+                        }
+                      }
+                      m = 0;
+                      x = k;
+                      k = (k + 127) | 0;
+                      while (1) {
+                        o = k & 127;
+                        p = (G + (o << 2)) | 0;
+                        k = R6(c[p >> 2] | 0, 0, 29) | 0;
+                        k = J6(k | 0, z | 0, m | 0, 0) | 0;
+                        m = z;
+                        if ((m >>> 0 > 0) | (((m | 0) == 0) & (k >>> 0 > 1e9))) {
+                          q = N6(k | 0, m | 0, 1e9, 0) | 0;
+                          k = O6(k | 0, m | 0, 1e9, 0) | 0;
+                        } else q = 0;
+                        c[p >> 2] = k;
+                        a = (o | 0) == (n | 0);
+                        x = ((k | 0) == 0) & ((((o | 0) != (((x + 127) & 127) | 0)) | a) ^ 1) ? o : x;
+                        if (a) break;
+                        else {
+                          m = q;
+                          k = (o + -1) | 0;
+                        }
+                      }
+                      b = (b + -29) | 0;
+                      if (q | 0) break;
+                      else k = x;
+                    }
+                    n = (n + 127) & 127;
+                    k = (x + 127) & 127;
+                    m = (G + (((x + 126) & 127) << 2)) | 0;
+                    if ((n | 0) == (x | 0)) c[m >> 2] = c[m >> 2] | c[(G + (k << 2)) >> 2];
+                    else k = x;
+                    c[(G + (n << 2)) >> 2] = q;
+                    y = (y + 9) | 0;
+                  }
+                  e: while (1) {
+                    w = (k + 1) & 127;
+                    x = (G + (((k + 127) & 127) << 2)) | 0;
+                    while (1) {
+                      q = (m | 0) == 18;
+                      v = (m | 0) > 27 ? 9 : 1;
+                      y = n;
+                      while (1) {
+                        p = 0;
+                        while (1) {
+                          n = (p + y) & 127;
+                          if ((n | 0) == (k | 0)) {
+                            F = 2;
+                            A = 88;
+                            break;
+                          }
+                          n = c[(G + (n << 2)) >> 2] | 0;
+                          o = c[(63744 + (p << 2)) >> 2] | 0;
+                          if (n >>> 0 < o >>> 0) {
+                            F = 2;
+                            A = 88;
+                            break;
+                          }
+                          if (n >>> 0 > o >>> 0) break;
+                          n = (p + 1) | 0;
+                          if ((p | 0) < 1) p = n;
+                          else {
+                            F = n;
+                            A = 88;
+                            break;
+                          }
+                        }
+                        if ((A | 0) == 88 ? ((A = 0), q & ((F | 0) == 2)) : 0) {
+                          i = 0.0;
+                          o = 0;
+                          break e;
+                        }
+                        b = (v + b) | 0;
+                        if ((y | 0) == (k | 0)) y = k;
+                        else break;
+                      }
+                      q = ((1 << v) + -1) | 0;
+                      u = 1e9 >>> v;
+                      p = 0;
+                      n = y;
+                      o = y;
+                      do {
+                        D = (G + (o << 2)) | 0;
+                        E = c[D >> 2] | 0;
+                        a = ((E >>> v) + p) | 0;
+                        c[D >> 2] = a;
+                        p = O(E & q, u) | 0;
+                        a = ((o | 0) == (n | 0)) & ((a | 0) == 0);
+                        m = a ? (m + -9) | 0 : m;
+                        n = a ? (n + 1) & 127 : n;
+                        o = (o + 1) & 127;
+                      } while ((o | 0) != (k | 0));
+                      if (!p) continue;
+                      if ((w | 0) != (n | 0)) break;
+                      c[x >> 2] = c[x >> 2] | 1;
+                    }
+                    c[(G + (k << 2)) >> 2] = p;
+                    k = w;
+                  }
+                  do {
+                    n = (o + y) & 127;
+                    m = (k + 1) & 127;
+                    if ((n | 0) == (k | 0)) {
+                      c[(G + ((m + -1) << 2)) >> 2] = 0;
+                      k = m;
+                    }
+                    i = i * 1.0e9 + +((c[(G + (n << 2)) >> 2] | 0) >>> 0);
+                    o = (o + 1) | 0;
+                  } while ((o | 0) != 2);
+                  t = +(g | 0);
+                  j = i * t;
+                  o = (b + 53) | 0;
+                  p = (o - f) | 0;
+                  q = (p | 0) < (e | 0);
+                  n = q ? ((p | 0) > 0 ? p : 0) : e;
+                  if ((n | 0) < 53) {
+                    K = +G2(+D2(1.0, (105 - n) | 0), j);
+                    r = +I2(j, +D2(1.0, (53 - n) | 0));
+                    s = K;
+                    i = r;
+                    r = K + (j - r);
+                  } else {
+                    s = 0.0;
+                    i = 0.0;
+                    r = j;
+                  }
+                  m = (y + 2) & 127;
+                  if ((m | 0) != (k | 0)) {
+                    m = c[(G + (m << 2)) >> 2] | 0;
+                    do
+                      if (m >>> 0 >= 5e8) {
+                        if ((m | 0) != 5e8) {
+                          i = t * 0.75 + i;
+                          break;
+                        }
+                        if ((((y + 3) & 127) | 0) == (k | 0)) {
+                          i = t * 0.5 + i;
+                          break;
+                        } else {
+                          i = t * 0.75 + i;
+                          break;
+                        }
+                      } else {
+                        if ((m | 0) == 0 ? (((y + 3) & 127) | 0) == (k | 0) : 0) break;
+                        i = t * 0.25 + i;
+                      }
+                    while (0);
+                    if (((53 - n) | 0) > 1 ? !(+I2(i, 1.0) != 0.0) : 0) j = i + 1.0;
+                    else j = i;
+                  } else j = i;
+                  i = r + j - s;
+                  do
+                    if (((o & 2147483647) | 0) > ((-2 - H) | 0)) {
+                      H = !(+B(+i) >= 9007199254740992.0);
+                      b = (b + ((H ^ 1) & 1)) | 0;
+                      i = H ? i : i * 0.5;
+                      if (((b + 50) | 0) <= (I | 0) ? !((j != 0.0) & (q & (((n | 0) != (p | 0)) | H))) : 0) break;
+                      c[(d2() | 0) >> 2] = 34;
+                    }
+                  while (0);
+                  i = +H2(i, b);
+                }
+              while (0);
+              l = J;
+              return +i;
+            }
+            function l5(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              h = (a + 4) | 0;
+              e = c[h >> 2] | 0;
+              i = (a + 100) | 0;
+              if (e >>> 0 < (c[i >> 2] | 0) >>> 0) {
+                c[h >> 2] = e + 1;
+                e = d[e >> 0] | 0;
+              } else e = Y2(a) | 0;
+              switch (e | 0) {
+                case 43:
+                case 45: {
+                  f = ((e | 0) == 45) & 1;
+                  e = c[h >> 2] | 0;
+                  if (e >>> 0 < (c[i >> 2] | 0) >>> 0) {
+                    c[h >> 2] = e + 1;
+                    e = d[e >> 0] | 0;
+                  } else e = Y2(a) | 0;
+                  if (((b | 0) != 0) & (((e + -48) | 0) >>> 0 > 9) ? (c[i >> 2] | 0) != 0 : 0)
+                    c[h >> 2] = (c[h >> 2] | 0) + -1;
+                  break;
+                }
+                default:
+                  f = 0;
+              }
+              if (((e + -48) | 0) >>> 0 > 9)
+                if (!(c[i >> 2] | 0)) {
+                  f = -2147483648;
+                  e = 0;
+                } else {
+                  c[h >> 2] = (c[h >> 2] | 0) + -1;
+                  f = -2147483648;
+                  e = 0;
+                }
+              else {
+                g = 0;
+                do {
+                  g = (e + -48 + ((g * 10) | 0)) | 0;
+                  e = c[h >> 2] | 0;
+                  if (e >>> 0 < (c[i >> 2] | 0) >>> 0) {
+                    c[h >> 2] = e + 1;
+                    e = d[e >> 0] | 0;
+                  } else e = Y2(a) | 0;
+                } while ((((e + -48) | 0) >>> 0 < 10) & ((g | 0) < 214748364));
+                b = (((g | 0) < 0) << 31) >> 31;
+                if (((e + -48) | 0) >>> 0 < 10)
+                  do {
+                    b = I6(g | 0, b | 0, 10, 0) | 0;
+                    g = z;
+                    e = J6(e | 0, ((((e | 0) < 0) << 31) >> 31) | 0, -48, -1) | 0;
+                    g = J6(e | 0, z | 0, b | 0, g | 0) | 0;
+                    b = z;
+                    e = c[h >> 2] | 0;
+                    if (e >>> 0 < (c[i >> 2] | 0) >>> 0) {
+                      c[h >> 2] = e + 1;
+                      e = d[e >> 0] | 0;
+                    } else e = Y2(a) | 0;
+                  } while (
+                    (((e + -48) | 0) >>> 0 < 10) &
+                    (((b | 0) < 21474836) | (((b | 0) == 21474836) & (g >>> 0 < 2061584302)))
+                  );
+                if (((e + -48) | 0) >>> 0 < 10)
+                  do {
+                    e = c[h >> 2] | 0;
+                    if (e >>> 0 < (c[i >> 2] | 0) >>> 0) {
+                      c[h >> 2] = e + 1;
+                      e = d[e >> 0] | 0;
+                    } else e = Y2(a) | 0;
+                  } while (((e + -48) | 0) >>> 0 < 10);
+                if (c[i >> 2] | 0) c[h >> 2] = (c[h >> 2] | 0) + -1;
+                i = (f | 0) != 0;
+                e = K6(0, 0, g | 0, b | 0) | 0;
+                f = i ? z : b;
+                e = i ? e : g;
+              }
+              z = f;
+              return e | 0;
+            }
+            function m5(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              e = (a + 84) | 0;
+              g = c[e >> 2] | 0;
+              h = (d + 256) | 0;
+              f = U2(g, 0, h) | 0;
+              f = (f | 0) == 0 ? h : (f - g) | 0;
+              d = f >>> 0 < d >>> 0 ? f : d;
+              W6(b | 0, g | 0, d | 0) | 0;
+              c[(a + 4) >> 2] = g + d;
+              b = (g + f) | 0;
+              c[(a + 8) >> 2] = b;
+              c[e >> 2] = b;
+              return d | 0;
+            }
+            function n5(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              return o5(a, b, c) | 0;
+            }
+            function o5(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              if ((c[(a + 76) >> 2] | 0) > -1) {
+                e = (J3(a) | 0) == 0;
+                b = p5(a, b, d) | 0;
+                if (!e) K3(a);
+              } else b = p5(a, b, d) | 0;
+              return b | 0;
+            }
+            function p5(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              if ((d | 0) == 1) b = (b - (c[(a + 8) >> 2] | 0) + (c[(a + 4) >> 2] | 0)) | 0;
+              e = (a + 20) | 0;
+              f = (a + 28) | 0;
+              if (
+                (c[e >> 2] | 0) >>> 0 > (c[f >> 2] | 0) >>> 0
+                  ? (nb[c[(a + 36) >> 2] & 63](a, 0, 0) | 0, (c[e >> 2] | 0) == 0)
+                  : 0
+              )
+                b = -1;
+              else {
+                c[(a + 16) >> 2] = 0;
+                c[f >> 2] = 0;
+                c[e >> 2] = 0;
+                if ((nb[c[(a + 40) >> 2] & 63](a, b, d) | 0) < 0) b = -1;
+                else {
+                  c[(a + 8) >> 2] = 0;
+                  c[(a + 4) >> 2] = 0;
+                  c[a >> 2] = c[a >> 2] & -17;
+                  b = 0;
+                }
+              }
+              return b | 0;
+            }
+            function q5(b) {
+              b = b | 0;
+              var c = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              while (1) {
+                e = a[b >> 0] | 0;
+                c = (e << 24) >> 24;
+                f = (b + 1) | 0;
+                if (!(S2(c) | 0)) break;
+                else b = f;
+              }
+              switch (c | 0) {
+                case 45: {
+                  b = 1;
+                  g = 5;
+                  break;
+                }
+                case 43: {
+                  b = 0;
+                  g = 5;
+                  break;
+                }
+                default: {
+                  h = 0;
+                  d = b;
+                  b = e;
+                }
+              }
+              if ((g | 0) == 5) {
+                h = b;
+                d = f;
+                b = a[f >> 0] | 0;
+              }
+              c = (((b << 24) >> 24) + -48) | 0;
+              if (c >>> 0 < 10) {
+                b = 0;
+                do {
+                  d = (d + 1) | 0;
+                  b = (((b * 10) | 0) - c) | 0;
+                  c = ((a[d >> 0] | 0) + -48) | 0;
+                } while (c >>> 0 < 10);
+              } else b = 0;
+              return (h | 0 ? b : (0 - b) | 0) | 0;
+            }
+            function r5(a) {
+              a = a | 0;
+              return +(+s5(a, 0));
+            }
+            function s5(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return +(+t5(a, b, 1));
+            }
+            function t5(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0.0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              i = l;
+              l = (l + 128) | 0;
+              h = i;
+              f = h;
+              g = (f + 124) | 0;
+              do {
+                c[f >> 2] = 0;
+                f = (f + 4) | 0;
+              } while ((f | 0) < (g | 0));
+              f = (h + 4) | 0;
+              c[f >> 2] = a;
+              g = (h + 8) | 0;
+              c[g >> 2] = -1;
+              c[(h + 44) >> 2] = a;
+              c[(h + 76) >> 2] = -1;
+              W2(h, 0);
+              e = +i5(h, d, 1);
+              d = ((c[f >> 2] | 0) - (c[g >> 2] | 0) + (c[(h + 108) >> 2] | 0)) | 0;
+              if (b | 0) c[b >> 2] = d | 0 ? (a + d) | 0 : a;
+              l = i;
+              return +e;
+            }
+            function u5(a, b, c, d, e) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              a: do
+                if (!c) b = 0;
+                else {
+                  h = b;
+                  while (1) {
+                    g = c >>> 1;
+                    b = (h + (O(g, d) | 0)) | 0;
+                    f = lb[e & 127](a, b) | 0;
+                    if (!f) break a;
+                    if ((c | 0) == 1) {
+                      b = 0;
+                      break a;
+                    }
+                    f = (f | 0) < 0;
+                    c = f ? g : (c - g) | 0;
+                    if (!c) {
+                      b = 0;
+                      break;
+                    } else h = f ? h : b;
+                  }
+                }
+              while (0);
+              return b | 0;
+            }
+            function v5(a, c) {
+              a = a | 0;
+              c = c | 0;
+              var d = 0,
+                f = 0,
+                g = 0;
+              g = (a + 2) | 0;
+              f = (a + 4) | 0;
+              d =
+                I6(
+                  ((e[(c + 2) >> 1] | 0) << 16) | (e[c >> 1] | 0) | 0,
+                  e[(c + 4) >> 1] | 0 | 0,
+                  ((e[g >> 1] | 0) << 16) | (e[a >> 1] | 0) | 0,
+                  e[f >> 1] | 0 | 0
+                ) | 0;
+              c = J6(d | 0, z | 0, e[(c + 6) >> 1] | 0 | 0, 0) | 0;
+              d = z;
+              b[a >> 1] = c;
+              a = Q6(c | 0, d | 0, 16) | 0;
+              b[g >> 1] = a;
+              b[f >> 1] = d;
+              z = d & 65535;
+              return c | 0;
+            }
+            function w5(a) {
+              a = a | 0;
+              var b = 0;
+              b = 186608;
+              c[b >> 2] = a + -1;
+              c[(b + 4) >> 2] = 0;
+              return;
+            }
+            function x5() {
+              var a = 0,
+                b = 0,
+                d = 0;
+              b = 186608;
+              b = I6(c[b >> 2] | 0, c[(b + 4) >> 2] | 0, 1284865837, 1481765933) | 0;
+              b = J6(b | 0, z | 0, 1, 0) | 0;
+              a = z;
+              d = 186608;
+              c[d >> 2] = b;
+              c[(d + 4) >> 2] = a;
+              a = Q6(b | 0, a | 0, 33) | 0;
+              return a | 0;
+            }
+            function y5(a) {
+              a = a | 0;
+              b[96876] = b[32922] | 0;
+              b[96877] = b[32923] | 0;
+              b[96878] = b[32924] | 0;
+              b[32922] = b[a >> 1] | 0;
+              b[32923] = b[(a + 2) >> 1] | 0;
+              b[32924] = b[(a + 4) >> 1] | 0;
+              return 193752;
+            }
+            function z5(a) {
+              a = a | 0;
+              var c = 0,
+                d = 0;
+              c = l;
+              l = (l + 16) | 0;
+              d = c;
+              b[d >> 1] = 13070;
+              b[(d + 2) >> 1] = a;
+              b[(d + 4) >> 1] = a >>> 16;
+              y5(d) | 0;
+              l = c;
+              return;
+            }
+            function A5(a) {
+              a = a | 0;
+              var b = 0;
+              b = v5(a, 65850) | 0;
+              b = R6(b | 0, z | 0, 4) | 0;
+              a = z | 1072693248;
+              c[j >> 2] = b;
+              c[(j + 4) >> 2] = a;
+              return +(+h[j >> 3] + -1.0);
+            }
+            function B5() {
+              return +(+A5(65844));
+            }
+            function C5(a, b) {
+              a = a | 0;
+              b = b | 0;
+              if (!a) b = V1(1, 24) | 0;
+              else {
+                c[b >> 2] = 0;
+                c[(b + 4) >> 2] = 0;
+                c[(b + 8) >> 2] = 0;
+                c[(b + 12) >> 2] = 0;
+                c[(b + 16) >> 2] = 0;
+                c[(b + 20) >> 2] = 0;
+              }
+              return b | 0;
+            }
+            function D5(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = c[a >> 2] | 0;
+              if (b | 0)
+                do {
+                  U1(c[b >> 2] | 0);
+                  d = b;
+                  b = c[(b + 4) >> 2] | 0;
+                  U1(d);
+                } while ((b | 0) != 0);
+              U1(a);
+              return;
+            }
+            function E5(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              h = (a + 16) | 0;
+              a: do
+                if (!(c[h >> 2] | 0)) {
+                  k = (a + 12) | 0;
+                  g = c[k >> 2] | 0;
+                  if (g >>> 0 < f >>> 0) {
+                    do
+                      if (b)
+                        if (!d) {
+                          c[h >> 2] = 1;
+                          b = 0;
+                          break a;
+                        } else {
+                          h = (a + 8) | 0;
+                          c[h >> 2] = d;
+                          g = 1024;
+                          b = d;
+                          break;
+                        }
+                      else {
+                        g = f << 3;
+                        g = g >>> 0 > 1024 ? g : 1024;
+                        j = T1(8) | 0;
+                        if (!j) {
+                          c[h >> 2] = 1;
+                          b = 0;
+                          break a;
+                        }
+                        b = T1(g) | 0;
+                        c[j >> 2] = b;
+                        d = b;
+                        if (!b) {
+                          U1(j);
+                          c[h >> 2] = 1;
+                          b = 0;
+                          break a;
+                        }
+                        c[(j + 4) >> 2] = 0;
+                        h = (a + 4) | 0;
+                        i = c[h >> 2] | 0;
+                        if (i | 0) c[(i + 4) >> 2] = j;
+                        if (!(c[a >> 2] | 0)) c[a >> 2] = j;
+                        c[h >> 2] = j;
+                        h = (a + 8) | 0;
+                        c[h >> 2] = d;
+                      }
+                    while (0);
+                    c[k >> 2] = g;
+                  } else {
+                    h = (a + 8) | 0;
+                    b = c[h >> 2] | 0;
+                    d = b;
+                  }
+                  d = (d + f) & 3;
+                  d = (((d | 0) == 0 ? 0 : (4 - d) | 0) + f) | 0;
+                  c[h >> 2] = b + d;
+                  c[k >> 2] = g - d;
+                  if (e) Y6(b | 0, 0, d | 0) | 0;
+                } else b = 0;
+              while (0);
+              return b | 0;
+            }
+            function F5(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0;
+              v = l;
+              l = (l + 48) | 0;
+              i = v;
+              t = G5() | 0;
+              a: do
+                if (!t) b = 12;
+                else {
+                  u = C5(0, 0) | 0;
+                  if (!u) {
+                    H5(t);
+                    b = 12;
+                    break;
+                  }
+                  e = (i + 8) | 0;
+                  c[e >> 2] = 0;
+                  c[(e + 4) >> 2] = 0;
+                  c[(e + 8) >> 2] = 0;
+                  c[(e + 12) >> 2] = 0;
+                  c[(e + 16) >> 2] = 0;
+                  c[i >> 2] = u;
+                  c[(i + 4) >> 2] = t;
+                  c[(i + 16) >> 2] = b;
+                  c[(i + 32) >> 2] = d;
+                  e = (i + 28) | 0;
+                  c[e >> 2] = -1;
+                  b = I5(i) | 0;
+                  b: do
+                    if (!b) {
+                      h = (i + 20) | 0;
+                      f = c[h >> 2] | 0;
+                      c[a >> 2] = f + -1;
+                      j = c[(i + 8) >> 2] | 0;
+                      b = c[e >> 2] | 0;
+                      if ((b | 0) < (f | 0)) {
+                        g = V1(1, 68) | 0;
+                        if (g) {
+                          r = (b >>> 31) ^ 1;
+                          c[(g + 60) >> 2] = r;
+                          c[(g + 28) >> 2] = f;
+                          if ((((d & 8) | 0) == 0) | ((r | 0) != 0)) {
+                            b = J5(0, t, j, g) | 0;
+                            if (b | 0) {
+                              h = 0;
+                              i = 0;
+                              f = 0;
+                              e = 0;
+                              break;
+                            }
+                            f = c[(g + 40) >> 2] | 0;
+                            if ((f | 0) > 0) {
+                              b = ((f << 2) + 4) | 0;
+                              e = T1(b) | 0;
+                              if (!e) {
+                                h = 0;
+                                i = 0;
+                                b = 12;
+                                f = 0;
+                                e = 0;
+                                break;
+                              }
+                              c[(g + 32) >> 2] = e;
+                              Y6(e | 0, -1, b | 0) | 0;
+                            } else e = 0;
+                            r = V1((f << 1) | 1, 4) | 0;
+                            c[(g + 36) >> 2] = r;
+                            if (!r) {
+                              h = 0;
+                              i = 0;
+                              b = 12;
+                              f = 0;
+                              e = 0;
+                              break;
+                            }
+                            b = V1(c[h >> 2] | 0, 12) | 0;
+                            if (!b) {
+                              h = 0;
+                              i = 0;
+                              b = 12;
+                              f = 0;
+                              e = 0;
+                              break;
+                            }
+                            c[(g + 16) >> 2] = b;
+                            b = J5(u, t, j, g) | 0;
+                            if (!b) b = e;
+                            else {
+                              h = 0;
+                              i = 0;
+                              f = 0;
+                              e = 0;
+                              break;
+                            }
+                          } else b = 0;
+                          r = (i + 24) | 0;
+                          b = K5(u, t, j, r, b) | 0;
+                          if (!b) {
+                            b = c[r >> 2] | 0;
+                            c[r >> 2] = b + 1;
+                            b = L5(u, 0, 0, b) | 0;
+                            if ((b | 0) != 0 ? ((s = M5(u, j, b) | 0), (s | 0) != 0) : 0) {
+                              b = N5(u, t, s) | 0;
+                              if (!b) {
+                                e = c[r >> 2] | 0;
+                                b = e << 2;
+                                p = T1(b) | 0;
+                                if (p) {
+                                  q = T1(b) | 0;
+                                  if (q) {
+                                    if ((e | 0) > 0) Y6(p | 0, 0, (e << 2) | 0) | 0;
+                                    O5(s, 0, p, 0) | 0;
+                                    f = c[r >> 2] | 0;
+                                    if ((f | 0) > 0) {
+                                      b = 0;
+                                      e = 0;
+                                      do {
+                                        c[(q + (e << 2)) >> 2] = b;
+                                        o = (p + (e << 2)) | 0;
+                                        b = (b + 1 + (c[o >> 2] | 0)) | 0;
+                                        c[o >> 2] = 0;
+                                        e = (e + 1) | 0;
+                                      } while ((e | 0) < (f | 0));
+                                      m = b;
+                                    } else m = 0;
+                                    n = V1((m + 1) | 0, 32) | 0;
+                                    if (n) {
+                                      c[g >> 2] = n;
+                                      o = (g + 4) | 0;
+                                      c[o >> 2] = m;
+                                      b = O5(s, n, p, q) | 0;
+                                      if (!b) {
+                                        c[(g + 20) >> 2] = 0;
+                                        f = (s + 24) | 0;
+                                        b = c[f >> 2] | 0;
+                                        e = 0;
+                                        while (1) {
+                                          e = (e + 1) | 0;
+                                          if ((c[b >> 2] | 0) <= -1) break;
+                                          else b = (b + 32) | 0;
+                                        }
+                                        k = V1(e, 32) | 0;
+                                        if (!k) {
+                                          h = p;
+                                          i = q;
+                                          b = 12;
+                                          f = p;
+                                          e = q;
+                                        } else {
+                                          c[(g + 8) >> 2] = k;
+                                          e = c[f >> 2] | 0;
+                                          f = c[e >> 2] | 0;
+                                          if ((f | 0) > -1) {
+                                            b = 0;
+                                            do {
+                                              c[(k + (b << 5) + 8) >> 2] = n + (c[(q + (f << 2)) >> 2] << 5);
+                                              c[(k + (b << 5) + 12) >> 2] = f;
+                                              i = (k + (b << 5) + 16) | 0;
+                                              c[i >> 2] = 0;
+                                              j = (e + 12) | 0;
+                                              h = c[j >> 2] | 0;
+                                              if (h | 0) {
+                                                f = 0;
+                                                do {
+                                                  w = f;
+                                                  f = (f + 1) | 0;
+                                                } while ((c[(h + (w << 2)) >> 2] | 0) > -1);
+                                                f = f << 2;
+                                                h = T1(f) | 0;
+                                                c[i >> 2] = h;
+                                                if (!h) {
+                                                  h = p;
+                                                  i = q;
+                                                  b = 12;
+                                                  f = p;
+                                                  e = q;
+                                                  break b;
+                                                }
+                                                W6(h | 0, c[j >> 2] | 0, f | 0) | 0;
+                                              }
+                                              c[(k + (b << 5) + 20) >> 2] = c[(e + 16) >> 2];
+                                              b = (b + 1) | 0;
+                                              e = (e + 32) | 0;
+                                              f = c[e >> 2] | 0;
+                                            } while ((f | 0) > -1);
+                                          } else b = 0;
+                                          c[(k + (b << 5) + 8) >> 2] = 0;
+                                          c[o >> 2] = m;
+                                          c[(g + 12) >> 2] = n + (c[(q + (c[c[(s + 28) >> 2] >> 2] << 2)) >> 2] << 5);
+                                          c[(g + 52) >> 2] = c[r >> 2];
+                                          c[(g + 56) >> 2] = d;
+                                          D5(u);
+                                          H5(t);
+                                          U1(p);
+                                          U1(q);
+                                          c[(a + 4) >> 2] = g;
+                                          b = 0;
+                                          break a;
+                                        }
+                                      } else {
+                                        h = p;
+                                        i = q;
+                                        f = p;
+                                        e = q;
+                                      }
+                                    } else {
+                                      h = p;
+                                      i = q;
+                                      b = 12;
+                                      f = p;
+                                      e = q;
+                                    }
+                                  } else {
+                                    h = p;
+                                    i = q;
+                                    b = 12;
+                                    f = p;
+                                    e = 0;
+                                  }
+                                } else {
+                                  h = p;
+                                  i = 0;
+                                  b = 12;
+                                  f = 0;
+                                  e = 0;
+                                }
+                              } else {
+                                h = 0;
+                                i = 0;
+                                f = 0;
+                                e = 0;
+                              }
+                            } else {
+                              h = 0;
+                              i = 0;
+                              b = 12;
+                              f = 0;
+                              e = 0;
+                            }
+                          } else {
+                            h = 0;
+                            i = 0;
+                            f = 0;
+                            e = 0;
+                          }
+                        } else {
+                          h = 0;
+                          i = 0;
+                          b = 12;
+                          f = 0;
+                          e = 0;
+                        }
+                      } else {
+                        g = 0;
+                        h = 0;
+                        i = 0;
+                        b = 6;
+                        f = 0;
+                        e = 0;
+                      }
+                    } else {
+                      g = 0;
+                      h = 0;
+                      i = 0;
+                      f = 0;
+                      e = 0;
+                    }
+                  while (0);
+                  D5(u);
+                  H5(t);
+                  if (h | 0) U1(f);
+                  if (i | 0) U1(e);
+                  c[(a + 4) >> 2] = g;
+                  P5(a);
+                }
+              while (0);
+              l = v;
+              return b | 0;
+            }
+            function G5() {
+              var a = 0,
+                b = 0;
+              a = T1(20) | 0;
+              do
+                if (a) {
+                  b = T1(2048) | 0;
+                  c[(a + 16) >> 2] = b;
+                  if (!b) {
+                    U1(a);
+                    a = 0;
+                    break;
+                  } else {
+                    c[a >> 2] = 512;
+                    c[(a + 4) >> 2] = 1024e3;
+                    c[(a + 8) >> 2] = 128;
+                    c[(a + 12) >> 2] = 0;
+                    break;
+                  }
+                }
+              while (0);
+              return a | 0;
+            }
+            function H5(a) {
+              a = a | 0;
+              U1(c[(a + 16) >> 2] | 0);
+              U1(a);
+              return;
+            }
+            function I5(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0;
+              u = l;
+              l = (l + 16) | 0;
+              p = (u + 4) | 0;
+              q = u;
+              r = c[(b + 32) >> 2] & 1;
+              s = (b + 16) | 0;
+              e = c[s >> 2] | 0;
+              t = c[(b + 4) >> 2] | 0;
+              d = T5(t, 0) | 0;
+              a: do
+                if (!d) {
+                  m = (r | 0) != 0;
+                  n = (b + 8) | 0;
+                  o = (b + 12) | 0;
+                  d = 0;
+                  k = 1;
+                  b: while (1) {
+                    g = 0;
+                    h = d;
+                    f = 0;
+                    c: while (1) {
+                      d = a[e >> 0] | 0;
+                      if (m) {
+                        if ((d << 24) >> 24 == 40) break;
+                        if (((h | 0) != 0) & ((d << 24) >> 24 == 41)) j = 13;
+                        else j = 14;
+                      } else if ((d << 24) >> 24 == 92)
+                        switch (a[(e + 1) >> 0] | 0) {
+                          case 40:
+                            break c;
+                          case 41: {
+                            j = 13;
+                            break;
+                          }
+                          default:
+                            j = 14;
+                        }
+                      else j = 14;
+                      if ((j | 0) == 13) {
+                        j = 0;
+                        i = L5(c[b >> 2] | 0, -1, -1, -1) | 0;
+                        c[n >> 2] = i;
+                        if (!i) {
+                          d = 12;
+                          break a;
+                        } else i = f;
+                      } else if ((j | 0) == 14) {
+                        j = 0;
+                        d = g6(b, e) | 0;
+                        if (d | 0) break a;
+                        i = f;
+                        e = c[o >> 2] | 0;
+                      }
+                      d: while (1) {
+                        e: while (1) {
+                          d = a[e >> 0] | 0;
+                          switch ((d << 24) >> 24) {
+                            case 42:
+                            case 92:
+                              break;
+                            default: {
+                              if (!m) break e;
+                              switch ((d << 24) >> 24) {
+                                case 123:
+                                case 63:
+                                case 43:
+                                  break;
+                                default:
+                                  break e;
+                              }
+                            }
+                          }
+                          d = (d << 24) >> 24 == 92;
+                          if (m & d) break;
+                          f = (e + 1) | 0;
+                          if (d)
+                            switch (a[f >> 0] | 0) {
+                              case 123:
+                              case 63:
+                              case 43:
+                                break;
+                              default:
+                                break e;
+                            }
+                          e = d ? f : e;
+                          if ((!m ? (e | 0) == (((c[s >> 2] | 0) + 1) | 0) : 0) ? (a[(e + -1) >> 0] | 0) == 94 : 0)
+                            break;
+                          if ((a[e >> 0] | 0) == 123) {
+                            e = h6((e + 1) | 0, r, p, q) | 0;
+                            if (!e) {
+                              j = 28;
+                              break b;
+                            }
+                            d = c[q >> 2] | 0;
+                            f = c[b >> 2] | 0;
+                            if (!d) d = L5(f, -1, -1, -1) | 0;
+                            else j = 36;
+                          } else {
+                            c[p >> 2] = 0;
+                            c[q >> 2] = -1;
+                            d = a[e >> 0] | 0;
+                            if ((d << 24) >> 24 == 43) {
+                              c[p >> 2] = 1;
+                              d = a[e >> 0] | 0;
+                            }
+                            if ((d << 24) >> 24 == 63) {
+                              c[q >> 2] = 1;
+                              d = 1;
+                            } else d = -1;
+                            e = (e + 1) | 0;
+                            f = c[b >> 2] | 0;
+                            j = 36;
+                          }
+                          if ((j | 0) == 36) {
+                            j = 0;
+                            d = b6(f, c[n >> 2] | 0, c[p >> 2] | 0, d, 0) | 0;
+                          }
+                          c[n >> 2] = d;
+                          if (!d) {
+                            d = 12;
+                            break a;
+                          }
+                        }
+                        d = M5(c[b >> 2] | 0, g, c[n >> 2] | 0) | 0;
+                        f = a[e >> 0] | 0;
+                        f: do
+                          if (m) {
+                            if ((f << 24) >> 24 == 124) {
+                              j = 40;
+                              break d;
+                            }
+                            if ((((h | 0) != 0) & ((f << 24) >> 24 == 41)) | ((f << 24) >> 24 == 0)) j = 47;
+                            else {
+                              g = d;
+                              f = i;
+                              continue c;
+                            }
+                          } else {
+                            switch ((f << 24) >> 24) {
+                              case 0: {
+                                j = 47;
+                                break f;
+                              }
+                              case 92:
+                                break;
+                              default: {
+                                g = d;
+                                f = i;
+                                continue c;
+                              }
+                            }
+                            switch (a[(e + 1) >> 0] | 0) {
+                              case 124:
+                              case 41:
+                                break;
+                              default: {
+                                g = d;
+                                f = i;
+                                continue c;
+                              }
+                            }
+                            d = c6(c[b >> 2] | 0, i, d) | 0;
+                            if ((a[(e + 1) >> 0] | 0) == 124) {
+                              f = 2;
+                              break d;
+                            }
+                            if (!h) {
+                              d = 8;
+                              break a;
+                            }
+                            e = (e + 2) | 0;
+                            f = 92;
+                          }
+                        while (0);
+                        if ((j | 0) == 47) {
+                          j = 0;
+                          d = c6(c[b >> 2] | 0, i, d) | 0;
+                          e = (f << 24) >> 24 == 41 ? (e + 1) | 0 : e;
+                        }
+                        d = i6(b, d, U5(t) | 0) | 0;
+                        if (d | 0) break a;
+                        d = (f << 24) >> 24 == 0;
+                        f = (h | 0) < 1;
+                        if (f & d) {
+                          j = 50;
+                          break b;
+                        }
+                        if (f | d) {
+                          d = 8;
+                          break a;
+                        }
+                        g = V5(t) | 0;
+                        h = (h + -1) | 0;
+                        i = V5(t) | 0;
+                      }
+                      if ((j | 0) == 40) {
+                        f = 1;
+                        d = c6(c[b >> 2] | 0, i, d) | 0;
+                      }
+                      g = 0;
+                      e = (e + f) | 0;
+                      f = d;
+                    }
+                    d = S5(t, f) | 0;
+                    if (d | 0) break a;
+                    d = S5(t, g) | 0;
+                    if (d | 0) break a;
+                    d = T5(t, k) | 0;
+                    if (d | 0) break a;
+                    d = (h + 1) | 0;
+                    k = (k + 1) | 0;
+                    e = m ? (e + 1) | 0 : (e + 2) | 0;
+                  }
+                  if ((j | 0) == 28) {
+                    d = 10;
+                    break;
+                  } else if ((j | 0) == 50) {
+                    c[(b + 20) >> 2] = k;
+                    d = 0;
+                    break;
+                  }
+                }
+              while (0);
+              l = u;
+              return d | 0;
+            }
+            function J5(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0;
+              x = R5(d) | 0;
+              y = ((b | 0) == 0) | ((f | 0) == 0);
+              if (!y) {
+                c[(f + 48) >> 2] = 0;
+                c[c[(f + 36) >> 2] >> 2] = -1;
+              }
+              h = c[(f + 28) >> 2] | 0;
+              z = T1(((h << 3) + 8) | 0) | 0;
+              do
+                if (!z) g = 12;
+                else {
+                  c[z >> 2] = -1;
+                  A = T1(((h << 2) + 4) | 0) | 0;
+                  if (!A) {
+                    U1(z);
+                    g = 12;
+                    break;
+                  }
+                  c[A >> 2] = -1;
+                  g = 0;
+                  while (1)
+                    if (g >>> 0 > h >>> 0) break;
+                    else g = (g + 1) | 0;
+                  S5(d, e) | 0;
+                  g = T5(d, 0) | 0;
+                  a: do
+                    if (((g | 0) != 0) | ((R5(d) | 0) <= (x | 0))) {
+                      e = z;
+                      n = 0;
+                      h = 0;
+                      m = 0;
+                      l = -1;
+                    } else {
+                      u = (f + 32) | 0;
+                      v = (f + 36) | 0;
+                      w = (f + 16) | 0;
+                      e = z;
+                      n = 0;
+                      h = 0;
+                      m = 0;
+                      t = 1;
+                      l = -1;
+                      s = 0;
+                      while (1) {
+                        b: do
+                          switch (U5(d) | 0) {
+                            case 6: {
+                              i = U5(d) | 0;
+                              g = 0;
+                              do {
+                                j = (e + (g << 2)) | 0;
+                                g = (g + 1) | 0;
+                              } while ((c[j >> 2] | 0) > -1);
+                              c[j >> 2] = (i << 1) | 1;
+                              c[(e + (g << 2)) >> 2] = -1;
+                              g = 0;
+                              while (1)
+                                if ((c[(A + (g << 2)) >> 2] | 0) > -1) g = (g + 1) | 0;
+                                else break;
+                              c[(A + ((g + -1) << 2)) >> 2] = -1;
+                              g = 0;
+                              j = t;
+                              i = s;
+                              break;
+                            }
+                            case 0: {
+                              q = V5(d) | 0;
+                              r = (q + 12) | 0;
+                              j = c[r >> 2] | 0;
+                              if ((j | 0) > -1) {
+                                g = 0;
+                                do {
+                                  i = (e + (g << 2)) | 0;
+                                  g = (g + 1) | 0;
+                                } while ((c[i >> 2] | 0) > -1);
+                                c[i >> 2] = j << 1;
+                                c[(e + (g << 2)) >> 2] = -1;
+                                if (!y) {
+                                  g = 0;
+                                  while (1)
+                                    if ((c[(A + (g << 2)) >> 2] | 0) > -1) g = (g + 1) | 0;
+                                    else break;
+                                  i = ((c[w >> 2] | 0) + ((j * 12) | 0) + 8) | 0;
+                                  c[i >> 2] = 0;
+                                  if ((g | 0) > 0) {
+                                    g = T1(((g << 2) + 4) | 0) | 0;
+                                    if (!g) {
+                                      g = 12;
+                                      j = t;
+                                      i = s;
+                                      break b;
+                                    }
+                                    c[i >> 2] = g;
+                                    i = c[A >> 2] | 0;
+                                    if ((i | 0) > -1) {
+                                      k = 0;
+                                      j = g;
+                                      do {
+                                        c[j >> 2] = i;
+                                        k = (k + 1) | 0;
+                                        i = c[(A + (k << 2)) >> 2] | 0;
+                                        j = (g + (k << 2)) | 0;
+                                      } while ((i | 0) > -1);
+                                      g = j;
+                                    }
+                                    c[g >> 2] = -1;
+                                  }
+                                }
+                                g = T5(d, c[r >> 2] | 0) | 0;
+                                if (g | 0) {
+                                  j = t;
+                                  i = s;
+                                  break b;
+                                }
+                                g = T5(d, 6) | 0;
+                                if (g | 0) {
+                                  j = t;
+                                  i = s;
+                                  break b;
+                                }
+                              }
+                              c: do
+                                switch (c[q >> 2] | 0) {
+                                  case 0: {
+                                    p = c[c[(q + 4) >> 2] >> 2] | 0;
+                                    if (((p | 0) > -1) | ((p | 0) == -4) ? (c[e >> 2] | 0) > -1 : 0) {
+                                      if (y) {
+                                        c[(q + 20) >> 2] = 1;
+                                        g = 0;
+                                      } else {
+                                        g = d6(b, q, m) | 0;
+                                        c[((c[u >> 2] | 0) + (m << 2)) >> 2] = s;
+                                        if ((l | 0) > -1) {
+                                          j = c[v >> 2] | 0;
+                                          i = 0;
+                                          while (1) {
+                                            k = (j + (i << 2)) | 0;
+                                            o = (i + 1) | 0;
+                                            if ((c[k >> 2] | 0) > -1) i = o;
+                                            else break;
+                                          }
+                                          c[k >> 2] = m;
+                                          c[(j + (o << 2)) >> 2] = l;
+                                          c[(j + ((i + 2) << 2)) >> 2] = -1;
+                                          h = (h + 1) | 0;
+                                          l = -1;
+                                        }
+                                        e6(e, f, m);
+                                      }
+                                      c[e >> 2] = -1;
+                                      p = (t + 1) | 0;
+                                      o = s;
+                                      n = (n + 1) | 0;
+                                      m = t;
+                                    } else {
+                                      p = t;
+                                      g = 0;
+                                      o = s;
+                                    }
+                                    break;
+                                  }
+                                  case 1: {
+                                    j = c[(q + 4) >> 2] | 0;
+                                    k = c[j >> 2] | 0;
+                                    j = c[(j + 4) >> 2] | 0;
+                                    g = S5(d, q) | 0;
+                                    if (!g) {
+                                      g = T5(d, 5) | 0;
+                                      if (!g) {
+                                        g = S5(d, j) | 0;
+                                        if (!g) {
+                                          g = T5(d, 0) | 0;
+                                          if (!g) {
+                                            i = (k + 20) | 0;
+                                            g = T5(d, ((c[i >> 2] | 0) + t) | 0) | 0;
+                                            if (!g) {
+                                              if ((c[i >> 2] | 0) > 0) {
+                                                i = (c[(j + 20) >> 2] | 0) > 0;
+                                                g = i ? t : -1;
+                                                i = (t + (i & 1)) | 0;
+                                              } else {
+                                                g = -1;
+                                                i = t;
+                                              }
+                                              g = T5(d, g) | 0;
+                                              if (!g) {
+                                                g = T5(d, 4) | 0;
+                                                if (!g) {
+                                                  g = S5(d, k) | 0;
+                                                  if (!g) {
+                                                    p = i;
+                                                    g = T5(d, 0) | 0;
+                                                    o = s;
+                                                  } else {
+                                                    p = i;
+                                                    o = s;
+                                                  }
+                                                } else {
+                                                  p = i;
+                                                  o = s;
+                                                }
+                                              } else {
+                                                p = i;
+                                                o = s;
+                                              }
+                                            } else {
+                                              p = t;
+                                              o = s;
+                                            }
+                                          } else {
+                                            p = t;
+                                            o = s;
+                                          }
+                                        } else {
+                                          p = t;
+                                          o = s;
+                                        }
+                                      } else {
+                                        p = t;
+                                        o = s;
+                                      }
+                                    } else {
+                                      p = t;
+                                      o = s;
+                                    }
+                                    break;
+                                  }
+                                  case 2: {
+                                    i = c[(q + 4) >> 2] | 0;
+                                    if (y) {
+                                      if ((c[e >> 2] | 0) > -1) g = 1;
+                                      else g = (a[(i + 12) >> 0] & 1) != 0;
+                                      g = T5(d, g & 1) | 0;
+                                      if (g | 0) {
+                                        p = t;
+                                        o = s;
+                                        break c;
+                                      }
+                                    } else {
+                                      g = T5(d, m) | 0;
+                                      if (g | 0) {
+                                        p = t;
+                                        o = s;
+                                        break c;
+                                      }
+                                      g = T5(d, a[(i + 12) >> 0] & 1) | 0;
+                                      if (g | 0) {
+                                        p = t;
+                                        o = s;
+                                        break c;
+                                      }
+                                    }
+                                    g = S5(d, q) | 0;
+                                    if (!g) {
+                                      g = T5(d, 1) | 0;
+                                      if (!g) {
+                                        g = S5(d, c[i >> 2] | 0) | 0;
+                                        if (!g) {
+                                          g = T5(d, 0) | 0;
+                                          if (!g) {
+                                            if ((c[e >> 2] | 0) <= -1 ? (a[(i + 12) >> 0] & 1) == 0 : 0) {
+                                              p = t;
+                                              g = 0;
+                                              o = 0;
+                                              break c;
+                                            }
+                                            if (y) g = 0;
+                                            else {
+                                              g = d6(b, q, m) | 0;
+                                              c[((c[u >> 2] | 0) + (m << 2)) >> 2] =
+                                                (a[(i + 12) >> 0] & 1) == 0 ? s : 1;
+                                              if ((l | 0) > -1) {
+                                                j = c[v >> 2] | 0;
+                                                i = 0;
+                                                while (1) {
+                                                  k = (j + (i << 2)) | 0;
+                                                  o = (i + 1) | 0;
+                                                  if ((c[k >> 2] | 0) > -1) i = o;
+                                                  else break;
+                                                }
+                                                c[k >> 2] = m;
+                                                c[(j + (o << 2)) >> 2] = l;
+                                                c[(j + ((i + 2) << 2)) >> 2] = -1;
+                                                h = (h + 1) | 0;
+                                                l = -1;
+                                              }
+                                              e6(e, f, m);
+                                            }
+                                            c[e >> 2] = -1;
+                                            p = (t + 1) | 0;
+                                            o = 0;
+                                            n = (n + 1) | 0;
+                                            m = t;
+                                          } else {
+                                            p = t;
+                                            o = s;
+                                          }
+                                        } else {
+                                          p = t;
+                                          o = s;
+                                        }
+                                      } else {
+                                        p = t;
+                                        o = s;
+                                      }
+                                    } else {
+                                      p = t;
+                                      o = s;
+                                    }
+                                    break;
+                                  }
+                                  case 3: {
+                                    j = c[(q + 4) >> 2] | 0;
+                                    k = c[j >> 2] | 0;
+                                    j = c[(j + 4) >> 2] | 0;
+                                    i = (c[e >> 2] | 0) > -1;
+                                    p = (t + 1) | 0;
+                                    g = T5(d, i ? p : t) | 0;
+                                    if (!g) {
+                                      g = T5(d, i ? t : m) | 0;
+                                      if (!g) {
+                                        g = S5(d, e) | 0;
+                                        if (!g) {
+                                          g = T5(d, ((c[e >> 2] | 0) >>> 31) ^ 1) | 0;
+                                          if (!g) {
+                                            g = S5(d, q) | 0;
+                                            if (!g) {
+                                              g = S5(d, j) | 0;
+                                              if (!g) {
+                                                g = S5(d, k) | 0;
+                                                if (!g) {
+                                                  g = T5(d, 3) | 0;
+                                                  if (!g) {
+                                                    g = S5(d, j) | 0;
+                                                    if (!g) {
+                                                      g = T5(d, 0) | 0;
+                                                      if (!g) {
+                                                        g = T5(d, 2) | 0;
+                                                        if (g | 0) {
+                                                          p = t;
+                                                          o = s;
+                                                          break c;
+                                                        }
+                                                        g = S5(d, k) | 0;
+                                                        if (g | 0) {
+                                                          p = t;
+                                                          o = s;
+                                                          break c;
+                                                        }
+                                                        g = T5(d, 0) | 0;
+                                                        if (g | 0) {
+                                                          p = t;
+                                                          o = s;
+                                                          break c;
+                                                        }
+                                                        if ((c[e >> 2] | 0) > -1) {
+                                                          if (y) g = 0;
+                                                          else {
+                                                            g = d6(b, q, m) | 0;
+                                                            c[((c[u >> 2] | 0) + (m << 2)) >> 2] = s;
+                                                            if ((l | 0) > -1) {
+                                                              j = c[v >> 2] | 0;
+                                                              i = 0;
+                                                              while (1) {
+                                                                k = (j + (i << 2)) | 0;
+                                                                o = (i + 1) | 0;
+                                                                if ((c[k >> 2] | 0) > -1) i = o;
+                                                                else break;
+                                                              }
+                                                              c[k >> 2] = m;
+                                                              c[(j + (o << 2)) >> 2] = l;
+                                                              c[(j + ((i + 2) << 2)) >> 2] = -1;
+                                                              h = (h + 1) | 0;
+                                                              l = -1;
+                                                            }
+                                                            e6(e, f, m);
+                                                          }
+                                                          c[e >> 2] = -1;
+                                                          n = (n + 1) | 0;
+                                                          m = t;
+                                                          i = p;
+                                                        } else {
+                                                          g = 0;
+                                                          i = t;
+                                                        }
+                                                        t = (c[(q + 16) >> 2] | 0) > 0;
+                                                        p = t ? (i + 2) | 0 : i;
+                                                        o = s;
+                                                        m = t ? (i + 1) | 0 : m;
+                                                      } else {
+                                                        p = t;
+                                                        o = s;
+                                                      }
+                                                    } else {
+                                                      p = t;
+                                                      o = s;
+                                                    }
+                                                  } else {
+                                                    p = t;
+                                                    o = s;
+                                                  }
+                                                } else {
+                                                  p = t;
+                                                  o = s;
+                                                }
+                                              } else {
+                                                p = t;
+                                                o = s;
+                                              }
+                                            } else {
+                                              p = t;
+                                              o = s;
+                                            }
+                                          } else {
+                                            p = t;
+                                            o = s;
+                                          }
+                                        } else {
+                                          p = t;
+                                          o = s;
+                                        }
+                                      } else {
+                                        p = t;
+                                        o = s;
+                                      }
+                                    } else {
+                                      p = t;
+                                      o = s;
+                                    }
+                                    break;
+                                  }
+                                  default: {
+                                    p = t;
+                                    g = 0;
+                                    o = s;
+                                  }
+                                }
+                              while (0);
+                              j = c[r >> 2] | 0;
+                              if ((j | 0) > -1) {
+                                i = 0;
+                                do {
+                                  k = (A + (i << 2)) | 0;
+                                  i = (i + 1) | 0;
+                                } while ((c[k >> 2] | 0) > -1);
+                                c[k >> 2] = j;
+                                c[(A + (i << 2)) >> 2] = -1;
+                                j = p;
+                                i = o;
+                              } else {
+                                j = p;
+                                i = o;
+                              }
+                              break;
+                            }
+                            case 1: {
+                              g = V5(d) | 0;
+                              if (y) {
+                                i = c[((c[c[(g + 4) >> 2] >> 2] | 0) + 20) >> 2] | 0;
+                                c[(g + 20) >> 2] = (U5(d) | 0) + i;
+                                i = 0;
+                                l = -1;
+                              } else {
+                                q = U5(d) | 0;
+                                r = U5(d) | 0;
+                                i = q;
+                                l = (q | 0) == 0 ? l : r;
+                              }
+                              g = 0;
+                              j = t;
+                              i = y ? s : ((i | 0) == 0) & 1;
+                              break;
+                            }
+                            case 4: {
+                              i = U5(d) | 0;
+                              j = U5(d) | 0;
+                              g = 0;
+                              m = (i | 0) > -1 ? i : m;
+                              i = s;
+                              break;
+                            }
+                            case 5: {
+                              g = V5(d) | 0;
+                              if (y) {
+                                j = c[(g + 4) >> 2] | 0;
+                                c[(g + 20) >> 2] =
+                                  (c[((c[(j + 4) >> 2] | 0) + 20) >> 2] | 0) + (c[((c[j >> 2] | 0) + 20) >> 2] | 0);
+                                g = 0;
+                                j = t;
+                                i = s;
+                              } else {
+                                g = 0;
+                                j = t;
+                                i = s;
+                              }
+                              break;
+                            }
+                            case 2: {
+                              while (1)
+                                if ((c[e >> 2] | 0) > -1) e = (e + 4) | 0;
+                                else {
+                                  g = 0;
+                                  j = t;
+                                  i = s;
+                                  break;
+                                }
+                              break;
+                            }
+                            case 3: {
+                              j = V5(d) | 0;
+                              o = V5(d) | 0;
+                              g = V5(d) | 0;
+                              e = U5(d) | 0;
+                              if (y) {
+                                r = c[(g + 4) >> 2] | 0;
+                                s = (g + 16) | 0;
+                                c[(g + 20) >> 2] =
+                                  (c[((c[r >> 2] | 0) + 20) >> 2] | 0) +
+                                  e +
+                                  (c[((c[(r + 4) >> 2] | 0) + 20) >> 2] | 0) +
+                                  ((c[s >> 2] | 0) > 0 ? 2 : 0);
+                                g = s;
+                              } else g = (g + 16) | 0;
+                              e = V5(d) | 0;
+                              i = U5(d) | 0;
+                              k = U5(d) | 0;
+                              if ((c[g >> 2] | 0) > 0) {
+                                if (y) g = 0;
+                                else {
+                                  g = f6(b, j, i) | 0;
+                                  c[((c[u >> 2] | 0) + (i << 2)) >> 2] = 1;
+                                  if (!g) g = f6(b, o, k) | 0;
+                                  c[((c[u >> 2] | 0) + (k << 2)) >> 2] = 1;
+                                }
+                                n = (n + 2) | 0;
+                                j = t;
+                                i = 1;
+                              } else {
+                                g = 0;
+                                j = t;
+                                i = 1;
+                              }
+                              break;
+                            }
+                            default: {
+                              g = 0;
+                              j = t;
+                              i = s;
+                            }
+                          }
+                        while (0);
+                        if (((g | 0) != 0) | ((R5(d) | 0) <= (x | 0))) break a;
+                        else {
+                          t = j;
+                          s = i;
+                        }
+                      }
+                    }
+                  while (0);
+                  if (!y ? (e6(e, f, m), (l | 0) > -1) : 0) {
+                    i = c[(f + 36) >> 2] | 0;
+                    e = 0;
+                    while (1) {
+                      j = (i + (e << 2)) | 0;
+                      k = (e + 1) | 0;
+                      if ((c[j >> 2] | 0) > -1) e = k;
+                      else break;
+                    }
+                    c[j >> 2] = m;
+                    c[(i + (k << 2)) >> 2] = l;
+                    c[(i + ((e + 2) << 2)) >> 2] = -1;
+                    h = (h + 1) | 0;
+                  }
+                  c[(f + 48) >> 2] = n;
+                  c[(f + 40) >> 2] = n;
+                  c[(f + 44) >> 2] = h;
+                  U1(z);
+                  U1(A);
+                }
+              while (0);
+              return g | 0;
+            }
+            function K5(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0;
+              y = l;
+              l = (l + 16) | 0;
+              t = (y + 12) | 0;
+              x = (y + 8) | 0;
+              u = (y + 4) | 0;
+              v = y;
+              w = R5(b) | 0;
+              c[t >> 2] = 0;
+              c[x >> 2] = 0;
+              d = S5(b, d) | 0;
+              a: do
+                if (!d) {
+                  d = T5(b, 0) | 0;
+                  if (!d) {
+                    b: do
+                      if ((R5(b) | 0) > (w | 0)) {
+                        g = 0;
+                        i = 0;
+                        j = 0;
+                        c: while (1) {
+                          q = U5(b) | 0;
+                          r = V5(b) | 0;
+                          d: do
+                            switch (q | 0) {
+                              case 0: {
+                                switch (c[r >> 2] | 0) {
+                                  case 0: {
+                                    d = c[(r + 4) >> 2] | 0;
+                                    r = c[d >> 2] | 0;
+                                    if (!(((r | 0) > -1) | ((r | 0) == -4))) {
+                                      d = j;
+                                      break d;
+                                    }
+                                    r = (d + 8) | 0;
+                                    d = ((c[r >> 2] | 0) + j) | 0;
+                                    c[r >> 2] = d;
+                                    if ((d | 0) <= (c[x >> 2] | 0)) {
+                                      d = j;
+                                      break d;
+                                    }
+                                    c[x >> 2] = d;
+                                    d = j;
+                                    break d;
+                                  }
+                                  case 3: {
+                                    h = c[(r + 4) >> 2] | 0;
+                                    d = S5(b, c[(h + 4) >> 2] | 0) | 0;
+                                    if (d | 0) break b;
+                                    d = T5(b, 0) | 0;
+                                    if (d | 0) break b;
+                                    d = S5(b, c[h >> 2] | 0) | 0;
+                                    if (d | 0) break b;
+                                    break;
+                                  }
+                                  case 1: {
+                                    h = c[(r + 4) >> 2] | 0;
+                                    d = S5(b, c[(h + 4) >> 2] | 0) | 0;
+                                    if (d | 0) break b;
+                                    d = T5(b, 0) | 0;
+                                    if (d | 0) break b;
+                                    d = S5(b, c[h >> 2] | 0) | 0;
+                                    if (d | 0) break b;
+                                    break;
+                                  }
+                                  case 2: {
+                                    h = c[(r + 4) >> 2] | 0;
+                                    d = T5(b, j) | 0;
+                                    if (d | 0) break b;
+                                    d = S5(b, r) | 0;
+                                    if (d | 0) break b;
+                                    d = T5(b, 1) | 0;
+                                    if (d | 0) break b;
+                                    d = S5(b, c[h >> 2] | 0) | 0;
+                                    if (d | 0) break b;
+                                    d = T5(b, 0) | 0;
+                                    if (d | 0) break b;
+                                    if ((c[(h + 4) >> 2] | 0) <= 1 ? (c[(h + 8) >> 2] | 0) <= 1 : 0) d = j;
+                                    else {
+                                      c[t >> 2] = 0;
+                                      d = 0;
+                                    }
+                                    i = (i + 1) | 0;
+                                    break d;
+                                  }
+                                  default: {
+                                    d = j;
+                                    break d;
+                                  }
+                                }
+                                d = T5(b, 0) | 0;
+                                if (!d) d = j;
+                                else break b;
+                                break;
+                              }
+                              case 1: {
+                                p = (r + 4) | 0;
+                                o = c[p >> 2] | 0;
+                                q = U5(b) | 0;
+                                c[t >> 2] = q;
+                                n = (o + 4) | 0;
+                                j = c[n >> 2] | 0;
+                                if ((j | 0) <= 1)
+                                  if ((c[(o + 8) >> 2] | 0) > 1) {
+                                    c[u >> 2] = 0;
+                                    if ((j | 0) > 0) s = 30;
+                                    else {
+                                      d = q;
+                                      h = 0;
+                                      s = 37;
+                                    }
+                                  } else d = q;
+                                else {
+                                  c[u >> 2] = 0;
+                                  s = 30;
+                                }
+                                e: do
+                                  if ((s | 0) == 30) {
+                                    d = a6(a, b, c[o >> 2] | 0, (j | 0) > 1 ? 1 : 2, t, f, v, x) | 0;
+                                    if (!d) {
+                                      h = 0;
+                                      k = q;
+                                      m = 1;
+                                    } else {
+                                      s = 34;
+                                      break c;
+                                    }
+                                    while (1) {
+                                      d = c[v >> 2] | 0;
+                                      if (!h) h = d;
+                                      else h = M5(a, h, d) | 0;
+                                      if (!h) {
+                                        d = 12;
+                                        s = 34;
+                                        break c;
+                                      }
+                                      j = c[n >> 2] | 0;
+                                      if ((m | 0) >= (j | 0)) {
+                                        d = k;
+                                        s = 37;
+                                        break e;
+                                      }
+                                      k = c[t >> 2] | 0;
+                                      m = (m + 1) | 0;
+                                      d = a6(a, b, c[o >> 2] | 0, (m | 0) < (j | 0) ? 1 : 2, t, f, v, x) | 0;
+                                      if (d | 0) {
+                                        s = 34;
+                                        break c;
+                                      }
+                                    }
+                                  }
+                                while (0);
+                                if ((s | 0) == 37) {
+                                  s = 0;
+                                  n = (o + 8) | 0;
+                                  k = c[n >> 2] | 0;
+                                  if ((k | 0) == -1) {
+                                    k = c[t >> 2] | 0;
+                                    d = a6(a, b, c[o >> 2] | 0, 0, t, 0, u, x) | 0;
+                                    if (d | 0) break c;
+                                    j = b6(a, c[u >> 2] | 0, 0, -1, 0) | 0;
+                                    c[u >> 2] = j;
+                                    if (!j) {
+                                      d = 12;
+                                      break c;
+                                    } else d = k;
+                                  } else if ((j | 0) < (k | 0)) {
+                                    k = j;
+                                    j = 0;
+                                    while (1) {
+                                      m = c[t >> 2] | 0;
+                                      d = a6(a, b, c[o >> 2] | 0, 0, t, 0, v, x) | 0;
+                                      if (d | 0) {
+                                        s = 49;
+                                        break c;
+                                      }
+                                      if (!j) {
+                                        d = c[v >> 2] | 0;
+                                        c[u >> 2] = d;
+                                      } else {
+                                        d = M5(a, c[v >> 2] | 0, j) | 0;
+                                        c[u >> 2] = d;
+                                      }
+                                      if (!d) {
+                                        d = 12;
+                                        s = 49;
+                                        break c;
+                                      }
+                                      j = L5(a, -1, -1, -1) | 0;
+                                      if (!j) {
+                                        d = 12;
+                                        s = 49;
+                                        break c;
+                                      }
+                                      j = c6(a, j, d) | 0;
+                                      c[u >> 2] = j;
+                                      if (!j) {
+                                        d = 12;
+                                        s = 49;
+                                        break c;
+                                      }
+                                      k = (k + 1) | 0;
+                                      if ((k | 0) >= (c[n >> 2] | 0)) {
+                                        d = m;
+                                        break;
+                                      }
+                                    }
+                                  } else j = 0;
+                                  c[t >> 2] = d;
+                                  if (h) {
+                                    if (j) {
+                                      h = M5(a, h, j) | 0;
+                                      s = 54;
+                                    }
+                                  } else {
+                                    h = j;
+                                    s = 54;
+                                  }
+                                  if ((s | 0) == 54) {
+                                    s = 0;
+                                    if (!h) {
+                                      d = 12;
+                                      break c;
+                                    }
+                                  }
+                                  c[p >> 2] = c[(h + 4) >> 2];
+                                  c[r >> 2] = c[h >> 2];
+                                }
+                                i = (i + -1) | 0;
+                                h = (d - q + g) | 0;
+                                if (!i) {
+                                  c[t >> 2] = h;
+                                  g = h;
+                                  i = 0;
+                                  d = h;
+                                } else g = h;
+                                break;
+                              }
+                              default:
+                                d = j;
+                            }
+                          while (0);
+                          if ((R5(b) | 0) > (w | 0)) j = d;
+                          else {
+                            d = 0;
+                            break b;
+                          }
+                        }
+                        break a;
+                      } else {
+                        d = 0;
+                        g = 0;
+                      }
+                    while (0);
+                    w = ((c[e >> 2] | 0) + g) | 0;
+                    x = c[x >> 2] | 0;
+                    c[e >> 2] = (x | 0) > (w | 0) ? x : w;
+                  }
+                }
+              while (0);
+              l = y;
+              return d | 0;
+            }
+            function L5(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0;
+              f = E5(a, 0, 0, 1, 20) | 0;
+              a = $5(a, 0, f) | 0;
+              if (!a) a = 0;
+              else {
+                c[f >> 2] = b;
+                c[(f + 4) >> 2] = d;
+                c[(f + 8) >> 2] = e;
+              }
+              return a | 0;
+            }
+            function M5(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              if (b) {
+                e = E5(a, 0, 0, 1, 8) | 0;
+                a = $5(a, 1, e) | 0;
+                if (!a) d = 0;
+                else {
+                  c[e >> 2] = b;
+                  c[(e + 4) >> 2] = d;
+                  c[(a + 16) >> 2] = (c[(d + 16) >> 2] | 0) + (c[(b + 16) >> 2] | 0);
+                  d = a;
+                }
+              }
+              return d | 0;
+            }
+            function N5(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              o = l;
+              l = (l + 16) | 0;
+              j = (o + 4) | 0;
+              k = o;
+              m = R5(b) | 0;
+              d = S5(b, d) | 0;
+              a: do
+                if (!d) {
+                  d = T5(b, 0) | 0;
+                  if (!d)
+                    if ((R5(b) | 0) > (m | 0)) {
+                      b: while (1) {
+                        h = U5(b) | 0;
+                        i = V5(b) | 0;
+                        c: do
+                          switch (h | 0) {
+                            case 0:
+                              switch (c[i >> 2] | 0) {
+                                case 0: {
+                                  g = c[(i + 4) >> 2] | 0;
+                                  f = c[g >> 2] | 0;
+                                  if ((f | 0) == -4) {
+                                    c[(i + 8) >> 2] = 0;
+                                    d = (g + 8) | 0;
+                                    h = W5(a, c[d >> 2] | 0, 0, 1114111, 0, 0, -1) | 0;
+                                    c[(i + 24) >> 2] = h;
+                                    if (!h) {
+                                      d = 12;
+                                      break a;
+                                    }
+                                    h = W5(a, c[d >> 2] | 0, 0, 1114111, 0, 0, c[(g + 4) >> 2] | 0) | 0;
+                                    c[(i + 28) >> 2] = h;
+                                    if (!h) {
+                                      d = 12;
+                                      break a;
+                                    } else break c;
+                                  }
+                                  d = (i + 8) | 0;
+                                  if ((f | 0) < 0) {
+                                    c[d >> 2] = 1;
+                                    h = X5(a) | 0;
+                                    c[(i + 24) >> 2] = h;
+                                    if (!h) {
+                                      d = 12;
+                                      break a;
+                                    }
+                                    h = X5(a) | 0;
+                                    c[(i + 28) >> 2] = h;
+                                    if (!h) {
+                                      d = 12;
+                                      break a;
+                                    } else break c;
+                                  } else {
+                                    c[d >> 2] = 0;
+                                    d = (g + 8) | 0;
+                                    e = (g + 4) | 0;
+                                    h = W5(a, c[d >> 2] | 0, f, c[e >> 2] | 0, 0, 0, -1) | 0;
+                                    c[(i + 24) >> 2] = h;
+                                    if (!h) {
+                                      d = 12;
+                                      break a;
+                                    }
+                                    h =
+                                      W5(
+                                        a,
+                                        c[d >> 2] | 0,
+                                        c[g >> 2] | 0,
+                                        c[e >> 2] | 0,
+                                        c[(g + 12) >> 2] | 0,
+                                        c[(g + 16) >> 2] | 0,
+                                        -1
+                                      ) | 0;
+                                    c[(i + 28) >> 2] = h;
+                                    if (!h) {
+                                      d = 12;
+                                      break a;
+                                    } else break c;
+                                  }
+                                }
+                                case 3: {
+                                  d = S5(b, i) | 0;
+                                  if (d | 0) break a;
+                                  d = T5(b, 1) | 0;
+                                  if (d | 0) break a;
+                                  e = (i + 4) | 0;
+                                  d = S5(b, c[((c[e >> 2] | 0) + 4) >> 2] | 0) | 0;
+                                  if (d | 0) break a;
+                                  d = T5(b, 0) | 0;
+                                  if (d | 0) break a;
+                                  d = S5(b, c[c[e >> 2] >> 2] | 0) | 0;
+                                  if (d | 0) break a;
+                                  d = T5(b, 0) | 0;
+                                  if (!d) break c;
+                                  else break a;
+                                }
+                                case 1: {
+                                  d = S5(b, i) | 0;
+                                  if (d | 0) break a;
+                                  d = T5(b, 2) | 0;
+                                  if (d | 0) break a;
+                                  e = (i + 4) | 0;
+                                  d = S5(b, c[((c[e >> 2] | 0) + 4) >> 2] | 0) | 0;
+                                  if (d | 0) break a;
+                                  d = T5(b, 0) | 0;
+                                  if (d | 0) break a;
+                                  d = S5(b, c[c[e >> 2] >> 2] | 0) | 0;
+                                  if (d | 0) break a;
+                                  d = T5(b, 0) | 0;
+                                  if (!d) break c;
+                                  else break a;
+                                }
+                                case 2: {
+                                  d = S5(b, i) | 0;
+                                  if (d | 0) break a;
+                                  d = T5(b, 3) | 0;
+                                  if (d | 0) break a;
+                                  d = S5(b, c[c[(i + 4) >> 2] >> 2] | 0) | 0;
+                                  if (d | 0) break a;
+                                  d = T5(b, 0) | 0;
+                                  if (!d) break c;
+                                  else break a;
+                                }
+                                default:
+                                  break c;
+                              }
+                            case 1: {
+                              d = c[(i + 4) >> 2] | 0;
+                              e = c[d >> 2] | 0;
+                              f = (d + 4) | 0;
+                              g = c[f >> 2] | 0;
+                              if (!(c[(e + 8) >> 2] | 0)) h = (c[(g + 8) >> 2] | 0) != 0;
+                              else h = 1;
+                              c[(i + 8) >> 2] = h & 1;
+                              h = Y5(a, c[(e + 24) >> 2] | 0, c[(g + 24) >> 2] | 0, 0, 0) | 0;
+                              c[(i + 24) >> 2] = h;
+                              if (!h) {
+                                d = 12;
+                                break a;
+                              }
+                              h =
+                                Y5(a, c[((c[d >> 2] | 0) + 28) >> 2] | 0, c[((c[f >> 2] | 0) + 28) >> 2] | 0, 0, 0) | 0;
+                              c[(i + 28) >> 2] = h;
+                              if (!h) {
+                                d = 12;
+                                break a;
+                              }
+                              break;
+                            }
+                            case 3: {
+                              h = c[(i + 4) >> 2] | 0;
+                              d = c[h >> 2] | 0;
+                              if (!(c[(h + 4) >> 2] | 0)) e = 1;
+                              else e = ((c[(d + 8) >> 2] | 0) != 0) & 1;
+                              c[(i + 8) >> 2] = e;
+                              c[(i + 24) >> 2] = c[(d + 24) >> 2];
+                              c[(i + 28) >> 2] = c[(d + 28) >> 2];
+                              break;
+                            }
+                            case 2: {
+                              g = c[(i + 4) >> 2] | 0;
+                              d = c[g >> 2] | 0;
+                              e = (d + 8) | 0;
+                              if (!(c[e >> 2] | 0)) f = 0;
+                              else f = (c[((c[(g + 4) >> 2] | 0) + 8) >> 2] | 0) != 0;
+                              c[(i + 8) >> 2] = f & 1;
+                              if (c[e >> 2] | 0) {
+                                d = Z5(b, d, 0, 0, j) | 0;
+                                if (d | 0) break b;
+                                e = T1(((c[j >> 2] << 2) + 4) | 0) | 0;
+                                if (!e) {
+                                  d = 12;
+                                  break b;
+                                }
+                                c[e >> 2] = -1;
+                                c[k >> 2] = 0;
+                                d = Z5(b, c[g >> 2] | 0, e, k, 0) | 0;
+                                if (d | 0) {
+                                  n = 45;
+                                  break b;
+                                }
+                                d = (g + 4) | 0;
+                                h = (i + 24) | 0;
+                                c[h >> 2] =
+                                  Y5(
+                                    a,
+                                    c[((c[d >> 2] | 0) + 24) >> 2] | 0,
+                                    c[((c[g >> 2] | 0) + 24) >> 2] | 0,
+                                    e,
+                                    c[k >> 2] | 0
+                                  ) | 0;
+                                U1(e);
+                                if (!(c[h >> 2] | 0)) {
+                                  d = 12;
+                                  break b;
+                                } else f = d;
+                              } else {
+                                c[(i + 24) >> 2] = c[(d + 24) >> 2];
+                                f = (g + 4) | 0;
+                              }
+                              d = c[f >> 2] | 0;
+                              if (c[(d + 8) >> 2] | 0) {
+                                d = Z5(b, d, 0, 0, j) | 0;
+                                if (d | 0) break b;
+                                e = T1(((c[j >> 2] << 2) + 4) | 0) | 0;
+                                if (!e) {
+                                  d = 12;
+                                  break b;
+                                }
+                                c[e >> 2] = -1;
+                                c[k >> 2] = 0;
+                                d = Z5(b, c[f >> 2] | 0, e, k, 0) | 0;
+                                if (d | 0) {
+                                  n = 52;
+                                  break b;
+                                }
+                                i = (i + 28) | 0;
+                                c[i >> 2] =
+                                  Y5(
+                                    a,
+                                    c[((c[g >> 2] | 0) + 28) >> 2] | 0,
+                                    c[((c[f >> 2] | 0) + 28) >> 2] | 0,
+                                    e,
+                                    c[k >> 2] | 0
+                                  ) | 0;
+                                U1(e);
+                                if (!(c[i >> 2] | 0)) {
+                                  d = 12;
+                                  break b;
+                                }
+                              } else c[(i + 28) >> 2] = c[(d + 28) >> 2];
+                              break;
+                            }
+                            default: {
+                            }
+                          }
+                        while (0);
+                        if ((R5(b) | 0) <= (m | 0)) {
+                          d = 0;
+                          break a;
+                        }
+                      }
+                      if ((n | 0) == 45) U1(e);
+                      else if ((n | 0) == 52) U1(e);
+                    } else d = 0;
+                }
+              while (0);
+              l = o;
+              return d | 0;
+            }
+            function O5(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              a: while (1) {
+                switch (c[a >> 2] | 0) {
+                  case 2: {
+                    a = c[(a + 4) >> 2] | 0;
+                    if (
+                      (c[(a + 8) >> 2] | 0) == -1
+                        ? ((h = c[a >> 2] | 0),
+                          (h = Q5(c[(h + 28) >> 2] | 0, c[(h + 24) >> 2] | 0, b, d, e) | 0),
+                          (h | 0) != 0)
+                        : 0
+                    ) {
+                      a = h;
+                      break a;
+                    }
+                    break;
+                  }
+                  case 3: {
+                    f = c[(a + 4) >> 2] | 0;
+                    a = O5(c[f >> 2] | 0, b, d, e) | 0;
+                    if (a | 0) break a;
+                    a = (f + 4) | 0;
+                    break;
+                  }
+                  case 1: {
+                    f = c[(a + 4) >> 2] | 0;
+                    g = (f + 4) | 0;
+                    a = Q5(c[((c[f >> 2] | 0) + 28) >> 2] | 0, c[((c[g >> 2] | 0) + 24) >> 2] | 0, b, d, e) | 0;
+                    if (a | 0) break a;
+                    a = O5(c[f >> 2] | 0, b, d, e) | 0;
+                    if (!a) a = g;
+                    else break a;
+                    break;
+                  }
+                  default: {
+                    a = 0;
+                    break a;
+                  }
+                }
+                a = c[a >> 2] | 0;
+              }
+              return a | 0;
+            }
+            function P5(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              h = c[(a + 4) >> 2] | 0;
+              if (h | 0) {
+                e = (h + 4) | 0;
+                a = c[h >> 2] | 0;
+                if (c[e >> 2] | 0) {
+                  d = 0;
+                  do {
+                    if (c[(a + (d << 5) + 8) >> 2] | 0) {
+                      b = c[(a + (d << 5) + 16) >> 2] | 0;
+                      if (b) {
+                        U1(b);
+                        a = c[h >> 2] | 0;
+                      }
+                      b = c[(a + (d << 5) + 28) >> 2] | 0;
+                      if (b) {
+                        U1(b);
+                        a = c[h >> 2] | 0;
+                      }
+                    }
+                    d = (d + 1) | 0;
+                  } while (d >>> 0 < (c[e >> 2] | 0) >>> 0);
+                }
+                if (a | 0) U1(a);
+                d = (h + 8) | 0;
+                a = c[d >> 2] | 0;
+                if (a | 0) {
+                  if (c[(a + 8) >> 2] | 0) {
+                    while (1) {
+                      b = c[(a + 16) >> 2] | 0;
+                      if (b | 0) U1(b);
+                      if (!(c[(a + 40) >> 2] | 0)) break;
+                      else a = (a + 32) | 0;
+                    }
+                    a = c[d >> 2] | 0;
+                  }
+                  U1(a);
+                }
+                f = (h + 16) | 0;
+                a = c[f >> 2] | 0;
+                if (a | 0) {
+                  g = (h + 28) | 0;
+                  b = c[g >> 2] | 0;
+                  if (b) {
+                    e = 0;
+                    do {
+                      d = c[(a + ((e * 12) | 0) + 8) >> 2] | 0;
+                      if (d) {
+                        U1(d);
+                        b = c[g >> 2] | 0;
+                        a = c[f >> 2] | 0;
+                      }
+                      e = (e + 1) | 0;
+                    } while (e >>> 0 < b >>> 0);
+                  }
+                  U1(a);
+                }
+                a = c[(h + 32) >> 2] | 0;
+                if (a | 0) U1(a);
+                a = c[(h + 20) >> 2] | 0;
+                if (a | 0) U1(a);
+                a = c[(h + 36) >> 2] | 0;
+                if (a | 0) U1(a);
+                U1(h);
+              }
+              return;
+            }
+            function Q5(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0;
+              g = c[a >> 2] | 0;
+              h = (g | 0) > -1;
+              a: do
+                if (!d)
+                  if (h) {
+                    h = (b + 32) | 0;
+                    do {
+                      if (
+                        (c[b >> 2] | 0) > -1
+                          ? ((y = (e + (g << 2)) | 0), (c[y >> 2] = (c[y >> 2] | 0) + 1), (c[h >> 2] | 0) > -1)
+                          : 0
+                      ) {
+                        g = h;
+                        do {
+                          y = (e + (c[a >> 2] << 2)) | 0;
+                          c[y >> 2] = (c[y >> 2] | 0) + 1;
+                          g = (g + 32) | 0;
+                        } while ((c[g >> 2] | 0) > -1);
+                      }
+                      a = (a + 32) | 0;
+                      g = c[a >> 2] | 0;
+                    } while ((g | 0) > -1);
+                    g = 0;
+                  } else g = 0;
+                else if (h)
+                  while (1) {
+                    h = c[b >> 2] | 0;
+                    b: do
+                      if ((h | 0) > -1) {
+                        p = (a + 4) | 0;
+                        q = (a + 8) | 0;
+                        r = (a + 16) | 0;
+                        s = (a + 20) | 0;
+                        t = (a + 24) | 0;
+                        u = (a + 28) | 0;
+                        v = (a + 12) | 0;
+                        e = -1;
+                        g = b;
+                        while (1) {
+                          o = h;
+                          while (1) {
+                            if ((o | 0) != (e | 0)) break;
+                            g = (g + 32) | 0;
+                            h = c[g >> 2] | 0;
+                            if ((h | 0) > -1) o = h;
+                            else break b;
+                          }
+                          l = (d + (c[(f + (c[a >> 2] << 2)) >> 2] << 5)) | 0;
+                          while (1) {
+                            h = (l + 8) | 0;
+                            if (!(c[h >> 2] | 0)) break;
+                            else l = (l + 32) | 0;
+                          }
+                          c[(l + 40) >> 2] = 0;
+                          c[l >> 2] = c[p >> 2];
+                          c[(l + 4) >> 2] = c[q >> 2];
+                          c[h >> 2] = d + (c[(f + (o << 2)) >> 2] << 5);
+                          c[(l + 12) >> 2] = o;
+                          h = c[s >> 2] | 0;
+                          e = c[(g + 16) >> 2] | c[r >> 2] | (h | 0 ? 4 : 0) | (c[t >> 2] | 0 ? 8 : 0);
+                          i = (l + 20) | 0;
+                          c[i >> 2] = e;
+                          j = c[u >> 2] | 0;
+                          if ((j | 0) > -1) {
+                            c[i >> 2] = e | 256;
+                            h = j;
+                          }
+                          c[(l + 24) >> 2] = h;
+                          e = c[t >> 2] | 0;
+                          if (!e) c[(l + 28) >> 2] = 0;
+                          else {
+                            h = 0;
+                            do {
+                              n = h;
+                              h = (h + 1) | 0;
+                            } while ((c[(e + (n << 2)) >> 2] | 0) != 0);
+                            h = T1(h << 2) | 0;
+                            c[(l + 28) >> 2] = h;
+                            if (!h) {
+                              g = 12;
+                              break a;
+                            }
+                            k = c[t >> 2] | 0;
+                            e = c[k >> 2] | 0;
+                            if (e) {
+                              j = 0;
+                              i = h;
+                              do {
+                                c[i >> 2] = e;
+                                j = (j + 1) | 0;
+                                e = c[(k + (j << 2)) >> 2] | 0;
+                                i = (h + (j << 2)) | 0;
+                              } while ((e | 0) != 0);
+                              h = i;
+                            }
+                            c[h >> 2] = 0;
+                          }
+                          e = c[v >> 2] | 0;
+                          if (!e) h = 0;
+                          else {
+                            h = 0;
+                            while (1)
+                              if ((c[(e + (h << 2)) >> 2] | 0) > -1) h = (h + 1) | 0;
+                              else break;
+                          }
+                          k = (g + 12) | 0;
+                          i = c[k >> 2] | 0;
+                          if (!i) e = 0;
+                          else {
+                            e = 0;
+                            while (1)
+                              if ((c[(i + (e << 2)) >> 2] | 0) > -1) e = (e + 1) | 0;
+                              else break;
+                          }
+                          j = (l + 16) | 0;
+                          i = c[j >> 2] | 0;
+                          if (i | 0) U1(i);
+                          c[j >> 2] = 0;
+                          h = (e + h) | 0;
+                          if ((h | 0) > 0) {
+                            n = T1(((h << 2) + 4) | 0) | 0;
+                            c[j >> 2] = n;
+                            if (!n) {
+                              g = 12;
+                              break a;
+                            }
+                            e = c[v >> 2] | 0;
+                            if ((e | 0) != 0 ? ((w = c[e >> 2] | 0), (w | 0) > -1) : 0) {
+                              h = 0;
+                              i = w;
+                              do {
+                                c[(n + (h << 2)) >> 2] = i;
+                                h = (h + 1) | 0;
+                                i = c[(e + (h << 2)) >> 2] | 0;
+                              } while ((i | 0) > -1);
+                              m = h;
+                            } else m = 0;
+                            j = c[k >> 2] | 0;
+                            if ((j | 0) != 0 ? ((x = c[j >> 2] | 0), (x | 0) > -1) : 0) {
+                              k = (m | 0) > 0;
+                              h = m;
+                              i = 0;
+                              l = x;
+                              do {
+                                c: do
+                                  if (k) {
+                                    e = 0;
+                                    while (1) {
+                                      if ((c[(n + (e << 2)) >> 2] | 0) == (l | 0)) break c;
+                                      e = (e + 1) | 0;
+                                      if ((e | 0) >= (m | 0)) {
+                                        y = 39;
+                                        break;
+                                      }
+                                    }
+                                  } else y = 39;
+                                while (0);
+                                if ((y | 0) == 39) {
+                                  y = 0;
+                                  c[(n + (h << 2)) >> 2] = l;
+                                  h = (h + 1) | 0;
+                                }
+                                i = (i + 1) | 0;
+                                l = c[(j + (i << 2)) >> 2] | 0;
+                              } while ((l | 0) > -1);
+                            } else h = m;
+                            c[(n + (h << 2)) >> 2] = -1;
+                          }
+                          g = (g + 32) | 0;
+                          h = c[g >> 2] | 0;
+                          if ((h | 0) <= -1) break;
+                          else e = o;
+                        }
+                      }
+                    while (0);
+                    a = (a + 32) | 0;
+                    if ((c[a >> 2] | 0) <= -1) {
+                      g = 0;
+                      break;
+                    }
+                  }
+                else g = 0;
+              while (0);
+              return g | 0;
+            }
+            function R5(a) {
+              a = a | 0;
+              return c[(a + 12) >> 2] | 0;
+            }
+            function S5(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              d = l;
+              l = (l + 16) | 0;
+              e = (d + 4) | 0;
+              f = d;
+              c[f >> 2] = b;
+              c[e >> 2] = c[f >> 2];
+              b = _5(a, e) | 0;
+              l = d;
+              return b | 0;
+            }
+            function T5(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0;
+              d = l;
+              l = (l + 16) | 0;
+              e = (d + 4) | 0;
+              f = d;
+              c[f >> 2] = b;
+              c[e >> 2] = c[f >> 2];
+              b = _5(a, e) | 0;
+              l = d;
+              return b | 0;
+            }
+            function U5(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = c[(a + 16) >> 2] | 0;
+              d = (a + 12) | 0;
+              a = ((c[d >> 2] | 0) + -1) | 0;
+              c[d >> 2] = a;
+              return c[(b + (a << 2)) >> 2] | 0;
+            }
+            function V5(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              b = c[(a + 16) >> 2] | 0;
+              d = (a + 12) | 0;
+              a = ((c[d >> 2] | 0) + -1) | 0;
+              c[d >> 2] = a;
+              return c[(b + (a << 2)) >> 2] | 0;
+            }
+            function W5(a, b, d, e, f, g, h) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              a = E5(a, 0, 0, 1, 64) | 0;
+              if (!a) a = 0;
+              else {
+                c[a >> 2] = b;
+                c[(a + 4) >> 2] = d;
+                c[(a + 8) >> 2] = e;
+                c[(a + 20) >> 2] = f;
+                c[(a + 24) >> 2] = g;
+                c[(a + 28) >> 2] = h;
+                c[(a + 32) >> 2] = -1;
+                c[(a + 36) >> 2] = -1;
+                c[(a + 40) >> 2] = -1;
+              }
+              return a | 0;
+            }
+            function X5(a) {
+              a = a | 0;
+              a = E5(a, 0, 0, 1, 32) | 0;
+              if (!a) a = 0;
+              else {
+                c[a >> 2] = -1;
+                c[(a + 4) >> 2] = -1;
+                c[(a + 8) >> 2] = -1;
+              }
+              return a | 0;
+            }
+            function Y5(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              o = (e | 0) == 0;
+              if (o) n = 0;
+              else {
+                g = 0;
+                while (1)
+                  if ((c[(e + (g << 2)) >> 2] | 0) > -1) g = (g + 1) | 0;
+                  else {
+                    n = g;
+                    break;
+                  }
+              }
+              h = 0;
+              while (1)
+                if ((c[(b + (h << 5)) >> 2] | 0) > -1) h = (h + 1) | 0;
+                else {
+                  g = 0;
+                  break;
+                }
+              while (1)
+                if ((c[(d + (g << 5)) >> 2] | 0) > -1) g = (g + 1) | 0;
+                else break;
+              g = E5(a, 0, 0, 1, (((g + h) << 5) + 32) | 0) | 0;
+              a: do
+                if (!g) g = 0;
+                else {
+                  h = c[b >> 2] | 0;
+                  if ((h | 0) > -1) {
+                    m = (n | 0) > 0;
+                    i = 0;
+                    while (1) {
+                      c[(g + (i << 5)) >> 2] = h;
+                      c[(g + (i << 5) + 4) >> 2] = c[(b + (i << 5) + 4) >> 2];
+                      c[(g + (i << 5) + 8) >> 2] = c[(b + (i << 5) + 8) >> 2];
+                      c[(g + (i << 5) + 16) >> 2] = c[(b + (i << 5) + 16) >> 2] | f;
+                      c[(g + (i << 5) + 20) >> 2] = c[(b + (i << 5) + 20) >> 2];
+                      c[(g + (i << 5) + 24) >> 2] = c[(b + (i << 5) + 24) >> 2];
+                      c[(g + (i << 5) + 28) >> 2] = c[(b + (i << 5) + 28) >> 2];
+                      l = (b + (i << 5) + 12) | 0;
+                      j = c[l >> 2] | 0;
+                      h = (j | 0) == 0;
+                      if (o & h) h = 0;
+                      else {
+                        if (h) k = 0;
+                        else {
+                          h = 0;
+                          while (1)
+                            if ((c[(j + (h << 2)) >> 2] | 0) > -1) h = (h + 1) | 0;
+                            else {
+                              k = h;
+                              break;
+                            }
+                        }
+                        h = E5(a, 0, 0, 0, (((k + n) << 2) + 4) | 0) | 0;
+                        if (!h) {
+                          g = 0;
+                          break a;
+                        }
+                        if ((k | 0) > 0) {
+                          l = c[l >> 2] | 0;
+                          j = 0;
+                          do {
+                            c[(h + (j << 2)) >> 2] = c[(l + (j << 2)) >> 2];
+                            j = (j + 1) | 0;
+                          } while ((j | 0) != (k | 0));
+                        } else k = 0;
+                        if (m) {
+                          j = 0;
+                          do {
+                            c[(h + ((j + k) << 2)) >> 2] = c[(e + (j << 2)) >> 2];
+                            j = (j + 1) | 0;
+                          } while ((j | 0) != (n | 0));
+                          j = n;
+                        } else j = 0;
+                        c[(h + ((j + k) << 2)) >> 2] = -1;
+                      }
+                      c[(g + (i << 5) + 12) >> 2] = h;
+                      i = (i + 1) | 0;
+                      h = c[(b + (i << 5)) >> 2] | 0;
+                      if ((h | 0) <= -1) {
+                        n = i;
+                        break;
+                      }
+                    }
+                  } else n = 0;
+                  i = c[d >> 2] | 0;
+                  h = (g + (n << 5)) | 0;
+                  if ((i | 0) > -1) {
+                    m = 0;
+                    l = n;
+                    do {
+                      c[h >> 2] = i;
+                      c[(g + (l << 5) + 4) >> 2] = c[(d + (m << 5) + 4) >> 2];
+                      c[(g + (l << 5) + 8) >> 2] = c[(d + (m << 5) + 8) >> 2];
+                      c[(g + (l << 5) + 16) >> 2] = c[(d + (m << 5) + 16) >> 2];
+                      c[(g + (l << 5) + 20) >> 2] = c[(d + (m << 5) + 20) >> 2];
+                      c[(g + (l << 5) + 24) >> 2] = c[(d + (m << 5) + 24) >> 2];
+                      c[(g + (l << 5) + 28) >> 2] = c[(d + (m << 5) + 28) >> 2];
+                      j = (d + (m << 5) + 12) | 0;
+                      h = c[j >> 2] | 0;
+                      if (!h) h = 0;
+                      else {
+                        i = 0;
+                        while (1)
+                          if ((c[(h + (i << 2)) >> 2] | 0) > -1) i = (i + 1) | 0;
+                          else break;
+                        h = E5(a, 0, 0, 0, ((i << 2) + 4) | 0) | 0;
+                        if (!h) {
+                          g = 0;
+                          break a;
+                        }
+                        if ((i | 0) > 0) {
+                          k = c[j >> 2] | 0;
+                          j = 0;
+                          do {
+                            c[(h + (j << 2)) >> 2] = c[(k + (j << 2)) >> 2];
+                            j = (j + 1) | 0;
+                          } while ((j | 0) != (i | 0));
+                        } else i = 0;
+                        c[(h + (i << 2)) >> 2] = -1;
+                      }
+                      c[(g + (l << 5) + 12) >> 2] = h;
+                      m = (m + 1) | 0;
+                      i = c[(d + (m << 5)) >> 2] | 0;
+                      l = (m + n) | 0;
+                      h = (g + (l << 5)) | 0;
+                    } while ((i | 0) > -1);
+                  }
+                  c[h >> 2] = -1;
+                }
+              while (0);
+              return g | 0;
+            }
+            function Z5(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              o = R5(a) | 0;
+              p = (f | 0) != 0;
+              if (p) c[f >> 2] = 0;
+              b = S5(a, b) | 0;
+              a: do
+                if (!b) {
+                  m = (d | 0) == 0;
+                  l = (e | 0) == 0;
+                  if ((R5(a) | 0) > (o | 0))
+                    while (1) {
+                      b = V5(a) | 0;
+                      b: do
+                        switch (c[b >> 2] | 0) {
+                          case 0: {
+                            b = c[(b + 4) >> 2] | 0;
+                            switch (c[b >> 2] | 0) {
+                              case -3:
+                                break;
+                              case -2: {
+                                if (l) break b;
+                                c[e >> 2] = c[e >> 2] | c[(b + 4) >> 2];
+                                break b;
+                              }
+                              default:
+                                break b;
+                            }
+                            h = c[(b + 4) >> 2] | 0;
+                            if ((h | 0) > -1) {
+                              c: do
+                                if (!m) {
+                                  b = 0;
+                                  while (1) {
+                                    i = (d + (b << 2)) | 0;
+                                    j = c[i >> 2] | 0;
+                                    if ((j | 0) <= -1) break;
+                                    if ((j | 0) == (h | 0)) break c;
+                                    else b = (b + 1) | 0;
+                                  }
+                                  c[i >> 2] = h;
+                                  c[(d + ((b + 1) << 2)) >> 2] = -1;
+                                }
+                              while (0);
+                              if (p) c[f >> 2] = (c[f >> 2] | 0) + 1;
+                            }
+                            break;
+                          }
+                          case 3: {
+                            b = c[(b + 4) >> 2] | 0;
+                            h = c[b >> 2] | 0;
+                            if (c[(h + 8) >> 2] | 0) {
+                              k = h;
+                              n = 6;
+                              break b;
+                            }
+                            b = c[(b + 4) >> 2] | 0;
+                            if (c[(b + 8) >> 2] | 0) {
+                              k = b;
+                              n = 6;
+                            }
+                            break;
+                          }
+                          case 1: {
+                            b = c[(b + 4) >> 2] | 0;
+                            h = S5(a, c[b >> 2] | 0) | 0;
+                            if (h | 0) {
+                              g = h;
+                              break a;
+                            }
+                            k = c[(b + 4) >> 2] | 0;
+                            n = 6;
+                            break;
+                          }
+                          case 2: {
+                            b = c[c[(b + 4) >> 2] >> 2] | 0;
+                            if (c[(b + 8) >> 2] | 0) {
+                              k = b;
+                              n = 6;
+                            }
+                            break;
+                          }
+                          default: {
+                          }
+                        }
+                      while (0);
+                      if ((n | 0) == 6 ? ((n = 0), (g = S5(a, k) | 0), g | 0) : 0) break a;
+                      if ((R5(a) | 0) <= (o | 0)) {
+                        g = 0;
+                        break a;
+                      }
+                    }
+                  else g = 0;
+                } else g = b;
+              while (0);
+              return g | 0;
+            }
+            function _5(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 16) | 0;
+              g = k;
+              d = (a + 12) | 0;
+              e = c[d >> 2] | 0;
+              j = c[a >> 2] | 0;
+              if ((e | 0) >= (j | 0)) {
+                d = c[(a + 4) >> 2] | 0;
+                if (
+                  (j | 0) < (d | 0)
+                    ? ((f = ((c[(a + 8) >> 2] | 0) + j) | 0),
+                      (f = (f | 0) > (d | 0) ? d : f),
+                      (h = (a + 16) | 0),
+                      (i = W1(c[h >> 2] | 0, f << 2) | 0),
+                      (i | 0) != 0)
+                    : 0
+                ) {
+                  c[a >> 2] = f;
+                  c[h >> 2] = i;
+                  c[g >> 2] = c[b >> 2];
+                  _5(a, g) | 0;
+                  d = 0;
+                } else d = 12;
+              } else {
+                c[((c[(a + 16) >> 2] | 0) + (e << 2)) >> 2] = c[b >> 2];
+                c[d >> 2] = (c[d >> 2] | 0) + 1;
+                d = 0;
+              }
+              l = k;
+              return d | 0;
+            }
+            function $5(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              a = E5(a, 0, 0, 1, 32) | 0;
+              if (((d | 0) != 0) & ((a | 0) != 0)) {
+                c[(a + 4) >> 2] = d;
+                c[a >> 2] = b;
+                c[(a + 8) >> 2] = -1;
+                c[(a + 12) >> 2] = -1;
+              } else a = 0;
+              return a | 0;
+            }
+            function a6(b, d, e, f, g, h, i, j) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              i = i | 0;
+              j = j | 0;
+              var k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0;
+              r = R5(d) | 0;
+              S5(d, e) | 0;
+              e = T5(d, 0) | 0;
+              a: do
+                if (!e) {
+                  q = ((f & 1) | 0) == 0;
+                  p = ((f & 2) | 0) != 0;
+                  o = 0;
+                  l = 1;
+                  e = i;
+                  while (1) {
+                    if ((R5(d) | 0) > (r | 0)) n = e;
+                    else {
+                      f = o;
+                      e = 0;
+                      break a;
+                    }
+                    b: while (1) {
+                      c: while (1) {
+                        switch (U5(d) | 0) {
+                          case 1: {
+                            i = 7;
+                            break c;
+                          }
+                          case 0: {
+                            e = V5(d) | 0;
+                            switch (c[e >> 2] | 0) {
+                              case 0: {
+                                i = 9;
+                                break b;
+                              }
+                              case 3: {
+                                i = 19;
+                                break b;
+                              }
+                              case 1: {
+                                i = 26;
+                                break b;
+                              }
+                              case 2: {
+                                i = 33;
+                                break c;
+                              }
+                              default: {
+                              }
+                            }
+                            break;
+                          }
+                          default: {
+                          }
+                        }
+                        if ((R5(d) | 0) <= (r | 0)) {
+                          f = o;
+                          e = 0;
+                          break a;
+                        }
+                      }
+                      if ((i | 0) == 7) e = V5(d) | 0;
+                      else if ((i | 0) == 33) {
+                        f = c[(e + 4) >> 2] | 0;
+                        e = S5(d, c[f >> 2] | 0) | 0;
+                        if (e | 0) {
+                          f = o;
+                          break a;
+                        }
+                        e = T5(d, 0) | 0;
+                        if (e | 0) {
+                          f = o;
+                          break a;
+                        }
+                        e = b6(b, c[f >> 2] | 0, c[(f + 4) >> 2] | 0, c[(f + 8) >> 2] | 0, a[(f + 12) >> 0] & 1) | 0;
+                        c[n >> 2] = e;
+                        if (!e) {
+                          f = o;
+                          e = 12;
+                          break a;
+                        }
+                        e = c[(e + 4) >> 2] | 0;
+                      }
+                      if ((R5(d) | 0) > (r | 0)) n = e;
+                      else {
+                        f = o;
+                        e = 0;
+                        break a;
+                      }
+                    }
+                    if ((i | 0) == 9) {
+                      m = c[(e + 4) >> 2] | 0;
+                      i = c[(m + 8) >> 2] | 0;
+                      f = c[m >> 2] | 0;
+                      e = c[(m + 4) >> 2] | 0;
+                      if (!(((f | 0) > -1) | ((f | 0) == -4)))
+                        if (q | ((f | 0) != -3))
+                          if ((f | 0) == -3)
+                            if (p & ((l | 0) != 0)) {
+                              c[(h + (e << 2)) >> 2] = 1;
+                              f = -3;
+                              k = o;
+                              l = 0;
+                            } else {
+                              f = -3;
+                              k = o;
+                            }
+                          else k = o;
+                        else {
+                          e = -1;
+                          f = -1;
+                          i = -1;
+                          k = o;
+                        }
+                      else {
+                        i = ((c[g >> 2] | 0) + i) | 0;
+                        k = (o + 1) | 0;
+                      }
+                      e = L5(b, f, e, i) | 0;
+                      c[n >> 2] = e;
+                      if (!e) e = 12;
+                      else {
+                        e = c[(e + 4) >> 2] | 0;
+                        c[(e + 12) >> 2] = c[(m + 12) >> 2];
+                        c[(e + 16) >> 2] = c[(m + 16) >> 2];
+                        e = 0;
+                      }
+                      if ((i | 0) > (c[j >> 2] | 0)) {
+                        c[j >> 2] = i;
+                        f = n;
+                      } else f = n;
+                    } else if ((i | 0) == 19) {
+                      i = c[(e + 4) >> 2] | 0;
+                      f = (i + 4) | 0;
+                      e = c6(b, c[i >> 2] | 0, c[f >> 2] | 0) | 0;
+                      c[n >> 2] = e;
+                      if (!e) {
+                        f = o;
+                        e = 12;
+                        break a;
+                      }
+                      m = c[(e + 4) >> 2] | 0;
+                      e = S5(d, c[f >> 2] | 0) | 0;
+                      if (e | 0) {
+                        f = o;
+                        break a;
+                      }
+                      e = T5(d, 0) | 0;
+                      if (e | 0) {
+                        f = o;
+                        break a;
+                      }
+                      e = S5(d, (m + 4) | 0) | 0;
+                      if (e | 0) {
+                        f = o;
+                        break a;
+                      }
+                      e = T5(d, 1) | 0;
+                      if (e | 0) {
+                        f = o;
+                        break a;
+                      }
+                      e = S5(d, c[i >> 2] | 0) | 0;
+                      if (e | 0) {
+                        f = o;
+                        break a;
+                      }
+                      k = o;
+                      f = m;
+                      e = T5(d, 0) | 0;
+                    } else if ((i | 0) == 26) {
+                      m = c[(e + 4) >> 2] | 0;
+                      i = (m + 4) | 0;
+                      e = M5(b, c[m >> 2] | 0, c[i >> 2] | 0) | 0;
+                      c[n >> 2] = e;
+                      if (!e) {
+                        f = o;
+                        e = 12;
+                        break a;
+                      }
+                      f = c[(e + 4) >> 2] | 0;
+                      c[f >> 2] = 0;
+                      k = (f + 4) | 0;
+                      c[k >> 2] = 0;
+                      e = S5(d, c[i >> 2] | 0) | 0;
+                      if (e | 0) {
+                        f = o;
+                        break a;
+                      }
+                      e = T5(d, 0) | 0;
+                      if (e | 0) {
+                        f = o;
+                        break a;
+                      }
+                      e = S5(d, k) | 0;
+                      if (e | 0) {
+                        f = o;
+                        break a;
+                      }
+                      e = T5(d, 1) | 0;
+                      if (e | 0) {
+                        f = o;
+                        break a;
+                      }
+                      e = S5(d, c[m >> 2] | 0) | 0;
+                      if (e | 0) {
+                        f = o;
+                        break a;
+                      }
+                      k = o;
+                      e = T5(d, 0) | 0;
+                    }
+                    if (!e) {
+                      o = k;
+                      e = f;
+                    } else {
+                      f = k;
+                      break;
+                    }
+                  }
+                } else f = 0;
+              while (0);
+              c[g >> 2] = (c[g >> 2] | 0) + f;
+              return e | 0;
+            }
+            function b6(b, d, e, f, g) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0;
+              h = E5(b, 0, 0, 1, 16) | 0;
+              b = $5(b, 2, h) | 0;
+              if (!b) b = 0;
+              else {
+                c[h >> 2] = d;
+                c[(h + 4) >> 2] = e;
+                c[(h + 8) >> 2] = f;
+                h = (h + 12) | 0;
+                a[h >> 0] = (a[h >> 0] & -2) | (g & 1);
+                c[(b + 16) >> 2] = c[(d + 16) >> 2];
+              }
+              return b | 0;
+            }
+            function c6(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0;
+              if (b) {
+                e = E5(a, 0, 0, 1, 8) | 0;
+                a = $5(a, 3, e) | 0;
+                if (((d | 0) != 0) & ((a | 0) != 0)) {
+                  c[e >> 2] = b;
+                  c[(e + 4) >> 2] = d;
+                  c[(a + 16) >> 2] = (c[(d + 16) >> 2] | 0) + (c[(b + 16) >> 2] | 0);
+                  d = a;
+                } else d = 0;
+              }
+              return d | 0;
+            }
+            function d6(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = E5(a, 0, 0, 0, 8) | 0;
+              if (
+                ((e | 0) != 0 ? ((d = L5(a, -3, d, -1) | 0), (c[e >> 2] = d), (d | 0) != 0) : 0)
+                  ? ((f = E5(a, 0, 0, 0, 32) | 0), (c[(e + 4) >> 2] = f), (f | 0) != 0)
+                  : 0
+              ) {
+                a = (b + 4) | 0;
+                c[(f + 4) >> 2] = c[a >> 2];
+                c[f >> 2] = c[b >> 2];
+                c[(f + 8) >> 2] = -1;
+                c[(f + 12) >> 2] = -1;
+                f = (f + 16) | 0;
+                c[f >> 2] = 0;
+                c[(f + 4) >> 2] = 0;
+                c[(f + 8) >> 2] = 0;
+                c[(f + 12) >> 2] = 0;
+                c[a >> 2] = e;
+                c[b >> 2] = 1;
+                a = 0;
+              } else a = 12;
+              return a | 0;
+            }
+            function e6(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              f = c[a >> 2] | 0;
+              if ((f | 0) > -1) {
+                g = c[(b + 16) >> 2] | 0;
+                e = 0;
+                b = f;
+                do {
+                  f = b >>> 1;
+                  c[(((b & 1) | 0) == 0 ? (g + ((f * 12) | 0)) | 0 : (g + ((f * 12) | 0) + 4) | 0) >> 2] = d;
+                  e = (e + 1) | 0;
+                  b = c[(a + (e << 2)) >> 2] | 0;
+                } while ((b | 0) > -1);
+              }
+              c[a >> 2] = -1;
+              return;
+            }
+            function f6(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = E5(a, 0, 0, 0, 8) | 0;
+              if (
+                ((e | 0) != 0 ? ((d = L5(a, -3, d, -1) | 0), (c[(e + 4) >> 2] = d), (d | 0) != 0) : 0)
+                  ? ((f = E5(a, 0, 0, 0, 32) | 0), (c[e >> 2] = f), (f | 0) != 0)
+                  : 0
+              ) {
+                a = (b + 4) | 0;
+                c[(f + 4) >> 2] = c[a >> 2];
+                c[f >> 2] = c[b >> 2];
+                c[(f + 8) >> 2] = -1;
+                c[(f + 12) >> 2] = -1;
+                f = (f + 16) | 0;
+                c[f >> 2] = 0;
+                c[(f + 4) >> 2] = 0;
+                c[(f + 8) >> 2] = 0;
+                c[(f + 12) >> 2] = 0;
+                c[a >> 2] = e;
+                c[b >> 2] = 1;
+                a = 0;
+              } else a = 12;
+              return a | 0;
+            }
+            function g6(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              m = l;
+              l = (l + 16) | 0;
+              j = m;
+              i = (b + 32) | 0;
+              h = c[i >> 2] | 0;
+              g = h & 1;
+              a: do
+                switch (a[d >> 0] | 0) {
+                  case 91: {
+                    e = k6(b, (d + 1) | 0) | 0;
+                    break;
+                  }
+                  case 92: {
+                    e = (d + 1) | 0;
+                    f = l6(e) | 0;
+                    if (f | 0) {
+                      e = g6(b, f) | 0;
+                      c[(b + 12) >> 2] = d + 2;
+                      break a;
+                    }
+                    f = a[e >> 0] | 0;
+                    switch (f | 0) {
+                      case 0: {
+                        e = 5;
+                        break a;
+                      }
+                      case 98: {
+                        f = L5(c[b >> 2] | 0, -2, 64, -1) | 0;
+                        break;
+                      }
+                      case 66: {
+                        f = L5(c[b >> 2] | 0, -2, 128, -1) | 0;
+                        break;
+                      }
+                      case 60: {
+                        f = L5(c[b >> 2] | 0, -2, 16, -1) | 0;
+                        break;
+                      }
+                      case 62: {
+                        f = L5(c[b >> 2] | 0, -2, 32, -1) | 0;
+                        break;
+                      }
+                      case 120: {
+                        h = (d + 2) | 0;
+                        i = (a[h >> 0] | 0) == 123;
+                        g = i ? 8 : 2;
+                        h = i ? (d + 3) | 0 : h;
+                        e = 0;
+                        f = 0;
+                        do {
+                          d = m6(a[(h + e) >> 0] | 0) | 0;
+                          if ((d | 0) < 0) break;
+                          f = (d + (f << 4)) | 0;
+                          e = (e + 1) | 0;
+                        } while (((f | 0) < 1114112) & ((e | 0) < (g | 0)));
+                        e = (h + e) | 0;
+                        if (i) {
+                          if ((a[e >> 0] | 0) != 125) {
+                            e = 9;
+                            break a;
+                          }
+                          e = (e + 1) | 0;
+                        }
+                        j = c[b >> 2] | 0;
+                        i = (b + 24) | 0;
+                        k = c[i >> 2] | 0;
+                        c[i >> 2] = k + 1;
+                        f = L5(j, f, f, k) | 0;
+                        e = (e + -1) | 0;
+                        break;
+                      }
+                      case 63:
+                      case 43:
+                      case 123:
+                        if (!g) {
+                          e = 13;
+                          break a;
+                        } else {
+                          k = 37;
+                          break a;
+                        }
+                      case 124: {
+                        if (g | 0) {
+                          k = 37;
+                          break a;
+                        }
+                        e = L5(c[b >> 2] | 0, -1, -1, -1) | 0;
+                        k = 45;
+                        break a;
+                      }
+                      default: {
+                        if (!(((g | 0) == 0) & (((f + -49) | 0) >>> 0 < 9))) {
+                          k = 37;
+                          break a;
+                        }
+                        j = (f + -48) | 0;
+                        k = c[b >> 2] | 0;
+                        i = (b + 24) | 0;
+                        f = c[i >> 2] | 0;
+                        c[i >> 2] = f + 1;
+                        f = L5(k, -4, j, f) | 0;
+                        k = (b + 28) | 0;
+                        i = c[k >> 2] | 0;
+                        c[k >> 2] = (j | 0) < (i | 0) ? i : j;
+                      }
+                    }
+                    d = (e + 1) | 0;
+                    e = f;
+                    k = 45;
+                    break;
+                  }
+                  case 46: {
+                    e = c[b >> 2] | 0;
+                    g = (b + 24) | 0;
+                    f = c[g >> 2] | 0;
+                    c[g >> 2] = f + 1;
+                    if (h & 4) {
+                      f = L5(e, 0, 9, f) | 0;
+                      k = c[b >> 2] | 0;
+                      e = c[g >> 2] | 0;
+                      c[g >> 2] = e + 1;
+                      e = L5(k, 11, 1114111, e) | 0;
+                      if (((f | 0) != 0) & ((e | 0) != 0)) e = c6(c[b >> 2] | 0, f, e) | 0;
+                      else e = 0;
+                    } else e = L5(e, 0, 1114111, f) | 0;
+                    d = (d + 1) | 0;
+                    k = 45;
+                    break;
+                  }
+                  case 94: {
+                    if ((g | 0) == 0 ? (c[(b + 16) >> 2] | 0) != (d | 0) : 0) {
+                      e = d;
+                      k = 37;
+                      break a;
+                    }
+                    d = (d + 1) | 0;
+                    e = L5(c[b >> 2] | 0, -2, 1, -1) | 0;
+                    k = 45;
+                    break;
+                  }
+                  case 36: {
+                    e = (d + 1) | 0;
+                    if ((g | 0) == 0 ? a[e >> 0] | 0 : 0) {
+                      e = d;
+                      k = 37;
+                      break a;
+                    }
+                    d = e;
+                    e = L5(c[b >> 2] | 0, -2, 2, -1) | 0;
+                    k = 45;
+                    break;
+                  }
+                  case 63:
+                  case 43:
+                  case 123:
+                  case 42: {
+                    if (!g) {
+                      e = d;
+                      k = 37;
+                    } else e = 13;
+                    break;
+                  }
+                  case 124: {
+                    if (!g) {
+                      e = d;
+                      k = 37;
+                    } else k = 36;
+                    break;
+                  }
+                  case 0: {
+                    k = 36;
+                    break;
+                  }
+                  default: {
+                    e = d;
+                    k = 37;
+                  }
+                }
+              while (0);
+              if ((k | 0) == 36) {
+                e = L5(c[b >> 2] | 0, -1, -1, -1) | 0;
+                k = 45;
+              } else if ((k | 0) == 37) {
+                h = R4(j, e, -1) | 0;
+                if ((h | 0) < 0) e = 2;
+                else {
+                  do
+                    if (c[i >> 2] & 2) {
+                      if ((C3(c[j >> 2] | 0) | 0) == 0 ? (B3(c[j >> 2] | 0) | 0) == 0 : 0) {
+                        k = 43;
+                        break;
+                      }
+                      i = c[b >> 2] | 0;
+                      n = f3(c[j >> 2] | 0) | 0;
+                      g = f3(c[j >> 2] | 0) | 0;
+                      f = (b + 24) | 0;
+                      g = L5(i, n, g, c[f >> 2] | 0) | 0;
+                      n = c[b >> 2] | 0;
+                      i = E3(c[j >> 2] | 0) | 0;
+                      d = E3(c[j >> 2] | 0) | 0;
+                      d = L5(n, i, d, c[f >> 2] | 0) | 0;
+                      if (((g | 0) != 0) & ((d | 0) != 0)) g = c6(c[b >> 2] | 0, g, d) | 0;
+                      else g = 0;
+                    } else k = 43;
+                  while (0);
+                  if ((k | 0) == 43) {
+                    g = c[j >> 2] | 0;
+                    f = (b + 24) | 0;
+                    g = L5(c[b >> 2] | 0, g, g, c[f >> 2] | 0) | 0;
+                  }
+                  c[f >> 2] = (c[f >> 2] | 0) + 1;
+                  d = (e + h) | 0;
+                  e = g;
+                  k = 45;
+                }
+              }
+              if ((k | 0) == 45)
+                if (!e) e = 12;
+                else {
+                  c[(b + 8) >> 2] = e;
+                  c[(b + 12) >> 2] = d;
+                  e = 0;
+                }
+              l = m;
+              return e | 0;
+            }
+            function h6(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0;
+              j = l;
+              l = (l + 16) | 0;
+              i = (j + 4) | 0;
+              g = j;
+              b = j6(b, i) | 0;
+              if ((a[b >> 0] | 0) == 44) {
+                b = j6((b + 1) | 0, g) | 0;
+                h = c[g >> 2] | 0;
+                g = c[i >> 2] | 0;
+              } else {
+                i = c[i >> 2] | 0;
+                c[g >> 2] = i;
+                h = i;
+                g = i;
+              }
+              do
+                if (!((g >>> 0 > 255) | (((h | 0) > 255) | (((h | 0) > -1) & ((h | 0) < (g | 0)))))) {
+                  if (!d)
+                    if ((a[b >> 0] | 0) == 92) b = (b + 1) | 0;
+                    else {
+                      b = 0;
+                      break;
+                    }
+                  if ((a[b >> 0] | 0) == 125) {
+                    c[e >> 2] = g;
+                    c[f >> 2] = h;
+                    b = (b + 1) | 0;
+                  } else b = 0;
+                } else b = 0;
+              while (0);
+              l = j;
+              return b | 0;
+            }
+            function i6(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              if ((c[(b + 12) >> 2] | 0) > -1) {
+                e = L5(c[a >> 2] | 0, -1, -1, -1) | 0;
+                if ((e | 0) != 0 ? ((f = M5(c[a >> 2] | 0, e, b) | 0), (f | 0) != 0) : 0) {
+                  e = c[(b + 16) >> 2] | 0;
+                  c[(f + 16) >> 2] = e;
+                  g = 6;
+                } else e = 12;
+              } else {
+                f = b;
+                e = c[(b + 16) >> 2] | 0;
+                g = 6;
+              }
+              if ((g | 0) == 6) {
+                c[(f + 12) >> 2] = d;
+                c[(f + 16) >> 2] = e + 1;
+                c[(a + 8) >> 2] = f;
+                e = 0;
+              }
+              return e | 0;
+            }
+            function j6(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0;
+              c[d >> 2] = -1;
+              if ((((a[b >> 0] | 0) + -48) | 0) >>> 0 < 10) {
+                c[d >> 2] = 0;
+                e = b;
+                g = 0;
+                f = a[b >> 0] | 0;
+                while (1) {
+                  g = (((g * 10) | 0) + -48 + ((f << 24) >> 24)) | 0;
+                  c[d >> 2] = g;
+                  b = (e + 1) | 0;
+                  f = a[b >> 0] | 0;
+                  if (((g | 0) > 255) | (((((f << 24) >> 24) + -48) | 0) >>> 0 > 9)) break;
+                  else e = b;
+                }
+              }
+              return b | 0;
+            }
+            function k6(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0;
+              s = l;
+              l = (l + 288) | 0;
+              e = (s + 264) | 0;
+              g = s;
+              c[e >> 2] = c[b >> 2];
+              h = (e + 8) | 0;
+              c[h >> 2] = 0;
+              c[(e + 12) >> 2] = 32;
+              p = T1(128) | 0;
+              r = (e + 4) | 0;
+              c[r >> 2] = p;
+              if (!p) d = 12;
+              else {
+                f = (g + 4) | 0;
+                c[f >> 2] = 0;
+                p = (a[d >> 0] | 0) == 94;
+                c[g >> 2] = p & 1;
+                d = n6(b, p ? (d + 1) | 0 : d, e, g) | 0;
+                a: do
+                  if (!d) {
+                    p = (c[g >> 2] | 0) == 0;
+                    if (!p) {
+                      o4(c[r >> 2] | 0, c[h >> 2] | 0, 4, 111);
+                      d = p6(e) | 0;
+                      if (!d) {
+                        d = 12;
+                        e = 0;
+                        break;
+                      }
+                      c[d >> 2] = 1114112;
+                      c[(d + 4) >> 2] = 1114112;
+                      c[(d + 8) >> 2] = -1;
+                      d = c[f >> 2] | 0;
+                      if (d) {
+                        e = d << 2;
+                        f = E5(c[b >> 2] | 0, 0, 0, 0, (e + 4) | 0) | 0;
+                        if (!f) {
+                          d = 12;
+                          e = 0;
+                          break;
+                        }
+                        W6(f | 0, (g + 8) | 0, e | 0) | 0;
+                        c[(f + (d << 2)) >> 2] = 0;
+                      } else f = 0;
+                    } else f = 0;
+                    m = c[h >> 2] | 0;
+                    if ((m | 0) > 0) {
+                      n = c[r >> 2] | 0;
+                      o = (b + 24) | 0;
+                      e = 0;
+                      d = 0;
+                      k = 0;
+                      while (1) {
+                        j = c[(n + (k << 2)) >> 2] | 0;
+                        g = c[j >> 2] | 0;
+                        h = (j + 4) | 0;
+                        i = c[h >> 2] | 0;
+                        do
+                          if (!p)
+                            if ((g | 0) > (d | 0)) {
+                              c[j >> 2] = d;
+                              c[h >> 2] = g + -1;
+                              d = (i + 1) | 0;
+                              q = 14;
+                              break;
+                            } else {
+                              j = (i + 1) | 0;
+                              d = (j | 0) >= (d | 0) ? j : d;
+                              break;
+                            }
+                          else q = 14;
+                        while (0);
+                        if ((q | 0) == 14) {
+                          q = 0;
+                          c[(j + 8) >> 2] = c[o >> 2];
+                          c[(j + 16) >> 2] = f;
+                          j = $5(c[b >> 2] | 0, 0, j) | 0;
+                          e = c6(c[b >> 2] | 0, e, j) | 0;
+                          if (!e) {
+                            d = 12;
+                            e = 0;
+                            break a;
+                          }
+                        }
+                        k = (k + 1) | 0;
+                        if ((k | 0) >= (m | 0)) {
+                          d = 0;
+                          break;
+                        }
+                      }
+                    } else {
+                      d = 0;
+                      e = 0;
+                    }
+                  } else e = 0;
+                while (0);
+                U1(c[r >> 2] | 0);
+                r = (b + 24) | 0;
+                c[r >> 2] = (c[r >> 2] | 0) + 1;
+                c[(b + 8) >> 2] = e;
+              }
+              l = s;
+              return d | 0;
+            }
+            function l6(b) {
+              b = b | 0;
+              var d = 0;
+              d = a[b >> 0] | 0;
+              b = 0;
+              while (1) {
+                if ((a[(63752 + (b << 3)) >> 0] | 0) == (d << 24) >> 24) break;
+                b = (b + 1) | 0;
+                if ((b | 0) == 12) {
+                  b = 12;
+                  break;
+                }
+              }
+              return c[(63752 + (b << 3) + 4) >> 2] | 0;
+            }
+            function m6(a) {
+              a = a | 0;
+              var b = 0;
+              b = (a + -48) | 0;
+              if (b >>> 0 < 10) return b | 0;
+              else {
+                b = a | 32;
+                return (((b + -97) | 0) >>> 0 < 6 ? (b + -87) | 0 : -1) | 0;
+              }
+              return 0;
+            }
+            function n6(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0;
+              t = l;
+              l = (l + 32) | 0;
+              o = t;
+              q = (t + 4) | 0;
+              i = R4(o, d, -1) | 0;
+              g = a[d >> 0] | 0;
+              a: do
+                if ((i | 0) >= 1) {
+                  r = (f + 4) | 0;
+                  n = (b + 32) | 0;
+                  h = d;
+                  j = i;
+                  b: while (1) {
+                    i = (h | 0) == (d | 0);
+                    if (!(i | ((g << 24) >> 24 != 93))) {
+                      s = 5;
+                      break;
+                    }
+                    c: do
+                      if (!(i | ((g << 24) >> 24 != 45))) {
+                        switch (a[(h + 1) >> 0] | 0) {
+                          case 93:
+                            break c;
+                          case 45:
+                            break;
+                          default: {
+                            g = 11;
+                            break a;
+                          }
+                        }
+                        if ((a[(h + 2) >> 0] | 0) == 93) {
+                          g = 11;
+                          break a;
+                        }
+                      }
+                    while (0);
+                    d: do
+                      if ((g << 24) >> 24 == 91) {
+                        switch (a[(h + 1) >> 0] | 0) {
+                          case 61:
+                          case 46: {
+                            g = 3;
+                            break a;
+                          }
+                          case 58:
+                            break;
+                          default: {
+                            s = 17;
+                            break d;
+                          }
+                        }
+                        i = (h + 2) | 0;
+                        g = 0;
+                        e: while (1) {
+                          switch (a[(i + g) >> 0] | 0) {
+                            case 0: {
+                              s = 16;
+                              break b;
+                            }
+                            case 58:
+                              break e;
+                            default: {
+                            }
+                          }
+                          if ((g | 0) < 13) g = (g + 1) | 0;
+                          else {
+                            s = 16;
+                            break b;
+                          }
+                        }
+                        W6(q | 0, i | 0, g | 0) | 0;
+                        a[(q + g) >> 0] = 0;
+                        j = X3(q) | 0;
+                        if (!j) {
+                          s = 16;
+                          break b;
+                        }
+                        h = (i + (g + 2)) | 0;
+                        if ((a[(i + (g + 1)) >> 0] | 0) != 93) {
+                          s = 16;
+                          break b;
+                        }
+                        if (!(c[f >> 2] | 0)) {
+                          g = 1114111;
+                          m = 0;
+                          k = 1;
+                          s = 25;
+                        } else {
+                          g = c[r >> 2] | 0;
+                          if ((g | 0) > 63) {
+                            g = 12;
+                            break a;
+                          }
+                          c[r >> 2] = g + 1;
+                          c[(f + 8 + (g << 2)) >> 2] = j;
+                        }
+                      } else s = 17;
+                    while (0);
+                    if ((s | 0) == 17) {
+                      s = 0;
+                      i = c[o >> 2] | 0;
+                      h = (h + j) | 0;
+                      if ((a[h >> 0] | 0) == 45 ? ((p = (h + 1) | 0), (a[p >> 0] | 0) != 93) : 0) {
+                        h = R4(o, p, -1) | 0;
+                        g = c[o >> 2] | 0;
+                        if (((h | 0) < 1) | ((i | 0) > (g | 0))) {
+                          g = 11;
+                          break a;
+                        }
+                        j = 0;
+                        m = i;
+                        h = (p + h) | 0;
+                        k = 0;
+                        s = 25;
+                      } else {
+                        j = 0;
+                        g = i;
+                        m = i;
+                        k = 0;
+                        s = 25;
+                      }
+                    }
+                    if ((s | 0) == 25) {
+                      s = 0;
+                      i = p6(e) | 0;
+                      if (!i) {
+                        g = 12;
+                        break a;
+                      }
+                      c[i >> 2] = m;
+                      c[(i + 4) >> 2] = g;
+                      c[(i + 12) >> 2] = j;
+                      c[(i + 8) >> 2] = -1;
+                      if (!(k | (((c[n >> 2] & 2) | 0) == 0)) ? (q6(e, m, g) | 0) != 0 : 0) {
+                        g = 12;
+                        break a;
+                      }
+                    }
+                    j = R4(o, h, -1) | 0;
+                    g = a[h >> 0] | 0;
+                    if ((j | 0) < 1) {
+                      s = 3;
+                      break a;
+                    }
+                  }
+                  if ((s | 0) == 5) {
+                    c[(b + 12) >> 2] = h + 1;
+                    g = 0;
+                    break;
+                  } else if ((s | 0) == 16) {
+                    g = 4;
+                    break;
+                  }
+                } else s = 3;
+              while (0);
+              if ((s | 0) == 3) g = (g << 24) >> 24 ? 2 : 7;
+              l = t;
+              return g | 0;
+            }
+            function o6(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return ((c[c[a >> 2] >> 2] | 0) - (c[c[b >> 2] >> 2] | 0)) | 0;
+            }
+            function p6(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              h = (a + 8) | 0;
+              d = c[h >> 2] | 0;
+              e = (a + 12) | 0;
+              f = c[e >> 2] | 0;
+              if ((d | 0) >= (f | 0))
+                if (
+                  (f | 0) <= 32767
+                    ? ((c[e >> 2] = f << 1), (g = (a + 4) | 0), (b = W1(c[g >> 2] | 0, f << 3) | 0), (b | 0) != 0)
+                    : 0
+                ) {
+                  c[g >> 2] = b;
+                  d = c[h >> 2] | 0;
+                  i = 6;
+                } else b = 0;
+              else {
+                b = c[(a + 4) >> 2] | 0;
+                i = 6;
+              }
+              if ((i | 0) == 6) {
+                c[h >> 2] = d + 1;
+                i = E5(c[a >> 2] | 0, 0, 0, 1, 20) | 0;
+                c[(b + (d << 2)) >> 2] = i;
+                b = i;
+              }
+              return b | 0;
+            }
+            function q6(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0;
+              a: do
+                if ((b | 0) > (d | 0)) b = 0;
+                else
+                  while (1) {
+                    b: do
+                      if (!(B3(b) | 0)) {
+                        if (!(C3(b) | 0)) {
+                          b = (b + 1) | 0;
+                          break;
+                        }
+                        f = E3(b) | 0;
+                        e = f;
+                        while (1) {
+                          g = (b + 1) | 0;
+                          e = (e + 1) | 0;
+                          if ((b | 0) >= (d | 0)) {
+                            h = f;
+                            b = g;
+                            g = 12;
+                            break b;
+                          }
+                          if ((E3(g) | 0) == (e | 0)) b = g;
+                          else {
+                            h = f;
+                            b = g;
+                            g = 12;
+                            break;
+                          }
+                        }
+                      } else {
+                        f = f3(b) | 0;
+                        e = f;
+                        while (1) {
+                          g = (b + 1) | 0;
+                          e = (e + 1) | 0;
+                          if ((b | 0) >= (d | 0)) {
+                            h = f;
+                            b = g;
+                            g = 12;
+                            break b;
+                          }
+                          if ((f3(g) | 0) == (e | 0)) b = g;
+                          else {
+                            h = f;
+                            b = g;
+                            g = 12;
+                            break;
+                          }
+                        }
+                      }
+                    while (0);
+                    if ((g | 0) == 12) {
+                      g = 0;
+                      f = p6(a) | 0;
+                      if (!f) {
+                        b = -1;
+                        break a;
+                      }
+                      c[f >> 2] = h;
+                      c[(f + 4) >> 2] = e + -1;
+                      c[(f + 8) >> 2] = -1;
+                    }
+                    if ((b | 0) > (d | 0)) {
+                      b = 0;
+                      break;
+                    }
+                  }
+              while (0);
+              return b | 0;
+            }
+            function r6(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0;
+              n = l;
+              l = (l + 16) | 0;
+              k = n;
+              i = c[(a + 4) >> 2] | 0;
+              j = (i + 56) | 0;
+              h = ((c[j >> 2] & 8) | 0) == 0 ? d : 0;
+              a = c[(i + 40) >> 2] | 0;
+              if (((a | 0) > 0) & ((h | 0) != 0)) {
+                a = T1(a << 2) | 0;
+                if (!a) a = 12;
+                else {
+                  g = a;
+                  d = a;
+                  m = 3;
+                }
+              } else {
+                g = 0;
+                d = 0;
+                m = 3;
+              }
+              if ((m | 0) == 3) {
+                if (!(c[(i + 60) >> 2] | 0)) a = t6(i, b, g, f, k) | 0;
+                else a = s6(i, b, g, f, k) | 0;
+                if (!a) u6(h, e, c[j >> 2] | 0, i, g, c[k >> 2] | 0);
+                if (g) U1(d);
+              }
+              l = n;
+              return a | 0;
+            }
+            function s6(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                O = 0,
+                P = 0,
+                Q = 0,
+                R = 0,
+                S = 0,
+                T = 0,
+                U = 0,
+                V = 0;
+              V = l;
+              l = (l + 16) | 0;
+              T = V;
+              c[T >> 2] = 0;
+              o = e & 1;
+              R = e & 2;
+              S = (a + 56) | 0;
+              n = c[S >> 2] & 4;
+              U = C5(0, 0) | 0;
+              a: do
+                if (U) {
+                  p = E5(U, 0, 0, 0, 32) | 0;
+                  if (!p) {
+                    D5(U);
+                    e = 12;
+                    break;
+                  }
+                  c[(p + 24) >> 2] = 0;
+                  c[(p + 28) >> 2] = 0;
+                  Q = (a + 40) | 0;
+                  q = c[Q >> 2] | 0;
+                  if (q) {
+                    e = T1(q << 2) | 0;
+                    if (!e) {
+                      m = 0;
+                      k = 0;
+                      j = e;
+                      e = 12;
+                      i = 0;
+                      h = 0;
+                      g = 0;
+                    } else {
+                      j = e;
+                      i = e;
+                      C = 6;
+                    }
+                  } else {
+                    j = 0;
+                    i = 0;
+                    C = 6;
+                  }
+                  b: do
+                    if ((C | 0) == 6) {
+                      e = c[(a + 28) >> 2] | 0;
+                      if (e) {
+                        e = T1(e << 3) | 0;
+                        if (!e) {
+                          m = e;
+                          k = 0;
+                          e = 12;
+                          h = 0;
+                          g = 0;
+                          break;
+                        } else {
+                          m = e;
+                          h = e;
+                        }
+                      } else {
+                        m = 0;
+                        h = 0;
+                      }
+                      P = (a + 52) | 0;
+                      e = c[P >> 2] | 0;
+                      if (e) {
+                        e = T1(e << 2) | 0;
+                        if (!e) {
+                          k = e;
+                          e = 12;
+                          g = 0;
+                          break;
+                        } else {
+                          k = e;
+                          g = e;
+                        }
+                      } else {
+                        k = 0;
+                        g = 0;
+                      }
+                      K = (a + 8) | 0;
+                      L = (a + 12) | 0;
+                      M = (d | 0) == 0;
+                      N = (d | 0) != 0;
+                      O = (a + 32) | 0;
+                      J = (n | 0) != 0;
+                      I = (o | 0) == 0;
+                      s = b;
+                      e = 1;
+                      r = -1;
+                      v = -1;
+                      n = q;
+                      B = 0;
+                      c: while (1) {
+                        if ((n | 0) > 0) {
+                          o = 0;
+                          do {
+                            c[(j + (o << 2)) >> 2] = -1;
+                            if (!M) {
+                              c[(d + (o << 2)) >> 2] = -1;
+                              n = c[Q >> 2] | 0;
+                            }
+                            o = (o + 1) | 0;
+                          } while ((o | 0) < (n | 0));
+                        }
+                        n = c[P >> 2] | 0;
+                        if ((n | 0) > 0) Y6(g | 0, 0, (n << 2) | 0) | 0;
+                        G = (e + r) | 0;
+                        e = R4(T, s, 4) | 0;
+                        if ((e | 0) < 1)
+                          if ((e | 0) < 0) {
+                            e = 1;
+                            break b;
+                          } else e = 1;
+                        F = (s + e) | 0;
+                        H = c[T >> 2] | 0;
+                        n = c[K >> 2] | 0;
+                        o = (n + 8) | 0;
+                        if (c[o >> 2] | 0) {
+                          w = (G | 0) != 0;
+                          x = (B | 0) == 95;
+                          y = (G | 0) == 0;
+                          A = J & ((B | 0) == 10);
+                          z = ((G | 0) < 1) & I;
+                          u = n;
+                          n = 0;
+                          t = 0;
+                          s = o;
+                          while (1) {
+                            r = (u + 20) | 0;
+                            o = c[r >> 2] | 0;
+                            d: do
+                              if (o)
+                                if ((((o & 1) | 0) == 0) | z | A) {
+                                  if (
+                                    (o & 2) | 0
+                                      ? ((E = c[T >> 2] | 0), !(((E | R | 0) == 0) | (J & ((E | 0) == 10))))
+                                      : 0
+                                  ) {
+                                    q = t;
+                                    break;
+                                  }
+                                  do
+                                    if ((o & 16) | 0) {
+                                      if (x) {
+                                        q = t;
+                                        break d;
+                                      }
+                                      if (x3(B) | 0) {
+                                        q = t;
+                                        break d;
+                                      }
+                                      o = c[T >> 2] | 0;
+                                      if ((o | 0) == 95) break;
+                                      if (!(x3(o) | 0)) {
+                                        q = t;
+                                        break d;
+                                      }
+                                    }
+                                  while (0);
+                                  o = c[r >> 2] | 0;
+                                  if (o & 32) {
+                                    if (x) {
+                                      o = c[T >> 2] | 0;
+                                      if ((o | 0) == 95) {
+                                        q = t;
+                                        break;
+                                      }
+                                    } else {
+                                      E = (x3(B) | 0) == 0;
+                                      o = c[T >> 2] | 0;
+                                      if (E | ((o | 0) == 95)) {
+                                        q = t;
+                                        break;
+                                      }
+                                    }
+                                    if (x3(o) | 0) {
+                                      q = t;
+                                      break;
+                                    }
+                                    o = c[r >> 2] | 0;
+                                  }
+                                  q = c[T >> 2] | 0;
+                                  do
+                                    if (((q | 0) != 0) & (w & (((o & 64) | 0) != 0))) {
+                                      if (x) o = 1;
+                                      else {
+                                        o = (x3(B) | 0) != 0;
+                                        q = c[T >> 2] | 0;
+                                      }
+                                      if ((q | 0) == 95)
+                                        if (o) {
+                                          q = t;
+                                          break d;
+                                        } else break;
+                                      else if (o ^ ((x3(q) | 0) != 0)) break;
+                                      else {
+                                        q = t;
+                                        break d;
+                                      }
+                                    }
+                                  while (0);
+                                  if (!(c[r >> 2] & 128)) {
+                                    C = 49;
+                                    break;
+                                  }
+                                  o = c[T >> 2] | 0;
+                                  if (y | ((o | 0) == 0)) {
+                                    q = t;
+                                    break;
+                                  }
+                                  if (x) q = 1;
+                                  else {
+                                    q = (x3(B) | 0) != 0;
+                                    o = c[T >> 2] | 0;
+                                  }
+                                  if ((o | 0) == 95)
+                                    if (q) {
+                                      C = 49;
+                                      break;
+                                    } else {
+                                      q = t;
+                                      break;
+                                    }
+                                  else if (q ^ ((x3(o) | 0) != 0)) {
+                                    q = t;
+                                    break;
+                                  } else {
+                                    C = 49;
+                                    break;
+                                  }
+                                } else q = t;
+                              else C = 49;
+                            while (0);
+                            do
+                              if ((C | 0) == 49) {
+                                C = 0;
+                                if (!t) {
+                                  n = c[(u + 16) >> 2] | 0;
+                                  q = c[s >> 2] | 0;
+                                  break;
+                                }
+                                q = (p + 28) | 0;
+                                o = c[q >> 2] | 0;
+                                if (!o) {
+                                  o = E5(U, 0, 0, 0, 32) | 0;
+                                  if (!o) {
+                                    C = 53;
+                                    break c;
+                                  }
+                                  c[(o + 24) >> 2] = p;
+                                  c[(o + 28) >> 2] = 0;
+                                  E = E5(U, 0, 0, 0, c[Q >> 2] << 2) | 0;
+                                  c[(o + 20) >> 2] = E;
+                                  if (!E) {
+                                    C = 60;
+                                    break c;
+                                  }
+                                  c[q >> 2] = o;
+                                  p = o;
+                                } else p = o;
+                                c[p >> 2] = G;
+                                c[(p + 4) >> 2] = F;
+                                c[(p + 8) >> 2] = c[s >> 2];
+                                c[(p + 12) >> 2] = c[(u + 12) >> 2];
+                                c[(p + 16) >> 2] = c[T >> 2];
+                                if ((c[Q >> 2] | 0) > 0) {
+                                  q = c[(p + 20) >> 2] | 0;
+                                  o = 0;
+                                  do {
+                                    c[(q + (o << 2)) >> 2] = c[(j + (o << 2)) >> 2];
+                                    o = (o + 1) | 0;
+                                  } while ((o | 0) < (c[Q >> 2] | 0));
+                                }
+                                o = c[(u + 16) >> 2] | 0;
+                                if (!o) q = t;
+                                else {
+                                  q = c[o >> 2] | 0;
+                                  if ((q | 0) <= -1) {
+                                    q = t;
+                                    break;
+                                  }
+                                  r = c[(p + 20) >> 2] | 0;
+                                  do {
+                                    o = (o + 4) | 0;
+                                    c[(r + (q << 2)) >> 2] = G;
+                                    q = c[o >> 2] | 0;
+                                  } while ((q | 0) > -1);
+                                  q = t;
+                                }
+                              }
+                            while (0);
+                            s = (u + 40) | 0;
+                            if (!(c[s >> 2] | 0)) break;
+                            else {
+                              u = (u + 32) | 0;
+                              t = q;
+                            }
+                          }
+                          if (n) {
+                            o = c[n >> 2] | 0;
+                            if ((o | 0) > -1)
+                              do {
+                                c[(j + (o << 2)) >> 2] = G;
+                                n = (n + 4) | 0;
+                                o = c[n >> 2] | 0;
+                              } while ((o | 0) > -1);
+                          } else n = 0;
+                          if (!q) C = 171;
+                          else {
+                            s = G;
+                            r = F;
+                            w = q;
+                            x = n;
+                            C = 79;
+                          }
+                        } else {
+                          n = 0;
+                          C = 171;
+                        }
+                        e: while (1) {
+                          if ((C | 0) == 79) {
+                            if ((w | 0) == (c[L >> 2] | 0)) {
+                              if ((v | 0) >= (s | 0)) {
+                                if (!(N & ((v | 0) == (s | 0)))) {
+                                  n = x;
+                                  C = 171;
+                                  continue;
+                                }
+                                n = c[Q >> 2] | 0;
+                                if (!(w6(n, c[O >> 2] | 0, j, d) | 0)) {
+                                  n = x;
+                                  C = 171;
+                                  continue;
+                                }
+                              } else {
+                                if (M) {
+                                  v = s;
+                                  n = x;
+                                  C = 171;
+                                  continue;
+                                }
+                                n = c[Q >> 2] | 0;
+                              }
+                              if ((n | 0) > 0) n = 0;
+                              else {
+                                v = s;
+                                n = x;
+                                C = 171;
+                                continue;
+                              }
+                              while (1) {
+                                c[(d + (n << 2)) >> 2] = c[(j + (n << 2)) >> 2];
+                                n = (n + 1) | 0;
+                                if ((n | 0) >= (c[Q >> 2] | 0)) {
+                                  v = s;
+                                  n = x;
+                                  C = 171;
+                                  continue e;
+                                }
+                              }
+                            }
+                            u = (w + 8) | 0;
+                            if ((c[u >> 2] | 0) != 0 ? ((c[(w + 20) >> 2] & 256) | 0) != 0 : 0) {
+                              o = c[(w + 24) >> 2] | 0;
+                              u6((o + 1) | 0, m, c[S >> 2] & -9, a, j, s);
+                              E = c[(m + (o << 3)) >> 2] | 0;
+                              o = ((c[(m + (o << 3) + 4) >> 2] | 0) - E) | 0;
+                              if (Q2((b + E) | 0, (r + -1) | 0, o) | 0) {
+                                n = x;
+                                C = 171;
+                                continue;
+                              }
+                              E = (o | 0) == 0;
+                              n = E & 1;
+                              q = c[(w + 12) >> 2] | 0;
+                              if (E ? c[(k + (q << 2)) >> 2] | 0 : 0) {
+                                n = x;
+                                C = 171;
+                                continue;
+                              }
+                              c[(k + (q << 2)) >> 2] = n;
+                              o = (o + -1) | 0;
+                              r = (r + o) | 0;
+                              o = (o + s) | 0;
+                              q = c[T >> 2] | 0;
+                              n = R4(T, r, 4) | 0;
+                              if ((n | 0) < 1)
+                                if ((n | 0) < 0) {
+                                  e = 1;
+                                  break b;
+                                } else n = 1;
+                              D = (r + n) | 0;
+                              E = n;
+                            } else {
+                              q = c[T >> 2] | 0;
+                              if (!q) {
+                                n = x;
+                                C = 171;
+                                continue;
+                              }
+                              n = R4(T, r, 4) | 0;
+                              if ((n | 0) < 1)
+                                if ((n | 0) < 0) {
+                                  e = 1;
+                                  break b;
+                                } else n = 1;
+                              o = s;
+                              D = (r + n) | 0;
+                              E = n;
+                            }
+                            s = (o + e) | 0;
+                            if (!(c[u >> 2] | 0)) {
+                              e = E;
+                              n = x;
+                              C = 171;
+                              continue;
+                            }
+                            y = (s | 0) != 0;
+                            z = (q | 0) == 95;
+                            A = (s | 0) == 0;
+                            C = J & ((q | 0) == 10);
+                            B = ((s | 0) < 1) & I;
+                            t = 0;
+                            n = x;
+                            while (1) {
+                              f: do
+                                if ((c[w >> 2] | 0) >>> 0 <= q >>> 0) {
+                                  if ((c[(w + 4) >> 2] | 0) >>> 0 < q >>> 0) break;
+                                  r = (w + 20) | 0;
+                                  e = c[r >> 2] | 0;
+                                  do
+                                    if (e | 0) {
+                                      if (!((((e & 1) | 0) == 0) | B | C)) break f;
+                                      if (
+                                        (e & 2) | 0
+                                          ? ((x = c[T >> 2] | 0), !(((x | R | 0) == 0) | (J & ((x | 0) == 10))))
+                                          : 0
+                                      )
+                                        break f;
+                                      do
+                                        if ((e & 16) | 0) {
+                                          if (z) break f;
+                                          if (x3(q) | 0) break f;
+                                          e = c[T >> 2] | 0;
+                                          if ((e | 0) == 95) break;
+                                          if (!(x3(e) | 0)) break f;
+                                        }
+                                      while (0);
+                                      e = c[r >> 2] | 0;
+                                      if (e & 32) {
+                                        if (z) {
+                                          e = c[T >> 2] | 0;
+                                          if ((e | 0) == 95) break f;
+                                        } else {
+                                          x = (x3(q) | 0) == 0;
+                                          e = c[T >> 2] | 0;
+                                          if (x | ((e | 0) == 95)) break f;
+                                        }
+                                        if (x3(e) | 0) break f;
+                                        e = c[r >> 2] | 0;
+                                      }
+                                      o = c[T >> 2] | 0;
+                                      do
+                                        if (((o | 0) != 0) & (y & (((e & 64) | 0) != 0))) {
+                                          if (z) e = 1;
+                                          else {
+                                            e = (x3(q) | 0) != 0;
+                                            o = c[T >> 2] | 0;
+                                          }
+                                          if ((o | 0) == 95)
+                                            if (e) break f;
+                                            else break;
+                                          else if (e ^ ((x3(o) | 0) != 0)) break;
+                                          else break f;
+                                        }
+                                      while (0);
+                                      do
+                                        if ((c[r >> 2] & 128) | 0) {
+                                          e = c[T >> 2] | 0;
+                                          if (A | ((e | 0) == 0)) break f;
+                                          if (z) o = 1;
+                                          else {
+                                            o = (x3(q) | 0) != 0;
+                                            e = c[T >> 2] | 0;
+                                          }
+                                          if ((e | 0) == 95)
+                                            if (o) break;
+                                            else break f;
+                                          else if (o ^ ((x3(e) | 0) != 0)) break f;
+                                          else break;
+                                        }
+                                      while (0);
+                                      e = c[r >> 2] | 0;
+                                      do
+                                        if (e & 4) {
+                                          if ((c[S >> 2] & 2) | 0) break;
+                                          if (!(w3(q, c[(w + 24) >> 2] | 0) | 0)) break f;
+                                          e = c[r >> 2] | 0;
+                                        }
+                                      while (0);
+                                      do
+                                        if ((e & 4) | 0) {
+                                          if (!(c[S >> 2] & 2)) break;
+                                          x = E3(q) | 0;
+                                          e = (w + 24) | 0;
+                                          if (w3(x, c[e >> 2] | 0) | 0) break;
+                                          x = f3(q) | 0;
+                                          if (!(w3(x, c[e >> 2] | 0) | 0)) break f;
+                                        }
+                                      while (0);
+                                      if (!(c[r >> 2] & 8)) break;
+                                      if (v6(c[(w + 28) >> 2] | 0, q, c[S >> 2] & 2) | 0) break f;
+                                    }
+                                  while (0);
+                                  if (!t) {
+                                    t = c[u >> 2] | 0;
+                                    n = c[(w + 16) >> 2] | 0;
+                                    break;
+                                  }
+                                  o = (p + 28) | 0;
+                                  e = c[o >> 2] | 0;
+                                  if (!e) {
+                                    e = E5(U, 0, 0, 0, 32) | 0;
+                                    if (!e) {
+                                      C = 145;
+                                      break c;
+                                    }
+                                    c[(e + 24) >> 2] = p;
+                                    c[(e + 28) >> 2] = 0;
+                                    x = E5(U, 0, 0, 0, c[Q >> 2] << 2) | 0;
+                                    c[(e + 20) >> 2] = x;
+                                    if (!x) {
+                                      C = 152;
+                                      break c;
+                                    }
+                                    c[o >> 2] = e;
+                                    p = e;
+                                  } else p = e;
+                                  c[p >> 2] = s;
+                                  c[(p + 4) >> 2] = D;
+                                  c[(p + 8) >> 2] = c[u >> 2];
+                                  c[(p + 12) >> 2] = c[(w + 12) >> 2];
+                                  c[(p + 16) >> 2] = c[T >> 2];
+                                  if ((c[Q >> 2] | 0) > 0) {
+                                    o = c[(p + 20) >> 2] | 0;
+                                    e = 0;
+                                    do {
+                                      c[(o + (e << 2)) >> 2] = c[(j + (e << 2)) >> 2];
+                                      e = (e + 1) | 0;
+                                    } while ((e | 0) < (c[Q >> 2] | 0));
+                                  }
+                                  e = c[(w + 16) >> 2] | 0;
+                                  if (!e) break;
+                                  o = c[e >> 2] | 0;
+                                  if ((o | 0) <= -1) break;
+                                  r = c[(p + 20) >> 2] | 0;
+                                  do {
+                                    c[(r + (o << 2)) >> 2] = s;
+                                    e = (e + 4) | 0;
+                                    o = c[e >> 2] | 0;
+                                  } while ((o | 0) > -1);
+                                }
+                              while (0);
+                              u = (w + 40) | 0;
+                              if (!(c[u >> 2] | 0)) break;
+                              else w = (w + 32) | 0;
+                            }
+                            if (!t) {
+                              e = E;
+                              C = 171;
+                              continue;
+                            }
+                            if (n) {
+                              e = c[n >> 2] | 0;
+                              if ((e | 0) > -1) {
+                                do {
+                                  n = (n + 4) | 0;
+                                  c[(j + (e << 2)) >> 2] = s;
+                                  e = c[n >> 2] | 0;
+                                } while ((e | 0) > -1);
+                                q = v;
+                                o = D;
+                                e = E;
+                              } else {
+                                q = v;
+                                o = D;
+                                e = E;
+                              }
+                            } else {
+                              q = v;
+                              o = D;
+                              e = E;
+                              n = 0;
+                            }
+                          } else if ((C | 0) == 171) {
+                            C = 0;
+                            r = c[(p + 24) >> 2] | 0;
+                            if (!r) break;
+                            t = c[(p + 8) >> 2] | 0;
+                            if ((c[(t + 20) >> 2] & 256) | 0) c[(k + (c[(p + 12) >> 2] << 2)) >> 2] = 0;
+                            s = c[p >> 2] | 0;
+                            u = c[(p + 4) >> 2] | 0;
+                            c[T >> 2] = c[(p + 16) >> 2];
+                            q = c[Q >> 2] | 0;
+                            if ((q | 0) > 0) {
+                              p = c[(p + 20) >> 2] | 0;
+                              o = 0;
+                              do {
+                                c[(j + (o << 2)) >> 2] = c[(p + (o << 2)) >> 2];
+                                o = (o + 1) | 0;
+                              } while ((o | 0) < (q | 0));
+                              p = r;
+                              q = v;
+                              o = u;
+                            } else {
+                              p = r;
+                              q = v;
+                              o = u;
+                            }
+                          }
+                          r = o;
+                          v = q;
+                          w = t;
+                          x = n;
+                          C = 79;
+                        }
+                        n = (v | 0) > -1;
+                        if (n | ((c[T >> 2] | 0) == 0)) {
+                          C = 180;
+                          break;
+                        }
+                        c[T >> 2] = H;
+                        s = F;
+                        r = G;
+                        n = c[Q >> 2] | 0;
+                        B = H;
+                      }
+                      if ((C | 0) == 53) {
+                        D5(U);
+                        if (j | 0) U1(i);
+                        if (m | 0) U1(h);
+                        if (!k) {
+                          e = 12;
+                          break a;
+                        }
+                        U1(g);
+                        e = 12;
+                        break a;
+                      } else if ((C | 0) == 60) {
+                        D5(U);
+                        if (j | 0) U1(i);
+                        if (m | 0) U1(h);
+                        if (!k) {
+                          e = 12;
+                          break a;
+                        }
+                        U1(g);
+                        e = 12;
+                        break a;
+                      } else if ((C | 0) == 145) {
+                        D5(U);
+                        if (j | 0) U1(i);
+                        if (m | 0) U1(h);
+                        if (!k) {
+                          e = 12;
+                          break a;
+                        }
+                        U1(g);
+                        e = 12;
+                        break a;
+                      } else if ((C | 0) == 152) {
+                        D5(U);
+                        if (j | 0) U1(i);
+                        if (m | 0) U1(h);
+                        if (!k) {
+                          e = 12;
+                          break a;
+                        }
+                        U1(g);
+                        e = 12;
+                        break a;
+                      } else if ((C | 0) == 180) {
+                        c[f >> 2] = v;
+                        e = (n ^ 1) & 1;
+                        break;
+                      }
+                    }
+                  while (0);
+                  D5(U);
+                  if (j | 0) U1(i);
+                  if (m | 0) U1(h);
+                  if (k) U1(g);
+                } else e = 12;
+              while (0);
+              l = V;
+              return e | 0;
+            }
+            function t6(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0,
+                q = 0,
+                r = 0,
+                s = 0,
+                t = 0,
+                u = 0,
+                v = 0,
+                w = 0,
+                x = 0,
+                y = 0,
+                z = 0,
+                A = 0,
+                B = 0,
+                C = 0,
+                D = 0,
+                E = 0,
+                F = 0,
+                G = 0,
+                H = 0,
+                I = 0,
+                J = 0,
+                K = 0,
+                L = 0,
+                M = 0,
+                N = 0,
+                P = 0,
+                Q = 0,
+                R = 0,
+                S = 0,
+                T = 0,
+                U = 0,
+                V = 0,
+                W = 0;
+              W = l;
+              l = (l + 16) | 0;
+              T = W;
+              c[T >> 2] = 0;
+              k = e & 1;
+              Q = e & 2;
+              R = (a + 56) | 0;
+              j = c[R >> 2] & 4;
+              if (!d) N = 0;
+              else N = c[(a + 40) >> 2] | 0;
+              P = N << 2;
+              i = c[(a + 52) >> 2] | 0;
+              h = i << 3;
+              g = (h + 8) | 0;
+              e = (P + 12 + h + ((g + (O(P, i) | 0)) << 1)) | 0;
+              U = T1(e) | 0;
+              if (!U) e = 12;
+              else {
+                Y6(U | 0, 0, e | 0) | 0;
+                e = (U + P) | 0;
+                m = e & 3;
+                m = (e + ((m | 0) == 0 ? 0 : (4 - m) | 0)) | 0;
+                e = (m + g) | 0;
+                n = e & 3;
+                n = (e + ((n | 0) == 0 ? 0 : (4 - n) | 0)) | 0;
+                e = (n + g) | 0;
+                M = e & 3;
+                M = (e + ((M | 0) == 0 ? 0 : (4 - M) | 0)) | 0;
+                e = (M + h) | 0;
+                g = e & 3;
+                h = (i | 0) > 0;
+                if (h) {
+                  e = (e + ((g | 0) == 0 ? 0 : (4 - g) | 0)) | 0;
+                  g = 0;
+                  while (1) {
+                    c[(n + (g << 3) + 4) >> 2] = e;
+                    e = (e + P) | 0;
+                    c[(m + (g << 3) + 4) >> 2] = e;
+                    g = (g + 1) | 0;
+                    if ((g | 0) >= (i | 0)) break;
+                    else e = (e + P) | 0;
+                  }
+                  if (h) {
+                    e = 0;
+                    do {
+                      c[(M + (e << 3)) >> 2] = -1;
+                      e = (e + 1) | 0;
+                    } while ((e | 0) < (i | 0));
+                  }
+                }
+                e = R4(T, b, 4) | 0;
+                if ((e | 0) < 1)
+                  if ((e | 0) < 0) e = 1;
+                  else {
+                    i = 1;
+                    V = 11;
+                  }
+                else {
+                  i = e;
+                  V = 11;
+                }
+                a: do
+                  if ((V | 0) == 11) {
+                    L = (a + 8) | 0;
+                    K = (j | 0) != 0;
+                    E = (k | 0) == 0;
+                    F = (N | 0) > 0;
+                    G = (a + 12) | 0;
+                    H = (N | 0) < 1;
+                    I = (a + 44) | 0;
+                    J = (a + 32) | 0;
+                    C = (a + 36) | 0;
+                    D = (N | 0) == 0;
+                    h = 0;
+                    v = (b + i) | 0;
+                    u = 0;
+                    j = 0;
+                    e = -1;
+                    g = m;
+                    A = U;
+                    x = m;
+                    w = n;
+                    while (1) {
+                      if ((e | 0) < 0) {
+                        a = c[L >> 2] | 0;
+                        k = (a + 8) | 0;
+                        b: do
+                          if (c[k >> 2] | 0) {
+                            p = (u | 0) != 0;
+                            q = (h | 0) == 95;
+                            r = (u | 0) == 0;
+                            t = K & ((h | 0) == 10);
+                            s = ((u | 0) < 1) & E;
+                            while (1) {
+                              c: while (1) {
+                                o = (a + 12) | 0;
+                                if ((c[(M + (c[o >> 2] << 3)) >> 2] | 0) >= (u | 0)) break;
+                                n = (a + 20) | 0;
+                                b = c[n >> 2] | 0;
+                                if (!b) {
+                                  V = 46;
+                                  break;
+                                }
+                                d: do
+                                  if ((((b & 1) | 0) == 0) | s | t) {
+                                    if (
+                                      (b & 2) | 0
+                                        ? ((B = c[T >> 2] | 0), !(((B | Q | 0) == 0) | (K & ((B | 0) == 10))))
+                                        : 0
+                                    )
+                                      break;
+                                    do
+                                      if ((b & 16) | 0) {
+                                        if (q) break d;
+                                        if (x3(h) | 0) break d;
+                                        b = c[T >> 2] | 0;
+                                        if ((b | 0) == 95) break;
+                                        if (!(x3(b) | 0)) break d;
+                                      }
+                                    while (0);
+                                    b = c[n >> 2] | 0;
+                                    if (b & 32) {
+                                      if (q) {
+                                        b = c[T >> 2] | 0;
+                                        if ((b | 0) == 95) break;
+                                      } else {
+                                        B = (x3(h) | 0) == 0;
+                                        b = c[T >> 2] | 0;
+                                        if (B | ((b | 0) == 95)) break;
+                                      }
+                                      if (x3(b) | 0) break;
+                                      b = c[n >> 2] | 0;
+                                    }
+                                    m = c[T >> 2] | 0;
+                                    do
+                                      if (((m | 0) != 0) & (p & (((b & 64) | 0) != 0))) {
+                                        if (q) b = 1;
+                                        else {
+                                          b = (x3(h) | 0) != 0;
+                                          m = c[T >> 2] | 0;
+                                        }
+                                        if ((m | 0) == 95)
+                                          if (b) break d;
+                                          else break;
+                                        else if (b ^ ((x3(m) | 0) != 0)) break;
+                                        else break d;
+                                      }
+                                    while (0);
+                                    if (!(c[n >> 2] & 128)) {
+                                      V = 46;
+                                      break c;
+                                    }
+                                    b = c[T >> 2] | 0;
+                                    if (r | ((b | 0) == 0)) break;
+                                    if (q) m = 1;
+                                    else {
+                                      m = (x3(h) | 0) != 0;
+                                      b = c[T >> 2] | 0;
+                                    }
+                                    if ((b | 0) == 95)
+                                      if (m) {
+                                        V = 46;
+                                        break c;
+                                      } else break;
+                                    else if (m ^ ((x3(b) | 0) != 0)) break;
+                                    else {
+                                      V = 46;
+                                      break c;
+                                    }
+                                  }
+                                while (0);
+                                k = (a + 40) | 0;
+                                if (!(c[k >> 2] | 0)) break b;
+                                else a = (a + 32) | 0;
+                              }
+                              if ((V | 0) == 46) {
+                                V = 0;
+                                c[g >> 2] = c[k >> 2];
+                                if (F) Y6(c[(g + 4) >> 2] | 0, -1, P | 0) | 0;
+                                k = c[(a + 16) >> 2] | 0;
+                                if (k | 0 ? ((S = c[k >> 2] | 0), (S | 0) > -1) : 0) {
+                                  m = (g + 4) | 0;
+                                  b = S;
+                                  do {
+                                    if ((b | 0) < (N | 0)) c[((c[m >> 2] | 0) + (b << 2)) >> 2] = u;
+                                    k = (k + 4) | 0;
+                                    b = c[k >> 2] | 0;
+                                  } while ((b | 0) > -1);
+                                }
+                                k = (c[g >> 2] | 0) != (c[G >> 2] | 0);
+                                if (k | H) {
+                                  j = k ? j : 1;
+                                  e = k ? e : u;
+                                  k = (g + 4) | 0;
+                                } else {
+                                  k = (g + 4) | 0;
+                                  j = c[k >> 2] | 0;
+                                  e = 0;
+                                  do {
+                                    c[(d + (e << 2)) >> 2] = c[(j + (e << 2)) >> 2];
+                                    e = (e + 1) | 0;
+                                  } while ((e | 0) != (N | 0));
+                                  j = 1;
+                                  e = u;
+                                }
+                                B = c[o >> 2] | 0;
+                                c[(M + (B << 3)) >> 2] = u;
+                                c[(M + (B << 3) + 4) >> 2] = k;
+                                g = (g + 8) | 0;
+                              }
+                              k = (a + 40) | 0;
+                              if (!(c[k >> 2] | 0)) break;
+                              else a = (a + 32) | 0;
+                            }
+                          }
+                        while (0);
+                        c[g >> 2] = 0;
+                        g = c[T >> 2] | 0;
+                        if (!g) break;
+                        else h = g;
+                      } else {
+                        if (D) break;
+                        h = c[T >> 2] | 0;
+                        if (!(((g | 0) != (x | 0)) & ((h | 0) != 0))) break;
+                      }
+                      B = (u + i) | 0;
+                      g = R4(T, v, 4) | 0;
+                      if ((g | 0) < 1)
+                        if ((g | 0) < 0) {
+                          e = 1;
+                          break a;
+                        } else i = 1;
+                      else i = g;
+                      z = (v + i) | 0;
+                      if (((j | 0) != 0) & ((c[I >> 2] | 0) != 0)) {
+                        if (!(c[x >> 2] | 0)) g = w;
+                        else {
+                          o = c[C >> 2] | 0;
+                          p = c[o >> 2] | 0;
+                          q = (p | 0) > -1;
+                          n = x;
+                          g = w;
+                          do {
+                            m = (n + 4) | 0;
+                            e: do
+                              if (q) {
+                                k = 0;
+                                b = p;
+                                do {
+                                  a = c[(o + ((k | 1) << 2)) >> 2] | 0;
+                                  if ((b | 0) >= (N | 0)) break e;
+                                  j = c[m >> 2] | 0;
+                                  if (
+                                    (c[(j + (a << 2)) >> 2] | 0) == (c[(d + (a << 2)) >> 2] | 0)
+                                      ? (c[(j + (b << 2)) >> 2] | 0) < (c[(d + (b << 2)) >> 2] | 0)
+                                      : 0
+                                  )
+                                    break e;
+                                  k = (k + 2) | 0;
+                                  b = c[(o + (k << 2)) >> 2] | 0;
+                                } while ((b | 0) > -1);
+                                k = m;
+                                V = 75;
+                              } else {
+                                k = m;
+                                j = c[m >> 2] | 0;
+                                V = 75;
+                              }
+                            while (0);
+                            if ((V | 0) == 75) {
+                              V = 0;
+                              c[g >> 2] = c[n >> 2];
+                              v = (g + 4) | 0;
+                              y = c[v >> 2] | 0;
+                              c[v >> 2] = j;
+                              c[k >> 2] = y;
+                              g = (g + 8) | 0;
+                            }
+                            n = (n + 8) | 0;
+                          } while ((c[n >> 2] | 0) != 0);
+                        }
+                        c[g >> 2] = 0;
+                        y = x;
+                        j = 0;
+                      } else {
+                        y = w;
+                        w = x;
+                      }
+                      k = c[w >> 2] | 0;
+                      if (!k) {
+                        k = A;
+                        g = y;
+                      } else {
+                        r = (B | 0) != 0;
+                        s = (h | 0) == 95;
+                        t = (B | 0) == 0;
+                        v = K & ((h | 0) == 10);
+                        u = ((B | 0) < 1) & E;
+                        q = w;
+                        a = A;
+                        g = y;
+                        while (1) {
+                          b = (k + 8) | 0;
+                          if (c[b >> 2] | 0) {
+                            p = (q + 4) | 0;
+                            o = a;
+                            n = b;
+                            while (1) {
+                              f: do
+                                if ((c[k >> 2] | 0) >>> 0 <= h >>> 0 ? (c[(k + 4) >> 2] | 0) >>> 0 >= h >>> 0 : 0) {
+                                  m = (k + 20) | 0;
+                                  a = c[m >> 2] | 0;
+                                  do
+                                    if (a | 0) {
+                                      if (!((((a & 1) | 0) == 0) | u | v)) {
+                                        a = o;
+                                        break f;
+                                      }
+                                      if (
+                                        (a & 2) | 0
+                                          ? ((A = c[T >> 2] | 0), !(((A | Q | 0) == 0) | (K & ((A | 0) == 10))))
+                                          : 0
+                                      ) {
+                                        a = o;
+                                        break f;
+                                      }
+                                      do
+                                        if ((a & 16) | 0) {
+                                          if (s) {
+                                            a = o;
+                                            break f;
+                                          }
+                                          if (x3(h) | 0) {
+                                            a = o;
+                                            break f;
+                                          }
+                                          a = c[T >> 2] | 0;
+                                          if ((a | 0) == 95) break;
+                                          if (!(x3(a) | 0)) {
+                                            a = o;
+                                            break f;
+                                          }
+                                        }
+                                      while (0);
+                                      a = c[m >> 2] | 0;
+                                      if (a & 32) {
+                                        if (s) {
+                                          a = c[T >> 2] | 0;
+                                          if ((a | 0) == 95) {
+                                            a = o;
+                                            break f;
+                                          }
+                                        } else {
+                                          A = (x3(h) | 0) == 0;
+                                          a = c[T >> 2] | 0;
+                                          if (A | ((a | 0) == 95)) {
+                                            a = o;
+                                            break f;
+                                          }
+                                        }
+                                        if (x3(a) | 0) {
+                                          a = o;
+                                          break f;
+                                        }
+                                        a = c[m >> 2] | 0;
+                                      }
+                                      b = c[T >> 2] | 0;
+                                      do
+                                        if (((b | 0) != 0) & (r & (((a & 64) | 0) != 0))) {
+                                          if (s) a = 1;
+                                          else {
+                                            a = (x3(h) | 0) != 0;
+                                            b = c[T >> 2] | 0;
+                                          }
+                                          if ((b | 0) == 95)
+                                            if (a) {
+                                              a = o;
+                                              break f;
+                                            } else break;
+                                          else if (a ^ ((x3(b) | 0) != 0)) break;
+                                          else {
+                                            a = o;
+                                            break f;
+                                          }
+                                        }
+                                      while (0);
+                                      do
+                                        if ((c[m >> 2] & 128) | 0) {
+                                          a = c[T >> 2] | 0;
+                                          if (t | ((a | 0) == 0)) {
+                                            a = o;
+                                            break f;
+                                          }
+                                          if (s) b = 1;
+                                          else {
+                                            b = (x3(h) | 0) != 0;
+                                            a = c[T >> 2] | 0;
+                                          }
+                                          if ((a | 0) == 95)
+                                            if (b) break;
+                                            else {
+                                              a = o;
+                                              break f;
+                                            }
+                                          else if (b ^ ((x3(a) | 0) != 0)) {
+                                            a = o;
+                                            break f;
+                                          } else break;
+                                        }
+                                      while (0);
+                                      a = c[m >> 2] | 0;
+                                      do
+                                        if (a & 4) {
+                                          if ((c[R >> 2] & 2) | 0) break;
+                                          if (!(w3(h, c[(k + 24) >> 2] | 0) | 0)) {
+                                            a = o;
+                                            break f;
+                                          }
+                                          a = c[m >> 2] | 0;
+                                        }
+                                      while (0);
+                                      do
+                                        if ((a & 4) | 0) {
+                                          if (!(c[R >> 2] & 2)) break;
+                                          A = E3(h) | 0;
+                                          a = (k + 24) | 0;
+                                          if (w3(A, c[a >> 2] | 0) | 0) break;
+                                          A = f3(h) | 0;
+                                          if (!(w3(A, c[a >> 2] | 0) | 0)) {
+                                            a = o;
+                                            break f;
+                                          }
+                                        }
+                                      while (0);
+                                      if (!(c[m >> 2] & 8)) break;
+                                      if (v6(c[(k + 28) >> 2] | 0, h, c[R >> 2] & 2) | 0) {
+                                        a = o;
+                                        break f;
+                                      }
+                                    }
+                                  while (0);
+                                  if (F) {
+                                    b = c[p >> 2] | 0;
+                                    a = 0;
+                                    do {
+                                      c[(o + (a << 2)) >> 2] = c[(b + (a << 2)) >> 2];
+                                      a = (a + 1) | 0;
+                                    } while ((a | 0) != (N | 0));
+                                  }
+                                  a = c[(k + 16) >> 2] | 0;
+                                  do
+                                    if (a | 0) {
+                                      b = c[a >> 2] | 0;
+                                      if ((b | 0) <= -1) break;
+                                      do {
+                                        if ((b | 0) < (N | 0)) c[(o + (b << 2)) >> 2] = B;
+                                        a = (a + 4) | 0;
+                                        b = c[a >> 2] | 0;
+                                      } while ((b | 0) > -1);
+                                    }
+                                  while (0);
+                                  a = c[(k + 12) >> 2] | 0;
+                                  b = (M + (a << 3)) | 0;
+                                  if ((c[b >> 2] | 0) >= (B | 0)) {
+                                    a = c[(M + (a << 3) + 4) >> 2] | 0;
+                                    b = c[a >> 2] | 0;
+                                    if (!(w6(N, c[J >> 2] | 0, o, b) | 0)) {
+                                      a = o;
+                                      break;
+                                    }
+                                    c[a >> 2] = o;
+                                    if ((c[n >> 2] | 0) != (c[G >> 2] | 0)) {
+                                      a = b;
+                                      break;
+                                    }
+                                    if (F) e = 0;
+                                    else {
+                                      j = 1;
+                                      a = b;
+                                      e = B;
+                                      break;
+                                    }
+                                    while (1) {
+                                      c[(d + (e << 2)) >> 2] = c[(o + (e << 2)) >> 2];
+                                      e = (e + 1) | 0;
+                                      if ((e | 0) == (N | 0)) {
+                                        j = 1;
+                                        a = b;
+                                        e = B;
+                                        break f;
+                                      }
+                                    }
+                                  }
+                                  A = c[n >> 2] | 0;
+                                  c[g >> 2] = A;
+                                  x = (g + 4) | 0;
+                                  m = c[x >> 2] | 0;
+                                  c[x >> 2] = o;
+                                  c[b >> 2] = B;
+                                  c[(M + (a << 3) + 4) >> 2] = x;
+                                  do
+                                    if ((c[G >> 2] | 0) == (A | 0)) {
+                                      if ((e | 0) == -1)
+                                        if (F) e = 0;
+                                        else {
+                                          e = B;
+                                          j = 1;
+                                          break;
+                                        }
+                                      else {
+                                        if (!F) break;
+                                        if ((c[o >> 2] | 0) > (c[d >> 2] | 0)) break;
+                                        else e = 0;
+                                      }
+                                      do {
+                                        c[(d + (e << 2)) >> 2] = c[(o + (e << 2)) >> 2];
+                                        e = (e + 1) | 0;
+                                      } while ((e | 0) < (N | 0));
+                                      e = B;
+                                      j = 1;
+                                    }
+                                  while (0);
+                                  a = m;
+                                  g = (g + 8) | 0;
+                                } else a = o;
+                              while (0);
+                              n = (k + 40) | 0;
+                              if (!(c[n >> 2] | 0)) break;
+                              else {
+                                k = (k + 32) | 0;
+                                o = a;
+                              }
+                            }
+                          }
+                          q = (q + 8) | 0;
+                          k = c[q >> 2] | 0;
+                          if (!k) {
+                            k = a;
+                            break;
+                          }
+                        }
+                      }
+                      c[g >> 2] = 0;
+                      v = z;
+                      u = B;
+                      A = k;
+                      x = y;
+                    }
+                    c[f >> 2] = e;
+                    e = e >>> 31;
+                  }
+                while (0);
+                U1(U);
+              }
+              l = W;
+              return e | 0;
+            }
+            function u6(a, b, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              var h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0;
+              if (
+                (((d & 8) | 0) == 0) & ((g | 0) > -1)
+                  ? ((m = c[(e + 16) >> 2] | 0), (n = c[(e + 28) >> 2] | 0), (l = ((a | 0) != 0) & ((n | 0) != 0)), l)
+                  : 0
+              ) {
+                k = c[(e + 48) >> 2] | 0;
+                j = 0;
+                do {
+                  d = c[(m + ((j * 12) | 0)) >> 2] | 0;
+                  if ((d | 0) == (k | 0)) i = g;
+                  else i = c[(f + (d << 2)) >> 2] | 0;
+                  h = (b + (j << 3)) | 0;
+                  c[h >> 2] = i;
+                  d = c[(m + ((j * 12) | 0) + 4) >> 2] | 0;
+                  if ((d | 0) == (k | 0)) d = g;
+                  else d = c[(f + (d << 2)) >> 2] | 0;
+                  e = (b + (j << 3) + 4) | 0;
+                  c[e >> 2] = d;
+                  if (((d | 0) == -1) | ((i | 0) == -1)) {
+                    c[e >> 2] = -1;
+                    c[h >> 2] = -1;
+                  }
+                  j = (j + 1) | 0;
+                } while ((j >>> 0 < a >>> 0) & (j >>> 0 < n >>> 0));
+                if (l) {
+                  d = 0;
+                  do {
+                    i = (b + (d << 3) + 4) | 0;
+                    j = c[(m + ((d * 12) | 0) + 8) >> 2] | 0;
+                    if (j | 0 ? ((o = c[j >> 2] | 0), (o | 0) > -1) : 0) {
+                      k = (b + (d << 3)) | 0;
+                      h = 0;
+                      f = o;
+                      e = c[k >> 2] | 0;
+                      do {
+                        if (
+                          !((e | 0) >= (c[(b + (f << 3)) >> 2] | 0)
+                            ? (c[i >> 2] | 0) <= (c[(b + (f << 3) + 4) >> 2] | 0)
+                            : 0)
+                        ) {
+                          c[i >> 2] = -1;
+                          c[k >> 2] = -1;
+                          e = -1;
+                        }
+                        h = (h + 1) | 0;
+                        f = c[(j + (h << 2)) >> 2] | 0;
+                      } while ((f | 0) > -1);
+                    }
+                    d = (d + 1) | 0;
+                  } while ((d >>> 0 < a >>> 0) & (d >>> 0 < n >>> 0));
+                } else d = 0;
+              } else d = 0;
+              if (d >>> 0 < a >>> 0) Y6((b + (d << 3)) | 0, -1, ((a - d) << 3) | 0) | 0;
+              return;
+            }
+            function v6(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = c[a >> 2] | 0;
+              a: do
+                if (!e) d = 0;
+                else {
+                  f = (d | 0) == 0;
+                  d = e;
+                  while (1) {
+                    if (f) {
+                      if (w3(b, d) | 0) {
+                        d = 1;
+                        break a;
+                      }
+                    } else {
+                      e = f3(b) | 0;
+                      if (w3(e, c[a >> 2] | 0) | 0) {
+                        d = 1;
+                        break a;
+                      }
+                      e = E3(b) | 0;
+                      if (w3(e, c[a >> 2] | 0) | 0) {
+                        d = 1;
+                        break a;
+                      }
+                    }
+                    a = (a + 4) | 0;
+                    d = c[a >> 2] | 0;
+                    if (!d) {
+                      d = 0;
+                      break;
+                    }
+                  }
+                }
+              while (0);
+              return d | 0;
+            }
+            function w6(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              a: do
+                if ((a | 0) > 0) {
+                  f = 0;
+                  while (1) {
+                    h = c[(d + (f << 2)) >> 2] | 0;
+                    g = c[(e + (f << 2)) >> 2] | 0;
+                    if (!(c[(b + (f << 2)) >> 2] | 0)) {
+                      if ((h | 0) < (g | 0)) {
+                        f = 1;
+                        break a;
+                      }
+                      if ((h | 0) > (g | 0)) {
+                        f = 0;
+                        break a;
+                      }
+                    } else {
+                      if ((h | 0) > (g | 0)) {
+                        f = 1;
+                        break a;
+                      }
+                      if ((h | 0) < (g | 0)) {
+                        f = 0;
+                        break a;
+                      }
+                    }
+                    f = (f + 1) | 0;
+                    if ((f | 0) >= (a | 0)) {
+                      f = 0;
+                      break;
+                    }
+                  }
+                } else f = 0;
+              while (0);
+              return f | 0;
+            }
+            function x6(b, d, e, f) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0;
+              k = O(e, d) | 0;
+              e = (d | 0) == 0 ? 0 : e;
+              if ((c[(f + 76) >> 2] | 0) > -1) j = J3(f) | 0;
+              else j = 0;
+              g = (f + 74) | 0;
+              h = a[g >> 0] | 0;
+              a[g >> 0] = (h + 255) | h;
+              g = (f + 4) | 0;
+              h = c[g >> 2] | 0;
+              m = ((c[(f + 8) >> 2] | 0) - h) | 0;
+              i = m >>> 0 < k >>> 0 ? m : k;
+              if ((m | 0) > 0) {
+                W6(b | 0, h | 0, i | 0) | 0;
+                c[g >> 2] = h + i;
+                g = (k - i) | 0;
+                b = (b + i) | 0;
+              } else g = k;
+              a: do
+                if (!g) l = 13;
+                else {
+                  i = (f + 32) | 0;
+                  while (1) {
+                    if (_2(f) | 0) break;
+                    h = nb[c[i >> 2] & 63](f, b, g) | 0;
+                    if (((h + 1) | 0) >>> 0 < 2) break;
+                    g = (g - h) | 0;
+                    if (!g) {
+                      l = 13;
+                      break a;
+                    } else b = (b + h) | 0;
+                  }
+                  if (j | 0) K3(f);
+                  e = ((((k - g) | 0) >>> 0) / (d >>> 0)) | 0;
+                }
+              while (0);
+              if ((l | 0) == 13) if (j) K3(f);
+              return e | 0;
+            }
+            function y6(a) {
+              a = a | 0;
+              var b = 0;
+              if ((c[(a + 76) >> 2] | 0) > -1) {
+                b = (J3(a) | 0) == 0;
+                a = z6(a) | 0;
+              } else a = z6(a) | 0;
+              return a | 0;
+            }
+            function z6(a) {
+              a = a | 0;
+              var b = 0;
+              if (!(c[a >> 2] & 128)) b = 1;
+              else b = (c[(a + 20) >> 2] | 0) >>> 0 > (c[(a + 28) >> 2] | 0) >>> 0 ? 2 : 1;
+              b = nb[c[(a + 40) >> 2] & 63](a, 0, b) | 0;
+              if ((b | 0) >= 0)
+                b =
+                  (b -
+                    (c[(a + 8) >> 2] | 0) +
+                    (c[(a + 4) >> 2] | 0) +
+                    (c[(a + 20) >> 2] | 0) -
+                    (c[(a + 28) >> 2] | 0)) |
+                  0;
+              return b | 0;
+            }
+            function A6(a) {
+              a = a | 0;
+              (c[(a + 76) >> 2] | 0) > -1 ? J3(a) | 0 : 0;
+              return c[(a + 60) >> 2] | 0;
+            }
+            function B6(b) {
+              b = b | 0;
+              var d = 0,
+                e = 0,
+                f = 0,
+                g = 0;
+              f = c[15679] | 0;
+              if ((c[(f + 76) >> 2] | 0) > -1) g = J3(f) | 0;
+              else g = 0;
+              do
+                if ((T4(b, f) | 0) < 0) b = -1;
+                else {
+                  if (
+                    (a[(f + 75) >> 0] | 0) != 10
+                      ? ((d = (f + 20) | 0), (e = c[d >> 2] | 0), e >>> 0 < (c[(f + 16) >> 2] | 0) >>> 0)
+                      : 0
+                  ) {
+                    c[d >> 2] = e + 1;
+                    a[e >> 0] = 10;
+                    b = 0;
+                    break;
+                  }
+                  b = (V4(f, 10) | 0) >> 31;
+                }
+              while (0);
+              if (g | 0) K3(f);
+              return b | 0;
+            }
+            function C6() {
+              var b = 0,
+                d = 0,
+                e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              k = l;
+              l = (l + 48) | 0;
+              i = (k + 24) | 0;
+              h = (k + 16) | 0;
+              g = k;
+              d = (k + 28) | 0;
+              b = d;
+              e = 153686;
+              f = (b + 20) | 0;
+              do {
+                a[b >> 0] = a[e >> 0] | 0;
+                b = (b + 1) | 0;
+                e = (e + 1) | 0;
+              } while ((b | 0) < (f | 0));
+              e = (d + 13) | 0;
+              b = 0;
+              while (1) {
+                x4(e) | 0;
+                c[g >> 2] = d;
+                c[(g + 4) >> 2] = 32962;
+                c[(g + 8) >> 2] = 384;
+                f = c2(Ha(5, g | 0) | 0) | 0;
+                if ((f | 0) > -1) {
+                  j = 4;
+                  break;
+                }
+                if ((b | 0) < 99) b = (b + 1) | 0;
+                else {
+                  b = 0;
+                  break;
+                }
+              }
+              if ((j | 0) == 4) {
+                c[h >> 2] = d;
+                wa(10, h | 0) | 0;
+                b = P4(f, 153706) | 0;
+                if (!b) {
+                  c[i >> 2] = f;
+                  Ja(6, i | 0) | 0;
+                  b = 0;
+                }
+              }
+              l = k;
+              return b | 0;
+            }
+            function D6(a) {
+              a = a | 0;
+              var b = 0,
+                e = 0,
+                f = 0;
+              if ((c[(a + 76) >> 2] | 0) >= 0 ? (J3(a) | 0) != 0 : 0) {
+                b = (a + 4) | 0;
+                e = c[b >> 2] | 0;
+                if (e >>> 0 < (c[(a + 8) >> 2] | 0) >>> 0) {
+                  c[b >> 2] = e + 1;
+                  b = d[e >> 0] | 0;
+                } else b = Z2(a) | 0;
+              } else f = 3;
+              do
+                if ((f | 0) == 3) {
+                  b = (a + 4) | 0;
+                  e = c[b >> 2] | 0;
+                  if (e >>> 0 < (c[(a + 8) >> 2] | 0) >>> 0) {
+                    c[b >> 2] = e + 1;
+                    b = d[e >> 0] | 0;
+                    break;
+                  } else {
+                    b = Z2(a) | 0;
+                    break;
+                  }
+                }
+              while (0);
+              return b | 0;
+            }
+            function E6(b, d) {
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0,
+                g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0;
+              if ((c[(d + 76) >> 2] | 0) >= 0 ? (J3(d) | 0) != 0 : 0) {
+                f = b & 255;
+                e = b & 255;
+                if (
+                  (e | 0) != (a[(d + 75) >> 0] | 0)
+                    ? ((i = (d + 20) | 0), (j = c[i >> 2] | 0), j >>> 0 < (c[(d + 16) >> 2] | 0) >>> 0)
+                    : 0
+                ) {
+                  c[i >> 2] = j + 1;
+                  a[j >> 0] = f;
+                } else e = V4(d, b) | 0;
+                K3(d);
+              } else k = 3;
+              do
+                if ((k | 0) == 3) {
+                  f = b & 255;
+                  e = b & 255;
+                  if (
+                    (e | 0) != (a[(d + 75) >> 0] | 0)
+                      ? ((g = (d + 20) | 0), (h = c[g >> 2] | 0), h >>> 0 < (c[(d + 16) >> 2] | 0) >>> 0)
+                      : 0
+                  ) {
+                    c[g >> 2] = h + 1;
+                    a[h >> 0] = f;
+                    break;
+                  }
+                  e = V4(d, b) | 0;
+                }
+              while (0);
+              return e | 0;
+            }
+            function F6(a) {
+              a = a | 0;
+              return y6(a) | 0;
+            }
+            function G6() {}
+            function H6(a, b) {
+              a = a | 0;
+              b = b | 0;
+              var c = 0,
+                d = 0,
+                e = 0,
+                f = 0;
+              f = a & 65535;
+              e = b & 65535;
+              c = O(e, f) | 0;
+              d = a >>> 16;
+              a = ((c >>> 16) + (O(e, d) | 0)) | 0;
+              e = b >>> 16;
+              b = O(e, f) | 0;
+              return (
+                ((z = ((a >>> 16) + (O(e, d) | 0) + ((((a & 65535) + b) | 0) >>> 16)) | 0),
+                ((a + b) << 16) | (c & 65535) | 0) | 0
+              );
+            }
+            function I6(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              e = a;
+              f = c;
+              c = H6(e, f) | 0;
+              a = z;
+              return ((z = ((O(b, f) | 0) + (O(d, e) | 0) + a) | (a & 0)), c | 0 | 0) | 0;
+            }
+            function J6(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              c = (a + c) >>> 0;
+              return ((z = (b + d + ((c >>> 0 < a >>> 0) | 0)) >>> 0), c | 0) | 0;
+            }
+            function K6(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              d = (b - d - ((c >>> 0 > a >>> 0) | 0)) >>> 0;
+              return ((z = d), ((a - c) >>> 0) | 0) | 0;
+            }
+            function L6(b) {
+              b = b | 0;
+              var c = 0;
+              c = a[(n + (b & 255)) >> 0] | 0;
+              if ((c | 0) < 8) return c | 0;
+              c = a[(n + ((b >> 8) & 255)) >> 0] | 0;
+              if ((c | 0) < 8) return (c + 8) | 0;
+              c = a[(n + ((b >> 16) & 255)) >> 0] | 0;
+              if ((c | 0) < 8) return (c + 16) | 0;
+              return ((a[(n + (b >>> 24)) >> 0] | 0) + 24) | 0;
+            }
+            function M6(a, b, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              var g = 0,
+                h = 0,
+                i = 0,
+                j = 0,
+                k = 0,
+                l = 0,
+                m = 0,
+                n = 0,
+                o = 0,
+                p = 0;
+              l = a;
+              j = b;
+              k = j;
+              h = d;
+              n = e;
+              i = n;
+              if (!k) {
+                g = (f | 0) != 0;
+                if (!i) {
+                  if (g) {
+                    c[f >> 2] = (l >>> 0) % (h >>> 0);
+                    c[(f + 4) >> 2] = 0;
+                  }
+                  n = 0;
+                  f = ((l >>> 0) / (h >>> 0)) >>> 0;
+                  return ((z = n), f) | 0;
+                } else {
+                  if (!g) {
+                    n = 0;
+                    f = 0;
+                    return ((z = n), f) | 0;
+                  }
+                  c[f >> 2] = a | 0;
+                  c[(f + 4) >> 2] = b & 0;
+                  n = 0;
+                  f = 0;
+                  return ((z = n), f) | 0;
+                }
+              }
+              g = (i | 0) == 0;
+              do
+                if (h) {
+                  if (!g) {
+                    g = ((R(i | 0) | 0) - (R(k | 0) | 0)) | 0;
+                    if (g >>> 0 <= 31) {
+                      m = (g + 1) | 0;
+                      i = (31 - g) | 0;
+                      b = (g - 31) >> 31;
+                      h = m;
+                      a = ((l >>> (m >>> 0)) & b) | (k << i);
+                      b = (k >>> (m >>> 0)) & b;
+                      g = 0;
+                      i = l << i;
+                      break;
+                    }
+                    if (!f) {
+                      n = 0;
+                      f = 0;
+                      return ((z = n), f) | 0;
+                    }
+                    c[f >> 2] = a | 0;
+                    c[(f + 4) >> 2] = j | (b & 0);
+                    n = 0;
+                    f = 0;
+                    return ((z = n), f) | 0;
+                  }
+                  g = (h - 1) | 0;
+                  if ((g & h) | 0) {
+                    i = ((R(h | 0) | 0) + 33 - (R(k | 0) | 0)) | 0;
+                    p = (64 - i) | 0;
+                    m = (32 - i) | 0;
+                    j = m >> 31;
+                    o = (i - 32) | 0;
+                    b = o >> 31;
+                    h = i;
+                    a = (((m - 1) >> 31) & (k >>> (o >>> 0))) | (((k << m) | (l >>> (i >>> 0))) & b);
+                    b = b & (k >>> (i >>> 0));
+                    g = (l << p) & j;
+                    i = (((k << p) | (l >>> (o >>> 0))) & j) | ((l << m) & ((i - 33) >> 31));
+                    break;
+                  }
+                  if (f | 0) {
+                    c[f >> 2] = g & l;
+                    c[(f + 4) >> 2] = 0;
+                  }
+                  if ((h | 0) == 1) {
+                    o = j | (b & 0);
+                    p = a | 0 | 0;
+                    return ((z = o), p) | 0;
+                  } else {
+                    p = L6(h | 0) | 0;
+                    o = (k >>> (p >>> 0)) | 0;
+                    p = (k << (32 - p)) | (l >>> (p >>> 0)) | 0;
+                    return ((z = o), p) | 0;
+                  }
+                } else {
+                  if (g) {
+                    if (f | 0) {
+                      c[f >> 2] = (k >>> 0) % (h >>> 0);
+                      c[(f + 4) >> 2] = 0;
+                    }
+                    o = 0;
+                    p = ((k >>> 0) / (h >>> 0)) >>> 0;
+                    return ((z = o), p) | 0;
+                  }
+                  if (!l) {
+                    if (f | 0) {
+                      c[f >> 2] = 0;
+                      c[(f + 4) >> 2] = (k >>> 0) % (i >>> 0);
+                    }
+                    o = 0;
+                    p = ((k >>> 0) / (i >>> 0)) >>> 0;
+                    return ((z = o), p) | 0;
+                  }
+                  g = (i - 1) | 0;
+                  if (!(g & i)) {
+                    if (f | 0) {
+                      c[f >> 2] = a | 0;
+                      c[(f + 4) >> 2] = (g & k) | (b & 0);
+                    }
+                    o = 0;
+                    p = k >>> ((L6(i | 0) | 0) >>> 0);
+                    return ((z = o), p) | 0;
+                  }
+                  g = ((R(i | 0) | 0) - (R(k | 0) | 0)) | 0;
+                  if (g >>> 0 <= 30) {
+                    b = (g + 1) | 0;
+                    i = (31 - g) | 0;
+                    h = b;
+                    a = (k << i) | (l >>> (b >>> 0));
+                    b = k >>> (b >>> 0);
+                    g = 0;
+                    i = l << i;
+                    break;
+                  }
+                  if (!f) {
+                    o = 0;
+                    p = 0;
+                    return ((z = o), p) | 0;
+                  }
+                  c[f >> 2] = a | 0;
+                  c[(f + 4) >> 2] = j | (b & 0);
+                  o = 0;
+                  p = 0;
+                  return ((z = o), p) | 0;
+                }
+              while (0);
+              if (!h) {
+                k = i;
+                j = 0;
+                i = 0;
+              } else {
+                m = d | 0 | 0;
+                l = n | (e & 0);
+                k = J6(m | 0, l | 0, -1, -1) | 0;
+                d = z;
+                j = i;
+                i = 0;
+                do {
+                  e = j;
+                  j = (g >>> 31) | (j << 1);
+                  g = i | (g << 1);
+                  e = (a << 1) | (e >>> 31) | 0;
+                  n = (a >>> 31) | (b << 1) | 0;
+                  K6(k | 0, d | 0, e | 0, n | 0) | 0;
+                  p = z;
+                  o = (p >> 31) | (((p | 0) < 0 ? -1 : 0) << 1);
+                  i = o & 1;
+                  a =
+                    K6(
+                      e | 0,
+                      n | 0,
+                      (o & m) | 0,
+                      (((((p | 0) < 0 ? -1 : 0) >> 31) | (((p | 0) < 0 ? -1 : 0) << 1)) & l) | 0
+                    ) | 0;
+                  b = z;
+                  h = (h - 1) | 0;
+                } while ((h | 0) != 0);
+                k = j;
+                j = 0;
+              }
+              h = 0;
+              if (f | 0) {
+                c[f >> 2] = a;
+                c[(f + 4) >> 2] = b;
+              }
+              o = ((g | 0) >>> 31) | ((k | h) << 1) | (((h << 1) | (g >>> 31)) & 0) | j;
+              p = (((g << 1) | (0 >>> 31)) & -2) | i;
+              return ((z = o), p) | 0;
+            }
+            function N6(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              return M6(a, b, c, d, 0) | 0;
+            }
+            function O6(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0;
+              g = l;
+              l = (l + 16) | 0;
+              f = g | 0;
+              M6(a, b, d, e, f) | 0;
+              l = g;
+              return ((z = c[(f + 4) >> 2] | 0), c[f >> 2] | 0) | 0;
+            }
+            function P6(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              if ((c | 0) < 32) {
+                z = b >> c;
+                return (a >>> c) | ((b & ((1 << c) - 1)) << (32 - c));
+              }
+              z = (b | 0) < 0 ? -1 : 0;
+              return (b >> (c - 32)) | 0;
+            }
+            function Q6(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              if ((c | 0) < 32) {
+                z = b >>> c;
+                return (a >>> c) | ((b & ((1 << c) - 1)) << (32 - c));
+              }
+              z = 0;
+              return (b >>> (c - 32)) | 0;
+            }
+            function R6(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              if ((c | 0) < 32) {
+                z = (b << c) | ((a & (((1 << c) - 1) << (32 - c))) >>> (32 - c));
+                return a << c;
+              }
+              z = a << (c - 32);
+              return 0;
+            }
+            function S6(a) {
+              a = a | 0;
+              return ((a & 255) << 8) | ((a >> 8) & 255) | 0;
+            }
+            function T6(a) {
+              a = a | 0;
+              return ((a & 255) << 24) | (((a >> 8) & 255) << 16) | (((a >> 16) & 255) << 8) | (a >>> 24) | 0;
+            }
+            function U6(a, b, d, e) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0;
+              q = (q + 1) | 0;
+              c[a >> 2] = q;
+              while ((f | 0) < (e | 0)) {
+                if (!(c[(d + (f << 3)) >> 2] | 0)) {
+                  c[(d + (f << 3)) >> 2] = q;
+                  c[(d + ((f << 3) + 4)) >> 2] = b;
+                  c[(d + ((f << 3) + 8)) >> 2] = 0;
+                  z = e;
+                  return d | 0;
+                }
+                f = (f + 1) | 0;
+              }
+              e = (e * 2) | 0;
+              d = W1(d | 0, (8 * ((e + 1) | 0)) | 0) | 0;
+              d = U6(a | 0, b | 0, d | 0, e | 0) | 0;
+              z = e;
+              return d | 0;
+            }
+            function V6(a, b, d) {
+              a = a | 0;
+              b = b | 0;
+              d = d | 0;
+              var e = 0,
+                f = 0;
+              while ((f | 0) < (d | 0)) {
+                e = c[(b + (f << 3)) >> 2] | 0;
+                if (!e) break;
+                if ((e | 0) == (a | 0)) return c[(b + ((f << 3) + 4)) >> 2] | 0;
+                f = (f + 1) | 0;
+              }
+              return 0;
+            }
+            function W6(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0;
+              if ((e | 0) >= 8192) return Ra(b | 0, d | 0, e | 0) | 0;
+              h = b | 0;
+              g = (b + e) | 0;
+              if ((b & 3) == (d & 3)) {
+                while (b & 3) {
+                  if (!e) return h | 0;
+                  a[b >> 0] = a[d >> 0] | 0;
+                  b = (b + 1) | 0;
+                  d = (d + 1) | 0;
+                  e = (e - 1) | 0;
+                }
+                e = (g & -4) | 0;
+                f = (e - 64) | 0;
+                while ((b | 0) <= (f | 0)) {
+                  c[b >> 2] = c[d >> 2];
+                  c[(b + 4) >> 2] = c[(d + 4) >> 2];
+                  c[(b + 8) >> 2] = c[(d + 8) >> 2];
+                  c[(b + 12) >> 2] = c[(d + 12) >> 2];
+                  c[(b + 16) >> 2] = c[(d + 16) >> 2];
+                  c[(b + 20) >> 2] = c[(d + 20) >> 2];
+                  c[(b + 24) >> 2] = c[(d + 24) >> 2];
+                  c[(b + 28) >> 2] = c[(d + 28) >> 2];
+                  c[(b + 32) >> 2] = c[(d + 32) >> 2];
+                  c[(b + 36) >> 2] = c[(d + 36) >> 2];
+                  c[(b + 40) >> 2] = c[(d + 40) >> 2];
+                  c[(b + 44) >> 2] = c[(d + 44) >> 2];
+                  c[(b + 48) >> 2] = c[(d + 48) >> 2];
+                  c[(b + 52) >> 2] = c[(d + 52) >> 2];
+                  c[(b + 56) >> 2] = c[(d + 56) >> 2];
+                  c[(b + 60) >> 2] = c[(d + 60) >> 2];
+                  b = (b + 64) | 0;
+                  d = (d + 64) | 0;
+                }
+                while ((b | 0) < (e | 0)) {
+                  c[b >> 2] = c[d >> 2];
+                  b = (b + 4) | 0;
+                  d = (d + 4) | 0;
+                }
+              } else {
+                e = (g - 4) | 0;
+                while ((b | 0) < (e | 0)) {
+                  a[b >> 0] = a[d >> 0] | 0;
+                  a[(b + 1) >> 0] = a[(d + 1) >> 0] | 0;
+                  a[(b + 2) >> 0] = a[(d + 2) >> 0] | 0;
+                  a[(b + 3) >> 0] = a[(d + 3) >> 0] | 0;
+                  b = (b + 4) | 0;
+                  d = (d + 4) | 0;
+                }
+              }
+              while ((b | 0) < (g | 0)) {
+                a[b >> 0] = a[d >> 0] | 0;
+                b = (b + 1) | 0;
+                d = (d + 1) | 0;
+              }
+              return h | 0;
+            }
+            function X6(b, c, d) {
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              var e = 0;
+              if (((c | 0) < (b | 0)) & ((b | 0) < ((c + d) | 0))) {
+                e = b;
+                c = (c + d) | 0;
+                b = (b + d) | 0;
+                while ((d | 0) > 0) {
+                  b = (b - 1) | 0;
+                  c = (c - 1) | 0;
+                  d = (d - 1) | 0;
+                  a[b >> 0] = a[c >> 0] | 0;
+                }
+                b = e;
+              } else W6(b, c, d) | 0;
+              return b | 0;
+            }
+            function Y6(b, d, e) {
+              b = b | 0;
+              d = d | 0;
+              e = e | 0;
+              var f = 0,
+                g = 0,
+                h = 0,
+                i = 0;
+              h = (b + e) | 0;
+              d = d & 255;
+              if ((e | 0) >= 67) {
+                while (b & 3) {
+                  a[b >> 0] = d;
+                  b = (b + 1) | 0;
+                }
+                f = (h & -4) | 0;
+                g = (f - 64) | 0;
+                i = d | (d << 8) | (d << 16) | (d << 24);
+                while ((b | 0) <= (g | 0)) {
+                  c[b >> 2] = i;
+                  c[(b + 4) >> 2] = i;
+                  c[(b + 8) >> 2] = i;
+                  c[(b + 12) >> 2] = i;
+                  c[(b + 16) >> 2] = i;
+                  c[(b + 20) >> 2] = i;
+                  c[(b + 24) >> 2] = i;
+                  c[(b + 28) >> 2] = i;
+                  c[(b + 32) >> 2] = i;
+                  c[(b + 36) >> 2] = i;
+                  c[(b + 40) >> 2] = i;
+                  c[(b + 44) >> 2] = i;
+                  c[(b + 48) >> 2] = i;
+                  c[(b + 52) >> 2] = i;
+                  c[(b + 56) >> 2] = i;
+                  c[(b + 60) >> 2] = i;
+                  b = (b + 64) | 0;
+                }
+                while ((b | 0) < (f | 0)) {
+                  c[b >> 2] = i;
+                  b = (b + 4) | 0;
+                }
+              }
+              while ((b | 0) < (h | 0)) {
+                a[b >> 0] = d;
+                b = (b + 1) | 0;
+              }
+              return (h - e) | 0;
+            }
+            function Z6(a) {
+              a = a | 0;
+              var b = 0,
+                d = 0;
+              d = ((a + 15) & -16) | 0;
+              b = c[i >> 2] | 0;
+              a = (b + d) | 0;
+              if ((((d | 0) > 0) & ((a | 0) < (b | 0))) | ((a | 0) < 0)) {
+                W() | 0;
+                va(12);
+                return -1;
+              }
+              c[i >> 2] = a;
+              if ((a | 0) > (V() | 0) ? (U() | 0) == 0 : 0) {
+                c[i >> 2] = b;
+                va(12);
+                return -1;
+              }
+              return b | 0;
+            }
+            function _6(a) {
+              a = a | 0;
+              return +gb[a & 1]();
+            }
+            function $6(a, b, c, d) {
+              a = a | 0;
+              b = +b;
+              c = +c;
+              d = +d;
+              return +hb[a & 7](+b, +c, +d);
+            }
+            function a7(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return +ib[a & 1](b | 0);
+            }
+            function b7(a) {
+              a = a | 0;
+              return jb[a & 3]() | 0;
+            }
+            function c7(a, b) {
+              a = a | 0;
+              b = b | 0;
+              return kb[a & 63](b | 0) | 0;
+            }
+            function d7(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              return lb[a & 127](b | 0, c | 0) | 0;
+            }
+            function e7(a, b, c, d, e) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = +d;
+              e = +e;
+              return mb[a & 3](b | 0, c | 0, +d, +e) | 0;
+            }
+            function f7(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              return nb[a & 63](b | 0, c | 0, d | 0) | 0;
+            }
+            function g7(a, b, c, d, e) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              return ob[a & 127](b | 0, c | 0, d | 0, e | 0) | 0;
+            }
+            function h7(a, b, c, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              return pb[a & 127](b | 0, c | 0, d | 0, e | 0, f | 0) | 0;
+            }
+            function i7(a, b, c, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              return qb[a & 1](b | 0, c | 0, d | 0, e | 0, f | 0, g | 0) | 0;
+            }
+            function j7(a, b, c, d, e, f, g, h, i, j, k) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              i = i | 0;
+              j = j | 0;
+              k = k | 0;
+              return rb[a & 3](b | 0, c | 0, d | 0, e | 0, f | 0, g | 0, h | 0, i | 0, j | 0, k | 0) | 0;
+            }
+            function k7(a) {
+              a = a | 0;
+              sb[a & 15]();
+            }
+            function l7(a, b) {
+              a = a | 0;
+              b = b | 0;
+              tb[a & 127](b | 0);
+            }
+            function m7(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              ub[a & 63](b | 0, c | 0);
+            }
+            function n7(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              vb[a & 127](b | 0, c | 0, d | 0);
+            }
+            function o7(a, b, c, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = +e;
+              f = +f;
+              g = g | 0;
+              wb[a & 15](b | 0, c | 0, d | 0, +e, +f, g | 0);
+            }
+            function p7(a, b, c, d, e) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              xb[a & 31](b | 0, c | 0, d | 0, e | 0);
+            }
+            function q7(a, b, c, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              yb[a & 15](b | 0, c | 0, d | 0, e | 0, f | 0);
+            }
+            function r7(a, b, c, d, e, f, g) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              zb[a & 15](b | 0, c | 0, d | 0, e | 0, f | 0, g | 0);
+            }
+            function s7(a, b, c, d, e, f, g, h, i, j) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              i = i | 0;
+              j = j | 0;
+              Ab[a & 0](b | 0, c | 0, d | 0, e | 0, f | 0, g | 0, h | 0, i | 0, j | 0);
+            }
+            function t7() {
+              S(0);
+              return 0.0;
+            }
+            function u7(a, b, c) {
+              a = +a;
+              b = +b;
+              c = +c;
+              S(1);
+              return 0.0;
+            }
+            function v7(a) {
+              a = a | 0;
+              S(2);
+              return 0.0;
+            }
+            function w7() {
+              S(3);
+              return 0;
+            }
+            function x7(a) {
+              a = a | 0;
+              S(4);
+              return 0;
+            }
+            function y7(a, b) {
+              a = a | 0;
+              b = b | 0;
+              S(5);
+              return 0;
+            }
+            function z7(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = +c;
+              d = +d;
+              S(6);
+              return 0;
+            }
+            function A7(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              S(7);
+              return 0;
+            }
+            function B7(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              S(8);
+              return 0;
+            }
+            function C7(a, b, c, d, e) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              S(9);
+              return 0;
+            }
+            function D7(a, b, c, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              S(10);
+              return 0;
+            }
+            function E7(a, b, c, d, e, f, g, h, i, j) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              i = i | 0;
+              j = j | 0;
+              S(11);
+              return 0;
+            }
+            function F7() {
+              S(12);
+            }
+            function G7(a) {
+              a = a | 0;
+              S(13);
+            }
+            function H7(a, b) {
+              a = a | 0;
+              b = b | 0;
+              S(14);
+            }
+            function I7(a, b, c) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              S(15);
+            }
+            function J7(a, b, c, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = +d;
+              e = +e;
+              f = f | 0;
+              S(16);
+            }
+            function K7(a, b, c, d) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              S(17);
+            }
+            function L7(a, b, c, d, e) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              S(18);
+            }
+            function M7(a, b, c, d, e, f) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              S(19);
+            }
+            function N7(a, b, c, d, e, f, g, h, i) {
+              a = a | 0;
+              b = b | 0;
+              c = c | 0;
+              d = d | 0;
+              e = e | 0;
+              f = f | 0;
+              g = g | 0;
+              h = h | 0;
+              i = i | 0;
+              S(20);
+            }
+
+            // EMSCRIPTEN_END_FUNCS
+            var gb = [t7, UO];
+            var hb = [u7, eJ, dJ, fJ, gJ, u7, u7, u7];
+            var ib = [v7, $O];
+            var jb = [w7, $q, TK, KL];
+            var kb = [
+              x7,
+              ch,
+              xg,
+              Lm,
+              Mm,
+              YB,
+              $B,
+              HQ,
+              IQ,
+              zS,
+              AS,
+              BS,
+              CS,
+              DS,
+              ES,
+              FS,
+              GS,
+              $1,
+              Ib,
+              qF,
+              yl,
+              Bl,
+              _m,
+              KK,
+              tB,
+              jC,
+              sB,
+              PK,
+              UK,
+              uB,
+              tQ,
+              JK,
+              yQ,
+              zQ,
+              sY,
+              T1,
+              x7,
+              x7,
+              x7,
+              x7,
+              x7,
+              x7,
+              x7,
+              x7,
+              x7,
+              x7,
+              x7,
+              x7,
+              x7,
+              x7,
+              x7,
+              x7,
+              x7,
+              x7,
+              x7,
+              x7,
+              x7,
+              x7,
+              x7,
+              x7,
+              x7,
+              x7,
+              x7,
+              x7,
+            ];
+            var lb = [
+              y7,
+              AB,
+              XB,
+              aC,
+              TN,
+              UN,
+              LN,
+              HN,
+              pN,
+              $W,
+              aX,
+              bX,
+              cX,
+              dX,
+              eX,
+              gX,
+              hX,
+              iX,
+              jX,
+              kX,
+              lX,
+              mX,
+              nX,
+              oX,
+              pX,
+              qX,
+              rX,
+              sX,
+              tX,
+              uX,
+              vX,
+              wX,
+              xX,
+              yX,
+              zX,
+              AX,
+              BX,
+              CX,
+              DX,
+              EX,
+              N_,
+              O_,
+              Q_,
+              l$,
+              m$,
+              n$,
+              o$,
+              p$,
+              q$,
+              r$,
+              s$,
+              j0,
+              k0,
+              m0,
+              A$,
+              B$,
+              D$,
+              oF,
+              ng,
+              bh,
+              Eh,
+              gi,
+              yi,
+              Jk,
+              Hk,
+              zl,
+              Cl,
+              Zo,
+              hq,
+              jr,
+              Fr,
+              Hr,
+              Jr,
+              Kr,
+              Mr,
+              Lr,
+              Xr,
+              ht,
+              mt,
+              ot,
+              tv,
+              sx,
+              EE,
+              DE,
+              CE,
+              vG,
+              kC,
+              MK,
+              IG,
+              YG,
+              TG,
+              UG,
+              VH,
+              T4,
+              E6,
+              OO,
+              aQ,
+              QA,
+              eV,
+              XA,
+              ZA,
+              uQ,
+              s2,
+              FT,
+              _W,
+              oY,
+              pY,
+              W1,
+              B_,
+              C_,
+              D_,
+              o6,
+              y7,
+              y7,
+              y7,
+              y7,
+              y7,
+              y7,
+              y7,
+              y7,
+              y7,
+              y7,
+              y7,
+              y7,
+              y7,
+              y7,
+              y7,
+              y7,
+            ];
+            var mb = [z7, qu, vu, z7];
+            var nb = [
+              A7,
+              Hm,
+              Mv,
+              Dz,
+              Lz,
+              Uz,
+              Zz,
+              WB,
+              _B,
+              WL,
+              PP,
+              QU,
+              R_,
+              n0,
+              E$,
+              a2,
+              b2,
+              f2,
+              g2,
+              W3,
+              gA,
+              Xm,
+              Av,
+              rp,
+              nt,
+              Vx,
+              Xx,
+              _x,
+              $z,
+              tG,
+              m4,
+              ND,
+              w4,
+              QO,
+              SL,
+              HR,
+              lY,
+              Y$,
+              P0,
+              J0,
+              T0,
+              d5,
+              A7,
+              A7,
+              A7,
+              A7,
+              A7,
+              A7,
+              A7,
+              A7,
+              A7,
+              A7,
+              A7,
+              A7,
+              A7,
+              A7,
+              A7,
+              A7,
+              A7,
+              A7,
+              A7,
+              A7,
+              A7,
+              A7,
+            ];
+            var ob = [
+              B7,
+              Jm,
+              Rr,
+              Nv,
+              Fz,
+              Nz,
+              VA,
+              SD,
+              WA,
+              nB,
+              CB,
+              EB,
+              PB,
+              OB,
+              bC,
+              fC,
+              hC,
+              ML,
+              RP,
+              iR,
+              gR,
+              eT,
+              SU,
+              mV,
+              lV,
+              G_,
+              H_,
+              I_,
+              J_,
+              K_,
+              L_,
+              M_,
+              P_,
+              T_,
+              c0,
+              d0,
+              e0,
+              f0,
+              g0,
+              h0,
+              i0,
+              l0,
+              p0,
+              t$,
+              u$,
+              v$,
+              w$,
+              x$,
+              y$,
+              z$,
+              C$,
+              G$,
+              cA,
+              TC,
+              xG,
+              SO,
+              fZ,
+              iZ,
+              pZ,
+              AZ,
+              JZ,
+              PZ,
+              NZ,
+              QZ,
+              z_,
+              U0,
+              m_,
+              _$,
+              $,
+              Q0,
+              R0,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+              B7,
+            ];
+            var pb = [
+              C7,
+              BB,
+              qN,
+              MN,
+              U_,
+              V_,
+              j$,
+              k$,
+              G0,
+              q0,
+              r0,
+              H$,
+              I$,
+              E_,
+              F_,
+              W0,
+              X0,
+              Y0,
+              Z0,
+              $0,
+              a1,
+              b1,
+              c1,
+              d1,
+              f1,
+              g1,
+              h1,
+              i1,
+              j1,
+              e1,
+              J1,
+              K1,
+              A1,
+              t1,
+              k1,
+              l1,
+              m1,
+              o1,
+              n1,
+              p1,
+              q1,
+              r1,
+              s1,
+              u1,
+              v1,
+              w1,
+              x1,
+              y1,
+              z1,
+              B1,
+              C1,
+              D1,
+              E1,
+              I1,
+              G1,
+              F1,
+              H1,
+              P1,
+              L1,
+              M1,
+              N1,
+              O1,
+              Q1,
+              R1,
+              S1,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+              C7,
+            ];
+            var qb = [D7, RX];
+            var rb = [E7, I0, S0, E7];
+            var sb = [F7, TO, QK, RK, SK, WK, XK, YK, WU, F7, F7, F7, F7, F7, F7, F7];
+            var tb = [
+              G7,
+              Mb,
+              Nb,
+              Rb,
+              Sb,
+              Tb,
+              lc,
+              mc,
+              Kc,
+              Lc,
+              Mc,
+              Nc,
+              Oc,
+              Pc,
+              Qc,
+              ad,
+              bd,
+              ed,
+              fd,
+              gd,
+              hd,
+              id,
+              jd,
+              kd,
+              wd,
+              xd,
+              yd,
+              Ad,
+              Bd,
+              Cd,
+              Dd,
+              Ed,
+              Fd,
+              Gd,
+              Hd,
+              Sd,
+              Td,
+              Ud,
+              Wd,
+              Xd,
+              Yd,
+              Zd,
+              _d,
+              $d,
+              ae,
+              be,
+              ce,
+              ee,
+              re,
+              se,
+              te,
+              ue,
+              Fe,
+              Ge,
+              He,
+              Je,
+              We,
+              Xe,
+              Ye,
+              _e,
+              $e,
+              af,
+              bf,
+              cf,
+              df,
+              ef,
+              ff,
+              gf,
+              qf,
+              rf,
+              sf,
+              tf,
+              Wf,
+              Rf,
+              pm,
+              $l,
+              dp,
+              Eo,
+              Op,
+              Xp,
+              _n,
+              ao,
+              Lp,
+              Mp,
+              Xl,
+              Yl,
+              co,
+              lo,
+              no,
+              yo,
+              FB,
+              XM,
+              nN,
+              ZM,
+              YM,
+              JN,
+              uM,
+              xM,
+              HS,
+              MS,
+              Kf,
+              Dl,
+              Io,
+              Mo,
+              ep,
+              U1,
+              Xv,
+              tA,
+              yG,
+              rI,
+              VU,
+              AR,
+              BQ,
+              NL,
+              nV,
+              QX,
+              jY,
+              kY,
+              qY,
+              G7,
+              G7,
+              G7,
+              G7,
+              G7,
+              G7,
+              G7,
+              G7,
+              G7,
+            ];
+            var ub = [
+              H7,
+              Sc,
+              Xc,
+              md,
+              rd,
+              Od,
+              ke,
+              Ae,
+              Pe,
+              nf,
+              zf,
+              cC,
+              rN,
+              VN,
+              NN,
+              IN,
+              lN,
+              mN,
+              RN,
+              SN,
+              KS,
+              OS,
+              cM,
+              jA,
+              uG,
+              VK,
+              sQ,
+              RW,
+              PX,
+              mY,
+              nY,
+              rY,
+              tY,
+              H7,
+              H7,
+              H7,
+              H7,
+              H7,
+              H7,
+              H7,
+              H7,
+              H7,
+              H7,
+              H7,
+              H7,
+              H7,
+              H7,
+              H7,
+              H7,
+              H7,
+              H7,
+              H7,
+              H7,
+              H7,
+              H7,
+              H7,
+              H7,
+              H7,
+              H7,
+              H7,
+              H7,
+              H7,
+              H7,
+              H7,
+            ];
+            var vb = [
+              I7,
+              Ub,
+              Vb,
+              Yb,
+              Jc,
+              Rc,
+              Tc,
+              Wc,
+              ld,
+              nd,
+              qd,
+              Jd,
+              Kd,
+              Nd,
+              fe,
+              ge,
+              je,
+              ve,
+              we,
+              ze,
+              Ke,
+              Le,
+              Oe,
+              hf,
+              jf,
+              mf,
+              uf,
+              vf,
+              yf,
+              ok,
+              pk,
+              qk,
+              Im,
+              Ez,
+              Mz,
+              qA,
+              GB,
+              gC,
+              PC,
+              TD,
+              lG,
+              QJ,
+              LL,
+              XL,
+              wM,
+              QP,
+              TP,
+              hR,
+              fR,
+              IS,
+              JS,
+              LS,
+              NS,
+              PS,
+              RU,
+              EW,
+              DW,
+              JA,
+              jB,
+              uC,
+              XC,
+              _C,
+              OK,
+              RO,
+              QL,
+              wQ,
+              AQ,
+              FW,
+              HW,
+              IW,
+              QW,
+              SW,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+              I7,
+            ];
+            var wb = [J7, MH, NH, OH, PH, QH, RH, SH, TH, J7, J7, J7, J7, J7, J7, J7];
+            var xb = [
+              K7,
+              Wb,
+              Uc,
+              od,
+              zd,
+              Ld,
+              Vd,
+              he,
+              xe,
+              Me,
+              Ze,
+              kf,
+              wf,
+              Nf,
+              Mf,
+              Lf,
+              Jf,
+              If,
+              Hf,
+              kc,
+              Gf,
+              Ff,
+              DB,
+              oN,
+              KN,
+              S_,
+              o0,
+              F$,
+              o4,
+              vQ,
+              xQ,
+              a0,
+            ];
+            var yb = [L7, cd, Id, Pd, de, Ie, Al, wG, CQ, L7, L7, L7, L7, L7, L7, L7];
+            var zb = [M7, Xb, Vc, pd, Md, ie, ye, Ne, lf, xf, DQ, M7, M7, M7, M7, M7];
+            var Ab = [N7];
+            return {
+              ___errno_location: d2,
+              ___muldi3: I6,
+              ___udivdi3: N6,
+              ___uremdi3: O6,
+              _bitshift64Ashr: P6,
+              _bitshift64Lshr: Q6,
+              _bitshift64Shl: R6,
+              _dtextract: Sz,
+              _free: U1,
+              _htons: a4,
+              _i64Add: J6,
+              _i64Subtract: K6,
+              _llvm_bswap_i16: S6,
+              _llvm_bswap_i32: T6,
+              _malloc: T1,
+              _memalign: Z1,
+              _memcpy: W6,
+              _memmove: X6,
+              _memset: Y6,
+              _realloc: W1,
+              _saveSetjmp: U6,
+              _sbrk: Z6,
+              _testSetjmp: V6,
+              _vizCreateFile: Kb,
+              _vizLastErrorMessage: Jb,
+              _vizRenderFromString: Lb,
+              dynCall_d: _6,
+              dynCall_dddd: $6,
+              dynCall_di: a7,
+              dynCall_i: b7,
+              dynCall_ii: c7,
+              dynCall_iii: d7,
+              dynCall_iiidd: e7,
+              dynCall_iiii: f7,
+              dynCall_iiiii: g7,
+              dynCall_iiiiii: h7,
+              dynCall_iiiiiii: i7,
+              dynCall_iiiiiiiiiii: j7,
+              dynCall_v: k7,
+              dynCall_vi: l7,
+              dynCall_vii: m7,
+              dynCall_viii: n7,
+              dynCall_viiiddi: o7,
+              dynCall_viiii: p7,
+              dynCall_viiiii: q7,
+              dynCall_viiiiii: r7,
+              dynCall_viiiiiiiii: s7,
+              establishStackSpace: Eb,
+              getTempRet0: Hb,
+              runPostSets: G6,
+              setTempRet0: Gb,
+              setThrew: Fb,
+              stackAlloc: Bb,
+              stackRestore: Db,
+              stackSave: Cb,
+            };
+          })(
+            // EMSCRIPTEN_END_ASM
+            Module.asmGlobalArg,
+            Module.asmLibraryArg,
+            buffer
+          );
+          var ___errno_location = (Module["___errno_location"] = asm["___errno_location"]);
+          var ___muldi3 = (Module["___muldi3"] = asm["___muldi3"]);
+          var ___udivdi3 = (Module["___udivdi3"] = asm["___udivdi3"]);
+          var ___uremdi3 = (Module["___uremdi3"] = asm["___uremdi3"]);
+          var _bitshift64Ashr = (Module["_bitshift64Ashr"] = asm["_bitshift64Ashr"]);
+          var _bitshift64Lshr = (Module["_bitshift64Lshr"] = asm["_bitshift64Lshr"]);
+          var _bitshift64Shl = (Module["_bitshift64Shl"] = asm["_bitshift64Shl"]);
+          var _dtextract = (Module["_dtextract"] = asm["_dtextract"]);
+          var _free = (Module["_free"] = asm["_free"]);
+          var _htons = (Module["_htons"] = asm["_htons"]);
+          var _i64Add = (Module["_i64Add"] = asm["_i64Add"]);
+          var _i64Subtract = (Module["_i64Subtract"] = asm["_i64Subtract"]);
+          var _llvm_bswap_i16 = (Module["_llvm_bswap_i16"] = asm["_llvm_bswap_i16"]);
+          var _llvm_bswap_i32 = (Module["_llvm_bswap_i32"] = asm["_llvm_bswap_i32"]);
+          var _malloc = (Module["_malloc"] = asm["_malloc"]);
+          var _memalign = (Module["_memalign"] = asm["_memalign"]);
+          var _memcpy = (Module["_memcpy"] = asm["_memcpy"]);
+          var _memmove = (Module["_memmove"] = asm["_memmove"]);
+          var _memset = (Module["_memset"] = asm["_memset"]);
+          var _realloc = (Module["_realloc"] = asm["_realloc"]);
+          var _saveSetjmp = (Module["_saveSetjmp"] = asm["_saveSetjmp"]);
+          var _sbrk = (Module["_sbrk"] = asm["_sbrk"]);
+          var _testSetjmp = (Module["_testSetjmp"] = asm["_testSetjmp"]);
+          var _vizCreateFile = (Module["_vizCreateFile"] = asm["_vizCreateFile"]);
+          var _vizLastErrorMessage = (Module["_vizLastErrorMessage"] = asm["_vizLastErrorMessage"]);
+          var _vizRenderFromString = (Module["_vizRenderFromString"] = asm["_vizRenderFromString"]);
+          var establishStackSpace = (Module["establishStackSpace"] = asm["establishStackSpace"]);
+          var getTempRet0 = (Module["getTempRet0"] = asm["getTempRet0"]);
+          var runPostSets = (Module["runPostSets"] = asm["runPostSets"]);
+          var setTempRet0 = (Module["setTempRet0"] = asm["setTempRet0"]);
+          var setThrew = (Module["setThrew"] = asm["setThrew"]);
+          var stackAlloc = (Module["stackAlloc"] = asm["stackAlloc"]);
+          var stackRestore = (Module["stackRestore"] = asm["stackRestore"]);
+          var stackSave = (Module["stackSave"] = asm["stackSave"]);
+          var dynCall_d = (Module["dynCall_d"] = asm["dynCall_d"]);
+          var dynCall_dddd = (Module["dynCall_dddd"] = asm["dynCall_dddd"]);
+          var dynCall_di = (Module["dynCall_di"] = asm["dynCall_di"]);
+          var dynCall_i = (Module["dynCall_i"] = asm["dynCall_i"]);
+          var dynCall_ii = (Module["dynCall_ii"] = asm["dynCall_ii"]);
+          var dynCall_iii = (Module["dynCall_iii"] = asm["dynCall_iii"]);
+          var dynCall_iiidd = (Module["dynCall_iiidd"] = asm["dynCall_iiidd"]);
+          var dynCall_iiii = (Module["dynCall_iiii"] = asm["dynCall_iiii"]);
+          var dynCall_iiiii = (Module["dynCall_iiiii"] = asm["dynCall_iiiii"]);
+          var dynCall_iiiiii = (Module["dynCall_iiiiii"] = asm["dynCall_iiiiii"]);
+          var dynCall_iiiiiii = (Module["dynCall_iiiiiii"] = asm["dynCall_iiiiiii"]);
+          var dynCall_iiiiiiiiiii = (Module["dynCall_iiiiiiiiiii"] = asm["dynCall_iiiiiiiiiii"]);
+          var dynCall_v = (Module["dynCall_v"] = asm["dynCall_v"]);
+          var dynCall_vi = (Module["dynCall_vi"] = asm["dynCall_vi"]);
+          var dynCall_vii = (Module["dynCall_vii"] = asm["dynCall_vii"]);
+          var dynCall_viii = (Module["dynCall_viii"] = asm["dynCall_viii"]);
+          var dynCall_viiiddi = (Module["dynCall_viiiddi"] = asm["dynCall_viiiddi"]);
+          var dynCall_viiii = (Module["dynCall_viiii"] = asm["dynCall_viiii"]);
+          var dynCall_viiiii = (Module["dynCall_viiiii"] = asm["dynCall_viiiii"]);
+          var dynCall_viiiiii = (Module["dynCall_viiiiii"] = asm["dynCall_viiiiii"]);
+          var dynCall_viiiiiiiii = (Module["dynCall_viiiiiiiii"] = asm["dynCall_viiiiiiiii"]);
+          Module["asm"] = asm;
+          Module["ccall"] = ccall;
+          Module["Pointer_stringify"] = Pointer_stringify;
+          Module["UTF8ToString"] = UTF8ToString;
+          if (memoryInitializer) {
+            if (!isDataURI(memoryInitializer)) {
+              if (typeof Module["locateFile"] === "function") {
+                memoryInitializer = Module["locateFile"](memoryInitializer);
+              } else if (Module["memoryInitializerPrefixURL"]) {
+                memoryInitializer = Module["memoryInitializerPrefixURL"] + memoryInitializer;
+              }
+            }
+            if (ENVIRONMENT_IS_NODE || ENVIRONMENT_IS_SHELL) {
+              var data = Module["readBinary"](memoryInitializer);
+              HEAPU8.set(data, GLOBAL_BASE);
+            } else {
+              addRunDependency("memory initializer");
+              var applyMemoryInitializer = function (data) {
+                if (data.byteLength) data = new Uint8Array(data);
+                HEAPU8.set(data, GLOBAL_BASE);
+                if (Module["memoryInitializerRequest"]) delete Module["memoryInitializerRequest"].response;
+                removeRunDependency("memory initializer");
+              };
+              function doBrowserLoad() {
+                Module["readAsync"](memoryInitializer, applyMemoryInitializer, function () {
+                  throw "could not load memory initializer " + memoryInitializer;
+                });
+              }
+              var memoryInitializerBytes = tryParseAsDataURI(memoryInitializer);
+              if (memoryInitializerBytes) {
+                applyMemoryInitializer(memoryInitializerBytes.buffer);
+              } else if (Module["memoryInitializerRequest"]) {
+                function useRequest() {
+                  var request = Module["memoryInitializerRequest"];
+                  var response = request.response;
+                  if (request.status !== 200 && request.status !== 0) {
+                    var data = tryParseAsDataURI(Module["memoryInitializerRequestURL"]);
+                    if (data) {
+                      response = data.buffer;
+                    } else {
+                      console.warn(
+                        "a problem seems to have happened with Module.memoryInitializerRequest, status: " +
+                          request.status +
+                          ", retrying " +
+                          memoryInitializer
+                      );
+                      doBrowserLoad();
+                      return;
+                    }
+                  }
+                  applyMemoryInitializer(response);
+                }
+                if (Module["memoryInitializerRequest"].response) {
+                  setTimeout(useRequest, 0);
+                } else {
+                  Module["memoryInitializerRequest"].addEventListener("load", useRequest);
+                }
+              } else {
+                doBrowserLoad();
+              }
+            }
+          }
+          function ExitStatus(status) {
+            this.name = "ExitStatus";
+            this.message = "Program terminated with exit(" + status + ")";
+            this.status = status;
+          }
+          ExitStatus.prototype = new Error();
+          ExitStatus.prototype.constructor = ExitStatus;
+          var initialStackTop;
+          dependenciesFulfilled = function runCaller() {
+            if (!Module["calledRun"]) run();
+            if (!Module["calledRun"]) dependenciesFulfilled = runCaller;
+          };
+          function run(args) {
+            args = args || Module["arguments"];
+            if (runDependencies > 0) {
+              return;
+            }
+            preRun();
+            if (runDependencies > 0) return;
+            if (Module["calledRun"]) return;
+            function doRun() {
+              if (Module["calledRun"]) return;
+              Module["calledRun"] = true;
+              if (ABORT) return;
+              ensureInitRuntime();
+              preMain();
+              if (Module["onRuntimeInitialized"]) Module["onRuntimeInitialized"]();
+              postRun();
+            }
+            if (Module["setStatus"]) {
+              Module["setStatus"]("Running...");
+              setTimeout(function () {
+                setTimeout(function () {
+                  Module["setStatus"]("");
+                }, 1);
+                doRun();
+              }, 1);
+            } else {
+              doRun();
+            }
+          }
+          Module["run"] = run;
+          function exit(status, implicit) {
+            if (implicit && Module["noExitRuntime"] && status === 0) {
+              return;
+            }
+            if (Module["noExitRuntime"]) {
+            } else {
+              ABORT = true;
+              EXITSTATUS = status;
+              STACKTOP = initialStackTop;
+              exitRuntime();
+              if (Module["onExit"]) Module["onExit"](status);
+            }
+            if (ENVIRONMENT_IS_NODE) {
+              process["exit"](status);
+            }
+            Module["quit"](status, new ExitStatus(status));
+          }
+          Module["exit"] = exit;
+          function abort(what) {
+            if (Module["onAbort"]) {
+              Module["onAbort"](what);
+            }
+            if (what !== undefined) {
+              Module.print(what);
+              Module.printErr(what);
+              what = JSON.stringify(what);
+            } else {
+              what = "";
+            }
+            ABORT = true;
+            EXITSTATUS = 1;
+            throw "abort(" + what + "). Build with -s ASSERTIONS=1 for more info.";
+          }
+          Module["abort"] = abort;
+          if (Module["preInit"]) {
+            if (typeof Module["preInit"] == "function") Module["preInit"] = [Module["preInit"]];
+            while (Module["preInit"].length > 0) {
+              Module["preInit"].pop()();
+            }
+          }
+          Module["noExitRuntime"] = true;
+          run();
+
+          return Module;
+        };
+        function Viz(src) {
+          var options = arguments.length <= 1 || arguments[1] === undefined ? {} : arguments[1];
+          var format = options.format === undefined ? "svg" : options.format;
+          var engine = options.engine === undefined ? "dot" : options.engine;
+          var scale = options.scale;
+          var totalMemory = options.totalMemory;
+          var files = options.files === undefined ? [] : options.files;
+          var images = options.images === undefined ? [] : options.images;
+          var i;
+
+          for (i = 0; i < images.length; i++) {
+            files.push({
+              path: images[i].path,
+              data:
+                '<?xml version="1.0" encoding="UTF-8" standalone="no"?>\n<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN" "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">\n<svg width="' +
+                images[i].width +
+                '" height="' +
+                images[i].height +
+                '"></svg>',
+            });
+          }
+
+          if (format == "png-image-element") {
+            return Viz.svgXmlToPngImageElement(render(src, "svg", engine, totalMemory, files), scale);
+          } else {
+            return render(src, format, engine, totalMemory, files);
+          }
+        }
+
+        function render(src, format, engine, totalMemory, files) {
+          var graphviz = Module({ TOTAL_MEMORY: totalMemory });
+          var i;
+
+          for (i = 0; i < files.length; i++) {
+            graphviz["ccall"]("vizCreateFile", "number", ["string", "string"], [files[i].path, files[i].data]);
+          }
+
+          var resultPointer = graphviz["ccall"](
+            "vizRenderFromString",
+            "number",
+            ["string", "string", "string"],
+            [src, format, engine]
+          );
+          var resultString = graphviz["Pointer_stringify"](resultPointer);
+
+          var errorMessagePointer = graphviz["ccall"]("vizLastErrorMessage", "number", [], []);
+          var errorMessageString = graphviz["Pointer_stringify"](errorMessagePointer);
+
+          if (errorMessageString != "") {
+            throw new Error(errorMessageString);
+          }
+
+          return resultString;
+        }
+
+        // https://developer.mozilla.org/en-US/docs/Web/API/WindowBase64/Base64_encoding_and_decoding
+        function b64EncodeUnicode(str) {
+          return btoa(
+            encodeURIComponent(str).replace(/%([0-9A-F]{2})/g, function (match, p1) {
+              return String.fromCharCode("0x" + p1);
+            })
+          );
+        }
+
+        Viz.svgXmlToPngImageElement = function (svgXml, scale, callback) {
+          if (scale === undefined) {
+            if ("devicePixelRatio" in window && window.devicePixelRatio > 1) {
+              scale = window.devicePixelRatio;
+            } else {
+              scale = 1;
+            }
+          }
+
+          var pngImage = new Image();
+
+          try {
+            if (typeof fabric === "object" && fabric.loadSVGFromString) {
+              fabric.loadSVGFromString(svgXml, function (objects, options) {
+                // If there's something wrong with the SVG, Fabric may return an empty array of objects. Graphviz appears to give us at least one <g> element back even given an empty graph, so we will assume an error in this case.
+                if (objects.length == 0) {
+                  if (callback !== undefined) {
+                    callback(new Error("Error loading SVG with Fabric"));
+                    return;
+                  } else {
+                    throw new Error("Error loading SVG with Fabric");
+                  }
+                }
+
+                var element = document.createElement("canvas");
+                element.width = options.width;
+                element.height = options.height;
+
+                var canvas = new fabric.Canvas(element, { enableRetinaScaling: false });
+                var obj = fabric.util.groupSVGElements(objects, options);
+                canvas.add(obj).renderAll();
+
+                pngImage.src = canvas.toDataURL({ multiplier: scale });
+                pngImage.width = options.width;
+                pngImage.height = options.height;
+
+                if (callback !== undefined) {
+                  callback(null, pngImage);
+                }
+              });
+            } else {
+              var svgImage = new Image();
+
+              svgImage.onload = function () {
+                var canvas = document.createElement("canvas");
+                canvas.width = svgImage.width * scale;
+                canvas.height = svgImage.height * scale;
+
+                var context = canvas.getContext("2d");
+                context.drawImage(svgImage, 0, 0, canvas.width, canvas.height);
+
+                pngImage.src = canvas.toDataURL("image/png");
+                pngImage.width = svgImage.width;
+                pngImage.height = svgImage.height;
+
+                if (callback !== undefined) {
+                  callback(null, pngImage);
+                }
+              };
+
+              svgImage.onerror = function (e) {
+                var error;
+
+                if ("error" in e) {
+                  error = e.error;
+                } else {
+                  error = new Error("Error loading SVG");
+                }
+
+                if (callback !== undefined) {
+                  callback(error);
+                } else {
+                  throw error;
+                }
+              };
+
+              svgImage.src = "data:image/svg+xml;base64," + b64EncodeUnicode(svgXml);
+            }
+          } catch (e) {
+            if (callback !== undefined) {
+              callback(e);
+            } else {
+              throw e;
+            }
+          }
+
+          if (callback === undefined) {
+            return pngImage;
+          }
+        };
+
+        Viz.svgXmlToPngBase64 = function (svgXml, scale, callback) {
+          Viz.svgXmlToPngImageElement(svgXml, scale, function (err, image) {
+            if (err) {
+              callback(err);
+            } else {
+              callback(null, image.src.slice("data:image/png;base64,".length));
+            }
+          });
+        };
+        if (typeof exports === "object" && typeof module !== "undefined") {
+          module.exports = Viz;
+        } else if (typeof define === "function" && define.amd) {
+          define(function () {
+            return Viz;
+          });
+        } else {
+          global.Viz = Viz;
+        }
+      })(this);
+    </script>
+    <script>
+      // https://d3js.org v5.9.2 Copyright 2019 Mike Bostock
+      !(function (t, n) {
+        "object" == typeof exports && "undefined" != typeof module
+          ? n(exports)
+          : "function" == typeof define && define.amd
+            ? define(["exports"], n)
+            : n((t.d3 = t.d3 || {}));
+      })(this, function (t) {
+        "use strict";
+        function n(t, n) {
+          return t < n ? -1 : t > n ? 1 : t >= n ? 0 : NaN;
+        }
+        function e(t) {
+          var e;
+          return (
+            1 === t.length &&
+              ((e = t),
+              (t = function (t, r) {
+                return n(e(t), r);
+              })),
+            {
+              left: function (n, e, r, i) {
+                for (null == r && (r = 0), null == i && (i = n.length); r < i; ) {
+                  var o = (r + i) >>> 1;
+                  t(n[o], e) < 0 ? (r = o + 1) : (i = o);
+                }
+                return r;
+              },
+              right: function (n, e, r, i) {
+                for (null == r && (r = 0), null == i && (i = n.length); r < i; ) {
+                  var o = (r + i) >>> 1;
+                  t(n[o], e) > 0 ? (i = o) : (r = o + 1);
+                }
+                return r;
+              },
+            }
+          );
+        }
+        var r = e(n),
+          i = r.right,
+          o = r.left;
+        function a(t, n) {
+          return [t, n];
+        }
+        function u(t) {
+          return null === t ? NaN : +t;
+        }
+        function c(t, n) {
+          var e,
+            r,
+            i = t.length,
+            o = 0,
+            a = -1,
+            c = 0,
+            f = 0;
+          if (null == n) for (; ++a < i; ) isNaN((e = u(t[a]))) || (f += (r = e - c) * (e - (c += r / ++o)));
+          else for (; ++a < i; ) isNaN((e = u(n(t[a], a, t)))) || (f += (r = e - c) * (e - (c += r / ++o)));
+          if (o > 1) return f / (o - 1);
+        }
+        function f(t, n) {
+          var e = c(t, n);
+          return e ? Math.sqrt(e) : e;
+        }
+        function s(t, n) {
+          var e,
+            r,
+            i,
+            o = t.length,
+            a = -1;
+          if (null == n) {
+            for (; ++a < o; )
+              if (null != (e = t[a]) && e >= e)
+                for (r = i = e; ++a < o; ) null != (e = t[a]) && (r > e && (r = e), i < e && (i = e));
+          } else
+            for (; ++a < o; )
+              if (null != (e = n(t[a], a, t)) && e >= e)
+                for (r = i = e; ++a < o; ) null != (e = n(t[a], a, t)) && (r > e && (r = e), i < e && (i = e));
+          return [r, i];
+        }
+        var l = Array.prototype,
+          h = l.slice,
+          d = l.map;
+        function p(t) {
+          return function () {
+            return t;
+          };
+        }
+        function v(t) {
+          return t;
+        }
+        function g(t, n, e) {
+          (t = +t), (n = +n), (e = (i = arguments.length) < 2 ? ((n = t), (t = 0), 1) : i < 3 ? 1 : +e);
+          for (var r = -1, i = 0 | Math.max(0, Math.ceil((n - t) / e)), o = new Array(i); ++r < i; ) o[r] = t + r * e;
+          return o;
+        }
+        var y = Math.sqrt(50),
+          _ = Math.sqrt(10),
+          b = Math.sqrt(2);
+        function m(t, n, e) {
+          var r,
+            i,
+            o,
+            a,
+            u = -1;
+          if (((e = +e), (t = +t) === (n = +n) && e > 0)) return [t];
+          if (((r = n < t) && ((i = t), (t = n), (n = i)), 0 === (a = x(t, n, e)) || !isFinite(a))) return [];
+          if (a > 0)
+            for (t = Math.ceil(t / a), n = Math.floor(n / a), o = new Array((i = Math.ceil(n - t + 1))); ++u < i; )
+              o[u] = (t + u) * a;
+          else
+            for (t = Math.floor(t * a), n = Math.ceil(n * a), o = new Array((i = Math.ceil(t - n + 1))); ++u < i; )
+              o[u] = (t - u) / a;
+          return r && o.reverse(), o;
+        }
+        function x(t, n, e) {
+          var r = (n - t) / Math.max(0, e),
+            i = Math.floor(Math.log(r) / Math.LN10),
+            o = r / Math.pow(10, i);
+          return i >= 0
+            ? (o >= y ? 10 : o >= _ ? 5 : o >= b ? 2 : 1) * Math.pow(10, i)
+            : -Math.pow(10, -i) / (o >= y ? 10 : o >= _ ? 5 : o >= b ? 2 : 1);
+        }
+        function w(t, n, e) {
+          var r = Math.abs(n - t) / Math.max(0, e),
+            i = Math.pow(10, Math.floor(Math.log(r) / Math.LN10)),
+            o = r / i;
+          return o >= y ? (i *= 10) : o >= _ ? (i *= 5) : o >= b && (i *= 2), n < t ? -i : i;
+        }
+        function M(t) {
+          return Math.ceil(Math.log(t.length) / Math.LN2) + 1;
+        }
+        function N(t, n, e) {
+          if ((null == e && (e = u), (r = t.length))) {
+            if ((n = +n) <= 0 || r < 2) return +e(t[0], 0, t);
+            if (n >= 1) return +e(t[r - 1], r - 1, t);
+            var r,
+              i = (r - 1) * n,
+              o = Math.floor(i),
+              a = +e(t[o], o, t);
+            return a + (+e(t[o + 1], o + 1, t) - a) * (i - o);
+          }
+        }
+        function A(t, n) {
+          var e,
+            r,
+            i = t.length,
+            o = -1;
+          if (null == n) {
+            for (; ++o < i; )
+              if (null != (e = t[o]) && e >= e) for (r = e; ++o < i; ) null != (e = t[o]) && e > r && (r = e);
+          } else
+            for (; ++o < i; )
+              if (null != (e = n(t[o], o, t)) && e >= e)
+                for (r = e; ++o < i; ) null != (e = n(t[o], o, t)) && e > r && (r = e);
+          return r;
+        }
+        function T(t) {
+          for (var n, e, r, i = t.length, o = -1, a = 0; ++o < i; ) a += t[o].length;
+          for (e = new Array(a); --i >= 0; ) for (n = (r = t[i]).length; --n >= 0; ) e[--a] = r[n];
+          return e;
+        }
+        function S(t, n) {
+          var e,
+            r,
+            i = t.length,
+            o = -1;
+          if (null == n) {
+            for (; ++o < i; )
+              if (null != (e = t[o]) && e >= e) for (r = e; ++o < i; ) null != (e = t[o]) && r > e && (r = e);
+          } else
+            for (; ++o < i; )
+              if (null != (e = n(t[o], o, t)) && e >= e)
+                for (r = e; ++o < i; ) null != (e = n(t[o], o, t)) && r > e && (r = e);
+          return r;
+        }
+        function k(t) {
+          if (!(i = t.length)) return [];
+          for (var n = -1, e = S(t, E), r = new Array(e); ++n < e; )
+            for (var i, o = -1, a = (r[n] = new Array(i)); ++o < i; ) a[o] = t[o][n];
+          return r;
+        }
+        function E(t) {
+          return t.length;
+        }
+        var C = Array.prototype.slice;
+        function P(t) {
+          return t;
+        }
+        var z = 1,
+          R = 2,
+          D = 3,
+          q = 4,
+          L = 1e-6;
+        function U(t) {
+          return "translate(" + (t + 0.5) + ",0)";
+        }
+        function O(t) {
+          return "translate(0," + (t + 0.5) + ")";
+        }
+        function B() {
+          return !this.__axis;
+        }
+        function Y(t, n) {
+          var e = [],
+            r = null,
+            i = null,
+            o = 6,
+            a = 6,
+            u = 3,
+            c = t === z || t === q ? -1 : 1,
+            f = t === q || t === R ? "x" : "y",
+            s = t === z || t === D ? U : O;
+          function l(l) {
+            var h = null == r ? (n.ticks ? n.ticks.apply(n, e) : n.domain()) : r,
+              d = null == i ? (n.tickFormat ? n.tickFormat.apply(n, e) : P) : i,
+              p = Math.max(o, 0) + u,
+              v = n.range(),
+              g = +v[0] + 0.5,
+              y = +v[v.length - 1] + 0.5,
+              _ = (
+                n.bandwidth
+                  ? function (t) {
+                      var n = Math.max(0, t.bandwidth() - 1) / 2;
+                      return (
+                        t.round() && (n = Math.round(n)),
+                        function (e) {
+                          return +t(e) + n;
+                        }
+                      );
+                    }
+                  : function (t) {
+                      return function (n) {
+                        return +t(n);
+                      };
+                    }
+              )(n.copy()),
+              b = l.selection ? l.selection() : l,
+              m = b.selectAll(".domain").data([null]),
+              x = b.selectAll(".tick").data(h, n).order(),
+              w = x.exit(),
+              M = x.enter().append("g").attr("class", "tick"),
+              N = x.select("line"),
+              A = x.select("text");
+            (m = m.merge(m.enter().insert("path", ".tick").attr("class", "domain").attr("stroke", "currentColor"))),
+              (x = x.merge(M)),
+              (N = N.merge(
+                M.append("line")
+                  .attr("stroke", "currentColor")
+                  .attr(f + "2", c * o)
+              )),
+              (A = A.merge(
+                M.append("text")
+                  .attr("fill", "currentColor")
+                  .attr(f, c * p)
+                  .attr("dy", t === z ? "0em" : t === D ? "0.71em" : "0.32em")
+              )),
+              l !== b &&
+                ((m = m.transition(l)),
+                (x = x.transition(l)),
+                (N = N.transition(l)),
+                (A = A.transition(l)),
+                (w = w
+                  .transition(l)
+                  .attr("opacity", L)
+                  .attr("transform", function (t) {
+                    return isFinite((t = _(t))) ? s(t) : this.getAttribute("transform");
+                  })),
+                M.attr("opacity", L).attr("transform", function (t) {
+                  var n = this.parentNode.__axis;
+                  return s(n && isFinite((n = n(t))) ? n : _(t));
+                })),
+              w.remove(),
+              m.attr(
+                "d",
+                t === q || t == R
+                  ? a
+                    ? "M" + c * a + "," + g + "H0.5V" + y + "H" + c * a
+                    : "M0.5," + g + "V" + y
+                  : a
+                    ? "M" + g + "," + c * a + "V0.5H" + y + "V" + c * a
+                    : "M" + g + ",0.5H" + y
+              ),
+              x.attr("opacity", 1).attr("transform", function (t) {
+                return s(_(t));
+              }),
+              N.attr(f + "2", c * o),
+              A.attr(f, c * p).text(d),
+              b
+                .filter(B)
+                .attr("fill", "none")
+                .attr("font-size", 10)
+                .attr("font-family", "sans-serif")
+                .attr("text-anchor", t === R ? "start" : t === q ? "end" : "middle"),
+              b.each(function () {
+                this.__axis = _;
+              });
+          }
+          return (
+            (l.scale = function (t) {
+              return arguments.length ? ((n = t), l) : n;
+            }),
+            (l.ticks = function () {
+              return (e = C.call(arguments)), l;
+            }),
+            (l.tickArguments = function (t) {
+              return arguments.length ? ((e = null == t ? [] : C.call(t)), l) : e.slice();
+            }),
+            (l.tickValues = function (t) {
+              return arguments.length ? ((r = null == t ? null : C.call(t)), l) : r && r.slice();
+            }),
+            (l.tickFormat = function (t) {
+              return arguments.length ? ((i = t), l) : i;
+            }),
+            (l.tickSize = function (t) {
+              return arguments.length ? ((o = a = +t), l) : o;
+            }),
+            (l.tickSizeInner = function (t) {
+              return arguments.length ? ((o = +t), l) : o;
+            }),
+            (l.tickSizeOuter = function (t) {
+              return arguments.length ? ((a = +t), l) : a;
+            }),
+            (l.tickPadding = function (t) {
+              return arguments.length ? ((u = +t), l) : u;
+            }),
+            l
+          );
+        }
+        var F = { value: function () {} };
+        function I() {
+          for (var t, n = 0, e = arguments.length, r = {}; n < e; ++n) {
+            if (!(t = arguments[n] + "") || t in r) throw new Error("illegal type: " + t);
+            r[t] = [];
+          }
+          return new j(r);
+        }
+        function j(t) {
+          this._ = t;
+        }
+        function H(t, n) {
+          for (var e, r = 0, i = t.length; r < i; ++r) if ((e = t[r]).name === n) return e.value;
+        }
+        function X(t, n, e) {
+          for (var r = 0, i = t.length; r < i; ++r)
+            if (t[r].name === n) {
+              (t[r] = F), (t = t.slice(0, r).concat(t.slice(r + 1)));
+              break;
+            }
+          return null != e && t.push({ name: n, value: e }), t;
+        }
+        j.prototype = I.prototype = {
+          constructor: j,
+          on: function (t, n) {
+            var e,
+              r,
+              i = this._,
+              o =
+                ((r = i),
+                (t + "")
+                  .trim()
+                  .split(/^|\s+/)
+                  .map(function (t) {
+                    var n = "",
+                      e = t.indexOf(".");
+                    if ((e >= 0 && ((n = t.slice(e + 1)), (t = t.slice(0, e))), t && !r.hasOwnProperty(t)))
+                      throw new Error("unknown type: " + t);
+                    return { type: t, name: n };
+                  })),
+              a = -1,
+              u = o.length;
+            if (!(arguments.length < 2)) {
+              if (null != n && "function" != typeof n) throw new Error("invalid callback: " + n);
+              for (; ++a < u; )
+                if ((e = (t = o[a]).type)) i[e] = X(i[e], t.name, n);
+                else if (null == n) for (e in i) i[e] = X(i[e], t.name, null);
+              return this;
+            }
+            for (; ++a < u; ) if ((e = (t = o[a]).type) && (e = H(i[e], t.name))) return e;
+          },
+          copy: function () {
+            var t = {},
+              n = this._;
+            for (var e in n) t[e] = n[e].slice();
+            return new j(t);
+          },
+          call: function (t, n) {
+            if ((e = arguments.length - 2) > 0)
+              for (var e, r, i = new Array(e), o = 0; o < e; ++o) i[o] = arguments[o + 2];
+            if (!this._.hasOwnProperty(t)) throw new Error("unknown type: " + t);
+            for (o = 0, e = (r = this._[t]).length; o < e; ++o) r[o].value.apply(n, i);
+          },
+          apply: function (t, n, e) {
+            if (!this._.hasOwnProperty(t)) throw new Error("unknown type: " + t);
+            for (var r = this._[t], i = 0, o = r.length; i < o; ++i) r[i].value.apply(n, e);
+          },
+        };
+        var G = "http://www.w3.org/1999/xhtml",
+          V = {
+            svg: "http://www.w3.org/2000/svg",
+            xhtml: G,
+            xlink: "http://www.w3.org/1999/xlink",
+            xml: "http://www.w3.org/XML/1998/namespace",
+            xmlns: "http://www.w3.org/2000/xmlns/",
+          };
+        function $(t) {
+          var n = (t += ""),
+            e = n.indexOf(":");
+          return (
+            e >= 0 && "xmlns" !== (n = t.slice(0, e)) && (t = t.slice(e + 1)),
+            V.hasOwnProperty(n) ? { space: V[n], local: t } : t
+          );
+        }
+        function W(t) {
+          var n = $(t);
+          return (
+            n.local
+              ? function (t) {
+                  return function () {
+                    return this.ownerDocument.createElementNS(t.space, t.local);
+                  };
+                }
+              : function (t) {
+                  return function () {
+                    var n = this.ownerDocument,
+                      e = this.namespaceURI;
+                    return e === G && n.documentElement.namespaceURI === G
+                      ? n.createElement(t)
+                      : n.createElementNS(e, t);
+                  };
+                }
+          )(n);
+        }
+        function Z() {}
+        function Q(t) {
+          return null == t
+            ? Z
+            : function () {
+                return this.querySelector(t);
+              };
+        }
+        function J() {
+          return [];
+        }
+        function K(t) {
+          return null == t
+            ? J
+            : function () {
+                return this.querySelectorAll(t);
+              };
+        }
+        function tt(t) {
+          return function () {
+            return this.matches(t);
+          };
+        }
+        function nt(t) {
+          return new Array(t.length);
+        }
+        function et(t, n) {
+          (this.ownerDocument = t.ownerDocument),
+            (this.namespaceURI = t.namespaceURI),
+            (this._next = null),
+            (this._parent = t),
+            (this.__data__ = n);
+        }
+        et.prototype = {
+          constructor: et,
+          appendChild: function (t) {
+            return this._parent.insertBefore(t, this._next);
+          },
+          insertBefore: function (t, n) {
+            return this._parent.insertBefore(t, n);
+          },
+          querySelector: function (t) {
+            return this._parent.querySelector(t);
+          },
+          querySelectorAll: function (t) {
+            return this._parent.querySelectorAll(t);
+          },
+        };
+        var rt = "$";
+        function it(t, n, e, r, i, o) {
+          for (var a, u = 0, c = n.length, f = o.length; u < f; ++u)
+            (a = n[u]) ? ((a.__data__ = o[u]), (r[u] = a)) : (e[u] = new et(t, o[u]));
+          for (; u < c; ++u) (a = n[u]) && (i[u] = a);
+        }
+        function ot(t, n, e, r, i, o, a) {
+          var u,
+            c,
+            f,
+            s = {},
+            l = n.length,
+            h = o.length,
+            d = new Array(l);
+          for (u = 0; u < l; ++u)
+            (c = n[u]) && ((d[u] = f = rt + a.call(c, c.__data__, u, n)), f in s ? (i[u] = c) : (s[f] = c));
+          for (u = 0; u < h; ++u)
+            (c = s[(f = rt + a.call(t, o[u], u, o))])
+              ? ((r[u] = c), (c.__data__ = o[u]), (s[f] = null))
+              : (e[u] = new et(t, o[u]));
+          for (u = 0; u < l; ++u) (c = n[u]) && s[d[u]] === c && (i[u] = c);
+        }
+        function at(t, n) {
+          return t < n ? -1 : t > n ? 1 : t >= n ? 0 : NaN;
+        }
+        function ut(t) {
+          return (t.ownerDocument && t.ownerDocument.defaultView) || (t.document && t) || t.defaultView;
+        }
+        function ct(t, n) {
+          return t.style.getPropertyValue(n) || ut(t).getComputedStyle(t, null).getPropertyValue(n);
+        }
+        function ft(t) {
+          return t.trim().split(/^|\s+/);
+        }
+        function st(t) {
+          return t.classList || new lt(t);
+        }
+        function lt(t) {
+          (this._node = t), (this._names = ft(t.getAttribute("class") || ""));
+        }
+        function ht(t, n) {
+          for (var e = st(t), r = -1, i = n.length; ++r < i; ) e.add(n[r]);
+        }
+        function dt(t, n) {
+          for (var e = st(t), r = -1, i = n.length; ++r < i; ) e.remove(n[r]);
+        }
+        function pt() {
+          this.textContent = "";
+        }
+        function vt() {
+          this.innerHTML = "";
+        }
+        function gt() {
+          this.nextSibling && this.parentNode.appendChild(this);
+        }
+        function yt() {
+          this.previousSibling && this.parentNode.insertBefore(this, this.parentNode.firstChild);
+        }
+        function _t() {
+          return null;
+        }
+        function bt() {
+          var t = this.parentNode;
+          t && t.removeChild(this);
+        }
+        function mt() {
+          return this.parentNode.insertBefore(this.cloneNode(!1), this.nextSibling);
+        }
+        function xt() {
+          return this.parentNode.insertBefore(this.cloneNode(!0), this.nextSibling);
+        }
+        lt.prototype = {
+          add: function (t) {
+            this._names.indexOf(t) < 0 &&
+              (this._names.push(t), this._node.setAttribute("class", this._names.join(" ")));
+          },
+          remove: function (t) {
+            var n = this._names.indexOf(t);
+            n >= 0 && (this._names.splice(n, 1), this._node.setAttribute("class", this._names.join(" ")));
+          },
+          contains: function (t) {
+            return this._names.indexOf(t) >= 0;
+          },
+        };
+        var wt = {};
+        ((t.event = null), "undefined" != typeof document) &&
+          ("onmouseenter" in document.documentElement || (wt = { mouseenter: "mouseover", mouseleave: "mouseout" }));
+        function Mt(t, n, e) {
+          return (
+            (t = Nt(t, n, e)),
+            function (n) {
+              var e = n.relatedTarget;
+              (e && (e === this || 8 & e.compareDocumentPosition(this))) || t.call(this, n);
+            }
+          );
+        }
+        function Nt(n, e, r) {
+          return function (i) {
+            var o = t.event;
+            t.event = i;
+            try {
+              n.call(this, this.__data__, e, r);
+            } finally {
+              t.event = o;
+            }
+          };
+        }
+        function At(t) {
+          return function () {
+            var n = this.__on;
+            if (n) {
+              for (var e, r = 0, i = -1, o = n.length; r < o; ++r)
+                (e = n[r]),
+                  (t.type && e.type !== t.type) || e.name !== t.name
+                    ? (n[++i] = e)
+                    : this.removeEventListener(e.type, e.listener, e.capture);
+              ++i ? (n.length = i) : delete this.__on;
+            }
+          };
+        }
+        function Tt(t, n, e) {
+          var r = wt.hasOwnProperty(t.type) ? Mt : Nt;
+          return function (i, o, a) {
+            var u,
+              c = this.__on,
+              f = r(n, o, a);
+            if (c)
+              for (var s = 0, l = c.length; s < l; ++s)
+                if ((u = c[s]).type === t.type && u.name === t.name)
+                  return (
+                    this.removeEventListener(u.type, u.listener, u.capture),
+                    this.addEventListener(u.type, (u.listener = f), (u.capture = e)),
+                    void (u.value = n)
+                  );
+            this.addEventListener(t.type, f, e),
+              (u = { type: t.type, name: t.name, value: n, listener: f, capture: e }),
+              c ? c.push(u) : (this.__on = [u]);
+          };
+        }
+        function St(n, e, r, i) {
+          var o = t.event;
+          (n.sourceEvent = t.event), (t.event = n);
+          try {
+            return e.apply(r, i);
+          } finally {
+            t.event = o;
+          }
+        }
+        function kt(t, n, e) {
+          var r = ut(t),
+            i = r.CustomEvent;
+          "function" == typeof i
+            ? (i = new i(n, e))
+            : ((i = r.document.createEvent("Event")),
+              e ? (i.initEvent(n, e.bubbles, e.cancelable), (i.detail = e.detail)) : i.initEvent(n, !1, !1)),
+            t.dispatchEvent(i);
+        }
+        var Et = [null];
+        function Ct(t, n) {
+          (this._groups = t), (this._parents = n);
+        }
+        function Pt() {
+          return new Ct([[document.documentElement]], Et);
+        }
+        function zt(t) {
+          return "string" == typeof t
+            ? new Ct([[document.querySelector(t)]], [document.documentElement])
+            : new Ct([[t]], Et);
+        }
+        Ct.prototype = Pt.prototype = {
+          constructor: Ct,
+          select: function (t) {
+            "function" != typeof t && (t = Q(t));
+            for (var n = this._groups, e = n.length, r = new Array(e), i = 0; i < e; ++i)
+              for (var o, a, u = n[i], c = u.length, f = (r[i] = new Array(c)), s = 0; s < c; ++s)
+                (o = u[s]) &&
+                  (a = t.call(o, o.__data__, s, u)) &&
+                  ("__data__" in o && (a.__data__ = o.__data__), (f[s] = a));
+            return new Ct(r, this._parents);
+          },
+          selectAll: function (t) {
+            "function" != typeof t && (t = K(t));
+            for (var n = this._groups, e = n.length, r = [], i = [], o = 0; o < e; ++o)
+              for (var a, u = n[o], c = u.length, f = 0; f < c; ++f)
+                (a = u[f]) && (r.push(t.call(a, a.__data__, f, u)), i.push(a));
+            return new Ct(r, i);
+          },
+          filter: function (t) {
+            "function" != typeof t && (t = tt(t));
+            for (var n = this._groups, e = n.length, r = new Array(e), i = 0; i < e; ++i)
+              for (var o, a = n[i], u = a.length, c = (r[i] = []), f = 0; f < u; ++f)
+                (o = a[f]) && t.call(o, o.__data__, f, a) && c.push(o);
+            return new Ct(r, this._parents);
+          },
+          data: function (t, n) {
+            if (!t)
+              return (
+                (p = new Array(this.size())),
+                (s = -1),
+                this.each(function (t) {
+                  p[++s] = t;
+                }),
+                p
+              );
+            var e,
+              r = n ? ot : it,
+              i = this._parents,
+              o = this._groups;
+            "function" != typeof t &&
+              ((e = t),
+              (t = function () {
+                return e;
+              }));
+            for (var a = o.length, u = new Array(a), c = new Array(a), f = new Array(a), s = 0; s < a; ++s) {
+              var l = i[s],
+                h = o[s],
+                d = h.length,
+                p = t.call(l, l && l.__data__, s, i),
+                v = p.length,
+                g = (c[s] = new Array(v)),
+                y = (u[s] = new Array(v));
+              r(l, h, g, y, (f[s] = new Array(d)), p, n);
+              for (var _, b, m = 0, x = 0; m < v; ++m)
+                if ((_ = g[m])) {
+                  for (m >= x && (x = m + 1); !(b = y[x]) && ++x < v; );
+                  _._next = b || null;
+                }
+            }
+            return ((u = new Ct(u, i))._enter = c), (u._exit = f), u;
+          },
+          enter: function () {
+            return new Ct(this._enter || this._groups.map(nt), this._parents);
+          },
+          exit: function () {
+            return new Ct(this._exit || this._groups.map(nt), this._parents);
+          },
+          join: function (t, n, e) {
+            var r = this.enter(),
+              i = this,
+              o = this.exit();
+            return (
+              (r = "function" == typeof t ? t(r) : r.append(t + "")),
+              null != n && (i = n(i)),
+              null == e ? o.remove() : e(o),
+              r && i ? r.merge(i).order() : i
+            );
+          },
+          merge: function (t) {
+            for (
+              var n = this._groups,
+                e = t._groups,
+                r = n.length,
+                i = e.length,
+                o = Math.min(r, i),
+                a = new Array(r),
+                u = 0;
+              u < o;
+              ++u
+            )
+              for (var c, f = n[u], s = e[u], l = f.length, h = (a[u] = new Array(l)), d = 0; d < l; ++d)
+                (c = f[d] || s[d]) && (h[d] = c);
+            for (; u < r; ++u) a[u] = n[u];
+            return new Ct(a, this._parents);
+          },
+          order: function () {
+            for (var t = this._groups, n = -1, e = t.length; ++n < e; )
+              for (var r, i = t[n], o = i.length - 1, a = i[o]; --o >= 0; )
+                (r = i[o]) && (a && 4 ^ r.compareDocumentPosition(a) && a.parentNode.insertBefore(r, a), (a = r));
+            return this;
+          },
+          sort: function (t) {
+            function n(n, e) {
+              return n && e ? t(n.__data__, e.__data__) : !n - !e;
+            }
+            t || (t = at);
+            for (var e = this._groups, r = e.length, i = new Array(r), o = 0; o < r; ++o) {
+              for (var a, u = e[o], c = u.length, f = (i[o] = new Array(c)), s = 0; s < c; ++s)
+                (a = u[s]) && (f[s] = a);
+              f.sort(n);
+            }
+            return new Ct(i, this._parents).order();
+          },
+          call: function () {
+            var t = arguments[0];
+            return (arguments[0] = this), t.apply(null, arguments), this;
+          },
+          nodes: function () {
+            var t = new Array(this.size()),
+              n = -1;
+            return (
+              this.each(function () {
+                t[++n] = this;
+              }),
+              t
+            );
+          },
+          node: function () {
+            for (var t = this._groups, n = 0, e = t.length; n < e; ++n)
+              for (var r = t[n], i = 0, o = r.length; i < o; ++i) {
+                var a = r[i];
+                if (a) return a;
+              }
+            return null;
+          },
+          size: function () {
+            var t = 0;
+            return (
+              this.each(function () {
+                ++t;
+              }),
+              t
+            );
+          },
+          empty: function () {
+            return !this.node();
+          },
+          each: function (t) {
+            for (var n = this._groups, e = 0, r = n.length; e < r; ++e)
+              for (var i, o = n[e], a = 0, u = o.length; a < u; ++a) (i = o[a]) && t.call(i, i.__data__, a, o);
+            return this;
+          },
+          attr: function (t, n) {
+            var e = $(t);
+            if (arguments.length < 2) {
+              var r = this.node();
+              return e.local ? r.getAttributeNS(e.space, e.local) : r.getAttribute(e);
+            }
+            return this.each(
+              (null == n
+                ? e.local
+                  ? function (t) {
+                      return function () {
+                        this.removeAttributeNS(t.space, t.local);
+                      };
+                    }
+                  : function (t) {
+                      return function () {
+                        this.removeAttribute(t);
+                      };
+                    }
+                : "function" == typeof n
+                  ? e.local
+                    ? function (t, n) {
+                        return function () {
+                          var e = n.apply(this, arguments);
+                          null == e
+                            ? this.removeAttributeNS(t.space, t.local)
+                            : this.setAttributeNS(t.space, t.local, e);
+                        };
+                      }
+                    : function (t, n) {
+                        return function () {
+                          var e = n.apply(this, arguments);
+                          null == e ? this.removeAttribute(t) : this.setAttribute(t, e);
+                        };
+                      }
+                  : e.local
+                    ? function (t, n) {
+                        return function () {
+                          this.setAttributeNS(t.space, t.local, n);
+                        };
+                      }
+                    : function (t, n) {
+                        return function () {
+                          this.setAttribute(t, n);
+                        };
+                      })(e, n)
+            );
+          },
+          style: function (t, n, e) {
+            return arguments.length > 1
+              ? this.each(
+                  (null == n
+                    ? function (t) {
+                        return function () {
+                          this.style.removeProperty(t);
+                        };
+                      }
+                    : "function" == typeof n
+                      ? function (t, n, e) {
+                          return function () {
+                            var r = n.apply(this, arguments);
+                            null == r ? this.style.removeProperty(t) : this.style.setProperty(t, r, e);
+                          };
+                        }
+                      : function (t, n, e) {
+                          return function () {
+                            this.style.setProperty(t, n, e);
+                          };
+                        })(t, n, null == e ? "" : e)
+                )
+              : ct(this.node(), t);
+          },
+          property: function (t, n) {
+            return arguments.length > 1
+              ? this.each(
+                  (null == n
+                    ? function (t) {
+                        return function () {
+                          delete this[t];
+                        };
+                      }
+                    : "function" == typeof n
+                      ? function (t, n) {
+                          return function () {
+                            var e = n.apply(this, arguments);
+                            null == e ? delete this[t] : (this[t] = e);
+                          };
+                        }
+                      : function (t, n) {
+                          return function () {
+                            this[t] = n;
+                          };
+                        })(t, n)
+                )
+              : this.node()[t];
+          },
+          classed: function (t, n) {
+            var e = ft(t + "");
+            if (arguments.length < 2) {
+              for (var r = st(this.node()), i = -1, o = e.length; ++i < o; ) if (!r.contains(e[i])) return !1;
+              return !0;
+            }
+            return this.each(
+              ("function" == typeof n
+                ? function (t, n) {
+                    return function () {
+                      (n.apply(this, arguments) ? ht : dt)(this, t);
+                    };
+                  }
+                : n
+                  ? function (t) {
+                      return function () {
+                        ht(this, t);
+                      };
+                    }
+                  : function (t) {
+                      return function () {
+                        dt(this, t);
+                      };
+                    })(e, n)
+            );
+          },
+          text: function (t) {
+            return arguments.length
+              ? this.each(
+                  null == t
+                    ? pt
+                    : ("function" == typeof t
+                        ? function (t) {
+                            return function () {
+                              var n = t.apply(this, arguments);
+                              this.textContent = null == n ? "" : n;
+                            };
+                          }
+                        : function (t) {
+                            return function () {
+                              this.textContent = t;
+                            };
+                          })(t)
+                )
+              : this.node().textContent;
+          },
+          html: function (t) {
+            return arguments.length
+              ? this.each(
+                  null == t
+                    ? vt
+                    : ("function" == typeof t
+                        ? function (t) {
+                            return function () {
+                              var n = t.apply(this, arguments);
+                              this.innerHTML = null == n ? "" : n;
+                            };
+                          }
+                        : function (t) {
+                            return function () {
+                              this.innerHTML = t;
+                            };
+                          })(t)
+                )
+              : this.node().innerHTML;
+          },
+          raise: function () {
+            return this.each(gt);
+          },
+          lower: function () {
+            return this.each(yt);
+          },
+          append: function (t) {
+            var n = "function" == typeof t ? t : W(t);
+            return this.select(function () {
+              return this.appendChild(n.apply(this, arguments));
+            });
+          },
+          insert: function (t, n) {
+            var e = "function" == typeof t ? t : W(t),
+              r = null == n ? _t : "function" == typeof n ? n : Q(n);
+            return this.select(function () {
+              return this.insertBefore(e.apply(this, arguments), r.apply(this, arguments) || null);
+            });
+          },
+          remove: function () {
+            return this.each(bt);
+          },
+          clone: function (t) {
+            return this.select(t ? xt : mt);
+          },
+          datum: function (t) {
+            return arguments.length ? this.property("__data__", t) : this.node().__data__;
+          },
+          on: function (t, n, e) {
+            var r,
+              i,
+              o = (function (t) {
+                return t
+                  .trim()
+                  .split(/^|\s+/)
+                  .map(function (t) {
+                    var n = "",
+                      e = t.indexOf(".");
+                    return e >= 0 && ((n = t.slice(e + 1)), (t = t.slice(0, e))), { type: t, name: n };
+                  });
+              })(t + ""),
+              a = o.length;
+            if (!(arguments.length < 2)) {
+              for (u = n ? Tt : At, null == e && (e = !1), r = 0; r < a; ++r) this.each(u(o[r], n, e));
+              return this;
+            }
+            var u = this.node().__on;
+            if (u)
+              for (var c, f = 0, s = u.length; f < s; ++f)
+                for (r = 0, c = u[f]; r < a; ++r) if ((i = o[r]).type === c.type && i.name === c.name) return c.value;
+          },
+          dispatch: function (t, n) {
+            return this.each(
+              ("function" == typeof n
+                ? function (t, n) {
+                    return function () {
+                      return kt(this, t, n.apply(this, arguments));
+                    };
+                  }
+                : function (t, n) {
+                    return function () {
+                      return kt(this, t, n);
+                    };
+                  })(t, n)
+            );
+          },
+        };
+        var Rt = 0;
+        function Dt() {
+          return new qt();
+        }
+        function qt() {
+          this._ = "@" + (++Rt).toString(36);
+        }
+        function Lt() {
+          for (var n, e = t.event; (n = e.sourceEvent); ) e = n;
+          return e;
+        }
+        function Ut(t, n) {
+          var e = t.ownerSVGElement || t;
+          if (e.createSVGPoint) {
+            var r = e.createSVGPoint();
+            return (r.x = n.clientX), (r.y = n.clientY), [(r = r.matrixTransform(t.getScreenCTM().inverse())).x, r.y];
+          }
+          var i = t.getBoundingClientRect();
+          return [n.clientX - i.left - t.clientLeft, n.clientY - i.top - t.clientTop];
+        }
+        function Ot(t) {
+          var n = Lt();
+          return n.changedTouches && (n = n.changedTouches[0]), Ut(t, n);
+        }
+        function Bt(t, n, e) {
+          arguments.length < 3 && ((e = n), (n = Lt().changedTouches));
+          for (var r, i = 0, o = n ? n.length : 0; i < o; ++i) if ((r = n[i]).identifier === e) return Ut(t, r);
+          return null;
+        }
+        function Yt() {
+          t.event.stopImmediatePropagation();
+        }
+        function Ft() {
+          t.event.preventDefault(), t.event.stopImmediatePropagation();
+        }
+        function It(t) {
+          var n = t.document.documentElement,
+            e = zt(t).on("dragstart.drag", Ft, !0);
+          "onselectstart" in n
+            ? e.on("selectstart.drag", Ft, !0)
+            : ((n.__noselect = n.style.MozUserSelect), (n.style.MozUserSelect = "none"));
+        }
+        function jt(t, n) {
+          var e = t.document.documentElement,
+            r = zt(t).on("dragstart.drag", null);
+          n &&
+            (r.on("click.drag", Ft, !0),
+            setTimeout(function () {
+              r.on("click.drag", null);
+            }, 0)),
+            "onselectstart" in e
+              ? r.on("selectstart.drag", null)
+              : ((e.style.MozUserSelect = e.__noselect), delete e.__noselect);
+        }
+        function Ht(t) {
+          return function () {
+            return t;
+          };
+        }
+        function Xt(t, n, e, r, i, o, a, u, c, f) {
+          (this.target = t),
+            (this.type = n),
+            (this.subject = e),
+            (this.identifier = r),
+            (this.active = i),
+            (this.x = o),
+            (this.y = a),
+            (this.dx = u),
+            (this.dy = c),
+            (this._ = f);
+        }
+        function Gt() {
+          return !t.event.button;
+        }
+        function Vt() {
+          return this.parentNode;
+        }
+        function $t(n) {
+          return null == n ? { x: t.event.x, y: t.event.y } : n;
+        }
+        function Wt() {
+          return "ontouchstart" in this;
+        }
+        function Zt(t, n, e) {
+          (t.prototype = n.prototype = e), (e.constructor = t);
+        }
+        function Qt(t, n) {
+          var e = Object.create(t.prototype);
+          for (var r in n) e[r] = n[r];
+          return e;
+        }
+        function Jt() {}
+        (qt.prototype = Dt.prototype =
+          {
+            constructor: qt,
+            get: function (t) {
+              for (var n = this._; !(n in t); ) if (!(t = t.parentNode)) return;
+              return t[n];
+            },
+            set: function (t, n) {
+              return (t[this._] = n);
+            },
+            remove: function (t) {
+              return this._ in t && delete t[this._];
+            },
+            toString: function () {
+              return this._;
+            },
+          }),
+          (Xt.prototype.on = function () {
+            var t = this._.on.apply(this._, arguments);
+            return t === this._ ? this : t;
+          });
+        var Kt = "\\s*([+-]?\\d+)\\s*",
+          tn = "\\s*([+-]?\\d*\\.?\\d+(?:[eE][+-]?\\d+)?)\\s*",
+          nn = "\\s*([+-]?\\d*\\.?\\d+(?:[eE][+-]?\\d+)?)%\\s*",
+          en = /^#([0-9a-f]{3})$/,
+          rn = /^#([0-9a-f]{6})$/,
+          on = new RegExp("^rgb\\(" + [Kt, Kt, Kt] + "\\)$"),
+          an = new RegExp("^rgb\\(" + [nn, nn, nn] + "\\)$"),
+          un = new RegExp("^rgba\\(" + [Kt, Kt, Kt, tn] + "\\)$"),
+          cn = new RegExp("^rgba\\(" + [nn, nn, nn, tn] + "\\)$"),
+          fn = new RegExp("^hsl\\(" + [tn, nn, nn] + "\\)$"),
+          sn = new RegExp("^hsla\\(" + [tn, nn, nn, tn] + "\\)$"),
+          ln = {
+            aliceblue: 15792383,
+            antiquewhite: 16444375,
+            aqua: 65535,
+            aquamarine: 8388564,
+            azure: 15794175,
+            beige: 16119260,
+            bisque: 16770244,
+            black: 0,
+            blanchedalmond: 16772045,
+            blue: 255,
+            blueviolet: 9055202,
+            brown: 10824234,
+            burlywood: 14596231,
+            cadetblue: 6266528,
+            chartreuse: 8388352,
+            chocolate: 13789470,
+            coral: 16744272,
+            cornflowerblue: 6591981,
+            cornsilk: 16775388,
+            crimson: 14423100,
+            cyan: 65535,
+            darkblue: 139,
+            darkcyan: 35723,
+            darkgoldenrod: 12092939,
+            darkgray: 11119017,
+            darkgreen: 25600,
+            darkgrey: 11119017,
+            darkkhaki: 12433259,
+            darkmagenta: 9109643,
+            darkolivegreen: 5597999,
+            darkorange: 16747520,
+            darkorchid: 10040012,
+            darkred: 9109504,
+            darksalmon: 15308410,
+            darkseagreen: 9419919,
+            darkslateblue: 4734347,
+            darkslategray: 3100495,
+            darkslategrey: 3100495,
+            darkturquoise: 52945,
+            darkviolet: 9699539,
+            deeppink: 16716947,
+            deepskyblue: 49151,
+            dimgray: 6908265,
+            dimgrey: 6908265,
+            dodgerblue: 2003199,
+            firebrick: 11674146,
+            floralwhite: 16775920,
+            forestgreen: 2263842,
+            fuchsia: 16711935,
+            gainsboro: 14474460,
+            ghostwhite: 16316671,
+            gold: 16766720,
+            goldenrod: 14329120,
+            gray: 8421504,
+            green: 32768,
+            greenyellow: 11403055,
+            grey: 8421504,
+            honeydew: 15794160,
+            hotpink: 16738740,
+            indianred: 13458524,
+            indigo: 4915330,
+            ivory: 16777200,
+            khaki: 15787660,
+            lavender: 15132410,
+            lavenderblush: 16773365,
+            lawngreen: 8190976,
+            lemonchiffon: 16775885,
+            lightblue: 11393254,
+            lightcoral: 15761536,
+            lightcyan: 14745599,
+            lightgoldenrodyellow: 16448210,
+            lightgray: 13882323,
+            lightgreen: 9498256,
+            lightgrey: 13882323,
+            lightpink: 16758465,
+            lightsalmon: 16752762,
+            lightseagreen: 2142890,
+            lightskyblue: 8900346,
+            lightslategray: 7833753,
+            lightslategrey: 7833753,
+            lightsteelblue: 11584734,
+            lightyellow: 16777184,
+            lime: 65280,
+            limegreen: 3329330,
+            linen: 16445670,
+            magenta: 16711935,
+            maroon: 8388608,
+            mediumaquamarine: 6737322,
+            mediumblue: 205,
+            mediumorchid: 12211667,
+            mediumpurple: 9662683,
+            mediumseagreen: 3978097,
+            mediumslateblue: 8087790,
+            mediumspringgreen: 64154,
+            mediumturquoise: 4772300,
+            mediumvioletred: 13047173,
+            midnightblue: 1644912,
+            mintcream: 16121850,
+            mistyrose: 16770273,
+            moccasin: 16770229,
+            navajowhite: 16768685,
+            navy: 128,
+            oldlace: 16643558,
+            olive: 8421376,
+            olivedrab: 7048739,
+            orange: 16753920,
+            orangered: 16729344,
+            orchid: 14315734,
+            palegoldenrod: 15657130,
+            palegreen: 10025880,
+            paleturquoise: 11529966,
+            palevioletred: 14381203,
+            papayawhip: 16773077,
+            peachpuff: 16767673,
+            peru: 13468991,
+            pink: 16761035,
+            plum: 14524637,
+            powderblue: 11591910,
+            purple: 8388736,
+            rebeccapurple: 6697881,
+            red: 16711680,
+            rosybrown: 12357519,
+            royalblue: 4286945,
+            saddlebrown: 9127187,
+            salmon: 16416882,
+            sandybrown: 16032864,
+            seagreen: 3050327,
+            seashell: 16774638,
+            sienna: 10506797,
+            silver: 12632256,
+            skyblue: 8900331,
+            slateblue: 6970061,
+            slategray: 7372944,
+            slategrey: 7372944,
+            snow: 16775930,
+            springgreen: 65407,
+            steelblue: 4620980,
+            tan: 13808780,
+            teal: 32896,
+            thistle: 14204888,
+            tomato: 16737095,
+            turquoise: 4251856,
+            violet: 15631086,
+            wheat: 16113331,
+            white: 16777215,
+            whitesmoke: 16119285,
+            yellow: 16776960,
+            yellowgreen: 10145074,
+          };
+        function hn(t) {
+          var n;
+          return (
+            (t = (t + "").trim().toLowerCase()),
+            (n = en.exec(t))
+              ? new yn(
+                  (((n = parseInt(n[1], 16)) >> 8) & 15) | ((n >> 4) & 240),
+                  ((n >> 4) & 15) | (240 & n),
+                  ((15 & n) << 4) | (15 & n),
+                  1
+                )
+              : (n = rn.exec(t))
+                ? dn(parseInt(n[1], 16))
+                : (n = on.exec(t))
+                  ? new yn(n[1], n[2], n[3], 1)
+                  : (n = an.exec(t))
+                    ? new yn((255 * n[1]) / 100, (255 * n[2]) / 100, (255 * n[3]) / 100, 1)
+                    : (n = un.exec(t))
+                      ? pn(n[1], n[2], n[3], n[4])
+                      : (n = cn.exec(t))
+                        ? pn((255 * n[1]) / 100, (255 * n[2]) / 100, (255 * n[3]) / 100, n[4])
+                        : (n = fn.exec(t))
+                          ? bn(n[1], n[2] / 100, n[3] / 100, 1)
+                          : (n = sn.exec(t))
+                            ? bn(n[1], n[2] / 100, n[3] / 100, n[4])
+                            : ln.hasOwnProperty(t)
+                              ? dn(ln[t])
+                              : "transparent" === t
+                                ? new yn(NaN, NaN, NaN, 0)
+                                : null
+          );
+        }
+        function dn(t) {
+          return new yn((t >> 16) & 255, (t >> 8) & 255, 255 & t, 1);
+        }
+        function pn(t, n, e, r) {
+          return r <= 0 && (t = n = e = NaN), new yn(t, n, e, r);
+        }
+        function vn(t) {
+          return t instanceof Jt || (t = hn(t)), t ? new yn((t = t.rgb()).r, t.g, t.b, t.opacity) : new yn();
+        }
+        function gn(t, n, e, r) {
+          return 1 === arguments.length ? vn(t) : new yn(t, n, e, null == r ? 1 : r);
+        }
+        function yn(t, n, e, r) {
+          (this.r = +t), (this.g = +n), (this.b = +e), (this.opacity = +r);
+        }
+        function _n(t) {
+          return ((t = Math.max(0, Math.min(255, Math.round(t) || 0))) < 16 ? "0" : "") + t.toString(16);
+        }
+        function bn(t, n, e, r) {
+          return (
+            r <= 0 ? (t = n = e = NaN) : e <= 0 || e >= 1 ? (t = n = NaN) : n <= 0 && (t = NaN), new xn(t, n, e, r)
+          );
+        }
+        function mn(t, n, e, r) {
+          return 1 === arguments.length
+            ? (function (t) {
+                if (t instanceof xn) return new xn(t.h, t.s, t.l, t.opacity);
+                if ((t instanceof Jt || (t = hn(t)), !t)) return new xn();
+                if (t instanceof xn) return t;
+                var n = (t = t.rgb()).r / 255,
+                  e = t.g / 255,
+                  r = t.b / 255,
+                  i = Math.min(n, e, r),
+                  o = Math.max(n, e, r),
+                  a = NaN,
+                  u = o - i,
+                  c = (o + i) / 2;
+                return (
+                  u
+                    ? ((a = n === o ? (e - r) / u + 6 * (e < r) : e === o ? (r - n) / u + 2 : (n - e) / u + 4),
+                      (u /= c < 0.5 ? o + i : 2 - o - i),
+                      (a *= 60))
+                    : (u = c > 0 && c < 1 ? 0 : a),
+                  new xn(a, u, c, t.opacity)
+                );
+              })(t)
+            : new xn(t, n, e, null == r ? 1 : r);
+        }
+        function xn(t, n, e, r) {
+          (this.h = +t), (this.s = +n), (this.l = +e), (this.opacity = +r);
+        }
+        function wn(t, n, e) {
+          return 255 * (t < 60 ? n + ((e - n) * t) / 60 : t < 180 ? e : t < 240 ? n + ((e - n) * (240 - t)) / 60 : n);
+        }
+        Zt(Jt, hn, {
+          displayable: function () {
+            return this.rgb().displayable();
+          },
+          hex: function () {
+            return this.rgb().hex();
+          },
+          toString: function () {
+            return this.rgb() + "";
+          },
+        }),
+          Zt(
+            yn,
+            gn,
+            Qt(Jt, {
+              brighter: function (t) {
+                return (
+                  (t = null == t ? 1 / 0.7 : Math.pow(1 / 0.7, t)),
+                  new yn(this.r * t, this.g * t, this.b * t, this.opacity)
+                );
+              },
+              darker: function (t) {
+                return (
+                  (t = null == t ? 0.7 : Math.pow(0.7, t)), new yn(this.r * t, this.g * t, this.b * t, this.opacity)
+                );
+              },
+              rgb: function () {
+                return this;
+              },
+              displayable: function () {
+                return (
+                  0 <= this.r &&
+                  this.r <= 255 &&
+                  0 <= this.g &&
+                  this.g <= 255 &&
+                  0 <= this.b &&
+                  this.b <= 255 &&
+                  0 <= this.opacity &&
+                  this.opacity <= 1
+                );
+              },
+              hex: function () {
+                return "#" + _n(this.r) + _n(this.g) + _n(this.b);
+              },
+              toString: function () {
+                var t = this.opacity;
+                return (
+                  (1 === (t = isNaN(t) ? 1 : Math.max(0, Math.min(1, t))) ? "rgb(" : "rgba(") +
+                  Math.max(0, Math.min(255, Math.round(this.r) || 0)) +
+                  ", " +
+                  Math.max(0, Math.min(255, Math.round(this.g) || 0)) +
+                  ", " +
+                  Math.max(0, Math.min(255, Math.round(this.b) || 0)) +
+                  (1 === t ? ")" : ", " + t + ")")
+                );
+              },
+            })
+          ),
+          Zt(
+            xn,
+            mn,
+            Qt(Jt, {
+              brighter: function (t) {
+                return (
+                  (t = null == t ? 1 / 0.7 : Math.pow(1 / 0.7, t)), new xn(this.h, this.s, this.l * t, this.opacity)
+                );
+              },
+              darker: function (t) {
+                return (t = null == t ? 0.7 : Math.pow(0.7, t)), new xn(this.h, this.s, this.l * t, this.opacity);
+              },
+              rgb: function () {
+                var t = (this.h % 360) + 360 * (this.h < 0),
+                  n = isNaN(t) || isNaN(this.s) ? 0 : this.s,
+                  e = this.l,
+                  r = e + (e < 0.5 ? e : 1 - e) * n,
+                  i = 2 * e - r;
+                return new yn(
+                  wn(t >= 240 ? t - 240 : t + 120, i, r),
+                  wn(t, i, r),
+                  wn(t < 120 ? t + 240 : t - 120, i, r),
+                  this.opacity
+                );
+              },
+              displayable: function () {
+                return (
+                  ((0 <= this.s && this.s <= 1) || isNaN(this.s)) &&
+                  0 <= this.l &&
+                  this.l <= 1 &&
+                  0 <= this.opacity &&
+                  this.opacity <= 1
+                );
+              },
+            })
+          );
+        var Mn = Math.PI / 180,
+          Nn = 180 / Math.PI,
+          An = 0.96422,
+          Tn = 1,
+          Sn = 0.82521,
+          kn = 4 / 29,
+          En = 6 / 29,
+          Cn = 3 * En * En,
+          Pn = En * En * En;
+        function zn(t) {
+          if (t instanceof Dn) return new Dn(t.l, t.a, t.b, t.opacity);
+          if (t instanceof Fn) {
+            if (isNaN(t.h)) return new Dn(t.l, 0, 0, t.opacity);
+            var n = t.h * Mn;
+            return new Dn(t.l, Math.cos(n) * t.c, Math.sin(n) * t.c, t.opacity);
+          }
+          t instanceof yn || (t = vn(t));
+          var e,
+            r,
+            i = On(t.r),
+            o = On(t.g),
+            a = On(t.b),
+            u = qn((0.2225045 * i + 0.7168786 * o + 0.0606169 * a) / Tn);
+          return (
+            i === o && o === a
+              ? (e = r = u)
+              : ((e = qn((0.4360747 * i + 0.3850649 * o + 0.1430804 * a) / An)),
+                (r = qn((0.0139322 * i + 0.0971045 * o + 0.7141733 * a) / Sn))),
+            new Dn(116 * u - 16, 500 * (e - u), 200 * (u - r), t.opacity)
+          );
+        }
+        function Rn(t, n, e, r) {
+          return 1 === arguments.length ? zn(t) : new Dn(t, n, e, null == r ? 1 : r);
+        }
+        function Dn(t, n, e, r) {
+          (this.l = +t), (this.a = +n), (this.b = +e), (this.opacity = +r);
+        }
+        function qn(t) {
+          return t > Pn ? Math.pow(t, 1 / 3) : t / Cn + kn;
+        }
+        function Ln(t) {
+          return t > En ? t * t * t : Cn * (t - kn);
+        }
+        function Un(t) {
+          return 255 * (t <= 0.0031308 ? 12.92 * t : 1.055 * Math.pow(t, 1 / 2.4) - 0.055);
+        }
+        function On(t) {
+          return (t /= 255) <= 0.04045 ? t / 12.92 : Math.pow((t + 0.055) / 1.055, 2.4);
+        }
+        function Bn(t) {
+          if (t instanceof Fn) return new Fn(t.h, t.c, t.l, t.opacity);
+          if ((t instanceof Dn || (t = zn(t)), 0 === t.a && 0 === t.b)) return new Fn(NaN, 0, t.l, t.opacity);
+          var n = Math.atan2(t.b, t.a) * Nn;
+          return new Fn(n < 0 ? n + 360 : n, Math.sqrt(t.a * t.a + t.b * t.b), t.l, t.opacity);
+        }
+        function Yn(t, n, e, r) {
+          return 1 === arguments.length ? Bn(t) : new Fn(t, n, e, null == r ? 1 : r);
+        }
+        function Fn(t, n, e, r) {
+          (this.h = +t), (this.c = +n), (this.l = +e), (this.opacity = +r);
+        }
+        Zt(
+          Dn,
+          Rn,
+          Qt(Jt, {
+            brighter: function (t) {
+              return new Dn(this.l + 18 * (null == t ? 1 : t), this.a, this.b, this.opacity);
+            },
+            darker: function (t) {
+              return new Dn(this.l - 18 * (null == t ? 1 : t), this.a, this.b, this.opacity);
+            },
+            rgb: function () {
+              var t = (this.l + 16) / 116,
+                n = isNaN(this.a) ? t : t + this.a / 500,
+                e = isNaN(this.b) ? t : t - this.b / 200;
+              return new yn(
+                Un(3.1338561 * (n = An * Ln(n)) - 1.6168667 * (t = Tn * Ln(t)) - 0.4906146 * (e = Sn * Ln(e))),
+                Un(-0.9787684 * n + 1.9161415 * t + 0.033454 * e),
+                Un(0.0719453 * n - 0.2289914 * t + 1.4052427 * e),
+                this.opacity
+              );
+            },
+          })
+        ),
+          Zt(
+            Fn,
+            Yn,
+            Qt(Jt, {
+              brighter: function (t) {
+                return new Fn(this.h, this.c, this.l + 18 * (null == t ? 1 : t), this.opacity);
+              },
+              darker: function (t) {
+                return new Fn(this.h, this.c, this.l - 18 * (null == t ? 1 : t), this.opacity);
+              },
+              rgb: function () {
+                return zn(this).rgb();
+              },
+            })
+          );
+        var In = -0.14861,
+          jn = 1.78277,
+          Hn = -0.29227,
+          Xn = -0.90649,
+          Gn = 1.97294,
+          Vn = Gn * Xn,
+          $n = Gn * jn,
+          Wn = jn * Hn - Xn * In;
+        function Zn(t, n, e, r) {
+          return 1 === arguments.length
+            ? (function (t) {
+                if (t instanceof Qn) return new Qn(t.h, t.s, t.l, t.opacity);
+                t instanceof yn || (t = vn(t));
+                var n = t.r / 255,
+                  e = t.g / 255,
+                  r = t.b / 255,
+                  i = (Wn * r + Vn * n - $n * e) / (Wn + Vn - $n),
+                  o = r - i,
+                  a = (Gn * (e - i) - Hn * o) / Xn,
+                  u = Math.sqrt(a * a + o * o) / (Gn * i * (1 - i)),
+                  c = u ? Math.atan2(a, o) * Nn - 120 : NaN;
+                return new Qn(c < 0 ? c + 360 : c, u, i, t.opacity);
+              })(t)
+            : new Qn(t, n, e, null == r ? 1 : r);
+        }
+        function Qn(t, n, e, r) {
+          (this.h = +t), (this.s = +n), (this.l = +e), (this.opacity = +r);
+        }
+        function Jn(t, n, e, r, i) {
+          var o = t * t,
+            a = o * t;
+          return ((1 - 3 * t + 3 * o - a) * n + (4 - 6 * o + 3 * a) * e + (1 + 3 * t + 3 * o - 3 * a) * r + a * i) / 6;
+        }
+        function Kn(t) {
+          var n = t.length - 1;
+          return function (e) {
+            var r = e <= 0 ? (e = 0) : e >= 1 ? ((e = 1), n - 1) : Math.floor(e * n),
+              i = t[r],
+              o = t[r + 1],
+              a = r > 0 ? t[r - 1] : 2 * i - o,
+              u = r < n - 1 ? t[r + 2] : 2 * o - i;
+            return Jn((e - r / n) * n, a, i, o, u);
+          };
+        }
+        function te(t) {
+          var n = t.length;
+          return function (e) {
+            var r = Math.floor(((e %= 1) < 0 ? ++e : e) * n),
+              i = t[(r + n - 1) % n],
+              o = t[r % n],
+              a = t[(r + 1) % n],
+              u = t[(r + 2) % n];
+            return Jn((e - r / n) * n, i, o, a, u);
+          };
+        }
+        function ne(t) {
+          return function () {
+            return t;
+          };
+        }
+        function ee(t, n) {
+          return function (e) {
+            return t + e * n;
+          };
+        }
+        function re(t, n) {
+          var e = n - t;
+          return e ? ee(t, e > 180 || e < -180 ? e - 360 * Math.round(e / 360) : e) : ne(isNaN(t) ? n : t);
+        }
+        function ie(t) {
+          return 1 == (t = +t)
+            ? oe
+            : function (n, e) {
+                return e - n
+                  ? (function (t, n, e) {
+                      return (
+                        (t = Math.pow(t, e)),
+                        (n = Math.pow(n, e) - t),
+                        (e = 1 / e),
+                        function (r) {
+                          return Math.pow(t + r * n, e);
+                        }
+                      );
+                    })(n, e, t)
+                  : ne(isNaN(n) ? e : n);
+              };
+        }
+        function oe(t, n) {
+          var e = n - t;
+          return e ? ee(t, e) : ne(isNaN(t) ? n : t);
+        }
+        Zt(
+          Qn,
+          Zn,
+          Qt(Jt, {
+            brighter: function (t) {
+              return (t = null == t ? 1 / 0.7 : Math.pow(1 / 0.7, t)), new Qn(this.h, this.s, this.l * t, this.opacity);
+            },
+            darker: function (t) {
+              return (t = null == t ? 0.7 : Math.pow(0.7, t)), new Qn(this.h, this.s, this.l * t, this.opacity);
+            },
+            rgb: function () {
+              var t = isNaN(this.h) ? 0 : (this.h + 120) * Mn,
+                n = +this.l,
+                e = isNaN(this.s) ? 0 : this.s * n * (1 - n),
+                r = Math.cos(t),
+                i = Math.sin(t);
+              return new yn(
+                255 * (n + e * (In * r + jn * i)),
+                255 * (n + e * (Hn * r + Xn * i)),
+                255 * (n + e * (Gn * r)),
+                this.opacity
+              );
+            },
+          })
+        );
+        var ae = (function t(n) {
+          var e = ie(n);
+          function r(t, n) {
+            var r = e((t = gn(t)).r, (n = gn(n)).r),
+              i = e(t.g, n.g),
+              o = e(t.b, n.b),
+              a = oe(t.opacity, n.opacity);
+            return function (n) {
+              return (t.r = r(n)), (t.g = i(n)), (t.b = o(n)), (t.opacity = a(n)), t + "";
+            };
+          }
+          return (r.gamma = t), r;
+        })(1);
+        function ue(t) {
+          return function (n) {
+            var e,
+              r,
+              i = n.length,
+              o = new Array(i),
+              a = new Array(i),
+              u = new Array(i);
+            for (e = 0; e < i; ++e) (r = gn(n[e])), (o[e] = r.r || 0), (a[e] = r.g || 0), (u[e] = r.b || 0);
+            return (
+              (o = t(o)),
+              (a = t(a)),
+              (u = t(u)),
+              (r.opacity = 1),
+              function (t) {
+                return (r.r = o(t)), (r.g = a(t)), (r.b = u(t)), r + "";
+              }
+            );
+          };
+        }
+        var ce = ue(Kn),
+          fe = ue(te);
+        function se(t, n) {
+          var e,
+            r = n ? n.length : 0,
+            i = t ? Math.min(r, t.length) : 0,
+            o = new Array(i),
+            a = new Array(r);
+          for (e = 0; e < i; ++e) o[e] = ye(t[e], n[e]);
+          for (; e < r; ++e) a[e] = n[e];
+          return function (t) {
+            for (e = 0; e < i; ++e) a[e] = o[e](t);
+            return a;
+          };
+        }
+        function le(t, n) {
+          var e = new Date();
+          return (
+            (n -= t = +t),
+            function (r) {
+              return e.setTime(t + n * r), e;
+            }
+          );
+        }
+        function he(t, n) {
+          return (
+            (n -= t = +t),
+            function (e) {
+              return t + n * e;
+            }
+          );
+        }
+        function de(t, n) {
+          var e,
+            r = {},
+            i = {};
+          for (e in ((null !== t && "object" == typeof t) || (t = {}),
+          (null !== n && "object" == typeof n) || (n = {}),
+          n))
+            e in t ? (r[e] = ye(t[e], n[e])) : (i[e] = n[e]);
+          return function (t) {
+            for (e in r) i[e] = r[e](t);
+            return i;
+          };
+        }
+        var pe = /[-+]?(?:\d+\.?\d*|\.?\d+)(?:[eE][-+]?\d+)?/g,
+          ve = new RegExp(pe.source, "g");
+        function ge(t, n) {
+          var e,
+            r,
+            i,
+            o = (pe.lastIndex = ve.lastIndex = 0),
+            a = -1,
+            u = [],
+            c = [];
+          for (t += "", n += ""; (e = pe.exec(t)) && (r = ve.exec(n)); )
+            (i = r.index) > o && ((i = n.slice(o, i)), u[a] ? (u[a] += i) : (u[++a] = i)),
+              (e = e[0]) === (r = r[0])
+                ? u[a]
+                  ? (u[a] += r)
+                  : (u[++a] = r)
+                : ((u[++a] = null), c.push({ i: a, x: he(e, r) })),
+              (o = ve.lastIndex);
+          return (
+            o < n.length && ((i = n.slice(o)), u[a] ? (u[a] += i) : (u[++a] = i)),
+            u.length < 2
+              ? c[0]
+                ? (function (t) {
+                    return function (n) {
+                      return t(n) + "";
+                    };
+                  })(c[0].x)
+                : (function (t) {
+                    return function () {
+                      return t;
+                    };
+                  })(n)
+              : ((n = c.length),
+                function (t) {
+                  for (var e, r = 0; r < n; ++r) u[(e = c[r]).i] = e.x(t);
+                  return u.join("");
+                })
+          );
+        }
+        function ye(t, n) {
+          var e,
+            r = typeof n;
+          return null == n || "boolean" === r
+            ? ne(n)
+            : ("number" === r
+                ? he
+                : "string" === r
+                  ? (e = hn(n))
+                    ? ((n = e), ae)
+                    : ge
+                  : n instanceof hn
+                    ? ae
+                    : n instanceof Date
+                      ? le
+                      : Array.isArray(n)
+                        ? se
+                        : ("function" != typeof n.valueOf && "function" != typeof n.toString) || isNaN(n)
+                          ? de
+                          : he)(t, n);
+        }
+        function _e(t, n) {
+          return (
+            (n -= t = +t),
+            function (e) {
+              return Math.round(t + n * e);
+            }
+          );
+        }
+        var be,
+          me,
+          xe,
+          we,
+          Me = 180 / Math.PI,
+          Ne = { translateX: 0, translateY: 0, rotate: 0, skewX: 0, scaleX: 1, scaleY: 1 };
+        function Ae(t, n, e, r, i, o) {
+          var a, u, c;
+          return (
+            (a = Math.sqrt(t * t + n * n)) && ((t /= a), (n /= a)),
+            (c = t * e + n * r) && ((e -= t * c), (r -= n * c)),
+            (u = Math.sqrt(e * e + r * r)) && ((e /= u), (r /= u), (c /= u)),
+            t * r < n * e && ((t = -t), (n = -n), (c = -c), (a = -a)),
+            {
+              translateX: i,
+              translateY: o,
+              rotate: Math.atan2(n, t) * Me,
+              skewX: Math.atan(c) * Me,
+              scaleX: a,
+              scaleY: u,
+            }
+          );
+        }
+        function Te(t, n, e, r) {
+          function i(t) {
+            return t.length ? t.pop() + " " : "";
+          }
+          return function (o, a) {
+            var u = [],
+              c = [];
+            return (
+              (o = t(o)),
+              (a = t(a)),
+              (function (t, r, i, o, a, u) {
+                if (t !== i || r !== o) {
+                  var c = a.push("translate(", null, n, null, e);
+                  u.push({ i: c - 4, x: he(t, i) }, { i: c - 2, x: he(r, o) });
+                } else (i || o) && a.push("translate(" + i + n + o + e);
+              })(o.translateX, o.translateY, a.translateX, a.translateY, u, c),
+              (function (t, n, e, o) {
+                t !== n
+                  ? (t - n > 180 ? (n += 360) : n - t > 180 && (t += 360),
+                    o.push({ i: e.push(i(e) + "rotate(", null, r) - 2, x: he(t, n) }))
+                  : n && e.push(i(e) + "rotate(" + n + r);
+              })(o.rotate, a.rotate, u, c),
+              (function (t, n, e, o) {
+                t !== n
+                  ? o.push({ i: e.push(i(e) + "skewX(", null, r) - 2, x: he(t, n) })
+                  : n && e.push(i(e) + "skewX(" + n + r);
+              })(o.skewX, a.skewX, u, c),
+              (function (t, n, e, r, o, a) {
+                if (t !== e || n !== r) {
+                  var u = o.push(i(o) + "scale(", null, ",", null, ")");
+                  a.push({ i: u - 4, x: he(t, e) }, { i: u - 2, x: he(n, r) });
+                } else (1 === e && 1 === r) || o.push(i(o) + "scale(" + e + "," + r + ")");
+              })(o.scaleX, o.scaleY, a.scaleX, a.scaleY, u, c),
+              (o = a = null),
+              function (t) {
+                for (var n, e = -1, r = c.length; ++e < r; ) u[(n = c[e]).i] = n.x(t);
+                return u.join("");
+              }
+            );
+          };
+        }
+        var Se = Te(
+            function (t) {
+              return "none" === t
+                ? Ne
+                : (be ||
+                    ((be = document.createElement("DIV")),
+                    (me = document.documentElement),
+                    (xe = document.defaultView)),
+                  (be.style.transform = t),
+                  (t = xe.getComputedStyle(me.appendChild(be), null).getPropertyValue("transform")),
+                  me.removeChild(be),
+                  Ae(+(t = t.slice(7, -1).split(","))[0], +t[1], +t[2], +t[3], +t[4], +t[5]));
+            },
+            "px, ",
+            "px)",
+            "deg)"
+          ),
+          ke = Te(
+            function (t) {
+              return null == t
+                ? Ne
+                : (we || (we = document.createElementNS("http://www.w3.org/2000/svg", "g")),
+                  we.setAttribute("transform", t),
+                  (t = we.transform.baseVal.consolidate()) ? Ae((t = t.matrix).a, t.b, t.c, t.d, t.e, t.f) : Ne);
+            },
+            ", ",
+            ")",
+            ")"
+          ),
+          Ee = Math.SQRT2,
+          Ce = 2,
+          Pe = 4,
+          ze = 1e-12;
+        function Re(t) {
+          return ((t = Math.exp(t)) + 1 / t) / 2;
+        }
+        function De(t, n) {
+          var e,
+            r,
+            i = t[0],
+            o = t[1],
+            a = t[2],
+            u = n[0],
+            c = n[1],
+            f = n[2],
+            s = u - i,
+            l = c - o,
+            h = s * s + l * l;
+          if (h < ze)
+            (r = Math.log(f / a) / Ee),
+              (e = function (t) {
+                return [i + t * s, o + t * l, a * Math.exp(Ee * t * r)];
+              });
+          else {
+            var d = Math.sqrt(h),
+              p = (f * f - a * a + Pe * h) / (2 * a * Ce * d),
+              v = (f * f - a * a - Pe * h) / (2 * f * Ce * d),
+              g = Math.log(Math.sqrt(p * p + 1) - p),
+              y = Math.log(Math.sqrt(v * v + 1) - v);
+            (r = (y - g) / Ee),
+              (e = function (t) {
+                var n,
+                  e = t * r,
+                  u = Re(g),
+                  c =
+                    (a / (Ce * d)) *
+                    (u * ((n = Ee * e + g), ((n = Math.exp(2 * n)) - 1) / (n + 1)) -
+                      (function (t) {
+                        return ((t = Math.exp(t)) - 1 / t) / 2;
+                      })(g));
+                return [i + c * s, o + c * l, (a * u) / Re(Ee * e + g)];
+              });
+          }
+          return (e.duration = 1e3 * r), e;
+        }
+        function qe(t) {
+          return function (n, e) {
+            var r = t((n = mn(n)).h, (e = mn(e)).h),
+              i = oe(n.s, e.s),
+              o = oe(n.l, e.l),
+              a = oe(n.opacity, e.opacity);
+            return function (t) {
+              return (n.h = r(t)), (n.s = i(t)), (n.l = o(t)), (n.opacity = a(t)), n + "";
+            };
+          };
+        }
+        var Le = qe(re),
+          Ue = qe(oe);
+        function Oe(t) {
+          return function (n, e) {
+            var r = t((n = Yn(n)).h, (e = Yn(e)).h),
+              i = oe(n.c, e.c),
+              o = oe(n.l, e.l),
+              a = oe(n.opacity, e.opacity);
+            return function (t) {
+              return (n.h = r(t)), (n.c = i(t)), (n.l = o(t)), (n.opacity = a(t)), n + "";
+            };
+          };
+        }
+        var Be = Oe(re),
+          Ye = Oe(oe);
+        function Fe(t) {
+          return (function n(e) {
+            function r(n, r) {
+              var i = t((n = Zn(n)).h, (r = Zn(r)).h),
+                o = oe(n.s, r.s),
+                a = oe(n.l, r.l),
+                u = oe(n.opacity, r.opacity);
+              return function (t) {
+                return (n.h = i(t)), (n.s = o(t)), (n.l = a(Math.pow(t, e))), (n.opacity = u(t)), n + "";
+              };
+            }
+            return (e = +e), (r.gamma = n), r;
+          })(1);
+        }
+        var Ie = Fe(re),
+          je = Fe(oe);
+        var He,
+          Xe,
+          Ge = 0,
+          Ve = 0,
+          $e = 0,
+          We = 1e3,
+          Ze = 0,
+          Qe = 0,
+          Je = 0,
+          Ke = "object" == typeof performance && performance.now ? performance : Date,
+          tr =
+            "object" == typeof window && window.requestAnimationFrame
+              ? window.requestAnimationFrame.bind(window)
+              : function (t) {
+                  setTimeout(t, 17);
+                };
+        function nr() {
+          return Qe || (tr(er), (Qe = Ke.now() + Je));
+        }
+        function er() {
+          Qe = 0;
+        }
+        function rr() {
+          this._call = this._time = this._next = null;
+        }
+        function ir(t, n, e) {
+          var r = new rr();
+          return r.restart(t, n, e), r;
+        }
+        function or() {
+          nr(), ++Ge;
+          for (var t, n = He; n; ) (t = Qe - n._time) >= 0 && n._call.call(null, t), (n = n._next);
+          --Ge;
+        }
+        function ar() {
+          (Qe = (Ze = Ke.now()) + Je), (Ge = Ve = 0);
+          try {
+            or();
+          } finally {
+            (Ge = 0),
+              (function () {
+                var t,
+                  n,
+                  e = He,
+                  r = 1 / 0;
+                for (; e; )
+                  e._call
+                    ? (r > e._time && (r = e._time), (t = e), (e = e._next))
+                    : ((n = e._next), (e._next = null), (e = t ? (t._next = n) : (He = n)));
+                (Xe = t), cr(r);
+              })(),
+              (Qe = 0);
+          }
+        }
+        function ur() {
+          var t = Ke.now(),
+            n = t - Ze;
+          n > We && ((Je -= n), (Ze = t));
+        }
+        function cr(t) {
+          Ge ||
+            (Ve && (Ve = clearTimeout(Ve)),
+            t - Qe > 24
+              ? (t < 1 / 0 && (Ve = setTimeout(ar, t - Ke.now() - Je)), $e && ($e = clearInterval($e)))
+              : ($e || ((Ze = Ke.now()), ($e = setInterval(ur, We))), (Ge = 1), tr(ar)));
+        }
+        function fr(t, n, e) {
+          var r = new rr();
+          return (
+            (n = null == n ? 0 : +n),
+            r.restart(
+              function (e) {
+                r.stop(), t(e + n);
+              },
+              n,
+              e
+            ),
+            r
+          );
+        }
+        rr.prototype = ir.prototype = {
+          constructor: rr,
+          restart: function (t, n, e) {
+            if ("function" != typeof t) throw new TypeError("callback is not a function");
+            (e = (null == e ? nr() : +e) + (null == n ? 0 : +n)),
+              this._next || Xe === this || (Xe ? (Xe._next = this) : (He = this), (Xe = this)),
+              (this._call = t),
+              (this._time = e),
+              cr();
+          },
+          stop: function () {
+            this._call && ((this._call = null), (this._time = 1 / 0), cr());
+          },
+        };
+        var sr = I("start", "end", "cancel", "interrupt"),
+          lr = [],
+          hr = 0,
+          dr = 1,
+          pr = 2,
+          vr = 3,
+          gr = 4,
+          yr = 5,
+          _r = 6;
+        function br(t, n, e, r, i, o) {
+          var a = t.__transition;
+          if (a) {
+            if (e in a) return;
+          } else t.__transition = {};
+          !(function (t, n, e) {
+            var r,
+              i = t.__transition;
+            function o(c) {
+              var f, s, l, h;
+              if (e.state !== dr) return u();
+              for (f in i)
+                if ((h = i[f]).name === e.name) {
+                  if (h.state === vr) return fr(o);
+                  h.state === gr
+                    ? ((h.state = _r),
+                      h.timer.stop(),
+                      h.on.call("interrupt", t, t.__data__, h.index, h.group),
+                      delete i[f])
+                    : +f < n &&
+                      ((h.state = _r),
+                      h.timer.stop(),
+                      h.on.call("cancel", t, t.__data__, h.index, h.group),
+                      delete i[f]);
+                }
+              if (
+                (fr(function () {
+                  e.state === vr && ((e.state = gr), e.timer.restart(a, e.delay, e.time), a(c));
+                }),
+                (e.state = pr),
+                e.on.call("start", t, t.__data__, e.index, e.group),
+                e.state === pr)
+              ) {
+                for (e.state = vr, r = new Array((l = e.tween.length)), f = 0, s = -1; f < l; ++f)
+                  (h = e.tween[f].value.call(t, t.__data__, e.index, e.group)) && (r[++s] = h);
+                r.length = s + 1;
+              }
+            }
+            function a(n) {
+              for (
+                var i = n < e.duration ? e.ease.call(null, n / e.duration) : (e.timer.restart(u), (e.state = yr), 1),
+                  o = -1,
+                  a = r.length;
+                ++o < a;
+
+              )
+                r[o].call(t, i);
+              e.state === yr && (e.on.call("end", t, t.__data__, e.index, e.group), u());
+            }
+            function u() {
+              for (var r in ((e.state = _r), e.timer.stop(), delete i[n], i)) return;
+              delete t.__transition;
+            }
+            (i[n] = e),
+              (e.timer = ir(
+                function (t) {
+                  (e.state = dr), e.timer.restart(o, e.delay, e.time), e.delay <= t && o(t - e.delay);
+                },
+                0,
+                e.time
+              ));
+          })(t, e, {
+            name: n,
+            index: r,
+            group: i,
+            on: sr,
+            tween: lr,
+            time: o.time,
+            delay: o.delay,
+            duration: o.duration,
+            ease: o.ease,
+            timer: null,
+            state: hr,
+          });
+        }
+        function mr(t, n) {
+          var e = wr(t, n);
+          if (e.state > hr) throw new Error("too late; already scheduled");
+          return e;
+        }
+        function xr(t, n) {
+          var e = wr(t, n);
+          if (e.state > vr) throw new Error("too late; already running");
+          return e;
+        }
+        function wr(t, n) {
+          var e = t.__transition;
+          if (!e || !(e = e[n])) throw new Error("transition not found");
+          return e;
+        }
+        function Mr(t, n) {
+          var e,
+            r,
+            i,
+            o = t.__transition,
+            a = !0;
+          if (o) {
+            for (i in ((n = null == n ? null : n + ""), o))
+              (e = o[i]).name === n
+                ? ((r = e.state > pr && e.state < yr),
+                  (e.state = _r),
+                  e.timer.stop(),
+                  e.on.call(r ? "interrupt" : "cancel", t, t.__data__, e.index, e.group),
+                  delete o[i])
+                : (a = !1);
+            a && delete t.__transition;
+          }
+        }
+        function Nr(t, n, e) {
+          var r = t._id;
+          return (
+            t.each(function () {
+              var t = xr(this, r);
+              (t.value || (t.value = {}))[n] = e.apply(this, arguments);
+            }),
+            function (t) {
+              return wr(t, r).value[n];
+            }
+          );
+        }
+        function Ar(t, n) {
+          var e;
+          return ("number" == typeof n ? he : n instanceof hn ? ae : (e = hn(n)) ? ((n = e), ae) : ge)(t, n);
+        }
+        var Tr = Pt.prototype.constructor;
+        function Sr(t) {
+          return function () {
+            this.style.removeProperty(t);
+          };
+        }
+        var kr = 0;
+        function Er(t, n, e, r) {
+          (this._groups = t), (this._parents = n), (this._name = e), (this._id = r);
+        }
+        function Cr(t) {
+          return Pt().transition(t);
+        }
+        function Pr() {
+          return ++kr;
+        }
+        var zr = Pt.prototype;
+        function Rr(t) {
+          return ((t *= 2) <= 1 ? t * t : --t * (2 - t) + 1) / 2;
+        }
+        function Dr(t) {
+          return ((t *= 2) <= 1 ? t * t * t : (t -= 2) * t * t + 2) / 2;
+        }
+        Er.prototype = Cr.prototype = {
+          constructor: Er,
+          select: function (t) {
+            var n = this._name,
+              e = this._id;
+            "function" != typeof t && (t = Q(t));
+            for (var r = this._groups, i = r.length, o = new Array(i), a = 0; a < i; ++a)
+              for (var u, c, f = r[a], s = f.length, l = (o[a] = new Array(s)), h = 0; h < s; ++h)
+                (u = f[h]) &&
+                  (c = t.call(u, u.__data__, h, f)) &&
+                  ("__data__" in u && (c.__data__ = u.__data__), (l[h] = c), br(l[h], n, e, h, l, wr(u, e)));
+            return new Er(o, this._parents, n, e);
+          },
+          selectAll: function (t) {
+            var n = this._name,
+              e = this._id;
+            "function" != typeof t && (t = K(t));
+            for (var r = this._groups, i = r.length, o = [], a = [], u = 0; u < i; ++u)
+              for (var c, f = r[u], s = f.length, l = 0; l < s; ++l)
+                if ((c = f[l])) {
+                  for (var h, d = t.call(c, c.__data__, l, f), p = wr(c, e), v = 0, g = d.length; v < g; ++v)
+                    (h = d[v]) && br(h, n, e, v, d, p);
+                  o.push(d), a.push(c);
+                }
+            return new Er(o, a, n, e);
+          },
+          filter: function (t) {
+            "function" != typeof t && (t = tt(t));
+            for (var n = this._groups, e = n.length, r = new Array(e), i = 0; i < e; ++i)
+              for (var o, a = n[i], u = a.length, c = (r[i] = []), f = 0; f < u; ++f)
+                (o = a[f]) && t.call(o, o.__data__, f, a) && c.push(o);
+            return new Er(r, this._parents, this._name, this._id);
+          },
+          merge: function (t) {
+            if (t._id !== this._id) throw new Error();
+            for (
+              var n = this._groups,
+                e = t._groups,
+                r = n.length,
+                i = e.length,
+                o = Math.min(r, i),
+                a = new Array(r),
+                u = 0;
+              u < o;
+              ++u
+            )
+              for (var c, f = n[u], s = e[u], l = f.length, h = (a[u] = new Array(l)), d = 0; d < l; ++d)
+                (c = f[d] || s[d]) && (h[d] = c);
+            for (; u < r; ++u) a[u] = n[u];
+            return new Er(a, this._parents, this._name, this._id);
+          },
+          selection: function () {
+            return new Tr(this._groups, this._parents);
+          },
+          transition: function () {
+            for (var t = this._name, n = this._id, e = Pr(), r = this._groups, i = r.length, o = 0; o < i; ++o)
+              for (var a, u = r[o], c = u.length, f = 0; f < c; ++f)
+                if ((a = u[f])) {
+                  var s = wr(a, n);
+                  br(a, t, e, f, u, {
+                    time: s.time + s.delay + s.duration,
+                    delay: 0,
+                    duration: s.duration,
+                    ease: s.ease,
+                  });
+                }
+            return new Er(r, this._parents, t, e);
+          },
+          call: zr.call,
+          nodes: zr.nodes,
+          node: zr.node,
+          size: zr.size,
+          empty: zr.empty,
+          each: zr.each,
+          on: function (t, n) {
+            var e = this._id;
+            return arguments.length < 2
+              ? wr(this.node(), e).on.on(t)
+              : this.each(
+                  (function (t, n, e) {
+                    var r,
+                      i,
+                      o = (function (t) {
+                        return (t + "")
+                          .trim()
+                          .split(/^|\s+/)
+                          .every(function (t) {
+                            var n = t.indexOf(".");
+                            return n >= 0 && (t = t.slice(0, n)), !t || "start" === t;
+                          });
+                      })(n)
+                        ? mr
+                        : xr;
+                    return function () {
+                      var a = o(this, t),
+                        u = a.on;
+                      u !== r && (i = (r = u).copy()).on(n, e), (a.on = i);
+                    };
+                  })(e, t, n)
+                );
+          },
+          attr: function (t, n) {
+            var e = $(t),
+              r = "transform" === e ? ke : Ar;
+            return this.attrTween(
+              t,
+              "function" == typeof n
+                ? (e.local
+                    ? function (t, n, e) {
+                        var r, i, o;
+                        return function () {
+                          var a,
+                            u,
+                            c = e(this);
+                          if (null != c)
+                            return (a = this.getAttributeNS(t.space, t.local)) === (u = c + "")
+                              ? null
+                              : a === r && u === i
+                                ? o
+                                : ((i = u), (o = n((r = a), c)));
+                          this.removeAttributeNS(t.space, t.local);
+                        };
+                      }
+                    : function (t, n, e) {
+                        var r, i, o;
+                        return function () {
+                          var a,
+                            u,
+                            c = e(this);
+                          if (null != c)
+                            return (a = this.getAttribute(t)) === (u = c + "")
+                              ? null
+                              : a === r && u === i
+                                ? o
+                                : ((i = u), (o = n((r = a), c)));
+                          this.removeAttribute(t);
+                        };
+                      })(e, r, Nr(this, "attr." + t, n))
+                : null == n
+                  ? (e.local
+                      ? function (t) {
+                          return function () {
+                            this.removeAttributeNS(t.space, t.local);
+                          };
+                        }
+                      : function (t) {
+                          return function () {
+                            this.removeAttribute(t);
+                          };
+                        })(e)
+                  : (e.local
+                      ? function (t, n, e) {
+                          var r,
+                            i,
+                            o = e + "";
+                          return function () {
+                            var a = this.getAttributeNS(t.space, t.local);
+                            return a === o ? null : a === r ? i : (i = n((r = a), e));
+                          };
+                        }
+                      : function (t, n, e) {
+                          var r,
+                            i,
+                            o = e + "";
+                          return function () {
+                            var a = this.getAttribute(t);
+                            return a === o ? null : a === r ? i : (i = n((r = a), e));
+                          };
+                        })(e, r, n)
+            );
+          },
+          attrTween: function (t, n) {
+            var e = "attr." + t;
+            if (arguments.length < 2) return (e = this.tween(e)) && e._value;
+            if (null == n) return this.tween(e, null);
+            if ("function" != typeof n) throw new Error();
+            var r = $(t);
+            return this.tween(
+              e,
+              (r.local
+                ? function (t, n) {
+                    var e, r;
+                    function i() {
+                      var i = n.apply(this, arguments);
+                      return (
+                        i !== r &&
+                          (e =
+                            (r = i) &&
+                            (function (t, n) {
+                              return function (e) {
+                                this.setAttributeNS(t.space, t.local, n(e));
+                              };
+                            })(t, i)),
+                        e
+                      );
+                    }
+                    return (i._value = n), i;
+                  }
+                : function (t, n) {
+                    var e, r;
+                    function i() {
+                      var i = n.apply(this, arguments);
+                      return (
+                        i !== r &&
+                          (e =
+                            (r = i) &&
+                            (function (t, n) {
+                              return function (e) {
+                                this.setAttribute(t, n(e));
+                              };
+                            })(t, i)),
+                        e
+                      );
+                    }
+                    return (i._value = n), i;
+                  })(r, n)
+            );
+          },
+          style: function (t, n, e) {
+            var r = "transform" == (t += "") ? Se : Ar;
+            return null == n
+              ? this.styleTween(
+                  t,
+                  (function (t, n) {
+                    var e, r, i;
+                    return function () {
+                      var o = ct(this, t),
+                        a = (this.style.removeProperty(t), ct(this, t));
+                      return o === a ? null : o === e && a === r ? i : (i = n((e = o), (r = a)));
+                    };
+                  })(t, r)
+                ).on("end.style." + t, Sr(t))
+              : "function" == typeof n
+                ? this.styleTween(
+                    t,
+                    (function (t, n, e) {
+                      var r, i, o;
+                      return function () {
+                        var a = ct(this, t),
+                          u = e(this),
+                          c = u + "";
+                        return (
+                          null == u && (this.style.removeProperty(t), (c = u = ct(this, t))),
+                          a === c ? null : a === r && c === i ? o : ((i = c), (o = n((r = a), u)))
+                        );
+                      };
+                    })(t, r, Nr(this, "style." + t, n))
+                  ).each(
+                    (function (t, n) {
+                      var e,
+                        r,
+                        i,
+                        o,
+                        a = "style." + n,
+                        u = "end." + a;
+                      return function () {
+                        var c = xr(this, t),
+                          f = c.on,
+                          s = null == c.value[a] ? o || (o = Sr(n)) : void 0;
+                        (f === e && i === s) || (r = (e = f).copy()).on(u, (i = s)), (c.on = r);
+                      };
+                    })(this._id, t)
+                  )
+                : this.styleTween(
+                    t,
+                    (function (t, n, e) {
+                      var r,
+                        i,
+                        o = e + "";
+                      return function () {
+                        var a = ct(this, t);
+                        return a === o ? null : a === r ? i : (i = n((r = a), e));
+                      };
+                    })(t, r, n),
+                    e
+                  ).on("end.style." + t, null);
+          },
+          styleTween: function (t, n, e) {
+            var r = "style." + (t += "");
+            if (arguments.length < 2) return (r = this.tween(r)) && r._value;
+            if (null == n) return this.tween(r, null);
+            if ("function" != typeof n) throw new Error();
+            return this.tween(
+              r,
+              (function (t, n, e) {
+                var r, i;
+                function o() {
+                  var o = n.apply(this, arguments);
+                  return (
+                    o !== i &&
+                      (r =
+                        (i = o) &&
+                        (function (t, n, e) {
+                          return function (r) {
+                            this.style.setProperty(t, n(r), e);
+                          };
+                        })(t, o, e)),
+                    r
+                  );
+                }
+                return (o._value = n), o;
+              })(t, n, null == e ? "" : e)
+            );
+          },
+          text: function (t) {
+            return this.tween(
+              "text",
+              "function" == typeof t
+                ? (function (t) {
+                    return function () {
+                      var n = t(this);
+                      this.textContent = null == n ? "" : n;
+                    };
+                  })(Nr(this, "text", t))
+                : (function (t) {
+                    return function () {
+                      this.textContent = t;
+                    };
+                  })(null == t ? "" : t + "")
+            );
+          },
+          remove: function () {
+            return this.on(
+              "end.remove",
+              ((t = this._id),
+              function () {
+                var n = this.parentNode;
+                for (var e in this.__transition) if (+e !== t) return;
+                n && n.removeChild(this);
+              })
+            );
+            var t;
+          },
+          tween: function (t, n) {
+            var e = this._id;
+            if (((t += ""), arguments.length < 2)) {
+              for (var r, i = wr(this.node(), e).tween, o = 0, a = i.length; o < a; ++o)
+                if ((r = i[o]).name === t) return r.value;
+              return null;
+            }
+            return this.each(
+              (null == n
+                ? function (t, n) {
+                    var e, r;
+                    return function () {
+                      var i = xr(this, t),
+                        o = i.tween;
+                      if (o !== e)
+                        for (var a = 0, u = (r = e = o).length; a < u; ++a)
+                          if (r[a].name === n) {
+                            (r = r.slice()).splice(a, 1);
+                            break;
+                          }
+                      i.tween = r;
+                    };
+                  }
+                : function (t, n, e) {
+                    var r, i;
+                    if ("function" != typeof e) throw new Error();
+                    return function () {
+                      var o = xr(this, t),
+                        a = o.tween;
+                      if (a !== r) {
+                        i = (r = a).slice();
+                        for (var u = { name: n, value: e }, c = 0, f = i.length; c < f; ++c)
+                          if (i[c].name === n) {
+                            i[c] = u;
+                            break;
+                          }
+                        c === f && i.push(u);
+                      }
+                      o.tween = i;
+                    };
+                  })(e, t, n)
+            );
+          },
+          delay: function (t) {
+            var n = this._id;
+            return arguments.length
+              ? this.each(
+                  ("function" == typeof t
+                    ? function (t, n) {
+                        return function () {
+                          mr(this, t).delay = +n.apply(this, arguments);
+                        };
+                      }
+                    : function (t, n) {
+                        return (
+                          (n = +n),
+                          function () {
+                            mr(this, t).delay = n;
+                          }
+                        );
+                      })(n, t)
+                )
+              : wr(this.node(), n).delay;
+          },
+          duration: function (t) {
+            var n = this._id;
+            return arguments.length
+              ? this.each(
+                  ("function" == typeof t
+                    ? function (t, n) {
+                        return function () {
+                          xr(this, t).duration = +n.apply(this, arguments);
+                        };
+                      }
+                    : function (t, n) {
+                        return (
+                          (n = +n),
+                          function () {
+                            xr(this, t).duration = n;
+                          }
+                        );
+                      })(n, t)
+                )
+              : wr(this.node(), n).duration;
+          },
+          ease: function (t) {
+            var n = this._id;
+            return arguments.length
+              ? this.each(
+                  (function (t, n) {
+                    if ("function" != typeof n) throw new Error();
+                    return function () {
+                      xr(this, t).ease = n;
+                    };
+                  })(n, t)
+                )
+              : wr(this.node(), n).ease;
+          },
+          end: function () {
+            var t,
+              n,
+              e = this,
+              r = e._id,
+              i = e.size();
+            return new Promise(function (o, a) {
+              var u = { value: a },
+                c = {
+                  value: function () {
+                    0 == --i && o();
+                  },
+                };
+              e.each(function () {
+                var e = xr(this, r),
+                  i = e.on;
+                i !== t && ((n = (t = i).copy())._.cancel.push(u), n._.interrupt.push(u), n._.end.push(c)), (e.on = n);
+              });
+            });
+          },
+        };
+        var qr = (function t(n) {
+            function e(t) {
+              return Math.pow(t, n);
+            }
+            return (n = +n), (e.exponent = t), e;
+          })(3),
+          Lr = (function t(n) {
+            function e(t) {
+              return 1 - Math.pow(1 - t, n);
+            }
+            return (n = +n), (e.exponent = t), e;
+          })(3),
+          Ur = (function t(n) {
+            function e(t) {
+              return ((t *= 2) <= 1 ? Math.pow(t, n) : 2 - Math.pow(2 - t, n)) / 2;
+            }
+            return (n = +n), (e.exponent = t), e;
+          })(3),
+          Or = Math.PI,
+          Br = Or / 2;
+        function Yr(t) {
+          return (1 - Math.cos(Or * t)) / 2;
+        }
+        function Fr(t) {
+          return ((t *= 2) <= 1 ? Math.pow(2, 10 * t - 10) : 2 - Math.pow(2, 10 - 10 * t)) / 2;
+        }
+        function Ir(t) {
+          return ((t *= 2) <= 1 ? 1 - Math.sqrt(1 - t * t) : Math.sqrt(1 - (t -= 2) * t) + 1) / 2;
+        }
+        var jr = 4 / 11,
+          Hr = 6 / 11,
+          Xr = 8 / 11,
+          Gr = 0.75,
+          Vr = 9 / 11,
+          $r = 10 / 11,
+          Wr = 0.9375,
+          Zr = 21 / 22,
+          Qr = 63 / 64,
+          Jr = 1 / jr / jr;
+        function Kr(t) {
+          return (t = +t) < jr
+            ? Jr * t * t
+            : t < Xr
+              ? Jr * (t -= Hr) * t + Gr
+              : t < $r
+                ? Jr * (t -= Vr) * t + Wr
+                : Jr * (t -= Zr) * t + Qr;
+        }
+        var ti = (function t(n) {
+            function e(t) {
+              return t * t * ((n + 1) * t - n);
+            }
+            return (n = +n), (e.overshoot = t), e;
+          })(1.70158),
+          ni = (function t(n) {
+            function e(t) {
+              return --t * t * ((n + 1) * t + n) + 1;
+            }
+            return (n = +n), (e.overshoot = t), e;
+          })(1.70158),
+          ei = (function t(n) {
+            function e(t) {
+              return ((t *= 2) < 1 ? t * t * ((n + 1) * t - n) : (t -= 2) * t * ((n + 1) * t + n) + 2) / 2;
+            }
+            return (n = +n), (e.overshoot = t), e;
+          })(1.70158),
+          ri = 2 * Math.PI,
+          ii = (function t(n, e) {
+            var r = Math.asin(1 / (n = Math.max(1, n))) * (e /= ri);
+            function i(t) {
+              return n * Math.pow(2, 10 * --t) * Math.sin((r - t) / e);
+            }
+            return (
+              (i.amplitude = function (n) {
+                return t(n, e * ri);
+              }),
+              (i.period = function (e) {
+                return t(n, e);
+              }),
+              i
+            );
+          })(1, 0.3),
+          oi = (function t(n, e) {
+            var r = Math.asin(1 / (n = Math.max(1, n))) * (e /= ri);
+            function i(t) {
+              return 1 - n * Math.pow(2, -10 * (t = +t)) * Math.sin((t + r) / e);
+            }
+            return (
+              (i.amplitude = function (n) {
+                return t(n, e * ri);
+              }),
+              (i.period = function (e) {
+                return t(n, e);
+              }),
+              i
+            );
+          })(1, 0.3),
+          ai = (function t(n, e) {
+            var r = Math.asin(1 / (n = Math.max(1, n))) * (e /= ri);
+            function i(t) {
+              return (
+                ((t = 2 * t - 1) < 0
+                  ? n * Math.pow(2, 10 * t) * Math.sin((r - t) / e)
+                  : 2 - n * Math.pow(2, -10 * t) * Math.sin((r + t) / e)) / 2
+              );
+            }
+            return (
+              (i.amplitude = function (n) {
+                return t(n, e * ri);
+              }),
+              (i.period = function (e) {
+                return t(n, e);
+              }),
+              i
+            );
+          })(1, 0.3),
+          ui = { time: null, delay: 0, duration: 250, ease: Dr };
+        function ci(t, n) {
+          for (var e; !(e = t.__transition) || !(e = e[n]); ) if (!(t = t.parentNode)) return (ui.time = nr()), ui;
+          return e;
+        }
+        (Pt.prototype.interrupt = function (t) {
+          return this.each(function () {
+            Mr(this, t);
+          });
+        }),
+          (Pt.prototype.transition = function (t) {
+            var n, e;
+            t instanceof Er
+              ? ((n = t._id), (t = t._name))
+              : ((n = Pr()), ((e = ui).time = nr()), (t = null == t ? null : t + ""));
+            for (var r = this._groups, i = r.length, o = 0; o < i; ++o)
+              for (var a, u = r[o], c = u.length, f = 0; f < c; ++f) (a = u[f]) && br(a, t, n, f, u, e || ci(a, n));
+            return new Er(r, this._parents, t, n);
+          });
+        var fi = [null];
+        function si(t) {
+          return function () {
+            return t;
+          };
+        }
+        function li(t, n, e) {
+          (this.target = t), (this.type = n), (this.selection = e);
+        }
+        function hi() {
+          t.event.stopImmediatePropagation();
+        }
+        function di() {
+          t.event.preventDefault(), t.event.stopImmediatePropagation();
+        }
+        var pi = { name: "drag" },
+          vi = { name: "space" },
+          gi = { name: "handle" },
+          yi = { name: "center" },
+          _i = {
+            name: "x",
+            handles: ["e", "w"].map(Ti),
+            input: function (t, n) {
+              return (
+                t && [
+                  [t[0], n[0][1]],
+                  [t[1], n[1][1]],
+                ]
+              );
+            },
+            output: function (t) {
+              return t && [t[0][0], t[1][0]];
+            },
+          },
+          bi = {
+            name: "y",
+            handles: ["n", "s"].map(Ti),
+            input: function (t, n) {
+              return (
+                t && [
+                  [n[0][0], t[0]],
+                  [n[1][0], t[1]],
+                ]
+              );
+            },
+            output: function (t) {
+              return t && [t[0][1], t[1][1]];
+            },
+          },
+          mi = {
+            name: "xy",
+            handles: ["n", "e", "s", "w", "nw", "ne", "se", "sw"].map(Ti),
+            input: function (t) {
+              return t;
+            },
+            output: function (t) {
+              return t;
+            },
+          },
+          xi = {
+            overlay: "crosshair",
+            selection: "move",
+            n: "ns-resize",
+            e: "ew-resize",
+            s: "ns-resize",
+            w: "ew-resize",
+            nw: "nwse-resize",
+            ne: "nesw-resize",
+            se: "nwse-resize",
+            sw: "nesw-resize",
+          },
+          wi = { e: "w", w: "e", nw: "ne", ne: "nw", se: "sw", sw: "se" },
+          Mi = { n: "s", s: "n", nw: "sw", ne: "se", se: "ne", sw: "nw" },
+          Ni = { overlay: 1, selection: 1, n: null, e: 1, s: null, w: -1, nw: -1, ne: 1, se: 1, sw: -1 },
+          Ai = { overlay: 1, selection: 1, n: -1, e: null, s: 1, w: null, nw: -1, ne: -1, se: 1, sw: 1 };
+        function Ti(t) {
+          return { type: t };
+        }
+        function Si() {
+          return !t.event.button;
+        }
+        function ki() {
+          var t = this.ownerSVGElement || this;
+          return [
+            [0, 0],
+            [t.width.baseVal.value, t.height.baseVal.value],
+          ];
+        }
+        function Ei(t) {
+          for (; !t.__brush; ) if (!(t = t.parentNode)) return;
+          return t.__brush;
+        }
+        function Ci(t) {
+          return t[0][0] === t[1][0] || t[0][1] === t[1][1];
+        }
+        function Pi(n) {
+          var e,
+            r = ki,
+            i = Si,
+            o = I(u, "start", "brush", "end"),
+            a = 6;
+          function u(t) {
+            var e = t
+              .property("__brush", h)
+              .selectAll(".overlay")
+              .data([Ti("overlay")]);
+            e
+              .enter()
+              .append("rect")
+              .attr("class", "overlay")
+              .attr("pointer-events", "all")
+              .attr("cursor", xi.overlay)
+              .merge(e)
+              .each(function () {
+                var t = Ei(this).extent;
+                zt(this)
+                  .attr("x", t[0][0])
+                  .attr("y", t[0][1])
+                  .attr("width", t[1][0] - t[0][0])
+                  .attr("height", t[1][1] - t[0][1]);
+              }),
+              t
+                .selectAll(".selection")
+                .data([Ti("selection")])
+                .enter()
+                .append("rect")
+                .attr("class", "selection")
+                .attr("cursor", xi.selection)
+                .attr("fill", "#777")
+                .attr("fill-opacity", 0.3)
+                .attr("stroke", "#fff")
+                .attr("shape-rendering", "crispEdges");
+            var r = t.selectAll(".handle").data(n.handles, function (t) {
+              return t.type;
+            });
+            r.exit().remove(),
+              r
+                .enter()
+                .append("rect")
+                .attr("class", function (t) {
+                  return "handle handle--" + t.type;
+                })
+                .attr("cursor", function (t) {
+                  return xi[t.type];
+                }),
+              t
+                .each(c)
+                .attr("fill", "none")
+                .attr("pointer-events", "all")
+                .style("-webkit-tap-highlight-color", "rgba(0,0,0,0)")
+                .on("mousedown.brush touchstart.brush", l);
+          }
+          function c() {
+            var t = zt(this),
+              n = Ei(this).selection;
+            n
+              ? (t
+                  .selectAll(".selection")
+                  .style("display", null)
+                  .attr("x", n[0][0])
+                  .attr("y", n[0][1])
+                  .attr("width", n[1][0] - n[0][0])
+                  .attr("height", n[1][1] - n[0][1]),
+                t
+                  .selectAll(".handle")
+                  .style("display", null)
+                  .attr("x", function (t) {
+                    return "e" === t.type[t.type.length - 1] ? n[1][0] - a / 2 : n[0][0] - a / 2;
+                  })
+                  .attr("y", function (t) {
+                    return "s" === t.type[0] ? n[1][1] - a / 2 : n[0][1] - a / 2;
+                  })
+                  .attr("width", function (t) {
+                    return "n" === t.type || "s" === t.type ? n[1][0] - n[0][0] + a : a;
+                  })
+                  .attr("height", function (t) {
+                    return "e" === t.type || "w" === t.type ? n[1][1] - n[0][1] + a : a;
+                  }))
+              : t
+                  .selectAll(".selection,.handle")
+                  .style("display", "none")
+                  .attr("x", null)
+                  .attr("y", null)
+                  .attr("width", null)
+                  .attr("height", null);
+          }
+          function f(t, n) {
+            return t.__brush.emitter || new s(t, n);
+          }
+          function s(t, n) {
+            (this.that = t), (this.args = n), (this.state = t.__brush), (this.active = 0);
+          }
+          function l() {
+            if (t.event.touches) {
+              if (t.event.changedTouches.length < t.event.touches.length) return di();
+            } else if (e) return;
+            if (i.apply(this, arguments)) {
+              var r,
+                o,
+                a,
+                u,
+                s,
+                l,
+                h,
+                d,
+                p,
+                v,
+                g,
+                y,
+                _,
+                b = this,
+                m = t.event.target.__data__.type,
+                x = "selection" === (t.event.metaKey ? (m = "overlay") : m) ? pi : t.event.altKey ? yi : gi,
+                w = n === bi ? null : Ni[m],
+                M = n === _i ? null : Ai[m],
+                N = Ei(b),
+                A = N.extent,
+                T = N.selection,
+                S = A[0][0],
+                k = A[0][1],
+                E = A[1][0],
+                C = A[1][1],
+                P = w && M && t.event.shiftKey,
+                z = Ot(b),
+                R = z,
+                D = f(b, arguments).beforestart();
+              "overlay" === m
+                ? (N.selection = T =
+                    [
+                      [(r = n === bi ? S : z[0]), (a = n === _i ? k : z[1])],
+                      [(s = n === bi ? E : r), (h = n === _i ? C : a)],
+                    ])
+                : ((r = T[0][0]), (a = T[0][1]), (s = T[1][0]), (h = T[1][1])),
+                (o = r),
+                (u = a),
+                (l = s),
+                (d = h);
+              var q = zt(b).attr("pointer-events", "none"),
+                L = q.selectAll(".overlay").attr("cursor", xi[m]);
+              if (t.event.touches) q.on("touchmove.brush", O, !0).on("touchend.brush touchcancel.brush", Y, !0);
+              else {
+                var U = zt(t.event.view)
+                  .on(
+                    "keydown.brush",
+                    function () {
+                      switch (t.event.keyCode) {
+                        case 16:
+                          P = w && M;
+                          break;
+                        case 18:
+                          x === gi &&
+                            (w && ((s = l - p * w), (r = o + p * w)),
+                            M && ((h = d - v * M), (a = u + v * M)),
+                            (x = yi),
+                            B());
+                          break;
+                        case 32:
+                          (x !== gi && x !== yi) ||
+                            (w < 0 ? (s = l - p) : w > 0 && (r = o - p),
+                            M < 0 ? (h = d - v) : M > 0 && (a = u - v),
+                            (x = vi),
+                            L.attr("cursor", xi.selection),
+                            B());
+                          break;
+                        default:
+                          return;
+                      }
+                      di();
+                    },
+                    !0
+                  )
+                  .on(
+                    "keyup.brush",
+                    function () {
+                      switch (t.event.keyCode) {
+                        case 16:
+                          P && ((y = _ = P = !1), B());
+                          break;
+                        case 18:
+                          x === yi &&
+                            (w < 0 ? (s = l) : w > 0 && (r = o), M < 0 ? (h = d) : M > 0 && (a = u), (x = gi), B());
+                          break;
+                        case 32:
+                          x === vi &&
+                            (t.event.altKey
+                              ? (w && ((s = l - p * w), (r = o + p * w)),
+                                M && ((h = d - v * M), (a = u + v * M)),
+                                (x = yi))
+                              : (w < 0 ? (s = l) : w > 0 && (r = o), M < 0 ? (h = d) : M > 0 && (a = u), (x = gi)),
+                            L.attr("cursor", xi[m]),
+                            B());
+                          break;
+                        default:
+                          return;
+                      }
+                      di();
+                    },
+                    !0
+                  )
+                  .on("mousemove.brush", O, !0)
+                  .on("mouseup.brush", Y, !0);
+                It(t.event.view);
+              }
+              hi(), Mr(b), c.call(b), D.start();
+            }
+            function O() {
+              var t = Ot(b);
+              !P || y || _ || (Math.abs(t[0] - R[0]) > Math.abs(t[1] - R[1]) ? (_ = !0) : (y = !0)),
+                (R = t),
+                (g = !0),
+                di(),
+                B();
+            }
+            function B() {
+              var t;
+              switch (((p = R[0] - z[0]), (v = R[1] - z[1]), x)) {
+                case vi:
+                case pi:
+                  w && ((p = Math.max(S - r, Math.min(E - s, p))), (o = r + p), (l = s + p)),
+                    M && ((v = Math.max(k - a, Math.min(C - h, v))), (u = a + v), (d = h + v));
+                  break;
+                case gi:
+                  w < 0
+                    ? ((p = Math.max(S - r, Math.min(E - r, p))), (o = r + p), (l = s))
+                    : w > 0 && ((p = Math.max(S - s, Math.min(E - s, p))), (o = r), (l = s + p)),
+                    M < 0
+                      ? ((v = Math.max(k - a, Math.min(C - a, v))), (u = a + v), (d = h))
+                      : M > 0 && ((v = Math.max(k - h, Math.min(C - h, v))), (u = a), (d = h + v));
+                  break;
+                case yi:
+                  w && ((o = Math.max(S, Math.min(E, r - p * w))), (l = Math.max(S, Math.min(E, s + p * w)))),
+                    M && ((u = Math.max(k, Math.min(C, a - v * M))), (d = Math.max(k, Math.min(C, h + v * M))));
+              }
+              l < o &&
+                ((w *= -1),
+                (t = r),
+                (r = s),
+                (s = t),
+                (t = o),
+                (o = l),
+                (l = t),
+                m in wi && L.attr("cursor", xi[(m = wi[m])])),
+                d < u &&
+                  ((M *= -1),
+                  (t = a),
+                  (a = h),
+                  (h = t),
+                  (t = u),
+                  (u = d),
+                  (d = t),
+                  m in Mi && L.attr("cursor", xi[(m = Mi[m])])),
+                N.selection && (T = N.selection),
+                y && ((o = T[0][0]), (l = T[1][0])),
+                _ && ((u = T[0][1]), (d = T[1][1])),
+                (T[0][0] === o && T[0][1] === u && T[1][0] === l && T[1][1] === d) ||
+                  ((N.selection = [
+                    [o, u],
+                    [l, d],
+                  ]),
+                  c.call(b),
+                  D.brush());
+            }
+            function Y() {
+              if ((hi(), t.event.touches)) {
+                if (t.event.touches.length) return;
+                e && clearTimeout(e),
+                  (e = setTimeout(function () {
+                    e = null;
+                  }, 500)),
+                  q.on("touchmove.brush touchend.brush touchcancel.brush", null);
+              } else jt(t.event.view, g), U.on("keydown.brush keyup.brush mousemove.brush mouseup.brush", null);
+              q.attr("pointer-events", "all"),
+                L.attr("cursor", xi.overlay),
+                N.selection && (T = N.selection),
+                Ci(T) && ((N.selection = null), c.call(b)),
+                D.end();
+            }
+          }
+          function h() {
+            var t = this.__brush || { selection: null };
+            return (t.extent = r.apply(this, arguments)), (t.dim = n), t;
+          }
+          return (
+            (u.move = function (t, e) {
+              t.selection
+                ? t
+                    .on("start.brush", function () {
+                      f(this, arguments).beforestart().start();
+                    })
+                    .on("interrupt.brush end.brush", function () {
+                      f(this, arguments).end();
+                    })
+                    .tween("brush", function () {
+                      var t = this,
+                        r = t.__brush,
+                        i = f(t, arguments),
+                        o = r.selection,
+                        a = n.input("function" == typeof e ? e.apply(this, arguments) : e, r.extent),
+                        u = ye(o, a);
+                      function s(n) {
+                        (r.selection = 1 === n && Ci(a) ? null : u(n)), c.call(t), i.brush();
+                      }
+                      return o && a ? s : s(1);
+                    })
+                : t.each(function () {
+                    var t = arguments,
+                      r = this.__brush,
+                      i = n.input("function" == typeof e ? e.apply(this, t) : e, r.extent),
+                      o = f(this, t).beforestart();
+                    Mr(this), (r.selection = null == i || Ci(i) ? null : i), c.call(this), o.start().brush().end();
+                  });
+            }),
+            (s.prototype = {
+              beforestart: function () {
+                return 1 == ++this.active && ((this.state.emitter = this), (this.starting = !0)), this;
+              },
+              start: function () {
+                return this.starting && ((this.starting = !1), this.emit("start")), this;
+              },
+              brush: function () {
+                return this.emit("brush"), this;
+              },
+              end: function () {
+                return 0 == --this.active && (delete this.state.emitter, this.emit("end")), this;
+              },
+              emit: function (t) {
+                St(new li(u, t, n.output(this.state.selection)), o.apply, o, [t, this.that, this.args]);
+              },
+            }),
+            (u.extent = function (t) {
+              return arguments.length
+                ? ((r =
+                    "function" == typeof t
+                      ? t
+                      : si([
+                          [+t[0][0], +t[0][1]],
+                          [+t[1][0], +t[1][1]],
+                        ])),
+                  u)
+                : r;
+            }),
+            (u.filter = function (t) {
+              return arguments.length ? ((i = "function" == typeof t ? t : si(!!t)), u) : i;
+            }),
+            (u.handleSize = function (t) {
+              return arguments.length ? ((a = +t), u) : a;
+            }),
+            (u.on = function () {
+              var t = o.on.apply(o, arguments);
+              return t === o ? u : t;
+            }),
+            u
+          );
+        }
+        var zi = Math.cos,
+          Ri = Math.sin,
+          Di = Math.PI,
+          qi = Di / 2,
+          Li = 2 * Di,
+          Ui = Math.max;
+        var Oi = Array.prototype.slice;
+        function Bi(t) {
+          return function () {
+            return t;
+          };
+        }
+        var Yi = Math.PI,
+          Fi = 2 * Yi,
+          Ii = Fi - 1e-6;
+        function ji() {
+          (this._x0 = this._y0 = this._x1 = this._y1 = null), (this._ = "");
+        }
+        function Hi() {
+          return new ji();
+        }
+        function Xi(t) {
+          return t.source;
+        }
+        function Gi(t) {
+          return t.target;
+        }
+        function Vi(t) {
+          return t.radius;
+        }
+        function $i(t) {
+          return t.startAngle;
+        }
+        function Wi(t) {
+          return t.endAngle;
+        }
+        ji.prototype = Hi.prototype = {
+          constructor: ji,
+          moveTo: function (t, n) {
+            this._ += "M" + (this._x0 = this._x1 = +t) + "," + (this._y0 = this._y1 = +n);
+          },
+          closePath: function () {
+            null !== this._x1 && ((this._x1 = this._x0), (this._y1 = this._y0), (this._ += "Z"));
+          },
+          lineTo: function (t, n) {
+            this._ += "L" + (this._x1 = +t) + "," + (this._y1 = +n);
+          },
+          quadraticCurveTo: function (t, n, e, r) {
+            this._ += "Q" + +t + "," + +n + "," + (this._x1 = +e) + "," + (this._y1 = +r);
+          },
+          bezierCurveTo: function (t, n, e, r, i, o) {
+            this._ += "C" + +t + "," + +n + "," + +e + "," + +r + "," + (this._x1 = +i) + "," + (this._y1 = +o);
+          },
+          arcTo: function (t, n, e, r, i) {
+            (t = +t), (n = +n), (e = +e), (r = +r), (i = +i);
+            var o = this._x1,
+              a = this._y1,
+              u = e - t,
+              c = r - n,
+              f = o - t,
+              s = a - n,
+              l = f * f + s * s;
+            if (i < 0) throw new Error("negative radius: " + i);
+            if (null === this._x1) this._ += "M" + (this._x1 = t) + "," + (this._y1 = n);
+            else if (l > 1e-6)
+              if (Math.abs(s * u - c * f) > 1e-6 && i) {
+                var h = e - o,
+                  d = r - a,
+                  p = u * u + c * c,
+                  v = h * h + d * d,
+                  g = Math.sqrt(p),
+                  y = Math.sqrt(l),
+                  _ = i * Math.tan((Yi - Math.acos((p + l - v) / (2 * g * y))) / 2),
+                  b = _ / y,
+                  m = _ / g;
+                Math.abs(b - 1) > 1e-6 && (this._ += "L" + (t + b * f) + "," + (n + b * s)),
+                  (this._ +=
+                    "A" +
+                    i +
+                    "," +
+                    i +
+                    ",0,0," +
+                    +(s * h > f * d) +
+                    "," +
+                    (this._x1 = t + m * u) +
+                    "," +
+                    (this._y1 = n + m * c));
+              } else this._ += "L" + (this._x1 = t) + "," + (this._y1 = n);
+            else;
+          },
+          arc: function (t, n, e, r, i, o) {
+            (t = +t), (n = +n);
+            var a = (e = +e) * Math.cos(r),
+              u = e * Math.sin(r),
+              c = t + a,
+              f = n + u,
+              s = 1 ^ o,
+              l = o ? r - i : i - r;
+            if (e < 0) throw new Error("negative radius: " + e);
+            null === this._x1
+              ? (this._ += "M" + c + "," + f)
+              : (Math.abs(this._x1 - c) > 1e-6 || Math.abs(this._y1 - f) > 1e-6) && (this._ += "L" + c + "," + f),
+              e &&
+                (l < 0 && (l = (l % Fi) + Fi),
+                l > Ii
+                  ? (this._ +=
+                      "A" +
+                      e +
+                      "," +
+                      e +
+                      ",0,1," +
+                      s +
+                      "," +
+                      (t - a) +
+                      "," +
+                      (n - u) +
+                      "A" +
+                      e +
+                      "," +
+                      e +
+                      ",0,1," +
+                      s +
+                      "," +
+                      (this._x1 = c) +
+                      "," +
+                      (this._y1 = f))
+                  : l > 1e-6 &&
+                    (this._ +=
+                      "A" +
+                      e +
+                      "," +
+                      e +
+                      ",0," +
+                      +(l >= Yi) +
+                      "," +
+                      s +
+                      "," +
+                      (this._x1 = t + e * Math.cos(i)) +
+                      "," +
+                      (this._y1 = n + e * Math.sin(i))));
+          },
+          rect: function (t, n, e, r) {
+            this._ +=
+              "M" +
+              (this._x0 = this._x1 = +t) +
+              "," +
+              (this._y0 = this._y1 = +n) +
+              "h" +
+              +e +
+              "v" +
+              +r +
+              "h" +
+              -e +
+              "Z";
+          },
+          toString: function () {
+            return this._;
+          },
+        };
+        function Zi() {}
+        function Qi(t, n) {
+          var e = new Zi();
+          if (t instanceof Zi)
+            t.each(function (t, n) {
+              e.set(n, t);
+            });
+          else if (Array.isArray(t)) {
+            var r,
+              i = -1,
+              o = t.length;
+            if (null == n) for (; ++i < o; ) e.set(i, t[i]);
+            else for (; ++i < o; ) e.set(n((r = t[i]), i, t), r);
+          } else if (t) for (var a in t) e.set(a, t[a]);
+          return e;
+        }
+        function Ji() {
+          return {};
+        }
+        function Ki(t, n, e) {
+          t[n] = e;
+        }
+        function to() {
+          return Qi();
+        }
+        function no(t, n, e) {
+          t.set(n, e);
+        }
+        function eo() {}
+        Zi.prototype = Qi.prototype = {
+          constructor: Zi,
+          has: function (t) {
+            return "$" + t in this;
+          },
+          get: function (t) {
+            return this["$" + t];
+          },
+          set: function (t, n) {
+            return (this["$" + t] = n), this;
+          },
+          remove: function (t) {
+            var n = "$" + t;
+            return n in this && delete this[n];
+          },
+          clear: function () {
+            for (var t in this) "$" === t[0] && delete this[t];
+          },
+          keys: function () {
+            var t = [];
+            for (var n in this) "$" === n[0] && t.push(n.slice(1));
+            return t;
+          },
+          values: function () {
+            var t = [];
+            for (var n in this) "$" === n[0] && t.push(this[n]);
+            return t;
+          },
+          entries: function () {
+            var t = [];
+            for (var n in this) "$" === n[0] && t.push({ key: n.slice(1), value: this[n] });
+            return t;
+          },
+          size: function () {
+            var t = 0;
+            for (var n in this) "$" === n[0] && ++t;
+            return t;
+          },
+          empty: function () {
+            for (var t in this) if ("$" === t[0]) return !1;
+            return !0;
+          },
+          each: function (t) {
+            for (var n in this) "$" === n[0] && t(this[n], n.slice(1), this);
+          },
+        };
+        var ro = Qi.prototype;
+        function io(t, n) {
+          var e = new eo();
+          if (t instanceof eo)
+            t.each(function (t) {
+              e.add(t);
+            });
+          else if (t) {
+            var r = -1,
+              i = t.length;
+            if (null == n) for (; ++r < i; ) e.add(t[r]);
+            else for (; ++r < i; ) e.add(n(t[r], r, t));
+          }
+          return e;
+        }
+        eo.prototype = io.prototype = {
+          constructor: eo,
+          has: ro.has,
+          add: function (t) {
+            return (this["$" + (t += "")] = t), this;
+          },
+          remove: ro.remove,
+          clear: ro.clear,
+          values: ro.keys,
+          size: ro.size,
+          empty: ro.empty,
+          each: ro.each,
+        };
+        var oo = Array.prototype.slice;
+        function ao(t, n) {
+          return t - n;
+        }
+        function uo(t) {
+          return function () {
+            return t;
+          };
+        }
+        function co(t, n) {
+          for (var e, r = -1, i = n.length; ++r < i; ) if ((e = fo(t, n[r]))) return e;
+          return 0;
+        }
+        function fo(t, n) {
+          for (var e = n[0], r = n[1], i = -1, o = 0, a = t.length, u = a - 1; o < a; u = o++) {
+            var c = t[o],
+              f = c[0],
+              s = c[1],
+              l = t[u],
+              h = l[0],
+              d = l[1];
+            if (so(c, l, n)) return 0;
+            s > r != d > r && e < ((h - f) * (r - s)) / (d - s) + f && (i = -i);
+          }
+          return i;
+        }
+        function so(t, n, e) {
+          var r, i, o, a;
+          return (
+            (function (t, n, e) {
+              return (n[0] - t[0]) * (e[1] - t[1]) == (e[0] - t[0]) * (n[1] - t[1]);
+            })(t, n, e) &&
+            ((i = t[(r = +(t[0] === n[0]))]), (o = e[r]), (a = n[r]), (i <= o && o <= a) || (a <= o && o <= i))
+          );
+        }
+        function lo() {}
+        var ho = [
+          [],
+          [
+            [
+              [1, 1.5],
+              [0.5, 1],
+            ],
+          ],
+          [
+            [
+              [1.5, 1],
+              [1, 1.5],
+            ],
+          ],
+          [
+            [
+              [1.5, 1],
+              [0.5, 1],
+            ],
+          ],
+          [
+            [
+              [1, 0.5],
+              [1.5, 1],
+            ],
+          ],
+          [
+            [
+              [1, 1.5],
+              [0.5, 1],
+            ],
+            [
+              [1, 0.5],
+              [1.5, 1],
+            ],
+          ],
+          [
+            [
+              [1, 0.5],
+              [1, 1.5],
+            ],
+          ],
+          [
+            [
+              [1, 0.5],
+              [0.5, 1],
+            ],
+          ],
+          [
+            [
+              [0.5, 1],
+              [1, 0.5],
+            ],
+          ],
+          [
+            [
+              [1, 1.5],
+              [1, 0.5],
+            ],
+          ],
+          [
+            [
+              [0.5, 1],
+              [1, 0.5],
+            ],
+            [
+              [1.5, 1],
+              [1, 1.5],
+            ],
+          ],
+          [
+            [
+              [1.5, 1],
+              [1, 0.5],
+            ],
+          ],
+          [
+            [
+              [0.5, 1],
+              [1.5, 1],
+            ],
+          ],
+          [
+            [
+              [1, 1.5],
+              [1.5, 1],
+            ],
+          ],
+          [
+            [
+              [0.5, 1],
+              [1, 1.5],
+            ],
+          ],
+          [],
+        ];
+        function po() {
+          var t = 1,
+            n = 1,
+            e = M,
+            r = u;
+          function i(t) {
+            var n = e(t);
+            if (Array.isArray(n)) n = n.slice().sort(ao);
+            else {
+              var r = s(t),
+                i = r[0],
+                a = r[1];
+              (n = w(i, a, n)), (n = g(Math.floor(i / n) * n, Math.floor(a / n) * n, n));
+            }
+            return n.map(function (n) {
+              return o(t, n);
+            });
+          }
+          function o(e, i) {
+            var o = [],
+              u = [];
+            return (
+              (function (e, r, i) {
+                var o,
+                  u,
+                  c,
+                  f,
+                  s,
+                  l,
+                  h = new Array(),
+                  d = new Array();
+                (o = u = -1), (f = e[0] >= r), ho[f << 1].forEach(p);
+                for (; ++o < t - 1; ) (c = f), (f = e[o + 1] >= r), ho[c | (f << 1)].forEach(p);
+                ho[f << 0].forEach(p);
+                for (; ++u < n - 1; ) {
+                  for (
+                    o = -1, f = e[u * t + t] >= r, s = e[u * t] >= r, ho[(f << 1) | (s << 2)].forEach(p);
+                    ++o < t - 1;
+
+                  )
+                    (c = f),
+                      (f = e[u * t + t + o + 1] >= r),
+                      (l = s),
+                      (s = e[u * t + o + 1] >= r),
+                      ho[c | (f << 1) | (s << 2) | (l << 3)].forEach(p);
+                  ho[f | (s << 3)].forEach(p);
+                }
+                (o = -1), (s = e[u * t] >= r), ho[s << 2].forEach(p);
+                for (; ++o < t - 1; ) (l = s), (s = e[u * t + o + 1] >= r), ho[(s << 2) | (l << 3)].forEach(p);
+                function p(t) {
+                  var n,
+                    e,
+                    r = [t[0][0] + o, t[0][1] + u],
+                    c = [t[1][0] + o, t[1][1] + u],
+                    f = a(r),
+                    s = a(c);
+                  (n = d[f])
+                    ? (e = h[s])
+                      ? (delete d[n.end],
+                        delete h[e.start],
+                        n === e
+                          ? (n.ring.push(c), i(n.ring))
+                          : (h[n.start] = d[e.end] = { start: n.start, end: e.end, ring: n.ring.concat(e.ring) }))
+                      : (delete d[n.end], n.ring.push(c), (d[(n.end = s)] = n))
+                    : (n = h[s])
+                      ? (e = d[f])
+                        ? (delete h[n.start],
+                          delete d[e.end],
+                          n === e
+                            ? (n.ring.push(c), i(n.ring))
+                            : (h[e.start] = d[n.end] = { start: e.start, end: n.end, ring: e.ring.concat(n.ring) }))
+                        : (delete h[n.start], n.ring.unshift(r), (h[(n.start = f)] = n))
+                      : (h[f] = d[s] = { start: f, end: s, ring: [r, c] });
+                }
+                ho[s << 3].forEach(p);
+              })(e, i, function (t) {
+                r(t, e, i),
+                  (function (t) {
+                    for (var n = 0, e = t.length, r = t[e - 1][1] * t[0][0] - t[e - 1][0] * t[0][1]; ++n < e; )
+                      r += t[n - 1][1] * t[n][0] - t[n - 1][0] * t[n][1];
+                    return r;
+                  })(t) > 0
+                    ? o.push([t])
+                    : u.push(t);
+              }),
+              u.forEach(function (t) {
+                for (var n, e = 0, r = o.length; e < r; ++e) if (-1 !== co((n = o[e])[0], t)) return void n.push(t);
+              }),
+              { type: "MultiPolygon", value: i, coordinates: o }
+            );
+          }
+          function a(n) {
+            return 2 * n[0] + n[1] * (t + 1) * 4;
+          }
+          function u(e, r, i) {
+            e.forEach(function (e) {
+              var o,
+                a = e[0],
+                u = e[1],
+                c = 0 | a,
+                f = 0 | u,
+                s = r[f * t + c];
+              a > 0 && a < t && c === a && ((o = r[f * t + c - 1]), (e[0] = a + (i - o) / (s - o) - 0.5)),
+                u > 0 && u < n && f === u && ((o = r[(f - 1) * t + c]), (e[1] = u + (i - o) / (s - o) - 0.5));
+            });
+          }
+          return (
+            (i.contour = o),
+            (i.size = function (e) {
+              if (!arguments.length) return [t, n];
+              var r = Math.ceil(e[0]),
+                o = Math.ceil(e[1]);
+              if (!(r > 0 && o > 0)) throw new Error("invalid size");
+              return (t = r), (n = o), i;
+            }),
+            (i.thresholds = function (t) {
+              return arguments.length
+                ? ((e = "function" == typeof t ? t : Array.isArray(t) ? uo(oo.call(t)) : uo(t)), i)
+                : e;
+            }),
+            (i.smooth = function (t) {
+              return arguments.length ? ((r = t ? u : lo), i) : r === u;
+            }),
+            i
+          );
+        }
+        function vo(t, n, e) {
+          for (var r = t.width, i = t.height, o = 1 + (e << 1), a = 0; a < i; ++a)
+            for (var u = 0, c = 0; u < r + e; ++u)
+              u < r && (c += t.data[u + a * r]),
+                u >= e &&
+                  (u >= o && (c -= t.data[u - o + a * r]),
+                  (n.data[u - e + a * r] = c / Math.min(u + 1, r - 1 + o - u, o)));
+        }
+        function go(t, n, e) {
+          for (var r = t.width, i = t.height, o = 1 + (e << 1), a = 0; a < r; ++a)
+            for (var u = 0, c = 0; u < i + e; ++u)
+              u < i && (c += t.data[a + u * r]),
+                u >= e &&
+                  (u >= o && (c -= t.data[a + (u - o) * r]),
+                  (n.data[a + (u - e) * r] = c / Math.min(u + 1, i - 1 + o - u, o)));
+        }
+        function yo(t) {
+          return t[0];
+        }
+        function _o(t) {
+          return t[1];
+        }
+        function bo() {
+          return 1;
+        }
+        var mo = {},
+          xo = {},
+          wo = 34,
+          Mo = 10,
+          No = 13;
+        function Ao(t) {
+          return new Function(
+            "d",
+            "return {" +
+              t
+                .map(function (t, n) {
+                  return JSON.stringify(t) + ": d[" + n + "]";
+                })
+                .join(",") +
+              "}"
+          );
+        }
+        function To(t) {
+          var n = Object.create(null),
+            e = [];
+          return (
+            t.forEach(function (t) {
+              for (var r in t) r in n || e.push((n[r] = r));
+            }),
+            e
+          );
+        }
+        function So(t, n) {
+          var e = t + "",
+            r = e.length;
+          return r < n ? new Array(n - r + 1).join(0) + e : e;
+        }
+        function ko(t) {
+          var n,
+            e = t.getUTCHours(),
+            r = t.getUTCMinutes(),
+            i = t.getUTCSeconds(),
+            o = t.getUTCMilliseconds();
+          return isNaN(t)
+            ? "Invalid Date"
+            : ((n = t.getUTCFullYear()) < 0 ? "-" + So(-n, 6) : n > 9999 ? "+" + So(n, 6) : So(n, 4)) +
+                "-" +
+                So(t.getUTCMonth() + 1, 2) +
+                "-" +
+                So(t.getUTCDate(), 2) +
+                (o
+                  ? "T" + So(e, 2) + ":" + So(r, 2) + ":" + So(i, 2) + "." + So(o, 3) + "Z"
+                  : i
+                    ? "T" + So(e, 2) + ":" + So(r, 2) + ":" + So(i, 2) + "Z"
+                    : r || e
+                      ? "T" + So(e, 2) + ":" + So(r, 2) + "Z"
+                      : "");
+        }
+        function Eo(t) {
+          var n = new RegExp('["' + t + "\n\r]"),
+            e = t.charCodeAt(0);
+          function r(t, n) {
+            var r,
+              i = [],
+              o = t.length,
+              a = 0,
+              u = 0,
+              c = o <= 0,
+              f = !1;
+            function s() {
+              if (c) return xo;
+              if (f) return (f = !1), mo;
+              var n,
+                r,
+                i = a;
+              if (t.charCodeAt(i) === wo) {
+                for (; (a++ < o && t.charCodeAt(a) !== wo) || t.charCodeAt(++a) === wo; );
+                return (
+                  (n = a) >= o
+                    ? (c = !0)
+                    : (r = t.charCodeAt(a++)) === Mo
+                      ? (f = !0)
+                      : r === No && ((f = !0), t.charCodeAt(a) === Mo && ++a),
+                  t.slice(i + 1, n - 1).replace(/""/g, '"')
+                );
+              }
+              for (; a < o; ) {
+                if ((r = t.charCodeAt((n = a++))) === Mo) f = !0;
+                else if (r === No) (f = !0), t.charCodeAt(a) === Mo && ++a;
+                else if (r !== e) continue;
+                return t.slice(i, n);
+              }
+              return (c = !0), t.slice(i, o);
+            }
+            for (t.charCodeAt(o - 1) === Mo && --o, t.charCodeAt(o - 1) === No && --o; (r = s()) !== xo; ) {
+              for (var l = []; r !== mo && r !== xo; ) l.push(r), (r = s());
+              (n && null == (l = n(l, u++))) || i.push(l);
+            }
+            return i;
+          }
+          function i(n, e) {
+            return n.map(function (n) {
+              return e
+                .map(function (t) {
+                  return a(n[t]);
+                })
+                .join(t);
+            });
+          }
+          function o(n) {
+            return n.map(a).join(t);
+          }
+          function a(t) {
+            return null == t
+              ? ""
+              : t instanceof Date
+                ? ko(t)
+                : n.test((t += ""))
+                  ? '"' + t.replace(/"/g, '""') + '"'
+                  : t;
+          }
+          return {
+            parse: function (t, n) {
+              var e,
+                i,
+                o = r(t, function (t, r) {
+                  if (e) return e(t, r - 1);
+                  (i = t),
+                    (e = n
+                      ? (function (t, n) {
+                          var e = Ao(t);
+                          return function (r, i) {
+                            return n(e(r), i, t);
+                          };
+                        })(t, n)
+                      : Ao(t));
+                });
+              return (o.columns = i || []), o;
+            },
+            parseRows: r,
+            format: function (n, e) {
+              return null == e && (e = To(n)), [e.map(a).join(t)].concat(i(n, e)).join("\n");
+            },
+            formatBody: function (t, n) {
+              return null == n && (n = To(t)), i(t, n).join("\n");
+            },
+            formatRows: function (t) {
+              return t.map(o).join("\n");
+            },
+          };
+        }
+        var Co = Eo(","),
+          Po = Co.parse,
+          zo = Co.parseRows,
+          Ro = Co.format,
+          Do = Co.formatBody,
+          qo = Co.formatRows,
+          Lo = Eo("\t"),
+          Uo = Lo.parse,
+          Oo = Lo.parseRows,
+          Bo = Lo.format,
+          Yo = Lo.formatBody,
+          Fo = Lo.formatRows;
+        function Io(t) {
+          if (!t.ok) throw new Error(t.status + " " + t.statusText);
+          return t.blob();
+        }
+        function jo(t) {
+          if (!t.ok) throw new Error(t.status + " " + t.statusText);
+          return t.arrayBuffer();
+        }
+        function Ho(t) {
+          if (!t.ok) throw new Error(t.status + " " + t.statusText);
+          return t.text();
+        }
+        function Xo(t, n) {
+          return fetch(t, n).then(Ho);
+        }
+        function Go(t) {
+          return function (n, e, r) {
+            return (
+              2 === arguments.length && "function" == typeof e && ((r = e), (e = void 0)),
+              Xo(n, e).then(function (n) {
+                return t(n, r);
+              })
+            );
+          };
+        }
+        var Vo = Go(Po),
+          $o = Go(Uo);
+        function Wo(t) {
+          if (!t.ok) throw new Error(t.status + " " + t.statusText);
+          return t.json();
+        }
+        function Zo(t) {
+          return function (n, e) {
+            return Xo(n, e).then(function (n) {
+              return new DOMParser().parseFromString(n, t);
+            });
+          };
+        }
+        var Qo = Zo("application/xml"),
+          Jo = Zo("text/html"),
+          Ko = Zo("image/svg+xml");
+        function ta(t) {
+          return function () {
+            return t;
+          };
+        }
+        function na() {
+          return 1e-6 * (Math.random() - 0.5);
+        }
+        function ea(t, n, e, r) {
+          if (isNaN(n) || isNaN(e)) return t;
+          var i,
+            o,
+            a,
+            u,
+            c,
+            f,
+            s,
+            l,
+            h,
+            d = t._root,
+            p = { data: r },
+            v = t._x0,
+            g = t._y0,
+            y = t._x1,
+            _ = t._y1;
+          if (!d) return (t._root = p), t;
+          for (; d.length; )
+            if (
+              ((f = n >= (o = (v + y) / 2)) ? (v = o) : (y = o),
+              (s = e >= (a = (g + _) / 2)) ? (g = a) : (_ = a),
+              (i = d),
+              !(d = d[(l = (s << 1) | f)]))
+            )
+              return (i[l] = p), t;
+          if (((u = +t._x.call(null, d.data)), (c = +t._y.call(null, d.data)), n === u && e === c))
+            return (p.next = d), i ? (i[l] = p) : (t._root = p), t;
+          do {
+            (i = i ? (i[l] = new Array(4)) : (t._root = new Array(4))),
+              (f = n >= (o = (v + y) / 2)) ? (v = o) : (y = o),
+              (s = e >= (a = (g + _) / 2)) ? (g = a) : (_ = a);
+          } while ((l = (s << 1) | f) == (h = ((c >= a) << 1) | (u >= o)));
+          return (i[h] = d), (i[l] = p), t;
+        }
+        function ra(t, n, e, r, i) {
+          (this.node = t), (this.x0 = n), (this.y0 = e), (this.x1 = r), (this.y1 = i);
+        }
+        function ia(t) {
+          return t[0];
+        }
+        function oa(t) {
+          return t[1];
+        }
+        function aa(t, n, e) {
+          var r = new ua(null == n ? ia : n, null == e ? oa : e, NaN, NaN, NaN, NaN);
+          return null == t ? r : r.addAll(t);
+        }
+        function ua(t, n, e, r, i, o) {
+          (this._x = t),
+            (this._y = n),
+            (this._x0 = e),
+            (this._y0 = r),
+            (this._x1 = i),
+            (this._y1 = o),
+            (this._root = void 0);
+        }
+        function ca(t) {
+          for (var n = { data: t.data }, e = n; (t = t.next); ) e = e.next = { data: t.data };
+          return n;
+        }
+        var fa = (aa.prototype = ua.prototype);
+        function sa(t) {
+          return t.x + t.vx;
+        }
+        function la(t) {
+          return t.y + t.vy;
+        }
+        function ha(t) {
+          return t.index;
+        }
+        function da(t, n) {
+          var e = t.get(n);
+          if (!e) throw new Error("missing: " + n);
+          return e;
+        }
+        function pa(t) {
+          return t.x;
+        }
+        function va(t) {
+          return t.y;
+        }
+        (fa.copy = function () {
+          var t,
+            n,
+            e = new ua(this._x, this._y, this._x0, this._y0, this._x1, this._y1),
+            r = this._root;
+          if (!r) return e;
+          if (!r.length) return (e._root = ca(r)), e;
+          for (t = [{ source: r, target: (e._root = new Array(4)) }]; (r = t.pop()); )
+            for (var i = 0; i < 4; ++i)
+              (n = r.source[i]) &&
+                (n.length ? t.push({ source: n, target: (r.target[i] = new Array(4)) }) : (r.target[i] = ca(n)));
+          return e;
+        }),
+          (fa.add = function (t) {
+            var n = +this._x.call(null, t),
+              e = +this._y.call(null, t);
+            return ea(this.cover(n, e), n, e, t);
+          }),
+          (fa.addAll = function (t) {
+            var n,
+              e,
+              r,
+              i,
+              o = t.length,
+              a = new Array(o),
+              u = new Array(o),
+              c = 1 / 0,
+              f = 1 / 0,
+              s = -1 / 0,
+              l = -1 / 0;
+            for (e = 0; e < o; ++e)
+              isNaN((r = +this._x.call(null, (n = t[e])))) ||
+                isNaN((i = +this._y.call(null, n))) ||
+                ((a[e] = r), (u[e] = i), r < c && (c = r), r > s && (s = r), i < f && (f = i), i > l && (l = i));
+            if (c > s || f > l) return this;
+            for (this.cover(c, f).cover(s, l), e = 0; e < o; ++e) ea(this, a[e], u[e], t[e]);
+            return this;
+          }),
+          (fa.cover = function (t, n) {
+            if (isNaN((t = +t)) || isNaN((n = +n))) return this;
+            var e = this._x0,
+              r = this._y0,
+              i = this._x1,
+              o = this._y1;
+            if (isNaN(e)) (i = (e = Math.floor(t)) + 1), (o = (r = Math.floor(n)) + 1);
+            else {
+              for (var a, u, c = i - e, f = this._root; e > t || t >= i || r > n || n >= o; )
+                switch (((u = ((n < r) << 1) | (t < e)), ((a = new Array(4))[u] = f), (f = a), (c *= 2), u)) {
+                  case 0:
+                    (i = e + c), (o = r + c);
+                    break;
+                  case 1:
+                    (e = i - c), (o = r + c);
+                    break;
+                  case 2:
+                    (i = e + c), (r = o - c);
+                    break;
+                  case 3:
+                    (e = i - c), (r = o - c);
+                }
+              this._root && this._root.length && (this._root = f);
+            }
+            return (this._x0 = e), (this._y0 = r), (this._x1 = i), (this._y1 = o), this;
+          }),
+          (fa.data = function () {
+            var t = [];
+            return (
+              this.visit(function (n) {
+                if (!n.length)
+                  do {
+                    t.push(n.data);
+                  } while ((n = n.next));
+              }),
+              t
+            );
+          }),
+          (fa.extent = function (t) {
+            return arguments.length
+              ? this.cover(+t[0][0], +t[0][1]).cover(+t[1][0], +t[1][1])
+              : isNaN(this._x0)
+                ? void 0
+                : [
+                    [this._x0, this._y0],
+                    [this._x1, this._y1],
+                  ];
+          }),
+          (fa.find = function (t, n, e) {
+            var r,
+              i,
+              o,
+              a,
+              u,
+              c,
+              f,
+              s = this._x0,
+              l = this._y0,
+              h = this._x1,
+              d = this._y1,
+              p = [],
+              v = this._root;
+            for (
+              v && p.push(new ra(v, s, l, h, d)),
+                null == e ? (e = 1 / 0) : ((s = t - e), (l = n - e), (h = t + e), (d = n + e), (e *= e));
+              (c = p.pop());
+
+            )
+              if (!(!(v = c.node) || (i = c.x0) > h || (o = c.y0) > d || (a = c.x1) < s || (u = c.y1) < l))
+                if (v.length) {
+                  var g = (i + a) / 2,
+                    y = (o + u) / 2;
+                  p.push(
+                    new ra(v[3], g, y, a, u),
+                    new ra(v[2], i, y, g, u),
+                    new ra(v[1], g, o, a, y),
+                    new ra(v[0], i, o, g, y)
+                  ),
+                    (f = ((n >= y) << 1) | (t >= g)) &&
+                      ((c = p[p.length - 1]), (p[p.length - 1] = p[p.length - 1 - f]), (p[p.length - 1 - f] = c));
+                } else {
+                  var _ = t - +this._x.call(null, v.data),
+                    b = n - +this._y.call(null, v.data),
+                    m = _ * _ + b * b;
+                  if (m < e) {
+                    var x = Math.sqrt((e = m));
+                    (s = t - x), (l = n - x), (h = t + x), (d = n + x), (r = v.data);
+                  }
+                }
+            return r;
+          }),
+          (fa.remove = function (t) {
+            if (isNaN((o = +this._x.call(null, t))) || isNaN((a = +this._y.call(null, t)))) return this;
+            var n,
+              e,
+              r,
+              i,
+              o,
+              a,
+              u,
+              c,
+              f,
+              s,
+              l,
+              h,
+              d = this._root,
+              p = this._x0,
+              v = this._y0,
+              g = this._x1,
+              y = this._y1;
+            if (!d) return this;
+            if (d.length)
+              for (;;) {
+                if (
+                  ((f = o >= (u = (p + g) / 2)) ? (p = u) : (g = u),
+                  (s = a >= (c = (v + y) / 2)) ? (v = c) : (y = c),
+                  (n = d),
+                  !(d = d[(l = (s << 1) | f)]))
+                )
+                  return this;
+                if (!d.length) break;
+                (n[(l + 1) & 3] || n[(l + 2) & 3] || n[(l + 3) & 3]) && ((e = n), (h = l));
+              }
+            for (; d.data !== t; ) if (((r = d), !(d = d.next))) return this;
+            return (
+              (i = d.next) && delete d.next,
+              r
+                ? (i ? (r.next = i) : delete r.next, this)
+                : n
+                  ? (i ? (n[l] = i) : delete n[l],
+                    (d = n[0] || n[1] || n[2] || n[3]) &&
+                      d === (n[3] || n[2] || n[1] || n[0]) &&
+                      !d.length &&
+                      (e ? (e[h] = d) : (this._root = d)),
+                    this)
+                  : ((this._root = i), this)
+            );
+          }),
+          (fa.removeAll = function (t) {
+            for (var n = 0, e = t.length; n < e; ++n) this.remove(t[n]);
+            return this;
+          }),
+          (fa.root = function () {
+            return this._root;
+          }),
+          (fa.size = function () {
+            var t = 0;
+            return (
+              this.visit(function (n) {
+                if (!n.length)
+                  do {
+                    ++t;
+                  } while ((n = n.next));
+              }),
+              t
+            );
+          }),
+          (fa.visit = function (t) {
+            var n,
+              e,
+              r,
+              i,
+              o,
+              a,
+              u = [],
+              c = this._root;
+            for (c && u.push(new ra(c, this._x0, this._y0, this._x1, this._y1)); (n = u.pop()); )
+              if (!t((c = n.node), (r = n.x0), (i = n.y0), (o = n.x1), (a = n.y1)) && c.length) {
+                var f = (r + o) / 2,
+                  s = (i + a) / 2;
+                (e = c[3]) && u.push(new ra(e, f, s, o, a)),
+                  (e = c[2]) && u.push(new ra(e, r, s, f, a)),
+                  (e = c[1]) && u.push(new ra(e, f, i, o, s)),
+                  (e = c[0]) && u.push(new ra(e, r, i, f, s));
+              }
+            return this;
+          }),
+          (fa.visitAfter = function (t) {
+            var n,
+              e = [],
+              r = [];
+            for (this._root && e.push(new ra(this._root, this._x0, this._y0, this._x1, this._y1)); (n = e.pop()); ) {
+              var i = n.node;
+              if (i.length) {
+                var o,
+                  a = n.x0,
+                  u = n.y0,
+                  c = n.x1,
+                  f = n.y1,
+                  s = (a + c) / 2,
+                  l = (u + f) / 2;
+                (o = i[0]) && e.push(new ra(o, a, u, s, l)),
+                  (o = i[1]) && e.push(new ra(o, s, u, c, l)),
+                  (o = i[2]) && e.push(new ra(o, a, l, s, f)),
+                  (o = i[3]) && e.push(new ra(o, s, l, c, f));
+              }
+              r.push(n);
+            }
+            for (; (n = r.pop()); ) t(n.node, n.x0, n.y0, n.x1, n.y1);
+            return this;
+          }),
+          (fa.x = function (t) {
+            return arguments.length ? ((this._x = t), this) : this._x;
+          }),
+          (fa.y = function (t) {
+            return arguments.length ? ((this._y = t), this) : this._y;
+          });
+        var ga = 10,
+          ya = Math.PI * (3 - Math.sqrt(5));
+        function _a(t, n) {
+          if ((e = (t = n ? t.toExponential(n - 1) : t.toExponential()).indexOf("e")) < 0) return null;
+          var e,
+            r = t.slice(0, e);
+          return [r.length > 1 ? r[0] + r.slice(2) : r, +t.slice(e + 1)];
+        }
+        function ba(t) {
+          return (t = _a(Math.abs(t))) ? t[1] : NaN;
+        }
+        var ma,
+          xa = /^(?:(.)?([<>=^]))?([+\-( ])?([$#])?(0)?(\d+)?(,)?(\.\d+)?(~)?([a-z%])?$/i;
+        function wa(t) {
+          return new Ma(t);
+        }
+        function Ma(t) {
+          if (!(n = xa.exec(t))) throw new Error("invalid format: " + t);
+          var n;
+          (this.fill = n[1] || " "),
+            (this.align = n[2] || ">"),
+            (this.sign = n[3] || "-"),
+            (this.symbol = n[4] || ""),
+            (this.zero = !!n[5]),
+            (this.width = n[6] && +n[6]),
+            (this.comma = !!n[7]),
+            (this.precision = n[8] && +n[8].slice(1)),
+            (this.trim = !!n[9]),
+            (this.type = n[10] || "");
+        }
+        function Na(t, n) {
+          var e = _a(t, n);
+          if (!e) return t + "";
+          var r = e[0],
+            i = e[1];
+          return i < 0
+            ? "0." + new Array(-i).join("0") + r
+            : r.length > i + 1
+              ? r.slice(0, i + 1) + "." + r.slice(i + 1)
+              : r + new Array(i - r.length + 2).join("0");
+        }
+        (wa.prototype = Ma.prototype),
+          (Ma.prototype.toString = function () {
+            return (
+              this.fill +
+              this.align +
+              this.sign +
+              this.symbol +
+              (this.zero ? "0" : "") +
+              (null == this.width ? "" : Math.max(1, 0 | this.width)) +
+              (this.comma ? "," : "") +
+              (null == this.precision ? "" : "." + Math.max(0, 0 | this.precision)) +
+              (this.trim ? "~" : "") +
+              this.type
+            );
+          });
+        var Aa = {
+          "%": function (t, n) {
+            return (100 * t).toFixed(n);
+          },
+          b: function (t) {
+            return Math.round(t).toString(2);
+          },
+          c: function (t) {
+            return t + "";
+          },
+          d: function (t) {
+            return Math.round(t).toString(10);
+          },
+          e: function (t, n) {
+            return t.toExponential(n);
+          },
+          f: function (t, n) {
+            return t.toFixed(n);
+          },
+          g: function (t, n) {
+            return t.toPrecision(n);
+          },
+          o: function (t) {
+            return Math.round(t).toString(8);
+          },
+          p: function (t, n) {
+            return Na(100 * t, n);
+          },
+          r: Na,
+          s: function (t, n) {
+            var e = _a(t, n);
+            if (!e) return t + "";
+            var r = e[0],
+              i = e[1],
+              o = i - (ma = 3 * Math.max(-8, Math.min(8, Math.floor(i / 3)))) + 1,
+              a = r.length;
+            return o === a
+              ? r
+              : o > a
+                ? r + new Array(o - a + 1).join("0")
+                : o > 0
+                  ? r.slice(0, o) + "." + r.slice(o)
+                  : "0." + new Array(1 - o).join("0") + _a(t, Math.max(0, n + o - 1))[0];
+          },
+          X: function (t) {
+            return Math.round(t).toString(16).toUpperCase();
+          },
+          x: function (t) {
+            return Math.round(t).toString(16);
+          },
+        };
+        function Ta(t) {
+          return t;
+        }
+        var Sa,
+          ka = ["y", "z", "a", "f", "p", "n", "µ", "m", "", "k", "M", "G", "T", "P", "E", "Z", "Y"];
+        function Ea(t) {
+          var n,
+            e,
+            r =
+              t.grouping && t.thousands
+                ? ((n = t.grouping),
+                  (e = t.thousands),
+                  function (t, r) {
+                    for (
+                      var i = t.length, o = [], a = 0, u = n[0], c = 0;
+                      i > 0 &&
+                      u > 0 &&
+                      (c + u + 1 > r && (u = Math.max(1, r - c)),
+                      o.push(t.substring((i -= u), i + u)),
+                      !((c += u + 1) > r));
+
+                    )
+                      u = n[(a = (a + 1) % n.length)];
+                    return o.reverse().join(e);
+                  })
+                : Ta,
+            i = t.currency,
+            o = t.decimal,
+            a = t.numerals
+              ? (function (t) {
+                  return function (n) {
+                    return n.replace(/[0-9]/g, function (n) {
+                      return t[+n];
+                    });
+                  };
+                })(t.numerals)
+              : Ta,
+            u = t.percent || "%";
+          function c(t) {
+            var n = (t = wa(t)).fill,
+              e = t.align,
+              c = t.sign,
+              f = t.symbol,
+              s = t.zero,
+              l = t.width,
+              h = t.comma,
+              d = t.precision,
+              p = t.trim,
+              v = t.type;
+            "n" === v ? ((h = !0), (v = "g")) : Aa[v] || (null == d && (d = 12), (p = !0), (v = "g")),
+              (s || ("0" === n && "=" === e)) && ((s = !0), (n = "0"), (e = "="));
+            var g = "$" === f ? i[0] : "#" === f && /[boxX]/.test(v) ? "0" + v.toLowerCase() : "",
+              y = "$" === f ? i[1] : /[%p]/.test(v) ? u : "",
+              _ = Aa[v],
+              b = /[defgprs%]/.test(v);
+            function m(t) {
+              var i,
+                u,
+                f,
+                m = g,
+                x = y;
+              if ("c" === v) (x = _(t) + x), (t = "");
+              else {
+                var w = (t = +t) < 0;
+                if (
+                  ((t = _(Math.abs(t), d)),
+                  p &&
+                    (t = (function (t) {
+                      t: for (var n, e = t.length, r = 1, i = -1; r < e; ++r)
+                        switch (t[r]) {
+                          case ".":
+                            i = n = r;
+                            break;
+                          case "0":
+                            0 === i && (i = r), (n = r);
+                            break;
+                          default:
+                            if (i > 0) {
+                              if (!+t[r]) break t;
+                              i = 0;
+                            }
+                        }
+                      return i > 0 ? t.slice(0, i) + t.slice(n + 1) : t;
+                    })(t)),
+                  w && 0 == +t && (w = !1),
+                  (m = (w ? ("(" === c ? c : "-") : "-" === c || "(" === c ? "" : c) + m),
+                  (x = ("s" === v ? ka[8 + ma / 3] : "") + x + (w && "(" === c ? ")" : "")),
+                  b)
+                )
+                  for (i = -1, u = t.length; ++i < u; )
+                    if (48 > (f = t.charCodeAt(i)) || f > 57) {
+                      (x = (46 === f ? o + t.slice(i + 1) : t.slice(i)) + x), (t = t.slice(0, i));
+                      break;
+                    }
+              }
+              h && !s && (t = r(t, 1 / 0));
+              var M = m.length + t.length + x.length,
+                N = M < l ? new Array(l - M + 1).join(n) : "";
+              switch ((h && s && ((t = r(N + t, N.length ? l - x.length : 1 / 0)), (N = "")), e)) {
+                case "<":
+                  t = m + t + x + N;
+                  break;
+                case "=":
+                  t = m + N + t + x;
+                  break;
+                case "^":
+                  t = N.slice(0, (M = N.length >> 1)) + m + t + x + N.slice(M);
+                  break;
+                default:
+                  t = N + m + t + x;
+              }
+              return a(t);
+            }
+            return (
+              (d = null == d ? 6 : /[gprs]/.test(v) ? Math.max(1, Math.min(21, d)) : Math.max(0, Math.min(20, d))),
+              (m.toString = function () {
+                return t + "";
+              }),
+              m
+            );
+          }
+          return {
+            format: c,
+            formatPrefix: function (t, n) {
+              var e = c((((t = wa(t)).type = "f"), t)),
+                r = 3 * Math.max(-8, Math.min(8, Math.floor(ba(n) / 3))),
+                i = Math.pow(10, -r),
+                o = ka[8 + r / 3];
+              return function (t) {
+                return e(i * t) + o;
+              };
+            },
+          };
+        }
+        function Ca(n) {
+          return (Sa = Ea(n)), (t.format = Sa.format), (t.formatPrefix = Sa.formatPrefix), Sa;
+        }
+        function Pa(t) {
+          return Math.max(0, -ba(Math.abs(t)));
+        }
+        function za(t, n) {
+          return Math.max(0, 3 * Math.max(-8, Math.min(8, Math.floor(ba(n) / 3))) - ba(Math.abs(t)));
+        }
+        function Ra(t, n) {
+          return (t = Math.abs(t)), (n = Math.abs(n) - t), Math.max(0, ba(n) - ba(t)) + 1;
+        }
+        function Da() {
+          return new qa();
+        }
+        function qa() {
+          this.reset();
+        }
+        Ca({ decimal: ".", thousands: ",", grouping: [3], currency: ["$", ""] }),
+          (qa.prototype = {
+            constructor: qa,
+            reset: function () {
+              this.s = this.t = 0;
+            },
+            add: function (t) {
+              Ua(La, t, this.t), Ua(this, La.s, this.s), this.s ? (this.t += La.t) : (this.s = La.t);
+            },
+            valueOf: function () {
+              return this.s;
+            },
+          });
+        var La = new qa();
+        function Ua(t, n, e) {
+          var r = (t.s = n + e),
+            i = r - n,
+            o = r - i;
+          t.t = n - o + (e - i);
+        }
+        var Oa = 1e-6,
+          Ba = 1e-12,
+          Ya = Math.PI,
+          Fa = Ya / 2,
+          Ia = Ya / 4,
+          ja = 2 * Ya,
+          Ha = 180 / Ya,
+          Xa = Ya / 180,
+          Ga = Math.abs,
+          Va = Math.atan,
+          $a = Math.atan2,
+          Wa = Math.cos,
+          Za = Math.ceil,
+          Qa = Math.exp,
+          Ja = Math.log,
+          Ka = Math.pow,
+          tu = Math.sin,
+          nu =
+            Math.sign ||
+            function (t) {
+              return t > 0 ? 1 : t < 0 ? -1 : 0;
+            },
+          eu = Math.sqrt,
+          ru = Math.tan;
+        function iu(t) {
+          return t > 1 ? 0 : t < -1 ? Ya : Math.acos(t);
+        }
+        function ou(t) {
+          return t > 1 ? Fa : t < -1 ? -Fa : Math.asin(t);
+        }
+        function au(t) {
+          return (t = tu(t / 2)) * t;
+        }
+        function uu() {}
+        function cu(t, n) {
+          t && su.hasOwnProperty(t.type) && su[t.type](t, n);
+        }
+        var fu = {
+            Feature: function (t, n) {
+              cu(t.geometry, n);
+            },
+            FeatureCollection: function (t, n) {
+              for (var e = t.features, r = -1, i = e.length; ++r < i; ) cu(e[r].geometry, n);
+            },
+          },
+          su = {
+            Sphere: function (t, n) {
+              n.sphere();
+            },
+            Point: function (t, n) {
+              (t = t.coordinates), n.point(t[0], t[1], t[2]);
+            },
+            MultiPoint: function (t, n) {
+              for (var e = t.coordinates, r = -1, i = e.length; ++r < i; ) (t = e[r]), n.point(t[0], t[1], t[2]);
+            },
+            LineString: function (t, n) {
+              lu(t.coordinates, n, 0);
+            },
+            MultiLineString: function (t, n) {
+              for (var e = t.coordinates, r = -1, i = e.length; ++r < i; ) lu(e[r], n, 0);
+            },
+            Polygon: function (t, n) {
+              hu(t.coordinates, n);
+            },
+            MultiPolygon: function (t, n) {
+              for (var e = t.coordinates, r = -1, i = e.length; ++r < i; ) hu(e[r], n);
+            },
+            GeometryCollection: function (t, n) {
+              for (var e = t.geometries, r = -1, i = e.length; ++r < i; ) cu(e[r], n);
+            },
+          };
+        function lu(t, n, e) {
+          var r,
+            i = -1,
+            o = t.length - e;
+          for (n.lineStart(); ++i < o; ) (r = t[i]), n.point(r[0], r[1], r[2]);
+          n.lineEnd();
+        }
+        function hu(t, n) {
+          var e = -1,
+            r = t.length;
+          for (n.polygonStart(); ++e < r; ) lu(t[e], n, 1);
+          n.polygonEnd();
+        }
+        function du(t, n) {
+          t && fu.hasOwnProperty(t.type) ? fu[t.type](t, n) : cu(t, n);
+        }
+        var pu,
+          vu,
+          gu,
+          yu,
+          _u,
+          bu = Da(),
+          mu = Da(),
+          xu = {
+            point: uu,
+            lineStart: uu,
+            lineEnd: uu,
+            polygonStart: function () {
+              bu.reset(), (xu.lineStart = wu), (xu.lineEnd = Mu);
+            },
+            polygonEnd: function () {
+              var t = +bu;
+              mu.add(t < 0 ? ja + t : t), (this.lineStart = this.lineEnd = this.point = uu);
+            },
+            sphere: function () {
+              mu.add(ja);
+            },
+          };
+        function wu() {
+          xu.point = Nu;
+        }
+        function Mu() {
+          Au(pu, vu);
+        }
+        function Nu(t, n) {
+          (xu.point = Au), (pu = t), (vu = n), (gu = t *= Xa), (yu = Wa((n = (n *= Xa) / 2 + Ia))), (_u = tu(n));
+        }
+        function Au(t, n) {
+          var e = (t *= Xa) - gu,
+            r = e >= 0 ? 1 : -1,
+            i = r * e,
+            o = Wa((n = (n *= Xa) / 2 + Ia)),
+            a = tu(n),
+            u = _u * a,
+            c = yu * o + u * Wa(i),
+            f = u * r * tu(i);
+          bu.add($a(f, c)), (gu = t), (yu = o), (_u = a);
+        }
+        function Tu(t) {
+          return [$a(t[1], t[0]), ou(t[2])];
+        }
+        function Su(t) {
+          var n = t[0],
+            e = t[1],
+            r = Wa(e);
+          return [r * Wa(n), r * tu(n), tu(e)];
+        }
+        function ku(t, n) {
+          return t[0] * n[0] + t[1] * n[1] + t[2] * n[2];
+        }
+        function Eu(t, n) {
+          return [t[1] * n[2] - t[2] * n[1], t[2] * n[0] - t[0] * n[2], t[0] * n[1] - t[1] * n[0]];
+        }
+        function Cu(t, n) {
+          (t[0] += n[0]), (t[1] += n[1]), (t[2] += n[2]);
+        }
+        function Pu(t, n) {
+          return [t[0] * n, t[1] * n, t[2] * n];
+        }
+        function zu(t) {
+          var n = eu(t[0] * t[0] + t[1] * t[1] + t[2] * t[2]);
+          (t[0] /= n), (t[1] /= n), (t[2] /= n);
+        }
+        var Ru,
+          Du,
+          qu,
+          Lu,
+          Uu,
+          Ou,
+          Bu,
+          Yu,
+          Fu,
+          Iu,
+          ju,
+          Hu,
+          Xu,
+          Gu,
+          Vu,
+          $u,
+          Wu,
+          Zu,
+          Qu,
+          Ju,
+          Ku,
+          tc,
+          nc,
+          ec,
+          rc,
+          ic,
+          oc = Da(),
+          ac = {
+            point: uc,
+            lineStart: fc,
+            lineEnd: sc,
+            polygonStart: function () {
+              (ac.point = lc), (ac.lineStart = hc), (ac.lineEnd = dc), oc.reset(), xu.polygonStart();
+            },
+            polygonEnd: function () {
+              xu.polygonEnd(),
+                (ac.point = uc),
+                (ac.lineStart = fc),
+                (ac.lineEnd = sc),
+                bu < 0 ? ((Ru = -(qu = 180)), (Du = -(Lu = 90))) : oc > Oa ? (Lu = 90) : oc < -Oa && (Du = -90),
+                (Iu[0] = Ru),
+                (Iu[1] = qu);
+            },
+          };
+        function uc(t, n) {
+          Fu.push((Iu = [(Ru = t), (qu = t)])), n < Du && (Du = n), n > Lu && (Lu = n);
+        }
+        function cc(t, n) {
+          var e = Su([t * Xa, n * Xa]);
+          if (Yu) {
+            var r = Eu(Yu, e),
+              i = Eu([r[1], -r[0], 0], r);
+            zu(i), (i = Tu(i));
+            var o,
+              a = t - Uu,
+              u = a > 0 ? 1 : -1,
+              c = i[0] * Ha * u,
+              f = Ga(a) > 180;
+            f ^ (u * Uu < c && c < u * t)
+              ? (o = i[1] * Ha) > Lu && (Lu = o)
+              : f ^ (u * Uu < (c = ((c + 360) % 360) - 180) && c < u * t)
+                ? (o = -i[1] * Ha) < Du && (Du = o)
+                : (n < Du && (Du = n), n > Lu && (Lu = n)),
+              f
+                ? t < Uu
+                  ? pc(Ru, t) > pc(Ru, qu) && (qu = t)
+                  : pc(t, qu) > pc(Ru, qu) && (Ru = t)
+                : qu >= Ru
+                  ? (t < Ru && (Ru = t), t > qu && (qu = t))
+                  : t > Uu
+                    ? pc(Ru, t) > pc(Ru, qu) && (qu = t)
+                    : pc(t, qu) > pc(Ru, qu) && (Ru = t);
+          } else Fu.push((Iu = [(Ru = t), (qu = t)]));
+          n < Du && (Du = n), n > Lu && (Lu = n), (Yu = e), (Uu = t);
+        }
+        function fc() {
+          ac.point = cc;
+        }
+        function sc() {
+          (Iu[0] = Ru), (Iu[1] = qu), (ac.point = uc), (Yu = null);
+        }
+        function lc(t, n) {
+          if (Yu) {
+            var e = t - Uu;
+            oc.add(Ga(e) > 180 ? e + (e > 0 ? 360 : -360) : e);
+          } else (Ou = t), (Bu = n);
+          xu.point(t, n), cc(t, n);
+        }
+        function hc() {
+          xu.lineStart();
+        }
+        function dc() {
+          lc(Ou, Bu), xu.lineEnd(), Ga(oc) > Oa && (Ru = -(qu = 180)), (Iu[0] = Ru), (Iu[1] = qu), (Yu = null);
+        }
+        function pc(t, n) {
+          return (n -= t) < 0 ? n + 360 : n;
+        }
+        function vc(t, n) {
+          return t[0] - n[0];
+        }
+        function gc(t, n) {
+          return t[0] <= t[1] ? t[0] <= n && n <= t[1] : n < t[0] || t[1] < n;
+        }
+        var yc = {
+          sphere: uu,
+          point: _c,
+          lineStart: mc,
+          lineEnd: Mc,
+          polygonStart: function () {
+            (yc.lineStart = Nc), (yc.lineEnd = Ac);
+          },
+          polygonEnd: function () {
+            (yc.lineStart = mc), (yc.lineEnd = Mc);
+          },
+        };
+        function _c(t, n) {
+          t *= Xa;
+          var e = Wa((n *= Xa));
+          bc(e * Wa(t), e * tu(t), tu(n));
+        }
+        function bc(t, n, e) {
+          (Xu += (t - Xu) / ++ju), (Gu += (n - Gu) / ju), (Vu += (e - Vu) / ju);
+        }
+        function mc() {
+          yc.point = xc;
+        }
+        function xc(t, n) {
+          t *= Xa;
+          var e = Wa((n *= Xa));
+          (ec = e * Wa(t)), (rc = e * tu(t)), (ic = tu(n)), (yc.point = wc), bc(ec, rc, ic);
+        }
+        function wc(t, n) {
+          t *= Xa;
+          var e = Wa((n *= Xa)),
+            r = e * Wa(t),
+            i = e * tu(t),
+            o = tu(n),
+            a = $a(
+              eu((a = rc * o - ic * i) * a + (a = ic * r - ec * o) * a + (a = ec * i - rc * r) * a),
+              ec * r + rc * i + ic * o
+            );
+          (Hu += a),
+            ($u += a * (ec + (ec = r))),
+            (Wu += a * (rc + (rc = i))),
+            (Zu += a * (ic + (ic = o))),
+            bc(ec, rc, ic);
+        }
+        function Mc() {
+          yc.point = _c;
+        }
+        function Nc() {
+          yc.point = Tc;
+        }
+        function Ac() {
+          Sc(tc, nc), (yc.point = _c);
+        }
+        function Tc(t, n) {
+          (tc = t), (nc = n), (t *= Xa), (n *= Xa), (yc.point = Sc);
+          var e = Wa(n);
+          (ec = e * Wa(t)), (rc = e * tu(t)), (ic = tu(n)), bc(ec, rc, ic);
+        }
+        function Sc(t, n) {
+          t *= Xa;
+          var e = Wa((n *= Xa)),
+            r = e * Wa(t),
+            i = e * tu(t),
+            o = tu(n),
+            a = rc * o - ic * i,
+            u = ic * r - ec * o,
+            c = ec * i - rc * r,
+            f = eu(a * a + u * u + c * c),
+            s = ou(f),
+            l = f && -s / f;
+          (Qu += l * a),
+            (Ju += l * u),
+            (Ku += l * c),
+            (Hu += s),
+            ($u += s * (ec + (ec = r))),
+            (Wu += s * (rc + (rc = i))),
+            (Zu += s * (ic + (ic = o))),
+            bc(ec, rc, ic);
+        }
+        function kc(t) {
+          return function () {
+            return t;
+          };
+        }
+        function Ec(t, n) {
+          function e(e, r) {
+            return (e = t(e, r)), n(e[0], e[1]);
+          }
+          return (
+            t.invert &&
+              n.invert &&
+              (e.invert = function (e, r) {
+                return (e = n.invert(e, r)) && t.invert(e[0], e[1]);
+              }),
+            e
+          );
+        }
+        function Cc(t, n) {
+          return [Ga(t) > Ya ? t + Math.round(-t / ja) * ja : t, n];
+        }
+        function Pc(t, n, e) {
+          return (t %= ja) ? (n || e ? Ec(Rc(t), Dc(n, e)) : Rc(t)) : n || e ? Dc(n, e) : Cc;
+        }
+        function zc(t) {
+          return function (n, e) {
+            return [(n += t) > Ya ? n - ja : n < -Ya ? n + ja : n, e];
+          };
+        }
+        function Rc(t) {
+          var n = zc(t);
+          return (n.invert = zc(-t)), n;
+        }
+        function Dc(t, n) {
+          var e = Wa(t),
+            r = tu(t),
+            i = Wa(n),
+            o = tu(n);
+          function a(t, n) {
+            var a = Wa(n),
+              u = Wa(t) * a,
+              c = tu(t) * a,
+              f = tu(n),
+              s = f * e + u * r;
+            return [$a(c * i - s * o, u * e - f * r), ou(s * i + c * o)];
+          }
+          return (
+            (a.invert = function (t, n) {
+              var a = Wa(n),
+                u = Wa(t) * a,
+                c = tu(t) * a,
+                f = tu(n),
+                s = f * i - c * o;
+              return [$a(c * i + f * o, u * e + s * r), ou(s * e - u * r)];
+            }),
+            a
+          );
+        }
+        function qc(t) {
+          function n(n) {
+            return ((n = t(n[0] * Xa, n[1] * Xa))[0] *= Ha), (n[1] *= Ha), n;
+          }
+          return (
+            (t = Pc(t[0] * Xa, t[1] * Xa, t.length > 2 ? t[2] * Xa : 0)),
+            (n.invert = function (n) {
+              return ((n = t.invert(n[0] * Xa, n[1] * Xa))[0] *= Ha), (n[1] *= Ha), n;
+            }),
+            n
+          );
+        }
+        function Lc(t, n, e, r, i, o) {
+          if (e) {
+            var a = Wa(n),
+              u = tu(n),
+              c = r * e;
+            null == i
+              ? ((i = n + r * ja), (o = n - c / 2))
+              : ((i = Uc(a, i)), (o = Uc(a, o)), (r > 0 ? i < o : i > o) && (i += r * ja));
+            for (var f, s = i; r > 0 ? s > o : s < o; s -= c)
+              (f = Tu([a, -u * Wa(s), -u * tu(s)])), t.point(f[0], f[1]);
+          }
+        }
+        function Uc(t, n) {
+          ((n = Su(n))[0] -= t), zu(n);
+          var e = iu(-n[1]);
+          return ((-n[2] < 0 ? -e : e) + ja - Oa) % ja;
+        }
+        function Oc() {
+          var t,
+            n = [];
+          return {
+            point: function (n, e) {
+              t.push([n, e]);
+            },
+            lineStart: function () {
+              n.push((t = []));
+            },
+            lineEnd: uu,
+            rejoin: function () {
+              n.length > 1 && n.push(n.pop().concat(n.shift()));
+            },
+            result: function () {
+              var e = n;
+              return (n = []), (t = null), e;
+            },
+          };
+        }
+        function Bc(t, n) {
+          return Ga(t[0] - n[0]) < Oa && Ga(t[1] - n[1]) < Oa;
+        }
+        function Yc(t, n, e, r) {
+          (this.x = t), (this.z = n), (this.o = e), (this.e = r), (this.v = !1), (this.n = this.p = null);
+        }
+        function Fc(t, n, e, r, i) {
+          var o,
+            a,
+            u = [],
+            c = [];
+          if (
+            (t.forEach(function (t) {
+              if (!((n = t.length - 1) <= 0)) {
+                var n,
+                  e,
+                  r = t[0],
+                  a = t[n];
+                if (Bc(r, a)) {
+                  for (i.lineStart(), o = 0; o < n; ++o) i.point((r = t[o])[0], r[1]);
+                  i.lineEnd();
+                } else
+                  u.push((e = new Yc(r, t, null, !0))),
+                    c.push((e.o = new Yc(r, null, e, !1))),
+                    u.push((e = new Yc(a, t, null, !1))),
+                    c.push((e.o = new Yc(a, null, e, !0)));
+              }
+            }),
+            u.length)
+          ) {
+            for (c.sort(n), Ic(u), Ic(c), o = 0, a = c.length; o < a; ++o) c[o].e = e = !e;
+            for (var f, s, l = u[0]; ; ) {
+              for (var h = l, d = !0; h.v; ) if ((h = h.n) === l) return;
+              (f = h.z), i.lineStart();
+              do {
+                if (((h.v = h.o.v = !0), h.e)) {
+                  if (d) for (o = 0, a = f.length; o < a; ++o) i.point((s = f[o])[0], s[1]);
+                  else r(h.x, h.n.x, 1, i);
+                  h = h.n;
+                } else {
+                  if (d) for (f = h.p.z, o = f.length - 1; o >= 0; --o) i.point((s = f[o])[0], s[1]);
+                  else r(h.x, h.p.x, -1, i);
+                  h = h.p;
+                }
+                (f = (h = h.o).z), (d = !d);
+              } while (!h.v);
+              i.lineEnd();
+            }
+          }
+        }
+        function Ic(t) {
+          if ((n = t.length)) {
+            for (var n, e, r = 0, i = t[0]; ++r < n; ) (i.n = e = t[r]), (e.p = i), (i = e);
+            (i.n = e = t[0]), (e.p = i);
+          }
+        }
+        Cc.invert = Cc;
+        var jc = Da();
+        function Hc(t, n) {
+          var e = n[0],
+            r = n[1],
+            i = tu(r),
+            o = [tu(e), -Wa(e), 0],
+            a = 0,
+            u = 0;
+          jc.reset(), 1 === i ? (r = Fa + Oa) : -1 === i && (r = -Fa - Oa);
+          for (var c = 0, f = t.length; c < f; ++c)
+            if ((l = (s = t[c]).length))
+              for (
+                var s, l, h = s[l - 1], d = h[0], p = h[1] / 2 + Ia, v = tu(p), g = Wa(p), y = 0;
+                y < l;
+                ++y, d = b, v = x, g = w, h = _
+              ) {
+                var _ = s[y],
+                  b = _[0],
+                  m = _[1] / 2 + Ia,
+                  x = tu(m),
+                  w = Wa(m),
+                  M = b - d,
+                  N = M >= 0 ? 1 : -1,
+                  A = N * M,
+                  T = A > Ya,
+                  S = v * x;
+                if (
+                  (jc.add($a(S * N * tu(A), g * w + S * Wa(A))), (a += T ? M + N * ja : M), T ^ (d >= e) ^ (b >= e))
+                ) {
+                  var k = Eu(Su(h), Su(_));
+                  zu(k);
+                  var E = Eu(o, k);
+                  zu(E);
+                  var C = (T ^ (M >= 0) ? -1 : 1) * ou(E[2]);
+                  (r > C || (r === C && (k[0] || k[1]))) && (u += T ^ (M >= 0) ? 1 : -1);
+                }
+              }
+          return (a < -Oa || (a < Oa && jc < -Oa)) ^ (1 & u);
+        }
+        function Xc(t, n, e, r) {
+          return function (i) {
+            var o,
+              a,
+              u,
+              c = n(i),
+              f = Oc(),
+              s = n(f),
+              l = !1,
+              h = {
+                point: d,
+                lineStart: v,
+                lineEnd: g,
+                polygonStart: function () {
+                  (h.point = y), (h.lineStart = _), (h.lineEnd = b), (a = []), (o = []);
+                },
+                polygonEnd: function () {
+                  (h.point = d), (h.lineStart = v), (h.lineEnd = g), (a = T(a));
+                  var t = Hc(o, r);
+                  a.length
+                    ? (l || (i.polygonStart(), (l = !0)), Fc(a, Vc, t, e, i))
+                    : t && (l || (i.polygonStart(), (l = !0)), i.lineStart(), e(null, null, 1, i), i.lineEnd()),
+                    l && (i.polygonEnd(), (l = !1)),
+                    (a = o = null);
+                },
+                sphere: function () {
+                  i.polygonStart(), i.lineStart(), e(null, null, 1, i), i.lineEnd(), i.polygonEnd();
+                },
+              };
+            function d(n, e) {
+              t(n, e) && i.point(n, e);
+            }
+            function p(t, n) {
+              c.point(t, n);
+            }
+            function v() {
+              (h.point = p), c.lineStart();
+            }
+            function g() {
+              (h.point = d), c.lineEnd();
+            }
+            function y(t, n) {
+              u.push([t, n]), s.point(t, n);
+            }
+            function _() {
+              s.lineStart(), (u = []);
+            }
+            function b() {
+              y(u[0][0], u[0][1]), s.lineEnd();
+              var t,
+                n,
+                e,
+                r,
+                c = s.clean(),
+                h = f.result(),
+                d = h.length;
+              if ((u.pop(), o.push(u), (u = null), d))
+                if (1 & c) {
+                  if ((n = (e = h[0]).length - 1) > 0) {
+                    for (l || (i.polygonStart(), (l = !0)), i.lineStart(), t = 0; t < n; ++t)
+                      i.point((r = e[t])[0], r[1]);
+                    i.lineEnd();
+                  }
+                } else d > 1 && 2 & c && h.push(h.pop().concat(h.shift())), a.push(h.filter(Gc));
+            }
+            return h;
+          };
+        }
+        function Gc(t) {
+          return t.length > 1;
+        }
+        function Vc(t, n) {
+          return ((t = t.x)[0] < 0 ? t[1] - Fa - Oa : Fa - t[1]) - ((n = n.x)[0] < 0 ? n[1] - Fa - Oa : Fa - n[1]);
+        }
+        var $c = Xc(
+          function () {
+            return !0;
+          },
+          function (t) {
+            var n,
+              e = NaN,
+              r = NaN,
+              i = NaN;
+            return {
+              lineStart: function () {
+                t.lineStart(), (n = 1);
+              },
+              point: function (o, a) {
+                var u = o > 0 ? Ya : -Ya,
+                  c = Ga(o - e);
+                Ga(c - Ya) < Oa
+                  ? (t.point(e, (r = (r + a) / 2 > 0 ? Fa : -Fa)),
+                    t.point(i, r),
+                    t.lineEnd(),
+                    t.lineStart(),
+                    t.point(u, r),
+                    t.point(o, r),
+                    (n = 0))
+                  : i !== u &&
+                    c >= Ya &&
+                    (Ga(e - i) < Oa && (e -= i * Oa),
+                    Ga(o - u) < Oa && (o -= u * Oa),
+                    (r = (function (t, n, e, r) {
+                      var i,
+                        o,
+                        a = tu(t - e);
+                      return Ga(a) > Oa
+                        ? Va((tu(n) * (o = Wa(r)) * tu(e) - tu(r) * (i = Wa(n)) * tu(t)) / (i * o * a))
+                        : (n + r) / 2;
+                    })(e, r, o, a)),
+                    t.point(i, r),
+                    t.lineEnd(),
+                    t.lineStart(),
+                    t.point(u, r),
+                    (n = 0)),
+                  t.point((e = o), (r = a)),
+                  (i = u);
+              },
+              lineEnd: function () {
+                t.lineEnd(), (e = r = NaN);
+              },
+              clean: function () {
+                return 2 - n;
+              },
+            };
+          },
+          function (t, n, e, r) {
+            var i;
+            if (null == t)
+              (i = e * Fa),
+                r.point(-Ya, i),
+                r.point(0, i),
+                r.point(Ya, i),
+                r.point(Ya, 0),
+                r.point(Ya, -i),
+                r.point(0, -i),
+                r.point(-Ya, -i),
+                r.point(-Ya, 0),
+                r.point(-Ya, i);
+            else if (Ga(t[0] - n[0]) > Oa) {
+              var o = t[0] < n[0] ? Ya : -Ya;
+              (i = (e * o) / 2), r.point(-o, i), r.point(0, i), r.point(o, i);
+            } else r.point(n[0], n[1]);
+          },
+          [-Ya, -Fa]
+        );
+        function Wc(t) {
+          var n = Wa(t),
+            e = 6 * Xa,
+            r = n > 0,
+            i = Ga(n) > Oa;
+          function o(t, e) {
+            return Wa(t) * Wa(e) > n;
+          }
+          function a(t, e, r) {
+            var i = [1, 0, 0],
+              o = Eu(Su(t), Su(e)),
+              a = ku(o, o),
+              u = o[0],
+              c = a - u * u;
+            if (!c) return !r && t;
+            var f = (n * a) / c,
+              s = (-n * u) / c,
+              l = Eu(i, o),
+              h = Pu(i, f);
+            Cu(h, Pu(o, s));
+            var d = l,
+              p = ku(h, d),
+              v = ku(d, d),
+              g = p * p - v * (ku(h, h) - 1);
+            if (!(g < 0)) {
+              var y = eu(g),
+                _ = Pu(d, (-p - y) / v);
+              if ((Cu(_, h), (_ = Tu(_)), !r)) return _;
+              var b,
+                m = t[0],
+                x = e[0],
+                w = t[1],
+                M = e[1];
+              x < m && ((b = m), (m = x), (x = b));
+              var N = x - m,
+                A = Ga(N - Ya) < Oa;
+              if (
+                (!A && M < w && ((b = w), (w = M), (M = b)),
+                A || N < Oa
+                  ? A
+                    ? (w + M > 0) ^ (_[1] < (Ga(_[0] - m) < Oa ? w : M))
+                    : w <= _[1] && _[1] <= M
+                  : (N > Ya) ^ (m <= _[0] && _[0] <= x))
+              ) {
+                var T = Pu(d, (-p + y) / v);
+                return Cu(T, h), [_, Tu(T)];
+              }
+            }
+          }
+          function u(n, e) {
+            var i = r ? t : Ya - t,
+              o = 0;
+            return n < -i ? (o |= 1) : n > i && (o |= 2), e < -i ? (o |= 4) : e > i && (o |= 8), o;
+          }
+          return Xc(
+            o,
+            function (t) {
+              var n, e, c, f, s;
+              return {
+                lineStart: function () {
+                  (f = c = !1), (s = 1);
+                },
+                point: function (l, h) {
+                  var d,
+                    p = [l, h],
+                    v = o(l, h),
+                    g = r ? (v ? 0 : u(l, h)) : v ? u(l + (l < 0 ? Ya : -Ya), h) : 0;
+                  if (
+                    (!n && (f = c = v) && t.lineStart(),
+                    v !== c &&
+                      (!(d = a(n, p)) || Bc(n, d) || Bc(p, d)) &&
+                      ((p[0] += Oa), (p[1] += Oa), (v = o(p[0], p[1]))),
+                    v !== c)
+                  )
+                    (s = 0),
+                      v
+                        ? (t.lineStart(), (d = a(p, n)), t.point(d[0], d[1]))
+                        : ((d = a(n, p)), t.point(d[0], d[1]), t.lineEnd()),
+                      (n = d);
+                  else if (i && n && r ^ v) {
+                    var y;
+                    g & e ||
+                      !(y = a(p, n, !0)) ||
+                      ((s = 0),
+                      r
+                        ? (t.lineStart(), t.point(y[0][0], y[0][1]), t.point(y[1][0], y[1][1]), t.lineEnd())
+                        : (t.point(y[1][0], y[1][1]), t.lineEnd(), t.lineStart(), t.point(y[0][0], y[0][1])));
+                  }
+                  !v || (n && Bc(n, p)) || t.point(p[0], p[1]), (n = p), (c = v), (e = g);
+                },
+                lineEnd: function () {
+                  c && t.lineEnd(), (n = null);
+                },
+                clean: function () {
+                  return s | ((f && c) << 1);
+                },
+              };
+            },
+            function (n, r, i, o) {
+              Lc(o, t, e, i, n, r);
+            },
+            r ? [0, -t] : [-Ya, t - Ya]
+          );
+        }
+        var Zc = 1e9,
+          Qc = -Zc;
+        function Jc(t, n, e, r) {
+          function i(i, o) {
+            return t <= i && i <= e && n <= o && o <= r;
+          }
+          function o(i, o, u, f) {
+            var s = 0,
+              l = 0;
+            if (null == i || (s = a(i, u)) !== (l = a(o, u)) || (c(i, o) < 0) ^ (u > 0))
+              do {
+                f.point(0 === s || 3 === s ? t : e, s > 1 ? r : n);
+              } while ((s = (s + u + 4) % 4) !== l);
+            else f.point(o[0], o[1]);
+          }
+          function a(r, i) {
+            return Ga(r[0] - t) < Oa
+              ? i > 0
+                ? 0
+                : 3
+              : Ga(r[0] - e) < Oa
+                ? i > 0
+                  ? 2
+                  : 1
+                : Ga(r[1] - n) < Oa
+                  ? i > 0
+                    ? 1
+                    : 0
+                  : i > 0
+                    ? 3
+                    : 2;
+          }
+          function u(t, n) {
+            return c(t.x, n.x);
+          }
+          function c(t, n) {
+            var e = a(t, 1),
+              r = a(n, 1);
+            return e !== r
+              ? e - r
+              : 0 === e
+                ? n[1] - t[1]
+                : 1 === e
+                  ? t[0] - n[0]
+                  : 2 === e
+                    ? t[1] - n[1]
+                    : n[0] - t[0];
+          }
+          return function (a) {
+            var c,
+              f,
+              s,
+              l,
+              h,
+              d,
+              p,
+              v,
+              g,
+              y,
+              _,
+              b = a,
+              m = Oc(),
+              x = {
+                point: w,
+                lineStart: function () {
+                  (x.point = M), f && f.push((s = []));
+                  (y = !0), (g = !1), (p = v = NaN);
+                },
+                lineEnd: function () {
+                  c && (M(l, h), d && g && m.rejoin(), c.push(m.result()));
+                  (x.point = w), g && b.lineEnd();
+                },
+                polygonStart: function () {
+                  (b = m), (c = []), (f = []), (_ = !0);
+                },
+                polygonEnd: function () {
+                  var n = (function () {
+                      for (var n = 0, e = 0, i = f.length; e < i; ++e)
+                        for (var o, a, u = f[e], c = 1, s = u.length, l = u[0], h = l[0], d = l[1]; c < s; ++c)
+                          (o = h),
+                            (a = d),
+                            (l = u[c]),
+                            (h = l[0]),
+                            (d = l[1]),
+                            a <= r
+                              ? d > r && (h - o) * (r - a) > (d - a) * (t - o) && ++n
+                              : d <= r && (h - o) * (r - a) < (d - a) * (t - o) && --n;
+                      return n;
+                    })(),
+                    e = _ && n,
+                    i = (c = T(c)).length;
+                  (e || i) &&
+                    (a.polygonStart(),
+                    e && (a.lineStart(), o(null, null, 1, a), a.lineEnd()),
+                    i && Fc(c, u, n, o, a),
+                    a.polygonEnd());
+                  (b = a), (c = f = s = null);
+                },
+              };
+            function w(t, n) {
+              i(t, n) && b.point(t, n);
+            }
+            function M(o, a) {
+              var u = i(o, a);
+              if ((f && s.push([o, a]), y)) (l = o), (h = a), (d = u), (y = !1), u && (b.lineStart(), b.point(o, a));
+              else if (u && g) b.point(o, a);
+              else {
+                var c = [(p = Math.max(Qc, Math.min(Zc, p))), (v = Math.max(Qc, Math.min(Zc, v)))],
+                  m = [(o = Math.max(Qc, Math.min(Zc, o))), (a = Math.max(Qc, Math.min(Zc, a)))];
+                !(function (t, n, e, r, i, o) {
+                  var a,
+                    u = t[0],
+                    c = t[1],
+                    f = 0,
+                    s = 1,
+                    l = n[0] - u,
+                    h = n[1] - c;
+                  if (((a = e - u), l || !(a > 0))) {
+                    if (((a /= l), l < 0)) {
+                      if (a < f) return;
+                      a < s && (s = a);
+                    } else if (l > 0) {
+                      if (a > s) return;
+                      a > f && (f = a);
+                    }
+                    if (((a = i - u), l || !(a < 0))) {
+                      if (((a /= l), l < 0)) {
+                        if (a > s) return;
+                        a > f && (f = a);
+                      } else if (l > 0) {
+                        if (a < f) return;
+                        a < s && (s = a);
+                      }
+                      if (((a = r - c), h || !(a > 0))) {
+                        if (((a /= h), h < 0)) {
+                          if (a < f) return;
+                          a < s && (s = a);
+                        } else if (h > 0) {
+                          if (a > s) return;
+                          a > f && (f = a);
+                        }
+                        if (((a = o - c), h || !(a < 0))) {
+                          if (((a /= h), h < 0)) {
+                            if (a > s) return;
+                            a > f && (f = a);
+                          } else if (h > 0) {
+                            if (a < f) return;
+                            a < s && (s = a);
+                          }
+                          return (
+                            f > 0 && ((t[0] = u + f * l), (t[1] = c + f * h)),
+                            s < 1 && ((n[0] = u + s * l), (n[1] = c + s * h)),
+                            !0
+                          );
+                        }
+                      }
+                    }
+                  }
+                })(c, m, t, n, e, r)
+                  ? u && (b.lineStart(), b.point(o, a), (_ = !1))
+                  : (g || (b.lineStart(), b.point(c[0], c[1])), b.point(m[0], m[1]), u || b.lineEnd(), (_ = !1));
+              }
+              (p = o), (v = a), (g = u);
+            }
+            return x;
+          };
+        }
+        var Kc,
+          tf,
+          nf,
+          ef = Da(),
+          rf = {
+            sphere: uu,
+            point: uu,
+            lineStart: function () {
+              (rf.point = af), (rf.lineEnd = of);
+            },
+            lineEnd: uu,
+            polygonStart: uu,
+            polygonEnd: uu,
+          };
+        function of() {
+          rf.point = rf.lineEnd = uu;
+        }
+        function af(t, n) {
+          (Kc = t *= Xa), (tf = tu((n *= Xa))), (nf = Wa(n)), (rf.point = uf);
+        }
+        function uf(t, n) {
+          t *= Xa;
+          var e = tu((n *= Xa)),
+            r = Wa(n),
+            i = Ga(t - Kc),
+            o = Wa(i),
+            a = r * tu(i),
+            u = nf * e - tf * r * o,
+            c = tf * e + nf * r * o;
+          ef.add($a(eu(a * a + u * u), c)), (Kc = t), (tf = e), (nf = r);
+        }
+        function cf(t) {
+          return ef.reset(), du(t, rf), +ef;
+        }
+        var ff = [null, null],
+          sf = { type: "LineString", coordinates: ff };
+        function lf(t, n) {
+          return (ff[0] = t), (ff[1] = n), cf(sf);
+        }
+        var hf = {
+            Feature: function (t, n) {
+              return pf(t.geometry, n);
+            },
+            FeatureCollection: function (t, n) {
+              for (var e = t.features, r = -1, i = e.length; ++r < i; ) if (pf(e[r].geometry, n)) return !0;
+              return !1;
+            },
+          },
+          df = {
+            Sphere: function () {
+              return !0;
+            },
+            Point: function (t, n) {
+              return vf(t.coordinates, n);
+            },
+            MultiPoint: function (t, n) {
+              for (var e = t.coordinates, r = -1, i = e.length; ++r < i; ) if (vf(e[r], n)) return !0;
+              return !1;
+            },
+            LineString: function (t, n) {
+              return gf(t.coordinates, n);
+            },
+            MultiLineString: function (t, n) {
+              for (var e = t.coordinates, r = -1, i = e.length; ++r < i; ) if (gf(e[r], n)) return !0;
+              return !1;
+            },
+            Polygon: function (t, n) {
+              return yf(t.coordinates, n);
+            },
+            MultiPolygon: function (t, n) {
+              for (var e = t.coordinates, r = -1, i = e.length; ++r < i; ) if (yf(e[r], n)) return !0;
+              return !1;
+            },
+            GeometryCollection: function (t, n) {
+              for (var e = t.geometries, r = -1, i = e.length; ++r < i; ) if (pf(e[r], n)) return !0;
+              return !1;
+            },
+          };
+        function pf(t, n) {
+          return !(!t || !df.hasOwnProperty(t.type)) && df[t.type](t, n);
+        }
+        function vf(t, n) {
+          return 0 === lf(t, n);
+        }
+        function gf(t, n) {
+          var e = lf(t[0], t[1]);
+          return lf(t[0], n) + lf(n, t[1]) <= e + Oa;
+        }
+        function yf(t, n) {
+          return !!Hc(t.map(_f), bf(n));
+        }
+        function _f(t) {
+          return (t = t.map(bf)).pop(), t;
+        }
+        function bf(t) {
+          return [t[0] * Xa, t[1] * Xa];
+        }
+        function mf(t, n, e) {
+          var r = g(t, n - Oa, e).concat(n);
+          return function (t) {
+            return r.map(function (n) {
+              return [t, n];
+            });
+          };
+        }
+        function xf(t, n, e) {
+          var r = g(t, n - Oa, e).concat(n);
+          return function (t) {
+            return r.map(function (n) {
+              return [n, t];
+            });
+          };
+        }
+        function wf() {
+          var t,
+            n,
+            e,
+            r,
+            i,
+            o,
+            a,
+            u,
+            c,
+            f,
+            s,
+            l,
+            h = 10,
+            d = h,
+            p = 90,
+            v = 360,
+            y = 2.5;
+          function _() {
+            return { type: "MultiLineString", coordinates: b() };
+          }
+          function b() {
+            return g(Za(r / p) * p, e, p)
+              .map(s)
+              .concat(g(Za(u / v) * v, a, v).map(l))
+              .concat(
+                g(Za(n / h) * h, t, h)
+                  .filter(function (t) {
+                    return Ga(t % p) > Oa;
+                  })
+                  .map(c)
+              )
+              .concat(
+                g(Za(o / d) * d, i, d)
+                  .filter(function (t) {
+                    return Ga(t % v) > Oa;
+                  })
+                  .map(f)
+              );
+          }
+          return (
+            (_.lines = function () {
+              return b().map(function (t) {
+                return { type: "LineString", coordinates: t };
+              });
+            }),
+            (_.outline = function () {
+              return {
+                type: "Polygon",
+                coordinates: [s(r).concat(l(a).slice(1), s(e).reverse().slice(1), l(u).reverse().slice(1))],
+              };
+            }),
+            (_.extent = function (t) {
+              return arguments.length ? _.extentMajor(t).extentMinor(t) : _.extentMinor();
+            }),
+            (_.extentMajor = function (t) {
+              return arguments.length
+                ? ((r = +t[0][0]),
+                  (e = +t[1][0]),
+                  (u = +t[0][1]),
+                  (a = +t[1][1]),
+                  r > e && ((t = r), (r = e), (e = t)),
+                  u > a && ((t = u), (u = a), (a = t)),
+                  _.precision(y))
+                : [
+                    [r, u],
+                    [e, a],
+                  ];
+            }),
+            (_.extentMinor = function (e) {
+              return arguments.length
+                ? ((n = +e[0][0]),
+                  (t = +e[1][0]),
+                  (o = +e[0][1]),
+                  (i = +e[1][1]),
+                  n > t && ((e = n), (n = t), (t = e)),
+                  o > i && ((e = o), (o = i), (i = e)),
+                  _.precision(y))
+                : [
+                    [n, o],
+                    [t, i],
+                  ];
+            }),
+            (_.step = function (t) {
+              return arguments.length ? _.stepMajor(t).stepMinor(t) : _.stepMinor();
+            }),
+            (_.stepMajor = function (t) {
+              return arguments.length ? ((p = +t[0]), (v = +t[1]), _) : [p, v];
+            }),
+            (_.stepMinor = function (t) {
+              return arguments.length ? ((h = +t[0]), (d = +t[1]), _) : [h, d];
+            }),
+            (_.precision = function (h) {
+              return arguments.length
+                ? ((y = +h), (c = mf(o, i, 90)), (f = xf(n, t, y)), (s = mf(u, a, 90)), (l = xf(r, e, y)), _)
+                : y;
+            }),
+            _.extentMajor([
+              [-180, -90 + Oa],
+              [180, 90 - Oa],
+            ]).extentMinor([
+              [-180, -80 - Oa],
+              [180, 80 + Oa],
+            ])
+          );
+        }
+        function Mf(t) {
+          return t;
+        }
+        var Nf,
+          Af,
+          Tf,
+          Sf,
+          kf = Da(),
+          Ef = Da(),
+          Cf = {
+            point: uu,
+            lineStart: uu,
+            lineEnd: uu,
+            polygonStart: function () {
+              (Cf.lineStart = Pf), (Cf.lineEnd = Df);
+            },
+            polygonEnd: function () {
+              (Cf.lineStart = Cf.lineEnd = Cf.point = uu), kf.add(Ga(Ef)), Ef.reset();
+            },
+            result: function () {
+              var t = kf / 2;
+              return kf.reset(), t;
+            },
+          };
+        function Pf() {
+          Cf.point = zf;
+        }
+        function zf(t, n) {
+          (Cf.point = Rf), (Nf = Tf = t), (Af = Sf = n);
+        }
+        function Rf(t, n) {
+          Ef.add(Sf * t - Tf * n), (Tf = t), (Sf = n);
+        }
+        function Df() {
+          Rf(Nf, Af);
+        }
+        var qf = 1 / 0,
+          Lf = qf,
+          Uf = -qf,
+          Of = Uf,
+          Bf = {
+            point: function (t, n) {
+              t < qf && (qf = t);
+              t > Uf && (Uf = t);
+              n < Lf && (Lf = n);
+              n > Of && (Of = n);
+            },
+            lineStart: uu,
+            lineEnd: uu,
+            polygonStart: uu,
+            polygonEnd: uu,
+            result: function () {
+              var t = [
+                [qf, Lf],
+                [Uf, Of],
+              ];
+              return (Uf = Of = -(Lf = qf = 1 / 0)), t;
+            },
+          };
+        var Yf,
+          Ff,
+          If,
+          jf,
+          Hf = 0,
+          Xf = 0,
+          Gf = 0,
+          Vf = 0,
+          $f = 0,
+          Wf = 0,
+          Zf = 0,
+          Qf = 0,
+          Jf = 0,
+          Kf = {
+            point: ts,
+            lineStart: ns,
+            lineEnd: is,
+            polygonStart: function () {
+              (Kf.lineStart = os), (Kf.lineEnd = as);
+            },
+            polygonEnd: function () {
+              (Kf.point = ts), (Kf.lineStart = ns), (Kf.lineEnd = is);
+            },
+            result: function () {
+              var t = Jf ? [Zf / Jf, Qf / Jf] : Wf ? [Vf / Wf, $f / Wf] : Gf ? [Hf / Gf, Xf / Gf] : [NaN, NaN];
+              return (Hf = Xf = Gf = Vf = $f = Wf = Zf = Qf = Jf = 0), t;
+            },
+          };
+        function ts(t, n) {
+          (Hf += t), (Xf += n), ++Gf;
+        }
+        function ns() {
+          Kf.point = es;
+        }
+        function es(t, n) {
+          (Kf.point = rs), ts((If = t), (jf = n));
+        }
+        function rs(t, n) {
+          var e = t - If,
+            r = n - jf,
+            i = eu(e * e + r * r);
+          (Vf += (i * (If + t)) / 2), ($f += (i * (jf + n)) / 2), (Wf += i), ts((If = t), (jf = n));
+        }
+        function is() {
+          Kf.point = ts;
+        }
+        function os() {
+          Kf.point = us;
+        }
+        function as() {
+          cs(Yf, Ff);
+        }
+        function us(t, n) {
+          (Kf.point = cs), ts((Yf = If = t), (Ff = jf = n));
+        }
+        function cs(t, n) {
+          var e = t - If,
+            r = n - jf,
+            i = eu(e * e + r * r);
+          (Vf += (i * (If + t)) / 2),
+            ($f += (i * (jf + n)) / 2),
+            (Wf += i),
+            (Zf += (i = jf * t - If * n) * (If + t)),
+            (Qf += i * (jf + n)),
+            (Jf += 3 * i),
+            ts((If = t), (jf = n));
+        }
+        function fs(t) {
+          this._context = t;
+        }
+        fs.prototype = {
+          _radius: 4.5,
+          pointRadius: function (t) {
+            return (this._radius = t), this;
+          },
+          polygonStart: function () {
+            this._line = 0;
+          },
+          polygonEnd: function () {
+            this._line = NaN;
+          },
+          lineStart: function () {
+            this._point = 0;
+          },
+          lineEnd: function () {
+            0 === this._line && this._context.closePath(), (this._point = NaN);
+          },
+          point: function (t, n) {
+            switch (this._point) {
+              case 0:
+                this._context.moveTo(t, n), (this._point = 1);
+                break;
+              case 1:
+                this._context.lineTo(t, n);
+                break;
+              default:
+                this._context.moveTo(t + this._radius, n), this._context.arc(t, n, this._radius, 0, ja);
+            }
+          },
+          result: uu,
+        };
+        var ss,
+          ls,
+          hs,
+          ds,
+          ps,
+          vs = Da(),
+          gs = {
+            point: uu,
+            lineStart: function () {
+              gs.point = ys;
+            },
+            lineEnd: function () {
+              ss && _s(ls, hs), (gs.point = uu);
+            },
+            polygonStart: function () {
+              ss = !0;
+            },
+            polygonEnd: function () {
+              ss = null;
+            },
+            result: function () {
+              var t = +vs;
+              return vs.reset(), t;
+            },
+          };
+        function ys(t, n) {
+          (gs.point = _s), (ls = ds = t), (hs = ps = n);
+        }
+        function _s(t, n) {
+          (ds -= t), (ps -= n), vs.add(eu(ds * ds + ps * ps)), (ds = t), (ps = n);
+        }
+        function bs() {
+          this._string = [];
+        }
+        function ms(t) {
+          return "m0," + t + "a" + t + "," + t + " 0 1,1 0," + -2 * t + "a" + t + "," + t + " 0 1,1 0," + 2 * t + "z";
+        }
+        function xs(t) {
+          return function (n) {
+            var e = new ws();
+            for (var r in t) e[r] = t[r];
+            return (e.stream = n), e;
+          };
+        }
+        function ws() {}
+        function Ms(t, n, e) {
+          var r = t.clipExtent && t.clipExtent();
+          return (
+            t.scale(150).translate([0, 0]),
+            null != r && t.clipExtent(null),
+            du(e, t.stream(Bf)),
+            n(Bf.result()),
+            null != r && t.clipExtent(r),
+            t
+          );
+        }
+        function Ns(t, n, e) {
+          return Ms(
+            t,
+            function (e) {
+              var r = n[1][0] - n[0][0],
+                i = n[1][1] - n[0][1],
+                o = Math.min(r / (e[1][0] - e[0][0]), i / (e[1][1] - e[0][1])),
+                a = +n[0][0] + (r - o * (e[1][0] + e[0][0])) / 2,
+                u = +n[0][1] + (i - o * (e[1][1] + e[0][1])) / 2;
+              t.scale(150 * o).translate([a, u]);
+            },
+            e
+          );
+        }
+        function As(t, n, e) {
+          return Ns(t, [[0, 0], n], e);
+        }
+        function Ts(t, n, e) {
+          return Ms(
+            t,
+            function (e) {
+              var r = +n,
+                i = r / (e[1][0] - e[0][0]),
+                o = (r - i * (e[1][0] + e[0][0])) / 2,
+                a = -i * e[0][1];
+              t.scale(150 * i).translate([o, a]);
+            },
+            e
+          );
+        }
+        function Ss(t, n, e) {
+          return Ms(
+            t,
+            function (e) {
+              var r = +n,
+                i = r / (e[1][1] - e[0][1]),
+                o = -i * e[0][0],
+                a = (r - i * (e[1][1] + e[0][1])) / 2;
+              t.scale(150 * i).translate([o, a]);
+            },
+            e
+          );
+        }
+        (bs.prototype = {
+          _radius: 4.5,
+          _circle: ms(4.5),
+          pointRadius: function (t) {
+            return (t = +t) !== this._radius && ((this._radius = t), (this._circle = null)), this;
+          },
+          polygonStart: function () {
+            this._line = 0;
+          },
+          polygonEnd: function () {
+            this._line = NaN;
+          },
+          lineStart: function () {
+            this._point = 0;
+          },
+          lineEnd: function () {
+            0 === this._line && this._string.push("Z"), (this._point = NaN);
+          },
+          point: function (t, n) {
+            switch (this._point) {
+              case 0:
+                this._string.push("M", t, ",", n), (this._point = 1);
+                break;
+              case 1:
+                this._string.push("L", t, ",", n);
+                break;
+              default:
+                null == this._circle && (this._circle = ms(this._radius)),
+                  this._string.push("M", t, ",", n, this._circle);
+            }
+          },
+          result: function () {
+            if (this._string.length) {
+              var t = this._string.join("");
+              return (this._string = []), t;
+            }
+            return null;
+          },
+        }),
+          (ws.prototype = {
+            constructor: ws,
+            point: function (t, n) {
+              this.stream.point(t, n);
+            },
+            sphere: function () {
+              this.stream.sphere();
+            },
+            lineStart: function () {
+              this.stream.lineStart();
+            },
+            lineEnd: function () {
+              this.stream.lineEnd();
+            },
+            polygonStart: function () {
+              this.stream.polygonStart();
+            },
+            polygonEnd: function () {
+              this.stream.polygonEnd();
+            },
+          });
+        var ks = 16,
+          Es = Wa(30 * Xa);
+        function Cs(t, n) {
+          return +n
+            ? (function (t, n) {
+                function e(r, i, o, a, u, c, f, s, l, h, d, p, v, g) {
+                  var y = f - r,
+                    _ = s - i,
+                    b = y * y + _ * _;
+                  if (b > 4 * n && v--) {
+                    var m = a + h,
+                      x = u + d,
+                      w = c + p,
+                      M = eu(m * m + x * x + w * w),
+                      N = ou((w /= M)),
+                      A = Ga(Ga(w) - 1) < Oa || Ga(o - l) < Oa ? (o + l) / 2 : $a(x, m),
+                      T = t(A, N),
+                      S = T[0],
+                      k = T[1],
+                      E = S - r,
+                      C = k - i,
+                      P = _ * E - y * C;
+                    ((P * P) / b > n || Ga((y * E + _ * C) / b - 0.5) > 0.3 || a * h + u * d + c * p < Es) &&
+                      (e(r, i, o, a, u, c, S, k, A, (m /= M), (x /= M), w, v, g),
+                      g.point(S, k),
+                      e(S, k, A, m, x, w, f, s, l, h, d, p, v, g));
+                  }
+                }
+                return function (n) {
+                  var r,
+                    i,
+                    o,
+                    a,
+                    u,
+                    c,
+                    f,
+                    s,
+                    l,
+                    h,
+                    d,
+                    p,
+                    v = {
+                      point: g,
+                      lineStart: y,
+                      lineEnd: b,
+                      polygonStart: function () {
+                        n.polygonStart(), (v.lineStart = m);
+                      },
+                      polygonEnd: function () {
+                        n.polygonEnd(), (v.lineStart = y);
+                      },
+                    };
+                  function g(e, r) {
+                    (e = t(e, r)), n.point(e[0], e[1]);
+                  }
+                  function y() {
+                    (s = NaN), (v.point = _), n.lineStart();
+                  }
+                  function _(r, i) {
+                    var o = Su([r, i]),
+                      a = t(r, i);
+                    e(s, l, f, h, d, p, (s = a[0]), (l = a[1]), (f = r), (h = o[0]), (d = o[1]), (p = o[2]), ks, n),
+                      n.point(s, l);
+                  }
+                  function b() {
+                    (v.point = g), n.lineEnd();
+                  }
+                  function m() {
+                    y(), (v.point = x), (v.lineEnd = w);
+                  }
+                  function x(t, n) {
+                    _((r = t), n), (i = s), (o = l), (a = h), (u = d), (c = p), (v.point = _);
+                  }
+                  function w() {
+                    e(s, l, f, h, d, p, i, o, r, a, u, c, ks, n), (v.lineEnd = b), b();
+                  }
+                  return v;
+                };
+              })(t, n)
+            : (function (t) {
+                return xs({
+                  point: function (n, e) {
+                    (n = t(n, e)), this.stream.point(n[0], n[1]);
+                  },
+                });
+              })(t);
+        }
+        var Ps = xs({
+          point: function (t, n) {
+            this.stream.point(t * Xa, n * Xa);
+          },
+        });
+        function zs(t, n, e, r) {
+          var i = Wa(r),
+            o = tu(r),
+            a = i * t,
+            u = o * t,
+            c = i / t,
+            f = o / t,
+            s = (o * e - i * n) / t,
+            l = (o * n + i * e) / t;
+          function h(t, r) {
+            return [a * t - u * r + n, e - u * t - a * r];
+          }
+          return (
+            (h.invert = function (t, n) {
+              return [c * t - f * n + s, l - f * t - c * n];
+            }),
+            h
+          );
+        }
+        function Rs(t) {
+          return Ds(function () {
+            return t;
+          })();
+        }
+        function Ds(t) {
+          var n,
+            e,
+            r,
+            i,
+            o,
+            a,
+            u,
+            c,
+            f,
+            s,
+            l = 150,
+            h = 480,
+            d = 250,
+            p = 0,
+            v = 0,
+            g = 0,
+            y = 0,
+            _ = 0,
+            b = 0,
+            m = null,
+            x = $c,
+            w = null,
+            M = Mf,
+            N = 0.5;
+          function A(t) {
+            return c(t[0] * Xa, t[1] * Xa);
+          }
+          function T(t) {
+            return (t = c.invert(t[0], t[1])) && [t[0] * Ha, t[1] * Ha];
+          }
+          function S() {
+            var t = zs(l, 0, 0, b).apply(null, n(p, v)),
+              r = (
+                b
+                  ? zs
+                  : function (t, n, e) {
+                      function r(r, i) {
+                        return [n + t * r, e - t * i];
+                      }
+                      return (
+                        (r.invert = function (r, i) {
+                          return [(r - n) / t, (e - i) / t];
+                        }),
+                        r
+                      );
+                    }
+              )(l, h - t[0], d - t[1], b);
+            return (e = Pc(g, y, _)), (u = Ec(n, r)), (c = Ec(e, u)), (a = Cs(u, N)), k();
+          }
+          function k() {
+            return (f = s = null), A;
+          }
+          return (
+            (A.stream = function (t) {
+              return f && s === t
+                ? f
+                : (f = Ps(
+                    (function (t) {
+                      return xs({
+                        point: function (n, e) {
+                          var r = t(n, e);
+                          return this.stream.point(r[0], r[1]);
+                        },
+                      });
+                    })(e)(x(a(M((s = t)))))
+                  ));
+            }),
+            (A.preclip = function (t) {
+              return arguments.length ? ((x = t), (m = void 0), k()) : x;
+            }),
+            (A.postclip = function (t) {
+              return arguments.length ? ((M = t), (w = r = i = o = null), k()) : M;
+            }),
+            (A.clipAngle = function (t) {
+              return arguments.length ? ((x = +t ? Wc((m = t * Xa)) : ((m = null), $c)), k()) : m * Ha;
+            }),
+            (A.clipExtent = function (t) {
+              return arguments.length
+                ? ((M =
+                    null == t
+                      ? ((w = r = i = o = null), Mf)
+                      : Jc((w = +t[0][0]), (r = +t[0][1]), (i = +t[1][0]), (o = +t[1][1]))),
+                  k())
+                : null == w
+                  ? null
+                  : [
+                      [w, r],
+                      [i, o],
+                    ];
+            }),
+            (A.scale = function (t) {
+              return arguments.length ? ((l = +t), S()) : l;
+            }),
+            (A.translate = function (t) {
+              return arguments.length ? ((h = +t[0]), (d = +t[1]), S()) : [h, d];
+            }),
+            (A.center = function (t) {
+              return arguments.length ? ((p = (t[0] % 360) * Xa), (v = (t[1] % 360) * Xa), S()) : [p * Ha, v * Ha];
+            }),
+            (A.rotate = function (t) {
+              return arguments.length
+                ? ((g = (t[0] % 360) * Xa), (y = (t[1] % 360) * Xa), (_ = t.length > 2 ? (t[2] % 360) * Xa : 0), S())
+                : [g * Ha, y * Ha, _ * Ha];
+            }),
+            (A.angle = function (t) {
+              return arguments.length ? ((b = (t % 360) * Xa), S()) : b * Ha;
+            }),
+            (A.precision = function (t) {
+              return arguments.length ? ((a = Cs(u, (N = t * t))), k()) : eu(N);
+            }),
+            (A.fitExtent = function (t, n) {
+              return Ns(A, t, n);
+            }),
+            (A.fitSize = function (t, n) {
+              return As(A, t, n);
+            }),
+            (A.fitWidth = function (t, n) {
+              return Ts(A, t, n);
+            }),
+            (A.fitHeight = function (t, n) {
+              return Ss(A, t, n);
+            }),
+            function () {
+              return (n = t.apply(this, arguments)), (A.invert = n.invert && T), S();
+            }
+          );
+        }
+        function qs(t) {
+          var n = 0,
+            e = Ya / 3,
+            r = Ds(t),
+            i = r(n, e);
+          return (
+            (i.parallels = function (t) {
+              return arguments.length ? r((n = t[0] * Xa), (e = t[1] * Xa)) : [n * Ha, e * Ha];
+            }),
+            i
+          );
+        }
+        function Ls(t, n) {
+          var e = tu(t),
+            r = (e + tu(n)) / 2;
+          if (Ga(r) < Oa)
+            return (function (t) {
+              var n = Wa(t);
+              function e(t, e) {
+                return [t * n, tu(e) / n];
+              }
+              return (
+                (e.invert = function (t, e) {
+                  return [t / n, ou(e * n)];
+                }),
+                e
+              );
+            })(t);
+          var i = 1 + e * (2 * r - e),
+            o = eu(i) / r;
+          function a(t, n) {
+            var e = eu(i - 2 * r * tu(n)) / r;
+            return [e * tu((t *= r)), o - e * Wa(t)];
+          }
+          return (
+            (a.invert = function (t, n) {
+              var e = o - n;
+              return [($a(t, Ga(e)) / r) * nu(e), ou((i - (t * t + e * e) * r * r) / (2 * r))];
+            }),
+            a
+          );
+        }
+        function Us() {
+          return qs(Ls).scale(155.424).center([0, 33.6442]);
+        }
+        function Os() {
+          return Us().parallels([29.5, 45.5]).scale(1070).translate([480, 250]).rotate([96, 0]).center([-0.6, 38.7]);
+        }
+        function Bs(t) {
+          return function (n, e) {
+            var r = Wa(n),
+              i = Wa(e),
+              o = t(r * i);
+            return [o * i * tu(n), o * tu(e)];
+          };
+        }
+        function Ys(t) {
+          return function (n, e) {
+            var r = eu(n * n + e * e),
+              i = t(r),
+              o = tu(i),
+              a = Wa(i);
+            return [$a(n * o, r * a), ou(r && (e * o) / r)];
+          };
+        }
+        var Fs = Bs(function (t) {
+          return eu(2 / (1 + t));
+        });
+        Fs.invert = Ys(function (t) {
+          return 2 * ou(t / 2);
+        });
+        var Is = Bs(function (t) {
+          return (t = iu(t)) && t / tu(t);
+        });
+        function js(t, n) {
+          return [t, Ja(ru((Fa + n) / 2))];
+        }
+        function Hs(t) {
+          var n,
+            e,
+            r,
+            i = Rs(t),
+            o = i.center,
+            a = i.scale,
+            u = i.translate,
+            c = i.clipExtent,
+            f = null;
+          function s() {
+            var o = Ya * a(),
+              u = i(qc(i.rotate()).invert([0, 0]));
+            return c(
+              null == f
+                ? [
+                    [u[0] - o, u[1] - o],
+                    [u[0] + o, u[1] + o],
+                  ]
+                : t === js
+                  ? [
+                      [Math.max(u[0] - o, f), n],
+                      [Math.min(u[0] + o, e), r],
+                    ]
+                  : [
+                      [f, Math.max(u[1] - o, n)],
+                      [e, Math.min(u[1] + o, r)],
+                    ]
+            );
+          }
+          return (
+            (i.scale = function (t) {
+              return arguments.length ? (a(t), s()) : a();
+            }),
+            (i.translate = function (t) {
+              return arguments.length ? (u(t), s()) : u();
+            }),
+            (i.center = function (t) {
+              return arguments.length ? (o(t), s()) : o();
+            }),
+            (i.clipExtent = function (t) {
+              return arguments.length
+                ? (null == t
+                    ? (f = n = e = r = null)
+                    : ((f = +t[0][0]), (n = +t[0][1]), (e = +t[1][0]), (r = +t[1][1])),
+                  s())
+                : null == f
+                  ? null
+                  : [
+                      [f, n],
+                      [e, r],
+                    ];
+            }),
+            s()
+          );
+        }
+        function Xs(t) {
+          return ru((Fa + t) / 2);
+        }
+        function Gs(t, n) {
+          var e = Wa(t),
+            r = t === n ? tu(t) : Ja(e / Wa(n)) / Ja(Xs(n) / Xs(t)),
+            i = (e * Ka(Xs(t), r)) / r;
+          if (!r) return js;
+          function o(t, n) {
+            i > 0 ? n < -Fa + Oa && (n = -Fa + Oa) : n > Fa - Oa && (n = Fa - Oa);
+            var e = i / Ka(Xs(n), r);
+            return [e * tu(r * t), i - e * Wa(r * t)];
+          }
+          return (
+            (o.invert = function (t, n) {
+              var e = i - n,
+                o = nu(r) * eu(t * t + e * e);
+              return [($a(t, Ga(e)) / r) * nu(e), 2 * Va(Ka(i / o, 1 / r)) - Fa];
+            }),
+            o
+          );
+        }
+        function Vs(t, n) {
+          return [t, n];
+        }
+        function $s(t, n) {
+          var e = Wa(t),
+            r = t === n ? tu(t) : (e - Wa(n)) / (n - t),
+            i = e / r + t;
+          if (Ga(r) < Oa) return Vs;
+          function o(t, n) {
+            var e = i - n,
+              o = r * t;
+            return [e * tu(o), i - e * Wa(o)];
+          }
+          return (
+            (o.invert = function (t, n) {
+              var e = i - n;
+              return [($a(t, Ga(e)) / r) * nu(e), i - nu(r) * eu(t * t + e * e)];
+            }),
+            o
+          );
+        }
+        (Is.invert = Ys(function (t) {
+          return t;
+        })),
+          (js.invert = function (t, n) {
+            return [t, 2 * Va(Qa(n)) - Fa];
+          }),
+          (Vs.invert = Vs);
+        var Ws = 1.340264,
+          Zs = -0.081106,
+          Qs = 893e-6,
+          Js = 0.003796,
+          Ks = eu(3) / 2;
+        function tl(t, n) {
+          var e = ou(Ks * tu(n)),
+            r = e * e,
+            i = r * r * r;
+          return [
+            (t * Wa(e)) / (Ks * (Ws + 3 * Zs * r + i * (7 * Qs + 9 * Js * r))),
+            e * (Ws + Zs * r + i * (Qs + Js * r)),
+          ];
+        }
+        function nl(t, n) {
+          var e = Wa(n),
+            r = Wa(t) * e;
+          return [(e * tu(t)) / r, tu(n) / r];
+        }
+        function el(t, n, e, r) {
+          return 1 === t && 1 === n && 0 === e && 0 === r
+            ? Mf
+            : xs({
+                point: function (i, o) {
+                  this.stream.point(i * t + e, o * n + r);
+                },
+              });
+        }
+        function rl(t, n) {
+          var e = n * n,
+            r = e * e;
+          return [
+            t * (0.8707 - 0.131979 * e + r * (r * (0.003971 * e - 0.001529 * r) - 0.013791)),
+            n * (1.007226 + e * (0.015085 + r * (0.028874 * e - 0.044475 - 0.005916 * r))),
+          ];
+        }
+        function il(t, n) {
+          return [Wa(n) * tu(t), tu(n)];
+        }
+        function ol(t, n) {
+          var e = Wa(n),
+            r = 1 + Wa(t) * e;
+          return [(e * tu(t)) / r, tu(n) / r];
+        }
+        function al(t, n) {
+          return [Ja(ru((Fa + n) / 2)), -t];
+        }
+        function ul(t, n) {
+          return t.parent === n.parent ? 1 : 2;
+        }
+        function cl(t, n) {
+          return t + n.x;
+        }
+        function fl(t, n) {
+          return Math.max(t, n.y);
+        }
+        function sl(t) {
+          var n = 0,
+            e = t.children,
+            r = e && e.length;
+          if (r) for (; --r >= 0; ) n += e[r].value;
+          else n = 1;
+          t.value = n;
+        }
+        function ll(t, n) {
+          var e,
+            r,
+            i,
+            o,
+            a,
+            u = new vl(t),
+            c = +t.value && (u.value = t.value),
+            f = [u];
+          for (null == n && (n = hl); (e = f.pop()); )
+            if ((c && (e.value = +e.data.value), (i = n(e.data)) && (a = i.length)))
+              for (e.children = new Array(a), o = a - 1; o >= 0; --o)
+                f.push((r = e.children[o] = new vl(i[o]))), (r.parent = e), (r.depth = e.depth + 1);
+          return u.eachBefore(pl);
+        }
+        function hl(t) {
+          return t.children;
+        }
+        function dl(t) {
+          t.data = t.data.data;
+        }
+        function pl(t) {
+          var n = 0;
+          do {
+            t.height = n;
+          } while ((t = t.parent) && t.height < ++n);
+        }
+        function vl(t) {
+          (this.data = t), (this.depth = this.height = 0), (this.parent = null);
+        }
+        (tl.invert = function (t, n) {
+          for (
+            var e, r = n, i = r * r, o = i * i * i, a = 0;
+            a < 12 &&
+            ((o =
+              (i =
+                (r -= e = (r * (Ws + Zs * i + o * (Qs + Js * i)) - n) / (Ws + 3 * Zs * i + o * (7 * Qs + 9 * Js * i))) *
+                r) *
+              i *
+              i),
+            !(Ga(e) < Ba));
+            ++a
+          );
+          return [(Ks * t * (Ws + 3 * Zs * i + o * (7 * Qs + 9 * Js * i))) / Wa(r), ou(tu(r) / Ks)];
+        }),
+          (nl.invert = Ys(Va)),
+          (rl.invert = function (t, n) {
+            var e,
+              r = n,
+              i = 25;
+            do {
+              var o = r * r,
+                a = o * o;
+              r -= e =
+                (r * (1.007226 + o * (0.015085 + a * (0.028874 * o - 0.044475 - 0.005916 * a))) - n) /
+                (1.007226 + o * (0.045255 + a * (0.259866 * o - 0.311325 - 0.005916 * 11 * a)));
+            } while (Ga(e) > Oa && --i > 0);
+            return [
+              t / (0.8707 + (o = r * r) * (o * (o * o * o * (0.003971 - 0.001529 * o) - 0.013791) - 0.131979)),
+              r,
+            ];
+          }),
+          (il.invert = Ys(ou)),
+          (ol.invert = Ys(function (t) {
+            return 2 * Va(t);
+          })),
+          (al.invert = function (t, n) {
+            return [-n, 2 * Va(Qa(t)) - Fa];
+          }),
+          (vl.prototype = ll.prototype =
+            {
+              constructor: vl,
+              count: function () {
+                return this.eachAfter(sl);
+              },
+              each: function (t) {
+                var n,
+                  e,
+                  r,
+                  i,
+                  o = this,
+                  a = [o];
+                do {
+                  for (n = a.reverse(), a = []; (o = n.pop()); )
+                    if ((t(o), (e = o.children))) for (r = 0, i = e.length; r < i; ++r) a.push(e[r]);
+                } while (a.length);
+                return this;
+              },
+              eachAfter: function (t) {
+                for (var n, e, r, i = this, o = [i], a = []; (i = o.pop()); )
+                  if ((a.push(i), (n = i.children))) for (e = 0, r = n.length; e < r; ++e) o.push(n[e]);
+                for (; (i = a.pop()); ) t(i);
+                return this;
+              },
+              eachBefore: function (t) {
+                for (var n, e, r = this, i = [r]; (r = i.pop()); )
+                  if ((t(r), (n = r.children))) for (e = n.length - 1; e >= 0; --e) i.push(n[e]);
+                return this;
+              },
+              sum: function (t) {
+                return this.eachAfter(function (n) {
+                  for (var e = +t(n.data) || 0, r = n.children, i = r && r.length; --i >= 0; ) e += r[i].value;
+                  n.value = e;
+                });
+              },
+              sort: function (t) {
+                return this.eachBefore(function (n) {
+                  n.children && n.children.sort(t);
+                });
+              },
+              path: function (t) {
+                for (
+                  var n = this,
+                    e = (function (t, n) {
+                      if (t === n) return t;
+                      var e = t.ancestors(),
+                        r = n.ancestors(),
+                        i = null;
+                      for (t = e.pop(), n = r.pop(); t === n; ) (i = t), (t = e.pop()), (n = r.pop());
+                      return i;
+                    })(n, t),
+                    r = [n];
+                  n !== e;
+
+                )
+                  (n = n.parent), r.push(n);
+                for (var i = r.length; t !== e; ) r.splice(i, 0, t), (t = t.parent);
+                return r;
+              },
+              ancestors: function () {
+                for (var t = this, n = [t]; (t = t.parent); ) n.push(t);
+                return n;
+              },
+              descendants: function () {
+                var t = [];
+                return (
+                  this.each(function (n) {
+                    t.push(n);
+                  }),
+                  t
+                );
+              },
+              leaves: function () {
+                var t = [];
+                return (
+                  this.eachBefore(function (n) {
+                    n.children || t.push(n);
+                  }),
+                  t
+                );
+              },
+              links: function () {
+                var t = this,
+                  n = [];
+                return (
+                  t.each(function (e) {
+                    e !== t && n.push({ source: e.parent, target: e });
+                  }),
+                  n
+                );
+              },
+              copy: function () {
+                return ll(this).eachBefore(dl);
+              },
+            });
+        var gl = Array.prototype.slice;
+        function yl(t) {
+          for (
+            var n,
+              e,
+              r = 0,
+              i = (t = (function (t) {
+                for (var n, e, r = t.length; r; )
+                  (e = (Math.random() * r--) | 0), (n = t[r]), (t[r] = t[e]), (t[e] = n);
+                return t;
+              })(gl.call(t))).length,
+              o = [];
+            r < i;
+
+          )
+            (n = t[r]), e && ml(e, n) ? ++r : ((e = wl((o = _l(o, n)))), (r = 0));
+          return e;
+        }
+        function _l(t, n) {
+          var e, r;
+          if (xl(n, t)) return [n];
+          for (e = 0; e < t.length; ++e) if (bl(n, t[e]) && xl(Ml(t[e], n), t)) return [t[e], n];
+          for (e = 0; e < t.length - 1; ++e)
+            for (r = e + 1; r < t.length; ++r)
+              if (bl(Ml(t[e], t[r]), n) && bl(Ml(t[e], n), t[r]) && bl(Ml(t[r], n), t[e]) && xl(Nl(t[e], t[r], n), t))
+                return [t[e], t[r], n];
+          throw new Error();
+        }
+        function bl(t, n) {
+          var e = t.r - n.r,
+            r = n.x - t.x,
+            i = n.y - t.y;
+          return e < 0 || e * e < r * r + i * i;
+        }
+        function ml(t, n) {
+          var e = t.r - n.r + 1e-6,
+            r = n.x - t.x,
+            i = n.y - t.y;
+          return e > 0 && e * e > r * r + i * i;
+        }
+        function xl(t, n) {
+          for (var e = 0; e < n.length; ++e) if (!ml(t, n[e])) return !1;
+          return !0;
+        }
+        function wl(t) {
+          switch (t.length) {
+            case 1:
+              return { x: (n = t[0]).x, y: n.y, r: n.r };
+            case 2:
+              return Ml(t[0], t[1]);
+            case 3:
+              return Nl(t[0], t[1], t[2]);
+          }
+          var n;
+        }
+        function Ml(t, n) {
+          var e = t.x,
+            r = t.y,
+            i = t.r,
+            o = n.x,
+            a = n.y,
+            u = n.r,
+            c = o - e,
+            f = a - r,
+            s = u - i,
+            l = Math.sqrt(c * c + f * f);
+          return { x: (e + o + (c / l) * s) / 2, y: (r + a + (f / l) * s) / 2, r: (l + i + u) / 2 };
+        }
+        function Nl(t, n, e) {
+          var r = t.x,
+            i = t.y,
+            o = t.r,
+            a = n.x,
+            u = n.y,
+            c = n.r,
+            f = e.x,
+            s = e.y,
+            l = e.r,
+            h = r - a,
+            d = r - f,
+            p = i - u,
+            v = i - s,
+            g = c - o,
+            y = l - o,
+            _ = r * r + i * i - o * o,
+            b = _ - a * a - u * u + c * c,
+            m = _ - f * f - s * s + l * l,
+            x = d * p - h * v,
+            w = (p * m - v * b) / (2 * x) - r,
+            M = (v * g - p * y) / x,
+            N = (d * b - h * m) / (2 * x) - i,
+            A = (h * y - d * g) / x,
+            T = M * M + A * A - 1,
+            S = 2 * (o + w * M + N * A),
+            k = w * w + N * N - o * o,
+            E = -(T ? (S + Math.sqrt(S * S - 4 * T * k)) / (2 * T) : k / S);
+          return { x: r + w + M * E, y: i + N + A * E, r: E };
+        }
+        function Al(t, n, e) {
+          var r,
+            i,
+            o,
+            a,
+            u = t.x - n.x,
+            c = t.y - n.y,
+            f = u * u + c * c;
+          f
+            ? ((i = n.r + e.r),
+              (i *= i),
+              (a = t.r + e.r),
+              i > (a *= a)
+                ? ((r = (f + a - i) / (2 * f)),
+                  (o = Math.sqrt(Math.max(0, a / f - r * r))),
+                  (e.x = t.x - r * u - o * c),
+                  (e.y = t.y - r * c + o * u))
+                : ((r = (f + i - a) / (2 * f)),
+                  (o = Math.sqrt(Math.max(0, i / f - r * r))),
+                  (e.x = n.x + r * u - o * c),
+                  (e.y = n.y + r * c + o * u)))
+            : ((e.x = n.x + e.r), (e.y = n.y));
+        }
+        function Tl(t, n) {
+          var e = t.r + n.r - 1e-6,
+            r = n.x - t.x,
+            i = n.y - t.y;
+          return e > 0 && e * e > r * r + i * i;
+        }
+        function Sl(t) {
+          var n = t._,
+            e = t.next._,
+            r = n.r + e.r,
+            i = (n.x * e.r + e.x * n.r) / r,
+            o = (n.y * e.r + e.y * n.r) / r;
+          return i * i + o * o;
+        }
+        function kl(t) {
+          (this._ = t), (this.next = null), (this.previous = null);
+        }
+        function El(t) {
+          if (!(i = t.length)) return 0;
+          var n, e, r, i, o, a, u, c, f, s, l;
+          if ((((n = t[0]).x = 0), (n.y = 0), !(i > 1))) return n.r;
+          if (((e = t[1]), (n.x = -e.r), (e.x = n.r), (e.y = 0), !(i > 2))) return n.r + e.r;
+          Al(e, n, (r = t[2])),
+            (n = new kl(n)),
+            (e = new kl(e)),
+            (r = new kl(r)),
+            (n.next = r.previous = e),
+            (e.next = n.previous = r),
+            (r.next = e.previous = n);
+          t: for (u = 3; u < i; ++u) {
+            Al(n._, e._, (r = t[u])), (r = new kl(r)), (c = e.next), (f = n.previous), (s = e._.r), (l = n._.r);
+            do {
+              if (s <= l) {
+                if (Tl(c._, r._)) {
+                  (e = c), (n.next = e), (e.previous = n), --u;
+                  continue t;
+                }
+                (s += c._.r), (c = c.next);
+              } else {
+                if (Tl(f._, r._)) {
+                  ((n = f).next = e), (e.previous = n), --u;
+                  continue t;
+                }
+                (l += f._.r), (f = f.previous);
+              }
+            } while (c !== f.next);
+            for (r.previous = n, r.next = e, n.next = e.previous = e = r, o = Sl(n); (r = r.next) !== e; )
+              (a = Sl(r)) < o && ((n = r), (o = a));
+            e = n.next;
+          }
+          for (n = [e._], r = e; (r = r.next) !== e; ) n.push(r._);
+          for (r = yl(n), u = 0; u < i; ++u) ((n = t[u]).x -= r.x), (n.y -= r.y);
+          return r.r;
+        }
+        function Cl(t) {
+          if ("function" != typeof t) throw new Error();
+          return t;
+        }
+        function Pl() {
+          return 0;
+        }
+        function zl(t) {
+          return function () {
+            return t;
+          };
+        }
+        function Rl(t) {
+          return Math.sqrt(t.value);
+        }
+        function Dl(t) {
+          return function (n) {
+            n.children || (n.r = Math.max(0, +t(n) || 0));
+          };
+        }
+        function ql(t, n) {
+          return function (e) {
+            if ((r = e.children)) {
+              var r,
+                i,
+                o,
+                a = r.length,
+                u = t(e) * n || 0;
+              if (u) for (i = 0; i < a; ++i) r[i].r += u;
+              if (((o = El(r)), u)) for (i = 0; i < a; ++i) r[i].r -= u;
+              e.r = o + u;
+            }
+          };
+        }
+        function Ll(t) {
+          return function (n) {
+            var e = n.parent;
+            (n.r *= t), e && ((n.x = e.x + t * n.x), (n.y = e.y + t * n.y));
+          };
+        }
+        function Ul(t) {
+          (t.x0 = Math.round(t.x0)), (t.y0 = Math.round(t.y0)), (t.x1 = Math.round(t.x1)), (t.y1 = Math.round(t.y1));
+        }
+        function Ol(t, n, e, r, i) {
+          for (var o, a = t.children, u = -1, c = a.length, f = t.value && (r - n) / t.value; ++u < c; )
+            ((o = a[u]).y0 = e), (o.y1 = i), (o.x0 = n), (o.x1 = n += o.value * f);
+        }
+        var Bl = "$",
+          Yl = { depth: -1 },
+          Fl = {};
+        function Il(t) {
+          return t.id;
+        }
+        function jl(t) {
+          return t.parentId;
+        }
+        function Hl(t, n) {
+          return t.parent === n.parent ? 1 : 2;
+        }
+        function Xl(t) {
+          var n = t.children;
+          return n ? n[0] : t.t;
+        }
+        function Gl(t) {
+          var n = t.children;
+          return n ? n[n.length - 1] : t.t;
+        }
+        function Vl(t, n, e) {
+          var r = e / (n.i - t.i);
+          (n.c -= r), (n.s += e), (t.c += r), (n.z += e), (n.m += e);
+        }
+        function $l(t, n, e) {
+          return t.a.parent === n.parent ? t.a : e;
+        }
+        function Wl(t, n) {
+          (this._ = t),
+            (this.parent = null),
+            (this.children = null),
+            (this.A = null),
+            (this.a = this),
+            (this.z = 0),
+            (this.m = 0),
+            (this.c = 0),
+            (this.s = 0),
+            (this.t = null),
+            (this.i = n);
+        }
+        function Zl(t, n, e, r, i) {
+          for (var o, a = t.children, u = -1, c = a.length, f = t.value && (i - e) / t.value; ++u < c; )
+            ((o = a[u]).x0 = n), (o.x1 = r), (o.y0 = e), (o.y1 = e += o.value * f);
+        }
+        Wl.prototype = Object.create(vl.prototype);
+        var Ql = (1 + Math.sqrt(5)) / 2;
+        function Jl(t, n, e, r, i, o) {
+          for (
+            var a, u, c, f, s, l, h, d, p, v, g, y = [], _ = n.children, b = 0, m = 0, x = _.length, w = n.value;
+            b < x;
+
+          ) {
+            (c = i - e), (f = o - r);
+            do {
+              s = _[m++].value;
+            } while (!s && m < x);
+            for (
+              l = h = s, g = s * s * (v = Math.max(f / c, c / f) / (w * t)), p = Math.max(h / g, g / l);
+              m < x;
+              ++m
+            ) {
+              if (
+                ((s += u = _[m].value),
+                u < l && (l = u),
+                u > h && (h = u),
+                (g = s * s * v),
+                (d = Math.max(h / g, g / l)) > p)
+              ) {
+                s -= u;
+                break;
+              }
+              p = d;
+            }
+            y.push((a = { value: s, dice: c < f, children: _.slice(b, m) })),
+              a.dice ? Ol(a, e, r, i, w ? (r += (f * s) / w) : o) : Zl(a, e, r, w ? (e += (c * s) / w) : i, o),
+              (w -= s),
+              (b = m);
+          }
+          return y;
+        }
+        var Kl = (function t(n) {
+          function e(t, e, r, i, o) {
+            Jl(n, t, e, r, i, o);
+          }
+          return (
+            (e.ratio = function (n) {
+              return t((n = +n) > 1 ? n : 1);
+            }),
+            e
+          );
+        })(Ql);
+        var th = (function t(n) {
+          function e(t, e, r, i, o) {
+            if ((a = t._squarify) && a.ratio === n)
+              for (var a, u, c, f, s, l = -1, h = a.length, d = t.value; ++l < h; ) {
+                for (c = (u = a[l]).children, f = u.value = 0, s = c.length; f < s; ++f) u.value += c[f].value;
+                u.dice
+                  ? Ol(u, e, r, i, (r += ((o - r) * u.value) / d))
+                  : Zl(u, e, r, (e += ((i - e) * u.value) / d), o),
+                  (d -= u.value);
+              }
+            else (t._squarify = a = Jl(n, t, e, r, i, o)), (a.ratio = n);
+          }
+          return (
+            (e.ratio = function (n) {
+              return t((n = +n) > 1 ? n : 1);
+            }),
+            e
+          );
+        })(Ql);
+        function nh(t, n) {
+          return t[0] - n[0] || t[1] - n[1];
+        }
+        function eh(t) {
+          for (var n, e, r, i = t.length, o = [0, 1], a = 2, u = 2; u < i; ++u) {
+            for (
+              ;
+              a > 1 &&
+              ((n = t[o[a - 2]]),
+              (e = t[o[a - 1]]),
+              (r = t[u]),
+              (e[0] - n[0]) * (r[1] - n[1]) - (e[1] - n[1]) * (r[0] - n[0]) <= 0);
+
+            )
+              --a;
+            o[a++] = u;
+          }
+          return o.slice(0, a);
+        }
+        function rh() {
+          return Math.random();
+        }
+        var ih = (function t(n) {
+            function e(t, e) {
+              return (
+                (t = null == t ? 0 : +t),
+                (e = null == e ? 1 : +e),
+                1 === arguments.length ? ((e = t), (t = 0)) : (e -= t),
+                function () {
+                  return n() * e + t;
+                }
+              );
+            }
+            return (e.source = t), e;
+          })(rh),
+          oh = (function t(n) {
+            function e(t, e) {
+              var r, i;
+              return (
+                (t = null == t ? 0 : +t),
+                (e = null == e ? 1 : +e),
+                function () {
+                  var o;
+                  if (null != r) (o = r), (r = null);
+                  else
+                    do {
+                      (r = 2 * n() - 1), (o = 2 * n() - 1), (i = r * r + o * o);
+                    } while (!i || i > 1);
+                  return t + e * o * Math.sqrt((-2 * Math.log(i)) / i);
+                }
+              );
+            }
+            return (e.source = t), e;
+          })(rh),
+          ah = (function t(n) {
+            function e() {
+              var t = oh.source(n).apply(this, arguments);
+              return function () {
+                return Math.exp(t());
+              };
+            }
+            return (e.source = t), e;
+          })(rh),
+          uh = (function t(n) {
+            function e(t) {
+              return function () {
+                for (var e = 0, r = 0; r < t; ++r) e += n();
+                return e;
+              };
+            }
+            return (e.source = t), e;
+          })(rh),
+          ch = (function t(n) {
+            function e(t) {
+              var e = uh.source(n)(t);
+              return function () {
+                return e() / t;
+              };
+            }
+            return (e.source = t), e;
+          })(rh),
+          fh = (function t(n) {
+            function e(t) {
+              return function () {
+                return -Math.log(1 - n()) / t;
+              };
+            }
+            return (e.source = t), e;
+          })(rh);
+        function sh(t, n) {
+          switch (arguments.length) {
+            case 0:
+              break;
+            case 1:
+              this.range(t);
+              break;
+            default:
+              this.range(n).domain(t);
+          }
+          return this;
+        }
+        function lh(t, n) {
+          switch (arguments.length) {
+            case 0:
+              break;
+            case 1:
+              this.interpolator(t);
+              break;
+            default:
+              this.interpolator(n).domain(t);
+          }
+          return this;
+        }
+        var hh = Array.prototype,
+          dh = hh.map,
+          ph = hh.slice,
+          vh = { name: "implicit" };
+        function gh() {
+          var t = Qi(),
+            n = [],
+            e = [],
+            r = vh;
+          function i(i) {
+            var o = i + "",
+              a = t.get(o);
+            if (!a) {
+              if (r !== vh) return r;
+              t.set(o, (a = n.push(i)));
+            }
+            return e[(a - 1) % e.length];
+          }
+          return (
+            (i.domain = function (e) {
+              if (!arguments.length) return n.slice();
+              (n = []), (t = Qi());
+              for (var r, o, a = -1, u = e.length; ++a < u; ) t.has((o = (r = e[a]) + "")) || t.set(o, n.push(r));
+              return i;
+            }),
+            (i.range = function (t) {
+              return arguments.length ? ((e = ph.call(t)), i) : e.slice();
+            }),
+            (i.unknown = function (t) {
+              return arguments.length ? ((r = t), i) : r;
+            }),
+            (i.copy = function () {
+              return gh(n, e).unknown(r);
+            }),
+            sh.apply(i, arguments),
+            i
+          );
+        }
+        function yh() {
+          var t,
+            n,
+            e = gh().unknown(void 0),
+            r = e.domain,
+            i = e.range,
+            o = [0, 1],
+            a = !1,
+            u = 0,
+            c = 0,
+            f = 0.5;
+          function s() {
+            var e = r().length,
+              s = o[1] < o[0],
+              l = o[s - 0],
+              h = o[1 - s];
+            (t = (h - l) / Math.max(1, e - u + 2 * c)),
+              a && (t = Math.floor(t)),
+              (l += (h - l - t * (e - u)) * f),
+              (n = t * (1 - u)),
+              a && ((l = Math.round(l)), (n = Math.round(n)));
+            var d = g(e).map(function (n) {
+              return l + t * n;
+            });
+            return i(s ? d.reverse() : d);
+          }
+          return (
+            delete e.unknown,
+            (e.domain = function (t) {
+              return arguments.length ? (r(t), s()) : r();
+            }),
+            (e.range = function (t) {
+              return arguments.length ? ((o = [+t[0], +t[1]]), s()) : o.slice();
+            }),
+            (e.rangeRound = function (t) {
+              return (o = [+t[0], +t[1]]), (a = !0), s();
+            }),
+            (e.bandwidth = function () {
+              return n;
+            }),
+            (e.step = function () {
+              return t;
+            }),
+            (e.round = function (t) {
+              return arguments.length ? ((a = !!t), s()) : a;
+            }),
+            (e.padding = function (t) {
+              return arguments.length ? ((u = Math.min(1, (c = +t))), s()) : u;
+            }),
+            (e.paddingInner = function (t) {
+              return arguments.length ? ((u = Math.min(1, t)), s()) : u;
+            }),
+            (e.paddingOuter = function (t) {
+              return arguments.length ? ((c = +t), s()) : c;
+            }),
+            (e.align = function (t) {
+              return arguments.length ? ((f = Math.max(0, Math.min(1, t))), s()) : f;
+            }),
+            (e.copy = function () {
+              return yh(r(), o).round(a).paddingInner(u).paddingOuter(c).align(f);
+            }),
+            sh.apply(s(), arguments)
+          );
+        }
+        function _h(t) {
+          return +t;
+        }
+        var bh = [0, 1];
+        function mh(t) {
+          return t;
+        }
+        function xh(t, n) {
+          return (n -= t = +t)
+            ? function (e) {
+                return (e - t) / n;
+              }
+            : ((e = isNaN(n) ? NaN : 0.5),
+              function () {
+                return e;
+              });
+          var e;
+        }
+        function wh(t) {
+          var n,
+            e = t[0],
+            r = t[t.length - 1];
+          return (
+            e > r && ((n = e), (e = r), (r = n)),
+            function (t) {
+              return Math.max(e, Math.min(r, t));
+            }
+          );
+        }
+        function Mh(t, n, e) {
+          var r = t[0],
+            i = t[1],
+            o = n[0],
+            a = n[1];
+          return (
+            i < r ? ((r = xh(i, r)), (o = e(a, o))) : ((r = xh(r, i)), (o = e(o, a))),
+            function (t) {
+              return o(r(t));
+            }
+          );
+        }
+        function Nh(t, n, e) {
+          var r = Math.min(t.length, n.length) - 1,
+            o = new Array(r),
+            a = new Array(r),
+            u = -1;
+          for (t[r] < t[0] && ((t = t.slice().reverse()), (n = n.slice().reverse())); ++u < r; )
+            (o[u] = xh(t[u], t[u + 1])), (a[u] = e(n[u], n[u + 1]));
+          return function (n) {
+            var e = i(t, n, 1, r) - 1;
+            return a[e](o[e](n));
+          };
+        }
+        function Ah(t, n) {
+          return n
+            .domain(t.domain())
+            .range(t.range())
+            .interpolate(t.interpolate())
+            .clamp(t.clamp())
+            .unknown(t.unknown());
+        }
+        function Th() {
+          var t,
+            n,
+            e,
+            r,
+            i,
+            o,
+            a = bh,
+            u = bh,
+            c = ye,
+            f = mh;
+          function s() {
+            return (r = Math.min(a.length, u.length) > 2 ? Nh : Mh), (i = o = null), l;
+          }
+          function l(n) {
+            return isNaN((n = +n)) ? e : (i || (i = r(a.map(t), u, c)))(t(f(n)));
+          }
+          return (
+            (l.invert = function (e) {
+              return f(n((o || (o = r(u, a.map(t), he)))(e)));
+            }),
+            (l.domain = function (t) {
+              return arguments.length ? ((a = dh.call(t, _h)), f === mh || (f = wh(a)), s()) : a.slice();
+            }),
+            (l.range = function (t) {
+              return arguments.length ? ((u = ph.call(t)), s()) : u.slice();
+            }),
+            (l.rangeRound = function (t) {
+              return (u = ph.call(t)), (c = _e), s();
+            }),
+            (l.clamp = function (t) {
+              return arguments.length ? ((f = t ? wh(a) : mh), l) : f !== mh;
+            }),
+            (l.interpolate = function (t) {
+              return arguments.length ? ((c = t), s()) : c;
+            }),
+            (l.unknown = function (t) {
+              return arguments.length ? ((e = t), l) : e;
+            }),
+            function (e, r) {
+              return (t = e), (n = r), s();
+            }
+          );
+        }
+        function Sh(t, n) {
+          return Th()(t, n);
+        }
+        function kh(n, e, r, i) {
+          var o,
+            a = w(n, e, r);
+          switch ((i = wa(null == i ? ",f" : i)).type) {
+            case "s":
+              var u = Math.max(Math.abs(n), Math.abs(e));
+              return null != i.precision || isNaN((o = za(a, u))) || (i.precision = o), t.formatPrefix(i, u);
+            case "":
+            case "e":
+            case "g":
+            case "p":
+            case "r":
+              null != i.precision ||
+                isNaN((o = Ra(a, Math.max(Math.abs(n), Math.abs(e))))) ||
+                (i.precision = o - ("e" === i.type));
+              break;
+            case "f":
+            case "%":
+              null != i.precision || isNaN((o = Pa(a))) || (i.precision = o - 2 * ("%" === i.type));
+          }
+          return t.format(i);
+        }
+        function Eh(t) {
+          var n = t.domain;
+          return (
+            (t.ticks = function (t) {
+              var e = n();
+              return m(e[0], e[e.length - 1], null == t ? 10 : t);
+            }),
+            (t.tickFormat = function (t, e) {
+              var r = n();
+              return kh(r[0], r[r.length - 1], null == t ? 10 : t, e);
+            }),
+            (t.nice = function (e) {
+              null == e && (e = 10);
+              var r,
+                i = n(),
+                o = 0,
+                a = i.length - 1,
+                u = i[o],
+                c = i[a];
+              return (
+                c < u && ((r = u), (u = c), (c = r), (r = o), (o = a), (a = r)),
+                (r = x(u, c, e)) > 0
+                  ? (r = x((u = Math.floor(u / r) * r), (c = Math.ceil(c / r) * r), e))
+                  : r < 0 && (r = x((u = Math.ceil(u * r) / r), (c = Math.floor(c * r) / r), e)),
+                r > 0
+                  ? ((i[o] = Math.floor(u / r) * r), (i[a] = Math.ceil(c / r) * r), n(i))
+                  : r < 0 && ((i[o] = Math.ceil(u * r) / r), (i[a] = Math.floor(c * r) / r), n(i)),
+                t
+              );
+            }),
+            t
+          );
+        }
+        function Ch(t, n) {
+          var e,
+            r = 0,
+            i = (t = t.slice()).length - 1,
+            o = t[r],
+            a = t[i];
+          return (
+            a < o && ((e = r), (r = i), (i = e), (e = o), (o = a), (a = e)), (t[r] = n.floor(o)), (t[i] = n.ceil(a)), t
+          );
+        }
+        function Ph(t) {
+          return Math.log(t);
+        }
+        function zh(t) {
+          return Math.exp(t);
+        }
+        function Rh(t) {
+          return -Math.log(-t);
+        }
+        function Dh(t) {
+          return -Math.exp(-t);
+        }
+        function qh(t) {
+          return isFinite(t) ? +("1e" + t) : t < 0 ? 0 : t;
+        }
+        function Lh(t) {
+          return function (n) {
+            return -t(-n);
+          };
+        }
+        function Uh(n) {
+          var e,
+            r,
+            i = n(Ph, zh),
+            o = i.domain,
+            a = 10;
+          function u() {
+            return (
+              (e = (function (t) {
+                return t === Math.E
+                  ? Math.log
+                  : (10 === t && Math.log10) ||
+                      (2 === t && Math.log2) ||
+                      ((t = Math.log(t)),
+                      function (n) {
+                        return Math.log(n) / t;
+                      });
+              })(a)),
+              (r = (function (t) {
+                return 10 === t
+                  ? qh
+                  : t === Math.E
+                    ? Math.exp
+                    : function (n) {
+                        return Math.pow(t, n);
+                      };
+              })(a)),
+              o()[0] < 0 ? ((e = Lh(e)), (r = Lh(r)), n(Rh, Dh)) : n(Ph, zh),
+              i
+            );
+          }
+          return (
+            (i.base = function (t) {
+              return arguments.length ? ((a = +t), u()) : a;
+            }),
+            (i.domain = function (t) {
+              return arguments.length ? (o(t), u()) : o();
+            }),
+            (i.ticks = function (t) {
+              var n,
+                i = o(),
+                u = i[0],
+                c = i[i.length - 1];
+              (n = c < u) && ((h = u), (u = c), (c = h));
+              var f,
+                s,
+                l,
+                h = e(u),
+                d = e(c),
+                p = null == t ? 10 : +t,
+                v = [];
+              if (!(a % 1) && d - h < p) {
+                if (((h = Math.round(h) - 1), (d = Math.round(d) + 1), u > 0)) {
+                  for (; h < d; ++h)
+                    for (s = 1, f = r(h); s < a; ++s)
+                      if (!((l = f * s) < u)) {
+                        if (l > c) break;
+                        v.push(l);
+                      }
+                } else
+                  for (; h < d; ++h)
+                    for (s = a - 1, f = r(h); s >= 1; --s)
+                      if (!((l = f * s) < u)) {
+                        if (l > c) break;
+                        v.push(l);
+                      }
+              } else v = m(h, d, Math.min(d - h, p)).map(r);
+              return n ? v.reverse() : v;
+            }),
+            (i.tickFormat = function (n, o) {
+              if ((null == o && (o = 10 === a ? ".0e" : ","), "function" != typeof o && (o = t.format(o)), n === 1 / 0))
+                return o;
+              null == n && (n = 10);
+              var u = Math.max(1, (a * n) / i.ticks().length);
+              return function (t) {
+                var n = t / r(Math.round(e(t)));
+                return n * a < a - 0.5 && (n *= a), n <= u ? o(t) : "";
+              };
+            }),
+            (i.nice = function () {
+              return o(
+                Ch(o(), {
+                  floor: function (t) {
+                    return r(Math.floor(e(t)));
+                  },
+                  ceil: function (t) {
+                    return r(Math.ceil(e(t)));
+                  },
+                })
+              );
+            }),
+            i
+          );
+        }
+        function Oh(t) {
+          return function (n) {
+            return Math.sign(n) * Math.log1p(Math.abs(n / t));
+          };
+        }
+        function Bh(t) {
+          return function (n) {
+            return Math.sign(n) * Math.expm1(Math.abs(n)) * t;
+          };
+        }
+        function Yh(t) {
+          var n = 1,
+            e = t(Oh(n), Bh(n));
+          return (
+            (e.constant = function (e) {
+              return arguments.length ? t(Oh((n = +e)), Bh(n)) : n;
+            }),
+            Eh(e)
+          );
+        }
+        function Fh(t) {
+          return function (n) {
+            return n < 0 ? -Math.pow(-n, t) : Math.pow(n, t);
+          };
+        }
+        function Ih(t) {
+          return t < 0 ? -Math.sqrt(-t) : Math.sqrt(t);
+        }
+        function jh(t) {
+          return t < 0 ? -t * t : t * t;
+        }
+        function Hh(t) {
+          var n = t(mh, mh),
+            e = 1;
+          return (
+            (n.exponent = function (n) {
+              return arguments.length ? (1 === (e = +n) ? t(mh, mh) : 0.5 === e ? t(Ih, jh) : t(Fh(e), Fh(1 / e))) : e;
+            }),
+            Eh(n)
+          );
+        }
+        function Xh() {
+          var t = Hh(Th());
+          return (
+            (t.copy = function () {
+              return Ah(t, Xh()).exponent(t.exponent());
+            }),
+            sh.apply(t, arguments),
+            t
+          );
+        }
+        var Gh = new Date(),
+          Vh = new Date();
+        function $h(t, n, e, r) {
+          function i(n) {
+            return t((n = new Date(+n))), n;
+          }
+          return (
+            (i.floor = i),
+            (i.ceil = function (e) {
+              return t((e = new Date(e - 1))), n(e, 1), t(e), e;
+            }),
+            (i.round = function (t) {
+              var n = i(t),
+                e = i.ceil(t);
+              return t - n < e - t ? n : e;
+            }),
+            (i.offset = function (t, e) {
+              return n((t = new Date(+t)), null == e ? 1 : Math.floor(e)), t;
+            }),
+            (i.range = function (e, r, o) {
+              var a,
+                u = [];
+              if (((e = i.ceil(e)), (o = null == o ? 1 : Math.floor(o)), !(e < r && o > 0))) return u;
+              do {
+                u.push((a = new Date(+e))), n(e, o), t(e);
+              } while (a < e && e < r);
+              return u;
+            }),
+            (i.filter = function (e) {
+              return $h(
+                function (n) {
+                  if (n >= n) for (; t(n), !e(n); ) n.setTime(n - 1);
+                },
+                function (t, r) {
+                  if (t >= t)
+                    if (r < 0) for (; ++r <= 0; ) for (; n(t, -1), !e(t); );
+                    else for (; --r >= 0; ) for (; n(t, 1), !e(t); );
+                }
+              );
+            }),
+            e &&
+              ((i.count = function (n, r) {
+                return Gh.setTime(+n), Vh.setTime(+r), t(Gh), t(Vh), Math.floor(e(Gh, Vh));
+              }),
+              (i.every = function (t) {
+                return (
+                  (t = Math.floor(t)),
+                  isFinite(t) && t > 0
+                    ? t > 1
+                      ? i.filter(
+                          r
+                            ? function (n) {
+                                return r(n) % t == 0;
+                              }
+                            : function (n) {
+                                return i.count(0, n) % t == 0;
+                              }
+                        )
+                      : i
+                    : null
+                );
+              })),
+            i
+          );
+        }
+        var Wh = $h(
+          function () {},
+          function (t, n) {
+            t.setTime(+t + n);
+          },
+          function (t, n) {
+            return n - t;
+          }
+        );
+        Wh.every = function (t) {
+          return (
+            (t = Math.floor(t)),
+            isFinite(t) && t > 0
+              ? t > 1
+                ? $h(
+                    function (n) {
+                      n.setTime(Math.floor(n / t) * t);
+                    },
+                    function (n, e) {
+                      n.setTime(+n + e * t);
+                    },
+                    function (n, e) {
+                      return (e - n) / t;
+                    }
+                  )
+                : Wh
+              : null
+          );
+        };
+        var Zh = Wh.range,
+          Qh = 6e4,
+          Jh = 6048e5,
+          Kh = $h(
+            function (t) {
+              t.setTime(t - t.getMilliseconds());
+            },
+            function (t, n) {
+              t.setTime(+t + 1e3 * n);
+            },
+            function (t, n) {
+              return (n - t) / 1e3;
+            },
+            function (t) {
+              return t.getUTCSeconds();
+            }
+          ),
+          td = Kh.range,
+          nd = $h(
+            function (t) {
+              t.setTime(t - t.getMilliseconds() - 1e3 * t.getSeconds());
+            },
+            function (t, n) {
+              t.setTime(+t + n * Qh);
+            },
+            function (t, n) {
+              return (n - t) / Qh;
+            },
+            function (t) {
+              return t.getMinutes();
+            }
+          ),
+          ed = nd.range,
+          rd = $h(
+            function (t) {
+              t.setTime(t - t.getMilliseconds() - 1e3 * t.getSeconds() - t.getMinutes() * Qh);
+            },
+            function (t, n) {
+              t.setTime(+t + 36e5 * n);
+            },
+            function (t, n) {
+              return (n - t) / 36e5;
+            },
+            function (t) {
+              return t.getHours();
+            }
+          ),
+          id = rd.range,
+          od = $h(
+            function (t) {
+              t.setHours(0, 0, 0, 0);
+            },
+            function (t, n) {
+              t.setDate(t.getDate() + n);
+            },
+            function (t, n) {
+              return (n - t - (n.getTimezoneOffset() - t.getTimezoneOffset()) * Qh) / 864e5;
+            },
+            function (t) {
+              return t.getDate() - 1;
+            }
+          ),
+          ad = od.range;
+        function ud(t) {
+          return $h(
+            function (n) {
+              n.setDate(n.getDate() - ((n.getDay() + 7 - t) % 7)), n.setHours(0, 0, 0, 0);
+            },
+            function (t, n) {
+              t.setDate(t.getDate() + 7 * n);
+            },
+            function (t, n) {
+              return (n - t - (n.getTimezoneOffset() - t.getTimezoneOffset()) * Qh) / Jh;
+            }
+          );
+        }
+        var cd = ud(0),
+          fd = ud(1),
+          sd = ud(2),
+          ld = ud(3),
+          hd = ud(4),
+          dd = ud(5),
+          pd = ud(6),
+          vd = cd.range,
+          gd = fd.range,
+          yd = sd.range,
+          _d = ld.range,
+          bd = hd.range,
+          md = dd.range,
+          xd = pd.range,
+          wd = $h(
+            function (t) {
+              t.setDate(1), t.setHours(0, 0, 0, 0);
+            },
+            function (t, n) {
+              t.setMonth(t.getMonth() + n);
+            },
+            function (t, n) {
+              return n.getMonth() - t.getMonth() + 12 * (n.getFullYear() - t.getFullYear());
+            },
+            function (t) {
+              return t.getMonth();
+            }
+          ),
+          Md = wd.range,
+          Nd = $h(
+            function (t) {
+              t.setMonth(0, 1), t.setHours(0, 0, 0, 0);
+            },
+            function (t, n) {
+              t.setFullYear(t.getFullYear() + n);
+            },
+            function (t, n) {
+              return n.getFullYear() - t.getFullYear();
+            },
+            function (t) {
+              return t.getFullYear();
+            }
+          );
+        Nd.every = function (t) {
+          return isFinite((t = Math.floor(t))) && t > 0
+            ? $h(
+                function (n) {
+                  n.setFullYear(Math.floor(n.getFullYear() / t) * t), n.setMonth(0, 1), n.setHours(0, 0, 0, 0);
+                },
+                function (n, e) {
+                  n.setFullYear(n.getFullYear() + e * t);
+                }
+              )
+            : null;
+        };
+        var Ad = Nd.range,
+          Td = $h(
+            function (t) {
+              t.setUTCSeconds(0, 0);
+            },
+            function (t, n) {
+              t.setTime(+t + n * Qh);
+            },
+            function (t, n) {
+              return (n - t) / Qh;
+            },
+            function (t) {
+              return t.getUTCMinutes();
+            }
+          ),
+          Sd = Td.range,
+          kd = $h(
+            function (t) {
+              t.setUTCMinutes(0, 0, 0);
+            },
+            function (t, n) {
+              t.setTime(+t + 36e5 * n);
+            },
+            function (t, n) {
+              return (n - t) / 36e5;
+            },
+            function (t) {
+              return t.getUTCHours();
+            }
+          ),
+          Ed = kd.range,
+          Cd = $h(
+            function (t) {
+              t.setUTCHours(0, 0, 0, 0);
+            },
+            function (t, n) {
+              t.setUTCDate(t.getUTCDate() + n);
+            },
+            function (t, n) {
+              return (n - t) / 864e5;
+            },
+            function (t) {
+              return t.getUTCDate() - 1;
+            }
+          ),
+          Pd = Cd.range;
+        function zd(t) {
+          return $h(
+            function (n) {
+              n.setUTCDate(n.getUTCDate() - ((n.getUTCDay() + 7 - t) % 7)), n.setUTCHours(0, 0, 0, 0);
+            },
+            function (t, n) {
+              t.setUTCDate(t.getUTCDate() + 7 * n);
+            },
+            function (t, n) {
+              return (n - t) / Jh;
+            }
+          );
+        }
+        var Rd = zd(0),
+          Dd = zd(1),
+          qd = zd(2),
+          Ld = zd(3),
+          Ud = zd(4),
+          Od = zd(5),
+          Bd = zd(6),
+          Yd = Rd.range,
+          Fd = Dd.range,
+          Id = qd.range,
+          jd = Ld.range,
+          Hd = Ud.range,
+          Xd = Od.range,
+          Gd = Bd.range,
+          Vd = $h(
+            function (t) {
+              t.setUTCDate(1), t.setUTCHours(0, 0, 0, 0);
+            },
+            function (t, n) {
+              t.setUTCMonth(t.getUTCMonth() + n);
+            },
+            function (t, n) {
+              return n.getUTCMonth() - t.getUTCMonth() + 12 * (n.getUTCFullYear() - t.getUTCFullYear());
+            },
+            function (t) {
+              return t.getUTCMonth();
+            }
+          ),
+          $d = Vd.range,
+          Wd = $h(
+            function (t) {
+              t.setUTCMonth(0, 1), t.setUTCHours(0, 0, 0, 0);
+            },
+            function (t, n) {
+              t.setUTCFullYear(t.getUTCFullYear() + n);
+            },
+            function (t, n) {
+              return n.getUTCFullYear() - t.getUTCFullYear();
+            },
+            function (t) {
+              return t.getUTCFullYear();
+            }
+          );
+        Wd.every = function (t) {
+          return isFinite((t = Math.floor(t))) && t > 0
+            ? $h(
+                function (n) {
+                  n.setUTCFullYear(Math.floor(n.getUTCFullYear() / t) * t),
+                    n.setUTCMonth(0, 1),
+                    n.setUTCHours(0, 0, 0, 0);
+                },
+                function (n, e) {
+                  n.setUTCFullYear(n.getUTCFullYear() + e * t);
+                }
+              )
+            : null;
+        };
+        var Zd = Wd.range;
+        function Qd(t) {
+          if (0 <= t.y && t.y < 100) {
+            var n = new Date(-1, t.m, t.d, t.H, t.M, t.S, t.L);
+            return n.setFullYear(t.y), n;
+          }
+          return new Date(t.y, t.m, t.d, t.H, t.M, t.S, t.L);
+        }
+        function Jd(t) {
+          if (0 <= t.y && t.y < 100) {
+            var n = new Date(Date.UTC(-1, t.m, t.d, t.H, t.M, t.S, t.L));
+            return n.setUTCFullYear(t.y), n;
+          }
+          return new Date(Date.UTC(t.y, t.m, t.d, t.H, t.M, t.S, t.L));
+        }
+        function Kd(t) {
+          return { y: t, m: 0, d: 1, H: 0, M: 0, S: 0, L: 0 };
+        }
+        function tp(t) {
+          var n = t.dateTime,
+            e = t.date,
+            r = t.time,
+            i = t.periods,
+            o = t.days,
+            a = t.shortDays,
+            u = t.months,
+            c = t.shortMonths,
+            f = cp(i),
+            s = fp(i),
+            l = cp(o),
+            h = fp(o),
+            d = cp(a),
+            p = fp(a),
+            v = cp(u),
+            g = fp(u),
+            y = cp(c),
+            _ = fp(c),
+            b = {
+              a: function (t) {
+                return a[t.getDay()];
+              },
+              A: function (t) {
+                return o[t.getDay()];
+              },
+              b: function (t) {
+                return c[t.getMonth()];
+              },
+              B: function (t) {
+                return u[t.getMonth()];
+              },
+              c: null,
+              d: Ep,
+              e: Ep,
+              f: Dp,
+              H: Cp,
+              I: Pp,
+              j: zp,
+              L: Rp,
+              m: qp,
+              M: Lp,
+              p: function (t) {
+                return i[+(t.getHours() >= 12)];
+              },
+              Q: sv,
+              s: lv,
+              S: Up,
+              u: Op,
+              U: Bp,
+              V: Yp,
+              w: Fp,
+              W: Ip,
+              x: null,
+              X: null,
+              y: jp,
+              Y: Hp,
+              Z: Xp,
+              "%": fv,
+            },
+            m = {
+              a: function (t) {
+                return a[t.getUTCDay()];
+              },
+              A: function (t) {
+                return o[t.getUTCDay()];
+              },
+              b: function (t) {
+                return c[t.getUTCMonth()];
+              },
+              B: function (t) {
+                return u[t.getUTCMonth()];
+              },
+              c: null,
+              d: Gp,
+              e: Gp,
+              f: Qp,
+              H: Vp,
+              I: $p,
+              j: Wp,
+              L: Zp,
+              m: Jp,
+              M: Kp,
+              p: function (t) {
+                return i[+(t.getUTCHours() >= 12)];
+              },
+              Q: sv,
+              s: lv,
+              S: tv,
+              u: nv,
+              U: ev,
+              V: rv,
+              w: iv,
+              W: ov,
+              x: null,
+              X: null,
+              y: av,
+              Y: uv,
+              Z: cv,
+              "%": fv,
+            },
+            x = {
+              a: function (t, n, e) {
+                var r = d.exec(n.slice(e));
+                return r ? ((t.w = p[r[0].toLowerCase()]), e + r[0].length) : -1;
+              },
+              A: function (t, n, e) {
+                var r = l.exec(n.slice(e));
+                return r ? ((t.w = h[r[0].toLowerCase()]), e + r[0].length) : -1;
+              },
+              b: function (t, n, e) {
+                var r = y.exec(n.slice(e));
+                return r ? ((t.m = _[r[0].toLowerCase()]), e + r[0].length) : -1;
+              },
+              B: function (t, n, e) {
+                var r = v.exec(n.slice(e));
+                return r ? ((t.m = g[r[0].toLowerCase()]), e + r[0].length) : -1;
+              },
+              c: function (t, e, r) {
+                return N(t, n, e, r);
+              },
+              d: bp,
+              e: bp,
+              f: Ap,
+              H: xp,
+              I: xp,
+              j: mp,
+              L: Np,
+              m: _p,
+              M: wp,
+              p: function (t, n, e) {
+                var r = f.exec(n.slice(e));
+                return r ? ((t.p = s[r[0].toLowerCase()]), e + r[0].length) : -1;
+              },
+              Q: Sp,
+              s: kp,
+              S: Mp,
+              u: lp,
+              U: hp,
+              V: dp,
+              w: sp,
+              W: pp,
+              x: function (t, n, r) {
+                return N(t, e, n, r);
+              },
+              X: function (t, n, e) {
+                return N(t, r, n, e);
+              },
+              y: gp,
+              Y: vp,
+              Z: yp,
+              "%": Tp,
+            };
+          function w(t, n) {
+            return function (e) {
+              var r,
+                i,
+                o,
+                a = [],
+                u = -1,
+                c = 0,
+                f = t.length;
+              for (e instanceof Date || (e = new Date(+e)); ++u < f; )
+                37 === t.charCodeAt(u) &&
+                  (a.push(t.slice(c, u)),
+                  null != (i = ep[(r = t.charAt(++u))]) ? (r = t.charAt(++u)) : (i = "e" === r ? " " : "0"),
+                  (o = n[r]) && (r = o(e, i)),
+                  a.push(r),
+                  (c = u + 1));
+              return a.push(t.slice(c, u)), a.join("");
+            };
+          }
+          function M(t, n) {
+            return function (e) {
+              var r,
+                i,
+                o = Kd(1900);
+              if (N(o, t, (e += ""), 0) != e.length) return null;
+              if ("Q" in o) return new Date(o.Q);
+              if (("p" in o && (o.H = (o.H % 12) + 12 * o.p), "V" in o)) {
+                if (o.V < 1 || o.V > 53) return null;
+                "w" in o || (o.w = 1),
+                  "Z" in o
+                    ? ((i = (r = Jd(Kd(o.y))).getUTCDay()),
+                      (r = i > 4 || 0 === i ? Dd.ceil(r) : Dd(r)),
+                      (r = Cd.offset(r, 7 * (o.V - 1))),
+                      (o.y = r.getUTCFullYear()),
+                      (o.m = r.getUTCMonth()),
+                      (o.d = r.getUTCDate() + ((o.w + 6) % 7)))
+                    : ((i = (r = n(Kd(o.y))).getDay()),
+                      (r = i > 4 || 0 === i ? fd.ceil(r) : fd(r)),
+                      (r = od.offset(r, 7 * (o.V - 1))),
+                      (o.y = r.getFullYear()),
+                      (o.m = r.getMonth()),
+                      (o.d = r.getDate() + ((o.w + 6) % 7)));
+              } else
+                ("W" in o || "U" in o) &&
+                  ("w" in o || (o.w = "u" in o ? o.u % 7 : "W" in o ? 1 : 0),
+                  (i = "Z" in o ? Jd(Kd(o.y)).getUTCDay() : n(Kd(o.y)).getDay()),
+                  (o.m = 0),
+                  (o.d = "W" in o ? ((o.w + 6) % 7) + 7 * o.W - ((i + 5) % 7) : o.w + 7 * o.U - ((i + 6) % 7)));
+              return "Z" in o ? ((o.H += (o.Z / 100) | 0), (o.M += o.Z % 100), Jd(o)) : n(o);
+            };
+          }
+          function N(t, n, e, r) {
+            for (var i, o, a = 0, u = n.length, c = e.length; a < u; ) {
+              if (r >= c) return -1;
+              if (37 === (i = n.charCodeAt(a++))) {
+                if (((i = n.charAt(a++)), !(o = x[i in ep ? n.charAt(a++) : i]) || (r = o(t, e, r)) < 0)) return -1;
+              } else if (i != e.charCodeAt(r++)) return -1;
+            }
+            return r;
+          }
+          return (
+            (b.x = w(e, b)),
+            (b.X = w(r, b)),
+            (b.c = w(n, b)),
+            (m.x = w(e, m)),
+            (m.X = w(r, m)),
+            (m.c = w(n, m)),
+            {
+              format: function (t) {
+                var n = w((t += ""), b);
+                return (
+                  (n.toString = function () {
+                    return t;
+                  }),
+                  n
+                );
+              },
+              parse: function (t) {
+                var n = M((t += ""), Qd);
+                return (
+                  (n.toString = function () {
+                    return t;
+                  }),
+                  n
+                );
+              },
+              utcFormat: function (t) {
+                var n = w((t += ""), m);
+                return (
+                  (n.toString = function () {
+                    return t;
+                  }),
+                  n
+                );
+              },
+              utcParse: function (t) {
+                var n = M(t, Jd);
+                return (
+                  (n.toString = function () {
+                    return t;
+                  }),
+                  n
+                );
+              },
+            }
+          );
+        }
+        var np,
+          ep = { "-": "", _: " ", 0: "0" },
+          rp = /^\s*\d+/,
+          ip = /^%/,
+          op = /[\\^$*+?|[\]().{}]/g;
+        function ap(t, n, e) {
+          var r = t < 0 ? "-" : "",
+            i = (r ? -t : t) + "",
+            o = i.length;
+          return r + (o < e ? new Array(e - o + 1).join(n) + i : i);
+        }
+        function up(t) {
+          return t.replace(op, "\\<!--/*** %%static_metrics%% ***/-->");
+        }
+        function cp(t) {
+          return new RegExp("^(?:" + t.map(up).join("|") + ")", "i");
+        }
+        function fp(t) {
+          for (var n = {}, e = -1, r = t.length; ++e < r; ) n[t[e].toLowerCase()] = e;
+          return n;
+        }
+        function sp(t, n, e) {
+          var r = rp.exec(n.slice(e, e + 1));
+          return r ? ((t.w = +r[0]), e + r[0].length) : -1;
+        }
+        function lp(t, n, e) {
+          var r = rp.exec(n.slice(e, e + 1));
+          return r ? ((t.u = +r[0]), e + r[0].length) : -1;
+        }
+        function hp(t, n, e) {
+          var r = rp.exec(n.slice(e, e + 2));
+          return r ? ((t.U = +r[0]), e + r[0].length) : -1;
+        }
+        function dp(t, n, e) {
+          var r = rp.exec(n.slice(e, e + 2));
+          return r ? ((t.V = +r[0]), e + r[0].length) : -1;
+        }
+        function pp(t, n, e) {
+          var r = rp.exec(n.slice(e, e + 2));
+          return r ? ((t.W = +r[0]), e + r[0].length) : -1;
+        }
+        function vp(t, n, e) {
+          var r = rp.exec(n.slice(e, e + 4));
+          return r ? ((t.y = +r[0]), e + r[0].length) : -1;
+        }
+        function gp(t, n, e) {
+          var r = rp.exec(n.slice(e, e + 2));
+          return r ? ((t.y = +r[0] + (+r[0] > 68 ? 1900 : 2e3)), e + r[0].length) : -1;
+        }
+        function yp(t, n, e) {
+          var r = /^(Z)|([+-]\d\d)(?::?(\d\d))?/.exec(n.slice(e, e + 6));
+          return r ? ((t.Z = r[1] ? 0 : -(r[2] + (r[3] || "00"))), e + r[0].length) : -1;
+        }
+        function _p(t, n, e) {
+          var r = rp.exec(n.slice(e, e + 2));
+          return r ? ((t.m = r[0] - 1), e + r[0].length) : -1;
+        }
+        function bp(t, n, e) {
+          var r = rp.exec(n.slice(e, e + 2));
+          return r ? ((t.d = +r[0]), e + r[0].length) : -1;
+        }
+        function mp(t, n, e) {
+          var r = rp.exec(n.slice(e, e + 3));
+          return r ? ((t.m = 0), (t.d = +r[0]), e + r[0].length) : -1;
+        }
+        function xp(t, n, e) {
+          var r = rp.exec(n.slice(e, e + 2));
+          return r ? ((t.H = +r[0]), e + r[0].length) : -1;
+        }
+        function wp(t, n, e) {
+          var r = rp.exec(n.slice(e, e + 2));
+          return r ? ((t.M = +r[0]), e + r[0].length) : -1;
+        }
+        function Mp(t, n, e) {
+          var r = rp.exec(n.slice(e, e + 2));
+          return r ? ((t.S = +r[0]), e + r[0].length) : -1;
+        }
+        function Np(t, n, e) {
+          var r = rp.exec(n.slice(e, e + 3));
+          return r ? ((t.L = +r[0]), e + r[0].length) : -1;
+        }
+        function Ap(t, n, e) {
+          var r = rp.exec(n.slice(e, e + 6));
+          return r ? ((t.L = Math.floor(r[0] / 1e3)), e + r[0].length) : -1;
+        }
+        function Tp(t, n, e) {
+          var r = ip.exec(n.slice(e, e + 1));
+          return r ? e + r[0].length : -1;
+        }
+        function Sp(t, n, e) {
+          var r = rp.exec(n.slice(e));
+          return r ? ((t.Q = +r[0]), e + r[0].length) : -1;
+        }
+        function kp(t, n, e) {
+          var r = rp.exec(n.slice(e));
+          return r ? ((t.Q = 1e3 * +r[0]), e + r[0].length) : -1;
+        }
+        function Ep(t, n) {
+          return ap(t.getDate(), n, 2);
+        }
+        function Cp(t, n) {
+          return ap(t.getHours(), n, 2);
+        }
+        function Pp(t, n) {
+          return ap(t.getHours() % 12 || 12, n, 2);
+        }
+        function zp(t, n) {
+          return ap(1 + od.count(Nd(t), t), n, 3);
+        }
+        function Rp(t, n) {
+          return ap(t.getMilliseconds(), n, 3);
+        }
+        function Dp(t, n) {
+          return Rp(t, n) + "000";
+        }
+        function qp(t, n) {
+          return ap(t.getMonth() + 1, n, 2);
+        }
+        function Lp(t, n) {
+          return ap(t.getMinutes(), n, 2);
+        }
+        function Up(t, n) {
+          return ap(t.getSeconds(), n, 2);
+        }
+        function Op(t) {
+          var n = t.getDay();
+          return 0 === n ? 7 : n;
+        }
+        function Bp(t, n) {
+          return ap(cd.count(Nd(t), t), n, 2);
+        }
+        function Yp(t, n) {
+          var e = t.getDay();
+          return (t = e >= 4 || 0 === e ? hd(t) : hd.ceil(t)), ap(hd.count(Nd(t), t) + (4 === Nd(t).getDay()), n, 2);
+        }
+        function Fp(t) {
+          return t.getDay();
+        }
+        function Ip(t, n) {
+          return ap(fd.count(Nd(t), t), n, 2);
+        }
+        function jp(t, n) {
+          return ap(t.getFullYear() % 100, n, 2);
+        }
+        function Hp(t, n) {
+          return ap(t.getFullYear() % 1e4, n, 4);
+        }
+        function Xp(t) {
+          var n = t.getTimezoneOffset();
+          return (n > 0 ? "-" : ((n *= -1), "+")) + ap((n / 60) | 0, "0", 2) + ap(n % 60, "0", 2);
+        }
+        function Gp(t, n) {
+          return ap(t.getUTCDate(), n, 2);
+        }
+        function Vp(t, n) {
+          return ap(t.getUTCHours(), n, 2);
+        }
+        function $p(t, n) {
+          return ap(t.getUTCHours() % 12 || 12, n, 2);
+        }
+        function Wp(t, n) {
+          return ap(1 + Cd.count(Wd(t), t), n, 3);
+        }
+        function Zp(t, n) {
+          return ap(t.getUTCMilliseconds(), n, 3);
+        }
+        function Qp(t, n) {
+          return Zp(t, n) + "000";
+        }
+        function Jp(t, n) {
+          return ap(t.getUTCMonth() + 1, n, 2);
+        }
+        function Kp(t, n) {
+          return ap(t.getUTCMinutes(), n, 2);
+        }
+        function tv(t, n) {
+          return ap(t.getUTCSeconds(), n, 2);
+        }
+        function nv(t) {
+          var n = t.getUTCDay();
+          return 0 === n ? 7 : n;
+        }
+        function ev(t, n) {
+          return ap(Rd.count(Wd(t), t), n, 2);
+        }
+        function rv(t, n) {
+          var e = t.getUTCDay();
+          return (t = e >= 4 || 0 === e ? Ud(t) : Ud.ceil(t)), ap(Ud.count(Wd(t), t) + (4 === Wd(t).getUTCDay()), n, 2);
+        }
+        function iv(t) {
+          return t.getUTCDay();
+        }
+        function ov(t, n) {
+          return ap(Dd.count(Wd(t), t), n, 2);
+        }
+        function av(t, n) {
+          return ap(t.getUTCFullYear() % 100, n, 2);
+        }
+        function uv(t, n) {
+          return ap(t.getUTCFullYear() % 1e4, n, 4);
+        }
+        function cv() {
+          return "+0000";
+        }
+        function fv() {
+          return "%";
+        }
+        function sv(t) {
+          return +t;
+        }
+        function lv(t) {
+          return Math.floor(+t / 1e3);
+        }
+        function hv(n) {
+          return (
+            (np = tp(n)),
+            (t.timeFormat = np.format),
+            (t.timeParse = np.parse),
+            (t.utcFormat = np.utcFormat),
+            (t.utcParse = np.utcParse),
+            np
+          );
+        }
+        hv({
+          dateTime: "%x, %X",
+          date: "%-m/%-d/%Y",
+          time: "%-I:%M:%S %p",
+          periods: ["AM", "PM"],
+          days: ["Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday"],
+          shortDays: ["Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat"],
+          months: [
+            "January",
+            "February",
+            "March",
+            "April",
+            "May",
+            "June",
+            "July",
+            "August",
+            "September",
+            "October",
+            "November",
+            "December",
+          ],
+          shortMonths: ["Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"],
+        });
+        var dv = Date.prototype.toISOString
+          ? function (t) {
+              return t.toISOString();
+            }
+          : t.utcFormat("%Y-%m-%dT%H:%M:%S.%LZ");
+        var pv = +new Date("2000-01-01T00:00:00.000Z")
+            ? function (t) {
+                var n = new Date(t);
+                return isNaN(n) ? null : n;
+              }
+            : t.utcParse("%Y-%m-%dT%H:%M:%S.%LZ"),
+          vv = 1e3,
+          gv = 60 * vv,
+          yv = 60 * gv,
+          _v = 24 * yv,
+          bv = 7 * _v,
+          mv = 30 * _v,
+          xv = 365 * _v;
+        function wv(t) {
+          return new Date(t);
+        }
+        function Mv(t) {
+          return t instanceof Date ? +t : +new Date(+t);
+        }
+        function Nv(t, n, r, i, o, a, u, c, f) {
+          var s = Sh(mh, mh),
+            l = s.invert,
+            h = s.domain,
+            d = f(".%L"),
+            p = f(":%S"),
+            v = f("%I:%M"),
+            g = f("%I %p"),
+            y = f("%a %d"),
+            _ = f("%b %d"),
+            b = f("%B"),
+            m = f("%Y"),
+            x = [
+              [u, 1, vv],
+              [u, 5, 5 * vv],
+              [u, 15, 15 * vv],
+              [u, 30, 30 * vv],
+              [a, 1, gv],
+              [a, 5, 5 * gv],
+              [a, 15, 15 * gv],
+              [a, 30, 30 * gv],
+              [o, 1, yv],
+              [o, 3, 3 * yv],
+              [o, 6, 6 * yv],
+              [o, 12, 12 * yv],
+              [i, 1, _v],
+              [i, 2, 2 * _v],
+              [r, 1, bv],
+              [n, 1, mv],
+              [n, 3, 3 * mv],
+              [t, 1, xv],
+            ];
+          function M(e) {
+            return (
+              u(e) < e
+                ? d
+                : a(e) < e
+                  ? p
+                  : o(e) < e
+                    ? v
+                    : i(e) < e
+                      ? g
+                      : n(e) < e
+                        ? r(e) < e
+                          ? y
+                          : _
+                        : t(e) < e
+                          ? b
+                          : m
+            )(e);
+          }
+          function N(n, r, i, o) {
+            if ((null == n && (n = 10), "number" == typeof n)) {
+              var a = Math.abs(i - r) / n,
+                u = e(function (t) {
+                  return t[2];
+                }).right(x, a);
+              u === x.length
+                ? ((o = w(r / xv, i / xv, n)), (n = t))
+                : u
+                  ? ((o = (u = x[a / x[u - 1][2] < x[u][2] / a ? u - 1 : u])[1]), (n = u[0]))
+                  : ((o = Math.max(w(r, i, n), 1)), (n = c));
+            }
+            return null == o ? n : n.every(o);
+          }
+          return (
+            (s.invert = function (t) {
+              return new Date(l(t));
+            }),
+            (s.domain = function (t) {
+              return arguments.length ? h(dh.call(t, Mv)) : h().map(wv);
+            }),
+            (s.ticks = function (t, n) {
+              var e,
+                r = h(),
+                i = r[0],
+                o = r[r.length - 1],
+                a = o < i;
+              return (
+                a && ((e = i), (i = o), (o = e)),
+                (e = (e = N(t, i, o, n)) ? e.range(i, o + 1) : []),
+                a ? e.reverse() : e
+              );
+            }),
+            (s.tickFormat = function (t, n) {
+              return null == n ? M : f(n);
+            }),
+            (s.nice = function (t, n) {
+              var e = h();
+              return (t = N(t, e[0], e[e.length - 1], n)) ? h(Ch(e, t)) : s;
+            }),
+            (s.copy = function () {
+              return Ah(s, Nv(t, n, r, i, o, a, u, c, f));
+            }),
+            s
+          );
+        }
+        function Av() {
+          var t,
+            n,
+            e,
+            r,
+            i,
+            o = 0,
+            a = 1,
+            u = mh,
+            c = !1;
+          function f(n) {
+            return isNaN((n = +n)) ? i : u(0 === e ? 0.5 : ((n = (r(n) - t) * e), c ? Math.max(0, Math.min(1, n)) : n));
+          }
+          return (
+            (f.domain = function (i) {
+              return arguments.length
+                ? ((t = r((o = +i[0]))), (n = r((a = +i[1]))), (e = t === n ? 0 : 1 / (n - t)), f)
+                : [o, a];
+            }),
+            (f.clamp = function (t) {
+              return arguments.length ? ((c = !!t), f) : c;
+            }),
+            (f.interpolator = function (t) {
+              return arguments.length ? ((u = t), f) : u;
+            }),
+            (f.unknown = function (t) {
+              return arguments.length ? ((i = t), f) : i;
+            }),
+            function (i) {
+              return (r = i), (t = i(o)), (n = i(a)), (e = t === n ? 0 : 1 / (n - t)), f;
+            }
+          );
+        }
+        function Tv(t, n) {
+          return n.domain(t.domain()).interpolator(t.interpolator()).clamp(t.clamp()).unknown(t.unknown());
+        }
+        function Sv() {
+          var t = Hh(Av());
+          return (
+            (t.copy = function () {
+              return Tv(t, Sv()).exponent(t.exponent());
+            }),
+            lh.apply(t, arguments)
+          );
+        }
+        function kv() {
+          var t,
+            n,
+            e,
+            r,
+            i,
+            o,
+            a,
+            u = 0,
+            c = 0.5,
+            f = 1,
+            s = mh,
+            l = !1;
+          function h(t) {
+            return isNaN((t = +t))
+              ? a
+              : ((t = 0.5 + ((t = +o(t)) - n) * (t < n ? r : i)), s(l ? Math.max(0, Math.min(1, t)) : t));
+          }
+          return (
+            (h.domain = function (a) {
+              return arguments.length
+                ? ((t = o((u = +a[0]))),
+                  (n = o((c = +a[1]))),
+                  (e = o((f = +a[2]))),
+                  (r = t === n ? 0 : 0.5 / (n - t)),
+                  (i = n === e ? 0 : 0.5 / (e - n)),
+                  h)
+                : [u, c, f];
+            }),
+            (h.clamp = function (t) {
+              return arguments.length ? ((l = !!t), h) : l;
+            }),
+            (h.interpolator = function (t) {
+              return arguments.length ? ((s = t), h) : s;
+            }),
+            (h.unknown = function (t) {
+              return arguments.length ? ((a = t), h) : a;
+            }),
+            function (a) {
+              return (
+                (o = a),
+                (t = a(u)),
+                (n = a(c)),
+                (e = a(f)),
+                (r = t === n ? 0 : 0.5 / (n - t)),
+                (i = n === e ? 0 : 0.5 / (e - n)),
+                h
+              );
+            }
+          );
+        }
+        function Ev() {
+          var t = Hh(kv());
+          return (
+            (t.copy = function () {
+              return Tv(t, Ev()).exponent(t.exponent());
+            }),
+            lh.apply(t, arguments)
+          );
+        }
+        function Cv(t) {
+          for (var n = (t.length / 6) | 0, e = new Array(n), r = 0; r < n; ) e[r] = "#" + t.slice(6 * r, 6 * ++r);
+          return e;
+        }
+        var Pv = Cv("1f77b4ff7f0e2ca02cd627289467bd8c564be377c27f7f7fbcbd2217becf"),
+          zv = Cv("7fc97fbeaed4fdc086ffff99386cb0f0027fbf5b17666666"),
+          Rv = Cv("1b9e77d95f027570b3e7298a66a61ee6ab02a6761d666666"),
+          Dv = Cv("a6cee31f78b4b2df8a33a02cfb9a99e31a1cfdbf6fff7f00cab2d66a3d9affff99b15928"),
+          qv = Cv("fbb4aeb3cde3ccebc5decbe4fed9a6ffffcce5d8bdfddaecf2f2f2"),
+          Lv = Cv("b3e2cdfdcdaccbd5e8f4cae4e6f5c9fff2aef1e2cccccccc"),
+          Uv = Cv("e41a1c377eb84daf4a984ea3ff7f00ffff33a65628f781bf999999"),
+          Ov = Cv("66c2a5fc8d628da0cbe78ac3a6d854ffd92fe5c494b3b3b3"),
+          Bv = Cv("8dd3c7ffffb3bebadafb807280b1d3fdb462b3de69fccde5d9d9d9bc80bdccebc5ffed6f");
+        function Yv(t) {
+          return ce(t[t.length - 1]);
+        }
+        var Fv = new Array(3)
+            .concat(
+              "d8b365f5f5f55ab4ac",
+              "a6611adfc27d80cdc1018571",
+              "a6611adfc27df5f5f580cdc1018571",
+              "8c510ad8b365f6e8c3c7eae55ab4ac01665e",
+              "8c510ad8b365f6e8c3f5f5f5c7eae55ab4ac01665e",
+              "8c510abf812ddfc27df6e8c3c7eae580cdc135978f01665e",
+              "8c510abf812ddfc27df6e8c3f5f5f5c7eae580cdc135978f01665e",
+              "5430058c510abf812ddfc27df6e8c3c7eae580cdc135978f01665e003c30",
+              "5430058c510abf812ddfc27df6e8c3f5f5f5c7eae580cdc135978f01665e003c30"
+            )
+            .map(Cv),
+          Iv = Yv(Fv),
+          jv = new Array(3)
+            .concat(
+              "af8dc3f7f7f77fbf7b",
+              "7b3294c2a5cfa6dba0008837",
+              "7b3294c2a5cff7f7f7a6dba0008837",
+              "762a83af8dc3e7d4e8d9f0d37fbf7b1b7837",
+              "762a83af8dc3e7d4e8f7f7f7d9f0d37fbf7b1b7837",
+              "762a839970abc2a5cfe7d4e8d9f0d3a6dba05aae611b7837",
+              "762a839970abc2a5cfe7d4e8f7f7f7d9f0d3a6dba05aae611b7837",
+              "40004b762a839970abc2a5cfe7d4e8d9f0d3a6dba05aae611b783700441b",
+              "40004b762a839970abc2a5cfe7d4e8f7f7f7d9f0d3a6dba05aae611b783700441b"
+            )
+            .map(Cv),
+          Hv = Yv(jv),
+          Xv = new Array(3)
+            .concat(
+              "e9a3c9f7f7f7a1d76a",
+              "d01c8bf1b6dab8e1864dac26",
+              "d01c8bf1b6daf7f7f7b8e1864dac26",
+              "c51b7de9a3c9fde0efe6f5d0a1d76a4d9221",
+              "c51b7de9a3c9fde0eff7f7f7e6f5d0a1d76a4d9221",
+              "c51b7dde77aef1b6dafde0efe6f5d0b8e1867fbc414d9221",
+              "c51b7dde77aef1b6dafde0eff7f7f7e6f5d0b8e1867fbc414d9221",
+              "8e0152c51b7dde77aef1b6dafde0efe6f5d0b8e1867fbc414d9221276419",
+              "8e0152c51b7dde77aef1b6dafde0eff7f7f7e6f5d0b8e1867fbc414d9221276419"
+            )
+            .map(Cv),
+          Gv = Yv(Xv),
+          Vv = new Array(3)
+            .concat(
+              "998ec3f7f7f7f1a340",
+              "5e3c99b2abd2fdb863e66101",
+              "5e3c99b2abd2f7f7f7fdb863e66101",
+              "542788998ec3d8daebfee0b6f1a340b35806",
+              "542788998ec3d8daebf7f7f7fee0b6f1a340b35806",
+              "5427888073acb2abd2d8daebfee0b6fdb863e08214b35806",
+              "5427888073acb2abd2d8daebf7f7f7fee0b6fdb863e08214b35806",
+              "2d004b5427888073acb2abd2d8daebfee0b6fdb863e08214b358067f3b08",
+              "2d004b5427888073acb2abd2d8daebf7f7f7fee0b6fdb863e08214b358067f3b08"
+            )
+            .map(Cv),
+          $v = Yv(Vv),
+          Wv = new Array(3)
+            .concat(
+              "ef8a62f7f7f767a9cf",
+              "ca0020f4a58292c5de0571b0",
+              "ca0020f4a582f7f7f792c5de0571b0",
+              "b2182bef8a62fddbc7d1e5f067a9cf2166ac",
+              "b2182bef8a62fddbc7f7f7f7d1e5f067a9cf2166ac",
+              "b2182bd6604df4a582fddbc7d1e5f092c5de4393c32166ac",
+              "b2182bd6604df4a582fddbc7f7f7f7d1e5f092c5de4393c32166ac",
+              "67001fb2182bd6604df4a582fddbc7d1e5f092c5de4393c32166ac053061",
+              "67001fb2182bd6604df4a582fddbc7f7f7f7d1e5f092c5de4393c32166ac053061"
+            )
+            .map(Cv),
+          Zv = Yv(Wv),
+          Qv = new Array(3)
+            .concat(
+              "ef8a62ffffff999999",
+              "ca0020f4a582bababa404040",
+              "ca0020f4a582ffffffbababa404040",
+              "b2182bef8a62fddbc7e0e0e09999994d4d4d",
+              "b2182bef8a62fddbc7ffffffe0e0e09999994d4d4d",
+              "b2182bd6604df4a582fddbc7e0e0e0bababa8787874d4d4d",
+              "b2182bd6604df4a582fddbc7ffffffe0e0e0bababa8787874d4d4d",
+              "67001fb2182bd6604df4a582fddbc7e0e0e0bababa8787874d4d4d1a1a1a",
+              "67001fb2182bd6604df4a582fddbc7ffffffe0e0e0bababa8787874d4d4d1a1a1a"
+            )
+            .map(Cv),
+          Jv = Yv(Qv),
+          Kv = new Array(3)
+            .concat(
+              "fc8d59ffffbf91bfdb",
+              "d7191cfdae61abd9e92c7bb6",
+              "d7191cfdae61ffffbfabd9e92c7bb6",
+              "d73027fc8d59fee090e0f3f891bfdb4575b4",
+              "d73027fc8d59fee090ffffbfe0f3f891bfdb4575b4",
+              "d73027f46d43fdae61fee090e0f3f8abd9e974add14575b4",
+              "d73027f46d43fdae61fee090ffffbfe0f3f8abd9e974add14575b4",
+              "a50026d73027f46d43fdae61fee090e0f3f8abd9e974add14575b4313695",
+              "a50026d73027f46d43fdae61fee090ffffbfe0f3f8abd9e974add14575b4313695"
+            )
+            .map(Cv),
+          tg = Yv(Kv),
+          ng = new Array(3)
+            .concat(
+              "fc8d59ffffbf91cf60",
+              "d7191cfdae61a6d96a1a9641",
+              "d7191cfdae61ffffbfa6d96a1a9641",
+              "d73027fc8d59fee08bd9ef8b91cf601a9850",
+              "d73027fc8d59fee08bffffbfd9ef8b91cf601a9850",
+              "d73027f46d43fdae61fee08bd9ef8ba6d96a66bd631a9850",
+              "d73027f46d43fdae61fee08bffffbfd9ef8ba6d96a66bd631a9850",
+              "a50026d73027f46d43fdae61fee08bd9ef8ba6d96a66bd631a9850006837",
+              "a50026d73027f46d43fdae61fee08bffffbfd9ef8ba6d96a66bd631a9850006837"
+            )
+            .map(Cv),
+          eg = Yv(ng),
+          rg = new Array(3)
+            .concat(
+              "fc8d59ffffbf99d594",
+              "d7191cfdae61abdda42b83ba",
+              "d7191cfdae61ffffbfabdda42b83ba",
+              "d53e4ffc8d59fee08be6f59899d5943288bd",
+              "d53e4ffc8d59fee08bffffbfe6f59899d5943288bd",
+              "d53e4ff46d43fdae61fee08be6f598abdda466c2a53288bd",
+              "d53e4ff46d43fdae61fee08bffffbfe6f598abdda466c2a53288bd",
+              "9e0142d53e4ff46d43fdae61fee08be6f598abdda466c2a53288bd5e4fa2",
+              "9e0142d53e4ff46d43fdae61fee08bffffbfe6f598abdda466c2a53288bd5e4fa2"
+            )
+            .map(Cv),
+          ig = Yv(rg),
+          og = new Array(3)
+            .concat(
+              "e5f5f999d8c92ca25f",
+              "edf8fbb2e2e266c2a4238b45",
+              "edf8fbb2e2e266c2a42ca25f006d2c",
+              "edf8fbccece699d8c966c2a42ca25f006d2c",
+              "edf8fbccece699d8c966c2a441ae76238b45005824",
+              "f7fcfde5f5f9ccece699d8c966c2a441ae76238b45005824",
+              "f7fcfde5f5f9ccece699d8c966c2a441ae76238b45006d2c00441b"
+            )
+            .map(Cv),
+          ag = Yv(og),
+          ug = new Array(3)
+            .concat(
+              "e0ecf49ebcda8856a7",
+              "edf8fbb3cde38c96c688419d",
+              "edf8fbb3cde38c96c68856a7810f7c",
+              "edf8fbbfd3e69ebcda8c96c68856a7810f7c",
+              "edf8fbbfd3e69ebcda8c96c68c6bb188419d6e016b",
+              "f7fcfde0ecf4bfd3e69ebcda8c96c68c6bb188419d6e016b",
+              "f7fcfde0ecf4bfd3e69ebcda8c96c68c6bb188419d810f7c4d004b"
+            )
+            .map(Cv),
+          cg = Yv(ug),
+          fg = new Array(3)
+            .concat(
+              "e0f3dba8ddb543a2ca",
+              "f0f9e8bae4bc7bccc42b8cbe",
+              "f0f9e8bae4bc7bccc443a2ca0868ac",
+              "f0f9e8ccebc5a8ddb57bccc443a2ca0868ac",
+              "f0f9e8ccebc5a8ddb57bccc44eb3d32b8cbe08589e",
+              "f7fcf0e0f3dbccebc5a8ddb57bccc44eb3d32b8cbe08589e",
+              "f7fcf0e0f3dbccebc5a8ddb57bccc44eb3d32b8cbe0868ac084081"
+            )
+            .map(Cv),
+          sg = Yv(fg),
+          lg = new Array(3)
+            .concat(
+              "fee8c8fdbb84e34a33",
+              "fef0d9fdcc8afc8d59d7301f",
+              "fef0d9fdcc8afc8d59e34a33b30000",
+              "fef0d9fdd49efdbb84fc8d59e34a33b30000",
+              "fef0d9fdd49efdbb84fc8d59ef6548d7301f990000",
+              "fff7ecfee8c8fdd49efdbb84fc8d59ef6548d7301f990000",
+              "fff7ecfee8c8fdd49efdbb84fc8d59ef6548d7301fb300007f0000"
+            )
+            .map(Cv),
+          hg = Yv(lg),
+          dg = new Array(3)
+            .concat(
+              "ece2f0a6bddb1c9099",
+              "f6eff7bdc9e167a9cf02818a",
+              "f6eff7bdc9e167a9cf1c9099016c59",
+              "f6eff7d0d1e6a6bddb67a9cf1c9099016c59",
+              "f6eff7d0d1e6a6bddb67a9cf3690c002818a016450",
+              "fff7fbece2f0d0d1e6a6bddb67a9cf3690c002818a016450",
+              "fff7fbece2f0d0d1e6a6bddb67a9cf3690c002818a016c59014636"
+            )
+            .map(Cv),
+          pg = Yv(dg),
+          vg = new Array(3)
+            .concat(
+              "ece7f2a6bddb2b8cbe",
+              "f1eef6bdc9e174a9cf0570b0",
+              "f1eef6bdc9e174a9cf2b8cbe045a8d",
+              "f1eef6d0d1e6a6bddb74a9cf2b8cbe045a8d",
+              "f1eef6d0d1e6a6bddb74a9cf3690c00570b0034e7b",
+              "fff7fbece7f2d0d1e6a6bddb74a9cf3690c00570b0034e7b",
+              "fff7fbece7f2d0d1e6a6bddb74a9cf3690c00570b0045a8d023858"
+            )
+            .map(Cv),
+          gg = Yv(vg),
+          yg = new Array(3)
+            .concat(
+              "e7e1efc994c7dd1c77",
+              "f1eef6d7b5d8df65b0ce1256",
+              "f1eef6d7b5d8df65b0dd1c77980043",
+              "f1eef6d4b9dac994c7df65b0dd1c77980043",
+              "f1eef6d4b9dac994c7df65b0e7298ace125691003f",
+              "f7f4f9e7e1efd4b9dac994c7df65b0e7298ace125691003f",
+              "f7f4f9e7e1efd4b9dac994c7df65b0e7298ace125698004367001f"
+            )
+            .map(Cv),
+          _g = Yv(yg),
+          bg = new Array(3)
+            .concat(
+              "fde0ddfa9fb5c51b8a",
+              "feebe2fbb4b9f768a1ae017e",
+              "feebe2fbb4b9f768a1c51b8a7a0177",
+              "feebe2fcc5c0fa9fb5f768a1c51b8a7a0177",
+              "feebe2fcc5c0fa9fb5f768a1dd3497ae017e7a0177",
+              "fff7f3fde0ddfcc5c0fa9fb5f768a1dd3497ae017e7a0177",
+              "fff7f3fde0ddfcc5c0fa9fb5f768a1dd3497ae017e7a017749006a"
+            )
+            .map(Cv),
+          mg = Yv(bg),
+          xg = new Array(3)
+            .concat(
+              "edf8b17fcdbb2c7fb8",
+              "ffffcca1dab441b6c4225ea8",
+              "ffffcca1dab441b6c42c7fb8253494",
+              "ffffccc7e9b47fcdbb41b6c42c7fb8253494",
+              "ffffccc7e9b47fcdbb41b6c41d91c0225ea80c2c84",
+              "ffffd9edf8b1c7e9b47fcdbb41b6c41d91c0225ea80c2c84",
+              "ffffd9edf8b1c7e9b47fcdbb41b6c41d91c0225ea8253494081d58"
+            )
+            .map(Cv),
+          wg = Yv(xg),
+          Mg = new Array(3)
+            .concat(
+              "f7fcb9addd8e31a354",
+              "ffffccc2e69978c679238443",
+              "ffffccc2e69978c67931a354006837",
+              "ffffccd9f0a3addd8e78c67931a354006837",
+              "ffffccd9f0a3addd8e78c67941ab5d238443005a32",
+              "ffffe5f7fcb9d9f0a3addd8e78c67941ab5d238443005a32",
+              "ffffe5f7fcb9d9f0a3addd8e78c67941ab5d238443006837004529"
+            )
+            .map(Cv),
+          Ng = Yv(Mg),
+          Ag = new Array(3)
+            .concat(
+              "fff7bcfec44fd95f0e",
+              "ffffd4fed98efe9929cc4c02",
+              "ffffd4fed98efe9929d95f0e993404",
+              "ffffd4fee391fec44ffe9929d95f0e993404",
+              "ffffd4fee391fec44ffe9929ec7014cc4c028c2d04",
+              "ffffe5fff7bcfee391fec44ffe9929ec7014cc4c028c2d04",
+              "ffffe5fff7bcfee391fec44ffe9929ec7014cc4c02993404662506"
+            )
+            .map(Cv),
+          Tg = Yv(Ag),
+          Sg = new Array(3)
+            .concat(
+              "ffeda0feb24cf03b20",
+              "ffffb2fecc5cfd8d3ce31a1c",
+              "ffffb2fecc5cfd8d3cf03b20bd0026",
+              "ffffb2fed976feb24cfd8d3cf03b20bd0026",
+              "ffffb2fed976feb24cfd8d3cfc4e2ae31a1cb10026",
+              "ffffccffeda0fed976feb24cfd8d3cfc4e2ae31a1cb10026",
+              "ffffccffeda0fed976feb24cfd8d3cfc4e2ae31a1cbd0026800026"
+            )
+            .map(Cv),
+          kg = Yv(Sg),
+          Eg = new Array(3)
+            .concat(
+              "deebf79ecae13182bd",
+              "eff3ffbdd7e76baed62171b5",
+              "eff3ffbdd7e76baed63182bd08519c",
+              "eff3ffc6dbef9ecae16baed63182bd08519c",
+              "eff3ffc6dbef9ecae16baed64292c62171b5084594",
+              "f7fbffdeebf7c6dbef9ecae16baed64292c62171b5084594",
+              "f7fbffdeebf7c6dbef9ecae16baed64292c62171b508519c08306b"
+            )
+            .map(Cv),
+          Cg = Yv(Eg),
+          Pg = new Array(3)
+            .concat(
+              "e5f5e0a1d99b31a354",
+              "edf8e9bae4b374c476238b45",
+              "edf8e9bae4b374c47631a354006d2c",
+              "edf8e9c7e9c0a1d99b74c47631a354006d2c",
+              "edf8e9c7e9c0a1d99b74c47641ab5d238b45005a32",
+              "f7fcf5e5f5e0c7e9c0a1d99b74c47641ab5d238b45005a32",
+              "f7fcf5e5f5e0c7e9c0a1d99b74c47641ab5d238b45006d2c00441b"
+            )
+            .map(Cv),
+          zg = Yv(Pg),
+          Rg = new Array(3)
+            .concat(
+              "f0f0f0bdbdbd636363",
+              "f7f7f7cccccc969696525252",
+              "f7f7f7cccccc969696636363252525",
+              "f7f7f7d9d9d9bdbdbd969696636363252525",
+              "f7f7f7d9d9d9bdbdbd969696737373525252252525",
+              "fffffff0f0f0d9d9d9bdbdbd969696737373525252252525",
+              "fffffff0f0f0d9d9d9bdbdbd969696737373525252252525000000"
+            )
+            .map(Cv),
+          Dg = Yv(Rg),
+          qg = new Array(3)
+            .concat(
+              "efedf5bcbddc756bb1",
+              "f2f0f7cbc9e29e9ac86a51a3",
+              "f2f0f7cbc9e29e9ac8756bb154278f",
+              "f2f0f7dadaebbcbddc9e9ac8756bb154278f",
+              "f2f0f7dadaebbcbddc9e9ac8807dba6a51a34a1486",
+              "fcfbfdefedf5dadaebbcbddc9e9ac8807dba6a51a34a1486",
+              "fcfbfdefedf5dadaebbcbddc9e9ac8807dba6a51a354278f3f007d"
+            )
+            .map(Cv),
+          Lg = Yv(qg),
+          Ug = new Array(3)
+            .concat(
+              "fee0d2fc9272de2d26",
+              "fee5d9fcae91fb6a4acb181d",
+              "fee5d9fcae91fb6a4ade2d26a50f15",
+              "fee5d9fcbba1fc9272fb6a4ade2d26a50f15",
+              "fee5d9fcbba1fc9272fb6a4aef3b2ccb181d99000d",
+              "fff5f0fee0d2fcbba1fc9272fb6a4aef3b2ccb181d99000d",
+              "fff5f0fee0d2fcbba1fc9272fb6a4aef3b2ccb181da50f1567000d"
+            )
+            .map(Cv),
+          Og = Yv(Ug),
+          Bg = new Array(3)
+            .concat(
+              "fee6cefdae6be6550d",
+              "feeddefdbe85fd8d3cd94701",
+              "feeddefdbe85fd8d3ce6550da63603",
+              "feeddefdd0a2fdae6bfd8d3ce6550da63603",
+              "feeddefdd0a2fdae6bfd8d3cf16913d948018c2d04",
+              "fff5ebfee6cefdd0a2fdae6bfd8d3cf16913d948018c2d04",
+              "fff5ebfee6cefdd0a2fdae6bfd8d3cf16913d94801a636037f2704"
+            )
+            .map(Cv),
+          Yg = Yv(Bg),
+          Fg = je(Zn(300, 0.5, 0), Zn(-240, 0.5, 1)),
+          Ig = je(Zn(-100, 0.75, 0.35), Zn(80, 1.5, 0.8)),
+          jg = je(Zn(260, 0.75, 0.35), Zn(80, 1.5, 0.8)),
+          Hg = Zn();
+        var Xg = gn(),
+          Gg = Math.PI / 3,
+          Vg = (2 * Math.PI) / 3;
+        function $g(t) {
+          var n = t.length;
+          return function (e) {
+            return t[Math.max(0, Math.min(n - 1, Math.floor(e * n)))];
+          };
+        }
+        var Wg = $g(
+            Cv(
+              "44015444025645045745055946075a46085c460a5d460b5e470d60470e6147106347116447136548146748166848176948186a481a6c481b6d481c6e481d6f481f70482071482173482374482475482576482677482878482979472a7a472c7a472d7b472e7c472f7d46307e46327e46337f463480453581453781453882443983443a83443b84433d84433e85423f854240864241864142874144874045884046883f47883f48893e49893e4a893e4c8a3d4d8a3d4e8a3c4f8a3c508b3b518b3b528b3a538b3a548c39558c39568c38588c38598c375a8c375b8d365c8d365d8d355e8d355f8d34608d34618d33628d33638d32648e32658e31668e31678e31688e30698e306a8e2f6b8e2f6c8e2e6d8e2e6e8e2e6f8e2d708e2d718e2c718e2c728e2c738e2b748e2b758e2a768e2a778e2a788e29798e297a8e297b8e287c8e287d8e277e8e277f8e27808e26818e26828e26828e25838e25848e25858e24868e24878e23888e23898e238a8d228b8d228c8d228d8d218e8d218f8d21908d21918c20928c20928c20938c1f948c1f958b1f968b1f978b1f988b1f998a1f9a8a1e9b8a1e9c891e9d891f9e891f9f881fa0881fa1881fa1871fa28720a38620a48621a58521a68522a78522a88423a98324aa8325ab8225ac8226ad8127ad8128ae8029af7f2ab07f2cb17e2db27d2eb37c2fb47c31b57b32b67a34b67935b77937b87838b9773aba763bbb753dbc743fbc7340bd7242be7144bf7046c06f48c16e4ac16d4cc26c4ec36b50c46a52c56954c56856c66758c7655ac8645cc8635ec96260ca6063cb5f65cb5e67cc5c69cd5b6ccd5a6ece5870cf5773d05675d05477d1537ad1517cd2507fd34e81d34d84d44b86d54989d5488bd6468ed64590d74393d74195d84098d83e9bd93c9dd93ba0da39a2da37a5db36a8db34aadc32addc30b0dd2fb2dd2db5de2bb8de29bade28bddf26c0df25c2df23c5e021c8e020cae11fcde11dd0e11cd2e21bd5e21ad8e219dae319dde318dfe318e2e418e5e419e7e419eae51aece51befe51cf1e51df4e61ef6e620f8e621fbe723fde725"
+            )
+          ),
+          Zg = $g(
+            Cv(
+              "00000401000501010601010802010902020b02020d03030f03031204041405041606051806051a07061c08071e0907200a08220b09240c09260d0a290e0b2b100b2d110c2f120d31130d34140e36150e38160f3b180f3d19103f1a10421c10441d11471e114920114b21114e22115024125325125527125829115a2a115c2c115f2d11612f116331116533106734106936106b38106c390f6e3b0f703d0f713f0f72400f74420f75440f764510774710784910784a10794c117a4e117b4f127b51127c52137c54137d56147d57157e59157e5a167e5c167f5d177f5f187f601880621980641a80651a80671b80681c816a1c816b1d816d1d816e1e81701f81721f817320817521817621817822817922827b23827c23827e24828025828125818326818426818627818827818928818b29818c29818e2a81902a81912b81932b80942c80962c80982d80992d809b2e7f9c2e7f9e2f7fa02f7fa1307ea3307ea5317ea6317da8327daa337dab337cad347cae347bb0357bb2357bb3367ab5367ab73779b83779ba3878bc3978bd3977bf3a77c03a76c23b75c43c75c53c74c73d73c83e73ca3e72cc3f71cd4071cf4070d0416fd2426fd3436ed5446dd6456cd8456cd9466bdb476adc4869de4968df4a68e04c67e24d66e34e65e44f64e55064e75263e85362e95462ea5661eb5760ec5860ed5a5fee5b5eef5d5ef05f5ef1605df2625df2645cf3655cf4675cf4695cf56b5cf66c5cf66e5cf7705cf7725cf8745cf8765cf9785df9795df97b5dfa7d5efa7f5efa815ffb835ffb8560fb8761fc8961fc8a62fc8c63fc8e64fc9065fd9266fd9467fd9668fd9869fd9a6afd9b6bfe9d6cfe9f6dfea16efea36ffea571fea772fea973feaa74feac76feae77feb078feb27afeb47bfeb67cfeb77efeb97ffebb81febd82febf84fec185fec287fec488fec68afec88cfeca8dfecc8ffecd90fecf92fed194fed395fed597fed799fed89afdda9cfddc9efddea0fde0a1fde2a3fde3a5fde5a7fde7a9fde9aafdebacfcecaefceeb0fcf0b2fcf2b4fcf4b6fcf6b8fcf7b9fcf9bbfcfbbdfcfdbf"
+            )
+          ),
+          Qg = $g(
+            Cv(
+              "00000401000501010601010802010a02020c02020e03021004031204031405041706041907051b08051d09061f0a07220b07240c08260d08290e092b10092d110a30120a32140b34150b37160b39180c3c190c3e1b0c411c0c431e0c451f0c48210c4a230c4c240c4f260c51280b53290b552b0b572d0b592f0a5b310a5c320a5e340a5f3609613809623909633b09643d09653e0966400a67420a68440a68450a69470b6a490b6a4a0c6b4c0c6b4d0d6c4f0d6c510e6c520e6d540f6d550f6d57106e59106e5a116e5c126e5d126e5f136e61136e62146e64156e65156e67166e69166e6a176e6c186e6d186e6f196e71196e721a6e741a6e751b6e771c6d781c6d7a1d6d7c1d6d7d1e6d7f1e6c801f6c82206c84206b85216b87216b88226a8a226a8c23698d23698f24699025689225689326679526679727669827669a28659b29649d29649f2a63a02a63a22b62a32c61a52c60a62d60a82e5fa92e5eab2f5ead305dae305cb0315bb1325ab3325ab43359b63458b73557b93556ba3655bc3754bd3853bf3952c03a51c13a50c33b4fc43c4ec63d4dc73e4cc83f4bca404acb4149cc4248ce4347cf4446d04545d24644d34743d44842d54a41d74b3fd84c3ed94d3dda4e3cdb503bdd513ade5238df5337e05536e15635e25734e35933e45a31e55c30e65d2fe75e2ee8602de9612bea632aeb6429eb6628ec6726ed6925ee6a24ef6c23ef6e21f06f20f1711ff1731df2741cf3761bf37819f47918f57b17f57d15f67e14f68013f78212f78410f8850ff8870ef8890cf98b0bf98c0af98e09fa9008fa9207fa9407fb9606fb9706fb9906fb9b06fb9d07fc9f07fca108fca309fca50afca60cfca80dfcaa0ffcac11fcae12fcb014fcb216fcb418fbb61afbb81dfbba1ffbbc21fbbe23fac026fac228fac42afac62df9c72ff9c932f9cb35f8cd37f8cf3af7d13df7d340f6d543f6d746f5d949f5db4cf4dd4ff4df53f4e156f3e35af3e55df2e661f2e865f2ea69f1ec6df1ed71f1ef75f1f179f2f27df2f482f3f586f3f68af4f88ef5f992f6fa96f8fb9af9fc9dfafda1fcffa4"
+            )
+          ),
+          Jg = $g(
+            Cv(
+              "0d088710078813078916078a19068c1b068d1d068e20068f2206902406912605912805922a05932c05942e05952f059631059733059735049837049938049a3a049a3c049b3e049c3f049c41049d43039e44039e46039f48039f4903a04b03a14c02a14e02a25002a25102a35302a35502a45601a45801a45901a55b01a55c01a65e01a66001a66100a76300a76400a76600a76700a86900a86a00a86c00a86e00a86f00a87100a87201a87401a87501a87701a87801a87a02a87b02a87d03a87e03a88004a88104a78305a78405a78606a68707a68808a68a09a58b0aa58d0ba58e0ca48f0da4910ea3920fa39410a29511a19613a19814a099159f9a169f9c179e9d189d9e199da01a9ca11b9ba21d9aa31e9aa51f99a62098a72197a82296aa2395ab2494ac2694ad2793ae2892b02991b12a90b22b8fb32c8eb42e8db52f8cb6308bb7318ab83289ba3388bb3488bc3587bd3786be3885bf3984c03a83c13b82c23c81c33d80c43e7fc5407ec6417dc7427cc8437bc9447aca457acb4679cc4778cc4977cd4a76ce4b75cf4c74d04d73d14e72d24f71d35171d45270d5536fd5546ed6556dd7566cd8576bd9586ada5a6ada5b69db5c68dc5d67dd5e66de5f65de6164df6263e06363e16462e26561e26660e3685fe4695ee56a5de56b5de66c5ce76e5be76f5ae87059e97158e97257ea7457eb7556eb7655ec7754ed7953ed7a52ee7b51ef7c51ef7e50f07f4ff0804ef1814df1834cf2844bf3854bf3874af48849f48948f58b47f58c46f68d45f68f44f79044f79143f79342f89441f89540f9973ff9983ef99a3efa9b3dfa9c3cfa9e3bfb9f3afba139fba238fca338fca537fca636fca835fca934fdab33fdac33fdae32fdaf31fdb130fdb22ffdb42ffdb52efeb72dfeb82cfeba2cfebb2bfebd2afebe2afec029fdc229fdc328fdc527fdc627fdc827fdca26fdcb26fccd25fcce25fcd025fcd225fbd324fbd524fbd724fad824fada24f9dc24f9dd25f8df25f8e125f7e225f7e425f6e626f6e826f5e926f5eb27f4ed27f3ee27f3f027f2f227f1f426f1f525f0f724f0f921"
+            )
+          );
+        function Kg(t) {
+          return function () {
+            return t;
+          };
+        }
+        var ty = Math.abs,
+          ny = Math.atan2,
+          ey = Math.cos,
+          ry = Math.max,
+          iy = Math.min,
+          oy = Math.sin,
+          ay = Math.sqrt,
+          uy = 1e-12,
+          cy = Math.PI,
+          fy = cy / 2,
+          sy = 2 * cy;
+        function ly(t) {
+          return t >= 1 ? fy : t <= -1 ? -fy : Math.asin(t);
+        }
+        function hy(t) {
+          return t.innerRadius;
+        }
+        function dy(t) {
+          return t.outerRadius;
+        }
+        function py(t) {
+          return t.startAngle;
+        }
+        function vy(t) {
+          return t.endAngle;
+        }
+        function gy(t) {
+          return t && t.padAngle;
+        }
+        function yy(t, n, e, r, i, o, a) {
+          var u = t - e,
+            c = n - r,
+            f = (a ? o : -o) / ay(u * u + c * c),
+            s = f * c,
+            l = -f * u,
+            h = t + s,
+            d = n + l,
+            p = e + s,
+            v = r + l,
+            g = (h + p) / 2,
+            y = (d + v) / 2,
+            _ = p - h,
+            b = v - d,
+            m = _ * _ + b * b,
+            x = i - o,
+            w = h * v - p * d,
+            M = (b < 0 ? -1 : 1) * ay(ry(0, x * x * m - w * w)),
+            N = (w * b - _ * M) / m,
+            A = (-w * _ - b * M) / m,
+            T = (w * b + _ * M) / m,
+            S = (-w * _ + b * M) / m,
+            k = N - g,
+            E = A - y,
+            C = T - g,
+            P = S - y;
+          return (
+            k * k + E * E > C * C + P * P && ((N = T), (A = S)),
+            { cx: N, cy: A, x01: -s, y01: -l, x11: N * (i / x - 1), y11: A * (i / x - 1) }
+          );
+        }
+        function _y(t) {
+          this._context = t;
+        }
+        function by(t) {
+          return new _y(t);
+        }
+        function my(t) {
+          return t[0];
+        }
+        function xy(t) {
+          return t[1];
+        }
+        function wy() {
+          var t = my,
+            n = xy,
+            e = Kg(!0),
+            r = null,
+            i = by,
+            o = null;
+          function a(a) {
+            var u,
+              c,
+              f,
+              s = a.length,
+              l = !1;
+            for (null == r && (o = i((f = Hi()))), u = 0; u <= s; ++u)
+              !(u < s && e((c = a[u]), u, a)) === l && ((l = !l) ? o.lineStart() : o.lineEnd()),
+                l && o.point(+t(c, u, a), +n(c, u, a));
+            if (f) return (o = null), f + "" || null;
+          }
+          return (
+            (a.x = function (n) {
+              return arguments.length ? ((t = "function" == typeof n ? n : Kg(+n)), a) : t;
+            }),
+            (a.y = function (t) {
+              return arguments.length ? ((n = "function" == typeof t ? t : Kg(+t)), a) : n;
+            }),
+            (a.defined = function (t) {
+              return arguments.length ? ((e = "function" == typeof t ? t : Kg(!!t)), a) : e;
+            }),
+            (a.curve = function (t) {
+              return arguments.length ? ((i = t), null != r && (o = i(r)), a) : i;
+            }),
+            (a.context = function (t) {
+              return arguments.length ? (null == t ? (r = o = null) : (o = i((r = t))), a) : r;
+            }),
+            a
+          );
+        }
+        function My() {
+          var t = my,
+            n = null,
+            e = Kg(0),
+            r = xy,
+            i = Kg(!0),
+            o = null,
+            a = by,
+            u = null;
+          function c(c) {
+            var f,
+              s,
+              l,
+              h,
+              d,
+              p = c.length,
+              v = !1,
+              g = new Array(p),
+              y = new Array(p);
+            for (null == o && (u = a((d = Hi()))), f = 0; f <= p; ++f) {
+              if (!(f < p && i((h = c[f]), f, c)) === v)
+                if ((v = !v)) (s = f), u.areaStart(), u.lineStart();
+                else {
+                  for (u.lineEnd(), u.lineStart(), l = f - 1; l >= s; --l) u.point(g[l], y[l]);
+                  u.lineEnd(), u.areaEnd();
+                }
+              v &&
+                ((g[f] = +t(h, f, c)), (y[f] = +e(h, f, c)), u.point(n ? +n(h, f, c) : g[f], r ? +r(h, f, c) : y[f]));
+            }
+            if (d) return (u = null), d + "" || null;
+          }
+          function f() {
+            return wy().defined(i).curve(a).context(o);
+          }
+          return (
+            (c.x = function (e) {
+              return arguments.length ? ((t = "function" == typeof e ? e : Kg(+e)), (n = null), c) : t;
+            }),
+            (c.x0 = function (n) {
+              return arguments.length ? ((t = "function" == typeof n ? n : Kg(+n)), c) : t;
+            }),
+            (c.x1 = function (t) {
+              return arguments.length ? ((n = null == t ? null : "function" == typeof t ? t : Kg(+t)), c) : n;
+            }),
+            (c.y = function (t) {
+              return arguments.length ? ((e = "function" == typeof t ? t : Kg(+t)), (r = null), c) : e;
+            }),
+            (c.y0 = function (t) {
+              return arguments.length ? ((e = "function" == typeof t ? t : Kg(+t)), c) : e;
+            }),
+            (c.y1 = function (t) {
+              return arguments.length ? ((r = null == t ? null : "function" == typeof t ? t : Kg(+t)), c) : r;
+            }),
+            (c.lineX0 = c.lineY0 =
+              function () {
+                return f().x(t).y(e);
+              }),
+            (c.lineY1 = function () {
+              return f().x(t).y(r);
+            }),
+            (c.lineX1 = function () {
+              return f().x(n).y(e);
+            }),
+            (c.defined = function (t) {
+              return arguments.length ? ((i = "function" == typeof t ? t : Kg(!!t)), c) : i;
+            }),
+            (c.curve = function (t) {
+              return arguments.length ? ((a = t), null != o && (u = a(o)), c) : a;
+            }),
+            (c.context = function (t) {
+              return arguments.length ? (null == t ? (o = u = null) : (u = a((o = t))), c) : o;
+            }),
+            c
+          );
+        }
+        function Ny(t, n) {
+          return n < t ? -1 : n > t ? 1 : n >= t ? 0 : NaN;
+        }
+        function Ay(t) {
+          return t;
+        }
+        _y.prototype = {
+          areaStart: function () {
+            this._line = 0;
+          },
+          areaEnd: function () {
+            this._line = NaN;
+          },
+          lineStart: function () {
+            this._point = 0;
+          },
+          lineEnd: function () {
+            (this._line || (0 !== this._line && 1 === this._point)) && this._context.closePath(),
+              (this._line = 1 - this._line);
+          },
+          point: function (t, n) {
+            switch (((t = +t), (n = +n), this._point)) {
+              case 0:
+                (this._point = 1), this._line ? this._context.lineTo(t, n) : this._context.moveTo(t, n);
+                break;
+              case 1:
+                this._point = 2;
+              default:
+                this._context.lineTo(t, n);
+            }
+          },
+        };
+        var Ty = ky(by);
+        function Sy(t) {
+          this._curve = t;
+        }
+        function ky(t) {
+          function n(n) {
+            return new Sy(t(n));
+          }
+          return (n._curve = t), n;
+        }
+        function Ey(t) {
+          var n = t.curve;
+          return (
+            (t.angle = t.x),
+            delete t.x,
+            (t.radius = t.y),
+            delete t.y,
+            (t.curve = function (t) {
+              return arguments.length ? n(ky(t)) : n()._curve;
+            }),
+            t
+          );
+        }
+        function Cy() {
+          return Ey(wy().curve(Ty));
+        }
+        function Py() {
+          var t = My().curve(Ty),
+            n = t.curve,
+            e = t.lineX0,
+            r = t.lineX1,
+            i = t.lineY0,
+            o = t.lineY1;
+          return (
+            (t.angle = t.x),
+            delete t.x,
+            (t.startAngle = t.x0),
+            delete t.x0,
+            (t.endAngle = t.x1),
+            delete t.x1,
+            (t.radius = t.y),
+            delete t.y,
+            (t.innerRadius = t.y0),
+            delete t.y0,
+            (t.outerRadius = t.y1),
+            delete t.y1,
+            (t.lineStartAngle = function () {
+              return Ey(e());
+            }),
+            delete t.lineX0,
+            (t.lineEndAngle = function () {
+              return Ey(r());
+            }),
+            delete t.lineX1,
+            (t.lineInnerRadius = function () {
+              return Ey(i());
+            }),
+            delete t.lineY0,
+            (t.lineOuterRadius = function () {
+              return Ey(o());
+            }),
+            delete t.lineY1,
+            (t.curve = function (t) {
+              return arguments.length ? n(ky(t)) : n()._curve;
+            }),
+            t
+          );
+        }
+        function zy(t, n) {
+          return [(n = +n) * Math.cos((t -= Math.PI / 2)), n * Math.sin(t)];
+        }
+        Sy.prototype = {
+          areaStart: function () {
+            this._curve.areaStart();
+          },
+          areaEnd: function () {
+            this._curve.areaEnd();
+          },
+          lineStart: function () {
+            this._curve.lineStart();
+          },
+          lineEnd: function () {
+            this._curve.lineEnd();
+          },
+          point: function (t, n) {
+            this._curve.point(n * Math.sin(t), n * -Math.cos(t));
+          },
+        };
+        var Ry = Array.prototype.slice;
+        function Dy(t) {
+          return t.source;
+        }
+        function qy(t) {
+          return t.target;
+        }
+        function Ly(t) {
+          var n = Dy,
+            e = qy,
+            r = my,
+            i = xy,
+            o = null;
+          function a() {
+            var a,
+              u = Ry.call(arguments),
+              c = n.apply(this, u),
+              f = e.apply(this, u);
+            if (
+              (o || (o = a = Hi()),
+              t(
+                o,
+                +r.apply(this, ((u[0] = c), u)),
+                +i.apply(this, u),
+                +r.apply(this, ((u[0] = f), u)),
+                +i.apply(this, u)
+              ),
+              a)
+            )
+              return (o = null), a + "" || null;
+          }
+          return (
+            (a.source = function (t) {
+              return arguments.length ? ((n = t), a) : n;
+            }),
+            (a.target = function (t) {
+              return arguments.length ? ((e = t), a) : e;
+            }),
+            (a.x = function (t) {
+              return arguments.length ? ((r = "function" == typeof t ? t : Kg(+t)), a) : r;
+            }),
+            (a.y = function (t) {
+              return arguments.length ? ((i = "function" == typeof t ? t : Kg(+t)), a) : i;
+            }),
+            (a.context = function (t) {
+              return arguments.length ? ((o = null == t ? null : t), a) : o;
+            }),
+            a
+          );
+        }
+        function Uy(t, n, e, r, i) {
+          t.moveTo(n, e), t.bezierCurveTo((n = (n + r) / 2), e, n, i, r, i);
+        }
+        function Oy(t, n, e, r, i) {
+          t.moveTo(n, e), t.bezierCurveTo(n, (e = (e + i) / 2), r, e, r, i);
+        }
+        function By(t, n, e, r, i) {
+          var o = zy(n, e),
+            a = zy(n, (e = (e + i) / 2)),
+            u = zy(r, e),
+            c = zy(r, i);
+          t.moveTo(o[0], o[1]), t.bezierCurveTo(a[0], a[1], u[0], u[1], c[0], c[1]);
+        }
+        var Yy = {
+            draw: function (t, n) {
+              var e = Math.sqrt(n / cy);
+              t.moveTo(e, 0), t.arc(0, 0, e, 0, sy);
+            },
+          },
+          Fy = {
+            draw: function (t, n) {
+              var e = Math.sqrt(n / 5) / 2;
+              t.moveTo(-3 * e, -e),
+                t.lineTo(-e, -e),
+                t.lineTo(-e, -3 * e),
+                t.lineTo(e, -3 * e),
+                t.lineTo(e, -e),
+                t.lineTo(3 * e, -e),
+                t.lineTo(3 * e, e),
+                t.lineTo(e, e),
+                t.lineTo(e, 3 * e),
+                t.lineTo(-e, 3 * e),
+                t.lineTo(-e, e),
+                t.lineTo(-3 * e, e),
+                t.closePath();
+            },
+          },
+          Iy = Math.sqrt(1 / 3),
+          jy = 2 * Iy,
+          Hy = {
+            draw: function (t, n) {
+              var e = Math.sqrt(n / jy),
+                r = e * Iy;
+              t.moveTo(0, -e), t.lineTo(r, 0), t.lineTo(0, e), t.lineTo(-r, 0), t.closePath();
+            },
+          },
+          Xy = Math.sin(cy / 10) / Math.sin((7 * cy) / 10),
+          Gy = Math.sin(sy / 10) * Xy,
+          Vy = -Math.cos(sy / 10) * Xy,
+          $y = {
+            draw: function (t, n) {
+              var e = Math.sqrt(0.8908130915292852 * n),
+                r = Gy * e,
+                i = Vy * e;
+              t.moveTo(0, -e), t.lineTo(r, i);
+              for (var o = 1; o < 5; ++o) {
+                var a = (sy * o) / 5,
+                  u = Math.cos(a),
+                  c = Math.sin(a);
+                t.lineTo(c * e, -u * e), t.lineTo(u * r - c * i, c * r + u * i);
+              }
+              t.closePath();
+            },
+          },
+          Wy = {
+            draw: function (t, n) {
+              var e = Math.sqrt(n),
+                r = -e / 2;
+              t.rect(r, r, e, e);
+            },
+          },
+          Zy = Math.sqrt(3),
+          Qy = {
+            draw: function (t, n) {
+              var e = -Math.sqrt(n / (3 * Zy));
+              t.moveTo(0, 2 * e), t.lineTo(-Zy * e, -e), t.lineTo(Zy * e, -e), t.closePath();
+            },
+          },
+          Jy = Math.sqrt(3) / 2,
+          Ky = 1 / Math.sqrt(12),
+          t_ = 3 * (Ky / 2 + 1),
+          n_ = {
+            draw: function (t, n) {
+              var e = Math.sqrt(n / t_),
+                r = e / 2,
+                i = e * Ky,
+                o = r,
+                a = e * Ky + e,
+                u = -o,
+                c = a;
+              t.moveTo(r, i),
+                t.lineTo(o, a),
+                t.lineTo(u, c),
+                t.lineTo(-0.5 * r - Jy * i, Jy * r + -0.5 * i),
+                t.lineTo(-0.5 * o - Jy * a, Jy * o + -0.5 * a),
+                t.lineTo(-0.5 * u - Jy * c, Jy * u + -0.5 * c),
+                t.lineTo(-0.5 * r + Jy * i, -0.5 * i - Jy * r),
+                t.lineTo(-0.5 * o + Jy * a, -0.5 * a - Jy * o),
+                t.lineTo(-0.5 * u + Jy * c, -0.5 * c - Jy * u),
+                t.closePath();
+            },
+          },
+          e_ = [Yy, Fy, Hy, Wy, $y, Qy, n_];
+        function r_() {}
+        function i_(t, n, e) {
+          t._context.bezierCurveTo(
+            (2 * t._x0 + t._x1) / 3,
+            (2 * t._y0 + t._y1) / 3,
+            (t._x0 + 2 * t._x1) / 3,
+            (t._y0 + 2 * t._y1) / 3,
+            (t._x0 + 4 * t._x1 + n) / 6,
+            (t._y0 + 4 * t._y1 + e) / 6
+          );
+        }
+        function o_(t) {
+          this._context = t;
+        }
+        function a_(t) {
+          this._context = t;
+        }
+        function u_(t) {
+          this._context = t;
+        }
+        function c_(t, n) {
+          (this._basis = new o_(t)), (this._beta = n);
+        }
+        (o_.prototype = {
+          areaStart: function () {
+            this._line = 0;
+          },
+          areaEnd: function () {
+            this._line = NaN;
+          },
+          lineStart: function () {
+            (this._x0 = this._x1 = this._y0 = this._y1 = NaN), (this._point = 0);
+          },
+          lineEnd: function () {
+            switch (this._point) {
+              case 3:
+                i_(this, this._x1, this._y1);
+              case 2:
+                this._context.lineTo(this._x1, this._y1);
+            }
+            (this._line || (0 !== this._line && 1 === this._point)) && this._context.closePath(),
+              (this._line = 1 - this._line);
+          },
+          point: function (t, n) {
+            switch (((t = +t), (n = +n), this._point)) {
+              case 0:
+                (this._point = 1), this._line ? this._context.lineTo(t, n) : this._context.moveTo(t, n);
+                break;
+              case 1:
+                this._point = 2;
+                break;
+              case 2:
+                (this._point = 3), this._context.lineTo((5 * this._x0 + this._x1) / 6, (5 * this._y0 + this._y1) / 6);
+              default:
+                i_(this, t, n);
+            }
+            (this._x0 = this._x1), (this._x1 = t), (this._y0 = this._y1), (this._y1 = n);
+          },
+        }),
+          (a_.prototype = {
+            areaStart: r_,
+            areaEnd: r_,
+            lineStart: function () {
+              (this._x0 =
+                this._x1 =
+                this._x2 =
+                this._x3 =
+                this._x4 =
+                this._y0 =
+                this._y1 =
+                this._y2 =
+                this._y3 =
+                this._y4 =
+                  NaN),
+                (this._point = 0);
+            },
+            lineEnd: function () {
+              switch (this._point) {
+                case 1:
+                  this._context.moveTo(this._x2, this._y2), this._context.closePath();
+                  break;
+                case 2:
+                  this._context.moveTo((this._x2 + 2 * this._x3) / 3, (this._y2 + 2 * this._y3) / 3),
+                    this._context.lineTo((this._x3 + 2 * this._x2) / 3, (this._y3 + 2 * this._y2) / 3),
+                    this._context.closePath();
+                  break;
+                case 3:
+                  this.point(this._x2, this._y2), this.point(this._x3, this._y3), this.point(this._x4, this._y4);
+              }
+            },
+            point: function (t, n) {
+              switch (((t = +t), (n = +n), this._point)) {
+                case 0:
+                  (this._point = 1), (this._x2 = t), (this._y2 = n);
+                  break;
+                case 1:
+                  (this._point = 2), (this._x3 = t), (this._y3 = n);
+                  break;
+                case 2:
+                  (this._point = 3),
+                    (this._x4 = t),
+                    (this._y4 = n),
+                    this._context.moveTo((this._x0 + 4 * this._x1 + t) / 6, (this._y0 + 4 * this._y1 + n) / 6);
+                  break;
+                default:
+                  i_(this, t, n);
+              }
+              (this._x0 = this._x1), (this._x1 = t), (this._y0 = this._y1), (this._y1 = n);
+            },
+          }),
+          (u_.prototype = {
+            areaStart: function () {
+              this._line = 0;
+            },
+            areaEnd: function () {
+              this._line = NaN;
+            },
+            lineStart: function () {
+              (this._x0 = this._x1 = this._y0 = this._y1 = NaN), (this._point = 0);
+            },
+            lineEnd: function () {
+              (this._line || (0 !== this._line && 3 === this._point)) && this._context.closePath(),
+                (this._line = 1 - this._line);
+            },
+            point: function (t, n) {
+              switch (((t = +t), (n = +n), this._point)) {
+                case 0:
+                  this._point = 1;
+                  break;
+                case 1:
+                  this._point = 2;
+                  break;
+                case 2:
+                  this._point = 3;
+                  var e = (this._x0 + 4 * this._x1 + t) / 6,
+                    r = (this._y0 + 4 * this._y1 + n) / 6;
+                  this._line ? this._context.lineTo(e, r) : this._context.moveTo(e, r);
+                  break;
+                case 3:
+                  this._point = 4;
+                default:
+                  i_(this, t, n);
+              }
+              (this._x0 = this._x1), (this._x1 = t), (this._y0 = this._y1), (this._y1 = n);
+            },
+          }),
+          (c_.prototype = {
+            lineStart: function () {
+              (this._x = []), (this._y = []), this._basis.lineStart();
+            },
+            lineEnd: function () {
+              var t = this._x,
+                n = this._y,
+                e = t.length - 1;
+              if (e > 0)
+                for (var r, i = t[0], o = n[0], a = t[e] - i, u = n[e] - o, c = -1; ++c <= e; )
+                  (r = c / e),
+                    this._basis.point(
+                      this._beta * t[c] + (1 - this._beta) * (i + r * a),
+                      this._beta * n[c] + (1 - this._beta) * (o + r * u)
+                    );
+              (this._x = this._y = null), this._basis.lineEnd();
+            },
+            point: function (t, n) {
+              this._x.push(+t), this._y.push(+n);
+            },
+          });
+        var f_ = (function t(n) {
+          function e(t) {
+            return 1 === n ? new o_(t) : new c_(t, n);
+          }
+          return (
+            (e.beta = function (n) {
+              return t(+n);
+            }),
+            e
+          );
+        })(0.85);
+        function s_(t, n, e) {
+          t._context.bezierCurveTo(
+            t._x1 + t._k * (t._x2 - t._x0),
+            t._y1 + t._k * (t._y2 - t._y0),
+            t._x2 + t._k * (t._x1 - n),
+            t._y2 + t._k * (t._y1 - e),
+            t._x2,
+            t._y2
+          );
+        }
+        function l_(t, n) {
+          (this._context = t), (this._k = (1 - n) / 6);
+        }
+        l_.prototype = {
+          areaStart: function () {
+            this._line = 0;
+          },
+          areaEnd: function () {
+            this._line = NaN;
+          },
+          lineStart: function () {
+            (this._x0 = this._x1 = this._x2 = this._y0 = this._y1 = this._y2 = NaN), (this._point = 0);
+          },
+          lineEnd: function () {
+            switch (this._point) {
+              case 2:
+                this._context.lineTo(this._x2, this._y2);
+                break;
+              case 3:
+                s_(this, this._x1, this._y1);
+            }
+            (this._line || (0 !== this._line && 1 === this._point)) && this._context.closePath(),
+              (this._line = 1 - this._line);
+          },
+          point: function (t, n) {
+            switch (((t = +t), (n = +n), this._point)) {
+              case 0:
+                (this._point = 1), this._line ? this._context.lineTo(t, n) : this._context.moveTo(t, n);
+                break;
+              case 1:
+                (this._point = 2), (this._x1 = t), (this._y1 = n);
+                break;
+              case 2:
+                this._point = 3;
+              default:
+                s_(this, t, n);
+            }
+            (this._x0 = this._x1),
+              (this._x1 = this._x2),
+              (this._x2 = t),
+              (this._y0 = this._y1),
+              (this._y1 = this._y2),
+              (this._y2 = n);
+          },
+        };
+        var h_ = (function t(n) {
+          function e(t) {
+            return new l_(t, n);
+          }
+          return (
+            (e.tension = function (n) {
+              return t(+n);
+            }),
+            e
+          );
+        })(0);
+        function d_(t, n) {
+          (this._context = t), (this._k = (1 - n) / 6);
+        }
+        d_.prototype = {
+          areaStart: r_,
+          areaEnd: r_,
+          lineStart: function () {
+            (this._x0 =
+              this._x1 =
+              this._x2 =
+              this._x3 =
+              this._x4 =
+              this._x5 =
+              this._y0 =
+              this._y1 =
+              this._y2 =
+              this._y3 =
+              this._y4 =
+              this._y5 =
+                NaN),
+              (this._point = 0);
+          },
+          lineEnd: function () {
+            switch (this._point) {
+              case 1:
+                this._context.moveTo(this._x3, this._y3), this._context.closePath();
+                break;
+              case 2:
+                this._context.lineTo(this._x3, this._y3), this._context.closePath();
+                break;
+              case 3:
+                this.point(this._x3, this._y3), this.point(this._x4, this._y4), this.point(this._x5, this._y5);
+            }
+          },
+          point: function (t, n) {
+            switch (((t = +t), (n = +n), this._point)) {
+              case 0:
+                (this._point = 1), (this._x3 = t), (this._y3 = n);
+                break;
+              case 1:
+                (this._point = 2), this._context.moveTo((this._x4 = t), (this._y4 = n));
+                break;
+              case 2:
+                (this._point = 3), (this._x5 = t), (this._y5 = n);
+                break;
+              default:
+                s_(this, t, n);
+            }
+            (this._x0 = this._x1),
+              (this._x1 = this._x2),
+              (this._x2 = t),
+              (this._y0 = this._y1),
+              (this._y1 = this._y2),
+              (this._y2 = n);
+          },
+        };
+        var p_ = (function t(n) {
+          function e(t) {
+            return new d_(t, n);
+          }
+          return (
+            (e.tension = function (n) {
+              return t(+n);
+            }),
+            e
+          );
+        })(0);
+        function v_(t, n) {
+          (this._context = t), (this._k = (1 - n) / 6);
+        }
+        v_.prototype = {
+          areaStart: function () {
+            this._line = 0;
+          },
+          areaEnd: function () {
+            this._line = NaN;
+          },
+          lineStart: function () {
+            (this._x0 = this._x1 = this._x2 = this._y0 = this._y1 = this._y2 = NaN), (this._point = 0);
+          },
+          lineEnd: function () {
+            (this._line || (0 !== this._line && 3 === this._point)) && this._context.closePath(),
+              (this._line = 1 - this._line);
+          },
+          point: function (t, n) {
+            switch (((t = +t), (n = +n), this._point)) {
+              case 0:
+                this._point = 1;
+                break;
+              case 1:
+                this._point = 2;
+                break;
+              case 2:
+                (this._point = 3),
+                  this._line ? this._context.lineTo(this._x2, this._y2) : this._context.moveTo(this._x2, this._y2);
+                break;
+              case 3:
+                this._point = 4;
+              default:
+                s_(this, t, n);
+            }
+            (this._x0 = this._x1),
+              (this._x1 = this._x2),
+              (this._x2 = t),
+              (this._y0 = this._y1),
+              (this._y1 = this._y2),
+              (this._y2 = n);
+          },
+        };
+        var g_ = (function t(n) {
+          function e(t) {
+            return new v_(t, n);
+          }
+          return (
+            (e.tension = function (n) {
+              return t(+n);
+            }),
+            e
+          );
+        })(0);
+        function y_(t, n, e) {
+          var r = t._x1,
+            i = t._y1,
+            o = t._x2,
+            a = t._y2;
+          if (t._l01_a > uy) {
+            var u = 2 * t._l01_2a + 3 * t._l01_a * t._l12_a + t._l12_2a,
+              c = 3 * t._l01_a * (t._l01_a + t._l12_a);
+            (r = (r * u - t._x0 * t._l12_2a + t._x2 * t._l01_2a) / c),
+              (i = (i * u - t._y0 * t._l12_2a + t._y2 * t._l01_2a) / c);
+          }
+          if (t._l23_a > uy) {
+            var f = 2 * t._l23_2a + 3 * t._l23_a * t._l12_a + t._l12_2a,
+              s = 3 * t._l23_a * (t._l23_a + t._l12_a);
+            (o = (o * f + t._x1 * t._l23_2a - n * t._l12_2a) / s),
+              (a = (a * f + t._y1 * t._l23_2a - e * t._l12_2a) / s);
+          }
+          t._context.bezierCurveTo(r, i, o, a, t._x2, t._y2);
+        }
+        function __(t, n) {
+          (this._context = t), (this._alpha = n);
+        }
+        __.prototype = {
+          areaStart: function () {
+            this._line = 0;
+          },
+          areaEnd: function () {
+            this._line = NaN;
+          },
+          lineStart: function () {
+            (this._x0 = this._x1 = this._x2 = this._y0 = this._y1 = this._y2 = NaN),
+              (this._l01_a = this._l12_a = this._l23_a = this._l01_2a = this._l12_2a = this._l23_2a = this._point = 0);
+          },
+          lineEnd: function () {
+            switch (this._point) {
+              case 2:
+                this._context.lineTo(this._x2, this._y2);
+                break;
+              case 3:
+                this.point(this._x2, this._y2);
+            }
+            (this._line || (0 !== this._line && 1 === this._point)) && this._context.closePath(),
+              (this._line = 1 - this._line);
+          },
+          point: function (t, n) {
+            if (((t = +t), (n = +n), this._point)) {
+              var e = this._x2 - t,
+                r = this._y2 - n;
+              this._l23_a = Math.sqrt((this._l23_2a = Math.pow(e * e + r * r, this._alpha)));
+            }
+            switch (this._point) {
+              case 0:
+                (this._point = 1), this._line ? this._context.lineTo(t, n) : this._context.moveTo(t, n);
+                break;
+              case 1:
+                this._point = 2;
+                break;
+              case 2:
+                this._point = 3;
+              default:
+                y_(this, t, n);
+            }
+            (this._l01_a = this._l12_a),
+              (this._l12_a = this._l23_a),
+              (this._l01_2a = this._l12_2a),
+              (this._l12_2a = this._l23_2a),
+              (this._x0 = this._x1),
+              (this._x1 = this._x2),
+              (this._x2 = t),
+              (this._y0 = this._y1),
+              (this._y1 = this._y2),
+              (this._y2 = n);
+          },
+        };
+        var b_ = (function t(n) {
+          function e(t) {
+            return n ? new __(t, n) : new l_(t, 0);
+          }
+          return (
+            (e.alpha = function (n) {
+              return t(+n);
+            }),
+            e
+          );
+        })(0.5);
+        function m_(t, n) {
+          (this._context = t), (this._alpha = n);
+        }
+        m_.prototype = {
+          areaStart: r_,
+          areaEnd: r_,
+          lineStart: function () {
+            (this._x0 =
+              this._x1 =
+              this._x2 =
+              this._x3 =
+              this._x4 =
+              this._x5 =
+              this._y0 =
+              this._y1 =
+              this._y2 =
+              this._y3 =
+              this._y4 =
+              this._y5 =
+                NaN),
+              (this._l01_a = this._l12_a = this._l23_a = this._l01_2a = this._l12_2a = this._l23_2a = this._point = 0);
+          },
+          lineEnd: function () {
+            switch (this._point) {
+              case 1:
+                this._context.moveTo(this._x3, this._y3), this._context.closePath();
+                break;
+              case 2:
+                this._context.lineTo(this._x3, this._y3), this._context.closePath();
+                break;
+              case 3:
+                this.point(this._x3, this._y3), this.point(this._x4, this._y4), this.point(this._x5, this._y5);
+            }
+          },
+          point: function (t, n) {
+            if (((t = +t), (n = +n), this._point)) {
+              var e = this._x2 - t,
+                r = this._y2 - n;
+              this._l23_a = Math.sqrt((this._l23_2a = Math.pow(e * e + r * r, this._alpha)));
+            }
+            switch (this._point) {
+              case 0:
+                (this._point = 1), (this._x3 = t), (this._y3 = n);
+                break;
+              case 1:
+                (this._point = 2), this._context.moveTo((this._x4 = t), (this._y4 = n));
+                break;
+              case 2:
+                (this._point = 3), (this._x5 = t), (this._y5 = n);
+                break;
+              default:
+                y_(this, t, n);
+            }
+            (this._l01_a = this._l12_a),
+              (this._l12_a = this._l23_a),
+              (this._l01_2a = this._l12_2a),
+              (this._l12_2a = this._l23_2a),
+              (this._x0 = this._x1),
+              (this._x1 = this._x2),
+              (this._x2 = t),
+              (this._y0 = this._y1),
+              (this._y1 = this._y2),
+              (this._y2 = n);
+          },
+        };
+        var x_ = (function t(n) {
+          function e(t) {
+            return n ? new m_(t, n) : new d_(t, 0);
+          }
+          return (
+            (e.alpha = function (n) {
+              return t(+n);
+            }),
+            e
+          );
+        })(0.5);
+        function w_(t, n) {
+          (this._context = t), (this._alpha = n);
+        }
+        w_.prototype = {
+          areaStart: function () {
+            this._line = 0;
+          },
+          areaEnd: function () {
+            this._line = NaN;
+          },
+          lineStart: function () {
+            (this._x0 = this._x1 = this._x2 = this._y0 = this._y1 = this._y2 = NaN),
+              (this._l01_a = this._l12_a = this._l23_a = this._l01_2a = this._l12_2a = this._l23_2a = this._point = 0);
+          },
+          lineEnd: function () {
+            (this._line || (0 !== this._line && 3 === this._point)) && this._context.closePath(),
+              (this._line = 1 - this._line);
+          },
+          point: function (t, n) {
+            if (((t = +t), (n = +n), this._point)) {
+              var e = this._x2 - t,
+                r = this._y2 - n;
+              this._l23_a = Math.sqrt((this._l23_2a = Math.pow(e * e + r * r, this._alpha)));
+            }
+            switch (this._point) {
+              case 0:
+                this._point = 1;
+                break;
+              case 1:
+                this._point = 2;
+                break;
+              case 2:
+                (this._point = 3),
+                  this._line ? this._context.lineTo(this._x2, this._y2) : this._context.moveTo(this._x2, this._y2);
+                break;
+              case 3:
+                this._point = 4;
+              default:
+                y_(this, t, n);
+            }
+            (this._l01_a = this._l12_a),
+              (this._l12_a = this._l23_a),
+              (this._l01_2a = this._l12_2a),
+              (this._l12_2a = this._l23_2a),
+              (this._x0 = this._x1),
+              (this._x1 = this._x2),
+              (this._x2 = t),
+              (this._y0 = this._y1),
+              (this._y1 = this._y2),
+              (this._y2 = n);
+          },
+        };
+        var M_ = (function t(n) {
+          function e(t) {
+            return n ? new w_(t, n) : new v_(t, 0);
+          }
+          return (
+            (e.alpha = function (n) {
+              return t(+n);
+            }),
+            e
+          );
+        })(0.5);
+        function N_(t) {
+          this._context = t;
+        }
+        function A_(t) {
+          return t < 0 ? -1 : 1;
+        }
+        function T_(t, n, e) {
+          var r = t._x1 - t._x0,
+            i = n - t._x1,
+            o = (t._y1 - t._y0) / (r || (i < 0 && -0)),
+            a = (e - t._y1) / (i || (r < 0 && -0)),
+            u = (o * i + a * r) / (r + i);
+          return (A_(o) + A_(a)) * Math.min(Math.abs(o), Math.abs(a), 0.5 * Math.abs(u)) || 0;
+        }
+        function S_(t, n) {
+          var e = t._x1 - t._x0;
+          return e ? ((3 * (t._y1 - t._y0)) / e - n) / 2 : n;
+        }
+        function k_(t, n, e) {
+          var r = t._x0,
+            i = t._y0,
+            o = t._x1,
+            a = t._y1,
+            u = (o - r) / 3;
+          t._context.bezierCurveTo(r + u, i + u * n, o - u, a - u * e, o, a);
+        }
+        function E_(t) {
+          this._context = t;
+        }
+        function C_(t) {
+          this._context = new P_(t);
+        }
+        function P_(t) {
+          this._context = t;
+        }
+        function z_(t) {
+          this._context = t;
+        }
+        function R_(t) {
+          var n,
+            e,
+            r = t.length - 1,
+            i = new Array(r),
+            o = new Array(r),
+            a = new Array(r);
+          for (i[0] = 0, o[0] = 2, a[0] = t[0] + 2 * t[1], n = 1; n < r - 1; ++n)
+            (i[n] = 1), (o[n] = 4), (a[n] = 4 * t[n] + 2 * t[n + 1]);
+          for (i[r - 1] = 2, o[r - 1] = 7, a[r - 1] = 8 * t[r - 1] + t[r], n = 1; n < r; ++n)
+            (e = i[n] / o[n - 1]), (o[n] -= e), (a[n] -= e * a[n - 1]);
+          for (i[r - 1] = a[r - 1] / o[r - 1], n = r - 2; n >= 0; --n) i[n] = (a[n] - i[n + 1]) / o[n];
+          for (o[r - 1] = (t[r] + i[r - 1]) / 2, n = 0; n < r - 1; ++n) o[n] = 2 * t[n + 1] - i[n + 1];
+          return [i, o];
+        }
+        function D_(t, n) {
+          (this._context = t), (this._t = n);
+        }
+        function q_(t, n) {
+          if ((i = t.length) > 1)
+            for (var e, r, i, o = 1, a = t[n[0]], u = a.length; o < i; ++o)
+              for (r = a, a = t[n[o]], e = 0; e < u; ++e) a[e][1] += a[e][0] = isNaN(r[e][1]) ? r[e][0] : r[e][1];
+        }
+        function L_(t) {
+          for (var n = t.length, e = new Array(n); --n >= 0; ) e[n] = n;
+          return e;
+        }
+        function U_(t, n) {
+          return t[n];
+        }
+        function O_(t) {
+          var n = t.map(B_);
+          return L_(t).sort(function (t, e) {
+            return n[t] - n[e];
+          });
+        }
+        function B_(t) {
+          for (var n, e = -1, r = 0, i = t.length, o = -1 / 0; ++e < i; ) (n = +t[e][1]) > o && ((o = n), (r = e));
+          return r;
+        }
+        function Y_(t) {
+          var n = t.map(F_);
+          return L_(t).sort(function (t, e) {
+            return n[t] - n[e];
+          });
+        }
+        function F_(t) {
+          for (var n, e = 0, r = -1, i = t.length; ++r < i; ) (n = +t[r][1]) && (e += n);
+          return e;
+        }
+        function I_(t) {
+          return function () {
+            return t;
+          };
+        }
+        function j_(t) {
+          return t[0];
+        }
+        function H_(t) {
+          return t[1];
+        }
+        function X_() {
+          this._ = null;
+        }
+        function G_(t) {
+          t.U = t.C = t.L = t.R = t.P = t.N = null;
+        }
+        function V_(t, n) {
+          var e = n,
+            r = n.R,
+            i = e.U;
+          i ? (i.L === e ? (i.L = r) : (i.R = r)) : (t._ = r),
+            (r.U = i),
+            (e.U = r),
+            (e.R = r.L),
+            e.R && (e.R.U = e),
+            (r.L = e);
+        }
+        function $_(t, n) {
+          var e = n,
+            r = n.L,
+            i = e.U;
+          i ? (i.L === e ? (i.L = r) : (i.R = r)) : (t._ = r),
+            (r.U = i),
+            (e.U = r),
+            (e.L = r.R),
+            e.L && (e.L.U = e),
+            (r.R = e);
+        }
+        function W_(t) {
+          for (; t.L; ) t = t.L;
+          return t;
+        }
+        function Z_(t, n, e, r) {
+          var i = [null, null],
+            o = mb.push(i) - 1;
+          return (
+            (i.left = t),
+            (i.right = n),
+            e && J_(i, t, n, e),
+            r && J_(i, n, t, r),
+            _b[t.index].halfedges.push(o),
+            _b[n.index].halfedges.push(o),
+            i
+          );
+        }
+        function Q_(t, n, e) {
+          var r = [n, e];
+          return (r.left = t), r;
+        }
+        function J_(t, n, e, r) {
+          t[0] || t[1] ? (t.left === e ? (t[1] = r) : (t[0] = r)) : ((t[0] = r), (t.left = n), (t.right = e));
+        }
+        function K_(t, n, e, r, i) {
+          var o,
+            a = t[0],
+            u = t[1],
+            c = a[0],
+            f = a[1],
+            s = 0,
+            l = 1,
+            h = u[0] - c,
+            d = u[1] - f;
+          if (((o = n - c), h || !(o > 0))) {
+            if (((o /= h), h < 0)) {
+              if (o < s) return;
+              o < l && (l = o);
+            } else if (h > 0) {
+              if (o > l) return;
+              o > s && (s = o);
+            }
+            if (((o = r - c), h || !(o < 0))) {
+              if (((o /= h), h < 0)) {
+                if (o > l) return;
+                o > s && (s = o);
+              } else if (h > 0) {
+                if (o < s) return;
+                o < l && (l = o);
+              }
+              if (((o = e - f), d || !(o > 0))) {
+                if (((o /= d), d < 0)) {
+                  if (o < s) return;
+                  o < l && (l = o);
+                } else if (d > 0) {
+                  if (o > l) return;
+                  o > s && (s = o);
+                }
+                if (((o = i - f), d || !(o < 0))) {
+                  if (((o /= d), d < 0)) {
+                    if (o > l) return;
+                    o > s && (s = o);
+                  } else if (d > 0) {
+                    if (o < s) return;
+                    o < l && (l = o);
+                  }
+                  return (
+                    !(s > 0 || l < 1) ||
+                    (s > 0 && (t[0] = [c + s * h, f + s * d]), l < 1 && (t[1] = [c + l * h, f + l * d]), !0)
+                  );
+                }
+              }
+            }
+          }
+        }
+        function tb(t, n, e, r, i) {
+          var o = t[1];
+          if (o) return !0;
+          var a,
+            u,
+            c = t[0],
+            f = t.left,
+            s = t.right,
+            l = f[0],
+            h = f[1],
+            d = s[0],
+            p = s[1],
+            v = (l + d) / 2,
+            g = (h + p) / 2;
+          if (p === h) {
+            if (v < n || v >= r) return;
+            if (l > d) {
+              if (c) {
+                if (c[1] >= i) return;
+              } else c = [v, e];
+              o = [v, i];
+            } else {
+              if (c) {
+                if (c[1] < e) return;
+              } else c = [v, i];
+              o = [v, e];
+            }
+          } else if (((u = g - (a = (l - d) / (p - h)) * v), a < -1 || a > 1))
+            if (l > d) {
+              if (c) {
+                if (c[1] >= i) return;
+              } else c = [(e - u) / a, e];
+              o = [(i - u) / a, i];
+            } else {
+              if (c) {
+                if (c[1] < e) return;
+              } else c = [(i - u) / a, i];
+              o = [(e - u) / a, e];
+            }
+          else if (h < p) {
+            if (c) {
+              if (c[0] >= r) return;
+            } else c = [n, a * n + u];
+            o = [r, a * r + u];
+          } else {
+            if (c) {
+              if (c[0] < n) return;
+            } else c = [r, a * r + u];
+            o = [n, a * n + u];
+          }
+          return (t[0] = c), (t[1] = o), !0;
+        }
+        function nb(t, n) {
+          var e = t.site,
+            r = n.left,
+            i = n.right;
+          return (
+            e === i && ((i = r), (r = e)),
+            i
+              ? Math.atan2(i[1] - r[1], i[0] - r[0])
+              : (e === r ? ((r = n[1]), (i = n[0])) : ((r = n[0]), (i = n[1])), Math.atan2(r[0] - i[0], i[1] - r[1]))
+          );
+        }
+        function eb(t, n) {
+          return n[+(n.left !== t.site)];
+        }
+        function rb(t, n) {
+          return n[+(n.left === t.site)];
+        }
+        (N_.prototype = {
+          areaStart: r_,
+          areaEnd: r_,
+          lineStart: function () {
+            this._point = 0;
+          },
+          lineEnd: function () {
+            this._point && this._context.closePath();
+          },
+          point: function (t, n) {
+            (t = +t),
+              (n = +n),
+              this._point ? this._context.lineTo(t, n) : ((this._point = 1), this._context.moveTo(t, n));
+          },
+        }),
+          (E_.prototype = {
+            areaStart: function () {
+              this._line = 0;
+            },
+            areaEnd: function () {
+              this._line = NaN;
+            },
+            lineStart: function () {
+              (this._x0 = this._x1 = this._y0 = this._y1 = this._t0 = NaN), (this._point = 0);
+            },
+            lineEnd: function () {
+              switch (this._point) {
+                case 2:
+                  this._context.lineTo(this._x1, this._y1);
+                  break;
+                case 3:
+                  k_(this, this._t0, S_(this, this._t0));
+              }
+              (this._line || (0 !== this._line && 1 === this._point)) && this._context.closePath(),
+                (this._line = 1 - this._line);
+            },
+            point: function (t, n) {
+              var e = NaN;
+              if (((n = +n), (t = +t) !== this._x1 || n !== this._y1)) {
+                switch (this._point) {
+                  case 0:
+                    (this._point = 1), this._line ? this._context.lineTo(t, n) : this._context.moveTo(t, n);
+                    break;
+                  case 1:
+                    this._point = 2;
+                    break;
+                  case 2:
+                    (this._point = 3), k_(this, S_(this, (e = T_(this, t, n))), e);
+                    break;
+                  default:
+                    k_(this, this._t0, (e = T_(this, t, n)));
+                }
+                (this._x0 = this._x1), (this._x1 = t), (this._y0 = this._y1), (this._y1 = n), (this._t0 = e);
+              }
+            },
+          }),
+          ((C_.prototype = Object.create(E_.prototype)).point = function (t, n) {
+            E_.prototype.point.call(this, n, t);
+          }),
+          (P_.prototype = {
+            moveTo: function (t, n) {
+              this._context.moveTo(n, t);
+            },
+            closePath: function () {
+              this._context.closePath();
+            },
+            lineTo: function (t, n) {
+              this._context.lineTo(n, t);
+            },
+            bezierCurveTo: function (t, n, e, r, i, o) {
+              this._context.bezierCurveTo(n, t, r, e, o, i);
+            },
+          }),
+          (z_.prototype = {
+            areaStart: function () {
+              this._line = 0;
+            },
+            areaEnd: function () {
+              this._line = NaN;
+            },
+            lineStart: function () {
+              (this._x = []), (this._y = []);
+            },
+            lineEnd: function () {
+              var t = this._x,
+                n = this._y,
+                e = t.length;
+              if (e)
+                if ((this._line ? this._context.lineTo(t[0], n[0]) : this._context.moveTo(t[0], n[0]), 2 === e))
+                  this._context.lineTo(t[1], n[1]);
+                else
+                  for (var r = R_(t), i = R_(n), o = 0, a = 1; a < e; ++o, ++a)
+                    this._context.bezierCurveTo(r[0][o], i[0][o], r[1][o], i[1][o], t[a], n[a]);
+              (this._line || (0 !== this._line && 1 === e)) && this._context.closePath(),
+                (this._line = 1 - this._line),
+                (this._x = this._y = null);
+            },
+            point: function (t, n) {
+              this._x.push(+t), this._y.push(+n);
+            },
+          }),
+          (D_.prototype = {
+            areaStart: function () {
+              this._line = 0;
+            },
+            areaEnd: function () {
+              this._line = NaN;
+            },
+            lineStart: function () {
+              (this._x = this._y = NaN), (this._point = 0);
+            },
+            lineEnd: function () {
+              0 < this._t && this._t < 1 && 2 === this._point && this._context.lineTo(this._x, this._y),
+                (this._line || (0 !== this._line && 1 === this._point)) && this._context.closePath(),
+                this._line >= 0 && ((this._t = 1 - this._t), (this._line = 1 - this._line));
+            },
+            point: function (t, n) {
+              switch (((t = +t), (n = +n), this._point)) {
+                case 0:
+                  (this._point = 1), this._line ? this._context.lineTo(t, n) : this._context.moveTo(t, n);
+                  break;
+                case 1:
+                  this._point = 2;
+                default:
+                  if (this._t <= 0) this._context.lineTo(this._x, n), this._context.lineTo(t, n);
+                  else {
+                    var e = this._x * (1 - this._t) + t * this._t;
+                    this._context.lineTo(e, this._y), this._context.lineTo(e, n);
+                  }
+              }
+              (this._x = t), (this._y = n);
+            },
+          }),
+          (X_.prototype = {
+            constructor: X_,
+            insert: function (t, n) {
+              var e, r, i;
+              if (t) {
+                if (((n.P = t), (n.N = t.N), t.N && (t.N.P = n), (t.N = n), t.R)) {
+                  for (t = t.R; t.L; ) t = t.L;
+                  t.L = n;
+                } else t.R = n;
+                e = t;
+              } else
+                this._
+                  ? ((t = W_(this._)), (n.P = null), (n.N = t), (t.P = t.L = n), (e = t))
+                  : ((n.P = n.N = null), (this._ = n), (e = null));
+              for (n.L = n.R = null, n.U = e, n.C = !0, t = n; e && e.C; )
+                e === (r = e.U).L
+                  ? (i = r.R) && i.C
+                    ? ((e.C = i.C = !1), (r.C = !0), (t = r))
+                    : (t === e.R && (V_(this, e), (e = (t = e).U)), (e.C = !1), (r.C = !0), $_(this, r))
+                  : (i = r.L) && i.C
+                    ? ((e.C = i.C = !1), (r.C = !0), (t = r))
+                    : (t === e.L && ($_(this, e), (e = (t = e).U)), (e.C = !1), (r.C = !0), V_(this, r)),
+                  (e = t.U);
+              this._.C = !1;
+            },
+            remove: function (t) {
+              t.N && (t.N.P = t.P), t.P && (t.P.N = t.N), (t.N = t.P = null);
+              var n,
+                e,
+                r,
+                i = t.U,
+                o = t.L,
+                a = t.R;
+              if (
+                ((e = o ? (a ? W_(a) : o) : a),
+                i ? (i.L === t ? (i.L = e) : (i.R = e)) : (this._ = e),
+                o && a
+                  ? ((r = e.C),
+                    (e.C = t.C),
+                    (e.L = o),
+                    (o.U = e),
+                    e !== a
+                      ? ((i = e.U), (e.U = t.U), (t = e.R), (i.L = t), (e.R = a), (a.U = e))
+                      : ((e.U = i), (i = e), (t = e.R)))
+                  : ((r = t.C), (t = e)),
+                t && (t.U = i),
+                !r)
+              )
+                if (t && t.C) t.C = !1;
+                else {
+                  do {
+                    if (t === this._) break;
+                    if (t === i.L) {
+                      if (
+                        ((n = i.R).C && ((n.C = !1), (i.C = !0), V_(this, i), (n = i.R)),
+                        (n.L && n.L.C) || (n.R && n.R.C))
+                      ) {
+                        (n.R && n.R.C) || ((n.L.C = !1), (n.C = !0), $_(this, n), (n = i.R)),
+                          (n.C = i.C),
+                          (i.C = n.R.C = !1),
+                          V_(this, i),
+                          (t = this._);
+                        break;
+                      }
+                    } else if (
+                      ((n = i.L).C && ((n.C = !1), (i.C = !0), $_(this, i), (n = i.L)),
+                      (n.L && n.L.C) || (n.R && n.R.C))
+                    ) {
+                      (n.L && n.L.C) || ((n.R.C = !1), (n.C = !0), V_(this, n), (n = i.L)),
+                        (n.C = i.C),
+                        (i.C = n.L.C = !1),
+                        $_(this, i),
+                        (t = this._);
+                      break;
+                    }
+                    (n.C = !0), (t = i), (i = i.U);
+                  } while (!t.C);
+                  t && (t.C = !1);
+                }
+            },
+          });
+        var ib,
+          ob = [];
+        function ab() {
+          G_(this), (this.x = this.y = this.arc = this.site = this.cy = null);
+        }
+        function ub(t) {
+          var n = t.P,
+            e = t.N;
+          if (n && e) {
+            var r = n.site,
+              i = t.site,
+              o = e.site;
+            if (r !== o) {
+              var a = i[0],
+                u = i[1],
+                c = r[0] - a,
+                f = r[1] - u,
+                s = o[0] - a,
+                l = o[1] - u,
+                h = 2 * (c * l - f * s);
+              if (!(h >= -wb)) {
+                var d = c * c + f * f,
+                  p = s * s + l * l,
+                  v = (l * d - f * p) / h,
+                  g = (c * p - s * d) / h,
+                  y = ob.pop() || new ab();
+                (y.arc = t),
+                  (y.site = i),
+                  (y.x = v + a),
+                  (y.y = (y.cy = g + u) + Math.sqrt(v * v + g * g)),
+                  (t.circle = y);
+                for (var _ = null, b = bb._; b; )
+                  if (y.y < b.y || (y.y === b.y && y.x <= b.x)) {
+                    if (!b.L) {
+                      _ = b.P;
+                      break;
+                    }
+                    b = b.L;
+                  } else {
+                    if (!b.R) {
+                      _ = b;
+                      break;
+                    }
+                    b = b.R;
+                  }
+                bb.insert(_, y), _ || (ib = y);
+              }
+            }
+          }
+        }
+        function cb(t) {
+          var n = t.circle;
+          n && (n.P || (ib = n.N), bb.remove(n), ob.push(n), G_(n), (t.circle = null));
+        }
+        var fb = [];
+        function sb() {
+          G_(this), (this.edge = this.site = this.circle = null);
+        }
+        function lb(t) {
+          var n = fb.pop() || new sb();
+          return (n.site = t), n;
+        }
+        function hb(t) {
+          cb(t), yb.remove(t), fb.push(t), G_(t);
+        }
+        function db(t) {
+          var n = t.circle,
+            e = n.x,
+            r = n.cy,
+            i = [e, r],
+            o = t.P,
+            a = t.N,
+            u = [t];
+          hb(t);
+          for (var c = o; c.circle && Math.abs(e - c.circle.x) < xb && Math.abs(r - c.circle.cy) < xb; )
+            (o = c.P), u.unshift(c), hb(c), (c = o);
+          u.unshift(c), cb(c);
+          for (var f = a; f.circle && Math.abs(e - f.circle.x) < xb && Math.abs(r - f.circle.cy) < xb; )
+            (a = f.N), u.push(f), hb(f), (f = a);
+          u.push(f), cb(f);
+          var s,
+            l = u.length;
+          for (s = 1; s < l; ++s) (f = u[s]), (c = u[s - 1]), J_(f.edge, c.site, f.site, i);
+          (c = u[0]), ((f = u[l - 1]).edge = Z_(c.site, f.site, null, i)), ub(c), ub(f);
+        }
+        function pb(t) {
+          for (var n, e, r, i, o = t[0], a = t[1], u = yb._; u; )
+            if ((r = vb(u, a) - o) > xb) u = u.L;
+            else {
+              if (!((i = o - gb(u, a)) > xb)) {
+                r > -xb ? ((n = u.P), (e = u)) : i > -xb ? ((n = u), (e = u.N)) : (n = e = u);
+                break;
+              }
+              if (!u.R) {
+                n = u;
+                break;
+              }
+              u = u.R;
+            }
+          !(function (t) {
+            _b[t.index] = { site: t, halfedges: [] };
+          })(t);
+          var c = lb(t);
+          if ((yb.insert(n, c), n || e)) {
+            if (n === e)
+              return (
+                cb(n), (e = lb(n.site)), yb.insert(c, e), (c.edge = e.edge = Z_(n.site, c.site)), ub(n), void ub(e)
+              );
+            if (e) {
+              cb(n), cb(e);
+              var f = n.site,
+                s = f[0],
+                l = f[1],
+                h = t[0] - s,
+                d = t[1] - l,
+                p = e.site,
+                v = p[0] - s,
+                g = p[1] - l,
+                y = 2 * (h * g - d * v),
+                _ = h * h + d * d,
+                b = v * v + g * g,
+                m = [(g * _ - d * b) / y + s, (h * b - v * _) / y + l];
+              J_(e.edge, f, p, m), (c.edge = Z_(f, t, null, m)), (e.edge = Z_(t, p, null, m)), ub(n), ub(e);
+            } else c.edge = Z_(n.site, c.site);
+          }
+        }
+        function vb(t, n) {
+          var e = t.site,
+            r = e[0],
+            i = e[1],
+            o = i - n;
+          if (!o) return r;
+          var a = t.P;
+          if (!a) return -1 / 0;
+          var u = (e = a.site)[0],
+            c = e[1],
+            f = c - n;
+          if (!f) return u;
+          var s = u - r,
+            l = 1 / o - 1 / f,
+            h = s / f;
+          return l
+            ? (-h + Math.sqrt(h * h - 2 * l * ((s * s) / (-2 * f) - c + f / 2 + i - o / 2))) / l + r
+            : (r + u) / 2;
+        }
+        function gb(t, n) {
+          var e = t.N;
+          if (e) return vb(e, n);
+          var r = t.site;
+          return r[1] === n ? r[0] : 1 / 0;
+        }
+        var yb,
+          _b,
+          bb,
+          mb,
+          xb = 1e-6,
+          wb = 1e-12;
+        function Mb(t, n) {
+          return n[1] - t[1] || n[0] - t[0];
+        }
+        function Nb(t, n) {
+          var e,
+            r,
+            i,
+            o = t.sort(Mb).pop();
+          for (mb = [], _b = new Array(t.length), yb = new X_(), bb = new X_(); ; )
+            if (((i = ib), o && (!i || o[1] < i.y || (o[1] === i.y && o[0] < i.x))))
+              (o[0] === e && o[1] === r) || (pb(o), (e = o[0]), (r = o[1])), (o = t.pop());
+            else {
+              if (!i) break;
+              db(i.arc);
+            }
+          if (
+            ((function () {
+              for (var t, n, e, r, i = 0, o = _b.length; i < o; ++i)
+                if ((t = _b[i]) && (r = (n = t.halfedges).length)) {
+                  var a = new Array(r),
+                    u = new Array(r);
+                  for (e = 0; e < r; ++e) (a[e] = e), (u[e] = nb(t, mb[n[e]]));
+                  for (
+                    a.sort(function (t, n) {
+                      return u[n] - u[t];
+                    }),
+                      e = 0;
+                    e < r;
+                    ++e
+                  )
+                    u[e] = n[a[e]];
+                  for (e = 0; e < r; ++e) n[e] = u[e];
+                }
+            })(),
+            n)
+          ) {
+            var a = +n[0][0],
+              u = +n[0][1],
+              c = +n[1][0],
+              f = +n[1][1];
+            !(function (t, n, e, r) {
+              for (var i, o = mb.length; o--; )
+                (tb((i = mb[o]), t, n, e, r) &&
+                  K_(i, t, n, e, r) &&
+                  (Math.abs(i[0][0] - i[1][0]) > xb || Math.abs(i[0][1] - i[1][1]) > xb)) ||
+                  delete mb[o];
+            })(a, u, c, f),
+              (function (t, n, e, r) {
+                var i,
+                  o,
+                  a,
+                  u,
+                  c,
+                  f,
+                  s,
+                  l,
+                  h,
+                  d,
+                  p,
+                  v,
+                  g = _b.length,
+                  y = !0;
+                for (i = 0; i < g; ++i)
+                  if ((o = _b[i])) {
+                    for (a = o.site, u = (c = o.halfedges).length; u--; ) mb[c[u]] || c.splice(u, 1);
+                    for (u = 0, f = c.length; u < f; )
+                      (p = (d = rb(o, mb[c[u]]))[0]),
+                        (v = d[1]),
+                        (l = (s = eb(o, mb[c[++u % f]]))[0]),
+                        (h = s[1]),
+                        (Math.abs(p - l) > xb || Math.abs(v - h) > xb) &&
+                          (c.splice(
+                            u,
+                            0,
+                            mb.push(
+                              Q_(
+                                a,
+                                d,
+                                Math.abs(p - t) < xb && r - v > xb
+                                  ? [t, Math.abs(l - t) < xb ? h : r]
+                                  : Math.abs(v - r) < xb && e - p > xb
+                                    ? [Math.abs(h - r) < xb ? l : e, r]
+                                    : Math.abs(p - e) < xb && v - n > xb
+                                      ? [e, Math.abs(l - e) < xb ? h : n]
+                                      : Math.abs(v - n) < xb && p - t > xb
+                                        ? [Math.abs(h - n) < xb ? l : t, n]
+                                        : null
+                              )
+                            ) - 1
+                          ),
+                          ++f);
+                    f && (y = !1);
+                  }
+                if (y) {
+                  var _,
+                    b,
+                    m,
+                    x = 1 / 0;
+                  for (i = 0, y = null; i < g; ++i)
+                    (o = _b[i]) && (m = (_ = (a = o.site)[0] - t) * _ + (b = a[1] - n) * b) < x && ((x = m), (y = o));
+                  if (y) {
+                    var w = [t, n],
+                      M = [t, r],
+                      N = [e, r],
+                      A = [e, n];
+                    y.halfedges.push(
+                      mb.push(Q_((a = y.site), w, M)) - 1,
+                      mb.push(Q_(a, M, N)) - 1,
+                      mb.push(Q_(a, N, A)) - 1,
+                      mb.push(Q_(a, A, w)) - 1
+                    );
+                  }
+                }
+                for (i = 0; i < g; ++i) (o = _b[i]) && (o.halfedges.length || delete _b[i]);
+              })(a, u, c, f);
+          }
+          (this.edges = mb), (this.cells = _b), (yb = bb = mb = _b = null);
+        }
+        function Ab(t) {
+          return function () {
+            return t;
+          };
+        }
+        function Tb(t, n, e) {
+          (this.target = t), (this.type = n), (this.transform = e);
+        }
+        function Sb(t, n, e) {
+          (this.k = t), (this.x = n), (this.y = e);
+        }
+        (Nb.prototype = {
+          constructor: Nb,
+          polygons: function () {
+            var t = this.edges;
+            return this.cells.map(function (n) {
+              var e = n.halfedges.map(function (e) {
+                return eb(n, t[e]);
+              });
+              return (e.data = n.site.data), e;
+            });
+          },
+          triangles: function () {
+            var t = [],
+              n = this.edges;
+            return (
+              this.cells.forEach(function (e, r) {
+                if ((o = (i = e.halfedges).length))
+                  for (
+                    var i, o, a, u, c, f, s = e.site, l = -1, h = n[i[o - 1]], d = h.left === s ? h.right : h.left;
+                    ++l < o;
+
+                  )
+                    (a = d),
+                      (d = (h = n[i[l]]).left === s ? h.right : h.left),
+                      a &&
+                        d &&
+                        r < a.index &&
+                        r < d.index &&
+                        ((c = a), (f = d), ((u = s)[0] - f[0]) * (c[1] - u[1]) - (u[0] - c[0]) * (f[1] - u[1]) < 0) &&
+                        t.push([s.data, a.data, d.data]);
+              }),
+              t
+            );
+          },
+          links: function () {
+            return this.edges
+              .filter(function (t) {
+                return t.right;
+              })
+              .map(function (t) {
+                return { source: t.left.data, target: t.right.data };
+              });
+          },
+          find: function (t, n, e) {
+            for (var r, i, o = this, a = o._found || 0, u = o.cells.length; !(i = o.cells[a]); )
+              if (++a >= u) return null;
+            var c = t - i.site[0],
+              f = n - i.site[1],
+              s = c * c + f * f;
+            do {
+              (i = o.cells[(r = a)]),
+                (a = null),
+                i.halfedges.forEach(function (e) {
+                  var r = o.edges[e],
+                    u = r.left;
+                  if ((u !== i.site && u) || (u = r.right)) {
+                    var c = t - u[0],
+                      f = n - u[1],
+                      l = c * c + f * f;
+                    l < s && ((s = l), (a = u.index));
+                  }
+                });
+            } while (null !== a);
+            return (o._found = r), null == e || s <= e * e ? i.site : null;
+          },
+        }),
+          (Sb.prototype = {
+            constructor: Sb,
+            scale: function (t) {
+              return 1 === t ? this : new Sb(this.k * t, this.x, this.y);
+            },
+            translate: function (t, n) {
+              return (0 === t) & (0 === n) ? this : new Sb(this.k, this.x + this.k * t, this.y + this.k * n);
+            },
+            apply: function (t) {
+              return [t[0] * this.k + this.x, t[1] * this.k + this.y];
+            },
+            applyX: function (t) {
+              return t * this.k + this.x;
+            },
+            applyY: function (t) {
+              return t * this.k + this.y;
+            },
+            invert: function (t) {
+              return [(t[0] - this.x) / this.k, (t[1] - this.y) / this.k];
+            },
+            invertX: function (t) {
+              return (t - this.x) / this.k;
+            },
+            invertY: function (t) {
+              return (t - this.y) / this.k;
+            },
+            rescaleX: function (t) {
+              return t.copy().domain(t.range().map(this.invertX, this).map(t.invert, t));
+            },
+            rescaleY: function (t) {
+              return t.copy().domain(t.range().map(this.invertY, this).map(t.invert, t));
+            },
+            toString: function () {
+              return "translate(" + this.x + "," + this.y + ") scale(" + this.k + ")";
+            },
+          });
+        var kb = new Sb(1, 0, 0);
+        function Eb(t) {
+          return t.__zoom || kb;
+        }
+        function Cb() {
+          t.event.stopImmediatePropagation();
+        }
+        function Pb() {
+          t.event.preventDefault(), t.event.stopImmediatePropagation();
+        }
+        function zb() {
+          return !t.event.button;
+        }
+        function Rb() {
+          var t,
+            n,
+            e = this;
+          return (
+            e instanceof SVGElement
+              ? ((t = (e = e.ownerSVGElement || e).width.baseVal.value), (n = e.height.baseVal.value))
+              : ((t = e.clientWidth), (n = e.clientHeight)),
+            [
+              [0, 0],
+              [t, n],
+            ]
+          );
+        }
+        function Db() {
+          return this.__zoom || kb;
+        }
+        function qb() {
+          return (-t.event.deltaY * (t.event.deltaMode ? 120 : 1)) / 500;
+        }
+        function Lb() {
+          return "ontouchstart" in this;
+        }
+        function Ub(t, n, e) {
+          var r = t.invertX(n[0][0]) - e[0][0],
+            i = t.invertX(n[1][0]) - e[1][0],
+            o = t.invertY(n[0][1]) - e[0][1],
+            a = t.invertY(n[1][1]) - e[1][1];
+          return t.translate(
+            i > r ? (r + i) / 2 : Math.min(0, r) || Math.max(0, i),
+            a > o ? (o + a) / 2 : Math.min(0, o) || Math.max(0, a)
+          );
+        }
+        (Eb.prototype = Sb.prototype),
+          (t.version = "5.9.2"),
+          (t.bisect = i),
+          (t.bisectRight = i),
+          (t.bisectLeft = o),
+          (t.ascending = n),
+          (t.bisector = e),
+          (t.cross = function (t, n, e) {
+            var r,
+              i,
+              o,
+              u,
+              c = t.length,
+              f = n.length,
+              s = new Array(c * f);
+            for (null == e && (e = a), r = o = 0; r < c; ++r) for (u = t[r], i = 0; i < f; ++i, ++o) s[o] = e(u, n[i]);
+            return s;
+          }),
+          (t.descending = function (t, n) {
+            return n < t ? -1 : n > t ? 1 : n >= t ? 0 : NaN;
+          }),
+          (t.deviation = f),
+          (t.extent = s),
+          (t.histogram = function () {
+            var t = v,
+              n = s,
+              e = M;
+            function r(r) {
+              var o,
+                a,
+                u = r.length,
+                c = new Array(u);
+              for (o = 0; o < u; ++o) c[o] = t(r[o], o, r);
+              var f = n(c),
+                s = f[0],
+                l = f[1],
+                h = e(c, s, l);
+              Array.isArray(h) || ((h = w(s, l, h)), (h = g(Math.ceil(s / h) * h, l, h)));
+              for (var d = h.length; h[0] <= s; ) h.shift(), --d;
+              for (; h[d - 1] > l; ) h.pop(), --d;
+              var p,
+                v = new Array(d + 1);
+              for (o = 0; o <= d; ++o) ((p = v[o] = []).x0 = o > 0 ? h[o - 1] : s), (p.x1 = o < d ? h[o] : l);
+              for (o = 0; o < u; ++o) s <= (a = c[o]) && a <= l && v[i(h, a, 0, d)].push(r[o]);
+              return v;
+            }
+            return (
+              (r.value = function (n) {
+                return arguments.length ? ((t = "function" == typeof n ? n : p(n)), r) : t;
+              }),
+              (r.domain = function (t) {
+                return arguments.length ? ((n = "function" == typeof t ? t : p([t[0], t[1]])), r) : n;
+              }),
+              (r.thresholds = function (t) {
+                return arguments.length
+                  ? ((e = "function" == typeof t ? t : Array.isArray(t) ? p(h.call(t)) : p(t)), r)
+                  : e;
+              }),
+              r
+            );
+          }),
+          (t.thresholdFreedmanDiaconis = function (t, e, r) {
+            return (
+              (t = d.call(t, u).sort(n)),
+              Math.ceil((r - e) / (2 * (N(t, 0.75) - N(t, 0.25)) * Math.pow(t.length, -1 / 3)))
+            );
+          }),
+          (t.thresholdScott = function (t, n, e) {
+            return Math.ceil((e - n) / (3.5 * f(t) * Math.pow(t.length, -1 / 3)));
+          }),
+          (t.thresholdSturges = M),
+          (t.max = A),
+          (t.mean = function (t, n) {
+            var e,
+              r = t.length,
+              i = r,
+              o = -1,
+              a = 0;
+            if (null == n) for (; ++o < r; ) isNaN((e = u(t[o]))) ? --i : (a += e);
+            else for (; ++o < r; ) isNaN((e = u(n(t[o], o, t)))) ? --i : (a += e);
+            if (i) return a / i;
+          }),
+          (t.median = function (t, e) {
+            var r,
+              i = t.length,
+              o = -1,
+              a = [];
+            if (null == e) for (; ++o < i; ) isNaN((r = u(t[o]))) || a.push(r);
+            else for (; ++o < i; ) isNaN((r = u(e(t[o], o, t)))) || a.push(r);
+            return N(a.sort(n), 0.5);
+          }),
+          (t.merge = T),
+          (t.min = S),
+          (t.pairs = function (t, n) {
+            null == n && (n = a);
+            for (var e = 0, r = t.length - 1, i = t[0], o = new Array(r < 0 ? 0 : r); e < r; )
+              o[e] = n(i, (i = t[++e]));
+            return o;
+          }),
+          (t.permute = function (t, n) {
+            for (var e = n.length, r = new Array(e); e--; ) r[e] = t[n[e]];
+            return r;
+          }),
+          (t.quantile = N),
+          (t.range = g),
+          (t.scan = function (t, e) {
+            if ((r = t.length)) {
+              var r,
+                i,
+                o = 0,
+                a = 0,
+                u = t[a];
+              for (null == e && (e = n); ++o < r; ) (e((i = t[o]), u) < 0 || 0 !== e(u, u)) && ((u = i), (a = o));
+              return 0 === e(u, u) ? a : void 0;
+            }
+          }),
+          (t.shuffle = function (t, n, e) {
+            for (var r, i, o = (null == e ? t.length : e) - (n = null == n ? 0 : +n); o; )
+              (i = (Math.random() * o--) | 0), (r = t[o + n]), (t[o + n] = t[i + n]), (t[i + n] = r);
+            return t;
+          }),
+          (t.sum = function (t, n) {
+            var e,
+              r = t.length,
+              i = -1,
+              o = 0;
+            if (null == n) for (; ++i < r; ) (e = +t[i]) && (o += e);
+            else for (; ++i < r; ) (e = +n(t[i], i, t)) && (o += e);
+            return o;
+          }),
+          (t.ticks = m),
+          (t.tickIncrement = x),
+          (t.tickStep = w),
+          (t.transpose = k),
+          (t.variance = c),
+          (t.zip = function () {
+            return k(arguments);
+          }),
+          (t.axisTop = function (t) {
+            return Y(z, t);
+          }),
+          (t.axisRight = function (t) {
+            return Y(R, t);
+          }),
+          (t.axisBottom = function (t) {
+            return Y(D, t);
+          }),
+          (t.axisLeft = function (t) {
+            return Y(q, t);
+          }),
+          (t.brush = function () {
+            return Pi(mi);
+          }),
+          (t.brushX = function () {
+            return Pi(_i);
+          }),
+          (t.brushY = function () {
+            return Pi(bi);
+          }),
+          (t.brushSelection = function (t) {
+            var n = t.__brush;
+            return n ? n.dim.output(n.selection) : null;
+          }),
+          (t.chord = function () {
+            var t = 0,
+              n = null,
+              e = null,
+              r = null;
+            function i(i) {
+              var o,
+                a,
+                u,
+                c,
+                f,
+                s,
+                l = i.length,
+                h = [],
+                d = g(l),
+                p = [],
+                v = [],
+                y = (v.groups = new Array(l)),
+                _ = new Array(l * l);
+              for (o = 0, f = -1; ++f < l; ) {
+                for (a = 0, s = -1; ++s < l; ) a += i[f][s];
+                h.push(a), p.push(g(l)), (o += a);
+              }
+              for (
+                n &&
+                  d.sort(function (t, e) {
+                    return n(h[t], h[e]);
+                  }),
+                  e &&
+                    p.forEach(function (t, n) {
+                      t.sort(function (t, r) {
+                        return e(i[n][t], i[n][r]);
+                      });
+                    }),
+                  c = (o = Ui(0, Li - t * l) / o) ? t : Li / l,
+                  a = 0,
+                  f = -1;
+                ++f < l;
+
+              ) {
+                for (u = a, s = -1; ++s < l; ) {
+                  var b = d[f],
+                    m = p[b][s],
+                    x = i[b][m],
+                    w = a,
+                    M = (a += x * o);
+                  _[m * l + b] = { index: b, subindex: m, startAngle: w, endAngle: M, value: x };
+                }
+                (y[b] = { index: b, startAngle: u, endAngle: a, value: h[b] }), (a += c);
+              }
+              for (f = -1; ++f < l; )
+                for (s = f - 1; ++s < l; ) {
+                  var N = _[s * l + f],
+                    A = _[f * l + s];
+                  (N.value || A.value) &&
+                    v.push(N.value < A.value ? { source: A, target: N } : { source: N, target: A });
+                }
+              return r ? v.sort(r) : v;
+            }
+            return (
+              (i.padAngle = function (n) {
+                return arguments.length ? ((t = Ui(0, n)), i) : t;
+              }),
+              (i.sortGroups = function (t) {
+                return arguments.length ? ((n = t), i) : n;
+              }),
+              (i.sortSubgroups = function (t) {
+                return arguments.length ? ((e = t), i) : e;
+              }),
+              (i.sortChords = function (t) {
+                return arguments.length
+                  ? (null == t
+                      ? (r = null)
+                      : (((n = t),
+                        (r = function (t, e) {
+                          return n(t.source.value + t.target.value, e.source.value + e.target.value);
+                        }))._ = t),
+                    i)
+                  : r && r._;
+                var n;
+              }),
+              i
+            );
+          }),
+          (t.ribbon = function () {
+            var t = Xi,
+              n = Gi,
+              e = Vi,
+              r = $i,
+              i = Wi,
+              o = null;
+            function a() {
+              var a,
+                u = Oi.call(arguments),
+                c = t.apply(this, u),
+                f = n.apply(this, u),
+                s = +e.apply(this, ((u[0] = c), u)),
+                l = r.apply(this, u) - qi,
+                h = i.apply(this, u) - qi,
+                d = s * zi(l),
+                p = s * Ri(l),
+                v = +e.apply(this, ((u[0] = f), u)),
+                g = r.apply(this, u) - qi,
+                y = i.apply(this, u) - qi;
+              if (
+                (o || (o = a = Hi()),
+                o.moveTo(d, p),
+                o.arc(0, 0, s, l, h),
+                (l === g && h === y) || (o.quadraticCurveTo(0, 0, v * zi(g), v * Ri(g)), o.arc(0, 0, v, g, y)),
+                o.quadraticCurveTo(0, 0, d, p),
+                o.closePath(),
+                a)
+              )
+                return (o = null), a + "" || null;
+            }
+            return (
+              (a.radius = function (t) {
+                return arguments.length ? ((e = "function" == typeof t ? t : Bi(+t)), a) : e;
+              }),
+              (a.startAngle = function (t) {
+                return arguments.length ? ((r = "function" == typeof t ? t : Bi(+t)), a) : r;
+              }),
+              (a.endAngle = function (t) {
+                return arguments.length ? ((i = "function" == typeof t ? t : Bi(+t)), a) : i;
+              }),
+              (a.source = function (n) {
+                return arguments.length ? ((t = n), a) : t;
+              }),
+              (a.target = function (t) {
+                return arguments.length ? ((n = t), a) : n;
+              }),
+              (a.context = function (t) {
+                return arguments.length ? ((o = null == t ? null : t), a) : o;
+              }),
+              a
+            );
+          }),
+          (t.nest = function () {
+            var t,
+              n,
+              e,
+              r = [],
+              i = [];
+            function o(e, i, a, u) {
+              if (i >= r.length) return null != t && e.sort(t), null != n ? n(e) : e;
+              for (var c, f, s, l = -1, h = e.length, d = r[i++], p = Qi(), v = a(); ++l < h; )
+                (s = p.get((c = d((f = e[l])) + ""))) ? s.push(f) : p.set(c, [f]);
+              return (
+                p.each(function (t, n) {
+                  u(v, n, o(t, i, a, u));
+                }),
+                v
+              );
+            }
+            return (e = {
+              object: function (t) {
+                return o(t, 0, Ji, Ki);
+              },
+              map: function (t) {
+                return o(t, 0, to, no);
+              },
+              entries: function (t) {
+                return (function t(e, o) {
+                  if (++o > r.length) return e;
+                  var a,
+                    u = i[o - 1];
+                  return (
+                    null != n && o >= r.length
+                      ? (a = e.entries())
+                      : ((a = []),
+                        e.each(function (n, e) {
+                          a.push({ key: e, values: t(n, o) });
+                        })),
+                    null != u
+                      ? a.sort(function (t, n) {
+                          return u(t.key, n.key);
+                        })
+                      : a
+                  );
+                })(o(t, 0, to, no), 0);
+              },
+              key: function (t) {
+                return r.push(t), e;
+              },
+              sortKeys: function (t) {
+                return (i[r.length - 1] = t), e;
+              },
+              sortValues: function (n) {
+                return (t = n), e;
+              },
+              rollup: function (t) {
+                return (n = t), e;
+              },
+            });
+          }),
+          (t.set = io),
+          (t.map = Qi),
+          (t.keys = function (t) {
+            var n = [];
+            for (var e in t) n.push(e);
+            return n;
+          }),
+          (t.values = function (t) {
+            var n = [];
+            for (var e in t) n.push(t[e]);
+            return n;
+          }),
+          (t.entries = function (t) {
+            var n = [];
+            for (var e in t) n.push({ key: e, value: t[e] });
+            return n;
+          }),
+          (t.color = hn),
+          (t.rgb = gn),
+          (t.hsl = mn),
+          (t.lab = Rn),
+          (t.hcl = Yn),
+          (t.lch = function (t, n, e, r) {
+            return 1 === arguments.length ? Bn(t) : new Fn(e, n, t, null == r ? 1 : r);
+          }),
+          (t.gray = function (t, n) {
+            return new Dn(t, 0, 0, null == n ? 1 : n);
+          }),
+          (t.cubehelix = Zn),
+          (t.contours = po),
+          (t.contourDensity = function () {
+            var t = yo,
+              n = _o,
+              e = bo,
+              r = 960,
+              i = 500,
+              o = 20,
+              a = 2,
+              u = 3 * o,
+              c = (r + 2 * u) >> a,
+              f = (i + 2 * u) >> a,
+              s = uo(20);
+            function l(r) {
+              var i = new Float32Array(c * f),
+                l = new Float32Array(c * f);
+              r.forEach(function (r, o, s) {
+                var l = (+t(r, o, s) + u) >> a,
+                  h = (+n(r, o, s) + u) >> a,
+                  d = +e(r, o, s);
+                l >= 0 && l < c && h >= 0 && h < f && (i[l + h * c] += d);
+              }),
+                vo({ width: c, height: f, data: i }, { width: c, height: f, data: l }, o >> a),
+                go({ width: c, height: f, data: l }, { width: c, height: f, data: i }, o >> a),
+                vo({ width: c, height: f, data: i }, { width: c, height: f, data: l }, o >> a),
+                go({ width: c, height: f, data: l }, { width: c, height: f, data: i }, o >> a),
+                vo({ width: c, height: f, data: i }, { width: c, height: f, data: l }, o >> a),
+                go({ width: c, height: f, data: l }, { width: c, height: f, data: i }, o >> a);
+              var d = s(i);
+              if (!Array.isArray(d)) {
+                var p = A(i);
+                (d = w(0, p, d)), (d = g(0, Math.floor(p / d) * d, d)).shift();
+              }
+              return po().thresholds(d).size([c, f])(i).map(h);
+            }
+            function h(t) {
+              return (t.value *= Math.pow(2, -2 * a)), t.coordinates.forEach(d), t;
+            }
+            function d(t) {
+              t.forEach(p);
+            }
+            function p(t) {
+              t.forEach(v);
+            }
+            function v(t) {
+              (t[0] = t[0] * Math.pow(2, a) - u), (t[1] = t[1] * Math.pow(2, a) - u);
+            }
+            function y() {
+              return (c = (r + 2 * (u = 3 * o)) >> a), (f = (i + 2 * u) >> a), l;
+            }
+            return (
+              (l.x = function (n) {
+                return arguments.length ? ((t = "function" == typeof n ? n : uo(+n)), l) : t;
+              }),
+              (l.y = function (t) {
+                return arguments.length ? ((n = "function" == typeof t ? t : uo(+t)), l) : n;
+              }),
+              (l.weight = function (t) {
+                return arguments.length ? ((e = "function" == typeof t ? t : uo(+t)), l) : e;
+              }),
+              (l.size = function (t) {
+                if (!arguments.length) return [r, i];
+                var n = Math.ceil(t[0]),
+                  e = Math.ceil(t[1]);
+                if (!(n >= 0 || n >= 0)) throw new Error("invalid size");
+                return (r = n), (i = e), y();
+              }),
+              (l.cellSize = function (t) {
+                if (!arguments.length) return 1 << a;
+                if (!((t = +t) >= 1)) throw new Error("invalid cell size");
+                return (a = Math.floor(Math.log(t) / Math.LN2)), y();
+              }),
+              (l.thresholds = function (t) {
+                return arguments.length
+                  ? ((s = "function" == typeof t ? t : Array.isArray(t) ? uo(oo.call(t)) : uo(t)), l)
+                  : s;
+              }),
+              (l.bandwidth = function (t) {
+                if (!arguments.length) return Math.sqrt(o * (o + 1));
+                if (!((t = +t) >= 0)) throw new Error("invalid bandwidth");
+                return (o = Math.round((Math.sqrt(4 * t * t + 1) - 1) / 2)), y();
+              }),
+              l
+            );
+          }),
+          (t.dispatch = I),
+          (t.drag = function () {
+            var n,
+              e,
+              r,
+              i,
+              o = Gt,
+              a = Vt,
+              u = $t,
+              c = Wt,
+              f = {},
+              s = I("start", "drag", "end"),
+              l = 0,
+              h = 0;
+            function d(t) {
+              t.on("mousedown.drag", p)
+                .filter(c)
+                .on("touchstart.drag", y)
+                .on("touchmove.drag", _)
+                .on("touchend.drag touchcancel.drag", b)
+                .style("touch-action", "none")
+                .style("-webkit-tap-highlight-color", "rgba(0,0,0,0)");
+            }
+            function p() {
+              if (!i && o.apply(this, arguments)) {
+                var u = m("mouse", a.apply(this, arguments), Ot, this, arguments);
+                u &&
+                  (zt(t.event.view).on("mousemove.drag", v, !0).on("mouseup.drag", g, !0),
+                  It(t.event.view),
+                  Yt(),
+                  (r = !1),
+                  (n = t.event.clientX),
+                  (e = t.event.clientY),
+                  u("start"));
+              }
+            }
+            function v() {
+              if ((Ft(), !r)) {
+                var i = t.event.clientX - n,
+                  o = t.event.clientY - e;
+                r = i * i + o * o > h;
+              }
+              f.mouse("drag");
+            }
+            function g() {
+              zt(t.event.view).on("mousemove.drag mouseup.drag", null), jt(t.event.view, r), Ft(), f.mouse("end");
+            }
+            function y() {
+              if (o.apply(this, arguments)) {
+                var n,
+                  e,
+                  r = t.event.changedTouches,
+                  i = a.apply(this, arguments),
+                  u = r.length;
+                for (n = 0; n < u; ++n) (e = m(r[n].identifier, i, Bt, this, arguments)) && (Yt(), e("start"));
+              }
+            }
+            function _() {
+              var n,
+                e,
+                r = t.event.changedTouches,
+                i = r.length;
+              for (n = 0; n < i; ++n) (e = f[r[n].identifier]) && (Ft(), e("drag"));
+            }
+            function b() {
+              var n,
+                e,
+                r = t.event.changedTouches,
+                o = r.length;
+              for (
+                i && clearTimeout(i),
+                  i = setTimeout(function () {
+                    i = null;
+                  }, 500),
+                  n = 0;
+                n < o;
+                ++n
+              )
+                (e = f[r[n].identifier]) && (Yt(), e("end"));
+            }
+            function m(n, e, r, i, o) {
+              var a,
+                c,
+                h,
+                p = r(e, n),
+                v = s.copy();
+              if (
+                St(new Xt(d, "beforestart", a, n, l, p[0], p[1], 0, 0, v), function () {
+                  return (
+                    null != (t.event.subject = a = u.apply(i, o)) && ((c = a.x - p[0] || 0), (h = a.y - p[1] || 0), !0)
+                  );
+                })
+              )
+                return function t(u) {
+                  var s,
+                    g = p;
+                  switch (u) {
+                    case "start":
+                      (f[n] = t), (s = l++);
+                      break;
+                    case "end":
+                      delete f[n], --l;
+                    case "drag":
+                      (p = r(e, n)), (s = l);
+                  }
+                  St(new Xt(d, u, a, n, s, p[0] + c, p[1] + h, p[0] - g[0], p[1] - g[1], v), v.apply, v, [u, i, o]);
+                };
+            }
+            return (
+              (d.filter = function (t) {
+                return arguments.length ? ((o = "function" == typeof t ? t : Ht(!!t)), d) : o;
+              }),
+              (d.container = function (t) {
+                return arguments.length ? ((a = "function" == typeof t ? t : Ht(t)), d) : a;
+              }),
+              (d.subject = function (t) {
+                return arguments.length ? ((u = "function" == typeof t ? t : Ht(t)), d) : u;
+              }),
+              (d.touchable = function (t) {
+                return arguments.length ? ((c = "function" == typeof t ? t : Ht(!!t)), d) : c;
+              }),
+              (d.on = function () {
+                var t = s.on.apply(s, arguments);
+                return t === s ? d : t;
+              }),
+              (d.clickDistance = function (t) {
+                return arguments.length ? ((h = (t = +t) * t), d) : Math.sqrt(h);
+              }),
+              d
+            );
+          }),
+          (t.dragDisable = It),
+          (t.dragEnable = jt),
+          (t.dsvFormat = Eo),
+          (t.csvParse = Po),
+          (t.csvParseRows = zo),
+          (t.csvFormat = Ro),
+          (t.csvFormatBody = Do),
+          (t.csvFormatRows = qo),
+          (t.tsvParse = Uo),
+          (t.tsvParseRows = Oo),
+          (t.tsvFormat = Bo),
+          (t.tsvFormatBody = Yo),
+          (t.tsvFormatRows = Fo),
+          (t.autoType = function (t) {
+            for (var n in t) {
+              var e,
+                r = t[n].trim();
+              if (r)
+                if ("true" === r) r = !0;
+                else if ("false" === r) r = !1;
+                else if ("NaN" === r) r = NaN;
+                else if (isNaN((e = +r))) {
+                  if (
+                    !/^([-+]\d{2})?\d{4}(-\d{2}(-\d{2})?)?(T\d{2}:\d{2}(:\d{2}(\.\d{3})?)?(Z|[-+]\d{2}:\d{2})?)?$/.test(
+                      r
+                    )
+                  )
+                    continue;
+                  r = new Date(r);
+                } else r = e;
+              else r = null;
+              t[n] = r;
+            }
+            return t;
+          }),
+          (t.easeLinear = function (t) {
+            return +t;
+          }),
+          (t.easeQuad = Rr),
+          (t.easeQuadIn = function (t) {
+            return t * t;
+          }),
+          (t.easeQuadOut = function (t) {
+            return t * (2 - t);
+          }),
+          (t.easeQuadInOut = Rr),
+          (t.easeCubic = Dr),
+          (t.easeCubicIn = function (t) {
+            return t * t * t;
+          }),
+          (t.easeCubicOut = function (t) {
+            return --t * t * t + 1;
+          }),
+          (t.easeCubicInOut = Dr),
+          (t.easePoly = Ur),
+          (t.easePolyIn = qr),
+          (t.easePolyOut = Lr),
+          (t.easePolyInOut = Ur),
+          (t.easeSin = Yr),
+          (t.easeSinIn = function (t) {
+            return 1 - Math.cos(t * Br);
+          }),
+          (t.easeSinOut = function (t) {
+            return Math.sin(t * Br);
+          }),
+          (t.easeSinInOut = Yr),
+          (t.easeExp = Fr),
+          (t.easeExpIn = function (t) {
+            return Math.pow(2, 10 * t - 10);
+          }),
+          (t.easeExpOut = function (t) {
+            return 1 - Math.pow(2, -10 * t);
+          }),
+          (t.easeExpInOut = Fr),
+          (t.easeCircle = Ir),
+          (t.easeCircleIn = function (t) {
+            return 1 - Math.sqrt(1 - t * t);
+          }),
+          (t.easeCircleOut = function (t) {
+            return Math.sqrt(1 - --t * t);
+          }),
+          (t.easeCircleInOut = Ir),
+          (t.easeBounce = Kr),
+          (t.easeBounceIn = function (t) {
+            return 1 - Kr(1 - t);
+          }),
+          (t.easeBounceOut = Kr),
+          (t.easeBounceInOut = function (t) {
+            return ((t *= 2) <= 1 ? 1 - Kr(1 - t) : Kr(t - 1) + 1) / 2;
+          }),
+          (t.easeBack = ei),
+          (t.easeBackIn = ti),
+          (t.easeBackOut = ni),
+          (t.easeBackInOut = ei),
+          (t.easeElastic = oi),
+          (t.easeElasticIn = ii),
+          (t.easeElasticOut = oi),
+          (t.easeElasticInOut = ai),
+          (t.blob = function (t, n) {
+            return fetch(t, n).then(Io);
+          }),
+          (t.buffer = function (t, n) {
+            return fetch(t, n).then(jo);
+          }),
+          (t.dsv = function (t, n, e, r) {
+            3 === arguments.length && "function" == typeof e && ((r = e), (e = void 0));
+            var i = Eo(t);
+            return Xo(n, e).then(function (t) {
+              return i.parse(t, r);
+            });
+          }),
+          (t.csv = Vo),
+          (t.tsv = $o),
+          (t.image = function (t, n) {
+            return new Promise(function (e, r) {
+              var i = new Image();
+              for (var o in n) i[o] = n[o];
+              (i.onerror = r),
+                (i.onload = function () {
+                  e(i);
+                }),
+                (i.src = t);
+            });
+          }),
+          (t.json = function (t, n) {
+            return fetch(t, n).then(Wo);
+          }),
+          (t.text = Xo),
+          (t.xml = Qo),
+          (t.html = Jo),
+          (t.svg = Ko),
+          (t.forceCenter = function (t, n) {
+            var e;
+            function r() {
+              var r,
+                i,
+                o = e.length,
+                a = 0,
+                u = 0;
+              for (r = 0; r < o; ++r) (a += (i = e[r]).x), (u += i.y);
+              for (a = a / o - t, u = u / o - n, r = 0; r < o; ++r) ((i = e[r]).x -= a), (i.y -= u);
+            }
+            return (
+              null == t && (t = 0),
+              null == n && (n = 0),
+              (r.initialize = function (t) {
+                e = t;
+              }),
+              (r.x = function (n) {
+                return arguments.length ? ((t = +n), r) : t;
+              }),
+              (r.y = function (t) {
+                return arguments.length ? ((n = +t), r) : n;
+              }),
+              r
+            );
+          }),
+          (t.forceCollide = function (t) {
+            var n,
+              e,
+              r = 1,
+              i = 1;
+            function o() {
+              for (var t, o, u, c, f, s, l, h = n.length, d = 0; d < i; ++d)
+                for (o = aa(n, sa, la).visitAfter(a), t = 0; t < h; ++t)
+                  (u = n[t]), (s = e[u.index]), (l = s * s), (c = u.x + u.vx), (f = u.y + u.vy), o.visit(p);
+              function p(t, n, e, i, o) {
+                var a = t.data,
+                  h = t.r,
+                  d = s + h;
+                if (!a) return n > c + d || i < c - d || e > f + d || o < f - d;
+                if (a.index > u.index) {
+                  var p = c - a.x - a.vx,
+                    v = f - a.y - a.vy,
+                    g = p * p + v * v;
+                  g < d * d &&
+                    (0 === p && (g += (p = na()) * p),
+                    0 === v && (g += (v = na()) * v),
+                    (g = ((d - (g = Math.sqrt(g))) / g) * r),
+                    (u.vx += (p *= g) * (d = (h *= h) / (l + h))),
+                    (u.vy += (v *= g) * d),
+                    (a.vx -= p * (d = 1 - d)),
+                    (a.vy -= v * d));
+                }
+              }
+            }
+            function a(t) {
+              if (t.data) return (t.r = e[t.data.index]);
+              for (var n = (t.r = 0); n < 4; ++n) t[n] && t[n].r > t.r && (t.r = t[n].r);
+            }
+            function u() {
+              if (n) {
+                var r,
+                  i,
+                  o = n.length;
+                for (e = new Array(o), r = 0; r < o; ++r) (i = n[r]), (e[i.index] = +t(i, r, n));
+              }
+            }
+            return (
+              "function" != typeof t && (t = ta(null == t ? 1 : +t)),
+              (o.initialize = function (t) {
+                (n = t), u();
+              }),
+              (o.iterations = function (t) {
+                return arguments.length ? ((i = +t), o) : i;
+              }),
+              (o.strength = function (t) {
+                return arguments.length ? ((r = +t), o) : r;
+              }),
+              (o.radius = function (n) {
+                return arguments.length ? ((t = "function" == typeof n ? n : ta(+n)), u(), o) : t;
+              }),
+              o
+            );
+          }),
+          (t.forceLink = function (t) {
+            var n,
+              e,
+              r,
+              i,
+              o,
+              a = ha,
+              u = function (t) {
+                return 1 / Math.min(i[t.source.index], i[t.target.index]);
+              },
+              c = ta(30),
+              f = 1;
+            function s(r) {
+              for (var i = 0, a = t.length; i < f; ++i)
+                for (var u, c, s, l, h, d, p, v = 0; v < a; ++v)
+                  (c = (u = t[v]).source),
+                    (l = (s = u.target).x + s.vx - c.x - c.vx || na()),
+                    (h = s.y + s.vy - c.y - c.vy || na()),
+                    (l *= d = (((d = Math.sqrt(l * l + h * h)) - e[v]) / d) * r * n[v]),
+                    (h *= d),
+                    (s.vx -= l * (p = o[v])),
+                    (s.vy -= h * p),
+                    (c.vx += l * (p = 1 - p)),
+                    (c.vy += h * p);
+            }
+            function l() {
+              if (r) {
+                var u,
+                  c,
+                  f = r.length,
+                  s = t.length,
+                  l = Qi(r, a);
+                for (u = 0, i = new Array(f); u < s; ++u)
+                  ((c = t[u]).index = u),
+                    "object" != typeof c.source && (c.source = da(l, c.source)),
+                    "object" != typeof c.target && (c.target = da(l, c.target)),
+                    (i[c.source.index] = (i[c.source.index] || 0) + 1),
+                    (i[c.target.index] = (i[c.target.index] || 0) + 1);
+                for (u = 0, o = new Array(s); u < s; ++u)
+                  (c = t[u]), (o[u] = i[c.source.index] / (i[c.source.index] + i[c.target.index]));
+                (n = new Array(s)), h(), (e = new Array(s)), d();
+              }
+            }
+            function h() {
+              if (r) for (var e = 0, i = t.length; e < i; ++e) n[e] = +u(t[e], e, t);
+            }
+            function d() {
+              if (r) for (var n = 0, i = t.length; n < i; ++n) e[n] = +c(t[n], n, t);
+            }
+            return (
+              null == t && (t = []),
+              (s.initialize = function (t) {
+                (r = t), l();
+              }),
+              (s.links = function (n) {
+                return arguments.length ? ((t = n), l(), s) : t;
+              }),
+              (s.id = function (t) {
+                return arguments.length ? ((a = t), s) : a;
+              }),
+              (s.iterations = function (t) {
+                return arguments.length ? ((f = +t), s) : f;
+              }),
+              (s.strength = function (t) {
+                return arguments.length ? ((u = "function" == typeof t ? t : ta(+t)), h(), s) : u;
+              }),
+              (s.distance = function (t) {
+                return arguments.length ? ((c = "function" == typeof t ? t : ta(+t)), d(), s) : c;
+              }),
+              s
+            );
+          }),
+          (t.forceManyBody = function () {
+            var t,
+              n,
+              e,
+              r,
+              i = ta(-30),
+              o = 1,
+              a = 1 / 0,
+              u = 0.81;
+            function c(r) {
+              var i,
+                o = t.length,
+                a = aa(t, pa, va).visitAfter(s);
+              for (e = r, i = 0; i < o; ++i) (n = t[i]), a.visit(l);
+            }
+            function f() {
+              if (t) {
+                var n,
+                  e,
+                  o = t.length;
+                for (r = new Array(o), n = 0; n < o; ++n) (e = t[n]), (r[e.index] = +i(e, n, t));
+              }
+            }
+            function s(t) {
+              var n,
+                e,
+                i,
+                o,
+                a,
+                u = 0,
+                c = 0;
+              if (t.length) {
+                for (i = o = a = 0; a < 4; ++a)
+                  (n = t[a]) && (e = Math.abs(n.value)) && ((u += n.value), (c += e), (i += e * n.x), (o += e * n.y));
+                (t.x = i / c), (t.y = o / c);
+              } else {
+                ((n = t).x = n.data.x), (n.y = n.data.y);
+                do {
+                  u += r[n.data.index];
+                } while ((n = n.next));
+              }
+              t.value = u;
+            }
+            function l(t, i, c, f) {
+              if (!t.value) return !0;
+              var s = t.x - n.x,
+                l = t.y - n.y,
+                h = f - i,
+                d = s * s + l * l;
+              if ((h * h) / u < d)
+                return (
+                  d < a &&
+                    (0 === s && (d += (s = na()) * s),
+                    0 === l && (d += (l = na()) * l),
+                    d < o && (d = Math.sqrt(o * d)),
+                    (n.vx += (s * t.value * e) / d),
+                    (n.vy += (l * t.value * e) / d)),
+                  !0
+                );
+              if (!(t.length || d >= a)) {
+                (t.data !== n || t.next) &&
+                  (0 === s && (d += (s = na()) * s), 0 === l && (d += (l = na()) * l), d < o && (d = Math.sqrt(o * d)));
+                do {
+                  t.data !== n && ((h = (r[t.data.index] * e) / d), (n.vx += s * h), (n.vy += l * h));
+                } while ((t = t.next));
+              }
+            }
+            return (
+              (c.initialize = function (n) {
+                (t = n), f();
+              }),
+              (c.strength = function (t) {
+                return arguments.length ? ((i = "function" == typeof t ? t : ta(+t)), f(), c) : i;
+              }),
+              (c.distanceMin = function (t) {
+                return arguments.length ? ((o = t * t), c) : Math.sqrt(o);
+              }),
+              (c.distanceMax = function (t) {
+                return arguments.length ? ((a = t * t), c) : Math.sqrt(a);
+              }),
+              (c.theta = function (t) {
+                return arguments.length ? ((u = t * t), c) : Math.sqrt(u);
+              }),
+              c
+            );
+          }),
+          (t.forceRadial = function (t, n, e) {
+            var r,
+              i,
+              o,
+              a = ta(0.1);
+            function u(t) {
+              for (var a = 0, u = r.length; a < u; ++a) {
+                var c = r[a],
+                  f = c.x - n || 1e-6,
+                  s = c.y - e || 1e-6,
+                  l = Math.sqrt(f * f + s * s),
+                  h = ((o[a] - l) * i[a] * t) / l;
+                (c.vx += f * h), (c.vy += s * h);
+              }
+            }
+            function c() {
+              if (r) {
+                var n,
+                  e = r.length;
+                for (i = new Array(e), o = new Array(e), n = 0; n < e; ++n)
+                  (o[n] = +t(r[n], n, r)), (i[n] = isNaN(o[n]) ? 0 : +a(r[n], n, r));
+              }
+            }
+            return (
+              "function" != typeof t && (t = ta(+t)),
+              null == n && (n = 0),
+              null == e && (e = 0),
+              (u.initialize = function (t) {
+                (r = t), c();
+              }),
+              (u.strength = function (t) {
+                return arguments.length ? ((a = "function" == typeof t ? t : ta(+t)), c(), u) : a;
+              }),
+              (u.radius = function (n) {
+                return arguments.length ? ((t = "function" == typeof n ? n : ta(+n)), c(), u) : t;
+              }),
+              (u.x = function (t) {
+                return arguments.length ? ((n = +t), u) : n;
+              }),
+              (u.y = function (t) {
+                return arguments.length ? ((e = +t), u) : e;
+              }),
+              u
+            );
+          }),
+          (t.forceSimulation = function (t) {
+            var n,
+              e = 1,
+              r = 0.001,
+              i = 1 - Math.pow(r, 1 / 300),
+              o = 0,
+              a = 0.6,
+              u = Qi(),
+              c = ir(s),
+              f = I("tick", "end");
+            function s() {
+              l(), f.call("tick", n), e < r && (c.stop(), f.call("end", n));
+            }
+            function l(r) {
+              var c,
+                f,
+                s = t.length;
+              void 0 === r && (r = 1);
+              for (var l = 0; l < r; ++l)
+                for (
+                  e += (o - e) * i,
+                    u.each(function (t) {
+                      t(e);
+                    }),
+                    c = 0;
+                  c < s;
+                  ++c
+                )
+                  null == (f = t[c]).fx ? (f.x += f.vx *= a) : ((f.x = f.fx), (f.vx = 0)),
+                    null == f.fy ? (f.y += f.vy *= a) : ((f.y = f.fy), (f.vy = 0));
+              return n;
+            }
+            function h() {
+              for (var n, e = 0, r = t.length; e < r; ++e) {
+                if (
+                  (((n = t[e]).index = e),
+                  null != n.fx && (n.x = n.fx),
+                  null != n.fy && (n.y = n.fy),
+                  isNaN(n.x) || isNaN(n.y))
+                ) {
+                  var i = ga * Math.sqrt(e),
+                    o = e * ya;
+                  (n.x = i * Math.cos(o)), (n.y = i * Math.sin(o));
+                }
+                (isNaN(n.vx) || isNaN(n.vy)) && (n.vx = n.vy = 0);
+              }
+            }
+            function d(n) {
+              return n.initialize && n.initialize(t), n;
+            }
+            return (
+              null == t && (t = []),
+              h(),
+              (n = {
+                tick: l,
+                restart: function () {
+                  return c.restart(s), n;
+                },
+                stop: function () {
+                  return c.stop(), n;
+                },
+                nodes: function (e) {
+                  return arguments.length ? ((t = e), h(), u.each(d), n) : t;
+                },
+                alpha: function (t) {
+                  return arguments.length ? ((e = +t), n) : e;
+                },
+                alphaMin: function (t) {
+                  return arguments.length ? ((r = +t), n) : r;
+                },
+                alphaDecay: function (t) {
+                  return arguments.length ? ((i = +t), n) : +i;
+                },
+                alphaTarget: function (t) {
+                  return arguments.length ? ((o = +t), n) : o;
+                },
+                velocityDecay: function (t) {
+                  return arguments.length ? ((a = 1 - t), n) : 1 - a;
+                },
+                force: function (t, e) {
+                  return arguments.length > 1 ? (null == e ? u.remove(t) : u.set(t, d(e)), n) : u.get(t);
+                },
+                find: function (n, e, r) {
+                  var i,
+                    o,
+                    a,
+                    u,
+                    c,
+                    f = 0,
+                    s = t.length;
+                  for (null == r ? (r = 1 / 0) : (r *= r), f = 0; f < s; ++f)
+                    (a = (i = n - (u = t[f]).x) * i + (o = e - u.y) * o) < r && ((c = u), (r = a));
+                  return c;
+                },
+                on: function (t, e) {
+                  return arguments.length > 1 ? (f.on(t, e), n) : f.on(t);
+                },
+              })
+            );
+          }),
+          (t.forceX = function (t) {
+            var n,
+              e,
+              r,
+              i = ta(0.1);
+            function o(t) {
+              for (var i, o = 0, a = n.length; o < a; ++o) (i = n[o]).vx += (r[o] - i.x) * e[o] * t;
+            }
+            function a() {
+              if (n) {
+                var o,
+                  a = n.length;
+                for (e = new Array(a), r = new Array(a), o = 0; o < a; ++o)
+                  e[o] = isNaN((r[o] = +t(n[o], o, n))) ? 0 : +i(n[o], o, n);
+              }
+            }
+            return (
+              "function" != typeof t && (t = ta(null == t ? 0 : +t)),
+              (o.initialize = function (t) {
+                (n = t), a();
+              }),
+              (o.strength = function (t) {
+                return arguments.length ? ((i = "function" == typeof t ? t : ta(+t)), a(), o) : i;
+              }),
+              (o.x = function (n) {
+                return arguments.length ? ((t = "function" == typeof n ? n : ta(+n)), a(), o) : t;
+              }),
+              o
+            );
+          }),
+          (t.forceY = function (t) {
+            var n,
+              e,
+              r,
+              i = ta(0.1);
+            function o(t) {
+              for (var i, o = 0, a = n.length; o < a; ++o) (i = n[o]).vy += (r[o] - i.y) * e[o] * t;
+            }
+            function a() {
+              if (n) {
+                var o,
+                  a = n.length;
+                for (e = new Array(a), r = new Array(a), o = 0; o < a; ++o)
+                  e[o] = isNaN((r[o] = +t(n[o], o, n))) ? 0 : +i(n[o], o, n);
+              }
+            }
+            return (
+              "function" != typeof t && (t = ta(null == t ? 0 : +t)),
+              (o.initialize = function (t) {
+                (n = t), a();
+              }),
+              (o.strength = function (t) {
+                return arguments.length ? ((i = "function" == typeof t ? t : ta(+t)), a(), o) : i;
+              }),
+              (o.y = function (n) {
+                return arguments.length ? ((t = "function" == typeof n ? n : ta(+n)), a(), o) : t;
+              }),
+              o
+            );
+          }),
+          (t.formatDefaultLocale = Ca),
+          (t.formatLocale = Ea),
+          (t.formatSpecifier = wa),
+          (t.precisionFixed = Pa),
+          (t.precisionPrefix = za),
+          (t.precisionRound = Ra),
+          (t.geoArea = function (t) {
+            return mu.reset(), du(t, xu), 2 * mu;
+          }),
+          (t.geoBounds = function (t) {
+            var n, e, r, i, o, a, u;
+            if (((Lu = qu = -(Ru = Du = 1 / 0)), (Fu = []), du(t, ac), (e = Fu.length))) {
+              for (Fu.sort(vc), n = 1, o = [(r = Fu[0])]; n < e; ++n)
+                gc(r, (i = Fu[n])[0]) || gc(r, i[1])
+                  ? (pc(r[0], i[1]) > pc(r[0], r[1]) && (r[1] = i[1]), pc(i[0], r[1]) > pc(r[0], r[1]) && (r[0] = i[0]))
+                  : o.push((r = i));
+              for (a = -1 / 0, n = 0, r = o[(e = o.length - 1)]; n <= e; r = i, ++n)
+                (i = o[n]), (u = pc(r[1], i[0])) > a && ((a = u), (Ru = i[0]), (qu = r[1]));
+            }
+            return (
+              (Fu = Iu = null),
+              Ru === 1 / 0 || Du === 1 / 0
+                ? [
+                    [NaN, NaN],
+                    [NaN, NaN],
+                  ]
+                : [
+                    [Ru, Du],
+                    [qu, Lu],
+                  ]
+            );
+          }),
+          (t.geoCentroid = function (t) {
+            (ju = Hu = Xu = Gu = Vu = $u = Wu = Zu = Qu = Ju = Ku = 0), du(t, yc);
+            var n = Qu,
+              e = Ju,
+              r = Ku,
+              i = n * n + e * e + r * r;
+            return i < Ba &&
+              ((n = $u),
+              (e = Wu),
+              (r = Zu),
+              Hu < Oa && ((n = Xu), (e = Gu), (r = Vu)),
+              (i = n * n + e * e + r * r) < Ba)
+              ? [NaN, NaN]
+              : [$a(e, n) * Ha, ou(r / eu(i)) * Ha];
+          }),
+          (t.geoCircle = function () {
+            var t,
+              n,
+              e = kc([0, 0]),
+              r = kc(90),
+              i = kc(6),
+              o = {
+                point: function (e, r) {
+                  t.push((e = n(e, r))), (e[0] *= Ha), (e[1] *= Ha);
+                },
+              };
+            function a() {
+              var a = e.apply(this, arguments),
+                u = r.apply(this, arguments) * Xa,
+                c = i.apply(this, arguments) * Xa;
+              return (
+                (t = []),
+                (n = Pc(-a[0] * Xa, -a[1] * Xa, 0).invert),
+                Lc(o, u, c, 1),
+                (a = { type: "Polygon", coordinates: [t] }),
+                (t = n = null),
+                a
+              );
+            }
+            return (
+              (a.center = function (t) {
+                return arguments.length ? ((e = "function" == typeof t ? t : kc([+t[0], +t[1]])), a) : e;
+              }),
+              (a.radius = function (t) {
+                return arguments.length ? ((r = "function" == typeof t ? t : kc(+t)), a) : r;
+              }),
+              (a.precision = function (t) {
+                return arguments.length ? ((i = "function" == typeof t ? t : kc(+t)), a) : i;
+              }),
+              a
+            );
+          }),
+          (t.geoClipAntimeridian = $c),
+          (t.geoClipCircle = Wc),
+          (t.geoClipExtent = function () {
+            var t,
+              n,
+              e,
+              r = 0,
+              i = 0,
+              o = 960,
+              a = 500;
+            return (e = {
+              stream: function (e) {
+                return t && n === e ? t : (t = Jc(r, i, o, a)((n = e)));
+              },
+              extent: function (u) {
+                return arguments.length
+                  ? ((r = +u[0][0]), (i = +u[0][1]), (o = +u[1][0]), (a = +u[1][1]), (t = n = null), e)
+                  : [
+                      [r, i],
+                      [o, a],
+                    ];
+              },
+            });
+          }),
+          (t.geoClipRectangle = Jc),
+          (t.geoContains = function (t, n) {
+            return (t && hf.hasOwnProperty(t.type) ? hf[t.type] : pf)(t, n);
+          }),
+          (t.geoDistance = lf),
+          (t.geoGraticule = wf),
+          (t.geoGraticule10 = function () {
+            return wf()();
+          }),
+          (t.geoInterpolate = function (t, n) {
+            var e = t[0] * Xa,
+              r = t[1] * Xa,
+              i = n[0] * Xa,
+              o = n[1] * Xa,
+              a = Wa(r),
+              u = tu(r),
+              c = Wa(o),
+              f = tu(o),
+              s = a * Wa(e),
+              l = a * tu(e),
+              h = c * Wa(i),
+              d = c * tu(i),
+              p = 2 * ou(eu(au(o - r) + a * c * au(i - e))),
+              v = tu(p),
+              g = p
+                ? function (t) {
+                    var n = tu((t *= p)) / v,
+                      e = tu(p - t) / v,
+                      r = e * s + n * h,
+                      i = e * l + n * d,
+                      o = e * u + n * f;
+                    return [$a(i, r) * Ha, $a(o, eu(r * r + i * i)) * Ha];
+                  }
+                : function () {
+                    return [e * Ha, r * Ha];
+                  };
+            return (g.distance = p), g;
+          }),
+          (t.geoLength = cf),
+          (t.geoPath = function (t, n) {
+            var e,
+              r,
+              i = 4.5;
+            function o(t) {
+              return t && ("function" == typeof i && r.pointRadius(+i.apply(this, arguments)), du(t, e(r))), r.result();
+            }
+            return (
+              (o.area = function (t) {
+                return du(t, e(Cf)), Cf.result();
+              }),
+              (o.measure = function (t) {
+                return du(t, e(gs)), gs.result();
+              }),
+              (o.bounds = function (t) {
+                return du(t, e(Bf)), Bf.result();
+              }),
+              (o.centroid = function (t) {
+                return du(t, e(Kf)), Kf.result();
+              }),
+              (o.projection = function (n) {
+                return arguments.length ? ((e = null == n ? ((t = null), Mf) : (t = n).stream), o) : t;
+              }),
+              (o.context = function (t) {
+                return arguments.length
+                  ? ((r = null == t ? ((n = null), new bs()) : new fs((n = t))),
+                    "function" != typeof i && r.pointRadius(i),
+                    o)
+                  : n;
+              }),
+              (o.pointRadius = function (t) {
+                return arguments.length ? ((i = "function" == typeof t ? t : (r.pointRadius(+t), +t)), o) : i;
+              }),
+              o.projection(t).context(n)
+            );
+          }),
+          (t.geoAlbers = Os),
+          (t.geoAlbersUsa = function () {
+            var t,
+              n,
+              e,
+              r,
+              i,
+              o,
+              a = Os(),
+              u = Us().rotate([154, 0]).center([-2, 58.5]).parallels([55, 65]),
+              c = Us().rotate([157, 0]).center([-3, 19.9]).parallels([8, 18]),
+              f = {
+                point: function (t, n) {
+                  o = [t, n];
+                },
+              };
+            function s(t) {
+              var n = t[0],
+                a = t[1];
+              return (o = null), e.point(n, a), o || (r.point(n, a), o) || (i.point(n, a), o);
+            }
+            function l() {
+              return (t = n = null), s;
+            }
+            return (
+              (s.invert = function (t) {
+                var n = a.scale(),
+                  e = a.translate(),
+                  r = (t[0] - e[0]) / n,
+                  i = (t[1] - e[1]) / n;
+                return (
+                  i >= 0.12 && i < 0.234 && r >= -0.425 && r < -0.214
+                    ? u
+                    : i >= 0.166 && i < 0.234 && r >= -0.214 && r < -0.115
+                      ? c
+                      : a
+                ).invert(t);
+              }),
+              (s.stream = function (e) {
+                return t && n === e
+                  ? t
+                  : ((r = [a.stream((n = e)), u.stream(e), c.stream(e)]),
+                    (i = r.length),
+                    (t = {
+                      point: function (t, n) {
+                        for (var e = -1; ++e < i; ) r[e].point(t, n);
+                      },
+                      sphere: function () {
+                        for (var t = -1; ++t < i; ) r[t].sphere();
+                      },
+                      lineStart: function () {
+                        for (var t = -1; ++t < i; ) r[t].lineStart();
+                      },
+                      lineEnd: function () {
+                        for (var t = -1; ++t < i; ) r[t].lineEnd();
+                      },
+                      polygonStart: function () {
+                        for (var t = -1; ++t < i; ) r[t].polygonStart();
+                      },
+                      polygonEnd: function () {
+                        for (var t = -1; ++t < i; ) r[t].polygonEnd();
+                      },
+                    }));
+                var r, i;
+              }),
+              (s.precision = function (t) {
+                return arguments.length ? (a.precision(t), u.precision(t), c.precision(t), l()) : a.precision();
+              }),
+              (s.scale = function (t) {
+                return arguments.length
+                  ? (a.scale(t), u.scale(0.35 * t), c.scale(t), s.translate(a.translate()))
+                  : a.scale();
+              }),
+              (s.translate = function (t) {
+                if (!arguments.length) return a.translate();
+                var n = a.scale(),
+                  o = +t[0],
+                  s = +t[1];
+                return (
+                  (e = a
+                    .translate(t)
+                    .clipExtent([
+                      [o - 0.455 * n, s - 0.238 * n],
+                      [o + 0.455 * n, s + 0.238 * n],
+                    ])
+                    .stream(f)),
+                  (r = u
+                    .translate([o - 0.307 * n, s + 0.201 * n])
+                    .clipExtent([
+                      [o - 0.425 * n + Oa, s + 0.12 * n + Oa],
+                      [o - 0.214 * n - Oa, s + 0.234 * n - Oa],
+                    ])
+                    .stream(f)),
+                  (i = c
+                    .translate([o - 0.205 * n, s + 0.212 * n])
+                    .clipExtent([
+                      [o - 0.214 * n + Oa, s + 0.166 * n + Oa],
+                      [o - 0.115 * n - Oa, s + 0.234 * n - Oa],
+                    ])
+                    .stream(f)),
+                  l()
+                );
+              }),
+              (s.fitExtent = function (t, n) {
+                return Ns(s, t, n);
+              }),
+              (s.fitSize = function (t, n) {
+                return As(s, t, n);
+              }),
+              (s.fitWidth = function (t, n) {
+                return Ts(s, t, n);
+              }),
+              (s.fitHeight = function (t, n) {
+                return Ss(s, t, n);
+              }),
+              s.scale(1070)
+            );
+          }),
+          (t.geoAzimuthalEqualArea = function () {
+            return Rs(Fs).scale(124.75).clipAngle(179.999);
+          }),
+          (t.geoAzimuthalEqualAreaRaw = Fs),
+          (t.geoAzimuthalEquidistant = function () {
+            return Rs(Is).scale(79.4188).clipAngle(179.999);
+          }),
+          (t.geoAzimuthalEquidistantRaw = Is),
+          (t.geoConicConformal = function () {
+            return qs(Gs).scale(109.5).parallels([30, 30]);
+          }),
+          (t.geoConicConformalRaw = Gs),
+          (t.geoConicEqualArea = Us),
+          (t.geoConicEqualAreaRaw = Ls),
+          (t.geoConicEquidistant = function () {
+            return qs($s).scale(131.154).center([0, 13.9389]);
+          }),
+          (t.geoConicEquidistantRaw = $s),
+          (t.geoEqualEarth = function () {
+            return Rs(tl).scale(177.158);
+          }),
+          (t.geoEqualEarthRaw = tl),
+          (t.geoEquirectangular = function () {
+            return Rs(Vs).scale(152.63);
+          }),
+          (t.geoEquirectangularRaw = Vs),
+          (t.geoGnomonic = function () {
+            return Rs(nl).scale(144.049).clipAngle(60);
+          }),
+          (t.geoGnomonicRaw = nl),
+          (t.geoIdentity = function () {
+            var t,
+              n,
+              e,
+              r,
+              i,
+              o,
+              a = 1,
+              u = 0,
+              c = 0,
+              f = 1,
+              s = 1,
+              l = Mf,
+              h = null,
+              d = Mf;
+            function p() {
+              return (r = i = null), o;
+            }
+            return (o = {
+              stream: function (t) {
+                return r && i === t ? r : (r = l(d((i = t))));
+              },
+              postclip: function (r) {
+                return arguments.length ? ((d = r), (h = t = n = e = null), p()) : d;
+              },
+              clipExtent: function (r) {
+                return arguments.length
+                  ? ((d =
+                      null == r
+                        ? ((h = t = n = e = null), Mf)
+                        : Jc((h = +r[0][0]), (t = +r[0][1]), (n = +r[1][0]), (e = +r[1][1]))),
+                    p())
+                  : null == h
+                    ? null
+                    : [
+                        [h, t],
+                        [n, e],
+                      ];
+              },
+              scale: function (t) {
+                return arguments.length ? ((l = el((a = +t) * f, a * s, u, c)), p()) : a;
+              },
+              translate: function (t) {
+                return arguments.length ? ((l = el(a * f, a * s, (u = +t[0]), (c = +t[1]))), p()) : [u, c];
+              },
+              reflectX: function (t) {
+                return arguments.length ? ((l = el(a * (f = t ? -1 : 1), a * s, u, c)), p()) : f < 0;
+              },
+              reflectY: function (t) {
+                return arguments.length ? ((l = el(a * f, a * (s = t ? -1 : 1), u, c)), p()) : s < 0;
+              },
+              fitExtent: function (t, n) {
+                return Ns(o, t, n);
+              },
+              fitSize: function (t, n) {
+                return As(o, t, n);
+              },
+              fitWidth: function (t, n) {
+                return Ts(o, t, n);
+              },
+              fitHeight: function (t, n) {
+                return Ss(o, t, n);
+              },
+            });
+          }),
+          (t.geoProjection = Rs),
+          (t.geoProjectionMutator = Ds),
+          (t.geoMercator = function () {
+            return Hs(js).scale(961 / ja);
+          }),
+          (t.geoMercatorRaw = js),
+          (t.geoNaturalEarth1 = function () {
+            return Rs(rl).scale(175.295);
+          }),
+          (t.geoNaturalEarth1Raw = rl),
+          (t.geoOrthographic = function () {
+            return Rs(il)
+              .scale(249.5)
+              .clipAngle(90 + Oa);
+          }),
+          (t.geoOrthographicRaw = il),
+          (t.geoStereographic = function () {
+            return Rs(ol).scale(250).clipAngle(142);
+          }),
+          (t.geoStereographicRaw = ol),
+          (t.geoTransverseMercator = function () {
+            var t = Hs(al),
+              n = t.center,
+              e = t.rotate;
+            return (
+              (t.center = function (t) {
+                return arguments.length ? n([-t[1], t[0]]) : [(t = n())[1], -t[0]];
+              }),
+              (t.rotate = function (t) {
+                return arguments.length
+                  ? e([t[0], t[1], t.length > 2 ? t[2] + 90 : 90])
+                  : [(t = e())[0], t[1], t[2] - 90];
+              }),
+              e([0, 0, 90]).scale(159.155)
+            );
+          }),
+          (t.geoTransverseMercatorRaw = al),
+          (t.geoRotation = qc),
+          (t.geoStream = du),
+          (t.geoTransform = function (t) {
+            return { stream: xs(t) };
+          }),
+          (t.cluster = function () {
+            var t = ul,
+              n = 1,
+              e = 1,
+              r = !1;
+            function i(i) {
+              var o,
+                a = 0;
+              i.eachAfter(function (n) {
+                var e = n.children;
+                e
+                  ? ((n.x = (function (t) {
+                      return t.reduce(cl, 0) / t.length;
+                    })(e)),
+                    (n.y = (function (t) {
+                      return 1 + t.reduce(fl, 0);
+                    })(e)))
+                  : ((n.x = o ? (a += t(n, o)) : 0), (n.y = 0), (o = n));
+              });
+              var u = (function (t) {
+                  for (var n; (n = t.children); ) t = n[0];
+                  return t;
+                })(i),
+                c = (function (t) {
+                  for (var n; (n = t.children); ) t = n[n.length - 1];
+                  return t;
+                })(i),
+                f = u.x - t(u, c) / 2,
+                s = c.x + t(c, u) / 2;
+              return i.eachAfter(
+                r
+                  ? function (t) {
+                      (t.x = (t.x - i.x) * n), (t.y = (i.y - t.y) * e);
+                    }
+                  : function (t) {
+                      (t.x = ((t.x - f) / (s - f)) * n), (t.y = (1 - (i.y ? t.y / i.y : 1)) * e);
+                    }
+              );
+            }
+            return (
+              (i.separation = function (n) {
+                return arguments.length ? ((t = n), i) : t;
+              }),
+              (i.size = function (t) {
+                return arguments.length ? ((r = !1), (n = +t[0]), (e = +t[1]), i) : r ? null : [n, e];
+              }),
+              (i.nodeSize = function (t) {
+                return arguments.length ? ((r = !0), (n = +t[0]), (e = +t[1]), i) : r ? [n, e] : null;
+              }),
+              i
+            );
+          }),
+          (t.hierarchy = ll),
+          (t.pack = function () {
+            var t = null,
+              n = 1,
+              e = 1,
+              r = Pl;
+            function i(i) {
+              return (
+                (i.x = n / 2),
+                (i.y = e / 2),
+                t
+                  ? i.eachBefore(Dl(t)).eachAfter(ql(r, 0.5)).eachBefore(Ll(1))
+                  : i
+                      .eachBefore(Dl(Rl))
+                      .eachAfter(ql(Pl, 1))
+                      .eachAfter(ql(r, i.r / Math.min(n, e)))
+                      .eachBefore(Ll(Math.min(n, e) / (2 * i.r))),
+                i
+              );
+            }
+            return (
+              (i.radius = function (n) {
+                return arguments.length ? ((t = null == (e = n) ? null : Cl(e)), i) : t;
+                var e;
+              }),
+              (i.size = function (t) {
+                return arguments.length ? ((n = +t[0]), (e = +t[1]), i) : [n, e];
+              }),
+              (i.padding = function (t) {
+                return arguments.length ? ((r = "function" == typeof t ? t : zl(+t)), i) : r;
+              }),
+              i
+            );
+          }),
+          (t.packSiblings = function (t) {
+            return El(t), t;
+          }),
+          (t.packEnclose = yl),
+          (t.partition = function () {
+            var t = 1,
+              n = 1,
+              e = 0,
+              r = !1;
+            function i(i) {
+              var o = i.height + 1;
+              return (
+                (i.x0 = i.y0 = e),
+                (i.x1 = t),
+                (i.y1 = n / o),
+                i.eachBefore(
+                  (function (t, n) {
+                    return function (r) {
+                      r.children && Ol(r, r.x0, (t * (r.depth + 1)) / n, r.x1, (t * (r.depth + 2)) / n);
+                      var i = r.x0,
+                        o = r.y0,
+                        a = r.x1 - e,
+                        u = r.y1 - e;
+                      a < i && (i = a = (i + a) / 2),
+                        u < o && (o = u = (o + u) / 2),
+                        (r.x0 = i),
+                        (r.y0 = o),
+                        (r.x1 = a),
+                        (r.y1 = u);
+                    };
+                  })(n, o)
+                ),
+                r && i.eachBefore(Ul),
+                i
+              );
+            }
+            return (
+              (i.round = function (t) {
+                return arguments.length ? ((r = !!t), i) : r;
+              }),
+              (i.size = function (e) {
+                return arguments.length ? ((t = +e[0]), (n = +e[1]), i) : [t, n];
+              }),
+              (i.padding = function (t) {
+                return arguments.length ? ((e = +t), i) : e;
+              }),
+              i
+            );
+          }),
+          (t.stratify = function () {
+            var t = Il,
+              n = jl;
+            function e(e) {
+              var r,
+                i,
+                o,
+                a,
+                u,
+                c,
+                f,
+                s = e.length,
+                l = new Array(s),
+                h = {};
+              for (i = 0; i < s; ++i)
+                (r = e[i]),
+                  (u = l[i] = new vl(r)),
+                  null != (c = t(r, i, e)) && (c += "") && (h[(f = Bl + (u.id = c))] = f in h ? Fl : u);
+              for (i = 0; i < s; ++i)
+                if (((u = l[i]), null != (c = n(e[i], i, e)) && (c += ""))) {
+                  if (!(a = h[Bl + c])) throw new Error("missing: " + c);
+                  if (a === Fl) throw new Error("ambiguous: " + c);
+                  a.children ? a.children.push(u) : (a.children = [u]), (u.parent = a);
+                } else {
+                  if (o) throw new Error("multiple roots");
+                  o = u;
+                }
+              if (!o) throw new Error("no root");
+              if (
+                ((o.parent = Yl),
+                o
+                  .eachBefore(function (t) {
+                    (t.depth = t.parent.depth + 1), --s;
+                  })
+                  .eachBefore(pl),
+                (o.parent = null),
+                s > 0)
+              )
+                throw new Error("cycle");
+              return o;
+            }
+            return (
+              (e.id = function (n) {
+                return arguments.length ? ((t = Cl(n)), e) : t;
+              }),
+              (e.parentId = function (t) {
+                return arguments.length ? ((n = Cl(t)), e) : n;
+              }),
+              e
+            );
+          }),
+          (t.tree = function () {
+            var t = Hl,
+              n = 1,
+              e = 1,
+              r = null;
+            function i(i) {
+              var c = (function (t) {
+                for (var n, e, r, i, o, a = new Wl(t, 0), u = [a]; (n = u.pop()); )
+                  if ((r = n._.children))
+                    for (n.children = new Array((o = r.length)), i = o - 1; i >= 0; --i)
+                      u.push((e = n.children[i] = new Wl(r[i], i))), (e.parent = n);
+                return ((a.parent = new Wl(null, 0)).children = [a]), a;
+              })(i);
+              if ((c.eachAfter(o), (c.parent.m = -c.z), c.eachBefore(a), r)) i.eachBefore(u);
+              else {
+                var f = i,
+                  s = i,
+                  l = i;
+                i.eachBefore(function (t) {
+                  t.x < f.x && (f = t), t.x > s.x && (s = t), t.depth > l.depth && (l = t);
+                });
+                var h = f === s ? 1 : t(f, s) / 2,
+                  d = h - f.x,
+                  p = n / (s.x + h + d),
+                  v = e / (l.depth || 1);
+                i.eachBefore(function (t) {
+                  (t.x = (t.x + d) * p), (t.y = t.depth * v);
+                });
+              }
+              return i;
+            }
+            function o(n) {
+              var e = n.children,
+                r = n.parent.children,
+                i = n.i ? r[n.i - 1] : null;
+              if (e) {
+                !(function (t) {
+                  for (var n, e = 0, r = 0, i = t.children, o = i.length; --o >= 0; )
+                    ((n = i[o]).z += e), (n.m += e), (e += n.s + (r += n.c));
+                })(n);
+                var o = (e[0].z + e[e.length - 1].z) / 2;
+                i ? ((n.z = i.z + t(n._, i._)), (n.m = n.z - o)) : (n.z = o);
+              } else i && (n.z = i.z + t(n._, i._));
+              n.parent.A = (function (n, e, r) {
+                if (e) {
+                  for (
+                    var i, o = n, a = n, u = e, c = o.parent.children[0], f = o.m, s = a.m, l = u.m, h = c.m;
+                    (u = Gl(u)), (o = Xl(o)), u && o;
+
+                  )
+                    (c = Xl(c)),
+                      ((a = Gl(a)).a = n),
+                      (i = u.z + l - o.z - f + t(u._, o._)) > 0 && (Vl($l(u, n, r), n, i), (f += i), (s += i)),
+                      (l += u.m),
+                      (f += o.m),
+                      (h += c.m),
+                      (s += a.m);
+                  u && !Gl(a) && ((a.t = u), (a.m += l - s)), o && !Xl(c) && ((c.t = o), (c.m += f - h), (r = n));
+                }
+                return r;
+              })(n, i, n.parent.A || r[0]);
+            }
+            function a(t) {
+              (t._.x = t.z + t.parent.m), (t.m += t.parent.m);
+            }
+            function u(t) {
+              (t.x *= n), (t.y = t.depth * e);
+            }
+            return (
+              (i.separation = function (n) {
+                return arguments.length ? ((t = n), i) : t;
+              }),
+              (i.size = function (t) {
+                return arguments.length ? ((r = !1), (n = +t[0]), (e = +t[1]), i) : r ? null : [n, e];
+              }),
+              (i.nodeSize = function (t) {
+                return arguments.length ? ((r = !0), (n = +t[0]), (e = +t[1]), i) : r ? [n, e] : null;
+              }),
+              i
+            );
+          }),
+          (t.treemap = function () {
+            var t = Kl,
+              n = !1,
+              e = 1,
+              r = 1,
+              i = [0],
+              o = Pl,
+              a = Pl,
+              u = Pl,
+              c = Pl,
+              f = Pl;
+            function s(t) {
+              return (t.x0 = t.y0 = 0), (t.x1 = e), (t.y1 = r), t.eachBefore(l), (i = [0]), n && t.eachBefore(Ul), t;
+            }
+            function l(n) {
+              var e = i[n.depth],
+                r = n.x0 + e,
+                s = n.y0 + e,
+                l = n.x1 - e,
+                h = n.y1 - e;
+              l < r && (r = l = (r + l) / 2),
+                h < s && (s = h = (s + h) / 2),
+                (n.x0 = r),
+                (n.y0 = s),
+                (n.x1 = l),
+                (n.y1 = h),
+                n.children &&
+                  ((e = i[n.depth + 1] = o(n) / 2),
+                  (r += f(n) - e),
+                  (s += a(n) - e),
+                  (l -= u(n) - e) < r && (r = l = (r + l) / 2),
+                  (h -= c(n) - e) < s && (s = h = (s + h) / 2),
+                  t(n, r, s, l, h));
+            }
+            return (
+              (s.round = function (t) {
+                return arguments.length ? ((n = !!t), s) : n;
+              }),
+              (s.size = function (t) {
+                return arguments.length ? ((e = +t[0]), (r = +t[1]), s) : [e, r];
+              }),
+              (s.tile = function (n) {
+                return arguments.length ? ((t = Cl(n)), s) : t;
+              }),
+              (s.padding = function (t) {
+                return arguments.length ? s.paddingInner(t).paddingOuter(t) : s.paddingInner();
+              }),
+              (s.paddingInner = function (t) {
+                return arguments.length ? ((o = "function" == typeof t ? t : zl(+t)), s) : o;
+              }),
+              (s.paddingOuter = function (t) {
+                return arguments.length
+                  ? s.paddingTop(t).paddingRight(t).paddingBottom(t).paddingLeft(t)
+                  : s.paddingTop();
+              }),
+              (s.paddingTop = function (t) {
+                return arguments.length ? ((a = "function" == typeof t ? t : zl(+t)), s) : a;
+              }),
+              (s.paddingRight = function (t) {
+                return arguments.length ? ((u = "function" == typeof t ? t : zl(+t)), s) : u;
+              }),
+              (s.paddingBottom = function (t) {
+                return arguments.length ? ((c = "function" == typeof t ? t : zl(+t)), s) : c;
+              }),
+              (s.paddingLeft = function (t) {
+                return arguments.length ? ((f = "function" == typeof t ? t : zl(+t)), s) : f;
+              }),
+              s
+            );
+          }),
+          (t.treemapBinary = function (t, n, e, r, i) {
+            var o,
+              a,
+              u = t.children,
+              c = u.length,
+              f = new Array(c + 1);
+            for (f[0] = a = o = 0; o < c; ++o) f[o + 1] = a += u[o].value;
+            !(function t(n, e, r, i, o, a, c) {
+              if (n >= e - 1) {
+                var s = u[n];
+                return (s.x0 = i), (s.y0 = o), (s.x1 = a), void (s.y1 = c);
+              }
+              for (var l = f[n], h = r / 2 + l, d = n + 1, p = e - 1; d < p; ) {
+                var v = (d + p) >>> 1;
+                f[v] < h ? (d = v + 1) : (p = v);
+              }
+              h - f[d - 1] < f[d] - h && n + 1 < d && --d;
+              var g = f[d] - l,
+                y = r - g;
+              if (a - i > c - o) {
+                var _ = (i * y + a * g) / r;
+                t(n, d, g, i, o, _, c), t(d, e, y, _, o, a, c);
+              } else {
+                var b = (o * y + c * g) / r;
+                t(n, d, g, i, o, a, b), t(d, e, y, i, b, a, c);
+              }
+            })(0, c, t.value, n, e, r, i);
+          }),
+          (t.treemapDice = Ol),
+          (t.treemapSlice = Zl),
+          (t.treemapSliceDice = function (t, n, e, r, i) {
+            (1 & t.depth ? Zl : Ol)(t, n, e, r, i);
+          }),
+          (t.treemapSquarify = Kl),
+          (t.treemapResquarify = th),
+          (t.interpolate = ye),
+          (t.interpolateArray = se),
+          (t.interpolateBasis = Kn),
+          (t.interpolateBasisClosed = te),
+          (t.interpolateDate = le),
+          (t.interpolateDiscrete = function (t) {
+            var n = t.length;
+            return function (e) {
+              return t[Math.max(0, Math.min(n - 1, Math.floor(e * n)))];
+            };
+          }),
+          (t.interpolateHue = function (t, n) {
+            var e = re(+t, +n);
+            return function (t) {
+              var n = e(t);
+              return n - 360 * Math.floor(n / 360);
+            };
+          }),
+          (t.interpolateNumber = he),
+          (t.interpolateObject = de),
+          (t.interpolateRound = _e),
+          (t.interpolateString = ge),
+          (t.interpolateTransformCss = Se),
+          (t.interpolateTransformSvg = ke),
+          (t.interpolateZoom = De),
+          (t.interpolateRgb = ae),
+          (t.interpolateRgbBasis = ce),
+          (t.interpolateRgbBasisClosed = fe),
+          (t.interpolateHsl = Le),
+          (t.interpolateHslLong = Ue),
+          (t.interpolateLab = function (t, n) {
+            var e = oe((t = Rn(t)).l, (n = Rn(n)).l),
+              r = oe(t.a, n.a),
+              i = oe(t.b, n.b),
+              o = oe(t.opacity, n.opacity);
+            return function (n) {
+              return (t.l = e(n)), (t.a = r(n)), (t.b = i(n)), (t.opacity = o(n)), t + "";
+            };
+          }),
+          (t.interpolateHcl = Be),
+          (t.interpolateHclLong = Ye),
+          (t.interpolateCubehelix = Ie),
+          (t.interpolateCubehelixLong = je),
+          (t.piecewise = function (t, n) {
+            for (var e = 0, r = n.length - 1, i = n[0], o = new Array(r < 0 ? 0 : r); e < r; )
+              o[e] = t(i, (i = n[++e]));
+            return function (t) {
+              var n = Math.max(0, Math.min(r - 1, Math.floor((t *= r))));
+              return o[n](t - n);
+            };
+          }),
+          (t.quantize = function (t, n) {
+            for (var e = new Array(n), r = 0; r < n; ++r) e[r] = t(r / (n - 1));
+            return e;
+          }),
+          (t.path = Hi),
+          (t.polygonArea = function (t) {
+            for (var n, e = -1, r = t.length, i = t[r - 1], o = 0; ++e < r; )
+              (n = i), (i = t[e]), (o += n[1] * i[0] - n[0] * i[1]);
+            return o / 2;
+          }),
+          (t.polygonCentroid = function (t) {
+            for (var n, e, r = -1, i = t.length, o = 0, a = 0, u = t[i - 1], c = 0; ++r < i; )
+              (n = u),
+                (u = t[r]),
+                (c += e = n[0] * u[1] - u[0] * n[1]),
+                (o += (n[0] + u[0]) * e),
+                (a += (n[1] + u[1]) * e);
+            return [o / (c *= 3), a / c];
+          }),
+          (t.polygonHull = function (t) {
+            if ((e = t.length) < 3) return null;
+            var n,
+              e,
+              r = new Array(e),
+              i = new Array(e);
+            for (n = 0; n < e; ++n) r[n] = [+t[n][0], +t[n][1], n];
+            for (r.sort(nh), n = 0; n < e; ++n) i[n] = [r[n][0], -r[n][1]];
+            var o = eh(r),
+              a = eh(i),
+              u = a[0] === o[0],
+              c = a[a.length - 1] === o[o.length - 1],
+              f = [];
+            for (n = o.length - 1; n >= 0; --n) f.push(t[r[o[n]][2]]);
+            for (n = +u; n < a.length - c; ++n) f.push(t[r[a[n]][2]]);
+            return f;
+          }),
+          (t.polygonContains = function (t, n) {
+            for (
+              var e, r, i = t.length, o = t[i - 1], a = n[0], u = n[1], c = o[0], f = o[1], s = !1, l = 0;
+              l < i;
+              ++l
+            )
+              (e = (o = t[l])[0]),
+                (r = o[1]) > u != f > u && a < ((c - e) * (u - r)) / (f - r) + e && (s = !s),
+                (c = e),
+                (f = r);
+            return s;
+          }),
+          (t.polygonLength = function (t) {
+            for (var n, e, r = -1, i = t.length, o = t[i - 1], a = o[0], u = o[1], c = 0; ++r < i; )
+              (n = a), (e = u), (n -= a = (o = t[r])[0]), (e -= u = o[1]), (c += Math.sqrt(n * n + e * e));
+            return c;
+          }),
+          (t.quadtree = aa),
+          (t.randomUniform = ih),
+          (t.randomNormal = oh),
+          (t.randomLogNormal = ah),
+          (t.randomBates = ch),
+          (t.randomIrwinHall = uh),
+          (t.randomExponential = fh),
+          (t.scaleBand = yh),
+          (t.scalePoint = function () {
+            return (function t(n) {
+              var e = n.copy;
+              return (
+                (n.padding = n.paddingOuter),
+                delete n.paddingInner,
+                delete n.paddingOuter,
+                (n.copy = function () {
+                  return t(e());
+                }),
+                n
+              );
+            })(yh.apply(null, arguments).paddingInner(1));
+          }),
+          (t.scaleIdentity = function t(n) {
+            var e;
+            function r(t) {
+              return isNaN((t = +t)) ? e : t;
+            }
+            return (
+              (r.invert = r),
+              (r.domain = r.range =
+                function (t) {
+                  return arguments.length ? ((n = dh.call(t, _h)), r) : n.slice();
+                }),
+              (r.unknown = function (t) {
+                return arguments.length ? ((e = t), r) : e;
+              }),
+              (r.copy = function () {
+                return t(n).unknown(e);
+              }),
+              (n = arguments.length ? dh.call(n, _h) : [0, 1]),
+              Eh(r)
+            );
+          }),
+          (t.scaleLinear = function t() {
+            var n = Sh(mh, mh);
+            return (
+              (n.copy = function () {
+                return Ah(n, t());
+              }),
+              sh.apply(n, arguments),
+              Eh(n)
+            );
+          }),
+          (t.scaleLog = function t() {
+            var n = Uh(Th()).domain([1, 10]);
+            return (
+              (n.copy = function () {
+                return Ah(n, t()).base(n.base());
+              }),
+              sh.apply(n, arguments),
+              n
+            );
+          }),
+          (t.scaleSymlog = function t() {
+            var n = Yh(Th());
+            return (
+              (n.copy = function () {
+                return Ah(n, t()).constant(n.constant());
+              }),
+              sh.apply(n, arguments)
+            );
+          }),
+          (t.scaleOrdinal = gh),
+          (t.scaleImplicit = vh),
+          (t.scalePow = Xh),
+          (t.scaleSqrt = function () {
+            return Xh.apply(null, arguments).exponent(0.5);
+          }),
+          (t.scaleQuantile = function t() {
+            var e,
+              r = [],
+              o = [],
+              a = [];
+            function u() {
+              var t = 0,
+                n = Math.max(1, o.length);
+              for (a = new Array(n - 1); ++t < n; ) a[t - 1] = N(r, t / n);
+              return c;
+            }
+            function c(t) {
+              return isNaN((t = +t)) ? e : o[i(a, t)];
+            }
+            return (
+              (c.invertExtent = function (t) {
+                var n = o.indexOf(t);
+                return n < 0 ? [NaN, NaN] : [n > 0 ? a[n - 1] : r[0], n < a.length ? a[n] : r[r.length - 1]];
+              }),
+              (c.domain = function (t) {
+                if (!arguments.length) return r.slice();
+                r = [];
+                for (var e, i = 0, o = t.length; i < o; ++i) null == (e = t[i]) || isNaN((e = +e)) || r.push(e);
+                return r.sort(n), u();
+              }),
+              (c.range = function (t) {
+                return arguments.length ? ((o = ph.call(t)), u()) : o.slice();
+              }),
+              (c.unknown = function (t) {
+                return arguments.length ? ((e = t), c) : e;
+              }),
+              (c.quantiles = function () {
+                return a.slice();
+              }),
+              (c.copy = function () {
+                return t().domain(r).range(o).unknown(e);
+              }),
+              sh.apply(c, arguments)
+            );
+          }),
+          (t.scaleQuantize = function t() {
+            var n,
+              e = 0,
+              r = 1,
+              o = 1,
+              a = [0.5],
+              u = [0, 1];
+            function c(t) {
+              return t <= t ? u[i(a, t, 0, o)] : n;
+            }
+            function f() {
+              var t = -1;
+              for (a = new Array(o); ++t < o; ) a[t] = ((t + 1) * r - (t - o) * e) / (o + 1);
+              return c;
+            }
+            return (
+              (c.domain = function (t) {
+                return arguments.length ? ((e = +t[0]), (r = +t[1]), f()) : [e, r];
+              }),
+              (c.range = function (t) {
+                return arguments.length ? ((o = (u = ph.call(t)).length - 1), f()) : u.slice();
+              }),
+              (c.invertExtent = function (t) {
+                var n = u.indexOf(t);
+                return n < 0 ? [NaN, NaN] : n < 1 ? [e, a[0]] : n >= o ? [a[o - 1], r] : [a[n - 1], a[n]];
+              }),
+              (c.unknown = function (t) {
+                return arguments.length ? ((n = t), c) : c;
+              }),
+              (c.thresholds = function () {
+                return a.slice();
+              }),
+              (c.copy = function () {
+                return t().domain([e, r]).range(u).unknown(n);
+              }),
+              sh.apply(Eh(c), arguments)
+            );
+          }),
+          (t.scaleThreshold = function t() {
+            var n,
+              e = [0.5],
+              r = [0, 1],
+              o = 1;
+            function a(t) {
+              return t <= t ? r[i(e, t, 0, o)] : n;
+            }
+            return (
+              (a.domain = function (t) {
+                return arguments.length ? ((e = ph.call(t)), (o = Math.min(e.length, r.length - 1)), a) : e.slice();
+              }),
+              (a.range = function (t) {
+                return arguments.length ? ((r = ph.call(t)), (o = Math.min(e.length, r.length - 1)), a) : r.slice();
+              }),
+              (a.invertExtent = function (t) {
+                var n = r.indexOf(t);
+                return [e[n - 1], e[n]];
+              }),
+              (a.unknown = function (t) {
+                return arguments.length ? ((n = t), a) : n;
+              }),
+              (a.copy = function () {
+                return t().domain(e).range(r).unknown(n);
+              }),
+              sh.apply(a, arguments)
+            );
+          }),
+          (t.scaleTime = function () {
+            return sh.apply(
+              Nv(Nd, wd, cd, od, rd, nd, Kh, Wh, t.timeFormat).domain([new Date(2e3, 0, 1), new Date(2e3, 0, 2)]),
+              arguments
+            );
+          }),
+          (t.scaleUtc = function () {
+            return sh.apply(
+              Nv(Wd, Vd, Rd, Cd, kd, Td, Kh, Wh, t.utcFormat).domain([Date.UTC(2e3, 0, 1), Date.UTC(2e3, 0, 2)]),
+              arguments
+            );
+          }),
+          (t.scaleSequential = function t() {
+            var n = Eh(Av()(mh));
+            return (
+              (n.copy = function () {
+                return Tv(n, t());
+              }),
+              lh.apply(n, arguments)
+            );
+          }),
+          (t.scaleSequentialLog = function t() {
+            var n = Uh(Av()).domain([1, 10]);
+            return (
+              (n.copy = function () {
+                return Tv(n, t()).base(n.base());
+              }),
+              lh.apply(n, arguments)
+            );
+          }),
+          (t.scaleSequentialPow = Sv),
+          (t.scaleSequentialSqrt = function () {
+            return Sv.apply(null, arguments).exponent(0.5);
+          }),
+          (t.scaleSequentialSymlog = function t() {
+            var n = Yh(Av());
+            return (
+              (n.copy = function () {
+                return Tv(n, t()).constant(n.constant());
+              }),
+              lh.apply(n, arguments)
+            );
+          }),
+          (t.scaleSequentialQuantile = function t() {
+            var e = [],
+              r = mh;
+            function o(t) {
+              if (!isNaN((t = +t))) return r((i(e, t) - 1) / (e.length - 1));
+            }
+            return (
+              (o.domain = function (t) {
+                if (!arguments.length) return e.slice();
+                e = [];
+                for (var r, i = 0, a = t.length; i < a; ++i) null == (r = t[i]) || isNaN((r = +r)) || e.push(r);
+                return e.sort(n), o;
+              }),
+              (o.interpolator = function (t) {
+                return arguments.length ? ((r = t), o) : r;
+              }),
+              (o.copy = function () {
+                return t(r).domain(e);
+              }),
+              lh.apply(o, arguments)
+            );
+          }),
+          (t.scaleDiverging = function t() {
+            var n = Eh(kv()(mh));
+            return (
+              (n.copy = function () {
+                return Tv(n, t());
+              }),
+              lh.apply(n, arguments)
+            );
+          }),
+          (t.scaleDivergingLog = function t() {
+            var n = Uh(kv()).domain([0.1, 1, 10]);
+            return (
+              (n.copy = function () {
+                return Tv(n, t()).base(n.base());
+              }),
+              lh.apply(n, arguments)
+            );
+          }),
+          (t.scaleDivergingPow = Ev),
+          (t.scaleDivergingSqrt = function () {
+            return Ev.apply(null, arguments).exponent(0.5);
+          }),
+          (t.scaleDivergingSymlog = function t() {
+            var n = Yh(kv());
+            return (
+              (n.copy = function () {
+                return Tv(n, t()).constant(n.constant());
+              }),
+              lh.apply(n, arguments)
+            );
+          }),
+          (t.tickFormat = kh),
+          (t.schemeCategory10 = Pv),
+          (t.schemeAccent = zv),
+          (t.schemeDark2 = Rv),
+          (t.schemePaired = Dv),
+          (t.schemePastel1 = qv),
+          (t.schemePastel2 = Lv),
+          (t.schemeSet1 = Uv),
+          (t.schemeSet2 = Ov),
+          (t.schemeSet3 = Bv),
+          (t.interpolateBrBG = Iv),
+          (t.schemeBrBG = Fv),
+          (t.interpolatePRGn = Hv),
+          (t.schemePRGn = jv),
+          (t.interpolatePiYG = Gv),
+          (t.schemePiYG = Xv),
+          (t.interpolatePuOr = $v),
+          (t.schemePuOr = Vv),
+          (t.interpolateRdBu = Zv),
+          (t.schemeRdBu = Wv),
+          (t.interpolateRdGy = Jv),
+          (t.schemeRdGy = Qv),
+          (t.interpolateRdYlBu = tg),
+          (t.schemeRdYlBu = Kv),
+          (t.interpolateRdYlGn = eg),
+          (t.schemeRdYlGn = ng),
+          (t.interpolateSpectral = ig),
+          (t.schemeSpectral = rg),
+          (t.interpolateBuGn = ag),
+          (t.schemeBuGn = og),
+          (t.interpolateBuPu = cg),
+          (t.schemeBuPu = ug),
+          (t.interpolateGnBu = sg),
+          (t.schemeGnBu = fg),
+          (t.interpolateOrRd = hg),
+          (t.schemeOrRd = lg),
+          (t.interpolatePuBuGn = pg),
+          (t.schemePuBuGn = dg),
+          (t.interpolatePuBu = gg),
+          (t.schemePuBu = vg),
+          (t.interpolatePuRd = _g),
+          (t.schemePuRd = yg),
+          (t.interpolateRdPu = mg),
+          (t.schemeRdPu = bg),
+          (t.interpolateYlGnBu = wg),
+          (t.schemeYlGnBu = xg),
+          (t.interpolateYlGn = Ng),
+          (t.schemeYlGn = Mg),
+          (t.interpolateYlOrBr = Tg),
+          (t.schemeYlOrBr = Ag),
+          (t.interpolateYlOrRd = kg),
+          (t.schemeYlOrRd = Sg),
+          (t.interpolateBlues = Cg),
+          (t.schemeBlues = Eg),
+          (t.interpolateGreens = zg),
+          (t.schemeGreens = Pg),
+          (t.interpolateGreys = Dg),
+          (t.schemeGreys = Rg),
+          (t.interpolatePurples = Lg),
+          (t.schemePurples = qg),
+          (t.interpolateReds = Og),
+          (t.schemeReds = Ug),
+          (t.interpolateOranges = Yg),
+          (t.schemeOranges = Bg),
+          (t.interpolateCubehelixDefault = Fg),
+          (t.interpolateRainbow = function (t) {
+            (t < 0 || t > 1) && (t -= Math.floor(t));
+            var n = Math.abs(t - 0.5);
+            return (Hg.h = 360 * t - 100), (Hg.s = 1.5 - 1.5 * n), (Hg.l = 0.8 - 0.9 * n), Hg + "";
+          }),
+          (t.interpolateWarm = Ig),
+          (t.interpolateCool = jg),
+          (t.interpolateSinebow = function (t) {
+            var n;
+            return (
+              (t = (0.5 - t) * Math.PI),
+              (Xg.r = 255 * (n = Math.sin(t)) * n),
+              (Xg.g = 255 * (n = Math.sin(t + Gg)) * n),
+              (Xg.b = 255 * (n = Math.sin(t + Vg)) * n),
+              Xg + ""
+            );
+          }),
+          (t.interpolateViridis = Wg),
+          (t.interpolateMagma = Zg),
+          (t.interpolateInferno = Qg),
+          (t.interpolatePlasma = Jg),
+          (t.create = function (t) {
+            return zt(W(t).call(document.documentElement));
+          }),
+          (t.creator = W),
+          (t.local = Dt),
+          (t.matcher = tt),
+          (t.mouse = Ot),
+          (t.namespace = $),
+          (t.namespaces = V),
+          (t.clientPoint = Ut),
+          (t.select = zt),
+          (t.selectAll = function (t) {
+            return "string" == typeof t
+              ? new Ct([document.querySelectorAll(t)], [document.documentElement])
+              : new Ct([null == t ? [] : t], Et);
+          }),
+          (t.selection = Pt),
+          (t.selector = Q),
+          (t.selectorAll = K),
+          (t.style = ct),
+          (t.touch = Bt),
+          (t.touches = function (t, n) {
+            null == n && (n = Lt().touches);
+            for (var e = 0, r = n ? n.length : 0, i = new Array(r); e < r; ++e) i[e] = Ut(t, n[e]);
+            return i;
+          }),
+          (t.window = ut),
+          (t.customEvent = St),
+          (t.arc = function () {
+            var t = hy,
+              n = dy,
+              e = Kg(0),
+              r = null,
+              i = py,
+              o = vy,
+              a = gy,
+              u = null;
+            function c() {
+              var c,
+                f,
+                s,
+                l = +t.apply(this, arguments),
+                h = +n.apply(this, arguments),
+                d = i.apply(this, arguments) - fy,
+                p = o.apply(this, arguments) - fy,
+                v = ty(p - d),
+                g = p > d;
+              if ((u || (u = c = Hi()), h < l && ((f = h), (h = l), (l = f)), h > uy))
+                if (v > sy - uy)
+                  u.moveTo(h * ey(d), h * oy(d)),
+                    u.arc(0, 0, h, d, p, !g),
+                    l > uy && (u.moveTo(l * ey(p), l * oy(p)), u.arc(0, 0, l, p, d, g));
+                else {
+                  var y,
+                    _,
+                    b = d,
+                    m = p,
+                    x = d,
+                    w = p,
+                    M = v,
+                    N = v,
+                    A = a.apply(this, arguments) / 2,
+                    T = A > uy && (r ? +r.apply(this, arguments) : ay(l * l + h * h)),
+                    S = iy(ty(h - l) / 2, +e.apply(this, arguments)),
+                    k = S,
+                    E = S;
+                  if (T > uy) {
+                    var C = ly((T / l) * oy(A)),
+                      P = ly((T / h) * oy(A));
+                    (M -= 2 * C) > uy ? ((x += C *= g ? 1 : -1), (w -= C)) : ((M = 0), (x = w = (d + p) / 2)),
+                      (N -= 2 * P) > uy ? ((b += P *= g ? 1 : -1), (m -= P)) : ((N = 0), (b = m = (d + p) / 2));
+                  }
+                  var z = h * ey(b),
+                    R = h * oy(b),
+                    D = l * ey(w),
+                    q = l * oy(w);
+                  if (S > uy) {
+                    var L,
+                      U = h * ey(m),
+                      O = h * oy(m),
+                      B = l * ey(x),
+                      Y = l * oy(x);
+                    if (
+                      v < cy &&
+                      (L = (function (t, n, e, r, i, o, a, u) {
+                        var c = e - t,
+                          f = r - n,
+                          s = a - i,
+                          l = u - o,
+                          h = l * c - s * f;
+                        if (!(h * h < uy)) return [t + (h = (s * (n - o) - l * (t - i)) / h) * c, n + h * f];
+                      })(z, R, B, Y, U, O, D, q))
+                    ) {
+                      var F = z - L[0],
+                        I = R - L[1],
+                        j = U - L[0],
+                        H = O - L[1],
+                        X =
+                          1 /
+                          oy(
+                            ((s = (F * j + I * H) / (ay(F * F + I * I) * ay(j * j + H * H))) > 1
+                              ? 0
+                              : s < -1
+                                ? cy
+                                : Math.acos(s)) / 2
+                          ),
+                        G = ay(L[0] * L[0] + L[1] * L[1]);
+                      (k = iy(S, (l - G) / (X - 1))), (E = iy(S, (h - G) / (X + 1)));
+                    }
+                  }
+                  N > uy
+                    ? E > uy
+                      ? ((y = yy(B, Y, z, R, h, E, g)),
+                        (_ = yy(U, O, D, q, h, E, g)),
+                        u.moveTo(y.cx + y.x01, y.cy + y.y01),
+                        E < S
+                          ? u.arc(y.cx, y.cy, E, ny(y.y01, y.x01), ny(_.y01, _.x01), !g)
+                          : (u.arc(y.cx, y.cy, E, ny(y.y01, y.x01), ny(y.y11, y.x11), !g),
+                            u.arc(0, 0, h, ny(y.cy + y.y11, y.cx + y.x11), ny(_.cy + _.y11, _.cx + _.x11), !g),
+                            u.arc(_.cx, _.cy, E, ny(_.y11, _.x11), ny(_.y01, _.x01), !g)))
+                      : (u.moveTo(z, R), u.arc(0, 0, h, b, m, !g))
+                    : u.moveTo(z, R),
+                    l > uy && M > uy
+                      ? k > uy
+                        ? ((y = yy(D, q, U, O, l, -k, g)),
+                          (_ = yy(z, R, B, Y, l, -k, g)),
+                          u.lineTo(y.cx + y.x01, y.cy + y.y01),
+                          k < S
+                            ? u.arc(y.cx, y.cy, k, ny(y.y01, y.x01), ny(_.y01, _.x01), !g)
+                            : (u.arc(y.cx, y.cy, k, ny(y.y01, y.x01), ny(y.y11, y.x11), !g),
+                              u.arc(0, 0, l, ny(y.cy + y.y11, y.cx + y.x11), ny(_.cy + _.y11, _.cx + _.x11), g),
+                              u.arc(_.cx, _.cy, k, ny(_.y11, _.x11), ny(_.y01, _.x01), !g)))
+                        : u.arc(0, 0, l, w, x, g)
+                      : u.lineTo(D, q);
+                }
+              else u.moveTo(0, 0);
+              if ((u.closePath(), c)) return (u = null), c + "" || null;
+            }
+            return (
+              (c.centroid = function () {
+                var e = (+t.apply(this, arguments) + +n.apply(this, arguments)) / 2,
+                  r = (+i.apply(this, arguments) + +o.apply(this, arguments)) / 2 - cy / 2;
+                return [ey(r) * e, oy(r) * e];
+              }),
+              (c.innerRadius = function (n) {
+                return arguments.length ? ((t = "function" == typeof n ? n : Kg(+n)), c) : t;
+              }),
+              (c.outerRadius = function (t) {
+                return arguments.length ? ((n = "function" == typeof t ? t : Kg(+t)), c) : n;
+              }),
+              (c.cornerRadius = function (t) {
+                return arguments.length ? ((e = "function" == typeof t ? t : Kg(+t)), c) : e;
+              }),
+              (c.padRadius = function (t) {
+                return arguments.length ? ((r = null == t ? null : "function" == typeof t ? t : Kg(+t)), c) : r;
+              }),
+              (c.startAngle = function (t) {
+                return arguments.length ? ((i = "function" == typeof t ? t : Kg(+t)), c) : i;
+              }),
+              (c.endAngle = function (t) {
+                return arguments.length ? ((o = "function" == typeof t ? t : Kg(+t)), c) : o;
+              }),
+              (c.padAngle = function (t) {
+                return arguments.length ? ((a = "function" == typeof t ? t : Kg(+t)), c) : a;
+              }),
+              (c.context = function (t) {
+                return arguments.length ? ((u = null == t ? null : t), c) : u;
+              }),
+              c
+            );
+          }),
+          (t.area = My),
+          (t.line = wy),
+          (t.pie = function () {
+            var t = Ay,
+              n = Ny,
+              e = null,
+              r = Kg(0),
+              i = Kg(sy),
+              o = Kg(0);
+            function a(a) {
+              var u,
+                c,
+                f,
+                s,
+                l,
+                h = a.length,
+                d = 0,
+                p = new Array(h),
+                v = new Array(h),
+                g = +r.apply(this, arguments),
+                y = Math.min(sy, Math.max(-sy, i.apply(this, arguments) - g)),
+                _ = Math.min(Math.abs(y) / h, o.apply(this, arguments)),
+                b = _ * (y < 0 ? -1 : 1);
+              for (u = 0; u < h; ++u) (l = v[(p[u] = u)] = +t(a[u], u, a)) > 0 && (d += l);
+              for (
+                null != n
+                  ? p.sort(function (t, e) {
+                      return n(v[t], v[e]);
+                    })
+                  : null != e &&
+                    p.sort(function (t, n) {
+                      return e(a[t], a[n]);
+                    }),
+                  u = 0,
+                  f = d ? (y - h * b) / d : 0;
+                u < h;
+                ++u, g = s
+              )
+                (c = p[u]),
+                  (s = g + ((l = v[c]) > 0 ? l * f : 0) + b),
+                  (v[c] = { data: a[c], index: u, value: l, startAngle: g, endAngle: s, padAngle: _ });
+              return v;
+            }
+            return (
+              (a.value = function (n) {
+                return arguments.length ? ((t = "function" == typeof n ? n : Kg(+n)), a) : t;
+              }),
+              (a.sortValues = function (t) {
+                return arguments.length ? ((n = t), (e = null), a) : n;
+              }),
+              (a.sort = function (t) {
+                return arguments.length ? ((e = t), (n = null), a) : e;
+              }),
+              (a.startAngle = function (t) {
+                return arguments.length ? ((r = "function" == typeof t ? t : Kg(+t)), a) : r;
+              }),
+              (a.endAngle = function (t) {
+                return arguments.length ? ((i = "function" == typeof t ? t : Kg(+t)), a) : i;
+              }),
+              (a.padAngle = function (t) {
+                return arguments.length ? ((o = "function" == typeof t ? t : Kg(+t)), a) : o;
+              }),
+              a
+            );
+          }),
+          (t.areaRadial = Py),
+          (t.radialArea = Py),
+          (t.lineRadial = Cy),
+          (t.radialLine = Cy),
+          (t.pointRadial = zy),
+          (t.linkHorizontal = function () {
+            return Ly(Uy);
+          }),
+          (t.linkVertical = function () {
+            return Ly(Oy);
+          }),
+          (t.linkRadial = function () {
+            var t = Ly(By);
+            return (t.angle = t.x), delete t.x, (t.radius = t.y), delete t.y, t;
+          }),
+          (t.symbol = function () {
+            var t = Kg(Yy),
+              n = Kg(64),
+              e = null;
+            function r() {
+              var r;
+              if ((e || (e = r = Hi()), t.apply(this, arguments).draw(e, +n.apply(this, arguments)), r))
+                return (e = null), r + "" || null;
+            }
+            return (
+              (r.type = function (n) {
+                return arguments.length ? ((t = "function" == typeof n ? n : Kg(n)), r) : t;
+              }),
+              (r.size = function (t) {
+                return arguments.length ? ((n = "function" == typeof t ? t : Kg(+t)), r) : n;
+              }),
+              (r.context = function (t) {
+                return arguments.length ? ((e = null == t ? null : t), r) : e;
+              }),
+              r
+            );
+          }),
+          (t.symbols = e_),
+          (t.symbolCircle = Yy),
+          (t.symbolCross = Fy),
+          (t.symbolDiamond = Hy),
+          (t.symbolSquare = Wy),
+          (t.symbolStar = $y),
+          (t.symbolTriangle = Qy),
+          (t.symbolWye = n_),
+          (t.curveBasisClosed = function (t) {
+            return new a_(t);
+          }),
+          (t.curveBasisOpen = function (t) {
+            return new u_(t);
+          }),
+          (t.curveBasis = function (t) {
+            return new o_(t);
+          }),
+          (t.curveBundle = f_),
+          (t.curveCardinalClosed = p_),
+          (t.curveCardinalOpen = g_),
+          (t.curveCardinal = h_),
+          (t.curveCatmullRomClosed = x_),
+          (t.curveCatmullRomOpen = M_),
+          (t.curveCatmullRom = b_),
+          (t.curveLinearClosed = function (t) {
+            return new N_(t);
+          }),
+          (t.curveLinear = by),
+          (t.curveMonotoneX = function (t) {
+            return new E_(t);
+          }),
+          (t.curveMonotoneY = function (t) {
+            return new C_(t);
+          }),
+          (t.curveNatural = function (t) {
+            return new z_(t);
+          }),
+          (t.curveStep = function (t) {
+            return new D_(t, 0.5);
+          }),
+          (t.curveStepAfter = function (t) {
+            return new D_(t, 1);
+          }),
+          (t.curveStepBefore = function (t) {
+            return new D_(t, 0);
+          }),
+          (t.stack = function () {
+            var t = Kg([]),
+              n = L_,
+              e = q_,
+              r = U_;
+            function i(i) {
+              var o,
+                a,
+                u = t.apply(this, arguments),
+                c = i.length,
+                f = u.length,
+                s = new Array(f);
+              for (o = 0; o < f; ++o) {
+                for (var l, h = u[o], d = (s[o] = new Array(c)), p = 0; p < c; ++p)
+                  (d[p] = l = [0, +r(i[p], h, p, i)]), (l.data = i[p]);
+                d.key = h;
+              }
+              for (o = 0, a = n(s); o < f; ++o) s[a[o]].index = o;
+              return e(s, a), s;
+            }
+            return (
+              (i.keys = function (n) {
+                return arguments.length ? ((t = "function" == typeof n ? n : Kg(Ry.call(n))), i) : t;
+              }),
+              (i.value = function (t) {
+                return arguments.length ? ((r = "function" == typeof t ? t : Kg(+t)), i) : r;
+              }),
+              (i.order = function (t) {
+                return arguments.length ? ((n = null == t ? L_ : "function" == typeof t ? t : Kg(Ry.call(t))), i) : n;
+              }),
+              (i.offset = function (t) {
+                return arguments.length ? ((e = null == t ? q_ : t), i) : e;
+              }),
+              i
+            );
+          }),
+          (t.stackOffsetExpand = function (t, n) {
+            if ((r = t.length) > 0) {
+              for (var e, r, i, o = 0, a = t[0].length; o < a; ++o) {
+                for (i = e = 0; e < r; ++e) i += t[e][o][1] || 0;
+                if (i) for (e = 0; e < r; ++e) t[e][o][1] /= i;
+              }
+              q_(t, n);
+            }
+          }),
+          (t.stackOffsetDiverging = function (t, n) {
+            if ((u = t.length) > 1)
+              for (var e, r, i, o, a, u, c = 0, f = t[n[0]].length; c < f; ++c)
+                for (o = a = 0, e = 0; e < u; ++e)
+                  (i = (r = t[n[e]][c])[1] - r[0]) >= 0
+                    ? ((r[0] = o), (r[1] = o += i))
+                    : i < 0
+                      ? ((r[1] = a), (r[0] = a += i))
+                      : (r[0] = o);
+          }),
+          (t.stackOffsetNone = q_),
+          (t.stackOffsetSilhouette = function (t, n) {
+            if ((e = t.length) > 0) {
+              for (var e, r = 0, i = t[n[0]], o = i.length; r < o; ++r) {
+                for (var a = 0, u = 0; a < e; ++a) u += t[a][r][1] || 0;
+                i[r][1] += i[r][0] = -u / 2;
+              }
+              q_(t, n);
+            }
+          }),
+          (t.stackOffsetWiggle = function (t, n) {
+            if ((i = t.length) > 0 && (r = (e = t[n[0]]).length) > 0) {
+              for (var e, r, i, o = 0, a = 1; a < r; ++a) {
+                for (var u = 0, c = 0, f = 0; u < i; ++u) {
+                  for (var s = t[n[u]], l = s[a][1] || 0, h = (l - (s[a - 1][1] || 0)) / 2, d = 0; d < u; ++d) {
+                    var p = t[n[d]];
+                    h += (p[a][1] || 0) - (p[a - 1][1] || 0);
+                  }
+                  (c += l), (f += h * l);
+                }
+                (e[a - 1][1] += e[a - 1][0] = o), c && (o -= f / c);
+              }
+              (e[a - 1][1] += e[a - 1][0] = o), q_(t, n);
+            }
+          }),
+          (t.stackOrderAppearance = O_),
+          (t.stackOrderAscending = Y_),
+          (t.stackOrderDescending = function (t) {
+            return Y_(t).reverse();
+          }),
+          (t.stackOrderInsideOut = function (t) {
+            var n,
+              e,
+              r = t.length,
+              i = t.map(F_),
+              o = O_(t),
+              a = 0,
+              u = 0,
+              c = [],
+              f = [];
+            for (n = 0; n < r; ++n) (e = o[n]), a < u ? ((a += i[e]), c.push(e)) : ((u += i[e]), f.push(e));
+            return f.reverse().concat(c);
+          }),
+          (t.stackOrderNone = L_),
+          (t.stackOrderReverse = function (t) {
+            return L_(t).reverse();
+          }),
+          (t.timeInterval = $h),
+          (t.timeMillisecond = Wh),
+          (t.timeMilliseconds = Zh),
+          (t.utcMillisecond = Wh),
+          (t.utcMilliseconds = Zh),
+          (t.timeSecond = Kh),
+          (t.timeSeconds = td),
+          (t.utcSecond = Kh),
+          (t.utcSeconds = td),
+          (t.timeMinute = nd),
+          (t.timeMinutes = ed),
+          (t.timeHour = rd),
+          (t.timeHours = id),
+          (t.timeDay = od),
+          (t.timeDays = ad),
+          (t.timeWeek = cd),
+          (t.timeWeeks = vd),
+          (t.timeSunday = cd),
+          (t.timeSundays = vd),
+          (t.timeMonday = fd),
+          (t.timeMondays = gd),
+          (t.timeTuesday = sd),
+          (t.timeTuesdays = yd),
+          (t.timeWednesday = ld),
+          (t.timeWednesdays = _d),
+          (t.timeThursday = hd),
+          (t.timeThursdays = bd),
+          (t.timeFriday = dd),
+          (t.timeFridays = md),
+          (t.timeSaturday = pd),
+          (t.timeSaturdays = xd),
+          (t.timeMonth = wd),
+          (t.timeMonths = Md),
+          (t.timeYear = Nd),
+          (t.timeYears = Ad),
+          (t.utcMinute = Td),
+          (t.utcMinutes = Sd),
+          (t.utcHour = kd),
+          (t.utcHours = Ed),
+          (t.utcDay = Cd),
+          (t.utcDays = Pd),
+          (t.utcWeek = Rd),
+          (t.utcWeeks = Yd),
+          (t.utcSunday = Rd),
+          (t.utcSundays = Yd),
+          (t.utcMonday = Dd),
+          (t.utcMondays = Fd),
+          (t.utcTuesday = qd),
+          (t.utcTuesdays = Id),
+          (t.utcWednesday = Ld),
+          (t.utcWednesdays = jd),
+          (t.utcThursday = Ud),
+          (t.utcThursdays = Hd),
+          (t.utcFriday = Od),
+          (t.utcFridays = Xd),
+          (t.utcSaturday = Bd),
+          (t.utcSaturdays = Gd),
+          (t.utcMonth = Vd),
+          (t.utcMonths = $d),
+          (t.utcYear = Wd),
+          (t.utcYears = Zd),
+          (t.timeFormatDefaultLocale = hv),
+          (t.timeFormatLocale = tp),
+          (t.isoFormat = dv),
+          (t.isoParse = pv),
+          (t.now = nr),
+          (t.timer = ir),
+          (t.timerFlush = or),
+          (t.timeout = fr),
+          (t.interval = function (t, n, e) {
+            var r = new rr(),
+              i = n;
+            return null == n
+              ? (r.restart(t, n, e), r)
+              : ((n = +n),
+                (e = null == e ? nr() : +e),
+                r.restart(
+                  function o(a) {
+                    (a += i), r.restart(o, (i += n), e), t(a);
+                  },
+                  n,
+                  e
+                ),
+                r);
+          }),
+          (t.transition = Cr),
+          (t.active = function (t, n) {
+            var e,
+              r,
+              i = t.__transition;
+            if (i)
+              for (r in ((n = null == n ? null : n + ""), i))
+                if ((e = i[r]).state > dr && e.name === n) return new Er([[t]], fi, n, +r);
+            return null;
+          }),
+          (t.interrupt = Mr),
+          (t.voronoi = function () {
+            var t = j_,
+              n = H_,
+              e = null;
+            function r(r) {
+              return new Nb(
+                r.map(function (e, i) {
+                  var o = [Math.round(t(e, i, r) / xb) * xb, Math.round(n(e, i, r) / xb) * xb];
+                  return (o.index = i), (o.data = e), o;
+                }),
+                e
+              );
+            }
+            return (
+              (r.polygons = function (t) {
+                return r(t).polygons();
+              }),
+              (r.links = function (t) {
+                return r(t).links();
+              }),
+              (r.triangles = function (t) {
+                return r(t).triangles();
+              }),
+              (r.x = function (n) {
+                return arguments.length ? ((t = "function" == typeof n ? n : I_(+n)), r) : t;
+              }),
+              (r.y = function (t) {
+                return arguments.length ? ((n = "function" == typeof t ? t : I_(+t)), r) : n;
+              }),
+              (r.extent = function (t) {
+                return arguments.length
+                  ? ((e =
+                      null == t
+                        ? null
+                        : [
+                            [+t[0][0], +t[0][1]],
+                            [+t[1][0], +t[1][1]],
+                          ]),
+                    r)
+                  : e && [
+                      [e[0][0], e[0][1]],
+                      [e[1][0], e[1][1]],
+                    ];
+              }),
+              (r.size = function (t) {
+                return arguments.length
+                  ? ((e =
+                      null == t
+                        ? null
+                        : [
+                            [0, 0],
+                            [+t[0], +t[1]],
+                          ]),
+                    r)
+                  : e && [e[1][0] - e[0][0], e[1][1] - e[0][1]];
+              }),
+              r
+            );
+          }),
+          (t.zoom = function () {
+            var n,
+              e,
+              r = zb,
+              i = Rb,
+              o = Ub,
+              a = qb,
+              u = Lb,
+              c = [0, 1 / 0],
+              f = [
+                [-1 / 0, -1 / 0],
+                [1 / 0, 1 / 0],
+              ],
+              s = 250,
+              l = De,
+              h = [],
+              d = I("start", "zoom", "end"),
+              p = 500,
+              v = 150,
+              g = 0;
+            function y(t) {
+              t.property("__zoom", Db)
+                .on("wheel.zoom", N)
+                .on("mousedown.zoom", A)
+                .on("dblclick.zoom", T)
+                .filter(u)
+                .on("touchstart.zoom", S)
+                .on("touchmove.zoom", k)
+                .on("touchend.zoom touchcancel.zoom", E)
+                .style("touch-action", "none")
+                .style("-webkit-tap-highlight-color", "rgba(0,0,0,0)");
+            }
+            function _(t, n) {
+              return (n = Math.max(c[0], Math.min(c[1], n))) === t.k ? t : new Sb(n, t.x, t.y);
+            }
+            function b(t, n, e) {
+              var r = n[0] - e[0] * t.k,
+                i = n[1] - e[1] * t.k;
+              return r === t.x && i === t.y ? t : new Sb(t.k, r, i);
+            }
+            function m(t) {
+              return [(+t[0][0] + +t[1][0]) / 2, (+t[0][1] + +t[1][1]) / 2];
+            }
+            function x(t, n, e) {
+              t.on("start.zoom", function () {
+                w(this, arguments).start();
+              })
+                .on("interrupt.zoom end.zoom", function () {
+                  w(this, arguments).end();
+                })
+                .tween("zoom", function () {
+                  var t = arguments,
+                    r = w(this, t),
+                    o = i.apply(this, t),
+                    a = e || m(o),
+                    u = Math.max(o[1][0] - o[0][0], o[1][1] - o[0][1]),
+                    c = this.__zoom,
+                    f = "function" == typeof n ? n.apply(this, t) : n,
+                    s = l(c.invert(a).concat(u / c.k), f.invert(a).concat(u / f.k));
+                  return function (t) {
+                    if (1 === t) t = f;
+                    else {
+                      var n = s(t),
+                        e = u / n[2];
+                      t = new Sb(e, a[0] - n[0] * e, a[1] - n[1] * e);
+                    }
+                    r.zoom(null, t);
+                  };
+                });
+            }
+            function w(t, n) {
+              for (var e, r = 0, i = h.length; r < i; ++r) if ((e = h[r]).that === t) return e;
+              return new M(t, n);
+            }
+            function M(t, n) {
+              (this.that = t), (this.args = n), (this.index = -1), (this.active = 0), (this.extent = i.apply(t, n));
+            }
+            function N() {
+              if (r.apply(this, arguments)) {
+                var t = w(this, arguments),
+                  n = this.__zoom,
+                  e = Math.max(c[0], Math.min(c[1], n.k * Math.pow(2, a.apply(this, arguments)))),
+                  i = Ot(this);
+                if (t.wheel)
+                  (t.mouse[0][0] === i[0] && t.mouse[0][1] === i[1]) || (t.mouse[1] = n.invert((t.mouse[0] = i))),
+                    clearTimeout(t.wheel);
+                else {
+                  if (n.k === e) return;
+                  (t.mouse = [i, n.invert(i)]), Mr(this), t.start();
+                }
+                Pb(),
+                  (t.wheel = setTimeout(function () {
+                    (t.wheel = null), t.end();
+                  }, v)),
+                  t.zoom("mouse", o(b(_(n, e), t.mouse[0], t.mouse[1]), t.extent, f));
+              }
+            }
+            function A() {
+              if (!e && r.apply(this, arguments)) {
+                var n = w(this, arguments),
+                  i = zt(t.event.view)
+                    .on(
+                      "mousemove.zoom",
+                      function () {
+                        if ((Pb(), !n.moved)) {
+                          var e = t.event.clientX - u,
+                            r = t.event.clientY - c;
+                          n.moved = e * e + r * r > g;
+                        }
+                        n.zoom("mouse", o(b(n.that.__zoom, (n.mouse[0] = Ot(n.that)), n.mouse[1]), n.extent, f));
+                      },
+                      !0
+                    )
+                    .on(
+                      "mouseup.zoom",
+                      function () {
+                        i.on("mousemove.zoom mouseup.zoom", null), jt(t.event.view, n.moved), Pb(), n.end();
+                      },
+                      !0
+                    ),
+                  a = Ot(this),
+                  u = t.event.clientX,
+                  c = t.event.clientY;
+                It(t.event.view), Cb(), (n.mouse = [a, this.__zoom.invert(a)]), Mr(this), n.start();
+              }
+            }
+            function T() {
+              if (r.apply(this, arguments)) {
+                var n = this.__zoom,
+                  e = Ot(this),
+                  a = n.invert(e),
+                  u = n.k * (t.event.shiftKey ? 0.5 : 2),
+                  c = o(b(_(n, u), e, a), i.apply(this, arguments), f);
+                Pb(), s > 0 ? zt(this).transition().duration(s).call(x, c, e) : zt(this).call(y.transform, c);
+              }
+            }
+            function S() {
+              if (r.apply(this, arguments)) {
+                var e,
+                  i,
+                  o,
+                  a,
+                  u = w(this, arguments),
+                  c = t.event.changedTouches,
+                  f = c.length;
+                for (Cb(), i = 0; i < f; ++i)
+                  (a = [(a = Bt(this, c, (o = c[i]).identifier)), this.__zoom.invert(a), o.identifier]),
+                    u.touch0 ? u.touch1 || (u.touch1 = a) : ((u.touch0 = a), (e = !0));
+                if (n && ((n = clearTimeout(n)), !u.touch1))
+                  return u.end(), void ((a = zt(this).on("dblclick.zoom")) && a.apply(this, arguments));
+                e &&
+                  ((n = setTimeout(function () {
+                    n = null;
+                  }, p)),
+                  Mr(this),
+                  u.start());
+              }
+            }
+            function k() {
+              var e,
+                r,
+                i,
+                a,
+                u = w(this, arguments),
+                c = t.event.changedTouches,
+                s = c.length;
+              for (Pb(), n && (n = clearTimeout(n)), e = 0; e < s; ++e)
+                (i = Bt(this, c, (r = c[e]).identifier)),
+                  u.touch0 && u.touch0[2] === r.identifier
+                    ? (u.touch0[0] = i)
+                    : u.touch1 && u.touch1[2] === r.identifier && (u.touch1[0] = i);
+              if (((r = u.that.__zoom), u.touch1)) {
+                var l = u.touch0[0],
+                  h = u.touch0[1],
+                  d = u.touch1[0],
+                  p = u.touch1[1],
+                  v = (v = d[0] - l[0]) * v + (v = d[1] - l[1]) * v,
+                  g = (g = p[0] - h[0]) * g + (g = p[1] - h[1]) * g;
+                (r = _(r, Math.sqrt(v / g))),
+                  (i = [(l[0] + d[0]) / 2, (l[1] + d[1]) / 2]),
+                  (a = [(h[0] + p[0]) / 2, (h[1] + p[1]) / 2]);
+              } else {
+                if (!u.touch0) return;
+                (i = u.touch0[0]), (a = u.touch0[1]);
+              }
+              u.zoom("touch", o(b(r, i, a), u.extent, f));
+            }
+            function E() {
+              var n,
+                r,
+                i = w(this, arguments),
+                o = t.event.changedTouches,
+                a = o.length;
+              for (
+                Cb(),
+                  e && clearTimeout(e),
+                  e = setTimeout(function () {
+                    e = null;
+                  }, p),
+                  n = 0;
+                n < a;
+                ++n
+              )
+                (r = o[n]),
+                  i.touch0 && i.touch0[2] === r.identifier
+                    ? delete i.touch0
+                    : i.touch1 && i.touch1[2] === r.identifier && delete i.touch1;
+              i.touch1 && !i.touch0 && ((i.touch0 = i.touch1), delete i.touch1),
+                i.touch0 ? (i.touch0[1] = this.__zoom.invert(i.touch0[0])) : i.end();
+            }
+            return (
+              (y.transform = function (t, n) {
+                var e = t.selection ? t.selection() : t;
+                e.property("__zoom", Db),
+                  t !== e
+                    ? x(t, n)
+                    : e.interrupt().each(function () {
+                        w(this, arguments)
+                          .start()
+                          .zoom(null, "function" == typeof n ? n.apply(this, arguments) : n)
+                          .end();
+                      });
+              }),
+              (y.scaleBy = function (t, n) {
+                y.scaleTo(t, function () {
+                  return this.__zoom.k * ("function" == typeof n ? n.apply(this, arguments) : n);
+                });
+              }),
+              (y.scaleTo = function (t, n) {
+                y.transform(t, function () {
+                  var t = i.apply(this, arguments),
+                    e = this.__zoom,
+                    r = m(t),
+                    a = e.invert(r),
+                    u = "function" == typeof n ? n.apply(this, arguments) : n;
+                  return o(b(_(e, u), r, a), t, f);
+                });
+              }),
+              (y.translateBy = function (t, n, e) {
+                y.transform(t, function () {
+                  return o(
+                    this.__zoom.translate(
+                      "function" == typeof n ? n.apply(this, arguments) : n,
+                      "function" == typeof e ? e.apply(this, arguments) : e
+                    ),
+                    i.apply(this, arguments),
+                    f
+                  );
+                });
+              }),
+              (y.translateTo = function (t, n, e) {
+                y.transform(t, function () {
+                  var t = i.apply(this, arguments),
+                    r = this.__zoom,
+                    a = m(t);
+                  return o(
+                    kb
+                      .translate(a[0], a[1])
+                      .scale(r.k)
+                      .translate(
+                        "function" == typeof n ? -n.apply(this, arguments) : -n,
+                        "function" == typeof e ? -e.apply(this, arguments) : -e
+                      ),
+                    t,
+                    f
+                  );
+                });
+              }),
+              (M.prototype = {
+                start: function () {
+                  return 1 == ++this.active && ((this.index = h.push(this) - 1), this.emit("start")), this;
+                },
+                zoom: function (t, n) {
+                  return (
+                    this.mouse && "mouse" !== t && (this.mouse[1] = n.invert(this.mouse[0])),
+                    this.touch0 && "touch" !== t && (this.touch0[1] = n.invert(this.touch0[0])),
+                    this.touch1 && "touch" !== t && (this.touch1[1] = n.invert(this.touch1[0])),
+                    (this.that.__zoom = n),
+                    this.emit("zoom"),
+                    this
+                  );
+                },
+                end: function () {
+                  return 0 == --this.active && (h.splice(this.index, 1), (this.index = -1), this.emit("end")), this;
+                },
+                emit: function (t) {
+                  St(new Tb(y, t, this.that.__zoom), d.apply, d, [t, this.that, this.args]);
+                },
+              }),
+              (y.wheelDelta = function (t) {
+                return arguments.length ? ((a = "function" == typeof t ? t : Ab(+t)), y) : a;
+              }),
+              (y.filter = function (t) {
+                return arguments.length ? ((r = "function" == typeof t ? t : Ab(!!t)), y) : r;
+              }),
+              (y.touchable = function (t) {
+                return arguments.length ? ((u = "function" == typeof t ? t : Ab(!!t)), y) : u;
+              }),
+              (y.extent = function (t) {
+                return arguments.length
+                  ? ((i =
+                      "function" == typeof t
+                        ? t
+                        : Ab([
+                            [+t[0][0], +t[0][1]],
+                            [+t[1][0], +t[1][1]],
+                          ])),
+                    y)
+                  : i;
+              }),
+              (y.scaleExtent = function (t) {
+                return arguments.length ? ((c[0] = +t[0]), (c[1] = +t[1]), y) : [c[0], c[1]];
+              }),
+              (y.translateExtent = function (t) {
+                return arguments.length
+                  ? ((f[0][0] = +t[0][0]), (f[1][0] = +t[1][0]), (f[0][1] = +t[0][1]), (f[1][1] = +t[1][1]), y)
+                  : [
+                      [f[0][0], f[0][1]],
+                      [f[1][0], f[1][1]],
+                    ];
+              }),
+              (y.constrain = function (t) {
+                return arguments.length ? ((o = t), y) : o;
+              }),
+              (y.duration = function (t) {
+                return arguments.length ? ((s = +t), y) : s;
+              }),
+              (y.interpolate = function (t) {
+                return arguments.length ? ((l = t), y) : l;
+              }),
+              (y.on = function () {
+                var t = d.on.apply(d, arguments);
+                return t === d ? y : t;
+              }),
+              (y.clickDistance = function (t) {
+                return arguments.length ? ((g = (t = +t) * t), y) : Math.sqrt(g);
+              }),
+              y
+            );
+          }),
+          (t.zoomTransform = Eb),
+          (t.zoomIdentity = kb),
+          Object.defineProperty(t, "__esModule", { value: !0 });
+      });
+    </script>
+    <script>
+      !(function (t, e) {
+        "object" == typeof exports && "undefined" != typeof module
+          ? e(
+              exports,
+              require("d3-selection"),
+              require("d3-dispatch"),
+              require("d3-transition"),
+              require("d3-timer"),
+              require("d3-interpolate"),
+              require("d3-zoom"),
+              require("viz.js/viz"),
+              require("d3-format"),
+              require("d3-path")
+            )
+          : "function" == typeof define && define.amd
+            ? define(
+                [
+                  "exports",
+                  "d3-selection",
+                  "d3-dispatch",
+                  "d3-transition",
+                  "d3-timer",
+                  "d3-interpolate",
+                  "d3-zoom",
+                  "viz.js/viz",
+                  "d3-format",
+                  "d3-path",
+                ],
+                e
+              )
+            : e((t["d3-graphviz"] = {}), t.d3, t.d3, t.d3, t.d3, t.d3, t.d3, t.Viz, t.d3, t.d3);
+      })(this, function (t, e, n, r, i, a, o, s, l, h) {
+        "use strict";
+        function c(t) {
+          var e = {},
+            n = t.node().nodeName;
+          (e.tag = n),
+            "#text" == n ? (e.text = t.text()) : "#comment" == n && (e.comment = t.text()),
+            (e.attributes = {});
+          var r = t.node().attributes;
+          if (r)
+            for (var i = 0; i < r.length; i++) {
+              var a = r[i],
+                o = a.name,
+                s = a.value;
+              e.attributes[o] = s;
+            }
+          var l = t.node().transform;
+          if (l && 0 != l.baseVal.numberOfItems) {
+            var h = l.baseVal.consolidate().matrix;
+            (e.translation = { x: h.e, y: h.f }), (e.scale = h.a);
+          }
+          if (("ellipse" == n && (e.center = { x: e.attributes.cx, y: e.attributes.cy }), "polygon" == n)) {
+            var c = (g = t.attr("points").split(" ")).map(function (t) {
+                return t.split(",")[0];
+              }),
+              u = g.map(function (t) {
+                return t.split(",")[1];
+              }),
+              d = Math.min.apply(null, c),
+              f = Math.max.apply(null, c),
+              p = { x: d, y: (v = Math.min.apply(null, u)), width: f - d, height: (y = Math.max.apply(null, u)) - v };
+            (e.bbox = p), (e.center = { x: (d + f) / 2, y: (v + y) / 2 });
+          }
+          if ("path" == n) {
+            var g;
+            (g = t.attr("d").split(/[A-Z ]/)).shift();
+            var v, y;
+            (c = g.map(function (t) {
+              return +t.split(",")[0];
+            })),
+              (u = g.map(function (t) {
+                return +t.split(",")[1];
+              })),
+              (d = Math.min.apply(null, c)),
+              (f = Math.max.apply(null, c)),
+              (p = { x: d, y: (v = Math.min.apply(null, u)), width: f - d, height: (y = Math.max.apply(null, u)) - v });
+            (e.bbox = p), (e.center = { x: (d + f) / 2, y: (v + y) / 2 }), (e.totalLength = t.node().getTotalLength());
+          }
+          return (
+            "text" == n && (e.center = { x: t.attr("x"), y: t.attr("y") }),
+            "#text" == n ? (e.text = t.text()) : "#comment" == n && (e.comment = t.text()),
+            e
+          );
+        }
+        function u(t) {
+          var n = c(t);
+          return (
+            (n.children = []),
+            e.selectAll(t.node().childNodes).each(function () {
+              var t = u(e.select(this));
+              (t.parent = n), n.children.push(t);
+            }),
+            n
+          );
+        }
+        function d(t) {
+          return "#text" == t.tag
+            ? document.createTextNode("")
+            : "#comment" == t.tag
+              ? document.createComment(t.comment)
+              : document.createElementNS("http://www.w3.org/2000/svg", t.tag);
+        }
+        function f(t) {
+          var n = d(t),
+            r = e.select(n),
+            i = t.attributes,
+            a = !0,
+            o = !1,
+            s = void 0;
+          try {
+            for (var l, h = Object.keys(i)[Symbol.iterator](); !(a = (l = h.next()).done); a = !0) {
+              var c = l.value,
+                u = i[c];
+              r.attr(c, u);
+            }
+          } catch (t) {
+            (o = !0), (s = t);
+          } finally {
+            try {
+              !a && h.return && h.return();
+            } finally {
+              if (o) throw s;
+            }
+          }
+          return n;
+        }
+        function p(t, n) {
+          var r = e.select(t.node().parentNode),
+            i = f(n),
+            a = r.insert(
+              function () {
+                return i;
+              },
+              function () {
+                return t.node();
+              }
+            );
+          return t.remove(), a;
+        }
+        function g(t, n) {
+          !(function (t, e) {
+            t.datum(e),
+              t.data([e], function (t) {
+                return t.key;
+              });
+          })(t, n),
+            e.selectAll(t.node().childNodes).each(function (t, r) {
+              g(e.select(this), n.children[r]);
+            });
+        }
+        function v(t) {
+          var n = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : 0,
+            r = e.select(this),
+            i = (t.tag, t.attributes),
+            a = r.node().attributes;
+          if (a)
+            for (var o = 0; o < a.length; o++) {
+              var s = a[o],
+                l = s.name;
+              if ("xmlns" != l.split(":")[0] && s.namespaceURI) {
+                var h = s.namespaceURI.split("/");
+                l = h[h.length - 1] + ":" + l;
+              }
+              l in i || (i[l] = null);
+            }
+          var c = !0,
+            u = !1,
+            f = void 0;
+          try {
+            for (var p, g = Object.keys(i)[Symbol.iterator](); !(c = (p = g.next()).done); c = !0) {
+              var y = p.value;
+              r.attr(y, i[y]);
+            }
+          } catch (t) {
+            (u = !0), (f = t);
+          } finally {
+            try {
+              !c && g.return && g.return();
+            } finally {
+              if (u) throw f;
+            }
+          }
+          t.text && r.text(t.text),
+            (function (t, e) {
+              var n = t.selectAll(function () {
+                  return t.node().childNodes;
+                }),
+                r = (n = n.data(
+                  function (t) {
+                    return t.children;
+                  },
+                  function (t) {
+                    return t.tag + "-" + e;
+                  }
+                ))
+                  .enter()
+                  .append(function (t) {
+                    return d(t);
+                  }),
+                i = n.exit();
+              i = i.remove();
+              var a = {};
+              (n = r.merge(n)).each(function (t) {
+                var e = t.tag;
+                null == a[e] && (a[e] = 0);
+                var n = a[e]++;
+                v.call(this, t, n);
+              });
+            })(r, n);
+        }
+        function y(t) {
+          return Object.assign({}, t);
+        }
+        function m(t) {
+          return Math.round(1e4 * t) / 1e4;
+        }
+        s = s && s.hasOwnProperty("default") ? s.default : s;
+        function _() {
+          var t = this._selection,
+            n = e.select(t.node().querySelector("svg"));
+          if (0 == n.size()) return this;
+          this._zoomSelection = n;
+          var r = o
+            .zoom()
+            .scaleExtent(this._options.zoomScaleExtent)
+            .translateExtent(this._options.zoomTranslateExtent)
+            .interpolate(a.interpolate)
+            .on("zoom", function () {
+              e.select(n.node().querySelector("g")).attr("transform", e.event.transform);
+            });
+          this._zoomBehavior = r;
+          var i = e.select(n.node().querySelector("g"));
+          return (
+            n.call(r), this._active || x.call(this, i), (this._originalTransform = o.zoomTransform(n.node())), this
+          );
+        }
+        function w(t) {
+          var e = this._translation,
+            n = this._scale,
+            r = t.datum().translation,
+            i = t.datum().scale,
+            a = o.zoomTransform(this._zoomSelection.node());
+          return e && (a = (a = a.scale(1 / n)).translate(-e.x, -e.y)), (a = (a = a.translate(r.x, r.y)).scale(i));
+        }
+        function x(t) {
+          this._zoomBehavior.transform(this._zoomSelection, w.call(this, t)),
+            (this._translation = t.datum().translation),
+            (this._scale = t.datum().scale),
+            (this._originalTransform = o.zoomIdentity
+              .translate(t.datum().translation.x, t.datum().translation.y)
+              .scale(t.datum().scale));
+        }
+        function b(t, e) {
+          return function () {
+            var n = t.map(function (t) {
+              return a.interpolate([t[0][0], t[0][1]], [t[1][0], t[1][1]]);
+            });
+            return function (t) {
+              return t < 1
+                ? "M" +
+                    n
+                      .map(function (e) {
+                        return e(t);
+                      })
+                      .join("L")
+                : e;
+            };
+          };
+        }
+        function E(t) {
+          return (
+            "edge" == t.attributes.class ||
+            ("a" == t.tag && "g" == t.parent.tag && "edge" == t.parent.parent.attributes.class)
+          );
+        }
+        function P(t) {
+          return t.parent && E(t.parent);
+        }
+        function z(t) {
+          var n = this._transition,
+            r = this._options.fade && null != n,
+            i = this._options.tweenPaths,
+            s = this._options.tweenShapes,
+            l = this._options.convertEqualSidedPolygons,
+            h = this._options.growEnteringEdges && null != n,
+            u = this._attributer,
+            f = this;
+          function g(t) {
+            var v = e.select(this);
+            if ("svg" == t.tag) {
+              var y = f._options;
+              if (null != y.width || null != y.height) {
+                var m = y.width,
+                  _ = y.height;
+                null == m
+                  ? (m = (4 * t.attributes.width.replace("pt", "")) / 3)
+                  : (v.attr("width", m), (t.attributes.width = m)),
+                  null == _
+                    ? (_ = (4 * t.attributes.height.replace("pt", "")) / 3)
+                    : (v.attr("height", _), (t.attributes.height = _)),
+                  y.fit ||
+                    (v.attr("viewBox", "0 0 " + (3 * m) / 4 / y.scale + " " + (3 * _) / 4 / y.scale),
+                    (t.attributes.viewBox = "0 0 " + (3 * m) / 4 / y.scale + " " + (3 * _) / 4 / y.scale));
+              }
+              1 != y.scale &&
+                (y.fit || (null == y.width && null == y.height)) &&
+                ((m = t.attributes.viewBox.split(" ")[2]),
+                (_ = t.attributes.viewBox.split(" ")[3]),
+                v.attr("viewBox", "0 0 " + m / y.scale + " " + _ / y.scale),
+                (t.attributes.viewBox = "0 0 " + m / y.scale + " " + _ / y.scale));
+            }
+            u && v.each(u);
+            var z = t.tag,
+              N = t.attributes,
+              k = v.node().attributes;
+            if (k)
+              for (var S = 0; S < k.length; S++) {
+                var D = k[S],
+                  M = D.name;
+                if ("xmlns" != M.split(":")[0] && D.namespaceURI) {
+                  var W = D.namespaceURI.split("/");
+                  M = W[W.length - 1] + ":" + M;
+                }
+                M in N || (N[M] = null);
+              }
+            var j = !1,
+              O = !1;
+            if (s && n) {
+              if (
+                (("polygon" != this.nodeName && "ellipse" != this.nodeName) || !t.alternativeOld || (O = !0),
+                ("polygon" != z && "ellipse" != z) || !t.alternativeNew || (j = !0),
+                "polygon" == this.nodeName && "polygon" == z)
+              ) {
+                var L = c(v).attributes.points;
+                if (!l) {
+                  var q = L.split(" ").length;
+                  (et = t.attributes.points).split(" ").length == q && ((j = !1), (O = !1));
+                }
+              }
+              if (O) {
+                var A = t.alternativeOld,
+                  T = p(v, A);
+                T.data([t], function () {
+                  return t.key;
+                }),
+                  (v = T);
+              }
+              if (j) (z = "path"), (N = t.alternativeNew.attributes);
+            }
+            var B = v;
+            if (
+              (n &&
+                ((B = B.transition(n)),
+                r &&
+                  B.filter(function (t) {
+                    return "#" == t.tag[0] ? null : this;
+                  }).style("opacity", 1),
+                B.filter(function (t) {
+                  return "#" == t.tag[0] ? null : this;
+                }).on("end", function () {
+                  e.select(this).attr("style", null);
+                })),
+              h && "path" == z && t.offset)
+            ) {
+              var I = t.totalLength;
+              v
+                .attr("stroke-dasharray", I + " " + I)
+                .attr("stroke-dashoffset", I)
+                .attr("transform", "translate(" + t.offset.x + "," + t.offset.y + ")"),
+                (N["stroke-dashoffset"] = 0),
+                (N.transform = "translate(0,0)"),
+                B.attr("stroke-dashoffset", N["stroke-dashoffset"])
+                  .attr("transform", N.transform)
+                  .on("start", function () {
+                    e.select(this).style("opacity", null);
+                  })
+                  .on("end", function () {
+                    e.select(this)
+                      .attr("stroke-dashoffset", null)
+                      .attr("stroke-dasharray", null)
+                      .attr("transform", null);
+                  });
+            }
+            if (h && "polygon" == z && P(t) && t.offset) {
+              var R = e.select(v.node().parentNode.querySelector("path")),
+                U = R.node().getPointAtLength(0),
+                F = R.node().getPointAtLength(t.totalLength),
+                V = R.node().getPointAtLength(t.totalLength - 1),
+                Z = (180 * Math.atan2(F.y - V.y, F.x - V.x)) / Math.PI,
+                C = U.x - F.x + t.offset.x,
+                $ = U.y - F.y + t.offset.y;
+              v.attr("transform", "translate(" + C + "," + $ + ")"),
+                B.attrTween("transform", function () {
+                  return function (e) {
+                    var n = R.node().getPointAtLength(t.totalLength * e),
+                      r = R.node().getPointAtLength(t.totalLength * e + 1),
+                      i = (180 * Math.atan2(r.y - n.y, r.x - n.x)) / Math.PI - Z;
+                    return (
+                      (C = n.x - F.x + t.offset.x * (1 - e)),
+                      ($ = n.y - F.y + t.offset.y * (1 - e)),
+                      "translate(" + C + "," + $ + ") rotate(" + i + " " + F.x + " " + F.y + ")"
+                    );
+                  };
+                })
+                  .on("start", function () {
+                    e.select(this).style("opacity", null);
+                  })
+                  .on("end", function () {
+                    e.select(this).attr("transform", null);
+                  });
+            }
+            var G = i && n && "path" == z && null != v.attr("d"),
+              H = !0,
+              J = !1,
+              K = void 0;
+            try {
+              for (var Q, X = Object.keys(N)[Symbol.iterator](); !(H = (Q = X.next()).done); H = !0) {
+                var Y = Q.value,
+                  tt = N[Y];
+                if (G && "d" == Y) {
+                  var et;
+                  (et = (t.alternativeOld || t).points) && B.attrTween("d", b(et, tt));
+                } else {
+                  if ("transform" == Y && t.translation)
+                    if (n) {
+                      var nt = B.on("end");
+                      B.on("start", function () {
+                        f._zoomBehavior &&
+                          B.tween("attr.transform", function () {
+                            var t = this;
+                            return function (e) {
+                              t.setAttribute(
+                                "transform",
+                                a.interpolateTransformSvg(
+                                  o.zoomTransform(f._zoomSelection.node()).toString(),
+                                  w.call(f, v).toString()
+                                )(e)
+                              );
+                            };
+                          });
+                      }).on("end", function () {
+                        nt.call(this), f._zoomBehavior && x.call(f, v);
+                      });
+                    } else f._zoomBehavior && (tt = w.call(f, v).toString());
+                  B.attr(Y, tt);
+                }
+              }
+            } catch (t) {
+              (J = !0), (K = t);
+            } finally {
+              try {
+                !H && X.return && X.return();
+              } finally {
+                if (J) throw K;
+              }
+            }
+            j &&
+              B.on("end", function (t, n, r) {
+                p((T = e.select(this)), t).data([t], function () {
+                  return t.key;
+                });
+              }),
+              t.text && B.text(t.text),
+              (function (t) {
+                var i = t.selectAll(function () {
+                    return t.node().childNodes;
+                  }),
+                  a = (i = i.data(
+                    function (t) {
+                      return t.children;
+                    },
+                    function (t) {
+                      return t.key;
+                    }
+                  ))
+                    .enter()
+                    .append(function (t) {
+                      var e = d(t);
+                      return "#text" == t.tag && r && (e.nodeValue = t.text), e;
+                    });
+                (r || (h && E(t.datum()))) &&
+                  a
+                    .filter(function (t) {
+                      return "#" == t.tag[0] ? null : this;
+                    })
+                    .each(function (t) {
+                      var n = e.select(this),
+                        r = !0,
+                        i = !1,
+                        a = void 0;
+                      try {
+                        for (
+                          var o, s = Object.keys(t.attributes)[Symbol.iterator]();
+                          !(r = (o = s.next()).done);
+                          r = !0
+                        ) {
+                          var l = o.value,
+                            h = t.attributes[l];
+                          n.attr(l, h);
+                        }
+                      } catch (t) {
+                        (i = !0), (a = t);
+                      } finally {
+                        try {
+                          !r && s.return && s.return();
+                        } finally {
+                          if (i) throw a;
+                        }
+                      }
+                    })
+                    .filter(function (t) {
+                      return "svg" == t.tag || "g" == t.tag ? null : this;
+                    })
+                    .style("opacity", 0);
+                var o = i.exit();
+                u && o.each(u),
+                  n &&
+                    ((o = o.transition(n)),
+                    r &&
+                      o
+                        .filter(function (t) {
+                          return "#" == t.tag[0] ? null : this;
+                        })
+                        .style("opacity", 0)),
+                  (o = o.remove()),
+                  (i = a.merge(i)).each(g);
+              })(v);
+          }
+          var v = this._selection;
+          if (null != n) {
+            var y = this._jobs;
+            if (f._active) return y.push(null), this;
+            v
+              .transition(n)
+              .transition()
+              .duration(0)
+              .on("end", function () {
+                (f._active = !1), 0 != y.length && (y.shift(), f.render());
+              }),
+              (this._active = !0);
+          }
+          null != n &&
+            v
+              .transition(n)
+              .on("start", function () {
+                f._dispatch.call("transitionStart", f);
+              })
+              .on("end", function () {
+                f._dispatch.call("transitionEnd", f);
+              })
+              .transition()
+              .duration(0)
+              .on("start", function () {
+                f._dispatch.call("restoreEnd", f), f._dispatch.call("end", f), t && t.call(f);
+              });
+          var m = this._data,
+            z = v.selectAll("svg").data([m], function (t) {
+              return t.key;
+            });
+          return (
+            (z = z.enter().append("svg").merge(z)),
+            g.call(z.node(), m),
+            this._options.zoom && !this._zoomBehavior && _.call(this),
+            f._dispatch.call("renderEnd", f),
+            null == n && (this._dispatch.call("end", this), t && t.call(this)),
+            this
+          );
+        }
+        function N(t, e) {
+          if ("polygon" == t.tag) {
+            (u = y(t)).tag = "path";
+            var n = y((d = t.attributes)),
+              r = d.points;
+            if ("polygon" == e.tag) {
+              ((m = t.bbox).cx = m.x + m.width / 2), (m.cy = m.y + m.height / 2);
+              for (
+                var i = d.points.split(" "),
+                  a = i.map(function (t) {
+                    var e = t.split(",");
+                    return [e[0] - m.cx, e[1] - m.cy];
+                  }),
+                  o = a[a.length - 1][0],
+                  s = a[a.length - 1][1],
+                  l = 0;
+                l < a.length;
+                l++, o = N, s = k
+              ) {
+                var h = (N = a[l][0]) - o;
+                if (0 != (b = (k = a[l][1]) - s))
+                  if (0 <= (S = o - (s * h) / b) && S < 1 / 0 && ((o <= S && S <= N) || (N <= S && S <= o))) break;
+              }
+              var c = [[m.cx + S, m.cy + 0].join(",")];
+              r = (c = (c = c.concat(i.slice(l))).concat(i.slice(0, l))).join(" ");
+            }
+            (n.d = "M" + r + "z"), delete n.points, (u.attributes = n);
+          } else {
+            var u;
+            (u = y(t)).tag = "path";
+            n = y((d = t.attributes));
+            var d,
+              f = d.cx,
+              p = d.cy,
+              g = d.rx,
+              v = d.ry;
+            if ("polygon" == e.tag) {
+              var m;
+              ((m = e.bbox).cx = m.x + m.width / 2), (m.cy = m.y + m.height / 2);
+              var _ = e.attributes.points.split(" ")[0].split(","),
+                w = _[0],
+                x = _[1],
+                b = ((h = w - m.cx), x - m.cy),
+                E = Math.sqrt(Math.pow(h, 2) + Math.pow(b, 2)),
+                P = h / E,
+                z = -b / E;
+            } else (P = 1), (z = 0);
+            var N, k, S;
+            (h = (S = g * -P) - (N = g * P)), (b = -v * -z - (k = -v * z));
+            (n.d =
+              "M " +
+              f +
+              " " +
+              p +
+              " m " +
+              N +
+              "," +
+              k +
+              " a " +
+              g +
+              "," +
+              v +
+              " 0 1,0 " +
+              h +
+              "," +
+              b +
+              " a " +
+              g +
+              "," +
+              v +
+              " 0 1,0 " +
+              -h +
+              "," +
+              -b +
+              "z"),
+              delete n.cx,
+              delete n.cy,
+              delete n.rx,
+              delete n.ry,
+              (u.attributes = n);
+          }
+          return u;
+        }
+        var k,
+          S = function (t, e, n) {
+            return (
+              e in t
+                ? Object.defineProperty(t, e, { value: n, enumerable: !0, configurable: !0, writable: !0 })
+                : (t[e] = n),
+              t
+            );
+          },
+          D = function (t) {
+            if (Array.isArray(t)) {
+              for (var e = 0, n = Array(t.length); e < t.length; e++) n[e] = t[e];
+              return n;
+            }
+            return Array.from(t);
+          };
+        function M(t, e, n, r) {
+          var i = [t * n - (e = -e) * (r = -r), t * r + e * n];
+          return [(t = i[0]), (e = -(e = i[1]))];
+        }
+        function W(t, e, n, r, i, a, o) {
+          var s = u(q(a));
+          t.data([s]), v.call(t.node(), s), j(t, e, n, r, i, a, o);
+        }
+        function j(t, e, n, r, i, a, o) {
+          var s = o.shortening || 0,
+            l = [
+              [0, -3.5],
+              [10, 0],
+              [0, 3.5],
+              [0, -3.5],
+            ],
+            c = r - e,
+            u = i - n,
+            d = Math.sqrt(c * c + u * u);
+          if (0 == d)
+            var f = 1,
+              p = 0;
+          else (f = c / d), (p = u / d);
+          if (((r = e + (d - s - 10 - 0.174) * f), (i = n + (d - s - 10 - 0.174) * p), a.URL || a.tooltip))
+            var g = t.selectWithoutDataPropagation("g").selectWithoutDataPropagation("a"),
+              v = g.selectWithoutDataPropagation("path"),
+              y = g.selectWithoutDataPropagation("polygon");
+          else (v = t.selectWithoutDataPropagation("path")), (y = t.selectWithoutDataPropagation("polygon"));
+          var m = h.path();
+          m.moveTo(e, n), m.lineTo(r, i), v.attr("d", m), (r = e + (d - s - 10) * f), (i = n + (d - s - 10) * p);
+          for (var _ = 0; _ < l.length; _++) {
+            var w = l[_];
+            l[_] = M(w[0], w[1], f, p);
+          }
+          for (_ = 0; _ < l.length; _++) {
+            w = l[_];
+            l[_] = [r + w[0], i + w[1]];
+          }
+          var x = [];
+          for (_ = 0; _ < l.length; _++) {
+            w = l[_];
+            x.push(w.join(","));
+          }
+          var b = x.join(" ");
+          return y.attr("points", b), this;
+        }
+        function O() {
+          return this._drawnEdge ? (this._drawnEdge.g.remove(), (this._drawnEdge = null), this) : this;
+        }
+        function L() {
+          return this._drawnEdge ? this._drawnEdge.g : e.select(null);
+        }
+        function q(t) {
+          var n = "",
+            r = !0,
+            i = !1,
+            a = void 0;
+          try {
+            for (var o, l = Object.keys(t)[Symbol.iterator](); !(r = (o = l.next()).done); r = !0) {
+              var h = o.value;
+              null != t[h] && (n += ' "' + h + '"="' + t[h] + '"');
+            }
+          } catch (t) {
+            (i = !0), (a = t);
+          } finally {
+            try {
+              !r && l.return && l.return();
+            } finally {
+              if (i) throw a;
+            }
+          }
+          var c = s("digraph {a -> b [" + n + "]}", { format: "svg" }),
+            u = new window.DOMParser().parseFromString(c, "image/svg+xml");
+          return e
+            .select(document.createDocumentFragment())
+            .append(function () {
+              return u.documentElement;
+            })
+            .select(".edge");
+        }
+        function A(t, e, n, r, i, a) {
+          var o = u(R(r, i));
+          return t.data([o]), v.call(t.node(), o), T(t, e, n, i, a), this;
+        }
+        function T(t, n, r, i, a) {
+          if (i.URL || i.tooltip) var o = t.selectWithoutDataPropagation("g").selectWithoutDataPropagation("a");
+          else o = t;
+          var s = o.selectAll("ellipse,polygon,path,polyline"),
+            l = t.selectWithoutDataPropagation("text");
+          if (0 != s.size()) {
+            var h = s.node().getBBox();
+            (h.cx = h.x + h.width / 2), (h.cy = h.y + h.height / 2);
+          } else
+            0 != l.size() &&
+              (h = { x: +l.attr("x"), y: +l.attr("y"), width: 0, height: 0, cx: +l.attr("x"), cy: +l.attr("y") });
+          return (
+            s.each(function (t, i) {
+              var a = e.select(this);
+              if (a.attr("cx")) a.attr("cx", m(n)).attr("cy", m(r));
+              else if (a.attr("points")) {
+                var o = a.attr("points").trim();
+                a.attr(
+                  "points",
+                  (function (t, e, n) {
+                    var r;
+                    return (
+                      (r = t.split(" ")).map(function (t) {
+                        return t.split(",");
+                      }),
+                      (t = (t = (r = r
+                        .map(function (t) {
+                          return [m(+e + +t.split(",")[0]), m(+n + +t.split(",")[1])];
+                        })
+                        .map(function (t) {
+                          return t.join(",");
+                        })).join(" "))
+                        .replace(/-0\./g, "-.")
+                        .replace(/ 0\./g, " ."))
+                    );
+                  })(o, n - h.cx, r - h.cy)
+                );
+              } else {
+                var s = a.attr("d");
+                a.attr(
+                  "d",
+                  (function (t, e, n) {
+                    (i = t.split(/[A-Z ]/)).shift();
+                    var r = t.split(/[^[A-Z ]+/),
+                      i =
+                        (i.map(function (t) {
+                          return t.split(",");
+                        }),
+                        i
+                          .map(function (t) {
+                            return [m(+e + +t.split(",")[0]), m(+n + +t.split(",")[1])];
+                          })
+                          .map(function (t) {
+                            return t.join(",");
+                          }));
+                    return (t = (t = r
+                      .reduce(function (t, e, n) {
+                        return t.concat(e, i[n]);
+                      }, [])
+                      .join(""))
+                      .replace(/-0\./g, "-.")
+                      .replace(/ 0\./g, " ."));
+                  })(s, n - h.cx, r - h.cy)
+                );
+              }
+            }),
+            0 != l.size() && l.attr("x", m(+l.attr("x") + n - h.cx)).attr("y", m(+l.attr("y") + r - h.cy)),
+            this
+          );
+        }
+        function B() {
+          if (!this._drawnNode) return this;
+          var t = this._drawnNode.g;
+          return t.empty() || t.remove(), (this._drawnNode = null), this;
+        }
+        function I() {
+          return this._drawnNode ? this._drawnNode.g : e.select(null);
+        }
+        function R(t, n) {
+          var r = "",
+            i = !0,
+            a = !1,
+            o = void 0;
+          try {
+            for (var l, h = Object.keys(n)[Symbol.iterator](); !(i = (l = h.next()).done); i = !0) {
+              var c = l.value;
+              null != n[c] && (r += ' "' + c + '"="' + n[c] + '"');
+            }
+          } catch (t) {
+            (a = !0), (o = t);
+          } finally {
+            try {
+              !i && h.return && h.return();
+            } finally {
+              if (a) throw o;
+            }
+          }
+          var u = s('graph {"' + t + '" [' + r + "]}", { format: "svg" }),
+            d = new window.DOMParser().parseFromString(u, "image/svg+xml");
+          return e
+            .select(document.createDocumentFragment())
+            .append(function () {
+              return d.documentElement;
+            })
+            .select(".node");
+        }
+        function U(t, r) {
+          if (
+            ((this._options = {
+              useWorker: !0,
+              engine: "dot",
+              totalMemory: void 0,
+              keyMode: "title",
+              fade: !0,
+              tweenPaths: !0,
+              tweenShapes: !0,
+              convertEqualSidedPolygons: !0,
+              tweenPrecision: 1,
+              growEnteringEdges: !0,
+              zoom: !0,
+              zoomScaleExtent: [0.1, 10],
+              zoomTranslateExtent: [
+                [-1 / 0, -1 / 0],
+                [1 / 0, 1 / 0],
+              ],
+              width: null,
+              height: null,
+              scale: 1,
+              fit: !1,
+            }),
+            r instanceof Object)
+          ) {
+            var i = !0,
+              a = !1,
+              o = void 0;
+            try {
+              for (var l, h = Object.keys(r)[Symbol.iterator](); !(i = (l = h.next()).done); i = !0) {
+                var c = l.value;
+                this._options[c] = r[c];
+              }
+            } catch (t) {
+              (a = !0), (o = t);
+            } finally {
+              try {
+                !i && h.return && h.return();
+              } finally {
+                if (a) throw o;
+              }
+            }
+          } else "boolean" == typeof r && (this._options.useWorker = r);
+          var u = this._options.useWorker;
+          if (("undefined" == typeof Worker && (u = !1), u)) {
+            var d = e.selectAll("script").filter(function () {
+              return (
+                "javascript/worker" == e.select(this).attr("type") ||
+                (e.select(this).attr("src") &&
+                  e
+                    .select(this)
+                    .attr("src")
+                    .match(/.*\/viz.js$/))
+              );
+            });
+            0 == d.size()
+              ? (console.warn(
+                  'No script tag of type "javascript/worker" was found and "useWorker" is true. Not using web worker.'
+                ),
+                (u = !1))
+              : ((this._vizURL = d.attr("src")),
+                this._vizURL ||
+                  (console.warn(
+                    'No "src" attribute of was found on the "javascript/worker" script tag and "useWorker" is true. Not using web worker.'
+                  ),
+                  (u = !1)));
+          }
+          if (u) {
+            var f = new Blob([
+                '\n            onmessage = function(event) {\n                if (event.data.vizURL) {\n                    importScripts(event.data.vizURL);\n                }\n                try {\n                    var svg = Viz(event.data.dot, event.data.options);\n                }\n                catch(error) {\n                    postMessage({\n                        type: "error",\n                        error: error.message,\n                    });\n                    return;\n                }\n                if (svg) {\n                    postMessage({\n                        type: "done",\n                        svg: svg,\n                    });\n                } else {\n                    postMessage({\n                        type: "skip",\n                    });\n                }\n            }\n        ',
+              ]),
+              p = window.URL.createObjectURL(f);
+            this._worker = new Worker(p);
+          }
+          (this._selection = t),
+            (this._active = !1),
+            (this._busy = !1),
+            (this._jobs = []),
+            (this._queue = []),
+            (this._keyModes = new Set(["title", "id", "tag-index", "index"])),
+            (this._images = []),
+            (this._translation = void 0),
+            (this._scale = void 0),
+            (this._eventTypes = [
+              "initEnd",
+              "start",
+              "layoutStart",
+              "layoutEnd",
+              "dataExtractEnd",
+              "dataProcessPass1End",
+              "dataProcessPass2End",
+              "dataProcessEnd",
+              "renderStart",
+              "renderEnd",
+              "transitionStart",
+              "transitionEnd",
+              "restoreEnd",
+              "end",
+            ]),
+            (this._dispatch = n.dispatch.apply(void 0, D(this._eventTypes))),
+            function () {
+              if (null == this._worker) s(""), this._dispatch.call("initEnd", this);
+              else {
+                var t = this._vizURL,
+                  e = this;
+                (this._worker.onmessage = function (t) {
+                  e._dispatch.call("initEnd", this);
+                }),
+                  t.match(/^https?:\/\/|^\/\//i) || (t = new window.URL(t, document.location.href).href),
+                  this._worker.postMessage({ dot: "", vizURL: t });
+              }
+            }.call(this),
+            (t.node().__graphviz__ = this);
+        }
+        function F(t, n) {
+          return e.select(t).graphviz(n);
+        }
+        U.prototype = F.prototype =
+          (S(
+            (k = {
+              constructor: U,
+              engine: function (t) {
+                return (this._options.engine = t), this;
+              },
+              addImage: function (t, e, n) {
+                return this._images.push({ path: t, width: e, height: n }), this;
+              },
+              totalMemory: function (t) {
+                return (this._options.totalMemory = t), this;
+              },
+              keyMode: function (t) {
+                if (!this._keyModes.has(t)) throw Error("Illegal keyMode: " + t);
+                if (t != this._options.keyMode && null != this._data) throw Error("Too late to change keyMode");
+                return (this._options.keyMode = t), this;
+              },
+              fade: function (t) {
+                return (this._options.fade = t), this;
+              },
+              tweenPaths: function (t) {
+                return (this._options.tweenPaths = t), this;
+              },
+              tweenShapes: function (t) {
+                return (this._options.tweenShapes = t), t && (this._options.tweenPaths = !0), this;
+              },
+              convertEqualSidedPolygons: function (t) {
+                return (this._options.convertEqualSidedPolygons = t), this;
+              },
+              tweenPrecision: function (t) {
+                return (this._options.tweenPrecision = t), this;
+              },
+              growEnteringEdges: function (t) {
+                return (this._options.growEnteringEdges = t), this;
+              },
+              zoom: function (t) {
+                return (this._options.zoom = t), this._options.zoom && !this._zoomBehavior && _.call(this), this;
+              },
+              resetZoom: function (t) {
+                var e = this._zoomSelection;
+                return t && (e = e.transition(t)), e.call(this._zoomBehavior.transform, this._originalTransform), this;
+              },
+              zoomBehavior: function () {
+                return this._zoomBehavior || null;
+              },
+              zoomSelection: function () {
+                return this._zoomSelection || null;
+              },
+              zoomScaleExtent: function (t) {
+                return (this._options.zoomScaleExtent = t), this;
+              },
+              zoomTranslateExtent: function (t) {
+                return (this._options.zoomTranslateExtent = t), this;
+              },
+              render: function (t) {
+                return this._busy
+                  ? (this._queue.push(this.render.bind(this, t)), this)
+                  : (this._dispatch.call("renderStart", this),
+                    this._transitionFactory
+                      ? i.timeout(
+                          function () {
+                            (this._transition = r.transition(this._transitionFactory())), z.call(this, t);
+                          }.bind(this),
+                          0
+                        )
+                      : z.call(this, t),
+                    this);
+              },
+              dot: function (t, n) {
+                var r = this,
+                  i = this._worker,
+                  a = this._options.engine,
+                  o = this._images,
+                  l = this._options.totalMemory,
+                  h = this._options.keyMode,
+                  c = this._options.tweenPaths,
+                  d = this._options.tweenShapes;
+                if ("string" == typeof this._options.tweenPrecision && this._options.tweenPrecision.includes("%"))
+                  var p = +this._options.tweenPrecision.split("%")[0] / 100,
+                    g = this._options.tweenPrecision.includes("%");
+                else (p = this._options.tweenPrecision), (g = !1);
+                var v = this._options.growEnteringEdges,
+                  y = {},
+                  m = this._dictionary || {},
+                  _ = {},
+                  w = this._nodeDictionary || {};
+                function x(t, e) {
+                  if (c && e && ("path" == e.tag || (t.alternativeOld && "path" == t.alternativeOld.tag))) {
+                    var n = (t.alternativeNew || t).attributes.d;
+                    if (t.alternativeOld) var r = f(t.alternativeOld);
+                    else r = f(e);
+                    (t.alternativeOld || (t.alternativeOld = {})).points = (function (t, e, n, r) {
+                      for (
+                        var i = t,
+                          a = i.cloneNode(),
+                          o = i.getTotalLength(),
+                          s = (a.setAttribute("d", e), a).getTotalLength(),
+                          l = [0],
+                          h = 0,
+                          c = r ? n : n / Math.max(o, s);
+                        (h += c) < 1;
+
+                      )
+                        l.push(h);
+                      return (
+                        l.push(1),
+                        l.map(function (t) {
+                          var e = i.getPointAtLength(t * o),
+                            n = a.getPointAtLength(t * s);
+                          return [
+                            [e.x, e.y],
+                            [n.x, n.y],
+                          ];
+                        })
+                      );
+                    })(r, n, p, g);
+                  }
+                }
+                function b(t) {
+                  var e = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : 0,
+                    n = arguments[2];
+                  !(function (t, e) {
+                    var n = t.tag;
+                    if ("index" == h) t.key = e;
+                    else if ("#" != n[0])
+                      if ("id" == h) t.key = t.attributes.id;
+                      else if ("title" == h) {
+                        var r = t.children.find(function (t) {
+                          return "title" == t.tag;
+                        });
+                        r && (r.children.length > 0 ? (t.key = r.children[0].text) : (t.key = ""));
+                      }
+                    null == t.key && (d && (("ellipse" != n && "polygon" != n) || (n = "path")), (t.key = n + "-" + e));
+                  })(t, e),
+                    (function (t, e) {
+                      var n = (e ? e.id + "." : "") + t.key;
+                      t.id = n;
+                    })(t, n);
+                  var r = t.id,
+                    i = m[r];
+                  !(function (t) {
+                    y[t.id] = t;
+                  })(t),
+                    (function (t, e) {
+                      d &&
+                        t.id in m &&
+                        (("polygon" != e.tag && "ellipse" != e.tag && "path" != e.tag) ||
+                          (e.tag == t.tag && "polygon" != t.tag) ||
+                          ("path" != e.tag && (t.alternativeOld = N(e, t)),
+                          "path" != t.tag && (t.alternativeNew = N(t, e))));
+                    })(t, i),
+                    x(t, i);
+                  var a = {};
+                  t.children.forEach(function (e) {
+                    var n = e.tag;
+                    ("ellipse" != n && "polygon" != n) || (n = "path"), null == a[n] && (a[n] = 0), b(e, a[n]++, t);
+                  });
+                }
+                function E(t) {
+                  !(function (t) {
+                    var e = t.tag;
+                    if (v && t.parent && "node" == t.parent.attributes.class && "title" == e) {
+                      if (t.children.length > 0) var n = t.children[0].text;
+                      else n = "";
+                      _[n] = t.parent;
+                    }
+                  })(t),
+                    (function (t) {
+                      var e = t.id,
+                        n = t.tag,
+                        r = m[e];
+                      if (v && !r && t.parent && P(t) && ("path" == n || "polygon" == n)) {
+                        if ("polygon" == n) {
+                          var i = t.parent.children.find(function (t) {
+                            return "path" == t.tag;
+                          });
+                          t.totalLength = i.totalLength;
+                        }
+                        var a = (function (t) {
+                            return (function (t) {
+                              return "edge" == t.parent.attributes.class ? t.parent : t.parent.parent.parent;
+                            })(t).children.find(function (t) {
+                              return "title" == t.tag;
+                            });
+                          })(t).children[0],
+                          o = a.text.split("->");
+                        2 != o.length && (o = a.text.split("--"));
+                        var s = o[0],
+                          l = _[s],
+                          h = w[s];
+                        if (h) {
+                          if (
+                            (d = l.children.findIndex(function (t, e) {
+                              return "g" == t.tag;
+                            })) >= 0
+                          ) {
+                            var c = l.children[d].children.findIndex(function (t, e) {
+                              return "a" == t.tag;
+                            });
+                            l = l.children[d].children[c];
+                          }
+                          (d = h.children.findIndex(function (t, e) {
+                            return "g" == t.tag;
+                          })) >= 0 &&
+                            ((c = h.children[d].children.findIndex(function (t, e) {
+                              return "a" == t.tag;
+                            })),
+                            (h = h.children[d].children[c]));
+                          for (var u = l.children, d = 0; d < u.length; d++)
+                            if (
+                              "polygon" == u[d].tag ||
+                              "ellipse" == u[d].tag ||
+                              "path" == u[d].tag ||
+                              "text" == u[d].tag
+                            ) {
+                              var f = u[d];
+                              break;
+                            }
+                          var p = h.children;
+                          for (d = 0; d < p.length; d++)
+                            if (
+                              "polygon" == p[d].tag ||
+                              "ellipse" == p[d].tag ||
+                              "path" == p[d].tag ||
+                              "text" == p[d].tag
+                            ) {
+                              var g = p[d];
+                              break;
+                            }
+                          t.offset =
+                            g && f ? { x: g.center.x - f.center.x, y: g.center.y - f.center.y } : { x: 0, y: 0 };
+                        }
+                      }
+                    })(t),
+                    t.children.forEach(function (t) {
+                      E(t);
+                    });
+                }
+                this._dispatch.call("start", this), (this._busy = !0), this._dispatch.call("layoutStart", this);
+                var z = { format: "svg", engine: a, images: o, totalMemory: l };
+                if (this._worker)
+                  i.postMessage({ dot: t, options: z }),
+                    (i.onmessage = function (t) {
+                      switch (t.data.type) {
+                        case "done":
+                          return S.call(r, t.data.svg);
+                        case "error":
+                          if (!r._onerror) throw t.data.error;
+                          r._onerror(t.data.error);
+                      }
+                    });
+                else {
+                  try {
+                    var k = s(t, z);
+                  } catch (t) {
+                    if (r._onerror) return r._onerror(t.message), this;
+                    throw t.message;
+                  }
+                  S.call(this, k);
+                }
+                function S(t) {
+                  this._dispatch.call("layoutEnd", this);
+                  var r = e.select(document.createDocumentFragment()).append("div"),
+                    i = new window.DOMParser().parseFromString(t, "image/svg+xml");
+                  r.append(function () {
+                    return i.documentElement;
+                  });
+                  var a = u(r.select("svg"));
+                  this._dispatch.call("dataExtractEnd", this),
+                    b(a),
+                    this._dispatch.call("dataProcessPass1End", this),
+                    E(a),
+                    this._dispatch.call("dataProcessPass2End", this),
+                    (this._data = a),
+                    (this._dictionary = y),
+                    (this._nodeDictionary = _),
+                    (this._extractData = function (t, e, n) {
+                      var r = u(t);
+                      return b(r, e, n), E(r), r;
+                    }),
+                    (this._busy = !1),
+                    this._dispatch.call("dataProcessEnd", this),
+                    n && n.call(this),
+                    this._queue.length > 0 && this._queue.shift().call(this);
+                }
+                return this;
+              },
+              data: function () {
+                return this._data || null;
+              },
+              renderDot: function (t, e) {
+                var n = this;
+                return (
+                  this.dot(t, function () {
+                    n.render(e);
+                  }),
+                  this
+                );
+              },
+              transition: function (t) {
+                return (
+                  t instanceof Function ? (this._transitionFactory = t) : (this._transition = r.transition(t)), this
+                );
+              },
+              active: function (t) {
+                var e = this._selection.selectWithoutDataPropagation("svg");
+                return 0 != e.size() ? r.active(e.node(), t) : null;
+              },
+              options: function (t) {
+                if (void 0 === t) return Object.assign({}, this._options);
+                var e = !0,
+                  n = !1,
+                  r = void 0;
+                try {
+                  for (var i, a = Object.keys(t)[Symbol.iterator](); !(e = (i = a.next()).done); e = !0) {
+                    var o = i.value;
+                    this._options[o] = t[o];
+                  }
+                } catch (t) {
+                  (n = !0), (r = t);
+                } finally {
+                  try {
+                    !e && a.return && a.return();
+                  } finally {
+                    if (n) throw r;
+                  }
+                }
+                return this;
+              },
+              width: function (t) {
+                return (this._options.width = t), this;
+              },
+              height: function (t) {
+                return (this._options.height = t), this;
+              },
+              scale: function (t) {
+                return (this._options.scale = t), this;
+              },
+              fit: function (t) {
+                return (this._options.fit = t), this;
+              },
+              attributer: function (t) {
+                return (this._attributer = t), this;
+              },
+              on: function (t, e) {
+                return this._dispatch.on(t, e), this;
+              },
+              onerror: function (t) {
+                return (this._onerror = t), this;
+              },
+              logEvents: function (t) {
+                var e = this,
+                  n = Date.now(),
+                  r = {},
+                  i = this._eventTypes,
+                  a = Math.max.apply(
+                    Math,
+                    D(
+                      i.map(function (t) {
+                        return t.length;
+                      })
+                    )
+                  ),
+                  o = function (o) {
+                    var s = i[o];
+                    (r[s] = []),
+                      (h = e),
+                      e.on(
+                        s + ".log",
+                        t
+                          ? function () {
+                              var t = Date.now(),
+                                e = r[s].length;
+                              r[s].push(t);
+                              var i = "";
+                              if (
+                                ((i += "Event "),
+                                (i += l.format(" >2")(o) + " "),
+                                (i += s + " ".repeat(a - s.length)),
+                                (i += l.format(" >5")(t - n) + " "),
+                                "initEnd" != s && (i += l.format(" >5")(t - r.start[e])),
+                                "dataProcessEnd" == s &&
+                                  (i += " prepare                 " + l.format(" >5")(t - r.layoutEnd[e])),
+                                "renderEnd" == s &&
+                                  h._transition &&
+                                  ((i +=
+                                    " transition start margin " +
+                                    l.format(" >5")(h._transition.delay() - (t - r.renderStart[e]))),
+                                  (c = h._transition.delay()),
+                                  (u = h._transition.duration())),
+                                "transitionStart" == s)
+                              ) {
+                                var d = t - r.renderStart[e];
+                                (i += " transition delay        " + l.format(" >5")(t - r.renderStart[e])),
+                                  (i += " expected " + l.format(" >5")(c)),
+                                  (i += " diff " + l.format(" >5")(d - c));
+                              }
+                              if ("transitionEnd" == s) {
+                                var f = t - r.transitionStart[e];
+                                (i += " transition duration     " + l.format(" >5")(f)),
+                                  (i += " expected " + l.format(" >5")(u)),
+                                  (i += " diff " + l.format(" >5")(f - u));
+                              }
+                              console.log(i), (n = t);
+                            }
+                          : null
+                      );
+                  };
+                for (var s in i) {
+                  var h, c, u;
+                  o(s);
+                }
+                return this;
+              },
+              drawEdge: function (t, n, r, i, a) {
+                var o = arguments.length > 5 && void 0 !== arguments[5] ? arguments[5] : {};
+                if ((a = Object.assign({}, a)).style && a.style.includes("invis")) var s = e.select(null);
+                else {
+                  var l = this._selection.selectWithoutDataPropagation("svg").selectWithoutDataPropagation("g"),
+                    h = u(q(a));
+                  (s = l.append("g").data([h])), v.call(s.node(), h), W(s, t, n, r, i, a, o);
+                }
+                return (this._drawnEdge = { g: s, x1: t, y1: n, x2: r, y2: i, attributes: a }), this;
+              },
+              updateDrawnEdge: function (t, e, n, r) {
+                var i = arguments.length > 4 && void 0 !== arguments[4] ? arguments[4] : {},
+                  a = arguments.length > 5 && void 0 !== arguments[5] ? arguments[5] : {};
+                if (!this._drawnEdge) throw Error("No edge has been drawn");
+                var o = this._drawnEdge.g;
+                (i = Object.assign(this._drawnEdge.attributes, i)),
+                  (this._drawnEdge.x1 = t),
+                  (this._drawnEdge.y1 = e),
+                  (this._drawnEdge.x2 = n),
+                  (this._drawnEdge.y2 = r),
+                  !o.empty() ||
+                    (i.style && i.style.includes("invis")) ||
+                    ((o = this._selection
+                      .selectWithoutDataPropagation("svg")
+                      .selectWithoutDataPropagation("g")
+                      .append("g")),
+                    (this._drawnEdge.g = o));
+                return o.empty() || W(o, t, e, n, r, i, a), this;
+              },
+              moveDrawnEdgeEndPoint: function (t, e) {
+                var n = arguments.length > 2 && void 0 !== arguments[2] ? arguments[2] : {};
+                if (!this._drawnEdge) throw Error("No edge has been drawn");
+                var r = this._drawnEdge.g,
+                  i = this._drawnEdge.x1,
+                  a = this._drawnEdge.y1,
+                  o = this._drawnEdge.attributes;
+                return (this._drawnEdge.x2 = t), (this._drawnEdge.y2 = e), j(r, i, a, t, e, o, n), this;
+              },
+              insertDrawnEdge: function (t) {
+                if (!this._drawnEdge) throw Error("No edge has been drawn");
+                var e = this._drawnEdge.g;
+                if (e.empty()) return this;
+                this._drawnEdge.attributes, e.selectWithoutDataPropagation("title").text(t);
+                var n = this._selection.selectWithoutDataPropagation("svg").selectWithoutDataPropagation("g"),
+                  r = n.datum(),
+                  i = this._extractData(e, r.children.length, n.datum());
+                return r.children.push(i), g(e, i), (this._drawnEdge = null), this;
+              },
+              removeDrawnEdge: O,
+            }),
+            "removeDrawnEdge",
+            O
+          ),
+          S(k, "drawnEdgeSelection", L),
+          S(k, "drawnEdgeSelection", L),
+          S(k, "drawNode", function (t, n, r) {
+            var i = arguments.length > 3 && void 0 !== arguments[3] ? arguments[3] : {},
+              a = arguments.length > 4 && void 0 !== arguments[4] ? arguments[4] : {};
+            if ((i = Object.assign({}, i)).style && i.style.includes("invis")) var o = e.select(null);
+            else {
+              var s = this._selection.selectWithoutDataPropagation("svg").selectWithoutDataPropagation("g"),
+                l = u(R(r, i));
+              (o = s.append("g").data([l])), v.call(o.node(), l), A(o, t, n, r, i, a);
+            }
+            return (this._drawnNode = { g: o, nodeId: r, x: t, y: n, attributes: i }), this;
+          }),
+          S(k, "updateDrawnNode", function (t, e, n) {
+            var r = arguments.length > 3 && void 0 !== arguments[3] ? arguments[3] : {},
+              i = arguments.length > 4 && void 0 !== arguments[4] ? arguments[4] : {};
+            if (!this._drawnNode) throw Error("No node has been drawn");
+            var a = this._drawnNode.g;
+            null == n && (n = this._drawnNode.nodeId),
+              (r = Object.assign(this._drawnNode.attributes, r)),
+              (this._drawnNode.nodeId = n),
+              (this._drawnNode.x = t),
+              (this._drawnNode.y = e),
+              !a.empty() ||
+                (r.style && r.style.includes("invis")) ||
+                ((a = this._selection
+                  .selectWithoutDataPropagation("svg")
+                  .selectWithoutDataPropagation("g")
+                  .append("g")),
+                (this._drawnNode.g = a));
+            return a.empty() || A(a, t, e, n, r, i), this;
+          }),
+          S(k, "moveDrawnNode", function (t, e) {
+            if ((arguments.length > 2 && void 0 !== arguments[2] && arguments[2], !this._drawnNode))
+              throw Error("No node has been drawn");
+            var n = this._drawnNode.g,
+              r = this._drawnNode.attributes;
+            return (this._drawnNode.x = t), (this._drawnNode.y = e), n.empty() || T(n, t, e, r), this;
+          }),
+          S(k, "insertDrawnNode", function (t) {
+            if (!this._drawnNode) throw Error("No node has been drawn");
+            null == t && (t = this._drawnNode.nodeId);
+            var e = this._drawnNode.g;
+            if (e.empty()) return this;
+            var n = this._drawnNode.attributes;
+            if ((e.selectWithoutDataPropagation("title").text(t), n.URL || n.tooltip))
+              var r = e.selectWithoutDataPropagation("g").selectWithoutDataPropagation("a"),
+                i =
+                  (r.selectWithoutDataPropagation("ellipse,polygon,path,polyline"),
+                  r.selectWithoutDataPropagation("text"));
+            else
+              e.selectWithoutDataPropagation("ellipse,polygon,path,polyline"),
+                (i = e.selectWithoutDataPropagation("text"));
+            i.text(n.label || t);
+            var a = this._selection.selectWithoutDataPropagation("svg").selectWithoutDataPropagation("g"),
+              o = a.datum(),
+              s = this._extractData(e, o.children.length, a.datum());
+            return o.children.push(s), g(e, s), (this._drawnNode = null), this;
+          }),
+          S(k, "removeDrawnNode", B),
+          S(k, "removeDrawnNode", B),
+          S(k, "drawnNodeSelection", I),
+          S(k, "drawnNodeSelection", I),
+          k);
+        (e.selection.prototype.graphviz = function (t) {
+          var e = this.node().__graphviz__;
+          return e ? (e.options(t), e._dispatch.call("initEnd", this)) : (e = new U(this, t)), e;
+        }),
+          (e.selection.prototype.selectWithoutDataPropagation = function (t) {
+            return e.select(this.size() > 0 ? this.node().querySelector(t) : null);
+          }),
+          (t.graphviz = F),
+          Object.defineProperty(t, "__esModule", { value: !0 });
+      });
+    </script>
+    <script>
+      (() => {
+        function t(t, e, a) {
+          let s = { totals: [], avg: [], keys: Object.keys(t.totals.ast).filter((t) => void 0 === e || e(t)) };
+          return (
+            s.keys.forEach((e) => {
+              a && t.totals.ast[e], s.totals.push(t.totals.ast[e] || 0), s.avg.push(t.avg.ast[e] || 0);
+            }),
+            s
+          );
+        }
+        window.addEventListener(
+          "message",
+          (e) => {
+            const a = e.data;
+            switch ((console.log(a), a.command)) {
+              case "renderReport":
+                (s = a.value),
+                  (l = new showdown.Converter({ extensions: ["table"] })),
+                  (document.getElementById("preview").innerHTML = l.makeHtml(s.markdownTemplate)),
+                  (function (e, a) {
+                    window.chartColors;
+                    let s = (function (t) {
+                      console.log(t);
+                      let e = t.avg.summary,
+                        a = t.totals.summary,
+                        s = { avg: [], totals: [], keys: Array.from(new Set([...Object.keys(e), ...Object.keys(a)])) };
+                      return (
+                        s.keys.forEach((t) => {
+                          s.avg.push(e[t] || 0), s.totals.push(a[t] || 0);
+                        }),
+                        s
+                      );
+                    })(e);
+                    new Chart("chart-risk-summary", {
+                      type: "radar",
+                      data: {
+                        labels: s.keys,
+                        datasets: [
+                          { data: s.totals, label: "overall", fill: 0 },
+                          { data: s.avg, hidden: !1, label: "average", fill: 0 },
+                        ],
+                      },
+                      options: {
+                        maintainAspectRatio: !0,
+                        spanGaps: !1,
+                        scale: { ticks: { beginAtZero: !0, max: 7 } },
+                        elements: { line: { tension: 1e-6 } },
+                        plugins: {
+                          filler: { propagate: !1 },
+                          "samples-filler-analyser": { target: "chart-analyser" },
+                          colorschemes: { scheme: "tableau.Tableau20" },
+                        },
+                      },
+                    });
+                    let l = (function (t) {
+                      let e = {
+                        sloc: [],
+                        nsloc: [],
+                        keys: Object.keys(t.totals.nsloc).filter((t) => "total" !== t && "commentToSourceRatio" !== t),
+                      };
+                      return (
+                        e.keys.forEach((a) => {
+                          e.sloc.push(t.totals.sloc[a] || 0), e.nsloc.push(t.totals.nsloc[a] || 0);
+                        }),
+                        e
+                      );
+                    })(e);
+                    new Chart("chart-nsloc-total", {
+                      type: "pie",
+                      data: {
+                        labels: l.keys,
+                        datasets: [
+                          { label: "sloc", data: l.sloc },
+                          { label: "normalized sloc", data: l.nsloc },
+                        ],
+                      },
+                      options: { plugins: { colorschemes: { scheme: "tableau.Tableau20" } } },
+                    });
+                    var o = (function (t) {
+                        let e = { totals: [], avg: [], keys: Object.keys(t.totals.num) };
+                        return (
+                          e.keys.forEach((a) => {
+                            e.totals.push(t.totals.num[a] || 0), e.avg.push(t.avg.num[a] || 0);
+                          }),
+                          e
+                        );
+                      })(e),
+                      n =
+                        (new Chart("chart-num-bar", {
+                          type: "bar",
+                          data: {
+                            labels: o.keys,
+                            datasets: [
+                              { label: "total", data: o.totals },
+                              { label: "average", data: o.avg, hidden: !0 },
+                            ],
+                          },
+                          options: {
+                            responsive: !0,
+                            legend: { position: "top" },
+                            title: { display: !0, text: "Summary" },
+                            scales: {
+                              yAxes: [{ type: "logarithmic", ticks: { suggestedMin: 0, beginAtZero: !0, min: 0 } }],
+                            },
+                          },
+                        }),
+                        t(
+                          e,
+                          function (t) {
+                            return !t.startsWith("FunctionCall:Name:") && !t.startsWith("AssemblyCall:Name:");
+                          },
+                          !0
+                        )),
+                      i =
+                        (new Chart("chart-num-bar-ast", {
+                          type: "bar",
+                          data: {
+                            labels: n.keys,
+                            datasets: [
+                              { label: "total", data: n.totals },
+                              { label: "average", data: n.avg, hidden: !0 },
+                            ],
+                          },
+                          options: {
+                            responsive: !0,
+                            legend: { position: "top" },
+                            title: { display: !0, text: "AST Elements" },
+                            scales: {
+                              yAxes: [{ type: "logarithmic", ticks: { suggestedMin: 0, beginAtZero: !0, min: 0 } }],
+                            },
+                          },
+                        }),
+                        t(
+                          e,
+                          function (t) {
+                            return t.startsWith("FunctionCall:Name:");
+                          },
+                          !0
+                        )),
+                      r =
+                        (new Chart("chart-num-bar-ast-funccalls", {
+                          type: "bar",
+                          data: { labels: i.keys, datasets: [{ label: "total", data: i.totals }] },
+                          options: {
+                            responsive: !0,
+                            legend: { position: "top" },
+                            title: { display: !0, text: "Function Calls" },
+                            scales: {
+                              yAxes: [{ type: "logarithmic", ticks: { suggestedMin: 0, beginAtZero: !0, min: 0 } }],
+                            },
+                          },
+                        }),
+                        t(
+                          e,
+                          function (t) {
+                            return t.startsWith("AssemblyCall:Name:");
+                          },
+                          !0
+                        ));
+                    new Chart("chart-num-bar-ast-asmcalls", {
+                      type: "bar",
+                      data: { labels: r.keys, datasets: [{ label: "total", data: r.totals }] },
+                      options: {
+                        responsive: !0,
+                        legend: { position: "top" },
+                        title: { display: !0, text: "Assembly Calls" },
+                        scales: {
+                          yAxes: [{ type: "logarithmic", ticks: { suggestedMin: 0, beginAtZero: !0, min: 0 } }],
+                        },
+                      },
+                    });
+                  })(s.jsonData, window.chartColors),
+                  Object.entries(s.dotGraphs).forEach((t) => {
+                    let e = t[0];
+                    !(function (t, e) {
+                      var a = d3.select(e).graphviz();
+                      let s = d3.transition("startTransition").ease(d3.easeLinear).delay(0).duration(0);
+                      a
+                        .fade(!0)
+                        .transition(s)
+                        .zoomScaleExtent([0, 1 / 0])
+                        .zoom(!0)
+                        .renderDot(t),
+                        d3.selectAll(".node,.edge,.cluster");
+                    })(t[1], e);
+                  }),
+                  (document.getElementById("loading-msg").style.display = "none");
+            }
+            var s, l;
+          },
+          !1
+        ),
+          (window.onload = function () {
+            "function" == typeof acquireVsCodeApi && acquireVsCodeApi().postMessage({ command: "onPageLoaded" });
+          });
+      })();
+    </script>
+    <script>
+      let staticMetrics = {
+        markdownTemplate:
+          '\n[<img width="200" alt="get in touch with Consensys Diligence" src="https://user-images.githubusercontent.com/2865694/56826101-91dcf380-685b-11e9-937c-af49c2510aa0.png">](https://consensys.io/diligence)<br/>\n<sup>\n[[  🌐  ](https://consensys.io/diligence)  [  📩  ](mailto:diligence@consensys.net)  [  🔥  ](https://consensys.io/diligence/tools/)]\n</sup><br/><br/>\n\n\n\n# Solidity Metrics for \'CLI\'\n\n## Table of contents\n\n- [Scope](#t-scope)\n    - [Source Units in Scope](#t-source-Units-in-Scope)\n        - [Deployable Logic Contracts](#t-deployable-contracts)\n    - [Out of Scope](#t-out-of-scope)\n        - [Excluded Source Units](#t-out-of-scope-excluded-source-units)\n        - [Duplicate Source Units](#t-out-of-scope-duplicate-source-units)\n        - [Doppelganger Contracts](#t-out-of-scope-doppelganger-contracts)\n- [Report Overview](#t-report)\n    - [Risk Summary](#t-risk)\n    - [Source Lines](#t-source-lines)\n    - [Inline Documentation](#t-inline-documentation)\n    - [Components](#t-components)\n    - [Exposed Functions](#t-exposed-functions)\n    - [StateVariables](#t-statevariables)\n    - [Capabilities](#t-capabilities)\n    - [Dependencies](#t-package-imports)\n    - [Totals](#t-totals)\n\n## <span id=t-scope>Scope</span>\n\nThis section lists files that are in scope for the metrics report. \n\n- **Project:** `\'CLI\'`\n- **Included Files:** \n    - ``\n- **Excluded Paths:** \n    - ``\n- **File Limit:** `undefined`\n    - **Exclude File list Limit:** `undefined`\n\n- **Workspace Repository:** `unknown` (`undefined`@`undefined`)\n\n### <span id=t-source-Units-in-Scope>Source Units in Scope</span>\n\nSource Units Analyzed: **`31`**<br>\nSource Units in Scope: **`31`** (**100%**)\n\n| Type | File   | Logic Contracts | Interfaces | Lines | nLines | nSLOC | Comment Lines | Complex. Score | Capabilities |\n| ---- | ------ | --------------- | ---------- | ----- | ------ | ----- | ------------- | -------------- | ------------ | \n| 📝 | src/arbitration/KlerosCore.sol | 1 | **** | 75 | 63 | 28 | 26 | 13 | **** |\n| 🎨 | src/arbitration/KlerosCoreBase.sol | 1 | **** | 1211 | 1162 | 809 | 286 | 449 | **<abbr title=\'Uses Assembly\'>🖥</abbr><abbr title=\'Payable Functions\'>💰</abbr>** |\n| 📝 | src/arbitration/KlerosCoreNeo.sol | 1 | **** | 142 | 124 | 55 | 51 | 36 | **** |\n| 📝 | src/arbitration/PolicyRegistry.sol | 1 | **** | 88 | 88 | 30 | 41 | 24 | **** |\n| 📝 | src/arbitration/SortitionModule.sol | 1 | **** | 50 | 44 | 15 | 20 | 13 | **** |\n| 🎨 | src/arbitration/SortitionModuleBase.sol | 1 | **** | 689 | 645 | 393 | 205 | 300 | **<abbr title=\'Uses Assembly\'>🖥</abbr><abbr title=\'Uses Hash-Functions\'>🧮</abbr>** |\n| 📝 | src/arbitration/SortitionModuleNeo.sol | 1 | **** | 103 | 91 | 48 | 28 | 31 | **** |\n| 📝 | src/arbitration/arbitrables/DisputeResolver.sol | 1 | **** | 149 | 134 | 72 | 50 | 43 | **<abbr title=\'Payable Functions\'>💰</abbr>** |\n| 📝 | src/arbitration/DisputeTemplateRegistry.sol | 1 | **** | 83 | 79 | 30 | 33 | 25 | **** |\n| 📝 | src/arbitration/dispute-kits/DisputeKitClassic.sol | 1 | **** | 46 | 46 | 16 | 21 | 13 | **** |\n| 🎨 | src/arbitration/dispute-kits/DisputeKitClassicBase.sol | 1 | **** | 713 | 632 | 365 | 225 | 192 | **<abbr title=\'Payable Functions\'>💰</abbr><abbr title=\'Uses Hash-Functions\'>🧮</abbr>** |\n| 📝🔍 | src/arbitration/dispute-kits/DisputeKitGated.sol | 1 | 2 | 117 | 99 | 39 | 51 | 57 | **<abbr title=\'Uses Assembly\'>🖥</abbr><abbr title=\'doppelganger(IBalanceHolderERC1155)\'>🔆</abbr>** |\n| 📝🔍 | src/arbitration/dispute-kits/DisputeKitGatedShutter.sol | 1 | 2 | 194 | 159 | 59 | 84 | 69 | **<abbr title=\'Uses Assembly\'>🖥</abbr><abbr title=\'Uses Hash-Functions\'>🧮</abbr><abbr title=\'doppelganger(IBalanceHolderERC1155)\'>🔆</abbr>** |\n| 📝 | src/arbitration/dispute-kits/DisputeKitShutter.sol | 1 | **** | 123 | 107 | 36 | 54 | 27 | **<abbr title=\'Uses Hash-Functions\'>🧮</abbr>** |\n| 📝🔍 | src/arbitration/dispute-kits/DisputeKitSybilResistant.sol | 1 | 1 | 76 | 58 | 20 | 33 | 16 | **<abbr title=\'doppelganger(IProofOfHumanity)\'>🔆</abbr>** |\n| 📝 | src/arbitration/evidence/EvidenceModule.sol | 1 | **** | 70 | 70 | 26 | 30 | 21 | **** |\n| 🔍 | src/arbitration/interfaces/IArbitrableV2.sol | **** | 1 | 40 | 39 | 12 | 22 | 3 | **** |\n| 🔍 | src/arbitration/interfaces/IArbitratorV2.sol | **** | 1 | 83 | 44 | 9 | 50 | 14 | **<abbr title=\'Payable Functions\'>💰</abbr>** |\n| 🔍 | src/arbitration/interfaces/IDisputeKit.sol | **** | 1 | 128 | 39 | 11 | 60 | 23 | **** |\n| 🔍 | src/arbitration/interfaces/IDisputeTemplateRegistry.sol | **** | 1 | 25 | 20 | 9 | 8 | 3 | **** |\n| 🔍 | src/arbitration/interfaces/IEvidence.sol | **** | 1 | 12 | 12 | 4 | 6 | 1 | **** |\n| 🔍 | src/arbitration/interfaces/ISortitionModule.sol | **** | 1 | 63 | 16 | 10 | 4 | 33 | **** |\n|  | src/libraries/Constants.sol | **** | **** | 39 | 39 | 26 | 13 | 2 | **** |\n| 📚 | src/libraries/SafeERC20.sol | 1 | **** | 47 | 47 | 18 | 24 | 12 | **** |\n| 📚🔍 | src/libraries/SafeSend.sol | 1 | 1 | 24 | 19 | 9 | 7 | 15 | **<abbr title=\'Payable Functions\'>💰</abbr><abbr title=\'Initiates ETH Value Transfer\'>📤</abbr>** |\n| 📝 | src/rng/RNGWithFallback.sol | 1 | **** | 103 | 103 | 48 | 41 | 35 | **** |\n| 📝 | src/rng/ChainlinkRNG.sol | 1 | **** | 173 | 173 | 85 | 70 | 50 | **** |\n| 🔍 | src/rng/IRNG.sol | **** | 1 | 13 | 8 | 3 | 5 | 5 | **** |\n| 🎨 | src/proxy/UUPSProxiable.sol | 1 | **** | 140 | 122 | 44 | 71 | 46 | **<abbr title=\'Uses Assembly\'>🖥</abbr><abbr title=\'Payable Functions\'>💰</abbr><abbr title=\'DelegateCall\'>👥</abbr><abbr title=\'TryCatch Blocks\'>♻️</abbr>** |\n| 📝 | src/proxy/UUPSProxy.sol | 1 | **** | 90 | 90 | 38 | 37 | 65 | **<abbr title=\'Uses Assembly\'>🖥</abbr><abbr title=\'Payable Functions\'>💰</abbr><abbr title=\'DelegateCall\'>👥</abbr>** |\n| 🎨 | src/proxy/Initializable.sol | 1 | **** | 215 | 215 | 70 | 128 | 31 | **<abbr title=\'Uses Assembly\'>🖥</abbr>** |\n| 📝📚🔍🎨 | **Totals** | **23** | **13** | **5124**  | **4587** | **2437** | **1784** | **1667** | **<abbr title=\'Uses Assembly\'>🖥</abbr><abbr title=\'Payable Functions\'>💰</abbr><abbr title=\'Initiates ETH Value Transfer\'>📤</abbr><abbr title=\'DelegateCall\'>👥</abbr><abbr title=\'Uses Hash-Functions\'>🧮</abbr><abbr title=\'doppelganger\'>🔆</abbr><abbr title=\'TryCatch Blocks\'>♻️</abbr>** |\n\n<sub>\nLegend: <a onclick="toggleVisibility(\'table-legend\', this)">[➕]</a>\n<div id="table-legend" style="display:none">\n\n<ul>\n<li> <b>Lines</b>: total lines of the source unit </li>\n<li> <b>nLines</b>: normalized lines of the source unit (e.g. normalizes functions spanning multiple lines) </li>\n<li> <b>nSLOC</b>: normalized source lines of code (only source-code lines; no comments, no blank lines) </li>\n<li> <b>Comment Lines</b>: lines containing single or block comments </li>\n<li> <b>Complexity Score</b>: a custom complexity score derived from code statements that are known to introduce code complexity (branches, loops, calls, external interfaces, ...) </li>\n</ul>\n\n</div>\n</sub>\n\n\n##### <span id=t-deployable-contracts>Deployable Logic Contracts</span>\nTotal: 16\n* 📝 `KlerosCore`\n* 📝 `KlerosCoreNeo`\n* 📝 `PolicyRegistry`\n* 📝 `SortitionModule`\n* 📝 `SortitionModuleNeo`\n* <a onclick="toggleVisibility(\'deployables\', this)">[➕]</a>\n<div id="deployables" style="display:none">\n<ul>\n<li> 📝 <code>DisputeResolver</code></li>\n<li> 📝 <code>DisputeTemplateRegistry</code></li>\n<li> 📝 <code>DisputeKitClassic</code></li>\n<li> 📝 <code>DisputeKitGated</code></li>\n<li> 📝 <code>DisputeKitGatedShutter</code></li>\n<li> 📝 <code>DisputeKitShutter</code></li>\n<li> 📝 <code>DisputeKitSybilResistant</code></li>\n<li> 📝 <code>EvidenceModule</code></li>\n<li> 📝 <code>RNGWithFallback</code></li>\n<li> 📝 <code>ChainlinkRNG</code></li>\n<li> 📝 <code>UUPSProxy</code></li>\n</ul>\n</div>\n            \n\n\n\n#### <span id=t-out-of-scope>Out of Scope</span>\n\n##### <span id=t-out-of-scope-excluded-source-units>Excluded Source Units</span>\n\nSource Units Excluded: **`0`**\n\n<a onclick="toggleVisibility(\'excluded-files\', this)">[➕]</a>\n<div id="excluded-files" style="display:none">\n| File   |\n| ------ |\n| None |\n\n</div>\n\n\n##### <span id=t-out-of-scope-duplicate-source-units>Duplicate Source Units</span>\n\nDuplicate Source Units Excluded: **`0`** \n\n<a onclick="toggleVisibility(\'duplicate-files\', this)">[➕]</a>\n<div id="duplicate-files" style="display:none">\n| File   |\n| ------ |\n| None |\n\n</div>\n\n##### <span id=t-out-of-scope-doppelganger-contracts>Doppelganger Contracts</span>\n\nDoppelganger Contracts: **`3`** \n\n<a onclick="toggleVisibility(\'doppelganger-contracts\', this)">[➕]</a>\n<div id="doppelganger-contracts" style="display:none">\n| File   | Contract | Doppelganger | \n| ------ | -------- | ------------ |\n| src/arbitration/dispute-kits/DisputeKitGated.sol | IBalanceHolderERC1155 | (fuzzy) [0](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.5.0/contracts/introspection/IERC1820Implementer.sol), [1](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.2.0/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [2](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.2.2-solc-0.7/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [3](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.3.0/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [4](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.3.0-solc-0.7/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [5](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.4.0/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [6](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.4.0-solc-0.7/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [7](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [8](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0-beta.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [9](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0-rc.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [10](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.1.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [11](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.1.0-rc.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [12](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.2.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [13](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0/contracts/introspection/IERC1820Implementer.sol), [14](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.0/contracts/drafts/IERC1820Implementer.sol), [15](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.1/contracts/drafts/IERC1820Implementer.sol), [16](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.2/contracts/introspection/IERC1820Implementer.sol), [17](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.3/contracts/introspection/IERC1820Implementer.sol), [18](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0/contracts/introspection/IERC1820Implementer.sol), [19](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.0/contracts/introspection/IERC1820Implementer.sol), [20](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.1/contracts/introspection/IERC1820Implementer.sol), [21](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.2/contracts/introspection/IERC1820Implementer.sol), [22](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.0/contracts/introspection/IERC1820Implementer.sol), [23](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [24](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.1/contracts/introspection/IERC1820Implementer.sol), [25](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0/contracts/introspection/IERC1820Implementer.sol), [26](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-beta.0/contracts/introspection/IERC1820Implementer.sol), [27](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [28](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-rc.1/contracts/introspection/IERC1820Implementer.sol), [29](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.1/contracts/introspection/IERC1820Implementer.sol), [30](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.2/contracts/introspection/IERC1820Implementer.sol), [31](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.1.0/contracts/introspection/IERC1820Implementer.sol), [32](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.1.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [33](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.0/contracts/introspection/IERC1820Implementer.sol), [34](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [35](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.1-solc-0.7/contracts/introspection/IERC1820Implementer.sol), [36](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.2-solc-0.7/contracts/introspection/IERC1820Implementer.sol) |\n| src/arbitration/dispute-kits/DisputeKitGatedShutter.sol | IBalanceHolderERC1155 | (fuzzy) [0](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.5.0/contracts/introspection/IERC1820Implementer.sol), [1](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.2.0/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [2](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.2.2-solc-0.7/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [3](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.3.0/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [4](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.3.0-solc-0.7/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [5](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.4.0/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [6](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.4.0-solc-0.7/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [7](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [8](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0-beta.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [9](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0-rc.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [10](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.1.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [11](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.1.0-rc.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [12](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.2.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [13](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0/contracts/introspection/IERC1820Implementer.sol), [14](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.0/contracts/drafts/IERC1820Implementer.sol), [15](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.1/contracts/drafts/IERC1820Implementer.sol), [16](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.2/contracts/introspection/IERC1820Implementer.sol), [17](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.3/contracts/introspection/IERC1820Implementer.sol), [18](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0/contracts/introspection/IERC1820Implementer.sol), [19](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.0/contracts/introspection/IERC1820Implementer.sol), [20](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.1/contracts/introspection/IERC1820Implementer.sol), [21](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.2/contracts/introspection/IERC1820Implementer.sol), [22](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.0/contracts/introspection/IERC1820Implementer.sol), [23](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [24](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.1/contracts/introspection/IERC1820Implementer.sol), [25](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0/contracts/introspection/IERC1820Implementer.sol), [26](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-beta.0/contracts/introspection/IERC1820Implementer.sol), [27](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [28](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-rc.1/contracts/introspection/IERC1820Implementer.sol), [29](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.1/contracts/introspection/IERC1820Implementer.sol), [30](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.2/contracts/introspection/IERC1820Implementer.sol), [31](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.1.0/contracts/introspection/IERC1820Implementer.sol), [32](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.1.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [33](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.0/contracts/introspection/IERC1820Implementer.sol), [34](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [35](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.1-solc-0.7/contracts/introspection/IERC1820Implementer.sol), [36](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.2-solc-0.7/contracts/introspection/IERC1820Implementer.sol) |\n| src/arbitration/dispute-kits/DisputeKitSybilResistant.sol | IProofOfHumanity | (fuzzy) [0](https://github.com/smartcontractkit/chainlink/blob/explorer-v0.8.5/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [1](https://github.com/smartcontractkit/chainlink/blob/upgrade/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [2](https://github.com/smartcontractkit/chainlink/blob/v.0.8.12/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [3](https://github.com/smartcontractkit/chainlink/blob/v0.8.12/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [4](https://github.com/smartcontractkit/chainlink/blob/v0.8.13/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [5](https://github.com/smartcontractkit/chainlink/blob/v0.8.14/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [6](https://github.com/smartcontractkit/chainlink/blob/v0.8.15/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [7](https://github.com/smartcontractkit/chainlink/blob/v0.8.16/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [8](https://github.com/smartcontractkit/chainlink/blob/v0.8.17/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [9](https://github.com/smartcontractkit/chainlink/blob/v0.8.18/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [10](https://github.com/smartcontractkit/chainlink/blob/v0.9.0/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [11](https://github.com/smartcontractkit/chainlink/blob/v0.9.2/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [12](https://github.com/smartcontractkit/chainlink/blob/v0.9.3/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [13](https://github.com/smartcontractkit/chainlink/blob/v0.9.4/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [14](https://github.com/smartcontractkit/chainlink/blob/v0.9.5/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [15](https://github.com/smartcontractkit/chainlink/blob/v0.9.6/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [16](https://github.com/smartcontractkit/chainlink/blob/v0.9.7/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [17](https://github.com/smartcontractkit/chainlink/blob/v0.9.8/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [18](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.0.0/contracts/introspection/IERC165.sol), [19](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.0.1/contracts/introspection/IERC165.sol), [20](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.0.2/contracts/introspection/IERC165.sol), [21](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.1.2/contracts/introspection/IERC165.sol), [22](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.1.3/contracts/introspection/IERC165.sol), [23](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.2.1/contracts/introspection/IERC165.sol), [24](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.2.2/contracts/introspection/IERC165.sol), [25](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.2.3/contracts/introspection/IERC165.sol), [26](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.5.0/contracts/introspection/IERC165.sol), [27](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.2.0/contracts/introspection/IERC165Upgradeable.sol), [28](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.2.2-solc-0.7/contracts/introspection/IERC165Upgradeable.sol), [29](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.3.0/contracts/introspection/IERC165Upgradeable.sol), [30](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.3.0-solc-0.7/contracts/introspection/IERC165Upgradeable.sol), [31](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.4.0/contracts/introspection/IERC165Upgradeable.sol), [32](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.4.0-solc-0.7/contracts/introspection/IERC165Upgradeable.sol), [33](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0/contracts/utils/introspection/IERC165Upgradeable.sol), [34](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0-beta.0/contracts/utils/introspection/IERC165Upgradeable.sol), [35](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0-rc.0/contracts/utils/introspection/IERC165Upgradeable.sol), [36](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.1.0/contracts/utils/introspection/IERC165Upgradeable.sol), [37](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.1.0-rc.0/contracts/utils/introspection/IERC165Upgradeable.sol), [38](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.2.0/contracts/utils/introspection/IERC165Upgradeable.sol), [39](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.0.0/contracts/introspection/IERC165.sol), [40](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.0.0-rc.1/contracts/introspection/IERC165.sol), [41](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.0.0-rc.2/contracts/introspection/IERC165.sol), [42](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.0.0-rc.3/contracts/introspection/IERC165.sol), [43](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.0.0-rc.4/contracts/introspection/IERC165.sol), [44](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.0.1/contracts/introspection/IERC165.sol), [45](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.1.0-rc.1/contracts/introspection/IERC165.sol), [46](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.1.0-rc.2/contracts/introspection/IERC165.sol), [47](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.1.1/contracts/introspection/IERC165.sol), [48](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.1.2/contracts/introspection/IERC165.sol), [49](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.1.3/contracts/introspection/IERC165.sol), [50](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.2.0/contracts/introspection/IERC165.sol), [51](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.2.0-rc.1/contracts/introspection/IERC165.sol), [52](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0/contracts/introspection/IERC165.sol), [53](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.0/contracts/introspection/IERC165.sol), [54](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.1/contracts/introspection/IERC165.sol), [55](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.2/contracts/introspection/IERC165.sol), [56](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.3/contracts/introspection/IERC165.sol), [57](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0/contracts/introspection/IERC165.sol), [58](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.0/contracts/introspection/IERC165.sol), [59](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.1/contracts/introspection/IERC165.sol), [60](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.2/contracts/introspection/IERC165.sol), [61](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.0/contracts/introspection/IERC165.sol), [62](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.0-rc.0/contracts/introspection/IERC165.sol), [63](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.1/contracts/introspection/IERC165.sol), [64](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0/contracts/introspection/IERC165.sol), [65](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-beta.0/contracts/introspection/IERC165.sol), [66](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-rc.0/contracts/introspection/IERC165.sol), [67](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-rc.1/contracts/introspection/IERC165.sol), [68](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.1/contracts/introspection/IERC165.sol), [69](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.2/contracts/introspection/IERC165.sol), [70](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.1.0/contracts/introspection/IERC165.sol), [71](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.1.0-rc.0/contracts/introspection/IERC165.sol), [72](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.0/contracts/introspection/IERC165.sol), [73](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.0-rc.0/contracts/introspection/IERC165.sol), [74](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.1-solc-0.7/contracts/introspection/IERC165.sol), [75](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.2-solc-0.7/contracts/introspection/IERC165.sol) |\n\n</div>\n\n\n## <span id=t-report>Report</span>\n\n### Overview\n\nThe analysis finished with **`0`** errors and **`0`** duplicate files.\n\n\n\n\n\n#### <span id=t-risk>Risk</span>\n\n<div class="wrapper" style="max-width: 512px; margin: auto">\n\t\t\t<canvas id="chart-risk-summary"></canvas>\n</div>\n\n#### <span id=t-source-lines>Source Lines (sloc vs. nsloc)</span>\n\n<div class="wrapper" style="max-width: 512px; margin: auto">\n    <canvas id="chart-nsloc-total"></canvas>\n</div>\n\n#### <span id=t-inline-documentation>Inline Documentation</span>\n\n- **Comment-to-Source Ratio:** On average there are`1.59` code lines per comment (lower=better).\n- **ToDo\'s:** `2` \n\n#### <span id=t-components>Components</span>\n\n| 📝Contracts   | 📚Libraries | 🔍Interfaces | 🎨Abstract |\n| ------------- | ----------- | ------------ | ---------- |\n| 16 | 2  | 13  | 5 |\n\n#### <span id=t-exposed-functions>Exposed Functions</span>\n\nThis section lists functions that are explicitly declared public or payable. Please note that getter methods for public stateVars are not included.  \n\n| 🌐Public   | 💰Payable |\n| ---------- | --------- |\n| 192 | 10  | \n\n| External   | Internal | Private | Pure | View |\n| ---------- | -------- | ------- | ---- | ---- |\n| 175 | 217  | 2 | 13 | 80 |\n\n#### <span id=t-statevariables>StateVariables</span>\n\n| Total      | 🌐Public  |\n| ---------- | --------- |\n| 87  | 80 |\n\n#### <span id=t-capabilities>Capabilities</span>\n\n| Solidity Versions observed | 🧪 Experimental Features | 💰 Can Receive Funds | 🖥 Uses Assembly | 💣 Has Destroyable Contracts | \n| -------------------------- | ------------------------ | -------------------- | ---------------- | ---------------------------- |\n| `^0.8.24`<br/>`>=0.8.0 <0.9.0` |  | `yes` | `yes` <br/>(12 asm blocks) | **** | \n\n| 📤 Transfers ETH | ⚡ Low-Level Calls | 👥 DelegateCall | 🧮 Uses Hash Functions | 🔖 ECRecover | 🌀 New/Create/Create2 |\n| ---------------- | ----------------- | --------------- | ---------------------- | ------------ | --------------------- |\n| `yes` | **** | `yes` | `yes` | **** | **** | \n\n| ♻️ TryCatch | Σ Unchecked |\n| ---------- | ----------- |\n| `yes` | **** |\n\n#### <span id=t-package-imports>Dependencies / External Imports</span>\n\n| Dependency / Import Path | Count  | \n| ------------------------ | ------ |\n| @chainlink/contracts/src/v0.8/vrf/dev/VRFConsumerBaseV2Plus.sol | 1 |\n| @chainlink/contracts/src/v0.8/vrf/dev/libraries/VRFV2PlusClient.sol | 1 |\n| @openzeppelin/contracts/token/ERC20/IERC20.sol | 3 |\n| @openzeppelin/contracts/token/ERC721/IERC721.sol | 1 |\n\n#### <span id=t-totals>Totals</span>\n\n##### Summary\n\n<div class="wrapper" style="max-width: 90%; margin: auto">\n    <canvas id="chart-num-bar"></canvas>\n</div>\n\n##### AST Node Statistics\n\n###### Function Calls\n\n<div class="wrapper" style="max-width: 90%; margin: auto">\n    <canvas id="chart-num-bar-ast-funccalls"></canvas>\n</div>\n\n###### Assembly Calls\n\n<div class="wrapper" style="max-width: 90%; margin: auto">\n    <canvas id="chart-num-bar-ast-asmcalls"></canvas>\n</div>\n\n###### AST Total\n\n<div class="wrapper" style="max-width: 90%; margin: auto">\n    <canvas id="chart-num-bar-ast"></canvas>\n</div>\n\n##### Inheritance Graph\n\n<a onclick="toggleVisibility(\'surya-inherit\', this)">[➕]</a>\n<div id="surya-inherit" style="display:none">\n<div class="wrapper" style="max-width: 512px; margin: auto">\n    <div id="surya-inheritance" style="text-align: center;"></div> \n</div>\n</div>\n\n##### CallGraph\n\n<a onclick="toggleVisibility(\'surya-call\', this)">[➕]</a>\n<div id="surya-call" style="display:none">\n<div class="wrapper" style="max-width: 512px; margin: auto">\n    <div id="surya-callgraph" style="text-align: center;"></div>\n</div>\n</div>\n\n###### Contract Summary\n\n<a onclick="toggleVisibility(\'surya-mdreport\', this)">[➕]</a>\n<div id="surya-mdreport" style="display:none">\n \n\n Files Description Table\n\n\n|  File Name  |  SHA-1 Hash  |\n|-------------|--------------|\n| src/arbitration/KlerosCore.sol | 5362842ab3a88870e8b3b42cd7cf7a2058240483 |\n| src/arbitration/KlerosCoreBase.sol | fe829c80ad434e185151a8b5d299a585f576c619 |\n| src/arbitration/KlerosCoreNeo.sol | 0260ef7a9309d5c73c4c9b1a3f5c7653904f79c7 |\n| src/arbitration/PolicyRegistry.sol | c36299120ac7318dd29e4ab86f50b0447d87af96 |\n| src/arbitration/SortitionModule.sol | c1c1b2dd061590cd6c7eee41767e5c3fb898d506 |\n| src/arbitration/SortitionModuleBase.sol | 7b1037fcdfffc58bf3522f70ed128cad4915e032 |\n| src/arbitration/SortitionModuleNeo.sol | 8570ebeff10d723ce33b75e077dffb6fcf6e2f08 |\n| src/arbitration/arbitrables/DisputeResolver.sol | 7dad21f0219e0a1b698859205bbf31b07abfdc7c |\n| src/arbitration/DisputeTemplateRegistry.sol | c31e000957b979dc513d8b123253adb9edce50c7 |\n| src/arbitration/dispute-kits/DisputeKitClassic.sol | 32bcb287571a3c4a861659be31a1ee2dc6ea6784 |\n| src/arbitration/dispute-kits/DisputeKitClassicBase.sol | 7c0b04f3e73c0a10a29abfa78f78220e4e43f983 |\n| src/arbitration/dispute-kits/DisputeKitGated.sol | e5f7f2ecd65f5e279c7b55e9edbe6f4cfc5fd632 |\n| src/arbitration/dispute-kits/DisputeKitGatedShutter.sol | abb7f1ac20fa60db95d97fea6e9396b108d40924 |\n| src/arbitration/dispute-kits/DisputeKitShutter.sol | 3720b60db303b866eacbb3dee529a638eaf6782e |\n| src/arbitration/dispute-kits/DisputeKitSybilResistant.sol | 69158bf07e78b3cb9892a5fd6cfc768181989a7f |\n| src/arbitration/evidence/EvidenceModule.sol | 45845f3d5ad5548a30698105061bc0e64fd7718f |\n| src/arbitration/interfaces/IArbitrableV2.sol | ce54b7140a6109b2d919cea38ff94ac2ad775398 |\n| src/arbitration/interfaces/IArbitratorV2.sol | 4e0baa0ff6155737540105f9fdb5b54ba2905d2c |\n| src/arbitration/interfaces/IDisputeKit.sol | f21b52ed28a905b3073adaf68961938200cfd644 |\n| src/arbitration/interfaces/IDisputeTemplateRegistry.sol | 8d0351ebeee1ebd8603af9cf50c2ab62f6e8fecb |\n| src/arbitration/interfaces/IEvidence.sol | 12ee130f67f5d38afbcc810129b030cf7f58f058 |\n| src/arbitration/interfaces/ISortitionModule.sol | 2c6d74752298263f7c649e3feecfb9a03c87a16a |\n| src/libraries/Constants.sol | 4d1d44dbeeda03f47a646e9552873d26acf4254d |\n| src/libraries/SafeERC20.sol | 68e49603280eab2b68eabc554dc310ff3313a64c |\n| src/libraries/SafeSend.sol | 9d282cf6456950471debec28103fcb99638fa83d |\n| src/rng/RNGWithFallback.sol | 9729dbce3e1dd5981073df38ac31fe356aae0027 |\n| src/rng/ChainlinkRNG.sol | ce0d145807bc7b5b59b0e29ba468d9b0c0dc0314 |\n| src/rng/IRNG.sol | d701581ef4910cdde9dbc3006dd0229cc3ea6012 |\n| src/proxy/UUPSProxiable.sol | 80d46ace20ea4c9c6a0cbc1093d6e88eb19aeb12 |\n| src/proxy/UUPSProxy.sol | 18a2a570a8ef2ec5f02d59bd1c03a176203e8ccf |\n| src/proxy/Initializable.sol | 7079462341810d12b0c0ea93845d053bdcbdabff |\n\n\n Contracts Description Table\n\n\n|  Contract  |         Type        |       Bases      |                  |                 |\n|:----------:|:-------------------:|:----------------:|:----------------:|:---------------:|\n|     └      |  **Function Name**  |  **Visibility**  |  **Mutability**  |  **Modifiers**  |\n||||||\n| **KlerosCore** | Implementation | KlerosCoreBase |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | reinitializer |\n| └ | reinitialize | External ❗️ | 🛑  | reinitializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByGovernor |\n||||||\n| **KlerosCoreBase** | Implementation | IArbitratorV2, Initializable, UUPSProxiable |||\n| └ | __KlerosCoreBase_initialize | Internal 🔒 | 🛑  | onlyInitializing |\n| └ | pause | External ❗️ | 🛑  | onlyByGuardianOrGovernor whenNotPaused |\n| └ | unpause | External ❗️ | 🛑  | onlyByGovernor whenPaused |\n| └ | executeGovernorProposal | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeGovernor | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeGuardian | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changePinakion | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeJurorProsecutionModule | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeSortitionModule | External ❗️ | 🛑  | onlyByGovernor |\n| └ | addNewDisputeKit | External ❗️ | 🛑  | onlyByGovernor |\n| └ | createCourt | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeCourtParameters | External ❗️ | 🛑  | onlyByGovernor |\n| └ | enableDisputeKits | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeAcceptedFeeTokens | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeCurrencyRates | External ❗️ | 🛑  | onlyByGovernor |\n| └ | setStake | External ❗️ | 🛑  | whenNotPaused |\n| └ | setStakeBySortitionModule | External ❗️ | 🛑  |NO❗️ |\n| └ | transferBySortitionModule | External ❗️ | 🛑  |NO❗️ |\n| └ | createDispute | External ❗️ |  💵 |NO❗️ |\n| └ | createDispute | External ❗️ | 🛑  |NO❗️ |\n| └ | _createDispute | Internal 🔒 | 🛑  | |\n| └ | passPeriod | External ❗️ | 🛑  |NO❗️ |\n| └ | draw | External ❗️ | 🛑  |NO❗️ |\n| └ | appeal | External ❗️ |  💵 |NO❗️ |\n| └ | execute | External ❗️ | 🛑  | whenNotPaused |\n| └ | _executePenalties | Internal 🔒 | 🛑  | |\n| └ | _executeRewards | Internal 🔒 | 🛑  | |\n| └ | executeRuling | External ❗️ | 🛑  |NO❗️ |\n| └ | arbitrationCost | Public ❗️ |   |NO❗️ |\n| └ | arbitrationCost | Public ❗️ |   |NO❗️ |\n| └ | appealCost | Public ❗️ |   |NO❗️ |\n| └ | appealPeriod | External ❗️ |   |NO❗️ |\n| └ | currentRuling | Public ❗️ |   |NO❗️ |\n| └ | getRoundInfo | External ❗️ |   |NO❗️ |\n| └ | getPnkAtStakePerJuror | External ❗️ |   |NO❗️ |\n| └ | getNumberOfRounds | External ❗️ |   |NO❗️ |\n| └ | isSupported | External ❗️ |   |NO❗️ |\n| └ | getTimesPerPeriod | External ❗️ |   |NO❗️ |\n| └ | getNumberOfVotes | External ❗️ |   |NO❗️ |\n| └ | isDisputeKitJumping | External ❗️ |   |NO❗️ |\n| └ | getDisputeKitsLength | External ❗️ |   |NO❗️ |\n| └ | convertEthToTokenAmount | Public ❗️ |   |NO❗️ |\n| └ | _transferFeeToken | Internal 🔒 | 🛑  | |\n| └ | _applyCoherence | Internal 🔒 |   | |\n| └ | _calculatePnkAtStake | Internal 🔒 |   | |\n| └ | _enableDisputeKit | Internal 🔒 | 🛑  | |\n| └ | _setStake | Internal 🔒 | 🛑  | |\n| └ | _stakingFailed | Internal 🔒 |   | |\n| └ | _extraDataToCourtIDMinJurorsDisputeKit | Internal 🔒 |   | |\n||||||\n| **KlerosCoreNeo** | Implementation | KlerosCoreBase |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | reinitializer |\n| └ | reinitialize | External ❗️ | 🛑  | reinitializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByGovernor |\n| └ | changeJurorNft | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeArbitrableWhitelist | External ❗️ | 🛑  | onlyByGovernor |\n| └ | setStake | External ❗️ | 🛑  | whenNotPaused |\n| └ | _createDispute | Internal 🔒 | 🛑  | |\n| └ | _stakingFailed | Internal 🔒 |   | |\n||||||\n| **PolicyRegistry** | Implementation | UUPSProxiable, Initializable |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | reinitializer |\n| └ | initialize2 | External ❗️ | 🛑  | reinitializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByGovernor |\n| └ | changeGovernor | External ❗️ | 🛑  | onlyByGovernor |\n| └ | setPolicy | External ❗️ | 🛑  | onlyByGovernor |\n||||||\n| **SortitionModule** | Implementation | SortitionModuleBase |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | reinitializer |\n| └ | initialize4 | External ❗️ | 🛑  | reinitializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByGovernor |\n||||||\n| **SortitionModuleBase** | Implementation | ISortitionModule, Initializable, UUPSProxiable |||\n| └ | __SortitionModuleBase_initialize | Internal 🔒 | 🛑  | onlyInitializing |\n| └ | changeGovernor | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeMinStakingTime | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeMaxDrawingTime | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeRandomNumberGenerator | External ❗️ | 🛑  | onlyByGovernor |\n| └ | passPhase | External ❗️ | 🛑  |NO❗️ |\n| └ | createTree | External ❗️ | 🛑  | onlyByCore |\n| └ | executeDelayedStakes | External ❗️ | 🛑  |NO❗️ |\n| └ | createDisputeHook | External ❗️ | 🛑  | onlyByCore |\n| └ | postDrawHook | External ❗️ | 🛑  | onlyByCore |\n| └ | notifyRandomNumber | Public ❗️ | 🛑  |NO❗️ |\n| └ | validateStake | External ❗️ | 🛑  | onlyByCore |\n| └ | _validateStake | Internal 🔒 | 🛑  | |\n| └ | setStake | External ❗️ | 🛑  | onlyByCore |\n| └ | _setStake | Internal 🔒 | 🛑  | |\n| └ | lockStake | External ❗️ | 🛑  | onlyByCore |\n| └ | unlockStake | External ❗️ | 🛑  | onlyByCore |\n| └ | penalizeStake | External ❗️ | 🛑  | onlyByCore |\n| └ | setJurorInactive | External ❗️ | 🛑  | onlyByCore |\n| └ | withdrawLeftoverPNK | External ❗️ | 🛑  |NO❗️ |\n| └ | draw | Public ❗️ |   |NO❗️ |\n| └ | stakeOf | Public ❗️ |   |NO❗️ |\n| └ | stakeOf | Public ❗️ |   |NO❗️ |\n| └ | getJurorBalance | External ❗️ |   |NO❗️ |\n| └ | getJurorCourtIDs | Public ❗️ |   |NO❗️ |\n| └ | isJurorStaked | External ❗️ |   |NO❗️ |\n| └ | getJurorLeftoverPNK | Public ❗️ |   |NO❗️ |\n| └ | _updateParents | Private 🔐 | 🛑  | |\n| └ | _stakePathIDToAccount | Internal 🔒 |   | |\n| └ | _extraDataToTreeK | Internal 🔒 |   | |\n| └ | _set | Internal 🔒 | 🛑  | |\n| └ | _accountAndCourtIDToStakePathID | Internal 🔒 |   | |\n||||||\n| **SortitionModuleNeo** | Implementation | SortitionModuleBase |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | reinitializer |\n| └ | initialize4 | External ❗️ | 🛑  | reinitializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByGovernor |\n| └ | changeMaxStakePerJuror | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeMaxTotalStaked | External ❗️ | 🛑  | onlyByGovernor |\n| └ | _validateStake | Internal 🔒 | 🛑  | onlyByCore |\n||||||\n| **DisputeResolver** | Implementation | IArbitrableV2 |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | changeGovernor | External ❗️ | 🛑  |NO❗️ |\n| └ | changeArbitrator | External ❗️ | 🛑  |NO❗️ |\n| └ | changeTemplateRegistry | External ❗️ | 🛑  |NO❗️ |\n| └ | createDisputeForTemplate | External ❗️ |  💵 |NO❗️ |\n| └ | createDisputeForTemplateUri | External ❗️ |  💵 |NO❗️ |\n| └ | rule | External ❗️ | 🛑  |NO❗️ |\n| └ | _createDispute | Internal 🔒 | 🛑  | |\n||||||\n| **DisputeTemplateRegistry** | Implementation | IDisputeTemplateRegistry, UUPSProxiable, Initializable |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | reinitializer |\n| └ | initialize2 | External ❗️ | 🛑  | reinitializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByGovernor |\n| └ | changeGovernor | External ❗️ | 🛑  | onlyByGovernor |\n| └ | setDisputeTemplate | External ❗️ | 🛑  |NO❗️ |\n||||||\n| **DisputeKitClassic** | Implementation | DisputeKitClassicBase |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | reinitializer |\n| └ | reinitialize | External ❗️ | 🛑  | reinitializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByGovernor |\n||||||\n| **DisputeKitClassicBase** | Implementation | IDisputeKit, Initializable, UUPSProxiable |||\n| └ | __DisputeKitClassicBase_initialize | Internal 🔒 | 🛑  | onlyInitializing |\n| └ | executeGovernorProposal | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeGovernor | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeCore | External ❗️ | 🛑  | onlyByGovernor |\n| └ | createDispute | External ❗️ | 🛑  | onlyByCore |\n| └ | draw | External ❗️ | 🛑  | onlyByCore notJumped |\n| └ | castCommit | External ❗️ | 🛑  |NO❗️ |\n| └ | _castCommit | Internal 🔒 | 🛑  | notJumped |\n| └ | castVote | External ❗️ | 🛑  |NO❗️ |\n| └ | _castVote | Internal 🔒 | 🛑  | notJumped |\n| └ | fundAppeal | External ❗️ |  💵 | notJumped |\n| └ | withdrawFeesAndRewards | External ❗️ | 🛑  |NO❗️ |\n| └ | hashVote | Public ❗️ |   |NO❗️ |\n| └ | getFundedChoices | Public ❗️ |   |NO❗️ |\n| └ | currentRuling | External ❗️ |   |NO❗️ |\n| └ | getDegreeOfCoherence | External ❗️ |   |NO❗️ |\n| └ | getCoherentCount | External ❗️ |   |NO❗️ |\n| └ | areCommitsAllCast | External ❗️ |   |NO❗️ |\n| └ | areVotesAllCast | External ❗️ |   |NO❗️ |\n| └ | isAppealFunded | External ❗️ |   |NO❗️ |\n| └ | isVoteActive | External ❗️ |   |NO❗️ |\n| └ | getRoundInfo | External ❗️ |   |NO❗️ |\n| └ | getNumberOfRounds | External ❗️ |   |NO❗️ |\n| └ | getLocalDisputeRoundID | External ❗️ |   |NO❗️ |\n| └ | getVoteInfo | External ❗️ |   |NO❗️ |\n| └ | _postDrawCheck | Internal 🔒 |   | |\n||||||\n| **IBalanceHolder** | Interface |  |||\n| └ | balanceOf | External ❗️ |   |NO❗️ |\n||||||\n| **IBalanceHolderERC1155** | Interface |  |||\n| └ | balanceOf | External ❗️ |   |NO❗️ |\n||||||\n| **DisputeKitGated** | Implementation | DisputeKitClassicBase |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | reinitializer |\n| └ | reinitialize | External ❗️ | 🛑  | reinitializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByGovernor |\n| └ | extraDataToTokenInfo | Public ❗️ |   |NO❗️ |\n| └ | _postDrawCheck | Internal 🔒 |   | |\n||||||\n| **IBalanceHolder** | Interface |  |||\n| └ | balanceOf | External ❗️ |   |NO❗️ |\n||||||\n| **IBalanceHolderERC1155** | Interface |  |||\n| └ | balanceOf | External ❗️ |   |NO❗️ |\n||||||\n| **DisputeKitGatedShutter** | Implementation | DisputeKitClassicBase |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | reinitializer |\n| └ | reinitialize | External ❗️ | 🛑  | reinitializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByGovernor |\n| └ | castCommitShutter | External ❗️ | 🛑  | notJumped |\n| └ | castVoteShutter | External ❗️ | 🛑  |NO❗️ |\n| └ | hashVote | Public ❗️ |   |NO❗️ |\n| └ | _extraDataToTokenInfo | Internal 🔒 |   | |\n| └ | _postDrawCheck | Internal 🔒 |   | |\n||||||\n| **DisputeKitShutter** | Implementation | DisputeKitClassicBase |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | reinitializer |\n| └ | reinitialize | External ❗️ | 🛑  | reinitializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByGovernor |\n| └ | castCommitShutter | External ❗️ | 🛑  | notJumped |\n| └ | castVoteShutter | External ❗️ | 🛑  |NO❗️ |\n| └ | hashVote | Public ❗️ |   |NO❗️ |\n||||||\n| **IProofOfHumanity** | Interface |  |||\n| └ | isRegistered | External ❗️ |   |NO❗️ |\n||||||\n| **DisputeKitSybilResistant** | Implementation | DisputeKitClassicBase |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | reinitializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByGovernor |\n| └ | _postDrawCheck | Internal 🔒 |   | |\n||||||\n| **EvidenceModule** | Implementation | IEvidence, Initializable, UUPSProxiable |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | reinitializer |\n| └ | initialize2 | External ❗️ | 🛑  | reinitializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByGovernor |\n| └ | submitEvidence | External ❗️ | 🛑  |NO❗️ |\n||||||\n| **IArbitrableV2** | Interface |  |||\n| └ | rule | External ❗️ | 🛑  |NO❗️ |\n||||||\n| **IArbitratorV2** | Interface |  |||\n| └ | createDispute | External ❗️ |  💵 |NO❗️ |\n| └ | createDispute | External ❗️ | 🛑  |NO❗️ |\n| └ | arbitrationCost | External ❗️ |   |NO❗️ |\n| └ | arbitrationCost | External ❗️ |   |NO❗️ |\n| └ | currentRuling | External ❗️ |   |NO❗️ |\n||||||\n| **IDisputeKit** | Interface |  |||\n| └ | createDispute | External ❗️ | 🛑  |NO❗️ |\n| └ | draw | External ❗️ | 🛑  |NO❗️ |\n| └ | currentRuling | External ❗️ |   |NO❗️ |\n| └ | getDegreeOfCoherence | External ❗️ |   |NO❗️ |\n| └ | getCoherentCount | External ❗️ |   |NO❗️ |\n| └ | areCommitsAllCast | External ❗️ |   |NO❗️ |\n| └ | areVotesAllCast | External ❗️ |   |NO❗️ |\n| └ | isAppealFunded | External ❗️ |   |NO❗️ |\n| └ | isVoteActive | External ❗️ |   |NO❗️ |\n| └ | getRoundInfo | External ❗️ |   |NO❗️ |\n| └ | getVoteInfo | External ❗️ |   |NO❗️ |\n||||||\n| **IDisputeTemplateRegistry** | Interface |  |||\n| └ | setDisputeTemplate | External ❗️ | 🛑  |NO❗️ |\n||||||\n| **IEvidence** | Interface |  |||\n||||||\n| **ISortitionModule** | Interface |  |||\n| └ | createTree | External ❗️ | 🛑  |NO❗️ |\n| └ | validateStake | External ❗️ | 🛑  |NO❗️ |\n| └ | setStake | External ❗️ | 🛑  |NO❗️ |\n| └ | setJurorInactive | External ❗️ | 🛑  |NO❗️ |\n| └ | lockStake | External ❗️ | 🛑  |NO❗️ |\n| └ | unlockStake | External ❗️ | 🛑  |NO❗️ |\n| └ | penalizeStake | External ❗️ | 🛑  |NO❗️ |\n| └ | notifyRandomNumber | External ❗️ | 🛑  |NO❗️ |\n| └ | draw | External ❗️ |   |NO❗️ |\n| └ | getJurorBalance | External ❗️ |   |NO❗️ |\n| └ | getJurorCourtIDs | External ❗️ |   |NO❗️ |\n| └ | isJurorStaked | External ❗️ |   |NO❗️ |\n| └ | getJurorLeftoverPNK | External ❗️ |   |NO❗️ |\n| └ | createDisputeHook | External ❗️ | 🛑  |NO❗️ |\n| └ | postDrawHook | External ❗️ | 🛑  |NO❗️ |\n| └ | withdrawLeftoverPNK | External ❗️ | 🛑  |NO❗️ |\n||||||\n| **SafeERC20** | Library |  |||\n| └ | increaseAllowance | Internal 🔒 | 🛑  | |\n| └ | safeTransfer | Internal 🔒 | 🛑  | |\n| └ | safeTransferFrom | Internal 🔒 | 🛑  | |\n||||||\n| **WethLike** | Interface |  |||\n| └ | deposit | External ❗️ |  💵 |NO❗️ |\n| └ | transfer | External ❗️ | 🛑  |NO❗️ |\n||||||\n| **SafeSend** | Library |  |||\n| └ | safeSend | Internal 🔒 | 🛑  | |\n||||||\n| **RNGWithFallback** | Implementation | IRNG |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | changeGovernor | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeConsumer | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeFallbackTimeout | External ❗️ | 🛑  | onlyByGovernor |\n| └ | requestRandomness | External ❗️ | 🛑  | onlyByConsumer |\n| └ | receiveRandomness | External ❗️ | 🛑  | onlyByConsumer |\n||||||\n| **ChainlinkRNG** | Implementation | IRNG, VRFConsumerBaseV2Plus |||\n| └ | <Constructor> | Public ❗️ | 🛑  | VRFConsumerBaseV2Plus |\n| └ | changeGovernor | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeConsumer | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeVrfCoordinator | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeKeyHash | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeSubscriptionId | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeRequestConfirmations | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeCallbackGasLimit | External ❗️ | 🛑  | onlyByGovernor |\n| └ | requestRandomness | External ❗️ | 🛑  | onlyByConsumer |\n| └ | fulfillRandomWords | Internal 🔒 | 🛑  | |\n| └ | receiveRandomness | External ❗️ |   |NO❗️ |\n||||||\n| **IRNG** | Interface |  |||\n| └ | requestRandomness | External ❗️ | 🛑  |NO❗️ |\n| └ | receiveRandomness | External ❗️ | 🛑  |NO❗️ |\n||||||\n| **UUPSProxiable** | Implementation |  |||\n| └ | _authorizeUpgrade | Internal 🔒 | 🛑  | |\n| └ | upgradeToAndCall | Public ❗️ |  💵 |NO❗️ |\n| └ | proxiableUUID | External ❗️ |   |NO❗️ |\n| └ | version | External ❗️ |   |NO❗️ |\n| └ | _getImplementation | Internal 🔒 |   | |\n||||||\n| **UUPSProxy** | Implementation |  |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | _delegate | Internal 🔒 | 🛑  | |\n| └ | _getImplementation | Internal 🔒 |   | |\n| └ | <Fallback> | External ❗️ |  💵 |NO❗️ |\n| └ | <Receive Ether> | External ❗️ |  💵 |NO❗️ |\n||||||\n| **Initializable** | Implementation |  |||\n| └ | _checkInitializing | Internal 🔒 |   | |\n| └ | _disableInitializers | Internal 🔒 | 🛑  | |\n| └ | _getInitializedVersion | Internal 🔒 |   | |\n| └ | _isInitializing | Internal 🔒 |   | |\n| └ | _getInitializableStorage | Private 🔐 |   | |\n\n\n Legend\n\n|  Symbol  |  Meaning  |\n|:--------:|-----------|\n|    🛑    | Function can modify state |\n|    💵    | Function is payable |\n \n\n</div>\n____\n<sub>\nThinking about smart contract security? We can provide training, ongoing advice, and smart contract auditing. [Contact us](https://consensys.io/diligence/contact/).\n</sub>\n\n',
+        jsonData: {
+          totals: {
+            ast: {
+              SourceUnit: 31,
+              PragmaDirective: 31,
+              "Pragma:solidity:^0.8.24": 24,
+              ImportDirective: 51,
+              StringLiteral: 130,
+              Identifier: 3787,
+              ContractDefinition: 36,
+              "ContractDefinition:Contract": 16,
+              "ContractDefinition:BaseContracts": 30,
+              "ContractDefinition:LogicContractNames": [
+                "KlerosCore",
+                "KlerosCoreNeo",
+                "PolicyRegistry",
+                "SortitionModule",
+                "SortitionModuleNeo",
+                "DisputeResolver",
+                "DisputeTemplateRegistry",
+                "DisputeKitClassic",
+                "DisputeKitGated",
+                "DisputeKitGatedShutter",
+                "DisputeKitShutter",
+                "DisputeKitSybilResistant",
+                "EvidenceModule",
+                "RNGWithFallback",
+                "ChainlinkRNG",
+                "UUPSProxy",
+              ],
+              "ContractDefinition:BaseContractNames": [
+                "KlerosCoreBase",
+                "IArbitratorV2",
+                "Initializable",
+                "UUPSProxiable",
+                "SortitionModuleBase",
+                "ISortitionModule",
+                "IArbitrableV2",
+                "IDisputeTemplateRegistry",
+                "DisputeKitClassicBase",
+                "IDisputeKit",
+                "IEvidence",
+                "IRNG",
+                "VRFConsumerBaseV2Plus",
+              ],
+              InheritanceSpecifier: 30,
+              UserDefinedTypeName: 232,
+              "UserDefinedTypeName:KlerosCoreBase": 2,
+              StateVariableDeclaration: 87,
+              VariableDeclaration: 1206,
+              "StateVariableDeclaration:Public": 80,
+              "StateVariableDeclaration:Const": 21,
+              ElementaryTypeName: 1074,
+              FunctionDefinition: 265,
+              "FunctionDefinition:Internal": 217,
+              "FunctionDefinition:Default": 16,
+              Block: 403,
+              ExpressionStatement: 457,
+              FunctionCall: 476,
+              "FunctionCall:Type:Regular": 134,
+              "FunctionCall:Name:_disableInitializers": 12,
+              "FunctionDefinition:External": 175,
+              "UserDefinedTypeName:IERC20": 26,
+              "UserDefinedTypeName:IDisputeKit": 13,
+              "VariableDeclaration:Memory": 60,
+              ArrayTypeName: 50,
+              NumberLiteral: 253,
+              "UserDefinedTypeName:ISortitionModule": 7,
+              "FunctionCall:Name:__KlerosCoreBase_initialize": 2,
+              ModifierInvocation: 103,
+              BinaryOperation: 660,
+              "FunctionDefinition:View": 80,
+              "ContractDefinition:Abstract": 5,
+              "UserDefinedTypeName:IArbitratorV2": 6,
+              "UserDefinedTypeName:Initializable": 6,
+              "UserDefinedTypeName:UUPSProxiable": 6,
+              UsingForDeclaration: 3,
+              EnumDefinition: 4,
+              EnumValue: 20,
+              StructDefinition: 13,
+              Mapping: 24,
+              "UserDefinedTypeName:IArbitrableV2": 6,
+              "UserDefinedTypeName:Period": 2,
+              "UserDefinedTypeName:Round": 31,
+              "StateVariableDeclaration:Private": 6,
+              TupleExpression: 54,
+              "UserDefinedTypeName:Court": 9,
+              "UserDefinedTypeName:Dispute": 35,
+              "UserDefinedTypeName:CurrencyRate": 1,
+              EventDefinition: 43,
+              "VariableDeclaration:Indexed": 72,
+              ModifierDefinition: 19,
+              IfStatement: 164,
+              MemberAccess: 844,
+              RevertStatement: 53,
+              UnaryOperation: 54,
+              EmitStatement: 52,
+              "FunctionCall:Type:MemberAccess": 97,
+              "FunctionCall:Name:createTree": 3,
+              VariableDeclarationStatement: 217,
+              "VariableDeclaration:Storage": 91,
+              NewExpression: 3,
+              IndexAccess: 295,
+              "FunctionCall:Name:_enableDisputeKit": 4,
+              BooleanLiteral: 51,
+              NameValueExpression: 5,
+              NameValueList: 5,
+              ForStatement: 10,
+              "FunctionCall:Name:_setStake": 4,
+              "FunctionCall:Name:address": 28,
+              "FunctionCall:Name:safeTransfer": 6,
+              "FunctionDefinition:Payable": 10,
+              "FunctionCall:Name:arbitrationCost": 3,
+              ReturnStatement: 77,
+              "FunctionCall:Name:_createDispute": 5,
+              "VariableDeclaration:Calldata": 27,
+              "FunctionCall:Name:safeTransferFrom": 2,
+              "FunctionCall:Name:_extraDataToCourtIDMinJurorsDisputeKit": 2,
+              Conditional: 11,
+              "FunctionCall:Name:convertEthToTokenAmount": 2,
+              "FunctionCall:Name:_calculatePnkAtStake": 2,
+              "FunctionCall:Name:createDisputeHook": 2,
+              "FunctionCall:Name:createDispute": 2,
+              "FunctionCall:Name:areCommitsAllCast": 1,
+              "FunctionCall:Name:areVotesAllCast": 1,
+              "FunctionCall:Name:isAppealFunded": 1,
+              WhileStatement: 4,
+              "FunctionCall:Name:draw": 2,
+              ContinueStatement: 1,
+              "FunctionCall:Name:lockStake": 1,
+              "FunctionCall:Name:postDrawHook": 1,
+              "FunctionCall:Name:appealCost": 2,
+              "FunctionCall:Name:getCoherentCount": 1,
+              "FunctionCall:Name:_executePenalties": 1,
+              "FunctionCall:Name:_executeRewards": 1,
+              "UserDefinedTypeName:ExecuteParams": 2,
+              "FunctionCall:Name:getDegreeOfCoherence": 2,
+              "FunctionCall:Name:unlockStake": 2,
+              "FunctionCall:Name:penalizeStake": 1,
+              "FunctionCall:Name:isVoteActive": 1,
+              "FunctionCall:Name:setJurorInactive": 1,
+              "FunctionCall:Name:_transferFeeToken": 3,
+              "FunctionCall:Name:payable": 4,
+              "FunctionCall:Name:_applyCoherence": 3,
+              "FunctionCall:Name:currentRuling": 6,
+              "FunctionCall:Name:rule": 1,
+              "FunctionDefinition:Public": 17,
+              "FunctionCall:Name:safeSend": 3,
+              "FunctionDefinition:Pure": 13,
+              "UserDefinedTypeName:OnError": 3,
+              "FunctionCall:Name:_stakingFailed": 6,
+              "UserDefinedTypeName:StakingResult": 7,
+              "FunctionCall:Name:validateStake": 1,
+              "FunctionCall:Name:setStake": 1,
+              InlineAssemblyStatement: 12,
+              AssemblyBlock: 23,
+              AssemblyAssignment: 18,
+              AssemblyCall: 99,
+              "AssemblyCall:Name:mload": 12,
+              "AssemblyCall:Name:add": 16,
+              HexNumber: 23,
+              CustomErrorDefinition: 45,
+              "ImportDirective:Path:@openzeppelin/contracts/token/ERC721/IERC721.sol": 1,
+              "UserDefinedTypeName:IERC721": 3,
+              "FunctionCall:Name:balanceOf": 5,
+              "FunctionCall:Type:BuiltIn": 57,
+              "FunctionCall:Name:require": 51,
+              "UserDefinedTypeName:SortitionModuleBase": 2,
+              "UserDefinedTypeName:KlerosCore": 11,
+              "UserDefinedTypeName:IRNG": 9,
+              "FunctionCall:Name:__SortitionModuleBase_initialize": 2,
+              "UserDefinedTypeName:Phase": 2,
+              "StateVariableDeclaration:Default": 1,
+              "UserDefinedTypeName:SortitionSumTree": 6,
+              "UserDefinedTypeName:Juror": 8,
+              "UserDefinedTypeName:DelayedStake": 3,
+              "FunctionCall:Name:requestRandomness": 3,
+              "FunctionCall:Name:receiveRandomness": 2,
+              "FunctionCall:Name:_extraDataToTreeK": 1,
+              "FunctionCall:Name:setStakeBySortitionModule": 2,
+              "FunctionCall:Name:_validateStake": 2,
+              "FunctionCall:Name:stakeOf": 5,
+              BreakStatement: 2,
+              "FunctionCall:Name:_accountAndCourtIDToStakePathID": 2,
+              "FunctionCall:Name:_set": 1,
+              "FunctionCall:Name:courts": 3,
+              "FunctionCall:Name:getJurorLeftoverPNK": 2,
+              "FunctionCall:Name:getJurorCourtIDs": 1,
+              "FunctionCall:Name:transferBySortitionModule": 1,
+              "FunctionCall:Name:keccak256": 6,
+              "FunctionCall:Name:encodePacked": 2,
+              "FunctionCall:Name:_stakePathIDToAccount": 1,
+              "FunctionDefinition:Private": 2,
+              AssemblyLocalDefinition: 8,
+              AssemblyFor: 3,
+              "AssemblyCall:Name:lt": 3,
+              "AssemblyCall:Name:mstore8": 3,
+              "AssemblyCall:Name:byte": 3,
+              "FunctionCall:Name:_updateParents": 3,
+              "UserDefinedTypeName:IDisputeTemplateRegistry": 4,
+              "UserDefinedTypeName:DisputeStruct": 2,
+              "FunctionCall:Name:setDisputeTemplate": 1,
+              "UserDefinedTypeName:DisputeKitClassicBase": 5,
+              "FunctionCall:Name:__DisputeKitClassicBase_initialize": 5,
+              "UserDefinedTypeName:Vote": 4,
+              "FunctionCall:Name:getNumberOfRounds": 2,
+              "FunctionCall:Name:sortitionModule": 1,
+              "FunctionCall:Name:disputes": 7,
+              "FunctionCall:Name:_postDrawCheck": 4,
+              "FunctionCall:Name:_castCommit": 3,
+              "UserDefinedTypeName:KlerosCore.Period": 3,
+              "FunctionCall:Name:_castVote": 3,
+              "FunctionCall:Name:hashVote": 1,
+              "FunctionCall:Name:appealPeriod": 2,
+              "FunctionCall:Name:isDisputeKitJumping": 1,
+              "FunctionCall:Name:getNumberOfVotes": 1,
+              "FunctionCall:Name:paused": 1,
+              "FunctionCall:Name:getFundedChoices": 2,
+              "ContractDefinition:Interface": 13,
+              "AssemblyCall:Name:and": 4,
+              "AssemblyCall:Name:shr": 2,
+              DecimalNumber: 14,
+              "FunctionCall:Name:extraDataToTokenInfo": 1,
+              "FunctionCall:Type:ContractTypecast": 6,
+              "FunctionCall:Name:encode": 2,
+              "FunctionCall:Name:_extraDataToTokenInfo": 1,
+              "UserDefinedTypeName:IProofOfHumanity": 2,
+              "FunctionCall:Name:isRegistered": 1,
+              "UserDefinedTypeName:IEvidence": 1,
+              "Pragma:solidity:>=0.8.0_<0.9.0": 7,
+              "ImportDirective:Path:@openzeppelin/contracts/token/ERC20/IERC20.sol": 3,
+              FileLevelConstant: 8,
+              "ContractDefinition:Library": 2,
+              "FunctionCall:Name:approve": 1,
+              "FunctionCall:Name:allowance": 1,
+              "FunctionCall:Name:call": 2,
+              "FunctionCall:Name:encodeCall": 2,
+              "FunctionCall:Name:decode": 2,
+              "FunctionCall:Name:send": 1,
+              "FunctionCall:Name:transfer": 1,
+              "FunctionCall:Name:blockhash": 1,
+              "ImportDirective:Path:@chainlink/contracts/src/v0.8/vrf/dev/VRFConsumerBaseV2Plus.sol": 1,
+              "ImportDirective:Path:@chainlink/contracts/src/v0.8/vrf/dev/libraries/VRFV2PlusClient.sol": 1,
+              "UserDefinedTypeName:VRFConsumerBaseV2Plus": 1,
+              "FunctionCall:Name:requestRandomWords": 1,
+              "FunctionCall:Name:RandomWordsRequest": 1,
+              "FunctionCall:Name:_argsToBytes": 1,
+              "FunctionCall:Name:ExtraArgsV1": 1,
+              "FunctionCall:Name:_authorizeUpgrade": 1,
+              "FunctionCall:Name:_getImplementation": 3,
+              TryStatement: 1,
+              "FunctionCall:Name:proxiableUUID": 1,
+              "AssemblyCall:Name:sstore": 2,
+              "FunctionCall:Name:delegatecall": 2,
+              CatchClause: 1,
+              "AssemblyCall:Name:sload": 2,
+              "AssemblyCall:Name:calldatacopy": 1,
+              "AssemblyCall:Name:calldatasize": 2,
+              "AssemblyCall:Name:delegatecall": 1,
+              "AssemblyCall:Name:gas": 1,
+              "AssemblyCall:Name:returndatacopy": 1,
+              "AssemblyCall:Name:returndatasize": 3,
+              AssemblySwitch: 1,
+              AssemblyCase: 2,
+              "AssemblyCall:Name:revert": 1,
+              "AssemblyCall:Name:return": 1,
+              "FunctionCall:Name:_delegate": 2,
+              "UserDefinedTypeName:InitializableStorage": 4,
+              "FunctionCall:Name:_getInitializableStorage": 5,
+              "FunctionCall:Name:_checkInitializing": 1,
+              "FunctionCall:Name:_isInitializing": 1,
+              "FunctionCall:Name:type": 3,
+              AssemblyMemberAccess: 1,
+            },
+            sloc: {
+              total: 5124,
+              source: 2839,
+              comment: 1784,
+              single: 1622,
+              block: 162,
+              mixed: 175,
+              empty: 676,
+              todo: 2,
+              blockEmpty: 0,
+              commentToSourceRatio: 0.6283902782669955,
+            },
+            nsloc: {
+              total: 4587,
+              source: 2437,
+              comment: 1687,
+              single: 1529,
+              block: 158,
+              mixed: 171,
+              empty: 634,
+              todo: 2,
+              blockEmpty: 0,
+              commentToSourceRatio: 0.6922445629872794,
+            },
+            complexity: { perceivedNaiveScore: 1667 },
+            summary: {
+              perceivedComplexity: 6,
+              size: 4,
+              numLogicContracts: 3,
+              numFiles: 4,
+              interfaceRisk: 6,
+              inlineDocumentation: 1,
+              compilerFeatures: 2,
+              compilerVersion: 1,
+            },
+            num: {
+              astStatements: 14132,
+              contractDefinitions: 36,
+              contracts: 16,
+              libraries: 2,
+              interfaces: 13,
+              abstract: 5,
+              imports: 51,
+              functionsPublic: 192,
+              functionsPayable: 10,
+              assemblyBlocks: 12,
+              stateVars: 87,
+              stateVarsPublic: 80,
+            },
+            capabilities: {
+              solidityVersions: ["^0.8.24", ">=0.8.0 <0.9.0"],
+              assembly: true,
+              experimental: [],
+              canReceiveFunds: true,
+              destroyable: false,
+              explicitValueTransfer: 1,
+              lowLevelCall: false,
+              hashFuncs: true,
+              ecrecover: false,
+              deploysContract: false,
+              uncheckedBlocks: false,
+              tryCatchBlocks: true,
+              delegateCall: true,
+            },
+            other: {
+              doppelganger: [
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+                {},
+              ],
+            },
+          },
+          avg: {
+            ast: {
+              SourceUnit: 1,
+              PragmaDirective: 1,
+              "Pragma:solidity:^0.8.24": 0.7741935483870968,
+              ImportDirective: 1.6451612903225807,
+              StringLiteral: 4.193548387096774,
+              Identifier: 122.16129032258064,
+              ContractDefinition: 1.1612903225806452,
+              "ContractDefinition:Contract": 0.5161290322580645,
+              "ContractDefinition:BaseContracts": 0.967741935483871,
+              InheritanceSpecifier: 0.967741935483871,
+              UserDefinedTypeName: 7.483870967741935,
+              "UserDefinedTypeName:KlerosCoreBase": 0.06451612903225806,
+              StateVariableDeclaration: 2.806451612903226,
+              VariableDeclaration: 38.903225806451616,
+              "StateVariableDeclaration:Public": 2.5806451612903225,
+              "StateVariableDeclaration:Const": 0.6774193548387096,
+              ElementaryTypeName: 34.645161290322584,
+              FunctionDefinition: 8.548387096774194,
+              "FunctionDefinition:Internal": 7,
+              "FunctionDefinition:Default": 0.5161290322580645,
+              Block: 13,
+              ExpressionStatement: 14.741935483870968,
+              FunctionCall: 15.35483870967742,
+              "FunctionCall:Type:Regular": 4.32258064516129,
+              "FunctionCall:Name:_disableInitializers": 0.3870967741935484,
+              "FunctionDefinition:External": 5.645161290322581,
+              "UserDefinedTypeName:IERC20": 0.8387096774193549,
+              "UserDefinedTypeName:IDisputeKit": 0.41935483870967744,
+              "VariableDeclaration:Memory": 1.935483870967742,
+              ArrayTypeName: 1.6129032258064515,
+              NumberLiteral: 8.161290322580646,
+              "UserDefinedTypeName:ISortitionModule": 0.22580645161290322,
+              "FunctionCall:Name:__KlerosCoreBase_initialize": 0.06451612903225806,
+              ModifierInvocation: 3.3225806451612905,
+              BinaryOperation: 21.29032258064516,
+              "FunctionDefinition:View": 2.5806451612903225,
+              "ContractDefinition:Abstract": 0.16129032258064516,
+              "UserDefinedTypeName:IArbitratorV2": 0.1935483870967742,
+              "UserDefinedTypeName:Initializable": 0.1935483870967742,
+              "UserDefinedTypeName:UUPSProxiable": 0.1935483870967742,
+              UsingForDeclaration: 0.0967741935483871,
+              EnumDefinition: 0.12903225806451613,
+              EnumValue: 0.6451612903225806,
+              StructDefinition: 0.41935483870967744,
+              Mapping: 0.7741935483870968,
+              "UserDefinedTypeName:IArbitrableV2": 0.1935483870967742,
+              "UserDefinedTypeName:Period": 0.06451612903225806,
+              "UserDefinedTypeName:Round": 1,
+              "StateVariableDeclaration:Private": 0.1935483870967742,
+              TupleExpression: 1.7419354838709677,
+              "UserDefinedTypeName:Court": 0.2903225806451613,
+              "UserDefinedTypeName:Dispute": 1.1290322580645162,
+              "UserDefinedTypeName:CurrencyRate": 0.03225806451612903,
+              EventDefinition: 1.3870967741935485,
+              "VariableDeclaration:Indexed": 2.3225806451612905,
+              ModifierDefinition: 0.6129032258064516,
+              IfStatement: 5.290322580645161,
+              MemberAccess: 27.225806451612904,
+              RevertStatement: 1.7096774193548387,
+              UnaryOperation: 1.7419354838709677,
+              EmitStatement: 1.6774193548387097,
+              "FunctionCall:Type:MemberAccess": 3.129032258064516,
+              "FunctionCall:Name:createTree": 0.0967741935483871,
+              VariableDeclarationStatement: 7,
+              "VariableDeclaration:Storage": 2.935483870967742,
+              NewExpression: 0.0967741935483871,
+              IndexAccess: 9.516129032258064,
+              "FunctionCall:Name:_enableDisputeKit": 0.12903225806451613,
+              BooleanLiteral: 1.6451612903225807,
+              NameValueExpression: 0.16129032258064516,
+              NameValueList: 0.16129032258064516,
+              ForStatement: 0.3225806451612903,
+              "FunctionCall:Name:_setStake": 0.12903225806451613,
+              "FunctionCall:Name:address": 0.9032258064516129,
+              "FunctionCall:Name:safeTransfer": 0.1935483870967742,
+              "FunctionDefinition:Payable": 0.3225806451612903,
+              "FunctionCall:Name:arbitrationCost": 0.0967741935483871,
+              ReturnStatement: 2.4838709677419355,
+              "FunctionCall:Name:_createDispute": 0.16129032258064516,
+              "VariableDeclaration:Calldata": 0.8709677419354839,
+              "FunctionCall:Name:safeTransferFrom": 0.06451612903225806,
+              "FunctionCall:Name:_extraDataToCourtIDMinJurorsDisputeKit": 0.06451612903225806,
+              Conditional: 0.3548387096774194,
+              "FunctionCall:Name:convertEthToTokenAmount": 0.06451612903225806,
+              "FunctionCall:Name:_calculatePnkAtStake": 0.06451612903225806,
+              "FunctionCall:Name:createDisputeHook": 0.06451612903225806,
+              "FunctionCall:Name:createDispute": 0.06451612903225806,
+              "FunctionCall:Name:areCommitsAllCast": 0.03225806451612903,
+              "FunctionCall:Name:areVotesAllCast": 0.03225806451612903,
+              "FunctionCall:Name:isAppealFunded": 0.03225806451612903,
+              WhileStatement: 0.12903225806451613,
+              "FunctionCall:Name:draw": 0.06451612903225806,
+              ContinueStatement: 0.03225806451612903,
+              "FunctionCall:Name:lockStake": 0.03225806451612903,
+              "FunctionCall:Name:postDrawHook": 0.03225806451612903,
+              "FunctionCall:Name:appealCost": 0.06451612903225806,
+              "FunctionCall:Name:getCoherentCount": 0.03225806451612903,
+              "FunctionCall:Name:_executePenalties": 0.03225806451612903,
+              "FunctionCall:Name:_executeRewards": 0.03225806451612903,
+              "UserDefinedTypeName:ExecuteParams": 0.06451612903225806,
+              "FunctionCall:Name:getDegreeOfCoherence": 0.06451612903225806,
+              "FunctionCall:Name:unlockStake": 0.06451612903225806,
+              "FunctionCall:Name:penalizeStake": 0.03225806451612903,
+              "FunctionCall:Name:isVoteActive": 0.03225806451612903,
+              "FunctionCall:Name:setJurorInactive": 0.03225806451612903,
+              "FunctionCall:Name:_transferFeeToken": 0.0967741935483871,
+              "FunctionCall:Name:payable": 0.12903225806451613,
+              "FunctionCall:Name:_applyCoherence": 0.0967741935483871,
+              "FunctionCall:Name:currentRuling": 0.1935483870967742,
+              "FunctionCall:Name:rule": 0.03225806451612903,
+              "FunctionDefinition:Public": 0.5483870967741935,
+              "FunctionCall:Name:safeSend": 0.0967741935483871,
+              "FunctionDefinition:Pure": 0.41935483870967744,
+              "UserDefinedTypeName:OnError": 0.0967741935483871,
+              "FunctionCall:Name:_stakingFailed": 0.1935483870967742,
+              "UserDefinedTypeName:StakingResult": 0.22580645161290322,
+              "FunctionCall:Name:validateStake": 0.03225806451612903,
+              "FunctionCall:Name:setStake": 0.03225806451612903,
+              InlineAssemblyStatement: 0.3870967741935484,
+              AssemblyBlock: 0.7419354838709677,
+              AssemblyAssignment: 0.5806451612903226,
+              AssemblyCall: 3.193548387096774,
+              "AssemblyCall:Name:mload": 0.3870967741935484,
+              "AssemblyCall:Name:add": 0.5161290322580645,
+              HexNumber: 0.7419354838709677,
+              CustomErrorDefinition: 1.4516129032258065,
+              "ImportDirective:Path:@openzeppelin/contracts/token/ERC721/IERC721.sol": 0.03225806451612903,
+              "UserDefinedTypeName:IERC721": 0.0967741935483871,
+              "FunctionCall:Name:balanceOf": 0.16129032258064516,
+              "FunctionCall:Type:BuiltIn": 1.8387096774193548,
+              "FunctionCall:Name:require": 1.6451612903225807,
+              "UserDefinedTypeName:SortitionModuleBase": 0.06451612903225806,
+              "UserDefinedTypeName:KlerosCore": 0.3548387096774194,
+              "UserDefinedTypeName:IRNG": 0.2903225806451613,
+              "FunctionCall:Name:__SortitionModuleBase_initialize": 0.06451612903225806,
+              "UserDefinedTypeName:Phase": 0.06451612903225806,
+              "StateVariableDeclaration:Default": 0.03225806451612903,
+              "UserDefinedTypeName:SortitionSumTree": 0.1935483870967742,
+              "UserDefinedTypeName:Juror": 0.25806451612903225,
+              "UserDefinedTypeName:DelayedStake": 0.0967741935483871,
+              "FunctionCall:Name:requestRandomness": 0.0967741935483871,
+              "FunctionCall:Name:receiveRandomness": 0.06451612903225806,
+              "FunctionCall:Name:_extraDataToTreeK": 0.03225806451612903,
+              "FunctionCall:Name:setStakeBySortitionModule": 0.06451612903225806,
+              "FunctionCall:Name:_validateStake": 0.06451612903225806,
+              "FunctionCall:Name:stakeOf": 0.16129032258064516,
+              BreakStatement: 0.06451612903225806,
+              "FunctionCall:Name:_accountAndCourtIDToStakePathID": 0.06451612903225806,
+              "FunctionCall:Name:_set": 0.03225806451612903,
+              "FunctionCall:Name:courts": 0.0967741935483871,
+              "FunctionCall:Name:getJurorLeftoverPNK": 0.06451612903225806,
+              "FunctionCall:Name:getJurorCourtIDs": 0.03225806451612903,
+              "FunctionCall:Name:transferBySortitionModule": 0.03225806451612903,
+              "FunctionCall:Name:keccak256": 0.1935483870967742,
+              "FunctionCall:Name:encodePacked": 0.06451612903225806,
+              "FunctionCall:Name:_stakePathIDToAccount": 0.03225806451612903,
+              "FunctionDefinition:Private": 0.06451612903225806,
+              AssemblyLocalDefinition: 0.25806451612903225,
+              AssemblyFor: 0.0967741935483871,
+              "AssemblyCall:Name:lt": 0.0967741935483871,
+              "AssemblyCall:Name:mstore8": 0.0967741935483871,
+              "AssemblyCall:Name:byte": 0.0967741935483871,
+              "FunctionCall:Name:_updateParents": 0.0967741935483871,
+              "UserDefinedTypeName:IDisputeTemplateRegistry": 0.12903225806451613,
+              "UserDefinedTypeName:DisputeStruct": 0.06451612903225806,
+              "FunctionCall:Name:setDisputeTemplate": 0.03225806451612903,
+              "UserDefinedTypeName:DisputeKitClassicBase": 0.16129032258064516,
+              "FunctionCall:Name:__DisputeKitClassicBase_initialize": 0.16129032258064516,
+              "UserDefinedTypeName:Vote": 0.12903225806451613,
+              "FunctionCall:Name:getNumberOfRounds": 0.06451612903225806,
+              "FunctionCall:Name:sortitionModule": 0.03225806451612903,
+              "FunctionCall:Name:disputes": 0.22580645161290322,
+              "FunctionCall:Name:_postDrawCheck": 0.12903225806451613,
+              "FunctionCall:Name:_castCommit": 0.0967741935483871,
+              "UserDefinedTypeName:KlerosCore.Period": 0.0967741935483871,
+              "FunctionCall:Name:_castVote": 0.0967741935483871,
+              "FunctionCall:Name:hashVote": 0.03225806451612903,
+              "FunctionCall:Name:appealPeriod": 0.06451612903225806,
+              "FunctionCall:Name:isDisputeKitJumping": 0.03225806451612903,
+              "FunctionCall:Name:getNumberOfVotes": 0.03225806451612903,
+              "FunctionCall:Name:paused": 0.03225806451612903,
+              "FunctionCall:Name:getFundedChoices": 0.06451612903225806,
+              "ContractDefinition:Interface": 0.41935483870967744,
+              "AssemblyCall:Name:and": 0.12903225806451613,
+              "AssemblyCall:Name:shr": 0.06451612903225806,
+              DecimalNumber: 0.45161290322580644,
+              "FunctionCall:Name:extraDataToTokenInfo": 0.03225806451612903,
+              "FunctionCall:Type:ContractTypecast": 0.1935483870967742,
+              "FunctionCall:Name:encode": 0.06451612903225806,
+              "FunctionCall:Name:_extraDataToTokenInfo": 0.03225806451612903,
+              "UserDefinedTypeName:IProofOfHumanity": 0.06451612903225806,
+              "FunctionCall:Name:isRegistered": 0.03225806451612903,
+              "UserDefinedTypeName:IEvidence": 0.03225806451612903,
+              "Pragma:solidity:>=0.8.0_<0.9.0": 0.22580645161290322,
+              "ImportDirective:Path:@openzeppelin/contracts/token/ERC20/IERC20.sol": 0.0967741935483871,
+              FileLevelConstant: 0.25806451612903225,
+              "ContractDefinition:Library": 0.06451612903225806,
+              "FunctionCall:Name:approve": 0.03225806451612903,
+              "FunctionCall:Name:allowance": 0.03225806451612903,
+              "FunctionCall:Name:call": 0.06451612903225806,
+              "FunctionCall:Name:encodeCall": 0.06451612903225806,
+              "FunctionCall:Name:decode": 0.06451612903225806,
+              "FunctionCall:Name:send": 0.03225806451612903,
+              "FunctionCall:Name:transfer": 0.03225806451612903,
+              "FunctionCall:Name:blockhash": 0.03225806451612903,
+              "ImportDirective:Path:@chainlink/contracts/src/v0.8/vrf/dev/VRFConsumerBaseV2Plus.sol": 0.03225806451612903,
+              "ImportDirective:Path:@chainlink/contracts/src/v0.8/vrf/dev/libraries/VRFV2PlusClient.sol": 0.03225806451612903,
+              "UserDefinedTypeName:VRFConsumerBaseV2Plus": 0.03225806451612903,
+              "FunctionCall:Name:requestRandomWords": 0.03225806451612903,
+              "FunctionCall:Name:RandomWordsRequest": 0.03225806451612903,
+              "FunctionCall:Name:_argsToBytes": 0.03225806451612903,
+              "FunctionCall:Name:ExtraArgsV1": 0.03225806451612903,
+              "FunctionCall:Name:_authorizeUpgrade": 0.03225806451612903,
+              "FunctionCall:Name:_getImplementation": 0.0967741935483871,
+              TryStatement: 0.03225806451612903,
+              "FunctionCall:Name:proxiableUUID": 0.03225806451612903,
+              "AssemblyCall:Name:sstore": 0.06451612903225806,
+              "FunctionCall:Name:delegatecall": 0.06451612903225806,
+              CatchClause: 0.03225806451612903,
+              "AssemblyCall:Name:sload": 0.06451612903225806,
+              "AssemblyCall:Name:calldatacopy": 0.03225806451612903,
+              "AssemblyCall:Name:calldatasize": 0.06451612903225806,
+              "AssemblyCall:Name:delegatecall": 0.03225806451612903,
+              "AssemblyCall:Name:gas": 0.03225806451612903,
+              "AssemblyCall:Name:returndatacopy": 0.03225806451612903,
+              "AssemblyCall:Name:returndatasize": 0.0967741935483871,
+              AssemblySwitch: 0.03225806451612903,
+              AssemblyCase: 0.06451612903225806,
+              "AssemblyCall:Name:revert": 0.03225806451612903,
+              "AssemblyCall:Name:return": 0.03225806451612903,
+              "FunctionCall:Name:_delegate": 0.06451612903225806,
+              "UserDefinedTypeName:InitializableStorage": 0.12903225806451613,
+              "FunctionCall:Name:_getInitializableStorage": 0.16129032258064516,
+              "FunctionCall:Name:_checkInitializing": 0.03225806451612903,
+              "FunctionCall:Name:_isInitializing": 0.03225806451612903,
+              "FunctionCall:Name:type": 0.0967741935483871,
+              AssemblyMemberAccess: 0.03225806451612903,
+            },
+            sloc: {
+              total: 165.29032258064515,
+              source: 91.58064516129032,
+              comment: 57.54838709677419,
+              single: 52.32258064516129,
+              block: 5.225806451612903,
+              mixed: 5.645161290322581,
+              empty: 21.806451612903224,
+              todo: 0.06451612903225806,
+              blockEmpty: 0,
+              commentToSourceRatio: 0.9784907999489301,
+            },
+            nsloc: {
+              total: 147.96774193548387,
+              source: 78.61290322580645,
+              comment: 54.41935483870968,
+              single: 49.32258064516129,
+              block: 5.096774193548387,
+              mixed: 5.516129032258065,
+              empty: 20.451612903225808,
+              todo: 0.06451612903225806,
+              blockEmpty: 0,
+              commentToSourceRatio: 1.1404911436132485,
+            },
+            complexity: { perceivedNaiveScore: 53.77419354838709 },
+            summary: {
+              perceivedComplexity: 2,
+              size: 1,
+              numLogicContracts: 1,
+              numFiles: 0.12903225806451613,
+              interfaceRisk: 2,
+              inlineDocumentation: 1,
+              compilerFeatures: 1,
+              compilerVersion: 1,
+            },
+            num: {
+              astStatements: 455.8709677419355,
+              contractDefinitions: 1.1612903225806452,
+              contracts: 0.5161290322580645,
+              libraries: 0.06451612903225806,
+              interfaces: 0.41935483870967744,
+              abstract: 0.16129032258064516,
+              imports: 1.6451612903225807,
+              functionsPublic: 6.193548387096774,
+              functionsPayable: 0.3225806451612903,
+              assemblyBlocks: 0.3870967741935484,
+              stateVars: 2.806451612903226,
+              stateVarsPublic: 2.5806451612903225,
+            },
+            capabilities: {
+              explicitValueTransfer: 0.03225806451612903,
+              assembly: true,
+              canReceiveFunds: true,
+              destroyable: false,
+              lowLevelCall: false,
+              delegateCall: true,
+              hashFuncs: true,
+              ecrecover: false,
+              deploysContract: false,
+              tryCatchBlocks: true,
+              uncheckedBlocks: false,
+            },
+            other: {},
+          },
+          num: { sourceUnits: 31, metrics: 31, duplicates: 0, errors: 0 },
+          other: {
+            deployableContracts: [
+              "KlerosCore",
+              "KlerosCoreNeo",
+              "PolicyRegistry",
+              "SortitionModule",
+              "SortitionModuleNeo",
+              "DisputeResolver",
+              "DisputeTemplateRegistry",
+              "DisputeKitClassic",
+              "DisputeKitGated",
+              "DisputeKitGatedShutter",
+              "DisputeKitShutter",
+              "DisputeKitSybilResistant",
+              "EvidenceModule",
+              "RNGWithFallback",
+              "ChainlinkRNG",
+              "UUPSProxy",
+            ],
+          },
+        },
+        dotGraphs: {
+          "#surya-inheritance":
+            'digraph G {\n  graph [ ratio = "auto", page = "40" ];\n  "KlerosCore";\n  "KlerosCoreBase";\n  "IArbitratorV2";\n  "Initializable";\n  "UUPSProxiable";\n  "KlerosCoreNeo";\n  "PolicyRegistry";\n  "SortitionModule";\n  "SortitionModuleBase";\n  "ISortitionModule";\n  "SortitionModuleNeo";\n  "DisputeResolver";\n  "IArbitrableV2";\n  "DisputeTemplateRegistry";\n  "IDisputeTemplateRegistry";\n  "DisputeKitClassic";\n  "DisputeKitClassicBase";\n  "IDisputeKit";\n  "IBalanceHolder";\n  "IBalanceHolderERC1155";\n  "DisputeKitGated";\n  "DisputeKitGatedShutter";\n  "DisputeKitShutter";\n  "IProofOfHumanity";\n  "DisputeKitSybilResistant";\n  "EvidenceModule";\n  "IEvidence";\n  "SafeERC20";\n  "WethLike";\n  "SafeSend";\n  "RNGWithFallback";\n  "IRNG";\n  "ChainlinkRNG";\n  "VRFConsumerBaseV2Plus";\n  "UUPSProxy";\n  "KlerosCore" -> "KlerosCoreBase";\n  "KlerosCoreBase" -> "IArbitratorV2";\n  "KlerosCoreBase" -> "Initializable";\n  "KlerosCoreBase" -> "UUPSProxiable";\n  "KlerosCoreNeo" -> "KlerosCoreBase";\n  "PolicyRegistry" -> "UUPSProxiable";\n  "PolicyRegistry" -> "Initializable";\n  "SortitionModule" -> "SortitionModuleBase";\n  "SortitionModuleBase" -> "ISortitionModule";\n  "SortitionModuleBase" -> "Initializable";\n  "SortitionModuleBase" -> "UUPSProxiable";\n  "SortitionModuleNeo" -> "SortitionModuleBase";\n  "DisputeResolver" -> "IArbitrableV2";\n  "DisputeTemplateRegistry" -> "IDisputeTemplateRegistry";\n  "DisputeTemplateRegistry" -> "UUPSProxiable";\n  "DisputeTemplateRegistry" -> "Initializable";\n  "DisputeKitClassic" -> "DisputeKitClassicBase";\n  "DisputeKitClassicBase" -> "IDisputeKit";\n  "DisputeKitClassicBase" -> "Initializable";\n  "DisputeKitClassicBase" -> "UUPSProxiable";\n  "DisputeKitGated" -> "DisputeKitClassicBase";\n  "DisputeKitGatedShutter" -> "DisputeKitClassicBase";\n  "DisputeKitShutter" -> "DisputeKitClassicBase";\n  "DisputeKitSybilResistant" -> "DisputeKitClassicBase";\n  "EvidenceModule" -> "IEvidence";\n  "EvidenceModule" -> "Initializable";\n  "EvidenceModule" -> "UUPSProxiable";\n  "RNGWithFallback" -> "IRNG";\n  "ChainlinkRNG" -> "IRNG";\n  "ChainlinkRNG" -> "VRFConsumerBaseV2Plus";\n}\n',
+          "#surya-callgraph":
+            'digraph G {\n  graph [ ratio = "auto", page = "100", compound =true ];\nsubgraph "clusterKlerosCore" {\n  graph [ label = "KlerosCore", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "KlerosCore.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "KlerosCore.initialize" [ label = "initialize", color = "blue" ];\n  "KlerosCore.reinitialize" [ label = "reinitialize", color = "blue" ];\n  "KlerosCore._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "KlerosCore._disableInitializers" [ label = "_disableInitializers" ];\n  "KlerosCore.__KlerosCoreBase_initialize" [ label = "__KlerosCoreBase_initialize" ];\n  "KlerosCore.courts" [ label = "courts" ];\n  "KlerosCore.getNumberOfRounds" [ label = "getNumberOfRounds" ];\n  "KlerosCore.sortitionModule" [ label = "sortitionModule" ];\n  "KlerosCore.disputes" [ label = "disputes" ];\n  "KlerosCore.appealPeriod" [ label = "appealPeriod" ];\n  "KlerosCore.isDisputeKitJumping" [ label = "isDisputeKitJumping" ];\n  "KlerosCore.getNumberOfVotes" [ label = "getNumberOfVotes" ];\n  "KlerosCore.paused" [ label = "paused" ];\n}\n\nsubgraph "clusterKlerosCoreBase" {\n  graph [ label = "KlerosCoreBase", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "KlerosCoreBase.onlyByGovernor" [ label = "onlyByGovernor", color = "yellow" ];\n  "KlerosCoreBase.onlyByGuardianOrGovernor" [ label = "onlyByGuardianOrGovernor", color = "yellow" ];\n  "KlerosCoreBase.whenPaused" [ label = "whenPaused", color = "yellow" ];\n  "KlerosCoreBase.whenNotPaused" [ label = "whenNotPaused", color = "yellow" ];\n  "KlerosCoreBase.__KlerosCoreBase_initialize" [ label = "__KlerosCoreBase_initialize", color = "white" ];\n  "KlerosCoreBase.pause" [ label = "pause", color = "blue" ];\n  "KlerosCoreBase.unpause" [ label = "unpause", color = "blue" ];\n  "KlerosCoreBase.executeGovernorProposal" [ label = "executeGovernorProposal", color = "blue" ];\n  "KlerosCoreBase.changeGovernor" [ label = "changeGovernor", color = "blue" ];\n  "KlerosCoreBase.changeGuardian" [ label = "changeGuardian", color = "blue" ];\n  "KlerosCoreBase.changePinakion" [ label = "changePinakion", color = "blue" ];\n  "KlerosCoreBase.changeJurorProsecutionModule" [ label = "changeJurorProsecutionModule", color = "blue" ];\n  "KlerosCoreBase.changeSortitionModule" [ label = "changeSortitionModule", color = "blue" ];\n  "KlerosCoreBase.addNewDisputeKit" [ label = "addNewDisputeKit", color = "blue" ];\n  "KlerosCoreBase.createCourt" [ label = "createCourt", color = "blue" ];\n  "KlerosCoreBase.changeCourtParameters" [ label = "changeCourtParameters", color = "blue" ];\n  "KlerosCoreBase.enableDisputeKits" [ label = "enableDisputeKits", color = "blue" ];\n  "KlerosCoreBase.changeAcceptedFeeTokens" [ label = "changeAcceptedFeeTokens", color = "blue" ];\n  "KlerosCoreBase.changeCurrencyRates" [ label = "changeCurrencyRates", color = "blue" ];\n  "KlerosCoreBase.setStake" [ label = "setStake", color = "blue" ];\n  "KlerosCoreBase.setStakeBySortitionModule" [ label = "setStakeBySortitionModule", color = "blue" ];\n  "KlerosCoreBase.transferBySortitionModule" [ label = "transferBySortitionModule", color = "blue" ];\n  "KlerosCoreBase.createDispute" [ label = "createDispute", color = "blue" ];\n  "KlerosCoreBase._createDispute" [ label = "_createDispute" ];\n  "KlerosCoreBase.passPeriod" [ label = "passPeriod", color = "blue" ];\n  "KlerosCoreBase.draw" [ label = "draw", color = "blue" ];\n  "KlerosCoreBase.appeal" [ label = "appeal", color = "blue" ];\n  "KlerosCoreBase.execute" [ label = "execute", color = "blue" ];\n  "KlerosCoreBase._executePenalties" [ label = "_executePenalties" ];\n  "KlerosCoreBase._executeRewards" [ label = "_executeRewards" ];\n  "KlerosCoreBase.executeRuling" [ label = "executeRuling", color = "blue" ];\n  "KlerosCoreBase.arbitrationCost" [ label = "arbitrationCost" ];\n  "KlerosCoreBase.appealCost" [ label = "appealCost" ];\n  "KlerosCoreBase.appealPeriod" [ label = "appealPeriod", color = "blue" ];\n  "KlerosCoreBase.currentRuling" [ label = "currentRuling" ];\n  "KlerosCoreBase.getRoundInfo" [ label = "getRoundInfo", color = "blue" ];\n  "KlerosCoreBase.getPnkAtStakePerJuror" [ label = "getPnkAtStakePerJuror", color = "blue" ];\n  "KlerosCoreBase.getNumberOfRounds" [ label = "getNumberOfRounds", color = "blue" ];\n  "KlerosCoreBase.isSupported" [ label = "isSupported", color = "blue" ];\n  "KlerosCoreBase.getTimesPerPeriod" [ label = "getTimesPerPeriod", color = "blue" ];\n  "KlerosCoreBase.getNumberOfVotes" [ label = "getNumberOfVotes", color = "blue" ];\n  "KlerosCoreBase.isDisputeKitJumping" [ label = "isDisputeKitJumping", color = "blue" ];\n  "KlerosCoreBase.getDisputeKitsLength" [ label = "getDisputeKitsLength", color = "blue" ];\n  "KlerosCoreBase.convertEthToTokenAmount" [ label = "convertEthToTokenAmount" ];\n  "KlerosCoreBase._transferFeeToken" [ label = "_transferFeeToken" ];\n  "KlerosCoreBase._applyCoherence" [ label = "_applyCoherence" ];\n  "KlerosCoreBase._calculatePnkAtStake" [ label = "_calculatePnkAtStake" ];\n  "KlerosCoreBase._enableDisputeKit" [ label = "_enableDisputeKit" ];\n  "KlerosCoreBase._setStake" [ label = "_setStake" ];\n  "KlerosCoreBase._stakingFailed" [ label = "_stakingFailed" ];\n  "KlerosCoreBase._extraDataToCourtIDMinJurorsDisputeKit" [ label = "_extraDataToCourtIDMinJurorsDisputeKit" ];\n  "KlerosCoreBase.GovernorOnly" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.GuardianOrGovernorOnly" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.WhenPausedOnly" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.WhenNotPausedOnly" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.UnsuccessfulCall" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.MinStakeLowerThanParentCourt" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.UnsupportedDisputeKit" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.InvalidForkingCourtAsParent" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.WrongDisputeKitIndex" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.MustSupportDisputeKitClassic" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.CannotDisableClassicDK" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.address" [ label = "address" ];\n  "KlerosCoreBase.SortitionModuleOnly" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.ArbitrationFeesNotEnough" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.TokenNotAccepted" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.TransferFailed" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.DisputeKitNotSupportedByCourt" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.IERC20" [ label = "IERC20" ];\n  "KlerosCoreBase.EvidenceNotPassedAndNotAppeal" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.DisputeStillDrawing" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.CommitPeriodNotPassed" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.VotePeriodNotPassed" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.AppealPeriodNotPassed" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.DisputePeriodIsFinal" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.NotEvidencePeriod" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.AppealFeesNotEnough" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.DisputeNotAppealable" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.DisputeKitOnly" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.NotExecutionPeriod" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.payable" [ label = "payable" ];\n  "KlerosCoreBase.RulingAlreadyExecuted" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.StakingTransferFailed" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.UnstakingTransferFailed" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.StakingInTooManyCourts" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.StakingNotPossibleInThisCourt" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.StakingLessThanCourtMinStake" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.StakingZeroWhenNoStake" [ color = "brown2", shape =box ];\n}\n\nsubgraph "clusterKlerosCoreNeo" {\n  graph [ label = "KlerosCoreNeo", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "KlerosCoreNeo.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "KlerosCoreNeo.initialize" [ label = "initialize", color = "blue" ];\n  "KlerosCoreNeo.reinitialize" [ label = "reinitialize", color = "blue" ];\n  "KlerosCoreNeo._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "KlerosCoreNeo.changeJurorNft" [ label = "changeJurorNft", color = "blue" ];\n  "KlerosCoreNeo.changeArbitrableWhitelist" [ label = "changeArbitrableWhitelist", color = "blue" ];\n  "KlerosCoreBase.setStake" [ label = "setStake", color = "blue" ];\n  "KlerosCoreBase._createDispute" [ label = "_createDispute", color = "white" ];\n  "KlerosCoreBase._stakingFailed" [ label = "_stakingFailed", color = "white" ];\n  "KlerosCoreNeo._disableInitializers" [ label = "_disableInitializers" ];\n  "KlerosCoreNeo.NotEligibleForStaking" [ color = "brown2", shape =box ];\n  "KlerosCoreNeo.ArbitrableNotWhitelisted" [ color = "brown2", shape =box ];\n  "KlerosCoreNeo.StakingMoreThanMaxStakePerJuror" [ color = "brown2", shape =box ];\n  "KlerosCoreNeo.StakingMoreThanMaxTotalStaked" [ color = "brown2", shape =box ];\n}\n\nsubgraph "clusterPolicyRegistry" {\n  graph [ label = "PolicyRegistry", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "PolicyRegistry.onlyByGovernor" [ label = "onlyByGovernor", color = "yellow" ];\n  "PolicyRegistry.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "PolicyRegistry.initialize" [ label = "initialize", color = "blue" ];\n  "PolicyRegistry.initialize2" [ label = "initialize2", color = "blue" ];\n  "PolicyRegistry._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "PolicyRegistry.changeGovernor" [ label = "changeGovernor", color = "blue" ];\n  "PolicyRegistry.setPolicy" [ label = "setPolicy", color = "blue" ];\n  "PolicyRegistry._disableInitializers" [ label = "_disableInitializers" ];\n}\n\nsubgraph "clusterSortitionModule" {\n  graph [ label = "SortitionModule", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "SortitionModule.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "SortitionModule.initialize" [ label = "initialize", color = "blue" ];\n  "SortitionModule.initialize4" [ label = "initialize4", color = "blue" ];\n  "SortitionModule._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "SortitionModule._disableInitializers" [ label = "_disableInitializers" ];\n  "SortitionModule.__SortitionModuleBase_initialize" [ label = "__SortitionModuleBase_initialize" ];\n}\n\nsubgraph "clusterSortitionModuleBase" {\n  graph [ label = "SortitionModuleBase", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "SortitionModuleBase.__SortitionModuleBase_initialize" [ label = "__SortitionModuleBase_initialize", color = "white" ];\n  "SortitionModuleBase.onlyByGovernor" [ label = "onlyByGovernor", color = "yellow" ];\n  "SortitionModuleBase.onlyByCore" [ label = "onlyByCore", color = "yellow" ];\n  "SortitionModuleBase.changeGovernor" [ label = "changeGovernor", color = "blue" ];\n  "SortitionModuleBase.changeMinStakingTime" [ label = "changeMinStakingTime", color = "blue" ];\n  "SortitionModuleBase.changeMaxDrawingTime" [ label = "changeMaxDrawingTime", color = "blue" ];\n  "SortitionModuleBase.changeRandomNumberGenerator" [ label = "changeRandomNumberGenerator", color = "blue" ];\n  "SortitionModuleBase.passPhase" [ label = "passPhase", color = "blue" ];\n  "ISortitionModule.createTree" [ label = "createTree", color = "blue" ];\n  "SortitionModuleBase.executeDelayedStakes" [ label = "executeDelayedStakes", color = "blue" ];\n  "ISortitionModule.createDisputeHook" [ label = "createDisputeHook", color = "blue" ];\n  "ISortitionModule.postDrawHook" [ label = "postDrawHook", color = "blue" ];\n  "SortitionModuleBase.notifyRandomNumber" [ label = "notifyRandomNumber", color = "green" ];\n  "ISortitionModule.validateStake" [ label = "validateStake", color = "blue" ];\n  "SortitionModuleBase._validateStake" [ label = "_validateStake" ];\n  "ISortitionModule.setStake" [ label = "setStake", color = "blue" ];\n  "SortitionModuleBase._setStake" [ label = "_setStake" ];\n  "ISortitionModule.lockStake" [ label = "lockStake", color = "blue" ];\n  "ISortitionModule.unlockStake" [ label = "unlockStake", color = "blue" ];\n  "ISortitionModule.penalizeStake" [ label = "penalizeStake", color = "blue" ];\n  "ISortitionModule.setJurorInactive" [ label = "setJurorInactive", color = "blue" ];\n  "SortitionModuleBase.withdrawLeftoverPNK" [ label = "withdrawLeftoverPNK", color = "blue" ];\n  "SortitionModuleBase.draw" [ label = "draw", color = "green" ];\n  "SortitionModuleBase.stakeOf" [ label = "stakeOf" ];\n  "SortitionModuleBase.getJurorBalance" [ label = "getJurorBalance", color = "blue" ];\n  "SortitionModuleBase.getJurorCourtIDs" [ label = "getJurorCourtIDs" ];\n  "SortitionModuleBase.isJurorStaked" [ label = "isJurorStaked", color = "blue" ];\n  "SortitionModuleBase.getJurorLeftoverPNK" [ label = "getJurorLeftoverPNK" ];\n  "SortitionModuleBase._updateParents" [ label = "_updateParents" ];\n  "SortitionModuleBase._stakePathIDToAccount" [ label = "_stakePathIDToAccount" ];\n  "SortitionModuleBase._extraDataToTreeK" [ label = "_extraDataToTreeK" ];\n  "SortitionModuleBase._set" [ label = "_set" ];\n  "SortitionModuleBase._accountAndCourtIDToStakePathID" [ label = "_accountAndCourtIDToStakePathID" ];\n  "SortitionModuleBase.address" [ label = "address" ];\n}\n\nsubgraph "clusterSortitionModuleNeo" {\n  graph [ label = "SortitionModuleNeo", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "SortitionModuleNeo.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "SortitionModuleNeo.initialize" [ label = "initialize", color = "blue" ];\n  "SortitionModuleNeo.initialize4" [ label = "initialize4", color = "blue" ];\n  "SortitionModuleNeo._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "SortitionModuleNeo.changeMaxStakePerJuror" [ label = "changeMaxStakePerJuror", color = "blue" ];\n  "SortitionModuleNeo.changeMaxTotalStaked" [ label = "changeMaxTotalStaked", color = "blue" ];\n  "SortitionModuleBase._validateStake" [ label = "_validateStake", color = "white" ];\n  "SortitionModuleNeo._disableInitializers" [ label = "_disableInitializers" ];\n  "SortitionModuleNeo.__SortitionModuleBase_initialize" [ label = "__SortitionModuleBase_initialize" ];\n}\n\nsubgraph "clusterDisputeResolver" {\n  graph [ label = "DisputeResolver", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "DisputeResolver.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "DisputeResolver.changeGovernor" [ label = "changeGovernor", color = "blue" ];\n  "DisputeResolver.changeArbitrator" [ label = "changeArbitrator", color = "blue" ];\n  "DisputeResolver.changeTemplateRegistry" [ label = "changeTemplateRegistry", color = "blue" ];\n  "DisputeResolver.createDisputeForTemplate" [ label = "createDisputeForTemplate", color = "blue" ];\n  "DisputeResolver.createDisputeForTemplateUri" [ label = "createDisputeForTemplateUri", color = "blue" ];\n  "DisputeResolver.rule" [ label = "rule", color = "blue" ];\n  "DisputeResolver._createDispute" [ label = "_createDispute" ];\n  "DisputeResolver.address" [ label = "address" ];\n}\n\nsubgraph "clusterDisputeTemplateRegistry" {\n  graph [ label = "DisputeTemplateRegistry", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "DisputeTemplateRegistry.onlyByGovernor" [ label = "onlyByGovernor", color = "yellow" ];\n  "DisputeTemplateRegistry.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "DisputeTemplateRegistry.initialize" [ label = "initialize", color = "blue" ];\n  "DisputeTemplateRegistry.initialize2" [ label = "initialize2", color = "blue" ];\n  "DisputeTemplateRegistry._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "DisputeTemplateRegistry.changeGovernor" [ label = "changeGovernor", color = "blue" ];\n  "IDisputeTemplateRegistry.setDisputeTemplate" [ label = "setDisputeTemplate", color = "blue" ];\n  "DisputeTemplateRegistry._disableInitializers" [ label = "_disableInitializers" ];\n}\n\nsubgraph "clusterDisputeKitClassic" {\n  graph [ label = "DisputeKitClassic", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "DisputeKitClassic.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "DisputeKitClassic.initialize" [ label = "initialize", color = "blue" ];\n  "DisputeKitClassic.reinitialize" [ label = "reinitialize", color = "blue" ];\n  "DisputeKitClassic._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "DisputeKitClassic._disableInitializers" [ label = "_disableInitializers" ];\n  "DisputeKitClassic.__DisputeKitClassicBase_initialize" [ label = "__DisputeKitClassicBase_initialize" ];\n}\n\nsubgraph "clusterDisputeKitClassicBase" {\n  graph [ label = "DisputeKitClassicBase", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "DisputeKitClassicBase.onlyByGovernor" [ label = "onlyByGovernor", color = "yellow" ];\n  "DisputeKitClassicBase.onlyByCore" [ label = "onlyByCore", color = "yellow" ];\n  "DisputeKitClassicBase.notJumped" [ label = "notJumped", color = "yellow" ];\n  "DisputeKitClassicBase.__DisputeKitClassicBase_initialize" [ label = "__DisputeKitClassicBase_initialize", color = "white" ];\n  "DisputeKitClassicBase.executeGovernorProposal" [ label = "executeGovernorProposal", color = "blue" ];\n  "DisputeKitClassicBase.changeGovernor" [ label = "changeGovernor", color = "blue" ];\n  "DisputeKitClassicBase.changeCore" [ label = "changeCore", color = "blue" ];\n  "IDisputeKit.createDispute" [ label = "createDispute", color = "blue" ];\n  "IDisputeKit.draw" [ label = "draw", color = "blue" ];\n  "DisputeKitClassicBase.castCommit" [ label = "castCommit", color = "blue" ];\n  "DisputeKitClassicBase._castCommit" [ label = "_castCommit" ];\n  "DisputeKitClassicBase.castVote" [ label = "castVote", color = "blue" ];\n  "DisputeKitClassicBase._castVote" [ label = "_castVote" ];\n  "DisputeKitClassicBase.fundAppeal" [ label = "fundAppeal", color = "blue" ];\n  "DisputeKitClassicBase.withdrawFeesAndRewards" [ label = "withdrawFeesAndRewards", color = "blue" ];\n  "DisputeKitClassicBase.hashVote" [ label = "hashVote" ];\n  "DisputeKitClassicBase.getFundedChoices" [ label = "getFundedChoices" ];\n  "IDisputeKit.currentRuling" [ label = "currentRuling", color = "blue" ];\n  "IDisputeKit.getDegreeOfCoherence" [ label = "getDegreeOfCoherence", color = "blue" ];\n  "IDisputeKit.getCoherentCount" [ label = "getCoherentCount", color = "blue" ];\n  "DisputeKitClassicBase.areCommitsAllCast" [ label = "areCommitsAllCast", color = "blue" ];\n  "DisputeKitClassicBase.areVotesAllCast" [ label = "areVotesAllCast", color = "blue" ];\n  "DisputeKitClassicBase.isAppealFunded" [ label = "isAppealFunded", color = "blue" ];\n  "IDisputeKit.isVoteActive" [ label = "isVoteActive", color = "blue" ];\n  "DisputeKitClassicBase.getRoundInfo" [ label = "getRoundInfo", color = "blue" ];\n  "DisputeKitClassicBase.getNumberOfRounds" [ label = "getNumberOfRounds", color = "blue" ];\n  "DisputeKitClassicBase.getLocalDisputeRoundID" [ label = "getLocalDisputeRoundID", color = "blue" ];\n  "DisputeKitClassicBase.getVoteInfo" [ label = "getVoteInfo", color = "blue" ];\n  "DisputeKitClassicBase._postDrawCheck" [ label = "_postDrawCheck" ];\n  "DisputeKitClassicBase.address" [ label = "address" ];\n  "DisputeKitClassicBase.payable" [ label = "payable" ];\n}\n\nsubgraph "clusterIBalanceHolder" {\n  graph [ label = "IBalanceHolder  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "IBalanceHolder.balanceOf" [ label = "balanceOf", color = "blue" ];\n}\n\nsubgraph "clusterIBalanceHolderERC1155" {\n  graph [ label = "IBalanceHolderERC1155  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "IBalanceHolderERC1155.balanceOf" [ label = "balanceOf", color = "blue" ];\n}\n\nsubgraph "clusterDisputeKitGated" {\n  graph [ label = "DisputeKitGated", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "DisputeKitGated.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "DisputeKitGated.initialize" [ label = "initialize", color = "blue" ];\n  "DisputeKitGated.reinitialize" [ label = "reinitialize", color = "blue" ];\n  "DisputeKitGated._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "DisputeKitGated.extraDataToTokenInfo" [ label = "extraDataToTokenInfo", color = "green" ];\n  "DisputeKitClassicBase._postDrawCheck" [ label = "_postDrawCheck", color = "white" ];\n  "DisputeKitGated._disableInitializers" [ label = "_disableInitializers" ];\n  "DisputeKitGated.__DisputeKitClassicBase_initialize" [ label = "__DisputeKitClassicBase_initialize" ];\n}\n\nsubgraph "clusterDisputeKitGatedShutter" {\n  graph [ label = "DisputeKitGatedShutter", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "DisputeKitGatedShutter.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "DisputeKitGatedShutter.initialize" [ label = "initialize", color = "blue" ];\n  "DisputeKitGatedShutter.reinitialize" [ label = "reinitialize", color = "blue" ];\n  "DisputeKitGatedShutter._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "DisputeKitGatedShutter.castCommitShutter" [ label = "castCommitShutter", color = "blue" ];\n  "DisputeKitGatedShutter.castVoteShutter" [ label = "castVoteShutter", color = "blue" ];\n  "DisputeKitClassicBase.hashVote" [ label = "hashVote", color = "green" ];\n  "DisputeKitGatedShutter._extraDataToTokenInfo" [ label = "_extraDataToTokenInfo", color = "white" ];\n  "DisputeKitClassicBase._postDrawCheck" [ label = "_postDrawCheck", color = "white" ];\n  "DisputeKitGatedShutter._disableInitializers" [ label = "_disableInitializers" ];\n  "DisputeKitGatedShutter.__DisputeKitClassicBase_initialize" [ label = "__DisputeKitClassicBase_initialize" ];\n}\n\nsubgraph "clusterDisputeKitShutter" {\n  graph [ label = "DisputeKitShutter", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "DisputeKitShutter.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "DisputeKitShutter.initialize" [ label = "initialize", color = "blue" ];\n  "DisputeKitShutter.reinitialize" [ label = "reinitialize", color = "blue" ];\n  "DisputeKitShutter._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "DisputeKitShutter.castCommitShutter" [ label = "castCommitShutter", color = "blue" ];\n  "DisputeKitShutter.castVoteShutter" [ label = "castVoteShutter", color = "blue" ];\n  "DisputeKitClassicBase.hashVote" [ label = "hashVote", color = "green" ];\n  "DisputeKitShutter._disableInitializers" [ label = "_disableInitializers" ];\n  "DisputeKitShutter.__DisputeKitClassicBase_initialize" [ label = "__DisputeKitClassicBase_initialize" ];\n}\n\nsubgraph "clusterIProofOfHumanity" {\n  graph [ label = "IProofOfHumanity  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "IProofOfHumanity.isRegistered" [ label = "isRegistered" ];\n}\n\nsubgraph "clusterDisputeKitSybilResistant" {\n  graph [ label = "DisputeKitSybilResistant", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "DisputeKitSybilResistant.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "DisputeKitSybilResistant.initialize" [ label = "initialize", color = "blue" ];\n  "DisputeKitSybilResistant._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "DisputeKitClassicBase._postDrawCheck" [ label = "_postDrawCheck", color = "white" ];\n  "DisputeKitSybilResistant._disableInitializers" [ label = "_disableInitializers" ];\n  "DisputeKitSybilResistant.__DisputeKitClassicBase_initialize" [ label = "__DisputeKitClassicBase_initialize" ];\n}\n\nsubgraph "clusterEvidenceModule" {\n  graph [ label = "EvidenceModule", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "EvidenceModule.onlyByGovernor" [ label = "onlyByGovernor", color = "yellow" ];\n  "EvidenceModule.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "EvidenceModule.initialize" [ label = "initialize", color = "blue" ];\n  "EvidenceModule.initialize2" [ label = "initialize2", color = "blue" ];\n  "EvidenceModule._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "EvidenceModule.submitEvidence" [ label = "submitEvidence", color = "blue" ];\n  "EvidenceModule._disableInitializers" [ label = "_disableInitializers" ];\n}\n\nsubgraph "clusterIArbitrableV2" {\n  graph [ label = "IArbitrableV2  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "IArbitrableV2.rule" [ label = "rule", color = "blue" ];\n}\n\nsubgraph "clusterIArbitratorV2" {\n  graph [ label = "IArbitratorV2  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "IArbitratorV2.createDispute" [ label = "createDispute", color = "blue" ];\n  "IArbitratorV2.arbitrationCost" [ label = "arbitrationCost", color = "blue" ];\n  "IArbitratorV2.currentRuling" [ label = "currentRuling", color = "blue" ];\n}\n\nsubgraph "clusterIDisputeKit" {\n  graph [ label = "IDisputeKit  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "IDisputeKit.createDispute" [ label = "createDispute", color = "blue" ];\n  "IDisputeKit.draw" [ label = "draw", color = "blue" ];\n  "IDisputeKit.getCoherentCount" [ label = "getCoherentCount", color = "blue" ];\n  "IDisputeKit.getDegreeOfCoherence" [ label = "getDegreeOfCoherence", color = "blue" ];\n  "IDisputeKit.isVoteActive" [ label = "isVoteActive", color = "blue" ];\n  "IDisputeKit.currentRuling" [ label = "currentRuling", color = "blue" ];\n  "IDisputeKit.areCommitsAllCast" [ label = "areCommitsAllCast", color = "blue" ];\n  "IDisputeKit.areVotesAllCast" [ label = "areVotesAllCast", color = "blue" ];\n  "IDisputeKit.isAppealFunded" [ label = "isAppealFunded", color = "blue" ];\n  "IDisputeKit.getRoundInfo" [ label = "getRoundInfo", color = "blue" ];\n  "IDisputeKit.getVoteInfo" [ label = "getVoteInfo", color = "blue" ];\n}\n\nsubgraph "clusterIDisputeTemplateRegistry" {\n  graph [ label = "IDisputeTemplateRegistry  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "IDisputeTemplateRegistry.setDisputeTemplate" [ label = "setDisputeTemplate", color = "blue" ];\n}\n\nsubgraph "clusterIEvidence" {\n  graph [ label = "IEvidence  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n}\n\nsubgraph "clusterISortitionModule" {\n  graph [ label = "ISortitionModule  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "ISortitionModule.createTree" [ label = "createTree", color = "blue" ];\n  "ISortitionModule.createDisputeHook" [ label = "createDisputeHook", color = "blue" ];\n  "ISortitionModule.lockStake" [ label = "lockStake", color = "blue" ];\n  "ISortitionModule.postDrawHook" [ label = "postDrawHook", color = "blue" ];\n  "ISortitionModule.unlockStake" [ label = "unlockStake", color = "blue" ];\n  "ISortitionModule.penalizeStake" [ label = "penalizeStake", color = "blue" ];\n  "ISortitionModule.setJurorInactive" [ label = "setJurorInactive", color = "blue" ];\n  "ISortitionModule.validateStake" [ label = "validateStake", color = "blue" ];\n  "ISortitionModule.setStake" [ label = "setStake", color = "blue" ];\n  "ISortitionModule.draw" [ label = "draw", color = "blue" ];\n  "ISortitionModule.notifyRandomNumber" [ label = "notifyRandomNumber", color = "blue" ];\n  "ISortitionModule.getJurorBalance" [ label = "getJurorBalance", color = "blue" ];\n  "ISortitionModule.getJurorCourtIDs" [ label = "getJurorCourtIDs", color = "blue" ];\n  "ISortitionModule.isJurorStaked" [ label = "isJurorStaked", color = "blue" ];\n  "ISortitionModule.getJurorLeftoverPNK" [ label = "getJurorLeftoverPNK", color = "blue" ];\n  "ISortitionModule.withdrawLeftoverPNK" [ label = "withdrawLeftoverPNK", color = "blue" ];\n}\n\nsubgraph "clusterSafeERC20" {\n  graph [ label = "SafeERC20  (lib)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "SafeERC20.increaseAllowance" [ label = "increaseAllowance", color = "white" ];\n  "SafeERC20.safeTransfer" [ label = "safeTransfer", color = "white" ];\n  "SafeERC20.safeTransferFrom" [ label = "safeTransferFrom", color = "white" ];\n  "SafeERC20.address" [ label = "address" ];\n}\n\nsubgraph "clusterWethLike" {\n  graph [ label = "WethLike  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "WethLike.deposit" [ label = "deposit", color = "blue" ];\n  "WethLike.transfer" [ label = "transfer", color = "blue" ];\n}\n\nsubgraph "clusterSafeSend" {\n  graph [ label = "SafeSend  (lib)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "SafeSend.safeSend" [ label = "safeSend", color = "white" ];\n}\n\nsubgraph "clusterRNGWithFallback" {\n  graph [ label = "RNGWithFallback", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "RNGWithFallback.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "RNGWithFallback.onlyByGovernor" [ label = "onlyByGovernor", color = "yellow" ];\n  "RNGWithFallback.onlyByConsumer" [ label = "onlyByConsumer", color = "yellow" ];\n  "RNGWithFallback.changeGovernor" [ label = "changeGovernor", color = "blue" ];\n  "RNGWithFallback.changeConsumer" [ label = "changeConsumer", color = "blue" ];\n  "RNGWithFallback.changeFallbackTimeout" [ label = "changeFallbackTimeout", color = "blue" ];\n  "IRNG.requestRandomness" [ label = "requestRandomness", color = "blue" ];\n  "IRNG.receiveRandomness" [ label = "receiveRandomness", color = "blue" ];\n  "RNGWithFallback.address" [ label = "address" ];\n  "RNGWithFallback.blockhash" [ label = "blockhash" ];\n}\n\nsubgraph "clusterChainlinkRNG" {\n  graph [ label = "ChainlinkRNG", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "ChainlinkRNG.onlyByGovernor" [ label = "onlyByGovernor", color = "yellow" ];\n  "ChainlinkRNG.onlyByConsumer" [ label = "onlyByConsumer", color = "yellow" ];\n  "ChainlinkRNG.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "ChainlinkRNG.changeGovernor" [ label = "changeGovernor", color = "blue" ];\n  "ChainlinkRNG.changeConsumer" [ label = "changeConsumer", color = "blue" ];\n  "ChainlinkRNG.changeVrfCoordinator" [ label = "changeVrfCoordinator", color = "blue" ];\n  "ChainlinkRNG.changeKeyHash" [ label = "changeKeyHash", color = "blue" ];\n  "ChainlinkRNG.changeSubscriptionId" [ label = "changeSubscriptionId", color = "blue" ];\n  "ChainlinkRNG.changeRequestConfirmations" [ label = "changeRequestConfirmations", color = "blue" ];\n  "ChainlinkRNG.changeCallbackGasLimit" [ label = "changeCallbackGasLimit", color = "blue" ];\n  "IRNG.requestRandomness" [ label = "requestRandomness", color = "blue" ];\n  "ChainlinkRNG.fulfillRandomWords" [ label = "fulfillRandomWords", color = "white" ];\n  "IRNG.receiveRandomness" [ label = "receiveRandomness", color = "blue" ];\n  "ChainlinkRNG.IVRFCoordinatorV2Plus" [ label = "IVRFCoordinatorV2Plus" ];\n  "ChainlinkRNG.CoordinatorSet" [ label = "CoordinatorSet" ];\n}\n\nsubgraph "clusterIRNG" {\n  graph [ label = "IRNG  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "IRNG.requestRandomness" [ label = "requestRandomness", color = "blue" ];\n  "IRNG.receiveRandomness" [ label = "receiveRandomness", color = "blue" ];\n}\n\nsubgraph "clusterUUPSProxiable" {\n  graph [ label = "UUPSProxiable", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "UUPSProxiable._authorizeUpgrade" [ label = "_authorizeUpgrade" ];\n  "UUPSProxiable.upgradeToAndCall" [ label = "upgradeToAndCall", color = "green" ];\n  "UUPSProxiable.proxiableUUID" [ label = "proxiableUUID", color = "blue" ];\n  "UUPSProxiable.version" [ label = "version", color = "blue" ];\n  "UUPSProxiable._getImplementation" [ label = "_getImplementation" ];\n  "UUPSProxiable.address" [ label = "address" ];\n  "UUPSProxiable.UUPSUnauthorizedCallContext" [ color = "brown2", shape =box ];\n  "UUPSProxiable.UUPSUnsupportedProxiableUUID" [ color = "brown2", shape =box ];\n  "UUPSProxiable.FailedDelegateCall" [ color = "brown2", shape =box ];\n  "UUPSProxiable.InvalidImplementation" [ color = "brown2", shape =box ];\n}\n\nsubgraph "clusterUUPSProxy" {\n  graph [ label = "UUPSProxy", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "UUPSProxy.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "UUPSProxy._delegate" [ label = "_delegate" ];\n  "UUPSProxy._getImplementation" [ label = "_getImplementation" ];\n  "UUPSProxy.<Fallback>" [ label = "<Fallback>", color = "blue" ];\n  "UUPSProxy.<Receive Ether>" [ label = "<Receive Ether>", color = "blue" ];\n}\n\nsubgraph "clusterInitializable" {\n  graph [ label = "Initializable", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "Initializable.initializer" [ label = "initializer", color = "yellow" ];\n  "Initializable.reinitializer" [ label = "reinitializer", color = "yellow" ];\n  "Initializable.onlyInitializing" [ label = "onlyInitializing", color = "yellow" ];\n  "Initializable._checkInitializing" [ label = "_checkInitializing" ];\n  "Initializable._disableInitializers" [ label = "_disableInitializers", color = "white" ];\n  "Initializable._getInitializedVersion" [ label = "_getInitializedVersion", color = "white" ];\n  "Initializable._isInitializing" [ label = "_isInitializing" ];\n  "Initializable._getInitializableStorage" [ label = "_getInitializableStorage" ];\n  "Initializable.address" [ label = "address" ];\n  "Initializable.AlreadyInitialized" [ color = "brown2", shape =box ];\n  "Initializable.NotInitializing" [ color = "brown2", shape =box ];\n  "Initializable.type" [ label = "type" ];\n}\n\nsubgraph "clusterIERC20" {\n  graph [ label = "IERC20", color = "lightgray" ];\n  "IERC20.safeTransfer" [ label = "safeTransfer" ];\n  "IERC20.safeTransferFrom" [ label = "safeTransferFrom" ];\n  "IERC20.approve" [ label = "approve" ];\n  "IERC20.allowance" [ label = "allowance" ];\n  "IERC20.UTION: When used with inheritance, manual care" [ label = "UTION: When used with inheritance, manual care" ];\n  "IERC20.utomatically lock it when it is deployed:\n *\n * ```\n * //" [ label = "utomatically lock it when it is deployed:\n *\n * ```\n * //" ];\n}\n\nsubgraph "cluster_recipient" {\n  graph [ label = "_recipient", color = "lightgray" ];\n  "_recipient.safeSend" [ label = "safeSend" ];\n}\n\nsubgraph "clusterIERC721" {\n  graph [ label = "IERC721", color = "lightgray" ];\n  "IERC721.balanceOf" [ label = "balanceOf" ];\n}\n\nsubgraph "cluster_beneficiary" {\n  graph [ label = "_beneficiary", color = "lightgray" ];\n  "_beneficiary.safeSend" [ label = "safeSend" ];\n}\n\nsubgraph "clusterabi" {\n  graph [ label = "abi", color = "lightgray" ];\n  "abi.encodeCall" [ label = "encodeCall" ];\n}\n\nsubgraph "cluster_to" {\n  graph [ label = "_to", color = "lightgray" ];\n  "_to.send" [ label = "send" ];\n}\n\nsubgraph "clusters_vrfCoordinator" {\n  graph [ label = "s_vrfCoordinator", color = "lightgray" ];\n  "s_vrfCoordinator.requestRandomWords" [ label = "requestRandomWords" ];\n}\n\nsubgraph "clusterVRFV2PlusClient" {\n  graph [ label = "VRFV2PlusClient", color = "lightgray" ];\n  "VRFV2PlusClient.RandomWordsRequest" [ label = "RandomWordsRequest" ];\n  "VRFV2PlusClient._argsToBytes" [ label = "_argsToBytes" ];\n  "VRFV2PlusClient.ExtraArgsV1" [ label = "ExtraArgsV1" ];\n}\n\nsubgraph "clusternewImplementation" {\n  graph [ label = "newImplementation", color = "lightgray" ];\n  "newImplementation.delegatecall" [ label = "delegatecall" ];\n}\n\nsubgraph "cluster_implementation" {\n  graph [ label = "_implementation", color = "lightgray" ];\n  "_implementation.delegatecall" [ label = "delegatecall" ];\n}\n\n  "KlerosCore.<Constructor>";\n  "KlerosCore._disableInitializers";\n  "KlerosCore.initialize";\n  "KlerosCore.__KlerosCoreBase_initialize";\n  "KlerosCoreBase.onlyByGovernor";\n  "KlerosCoreBase.GovernorOnly";\n  "KlerosCoreBase.onlyByGuardianOrGovernor";\n  "KlerosCoreBase.GuardianOrGovernorOnly";\n  "KlerosCoreBase.whenPaused";\n  "KlerosCoreBase.WhenPausedOnly";\n  "KlerosCoreBase.whenNotPaused";\n  "KlerosCoreBase.WhenNotPausedOnly";\n  "KlerosCoreBase.__KlerosCoreBase_initialize";\n  "ISortitionModule.createTree";\n  "KlerosCoreBase._enableDisputeKit";\n  "KlerosCoreBase.executeGovernorProposal";\n  "KlerosCoreBase.UnsuccessfulCall";\n  "KlerosCoreBase.createCourt";\n  "KlerosCoreBase.MinStakeLowerThanParentCourt";\n  "KlerosCoreBase.UnsupportedDisputeKit";\n  "KlerosCoreBase.InvalidForkingCourtAsParent";\n  "KlerosCoreBase.WrongDisputeKitIndex";\n  "KlerosCoreBase.MustSupportDisputeKitClassic";\n  "KlerosCoreBase.changeCourtParameters";\n  "KlerosCoreBase.enableDisputeKits";\n  "KlerosCoreBase.CannotDisableClassicDK";\n  "KlerosCoreBase.setStake";\n  "KlerosCoreBase._setStake";\n  "KlerosCoreBase.setStakeBySortitionModule";\n  "KlerosCoreBase.address";\n  "KlerosCoreBase.SortitionModuleOnly";\n  "KlerosCoreBase.transferBySortitionModule";\n  "IERC20.safeTransfer";\n  "KlerosCoreBase.createDispute";\n  "KlerosCoreBase.arbitrationCost";\n  "KlerosCoreBase.ArbitrationFeesNotEnough";\n  "KlerosCoreBase._createDispute";\n  "KlerosCoreBase.TokenNotAccepted";\n  "IERC20.safeTransferFrom";\n  "KlerosCoreBase.TransferFailed";\n  "KlerosCoreBase._extraDataToCourtIDMinJurorsDisputeKit";\n  "KlerosCoreBase.DisputeKitNotSupportedByCourt";\n  "KlerosCoreBase.convertEthToTokenAmount";\n  "KlerosCoreBase._calculatePnkAtStake";\n  "KlerosCoreBase.IERC20";\n  "ISortitionModule.createDisputeHook";\n  "IDisputeKit.createDispute";\n  "KlerosCoreBase.passPeriod";\n  "KlerosCoreBase.EvidenceNotPassedAndNotAppeal";\n  "KlerosCoreBase.DisputeStillDrawing";\n  "KlerosCoreBase.CommitPeriodNotPassed";\n  "KlerosCoreBase.VotePeriodNotPassed";\n  "KlerosCoreBase.AppealPeriodNotPassed";\n  "KlerosCoreBase.DisputePeriodIsFinal";\n  "KlerosCoreBase.draw";\n  "KlerosCoreBase.NotEvidencePeriod";\n  "IDisputeKit.draw";\n  "ISortitionModule.lockStake";\n  "ISortitionModule.postDrawHook";\n  "KlerosCoreBase.appeal";\n  "KlerosCoreBase.appealCost";\n  "KlerosCoreBase.AppealFeesNotEnough";\n  "KlerosCoreBase.DisputeNotAppealable";\n  "KlerosCoreBase.DisputeKitOnly";\n  "KlerosCoreBase.execute";\n  "KlerosCoreBase.NotExecutionPeriod";\n  "IDisputeKit.getCoherentCount";\n  "KlerosCoreBase._executePenalties";\n  "KlerosCoreBase._executeRewards";\n  "IDisputeKit.getDegreeOfCoherence";\n  "ISortitionModule.unlockStake";\n  "ISortitionModule.penalizeStake";\n  "IDisputeKit.isVoteActive";\n  "ISortitionModule.setJurorInactive";\n  "KlerosCoreBase._transferFeeToken";\n  "KlerosCoreBase.payable";\n  "KlerosCoreBase._applyCoherence";\n  "KlerosCoreBase.executeRuling";\n  "KlerosCoreBase.RulingAlreadyExecuted";\n  "KlerosCoreBase.currentRuling";\n  "IDisputeKit.currentRuling";\n  "_recipient.safeSend";\n  "KlerosCoreBase._stakingFailed";\n  "ISortitionModule.validateStake";\n  "ISortitionModule.setStake";\n  "KlerosCoreBase.StakingTransferFailed";\n  "KlerosCoreBase.UnstakingTransferFailed";\n  "KlerosCoreBase.StakingInTooManyCourts";\n  "KlerosCoreBase.StakingNotPossibleInThisCourt";\n  "KlerosCoreBase.StakingLessThanCourtMinStake";\n  "KlerosCoreBase.StakingZeroWhenNoStake";\n  "KlerosCoreNeo.<Constructor>";\n  "KlerosCoreNeo._disableInitializers";\n  "KlerosCoreNeo.initialize";\n  "IERC721.balanceOf";\n  "KlerosCoreNeo.NotEligibleForStaking";\n  "KlerosCoreNeo.ArbitrableNotWhitelisted";\n  "KlerosCoreNeo.StakingMoreThanMaxStakePerJuror";\n  "KlerosCoreNeo.StakingMoreThanMaxTotalStaked";\n  "PolicyRegistry.<Constructor>";\n  "PolicyRegistry._disableInitializers";\n  "SortitionModule.<Constructor>";\n  "SortitionModule._disableInitializers";\n  "SortitionModule.initialize";\n  "SortitionModule.__SortitionModuleBase_initialize";\n  "SortitionModuleBase.onlyByGovernor";\n  "SortitionModuleBase.address";\n  "SortitionModuleBase.onlyByCore";\n  "SortitionModuleBase.changeRandomNumberGenerator";\n  "IRNG.requestRandomness";\n  "SortitionModuleBase.passPhase";\n  "IRNG.receiveRandomness";\n  "SortitionModuleBase._extraDataToTreeK";\n  "SortitionModuleBase.executeDelayedStakes";\n  "SortitionModuleBase._validateStake";\n  "SortitionModuleBase.stakeOf";\n  "SortitionModuleBase._setStake";\n  "SortitionModuleBase._accountAndCourtIDToStakePathID";\n  "SortitionModuleBase._set";\n  "KlerosCore.courts";\n  "SortitionModuleBase.getJurorLeftoverPNK";\n  "SortitionModuleBase.getJurorCourtIDs";\n  "SortitionModuleBase.withdrawLeftoverPNK";\n  "SortitionModuleBase.draw";\n  "SortitionModuleBase._stakePathIDToAccount";\n  "SortitionModuleBase.getJurorBalance";\n  "SortitionModuleBase._updateParents";\n  "SortitionModuleNeo.<Constructor>";\n  "SortitionModuleNeo._disableInitializers";\n  "SortitionModuleNeo.initialize";\n  "SortitionModuleNeo.__SortitionModuleBase_initialize";\n  "DisputeResolver.createDisputeForTemplate";\n  "DisputeResolver._createDispute";\n  "DisputeResolver.createDisputeForTemplateUri";\n  "DisputeResolver.rule";\n  "DisputeResolver.address";\n  "IDisputeTemplateRegistry.setDisputeTemplate";\n  "DisputeTemplateRegistry.<Constructor>";\n  "DisputeTemplateRegistry._disableInitializers";\n  "DisputeKitClassic.<Constructor>";\n  "DisputeKitClassic._disableInitializers";\n  "DisputeKitClassic.initialize";\n  "DisputeKitClassic.__DisputeKitClassicBase_initialize";\n  "DisputeKitClassicBase.onlyByCore";\n  "DisputeKitClassicBase.address";\n  "KlerosCore.getNumberOfRounds";\n  "KlerosCore.sortitionModule";\n  "KlerosCore.disputes";\n  "ISortitionModule.draw";\n  "DisputeKitClassicBase._postDrawCheck";\n  "DisputeKitClassicBase.castCommit";\n  "DisputeKitClassicBase._castCommit";\n  "DisputeKitClassicBase.castVote";\n  "DisputeKitClassicBase._castVote";\n  "DisputeKitClassicBase.hashVote";\n  "DisputeKitClassicBase.fundAppeal";\n  "KlerosCore.appealPeriod";\n  "KlerosCore.isDisputeKitJumping";\n  "KlerosCore.getNumberOfVotes";\n  "DisputeKitClassicBase.payable";\n  "DisputeKitClassicBase.withdrawFeesAndRewards";\n  "KlerosCore.paused";\n  "_beneficiary.safeSend";\n  "DisputeKitClassicBase.getFundedChoices";\n  "DisputeKitClassicBase.areVotesAllCast";\n  "DisputeKitClassicBase.isAppealFunded";\n  "DisputeKitGated.<Constructor>";\n  "DisputeKitGated._disableInitializers";\n  "DisputeKitGated.initialize";\n  "DisputeKitGated.__DisputeKitClassicBase_initialize";\n  "DisputeKitGated.extraDataToTokenInfo";\n  "DisputeKitGatedShutter.<Constructor>";\n  "DisputeKitGatedShutter._disableInitializers";\n  "DisputeKitGatedShutter.initialize";\n  "DisputeKitGatedShutter.__DisputeKitClassicBase_initialize";\n  "DisputeKitGatedShutter.castCommitShutter";\n  "DisputeKitGatedShutter.castVoteShutter";\n  "DisputeKitGatedShutter._extraDataToTokenInfo";\n  "DisputeKitShutter.<Constructor>";\n  "DisputeKitShutter._disableInitializers";\n  "DisputeKitShutter.initialize";\n  "DisputeKitShutter.__DisputeKitClassicBase_initialize";\n  "DisputeKitShutter.castCommitShutter";\n  "DisputeKitShutter.castVoteShutter";\n  "DisputeKitSybilResistant.<Constructor>";\n  "DisputeKitSybilResistant._disableInitializers";\n  "DisputeKitSybilResistant.initialize";\n  "DisputeKitSybilResistant.__DisputeKitClassicBase_initialize";\n  "IProofOfHumanity.isRegistered";\n  "EvidenceModule.<Constructor>";\n  "EvidenceModule._disableInitializers";\n  "SafeERC20.increaseAllowance";\n  "IERC20.approve";\n  "IERC20.allowance";\n  "SafeERC20.address";\n  "SafeERC20.safeTransfer";\n  "IERC20.UTION: When used with inheritance, manual care";\n  "abi.encodeCall";\n  "SafeERC20.safeTransferFrom";\n  "IERC20.utomatically lock it when it is deployed:\n *\n * ```\n * //";\n  "SafeSend.safeSend";\n  "_to.send";\n  "RNGWithFallback.<Constructor>";\n  "RNGWithFallback.address";\n  "RNGWithFallback.blockhash";\n  "ChainlinkRNG.changeVrfCoordinator";\n  "ChainlinkRNG.IVRFCoordinatorV2Plus";\n  "ChainlinkRNG.CoordinatorSet";\n  "s_vrfCoordinator.requestRandomWords";\n  "VRFV2PlusClient.RandomWordsRequest";\n  "VRFV2PlusClient._argsToBytes";\n  "VRFV2PlusClient.ExtraArgsV1";\n  "UUPSProxiable.upgradeToAndCall";\n  "UUPSProxiable._authorizeUpgrade";\n  "UUPSProxiable.address";\n  "UUPSProxiable._getImplementation";\n  "UUPSProxiable.UUPSUnauthorizedCallContext";\n  "UUPSProxiable.UUPSUnsupportedProxiableUUID";\n  "newImplementation.delegatecall";\n  "UUPSProxiable.FailedDelegateCall";\n  "UUPSProxiable.InvalidImplementation";\n  "UUPSProxiable.proxiableUUID";\n  "UUPSProxy.<Constructor>";\n  "_implementation.delegatecall";\n  "UUPSProxy.<Fallback>";\n  "UUPSProxy._delegate";\n  "UUPSProxy._getImplementation";\n  "UUPSProxy.<Receive Ether>";\n  "Initializable.initializer";\n  "Initializable._getInitializableStorage";\n  "Initializable.address";\n  "Initializable.AlreadyInitialized";\n  "Initializable.reinitializer";\n  "Initializable.onlyInitializing";\n  "Initializable._checkInitializing";\n  "Initializable._isInitializing";\n  "Initializable.NotInitializing";\n  "Initializable._disableInitializers";\n  "Initializable.type";\n  "Initializable._getInitializedVersion";\n  "KlerosCore.<Constructor>" -> "KlerosCore._disableInitializers" [ color = "green" ];\n  "KlerosCore.initialize" -> "KlerosCore.__KlerosCoreBase_initialize" [ color = "green" ];\n  "KlerosCoreBase.onlyByGovernor" -> "KlerosCoreBase.GovernorOnly" [ color = "red" ];\n  "KlerosCoreBase.onlyByGuardianOrGovernor" -> "KlerosCoreBase.GuardianOrGovernorOnly" [ color = "red" ];\n  "KlerosCoreBase.whenPaused" -> "KlerosCoreBase.WhenPausedOnly" [ color = "red" ];\n  "KlerosCoreBase.whenNotPaused" -> "KlerosCoreBase.WhenNotPausedOnly" [ color = "red" ];\n  "KlerosCoreBase.__KlerosCoreBase_initialize" -> "ISortitionModule.createTree" [ color = "orange" ];\n  "KlerosCoreBase.__KlerosCoreBase_initialize" -> "ISortitionModule.createTree" [ color = "orange" ];\n  "KlerosCoreBase.__KlerosCoreBase_initialize" -> "KlerosCoreBase._enableDisputeKit" [ color = "green" ];\n  "KlerosCoreBase.executeGovernorProposal" -> "KlerosCoreBase.UnsuccessfulCall" [ color = "red" ];\n  "KlerosCoreBase.createCourt" -> "KlerosCoreBase.MinStakeLowerThanParentCourt" [ color = "red" ];\n  "KlerosCoreBase.createCourt" -> "KlerosCoreBase.UnsupportedDisputeKit" [ color = "red" ];\n  "KlerosCoreBase.createCourt" -> "KlerosCoreBase.InvalidForkingCourtAsParent" [ color = "red" ];\n  "KlerosCoreBase.createCourt" -> "KlerosCoreBase.WrongDisputeKitIndex" [ color = "red" ];\n  "KlerosCoreBase.createCourt" -> "KlerosCoreBase._enableDisputeKit" [ color = "green" ];\n  "KlerosCoreBase.createCourt" -> "KlerosCoreBase.MustSupportDisputeKitClassic" [ color = "red" ];\n  "KlerosCoreBase.createCourt" -> "ISortitionModule.createTree" [ color = "orange" ];\n  "KlerosCoreBase.changeCourtParameters" -> "KlerosCoreBase.MinStakeLowerThanParentCourt" [ color = "red" ];\n  "KlerosCoreBase.changeCourtParameters" -> "KlerosCoreBase.MinStakeLowerThanParentCourt" [ color = "red" ];\n  "KlerosCoreBase.enableDisputeKits" -> "KlerosCoreBase.WrongDisputeKitIndex" [ color = "red" ];\n  "KlerosCoreBase.enableDisputeKits" -> "KlerosCoreBase._enableDisputeKit" [ color = "green" ];\n  "KlerosCoreBase.enableDisputeKits" -> "KlerosCoreBase.CannotDisableClassicDK" [ color = "red" ];\n  "KlerosCoreBase.enableDisputeKits" -> "KlerosCoreBase._enableDisputeKit" [ color = "green" ];\n  "KlerosCoreBase.setStake" -> "KlerosCoreBase._setStake" [ color = "green" ];\n  "KlerosCoreBase.setStakeBySortitionModule" -> "KlerosCoreBase.address" [ color = "green" ];\n  "KlerosCoreBase.setStakeBySortitionModule" -> "KlerosCoreBase.SortitionModuleOnly" [ color = "red" ];\n  "KlerosCoreBase.setStakeBySortitionModule" -> "KlerosCoreBase._setStake" [ color = "green" ];\n  "KlerosCoreBase.transferBySortitionModule" -> "KlerosCoreBase.address" [ color = "green" ];\n  "KlerosCoreBase.transferBySortitionModule" -> "KlerosCoreBase.SortitionModuleOnly" [ color = "red" ];\n  "KlerosCoreBase.transferBySortitionModule" -> "IERC20.safeTransfer" [ color = "orange" ];\n  "KlerosCoreBase.createDispute" -> "KlerosCoreBase.arbitrationCost" [ color = "green" ];\n  "KlerosCoreBase.createDispute" -> "KlerosCoreBase.ArbitrationFeesNotEnough" [ color = "red" ];\n  "KlerosCoreBase.createDispute" -> "KlerosCoreBase._createDispute" [ color = "green" ];\n  "KlerosCoreBase.createDispute" -> "KlerosCoreBase.TokenNotAccepted" [ color = "red" ];\n  "KlerosCoreBase.createDispute" -> "KlerosCoreBase.arbitrationCost" [ color = "green" ];\n  "KlerosCoreBase.createDispute" -> "KlerosCoreBase.ArbitrationFeesNotEnough" [ color = "red" ];\n  "KlerosCoreBase.createDispute" -> "IERC20.safeTransferFrom" [ color = "orange" ];\n  "KlerosCoreBase.createDispute" -> "KlerosCoreBase.address" [ color = "green" ];\n  "KlerosCoreBase.createDispute" -> "KlerosCoreBase.TransferFailed" [ color = "red" ];\n  "KlerosCoreBase.createDispute" -> "KlerosCoreBase._createDispute" [ color = "green" ];\n  "KlerosCoreBase._createDispute" -> "KlerosCoreBase._extraDataToCourtIDMinJurorsDisputeKit" [ color = "green" ];\n  "KlerosCoreBase._createDispute" -> "KlerosCoreBase.DisputeKitNotSupportedByCourt" [ color = "red" ];\n  "KlerosCoreBase._createDispute" -> "KlerosCoreBase.convertEthToTokenAmount" [ color = "green" ];\n  "KlerosCoreBase._createDispute" -> "KlerosCoreBase._calculatePnkAtStake" [ color = "green" ];\n  "KlerosCoreBase._createDispute" -> "KlerosCoreBase.IERC20" [ color = "green" ];\n  "KlerosCoreBase._createDispute" -> "ISortitionModule.createDisputeHook" [ color = "orange" ];\n  "KlerosCoreBase._createDispute" -> "IDisputeKit.createDispute" [ color = "orange" ];\n  "KlerosCoreBase.passPeriod" -> "KlerosCoreBase.EvidenceNotPassedAndNotAppeal" [ color = "red" ];\n  "KlerosCoreBase.passPeriod" -> "KlerosCoreBase.DisputeStillDrawing" [ color = "red" ];\n  "KlerosCoreBase.passPeriod" -> "KlerosCoreBase.CommitPeriodNotPassed" [ color = "red" ];\n  "KlerosCoreBase.passPeriod" -> "KlerosCoreBase.VotePeriodNotPassed" [ color = "red" ];\n  "KlerosCoreBase.passPeriod" -> "KlerosCoreBase.AppealPeriodNotPassed" [ color = "red" ];\n  "KlerosCoreBase.passPeriod" -> "KlerosCoreBase.DisputePeriodIsFinal" [ color = "red" ];\n  "KlerosCoreBase.draw" -> "KlerosCoreBase.NotEvidencePeriod" [ color = "red" ];\n  "KlerosCoreBase.draw" -> "IDisputeKit.draw" [ color = "orange" ];\n  "KlerosCoreBase.draw" -> "KlerosCoreBase.address" [ color = "green" ];\n  "KlerosCoreBase.draw" -> "ISortitionModule.lockStake" [ color = "orange" ];\n  "KlerosCoreBase.draw" -> "ISortitionModule.postDrawHook" [ color = "orange" ];\n  "KlerosCoreBase.appeal" -> "KlerosCoreBase.appealCost" [ color = "green" ];\n  "KlerosCoreBase.appeal" -> "KlerosCoreBase.AppealFeesNotEnough" [ color = "red" ];\n  "KlerosCoreBase.appeal" -> "KlerosCoreBase.DisputeNotAppealable" [ color = "red" ];\n  "KlerosCoreBase.appeal" -> "KlerosCoreBase.address" [ color = "green" ];\n  "KlerosCoreBase.appeal" -> "KlerosCoreBase.DisputeKitOnly" [ color = "red" ];\n  "KlerosCoreBase.appeal" -> "KlerosCoreBase._calculatePnkAtStake" [ color = "green" ];\n  "KlerosCoreBase.appeal" -> "ISortitionModule.createDisputeHook" [ color = "orange" ];\n  "KlerosCoreBase.execute" -> "KlerosCoreBase.NotExecutionPeriod" [ color = "red" ];\n  "KlerosCoreBase.execute" -> "IDisputeKit.getCoherentCount" [ color = "orange" ];\n  "KlerosCoreBase.execute" -> "KlerosCoreBase._executePenalties" [ color = "green" ];\n  "KlerosCoreBase.execute" -> "KlerosCoreBase._executeRewards" [ color = "green" ];\n  "KlerosCoreBase._executePenalties" -> "IDisputeKit.getDegreeOfCoherence" [ color = "orange" ];\n  "KlerosCoreBase._executePenalties" -> "ISortitionModule.unlockStake" [ color = "orange" ];\n  "KlerosCoreBase._executePenalties" -> "ISortitionModule.penalizeStake" [ color = "orange" ];\n  "KlerosCoreBase._executePenalties" -> "IDisputeKit.isVoteActive" [ color = "orange" ];\n  "KlerosCoreBase._executePenalties" -> "ISortitionModule.setJurorInactive" [ color = "orange" ];\n  "KlerosCoreBase._executePenalties" -> "KlerosCoreBase._transferFeeToken" [ color = "green" ];\n  "KlerosCoreBase._executePenalties" -> "KlerosCoreBase.payable" [ color = "green" ];\n  "KlerosCoreBase._executePenalties" -> "IERC20.safeTransfer" [ color = "orange" ];\n  "KlerosCoreBase._executeRewards" -> "IDisputeKit.getDegreeOfCoherence" [ color = "orange" ];\n  "KlerosCoreBase._executeRewards" -> "KlerosCoreBase._applyCoherence" [ color = "green" ];\n  "KlerosCoreBase._executeRewards" -> "ISortitionModule.unlockStake" [ color = "orange" ];\n  "KlerosCoreBase._executeRewards" -> "KlerosCoreBase._applyCoherence" [ color = "green" ];\n  "KlerosCoreBase._executeRewards" -> "KlerosCoreBase._applyCoherence" [ color = "green" ];\n  "KlerosCoreBase._executeRewards" -> "IERC20.safeTransfer" [ color = "orange" ];\n  "KlerosCoreBase._executeRewards" -> "KlerosCoreBase._transferFeeToken" [ color = "green" ];\n  "KlerosCoreBase._executeRewards" -> "KlerosCoreBase.payable" [ color = "green" ];\n  "KlerosCoreBase._executeRewards" -> "IERC20.safeTransfer" [ color = "orange" ];\n  "KlerosCoreBase._executeRewards" -> "KlerosCoreBase._transferFeeToken" [ color = "green" ];\n  "KlerosCoreBase._executeRewards" -> "KlerosCoreBase.payable" [ color = "green" ];\n  "KlerosCoreBase.executeRuling" -> "KlerosCoreBase.NotExecutionPeriod" [ color = "red" ];\n  "KlerosCoreBase.executeRuling" -> "KlerosCoreBase.RulingAlreadyExecuted" [ color = "red" ];\n  "KlerosCoreBase.executeRuling" -> "KlerosCoreBase.currentRuling" [ color = "green" ];\n  "KlerosCoreBase.arbitrationCost" -> "KlerosCoreBase._extraDataToCourtIDMinJurorsDisputeKit" [ color = "green" ];\n  "KlerosCoreBase.arbitrationCost" -> "KlerosCoreBase.convertEthToTokenAmount" [ color = "green" ];\n  "KlerosCoreBase.arbitrationCost" -> "KlerosCoreBase.arbitrationCost" [ color = "green" ];\n  "KlerosCoreBase.currentRuling" -> "IDisputeKit.currentRuling" [ color = "orange" ];\n  "KlerosCoreBase._transferFeeToken" -> "_recipient.safeSend" [ color = "orange" ];\n  "KlerosCoreBase._transferFeeToken" -> "IERC20.safeTransfer" [ color = "orange" ];\n  "KlerosCoreBase._setStake" -> "KlerosCoreBase._stakingFailed" [ color = "green" ];\n  "KlerosCoreBase._setStake" -> "KlerosCoreBase._stakingFailed" [ color = "green" ];\n  "KlerosCoreBase._setStake" -> "ISortitionModule.validateStake" [ color = "orange" ];\n  "KlerosCoreBase._setStake" -> "KlerosCoreBase._stakingFailed" [ color = "green" ];\n  "KlerosCoreBase._setStake" -> "IERC20.safeTransferFrom" [ color = "orange" ];\n  "KlerosCoreBase._setStake" -> "KlerosCoreBase.address" [ color = "green" ];\n  "KlerosCoreBase._setStake" -> "KlerosCoreBase._stakingFailed" [ color = "green" ];\n  "KlerosCoreBase._setStake" -> "IERC20.safeTransfer" [ color = "orange" ];\n  "KlerosCoreBase._setStake" -> "KlerosCoreBase._stakingFailed" [ color = "green" ];\n  "KlerosCoreBase._setStake" -> "ISortitionModule.setStake" [ color = "orange" ];\n  "KlerosCoreBase._stakingFailed" -> "KlerosCoreBase.StakingTransferFailed" [ color = "red" ];\n  "KlerosCoreBase._stakingFailed" -> "KlerosCoreBase.UnstakingTransferFailed" [ color = "red" ];\n  "KlerosCoreBase._stakingFailed" -> "KlerosCoreBase.StakingInTooManyCourts" [ color = "red" ];\n  "KlerosCoreBase._stakingFailed" -> "KlerosCoreBase.StakingNotPossibleInThisCourt" [ color = "red" ];\n  "KlerosCoreBase._stakingFailed" -> "KlerosCoreBase.StakingLessThanCourtMinStake" [ color = "red" ];\n  "KlerosCoreBase._stakingFailed" -> "KlerosCoreBase.StakingZeroWhenNoStake" [ color = "red" ];\n  "KlerosCoreNeo.<Constructor>" -> "KlerosCoreNeo._disableInitializers" [ color = "green" ];\n  "KlerosCoreNeo.initialize" -> "KlerosCoreBase.__KlerosCoreBase_initialize" [ color = "green" ];\n  "KlerosCoreBase.setStake" -> "IERC721.balanceOf" [ color = "orange" ];\n  "KlerosCoreBase.setStake" -> "KlerosCoreNeo.NotEligibleForStaking" [ color = "red" ];\n  "KlerosCoreBase.setStake" -> "KlerosCoreBase._setStake" [ color = "orange" ];\n  "KlerosCoreBase._createDispute" -> "KlerosCoreNeo.ArbitrableNotWhitelisted" [ color = "red" ];\n  "KlerosCoreBase._createDispute" -> "KlerosCoreBase._createDispute" [ color = "orange" ];\n  "KlerosCoreBase._stakingFailed" -> "KlerosCoreBase._stakingFailed" [ color = "orange" ];\n  "KlerosCoreBase._stakingFailed" -> "KlerosCoreNeo.StakingMoreThanMaxStakePerJuror" [ color = "red" ];\n  "KlerosCoreBase._stakingFailed" -> "KlerosCoreNeo.StakingMoreThanMaxTotalStaked" [ color = "red" ];\n  "PolicyRegistry.<Constructor>" -> "PolicyRegistry._disableInitializers" [ color = "green" ];\n  "SortitionModule.<Constructor>" -> "SortitionModule._disableInitializers" [ color = "green" ];\n  "SortitionModule.initialize" -> "SortitionModule.__SortitionModuleBase_initialize" [ color = "green" ];\n  "SortitionModuleBase.onlyByGovernor" -> "SortitionModuleBase.address" [ color = "green" ];\n  "SortitionModuleBase.onlyByCore" -> "SortitionModuleBase.address" [ color = "green" ];\n  "SortitionModuleBase.changeRandomNumberGenerator" -> "IRNG.requestRandomness" [ color = "orange" ];\n  "SortitionModuleBase.passPhase" -> "IRNG.requestRandomness" [ color = "orange" ];\n  "SortitionModuleBase.passPhase" -> "IRNG.receiveRandomness" [ color = "orange" ];\n  "ISortitionModule.createTree" -> "SortitionModuleBase._extraDataToTreeK" [ color = "green" ];\n  "SortitionModuleBase.executeDelayedStakes" -> "KlerosCoreBase.setStakeBySortitionModule" [ color = "orange" ];\n  "ISortitionModule.validateStake" -> "SortitionModuleBase._validateStake" [ color = "green" ];\n  "SortitionModuleBase._validateStake" -> "SortitionModuleBase.stakeOf" [ color = "green" ];\n  "ISortitionModule.setStake" -> "SortitionModuleBase._setStake" [ color = "green" ];\n  "SortitionModuleBase._setStake" -> "SortitionModuleBase.stakeOf" [ color = "green" ];\n  "SortitionModuleBase._setStake" -> "SortitionModuleBase._accountAndCourtIDToStakePathID" [ color = "green" ];\n  "SortitionModuleBase._setStake" -> "SortitionModuleBase._set" [ color = "green" ];\n  "SortitionModuleBase._setStake" -> "KlerosCore.courts" [ color = "orange" ];\n  "ISortitionModule.unlockStake" -> "SortitionModuleBase.getJurorLeftoverPNK" [ color = "green" ];\n  "ISortitionModule.setJurorInactive" -> "SortitionModuleBase.getJurorCourtIDs" [ color = "green" ];\n  "ISortitionModule.setJurorInactive" -> "KlerosCoreBase.setStakeBySortitionModule" [ color = "orange" ];\n  "SortitionModuleBase.withdrawLeftoverPNK" -> "SortitionModuleBase.getJurorLeftoverPNK" [ color = "green" ];\n  "SortitionModuleBase.withdrawLeftoverPNK" -> "KlerosCoreBase.transferBySortitionModule" [ color = "orange" ];\n  "SortitionModuleBase.draw" -> "SortitionModuleBase.address" [ color = "green" ];\n  "SortitionModuleBase.draw" -> "SortitionModuleBase._stakePathIDToAccount" [ color = "green" ];\n  "SortitionModuleBase.stakeOf" -> "SortitionModuleBase._accountAndCourtIDToStakePathID" [ color = "green" ];\n  "SortitionModuleBase.stakeOf" -> "SortitionModuleBase.stakeOf" [ color = "green" ];\n  "SortitionModuleBase.getJurorBalance" -> "SortitionModuleBase.stakeOf" [ color = "green" ];\n  "SortitionModuleBase._set" -> "SortitionModuleBase._updateParents" [ color = "green" ];\n  "SortitionModuleBase._set" -> "SortitionModuleBase._updateParents" [ color = "green" ];\n  "SortitionModuleBase._set" -> "SortitionModuleBase._updateParents" [ color = "green" ];\n  "SortitionModuleNeo.<Constructor>" -> "SortitionModuleNeo._disableInitializers" [ color = "green" ];\n  "SortitionModuleNeo.initialize" -> "SortitionModuleNeo.__SortitionModuleBase_initialize" [ color = "green" ];\n  "SortitionModuleBase._validateStake" -> "SortitionModuleBase.stakeOf" [ color = "green" ];\n  "SortitionModuleBase._validateStake" -> "SortitionModuleBase._validateStake" [ color = "orange" ];\n  "DisputeResolver.createDisputeForTemplate" -> "DisputeResolver._createDispute" [ color = "green" ];\n  "DisputeResolver.createDisputeForTemplateUri" -> "DisputeResolver._createDispute" [ color = "green" ];\n  "DisputeResolver.rule" -> "DisputeResolver.address" [ color = "green" ];\n  "DisputeResolver._createDispute" -> "IDisputeTemplateRegistry.setDisputeTemplate" [ color = "orange" ];\n  "DisputeTemplateRegistry.<Constructor>" -> "DisputeTemplateRegistry._disableInitializers" [ color = "green" ];\n  "DisputeKitClassic.<Constructor>" -> "DisputeKitClassic._disableInitializers" [ color = "green" ];\n  "DisputeKitClassic.initialize" -> "DisputeKitClassic.__DisputeKitClassicBase_initialize" [ color = "green" ];\n  "DisputeKitClassicBase.onlyByCore" -> "DisputeKitClassicBase.address" [ color = "green" ];\n  "IDisputeKit.createDispute" -> "KlerosCore.getNumberOfRounds" [ color = "orange" ];\n  "IDisputeKit.draw" -> "KlerosCore.sortitionModule" [ color = "orange" ];\n  "IDisputeKit.draw" -> "KlerosCore.disputes" [ color = "orange" ];\n  "IDisputeKit.draw" -> "ISortitionModule.draw" [ color = "orange" ];\n  "IDisputeKit.draw" -> "DisputeKitClassicBase.address" [ color = "green" ];\n  "IDisputeKit.draw" -> "DisputeKitClassicBase._postDrawCheck" [ color = "green" ];\n  "IDisputeKit.draw" -> "DisputeKitClassicBase.address" [ color = "green" ];\n  "DisputeKitClassicBase.castCommit" -> "DisputeKitClassicBase._castCommit" [ color = "green" ];\n  "DisputeKitClassicBase._castCommit" -> "KlerosCore.disputes" [ color = "orange" ];\n  "DisputeKitClassicBase.castVote" -> "DisputeKitClassicBase._castVote" [ color = "green" ];\n  "DisputeKitClassicBase._castVote" -> "KlerosCore.disputes" [ color = "orange" ];\n  "DisputeKitClassicBase._castVote" -> "KlerosCore.disputes" [ color = "orange" ];\n  "DisputeKitClassicBase._castVote" -> "KlerosCore.courts" [ color = "orange" ];\n  "DisputeKitClassicBase._castVote" -> "DisputeKitClassicBase.hashVote" [ color = "green" ];\n  "DisputeKitClassicBase.fundAppeal" -> "KlerosCore.appealPeriod" [ color = "orange" ];\n  "DisputeKitClassicBase.fundAppeal" -> "IDisputeKit.currentRuling" [ color = "green" ];\n  "DisputeKitClassicBase.fundAppeal" -> "KlerosCore.getNumberOfRounds" [ color = "orange" ];\n  "DisputeKitClassicBase.fundAppeal" -> "KlerosCoreBase.appealCost" [ color = "orange" ];\n  "DisputeKitClassicBase.fundAppeal" -> "KlerosCore.isDisputeKitJumping" [ color = "orange" ];\n  "DisputeKitClassicBase.fundAppeal" -> "KlerosCore.getNumberOfVotes" [ color = "orange" ];\n  "DisputeKitClassicBase.fundAppeal" -> "DisputeKitClassicBase.payable" [ color = "green" ];\n  "DisputeKitClassicBase.withdrawFeesAndRewards" -> "KlerosCore.disputes" [ color = "orange" ];\n  "DisputeKitClassicBase.withdrawFeesAndRewards" -> "KlerosCore.paused" [ color = "orange" ];\n  "DisputeKitClassicBase.withdrawFeesAndRewards" -> "KlerosCoreBase.currentRuling" [ color = "orange" ];\n  "DisputeKitClassicBase.withdrawFeesAndRewards" -> "_beneficiary.safeSend" [ color = "orange" ];\n  "IDisputeKit.currentRuling" -> "KlerosCore.disputes" [ color = "orange" ];\n  "IDisputeKit.currentRuling" -> "DisputeKitClassicBase.getFundedChoices" [ color = "green" ];\n  "IDisputeKit.getDegreeOfCoherence" -> "KlerosCoreBase.currentRuling" [ color = "orange" ];\n  "IDisputeKit.getCoherentCount" -> "KlerosCoreBase.currentRuling" [ color = "orange" ];\n  "DisputeKitClassicBase.areVotesAllCast" -> "KlerosCore.disputes" [ color = "orange" ];\n  "DisputeKitClassicBase.areVotesAllCast" -> "KlerosCore.courts" [ color = "orange" ];\n  "DisputeKitClassicBase.isAppealFunded" -> "KlerosCore.appealPeriod" [ color = "orange" ];\n  "DisputeKitClassicBase.isAppealFunded" -> "DisputeKitClassicBase.getFundedChoices" [ color = "green" ];\n  "DisputeKitGated.<Constructor>" -> "DisputeKitGated._disableInitializers" [ color = "green" ];\n  "DisputeKitGated.initialize" -> "DisputeKitGated.__DisputeKitClassicBase_initialize" [ color = "green" ];\n  "DisputeKitGated.extraDataToTokenInfo" -> "DisputeKitClassicBase.address" [ color = "green" ];\n  "DisputeKitClassicBase._postDrawCheck" -> "DisputeKitClassicBase._postDrawCheck" [ color = "orange" ];\n  "DisputeKitClassicBase._postDrawCheck" -> "DisputeKitGated.extraDataToTokenInfo" [ color = "green" ];\n  "DisputeKitClassicBase._postDrawCheck" -> "DisputeKitClassicBase.address" [ color = "green" ];\n  "DisputeKitGatedShutter.<Constructor>" -> "DisputeKitGatedShutter._disableInitializers" [ color = "green" ];\n  "DisputeKitGatedShutter.initialize" -> "DisputeKitGatedShutter.__DisputeKitClassicBase_initialize" [ color = "green" ];\n  "DisputeKitGatedShutter.castCommitShutter" -> "DisputeKitClassicBase._castCommit" [ color = "green" ];\n  "DisputeKitGatedShutter.castVoteShutter" -> "DisputeKitClassicBase._castVote" [ color = "green" ];\n  "DisputeKitGatedShutter._extraDataToTokenInfo" -> "DisputeKitClassicBase.address" [ color = "green" ];\n  "DisputeKitClassicBase._postDrawCheck" -> "DisputeKitClassicBase._postDrawCheck" [ color = "orange" ];\n  "DisputeKitClassicBase._postDrawCheck" -> "DisputeKitGatedShutter._extraDataToTokenInfo" [ color = "green" ];\n  "DisputeKitClassicBase._postDrawCheck" -> "DisputeKitClassicBase.address" [ color = "green" ];\n  "DisputeKitShutter.<Constructor>" -> "DisputeKitShutter._disableInitializers" [ color = "green" ];\n  "DisputeKitShutter.initialize" -> "DisputeKitShutter.__DisputeKitClassicBase_initialize" [ color = "green" ];\n  "DisputeKitShutter.castCommitShutter" -> "DisputeKitClassicBase._castCommit" [ color = "green" ];\n  "DisputeKitShutter.castVoteShutter" -> "DisputeKitClassicBase._castVote" [ color = "green" ];\n  "DisputeKitSybilResistant.<Constructor>" -> "DisputeKitSybilResistant._disableInitializers" [ color = "green" ];\n  "DisputeKitSybilResistant.initialize" -> "DisputeKitSybilResistant.__DisputeKitClassicBase_initialize" [ color = "green" ];\n  "DisputeKitClassicBase._postDrawCheck" -> "DisputeKitClassicBase._postDrawCheck" [ color = "orange" ];\n  "DisputeKitClassicBase._postDrawCheck" -> "IProofOfHumanity.isRegistered" [ color = "orange" ];\n  "EvidenceModule.<Constructor>" -> "EvidenceModule._disableInitializers" [ color = "green" ];\n  "SafeERC20.increaseAllowance" -> "IERC20.approve" [ color = "orange" ];\n  "SafeERC20.increaseAllowance" -> "IERC20.allowance" [ color = "orange" ];\n  "SafeERC20.increaseAllowance" -> "SafeERC20.address" [ color = "green" ];\n  "SafeERC20.safeTransfer" -> "IERC20.UTION: When used with inheritance, manual care" [ color = "orange" ];\n  "SafeERC20.safeTransfer" -> "SafeERC20.address" [ color = "green" ];\n  "SafeERC20.safeTransfer" -> "abi.encodeCall" [ color = "orange" ];\n  "SafeERC20.safeTransferFrom" -> "IERC20.utomatically lock it when it is deployed:\n *\n * ```\n * //" [ color = "orange" ];\n  "SafeERC20.safeTransferFrom" -> "SafeERC20.address" [ color = "green" ];\n  "SafeERC20.safeTransferFrom" -> "abi.encodeCall" [ color = "orange" ];\n  "SafeSend.safeSend" -> "_to.send" [ color = "orange" ];\n  "RNGWithFallback.<Constructor>" -> "RNGWithFallback.address" [ color = "green" ];\n  "RNGWithFallback.<Constructor>" -> "RNGWithFallback.address" [ color = "green" ];\n  "IRNG.requestRandomness" -> "IRNG.requestRandomness" [ color = "orange" ];\n  "IRNG.receiveRandomness" -> "IRNG.receiveRandomness" [ color = "orange" ];\n  "IRNG.receiveRandomness" -> "RNGWithFallback.blockhash" [ color = "green" ];\n  "ChainlinkRNG.changeVrfCoordinator" -> "ChainlinkRNG.IVRFCoordinatorV2Plus" [ color = "green" ];\n  "ChainlinkRNG.changeVrfCoordinator" -> "ChainlinkRNG.CoordinatorSet" [ color = "green" ];\n  "IRNG.requestRandomness" -> "s_vrfCoordinator.requestRandomWords" [ color = "orange" ];\n  "IRNG.requestRandomness" -> "VRFV2PlusClient.RandomWordsRequest" [ color = "orange" ];\n  "IRNG.requestRandomness" -> "VRFV2PlusClient._argsToBytes" [ color = "orange" ];\n  "IRNG.requestRandomness" -> "VRFV2PlusClient.ExtraArgsV1" [ color = "orange" ];\n  "UUPSProxiable.upgradeToAndCall" -> "UUPSProxiable._authorizeUpgrade" [ color = "green" ];\n  "UUPSProxiable.upgradeToAndCall" -> "UUPSProxiable.address" [ color = "green" ];\n  "UUPSProxiable.upgradeToAndCall" -> "UUPSProxiable._getImplementation" [ color = "green" ];\n  "UUPSProxiable.upgradeToAndCall" -> "UUPSProxiable.UUPSUnauthorizedCallContext" [ color = "red" ];\n  "UUPSProxiable.upgradeToAndCall" -> "UUPSProxiable.UUPSUnsupportedProxiableUUID" [ color = "red" ];\n  "UUPSProxiable.upgradeToAndCall" -> "newImplementation.delegatecall" [ color = "orange" ];\n  "UUPSProxiable.upgradeToAndCall" -> "UUPSProxiable.FailedDelegateCall" [ color = "red" ];\n  "UUPSProxiable.upgradeToAndCall" -> "UUPSProxiable.InvalidImplementation" [ color = "red" ];\n  "UUPSProxiable.proxiableUUID" -> "UUPSProxiable.address" [ color = "green" ];\n  "UUPSProxiable.proxiableUUID" -> "UUPSProxiable.UUPSUnauthorizedCallContext" [ color = "red" ];\n  "UUPSProxy.<Constructor>" -> "_implementation.delegatecall" [ color = "orange" ];\n  "UUPSProxy.<Fallback>" -> "UUPSProxy._delegate" [ color = "green" ];\n  "UUPSProxy.<Fallback>" -> "UUPSProxy._getImplementation" [ color = "green" ];\n  "UUPSProxy.<Receive Ether>" -> "UUPSProxy._delegate" [ color = "green" ];\n  "UUPSProxy.<Receive Ether>" -> "UUPSProxy._getImplementation" [ color = "green" ];\n  "Initializable.initializer" -> "Initializable._getInitializableStorage" [ color = "green" ];\n  "Initializable.initializer" -> "Initializable.address" [ color = "green" ];\n  "Initializable.initializer" -> "Initializable.AlreadyInitialized" [ color = "red" ];\n  "Initializable.reinitializer" -> "Initializable._getInitializableStorage" [ color = "green" ];\n  "Initializable.reinitializer" -> "Initializable.AlreadyInitialized" [ color = "red" ];\n  "Initializable.onlyInitializing" -> "Initializable._checkInitializing" [ color = "green" ];\n  "Initializable._checkInitializing" -> "Initializable._isInitializing" [ color = "green" ];\n  "Initializable._checkInitializing" -> "Initializable.NotInitializing" [ color = "red" ];\n  "Initializable._disableInitializers" -> "Initializable._getInitializableStorage" [ color = "green" ];\n  "Initializable._disableInitializers" -> "Initializable.AlreadyInitialized" [ color = "red" ];\n  "Initializable._disableInitializers" -> "Initializable.type" [ color = "green" ];\n  "Initializable._disableInitializers" -> "Initializable.type" [ color = "green" ];\n  "Initializable._disableInitializers" -> "Initializable.type" [ color = "green" ];\n  "Initializable._getInitializedVersion" -> "Initializable._getInitializableStorage" [ color = "green" ];\n  "Initializable._isInitializing" -> "Initializable._getInitializableStorage" [ color = "green" ];\n\n\nrankdir=LR\nnode [shape=plaintext]\nsubgraph cluster_01 { \nlabel = "Legend";\nkey [label=<<table border="0" cellpadding="2" cellspacing="0" cellborder="0">\n  <tr><td align="right" port="i1">Internal Call</td></tr>\n  <tr><td align="right" port="i2">External Call</td></tr>\n  <tr><td align="right" port="i2">Custom Error Call</td></tr>\n  <tr><td align="right" port="i3">Defined Contract</td></tr>\n  <tr><td align="right" port="i4">Undefined Contract</td></tr>\n  </table>>]\nkey2 [label=<<table border="0" cellpadding="2" cellspacing="0" cellborder="0">\n  <tr><td port="i1">&nbsp;&nbsp;&nbsp;</td></tr>\n  <tr><td port="i2">&nbsp;&nbsp;&nbsp;</td></tr>\n  <tr><td port="i3" bgcolor="lightgray">&nbsp;&nbsp;&nbsp;</td></tr>\n  <tr><td port="i4">\n    <table border="1" cellborder="0" cellspacing="0" cellpadding="7" color="lightgray">\n      <tr>\n       <td></td>\n      </tr>\n     </table>\n  </td></tr>\n  </table>>]\nkey:i1:e -> key2:i1:w [color="green"]\nkey:i2:e -> key2:i2:w [color="orange"]\nkey:i2:e -> key2:i2:w [color="red"]\n}\n}\n',
+        },
+      };
+
+      window.addEventListener("load", function () {
+        window.postMessage({ command: "renderReport", value: staticMetrics }, "*");
+      });
+    </script>
+  </head>
+  <body>
+    <div id="loading-msg">
+      Rendering Report...<br /><br /><sub
+        ><b>Note: </b>This window will update automatically. In case it is not, close the window and try again (vscode
+        bug) :/</sub
+      >
+    </div>
+    <div class="content" id="preview"></div>
+  </body>
+</html>

From 82f8b1cd345df493de4b2b368bb2f6bf392a26af Mon Sep 17 00:00:00 2001
From: unknownunknown1 <danil@kleros.io>
Date: Wed, 13 Aug 2025 16:39:20 +1000
Subject: [PATCH 030/175] feat: replace requires with custom errors

---
 .../arbitration/DisputeTemplateRegistry.sol   |  8 +-
 contracts/src/arbitration/KlerosGovernor.sol  | 61 +++++++++-----
 contracts/src/arbitration/PolicyRegistry.sol  |  8 +-
 .../src/arbitration/SortitionModuleBase.sol   | 49 +++++++----
 .../arbitrables/ArbitrableExample.sol         | 23 ++++--
 .../arbitrables/DisputeResolver.sol           | 24 ++++--
 .../devtools/DisputeResolverRuler.sol         |  2 +-
 .../dispute-kits/DisputeKitClassicBase.sol    | 82 ++++++++++++-------
 .../arbitration/evidence/EvidenceModule.sol   |  8 +-
 .../university/SortitionModuleUniversity.sol  | 14 +++-
 .../view/KlerosCoreSnapshotProxy.sol          |  8 +-
 contracts/test/arbitration/index.ts           |  6 +-
 contracts/test/arbitration/staking-neo.ts     | 10 ++-
 contracts/test/foundry/KlerosCore.t.sol       | 48 +++++------
 14 files changed, 234 insertions(+), 117 deletions(-)

diff --git a/contracts/src/arbitration/DisputeTemplateRegistry.sol b/contracts/src/arbitration/DisputeTemplateRegistry.sol
index 2ea0a71f6..e63d7c297 100644
--- a/contracts/src/arbitration/DisputeTemplateRegistry.sol
+++ b/contracts/src/arbitration/DisputeTemplateRegistry.sol
@@ -25,7 +25,7 @@ contract DisputeTemplateRegistry is IDisputeTemplateRegistry, UUPSProxiable, Ini
     // ************************************* //
 
     modifier onlyByGovernor() {
-        require(governor == msg.sender, "Governor only");
+        if (governor != msg.sender) revert GovernorOnly();
         _;
     }
 
@@ -80,4 +80,10 @@ contract DisputeTemplateRegistry is IDisputeTemplateRegistry, UUPSProxiable, Ini
         templateId = templates++;
         emit DisputeTemplate(templateId, _templateTag, _templateData, _templateDataMappings);
     }
+
+    // ************************************* //
+    // *              Errors               * //
+    // ************************************* //
+
+    error GovernorOnly();
 }
diff --git a/contracts/src/arbitration/KlerosGovernor.sol b/contracts/src/arbitration/KlerosGovernor.sol
index 7e9415a7b..a0a23061e 100644
--- a/contracts/src/arbitration/KlerosGovernor.sol
+++ b/contracts/src/arbitration/KlerosGovernor.sol
@@ -70,18 +70,18 @@ contract KlerosGovernor is IArbitrableV2 {
 
     modifier duringSubmissionPeriod() {
         uint256 offset = sessions[sessions.length - 1].durationOffset;
-        require(block.timestamp - lastApprovalTime <= submissionTimeout + offset, "Submission time has ended.");
+        if (block.timestamp - lastApprovalTime > submissionTimeout + offset) revert SubmissionTimeHasEnded();
         _;
     }
 
     modifier duringApprovalPeriod() {
         uint256 offset = sessions[sessions.length - 1].durationOffset;
-        require(block.timestamp - lastApprovalTime > submissionTimeout + offset, "Approval time not started yet.");
+        if (block.timestamp - lastApprovalTime <= submissionTimeout + offset) revert ApprovalTimeNotStarted();
         _;
     }
 
     modifier onlyByGovernor() {
-        require(address(this) == msg.sender, "Only the governor allowed.");
+        if (address(this) != msg.sender) revert GovernorOnly();
         _;
     }
 
@@ -208,14 +208,14 @@ contract KlerosGovernor is IArbitrableV2 {
         uint256[] memory _dataSize,
         string memory _description
     ) external payable duringSubmissionPeriod {
-        require(_target.length == _value.length, "Wrong input: target and value");
-        require(_target.length == _dataSize.length, "Wrong input: target and datasize");
+        if (_target.length != _value.length) revert WrongInputTargetAndValue();
+        if (_target.length != _dataSize.length) revert WrongInputTargetAndDatasize();
         Session storage session = sessions[sessions.length - 1];
         Submission storage submission = submissions.push();
         submission.submitter = payable(msg.sender);
         // Do the assignment first to avoid creating a new variable and bypass a 'stack too deep' error.
         submission.deposit = submissionBaseDeposit + arbitrator.arbitrationCost(arbitratorExtraData);
-        require(msg.value >= submission.deposit, "Not enough ETH to cover deposit");
+        if (msg.value < submission.deposit) revert InsufficientDeposit();
 
         bytes32 listHash;
         bytes32 currentTxHash;
@@ -233,7 +233,7 @@ contract KlerosGovernor is IArbitrableV2 {
             currentTxHash = keccak256(abi.encodePacked(transaction.target, transaction.value, transaction.data));
             listHash = keccak256(abi.encodePacked(currentTxHash, listHash));
         }
-        require(!session.alreadySubmitted[listHash], "List already submitted");
+        if (session.alreadySubmitted[listHash]) revert ListAlreadySubmitted();
         session.alreadySubmitted[listHash] = true;
         submission.listHash = listHash;
         submission.submissionTime = block.timestamp;
@@ -256,11 +256,11 @@ contract KlerosGovernor is IArbitrableV2 {
     function withdrawTransactionList(uint256 _submissionID, bytes32 _listHash) external {
         Session storage session = sessions[sessions.length - 1];
         Submission storage submission = submissions[session.submittedLists[_submissionID]];
-        require(block.timestamp - lastApprovalTime <= submissionTimeout / 2, "Should be in first half");
-        // This require statement is an extra check to prevent _submissionID linking to the wrong list because of index swap during withdrawal.
-        require(submission.listHash == _listHash, "Wrong list hash");
-        require(submission.submitter == msg.sender, "Only submitter can withdraw");
-        require(block.timestamp - submission.submissionTime <= withdrawTimeout, "Withdrawing time has passed.");
+        if (block.timestamp - lastApprovalTime > submissionTimeout / 2) revert ShouldOnlyWithdrawInFirstHalf();
+        // This is an extra check to prevent _submissionID linking to the wrong list because of index swap during withdrawal.
+        if (submission.listHash != _listHash) revert WrongListHash();
+        if (submission.submitter != msg.sender) revert OnlySubmitterCanWithdraw();
+        if (block.timestamp - submission.submissionTime > withdrawTimeout) revert WithdrawingTimeHasPassed();
         session.submittedLists[_submissionID] = session.submittedLists[session.submittedLists.length - 1];
         session.alreadySubmitted[_listHash] = false;
         session.submittedLists.pop();
@@ -273,7 +273,7 @@ contract KlerosGovernor is IArbitrableV2 {
     /// If nothing was submitted changes session.
     function executeSubmissions() external duringApprovalPeriod {
         Session storage session = sessions[sessions.length - 1];
-        require(session.status == Status.NoDispute, "Already disputed");
+        if (session.status != Status.NoDispute) revert AlreadyDisputed();
         if (session.submittedLists.length == 0) {
             lastApprovalTime = block.timestamp;
             session.status = Status.Resolved;
@@ -310,9 +310,9 @@ contract KlerosGovernor is IArbitrableV2 {
     /// Note If the final ruling is "0" nothing is approved and deposits will stay locked in the contract.
     function rule(uint256 _disputeID, uint256 _ruling) external override {
         Session storage session = sessions[sessions.length - 1];
-        require(msg.sender == address(arbitrator), "Only arbitrator allowed");
-        require(session.status == Status.DisputeCreated, "Wrong status");
-        require(_ruling <= session.submittedLists.length, "Ruling is out of bounds.");
+        if (msg.sender != address(arbitrator)) revert OnlyArbitratorAllowed();
+        if (session.status != Status.DisputeCreated) revert NotDisputed();
+        if (_ruling > session.submittedLists.length) revert RulingOutOfBounds();
 
         if (_ruling != 0) {
             Submission storage submission = submissions[session.submittedLists[_ruling - 1]];
@@ -338,8 +338,8 @@ contract KlerosGovernor is IArbitrableV2 {
     /// @param _count Number of transactions to execute. Executes until the end if set to "0" or number higher than number of transactions in the list.
     function executeTransactionList(uint256 _listID, uint256 _cursor, uint256 _count) external {
         Submission storage submission = submissions[_listID];
-        require(submission.approved, "Should be approved");
-        require(block.timestamp - submission.approvalTime <= executionTimeout, "Time to execute has passed");
+        if (!submission.approved) revert SubmissionNotApproved();
+        if (block.timestamp - submission.approvalTime > executionTimeout) revert TimeToExecuteHasPassed();
         for (uint256 i = _cursor; i < submission.txs.length && (_count == 0 || i < _cursor + _count); i++) {
             Transaction storage transaction = submission.txs[i];
             uint256 expendableFunds = getExpendableFunds();
@@ -347,7 +347,7 @@ contract KlerosGovernor is IArbitrableV2 {
                 (bool callResult, ) = transaction.target.call{value: transaction.value}(transaction.data);
                 // An extra check to prevent re-entrancy through target call.
                 if (callResult == true) {
-                    require(!transaction.executed, "Already executed");
+                    if (transaction.executed) revert AlreadyExecuted();
                     transaction.executed = true;
                 }
             }
@@ -407,4 +407,27 @@ contract KlerosGovernor is IArbitrableV2 {
     function getCurrentSessionNumber() external view returns (uint256) {
         return sessions.length - 1;
     }
+
+    // ************************************* //
+    // *              Errors               * //
+    // ************************************* //
+
+    error SubmissionTimeHasEnded();
+    error ApprovalTimeNotStarted();
+    error GovernorOnly();
+    error WrongInputTargetAndValue();
+    error WrongInputTargetAndDatasize();
+    error InsufficientDeposit();
+    error ListAlreadySubmitted();
+    error ShouldOnlyWithdrawInFirstHalf();
+    error WrongListHash();
+    error OnlySubmitterCanWithdraw();
+    error WithdrawingTimeHasPassed();
+    error AlreadyDisputed();
+    error OnlyArbitratorAllowed();
+    error NotDisputed();
+    error RulingOutOfBounds();
+    error SubmissionNotApproved();
+    error TimeToExecuteHasPassed();
+    error AlreadyExecuted();
 }
diff --git a/contracts/src/arbitration/PolicyRegistry.sol b/contracts/src/arbitration/PolicyRegistry.sol
index eb32476d6..f4ed36322 100644
--- a/contracts/src/arbitration/PolicyRegistry.sol
+++ b/contracts/src/arbitration/PolicyRegistry.sol
@@ -32,7 +32,7 @@ contract PolicyRegistry is UUPSProxiable, Initializable {
 
     /// @dev Requires that the sender is the governor.
     modifier onlyByGovernor() {
-        require(governor == msg.sender, "No allowed: governor only");
+        if (governor != msg.sender) revert GovernorOnly();
         _;
     }
 
@@ -85,4 +85,10 @@ contract PolicyRegistry is UUPSProxiable, Initializable {
         policies[_courtID] = _policy;
         emit PolicyUpdate(_courtID, _courtName, policies[_courtID]);
     }
+
+    // ************************************* //
+    // *              Errors               * //
+    // ************************************* //
+
+    error GovernorOnly();
 }
diff --git a/contracts/src/arbitration/SortitionModuleBase.sol b/contracts/src/arbitration/SortitionModuleBase.sol
index 577d9fd22..e49fd2c6c 100644
--- a/contracts/src/arbitration/SortitionModuleBase.sol
+++ b/contracts/src/arbitration/SortitionModuleBase.sol
@@ -122,12 +122,12 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
     // ************************************* //
 
     modifier onlyByGovernor() {
-        require(address(governor) == msg.sender, "Access not allowed: Governor only.");
+        if (governor != msg.sender) revert GovernorOnly();
         _;
     }
 
     modifier onlyByCore() {
-        require(address(core) == msg.sender, "Access not allowed: KlerosCore only.");
+        if (address(core) != msg.sender) revert KlerosCoreOnly();
         _;
     }
 
@@ -171,23 +171,19 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
 
     function passPhase() external {
         if (phase == Phase.staking) {
-            require(
-                block.timestamp - lastPhaseChange >= minStakingTime,
-                "The minimum staking time has not passed yet."
-            );
-            require(disputesWithoutJurors > 0, "There are no disputes that need jurors.");
+            if (block.timestamp - lastPhaseChange < minStakingTime) revert MinStakingTimeNotPassed();
+            if (disputesWithoutJurors == 0) revert NoDisputesThatNeedJurors();
             rng.requestRandomness(block.number + rngLookahead);
             randomNumberRequestBlock = block.number;
             phase = Phase.generating;
         } else if (phase == Phase.generating) {
             randomNumber = rng.receiveRandomness(randomNumberRequestBlock + rngLookahead);
-            require(randomNumber != 0, "Random number is not ready yet");
+            if (randomNumber == 0) revert RandomNumberNotReady();
             phase = Phase.drawing;
         } else if (phase == Phase.drawing) {
-            require(
-                disputesWithoutJurors == 0 || block.timestamp - lastPhaseChange >= maxDrawingTime,
-                "There are still disputes without jurors and the maximum drawing time has not passed yet."
-            );
+            if (disputesWithoutJurors > 0 && block.timestamp - lastPhaseChange < maxDrawingTime) {
+                revert DisputesWithoutJurorsAndMaxDrawingTimeNotPassed();
+            }
             phase = Phase.staking;
         }
 
@@ -201,8 +197,8 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
     function createTree(bytes32 _key, bytes memory _extraData) external override onlyByCore {
         SortitionSumTree storage tree = sortitionSumTrees[_key];
         uint256 K = _extraDataToTreeK(_extraData);
-        require(tree.K == 0, "Tree already exists.");
-        require(K > 1, "K must be greater than one.");
+        if (tree.K != 0) revert TreeAlreadyExists();
+        if (K <= 1) revert KMustBeGreaterThanOne();
         tree.K = K;
         tree.nodes.push(0);
     }
@@ -210,8 +206,8 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
     /// @dev Executes the next delayed stakes.
     /// @param _iterations The number of delayed stakes to execute.
     function executeDelayedStakes(uint256 _iterations) external {
-        require(phase == Phase.staking, "Should be in Staking phase.");
-        require(delayedStakeWriteIndex >= delayedStakeReadIndex, "No delayed stake to execute.");
+        if (phase != Phase.staking) revert NotStakingPhase();
+        if (delayedStakeWriteIndex < delayedStakeReadIndex) revert NoDelayedStakeToExecute();
 
         uint256 actualIterations = (delayedStakeReadIndex + _iterations) - 1 > delayedStakeWriteIndex
             ? (delayedStakeWriteIndex - delayedStakeReadIndex) + 1
@@ -420,7 +416,7 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
         // Can withdraw the leftover PNK if fully unstaked, has no tokens locked and has positive balance.
         // This withdrawal can't be triggered by calling setStake() in KlerosCore because current stake is technically 0, thus it is done via separate function.
         uint256 amount = getJurorLeftoverPNK(_account);
-        require(amount > 0, "Not eligible for withdrawal.");
+        if (amount == 0) revert NotEligibleForWithdrawal();
         jurors[_account].stakedPnk = 0;
         core.transferBySortitionModule(_account, amount);
         emit LeftoverPNKWithdrawn(_account, amount);
@@ -444,7 +440,7 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
         uint256 _coreDisputeID,
         uint256 _nonce
     ) public view override returns (address drawnAddress) {
-        require(phase == Phase.drawing, "Wrong phase.");
+        if (phase != Phase.drawing) revert NotDrawingPhase();
         SortitionSumTree storage tree = sortitionSumTrees[_key];
 
         if (tree.nodes[0] == 0) {
@@ -692,4 +688,21 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
             stakePathID := mload(ptr)
         }
     }
+
+    // ************************************* //
+    // *              Errors               * //
+    // ************************************* //
+
+    error GovernorOnly();
+    error KlerosCoreOnly();
+    error MinStakingTimeNotPassed();
+    error NoDisputesThatNeedJurors();
+    error RandomNumberNotReady();
+    error DisputesWithoutJurorsAndMaxDrawingTimeNotPassed();
+    error TreeAlreadyExists();
+    error KMustBeGreaterThanOne();
+    error NotStakingPhase();
+    error NoDelayedStakeToExecute();
+    error NotEligibleForWithdrawal();
+    error NotDrawingPhase();
 }
diff --git a/contracts/src/arbitration/arbitrables/ArbitrableExample.sol b/contracts/src/arbitration/arbitrables/ArbitrableExample.sol
index 810688788..b7596566e 100644
--- a/contracts/src/arbitration/arbitrables/ArbitrableExample.sol
+++ b/contracts/src/arbitration/arbitrables/ArbitrableExample.sol
@@ -37,7 +37,7 @@ contract ArbitrableExample is IArbitrableV2 {
     // ************************************* //
 
     modifier onlyByGovernor() {
-        require(msg.sender == governor, "Only the governor allowed.");
+        if (governor != msg.sender) revert GovernorOnly();
         _;
     }
 
@@ -126,8 +126,8 @@ contract ArbitrableExample is IArbitrableV2 {
         uint256 localDisputeID = disputes.length;
         disputes.push(DisputeStruct({isRuled: false, ruling: 0, numberOfRulingOptions: numberOfRulingOptions}));
 
-        require(weth.safeTransferFrom(msg.sender, address(this), _feeInWeth), "Transfer failed");
-        require(weth.increaseAllowance(address(arbitrator), _feeInWeth), "Allowance increase failed");
+        if (!weth.safeTransferFrom(msg.sender, address(this), _feeInWeth)) revert TransferFailed();
+        if (!weth.increaseAllowance(address(arbitrator), _feeInWeth)) revert AllowanceIncreaseFailed();
 
         disputeID = arbitrator.createDispute(numberOfRulingOptions, arbitratorExtraData, weth, _feeInWeth);
         externalIDtoLocalID[disputeID] = localDisputeID;
@@ -142,13 +142,24 @@ contract ArbitrableExample is IArbitrableV2 {
     function rule(uint256 _arbitratorDisputeID, uint256 _ruling) external override {
         uint256 localDisputeID = externalIDtoLocalID[_arbitratorDisputeID];
         DisputeStruct storage dispute = disputes[localDisputeID];
-        require(msg.sender == address(arbitrator), "Only the arbitrator can execute this.");
-        require(_ruling <= dispute.numberOfRulingOptions, "Invalid ruling.");
-        require(dispute.isRuled == false, "This dispute has been ruled already.");
+        if (msg.sender != address(arbitrator)) revert ArbitratorOnly();
+        if (_ruling > dispute.numberOfRulingOptions) revert RulingOutOfBounds();
+        if (dispute.isRuled) revert DisputeAlreadyRuled();
 
         dispute.isRuled = true;
         dispute.ruling = _ruling;
 
         emit Ruling(IArbitratorV2(msg.sender), _arbitratorDisputeID, dispute.ruling);
     }
+
+    // ************************************* //
+    // *              Errors               * //
+    // ************************************* //
+
+    error GovernorOnly();
+    error TransferFailed();
+    error AllowanceIncreaseFailed();
+    error ArbitratorOnly();
+    error RulingOutOfBounds();
+    error DisputeAlreadyRuled();
 }
diff --git a/contracts/src/arbitration/arbitrables/DisputeResolver.sol b/contracts/src/arbitration/arbitrables/DisputeResolver.sol
index 8fa1da02f..7248356cd 100644
--- a/contracts/src/arbitration/arbitrables/DisputeResolver.sol
+++ b/contracts/src/arbitration/arbitrables/DisputeResolver.sol
@@ -48,17 +48,17 @@ contract DisputeResolver is IArbitrableV2 {
     /// @dev Changes the governor.
     /// @param _governor The address of the new governor.
     function changeGovernor(address _governor) external {
-        require(governor == msg.sender, "Access not allowed: Governor only.");
+        if (governor != msg.sender) revert GovernorOnly();
         governor = _governor;
     }
 
     function changeArbitrator(IArbitratorV2 _arbitrator) external {
-        require(governor == msg.sender, "Access not allowed: Governor only.");
+        if (governor != msg.sender) revert GovernorOnly();
         arbitrator = _arbitrator;
     }
 
     function changeTemplateRegistry(IDisputeTemplateRegistry _templateRegistry) external {
-        require(governor == msg.sender, "Access not allowed: Governor only.");
+        if (governor != msg.sender) revert GovernorOnly();
         templateRegistry = _templateRegistry;
     }
 
@@ -109,9 +109,9 @@ contract DisputeResolver is IArbitrableV2 {
     function rule(uint256 _arbitratorDisputeID, uint256 _ruling) external override {
         uint256 localDisputeID = arbitratorDisputeIDToLocalID[_arbitratorDisputeID];
         DisputeStruct storage dispute = disputes[localDisputeID];
-        require(msg.sender == address(arbitrator), "Only the arbitrator can execute this.");
-        require(_ruling <= dispute.numberOfRulingOptions, "Invalid ruling.");
-        require(!dispute.isRuled, "This dispute has been ruled already.");
+        if (msg.sender != address(arbitrator)) revert ArbitratorOnly();
+        if (_ruling > dispute.numberOfRulingOptions) revert RulingOutOfBounds();
+        if (dispute.isRuled) revert DisputeAlreadyRuled();
 
         dispute.isRuled = true;
         dispute.ruling = _ruling;
@@ -130,7 +130,7 @@ contract DisputeResolver is IArbitrableV2 {
         string memory _disputeTemplateUri,
         uint256 _numberOfRulingOptions
     ) internal virtual returns (uint256 arbitratorDisputeID) {
-        require(_numberOfRulingOptions > 1, "Should be at least 2 ruling options.");
+        if (_numberOfRulingOptions <= 1) revert ShouldBeAtLeastTwoRulingOptions();
 
         arbitratorDisputeID = arbitrator.createDispute{value: msg.value}(_numberOfRulingOptions, _arbitratorExtraData);
         uint256 localDisputeID = disputes.length;
@@ -146,4 +146,14 @@ contract DisputeResolver is IArbitrableV2 {
         uint256 templateId = templateRegistry.setDisputeTemplate("", _disputeTemplate, _disputeTemplateDataMappings);
         emit DisputeRequest(arbitrator, arbitratorDisputeID, localDisputeID, templateId, _disputeTemplateUri);
     }
+
+    // ************************************* //
+    // *              Errors               * //
+    // ************************************* //
+
+    error GovernorOnly();
+    error ArbitratorOnly();
+    error RulingOutOfBounds();
+    error DisputeAlreadyRuled();
+    error ShouldBeAtLeastTwoRulingOptions();
 }
diff --git a/contracts/src/arbitration/devtools/DisputeResolverRuler.sol b/contracts/src/arbitration/devtools/DisputeResolverRuler.sol
index 85bede8bf..05c033c38 100644
--- a/contracts/src/arbitration/devtools/DisputeResolverRuler.sol
+++ b/contracts/src/arbitration/devtools/DisputeResolverRuler.sol
@@ -36,7 +36,7 @@ contract DisputeResolverRuler is DisputeResolver {
         string memory _disputeTemplateUri,
         uint256 _numberOfRulingOptions
     ) internal override returns (uint256 arbitratorDisputeID) {
-        require(_numberOfRulingOptions > 1, "Should be at least 2 ruling options.");
+        if (_numberOfRulingOptions <= 1) revert ShouldBeAtLeastTwoRulingOptions();
 
         uint256 localDisputeID = disputes.length;
         DisputeStruct storage dispute = disputes.push();
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index 9b1968400..2d804891a 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -125,17 +125,17 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     // ************************************* //
 
     modifier onlyByGovernor() {
-        require(governor == msg.sender, "Access not allowed: Governor only.");
+        if (governor != msg.sender) revert GovernorOnly();
         _;
     }
 
     modifier onlyByCore() {
-        require(address(core) == msg.sender, "Access not allowed: KlerosCore only.");
+        if (address(core) != msg.sender) revert KlerosCoreOnly();
         _;
     }
 
     modifier notJumped(uint256 _coreDisputeID) {
-        require(!disputes[coreDisputeIDToLocal[_coreDisputeID]].jumped, "Dispute jumped to a parent DK!");
+        if (disputes[coreDisputeIDToLocal[_coreDisputeID]].jumped) revert DisputeJumpedToParentDK();
         _;
     }
 
@@ -171,7 +171,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         bytes memory _data
     ) external onlyByGovernor {
         (bool success, ) = _destination.call{value: _amount}(_data);
-        require(success, "Unsuccessful call");
+        if (!success) revert UnsuccessfulCall();
     }
 
     /// @dev Changes the `governor` storage variable.
@@ -269,14 +269,14 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         bytes32 _commit
     ) internal notJumped(_coreDisputeID) {
         (, , KlerosCore.Period period, , ) = core.disputes(_coreDisputeID);
-        require(period == KlerosCoreBase.Period.commit, "The dispute should be in Commit period.");
-        require(_commit != bytes32(0), "Empty commit.");
-        require(coreDisputeIDToActive[_coreDisputeID], "Not active for core dispute ID");
+        if (period != KlerosCoreBase.Period.commit) revert NotCommitPeriod();
+        if (_commit == bytes32(0)) revert EmptyCommit();
+        if (!coreDisputeIDToActive[_coreDisputeID]) revert NotActiveForCoreDisputeID();
 
         Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];
         Round storage round = dispute.rounds[dispute.rounds.length - 1];
         for (uint256 i = 0; i < _voteIDs.length; i++) {
-            require(round.votes[_voteIDs[i]].account == msg.sender, "The caller has to own the vote.");
+            if (round.votes[_voteIDs[i]].account != msg.sender) revert JurorHasToOwnTheVote();
             round.votes[_voteIDs[i]].commit = _commit;
         }
         round.totalCommitted += _voteIDs.length;
@@ -310,12 +310,12 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         address _juror
     ) internal notJumped(_coreDisputeID) {
         (, , KlerosCore.Period period, , ) = core.disputes(_coreDisputeID);
-        require(period == KlerosCoreBase.Period.vote, "The dispute should be in Vote period.");
-        require(_voteIDs.length > 0, "No voteID provided");
-        require(coreDisputeIDToActive[_coreDisputeID], "Not active for core dispute ID");
+        if (period != KlerosCoreBase.Period.vote) revert NotVotePeriod();
+        if (_voteIDs.length == 0) revert EmptyVoteIDs();
+        if (!coreDisputeIDToActive[_coreDisputeID]) revert NotActiveForCoreDisputeID();
 
         Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];
-        require(_choice <= dispute.numberOfChoices, "Choice out of bounds");
+        if (_choice > dispute.numberOfChoices) revert ChoiceOutOfBounds();
 
         Round storage round = dispute.rounds[dispute.rounds.length - 1];
         {
@@ -325,12 +325,10 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
 
             //  Save the votes.
             for (uint256 i = 0; i < _voteIDs.length; i++) {
-                require(round.votes[_voteIDs[i]].account == _juror, "The juror has to own the vote.");
-                require(
-                    !hiddenVotes || round.votes[_voteIDs[i]].commit == voteHash,
-                    "The vote hash must match the commitment in courts with hidden votes."
-                );
-                require(!round.votes[_voteIDs[i]].voted, "Vote already cast.");
+                if (round.votes[_voteIDs[i]].account != _juror) revert JurorHasToOwnTheVote();
+                if (hiddenVotes && round.votes[_voteIDs[i]].commit != voteHash)
+                    revert HashDoesNotMatchHiddenVoteCommitment();
+                if (round.votes[_voteIDs[i]].voted) revert VoteAlreadyCast();
                 round.votes[_voteIDs[i]].choice = _choice;
                 round.votes[_voteIDs[i]].voted = true;
             }
@@ -361,29 +359,30 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     /// @param _choice A choice that receives funding.
     function fundAppeal(uint256 _coreDisputeID, uint256 _choice) external payable notJumped(_coreDisputeID) {
         Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];
-        require(_choice <= dispute.numberOfChoices, "There is no such ruling to fund.");
-        require(coreDisputeIDToActive[_coreDisputeID], "Not active for core dispute ID");
+        if (_choice > dispute.numberOfChoices) revert ChoiceOutOfBounds();
+        if (!coreDisputeIDToActive[_coreDisputeID]) revert NotActiveForCoreDisputeID();
 
         (uint256 appealPeriodStart, uint256 appealPeriodEnd) = core.appealPeriod(_coreDisputeID);
-        require(block.timestamp >= appealPeriodStart && block.timestamp < appealPeriodEnd, "Appeal period is over.");
+        if (block.timestamp < appealPeriodStart || block.timestamp >= appealPeriodEnd) revert AppealPeriodIsOver();
 
         uint256 multiplier;
         (uint256 ruling, , ) = this.currentRuling(_coreDisputeID);
         if (ruling == _choice) {
             multiplier = WINNER_STAKE_MULTIPLIER;
         } else {
-            require(
-                block.timestamp - appealPeriodStart <
-                    ((appealPeriodEnd - appealPeriodStart) * LOSER_APPEAL_PERIOD_MULTIPLIER) / ONE_BASIS_POINT,
-                "Appeal period is over for loser"
-            );
+            if (
+                block.timestamp - appealPeriodStart >=
+                ((appealPeriodEnd - appealPeriodStart) * LOSER_APPEAL_PERIOD_MULTIPLIER) / ONE_BASIS_POINT
+            ) {
+                revert AppealPeriodIsOverForLoser();
+            }
             multiplier = LOSER_STAKE_MULTIPLIER;
         }
 
         Round storage round = dispute.rounds[dispute.rounds.length - 1];
         uint256 coreRoundID = core.getNumberOfRounds(_coreDisputeID) - 1;
 
-        require(!round.hasPaid[_choice], "Appeal fee is already paid.");
+        if (round.hasPaid[_choice]) revert AppealFeeIsAlreadyPaid();
         uint256 appealCost = core.appealCost(_coreDisputeID);
         uint256 totalCost = appealCost + (appealCost * multiplier) / ONE_BASIS_POINT;
 
@@ -440,9 +439,9 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         uint256 _choice
     ) external returns (uint256 amount) {
         (, , , bool isRuled, ) = core.disputes(_coreDisputeID);
-        require(isRuled, "Dispute should be resolved.");
-        require(!core.paused(), "Core is paused");
-        require(coreDisputeIDToActive[_coreDisputeID], "Not active for core dispute ID");
+        if (!isRuled) revert DisputeNotResolved();
+        if (core.paused()) revert CoreIsPaused();
+        if (!coreDisputeIDToActive[_coreDisputeID]) revert NotActiveForCoreDisputeID();
 
         Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];
         Round storage round = dispute.rounds[dispute.coreRoundIDToLocal[_coreRoundID]];
@@ -710,4 +709,27 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
             result = true;
         }
     }
+
+    // ************************************* //
+    // *              Errors               * //
+    // ************************************* //
+
+    error GovernorOnly();
+    error KlerosCoreOnly();
+    error DisputeJumpedToParentDK();
+    error UnsuccessfulCall();
+    error NotCommitPeriod();
+    error EmptyCommit();
+    error NotActiveForCoreDisputeID();
+    error JurorHasToOwnTheVote();
+    error NotVotePeriod();
+    error EmptyVoteIDs();
+    error ChoiceOutOfBounds();
+    error HashDoesNotMatchHiddenVoteCommitment();
+    error VoteAlreadyCast();
+    error AppealPeriodIsOver();
+    error AppealPeriodIsOverForLoser();
+    error AppealFeeIsAlreadyPaid();
+    error DisputeNotResolved();
+    error CoreIsPaused();
 }
diff --git a/contracts/src/arbitration/evidence/EvidenceModule.sol b/contracts/src/arbitration/evidence/EvidenceModule.sol
index fe55122b9..4967597ab 100644
--- a/contracts/src/arbitration/evidence/EvidenceModule.sol
+++ b/contracts/src/arbitration/evidence/EvidenceModule.sol
@@ -22,7 +22,7 @@ contract EvidenceModule is IEvidence, Initializable, UUPSProxiable {
     // ************************************* //
 
     modifier onlyByGovernor() {
-        require(governor == msg.sender, "Access not allowed: Governor only.");
+        if (governor != msg.sender) revert GovernorOnly();
         _;
     }
 
@@ -67,4 +67,10 @@ contract EvidenceModule is IEvidence, Initializable, UUPSProxiable {
     function submitEvidence(uint256 _externalDisputeID, string calldata _evidence) external {
         emit Evidence(_externalDisputeID, msg.sender, _evidence);
     }
+
+    // ************************************* //
+    // *              Errors               * //
+    // ************************************* //
+
+    error GovernorOnly();
 }
diff --git a/contracts/src/arbitration/university/SortitionModuleUniversity.sol b/contracts/src/arbitration/university/SortitionModuleUniversity.sol
index 619a0b934..db61958fd 100644
--- a/contracts/src/arbitration/university/SortitionModuleUniversity.sol
+++ b/contracts/src/arbitration/university/SortitionModuleUniversity.sol
@@ -67,12 +67,12 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
     // ************************************* //
 
     modifier onlyByGovernor() {
-        require(address(governor) == msg.sender, "Access not allowed: Governor only.");
+        if (governor != msg.sender) revert GovernorOnly();
         _;
     }
 
     modifier onlyByCore() {
-        require(address(core) == msg.sender, "Access not allowed: KlerosCore only.");
+        if (address(core) != msg.sender) revert KlerosCoreOnly();
         _;
     }
 
@@ -280,7 +280,7 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
         // Can withdraw the leftover PNK if fully unstaked, has no tokens locked and has positive balance.
         // This withdrawal can't be triggered by calling setStake() in KlerosCore because current stake is technically 0, thus it is done via separate function.
         uint256 amount = getJurorLeftoverPNK(_account);
-        require(amount > 0, "Not eligible for withdrawal.");
+        if (amount == 0) revert NotEligibleForWithdrawal();
         jurors[_account].stakedPnk = 0;
         core.transferBySortitionModule(_account, amount);
         emit LeftoverPNKWithdrawn(_account, amount);
@@ -364,4 +364,12 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
             }
         }
     }
+
+    // ************************************* //
+    // *              Errors               * //
+    // ************************************* //
+
+    error GovernorOnly();
+    error KlerosCoreOnly();
+    error NotEligibleForWithdrawal();
 }
diff --git a/contracts/src/arbitration/view/KlerosCoreSnapshotProxy.sol b/contracts/src/arbitration/view/KlerosCoreSnapshotProxy.sol
index e94eccbd9..74cdb84ce 100644
--- a/contracts/src/arbitration/view/KlerosCoreSnapshotProxy.sol
+++ b/contracts/src/arbitration/view/KlerosCoreSnapshotProxy.sol
@@ -26,7 +26,7 @@ contract KlerosCoreSnapshotProxy {
     // ************************************* //
 
     modifier onlyByGovernor() {
-        require(governor == msg.sender, "Access not allowed: Governor only.");
+        if (governor != msg.sender) revert GovernorOnly();
         _;
     }
 
@@ -69,4 +69,10 @@ contract KlerosCoreSnapshotProxy {
     function balanceOf(address _account) external view returns (uint256 totalStaked) {
         (totalStaked, , , ) = core.sortitionModule().getJurorBalance(_account, 0);
     }
+
+    // ************************************* //
+    // *              Errors               * //
+    // ************************************* //
+
+    error GovernorOnly();
 }
diff --git a/contracts/test/arbitration/index.ts b/contracts/test/arbitration/index.ts
index d8e7ef089..4af7dfd63 100644
--- a/contracts/test/arbitration/index.ts
+++ b/contracts/test/arbitration/index.ts
@@ -73,9 +73,9 @@ describe("DisputeKitClassic", async () => {
   });
 
   it("Should create a dispute", async () => {
-    await expect(disputeKit.connect(deployer).createDispute(0, 0, ethers.toBeHex(3), "0x00")).to.be.revertedWith(
-      "Access not allowed: KlerosCore only."
-    );
+    await expect(
+      disputeKit.connect(deployer).createDispute(0, 0, ethers.toBeHex(3), "0x00")
+    ).to.be.revertedWithCustomError(disputeKit, "KlerosCoreOnly");
 
     const tx = await core
       .connect(deployer)
diff --git a/contracts/test/arbitration/staking-neo.ts b/contracts/test/arbitration/staking-neo.ts
index 85b0dc884..2f1523519 100644
--- a/contracts/test/arbitration/staking-neo.ts
+++ b/contracts/test/arbitration/staking-neo.ts
@@ -263,7 +263,10 @@ describe("Staking", async () => {
           );
           expect(await sortition.totalStaked()).to.be.equal(PNK(0));
           await drawAndReachStakingPhaseFromGenerating();
-          await expect(sortition.executeDelayedStakes(10)).to.revertedWith("No delayed stake to execute.");
+          await expect(sortition.executeDelayedStakes(10)).to.revertedWithCustomError(
+            sortition,
+            "NoDelayedStakeToExecute"
+          );
           expect(await sortition.totalStaked()).to.be.equal(PNK(0));
         });
 
@@ -327,7 +330,10 @@ describe("Staking", async () => {
           );
           expect(await sortition.totalStaked()).to.be.equal(PNK(2000));
           await drawAndReachStakingPhaseFromGenerating();
-          await expect(sortition.executeDelayedStakes(10)).to.revertedWith("No delayed stake to execute.");
+          await expect(sortition.executeDelayedStakes(10)).to.revertedWithCustomError(
+            sortition,
+            "NoDelayedStakeToExecute"
+          );
           expect(await sortition.totalStaked()).to.be.equal(PNK(2000));
         });
 
diff --git a/contracts/test/foundry/KlerosCore.t.sol b/contracts/test/foundry/KlerosCore.t.sol
index 20f8555a7..72a6a565c 100644
--- a/contracts/test/foundry/KlerosCore.t.sol
+++ b/contracts/test/foundry/KlerosCore.t.sol
@@ -1137,7 +1137,7 @@ contract KlerosCoreTest is Test {
         vm.prank(staker2);
         core.setStake(GENERAL_COURT, 10000);
 
-        vm.expectRevert(bytes("No delayed stake to execute."));
+        vm.expectRevert(SortitionModuleBase.NoDelayedStakeToExecute.selector);
         sortitionModule.executeDelayedStakes(5);
 
         // Set the stake and create a dispute to advance the phase
@@ -1150,7 +1150,7 @@ contract KlerosCoreTest is Test {
         uint256 disputeID = 0;
         core.draw(disputeID, DEFAULT_NB_OF_JURORS);
 
-        vm.expectRevert(bytes("Should be in Staking phase."));
+        vm.expectRevert(SortitionModuleBase.NotStakingPhase.selector);
         sortitionModule.executeDelayedStakes(5);
 
         // Create delayed stake
@@ -1270,14 +1270,14 @@ contract KlerosCoreTest is Test {
         assertEq(snapshotProxy.balanceOf(staker1), 12346, "Wrong stPNK balance");
 
         vm.prank(other);
-        vm.expectRevert(bytes("Access not allowed: Governor only."));
+        vm.expectRevert(KlerosCoreSnapshotProxy.GovernorOnly.selector);
         snapshotProxy.changeCore(IKlerosCore(other));
         vm.prank(governor);
         snapshotProxy.changeCore(IKlerosCore(other));
         assertEq(address(snapshotProxy.core()), other, "Wrong core in snapshot proxy after change");
 
         vm.prank(other);
-        vm.expectRevert(bytes("Access not allowed: Governor only."));
+        vm.expectRevert(KlerosCoreSnapshotProxy.GovernorOnly.selector);
         snapshotProxy.changeGovernor(other);
         vm.prank(governor);
         snapshotProxy.changeGovernor(other);
@@ -1565,7 +1565,7 @@ contract KlerosCoreTest is Test {
         voteIDs[0] = 0;
         bytes32 commit;
         vm.prank(staker1);
-        vm.expectRevert(bytes("The dispute should be in Commit period."));
+        vm.expectRevert(DisputeKitClassicBase.NotCommitPeriod.selector);
         disputeKit.castCommit(disputeID, voteIDs, commit);
 
         vm.expectRevert(KlerosCoreBase.EvidenceNotPassedAndNotAppeal.selector);
@@ -1582,13 +1582,13 @@ contract KlerosCoreTest is Test {
         assertEq(lastPeriodChange, block.timestamp, "Wrong lastPeriodChange");
 
         vm.prank(staker1);
-        vm.expectRevert(bytes("Empty commit."));
+        vm.expectRevert(DisputeKitClassicBase.EmptyCommit.selector);
         disputeKit.castCommit(disputeID, voteIDs, commit);
 
         commit = keccak256(abi.encodePacked(YES, salt));
 
         vm.prank(other);
-        vm.expectRevert(bytes("The caller has to own the vote."));
+        vm.expectRevert(DisputeKitClassicBase.JurorHasToOwnTheVote.selector);
         disputeKit.castCommit(disputeID, voteIDs, commit);
 
         vm.prank(staker1);
@@ -1626,11 +1626,11 @@ contract KlerosCoreTest is Test {
 
         // Check the require with the wrong choice and then with the wrong salt
         vm.prank(staker1);
-        vm.expectRevert(bytes("The vote hash must match the commitment in courts with hidden votes."));
+        vm.expectRevert(DisputeKitClassicBase.HashDoesNotMatchHiddenVoteCommitment.selector);
         disputeKit.castVote(disputeID, voteIDs, 2, salt, "XYZ");
 
         vm.prank(staker1);
-        vm.expectRevert(bytes("The vote hash must match the commitment in courts with hidden votes."));
+        vm.expectRevert(DisputeKitClassicBase.HashDoesNotMatchHiddenVoteCommitment.selector);
         disputeKit.castVote(disputeID, voteIDs, YES, salt - 1, "XYZ");
 
         vm.prank(staker1);
@@ -1698,7 +1698,7 @@ contract KlerosCoreTest is Test {
 
         uint256[] memory voteIDs = new uint256[](0);
         vm.prank(staker1);
-        vm.expectRevert(bytes("The dispute should be in Vote period."));
+        vm.expectRevert(DisputeKitClassicBase.NotVotePeriod.selector);
         disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ"); // Leave salt empty as not needed
 
         vm.expectRevert(KlerosCoreBase.DisputeStillDrawing.selector);
@@ -1716,17 +1716,17 @@ contract KlerosCoreTest is Test {
         assertEq(lastPeriodChange, block.timestamp, "Wrong lastPeriodChange");
 
         vm.prank(staker1);
-        vm.expectRevert(bytes("No voteID provided"));
+        vm.expectRevert(DisputeKitClassicBase.EmptyVoteIDs.selector);
         disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
 
         voteIDs = new uint256[](1);
         voteIDs[0] = 0; // Split vote IDs to see how the winner changes
         vm.prank(staker1);
-        vm.expectRevert(bytes("Choice out of bounds"));
+        vm.expectRevert(DisputeKitClassicBase.ChoiceOutOfBounds.selector);
         disputeKit.castVote(disputeID, voteIDs, 2 + 1, 0, "XYZ");
 
         vm.prank(other);
-        vm.expectRevert(bytes("The juror has to own the vote."));
+        vm.expectRevert(DisputeKitClassicBase.JurorHasToOwnTheVote.selector);
         disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
 
         vm.prank(staker1);
@@ -1735,7 +1735,7 @@ contract KlerosCoreTest is Test {
         disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
 
         vm.prank(staker1);
-        vm.expectRevert(bytes("Vote already cast."));
+        vm.expectRevert(DisputeKitClassicBase.VoteAlreadyCast.selector);
         disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
 
         (
@@ -1970,7 +1970,7 @@ contract KlerosCoreTest is Test {
         core.appeal{value: 0.21 ether}(disputeID, 2, arbitratorExtraData);
 
         vm.prank(crowdfunder1);
-        vm.expectRevert(bytes("There is no such ruling to fund."));
+        vm.expectRevert(DisputeKitClassicBase.ChoiceOutOfBounds.selector);
         disputeKit.fundAppeal(disputeID, 3);
 
         vm.prank(crowdfunder1);
@@ -1995,7 +1995,7 @@ contract KlerosCoreTest is Test {
         assertEq((disputeKit.getFundedChoices(disputeID))[0], 1, "Incorrect funded choice");
 
         vm.prank(crowdfunder1);
-        vm.expectRevert(bytes("Appeal fee is already paid."));
+        vm.expectRevert(DisputeKitClassicBase.AppealFeeIsAlreadyPaid.selector);
         disputeKit.fundAppeal(disputeID, 1);
     }
 
@@ -2024,7 +2024,7 @@ contract KlerosCoreTest is Test {
         disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
 
         vm.prank(crowdfunder1);
-        vm.expectRevert(bytes("Appeal period is over.")); // Appeal period not started yet
+        vm.expectRevert(DisputeKitClassicBase.AppealPeriodIsOver.selector);
         disputeKit.fundAppeal{value: 0.1 ether}(disputeID, 1);
         core.passPeriod(disputeID);
 
@@ -2032,14 +2032,14 @@ contract KlerosCoreTest is Test {
 
         vm.prank(crowdfunder1);
         vm.warp(block.timestamp + ((end - start) / 2 + 1));
-        vm.expectRevert(bytes("Appeal period is over for loser"));
+        vm.expectRevert(DisputeKitClassicBase.AppealPeriodIsOverForLoser.selector);
         disputeKit.fundAppeal{value: 0.1 ether}(disputeID, 1); // Losing choice
 
         disputeKit.fundAppeal(disputeID, 2); // Winning choice funding should not revert yet
 
         vm.prank(crowdfunder1);
         vm.warp(block.timestamp + (end - start) / 2); // Warp one more to cover the whole period
-        vm.expectRevert(bytes("Appeal period is over."));
+        vm.expectRevert(DisputeKitClassicBase.AppealPeriodIsOver.selector);
         disputeKit.fundAppeal{value: 0.1 ether}(disputeID, 2);
     }
 
@@ -2210,7 +2210,7 @@ contract KlerosCoreTest is Test {
 
         // Check jump modifier
         vm.prank(address(core));
-        vm.expectRevert(bytes("Dispute jumped to a parent DK!"));
+        vm.expectRevert(DisputeKitClassicBase.DisputeJumpedToParentDK.selector);
         newDisputeKit.draw(disputeID, 1);
 
         // And check that draw in the new round works
@@ -2594,7 +2594,7 @@ contract KlerosCoreTest is Test {
         assertEq(pinakion.balanceOf(address(core)), 1000, "Wrong token balance of the core");
         assertEq(pinakion.balanceOf(staker1), 999999999999999000, "Wrong token balance of staker1");
 
-        vm.expectRevert(bytes("Not eligible for withdrawal."));
+        vm.expectRevert(SortitionModuleBase.NotEligibleForWithdrawal.selector);
         sortitionModule.withdrawLeftoverPNK(staker1);
 
         vm.expectEmit(true, true, true, true);
@@ -2863,14 +2863,14 @@ contract KlerosCoreTest is Test {
         vm.warp(block.timestamp + timesPerPeriod[3]);
         core.passPeriod(disputeID); // Execution
 
-        vm.expectRevert(bytes("Dispute should be resolved."));
+        vm.expectRevert(DisputeKitClassicBase.DisputeNotResolved.selector);
         disputeKit.withdrawFeesAndRewards(disputeID, payable(staker1), 0, 1);
 
         core.executeRuling(disputeID);
 
         vm.prank(governor);
         core.pause();
-        vm.expectRevert(bytes("Core is paused"));
+        vm.expectRevert(DisputeKitClassicBase.CoreIsPaused.selector);
         disputeKit.withdrawFeesAndRewards(disputeID, payable(staker1), 0, 1);
         vm.prank(governor);
         core.unpause();
@@ -2969,7 +2969,7 @@ contract KlerosCoreTest is Test {
 
         // Deliberately cast votes using the old DK to see if the exception will be caught.
         vm.prank(staker1);
-        vm.expectRevert(bytes("Not active for core dispute ID"));
+        vm.expectRevert(DisputeKitClassicBase.NotActiveForCoreDisputeID.selector);
         disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
 
         // And check the new DK.

From 52f86ac76bfb5f963756329b2be77335ae728a69 Mon Sep 17 00:00:00 2001
From: Harman-singh-waraich <Waraichharman68@gmail.com>
Date: Wed, 13 Aug 2025 15:20:49 +0530
Subject: [PATCH 031/175] fix(web): return-undefined-data-if-not-token-gated

---
 web/src/utils/extradataToTokenInfo.ts | 9 +++------
 1 file changed, 3 insertions(+), 6 deletions(-)

diff --git a/web/src/utils/extradataToTokenInfo.ts b/web/src/utils/extradataToTokenInfo.ts
index 7feca7137..f4d3180b0 100644
--- a/web/src/utils/extradataToTokenInfo.ts
+++ b/web/src/utils/extradataToTokenInfo.ts
@@ -10,16 +10,13 @@ type GatedTokenInfo = {
  * @dev Decodes token information from encoded extra data.
  * @param extraData The extraData
  * @returns GatedTokenInfo object with tokenGate address, isERC1155 flag, and tokenId.
+ *          `undefined` if it's not a gated disputeKit
  */
-export function extraDataToTokenInfo(extraDataHex: `0x${string}`): GatedTokenInfo {
+export function extraDataToTokenInfo(extraDataHex: `0x${string}`): GatedTokenInfo | undefined {
   const extraDataBytes = hexToBytes(extraDataHex);
 
   if (extraDataBytes.length < 160) {
-    return {
-      tokenGate: "0x0000000000000000000000000000000000000000",
-      isERC1155: false,
-      tokenId: "0",
-    };
+    return;
   }
 
   // Slot 4 (bytes 96–127): packedTokenGateAndFlag

From a374113f9eb32fbe7489b46d71083779fe25fe32 Mon Sep 17 00:00:00 2001
From: Harman-singh-waraich <Waraichharman68@gmail.com>
Date: Wed, 13 Aug 2025 15:27:50 +0530
Subject: [PATCH 032/175] fix(web):
 disable-navigation-button-if-dispute-kit-undefined

---
 web/src/pages/Resolver/NavigationButtons/NextButton.tsx | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/web/src/pages/Resolver/NavigationButtons/NextButton.tsx b/web/src/pages/Resolver/NavigationButtons/NextButton.tsx
index 61d7e9228..e54082f44 100644
--- a/web/src/pages/Resolver/NavigationButtons/NextButton.tsx
+++ b/web/src/pages/Resolver/NavigationButtons/NextButton.tsx
@@ -41,7 +41,8 @@ const NextButton: React.FC<INextButton> = ({ nextRoute }) => {
   const isButtonDisabled =
     (location.pathname.includes("/resolver/title") && !disputeData.title) ||
     (location.pathname.includes("/resolver/description") && !disputeData.description) ||
-    (location.pathname.includes("/resolver/court") && (!disputeData.courtId || !isGatedTokenValid)) ||
+    (location.pathname.includes("/resolver/court") &&
+      (!disputeData.courtId || !isGatedTokenValid || !disputeData.disputeKitId)) ||
     (location.pathname.includes("/resolver/jurors") && !disputeData.arbitrationCost) ||
     (location.pathname.includes("/resolver/voting-options") && !areVotingOptionsFilled) ||
     (location.pathname.includes("/resolver/notable-persons") && !areAliasesValidOrEmpty) ||

From a0cb09d84f622eb31d2fbf39aa817db7e1eda055 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 13 Aug 2025 19:50:03 +0100
Subject: [PATCH 033/175] feat: replace requires with custom errors for the
 gateways

---
 contracts/src/gateway/ForeignGateway.sol | 45 +++++++++++++++---------
 contracts/src/gateway/HomeGateway.sol    | 33 +++++++++++------
 2 files changed, 51 insertions(+), 27 deletions(-)

diff --git a/contracts/src/gateway/ForeignGateway.sol b/contracts/src/gateway/ForeignGateway.sol
index 5938da773..1e615936f 100644
--- a/contracts/src/gateway/ForeignGateway.sol
+++ b/contracts/src/gateway/ForeignGateway.sol
@@ -49,17 +49,16 @@ contract ForeignGateway is IForeignGateway, UUPSProxiable, Initializable {
     // ************************************* //
 
     modifier onlyFromVea(address _messageSender) {
-        require(
-            veaOutbox == msg.sender ||
-                (block.timestamp < deprecatedVeaOutboxExpiration && deprecatedVeaOutbox == msg.sender),
-            "Access not allowed: Vea Outbox only."
-        );
-        require(_messageSender == homeGateway, "Access not allowed: HomeGateway only.");
+        if (
+            veaOutbox != msg.sender &&
+            (block.timestamp >= deprecatedVeaOutboxExpiration || deprecatedVeaOutbox != msg.sender)
+        ) revert VeaOutboxOnly();
+        if (_messageSender != homeGateway) revert HomeGatewayMessageSenderOnly();
         _;
     }
 
     modifier onlyByGovernor() {
-        require(governor == msg.sender, "Access not allowed: Governor only.");
+        if (governor != msg.sender) revert GovernorOnly();
         _;
     }
 
@@ -105,7 +104,7 @@ contract ForeignGateway is IForeignGateway, UUPSProxiable, Initializable {
     /// @dev Changes the governor.
     /// @param _governor The address of the new governor.
     function changeGovernor(address _governor) external {
-        require(governor == msg.sender, "Access not allowed: Governor only.");
+        if (governor != msg.sender) revert GovernorOnly();
         governor = _governor;
     }
 
@@ -122,7 +121,7 @@ contract ForeignGateway is IForeignGateway, UUPSProxiable, Initializable {
     /// @dev Changes the home gateway.
     /// @param _homeGateway The address of the new home gateway.
     function changeHomeGateway(address _homeGateway) external {
-        require(governor == msg.sender, "Access not allowed: Governor only.");
+        if (governor != msg.sender) revert GovernorOnly();
         homeGateway = _homeGateway;
     }
 
@@ -143,7 +142,7 @@ contract ForeignGateway is IForeignGateway, UUPSProxiable, Initializable {
         uint256 _choices,
         bytes calldata _extraData
     ) external payable override returns (uint256 disputeID) {
-        require(msg.value >= arbitrationCost(_extraData), "Not paid enough for arbitration");
+        if (msg.value < arbitrationCost(_extraData)) revert ArbitrationFeesNotEnough();
 
         disputeID = localDisputeID++;
         uint256 chainID;
@@ -206,8 +205,8 @@ contract ForeignGateway is IForeignGateway, UUPSProxiable, Initializable {
     ) external override onlyFromVea(_messageSender) {
         DisputeData storage dispute = disputeHashtoDisputeData[_disputeHash];
 
-        require(dispute.id != 0, "Dispute does not exist");
-        require(!dispute.ruled, "Cannot rule twice");
+        if (dispute.id == 0) revert DisputeDoesNotExist();
+        if (dispute.ruled) revert CannotRuleTwice();
 
         dispute.ruled = true;
         dispute.relayer = _relayer;
@@ -219,8 +218,8 @@ contract ForeignGateway is IForeignGateway, UUPSProxiable, Initializable {
     /// @inheritdoc IForeignGateway
     function withdrawFees(bytes32 _disputeHash) external override {
         DisputeData storage dispute = disputeHashtoDisputeData[_disputeHash];
-        require(dispute.id != 0, "Dispute does not exist");
-        require(dispute.ruled, "Not ruled yet");
+        if (dispute.id == 0) revert DisputeDoesNotExist();
+        if (!dispute.ruled) revert NotRuledYet();
 
         uint256 amount = dispute.paid;
         dispute.paid = 0;
@@ -247,9 +246,9 @@ contract ForeignGateway is IForeignGateway, UUPSProxiable, Initializable {
         revert("Not supported");
     }
 
-    // ************************ //
-    // *       Internal       * //
-    // ************************ //
+    // ************************************* //
+    // *            Internal               * //
+    // ************************************* //
 
     function extraDataToCourtIDMinJurors(
         bytes memory _extraData
@@ -268,4 +267,16 @@ contract ForeignGateway is IForeignGateway, UUPSProxiable, Initializable {
             minJurors = DEFAULT_NB_OF_JURORS;
         }
     }
+
+    // ************************************* //
+    // *              Errors               * //
+    // ************************************* //
+
+    error GovernorOnly();
+    error HomeGatewayMessageSenderOnly();
+    error VeaOutboxOnly();
+    error ArbitrationFeesNotEnough();
+    error DisputeDoesNotExist();
+    error CannotRuleTwice();
+    error NotRuledYet();
 }
diff --git a/contracts/src/gateway/HomeGateway.sol b/contracts/src/gateway/HomeGateway.sol
index 40a767790..2ef8e606f 100644
--- a/contracts/src/gateway/HomeGateway.sol
+++ b/contracts/src/gateway/HomeGateway.sol
@@ -45,7 +45,7 @@ contract HomeGateway is IHomeGateway, UUPSProxiable, Initializable {
 
     /// @dev Requires that the sender is the governor.
     modifier onlyByGovernor() {
-        require(governor == msg.sender, "No allowed: governor only");
+        if (governor != msg.sender) revert GovernorOnly();
         _;
     }
 
@@ -129,8 +129,8 @@ contract HomeGateway is IHomeGateway, UUPSProxiable, Initializable {
 
     /// @inheritdoc IHomeGateway
     function relayCreateDispute(RelayCreateDisputeParams memory _params) external payable override {
-        require(feeToken == NATIVE_CURRENCY, "Fees paid in ERC20 only");
-        require(_params.foreignChainID == foreignChainID, "Foreign chain ID not supported");
+        if (feeToken != NATIVE_CURRENCY) revert FeesPaidInNativeCurrencyOnly();
+        if (_params.foreignChainID != foreignChainID) revert ForeignChainIDNotSupported();
 
         bytes32 disputeHash = keccak256(
             abi.encodePacked(
@@ -144,7 +144,7 @@ contract HomeGateway is IHomeGateway, UUPSProxiable, Initializable {
             )
         );
         RelayedData storage relayedData = disputeHashtoRelayedData[disputeHash];
-        require(relayedData.relayer == address(0), "Dispute already relayed");
+        if (relayedData.relayer != address(0)) revert DisputeAlreadyRelayed();
 
         uint256 disputeID = arbitrator.createDispute{value: msg.value}(_params.choices, _params.extraData);
         disputeIDtoHash[disputeID] = disputeHash;
@@ -167,8 +167,8 @@ contract HomeGateway is IHomeGateway, UUPSProxiable, Initializable {
 
     /// @inheritdoc IHomeGateway
     function relayCreateDispute(RelayCreateDisputeParams memory _params, uint256 _feeAmount) external {
-        require(feeToken != NATIVE_CURRENCY, "Fees paid in native currency only");
-        require(_params.foreignChainID == foreignChainID, "Foreign chain ID not supported");
+        if (feeToken == NATIVE_CURRENCY) revert FeesPaidInERC20Only();
+        if (_params.foreignChainID != foreignChainID) revert ForeignChainIDNotSupported();
 
         bytes32 disputeHash = keccak256(
             abi.encodePacked(
@@ -182,10 +182,10 @@ contract HomeGateway is IHomeGateway, UUPSProxiable, Initializable {
             )
         );
         RelayedData storage relayedData = disputeHashtoRelayedData[disputeHash];
-        require(relayedData.relayer == address(0), "Dispute already relayed");
+        if (relayedData.relayer != address(0)) revert DisputeAlreadyRelayed();
 
-        require(feeToken.safeTransferFrom(msg.sender, address(this), _feeAmount), "Transfer failed");
-        require(feeToken.increaseAllowance(address(arbitrator), _feeAmount), "Allowance increase failed");
+        if (!feeToken.safeTransferFrom(msg.sender, address(this), _feeAmount)) revert TransferFailed();
+        if (!feeToken.increaseAllowance(address(arbitrator), _feeAmount)) revert AllowanceIncreaseFailed();
 
         uint256 disputeID = arbitrator.createDispute(_params.choices, _params.extraData, feeToken, _feeAmount);
         disputeIDtoHash[disputeID] = disputeHash;
@@ -209,7 +209,7 @@ contract HomeGateway is IHomeGateway, UUPSProxiable, Initializable {
 
     /// @inheritdoc IArbitrableV2
     function rule(uint256 _disputeID, uint256 _ruling) external override {
-        require(msg.sender == address(arbitrator), "Only Arbitrator");
+        if (msg.sender != address(arbitrator)) revert ArbitratorOnly();
 
         bytes32 disputeHash = disputeIDtoHash[_disputeID];
         RelayedData memory relayedData = disputeHashtoRelayedData[disputeHash];
@@ -234,4 +234,17 @@ contract HomeGateway is IHomeGateway, UUPSProxiable, Initializable {
     function receiverGateway() external view override returns (address) {
         return foreignGateway;
     }
+
+    // ************************************* //
+    // *              Errors               * //
+    // ************************************* //
+
+    error GovernorOnly();
+    error ArbitratorOnly();
+    error FeesPaidInERC20Only();
+    error FeesPaidInNativeCurrencyOnly();
+    error ForeignChainIDNotSupported();
+    error DisputeAlreadyRelayed();
+    error TransferFailed();
+    error AllowanceIncreaseFailed();
 }

From 5353ccf3922180e052bbd868360b77d314eaed41 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 13 Aug 2025 19:52:40 +0100
Subject: [PATCH 034/175] chore: changelog

---
 contracts/CHANGELOG.md | 1 +
 1 file changed, 1 insertion(+)

diff --git a/contracts/CHANGELOG.md b/contracts/CHANGELOG.md
index 800208b3e..0a0250ade 100644
--- a/contracts/CHANGELOG.md
+++ b/contracts/CHANGELOG.md
@@ -8,6 +8,7 @@ The format is based on [Common Changelog](https://common-changelog.org/).
 
 ### Changed
 
+- **Breaking:** Replace `require()` with `revert()` and custom errors outside KlerosCore for consistency and smaller bytecode ([#2084](https://github.com/kleros/kleros-v2/issues/2084))
 - Set the Hardhat Solidity version to v0.8.30 and enable the IR pipeline ([#2069](https://github.com/kleros/kleros-v2/issues/2069))
 - Set the Foundry Solidity version to v0.8.30 and enable the IR pipeline ([#2073](https://github.com/kleros/kleros-v2/issues/2073))
 - Widen the allowed solc version to any v0.8.x for the interfaces only ([#2083](https://github.com/kleros/kleros-v2/issues/2083))

From 3d211cc516589aa9125d55079a54515dd09c7162 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 13 Aug 2025 23:49:18 +0100
Subject: [PATCH 035/175] refactor: removed CappedMath, moved
 SortitionSumTreeFactory to `kleros-v1/libraries`

---
 .../evidence/ModeratedEvidenceModule.sol      | 15 ++++----
 .../kleros-liquid-xdai/xKlerosLiquidV2.sol    |  2 +-
 .../libraries/SortitionSumTreeFactory.sol     |  0
 contracts/src/libraries/CappedMath.sol        | 36 -------------------
 4 files changed, 8 insertions(+), 45 deletions(-)
 rename contracts/src/{ => kleros-v1}/libraries/SortitionSumTreeFactory.sol (100%)
 delete mode 100644 contracts/src/libraries/CappedMath.sol

diff --git a/contracts/src/arbitration/evidence/ModeratedEvidenceModule.sol b/contracts/src/arbitration/evidence/ModeratedEvidenceModule.sol
index dbfbd8adf..1c612265f 100644
--- a/contracts/src/arbitration/evidence/ModeratedEvidenceModule.sol
+++ b/contracts/src/arbitration/evidence/ModeratedEvidenceModule.sol
@@ -5,12 +5,9 @@ pragma solidity ^0.8.24;
 // TODO: standard interfaces should be placed in a separated repo (?)
 import {IArbitrableV2, IArbitratorV2} from "../interfaces/IArbitrableV2.sol";
 import "../interfaces/IDisputeTemplateRegistry.sol";
-import "../../libraries/CappedMath.sol";
 
 /// @title Implementation of the Evidence Standard with Moderated Submissions
 contract ModeratedEvidenceModule is IArbitrableV2 {
-    using CappedMath for uint256;
-
     // ************************************* //
     // *         Enums / Structs           * //
     // ************************************* //
@@ -205,8 +202,8 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
         ArbitratorData storage arbitratorData = arbitratorDataList[arbitratorDataList.length - 1];
 
         uint256 arbitrationCost = arbitrator.arbitrationCost(arbitratorData.arbitratorExtraData);
-        uint256 totalCost = arbitrationCost.mulCap(totalCostMultiplier) / MULTIPLIER_DIVISOR;
-        uint256 depositRequired = totalCost.mulCap(initialDepositMultiplier) / MULTIPLIER_DIVISOR;
+        uint256 totalCost = (arbitrationCost * totalCostMultiplier) / MULTIPLIER_DIVISOR;
+        uint256 depositRequired = (totalCost * initialDepositMultiplier) / MULTIPLIER_DIVISOR;
 
         Moderation storage moderation = evidenceData.moderations.push();
         // Overpaying is allowed.
@@ -245,12 +242,12 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
         ArbitratorData storage arbitratorData = arbitratorDataList[moderation.arbitratorDataID];
 
         uint256 arbitrationCost = arbitrator.arbitrationCost(arbitratorData.arbitratorExtraData);
-        uint256 totalCost = arbitrationCost.mulCap(totalCostMultiplier) / MULTIPLIER_DIVISOR;
+        uint256 totalCost = (arbitrationCost * totalCostMultiplier) / MULTIPLIER_DIVISOR;
 
         uint256 opposition = 3 - uint256(_side);
         uint256 depositRequired = moderation.paidFees[opposition] * 2;
         if (depositRequired == 0) {
-            depositRequired = totalCost.mulCap(initialDepositMultiplier) / MULTIPLIER_DIVISOR;
+            depositRequired = (totalCost * initialDepositMultiplier) / MULTIPLIER_DIVISOR;
         } else if (depositRequired > totalCost) {
             depositRequired = totalCost;
         }
@@ -317,7 +314,9 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
     ) internal returns (uint256) {
         uint256 contribution;
         uint256 remainingETH;
-        uint256 requiredAmount = _totalRequired.subCap(_moderation.paidFees[uint256(_side)]);
+        uint256 requiredAmount = _moderation.paidFees[uint256(_side)] >= _totalRequired
+            ? 0
+            : _totalRequired - _moderation.paidFees[uint256(_side)];
         (contribution, remainingETH) = calculateContribution(_amount, requiredAmount);
         _moderation.contributions[_contributor][uint256(_side)] += contribution;
         _moderation.paidFees[uint256(_side)] += contribution;
diff --git a/contracts/src/kleros-v1/kleros-liquid-xdai/xKlerosLiquidV2.sol b/contracts/src/kleros-v1/kleros-liquid-xdai/xKlerosLiquidV2.sol
index 0d7d97adb..d9c74946b 100644
--- a/contracts/src/kleros-v1/kleros-liquid-xdai/xKlerosLiquidV2.sol
+++ b/contracts/src/kleros-v1/kleros-liquid-xdai/xKlerosLiquidV2.sol
@@ -9,7 +9,7 @@ import {ITokenController} from "../interfaces/ITokenController.sol";
 import {WrappedPinakion} from "./WrappedPinakion.sol";
 import {IRandomAuRa} from "./interfaces/IRandomAuRa.sol";
 
-import {SortitionSumTreeFactory} from "../../libraries/SortitionSumTreeFactory.sol";
+import {SortitionSumTreeFactory} from "../libraries/SortitionSumTreeFactory.sol";
 import "../../gateway/interfaces/IForeignGateway.sol";
 
 /// @title xKlerosLiquidV2
diff --git a/contracts/src/libraries/SortitionSumTreeFactory.sol b/contracts/src/kleros-v1/libraries/SortitionSumTreeFactory.sol
similarity index 100%
rename from contracts/src/libraries/SortitionSumTreeFactory.sol
rename to contracts/src/kleros-v1/libraries/SortitionSumTreeFactory.sol
diff --git a/contracts/src/libraries/CappedMath.sol b/contracts/src/libraries/CappedMath.sol
deleted file mode 100644
index ce0cdf55c..000000000
--- a/contracts/src/libraries/CappedMath.sol
+++ /dev/null
@@ -1,36 +0,0 @@
-// SPDX-License-Identifier: MIT
-
-pragma solidity ^0.8.24;
-
-/// @title CappedMath
-/// @dev Math operations with caps for under and overflow.
-library CappedMath {
-    uint256 private constant UINT_MAX = type(uint256).max;
-
-    /// @dev Adds two unsigned integers, returns 2^256 - 1 on overflow.
-    function addCap(uint256 _a, uint256 _b) internal pure returns (uint256) {
-        unchecked {
-            uint256 c = _a + _b;
-            return c >= _a ? c : UINT_MAX;
-        }
-    }
-
-    /// @dev Subtracts two integers, returns 0 on underflow.
-    function subCap(uint256 _a, uint256 _b) internal pure returns (uint256) {
-        if (_b > _a) return 0;
-        else return _a - _b;
-    }
-
-    /// @dev Multiplies two unsigned integers, returns 2^256 - 1 on overflow.
-    function mulCap(uint256 _a, uint256 _b) internal pure returns (uint256) {
-        // Gas optimization: this is cheaper than requiring '_a' not being zero, but the
-        // benefit is lost if '_b' is also tested.
-        // See: https://github.com/OpenZeppelin/openzeppelin-solidity/pull/522
-        if (_a == 0) return 0;
-
-        unchecked {
-            uint256 c = _a * _b;
-            return c / _a == _b ? c : UINT_MAX;
-        }
-    }
-}

From 95f2803fa60e1417ad900ec008d6f74e373d4f3c Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 14 Aug 2025 00:55:06 +0100
Subject: [PATCH 036/175] refactor: consolidated ALPHA_DIVISOR and
 ONE_BASIS_POINTS

---
 contracts/src/arbitration/KlerosCoreBase.sol      | 15 +++++++--------
 .../dispute-kits/DisputeKitClassicBase.sol        |  2 +-
 contracts/src/libraries/Constants.sol             |  3 +++
 3 files changed, 11 insertions(+), 9 deletions(-)

diff --git a/contracts/src/arbitration/KlerosCoreBase.sol b/contracts/src/arbitration/KlerosCoreBase.sol
index 2b9998bda..387ff270f 100644
--- a/contracts/src/arbitration/KlerosCoreBase.sol
+++ b/contracts/src/arbitration/KlerosCoreBase.sol
@@ -88,7 +88,6 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
     // *             Storage               * //
     // ************************************* //
 
-    uint256 private constant ALPHA_DIVISOR = 1e4; // The number to divide `Court.alpha` by.
     uint256 private constant NON_PAYABLE_AMOUNT = (2 ** 256 - 2) / 2; // An amount higher than the supply of ETH.
 
     address public governor; // The governor of the contract.
@@ -775,13 +774,13 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
             _params.feePerJurorInRound,
             _params.pnkAtStakePerJurorInRound
         );
-        if (degreeOfCoherence > ALPHA_DIVISOR) {
+        if (degreeOfCoherence > ONE_BASIS_POINT) {
             // Make sure the degree doesn't exceed 1, though it should be ensured by the dispute kit.
-            degreeOfCoherence = ALPHA_DIVISOR;
+            degreeOfCoherence = ONE_BASIS_POINT;
         }
 
         // Fully coherent jurors won't be penalized.
-        uint256 penalty = (round.pnkAtStakePerJuror * (ALPHA_DIVISOR - degreeOfCoherence)) / ALPHA_DIVISOR;
+        uint256 penalty = (round.pnkAtStakePerJuror * (ONE_BASIS_POINT - degreeOfCoherence)) / ONE_BASIS_POINT;
 
         // Unlock the PNKs affected by the penalty
         address account = round.drawnJurors[_params.repartition];
@@ -835,8 +834,8 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
         );
 
         // Make sure the degree doesn't exceed 1, though it should be ensured by the dispute kit.
-        if (degreeOfCoherence > ALPHA_DIVISOR) {
-            degreeOfCoherence = ALPHA_DIVISOR;
+        if (degreeOfCoherence > ONE_BASIS_POINT) {
+            degreeOfCoherence = ONE_BASIS_POINT;
         }
 
         address account = round.drawnJurors[_params.repartition % _params.numberOfVotesInRound];
@@ -1062,7 +1061,7 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
     /// @param _degreeOfCoherence The degree of coherence in basis points.
     /// @return The amount after applying the degree of coherence.
     function _applyCoherence(uint256 _amount, uint256 _degreeOfCoherence) internal pure returns (uint256) {
-        return (_amount * _degreeOfCoherence) / ALPHA_DIVISOR;
+        return (_amount * _degreeOfCoherence) / ONE_BASIS_POINT;
     }
 
     /// @dev Calculates PNK at stake per juror based on court parameters
@@ -1070,7 +1069,7 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
     /// @param _alpha The alpha parameter for the court in basis points.
     /// @return The amount of PNK at stake per juror.
     function _calculatePnkAtStake(uint256 _minStake, uint256 _alpha) internal pure returns (uint256) {
-        return (_minStake * _alpha) / ALPHA_DIVISOR;
+        return (_minStake * _alpha) / ONE_BASIS_POINT;
     }
 
     /// @dev Toggles the dispute kit support for a given court.
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index 2d804891a..59b51e52b 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -6,6 +6,7 @@ import {KlerosCore, KlerosCoreBase, IDisputeKit, ISortitionModule} from "../Kler
 import {Initializable} from "../../proxy/Initializable.sol";
 import {UUPSProxiable} from "../../proxy/UUPSProxiable.sol";
 import {SafeSend} from "../../libraries/SafeSend.sol";
+import {ONE_BASIS_POINT} from "../../libraries/Constants.sol";
 
 /// @title DisputeKitClassicBase
 /// Abstract Dispute kit classic implementation of the Kleros v1 features including:
@@ -57,7 +58,6 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     uint256 public constant WINNER_STAKE_MULTIPLIER = 10000; // Multiplier of the appeal cost that the winner has to pay as fee stake for a round in basis points. Default is 1x of appeal fee.
     uint256 public constant LOSER_STAKE_MULTIPLIER = 20000; // Multiplier of the appeal cost that the loser has to pay as fee stake for a round in basis points. Default is 2x of appeal fee.
     uint256 public constant LOSER_APPEAL_PERIOD_MULTIPLIER = 5000; // Multiplier of the appeal period for the choice that wasn't voted for in the previous round, in basis points. Default is 1/2 of original appeal period.
-    uint256 public constant ONE_BASIS_POINT = 10000; // One basis point, for scaling.
 
     address public governor; // The governor of the contract.
     KlerosCore public core; // The Kleros Core arbitrator
diff --git a/contracts/src/libraries/Constants.sol b/contracts/src/libraries/Constants.sol
index bed573fa6..10c42d8a9 100644
--- a/contracts/src/libraries/Constants.sol
+++ b/contracts/src/libraries/Constants.sol
@@ -20,6 +20,9 @@ uint256 constant DEFAULT_K = 6; // Default number of children per node.
 uint256 constant DEFAULT_NB_OF_JURORS = 3; // The default number of jurors in a dispute.
 IERC20 constant NATIVE_CURRENCY = IERC20(address(0)); // The native currency, such as ETH on Arbitrum, Optimism and Ethereum L1.
 
+// Units
+uint256 constant ONE_BASIS_POINT = 10000;
+
 enum OnError {
     Revert,
     Return

From 277457c2458140f650c003932b6011c0b6c39445 Mon Sep 17 00:00:00 2001
From: unknownunknown1 <danil@kleros.io>
Date: Thu, 14 Aug 2025 18:09:36 +1000
Subject: [PATCH 037/175] feat(RNG): foundry test

---
 contracts/src/test/RNGMock.sol          |  19 ++++
 contracts/test/foundry/KlerosCore.t.sol | 111 ++++++++++++++++++++++++
 2 files changed, 130 insertions(+)
 create mode 100644 contracts/src/test/RNGMock.sol

diff --git a/contracts/src/test/RNGMock.sol b/contracts/src/test/RNGMock.sol
new file mode 100644
index 000000000..df372265d
--- /dev/null
+++ b/contracts/src/test/RNGMock.sol
@@ -0,0 +1,19 @@
+// SPDX-License-Identifier: MIT
+pragma solidity ^0.8.24;
+
+import "../rng/IRNG.sol";
+
+/// @title Simple mock rng to check fallback
+contract RNGMock is IRNG {
+    uint256 public randomNumber; // The number to return;
+
+    function setRN(uint256 _rn) external {
+        randomNumber = _rn;
+    }
+
+    function requestRandomness() external override {}
+
+    function receiveRandomness() external view override returns (uint256) {
+        return randomNumber;
+    }
+}
diff --git a/contracts/test/foundry/KlerosCore.t.sol b/contracts/test/foundry/KlerosCore.t.sol
index caa7afafb..7613fb4c3 100644
--- a/contracts/test/foundry/KlerosCore.t.sol
+++ b/contracts/test/foundry/KlerosCore.t.sol
@@ -12,6 +12,8 @@ import {ISortitionModule} from "../../src/arbitration/interfaces/ISortitionModul
 import {SortitionModuleMock, SortitionModuleBase} from "../../src/test/SortitionModuleMock.sol";
 import {UUPSProxy} from "../../src/proxy/UUPSProxy.sol";
 import {BlockHashRNG} from "../../src/rng/BlockHashRNG.sol";
+import {RNGWithFallback} from "../../src/rng/RNGWithFallback.sol";
+import {RNGMock} from "../../src/test/RNGMock.sol";
 import {PNK} from "../../src/token/PNK.sol";
 import {TestERC20} from "../../src/token/TestERC20.sol";
 import {ArbitrableExample, IArbitrableV2} from "../../src/arbitration/arbitrables/ArbitrableExample.sol";
@@ -2992,4 +2994,113 @@ contract KlerosCoreTest is Test {
         assertEq(totalCommited, 0, "totalCommited should be 0");
         assertEq(choiceCount, 3, "choiceCount should be 3");
     }
+
+    function test_RNGFallback() public {
+        RNGWithFallback rngFallback;
+        uint256 fallbackTimeout = 100;
+        RNGMock rngMock = new RNGMock();
+        rngFallback = new RNGWithFallback(msg.sender, address(sortitionModule), fallbackTimeout, rngMock);
+        assertEq(rngFallback.governor(), msg.sender, "Wrong governor");
+        assertEq(rngFallback.consumer(), address(sortitionModule), "Wrong sortition module address");
+        assertEq(address(rngFallback.rng()), address(rngMock), "Wrong RNG in fallback contract");
+        assertEq(rngFallback.fallbackTimeoutSeconds(), fallbackTimeout, "Wrong fallback timeout");
+        assertEq(rngFallback.requestTimestamp(), 0, "Request timestamp should be 0");
+
+        vm.prank(governor);
+        sortitionModule.changeRandomNumberGenerator(rngFallback);
+        assertEq(address(sortitionModule.rng()), address(rngFallback), "Wrong RNG address");
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 20000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+
+        sortitionModule.passPhase(); // Generating
+        assertEq(rngFallback.requestTimestamp(), block.timestamp, "Wrong request timestamp");
+
+        vm.expectRevert(SortitionModuleBase.RandomNumberNotReady.selector);
+        sortitionModule.passPhase();
+
+        vm.warp(block.timestamp + fallbackTimeout + 1);
+
+        // Pass several blocks too to see that correct block.number is still picked up.
+        vm.roll(block.number + 5);
+
+        vm.expectEmit(true, true, true, true);
+        emit RNGWithFallback.RNGFallback();
+        sortitionModule.passPhase(); // Drawing phase
+
+        assertEq(sortitionModule.randomNumber(), uint256(blockhash(block.number - 1)), "Wrong random number");
+    }
+
+    function test_RNGFallback_happyPath() public {
+        RNGWithFallback rngFallback;
+        uint256 fallbackTimeout = 100;
+        RNGMock rngMock = new RNGMock();
+        rngFallback = new RNGWithFallback(msg.sender, address(sortitionModule), fallbackTimeout, rngMock);
+
+        vm.prank(governor);
+        sortitionModule.changeRandomNumberGenerator(rngFallback);
+        assertEq(address(sortitionModule.rng()), address(rngFallback), "Wrong RNG address");
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 20000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+
+        assertEq(rngFallback.requestTimestamp(), 0, "Request timestamp should be 0");
+
+        sortitionModule.passPhase(); // Generating
+        assertEq(rngFallback.requestTimestamp(), block.timestamp, "Wrong request timestamp");
+
+        rngMock.setRN(123);
+
+        sortitionModule.passPhase(); // Drawing phase
+        assertEq(sortitionModule.randomNumber(), 123, "Wrong random number");
+    }
+
+    function test_RNGFallback_sanityChecks() public {
+        RNGWithFallback rngFallback;
+        uint256 fallbackTimeout = 100;
+        RNGMock rngMock = new RNGMock();
+        rngFallback = new RNGWithFallback(msg.sender, address(sortitionModule), fallbackTimeout, rngMock);
+
+        vm.expectRevert(bytes("Consumer only"));
+        vm.prank(governor);
+        rngFallback.requestRandomness();
+
+        vm.expectRevert(bytes("Consumer only"));
+        vm.prank(governor);
+        rngFallback.receiveRandomness();
+
+        vm.expectRevert(bytes("Governor only"));
+        vm.prank(other);
+        rngFallback.changeGovernor(other);
+        vm.prank(governor);
+        rngFallback.changeGovernor(other);
+        assertEq(rngFallback.governor(), other, "Wrong governor");
+
+        // Change governor back for convenience
+        vm.prank(other);
+        rngFallback.changeGovernor(governor);
+
+        vm.expectRevert(bytes("Governor only"));
+        vm.prank(other);
+        rngFallback.changeConsumer(other);
+        vm.prank(governor);
+        rngFallback.changeConsumer(other);
+        assertEq(rngFallback.consumer(), other, "Wrong consumer");
+
+        vm.expectRevert(bytes("Governor only"));
+        vm.prank(other);
+        rngFallback.changeFallbackTimeout(5);
+
+        vm.prank(governor);
+        vm.expectEmit(true, true, true, true);
+        emit RNGWithFallback.FallbackTimeoutChanged(5);
+        rngFallback.changeFallbackTimeout(5);
+        assertEq(rngFallback.fallbackTimeoutSeconds(), 5, "Wrong fallback timeout");
+    }
 }

From d1910cad5d90a07d1cd29817e7b70601dd18c0de Mon Sep 17 00:00:00 2001
From: Harman-singh-waraich <Waraichharman68@gmail.com>
Date: Thu, 14 Aug 2025 16:45:27 +0530
Subject: [PATCH 038/175] fix(web): timeline-bug-fix

---
 web/src/pages/Cases/CaseDetails/Timeline.tsx | 34 +++++++++++---------
 1 file changed, 18 insertions(+), 16 deletions(-)

diff --git a/web/src/pages/Cases/CaseDetails/Timeline.tsx b/web/src/pages/Cases/CaseDetails/Timeline.tsx
index 0dbf8fdfd..315d6df70 100644
--- a/web/src/pages/Cases/CaseDetails/Timeline.tsx
+++ b/web/src/pages/Cases/CaseDetails/Timeline.tsx
@@ -68,7 +68,7 @@ const Timeline: React.FC<{
   currentPeriodIndex: number;
 }> = ({ currentPeriodIndex, dispute }) => {
   const currentItemIndex = currentPeriodToCurrentItem(currentPeriodIndex, dispute?.court.hiddenVotes);
-  const items = useTimeline(dispute, currentItemIndex, currentItemIndex);
+  const items = useTimeline(dispute, currentPeriodIndex);
 
   return (
     <TimeLineContainer>
@@ -103,30 +103,26 @@ const currentPeriodToCurrentItem = (currentPeriodIndex: number, hiddenVotes?: bo
   else return currentPeriodIndex - 1;
 };
 
-const useTimeline = (dispute: DisputeDetailsQuery["dispute"], currentItemIndex: number, currentPeriodIndex: number) => {
+const useTimeline = (dispute: DisputeDetailsQuery["dispute"], currentPeriodIndex: number) => {
   const isDesktop = useIsDesktop();
-  const titles = useMemo(() => {
-    const titles = ["Evidence", "Voting", "Appeal", "Executed"];
-    if (dispute?.court.hiddenVotes) {
-      titles.splice(1, 0, "Commit");
-    }
-    return titles;
-  }, [dispute]);
+  const titles = ["Evidence", "Commit", "Voting", "Appeal", "Executed"];
+
   const deadlineCurrentPeriod = getDeadline(
     currentPeriodIndex,
     dispute?.lastPeriodChange,
     dispute?.court.timesPerPeriod
   );
+
   const countdown = useCountdown(deadlineCurrentPeriod);
   const getSubitems = (index: number): string[] | React.ReactNode[] => {
     if (typeof countdown !== "undefined" && dispute) {
       if (index === titles.length - 1) {
         return [];
-      } else if (index === currentItemIndex && countdown === 0) {
+      } else if (index === currentPeriodIndex && countdown === 0) {
         return ["Time's up!"];
-      } else if (index < currentItemIndex) {
+      } else if (index < currentPeriodIndex) {
         return [];
-      } else if (index === currentItemIndex) {
+      } else if (index === currentPeriodIndex) {
         return [secondsToDayHourMinute(countdown)];
       } else {
         return [secondsToDayHourMinute(dispute?.court.timesPerPeriod[index])];
@@ -134,10 +130,16 @@ const useTimeline = (dispute: DisputeDetailsQuery["dispute"], currentItemIndex:
     }
     return [<StyledSkeleton key={index} width={60} />];
   };
-  return titles.map((title, i) => ({
-    title: i + 1 < titles.length && isDesktop ? `${title} Period` : title,
-    subitems: getSubitems(i),
-  }));
+  return titles
+    .map((title, i) => {
+      // if not hidden votes, skip commit index
+      if (!dispute?.court.hiddenVotes && i === Periods.commit) return;
+      return {
+        title: i + 1 < titles.length && isDesktop ? `${title} Period` : title,
+        subitems: getSubitems(i),
+      };
+    })
+    .filter((item) => !isUndefined(item));
 };
 
 export const getDeadline = (

From 8d0edf4b79f2a2c7918e6567c9505df99e329d5d Mon Sep 17 00:00:00 2001
From: Harman-singh-waraich <Waraichharman68@gmail.com>
Date: Thu, 14 Aug 2025 18:48:53 +0530
Subject: [PATCH 039/175] chore: rabbit-review

---
 web/src/pages/Cases/CaseDetails/Timeline.tsx | 16 ++++++++--------
 1 file changed, 8 insertions(+), 8 deletions(-)

diff --git a/web/src/pages/Cases/CaseDetails/Timeline.tsx b/web/src/pages/Cases/CaseDetails/Timeline.tsx
index 315d6df70..3d8af7464 100644
--- a/web/src/pages/Cases/CaseDetails/Timeline.tsx
+++ b/web/src/pages/Cases/CaseDetails/Timeline.tsx
@@ -130,16 +130,16 @@ const useTimeline = (dispute: DisputeDetailsQuery["dispute"], currentPeriodIndex
     }
     return [<StyledSkeleton key={index} width={60} />];
   };
-  return titles
-    .map((title, i) => {
-      // if not hidden votes, skip commit index
-      if (!dispute?.court.hiddenVotes && i === Periods.commit) return;
-      return {
+  return titles.flatMap((title, i) => {
+    // if not hidden votes, skip commit index
+    if (!dispute?.court.hiddenVotes && i === Periods.commit) return [];
+    return [
+      {
         title: i + 1 < titles.length && isDesktop ? `${title} Period` : title,
         subitems: getSubitems(i),
-      };
-    })
-    .filter((item) => !isUndefined(item));
+      },
+    ];
+  });
 };
 
 export const getDeadline = (

From c1bad1debd64610833b11b3da150c2e8275df0e2 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 14 Aug 2025 14:46:41 +0100
Subject: [PATCH 040/175] docs: comment

---
 contracts/src/arbitration/KlerosCoreBase.sol | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/contracts/src/arbitration/KlerosCoreBase.sol b/contracts/src/arbitration/KlerosCoreBase.sol
index 387ff270f..fe1c53521 100644
--- a/contracts/src/arbitration/KlerosCoreBase.sol
+++ b/contracts/src/arbitration/KlerosCoreBase.sol
@@ -774,8 +774,9 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
             _params.feePerJurorInRound,
             _params.pnkAtStakePerJurorInRound
         );
+
+        // Guard against degree exceeding 1, though it should be ensured by the dispute kit.
         if (degreeOfCoherence > ONE_BASIS_POINT) {
-            // Make sure the degree doesn't exceed 1, though it should be ensured by the dispute kit.
             degreeOfCoherence = ONE_BASIS_POINT;
         }
 
@@ -833,7 +834,7 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
             _params.pnkAtStakePerJurorInRound
         );
 
-        // Make sure the degree doesn't exceed 1, though it should be ensured by the dispute kit.
+        // Guard against degree exceeding 1, though it should be ensured by the dispute kit.
         if (degreeOfCoherence > ONE_BASIS_POINT) {
             degreeOfCoherence = ONE_BASIS_POINT;
         }

From be3384723a23c297260a3b6487eb335c9e0a3dd4 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 14 Aug 2025 14:54:45 +0100
Subject: [PATCH 041/175] fix: typo in local variable

---
 contracts/src/arbitration/SortitionModuleBase.sol | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/contracts/src/arbitration/SortitionModuleBase.sol b/contracts/src/arbitration/SortitionModuleBase.sol
index e49fd2c6c..048fd3b40 100644
--- a/contracts/src/arbitration/SortitionModuleBase.sol
+++ b/contracts/src/arbitration/SortitionModuleBase.sol
@@ -344,14 +344,14 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
         // Update the sortition sum tree.
         bytes32 stakePathID = _accountAndCourtIDToStakePathID(_account, _courtID);
         bool finished = false;
-        uint96 currenCourtID = _courtID;
+        uint96 currentCourtID = _courtID;
         while (!finished) {
             // Tokens are also implicitly staked in parent courts through sortition module to increase the chance of being drawn.
-            _set(bytes32(uint256(currenCourtID)), _newStake, stakePathID);
-            if (currenCourtID == GENERAL_COURT) {
+            _set(bytes32(uint256(currentCourtID)), _newStake, stakePathID);
+            if (currentCourtID == GENERAL_COURT) {
                 finished = true;
             } else {
-                (currenCourtID, , , , , , ) = core.courts(currenCourtID); // Get the parent court.
+                (currentCourtID, , , , , , ) = core.courts(currentCourtID); // Get the parent court.
             }
         }
         emit StakeSet(_account, _courtID, _newStake, juror.stakedPnk);

From cabc743c5e55c94d095719a51c44d8db57136a9f Mon Sep 17 00:00:00 2001
From: kemuru <102478601+kemuru@users.noreply.github.com>
Date: Fri, 15 Aug 2025 00:32:54 +0200
Subject: [PATCH 042/175] chore: label text improvements

---
 web/src/components/DisputeView/CardLabels/index.tsx | 12 ++++++------
 1 file changed, 6 insertions(+), 6 deletions(-)

diff --git a/web/src/components/DisputeView/CardLabels/index.tsx b/web/src/components/DisputeView/CardLabels/index.tsx
index d6ca94a56..99b25b1fb 100644
--- a/web/src/components/DisputeView/CardLabels/index.tsx
+++ b/web/src/components/DisputeView/CardLabels/index.tsx
@@ -61,13 +61,13 @@ interface ICardLabels {
 }
 
 const LabelArgs: Record<string, { text: string; icon: React.FC<React.SVGAttributes<SVGElement>>; color: IColors }> = {
-  EvidenceTime: { text: "Evidence Time", icon: EvidenceIcon, color: "blue" },
-  NotDrawn: { text: "Not Drawn", icon: NotDrawnIcon, color: "grey" },
-  CanVote: { text: "Time to vote", icon: CanVoteIcon, color: "blue" },
-  Voted: { text: "I voted", icon: VotedIcon, color: "purple" },
-  DidNotVote: { text: "Didn't cast a vote", icon: ForgotToVoteIcon, color: "purple" },
+  EvidenceTime: { text: "Evidence time", icon: EvidenceIcon, color: "blue" },
+  NotDrawn: { text: "You were not drawn", icon: NotDrawnIcon, color: "grey" },
+  CanVote: { text: "You can vote", icon: CanVoteIcon, color: "blue" },
+  Voted: { text: "You voted", icon: VotedIcon, color: "purple" },
+  DidNotVote: { text: "You forgot to vote", icon: ForgotToVoteIcon, color: "purple" },
   CanFund: { text: "Appeal possible", icon: AppealIcon, color: "lightPurple" },
-  Funded: { text: "I funded", icon: FundedIcon, color: "lightPurple" },
+  Funded: { text: "You funded an appeal", icon: FundedIcon, color: "lightPurple" },
 };
 
 const getFundingRewards = (contributions: ClassicContribution[], closed: boolean) => {

From b19b82d4312f0b68e20b21639cadd4153c76c939 Mon Sep 17 00:00:00 2001
From: kemuru <102478601+kemuru@users.noreply.github.com>
Date: Fri, 15 Aug 2025 00:41:39 +0200
Subject: [PATCH 043/175] chore: add urgency and more clarity that it's right
 now

---
 web/src/components/DisputeView/CardLabels/index.tsx | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/web/src/components/DisputeView/CardLabels/index.tsx b/web/src/components/DisputeView/CardLabels/index.tsx
index 99b25b1fb..acc0a3e58 100644
--- a/web/src/components/DisputeView/CardLabels/index.tsx
+++ b/web/src/components/DisputeView/CardLabels/index.tsx
@@ -63,7 +63,7 @@ interface ICardLabels {
 const LabelArgs: Record<string, { text: string; icon: React.FC<React.SVGAttributes<SVGElement>>; color: IColors }> = {
   EvidenceTime: { text: "Evidence time", icon: EvidenceIcon, color: "blue" },
   NotDrawn: { text: "You were not drawn", icon: NotDrawnIcon, color: "grey" },
-  CanVote: { text: "You can vote", icon: CanVoteIcon, color: "blue" },
+  CanVote: { text: "You can vote now", icon: CanVoteIcon, color: "blue" },
   Voted: { text: "You voted", icon: VotedIcon, color: "purple" },
   DidNotVote: { text: "You forgot to vote", icon: ForgotToVoteIcon, color: "purple" },
   CanFund: { text: "Appeal possible", icon: AppealIcon, color: "lightPurple" },

From 1dbfedf4ef2efa7d431d83e8f1e3af49db500409 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Fri, 15 Aug 2025 00:46:30 +0100
Subject: [PATCH 044/175] feat: multi-dimensional degree of coherence for
 reward/penalties/pnk/eth

---
 contracts/src/arbitration/KlerosCoreBase.sol  | 33 ++++++------
 .../dispute-kits/DisputeKitClassicBase.sol    | 31 ++++++++++--
 .../arbitration/interfaces/IDisputeKit.sol    | 22 ++++++--
 .../university/KlerosCoreUniversity.sol       | 39 ++++++++-------
 .../kleros-liquid-xdai/xKlerosLiquidV2.sol    |  1 -
 contracts/test/foundry/KlerosCore.t.sol       | 50 ++++++++++++++++---
 6 files changed, 130 insertions(+), 46 deletions(-)

diff --git a/contracts/src/arbitration/KlerosCoreBase.sol b/contracts/src/arbitration/KlerosCoreBase.sol
index fe1c53521..8b768d8aa 100644
--- a/contracts/src/arbitration/KlerosCoreBase.sol
+++ b/contracts/src/arbitration/KlerosCoreBase.sol
@@ -767,7 +767,7 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
         IDisputeKit disputeKit = disputeKits[round.disputeKitID];
 
         // [0, 1] value that determines how coherent the juror was in this round, in basis points.
-        uint256 degreeOfCoherence = disputeKit.getDegreeOfCoherence(
+        uint256 coherence = disputeKit.getDegreeOfCoherencePenalty(
             _params.disputeID,
             _params.round,
             _params.repartition,
@@ -776,12 +776,12 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
         );
 
         // Guard against degree exceeding 1, though it should be ensured by the dispute kit.
-        if (degreeOfCoherence > ONE_BASIS_POINT) {
-            degreeOfCoherence = ONE_BASIS_POINT;
+        if (coherence > ONE_BASIS_POINT) {
+            coherence = ONE_BASIS_POINT;
         }
 
         // Fully coherent jurors won't be penalized.
-        uint256 penalty = (round.pnkAtStakePerJuror * (ONE_BASIS_POINT - degreeOfCoherence)) / ONE_BASIS_POINT;
+        uint256 penalty = (round.pnkAtStakePerJuror * (ONE_BASIS_POINT - coherence)) / ONE_BASIS_POINT;
 
         // Unlock the PNKs affected by the penalty
         address account = round.drawnJurors[_params.repartition];
@@ -794,7 +794,7 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
             account,
             _params.disputeID,
             _params.round,
-            degreeOfCoherence,
+            coherence,
             -int256(availablePenalty),
             0,
             round.feeToken
@@ -826,7 +826,7 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
         IDisputeKit disputeKit = disputeKits[round.disputeKitID];
 
         // [0, 1] value that determines how coherent the juror was in this round, in basis points.
-        uint256 degreeOfCoherence = disputeKit.getDegreeOfCoherence(
+        (uint256 pnkCoherence, uint256 feeCoherence) = disputeKit.getDegreeOfCoherenceReward(
             _params.disputeID,
             _params.round,
             _params.repartition % _params.numberOfVotesInRound,
@@ -835,20 +835,23 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
         );
 
         // Guard against degree exceeding 1, though it should be ensured by the dispute kit.
-        if (degreeOfCoherence > ONE_BASIS_POINT) {
-            degreeOfCoherence = ONE_BASIS_POINT;
+        if (pnkCoherence > ONE_BASIS_POINT) {
+            pnkCoherence = ONE_BASIS_POINT;
+        }
+        if (feeCoherence > ONE_BASIS_POINT) {
+            feeCoherence = ONE_BASIS_POINT;
         }
 
         address account = round.drawnJurors[_params.repartition % _params.numberOfVotesInRound];
-        uint256 pnkLocked = _applyCoherence(round.pnkAtStakePerJuror, degreeOfCoherence);
+        uint256 pnkLocked = _applyCoherence(round.pnkAtStakePerJuror, pnkCoherence);
 
         // Release the rest of the PNKs of the juror for this round.
         sortitionModule.unlockStake(account, pnkLocked);
 
         // Transfer the rewards
-        uint256 pnkReward = _applyCoherence(_params.pnkPenaltiesInRound / _params.coherentCount, degreeOfCoherence);
+        uint256 pnkReward = _applyCoherence(_params.pnkPenaltiesInRound / _params.coherentCount, pnkCoherence);
         round.sumPnkRewardPaid += pnkReward;
-        uint256 feeReward = _applyCoherence(round.totalFeesForJurors / _params.coherentCount, degreeOfCoherence);
+        uint256 feeReward = _applyCoherence(round.totalFeesForJurors / _params.coherentCount, feeCoherence);
         round.sumFeeRewardPaid += feeReward;
         pinakion.safeTransfer(account, pnkReward);
         _transferFeeToken(round.feeToken, payable(account), feeReward);
@@ -856,7 +859,7 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
             account,
             _params.disputeID,
             _params.round,
-            degreeOfCoherence,
+            pnkCoherence,
             int256(pnkReward),
             int256(feeReward),
             round.feeToken
@@ -1059,10 +1062,10 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
 
     /// @dev Applies degree of coherence to an amount
     /// @param _amount The base amount to apply coherence to.
-    /// @param _degreeOfCoherence The degree of coherence in basis points.
+    /// @param _coherence The degree of coherence in basis points.
     /// @return The amount after applying the degree of coherence.
-    function _applyCoherence(uint256 _amount, uint256 _degreeOfCoherence) internal pure returns (uint256) {
-        return (_amount * _degreeOfCoherence) / ONE_BASIS_POINT;
+    function _applyCoherence(uint256 _amount, uint256 _coherence) internal pure returns (uint256) {
+        return (_amount * _coherence) / ONE_BASIS_POINT;
     }
 
     /// @dev Calculates PNK at stake per juror based on court parameters
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index 59b51e52b..0922f047b 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -526,14 +526,39 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
     /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.
     /// @param _voteID The ID of the vote.
-    /// @return The degree of coherence in basis points.
-    function getDegreeOfCoherence(
+    /// @return pnkCoherence The degree of coherence in basis points for the dispute PNK reward.
+    /// @return feeCoherence The degree of coherence in basis points for the dispute fee reward.
+    function getDegreeOfCoherenceReward(
         uint256 _coreDisputeID,
         uint256 _coreRoundID,
         uint256 _voteID,
         uint256 /* _feePerJuror */,
         uint256 /* _pnkAtStakePerJuror */
-    ) external view override returns (uint256) {
+    ) external view override returns (uint256 pnkCoherence, uint256 feeCoherence) {
+        uint256 coherence = _getDegreeOfCoherence(_coreDisputeID, _coreRoundID, _voteID);
+        return (coherence, coherence);
+    }
+
+    /// @dev Gets the degree of coherence of a particular voter. This function is called by Kleros Core in order to determine the amount of the penalty.
+    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
+    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.
+    /// @param _voteID The ID of the vote.
+    /// @return pnkCoherence The degree of coherence in basis points for the dispute PNK reward.
+    function getDegreeOfCoherencePenalty(
+        uint256 _coreDisputeID,
+        uint256 _coreRoundID,
+        uint256 _voteID,
+        uint256 /* _feePerJuror */,
+        uint256 /* _pnkAtStakePerJuror */
+    ) external view override returns (uint256 pnkCoherence) {
+        return _getDegreeOfCoherence(_coreDisputeID, _coreRoundID, _voteID);
+    }
+
+    function _getDegreeOfCoherence(
+        uint256 _coreDisputeID,
+        uint256 _coreRoundID,
+        uint256 _voteID
+    ) internal view returns (uint256 coherence) {
         // In this contract this degree can be either 0 or 1, but in other dispute kits this value can be something in between.
         Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];
         Vote storage vote = dispute.rounds[dispute.coreRoundIDToLocal[_coreRoundID]].votes[_voteID];
diff --git a/contracts/src/arbitration/interfaces/IDisputeKit.sol b/contracts/src/arbitration/interfaces/IDisputeKit.sol
index 423f38e3e..6a72b35e4 100644
--- a/contracts/src/arbitration/interfaces/IDisputeKit.sol
+++ b/contracts/src/arbitration/interfaces/IDisputeKit.sol
@@ -67,14 +67,30 @@ interface IDisputeKit {
     /// @param _voteID The ID of the vote.
     /// @param _feePerJuror The fee per juror.
     /// @param _pnkAtStakePerJuror The PNK at stake per juror.
-    /// @return The degree of coherence in basis points.
-    function getDegreeOfCoherence(
+    /// @return pnkCoherence The degree of coherence in basis points for the dispute PNK reward.
+    /// @return feeCoherence The degree of coherence in basis points for the dispute fee reward.
+    function getDegreeOfCoherenceReward(
         uint256 _coreDisputeID,
         uint256 _coreRoundID,
         uint256 _voteID,
         uint256 _feePerJuror,
         uint256 _pnkAtStakePerJuror
-    ) external view returns (uint256);
+    ) external view returns (uint256 pnkCoherence, uint256 feeCoherence);
+
+    /// @dev Gets the degree of coherence of a particular voter. This function is called by Kleros Core in order to determine the amount of the penalty.
+    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
+    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.
+    /// @param _voteID The ID of the vote.
+    /// @param _feePerJuror The fee per juror.
+    /// @param _pnkAtStakePerJuror The PNK at stake per juror.
+    /// @return pnkCoherence The degree of coherence in basis points for the dispute PNK reward.
+    function getDegreeOfCoherencePenalty(
+        uint256 _coreDisputeID,
+        uint256 _coreRoundID,
+        uint256 _voteID,
+        uint256 _feePerJuror,
+        uint256 _pnkAtStakePerJuror
+    ) external view returns (uint256 pnkCoherence);
 
     /// @dev Gets the number of jurors who are eligible to a reward in this round.
     /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
diff --git a/contracts/src/arbitration/university/KlerosCoreUniversity.sol b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
index 35fd5262c..5744088b0 100644
--- a/contracts/src/arbitration/university/KlerosCoreUniversity.sol
+++ b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
@@ -6,9 +6,9 @@ import {IArbitrableV2, IArbitratorV2} from "../interfaces/IArbitratorV2.sol";
 import {IDisputeKit} from "../interfaces/IDisputeKit.sol";
 import {ISortitionModuleUniversity} from "./ISortitionModuleUniversity.sol";
 import {SafeERC20, IERC20} from "../../libraries/SafeERC20.sol";
-import "../../libraries/Constants.sol";
 import {UUPSProxiable} from "../../proxy/UUPSProxiable.sol";
 import {Initializable} from "../../proxy/Initializable.sol";
+import "../../libraries/Constants.sol";
 
 /// @title KlerosCoreUniversity
 /// Core arbitrator contract for educational purposes.
@@ -87,7 +87,6 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
     // *             Storage               * //
     // ************************************* //
 
-    uint256 private constant ALPHA_DIVISOR = 1e4; // The number to divide `Court.alpha` by.
     uint256 private constant NON_PAYABLE_AMOUNT = (2 ** 256 - 2) / 2; // An amount higher than the supply of ETH.
 
     address public governor; // The governor of the contract.
@@ -526,7 +525,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
             : convertEthToTokenAmount(_feeToken, court.feeForJuror);
         round.nbVotes = _feeAmount / feeForJuror;
         round.disputeKitID = disputeKitID;
-        round.pnkAtStakePerJuror = (court.minStake * court.alpha) / ALPHA_DIVISOR;
+        round.pnkAtStakePerJuror = (court.minStake * court.alpha) / ONE_BASIS_POINT;
         round.totalFeesForJurors = _feeAmount;
         round.feeToken = IERC20(_feeToken);
 
@@ -655,7 +654,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
 
         Court storage court = courts[newCourtID];
         extraRound.nbVotes = msg.value / court.feeForJuror; // As many votes that can be afforded by the provided funds.
-        extraRound.pnkAtStakePerJuror = (court.minStake * court.alpha) / ALPHA_DIVISOR;
+        extraRound.pnkAtStakePerJuror = (court.minStake * court.alpha) / ONE_BASIS_POINT;
         extraRound.totalFeesForJurors = msg.value;
         extraRound.disputeKitID = newDisputeKitID;
 
@@ -754,20 +753,21 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         IDisputeKit disputeKit = disputeKits[round.disputeKitID];
 
         // [0, 1] value that determines how coherent the juror was in this round, in basis points.
-        uint256 degreeOfCoherence = disputeKit.getDegreeOfCoherence(
+        uint256 coherence = disputeKit.getDegreeOfCoherencePenalty(
             _params.disputeID,
             _params.round,
             _params.repartition,
             _params.feePerJurorInRound,
             _params.pnkAtStakePerJurorInRound
         );
-        if (degreeOfCoherence > ALPHA_DIVISOR) {
-            // Make sure the degree doesn't exceed 1, though it should be ensured by the dispute kit.
-            degreeOfCoherence = ALPHA_DIVISOR;
+
+        // Guard against degree exceeding 1, though it should be ensured by the dispute kit.
+        if (coherence > ONE_BASIS_POINT) {
+            coherence = ONE_BASIS_POINT;
         }
 
         // Fully coherent jurors won't be penalized.
-        uint256 penalty = (round.pnkAtStakePerJuror * (ALPHA_DIVISOR - degreeOfCoherence)) / ALPHA_DIVISOR;
+        uint256 penalty = (round.pnkAtStakePerJuror * (ONE_BASIS_POINT - coherence)) / ONE_BASIS_POINT;
 
         // Unlock the PNKs affected by the penalty
         address account = round.drawnJurors[_params.repartition];
@@ -780,7 +780,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
             account,
             _params.disputeID,
             _params.round,
-            degreeOfCoherence,
+            coherence,
             -int256(availablePenalty),
             0,
             round.feeToken
@@ -818,7 +818,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         IDisputeKit disputeKit = disputeKits[round.disputeKitID];
 
         // [0, 1] value that determines how coherent the juror was in this round, in basis points.
-        uint256 degreeOfCoherence = disputeKit.getDegreeOfCoherence(
+        (uint256 pnkCoherence, uint256 feeCoherence) = disputeKit.getDegreeOfCoherenceReward(
             _params.disputeID,
             _params.round,
             _params.repartition % _params.numberOfVotesInRound,
@@ -826,21 +826,24 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
             _params.pnkAtStakePerJurorInRound
         );
 
-        // Make sure the degree doesn't exceed 1, though it should be ensured by the dispute kit.
-        if (degreeOfCoherence > ALPHA_DIVISOR) {
-            degreeOfCoherence = ALPHA_DIVISOR;
+        // Guard against degree exceeding 1, though it should be ensured by the dispute kit.
+        if (pnkCoherence > ONE_BASIS_POINT) {
+            pnkCoherence = ONE_BASIS_POINT;
+        }
+        if (feeCoherence > ONE_BASIS_POINT) {
+            feeCoherence = ONE_BASIS_POINT;
         }
 
         address account = round.drawnJurors[_params.repartition % _params.numberOfVotesInRound];
-        uint256 pnkLocked = (round.pnkAtStakePerJuror * degreeOfCoherence) / ALPHA_DIVISOR;
+        uint256 pnkLocked = (round.pnkAtStakePerJuror * pnkCoherence) / ONE_BASIS_POINT;
 
         // Release the rest of the PNKs of the juror for this round.
         sortitionModule.unlockStake(account, pnkLocked);
 
         // Transfer the rewards
-        uint256 pnkReward = ((_params.pnkPenaltiesInRound / _params.coherentCount) * degreeOfCoherence) / ALPHA_DIVISOR;
+        uint256 pnkReward = ((_params.pnkPenaltiesInRound / _params.coherentCount) * pnkCoherence) / ONE_BASIS_POINT;
         round.sumPnkRewardPaid += pnkReward;
-        uint256 feeReward = ((round.totalFeesForJurors / _params.coherentCount) * degreeOfCoherence) / ALPHA_DIVISOR;
+        uint256 feeReward = ((round.totalFeesForJurors / _params.coherentCount) * feeCoherence) / ONE_BASIS_POINT;
         round.sumFeeRewardPaid += feeReward;
         pinakion.safeTransfer(account, pnkReward);
         if (round.feeToken == NATIVE_CURRENCY) {
@@ -854,7 +857,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
             account,
             _params.disputeID,
             _params.round,
-            degreeOfCoherence,
+            pnkCoherence,
             int256(pnkReward),
             int256(feeReward),
             round.feeToken
diff --git a/contracts/src/kleros-v1/kleros-liquid-xdai/xKlerosLiquidV2.sol b/contracts/src/kleros-v1/kleros-liquid-xdai/xKlerosLiquidV2.sol
index d9c74946b..9a25909b7 100644
--- a/contracts/src/kleros-v1/kleros-liquid-xdai/xKlerosLiquidV2.sol
+++ b/contracts/src/kleros-v1/kleros-liquid-xdai/xKlerosLiquidV2.sol
@@ -141,7 +141,6 @@ contract xKlerosLiquidV2 is Initializable, ITokenController, IArbitratorV2 {
     uint256 public constant MAX_STAKE_PATHS = 4; // The maximum number of stake paths a juror can have.
     uint256 public constant DEFAULT_NB_OF_JURORS = 3; // The default number of jurors in a dispute.
     uint256 public constant NON_PAYABLE_AMOUNT = (2 ** 256 - 2) / 2; // An amount higher than the supply of ETH.
-    uint256 public constant ALPHA_DIVISOR = 1e4; // The number to divide `Court.alpha` by.
     // General Contracts
     address public governor; // The governor of the contract.
     WrappedPinakion public pinakion; // The Pinakion token contract.
diff --git a/contracts/test/foundry/KlerosCore.t.sol b/contracts/test/foundry/KlerosCore.t.sol
index 72a6a565c..a2508ad70 100644
--- a/contracts/test/foundry/KlerosCore.t.sol
+++ b/contracts/test/foundry/KlerosCore.t.sol
@@ -2311,10 +2311,33 @@ contract KlerosCoreTest is Test {
         core.unpause();
 
         assertEq(disputeKit.getCoherentCount(disputeID, 0), 2, "Wrong coherent count");
+
+        uint256 pnkCoherence;
+        uint256 feeCoherence;
         // dispute, round, voteID, feeForJuror (not used in classic DK), pnkPerJuror (not used in classic DK)
-        assertEq(disputeKit.getDegreeOfCoherence(disputeID, 0, 0, 0, 0), 0, "Wrong degree of coherence 0 vote ID");
-        assertEq(disputeKit.getDegreeOfCoherence(disputeID, 0, 1, 0, 0), 10000, "Wrong degree of coherence 1 vote ID");
-        assertEq(disputeKit.getDegreeOfCoherence(disputeID, 0, 2, 0, 0), 10000, "Wrong degree of coherence 2 vote ID");
+        (pnkCoherence, feeCoherence) = disputeKit.getDegreeOfCoherenceReward(disputeID, 0, 0, 0, 0);
+        assertEq(pnkCoherence, 0, "Wrong reward pnk coherence 0 vote ID");
+        assertEq(feeCoherence, 0, "Wrong reward fee coherence 0 vote ID");
+
+        (pnkCoherence, feeCoherence) = disputeKit.getDegreeOfCoherenceReward(disputeID, 0, 1, 0, 0);
+        assertEq(pnkCoherence, 10000, "Wrong reward pnk coherence 1 vote ID");
+        assertEq(feeCoherence, 10000, "Wrong reward fee coherence 1 vote ID");
+
+        (pnkCoherence, feeCoherence) = disputeKit.getDegreeOfCoherenceReward(disputeID, 0, 2, 0, 0);
+        assertEq(pnkCoherence, 10000, "Wrong reward pnk coherence 2 vote ID");
+        assertEq(feeCoherence, 10000, "Wrong reward fee coherence 2 vote ID");
+
+        assertEq(disputeKit.getDegreeOfCoherencePenalty(disputeID, 0, 0, 0, 0), 0, "Wrong penalty coherence 0 vote ID");
+        assertEq(
+            disputeKit.getDegreeOfCoherencePenalty(disputeID, 0, 1, 0, 0),
+            10000,
+            "Wrong penalty coherence 1 vote ID"
+        );
+        assertEq(
+            disputeKit.getDegreeOfCoherencePenalty(disputeID, 0, 2, 0, 0),
+            10000,
+            "Wrong penalty coherence 2 vote ID"
+        );
 
         vm.expectEmit(true, true, true, true);
         emit SortitionModuleBase.StakeLocked(staker1, 1000, true);
@@ -2398,10 +2421,25 @@ contract KlerosCoreTest is Test {
         core.passPeriod(disputeID); // Execution
 
         assertEq(disputeKit.getCoherentCount(disputeID, 0), 0, "Wrong coherent count");
+
+        uint256 pnkCoherence;
+        uint256 feeCoherence;
         // dispute, round, voteID, feeForJuror (not used in classic DK), pnkPerJuror (not used in classic DK)
-        assertEq(disputeKit.getDegreeOfCoherence(disputeID, 0, 0, 0, 0), 0, "Wrong degree of coherence 0 vote ID");
-        assertEq(disputeKit.getDegreeOfCoherence(disputeID, 0, 1, 0, 0), 0, "Wrong degree of coherence 1 vote ID");
-        assertEq(disputeKit.getDegreeOfCoherence(disputeID, 0, 2, 0, 0), 0, "Wrong degree of coherence 2 vote ID");
+        (pnkCoherence, feeCoherence) = disputeKit.getDegreeOfCoherenceReward(disputeID, 0, 0, 0, 0);
+        assertEq(pnkCoherence, 0, "Wrong reward pnk coherence 0 vote ID");
+        assertEq(feeCoherence, 0, "Wrong reward fee coherence 0 vote ID");
+
+        (pnkCoherence, feeCoherence) = disputeKit.getDegreeOfCoherenceReward(disputeID, 0, 1, 0, 0);
+        assertEq(pnkCoherence, 0, "Wrong reward pnk coherence 1 vote ID");
+        assertEq(feeCoherence, 0, "Wrong reward fee coherence 1 vote ID");
+
+        (pnkCoherence, feeCoherence) = disputeKit.getDegreeOfCoherenceReward(disputeID, 0, 2, 0, 0);
+        assertEq(pnkCoherence, 0, "Wrong reward pnk coherence 2 vote ID");
+        assertEq(feeCoherence, 0, "Wrong reward fee coherence 2 vote ID");
+
+        assertEq(disputeKit.getDegreeOfCoherencePenalty(disputeID, 0, 0, 0, 0), 0, "Wrong penalty coherence 0 vote ID");
+        assertEq(disputeKit.getDegreeOfCoherencePenalty(disputeID, 0, 1, 0, 0), 0, "Wrong penalty coherence 1 vote ID");
+        assertEq(disputeKit.getDegreeOfCoherencePenalty(disputeID, 0, 2, 0, 0), 0, "Wrong penalty coherence 2 vote ID");
 
         uint256 governorBalance = governor.balance;
         uint256 governorTokenBalance = pinakion.balanceOf(governor);

From 37bd43f411d6d952e09c78a8c6821c18b38df2e5 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 13 Aug 2025 23:31:28 +0100
Subject: [PATCH 045/175] fix: no passing to voting period if commits are all
 cast

---
 contracts/src/arbitration/KlerosCoreBase.sol | 6 ++----
 1 file changed, 2 insertions(+), 4 deletions(-)

diff --git a/contracts/src/arbitration/KlerosCoreBase.sol b/contracts/src/arbitration/KlerosCoreBase.sol
index 2b9998bda..22d1d996a 100644
--- a/contracts/src/arbitration/KlerosCoreBase.sol
+++ b/contracts/src/arbitration/KlerosCoreBase.sol
@@ -566,10 +566,8 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
             if (round.drawnJurors.length != round.nbVotes) revert DisputeStillDrawing();
             dispute.period = court.hiddenVotes ? Period.commit : Period.vote;
         } else if (dispute.period == Period.commit) {
-            if (
-                block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)] &&
-                !disputeKits[round.disputeKitID].areCommitsAllCast(_disputeID)
-            ) {
+            // Note that we do not want to pass to Voting period if all the commits are cast because it breaks the Shutter auto-reveal currently.
+            if (block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)]) {
                 revert CommitPeriodNotPassed();
             }
             dispute.period = Period.vote;

From 0a10ad22eabfdadaa518cdf3e3b4294be6c96d39 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 13 Aug 2025 23:36:46 +0100
Subject: [PATCH 046/175] chore: changelog

---
 contracts/CHANGELOG.md | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/contracts/CHANGELOG.md b/contracts/CHANGELOG.md
index 0a0250ade..9d4abf080 100644
--- a/contracts/CHANGELOG.md
+++ b/contracts/CHANGELOG.md
@@ -15,6 +15,10 @@ The format is based on [Common Changelog](https://common-changelog.org/).
 - Bump `hardhat` to v2.26.2 ([#2069](https://github.com/kleros/kleros-v2/issues/2069))
 - Bump `@kleros/vea-contracts` to v0.7.0 ([#2073](https://github.com/kleros/kleros-v2/issues/2073))
 
+### Fixed
+
+- Do not pass to Voting period if all the commits are cast because it breaks the current Shutter auto-reveal process. ([#2085](https://github.com/kleros/kleros-v2/issues/2085))
+
 ## [0.12.0] - 2025-08-05
 
 ### Changed

From 257870c1fad6f234315da1c2bab5d763a427deeb Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Fri, 15 Aug 2025 01:58:52 +0100
Subject: [PATCH 047/175] test: fix by warping to pass the period

---
 contracts/test/foundry/KlerosCore.t.sol | 1 +
 1 file changed, 1 insertion(+)

diff --git a/contracts/test/foundry/KlerosCore.t.sol b/contracts/test/foundry/KlerosCore.t.sol
index 72a6a565c..3387ca187 100644
--- a/contracts/test/foundry/KlerosCore.t.sol
+++ b/contracts/test/foundry/KlerosCore.t.sol
@@ -1622,6 +1622,7 @@ contract KlerosCoreTest is Test {
         }
 
         // Check reveal in the next period
+        vm.warp(block.timestamp + timesPerPeriod[1]);
         core.passPeriod(disputeID);
 
         // Check the require with the wrong choice and then with the wrong salt

From 4a451a591b02dc16b98e498fe67c68a65dbb05d7 Mon Sep 17 00:00:00 2001
From: kemuru <102478601+kemuru@users.noreply.github.com>
Date: Sat, 16 Aug 2025 12:10:53 +0200
Subject: [PATCH 048/175] chore: tweak didnotvote text

---
 web/src/components/DisputeView/CardLabels/index.tsx | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/web/src/components/DisputeView/CardLabels/index.tsx b/web/src/components/DisputeView/CardLabels/index.tsx
index acc0a3e58..6a37e8a8e 100644
--- a/web/src/components/DisputeView/CardLabels/index.tsx
+++ b/web/src/components/DisputeView/CardLabels/index.tsx
@@ -65,7 +65,7 @@ const LabelArgs: Record<string, { text: string; icon: React.FC<React.SVGAttribut
   NotDrawn: { text: "You were not drawn", icon: NotDrawnIcon, color: "grey" },
   CanVote: { text: "You can vote now", icon: CanVoteIcon, color: "blue" },
   Voted: { text: "You voted", icon: VotedIcon, color: "purple" },
-  DidNotVote: { text: "You forgot to vote", icon: ForgotToVoteIcon, color: "purple" },
+  DidNotVote: { text: "You did not vote", icon: ForgotToVoteIcon, color: "purple" },
   CanFund: { text: "Appeal possible", icon: AppealIcon, color: "lightPurple" },
   Funded: { text: "You funded an appeal", icon: FundedIcon, color: "lightPurple" },
 };

From 31efb24e03f11cc0c7064d64be596c6c2bf41c0e Mon Sep 17 00:00:00 2001
From: unknownunknown1 <danil@kleros.io>
Date: Wed, 20 Aug 2025 23:39:45 +1000
Subject: [PATCH 049/175] feat(RNG): custom errors

---
 contracts/src/rng/BlockhashRNG.sol      |  4 ++--
 contracts/src/rng/ChainlinkRNG.sol      |  4 ++--
 contracts/src/rng/IRNG.sol              |  3 +++
 contracts/src/rng/RNGWithFallback.sol   | 12 +++++++++---
 contracts/src/rng/RandomizerRNG.sol     | 12 +++++++++---
 contracts/test/foundry/KlerosCore.t.sol | 12 ++++++------
 6 files changed, 31 insertions(+), 16 deletions(-)

diff --git a/contracts/src/rng/BlockhashRNG.sol b/contracts/src/rng/BlockhashRNG.sol
index 9070d0751..a36501e6e 100644
--- a/contracts/src/rng/BlockhashRNG.sol
+++ b/contracts/src/rng/BlockhashRNG.sol
@@ -26,12 +26,12 @@ contract BlockHashRNG is IRNG {
     // ************************************* //
 
     modifier onlyByGovernor() {
-        require(governor == msg.sender, "Governor only");
+        if (governor != msg.sender) revert GovernorOnly();
         _;
     }
 
     modifier onlyByConsumer() {
-        require(consumer == msg.sender, "Consumer only");
+        if (consumer != msg.sender) revert ConsumerOnly();
         _;
     }
 
diff --git a/contracts/src/rng/ChainlinkRNG.sol b/contracts/src/rng/ChainlinkRNG.sol
index fe5a9ff19..a5bff291f 100644
--- a/contracts/src/rng/ChainlinkRNG.sol
+++ b/contracts/src/rng/ChainlinkRNG.sol
@@ -42,12 +42,12 @@ contract ChainlinkRNG is IRNG, VRFConsumerBaseV2Plus {
     // ************************************* //
 
     modifier onlyByGovernor() {
-        require(governor == msg.sender, "Governor only");
+        if (governor != msg.sender) revert GovernorOnly();
         _;
     }
 
     modifier onlyByConsumer() {
-        require(consumer == msg.sender, "Consumer only");
+        if (consumer != msg.sender) revert ConsumerOnly();
         _;
     }
 
diff --git a/contracts/src/rng/IRNG.sol b/contracts/src/rng/IRNG.sol
index 152c1f15b..1a767fee0 100644
--- a/contracts/src/rng/IRNG.sol
+++ b/contracts/src/rng/IRNG.sol
@@ -10,4 +10,7 @@ interface IRNG {
     /// @dev Receive the random number.
     /// @return randomNumber Random number or 0 if not available
     function receiveRandomness() external returns (uint256 randomNumber);
+
+    error GovernorOnly();
+    error ConsumerOnly();
 }
diff --git a/contracts/src/rng/RNGWithFallback.sol b/contracts/src/rng/RNGWithFallback.sol
index 3bd8daed7..c47f9eb53 100644
--- a/contracts/src/rng/RNGWithFallback.sol
+++ b/contracts/src/rng/RNGWithFallback.sol
@@ -32,7 +32,7 @@ contract RNGWithFallback is IRNG {
     /// @param _fallbackTimeoutSeconds Time in seconds to wait before falling back to next RNG
     /// @param _rng The RNG address (e.g. Chainlink)
     constructor(address _governor, address _consumer, uint256 _fallbackTimeoutSeconds, IRNG _rng) {
-        require(address(_rng) != address(0), "Invalid default RNG");
+        if (address(_rng) == address(0)) revert InvalidDefaultRNG();
 
         governor = _governor;
         consumer = _consumer;
@@ -45,12 +45,12 @@ contract RNGWithFallback is IRNG {
     // ************************************* //
 
     modifier onlyByGovernor() {
-        require(msg.sender == governor, "Governor only");
+        if (governor != msg.sender) revert GovernorOnly();
         _;
     }
 
     modifier onlyByConsumer() {
-        require(msg.sender == consumer, "Consumer only");
+        if (consumer != msg.sender) revert ConsumerOnly();
         _;
     }
 
@@ -100,4 +100,10 @@ contract RNGWithFallback is IRNG {
         }
         return randomNumber;
     }
+
+    // ************************************* //
+    // *              Errors               * //
+    // ************************************* //
+
+    error InvalidDefaultRNG();
 }
diff --git a/contracts/src/rng/RandomizerRNG.sol b/contracts/src/rng/RandomizerRNG.sol
index 6db56fa3b..96cbe6321 100644
--- a/contracts/src/rng/RandomizerRNG.sol
+++ b/contracts/src/rng/RandomizerRNG.sol
@@ -37,12 +37,12 @@ contract RandomizerRNG is IRNG {
     // ************************************* //
 
     modifier onlyByGovernor() {
-        require(governor == msg.sender, "Governor only");
+        if (governor != msg.sender) revert GovernorOnly();
         _;
     }
 
     modifier onlyByConsumer() {
-        require(consumer == msg.sender, "Consumer only");
+        if (consumer != msg.sender) revert ConsumerOnly();
         _;
     }
 
@@ -110,7 +110,7 @@ contract RandomizerRNG is IRNG {
     /// @param _id The ID of the request.
     /// @param _value The random value answering the request.
     function randomizerCallback(uint256 _id, bytes32 _value) external {
-        require(msg.sender == address(randomizer), "Randomizer only");
+        if (msg.sender != address(randomizer)) revert RandomizerOnly();
         randomNumbers[_id] = uint256(_value);
         emit RequestFulfilled(_id, uint256(_value));
     }
@@ -124,4 +124,10 @@ contract RandomizerRNG is IRNG {
     function receiveRandomness() external view override returns (uint256 randomNumber) {
         randomNumber = randomNumbers[lastRequestId];
     }
+
+    // ************************************* //
+    // *              Errors               * //
+    // ************************************* //
+
+    error RandomizerOnly();
 }
diff --git a/contracts/test/foundry/KlerosCore.t.sol b/contracts/test/foundry/KlerosCore.t.sol
index 7613fb4c3..d30307106 100644
--- a/contracts/test/foundry/KlerosCore.t.sol
+++ b/contracts/test/foundry/KlerosCore.t.sol
@@ -12,7 +12,7 @@ import {ISortitionModule} from "../../src/arbitration/interfaces/ISortitionModul
 import {SortitionModuleMock, SortitionModuleBase} from "../../src/test/SortitionModuleMock.sol";
 import {UUPSProxy} from "../../src/proxy/UUPSProxy.sol";
 import {BlockHashRNG} from "../../src/rng/BlockHashRNG.sol";
-import {RNGWithFallback} from "../../src/rng/RNGWithFallback.sol";
+import {RNGWithFallback, IRNG} from "../../src/rng/RNGWithFallback.sol";
 import {RNGMock} from "../../src/test/RNGMock.sol";
 import {PNK} from "../../src/token/PNK.sol";
 import {TestERC20} from "../../src/token/TestERC20.sol";
@@ -3067,15 +3067,15 @@ contract KlerosCoreTest is Test {
         RNGMock rngMock = new RNGMock();
         rngFallback = new RNGWithFallback(msg.sender, address(sortitionModule), fallbackTimeout, rngMock);
 
-        vm.expectRevert(bytes("Consumer only"));
+        vm.expectRevert(IRNG.ConsumerOnly.selector);
         vm.prank(governor);
         rngFallback.requestRandomness();
 
-        vm.expectRevert(bytes("Consumer only"));
+        vm.expectRevert(IRNG.ConsumerOnly.selector);
         vm.prank(governor);
         rngFallback.receiveRandomness();
 
-        vm.expectRevert(bytes("Governor only"));
+        vm.expectRevert(IRNG.GovernorOnly.selector);
         vm.prank(other);
         rngFallback.changeGovernor(other);
         vm.prank(governor);
@@ -3086,14 +3086,14 @@ contract KlerosCoreTest is Test {
         vm.prank(other);
         rngFallback.changeGovernor(governor);
 
-        vm.expectRevert(bytes("Governor only"));
+        vm.expectRevert(IRNG.GovernorOnly.selector);
         vm.prank(other);
         rngFallback.changeConsumer(other);
         vm.prank(governor);
         rngFallback.changeConsumer(other);
         assertEq(rngFallback.consumer(), other, "Wrong consumer");
 
-        vm.expectRevert(bytes("Governor only"));
+        vm.expectRevert(IRNG.GovernorOnly.selector);
         vm.prank(other);
         rngFallback.changeFallbackTimeout(5);
 

From 0f31e0ee0876a5ca64708f3e68c1efa7d570f075 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 20 Aug 2025 19:20:43 +0100
Subject: [PATCH 050/175] chore: changelog

---
 contracts/CHANGELOG.md | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/contracts/CHANGELOG.md b/contracts/CHANGELOG.md
index 9d4abf080..8afc215c5 100644
--- a/contracts/CHANGELOG.md
+++ b/contracts/CHANGELOG.md
@@ -12,6 +12,8 @@ The format is based on [Common Changelog](https://common-changelog.org/).
 - Set the Hardhat Solidity version to v0.8.30 and enable the IR pipeline ([#2069](https://github.com/kleros/kleros-v2/issues/2069))
 - Set the Foundry Solidity version to v0.8.30 and enable the IR pipeline ([#2073](https://github.com/kleros/kleros-v2/issues/2073))
 - Widen the allowed solc version to any v0.8.x for the interfaces only ([#2083](https://github.com/kleros/kleros-v2/issues/2083))
+- Make `IDisputeKit.getDegreeOfCoherenceReward()` multi-dimensional so different calculations may be applied to PNK rewards, fee rewards and PNK penalties (future-proofing) ([#2090](https://github.com/kleros/kleros-v2/issues/2090))
+- Consolidate the constant `ALPHA_DIVISOR` with `ONE_BASIS_POINTS` ([#2090](https://github.com/kleros/kleros-v2/issues/2090))
 - Bump `hardhat` to v2.26.2 ([#2069](https://github.com/kleros/kleros-v2/issues/2069))
 - Bump `@kleros/vea-contracts` to v0.7.0 ([#2073](https://github.com/kleros/kleros-v2/issues/2073))
 

From 78f180a8ac18dcf24b24f52c84e23339d961e174 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 20 Aug 2025 19:59:00 +0100
Subject: [PATCH 051/175] chore: changelog

---
 contracts/CHANGELOG.md | 5 +++++
 1 file changed, 5 insertions(+)

diff --git a/contracts/CHANGELOG.md b/contracts/CHANGELOG.md
index 8afc215c5..07201c2f5 100644
--- a/contracts/CHANGELOG.md
+++ b/contracts/CHANGELOG.md
@@ -9,6 +9,11 @@ The format is based on [Common Changelog](https://common-changelog.org/).
 ### Changed
 
 - **Breaking:** Replace `require()` with `revert()` and custom errors outside KlerosCore for consistency and smaller bytecode ([#2084](https://github.com/kleros/kleros-v2/issues/2084))
+- **Breaking:** Rename the interface from `RNG` to `IRNG` ([#2054](https://github.com/kleros/kleros-v2/issues/2054))
+- **Breaking:** Remove the `_block` parameter from `IRNG.requestRandomness()` and `IRNG.receiveRandomness()`, not needed for the primary VRF-based RNG ([#2054](https://github.com/kleros/kleros-v2/issues/2054))
+- Make the primary VRF-based RNG fall back to `BlockhashRNG` if the VRF request is not fulfilled within a timeout ([#2054](https://github.com/kleros/kleros-v2/issues/2054))
+- Authenticate the calls to the RNGs to prevent 3rd parties from depleting the Chainlink VRF subscription funds ([#2054](https://github.com/kleros/kleros-v2/issues/2054))
+- Use `block.timestamp` rather than `block.number` for `BlockhashRNG` for better reliability on Arbitrum as block production is sporadic depending on network conditions. ([#2054](https://github.com/kleros/kleros-v2/issues/2054))
 - Set the Hardhat Solidity version to v0.8.30 and enable the IR pipeline ([#2069](https://github.com/kleros/kleros-v2/issues/2069))
 - Set the Foundry Solidity version to v0.8.30 and enable the IR pipeline ([#2073](https://github.com/kleros/kleros-v2/issues/2073))
 - Widen the allowed solc version to any v0.8.x for the interfaces only ([#2083](https://github.com/kleros/kleros-v2/issues/2083))

From 9895c7c1ee1420d4a9ad03eb10ccbc4517e1d1fe Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 20 Aug 2025 19:45:38 +0100
Subject: [PATCH 052/175] refactor: using the template syntax for
 hardhat-deploy-ethers getContract()

---
 .../deploy/00-home-chain-arbitration-neo.ts   |  4 ++--
 .../deploy/00-home-chain-arbitration-ruler.ts |  2 +-
 .../00-home-chain-arbitration-university.ts   |  4 ++--
 contracts/deploy/00-home-chain-arbitration.ts |  2 +-
 .../change-arbitrable-dispute-template.ts     |  2 +-
 contracts/scripts/disputeRelayerBot.ts        |  6 +++---
 .../test/arbitration/dispute-kit-gated.ts     | 16 +++++++--------
 contracts/test/arbitration/draw.ts            | 14 ++++++-------
 contracts/test/arbitration/index.ts           | 10 +++++-----
 contracts/test/arbitration/ruler.ts           |  4 ++--
 contracts/test/evidence/index.ts              |  5 ++---
 contracts/test/integration/index.ts           | 20 +++++++++----------
 contracts/test/proxy/index.ts                 | 12 +++++------
 contracts/test/rng/index.ts                   |  8 ++++----
 14 files changed, 54 insertions(+), 55 deletions(-)

diff --git a/contracts/deploy/00-home-chain-arbitration-neo.ts b/contracts/deploy/00-home-chain-arbitration-neo.ts
index 68672b841..f5211c4af 100644
--- a/contracts/deploy/00-home-chain-arbitration-neo.ts
+++ b/contracts/deploy/00-home-chain-arbitration-neo.ts
@@ -85,7 +85,7 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
   }); // nonce+2 (implementation), nonce+3 (proxy)
 
   // disputeKit.changeCore() only if necessary
-  const disputeKitContract = (await hre.ethers.getContract("DisputeKitClassicNeo")) as DisputeKitClassic;
+  const disputeKitContract = await hre.ethers.getContract<DisputeKitClassic>("DisputeKitClassicNeo");
   const currentCore = await disputeKitContract.core();
   if (currentCore !== klerosCore.address) {
     console.log(`disputeKit.changeCore(${klerosCore.address})`);
@@ -99,7 +99,7 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
     await rngWithFallback.changeConsumer(sortitionModule.address);
   }
 
-  const core = (await hre.ethers.getContract("KlerosCoreNeo")) as KlerosCoreNeo;
+  const core = await hre.ethers.getContract<KlerosCoreNeo>("KlerosCoreNeo");
   try {
     await changeCurrencyRate(core, await weth.getAddress(), true, 1, 1);
   } catch (e) {
diff --git a/contracts/deploy/00-home-chain-arbitration-ruler.ts b/contracts/deploy/00-home-chain-arbitration-ruler.ts
index d49431c46..5e6e5bdc7 100644
--- a/contracts/deploy/00-home-chain-arbitration-ruler.ts
+++ b/contracts/deploy/00-home-chain-arbitration-ruler.ts
@@ -35,7 +35,7 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
     ],
     log: true,
   });
-  const core = (await hre.ethers.getContract("KlerosCoreRuler")) as KlerosCoreRuler;
+  const core = await hre.ethers.getContract<KlerosCoreRuler>("KlerosCoreRuler");
 
   try {
     await changeCurrencyRate(core, await pnk.getAddress(), true, 12225583, 12);
diff --git a/contracts/deploy/00-home-chain-arbitration-university.ts b/contracts/deploy/00-home-chain-arbitration-university.ts
index 81267ca91..e3fce871e 100644
--- a/contracts/deploy/00-home-chain-arbitration-university.ts
+++ b/contracts/deploy/00-home-chain-arbitration-university.ts
@@ -64,14 +64,14 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
   }); // nonce+2 (implementation), nonce+3 (proxy)
 
   // disputeKit.changeCore() only if necessary
-  const disputeKitContract = (await ethers.getContract("DisputeKitClassicUniversity")) as DisputeKitClassic;
+  const disputeKitContract = await ethers.getContract<DisputeKitClassic>("DisputeKitClassicUniversity");
   const currentCore = await disputeKitContract.core();
   if (currentCore !== klerosCore.address) {
     console.log(`disputeKit.changeCore(${klerosCore.address})`);
     await disputeKitContract.changeCore(klerosCore.address);
   }
 
-  const core = (await hre.ethers.getContract("KlerosCoreUniversity")) as KlerosCoreUniversity;
+  const core = await hre.ethers.getContract<KlerosCoreUniversity>("KlerosCoreUniversity");
   try {
     await changeCurrencyRate(core, await pnk.getAddress(), true, 12225583, 12);
     await changeCurrencyRate(core, await dai.getAddress(), true, 60327783, 11);
diff --git a/contracts/deploy/00-home-chain-arbitration.ts b/contracts/deploy/00-home-chain-arbitration.ts
index 6bd763a88..1d590813f 100644
--- a/contracts/deploy/00-home-chain-arbitration.ts
+++ b/contracts/deploy/00-home-chain-arbitration.ts
@@ -93,7 +93,7 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
     await rngWithFallback.changeConsumer(sortitionModule.address);
   }
 
-  const core = (await hre.ethers.getContract("KlerosCore")) as KlerosCore;
+  const core = await hre.ethers.getContract<KlerosCore>("KlerosCore");
   try {
     await changeCurrencyRate(core, await pnk.getAddress(), true, 12225583, 12);
     await changeCurrencyRate(core, await dai.getAddress(), true, 60327783, 11);
diff --git a/contracts/deploy/change-arbitrable-dispute-template.ts b/contracts/deploy/change-arbitrable-dispute-template.ts
index 0ac04fba8..8b41ce2d2 100644
--- a/contracts/deploy/change-arbitrable-dispute-template.ts
+++ b/contracts/deploy/change-arbitrable-dispute-template.ts
@@ -31,7 +31,7 @@ const deployResolver: DeployFunction = async (hre: HardhatRuntimeEnvironment) =>
     "specification": "KIP88"
   }`;
 
-  const arbitrable = (await ethers.getContract("ArbitrableExample")) as ArbitrableExample;
+  const arbitrable = await ethers.getContract<ArbitrableExample>("ArbitrableExample");
   let tx = await (await arbitrable.changeDisputeTemplate(template, "disputeTemplateMapping: TODO")).wait();
   tx?.logs?.forEach((event) => {
     if (event instanceof EventLog) console.log("event: %O", event.args);
diff --git a/contracts/scripts/disputeRelayerBot.ts b/contracts/scripts/disputeRelayerBot.ts
index 9437bdf52..87848993a 100644
--- a/contracts/scripts/disputeRelayerBot.ts
+++ b/contracts/scripts/disputeRelayerBot.ts
@@ -33,9 +33,9 @@ export default async function main(
   homeGatewayArtifact: string,
   feeTokenArtifact?: string
 ) {
-  const core = (await ethers.getContract("KlerosCore")) as KlerosCore;
-  const homeGateway = (await ethers.getContract(homeGatewayArtifact)) as HomeGateway;
-  const feeToken = feeTokenArtifact ? ((await ethers.getContract(feeTokenArtifact)) as TestERC20) : undefined;
+  const core = await ethers.getContract<KlerosCore>("KlerosCore");
+  const homeGateway = await ethers.getContract<HomeGateway>(homeGatewayArtifact);
+  const feeToken = feeTokenArtifact ? await ethers.getContract<TestERC20>(feeTokenArtifact) : undefined;
 
   const foreignChainProvider = new ethers.providers.JsonRpcProvider(foreignNetwork.url);
   const foreignGatewayDeployment = await foreignDeployments.get(foreignGatewayArtifact);
diff --git a/contracts/test/arbitration/dispute-kit-gated.ts b/contracts/test/arbitration/dispute-kit-gated.ts
index aa8c504db..4c3d26052 100644
--- a/contracts/test/arbitration/dispute-kit-gated.ts
+++ b/contracts/test/arbitration/dispute-kit-gated.ts
@@ -47,11 +47,11 @@ describe("DisputeKitGated", async () => {
       fallbackToGlobal: true,
       keepExistingDeployments: false,
     });
-    disputeKitGated = (await ethers.getContract("DisputeKitGated")) as DisputeKitGated;
-    pnk = (await ethers.getContract("PNK")) as PNK;
-    dai = (await ethers.getContract("DAI")) as TestERC20;
-    core = (await ethers.getContract("KlerosCore")) as KlerosCore;
-    sortitionModule = (await ethers.getContract("SortitionModule")) as SortitionModule;
+    disputeKitGated = await ethers.getContract<DisputeKitGated>("DisputeKitGated");
+    pnk = await ethers.getContract<PNK>("PNK");
+    dai = await ethers.getContract<TestERC20>("DAI");
+    core = await ethers.getContract<KlerosCore>("KlerosCore");
+    sortitionModule = await ethers.getContract<SortitionModule>("SortitionModule");
 
     // Make the tests more deterministic with this dummy RNG
     await deployments.deploy("IncrementalNG", {
@@ -59,16 +59,16 @@ describe("DisputeKitGated", async () => {
       args: [RANDOM],
       log: true,
     });
-    rng = (await ethers.getContract("IncrementalNG")) as IncrementalNG;
+    rng = await ethers.getContract<IncrementalNG>("IncrementalNG");
 
     await sortitionModule.changeRandomNumberGenerator(rng.target).then((tx) => tx.wait());
 
     const hre = require("hardhat");
     await deployERC721(hre, deployer, "TestERC721", "Nft721");
-    nft721 = (await ethers.getContract("Nft721")) as TestERC721;
+    nft721 = await ethers.getContract<TestERC721>("Nft721");
 
     await deployERC1155(hre, deployer, "TestERC1155", "Nft1155");
-    nft1155 = (await ethers.getContract("Nft1155")) as TestERC1155;
+    nft1155 = await ethers.getContract<TestERC1155>("Nft1155");
     await nft1155.mint(deployer, TOKEN_ID, 1, "0x00");
   });
 
diff --git a/contracts/test/arbitration/draw.ts b/contracts/test/arbitration/draw.ts
index 4d2882a57..4992501f1 100644
--- a/contracts/test/arbitration/draw.ts
+++ b/contracts/test/arbitration/draw.ts
@@ -62,12 +62,12 @@ describe("Draw Benchmark", async () => {
       fallbackToGlobal: true,
       keepExistingDeployments: false,
     });
-    disputeKit = (await ethers.getContract("DisputeKitClassic")) as DisputeKitClassic;
-    pnk = (await ethers.getContract("PNK")) as PNK;
-    core = (await ethers.getContract("KlerosCore")) as KlerosCore;
-    homeGateway = (await ethers.getContract("HomeGatewayToEthereum")) as HomeGateway;
-    arbitrable = (await ethers.getContract("ArbitrableExample")) as ArbitrableExample;
-    sortitionModule = (await ethers.getContract("SortitionModule")) as SortitionModule;
+    disputeKit = await ethers.getContract<DisputeKitClassic>("DisputeKitClassic");
+    pnk = await ethers.getContract<PNK>("PNK");
+    core = await ethers.getContract<KlerosCore>("KlerosCore");
+    homeGateway = await ethers.getContract<HomeGateway>("HomeGatewayToEthereum");
+    arbitrable = await ethers.getContract<ArbitrableExample>("ArbitrableExample");
+    sortitionModule = await ethers.getContract<SortitionModule>("SortitionModule");
 
     parentCourtMinStake = await core.courts(Courts.GENERAL).then((court) => court.minStake);
 
@@ -79,7 +79,7 @@ describe("Draw Benchmark", async () => {
       args: [RANDOM],
       log: true,
     });
-    rng = (await ethers.getContract("IncrementalNG")) as IncrementalNG;
+    rng = await ethers.getContract<IncrementalNG>("IncrementalNG");
 
     await sortitionModule.changeRandomNumberGenerator(rng.target).then((tx) => tx.wait());
 
diff --git a/contracts/test/arbitration/index.ts b/contracts/test/arbitration/index.ts
index 4af7dfd63..127fa2500 100644
--- a/contracts/test/arbitration/index.ts
+++ b/contracts/test/arbitration/index.ts
@@ -100,10 +100,10 @@ async function deployContracts(): Promise<
     fallbackToGlobal: true,
     keepExistingDeployments: false,
   });
-  const disputeKit = (await ethers.getContract("DisputeKitClassic")) as DisputeKitClassic;
-  const disputeKitShutter = (await ethers.getContract("DisputeKitShutter")) as DisputeKitShutter;
-  const disputeKitGated = (await ethers.getContract("DisputeKitGated")) as DisputeKitGated;
-  const disputeKitGatedShutter = (await ethers.getContract("DisputeKitGatedShutter")) as DisputeKitGatedShutter;
-  const core = (await ethers.getContract("KlerosCore")) as KlerosCore;
+  const disputeKit = await ethers.getContract<DisputeKitClassic>("DisputeKitClassic");
+  const disputeKitShutter = await ethers.getContract<DisputeKitShutter>("DisputeKitShutter");
+  const disputeKitGated = await ethers.getContract<DisputeKitGated>("DisputeKitGated");
+  const disputeKitGatedShutter = await ethers.getContract<DisputeKitGatedShutter>("DisputeKitGatedShutter");
+  const core = await ethers.getContract<KlerosCore>("KlerosCore");
   return [core, disputeKit, disputeKitShutter, disputeKitGated, disputeKitGatedShutter];
 }
diff --git a/contracts/test/arbitration/ruler.ts b/contracts/test/arbitration/ruler.ts
index bf5754295..dafdb59da 100644
--- a/contracts/test/arbitration/ruler.ts
+++ b/contracts/test/arbitration/ruler.ts
@@ -163,7 +163,7 @@ async function deployContracts(): Promise<[KlerosCoreRuler, DisputeResolver]> {
     fallbackToGlobal: true,
     keepExistingDeployments: false,
   });
-  const resolver = (await ethers.getContract("DisputeResolverRuler")) as DisputeResolver;
-  const core = (await ethers.getContract("KlerosCoreRuler")) as KlerosCoreRuler;
+  const resolver = await ethers.getContract<DisputeResolver>("DisputeResolverRuler");
+  const core = await ethers.getContract<KlerosCoreRuler>("KlerosCoreRuler");
   return [core, resolver];
 }
diff --git a/contracts/test/evidence/index.ts b/contracts/test/evidence/index.ts
index 30d79ab28..bc3f4ff3b 100644
--- a/contracts/test/evidence/index.ts
+++ b/contracts/test/evidence/index.ts
@@ -19,7 +19,6 @@ function getEmittedEvent(eventName: any, receipt: ContractTransactionReceipt): E
 
 describe("Home Evidence contract", async () => {
   const arbitrationFee = 1000n;
-  const appealFee = arbitrationFee;
   const arbitratorExtraData = ethers.AbiCoder.defaultAbiCoder().encode(
     ["uint256", "uint256"],
     [1, 1] // courtId 1, minJurors 1
@@ -51,8 +50,8 @@ describe("Home Evidence contract", async () => {
       fallbackToGlobal: true,
       keepExistingDeployments: false,
     });
-    arbitrator = (await ethers.getContract("KlerosCore")) as KlerosCore;
-    disputeTemplateRegistry = (await ethers.getContract("DisputeTemplateRegistry")) as DisputeTemplateRegistry;
+    arbitrator = await ethers.getContract<KlerosCore>("KlerosCore");
+    disputeTemplateRegistry = await ethers.getContract<DisputeTemplateRegistry>("DisputeTemplateRegistry");
 
     const court = await arbitrator.courts(1);
     await arbitrator.changeCourtParameters(
diff --git a/contracts/test/integration/index.ts b/contracts/test/integration/index.ts
index 5b4b7ea9a..f3c97b2a1 100644
--- a/contracts/test/integration/index.ts
+++ b/contracts/test/integration/index.ts
@@ -56,16 +56,16 @@ describe("Integration tests", async () => {
       fallbackToGlobal: true,
       keepExistingDeployments: false,
     });
-    rng = (await ethers.getContract("ChainlinkRNG")) as ChainlinkRNG;
-    vrfCoordinator = (await ethers.getContract("ChainlinkVRFCoordinator")) as ChainlinkVRFCoordinatorV2Mock;
-    disputeKit = (await ethers.getContract("DisputeKitClassic")) as DisputeKitClassic;
-    pnk = (await ethers.getContract("PNK")) as PNK;
-    core = (await ethers.getContract("KlerosCore")) as KlerosCore;
-    vea = (await ethers.getContract("VeaMock")) as VeaMock;
-    foreignGateway = (await ethers.getContract("ForeignGatewayOnEthereum")) as ForeignGateway;
-    arbitrable = (await ethers.getContract("ArbitrableExample")) as ArbitrableExample;
-    homeGateway = (await ethers.getContract("HomeGatewayToEthereum")) as HomeGateway;
-    sortitionModule = (await ethers.getContract("SortitionModule")) as SortitionModule;
+    rng = await ethers.getContract<ChainlinkRNG>("ChainlinkRNG");
+    vrfCoordinator = await ethers.getContract<ChainlinkVRFCoordinatorV2Mock>("ChainlinkVRFCoordinator");
+    disputeKit = await ethers.getContract<DisputeKitClassic>("DisputeKitClassic");
+    pnk = await ethers.getContract<PNK>("PNK");
+    core = await ethers.getContract<KlerosCore>("KlerosCore");
+    vea = await ethers.getContract<VeaMock>("VeaMock");
+    foreignGateway = await ethers.getContract<ForeignGateway>("ForeignGatewayOnEthereum");
+    arbitrable = await ethers.getContract<ArbitrableExample>("ArbitrableExample");
+    homeGateway = await ethers.getContract<HomeGateway>("HomeGatewayToEthereum");
+    sortitionModule = await ethers.getContract<SortitionModule>("SortitionModule");
   });
 
   it("Resolves a dispute on the home chain with no appeal", async () => {
diff --git a/contracts/test/proxy/index.ts b/contracts/test/proxy/index.ts
index 410753f97..12ba6313c 100644
--- a/contracts/test/proxy/index.ts
+++ b/contracts/test/proxy/index.ts
@@ -130,9 +130,9 @@ describe("Upgradability", async () => {
     });
 
     it("Initializes v1", async () => {
-      proxy = (await ethers.getContract("UpgradedByRewrite")) as UpgradedByRewriteV1;
+      proxy = await ethers.getContract<UpgradedByRewriteV1>("UpgradedByRewrite");
 
-      implementation = (await ethers.getContract("UpgradedByRewrite_Implementation")) as UpgradedByRewriteV1;
+      implementation = await ethers.getContract<UpgradedByRewriteV1>("UpgradedByRewrite_Implementation");
 
       expect(await proxy.governor()).to.equal(deployer.address);
 
@@ -156,7 +156,7 @@ describe("Upgradability", async () => {
       if (!proxyDeployment.implementation) {
         throw new Error("No implementation address");
       }
-      proxy = (await ethers.getContract("UpgradedByRewrite")) as UpgradedByRewriteV2;
+      proxy = await ethers.getContract<UpgradedByRewriteV2>("UpgradedByRewrite");
       expect(await proxy.governor()).to.equal(deployer.address);
 
       expect(await proxy.counter()).to.equal(3);
@@ -184,9 +184,9 @@ describe("Upgradability", async () => {
     });
 
     it("Initializes v1", async () => {
-      proxy = (await ethers.getContract("UpgradedByInheritanceV1")) as UpgradedByInheritanceV1;
+      proxy = await ethers.getContract<UpgradedByInheritanceV1>("UpgradedByInheritanceV1");
 
-      implementation = (await ethers.getContract("UpgradedByInheritanceV1_Implementation")) as UpgradedByInheritanceV1;
+      implementation = await ethers.getContract<UpgradedByInheritanceV1>("UpgradedByInheritanceV1_Implementation");
 
       expect(await proxy.governor()).to.equal(deployer.address);
 
@@ -209,7 +209,7 @@ describe("Upgradability", async () => {
         log: true,
       });
 
-      proxy = (await ethers.getContract("UpgradedByInheritanceV1")) as UpgradedByInheritanceV2;
+      proxy = await ethers.getContract<UpgradedByInheritanceV2>("UpgradedByInheritanceV1");
 
       expect(await proxy.governor()).to.equal(deployer.address);
 
diff --git a/contracts/test/rng/index.ts b/contracts/test/rng/index.ts
index 3bb50fd7c..351a2d460 100644
--- a/contracts/test/rng/index.ts
+++ b/contracts/test/rng/index.ts
@@ -92,8 +92,8 @@ describe("ChainlinkRNG", async () => {
       fallbackToGlobal: true,
       keepExistingDeployments: false,
     });
-    rng = (await ethers.getContract("ChainlinkRNG")) as ChainlinkRNG;
-    vrfCoordinator = (await ethers.getContract("ChainlinkVRFCoordinator")) as ChainlinkVRFCoordinatorV2Mock;
+    rng = await ethers.getContract<ChainlinkRNG>("ChainlinkRNG");
+    vrfCoordinator = await ethers.getContract<ChainlinkVRFCoordinatorV2Mock>("ChainlinkVRFCoordinator");
 
     await rng.changeConsumer(deployer);
   });
@@ -155,8 +155,8 @@ describe("RandomizerRNG", async () => {
       fallbackToGlobal: true,
       keepExistingDeployments: false,
     });
-    rng = (await ethers.getContract("RandomizerRNG")) as RandomizerRNG;
-    randomizer = (await ethers.getContract("RandomizerOracle")) as RandomizerMock;
+    rng = await ethers.getContract<RandomizerRNG>("RandomizerRNG");
+    randomizer = await ethers.getContract<RandomizerMock>("RandomizerOracle");
 
     await rng.changeConsumer(deployer);
   });

From 2f711f34dfc767bea479154964753d8184694782 Mon Sep 17 00:00:00 2001
From: kemuru <102478601+kemuru@users.noreply.github.com>
Date: Wed, 20 Aug 2025 21:34:45 +0200
Subject: [PATCH 053/175] feat: add available stake, effectivestake

---
 web/src/components/NumberDisplay.tsx          |   2 +-
 web/src/pages/Profile/Courts/Header.tsx       |  79 ----------
 .../CourtCard/CourtName.tsx                   |   0
 .../{Courts => Stakes}/CourtCard/Stake.tsx    |   0
 .../{Courts => Stakes}/CourtCard/index.tsx    |   0
 web/src/pages/Profile/Stakes/Header.tsx       | 139 ++++++++++++++++++
 .../Profile/{Courts => Stakes}/index.tsx      |  12 +-
 web/src/pages/Profile/index.tsx               |  13 +-
 8 files changed, 156 insertions(+), 89 deletions(-)
 delete mode 100644 web/src/pages/Profile/Courts/Header.tsx
 rename web/src/pages/Profile/{Courts => Stakes}/CourtCard/CourtName.tsx (100%)
 rename web/src/pages/Profile/{Courts => Stakes}/CourtCard/Stake.tsx (100%)
 rename web/src/pages/Profile/{Courts => Stakes}/CourtCard/index.tsx (100%)
 create mode 100644 web/src/pages/Profile/Stakes/Header.tsx
 rename web/src/pages/Profile/{Courts => Stakes}/index.tsx (84%)

diff --git a/web/src/components/NumberDisplay.tsx b/web/src/components/NumberDisplay.tsx
index fa0951825..d32a0ea23 100644
--- a/web/src/components/NumberDisplay.tsx
+++ b/web/src/components/NumberDisplay.tsx
@@ -35,7 +35,7 @@ const NumberDisplay: React.FC<INumberDisplay> = ({
 }) => {
   const parsedValue = Number(value);
   const formattedValue = commify(getFormattedValue(parsedValue, decimals));
-  const tooltipValue = isCurrency ? `${unit} ${value}` : `${value} ${unit}`;
+  const tooltipValue = isCurrency ? `${unit} ${commify(value)}` : `${commify(value)} ${unit}`;
   const displayUnit = showUnitInDisplay ? unit : "";
   const displayValue = isCurrency ? `${displayUnit} ${formattedValue}` : `${formattedValue} ${displayUnit}`;
 
diff --git a/web/src/pages/Profile/Courts/Header.tsx b/web/src/pages/Profile/Courts/Header.tsx
deleted file mode 100644
index 07f61e11c..000000000
--- a/web/src/pages/Profile/Courts/Header.tsx
+++ /dev/null
@@ -1,79 +0,0 @@
-import React from "react";
-import styled, { css } from "styled-components";
-
-import { formatUnits } from "viem";
-import { useSearchParams } from "react-router-dom";
-
-import LockerIcon from "svgs/icons/locker.svg";
-
-import { isUndefined } from "utils/index";
-
-import { landscapeStyle } from "styles/landscapeStyle";
-import { responsiveSize } from "styles/responsiveSize";
-
-import NumberDisplay from "components/NumberDisplay";
-
-const Container = styled.div`
-  display: flex;
-  flex-direction: row;
-  flex-wrap: wrap;
-  width: 100%;
-  gap: 4px 16px;
-  align-items: center;
-  margin-bottom: ${responsiveSize(16, 24)};
-
-  ${landscapeStyle(
-    () => css`
-      justify-content: space-between;
-    `
-  )}
-`;
-
-const LockedPnk = styled.div`
-  display: flex;
-  flex-wrap: nowrap;
-  gap: 8px;
-  justify-content: flex-start;
-
-  ${landscapeStyle(
-    () => css`
-      align-self: center;
-    `
-  )}
-`;
-
-const StyledTitle = styled.h1`
-  margin-bottom: 0;
-  font-size: ${responsiveSize(20, 24)};
-`;
-
-const StyledLockerIcon = styled(LockerIcon)`
-  fill: ${({ theme }) => theme.secondaryPurple};
-  width: 14px;
-`;
-
-interface IHeader {
-  lockedStake: bigint;
-}
-
-const Header: React.FC<IHeader> = ({ lockedStake }) => {
-  const formattedLockedStake = !isUndefined(lockedStake) && formatUnits(lockedStake, 18);
-  const [searchParams] = useSearchParams();
-  const searchParamAddress = searchParams.get("address")?.toLowerCase();
-
-  return (
-    <Container>
-      <StyledTitle>{searchParamAddress ? "Their" : "My"} Courts</StyledTitle>
-      {!isUndefined(lockedStake) ? (
-        <LockedPnk>
-          <StyledLockerIcon />
-          <label> Locked Stake: </label>
-          <small>
-            <NumberDisplay value={formattedLockedStake.toString()} unit="PNK" />
-          </small>
-        </LockedPnk>
-      ) : null}
-    </Container>
-  );
-};
-export default Header;
diff --git a/web/src/pages/Profile/Courts/CourtCard/CourtName.tsx b/web/src/pages/Profile/Stakes/CourtCard/CourtName.tsx
similarity index 100%
rename from web/src/pages/Profile/Courts/CourtCard/CourtName.tsx
rename to web/src/pages/Profile/Stakes/CourtCard/CourtName.tsx
diff --git a/web/src/pages/Profile/Courts/CourtCard/Stake.tsx b/web/src/pages/Profile/Stakes/CourtCard/Stake.tsx
similarity index 100%
rename from web/src/pages/Profile/Courts/CourtCard/Stake.tsx
rename to web/src/pages/Profile/Stakes/CourtCard/Stake.tsx
diff --git a/web/src/pages/Profile/Courts/CourtCard/index.tsx b/web/src/pages/Profile/Stakes/CourtCard/index.tsx
similarity index 100%
rename from web/src/pages/Profile/Courts/CourtCard/index.tsx
rename to web/src/pages/Profile/Stakes/CourtCard/index.tsx
diff --git a/web/src/pages/Profile/Stakes/Header.tsx b/web/src/pages/Profile/Stakes/Header.tsx
new file mode 100644
index 000000000..811ab0e1f
--- /dev/null
+++ b/web/src/pages/Profile/Stakes/Header.tsx
@@ -0,0 +1,139 @@
+import React from "react";
+import styled, { css } from "styled-components";
+
+import { useSearchParams } from "react-router-dom";
+import { formatUnits } from "viem";
+
+import LockerIcon from "svgs/icons/locker.svg";
+import PnkIcon from "svgs/icons/pnk.svg";
+
+import { isUndefined } from "utils/index";
+
+import { landscapeStyle } from "styles/landscapeStyle";
+import { responsiveSize } from "styles/responsiveSize";
+
+import NumberDisplay from "components/NumberDisplay";
+
+const Container = styled.div`
+  display: flex;
+  flex-direction: row;
+  flex-wrap: wrap;
+  width: 100%;
+  gap: 4px 16px;
+  align-items: center;
+  margin-bottom: ${responsiveSize(16, 24)};
+
+  ${landscapeStyle(
+    () => css`
+      justify-content: space-between;
+    `
+  )}
+`;
+
+const LockedPnk = styled.div`
+  display: flex;
+  flex-wrap: nowrap;
+  gap: 8px;
+  align-items: center;
+  justify-content: center;
+`;
+
+const StakesGroup = styled.div`
+  display: flex;
+  gap: 12px 24px;
+  align-items: center;
+  flex-wrap: wrap;
+`;
+
+const AvailablePnk = styled.div`
+  display: flex;
+  flex-wrap: nowrap;
+  gap: 8px;
+  align-items: center;
+  justify-content: center;
+`;
+
+const EffectivePnk = styled.div`
+  display: flex;
+  flex-wrap: nowrap;
+  gap: 8px;
+  align-items: center;
+  justify-content: center;
+`;
+
+const StyledTitle = styled.h1`
+  margin-bottom: 0;
+  font-size: ${responsiveSize(20, 24)};
+`;
+
+const StyledLockerIcon = styled(LockerIcon)`
+  fill: ${({ theme }) => theme.secondaryPurple};
+  width: 14px;
+  height: 14px;
+  margin-bottom: 1px;
+`;
+
+const StyledPnkIcon = styled(PnkIcon)`
+  fill: ${({ theme }) => theme.secondaryPurple};
+  width: 14px;
+  height: 14px;
+  margin-bottom: 1px;
+`;
+
+const StyledEffectivePnkIcon = styled(PnkIcon)`
+  fill: ${({ theme }) => theme.secondaryPurple};
+  width: 14px;
+  height: 14px;
+  margin-bottom: 1px;
+`;
+
+interface IHeader {
+  availableStake?: bigint;
+  lockedStake?: bigint;
+  effectiveStake?: bigint;
+}
+
+const Header: React.FC<IHeader> = ({ availableStake, lockedStake, effectiveStake }) => {
+  const formattedAvailableStake = !isUndefined(availableStake) && formatUnits(availableStake, 18);
+  const formattedLockedStake = !isUndefined(lockedStake) && formatUnits(lockedStake, 18);
+  const formattedEffectiveStake = !isUndefined(effectiveStake) && formatUnits(effectiveStake, 18);
+  const [searchParams] = useSearchParams();
+  const searchParamAddress = searchParams.get("address")?.toLowerCase();
+
+  return (
+    <Container>
+      <StyledTitle>{searchParamAddress ? "Their" : "My"} Stakes</StyledTitle>
+      <StakesGroup>
+        {!isUndefined(availableStake) ? (
+          <AvailablePnk>
+            <StyledPnkIcon />
+            <label> Available: </label>
+            <small>
+              <NumberDisplay value={formattedAvailableStake.toString()} unit="PNK" />
+            </small>
+          </AvailablePnk>
+        ) : null}
+        {!isUndefined(effectiveStake) ? (
+          <EffectivePnk>
+            <StyledEffectivePnkIcon />
+            <label> Staked: </label>
+            <small>
+              <NumberDisplay value={formattedEffectiveStake.toString()} unit="PNK" />
+            </small>
+          </EffectivePnk>
+        ) : null}
+        {!isUndefined(lockedStake) ? (
+          <LockedPnk>
+            <StyledLockerIcon />
+            <label> Locked: </label>
+            <small>
+              <NumberDisplay value={formattedLockedStake.toString()} unit="PNK" />
+            </small>
+          </LockedPnk>
+        ) : null}
+      </StakesGroup>
+    </Container>
+  );
+};
+
+export default Header;
diff --git a/web/src/pages/Profile/Courts/index.tsx b/web/src/pages/Profile/Stakes/index.tsx
similarity index 84%
rename from web/src/pages/Profile/Courts/index.tsx
rename to web/src/pages/Profile/Stakes/index.tsx
index 512478b1d..8df01bb0b 100644
--- a/web/src/pages/Profile/Courts/index.tsx
+++ b/web/src/pages/Profile/Stakes/index.tsx
@@ -35,11 +35,11 @@ const StyledLabel = styled.label`
   font-size: ${responsiveSize(14, 16)};
 `;
 
-interface ICourts {
+interface IStakes {
   addressToQuery: `0x${string}`;
 }
 
-const Courts: React.FC<ICourts> = ({ addressToQuery }) => {
+const Stakes: React.FC<IStakes> = ({ addressToQuery }) => {
   const { data: stakeData, isLoading } = useJurorStakeDetailsQuery(addressToQuery);
   const { data: jurorBalance } = useReadSortitionModuleGetJurorBalance({
     args: [addressToQuery, BigInt(1)],
@@ -48,11 +48,15 @@ const Courts: React.FC<ICourts> = ({ addressToQuery }) => {
   const searchParamAddress = searchParams.get("address")?.toLowerCase();
   const stakedCourts = stakeData?.jurorTokensPerCourts?.filter(({ staked }) => staked > 0);
   const isStaked = stakedCourts && stakedCourts.length > 0;
+  const availableStake = jurorBalance?.[0];
   const lockedStake = jurorBalance?.[1];
+  const effectiveStake = stakeData?.jurorTokensPerCourts?.[0]?.effectiveStake
+    ? BigInt(stakeData.jurorTokensPerCourts[0].effectiveStake)
+    : undefined;
 
   return (
     <Container>
-      <Header lockedStake={lockedStake ?? BigInt(0)} />
+      <Header {...{ lockedStake, availableStake, effectiveStake }} />
       {isLoading ? <Skeleton /> : null}
       {!isStaked && !isLoading ? (
         <StyledLabel>{searchParamAddress ? "They" : "You"} are not staked in any court</StyledLabel>
@@ -70,4 +74,4 @@ const Courts: React.FC<ICourts> = ({ addressToQuery }) => {
   );
 };
 
-export default Courts;
+export default Stakes;
diff --git a/web/src/pages/Profile/index.tsx b/web/src/pages/Profile/index.tsx
index 109046748..b52327eda 100644
--- a/web/src/pages/Profile/index.tsx
+++ b/web/src/pages/Profile/index.tsx
@@ -1,24 +1,27 @@
 import React, { useMemo } from "react";
-
 import styled, { css } from "styled-components";
-import { MAX_WIDTH_LANDSCAPE, landscapeStyle } from "styles/landscapeStyle";
-import { responsiveSize } from "styles/responsiveSize";
 
 import { useNavigate, useParams, useSearchParams } from "react-router-dom";
 import { useAccount } from "wagmi";
 
 import { isUndefined } from "utils/index";
 import { decodeURIFilter, useRootPath } from "utils/uri";
+
 import { DisputeDetailsFragment, useMyCasesQuery } from "queries/useCasesQuery";
 import { useUserQuery } from "queries/useUser";
+
 import { Dispute_Filter, OrderDirection, UserDetailsFragment } from "src/graphql/graphql";
 
+import { MAX_WIDTH_LANDSCAPE, landscapeStyle } from "styles/landscapeStyle";
+import { responsiveSize } from "styles/responsiveSize";
+
 import CasesDisplay from "components/CasesDisplay";
 import ConnectWallet from "components/ConnectWallet";
 import FavoriteCases from "components/FavoriteCases";
 import ScrollTop from "components/ScrollTop";
-import Courts from "./Courts";
+
 import JurorInfo from "./JurorInfo";
+import Stakes from "./Stakes";
 
 const Container = styled.div`
   width: 100%;
@@ -110,7 +113,7 @@ const Profile: React.FC = () => {
       {isConnected || searchParamAddress ? (
         <>
           <JurorInfo {...{ addressToQuery }} />
-          <Courts {...{ addressToQuery }} />
+          <Stakes {...{ addressToQuery }} />
           <StyledCasesDisplay
             title={`${searchParamAddress ? "Their" : "My"} Cases`}
             disputes={userData?.user !== null ? (disputesData?.user?.disputes as DisputeDetailsFragment[]) : []}

From 0cadf21ebd1ba66b3e736f54d69f1eac226ec154 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 20 Aug 2025 21:15:26 +0100
Subject: [PATCH 054/175] feat: automatically stake PNK rewards instead of
 transferring them

---
 contracts/src/arbitration/KlerosCoreBase.sol  | 11 ++++--
 .../src/arbitration/SortitionModuleBase.sol   | 24 +++++++++++++
 .../interfaces/ISortitionModule.sol           |  2 ++
 .../university/KlerosCoreUniversity.sol       | 11 ++++--
 .../university/SortitionModuleUniversity.sol  | 34 +++++++++++++++++++
 contracts/test/foundry/KlerosCore.t.sol       |  4 +--
 6 files changed, 80 insertions(+), 6 deletions(-)

diff --git a/contracts/src/arbitration/KlerosCoreBase.sol b/contracts/src/arbitration/KlerosCoreBase.sol
index 3164e7245..5816f872a 100644
--- a/contracts/src/arbitration/KlerosCoreBase.sol
+++ b/contracts/src/arbitration/KlerosCoreBase.sol
@@ -846,13 +846,20 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
         // Release the rest of the PNKs of the juror for this round.
         sortitionModule.unlockStake(account, pnkLocked);
 
-        // Transfer the rewards
+        // Compute the rewards
         uint256 pnkReward = _applyCoherence(_params.pnkPenaltiesInRound / _params.coherentCount, pnkCoherence);
         round.sumPnkRewardPaid += pnkReward;
         uint256 feeReward = _applyCoherence(round.totalFeesForJurors / _params.coherentCount, feeCoherence);
         round.sumFeeRewardPaid += feeReward;
-        pinakion.safeTransfer(account, pnkReward);
+
+        // Transfer the fee reward
         _transferFeeToken(round.feeToken, payable(account), feeReward);
+
+        // Stake the PNK reward if possible, by-passes delayed stakes and other checks usually done by validateStake()
+        if (!sortitionModule.setStakeReward(account, dispute.courtID, pnkReward)) {
+            pinakion.safeTransfer(account, pnkReward);
+        }
+
         emit TokenAndETHShift(
             account,
             _params.disputeID,
diff --git a/contracts/src/arbitration/SortitionModuleBase.sol b/contracts/src/arbitration/SortitionModuleBase.sol
index 2ad7b89b2..af4eb6631 100644
--- a/contracts/src/arbitration/SortitionModuleBase.sol
+++ b/contracts/src/arbitration/SortitionModuleBase.sol
@@ -306,6 +306,30 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
         _setStake(_account, _courtID, _pnkDeposit, _pnkWithdrawal, _newStake);
     }
 
+    /// @dev Update the state of the stakes with a PNK reward deposit, called by KC during rewards execution.
+    /// `O(n + p * log_k(j))` where
+    /// `n` is the number of courts the juror has staked in,
+    /// `p` is the depth of the court tree,
+    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
+    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
+    /// @param _account The address of the juror.
+    /// @param _courtID The ID of the court.
+    /// @param _reward The amount of PNK to be deposited as a reward.
+    function setStakeReward(
+        address _account,
+        uint96 _courtID,
+        uint256 _reward
+    ) external override onlyByCore returns (bool success) {
+        if (_reward == 0) return true; // No reward to add.
+
+        uint256 currentStake = stakeOf(_account, _courtID);
+        if (currentStake == 0) return false; // Juror has been unstaked, don't increase their stake.
+
+        uint256 newStake = currentStake + _reward;
+        _setStake(_account, _courtID, _reward, 0, newStake);
+        return true;
+    }
+
     function _setStake(
         address _account,
         uint96 _courtID,
diff --git a/contracts/src/arbitration/interfaces/ISortitionModule.sol b/contracts/src/arbitration/interfaces/ISortitionModule.sol
index 5cf10e6ae..a51fadae9 100644
--- a/contracts/src/arbitration/interfaces/ISortitionModule.sol
+++ b/contracts/src/arbitration/interfaces/ISortitionModule.sol
@@ -29,6 +29,8 @@ interface ISortitionModule {
         uint256 _newStake
     ) external;
 
+    function setStakeReward(address _account, uint96 _courtID, uint256 _reward) external returns (bool success);
+
     function setJurorInactive(address _account) external;
 
     function lockStake(address _account, uint256 _relativeAmount) external;
diff --git a/contracts/src/arbitration/university/KlerosCoreUniversity.sol b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
index 5744088b0..0cd11b2f1 100644
--- a/contracts/src/arbitration/university/KlerosCoreUniversity.sol
+++ b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
@@ -840,12 +840,13 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         // Release the rest of the PNKs of the juror for this round.
         sortitionModule.unlockStake(account, pnkLocked);
 
-        // Transfer the rewards
+        // Compute the rewards
         uint256 pnkReward = ((_params.pnkPenaltiesInRound / _params.coherentCount) * pnkCoherence) / ONE_BASIS_POINT;
         round.sumPnkRewardPaid += pnkReward;
         uint256 feeReward = ((round.totalFeesForJurors / _params.coherentCount) * feeCoherence) / ONE_BASIS_POINT;
         round.sumFeeRewardPaid += feeReward;
-        pinakion.safeTransfer(account, pnkReward);
+
+        // Transfer the fee reward
         if (round.feeToken == NATIVE_CURRENCY) {
             // The dispute fees were paid in ETH
             payable(account).send(feeReward);
@@ -853,6 +854,12 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
             // The dispute fees were paid in ERC20
             round.feeToken.safeTransfer(account, feeReward);
         }
+
+        // Stake the PNK reward if possible, by-passes delayed stakes and other checks usually done by validateStake()
+        if (!sortitionModule.setStakeReward(account, dispute.courtID, pnkReward)) {
+            pinakion.safeTransfer(account, pnkReward);
+        }
+
         emit TokenAndETHShift(
             account,
             _params.disputeID,
diff --git a/contracts/src/arbitration/university/SortitionModuleUniversity.sol b/contracts/src/arbitration/university/SortitionModuleUniversity.sol
index db61958fd..e32ca5a77 100644
--- a/contracts/src/arbitration/university/SortitionModuleUniversity.sol
+++ b/contracts/src/arbitration/university/SortitionModuleUniversity.sol
@@ -190,6 +190,40 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
         uint256 _pnkWithdrawal,
         uint256 _newStake
     ) external override onlyByCore {
+        _setStake(_account, _courtID, _pnkDeposit, _pnkWithdrawal, _newStake);
+    }
+
+    /// @dev Update the state of the stakes with a PNK reward deposit, called by KC during rewards execution.
+    /// `O(n + p * log_k(j))` where
+    /// `n` is the number of courts the juror has staked in,
+    /// `p` is the depth of the court tree,
+    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
+    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
+    /// @param _account The address of the juror.
+    /// @param _courtID The ID of the court.
+    /// @param _reward The amount of PNK to be deposited as a reward.
+    function setStakeReward(
+        address _account,
+        uint96 _courtID,
+        uint256 _reward
+    ) external override onlyByCore returns (bool success) {
+        if (_reward == 0) return true; // No reward to add.
+
+        uint256 currentStake = _stakeOf(_account, _courtID);
+        if (currentStake == 0) return false; // Juror has been unstaked, don't increase their stake.
+
+        uint256 newStake = currentStake + _reward;
+        _setStake(_account, _courtID, _reward, 0, newStake);
+        return true;
+    }
+
+    function _setStake(
+        address _account,
+        uint96 _courtID,
+        uint256 _pnkDeposit,
+        uint256 _pnkWithdrawal,
+        uint256 _newStake
+    ) internal {
         Juror storage juror = jurors[_account];
         uint256 currentStake = _stakeOf(_account, _courtID);
         if (_pnkDeposit > 0) {
diff --git a/contracts/test/foundry/KlerosCore.t.sol b/contracts/test/foundry/KlerosCore.t.sol
index d0c3c190b..62a0b4de1 100644
--- a/contracts/test/foundry/KlerosCore.t.sol
+++ b/contracts/test/foundry/KlerosCore.t.sol
@@ -2397,9 +2397,9 @@ contract KlerosCoreTest is Test {
         assertEq(staker1.balance, 0, "Wrong balance of the staker1");
         assertEq(staker2.balance, 0.09 ether, "Wrong balance of the staker2");
 
-        assertEq(pinakion.balanceOf(address(core)), 20500, "Wrong token balance of the core"); // Was 21500. 1000 was transferred to staker2
+        assertEq(pinakion.balanceOf(address(core)), 21500, "Wrong token balance of the core"); // Was 21500. 1000 was transferred to staker2
         assertEq(pinakion.balanceOf(staker1), 999999999999998500, "Wrong token balance of staker1");
-        assertEq(pinakion.balanceOf(staker2), 999999999999981000, "Wrong token balance of staker2"); // 20k stake and 1k added as a reward, thus -19k from the default
+        assertEq(pinakion.balanceOf(staker2), 999999999999980000, "Wrong token balance of staker2"); // 20k stake and 1k added as a reward, thus -19k from the default
     }
 
     function test_execute_NoCoherence() public {

From e6572d58b4c61b19af7c767c7d484d115243525a Mon Sep 17 00:00:00 2001
From: Harman-singh-waraich <Waraichharman68@gmail.com>
Date: Thu, 21 Aug 2025 15:03:37 +0530
Subject: [PATCH 055/175] chore: explicit-dispute-kit-selection

---
 web/src/pages/Resolver/Parameters/Court.tsx | 15 +++------------
 1 file changed, 3 insertions(+), 12 deletions(-)

diff --git a/web/src/pages/Resolver/Parameters/Court.tsx b/web/src/pages/Resolver/Parameters/Court.tsx
index b74b22073..df4767f9d 100644
--- a/web/src/pages/Resolver/Parameters/Court.tsx
+++ b/web/src/pages/Resolver/Parameters/Court.tsx
@@ -187,19 +187,10 @@ const Court: React.FC = () => {
     );
   }, [supportedDisputeKits, availableDisputeKits]);
 
-  const selectedDisputeKitId = useMemo(() => {
-    // If there's only 1 supported dispute kit, select it by default
-    if (disputeKitOptions.length === 1) {
-      return disputeKitOptions[0].value;
-    }
-    // If there's no saved selection, select nothing
-    return disputeData.disputeKitId ?? -1;
-  }, [disputeKitOptions, disputeData.disputeKitId]);
-
   const isGatedDisputeKit = useMemo(() => {
-    const options = disputeKitOptions.find((dk) => String(dk.value) === String(selectedDisputeKitId));
+    const options = disputeKitOptions.find((dk) => String(dk.value) === String(disputeData.disputeKitId));
     return options?.gated ?? false;
-  }, [disputeKitOptions, selectedDisputeKitId]);
+  }, [disputeKitOptions, disputeData.disputeKitId]);
 
   // Token validation for token gate address (conditional based on ERC1155 checkbox)
   const tokenGateAddress = (disputeData.disputeKitData as IGatedDisputeData)?.tokenGate ?? "";
@@ -311,7 +302,7 @@ const Court: React.FC = () => {
         <StyledDropdownSelect
           items={disputeKitOptions}
           placeholder={{ text: "Select Dispute Kit" }}
-          defaultValue={selectedDisputeKitId}
+          defaultValue={disputeData.disputeKitId}
           callback={handleDisputeKitChange}
         />
       )}

From 8f4993d6e74e9f3ae215e7735262fbdae1b32ac2 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Fri, 22 Aug 2025 02:27:03 +0100
Subject: [PATCH 056/175] fix: validate the token address by querying a
 non-zero address due to OZ reverting on it

---
 web/src/hooks/useTokenAddressValidation.ts | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

diff --git a/web/src/hooks/useTokenAddressValidation.ts b/web/src/hooks/useTokenAddressValidation.ts
index e3233ef80..bb18addf0 100644
--- a/web/src/hooks/useTokenAddressValidation.ts
+++ b/web/src/hooks/useTokenAddressValidation.ts
@@ -76,11 +76,12 @@ export const useERC20ERC721Validation = ({
   address,
   enabled = true,
 }: UseTokenValidationParams): TokenValidationResult => {
+  // We query the balance for a random non-zero address because many implementations revert on it
   return useTokenValidation({
     address,
     enabled,
     abi: ERC20_ERC721_ABI,
-    contractCall: (contract) => contract.read.balanceOf(["0x0000000000000000000000000000000000000000"]),
+    contractCall: (contract) => contract.read.balanceOf(["0x0000000000000000000000000000000000001234"]),
     tokenType: "ERC-20 or ERC-721",
   });
 };
@@ -92,11 +93,12 @@ export const useERC20ERC721Validation = ({
  * @returns Validation state including loading, result, and error
  */
 export const useERC1155Validation = ({ address, enabled = true }: UseTokenValidationParams): TokenValidationResult => {
+  // We query the balance for a random non-zero address because many implementations revert on it
   return useTokenValidation({
     address,
     enabled,
     abi: ERC1155_ABI,
-    contractCall: (contract) => contract.read.balanceOf(["0x0000000000000000000000000000000000000000", 0]),
+    contractCall: (contract) => contract.read.balanceOf(["0x0000000000000000000000000000000000001234", 0]),
     tokenType: "ERC-1155",
   });
 };

From f2b21838698db2032707f57430c33db39f83a852 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Sat, 23 Aug 2025 04:52:57 +0100
Subject: [PATCH 057/175] fix: penalties now applied to sortition tree stakes

---
 contracts/hardhat.config.ts                   |   2 +-
 contracts/src/arbitration/KlerosCoreBase.sol  |  11 +-
 .../src/arbitration/SortitionModuleBase.sol   | 142 ++++++++++++++----
 .../dispute-kits/DisputeKitClassicBase.sol    |   6 +-
 .../arbitration/interfaces/IDisputeKit.sol    |   5 +-
 .../interfaces/ISortitionModule.sol           |  17 ++-
 .../university/KlerosCoreUniversity.sol       |  11 +-
 .../university/SortitionModuleUniversity.sol  |  57 ++++---
 .../test/arbitration/dispute-kit-gated.ts     |   2 +-
 contracts/test/foundry/KlerosCore.t.sol       |   4 +-
 10 files changed, 190 insertions(+), 67 deletions(-)

diff --git a/contracts/hardhat.config.ts b/contracts/hardhat.config.ts
index dc1cce1c6..3bb2787ca 100644
--- a/contracts/hardhat.config.ts
+++ b/contracts/hardhat.config.ts
@@ -31,7 +31,7 @@ const config: HardhatUserConfig = {
           viaIR: process.env.VIA_IR !== "false", // Defaults to true
           optimizer: {
             enabled: true,
-            runs: 10000,
+            runs: 2000,
           },
           outputSelection: {
             "*": {
diff --git a/contracts/src/arbitration/KlerosCoreBase.sol b/contracts/src/arbitration/KlerosCoreBase.sol
index 3164e7245..056d49fd5 100644
--- a/contracts/src/arbitration/KlerosCoreBase.sol
+++ b/contracts/src/arbitration/KlerosCoreBase.sol
@@ -60,6 +60,7 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
         uint256 repartitions; // A counter of reward repartitions made in this round.
         uint256 pnkPenalties; // The amount of PNKs collected from penalties in this round.
         address[] drawnJurors; // Addresses of the jurors that were drawn in this round.
+        uint96[] drawnJurorFromCourtIDs; // The courtIDs where the juror was drawn from, possibly their stake in a subcourt.
         uint256 sumFeeRewardPaid; // Total sum of arbitration fees paid to coherent jurors as a reward in this round.
         uint256 sumPnkRewardPaid; // Total sum of PNK paid to coherent jurors as a reward in this round.
         IERC20 feeToken; // The token used for paying fees in this round.
@@ -610,13 +611,14 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
         uint256 startIndex = round.drawIterations; // for gas: less storage reads
         uint256 i;
         while (i < _iterations && round.drawnJurors.length < round.nbVotes) {
-            address drawnAddress = disputeKit.draw(_disputeID, startIndex + i++);
+            (address drawnAddress, uint96 fromSubcourtID) = disputeKit.draw(_disputeID, startIndex + i++);
             if (drawnAddress == address(0)) {
                 continue;
             }
             sortitionModule.lockStake(drawnAddress, round.pnkAtStakePerJuror);
             emit Draw(drawnAddress, _disputeID, currentRound, round.drawnJurors.length);
             round.drawnJurors.push(drawnAddress);
+            round.drawnJurorFromCourtIDs.push(fromSubcourtID != 0 ? fromSubcourtID : dispute.courtID);
             if (round.drawnJurors.length == round.nbVotes) {
                 sortitionModule.postDrawHook(_disputeID, currentRound);
             }
@@ -786,7 +788,12 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
         sortitionModule.unlockStake(account, penalty);
 
         // Apply the penalty to the staked PNKs.
-        (uint256 pnkBalance, uint256 availablePenalty) = sortitionModule.penalizeStake(account, penalty);
+        uint96 penalizedInCourtID = round.drawnJurorFromCourtIDs[_params.repartition];
+        (uint256 pnkBalance, uint256 availablePenalty) = sortitionModule.setStakePenalty(
+            account,
+            penalizedInCourtID,
+            penalty
+        );
         _params.pnkPenaltiesInRound += availablePenalty;
         emit TokenAndETHShift(
             account,
diff --git a/contracts/src/arbitration/SortitionModuleBase.sol b/contracts/src/arbitration/SortitionModuleBase.sol
index 2ad7b89b2..9dc938de2 100644
--- a/contracts/src/arbitration/SortitionModuleBase.sol
+++ b/contracts/src/arbitration/SortitionModuleBase.sol
@@ -17,14 +17,20 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
     // *         Enums / Structs           * //
     // ************************************* //
 
+    struct SubCourtStakes {
+        uint256 totalStakedInCourts;
+        uint96[MAX_STAKE_PATHS] courtIDs;
+        uint256[MAX_STAKE_PATHS] stakedInCourts;
+    }
+
     struct SortitionSumTree {
         uint256 K; // The maximum number of children per node.
-        // We use this to keep track of vacant positions in the tree after removing a leaf. This is for keeping the tree as balanced as possible without spending gas on moving nodes around.
-        uint256[] stack;
-        uint256[] nodes;
+        uint256[] stack; // We use this to keep track of vacant positions in the tree after removing a leaf. This is for keeping the tree as balanced as possible without spending gas on moving nodes around.
+        uint256[] nodes; // The tree nodes.
         // Two-way mapping of IDs to node indexes. Note that node index 0 is reserved for the root node, and means the ID does not have a node.
-        mapping(bytes32 => uint256) IDsToNodeIndexes;
-        mapping(uint256 => bytes32) nodeIndexesToIDs;
+        mapping(bytes32 stakePathID => uint256 nodeIndex) IDsToNodeIndexes;
+        mapping(uint256 nodeIndex => bytes32 stakePathID) nodeIndexesToIDs;
+        mapping(bytes32 stakePathID => SubCourtStakes subcourtStakes) IDsToSubCourtStakes;
     }
 
     struct DelayedStake {
@@ -36,7 +42,7 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
 
     struct Juror {
         uint96[] courtIDs; // The IDs of courts where the juror's stake path ends. A stake path is a path from the general court to a court the juror directly staked in using `_setStake`.
-        uint256 stakedPnk; // The juror's total amount of tokens staked in subcourts. Reflects actual pnk balance.
+        uint256 stakedPnk; // The juror's total amount of tokens staked in subcourts. PNK balance including locked PNK and penalty deductions.
         uint256 lockedPnk; // The juror's total amount of tokens locked in disputes.
     }
 
@@ -306,6 +312,28 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
         _setStake(_account, _courtID, _pnkDeposit, _pnkWithdrawal, _newStake);
     }
 
+    function setStakePenalty(
+        address _account,
+        uint96 _courtID,
+        uint256 _penalty
+    ) external override onlyByCore returns (uint256 pnkBalance, uint256 availablePenalty) {
+        Juror storage juror = jurors[_account];
+        availablePenalty = _penalty;
+        if (juror.stakedPnk < _penalty) {
+            availablePenalty = juror.stakedPnk;
+        }
+
+        if (availablePenalty == 0) return (juror.stakedPnk, 0); // No penalty to apply.
+
+        uint256 currentStake = stakeOf(_account, _courtID);
+        uint256 newStake = 0;
+        if (currentStake >= availablePenalty) {
+            newStake = currentStake - availablePenalty;
+        }
+        _setStake(_account, _courtID, 0, availablePenalty, newStake);
+        pnkBalance = juror.stakedPnk; // updated by _setStake()
+    }
+
     function _setStake(
         address _account,
         uint96 _courtID,
@@ -339,12 +367,14 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
         bytes32 stakePathID = _accountAndCourtIDToStakePathID(_account, _courtID);
         bool finished = false;
         uint96 currentCourtID = _courtID;
+        uint96 fromSubCourtID = 0; // 0 means it is not coming from a subcourt.
         while (!finished) {
             // Tokens are also implicitly staked in parent courts through sortition module to increase the chance of being drawn.
-            _set(bytes32(uint256(currentCourtID)), _newStake, stakePathID);
+            _set(bytes32(uint256(currentCourtID)), _newStake, stakePathID, fromSubCourtID);
             if (currentCourtID == GENERAL_COURT) {
                 finished = true;
             } else {
+                fromSubCourtID = currentCourtID;
                 (currentCourtID, , , , , , ) = core.courts(currentCourtID); // Get the parent court.
             }
         }
@@ -367,25 +397,6 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
         }
     }
 
-    function penalizeStake(
-        address _account,
-        uint256 _relativeAmount
-    ) external override onlyByCore returns (uint256 pnkBalance, uint256 availablePenalty) {
-        Juror storage juror = jurors[_account];
-        uint256 stakedPnk = juror.stakedPnk;
-
-        if (stakedPnk >= _relativeAmount) {
-            availablePenalty = _relativeAmount;
-            juror.stakedPnk -= _relativeAmount;
-        } else {
-            availablePenalty = stakedPnk;
-            juror.stakedPnk = 0;
-        }
-
-        pnkBalance = juror.stakedPnk;
-        return (pnkBalance, availablePenalty);
-    }
-
     /// @dev Unstakes the inactive juror from all courts.
     /// `O(n * (p * log_k(j)) )` where
     /// `n` is the number of courts the juror has staked in,
@@ -433,12 +444,12 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
         bytes32 _key,
         uint256 _coreDisputeID,
         uint256 _nonce
-    ) public view override returns (address drawnAddress) {
+    ) public view override returns (address drawnAddress, uint96 fromSubcourtID) {
         if (phase != Phase.drawing) revert NotDrawingPhase();
         SortitionSumTree storage tree = sortitionSumTrees[_key];
 
         if (tree.nodes[0] == 0) {
-            return address(0); // No jurors staked.
+            return (address(0), 0); // No jurors staked.
         }
 
         uint256 currentDrawnNumber = uint256(keccak256(abi.encodePacked(randomNumber, _coreDisputeID, _nonce))) %
@@ -462,7 +473,33 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
                 }
             }
         }
-        drawnAddress = _stakePathIDToAccount(tree.nodeIndexesToIDs[treeIndex]);
+
+        bytes32 stakePathID = tree.nodeIndexesToIDs[treeIndex];
+        drawnAddress = _stakePathIDToAccount(stakePathID);
+
+        // Identify which subcourt was selected based on currentDrawnNumber
+        SubCourtStakes storage subcourtStakes = tree.IDsToSubCourtStakes[stakePathID];
+
+        // The current court stake is the node value minus all subcourt stakes
+        uint256 currentCourtStake = 0;
+        if (tree.nodes[treeIndex] > subcourtStakes.totalStakedInCourts) {
+            currentCourtStake = tree.nodes[treeIndex] - subcourtStakes.totalStakedInCourts;
+        }
+
+        // Check if the drawn number falls within current court range
+        if (currentDrawnNumber >= currentCourtStake) {
+            // Find which subcourt range contains the drawn number
+            uint256 accumulatedStake = currentCourtStake;
+            for (uint256 i = 0; i < MAX_STAKE_PATHS; i++) {
+                if (subcourtStakes.stakedInCourts[i] > 0) {
+                    if (currentDrawnNumber < accumulatedStake + subcourtStakes.stakedInCourts[i]) {
+                        fromSubcourtID = subcourtStakes.courtIDs[i];
+                        break;
+                    }
+                    accumulatedStake += subcourtStakes.stakedInCourts[i];
+                }
+            }
+        }
     }
 
     /// @dev Get the stake of a juror in a court.
@@ -487,6 +524,13 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
         return tree.nodes[treeIndex];
     }
 
+    /// @dev Gets the balance of a juror in a court.
+    /// @param _juror The address of the juror.
+    /// @param _courtID The ID of the court.
+    /// @return totalStaked The total amount of tokens staked including locked tokens and penalty deductions. Equivalent to the effective stake in the General court.
+    /// @return totalLocked The total amount of tokens locked in disputes.
+    /// @return stakedInCourt The amount of tokens staked in the specified court including locked tokens and penalty deductions.
+    /// @return nbCourts The number of courts the juror has directly staked in.
     function getJurorBalance(
         address _juror,
         uint96 _courtID
@@ -546,6 +590,41 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
         }
     }
 
+    /// @dev Update the subcourt stakes.
+    /// @param _subcourtStakes The subcourt stakes.
+    /// @param _value The value to update.
+    /// @param _fromSubCourtID The ID of the subcourt from which the stake is coming from, or 0 if the stake does not come from a subcourt.
+    /// `O(1)` complexity with `MAX_STAKE_PATHS` a small constant.
+    function _updateSubCourtStakes(
+        SubCourtStakes storage _subcourtStakes,
+        uint256 _value,
+        uint96 _fromSubCourtID
+    ) internal {
+        // Update existing stake item if found
+        for (uint256 i = 0; i < MAX_STAKE_PATHS; i++) {
+            if (_subcourtStakes.courtIDs[i] == _fromSubCourtID) {
+                if (_value == 0) {
+                    delete _subcourtStakes.courtIDs[i];
+                    delete _subcourtStakes.stakedInCourts[i];
+                } else {
+                    _subcourtStakes.totalStakedInCourts += _value;
+                    _subcourtStakes.totalStakedInCourts -= _subcourtStakes.stakedInCourts[i];
+                    _subcourtStakes.stakedInCourts[i] = _value;
+                }
+                return;
+            }
+        }
+        // Not found so add a new stake item
+        for (uint256 i = 0; i < MAX_STAKE_PATHS; i++) {
+            if (_subcourtStakes.courtIDs[i] == 0) {
+                _subcourtStakes.courtIDs[i] = _fromSubCourtID;
+                _subcourtStakes.totalStakedInCourts += _value;
+                _subcourtStakes.stakedInCourts[i] = _value;
+                return;
+            }
+        }
+    }
+
     /// @dev Retrieves a juror's address from the stake path ID.
     /// @param _stakePathID The stake path ID to unpack.
     /// @return account The account.
@@ -579,10 +658,11 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
     /// @param _key The key of the tree.
     /// @param _value The new value.
     /// @param _ID The ID of the value.
+    /// @param _fromSubCourtID The ID of the subcourt from which the stake is coming from, or 0 if the stake does not come from a subcourt.
     /// `O(log_k(n))` where
     /// `k` is the maximum number of children per node in the tree,
     ///  and `n` is the maximum number of nodes ever appended.
-    function _set(bytes32 _key, uint256 _value, bytes32 _ID) internal {
+    function _set(bytes32 _key, uint256 _value, bytes32 _ID, uint96 _fromSubCourtID) internal {
         SortitionSumTree storage tree = sortitionSumTrees[_key];
         uint256 treeIndex = tree.IDsToNodeIndexes[_ID];
 
@@ -652,6 +732,8 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
                 _updateParents(_key, treeIndex, plusOrMinus, plusOrMinusValue);
             }
         }
+
+        _updateSubCourtStakes(tree.IDsToSubCourtStakes[_ID], _value, _fromSubCourtID);
     }
 
     /// @dev Packs an account and a court ID into a stake path ID.
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index 0922f047b..780c3ad11 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -228,7 +228,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     function draw(
         uint256 _coreDisputeID,
         uint256 _nonce
-    ) external override onlyByCore notJumped(_coreDisputeID) returns (address drawnAddress) {
+    ) external override onlyByCore notJumped(_coreDisputeID) returns (address drawnAddress, uint96 fromSubcourtID) {
         uint256 localDisputeID = coreDisputeIDToLocal[_coreDisputeID];
         Dispute storage dispute = disputes[localDisputeID];
         uint256 localRoundID = dispute.rounds.length - 1;
@@ -238,10 +238,10 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         (uint96 courtID, , , , ) = core.disputes(_coreDisputeID);
         bytes32 key = bytes32(uint256(courtID)); // Get the ID of the tree.
 
-        drawnAddress = sortitionModule.draw(key, _coreDisputeID, _nonce);
+        (drawnAddress, fromSubcourtID) = sortitionModule.draw(key, _coreDisputeID, _nonce);
         if (drawnAddress == address(0)) {
             // Sortition can return 0 address if no one has staked yet.
-            return drawnAddress;
+            return (drawnAddress, fromSubcourtID);
         }
 
         if (_postDrawCheck(round, _coreDisputeID, drawnAddress)) {
diff --git a/contracts/src/arbitration/interfaces/IDisputeKit.sol b/contracts/src/arbitration/interfaces/IDisputeKit.sol
index 6a72b35e4..9cc3c891b 100644
--- a/contracts/src/arbitration/interfaces/IDisputeKit.sol
+++ b/contracts/src/arbitration/interfaces/IDisputeKit.sol
@@ -48,7 +48,10 @@ interface IDisputeKit {
     /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
     /// @param _nonce Nonce.
     /// @return drawnAddress The drawn address.
-    function draw(uint256 _coreDisputeID, uint256 _nonce) external returns (address drawnAddress);
+    function draw(
+        uint256 _coreDisputeID,
+        uint256 _nonce
+    ) external returns (address drawnAddress, uint96 fromSubcourtID);
 
     // ************************************* //
     // *           Public Views            * //
diff --git a/contracts/src/arbitration/interfaces/ISortitionModule.sol b/contracts/src/arbitration/interfaces/ISortitionModule.sol
index 5cf10e6ae..e9423877f 100644
--- a/contracts/src/arbitration/interfaces/ISortitionModule.sol
+++ b/contracts/src/arbitration/interfaces/ISortitionModule.sol
@@ -29,20 +29,25 @@ interface ISortitionModule {
         uint256 _newStake
     ) external;
 
+    function setStakePenalty(
+        address _account,
+        uint96 _courtID,
+        uint256 _penalty
+    ) external returns (uint256 pnkBalance, uint256 availablePenalty);
+
     function setJurorInactive(address _account) external;
 
     function lockStake(address _account, uint256 _relativeAmount) external;
 
     function unlockStake(address _account, uint256 _relativeAmount) external;
 
-    function penalizeStake(
-        address _account,
-        uint256 _relativeAmount
-    ) external returns (uint256 pnkBalance, uint256 availablePenalty);
-
     function notifyRandomNumber(uint256 _drawnNumber) external;
 
-    function draw(bytes32 _court, uint256 _coreDisputeID, uint256 _nonce) external view returns (address);
+    function draw(
+        bytes32 _court,
+        uint256 _coreDisputeID,
+        uint256 _nonce
+    ) external view returns (address drawnAddress, uint96 fromSubcourtID);
 
     function getJurorBalance(
         address _juror,
diff --git a/contracts/src/arbitration/university/KlerosCoreUniversity.sol b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
index 5744088b0..8e377dac3 100644
--- a/contracts/src/arbitration/university/KlerosCoreUniversity.sol
+++ b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
@@ -59,6 +59,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         uint256 repartitions; // A counter of reward repartitions made in this round.
         uint256 pnkPenalties; // The amount of PNKs collected from penalties in this round.
         address[] drawnJurors; // Addresses of the jurors that were drawn in this round.
+        uint96[] drawnJurorFromCourtIDs; // The courtIDs where the juror was drawn from, possibly their stake in a subcourt.
         uint256 sumFeeRewardPaid; // Total sum of arbitration fees paid to coherent jurors as a reward in this round.
         uint256 sumPnkRewardPaid; // Total sum of PNK paid to coherent jurors as a reward in this round.
         IERC20 feeToken; // The token used for paying fees in this round.
@@ -599,13 +600,14 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         {
             IDisputeKit disputeKit = disputeKits[round.disputeKitID];
             uint256 iteration = round.drawIterations + 1;
-            address drawnAddress = disputeKit.draw(_disputeID, iteration);
+            (address drawnAddress, uint96 fromSubcourtID) = disputeKit.draw(_disputeID, iteration);
             if (drawnAddress == address(0)) {
                 revert NoJurorDrawn();
             }
             sortitionModule.lockStake(drawnAddress, round.pnkAtStakePerJuror);
             emit Draw(drawnAddress, _disputeID, currentRound, round.drawnJurors.length);
             round.drawnJurors.push(drawnAddress);
+            round.drawnJurorFromCourtIDs.push(fromSubcourtID != 0 ? fromSubcourtID : dispute.courtID);
             if (round.drawnJurors.length == round.nbVotes) {
                 sortitionModule.postDrawHook(_disputeID, currentRound);
             }
@@ -774,7 +776,12 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         sortitionModule.unlockStake(account, penalty);
 
         // Apply the penalty to the staked PNKs.
-        (uint256 pnkBalance, uint256 availablePenalty) = sortitionModule.penalizeStake(account, penalty);
+        uint96 penalizedInCourtID = round.drawnJurorFromCourtIDs[_params.repartition];
+        (uint256 pnkBalance, uint256 availablePenalty) = sortitionModule.setStakePenalty(
+            account,
+            penalizedInCourtID,
+            penalty
+        );
         _params.pnkPenaltiesInRound += availablePenalty;
         emit TokenAndETHShift(
             account,
diff --git a/contracts/src/arbitration/university/SortitionModuleUniversity.sol b/contracts/src/arbitration/university/SortitionModuleUniversity.sol
index db61958fd..51d8555fc 100644
--- a/contracts/src/arbitration/university/SortitionModuleUniversity.sol
+++ b/contracts/src/arbitration/university/SortitionModuleUniversity.sol
@@ -190,6 +190,38 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
         uint256 _pnkWithdrawal,
         uint256 _newStake
     ) external override onlyByCore {
+        _setStake(_account, _courtID, _pnkDeposit, _pnkWithdrawal, _newStake);
+    }
+
+    function setStakePenalty(
+        address _account,
+        uint96 _courtID,
+        uint256 _penalty
+    ) external override onlyByCore returns (uint256 pnkBalance, uint256 availablePenalty) {
+        Juror storage juror = jurors[_account];
+        availablePenalty = _penalty;
+        if (juror.stakedPnk < _penalty) {
+            availablePenalty = juror.stakedPnk;
+        }
+
+        if (availablePenalty == 0) return (juror.stakedPnk, 0); // No penalty to apply.
+
+        uint256 currentStake = _stakeOf(_account, _courtID);
+        uint256 newStake = 0;
+        if (currentStake >= availablePenalty) {
+            newStake = currentStake - availablePenalty;
+        }
+        _setStake(_account, _courtID, 0, availablePenalty, newStake);
+        pnkBalance = juror.stakedPnk; // updated by _setStake()
+    }
+
+    function _setStake(
+        address _account,
+        uint96 _courtID,
+        uint256 _pnkDeposit,
+        uint256 _pnkWithdrawal,
+        uint256 _newStake
+    ) internal {
         Juror storage juror = jurors[_account];
         uint256 currentStake = _stakeOf(_account, _courtID);
         if (_pnkDeposit > 0) {
@@ -237,25 +269,6 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
         emit StakeLocked(_account, _relativeAmount, true);
     }
 
-    function penalizeStake(
-        address _account,
-        uint256 _relativeAmount
-    ) external override onlyByCore returns (uint256 pnkBalance, uint256 availablePenalty) {
-        Juror storage juror = jurors[_account];
-        uint256 stakedPnk = juror.stakedPnk;
-
-        if (stakedPnk >= _relativeAmount) {
-            availablePenalty = _relativeAmount;
-            juror.stakedPnk -= _relativeAmount;
-        } else {
-            availablePenalty = stakedPnk;
-            juror.stakedPnk = 0;
-        }
-
-        pnkBalance = juror.stakedPnk;
-        return (pnkBalance, availablePenalty);
-    }
-
     /// @dev Unstakes the inactive juror from all courts.
     /// `O(n * (p * log_k(j)) )` where
     /// `n` is the number of courts the juror has staked in,
@@ -293,7 +306,11 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
     /// @dev Draw an ID from a tree using a number.
     /// Note that this function reverts if the sum of all values in the tree is 0.
     /// @return drawnAddress The drawn address.
-    function draw(bytes32, uint256, uint256) public view override returns (address drawnAddress) {
+    function draw(
+        bytes32,
+        uint256,
+        uint256
+    ) public view override returns (address drawnAddress, uint96 fromSubcourtID) {
         drawnAddress = transientJuror;
     }
 
diff --git a/contracts/test/arbitration/dispute-kit-gated.ts b/contracts/test/arbitration/dispute-kit-gated.ts
index 4c3d26052..b7336087c 100644
--- a/contracts/test/arbitration/dispute-kit-gated.ts
+++ b/contracts/test/arbitration/dispute-kit-gated.ts
@@ -109,7 +109,7 @@ describe("DisputeKitGated", async () => {
 
       await core
         .connect(juror)
-        .setStake(Courts.GENERAL, thousandPNK(10), { gasLimit: 300000 })
+        .setStake(Courts.GENERAL, thousandPNK(10), { gasLimit: 500000 })
         .then((tx) => tx.wait());
 
       expect(await sortitionModule.getJurorBalance(juror.address, 1)).to.deep.equal([
diff --git a/contracts/test/foundry/KlerosCore.t.sol b/contracts/test/foundry/KlerosCore.t.sol
index d0c3c190b..5b60aad7e 100644
--- a/contracts/test/foundry/KlerosCore.t.sol
+++ b/contracts/test/foundry/KlerosCore.t.sol
@@ -2521,7 +2521,9 @@ contract KlerosCoreTest is Test {
 
         // Note that these events are emitted only after the first iteration of execute() therefore the juror has been penalized only for 1000 PNK her.
         vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeSet(staker1, newCourtID, 0, 19000); // Starting with 40000 we first nullify the stake and remove 20000 and then remove penalty once since there was only first iteration (40000 - 20000 - 1000)
+        emit SortitionModuleBase.StakeSet(staker1, newCourtID, 19000, 39000); // 1000 PNK penalty for voteID 0
+        vm.expectEmit(true, true, true, true);
+        emit SortitionModuleBase.StakeSet(staker1, newCourtID, 0, 20000); // Starting with 40000 we first nullify the stake and remove 19000 and then remove penalty once since there was only first iteration (40000 - 20000 - 1000)
         vm.expectEmit(true, true, true, true);
         emit SortitionModuleBase.StakeSet(staker1, GENERAL_COURT, 0, 2000); // 2000 PNK should remain in balance to cover penalties since the first 1000 of locked pnk was already unlocked
         core.execute(disputeID, 0, 3);

From 524116cf88032a1bf4291cbf924abf48d3eb017e Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Mon, 25 Aug 2025 20:19:47 +0100
Subject: [PATCH 058/175] chore: changelog

---
 contracts/CHANGELOG.md | 1 +
 1 file changed, 1 insertion(+)

diff --git a/contracts/CHANGELOG.md b/contracts/CHANGELOG.md
index 07201c2f5..bea677f34 100644
--- a/contracts/CHANGELOG.md
+++ b/contracts/CHANGELOG.md
@@ -8,6 +8,7 @@ The format is based on [Common Changelog](https://common-changelog.org/).
 
 ### Changed
 
+- **Breaking:** Stake the juror's PNK rewards instead of transferring them out ([#2099](https://github.com/kleros/kleros-v2/issues/2099))
 - **Breaking:** Replace `require()` with `revert()` and custom errors outside KlerosCore for consistency and smaller bytecode ([#2084](https://github.com/kleros/kleros-v2/issues/2084))
 - **Breaking:** Rename the interface from `RNG` to `IRNG` ([#2054](https://github.com/kleros/kleros-v2/issues/2054))
 - **Breaking:** Remove the `_block` parameter from `IRNG.requestRandomness()` and `IRNG.receiveRandomness()`, not needed for the primary VRF-based RNG ([#2054](https://github.com/kleros/kleros-v2/issues/2054))

From 5468d5542141310786e5d456748aee38d7e55735 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Mon, 25 Aug 2025 20:44:31 +0100
Subject: [PATCH 059/175] refactor: minor variable rename, natspec

---
 .../src/arbitration/SortitionModuleBase.sol   | 51 +++++++++++--------
 1 file changed, 31 insertions(+), 20 deletions(-)

diff --git a/contracts/src/arbitration/SortitionModuleBase.sol b/contracts/src/arbitration/SortitionModuleBase.sol
index 9dc938de2..b5b7944c1 100644
--- a/contracts/src/arbitration/SortitionModuleBase.sol
+++ b/contracts/src/arbitration/SortitionModuleBase.sol
@@ -18,9 +18,9 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
     // ************************************* //
 
     struct SubCourtStakes {
-        uint256 totalStakedInCourts;
-        uint96[MAX_STAKE_PATHS] courtIDs;
-        uint256[MAX_STAKE_PATHS] stakedInCourts;
+        uint256 totalStakedInSubCourts;
+        uint96[MAX_STAKE_PATHS] subCourtIDs;
+        uint256[MAX_STAKE_PATHS] stakedInSubCourts;
     }
 
     struct SortitionSumTree {
@@ -312,6 +312,17 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
         _setStake(_account, _courtID, _pnkDeposit, _pnkWithdrawal, _newStake);
     }
 
+    /// @dev Update the state of the stakes with a PNK reward deposit, called by KC during rewards execution.
+    /// `O(n + p * log_k(j))` where
+    /// `n` is the number of courts the juror has staked in,
+    /// `p` is the depth of the court tree,
+    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
+    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
+    /// @param _account The address of the juror.
+    /// @param _courtID The ID of the court.
+    /// @param _penalty The amount of PNK to be deducted.
+    /// @return pnkBalance The updated total PNK balance of the juror, including the penalty.
+    /// @return availablePenalty The amount of PNK that was actually deducted.
     function setStakePenalty(
         address _account,
         uint96 _courtID,
@@ -331,7 +342,7 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
             newStake = currentStake - availablePenalty;
         }
         _setStake(_account, _courtID, 0, availablePenalty, newStake);
-        pnkBalance = juror.stakedPnk; // updated by _setStake()
+        pnkBalance = juror.stakedPnk; // Updated by _setStake().
     }
 
     function _setStake(
@@ -482,8 +493,8 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
 
         // The current court stake is the node value minus all subcourt stakes
         uint256 currentCourtStake = 0;
-        if (tree.nodes[treeIndex] > subcourtStakes.totalStakedInCourts) {
-            currentCourtStake = tree.nodes[treeIndex] - subcourtStakes.totalStakedInCourts;
+        if (tree.nodes[treeIndex] > subcourtStakes.totalStakedInSubCourts) {
+            currentCourtStake = tree.nodes[treeIndex] - subcourtStakes.totalStakedInSubCourts;
         }
 
         // Check if the drawn number falls within current court range
@@ -491,12 +502,12 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
             // Find which subcourt range contains the drawn number
             uint256 accumulatedStake = currentCourtStake;
             for (uint256 i = 0; i < MAX_STAKE_PATHS; i++) {
-                if (subcourtStakes.stakedInCourts[i] > 0) {
-                    if (currentDrawnNumber < accumulatedStake + subcourtStakes.stakedInCourts[i]) {
-                        fromSubcourtID = subcourtStakes.courtIDs[i];
+                if (subcourtStakes.stakedInSubCourts[i] > 0) {
+                    if (currentDrawnNumber < accumulatedStake + subcourtStakes.stakedInSubCourts[i]) {
+                        fromSubcourtID = subcourtStakes.subCourtIDs[i];
                         break;
                     }
-                    accumulatedStake += subcourtStakes.stakedInCourts[i];
+                    accumulatedStake += subcourtStakes.stakedInSubCourts[i];
                 }
             }
         }
@@ -602,24 +613,24 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
     ) internal {
         // Update existing stake item if found
         for (uint256 i = 0; i < MAX_STAKE_PATHS; i++) {
-            if (_subcourtStakes.courtIDs[i] == _fromSubCourtID) {
+            if (_subcourtStakes.subCourtIDs[i] == _fromSubCourtID) {
                 if (_value == 0) {
-                    delete _subcourtStakes.courtIDs[i];
-                    delete _subcourtStakes.stakedInCourts[i];
+                    delete _subcourtStakes.subCourtIDs[i];
+                    delete _subcourtStakes.stakedInSubCourts[i];
                 } else {
-                    _subcourtStakes.totalStakedInCourts += _value;
-                    _subcourtStakes.totalStakedInCourts -= _subcourtStakes.stakedInCourts[i];
-                    _subcourtStakes.stakedInCourts[i] = _value;
+                    _subcourtStakes.totalStakedInSubCourts += _value;
+                    _subcourtStakes.totalStakedInSubCourts -= _subcourtStakes.stakedInSubCourts[i];
+                    _subcourtStakes.stakedInSubCourts[i] = _value;
                 }
                 return;
             }
         }
         // Not found so add a new stake item
         for (uint256 i = 0; i < MAX_STAKE_PATHS; i++) {
-            if (_subcourtStakes.courtIDs[i] == 0) {
-                _subcourtStakes.courtIDs[i] = _fromSubCourtID;
-                _subcourtStakes.totalStakedInCourts += _value;
-                _subcourtStakes.stakedInCourts[i] = _value;
+            if (_subcourtStakes.subCourtIDs[i] == 0) {
+                _subcourtStakes.subCourtIDs[i] = _fromSubCourtID;
+                _subcourtStakes.totalStakedInSubCourts += _value;
+                _subcourtStakes.stakedInSubCourts[i] = _value;
                 return;
             }
         }

From 1aae950dff5987fc348b5bfa3c7c4ae10c500d20 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Tue, 26 Aug 2025 21:50:18 +0100
Subject: [PATCH 060/175] feat: unstake juror if below minStake after penalty,
 simplified sub-court origination logic

---
 contracts/src/arbitration/KlerosCoreBase.sol  |   9 +-
 .../src/arbitration/SortitionModuleBase.sol   | 159 ++++++------------
 .../interfaces/ISortitionModule.sol           |   2 +-
 .../university/KlerosCoreUniversity.sol       |   9 +-
 .../university/SortitionModuleUniversity.sol  |   6 +-
 5 files changed, 74 insertions(+), 111 deletions(-)

diff --git a/contracts/src/arbitration/KlerosCoreBase.sol b/contracts/src/arbitration/KlerosCoreBase.sol
index 056d49fd5..5a51cdf1a 100644
--- a/contracts/src/arbitration/KlerosCoreBase.sol
+++ b/contracts/src/arbitration/KlerosCoreBase.sol
@@ -789,7 +789,7 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
 
         // Apply the penalty to the staked PNKs.
         uint96 penalizedInCourtID = round.drawnJurorFromCourtIDs[_params.repartition];
-        (uint256 pnkBalance, uint256 availablePenalty) = sortitionModule.setStakePenalty(
+        (uint256 pnkBalance, uint256 newCourtStake, uint256 availablePenalty) = sortitionModule.setStakePenalty(
             account,
             penalizedInCourtID,
             penalty
@@ -804,10 +804,15 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
             0,
             round.feeToken
         );
-        // Unstake the juror from all courts if he was inactive or his balance can't cover penalties anymore.
+
         if (pnkBalance == 0 || !disputeKit.isVoteActive(_params.disputeID, _params.round, _params.repartition)) {
+            // The juror is inactive or their balance is can't cover penalties anymore, unstake them from all courts.
             sortitionModule.setJurorInactive(account);
+        } else if (newCourtStake < courts[penalizedInCourtID].minStake) {
+            // The juror's balance fell below the court minStake, unstake them from the court.
+            sortitionModule.setStake(account, penalizedInCourtID, 0, 0, 0);
         }
+
         if (_params.repartition == _params.numberOfVotesInRound - 1 && _params.coherentCount == 0) {
             // No one was coherent, send the rewards to the governor.
             _transferFeeToken(round.feeToken, payable(governor), round.totalFeesForJurors);
diff --git a/contracts/src/arbitration/SortitionModuleBase.sol b/contracts/src/arbitration/SortitionModuleBase.sol
index b5b7944c1..69bdefc8b 100644
--- a/contracts/src/arbitration/SortitionModuleBase.sol
+++ b/contracts/src/arbitration/SortitionModuleBase.sol
@@ -17,12 +17,6 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
     // *         Enums / Structs           * //
     // ************************************* //
 
-    struct SubCourtStakes {
-        uint256 totalStakedInSubCourts;
-        uint96[MAX_STAKE_PATHS] subCourtIDs;
-        uint256[MAX_STAKE_PATHS] stakedInSubCourts;
-    }
-
     struct SortitionSumTree {
         uint256 K; // The maximum number of children per node.
         uint256[] stack; // We use this to keep track of vacant positions in the tree after removing a leaf. This is for keeping the tree as balanced as possible without spending gas on moving nodes around.
@@ -30,7 +24,6 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
         // Two-way mapping of IDs to node indexes. Note that node index 0 is reserved for the root node, and means the ID does not have a node.
         mapping(bytes32 stakePathID => uint256 nodeIndex) IDsToNodeIndexes;
         mapping(uint256 nodeIndex => bytes32 stakePathID) nodeIndexesToIDs;
-        mapping(bytes32 stakePathID => SubCourtStakes subcourtStakes) IDsToSubCourtStakes;
     }
 
     struct DelayedStake {
@@ -322,19 +315,21 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
     /// @param _courtID The ID of the court.
     /// @param _penalty The amount of PNK to be deducted.
     /// @return pnkBalance The updated total PNK balance of the juror, including the penalty.
+    /// @return newCourtStake The updated stake of the juror in the court.
     /// @return availablePenalty The amount of PNK that was actually deducted.
     function setStakePenalty(
         address _account,
         uint96 _courtID,
         uint256 _penalty
-    ) external override onlyByCore returns (uint256 pnkBalance, uint256 availablePenalty) {
+    ) external override onlyByCore returns (uint256 pnkBalance, uint256 newCourtStake, uint256 availablePenalty) {
         Juror storage juror = jurors[_account];
         availablePenalty = _penalty;
+        newCourtStake = stakeOf(_account, _courtID);
         if (juror.stakedPnk < _penalty) {
             availablePenalty = juror.stakedPnk;
         }
 
-        if (availablePenalty == 0) return (juror.stakedPnk, 0); // No penalty to apply.
+        if (availablePenalty == 0) return (juror.stakedPnk, newCourtStake, 0); // No penalty to apply.
 
         uint256 currentStake = stakeOf(_account, _courtID);
         uint256 newStake = 0;
@@ -342,7 +337,8 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
             newStake = currentStake - availablePenalty;
         }
         _setStake(_account, _courtID, 0, availablePenalty, newStake);
-        pnkBalance = juror.stakedPnk; // Updated by _setStake().
+        pnkBalance = juror.stakedPnk; // updated by _setStake()
+        newCourtStake = stakeOf(_account, _courtID); // updated by _setStake()
     }
 
     function _setStake(
@@ -378,14 +374,12 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
         bytes32 stakePathID = _accountAndCourtIDToStakePathID(_account, _courtID);
         bool finished = false;
         uint96 currentCourtID = _courtID;
-        uint96 fromSubCourtID = 0; // 0 means it is not coming from a subcourt.
         while (!finished) {
             // Tokens are also implicitly staked in parent courts through sortition module to increase the chance of being drawn.
-            _set(bytes32(uint256(currentCourtID)), _newStake, stakePathID, fromSubCourtID);
+            _set(bytes32(uint256(currentCourtID)), _newStake, stakePathID);
             if (currentCourtID == GENERAL_COURT) {
                 finished = true;
             } else {
-                fromSubCourtID = currentCourtID;
                 (currentCourtID, , , , , , ) = core.courts(currentCourtID); // Get the parent court.
             }
         }
@@ -486,31 +480,7 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
         }
 
         bytes32 stakePathID = tree.nodeIndexesToIDs[treeIndex];
-        drawnAddress = _stakePathIDToAccount(stakePathID);
-
-        // Identify which subcourt was selected based on currentDrawnNumber
-        SubCourtStakes storage subcourtStakes = tree.IDsToSubCourtStakes[stakePathID];
-
-        // The current court stake is the node value minus all subcourt stakes
-        uint256 currentCourtStake = 0;
-        if (tree.nodes[treeIndex] > subcourtStakes.totalStakedInSubCourts) {
-            currentCourtStake = tree.nodes[treeIndex] - subcourtStakes.totalStakedInSubCourts;
-        }
-
-        // Check if the drawn number falls within current court range
-        if (currentDrawnNumber >= currentCourtStake) {
-            // Find which subcourt range contains the drawn number
-            uint256 accumulatedStake = currentCourtStake;
-            for (uint256 i = 0; i < MAX_STAKE_PATHS; i++) {
-                if (subcourtStakes.stakedInSubCourts[i] > 0) {
-                    if (currentDrawnNumber < accumulatedStake + subcourtStakes.stakedInSubCourts[i]) {
-                        fromSubcourtID = subcourtStakes.subCourtIDs[i];
-                        break;
-                    }
-                    accumulatedStake += subcourtStakes.stakedInSubCourts[i];
-                }
-            }
-        }
+        (drawnAddress, fromSubcourtID) = _stakePathIDToAccountAndCourtID(stakePathID);
     }
 
     /// @dev Get the stake of a juror in a court.
@@ -524,11 +494,11 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
 
     /// @dev Get the stake of a juror in a court.
     /// @param _key The key of the tree, corresponding to a court.
-    /// @param _ID The stake path ID, corresponding to a juror.
+    /// @param _stakePathID The stake path ID, corresponding to a juror.
     /// @return The stake of the juror in the court.
-    function stakeOf(bytes32 _key, bytes32 _ID) public view returns (uint256) {
+    function stakeOf(bytes32 _key, bytes32 _stakePathID) public view returns (uint256) {
         SortitionSumTree storage tree = sortitionSumTrees[_key];
-        uint treeIndex = tree.IDsToNodeIndexes[_ID];
+        uint treeIndex = tree.IDsToNodeIndexes[_stakePathID];
         if (treeIndex == 0) {
             return 0;
         }
@@ -601,59 +571,6 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
         }
     }
 
-    /// @dev Update the subcourt stakes.
-    /// @param _subcourtStakes The subcourt stakes.
-    /// @param _value The value to update.
-    /// @param _fromSubCourtID The ID of the subcourt from which the stake is coming from, or 0 if the stake does not come from a subcourt.
-    /// `O(1)` complexity with `MAX_STAKE_PATHS` a small constant.
-    function _updateSubCourtStakes(
-        SubCourtStakes storage _subcourtStakes,
-        uint256 _value,
-        uint96 _fromSubCourtID
-    ) internal {
-        // Update existing stake item if found
-        for (uint256 i = 0; i < MAX_STAKE_PATHS; i++) {
-            if (_subcourtStakes.subCourtIDs[i] == _fromSubCourtID) {
-                if (_value == 0) {
-                    delete _subcourtStakes.subCourtIDs[i];
-                    delete _subcourtStakes.stakedInSubCourts[i];
-                } else {
-                    _subcourtStakes.totalStakedInSubCourts += _value;
-                    _subcourtStakes.totalStakedInSubCourts -= _subcourtStakes.stakedInSubCourts[i];
-                    _subcourtStakes.stakedInSubCourts[i] = _value;
-                }
-                return;
-            }
-        }
-        // Not found so add a new stake item
-        for (uint256 i = 0; i < MAX_STAKE_PATHS; i++) {
-            if (_subcourtStakes.subCourtIDs[i] == 0) {
-                _subcourtStakes.subCourtIDs[i] = _fromSubCourtID;
-                _subcourtStakes.totalStakedInSubCourts += _value;
-                _subcourtStakes.stakedInSubCourts[i] = _value;
-                return;
-            }
-        }
-    }
-
-    /// @dev Retrieves a juror's address from the stake path ID.
-    /// @param _stakePathID The stake path ID to unpack.
-    /// @return account The account.
-    function _stakePathIDToAccount(bytes32 _stakePathID) internal pure returns (address account) {
-        assembly {
-            // solium-disable-line security/no-inline-assembly
-            let ptr := mload(0x40)
-            for {
-                let i := 0x00
-            } lt(i, 0x14) {
-                i := add(i, 0x01)
-            } {
-                mstore8(add(add(ptr, 0x0c), i), byte(i, _stakePathID))
-            }
-            account := mload(ptr)
-        }
-    }
-
     function _extraDataToTreeK(bytes memory _extraData) internal pure returns (uint256 K) {
         if (_extraData.length >= 32) {
             assembly {
@@ -668,14 +585,13 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
     /// @dev Set a value in a tree.
     /// @param _key The key of the tree.
     /// @param _value The new value.
-    /// @param _ID The ID of the value.
-    /// @param _fromSubCourtID The ID of the subcourt from which the stake is coming from, or 0 if the stake does not come from a subcourt.
+    /// @param _stakePathID The ID of the value.
     /// `O(log_k(n))` where
     /// `k` is the maximum number of children per node in the tree,
     ///  and `n` is the maximum number of nodes ever appended.
-    function _set(bytes32 _key, uint256 _value, bytes32 _ID, uint96 _fromSubCourtID) internal {
+    function _set(bytes32 _key, uint256 _value, bytes32 _stakePathID) internal {
         SortitionSumTree storage tree = sortitionSumTrees[_key];
-        uint256 treeIndex = tree.IDsToNodeIndexes[_ID];
+        uint256 treeIndex = tree.IDsToNodeIndexes[_stakePathID];
 
         if (treeIndex == 0) {
             // No existing node.
@@ -709,8 +625,8 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
                 }
 
                 // Add label.
-                tree.IDsToNodeIndexes[_ID] = treeIndex;
-                tree.nodeIndexesToIDs[treeIndex] = _ID;
+                tree.IDsToNodeIndexes[_stakePathID] = treeIndex;
+                tree.nodeIndexesToIDs[treeIndex] = _stakePathID;
 
                 _updateParents(_key, treeIndex, true, _value);
             }
@@ -727,7 +643,7 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
                 tree.stack.push(treeIndex);
 
                 // Clear label.
-                delete tree.IDsToNodeIndexes[_ID];
+                delete tree.IDsToNodeIndexes[_stakePathID];
                 delete tree.nodeIndexesToIDs[treeIndex];
 
                 _updateParents(_key, treeIndex, false, value);
@@ -743,11 +659,9 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
                 _updateParents(_key, treeIndex, plusOrMinus, plusOrMinusValue);
             }
         }
-
-        _updateSubCourtStakes(tree.IDsToSubCourtStakes[_ID], _value, _fromSubCourtID);
     }
 
-    /// @dev Packs an account and a court ID into a stake path ID.
+    /// @dev Packs an account and a court ID into a stake path ID: [20 bytes of address][12 bytes of courtID] = 32 bytes total.
     /// @param _account The address of the juror to pack.
     /// @param _courtID The court ID to pack.
     /// @return stakePathID The stake path ID.
@@ -758,6 +672,8 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
         assembly {
             // solium-disable-line security/no-inline-assembly
             let ptr := mload(0x40)
+
+            // Write account address (first 20 bytes)
             for {
                 let i := 0x00
             } lt(i, 0x14) {
@@ -765,6 +681,8 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
             } {
                 mstore8(add(ptr, i), byte(add(0x0c, i), _account))
             }
+
+            // Write court ID (last 12 bytes)
             for {
                 let i := 0x14
             } lt(i, 0x20) {
@@ -776,6 +694,39 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
         }
     }
 
+    /// @dev Retrieves both juror's address and court ID from the stake path ID.
+    /// @param _stakePathID The stake path ID to unpack.
+    /// @return account The account.
+    /// @return courtID The court ID.
+    function _stakePathIDToAccountAndCourtID(
+        bytes32 _stakePathID
+    ) internal pure returns (address account, uint96 courtID) {
+        assembly {
+            // solium-disable-line security/no-inline-assembly
+            let ptr := mload(0x40)
+
+            // Read account address (first 20 bytes)
+            for {
+                let i := 0x00
+            } lt(i, 0x14) {
+                i := add(i, 0x01)
+            } {
+                mstore8(add(add(ptr, 0x0c), i), byte(i, _stakePathID))
+            }
+            account := mload(ptr)
+
+            // Read court ID (last 12 bytes)
+            for {
+                let i := 0x00
+            } lt(i, 0x0c) {
+                i := add(i, 0x01)
+            } {
+                mstore8(add(add(ptr, 0x14), i), byte(add(i, 0x14), _stakePathID))
+            }
+            courtID := mload(ptr)
+        }
+    }
+
     // ************************************* //
     // *              Errors               * //
     // ************************************* //
diff --git a/contracts/src/arbitration/interfaces/ISortitionModule.sol b/contracts/src/arbitration/interfaces/ISortitionModule.sol
index e9423877f..ead5709a0 100644
--- a/contracts/src/arbitration/interfaces/ISortitionModule.sol
+++ b/contracts/src/arbitration/interfaces/ISortitionModule.sol
@@ -33,7 +33,7 @@ interface ISortitionModule {
         address _account,
         uint96 _courtID,
         uint256 _penalty
-    ) external returns (uint256 pnkBalance, uint256 availablePenalty);
+    ) external returns (uint256 pnkBalance, uint256 newCourtStake, uint256 availablePenalty);
 
     function setJurorInactive(address _account) external;
 
diff --git a/contracts/src/arbitration/university/KlerosCoreUniversity.sol b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
index 8e377dac3..cf81cf605 100644
--- a/contracts/src/arbitration/university/KlerosCoreUniversity.sol
+++ b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
@@ -777,7 +777,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
 
         // Apply the penalty to the staked PNKs.
         uint96 penalizedInCourtID = round.drawnJurorFromCourtIDs[_params.repartition];
-        (uint256 pnkBalance, uint256 availablePenalty) = sortitionModule.setStakePenalty(
+        (uint256 pnkBalance, uint256 newCourtStake, uint256 availablePenalty) = sortitionModule.setStakePenalty(
             account,
             penalizedInCourtID,
             penalty
@@ -792,10 +792,15 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
             0,
             round.feeToken
         );
-        // Unstake the juror from all courts if he was inactive or his balance can't cover penalties anymore.
+
         if (pnkBalance == 0 || !disputeKit.isVoteActive(_params.disputeID, _params.round, _params.repartition)) {
+            // The juror is inactive or their balance is can't cover penalties anymore, unstake them from all courts.
             sortitionModule.setJurorInactive(account);
+        } else if (newCourtStake < courts[penalizedInCourtID].minStake) {
+            // The juror's balance fell below the court minStake, unstake them from the court.
+            sortitionModule.setStake(account, penalizedInCourtID, 0, 0, 0);
         }
+
         if (_params.repartition == _params.numberOfVotesInRound - 1 && _params.coherentCount == 0) {
             // No one was coherent, send the rewards to the governor.
             if (round.feeToken == NATIVE_CURRENCY) {
diff --git a/contracts/src/arbitration/university/SortitionModuleUniversity.sol b/contracts/src/arbitration/university/SortitionModuleUniversity.sol
index 51d8555fc..5077954d2 100644
--- a/contracts/src/arbitration/university/SortitionModuleUniversity.sol
+++ b/contracts/src/arbitration/university/SortitionModuleUniversity.sol
@@ -197,14 +197,15 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
         address _account,
         uint96 _courtID,
         uint256 _penalty
-    ) external override onlyByCore returns (uint256 pnkBalance, uint256 availablePenalty) {
+    ) external override onlyByCore returns (uint256 pnkBalance, uint256 newCourtStake, uint256 availablePenalty) {
         Juror storage juror = jurors[_account];
         availablePenalty = _penalty;
+        newCourtStake = _stakeOf(_account, _courtID);
         if (juror.stakedPnk < _penalty) {
             availablePenalty = juror.stakedPnk;
         }
 
-        if (availablePenalty == 0) return (juror.stakedPnk, 0); // No penalty to apply.
+        if (availablePenalty == 0) return (juror.stakedPnk, newCourtStake, 0); // No penalty to apply.
 
         uint256 currentStake = _stakeOf(_account, _courtID);
         uint256 newStake = 0;
@@ -213,6 +214,7 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
         }
         _setStake(_account, _courtID, 0, availablePenalty, newStake);
         pnkBalance = juror.stakedPnk; // updated by _setStake()
+        newCourtStake = _stakeOf(_account, _courtID); // updated by _setStake()
     }
 
     function _setStake(

From 208e0093ce8c7de0c4902dab256d60fe134b9a69 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Mon, 25 Aug 2025 22:26:08 +0100
Subject: [PATCH 061/175] feat: let the dispute kit force an early court jump
 and override the next round nbVotes

---
 contracts/hardhat.config.ts                   |  2 +-
 contracts/src/arbitration/KlerosCoreBase.sol  | 71 ++++++++++++++-----
 .../dispute-kits/DisputeKitClassicBase.sol    | 13 ++++
 .../arbitration/interfaces/IDisputeKit.sol    | 10 +++
 4 files changed, 76 insertions(+), 20 deletions(-)

diff --git a/contracts/hardhat.config.ts b/contracts/hardhat.config.ts
index dc1cce1c6..3bb2787ca 100644
--- a/contracts/hardhat.config.ts
+++ b/contracts/hardhat.config.ts
@@ -31,7 +31,7 @@ const config: HardhatUserConfig = {
           viaIR: process.env.VIA_IR !== "false", // Defaults to true
           optimizer: {
             enabled: true,
-            runs: 10000,
+            runs: 2000,
           },
           outputSelection: {
             "*": {
diff --git a/contracts/src/arbitration/KlerosCoreBase.sol b/contracts/src/arbitration/KlerosCoreBase.sol
index 5816f872a..abee79655 100644
--- a/contracts/src/arbitration/KlerosCoreBase.sol
+++ b/contracts/src/arbitration/KlerosCoreBase.sol
@@ -639,24 +639,17 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
         Round storage round = dispute.rounds[dispute.rounds.length - 1];
         if (msg.sender != address(disputeKits[round.disputeKitID])) revert DisputeKitOnly();
 
-        uint96 newCourtID = dispute.courtID;
-        uint256 newDisputeKitID = round.disputeKitID;
-
         // Warning: the extra round must be created before calling disputeKit.createDispute()
         Round storage extraRound = dispute.rounds.push();
 
-        if (round.nbVotes >= courts[newCourtID].jurorsForCourtJump) {
-            // Jump to parent court.
-            newCourtID = courts[newCourtID].parent;
-
-            if (!courts[newCourtID].supportedDisputeKits[newDisputeKitID]) {
-                // Switch to classic dispute kit if parent court doesn't support the current one.
-                newDisputeKitID = DISPUTE_KIT_CLASSIC;
-            }
-
-            if (newCourtID != dispute.courtID) {
-                emit CourtJump(_disputeID, dispute.rounds.length - 1, dispute.courtID, newCourtID);
-            }
+        (uint96 newCourtID, uint256 newDisputeKitID, bool courtJump, ) = _getCourtAndDisputeKitJumps(
+            dispute,
+            round,
+            courts[dispute.courtID],
+            _disputeID
+        );
+        if (courtJump) {
+            emit CourtJump(_disputeID, dispute.rounds.length - 1, dispute.courtID, newCourtID);
         }
 
         dispute.courtID = newCourtID;
@@ -934,17 +927,22 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
         Dispute storage dispute = disputes[_disputeID];
         Round storage round = dispute.rounds[dispute.rounds.length - 1];
         Court storage court = courts[dispute.courtID];
-        if (round.nbVotes >= court.jurorsForCourtJump) {
+
+        (, uint256 newDisputeKitID, bool courtJump, ) = _getCourtAndDisputeKitJumps(dispute, round, court, _disputeID);
+
+        uint256 nbVotesAfterAppeal = disputeKits[newDisputeKitID].getNbVotesAfterAppeal(round.nbVotes);
+
+        if (courtJump) {
             // Jump to parent court.
             if (dispute.courtID == GENERAL_COURT) {
                 // TODO: Handle the forking when appealed in General court.
                 cost = NON_PAYABLE_AMOUNT; // Get the cost of the parent court.
             } else {
-                cost = courts[court.parent].feeForJuror * ((round.nbVotes * 2) + 1);
+                cost = courts[court.parent].feeForJuror * nbVotesAfterAppeal;
             }
         } else {
             // Stay in current court.
-            cost = court.feeForJuror * ((round.nbVotes * 2) + 1);
+            cost = court.feeForJuror * nbVotesAfterAppeal;
         }
     }
 
@@ -1033,7 +1031,7 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
         Round storage round = dispute.rounds[dispute.rounds.length - 1];
         Court storage court = courts[dispute.courtID];
 
-        if (round.nbVotes < court.jurorsForCourtJump) {
+        if (!_isCourtJumping(round, court, _disputeID)) {
             return false;
         }
 
@@ -1053,6 +1051,41 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
     // *            Internal               * //
     // ************************************* //
 
+    /// @dev Returns true if the round is jumping to a parent court.
+    /// @param _round The round to check.
+    /// @param _court The court to check.
+    /// @return Whether the round is jumping to a parent court or not.
+    function _isCourtJumping(
+        Round storage _round,
+        Court storage _court,
+        uint256 _disputeID
+    ) internal view returns (bool) {
+        return
+            disputeKits[_round.disputeKitID].earlyCourtJump(_disputeID) || _round.nbVotes >= _court.jurorsForCourtJump;
+    }
+
+    function _getCourtAndDisputeKitJumps(
+        Dispute storage _dispute,
+        Round storage _round,
+        Court storage _court,
+        uint256 _disputeID
+    ) internal view returns (uint96 newCourtID, uint256 newDisputeKitID, bool courtJump, bool disputeKitJump) {
+        newCourtID = _dispute.courtID;
+        newDisputeKitID = _round.disputeKitID;
+
+        if (!_isCourtJumping(_round, _court, _disputeID)) return (newCourtID, newDisputeKitID, false, false);
+
+        // Jump to parent court.
+        newCourtID = courts[newCourtID].parent;
+        courtJump = true;
+
+        if (!courts[newCourtID].supportedDisputeKits[newDisputeKitID]) {
+            // Switch to classic dispute kit if parent court doesn't support the current one.
+            newDisputeKitID = DISPUTE_KIT_CLASSIC;
+            disputeKitJump = true;
+        }
+    }
+
     /// @dev Internal function to transfer fee tokens (ETH or ERC20)
     /// @param _feeToken The token to transfer (NATIVE_CURRENCY for ETH).
     /// @param _recipient The recipient address.
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index 0922f047b..f3e3d00a0 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -627,6 +627,19 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
             ((appealPeriodEnd - appealPeriodStart) * LOSER_APPEAL_PERIOD_MULTIPLIER) / ONE_BASIS_POINT);
     }
 
+    /// @dev Returns true if the dispute is jumping to a parent court.
+    /// @return Whether the dispute is jumping to a parent court or not.
+    function earlyCourtJump(uint256 /* _coreDisputeID */) external pure override returns (bool) {
+        return false;
+    }
+
+    /// @dev Returns the number of votes after the appeal.
+    /// @param _currentNbVotes The number of votes before the appeal.
+    /// @return The number of votes after the appeal.
+    function getNbVotesAfterAppeal(uint256 _currentNbVotes) external pure override returns (uint256) {
+        return (_currentNbVotes * 2) + 1;
+    }
+
     /// @dev Returns true if the specified voter was active in this round.
     /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
     /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.
diff --git a/contracts/src/arbitration/interfaces/IDisputeKit.sol b/contracts/src/arbitration/interfaces/IDisputeKit.sol
index 6a72b35e4..b5e6f03a9 100644
--- a/contracts/src/arbitration/interfaces/IDisputeKit.sol
+++ b/contracts/src/arbitration/interfaces/IDisputeKit.sol
@@ -113,6 +113,16 @@ interface IDisputeKit {
     /// @return Whether the appeal funding is finished.
     function isAppealFunded(uint256 _coreDisputeID) external view returns (bool);
 
+    /// @dev Returns true if the dispute is jumping to a parent court.
+    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
+    /// @return Whether the dispute is jumping to a parent court or not.
+    function earlyCourtJump(uint256 _coreDisputeID) external view returns (bool);
+
+    /// @dev Returns the number of votes after the appeal.
+    /// @param _currentNbVotes The number of votes before the appeal.
+    /// @return The number of votes after the appeal.
+    function getNbVotesAfterAppeal(uint256 _currentNbVotes) external view returns (uint256);
+
     /// @dev Returns true if the specified voter was active in this round.
     /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
     /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.

From 42cc971d9542b07ed6c252157b48708b27fd82a7 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Tue, 26 Aug 2025 20:11:58 +0100
Subject: [PATCH 062/175] feat: added the current dispute kit as parameter to
 getNbVotesAfterAppeal()

---
 contracts/src/arbitration/KlerosCoreBase.sol                | 5 ++++-
 .../src/arbitration/dispute-kits/DisputeKitClassicBase.sol  | 5 ++++-
 contracts/src/arbitration/interfaces/IDisputeKit.sol        | 6 +++++-
 3 files changed, 13 insertions(+), 3 deletions(-)

diff --git a/contracts/src/arbitration/KlerosCoreBase.sol b/contracts/src/arbitration/KlerosCoreBase.sol
index abee79655..eb595096e 100644
--- a/contracts/src/arbitration/KlerosCoreBase.sol
+++ b/contracts/src/arbitration/KlerosCoreBase.sol
@@ -930,7 +930,10 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
 
         (, uint256 newDisputeKitID, bool courtJump, ) = _getCourtAndDisputeKitJumps(dispute, round, court, _disputeID);
 
-        uint256 nbVotesAfterAppeal = disputeKits[newDisputeKitID].getNbVotesAfterAppeal(round.nbVotes);
+        uint256 nbVotesAfterAppeal = disputeKits[newDisputeKitID].getNbVotesAfterAppeal(
+            disputeKits[round.disputeKitID],
+            round.nbVotes
+        );
 
         if (courtJump) {
             // Jump to parent court.
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index f3e3d00a0..a9e96f7eb 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -636,7 +636,10 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     /// @dev Returns the number of votes after the appeal.
     /// @param _currentNbVotes The number of votes before the appeal.
     /// @return The number of votes after the appeal.
-    function getNbVotesAfterAppeal(uint256 _currentNbVotes) external pure override returns (uint256) {
+    function getNbVotesAfterAppeal(
+        IDisputeKit /* _previousDisputeKit */,
+        uint256 _currentNbVotes
+    ) external pure override returns (uint256) {
         return (_currentNbVotes * 2) + 1;
     }
 
diff --git a/contracts/src/arbitration/interfaces/IDisputeKit.sol b/contracts/src/arbitration/interfaces/IDisputeKit.sol
index b5e6f03a9..0aab45b9c 100644
--- a/contracts/src/arbitration/interfaces/IDisputeKit.sol
+++ b/contracts/src/arbitration/interfaces/IDisputeKit.sol
@@ -119,9 +119,13 @@ interface IDisputeKit {
     function earlyCourtJump(uint256 _coreDisputeID) external view returns (bool);
 
     /// @dev Returns the number of votes after the appeal.
+    /// @param _previousDisputeKit The previous Dispute Kit.
     /// @param _currentNbVotes The number of votes before the appeal.
     /// @return The number of votes after the appeal.
-    function getNbVotesAfterAppeal(uint256 _currentNbVotes) external view returns (uint256);
+    function getNbVotesAfterAppeal(
+        IDisputeKit _previousDisputeKit,
+        uint256 _currentNbVotes
+    ) external view returns (uint256); // TODO: remove previousDisputeKit
 
     /// @dev Returns true if the specified voter was active in this round.
     /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.

From 057957e2f03744aed877244dd12834b5d659ea30 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 27 Aug 2025 03:47:19 +0100
Subject: [PATCH 063/175] chore: changelog

---
 contracts/CHANGELOG.md | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/contracts/CHANGELOG.md b/contracts/CHANGELOG.md
index bea677f34..751bd5473 100644
--- a/contracts/CHANGELOG.md
+++ b/contracts/CHANGELOG.md
@@ -23,6 +23,10 @@ The format is based on [Common Changelog](https://common-changelog.org/).
 - Bump `hardhat` to v2.26.2 ([#2069](https://github.com/kleros/kleros-v2/issues/2069))
 - Bump `@kleros/vea-contracts` to v0.7.0 ([#2073](https://github.com/kleros/kleros-v2/issues/2073))
 
+### Added
+
+- Allow the dispute kits to force an early court jump and to override the number of votes after an appeal (future-proofing) ([#2110](https://github.com/kleros/kleros-v2/issues/2110))
+
 ### Fixed
 
 - Do not pass to Voting period if all the commits are cast because it breaks the current Shutter auto-reveal process. ([#2085](https://github.com/kleros/kleros-v2/issues/2085))

From d0a9a808564effde2641e2c4f633dd3f8ec316d1 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 27 Aug 2025 04:50:55 +0100
Subject: [PATCH 064/175] refactor: adopt ERC-5313 by renaming governor to
 owner

---
 .../deploy/00-home-chain-arbitration-ruler.ts |   2 +-
 .../00-home-chain-arbitration-university.ts   |   2 +-
 contracts/hardhat.config.ts                   |   2 +-
 contracts/scripts/changeGovernor.ts           |  77 -----
 contracts/scripts/changeOwner.ts              |  77 +++++
 contracts/scripts/utils/execution.ts          |   6 +-
 contracts/scripts/utils/tx-builder.ts         |   6 +-
 contracts/scripts/viemTest.ts                 |   2 +-
 .../arbitration/DisputeTemplateRegistry.sol   |  28 +-
 contracts/src/arbitration/KlerosCore.sol      |  10 +-
 contracts/src/arbitration/KlerosCoreBase.sol  |  74 +++--
 contracts/src/arbitration/KlerosCoreNeo.sol   |  14 +-
 contracts/src/arbitration/KlerosGovernor.sol  |  18 +-
 contracts/src/arbitration/PolicyRegistry.sol  |  30 +-
 contracts/src/arbitration/SortitionModule.sol |  10 +-
 .../src/arbitration/SortitionModuleBase.sol   |  26 +-
 .../src/arbitration/SortitionModuleNeo.sol    |  14 +-
 .../arbitrables/ArbitrableExample.sol         |  18 +-
 .../arbitrables/DisputeResolver.sol           |  20 +-
 .../devtools/DisputeResolverRuler.sol         |   2 +-
 .../arbitration/devtools/KlerosCoreRuler.sol  |  45 ++-
 .../dispute-kits/DisputeKitClassic.sol        |  10 +-
 .../dispute-kits/DisputeKitClassicBase.sol    |  32 +-
 .../dispute-kits/DisputeKitGated.sol          |  10 +-
 .../dispute-kits/DisputeKitGatedShutter.sol   |  10 +-
 .../dispute-kits/DisputeKitShutter.sol        |  10 +-
 .../dispute-kits/DisputeKitSybilResistant.sol |  10 +-
 .../arbitration/evidence/EvidenceModule.sol   |  18 +-
 .../evidence/ModeratedEvidenceModule.sol      |  30 +-
 .../university/KlerosCoreUniversity.sol       |  78 +++--
 .../university/SortitionModuleUniversity.sol  |  16 +-
 .../view/KlerosCoreSnapshotProxy.sol          |  24 +-
 contracts/src/gateway/ForeignGateway.sol      |  34 +--
 contracts/src/gateway/HomeGateway.sol         |  36 +--
 .../kleros-v1/interfaces/IKlerosLiquid.sol    |   2 +-
 .../kleros-liquid-xdai/xKlerosLiquidV2.sol    |  55 ++--
 .../KlerosLiquidToV2Governor.sol              |  34 +--
 .../src/proxy/mock/UUPSUpgradeableMocks.sol   |   8 +-
 .../by-inheritance/UpgradedByInheritance.sol  |   8 +-
 .../mock/by-rewrite/UpgradedByRewrite.sol     |   8 +-
 .../mock/by-rewrite/UpgradedByRewriteV2.sol   |   4 +-
 contracts/src/rng/BlockhashRNG.sol            |  22 +-
 .../src/rng/ChainlinkConsumerBaseV2Plus.sol   | 169 +++++++++++
 contracts/src/rng/ChainlinkRNG.sol            |  34 +--
 contracts/src/rng/IRNG.sol                    |   2 +-
 contracts/src/rng/RNGWithFallback.sol         |  24 +-
 contracts/src/rng/RandomizerRNG.sol           |  30 +-
 contracts/src/token/Faucet.sol                |  18 +-
 contracts/test/arbitration/staking-neo.ts     |  10 +-
 contracts/test/evidence/index.ts              |  26 +-
 contracts/test/foundry/KlerosCore.t.sol       | 284 +++++++++---------
 contracts/test/proxy/index.ts                 |  16 +-
 contracts/test/rng/index.ts                   |   2 +-
 53 files changed, 848 insertions(+), 709 deletions(-)
 delete mode 100644 contracts/scripts/changeGovernor.ts
 create mode 100644 contracts/scripts/changeOwner.ts
 create mode 100644 contracts/src/rng/ChainlinkConsumerBaseV2Plus.sol

diff --git a/contracts/deploy/00-home-chain-arbitration-ruler.ts b/contracts/deploy/00-home-chain-arbitration-ruler.ts
index 5e6e5bdc7..a9077dbe6 100644
--- a/contracts/deploy/00-home-chain-arbitration-ruler.ts
+++ b/contracts/deploy/00-home-chain-arbitration-ruler.ts
@@ -29,7 +29,7 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
   await deployUpgradable(deployments, "KlerosCoreRuler", {
     from: deployer,
     args: [
-      deployer, // governor
+      deployer, // owner
       pnk.target,
       [minStake, alpha, feeForJuror, jurorsForCourtJump],
     ],
diff --git a/contracts/deploy/00-home-chain-arbitration-university.ts b/contracts/deploy/00-home-chain-arbitration-university.ts
index e3fce871e..2aa5f747b 100644
--- a/contracts/deploy/00-home-chain-arbitration-university.ts
+++ b/contracts/deploy/00-home-chain-arbitration-university.ts
@@ -50,7 +50,7 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
   const klerosCore = await deployUpgradable(deployments, "KlerosCoreUniversity", {
     from: deployer,
     args: [
-      deployer, // governor
+      deployer, // owner
       deployer, // instructor
       pnk.target,
       ZeroAddress, // KlerosCore is configured later
diff --git a/contracts/hardhat.config.ts b/contracts/hardhat.config.ts
index 3bb2787ca..d451ef05f 100644
--- a/contracts/hardhat.config.ts
+++ b/contracts/hardhat.config.ts
@@ -15,7 +15,7 @@ import "hardhat-contract-sizer";
 import "hardhat-tracer";
 require("./scripts/populatePolicyRegistry");
 require("./scripts/populateCourts");
-require("./scripts/changeGovernor");
+require("./scripts/changeOwner");
 require("./scripts/getDisputeTemplate");
 require("./scripts/compareStorageLayout");
 require("./scripts/storage-layout");
diff --git a/contracts/scripts/changeGovernor.ts b/contracts/scripts/changeGovernor.ts
deleted file mode 100644
index e9a9cd01c..000000000
--- a/contracts/scripts/changeGovernor.ts
+++ /dev/null
@@ -1,77 +0,0 @@
-import { task } from "hardhat/config";
-import { prompt, print } from "gluegun";
-import { Cores, getContracts } from "./utils/contracts";
-import { isAddress } from "viem";
-
-const { bold } = print.colors;
-
-task("change-governor", "Changes the governor for all the contracts")
-  .addPositionalParam("newGovernor", "The address of the new governor")
-  .addOptionalParam("coreType", "The type of core to use between base, neo, university (default: base)", Cores.BASE)
-  .setAction(async (taskArgs, hre) => {
-    const newGovernor = taskArgs.newGovernor;
-    if (!isAddress(newGovernor)) {
-      throw new Error("Invalid governor address provided");
-    }
-    print.highlight(`💣 Changing governor to ${bold(newGovernor)}`);
-
-    const { confirm } = await prompt.ask({
-      type: "confirm",
-      name: "confirm",
-      message: "Are you sure you want to proceed?",
-    });
-    if (!confirm) {
-      console.log("Operation cancelled by user.");
-      return;
-    }
-
-    const coreType = Cores[taskArgs.coreType.toUpperCase() as keyof typeof Cores];
-    if (coreType === undefined) {
-      console.error("Invalid core type, must be one of base, neo, university");
-      return;
-    }
-    console.log("Using core type %s", coreType);
-
-    const {
-      core,
-      disputeKitClassic,
-      disputeResolver,
-      disputeTemplateRegistry,
-      policyRegistry,
-      chainlinkRng,
-      randomizerRng,
-      snapshotProxy,
-      sortition,
-      evidence,
-    } = await getContracts(hre, coreType);
-
-    const updateGovernor = async (contractName: string, contractInstance: any) => {
-      print.info(`Changing governor for ${contractName}`);
-
-      const spinner = print.spin(`Executing transaction for ${contractName}...`);
-      try {
-        const tx = await contractInstance.changeGovernor(newGovernor);
-        await tx.wait();
-        spinner.succeed(`Governor changed for ${contractName}, tx hash: ${tx.hash}`);
-      } catch (error) {
-        if (error instanceof Error) {
-          spinner.fail(`Failed to change governor for ${contractName}: ${error.message}`);
-        } else {
-          spinner.fail(`Failed to change governor for ${contractName}: ${String(error)}`);
-        }
-      }
-    };
-
-    await updateGovernor("KlerosCore", core);
-    await updateGovernor("DisputeKitClassic", disputeKitClassic);
-    await updateGovernor("DisputeResolver", disputeResolver);
-    await updateGovernor("DisputeTemplateRegistry", disputeTemplateRegistry);
-    await updateGovernor("PolicyRegistry", policyRegistry);
-    await updateGovernor("KlerosCoreSnapshotProxy", snapshotProxy);
-    await updateGovernor("SortitionModule", sortition);
-    await updateGovernor("EvidenceModule", evidence);
-    if (chainlinkRng) await updateGovernor("ChainlinkRNG", chainlinkRng);
-    if (randomizerRng) await updateGovernor("RandomizerRNG", randomizerRng);
-
-    print.success("Governor changed successfully");
-  });
diff --git a/contracts/scripts/changeOwner.ts b/contracts/scripts/changeOwner.ts
new file mode 100644
index 000000000..72eeaeef7
--- /dev/null
+++ b/contracts/scripts/changeOwner.ts
@@ -0,0 +1,77 @@
+import { task } from "hardhat/config";
+import { prompt, print } from "gluegun";
+import { Cores, getContracts } from "./utils/contracts";
+import { isAddress } from "viem";
+
+const { bold } = print.colors;
+
+task("change-owner", "Changes the owner for all the contracts")
+  .addPositionalParam("newOwner", "The address of the new owner")
+  .addOptionalParam("coreType", "The type of core to use between base, neo, university (default: base)", Cores.BASE)
+  .setAction(async (taskArgs, hre) => {
+    const newOwner = taskArgs.newOwner;
+    if (!isAddress(newOwner)) {
+      throw new Error("Invalid owner address provided");
+    }
+    print.highlight(`💣 Changing owner to ${bold(newOwner)}`);
+
+    const { confirm } = await prompt.ask({
+      type: "confirm",
+      name: "confirm",
+      message: "Are you sure you want to proceed?",
+    });
+    if (!confirm) {
+      console.log("Operation cancelled by user.");
+      return;
+    }
+
+    const coreType = Cores[taskArgs.coreType.toUpperCase() as keyof typeof Cores];
+    if (coreType === undefined) {
+      console.error("Invalid core type, must be one of base, neo, university");
+      return;
+    }
+    console.log("Using core type %s", coreType);
+
+    const {
+      core,
+      disputeKitClassic,
+      disputeResolver,
+      disputeTemplateRegistry,
+      policyRegistry,
+      chainlinkRng,
+      randomizerRng,
+      snapshotProxy,
+      sortition,
+      evidence,
+    } = await getContracts(hre, coreType);
+
+    const updateOwner = async (contractName: string, contractInstance: any) => {
+      print.info(`Changing owner for ${contractName}`);
+
+      const spinner = print.spin(`Executing transaction for ${contractName}...`);
+      try {
+        const tx = await contractInstance.changeOwner(newOwner);
+        await tx.wait();
+        spinner.succeed(`Owner changed for ${contractName}, tx hash: ${tx.hash}`);
+      } catch (error) {
+        if (error instanceof Error) {
+          spinner.fail(`Failed to change owner for ${contractName}: ${error.message}`);
+        } else {
+          spinner.fail(`Failed to change owner for ${contractName}: ${String(error)}`);
+        }
+      }
+    };
+
+    await updateOwner("KlerosCore", core);
+    await updateOwner("DisputeKitClassic", disputeKitClassic);
+    await updateOwner("DisputeResolver", disputeResolver);
+    await updateOwner("DisputeTemplateRegistry", disputeTemplateRegistry);
+    await updateOwner("PolicyRegistry", policyRegistry);
+    await updateOwner("KlerosCoreSnapshotProxy", snapshotProxy);
+    await updateOwner("SortitionModule", sortition);
+    await updateOwner("EvidenceModule", evidence);
+    if (chainlinkRng) await updateOwner("ChainlinkRNG", chainlinkRng);
+    if (randomizerRng) await updateOwner("RandomizerRNG", randomizerRng);
+
+    print.success("Owner changed successfully");
+  });
diff --git a/contracts/scripts/utils/execution.ts b/contracts/scripts/utils/execution.ts
index f8fab0207..b35709d5d 100644
--- a/contracts/scripts/utils/execution.ts
+++ b/contracts/scripts/utils/execution.ts
@@ -5,7 +5,7 @@ import { type BuilderTransaction, template, transaction, transactionBuilderUrl }
 const governableAbi = [
   {
     inputs: [],
-    name: "governor",
+    name: "owner",
     outputs: [
       {
         internalType: "address",
@@ -25,8 +25,8 @@ export const execute = async (tx: ContractTransaction) => {
   const { ethers } = hre;
 
   const contract = await ethers.getContractAt(governableAbi, tx.to);
-  const governor = await contract.governor();
-  const isContract = (await ethers.provider.getCode(governor)).length > 2;
+  const owner = await contract.owner();
+  const isContract = (await ethers.provider.getCode(owner)).length > 2;
   if (isContract) {
     // Don't execute, just log the tx. It must be submitted for execution separately.
     const { to, value, data } = tx;
diff --git a/contracts/scripts/utils/tx-builder.ts b/contracts/scripts/utils/tx-builder.ts
index 06c7e65ab..fd0b52367 100644
--- a/contracts/scripts/utils/tx-builder.ts
+++ b/contracts/scripts/utils/tx-builder.ts
@@ -1,6 +1,6 @@
 import { arbitrum } from "viem/chains";
 
-const governor = "0x66e8DE9B42308c6Ca913D1EE041d6F6fD037A57e";
+const owner = "0x66e8DE9B42308c6Ca913D1EE041d6F6fD037A57e";
 const deployer = "0xf1C7c037891525E360C59f708739Ac09A7670c59";
 
 // Transaction batch example: https://github.com/safe-global/safe-wallet-monorepo/blob/8bbf3b82edc347b70a038629cd9afd45eb1ed38a/apps/web/cypress/fixtures/test-working-batch.json
@@ -12,7 +12,7 @@ export const template = ({ name, transactions }: { name: string; transactions: B
     name,
     description: "", // Not used because the Safe app doesn't show it
     txBuilderVersion: "1.18.0",
-    createdFromSafeAddress: governor,
+    createdFromSafeAddress: owner,
     createdFromOwnerAddress: deployer,
   },
   transactions,
@@ -42,4 +42,4 @@ export interface BuilderTransaction {
   contractInputsValues: null;
 }
 
-export const transactionBuilderUrl = `https://app.safe.global/apps/open?safe=arb1:${governor}&appUrl=https%3A%2F%2Fapps-portal.safe.global%2Ftx-builder`;
+export const transactionBuilderUrl = `https://app.safe.global/apps/open?safe=arb1:${owner}&appUrl=https%3A%2F%2Fapps-portal.safe.global%2Ftx-builder`;
diff --git a/contracts/scripts/viemTest.ts b/contracts/scripts/viemTest.ts
index bbd08d68f..0346ec900 100644
--- a/contracts/scripts/viemTest.ts
+++ b/contracts/scripts/viemTest.ts
@@ -15,7 +15,7 @@ const main = async () => {
     client: client,
   });
 
-  await disputeKit.read.governor().then(console.log);
+  await disputeKit.read.owner().then(console.log);
 
   // --------------------------------------------------
 
diff --git a/contracts/src/arbitration/DisputeTemplateRegistry.sol b/contracts/src/arbitration/DisputeTemplateRegistry.sol
index e63d7c297..b9354aa0a 100644
--- a/contracts/src/arbitration/DisputeTemplateRegistry.sol
+++ b/contracts/src/arbitration/DisputeTemplateRegistry.sol
@@ -14,8 +14,8 @@ contract DisputeTemplateRegistry is IDisputeTemplateRegistry, UUPSProxiable, Ini
     // *             Storage               * //
     // ************************************* //
 
-    /// @dev The governor of the contract.
-    address public governor;
+    /// @dev The owner of the contract.
+    address public owner;
 
     /// @dev The number of templates.
     uint256 public templates;
@@ -24,8 +24,8 @@ contract DisputeTemplateRegistry is IDisputeTemplateRegistry, UUPSProxiable, Ini
     // *        Function Modifiers         * //
     // ************************************* //
 
-    modifier onlyByGovernor() {
-        if (governor != msg.sender) revert GovernorOnly();
+    modifier onlyByOwner() {
+        if (owner != msg.sender) revert OwnerOnly();
         _;
     }
 
@@ -39,9 +39,9 @@ contract DisputeTemplateRegistry is IDisputeTemplateRegistry, UUPSProxiable, Ini
     }
 
     /// @dev Initializer
-    /// @param _governor Governor of the contract.
-    function initialize(address _governor) external reinitializer(1) {
-        governor = _governor;
+    /// @param _owner Owner of the contract.
+    function initialize(address _owner) external reinitializer(1) {
+        owner = _owner;
     }
 
     function initialize2() external reinitializer(2) {
@@ -53,15 +53,15 @@ contract DisputeTemplateRegistry is IDisputeTemplateRegistry, UUPSProxiable, Ini
     // ************************ //
 
     /// @dev Access Control to perform implementation upgrades (UUPS Proxiable)
-    ///      Only the governor can perform upgrades (`onlyByGovernor`)
-    function _authorizeUpgrade(address) internal view override onlyByGovernor {
+    ///      Only the owner can perform upgrades (`onlyByOwner`)
+    function _authorizeUpgrade(address) internal view override onlyByOwner {
         // NOP
     }
 
-    /// @dev Changes the governor of the contract.
-    /// @param _governor The new governor.
-    function changeGovernor(address _governor) external onlyByGovernor {
-        governor = _governor;
+    /// @dev Changes the owner of the contract.
+    /// @param _owner The new owner.
+    function changeOwner(address _owner) external onlyByOwner {
+        owner = _owner;
     }
 
     // ************************************* //
@@ -85,5 +85,5 @@ contract DisputeTemplateRegistry is IDisputeTemplateRegistry, UUPSProxiable, Ini
     // *              Errors               * //
     // ************************************* //
 
-    error GovernorOnly();
+    error OwnerOnly();
 }
diff --git a/contracts/src/arbitration/KlerosCore.sol b/contracts/src/arbitration/KlerosCore.sol
index 3853c6b47..912a57269 100644
--- a/contracts/src/arbitration/KlerosCore.sol
+++ b/contracts/src/arbitration/KlerosCore.sol
@@ -20,7 +20,7 @@ contract KlerosCore is KlerosCoreBase {
     }
 
     /// @dev Initializer (constructor equivalent for upgradable contracts).
-    /// @param _governor The governor's address.
+    /// @param _owner The owner's address.
     /// @param _guardian The guardian's address.
     /// @param _pinakion The address of the token contract.
     /// @param _jurorProsecutionModule The address of the juror prosecution module.
@@ -32,7 +32,7 @@ contract KlerosCore is KlerosCoreBase {
     /// @param _sortitionModuleAddress The sortition module responsible for sortition of the jurors.
     /// @param _wNative The wrapped native token address, typically wETH.
     function initialize(
-        address _governor,
+        address _owner,
         address _guardian,
         IERC20 _pinakion,
         address _jurorProsecutionModule,
@@ -45,7 +45,7 @@ contract KlerosCore is KlerosCoreBase {
         address _wNative
     ) external reinitializer(1) {
         __KlerosCoreBase_initialize(
-            _governor,
+            _owner,
             _guardian,
             _pinakion,
             _jurorProsecutionModule,
@@ -68,8 +68,8 @@ contract KlerosCore is KlerosCoreBase {
     // ************************************* //
 
     /// @dev Access Control to perform implementation upgrades (UUPS Proxiable)
-    ///      Only the governor can perform upgrades (`onlyByGovernor`)
-    function _authorizeUpgrade(address) internal view override onlyByGovernor {
+    ///      Only the owner can perform upgrades (`onlyByOwner`)
+    function _authorizeUpgrade(address) internal view override onlyByOwner {
         // NOP
     }
 }
diff --git a/contracts/src/arbitration/KlerosCoreBase.sol b/contracts/src/arbitration/KlerosCoreBase.sol
index eb595096e..0a9946bbc 100644
--- a/contracts/src/arbitration/KlerosCoreBase.sol
+++ b/contracts/src/arbitration/KlerosCoreBase.sol
@@ -90,7 +90,7 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
 
     uint256 private constant NON_PAYABLE_AMOUNT = (2 ** 256 - 2) / 2; // An amount higher than the supply of ETH.
 
-    address public governor; // The governor of the contract.
+    address public owner; // The owner of the contract.
     address public guardian; // The guardian able to pause asset withdrawals.
     IERC20 public pinakion; // The Pinakion token contract.
     address public jurorProsecutionModule; // The module for juror's prosecution.
@@ -167,13 +167,13 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
     // *        Function Modifiers         * //
     // ************************************* //
 
-    modifier onlyByGovernor() {
-        if (governor != msg.sender) revert GovernorOnly();
+    modifier onlyByOwner() {
+        if (owner != msg.sender) revert OwnerOnly();
         _;
     }
 
-    modifier onlyByGuardianOrGovernor() {
-        if (guardian != msg.sender && governor != msg.sender) revert GuardianOrGovernorOnly();
+    modifier onlyByGuardianOrOwner() {
+        if (guardian != msg.sender && owner != msg.sender) revert GuardianOrOwnerOnly();
         _;
     }
 
@@ -192,7 +192,7 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
     // ************************************* //
 
     function __KlerosCoreBase_initialize(
-        address _governor,
+        address _owner,
         address _guardian,
         IERC20 _pinakion,
         address _jurorProsecutionModule,
@@ -204,7 +204,7 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
         ISortitionModule _sortitionModuleAddress,
         address _wNative
     ) internal onlyInitializing {
-        governor = _governor;
+        owner = _owner;
         guardian = _guardian;
         pinakion = _pinakion;
         jurorProsecutionModule = _jurorProsecutionModule;
@@ -257,65 +257,61 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
     // *             Governance            * //
     // ************************************* //
 
-    /// @dev Pause staking and reward execution. Can only be done by guardian or governor.
-    function pause() external onlyByGuardianOrGovernor whenNotPaused {
+    /// @dev Pause staking and reward execution. Can only be done by guardian or owner.
+    function pause() external onlyByGuardianOrOwner whenNotPaused {
         paused = true;
         emit Paused();
     }
 
-    /// @dev Unpause staking and reward execution. Can only be done by governor.
-    function unpause() external onlyByGovernor whenPaused {
+    /// @dev Unpause staking and reward execution. Can only be done by owner.
+    function unpause() external onlyByOwner whenPaused {
         paused = false;
         emit Unpaused();
     }
 
-    /// @dev Allows the governor to call anything on behalf of the contract.
+    /// @dev Allows the owner to call anything on behalf of the contract.
     /// @param _destination The destination of the call.
     /// @param _amount The value sent with the call.
     /// @param _data The data sent with the call.
-    function executeGovernorProposal(
-        address _destination,
-        uint256 _amount,
-        bytes memory _data
-    ) external onlyByGovernor {
+    function executeOwnerProposal(address _destination, uint256 _amount, bytes memory _data) external onlyByOwner {
         (bool success, ) = _destination.call{value: _amount}(_data);
         if (!success) revert UnsuccessfulCall();
     }
 
-    /// @dev Changes the `governor` storage variable.
-    /// @param _governor The new value for the `governor` storage variable.
-    function changeGovernor(address payable _governor) external onlyByGovernor {
-        governor = _governor;
+    /// @dev Changes the `owner` storage variable.
+    /// @param _owner The new value for the `owner` storage variable.
+    function changeOwner(address payable _owner) external onlyByOwner {
+        owner = _owner;
     }
 
     /// @dev Changes the `guardian` storage variable.
     /// @param _guardian The new value for the `guardian` storage variable.
-    function changeGuardian(address _guardian) external onlyByGovernor {
+    function changeGuardian(address _guardian) external onlyByOwner {
         guardian = _guardian;
     }
 
     /// @dev Changes the `pinakion` storage variable.
     /// @param _pinakion The new value for the `pinakion` storage variable.
-    function changePinakion(IERC20 _pinakion) external onlyByGovernor {
+    function changePinakion(IERC20 _pinakion) external onlyByOwner {
         pinakion = _pinakion;
     }
 
     /// @dev Changes the `jurorProsecutionModule` storage variable.
     /// @param _jurorProsecutionModule The new value for the `jurorProsecutionModule` storage variable.
-    function changeJurorProsecutionModule(address _jurorProsecutionModule) external onlyByGovernor {
+    function changeJurorProsecutionModule(address _jurorProsecutionModule) external onlyByOwner {
         jurorProsecutionModule = _jurorProsecutionModule;
     }
 
     /// @dev Changes the `_sortitionModule` storage variable.
     /// Note that the new module should be initialized for all courts.
     /// @param _sortitionModule The new value for the `sortitionModule` storage variable.
-    function changeSortitionModule(ISortitionModule _sortitionModule) external onlyByGovernor {
+    function changeSortitionModule(ISortitionModule _sortitionModule) external onlyByOwner {
         sortitionModule = _sortitionModule;
     }
 
     /// @dev Add a new supported dispute kit module to the court.
     /// @param _disputeKitAddress The address of the dispute kit contract.
-    function addNewDisputeKit(IDisputeKit _disputeKitAddress) external onlyByGovernor {
+    function addNewDisputeKit(IDisputeKit _disputeKitAddress) external onlyByOwner {
         uint256 disputeKitID = disputeKits.length;
         disputeKits.push(_disputeKitAddress);
         emit DisputeKitCreated(disputeKitID, _disputeKitAddress);
@@ -341,7 +337,7 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
         uint256[4] memory _timesPerPeriod,
         bytes memory _sortitionExtraData,
         uint256[] memory _supportedDisputeKits
-    ) external onlyByGovernor {
+    ) external onlyByOwner {
         if (courts[_parent].minStake > _minStake) revert MinStakeLowerThanParentCourt();
         if (_supportedDisputeKits.length == 0) revert UnsupportedDisputeKit();
         if (_parent == FORKING_COURT) revert InvalidForkingCourtAsParent();
@@ -392,7 +388,7 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
         uint256 _feeForJuror,
         uint256 _jurorsForCourtJump,
         uint256[4] memory _timesPerPeriod
-    ) external onlyByGovernor {
+    ) external onlyByOwner {
         Court storage court = courts[_courtID];
         if (_courtID != GENERAL_COURT && courts[court.parent].minStake > _minStake) {
             revert MinStakeLowerThanParentCourt();
@@ -423,7 +419,7 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
     /// @param _courtID The ID of the court.
     /// @param _disputeKitIDs The IDs of dispute kits which support should be added/removed.
     /// @param _enable Whether add or remove the dispute kits from the court.
-    function enableDisputeKits(uint96 _courtID, uint256[] memory _disputeKitIDs, bool _enable) external onlyByGovernor {
+    function enableDisputeKits(uint96 _courtID, uint256[] memory _disputeKitIDs, bool _enable) external onlyByOwner {
         for (uint256 i = 0; i < _disputeKitIDs.length; i++) {
             if (_enable) {
                 if (_disputeKitIDs[i] == 0 || _disputeKitIDs[i] >= disputeKits.length) {
@@ -443,7 +439,7 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
     /// @dev Changes the supported fee tokens.
     /// @param _feeToken The fee token.
     /// @param _accepted Whether the token is supported or not as a method of fee payment.
-    function changeAcceptedFeeTokens(IERC20 _feeToken, bool _accepted) external onlyByGovernor {
+    function changeAcceptedFeeTokens(IERC20 _feeToken, bool _accepted) external onlyByOwner {
         currencyRates[_feeToken].feePaymentAccepted = _accepted;
         emit AcceptedFeeToken(_feeToken, _accepted);
     }
@@ -452,7 +448,7 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
     /// @param _feeToken The fee token.
     /// @param _rateInEth The new rate of the fee token in ETH.
     /// @param _rateDecimals The new decimals of the fee token rate.
-    function changeCurrencyRates(IERC20 _feeToken, uint64 _rateInEth, uint8 _rateDecimals) external onlyByGovernor {
+    function changeCurrencyRates(IERC20 _feeToken, uint64 _rateInEth, uint8 _rateDecimals) external onlyByOwner {
         currencyRates[_feeToken].rateInEth = _rateInEth;
         currencyRates[_feeToken].rateDecimals = _rateDecimals;
         emit NewCurrencyRate(_feeToken, _rateInEth, _rateDecimals);
@@ -795,9 +791,9 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
             sortitionModule.setJurorInactive(account);
         }
         if (_params.repartition == _params.numberOfVotesInRound - 1 && _params.coherentCount == 0) {
-            // No one was coherent, send the rewards to the governor.
-            _transferFeeToken(round.feeToken, payable(governor), round.totalFeesForJurors);
-            pinakion.safeTransfer(governor, _params.pnkPenaltiesInRound);
+            // No one was coherent, send the rewards to the owner.
+            _transferFeeToken(round.feeToken, payable(owner), round.totalFeesForJurors);
+            pinakion.safeTransfer(owner, _params.pnkPenaltiesInRound);
             emit LeftoverRewardSent(
                 _params.disputeID,
                 _params.round,
@@ -863,16 +859,16 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
             round.feeToken
         );
 
-        // Transfer any residual rewards to the governor. It may happen due to partial coherence of the jurors.
+        // Transfer any residual rewards to the owner. It may happen due to partial coherence of the jurors.
         if (_params.repartition == _params.numberOfVotesInRound * 2 - 1) {
             uint256 leftoverPnkReward = _params.pnkPenaltiesInRound - round.sumPnkRewardPaid;
             uint256 leftoverFeeReward = round.totalFeesForJurors - round.sumFeeRewardPaid;
             if (leftoverPnkReward != 0 || leftoverFeeReward != 0) {
                 if (leftoverPnkReward != 0) {
-                    pinakion.safeTransfer(governor, leftoverPnkReward);
+                    pinakion.safeTransfer(owner, leftoverPnkReward);
                 }
                 if (leftoverFeeReward != 0) {
-                    _transferFeeToken(round.feeToken, payable(governor), leftoverFeeReward);
+                    _transferFeeToken(round.feeToken, payable(owner), leftoverFeeReward);
                 }
                 emit LeftoverRewardSent(
                     _params.disputeID,
@@ -1217,8 +1213,8 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
     // *              Errors               * //
     // ************************************* //
 
-    error GovernorOnly();
-    error GuardianOrGovernorOnly();
+    error OwnerOnly();
+    error GuardianOrOwnerOnly();
     error DisputeKitOnly();
     error SortitionModuleOnly();
     error UnsuccessfulCall();
diff --git a/contracts/src/arbitration/KlerosCoreNeo.sol b/contracts/src/arbitration/KlerosCoreNeo.sol
index 1d09c2964..a72319fc5 100644
--- a/contracts/src/arbitration/KlerosCoreNeo.sol
+++ b/contracts/src/arbitration/KlerosCoreNeo.sol
@@ -28,7 +28,7 @@ contract KlerosCoreNeo is KlerosCoreBase {
     }
 
     /// @dev Initializer (constructor equivalent for upgradable contracts).
-    /// @param _governor The governor's address.
+    /// @param _owner The owner's address.
     /// @param _guardian The guardian's address.
     /// @param _pinakion The address of the token contract.
     /// @param _jurorProsecutionModule The address of the juror prosecution module.
@@ -41,7 +41,7 @@ contract KlerosCoreNeo is KlerosCoreBase {
     /// @param _jurorNft NFT contract to vet the jurors.
     /// @param _wNative The wrapped native token address, typically wETH.
     function initialize(
-        address _governor,
+        address _owner,
         address _guardian,
         IERC20 _pinakion,
         address _jurorProsecutionModule,
@@ -55,7 +55,7 @@ contract KlerosCoreNeo is KlerosCoreBase {
         address _wNative
     ) external reinitializer(2) {
         __KlerosCoreBase_initialize(
-            _governor,
+            _owner,
             _guardian,
             _pinakion,
             _jurorProsecutionModule,
@@ -79,21 +79,21 @@ contract KlerosCoreNeo is KlerosCoreBase {
     // ************************************* //
 
     /// @dev Access Control to perform implementation upgrades (UUPS Proxiable)
-    ///      Only the governor can perform upgrades (`onlyByGovernor`)
-    function _authorizeUpgrade(address) internal view override onlyByGovernor {
+    ///      Only the owner can perform upgrades (`onlyByOwner`)
+    function _authorizeUpgrade(address) internal view override onlyByOwner {
         // NOP
     }
 
     /// @dev Changes the `jurorNft` storage variable.
     /// @param _jurorNft The new value for the `jurorNft` storage variable.
-    function changeJurorNft(IERC721 _jurorNft) external onlyByGovernor {
+    function changeJurorNft(IERC721 _jurorNft) external onlyByOwner {
         jurorNft = _jurorNft;
     }
 
     /// @dev Adds or removes an arbitrable from whitelist.
     /// @param _arbitrable Arbitrable address.
     /// @param _allowed Whether add or remove permission.
-    function changeArbitrableWhitelist(address _arbitrable, bool _allowed) external onlyByGovernor {
+    function changeArbitrableWhitelist(address _arbitrable, bool _allowed) external onlyByOwner {
         arbitrableWhitelist[_arbitrable] = _allowed;
     }
 
diff --git a/contracts/src/arbitration/KlerosGovernor.sol b/contracts/src/arbitration/KlerosGovernor.sol
index a0a23061e..11957a745 100644
--- a/contracts/src/arbitration/KlerosGovernor.sol
+++ b/contracts/src/arbitration/KlerosGovernor.sol
@@ -80,8 +80,8 @@ contract KlerosGovernor is IArbitrableV2 {
         _;
     }
 
-    modifier onlyByGovernor() {
-        if (address(this) != msg.sender) revert GovernorOnly();
+    modifier onlyByOwner() {
+        if (address(this) != msg.sender) revert OwnerOnly();
         _;
     }
 
@@ -147,26 +147,26 @@ contract KlerosGovernor is IArbitrableV2 {
 
     /// @dev Changes the value of the base deposit required for submitting a list.
     /// @param _submissionBaseDeposit The new value of the base deposit, in wei.
-    function changeSubmissionDeposit(uint256 _submissionBaseDeposit) external onlyByGovernor {
+    function changeSubmissionDeposit(uint256 _submissionBaseDeposit) external onlyByOwner {
         submissionBaseDeposit = _submissionBaseDeposit;
     }
 
     /// @dev Changes the time allocated for submission. Note that it can't be changed during approval period because there can be an active dispute in the old arbitrator contract
     /// and prolonging submission timeout might switch it back to submission period.
     /// @param _submissionTimeout The new duration of the submission period, in seconds.
-    function changeSubmissionTimeout(uint256 _submissionTimeout) external onlyByGovernor duringSubmissionPeriod {
+    function changeSubmissionTimeout(uint256 _submissionTimeout) external onlyByOwner duringSubmissionPeriod {
         submissionTimeout = _submissionTimeout;
     }
 
     /// @dev Changes the time allocated for list's execution.
     /// @param _executionTimeout The new duration of the execution timeout, in seconds.
-    function changeExecutionTimeout(uint256 _executionTimeout) external onlyByGovernor {
+    function changeExecutionTimeout(uint256 _executionTimeout) external onlyByOwner {
         executionTimeout = _executionTimeout;
     }
 
     /// @dev Changes list withdrawal timeout. Note that withdrawals are only possible in the first half of the submission period.
     /// @param _withdrawTimeout The new duration of withdraw period, in seconds.
-    function changeWithdrawTimeout(uint256 _withdrawTimeout) external onlyByGovernor {
+    function changeWithdrawTimeout(uint256 _withdrawTimeout) external onlyByOwner {
         withdrawTimeout = _withdrawTimeout;
     }
 
@@ -176,7 +176,7 @@ contract KlerosGovernor is IArbitrableV2 {
     function changeArbitrator(
         IArbitratorV2 _arbitrator,
         bytes memory _arbitratorExtraData
-    ) external onlyByGovernor duringSubmissionPeriod {
+    ) external onlyByOwner duringSubmissionPeriod {
         arbitrator = _arbitrator;
         arbitratorExtraData = _arbitratorExtraData;
     }
@@ -187,7 +187,7 @@ contract KlerosGovernor is IArbitrableV2 {
     function changeDisputeTemplate(
         string memory _templateData,
         string memory _templateDataMappings
-    ) external onlyByGovernor {
+    ) external onlyByOwner {
         templateId = templateRegistry.setDisputeTemplate("", _templateData, _templateDataMappings);
     }
 
@@ -414,7 +414,7 @@ contract KlerosGovernor is IArbitrableV2 {
 
     error SubmissionTimeHasEnded();
     error ApprovalTimeNotStarted();
-    error GovernorOnly();
+    error OwnerOnly();
     error WrongInputTargetAndValue();
     error WrongInputTargetAndDatasize();
     error InsufficientDeposit();
diff --git a/contracts/src/arbitration/PolicyRegistry.sol b/contracts/src/arbitration/PolicyRegistry.sol
index f4ed36322..acea8d01b 100644
--- a/contracts/src/arbitration/PolicyRegistry.sol
+++ b/contracts/src/arbitration/PolicyRegistry.sol
@@ -23,16 +23,16 @@ contract PolicyRegistry is UUPSProxiable, Initializable {
     // *             Storage               * //
     // ************************************* //
 
-    address public governor;
+    address public owner;
     mapping(uint256 => string) public policies;
 
     // ************************************* //
     // *        Function Modifiers         * //
     // ************************************* //
 
-    /// @dev Requires that the sender is the governor.
-    modifier onlyByGovernor() {
-        if (governor != msg.sender) revert GovernorOnly();
+    /// @dev Requires that the sender is the owner.
+    modifier onlyByOwner() {
+        if (owner != msg.sender) revert OwnerOnly();
         _;
     }
 
@@ -46,9 +46,9 @@ contract PolicyRegistry is UUPSProxiable, Initializable {
     }
 
     /// @dev Constructs the `PolicyRegistry` contract.
-    /// @param _governor The governor's address.
-    function initialize(address _governor) external reinitializer(1) {
-        governor = _governor;
+    /// @param _owner The owner's address.
+    function initialize(address _owner) external reinitializer(1) {
+        owner = _owner;
     }
 
     function initialize2() external reinitializer(2) {
@@ -61,16 +61,16 @@ contract PolicyRegistry is UUPSProxiable, Initializable {
 
     /**
      * @dev Access Control to perform implementation upgrades (UUPS Proxiable)
-     * @dev Only the governor can perform upgrades (`onlyByGovernor`)
+     * @dev Only the owner can perform upgrades (`onlyByOwner`)
      */
-    function _authorizeUpgrade(address) internal view override onlyByGovernor {
+    function _authorizeUpgrade(address) internal view override onlyByOwner {
         // NOP
     }
 
-    /// @dev Changes the `governor` storage variable.
-    /// @param _governor The new value for the `governor` storage variable.
-    function changeGovernor(address _governor) external onlyByGovernor {
-        governor = _governor;
+    /// @dev Changes the `owner` storage variable.
+    /// @param _owner The new value for the `owner` storage variable.
+    function changeOwner(address _owner) external onlyByOwner {
+        owner = _owner;
     }
 
     // ************************************* //
@@ -81,7 +81,7 @@ contract PolicyRegistry is UUPSProxiable, Initializable {
     /// @param _courtID The ID of the specified court.
     /// @param _courtName The name of the specified court.
     /// @param _policy The URI of the policy JSON.
-    function setPolicy(uint256 _courtID, string calldata _courtName, string calldata _policy) external onlyByGovernor {
+    function setPolicy(uint256 _courtID, string calldata _courtName, string calldata _policy) external onlyByOwner {
         policies[_courtID] = _policy;
         emit PolicyUpdate(_courtID, _courtName, policies[_courtID]);
     }
@@ -90,5 +90,5 @@ contract PolicyRegistry is UUPSProxiable, Initializable {
     // *              Errors               * //
     // ************************************* //
 
-    error GovernorOnly();
+    error OwnerOnly();
 }
diff --git a/contracts/src/arbitration/SortitionModule.sol b/contracts/src/arbitration/SortitionModule.sol
index 7e881264b..ae89335b0 100644
--- a/contracts/src/arbitration/SortitionModule.sol
+++ b/contracts/src/arbitration/SortitionModule.sol
@@ -19,19 +19,19 @@ contract SortitionModule is SortitionModuleBase {
     }
 
     /// @dev Initializer (constructor equivalent for upgradable contracts).
-    /// @param _governor The governor.
+    /// @param _owner The owner.
     /// @param _core The KlerosCore.
     /// @param _minStakingTime Minimal time to stake
     /// @param _maxDrawingTime Time after which the drawing phase can be switched
     /// @param _rng The random number generator.
     function initialize(
-        address _governor,
+        address _owner,
         KlerosCore _core,
         uint256 _minStakingTime,
         uint256 _maxDrawingTime,
         IRNG _rng
     ) external reinitializer(1) {
-        __SortitionModuleBase_initialize(_governor, _core, _minStakingTime, _maxDrawingTime, _rng);
+        __SortitionModuleBase_initialize(_owner, _core, _minStakingTime, _maxDrawingTime, _rng);
     }
 
     function initialize4() external reinitializer(4) {
@@ -43,8 +43,8 @@ contract SortitionModule is SortitionModuleBase {
     // ************************************* //
 
     /// @dev Access Control to perform implementation upgrades (UUPS Proxiable)
-    ///      Only the governor can perform upgrades (`onlyByGovernor`)
-    function _authorizeUpgrade(address) internal view virtual override onlyByGovernor {
+    ///      Only the owner can perform upgrades (`onlyByOwner`)
+    function _authorizeUpgrade(address) internal view virtual override onlyByOwner {
         // NOP
     }
 }
diff --git a/contracts/src/arbitration/SortitionModuleBase.sol b/contracts/src/arbitration/SortitionModuleBase.sol
index af4eb6631..ae749fb85 100644
--- a/contracts/src/arbitration/SortitionModuleBase.sol
+++ b/contracts/src/arbitration/SortitionModuleBase.sol
@@ -44,7 +44,7 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
     // *             Storage               * //
     // ************************************* //
 
-    address public governor; // The governor of the contract.
+    address public owner; // The owner of the contract.
     KlerosCore public core; // The core arbitrator contract.
     Phase public phase; // The current phase.
     uint256 public minStakingTime; // The time after which the phase can be switched to Drawing if there are open disputes.
@@ -100,13 +100,13 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
     // ************************************* //
 
     function __SortitionModuleBase_initialize(
-        address _governor,
+        address _owner,
         KlerosCore _core,
         uint256 _minStakingTime,
         uint256 _maxDrawingTime,
         IRNG _rng
     ) internal onlyInitializing {
-        governor = _governor;
+        owner = _owner;
         core = _core;
         minStakingTime = _minStakingTime;
         maxDrawingTime = _maxDrawingTime;
@@ -119,8 +119,8 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
     // *        Function Modifiers         * //
     // ************************************* //
 
-    modifier onlyByGovernor() {
-        if (governor != msg.sender) revert GovernorOnly();
+    modifier onlyByOwner() {
+        if (owner != msg.sender) revert OwnerOnly();
         _;
     }
 
@@ -133,27 +133,27 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
     // *             Governance            * //
     // ************************************* //
 
-    /// @dev Changes the governor of the contract.
-    /// @param _governor The new governor.
-    function changeGovernor(address _governor) external onlyByGovernor {
-        governor = _governor;
+    /// @dev Changes the owner of the contract.
+    /// @param _owner The new owner.
+    function changeOwner(address _owner) external onlyByOwner {
+        owner = _owner;
     }
 
     /// @dev Changes the `minStakingTime` storage variable.
     /// @param _minStakingTime The new value for the `minStakingTime` storage variable.
-    function changeMinStakingTime(uint256 _minStakingTime) external onlyByGovernor {
+    function changeMinStakingTime(uint256 _minStakingTime) external onlyByOwner {
         minStakingTime = _minStakingTime;
     }
 
     /// @dev Changes the `maxDrawingTime` storage variable.
     /// @param _maxDrawingTime The new value for the `maxDrawingTime` storage variable.
-    function changeMaxDrawingTime(uint256 _maxDrawingTime) external onlyByGovernor {
+    function changeMaxDrawingTime(uint256 _maxDrawingTime) external onlyByOwner {
         maxDrawingTime = _maxDrawingTime;
     }
 
     /// @dev Changes the `rng` storage variable.
     /// @param _rng The new random number generator.
-    function changeRandomNumberGenerator(IRNG _rng) external onlyByGovernor {
+    function changeRandomNumberGenerator(IRNG _rng) external onlyByOwner {
         rng = _rng;
         if (phase == Phase.generating) {
             rng.requestRandomness();
@@ -711,7 +711,7 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
     // *              Errors               * //
     // ************************************* //
 
-    error GovernorOnly();
+    error OwnerOnly();
     error KlerosCoreOnly();
     error MinStakingTimeNotPassed();
     error NoDisputesThatNeedJurors();
diff --git a/contracts/src/arbitration/SortitionModuleNeo.sol b/contracts/src/arbitration/SortitionModuleNeo.sol
index 9758882fe..d106d5d9b 100644
--- a/contracts/src/arbitration/SortitionModuleNeo.sol
+++ b/contracts/src/arbitration/SortitionModuleNeo.sol
@@ -27,7 +27,7 @@ contract SortitionModuleNeo is SortitionModuleBase {
     }
 
     /// @dev Initializer (constructor equivalent for upgradable contracts).
-    /// @param _governor The governor.
+    /// @param _owner The owner.
     /// @param _core The KlerosCore.
     /// @param _minStakingTime Minimal time to stake
     /// @param _maxDrawingTime Time after which the drawing phase can be switched
@@ -35,7 +35,7 @@ contract SortitionModuleNeo is SortitionModuleBase {
     /// @param _maxStakePerJuror The maximum amount of PNK a juror can stake in a court.
     /// @param _maxTotalStaked The maximum amount of PNK that can be staked in all courts.
     function initialize(
-        address _governor,
+        address _owner,
         KlerosCore _core,
         uint256 _minStakingTime,
         uint256 _maxDrawingTime,
@@ -43,7 +43,7 @@ contract SortitionModuleNeo is SortitionModuleBase {
         uint256 _maxStakePerJuror,
         uint256 _maxTotalStaked
     ) external reinitializer(2) {
-        __SortitionModuleBase_initialize(_governor, _core, _minStakingTime, _maxDrawingTime, _rng);
+        __SortitionModuleBase_initialize(_owner, _core, _minStakingTime, _maxDrawingTime, _rng);
         maxStakePerJuror = _maxStakePerJuror;
         maxTotalStaked = _maxTotalStaked;
     }
@@ -57,16 +57,16 @@ contract SortitionModuleNeo is SortitionModuleBase {
     // ************************************* //
 
     /// @dev Access Control to perform implementation upgrades (UUPS Proxiable)
-    ///      Only the governor can perform upgrades (`onlyByGovernor`)
-    function _authorizeUpgrade(address) internal view override onlyByGovernor {
+    ///      Only the owner can perform upgrades (`onlyByOwner`)
+    function _authorizeUpgrade(address) internal view override onlyByOwner {
         // NOP
     }
 
-    function changeMaxStakePerJuror(uint256 _maxStakePerJuror) external onlyByGovernor {
+    function changeMaxStakePerJuror(uint256 _maxStakePerJuror) external onlyByOwner {
         maxStakePerJuror = _maxStakePerJuror;
     }
 
-    function changeMaxTotalStaked(uint256 _maxTotalStaked) external onlyByGovernor {
+    function changeMaxTotalStaked(uint256 _maxTotalStaked) external onlyByOwner {
         maxTotalStaked = _maxTotalStaked;
     }
 
diff --git a/contracts/src/arbitration/arbitrables/ArbitrableExample.sol b/contracts/src/arbitration/arbitrables/ArbitrableExample.sol
index b7596566e..4dd60cb82 100644
--- a/contracts/src/arbitration/arbitrables/ArbitrableExample.sol
+++ b/contracts/src/arbitration/arbitrables/ArbitrableExample.sol
@@ -23,7 +23,7 @@ contract ArbitrableExample is IArbitrableV2 {
 
     event Action(string indexed _action);
 
-    address public immutable governor;
+    address public immutable owner;
     IArbitratorV2 public arbitrator; // Arbitrator is set in constructor.
     IDisputeTemplateRegistry public templateRegistry; // The dispute template registry.
     uint256 public templateId; // The current dispute template identifier.
@@ -36,8 +36,8 @@ contract ArbitrableExample is IArbitrableV2 {
     // *        Function Modifiers         * //
     // ************************************* //
 
-    modifier onlyByGovernor() {
-        if (governor != msg.sender) revert GovernorOnly();
+    modifier onlyByOwner() {
+        if (owner != msg.sender) revert OwnerOnly();
         _;
     }
 
@@ -60,7 +60,7 @@ contract ArbitrableExample is IArbitrableV2 {
         IDisputeTemplateRegistry _templateRegistry,
         IERC20 _weth
     ) {
-        governor = msg.sender;
+        owner = msg.sender;
         arbitrator = _arbitrator;
         arbitratorExtraData = _arbitratorExtraData;
         templateRegistry = _templateRegistry;
@@ -73,22 +73,22 @@ contract ArbitrableExample is IArbitrableV2 {
     // *             Governance            * //
     // ************************************* //
 
-    function changeArbitrator(IArbitratorV2 _arbitrator) external onlyByGovernor {
+    function changeArbitrator(IArbitratorV2 _arbitrator) external onlyByOwner {
         arbitrator = _arbitrator;
     }
 
-    function changeArbitratorExtraData(bytes calldata _arbitratorExtraData) external onlyByGovernor {
+    function changeArbitratorExtraData(bytes calldata _arbitratorExtraData) external onlyByOwner {
         arbitratorExtraData = _arbitratorExtraData;
     }
 
-    function changeTemplateRegistry(IDisputeTemplateRegistry _templateRegistry) external onlyByGovernor {
+    function changeTemplateRegistry(IDisputeTemplateRegistry _templateRegistry) external onlyByOwner {
         templateRegistry = _templateRegistry;
     }
 
     function changeDisputeTemplate(
         string memory _templateData,
         string memory _templateDataMappings
-    ) external onlyByGovernor {
+    ) external onlyByOwner {
         templateId = templateRegistry.setDisputeTemplate("", _templateData, _templateDataMappings);
     }
 
@@ -156,7 +156,7 @@ contract ArbitrableExample is IArbitrableV2 {
     // *              Errors               * //
     // ************************************* //
 
-    error GovernorOnly();
+    error OwnerOnly();
     error TransferFailed();
     error AllowanceIncreaseFailed();
     error ArbitratorOnly();
diff --git a/contracts/src/arbitration/arbitrables/DisputeResolver.sol b/contracts/src/arbitration/arbitrables/DisputeResolver.sol
index 7248356cd..949d282b2 100644
--- a/contracts/src/arbitration/arbitrables/DisputeResolver.sol
+++ b/contracts/src/arbitration/arbitrables/DisputeResolver.sol
@@ -23,7 +23,7 @@ contract DisputeResolver is IArbitrableV2 {
     // *             Storage               * //
     // ************************************* //
 
-    address public governor; // The governor.
+    address public owner; // The owner.
     IArbitratorV2 public arbitrator; // The arbitrator.
     IDisputeTemplateRegistry public templateRegistry; // The dispute template registry.
     DisputeStruct[] public disputes; // Local disputes.
@@ -36,7 +36,7 @@ contract DisputeResolver is IArbitrableV2 {
     /// @dev Constructor
     /// @param _arbitrator Target global arbitrator for any disputes.
     constructor(IArbitratorV2 _arbitrator, IDisputeTemplateRegistry _templateRegistry) {
-        governor = msg.sender;
+        owner = msg.sender;
         arbitrator = _arbitrator;
         templateRegistry = _templateRegistry;
     }
@@ -45,20 +45,20 @@ contract DisputeResolver is IArbitrableV2 {
     // *           Governance              * //
     // ************************************* //
 
-    /// @dev Changes the governor.
-    /// @param _governor The address of the new governor.
-    function changeGovernor(address _governor) external {
-        if (governor != msg.sender) revert GovernorOnly();
-        governor = _governor;
+    /// @dev Changes the owner.
+    /// @param _owner The address of the new owner.
+    function changeOwner(address _owner) external {
+        if (owner != msg.sender) revert OwnerOnly();
+        owner = _owner;
     }
 
     function changeArbitrator(IArbitratorV2 _arbitrator) external {
-        if (governor != msg.sender) revert GovernorOnly();
+        if (owner != msg.sender) revert OwnerOnly();
         arbitrator = _arbitrator;
     }
 
     function changeTemplateRegistry(IDisputeTemplateRegistry _templateRegistry) external {
-        if (governor != msg.sender) revert GovernorOnly();
+        if (owner != msg.sender) revert OwnerOnly();
         templateRegistry = _templateRegistry;
     }
 
@@ -151,7 +151,7 @@ contract DisputeResolver is IArbitrableV2 {
     // *              Errors               * //
     // ************************************* //
 
-    error GovernorOnly();
+    error OwnerOnly();
     error ArbitratorOnly();
     error RulingOutOfBounds();
     error DisputeAlreadyRuled();
diff --git a/contracts/src/arbitration/devtools/DisputeResolverRuler.sol b/contracts/src/arbitration/devtools/DisputeResolverRuler.sol
index 05c033c38..eed2c8092 100644
--- a/contracts/src/arbitration/devtools/DisputeResolverRuler.sol
+++ b/contracts/src/arbitration/devtools/DisputeResolverRuler.sol
@@ -22,7 +22,7 @@ contract DisputeResolverRuler is DisputeResolver {
         IArbitratorV2 _arbitrator,
         IDisputeTemplateRegistry _templateRegistry
     ) DisputeResolver(_arbitrator, _templateRegistry) {
-        governor = msg.sender;
+        owner = msg.sender;
     }
 
     // ************************************* //
diff --git a/contracts/src/arbitration/devtools/KlerosCoreRuler.sol b/contracts/src/arbitration/devtools/KlerosCoreRuler.sol
index 2382970cf..9350ebd57 100644
--- a/contracts/src/arbitration/devtools/KlerosCoreRuler.sol
+++ b/contracts/src/arbitration/devtools/KlerosCoreRuler.sol
@@ -85,7 +85,7 @@ contract KlerosCoreRuler is IArbitratorV2, UUPSProxiable, Initializable {
 
     uint256 private constant NON_PAYABLE_AMOUNT = (2 ** 256 - 2) / 2; // An amount higher than the supply of ETH.
 
-    address public governor; // The governor of the contract.
+    address public owner; // The owner of the contract.
     IERC20 public pinakion; // The Pinakion token contract.
     Court[] public courts; // The courts.
     Dispute[] public disputes; // The disputes.
@@ -157,8 +157,8 @@ contract KlerosCoreRuler is IArbitratorV2, UUPSProxiable, Initializable {
     // *        Function Modifiers         * //
     // ************************************* //
 
-    modifier onlyByGovernor() {
-        if (governor != msg.sender) revert GovernorOnly();
+    modifier onlyByOwner() {
+        if (owner != msg.sender) revert OwnerOnly();
         _;
     }
 
@@ -172,15 +172,15 @@ contract KlerosCoreRuler is IArbitratorV2, UUPSProxiable, Initializable {
     }
 
     /// @dev Initializer (constructor equivalent for upgradable contracts).
-    /// @param _governor The governor's address.
+    /// @param _owner The owner's address.
     /// @param _pinakion The address of the token contract.
     /// @param _courtParameters Numeric parameters of General court (minStake, alpha, feeForJuror and jurorsForCourtJump respectively).
     function initialize(
-        address _governor,
+        address _owner,
         IERC20 _pinakion,
         uint256[4] memory _courtParameters
     ) external reinitializer(1) {
-        governor = _governor;
+        owner = _owner;
         pinakion = _pinakion;
 
         // FORKING_COURT
@@ -219,34 +219,30 @@ contract KlerosCoreRuler is IArbitratorV2, UUPSProxiable, Initializable {
     // ************************************* //
 
     /* @dev Access Control to perform implementation upgrades (UUPS Proxiable)
-     * @dev Only the governor can perform upgrades (`onlyByGovernor`)
+     * @dev Only the owner can perform upgrades (`onlyByOwner`)
      */
-    function _authorizeUpgrade(address) internal view override onlyByGovernor {
+    function _authorizeUpgrade(address) internal view override onlyByOwner {
         // NOP
     }
 
-    /// @dev Allows the governor to call anything on behalf of the contract.
+    /// @dev Allows the owner to call anything on behalf of the contract.
     /// @param _destination The destination of the call.
     /// @param _amount The value sent with the call.
     /// @param _data The data sent with the call.
-    function executeGovernorProposal(
-        address _destination,
-        uint256 _amount,
-        bytes memory _data
-    ) external onlyByGovernor {
+    function executeOwnerProposal(address _destination, uint256 _amount, bytes memory _data) external onlyByOwner {
         (bool success, ) = _destination.call{value: _amount}(_data);
         if (!success) revert UnsuccessfulCall();
     }
 
-    /// @dev Changes the `governor` storage variable.
-    /// @param _governor The new value for the `governor` storage variable.
-    function changeGovernor(address payable _governor) external onlyByGovernor {
-        governor = _governor;
+    /// @dev Changes the `owner` storage variable.
+    /// @param _owner The new value for the `owner` storage variable.
+    function changeOwner(address payable _owner) external onlyByOwner {
+        owner = _owner;
     }
 
     /// @dev Changes the `pinakion` storage variable.
     /// @param _pinakion The new value for the `pinakion` storage variable.
-    function changePinakion(IERC20 _pinakion) external onlyByGovernor {
+    function changePinakion(IERC20 _pinakion) external onlyByOwner {
         pinakion = _pinakion;
     }
 
@@ -266,7 +262,7 @@ contract KlerosCoreRuler is IArbitratorV2, UUPSProxiable, Initializable {
         uint256 _feeForJuror,
         uint256 _jurorsForCourtJump,
         uint256[4] memory _timesPerPeriod
-    ) external onlyByGovernor {
+    ) external onlyByOwner {
         if (_parent == FORKING_COURT) revert InvalidForkingCourtAsParent();
 
         uint256 courtID = courts.length;
@@ -303,7 +299,7 @@ contract KlerosCoreRuler is IArbitratorV2, UUPSProxiable, Initializable {
         uint256 _feeForJuror,
         uint256 _jurorsForCourtJump,
         uint256[4] memory _timesPerPeriod
-    ) external onlyByGovernor {
+    ) external onlyByOwner {
         Court storage court = courts[_courtID];
         court.minStake = _minStake;
         court.hiddenVotes = _hiddenVotes;
@@ -325,7 +321,7 @@ contract KlerosCoreRuler is IArbitratorV2, UUPSProxiable, Initializable {
     /// @dev Changes the supported fee tokens.
     /// @param _feeToken The fee token.
     /// @param _accepted Whether the token is supported or not as a method of fee payment.
-    function changeAcceptedFeeTokens(IERC20 _feeToken, bool _accepted) external onlyByGovernor {
+    function changeAcceptedFeeTokens(IERC20 _feeToken, bool _accepted) external onlyByOwner {
         currencyRates[_feeToken].feePaymentAccepted = _accepted;
         emit AcceptedFeeToken(_feeToken, _accepted);
     }
@@ -334,7 +330,7 @@ contract KlerosCoreRuler is IArbitratorV2, UUPSProxiable, Initializable {
     /// @param _feeToken The fee token.
     /// @param _rateInEth The new rate of the fee token in ETH.
     /// @param _rateDecimals The new decimals of the fee token rate.
-    function changeCurrencyRates(IERC20 _feeToken, uint64 _rateInEth, uint8 _rateDecimals) external onlyByGovernor {
+    function changeCurrencyRates(IERC20 _feeToken, uint64 _rateInEth, uint8 _rateDecimals) external onlyByOwner {
         currencyRates[_feeToken].rateInEth = _rateInEth;
         currencyRates[_feeToken].rateDecimals = _rateDecimals;
         emit NewCurrencyRate(_feeToken, _rateInEth, _rateDecimals);
@@ -675,8 +671,7 @@ contract KlerosCoreRuler is IArbitratorV2, UUPSProxiable, Initializable {
     // *              Errors               * //
     // ************************************* //
 
-    error GovernorOnly();
-    error GovernorOrInstructorOnly();
+    error OwnerOnly();
     error RulerOnly();
     error NoRulerSet();
     error RulingModeNotSet();
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassic.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassic.sol
index 2479ab07d..ce5932c92 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassic.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassic.sol
@@ -23,11 +23,11 @@ contract DisputeKitClassic is DisputeKitClassicBase {
     }
 
     /// @dev Initializer.
-    /// @param _governor The governor's address.
+    /// @param _owner The owner's address.
     /// @param _core The KlerosCore arbitrator.
     /// @param _wNative The wrapped native token address, typically wETH.
-    function initialize(address _governor, KlerosCore _core, address _wNative) external reinitializer(1) {
-        __DisputeKitClassicBase_initialize(_governor, _core, _wNative);
+    function initialize(address _owner, KlerosCore _core, address _wNative) external reinitializer(1) {
+        __DisputeKitClassicBase_initialize(_owner, _core, _wNative);
     }
 
     function reinitialize(address _wNative) external reinitializer(9) {
@@ -39,8 +39,8 @@ contract DisputeKitClassic is DisputeKitClassicBase {
     // ************************ //
 
     /// @dev Access Control to perform implementation upgrades (UUPS Proxiable)
-    ///      Only the governor can perform upgrades (`onlyByGovernor`)
-    function _authorizeUpgrade(address) internal view override onlyByGovernor {
+    ///      Only the owner can perform upgrades (`onlyByOwner`)
+    function _authorizeUpgrade(address) internal view override onlyByOwner {
         // NOP
     }
 }
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index a9e96f7eb..f2d7a154c 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -59,7 +59,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     uint256 public constant LOSER_STAKE_MULTIPLIER = 20000; // Multiplier of the appeal cost that the loser has to pay as fee stake for a round in basis points. Default is 2x of appeal fee.
     uint256 public constant LOSER_APPEAL_PERIOD_MULTIPLIER = 5000; // Multiplier of the appeal period for the choice that wasn't voted for in the previous round, in basis points. Default is 1/2 of original appeal period.
 
-    address public governor; // The governor of the contract.
+    address public owner; // The owner of the contract.
     KlerosCore public core; // The Kleros Core arbitrator
     Dispute[] public disputes; // Array of the locally created disputes.
     mapping(uint256 => uint256) public coreDisputeIDToLocal; // Maps the dispute ID in Kleros Core to the local dispute ID.
@@ -124,8 +124,8 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     // *              Modifiers            * //
     // ************************************* //
 
-    modifier onlyByGovernor() {
-        if (governor != msg.sender) revert GovernorOnly();
+    modifier onlyByOwner() {
+        if (owner != msg.sender) revert OwnerOnly();
         _;
     }
 
@@ -144,15 +144,15 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     // ************************************* //
 
     /// @dev Initializer.
-    /// @param _governor The governor's address.
+    /// @param _owner The owner's address.
     /// @param _core The KlerosCore arbitrator.
     /// @param _wNative The wrapped native token address, typically wETH.
     function __DisputeKitClassicBase_initialize(
-        address _governor,
+        address _owner,
         KlerosCore _core,
         address _wNative
     ) internal onlyInitializing {
-        governor = _governor;
+        owner = _owner;
         core = _core;
         wNative = _wNative;
     }
@@ -161,28 +161,24 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     // *      Governance      * //
     // ************************ //
 
-    /// @dev Allows the governor to call anything on behalf of the contract.
+    /// @dev Allows the owner to call anything on behalf of the contract.
     /// @param _destination The destination of the call.
     /// @param _amount The value sent with the call.
     /// @param _data The data sent with the call.
-    function executeGovernorProposal(
-        address _destination,
-        uint256 _amount,
-        bytes memory _data
-    ) external onlyByGovernor {
+    function executeOwnerProposal(address _destination, uint256 _amount, bytes memory _data) external onlyByOwner {
         (bool success, ) = _destination.call{value: _amount}(_data);
         if (!success) revert UnsuccessfulCall();
     }
 
-    /// @dev Changes the `governor` storage variable.
-    /// @param _governor The new value for the `governor` storage variable.
-    function changeGovernor(address payable _governor) external onlyByGovernor {
-        governor = _governor;
+    /// @dev Changes the `owner` storage variable.
+    /// @param _owner The new value for the `owner` storage variable.
+    function changeOwner(address payable _owner) external onlyByOwner {
+        owner = _owner;
     }
 
     /// @dev Changes the `core` storage variable.
     /// @param _core The new value for the `core` storage variable.
-    function changeCore(address _core) external onlyByGovernor {
+    function changeCore(address _core) external onlyByOwner {
         core = KlerosCore(_core);
     }
 
@@ -755,7 +751,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     // *              Errors               * //
     // ************************************* //
 
-    error GovernorOnly();
+    error OwnerOnly();
     error KlerosCoreOnly();
     error DisputeJumpedToParentDK();
     error UnsuccessfulCall();
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol b/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol
index 037f79585..c0e70f741 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol
@@ -39,11 +39,11 @@ contract DisputeKitGated is DisputeKitClassicBase {
     }
 
     /// @dev Initializer.
-    /// @param _governor The governor's address.
+    /// @param _owner The owner's address.
     /// @param _core The KlerosCore arbitrator.
     /// @param _wNative The wrapped native token address, typically wETH.
-    function initialize(address _governor, KlerosCore _core, address _wNative) external reinitializer(1) {
-        __DisputeKitClassicBase_initialize(_governor, _core, _wNative);
+    function initialize(address _owner, KlerosCore _core, address _wNative) external reinitializer(1) {
+        __DisputeKitClassicBase_initialize(_owner, _core, _wNative);
     }
 
     function reinitialize(address _wNative) external reinitializer(9) {
@@ -55,8 +55,8 @@ contract DisputeKitGated is DisputeKitClassicBase {
     // ************************ //
 
     /// @dev Access Control to perform implementation upgrades (UUPS Proxiable)
-    ///      Only the governor can perform upgrades (`onlyByGovernor`)
-    function _authorizeUpgrade(address) internal view override onlyByGovernor {
+    ///      Only the owner can perform upgrades (`onlyByOwner`)
+    function _authorizeUpgrade(address) internal view override onlyByOwner {
         // NOP
     }
 
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
index 3ad37d56d..c5de2483b 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
@@ -58,11 +58,11 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
     }
 
     /// @dev Initializer.
-    /// @param _governor The governor's address.
+    /// @param _owner The owner's address.
     /// @param _core The KlerosCore arbitrator.
     /// @param _wNative The wrapped native token address, typically wETH.
-    function initialize(address _governor, KlerosCore _core, address _wNative) external reinitializer(1) {
-        __DisputeKitClassicBase_initialize(_governor, _core, _wNative);
+    function initialize(address _owner, KlerosCore _core, address _wNative) external reinitializer(1) {
+        __DisputeKitClassicBase_initialize(_owner, _core, _wNative);
     }
 
     function reinitialize(address _wNative) external reinitializer(9) {
@@ -74,8 +74,8 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
     // ************************ //
 
     /// @dev Access Control to perform implementation upgrades (UUPS Proxiable)
-    ///      Only the governor can perform upgrades (`onlyByGovernor`)
-    function _authorizeUpgrade(address) internal view override onlyByGovernor {
+    ///      Only the owner can perform upgrades (`onlyByOwner`)
+    function _authorizeUpgrade(address) internal view override onlyByOwner {
         // NOP
     }
 
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol b/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
index 057a06921..886f5dbec 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
@@ -42,11 +42,11 @@ contract DisputeKitShutter is DisputeKitClassicBase {
     }
 
     /// @dev Initializer.
-    /// @param _governor The governor's address.
+    /// @param _owner The owner's address.
     /// @param _core The KlerosCore arbitrator.
     /// @param _wNative The wrapped native token address, typically wETH.
-    function initialize(address _governor, KlerosCore _core, address _wNative) external reinitializer(1) {
-        __DisputeKitClassicBase_initialize(_governor, _core, _wNative);
+    function initialize(address _owner, KlerosCore _core, address _wNative) external reinitializer(1) {
+        __DisputeKitClassicBase_initialize(_owner, _core, _wNative);
     }
 
     function reinitialize(address _wNative) external reinitializer(9) {
@@ -58,8 +58,8 @@ contract DisputeKitShutter is DisputeKitClassicBase {
     // ************************ //
 
     /// @dev Access Control to perform implementation upgrades (UUPS Proxiable)
-    ///      Only the governor can perform upgrades (`onlyByGovernor`)
-    function _authorizeUpgrade(address) internal view override onlyByGovernor {
+    ///      Only the owner can perform upgrades (`onlyByOwner`)
+    function _authorizeUpgrade(address) internal view override onlyByOwner {
         // NOP
     }
 
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitSybilResistant.sol b/contracts/src/arbitration/dispute-kits/DisputeKitSybilResistant.sol
index 8568c55af..e213f6d11 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitSybilResistant.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitSybilResistant.sol
@@ -36,17 +36,17 @@ contract DisputeKitSybilResistant is DisputeKitClassicBase {
     }
 
     /// @dev Initializer.
-    /// @param _governor The governor's address.
+    /// @param _owner The owner's address.
     /// @param _core The KlerosCore arbitrator.
     /// @param _poh The Proof of Humanity registry.
     /// @param _wNative The wrapped native token address, typically wETH.
     function initialize(
-        address _governor,
+        address _owner,
         KlerosCore _core,
         IProofOfHumanity _poh,
         address _wNative
     ) external reinitializer(1) {
-        __DisputeKitClassicBase_initialize(_governor, _core, _wNative);
+        __DisputeKitClassicBase_initialize(_owner, _core, _wNative);
         poh = _poh;
         singleDrawPerJuror = true;
     }
@@ -56,8 +56,8 @@ contract DisputeKitSybilResistant is DisputeKitClassicBase {
     // ************************ //
 
     /// @dev Access Control to perform implementation upgrades (UUPS Proxiable)
-    ///      Only the governor can perform upgrades (`onlyByGovernor`)
-    function _authorizeUpgrade(address) internal view override onlyByGovernor {
+    ///      Only the owner can perform upgrades (`onlyByOwner`)
+    function _authorizeUpgrade(address) internal view override onlyByOwner {
         // NOP
     }
 
diff --git a/contracts/src/arbitration/evidence/EvidenceModule.sol b/contracts/src/arbitration/evidence/EvidenceModule.sol
index 4967597ab..d1eb5f99c 100644
--- a/contracts/src/arbitration/evidence/EvidenceModule.sol
+++ b/contracts/src/arbitration/evidence/EvidenceModule.sol
@@ -15,14 +15,14 @@ contract EvidenceModule is IEvidence, Initializable, UUPSProxiable {
     // *             Storage               * //
     // ************************************* //
 
-    address public governor; // The governor of the contract.
+    address public owner; // The owner of the contract.
 
     // ************************************* //
     // *              Modifiers            * //
     // ************************************* //
 
-    modifier onlyByGovernor() {
-        if (governor != msg.sender) revert GovernorOnly();
+    modifier onlyByOwner() {
+        if (owner != msg.sender) revert OwnerOnly();
         _;
     }
 
@@ -36,9 +36,9 @@ contract EvidenceModule is IEvidence, Initializable, UUPSProxiable {
     }
 
     /// @dev Initializer.
-    /// @param _governor The governor's address.
-    function initialize(address _governor) external reinitializer(1) {
-        governor = _governor;
+    /// @param _owner The owner's address.
+    function initialize(address _owner) external reinitializer(1) {
+        owner = _owner;
     }
 
     function initialize2() external reinitializer(2) {
@@ -51,9 +51,9 @@ contract EvidenceModule is IEvidence, Initializable, UUPSProxiable {
 
     /**
      * @dev Access Control to perform implementation upgrades (UUPS Proxiable)
-     * @dev Only the governor can perform upgrades (`onlyByGovernor`)
+     * @dev Only the owner can perform upgrades (`onlyByOwner`)
      */
-    function _authorizeUpgrade(address) internal view override onlyByGovernor {
+    function _authorizeUpgrade(address) internal view override onlyByOwner {
         // NOP
     }
 
@@ -72,5 +72,5 @@ contract EvidenceModule is IEvidence, Initializable, UUPSProxiable {
     // *              Errors               * //
     // ************************************* //
 
-    error GovernorOnly();
+    error OwnerOnly();
 }
diff --git a/contracts/src/arbitration/evidence/ModeratedEvidenceModule.sol b/contracts/src/arbitration/evidence/ModeratedEvidenceModule.sol
index 1c612265f..b2b64a4d3 100644
--- a/contracts/src/arbitration/evidence/ModeratedEvidenceModule.sol
+++ b/contracts/src/arbitration/evidence/ModeratedEvidenceModule.sol
@@ -51,7 +51,7 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
     mapping(uint256 => bytes32) public disputeIDtoEvidenceID; // One-to-one relationship between the dispute and the evidence.
     ArbitratorData[] public arbitratorDataList; // Stores the arbitrator data of the contract. Updated each time the data is changed.
     IArbitratorV2 public immutable arbitrator; // The trusted arbitrator to resolve potential disputes. If it needs to be changed, a new contract can be deployed.
-    address public governor; // The address that can make governance changes to the parameters of the contract.
+    address public owner; // The address that can make governance changes to the parameters of the contract.
     IDisputeTemplateRegistry public templateRegistry; // The dispute template registry.
     uint256 public bondTimeout; // The time in seconds during which the last moderation status can be challenged.
     uint256 public totalCostMultiplier; // Multiplier of arbitration fees that must be ultimately paid as fee stake. In basis points.
@@ -61,8 +61,8 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
     // *        Function Modifiers         * //
     // ************************************* //
 
-    modifier onlyGovernor() {
-        require(msg.sender == governor, "The caller must be the governor");
+    modifier onlyOwner() {
+        require(msg.sender == owner, "The caller must be the owner");
         _;
     }
 
@@ -93,7 +93,7 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
 
     /// @dev Constructor.
     /// @param _arbitrator The trusted arbitrator to resolve potential disputes.
-    /// @param _governor The trusted governor of the contract.
+    /// @param _owner The trusted owner of the contract.
     /// @param _totalCostMultiplier Multiplier of arbitration fees that must be ultimately paid as fee stake. In basis points.
     /// @param _initialDepositMultiplier Multiplier of arbitration fees that must be paid as initial stake for submitting evidence. In basis points.
     /// @param _bondTimeout The time in seconds during which the last moderation status can be challenged.
@@ -102,7 +102,7 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
     /// @param _templateDataMappings The dispute template data mappings.
     constructor(
         IArbitratorV2 _arbitrator,
-        address _governor,
+        address _owner,
         IDisputeTemplateRegistry _templateRegistry,
         uint256 _totalCostMultiplier,
         uint256 _initialDepositMultiplier,
@@ -112,7 +112,7 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
         string memory _templateDataMappings
     ) {
         arbitrator = _arbitrator;
-        governor = _governor;
+        owner = _owner;
         templateRegistry = _templateRegistry;
 
         totalCostMultiplier = _totalCostMultiplier; // For example 15000, which would provide a 100% reward to the dispute winner.
@@ -132,28 +132,28 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
     // *             Governance            * //
     // ************************************* //
 
-    /// @dev Change the governor of the contract.
-    /// @param _governor The address of the new governor.
-    function changeGovernor(address _governor) external onlyGovernor {
-        governor = _governor;
+    /// @dev Change the owner of the contract.
+    /// @param _owner The address of the new owner.
+    function changeOwner(address _owner) external onlyOwner {
+        owner = _owner;
     }
 
     /// @dev Change the proportion of arbitration fees that must be paid as fee stake by parties when there is no winner or loser (e.g. when the arbitrator refused to rule).
     /// @param _initialDepositMultiplier Multiplier of arbitration fees that must be paid as fee stake. In basis points.
-    function changeInitialDepositMultiplier(uint256 _initialDepositMultiplier) external onlyGovernor {
+    function changeInitialDepositMultiplier(uint256 _initialDepositMultiplier) external onlyOwner {
         initialDepositMultiplier = _initialDepositMultiplier;
     }
 
     /// @dev Change the proportion of arbitration fees that must be paid as fee stake by the winner of the previous round.
     /// @param _totalCostMultiplier Multiplier of arbitration fees that must be paid as fee stake. In basis points.
-    function changeTotalCostMultiplier(uint256 _totalCostMultiplier) external onlyGovernor {
+    function changeTotalCostMultiplier(uint256 _totalCostMultiplier) external onlyOwner {
         totalCostMultiplier = _totalCostMultiplier;
     }
 
     /// @dev Change the time window within which evidence submissions and removals can be contested.
     /// Ongoing moderations will start using the latest bondTimeout available after calling moderate() again.
     /// @param _bondTimeout Multiplier of arbitration fees that must be paid as fee stake. In basis points.
-    function changeBondTimeout(uint256 _bondTimeout) external onlyGovernor {
+    function changeBondTimeout(uint256 _bondTimeout) external onlyOwner {
         bondTimeout = _bondTimeout;
     }
 
@@ -162,7 +162,7 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
     function changeDisputeTemplate(
         string calldata _templateData,
         string memory _templateDataMappings
-    ) external onlyGovernor {
+    ) external onlyOwner {
         ArbitratorData storage arbitratorData = arbitratorDataList[arbitratorDataList.length - 1];
         uint256 newDisputeTemplateId = templateRegistry.setDisputeTemplate("", _templateData, _templateDataMappings);
         arbitratorDataList.push(
@@ -175,7 +175,7 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
 
     /// @dev Change the arbitrator to be used for disputes that may be raised in the next requests. The arbitrator is trusted to support appeal period and not reenter.
     /// @param _arbitratorExtraData The extra data used by the new arbitrator.
-    function changeArbitratorExtraData(bytes calldata _arbitratorExtraData) external onlyGovernor {
+    function changeArbitratorExtraData(bytes calldata _arbitratorExtraData) external onlyOwner {
         ArbitratorData storage arbitratorData = arbitratorDataList[arbitratorDataList.length - 1];
         arbitratorDataList.push(
             ArbitratorData({
diff --git a/contracts/src/arbitration/university/KlerosCoreUniversity.sol b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
index 0cd11b2f1..d6366753a 100644
--- a/contracts/src/arbitration/university/KlerosCoreUniversity.sol
+++ b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
@@ -89,7 +89,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
 
     uint256 private constant NON_PAYABLE_AMOUNT = (2 ** 256 - 2) / 2; // An amount higher than the supply of ETH.
 
-    address public governor; // The governor of the contract.
+    address public owner; // The owner of the contract.
     address public instructor; // The instructor who is allowed to choose the jurors.
     IERC20 public pinakion; // The Pinakion token contract.
     address public jurorProsecutionModule; // The module for juror's prosecution.
@@ -162,8 +162,8 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
     // *        Function Modifiers         * //
     // ************************************* //
 
-    modifier onlyByGovernor() {
-        if (governor != msg.sender) revert GovernorOnly();
+    modifier onlyByOwner() {
+        if (owner != msg.sender) revert OwnerOnly();
         _;
     }
 
@@ -172,8 +172,8 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         _;
     }
 
-    modifier onlyByGovernorOrInstructor() {
-        if (msg.sender != governor && msg.sender != instructor) revert GovernorOrInstructorOnly();
+    modifier onlyByOwnerOrInstructor() {
+        if (msg.sender != owner && msg.sender != instructor) revert OwnerOrInstructorOnly();
         _;
     }
 
@@ -187,7 +187,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
     }
 
     /// @dev Initializer (constructor equivalent for upgradable contracts).
-    /// @param _governor The governor's address.
+    /// @param _owner The owner's address.
     /// @param _instructor The address of the instructor.
     /// @param _pinakion The address of the token contract.
     /// @param _jurorProsecutionModule The address of the juror prosecution module.
@@ -197,7 +197,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
     /// @param _timesPerPeriod The `timesPerPeriod` property value of the general court.
     /// @param _sortitionModuleAddress The sortition module responsible for sortition of the jurors.
     function initialize(
-        address _governor,
+        address _owner,
         address _instructor,
         IERC20 _pinakion,
         address _jurorProsecutionModule,
@@ -207,7 +207,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         uint256[4] memory _timesPerPeriod,
         ISortitionModuleUniversity _sortitionModuleAddress
     ) external reinitializer(1) {
-        governor = _governor;
+        owner = _owner;
         instructor = _instructor;
         pinakion = _pinakion;
         jurorProsecutionModule = _jurorProsecutionModule;
@@ -255,59 +255,55 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
     // ************************************* //
 
     /* @dev Access Control to perform implementation upgrades (UUPS Proxiable)
-     * @dev Only the governor can perform upgrades (`onlyByGovernor`)
+     * @dev Only the owner can perform upgrades (`onlyByOwner`)
      */
-    function _authorizeUpgrade(address) internal view override onlyByGovernor {
+    function _authorizeUpgrade(address) internal view override onlyByOwner {
         // NOP
     }
 
-    /// @dev Allows the governor to call anything on behalf of the contract.
+    /// @dev Allows the owner to call anything on behalf of the contract.
     /// @param _destination The destination of the call.
     /// @param _amount The value sent with the call.
     /// @param _data The data sent with the call.
-    function executeGovernorProposal(
-        address _destination,
-        uint256 _amount,
-        bytes memory _data
-    ) external onlyByGovernor {
+    function executeOwnerProposal(address _destination, uint256 _amount, bytes memory _data) external onlyByOwner {
         (bool success, ) = _destination.call{value: _amount}(_data);
         if (!success) revert UnsuccessfulCall();
     }
 
-    /// @dev Changes the `governor` storage variable.
-    /// @param _governor The new value for the `governor` storage variable.
-    function changeGovernor(address payable _governor) external onlyByGovernor {
-        governor = _governor;
+    /// @dev Changes the `owner` storage variable.
+    /// @param _owner The new value for the `owner` storage variable.
+    function changeOwner(address payable _owner) external onlyByOwner {
+        owner = _owner;
     }
 
     /// @dev Changes the `instructor` storage variable.
     /// @param _instructor The new value for the `instructor` storage variable.
-    function changeInstructor(address _instructor) external onlyByGovernorOrInstructor {
+    function changeInstructor(address _instructor) external onlyByOwnerOrInstructor {
         instructor = _instructor;
     }
 
     /// @dev Changes the `pinakion` storage variable.
     /// @param _pinakion The new value for the `pinakion` storage variable.
-    function changePinakion(IERC20 _pinakion) external onlyByGovernor {
+    function changePinakion(IERC20 _pinakion) external onlyByOwner {
         pinakion = _pinakion;
     }
 
     /// @dev Changes the `jurorProsecutionModule` storage variable.
     /// @param _jurorProsecutionModule The new value for the `jurorProsecutionModule` storage variable.
-    function changeJurorProsecutionModule(address _jurorProsecutionModule) external onlyByGovernor {
+    function changeJurorProsecutionModule(address _jurorProsecutionModule) external onlyByOwner {
         jurorProsecutionModule = _jurorProsecutionModule;
     }
 
     /// @dev Changes the `_sortitionModule` storage variable.
     /// Note that the new module should be initialized for all courts.
     /// @param _sortitionModule The new value for the `sortitionModule` storage variable.
-    function changeSortitionModule(ISortitionModuleUniversity _sortitionModule) external onlyByGovernor {
+    function changeSortitionModule(ISortitionModuleUniversity _sortitionModule) external onlyByOwner {
         sortitionModule = _sortitionModule;
     }
 
     /// @dev Add a new supported dispute kit module to the court.
     /// @param _disputeKitAddress The address of the dispute kit contract.
-    function addNewDisputeKit(IDisputeKit _disputeKitAddress) external onlyByGovernor {
+    function addNewDisputeKit(IDisputeKit _disputeKitAddress) external onlyByOwner {
         uint256 disputeKitID = disputeKits.length;
         disputeKits.push(_disputeKitAddress);
         emit DisputeKitCreated(disputeKitID, _disputeKitAddress);
@@ -331,7 +327,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         uint256 _jurorsForCourtJump,
         uint256[4] memory _timesPerPeriod,
         uint256[] memory _supportedDisputeKits
-    ) external onlyByGovernor {
+    ) external onlyByOwner {
         if (courts[_parent].minStake > _minStake) revert MinStakeLowerThanParentCourt();
         if (_supportedDisputeKits.length == 0) revert UnsupportedDisputeKit();
         if (_parent == FORKING_COURT) revert InvalidForkingCourtAsParent();
@@ -380,7 +376,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         uint256 _feeForJuror,
         uint256 _jurorsForCourtJump,
         uint256[4] memory _timesPerPeriod
-    ) external onlyByGovernor {
+    ) external onlyByOwner {
         Court storage court = courts[_courtID];
         if (_courtID != GENERAL_COURT && courts[court.parent].minStake > _minStake) {
             revert MinStakeLowerThanParentCourt();
@@ -411,7 +407,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
     /// @param _courtID The ID of the court.
     /// @param _disputeKitIDs The IDs of dispute kits which support should be added/removed.
     /// @param _enable Whether add or remove the dispute kits from the court.
-    function enableDisputeKits(uint96 _courtID, uint256[] memory _disputeKitIDs, bool _enable) external onlyByGovernor {
+    function enableDisputeKits(uint96 _courtID, uint256[] memory _disputeKitIDs, bool _enable) external onlyByOwner {
         for (uint256 i = 0; i < _disputeKitIDs.length; i++) {
             if (_enable) {
                 if (_disputeKitIDs[i] == 0 || _disputeKitIDs[i] >= disputeKits.length) {
@@ -431,7 +427,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
     /// @dev Changes the supported fee tokens.
     /// @param _feeToken The fee token.
     /// @param _accepted Whether the token is supported or not as a method of fee payment.
-    function changeAcceptedFeeTokens(IERC20 _feeToken, bool _accepted) external onlyByGovernor {
+    function changeAcceptedFeeTokens(IERC20 _feeToken, bool _accepted) external onlyByOwner {
         currencyRates[_feeToken].feePaymentAccepted = _accepted;
         emit AcceptedFeeToken(_feeToken, _accepted);
     }
@@ -440,7 +436,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
     /// @param _feeToken The fee token.
     /// @param _rateInEth The new rate of the fee token in ETH.
     /// @param _rateDecimals The new decimals of the fee token rate.
-    function changeCurrencyRates(IERC20 _feeToken, uint64 _rateInEth, uint8 _rateDecimals) external onlyByGovernor {
+    function changeCurrencyRates(IERC20 _feeToken, uint64 _rateInEth, uint8 _rateDecimals) external onlyByOwner {
         currencyRates[_feeToken].rateInEth = _rateInEth;
         currencyRates[_feeToken].rateDecimals = _rateDecimals;
         emit NewCurrencyRate(_feeToken, _rateInEth, _rateDecimals);
@@ -588,7 +584,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
     /// @dev Draws one juror for the dispute until the number votes paid for is reached.
     /// @param _disputeID The ID of the dispute.
     /// @param _juror The address of the juror to draw.
-    function draw(uint256 _disputeID, address _juror) external onlyByGovernorOrInstructor {
+    function draw(uint256 _disputeID, address _juror) external onlyByOwnerOrInstructor {
         Dispute storage dispute = disputes[_disputeID];
         uint256 currentRound = dispute.rounds.length - 1;
         Round storage round = dispute.rounds[currentRound];
@@ -790,15 +786,15 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
             sortitionModule.setJurorInactive(account);
         }
         if (_params.repartition == _params.numberOfVotesInRound - 1 && _params.coherentCount == 0) {
-            // No one was coherent, send the rewards to the governor.
+            // No one was coherent, send the rewards to the owner.
             if (round.feeToken == NATIVE_CURRENCY) {
                 // The dispute fees were paid in ETH
-                payable(governor).send(round.totalFeesForJurors);
+                payable(owner).send(round.totalFeesForJurors);
             } else {
                 // The dispute fees were paid in ERC20
-                round.feeToken.safeTransfer(governor, round.totalFeesForJurors);
+                round.feeToken.safeTransfer(owner, round.totalFeesForJurors);
             }
-            pinakion.safeTransfer(governor, _params.pnkPenaltiesInRound);
+            pinakion.safeTransfer(owner, _params.pnkPenaltiesInRound);
             emit LeftoverRewardSent(
                 _params.disputeID,
                 _params.round,
@@ -870,21 +866,21 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
             round.feeToken
         );
 
-        // Transfer any residual rewards to the governor. It may happen due to partial coherence of the jurors.
+        // Transfer any residual rewards to the owner. It may happen due to partial coherence of the jurors.
         if (_params.repartition == _params.numberOfVotesInRound * 2 - 1) {
             uint256 leftoverPnkReward = _params.pnkPenaltiesInRound - round.sumPnkRewardPaid;
             uint256 leftoverFeeReward = round.totalFeesForJurors - round.sumFeeRewardPaid;
             if (leftoverPnkReward != 0 || leftoverFeeReward != 0) {
                 if (leftoverPnkReward != 0) {
-                    pinakion.safeTransfer(governor, leftoverPnkReward);
+                    pinakion.safeTransfer(owner, leftoverPnkReward);
                 }
                 if (leftoverFeeReward != 0) {
                     if (round.feeToken == NATIVE_CURRENCY) {
                         // The dispute fees were paid in ETH
-                        payable(governor).send(leftoverFeeReward);
+                        payable(owner).send(leftoverFeeReward);
                     } else {
                         // The dispute fees were paid in ERC20
-                        round.feeToken.safeTransfer(governor, leftoverFeeReward);
+                        round.feeToken.safeTransfer(owner, leftoverFeeReward);
                     }
                 }
                 emit LeftoverRewardSent(
@@ -1157,9 +1153,9 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
     // *              Errors               * //
     // ************************************* //
 
-    error GovernorOnly();
+    error OwnerOnly();
     error InstructorOnly();
-    error GovernorOrInstructorOnly();
+    error OwnerOrInstructorOnly();
     error DisputeKitOnly();
     error SortitionModuleOnly();
     error UnsuccessfulCall();
diff --git a/contracts/src/arbitration/university/SortitionModuleUniversity.sol b/contracts/src/arbitration/university/SortitionModuleUniversity.sol
index e32ca5a77..a7a049bb0 100644
--- a/contracts/src/arbitration/university/SortitionModuleUniversity.sol
+++ b/contracts/src/arbitration/university/SortitionModuleUniversity.sol
@@ -29,7 +29,7 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
     // *             Storage               * //
     // ************************************* //
 
-    address public governor; // The governor of the contract.
+    address public owner; // The owner of the contract.
     KlerosCoreUniversity public core; // The core arbitrator contract.
     uint256 public disputesWithoutJurors; // The number of disputes that have not finished drawing jurors.
     mapping(address account => Juror) public jurors; // The jurors.
@@ -66,8 +66,8 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
     // *        Function Modifiers         * //
     // ************************************* //
 
-    modifier onlyByGovernor() {
-        if (governor != msg.sender) revert GovernorOnly();
+    modifier onlyByOwner() {
+        if (owner != msg.sender) revert OwnerOnly();
         _;
     }
 
@@ -87,8 +87,8 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
 
     /// @dev Initializer (constructor equivalent for upgradable contracts).
     /// @param _core The KlerosCore.
-    function initialize(address _governor, KlerosCoreUniversity _core) external reinitializer(1) {
-        governor = _governor;
+    function initialize(address _owner, KlerosCoreUniversity _core) external reinitializer(1) {
+        owner = _owner;
         core = _core;
     }
 
@@ -98,9 +98,9 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
 
     /**
      * @dev Access Control to perform implementation upgrades (UUPS Proxiable)
-     * @dev Only the governor can perform upgrades (`onlyByGovernor`)
+     * @dev Only the owner can perform upgrades (`onlyByOwner`)
      */
-    function _authorizeUpgrade(address) internal view override onlyByGovernor {
+    function _authorizeUpgrade(address) internal view override onlyByOwner {
         // NOP
     }
 
@@ -403,7 +403,7 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
     // *              Errors               * //
     // ************************************* //
 
-    error GovernorOnly();
+    error OwnerOnly();
     error KlerosCoreOnly();
     error NotEligibleForWithdrawal();
 }
diff --git a/contracts/src/arbitration/view/KlerosCoreSnapshotProxy.sol b/contracts/src/arbitration/view/KlerosCoreSnapshotProxy.sol
index 74cdb84ce..70c3c77ce 100644
--- a/contracts/src/arbitration/view/KlerosCoreSnapshotProxy.sol
+++ b/contracts/src/arbitration/view/KlerosCoreSnapshotProxy.sol
@@ -16,7 +16,7 @@ contract KlerosCoreSnapshotProxy {
     // ************************************* //
 
     IKlerosCore public core;
-    address public governor;
+    address public owner;
     string public constant name = "Staked Pinakion";
     string public constant symbol = "stPNK";
     uint8 public constant decimals = 18;
@@ -25,8 +25,8 @@ contract KlerosCoreSnapshotProxy {
     // *         Modifiers                 * //
     // ************************************* //
 
-    modifier onlyByGovernor() {
-        if (governor != msg.sender) revert GovernorOnly();
+    modifier onlyByOwner() {
+        if (owner != msg.sender) revert OwnerOnly();
         _;
     }
 
@@ -35,10 +35,10 @@ contract KlerosCoreSnapshotProxy {
     // ************************************* //
 
     /// @dev Constructor
-    /// @param _governor The governor of the contract.
+    /// @param _owner The owner of the contract.
     /// @param _core KlerosCore to read the balance from.
-    constructor(address _governor, IKlerosCore _core) {
-        governor = _governor;
+    constructor(address _owner, IKlerosCore _core) {
+        owner = _owner;
         core = _core;
     }
 
@@ -46,15 +46,15 @@ contract KlerosCoreSnapshotProxy {
     // *             Governance            * //
     // ************************************* //
 
-    /// @dev Changes the `governor` storage variable.
-    /// @param _governor The new value for the `governor` storage variable.
-    function changeGovernor(address _governor) external onlyByGovernor {
-        governor = _governor;
+    /// @dev Changes the `owner` storage variable.
+    /// @param _owner The new value for the `owner` storage variable.
+    function changeOwner(address _owner) external onlyByOwner {
+        owner = _owner;
     }
 
     /// @dev Changes the `core` storage variable.
     /// @param _core The new value for the `core` storage variable.
-    function changeCore(IKlerosCore _core) external onlyByGovernor {
+    function changeCore(IKlerosCore _core) external onlyByOwner {
         core = _core;
     }
 
@@ -74,5 +74,5 @@ contract KlerosCoreSnapshotProxy {
     // *              Errors               * //
     // ************************************* //
 
-    error GovernorOnly();
+    error OwnerOnly();
 }
diff --git a/contracts/src/gateway/ForeignGateway.sol b/contracts/src/gateway/ForeignGateway.sol
index 1e615936f..712790d0d 100644
--- a/contracts/src/gateway/ForeignGateway.sol
+++ b/contracts/src/gateway/ForeignGateway.sol
@@ -36,7 +36,7 @@ contract ForeignGateway is IForeignGateway, UUPSProxiable, Initializable {
 
     uint256 internal localDisputeID; // The disputeID must start from 1 as the KlerosV1 proxy governor depends on this implementation. We now also depend on localDisputeID not ever being zero.
     mapping(uint96 courtId => uint256) public feeForJuror; // feeForJuror[v2CourtID], it mirrors the value on KlerosCore.
-    address public governor;
+    address public owner;
     address public veaOutbox;
     uint256 public override homeChainID;
     address public override homeGateway;
@@ -57,8 +57,8 @@ contract ForeignGateway is IForeignGateway, UUPSProxiable, Initializable {
         _;
     }
 
-    modifier onlyByGovernor() {
-        if (governor != msg.sender) revert GovernorOnly();
+    modifier onlyByOwner() {
+        if (owner != msg.sender) revert OwnerOnly();
         _;
     }
 
@@ -72,17 +72,17 @@ contract ForeignGateway is IForeignGateway, UUPSProxiable, Initializable {
     }
 
     /// @dev Constructs the `PolicyRegistry` contract.
-    /// @param _governor The governor's address.
+    /// @param _owner The owner's address.
     /// @param _veaOutbox The address of the VeaOutbox.
     /// @param _homeChainID The chainID of the home chain.
     /// @param _homeGateway The address of the home gateway.
     function initialize(
-        address _governor,
+        address _owner,
         address _veaOutbox,
         uint256 _homeChainID,
         address _homeGateway
     ) external reinitializer(1) {
-        governor = _governor;
+        owner = _owner;
         veaOutbox = _veaOutbox;
         homeChainID = _homeChainID;
         homeGateway = _homeGateway;
@@ -95,23 +95,23 @@ contract ForeignGateway is IForeignGateway, UUPSProxiable, Initializable {
 
     /**
      * @dev Access Control to perform implementation upgrades (UUPS Proxiable)
-     * @dev Only the governor can perform upgrades (`onlyByGovernor`)
+     * @dev Only the owner can perform upgrades (`onlyByOwner`)
      */
-    function _authorizeUpgrade(address) internal view override onlyByGovernor {
+    function _authorizeUpgrade(address) internal view override onlyByOwner {
         // NOP
     }
 
-    /// @dev Changes the governor.
-    /// @param _governor The address of the new governor.
-    function changeGovernor(address _governor) external {
-        if (governor != msg.sender) revert GovernorOnly();
-        governor = _governor;
+    /// @dev Changes the owner.
+    /// @param _owner The address of the new owner.
+    function changeOwner(address _owner) external {
+        if (owner != msg.sender) revert OwnerOnly();
+        owner = _owner;
     }
 
     /// @dev Changes the outbox.
     /// @param _veaOutbox The address of the new outbox.
     /// @param _gracePeriod The duration to accept messages from the deprecated bridge (if at all).
-    function changeVea(address _veaOutbox, uint256 _gracePeriod) external onlyByGovernor {
+    function changeVea(address _veaOutbox, uint256 _gracePeriod) external onlyByOwner {
         // grace period to relay the remaining messages which are still going through the deprecated bridge.
         deprecatedVeaOutboxExpiration = block.timestamp + _gracePeriod;
         deprecatedVeaOutbox = veaOutbox;
@@ -121,14 +121,14 @@ contract ForeignGateway is IForeignGateway, UUPSProxiable, Initializable {
     /// @dev Changes the home gateway.
     /// @param _homeGateway The address of the new home gateway.
     function changeHomeGateway(address _homeGateway) external {
-        if (governor != msg.sender) revert GovernorOnly();
+        if (owner != msg.sender) revert OwnerOnly();
         homeGateway = _homeGateway;
     }
 
     /// @dev Changes the `feeForJuror` property value of a specified court.
     /// @param _courtID The ID of the court on the v2 arbitrator. Not to be confused with the courtID on KlerosLiquid.
     /// @param _feeForJuror The new value for the `feeForJuror` property value.
-    function changeCourtJurorFee(uint96 _courtID, uint256 _feeForJuror) external onlyByGovernor {
+    function changeCourtJurorFee(uint96 _courtID, uint256 _feeForJuror) external onlyByOwner {
         feeForJuror[_courtID] = _feeForJuror;
         emit ArbitrationCostModified(_courtID, _feeForJuror);
     }
@@ -272,7 +272,7 @@ contract ForeignGateway is IForeignGateway, UUPSProxiable, Initializable {
     // *              Errors               * //
     // ************************************* //
 
-    error GovernorOnly();
+    error OwnerOnly();
     error HomeGatewayMessageSenderOnly();
     error VeaOutboxOnly();
     error ArbitrationFeesNotEnough();
diff --git a/contracts/src/gateway/HomeGateway.sol b/contracts/src/gateway/HomeGateway.sol
index 2ef8e606f..d0062dc52 100644
--- a/contracts/src/gateway/HomeGateway.sol
+++ b/contracts/src/gateway/HomeGateway.sol
@@ -29,7 +29,7 @@ contract HomeGateway is IHomeGateway, UUPSProxiable, Initializable {
     // *             Storage               * //
     // ************************************* //
 
-    address public governor;
+    address public owner;
     IArbitratorV2 public arbitrator;
     IVeaInbox public veaInbox;
     uint256 public override foreignChainID;
@@ -43,9 +43,9 @@ contract HomeGateway is IHomeGateway, UUPSProxiable, Initializable {
     // *        Function Modifiers         * //
     // ************************************* //
 
-    /// @dev Requires that the sender is the governor.
-    modifier onlyByGovernor() {
-        if (governor != msg.sender) revert GovernorOnly();
+    /// @dev Requires that the sender is the owner.
+    modifier onlyByOwner() {
+        if (owner != msg.sender) revert OwnerOnly();
         _;
     }
 
@@ -59,21 +59,21 @@ contract HomeGateway is IHomeGateway, UUPSProxiable, Initializable {
     }
 
     /// @dev Constructs the `PolicyRegistry` contract.
-    /// @param _governor The governor's address.
+    /// @param _owner The owner's address.
     /// @param _arbitrator The address of the arbitrator.
     /// @param _veaInbox The address of the vea inbox.
     /// @param _foreignChainID The ID of the foreign chain.
     /// @param _foreignGateway The address of the foreign gateway.
     /// @param _feeToken The address of the fee token.
     function initialize(
-        address _governor,
+        address _owner,
         IArbitratorV2 _arbitrator,
         IVeaInbox _veaInbox,
         uint256 _foreignChainID,
         address _foreignGateway,
         IERC20 _feeToken
     ) external reinitializer(1) {
-        governor = _governor;
+        owner = _owner;
         arbitrator = _arbitrator;
         veaInbox = _veaInbox;
         foreignChainID = _foreignChainID;
@@ -87,39 +87,39 @@ contract HomeGateway is IHomeGateway, UUPSProxiable, Initializable {
 
     /**
      * @dev Access Control to perform implementation upgrades (UUPS Proxiable)
-     * @dev Only the governor can perform upgrades (`onlyByGovernor`)
+     * @dev Only the owner can perform upgrades (`onlyByOwner`)
      */
-    function _authorizeUpgrade(address) internal view override onlyByGovernor {
+    function _authorizeUpgrade(address) internal view override onlyByOwner {
         // NOP
     }
 
-    /// @dev Changes the governor.
-    /// @param _governor The address of the new governor.
-    function changeGovernor(address _governor) external onlyByGovernor {
-        governor = _governor;
+    /// @dev Changes the owner.
+    /// @param _owner The address of the new owner.
+    function changeOwner(address _owner) external onlyByOwner {
+        owner = _owner;
     }
 
     /// @dev Changes the arbitrator.
     /// @param _arbitrator The address of the new arbitrator.
-    function changeArbitrator(IArbitratorV2 _arbitrator) external onlyByGovernor {
+    function changeArbitrator(IArbitratorV2 _arbitrator) external onlyByOwner {
         arbitrator = _arbitrator;
     }
 
     /// @dev Changes the vea inbox, useful to increase the claim deposit.
     /// @param _veaInbox The address of the new vea inbox.
-    function changeVea(IVeaInbox _veaInbox) external onlyByGovernor {
+    function changeVea(IVeaInbox _veaInbox) external onlyByOwner {
         veaInbox = _veaInbox;
     }
 
     /// @dev Changes the foreign gateway.
     /// @param _foreignGateway The address of the new foreign gateway.
-    function changeForeignGateway(address _foreignGateway) external onlyByGovernor {
+    function changeForeignGateway(address _foreignGateway) external onlyByOwner {
         foreignGateway = _foreignGateway;
     }
 
     /// @dev Changes the fee token.
     /// @param _feeToken The address of the new fee token.
-    function changeFeeToken(IERC20 _feeToken) external onlyByGovernor {
+    function changeFeeToken(IERC20 _feeToken) external onlyByOwner {
         feeToken = _feeToken;
     }
 
@@ -239,7 +239,7 @@ contract HomeGateway is IHomeGateway, UUPSProxiable, Initializable {
     // *              Errors               * //
     // ************************************* //
 
-    error GovernorOnly();
+    error OwnerOnly();
     error ArbitratorOnly();
     error FeesPaidInERC20Only();
     error FeesPaidInNativeCurrencyOnly();
diff --git a/contracts/src/kleros-v1/interfaces/IKlerosLiquid.sol b/contracts/src/kleros-v1/interfaces/IKlerosLiquid.sol
index 0422c95b3..56d3c7789 100644
--- a/contracts/src/kleros-v1/interfaces/IKlerosLiquid.sol
+++ b/contracts/src/kleros-v1/interfaces/IKlerosLiquid.sol
@@ -77,7 +77,7 @@ interface IKlerosLiquid is IArbitratorV1 {
 
     function changeSubcourtTimesPerPeriod(uint96 _subcourtID, uint256[4] calldata _timesPerPeriod) external;
 
-    function executeGovernorProposal(address _destination, uint256 _amount, bytes calldata _data) external;
+    function executeOwnerProposal(address _destination, uint256 _amount, bytes calldata _data) external;
 
     // Getters
     function getVote(
diff --git a/contracts/src/kleros-v1/kleros-liquid-xdai/xKlerosLiquidV2.sol b/contracts/src/kleros-v1/kleros-liquid-xdai/xKlerosLiquidV2.sol
index 9a25909b7..59ff80353 100644
--- a/contracts/src/kleros-v1/kleros-liquid-xdai/xKlerosLiquidV2.sol
+++ b/contracts/src/kleros-v1/kleros-liquid-xdai/xKlerosLiquidV2.sol
@@ -142,7 +142,7 @@ contract xKlerosLiquidV2 is Initializable, ITokenController, IArbitratorV2 {
     uint256 public constant DEFAULT_NB_OF_JURORS = 3; // The default number of jurors in a dispute.
     uint256 public constant NON_PAYABLE_AMOUNT = (2 ** 256 - 2) / 2; // An amount higher than the supply of ETH.
     // General Contracts
-    address public governor; // The governor of the contract.
+    address public owner; // The owner of the contract.
     WrappedPinakion public pinakion; // The Pinakion token contract.
     IRandomAuRa public RNGenerator; // The random number generator contract.
     // General Dynamic
@@ -197,9 +197,9 @@ contract xKlerosLiquidV2 is Initializable, ITokenController, IArbitratorV2 {
         _;
     }
 
-    /// @dev Requires that the sender is the governor. Note that the governor is expected to not be malicious.
-    modifier onlyByGovernor() {
-        require(governor == msg.sender);
+    /// @dev Requires that the sender is the owner. Note that the owner is expected to not be malicious.
+    modifier onlyByOwner() {
+        require(owner == msg.sender);
         _;
     }
 
@@ -208,7 +208,7 @@ contract xKlerosLiquidV2 is Initializable, ITokenController, IArbitratorV2 {
     // ************************************* //
 
     /// @dev Constructs the KlerosLiquid contract.
-    /// @param _governor The governor's address.
+    /// @param _owner The owner's address.
     /// @param _pinakion The address of the token contract.
     /// @param _RNGenerator The address of the random number generator contract.
     /// @param _minStakingTime The minimum time that the staking phase should last.
@@ -219,7 +219,7 @@ contract xKlerosLiquidV2 is Initializable, ITokenController, IArbitratorV2 {
     /// @param _sortitionSumTreeK The number of children per node of the general court's sortition sum tree.
     /// @param _foreignGateway Foreign gateway on xDai.
     function initialize(
-        address _governor,
+        address _owner,
         WrappedPinakion _pinakion,
         IRandomAuRa _RNGenerator,
         uint256 _minStakingTime,
@@ -231,7 +231,7 @@ contract xKlerosLiquidV2 is Initializable, ITokenController, IArbitratorV2 {
         IForeignGateway _foreignGateway
     ) public initializer {
         // Initialize contract.
-        governor = _governor;
+        owner = _owner;
         pinakion = _pinakion;
         RNGenerator = _RNGenerator;
         minStakingTime = _minStakingTime;
@@ -264,34 +264,30 @@ contract xKlerosLiquidV2 is Initializable, ITokenController, IArbitratorV2 {
     // *             Governance            * //
     // ************************************* //
 
-    /// @dev Lets the governor call anything on behalf of the contract.
+    /// @dev Lets the owner call anything on behalf of the contract.
     /// @param _destination The destination of the call.
     /// @param _amount The value sent with the call.
     /// @param _data The data sent with the call.
-    function executeGovernorProposal(
-        address _destination,
-        uint256 _amount,
-        bytes memory _data
-    ) external onlyByGovernor {
+    function executeOwnerProposal(address _destination, uint256 _amount, bytes memory _data) external onlyByOwner {
         (bool success, ) = _destination.call{value: _amount}(_data);
         require(success, "Unsuccessful call");
     }
 
-    /// @dev Changes the `governor` storage variable.
-    /// @param _governor The new value for the `governor` storage variable.
-    function changeGovernor(address _governor) external onlyByGovernor {
-        governor = _governor;
+    /// @dev Changes the `owner` storage variable.
+    /// @param _owner The new value for the `owner` storage variable.
+    function changeOwner(address _owner) external onlyByOwner {
+        owner = _owner;
     }
 
     /// @dev Changes the `pinakion` storage variable.
     /// @param _pinakion The new value for the `pinakion` storage variable.
-    function changePinakion(WrappedPinakion _pinakion) external onlyByGovernor {
+    function changePinakion(WrappedPinakion _pinakion) external onlyByOwner {
         pinakion = _pinakion;
     }
 
     /// @dev Changes the `RNGenerator` storage variable.
     /// @param _RNGenerator The new value for the `RNGenerator` storage variable.
-    function changeRNGenerator(IRandomAuRa _RNGenerator) external onlyByGovernor {
+    function changeRNGenerator(IRandomAuRa _RNGenerator) external onlyByOwner {
         RNGenerator = _RNGenerator;
         if (phase == Phase.generating) {
             RNBlock = RNGenerator.nextCommitPhaseStartBlock() + RNGenerator.collectRoundLength();
@@ -300,19 +296,19 @@ contract xKlerosLiquidV2 is Initializable, ITokenController, IArbitratorV2 {
 
     /// @dev Changes the `minStakingTime` storage variable.
     /// @param _minStakingTime The new value for the `minStakingTime` storage variable.
-    function changeMinStakingTime(uint256 _minStakingTime) external onlyByGovernor {
+    function changeMinStakingTime(uint256 _minStakingTime) external onlyByOwner {
         minStakingTime = _minStakingTime;
     }
 
     /// @dev Changes the `maxDrawingTime` storage variable.
     /// @param _maxDrawingTime The new value for the `maxDrawingTime` storage variable.
-    function changeMaxDrawingTime(uint256 _maxDrawingTime) external onlyByGovernor {
+    function changeMaxDrawingTime(uint256 _maxDrawingTime) external onlyByOwner {
         maxDrawingTime = _maxDrawingTime;
     }
 
     /// @dev Changes the `foreignGateway` storage variable.
     /// @param _foreignGateway The new value for the `foreignGateway` storage variable.
-    function changeForeignGateway(IForeignGateway _foreignGateway) external onlyByGovernor {
+    function changeForeignGateway(IForeignGateway _foreignGateway) external onlyByOwner {
         foreignGateway = _foreignGateway;
     }
 
@@ -334,7 +330,7 @@ contract xKlerosLiquidV2 is Initializable, ITokenController, IArbitratorV2 {
         uint256 _jurorsForCourtJump,
         uint256[4] memory _timesPerPeriod,
         uint256 _sortitionSumTreeK
-    ) external onlyByGovernor {
+    ) external onlyByOwner {
         require(
             courts[_parent].minStake <= _minStake,
             "A subcourt cannot be a child of a subcourt with a higher minimum stake."
@@ -360,7 +356,7 @@ contract xKlerosLiquidV2 is Initializable, ITokenController, IArbitratorV2 {
     /// @dev Changes the `minStake` property value of a specified subcourt. Don't set to a value lower than its parent's `minStake` property value.
     /// @param _subcourtID The ID of the subcourt.
     /// @param _minStake The new value for the `minStake` property value.
-    function changeSubcourtMinStake(uint96 _subcourtID, uint256 _minStake) external onlyByGovernor {
+    function changeSubcourtMinStake(uint96 _subcourtID, uint256 _minStake) external onlyByOwner {
         require(_subcourtID == 0 || courts[courts[_subcourtID].parent].minStake <= _minStake);
         for (uint256 i = 0; i < courts[_subcourtID].children.length; i++) {
             require(
@@ -375,31 +371,28 @@ contract xKlerosLiquidV2 is Initializable, ITokenController, IArbitratorV2 {
     /// @dev Changes the `alpha` property value of a specified subcourt.
     /// @param _subcourtID The ID of the subcourt.
     /// @param _alpha The new value for the `alpha` property value.
-    function changeSubcourtAlpha(uint96 _subcourtID, uint256 _alpha) external onlyByGovernor {
+    function changeSubcourtAlpha(uint96 _subcourtID, uint256 _alpha) external onlyByOwner {
         courts[_subcourtID].alpha = _alpha;
     }
 
     /// @dev Changes the `feeForJuror` property value of a specified subcourt.
     /// @param _subcourtID The ID of the subcourt.
     /// @param _feeForJuror The new value for the `feeForJuror` property value.
-    function changeSubcourtJurorFee(uint96 _subcourtID, uint256 _feeForJuror) external onlyByGovernor {
+    function changeSubcourtJurorFee(uint96 _subcourtID, uint256 _feeForJuror) external onlyByOwner {
         courts[_subcourtID].feeForJuror = _feeForJuror;
     }
 
     /// @dev Changes the `jurorsForCourtJump` property value of a specified subcourt.
     /// @param _subcourtID The ID of the subcourt.
     /// @param _jurorsForCourtJump The new value for the `jurorsForCourtJump` property value.
-    function changeSubcourtJurorsForJump(uint96 _subcourtID, uint256 _jurorsForCourtJump) external onlyByGovernor {
+    function changeSubcourtJurorsForJump(uint96 _subcourtID, uint256 _jurorsForCourtJump) external onlyByOwner {
         courts[_subcourtID].jurorsForCourtJump = _jurorsForCourtJump;
     }
 
     /// @dev Changes the `timesPerPeriod` property value of a specified subcourt.
     /// @param _subcourtID The ID of the subcourt.
     /// @param _timesPerPeriod The new value for the `timesPerPeriod` property value.
-    function changeSubcourtTimesPerPeriod(
-        uint96 _subcourtID,
-        uint256[4] memory _timesPerPeriod
-    ) external onlyByGovernor {
+    function changeSubcourtTimesPerPeriod(uint96 _subcourtID, uint256[4] memory _timesPerPeriod) external onlyByOwner {
         courts[_subcourtID].timesPerPeriod = _timesPerPeriod;
     }
 
diff --git a/contracts/src/kleros-v1/kleros-liquid/KlerosLiquidToV2Governor.sol b/contracts/src/kleros-v1/kleros-liquid/KlerosLiquidToV2Governor.sol
index 509b85101..def339931 100644
--- a/contracts/src/kleros-v1/kleros-liquid/KlerosLiquidToV2Governor.sol
+++ b/contracts/src/kleros-v1/kleros-liquid/KlerosLiquidToV2Governor.sol
@@ -26,7 +26,7 @@ contract KlerosLiquidToV2Governor is IArbitrableV2, ITokenController {
 
     IArbitratorV2 public immutable foreignGateway;
     IKlerosLiquid public immutable klerosLiquid;
-    address public governor;
+    address public owner;
     mapping(uint256 disputeId => uint256 gatewayDisputeId) public klerosLiquidDisputeIDtoGatewayDisputeID;
     mapping(uint256 gatewayDisputeId => DisputeData) public disputes; // disputes[gatewayDisputeID]
     mapping(address account => uint256 tokenAmount) public frozenTokens; // frozenTokens[account] locked token which shouldn't have been blocked.
@@ -36,8 +36,8 @@ contract KlerosLiquidToV2Governor is IArbitrableV2, ITokenController {
     // *        Function Modifiers         * //
     // ************************************* //
 
-    modifier onlyByGovernor() {
-        require(governor == msg.sender);
+    modifier onlyByOwner() {
+        require(owner == msg.sender);
         _;
     }
 
@@ -45,13 +45,13 @@ contract KlerosLiquidToV2Governor is IArbitrableV2, ITokenController {
     // *            Constructor            * //
     // ************************************* //
 
-    /// @dev Constructor. Before this contract is made the new governor of KlerosLiquid, the evidence period of all subcourts has to be set to uint(-1).
+    /// @dev Constructor. Before this contract is made the new owner of KlerosLiquid, the evidence period of all subcourts has to be set to uint(-1).
     /// @param _klerosLiquid The trusted arbitrator to resolve potential disputes.
-    /// @param _governor The trusted governor of the contract.
+    /// @param _owner The trusted owner of the contract.
     /// @param _foreignGateway The trusted gateway that acts as an arbitrator, relaying disputes to v2.
-    constructor(IKlerosLiquid _klerosLiquid, address _governor, IArbitratorV2 _foreignGateway) {
+    constructor(IKlerosLiquid _klerosLiquid, address _owner, IArbitratorV2 _foreignGateway) {
         klerosLiquid = _klerosLiquid;
-        governor = _governor;
+        owner = _owner;
         foreignGateway = _foreignGateway;
     }
 
@@ -59,23 +59,19 @@ contract KlerosLiquidToV2Governor is IArbitrableV2, ITokenController {
     // *             Governance            * //
     // ************************************* //
 
-    /// @dev Lets the governor call anything on behalf of the contract.
+    /// @dev Lets the owner call anything on behalf of the contract.
     /// @param _destination The destination of the call.
     /// @param _amount The value sent with the call.
     /// @param _data The data sent with the call.
-    function executeGovernorProposal(
-        address _destination,
-        uint256 _amount,
-        bytes calldata _data
-    ) external onlyByGovernor {
+    function executeOwnerProposal(address _destination, uint256 _amount, bytes calldata _data) external onlyByOwner {
         (bool success, ) = _destination.call{value: _amount}(_data); // solium-disable-line security/no-call-value
         require(success, "Call execution failed.");
     }
 
-    /// @dev Changes the `governor` storage variable.
-    /// @param _governor The new value for the `governor` storage variable.
-    function changeGovernor(address _governor) external onlyByGovernor {
-        governor = _governor;
+    /// @dev Changes the `owner` storage variable.
+    /// @param _owner The new value for the `owner` storage variable.
+    function changeOwner(address _owner) external onlyByOwner {
+        owner = _owner;
     }
 
     // ************************************* //
@@ -94,7 +90,7 @@ contract KlerosLiquidToV2Governor is IArbitrableV2, ITokenController {
         require(KlerosLiquidDispute.period == IKlerosLiquid.Period.evidence, "Invalid dispute period.");
         require(votesLengths.length == 1, "Cannot relay appeals.");
 
-        klerosLiquid.executeGovernorProposal(address(this), totalFeesForJurors[0], "");
+        klerosLiquid.executeOwnerProposal(address(this), totalFeesForJurors[0], "");
 
         uint256 minJurors = votesLengths[0];
         bytes memory extraData = abi.encode(KlerosLiquidDispute.subcourtID, minJurors);
@@ -125,7 +121,7 @@ contract KlerosLiquidToV2Governor is IArbitrableV2, ITokenController {
         IKlerosLiquid.Dispute memory klerosLiquidDispute = klerosLiquid.disputes(dispute.klerosLiquidDisputeID);
 
         bytes memory data = abi.encodeCall(IArbitrableV2.rule, (dispute.klerosLiquidDisputeID, _ruling));
-        klerosLiquid.executeGovernorProposal(klerosLiquidDispute.arbitrated, 0, data);
+        klerosLiquid.executeOwnerProposal(klerosLiquidDispute.arbitrated, 0, data);
     }
 
     /// @dev Registers jurors' tokens which where locked due to relaying a given dispute. These tokens don't count as locked.
diff --git a/contracts/src/proxy/mock/UUPSUpgradeableMocks.sol b/contracts/src/proxy/mock/UUPSUpgradeableMocks.sol
index 0764c8cd1..3b2bc7959 100644
--- a/contracts/src/proxy/mock/UUPSUpgradeableMocks.sol
+++ b/contracts/src/proxy/mock/UUPSUpgradeableMocks.sol
@@ -20,7 +20,7 @@ contract NonUpgradeableMock {
 
 contract UUPSUpgradeableMock is UUPSProxiable, NonUpgradeableMock {
     bool public initialized;
-    address public governor;
+    address public owner;
 
     uint256[50] __gap;
 
@@ -28,14 +28,14 @@ contract UUPSUpgradeableMock is UUPSProxiable, NonUpgradeableMock {
         initialized = true;
     }
 
-    function initialize(address _governor) external {
+    function initialize(address _owner) external {
         require(!initialized, "Contract instance has already been initialized");
-        governor = _governor;
+        owner = _owner;
         initialized = true;
     }
 
     function _authorizeUpgrade(address) internal view override {
-        require(governor == msg.sender, "No privilege to upgrade");
+        require(owner == msg.sender, "No privilege to upgrade");
     }
 
     function version() external pure virtual override returns (string memory) {
diff --git a/contracts/src/proxy/mock/by-inheritance/UpgradedByInheritance.sol b/contracts/src/proxy/mock/by-inheritance/UpgradedByInheritance.sol
index 2cb9adf03..c5f796995 100644
--- a/contracts/src/proxy/mock/by-inheritance/UpgradedByInheritance.sol
+++ b/contracts/src/proxy/mock/by-inheritance/UpgradedByInheritance.sol
@@ -12,7 +12,7 @@ contract UpgradedByInheritanceV1Proxy is UUPSProxy {
 }
 
 contract UpgradedByInheritanceV1 is UUPSProxiable, Initializable {
-    address public governor;
+    address public owner;
     uint256 public counter;
     uint256[50] __gap;
 
@@ -20,13 +20,13 @@ contract UpgradedByInheritanceV1 is UUPSProxiable, Initializable {
         _disableInitializers();
     }
 
-    function initialize(address _governor) external virtual reinitializer(1) {
-        governor = _governor;
+    function initialize(address _owner) external virtual reinitializer(1) {
+        owner = _owner;
         counter = 1;
     }
 
     function _authorizeUpgrade(address) internal view override {
-        require(governor == msg.sender, "No privilege to upgrade");
+        require(owner == msg.sender, "No privilege to upgrade");
     }
 
     function increment() external {
diff --git a/contracts/src/proxy/mock/by-rewrite/UpgradedByRewrite.sol b/contracts/src/proxy/mock/by-rewrite/UpgradedByRewrite.sol
index ca0731da8..f5e5eae77 100644
--- a/contracts/src/proxy/mock/by-rewrite/UpgradedByRewrite.sol
+++ b/contracts/src/proxy/mock/by-rewrite/UpgradedByRewrite.sol
@@ -15,7 +15,7 @@ contract UpgradedByRewrite is UUPSProxiable, Initializable {
     //------------------------
     // V1 State
     //------------------------
-    address public governor;
+    address public owner;
     uint256 public counter;
     uint256[50] __gap;
 
@@ -23,13 +23,13 @@ contract UpgradedByRewrite is UUPSProxiable, Initializable {
         _disableInitializers();
     }
 
-    function initialize(address _governor) external virtual reinitializer(1) {
-        governor = _governor;
+    function initialize(address _owner) external virtual reinitializer(1) {
+        owner = _owner;
         counter = 1;
     }
 
     function _authorizeUpgrade(address) internal view override {
-        require(governor == msg.sender, "No privilege to upgrade");
+        require(owner == msg.sender, "No privilege to upgrade");
     }
 
     function increment() external {
diff --git a/contracts/src/proxy/mock/by-rewrite/UpgradedByRewriteV2.sol b/contracts/src/proxy/mock/by-rewrite/UpgradedByRewriteV2.sol
index 1b3c85e0a..5158c73fb 100644
--- a/contracts/src/proxy/mock/by-rewrite/UpgradedByRewriteV2.sol
+++ b/contracts/src/proxy/mock/by-rewrite/UpgradedByRewriteV2.sol
@@ -10,7 +10,7 @@ contract UpgradedByRewrite is UUPSProxiable, Initializable {
     //------------------------
     // V1 State
     //------------------------
-    address public governor;
+    address public owner;
     uint256 public counter;
     uint256[50] __gap;
 
@@ -29,7 +29,7 @@ contract UpgradedByRewrite is UUPSProxiable, Initializable {
     }
 
     function _authorizeUpgrade(address) internal view override {
-        require(governor == msg.sender, "No privilege to upgrade");
+        require(owner == msg.sender, "No privilege to upgrade");
     }
 
     function increment() external {
diff --git a/contracts/src/rng/BlockhashRNG.sol b/contracts/src/rng/BlockhashRNG.sol
index a36501e6e..d104780f4 100644
--- a/contracts/src/rng/BlockhashRNG.sol
+++ b/contracts/src/rng/BlockhashRNG.sol
@@ -15,7 +15,7 @@ contract BlockHashRNG is IRNG {
     // *             Storage               * //
     // ************************************* //
 
-    address public governor; // The address that can withdraw funds.
+    address public owner; // The address that can withdraw funds.
     address public consumer; // The address that can request random numbers.
     uint256 public immutable lookaheadTime; // Minimal time in seconds between requesting and obtaining a random number.
     uint256 public requestTimestamp; // Timestamp of the current request
@@ -25,8 +25,8 @@ contract BlockHashRNG is IRNG {
     // *        Function Modifiers         * //
     // ************************************* //
 
-    modifier onlyByGovernor() {
-        if (governor != msg.sender) revert GovernorOnly();
+    modifier onlyByOwner() {
+        if (owner != msg.sender) revert OwnerOnly();
         _;
     }
 
@@ -40,11 +40,11 @@ contract BlockHashRNG is IRNG {
     // ************************************* //
 
     /// @dev Constructor.
-    /// @param _governor The Governor of the contract.
+    /// @param _owner The Owner of the contract.
     /// @param _consumer The address that can request random numbers.
     /// @param _lookaheadTime The time lookahead in seconds for the random number.
-    constructor(address _governor, address _consumer, uint256 _lookaheadTime) {
-        governor = _governor;
+    constructor(address _owner, address _consumer, uint256 _lookaheadTime) {
+        owner = _owner;
         consumer = _consumer;
         lookaheadTime = _lookaheadTime;
     }
@@ -53,15 +53,15 @@ contract BlockHashRNG is IRNG {
     // *             Governance            * //
     // ************************************* //
 
-    /// @dev Changes the governor of the contract.
-    /// @param _governor The new governor.
-    function changeGovernor(address _governor) external onlyByGovernor {
-        governor = _governor;
+    /// @dev Changes the owner of the contract.
+    /// @param _owner The new owner.
+    function changeOwner(address _owner) external onlyByOwner {
+        owner = _owner;
     }
 
     /// @dev Changes the consumer of the RNG.
     /// @param _consumer The new consumer.
-    function changeConsumer(address _consumer) external onlyByGovernor {
+    function changeConsumer(address _consumer) external onlyByOwner {
         consumer = _consumer;
     }
 
diff --git a/contracts/src/rng/ChainlinkConsumerBaseV2Plus.sol b/contracts/src/rng/ChainlinkConsumerBaseV2Plus.sol
new file mode 100644
index 000000000..73df28caf
--- /dev/null
+++ b/contracts/src/rng/ChainlinkConsumerBaseV2Plus.sol
@@ -0,0 +1,169 @@
+// SPDX-License-Identifier: MIT
+pragma solidity ^0.8.24;
+
+// This contract is adapted from `@chainlink/contracts/src/v0.8/vrf/dev/VRFConsumerBaseV2Plus.sol` to remove the `ConfirmedOwner` dependency.
+
+import {IVRFCoordinatorV2Plus} from "@chainlink/contracts/src/v0.8/vrf/dev/interfaces/IVRFCoordinatorV2Plus.sol";
+import {IVRFMigratableConsumerV2Plus} from "@chainlink/contracts/src/v0.8/vrf/dev/interfaces/IVRFMigratableConsumerV2Plus.sol";
+
+/** ****************************************************************************
+ * @notice Interface for contracts using VRF randomness
+ * *****************************************************************************
+ * @dev PURPOSE
+ *
+ * @dev Reggie the Random Oracle (not his real job) wants to provide randomness
+ * @dev to Vera the verifier in such a way that Vera can be sure he's not
+ * @dev making his output up to suit himself. Reggie provides Vera a public key
+ * @dev to which he knows the secret key. Each time Vera provides a seed to
+ * @dev Reggie, he gives back a value which is computed completely
+ * @dev deterministically from the seed and the secret key.
+ *
+ * @dev Reggie provides a proof by which Vera can verify that the output was
+ * @dev correctly computed once Reggie tells it to her, but without that proof,
+ * @dev the output is indistinguishable to her from a uniform random sample
+ * @dev from the output space.
+ *
+ * @dev The purpose of this contract is to make it easy for unrelated contracts
+ * @dev to talk to Vera the verifier about the work Reggie is doing, to provide
+ * @dev simple access to a verifiable source of randomness. It ensures 2 things:
+ * @dev 1. The fulfillment came from the VRFCoordinatorV2Plus.
+ * @dev 2. The consumer contract implements fulfillRandomWords.
+ * *****************************************************************************
+ * @dev USAGE
+ *
+ * @dev Calling contracts must inherit from VRFConsumerBaseV2Plus, and can
+ * @dev initialize VRFConsumerBaseV2Plus's attributes in their constructor as
+ * @dev shown:
+ *
+ * @dev   contract VRFConsumerV2Plus is VRFConsumerBaseV2Plus {
+ * @dev     constructor(<other arguments>, address _vrfCoordinator, address _subOwner)
+ * @dev       VRFConsumerBaseV2Plus(_vrfCoordinator, _subOwner) public {
+ * @dev         <initialization with other arguments goes here>
+ * @dev       }
+ * @dev   }
+ *
+ * @dev The oracle will have given you an ID for the VRF keypair they have
+ * @dev committed to (let's call it keyHash). Create a subscription, fund it
+ * @dev and your consumer contract as a consumer of it (see VRFCoordinatorInterface
+ * @dev subscription management functions).
+ * @dev Call requestRandomWords(keyHash, subId, minimumRequestConfirmations,
+ * @dev callbackGasLimit, numWords, extraArgs),
+ * @dev see (IVRFCoordinatorV2Plus for a description of the arguments).
+ *
+ * @dev Once the VRFCoordinatorV2Plus has received and validated the oracle's response
+ * @dev to your request, it will call your contract's fulfillRandomWords method.
+ *
+ * @dev The randomness argument to fulfillRandomWords is a set of random words
+ * @dev generated from your requestId and the blockHash of the request.
+ *
+ * @dev If your contract could have concurrent requests open, you can use the
+ * @dev requestId returned from requestRandomWords to track which response is associated
+ * @dev with which randomness request.
+ * @dev See "SECURITY CONSIDERATIONS" for principles to keep in mind,
+ * @dev if your contract could have multiple requests in flight simultaneously.
+ *
+ * @dev Colliding `requestId`s are cryptographically impossible as long as seeds
+ * @dev differ.
+ *
+ * *****************************************************************************
+ * @dev SECURITY CONSIDERATIONS
+ *
+ * @dev A method with the ability to call your fulfillRandomness method directly
+ * @dev could spoof a VRF response with any random value, so it's critical that
+ * @dev it cannot be directly called by anything other than this base contract
+ * @dev (specifically, by the VRFConsumerBaseV2Plus.rawFulfillRandomness method).
+ *
+ * @dev For your users to trust that your contract's random behavior is free
+ * @dev from malicious interference, it's best if you can write it so that all
+ * @dev behaviors implied by a VRF response are executed *during* your
+ * @dev fulfillRandomness method. If your contract must store the response (or
+ * @dev anything derived from it) and use it later, you must ensure that any
+ * @dev user-significant behavior which depends on that stored value cannot be
+ * @dev manipulated by a subsequent VRF request.
+ *
+ * @dev Similarly, both miners and the VRF oracle itself have some influence
+ * @dev over the order in which VRF responses appear on the blockchain, so if
+ * @dev your contract could have multiple VRF requests in flight simultaneously,
+ * @dev you must ensure that the order in which the VRF responses arrive cannot
+ * @dev be used to manipulate your contract's user-significant behavior.
+ *
+ * @dev Since the block hash of the block which contains the requestRandomness
+ * @dev call is mixed into the input to the VRF *last*, a sufficiently powerful
+ * @dev miner could, in principle, fork the blockchain to evict the block
+ * @dev containing the request, forcing the request to be included in a
+ * @dev different block with a different hash, and therefore a different input
+ * @dev to the VRF. However, such an attack would incur a substantial economic
+ * @dev cost. This cost scales with the number of blocks the VRF oracle waits
+ * @dev until it calls responds to a request. It is for this reason that
+ * @dev that you can signal to an oracle you'd like them to wait longer before
+ * @dev responding to the request (however this is not enforced in the contract
+ * @dev and so remains effective only in the case of unmodified oracle software).
+ */
+abstract contract VRFConsumerBaseV2Plus is IVRFMigratableConsumerV2Plus {
+    error OnlyCoordinatorCanFulfill(address have, address want);
+    error OnlyOwnerOrCoordinator(address have, address owner, address coordinator);
+    error ZeroAddress();
+
+    address public owner;
+
+    // s_vrfCoordinator should be used by consumers to make requests to vrfCoordinator
+    // so that coordinator reference is updated after migration
+    IVRFCoordinatorV2Plus public s_vrfCoordinator;
+
+    /**
+     * @param _vrfCoordinator address of VRFCoordinator contract
+     */
+    constructor(address _owner, address _vrfCoordinator) {
+        owner = _owner;
+        if (_vrfCoordinator == address(0)) {
+            revert ZeroAddress();
+        }
+        s_vrfCoordinator = IVRFCoordinatorV2Plus(_vrfCoordinator);
+    }
+
+    /**
+     * @notice fulfillRandomness handles the VRF response. Your contract must
+     * @notice implement it. See "SECURITY CONSIDERATIONS" above for important
+     * @notice principles to keep in mind when implementing your fulfillRandomness
+     * @notice method.
+     *
+     * @dev VRFConsumerBaseV2Plus expects its subcontracts to have a method with this
+     * @dev signature, and will call it once it has verified the proof
+     * @dev associated with the randomness. (It is triggered via a call to
+     * @dev rawFulfillRandomness, below.)
+     *
+     * @param requestId The Id initially returned by requestRandomness
+     * @param randomWords the VRF output expanded to the requested number of words
+     */
+    // solhint-disable-next-line chainlink-solidity/prefix-internal-functions-with-underscore
+    function fulfillRandomWords(uint256 requestId, uint256[] calldata randomWords) internal virtual;
+
+    // rawFulfillRandomness is called by VRFCoordinator when it receives a valid VRF
+    // proof. rawFulfillRandomness then calls fulfillRandomness, after validating
+    // the origin of the call
+    function rawFulfillRandomWords(uint256 requestId, uint256[] calldata randomWords) external {
+        if (msg.sender != address(s_vrfCoordinator)) {
+            revert OnlyCoordinatorCanFulfill(msg.sender, address(s_vrfCoordinator));
+        }
+        fulfillRandomWords(requestId, randomWords);
+    }
+
+    /**
+     * @inheritdoc IVRFMigratableConsumerV2Plus
+     */
+    function setCoordinator(address _vrfCoordinator) external override onlyOwnerOrCoordinator {
+        if (_vrfCoordinator == address(0)) {
+            revert ZeroAddress();
+        }
+        s_vrfCoordinator = IVRFCoordinatorV2Plus(_vrfCoordinator);
+
+        emit CoordinatorSet(_vrfCoordinator);
+    }
+
+    modifier onlyOwnerOrCoordinator() {
+        if (msg.sender != owner && msg.sender != address(s_vrfCoordinator)) {
+            revert OnlyOwnerOrCoordinator(msg.sender, owner, address(s_vrfCoordinator));
+        }
+        _;
+    }
+}
diff --git a/contracts/src/rng/ChainlinkRNG.sol b/contracts/src/rng/ChainlinkRNG.sol
index a5bff291f..744bc5248 100644
--- a/contracts/src/rng/ChainlinkRNG.sol
+++ b/contracts/src/rng/ChainlinkRNG.sol
@@ -2,7 +2,7 @@
 
 pragma solidity ^0.8.24;
 
-import {VRFConsumerBaseV2Plus, IVRFCoordinatorV2Plus} from "@chainlink/contracts/src/v0.8/vrf/dev/VRFConsumerBaseV2Plus.sol";
+import {VRFConsumerBaseV2Plus, IVRFCoordinatorV2Plus} from "./ChainlinkConsumerBaseV2Plus.sol";
 import {VRFV2PlusClient} from "@chainlink/contracts/src/v0.8/vrf/dev/libraries/VRFV2PlusClient.sol";
 
 import "./IRNG.sol";
@@ -14,7 +14,6 @@ contract ChainlinkRNG is IRNG, VRFConsumerBaseV2Plus {
     // *             Storage               * //
     // ************************************* //
 
-    address public governor; // The address that can withdraw funds.
     address public consumer; // The address that can request random numbers.
     bytes32 public keyHash; // The gas lane key hash value - Defines the maximum gas price you are willing to pay for a request in wei (ID of the off-chain VRF job).
     uint256 public subscriptionId; // The unique identifier of the subscription used for funding requests.
@@ -41,8 +40,8 @@ contract ChainlinkRNG is IRNG, VRFConsumerBaseV2Plus {
     // *        Function Modifiers         * //
     // ************************************* //
 
-    modifier onlyByGovernor() {
-        if (governor != msg.sender) revert GovernorOnly();
+    modifier onlyByOwner() {
+        if (owner != msg.sender) revert OwnerOnly();
         _;
     }
 
@@ -56,7 +55,7 @@ contract ChainlinkRNG is IRNG, VRFConsumerBaseV2Plus {
     // ************************************* //
 
     /// @dev Constructor, initializing the implementation to reduce attack surface.
-    /// @param _governor The Governor of the contract.
+    /// @param _owner The owner of the contract.
     /// @param _consumer The address that can request random numbers.
     /// @param _vrfCoordinator The address of the VRFCoordinator contract.
     /// @param _keyHash The gas lane key hash value - Defines the maximum gas price you are willing to pay for a request in wei (ID of the off-chain VRF job).
@@ -65,15 +64,14 @@ contract ChainlinkRNG is IRNG, VRFConsumerBaseV2Plus {
     /// @param _callbackGasLimit The limit for how much gas to use for the callback request to the contract's fulfillRandomWords() function.
     /// @dev https://docs.chain.link/vrf/v2-5/subscription/get-a-random-number
     constructor(
-        address _governor,
+        address _owner,
         address _consumer,
         address _vrfCoordinator,
         bytes32 _keyHash,
         uint256 _subscriptionId,
         uint16 _requestConfirmations,
         uint32 _callbackGasLimit
-    ) VRFConsumerBaseV2Plus(_vrfCoordinator) {
-        governor = _governor;
+    ) VRFConsumerBaseV2Plus(_owner, _vrfCoordinator) {
         consumer = _consumer;
         keyHash = _keyHash;
         subscriptionId = _subscriptionId;
@@ -85,46 +83,46 @@ contract ChainlinkRNG is IRNG, VRFConsumerBaseV2Plus {
     // *             Governance            * //
     // ************************************* //
 
-    /// @dev Changes the governor of the contract.
-    /// @param _governor The new governor.
-    function changeGovernor(address _governor) external onlyByGovernor {
-        governor = _governor;
+    /// @dev Changes the owner of the contract.
+    /// @param _owner The new owner.
+    function changeOwner(address _owner) external onlyByOwner {
+        owner = _owner;
     }
 
     /// @dev Changes the consumer of the RNG.
     /// @param _consumer The new consumer.
-    function changeConsumer(address _consumer) external onlyByGovernor {
+    function changeConsumer(address _consumer) external onlyByOwner {
         consumer = _consumer;
     }
 
     /// @dev Changes the VRF Coordinator of the contract.
     /// @param _vrfCoordinator The new VRF Coordinator.
-    function changeVrfCoordinator(address _vrfCoordinator) external onlyByGovernor {
+    function changeVrfCoordinator(address _vrfCoordinator) external onlyByOwner {
         s_vrfCoordinator = IVRFCoordinatorV2Plus(_vrfCoordinator);
         emit CoordinatorSet(_vrfCoordinator);
     }
 
     /// @dev Changes the key hash of the contract.
     /// @param _keyHash The new key hash.
-    function changeKeyHash(bytes32 _keyHash) external onlyByGovernor {
+    function changeKeyHash(bytes32 _keyHash) external onlyByOwner {
         keyHash = _keyHash;
     }
 
     /// @dev Changes the subscription ID of the contract.
     /// @param _subscriptionId The new subscription ID.
-    function changeSubscriptionId(uint256 _subscriptionId) external onlyByGovernor {
+    function changeSubscriptionId(uint256 _subscriptionId) external onlyByOwner {
         subscriptionId = _subscriptionId;
     }
 
     /// @dev Changes the request confirmations of the contract.
     /// @param _requestConfirmations The new request confirmations.
-    function changeRequestConfirmations(uint16 _requestConfirmations) external onlyByGovernor {
+    function changeRequestConfirmations(uint16 _requestConfirmations) external onlyByOwner {
         requestConfirmations = _requestConfirmations;
     }
 
     /// @dev Changes the callback gas limit of the contract.
     /// @param _callbackGasLimit The new callback gas limit.
-    function changeCallbackGasLimit(uint32 _callbackGasLimit) external onlyByGovernor {
+    function changeCallbackGasLimit(uint32 _callbackGasLimit) external onlyByOwner {
         callbackGasLimit = _callbackGasLimit;
     }
 
diff --git a/contracts/src/rng/IRNG.sol b/contracts/src/rng/IRNG.sol
index 1a767fee0..c407b763f 100644
--- a/contracts/src/rng/IRNG.sol
+++ b/contracts/src/rng/IRNG.sol
@@ -11,6 +11,6 @@ interface IRNG {
     /// @return randomNumber Random number or 0 if not available
     function receiveRandomness() external returns (uint256 randomNumber);
 
-    error GovernorOnly();
+    error OwnerOnly();
     error ConsumerOnly();
 }
diff --git a/contracts/src/rng/RNGWithFallback.sol b/contracts/src/rng/RNGWithFallback.sol
index c47f9eb53..8501d4db9 100644
--- a/contracts/src/rng/RNGWithFallback.sol
+++ b/contracts/src/rng/RNGWithFallback.sol
@@ -11,7 +11,7 @@ contract RNGWithFallback is IRNG {
     // ************************************* //
 
     IRNG public immutable rng; // RNG address.
-    address public governor; // Governor address
+    address public owner; // Owner address
     address public consumer; // Consumer address
     uint256 public fallbackTimeoutSeconds; // Time in seconds to wait before falling back to next RNG
     uint256 public requestTimestamp; // Timestamp of the current request
@@ -27,14 +27,14 @@ contract RNGWithFallback is IRNG {
     // *            Constructor            * //
     // ************************************* //
 
-    /// @param _governor Governor address
+    /// @param _owner Owner address
     /// @param _consumer Consumer address
     /// @param _fallbackTimeoutSeconds Time in seconds to wait before falling back to next RNG
     /// @param _rng The RNG address (e.g. Chainlink)
-    constructor(address _governor, address _consumer, uint256 _fallbackTimeoutSeconds, IRNG _rng) {
+    constructor(address _owner, address _consumer, uint256 _fallbackTimeoutSeconds, IRNG _rng) {
         if (address(_rng) == address(0)) revert InvalidDefaultRNG();
 
-        governor = _governor;
+        owner = _owner;
         consumer = _consumer;
         fallbackTimeoutSeconds = _fallbackTimeoutSeconds;
         rng = _rng;
@@ -44,8 +44,8 @@ contract RNGWithFallback is IRNG {
     // *        Function Modifiers         * //
     // ************************************* //
 
-    modifier onlyByGovernor() {
-        if (governor != msg.sender) revert GovernorOnly();
+    modifier onlyByOwner() {
+        if (owner != msg.sender) revert OwnerOnly();
         _;
     }
 
@@ -58,21 +58,21 @@ contract RNGWithFallback is IRNG {
     // *         Governance Functions      * //
     // ************************************* //
 
-    /// @dev Change the governor
-    /// @param _newGovernor Address of the new governor
-    function changeGovernor(address _newGovernor) external onlyByGovernor {
-        governor = _newGovernor;
+    /// @dev Change the owner
+    /// @param _newOwner Address of the new owner
+    function changeOwner(address _newOwner) external onlyByOwner {
+        owner = _newOwner;
     }
 
     /// @dev Change the consumer
     /// @param _consumer Address of the new consumer
-    function changeConsumer(address _consumer) external onlyByGovernor {
+    function changeConsumer(address _consumer) external onlyByOwner {
         consumer = _consumer;
     }
 
     /// @dev Change the fallback timeout
     /// @param _fallbackTimeoutSeconds New timeout in seconds
-    function changeFallbackTimeout(uint256 _fallbackTimeoutSeconds) external onlyByGovernor {
+    function changeFallbackTimeout(uint256 _fallbackTimeoutSeconds) external onlyByOwner {
         fallbackTimeoutSeconds = _fallbackTimeoutSeconds;
         emit FallbackTimeoutChanged(_fallbackTimeoutSeconds);
     }
diff --git a/contracts/src/rng/RandomizerRNG.sol b/contracts/src/rng/RandomizerRNG.sol
index 96cbe6321..648ce5c3d 100644
--- a/contracts/src/rng/RandomizerRNG.sol
+++ b/contracts/src/rng/RandomizerRNG.sol
@@ -12,7 +12,7 @@ contract RandomizerRNG is IRNG {
     // *             Storage               * //
     // ************************************* //
 
-    address public governor; // The address that can withdraw funds.
+    address public owner; // The address that can withdraw funds.
     address public consumer; // The address that can request random numbers.
     IRandomizer public randomizer; // Randomizer address.
     uint256 public callbackGasLimit; // Gas limit for the Randomizer.ai callback.
@@ -36,8 +36,8 @@ contract RandomizerRNG is IRNG {
     // *        Function Modifiers         * //
     // ************************************* //
 
-    modifier onlyByGovernor() {
-        if (governor != msg.sender) revert GovernorOnly();
+    modifier onlyByOwner() {
+        if (owner != msg.sender) revert OwnerOnly();
         _;
     }
 
@@ -51,11 +51,11 @@ contract RandomizerRNG is IRNG {
     // ************************************* //
 
     /// @dev Constructor
-    /// @param _governor The Governor of the contract.
+    /// @param _owner The Owner of the contract.
     /// @param _consumer The address that can request random numbers.
     /// @param _randomizer The Randomizer.ai oracle contract.
-    constructor(address _governor, address _consumer, IRandomizer _randomizer) {
-        governor = _governor;
+    constructor(address _owner, address _consumer, IRandomizer _randomizer) {
+        owner = _owner;
         consumer = _consumer;
         randomizer = _randomizer;
         callbackGasLimit = 50000;
@@ -65,33 +65,33 @@ contract RandomizerRNG is IRNG {
     // *      Governance      * //
     // ************************ //
 
-    /// @dev Changes the governor of the contract.
-    /// @param _governor The new governor.
-    function changeGovernor(address _governor) external onlyByGovernor {
-        governor = _governor;
+    /// @dev Changes the owner of the contract.
+    /// @param _owner The new owner.
+    function changeOwner(address _owner) external onlyByOwner {
+        owner = _owner;
     }
 
     /// @dev Changes the consumer of the RNG.
     /// @param _consumer The new consumer.
-    function changeConsumer(address _consumer) external onlyByGovernor {
+    function changeConsumer(address _consumer) external onlyByOwner {
         consumer = _consumer;
     }
 
     /// @dev Change the Randomizer callback gas limit.
     /// @param _callbackGasLimit the new limit.
-    function setCallbackGasLimit(uint256 _callbackGasLimit) external onlyByGovernor {
+    function setCallbackGasLimit(uint256 _callbackGasLimit) external onlyByOwner {
         callbackGasLimit = _callbackGasLimit;
     }
 
     /// @dev Change the Randomizer address.
     /// @param _randomizer the new Randomizer address.
-    function setRandomizer(address _randomizer) external onlyByGovernor {
+    function setRandomizer(address _randomizer) external onlyByOwner {
         randomizer = IRandomizer(_randomizer);
     }
 
-    /// @dev Allows the governor to withdraw randomizer funds.
+    /// @dev Allows the owner to withdraw randomizer funds.
     /// @param _amount Amount to withdraw in wei.
-    function randomizerWithdraw(uint256 _amount) external onlyByGovernor {
+    function randomizerWithdraw(uint256 _amount) external onlyByOwner {
         randomizer.clientWithdrawTo(msg.sender, _amount);
     }
 
diff --git a/contracts/src/token/Faucet.sol b/contracts/src/token/Faucet.sol
index 092f93891..b64a7e2ab 100644
--- a/contracts/src/token/Faucet.sol
+++ b/contracts/src/token/Faucet.sol
@@ -10,7 +10,7 @@ contract Faucet {
     // ************************************* //
 
     IERC20 public token;
-    address public governor;
+    address public owner;
     mapping(address => bool) public withdrewAlready;
     uint256 public amount = 10_000 ether;
 
@@ -18,8 +18,8 @@ contract Faucet {
     // *        Function Modifiers         * //
     // ************************************* //
 
-    modifier onlyByGovernor() {
-        require(address(governor) == msg.sender, "Access not allowed: Governor only.");
+    modifier onlyByOwner() {
+        require(address(owner) == msg.sender, "Access not allowed: Owner only.");
         _;
     }
 
@@ -29,23 +29,23 @@ contract Faucet {
 
     constructor(IERC20 _token) {
         token = _token;
-        governor = msg.sender;
+        owner = msg.sender;
     }
 
     // ************************************* //
     // *             Governance            * //
     // ************************************* //
 
-    function changeGovernor(address _governor) public onlyByGovernor {
-        governor = _governor;
+    function changeOwner(address _owner) public onlyByOwner {
+        owner = _owner;
     }
 
-    function changeAmount(uint256 _amount) public onlyByGovernor {
+    function changeAmount(uint256 _amount) public onlyByOwner {
         amount = _amount;
     }
 
-    function withdraw() public onlyByGovernor {
-        token.transfer(governor, token.balanceOf(address(this)));
+    function withdraw() public onlyByOwner {
+        token.transfer(owner, token.balanceOf(address(this)));
     }
 
     // ************************************* //
diff --git a/contracts/test/arbitration/staking-neo.ts b/contracts/test/arbitration/staking-neo.ts
index 696935b40..5537742a6 100644
--- a/contracts/test/arbitration/staking-neo.ts
+++ b/contracts/test/arbitration/staking-neo.ts
@@ -359,8 +359,8 @@ describe("Staking", async () => {
       await deploy();
     });
 
-    it("Should not allow anyone except the guardian or the governor to pause", async () => {
-      await expect(core.connect(juror).pause()).to.be.revertedWithCustomError(core, "GuardianOrGovernorOnly");
+    it("Should not allow anyone except the guardian or the owner to pause", async () => {
+      await expect(core.connect(juror).pause()).to.be.revertedWithCustomError(core, "GuardianOrOwnerOnly");
     });
 
     it("Should allow the guardian to pause", async () => {
@@ -368,7 +368,7 @@ describe("Staking", async () => {
       expect(await core.paused()).to.equal(true);
     });
 
-    it("Should allow the governor to pause", async () => {
+    it("Should allow the owner to pause", async () => {
       expect(await core.pause()).to.emit(core, "Paused");
       expect(await core.paused()).to.equal(true);
     });
@@ -384,8 +384,8 @@ describe("Staking", async () => {
       await core.connect(guardian).pause();
     });
 
-    it("Should allow only the governor to unpause", async () => {
-      await expect(core.connect(guardian).unpause()).to.be.revertedWithCustomError(core, "GovernorOnly");
+    it("Should allow only the owner to unpause", async () => {
+      await expect(core.connect(guardian).unpause()).to.be.revertedWithCustomError(core, "OwnerOnly");
       expect(await core.unpause()).to.emit(core, "Unpaused");
       expect(await core.paused()).to.equal(false);
     });
diff --git a/contracts/test/evidence/index.ts b/contracts/test/evidence/index.ts
index bc3f4ff3b..60c1cb0f5 100644
--- a/contracts/test/evidence/index.ts
+++ b/contracts/test/evidence/index.ts
@@ -67,7 +67,7 @@ describe("Home Evidence contract", async () => {
     const EvidenceModule = await ethers.getContractFactory("ModeratedEvidenceModule");
     evidenceModule = await EvidenceModule.deploy(
       arbitrator.target,
-      deployer.address, // governor
+      deployer.address, // owner
       disputeTemplateRegistry.target,
       totalCostMultiplier,
       initialDepositMultiplier,
@@ -80,10 +80,10 @@ describe("Home Evidence contract", async () => {
 
   describe("Governance", async () => {
     it("Should change parameters correctly", async () => {
-      const newGovernor = await user2.getAddress();
-      await evidenceModule.changeGovernor(newGovernor);
-      expect(await evidenceModule.governor()).to.equal(newGovernor);
-      await evidenceModule.connect(user2).changeGovernor(await deployer.getAddress());
+      const newOwner = await user2.getAddress();
+      await evidenceModule.changeOwner(newOwner);
+      expect(await evidenceModule.owner()).to.equal(newOwner);
+      await evidenceModule.connect(user2).changeOwner(await deployer.getAddress());
 
       await evidenceModule.changeInitialDepositMultiplier(1);
       expect(await evidenceModule.initialDepositMultiplier()).to.equal(1);
@@ -117,29 +117,29 @@ describe("Home Evidence contract", async () => {
       expect(newArbitratorData.arbitratorExtraData).to.equal(newArbitratorExtraData, "Wrong extraData");
     });
 
-    it("Should revert if the caller is not the governor", async () => {
-      await expect(evidenceModule.connect(user2).changeGovernor(await user2.getAddress())).to.be.revertedWith(
-        "The caller must be the governor"
+    it("Should revert if the caller is not the owner", async () => {
+      await expect(evidenceModule.connect(user2).changeOwner(await user2.getAddress())).to.be.revertedWith(
+        "The caller must be the owner"
       );
 
       await expect(evidenceModule.connect(user2).changeInitialDepositMultiplier(0)).to.be.revertedWith(
-        "The caller must be the governor"
+        "The caller must be the owner"
       );
 
       await expect(evidenceModule.connect(user2).changeTotalCostMultiplier(0)).to.be.revertedWith(
-        "The caller must be the governor"
+        "The caller must be the owner"
       );
 
       await expect(evidenceModule.connect(user2).changeBondTimeout(0)).to.be.revertedWith(
-        "The caller must be the governor"
+        "The caller must be the owner"
       );
 
       await expect(evidenceModule.connect(user2).changeDisputeTemplate(disputeTemplate, "")).to.be.revertedWith(
-        "The caller must be the governor"
+        "The caller must be the owner"
       );
 
       await expect(evidenceModule.connect(user2).changeArbitratorExtraData(arbitratorExtraData)).to.be.revertedWith(
-        "The caller must be the governor"
+        "The caller must be the owner"
       );
     });
   });
diff --git a/contracts/test/foundry/KlerosCore.t.sol b/contracts/test/foundry/KlerosCore.t.sol
index 62a0b4de1..30e84abdc 100644
--- a/contracts/test/foundry/KlerosCore.t.sol
+++ b/contracts/test/foundry/KlerosCore.t.sol
@@ -33,7 +33,7 @@ contract KlerosCoreTest is Test {
     TestERC20 wNative;
     ArbitrableExample arbitrable;
     DisputeTemplateRegistry registry;
-    address governor;
+    address owner;
     address guardian;
     address staker1;
     address staker2;
@@ -69,7 +69,7 @@ contract KlerosCoreTest is Test {
         feeToken = new TestERC20("Test", "TST");
         wNative = new TestERC20("wrapped ETH", "wETH");
 
-        governor = msg.sender;
+        owner = msg.sender;
         guardian = vm.addr(1);
         staker1 = vm.addr(2);
         staker2 = vm.addr(3);
@@ -103,7 +103,7 @@ contract KlerosCoreTest is Test {
 
         bytes memory initDataDk = abi.encodeWithSignature(
             "initialize(address,address,address)",
-            governor,
+            owner,
             address(proxyCore),
             address(wNative)
         );
@@ -113,7 +113,7 @@ contract KlerosCoreTest is Test {
 
         bytes memory initDataSm = abi.encodeWithSignature(
             "initialize(address,address,uint256,uint256,address)",
-            governor,
+            owner,
             address(proxyCore),
             minStakingTime,
             maxDrawingTime,
@@ -122,12 +122,12 @@ contract KlerosCoreTest is Test {
 
         UUPSProxy proxySm = new UUPSProxy(address(smLogic), initDataSm);
         sortitionModule = SortitionModuleMock(address(proxySm));
-        vm.prank(governor);
+        vm.prank(owner);
         rng.changeConsumer(address(sortitionModule));
 
         core = KlerosCoreMock(address(proxyCore));
         core.initialize(
-            governor,
+            owner,
             guardian,
             pinakion,
             jurorProsecutionModule,
@@ -148,7 +148,7 @@ contract KlerosCoreTest is Test {
         templateDataMappings = "BBB";
         arbitratorExtraData = abi.encodePacked(uint256(GENERAL_COURT), DEFAULT_NB_OF_JURORS, DISPUTE_KIT_CLASSIC);
 
-        bytes memory initDataRegistry = abi.encodeWithSignature("initialize(address)", governor);
+        bytes memory initDataRegistry = abi.encodeWithSignature("initialize(address)", owner);
         UUPSProxy proxyRegistry = new UUPSProxy(address(registryLogic), initDataRegistry);
         registry = DisputeTemplateRegistry(address(proxyRegistry));
 
@@ -163,7 +163,7 @@ contract KlerosCoreTest is Test {
     }
 
     function test_initialize() public {
-        assertEq(core.governor(), msg.sender, "Wrong governor");
+        assertEq(core.owner(), msg.sender, "Wrong owner");
         assertEq(core.guardian(), guardian, "Wrong guardian");
         assertEq(address(core.pinakion()), address(pinakion), "Wrong pinakion address");
         assertEq(core.jurorProsecutionModule(), jurorProsecutionModule, "Wrong jurorProsecutionModule address");
@@ -228,16 +228,16 @@ contract KlerosCoreTest is Test {
         assertEq(pinakion.name(), "Pinakion", "Wrong token name");
         assertEq(pinakion.symbol(), "PNK", "Wrong token symbol");
         assertEq(pinakion.totalSupply(), 1000000 ether, "Wrong total supply");
-        assertEq(pinakion.balanceOf(msg.sender), 999998 ether, "Wrong token balance of governor");
+        assertEq(pinakion.balanceOf(msg.sender), 999998 ether, "Wrong token balance of owner");
         assertEq(pinakion.balanceOf(staker1), 1 ether, "Wrong token balance of staker1");
         assertEq(pinakion.allowance(staker1, address(core)), 1 ether, "Wrong allowance for staker1");
         assertEq(pinakion.balanceOf(staker2), 1 ether, "Wrong token balance of staker2");
         assertEq(pinakion.allowance(staker2, address(core)), 1 ether, "Wrong allowance for staker2");
 
-        assertEq(disputeKit.governor(), msg.sender, "Wrong DK governor");
+        assertEq(disputeKit.owner(), msg.sender, "Wrong DK owner");
         assertEq(address(disputeKit.core()), address(core), "Wrong core in DK");
 
-        assertEq(sortitionModule.governor(), msg.sender, "Wrong SM governor");
+        assertEq(sortitionModule.owner(), msg.sender, "Wrong SM owner");
         assertEq(address(sortitionModule.core()), address(core), "Wrong core in SM");
         assertEq(uint256(sortitionModule.phase()), uint256(ISortitionModule.Phase.staking), "Phase should be 0");
         assertEq(sortitionModule.minStakingTime(), 18, "Wrong minStakingTime");
@@ -264,7 +264,7 @@ contract KlerosCoreTest is Test {
         DisputeKitClassic dkLogic = new DisputeKitClassic();
         pinakion = new PNK();
 
-        governor = msg.sender;
+        owner = msg.sender;
         guardian = vm.addr(1);
         staker1 = vm.addr(2);
         other = vm.addr(9);
@@ -290,7 +290,7 @@ contract KlerosCoreTest is Test {
 
         bytes memory initDataDk = abi.encodeWithSignature(
             "initialize(address,address,address)",
-            governor,
+            owner,
             address(proxyCore),
             address(wNative)
         );
@@ -300,7 +300,7 @@ contract KlerosCoreTest is Test {
 
         bytes memory initDataSm = abi.encodeWithSignature(
             "initialize(address,address,uint256,uint256,address)",
-            governor,
+            owner,
             address(proxyCore),
             minStakingTime,
             maxDrawingTime,
@@ -309,7 +309,7 @@ contract KlerosCoreTest is Test {
 
         UUPSProxy proxySm = new UUPSProxy(address(smLogic), initDataSm);
         sortitionModule = SortitionModuleMock(address(proxySm));
-        vm.prank(governor);
+        vm.prank(owner);
         rng.changeConsumer(address(sortitionModule));
 
         core = KlerosCoreMock(address(proxyCore));
@@ -333,7 +333,7 @@ contract KlerosCoreTest is Test {
         vm.expectEmit(true, true, true, true);
         emit KlerosCoreBase.DisputeKitEnabled(GENERAL_COURT, DISPUTE_KIT_CLASSIC, true);
         core.initialize(
-            governor,
+            owner,
             guardian,
             pinakion,
             jurorProsecutionModule,
@@ -352,109 +352,109 @@ contract KlerosCoreTest is Test {
     // ****************************************** //
 
     function test_pause() public {
-        vm.expectRevert(KlerosCoreBase.GuardianOrGovernorOnly.selector);
+        vm.expectRevert(KlerosCoreBase.GuardianOrOwnerOnly.selector);
         vm.prank(other);
         core.pause();
-        // Note that we must explicitly switch to the governor/guardian address to make the call, otherwise Foundry treats UUPS proxy as msg.sender.
+        // Note that we must explicitly switch to the owner/guardian address to make the call, otherwise Foundry treats UUPS proxy as msg.sender.
         vm.prank(guardian);
         vm.expectEmit(true, true, true, true);
         emit KlerosCoreBase.Paused();
         core.pause();
         assertEq(core.paused(), true, "Wrong paused value");
-        // Switch between governor and guardian to test both. WhenNotPausedOnly modifier is triggered after governor's check.
-        vm.prank(governor);
+        // Switch between owner and guardian to test both. WhenNotPausedOnly modifier is triggered after owner's check.
+        vm.prank(owner);
         vm.expectRevert(KlerosCoreBase.WhenNotPausedOnly.selector);
         core.pause();
     }
 
     function test_unpause() public {
-        vm.expectRevert(KlerosCoreBase.GovernorOnly.selector);
+        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
         vm.prank(other);
         core.unpause();
 
         vm.expectRevert(KlerosCoreBase.WhenPausedOnly.selector);
-        vm.prank(governor);
+        vm.prank(owner);
         core.unpause();
 
-        vm.prank(governor);
+        vm.prank(owner);
         core.pause();
-        vm.prank(governor);
+        vm.prank(owner);
         vm.expectEmit(true, true, true, true);
         emit KlerosCoreBase.Unpaused();
         core.unpause();
         assertEq(core.paused(), false, "Wrong paused value");
     }
 
-    function test_executeGovernorProposal() public {
-        bytes memory data = abi.encodeWithSignature("changeGovernor(address)", other);
-        vm.expectRevert(KlerosCoreBase.GovernorOnly.selector);
+    function test_executeOwnerProposal() public {
+        bytes memory data = abi.encodeWithSignature("changeOwner(address)", other);
+        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
         vm.prank(other);
-        core.executeGovernorProposal(address(core), 0, data);
+        core.executeOwnerProposal(address(core), 0, data);
 
         vm.expectRevert(KlerosCoreBase.UnsuccessfulCall.selector);
-        vm.prank(governor);
-        core.executeGovernorProposal(address(core), 0, data); // It'll fail because the core is not its own governor
+        vm.prank(owner);
+        core.executeOwnerProposal(address(core), 0, data); // It'll fail because the core is not its own owner
 
-        vm.prank(governor);
-        core.changeGovernor(payable(address(core)));
+        vm.prank(owner);
+        core.changeOwner(payable(address(core)));
         vm.prank(address(core));
-        core.executeGovernorProposal(address(core), 0, data);
-        assertEq(core.governor(), other, "Wrong governor");
+        core.executeOwnerProposal(address(core), 0, data);
+        assertEq(core.owner(), other, "Wrong owner");
     }
 
-    function test_changeGovernor() public {
-        vm.expectRevert(KlerosCoreBase.GovernorOnly.selector);
+    function test_changeOwner() public {
+        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
         vm.prank(other);
-        core.changeGovernor(payable(other));
-        vm.prank(governor);
-        core.changeGovernor(payable(other));
-        assertEq(core.governor(), other, "Wrong governor");
+        core.changeOwner(payable(other));
+        vm.prank(owner);
+        core.changeOwner(payable(other));
+        assertEq(core.owner(), other, "Wrong owner");
     }
 
     function test_changeGuardian() public {
-        vm.expectRevert(KlerosCoreBase.GovernorOnly.selector);
+        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
         vm.prank(other);
         core.changeGuardian(other);
-        vm.prank(governor);
+        vm.prank(owner);
         core.changeGuardian(other);
         assertEq(core.guardian(), other, "Wrong guardian");
     }
 
     function test_changePinakion() public {
         PNK fakePNK = new PNK();
-        vm.expectRevert(KlerosCoreBase.GovernorOnly.selector);
+        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
         vm.prank(other);
         core.changePinakion(fakePNK);
-        vm.prank(governor);
+        vm.prank(owner);
         core.changePinakion(fakePNK);
         assertEq(address(core.pinakion()), address(fakePNK), "Wrong PNK");
     }
 
     function test_changeJurorProsecutionModule() public {
-        vm.expectRevert(KlerosCoreBase.GovernorOnly.selector);
+        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
         vm.prank(other);
         core.changeJurorProsecutionModule(other);
-        vm.prank(governor);
+        vm.prank(owner);
         core.changeJurorProsecutionModule(other);
         assertEq(core.jurorProsecutionModule(), other, "Wrong jurorProsecutionModule");
     }
 
     function test_changeSortitionModule() public {
         SortitionModuleMock fakeSM = new SortitionModuleMock();
-        vm.expectRevert(KlerosCoreBase.GovernorOnly.selector);
+        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
         vm.prank(other);
         core.changeSortitionModule(fakeSM);
-        vm.prank(governor);
+        vm.prank(owner);
         core.changeSortitionModule(fakeSM);
         assertEq(address(core.sortitionModule()), address(fakeSM), "Wrong sortitionModule");
     }
 
     function test_addNewDisputeKit() public {
         DisputeKitSybilResistant newDK = new DisputeKitSybilResistant();
-        vm.expectRevert(KlerosCoreBase.GovernorOnly.selector);
+        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
         vm.prank(other);
         core.addNewDisputeKit(newDK);
-        vm.prank(governor);
+        vm.prank(owner);
         vm.expectEmit(true, true, true, true);
         emit KlerosCoreBase.DisputeKitCreated(2, newDK);
         core.addNewDisputeKit(newDK);
@@ -463,7 +463,7 @@ contract KlerosCoreTest is Test {
     }
 
     function test_createCourt() public {
-        vm.expectRevert(KlerosCoreBase.GovernorOnly.selector);
+        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
         vm.prank(other);
         uint256[] memory supportedDK = new uint256[](2);
         supportedDK[0] = DISPUTE_KIT_CLASSIC;
@@ -481,7 +481,7 @@ contract KlerosCoreTest is Test {
         );
 
         vm.expectRevert(KlerosCoreBase.MinStakeLowerThanParentCourt.selector);
-        vm.prank(governor);
+        vm.prank(owner);
         core.createCourt(
             GENERAL_COURT,
             true, // Hidden votes
@@ -495,7 +495,7 @@ contract KlerosCoreTest is Test {
         );
 
         vm.expectRevert(KlerosCoreBase.UnsupportedDisputeKit.selector);
-        vm.prank(governor);
+        vm.prank(owner);
         uint256[] memory emptySupportedDK = new uint256[](0);
         core.createCourt(
             GENERAL_COURT,
@@ -510,7 +510,7 @@ contract KlerosCoreTest is Test {
         );
 
         vm.expectRevert(KlerosCoreBase.InvalidForkingCourtAsParent.selector);
-        vm.prank(governor);
+        vm.prank(owner);
         core.createCourt(
             FORKING_COURT,
             true, // Hidden votes
@@ -527,7 +527,7 @@ contract KlerosCoreTest is Test {
         badSupportedDK[0] = NULL_DISPUTE_KIT; // Include NULL_DK to check that it reverts
         badSupportedDK[1] = DISPUTE_KIT_CLASSIC;
         vm.expectRevert(KlerosCoreBase.WrongDisputeKitIndex.selector);
-        vm.prank(governor);
+        vm.prank(owner);
         core.createCourt(
             GENERAL_COURT,
             true, // Hidden votes
@@ -543,7 +543,7 @@ contract KlerosCoreTest is Test {
         badSupportedDK[0] = DISPUTE_KIT_CLASSIC;
         badSupportedDK[1] = 2; // Check out of bounds index
         vm.expectRevert(KlerosCoreBase.WrongDisputeKitIndex.selector);
-        vm.prank(governor);
+        vm.prank(owner);
         core.createCourt(
             GENERAL_COURT,
             true, // Hidden votes
@@ -558,12 +558,12 @@ contract KlerosCoreTest is Test {
 
         // Add new DK to check the requirement for classic DK
         DisputeKitSybilResistant newDK = new DisputeKitSybilResistant();
-        vm.prank(governor);
+        vm.prank(owner);
         core.addNewDisputeKit(newDK);
         badSupportedDK = new uint256[](1);
         badSupportedDK[0] = 2; // Include only sybil resistant dk
         vm.expectRevert(KlerosCoreBase.MustSupportDisputeKitClassic.selector);
-        vm.prank(governor);
+        vm.prank(owner);
         core.createCourt(
             GENERAL_COURT,
             true, // Hidden votes
@@ -576,7 +576,7 @@ contract KlerosCoreTest is Test {
             badSupportedDK
         );
 
-        vm.prank(governor);
+        vm.prank(owner);
         vm.expectEmit(true, true, true, true);
         emit KlerosCoreBase.DisputeKitEnabled(2, DISPUTE_KIT_CLASSIC, true);
         vm.expectEmit(true, true, true, true);
@@ -641,7 +641,7 @@ contract KlerosCoreTest is Test {
 
     function test_changeCourtParameters() public {
         // Create a 2nd court to check the minStake requirements
-        vm.prank(governor);
+        vm.prank(owner);
         uint96 newCourtID = 2;
         uint256[] memory supportedDK = new uint256[](1);
         supportedDK[0] = DISPUTE_KIT_CLASSIC;
@@ -657,7 +657,7 @@ contract KlerosCoreTest is Test {
             supportedDK
         );
 
-        vm.expectRevert(KlerosCoreBase.GovernorOnly.selector);
+        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
         vm.prank(other);
         core.changeCourtParameters(
             GENERAL_COURT,
@@ -669,7 +669,7 @@ contract KlerosCoreTest is Test {
             [uint256(10), uint256(20), uint256(30), uint256(40)] // Times per period
         );
         vm.expectRevert(KlerosCoreBase.MinStakeLowerThanParentCourt.selector);
-        vm.prank(governor);
+        vm.prank(owner);
         // Min stake of a parent became higher than of a child
         core.changeCourtParameters(
             GENERAL_COURT,
@@ -682,7 +682,7 @@ contract KlerosCoreTest is Test {
         );
         // Min stake of a child became lower than of a parent
         vm.expectRevert(KlerosCoreBase.MinStakeLowerThanParentCourt.selector);
-        vm.prank(governor);
+        vm.prank(owner);
         core.changeCourtParameters(
             newCourtID,
             true, // Hidden votes
@@ -693,7 +693,7 @@ contract KlerosCoreTest is Test {
             [uint256(10), uint256(20), uint256(30), uint256(40)] // Times per period
         );
 
-        vm.prank(governor);
+        vm.prank(owner);
         vm.expectEmit(true, true, true, true);
         emit KlerosCoreBase.CourtModified(
             GENERAL_COURT,
@@ -740,38 +740,38 @@ contract KlerosCoreTest is Test {
     function test_enableDisputeKits() public {
         DisputeKitSybilResistant newDK = new DisputeKitSybilResistant();
         uint256 newDkID = 2;
-        vm.prank(governor);
+        vm.prank(owner);
         core.addNewDisputeKit(newDK);
 
-        vm.expectRevert(KlerosCoreBase.GovernorOnly.selector);
+        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
         vm.prank(other);
         uint256[] memory supportedDK = new uint256[](1);
         supportedDK[0] = newDkID;
         core.enableDisputeKits(GENERAL_COURT, supportedDK, true);
 
         vm.expectRevert(KlerosCoreBase.WrongDisputeKitIndex.selector);
-        vm.prank(governor);
+        vm.prank(owner);
         supportedDK[0] = NULL_DISPUTE_KIT;
         core.enableDisputeKits(GENERAL_COURT, supportedDK, true);
 
         vm.expectRevert(KlerosCoreBase.WrongDisputeKitIndex.selector);
-        vm.prank(governor);
+        vm.prank(owner);
         supportedDK[0] = 3; // Out of bounds
         core.enableDisputeKits(GENERAL_COURT, supportedDK, true);
 
         vm.expectRevert(KlerosCoreBase.CannotDisableClassicDK.selector);
-        vm.prank(governor);
+        vm.prank(owner);
         supportedDK[0] = DISPUTE_KIT_CLASSIC;
         core.enableDisputeKits(GENERAL_COURT, supportedDK, false);
 
-        vm.prank(governor);
+        vm.prank(owner);
         vm.expectEmit(true, true, true, true);
         emit KlerosCoreBase.DisputeKitEnabled(GENERAL_COURT, newDkID, true);
         supportedDK[0] = newDkID;
         core.enableDisputeKits(GENERAL_COURT, supportedDK, true);
         assertEq(core.isSupported(GENERAL_COURT, newDkID), true, "New DK should be supported by General court");
 
-        vm.prank(governor);
+        vm.prank(owner);
         vm.expectEmit(true, true, true, true);
         emit KlerosCoreBase.DisputeKitEnabled(GENERAL_COURT, newDkID, false);
         core.enableDisputeKits(GENERAL_COURT, supportedDK, false);
@@ -779,14 +779,14 @@ contract KlerosCoreTest is Test {
     }
 
     function test_changeAcceptedFeeTokens() public {
-        vm.expectRevert(KlerosCoreBase.GovernorOnly.selector);
+        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
         vm.prank(other);
         core.changeAcceptedFeeTokens(feeToken, true);
 
         (bool accepted, , ) = core.currencyRates(feeToken);
         assertEq(accepted, false, "Token should not be accepted yet");
 
-        vm.prank(governor);
+        vm.prank(owner);
         vm.expectEmit(true, true, true, true);
         emit IArbitratorV2.AcceptedFeeToken(feeToken, true);
         core.changeAcceptedFeeTokens(feeToken, true);
@@ -795,7 +795,7 @@ contract KlerosCoreTest is Test {
     }
 
     function test_changeCurrencyRates() public {
-        vm.expectRevert(KlerosCoreBase.GovernorOnly.selector);
+        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
         vm.prank(other);
         core.changeCurrencyRates(feeToken, 100, 200);
 
@@ -803,7 +803,7 @@ contract KlerosCoreTest is Test {
         assertEq(rateInEth, 0, "rateInEth should be 0");
         assertEq(rateDecimals, 0, "rateDecimals should be 0");
 
-        vm.prank(governor);
+        vm.prank(owner);
         vm.expectEmit(true, true, true, true);
         emit IArbitratorV2.NewCurrencyRate(feeToken, 100, 200);
         core.changeCurrencyRates(feeToken, 100, 200);
@@ -833,7 +833,7 @@ contract KlerosCoreTest is Test {
         assertEq(disputeKitID, DISPUTE_KIT_CLASSIC, "Wrong disputeKitID");
 
         // Custom values.
-        vm.startPrank(governor);
+        vm.startPrank(owner);
         core.addNewDisputeKit(disputeKit);
         core.addNewDisputeKit(disputeKit);
         core.addNewDisputeKit(disputeKit);
@@ -852,12 +852,12 @@ contract KlerosCoreTest is Test {
     // *************************************** //
 
     function test_setStake_increase() public {
-        vm.prank(governor);
+        vm.prank(owner);
         core.pause();
         vm.expectRevert(KlerosCoreBase.WhenNotPausedOnly.selector);
         vm.prank(staker1);
         core.setStake(GENERAL_COURT, 1000);
-        vm.prank(governor);
+        vm.prank(owner);
         core.unpause();
 
         vm.expectRevert(KlerosCoreBase.StakingNotPossibleInThisCourt.selector);
@@ -898,8 +898,8 @@ contract KlerosCoreTest is Test {
         assertEq(pinakion.balanceOf(staker1), 999999999999998999, "Wrong token balance of staker1"); // 1 eth - 1001 wei
         assertEq(pinakion.allowance(staker1, address(core)), 999999999999998999, "Wrong allowance for staker1");
 
-        vm.expectRevert(KlerosCoreBase.StakingTransferFailed.selector); // This  error will be caught because governor didn't approve any tokens for KlerosCore
-        vm.prank(governor);
+        vm.expectRevert(KlerosCoreBase.StakingTransferFailed.selector); // This  error will be caught because owner didn't approve any tokens for KlerosCore
+        vm.prank(owner);
         core.setStake(GENERAL_COURT, 1000);
 
         // Increase stake one more time to verify the correct behavior
@@ -985,7 +985,7 @@ contract KlerosCoreTest is Test {
 
         // Create 4 courts to check the require
         for (uint96 i = GENERAL_COURT; i <= 4; i++) {
-            vm.prank(governor);
+            vm.prank(owner);
             core.createCourt(
                 GENERAL_COURT,
                 true,
@@ -1219,7 +1219,7 @@ contract KlerosCoreTest is Test {
         sortitionModule.passPhase(); // Staking. Delayed stakes can be executed now
 
         vm.prank(address(core));
-        pinakion.transfer(governor, 10000); // Dispose of the tokens of 2nd staker to make the execution fail for the 2nd delayed stake
+        pinakion.transfer(owner, 10000); // Dispose of the tokens of 2nd staker to make the execution fail for the 2nd delayed stake
         assertEq(pinakion.balanceOf(address(core)), 0, "Wrong token balance of the core");
 
         // 2 events should be emitted but the 2nd stake supersedes the first one in the end.
@@ -1257,7 +1257,7 @@ contract KlerosCoreTest is Test {
     function test_setStakeBySortitionModule() public {
         // Note that functionality of this function was checked during delayed stakes execution
         vm.expectRevert(KlerosCoreBase.SortitionModuleOnly.selector);
-        vm.prank(governor);
+        vm.prank(owner);
         core.setStakeBySortitionModule(staker1, GENERAL_COURT, 1000);
     }
 
@@ -1265,27 +1265,27 @@ contract KlerosCoreTest is Test {
         vm.prank(staker1);
         core.setStake(GENERAL_COURT, 12346);
 
-        KlerosCoreSnapshotProxy snapshotProxy = new KlerosCoreSnapshotProxy(governor, IKlerosCore(address(core)));
+        KlerosCoreSnapshotProxy snapshotProxy = new KlerosCoreSnapshotProxy(owner, IKlerosCore(address(core)));
         assertEq(snapshotProxy.name(), "Staked Pinakion", "Wrong name of the proxy token");
         assertEq(snapshotProxy.symbol(), "stPNK", "Wrong symbol of the proxy token");
         assertEq(snapshotProxy.decimals(), 18, "Wrong decimals of the proxy token");
-        assertEq(snapshotProxy.governor(), msg.sender, "Wrong governor");
+        assertEq(snapshotProxy.owner(), msg.sender, "Wrong owner");
         assertEq(address(snapshotProxy.core()), address(core), "Wrong core in snapshot proxy");
         assertEq(snapshotProxy.balanceOf(staker1), 12346, "Wrong stPNK balance");
 
         vm.prank(other);
-        vm.expectRevert(KlerosCoreSnapshotProxy.GovernorOnly.selector);
+        vm.expectRevert(KlerosCoreSnapshotProxy.OwnerOnly.selector);
         snapshotProxy.changeCore(IKlerosCore(other));
-        vm.prank(governor);
+        vm.prank(owner);
         snapshotProxy.changeCore(IKlerosCore(other));
         assertEq(address(snapshotProxy.core()), other, "Wrong core in snapshot proxy after change");
 
         vm.prank(other);
-        vm.expectRevert(KlerosCoreSnapshotProxy.GovernorOnly.selector);
-        snapshotProxy.changeGovernor(other);
-        vm.prank(governor);
-        snapshotProxy.changeGovernor(other);
-        assertEq(snapshotProxy.governor(), other, "Wrong governor after change");
+        vm.expectRevert(KlerosCoreSnapshotProxy.OwnerOnly.selector);
+        snapshotProxy.changeOwner(other);
+        vm.prank(owner);
+        snapshotProxy.changeOwner(other);
+        assertEq(snapshotProxy.owner(), other, "Wrong owner after change");
     }
 
     // *************************************** //
@@ -1302,9 +1302,9 @@ contract KlerosCoreTest is Test {
         supportedDK[0] = DISPUTE_KIT_CLASSIC;
         bytes memory newExtraData = abi.encodePacked(uint256(newCourtID), newNbJurors, newDkID);
 
-        vm.prank(governor);
+        vm.prank(owner);
         core.addNewDisputeKit(disputeKit); // Just add the same dk to avoid dealing with initialization
-        vm.prank(governor);
+        vm.prank(owner);
         core.createCourt(
             GENERAL_COURT,
             true, // Hidden votes
@@ -1327,7 +1327,7 @@ contract KlerosCoreTest is Test {
         vm.prank(disputer);
         arbitrable.createDispute{value: 0.04 ether}("Action");
 
-        vm.prank(governor);
+        vm.prank(owner);
         supportedDK = new uint256[](1);
         supportedDK[0] = newDkID;
         core.enableDisputeKits(newCourtID, supportedDK, true);
@@ -1401,9 +1401,9 @@ contract KlerosCoreTest is Test {
         vm.prank(disputer);
         arbitrable.createDispute("Action", 0.18 ether);
 
-        vm.prank(governor);
+        vm.prank(owner);
         core.changeAcceptedFeeTokens(feeToken, true);
-        vm.prank(governor);
+        vm.prank(owner);
         core.changeCurrencyRates(feeToken, 500, 3);
 
         vm.expectRevert(KlerosCoreBase.ArbitrationFeesNotEnough.selector);
@@ -1491,7 +1491,7 @@ contract KlerosCoreTest is Test {
         uint256 roundID = 0;
 
         // Create a child court and stake exclusively there to check that parent courts hold drawing power.
-        vm.prank(governor);
+        vm.prank(owner);
         uint256[] memory supportedDK = new uint256[](1);
         supportedDK[0] = DISPUTE_KIT_CLASSIC;
         core.createCourt(
@@ -1542,7 +1542,7 @@ contract KlerosCoreTest is Test {
     function test_castCommit() public {
         // Change hidden votes in general court
         uint256 disputeID = 0;
-        vm.prank(governor);
+        vm.prank(owner);
         core.changeCourtParameters(
             GENERAL_COURT,
             true, // Hidden votes
@@ -1653,7 +1653,7 @@ contract KlerosCoreTest is Test {
     function test_castCommit_timeoutCheck() public {
         // Change hidden votes in general court
         uint256 disputeID = 0;
-        vm.prank(governor);
+        vm.prank(owner);
         core.changeCourtParameters(
             GENERAL_COURT,
             true, // Hidden votes
@@ -1857,7 +1857,7 @@ contract KlerosCoreTest is Test {
     function test_castVote_quickPassPeriod() public {
         // Change hidden votes in general court
         uint256 disputeID = 0;
-        vm.prank(governor);
+        vm.prank(owner);
         core.changeCourtParameters(
             GENERAL_COURT,
             true, // Hidden votes
@@ -2116,7 +2116,7 @@ contract KlerosCoreTest is Test {
         // Create a new DK and court to check the switch
         bytes memory initDataDk = abi.encodeWithSignature(
             "initialize(address,address,address)",
-            governor,
+            owner,
             address(core),
             address(wNative)
         );
@@ -2130,9 +2130,9 @@ contract KlerosCoreTest is Test {
         supportedDK[0] = DISPUTE_KIT_CLASSIC;
         bytes memory newExtraData = abi.encodePacked(uint256(newCourtID), DEFAULT_NB_OF_JURORS, newDkID);
 
-        vm.prank(governor);
+        vm.prank(owner);
         core.addNewDisputeKit(newDisputeKit);
-        vm.prank(governor);
+        vm.prank(owner);
         core.createCourt(
             GENERAL_COURT,
             hiddenVotes,
@@ -2147,7 +2147,7 @@ contract KlerosCoreTest is Test {
 
         arbitrable.changeArbitratorExtraData(newExtraData);
 
-        vm.prank(governor);
+        vm.prank(owner);
         supportedDK = new uint256[](1);
         supportedDK[0] = newDkID;
         core.enableDisputeKits(newCourtID, supportedDK, true);
@@ -2308,11 +2308,11 @@ contract KlerosCoreTest is Test {
         vm.warp(block.timestamp + timesPerPeriod[3]);
         core.passPeriod(disputeID); // Execution
 
-        vm.prank(governor);
+        vm.prank(owner);
         core.pause();
         vm.expectRevert(KlerosCoreBase.WhenNotPausedOnly.selector);
         core.execute(disputeID, 0, 1);
-        vm.prank(governor);
+        vm.prank(owner);
         core.unpause();
 
         assertEq(disputeKit.getCoherentCount(disputeID, 0), 2, "Wrong coherent count");
@@ -2446,8 +2446,8 @@ contract KlerosCoreTest is Test {
         assertEq(disputeKit.getDegreeOfCoherencePenalty(disputeID, 0, 1, 0, 0), 0, "Wrong penalty coherence 1 vote ID");
         assertEq(disputeKit.getDegreeOfCoherencePenalty(disputeID, 0, 2, 0, 0), 0, "Wrong penalty coherence 2 vote ID");
 
-        uint256 governorBalance = governor.balance;
-        uint256 governorTokenBalance = pinakion.balanceOf(governor);
+        uint256 ownerBalance = owner.balance;
+        uint256 ownerTokenBalance = pinakion.balanceOf(owner);
 
         vm.expectEmit(true, true, true, true);
         emit KlerosCoreBase.LeftoverRewardSent(disputeID, 0, 3000, 0.09 ether, IERC20(address(0)));
@@ -2460,16 +2460,16 @@ contract KlerosCoreTest is Test {
 
         assertEq(address(core).balance, 0, "Wrong balance of the core");
         assertEq(staker1.balance, 0, "Wrong balance of the staker1");
-        assertEq(governor.balance, governorBalance + 0.09 ether, "Wrong balance of the governor");
+        assertEq(owner.balance, ownerBalance + 0.09 ether, "Wrong balance of the owner");
 
         assertEq(pinakion.balanceOf(address(core)), 17000, "Wrong token balance of the core");
         assertEq(pinakion.balanceOf(staker1), 999999999999980000, "Wrong token balance of staker1");
-        assertEq(pinakion.balanceOf(governor), governorTokenBalance + 3000, "Wrong token balance of governor");
+        assertEq(pinakion.balanceOf(owner), ownerTokenBalance + 3000, "Wrong token balance of owner");
     }
 
     function test_execute_UnstakeInactive() public {
         // Create a 2nd court so unstaking is done in multiple courts.
-        vm.prank(governor);
+        vm.prank(owner);
         uint256[] memory supportedDK = new uint256[](1);
         supportedDK[0] = DISPUTE_KIT_CLASSIC;
         core.createCourt(
@@ -2517,7 +2517,7 @@ contract KlerosCoreTest is Test {
         vm.warp(block.timestamp + timesPerPeriod[3]);
         core.passPeriod(disputeID); // Execution
 
-        uint256 governorTokenBalance = pinakion.balanceOf(governor);
+        uint256 ownerTokenBalance = pinakion.balanceOf(owner);
 
         // Note that these events are emitted only after the first iteration of execute() therefore the juror has been penalized only for 1000 PNK her.
         vm.expectEmit(true, true, true, true);
@@ -2527,8 +2527,8 @@ contract KlerosCoreTest is Test {
         core.execute(disputeID, 0, 3);
 
         assertEq(pinakion.balanceOf(address(core)), 0, "Wrong token balance of the core");
-        assertEq(pinakion.balanceOf(staker1), 999999999999997000, "Wrong token balance of staker1"); // 3000 locked PNK was withheld by the contract and given to governor.
-        assertEq(pinakion.balanceOf(governor), governorTokenBalance + 3000, "Wrong token balance of governor");
+        assertEq(pinakion.balanceOf(staker1), 999999999999997000, "Wrong token balance of staker1"); // 3000 locked PNK was withheld by the contract and given to owner.
+        assertEq(pinakion.balanceOf(owner), ownerTokenBalance + 3000, "Wrong token balance of owner");
 
         (, , , nbCourts) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
         assertEq(nbCourts, 0, "Should unstake from all courts");
@@ -2658,7 +2658,7 @@ contract KlerosCoreTest is Test {
         assertEq(pinakion.balanceOf(staker1), 999999999999999000, "Wrong token balance of staker1");
 
         vm.expectRevert(KlerosCoreBase.SortitionModuleOnly.selector);
-        vm.prank(governor);
+        vm.prank(owner);
         core.transferBySortitionModule(staker1, 1000);
 
         vm.expectEmit(true, true, true, true);
@@ -2680,9 +2680,9 @@ contract KlerosCoreTest is Test {
         vm.prank(disputer);
         feeToken.approve(address(arbitrable), 1 ether);
 
-        vm.prank(governor);
+        vm.prank(owner);
         core.changeAcceptedFeeTokens(feeToken, true);
-        vm.prank(governor);
+        vm.prank(owner);
         core.changeCurrencyRates(feeToken, 500, 3);
 
         vm.prank(disputer);
@@ -2734,9 +2734,9 @@ contract KlerosCoreTest is Test {
         vm.prank(disputer);
         feeToken.approve(address(arbitrable), 1 ether);
 
-        vm.prank(governor);
+        vm.prank(owner);
         core.changeAcceptedFeeTokens(feeToken, true);
-        vm.prank(governor);
+        vm.prank(owner);
         core.changeCurrencyRates(feeToken, 500, 3);
 
         vm.prank(disputer);
@@ -2773,7 +2773,7 @@ contract KlerosCoreTest is Test {
         assertEq(feeToken.balanceOf(address(core)), 0, "Wrong token balance of the core");
         assertEq(feeToken.balanceOf(staker1), 0, "Wrong token balance of staker1");
         assertEq(feeToken.balanceOf(disputer), 0.82 ether, "Wrong token balance of disputer");
-        assertEq(feeToken.balanceOf(governor), 0.18 ether, "Wrong token balance of governor");
+        assertEq(feeToken.balanceOf(owner), 0.18 ether, "Wrong token balance of owner");
     }
 
     function test_executeRuling() public {
@@ -2911,11 +2911,11 @@ contract KlerosCoreTest is Test {
 
         core.executeRuling(disputeID);
 
-        vm.prank(governor);
+        vm.prank(owner);
         core.pause();
         vm.expectRevert(DisputeKitClassicBase.CoreIsPaused.selector);
         disputeKit.withdrawFeesAndRewards(disputeID, payable(staker1), 0, 1);
-        vm.prank(governor);
+        vm.prank(owner);
         core.unpause();
 
         assertEq(crowdfunder1.balance, 9.37 ether, "Wrong balance of the crowdfunder1");
@@ -2940,7 +2940,7 @@ contract KlerosCoreTest is Test {
         // Create a new DK to check castVote.
         bytes memory initDataDk = abi.encodeWithSignature(
             "initialize(address,address,address)",
-            governor,
+            owner,
             address(core),
             address(wNative)
         );
@@ -2948,14 +2948,14 @@ contract KlerosCoreTest is Test {
         UUPSProxy proxyDk = new UUPSProxy(address(dkLogic), initDataDk);
         DisputeKitClassic newDisputeKit = DisputeKitClassic(address(proxyDk));
 
-        vm.prank(governor);
+        vm.prank(owner);
         core.addNewDisputeKit(newDisputeKit);
 
         uint256 newDkID = 2;
         uint256[] memory supportedDK = new uint256[](1);
         bytes memory newExtraData = abi.encodePacked(uint256(GENERAL_COURT), DEFAULT_NB_OF_JURORS, newDkID);
 
-        vm.prank(governor);
+        vm.prank(owner);
         vm.expectEmit(true, true, true, true);
         emit KlerosCoreBase.DisputeKitEnabled(GENERAL_COURT, newDkID, true);
         supportedDK[0] = newDkID;
@@ -3039,13 +3039,13 @@ contract KlerosCoreTest is Test {
         uint256 fallbackTimeout = 100;
         RNGMock rngMock = new RNGMock();
         rngFallback = new RNGWithFallback(msg.sender, address(sortitionModule), fallbackTimeout, rngMock);
-        assertEq(rngFallback.governor(), msg.sender, "Wrong governor");
+        assertEq(rngFallback.owner(), msg.sender, "Wrong owner");
         assertEq(rngFallback.consumer(), address(sortitionModule), "Wrong sortition module address");
         assertEq(address(rngFallback.rng()), address(rngMock), "Wrong RNG in fallback contract");
         assertEq(rngFallback.fallbackTimeoutSeconds(), fallbackTimeout, "Wrong fallback timeout");
         assertEq(rngFallback.requestTimestamp(), 0, "Request timestamp should be 0");
 
-        vm.prank(governor);
+        vm.prank(owner);
         sortitionModule.changeRandomNumberGenerator(rngFallback);
         assertEq(address(sortitionModule.rng()), address(rngFallback), "Wrong RNG address");
 
@@ -3079,7 +3079,7 @@ contract KlerosCoreTest is Test {
         RNGMock rngMock = new RNGMock();
         rngFallback = new RNGWithFallback(msg.sender, address(sortitionModule), fallbackTimeout, rngMock);
 
-        vm.prank(governor);
+        vm.prank(owner);
         sortitionModule.changeRandomNumberGenerator(rngFallback);
         assertEq(address(sortitionModule.rng()), address(rngFallback), "Wrong RNG address");
 
@@ -3107,36 +3107,36 @@ contract KlerosCoreTest is Test {
         rngFallback = new RNGWithFallback(msg.sender, address(sortitionModule), fallbackTimeout, rngMock);
 
         vm.expectRevert(IRNG.ConsumerOnly.selector);
-        vm.prank(governor);
+        vm.prank(owner);
         rngFallback.requestRandomness();
 
         vm.expectRevert(IRNG.ConsumerOnly.selector);
-        vm.prank(governor);
+        vm.prank(owner);
         rngFallback.receiveRandomness();
 
-        vm.expectRevert(IRNG.GovernorOnly.selector);
+        vm.expectRevert(IRNG.OwnerOnly.selector);
         vm.prank(other);
-        rngFallback.changeGovernor(other);
-        vm.prank(governor);
-        rngFallback.changeGovernor(other);
-        assertEq(rngFallback.governor(), other, "Wrong governor");
+        rngFallback.changeOwner(other);
+        vm.prank(owner);
+        rngFallback.changeOwner(other);
+        assertEq(rngFallback.owner(), other, "Wrong owner");
 
-        // Change governor back for convenience
+        // Change owner back for convenience
         vm.prank(other);
-        rngFallback.changeGovernor(governor);
+        rngFallback.changeOwner(owner);
 
-        vm.expectRevert(IRNG.GovernorOnly.selector);
+        vm.expectRevert(IRNG.OwnerOnly.selector);
         vm.prank(other);
         rngFallback.changeConsumer(other);
-        vm.prank(governor);
+        vm.prank(owner);
         rngFallback.changeConsumer(other);
         assertEq(rngFallback.consumer(), other, "Wrong consumer");
 
-        vm.expectRevert(IRNG.GovernorOnly.selector);
+        vm.expectRevert(IRNG.OwnerOnly.selector);
         vm.prank(other);
         rngFallback.changeFallbackTimeout(5);
 
-        vm.prank(governor);
+        vm.prank(owner);
         vm.expectEmit(true, true, true, true);
         emit RNGWithFallback.FallbackTimeoutChanged(5);
         rngFallback.changeFallbackTimeout(5);
diff --git a/contracts/test/proxy/index.ts b/contracts/test/proxy/index.ts
index 12ba6313c..a58886789 100644
--- a/contracts/test/proxy/index.ts
+++ b/contracts/test/proxy/index.ts
@@ -46,7 +46,7 @@ describe("Upgradability", async () => {
     });
 
     describe("Initialization", async () => {
-      it("Governor cannot re-initialize the proxy", async () => {
+      it("Owner cannot re-initialize the proxy", async () => {
         await expect(proxy.connect(deployer).initialize(deployer.address)).to.be.revertedWith(
           "Contract instance has already been initialized"
         );
@@ -79,7 +79,7 @@ describe("Upgradability", async () => {
             .withArgs(nonUpgradeableMock.target);
         });
         it("Should revert if upgrade is performed directly through the implementation", async () => {
-          // In the implementation, the `governor` storage slot is not initialized so `governor === address(0)`, which fails _authorizeUpgrade()
+          // In the implementation, the `owner` storage slot is not initialized so `owner === address(0)`, which fails _authorizeUpgrade()
           const UUPSUpgradeableMockV2Factory = await ethers.getContractFactory("UUPSUpgradeableMockV2");
           const newImplementation = await UUPSUpgradeableMockV2Factory.connect(deployer).deploy();
           await expect(
@@ -89,7 +89,7 @@ describe("Upgradability", async () => {
       });
 
       describe("Authentication", async () => {
-        it("Only the governor (deployer here) can perform upgrades", async () => {
+        it("Only the owner (deployer here) can perform upgrades", async () => {
           // Unauthorized user try to upgrade the implementation
           const UUPSUpgradeableMockV2Factory = await ethers.getContractFactory("UUPSUpgradeableMockV2");
           let upgradable = await UUPSUpgradeableMockV2Factory.connect(user1).deploy();
@@ -97,7 +97,7 @@ describe("Upgradability", async () => {
             "No privilege to upgrade"
           );
 
-          // Governor updates the implementation
+          // Owner updates the implementation
           upgradable = await UUPSUpgradeableMockV2Factory.connect(deployer).deploy();
           await expect(proxy.connect(deployer).upgradeToAndCall(upgradable.target, "0x"))
             .to.emit(proxy, "Upgraded")
@@ -134,7 +134,7 @@ describe("Upgradability", async () => {
 
       implementation = await ethers.getContract<UpgradedByRewriteV1>("UpgradedByRewrite_Implementation");
 
-      expect(await proxy.governor()).to.equal(deployer.address);
+      expect(await proxy.owner()).to.equal(deployer.address);
 
       expect(await proxy.counter()).to.equal(1);
       await proxy.increment();
@@ -157,7 +157,7 @@ describe("Upgradability", async () => {
         throw new Error("No implementation address");
       }
       proxy = await ethers.getContract<UpgradedByRewriteV2>("UpgradedByRewrite");
-      expect(await proxy.governor()).to.equal(deployer.address);
+      expect(await proxy.owner()).to.equal(deployer.address);
 
       expect(await proxy.counter()).to.equal(3);
       await proxy.increment();
@@ -188,7 +188,7 @@ describe("Upgradability", async () => {
 
       implementation = await ethers.getContract<UpgradedByInheritanceV1>("UpgradedByInheritanceV1_Implementation");
 
-      expect(await proxy.governor()).to.equal(deployer.address);
+      expect(await proxy.owner()).to.equal(deployer.address);
 
       expect(await proxy.counter()).to.equal(1);
       await proxy.increment();
@@ -211,7 +211,7 @@ describe("Upgradability", async () => {
 
       proxy = await ethers.getContract<UpgradedByInheritanceV2>("UpgradedByInheritanceV1");
 
-      expect(await proxy.governor()).to.equal(deployer.address);
+      expect(await proxy.owner()).to.equal(deployer.address);
 
       expect(await proxy.counter()).to.equal(3);
       await proxy.increment();
diff --git a/contracts/test/rng/index.ts b/contracts/test/rng/index.ts
index 351a2d460..f61ec9b95 100644
--- a/contracts/test/rng/index.ts
+++ b/contracts/test/rng/index.ts
@@ -40,7 +40,7 @@ describe("BlockHashRNG", async () => {
     await deployments.delete("BlockHashRNG");
     await deployments.deploy("BlockHashRNG", {
       from: deployer.address,
-      args: [deployer.address, deployer.address, 10], // governor, consumer, lookaheadTime (seconds)
+      args: [deployer.address, deployer.address, 10], // owner, consumer, lookaheadTime (seconds)
     });
     rng = await ethers.getContract<BlockHashRNG>("BlockHashRNG");
   });

From f73487315c92bfbcbf37bf9569fa4cf5272c3f66 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 27 Aug 2025 04:53:33 +0100
Subject: [PATCH 065/175] chore: changelog

---
 contracts/CHANGELOG.md | 1 +
 1 file changed, 1 insertion(+)

diff --git a/contracts/CHANGELOG.md b/contracts/CHANGELOG.md
index 751bd5473..79845b880 100644
--- a/contracts/CHANGELOG.md
+++ b/contracts/CHANGELOG.md
@@ -12,6 +12,7 @@ The format is based on [Common Changelog](https://common-changelog.org/).
 - **Breaking:** Replace `require()` with `revert()` and custom errors outside KlerosCore for consistency and smaller bytecode ([#2084](https://github.com/kleros/kleros-v2/issues/2084))
 - **Breaking:** Rename the interface from `RNG` to `IRNG` ([#2054](https://github.com/kleros/kleros-v2/issues/2054))
 - **Breaking:** Remove the `_block` parameter from `IRNG.requestRandomness()` and `IRNG.receiveRandomness()`, not needed for the primary VRF-based RNG ([#2054](https://github.com/kleros/kleros-v2/issues/2054))
+- **Breaking:** Rename `governor` to `owner` in order to comply with the lightweight ownership standard [ERC-5313](https://eipsinsight.com/ercs/erc-5313) ([#2112](https://github.com/kleros/kleros-v2/issues/2112))
 - Make the primary VRF-based RNG fall back to `BlockhashRNG` if the VRF request is not fulfilled within a timeout ([#2054](https://github.com/kleros/kleros-v2/issues/2054))
 - Authenticate the calls to the RNGs to prevent 3rd parties from depleting the Chainlink VRF subscription funds ([#2054](https://github.com/kleros/kleros-v2/issues/2054))
 - Use `block.timestamp` rather than `block.number` for `BlockhashRNG` for better reliability on Arbitrum as block production is sporadic depending on network conditions. ([#2054](https://github.com/kleros/kleros-v2/issues/2054))

From e4d4bdbb10090ece1c2e54ba231f19553db5b9bb Mon Sep 17 00:00:00 2001
From: unknownunknown1 <danil@kleros.io>
Date: Wed, 27 Aug 2025 18:29:54 +1000
Subject: [PATCH 066/175] feat(KlerosCore): allow to jump to a non-classic DK

---
 .../deploy/00-home-chain-arbitration-neo.ts   |  9 ++++----
 contracts/deploy/00-home-chain-arbitration.ts |  9 ++++----
 contracts/src/arbitration/KlerosCoreBase.sol  |  7 ++++--
 .../dispute-kits/DisputeKitClassic.sol        | 10 +++++++--
 .../dispute-kits/DisputeKitClassicBase.sol    | 19 ++++++++++++++--
 .../dispute-kits/DisputeKitGated.sol          | 10 +++++++--
 .../dispute-kits/DisputeKitGatedShutter.sol   | 10 +++++++--
 .../dispute-kits/DisputeKitShutter.sol        | 10 +++++++--
 .../dispute-kits/DisputeKitSybilResistant.sol |  6 +++--
 .../arbitration/interfaces/IDisputeKit.sol    |  4 ++++
 contracts/test/foundry/KlerosCore.t.sol       | 22 ++++++++++++-------
 11 files changed, 86 insertions(+), 30 deletions(-)

diff --git a/contracts/deploy/00-home-chain-arbitration-neo.ts b/contracts/deploy/00-home-chain-arbitration-neo.ts
index f5211c4af..a47e9e4b3 100644
--- a/contracts/deploy/00-home-chain-arbitration-neo.ts
+++ b/contracts/deploy/00-home-chain-arbitration-neo.ts
@@ -28,10 +28,11 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
 
   await deployUpgradable(deployments, "EvidenceModule", { from: deployer, args: [deployer], log: true });
 
+  const jumpDisputeKitID = 1; // Classic DK
   const disputeKit = await deployUpgradable(deployments, "DisputeKitClassicNeo", {
     from: deployer,
     contract: "DisputeKitClassic",
-    args: [deployer, ZeroAddress, weth.target],
+    args: [deployer, ZeroAddress, weth.target, jumpDisputeKitID],
     log: true,
   });
 
@@ -124,21 +125,21 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
   // Extra dispute kits
   const disputeKitShutter = await deployUpgradable(deployments, "DisputeKitShutter", {
     from: deployer,
-    args: [deployer, core.target, weth.target],
+    args: [deployer, core.target, weth.target, jumpDisputeKitID],
     log: true,
   });
   await core.addNewDisputeKit(disputeKitShutter.address);
 
   const disputeKitGated = await deployUpgradable(deployments, "DisputeKitGated", {
     from: deployer,
-    args: [deployer, core.target, weth.target],
+    args: [deployer, core.target, weth.target, jumpDisputeKitID],
     log: true,
   });
   await core.addNewDisputeKit(disputeKitGated.address);
 
   const disputeKitGatedShutter = await deployUpgradable(deployments, "DisputeKitGatedShutter", {
     from: deployer,
-    args: [deployer, core.target, weth.target],
+    args: [deployer, core.target, weth.target, jumpDisputeKitID],
     log: true,
   });
   await core.addNewDisputeKit(disputeKitGatedShutter.address);
diff --git a/contracts/deploy/00-home-chain-arbitration.ts b/contracts/deploy/00-home-chain-arbitration.ts
index 1d590813f..8f8587877 100644
--- a/contracts/deploy/00-home-chain-arbitration.ts
+++ b/contracts/deploy/00-home-chain-arbitration.ts
@@ -34,9 +34,10 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
     log: true,
   });
 
+  const jumpDisputeKitID = 1; // Classic DK
   const disputeKit = await deployUpgradable(deployments, "DisputeKitClassic", {
     from: deployer,
-    args: [deployer, ZeroAddress, weth.target],
+    args: [deployer, ZeroAddress, weth.target, jumpDisputeKitID],
     log: true,
   });
 
@@ -105,7 +106,7 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
   // Extra dispute kits
   const disputeKitShutter = await deployUpgradable(deployments, "DisputeKitShutter", {
     from: deployer,
-    args: [deployer, core.target, weth.target],
+    args: [deployer, core.target, weth.target, jumpDisputeKitID],
     log: true,
   });
   await core.addNewDisputeKit(disputeKitShutter.address);
@@ -113,7 +114,7 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
 
   const disputeKitGated = await deployUpgradable(deployments, "DisputeKitGated", {
     from: deployer,
-    args: [deployer, core.target, weth.target],
+    args: [deployer, core.target, weth.target, jumpDisputeKitID],
     log: true,
   });
   await core.addNewDisputeKit(disputeKitGated.address);
@@ -121,7 +122,7 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
 
   const disputeKitGatedShutter = await deployUpgradable(deployments, "DisputeKitGatedShutter", {
     from: deployer,
-    args: [deployer, core.target, weth.target],
+    args: [deployer, core.target, weth.target, jumpDisputeKitID],
     log: true,
   });
   await core.addNewDisputeKit(disputeKitGatedShutter.address);
diff --git a/contracts/src/arbitration/KlerosCoreBase.sol b/contracts/src/arbitration/KlerosCoreBase.sol
index 0a9946bbc..cbec7646c 100644
--- a/contracts/src/arbitration/KlerosCoreBase.sol
+++ b/contracts/src/arbitration/KlerosCoreBase.sol
@@ -1079,8 +1079,11 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
         courtJump = true;
 
         if (!courts[newCourtID].supportedDisputeKits[newDisputeKitID]) {
-            // Switch to classic dispute kit if parent court doesn't support the current one.
-            newDisputeKitID = DISPUTE_KIT_CLASSIC;
+            newDisputeKitID = disputeKits[_round.disputeKitID].getJumpDisputeKitID();
+            if (!courts[newCourtID].supportedDisputeKits[newDisputeKitID]) {
+                // Switch to classic dispute kit if parent court doesn't support the jump DK.
+                newDisputeKitID = DISPUTE_KIT_CLASSIC;
+            }
             disputeKitJump = true;
         }
     }
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassic.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassic.sol
index ce5932c92..5f2a86536 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassic.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassic.sol
@@ -26,8 +26,14 @@ contract DisputeKitClassic is DisputeKitClassicBase {
     /// @param _owner The owner's address.
     /// @param _core The KlerosCore arbitrator.
     /// @param _wNative The wrapped native token address, typically wETH.
-    function initialize(address _owner, KlerosCore _core, address _wNative) external reinitializer(1) {
-        __DisputeKitClassicBase_initialize(_owner, _core, _wNative);
+    /// @param _jumpDisputeKitID The ID of the dispute kit to switch to after the court jump.
+    function initialize(
+        address _owner,
+        KlerosCore _core,
+        address _wNative,
+        uint256 _jumpDisputeKitID
+    ) external reinitializer(1) {
+        __DisputeKitClassicBase_initialize(_owner, _core, _wNative, _jumpDisputeKitID);
     }
 
     function reinitialize(address _wNative) external reinitializer(9) {
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index f2d7a154c..34ffd5e96 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -6,7 +6,7 @@ import {KlerosCore, KlerosCoreBase, IDisputeKit, ISortitionModule} from "../Kler
 import {Initializable} from "../../proxy/Initializable.sol";
 import {UUPSProxiable} from "../../proxy/UUPSProxiable.sol";
 import {SafeSend} from "../../libraries/SafeSend.sol";
-import {ONE_BASIS_POINT} from "../../libraries/Constants.sol";
+import {ONE_BASIS_POINT, DISPUTE_KIT_CLASSIC} from "../../libraries/Constants.sol";
 
 /// @title DisputeKitClassicBase
 /// Abstract Dispute kit classic implementation of the Kleros v1 features including:
@@ -68,6 +68,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         public alreadyDrawn; // True if the address has already been drawn, false by default. To be added to the Round struct when fully redeploying rather than upgrading.
     mapping(uint256 coreDisputeID => bool) public coreDisputeIDToActive; // True if this dispute kit is active for this core dispute ID.
     address public wNative; // The wrapped native token for safeSend().
+    uint256 public jumpDisputeKitID; // The ID of the dispute kit in Kleros Core disputeKits array that the dispute should switch to after the court jump, in case the new court doesn't support this dispute kit.
 
     // ************************************* //
     // *              Events               * //
@@ -147,14 +148,17 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     /// @param _owner The owner's address.
     /// @param _core The KlerosCore arbitrator.
     /// @param _wNative The wrapped native token address, typically wETH.
+    /// @param _jumpDisputeKitID The ID of the dispute kit to switch to after the court jump.
     function __DisputeKitClassicBase_initialize(
         address _owner,
         KlerosCore _core,
-        address _wNative
+        address _wNative,
+        uint256 _jumpDisputeKitID
     ) internal onlyInitializing {
         owner = _owner;
         core = _core;
         wNative = _wNative;
+        jumpDisputeKitID = _jumpDisputeKitID;
     }
 
     // ************************ //
@@ -176,6 +180,12 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         owner = _owner;
     }
 
+    /// @dev Changes the dispute kit ID used for the jump.
+    /// @param _jumpDisputeKitID The new value for the `jumpDisputeKitID` storage variable.
+    function changeJumpDisputeKitID(uint256 _jumpDisputeKitID) external onlyByOwner {
+        jumpDisputeKitID = _jumpDisputeKitID;
+    }
+
     /// @dev Changes the `core` storage variable.
     /// @param _core The new value for the `core` storage variable.
     function changeCore(address _core) external onlyByOwner {
@@ -639,6 +649,11 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         return (_currentNbVotes * 2) + 1;
     }
 
+    function getJumpDisputeKitID() external view returns (uint256) {
+        // Fall back to classic DK in case the jump ID is not defined.
+        return jumpDisputeKitID == 0 ? DISPUTE_KIT_CLASSIC : jumpDisputeKitID;
+    }
+
     /// @dev Returns true if the specified voter was active in this round.
     /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
     /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol b/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol
index c0e70f741..ae97a5a5e 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol
@@ -42,8 +42,14 @@ contract DisputeKitGated is DisputeKitClassicBase {
     /// @param _owner The owner's address.
     /// @param _core The KlerosCore arbitrator.
     /// @param _wNative The wrapped native token address, typically wETH.
-    function initialize(address _owner, KlerosCore _core, address _wNative) external reinitializer(1) {
-        __DisputeKitClassicBase_initialize(_owner, _core, _wNative);
+    /// @param _jumpDisputeKitID The ID of the dispute kit to switch to after the court jump.
+    function initialize(
+        address _owner,
+        KlerosCore _core,
+        address _wNative,
+        uint256 _jumpDisputeKitID
+    ) external reinitializer(1) {
+        __DisputeKitClassicBase_initialize(_owner, _core, _wNative, _jumpDisputeKitID);
     }
 
     function reinitialize(address _wNative) external reinitializer(9) {
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
index c5de2483b..ee4e9c089 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
@@ -61,8 +61,14 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
     /// @param _owner The owner's address.
     /// @param _core The KlerosCore arbitrator.
     /// @param _wNative The wrapped native token address, typically wETH.
-    function initialize(address _owner, KlerosCore _core, address _wNative) external reinitializer(1) {
-        __DisputeKitClassicBase_initialize(_owner, _core, _wNative);
+    /// @param _jumpDisputeKitID The ID of the dispute kit to switch to after the court jump.
+    function initialize(
+        address _owner,
+        KlerosCore _core,
+        address _wNative,
+        uint256 _jumpDisputeKitID
+    ) external reinitializer(1) {
+        __DisputeKitClassicBase_initialize(_owner, _core, _wNative, _jumpDisputeKitID);
     }
 
     function reinitialize(address _wNative) external reinitializer(9) {
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol b/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
index 886f5dbec..d98e20132 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
@@ -45,8 +45,14 @@ contract DisputeKitShutter is DisputeKitClassicBase {
     /// @param _owner The owner's address.
     /// @param _core The KlerosCore arbitrator.
     /// @param _wNative The wrapped native token address, typically wETH.
-    function initialize(address _owner, KlerosCore _core, address _wNative) external reinitializer(1) {
-        __DisputeKitClassicBase_initialize(_owner, _core, _wNative);
+    /// @param _jumpDisputeKitID The ID of the dispute kit to switch to after the court jump.
+    function initialize(
+        address _owner,
+        KlerosCore _core,
+        address _wNative,
+        uint256 _jumpDisputeKitID
+    ) external reinitializer(1) {
+        __DisputeKitClassicBase_initialize(_owner, _core, _wNative, _jumpDisputeKitID);
     }
 
     function reinitialize(address _wNative) external reinitializer(9) {
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitSybilResistant.sol b/contracts/src/arbitration/dispute-kits/DisputeKitSybilResistant.sol
index e213f6d11..38d728444 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitSybilResistant.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitSybilResistant.sol
@@ -40,13 +40,15 @@ contract DisputeKitSybilResistant is DisputeKitClassicBase {
     /// @param _core The KlerosCore arbitrator.
     /// @param _poh The Proof of Humanity registry.
     /// @param _wNative The wrapped native token address, typically wETH.
+    /// @param _jumpDisputeKitID The ID of the dispute kit to switch to after the court jump.
     function initialize(
         address _owner,
         KlerosCore _core,
         IProofOfHumanity _poh,
-        address _wNative
+        address _wNative,
+        uint256 _jumpDisputeKitID
     ) external reinitializer(1) {
-        __DisputeKitClassicBase_initialize(_owner, _core, _wNative);
+        __DisputeKitClassicBase_initialize(_owner, _core, _wNative, _jumpDisputeKitID);
         poh = _poh;
         singleDrawPerJuror = true;
     }
diff --git a/contracts/src/arbitration/interfaces/IDisputeKit.sol b/contracts/src/arbitration/interfaces/IDisputeKit.sol
index 0aab45b9c..ca3047176 100644
--- a/contracts/src/arbitration/interfaces/IDisputeKit.sol
+++ b/contracts/src/arbitration/interfaces/IDisputeKit.sol
@@ -127,6 +127,10 @@ interface IDisputeKit {
         uint256 _currentNbVotes
     ) external view returns (uint256); // TODO: remove previousDisputeKit
 
+    /// @dev Returns the dispute kid ID for Kleros Core, that will be used after court jump.
+    /// @return The ID of the dispute kit in Kleros Core disputeKits array.
+    function getJumpDisputeKitID() external view returns (uint256);
+
     /// @dev Returns true if the specified voter was active in this round.
     /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
     /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.
diff --git a/contracts/test/foundry/KlerosCore.t.sol b/contracts/test/foundry/KlerosCore.t.sol
index 30e84abdc..e5b5e3c1a 100644
--- a/contracts/test/foundry/KlerosCore.t.sol
+++ b/contracts/test/foundry/KlerosCore.t.sol
@@ -102,10 +102,11 @@ contract KlerosCoreTest is Test {
         UUPSProxy proxyCore = new UUPSProxy(address(coreLogic), "");
 
         bytes memory initDataDk = abi.encodeWithSignature(
-            "initialize(address,address,address)",
+            "initialize(address,address,address,uint256)",
             owner,
             address(proxyCore),
-            address(wNative)
+            address(wNative),
+            DISPUTE_KIT_CLASSIC
         );
 
         UUPSProxy proxyDk = new UUPSProxy(address(dkLogic), initDataDk);
@@ -235,6 +236,8 @@ contract KlerosCoreTest is Test {
         assertEq(pinakion.allowance(staker2, address(core)), 1 ether, "Wrong allowance for staker2");
 
         assertEq(disputeKit.owner(), msg.sender, "Wrong DK owner");
+        assertEq(disputeKit.getJumpDisputeKitID(), DISPUTE_KIT_CLASSIC, "Wrong jump DK");
+        assertEq(disputeKit.jumpDisputeKitID(), DISPUTE_KIT_CLASSIC, "Wrong jump DK storage var");
         assertEq(address(disputeKit.core()), address(core), "Wrong core in DK");
 
         assertEq(sortitionModule.owner(), msg.sender, "Wrong SM owner");
@@ -289,10 +292,11 @@ contract KlerosCoreTest is Test {
         UUPSProxy proxyCore = new UUPSProxy(address(coreLogic), "");
 
         bytes memory initDataDk = abi.encodeWithSignature(
-            "initialize(address,address,address)",
+            "initialize(address,address,address,uint256)",
             owner,
             address(proxyCore),
-            address(wNative)
+            address(wNative),
+            DISPUTE_KIT_CLASSIC
         );
 
         UUPSProxy proxyDk = new UUPSProxy(address(dkLogic), initDataDk);
@@ -2115,10 +2119,11 @@ contract KlerosCoreTest is Test {
         DisputeKitClassic dkLogic = new DisputeKitClassic();
         // Create a new DK and court to check the switch
         bytes memory initDataDk = abi.encodeWithSignature(
-            "initialize(address,address,address)",
+            "initialize(address,address,address,uint256)",
             owner,
             address(core),
-            address(wNative)
+            address(wNative),
+            DISPUTE_KIT_CLASSIC
         );
 
         UUPSProxy proxyDk = new UUPSProxy(address(dkLogic), initDataDk);
@@ -2939,10 +2944,11 @@ contract KlerosCoreTest is Test {
         DisputeKitClassic dkLogic = new DisputeKitClassic();
         // Create a new DK to check castVote.
         bytes memory initDataDk = abi.encodeWithSignature(
-            "initialize(address,address,address)",
+            "initialize(address,address,address,uint256)",
             owner,
             address(core),
-            address(wNative)
+            address(wNative),
+            DISPUTE_KIT_CLASSIC
         );
 
         UUPSProxy proxyDk = new UUPSProxy(address(dkLogic), initDataDk);

From 1d37d89b6c35057a679b63cdd7ceb2cd74054b7b Mon Sep 17 00:00:00 2001
From: unknownunknown1 <danil@kleros.io>
Date: Wed, 27 Aug 2025 21:22:36 +1000
Subject: [PATCH 067/175] feat(DK): update reinitializer

---
 .../src/arbitration/dispute-kits/DisputeKitClassic.sol      | 6 +++---
 contracts/src/arbitration/dispute-kits/DisputeKitGated.sol  | 6 +++---
 .../src/arbitration/dispute-kits/DisputeKitGatedShutter.sol | 6 +++---
 .../src/arbitration/dispute-kits/DisputeKitShutter.sol      | 6 +++---
 .../arbitration/dispute-kits/DisputeKitSybilResistant.sol   | 2 +-
 5 files changed, 13 insertions(+), 13 deletions(-)

diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassic.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassic.sol
index 5f2a86536..af89d2816 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassic.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassic.sol
@@ -11,7 +11,7 @@ import {DisputeKitClassicBase, KlerosCore} from "./DisputeKitClassicBase.sol";
 /// - an incentive system: equal split between coherent votes,
 /// - an appeal system: fund 2 choices only, vote on any choice.
 contract DisputeKitClassic is DisputeKitClassicBase {
-    string public constant override version = "0.12.0";
+    string public constant override version = "0.13.0";
 
     // ************************************* //
     // *            Constructor            * //
@@ -36,8 +36,8 @@ contract DisputeKitClassic is DisputeKitClassicBase {
         __DisputeKitClassicBase_initialize(_owner, _core, _wNative, _jumpDisputeKitID);
     }
 
-    function reinitialize(address _wNative) external reinitializer(9) {
-        wNative = _wNative;
+    function reinitialize(uint256 _jumpDisputeKitID) external reinitializer(10) {
+        jumpDisputeKitID = _jumpDisputeKitID;
     }
 
     // ************************ //
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol b/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol
index ae97a5a5e..9097a8fd3 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol
@@ -27,7 +27,7 @@ interface IBalanceHolderERC1155 {
 /// - an incentive system: equal split between coherent votes,
 /// - an appeal system: fund 2 choices only, vote on any choice.
 contract DisputeKitGated is DisputeKitClassicBase {
-    string public constant override version = "0.12.0";
+    string public constant override version = "0.13.0";
 
     // ************************************* //
     // *            Constructor            * //
@@ -52,8 +52,8 @@ contract DisputeKitGated is DisputeKitClassicBase {
         __DisputeKitClassicBase_initialize(_owner, _core, _wNative, _jumpDisputeKitID);
     }
 
-    function reinitialize(address _wNative) external reinitializer(9) {
-        wNative = _wNative;
+    function reinitialize(uint256 _jumpDisputeKitID) external reinitializer(10) {
+        jumpDisputeKitID = _jumpDisputeKitID;
     }
 
     // ************************ //
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
index ee4e9c089..158bfc5a6 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
@@ -28,7 +28,7 @@ interface IBalanceHolderERC1155 {
 /// - an incentive system: equal split between coherent votes,
 /// - an appeal system: fund 2 choices only, vote on any choice.
 contract DisputeKitGatedShutter is DisputeKitClassicBase {
-    string public constant override version = "0.12.0";
+    string public constant override version = "0.13.0";
 
     // ************************************* //
     // *              Events               * //
@@ -71,8 +71,8 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
         __DisputeKitClassicBase_initialize(_owner, _core, _wNative, _jumpDisputeKitID);
     }
 
-    function reinitialize(address _wNative) external reinitializer(9) {
-        wNative = _wNative;
+    function reinitialize(uint256 _jumpDisputeKitID) external reinitializer(10) {
+        jumpDisputeKitID = _jumpDisputeKitID;
     }
 
     // ************************ //
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol b/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
index d98e20132..0dfbf6985 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
@@ -12,7 +12,7 @@ import {DisputeKitClassicBase, KlerosCore} from "./DisputeKitClassicBase.sol";
 /// - an incentive system: equal split between coherent votes,
 /// - an appeal system: fund 2 choices only, vote on any choice.
 contract DisputeKitShutter is DisputeKitClassicBase {
-    string public constant override version = "0.12.0";
+    string public constant override version = "0.13.0";
 
     // ************************************* //
     // *              Events               * //
@@ -55,8 +55,8 @@ contract DisputeKitShutter is DisputeKitClassicBase {
         __DisputeKitClassicBase_initialize(_owner, _core, _wNative, _jumpDisputeKitID);
     }
 
-    function reinitialize(address _wNative) external reinitializer(9) {
-        wNative = _wNative;
+    function reinitialize(uint256 _jumpDisputeKitID) external reinitializer(10) {
+        jumpDisputeKitID = _jumpDisputeKitID;
     }
 
     // ************************ //
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitSybilResistant.sol b/contracts/src/arbitration/dispute-kits/DisputeKitSybilResistant.sol
index 38d728444..66553f02a 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitSybilResistant.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitSybilResistant.sol
@@ -18,7 +18,7 @@ interface IProofOfHumanity {
 /// - an incentive system: equal split between coherent votes,
 /// - an appeal system: fund 2 choices only, vote on any choice.
 contract DisputeKitSybilResistant is DisputeKitClassicBase {
-    string public constant override version = "0.12.0";
+    string public constant override version = "0.13.0";
 
     // ************************************* //
     // *             Storage               * //

From 3ed7310a7d471ec5e57ba8b9a8a6458f32a79e71 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Fri, 29 Aug 2025 01:30:46 +0100
Subject: [PATCH 068/175] chore: minor comments tweaks

---
 contracts/src/arbitration/KlerosCoreBase.sol     |  3 ++-
 .../dispute-kits/DisputeKitClassicBase.sol       | 16 +++++++++-------
 .../src/arbitration/interfaces/IDisputeKit.sol   |  2 +-
 3 files changed, 12 insertions(+), 9 deletions(-)

diff --git a/contracts/src/arbitration/KlerosCoreBase.sol b/contracts/src/arbitration/KlerosCoreBase.sol
index cbec7646c..891d7173f 100644
--- a/contracts/src/arbitration/KlerosCoreBase.sol
+++ b/contracts/src/arbitration/KlerosCoreBase.sol
@@ -1079,9 +1079,10 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
         courtJump = true;
 
         if (!courts[newCourtID].supportedDisputeKits[newDisputeKitID]) {
+            // The current Dispute Kit is not compatible with the new court, jump to another Dispute Kit.
             newDisputeKitID = disputeKits[_round.disputeKitID].getJumpDisputeKitID();
             if (!courts[newCourtID].supportedDisputeKits[newDisputeKitID]) {
-                // Switch to classic dispute kit if parent court doesn't support the jump DK.
+                // The new Dispute Kit is still not compatible, fall back to `DisputeKitClassic` which is always supported.
                 newDisputeKitID = DISPUTE_KIT_CLASSIC;
             }
             disputeKitJump = true;
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index 34ffd5e96..9afbfa3e3 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -180,18 +180,18 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         owner = _owner;
     }
 
-    /// @dev Changes the dispute kit ID used for the jump.
-    /// @param _jumpDisputeKitID The new value for the `jumpDisputeKitID` storage variable.
-    function changeJumpDisputeKitID(uint256 _jumpDisputeKitID) external onlyByOwner {
-        jumpDisputeKitID = _jumpDisputeKitID;
-    }
-
     /// @dev Changes the `core` storage variable.
     /// @param _core The new value for the `core` storage variable.
     function changeCore(address _core) external onlyByOwner {
         core = KlerosCore(_core);
     }
 
+    /// @dev Changes the dispute kit ID used for the jump.
+    /// @param _jumpDisputeKitID The new value for the `jumpDisputeKitID` storage variable.
+    function changeJumpDisputeKitID(uint256 _jumpDisputeKitID) external onlyByOwner {
+        jumpDisputeKitID = _jumpDisputeKitID;
+    }
+
     // ************************************* //
     // *         State Modifiers           * //
     // ************************************* //
@@ -649,7 +649,9 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         return (_currentNbVotes * 2) + 1;
     }
 
-    function getJumpDisputeKitID() external view returns (uint256) {
+    /// @dev Returns the dispute kid ID be used after court jump by Kleros Core.
+    /// @return The ID of the dispute kit in Kleros Core disputeKits array.
+    function getJumpDisputeKitID() external view override returns (uint256) {
         // Fall back to classic DK in case the jump ID is not defined.
         return jumpDisputeKitID == 0 ? DISPUTE_KIT_CLASSIC : jumpDisputeKitID;
     }
diff --git a/contracts/src/arbitration/interfaces/IDisputeKit.sol b/contracts/src/arbitration/interfaces/IDisputeKit.sol
index ca3047176..6add5c22e 100644
--- a/contracts/src/arbitration/interfaces/IDisputeKit.sol
+++ b/contracts/src/arbitration/interfaces/IDisputeKit.sol
@@ -127,7 +127,7 @@ interface IDisputeKit {
         uint256 _currentNbVotes
     ) external view returns (uint256); // TODO: remove previousDisputeKit
 
-    /// @dev Returns the dispute kid ID for Kleros Core, that will be used after court jump.
+    /// @dev Returns the dispute kid ID be used after court jump by Kleros Core.
     /// @return The ID of the dispute kit in Kleros Core disputeKits array.
     function getJumpDisputeKitID() external view returns (uint256);
 

From c9e73347d1892ac2e0b40b21aec912a508033deb Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Fri, 29 Aug 2025 03:05:53 +0100
Subject: [PATCH 069/175] chore: deploy script tweak to make
 DisputeKitGatedShutter jump to DisputeKitShutter

---
 .../deploy/00-home-chain-arbitration-neo.ts   | 13 ++++++++-----
 contracts/deploy/00-home-chain-arbitration.ts | 19 +++++++++++--------
 2 files changed, 19 insertions(+), 13 deletions(-)

diff --git a/contracts/deploy/00-home-chain-arbitration-neo.ts b/contracts/deploy/00-home-chain-arbitration-neo.ts
index a47e9e4b3..22c2ffade 100644
--- a/contracts/deploy/00-home-chain-arbitration-neo.ts
+++ b/contracts/deploy/00-home-chain-arbitration-neo.ts
@@ -28,11 +28,11 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
 
   await deployUpgradable(deployments, "EvidenceModule", { from: deployer, args: [deployer], log: true });
 
-  const jumpDisputeKitID = 1; // Classic DK
+  const classicDisputeKitID = 1; // Classic DK
   const disputeKit = await deployUpgradable(deployments, "DisputeKitClassicNeo", {
     from: deployer,
     contract: "DisputeKitClassic",
-    args: [deployer, ZeroAddress, weth.target, jumpDisputeKitID],
+    args: [deployer, ZeroAddress, weth.target, classicDisputeKitID],
     log: true,
   });
 
@@ -123,23 +123,26 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
   await core.changeArbitrableWhitelist(resolver.address, true);
 
   // Extra dispute kits
+  const disputeKitShutterID = 2;
   const disputeKitShutter = await deployUpgradable(deployments, "DisputeKitShutter", {
     from: deployer,
-    args: [deployer, core.target, weth.target, jumpDisputeKitID],
+    args: [deployer, core.target, weth.target, classicDisputeKitID],
     log: true,
   });
   await core.addNewDisputeKit(disputeKitShutter.address);
 
+  const disputeKitGatedID = 3;
   const disputeKitGated = await deployUpgradable(deployments, "DisputeKitGated", {
     from: deployer,
-    args: [deployer, core.target, weth.target, jumpDisputeKitID],
+    args: [deployer, core.target, weth.target, classicDisputeKitID],
     log: true,
   });
   await core.addNewDisputeKit(disputeKitGated.address);
 
+  const disputeKitGatedShutterID = 4;
   const disputeKitGatedShutter = await deployUpgradable(deployments, "DisputeKitGatedShutter", {
     from: deployer,
-    args: [deployer, core.target, weth.target, jumpDisputeKitID],
+    args: [deployer, core.target, weth.target, disputeKitShutterID], // Does not jump to DKClassic
     log: true,
   });
   await core.addNewDisputeKit(disputeKitGatedShutter.address);
diff --git a/contracts/deploy/00-home-chain-arbitration.ts b/contracts/deploy/00-home-chain-arbitration.ts
index 8f8587877..8ec753194 100644
--- a/contracts/deploy/00-home-chain-arbitration.ts
+++ b/contracts/deploy/00-home-chain-arbitration.ts
@@ -34,10 +34,10 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
     log: true,
   });
 
-  const jumpDisputeKitID = 1; // Classic DK
+  const classicDisputeKitID = 1; // Classic DK
   const disputeKit = await deployUpgradable(deployments, "DisputeKitClassic", {
     from: deployer,
-    args: [deployer, ZeroAddress, weth.target, jumpDisputeKitID],
+    args: [deployer, ZeroAddress, weth.target, classicDisputeKitID],
     log: true,
   });
 
@@ -104,29 +104,32 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
   }
 
   // Extra dispute kits
+  const disputeKitShutterID = 2;
   const disputeKitShutter = await deployUpgradable(deployments, "DisputeKitShutter", {
     from: deployer,
-    args: [deployer, core.target, weth.target, jumpDisputeKitID],
+    args: [deployer, core.target, weth.target, classicDisputeKitID],
     log: true,
   });
   await core.addNewDisputeKit(disputeKitShutter.address);
-  await core.enableDisputeKits(Courts.GENERAL, [2], true); // enable disputeKitShutter on the General Court
+  await core.enableDisputeKits(Courts.GENERAL, [disputeKitShutterID], true); // enable disputeKitShutter on the General Court
 
+  const disputeKitGatedID = 3;
   const disputeKitGated = await deployUpgradable(deployments, "DisputeKitGated", {
     from: deployer,
-    args: [deployer, core.target, weth.target, jumpDisputeKitID],
+    args: [deployer, core.target, weth.target, classicDisputeKitID],
     log: true,
   });
   await core.addNewDisputeKit(disputeKitGated.address);
-  await core.enableDisputeKits(Courts.GENERAL, [3], true); // enable disputeKitGated on the General Court
+  await core.enableDisputeKits(Courts.GENERAL, [disputeKitGatedID], true); // enable disputeKitGated on the General Court
 
+  const disputeKitGatedShutterID = 4;
   const disputeKitGatedShutter = await deployUpgradable(deployments, "DisputeKitGatedShutter", {
     from: deployer,
-    args: [deployer, core.target, weth.target, jumpDisputeKitID],
+    args: [deployer, core.target, weth.target, disputeKitShutterID], // Does not jump to DKClassic
     log: true,
   });
   await core.addNewDisputeKit(disputeKitGatedShutter.address);
-  await core.enableDisputeKits(Courts.GENERAL, [4], true); // enable disputeKitGatedShutter on the General Court
+  await core.enableDisputeKits(Courts.GENERAL, [disputeKitGatedShutterID], true); // enable disputeKitGatedShutter on the General Court
 
   // Snapshot proxy
   await deploy("KlerosCoreSnapshotProxy", {

From ea5b3a7fc4d105464ffd982df863f501157913f2 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Fri, 29 Aug 2025 03:53:35 +0100
Subject: [PATCH 070/175] refactor: split the KlerosCore foundry tests into
 several files as it was over 3000 lines

---
 contracts/test/foundry/KlerosCore.t.sol       | 3145 -----------------
 .../test/foundry/KlerosCore_Appeals.t.sol     |  361 ++
 .../test/foundry/KlerosCore_Disputes.t.sol    |  148 +
 .../test/foundry/KlerosCore_Drawing.t.sol     |  124 +
 .../test/foundry/KlerosCore_Execution.t.sol   |  688 ++++
 .../test/foundry/KlerosCore_Governance.t.sol  |  472 +++
 .../foundry/KlerosCore_Initialization.t.sol   |  170 +
 contracts/test/foundry/KlerosCore_RNG.t.sol   |  121 +
 .../test/foundry/KlerosCore_Staking.t.sol     |  450 +++
 .../test/foundry/KlerosCore_TestBase.sol      |  251 ++
 .../test/foundry/KlerosCore_Voting.t.sol      |  485 +++
 11 files changed, 3270 insertions(+), 3145 deletions(-)
 delete mode 100644 contracts/test/foundry/KlerosCore.t.sol
 create mode 100644 contracts/test/foundry/KlerosCore_Appeals.t.sol
 create mode 100644 contracts/test/foundry/KlerosCore_Disputes.t.sol
 create mode 100644 contracts/test/foundry/KlerosCore_Drawing.t.sol
 create mode 100644 contracts/test/foundry/KlerosCore_Execution.t.sol
 create mode 100644 contracts/test/foundry/KlerosCore_Governance.t.sol
 create mode 100644 contracts/test/foundry/KlerosCore_Initialization.t.sol
 create mode 100644 contracts/test/foundry/KlerosCore_RNG.t.sol
 create mode 100644 contracts/test/foundry/KlerosCore_Staking.t.sol
 create mode 100644 contracts/test/foundry/KlerosCore_TestBase.sol
 create mode 100644 contracts/test/foundry/KlerosCore_Voting.t.sol

diff --git a/contracts/test/foundry/KlerosCore.t.sol b/contracts/test/foundry/KlerosCore.t.sol
deleted file mode 100644
index 30e84abdc..000000000
--- a/contracts/test/foundry/KlerosCore.t.sol
+++ /dev/null
@@ -1,3145 +0,0 @@
-// SPDX-License-Identifier: MIT
-pragma solidity ^0.8.24;
-
-import {Test} from "forge-std/Test.sol";
-import {console} from "forge-std/console.sol"; // Import the console for logging
-import {KlerosCoreMock, KlerosCoreBase} from "../../src/test/KlerosCoreMock.sol";
-import {IArbitratorV2} from "../../src/arbitration/KlerosCoreBase.sol";
-import {IDisputeKit} from "../../src/arbitration/interfaces/IDisputeKit.sol";
-import {DisputeKitClassic, DisputeKitClassicBase} from "../../src/arbitration/dispute-kits/DisputeKitClassic.sol";
-import {DisputeKitSybilResistant} from "../../src/arbitration/dispute-kits/DisputeKitSybilResistant.sol";
-import {ISortitionModule} from "../../src/arbitration/interfaces/ISortitionModule.sol";
-import {SortitionModuleMock, SortitionModuleBase} from "../../src/test/SortitionModuleMock.sol";
-import {UUPSProxy} from "../../src/proxy/UUPSProxy.sol";
-import {BlockHashRNG} from "../../src/rng/BlockHashRNG.sol";
-import {RNGWithFallback, IRNG} from "../../src/rng/RNGWithFallback.sol";
-import {RNGMock} from "../../src/test/RNGMock.sol";
-import {PNK} from "../../src/token/PNK.sol";
-import {TestERC20} from "../../src/token/TestERC20.sol";
-import {ArbitrableExample, IArbitrableV2} from "../../src/arbitration/arbitrables/ArbitrableExample.sol";
-import {DisputeTemplateRegistry} from "../../src/arbitration/DisputeTemplateRegistry.sol";
-import "../../src/libraries/Constants.sol";
-import {IKlerosCore, KlerosCoreSnapshotProxy} from "../../src/arbitration/view/KlerosCoreSnapshotProxy.sol";
-
-contract KlerosCoreTest is Test {
-    event Initialized(uint64 version);
-
-    KlerosCoreMock core;
-    DisputeKitClassic disputeKit;
-    SortitionModuleMock sortitionModule;
-    BlockHashRNG rng;
-    PNK pinakion;
-    TestERC20 feeToken;
-    TestERC20 wNative;
-    ArbitrableExample arbitrable;
-    DisputeTemplateRegistry registry;
-    address owner;
-    address guardian;
-    address staker1;
-    address staker2;
-    address disputer;
-    address crowdfunder1;
-    address crowdfunder2;
-    address other;
-    address jurorProsecutionModule;
-    uint256 minStake;
-    uint256 alpha;
-    uint256 feeForJuror;
-    uint256 jurorsForCourtJump;
-    bytes sortitionExtraData;
-    bytes arbitratorExtraData;
-    uint256[4] timesPerPeriod;
-    bool hiddenVotes;
-
-    uint256 totalSupply = 1000000 ether;
-
-    uint256 minStakingTime;
-    uint256 maxDrawingTime;
-    uint256 rngLookahead; // Time in seconds
-
-    string templateData;
-    string templateDataMappings;
-
-    function setUp() public {
-        KlerosCoreMock coreLogic = new KlerosCoreMock();
-        SortitionModuleMock smLogic = new SortitionModuleMock();
-        DisputeKitClassic dkLogic = new DisputeKitClassic();
-        DisputeTemplateRegistry registryLogic = new DisputeTemplateRegistry();
-        pinakion = new PNK();
-        feeToken = new TestERC20("Test", "TST");
-        wNative = new TestERC20("wrapped ETH", "wETH");
-
-        owner = msg.sender;
-        guardian = vm.addr(1);
-        staker1 = vm.addr(2);
-        staker2 = vm.addr(3);
-        disputer = vm.addr(4);
-        crowdfunder1 = vm.addr(5);
-        crowdfunder2 = vm.addr(6);
-        vm.deal(disputer, 10 ether);
-        vm.deal(crowdfunder1, 10 ether);
-        vm.deal(crowdfunder2, 10 ether);
-        jurorProsecutionModule = vm.addr(8);
-        other = vm.addr(9);
-        minStake = 1000;
-        alpha = 10000;
-        feeForJuror = 0.03 ether;
-        jurorsForCourtJump = 511;
-        timesPerPeriod = [60, 120, 180, 240];
-
-        pinakion.transfer(msg.sender, totalSupply - 2 ether);
-        pinakion.transfer(staker1, 1 ether);
-        pinakion.transfer(staker2, 1 ether);
-
-        sortitionExtraData = abi.encode(uint256(5));
-        minStakingTime = 18;
-        maxDrawingTime = 24;
-        hiddenVotes = false;
-
-        rngLookahead = 30;
-        rng = new BlockHashRNG(msg.sender, address(sortitionModule), rngLookahead);
-
-        UUPSProxy proxyCore = new UUPSProxy(address(coreLogic), "");
-
-        bytes memory initDataDk = abi.encodeWithSignature(
-            "initialize(address,address,address)",
-            owner,
-            address(proxyCore),
-            address(wNative)
-        );
-
-        UUPSProxy proxyDk = new UUPSProxy(address(dkLogic), initDataDk);
-        disputeKit = DisputeKitClassic(address(proxyDk));
-
-        bytes memory initDataSm = abi.encodeWithSignature(
-            "initialize(address,address,uint256,uint256,address)",
-            owner,
-            address(proxyCore),
-            minStakingTime,
-            maxDrawingTime,
-            rng
-        );
-
-        UUPSProxy proxySm = new UUPSProxy(address(smLogic), initDataSm);
-        sortitionModule = SortitionModuleMock(address(proxySm));
-        vm.prank(owner);
-        rng.changeConsumer(address(sortitionModule));
-
-        core = KlerosCoreMock(address(proxyCore));
-        core.initialize(
-            owner,
-            guardian,
-            pinakion,
-            jurorProsecutionModule,
-            disputeKit,
-            hiddenVotes,
-            [minStake, alpha, feeForJuror, jurorsForCourtJump],
-            timesPerPeriod,
-            sortitionExtraData,
-            sortitionModule,
-            address(wNative)
-        );
-        vm.prank(staker1);
-        pinakion.approve(address(core), 1 ether);
-        vm.prank(staker2);
-        pinakion.approve(address(core), 1 ether);
-
-        templateData = "AAA";
-        templateDataMappings = "BBB";
-        arbitratorExtraData = abi.encodePacked(uint256(GENERAL_COURT), DEFAULT_NB_OF_JURORS, DISPUTE_KIT_CLASSIC);
-
-        bytes memory initDataRegistry = abi.encodeWithSignature("initialize(address)", owner);
-        UUPSProxy proxyRegistry = new UUPSProxy(address(registryLogic), initDataRegistry);
-        registry = DisputeTemplateRegistry(address(proxyRegistry));
-
-        arbitrable = new ArbitrableExample(
-            core,
-            templateData,
-            templateDataMappings,
-            arbitratorExtraData,
-            registry,
-            feeToken
-        );
-    }
-
-    function test_initialize() public {
-        assertEq(core.owner(), msg.sender, "Wrong owner");
-        assertEq(core.guardian(), guardian, "Wrong guardian");
-        assertEq(address(core.pinakion()), address(pinakion), "Wrong pinakion address");
-        assertEq(core.jurorProsecutionModule(), jurorProsecutionModule, "Wrong jurorProsecutionModule address");
-        assertEq(address(core.sortitionModule()), address(sortitionModule), "Wrong sortitionModule address");
-        assertEq(core.getDisputeKitsLength(), 2, "Wrong DK array length");
-        (
-            uint96 courtParent,
-            bool courtHiddenVotes,
-            uint256 courtMinStake,
-            uint256 courtAlpha,
-            uint256 courtFeeForJuror,
-            uint256 courtJurorsForCourtJump,
-            bool courtDisabled
-        ) = core.courts(FORKING_COURT);
-        assertEq(courtParent, FORKING_COURT, "Wrong court parent");
-        assertEq(courtHiddenVotes, false, "Wrong hiddenVotes value");
-        assertEq(courtMinStake, 0, "Wrong minStake value");
-        assertEq(courtAlpha, 0, "Wrong alpha value");
-        assertEq(courtFeeForJuror, 0, "Wrong feeForJuror value");
-        assertEq(courtJurorsForCourtJump, 0, "Wrong jurorsForCourtJump value");
-        assertEq(courtDisabled, false, "Court should not be disabled");
-        (
-            courtParent,
-            courtHiddenVotes,
-            courtMinStake,
-            courtAlpha,
-            courtFeeForJuror,
-            courtJurorsForCourtJump,
-            courtDisabled
-        ) = core.courts(GENERAL_COURT);
-        assertEq(courtParent, FORKING_COURT, "Wrong court parent");
-        assertEq(courtHiddenVotes, false, "Wrong hiddenVotes value");
-        assertEq(courtMinStake, 1000, "Wrong minStake value");
-        assertEq(courtAlpha, 10000, "Wrong alpha value");
-        assertEq(courtFeeForJuror, 0.03 ether, "Wrong feeForJuror value");
-        assertEq(courtJurorsForCourtJump, 511, "Wrong jurorsForCourtJump value");
-        assertEq(courtDisabled, false, "Court should not be disabled");
-
-        uint256[] memory children = core.getCourtChildren(GENERAL_COURT);
-        assertEq(children.length, 0, "No children");
-        uint256[4] memory courtTimesPerPeriod = core.getTimesPerPeriod(GENERAL_COURT);
-        for (uint256 i = 0; i < 4; i++) {
-            assertEq(courtTimesPerPeriod[i], timesPerPeriod[i], "Wrong times per period");
-        }
-
-        assertEq(address(core.disputeKits(NULL_DISPUTE_KIT)), address(0), "Wrong address NULL_DISPUTE_KIT");
-        assertEq(
-            address(core.disputeKits(DISPUTE_KIT_CLASSIC)),
-            address(disputeKit),
-            "Wrong address DISPUTE_KIT_CLASSIC"
-        );
-        assertEq(core.isSupported(FORKING_COURT, NULL_DISPUTE_KIT), false, "Forking court null dk should be false");
-        assertEq(
-            core.isSupported(FORKING_COURT, DISPUTE_KIT_CLASSIC),
-            false,
-            "Forking court classic dk should be false"
-        );
-        assertEq(core.isSupported(GENERAL_COURT, NULL_DISPUTE_KIT), false, "General court null dk should be false");
-        assertEq(core.isSupported(GENERAL_COURT, DISPUTE_KIT_CLASSIC), true, "General court classic dk should be true");
-        assertEq(core.paused(), false, "Wrong paused value");
-
-        assertEq(pinakion.name(), "Pinakion", "Wrong token name");
-        assertEq(pinakion.symbol(), "PNK", "Wrong token symbol");
-        assertEq(pinakion.totalSupply(), 1000000 ether, "Wrong total supply");
-        assertEq(pinakion.balanceOf(msg.sender), 999998 ether, "Wrong token balance of owner");
-        assertEq(pinakion.balanceOf(staker1), 1 ether, "Wrong token balance of staker1");
-        assertEq(pinakion.allowance(staker1, address(core)), 1 ether, "Wrong allowance for staker1");
-        assertEq(pinakion.balanceOf(staker2), 1 ether, "Wrong token balance of staker2");
-        assertEq(pinakion.allowance(staker2, address(core)), 1 ether, "Wrong allowance for staker2");
-
-        assertEq(disputeKit.owner(), msg.sender, "Wrong DK owner");
-        assertEq(address(disputeKit.core()), address(core), "Wrong core in DK");
-
-        assertEq(sortitionModule.owner(), msg.sender, "Wrong SM owner");
-        assertEq(address(sortitionModule.core()), address(core), "Wrong core in SM");
-        assertEq(uint256(sortitionModule.phase()), uint256(ISortitionModule.Phase.staking), "Phase should be 0");
-        assertEq(sortitionModule.minStakingTime(), 18, "Wrong minStakingTime");
-        assertEq(sortitionModule.maxDrawingTime(), 24, "Wrong maxDrawingTime");
-        assertEq(sortitionModule.lastPhaseChange(), block.timestamp, "Wrong lastPhaseChange");
-        assertEq(sortitionModule.disputesWithoutJurors(), 0, "disputesWithoutJurors should be 0");
-        assertEq(address(sortitionModule.rng()), address(rng), "Wrong RNG address");
-        assertEq(sortitionModule.randomNumber(), 0, "randomNumber should be 0");
-        assertEq(sortitionModule.delayedStakeWriteIndex(), 0, "delayedStakeWriteIndex should be 0");
-        assertEq(sortitionModule.delayedStakeReadIndex(), 1, "Wrong delayedStakeReadIndex");
-
-        (uint256 K, uint256 nodeLength) = sortitionModule.getSortitionProperties(bytes32(uint256(FORKING_COURT)));
-        assertEq(K, 5, "Wrong tree K FORKING_COURT");
-        assertEq(nodeLength, 1, "Wrong node length for created tree FORKING_COURT");
-
-        (K, nodeLength) = sortitionModule.getSortitionProperties(bytes32(uint256(GENERAL_COURT)));
-        assertEq(K, 5, "Wrong tree K GENERAL_COURT");
-        assertEq(nodeLength, 1, "Wrong node length for created tree GENERAL_COURT");
-    }
-
-    function test_initialize_events() public {
-        KlerosCoreMock coreLogic = new KlerosCoreMock();
-        SortitionModuleMock smLogic = new SortitionModuleMock();
-        DisputeKitClassic dkLogic = new DisputeKitClassic();
-        pinakion = new PNK();
-
-        owner = msg.sender;
-        guardian = vm.addr(1);
-        staker1 = vm.addr(2);
-        other = vm.addr(9);
-        jurorProsecutionModule = vm.addr(8);
-        minStake = 1000;
-        alpha = 10000;
-        feeForJuror = 0.03 ether;
-        jurorsForCourtJump = 511;
-        timesPerPeriod = [60, 120, 180, 240];
-
-        pinakion.transfer(msg.sender, totalSupply - 1 ether);
-        pinakion.transfer(staker1, 1 ether);
-
-        sortitionExtraData = abi.encode(uint256(5));
-        minStakingTime = 18;
-        maxDrawingTime = 24;
-        hiddenVotes = false;
-
-        rngLookahead = 20;
-        rng = new BlockHashRNG(msg.sender, address(sortitionModule), rngLookahead);
-
-        UUPSProxy proxyCore = new UUPSProxy(address(coreLogic), "");
-
-        bytes memory initDataDk = abi.encodeWithSignature(
-            "initialize(address,address,address)",
-            owner,
-            address(proxyCore),
-            address(wNative)
-        );
-
-        UUPSProxy proxyDk = new UUPSProxy(address(dkLogic), initDataDk);
-        disputeKit = DisputeKitClassic(address(proxyDk));
-
-        bytes memory initDataSm = abi.encodeWithSignature(
-            "initialize(address,address,uint256,uint256,address)",
-            owner,
-            address(proxyCore),
-            minStakingTime,
-            maxDrawingTime,
-            rng
-        );
-
-        UUPSProxy proxySm = new UUPSProxy(address(smLogic), initDataSm);
-        sortitionModule = SortitionModuleMock(address(proxySm));
-        vm.prank(owner);
-        rng.changeConsumer(address(sortitionModule));
-
-        core = KlerosCoreMock(address(proxyCore));
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.DisputeKitCreated(DISPUTE_KIT_CLASSIC, disputeKit);
-        vm.expectEmit(true, true, true, true);
-
-        uint256[] memory supportedDK = new uint256[](1);
-        supportedDK[0] = DISPUTE_KIT_CLASSIC;
-        emit KlerosCoreBase.CourtCreated(
-            GENERAL_COURT,
-            FORKING_COURT,
-            false,
-            1000,
-            10000,
-            0.03 ether,
-            511,
-            [uint256(60), uint256(120), uint256(180), uint256(240)], // Explicitly convert otherwise it throws
-            supportedDK
-        );
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.DisputeKitEnabled(GENERAL_COURT, DISPUTE_KIT_CLASSIC, true);
-        core.initialize(
-            owner,
-            guardian,
-            pinakion,
-            jurorProsecutionModule,
-            disputeKit,
-            hiddenVotes,
-            [minStake, alpha, feeForJuror, jurorsForCourtJump],
-            timesPerPeriod,
-            sortitionExtraData,
-            sortitionModule,
-            address(wNative)
-        );
-    }
-
-    // ****************************************** //
-    // *             Governance  test           * //
-    // ****************************************** //
-
-    function test_pause() public {
-        vm.expectRevert(KlerosCoreBase.GuardianOrOwnerOnly.selector);
-        vm.prank(other);
-        core.pause();
-        // Note that we must explicitly switch to the owner/guardian address to make the call, otherwise Foundry treats UUPS proxy as msg.sender.
-        vm.prank(guardian);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.Paused();
-        core.pause();
-        assertEq(core.paused(), true, "Wrong paused value");
-        // Switch between owner and guardian to test both. WhenNotPausedOnly modifier is triggered after owner's check.
-        vm.prank(owner);
-        vm.expectRevert(KlerosCoreBase.WhenNotPausedOnly.selector);
-        core.pause();
-    }
-
-    function test_unpause() public {
-        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
-        vm.prank(other);
-        core.unpause();
-
-        vm.expectRevert(KlerosCoreBase.WhenPausedOnly.selector);
-        vm.prank(owner);
-        core.unpause();
-
-        vm.prank(owner);
-        core.pause();
-        vm.prank(owner);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.Unpaused();
-        core.unpause();
-        assertEq(core.paused(), false, "Wrong paused value");
-    }
-
-    function test_executeOwnerProposal() public {
-        bytes memory data = abi.encodeWithSignature("changeOwner(address)", other);
-        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
-        vm.prank(other);
-        core.executeOwnerProposal(address(core), 0, data);
-
-        vm.expectRevert(KlerosCoreBase.UnsuccessfulCall.selector);
-        vm.prank(owner);
-        core.executeOwnerProposal(address(core), 0, data); // It'll fail because the core is not its own owner
-
-        vm.prank(owner);
-        core.changeOwner(payable(address(core)));
-        vm.prank(address(core));
-        core.executeOwnerProposal(address(core), 0, data);
-        assertEq(core.owner(), other, "Wrong owner");
-    }
-
-    function test_changeOwner() public {
-        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
-        vm.prank(other);
-        core.changeOwner(payable(other));
-        vm.prank(owner);
-        core.changeOwner(payable(other));
-        assertEq(core.owner(), other, "Wrong owner");
-    }
-
-    function test_changeGuardian() public {
-        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
-        vm.prank(other);
-        core.changeGuardian(other);
-        vm.prank(owner);
-        core.changeGuardian(other);
-        assertEq(core.guardian(), other, "Wrong guardian");
-    }
-
-    function test_changePinakion() public {
-        PNK fakePNK = new PNK();
-        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
-        vm.prank(other);
-        core.changePinakion(fakePNK);
-        vm.prank(owner);
-        core.changePinakion(fakePNK);
-        assertEq(address(core.pinakion()), address(fakePNK), "Wrong PNK");
-    }
-
-    function test_changeJurorProsecutionModule() public {
-        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
-        vm.prank(other);
-        core.changeJurorProsecutionModule(other);
-        vm.prank(owner);
-        core.changeJurorProsecutionModule(other);
-        assertEq(core.jurorProsecutionModule(), other, "Wrong jurorProsecutionModule");
-    }
-
-    function test_changeSortitionModule() public {
-        SortitionModuleMock fakeSM = new SortitionModuleMock();
-        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
-        vm.prank(other);
-        core.changeSortitionModule(fakeSM);
-        vm.prank(owner);
-        core.changeSortitionModule(fakeSM);
-        assertEq(address(core.sortitionModule()), address(fakeSM), "Wrong sortitionModule");
-    }
-
-    function test_addNewDisputeKit() public {
-        DisputeKitSybilResistant newDK = new DisputeKitSybilResistant();
-        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
-        vm.prank(other);
-        core.addNewDisputeKit(newDK);
-        vm.prank(owner);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.DisputeKitCreated(2, newDK);
-        core.addNewDisputeKit(newDK);
-        assertEq(address(core.disputeKits(2)), address(newDK), "Wrong address of new DK");
-        assertEq(core.getDisputeKitsLength(), 3, "Wrong DK array length");
-    }
-
-    function test_createCourt() public {
-        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
-        vm.prank(other);
-        uint256[] memory supportedDK = new uint256[](2);
-        supportedDK[0] = DISPUTE_KIT_CLASSIC;
-        supportedDK[1] = 2; // New DK is added below.
-        core.createCourt(
-            GENERAL_COURT,
-            true, // Hidden votes
-            2000, // min stake
-            10000, // alpha
-            0.03 ether, // fee for juror
-            50, // jurors for jump
-            [uint256(10), uint256(20), uint256(30), uint256(40)], // Times per period
-            abi.encode(uint256(4)), // Sortition extra data
-            supportedDK
-        );
-
-        vm.expectRevert(KlerosCoreBase.MinStakeLowerThanParentCourt.selector);
-        vm.prank(owner);
-        core.createCourt(
-            GENERAL_COURT,
-            true, // Hidden votes
-            800, // min stake
-            10000, // alpha
-            0.03 ether, // fee for juror
-            50, // jurors for jump
-            [uint256(10), uint256(20), uint256(30), uint256(40)], // Times per period
-            abi.encode(uint256(4)), // Sortition extra data
-            supportedDK
-        );
-
-        vm.expectRevert(KlerosCoreBase.UnsupportedDisputeKit.selector);
-        vm.prank(owner);
-        uint256[] memory emptySupportedDK = new uint256[](0);
-        core.createCourt(
-            GENERAL_COURT,
-            true, // Hidden votes
-            2000, // min stake
-            10000, // alpha
-            0.03 ether, // fee for juror
-            50, // jurors for jump
-            [uint256(10), uint256(20), uint256(30), uint256(40)], // Times per period
-            abi.encode(uint256(4)), // Sortition extra data
-            emptySupportedDK
-        );
-
-        vm.expectRevert(KlerosCoreBase.InvalidForkingCourtAsParent.selector);
-        vm.prank(owner);
-        core.createCourt(
-            FORKING_COURT,
-            true, // Hidden votes
-            2000, // min stake
-            10000, // alpha
-            0.03 ether, // fee for juror
-            50, // jurors for jump
-            [uint256(10), uint256(20), uint256(30), uint256(40)], // Times per period
-            abi.encode(uint256(4)), // Sortition extra data
-            supportedDK
-        );
-
-        uint256[] memory badSupportedDK = new uint256[](2);
-        badSupportedDK[0] = NULL_DISPUTE_KIT; // Include NULL_DK to check that it reverts
-        badSupportedDK[1] = DISPUTE_KIT_CLASSIC;
-        vm.expectRevert(KlerosCoreBase.WrongDisputeKitIndex.selector);
-        vm.prank(owner);
-        core.createCourt(
-            GENERAL_COURT,
-            true, // Hidden votes
-            2000, // min stake
-            10000, // alpha
-            0.03 ether, // fee for juror
-            50, // jurors for jump
-            [uint256(10), uint256(20), uint256(30), uint256(40)], // Times per period
-            abi.encode(uint256(4)), // Sortition extra data
-            badSupportedDK
-        );
-
-        badSupportedDK[0] = DISPUTE_KIT_CLASSIC;
-        badSupportedDK[1] = 2; // Check out of bounds index
-        vm.expectRevert(KlerosCoreBase.WrongDisputeKitIndex.selector);
-        vm.prank(owner);
-        core.createCourt(
-            GENERAL_COURT,
-            true, // Hidden votes
-            2000, // min stake
-            10000, // alpha
-            0.03 ether, // fee for juror
-            50, // jurors for jump
-            [uint256(10), uint256(20), uint256(30), uint256(40)], // Times per period
-            abi.encode(uint256(4)), // Sortition extra data
-            badSupportedDK
-        );
-
-        // Add new DK to check the requirement for classic DK
-        DisputeKitSybilResistant newDK = new DisputeKitSybilResistant();
-        vm.prank(owner);
-        core.addNewDisputeKit(newDK);
-        badSupportedDK = new uint256[](1);
-        badSupportedDK[0] = 2; // Include only sybil resistant dk
-        vm.expectRevert(KlerosCoreBase.MustSupportDisputeKitClassic.selector);
-        vm.prank(owner);
-        core.createCourt(
-            GENERAL_COURT,
-            true, // Hidden votes
-            2000, // min stake
-            10000, // alpha
-            0.03 ether, // fee for juror
-            50, // jurors for jump
-            [uint256(10), uint256(20), uint256(30), uint256(40)], // Times per period
-            abi.encode(uint256(4)), // Sortition extra data
-            badSupportedDK
-        );
-
-        vm.prank(owner);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.DisputeKitEnabled(2, DISPUTE_KIT_CLASSIC, true);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.DisputeKitEnabled(2, 2, true);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.CourtCreated(
-            2,
-            GENERAL_COURT,
-            true,
-            2000,
-            20000,
-            0.04 ether,
-            50,
-            [uint256(10), uint256(20), uint256(30), uint256(40)], // Explicitly convert otherwise it throws
-            supportedDK
-        );
-        core.createCourt(
-            GENERAL_COURT,
-            true, // Hidden votes
-            2000, // min stake
-            20000, // alpha
-            0.04 ether, // fee for juror
-            50, // jurors for jump
-            [uint256(10), uint256(20), uint256(30), uint256(40)], // Times per period
-            abi.encode(uint256(4)), // Sortition extra data
-            supportedDK
-        );
-
-        (
-            uint96 courtParent,
-            bool courtHiddenVotes,
-            uint256 courtMinStake,
-            uint256 courtAlpha,
-            uint256 courtFeeForJuror,
-            uint256 courtJurorsForCourtJump,
-            bool courtDisabled
-        ) = core.courts(2);
-        assertEq(courtParent, GENERAL_COURT, "Wrong court parent");
-        assertEq(courtHiddenVotes, true, "Wrong hiddenVotes value");
-        assertEq(courtMinStake, 2000, "Wrong minStake value");
-        assertEq(courtAlpha, 20000, "Wrong alpha value");
-        assertEq(courtFeeForJuror, 0.04 ether, "Wrong feeForJuror value");
-        assertEq(courtJurorsForCourtJump, 50, "Wrong jurorsForCourtJump value");
-        assertEq(courtDisabled, false, "Court should not be disabled");
-
-        uint256[] memory children = core.getCourtChildren(2);
-        assertEq(children.length, 0, "No children");
-        uint256[4] memory courtTimesPerPeriod = core.getTimesPerPeriod(2);
-        assertEq(courtTimesPerPeriod[0], uint256(10), "Wrong times per period 0");
-        assertEq(courtTimesPerPeriod[1], uint256(20), "Wrong times per period 1");
-        assertEq(courtTimesPerPeriod[2], uint256(30), "Wrong times per period 2");
-        assertEq(courtTimesPerPeriod[3], uint256(40), "Wrong times per period 3");
-
-        children = core.getCourtChildren(GENERAL_COURT); // Check that parent updated children
-        assertEq(children.length, 1, "Wrong children count");
-        assertEq(children[0], 2, "Wrong child id");
-
-        (uint256 K, uint256 nodeLength) = sortitionModule.getSortitionProperties(bytes32(uint256(2)));
-        assertEq(K, 4, "Wrong tree K of the new court");
-        assertEq(nodeLength, 1, "Wrong node length for created tree of the new court");
-    }
-
-    function test_changeCourtParameters() public {
-        // Create a 2nd court to check the minStake requirements
-        vm.prank(owner);
-        uint96 newCourtID = 2;
-        uint256[] memory supportedDK = new uint256[](1);
-        supportedDK[0] = DISPUTE_KIT_CLASSIC;
-        core.createCourt(
-            GENERAL_COURT,
-            true, // Hidden votes
-            2000, // min stake
-            20000, // alpha
-            0.04 ether, // fee for juror
-            50, // jurors for jump
-            [uint256(10), uint256(20), uint256(30), uint256(40)], // Times per period
-            abi.encode(uint256(4)), // Sortition extra data
-            supportedDK
-        );
-
-        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
-        vm.prank(other);
-        core.changeCourtParameters(
-            GENERAL_COURT,
-            true, // Hidden votes
-            2000, // min stake
-            10000, // alpha
-            0.03 ether, // fee for juror
-            50, // jurors for jump
-            [uint256(10), uint256(20), uint256(30), uint256(40)] // Times per period
-        );
-        vm.expectRevert(KlerosCoreBase.MinStakeLowerThanParentCourt.selector);
-        vm.prank(owner);
-        // Min stake of a parent became higher than of a child
-        core.changeCourtParameters(
-            GENERAL_COURT,
-            true, // Hidden votes
-            3000, // min stake
-            10000, // alpha
-            0.03 ether, // fee for juror
-            50, // jurors for jump
-            [uint256(10), uint256(20), uint256(30), uint256(40)] // Times per period
-        );
-        // Min stake of a child became lower than of a parent
-        vm.expectRevert(KlerosCoreBase.MinStakeLowerThanParentCourt.selector);
-        vm.prank(owner);
-        core.changeCourtParameters(
-            newCourtID,
-            true, // Hidden votes
-            800, // min stake
-            10000, // alpha
-            0.03 ether, // fee for juror
-            50, // jurors for jump
-            [uint256(10), uint256(20), uint256(30), uint256(40)] // Times per period
-        );
-
-        vm.prank(owner);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.CourtModified(
-            GENERAL_COURT,
-            true,
-            2000,
-            20000,
-            0.04 ether,
-            50,
-            [uint256(10), uint256(20), uint256(30), uint256(40)] // Explicitly convert otherwise it throws
-        );
-        core.changeCourtParameters(
-            GENERAL_COURT,
-            true, // Hidden votes
-            2000, // min stake
-            20000, // alpha
-            0.04 ether, // fee for juror
-            50, // jurors for jump
-            [uint256(10), uint256(20), uint256(30), uint256(40)] // Times per period
-        );
-
-        (
-            uint96 courtParent,
-            bool courtHiddenVotes,
-            uint256 courtMinStake,
-            uint256 courtAlpha,
-            uint256 courtFeeForJuror,
-            uint256 courtJurorsForCourtJump,
-            bool courtDisabled
-        ) = core.courts(GENERAL_COURT);
-        assertEq(courtHiddenVotes, true, "Wrong hiddenVotes value");
-        assertEq(courtMinStake, 2000, "Wrong minStake value");
-        assertEq(courtAlpha, 20000, "Wrong alpha value");
-        assertEq(courtFeeForJuror, 0.04 ether, "Wrong feeForJuror value");
-        assertEq(courtJurorsForCourtJump, 50, "Wrong jurorsForCourtJump value");
-        assertEq(courtDisabled, false, "Court should not be disabled");
-
-        uint256[4] memory courtTimesPerPeriod = core.getTimesPerPeriod(GENERAL_COURT);
-        assertEq(courtTimesPerPeriod[0], uint256(10), "Wrong times per period 0");
-        assertEq(courtTimesPerPeriod[1], uint256(20), "Wrong times per period 1");
-        assertEq(courtTimesPerPeriod[2], uint256(30), "Wrong times per period 2");
-        assertEq(courtTimesPerPeriod[3], uint256(40), "Wrong times per period 3");
-    }
-
-    function test_enableDisputeKits() public {
-        DisputeKitSybilResistant newDK = new DisputeKitSybilResistant();
-        uint256 newDkID = 2;
-        vm.prank(owner);
-        core.addNewDisputeKit(newDK);
-
-        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
-        vm.prank(other);
-        uint256[] memory supportedDK = new uint256[](1);
-        supportedDK[0] = newDkID;
-        core.enableDisputeKits(GENERAL_COURT, supportedDK, true);
-
-        vm.expectRevert(KlerosCoreBase.WrongDisputeKitIndex.selector);
-        vm.prank(owner);
-        supportedDK[0] = NULL_DISPUTE_KIT;
-        core.enableDisputeKits(GENERAL_COURT, supportedDK, true);
-
-        vm.expectRevert(KlerosCoreBase.WrongDisputeKitIndex.selector);
-        vm.prank(owner);
-        supportedDK[0] = 3; // Out of bounds
-        core.enableDisputeKits(GENERAL_COURT, supportedDK, true);
-
-        vm.expectRevert(KlerosCoreBase.CannotDisableClassicDK.selector);
-        vm.prank(owner);
-        supportedDK[0] = DISPUTE_KIT_CLASSIC;
-        core.enableDisputeKits(GENERAL_COURT, supportedDK, false);
-
-        vm.prank(owner);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.DisputeKitEnabled(GENERAL_COURT, newDkID, true);
-        supportedDK[0] = newDkID;
-        core.enableDisputeKits(GENERAL_COURT, supportedDK, true);
-        assertEq(core.isSupported(GENERAL_COURT, newDkID), true, "New DK should be supported by General court");
-
-        vm.prank(owner);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.DisputeKitEnabled(GENERAL_COURT, newDkID, false);
-        core.enableDisputeKits(GENERAL_COURT, supportedDK, false);
-        assertEq(core.isSupported(GENERAL_COURT, newDkID), false, "New DK should be disabled in General court");
-    }
-
-    function test_changeAcceptedFeeTokens() public {
-        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
-        vm.prank(other);
-        core.changeAcceptedFeeTokens(feeToken, true);
-
-        (bool accepted, , ) = core.currencyRates(feeToken);
-        assertEq(accepted, false, "Token should not be accepted yet");
-
-        vm.prank(owner);
-        vm.expectEmit(true, true, true, true);
-        emit IArbitratorV2.AcceptedFeeToken(feeToken, true);
-        core.changeAcceptedFeeTokens(feeToken, true);
-        (accepted, , ) = core.currencyRates(feeToken);
-        assertEq(accepted, true, "Token should be accepted");
-    }
-
-    function test_changeCurrencyRates() public {
-        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
-        vm.prank(other);
-        core.changeCurrencyRates(feeToken, 100, 200);
-
-        (, uint256 rateInEth, uint256 rateDecimals) = core.currencyRates(feeToken);
-        assertEq(rateInEth, 0, "rateInEth should be 0");
-        assertEq(rateDecimals, 0, "rateDecimals should be 0");
-
-        vm.prank(owner);
-        vm.expectEmit(true, true, true, true);
-        emit IArbitratorV2.NewCurrencyRate(feeToken, 100, 200);
-        core.changeCurrencyRates(feeToken, 100, 200);
-
-        (, rateInEth, rateDecimals) = core.currencyRates(feeToken);
-        assertEq(rateInEth, 100, "rateInEth is incorrect");
-        assertEq(rateDecimals, 200, "rateDecimals is incorrect");
-    }
-
-    function test_extraDataToCourtIDMinJurorsDisputeKit() public {
-        // Standard values
-        bytes memory extraData = abi.encodePacked(uint256(GENERAL_COURT), DEFAULT_NB_OF_JURORS, DISPUTE_KIT_CLASSIC);
-
-        (uint96 courtID, uint256 minJurors, uint256 disputeKitID) = core.extraDataToCourtIDMinJurorsDisputeKit(
-            extraData
-        );
-        assertEq(courtID, GENERAL_COURT, "Wrong courtID");
-        assertEq(minJurors, DEFAULT_NB_OF_JURORS, "Wrong minJurors");
-        assertEq(disputeKitID, DISPUTE_KIT_CLASSIC, "Wrong disputeKitID");
-
-        // Botched extraData. Values should fall into standard
-        extraData = "0xfa";
-
-        (courtID, minJurors, disputeKitID) = core.extraDataToCourtIDMinJurorsDisputeKit(extraData);
-        assertEq(courtID, GENERAL_COURT, "Wrong courtID");
-        assertEq(minJurors, DEFAULT_NB_OF_JURORS, "Wrong minJurors");
-        assertEq(disputeKitID, DISPUTE_KIT_CLASSIC, "Wrong disputeKitID");
-
-        // Custom values.
-        vm.startPrank(owner);
-        core.addNewDisputeKit(disputeKit);
-        core.addNewDisputeKit(disputeKit);
-        core.addNewDisputeKit(disputeKit);
-        core.addNewDisputeKit(disputeKit);
-        core.addNewDisputeKit(disputeKit);
-        extraData = abi.encodePacked(uint256(50), uint256(41), uint256(6));
-
-        (courtID, minJurors, disputeKitID) = core.extraDataToCourtIDMinJurorsDisputeKit(extraData);
-        assertEq(courtID, GENERAL_COURT, "Wrong courtID"); // Value in extra data is out of scope so fall back
-        assertEq(minJurors, 41, "Wrong minJurors");
-        assertEq(disputeKitID, 6, "Wrong disputeKitID");
-    }
-
-    // *************************************** //
-    // *             Staking  test           * //
-    // *************************************** //
-
-    function test_setStake_increase() public {
-        vm.prank(owner);
-        core.pause();
-        vm.expectRevert(KlerosCoreBase.WhenNotPausedOnly.selector);
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 1000);
-        vm.prank(owner);
-        core.unpause();
-
-        vm.expectRevert(KlerosCoreBase.StakingNotPossibleInThisCourt.selector);
-        vm.prank(staker1);
-        core.setStake(FORKING_COURT, 1000);
-
-        uint96 badCourtID = 2;
-        vm.expectRevert(KlerosCoreBase.StakingNotPossibleInThisCourt.selector);
-        vm.prank(staker1);
-        core.setStake(badCourtID, 1000);
-
-        vm.expectRevert(KlerosCoreBase.StakingLessThanCourtMinStake.selector);
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 800);
-
-        vm.expectRevert(KlerosCoreBase.StakingZeroWhenNoStake.selector);
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 0);
-
-        vm.prank(staker1);
-        vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeSet(staker1, GENERAL_COURT, 1001, 1001);
-        core.setStake(GENERAL_COURT, 1001);
-
-        (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts) = sortitionModule
-            .getJurorBalance(staker1, GENERAL_COURT);
-        assertEq(totalStaked, 1001, "Wrong amount total staked");
-        assertEq(totalLocked, 0, "Wrong amount locked");
-        assertEq(stakedInCourt, 1001, "Wrong amount staked in court");
-        assertEq(nbCourts, 1, "Wrong number of courts");
-
-        uint96[] memory courts = sortitionModule.getJurorCourtIDs(staker1);
-        assertEq(courts.length, 1, "Wrong courts count");
-        assertEq(courts[0], GENERAL_COURT, "Wrong court id");
-        assertEq(sortitionModule.isJurorStaked(staker1), true, "Juror should be staked");
-
-        assertEq(pinakion.balanceOf(address(core)), 1001, "Wrong token balance of the core");
-        assertEq(pinakion.balanceOf(staker1), 999999999999998999, "Wrong token balance of staker1"); // 1 eth - 1001 wei
-        assertEq(pinakion.allowance(staker1, address(core)), 999999999999998999, "Wrong allowance for staker1");
-
-        vm.expectRevert(KlerosCoreBase.StakingTransferFailed.selector); // This  error will be caught because owner didn't approve any tokens for KlerosCore
-        vm.prank(owner);
-        core.setStake(GENERAL_COURT, 1000);
-
-        // Increase stake one more time to verify the correct behavior
-        vm.prank(staker1);
-        vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeSet(staker1, GENERAL_COURT, 2000, 2000);
-        core.setStake(GENERAL_COURT, 2000);
-
-        (totalStaked, totalLocked, stakedInCourt, nbCourts) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
-        assertEq(totalStaked, 2000, "Wrong amount total staked");
-        assertEq(totalLocked, 0, "Wrong amount locked");
-        assertEq(stakedInCourt, 2000, "Wrong amount staked in court");
-        assertEq(nbCourts, 1, "Number of courts should not increase");
-
-        assertEq(pinakion.balanceOf(address(core)), 2000, "Wrong token balance of the core");
-        assertEq(pinakion.balanceOf(staker1), 999999999999998000, "Wrong token balance of staker1"); // 1 eth - 2000 wei
-        assertEq(pinakion.allowance(staker1, address(core)), 999999999999998000, "Wrong allowance for staker1");
-    }
-
-    function test_setStake_decrease() public {
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 2000);
-        assertEq(pinakion.balanceOf(address(core)), 2000, "Wrong token balance of the core");
-        assertEq(pinakion.balanceOf(staker1), 999999999999998000, "Wrong token balance of staker1");
-        assertEq(pinakion.allowance(staker1, address(core)), 999999999999998000, "Wrong allowance for staker1");
-
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 1500); // Decrease the stake to see if it's reflected correctly
-        (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts) = sortitionModule
-            .getJurorBalance(staker1, GENERAL_COURT);
-        assertEq(totalStaked, 1500, "Wrong amount total staked");
-        assertEq(totalLocked, 0, "Wrong amount locked");
-        assertEq(stakedInCourt, 1500, "Wrong amount staked in court");
-        assertEq(nbCourts, 1, "Wrong number of courts");
-
-        uint96[] memory courts = sortitionModule.getJurorCourtIDs(staker1);
-        assertEq(courts.length, 1, "Wrong courts count");
-        assertEq(courts[0], GENERAL_COURT, "Wrong court id");
-        assertEq(sortitionModule.isJurorStaked(staker1), true, "Juror should be staked");
-
-        assertEq(pinakion.balanceOf(address(core)), 1500, "Wrong token balance of the core");
-        assertEq(pinakion.balanceOf(staker1), 999999999999998500, "Wrong token balance of staker1");
-        assertEq(
-            pinakion.allowance(staker1, address(core)),
-            999999999999998000,
-            "Allowance should not change during withdrawal"
-        );
-
-        vm.prank(address(core));
-        pinakion.transfer(staker1, 1); // Manually send 1 token to make the withdrawal fail
-
-        vm.expectRevert(KlerosCoreBase.UnstakingTransferFailed.selector);
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 0);
-
-        vm.prank(address(staker1));
-        pinakion.transfer(address(core), 1); // Manually give the token back
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 0);
-
-        (totalStaked, totalLocked, stakedInCourt, nbCourts) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
-        assertEq(totalStaked, 0, "Wrong amount total staked");
-        assertEq(totalLocked, 0, "Wrong amount locked");
-        assertEq(stakedInCourt, 0, "Wrong amount staked in court");
-        assertEq(nbCourts, 0, "Wrong number of courts");
-
-        courts = sortitionModule.getJurorCourtIDs(staker1);
-        assertEq(courts.length, 0, "Wrong courts count");
-        assertEq(sortitionModule.isJurorStaked(staker1), false, "Juror should not be staked");
-
-        assertEq(pinakion.balanceOf(address(core)), 0, "Wrong token balance of the core");
-        assertEq(pinakion.balanceOf(staker1), 1 ether, "Wrong token balance of staker1");
-        assertEq(
-            pinakion.allowance(staker1, address(core)),
-            999999999999998000,
-            "Allowance should not change during withdrawal"
-        );
-    }
-
-    function test_setStake_maxStakePathCheck() public {
-        uint256[] memory supportedDK = new uint256[](1);
-        supportedDK[0] = DISPUTE_KIT_CLASSIC;
-
-        // Create 4 courts to check the require
-        for (uint96 i = GENERAL_COURT; i <= 4; i++) {
-            vm.prank(owner);
-            core.createCourt(
-                GENERAL_COURT,
-                true,
-                2000,
-                20000,
-                0.04 ether,
-                50,
-                [uint256(10), uint256(20), uint256(30), uint256(40)],
-                abi.encode(uint256(4)),
-                supportedDK
-            );
-            vm.prank(staker1);
-            core.setStake(i, 2000);
-        }
-
-        uint96[] memory courts = sortitionModule.getJurorCourtIDs(staker1);
-        assertEq(courts.length, 4, "Wrong courts count");
-
-        uint96 excessiveCourtID = 5;
-        vm.expectRevert(KlerosCoreBase.StakingInTooManyCourts.selector);
-        vm.prank(staker1);
-        core.setStake(excessiveCourtID, 2000);
-    }
-
-    function test_setStake_increaseDrawingPhase() public {
-        // Set the stake and create a dispute to advance the phase
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 1000);
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-        assertEq(sortitionModule.disputesWithoutJurors(), 1, "Wrong disputesWithoutJurors count");
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-
-        assertEq(pinakion.balanceOf(address(core)), 1000, "Wrong token balance of the core");
-        assertEq(pinakion.balanceOf(staker1), 999999999999999000, "Wrong token balance of staker1");
-        assertEq(uint256(sortitionModule.phase()), uint256(ISortitionModule.Phase.drawing), "Wrong phase");
-
-        vm.prank(staker1);
-        vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeDelayed(staker1, GENERAL_COURT, 1500);
-        core.setStake(GENERAL_COURT, 1500);
-
-        uint256 delayedStakeId = sortitionModule.delayedStakeWriteIndex();
-        assertEq(delayedStakeId, 1, "Wrong delayedStakeWriteIndex");
-        assertEq(sortitionModule.delayedStakeReadIndex(), 1, "Wrong delayedStakeReadIndex");
-        (address account, uint96 courtID, uint256 stake, bool alreadyTransferred) = sortitionModule.delayedStakes(
-            delayedStakeId
-        );
-        assertEq(account, staker1, "Wrong staker account");
-        assertEq(courtID, GENERAL_COURT, "Wrong court id");
-        assertEq(stake, 1500, "Wrong amount staked in court");
-        assertEq(alreadyTransferred, false, "Should be flagged as transferred");
-
-        (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts) = sortitionModule
-            .getJurorBalance(staker1, GENERAL_COURT);
-        assertEq(totalStaked, 1000, "Wrong amount total staked");
-        assertEq(totalLocked, 0, "Wrong amount locked");
-        assertEq(stakedInCourt, 1000, "Amount staked in court should not change until delayed stake is executed");
-        assertEq(nbCourts, 1, "Wrong number of courts");
-
-        uint96[] memory courts = sortitionModule.getJurorCourtIDs(staker1);
-        assertEq(courts.length, 1, "Wrong courts count");
-        assertEq(courts[0], GENERAL_COURT, "Wrong court id");
-        assertEq(sortitionModule.isJurorStaked(staker1), true, "Juror should be staked");
-
-        assertEq(pinakion.balanceOf(address(core)), 1000, "Wrong token balance of the core");
-        assertEq(pinakion.balanceOf(staker1), 999999999999999000, "Wrong token balance of staker1");
-    }
-
-    function test_setStake_decreaseDrawingPhase() public {
-        // Set the stake and create a dispute to advance the phase
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 2000);
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-
-        assertEq(pinakion.balanceOf(address(core)), 2000, "Wrong token balance of the core");
-        assertEq(pinakion.balanceOf(staker1), 999999999999998000, "Wrong token balance of staker1");
-
-        vm.prank(staker1);
-        vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeDelayed(staker1, GENERAL_COURT, 1800);
-        core.setStake(GENERAL_COURT, 1800);
-
-        (uint256 totalStaked, , uint256 stakedInCourt, ) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
-        assertEq(totalStaked, 2000, "Total staked amount should not change");
-        assertEq(stakedInCourt, 2000, "Amount staked in court should not change");
-
-        assertEq(pinakion.balanceOf(address(core)), 2000, "Token balance of the core should not change");
-        assertEq(pinakion.balanceOf(staker1), 999999999999998000, "Wrong token balance of staker1");
-    }
-
-    function test_setStake_LockedTokens() public {
-        // Check that correct amount is taken when locked tokens amount exceeds the staked amount
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 10000);
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-
-        uint256 disputeID = 0;
-        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
-        (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts) = sortitionModule
-            .getJurorBalance(staker1, GENERAL_COURT);
-        assertEq(totalStaked, 10000, "Wrong amount total staked");
-        assertEq(totalLocked, 3000, "Wrong amount locked"); // 1000 per draw and the juror was drawn 3 times
-        assertEq(stakedInCourt, 10000, "Wrong amount staked in court");
-
-        sortitionModule.passPhase(); // Staking
-
-        assertEq(pinakion.balanceOf(address(core)), 10000, "Wrong token balance of the core");
-        assertEq(pinakion.balanceOf(staker1), 999999999999990000, "Wrong token balance of staker1");
-
-        // Unstake to check that locked tokens won't be withdrawn
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 0);
-
-        (totalStaked, totalLocked, stakedInCourt, nbCourts) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
-        assertEq(totalStaked, 3000, "Wrong amount total staked");
-        assertEq(totalLocked, 3000, "Wrong amount locked");
-        assertEq(stakedInCourt, 0, "Wrong amount staked in court");
-        assertEq(nbCourts, 0, "Wrong amount staked in court");
-
-        assertEq(pinakion.balanceOf(address(core)), 3000, "Wrong token balance of the core");
-        assertEq(pinakion.balanceOf(staker1), 999999999999997000, "Wrong token balance of staker1");
-
-        // Stake again to check the behaviour.
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 5000);
-
-        (totalStaked, totalLocked, stakedInCourt, nbCourts) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
-        assertEq(totalStaked, 8000, "Wrong amount total staked"); // 5000 were added to the previous 3000.
-        assertEq(totalLocked, 3000, "Wrong amount locked");
-        assertEq(stakedInCourt, 5000, "Wrong amount staked in court");
-        assertEq(nbCourts, 1, "Wrong amount staked in court");
-
-        assertEq(pinakion.balanceOf(address(core)), 8000, "Wrong amount of tokens in Core");
-        assertEq(pinakion.balanceOf(staker1), 999999999999992000, "Wrong token balance of staker1");
-    }
-
-    function test_executeDelayedStakes() public {
-        // Stake as staker2 as well to diversify the execution of delayed stakes
-        vm.prank(staker2);
-        core.setStake(GENERAL_COURT, 10000);
-
-        vm.expectRevert(SortitionModuleBase.NoDelayedStakeToExecute.selector);
-        sortitionModule.executeDelayedStakes(5);
-
-        // Set the stake and create a dispute to advance the phase
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-        uint256 disputeID = 0;
-        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
-
-        vm.expectRevert(SortitionModuleBase.NotStakingPhase.selector);
-        sortitionModule.executeDelayedStakes(5);
-
-        // Create delayed stake
-        vm.prank(staker1);
-        vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeDelayed(staker1, GENERAL_COURT, 1500);
-        core.setStake(GENERAL_COURT, 1500);
-
-        assertEq(pinakion.balanceOf(address(core)), 10000, "Wrong token balance of the core"); // Balance should not increase because the stake was delayed
-        assertEq(pinakion.balanceOf(staker1), 1 ether, "Wrong token balance of staker1");
-
-        // Create delayed stake for another staker
-        vm.prank(staker2);
-        vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeDelayed(staker2, GENERAL_COURT, 0);
-        core.setStake(GENERAL_COURT, 0);
-        assertEq(pinakion.balanceOf(staker2), 999999999999990000, "Wrong token balance of staker2"); // Balance should not change since wrong phase
-
-        // Create another delayed stake for staker1 on top of it to check the execution
-        vm.prank(staker1);
-        vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeDelayed(staker1, GENERAL_COURT, 1800);
-        core.setStake(GENERAL_COURT, 1800);
-
-        assertEq(sortitionModule.delayedStakeWriteIndex(), 3, "Wrong delayedStakeWriteIndex");
-        assertEq(sortitionModule.delayedStakeReadIndex(), 1, "Wrong delayedStakeReadIndex");
-
-        (address account, uint96 courtID, uint256 stake, bool alreadyTransferred) = sortitionModule.delayedStakes(1);
-
-        // Check each delayed stake
-        assertEq(account, staker1, "Wrong staker account for the first delayed stake");
-        assertEq(courtID, GENERAL_COURT, "Wrong court ID");
-        assertEq(stake, 1500, "Wrong staking amount");
-        assertEq(alreadyTransferred, false, "Should be false");
-
-        (account, courtID, stake, alreadyTransferred) = sortitionModule.delayedStakes(2);
-        assertEq(account, staker2, "Wrong staker2 account");
-        assertEq(courtID, GENERAL_COURT, "Wrong court id for staker2");
-        assertEq(stake, 0, "Wrong amount for delayed stake of staker2");
-        assertEq(alreadyTransferred, false, "Should be false");
-
-        (account, courtID, stake, alreadyTransferred) = sortitionModule.delayedStakes(3);
-        assertEq(account, staker1, "Wrong staker1 account");
-        assertEq(courtID, GENERAL_COURT, "Wrong court id for staker1");
-        assertEq(stake, 1800, "Wrong amount for delayed stake of staker1");
-        assertEq(alreadyTransferred, false, "Should be false");
-
-        // So far the only amount transferred was 10000 by staker2. Staker 1 has two delayed stakes, for 1500 and 1800 pnk.
-        assertEq(pinakion.balanceOf(address(core)), 10000, "Wrong token balance of the core");
-        assertEq(pinakion.balanceOf(staker1), 1 ether, "Wrong token balance of staker1");
-        assertEq(pinakion.balanceOf(staker2), 999999999999990000, "Wrong token balance of staker2");
-
-        (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts) = sortitionModule
-            .getJurorBalance(staker1, GENERAL_COURT); // Only check the first staker to check how consecutive delayed stakes are handled.
-        // Balances shouldn't be updated yet.
-        assertEq(totalStaked, 0, "Wrong amount total staked");
-        assertEq(totalLocked, 0, "Wrong amount locked");
-        assertEq(stakedInCourt, 0, "Wrong amount staked in court");
-        assertEq(nbCourts, 0, "Wrong number of courts");
-
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Staking. Delayed stakes can be executed now
-
-        vm.prank(address(core));
-        pinakion.transfer(owner, 10000); // Dispose of the tokens of 2nd staker to make the execution fail for the 2nd delayed stake
-        assertEq(pinakion.balanceOf(address(core)), 0, "Wrong token balance of the core");
-
-        // 2 events should be emitted but the 2nd stake supersedes the first one in the end.
-        vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeSet(staker1, GENERAL_COURT, 1500, 1500);
-        vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeSet(staker1, GENERAL_COURT, 1800, 1800);
-        sortitionModule.executeDelayedStakes(20); // Deliberately ask for more iterations than needed
-
-        assertEq(sortitionModule.delayedStakeWriteIndex(), 3, "Wrong delayedStakeWriteIndex");
-        assertEq(sortitionModule.delayedStakeReadIndex(), 4, "Wrong delayedStakeReadIndex");
-
-        // Check that delayed stakes are nullified
-        for (uint i = 2; i <= sortitionModule.delayedStakeWriteIndex(); i++) {
-            (account, courtID, stake, alreadyTransferred) = sortitionModule.delayedStakes(i);
-
-            assertEq(account, address(0), "Wrong staker account after delayed stake deletion");
-            assertEq(courtID, 0, "Court id should be nullified");
-            assertEq(stake, 0, "No amount to stake");
-            assertEq(alreadyTransferred, false, "Should be false");
-        }
-
-        assertEq(pinakion.balanceOf(staker1), 999999999999998200, "Wrong token balance of staker1");
-
-        (totalStaked, totalLocked, stakedInCourt, nbCourts) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
-        assertEq(totalStaked, 1800, "Wrong amount total staked");
-        assertEq(totalLocked, 0, "Wrong amount locked");
-        assertEq(stakedInCourt, 1800, "Wrong amount staked in court");
-        assertEq(nbCourts, 1, "Wrong amount staked in court");
-
-        // Staker2 not getting the tokens back indicates that his delayed stake was skipped and the flow wasn't disrupted
-        assertEq(pinakion.balanceOf(staker2), 999999999999990000, "Wrong token balance of staker2");
-    }
-
-    function test_setStakeBySortitionModule() public {
-        // Note that functionality of this function was checked during delayed stakes execution
-        vm.expectRevert(KlerosCoreBase.SortitionModuleOnly.selector);
-        vm.prank(owner);
-        core.setStakeBySortitionModule(staker1, GENERAL_COURT, 1000);
-    }
-
-    function test_setStake_snapshotProxyCheck() public {
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 12346);
-
-        KlerosCoreSnapshotProxy snapshotProxy = new KlerosCoreSnapshotProxy(owner, IKlerosCore(address(core)));
-        assertEq(snapshotProxy.name(), "Staked Pinakion", "Wrong name of the proxy token");
-        assertEq(snapshotProxy.symbol(), "stPNK", "Wrong symbol of the proxy token");
-        assertEq(snapshotProxy.decimals(), 18, "Wrong decimals of the proxy token");
-        assertEq(snapshotProxy.owner(), msg.sender, "Wrong owner");
-        assertEq(address(snapshotProxy.core()), address(core), "Wrong core in snapshot proxy");
-        assertEq(snapshotProxy.balanceOf(staker1), 12346, "Wrong stPNK balance");
-
-        vm.prank(other);
-        vm.expectRevert(KlerosCoreSnapshotProxy.OwnerOnly.selector);
-        snapshotProxy.changeCore(IKlerosCore(other));
-        vm.prank(owner);
-        snapshotProxy.changeCore(IKlerosCore(other));
-        assertEq(address(snapshotProxy.core()), other, "Wrong core in snapshot proxy after change");
-
-        vm.prank(other);
-        vm.expectRevert(KlerosCoreSnapshotProxy.OwnerOnly.selector);
-        snapshotProxy.changeOwner(other);
-        vm.prank(owner);
-        snapshotProxy.changeOwner(other);
-        assertEq(snapshotProxy.owner(), other, "Wrong owner after change");
-    }
-
-    // *************************************** //
-    // *             Disputes                * //
-    // *************************************** //
-
-    function test_createDispute_eth() public {
-        // Create a new court and DK to test non-standard extra data
-        uint256 newFee = 0.01 ether;
-        uint96 newCourtID = 2;
-        uint256 newNbJurors = 4;
-        uint256 newDkID = 2;
-        uint256[] memory supportedDK = new uint256[](1);
-        supportedDK[0] = DISPUTE_KIT_CLASSIC;
-        bytes memory newExtraData = abi.encodePacked(uint256(newCourtID), newNbJurors, newDkID);
-
-        vm.prank(owner);
-        core.addNewDisputeKit(disputeKit); // Just add the same dk to avoid dealing with initialization
-        vm.prank(owner);
-        core.createCourt(
-            GENERAL_COURT,
-            true, // Hidden votes
-            2000, // min stake
-            20000, // alpha
-            newFee, // fee for juror
-            50, // jurors for jump
-            [uint256(10), uint256(20), uint256(30), uint256(40)], // Times per period
-            abi.encode(uint256(4)), // Sortition extra data
-            supportedDK
-        );
-
-        arbitrable.changeArbitratorExtraData(newExtraData);
-
-        vm.expectRevert(KlerosCoreBase.ArbitrationFeesNotEnough.selector);
-        vm.prank(disputer);
-        arbitrable.createDispute{value: newFee * newNbJurors - 1}("Action");
-
-        vm.expectRevert(KlerosCoreBase.DisputeKitNotSupportedByCourt.selector);
-        vm.prank(disputer);
-        arbitrable.createDispute{value: 0.04 ether}("Action");
-
-        vm.prank(owner);
-        supportedDK = new uint256[](1);
-        supportedDK[0] = newDkID;
-        core.enableDisputeKits(newCourtID, supportedDK, true);
-
-        uint256 disputeID = 0;
-        uint256 nbChoices = 2;
-        vm.prank(disputer);
-        vm.expectEmit(true, true, true, true);
-        emit DisputeKitClassicBase.DisputeCreation(disputeID, nbChoices, newExtraData);
-        vm.expectEmit(true, true, true, true);
-        emit IArbitratorV2.DisputeCreation(disputeID, arbitrable);
-        arbitrable.createDispute{value: 0.04 ether}("Action");
-
-        assertEq(sortitionModule.disputesWithoutJurors(), 1, "Wrong disputesWithoutJurors count");
-        (
-            uint96 courtID,
-            IArbitrableV2 arbitrated,
-            KlerosCoreBase.Period period,
-            bool ruled,
-            uint256 lastPeriodChange
-        ) = core.disputes(disputeID);
-
-        assertEq(courtID, newCourtID, "Wrong court ID");
-        assertEq(address(arbitrated), address(arbitrable), "Wrong arbitrable");
-        assertEq(uint256(period), uint256(KlerosCoreBase.Period.evidence), "Wrong period");
-        assertEq(ruled, false, "Should not be ruled");
-        assertEq(lastPeriodChange, block.timestamp, "Wrong lastPeriodChange");
-
-        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 0);
-        assertEq(round.disputeKitID, newDkID, "Wrong DK ID");
-        assertEq(round.pnkAtStakePerJuror, 4000, "Wrong pnkAtStakePerJuror"); // minStake * alpha / divisor = 2000 * 20000/10000
-        assertEq(round.totalFeesForJurors, 0.04 ether, "Wrong totalFeesForJurors");
-        assertEq(round.nbVotes, 4, "Wrong nbVotes");
-        assertEq(round.repartitions, 0, "repartitions should be 0");
-        assertEq(round.pnkPenalties, 0, "pnkPenalties should be 0");
-        assertEq(round.sumFeeRewardPaid, 0, "sumFeeRewardPaid should be 0");
-        assertEq(round.sumPnkRewardPaid, 0, "sumPnkRewardPaid should be 0");
-        assertEq(address(round.feeToken), address(0), "feeToken should be 0");
-        assertEq(round.drawIterations, 0, "drawIterations should be 0");
-
-        (uint256 numberOfChoices, bool jumped, bytes memory extraData) = disputeKit.disputes(disputeID);
-
-        assertEq(numberOfChoices, 2, "Wrong numberOfChoices");
-        assertEq(jumped, false, "jumped should be false");
-        assertEq(extraData, newExtraData, "Wrong extra data");
-        assertEq(disputeKit.coreDisputeIDToLocal(0), disputeID, "Wrong local disputeID");
-        assertEq(disputeKit.coreDisputeIDToActive(0), true, "Wrong disputes length");
-
-        (
-            uint256 winningChoice,
-            bool tied,
-            uint256 totalVoted,
-            uint256 totalCommited,
-            uint256 nbVoters,
-            uint256 choiceCount
-        ) = disputeKit.getRoundInfo(0, 0, 0);
-        assertEq(winningChoice, 0, "winningChoice should be 0");
-        assertEq(tied, true, "tied should be true");
-        assertEq(totalVoted, 0, "totalVoted should be 0");
-        assertEq(totalCommited, 0, "totalCommited should be 0");
-        assertEq(nbVoters, 0, "nbVoters should be 0");
-        assertEq(choiceCount, 0, "choiceCount should be 0");
-    }
-
-    function test_createDispute_tokens() public {
-        feeToken.transfer(disputer, 1 ether);
-        vm.prank(disputer);
-        feeToken.approve(address(arbitrable), 1 ether);
-
-        vm.expectRevert(KlerosCoreBase.TokenNotAccepted.selector);
-        vm.prank(disputer);
-        arbitrable.createDispute("Action", 0.18 ether);
-
-        vm.prank(owner);
-        core.changeAcceptedFeeTokens(feeToken, true);
-        vm.prank(owner);
-        core.changeCurrencyRates(feeToken, 500, 3);
-
-        vm.expectRevert(KlerosCoreBase.ArbitrationFeesNotEnough.selector);
-        vm.prank(disputer);
-        arbitrable.createDispute("Action", 0.18 ether - 1);
-
-        vm.expectRevert(KlerosCoreBase.TransferFailed.selector);
-        vm.prank(address(arbitrable)); // Bypass createDispute in arbitrable to avoid transfer checks there and make the arbitrable call KC directly
-        core.createDispute(2, arbitratorExtraData, feeToken, 0.18 ether);
-
-        assertEq(core.arbitrationCost(arbitratorExtraData, feeToken), 0.18 ether, "Wrong token cost");
-        vm.prank(disputer);
-        arbitrable.createDispute("Action", 0.18 ether);
-
-        KlerosCoreBase.Round memory round = core.getRoundInfo(0, 0);
-        assertEq(round.totalFeesForJurors, 0.18 ether, "Wrong totalFeesForJurors");
-        assertEq(round.nbVotes, 3, "Wrong nbVotes");
-        assertEq(address(round.feeToken), address(feeToken), "Wrong feeToken");
-
-        assertEq(feeToken.balanceOf(address(core)), 0.18 ether, "Wrong token balance of the core");
-        assertEq(feeToken.balanceOf(disputer), 0.82 ether, "Wrong token balance of the disputer");
-    }
-
-    function test_draw() public {
-        uint256 disputeID = 0;
-        uint256 roundID = 0;
-
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 1500);
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-
-        vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeLocked(staker1, 1000, false);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.Draw(staker1, disputeID, roundID, 0); // VoteID = 0
-
-        core.draw(disputeID, DEFAULT_NB_OF_JURORS); // Do 3 iterations and see that the juror will get drawn 3 times despite low stake.
-
-        (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, ) = sortitionModule.getJurorBalance(
-            staker1,
-            GENERAL_COURT
-        );
-        assertEq(totalStaked, 1500, "Wrong amount total staked");
-        assertEq(totalLocked, 3000, "Wrong amount locked"); // 1000 per draw
-        assertEq(stakedInCourt, 1500, "Wrong amount staked in court");
-        assertEq(sortitionModule.disputesWithoutJurors(), 0, "Wrong disputesWithoutJurors count");
-
-        for (uint256 i = 0; i < DEFAULT_NB_OF_JURORS; i++) {
-            (address account, bytes32 commit, uint256 choice, bool voted) = disputeKit.getVoteInfo(0, 0, i);
-            assertEq(account, staker1, "Wrong drawn account");
-            assertEq(commit, bytes32(0), "Commit should be empty");
-            assertEq(choice, 0, "Choice should be empty");
-            assertEq(voted, false, "Voted should be false");
-        }
-    }
-
-    function test_draw_noEmptyAddresses() public {
-        uint256 disputeID = 0;
-        uint256 roundID = 0;
-
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-
-        core.draw(disputeID, DEFAULT_NB_OF_JURORS); // No one is staked so check that the empty addresses are not drawn.
-
-        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, roundID);
-        assertEq(round.drawIterations, 3, "Wrong drawIterations number");
-
-        (, , , , uint256 nbVoters, ) = disputeKit.getRoundInfo(disputeID, roundID, 0);
-        assertEq(nbVoters, 0, "nbVoters should be 0");
-    }
-
-    function test_draw_parentCourts() public {
-        uint96 newCourtID = 2;
-        uint256 disputeID = 0;
-        uint256 roundID = 0;
-
-        // Create a child court and stake exclusively there to check that parent courts hold drawing power.
-        vm.prank(owner);
-        uint256[] memory supportedDK = new uint256[](1);
-        supportedDK[0] = DISPUTE_KIT_CLASSIC;
-        core.createCourt(
-            GENERAL_COURT,
-            true, // Hidden votes
-            1000, // min stake
-            10000, // alpha
-            0.03 ether, // fee for juror
-            50, // jurors for jump
-            [uint256(10), uint256(20), uint256(30), uint256(40)], // Times per period
-            sortitionExtraData, // Sortition extra data
-            supportedDK
-        );
-
-        uint256[] memory children = core.getCourtChildren(GENERAL_COURT);
-        assertEq(children.length, 1, "Wrong children count");
-        assertEq(children[0], 2, "Wrong child ID");
-
-        vm.prank(staker1);
-        core.setStake(newCourtID, 3000);
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action"); // Dispute uses general court by default
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-
-        (uint96 courtID, , , , ) = core.disputes(disputeID);
-        assertEq(courtID, GENERAL_COURT, "Wrong court ID of the dispute");
-
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.Draw(staker1, disputeID, roundID, 0);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.Draw(staker1, disputeID, roundID, 1);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.Draw(staker1, disputeID, roundID, 2);
-        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
-
-        assertEq(sortitionModule.disputesWithoutJurors(), 0, "Wrong disputesWithoutJurors count");
-
-        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, roundID);
-        assertEq(round.drawIterations, 3, "Wrong drawIterations number");
-
-        (, , , , uint256 nbVoters, ) = disputeKit.getRoundInfo(disputeID, roundID, 0);
-        assertEq(nbVoters, 3, "nbVoters should be 3");
-    }
-
-    function test_castCommit() public {
-        // Change hidden votes in general court
-        uint256 disputeID = 0;
-        vm.prank(owner);
-        core.changeCourtParameters(
-            GENERAL_COURT,
-            true, // Hidden votes
-            1000, // min stake
-            10000, // alpha
-            0.03 ether, // fee for juror
-            511, // jurors for jump
-            [uint256(60), uint256(120), uint256(180), uint256(240)] // Times per period
-        );
-
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 10000);
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
-
-        uint256 YES = 1;
-        uint256 salt = 123455678;
-        uint256[] memory voteIDs = new uint256[](1);
-        voteIDs[0] = 0;
-        bytes32 commit;
-        vm.prank(staker1);
-        vm.expectRevert(DisputeKitClassicBase.NotCommitPeriod.selector);
-        disputeKit.castCommit(disputeID, voteIDs, commit);
-
-        vm.expectRevert(KlerosCoreBase.EvidenceNotPassedAndNotAppeal.selector);
-        core.passPeriod(disputeID);
-        vm.warp(block.timestamp + timesPerPeriod[0]);
-
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.commit);
-        core.passPeriod(disputeID);
-
-        (, , KlerosCoreBase.Period period, , uint256 lastPeriodChange) = core.disputes(disputeID);
-
-        assertEq(uint256(period), uint256(KlerosCoreBase.Period.commit), "Wrong period");
-        assertEq(lastPeriodChange, block.timestamp, "Wrong lastPeriodChange");
-
-        vm.prank(staker1);
-        vm.expectRevert(DisputeKitClassicBase.EmptyCommit.selector);
-        disputeKit.castCommit(disputeID, voteIDs, commit);
-
-        commit = keccak256(abi.encodePacked(YES, salt));
-
-        vm.prank(other);
-        vm.expectRevert(DisputeKitClassicBase.JurorHasToOwnTheVote.selector);
-        disputeKit.castCommit(disputeID, voteIDs, commit);
-
-        vm.prank(staker1);
-        vm.expectEmit(true, true, true, true);
-        emit DisputeKitClassicBase.CommitCast(disputeID, staker1, voteIDs, commit);
-        disputeKit.castCommit(disputeID, voteIDs, commit);
-
-        (, , , uint256 totalCommited, uint256 nbVoters, uint256 choiceCount) = disputeKit.getRoundInfo(disputeID, 0, 0);
-        assertEq(totalCommited, 1, "totalCommited should be 1");
-        assertEq(disputeKit.areCommitsAllCast(disputeID), false, "Commits should not all be cast");
-
-        (, bytes32 commitStored, , ) = disputeKit.getVoteInfo(0, 0, 0);
-        assertEq(commitStored, keccak256(abi.encodePacked(YES, salt)), "Incorrect commit");
-
-        voteIDs = new uint256[](2); // Create the leftover votes subset
-        voteIDs[0] = 1;
-        voteIDs[1] = 2;
-
-        vm.prank(staker1);
-        vm.expectEmit(true, true, true, true);
-        emit DisputeKitClassicBase.CommitCast(disputeID, staker1, voteIDs, commit);
-        disputeKit.castCommit(disputeID, voteIDs, commit);
-
-        (, , , totalCommited, nbVoters, choiceCount) = disputeKit.getRoundInfo(disputeID, 0, 0);
-        assertEq(totalCommited, DEFAULT_NB_OF_JURORS, "totalCommited should be 3");
-        assertEq(disputeKit.areCommitsAllCast(disputeID), true, "Commits should all be cast");
-
-        for (uint256 i = 1; i < DEFAULT_NB_OF_JURORS; i++) {
-            (, commitStored, , ) = disputeKit.getVoteInfo(0, 0, i);
-            assertEq(commitStored, keccak256(abi.encodePacked(YES, salt)), "Incorrect commit");
-        }
-
-        // Check reveal in the next period
-        vm.warp(block.timestamp + timesPerPeriod[1]);
-        core.passPeriod(disputeID);
-
-        // Check the require with the wrong choice and then with the wrong salt
-        vm.prank(staker1);
-        vm.expectRevert(DisputeKitClassicBase.HashDoesNotMatchHiddenVoteCommitment.selector);
-        disputeKit.castVote(disputeID, voteIDs, 2, salt, "XYZ");
-
-        vm.prank(staker1);
-        vm.expectRevert(DisputeKitClassicBase.HashDoesNotMatchHiddenVoteCommitment.selector);
-        disputeKit.castVote(disputeID, voteIDs, YES, salt - 1, "XYZ");
-
-        vm.prank(staker1);
-        disputeKit.castVote(disputeID, voteIDs, YES, salt, "XYZ");
-
-        for (uint256 i = 1; i < DEFAULT_NB_OF_JURORS; i++) {
-            // 0 voteID was skipped when casting a vote
-            (address account, , uint256 choice, bool voted) = disputeKit.getVoteInfo(0, 0, i);
-            assertEq(account, staker1, "Wrong drawn account");
-            assertEq(choice, YES, "Wrong choice");
-            assertEq(voted, true, "Voted should be true");
-        }
-    }
-
-    function test_castCommit_timeoutCheck() public {
-        // Change hidden votes in general court
-        uint256 disputeID = 0;
-        vm.prank(owner);
-        core.changeCourtParameters(
-            GENERAL_COURT,
-            true, // Hidden votes
-            1000, // min stake
-            10000, // alpha
-            0.03 ether, // fee for juror
-            511, // jurors for jump
-            [uint256(60), uint256(120), uint256(180), uint256(240)] // Times per period
-        );
-
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 10000);
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
-
-        vm.warp(block.timestamp + timesPerPeriod[0]);
-        core.passPeriod(disputeID); // Commit
-
-        vm.expectRevert(KlerosCoreBase.CommitPeriodNotPassed.selector);
-        core.passPeriod(disputeID);
-
-        vm.warp(block.timestamp + timesPerPeriod[1]);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.vote);
-        core.passPeriod(disputeID);
-    }
-
-    function test_castVote() public {
-        uint256 disputeID = 0;
-
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 10000);
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-
-        core.draw(disputeID, DEFAULT_NB_OF_JURORS - 1); // Draw less to check the require later
-        vm.warp(block.timestamp + timesPerPeriod[0]);
-
-        uint256[] memory voteIDs = new uint256[](0);
-        vm.prank(staker1);
-        vm.expectRevert(DisputeKitClassicBase.NotVotePeriod.selector);
-        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ"); // Leave salt empty as not needed
-
-        vm.expectRevert(KlerosCoreBase.DisputeStillDrawing.selector);
-        core.passPeriod(disputeID);
-
-        core.draw(disputeID, 1); // Draw the last juror
-
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.vote);
-        core.passPeriod(disputeID); // Vote
-
-        (, , KlerosCoreBase.Period period, , uint256 lastPeriodChange) = core.disputes(disputeID);
-
-        assertEq(uint256(period), uint256(KlerosCoreBase.Period.vote), "Wrong period");
-        assertEq(lastPeriodChange, block.timestamp, "Wrong lastPeriodChange");
-
-        vm.prank(staker1);
-        vm.expectRevert(DisputeKitClassicBase.EmptyVoteIDs.selector);
-        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
-
-        voteIDs = new uint256[](1);
-        voteIDs[0] = 0; // Split vote IDs to see how the winner changes
-        vm.prank(staker1);
-        vm.expectRevert(DisputeKitClassicBase.ChoiceOutOfBounds.selector);
-        disputeKit.castVote(disputeID, voteIDs, 2 + 1, 0, "XYZ");
-
-        vm.prank(other);
-        vm.expectRevert(DisputeKitClassicBase.JurorHasToOwnTheVote.selector);
-        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
-
-        vm.prank(staker1);
-        vm.expectEmit(true, true, true, true);
-        emit IDisputeKit.VoteCast(disputeID, staker1, voteIDs, 2, "XYZ");
-        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
-
-        vm.prank(staker1);
-        vm.expectRevert(DisputeKitClassicBase.VoteAlreadyCast.selector);
-        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
-
-        (
-            uint256 winningChoice,
-            bool tied,
-            uint256 totalVoted,
-            uint256 totalCommited,
-            ,
-            uint256 choiceCount
-        ) = disputeKit.getRoundInfo(disputeID, 0, 2);
-        assertEq(winningChoice, 2, "Wrong winning choice");
-        assertEq(tied, false, "tied should be false");
-        assertEq(totalVoted, 1, "totalVoted should be 1");
-        assertEq(totalCommited, 0, "totalCommited should be 0");
-        assertEq(choiceCount, 1, "choiceCount should be 1");
-
-        (address account, bytes32 commit, uint256 choice, bool voted) = disputeKit.getVoteInfo(0, 0, 0); // Dispute - Round - VoteID
-        assertEq(account, staker1, "Wrong drawn account");
-        assertEq(commit, bytes32(0), "Commit should be empty");
-        assertEq(choice, 2, "Choice should be 2");
-        assertEq(voted, true, "Voted should be true");
-
-        assertEq(disputeKit.isVoteActive(0, 0, 0), true, "Vote should be active"); // Dispute - Round - VoteID
-
-        voteIDs = new uint256[](1);
-        voteIDs[0] = 1; // Cast another vote to check the tie.
-
-        vm.prank(staker1);
-        vm.expectEmit(true, true, true, true);
-        emit IDisputeKit.VoteCast(disputeID, staker1, voteIDs, 1, "XYZZ");
-        disputeKit.castVote(disputeID, voteIDs, 1, 0, "XYZZ");
-
-        (, tied, totalVoted, , , choiceCount) = disputeKit.getRoundInfo(disputeID, 0, 1);
-        assertEq(tied, true, "tied should be true");
-        assertEq(totalVoted, 2, "totalVoted should be 2");
-        assertEq(choiceCount, 1, "choiceCount should be 1 for first choice");
-
-        vm.expectRevert(KlerosCoreBase.VotePeriodNotPassed.selector);
-        core.passPeriod(disputeID);
-
-        voteIDs = new uint256[](1);
-        voteIDs[0] = 2; // Cast another vote to declare a new winner.
-
-        vm.prank(staker1);
-        vm.expectEmit(true, true, true, true);
-        emit IDisputeKit.VoteCast(disputeID, staker1, voteIDs, 1, "XYZZ");
-        disputeKit.castVote(disputeID, voteIDs, 1, 0, "XYZZ");
-
-        (winningChoice, tied, totalVoted, , , choiceCount) = disputeKit.getRoundInfo(disputeID, 0, 1);
-        assertEq(winningChoice, 1, "Wrong winning choice");
-        assertEq(tied, false, "tied should be false");
-        assertEq(totalVoted, 3, "totalVoted should be 3");
-        assertEq(choiceCount, 2, "choiceCount should be 2 for first choice");
-        assertEq(disputeKit.areVotesAllCast(disputeID), true, "Votes should all be cast");
-    }
-
-    function test_castVote_timeoutCheck() public {
-        // Change hidden votes in general court
-        uint256 disputeID = 0;
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 10000);
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
-
-        vm.warp(block.timestamp + timesPerPeriod[0]);
-        core.passPeriod(disputeID); // Votes
-
-        vm.expectRevert(KlerosCoreBase.VotePeriodNotPassed.selector);
-        core.passPeriod(disputeID);
-
-        vm.warp(block.timestamp + timesPerPeriod[2]);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.AppealPossible(disputeID, arbitrable);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.appeal);
-        core.passPeriod(disputeID);
-    }
-
-    function test_castVote_rulingCheck() public {
-        // Change hidden votes in general court
-        uint256 disputeID = 0;
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 10000);
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
-
-        vm.warp(block.timestamp + timesPerPeriod[0]);
-        core.passPeriod(disputeID); // Votes
-
-        uint256[] memory voteIDs = new uint256[](3);
-        voteIDs[0] = 0;
-        voteIDs[1] = 1;
-        voteIDs[2] = 2;
-
-        vm.prank(staker1);
-        disputeKit.castVote(disputeID, voteIDs, 1, 0, "XYZZ");
-
-        (uint256 ruling, bool tied, bool overridden) = disputeKit.currentRuling(disputeID);
-        assertEq(ruling, 1, "Wrong ruling");
-        assertEq(tied, false, "Not tied");
-        assertEq(overridden, false, "Not overridden");
-    }
-
-    function test_castVote_quickPassPeriod() public {
-        // Change hidden votes in general court
-        uint256 disputeID = 0;
-        vm.prank(owner);
-        core.changeCourtParameters(
-            GENERAL_COURT,
-            true, // Hidden votes
-            1000, // min stake
-            10000, // alpha
-            0.03 ether, // fee for juror
-            511, // jurors for jump
-            [uint256(60), uint256(120), uint256(180), uint256(240)] // Times per period
-        );
-
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 10000);
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
-
-        uint256 YES = 1;
-        uint256 salt = 123455678;
-        uint256[] memory voteIDs = new uint256[](1);
-        voteIDs[0] = 0;
-        bytes32 commit;
-
-        vm.warp(block.timestamp + timesPerPeriod[0]);
-        core.passPeriod(disputeID);
-
-        commit = keccak256(abi.encodePacked(YES, salt));
-
-        vm.prank(staker1);
-        disputeKit.castCommit(disputeID, voteIDs, commit);
-
-        (, , , uint256 totalCommited, uint256 nbVoters, uint256 choiceCount) = disputeKit.getRoundInfo(disputeID, 0, 0);
-        assertEq(totalCommited, 1, "totalCommited should be 1");
-        assertEq(disputeKit.areCommitsAllCast(disputeID), false, "Commits should not all be cast");
-
-        vm.warp(block.timestamp + timesPerPeriod[1]);
-        core.passPeriod(disputeID);
-
-        vm.prank(staker1);
-        disputeKit.castVote(disputeID, voteIDs, YES, salt, "XYZ");
-
-        (, , uint256 totalVoted, , , ) = disputeKit.getRoundInfo(disputeID, 0, 0);
-        assertEq(totalVoted, 1, "totalVoted should be 1");
-        assertEq(disputeKit.areVotesAllCast(disputeID), true, "Every committed vote was cast");
-
-        // Should pass period by counting only committed votes.
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.appeal);
-        core.passPeriod(disputeID);
-    }
-
-    function test_appeal_fundOneSide() public {
-        uint256 disputeID = 0;
-        vm.deal(address(disputeKit), 1 ether);
-        vm.deal(staker1, 1 ether);
-
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 10000);
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-
-        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
-        vm.warp(block.timestamp + timesPerPeriod[0]);
-        core.passPeriod(disputeID); // Vote
-
-        uint256[] memory voteIDs = new uint256[](3);
-        voteIDs[0] = 0;
-        voteIDs[1] = 1;
-        voteIDs[2] = 2;
-
-        vm.prank(staker1);
-        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
-
-        (uint256 start, uint256 end) = core.appealPeriod(0);
-        assertEq(start, 0, "Appeal period start should be 0");
-        assertEq(end, 0, "Appeal period end should be 0");
-
-        // Simulate the call from dispute kit to check the requires unrelated to caller
-        vm.prank(address(disputeKit));
-        vm.expectRevert(KlerosCoreBase.DisputeNotAppealable.selector);
-        core.appeal{value: 0.21 ether}(disputeID, 2, arbitratorExtraData);
-
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.AppealPossible(disputeID, arbitrable);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.appeal);
-        core.passPeriod(disputeID);
-
-        (, , KlerosCoreBase.Period period, , uint256 lastPeriodChange) = core.disputes(disputeID);
-        (start, end) = core.appealPeriod(0);
-        assertEq(uint256(period), uint256(KlerosCoreBase.Period.appeal), "Wrong period");
-        assertEq(lastPeriodChange, block.timestamp, "Wrong lastPeriodChange");
-        assertEq(core.appealCost(0), 0.21 ether, "Wrong appealCost");
-        assertEq(start, lastPeriodChange, "Appeal period start is incorrect");
-        assertEq(end, lastPeriodChange + timesPerPeriod[3], "Appeal period end is incorrect");
-
-        vm.expectRevert(KlerosCoreBase.AppealPeriodNotPassed.selector);
-        core.passPeriod(disputeID);
-
-        // Simulate the call from dispute kit to check the requires unrelated to caller
-        vm.prank(address(disputeKit));
-        vm.expectRevert(KlerosCoreBase.AppealFeesNotEnough.selector);
-        core.appeal{value: 0.21 ether - 1}(disputeID, 2, arbitratorExtraData);
-        vm.deal(address(disputeKit), 0); // Nullify the balance so it doesn't get in the way.
-
-        vm.prank(staker1);
-        vm.expectRevert(KlerosCoreBase.DisputeKitOnly.selector);
-        core.appeal{value: 0.21 ether}(disputeID, 2, arbitratorExtraData);
-
-        vm.prank(crowdfunder1);
-        vm.expectRevert(DisputeKitClassicBase.ChoiceOutOfBounds.selector);
-        disputeKit.fundAppeal(disputeID, 3);
-
-        vm.prank(crowdfunder1);
-        vm.expectEmit(true, true, true, true);
-        emit DisputeKitClassicBase.Contribution(disputeID, 0, 1, crowdfunder1, 0.21 ether);
-        disputeKit.fundAppeal{value: 0.21 ether}(disputeID, 1); // Fund the losing choice. Total cost will be 0.63 (0.21 + 0.21 * (20000/10000))
-
-        assertEq(crowdfunder1.balance, 9.79 ether, "Wrong balance of the crowdfunder");
-        assertEq(address(disputeKit).balance, 0.21 ether, "Wrong balance of the DK");
-        assertEq((disputeKit.getFundedChoices(disputeID)).length, 0, "No funded choices");
-
-        vm.prank(crowdfunder1);
-        vm.expectEmit(true, true, true, true);
-        emit DisputeKitClassicBase.Contribution(disputeID, 0, 1, crowdfunder1, 0.42 ether);
-        vm.expectEmit(true, true, true, true);
-        emit DisputeKitClassicBase.ChoiceFunded(disputeID, 0, 1);
-        disputeKit.fundAppeal{value: 5 ether}(disputeID, 1); // Deliberately overpay to check reimburse
-
-        assertEq(crowdfunder1.balance, 9.37 ether, "Wrong balance of the crowdfunder");
-        assertEq(address(disputeKit).balance, 0.63 ether, "Wrong balance of the DK");
-        assertEq((disputeKit.getFundedChoices(disputeID)).length, 1, "One choice should be funded");
-        assertEq((disputeKit.getFundedChoices(disputeID))[0], 1, "Incorrect funded choice");
-
-        vm.prank(crowdfunder1);
-        vm.expectRevert(DisputeKitClassicBase.AppealFeeIsAlreadyPaid.selector);
-        disputeKit.fundAppeal(disputeID, 1);
-    }
-
-    function test_appeal_timeoutCheck() public {
-        uint256 disputeID = 0;
-
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 10000);
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-
-        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
-        vm.warp(block.timestamp + timesPerPeriod[0]);
-        core.passPeriod(disputeID); // Vote
-
-        uint256[] memory voteIDs = new uint256[](3);
-        voteIDs[0] = 0;
-        voteIDs[1] = 1;
-        voteIDs[2] = 2;
-
-        vm.prank(staker1);
-        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
-
-        vm.prank(crowdfunder1);
-        vm.expectRevert(DisputeKitClassicBase.AppealPeriodIsOver.selector);
-        disputeKit.fundAppeal{value: 0.1 ether}(disputeID, 1);
-        core.passPeriod(disputeID);
-
-        (uint256 start, uint256 end) = core.appealPeriod(0);
-
-        vm.prank(crowdfunder1);
-        vm.warp(block.timestamp + ((end - start) / 2 + 1));
-        vm.expectRevert(DisputeKitClassicBase.AppealPeriodIsOverForLoser.selector);
-        disputeKit.fundAppeal{value: 0.1 ether}(disputeID, 1); // Losing choice
-
-        disputeKit.fundAppeal(disputeID, 2); // Winning choice funding should not revert yet
-
-        vm.prank(crowdfunder1);
-        vm.warp(block.timestamp + (end - start) / 2); // Warp one more to cover the whole period
-        vm.expectRevert(DisputeKitClassicBase.AppealPeriodIsOver.selector);
-        disputeKit.fundAppeal{value: 0.1 ether}(disputeID, 2);
-    }
-
-    function test_appeal_fullFundingNoSwitch() public {
-        uint256 disputeID = 0;
-
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 20000);
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-
-        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
-        vm.warp(block.timestamp + timesPerPeriod[0]);
-        core.passPeriod(disputeID); // Vote
-
-        uint256[] memory voteIDs = new uint256[](3);
-        voteIDs[0] = 0;
-        voteIDs[1] = 1;
-        voteIDs[2] = 2;
-
-        vm.prank(staker1);
-        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
-
-        core.passPeriod(disputeID); // Appeal
-
-        vm.prank(crowdfunder1);
-        disputeKit.fundAppeal{value: 0.63 ether}(disputeID, 1);
-
-        vm.prank(crowdfunder2);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.AppealDecision(disputeID, arbitrable);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.evidence);
-        disputeKit.fundAppeal{value: 0.42 ether}(disputeID, 2);
-
-        assertEq((disputeKit.getFundedChoices(disputeID)).length, 0, "No funded choices in the fresh round");
-        (uint256 ruling, bool tied, bool overridden) = disputeKit.currentRuling(disputeID);
-        assertEq(ruling, 0, "Should be 0 ruling in the fresh round");
-        assertEq(tied, true, "Should be tied");
-        assertEq(overridden, false, "Not overridden");
-
-        assertEq(address(disputeKit).balance, 0.84 ether, "Wrong balance of the DK"); // 0.63 + 0.42 - 0.21
-        assertEq(address(core).balance, 0.3 ether, "Wrong balance of the core"); // 0.09 arbFee + 0.21 appealFee
-
-        assertEq(sortitionModule.disputesWithoutJurors(), 1, "Wrong disputesWithoutJurors count after appeal");
-        assertEq(core.getNumberOfRounds(disputeID), 2, "Wrong number of rounds");
-
-        (, , KlerosCoreBase.Period period, , uint256 lastPeriodChange) = core.disputes(disputeID);
-        assertEq(uint256(period), uint256(KlerosCoreBase.Period.evidence), "Wrong period");
-        assertEq(lastPeriodChange, block.timestamp, "Wrong lastPeriodChange");
-
-        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 1); // Check the new round
-        assertEq(round.pnkAtStakePerJuror, 1000, "Wrong pnkAtStakePerJuror");
-        assertEq(round.totalFeesForJurors, 0.21 ether, "Wrong totalFeesForJurors");
-        assertEq(round.nbVotes, 7, "Wrong nbVotes");
-
-        core.draw(disputeID, 7);
-        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.vote); // Check that we don't have to wait for the timeout to pass the evidence period after appeal
-        core.passPeriod(disputeID);
-    }
-
-    function test_appeal_fullFundingDKCourtSwitch() public {
-        uint256 disputeID = 0;
-        DisputeKitClassic dkLogic = new DisputeKitClassic();
-        // Create a new DK and court to check the switch
-        bytes memory initDataDk = abi.encodeWithSignature(
-            "initialize(address,address,address)",
-            owner,
-            address(core),
-            address(wNative)
-        );
-
-        UUPSProxy proxyDk = new UUPSProxy(address(dkLogic), initDataDk);
-        DisputeKitClassic newDisputeKit = DisputeKitClassic(address(proxyDk));
-
-        uint96 newCourtID = 2;
-        uint256 newDkID = 2;
-        uint256[] memory supportedDK = new uint256[](1);
-        supportedDK[0] = DISPUTE_KIT_CLASSIC;
-        bytes memory newExtraData = abi.encodePacked(uint256(newCourtID), DEFAULT_NB_OF_JURORS, newDkID);
-
-        vm.prank(owner);
-        core.addNewDisputeKit(newDisputeKit);
-        vm.prank(owner);
-        core.createCourt(
-            GENERAL_COURT,
-            hiddenVotes,
-            minStake,
-            alpha,
-            feeForJuror,
-            3, // jurors for jump. Low number to ensure jump after the first appeal
-            [uint256(60), uint256(120), uint256(180), uint256(240)], // Times per period
-            sortitionExtraData,
-            supportedDK
-        );
-
-        arbitrable.changeArbitratorExtraData(newExtraData);
-
-        vm.prank(owner);
-        supportedDK = new uint256[](1);
-        supportedDK[0] = newDkID;
-        core.enableDisputeKits(newCourtID, supportedDK, true);
-
-        vm.prank(staker1);
-        core.setStake(newCourtID, 20000);
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-
-        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 0);
-        assertEq(round.disputeKitID, newDkID, "Wrong DK ID");
-
-        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
-        vm.warp(block.timestamp + timesPerPeriod[0]);
-        core.passPeriod(disputeID); // Vote
-
-        uint256[] memory voteIDs = new uint256[](3);
-        voteIDs[0] = 0;
-        voteIDs[1] = 1;
-        voteIDs[2] = 2;
-
-        vm.prank(staker1);
-        newDisputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
-
-        core.passPeriod(disputeID); // Appeal
-
-        vm.prank(crowdfunder1);
-        newDisputeKit.fundAppeal{value: 0.63 ether}(disputeID, 1);
-        vm.prank(crowdfunder2);
-
-        assertEq(core.isDisputeKitJumping(disputeID), true, "Should be jumping");
-
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.CourtJump(disputeID, 1, newCourtID, GENERAL_COURT);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.DisputeKitJump(disputeID, 1, newDkID, DISPUTE_KIT_CLASSIC);
-        vm.expectEmit(true, true, true, true);
-        emit DisputeKitClassicBase.DisputeCreation(disputeID, 2, newExtraData);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.AppealDecision(disputeID, arbitrable);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.evidence);
-        newDisputeKit.fundAppeal{value: 0.42 ether}(disputeID, 2);
-
-        (, bool jumped, ) = newDisputeKit.disputes(disputeID);
-        assertEq(jumped, true, "jumped should be true");
-        assertEq(
-            (newDisputeKit.getFundedChoices(disputeID)).length,
-            2,
-            "No fresh round created so the number of funded choices should be 2"
-        );
-
-        round = core.getRoundInfo(disputeID, 1);
-        assertEq(round.disputeKitID, DISPUTE_KIT_CLASSIC, "Wrong DK ID");
-        assertEq(sortitionModule.disputesWithoutJurors(), 1, "Wrong disputesWithoutJurors count");
-        (uint96 courtID, , , , ) = core.disputes(disputeID);
-        assertEq(courtID, GENERAL_COURT, "Wrong court ID");
-
-        (, jumped, ) = disputeKit.disputes(disputeID);
-        assertEq(jumped, false, "jumped should be false in the DK that dispute jumped to");
-
-        // Check jump modifier
-        vm.prank(address(core));
-        vm.expectRevert(DisputeKitClassicBase.DisputeJumpedToParentDK.selector);
-        newDisputeKit.draw(disputeID, 1);
-
-        // And check that draw in the new round works
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.Draw(staker1, disputeID, 1, 0); // roundID = 1 VoteID = 0
-        core.draw(disputeID, 1);
-
-        (address account, , , ) = disputeKit.getVoteInfo(disputeID, 1, 0);
-        assertEq(account, staker1, "Wrong drawn account in the classic DK");
-    }
-
-    function test_appeal_quickPassPeriod() public {
-        uint256 disputeID = 0;
-
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 10000);
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-
-        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
-        vm.warp(block.timestamp + timesPerPeriod[0]);
-        core.passPeriod(disputeID); // Vote
-
-        uint256[] memory voteIDs = new uint256[](3);
-        voteIDs[0] = 0;
-        voteIDs[1] = 1;
-        voteIDs[2] = 2;
-
-        vm.prank(staker1);
-        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
-
-        core.passPeriod(disputeID); // Appeal
-
-        vm.warp(block.timestamp + timesPerPeriod[3] / 2);
-
-        // Should pass to execution period without waiting for the 2nd half of the appeal.
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.execution);
-        core.passPeriod(disputeID);
-    }
-
-    function test_execute() public {
-        uint256 disputeID = 0;
-
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 1500);
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-
-        // Split the stakers' votes. The first staker will get VoteID 0 and the second will take the rest.
-        core.draw(disputeID, 1);
-
-        vm.warp(block.timestamp + maxDrawingTime);
-        sortitionModule.passPhase(); // Staking phase to stake the 2nd voter
-        vm.prank(staker2);
-        core.setStake(GENERAL_COURT, 20000);
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-
-        core.draw(disputeID, 2); // Assign leftover votes to staker2
-
-        vm.warp(block.timestamp + timesPerPeriod[0]);
-        core.passPeriod(disputeID); // Vote
-
-        uint256[] memory voteIDs = new uint256[](1);
-        voteIDs[0] = 0;
-        vm.prank(staker1);
-        disputeKit.castVote(disputeID, voteIDs, 1, 0, "XYZ"); // Staker1 only got 1 vote because of low stake
-
-        voteIDs = new uint256[](2);
-        voteIDs[0] = 1;
-        voteIDs[1] = 2;
-        vm.prank(staker2);
-        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
-        core.passPeriod(disputeID); // Appeal
-
-        vm.expectRevert(KlerosCoreBase.NotExecutionPeriod.selector);
-        core.execute(disputeID, 0, 1);
-
-        vm.warp(block.timestamp + timesPerPeriod[3]);
-        core.passPeriod(disputeID); // Execution
-
-        vm.prank(owner);
-        core.pause();
-        vm.expectRevert(KlerosCoreBase.WhenNotPausedOnly.selector);
-        core.execute(disputeID, 0, 1);
-        vm.prank(owner);
-        core.unpause();
-
-        assertEq(disputeKit.getCoherentCount(disputeID, 0), 2, "Wrong coherent count");
-
-        uint256 pnkCoherence;
-        uint256 feeCoherence;
-        // dispute, round, voteID, feeForJuror (not used in classic DK), pnkPerJuror (not used in classic DK)
-        (pnkCoherence, feeCoherence) = disputeKit.getDegreeOfCoherenceReward(disputeID, 0, 0, 0, 0);
-        assertEq(pnkCoherence, 0, "Wrong reward pnk coherence 0 vote ID");
-        assertEq(feeCoherence, 0, "Wrong reward fee coherence 0 vote ID");
-
-        (pnkCoherence, feeCoherence) = disputeKit.getDegreeOfCoherenceReward(disputeID, 0, 1, 0, 0);
-        assertEq(pnkCoherence, 10000, "Wrong reward pnk coherence 1 vote ID");
-        assertEq(feeCoherence, 10000, "Wrong reward fee coherence 1 vote ID");
-
-        (pnkCoherence, feeCoherence) = disputeKit.getDegreeOfCoherenceReward(disputeID, 0, 2, 0, 0);
-        assertEq(pnkCoherence, 10000, "Wrong reward pnk coherence 2 vote ID");
-        assertEq(feeCoherence, 10000, "Wrong reward fee coherence 2 vote ID");
-
-        assertEq(disputeKit.getDegreeOfCoherencePenalty(disputeID, 0, 0, 0, 0), 0, "Wrong penalty coherence 0 vote ID");
-        assertEq(
-            disputeKit.getDegreeOfCoherencePenalty(disputeID, 0, 1, 0, 0),
-            10000,
-            "Wrong penalty coherence 1 vote ID"
-        );
-        assertEq(
-            disputeKit.getDegreeOfCoherencePenalty(disputeID, 0, 2, 0, 0),
-            10000,
-            "Wrong penalty coherence 2 vote ID"
-        );
-
-        vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeLocked(staker1, 1000, true);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.TokenAndETHShift(staker1, disputeID, 0, 0, -int256(1000), 0, IERC20(address(0)));
-        // Check iterations for the winning staker to see the shifts
-        vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeLocked(staker2, 0, true);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.TokenAndETHShift(staker2, disputeID, 0, 10000, 0, 0, IERC20(address(0)));
-        vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeLocked(staker2, 0, true);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.TokenAndETHShift(staker2, disputeID, 0, 10000, 0, 0, IERC20(address(0)));
-        core.execute(disputeID, 0, 3); // Do 3 iterations to check penalties first
-
-        (uint256 totalStaked, uint256 totalLocked, , ) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
-        assertEq(totalStaked, 500, "totalStaked should be penalized"); // 1500 - 1000
-        assertEq(totalLocked, 0, "Tokens should be released for staker1");
-        (, totalLocked, , ) = sortitionModule.getJurorBalance(staker2, GENERAL_COURT);
-        assertEq(totalLocked, 2000, "Tokens should still be locked for staker2");
-
-        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 0);
-        assertEq(round.repartitions, 3, "Wrong repartitions");
-        assertEq(round.pnkPenalties, 1000, "Wrong pnkPenalties");
-
-        vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeLocked(staker1, 0, true);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.TokenAndETHShift(staker1, disputeID, 0, 0, 0, 0, IERC20(address(0)));
-        // Check iterations for the winning staker to see the shifts
-        vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeLocked(staker2, 1000, true);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.TokenAndETHShift(staker2, disputeID, 0, 10000, 500, 0.045 ether, IERC20(address(0)));
-        vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeLocked(staker2, 1000, true);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.TokenAndETHShift(staker2, disputeID, 0, 10000, 500, 0.045 ether, IERC20(address(0)));
-        core.execute(disputeID, 0, 10); // Finish the iterations. We need only 3 but check that it corrects the count.
-
-        (, totalLocked, , ) = sortitionModule.getJurorBalance(staker2, GENERAL_COURT);
-        assertEq(totalLocked, 0, "Tokens should be unlocked for staker2");
-
-        round = core.getRoundInfo(disputeID, 0);
-        assertEq(round.repartitions, 6, "Wrong repartitions");
-        assertEq(round.pnkPenalties, 1000, "Wrong pnkPenalties");
-        assertEq(round.sumFeeRewardPaid, 0.09 ether, "Wrong sumFeeRewardPaid");
-        assertEq(round.sumPnkRewardPaid, 1000, "Wrong sumPnkRewardPaid");
-
-        assertEq(address(core).balance, 0, "Wrong balance of the core");
-        assertEq(staker1.balance, 0, "Wrong balance of the staker1");
-        assertEq(staker2.balance, 0.09 ether, "Wrong balance of the staker2");
-
-        assertEq(pinakion.balanceOf(address(core)), 21500, "Wrong token balance of the core"); // Was 21500. 1000 was transferred to staker2
-        assertEq(pinakion.balanceOf(staker1), 999999999999998500, "Wrong token balance of staker1");
-        assertEq(pinakion.balanceOf(staker2), 999999999999980000, "Wrong token balance of staker2"); // 20k stake and 1k added as a reward, thus -19k from the default
-    }
-
-    function test_execute_NoCoherence() public {
-        uint256 disputeID = 0;
-
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 20000);
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-
-        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
-
-        vm.warp(block.timestamp + timesPerPeriod[0]);
-        core.passPeriod(disputeID); // Vote
-
-        vm.warp(block.timestamp + timesPerPeriod[2]); // Don't vote at all so no one is coherent
-        core.passPeriod(disputeID); // Appeal
-
-        vm.warp(block.timestamp + timesPerPeriod[3]);
-        core.passPeriod(disputeID); // Execution
-
-        assertEq(disputeKit.getCoherentCount(disputeID, 0), 0, "Wrong coherent count");
-
-        uint256 pnkCoherence;
-        uint256 feeCoherence;
-        // dispute, round, voteID, feeForJuror (not used in classic DK), pnkPerJuror (not used in classic DK)
-        (pnkCoherence, feeCoherence) = disputeKit.getDegreeOfCoherenceReward(disputeID, 0, 0, 0, 0);
-        assertEq(pnkCoherence, 0, "Wrong reward pnk coherence 0 vote ID");
-        assertEq(feeCoherence, 0, "Wrong reward fee coherence 0 vote ID");
-
-        (pnkCoherence, feeCoherence) = disputeKit.getDegreeOfCoherenceReward(disputeID, 0, 1, 0, 0);
-        assertEq(pnkCoherence, 0, "Wrong reward pnk coherence 1 vote ID");
-        assertEq(feeCoherence, 0, "Wrong reward fee coherence 1 vote ID");
-
-        (pnkCoherence, feeCoherence) = disputeKit.getDegreeOfCoherenceReward(disputeID, 0, 2, 0, 0);
-        assertEq(pnkCoherence, 0, "Wrong reward pnk coherence 2 vote ID");
-        assertEq(feeCoherence, 0, "Wrong reward fee coherence 2 vote ID");
-
-        assertEq(disputeKit.getDegreeOfCoherencePenalty(disputeID, 0, 0, 0, 0), 0, "Wrong penalty coherence 0 vote ID");
-        assertEq(disputeKit.getDegreeOfCoherencePenalty(disputeID, 0, 1, 0, 0), 0, "Wrong penalty coherence 1 vote ID");
-        assertEq(disputeKit.getDegreeOfCoherencePenalty(disputeID, 0, 2, 0, 0), 0, "Wrong penalty coherence 2 vote ID");
-
-        uint256 ownerBalance = owner.balance;
-        uint256 ownerTokenBalance = pinakion.balanceOf(owner);
-
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.LeftoverRewardSent(disputeID, 0, 3000, 0.09 ether, IERC20(address(0)));
-        core.execute(disputeID, 0, 3);
-
-        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 0);
-        assertEq(round.pnkPenalties, 3000, "Wrong pnkPenalties");
-        assertEq(round.sumFeeRewardPaid, 0, "Wrong sumFeeRewardPaid");
-        assertEq(round.sumPnkRewardPaid, 0, "Wrong sumPnkRewardPaid");
-
-        assertEq(address(core).balance, 0, "Wrong balance of the core");
-        assertEq(staker1.balance, 0, "Wrong balance of the staker1");
-        assertEq(owner.balance, ownerBalance + 0.09 ether, "Wrong balance of the owner");
-
-        assertEq(pinakion.balanceOf(address(core)), 17000, "Wrong token balance of the core");
-        assertEq(pinakion.balanceOf(staker1), 999999999999980000, "Wrong token balance of staker1");
-        assertEq(pinakion.balanceOf(owner), ownerTokenBalance + 3000, "Wrong token balance of owner");
-    }
-
-    function test_execute_UnstakeInactive() public {
-        // Create a 2nd court so unstaking is done in multiple courts.
-        vm.prank(owner);
-        uint256[] memory supportedDK = new uint256[](1);
-        supportedDK[0] = DISPUTE_KIT_CLASSIC;
-        core.createCourt(
-            GENERAL_COURT,
-            true, // Hidden votes
-            1000, // min stake
-            10000, // alpha
-            0.03 ether, // fee for juror
-            50, // jurors for jump
-            [uint256(10), uint256(20), uint256(30), uint256(40)], // Times per period
-            sortitionExtraData, // Sortition extra data
-            supportedDK
-        );
-
-        uint256 disputeID = 0;
-        uint96 newCourtID = 2;
-
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 20000);
-        vm.prank(staker1);
-        core.setStake(newCourtID, 20000);
-        (, , , uint256 nbCourts) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
-        assertEq(nbCourts, 2, "Wrong number of courts");
-
-        assertEq(pinakion.balanceOf(address(core)), 40000, "Wrong token balance of the core");
-        assertEq(pinakion.balanceOf(staker1), 999999999999960000, "Wrong token balance of staker1");
-
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-
-        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
-
-        sortitionModule.passPhase(); // Staking phase. Change to staking so we don't have to deal with delayed stakes.
-
-        vm.warp(block.timestamp + timesPerPeriod[0]);
-        core.passPeriod(disputeID); // Vote
-
-        vm.warp(block.timestamp + timesPerPeriod[2]); // Don't vote at all so no one is coherent
-        core.passPeriod(disputeID); // Appeal
-
-        vm.warp(block.timestamp + timesPerPeriod[3]);
-        core.passPeriod(disputeID); // Execution
-
-        uint256 ownerTokenBalance = pinakion.balanceOf(owner);
-
-        // Note that these events are emitted only after the first iteration of execute() therefore the juror has been penalized only for 1000 PNK her.
-        vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeSet(staker1, newCourtID, 0, 19000); // Starting with 40000 we first nullify the stake and remove 20000 and then remove penalty once since there was only first iteration (40000 - 20000 - 1000)
-        vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeSet(staker1, GENERAL_COURT, 0, 2000); // 2000 PNK should remain in balance to cover penalties since the first 1000 of locked pnk was already unlocked
-        core.execute(disputeID, 0, 3);
-
-        assertEq(pinakion.balanceOf(address(core)), 0, "Wrong token balance of the core");
-        assertEq(pinakion.balanceOf(staker1), 999999999999997000, "Wrong token balance of staker1"); // 3000 locked PNK was withheld by the contract and given to owner.
-        assertEq(pinakion.balanceOf(owner), ownerTokenBalance + 3000, "Wrong token balance of owner");
-
-        (, , , nbCourts) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
-        assertEq(nbCourts, 0, "Should unstake from all courts");
-    }
-
-    function test_execute_UnstakeInsolvent() public {
-        uint256 disputeID = 0;
-
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 1000);
-
-        assertEq(pinakion.balanceOf(address(core)), 1000, "Wrong token balance of the core");
-        assertEq(pinakion.balanceOf(staker1), 999999999999999000, "Wrong token balance of staker1");
-
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-
-        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
-
-        (uint256 totalStaked, uint256 totalLocked, , uint256 nbCourts) = sortitionModule.getJurorBalance(
-            staker1,
-            GENERAL_COURT
-        );
-        assertEq(totalStaked, 1000, "Wrong totalStaked");
-        assertEq(totalLocked, 3000, "totalLocked should exceed totalStaked"); // Juror only staked 1000 but was drawn 3x of minStake (3000 locked)
-        assertEq(nbCourts, 1, "Wrong number of courts");
-
-        sortitionModule.passPhase(); // Staking phase. Change to staking so we don't have to deal with delayed stakes.
-
-        vm.warp(block.timestamp + timesPerPeriod[0]);
-        core.passPeriod(disputeID); // Vote
-
-        uint256[] memory voteIDs = new uint256[](1);
-        voteIDs[0] = 0;
-        vm.prank(staker1);
-        disputeKit.castVote(disputeID, voteIDs, 1, 0, "XYZ"); // 1 incoherent vote should make the juror insolvent
-
-        voteIDs = new uint256[](2);
-        voteIDs[0] = 1;
-        voteIDs[1] = 2;
-        vm.prank(staker1);
-        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
-
-        core.passPeriod(disputeID); // Appeal
-
-        vm.warp(block.timestamp + timesPerPeriod[3]);
-        core.passPeriod(disputeID); // Execution
-
-        vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeSet(staker1, GENERAL_COURT, 0, 0); // Juror should have no stake left and should be unstaked from the court automatically.
-        core.execute(disputeID, 0, 6);
-
-        assertEq(pinakion.balanceOf(address(core)), 0, "Wrong token balance of the core");
-        assertEq(pinakion.balanceOf(staker1), 1 ether, "Wrong token balance of staker1"); // The juror should have his penalty back as a reward
-
-        (, , , nbCourts) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
-        assertEq(nbCourts, 0, "Should unstake from all courts");
-    }
-
-    function test_execute_withdrawLeftoverPNK() public {
-        // Return the previously locked tokens
-        uint256 disputeID = 0;
-
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 1000);
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-
-        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
-
-        sortitionModule.passPhase(); // Staking. Pass the phase so the juror can unstake before execution
-
-        vm.warp(block.timestamp + timesPerPeriod[0]);
-        core.passPeriod(disputeID); // Vote
-
-        uint256[] memory voteIDs = new uint256[](3);
-        voteIDs[0] = 0;
-        voteIDs[1] = 1;
-        voteIDs[2] = 2;
-        vm.prank(staker1);
-        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
-
-        core.passPeriod(disputeID); // Appeal
-
-        vm.warp(block.timestamp + timesPerPeriod[3]);
-        core.passPeriod(disputeID); // Execution
-
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 0); // Set stake to 0 to check if it will be withdrawn later.
-
-        (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts) = sortitionModule
-            .getJurorBalance(staker1, GENERAL_COURT);
-        assertEq(totalStaked, 1000, "Wrong amount staked");
-        assertEq(totalLocked, 3000, "Wrong amount locked");
-        assertEq(stakedInCourt, 0, "Should be unstaked");
-        assertEq(nbCourts, 0, "Should be 0 courts");
-
-        assertEq(pinakion.balanceOf(address(core)), 1000, "Wrong token balance of the core");
-        assertEq(pinakion.balanceOf(staker1), 999999999999999000, "Wrong token balance of staker1");
-
-        vm.expectRevert(SortitionModuleBase.NotEligibleForWithdrawal.selector);
-        sortitionModule.withdrawLeftoverPNK(staker1);
-
-        vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.LeftoverPNK(staker1, 1000);
-        core.execute(disputeID, 0, 6);
-
-        (totalStaked, totalLocked, , ) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
-        assertEq(totalStaked, 1000, "Wrong amount staked");
-        assertEq(totalLocked, 0, "Should be fully unlocked");
-
-        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 0);
-        assertEq(round.pnkPenalties, 0, "Wrong pnkPenalties");
-        assertEq(round.sumFeeRewardPaid, 0.09 ether, "Wrong sumFeeRewardPaid");
-        assertEq(round.sumPnkRewardPaid, 0, "Wrong sumPnkRewardPaid"); // No penalty so no rewards in pnk
-
-        // Execute() shouldn't withdraw the tokens.
-        assertEq(pinakion.balanceOf(address(core)), 1000, "Wrong token balance of the core");
-        assertEq(pinakion.balanceOf(staker1), 999999999999999000, "Wrong token balance of staker1");
-
-        vm.expectRevert(KlerosCoreBase.SortitionModuleOnly.selector);
-        vm.prank(owner);
-        core.transferBySortitionModule(staker1, 1000);
-
-        vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.LeftoverPNKWithdrawn(staker1, 1000);
-        sortitionModule.withdrawLeftoverPNK(staker1);
-
-        (totalStaked, , , ) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
-        assertEq(totalStaked, 0, "Should be unstaked fully");
-
-        // Check that everything is withdrawn now
-        assertEq(pinakion.balanceOf(address(core)), 0, "Core balance should be empty");
-        assertEq(pinakion.balanceOf(staker1), 1 ether, "All PNK should be withdrawn");
-    }
-
-    function test_execute_feeToken() public {
-        uint256 disputeID = 0;
-
-        feeToken.transfer(disputer, 1 ether);
-        vm.prank(disputer);
-        feeToken.approve(address(arbitrable), 1 ether);
-
-        vm.prank(owner);
-        core.changeAcceptedFeeTokens(feeToken, true);
-        vm.prank(owner);
-        core.changeCurrencyRates(feeToken, 500, 3);
-
-        vm.prank(disputer);
-        arbitrable.createDispute("Action", 0.18 ether);
-
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 20000);
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-
-        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
-
-        vm.warp(block.timestamp + timesPerPeriod[0]);
-        core.passPeriod(disputeID); // Vote
-
-        uint256[] memory voteIDs = new uint256[](3);
-        voteIDs[0] = 0;
-        voteIDs[1] = 1;
-        voteIDs[2] = 2;
-        vm.prank(staker1);
-        disputeKit.castVote(disputeID, voteIDs, 1, 0, "XYZ"); // Staker1 only got 1 vote because of low stake
-
-        core.passPeriod(disputeID); // Appeal
-
-        vm.warp(block.timestamp + timesPerPeriod[3]);
-        core.passPeriod(disputeID); // Execution
-
-        // Check only once per penalty and per reward
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.TokenAndETHShift(staker1, disputeID, 0, 10000, 0, 0, feeToken);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.TokenAndETHShift(staker1, disputeID, 0, 10000, 0, 0.06 ether, feeToken);
-        core.execute(disputeID, 0, 6);
-
-        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 0);
-        assertEq(round.sumFeeRewardPaid, 0.18 ether, "Wrong sumFeeRewardPaid");
-
-        assertEq(feeToken.balanceOf(address(core)), 0, "Wrong fee token balance of the core");
-        assertEq(feeToken.balanceOf(staker1), 0.18 ether, "Wrong fee token balance of staker1");
-        assertEq(feeToken.balanceOf(disputer), 0.82 ether, "Wrong fee token balance of disputer");
-    }
-
-    function test_execute_NoCoherence_feeToken() public {
-        uint256 disputeID = 0;
-
-        feeToken.transfer(disputer, 1 ether);
-        vm.prank(disputer);
-        feeToken.approve(address(arbitrable), 1 ether);
-
-        vm.prank(owner);
-        core.changeAcceptedFeeTokens(feeToken, true);
-        vm.prank(owner);
-        core.changeCurrencyRates(feeToken, 500, 3);
-
-        vm.prank(disputer);
-        arbitrable.createDispute("Action", 0.18 ether);
-
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 20000);
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-
-        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
-
-        vm.warp(block.timestamp + timesPerPeriod[0]);
-        core.passPeriod(disputeID); // Vote
-
-        vm.warp(block.timestamp + timesPerPeriod[2]); // Don't vote at all so no one is coherent
-        core.passPeriod(disputeID); // Appeal
-
-        vm.warp(block.timestamp + timesPerPeriod[3]);
-        core.passPeriod(disputeID); // Execution
-
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.LeftoverRewardSent(disputeID, 0, 3000, 0.18 ether, feeToken);
-        core.execute(disputeID, 0, 10); // Put more iterations to check that they're capped
-
-        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 0);
-        assertEq(round.pnkPenalties, 3000, "Wrong pnkPenalties");
-        assertEq(round.sumFeeRewardPaid, 0, "Wrong sumFeeRewardPaid");
-        assertEq(round.sumPnkRewardPaid, 0, "Wrong sumPnkRewardPaid");
-        assertEq(round.repartitions, 3, "Wrong repartitions");
-
-        assertEq(feeToken.balanceOf(address(core)), 0, "Wrong token balance of the core");
-        assertEq(feeToken.balanceOf(staker1), 0, "Wrong token balance of staker1");
-        assertEq(feeToken.balanceOf(disputer), 0.82 ether, "Wrong token balance of disputer");
-        assertEq(feeToken.balanceOf(owner), 0.18 ether, "Wrong token balance of owner");
-    }
-
-    function test_executeRuling() public {
-        uint256 disputeID = 0;
-
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 20000);
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-
-        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
-        vm.warp(block.timestamp + timesPerPeriod[0]);
-        core.passPeriod(disputeID); // Vote
-
-        uint256[] memory voteIDs = new uint256[](3);
-        voteIDs[0] = 0;
-        voteIDs[1] = 1;
-        voteIDs[2] = 2;
-
-        vm.prank(staker1);
-        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
-        core.passPeriod(disputeID); // Appeal
-
-        vm.expectRevert(KlerosCoreBase.NotExecutionPeriod.selector);
-        core.executeRuling(disputeID);
-
-        vm.warp(block.timestamp + timesPerPeriod[3]);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.execution);
-        core.passPeriod(disputeID); // Execution
-
-        (, , KlerosCoreBase.Period period, , uint256 lastPeriodChange) = core.disputes(disputeID);
-        assertEq(uint256(period), uint256(KlerosCoreBase.Period.execution), "Wrong period");
-        assertEq(lastPeriodChange, block.timestamp, "Wrong lastPeriodChange");
-
-        vm.expectRevert(KlerosCoreBase.DisputePeriodIsFinal.selector);
-        core.passPeriod(disputeID);
-
-        vm.expectEmit(true, true, true, true);
-        emit IArbitratorV2.Ruling(arbitrable, disputeID, 2); // Winning choice = 2
-        vm.expectEmit(true, true, true, true);
-        emit IArbitrableV2.Ruling(core, disputeID, 2);
-        core.executeRuling(disputeID);
-
-        vm.expectRevert(KlerosCoreBase.RulingAlreadyExecuted.selector);
-        core.executeRuling(disputeID);
-
-        (, , , bool ruled, ) = core.disputes(disputeID);
-        assertEq(ruled, true, "Should be ruled");
-    }
-
-    function test_executeRuling_appealSwitch() public {
-        // Check that the ruling switches if only one side was funded
-        uint256 disputeID = 0;
-
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 20000);
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-
-        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
-        vm.warp(block.timestamp + timesPerPeriod[0]);
-        core.passPeriod(disputeID); // Vote
-
-        uint256[] memory voteIDs = new uint256[](3);
-        voteIDs[0] = 0;
-        voteIDs[1] = 1;
-        voteIDs[2] = 2;
-
-        vm.prank(staker1);
-        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
-        core.passPeriod(disputeID); // Appeal
-
-        vm.prank(crowdfunder1);
-        disputeKit.fundAppeal{value: 0.63 ether}(disputeID, 1); // Fund the losing choice
-
-        vm.warp(block.timestamp + timesPerPeriod[3]);
-        core.passPeriod(disputeID); // Execution
-
-        vm.expectEmit(true, true, true, true);
-        emit IArbitratorV2.Ruling(arbitrable, disputeID, 1); // Winning choice is switched to 1
-        vm.expectEmit(true, true, true, true);
-        emit IArbitrableV2.Ruling(core, disputeID, 1);
-        core.executeRuling(disputeID);
-
-        (uint256 ruling, bool tied, bool overridden) = disputeKit.currentRuling(disputeID);
-        assertEq(ruling, 1, "Wrong ruling");
-        assertEq(tied, false, "Not tied");
-        assertEq(overridden, true, "Should be overridden");
-    }
-
-    function test_withdrawFeesAndRewards() public {
-        uint256 disputeID = 0;
-
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 20000);
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-
-        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
-        vm.warp(block.timestamp + timesPerPeriod[0]);
-        core.passPeriod(disputeID); // Vote
-
-        uint256[] memory voteIDs = new uint256[](3);
-        voteIDs[0] = 0;
-        voteIDs[1] = 1;
-        voteIDs[2] = 2;
-
-        vm.prank(staker1);
-        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
-        core.passPeriod(disputeID); // Appeal
-
-        vm.prank(crowdfunder1);
-        disputeKit.fundAppeal{value: 0.63 ether}(disputeID, 1); // Fund the losing choice. The ruling will be overridden here
-        vm.prank(crowdfunder2);
-        disputeKit.fundAppeal{value: 0.41 ether}(disputeID, 2); // Underpay a bit to not create an appeal and withdraw the funded sum fully
-
-        vm.warp(block.timestamp + timesPerPeriod[3]);
-        core.passPeriod(disputeID); // Execution
-
-        vm.expectRevert(DisputeKitClassicBase.DisputeNotResolved.selector);
-        disputeKit.withdrawFeesAndRewards(disputeID, payable(staker1), 0, 1);
-
-        core.executeRuling(disputeID);
-
-        vm.prank(owner);
-        core.pause();
-        vm.expectRevert(DisputeKitClassicBase.CoreIsPaused.selector);
-        disputeKit.withdrawFeesAndRewards(disputeID, payable(staker1), 0, 1);
-        vm.prank(owner);
-        core.unpause();
-
-        assertEq(crowdfunder1.balance, 9.37 ether, "Wrong balance of the crowdfunder1");
-        assertEq(crowdfunder2.balance, 9.59 ether, "Wrong balance of the crowdfunder2");
-        assertEq(address(disputeKit).balance, 1.04 ether, "Wrong balance of the DK");
-
-        vm.expectEmit(true, true, true, true);
-        emit DisputeKitClassicBase.Withdrawal(disputeID, 0, 1, crowdfunder1, 0.63 ether);
-        disputeKit.withdrawFeesAndRewards(disputeID, payable(crowdfunder1), 0, 1);
-
-        vm.expectEmit(true, true, true, true);
-        emit DisputeKitClassicBase.Withdrawal(disputeID, 0, 2, crowdfunder2, 0.41 ether);
-        disputeKit.withdrawFeesAndRewards(disputeID, payable(crowdfunder2), 0, 2);
-
-        assertEq(crowdfunder1.balance, 10 ether, "Wrong balance of the crowdfunder1");
-        assertEq(crowdfunder2.balance, 10 ether, "Wrong balance of the crowdfunder2");
-        assertEq(address(disputeKit).balance, 0, "Wrong balance of the DK");
-    }
-
-    function test_castVote_differentDK() public {
-        DisputeKitClassic dkLogic = new DisputeKitClassic();
-        // Create a new DK to check castVote.
-        bytes memory initDataDk = abi.encodeWithSignature(
-            "initialize(address,address,address)",
-            owner,
-            address(core),
-            address(wNative)
-        );
-
-        UUPSProxy proxyDk = new UUPSProxy(address(dkLogic), initDataDk);
-        DisputeKitClassic newDisputeKit = DisputeKitClassic(address(proxyDk));
-
-        vm.prank(owner);
-        core.addNewDisputeKit(newDisputeKit);
-
-        uint256 newDkID = 2;
-        uint256[] memory supportedDK = new uint256[](1);
-        bytes memory newExtraData = abi.encodePacked(uint256(GENERAL_COURT), DEFAULT_NB_OF_JURORS, newDkID);
-
-        vm.prank(owner);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.DisputeKitEnabled(GENERAL_COURT, newDkID, true);
-        supportedDK[0] = newDkID;
-        core.enableDisputeKits(GENERAL_COURT, supportedDK, true);
-        assertEq(core.isSupported(GENERAL_COURT, newDkID), true, "New DK should be supported by General court");
-
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 20000);
-
-        // Create one dispute for the old DK and two disputes for the new DK.
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-
-        arbitrable.changeArbitratorExtraData(newExtraData);
-
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-
-        uint256 disputeID = 2; // Use the latest dispute for reference. This is the ID in the core contract
-
-        vm.warp(block.timestamp + minStakingTime);
-        sortitionModule.passPhase(); // Generating
-        vm.warp(block.timestamp + rngLookahead);
-        sortitionModule.passPhase(); // Drawing phase
-
-        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 0);
-        assertEq(round.disputeKitID, newDkID, "Wrong DK ID");
-
-        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
-        // Draw jurors for the old DK as well to prepare round.votes array
-        core.draw(0, DEFAULT_NB_OF_JURORS);
-
-        vm.warp(block.timestamp + timesPerPeriod[0]);
-        core.passPeriod(disputeID); // Vote
-
-        // Check that the new DK has the info but not the old one.
-
-        assertEq(disputeKit.coreDisputeIDToActive(disputeID), false, "Should be false for old DK");
-
-        // This is the DK where dispute was created. Core dispute points to index 1 because new DK has two disputes.
-        assertEq(newDisputeKit.coreDisputeIDToLocal(disputeID), 1, "Wrong local dispute ID for new DK");
-        assertEq(newDisputeKit.coreDisputeIDToActive(disputeID), true, "Should be active for new DK");
-        (uint256 numberOfChoices, , bytes memory extraData) = newDisputeKit.disputes(1);
-        assertEq(numberOfChoices, 2, "Wrong numberOfChoices in new DK");
-        assertEq(extraData, newExtraData, "Wrong extra data");
-
-        uint256[] memory voteIDs = new uint256[](3);
-        voteIDs[0] = 0;
-        voteIDs[1] = 1;
-        voteIDs[2] = 2;
-
-        // Deliberately cast votes using the old DK to see if the exception will be caught.
-        vm.prank(staker1);
-        vm.expectRevert(DisputeKitClassicBase.NotActiveForCoreDisputeID.selector);
-        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
-
-        // And check the new DK.
-        vm.prank(staker1);
-        newDisputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
-
-        (
-            uint256 winningChoice,
-            bool tied,
-            uint256 totalVoted,
-            uint256 totalCommited,
-            ,
-            uint256 choiceCount
-        ) = newDisputeKit.getRoundInfo(disputeID, 0, 2);
-        assertEq(winningChoice, 2, "Wrong winning choice");
-        assertEq(tied, false, "tied should be false");
-        assertEq(totalVoted, 3, "totalVoted should be 3");
-        assertEq(totalCommited, 0, "totalCommited should be 0");
-        assertEq(choiceCount, 3, "choiceCount should be 3");
-    }
-
-    function test_RNGFallback() public {
-        RNGWithFallback rngFallback;
-        uint256 fallbackTimeout = 100;
-        RNGMock rngMock = new RNGMock();
-        rngFallback = new RNGWithFallback(msg.sender, address(sortitionModule), fallbackTimeout, rngMock);
-        assertEq(rngFallback.owner(), msg.sender, "Wrong owner");
-        assertEq(rngFallback.consumer(), address(sortitionModule), "Wrong sortition module address");
-        assertEq(address(rngFallback.rng()), address(rngMock), "Wrong RNG in fallback contract");
-        assertEq(rngFallback.fallbackTimeoutSeconds(), fallbackTimeout, "Wrong fallback timeout");
-        assertEq(rngFallback.requestTimestamp(), 0, "Request timestamp should be 0");
-
-        vm.prank(owner);
-        sortitionModule.changeRandomNumberGenerator(rngFallback);
-        assertEq(address(sortitionModule.rng()), address(rngFallback), "Wrong RNG address");
-
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 20000);
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-        vm.warp(block.timestamp + minStakingTime);
-
-        sortitionModule.passPhase(); // Generating
-        assertEq(rngFallback.requestTimestamp(), block.timestamp, "Wrong request timestamp");
-
-        vm.expectRevert(SortitionModuleBase.RandomNumberNotReady.selector);
-        sortitionModule.passPhase();
-
-        vm.warp(block.timestamp + fallbackTimeout + 1);
-
-        // Pass several blocks too to see that correct block.number is still picked up.
-        vm.roll(block.number + 5);
-
-        vm.expectEmit(true, true, true, true);
-        emit RNGWithFallback.RNGFallback();
-        sortitionModule.passPhase(); // Drawing phase
-
-        assertEq(sortitionModule.randomNumber(), uint256(blockhash(block.number - 1)), "Wrong random number");
-    }
-
-    function test_RNGFallback_happyPath() public {
-        RNGWithFallback rngFallback;
-        uint256 fallbackTimeout = 100;
-        RNGMock rngMock = new RNGMock();
-        rngFallback = new RNGWithFallback(msg.sender, address(sortitionModule), fallbackTimeout, rngMock);
-
-        vm.prank(owner);
-        sortitionModule.changeRandomNumberGenerator(rngFallback);
-        assertEq(address(sortitionModule.rng()), address(rngFallback), "Wrong RNG address");
-
-        vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 20000);
-        vm.prank(disputer);
-        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
-        vm.warp(block.timestamp + minStakingTime);
-
-        assertEq(rngFallback.requestTimestamp(), 0, "Request timestamp should be 0");
-
-        sortitionModule.passPhase(); // Generating
-        assertEq(rngFallback.requestTimestamp(), block.timestamp, "Wrong request timestamp");
-
-        rngMock.setRN(123);
-
-        sortitionModule.passPhase(); // Drawing phase
-        assertEq(sortitionModule.randomNumber(), 123, "Wrong random number");
-    }
-
-    function test_RNGFallback_sanityChecks() public {
-        RNGWithFallback rngFallback;
-        uint256 fallbackTimeout = 100;
-        RNGMock rngMock = new RNGMock();
-        rngFallback = new RNGWithFallback(msg.sender, address(sortitionModule), fallbackTimeout, rngMock);
-
-        vm.expectRevert(IRNG.ConsumerOnly.selector);
-        vm.prank(owner);
-        rngFallback.requestRandomness();
-
-        vm.expectRevert(IRNG.ConsumerOnly.selector);
-        vm.prank(owner);
-        rngFallback.receiveRandomness();
-
-        vm.expectRevert(IRNG.OwnerOnly.selector);
-        vm.prank(other);
-        rngFallback.changeOwner(other);
-        vm.prank(owner);
-        rngFallback.changeOwner(other);
-        assertEq(rngFallback.owner(), other, "Wrong owner");
-
-        // Change owner back for convenience
-        vm.prank(other);
-        rngFallback.changeOwner(owner);
-
-        vm.expectRevert(IRNG.OwnerOnly.selector);
-        vm.prank(other);
-        rngFallback.changeConsumer(other);
-        vm.prank(owner);
-        rngFallback.changeConsumer(other);
-        assertEq(rngFallback.consumer(), other, "Wrong consumer");
-
-        vm.expectRevert(IRNG.OwnerOnly.selector);
-        vm.prank(other);
-        rngFallback.changeFallbackTimeout(5);
-
-        vm.prank(owner);
-        vm.expectEmit(true, true, true, true);
-        emit RNGWithFallback.FallbackTimeoutChanged(5);
-        rngFallback.changeFallbackTimeout(5);
-        assertEq(rngFallback.fallbackTimeoutSeconds(), 5, "Wrong fallback timeout");
-    }
-}
diff --git a/contracts/test/foundry/KlerosCore_Appeals.t.sol b/contracts/test/foundry/KlerosCore_Appeals.t.sol
new file mode 100644
index 000000000..f76649e03
--- /dev/null
+++ b/contracts/test/foundry/KlerosCore_Appeals.t.sol
@@ -0,0 +1,361 @@
+// SPDX-License-Identifier: MIT
+pragma solidity ^0.8.24;
+
+import {KlerosCore_TestBase} from "./KlerosCore_TestBase.sol";
+import {KlerosCoreBase} from "../../src/arbitration/KlerosCoreBase.sol";
+import {DisputeKitClassic, DisputeKitClassicBase} from "../../src/arbitration/dispute-kits/DisputeKitClassic.sol";
+import {UUPSProxy} from "../../src/proxy/UUPSProxy.sol";
+import "../../src/libraries/Constants.sol";
+
+/// @title KlerosCore_AppealsTest
+/// @dev Tests for KlerosCore appeal system, funding, and court/DK jumping
+contract KlerosCore_AppealsTest is KlerosCore_TestBase {
+    function test_appeal_fundOneSide() public {
+        uint256 disputeID = 0;
+        vm.deal(address(disputeKit), 1 ether);
+        vm.deal(staker1, 1 ether);
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 10000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Vote
+
+        uint256[] memory voteIDs = new uint256[](3);
+        voteIDs[0] = 0;
+        voteIDs[1] = 1;
+        voteIDs[2] = 2;
+
+        vm.prank(staker1);
+        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
+
+        (uint256 start, uint256 end) = core.appealPeriod(0);
+        assertEq(start, 0, "Appeal period start should be 0");
+        assertEq(end, 0, "Appeal period end should be 0");
+
+        // Simulate the call from dispute kit to check the requires unrelated to caller
+        vm.prank(address(disputeKit));
+        vm.expectRevert(KlerosCoreBase.DisputeNotAppealable.selector);
+        core.appeal{value: 0.21 ether}(disputeID, 2, arbitratorExtraData);
+
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.AppealPossible(disputeID, arbitrable);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.appeal);
+        core.passPeriod(disputeID);
+
+        (, , KlerosCoreBase.Period period, , uint256 lastPeriodChange) = core.disputes(disputeID);
+        (start, end) = core.appealPeriod(0);
+        assertEq(uint256(period), uint256(KlerosCoreBase.Period.appeal), "Wrong period");
+        assertEq(lastPeriodChange, block.timestamp, "Wrong lastPeriodChange");
+        assertEq(core.appealCost(0), 0.21 ether, "Wrong appealCost");
+        assertEq(start, lastPeriodChange, "Appeal period start is incorrect");
+        assertEq(end, lastPeriodChange + timesPerPeriod[3], "Appeal period end is incorrect");
+
+        vm.expectRevert(KlerosCoreBase.AppealPeriodNotPassed.selector);
+        core.passPeriod(disputeID);
+
+        // Simulate the call from dispute kit to check the requires unrelated to caller
+        vm.prank(address(disputeKit));
+        vm.expectRevert(KlerosCoreBase.AppealFeesNotEnough.selector);
+        core.appeal{value: 0.21 ether - 1}(disputeID, 2, arbitratorExtraData);
+        vm.deal(address(disputeKit), 0); // Nullify the balance so it doesn't get in the way.
+
+        vm.prank(staker1);
+        vm.expectRevert(KlerosCoreBase.DisputeKitOnly.selector);
+        core.appeal{value: 0.21 ether}(disputeID, 2, arbitratorExtraData);
+
+        vm.prank(crowdfunder1);
+        vm.expectRevert(DisputeKitClassicBase.ChoiceOutOfBounds.selector);
+        disputeKit.fundAppeal(disputeID, 3);
+
+        vm.prank(crowdfunder1);
+        vm.expectEmit(true, true, true, true);
+        emit DisputeKitClassicBase.Contribution(disputeID, 0, 1, crowdfunder1, 0.21 ether);
+        disputeKit.fundAppeal{value: 0.21 ether}(disputeID, 1); // Fund the losing choice. Total cost will be 0.63 (0.21 + 0.21 * (20000/10000))
+
+        assertEq(crowdfunder1.balance, 9.79 ether, "Wrong balance of the crowdfunder");
+        assertEq(address(disputeKit).balance, 0.21 ether, "Wrong balance of the DK");
+        assertEq((disputeKit.getFundedChoices(disputeID)).length, 0, "No funded choices");
+
+        vm.prank(crowdfunder1);
+        vm.expectEmit(true, true, true, true);
+        emit DisputeKitClassicBase.Contribution(disputeID, 0, 1, crowdfunder1, 0.42 ether);
+        vm.expectEmit(true, true, true, true);
+        emit DisputeKitClassicBase.ChoiceFunded(disputeID, 0, 1);
+        disputeKit.fundAppeal{value: 5 ether}(disputeID, 1); // Deliberately overpay to check reimburse
+
+        assertEq(crowdfunder1.balance, 9.37 ether, "Wrong balance of the crowdfunder");
+        assertEq(address(disputeKit).balance, 0.63 ether, "Wrong balance of the DK");
+        assertEq((disputeKit.getFundedChoices(disputeID)).length, 1, "One choice should be funded");
+        assertEq((disputeKit.getFundedChoices(disputeID))[0], 1, "Incorrect funded choice");
+
+        vm.prank(crowdfunder1);
+        vm.expectRevert(DisputeKitClassicBase.AppealFeeIsAlreadyPaid.selector);
+        disputeKit.fundAppeal(disputeID, 1);
+    }
+
+    function test_appeal_timeoutCheck() public {
+        uint256 disputeID = 0;
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 10000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Vote
+
+        uint256[] memory voteIDs = new uint256[](3);
+        voteIDs[0] = 0;
+        voteIDs[1] = 1;
+        voteIDs[2] = 2;
+
+        vm.prank(staker1);
+        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
+
+        vm.prank(crowdfunder1);
+        vm.expectRevert(DisputeKitClassicBase.AppealPeriodIsOver.selector);
+        disputeKit.fundAppeal{value: 0.1 ether}(disputeID, 1);
+        core.passPeriod(disputeID);
+
+        (uint256 start, uint256 end) = core.appealPeriod(0);
+
+        vm.prank(crowdfunder1);
+        vm.warp(block.timestamp + ((end - start) / 2 + 1));
+        vm.expectRevert(DisputeKitClassicBase.AppealPeriodIsOverForLoser.selector);
+        disputeKit.fundAppeal{value: 0.1 ether}(disputeID, 1); // Losing choice
+
+        disputeKit.fundAppeal(disputeID, 2); // Winning choice funding should not revert yet
+
+        vm.prank(crowdfunder1);
+        vm.warp(block.timestamp + (end - start) / 2); // Warp one more to cover the whole period
+        vm.expectRevert(DisputeKitClassicBase.AppealPeriodIsOver.selector);
+        disputeKit.fundAppeal{value: 0.1 ether}(disputeID, 2);
+    }
+
+    function test_appeal_fullFundingNoSwitch() public {
+        uint256 disputeID = 0;
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 20000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Vote
+
+        uint256[] memory voteIDs = new uint256[](3);
+        voteIDs[0] = 0;
+        voteIDs[1] = 1;
+        voteIDs[2] = 2;
+
+        vm.prank(staker1);
+        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
+
+        core.passPeriod(disputeID); // Appeal
+
+        vm.prank(crowdfunder1);
+        disputeKit.fundAppeal{value: 0.63 ether}(disputeID, 1);
+
+        vm.prank(crowdfunder2);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.AppealDecision(disputeID, arbitrable);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.evidence);
+        disputeKit.fundAppeal{value: 0.42 ether}(disputeID, 2);
+
+        assertEq((disputeKit.getFundedChoices(disputeID)).length, 0, "No funded choices in the fresh round");
+        (uint256 ruling, bool tied, bool overridden) = disputeKit.currentRuling(disputeID);
+        assertEq(ruling, 0, "Should be 0 ruling in the fresh round");
+        assertEq(tied, true, "Should be tied");
+        assertEq(overridden, false, "Not overridden");
+
+        assertEq(address(disputeKit).balance, 0.84 ether, "Wrong balance of the DK"); // 0.63 + 0.42 - 0.21
+        assertEq(address(core).balance, 0.3 ether, "Wrong balance of the core"); // 0.09 arbFee + 0.21 appealFee
+
+        assertEq(sortitionModule.disputesWithoutJurors(), 1, "Wrong disputesWithoutJurors count after appeal");
+        assertEq(core.getNumberOfRounds(disputeID), 2, "Wrong number of rounds");
+
+        (, , KlerosCoreBase.Period period, , uint256 lastPeriodChange) = core.disputes(disputeID);
+        assertEq(uint256(period), uint256(KlerosCoreBase.Period.evidence), "Wrong period");
+        assertEq(lastPeriodChange, block.timestamp, "Wrong lastPeriodChange");
+
+        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 1); // Check the new round
+        assertEq(round.pnkAtStakePerJuror, 1000, "Wrong pnkAtStakePerJuror");
+        assertEq(round.totalFeesForJurors, 0.21 ether, "Wrong totalFeesForJurors");
+        assertEq(round.nbVotes, 7, "Wrong nbVotes");
+
+        core.draw(disputeID, 7);
+        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.vote); // Check that we don't have to wait for the timeout to pass the evidence period after appeal
+        core.passPeriod(disputeID);
+    }
+
+    function test_appeal_fullFundingDKCourtSwitch() public {
+        uint256 disputeID = 0;
+        DisputeKitClassic dkLogic = new DisputeKitClassic();
+        // Create a new DK and court to check the switch
+        bytes memory initDataDk = abi.encodeWithSignature(
+            "initialize(address,address,address)",
+            owner,
+            address(core),
+            address(wNative)
+        );
+
+        UUPSProxy proxyDk = new UUPSProxy(address(dkLogic), initDataDk);
+        DisputeKitClassic newDisputeKit = DisputeKitClassic(address(proxyDk));
+
+        uint96 newCourtID = 2;
+        uint256 newDkID = 2;
+        uint256[] memory supportedDK = new uint256[](1);
+        supportedDK[0] = DISPUTE_KIT_CLASSIC;
+        bytes memory newExtraData = abi.encodePacked(uint256(newCourtID), DEFAULT_NB_OF_JURORS, newDkID);
+
+        vm.prank(owner);
+        core.addNewDisputeKit(newDisputeKit);
+        vm.prank(owner);
+        core.createCourt(
+            GENERAL_COURT,
+            hiddenVotes,
+            minStake,
+            alpha,
+            feeForJuror,
+            3, // jurors for jump. Low number to ensure jump after the first appeal
+            [uint256(60), uint256(120), uint256(180), uint256(240)], // Times per period
+            sortitionExtraData,
+            supportedDK
+        );
+
+        arbitrable.changeArbitratorExtraData(newExtraData);
+
+        vm.prank(owner);
+        supportedDK = new uint256[](1);
+        supportedDK[0] = newDkID;
+        core.enableDisputeKits(newCourtID, supportedDK, true);
+
+        vm.prank(staker1);
+        core.setStake(newCourtID, 20000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 0);
+        assertEq(round.disputeKitID, newDkID, "Wrong DK ID");
+
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Vote
+
+        uint256[] memory voteIDs = new uint256[](3);
+        voteIDs[0] = 0;
+        voteIDs[1] = 1;
+        voteIDs[2] = 2;
+
+        vm.prank(staker1);
+        newDisputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
+
+        core.passPeriod(disputeID); // Appeal
+
+        vm.prank(crowdfunder1);
+        newDisputeKit.fundAppeal{value: 0.63 ether}(disputeID, 1);
+        vm.prank(crowdfunder2);
+
+        assertEq(core.isDisputeKitJumping(disputeID), true, "Should be jumping");
+
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.CourtJump(disputeID, 1, newCourtID, GENERAL_COURT);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.DisputeKitJump(disputeID, 1, newDkID, DISPUTE_KIT_CLASSIC);
+        vm.expectEmit(true, true, true, true);
+        emit DisputeKitClassicBase.DisputeCreation(disputeID, 2, newExtraData);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.AppealDecision(disputeID, arbitrable);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.evidence);
+        newDisputeKit.fundAppeal{value: 0.42 ether}(disputeID, 2);
+
+        (, bool jumped, ) = newDisputeKit.disputes(disputeID);
+        assertEq(jumped, true, "jumped should be true");
+        assertEq(
+            (newDisputeKit.getFundedChoices(disputeID)).length,
+            2,
+            "No fresh round created so the number of funded choices should be 2"
+        );
+
+        round = core.getRoundInfo(disputeID, 1);
+        assertEq(round.disputeKitID, DISPUTE_KIT_CLASSIC, "Wrong DK ID");
+        assertEq(sortitionModule.disputesWithoutJurors(), 1, "Wrong disputesWithoutJurors count");
+        (uint96 courtID, , , , ) = core.disputes(disputeID);
+        assertEq(courtID, GENERAL_COURT, "Wrong court ID");
+
+        (, jumped, ) = disputeKit.disputes(disputeID);
+        assertEq(jumped, false, "jumped should be false in the DK that dispute jumped to");
+
+        // Check jump modifier
+        vm.prank(address(core));
+        vm.expectRevert(DisputeKitClassicBase.DisputeJumpedToParentDK.selector);
+        newDisputeKit.draw(disputeID, 1);
+
+        // And check that draw in the new round works
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.Draw(staker1, disputeID, 1, 0); // roundID = 1 VoteID = 0
+        core.draw(disputeID, 1);
+
+        (address account, , , ) = disputeKit.getVoteInfo(disputeID, 1, 0);
+        assertEq(account, staker1, "Wrong drawn account in the classic DK");
+    }
+
+    function test_appeal_quickPassPeriod() public {
+        uint256 disputeID = 0;
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 10000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Vote
+
+        uint256[] memory voteIDs = new uint256[](3);
+        voteIDs[0] = 0;
+        voteIDs[1] = 1;
+        voteIDs[2] = 2;
+
+        vm.prank(staker1);
+        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
+
+        core.passPeriod(disputeID); // Appeal
+
+        vm.warp(block.timestamp + timesPerPeriod[3] / 2);
+
+        // Should pass to execution period without waiting for the 2nd half of the appeal.
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.execution);
+        core.passPeriod(disputeID);
+    }
+}
diff --git a/contracts/test/foundry/KlerosCore_Disputes.t.sol b/contracts/test/foundry/KlerosCore_Disputes.t.sol
new file mode 100644
index 000000000..954789f92
--- /dev/null
+++ b/contracts/test/foundry/KlerosCore_Disputes.t.sol
@@ -0,0 +1,148 @@
+// SPDX-License-Identifier: MIT
+pragma solidity ^0.8.24;
+
+import {KlerosCore_TestBase} from "./KlerosCore_TestBase.sol";
+import {KlerosCoreBase} from "../../src/arbitration/KlerosCoreBase.sol";
+import {IArbitratorV2} from "../../src/arbitration/KlerosCoreBase.sol";
+import {DisputeKitClassicBase} from "../../src/arbitration/dispute-kits/DisputeKitClassicBase.sol";
+import {IArbitrableV2} from "../../src/arbitration/arbitrables/ArbitrableExample.sol";
+import "../../src/libraries/Constants.sol";
+
+/// @title KlerosCore_DisputesTest
+/// @dev Tests for KlerosCore dispute creation and management
+contract KlerosCore_DisputesTest is KlerosCore_TestBase {
+    function test_createDispute_eth() public {
+        // Create a new court and DK to test non-standard extra data
+        uint256 newFee = 0.01 ether;
+        uint96 newCourtID = 2;
+        uint256 newNbJurors = 4;
+        uint256 newDkID = 2;
+        uint256[] memory supportedDK = new uint256[](1);
+        supportedDK[0] = DISPUTE_KIT_CLASSIC;
+        bytes memory newExtraData = abi.encodePacked(uint256(newCourtID), newNbJurors, newDkID);
+
+        vm.prank(owner);
+        core.addNewDisputeKit(disputeKit); // Just add the same dk to avoid dealing with initialization
+        vm.prank(owner);
+        core.createCourt(
+            GENERAL_COURT,
+            true, // Hidden votes
+            2000, // min stake
+            20000, // alpha
+            newFee, // fee for juror
+            50, // jurors for jump
+            [uint256(10), uint256(20), uint256(30), uint256(40)], // Times per period
+            abi.encode(uint256(4)), // Sortition extra data
+            supportedDK
+        );
+
+        arbitrable.changeArbitratorExtraData(newExtraData);
+
+        vm.expectRevert(KlerosCoreBase.ArbitrationFeesNotEnough.selector);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: newFee * newNbJurors - 1}("Action");
+
+        vm.expectRevert(KlerosCoreBase.DisputeKitNotSupportedByCourt.selector);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: 0.04 ether}("Action");
+
+        vm.prank(owner);
+        supportedDK = new uint256[](1);
+        supportedDK[0] = newDkID;
+        core.enableDisputeKits(newCourtID, supportedDK, true);
+
+        uint256 disputeID = 0;
+        uint256 nbChoices = 2;
+        vm.prank(disputer);
+        vm.expectEmit(true, true, true, true);
+        emit DisputeKitClassicBase.DisputeCreation(disputeID, nbChoices, newExtraData);
+        vm.expectEmit(true, true, true, true);
+        emit IArbitratorV2.DisputeCreation(disputeID, arbitrable);
+        arbitrable.createDispute{value: 0.04 ether}("Action");
+
+        assertEq(sortitionModule.disputesWithoutJurors(), 1, "Wrong disputesWithoutJurors count");
+        (
+            uint96 courtID,
+            IArbitrableV2 arbitrated,
+            KlerosCoreBase.Period period,
+            bool ruled,
+            uint256 lastPeriodChange
+        ) = core.disputes(disputeID);
+
+        assertEq(courtID, newCourtID, "Wrong court ID");
+        assertEq(address(arbitrated), address(arbitrable), "Wrong arbitrable");
+        assertEq(uint256(period), uint256(KlerosCoreBase.Period.evidence), "Wrong period");
+        assertEq(ruled, false, "Should not be ruled");
+        assertEq(lastPeriodChange, block.timestamp, "Wrong lastPeriodChange");
+
+        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 0);
+        assertEq(round.disputeKitID, newDkID, "Wrong DK ID");
+        assertEq(round.pnkAtStakePerJuror, 4000, "Wrong pnkAtStakePerJuror"); // minStake * alpha / divisor = 2000 * 20000/10000
+        assertEq(round.totalFeesForJurors, 0.04 ether, "Wrong totalFeesForJurors");
+        assertEq(round.nbVotes, 4, "Wrong nbVotes");
+        assertEq(round.repartitions, 0, "repartitions should be 0");
+        assertEq(round.pnkPenalties, 0, "pnkPenalties should be 0");
+        assertEq(round.sumFeeRewardPaid, 0, "sumFeeRewardPaid should be 0");
+        assertEq(round.sumPnkRewardPaid, 0, "sumPnkRewardPaid should be 0");
+        assertEq(address(round.feeToken), address(0), "feeToken should be 0");
+        assertEq(round.drawIterations, 0, "drawIterations should be 0");
+
+        (uint256 numberOfChoices, bool jumped, bytes memory extraData) = disputeKit.disputes(disputeID);
+
+        assertEq(numberOfChoices, 2, "Wrong numberOfChoices");
+        assertEq(jumped, false, "jumped should be false");
+        assertEq(extraData, newExtraData, "Wrong extra data");
+        assertEq(disputeKit.coreDisputeIDToLocal(0), disputeID, "Wrong local disputeID");
+        assertEq(disputeKit.coreDisputeIDToActive(0), true, "Wrong disputes length");
+
+        (
+            uint256 winningChoice,
+            bool tied,
+            uint256 totalVoted,
+            uint256 totalCommited,
+            uint256 nbVoters,
+            uint256 choiceCount
+        ) = disputeKit.getRoundInfo(0, 0, 0);
+        assertEq(winningChoice, 0, "winningChoice should be 0");
+        assertEq(tied, true, "tied should be true");
+        assertEq(totalVoted, 0, "totalVoted should be 0");
+        assertEq(totalCommited, 0, "totalCommited should be 0");
+        assertEq(nbVoters, 0, "nbVoters should be 0");
+        assertEq(choiceCount, 0, "choiceCount should be 0");
+    }
+
+    function test_createDispute_tokens() public {
+        feeToken.transfer(disputer, 1 ether);
+        vm.prank(disputer);
+        feeToken.approve(address(arbitrable), 1 ether);
+
+        vm.expectRevert(KlerosCoreBase.TokenNotAccepted.selector);
+        vm.prank(disputer);
+        arbitrable.createDispute("Action", 0.18 ether);
+
+        vm.prank(owner);
+        core.changeAcceptedFeeTokens(feeToken, true);
+        vm.prank(owner);
+        core.changeCurrencyRates(feeToken, 500, 3);
+
+        vm.expectRevert(KlerosCoreBase.ArbitrationFeesNotEnough.selector);
+        vm.prank(disputer);
+        arbitrable.createDispute("Action", 0.18 ether - 1);
+
+        vm.expectRevert(KlerosCoreBase.TransferFailed.selector);
+        vm.prank(address(arbitrable)); // Bypass createDispute in arbitrable to avoid transfer checks there and make the arbitrable call KC directly
+        core.createDispute(2, arbitratorExtraData, feeToken, 0.18 ether);
+
+        assertEq(core.arbitrationCost(arbitratorExtraData, feeToken), 0.18 ether, "Wrong token cost");
+        vm.prank(disputer);
+        arbitrable.createDispute("Action", 0.18 ether);
+
+        KlerosCoreBase.Round memory round = core.getRoundInfo(0, 0);
+        assertEq(round.totalFeesForJurors, 0.18 ether, "Wrong totalFeesForJurors");
+        assertEq(round.nbVotes, 3, "Wrong nbVotes");
+        assertEq(address(round.feeToken), address(feeToken), "Wrong feeToken");
+
+        assertEq(feeToken.balanceOf(address(core)), 0.18 ether, "Wrong token balance of the core");
+        assertEq(feeToken.balanceOf(disputer), 0.82 ether, "Wrong token balance of the disputer");
+    }
+}
diff --git a/contracts/test/foundry/KlerosCore_Drawing.t.sol b/contracts/test/foundry/KlerosCore_Drawing.t.sol
new file mode 100644
index 000000000..d6ffc9ea9
--- /dev/null
+++ b/contracts/test/foundry/KlerosCore_Drawing.t.sol
@@ -0,0 +1,124 @@
+// SPDX-License-Identifier: MIT
+pragma solidity ^0.8.24;
+
+import {KlerosCore_TestBase} from "./KlerosCore_TestBase.sol";
+import {KlerosCoreBase} from "../../src/arbitration/KlerosCoreBase.sol";
+import {SortitionModuleBase} from "../../src/arbitration/SortitionModuleBase.sol";
+import {ISortitionModule} from "../../src/arbitration/interfaces/ISortitionModule.sol";
+import "../../src/libraries/Constants.sol";
+
+/// @title KlerosCore_DrawingTest
+/// @dev Tests for KlerosCore jury drawing and selection mechanisms
+contract KlerosCore_DrawingTest is KlerosCore_TestBase {
+    function test_draw() public {
+        uint256 disputeID = 0;
+        uint256 roundID = 0;
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 1500);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        vm.expectEmit(true, true, true, true);
+        emit SortitionModuleBase.StakeLocked(staker1, 1000, false);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.Draw(staker1, disputeID, roundID, 0); // VoteID = 0
+
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS); // Do 3 iterations and see that the juror will get drawn 3 times despite low stake.
+
+        (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, ) = sortitionModule.getJurorBalance(
+            staker1,
+            GENERAL_COURT
+        );
+        assertEq(totalStaked, 1500, "Wrong amount total staked");
+        assertEq(totalLocked, 3000, "Wrong amount locked"); // 1000 per draw
+        assertEq(stakedInCourt, 1500, "Wrong amount staked in court");
+        assertEq(sortitionModule.disputesWithoutJurors(), 0, "Wrong disputesWithoutJurors count");
+
+        for (uint256 i = 0; i < DEFAULT_NB_OF_JURORS; i++) {
+            (address account, bytes32 commit, uint256 choice, bool voted) = disputeKit.getVoteInfo(0, 0, i);
+            assertEq(account, staker1, "Wrong drawn account");
+            assertEq(commit, bytes32(0), "Commit should be empty");
+            assertEq(choice, 0, "Choice should be empty");
+            assertEq(voted, false, "Voted should be false");
+        }
+    }
+
+    function test_draw_noEmptyAddresses() public {
+        uint256 disputeID = 0;
+        uint256 roundID = 0;
+
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS); // No one is staked so check that the empty addresses are not drawn.
+
+        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, roundID);
+        assertEq(round.drawIterations, 3, "Wrong drawIterations number");
+
+        (, , , , uint256 nbVoters, ) = disputeKit.getRoundInfo(disputeID, roundID, 0);
+        assertEq(nbVoters, 0, "nbVoters should be 0");
+    }
+
+    function test_draw_parentCourts() public {
+        uint96 newCourtID = 2;
+        uint256 disputeID = 0;
+        uint256 roundID = 0;
+
+        // Create a child court and stake exclusively there to check that parent courts hold drawing power.
+        vm.prank(owner);
+        uint256[] memory supportedDK = new uint256[](1);
+        supportedDK[0] = DISPUTE_KIT_CLASSIC;
+        core.createCourt(
+            GENERAL_COURT,
+            true, // Hidden votes
+            1000, // min stake
+            10000, // alpha
+            0.03 ether, // fee for juror
+            50, // jurors for jump
+            [uint256(10), uint256(20), uint256(30), uint256(40)], // Times per period
+            sortitionExtraData, // Sortition extra data
+            supportedDK
+        );
+
+        uint256[] memory children = core.getCourtChildren(GENERAL_COURT);
+        assertEq(children.length, 1, "Wrong children count");
+        assertEq(children[0], 2, "Wrong child ID");
+
+        vm.prank(staker1);
+        core.setStake(newCourtID, 3000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action"); // Dispute uses general court by default
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        (uint96 courtID, , , , ) = core.disputes(disputeID);
+        assertEq(courtID, GENERAL_COURT, "Wrong court ID of the dispute");
+
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.Draw(staker1, disputeID, roundID, 0);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.Draw(staker1, disputeID, roundID, 1);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.Draw(staker1, disputeID, roundID, 2);
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
+
+        assertEq(sortitionModule.disputesWithoutJurors(), 0, "Wrong disputesWithoutJurors count");
+
+        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, roundID);
+        assertEq(round.drawIterations, 3, "Wrong drawIterations number");
+
+        (, , , , uint256 nbVoters, ) = disputeKit.getRoundInfo(disputeID, roundID, 0);
+        assertEq(nbVoters, 3, "nbVoters should be 3");
+    }
+}
diff --git a/contracts/test/foundry/KlerosCore_Execution.t.sol b/contracts/test/foundry/KlerosCore_Execution.t.sol
new file mode 100644
index 000000000..21e9b7ab0
--- /dev/null
+++ b/contracts/test/foundry/KlerosCore_Execution.t.sol
@@ -0,0 +1,688 @@
+// SPDX-License-Identifier: MIT
+pragma solidity ^0.8.24;
+
+import {KlerosCore_TestBase} from "./KlerosCore_TestBase.sol";
+import {KlerosCoreBase} from "../../src/arbitration/KlerosCoreBase.sol";
+import {SortitionModuleBase} from "../../src/arbitration/SortitionModuleBase.sol";
+import {DisputeKitClassicBase} from "../../src/arbitration/dispute-kits/DisputeKitClassicBase.sol";
+import {IArbitratorV2, IArbitrableV2} from "../../src/arbitration/KlerosCoreBase.sol";
+import {IERC20} from "../../src/libraries/SafeERC20.sol";
+import "../../src/libraries/Constants.sol";
+
+/// @title KlerosCore_ExecutionTest
+/// @dev Tests for KlerosCore execution, rewards, and ruling finalization
+contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
+    function test_execute() public {
+        uint256 disputeID = 0;
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 1500);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        // Split the stakers' votes. The first staker will get VoteID 0 and the second will take the rest.
+        core.draw(disputeID, 1);
+
+        vm.warp(block.timestamp + maxDrawingTime);
+        sortitionModule.passPhase(); // Staking phase to stake the 2nd voter
+        vm.prank(staker2);
+        core.setStake(GENERAL_COURT, 20000);
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        core.draw(disputeID, 2); // Assign leftover votes to staker2
+
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Vote
+
+        uint256[] memory voteIDs = new uint256[](1);
+        voteIDs[0] = 0;
+        vm.prank(staker1);
+        disputeKit.castVote(disputeID, voteIDs, 1, 0, "XYZ"); // Staker1 only got 1 vote because of low stake
+
+        voteIDs = new uint256[](2);
+        voteIDs[0] = 1;
+        voteIDs[1] = 2;
+        vm.prank(staker2);
+        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
+        core.passPeriod(disputeID); // Appeal
+
+        vm.expectRevert(KlerosCoreBase.NotExecutionPeriod.selector);
+        core.execute(disputeID, 0, 1);
+
+        vm.warp(block.timestamp + timesPerPeriod[3]);
+        core.passPeriod(disputeID); // Execution
+
+        vm.prank(owner);
+        core.pause();
+        vm.expectRevert(KlerosCoreBase.WhenNotPausedOnly.selector);
+        core.execute(disputeID, 0, 1);
+        vm.prank(owner);
+        core.unpause();
+
+        assertEq(disputeKit.getCoherentCount(disputeID, 0), 2, "Wrong coherent count");
+
+        uint256 pnkCoherence;
+        uint256 feeCoherence;
+        // dispute, round, voteID, feeForJuror (not used in classic DK), pnkPerJuror (not used in classic DK)
+        (pnkCoherence, feeCoherence) = disputeKit.getDegreeOfCoherenceReward(disputeID, 0, 0, 0, 0);
+        assertEq(pnkCoherence, 0, "Wrong reward pnk coherence 0 vote ID");
+        assertEq(feeCoherence, 0, "Wrong reward fee coherence 0 vote ID");
+
+        (pnkCoherence, feeCoherence) = disputeKit.getDegreeOfCoherenceReward(disputeID, 0, 1, 0, 0);
+        assertEq(pnkCoherence, 10000, "Wrong reward pnk coherence 1 vote ID");
+        assertEq(feeCoherence, 10000, "Wrong reward fee coherence 1 vote ID");
+
+        (pnkCoherence, feeCoherence) = disputeKit.getDegreeOfCoherenceReward(disputeID, 0, 2, 0, 0);
+        assertEq(pnkCoherence, 10000, "Wrong reward pnk coherence 2 vote ID");
+        assertEq(feeCoherence, 10000, "Wrong reward fee coherence 2 vote ID");
+
+        assertEq(disputeKit.getDegreeOfCoherencePenalty(disputeID, 0, 0, 0, 0), 0, "Wrong penalty coherence 0 vote ID");
+        assertEq(
+            disputeKit.getDegreeOfCoherencePenalty(disputeID, 0, 1, 0, 0),
+            10000,
+            "Wrong penalty coherence 1 vote ID"
+        );
+        assertEq(
+            disputeKit.getDegreeOfCoherencePenalty(disputeID, 0, 2, 0, 0),
+            10000,
+            "Wrong penalty coherence 2 vote ID"
+        );
+
+        vm.expectEmit(true, true, true, true);
+        emit SortitionModuleBase.StakeLocked(staker1, 1000, true);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.TokenAndETHShift(staker1, disputeID, 0, 0, -int256(1000), 0, IERC20(address(0)));
+        // Check iterations for the winning staker to see the shifts
+        vm.expectEmit(true, true, true, true);
+        emit SortitionModuleBase.StakeLocked(staker2, 0, true);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.TokenAndETHShift(staker2, disputeID, 0, 10000, 0, 0, IERC20(address(0)));
+        vm.expectEmit(true, true, true, true);
+        emit SortitionModuleBase.StakeLocked(staker2, 0, true);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.TokenAndETHShift(staker2, disputeID, 0, 10000, 0, 0, IERC20(address(0)));
+        core.execute(disputeID, 0, 3); // Do 3 iterations to check penalties first
+
+        (uint256 totalStaked, uint256 totalLocked, , ) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
+        assertEq(totalStaked, 500, "totalStaked should be penalized"); // 1500 - 1000
+        assertEq(totalLocked, 0, "Tokens should be released for staker1");
+        (, totalLocked, , ) = sortitionModule.getJurorBalance(staker2, GENERAL_COURT);
+        assertEq(totalLocked, 2000, "Tokens should still be locked for staker2");
+
+        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 0);
+        assertEq(round.repartitions, 3, "Wrong repartitions");
+        assertEq(round.pnkPenalties, 1000, "Wrong pnkPenalties");
+
+        vm.expectEmit(true, true, true, true);
+        emit SortitionModuleBase.StakeLocked(staker1, 0, true);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.TokenAndETHShift(staker1, disputeID, 0, 0, 0, 0, IERC20(address(0)));
+        // Check iterations for the winning staker to see the shifts
+        vm.expectEmit(true, true, true, true);
+        emit SortitionModuleBase.StakeLocked(staker2, 1000, true);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.TokenAndETHShift(staker2, disputeID, 0, 10000, 500, 0.045 ether, IERC20(address(0)));
+        vm.expectEmit(true, true, true, true);
+        emit SortitionModuleBase.StakeLocked(staker2, 1000, true);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.TokenAndETHShift(staker2, disputeID, 0, 10000, 500, 0.045 ether, IERC20(address(0)));
+        core.execute(disputeID, 0, 10); // Finish the iterations. We need only 3 but check that it corrects the count.
+
+        (, totalLocked, , ) = sortitionModule.getJurorBalance(staker2, GENERAL_COURT);
+        assertEq(totalLocked, 0, "Tokens should be unlocked for staker2");
+
+        round = core.getRoundInfo(disputeID, 0);
+        assertEq(round.repartitions, 6, "Wrong repartitions");
+        assertEq(round.pnkPenalties, 1000, "Wrong pnkPenalties");
+        assertEq(round.sumFeeRewardPaid, 0.09 ether, "Wrong sumFeeRewardPaid");
+        assertEq(round.sumPnkRewardPaid, 1000, "Wrong sumPnkRewardPaid");
+
+        assertEq(address(core).balance, 0, "Wrong balance of the core");
+        assertEq(staker1.balance, 0, "Wrong balance of the staker1");
+        assertEq(staker2.balance, 0.09 ether, "Wrong balance of the staker2");
+
+        assertEq(pinakion.balanceOf(address(core)), 21500, "Wrong token balance of the core"); // Was 21500. 1000 was transferred to staker2
+        assertEq(pinakion.balanceOf(staker1), 999999999999998500, "Wrong token balance of staker1");
+        assertEq(pinakion.balanceOf(staker2), 999999999999980000, "Wrong token balance of staker2"); // 20k stake and 1k added as a reward, thus -19k from the default
+    }
+
+    function test_execute_NoCoherence() public {
+        uint256 disputeID = 0;
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 20000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
+
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Vote
+
+        vm.warp(block.timestamp + timesPerPeriod[2]); // Don't vote at all so no one is coherent
+        core.passPeriod(disputeID); // Appeal
+
+        vm.warp(block.timestamp + timesPerPeriod[3]);
+        core.passPeriod(disputeID); // Execution
+
+        assertEq(disputeKit.getCoherentCount(disputeID, 0), 0, "Wrong coherent count");
+
+        uint256 pnkCoherence;
+        uint256 feeCoherence;
+        // dispute, round, voteID, feeForJuror (not used in classic DK), pnkPerJuror (not used in classic DK)
+        (pnkCoherence, feeCoherence) = disputeKit.getDegreeOfCoherenceReward(disputeID, 0, 0, 0, 0);
+        assertEq(pnkCoherence, 0, "Wrong reward pnk coherence 0 vote ID");
+        assertEq(feeCoherence, 0, "Wrong reward fee coherence 0 vote ID");
+
+        (pnkCoherence, feeCoherence) = disputeKit.getDegreeOfCoherenceReward(disputeID, 0, 1, 0, 0);
+        assertEq(pnkCoherence, 0, "Wrong reward pnk coherence 1 vote ID");
+        assertEq(feeCoherence, 0, "Wrong reward fee coherence 1 vote ID");
+
+        (pnkCoherence, feeCoherence) = disputeKit.getDegreeOfCoherenceReward(disputeID, 0, 2, 0, 0);
+        assertEq(pnkCoherence, 0, "Wrong reward pnk coherence 2 vote ID");
+        assertEq(feeCoherence, 0, "Wrong reward fee coherence 2 vote ID");
+
+        assertEq(disputeKit.getDegreeOfCoherencePenalty(disputeID, 0, 0, 0, 0), 0, "Wrong penalty coherence 0 vote ID");
+        assertEq(disputeKit.getDegreeOfCoherencePenalty(disputeID, 0, 1, 0, 0), 0, "Wrong penalty coherence 1 vote ID");
+        assertEq(disputeKit.getDegreeOfCoherencePenalty(disputeID, 0, 2, 0, 0), 0, "Wrong penalty coherence 2 vote ID");
+
+        uint256 ownerBalance = owner.balance;
+        uint256 ownerTokenBalance = pinakion.balanceOf(owner);
+
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.LeftoverRewardSent(disputeID, 0, 3000, 0.09 ether, IERC20(address(0)));
+        core.execute(disputeID, 0, 3);
+
+        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 0);
+        assertEq(round.pnkPenalties, 3000, "Wrong pnkPenalties");
+        assertEq(round.sumFeeRewardPaid, 0, "Wrong sumFeeRewardPaid");
+        assertEq(round.sumPnkRewardPaid, 0, "Wrong sumPnkRewardPaid");
+
+        assertEq(address(core).balance, 0, "Wrong balance of the core");
+        assertEq(staker1.balance, 0, "Wrong balance of the staker1");
+        assertEq(owner.balance, ownerBalance + 0.09 ether, "Wrong balance of the owner");
+
+        assertEq(pinakion.balanceOf(address(core)), 17000, "Wrong token balance of the core");
+        assertEq(pinakion.balanceOf(staker1), 999999999999980000, "Wrong token balance of staker1");
+        assertEq(pinakion.balanceOf(owner), ownerTokenBalance + 3000, "Wrong token balance of owner");
+    }
+
+    function test_execute_UnstakeInactive() public {
+        // Create a 2nd court so unstaking is done in multiple courts.
+        vm.prank(owner);
+        uint256[] memory supportedDK = new uint256[](1);
+        supportedDK[0] = DISPUTE_KIT_CLASSIC;
+        core.createCourt(
+            GENERAL_COURT,
+            true, // Hidden votes
+            1000, // min stake
+            10000, // alpha
+            0.03 ether, // fee for juror
+            50, // jurors for jump
+            [uint256(10), uint256(20), uint256(30), uint256(40)], // Times per period
+            sortitionExtraData, // Sortition extra data
+            supportedDK
+        );
+
+        uint256 disputeID = 0;
+        uint96 newCourtID = 2;
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 20000);
+        vm.prank(staker1);
+        core.setStake(newCourtID, 20000);
+        (, , , uint256 nbCourts) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
+        assertEq(nbCourts, 2, "Wrong number of courts");
+
+        assertEq(pinakion.balanceOf(address(core)), 40000, "Wrong token balance of the core");
+        assertEq(pinakion.balanceOf(staker1), 999999999999960000, "Wrong token balance of staker1");
+
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
+
+        sortitionModule.passPhase(); // Staking phase. Change to staking so we don't have to deal with delayed stakes.
+
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Vote
+
+        vm.warp(block.timestamp + timesPerPeriod[2]); // Don't vote at all so no one is coherent
+        core.passPeriod(disputeID); // Appeal
+
+        vm.warp(block.timestamp + timesPerPeriod[3]);
+        core.passPeriod(disputeID); // Execution
+
+        uint256 ownerTokenBalance = pinakion.balanceOf(owner);
+
+        // Note that these events are emitted only after the first iteration of execute() therefore the juror has been penalized only for 1000 PNK her.
+        vm.expectEmit(true, true, true, true);
+        emit SortitionModuleBase.StakeSet(staker1, newCourtID, 0, 19000); // Starting with 40000 we first nullify the stake and remove 20000 and then remove penalty once since there was only first iteration (40000 - 20000 - 1000)
+        vm.expectEmit(true, true, true, true);
+        emit SortitionModuleBase.StakeSet(staker1, GENERAL_COURT, 0, 2000); // 2000 PNK should remain in balance to cover penalties since the first 1000 of locked pnk was already unlocked
+        core.execute(disputeID, 0, 3);
+
+        assertEq(pinakion.balanceOf(address(core)), 0, "Wrong token balance of the core");
+        assertEq(pinakion.balanceOf(staker1), 999999999999997000, "Wrong token balance of staker1"); // 3000 locked PNK was withheld by the contract and given to owner.
+        assertEq(pinakion.balanceOf(owner), ownerTokenBalance + 3000, "Wrong token balance of owner");
+
+        (, , , nbCourts) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
+        assertEq(nbCourts, 0, "Should unstake from all courts");
+    }
+
+    function test_execute_UnstakeInsolvent() public {
+        uint256 disputeID = 0;
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 1000);
+
+        assertEq(pinakion.balanceOf(address(core)), 1000, "Wrong token balance of the core");
+        assertEq(pinakion.balanceOf(staker1), 999999999999999000, "Wrong token balance of staker1");
+
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
+
+        (uint256 totalStaked, uint256 totalLocked, , uint256 nbCourts) = sortitionModule.getJurorBalance(
+            staker1,
+            GENERAL_COURT
+        );
+        assertEq(totalStaked, 1000, "Wrong totalStaked");
+        assertEq(totalLocked, 3000, "totalLocked should exceed totalStaked"); // Juror only staked 1000 but was drawn 3x of minStake (3000 locked)
+        assertEq(nbCourts, 1, "Wrong number of courts");
+
+        sortitionModule.passPhase(); // Staking phase. Change to staking so we don't have to deal with delayed stakes.
+
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Vote
+
+        uint256[] memory voteIDs = new uint256[](1);
+        voteIDs[0] = 0;
+        vm.prank(staker1);
+        disputeKit.castVote(disputeID, voteIDs, 1, 0, "XYZ"); // 1 incoherent vote should make the juror insolvent
+
+        voteIDs = new uint256[](2);
+        voteIDs[0] = 1;
+        voteIDs[1] = 2;
+        vm.prank(staker1);
+        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
+
+        core.passPeriod(disputeID); // Appeal
+
+        vm.warp(block.timestamp + timesPerPeriod[3]);
+        core.passPeriod(disputeID); // Execution
+
+        vm.expectEmit(true, true, true, true);
+        emit SortitionModuleBase.StakeSet(staker1, GENERAL_COURT, 0, 0); // Juror should have no stake left and should be unstaked from the court automatically.
+        core.execute(disputeID, 0, 6);
+
+        assertEq(pinakion.balanceOf(address(core)), 0, "Wrong token balance of the core");
+        assertEq(pinakion.balanceOf(staker1), 1 ether, "Wrong token balance of staker1"); // The juror should have his penalty back as a reward
+
+        (, , , nbCourts) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
+        assertEq(nbCourts, 0, "Should unstake from all courts");
+    }
+
+    function test_execute_withdrawLeftoverPNK() public {
+        // Return the previously locked tokens
+        uint256 disputeID = 0;
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 1000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
+
+        sortitionModule.passPhase(); // Staking. Pass the phase so the juror can unstake before execution
+
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Vote
+
+        uint256[] memory voteIDs = new uint256[](3);
+        voteIDs[0] = 0;
+        voteIDs[1] = 1;
+        voteIDs[2] = 2;
+        vm.prank(staker1);
+        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
+
+        core.passPeriod(disputeID); // Appeal
+
+        vm.warp(block.timestamp + timesPerPeriod[3]);
+        core.passPeriod(disputeID); // Execution
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 0); // Set stake to 0 to check if it will be withdrawn later.
+
+        (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts) = sortitionModule
+            .getJurorBalance(staker1, GENERAL_COURT);
+        assertEq(totalStaked, 1000, "Wrong amount staked");
+        assertEq(totalLocked, 3000, "Wrong amount locked");
+        assertEq(stakedInCourt, 0, "Should be unstaked");
+        assertEq(nbCourts, 0, "Should be 0 courts");
+
+        assertEq(pinakion.balanceOf(address(core)), 1000, "Wrong token balance of the core");
+        assertEq(pinakion.balanceOf(staker1), 999999999999999000, "Wrong token balance of staker1");
+
+        vm.expectRevert(SortitionModuleBase.NotEligibleForWithdrawal.selector);
+        sortitionModule.withdrawLeftoverPNK(staker1);
+
+        vm.expectEmit(true, true, true, true);
+        emit SortitionModuleBase.LeftoverPNK(staker1, 1000);
+        core.execute(disputeID, 0, 6);
+
+        (totalStaked, totalLocked, , ) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
+        assertEq(totalStaked, 1000, "Wrong amount staked");
+        assertEq(totalLocked, 0, "Should be fully unlocked");
+
+        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 0);
+        assertEq(round.pnkPenalties, 0, "Wrong pnkPenalties");
+        assertEq(round.sumFeeRewardPaid, 0.09 ether, "Wrong sumFeeRewardPaid");
+        assertEq(round.sumPnkRewardPaid, 0, "Wrong sumPnkRewardPaid"); // No penalty so no rewards in pnk
+
+        // Execute() shouldn't withdraw the tokens.
+        assertEq(pinakion.balanceOf(address(core)), 1000, "Wrong token balance of the core");
+        assertEq(pinakion.balanceOf(staker1), 999999999999999000, "Wrong token balance of staker1");
+
+        vm.expectRevert(KlerosCoreBase.SortitionModuleOnly.selector);
+        vm.prank(owner);
+        core.transferBySortitionModule(staker1, 1000);
+
+        vm.expectEmit(true, true, true, true);
+        emit SortitionModuleBase.LeftoverPNKWithdrawn(staker1, 1000);
+        sortitionModule.withdrawLeftoverPNK(staker1);
+
+        (totalStaked, , , ) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
+        assertEq(totalStaked, 0, "Should be unstaked fully");
+
+        // Check that everything is withdrawn now
+        assertEq(pinakion.balanceOf(address(core)), 0, "Core balance should be empty");
+        assertEq(pinakion.balanceOf(staker1), 1 ether, "All PNK should be withdrawn");
+    }
+
+    function test_execute_feeToken() public {
+        uint256 disputeID = 0;
+
+        feeToken.transfer(disputer, 1 ether);
+        vm.prank(disputer);
+        feeToken.approve(address(arbitrable), 1 ether);
+
+        vm.prank(owner);
+        core.changeAcceptedFeeTokens(feeToken, true);
+        vm.prank(owner);
+        core.changeCurrencyRates(feeToken, 500, 3);
+
+        vm.prank(disputer);
+        arbitrable.createDispute("Action", 0.18 ether);
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 20000);
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
+
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Vote
+
+        uint256[] memory voteIDs = new uint256[](3);
+        voteIDs[0] = 0;
+        voteIDs[1] = 1;
+        voteIDs[2] = 2;
+        vm.prank(staker1);
+        disputeKit.castVote(disputeID, voteIDs, 1, 0, "XYZ"); // Staker1 only got 1 vote because of low stake
+
+        core.passPeriod(disputeID); // Appeal
+
+        vm.warp(block.timestamp + timesPerPeriod[3]);
+        core.passPeriod(disputeID); // Execution
+
+        // Check only once per penalty and per reward
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.TokenAndETHShift(staker1, disputeID, 0, 10000, 0, 0, feeToken);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.TokenAndETHShift(staker1, disputeID, 0, 10000, 0, 0.06 ether, feeToken);
+        core.execute(disputeID, 0, 6);
+
+        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 0);
+        assertEq(round.sumFeeRewardPaid, 0.18 ether, "Wrong sumFeeRewardPaid");
+
+        assertEq(feeToken.balanceOf(address(core)), 0, "Wrong fee token balance of the core");
+        assertEq(feeToken.balanceOf(staker1), 0.18 ether, "Wrong fee token balance of staker1");
+        assertEq(feeToken.balanceOf(disputer), 0.82 ether, "Wrong fee token balance of disputer");
+    }
+
+    function test_execute_NoCoherence_feeToken() public {
+        uint256 disputeID = 0;
+
+        feeToken.transfer(disputer, 1 ether);
+        vm.prank(disputer);
+        feeToken.approve(address(arbitrable), 1 ether);
+
+        vm.prank(owner);
+        core.changeAcceptedFeeTokens(feeToken, true);
+        vm.prank(owner);
+        core.changeCurrencyRates(feeToken, 500, 3);
+
+        vm.prank(disputer);
+        arbitrable.createDispute("Action", 0.18 ether);
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 20000);
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
+
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Vote
+
+        vm.warp(block.timestamp + timesPerPeriod[2]); // Don't vote at all so no one is coherent
+        core.passPeriod(disputeID); // Appeal
+
+        vm.warp(block.timestamp + timesPerPeriod[3]);
+        core.passPeriod(disputeID); // Execution
+
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.LeftoverRewardSent(disputeID, 0, 3000, 0.18 ether, feeToken);
+        core.execute(disputeID, 0, 10); // Put more iterations to check that they're capped
+
+        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 0);
+        assertEq(round.pnkPenalties, 3000, "Wrong pnkPenalties");
+        assertEq(round.sumFeeRewardPaid, 0, "Wrong sumFeeRewardPaid");
+        assertEq(round.sumPnkRewardPaid, 0, "Wrong sumPnkRewardPaid");
+        assertEq(round.repartitions, 3, "Wrong repartitions");
+
+        assertEq(feeToken.balanceOf(address(core)), 0, "Wrong token balance of the core");
+        assertEq(feeToken.balanceOf(staker1), 0, "Wrong token balance of staker1");
+        assertEq(feeToken.balanceOf(disputer), 0.82 ether, "Wrong token balance of disputer");
+        assertEq(feeToken.balanceOf(owner), 0.18 ether, "Wrong token balance of owner");
+    }
+
+    function test_executeRuling() public {
+        uint256 disputeID = 0;
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 20000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Vote
+
+        uint256[] memory voteIDs = new uint256[](3);
+        voteIDs[0] = 0;
+        voteIDs[1] = 1;
+        voteIDs[2] = 2;
+
+        vm.prank(staker1);
+        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
+        core.passPeriod(disputeID); // Appeal
+
+        vm.expectRevert(KlerosCoreBase.NotExecutionPeriod.selector);
+        core.executeRuling(disputeID);
+
+        vm.warp(block.timestamp + timesPerPeriod[3]);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.execution);
+        core.passPeriod(disputeID); // Execution
+
+        (, , KlerosCoreBase.Period period, , uint256 lastPeriodChange) = core.disputes(disputeID);
+        assertEq(uint256(period), uint256(KlerosCoreBase.Period.execution), "Wrong period");
+        assertEq(lastPeriodChange, block.timestamp, "Wrong lastPeriodChange");
+
+        vm.expectRevert(KlerosCoreBase.DisputePeriodIsFinal.selector);
+        core.passPeriod(disputeID);
+
+        vm.expectEmit(true, true, true, true);
+        emit IArbitratorV2.Ruling(arbitrable, disputeID, 2); // Winning choice = 2
+        vm.expectEmit(true, true, true, true);
+        emit IArbitrableV2.Ruling(core, disputeID, 2);
+        core.executeRuling(disputeID);
+
+        vm.expectRevert(KlerosCoreBase.RulingAlreadyExecuted.selector);
+        core.executeRuling(disputeID);
+
+        (, , , bool ruled, ) = core.disputes(disputeID);
+        assertEq(ruled, true, "Should be ruled");
+    }
+
+    function test_executeRuling_appealSwitch() public {
+        // Check that the ruling switches if only one side was funded
+        uint256 disputeID = 0;
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 20000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Vote
+
+        uint256[] memory voteIDs = new uint256[](3);
+        voteIDs[0] = 0;
+        voteIDs[1] = 1;
+        voteIDs[2] = 2;
+
+        vm.prank(staker1);
+        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
+        core.passPeriod(disputeID); // Appeal
+
+        vm.prank(crowdfunder1);
+        disputeKit.fundAppeal{value: 0.63 ether}(disputeID, 1); // Fund the losing choice
+
+        vm.warp(block.timestamp + timesPerPeriod[3]);
+        core.passPeriod(disputeID); // Execution
+
+        vm.expectEmit(true, true, true, true);
+        emit IArbitratorV2.Ruling(arbitrable, disputeID, 1); // Winning choice is switched to 1
+        vm.expectEmit(true, true, true, true);
+        emit IArbitrableV2.Ruling(core, disputeID, 1);
+        core.executeRuling(disputeID);
+
+        (uint256 ruling, bool tied, bool overridden) = disputeKit.currentRuling(disputeID);
+        assertEq(ruling, 1, "Wrong ruling");
+        assertEq(tied, false, "Not tied");
+        assertEq(overridden, true, "Should be overridden");
+    }
+
+    function test_withdrawFeesAndRewards() public {
+        uint256 disputeID = 0;
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 20000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Vote
+
+        uint256[] memory voteIDs = new uint256[](3);
+        voteIDs[0] = 0;
+        voteIDs[1] = 1;
+        voteIDs[2] = 2;
+
+        vm.prank(staker1);
+        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
+        core.passPeriod(disputeID); // Appeal
+
+        vm.prank(crowdfunder1);
+        disputeKit.fundAppeal{value: 0.63 ether}(disputeID, 1); // Fund the losing choice. The ruling will be overridden here
+        vm.prank(crowdfunder2);
+        disputeKit.fundAppeal{value: 0.41 ether}(disputeID, 2); // Underpay a bit to not create an appeal and withdraw the funded sum fully
+
+        vm.warp(block.timestamp + timesPerPeriod[3]);
+        core.passPeriod(disputeID); // Execution
+
+        vm.expectRevert(DisputeKitClassicBase.DisputeNotResolved.selector);
+        disputeKit.withdrawFeesAndRewards(disputeID, payable(staker1), 0, 1);
+
+        core.executeRuling(disputeID);
+
+        vm.prank(owner);
+        core.pause();
+        vm.expectRevert(DisputeKitClassicBase.CoreIsPaused.selector);
+        disputeKit.withdrawFeesAndRewards(disputeID, payable(staker1), 0, 1);
+        vm.prank(owner);
+        core.unpause();
+
+        assertEq(crowdfunder1.balance, 9.37 ether, "Wrong balance of the crowdfunder1");
+        assertEq(crowdfunder2.balance, 9.59 ether, "Wrong balance of the crowdfunder2");
+        assertEq(address(disputeKit).balance, 1.04 ether, "Wrong balance of the DK");
+
+        vm.expectEmit(true, true, true, true);
+        emit DisputeKitClassicBase.Withdrawal(disputeID, 0, 1, crowdfunder1, 0.63 ether);
+        disputeKit.withdrawFeesAndRewards(disputeID, payable(crowdfunder1), 0, 1);
+
+        vm.expectEmit(true, true, true, true);
+        emit DisputeKitClassicBase.Withdrawal(disputeID, 0, 2, crowdfunder2, 0.41 ether);
+        disputeKit.withdrawFeesAndRewards(disputeID, payable(crowdfunder2), 0, 2);
+
+        assertEq(crowdfunder1.balance, 10 ether, "Wrong balance of the crowdfunder1");
+        assertEq(crowdfunder2.balance, 10 ether, "Wrong balance of the crowdfunder2");
+        assertEq(address(disputeKit).balance, 0, "Wrong balance of the DK");
+    }
+}
diff --git a/contracts/test/foundry/KlerosCore_Governance.t.sol b/contracts/test/foundry/KlerosCore_Governance.t.sol
new file mode 100644
index 000000000..f34d64e79
--- /dev/null
+++ b/contracts/test/foundry/KlerosCore_Governance.t.sol
@@ -0,0 +1,472 @@
+// SPDX-License-Identifier: MIT
+pragma solidity ^0.8.24;
+
+import {KlerosCore_TestBase} from "./KlerosCore_TestBase.sol";
+import {KlerosCoreBase} from "../../src/arbitration/KlerosCoreBase.sol";
+import {IArbitratorV2} from "../../src/arbitration/KlerosCoreBase.sol";
+import {DisputeKitSybilResistant} from "../../src/arbitration/dispute-kits/DisputeKitSybilResistant.sol";
+import {SortitionModuleMock} from "../../src/test/SortitionModuleMock.sol";
+import {PNK} from "../../src/token/PNK.sol";
+import "../../src/libraries/Constants.sol";
+
+/// @title KlerosCore_GovernanceTest
+/// @dev Tests for KlerosCore governance functions (owner/guardian operations)
+contract KlerosCore_GovernanceTest is KlerosCore_TestBase {
+    function test_pause() public {
+        vm.expectRevert(KlerosCoreBase.GuardianOrOwnerOnly.selector);
+        vm.prank(other);
+        core.pause();
+        // Note that we must explicitly switch to the owner/guardian address to make the call, otherwise Foundry treats UUPS proxy as msg.sender.
+        vm.prank(guardian);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.Paused();
+        core.pause();
+        assertEq(core.paused(), true, "Wrong paused value");
+        // Switch between owner and guardian to test both. WhenNotPausedOnly modifier is triggered after owner's check.
+        vm.prank(owner);
+        vm.expectRevert(KlerosCoreBase.WhenNotPausedOnly.selector);
+        core.pause();
+    }
+
+    function test_unpause() public {
+        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
+        vm.prank(other);
+        core.unpause();
+
+        vm.expectRevert(KlerosCoreBase.WhenPausedOnly.selector);
+        vm.prank(owner);
+        core.unpause();
+
+        vm.prank(owner);
+        core.pause();
+        vm.prank(owner);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.Unpaused();
+        core.unpause();
+        assertEq(core.paused(), false, "Wrong paused value");
+    }
+
+    function test_executeOwnerProposal() public {
+        bytes memory data = abi.encodeWithSignature("changeOwner(address)", other);
+        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
+        vm.prank(other);
+        core.executeOwnerProposal(address(core), 0, data);
+
+        vm.expectRevert(KlerosCoreBase.UnsuccessfulCall.selector);
+        vm.prank(owner);
+        core.executeOwnerProposal(address(core), 0, data); // It'll fail because the core is not its own owner
+
+        vm.prank(owner);
+        core.changeOwner(payable(address(core)));
+        vm.prank(address(core));
+        core.executeOwnerProposal(address(core), 0, data);
+        assertEq(core.owner(), other, "Wrong owner");
+    }
+
+    function test_changeOwner() public {
+        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
+        vm.prank(other);
+        core.changeOwner(payable(other));
+        vm.prank(owner);
+        core.changeOwner(payable(other));
+        assertEq(core.owner(), other, "Wrong owner");
+    }
+
+    function test_changeGuardian() public {
+        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
+        vm.prank(other);
+        core.changeGuardian(other);
+        vm.prank(owner);
+        core.changeGuardian(other);
+        assertEq(core.guardian(), other, "Wrong guardian");
+    }
+
+    function test_changePinakion() public {
+        PNK fakePNK = new PNK();
+        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
+        vm.prank(other);
+        core.changePinakion(fakePNK);
+        vm.prank(owner);
+        core.changePinakion(fakePNK);
+        assertEq(address(core.pinakion()), address(fakePNK), "Wrong PNK");
+    }
+
+    function test_changeJurorProsecutionModule() public {
+        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
+        vm.prank(other);
+        core.changeJurorProsecutionModule(other);
+        vm.prank(owner);
+        core.changeJurorProsecutionModule(other);
+        assertEq(core.jurorProsecutionModule(), other, "Wrong jurorProsecutionModule");
+    }
+
+    function test_changeSortitionModule() public {
+        SortitionModuleMock fakeSM = new SortitionModuleMock();
+        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
+        vm.prank(other);
+        core.changeSortitionModule(fakeSM);
+        vm.prank(owner);
+        core.changeSortitionModule(fakeSM);
+        assertEq(address(core.sortitionModule()), address(fakeSM), "Wrong sortitionModule");
+    }
+
+    function test_addNewDisputeKit() public {
+        DisputeKitSybilResistant newDK = new DisputeKitSybilResistant();
+        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
+        vm.prank(other);
+        core.addNewDisputeKit(newDK);
+        vm.prank(owner);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.DisputeKitCreated(2, newDK);
+        core.addNewDisputeKit(newDK);
+        assertEq(address(core.disputeKits(2)), address(newDK), "Wrong address of new DK");
+        assertEq(core.getDisputeKitsLength(), 3, "Wrong DK array length");
+    }
+
+    function test_createCourt() public {
+        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
+        vm.prank(other);
+        uint256[] memory supportedDK = new uint256[](2);
+        supportedDK[0] = DISPUTE_KIT_CLASSIC;
+        supportedDK[1] = 2; // New DK is added below.
+        core.createCourt(
+            GENERAL_COURT,
+            true, // Hidden votes
+            2000, // min stake
+            10000, // alpha
+            0.03 ether, // fee for juror
+            50, // jurors for jump
+            [uint256(10), uint256(20), uint256(30), uint256(40)], // Times per period
+            abi.encode(uint256(4)), // Sortition extra data
+            supportedDK
+        );
+
+        vm.expectRevert(KlerosCoreBase.MinStakeLowerThanParentCourt.selector);
+        vm.prank(owner);
+        core.createCourt(
+            GENERAL_COURT,
+            true, // Hidden votes
+            800, // min stake
+            10000, // alpha
+            0.03 ether, // fee for juror
+            50, // jurors for jump
+            [uint256(10), uint256(20), uint256(30), uint256(40)], // Times per period
+            abi.encode(uint256(4)), // Sortition extra data
+            supportedDK
+        );
+
+        vm.expectRevert(KlerosCoreBase.UnsupportedDisputeKit.selector);
+        vm.prank(owner);
+        uint256[] memory emptySupportedDK = new uint256[](0);
+        core.createCourt(
+            GENERAL_COURT,
+            true, // Hidden votes
+            2000, // min stake
+            10000, // alpha
+            0.03 ether, // fee for juror
+            50, // jurors for jump
+            [uint256(10), uint256(20), uint256(30), uint256(40)], // Times per period
+            abi.encode(uint256(4)), // Sortition extra data
+            emptySupportedDK
+        );
+
+        vm.expectRevert(KlerosCoreBase.InvalidForkingCourtAsParent.selector);
+        vm.prank(owner);
+        core.createCourt(
+            FORKING_COURT,
+            true, // Hidden votes
+            2000, // min stake
+            10000, // alpha
+            0.03 ether, // fee for juror
+            50, // jurors for jump
+            [uint256(10), uint256(20), uint256(30), uint256(40)], // Times per period
+            abi.encode(uint256(4)), // Sortition extra data
+            supportedDK
+        );
+
+        uint256[] memory badSupportedDK = new uint256[](2);
+        badSupportedDK[0] = NULL_DISPUTE_KIT; // Include NULL_DK to check that it reverts
+        badSupportedDK[1] = DISPUTE_KIT_CLASSIC;
+        vm.expectRevert(KlerosCoreBase.WrongDisputeKitIndex.selector);
+        vm.prank(owner);
+        core.createCourt(
+            GENERAL_COURT,
+            true, // Hidden votes
+            2000, // min stake
+            10000, // alpha
+            0.03 ether, // fee for juror
+            50, // jurors for jump
+            [uint256(10), uint256(20), uint256(30), uint256(40)], // Times per period
+            abi.encode(uint256(4)), // Sortition extra data
+            badSupportedDK
+        );
+
+        badSupportedDK[0] = DISPUTE_KIT_CLASSIC;
+        badSupportedDK[1] = 2; // Check out of bounds index
+        vm.expectRevert(KlerosCoreBase.WrongDisputeKitIndex.selector);
+        vm.prank(owner);
+        core.createCourt(
+            GENERAL_COURT,
+            true, // Hidden votes
+            2000, // min stake
+            10000, // alpha
+            0.03 ether, // fee for juror
+            50, // jurors for jump
+            [uint256(10), uint256(20), uint256(30), uint256(40)], // Times per period
+            abi.encode(uint256(4)), // Sortition extra data
+            badSupportedDK
+        );
+
+        // Add new DK to check the requirement for classic DK
+        DisputeKitSybilResistant newDK = new DisputeKitSybilResistant();
+        vm.prank(owner);
+        core.addNewDisputeKit(newDK);
+        badSupportedDK = new uint256[](1);
+        badSupportedDK[0] = 2; // Include only sybil resistant dk
+        vm.expectRevert(KlerosCoreBase.MustSupportDisputeKitClassic.selector);
+        vm.prank(owner);
+        core.createCourt(
+            GENERAL_COURT,
+            true, // Hidden votes
+            2000, // min stake
+            10000, // alpha
+            0.03 ether, // fee for juror
+            50, // jurors for jump
+            [uint256(10), uint256(20), uint256(30), uint256(40)], // Times per period
+            abi.encode(uint256(4)), // Sortition extra data
+            badSupportedDK
+        );
+
+        vm.prank(owner);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.DisputeKitEnabled(2, DISPUTE_KIT_CLASSIC, true);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.DisputeKitEnabled(2, 2, true);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.CourtCreated(
+            2,
+            GENERAL_COURT,
+            true,
+            2000,
+            20000,
+            0.04 ether,
+            50,
+            [uint256(10), uint256(20), uint256(30), uint256(40)], // Explicitly convert otherwise it throws
+            supportedDK
+        );
+        core.createCourt(
+            GENERAL_COURT,
+            true, // Hidden votes
+            2000, // min stake
+            20000, // alpha
+            0.04 ether, // fee for juror
+            50, // jurors for jump
+            [uint256(10), uint256(20), uint256(30), uint256(40)], // Times per period
+            abi.encode(uint256(4)), // Sortition extra data
+            supportedDK
+        );
+
+        _assertCourtParameters(2, GENERAL_COURT, true, 2000, 20000, 0.04 ether, 50, false);
+
+        uint256[] memory children = core.getCourtChildren(2);
+        assertEq(children.length, 0, "No children");
+        _assertTimesPerPeriod(2, [uint256(10), uint256(20), uint256(30), uint256(40)]);
+
+        children = core.getCourtChildren(GENERAL_COURT); // Check that parent updated children
+        assertEq(children.length, 1, "Wrong children count");
+        assertEq(children[0], 2, "Wrong child id");
+
+        (uint256 K, uint256 nodeLength) = sortitionModule.getSortitionProperties(bytes32(uint256(2)));
+        assertEq(K, 4, "Wrong tree K of the new court");
+        assertEq(nodeLength, 1, "Wrong node length for created tree of the new court");
+    }
+
+    function test_changeCourtParameters() public {
+        // Create a 2nd court to check the minStake requirements
+        vm.prank(owner);
+        uint96 newCourtID = 2;
+        uint256[] memory supportedDK = new uint256[](1);
+        supportedDK[0] = DISPUTE_KIT_CLASSIC;
+        core.createCourt(
+            GENERAL_COURT,
+            true, // Hidden votes
+            2000, // min stake
+            20000, // alpha
+            0.04 ether, // fee for juror
+            50, // jurors for jump
+            [uint256(10), uint256(20), uint256(30), uint256(40)], // Times per period
+            abi.encode(uint256(4)), // Sortition extra data
+            supportedDK
+        );
+
+        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
+        vm.prank(other);
+        core.changeCourtParameters(
+            GENERAL_COURT,
+            true, // Hidden votes
+            2000, // min stake
+            10000, // alpha
+            0.03 ether, // fee for juror
+            50, // jurors for jump
+            [uint256(10), uint256(20), uint256(30), uint256(40)] // Times per period
+        );
+        vm.expectRevert(KlerosCoreBase.MinStakeLowerThanParentCourt.selector);
+        vm.prank(owner);
+        // Min stake of a parent became higher than of a child
+        core.changeCourtParameters(
+            GENERAL_COURT,
+            true, // Hidden votes
+            3000, // min stake
+            10000, // alpha
+            0.03 ether, // fee for juror
+            50, // jurors for jump
+            [uint256(10), uint256(20), uint256(30), uint256(40)] // Times per period
+        );
+        // Min stake of a child became lower than of a parent
+        vm.expectRevert(KlerosCoreBase.MinStakeLowerThanParentCourt.selector);
+        vm.prank(owner);
+        core.changeCourtParameters(
+            newCourtID,
+            true, // Hidden votes
+            800, // min stake
+            10000, // alpha
+            0.03 ether, // fee for juror
+            50, // jurors for jump
+            [uint256(10), uint256(20), uint256(30), uint256(40)] // Times per period
+        );
+
+        vm.prank(owner);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.CourtModified(
+            GENERAL_COURT,
+            true,
+            2000,
+            20000,
+            0.04 ether,
+            50,
+            [uint256(10), uint256(20), uint256(30), uint256(40)] // Explicitly convert otherwise it throws
+        );
+        core.changeCourtParameters(
+            GENERAL_COURT,
+            true, // Hidden votes
+            2000, // min stake
+            20000, // alpha
+            0.04 ether, // fee for juror
+            50, // jurors for jump
+            [uint256(10), uint256(20), uint256(30), uint256(40)] // Times per period
+        );
+
+        _assertCourtParameters(GENERAL_COURT, FORKING_COURT, true, 2000, 20000, 0.04 ether, 50, false);
+        _assertTimesPerPeriod(GENERAL_COURT, [uint256(10), uint256(20), uint256(30), uint256(40)]);
+    }
+
+    function test_enableDisputeKits() public {
+        DisputeKitSybilResistant newDK = new DisputeKitSybilResistant();
+        uint256 newDkID = 2;
+        vm.prank(owner);
+        core.addNewDisputeKit(newDK);
+
+        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
+        vm.prank(other);
+        uint256[] memory supportedDK = new uint256[](1);
+        supportedDK[0] = newDkID;
+        core.enableDisputeKits(GENERAL_COURT, supportedDK, true);
+
+        vm.expectRevert(KlerosCoreBase.WrongDisputeKitIndex.selector);
+        vm.prank(owner);
+        supportedDK[0] = NULL_DISPUTE_KIT;
+        core.enableDisputeKits(GENERAL_COURT, supportedDK, true);
+
+        vm.expectRevert(KlerosCoreBase.WrongDisputeKitIndex.selector);
+        vm.prank(owner);
+        supportedDK[0] = 3; // Out of bounds
+        core.enableDisputeKits(GENERAL_COURT, supportedDK, true);
+
+        vm.expectRevert(KlerosCoreBase.CannotDisableClassicDK.selector);
+        vm.prank(owner);
+        supportedDK[0] = DISPUTE_KIT_CLASSIC;
+        core.enableDisputeKits(GENERAL_COURT, supportedDK, false);
+
+        vm.prank(owner);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.DisputeKitEnabled(GENERAL_COURT, newDkID, true);
+        supportedDK[0] = newDkID;
+        core.enableDisputeKits(GENERAL_COURT, supportedDK, true);
+        assertEq(core.isSupported(GENERAL_COURT, newDkID), true, "New DK should be supported by General court");
+
+        vm.prank(owner);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.DisputeKitEnabled(GENERAL_COURT, newDkID, false);
+        core.enableDisputeKits(GENERAL_COURT, supportedDK, false);
+        assertEq(core.isSupported(GENERAL_COURT, newDkID), false, "New DK should be disabled in General court");
+    }
+
+    function test_changeAcceptedFeeTokens() public {
+        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
+        vm.prank(other);
+        core.changeAcceptedFeeTokens(feeToken, true);
+
+        (bool accepted, , ) = core.currencyRates(feeToken);
+        assertEq(accepted, false, "Token should not be accepted yet");
+
+        vm.prank(owner);
+        vm.expectEmit(true, true, true, true);
+        emit IArbitratorV2.AcceptedFeeToken(feeToken, true);
+        core.changeAcceptedFeeTokens(feeToken, true);
+        (accepted, , ) = core.currencyRates(feeToken);
+        assertEq(accepted, true, "Token should be accepted");
+    }
+
+    function test_changeCurrencyRates() public {
+        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
+        vm.prank(other);
+        core.changeCurrencyRates(feeToken, 100, 200);
+
+        (, uint256 rateInEth, uint256 rateDecimals) = core.currencyRates(feeToken);
+        assertEq(rateInEth, 0, "rateInEth should be 0");
+        assertEq(rateDecimals, 0, "rateDecimals should be 0");
+
+        vm.prank(owner);
+        vm.expectEmit(true, true, true, true);
+        emit IArbitratorV2.NewCurrencyRate(feeToken, 100, 200);
+        core.changeCurrencyRates(feeToken, 100, 200);
+
+        (, rateInEth, rateDecimals) = core.currencyRates(feeToken);
+        assertEq(rateInEth, 100, "rateInEth is incorrect");
+        assertEq(rateDecimals, 200, "rateDecimals is incorrect");
+    }
+
+    function test_extraDataToCourtIDMinJurorsDisputeKit() public {
+        // Standard values
+        bytes memory extraData = abi.encodePacked(uint256(GENERAL_COURT), DEFAULT_NB_OF_JURORS, DISPUTE_KIT_CLASSIC);
+
+        (uint96 courtID, uint256 minJurors, uint256 disputeKitID) = core.extraDataToCourtIDMinJurorsDisputeKit(
+            extraData
+        );
+        assertEq(courtID, GENERAL_COURT, "Wrong courtID");
+        assertEq(minJurors, DEFAULT_NB_OF_JURORS, "Wrong minJurors");
+        assertEq(disputeKitID, DISPUTE_KIT_CLASSIC, "Wrong disputeKitID");
+
+        // Botched extraData. Values should fall into standard
+        extraData = "0xfa";
+
+        (courtID, minJurors, disputeKitID) = core.extraDataToCourtIDMinJurorsDisputeKit(extraData);
+        assertEq(courtID, GENERAL_COURT, "Wrong courtID");
+        assertEq(minJurors, DEFAULT_NB_OF_JURORS, "Wrong minJurors");
+        assertEq(disputeKitID, DISPUTE_KIT_CLASSIC, "Wrong disputeKitID");
+
+        // Custom values.
+        vm.startPrank(owner);
+        core.addNewDisputeKit(disputeKit);
+        core.addNewDisputeKit(disputeKit);
+        core.addNewDisputeKit(disputeKit);
+        core.addNewDisputeKit(disputeKit);
+        core.addNewDisputeKit(disputeKit);
+        extraData = abi.encodePacked(uint256(50), uint256(41), uint256(6));
+
+        (courtID, minJurors, disputeKitID) = core.extraDataToCourtIDMinJurorsDisputeKit(extraData);
+        assertEq(courtID, GENERAL_COURT, "Wrong courtID"); // Value in extra data is out of scope so fall back
+        assertEq(minJurors, 41, "Wrong minJurors");
+        assertEq(disputeKitID, 6, "Wrong disputeKitID");
+    }
+}
diff --git a/contracts/test/foundry/KlerosCore_Initialization.t.sol b/contracts/test/foundry/KlerosCore_Initialization.t.sol
new file mode 100644
index 000000000..76711351e
--- /dev/null
+++ b/contracts/test/foundry/KlerosCore_Initialization.t.sol
@@ -0,0 +1,170 @@
+// SPDX-License-Identifier: MIT
+pragma solidity ^0.8.24;
+
+import {KlerosCore_TestBase} from "./KlerosCore_TestBase.sol";
+import {KlerosCoreBase} from "../../src/arbitration/KlerosCoreBase.sol";
+import {KlerosCoreMock} from "../../src/test/KlerosCoreMock.sol";
+import {DisputeKitClassic} from "../../src/arbitration/dispute-kits/DisputeKitClassic.sol";
+import {SortitionModuleMock} from "../../src/test/SortitionModuleMock.sol";
+import {UUPSProxy} from "../../src/proxy/UUPSProxy.sol";
+import {BlockHashRNG} from "../../src/rng/BlockHashRNG.sol";
+import {ISortitionModule} from "../../src/arbitration/interfaces/ISortitionModule.sol";
+import {PNK} from "../../src/token/PNK.sol";
+import "../../src/libraries/Constants.sol";
+
+/// @title KlerosCore_InitializationTest
+/// @dev Tests for KlerosCore initialization and basic configuration
+contract KlerosCore_InitializationTest is KlerosCore_TestBase {
+    function test_initialize() public {
+        assertEq(core.owner(), msg.sender, "Wrong owner");
+        assertEq(core.guardian(), guardian, "Wrong guardian");
+        assertEq(address(core.pinakion()), address(pinakion), "Wrong pinakion address");
+        assertEq(core.jurorProsecutionModule(), jurorProsecutionModule, "Wrong jurorProsecutionModule address");
+        assertEq(address(core.sortitionModule()), address(sortitionModule), "Wrong sortitionModule address");
+        assertEq(core.getDisputeKitsLength(), 2, "Wrong DK array length");
+
+        _assertCourtParameters(FORKING_COURT, FORKING_COURT, false, 0, 0, 0, 0, false);
+        _assertCourtParameters(GENERAL_COURT, FORKING_COURT, false, 1000, 10000, 0.03 ether, 511, false);
+
+        uint256[] memory children = core.getCourtChildren(GENERAL_COURT);
+        assertEq(children.length, 0, "No children");
+        _assertTimesPerPeriod(GENERAL_COURT, timesPerPeriod);
+
+        assertEq(address(core.disputeKits(NULL_DISPUTE_KIT)), address(0), "Wrong address NULL_DISPUTE_KIT");
+        assertEq(
+            address(core.disputeKits(DISPUTE_KIT_CLASSIC)),
+            address(disputeKit),
+            "Wrong address DISPUTE_KIT_CLASSIC"
+        );
+        assertEq(core.isSupported(FORKING_COURT, NULL_DISPUTE_KIT), false, "Forking court null dk should be false");
+        assertEq(
+            core.isSupported(FORKING_COURT, DISPUTE_KIT_CLASSIC),
+            false,
+            "Forking court classic dk should be false"
+        );
+        assertEq(core.isSupported(GENERAL_COURT, NULL_DISPUTE_KIT), false, "General court null dk should be false");
+        assertEq(core.isSupported(GENERAL_COURT, DISPUTE_KIT_CLASSIC), true, "General court classic dk should be true");
+        assertEq(core.paused(), false, "Wrong paused value");
+
+        assertEq(pinakion.name(), "Pinakion", "Wrong token name");
+        assertEq(pinakion.symbol(), "PNK", "Wrong token symbol");
+        assertEq(pinakion.totalSupply(), 1000000 ether, "Wrong total supply");
+        assertEq(pinakion.balanceOf(msg.sender), 999998 ether, "Wrong token balance of owner");
+        assertEq(pinakion.balanceOf(staker1), 1 ether, "Wrong token balance of staker1");
+        assertEq(pinakion.allowance(staker1, address(core)), 1 ether, "Wrong allowance for staker1");
+        assertEq(pinakion.balanceOf(staker2), 1 ether, "Wrong token balance of staker2");
+        assertEq(pinakion.allowance(staker2, address(core)), 1 ether, "Wrong allowance for staker2");
+
+        assertEq(disputeKit.owner(), msg.sender, "Wrong DK owner");
+        assertEq(address(disputeKit.core()), address(core), "Wrong core in DK");
+
+        assertEq(sortitionModule.owner(), msg.sender, "Wrong SM owner");
+        assertEq(address(sortitionModule.core()), address(core), "Wrong core in SM");
+        assertEq(uint256(sortitionModule.phase()), uint256(ISortitionModule.Phase.staking), "Phase should be 0");
+        assertEq(sortitionModule.minStakingTime(), 18, "Wrong minStakingTime");
+        assertEq(sortitionModule.maxDrawingTime(), 24, "Wrong maxDrawingTime");
+        assertEq(sortitionModule.lastPhaseChange(), block.timestamp, "Wrong lastPhaseChange");
+        assertEq(sortitionModule.disputesWithoutJurors(), 0, "disputesWithoutJurors should be 0");
+        assertEq(address(sortitionModule.rng()), address(rng), "Wrong RNG address");
+        assertEq(sortitionModule.randomNumber(), 0, "randomNumber should be 0");
+        assertEq(sortitionModule.delayedStakeWriteIndex(), 0, "delayedStakeWriteIndex should be 0");
+        assertEq(sortitionModule.delayedStakeReadIndex(), 1, "Wrong delayedStakeReadIndex");
+
+        (uint256 K, uint256 nodeLength) = sortitionModule.getSortitionProperties(bytes32(uint256(FORKING_COURT)));
+        assertEq(K, 5, "Wrong tree K FORKING_COURT");
+        assertEq(nodeLength, 1, "Wrong node length for created tree FORKING_COURT");
+
+        (K, nodeLength) = sortitionModule.getSortitionProperties(bytes32(uint256(GENERAL_COURT)));
+        assertEq(K, 5, "Wrong tree K GENERAL_COURT");
+        assertEq(nodeLength, 1, "Wrong node length for created tree GENERAL_COURT");
+    }
+
+    function test_initialize_events() public {
+        KlerosCoreMock coreLogic = new KlerosCoreMock();
+        SortitionModuleMock smLogic = new SortitionModuleMock();
+        DisputeKitClassic dkLogic = new DisputeKitClassic();
+        PNK newPinakion = new PNK();
+
+        address newOwner = msg.sender;
+        address newGuardian = vm.addr(1);
+        address newStaker1 = vm.addr(2);
+        address newOther = vm.addr(9);
+        address newJurorProsecutionModule = vm.addr(8);
+        uint256 newMinStake = 1000;
+        uint256 newAlpha = 10000;
+        uint256 newFeeForJuror = 0.03 ether;
+        uint256 newJurorsForCourtJump = 511;
+        uint256[4] memory newTimesPerPeriod = [uint256(60), uint256(120), uint256(180), uint256(240)];
+
+        newPinakion.transfer(msg.sender, totalSupply - 1 ether);
+        newPinakion.transfer(newStaker1, 1 ether);
+
+        bytes memory newSortitionExtraData = abi.encode(uint256(5));
+        uint256 newMinStakingTime = 18;
+        uint256 newMaxDrawingTime = 24;
+        bool newHiddenVotes = false;
+
+        uint256 newRngLookahead = 20;
+        BlockHashRNG newRng = new BlockHashRNG(msg.sender, address(sortitionModule), newRngLookahead);
+
+        UUPSProxy proxyCore = new UUPSProxy(address(coreLogic), "");
+
+        bytes memory initDataDk = abi.encodeWithSignature(
+            "initialize(address,address,address)",
+            newOwner,
+            address(proxyCore),
+            address(wNative)
+        );
+
+        UUPSProxy proxyDk = new UUPSProxy(address(dkLogic), initDataDk);
+        DisputeKitClassic newDisputeKit = DisputeKitClassic(address(proxyDk));
+
+        bytes memory initDataSm = abi.encodeWithSignature(
+            "initialize(address,address,uint256,uint256,address)",
+            newOwner,
+            address(proxyCore),
+            newMinStakingTime,
+            newMaxDrawingTime,
+            newRng
+        );
+
+        UUPSProxy proxySm = new UUPSProxy(address(smLogic), initDataSm);
+        SortitionModuleMock newSortitionModule = SortitionModuleMock(address(proxySm));
+        vm.prank(newOwner);
+        newRng.changeConsumer(address(newSortitionModule));
+
+        KlerosCoreMock newCore = KlerosCoreMock(address(proxyCore));
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.DisputeKitCreated(DISPUTE_KIT_CLASSIC, newDisputeKit);
+        vm.expectEmit(true, true, true, true);
+
+        uint256[] memory supportedDK = new uint256[](1);
+        supportedDK[0] = DISPUTE_KIT_CLASSIC;
+        emit KlerosCoreBase.CourtCreated(
+            GENERAL_COURT,
+            FORKING_COURT,
+            false,
+            1000,
+            10000,
+            0.03 ether,
+            511,
+            [uint256(60), uint256(120), uint256(180), uint256(240)], // Explicitly convert otherwise it throws
+            supportedDK
+        );
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.DisputeKitEnabled(GENERAL_COURT, DISPUTE_KIT_CLASSIC, true);
+        newCore.initialize(
+            newOwner,
+            newGuardian,
+            newPinakion,
+            newJurorProsecutionModule,
+            newDisputeKit,
+            newHiddenVotes,
+            [newMinStake, newAlpha, newFeeForJuror, newJurorsForCourtJump],
+            newTimesPerPeriod,
+            newSortitionExtraData,
+            newSortitionModule,
+            address(wNative)
+        );
+    }
+}
diff --git a/contracts/test/foundry/KlerosCore_RNG.t.sol b/contracts/test/foundry/KlerosCore_RNG.t.sol
new file mode 100644
index 000000000..da3df03ed
--- /dev/null
+++ b/contracts/test/foundry/KlerosCore_RNG.t.sol
@@ -0,0 +1,121 @@
+// SPDX-License-Identifier: MIT
+pragma solidity ^0.8.24;
+
+import {KlerosCore_TestBase} from "./KlerosCore_TestBase.sol";
+import {SortitionModuleBase} from "../../src/arbitration/SortitionModuleBase.sol";
+import {RNGWithFallback, IRNG} from "../../src/rng/RNGWithFallback.sol";
+import {RNGMock} from "../../src/test/RNGMock.sol";
+import "../../src/libraries/Constants.sol";
+
+/// @title KlerosCore_RNGTest
+/// @dev Tests for KlerosCore random number generation and fallback mechanisms
+contract KlerosCore_RNGTest is KlerosCore_TestBase {
+    function test_RNGFallback() public {
+        RNGWithFallback rngFallback;
+        uint256 fallbackTimeout = 100;
+        RNGMock rngMock = new RNGMock();
+        rngFallback = new RNGWithFallback(msg.sender, address(sortitionModule), fallbackTimeout, rngMock);
+        assertEq(rngFallback.owner(), msg.sender, "Wrong owner");
+        assertEq(rngFallback.consumer(), address(sortitionModule), "Wrong sortition module address");
+        assertEq(address(rngFallback.rng()), address(rngMock), "Wrong RNG in fallback contract");
+        assertEq(rngFallback.fallbackTimeoutSeconds(), fallbackTimeout, "Wrong fallback timeout");
+        assertEq(rngFallback.requestTimestamp(), 0, "Request timestamp should be 0");
+
+        vm.prank(owner);
+        sortitionModule.changeRandomNumberGenerator(rngFallback);
+        assertEq(address(sortitionModule.rng()), address(rngFallback), "Wrong RNG address");
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 20000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+
+        sortitionModule.passPhase(); // Generating
+        assertEq(rngFallback.requestTimestamp(), block.timestamp, "Wrong request timestamp");
+
+        vm.expectRevert(SortitionModuleBase.RandomNumberNotReady.selector);
+        sortitionModule.passPhase();
+
+        vm.warp(block.timestamp + fallbackTimeout + 1);
+
+        // Pass several blocks too to see that correct block.number is still picked up.
+        vm.roll(block.number + 5);
+
+        vm.expectEmit(true, true, true, true);
+        emit RNGWithFallback.RNGFallback();
+        sortitionModule.passPhase(); // Drawing phase
+
+        assertEq(sortitionModule.randomNumber(), uint256(blockhash(block.number - 1)), "Wrong random number");
+    }
+
+    function test_RNGFallback_happyPath() public {
+        RNGWithFallback rngFallback;
+        uint256 fallbackTimeout = 100;
+        RNGMock rngMock = new RNGMock();
+        rngFallback = new RNGWithFallback(msg.sender, address(sortitionModule), fallbackTimeout, rngMock);
+
+        vm.prank(owner);
+        sortitionModule.changeRandomNumberGenerator(rngFallback);
+        assertEq(address(sortitionModule.rng()), address(rngFallback), "Wrong RNG address");
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 20000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+
+        assertEq(rngFallback.requestTimestamp(), 0, "Request timestamp should be 0");
+
+        sortitionModule.passPhase(); // Generating
+        assertEq(rngFallback.requestTimestamp(), block.timestamp, "Wrong request timestamp");
+
+        rngMock.setRN(123);
+
+        sortitionModule.passPhase(); // Drawing phase
+        assertEq(sortitionModule.randomNumber(), 123, "Wrong random number");
+    }
+
+    function test_RNGFallback_sanityChecks() public {
+        RNGWithFallback rngFallback;
+        uint256 fallbackTimeout = 100;
+        RNGMock rngMock = new RNGMock();
+        rngFallback = new RNGWithFallback(msg.sender, address(sortitionModule), fallbackTimeout, rngMock);
+
+        vm.expectRevert(IRNG.ConsumerOnly.selector);
+        vm.prank(owner);
+        rngFallback.requestRandomness();
+
+        vm.expectRevert(IRNG.ConsumerOnly.selector);
+        vm.prank(owner);
+        rngFallback.receiveRandomness();
+
+        vm.expectRevert(IRNG.OwnerOnly.selector);
+        vm.prank(other);
+        rngFallback.changeOwner(other);
+        vm.prank(owner);
+        rngFallback.changeOwner(other);
+        assertEq(rngFallback.owner(), other, "Wrong owner");
+
+        // Change owner back for convenience
+        vm.prank(other);
+        rngFallback.changeOwner(owner);
+
+        vm.expectRevert(IRNG.OwnerOnly.selector);
+        vm.prank(other);
+        rngFallback.changeConsumer(other);
+        vm.prank(owner);
+        rngFallback.changeConsumer(other);
+        assertEq(rngFallback.consumer(), other, "Wrong consumer");
+
+        vm.expectRevert(IRNG.OwnerOnly.selector);
+        vm.prank(other);
+        rngFallback.changeFallbackTimeout(5);
+
+        vm.prank(owner);
+        vm.expectEmit(true, true, true, true);
+        emit RNGWithFallback.FallbackTimeoutChanged(5);
+        rngFallback.changeFallbackTimeout(5);
+        assertEq(rngFallback.fallbackTimeoutSeconds(), 5, "Wrong fallback timeout");
+    }
+}
diff --git a/contracts/test/foundry/KlerosCore_Staking.t.sol b/contracts/test/foundry/KlerosCore_Staking.t.sol
new file mode 100644
index 000000000..a315debcf
--- /dev/null
+++ b/contracts/test/foundry/KlerosCore_Staking.t.sol
@@ -0,0 +1,450 @@
+// SPDX-License-Identifier: MIT
+pragma solidity ^0.8.24;
+
+import {KlerosCore_TestBase} from "./KlerosCore_TestBase.sol";
+import {KlerosCoreBase} from "../../src/arbitration/KlerosCoreBase.sol";
+import {SortitionModuleBase} from "../../src/arbitration/SortitionModuleBase.sol";
+import {ISortitionModule} from "../../src/arbitration/interfaces/ISortitionModule.sol";
+import {IKlerosCore, KlerosCoreSnapshotProxy} from "../../src/arbitration/view/KlerosCoreSnapshotProxy.sol";
+import "../../src/libraries/Constants.sol";
+
+/// @title KlerosCore_StakingTest
+/// @dev Tests for KlerosCore staking mechanics and stake management
+contract KlerosCore_StakingTest is KlerosCore_TestBase {
+    function test_setStake_increase() public {
+        vm.prank(owner);
+        core.pause();
+        vm.expectRevert(KlerosCoreBase.WhenNotPausedOnly.selector);
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 1000);
+        vm.prank(owner);
+        core.unpause();
+
+        vm.expectRevert(KlerosCoreBase.StakingNotPossibleInThisCourt.selector);
+        vm.prank(staker1);
+        core.setStake(FORKING_COURT, 1000);
+
+        uint96 badCourtID = 2;
+        vm.expectRevert(KlerosCoreBase.StakingNotPossibleInThisCourt.selector);
+        vm.prank(staker1);
+        core.setStake(badCourtID, 1000);
+
+        vm.expectRevert(KlerosCoreBase.StakingLessThanCourtMinStake.selector);
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 800);
+
+        vm.expectRevert(KlerosCoreBase.StakingZeroWhenNoStake.selector);
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 0);
+
+        vm.prank(staker1);
+        vm.expectEmit(true, true, true, true);
+        emit SortitionModuleBase.StakeSet(staker1, GENERAL_COURT, 1001, 1001);
+        core.setStake(GENERAL_COURT, 1001);
+
+        (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts) = sortitionModule
+            .getJurorBalance(staker1, GENERAL_COURT);
+        assertEq(totalStaked, 1001, "Wrong amount total staked");
+        assertEq(totalLocked, 0, "Wrong amount locked");
+        assertEq(stakedInCourt, 1001, "Wrong amount staked in court");
+        assertEq(nbCourts, 1, "Wrong number of courts");
+
+        uint96[] memory courts = sortitionModule.getJurorCourtIDs(staker1);
+        assertEq(courts.length, 1, "Wrong courts count");
+        assertEq(courts[0], GENERAL_COURT, "Wrong court id");
+        assertEq(sortitionModule.isJurorStaked(staker1), true, "Juror should be staked");
+
+        assertEq(pinakion.balanceOf(address(core)), 1001, "Wrong token balance of the core");
+        assertEq(pinakion.balanceOf(staker1), 999999999999998999, "Wrong token balance of staker1"); // 1 eth - 1001 wei
+        assertEq(pinakion.allowance(staker1, address(core)), 999999999999998999, "Wrong allowance for staker1");
+
+        vm.expectRevert(KlerosCoreBase.StakingTransferFailed.selector); // This  error will be caught because owner didn't approve any tokens for KlerosCore
+        vm.prank(owner);
+        core.setStake(GENERAL_COURT, 1000);
+
+        // Increase stake one more time to verify the correct behavior
+        vm.prank(staker1);
+        vm.expectEmit(true, true, true, true);
+        emit SortitionModuleBase.StakeSet(staker1, GENERAL_COURT, 2000, 2000);
+        core.setStake(GENERAL_COURT, 2000);
+
+        (totalStaked, totalLocked, stakedInCourt, nbCourts) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
+        assertEq(totalStaked, 2000, "Wrong amount total staked");
+        assertEq(totalLocked, 0, "Wrong amount locked");
+        assertEq(stakedInCourt, 2000, "Wrong amount staked in court");
+        assertEq(nbCourts, 1, "Number of courts should not increase");
+
+        assertEq(pinakion.balanceOf(address(core)), 2000, "Wrong token balance of the core");
+        assertEq(pinakion.balanceOf(staker1), 999999999999998000, "Wrong token balance of staker1"); // 1 eth - 2000 wei
+        assertEq(pinakion.allowance(staker1, address(core)), 999999999999998000, "Wrong allowance for staker1");
+    }
+
+    function test_setStake_decrease() public {
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 2000);
+        assertEq(pinakion.balanceOf(address(core)), 2000, "Wrong token balance of the core");
+        assertEq(pinakion.balanceOf(staker1), 999999999999998000, "Wrong token balance of staker1");
+        assertEq(pinakion.allowance(staker1, address(core)), 999999999999998000, "Wrong allowance for staker1");
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 1500); // Decrease the stake to see if it's reflected correctly
+        (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts) = sortitionModule
+            .getJurorBalance(staker1, GENERAL_COURT);
+        assertEq(totalStaked, 1500, "Wrong amount total staked");
+        assertEq(totalLocked, 0, "Wrong amount locked");
+        assertEq(stakedInCourt, 1500, "Wrong amount staked in court");
+        assertEq(nbCourts, 1, "Wrong number of courts");
+
+        uint96[] memory courts = sortitionModule.getJurorCourtIDs(staker1);
+        assertEq(courts.length, 1, "Wrong courts count");
+        assertEq(courts[0], GENERAL_COURT, "Wrong court id");
+        assertEq(sortitionModule.isJurorStaked(staker1), true, "Juror should be staked");
+
+        assertEq(pinakion.balanceOf(address(core)), 1500, "Wrong token balance of the core");
+        assertEq(pinakion.balanceOf(staker1), 999999999999998500, "Wrong token balance of staker1");
+        assertEq(
+            pinakion.allowance(staker1, address(core)),
+            999999999999998000,
+            "Allowance should not change during withdrawal"
+        );
+
+        vm.prank(address(core));
+        pinakion.transfer(staker1, 1); // Manually send 1 token to make the withdrawal fail
+
+        vm.expectRevert(KlerosCoreBase.UnstakingTransferFailed.selector);
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 0);
+
+        vm.prank(address(staker1));
+        pinakion.transfer(address(core), 1); // Manually give the token back
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 0);
+
+        (totalStaked, totalLocked, stakedInCourt, nbCourts) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
+        assertEq(totalStaked, 0, "Wrong amount total staked");
+        assertEq(totalLocked, 0, "Wrong amount locked");
+        assertEq(stakedInCourt, 0, "Wrong amount staked in court");
+        assertEq(nbCourts, 0, "Wrong number of courts");
+
+        courts = sortitionModule.getJurorCourtIDs(staker1);
+        assertEq(courts.length, 0, "Wrong courts count");
+        assertEq(sortitionModule.isJurorStaked(staker1), false, "Juror should not be staked");
+
+        assertEq(pinakion.balanceOf(address(core)), 0, "Wrong token balance of the core");
+        assertEq(pinakion.balanceOf(staker1), 1 ether, "Wrong token balance of staker1");
+        assertEq(
+            pinakion.allowance(staker1, address(core)),
+            999999999999998000,
+            "Allowance should not change during withdrawal"
+        );
+    }
+
+    function test_setStake_maxStakePathCheck() public {
+        uint256[] memory supportedDK = new uint256[](1);
+        supportedDK[0] = DISPUTE_KIT_CLASSIC;
+
+        // Create 4 courts to check the require
+        for (uint96 i = GENERAL_COURT; i <= 4; i++) {
+            vm.prank(owner);
+            core.createCourt(
+                GENERAL_COURT,
+                true,
+                2000,
+                20000,
+                0.04 ether,
+                50,
+                [uint256(10), uint256(20), uint256(30), uint256(40)],
+                abi.encode(uint256(4)),
+                supportedDK
+            );
+            vm.prank(staker1);
+            core.setStake(i, 2000);
+        }
+
+        uint96[] memory courts = sortitionModule.getJurorCourtIDs(staker1);
+        assertEq(courts.length, 4, "Wrong courts count");
+
+        uint96 excessiveCourtID = 5;
+        vm.expectRevert(KlerosCoreBase.StakingInTooManyCourts.selector);
+        vm.prank(staker1);
+        core.setStake(excessiveCourtID, 2000);
+    }
+
+    function test_setStake_increaseDrawingPhase() public {
+        // Set the stake and create a dispute to advance the phase
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 1000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        assertEq(sortitionModule.disputesWithoutJurors(), 1, "Wrong disputesWithoutJurors count");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        assertEq(pinakion.balanceOf(address(core)), 1000, "Wrong token balance of the core");
+        assertEq(pinakion.balanceOf(staker1), 999999999999999000, "Wrong token balance of staker1");
+        assertEq(uint256(sortitionModule.phase()), uint256(ISortitionModule.Phase.drawing), "Wrong phase");
+
+        vm.prank(staker1);
+        vm.expectEmit(true, true, true, true);
+        emit SortitionModuleBase.StakeDelayed(staker1, GENERAL_COURT, 1500);
+        core.setStake(GENERAL_COURT, 1500);
+
+        uint256 delayedStakeId = sortitionModule.delayedStakeWriteIndex();
+        assertEq(delayedStakeId, 1, "Wrong delayedStakeWriteIndex");
+        assertEq(sortitionModule.delayedStakeReadIndex(), 1, "Wrong delayedStakeReadIndex");
+        (address account, uint96 courtID, uint256 stake, bool alreadyTransferred) = sortitionModule.delayedStakes(
+            delayedStakeId
+        );
+        assertEq(account, staker1, "Wrong staker account");
+        assertEq(courtID, GENERAL_COURT, "Wrong court id");
+        assertEq(stake, 1500, "Wrong amount staked in court");
+        assertEq(alreadyTransferred, false, "Should be flagged as transferred");
+
+        (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts) = sortitionModule
+            .getJurorBalance(staker1, GENERAL_COURT);
+        assertEq(totalStaked, 1000, "Wrong amount total staked");
+        assertEq(totalLocked, 0, "Wrong amount locked");
+        assertEq(stakedInCourt, 1000, "Amount staked in court should not change until delayed stake is executed");
+        assertEq(nbCourts, 1, "Wrong number of courts");
+
+        uint96[] memory courts = sortitionModule.getJurorCourtIDs(staker1);
+        assertEq(courts.length, 1, "Wrong courts count");
+        assertEq(courts[0], GENERAL_COURT, "Wrong court id");
+        assertEq(sortitionModule.isJurorStaked(staker1), true, "Juror should be staked");
+
+        assertEq(pinakion.balanceOf(address(core)), 1000, "Wrong token balance of the core");
+        assertEq(pinakion.balanceOf(staker1), 999999999999999000, "Wrong token balance of staker1");
+    }
+
+    function test_setStake_decreaseDrawingPhase() public {
+        // Set the stake and create a dispute to advance the phase
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 2000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        assertEq(pinakion.balanceOf(address(core)), 2000, "Wrong token balance of the core");
+        assertEq(pinakion.balanceOf(staker1), 999999999999998000, "Wrong token balance of staker1");
+
+        vm.prank(staker1);
+        vm.expectEmit(true, true, true, true);
+        emit SortitionModuleBase.StakeDelayed(staker1, GENERAL_COURT, 1800);
+        core.setStake(GENERAL_COURT, 1800);
+
+        (uint256 totalStaked, , uint256 stakedInCourt, ) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
+        assertEq(totalStaked, 2000, "Total staked amount should not change");
+        assertEq(stakedInCourt, 2000, "Amount staked in court should not change");
+
+        assertEq(pinakion.balanceOf(address(core)), 2000, "Token balance of the core should not change");
+        assertEq(pinakion.balanceOf(staker1), 999999999999998000, "Wrong token balance of staker1");
+    }
+
+    function test_setStake_LockedTokens() public {
+        // Check that correct amount is taken when locked tokens amount exceeds the staked amount
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 10000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        uint256 disputeID = 0;
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
+        (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts) = sortitionModule
+            .getJurorBalance(staker1, GENERAL_COURT);
+        assertEq(totalStaked, 10000, "Wrong amount total staked");
+        assertEq(totalLocked, 3000, "Wrong amount locked"); // 1000 per draw and the juror was drawn 3 times
+        assertEq(stakedInCourt, 10000, "Wrong amount staked in court");
+
+        sortitionModule.passPhase(); // Staking
+
+        assertEq(pinakion.balanceOf(address(core)), 10000, "Wrong token balance of the core");
+        assertEq(pinakion.balanceOf(staker1), 999999999999990000, "Wrong token balance of staker1");
+
+        // Unstake to check that locked tokens won't be withdrawn
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 0);
+
+        (totalStaked, totalLocked, stakedInCourt, nbCourts) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
+        assertEq(totalStaked, 3000, "Wrong amount total staked");
+        assertEq(totalLocked, 3000, "Wrong amount locked");
+        assertEq(stakedInCourt, 0, "Wrong amount staked in court");
+        assertEq(nbCourts, 0, "Wrong amount staked in court");
+
+        assertEq(pinakion.balanceOf(address(core)), 3000, "Wrong token balance of the core");
+        assertEq(pinakion.balanceOf(staker1), 999999999999997000, "Wrong token balance of staker1");
+
+        // Stake again to check the behaviour.
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 5000);
+
+        (totalStaked, totalLocked, stakedInCourt, nbCourts) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
+        assertEq(totalStaked, 8000, "Wrong amount total staked"); // 5000 were added to the previous 3000.
+        assertEq(totalLocked, 3000, "Wrong amount locked");
+        assertEq(stakedInCourt, 5000, "Wrong amount staked in court");
+        assertEq(nbCourts, 1, "Wrong amount staked in court");
+
+        assertEq(pinakion.balanceOf(address(core)), 8000, "Wrong amount of tokens in Core");
+        assertEq(pinakion.balanceOf(staker1), 999999999999992000, "Wrong token balance of staker1");
+    }
+
+    function test_executeDelayedStakes() public {
+        // Stake as staker2 as well to diversify the execution of delayed stakes
+        vm.prank(staker2);
+        core.setStake(GENERAL_COURT, 10000);
+
+        vm.expectRevert(SortitionModuleBase.NoDelayedStakeToExecute.selector);
+        sortitionModule.executeDelayedStakes(5);
+
+        // Set the stake and create a dispute to advance the phase
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+        uint256 disputeID = 0;
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
+
+        vm.expectRevert(SortitionModuleBase.NotStakingPhase.selector);
+        sortitionModule.executeDelayedStakes(5);
+
+        // Create delayed stake
+        vm.prank(staker1);
+        vm.expectEmit(true, true, true, true);
+        emit SortitionModuleBase.StakeDelayed(staker1, GENERAL_COURT, 1500);
+        core.setStake(GENERAL_COURT, 1500);
+
+        assertEq(pinakion.balanceOf(address(core)), 10000, "Wrong token balance of the core"); // Balance should not increase because the stake was delayed
+        assertEq(pinakion.balanceOf(staker1), 1 ether, "Wrong token balance of staker1");
+
+        // Create delayed stake for another staker
+        vm.prank(staker2);
+        vm.expectEmit(true, true, true, true);
+        emit SortitionModuleBase.StakeDelayed(staker2, GENERAL_COURT, 0);
+        core.setStake(GENERAL_COURT, 0);
+        assertEq(pinakion.balanceOf(staker2), 999999999999990000, "Wrong token balance of staker2"); // Balance should not change since wrong phase
+
+        // Create another delayed stake for staker1 on top of it to check the execution
+        vm.prank(staker1);
+        vm.expectEmit(true, true, true, true);
+        emit SortitionModuleBase.StakeDelayed(staker1, GENERAL_COURT, 1800);
+        core.setStake(GENERAL_COURT, 1800);
+
+        assertEq(sortitionModule.delayedStakeWriteIndex(), 3, "Wrong delayedStakeWriteIndex");
+        assertEq(sortitionModule.delayedStakeReadIndex(), 1, "Wrong delayedStakeReadIndex");
+
+        (address account, uint96 courtID, uint256 stake, bool alreadyTransferred) = sortitionModule.delayedStakes(1);
+
+        // Check each delayed stake
+        assertEq(account, staker1, "Wrong staker account for the first delayed stake");
+        assertEq(courtID, GENERAL_COURT, "Wrong court ID");
+        assertEq(stake, 1500, "Wrong staking amount");
+        assertEq(alreadyTransferred, false, "Should be false");
+
+        (account, courtID, stake, alreadyTransferred) = sortitionModule.delayedStakes(2);
+        assertEq(account, staker2, "Wrong staker2 account");
+        assertEq(courtID, GENERAL_COURT, "Wrong court id for staker2");
+        assertEq(stake, 0, "Wrong amount for delayed stake of staker2");
+        assertEq(alreadyTransferred, false, "Should be false");
+
+        (account, courtID, stake, alreadyTransferred) = sortitionModule.delayedStakes(3);
+        assertEq(account, staker1, "Wrong staker1 account");
+        assertEq(courtID, GENERAL_COURT, "Wrong court id for staker1");
+        assertEq(stake, 1800, "Wrong amount for delayed stake of staker1");
+        assertEq(alreadyTransferred, false, "Should be false");
+
+        // So far the only amount transferred was 10000 by staker2. Staker 1 has two delayed stakes, for 1500 and 1800 pnk.
+        assertEq(pinakion.balanceOf(address(core)), 10000, "Wrong token balance of the core");
+        assertEq(pinakion.balanceOf(staker1), 1 ether, "Wrong token balance of staker1");
+        assertEq(pinakion.balanceOf(staker2), 999999999999990000, "Wrong token balance of staker2");
+
+        (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts) = sortitionModule
+            .getJurorBalance(staker1, GENERAL_COURT); // Only check the first staker to check how consecutive delayed stakes are handled.
+        // Balances shouldn't be updated yet.
+        assertEq(totalStaked, 0, "Wrong amount total staked");
+        assertEq(totalLocked, 0, "Wrong amount locked");
+        assertEq(stakedInCourt, 0, "Wrong amount staked in court");
+        assertEq(nbCourts, 0, "Wrong number of courts");
+
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Staking. Delayed stakes can be executed now
+
+        vm.prank(address(core));
+        pinakion.transfer(owner, 10000); // Dispose of the tokens of 2nd staker to make the execution fail for the 2nd delayed stake
+        assertEq(pinakion.balanceOf(address(core)), 0, "Wrong token balance of the core");
+
+        // 2 events should be emitted but the 2nd stake supersedes the first one in the end.
+        vm.expectEmit(true, true, true, true);
+        emit SortitionModuleBase.StakeSet(staker1, GENERAL_COURT, 1500, 1500);
+        vm.expectEmit(true, true, true, true);
+        emit SortitionModuleBase.StakeSet(staker1, GENERAL_COURT, 1800, 1800);
+        sortitionModule.executeDelayedStakes(20); // Deliberately ask for more iterations than needed
+
+        assertEq(sortitionModule.delayedStakeWriteIndex(), 3, "Wrong delayedStakeWriteIndex");
+        assertEq(sortitionModule.delayedStakeReadIndex(), 4, "Wrong delayedStakeReadIndex");
+
+        // Check that delayed stakes are nullified
+        for (uint i = 2; i <= sortitionModule.delayedStakeWriteIndex(); i++) {
+            (account, courtID, stake, alreadyTransferred) = sortitionModule.delayedStakes(i);
+
+            assertEq(account, address(0), "Wrong staker account after delayed stake deletion");
+            assertEq(courtID, 0, "Court id should be nullified");
+            assertEq(stake, 0, "No amount to stake");
+            assertEq(alreadyTransferred, false, "Should be false");
+        }
+
+        assertEq(pinakion.balanceOf(staker1), 999999999999998200, "Wrong token balance of staker1");
+
+        (totalStaked, totalLocked, stakedInCourt, nbCourts) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
+        assertEq(totalStaked, 1800, "Wrong amount total staked");
+        assertEq(totalLocked, 0, "Wrong amount locked");
+        assertEq(stakedInCourt, 1800, "Wrong amount staked in court");
+        assertEq(nbCourts, 1, "Wrong amount staked in court");
+
+        // Staker2 not getting the tokens back indicates that his delayed stake was skipped and the flow wasn't disrupted
+        assertEq(pinakion.balanceOf(staker2), 999999999999990000, "Wrong token balance of staker2");
+    }
+
+    function test_setStakeBySortitionModule() public {
+        // Note that functionality of this function was checked during delayed stakes execution
+        vm.expectRevert(KlerosCoreBase.SortitionModuleOnly.selector);
+        vm.prank(owner);
+        core.setStakeBySortitionModule(staker1, GENERAL_COURT, 1000);
+    }
+
+    function test_setStake_snapshotProxyCheck() public {
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 12346);
+
+        KlerosCoreSnapshotProxy snapshotProxy = new KlerosCoreSnapshotProxy(owner, IKlerosCore(address(core)));
+        assertEq(snapshotProxy.name(), "Staked Pinakion", "Wrong name of the proxy token");
+        assertEq(snapshotProxy.symbol(), "stPNK", "Wrong symbol of the proxy token");
+        assertEq(snapshotProxy.decimals(), 18, "Wrong decimals of the proxy token");
+        assertEq(snapshotProxy.owner(), msg.sender, "Wrong owner");
+        assertEq(address(snapshotProxy.core()), address(core), "Wrong core in snapshot proxy");
+        assertEq(snapshotProxy.balanceOf(staker1), 12346, "Wrong stPNK balance");
+
+        vm.prank(other);
+        vm.expectRevert(KlerosCoreSnapshotProxy.OwnerOnly.selector);
+        snapshotProxy.changeCore(IKlerosCore(other));
+        vm.prank(owner);
+        snapshotProxy.changeCore(IKlerosCore(other));
+        assertEq(address(snapshotProxy.core()), other, "Wrong core in snapshot proxy after change");
+
+        vm.prank(other);
+        vm.expectRevert(KlerosCoreSnapshotProxy.OwnerOnly.selector);
+        snapshotProxy.changeOwner(other);
+        vm.prank(owner);
+        snapshotProxy.changeOwner(other);
+        assertEq(snapshotProxy.owner(), other, "Wrong owner after change");
+    }
+}
diff --git a/contracts/test/foundry/KlerosCore_TestBase.sol b/contracts/test/foundry/KlerosCore_TestBase.sol
new file mode 100644
index 000000000..ad297c86a
--- /dev/null
+++ b/contracts/test/foundry/KlerosCore_TestBase.sol
@@ -0,0 +1,251 @@
+// SPDX-License-Identifier: MIT
+pragma solidity ^0.8.24;
+
+import {Test} from "forge-std/Test.sol";
+import {console} from "forge-std/console.sol"; // Import the console for logging
+import {KlerosCoreMock, KlerosCoreBase} from "../../src/test/KlerosCoreMock.sol";
+import {IArbitratorV2} from "../../src/arbitration/KlerosCoreBase.sol";
+import {IDisputeKit} from "../../src/arbitration/interfaces/IDisputeKit.sol";
+import {DisputeKitClassic, DisputeKitClassicBase} from "../../src/arbitration/dispute-kits/DisputeKitClassic.sol";
+import {DisputeKitSybilResistant} from "../../src/arbitration/dispute-kits/DisputeKitSybilResistant.sol";
+import {ISortitionModule} from "../../src/arbitration/interfaces/ISortitionModule.sol";
+import {SortitionModuleMock, SortitionModuleBase} from "../../src/test/SortitionModuleMock.sol";
+import {UUPSProxy} from "../../src/proxy/UUPSProxy.sol";
+import {BlockHashRNG} from "../../src/rng/BlockHashRNG.sol";
+import {RNGWithFallback, IRNG} from "../../src/rng/RNGWithFallback.sol";
+import {RNGMock} from "../../src/test/RNGMock.sol";
+import {PNK} from "../../src/token/PNK.sol";
+import {TestERC20} from "../../src/token/TestERC20.sol";
+import {ArbitrableExample, IArbitrableV2} from "../../src/arbitration/arbitrables/ArbitrableExample.sol";
+import {DisputeTemplateRegistry} from "../../src/arbitration/DisputeTemplateRegistry.sol";
+import "../../src/libraries/Constants.sol";
+import {IKlerosCore, KlerosCoreSnapshotProxy} from "../../src/arbitration/view/KlerosCoreSnapshotProxy.sol";
+
+/// @title KlerosCore_TestBase
+/// @dev Abstract base contract for KlerosCore tests containing shared setup and utilities
+abstract contract KlerosCore_TestBase is Test {
+    event Initialized(uint64 version);
+
+    // ************************************* //
+    // *          Test Contracts           * //
+    // ************************************* //
+
+    KlerosCoreMock core;
+    DisputeKitClassic disputeKit;
+    SortitionModuleMock sortitionModule;
+    BlockHashRNG rng;
+    PNK pinakion;
+    TestERC20 feeToken;
+    TestERC20 wNative;
+    ArbitrableExample arbitrable;
+    DisputeTemplateRegistry registry;
+
+    // ************************************* //
+    // *            Test Accounts          * //
+    // ************************************* //
+
+    address owner;
+    address guardian;
+    address staker1;
+    address staker2;
+    address disputer;
+    address crowdfunder1;
+    address crowdfunder2;
+    address other;
+    address jurorProsecutionModule;
+
+    // ************************************* //
+    // *         Test Parameters           * //
+    // ************************************* //
+
+    uint256 minStake;
+    uint256 alpha;
+    uint256 feeForJuror;
+    uint256 jurorsForCourtJump;
+    bytes sortitionExtraData;
+    bytes arbitratorExtraData;
+    uint256[4] timesPerPeriod;
+    bool hiddenVotes;
+    uint256 totalSupply = 1000000 ether;
+    uint256 minStakingTime;
+    uint256 maxDrawingTime;
+    uint256 rngLookahead; // Time in seconds
+    string templateData;
+    string templateDataMappings;
+
+    function setUp() public virtual {
+        KlerosCoreMock coreLogic = new KlerosCoreMock();
+        SortitionModuleMock smLogic = new SortitionModuleMock();
+        DisputeKitClassic dkLogic = new DisputeKitClassic();
+        DisputeTemplateRegistry registryLogic = new DisputeTemplateRegistry();
+        pinakion = new PNK();
+        feeToken = new TestERC20("Test", "TST");
+        wNative = new TestERC20("wrapped ETH", "wETH");
+
+        owner = msg.sender;
+        guardian = vm.addr(1);
+        staker1 = vm.addr(2);
+        staker2 = vm.addr(3);
+        disputer = vm.addr(4);
+        crowdfunder1 = vm.addr(5);
+        crowdfunder2 = vm.addr(6);
+        vm.deal(disputer, 10 ether);
+        vm.deal(crowdfunder1, 10 ether);
+        vm.deal(crowdfunder2, 10 ether);
+        jurorProsecutionModule = vm.addr(8);
+        other = vm.addr(9);
+        minStake = 1000;
+        alpha = 10000;
+        feeForJuror = 0.03 ether;
+        jurorsForCourtJump = 511;
+        timesPerPeriod = [60, 120, 180, 240];
+
+        pinakion.transfer(msg.sender, totalSupply - 2 ether);
+        pinakion.transfer(staker1, 1 ether);
+        pinakion.transfer(staker2, 1 ether);
+
+        sortitionExtraData = abi.encode(uint256(5));
+        minStakingTime = 18;
+        maxDrawingTime = 24;
+        hiddenVotes = false;
+
+        rngLookahead = 30;
+        rng = new BlockHashRNG(msg.sender, address(sortitionModule), rngLookahead);
+
+        UUPSProxy proxyCore = new UUPSProxy(address(coreLogic), "");
+
+        bytes memory initDataDk = abi.encodeWithSignature(
+            "initialize(address,address,address)",
+            owner,
+            address(proxyCore),
+            address(wNative)
+        );
+
+        UUPSProxy proxyDk = new UUPSProxy(address(dkLogic), initDataDk);
+        disputeKit = DisputeKitClassic(address(proxyDk));
+
+        bytes memory initDataSm = abi.encodeWithSignature(
+            "initialize(address,address,uint256,uint256,address)",
+            owner,
+            address(proxyCore),
+            minStakingTime,
+            maxDrawingTime,
+            rng
+        );
+
+        UUPSProxy proxySm = new UUPSProxy(address(smLogic), initDataSm);
+        sortitionModule = SortitionModuleMock(address(proxySm));
+        vm.prank(owner);
+        rng.changeConsumer(address(sortitionModule));
+
+        core = KlerosCoreMock(address(proxyCore));
+        core.initialize(
+            owner,
+            guardian,
+            pinakion,
+            jurorProsecutionModule,
+            disputeKit,
+            hiddenVotes,
+            [minStake, alpha, feeForJuror, jurorsForCourtJump],
+            timesPerPeriod,
+            sortitionExtraData,
+            sortitionModule,
+            address(wNative)
+        );
+        vm.prank(staker1);
+        pinakion.approve(address(core), 1 ether);
+        vm.prank(staker2);
+        pinakion.approve(address(core), 1 ether);
+
+        templateData = "AAA";
+        templateDataMappings = "BBB";
+        arbitratorExtraData = abi.encodePacked(uint256(GENERAL_COURT), DEFAULT_NB_OF_JURORS, DISPUTE_KIT_CLASSIC);
+
+        bytes memory initDataRegistry = abi.encodeWithSignature("initialize(address)", owner);
+        UUPSProxy proxyRegistry = new UUPSProxy(address(registryLogic), initDataRegistry);
+        registry = DisputeTemplateRegistry(address(proxyRegistry));
+
+        arbitrable = new ArbitrableExample(
+            core,
+            templateData,
+            templateDataMappings,
+            arbitratorExtraData,
+            registry,
+            feeToken
+        );
+    }
+
+    // ************************************* //
+    // *         Helper Functions          * //
+    // ************************************* //
+
+    /// @dev Helper function to create a new dispute kit
+    function _createNewDisputeKit() internal returns (DisputeKitSybilResistant) {
+        return new DisputeKitSybilResistant();
+    }
+
+    /// @dev Helper function to create a new court with standard parameters
+    function _createStandardCourt(
+        uint96 parent,
+        uint256 minStakeValue,
+        uint256 alphaValue,
+        uint256 feeForJurorValue,
+        uint256 jurorsForJumpValue
+    ) internal returns (uint96) {
+        uint256[] memory supportedDK = new uint256[](1);
+        supportedDK[0] = DISPUTE_KIT_CLASSIC;
+
+        vm.prank(owner);
+        core.createCourt(
+            parent,
+            hiddenVotes,
+            minStakeValue,
+            alphaValue,
+            feeForJurorValue,
+            jurorsForJumpValue,
+            timesPerPeriod,
+            sortitionExtraData,
+            supportedDK
+        );
+
+        return uint96(core.getCourtChildren(parent)[core.getCourtChildren(parent).length - 1]);
+    }
+
+    /// @dev Helper function to check court parameters
+    function _assertCourtParameters(
+        uint96 courtId,
+        uint96 expectedParent,
+        bool expectedHiddenVotes,
+        uint256 expectedMinStake,
+        uint256 expectedAlpha,
+        uint256 expectedFeeForJuror,
+        uint256 expectedJurorsForJump,
+        bool expectedDisabled
+    ) internal {
+        (
+            uint96 courtParent,
+            bool courtHiddenVotes,
+            uint256 courtMinStake,
+            uint256 courtAlpha,
+            uint256 courtFeeForJuror,
+            uint256 courtJurorsForCourtJump,
+            bool courtDisabled
+        ) = core.courts(courtId);
+
+        assertEq(courtParent, expectedParent, "Wrong court parent");
+        assertEq(courtHiddenVotes, expectedHiddenVotes, "Wrong hiddenVotes value");
+        assertEq(courtMinStake, expectedMinStake, "Wrong minStake value");
+        assertEq(courtAlpha, expectedAlpha, "Wrong alpha value");
+        assertEq(courtFeeForJuror, expectedFeeForJuror, "Wrong feeForJuror value");
+        assertEq(courtJurorsForCourtJump, expectedJurorsForJump, "Wrong jurorsForCourtJump value");
+        assertEq(courtDisabled, expectedDisabled, "Wrong disabled state");
+    }
+
+    /// @dev Helper function to check times per period
+    function _assertTimesPerPeriod(uint96 courtId, uint256[4] memory expectedTimes) internal {
+        uint256[4] memory courtTimesPerPeriod = core.getTimesPerPeriod(courtId);
+        for (uint256 i = 0; i < 4; i++) {
+            assertEq(courtTimesPerPeriod[i], expectedTimes[i], "Wrong times per period");
+        }
+    }
+}
diff --git a/contracts/test/foundry/KlerosCore_Voting.t.sol b/contracts/test/foundry/KlerosCore_Voting.t.sol
new file mode 100644
index 000000000..9ede69305
--- /dev/null
+++ b/contracts/test/foundry/KlerosCore_Voting.t.sol
@@ -0,0 +1,485 @@
+// SPDX-License-Identifier: MIT
+pragma solidity ^0.8.24;
+
+import {KlerosCore_TestBase} from "./KlerosCore_TestBase.sol";
+import {KlerosCoreBase} from "../../src/arbitration/KlerosCoreBase.sol";
+import {DisputeKitClassic, DisputeKitClassicBase} from "../../src/arbitration/dispute-kits/DisputeKitClassic.sol";
+import {IDisputeKit} from "../../src/arbitration/interfaces/IDisputeKit.sol";
+import {UUPSProxy} from "../../src/proxy/UUPSProxy.sol";
+import "../../src/libraries/Constants.sol";
+
+/// @title KlerosCore_VotingTest
+/// @dev Tests for KlerosCore voting system (commit/reveal and direct voting)
+contract KlerosCore_VotingTest is KlerosCore_TestBase {
+    function test_castCommit() public {
+        // Change hidden votes in general court
+        uint256 disputeID = 0;
+        vm.prank(owner);
+        core.changeCourtParameters(
+            GENERAL_COURT,
+            true, // Hidden votes
+            1000, // min stake
+            10000, // alpha
+            0.03 ether, // fee for juror
+            511, // jurors for jump
+            [uint256(60), uint256(120), uint256(180), uint256(240)] // Times per period
+        );
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 10000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
+
+        uint256 YES = 1;
+        uint256 salt = 123455678;
+        uint256[] memory voteIDs = new uint256[](1);
+        voteIDs[0] = 0;
+        bytes32 commit;
+        vm.prank(staker1);
+        vm.expectRevert(DisputeKitClassicBase.NotCommitPeriod.selector);
+        disputeKit.castCommit(disputeID, voteIDs, commit);
+
+        vm.expectRevert(KlerosCoreBase.EvidenceNotPassedAndNotAppeal.selector);
+        core.passPeriod(disputeID);
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.commit);
+        core.passPeriod(disputeID);
+
+        (, , KlerosCoreBase.Period period, , uint256 lastPeriodChange) = core.disputes(disputeID);
+
+        assertEq(uint256(period), uint256(KlerosCoreBase.Period.commit), "Wrong period");
+        assertEq(lastPeriodChange, block.timestamp, "Wrong lastPeriodChange");
+
+        vm.prank(staker1);
+        vm.expectRevert(DisputeKitClassicBase.EmptyCommit.selector);
+        disputeKit.castCommit(disputeID, voteIDs, commit);
+
+        commit = keccak256(abi.encodePacked(YES, salt));
+
+        vm.prank(other);
+        vm.expectRevert(DisputeKitClassicBase.JurorHasToOwnTheVote.selector);
+        disputeKit.castCommit(disputeID, voteIDs, commit);
+
+        vm.prank(staker1);
+        vm.expectEmit(true, true, true, true);
+        emit DisputeKitClassicBase.CommitCast(disputeID, staker1, voteIDs, commit);
+        disputeKit.castCommit(disputeID, voteIDs, commit);
+
+        (, , , uint256 totalCommited, uint256 nbVoters, uint256 choiceCount) = disputeKit.getRoundInfo(disputeID, 0, 0);
+        assertEq(totalCommited, 1, "totalCommited should be 1");
+        assertEq(disputeKit.areCommitsAllCast(disputeID), false, "Commits should not all be cast");
+
+        (, bytes32 commitStored, , ) = disputeKit.getVoteInfo(0, 0, 0);
+        assertEq(commitStored, keccak256(abi.encodePacked(YES, salt)), "Incorrect commit");
+
+        voteIDs = new uint256[](2); // Create the leftover votes subset
+        voteIDs[0] = 1;
+        voteIDs[1] = 2;
+
+        vm.prank(staker1);
+        vm.expectEmit(true, true, true, true);
+        emit DisputeKitClassicBase.CommitCast(disputeID, staker1, voteIDs, commit);
+        disputeKit.castCommit(disputeID, voteIDs, commit);
+
+        (, , , totalCommited, nbVoters, choiceCount) = disputeKit.getRoundInfo(disputeID, 0, 0);
+        assertEq(totalCommited, DEFAULT_NB_OF_JURORS, "totalCommited should be 3");
+        assertEq(disputeKit.areCommitsAllCast(disputeID), true, "Commits should all be cast");
+
+        for (uint256 i = 1; i < DEFAULT_NB_OF_JURORS; i++) {
+            (, commitStored, , ) = disputeKit.getVoteInfo(0, 0, i);
+            assertEq(commitStored, keccak256(abi.encodePacked(YES, salt)), "Incorrect commit");
+        }
+
+        // Check reveal in the next period
+        vm.warp(block.timestamp + timesPerPeriod[1]);
+        core.passPeriod(disputeID);
+
+        // Check the require with the wrong choice and then with the wrong salt
+        vm.prank(staker1);
+        vm.expectRevert(DisputeKitClassicBase.HashDoesNotMatchHiddenVoteCommitment.selector);
+        disputeKit.castVote(disputeID, voteIDs, 2, salt, "XYZ");
+
+        vm.prank(staker1);
+        vm.expectRevert(DisputeKitClassicBase.HashDoesNotMatchHiddenVoteCommitment.selector);
+        disputeKit.castVote(disputeID, voteIDs, YES, salt - 1, "XYZ");
+
+        vm.prank(staker1);
+        disputeKit.castVote(disputeID, voteIDs, YES, salt, "XYZ");
+
+        for (uint256 i = 1; i < DEFAULT_NB_OF_JURORS; i++) {
+            // 0 voteID was skipped when casting a vote
+            (address account, , uint256 choice, bool voted) = disputeKit.getVoteInfo(0, 0, i);
+            assertEq(account, staker1, "Wrong drawn account");
+            assertEq(choice, YES, "Wrong choice");
+            assertEq(voted, true, "Voted should be true");
+        }
+    }
+
+    function test_castCommit_timeoutCheck() public {
+        // Change hidden votes in general court
+        uint256 disputeID = 0;
+        vm.prank(owner);
+        core.changeCourtParameters(
+            GENERAL_COURT,
+            true, // Hidden votes
+            1000, // min stake
+            10000, // alpha
+            0.03 ether, // fee for juror
+            511, // jurors for jump
+            [uint256(60), uint256(120), uint256(180), uint256(240)] // Times per period
+        );
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 10000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
+
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Commit
+
+        vm.expectRevert(KlerosCoreBase.CommitPeriodNotPassed.selector);
+        core.passPeriod(disputeID);
+
+        vm.warp(block.timestamp + timesPerPeriod[1]);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.vote);
+        core.passPeriod(disputeID);
+    }
+
+    function test_castVote() public {
+        uint256 disputeID = 0;
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 10000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS - 1); // Draw less to check the require later
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+
+        uint256[] memory voteIDs = new uint256[](0);
+        vm.prank(staker1);
+        vm.expectRevert(DisputeKitClassicBase.NotVotePeriod.selector);
+        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ"); // Leave salt empty as not needed
+
+        vm.expectRevert(KlerosCoreBase.DisputeStillDrawing.selector);
+        core.passPeriod(disputeID);
+
+        core.draw(disputeID, 1); // Draw the last juror
+
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.vote);
+        core.passPeriod(disputeID); // Vote
+
+        (, , KlerosCoreBase.Period period, , uint256 lastPeriodChange) = core.disputes(disputeID);
+
+        assertEq(uint256(period), uint256(KlerosCoreBase.Period.vote), "Wrong period");
+        assertEq(lastPeriodChange, block.timestamp, "Wrong lastPeriodChange");
+
+        vm.prank(staker1);
+        vm.expectRevert(DisputeKitClassicBase.EmptyVoteIDs.selector);
+        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
+
+        voteIDs = new uint256[](1);
+        voteIDs[0] = 0; // Split vote IDs to see how the winner changes
+        vm.prank(staker1);
+        vm.expectRevert(DisputeKitClassicBase.ChoiceOutOfBounds.selector);
+        disputeKit.castVote(disputeID, voteIDs, 2 + 1, 0, "XYZ");
+
+        vm.prank(other);
+        vm.expectRevert(DisputeKitClassicBase.JurorHasToOwnTheVote.selector);
+        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
+
+        vm.prank(staker1);
+        vm.expectEmit(true, true, true, true);
+        emit IDisputeKit.VoteCast(disputeID, staker1, voteIDs, 2, "XYZ");
+        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
+
+        vm.prank(staker1);
+        vm.expectRevert(DisputeKitClassicBase.VoteAlreadyCast.selector);
+        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
+
+        (
+            uint256 winningChoice,
+            bool tied,
+            uint256 totalVoted,
+            uint256 totalCommited,
+            ,
+            uint256 choiceCount
+        ) = disputeKit.getRoundInfo(disputeID, 0, 2);
+        assertEq(winningChoice, 2, "Wrong winning choice");
+        assertEq(tied, false, "tied should be false");
+        assertEq(totalVoted, 1, "totalVoted should be 1");
+        assertEq(totalCommited, 0, "totalCommited should be 0");
+        assertEq(choiceCount, 1, "choiceCount should be 1");
+
+        (address account, bytes32 commit, uint256 choice, bool voted) = disputeKit.getVoteInfo(0, 0, 0); // Dispute - Round - VoteID
+        assertEq(account, staker1, "Wrong drawn account");
+        assertEq(commit, bytes32(0), "Commit should be empty");
+        assertEq(choice, 2, "Choice should be 2");
+        assertEq(voted, true, "Voted should be true");
+
+        assertEq(disputeKit.isVoteActive(0, 0, 0), true, "Vote should be active"); // Dispute - Round - VoteID
+
+        voteIDs = new uint256[](1);
+        voteIDs[0] = 1; // Cast another vote to check the tie.
+
+        vm.prank(staker1);
+        vm.expectEmit(true, true, true, true);
+        emit IDisputeKit.VoteCast(disputeID, staker1, voteIDs, 1, "XYZZ");
+        disputeKit.castVote(disputeID, voteIDs, 1, 0, "XYZZ");
+
+        (, tied, totalVoted, , , choiceCount) = disputeKit.getRoundInfo(disputeID, 0, 1);
+        assertEq(tied, true, "tied should be true");
+        assertEq(totalVoted, 2, "totalVoted should be 2");
+        assertEq(choiceCount, 1, "choiceCount should be 1 for first choice");
+
+        vm.expectRevert(KlerosCoreBase.VotePeriodNotPassed.selector);
+        core.passPeriod(disputeID);
+
+        voteIDs = new uint256[](1);
+        voteIDs[0] = 2; // Cast another vote to declare a new winner.
+
+        vm.prank(staker1);
+        vm.expectEmit(true, true, true, true);
+        emit IDisputeKit.VoteCast(disputeID, staker1, voteIDs, 1, "XYZZ");
+        disputeKit.castVote(disputeID, voteIDs, 1, 0, "XYZZ");
+
+        (winningChoice, tied, totalVoted, , , choiceCount) = disputeKit.getRoundInfo(disputeID, 0, 1);
+        assertEq(winningChoice, 1, "Wrong winning choice");
+        assertEq(tied, false, "tied should be false");
+        assertEq(totalVoted, 3, "totalVoted should be 3");
+        assertEq(choiceCount, 2, "choiceCount should be 2 for first choice");
+        assertEq(disputeKit.areVotesAllCast(disputeID), true, "Votes should all be cast");
+    }
+
+    function test_castVote_timeoutCheck() public {
+        // Change hidden votes in general court
+        uint256 disputeID = 0;
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 10000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
+
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Votes
+
+        vm.expectRevert(KlerosCoreBase.VotePeriodNotPassed.selector);
+        core.passPeriod(disputeID);
+
+        vm.warp(block.timestamp + timesPerPeriod[2]);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.AppealPossible(disputeID, arbitrable);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.appeal);
+        core.passPeriod(disputeID);
+    }
+
+    function test_castVote_rulingCheck() public {
+        // Change hidden votes in general court
+        uint256 disputeID = 0;
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 10000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
+
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Votes
+
+        uint256[] memory voteIDs = new uint256[](3);
+        voteIDs[0] = 0;
+        voteIDs[1] = 1;
+        voteIDs[2] = 2;
+
+        vm.prank(staker1);
+        disputeKit.castVote(disputeID, voteIDs, 1, 0, "XYZZ");
+
+        (uint256 ruling, bool tied, bool overridden) = disputeKit.currentRuling(disputeID);
+        assertEq(ruling, 1, "Wrong ruling");
+        assertEq(tied, false, "Not tied");
+        assertEq(overridden, false, "Not overridden");
+    }
+
+    function test_castVote_quickPassPeriod() public {
+        // Change hidden votes in general court
+        uint256 disputeID = 0;
+        vm.prank(owner);
+        core.changeCourtParameters(
+            GENERAL_COURT,
+            true, // Hidden votes
+            1000, // min stake
+            10000, // alpha
+            0.03 ether, // fee for juror
+            511, // jurors for jump
+            [uint256(60), uint256(120), uint256(180), uint256(240)] // Times per period
+        );
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 10000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
+
+        uint256 YES = 1;
+        uint256 salt = 123455678;
+        uint256[] memory voteIDs = new uint256[](1);
+        voteIDs[0] = 0;
+        bytes32 commit;
+
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID);
+
+        commit = keccak256(abi.encodePacked(YES, salt));
+
+        vm.prank(staker1);
+        disputeKit.castCommit(disputeID, voteIDs, commit);
+
+        (, , , uint256 totalCommited, uint256 nbVoters, uint256 choiceCount) = disputeKit.getRoundInfo(disputeID, 0, 0);
+        assertEq(totalCommited, 1, "totalCommited should be 1");
+        assertEq(disputeKit.areCommitsAllCast(disputeID), false, "Commits should not all be cast");
+
+        vm.warp(block.timestamp + timesPerPeriod[1]);
+        core.passPeriod(disputeID);
+
+        vm.prank(staker1);
+        disputeKit.castVote(disputeID, voteIDs, YES, salt, "XYZ");
+
+        (, , uint256 totalVoted, , , ) = disputeKit.getRoundInfo(disputeID, 0, 0);
+        assertEq(totalVoted, 1, "totalVoted should be 1");
+        assertEq(disputeKit.areVotesAllCast(disputeID), true, "Every committed vote was cast");
+
+        // Should pass period by counting only committed votes.
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.appeal);
+        core.passPeriod(disputeID);
+    }
+
+    function test_castVote_differentDK() public {
+        DisputeKitClassic dkLogic = new DisputeKitClassic();
+        // Create a new DK to check castVote.
+        bytes memory initDataDk = abi.encodeWithSignature(
+            "initialize(address,address,address)",
+            owner,
+            address(core),
+            address(wNative)
+        );
+
+        UUPSProxy proxyDk = new UUPSProxy(address(dkLogic), initDataDk);
+        DisputeKitClassic newDisputeKit = DisputeKitClassic(address(proxyDk));
+
+        vm.prank(owner);
+        core.addNewDisputeKit(newDisputeKit);
+
+        uint256 newDkID = 2;
+        uint256[] memory supportedDK = new uint256[](1);
+        bytes memory newExtraData = abi.encodePacked(uint256(GENERAL_COURT), DEFAULT_NB_OF_JURORS, newDkID);
+
+        vm.prank(owner);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.DisputeKitEnabled(GENERAL_COURT, newDkID, true);
+        supportedDK[0] = newDkID;
+        core.enableDisputeKits(GENERAL_COURT, supportedDK, true);
+        assertEq(core.isSupported(GENERAL_COURT, newDkID), true, "New DK should be supported by General court");
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 20000);
+
+        // Create one dispute for the old DK and two disputes for the new DK.
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+
+        arbitrable.changeArbitratorExtraData(newExtraData);
+
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+
+        uint256 disputeID = 2; // Use the latest dispute for reference. This is the ID in the core contract
+
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 0);
+        assertEq(round.disputeKitID, newDkID, "Wrong DK ID");
+
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
+        // Draw jurors for the old DK as well to prepare round.votes array
+        core.draw(0, DEFAULT_NB_OF_JURORS);
+
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Vote
+
+        // Check that the new DK has the info but not the old one.
+
+        assertEq(disputeKit.coreDisputeIDToActive(disputeID), false, "Should be false for old DK");
+
+        // This is the DK where dispute was created. Core dispute points to index 1 because new DK has two disputes.
+        assertEq(newDisputeKit.coreDisputeIDToLocal(disputeID), 1, "Wrong local dispute ID for new DK");
+        assertEq(newDisputeKit.coreDisputeIDToActive(disputeID), true, "Should be active for new DK");
+        (uint256 numberOfChoices, , bytes memory extraData) = newDisputeKit.disputes(1);
+        assertEq(numberOfChoices, 2, "Wrong numberOfChoices in new DK");
+        assertEq(extraData, newExtraData, "Wrong extra data");
+
+        uint256[] memory voteIDs = new uint256[](3);
+        voteIDs[0] = 0;
+        voteIDs[1] = 1;
+        voteIDs[2] = 2;
+
+        // Deliberately cast votes using the old DK to see if the exception will be caught.
+        vm.prank(staker1);
+        vm.expectRevert(DisputeKitClassicBase.NotActiveForCoreDisputeID.selector);
+        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
+
+        // And check the new DK.
+        vm.prank(staker1);
+        newDisputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
+
+        (
+            uint256 winningChoice,
+            bool tied,
+            uint256 totalVoted,
+            uint256 totalCommited,
+            ,
+            uint256 choiceCount
+        ) = newDisputeKit.getRoundInfo(disputeID, 0, 2);
+        assertEq(winningChoice, 2, "Wrong winning choice");
+        assertEq(tied, false, "tied should be false");
+        assertEq(totalVoted, 3, "totalVoted should be 3");
+        assertEq(totalCommited, 0, "totalCommited should be 0");
+        assertEq(choiceCount, 3, "choiceCount should be 3");
+    }
+}

From e6114bab12da4179bee66ab8ada4b6334eae4297 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Fri, 29 Aug 2025 04:09:54 +0100
Subject: [PATCH 071/175] fix: defensive guard added against jumpDisputeKitID
 not set

---
 contracts/src/arbitration/KlerosCoreBase.sol | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/contracts/src/arbitration/KlerosCoreBase.sol b/contracts/src/arbitration/KlerosCoreBase.sol
index 891d7173f..5551d5257 100644
--- a/contracts/src/arbitration/KlerosCoreBase.sol
+++ b/contracts/src/arbitration/KlerosCoreBase.sol
@@ -1081,8 +1081,8 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
         if (!courts[newCourtID].supportedDisputeKits[newDisputeKitID]) {
             // The current Dispute Kit is not compatible with the new court, jump to another Dispute Kit.
             newDisputeKitID = disputeKits[_round.disputeKitID].getJumpDisputeKitID();
-            if (!courts[newCourtID].supportedDisputeKits[newDisputeKitID]) {
-                // The new Dispute Kit is still not compatible, fall back to `DisputeKitClassic` which is always supported.
+            if (newDisputeKitID == NULL_DISPUTE_KIT || !courts[newCourtID].supportedDisputeKits[newDisputeKitID]) {
+                // The new Dispute Kit is not defined or still not compatible, fall back to `DisputeKitClassic` which is always supported.
                 newDisputeKitID = DISPUTE_KIT_CLASSIC;
             }
             disputeKitJump = true;

From 9d31252bb310aef00d9c175340fc602545ac26a0 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Fri, 29 Aug 2025 04:28:31 +0100
Subject: [PATCH 072/175] chore: dynamically retrieve the disputeKitID in the
 deployment script

---
 contracts/deploy/00-home-chain-arbitration-neo.ts | 6 +++---
 contracts/deploy/00-home-chain-arbitration.ts     | 6 +++---
 2 files changed, 6 insertions(+), 6 deletions(-)

diff --git a/contracts/deploy/00-home-chain-arbitration-neo.ts b/contracts/deploy/00-home-chain-arbitration-neo.ts
index 22c2ffade..c5e50d6a2 100644
--- a/contracts/deploy/00-home-chain-arbitration-neo.ts
+++ b/contracts/deploy/00-home-chain-arbitration-neo.ts
@@ -123,29 +123,29 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
   await core.changeArbitrableWhitelist(resolver.address, true);
 
   // Extra dispute kits
-  const disputeKitShutterID = 2;
   const disputeKitShutter = await deployUpgradable(deployments, "DisputeKitShutter", {
     from: deployer,
     args: [deployer, core.target, weth.target, classicDisputeKitID],
     log: true,
   });
   await core.addNewDisputeKit(disputeKitShutter.address);
+  const disputeKitShutterID = Number(await core.getDisputeKitsLength());
 
-  const disputeKitGatedID = 3;
   const disputeKitGated = await deployUpgradable(deployments, "DisputeKitGated", {
     from: deployer,
     args: [deployer, core.target, weth.target, classicDisputeKitID],
     log: true,
   });
   await core.addNewDisputeKit(disputeKitGated.address);
+  const disputeKitGatedID = Number(await core.getDisputeKitsLength());
 
-  const disputeKitGatedShutterID = 4;
   const disputeKitGatedShutter = await deployUpgradable(deployments, "DisputeKitGatedShutter", {
     from: deployer,
     args: [deployer, core.target, weth.target, disputeKitShutterID], // Does not jump to DKClassic
     log: true,
   });
   await core.addNewDisputeKit(disputeKitGatedShutter.address);
+  const disputeKitGatedShutterID = Number(await core.getDisputeKitsLength());
 
   // Snapshot proxy
   await deploy("KlerosCoreSnapshotProxy", {
diff --git a/contracts/deploy/00-home-chain-arbitration.ts b/contracts/deploy/00-home-chain-arbitration.ts
index 8ec753194..8163c6f66 100644
--- a/contracts/deploy/00-home-chain-arbitration.ts
+++ b/contracts/deploy/00-home-chain-arbitration.ts
@@ -104,31 +104,31 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
   }
 
   // Extra dispute kits
-  const disputeKitShutterID = 2;
   const disputeKitShutter = await deployUpgradable(deployments, "DisputeKitShutter", {
     from: deployer,
     args: [deployer, core.target, weth.target, classicDisputeKitID],
     log: true,
   });
   await core.addNewDisputeKit(disputeKitShutter.address);
+  const disputeKitShutterID = Number(await core.getDisputeKitsLength());
   await core.enableDisputeKits(Courts.GENERAL, [disputeKitShutterID], true); // enable disputeKitShutter on the General Court
 
-  const disputeKitGatedID = 3;
   const disputeKitGated = await deployUpgradable(deployments, "DisputeKitGated", {
     from: deployer,
     args: [deployer, core.target, weth.target, classicDisputeKitID],
     log: true,
   });
   await core.addNewDisputeKit(disputeKitGated.address);
+  const disputeKitGatedID = Number(await core.getDisputeKitsLength());
   await core.enableDisputeKits(Courts.GENERAL, [disputeKitGatedID], true); // enable disputeKitGated on the General Court
 
-  const disputeKitGatedShutterID = 4;
   const disputeKitGatedShutter = await deployUpgradable(deployments, "DisputeKitGatedShutter", {
     from: deployer,
     args: [deployer, core.target, weth.target, disputeKitShutterID], // Does not jump to DKClassic
     log: true,
   });
   await core.addNewDisputeKit(disputeKitGatedShutter.address);
+  const disputeKitGatedShutterID = Number(await core.getDisputeKitsLength());
   await core.enableDisputeKits(Courts.GENERAL, [disputeKitGatedShutterID], true); // enable disputeKitGatedShutter on the General Court
 
   // Snapshot proxy

From baf96954ff25006b02d6c40ee1e60773cb4e5377 Mon Sep 17 00:00:00 2001
From: Harman-singh-waraich <Waraichharman68@gmail.com>
Date: Tue, 2 Sep 2025 21:18:32 +0530
Subject: [PATCH 073/175] feat: initial-features-implementation

---
 web/src/context/NewDisputeContext.tsx         |  29 ++
 web/src/pages/Resolver/Parameters/Court.tsx   | 356 ------------------
 .../FeatureSelection/JurorEligibility.tsx     | 248 ++++++++++++
 .../Court/FeatureSelection/ShieldedVoting.tsx | 107 ++++++
 .../Court/FeatureSelection/index.tsx          |  71 ++++
 .../pages/Resolver/Parameters/Court/index.tsx |  92 +++++
 6 files changed, 547 insertions(+), 356 deletions(-)
 delete mode 100644 web/src/pages/Resolver/Parameters/Court.tsx
 create mode 100644 web/src/pages/Resolver/Parameters/Court/FeatureSelection/JurorEligibility.tsx
 create mode 100644 web/src/pages/Resolver/Parameters/Court/FeatureSelection/ShieldedVoting.tsx
 create mode 100644 web/src/pages/Resolver/Parameters/Court/FeatureSelection/index.tsx
 create mode 100644 web/src/pages/Resolver/Parameters/Court/index.tsx

diff --git a/web/src/context/NewDisputeContext.tsx b/web/src/context/NewDisputeContext.tsx
index 5fc109cef..e59c9cfc3 100644
--- a/web/src/context/NewDisputeContext.tsx
+++ b/web/src/context/NewDisputeContext.tsx
@@ -5,9 +5,13 @@ import { Address } from "viem";
 
 import { DEFAULT_CHAIN } from "consts/chains";
 import { klerosCoreAddress } from "hooks/contracts/generated";
+import { useSupportedDisputeKits } from "hooks/queries/useSupportedDisputeKits";
+import { useDisputeKitAddressesAll } from "hooks/useDisputeKitAddresses";
 import { useLocalStorage } from "hooks/useLocalStorage";
 import { isEmpty, isUndefined } from "utils/index";
 
+import { DisputeKits } from "src/consts";
+
 export const MIN_DISPUTE_BATCH_SIZE = 2;
 
 export type Answer = {
@@ -24,6 +28,12 @@ export type AliasArray = {
   isValid?: boolean;
 };
 
+export type DisputeKitOption = {
+  text: DisputeKits;
+  value: number;
+  gated: boolean;
+};
+
 export type Alias = Record<string, string>;
 export interface IDisputeTemplate {
   answers: Answer[];
@@ -83,6 +93,7 @@ interface INewDisputeContext {
   setIsBatchCreation: (isBatchCreation: boolean) => void;
   batchSize: number;
   setBatchSize: (batchSize?: number) => void;
+  disputeKitOptions: DisputeKitOption[];
 }
 
 const getInitialDisputeData = (): IDisputeData => ({
@@ -137,6 +148,22 @@ export const NewDisputeProvider: React.FC<{ children: React.ReactNode }> = ({ ch
     // eslint-disable-next-line react-hooks/exhaustive-deps
   }, [location.pathname]);
 
+  const { data: supportedDisputeKits } = useSupportedDisputeKits(disputeData.courtId);
+  const { availableDisputeKits } = useDisputeKitAddressesAll();
+
+  const disputeKitOptions: DisputeKitOption[] = useMemo(() => {
+    return (
+      supportedDisputeKits?.court?.supportedDisputeKits.map((dk) => {
+        const text = availableDisputeKits[dk.address.toLowerCase()] ?? "";
+        return {
+          text,
+          value: Number(dk.id),
+          gated: text === DisputeKits.Gated || text === DisputeKits.GatedShutter,
+        };
+      }) || []
+    );
+  }, [supportedDisputeKits, availableDisputeKits]);
+
   const contextValues = useMemo(
     () => ({
       disputeData,
@@ -151,6 +178,7 @@ export const NewDisputeProvider: React.FC<{ children: React.ReactNode }> = ({ ch
       setIsBatchCreation,
       batchSize,
       setBatchSize,
+      disputeKitOptions,
     }),
     [
       disputeData,
@@ -163,6 +191,7 @@ export const NewDisputeProvider: React.FC<{ children: React.ReactNode }> = ({ ch
       setIsBatchCreation,
       batchSize,
       setBatchSize,
+      disputeKitOptions,
     ]
   );
 
diff --git a/web/src/pages/Resolver/Parameters/Court.tsx b/web/src/pages/Resolver/Parameters/Court.tsx
deleted file mode 100644
index df4767f9d..000000000
--- a/web/src/pages/Resolver/Parameters/Court.tsx
+++ /dev/null
@@ -1,356 +0,0 @@
-import React, { useMemo, useEffect } from "react";
-import styled, { css } from "styled-components";
-
-import { AlertMessage, Checkbox, DropdownCascader, DropdownSelect, Field } from "@kleros/ui-components-library";
-
-import { DisputeKits } from "consts/index";
-import { IGatedDisputeData, useNewDisputeContext } from "context/NewDisputeContext";
-import { rootCourtToItems, useCourtTree } from "hooks/queries/useCourtTree";
-import { useDisputeKitAddressesAll } from "hooks/useDisputeKitAddresses";
-import { useERC20ERC721Validation, useERC1155Validation } from "hooks/useTokenAddressValidation";
-import { isUndefined } from "utils/index";
-
-import { useSupportedDisputeKits } from "queries/useSupportedDisputeKits";
-
-import { landscapeStyle } from "styles/landscapeStyle";
-import { responsiveSize } from "styles/responsiveSize";
-
-import { StyledSkeleton } from "components/StyledSkeleton";
-import Header from "pages/Resolver/Header";
-
-import NavigationButtons from "../NavigationButtons";
-
-const Container = styled.div`
-  display: flex;
-  flex-direction: column;
-  align-items: center;
-
-  ${landscapeStyle(
-    () => css`
-      padding-bottom: 115px;
-    `
-  )}
-`;
-
-const StyledDropdownCascader = styled(DropdownCascader)`
-  width: 84vw;
-  ${landscapeStyle(
-    () => css`
-      width: ${responsiveSize(442, 700, 900)};
-    `
-  )}
-  > button {
-    width: 100%;
-  }
-`;
-
-const AlertMessageContainer = styled.div`
-  width: 84vw;
-  ${landscapeStyle(
-    () => css`
-      width: ${responsiveSize(442, 700, 900)};
-    `
-  )}
-  margin-top: 24px;
-`;
-
-const StyledDropdownSelect = styled(DropdownSelect)`
-  width: 84vw;
-  margin-top: 24px;
-  ${landscapeStyle(
-    () => css`
-      width: ${responsiveSize(442, 700, 900)};
-    `
-  )}
-`;
-
-const StyledField = styled(Field)`
-  width: 84vw;
-  margin-top: 24px;
-  ${landscapeStyle(
-    () => css`
-      width: ${responsiveSize(442, 700, 900)};
-    `
-  )}
-  > small {
-    margin-top: 16px;
-  }
-`;
-
-const StyledCheckbox = styled(Checkbox)`
-  width: 84vw;
-  margin-top: 24px;
-  ${landscapeStyle(
-    () => css`
-      width: ${responsiveSize(442, 700, 900)};
-    `
-  )}
-`;
-
-const ValidationContainer = styled.div`
-  width: 84vw;
-  display: flex;
-  align-items: left;
-  gap: 8px;
-  margin-top: 8px;
-  ${landscapeStyle(
-    () => css`
-      width: ${responsiveSize(442, 700, 900)};
-    `
-  )}
-`;
-
-const ValidationIcon = styled.div<{ $isValid?: boolean | null; $isValidating?: boolean }>`
-  width: 16px;
-  height: 16px;
-  border-radius: 50%;
-  display: flex;
-  align-items: center;
-  justify-content: center;
-  font-size: 12px;
-
-  ${({ $isValidating, $isValid }) => {
-    if ($isValidating) {
-      return css`
-        border: 2px solid ${({ theme }) => theme.stroke};
-        border-top-color: ${({ theme }) => theme.primaryBlue};
-        animation: spin 1s linear infinite;
-
-        @keyframes spin {
-          to {
-            transform: rotate(360deg);
-          }
-        }
-      `;
-    }
-
-    if ($isValid === true) {
-      return css`
-        background-color: ${({ theme }) => theme.success};
-        color: white;
-        &::after {
-          content: "✓";
-        }
-      `;
-    }
-
-    if ($isValid === false) {
-      return css`
-        background-color: ${({ theme }) => theme.error};
-        color: white;
-        &::after {
-          content: "✗";
-        }
-      `;
-    }
-
-    return css`
-      display: none;
-    `;
-  }}
-`;
-
-const ValidationMessage = styled.small<{ $isError?: boolean }>`
-  color: ${({ $isError, theme }) => ($isError ? theme.error : theme.success)};
-  font-size: 14px;
-  font-style: italic;
-  font-weight: normal;
-`;
-
-const StyledFieldWithValidation = styled(StyledField)<{ $isValid?: boolean | null }>`
-  > input {
-    border-color: ${({ $isValid, theme }) => {
-      if ($isValid === true) return theme.success;
-      if ($isValid === false) return theme.error;
-      return "inherit";
-    }};
-  }
-`;
-
-const Court: React.FC = () => {
-  const { disputeData, setDisputeData } = useNewDisputeContext();
-  const { data: courtTree } = useCourtTree();
-  const { data: supportedDisputeKits } = useSupportedDisputeKits(disputeData.courtId);
-  const items = useMemo(() => !isUndefined(courtTree?.court) && [rootCourtToItems(courtTree.court)], [courtTree]);
-  const { availableDisputeKits } = useDisputeKitAddressesAll();
-
-  const disputeKitOptions = useMemo(() => {
-    return (
-      supportedDisputeKits?.court?.supportedDisputeKits.map((dk) => {
-        const text = availableDisputeKits[dk.address.toLowerCase()] ?? "";
-        return {
-          text,
-          value: Number(dk.id),
-          gated: text === DisputeKits.Gated || text === DisputeKits.GatedShutter,
-        };
-      }) || []
-    );
-  }, [supportedDisputeKits, availableDisputeKits]);
-
-  const isGatedDisputeKit = useMemo(() => {
-    const options = disputeKitOptions.find((dk) => String(dk.value) === String(disputeData.disputeKitId));
-    return options?.gated ?? false;
-  }, [disputeKitOptions, disputeData.disputeKitId]);
-
-  // Token validation for token gate address (conditional based on ERC1155 checkbox)
-  const tokenGateAddress = (disputeData.disputeKitData as IGatedDisputeData)?.tokenGate ?? "";
-  const isERC1155 = (disputeData.disputeKitData as IGatedDisputeData)?.isERC1155 ?? false;
-  const validationEnabled = isGatedDisputeKit && !!tokenGateAddress.trim();
-
-  const {
-    isValidating: isValidatingERC20,
-    isValid: isValidERC20,
-    error: validationErrorERC20,
-  } = useERC20ERC721Validation({
-    address: tokenGateAddress,
-    enabled: validationEnabled && !isERC1155,
-  });
-
-  const {
-    isValidating: isValidatingERC1155,
-    isValid: isValidERC1155,
-    error: validationErrorERC1155,
-  } = useERC1155Validation({
-    address: tokenGateAddress,
-    enabled: validationEnabled && isERC1155,
-  });
-
-  // Combine validation results based on token type
-  const isValidating = isERC1155 ? isValidatingERC1155 : isValidatingERC20;
-  const isValidToken = isERC1155 ? isValidERC1155 : isValidERC20;
-  const validationError = isERC1155 ? validationErrorERC1155 : validationErrorERC20;
-
-  // Update validation state in dispute context
-  useEffect(() => {
-    if (isGatedDisputeKit && disputeData.disputeKitData) {
-      const currentData = disputeData.disputeKitData as IGatedDisputeData;
-      if (currentData.isTokenGateValid !== isValidToken) {
-        setDisputeData({
-          ...disputeData,
-          disputeKitData: { ...currentData, isTokenGateValid: isValidToken },
-        });
-      }
-    }
-  }, [isValidToken, isGatedDisputeKit, disputeData.disputeKitData, setDisputeData]);
-
-  const handleCourtChange = (courtId: string) => {
-    if (disputeData.courtId !== courtId) {
-      setDisputeData({ ...disputeData, courtId, disputeKitId: undefined });
-    }
-  };
-
-  const handleDisputeKitChange = (newValue: string | number) => {
-    const options = disputeKitOptions.find((dk) => String(dk.value) === String(newValue));
-    const gatedDisputeKitData: IGatedDisputeData | undefined =
-      (options?.gated ?? false)
-        ? {
-            type: "gated",
-            tokenGate: "",
-            isERC1155: false,
-            tokenId: "0",
-          }
-        : undefined;
-    setDisputeData({ ...disputeData, disputeKitId: Number(newValue), disputeKitData: gatedDisputeKitData });
-  };
-
-  const handleTokenAddressChange = (event: React.ChangeEvent<HTMLInputElement>) => {
-    const currentData = disputeData.disputeKitData as IGatedDisputeData;
-    setDisputeData({
-      ...disputeData,
-      disputeKitData: {
-        ...currentData,
-        tokenGate: event.target.value,
-        isTokenGateValid: null, // Reset validation state when address changes
-      },
-    });
-  };
-
-  const handleERC1155TokenChange = (event: React.ChangeEvent<HTMLInputElement>) => {
-    const currentData = disputeData.disputeKitData as IGatedDisputeData;
-    setDisputeData({
-      ...disputeData,
-      disputeKitData: {
-        ...currentData,
-        isERC1155: event.target.checked,
-        isTokenGateValid: null, // Reset validation state when token type changes
-      },
-    });
-  };
-
-  const handleTokenIdChange = (event: React.ChangeEvent<HTMLInputElement>) => {
-    const currentData = disputeData.disputeKitData as IGatedDisputeData;
-    setDisputeData({
-      ...disputeData,
-      disputeKitData: { ...currentData, tokenId: event.target.value },
-    });
-  };
-
-  return (
-    <Container>
-      <Header text="Select a court to arbitrate the case" />
-      {items ? (
-        <StyledDropdownCascader
-          items={items}
-          onSelect={(path: string | number) => typeof path === "string" && handleCourtChange(path.split("/").pop()!)}
-          placeholder="Select Court"
-          value={`/courts/${disputeData.courtId}`}
-        />
-      ) : (
-        <StyledSkeleton width={240} height={42} />
-      )}
-      {disputeData?.courtId && disputeKitOptions.length > 0 && (
-        <StyledDropdownSelect
-          items={disputeKitOptions}
-          placeholder={{ text: "Select Dispute Kit" }}
-          defaultValue={disputeData.disputeKitId}
-          callback={handleDisputeKitChange}
-        />
-      )}
-      {isGatedDisputeKit && (
-        <>
-          <StyledFieldWithValidation
-            dir="auto"
-            onChange={handleTokenAddressChange}
-            value={(disputeData.disputeKitData as IGatedDisputeData)?.tokenGate ?? ""}
-            placeholder="Eg. 0xda10009cbd5d07dd0cecc66161fc93d7c9000da1"
-            $isValid={isValidToken}
-          />
-          {tokenGateAddress.trim() !== "" && (
-            <ValidationContainer>
-              <ValidationIcon $isValidating={isValidating} $isValid={isValidToken} />
-              <ValidationMessage $isError={Boolean(validationError)}>
-                {isValidating && `Validating ${isERC1155 ? "ERC-1155" : "ERC-20 or ERC-721"} token...`}
-                {validationError && validationError}
-                {isValidToken === true && `Valid ${isERC1155 ? "ERC-1155" : "ERC-20 or ERC-721"} token`}
-              </ValidationMessage>
-            </ValidationContainer>
-          )}
-          <StyledCheckbox
-            onChange={handleERC1155TokenChange}
-            checked={(disputeData.disputeKitData as IGatedDisputeData)?.isERC1155 ?? false}
-            label="ERC-1155 token"
-            small={true}
-          />
-          {(disputeData.disputeKitData as IGatedDisputeData)?.isERC1155 && (
-            <StyledField
-              dir="auto"
-              onChange={handleTokenIdChange}
-              value={(disputeData.disputeKitData as IGatedDisputeData)?.tokenId ?? "0"}
-              placeholder="Eg. 1"
-            />
-          )}
-        </>
-      )}
-      <AlertMessageContainer>
-        <AlertMessage
-          title="Check the courts available beforehand"
-          msg="Kleros has different courts arbitrating disputes in several areas. Each court has its own purpose and policy. Take some time to choose the best court for your case. Learn more about the available courts here."
-          variant="info"
-        />
-      </AlertMessageContainer>
-      <NavigationButtons prevRoute="/resolver/description" nextRoute="/resolver/category" />
-    </Container>
-  );
-};
-
-export default Court;
diff --git a/web/src/pages/Resolver/Parameters/Court/FeatureSelection/JurorEligibility.tsx b/web/src/pages/Resolver/Parameters/Court/FeatureSelection/JurorEligibility.tsx
new file mode 100644
index 000000000..3e1febbd4
--- /dev/null
+++ b/web/src/pages/Resolver/Parameters/Court/FeatureSelection/JurorEligibility.tsx
@@ -0,0 +1,248 @@
+import React, { useEffect, useMemo, useState } from "react";
+import styled from "styled-components";
+
+import { Field, Radio } from "@kleros/ui-components-library";
+
+import { IGatedDisputeData, useNewDisputeContext } from "context/NewDisputeContext";
+import { useERC1155Validation, useERC20ERC721Validation } from "hooks/useTokenAddressValidation";
+
+import { DisputeKits } from "src/consts";
+import { isUndefined } from "src/utils";
+
+import WithHelpTooltip from "components/WithHelpTooltip";
+
+const Container = styled.div`
+  width: 100%;
+  display: flex;
+  flex-direction: column;
+  gap: 16px;
+  align-items: start;
+  padding-top: 16px;
+`;
+
+const HeaderContainer = styled.div`
+  width: 100%;
+  padding-top: 16px;
+`;
+
+const Header = styled.h2`
+  font-size: 16px;
+  font-weight: 600;
+  margin: 0;
+`;
+
+const SubTitle = styled.p`
+  font-size: 14px;
+  color: ${({ theme }) => theme.secondaryText};
+  padding: 0;
+  margin: 0;
+`;
+
+const FieldContainer = styled.div`
+  width: 100%;
+  padding-left: 32px;
+`;
+const StyledField = styled(Field)`
+  width: 100%;
+  margin-top: 8px;
+  margin-bottom: 32px;
+  > small {
+    margin-top: 16px;
+  }
+`;
+
+const StyledRadio = styled(Radio)`
+  font-size: 14px;
+`;
+
+enum EligibilityType {
+  Classic,
+  GatedERC20,
+  GatedERC1155,
+}
+
+const JurorEligibility: React.FC = () => {
+  const [eligibilityType, setEligibilityType] = useState<EligibilityType>();
+  const { disputeData, setDisputeData, disputeKitOptions } = useNewDisputeContext();
+
+  const tokenGateAddress = (disputeData.disputeKitData as IGatedDisputeData)?.tokenGate ?? "";
+  const validationEnabled = !isUndefined(tokenGateAddress) && tokenGateAddress.trim() !== "";
+  const isERC1155 = eligibilityType === EligibilityType.GatedERC1155;
+  const {
+    isValidating: isValidatingERC20,
+    isValid: isValidERC20,
+    error: validationErrorERC20,
+  } = useERC20ERC721Validation({
+    address: tokenGateAddress,
+    enabled: validationEnabled && !isERC1155,
+  });
+
+  const {
+    isValidating: isValidatingERC1155,
+    isValid: isValidERC1155,
+    error: validationErrorERC1155,
+  } = useERC1155Validation({
+    address: tokenGateAddress,
+    enabled: validationEnabled && isERC1155,
+  });
+
+  // Combine validation results based on token type
+  const isValidating = isERC1155 ? isValidatingERC1155 : isValidatingERC20;
+  const isValidToken = isERC1155 ? isValidERC1155 : isValidERC20;
+  const validationError = isERC1155 ? validationErrorERC1155 : validationErrorERC20;
+
+  const [validationMessage, variant] = useMemo(() => {
+    if (isValidating) return [`Validating ${isERC1155 ? "ERC-1155" : "ERC-20 or ERC-721"} token...`, "info"];
+    else if (validationError) return [validationError, "error"];
+    else if (isValidToken === true) return [`Valid ${isERC1155 ? "ERC-1155" : "ERC-20 or ERC-721"} token`, "success"];
+    else return [undefined, "info"];
+  }, [isValidating, validationError, isERC1155, isValidToken]);
+
+  // Update validation state in dispute context
+  useEffect(() => {
+    if (disputeData.disputeKitData) {
+      const currentData = disputeData.disputeKitData as IGatedDisputeData;
+      if (currentData.isTokenGateValid !== isValidToken) {
+        setDisputeData({
+          ...disputeData,
+          disputeKitData: { ...currentData, isTokenGateValid: isValidToken },
+        });
+      }
+    }
+  }, [isValidToken, disputeData.disputeKitData, setDisputeData]);
+
+  const handleTokenAddressChange = (event: React.ChangeEvent<HTMLInputElement>) => {
+    const currentData = disputeData.disputeKitData as IGatedDisputeData;
+    setDisputeData({
+      ...disputeData,
+      disputeKitData: {
+        ...currentData,
+        tokenGate: event.target.value,
+        isTokenGateValid: null, // Reset validation state when address changes
+      },
+    });
+  };
+
+  const handleTokenIdChange = (event: React.ChangeEvent<HTMLInputElement>) => {
+    const currentData = disputeData.disputeKitData as IGatedDisputeData;
+    setDisputeData({
+      ...disputeData,
+      disputeKitData: { ...currentData, tokenId: event.target.value },
+    });
+  };
+
+  useEffect(() => {
+    if (eligibilityType === EligibilityType.Classic) {
+      const disputeKit = disputeKitOptions.find((dk) => dk.text === DisputeKits.Classic);
+
+      setDisputeData({ ...disputeData, disputeKitId: disputeKit?.value, disputeKitData: undefined });
+    } else if (eligibilityType === EligibilityType.GatedERC20 || eligibilityType === EligibilityType.GatedERC1155) {
+      const disputeKitGated = disputeKitOptions.find((dk) => dk.text === DisputeKits.Gated);
+      const disputeKitGatedShutter = disputeKitOptions.find((dk) => dk.text === DisputeKits.GatedShutter);
+
+      const currentDisputeKit = disputeKitOptions.find((dk) => dk.value === disputeData.disputeKitId);
+
+      const disputeKitData: IGatedDisputeData = {
+        ...(disputeData.disputeKitData as IGatedDisputeData),
+        type: "gated",
+        isERC1155: eligibilityType === EligibilityType.GatedERC1155,
+      };
+      // classic is selected, so here we change it to TokenGated
+      if (currentDisputeKit?.text === DisputeKits.Classic) {
+        setDisputeData({
+          ...disputeData,
+          disputeKitId: disputeKitGated?.value,
+          disputeKitData,
+        });
+      }
+      // shutter is selected, so here we change it to TokenGatedShutter
+      else if (currentDisputeKit?.text === DisputeKits.Shutter) {
+        setDisputeData({
+          ...disputeData,
+          disputeKitId: disputeKitGatedShutter?.value,
+          disputeKitData,
+        });
+      } else {
+        setDisputeData({
+          ...disputeData,
+          disputeKitId: disputeKitGated?.value,
+          disputeKitData,
+        });
+      }
+    }
+  }, [eligibilityType, disputeKitOptions]);
+
+  return (
+    <Container>
+      <HeaderContainer>
+        <Header>Jurors Eligibility</Header>
+        <SubTitle>Who can be selected as a juror?.</SubTitle>
+      </HeaderContainer>
+
+      <StyledRadio
+        label="All the jurors in this court"
+        name="classicEligibility"
+        small
+        onChange={() => setEligibilityType(EligibilityType.Classic)}
+        checked={eligibilityType === EligibilityType.Classic}
+      />
+
+      <WithHelpTooltip
+        tooltipMsg="Only jurors who possess the token or NFT indicated below can be selected as jurors for this case.
+        Add the token address below."
+      >
+        <StyledRadio
+          label="Jurors owning at least 1 token ERC-20 or ERC-721"
+          name="erc20Gated"
+          small
+          onChange={() => setEligibilityType(EligibilityType.GatedERC20)}
+          checked={eligibilityType === EligibilityType.GatedERC20}
+        />
+      </WithHelpTooltip>
+      {eligibilityType === EligibilityType.GatedERC20 ? (
+        <FieldContainer>
+          <StyledField
+            dir="auto"
+            onChange={handleTokenAddressChange}
+            value={tokenGateAddress}
+            placeholder="Eg. 0xda10009cbd5d07dd0cecc66161fc93d7c9000da1"
+            variant={variant}
+            message={validationMessage}
+          />
+        </FieldContainer>
+      ) : null}
+      <WithHelpTooltip
+        tooltipMsg="Only jurors who possess the token or NFT indicated below can be selected as jurors for this case.
+        Add the token address below."
+      >
+        <StyledRadio
+          label="Jurors owning at least 1 token ERC-1155"
+          name="erc1155Gated"
+          small
+          onChange={() => setEligibilityType(EligibilityType.GatedERC1155)}
+          checked={eligibilityType === EligibilityType.GatedERC1155}
+        />
+      </WithHelpTooltip>
+      {eligibilityType === EligibilityType.GatedERC1155 ? (
+        <FieldContainer>
+          <StyledField
+            dir="auto"
+            onChange={handleTokenAddressChange}
+            value={tokenGateAddress}
+            placeholder="Eg. 0xda10009cbd5d07dd0cecc66161fc93d7c9000da1"
+            variant={variant}
+            message={validationMessage}
+          />
+          <StyledField
+            dir="auto"
+            onChange={handleTokenIdChange}
+            value={(disputeData.disputeKitData as IGatedDisputeData)?.tokenId ?? "0"}
+            placeholder="Eg. 1"
+          />
+        </FieldContainer>
+      ) : null}
+    </Container>
+  );
+};
+
+export default JurorEligibility;
diff --git a/web/src/pages/Resolver/Parameters/Court/FeatureSelection/ShieldedVoting.tsx b/web/src/pages/Resolver/Parameters/Court/FeatureSelection/ShieldedVoting.tsx
new file mode 100644
index 000000000..85a5caf98
--- /dev/null
+++ b/web/src/pages/Resolver/Parameters/Court/FeatureSelection/ShieldedVoting.tsx
@@ -0,0 +1,107 @@
+import React, { useEffect, useState } from "react";
+import styled from "styled-components";
+
+import { Radio } from "@kleros/ui-components-library";
+
+import { useNewDisputeContext } from "context/NewDisputeContext";
+
+import { DisputeKits } from "src/consts";
+
+import WithHelpTooltip from "components/WithHelpTooltip";
+
+const VotingContainer = styled.div`
+  width: 100%;
+  display: flex;
+  flex-direction: column;
+  gap: 16px;
+  align-items: start;
+  border-bottom: 1px solid ${({ theme }) => theme.stroke};
+  padding-bottom: 16px;
+`;
+
+const VotingHeaderContainer = styled.div`
+  width: 100%;
+  padding-top: 16px;
+`;
+
+const VotingHeader = styled.h2`
+  font-size: 16px;
+  font-weight: 600;
+  margin: 0;
+`;
+
+const VotingSubTitle = styled.p`
+  font-size: 14px;
+  color: ${({ theme }) => theme.secondaryText};
+  padding: 0;
+  margin: 0;
+`;
+
+const StyledRadio = styled(Radio)`
+  font-size: 14px;
+`;
+
+enum VotingType {
+  OneStep = "Shutter",
+  TwoStep = "Classic",
+}
+
+// Selects one of Classic or Shutter DisputeKit
+const ShieldedVoting: React.FC = () => {
+  const [votingType, setVotingType] = useState<VotingType>();
+  const { disputeData, setDisputeData, disputeKitOptions } = useNewDisputeContext();
+
+  // we try to keep this structure among feature components
+  // keep in mind the other options that will need to be disabled if a certain feature is selected
+  useEffect(() => {
+    // disable TokenGatedShutter if selected, if TokenGated Selected do nothing
+    if (votingType === VotingType.TwoStep && disputeData.disputeKitData?.type !== "gated") {
+      const disputeKit = disputeKitOptions.find((dk) => dk.text === DisputeKits.Classic);
+
+      setDisputeData({ ...disputeData, disputeKitId: disputeKit?.value });
+    }
+
+    if (votingType === VotingType.OneStep) {
+      // user has already selected TokenGated, so selecting Shutter here, we need to select TokenGatedShutter
+      if (disputeData.disputeKitData?.type === "gated") {
+        const disputeKit = disputeKitOptions.find((dk) => dk.text === DisputeKits.GatedShutter);
+
+        // no need to set DisputeKitData, will already be set by JurorEligibility
+        setDisputeData({ ...disputeData, disputeKitId: disputeKit?.value });
+      } else {
+        const disputeKit = disputeKitOptions.find((dk) => dk.text === DisputeKits.Shutter);
+
+        setDisputeData({ ...disputeData, disputeKitId: disputeKit?.value });
+      }
+    }
+  }, [votingType]);
+
+  return (
+    <VotingContainer>
+      <VotingHeaderContainer>
+        <VotingHeader>Shielded Voting</VotingHeader>
+        <VotingSubTitle>It hides the jurors&apos; votes until the end of the voting period.</VotingSubTitle>
+      </VotingHeaderContainer>
+      <WithHelpTooltip tooltipMsg="The jurors’ votes are hidden. Nobody can see them before the voting period completes. (It takes place in one step via Shutter Network) ">
+        <StyledRadio
+          label="Single-step via Shutter Network"
+          name="shieldedVoting"
+          small
+          onChange={() => setVotingType(VotingType.OneStep)}
+          checked={votingType === VotingType.OneStep}
+        />
+      </WithHelpTooltip>
+      <WithHelpTooltip tooltipMsg="The jurors’ votes are hidden. Nobody can see them before the voting period completes. (It takes place in two steps commit-reveal) ">
+        <StyledRadio
+          label="Two-steps commit-reveal"
+          name="shieldedVoting"
+          small
+          onChange={() => setVotingType(VotingType.TwoStep)}
+          checked={votingType === VotingType.TwoStep}
+        />
+      </WithHelpTooltip>
+    </VotingContainer>
+  );
+};
+
+export default ShieldedVoting;
diff --git a/web/src/pages/Resolver/Parameters/Court/FeatureSelection/index.tsx b/web/src/pages/Resolver/Parameters/Court/FeatureSelection/index.tsx
new file mode 100644
index 000000000..8fdb8d7af
--- /dev/null
+++ b/web/src/pages/Resolver/Parameters/Court/FeatureSelection/index.tsx
@@ -0,0 +1,71 @@
+import React, { useEffect, useMemo, useState } from "react";
+import styled from "styled-components";
+
+import { Card } from "@kleros/ui-components-library";
+
+import { useNewDisputeContext } from "context/NewDisputeContext";
+
+import { DisputeKits } from "src/consts";
+
+import JurorEligibility from "./JurorEligibility";
+import ShieldedVoting from "./ShieldedVoting";
+
+const Container = styled(Card)`
+  width: 100%;
+  height: auto;
+  padding: 32px;
+  display: flex;
+  flex-direction: column;
+  margin-top: 16px;
+`;
+
+const SubTitle = styled.p`
+  font-size: 14px;
+  color: ${({ theme }) => theme.secondaryBlue};
+  padding: 0;
+  margin: 0;
+`;
+
+const FeatureSelection: React.FC = () => {
+  const [showFeatures, setShowFeatures] = useState(false);
+  const { disputeKitOptions, disputeData, setDisputeData } = useNewDisputeContext();
+
+  // if supported dispute kits have Classic and Shutter
+  const showVotingFeatures = useMemo(() => {
+    return (
+      disputeKitOptions.some((dk) => dk.text === DisputeKits.Classic) &&
+      disputeKitOptions.some((dk) => dk.text === DisputeKits.Shutter)
+    );
+  }, [disputeKitOptions]);
+
+  // if supported dispute kits have Classic, TokenGated, TokenGatedShutter
+  const showEligibilityFeatures = useMemo(() => {
+    return (
+      disputeKitOptions.some((dk) => dk.text === DisputeKits.Classic) &&
+      disputeKitOptions.some((dk) => dk.text === DisputeKits.GatedShutter) &&
+      disputeKitOptions.some((dk) => dk.text === DisputeKits.Gated)
+    );
+  }, [disputeKitOptions]);
+
+  useEffect(() => {
+    // there's only one, NOTE: what happens when here only TokenGated is support? we need the value
+    if (disputeKitOptions.length === 1) {
+      const disputeKit = disputeKitOptions[0];
+      setDisputeData({ ...disputeData, disputeKitId: disputeKit.value });
+      setShowFeatures(false);
+    } else {
+      setShowFeatures(true);
+    }
+  }, [disputeKitOptions]);
+
+  if (!showFeatures) return null;
+  return (
+    <Container>
+      <SubTitle>Additional features available in this court:</SubTitle>
+      {showVotingFeatures ? <ShieldedVoting /> : null}
+      {showEligibilityFeatures ? <JurorEligibility /> : null}
+    </Container>
+  );
+};
+
+export default FeatureSelection;
diff --git a/web/src/pages/Resolver/Parameters/Court/index.tsx b/web/src/pages/Resolver/Parameters/Court/index.tsx
new file mode 100644
index 000000000..4e50c0bdc
--- /dev/null
+++ b/web/src/pages/Resolver/Parameters/Court/index.tsx
@@ -0,0 +1,92 @@
+import React, { useMemo } from "react";
+import styled, { css } from "styled-components";
+
+import { AlertMessage, DropdownCascader } from "@kleros/ui-components-library";
+
+import { useNewDisputeContext } from "context/NewDisputeContext";
+import { rootCourtToItems, useCourtTree } from "hooks/queries/useCourtTree";
+import { isUndefined } from "utils/index";
+
+import { landscapeStyle } from "styles/landscapeStyle";
+import { responsiveSize } from "styles/responsiveSize";
+
+import { StyledSkeleton } from "components/StyledSkeleton";
+import Header from "pages/Resolver/Header";
+
+import NavigationButtons from "../../NavigationButtons";
+
+import FeatureSelection from "./FeatureSelection";
+
+const Container = styled.div`
+  display: flex;
+  flex-direction: column;
+  align-items: center;
+
+  ${landscapeStyle(
+    () => css`
+      padding-bottom: 115px;
+    `
+  )}
+`;
+
+const StyledDropdownCascader = styled(DropdownCascader)`
+  width: 84vw;
+  ${landscapeStyle(
+    () => css`
+      width: ${responsiveSize(442, 700, 900)};
+    `
+  )}
+  > button {
+    width: 100%;
+  }
+`;
+
+const AlertMessageContainer = styled.div`
+  width: 84vw;
+  ${landscapeStyle(
+    () => css`
+      width: ${responsiveSize(442, 700, 900)};
+    `
+  )}
+  margin-top: 24px;
+`;
+
+const Court: React.FC = () => {
+  const { disputeData, setDisputeData } = useNewDisputeContext();
+  const { data: courtTree } = useCourtTree();
+  const items = useMemo(() => !isUndefined(courtTree?.court) && [rootCourtToItems(courtTree.court)], [courtTree]);
+
+  const handleCourtChange = (courtId: string) => {
+    if (disputeData.courtId !== courtId) {
+      setDisputeData({ ...disputeData, courtId, disputeKitId: undefined });
+    }
+  };
+
+  return (
+    <Container>
+      <Header text="Select a court to arbitrate the case" />
+      {items ? (
+        <StyledDropdownCascader
+          items={items}
+          onSelect={(path: string | number) => typeof path === "string" && handleCourtChange(path.split("/").pop()!)}
+          placeholder="Select Court"
+          value={`/courts/${disputeData.courtId}`}
+        />
+      ) : (
+        <StyledSkeleton width={240} height={42} />
+      )}
+
+      <AlertMessageContainer>
+        <AlertMessage
+          title="Check the courts available beforehand"
+          msg="Kleros has different courts arbitrating disputes in several areas. Each court has its own purpose and policy. Take some time to choose the best court for your case. Learn more about the available courts here."
+          variant="info"
+        />
+      </AlertMessageContainer>
+      <FeatureSelection />
+      <NavigationButtons prevRoute="/resolver/description" nextRoute="/resolver/category" />
+    </Container>
+  );
+};
+
+export default Court;

From 14fedbb966cc088d5ec7c4103740b74e26d31b2b Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Tue, 2 Sep 2025 23:20:04 +0100
Subject: [PATCH 074/175] fix: minStake check after setStakePenalty should
 return the remaining PNK to the juror

---
 contracts/src/arbitration/KlerosCoreBase.sol  | 22 +++--
 contracts/src/arbitration/KlerosCoreNeo.sol   |  2 +-
 .../src/arbitration/SortitionModuleBase.sol   | 25 ++++--
 .../src/arbitration/SortitionModuleNeo.sol    |  5 +-
 .../interfaces/ISortitionModule.sol           |  7 +-
 .../university/KlerosCoreUniversity.sol       | 18 ++--
 .../university/SortitionModuleUniversity.sol  | 17 +++-
 .../test/foundry/KlerosCore_Execution.t.sol   | 82 +++++++++++++++++--
 8 files changed, 148 insertions(+), 30 deletions(-)

diff --git a/contracts/src/arbitration/KlerosCoreBase.sol b/contracts/src/arbitration/KlerosCoreBase.sol
index f8b7f028b..d6821b59c 100644
--- a/contracts/src/arbitration/KlerosCoreBase.sol
+++ b/contracts/src/arbitration/KlerosCoreBase.sol
@@ -464,16 +464,16 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
     /// @param _newStake The new stake.
     /// Note that the existing delayed stake will be nullified as non-relevant.
     function setStake(uint96 _courtID, uint256 _newStake) external virtual whenNotPaused {
-        _setStake(msg.sender, _courtID, _newStake, OnError.Revert);
+        _setStake(msg.sender, _courtID, _newStake, false, OnError.Revert);
     }
 
-    /// @dev Sets the stake of a specified account in a court, typically to apply a delayed stake or unstake inactive jurors.
+    /// @dev Sets the stake of a specified account in a court without delaying stake changes, typically to apply a delayed stake or unstake inactive jurors.
     /// @param _account The account whose stake is being set.
     /// @param _courtID The ID of the court.
     /// @param _newStake The new stake.
     function setStakeBySortitionModule(address _account, uint96 _courtID, uint256 _newStake) external {
         if (msg.sender != address(sortitionModule)) revert SortitionModuleOnly();
-        _setStake(_account, _courtID, _newStake, OnError.Return);
+        _setStake(_account, _courtID, _newStake, true, OnError.Return);
     }
 
     /// @dev Transfers PNK to the juror by SortitionModule.
@@ -796,10 +796,10 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
 
         if (pnkBalance == 0 || !disputeKit.isVoteActive(_params.disputeID, _params.round, _params.repartition)) {
             // The juror is inactive or their balance is can't cover penalties anymore, unstake them from all courts.
-            sortitionModule.setJurorInactive(account);
+            sortitionModule.unstakeByCoreFromAllCourts(account);
         } else if (newCourtStake < courts[penalizedInCourtID].minStake) {
             // The juror's balance fell below the court minStake, unstake them from the court.
-            sortitionModule.setStake(account, penalizedInCourtID, 0, 0, 0);
+            sortitionModule.unstakeByCore(account, penalizedInCourtID);
         }
 
         if (_params.repartition == _params.numberOfVotesInRound - 1 && _params.coherentCount == 0) {
@@ -1138,9 +1138,16 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
     /// @param _account The account to set the stake for.
     /// @param _courtID The ID of the court to set the stake for.
     /// @param _newStake The new stake.
+    /// @param _noDelay True if the stake change should not be delayed.
     /// @param _onError Whether to revert or return false on error.
     /// @return Whether the stake was successfully set or not.
-    function _setStake(address _account, uint96 _courtID, uint256 _newStake, OnError _onError) internal returns (bool) {
+    function _setStake(
+        address _account,
+        uint96 _courtID,
+        uint256 _newStake,
+        bool _noDelay,
+        OnError _onError
+    ) internal returns (bool) {
         if (_courtID == FORKING_COURT || _courtID >= courts.length) {
             _stakingFailed(_onError, StakingResult.CannotStakeInThisCourt); // Staking directly into the forking court is not allowed.
             return false;
@@ -1152,7 +1159,8 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
         (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult) = sortitionModule.validateStake(
             _account,
             _courtID,
-            _newStake
+            _newStake,
+            _noDelay
         );
         if (stakingResult != StakingResult.Successful && stakingResult != StakingResult.Delayed) {
             _stakingFailed(_onError, stakingResult);
diff --git a/contracts/src/arbitration/KlerosCoreNeo.sol b/contracts/src/arbitration/KlerosCoreNeo.sol
index a72319fc5..ebfd1bb72 100644
--- a/contracts/src/arbitration/KlerosCoreNeo.sol
+++ b/contracts/src/arbitration/KlerosCoreNeo.sol
@@ -108,7 +108,7 @@ contract KlerosCoreNeo is KlerosCoreBase {
     /// Note that the existing delayed stake will be nullified as non-relevant.
     function setStake(uint96 _courtID, uint256 _newStake) external override whenNotPaused {
         if (jurorNft.balanceOf(msg.sender) == 0) revert NotEligibleForStaking();
-        super._setStake(msg.sender, _courtID, _newStake, OnError.Revert);
+        super._setStake(msg.sender, _courtID, _newStake, false, OnError.Revert);
     }
 
     // ************************************* //
diff --git a/contracts/src/arbitration/SortitionModuleBase.sol b/contracts/src/arbitration/SortitionModuleBase.sol
index 58e5bb564..59c394722 100644
--- a/contracts/src/arbitration/SortitionModuleBase.sol
+++ b/contracts/src/arbitration/SortitionModuleBase.sol
@@ -232,21 +232,24 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
     /// @param _account The address of the juror.
     /// @param _courtID The ID of the court.
     /// @param _newStake The new stake.
+    /// @param _noDelay True if the stake change should not be delayed.
     /// @return pnkDeposit The amount of PNK to be deposited.
     /// @return pnkWithdrawal The amount of PNK to be withdrawn.
     /// @return stakingResult The result of the staking operation.
     function validateStake(
         address _account,
         uint96 _courtID,
-        uint256 _newStake
+        uint256 _newStake,
+        bool _noDelay
     ) external override onlyByCore returns (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult) {
-        (pnkDeposit, pnkWithdrawal, stakingResult) = _validateStake(_account, _courtID, _newStake);
+        (pnkDeposit, pnkWithdrawal, stakingResult) = _validateStake(_account, _courtID, _newStake, _noDelay);
     }
 
     function _validateStake(
         address _account,
         uint96 _courtID,
-        uint256 _newStake
+        uint256 _newStake,
+        bool _noDelay
     ) internal virtual returns (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult) {
         Juror storage juror = jurors[_account];
         uint256 currentStake = stakeOf(_account, _courtID);
@@ -260,7 +263,7 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
             return (0, 0, StakingResult.CannotStakeZeroWhenNoStake); // Forbid staking 0 amount when current stake is 0 to avoid flaky behaviour.
         }
 
-        if (phase != Phase.staking) {
+        if (phase != Phase.staking && !_noDelay) {
             // Store the stake change as delayed, to be applied when the phase switches back to Staking.
             DelayedStake storage delayedStake = delayedStakes[++delayedStakeWriteIndex];
             delayedStake.account = _account;
@@ -433,13 +436,25 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
     /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
     /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
     /// @param _account The juror to unstake.
-    function setJurorInactive(address _account) external override onlyByCore {
+    function unstakeByCoreFromAllCourts(address _account) external override onlyByCore {
         uint96[] memory courtIDs = getJurorCourtIDs(_account);
         for (uint256 j = courtIDs.length; j > 0; j--) {
             core.setStakeBySortitionModule(_account, courtIDs[j - 1], 0);
         }
     }
 
+    /// @dev Unstakes the inactive juror from a specific court.
+    /// `O(n * (p * log_k(j)) )` where
+    /// `n` is the number of courts the juror has staked in,
+    /// `p` is the depth of the court tree,
+    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
+    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
+    /// @param _account The juror to unstake.
+    /// @param _courtID The ID of the court.
+    function unstakeByCore(address _account, uint96 _courtID) external override onlyByCore {
+        core.setStakeBySortitionModule(_account, _courtID, 0);
+    }
+
     /// @dev Gives back the locked PNKs in case the juror fully unstaked earlier.
     /// Note that since locked and staked PNK are async it is possible for the juror to have positive staked PNK balance
     /// while having 0 stake in courts and 0 locked tokens (eg. when the juror fully unstaked during dispute and later got his tokens unlocked).
diff --git a/contracts/src/arbitration/SortitionModuleNeo.sol b/contracts/src/arbitration/SortitionModuleNeo.sol
index d106d5d9b..7c2a3b53b 100644
--- a/contracts/src/arbitration/SortitionModuleNeo.sol
+++ b/contracts/src/arbitration/SortitionModuleNeo.sol
@@ -77,7 +77,8 @@ contract SortitionModuleNeo is SortitionModuleBase {
     function _validateStake(
         address _account,
         uint96 _courtID,
-        uint256 _newStake
+        uint256 _newStake,
+        bool _noDelay
     ) internal override onlyByCore returns (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult) {
         uint256 currentStake = stakeOf(_account, _courtID);
         bool stakeIncrease = _newStake > currentStake;
@@ -98,6 +99,6 @@ contract SortitionModuleNeo is SortitionModuleBase {
                 totalStaked -= stakeChange;
             }
         }
-        (pnkDeposit, pnkWithdrawal, stakingResult) = super._validateStake(_account, _courtID, _newStake);
+        (pnkDeposit, pnkWithdrawal, stakingResult) = super._validateStake(_account, _courtID, _newStake, _noDelay);
     }
 }
diff --git a/contracts/src/arbitration/interfaces/ISortitionModule.sol b/contracts/src/arbitration/interfaces/ISortitionModule.sol
index 39646dcb4..52a077ec3 100644
--- a/contracts/src/arbitration/interfaces/ISortitionModule.sol
+++ b/contracts/src/arbitration/interfaces/ISortitionModule.sol
@@ -18,7 +18,8 @@ interface ISortitionModule {
     function validateStake(
         address _account,
         uint96 _courtID,
-        uint256 _newStake
+        uint256 _newStake,
+        bool _noDelay
     ) external returns (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult);
 
     function setStake(
@@ -37,7 +38,9 @@ interface ISortitionModule {
 
     function setStakeReward(address _account, uint96 _courtID, uint256 _reward) external returns (bool success);
 
-    function setJurorInactive(address _account) external;
+    function unstakeByCoreFromAllCourts(address _account) external;
+
+    function unstakeByCore(address _account, uint96 _courtID) external;
 
     function lockStake(address _account, uint256 _relativeAmount) external;
 
diff --git a/contracts/src/arbitration/university/KlerosCoreUniversity.sol b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
index 57626a958..b75f16418 100644
--- a/contracts/src/arbitration/university/KlerosCoreUniversity.sol
+++ b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
@@ -452,7 +452,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
     /// @param _newStake The new stake.
     /// Note that the existing delayed stake will be nullified as non-relevant.
     function setStake(uint96 _courtID, uint256 _newStake) external {
-        _setStake(msg.sender, _courtID, _newStake, OnError.Revert);
+        _setStake(msg.sender, _courtID, _newStake, false, OnError.Revert);
     }
 
     /// @dev Sets the stake of a specified account in a court, typically to apply a delayed stake or unstake inactive jurors.
@@ -461,7 +461,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
     /// @param _newStake The new stake.
     function setStakeBySortitionModule(address _account, uint96 _courtID, uint256 _newStake) external {
         if (msg.sender != address(sortitionModule)) revert SortitionModuleOnly();
-        _setStake(_account, _courtID, _newStake, OnError.Return);
+        _setStake(_account, _courtID, _newStake, true, OnError.Return);
     }
 
     /// @dev Transfers PNK to the juror by SortitionModule.
@@ -791,7 +791,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
 
         if (pnkBalance == 0 || !disputeKit.isVoteActive(_params.disputeID, _params.round, _params.repartition)) {
             // The juror is inactive or their balance is can't cover penalties anymore, unstake them from all courts.
-            sortitionModule.setJurorInactive(account);
+            sortitionModule.unstakeByCoreFromAllCourts(account);
         } else if (newCourtStake < courts[penalizedInCourtID].minStake) {
             // The juror's balance fell below the court minStake, unstake them from the court.
             sortitionModule.setStake(account, penalizedInCourtID, 0, 0, 0);
@@ -1080,9 +1080,16 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
     /// @param _account The account to set the stake for.
     /// @param _courtID The ID of the court to set the stake for.
     /// @param _newStake The new stake.
+    /// @param _noDelay True if the stake change should not be delayed.
     /// @param _onError Whether to revert or return false on error.
     /// @return Whether the stake was successfully set or not.
-    function _setStake(address _account, uint96 _courtID, uint256 _newStake, OnError _onError) internal returns (bool) {
+    function _setStake(
+        address _account,
+        uint96 _courtID,
+        uint256 _newStake,
+        bool _noDelay,
+        OnError _onError
+    ) internal returns (bool) {
         if (_courtID == FORKING_COURT || _courtID >= courts.length) {
             _stakingFailed(_onError, StakingResult.CannotStakeInThisCourt); // Staking directly into the forking court is not allowed.
             return false;
@@ -1094,7 +1101,8 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult) = sortitionModule.validateStake(
             _account,
             _courtID,
-            _newStake
+            _newStake,
+            _noDelay
         );
         if (stakingResult != StakingResult.Successful) {
             _stakingFailed(_onError, stakingResult);
diff --git a/contracts/src/arbitration/university/SortitionModuleUniversity.sol b/contracts/src/arbitration/university/SortitionModuleUniversity.sol
index d6a220bf6..b127b7cf5 100644
--- a/contracts/src/arbitration/university/SortitionModuleUniversity.sol
+++ b/contracts/src/arbitration/university/SortitionModuleUniversity.sol
@@ -139,7 +139,8 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
     function validateStake(
         address _account,
         uint96 _courtID,
-        uint256 _newStake
+        uint256 _newStake,
+        bool /*_noDelay*/
     )
         external
         view
@@ -302,13 +303,25 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
     /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
     /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
     /// @param _account The juror to unstake.
-    function setJurorInactive(address _account) external override onlyByCore {
+    function unstakeByCoreFromAllCourts(address _account) external override onlyByCore {
         uint96[] memory courtIDs = getJurorCourtIDs(_account);
         for (uint256 j = courtIDs.length; j > 0; j--) {
             core.setStakeBySortitionModule(_account, courtIDs[j - 1], 0);
         }
     }
 
+    /// @dev Unstakes the inactive juror from a specific court.
+    /// `O(n * (p * log_k(j)) )` where
+    /// `n` is the number of courts the juror has staked in,
+    /// `p` is the depth of the court tree,
+    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
+    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
+    /// @param _account The juror to unstake.
+    /// @param _courtID The ID of the court.
+    function unstakeByCore(address _account, uint96 _courtID) external override onlyByCore {
+        core.setStakeBySortitionModule(_account, _courtID, 0);
+    }
+
     /// @dev Gives back the locked PNKs in case the juror fully unstaked earlier.
     /// Note that since locked and staked PNK are async it is possible for the juror to have positive staked PNK balance
     /// while having 0 stake in courts and 0 locked tokens (eg. when the juror fully unstaked during dispute and later got his tokens unlocked).
diff --git a/contracts/test/foundry/KlerosCore_Execution.t.sol b/contracts/test/foundry/KlerosCore_Execution.t.sol
index 4bf2a452a..c5763964e 100644
--- a/contracts/test/foundry/KlerosCore_Execution.t.sol
+++ b/contracts/test/foundry/KlerosCore_Execution.t.sol
@@ -16,7 +16,7 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
         uint256 disputeID = 0;
 
         vm.prank(staker1);
-        core.setStake(GENERAL_COURT, 1500);
+        core.setStake(GENERAL_COURT, 2000);
         vm.prank(disputer);
         arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
         vm.warp(block.timestamp + minStakingTime);
@@ -111,7 +111,7 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
         core.execute(disputeID, 0, 3); // Do 3 iterations to check penalties first
 
         (uint256 totalStaked, uint256 totalLocked, , ) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
-        assertEq(totalStaked, 500, "totalStaked should be penalized"); // 1500 - 1000
+        assertEq(totalStaked, 1000, "totalStaked should be penalized"); // 2000 - 1000
         assertEq(totalLocked, 0, "Tokens should be released for staker1");
         (, totalLocked, , ) = sortitionModule.getJurorBalance(staker2, GENERAL_COURT);
         assertEq(totalLocked, 2000, "Tokens should still be locked for staker2");
@@ -148,8 +148,8 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
         assertEq(staker1.balance, 0, "Wrong balance of the staker1");
         assertEq(staker2.balance, 0.09 ether, "Wrong balance of the staker2");
 
-        assertEq(pinakion.balanceOf(address(core)), 21500, "Wrong token balance of the core"); // Was 21500. 1000 was transferred to staker2
-        assertEq(pinakion.balanceOf(staker1), 999999999999998500, "Wrong token balance of staker1");
+        assertEq(pinakion.balanceOf(address(core)), 22000, "Wrong token balance of the core"); // Was 21500. 1000 was transferred to staker2
+        assertEq(pinakion.balanceOf(staker1), 999999999999998000, "Wrong token balance of staker1");
         assertEq(pinakion.balanceOf(staker2), 999999999999980000, "Wrong token balance of staker2"); // 20k stake and 1k added as a reward, thus -19k from the default
     }
 
@@ -213,8 +213,8 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
         assertEq(staker1.balance, 0, "Wrong balance of the staker1");
         assertEq(owner.balance, ownerBalance + 0.09 ether, "Wrong balance of the owner");
 
-        assertEq(pinakion.balanceOf(address(core)), 17000, "Wrong token balance of the core");
-        assertEq(pinakion.balanceOf(staker1), 999999999999980000, "Wrong token balance of staker1");
+        assertEq(pinakion.balanceOf(address(core)), 0, "Wrong token balance of the core"); // The inactive juror got unstaked regardless of the phase (`noDelay` is true)
+        assertEq(pinakion.balanceOf(staker1), 999999999999997000, "Wrong token balance of staker1");
         assertEq(pinakion.balanceOf(owner), ownerTokenBalance + 3000, "Wrong token balance of owner");
     }
 
@@ -345,6 +345,76 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
         assertEq(nbCourts, 0, "Should unstake from all courts");
     }
 
+    function test_execute_UnstakeBelowMinStake() public {
+        uint256 disputeID = 0;
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 1200);
+
+        vm.prank(staker2);
+        core.setStake(GENERAL_COURT, 10000);
+
+        assertEq(pinakion.balanceOf(address(core)), 11200, "Wrong token balance of the core");
+        assertEq(pinakion.balanceOf(staker1), 999999999999998800, "Wrong token balance of staker1");
+        assertEq(pinakion.balanceOf(staker2), 999999999999990000, "Wrong token balance of staker2");
+
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
+
+        (uint256 totalStaked, uint256 totalLocked, , uint256 nbCourts) = sortitionModule.getJurorBalance(
+            staker1,
+            GENERAL_COURT
+        );
+        assertEq(totalStaked, 1200, "Wrong totalStaked");
+        assertEq(totalLocked, 1000, "Wrong totalLocked"); // Juror only staked 1000 but will fall below minStake with a bad vote
+        assertEq(nbCourts, 1, "Wrong number of courts");
+
+        sortitionModule.passPhase(); // Staking phase. Change to staking so we don't have to deal with delayed stakes.
+
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Vote
+
+        uint256[] memory voteIDs = new uint256[](1);
+        voteIDs[0] = 0;
+        vm.prank(staker1);
+        disputeKit.castVote(disputeID, voteIDs, 1, 0, "XYZ"); // 1 incoherent vote should make the juror's stake below minStake
+
+        voteIDs = new uint256[](2);
+        voteIDs[0] = 1;
+        voteIDs[1] = 2;
+        vm.prank(staker2);
+        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
+
+        core.passPeriod(disputeID); // Appeal
+
+        vm.warp(block.timestamp + timesPerPeriod[3]);
+        core.passPeriod(disputeID); // Execution
+
+        vm.expectEmit(true, true, true, true);
+        emit SortitionModuleBase.StakeSet(staker1, GENERAL_COURT, 0, 0); // Juror balance should be below minStake and should be unstaked from the court automatically.
+        core.execute(disputeID, 0, 6);
+
+        assertEq(pinakion.balanceOf(address(core)), 11000, "Wrong token balance of the core");
+        assertEq(pinakion.balanceOf(staker1), 1 ether - 1000, "Wrong token balance of staker1"); // The juror should have his penalty back as a reward
+        assertEq(pinakion.balanceOf(staker2), 999999999999990000, "Wrong token balance of staker2"); // No change
+
+        (totalStaked, totalLocked, , nbCourts) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
+        assertEq(totalStaked, 0, "Wrong staker1 totalStaked");
+        assertEq(totalLocked, 0, "Wrong staker1 totalLocked");
+        assertEq(nbCourts, 0, "Wrong staker1 nbCourts");
+
+        (totalStaked, totalLocked, , nbCourts) = sortitionModule.getJurorBalance(staker2, GENERAL_COURT);
+        assertEq(totalStaked, 11000, "Wrong staker2 totalStaked");
+        assertEq(totalLocked, 0, "Wrong staker2 totalLocked");
+        assertEq(nbCourts, 1, "Wrong staker2 nbCourts");
+    }
+
     function test_execute_withdrawLeftoverPNK() public {
         // Return the previously locked tokens
         uint256 disputeID = 0;

From 63d3a642d0cd5602e4d20d2ae9035cca3d331eab Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 3 Sep 2025 00:38:03 +0100
Subject: [PATCH 075/175] test: cover dispute kit jump to non-classic scenario

---
 .../test/foundry/KlerosCore_Appeals.t.sol     | 149 +++++++++++++++++-
 1 file changed, 145 insertions(+), 4 deletions(-)

diff --git a/contracts/test/foundry/KlerosCore_Appeals.t.sol b/contracts/test/foundry/KlerosCore_Appeals.t.sol
index 189e9cb89..6421cb119 100644
--- a/contracts/test/foundry/KlerosCore_Appeals.t.sol
+++ b/contracts/test/foundry/KlerosCore_Appeals.t.sol
@@ -146,7 +146,7 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
         disputeKit.fundAppeal{value: 0.1 ether}(disputeID, 2);
     }
 
-    function test_appeal_fullFundingNoSwitch() public {
+    function test_appeal_fullFundingNoJump() public {
         uint256 disputeID = 0;
 
         vm.prank(staker1);
@@ -208,10 +208,12 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
         core.passPeriod(disputeID);
     }
 
-    function test_appeal_fullFundingDKCourtSwitch() public {
+    function test_appeal_fullFundingCourtJumpAndDKJumpToClassic() public {
+        // Setup: dk2 supported by court2 with dk2._jumpDisputeKitID == DISPUTE_KIT_CLASSIC
+        // Ensure that court2 jumps to GENERAL_COURT and dk2 jumps to DISPUTE_KIT_CLASSIC
         uint256 disputeID = 0;
         DisputeKitClassic dkLogic = new DisputeKitClassic();
-        // Create a new DK and court to check the switch
+        // Create a new DK and court to check the jump
         bytes memory initDataDk = abi.encodeWithSignature(
             "initialize(address,address,address,uint256)",
             owner,
@@ -250,6 +252,7 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
         supportedDK = new uint256[](1);
         supportedDK[0] = newDkID;
         core.enableDisputeKits(newCourtID, supportedDK, true);
+        assertEq(core.isSupported(newCourtID, newDkID), true, "New DK should be supported by new court");
 
         vm.prank(staker1);
         core.setStake(newCourtID, 20000);
@@ -279,7 +282,6 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
 
         vm.prank(crowdfunder1);
         newDisputeKit.fundAppeal{value: 0.63 ether}(disputeID, 1);
-        vm.prank(crowdfunder2);
 
         assertEq(core.isDisputeKitJumping(disputeID), true, "Should be jumping");
 
@@ -293,6 +295,7 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
         emit KlerosCoreBase.AppealDecision(disputeID, arbitrable);
         vm.expectEmit(true, true, true, true);
         emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.evidence);
+        vm.prank(crowdfunder2);
         newDisputeKit.fundAppeal{value: 0.42 ether}(disputeID, 2);
 
         (, bool jumped, ) = newDisputeKit.disputes(disputeID);
@@ -326,6 +329,144 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
         assertEq(account, staker1, "Wrong drawn account in the classic DK");
     }
 
+    function test_appeal_fullFundingCourtJumpAndDKJumpToNonClassic() public {
+        // Setup:
+        // dk2 supported by GENERAL_COURT, which is a non-DISPUTE_KIT_CLASSIC
+        // dk3 supported by court2, with dk3._jumpDisputeKitID == dk2
+        // Ensure that court2 jumps to GENERAL_COURT and dk3 jumps to dk2
+        uint256 disputeID = 0;
+        uint96 newCourtID = 2;
+        uint256 dkID2 = 2;
+        uint256 dkID3 = 3;
+
+        DisputeKitClassic dkLogic = new DisputeKitClassic();
+
+        bytes memory initDataDk2 = abi.encodeWithSignature(
+            "initialize(address,address,address,uint256)",
+            owner,
+            address(core),
+            address(wNative),
+            DISPUTE_KIT_CLASSIC
+        );
+        UUPSProxy proxyDk2 = new UUPSProxy(address(dkLogic), initDataDk2);
+        DisputeKitClassic disputeKit2 = DisputeKitClassic(address(proxyDk2));
+
+        bytes memory initDataDk3 = abi.encodeWithSignature(
+            "initialize(address,address,address,uint256)",
+            owner,
+            address(core),
+            address(wNative),
+            dkID2
+        );
+        UUPSProxy proxyDk3 = new UUPSProxy(address(dkLogic), initDataDk3);
+        DisputeKitClassic disputeKit3 = DisputeKitClassic(address(proxyDk3));
+
+        vm.prank(owner);
+        core.addNewDisputeKit(disputeKit2);
+        vm.prank(owner);
+        core.addNewDisputeKit(disputeKit3);
+
+        uint256[] memory supportedDK = new uint256[](2);
+        supportedDK[0] = DISPUTE_KIT_CLASSIC;
+        supportedDK[1] = dkID3;
+        vm.prank(owner);
+        core.createCourt(
+            GENERAL_COURT,
+            hiddenVotes,
+            minStake,
+            alpha,
+            feeForJuror,
+            3, // jurors for jump. Low number to ensure jump after the first appeal
+            [uint256(60), uint256(120), uint256(180), uint256(240)], // Times per period
+            sortitionExtraData,
+            supportedDK
+        );
+        assertEq(core.isSupported(newCourtID, dkID3), true, "dkID3 should be supported by new court");
+
+        vm.prank(owner);
+        supportedDK[0] = DISPUTE_KIT_CLASSIC;
+        supportedDK[1] = dkID2;
+        core.enableDisputeKits(GENERAL_COURT, supportedDK, true);
+        assertEq(core.isSupported(GENERAL_COURT, dkID2), true, "dkID2 should be supported by GENERAL_COURT");
+
+        bytes memory newExtraData = abi.encodePacked(uint256(newCourtID), DEFAULT_NB_OF_JURORS, dkID3);
+        arbitrable.changeArbitratorExtraData(newExtraData);
+
+        vm.prank(staker1);
+        core.setStake(newCourtID, 20000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 0);
+        assertEq(round.disputeKitID, dkID3, "Wrong DK ID");
+
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Vote
+
+        uint256[] memory voteIDs = new uint256[](3);
+        voteIDs[0] = 0;
+        voteIDs[1] = 1;
+        voteIDs[2] = 2;
+
+        vm.prank(staker1);
+        disputeKit3.castVote(disputeID, voteIDs, 2, 0, "XYZ");
+
+        core.passPeriod(disputeID); // Appeal
+
+        vm.prank(crowdfunder1);
+        disputeKit3.fundAppeal{value: 0.63 ether}(disputeID, 1);
+
+        assertEq(core.isDisputeKitJumping(disputeID), true, "Should be jumping");
+
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.CourtJump(disputeID, 1, newCourtID, GENERAL_COURT);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.DisputeKitJump(disputeID, 1, dkID3, dkID2);
+        vm.expectEmit(true, true, true, true);
+        emit DisputeKitClassicBase.DisputeCreation(disputeID, 2, newExtraData);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.AppealDecision(disputeID, arbitrable);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.evidence);
+        vm.prank(crowdfunder2);
+        disputeKit3.fundAppeal{value: 0.42 ether}(disputeID, 2);
+
+        (, bool jumped, ) = disputeKit3.disputes(disputeID);
+        assertEq(jumped, true, "jumped should be true");
+        assertEq(
+            (disputeKit3.getFundedChoices(disputeID)).length,
+            2,
+            "No fresh round created so the number of funded choices should be 2"
+        );
+
+        round = core.getRoundInfo(disputeID, 1);
+        assertEq(round.disputeKitID, dkID2, "Wrong DK ID");
+        assertEq(sortitionModule.disputesWithoutJurors(), 1, "Wrong disputesWithoutJurors count");
+        (uint96 courtID, , , , ) = core.disputes(disputeID);
+        assertEq(courtID, GENERAL_COURT, "Wrong court ID");
+
+        (, jumped, ) = disputeKit2.disputes(disputeID);
+        assertEq(jumped, false, "jumped should be false in the DK that dispute jumped to");
+
+        // Check jump modifier
+        vm.prank(address(core));
+        vm.expectRevert(DisputeKitClassicBase.DisputeJumpedToParentDK.selector);
+        disputeKit3.draw(disputeID, 1);
+
+        // And check that draw in the new round works
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCoreBase.Draw(staker1, disputeID, 1, 0); // roundID = 1 VoteID = 0
+        core.draw(disputeID, 1);
+
+        (address account, , , ) = disputeKit2.getVoteInfo(disputeID, 1, 0);
+        assertEq(account, staker1, "Wrong drawn account in the classic DK");
+    }
+
     function test_appeal_quickPassPeriod() public {
         uint256 disputeID = 0;
 

From e6e83aea553f4af1b482f091bc5475effe2ec2bc Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 3 Sep 2025 21:31:00 +0100
Subject: [PATCH 076/175] refactor: small functions rename

---
 contracts/src/arbitration/KlerosCoreBase.sol                  | 4 ++--
 contracts/src/arbitration/SortitionModuleBase.sol             | 4 ++--
 contracts/src/arbitration/interfaces/ISortitionModule.sol     | 4 ++--
 contracts/src/arbitration/university/KlerosCoreUniversity.sol | 4 ++--
 .../src/arbitration/university/SortitionModuleUniversity.sol  | 4 ++--
 5 files changed, 10 insertions(+), 10 deletions(-)

diff --git a/contracts/src/arbitration/KlerosCoreBase.sol b/contracts/src/arbitration/KlerosCoreBase.sol
index d6821b59c..4efac9477 100644
--- a/contracts/src/arbitration/KlerosCoreBase.sol
+++ b/contracts/src/arbitration/KlerosCoreBase.sol
@@ -796,10 +796,10 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
 
         if (pnkBalance == 0 || !disputeKit.isVoteActive(_params.disputeID, _params.round, _params.repartition)) {
             // The juror is inactive or their balance is can't cover penalties anymore, unstake them from all courts.
-            sortitionModule.unstakeByCoreFromAllCourts(account);
+            sortitionModule.forcedUnstakeAllCourts(account);
         } else if (newCourtStake < courts[penalizedInCourtID].minStake) {
             // The juror's balance fell below the court minStake, unstake them from the court.
-            sortitionModule.unstakeByCore(account, penalizedInCourtID);
+            sortitionModule.forcedUnstake(account, penalizedInCourtID);
         }
 
         if (_params.repartition == _params.numberOfVotesInRound - 1 && _params.coherentCount == 0) {
diff --git a/contracts/src/arbitration/SortitionModuleBase.sol b/contracts/src/arbitration/SortitionModuleBase.sol
index 59c394722..cf48c624c 100644
--- a/contracts/src/arbitration/SortitionModuleBase.sol
+++ b/contracts/src/arbitration/SortitionModuleBase.sol
@@ -436,7 +436,7 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
     /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
     /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
     /// @param _account The juror to unstake.
-    function unstakeByCoreFromAllCourts(address _account) external override onlyByCore {
+    function forcedUnstakeAllCourts(address _account) external override onlyByCore {
         uint96[] memory courtIDs = getJurorCourtIDs(_account);
         for (uint256 j = courtIDs.length; j > 0; j--) {
             core.setStakeBySortitionModule(_account, courtIDs[j - 1], 0);
@@ -451,7 +451,7 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
     /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
     /// @param _account The juror to unstake.
     /// @param _courtID The ID of the court.
-    function unstakeByCore(address _account, uint96 _courtID) external override onlyByCore {
+    function forcedUnstake(address _account, uint96 _courtID) external override onlyByCore {
         core.setStakeBySortitionModule(_account, _courtID, 0);
     }
 
diff --git a/contracts/src/arbitration/interfaces/ISortitionModule.sol b/contracts/src/arbitration/interfaces/ISortitionModule.sol
index 52a077ec3..e830891df 100644
--- a/contracts/src/arbitration/interfaces/ISortitionModule.sol
+++ b/contracts/src/arbitration/interfaces/ISortitionModule.sol
@@ -38,9 +38,9 @@ interface ISortitionModule {
 
     function setStakeReward(address _account, uint96 _courtID, uint256 _reward) external returns (bool success);
 
-    function unstakeByCoreFromAllCourts(address _account) external;
+    function forcedUnstakeAllCourts(address _account) external;
 
-    function unstakeByCore(address _account, uint96 _courtID) external;
+    function forcedUnstake(address _account, uint96 _courtID) external;
 
     function lockStake(address _account, uint256 _relativeAmount) external;
 
diff --git a/contracts/src/arbitration/university/KlerosCoreUniversity.sol b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
index b75f16418..b2519fdd7 100644
--- a/contracts/src/arbitration/university/KlerosCoreUniversity.sol
+++ b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
@@ -791,10 +791,10 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
 
         if (pnkBalance == 0 || !disputeKit.isVoteActive(_params.disputeID, _params.round, _params.repartition)) {
             // The juror is inactive or their balance is can't cover penalties anymore, unstake them from all courts.
-            sortitionModule.unstakeByCoreFromAllCourts(account);
+            sortitionModule.forcedUnstakeAllCourts(account);
         } else if (newCourtStake < courts[penalizedInCourtID].minStake) {
             // The juror's balance fell below the court minStake, unstake them from the court.
-            sortitionModule.setStake(account, penalizedInCourtID, 0, 0, 0);
+            sortitionModule.forcedUnstake(account, penalizedInCourtID);
         }
 
         if (_params.repartition == _params.numberOfVotesInRound - 1 && _params.coherentCount == 0) {
diff --git a/contracts/src/arbitration/university/SortitionModuleUniversity.sol b/contracts/src/arbitration/university/SortitionModuleUniversity.sol
index b127b7cf5..dd1caa832 100644
--- a/contracts/src/arbitration/university/SortitionModuleUniversity.sol
+++ b/contracts/src/arbitration/university/SortitionModuleUniversity.sol
@@ -303,7 +303,7 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
     /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
     /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
     /// @param _account The juror to unstake.
-    function unstakeByCoreFromAllCourts(address _account) external override onlyByCore {
+    function forcedUnstakeAllCourts(address _account) external override onlyByCore {
         uint96[] memory courtIDs = getJurorCourtIDs(_account);
         for (uint256 j = courtIDs.length; j > 0; j--) {
             core.setStakeBySortitionModule(_account, courtIDs[j - 1], 0);
@@ -318,7 +318,7 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
     /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
     /// @param _account The juror to unstake.
     /// @param _courtID The ID of the court.
-    function unstakeByCore(address _account, uint96 _courtID) external override onlyByCore {
+    function forcedUnstake(address _account, uint96 _courtID) external override onlyByCore {
         core.setStakeBySortitionModule(_account, _courtID, 0);
     }
 

From 1d1f9f2d909715117e2dddfe28ad3938823b2f02 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 3 Sep 2025 23:08:04 +0100
Subject: [PATCH 077/175] chore: changelog

---
 contracts/CHANGELOG.md | 6 ++++++
 1 file changed, 6 insertions(+)

diff --git a/contracts/CHANGELOG.md b/contracts/CHANGELOG.md
index 79845b880..086502e21 100644
--- a/contracts/CHANGELOG.md
+++ b/contracts/CHANGELOG.md
@@ -13,6 +13,12 @@ The format is based on [Common Changelog](https://common-changelog.org/).
 - **Breaking:** Rename the interface from `RNG` to `IRNG` ([#2054](https://github.com/kleros/kleros-v2/issues/2054))
 - **Breaking:** Remove the `_block` parameter from `IRNG.requestRandomness()` and `IRNG.receiveRandomness()`, not needed for the primary VRF-based RNG ([#2054](https://github.com/kleros/kleros-v2/issues/2054))
 - **Breaking:** Rename `governor` to `owner` in order to comply with the lightweight ownership standard [ERC-5313](https://eipsinsight.com/ercs/erc-5313) ([#2112](https://github.com/kleros/kleros-v2/issues/2112))
+- **Breaking:** Apply the penalties to the stakes in the Sortition Tree ([#2107](https://github.com/kleros/kleros-v2/issues/2107))
+- **Breaking:** Make `SortitionModule.getJurorBalance().stakedInCourt` include the penalties ([#2107](https://github.com/kleros/kleros-v2/issues/2107))
+- **Breaking:** Add a new field `drawnJurorFromCourtIDs` to the `Round` struct in `KlerosCoreBase` and `KlerosCoreUniversity` ([#2107](https://github.com/kleros/kleros-v2/issues/2107))
+- Make `IDisputeKit.draw()` and `ISortitionModule.draw()` return the court ID from which the juror was drawn ([#2107](https://github.com/kleros/kleros-v2/issues/2107))
+- Rename `SortitionModule.setJurorInactive()` to `SortitionModule.forcedUnstakeAllCourts()` ([#2107](https://github.com/kleros/kleros-v2/issues/2107))
+- Allow stake changes to by-pass delayed stakes when initiated by the SortitionModule by setting the `_noDelay` parameter to `true` in `SortitionModule.validateStake()` ([#2107](https://github.com/kleros/kleros-v2/issues/2107))
 - Make the primary VRF-based RNG fall back to `BlockhashRNG` if the VRF request is not fulfilled within a timeout ([#2054](https://github.com/kleros/kleros-v2/issues/2054))
 - Authenticate the calls to the RNGs to prevent 3rd parties from depleting the Chainlink VRF subscription funds ([#2054](https://github.com/kleros/kleros-v2/issues/2054))
 - Use `block.timestamp` rather than `block.number` for `BlockhashRNG` for better reliability on Arbitrum as block production is sporadic depending on network conditions. ([#2054](https://github.com/kleros/kleros-v2/issues/2054))

From b7888c282e372c549184f1f3ce3ca4cc84205421 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 27 Aug 2025 06:34:29 +0100
Subject: [PATCH 078/175] refactor: extracted the sortition tree to a library

---
 contracts/src/arbitration/KlerosCoreBase.sol  |   8 +-
 .../src/arbitration/SortitionModuleBase.sol   | 251 ++---------------
 .../dispute-kits/DisputeKitClassicBase.sol    |   4 +-
 .../interfaces/ISortitionModule.sol           |   4 +-
 .../university/SortitionModuleUniversity.sol  |   8 +-
 contracts/src/libraries/SortitionTrees.sol    | 252 ++++++++++++++++++
 contracts/src/test/SortitionModuleMock.sol    |   3 +-
 7 files changed, 282 insertions(+), 248 deletions(-)
 create mode 100644 contracts/src/libraries/SortitionTrees.sol

diff --git a/contracts/src/arbitration/KlerosCoreBase.sol b/contracts/src/arbitration/KlerosCoreBase.sol
index 4efac9477..a76930051 100644
--- a/contracts/src/arbitration/KlerosCoreBase.sol
+++ b/contracts/src/arbitration/KlerosCoreBase.sol
@@ -223,7 +223,7 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
         // FORKING_COURT
         // TODO: Fill the properties for the Forking court, emit CourtCreated.
         courts.push();
-        sortitionModule.createTree(bytes32(uint256(FORKING_COURT)), _sortitionExtraData);
+        sortitionModule.createTree(FORKING_COURT, _sortitionExtraData);
 
         // GENERAL_COURT
         Court storage court = courts.push();
@@ -236,7 +236,7 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
         court.jurorsForCourtJump = _courtParameters[3];
         court.timesPerPeriod = _timesPerPeriod;
 
-        sortitionModule.createTree(bytes32(uint256(GENERAL_COURT)), _sortitionExtraData);
+        sortitionModule.createTree(GENERAL_COURT, _sortitionExtraData);
 
         uint256[] memory supportedDisputeKits = new uint256[](1);
         supportedDisputeKits[0] = DISPUTE_KIT_CLASSIC;
@@ -343,7 +343,7 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
         if (_supportedDisputeKits.length == 0) revert UnsupportedDisputeKit();
         if (_parent == FORKING_COURT) revert InvalidForkingCourtAsParent();
 
-        uint256 courtID = courts.length;
+        uint96 courtID = uint96(courts.length);
         Court storage court = courts.push();
 
         for (uint256 i = 0; i < _supportedDisputeKits.length; i++) {
@@ -364,7 +364,7 @@ abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable
         court.jurorsForCourtJump = _jurorsForCourtJump;
         court.timesPerPeriod = _timesPerPeriod;
 
-        sortitionModule.createTree(bytes32(courtID), _sortitionExtraData);
+        sortitionModule.createTree(courtID, _sortitionExtraData);
 
         // Update the parent.
         courts[_parent].children.push(courtID);
diff --git a/contracts/src/arbitration/SortitionModuleBase.sol b/contracts/src/arbitration/SortitionModuleBase.sol
index cf48c624c..3c528b017 100644
--- a/contracts/src/arbitration/SortitionModuleBase.sol
+++ b/contracts/src/arbitration/SortitionModuleBase.sol
@@ -7,25 +7,20 @@ import {ISortitionModule} from "./interfaces/ISortitionModule.sol";
 import {IDisputeKit} from "./interfaces/IDisputeKit.sol";
 import {Initializable} from "../proxy/Initializable.sol";
 import {UUPSProxiable} from "../proxy/UUPSProxiable.sol";
+import {SortitionTrees, TreeKey, CourtID} from "../libraries/SortitionTrees.sol";
 import {IRNG} from "../rng/IRNG.sol";
 import "../libraries/Constants.sol";
 
 /// @title SortitionModuleBase
 /// @dev A factory of trees that keeps track of staked values for sortition.
 abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSProxiable {
+    using SortitionTrees for SortitionTrees.Tree;
+    using SortitionTrees for mapping(TreeKey key => SortitionTrees.Tree);
+
     // ************************************* //
     // *         Enums / Structs           * //
     // ************************************* //
 
-    struct SortitionSumTree {
-        uint256 K; // The maximum number of children per node.
-        uint256[] stack; // We use this to keep track of vacant positions in the tree after removing a leaf. This is for keeping the tree as balanced as possible without spending gas on moving nodes around.
-        uint256[] nodes; // The tree nodes.
-        // Two-way mapping of IDs to node indexes. Note that node index 0 is reserved for the root node, and means the ID does not have a node.
-        mapping(bytes32 stakePathID => uint256 nodeIndex) IDsToNodeIndexes;
-        mapping(uint256 nodeIndex => bytes32 stakePathID) nodeIndexesToIDs;
-    }
-
     struct DelayedStake {
         address account; // The address of the juror.
         uint96 courtID; // The ID of the court.
@@ -56,7 +51,7 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
     uint256 public rngLookahead; // DEPRECATED: to be removed in the next redeploy
     uint256 public delayedStakeWriteIndex; // The index of the last `delayedStake` item that was written to the array. 0 index is skipped.
     uint256 public delayedStakeReadIndex; // The index of the next `delayedStake` item that should be processed. Starts at 1 because 0 index is skipped.
-    mapping(bytes32 treeHash => SortitionSumTree) sortitionSumTrees; // The mapping trees by keys.
+    mapping(TreeKey key => SortitionTrees.Tree) sortitionSumTrees; // The mapping of sortition trees by keys.
     mapping(address account => Juror) public jurors; // The jurors.
     mapping(uint256 => DelayedStake) public delayedStakes; // Stores the stakes that were changed during Drawing phase, to update them when the phase is switched to Staking.
     mapping(address jurorAccount => mapping(uint96 courtId => uint256)) public latestDelayedStakeIndex; // DEPRECATED. Maps the juror to its latest delayed stake. If there is already a delayed stake for this juror then it'll be replaced. latestDelayedStakeIndex[juror][courtID].
@@ -185,15 +180,12 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
     }
 
     /// @dev Create a sortition sum tree at the specified key.
-    /// @param _key The key of the new tree.
+    /// @param _courtID The ID of the court.
     /// @param _extraData Extra data that contains the number of children each node in the tree should have.
-    function createTree(bytes32 _key, bytes memory _extraData) external override onlyByCore {
-        SortitionSumTree storage tree = sortitionSumTrees[_key];
+    function createTree(uint96 _courtID, bytes memory _extraData) external override onlyByCore {
+        TreeKey key = CourtID.wrap(_courtID).toTreeKey();
         uint256 K = _extraDataToTreeK(_extraData);
-        if (tree.K != 0) revert TreeAlreadyExists();
-        if (K <= 1) revert KMustBeGreaterThanOne();
-        tree.K = K;
-        tree.nodes.push(0);
+        sortitionSumTrees.createTree(key, K);
     }
 
     /// @dev Executes the next delayed stakes.
@@ -398,12 +390,13 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
         }
 
         // Update the sortition sum tree.
-        bytes32 stakePathID = _accountAndCourtIDToStakePathID(_account, _courtID);
+        bytes32 stakePathID = SortitionTrees.toStakePathID(_account, _courtID);
         bool finished = false;
         uint96 currentCourtID = _courtID;
         while (!finished) {
             // Tokens are also implicitly staked in parent courts through sortition module to increase the chance of being drawn.
-            _set(bytes32(uint256(currentCourtID)), _newStake, stakePathID);
+            TreeKey key = CourtID.wrap(currentCourtID).toTreeKey();
+            sortitionSumTrees[key].set(_newStake, stakePathID);
             if (currentCourtID == GENERAL_COURT) {
                 finished = true;
             } else {
@@ -477,7 +470,7 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
 
     /// @dev Draw an ID from a tree using a number.
     /// Note that this function reverts if the sum of all values in the tree is 0.
-    /// @param _key The key of the tree.
+    /// @param _courtID The ID of the court.
     /// @param _coreDisputeID Index of the dispute in Kleros Core.
     /// @param _nonce Nonce to hash with random number.
     /// @return drawnAddress The drawn address.
@@ -485,41 +478,14 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
     /// `k` is the maximum number of children per node in the tree,
     ///  and `n` is the maximum number of nodes ever appended.
     function draw(
-        bytes32 _key,
+        uint96 _courtID,
         uint256 _coreDisputeID,
         uint256 _nonce
     ) public view override returns (address drawnAddress, uint96 fromSubcourtID) {
         if (phase != Phase.drawing) revert NotDrawingPhase();
-        SortitionSumTree storage tree = sortitionSumTrees[_key];
-
-        if (tree.nodes[0] == 0) {
-            return (address(0), 0); // No jurors staked.
-        }
-
-        uint256 currentDrawnNumber = uint256(keccak256(abi.encodePacked(randomNumber, _coreDisputeID, _nonce))) %
-            tree.nodes[0];
-
-        // While it still has children
-        uint256 treeIndex = 0;
-        while ((tree.K * treeIndex) + 1 < tree.nodes.length) {
-            for (uint256 i = 1; i <= tree.K; i++) {
-                // Loop over children.
-                uint256 nodeIndex = (tree.K * treeIndex) + i;
-                uint256 nodeValue = tree.nodes[nodeIndex];
-
-                if (currentDrawnNumber >= nodeValue) {
-                    // Go to the next child.
-                    currentDrawnNumber -= nodeValue;
-                } else {
-                    // Pick this child.
-                    treeIndex = nodeIndex;
-                    break;
-                }
-            }
-        }
 
-        bytes32 stakePathID = tree.nodeIndexesToIDs[treeIndex];
-        (drawnAddress, fromSubcourtID) = _stakePathIDToAccountAndCourtID(stakePathID);
+        TreeKey key = CourtID.wrap(_courtID).toTreeKey();
+        (drawnAddress, fromSubcourtID) = sortitionSumTrees[key].draw(_coreDisputeID, _nonce, randomNumber);
     }
 
     /// @dev Get the stake of a juror in a court.
@@ -527,21 +493,9 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
     /// @param _courtID The ID of the court.
     /// @return value The stake of the juror in the court.
     function stakeOf(address _juror, uint96 _courtID) public view returns (uint256) {
-        bytes32 stakePathID = _accountAndCourtIDToStakePathID(_juror, _courtID);
-        return stakeOf(bytes32(uint256(_courtID)), stakePathID);
-    }
-
-    /// @dev Get the stake of a juror in a court.
-    /// @param _key The key of the tree, corresponding to a court.
-    /// @param _stakePathID The stake path ID, corresponding to a juror.
-    /// @return The stake of the juror in the court.
-    function stakeOf(bytes32 _key, bytes32 _stakePathID) public view returns (uint256) {
-        SortitionSumTree storage tree = sortitionSumTrees[_key];
-        uint treeIndex = tree.IDsToNodeIndexes[_stakePathID];
-        if (treeIndex == 0) {
-            return 0;
-        }
-        return tree.nodes[treeIndex];
+        bytes32 stakePathID = SortitionTrees.toStakePathID(_juror, _courtID);
+        TreeKey key = CourtID.wrap(_courtID).toTreeKey();
+        return sortitionSumTrees[key].stakeOf(stakePathID);
     }
 
     /// @dev Gets the balance of a juror in a court.
@@ -590,26 +544,6 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
     // *            Internal               * //
     // ************************************* //
 
-    /// @dev Update all the parents of a node.
-    /// @param _key The key of the tree to update.
-    /// @param _treeIndex The index of the node to start from.
-    /// @param _plusOrMinus Whether to add (true) or substract (false).
-    /// @param _value The value to add or substract.
-    /// `O(log_k(n))` where
-    /// `k` is the maximum number of children per node in the tree,
-    ///  and `n` is the maximum number of nodes ever appended.
-    function _updateParents(bytes32 _key, uint256 _treeIndex, bool _plusOrMinus, uint256 _value) private {
-        SortitionSumTree storage tree = sortitionSumTrees[_key];
-
-        uint256 parentIndex = _treeIndex;
-        while (parentIndex != 0) {
-            parentIndex = (parentIndex - 1) / tree.K;
-            tree.nodes[parentIndex] = _plusOrMinus
-                ? tree.nodes[parentIndex] + _value
-                : tree.nodes[parentIndex] - _value;
-        }
-    }
-
     function _extraDataToTreeK(bytes memory _extraData) internal pure returns (uint256 K) {
         if (_extraData.length >= 32) {
             assembly {
@@ -621,151 +555,6 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
         }
     }
 
-    /// @dev Set a value in a tree.
-    /// @param _key The key of the tree.
-    /// @param _value The new value.
-    /// @param _stakePathID The ID of the value.
-    /// `O(log_k(n))` where
-    /// `k` is the maximum number of children per node in the tree,
-    ///  and `n` is the maximum number of nodes ever appended.
-    function _set(bytes32 _key, uint256 _value, bytes32 _stakePathID) internal {
-        SortitionSumTree storage tree = sortitionSumTrees[_key];
-        uint256 treeIndex = tree.IDsToNodeIndexes[_stakePathID];
-
-        if (treeIndex == 0) {
-            // No existing node.
-            if (_value != 0) {
-                // Non zero value.
-                // Append.
-                // Add node.
-                if (tree.stack.length == 0) {
-                    // No vacant spots.
-                    // Get the index and append the value.
-                    treeIndex = tree.nodes.length;
-                    tree.nodes.push(_value);
-
-                    // Potentially append a new node and make the parent a sum node.
-                    if (treeIndex != 1 && (treeIndex - 1) % tree.K == 0) {
-                        // Is first child.
-                        uint256 parentIndex = treeIndex / tree.K;
-                        bytes32 parentID = tree.nodeIndexesToIDs[parentIndex];
-                        uint256 newIndex = treeIndex + 1;
-                        tree.nodes.push(tree.nodes[parentIndex]);
-                        delete tree.nodeIndexesToIDs[parentIndex];
-                        tree.IDsToNodeIndexes[parentID] = newIndex;
-                        tree.nodeIndexesToIDs[newIndex] = parentID;
-                    }
-                } else {
-                    // Some vacant spot.
-                    // Pop the stack and append the value.
-                    treeIndex = tree.stack[tree.stack.length - 1];
-                    tree.stack.pop();
-                    tree.nodes[treeIndex] = _value;
-                }
-
-                // Add label.
-                tree.IDsToNodeIndexes[_stakePathID] = treeIndex;
-                tree.nodeIndexesToIDs[treeIndex] = _stakePathID;
-
-                _updateParents(_key, treeIndex, true, _value);
-            }
-        } else {
-            // Existing node.
-            if (_value == 0) {
-                // Zero value.
-                // Remove.
-                // Remember value and set to 0.
-                uint256 value = tree.nodes[treeIndex];
-                tree.nodes[treeIndex] = 0;
-
-                // Push to stack.
-                tree.stack.push(treeIndex);
-
-                // Clear label.
-                delete tree.IDsToNodeIndexes[_stakePathID];
-                delete tree.nodeIndexesToIDs[treeIndex];
-
-                _updateParents(_key, treeIndex, false, value);
-            } else if (_value != tree.nodes[treeIndex]) {
-                // New, non zero value.
-                // Set.
-                bool plusOrMinus = tree.nodes[treeIndex] <= _value;
-                uint256 plusOrMinusValue = plusOrMinus
-                    ? _value - tree.nodes[treeIndex]
-                    : tree.nodes[treeIndex] - _value;
-                tree.nodes[treeIndex] = _value;
-
-                _updateParents(_key, treeIndex, plusOrMinus, plusOrMinusValue);
-            }
-        }
-    }
-
-    /// @dev Packs an account and a court ID into a stake path ID: [20 bytes of address][12 bytes of courtID] = 32 bytes total.
-    /// @param _account The address of the juror to pack.
-    /// @param _courtID The court ID to pack.
-    /// @return stakePathID The stake path ID.
-    function _accountAndCourtIDToStakePathID(
-        address _account,
-        uint96 _courtID
-    ) internal pure returns (bytes32 stakePathID) {
-        assembly {
-            // solium-disable-line security/no-inline-assembly
-            let ptr := mload(0x40)
-
-            // Write account address (first 20 bytes)
-            for {
-                let i := 0x00
-            } lt(i, 0x14) {
-                i := add(i, 0x01)
-            } {
-                mstore8(add(ptr, i), byte(add(0x0c, i), _account))
-            }
-
-            // Write court ID (last 12 bytes)
-            for {
-                let i := 0x14
-            } lt(i, 0x20) {
-                i := add(i, 0x01)
-            } {
-                mstore8(add(ptr, i), byte(i, _courtID))
-            }
-            stakePathID := mload(ptr)
-        }
-    }
-
-    /// @dev Retrieves both juror's address and court ID from the stake path ID.
-    /// @param _stakePathID The stake path ID to unpack.
-    /// @return account The account.
-    /// @return courtID The court ID.
-    function _stakePathIDToAccountAndCourtID(
-        bytes32 _stakePathID
-    ) internal pure returns (address account, uint96 courtID) {
-        assembly {
-            // solium-disable-line security/no-inline-assembly
-            let ptr := mload(0x40)
-
-            // Read account address (first 20 bytes)
-            for {
-                let i := 0x00
-            } lt(i, 0x14) {
-                i := add(i, 0x01)
-            } {
-                mstore8(add(add(ptr, 0x0c), i), byte(i, _stakePathID))
-            }
-            account := mload(ptr)
-
-            // Read court ID (last 12 bytes)
-            for {
-                let i := 0x00
-            } lt(i, 0x0c) {
-                i := add(i, 0x01)
-            } {
-                mstore8(add(add(ptr, 0x14), i), byte(add(i, 0x14), _stakePathID))
-            }
-            courtID := mload(ptr)
-        }
-    }
-
     // ************************************* //
     // *              Errors               * //
     // ************************************* //
@@ -776,8 +565,6 @@ abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSPr
     error NoDisputesThatNeedJurors();
     error RandomNumberNotReady();
     error DisputesWithoutJurorsAndMaxDrawingTimeNotPassed();
-    error TreeAlreadyExists();
-    error KMustBeGreaterThanOne();
     error NotStakingPhase();
     error NoDelayedStakeToExecute();
     error NotEligibleForWithdrawal();
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index 03a284878..6fca9b02b 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -232,9 +232,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
 
         ISortitionModule sortitionModule = core.sortitionModule();
         (uint96 courtID, , , , ) = core.disputes(_coreDisputeID);
-        bytes32 key = bytes32(uint256(courtID)); // Get the ID of the tree.
-
-        (drawnAddress, fromSubcourtID) = sortitionModule.draw(key, _coreDisputeID, _nonce);
+        (drawnAddress, fromSubcourtID) = sortitionModule.draw(courtID, _coreDisputeID, _nonce);
         if (drawnAddress == address(0)) {
             // Sortition can return 0 address if no one has staked yet.
             return (drawnAddress, fromSubcourtID);
diff --git a/contracts/src/arbitration/interfaces/ISortitionModule.sol b/contracts/src/arbitration/interfaces/ISortitionModule.sol
index e830891df..d9fe7e485 100644
--- a/contracts/src/arbitration/interfaces/ISortitionModule.sol
+++ b/contracts/src/arbitration/interfaces/ISortitionModule.sol
@@ -13,7 +13,7 @@ interface ISortitionModule {
 
     event NewPhase(Phase _phase);
 
-    function createTree(bytes32 _key, bytes memory _extraData) external;
+    function createTree(uint96 _courtID, bytes memory _extraData) external;
 
     function validateStake(
         address _account,
@@ -49,7 +49,7 @@ interface ISortitionModule {
     function notifyRandomNumber(uint256 _drawnNumber) external;
 
     function draw(
-        bytes32 _court,
+        uint96 _courtID,
         uint256 _coreDisputeID,
         uint256 _nonce
     ) external view returns (address drawnAddress, uint96 fromSubcourtID);
diff --git a/contracts/src/arbitration/university/SortitionModuleUniversity.sol b/contracts/src/arbitration/university/SortitionModuleUniversity.sol
index dd1caa832..63720eb18 100644
--- a/contracts/src/arbitration/university/SortitionModuleUniversity.sol
+++ b/contracts/src/arbitration/university/SortitionModuleUniversity.sol
@@ -112,7 +112,7 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
         transientJuror = _juror;
     }
 
-    function createTree(bytes32 _key, bytes memory _extraData) external {
+    function createTree(uint96 _courtID, bytes memory _extraData) external {
         // NOP
     }
 
@@ -345,11 +345,7 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
     /// @dev Draw an ID from a tree using a number.
     /// Note that this function reverts if the sum of all values in the tree is 0.
     /// @return drawnAddress The drawn address.
-    function draw(
-        bytes32,
-        uint256,
-        uint256
-    ) public view override returns (address drawnAddress, uint96 fromSubcourtID) {
+    function draw(uint96, uint256, uint256) public view override returns (address drawnAddress, uint96 fromSubcourtID) {
         drawnAddress = transientJuror;
     }
 
diff --git a/contracts/src/libraries/SortitionTrees.sol b/contracts/src/libraries/SortitionTrees.sol
new file mode 100644
index 000000000..6a1b97bc8
--- /dev/null
+++ b/contracts/src/libraries/SortitionTrees.sol
@@ -0,0 +1,252 @@
+// SPDX-License-Identifier: MIT
+
+pragma solidity ^0.8.24;
+
+type TreeKey is bytes32;
+type CourtID is uint96;
+
+using {toTreeKey} for CourtID global;
+
+function toTreeKey(CourtID _courtID) pure returns (TreeKey) {
+    return TreeKey.wrap(bytes32(uint256(CourtID.unwrap(_courtID))));
+}
+
+library SortitionTrees {
+    struct Tree {
+        uint256 K; // The maximum number of children per node.
+        uint256[] stack; // We use this to keep track of vacant positions in the tree after removing a leaf. This is for keeping the tree as balanced as possible without spending gas on moving nodes around.
+        uint256[] nodes; // The tree nodes.
+        // Two-way mapping of IDs to node indexes. Note that node index 0 is reserved for the root node, and means the ID does not have a node.
+        mapping(bytes32 stakePathID => uint256 nodeIndex) IDsToNodeIndexes;
+        mapping(uint256 nodeIndex => bytes32 stakePathID) nodeIndexesToIDs;
+    }
+
+    /// @dev Create a sortition sum tree at the specified key.
+    /// @param _trees The mapping of sortition sum trees.
+    /// @param _key The key of the new tree.
+    /// @param _k The maximum number of children per node.
+    function createTree(mapping(TreeKey key => Tree) storage _trees, TreeKey _key, uint256 _k) internal {
+        Tree storage tree = _trees[_key];
+        if (tree.K != 0) revert TreeAlreadyExists();
+        if (_k <= 1) revert KMustBeGreaterThanOne();
+        tree.K = _k;
+        tree.nodes.push(0);
+    }
+
+    /// @dev Draw an ID from a tree using a number.
+    /// Note that this function reverts if the sum of all values in the tree is 0.
+    /// @param _tree The sortition sum tree.
+    /// @param _coreDisputeID Index of the dispute in Kleros Core.
+    /// @param _nonce Nonce to hash with random number.
+    /// @return drawnAddress The drawn address.
+    /// `O(k * log_k(n))` where
+    /// `k` is the maximum number of children per node in the tree,
+    ///  and `n` is the maximum number of nodes ever appended.
+    function draw(
+        Tree storage _tree,
+        uint256 _coreDisputeID,
+        uint256 _nonce,
+        uint256 _randomNumber
+    ) internal view returns (address drawnAddress, uint96 fromSubcourtID) {
+        if (_tree.nodes[0] == 0) {
+            return (address(0), 0); // No jurors staked.
+        }
+
+        uint256 currentDrawnNumber = uint256(keccak256(abi.encodePacked(_randomNumber, _coreDisputeID, _nonce))) %
+            _tree.nodes[0];
+
+        // While it still has children
+        uint256 treeIndex = 0;
+        while ((_tree.K * treeIndex) + 1 < _tree.nodes.length) {
+            for (uint256 i = 1; i <= _tree.K; i++) {
+                // Loop over children.
+                uint256 nodeIndex = (_tree.K * treeIndex) + i;
+                uint256 nodeValue = _tree.nodes[nodeIndex];
+
+                if (currentDrawnNumber >= nodeValue) {
+                    // Go to the next child.
+                    currentDrawnNumber -= nodeValue;
+                } else {
+                    // Pick this child.
+                    treeIndex = nodeIndex;
+                    break;
+                }
+            }
+        }
+
+        bytes32 stakePathID = _tree.nodeIndexesToIDs[treeIndex];
+        (drawnAddress, fromSubcourtID) = toAccountAndCourtID(stakePathID);
+    }
+
+    /// @dev Set a value in a tree.
+    /// @param _tree The sortition sum tree.
+    /// @param _value The new value.
+    /// @param _stakePathID The ID of the value.
+    /// `O(log_k(n))` where
+    /// `k` is the maximum number of children per node in the tree,
+    ///  and `n` is the maximum number of nodes ever appended.
+    function set(Tree storage _tree, uint256 _value, bytes32 _stakePathID) internal {
+        uint256 treeIndex = _tree.IDsToNodeIndexes[_stakePathID];
+
+        if (treeIndex == 0) {
+            // No existing node.
+            if (_value != 0) {
+                // Non zero value.
+                // Append.
+                // Add node.
+                if (_tree.stack.length == 0) {
+                    // No vacant spots.
+                    // Get the index and append the value.
+                    treeIndex = _tree.nodes.length;
+                    _tree.nodes.push(_value);
+
+                    // Potentially append a new node and make the parent a sum node.
+                    if (treeIndex != 1 && (treeIndex - 1) % _tree.K == 0) {
+                        // Is first child.
+                        uint256 parentIndex = treeIndex / _tree.K;
+                        bytes32 parentID = _tree.nodeIndexesToIDs[parentIndex];
+                        uint256 newIndex = treeIndex + 1;
+                        _tree.nodes.push(_tree.nodes[parentIndex]);
+                        delete _tree.nodeIndexesToIDs[parentIndex];
+                        _tree.IDsToNodeIndexes[parentID] = newIndex;
+                        _tree.nodeIndexesToIDs[newIndex] = parentID;
+                    }
+                } else {
+                    // Some vacant spot.
+                    // Pop the stack and append the value.
+                    treeIndex = _tree.stack[_tree.stack.length - 1];
+                    _tree.stack.pop();
+                    _tree.nodes[treeIndex] = _value;
+                }
+
+                // Add label.
+                _tree.IDsToNodeIndexes[_stakePathID] = treeIndex;
+                _tree.nodeIndexesToIDs[treeIndex] = _stakePathID;
+
+                updateParents(_tree, treeIndex, true, _value);
+            }
+        } else {
+            // Existing node.
+            if (_value == 0) {
+                // Zero value.
+                // Remove.
+                // Remember value and set to 0.
+                uint256 value = _tree.nodes[treeIndex];
+                _tree.nodes[treeIndex] = 0;
+
+                // Push to stack.
+                _tree.stack.push(treeIndex);
+
+                // Clear label.
+                delete _tree.IDsToNodeIndexes[_stakePathID];
+                delete _tree.nodeIndexesToIDs[treeIndex];
+
+                updateParents(_tree, treeIndex, false, value);
+            } else if (_value != _tree.nodes[treeIndex]) {
+                // New, non zero value.
+                // Set.
+                bool plusOrMinus = _tree.nodes[treeIndex] <= _value;
+                uint256 plusOrMinusValue = plusOrMinus
+                    ? _value - _tree.nodes[treeIndex]
+                    : _tree.nodes[treeIndex] - _value;
+                _tree.nodes[treeIndex] = _value;
+
+                updateParents(_tree, treeIndex, plusOrMinus, plusOrMinusValue);
+            }
+        }
+    }
+
+    /// @dev Update all the parents of a node.
+    /// @param _tree The sortition sum tree.
+    /// @param _treeIndex The index of the node to start from.
+    /// @param _plusOrMinus Whether to add (true) or substract (false).
+    /// @param _value The value to add or substract.
+    /// `O(log_k(n))` where
+    /// `k` is the maximum number of children per node in the tree,
+    ///  and `n` is the maximum number of nodes ever appended.
+    function updateParents(Tree storage _tree, uint256 _treeIndex, bool _plusOrMinus, uint256 _value) private {
+        uint256 parentIndex = _treeIndex;
+        while (parentIndex != 0) {
+            parentIndex = (parentIndex - 1) / _tree.K;
+            _tree.nodes[parentIndex] = _plusOrMinus
+                ? _tree.nodes[parentIndex] + _value
+                : _tree.nodes[parentIndex] - _value;
+        }
+    }
+
+    /// @dev Get the stake of a juror in a court.
+    /// @param _tree The sortition sum tree.
+    /// @param _stakePathID The stake path ID, corresponding to a juror.
+    /// @return The stake of the juror in the court.
+    function stakeOf(Tree storage _tree, bytes32 _stakePathID) internal view returns (uint256) {
+        uint256 treeIndex = _tree.IDsToNodeIndexes[_stakePathID];
+        if (treeIndex == 0) {
+            return 0;
+        }
+        return _tree.nodes[treeIndex];
+    }
+
+    /// @dev Packs an account and a court ID into a stake path ID: [20 bytes of address][12 bytes of courtID] = 32 bytes total.
+    /// @param _account The address of the juror to pack.
+    /// @param _courtID The court ID to pack.
+    /// @return stakePathID The stake path ID.
+    function toStakePathID(address _account, uint96 _courtID) internal pure returns (bytes32 stakePathID) {
+        assembly {
+            // solium-disable-line security/no-inline-assembly
+            let ptr := mload(0x40)
+
+            // Write account address (first 20 bytes)
+            for {
+                let i := 0x00
+            } lt(i, 0x14) {
+                i := add(i, 0x01)
+            } {
+                mstore8(add(ptr, i), byte(add(0x0c, i), _account))
+            }
+
+            // Write court ID (last 12 bytes)
+            for {
+                let i := 0x14
+            } lt(i, 0x20) {
+                i := add(i, 0x01)
+            } {
+                mstore8(add(ptr, i), byte(i, _courtID))
+            }
+            stakePathID := mload(ptr)
+        }
+    }
+
+    /// @dev Retrieves both juror's address and court ID from the stake path ID.
+    /// @param _stakePathID The stake path ID to unpack.
+    /// @return account The account.
+    /// @return courtID The court ID.
+    function toAccountAndCourtID(bytes32 _stakePathID) internal pure returns (address account, uint96 courtID) {
+        assembly {
+            // solium-disable-line security/no-inline-assembly
+            let ptr := mload(0x40)
+
+            // Read account address (first 20 bytes)
+            for {
+                let i := 0x00
+            } lt(i, 0x14) {
+                i := add(i, 0x01)
+            } {
+                mstore8(add(add(ptr, 0x0c), i), byte(i, _stakePathID))
+            }
+            account := mload(ptr)
+
+            // Read court ID (last 12 bytes)
+            for {
+                let i := 0x00
+            } lt(i, 0x0c) {
+                i := add(i, 0x01)
+            } {
+                mstore8(add(add(ptr, 0x14), i), byte(add(i, 0x14), _stakePathID))
+            }
+            courtID := mload(ptr)
+        }
+    }
+
+    error TreeAlreadyExists();
+    error KMustBeGreaterThanOne();
+}
diff --git a/contracts/src/test/SortitionModuleMock.sol b/contracts/src/test/SortitionModuleMock.sol
index d55cbc152..73c9e859c 100644
--- a/contracts/src/test/SortitionModuleMock.sol
+++ b/contracts/src/test/SortitionModuleMock.sol
@@ -3,12 +3,13 @@
 pragma solidity ^0.8.24;
 
 import "../arbitration/SortitionModule.sol";
+import {SortitionTrees, TreeKey} from "../libraries/SortitionTrees.sol";
 
 /// @title SortitionModuleMock
 /// @dev Adds getter functions to sortition module for Foundry tests.
 contract SortitionModuleMock is SortitionModule {
     function getSortitionProperties(bytes32 _key) external view returns (uint256 K, uint256 nodeLength) {
-        SortitionSumTree storage tree = sortitionSumTrees[_key];
+        SortitionTrees.Tree storage tree = sortitionSumTrees[TreeKey.wrap(_key)];
         K = tree.K;
         nodeLength = tree.nodes.length;
     }

From d3c215eb3d08c2089eac02014bb92bfa1850655b Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Fri, 29 Aug 2025 00:07:05 +0100
Subject: [PATCH 079/175] chore: changelog, natspec decorators

---
 contracts/CHANGELOG.md                     |  2 ++
 contracts/src/libraries/SortitionTrees.sol | 26 +++++++++++++++++-----
 2 files changed, 23 insertions(+), 5 deletions(-)

diff --git a/contracts/CHANGELOG.md b/contracts/CHANGELOG.md
index 086502e21..14e0ff78c 100644
--- a/contracts/CHANGELOG.md
+++ b/contracts/CHANGELOG.md
@@ -22,6 +22,8 @@ The format is based on [Common Changelog](https://common-changelog.org/).
 - Make the primary VRF-based RNG fall back to `BlockhashRNG` if the VRF request is not fulfilled within a timeout ([#2054](https://github.com/kleros/kleros-v2/issues/2054))
 - Authenticate the calls to the RNGs to prevent 3rd parties from depleting the Chainlink VRF subscription funds ([#2054](https://github.com/kleros/kleros-v2/issues/2054))
 - Use `block.timestamp` rather than `block.number` for `BlockhashRNG` for better reliability on Arbitrum as block production is sporadic depending on network conditions. ([#2054](https://github.com/kleros/kleros-v2/issues/2054))
+- Replace the `bytes32 _key` parameter in `SortitionTrees.createTree()` and `SortitionTrees.draw()` by `uint96 courtID` ([#2113](https://github.com/kleros/kleros-v2/issues/2113))
+- Extract the sortition sum trees logic into a library `SortitionTrees` ([#2113](https://github.com/kleros/kleros-v2/issues/2113))
 - Set the Hardhat Solidity version to v0.8.30 and enable the IR pipeline ([#2069](https://github.com/kleros/kleros-v2/issues/2069))
 - Set the Foundry Solidity version to v0.8.30 and enable the IR pipeline ([#2073](https://github.com/kleros/kleros-v2/issues/2073))
 - Widen the allowed solc version to any v0.8.x for the interfaces only ([#2083](https://github.com/kleros/kleros-v2/issues/2083))
diff --git a/contracts/src/libraries/SortitionTrees.sol b/contracts/src/libraries/SortitionTrees.sol
index 6a1b97bc8..a1a2a1cb8 100644
--- a/contracts/src/libraries/SortitionTrees.sol
+++ b/contracts/src/libraries/SortitionTrees.sol
@@ -5,13 +5,13 @@ pragma solidity ^0.8.24;
 type TreeKey is bytes32;
 type CourtID is uint96;
 
-using {toTreeKey} for CourtID global;
-
-function toTreeKey(CourtID _courtID) pure returns (TreeKey) {
-    return TreeKey.wrap(bytes32(uint256(CourtID.unwrap(_courtID))));
-}
+using {SortitionTrees.toTreeKey} for CourtID global;
 
 library SortitionTrees {
+    // ************************************* //
+    // *         Enums / Structs           * //
+    // ************************************* //
+
     struct Tree {
         uint256 K; // The maximum number of children per node.
         uint256[] stack; // We use this to keep track of vacant positions in the tree after removing a leaf. This is for keeping the tree as balanced as possible without spending gas on moving nodes around.
@@ -21,6 +21,14 @@ library SortitionTrees {
         mapping(uint256 nodeIndex => bytes32 stakePathID) nodeIndexesToIDs;
     }
 
+    function toTreeKey(CourtID _courtID) internal pure returns (TreeKey) {
+        return TreeKey.wrap(bytes32(uint256(CourtID.unwrap(_courtID))));
+    }
+
+    // ************************************* //
+    // *         State Modifiers           * //
+    // ************************************* //
+
     /// @dev Create a sortition sum tree at the specified key.
     /// @param _trees The mapping of sortition sum trees.
     /// @param _key The key of the new tree.
@@ -174,6 +182,10 @@ library SortitionTrees {
         }
     }
 
+    // ************************************* //
+    // *           Public Views            * //
+    // ************************************* //
+
     /// @dev Get the stake of a juror in a court.
     /// @param _tree The sortition sum tree.
     /// @param _stakePathID The stake path ID, corresponding to a juror.
@@ -247,6 +259,10 @@ library SortitionTrees {
         }
     }
 
+    // ************************************* //
+    // *              Errors               * //
+    // ************************************* //
+
     error TreeAlreadyExists();
     error KMustBeGreaterThanOne();
 }

From 323ba1879118455458b939e208a05f0a5d8c57fa Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Fri, 29 Aug 2025 01:10:20 +0100
Subject: [PATCH 080/175] test: coverage of SortitionTrees and optimization of
 stakePathID packing/unpacking

---
 contracts/src/libraries/SortitionTrees.sol |  46 +-
 contracts/src/test/SortitionTreesMock.sol  | 154 +++++
 contracts/test/sortition/index.ts          | 698 +++++++++++++++++++++
 3 files changed, 857 insertions(+), 41 deletions(-)
 create mode 100644 contracts/src/test/SortitionTreesMock.sol
 create mode 100644 contracts/test/sortition/index.ts

diff --git a/contracts/src/libraries/SortitionTrees.sol b/contracts/src/libraries/SortitionTrees.sol
index a1a2a1cb8..f8d9706fe 100644
--- a/contracts/src/libraries/SortitionTrees.sol
+++ b/contracts/src/libraries/SortitionTrees.sol
@@ -205,26 +205,8 @@ library SortitionTrees {
     function toStakePathID(address _account, uint96 _courtID) internal pure returns (bytes32 stakePathID) {
         assembly {
             // solium-disable-line security/no-inline-assembly
-            let ptr := mload(0x40)
-
-            // Write account address (first 20 bytes)
-            for {
-                let i := 0x00
-            } lt(i, 0x14) {
-                i := add(i, 0x01)
-            } {
-                mstore8(add(ptr, i), byte(add(0x0c, i), _account))
-            }
-
-            // Write court ID (last 12 bytes)
-            for {
-                let i := 0x14
-            } lt(i, 0x20) {
-                i := add(i, 0x01)
-            } {
-                mstore8(add(ptr, i), byte(i, _courtID))
-            }
-            stakePathID := mload(ptr)
+            // Pack address (20 bytes) and courtID (12 bytes) into a single bytes32
+            stakePathID := or(shl(96, _account), _courtID)
         }
     }
 
@@ -235,27 +217,9 @@ library SortitionTrees {
     function toAccountAndCourtID(bytes32 _stakePathID) internal pure returns (address account, uint96 courtID) {
         assembly {
             // solium-disable-line security/no-inline-assembly
-            let ptr := mload(0x40)
-
-            // Read account address (first 20 bytes)
-            for {
-                let i := 0x00
-            } lt(i, 0x14) {
-                i := add(i, 0x01)
-            } {
-                mstore8(add(add(ptr, 0x0c), i), byte(i, _stakePathID))
-            }
-            account := mload(ptr)
-
-            // Read court ID (last 12 bytes)
-            for {
-                let i := 0x00
-            } lt(i, 0x0c) {
-                i := add(i, 0x01)
-            } {
-                mstore8(add(add(ptr, 0x14), i), byte(add(i, 0x14), _stakePathID))
-            }
-            courtID := mload(ptr)
+            // Unpack address (first 20 bytes) and courtID (last 12 bytes) from the stake path ID
+            account := shr(96, _stakePathID) // Right shift by 96 bits to get the address
+            courtID := and(_stakePathID, 0xffffffffffffffffffffffff) // Mask the lower 96 bits to get the court ID
         }
     }
 
diff --git a/contracts/src/test/SortitionTreesMock.sol b/contracts/src/test/SortitionTreesMock.sol
new file mode 100644
index 000000000..3dcfe8741
--- /dev/null
+++ b/contracts/src/test/SortitionTreesMock.sol
@@ -0,0 +1,154 @@
+// SPDX-License-Identifier: MIT
+pragma solidity ^0.8.24;
+
+import "../libraries/SortitionTrees.sol";
+
+/// @title SortitionTreesMock
+/// @dev Test contract to expose SortitionTrees library functions for testing
+contract SortitionTreesMock {
+    using SortitionTrees for mapping(TreeKey => SortitionTrees.Tree);
+
+    // Storage for multiple test trees
+    mapping(TreeKey => SortitionTrees.Tree) public trees;
+
+    // Court hierarchy helpers (for testing parent-child relationships)
+    mapping(uint96 => uint96[]) public childCourts;
+    mapping(uint96 => uint96) public parentCourt;
+
+    // ************************************* //
+    // *         Main Functions            * //
+    // ************************************* //
+
+    /// @dev Create a sortition sum tree for a court
+    function createTree(uint96 _courtID, uint256 _k) external {
+        TreeKey key = CourtID.wrap(_courtID).toTreeKey();
+        trees.createTree(key, _k);
+    }
+
+    /// @dev Set stake for a juror in a specific court
+    function set(uint96 _courtID, address _account, uint256 _value) external {
+        TreeKey key = CourtID.wrap(_courtID).toTreeKey();
+        bytes32 stakePathID = SortitionTrees.toStakePathID(_account, _courtID);
+        SortitionTrees.set(trees[key], _value, stakePathID);
+    }
+
+    /// @dev Draw a juror from a court's tree
+    function draw(
+        uint96 _courtID,
+        uint256 _disputeID,
+        uint256 _nonce,
+        uint256 _randomNumber
+    ) external view returns (address drawnAddress, uint96 fromSubcourtID) {
+        TreeKey key = CourtID.wrap(_courtID).toTreeKey();
+        return SortitionTrees.draw(trees[key], _disputeID, _nonce, _randomNumber);
+    }
+
+    /// @dev Get stake of a juror in a specific court
+    function stakeOf(uint96 _courtID, address _account) external view returns (uint256) {
+        TreeKey key = CourtID.wrap(_courtID).toTreeKey();
+        bytes32 stakePathID = SortitionTrees.toStakePathID(_account, _courtID);
+        return SortitionTrees.stakeOf(trees[key], stakePathID);
+    }
+
+    // ************************************* //
+    // *      Multi-Court Operations       * //
+    // ************************************* //
+
+    /// @dev Set stake for a juror across multiple courts (for testing hierarchy)
+    function setStakeInHierarchy(uint96[] calldata _courtIDs, address _account, uint256 _value) external {
+        for (uint256 i = 0; i < _courtIDs.length; i++) {
+            this.set(_courtIDs[i], _account, _value);
+        }
+    }
+
+    /// @dev Get stakes of a juror across multiple courts
+    function getStakesAcrossCourts(
+        address _account,
+        uint96[] calldata _courtIDs
+    ) external view returns (uint256[] memory stakes) {
+        stakes = new uint256[](_courtIDs.length);
+        for (uint256 i = 0; i < _courtIDs.length; i++) {
+            stakes[i] = this.stakeOf(_courtIDs[i], _account);
+        }
+    }
+
+    // ************************************* //
+    // *       Court Hierarchy Setup      * //
+    // ************************************* //
+
+    /// @dev Set parent court for testing hierarchy
+    function setParentCourt(uint96 _childCourt, uint96 _parentCourt) external {
+        parentCourt[_childCourt] = _parentCourt;
+    }
+
+    /// @dev Add child court for testing hierarchy
+    function addChildCourt(uint96 _parentCourt, uint96 _childCourt) external {
+        childCourts[_parentCourt].push(_childCourt);
+    }
+
+    /// @dev Get child courts
+    function getChildCourts(uint96 _parentCourt) external view returns (uint96[] memory) {
+        return childCourts[_parentCourt];
+    }
+
+    // ************************************* //
+    // *       Tree State Inspection      * //
+    // ************************************* //
+
+    /// @dev Get all nodes in a tree
+    function getTreeNodes(uint96 _courtID) external view returns (uint256[] memory) {
+        TreeKey key = CourtID.wrap(_courtID).toTreeKey();
+        return trees[key].nodes;
+    }
+
+    /// @dev Get tree K value
+    function getTreeK(uint96 _courtID) external view returns (uint256) {
+        TreeKey key = CourtID.wrap(_courtID).toTreeKey();
+        return trees[key].K;
+    }
+
+    /// @dev Get tree stack
+    function getTreeStack(uint96 _courtID) external view returns (uint256[] memory) {
+        TreeKey key = CourtID.wrap(_courtID).toTreeKey();
+        return trees[key].stack;
+    }
+
+    /// @dev Get node index for a juror in a court
+    function getNodeIndex(uint96 _courtID, address _account) external view returns (uint256) {
+        TreeKey key = CourtID.wrap(_courtID).toTreeKey();
+        bytes32 stakePathID = SortitionTrees.toStakePathID(_account, _courtID);
+        return trees[key].IDsToNodeIndexes[stakePathID];
+    }
+
+    /// @dev Check if a court tree exists
+    function courtExists(uint96 _courtID) external view returns (bool) {
+        TreeKey key = CourtID.wrap(_courtID).toTreeKey();
+        return trees[key].K != 0;
+    }
+
+    /// @dev Get the root sum (total stakes) of a court
+    function getRootSum(uint96 _courtID) external view returns (uint256) {
+        TreeKey key = CourtID.wrap(_courtID).toTreeKey();
+        if (trees[key].nodes.length == 0) return 0;
+        return trees[key].nodes[0];
+    }
+
+    // ************************************* //
+    // *         Utility Functions        * //
+    // ************************************* //
+
+    /// @dev Test function to pack address and court ID
+    function testToStakePathID(address _account, uint96 _courtID) external pure returns (bytes32) {
+        return SortitionTrees.toStakePathID(_account, _courtID);
+    }
+
+    /// @dev Test function to unpack stake path ID
+    function testToAccountAndCourtID(bytes32 _stakePathID) external pure returns (address account, uint96 courtID) {
+        return SortitionTrees.toAccountAndCourtID(_stakePathID);
+    }
+
+    /// @dev Test function to convert court ID to tree key
+    function testToTreeKey(uint96 _courtID) external pure returns (TreeKey) {
+        return CourtID.wrap(_courtID).toTreeKey();
+    }
+}
diff --git a/contracts/test/sortition/index.ts b/contracts/test/sortition/index.ts
new file mode 100644
index 000000000..e33d1a0d5
--- /dev/null
+++ b/contracts/test/sortition/index.ts
@@ -0,0 +1,698 @@
+import { expect } from "chai";
+import { ethers } from "hardhat";
+import { SortitionTreesMock } from "../../typechain-types";
+
+describe("SortitionTrees", function () {
+  let sortitionTree: SortitionTreesMock;
+  let accounts: any[];
+
+  beforeEach("Setup", async () => {
+    const factory = await ethers.getContractFactory("SortitionTreesMock");
+    sortitionTree = (await factory.deploy()) as SortitionTreesMock;
+    accounts = await ethers.getSigners();
+  });
+
+  // Helper function to create a test juror address
+  const getTestAddress = (index: number): string => accounts[index % accounts.length].address;
+
+  describe("Stake Path ID Utilities", function () {
+    it("Should convert correctly between stakePathID and account+courtID", async function () {
+      // Test various combinations of addresses and court IDs
+      const testCases = [
+        {
+          address: "0x1234567890123456789012345678901234567890",
+          courtID: 0,
+        },
+        {
+          address: "0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
+          courtID: 0xffffffffffff, // max uint96
+        },
+        {
+          address: "0x0000000000000000000000000000000000000001",
+          courtID: 1,
+        },
+        {
+          address: "0xDeaDbeefdEAdbeefdEadbEEFdeadbeEFdEaDbeeF",
+          courtID: 123456789,
+        },
+      ];
+
+      for (const testCase of testCases) {
+        // Test packing
+        const stakePathID = await sortitionTree.testToStakePathID(testCase.address, testCase.courtID);
+
+        // Test unpacking
+        const [unpackedAddress, unpackedCourtID] = await sortitionTree.testToAccountAndCourtID(stakePathID);
+
+        // Verify round-trip equivalence
+        expect(unpackedAddress.toLowerCase()).to.equal(testCase.address.toLowerCase());
+        expect(unpackedCourtID).to.equal(testCase.courtID);
+
+        // Verify the packed format is as expected: [20 bytes address][12 bytes courtID]
+        const expectedPackedValue = ethers.solidityPacked(["address", "uint96"], [testCase.address, testCase.courtID]);
+        expect(stakePathID).to.equal(expectedPackedValue);
+      }
+    });
+
+    it("Should handle TreeKey conversion correctly", async function () {
+      const courtIDs = [
+        0,
+        1,
+        100,
+        0xffffffffffff, // max uint96
+      ];
+
+      for (const courtID of courtIDs) {
+        const treeKey = await sortitionTree.testToTreeKey(courtID);
+
+        // TreeKey should be the courtID padded to 32 bytes
+        const expectedTreeKey = ethers.zeroPadValue(ethers.toBeHex(courtID), 32);
+        expect(treeKey).to.equal(expectedTreeKey);
+
+        // Court ID 0 will result in zero key, others should not
+        if (courtID === 0) {
+          expect(treeKey).to.equal("0x0000000000000000000000000000000000000000000000000000000000000000");
+        } else {
+          expect(treeKey).to.not.equal("0x0000000000000000000000000000000000000000000000000000000000000000");
+        }
+      }
+    });
+  });
+
+  describe("Tree Creation & Validation", function () {
+    it("Should create trees with valid K values", async function () {
+      const testCases = [
+        { courtID: 0, k: 2 },
+        { courtID: 1, k: 5 },
+        { courtID: 100, k: 10 },
+        { courtID: 999, k: 100 },
+      ];
+
+      for (const testCase of testCases) {
+        await sortitionTree.createTree(testCase.courtID, testCase.k);
+
+        // Verify tree was created
+        expect(await sortitionTree.courtExists(testCase.courtID)).to.be.true;
+        expect(await sortitionTree.getTreeK(testCase.courtID)).to.equal(testCase.k);
+
+        // Verify initial state
+        const nodes = await sortitionTree.getTreeNodes(testCase.courtID);
+        expect(nodes.length).to.equal(1);
+        expect(nodes[0]).to.equal(0); // Root starts at 0
+
+        const stack = await sortitionTree.getTreeStack(testCase.courtID);
+        expect(stack.length).to.equal(0); // Empty stack initially
+      }
+    });
+
+    it("Should reject invalid K values", async function () {
+      // K must be greater than 1
+      await expect(sortitionTree.createTree(0, 0)).to.be.reverted;
+      await expect(sortitionTree.createTree(1, 1)).to.be.reverted;
+    });
+
+    it("Should reject creating duplicate trees", async function () {
+      await sortitionTree.createTree(0, 2);
+      await expect(sortitionTree.createTree(0, 3)).to.be.reverted;
+    });
+
+    it("Should create multiple independent trees", async function () {
+      await sortitionTree.createTree(0, 2);
+      await sortitionTree.createTree(1, 3);
+      await sortitionTree.createTree(2, 5);
+
+      expect(await sortitionTree.getTreeK(0)).to.equal(2);
+      expect(await sortitionTree.getTreeK(1)).to.equal(3);
+      expect(await sortitionTree.getTreeK(2)).to.equal(5);
+    });
+  });
+
+  describe("Single Court Stake Management", function () {
+    beforeEach(async function () {
+      // Create a test tree with K=2 for court 0
+      await sortitionTree.createTree(0, 2);
+    });
+
+    describe("Adding New Stakes", function () {
+      it("Should add first juror to empty tree", async function () {
+        const juror = getTestAddress(0);
+        const stake = 100;
+
+        await sortitionTree.set(0, juror, stake);
+
+        // Verify stake was set
+        expect(await sortitionTree.stakeOf(0, juror)).to.equal(stake);
+        expect(await sortitionTree.getRootSum(0)).to.equal(stake);
+
+        // Verify tree structure
+        const nodes = await sortitionTree.getTreeNodes(0);
+        expect(nodes[0]).to.equal(stake); // Root should equal juror stake
+        expect(nodes[1]).to.equal(stake); // First leaf
+      });
+
+      it("Should add multiple jurors sequentially", async function () {
+        const stakes = [100, 200, 300];
+
+        for (let i = 0; i < stakes.length; i++) {
+          const juror = getTestAddress(i);
+          await sortitionTree.set(0, juror, stakes[i]);
+          expect(await sortitionTree.stakeOf(0, juror)).to.equal(stakes[i]);
+        }
+
+        // Verify total stake
+        const expectedTotal = stakes.reduce((sum, stake) => sum + stake, 0);
+        expect(await sortitionTree.getRootSum(0)).to.equal(expectedTotal);
+      });
+
+      it("Should handle tree restructuring when K threshold is reached", async function () {
+        // Add enough jurors to trigger tree restructuring
+        const stakes = [100, 200, 300, 400]; // More than K=2
+
+        for (let i = 0; i < stakes.length; i++) {
+          const juror = getTestAddress(i);
+          await sortitionTree.set(0, juror, stakes[i]);
+        }
+
+        const nodes = await sortitionTree.getTreeNodes(0);
+        expect(nodes.length).to.be.greaterThan(4); // Should have expanded
+
+        const expectedTotal = stakes.reduce((sum, stake) => sum + stake, 0);
+        expect(await sortitionTree.getRootSum(0)).to.equal(expectedTotal);
+      });
+    });
+
+    describe("Updating Existing Stakes", function () {
+      beforeEach(async function () {
+        // Add initial jurors
+        await sortitionTree.set(0, getTestAddress(0), 100);
+        await sortitionTree.set(0, getTestAddress(1), 200);
+      });
+
+      it("Should increase stake values correctly", async function () {
+        const juror = getTestAddress(0);
+        const oldStake = await sortitionTree.stakeOf(0, juror);
+        const newStake = 250;
+
+        await sortitionTree.set(0, juror, newStake);
+
+        expect(await sortitionTree.stakeOf(0, juror)).to.equal(newStake);
+
+        // Root should reflect the change
+        const rootSum = await sortitionTree.getRootSum(0);
+        expect(rootSum).to.equal(200 + newStake);
+      });
+
+      it("Should decrease stake values correctly", async function () {
+        const juror = getTestAddress(0);
+        const newStake = 50;
+
+        await sortitionTree.set(0, juror, newStake);
+
+        expect(await sortitionTree.stakeOf(0, juror)).to.equal(newStake);
+        expect(await sortitionTree.getRootSum(0)).to.equal(200 + newStake);
+      });
+
+      it("Should be no-op when setting same value", async function () {
+        const juror = getTestAddress(0);
+        const currentStake = await sortitionTree.stakeOf(0, juror);
+        const initialRoot = await sortitionTree.getRootSum(0);
+
+        await sortitionTree.set(0, juror, currentStake);
+
+        expect(await sortitionTree.stakeOf(0, juror)).to.equal(currentStake);
+        expect(await sortitionTree.getRootSum(0)).to.equal(initialRoot);
+      });
+    });
+
+    describe("Removing Stakes", function () {
+      beforeEach(async function () {
+        // Add initial jurors
+        await sortitionTree.set(0, getTestAddress(0), 100);
+        await sortitionTree.set(0, getTestAddress(1), 200);
+        await sortitionTree.set(0, getTestAddress(2), 300);
+      });
+
+      it("Should remove juror by setting stake to 0", async function () {
+        const juror = getTestAddress(1);
+        const initialRoot = await sortitionTree.getRootSum(0);
+
+        await sortitionTree.set(0, juror, 0);
+
+        expect(await sortitionTree.stakeOf(0, juror)).to.equal(0);
+        expect(await sortitionTree.getRootSum(0)).to.equal(initialRoot - 200n);
+        expect(await sortitionTree.getNodeIndex(0, juror)).to.equal(0); // Should be cleared
+      });
+
+      it("Should manage stack for removed positions", async function () {
+        const juror = getTestAddress(1);
+        const initialStackLength = (await sortitionTree.getTreeStack(0)).length;
+
+        await sortitionTree.set(0, juror, 0);
+
+        const newStackLength = (await sortitionTree.getTreeStack(0)).length;
+        expect(newStackLength).to.be.greaterThan(initialStackLength);
+      });
+
+      it("Should reuse vacant positions from stack", async function () {
+        const juror1 = getTestAddress(1);
+        const juror4 = getTestAddress(4);
+
+        // Remove a juror
+        await sortitionTree.set(0, juror1, 0);
+        const stackAfterRemoval = await sortitionTree.getTreeStack(0);
+
+        // Add a new juror (should reuse vacant position)
+        await sortitionTree.set(0, juror4, 150);
+        const stackAfterAdd = await sortitionTree.getTreeStack(0);
+
+        expect(stackAfterAdd.length).to.equal(stackAfterRemoval.length - 1);
+        expect(await sortitionTree.stakeOf(0, juror4)).to.equal(150);
+      });
+    });
+  });
+
+  describe("Drawing Algorithm", function () {
+    beforeEach(async function () {
+      await sortitionTree.createTree(0, 2);
+    });
+
+    it("Should return zero address for empty tree", async function () {
+      const [drawnAddress, courtID] = await sortitionTree.draw(0, 1, 1, 12345);
+      expect(drawnAddress).to.equal(ethers.ZeroAddress);
+      expect(courtID).to.equal(0);
+    });
+
+    it("Should draw single juror from single-juror tree", async function () {
+      const juror = getTestAddress(0);
+      await sortitionTree.set(0, juror, 100);
+
+      // Multiple draws should always return the same juror
+      for (let i = 0; i < 5; i++) {
+        const [drawnAddress, courtID] = await sortitionTree.draw(0, 1, i, 12345 + i);
+        expect(drawnAddress.toLowerCase()).to.equal(juror.toLowerCase());
+        expect(courtID).to.equal(0);
+      }
+    });
+
+    it("Should draw deterministically with same inputs", async function () {
+      // Add multiple jurors
+      await sortitionTree.set(0, getTestAddress(0), 100);
+      await sortitionTree.set(0, getTestAddress(1), 200);
+      await sortitionTree.set(0, getTestAddress(2), 300);
+
+      const disputeID = 1;
+      const nonce = 2;
+      const randomNumber = 12345;
+
+      // Multiple calls with same parameters should return same result
+      const [address1] = await sortitionTree.draw(0, disputeID, nonce, randomNumber);
+      const [address2] = await sortitionTree.draw(0, disputeID, nonce, randomNumber);
+      const [address3] = await sortitionTree.draw(0, disputeID, nonce, randomNumber);
+
+      expect(address1).to.equal(address2);
+      expect(address2).to.equal(address3);
+    });
+
+    it("Should respect weighted probability distribution", async function () {
+      // Add jurors with very different stakes to test weighting
+      await sortitionTree.set(0, getTestAddress(0), 1); // Very low stake
+      await sortitionTree.set(0, getTestAddress(1), 1000); // Very high stake
+
+      let draws = { [getTestAddress(0).toLowerCase()]: 0, [getTestAddress(1).toLowerCase()]: 0 };
+
+      // Perform many draws with different random numbers
+      const numDraws = 100;
+      for (let i = 0; i < numDraws; i++) {
+        const [drawnAddress] = await sortitionTree.draw(0, 1, 1, i);
+        draws[drawnAddress.toLowerCase()]++;
+      }
+
+      // Juror with higher stake should be drawn more frequently
+      // With stakes of 1:1000, we expect roughly 0.1% vs 99.9% distribution
+      expect(draws[getTestAddress(1).toLowerCase()]).to.be.greaterThan(draws[getTestAddress(0).toLowerCase()]);
+      expect(draws[getTestAddress(1).toLowerCase()]).to.be.greaterThan(numDraws * 0.8); // At least 80% for high stake
+    });
+
+    it("Should handle edge case random numbers", async function () {
+      await sortitionTree.set(0, getTestAddress(0), 100);
+      await sortitionTree.set(0, getTestAddress(1), 200);
+
+      // Test with boundary random numbers
+      const testNumbers = [0, 1, ethers.MaxUint256];
+
+      for (const randomNumber of testNumbers) {
+        const [drawnAddress] = await sortitionTree.draw(0, 1, 1, randomNumber);
+        expect(drawnAddress).to.not.equal(ethers.ZeroAddress);
+
+        // Should be one of our jurors
+        const isValidJuror =
+          drawnAddress.toLowerCase() === getTestAddress(0).toLowerCase() ||
+          drawnAddress.toLowerCase() === getTestAddress(1).toLowerCase();
+        expect(isValidJuror).to.be.true;
+      }
+    });
+  });
+
+  describe("Multi-Court Scenarios", function () {
+    beforeEach(async function () {
+      // Create multiple courts with different K values
+      await sortitionTree.createTree(0, 2); // General Court
+      await sortitionTree.createTree(1, 3); // Tech Court
+      await sortitionTree.createTree(2, 2); // Legal Court
+    });
+
+    describe("Independent Court Operations", function () {
+      it("Should handle same juror staking in multiple courts", async function () {
+        const juror = getTestAddress(0);
+        const stakes = [100, 250, 75]; // Different stakes in different courts
+
+        // Set stakes in different courts
+        for (let courtID = 0; courtID < 3; courtID++) {
+          await sortitionTree.set(courtID, juror, stakes[courtID]);
+        }
+
+        // Verify stakes are independent
+        for (let courtID = 0; courtID < 3; courtID++) {
+          expect(await sortitionTree.stakeOf(courtID, juror)).to.equal(stakes[courtID]);
+          expect(await sortitionTree.getRootSum(courtID)).to.equal(stakes[courtID]);
+        }
+      });
+
+      it("Should maintain court isolation", async function () {
+        const juror1 = getTestAddress(0);
+        const juror2 = getTestAddress(1);
+
+        // Add different jurors to different courts
+        await sortitionTree.set(0, juror1, 100);
+        await sortitionTree.set(1, juror2, 200);
+
+        // Court 0 should only have juror1
+        expect(await sortitionTree.stakeOf(0, juror1)).to.equal(100);
+        expect(await sortitionTree.stakeOf(0, juror2)).to.equal(0);
+
+        // Court 1 should only have juror2
+        expect(await sortitionTree.stakeOf(1, juror1)).to.equal(0);
+        expect(await sortitionTree.stakeOf(1, juror2)).to.equal(200);
+      });
+
+      it("Should handle different tree structures independently", async function () {
+        const jurors = [getTestAddress(0), getTestAddress(1), getTestAddress(2), getTestAddress(3)];
+
+        // Add different numbers of jurors to each court
+        await sortitionTree.set(0, jurors[0], 100); // 1 juror in court 0
+
+        await sortitionTree.set(1, jurors[0], 150); // 2 jurors in court 1
+        await sortitionTree.set(1, jurors[1], 250);
+
+        await sortitionTree.set(2, jurors[0], 75); // 3 jurors in court 2
+        await sortitionTree.set(2, jurors[1], 125);
+        await sortitionTree.set(2, jurors[2], 175);
+
+        // Verify independent tree structures
+        expect(await sortitionTree.getRootSum(0)).to.equal(100);
+        expect(await sortitionTree.getRootSum(1)).to.equal(400);
+        expect(await sortitionTree.getRootSum(2)).to.equal(375);
+
+        // Verify each court has correct tree structure
+        const nodes0 = await sortitionTree.getTreeNodes(0);
+        const nodes1 = await sortitionTree.getTreeNodes(1);
+        const nodes2 = await sortitionTree.getTreeNodes(2);
+
+        expect(nodes0.length).to.be.lessThan(nodes2.length); // Fewer jurors = smaller tree
+        expect(nodes1.length).to.be.greaterThan(nodes0.length); // More jurors = larger tree
+      });
+    });
+
+    describe("Cross-Court Stake Updates", function () {
+      it("Should handle simultaneous updates across multiple courts", async function () {
+        const juror = getTestAddress(0);
+        const courtIDs = [0, 1, 2];
+        const initialStakes = [100, 200, 300];
+        const updatedStakes = [150, 250, 350];
+
+        // Set initial stakes
+        for (let i = 0; i < courtIDs.length; i++) {
+          await sortitionTree.set(courtIDs[i], juror, initialStakes[i]);
+        }
+
+        // Update all stakes
+        for (let i = 0; i < courtIDs.length; i++) {
+          await sortitionTree.set(courtIDs[i], juror, updatedStakes[i]);
+        }
+
+        // Verify all updates took effect
+        for (let i = 0; i < courtIDs.length; i++) {
+          expect(await sortitionTree.stakeOf(courtIDs[i], juror)).to.equal(updatedStakes[i]);
+        }
+      });
+
+      it("Should handle partial removals across courts", async function () {
+        const juror = getTestAddress(0);
+
+        // Add juror to all courts
+        await sortitionTree.set(0, juror, 100);
+        await sortitionTree.set(1, juror, 200);
+        await sortitionTree.set(2, juror, 300);
+
+        // Remove from middle court only
+        await sortitionTree.set(1, juror, 0);
+
+        // Verify partial removal
+        expect(await sortitionTree.stakeOf(0, juror)).to.equal(100);
+        expect(await sortitionTree.stakeOf(1, juror)).to.equal(0);
+        expect(await sortitionTree.stakeOf(2, juror)).to.equal(300);
+      });
+
+      it("Should use batch operations correctly", async function () {
+        const juror = getTestAddress(0);
+        const courtIDs = [0, 1, 2];
+        const stake = 500;
+
+        // Use batch operation to set stakes
+        await sortitionTree.setStakeInHierarchy(courtIDs, juror, stake);
+
+        // Verify all stakes were set
+        const stakes = await sortitionTree.getStakesAcrossCourts(juror, courtIDs);
+        for (const retrievedStake of stakes) {
+          expect(retrievedStake).to.equal(stake);
+        }
+      });
+    });
+
+    describe("Multi-Court Drawing", function () {
+      beforeEach(async function () {
+        // Setup jurors in different courts
+        await sortitionTree.set(0, getTestAddress(0), 100); // Court 0: 1 juror
+        await sortitionTree.set(0, getTestAddress(1), 200);
+
+        await sortitionTree.set(1, getTestAddress(1), 300); // Court 1: 2 jurors
+        await sortitionTree.set(1, getTestAddress(2), 400);
+
+        await sortitionTree.set(2, getTestAddress(0), 500); // Court 2: 1 juror only
+      });
+
+      it("Should draw correctly from different courts", async function () {
+        // Draw from each court
+        const [addr0] = await sortitionTree.draw(0, 1, 1, 12345);
+        const [addr1] = await sortitionTree.draw(1, 1, 1, 12345);
+        const [addr2] = await sortitionTree.draw(2, 1, 1, 12345);
+
+        // Should get valid addresses from each court
+        expect(addr0).to.not.equal(ethers.ZeroAddress);
+        expect(addr1).to.not.equal(ethers.ZeroAddress);
+        expect(addr2).to.not.equal(ethers.ZeroAddress);
+
+        // Court 2 should always return getTestAddress(0) since it's the only juror
+        expect(addr2.toLowerCase()).to.equal(getTestAddress(0).toLowerCase());
+      });
+
+      it("Should return correct court ID in draw results", async function () {
+        const [, courtID0] = await sortitionTree.draw(0, 1, 1, 12345);
+        const [, courtID1] = await sortitionTree.draw(1, 1, 1, 12345);
+        const [, courtID2] = await sortitionTree.draw(2, 1, 1, 12345);
+
+        // The returned court IDs should match the stake path IDs
+        // Since we're using the same court for staking and drawing, they should match
+        expect([0, 1]).to.include(Number(courtID0));
+        expect([1, 2]).to.include(Number(courtID1));
+        expect(Number(courtID2)).to.equal(2);
+      });
+
+      it("Should maintain independent probability distributions", async function () {
+        // Test drawing many times from court 0 where juror 1 has 2x stake of juror 0
+        let draws = { [getTestAddress(0).toLowerCase()]: 0, [getTestAddress(1).toLowerCase()]: 0 };
+
+        const numDraws = 50;
+        for (let i = 0; i < numDraws; i++) {
+          const [drawnAddress] = await sortitionTree.draw(0, 1, 1, i);
+          draws[drawnAddress.toLowerCase()]++;
+        }
+
+        // Juror 1 (200 stake) should be drawn more than juror 0 (100 stake)
+        expect(draws[getTestAddress(1).toLowerCase()]).to.be.greaterThan(draws[getTestAddress(0).toLowerCase()]);
+      });
+    });
+
+    describe("Complex Multi-Court Scenarios", function () {
+      it("Should handle realistic court hierarchy simulation", async function () {
+        // Simulate: General Court (0) ← Tech Court (1) ← Blockchain Court (2)
+        const courts = [0, 1, 2];
+        const jurors = [getTestAddress(0), getTestAddress(1), getTestAddress(2), getTestAddress(3)];
+
+        // General lawyers (stake in General Court only)
+        await sortitionTree.set(0, jurors[0], 100);
+        await sortitionTree.set(0, jurors[1], 150);
+
+        // Tech specialists (stake in both General and Tech)
+        await sortitionTree.set(0, jurors[2], 200);
+        await sortitionTree.set(1, jurors[2], 300);
+
+        // Blockchain experts (stake in all three)
+        await sortitionTree.set(0, jurors[3], 250);
+        await sortitionTree.set(1, jurors[3], 350);
+        await sortitionTree.set(2, jurors[3], 450);
+
+        // Verify hierarchy totals
+        expect(await sortitionTree.getRootSum(0)).to.equal(700); // All jurors
+        expect(await sortitionTree.getRootSum(1)).to.equal(650); // Tech specialists + experts
+        expect(await sortitionTree.getRootSum(2)).to.equal(450); // Blockchain experts only
+
+        // Test drawing from most specialized court (should only get experts)
+        const [blockchainExpert] = await sortitionTree.draw(2, 1, 1, 12345);
+        expect(blockchainExpert.toLowerCase()).to.equal(jurors[3].toLowerCase());
+      });
+
+      it("Should handle dynamic court operations", async function () {
+        const juror = getTestAddress(0);
+
+        // Juror starts in general court
+        await sortitionTree.set(0, juror, 100);
+        expect(await sortitionTree.stakeOf(0, juror)).to.equal(100);
+
+        // Juror specializes in tech court
+        await sortitionTree.set(1, juror, 200);
+        expect(await sortitionTree.stakeOf(0, juror)).to.equal(100);
+        expect(await sortitionTree.stakeOf(1, juror)).to.equal(200);
+
+        // Juror reduces general court involvement but increases tech specialization
+        await sortitionTree.set(0, juror, 50);
+        await sortitionTree.set(1, juror, 400);
+        expect(await sortitionTree.stakeOf(0, juror)).to.equal(50);
+        expect(await sortitionTree.stakeOf(1, juror)).to.equal(400);
+
+        // Juror completely leaves general court
+        await sortitionTree.set(0, juror, 0);
+        expect(await sortitionTree.stakeOf(0, juror)).to.equal(0);
+        expect(await sortitionTree.stakeOf(1, juror)).to.equal(400);
+      });
+
+      it("Should handle large multi-court operations efficiently", async function () {
+        const numCourts = 5;
+        const numJurors = 10;
+
+        // Create additional courts
+        for (let courtID = 3; courtID < numCourts; courtID++) {
+          await sortitionTree.createTree(courtID, 2);
+        }
+
+        // Add many jurors across many courts
+        for (let jurorIdx = 0; jurorIdx < numJurors; jurorIdx++) {
+          for (let courtID = 0; courtID < numCourts; courtID++) {
+            const stake = (jurorIdx + 1) * (courtID + 1) * 10; // Varied stakes
+            await sortitionTree.set(courtID, getTestAddress(jurorIdx), stake);
+          }
+        }
+
+        // Verify all operations completed successfully
+        for (let courtID = 0; courtID < numCourts; courtID++) {
+          const rootSum = await sortitionTree.getRootSum(courtID);
+          expect(rootSum).to.be.greaterThan(0);
+
+          // Should be able to draw from each court
+          const [drawnAddress] = await sortitionTree.draw(courtID, 1, 1, 12345 + courtID);
+          expect(drawnAddress).to.not.equal(ethers.ZeroAddress);
+        }
+      });
+    });
+  });
+
+  describe("Edge Cases & Error Conditions", function () {
+    it("Should handle operations on non-existent courts", async function () {
+      const juror = getTestAddress(0);
+
+      // Operations on non-existent court should behave predictably
+      expect(await sortitionTree.courtExists(999)).to.be.false;
+      expect(await sortitionTree.stakeOf(999, juror)).to.equal(0);
+
+      // Drawing from non-existent court should revert (no tree = no nodes array)
+      await expect(sortitionTree.draw(999, 1, 1, 12345)).to.be.reverted;
+    });
+
+    it("Should handle boundary values correctly", async function () {
+      await sortitionTree.createTree(0, 2);
+      const juror = getTestAddress(0);
+
+      // Test with maximum stake value
+      const maxStake = ethers.MaxUint256;
+
+      // This might fail due to gas limits, but should not revert due to overflow
+      // Note: In practice, stakes would be much smaller
+      try {
+        await sortitionTree.set(0, juror, maxStake);
+        expect(await sortitionTree.stakeOf(0, juror)).to.equal(maxStake);
+      } catch (error) {
+        // Expected to fail due to gas limits, not due to overflow
+        expect(error).to.match(/gas/i);
+      }
+    });
+
+    it("Should maintain tree invariants under stress", async function () {
+      await sortitionTree.createTree(0, 3);
+
+      const operations = [];
+      const stakes = [100, 200, 300, 400, 500];
+      const jurors = stakes.map((_, i) => getTestAddress(i));
+
+      // Perform many random operations
+      for (let i = 0; i < 20; i++) {
+        const juror = jurors[i % jurors.length];
+        const stake = stakes[i % stakes.length];
+
+        await sortitionTree.set(0, juror, stake);
+        operations.push({ juror, stake });
+      }
+
+      // Verify tree integrity
+      let expectedTotal = 0;
+      const finalStakes = new Map();
+
+      // Calculate expected final state
+      for (const op of operations) {
+        const prevStake = finalStakes.get(op.juror) || 0;
+        expectedTotal = expectedTotal - prevStake + op.stake;
+        finalStakes.set(op.juror, op.stake);
+      }
+
+      // Verify actual state matches expected
+      expect(await sortitionTree.getRootSum(0)).to.equal(expectedTotal);
+
+      for (const [juror, expectedStake] of finalStakes) {
+        expect(await sortitionTree.stakeOf(0, juror)).to.equal(expectedStake);
+      }
+    });
+
+    it("Should handle rapid stake changes correctly", async function () {
+      await sortitionTree.createTree(0, 2);
+      const juror = getTestAddress(0);
+
+      // Rapid stake changes
+      const stakeSequence = [100, 0, 200, 300, 0, 150, 0, 500];
+
+      for (const stake of stakeSequence) {
+        await sortitionTree.set(0, juror, stake);
+        expect(await sortitionTree.stakeOf(0, juror)).to.equal(stake);
+        expect(await sortitionTree.getRootSum(0)).to.equal(stake);
+      }
+    });
+  });
+});

From d79497542273b66d021cb711b99d6acb71656643 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 3 Sep 2025 23:24:36 +0100
Subject: [PATCH 081/175] chore: changelog

---
 contracts/CHANGELOG.md | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/contracts/CHANGELOG.md b/contracts/CHANGELOG.md
index 79845b880..d919c236a 100644
--- a/contracts/CHANGELOG.md
+++ b/contracts/CHANGELOG.md
@@ -13,6 +13,7 @@ The format is based on [Common Changelog](https://common-changelog.org/).
 - **Breaking:** Rename the interface from `RNG` to `IRNG` ([#2054](https://github.com/kleros/kleros-v2/issues/2054))
 - **Breaking:** Remove the `_block` parameter from `IRNG.requestRandomness()` and `IRNG.receiveRandomness()`, not needed for the primary VRF-based RNG ([#2054](https://github.com/kleros/kleros-v2/issues/2054))
 - **Breaking:** Rename `governor` to `owner` in order to comply with the lightweight ownership standard [ERC-5313](https://eipsinsight.com/ercs/erc-5313) ([#2112](https://github.com/kleros/kleros-v2/issues/2112))
+- **Breaking:** Add a new state variable `jumpDisputeKitID` to the `DisputeKitClassicBase` contract ([#2114](https://github.com/kleros/kleros-v2/issues/2114))
 - Make the primary VRF-based RNG fall back to `BlockhashRNG` if the VRF request is not fulfilled within a timeout ([#2054](https://github.com/kleros/kleros-v2/issues/2054))
 - Authenticate the calls to the RNGs to prevent 3rd parties from depleting the Chainlink VRF subscription funds ([#2054](https://github.com/kleros/kleros-v2/issues/2054))
 - Use `block.timestamp` rather than `block.number` for `BlockhashRNG` for better reliability on Arbitrum as block production is sporadic depending on network conditions. ([#2054](https://github.com/kleros/kleros-v2/issues/2054))
@@ -27,6 +28,7 @@ The format is based on [Common Changelog](https://common-changelog.org/).
 ### Added
 
 - Allow the dispute kits to force an early court jump and to override the number of votes after an appeal (future-proofing) ([#2110](https://github.com/kleros/kleros-v2/issues/2110))
+- Allow the dispute kits to specify which new dispute kit to use when a court jump occurs ([#2114](https://github.com/kleros/kleros-v2/issues/2114))
 
 ### Fixed
 

From 62b0a50ab52b40e4ed70dc53b004b60874e1f805 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 3 Sep 2025 23:33:39 +0100
Subject: [PATCH 082/175] fix: deploy script

---
 contracts/deploy/00-home-chain-arbitration-neo.ts | 6 +++---
 contracts/deploy/00-home-chain-arbitration.ts     | 6 +++---
 2 files changed, 6 insertions(+), 6 deletions(-)

diff --git a/contracts/deploy/00-home-chain-arbitration-neo.ts b/contracts/deploy/00-home-chain-arbitration-neo.ts
index c5e50d6a2..36a895c74 100644
--- a/contracts/deploy/00-home-chain-arbitration-neo.ts
+++ b/contracts/deploy/00-home-chain-arbitration-neo.ts
@@ -129,7 +129,7 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
     log: true,
   });
   await core.addNewDisputeKit(disputeKitShutter.address);
-  const disputeKitShutterID = Number(await core.getDisputeKitsLength());
+  const disputeKitShutterID = (await core.getDisputeKitsLength()) - 1n;
 
   const disputeKitGated = await deployUpgradable(deployments, "DisputeKitGated", {
     from: deployer,
@@ -137,7 +137,7 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
     log: true,
   });
   await core.addNewDisputeKit(disputeKitGated.address);
-  const disputeKitGatedID = Number(await core.getDisputeKitsLength());
+  const disputeKitGatedID = (await core.getDisputeKitsLength()) - 1n;
 
   const disputeKitGatedShutter = await deployUpgradable(deployments, "DisputeKitGatedShutter", {
     from: deployer,
@@ -145,7 +145,7 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
     log: true,
   });
   await core.addNewDisputeKit(disputeKitGatedShutter.address);
-  const disputeKitGatedShutterID = Number(await core.getDisputeKitsLength());
+  const disputeKitGatedShutterID = (await core.getDisputeKitsLength()) - 1n;
 
   // Snapshot proxy
   await deploy("KlerosCoreSnapshotProxy", {
diff --git a/contracts/deploy/00-home-chain-arbitration.ts b/contracts/deploy/00-home-chain-arbitration.ts
index 8163c6f66..25291052d 100644
--- a/contracts/deploy/00-home-chain-arbitration.ts
+++ b/contracts/deploy/00-home-chain-arbitration.ts
@@ -110,7 +110,7 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
     log: true,
   });
   await core.addNewDisputeKit(disputeKitShutter.address);
-  const disputeKitShutterID = Number(await core.getDisputeKitsLength());
+  const disputeKitShutterID = (await core.getDisputeKitsLength()) - 1n;
   await core.enableDisputeKits(Courts.GENERAL, [disputeKitShutterID], true); // enable disputeKitShutter on the General Court
 
   const disputeKitGated = await deployUpgradable(deployments, "DisputeKitGated", {
@@ -119,7 +119,7 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
     log: true,
   });
   await core.addNewDisputeKit(disputeKitGated.address);
-  const disputeKitGatedID = Number(await core.getDisputeKitsLength());
+  const disputeKitGatedID = (await core.getDisputeKitsLength()) - 1n;
   await core.enableDisputeKits(Courts.GENERAL, [disputeKitGatedID], true); // enable disputeKitGated on the General Court
 
   const disputeKitGatedShutter = await deployUpgradable(deployments, "DisputeKitGatedShutter", {
@@ -128,7 +128,7 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
     log: true,
   });
   await core.addNewDisputeKit(disputeKitGatedShutter.address);
-  const disputeKitGatedShutterID = Number(await core.getDisputeKitsLength());
+  const disputeKitGatedShutterID = (await core.getDisputeKitsLength()) - 1n;
   await core.enableDisputeKits(Courts.GENERAL, [disputeKitGatedShutterID], true); // enable disputeKitGatedShutter on the General Court
 
   // Snapshot proxy

From 188f8d0674c1e0dcd9e822d6e6ab35d0b0fad11e Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 20 Aug 2025 23:02:03 +0100
Subject: [PATCH 083/175] feat: support for recovery hash in Shutter DK

---
 contracts/foundry.toml                        |  3 +-
 contracts/hardhat.config.ts                   |  1 +
 .../dispute-kits/DisputeKitClassicBase.sol    | 31 +++++---
 .../dispute-kits/DisputeKitShutter.sol        | 72 +++++++++++++++++--
 4 files changed, 91 insertions(+), 16 deletions(-)

diff --git a/contracts/foundry.toml b/contracts/foundry.toml
index 00b0c68b8..236208534 100644
--- a/contracts/foundry.toml
+++ b/contracts/foundry.toml
@@ -1,9 +1,10 @@
 
 [profile.default]
 solc = "0.8.30"
+evm_version = "cancun"
 via_ir = true
 optimizer = true
-optimizer_runs = 500
+optimizer_runs = 10000
 optimizer_details = { yulDetails = { stackAllocation = true } }
 additional_compiler_profiles = [
     { name = "tests", via_ir = false }
diff --git a/contracts/hardhat.config.ts b/contracts/hardhat.config.ts
index d451ef05f..9d8e9c49d 100644
--- a/contracts/hardhat.config.ts
+++ b/contracts/hardhat.config.ts
@@ -28,6 +28,7 @@ const config: HardhatUserConfig = {
       {
         version: "0.8.30",
         settings: {
+          evmVersion: "cancun",
           viaIR: process.env.VIA_IR !== "false", // Defaults to true
           optimizer: {
             enabled: true,
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index 577364cde..d04ccf981 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -318,19 +318,21 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         if (_voteIDs.length == 0) revert EmptyVoteIDs();
         if (!coreDisputeIDToActive[_coreDisputeID]) revert NotActiveForCoreDisputeID();
 
-        Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];
+        uint256 localDisputeID = coreDisputeIDToLocal[_coreDisputeID];
+        Dispute storage dispute = disputes[localDisputeID];
         if (_choice > dispute.numberOfChoices) revert ChoiceOutOfBounds();
 
-        Round storage round = dispute.rounds[dispute.rounds.length - 1];
+        uint256 localRoundID = dispute.rounds.length - 1;
+        Round storage round = dispute.rounds[localRoundID];
         {
             (uint96 courtID, , , , ) = core.disputes(_coreDisputeID);
             (, bool hiddenVotes, , , , , ) = core.courts(courtID);
-            bytes32 voteHash = hashVote(_choice, _salt, _justification);
+            bytes32 actualVoteHash = hashVote(_choice, _salt, _justification);
 
             //  Save the votes.
             for (uint256 i = 0; i < _voteIDs.length; i++) {
                 if (round.votes[_voteIDs[i]].account != _juror) revert JurorHasToOwnTheVote();
-                if (hiddenVotes && round.votes[_voteIDs[i]].commit != voteHash)
+                if (hiddenVotes && getExpectedVoteHash(localDisputeID, localRoundID, _voteIDs[i]) != actualVoteHash)
                     revert HashDoesNotMatchHiddenVoteCommitment();
                 if (round.votes[_voteIDs[i]].voted) revert VoteAlreadyCast();
                 round.votes[_voteIDs[i]].choice = _choice;
@@ -484,15 +486,14 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
      * @dev Computes the hash of a vote using ABI encoding
      * @dev The unused parameters may be used by overriding contracts.
      * @param _choice The choice being voted for
-     * @param _justification The justification for the vote
      * @param _salt A random salt for commitment
      * @return bytes32 The hash of the encoded vote parameters
      */
     function hashVote(
         uint256 _choice,
         uint256 _salt,
-        string memory _justification
-    ) public pure virtual returns (bytes32) {
+        string memory /*_justification*/
+    ) public view virtual returns (bytes32) {
         return keccak256(abi.encodePacked(_choice, _salt));
     }
 
@@ -738,17 +739,29 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     // *            Internal               * //
     // ************************************* //
 
+    /// @dev Returns the expected vote hash for a given vote.
+    /// @param _localDisputeID The ID of the dispute in the Dispute Kit.
+    /// @param _localRoundID The ID of the round in the Dispute Kit.
+    /// @param _voteID The ID of the vote.
+    /// @return The expected vote hash.
+    function getExpectedVoteHash(
+        uint256 _localDisputeID,
+        uint256 _localRoundID,
+        uint256 _voteID
+    ) internal view virtual returns (bytes32) {
+        return disputes[_localDisputeID].rounds[_localRoundID].votes[_voteID].commit;
+    }
+
     /// @dev Checks that the chosen address satisfies certain conditions for being drawn.
     /// Note that we don't check the minStake requirement here because of the implicit staking in parent courts.
     /// minStake is checked directly during staking process however it's possible for the juror to get drawn
     /// while having < minStake if it is later increased by governance.
     /// This issue is expected and harmless.
-    /// @param _round The round in which the juror is being drawn.
     /// @param _coreDisputeID ID of the dispute in the core contract.
     /// @param _juror Chosen address.
     /// @return result Whether the address passes the check or not.
     function _postDrawCheck(
-        Round storage _round,
+        Round storage /*_round*/,
         uint256 _coreDisputeID,
         address _juror
     ) internal view virtual returns (bool result) {
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol b/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
index 0dfbf6985..2b1a6d063 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
@@ -1,6 +1,6 @@
 // SPDX-License-Identifier: MIT
 
-pragma solidity ^0.8.24;
+pragma solidity ^0.8.28;
 
 import {DisputeKitClassicBase, KlerosCore} from "./DisputeKitClassicBase.sol";
 
@@ -14,6 +14,19 @@ import {DisputeKitClassicBase, KlerosCore} from "./DisputeKitClassicBase.sol";
 contract DisputeKitShutter is DisputeKitClassicBase {
     string public constant override version = "0.13.0";
 
+    // ************************************* //
+    // *             Storage               * //
+    // ************************************* //
+
+    mapping(uint256 localDisputeID => mapping(uint256 localRoundID => mapping(uint256 voteID => bytes32 recoveryCommitment)))
+        public recoveryCommitments;
+
+    // ************************************* //
+    // *        Transient Storage          * //
+    // ************************************* //
+
+    bool transient callerIsJuror;
+
     // ************************************* //
     // *              Events               * //
     // ************************************* //
@@ -22,12 +35,14 @@ contract DisputeKitShutter is DisputeKitClassicBase {
     /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.
     /// @param _juror The address of the juror casting the vote commitment.
     /// @param _commit The commitment hash.
+    /// @param _recoveryCommit The commitment hash without the justification.
     /// @param _identity The Shutter identity used for encryption.
     /// @param _encryptedVote The Shutter encrypted vote.
     event CommitCastShutter(
         uint256 indexed _coreDisputeID,
         address indexed _juror,
         bytes32 indexed _commit,
+        bytes32 _recoveryCommit,
         bytes32 _identity,
         bytes _encryptedVote
     );
@@ -80,17 +95,29 @@ contract DisputeKitShutter is DisputeKitClassicBase {
     /// @param _coreDisputeID The ID of the dispute in Kleros Core.
     /// @param _voteIDs The IDs of the votes.
     /// @param _commit The commitment hash including the justification.
+    /// @param _recoveryCommit The commitment hash without the justification.
     /// @param _identity The Shutter identity used for encryption.
     /// @param _encryptedVote The Shutter encrypted vote.
     function castCommitShutter(
         uint256 _coreDisputeID,
         uint256[] calldata _voteIDs,
         bytes32 _commit,
+        bytes32 _recoveryCommit,
         bytes32 _identity,
         bytes calldata _encryptedVote
     ) external notJumped(_coreDisputeID) {
+        if (_recoveryCommit == bytes32(0)) revert EmptyRecoveryCommit();
+
+        uint256 localDisputeID = coreDisputeIDToLocal[_coreDisputeID];
+        Dispute storage dispute = disputes[localDisputeID];
+        uint256 localRoundID = dispute.rounds.length - 1;
+        for (uint256 i = 0; i < _voteIDs.length; i++) {
+            recoveryCommitments[localDisputeID][localRoundID][_voteIDs[i]] = _recoveryCommit;
+        }
+
+        // `_castCommit()` ensures that the caller owns the vote
         _castCommit(_coreDisputeID, _voteIDs, _commit);
-        emit CommitCastShutter(_coreDisputeID, msg.sender, _commit, _identity, _encryptedVote);
+        emit CommitCastShutter(_coreDisputeID, msg.sender, _commit, _recoveryCommit, _identity, _encryptedVote);
     }
 
     function castVoteShutter(
@@ -103,8 +130,12 @@ contract DisputeKitShutter is DisputeKitClassicBase {
         Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];
         address juror = dispute.rounds[dispute.rounds.length - 1].votes[_voteIDs[0]].account;
 
-        // _castVote() ensures that all the _voteIDs do belong to `juror`
+        callerIsJuror = juror == msg.sender;
+
+        // `_castVote()` ensures that all the `_voteIDs` do belong to `juror`
         _castVote(_coreDisputeID, _voteIDs, _choice, _salt, _justification, juror);
+
+        callerIsJuror = false;
     }
 
     // ************************************* //
@@ -122,8 +153,37 @@ contract DisputeKitShutter is DisputeKitClassicBase {
         uint256 _choice,
         uint256 _salt,
         string memory _justification
-    ) public pure override returns (bytes32) {
-        bytes32 justificationHash = keccak256(bytes(_justification));
-        return keccak256(abi.encode(_choice, _salt, justificationHash));
+    ) public view override returns (bytes32) {
+        if (callerIsJuror) {
+            // Caller is the juror, hash without `_justification` to facilitate recovery.
+            return keccak256(abi.encodePacked(_choice, _salt));
+        } else {
+            // Caller is not the juror, hash with `_justification`.
+            bytes32 justificationHash = keccak256(bytes(_justification));
+            return keccak256(abi.encode(_choice, _salt, justificationHash));
+        }
+    }
+
+    /// @dev Returns the expected vote hash for a given vote.
+    /// @param _localDisputeID The ID of the dispute in the Dispute Kit.
+    /// @param _localRoundID The ID of the round in the Dispute Kit.
+    /// @param _voteID The ID of the vote.
+    /// @return The expected vote hash.
+    function getExpectedVoteHash(
+        uint256 _localDisputeID,
+        uint256 _localRoundID,
+        uint256 _voteID
+    ) internal view override returns (bytes32) {
+        if (callerIsJuror) {
+            return recoveryCommitments[_localDisputeID][_localRoundID][_voteID];
+        } else {
+            return disputes[_localDisputeID].rounds[_localRoundID].votes[_voteID].commit;
+        }
     }
+
+    // ************************************* //
+    // *              Errors               * //
+    // ************************************* //
+
+    error EmptyRecoveryCommit();
 }

From bd589e7b8c75e86ebd450c4995c29b2c322cec4d Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 21 Aug 2025 19:35:02 +0100
Subject: [PATCH 084/175] chore: removing foundry compilation restrictions, not
 working as expected, causing stack too deep

---
 contracts/foundry.toml | 8 +-------
 1 file changed, 1 insertion(+), 7 deletions(-)

diff --git a/contracts/foundry.toml b/contracts/foundry.toml
index 236208534..2dcdd2711 100644
--- a/contracts/foundry.toml
+++ b/contracts/foundry.toml
@@ -5,13 +5,7 @@ evm_version = "cancun"
 via_ir = true
 optimizer = true
 optimizer_runs = 10000
-optimizer_details = { yulDetails = { stackAllocation = true } }
-additional_compiler_profiles = [
-    { name = "tests", via_ir = false }
-]
-compilation_restrictions = [
-    { paths = "test/foundry/KlerosCore.t.sol", via_ir = false },
-]
+
 src = 'src'
 out = 'out'
 libs = ['../node_modules', 'lib']

From 6f925141f37d66a03eadff093c1147353f0466f1 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 4 Sep 2025 00:02:03 +0100
Subject: [PATCH 085/175] refactor: add underscore prefix to internal function
 getExpectedVoteHash()

---
 .../src/arbitration/dispute-kits/DisputeKitClassicBase.sol  | 4 ++--
 .../src/arbitration/dispute-kits/DisputeKitShutter.sol      | 6 +++++-
 2 files changed, 7 insertions(+), 3 deletions(-)

diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index d04ccf981..369789ab1 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -332,7 +332,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
             //  Save the votes.
             for (uint256 i = 0; i < _voteIDs.length; i++) {
                 if (round.votes[_voteIDs[i]].account != _juror) revert JurorHasToOwnTheVote();
-                if (hiddenVotes && getExpectedVoteHash(localDisputeID, localRoundID, _voteIDs[i]) != actualVoteHash)
+                if (hiddenVotes && _getExpectedVoteHash(localDisputeID, localRoundID, _voteIDs[i]) != actualVoteHash)
                     revert HashDoesNotMatchHiddenVoteCommitment();
                 if (round.votes[_voteIDs[i]].voted) revert VoteAlreadyCast();
                 round.votes[_voteIDs[i]].choice = _choice;
@@ -744,7 +744,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     /// @param _localRoundID The ID of the round in the Dispute Kit.
     /// @param _voteID The ID of the vote.
     /// @return The expected vote hash.
-    function getExpectedVoteHash(
+    function _getExpectedVoteHash(
         uint256 _localDisputeID,
         uint256 _localRoundID,
         uint256 _voteID
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol b/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
index 2b1a6d063..b8bef461f 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
@@ -164,12 +164,16 @@ contract DisputeKitShutter is DisputeKitClassicBase {
         }
     }
 
+    // ************************************* //
+    // *            Internal               * //
+    // ************************************* //
+
     /// @dev Returns the expected vote hash for a given vote.
     /// @param _localDisputeID The ID of the dispute in the Dispute Kit.
     /// @param _localRoundID The ID of the round in the Dispute Kit.
     /// @param _voteID The ID of the vote.
     /// @return The expected vote hash.
-    function getExpectedVoteHash(
+    function _getExpectedVoteHash(
         uint256 _localDisputeID,
         uint256 _localRoundID,
         uint256 _voteID

From 2cfeec4032ecdfe8e51ce45aed5fe4705491b40b Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 4 Sep 2025 00:02:22 +0100
Subject: [PATCH 086/175] chore: changelog

---
 contracts/CHANGELOG.md | 13 ++++++++-----
 1 file changed, 8 insertions(+), 5 deletions(-)

diff --git a/contracts/CHANGELOG.md b/contracts/CHANGELOG.md
index e6db23764..2e61786fb 100644
--- a/contracts/CHANGELOG.md
+++ b/contracts/CHANGELOG.md
@@ -15,28 +15,31 @@ The format is based on [Common Changelog](https://common-changelog.org/).
 - **Breaking:** Rename `governor` to `owner` in order to comply with the lightweight ownership standard [ERC-5313](https://eipsinsight.com/ercs/erc-5313) ([#2112](https://github.com/kleros/kleros-v2/issues/2112))
 - **Breaking:** Apply the penalties to the stakes in the Sortition Tree ([#2107](https://github.com/kleros/kleros-v2/issues/2107))
 - **Breaking:** Make `SortitionModule.getJurorBalance().stakedInCourt` include the penalties ([#2107](https://github.com/kleros/kleros-v2/issues/2107))
-- **Breaking:** Add a new field `drawnJurorFromCourtIDs` to the `Round` struct in `KlerosCoreBase` and `KlerosCoreUniversity` ([#2107](https://github.com/kleros/kleros-v2/issues/2107))
-- **Breaking:** Add a new state variable `jumpDisputeKitID` to the `DisputeKitClassicBase` contract ([#2114](https://github.com/kleros/kleros-v2/issues/2114))
 - Make `IDisputeKit.draw()` and `ISortitionModule.draw()` return the court ID from which the juror was drawn ([#2107](https://github.com/kleros/kleros-v2/issues/2107))
 - Rename `SortitionModule.setJurorInactive()` to `SortitionModule.forcedUnstakeAllCourts()` ([#2107](https://github.com/kleros/kleros-v2/issues/2107))
-- Allow stake changes to by-pass delayed stakes when initiated by the SortitionModule by setting the `_noDelay` parameter to `true` in `SortitionModule.validateStake()` ([#2107](https://github.com/kleros/kleros-v2/issues/2107))
 - Make the primary VRF-based RNG fall back to `BlockhashRNG` if the VRF request is not fulfilled within a timeout ([#2054](https://github.com/kleros/kleros-v2/issues/2054))
 - Authenticate the calls to the RNGs to prevent 3rd parties from depleting the Chainlink VRF subscription funds ([#2054](https://github.com/kleros/kleros-v2/issues/2054))
 - Use `block.timestamp` rather than `block.number` for `BlockhashRNG` for better reliability on Arbitrum as block production is sporadic depending on network conditions. ([#2054](https://github.com/kleros/kleros-v2/issues/2054))
 - Replace the `bytes32 _key` parameter in `SortitionTrees.createTree()` and `SortitionTrees.draw()` by `uint96 courtID` ([#2113](https://github.com/kleros/kleros-v2/issues/2113))
 - Extract the sortition sum trees logic into a library `SortitionTrees` ([#2113](https://github.com/kleros/kleros-v2/issues/2113))
+- Make `IDisputeKit.getDegreeOfCoherenceReward()` multi-dimensional so different calculations may be applied to PNK rewards, fee rewards and PNK penalties (future-proofing) ([#2090](https://github.com/kleros/kleros-v2/issues/2090))
+- Consolidate the constant `ALPHA_DIVISOR` with `ONE_BASIS_POINTS` ([#2090](https://github.com/kleros/kleros-v2/issues/2090))
 - Set the Hardhat Solidity version to v0.8.30 and enable the IR pipeline ([#2069](https://github.com/kleros/kleros-v2/issues/2069))
 - Set the Foundry Solidity version to v0.8.30 and enable the IR pipeline ([#2073](https://github.com/kleros/kleros-v2/issues/2073))
 - Widen the allowed solc version to any v0.8.x for the interfaces only ([#2083](https://github.com/kleros/kleros-v2/issues/2083))
-- Make `IDisputeKit.getDegreeOfCoherenceReward()` multi-dimensional so different calculations may be applied to PNK rewards, fee rewards and PNK penalties (future-proofing) ([#2090](https://github.com/kleros/kleros-v2/issues/2090))
-- Consolidate the constant `ALPHA_DIVISOR` with `ONE_BASIS_POINTS` ([#2090](https://github.com/kleros/kleros-v2/issues/2090))
 - Bump `hardhat` to v2.26.2 ([#2069](https://github.com/kleros/kleros-v2/issues/2069))
 - Bump `@kleros/vea-contracts` to v0.7.0 ([#2073](https://github.com/kleros/kleros-v2/issues/2073))
 
 ### Added
 
+- **Breaking:** Add a new field `drawnJurorFromCourtIDs` to the `Round` struct in `KlerosCoreBase` and `KlerosCoreUniversity` ([#2107](https://github.com/kleros/kleros-v2/issues/2107))
+- **Breaking:** Add a new state variable `jumpDisputeKitID` to the `DisputeKitClassicBase` contract ([#2114](https://github.com/kleros/kleros-v2/issues/2114))
+- **Breaking:** Add a parameter `_recoveryCommit` to the event `DisputeKitShutter.CommitCastShutter` ([#2100](https://github.com/kleros/kleros-v2/issues/2100))
+- **Breaking:** Add a storage variable `recoveryCommitments` to `DisputeKitShutter` ([#2100](https://github.com/kleros/kleros-v2/issues/2100))
+- Allow the Shutter commitment to be recovered by the juror using only the salt and the choice, without having to provide the justification ([#2100](https://github.com/kleros/kleros-v2/issues/2100))
 - Allow the dispute kits to force an early court jump and to override the number of votes after an appeal (future-proofing) ([#2110](https://github.com/kleros/kleros-v2/issues/2110))
 - Allow the dispute kits to specify which new dispute kit to use when a court jump occurs ([#2114](https://github.com/kleros/kleros-v2/issues/2114))
+- Allow stake changes to by-pass delayed stakes when initiated by the SortitionModule by setting the `_noDelay` parameter to `true` in `SortitionModule.validateStake()` ([#2107](https://github.com/kleros/kleros-v2/issues/2107))
 
 ### Fixed
 

From 4aa2cd245cc0c5564cb2631ae0b5ce8bcde55ea1 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 4 Sep 2025 00:08:04 +0100
Subject: [PATCH 087/175] feat: applied the changes to the GatedShutter DK

---
 .../dispute-kits/DisputeKitGatedShutter.sol   | 70 +++++++++++++++++--
 1 file changed, 65 insertions(+), 5 deletions(-)

diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
index 158bfc5a6..67d9ddbea 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
@@ -30,6 +30,19 @@ interface IBalanceHolderERC1155 {
 contract DisputeKitGatedShutter is DisputeKitClassicBase {
     string public constant override version = "0.13.0";
 
+    // ************************************* //
+    // *             Storage               * //
+    // ************************************* //
+
+    mapping(uint256 localDisputeID => mapping(uint256 localRoundID => mapping(uint256 voteID => bytes32 recoveryCommitment)))
+        public recoveryCommitments;
+
+    // ************************************* //
+    // *        Transient Storage          * //
+    // ************************************* //
+
+    bool transient callerIsJuror;
+
     // ************************************* //
     // *              Events               * //
     // ************************************* //
@@ -38,12 +51,14 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
     /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.
     /// @param _juror The address of the juror casting the vote commitment.
     /// @param _commit The commitment hash.
+    /// @param _recoveryCommit The commitment hash without the justification.
     /// @param _identity The Shutter identity used for encryption.
     /// @param _encryptedVote The Shutter encrypted vote.
     event CommitCastShutter(
         uint256 indexed _coreDisputeID,
         address indexed _juror,
         bytes32 indexed _commit,
+        bytes32 _recoveryCommit,
         bytes32 _identity,
         bytes _encryptedVote
     );
@@ -96,17 +111,29 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
     /// @param _coreDisputeID The ID of the dispute in Kleros Core.
     /// @param _voteIDs The IDs of the votes.
     /// @param _commit The commitment hash including the justification.
+    /// @param _recoveryCommit The commitment hash without the justification.
     /// @param _identity The Shutter identity used for encryption.
     /// @param _encryptedVote The Shutter encrypted vote.
     function castCommitShutter(
         uint256 _coreDisputeID,
         uint256[] calldata _voteIDs,
         bytes32 _commit,
+        bytes32 _recoveryCommit,
         bytes32 _identity,
         bytes calldata _encryptedVote
     ) external notJumped(_coreDisputeID) {
+        if (_recoveryCommit == bytes32(0)) revert EmptyRecoveryCommit();
+
+        uint256 localDisputeID = coreDisputeIDToLocal[_coreDisputeID];
+        Dispute storage dispute = disputes[localDisputeID];
+        uint256 localRoundID = dispute.rounds.length - 1;
+        for (uint256 i = 0; i < _voteIDs.length; i++) {
+            recoveryCommitments[localDisputeID][localRoundID][_voteIDs[i]] = _recoveryCommit;
+        }
+
+        // `_castCommit()` ensures that the caller owns the vote
         _castCommit(_coreDisputeID, _voteIDs, _commit);
-        emit CommitCastShutter(_coreDisputeID, msg.sender, _commit, _identity, _encryptedVote);
+        emit CommitCastShutter(_coreDisputeID, msg.sender, _commit, _recoveryCommit, _identity, _encryptedVote);
     }
 
     function castVoteShutter(
@@ -119,8 +146,12 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
         Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];
         address juror = dispute.rounds[dispute.rounds.length - 1].votes[_voteIDs[0]].account;
 
-        // _castVote() ensures that all the _voteIDs do belong to `juror`
+        callerIsJuror = juror == msg.sender;
+
+        // `_castVote()` ensures that all the `_voteIDs` do belong to `juror`
         _castVote(_coreDisputeID, _voteIDs, _choice, _salt, _justification, juror);
+
+        callerIsJuror = false;
     }
 
     // ************************************* //
@@ -138,15 +169,38 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
         uint256 _choice,
         uint256 _salt,
         string memory _justification
-    ) public pure override returns (bytes32) {
-        bytes32 justificationHash = keccak256(bytes(_justification));
-        return keccak256(abi.encode(_choice, _salt, justificationHash));
+    ) public view override returns (bytes32) {
+        if (callerIsJuror) {
+            // Caller is the juror, hash without `_justification` to facilitate recovery.
+            return keccak256(abi.encodePacked(_choice, _salt));
+        } else {
+            // Caller is not the juror, hash with `_justification`.
+            bytes32 justificationHash = keccak256(bytes(_justification));
+            return keccak256(abi.encode(_choice, _salt, justificationHash));
+        }
     }
 
     // ************************************* //
     // *            Internal               * //
     // ************************************* //
 
+    /// @dev Returns the expected vote hash for a given vote.
+    /// @param _localDisputeID The ID of the dispute in the Dispute Kit.
+    /// @param _localRoundID The ID of the round in the Dispute Kit.
+    /// @param _voteID The ID of the vote.
+    /// @return The expected vote hash.
+    function _getExpectedVoteHash(
+        uint256 _localDisputeID,
+        uint256 _localRoundID,
+        uint256 _voteID
+    ) internal view override returns (bytes32) {
+        if (callerIsJuror) {
+            return recoveryCommitments[_localDisputeID][_localRoundID][_voteID];
+        } else {
+            return disputes[_localDisputeID].rounds[_localRoundID].votes[_voteID].commit;
+        }
+    }
+
     /// @dev Extracts token gating information from the extra data.
     /// @param _extraData The extra data bytes array with the following encoding:
     ///        - bytes 0-31: uint96 courtID, not used here
@@ -197,4 +251,10 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
             return IBalanceHolder(tokenGate).balanceOf(_juror) > 0;
         }
     }
+
+    // ************************************* //
+    // *              Errors               * //
+    // ************************************* //
+
+    error EmptyRecoveryCommit();
 }

From b490c9628b51e63807b03b1fa53381761f00f6fb Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 4 Sep 2025 01:41:02 +0100
Subject: [PATCH 088/175] test: coverage for the shutter dispute kit including
 recovery flow

---
 .../test/arbitration/dispute-kit-shutter.ts   | 733 ++++++++++++++++++
 1 file changed, 733 insertions(+)
 create mode 100644 contracts/test/arbitration/dispute-kit-shutter.ts

diff --git a/contracts/test/arbitration/dispute-kit-shutter.ts b/contracts/test/arbitration/dispute-kit-shutter.ts
new file mode 100644
index 000000000..aab7efa58
--- /dev/null
+++ b/contracts/test/arbitration/dispute-kit-shutter.ts
@@ -0,0 +1,733 @@
+import { deployments, ethers, getNamedAccounts, network } from "hardhat";
+import { toBigInt, BigNumberish } from "ethers";
+import { PNK, KlerosCore, SortitionModule, IncrementalNG, DisputeKitShutter } from "../../typechain-types";
+import { expect } from "chai";
+import { Courts } from "../../deploy/utils";
+import { HardhatEthersSigner } from "@nomicfoundation/hardhat-ethers/signers";
+
+/* eslint-disable no-unused-vars */
+/* eslint-disable no-unused-expressions */ // https://github.com/standard/standard/issues/690#issuecomment-278533482
+
+describe("DisputeKitShutter", async () => {
+  const ONE_THOUSAND_PNK = 10n ** 21n;
+  const thousandPNK = (amount: BigNumberish) => toBigInt(amount) * ONE_THOUSAND_PNK;
+
+  let deployer: string;
+  let juror1: HardhatEthersSigner;
+  let juror2: HardhatEthersSigner;
+  let bot: HardhatEthersSigner;
+  let attacker: HardhatEthersSigner;
+  let disputeKitShutter: DisputeKitShutter;
+  let pnk: PNK;
+  let core: KlerosCore;
+  let sortitionModule: SortitionModule;
+  let rng: IncrementalNG;
+  const RANDOM = 424242n;
+  const SHUTTER_DK_ID = 2;
+  const SHUTTER_COURT_ID = 2; // Court with hidden votes for testing
+
+  // Test data
+  const choice = 1n;
+  const salt = 12345n;
+  const justification = "This is my justification for the vote";
+  const identity = ethers.keccak256(ethers.toUtf8Bytes("shutter-identity"));
+  const encryptedVote = ethers.toUtf8Bytes("encrypted-vote-data");
+
+  beforeEach("Setup", async () => {
+    ({ deployer } = await getNamedAccounts());
+    [, juror1, juror2, bot, attacker] = await ethers.getSigners();
+
+    await deployments.fixture(["Arbitration", "VeaMock"], {
+      fallbackToGlobal: true,
+      keepExistingDeployments: false,
+    });
+    disputeKitShutter = await ethers.getContract<DisputeKitShutter>("DisputeKitShutter");
+    pnk = await ethers.getContract<PNK>("PNK");
+    core = await ethers.getContract<KlerosCore>("KlerosCore");
+    sortitionModule = await ethers.getContract<SortitionModule>("SortitionModule");
+
+    // Make the tests more deterministic with this dummy RNG
+    await deployments.deploy("IncrementalNG", {
+      from: deployer,
+      args: [RANDOM],
+      log: true,
+    });
+    rng = await ethers.getContract<IncrementalNG>("IncrementalNG");
+
+    await sortitionModule.changeRandomNumberGenerator(rng.target).then((tx) => tx.wait());
+
+    // Create a court with hidden votes enabled for testing DisputeKitShutter
+    // Parameters: parent, hiddenVotes, minStake, alpha, feeForJuror, jurorsForCourtJump, timesPerPeriod, sortitionExtraData, supportedDisputeKits
+    await core.createCourt(
+      Courts.GENERAL, // parent
+      true, // hiddenVotes - MUST be true for DisputeKitShutter
+      ethers.parseEther("200"), // minStake
+      10000, // alpha
+      ethers.parseEther("0.1"), // feeForJuror
+      16, // jurorsForCourtJump
+      [300, 300, 300, 300], // timesPerPeriod for evidence, commit, vote, appeal
+      ethers.toBeHex(5), // sortitionExtraData
+      [1, SHUTTER_DK_ID] // supportedDisputeKits - must include Classic (1) and Shutter (2)
+    );
+
+    // The new court ID should be 2 (after GENERAL court which is 1)
+  });
+
+  // ************************************* //
+  // *              Constants            * //
+  // ************************************* //
+
+  const enum Period {
+    evidence = 0,
+    commit = 1,
+    vote = 2,
+    appeal = 3,
+    execution = 4,
+  }
+
+  // ************************************* //
+  // *          Helper Functions         * //
+  // ************************************* //
+
+  const encodeExtraData = (courtId: BigNumberish, minJurors: BigNumberish, disputeKitId: number) =>
+    ethers.AbiCoder.defaultAbiCoder().encode(["uint256", "uint256", "uint256"], [courtId, minJurors, disputeKitId]);
+
+  const generateCommitments = (choice: bigint, salt: bigint, justification: string) => {
+    // Recovery commitment: hash(choice, salt) - no justification
+    const recoveryCommit = ethers.keccak256(
+      ethers.AbiCoder.defaultAbiCoder().encode(["uint256", "uint256"], [choice, salt])
+    );
+
+    // Full commitment: hash(choice, salt, justificationHash)
+    const justificationHash = ethers.keccak256(ethers.toUtf8Bytes(justification));
+    const fullCommit = ethers.keccak256(
+      ethers.AbiCoder.defaultAbiCoder().encode(["uint256", "uint256", "bytes32"], [choice, salt, justificationHash])
+    );
+
+    return { fullCommit, recoveryCommit };
+  };
+
+  const createDisputeAndDraw = async (courtId: BigNumberish, minJurors: BigNumberish, disputeKitId: number) => {
+    // Stake jurors
+    for (const juror of [juror1, juror2]) {
+      await pnk.transfer(juror.address, thousandPNK(10)).then((tx) => tx.wait());
+      expect(await pnk.balanceOf(juror.address)).to.equal(thousandPNK(10));
+
+      await pnk
+        .connect(juror)
+        .approve(core.target, thousandPNK(10), { gasLimit: 300000 })
+        .then((tx) => tx.wait());
+
+      await core
+        .connect(juror)
+        .setStake(SHUTTER_COURT_ID, thousandPNK(10), { gasLimit: 500000 })
+        .then((tx) => tx.wait());
+
+      expect(await sortitionModule.getJurorBalance(juror.address, SHUTTER_COURT_ID)).to.deep.equal([
+        thousandPNK(10), // totalStaked
+        0, // totalLocked
+        thousandPNK(10), // stakedInCourt
+        1, // nbOfCourts
+      ]);
+    }
+
+    const extraData = encodeExtraData(courtId, minJurors, disputeKitId);
+    const arbitrationCost = await core["arbitrationCost(bytes)"](extraData);
+
+    // Create dispute via core contract
+    await core["createDispute(uint256,bytes)"](2, extraData, { value: arbitrationCost }).then((tx) => tx.wait());
+    const disputeId = 0;
+
+    await network.provider.send("evm_increaseTime", [2000]); // Wait for minStakingTime
+    await network.provider.send("evm_mine");
+    await sortitionModule.passPhase().then((tx) => tx.wait()); // Staking -> Generating
+
+    await sortitionModule.passPhase().then((tx) => tx.wait()); // Generating -> Drawing
+    await core.draw(disputeId, 70, { gasLimit: 10000000 });
+
+    return disputeId;
+  };
+
+  const advanceToCommitPeriod = async (disputeId: number) => {
+    // Advance from evidence to commit period
+    await core.passPeriod(disputeId).then((tx) => tx.wait());
+
+    // Verify we're in commit period
+    const dispute = await core.disputes(disputeId);
+    expect(dispute[2]).to.equal(Period.commit); // period is at index 2
+  };
+
+  const advanceToVotePeriod = async (disputeId: number) => {
+    // Advance from commit to vote period
+    const dispute = await core.disputes(disputeId);
+    const courtId = dispute[0]; // courtID is at index 0
+    const court = await core.courts(courtId);
+    // Court struct: parent, hiddenVotes, children[], minStake, alpha, feeForJuror, jurorsForCourtJump, disabled, timesPerPeriod[]
+    // timesPerPeriod is a mapping, we need to check the actual structure
+    const timesPerPeriod = [300, 300, 300, 300]; // Default times from deployment
+    const commitPeriod = timesPerPeriod[Period.commit];
+
+    await network.provider.send("evm_increaseTime", [Number(commitPeriod)]);
+    await network.provider.send("evm_mine");
+
+    await core.passPeriod(disputeId).then((tx) => tx.wait());
+
+    // Verify we're in vote period
+    const updatedDispute = await core.disputes(disputeId);
+    expect(updatedDispute[2]).to.equal(Period.vote); // period is at index 2
+  };
+
+  const getVoteIDsForJuror = async (disputeId: number, juror: HardhatEthersSigner) => {
+    const localDisputeId = await disputeKitShutter.coreDisputeIDToLocal(disputeId);
+    const nbRounds = await disputeKitShutter.getNumberOfRounds(localDisputeId);
+    const roundIndex = Number(nbRounds) - 1;
+
+    // Get all votes for this round and filter by juror
+    const voteIDs: bigint[] = [];
+    const maxVotes = 10; // Reasonable limit for testing
+
+    for (let i = 0; i < maxVotes; i++) {
+      try {
+        const voteInfo = await disputeKitShutter.getVoteInfo(disputeId, roundIndex, i);
+        if (voteInfo[0] === juror.address) {
+          // account is at index 0
+          voteIDs.push(BigInt(i));
+        }
+      } catch {
+        // No more votes
+        break;
+      }
+    }
+
+    return voteIDs;
+  };
+
+  // ************************************* //
+  // *              Tests                * //
+  // ************************************* //
+
+  describe("Commit Phase - castCommitShutter()", () => {
+    describe("Successful commits", () => {
+      it("Should allow juror to commit vote with recovery commitment", async () => {
+        // Use the court with hidden votes (court ID 2)
+        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
+        await advanceToCommitPeriod(disputeId);
+
+        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
+        expect(voteIDs.length).to.be.greaterThan(0);
+
+        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+
+        await expect(
+          disputeKitShutter
+            .connect(juror1)
+            .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote)
+        )
+          .to.emit(disputeKitShutter, "CommitCastShutter")
+          .withArgs(disputeId, juror1.address, fullCommit, recoveryCommit, identity, encryptedVote);
+
+        // Verify recovery commitment was stored
+        const localDisputeId = await disputeKitShutter.coreDisputeIDToLocal(disputeId);
+        const storedRecoveryCommit = await disputeKitShutter.recoveryCommitments(localDisputeId, 0, voteIDs[0]);
+        expect(storedRecoveryCommit).to.equal(recoveryCommit);
+      });
+
+      it("Should allow juror to update commitment multiple times", async () => {
+        // Use the court with hidden votes (court ID 2)
+        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
+        await advanceToCommitPeriod(disputeId);
+
+        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
+
+        // First commitment
+        const { fullCommit: commit1, recoveryCommit: recovery1 } = generateCommitments(1n, 111n, "First justification");
+        await disputeKitShutter
+          .connect(juror1)
+          .castCommitShutter(disputeId, voteIDs, commit1, recovery1, identity, encryptedVote);
+
+        // Second commitment (overwrites first)
+        const { fullCommit: commit2, recoveryCommit: recovery2 } = generateCommitments(
+          2n,
+          222n,
+          "Second justification"
+        );
+        await disputeKitShutter
+          .connect(juror1)
+          .castCommitShutter(disputeId, voteIDs, commit2, recovery2, identity, encryptedVote);
+
+        // Verify only the second commitment is stored
+        const localDisputeId = await disputeKitShutter.coreDisputeIDToLocal(disputeId);
+        const storedRecoveryCommit = await disputeKitShutter.recoveryCommitments(localDisputeId, 0, voteIDs[0]);
+        expect(storedRecoveryCommit).to.equal(recovery2);
+      });
+    });
+
+    describe("Failed commits", () => {
+      it("Should revert if recovery commitment is empty", async () => {
+        // Use the court with hidden votes (court ID 2)
+        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
+        await advanceToCommitPeriod(disputeId);
+
+        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
+        const { fullCommit } = generateCommitments(choice, salt, justification);
+
+        await expect(
+          disputeKitShutter.connect(juror1).castCommitShutter(
+            disputeId,
+            voteIDs,
+            fullCommit,
+            ethers.ZeroHash, // Empty recovery commit
+            identity,
+            encryptedVote
+          )
+        ).to.be.revertedWithCustomError(disputeKitShutter, "EmptyRecoveryCommit");
+      });
+
+      it("Should revert if not in commit period", async () => {
+        // Use the court with hidden votes (court ID 2)
+        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
+        // Still in evidence period
+
+        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
+        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+
+        await expect(
+          disputeKitShutter
+            .connect(juror1)
+            .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote)
+        ).to.be.revertedWithCustomError(disputeKitShutter, "NotCommitPeriod");
+      });
+
+      it("Should revert if juror doesn't own the vote", async () => {
+        // Use the court with hidden votes (court ID 2)
+        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
+        await advanceToCommitPeriod(disputeId);
+
+        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
+        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+
+        await expect(
+          disputeKitShutter.connect(juror2).castCommitShutter(
+            disputeId,
+            voteIDs, // Using juror1's vote IDs
+            fullCommit,
+            recoveryCommit,
+            identity,
+            encryptedVote
+          )
+        ).to.be.revertedWithCustomError(disputeKitShutter, "JurorHasToOwnTheVote");
+      });
+    });
+  });
+
+  describe("Normal Flow - Bot Reveals", () => {
+    describe("Successful reveals", () => {
+      it("Should allow bot to reveal vote with full justification", async () => {
+        // Use the court with hidden votes (court ID 2)
+        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
+        await advanceToCommitPeriod(disputeId);
+
+        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
+        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+
+        // Juror commits
+        await disputeKitShutter
+          .connect(juror1)
+          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
+
+        await advanceToVotePeriod(disputeId);
+
+        // Bot reveals vote
+        await expect(disputeKitShutter.connect(bot).castVoteShutter(disputeId, voteIDs, choice, salt, justification))
+          .to.emit(disputeKitShutter, "VoteCast")
+          .withArgs(disputeId, juror1.address, voteIDs, choice, justification);
+
+        // Verify vote was counted
+        const voteInfo = await disputeKitShutter.getVoteInfo(disputeId, 0, Number(voteIDs[0]));
+        expect(voteInfo[3]).to.be.true; // voted is at index 3
+        expect(voteInfo[2]).to.equal(choice); // choice is at index 2
+      });
+    });
+
+    describe("Failed reveals", () => {
+      it("Should revert if wrong choice provided", async () => {
+        // Use the court with hidden votes (court ID 2)
+        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
+        await advanceToCommitPeriod(disputeId);
+
+        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
+        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+
+        await disputeKitShutter
+          .connect(juror1)
+          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
+
+        await advanceToVotePeriod(disputeId);
+
+        const wrongChoice = 2n;
+        await expect(
+          disputeKitShutter.connect(bot).castVoteShutter(
+            disputeId,
+            voteIDs,
+            wrongChoice, // Wrong choice
+            salt,
+            justification
+          )
+        ).to.be.revertedWithCustomError(disputeKitShutter, "HashDoesNotMatchHiddenVoteCommitment");
+      });
+
+      it("Should revert if wrong salt provided", async () => {
+        // Use the court with hidden votes (court ID 2)
+        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
+        await advanceToCommitPeriod(disputeId);
+
+        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
+        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+
+        await disputeKitShutter
+          .connect(juror1)
+          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
+
+        await advanceToVotePeriod(disputeId);
+
+        const wrongSalt = 99999n;
+        await expect(
+          disputeKitShutter.connect(bot).castVoteShutter(
+            disputeId,
+            voteIDs,
+            choice,
+            wrongSalt, // Wrong salt
+            justification
+          )
+        ).to.be.revertedWithCustomError(disputeKitShutter, "HashDoesNotMatchHiddenVoteCommitment");
+      });
+
+      it("Should revert if wrong justification provided", async () => {
+        // Use the court with hidden votes (court ID 2)
+        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
+        await advanceToCommitPeriod(disputeId);
+
+        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
+        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+
+        await disputeKitShutter
+          .connect(juror1)
+          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
+
+        await advanceToVotePeriod(disputeId);
+
+        const wrongJustification = "Wrong justification";
+        await expect(
+          disputeKitShutter.connect(bot).castVoteShutter(
+            disputeId,
+            voteIDs,
+            choice,
+            salt,
+            wrongJustification // Wrong justification
+          )
+        ).to.be.revertedWithCustomError(disputeKitShutter, "HashDoesNotMatchHiddenVoteCommitment");
+      });
+
+      it("Should revert if vote already cast", async () => {
+        // Use the court with hidden votes (court ID 2)
+        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
+        await advanceToCommitPeriod(disputeId);
+
+        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
+        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+
+        await disputeKitShutter
+          .connect(juror1)
+          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
+
+        await advanceToVotePeriod(disputeId);
+
+        // First vote succeeds
+        await disputeKitShutter.connect(bot).castVoteShutter(disputeId, voteIDs, choice, salt, justification);
+
+        // Second vote fails
+        await expect(
+          disputeKitShutter.connect(bot).castVoteShutter(disputeId, voteIDs, choice, salt, justification)
+        ).to.be.revertedWithCustomError(disputeKitShutter, "VoteAlreadyCast");
+      });
+    });
+  });
+
+  describe("Recovery Flow - Juror Reveals", () => {
+    describe("Successful recovery reveals", () => {
+      it("Should allow juror to recover vote without justification", async () => {
+        // Use the court with hidden votes (court ID 2)
+        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
+        await advanceToCommitPeriod(disputeId);
+
+        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
+        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+
+        // Juror commits
+        await disputeKitShutter
+          .connect(juror1)
+          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
+
+        await advanceToVotePeriod(disputeId);
+
+        // Juror reveals vote (Shutter failed, so juror must reveal)
+        // Note: justification can be anything as it won't be validated
+        await expect(
+          disputeKitShutter.connect(juror1).castVoteShutter(
+            disputeId,
+            voteIDs,
+            choice,
+            salt,
+            "" // Empty justification is fine for recovery
+          )
+        )
+          .to.emit(disputeKitShutter, "VoteCast")
+          .withArgs(disputeId, juror1.address, voteIDs, choice, "");
+
+        // Verify vote was counted
+        const voteInfo = await disputeKitShutter.getVoteInfo(disputeId, 0, Number(voteIDs[0]));
+        expect(voteInfo[3]).to.be.true; // voted is at index 3
+        expect(voteInfo[2]).to.equal(choice); // choice is at index 2
+      });
+
+      it("Should validate against recovery commitment when juror reveals", async () => {
+        // Use the court with hidden votes (court ID 2)
+        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
+        await advanceToCommitPeriod(disputeId);
+
+        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
+        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+
+        await disputeKitShutter
+          .connect(juror1)
+          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
+
+        await advanceToVotePeriod(disputeId);
+
+        // Juror can provide any justification - it won't be validated
+        const differentJustification = "This is a different justification that won't be checked";
+        await expect(
+          disputeKitShutter.connect(juror1).castVoteShutter(
+            disputeId,
+            voteIDs,
+            choice,
+            salt,
+            differentJustification // Different justification is OK for recovery
+          )
+        ).to.not.be.reverted;
+      });
+    });
+
+    describe("Failed recovery reveals", () => {
+      it("Should revert if wrong choice in recovery", async () => {
+        // Use the court with hidden votes (court ID 2)
+        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
+        await advanceToCommitPeriod(disputeId);
+
+        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
+        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+
+        await disputeKitShutter
+          .connect(juror1)
+          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
+
+        await advanceToVotePeriod(disputeId);
+
+        const wrongChoice = 2n;
+        await expect(
+          disputeKitShutter.connect(juror1).castVoteShutter(
+            disputeId,
+            voteIDs,
+            wrongChoice, // Wrong choice
+            salt,
+            ""
+          )
+        ).to.be.revertedWithCustomError(disputeKitShutter, "HashDoesNotMatchHiddenVoteCommitment");
+      });
+
+      it("Should revert if wrong salt in recovery", async () => {
+        // Use the court with hidden votes (court ID 2)
+        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
+        await advanceToCommitPeriod(disputeId);
+
+        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
+        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+
+        await disputeKitShutter
+          .connect(juror1)
+          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
+
+        await advanceToVotePeriod(disputeId);
+
+        const wrongSalt = 99999n;
+        await expect(
+          disputeKitShutter.connect(juror1).castVoteShutter(
+            disputeId,
+            voteIDs,
+            choice,
+            wrongSalt, // Wrong salt
+            ""
+          )
+        ).to.be.revertedWithCustomError(disputeKitShutter, "HashDoesNotMatchHiddenVoteCommitment");
+      });
+
+      it("Should revert if non-juror tries to reveal without correct full commitment", async () => {
+        // Use the court with hidden votes (court ID 2)
+        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
+        await advanceToCommitPeriod(disputeId);
+
+        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
+        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+
+        await disputeKitShutter
+          .connect(juror1)
+          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
+
+        await advanceToVotePeriod(disputeId);
+
+        // Attacker tries to reveal with only choice and salt (no justification)
+        await expect(
+          disputeKitShutter.connect(attacker).castVoteShutter(
+            disputeId,
+            voteIDs,
+            choice,
+            salt,
+            "" // No justification - would work for juror but not for others
+          )
+        ).to.be.revertedWithCustomError(disputeKitShutter, "HashDoesNotMatchHiddenVoteCommitment");
+      });
+    });
+  });
+
+  describe("Hash Function Behavior", () => {
+    it("Should return different hashes for juror vs non-juror callers", async () => {
+      const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
+      await advanceToCommitPeriod(disputeId);
+
+      const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
+      const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+
+      await disputeKitShutter
+        .connect(juror1)
+        .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
+
+      await advanceToVotePeriod(disputeId);
+
+      // During castVoteShutter, the contract should use different hash logic
+      // For juror: hash(choice, salt)
+      // For non-juror: hash(choice, salt, justificationHash)
+
+      // This is tested implicitly by the recovery flow tests above
+      // The juror can reveal with any justification, while non-juror must provide exact justification
+    });
+
+    it("Should correctly compute hash for normal flow", async () => {
+      // Test hashVote function directly
+      const justificationHash = ethers.keccak256(ethers.toUtf8Bytes(justification));
+      const expectedHash = ethers.keccak256(
+        ethers.AbiCoder.defaultAbiCoder().encode(["uint256", "uint256", "bytes32"], [choice, salt, justificationHash])
+      );
+
+      // When called by non-juror (normal case), should include justification
+      const computedHash = await disputeKitShutter.hashVote(choice, salt, justification);
+      expect(computedHash).to.equal(expectedHash);
+    });
+  });
+
+  describe("Edge Cases and Security", () => {
+    it("Should handle mixed normal and recovery reveals in same dispute", async () => {
+      const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
+      await advanceToCommitPeriod(disputeId);
+
+      const voteIDsJuror1 = await getVoteIDsForJuror(disputeId, juror1);
+      const voteIDsJuror2 = await getVoteIDsForJuror(disputeId, juror2);
+
+      const { fullCommit: commit1, recoveryCommit: recovery1 } = generateCommitments(1n, 111n, "Juror 1 justification");
+      const { fullCommit: commit2, recoveryCommit: recovery2 } = generateCommitments(2n, 222n, "Juror 2 justification");
+
+      // Both jurors commit
+      await disputeKitShutter
+        .connect(juror1)
+        .castCommitShutter(disputeId, voteIDsJuror1, commit1, recovery1, identity, encryptedVote);
+
+      await disputeKitShutter
+        .connect(juror2)
+        .castCommitShutter(disputeId, voteIDsJuror2, commit2, recovery2, identity, encryptedVote);
+
+      await advanceToVotePeriod(disputeId);
+
+      // Juror1 uses recovery flow (Shutter failed for them)
+      await disputeKitShutter.connect(juror1).castVoteShutter(
+        disputeId,
+        voteIDsJuror1,
+        1n,
+        111n,
+        "Different justification" // Recovery doesn't check this
+      );
+
+      // Bot reveals juror2's vote normally
+      await disputeKitShutter.connect(bot).castVoteShutter(
+        disputeId,
+        voteIDsJuror2,
+        2n,
+        222n,
+        "Juror 2 justification" // Must match exactly
+      );
+
+      // Verify both votes were counted
+      const vote1Info = await disputeKitShutter.getVoteInfo(disputeId, 0, Number(voteIDsJuror1[0]));
+      const vote2Info = await disputeKitShutter.getVoteInfo(disputeId, 0, Number(voteIDsJuror2[0]));
+
+      expect(vote1Info[3]).to.be.true; // voted is at index 3
+      expect(vote1Info[2]).to.equal(1n); // choice is at index 2
+      expect(vote2Info[3]).to.be.true;
+      expect(vote2Info[2]).to.equal(2n);
+    });
+
+    it("Should allow anyone to reveal vote with correct data only", async () => {
+      const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
+      await advanceToCommitPeriod(disputeId);
+
+      const voteIDsJuror1 = await getVoteIDsForJuror(disputeId, juror1);
+      const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+
+      await disputeKitShutter
+        .connect(juror1)
+        .castCommitShutter(disputeId, voteIDsJuror1, fullCommit, recoveryCommit, identity, encryptedVote);
+
+      // Juror2 commits with a different choice
+      const differentChoice = 2n;
+      const voteIDsJuror2 = await getVoteIDsForJuror(disputeId, juror2);
+      const { fullCommit: commit2, recoveryCommit: recovery2 } = generateCommitments(
+        differentChoice,
+        salt,
+        justification
+      );
+
+      await disputeKitShutter
+        .connect(juror2)
+        .castCommitShutter(disputeId, voteIDsJuror2, commit2, recovery2, identity, encryptedVote);
+
+      await advanceToVotePeriod(disputeId);
+
+      // In normal Shutter operation, anyone (bot/attacker) can reveal the vote if they have the correct data
+      // This is by design - the security comes from the fact that only Shutter knows the decryption key
+      await expect(
+        disputeKitShutter.connect(attacker).castVoteShutter(disputeId, voteIDsJuror1, choice, salt, justification)
+      )
+        .to.emit(disputeKitShutter, "VoteCast")
+        .withArgs(disputeId, juror1.address, voteIDsJuror1, choice, justification);
+
+      // Attacker cannot change juror2's vote to a different choice
+      await expect(
+        disputeKitShutter.connect(attacker).castVoteShutter(
+          disputeId,
+          voteIDsJuror2,
+          1n, // Wrong choice
+          salt,
+          justification
+        )
+      ).to.be.revertedWithCustomError(disputeKitShutter, "HashDoesNotMatchHiddenVoteCommitment");
+    });
+  });
+});

From ef3a64c112eb327965bb995890a9e39863959697 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 4 Sep 2025 02:00:05 +0100
Subject: [PATCH 089/175] chore: github contract testing workflow without
 coverage due to via-ir issues

---
 .github/workflows/contracts-testing.yml | 184 +++++++++++++++---------
 1 file changed, 119 insertions(+), 65 deletions(-)

diff --git a/.github/workflows/contracts-testing.yml b/.github/workflows/contracts-testing.yml
index 47646906c..13783db5e 100644
--- a/.github/workflows/contracts-testing.yml
+++ b/.github/workflows/contracts-testing.yml
@@ -15,73 +15,127 @@ on:
   pull_request:
     branches:
       - "*"
-      
-permissions:  # added using https://github.com/step-security/secure-workflows
+
+permissions: # added using https://github.com/step-security/secure-workflows
   contents: read
 
 jobs:
-  contracts-testing:
+  # *********************************************************************************** #
+  # ******************************* Hardhat Tests ************************************* #
+  # *********************************************************************************** #
+  hardhat-tests:
+    runs-on: ubuntu-latest
+    steps:
+      - name: Harden Runner
+        uses: step-security/harden-runner@4d991eb9b905ef189e4c376166672c3f2f230481 # v2.11.0
+        with:
+          disable-sudo: false
+          egress-policy: block
+          allowed-endpoints: >
+            binaries.soliditylang.org:443
+            classic.yarnpkg.com:443
+            github.com:443
+            nightly.yarnpkg.com:443
+            nodejs.org:443
+            objects.githubusercontent.com:443
+            registry.yarnpkg.com:443
+            registry.npmjs.org:443
+            54.185.253.63:443
+
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+        with:
+          submodules: recursive
+
+      - name: Set up corepack (for yarn)
+        run: |
+          corepack enable
+          corepack prepare yarn@4.9.2 --activate
+          yarn set version 4.9.2
+
+      - name: Setup Node.js environment
+        uses: actions/setup-node@1d0ff469b7ec7b3cb9d8673fde0c81c44821de2a # v4.2.0
+        with:
+          node-version: 20.x
+          cache: yarn
+
+      - name: Cache node modules
+        uses: actions/cache@0c907a75c2c80ebcb7f088228285e798b750cf8f # v4.2.1
+        env:
+          cache-name: cache-node-modules
+        with:
+          path: |
+            ~/.npm
+            **/node_modules
+          key: ${{ runner.os }}-build-${{ secrets.CACHE_VERSION }}-${{ env.cache-name }}-${{ hashFiles('**/package-lock.json', '**/yarn.lock') }}
+          restore-keys: |
+            ${{ runner.os }}-build-${{ secrets.CACHE_VERSION }}-${{ env.cache-name }}-
+
+      - name: Install contracts dependencies
+        run: yarn workspace @kleros/kleros-v2-contracts install
+
+      - name: Install Foundry
+        uses: foundry-rs/foundry-toolchain@de808b1eea699e761c404bda44ba8f21aba30b2c # v1.3.1
+
+      - name: Run Hardhat tests
+        run: yarn test
+        working-directory: contracts
+
+  # *********************************************************************************** #
+  # ******************************* Foundry Tests ************************************* #
+  # *********************************************************************************** #
+  foundry-tests:
     runs-on: ubuntu-latest
     steps:
-    - name: Harden Runner
-      uses: step-security/harden-runner@4d991eb9b905ef189e4c376166672c3f2f230481 # v2.11.0
-      with:
-        disable-sudo: false
-        egress-policy: block
-        allowed-endpoints: >
-          binaries.soliditylang.org:443
-          classic.yarnpkg.com:443
-          github.com:443
-          nightly.yarnpkg.com:443
-          nodejs.org:443
-          objects.githubusercontent.com:443
-          registry.yarnpkg.com:443
-          registry.npmjs.org:443
-          54.185.253.63:443
-        
-    - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
-      with:
-        submodules: recursive
-
-    - name: Set up corepack (for yarn)
-      run: |
-        corepack enable
-        corepack prepare yarn@4.9.2 --activate
-        yarn set version 4.9.2
-  
-    - name: Setup Node.js environment
-      uses: actions/setup-node@1d0ff469b7ec7b3cb9d8673fde0c81c44821de2a # v4.2.0
-      with:
-        node-version: 20.x   
-        cache: yarn
-  
-    - name: Cache node modules
-      uses: actions/cache@0c907a75c2c80ebcb7f088228285e798b750cf8f # v4.2.1
-      env:
-        cache-name: cache-node-modules
-      with:
-        path: | 
-          ~/.npm
-          **/node_modules
-        key: ${{ runner.os }}-build-${{ secrets.CACHE_VERSION }}-${{ env.cache-name }}-${{ hashFiles('**/package-lock.json', '**/yarn.lock') }}
-        restore-keys: |
-          ${{ runner.os }}-build-${{ secrets.CACHE_VERSION }}-${{ env.cache-name }}-
-
-    - name: Install contracts dependencies
-      run: yarn workspace @kleros/kleros-v2-contracts install
-
-    - name: Install Foundry
-      uses: foundry-rs/foundry-toolchain@de808b1eea699e761c404bda44ba8f21aba30b2c # v1.3.1
-
-    - name: Install lcov
-      run: sudo apt-get install -y lcov
-
-    - name: Run Hardhat and Foundry tests with coverage
-      run: yarn coverage
-      working-directory: contracts
-                   
-    - name: Upload a build artifact
-      uses: actions/upload-artifact@4cec3d8aa04e39d1a68397de0c4cd6fb9dce8ec1 # v4.6.1
-      with:    
-        name: code-coverage-report    
-        path: contracts/coverage
+      - name: Harden Runner
+        uses: step-security/harden-runner@4d991eb9b905ef189e4c376166672c3f2f230481 # v2.11.0
+        with:
+          disable-sudo: false
+          egress-policy: block
+          allowed-endpoints: >
+            binaries.soliditylang.org:443
+            classic.yarnpkg.com:443
+            github.com:443
+            nightly.yarnpkg.com:443
+            nodejs.org:443
+            objects.githubusercontent.com:443
+            registry.yarnpkg.com:443
+            registry.npmjs.org:443
+            54.185.253.63:443
+
+      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+        with:
+          submodules: recursive
+
+      - name: Set up corepack (for yarn)
+        run: |
+          corepack enable
+          corepack prepare yarn@4.9.2 --activate
+          yarn set version 4.9.2
+
+      - name: Setup Node.js environment
+        uses: actions/setup-node@1d0ff469b7ec7b3cb9d8673fde0c81c44821de2a # v4.2.0
+        with:
+          node-version: 20.x
+          cache: yarn
+
+      - name: Cache node modules
+        uses: actions/cache@0c907a75c2c80ebcb7f088228285e798b750cf8f # v4.2.1
+        env:
+          cache-name: cache-node-modules
+        with:
+          path: |
+            ~/.npm
+            **/node_modules
+          key: ${{ runner.os }}-build-${{ secrets.CACHE_VERSION }}-${{ env.cache-name }}-${{ hashFiles('**/package-lock.json', '**/yarn.lock') }}
+          restore-keys: |
+            ${{ runner.os }}-build-${{ secrets.CACHE_VERSION }}-${{ env.cache-name }}-
+
+      - name: Install contracts dependencies
+        run: yarn workspace @kleros/kleros-v2-contracts install
+
+      - name: Install Foundry
+        uses: foundry-rs/foundry-toolchain@82dee4ba654bd2146511f85f0d013af94670c4de # v1.4.0
+
+      - name: Run Foundry tests
+        run: forge test
+        working-directory: contracts

From fb6ca6ab348e6e93a26b070c01245234232252b7 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 4 Sep 2025 02:09:19 +0100
Subject: [PATCH 090/175] chore: testing

---
 .github/workflows/contracts-testing.yml | 120 ++++++++++++------------
 1 file changed, 61 insertions(+), 59 deletions(-)

diff --git a/.github/workflows/contracts-testing.yml b/.github/workflows/contracts-testing.yml
index 13783db5e..26e1fb313 100644
--- a/.github/workflows/contracts-testing.yml
+++ b/.github/workflows/contracts-testing.yml
@@ -73,9 +73,6 @@ jobs:
       - name: Install contracts dependencies
         run: yarn workspace @kleros/kleros-v2-contracts install
 
-      - name: Install Foundry
-        uses: foundry-rs/foundry-toolchain@de808b1eea699e761c404bda44ba8f21aba30b2c # v1.3.1
-
       - name: Run Hardhat tests
         run: yarn test
         working-directory: contracts
@@ -83,59 +80,64 @@ jobs:
   # *********************************************************************************** #
   # ******************************* Foundry Tests ************************************* #
   # *********************************************************************************** #
-  foundry-tests:
-    runs-on: ubuntu-latest
-    steps:
-      - name: Harden Runner
-        uses: step-security/harden-runner@4d991eb9b905ef189e4c376166672c3f2f230481 # v2.11.0
-        with:
-          disable-sudo: false
-          egress-policy: block
-          allowed-endpoints: >
-            binaries.soliditylang.org:443
-            classic.yarnpkg.com:443
-            github.com:443
-            nightly.yarnpkg.com:443
-            nodejs.org:443
-            objects.githubusercontent.com:443
-            registry.yarnpkg.com:443
-            registry.npmjs.org:443
-            54.185.253.63:443
-
-      - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
-        with:
-          submodules: recursive
-
-      - name: Set up corepack (for yarn)
-        run: |
-          corepack enable
-          corepack prepare yarn@4.9.2 --activate
-          yarn set version 4.9.2
-
-      - name: Setup Node.js environment
-        uses: actions/setup-node@1d0ff469b7ec7b3cb9d8673fde0c81c44821de2a # v4.2.0
-        with:
-          node-version: 20.x
-          cache: yarn
-
-      - name: Cache node modules
-        uses: actions/cache@0c907a75c2c80ebcb7f088228285e798b750cf8f # v4.2.1
-        env:
-          cache-name: cache-node-modules
-        with:
-          path: |
-            ~/.npm
-            **/node_modules
-          key: ${{ runner.os }}-build-${{ secrets.CACHE_VERSION }}-${{ env.cache-name }}-${{ hashFiles('**/package-lock.json', '**/yarn.lock') }}
-          restore-keys: |
-            ${{ runner.os }}-build-${{ secrets.CACHE_VERSION }}-${{ env.cache-name }}-
-
-      - name: Install contracts dependencies
-        run: yarn workspace @kleros/kleros-v2-contracts install
-
-      - name: Install Foundry
-        uses: foundry-rs/foundry-toolchain@82dee4ba654bd2146511f85f0d013af94670c4de # v1.4.0
-
-      - name: Run Foundry tests
-        run: forge test
-        working-directory: contracts
+  # COMPILATION FAILS 🤬
+  # foundry-tests:
+  #   runs-on: ubuntu-latest
+  #   steps:
+  #     - name: Harden Runner
+  #       uses: step-security/harden-runner@4d991eb9b905ef189e4c376166672c3f2f230481 # v2.11.0
+  #       with:
+  #         disable-sudo: false
+  #         egress-policy: block
+  #         allowed-endpoints: >
+  #           binaries.soliditylang.org:443
+  #           classic.yarnpkg.com:443
+  #           github.com:443
+  #           nightly.yarnpkg.com:443
+  #           nodejs.org:443
+  #           objects.githubusercontent.com:443
+  #           registry.yarnpkg.com:443
+  #           registry.npmjs.org:443
+  #           54.185.253.63:443
+
+  #     - uses: actions/checkout@11bd71901bbe5b1630ceea73d27597364c9af683 # v4.2.2
+  #       with:
+  #         submodules: recursive
+
+  #     - name: Set up corepack (for yarn)
+  #       run: |
+  #         corepack enable
+  #         corepack prepare yarn@4.9.2 --activate
+  #         yarn set version 4.9.2
+
+  #     - name: Setup Node.js environment
+  #       uses: actions/setup-node@1d0ff469b7ec7b3cb9d8673fde0c81c44821de2a # v4.2.0
+  #       with:
+  #         node-version: 20.x
+  #         cache: yarn
+
+  #     - name: Cache node modules
+  #       uses: actions/cache@0c907a75c2c80ebcb7f088228285e798b750cf8f # v4.2.1
+  #       env:
+  #         cache-name: cache-node-modules
+  #       with:
+  #         path: |
+  #           ~/.npm
+  #           **/node_modules
+  #         key: ${{ runner.os }}-build-${{ secrets.CACHE_VERSION }}-${{ env.cache-name }}-${{ hashFiles('**/package-lock.json', '**/yarn.lock') }}
+  #         restore-keys: |
+  #           ${{ runner.os }}-build-${{ secrets.CACHE_VERSION }}-${{ env.cache-name }}-
+
+  #     # - name: Install contracts dependencies
+  #     #   run: yarn workspace @kleros/kleros-v2-contracts install
+
+  #     - name: Install Foundry
+  #       uses: foundry-rs/foundry-toolchain@82dee4ba654bd2146511f85f0d013af94670c4de # v1.4.0
+
+  #     - name: Run Foundry tests
+  #       run: forge test --config-path ./foundry.toml
+  #       working-directory: contracts
+
+  #     - name: Run snapshot
+  #       run: NO_COLOR=1 forge snapshot >> $GITHUB_STEP_SUMMARY
+  #       working-directory: contracts

From 98f7eacccecaf686ecfda844bcbe8aa5b6583182 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 4 Sep 2025 16:00:42 +0100
Subject: [PATCH 091/175] fix: guard against currentStake exceeding
 SortitionModuleNeo.maxStakePerJuror

---
 contracts/src/arbitration/SortitionModuleNeo.sol | 2 +-
 contracts/src/libraries/Constants.sol            | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/contracts/src/arbitration/SortitionModuleNeo.sol b/contracts/src/arbitration/SortitionModuleNeo.sol
index 7c2a3b53b..4d28f97b5 100644
--- a/contracts/src/arbitration/SortitionModuleNeo.sol
+++ b/contracts/src/arbitration/SortitionModuleNeo.sol
@@ -85,7 +85,7 @@ contract SortitionModuleNeo is SortitionModuleBase {
         uint256 stakeChange = stakeIncrease ? _newStake - currentStake : currentStake - _newStake;
         Juror storage juror = jurors[_account];
         if (stakeIncrease) {
-            if (juror.stakedPnk + stakeChange > maxStakePerJuror) {
+            if (juror.stakedPnk + stakeChange > maxStakePerJuror || currentStake + stakeChange > maxStakePerJuror) {
                 return (0, 0, StakingResult.CannotStakeMoreThanMaxStakePerJuror);
             }
             if (totalStaked + stakeChange > maxTotalStaked) {
diff --git a/contracts/src/libraries/Constants.sol b/contracts/src/libraries/Constants.sol
index 10c42d8a9..1f0132668 100644
--- a/contracts/src/libraries/Constants.sol
+++ b/contracts/src/libraries/Constants.sol
@@ -9,7 +9,7 @@ uint96 constant FORKING_COURT = 0; // Index of the forking court.
 uint96 constant GENERAL_COURT = 1; // Index of the default (general) court.
 
 // Dispute Kits
-uint256 constant NULL_DISPUTE_KIT = 0; // Null pattern to indicate a top-level DK which has no parent. DEPRECATED, as its main purpose was to accommodate forest structure which is not used now.
+uint256 constant NULL_DISPUTE_KIT = 0; // Null pattern to indicate a top-level DK which has no parent.
 uint256 constant DISPUTE_KIT_CLASSIC = 1; // Index of the default DK. 0 index is skipped.
 
 // Sortition Module

From 030eedf2380b59800249e015b1a4ee693d671095 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 4 Sep 2025 18:00:53 +0100
Subject: [PATCH 092/175] feat: reset of the proxies version and initializers
 ahead of the migration

---
 contracts/deploy/upgrade-all.ts                      |  8 ++++----
 .../src/arbitration/DisputeTemplateRegistry.sol      |  8 ++------
 contracts/src/arbitration/KlerosCore.sol             |  8 ++------
 contracts/src/arbitration/KlerosCoreNeo.sol          |  6 +-----
 contracts/src/arbitration/PolicyRegistry.sol         |  8 ++------
 contracts/src/arbitration/SortitionModule.sol        |  8 ++------
 contracts/src/arbitration/SortitionModuleNeo.sol     |  6 +-----
 .../src/arbitration/devtools/KlerosCoreRuler.sol     | 12 ++----------
 .../arbitration/dispute-kits/DisputeKitClassic.sol   |  8 ++------
 .../src/arbitration/dispute-kits/DisputeKitGated.sol |  8 ++------
 .../dispute-kits/DisputeKitGatedShutter.sol          |  8 ++------
 .../arbitration/dispute-kits/DisputeKitShutter.sol   |  8 ++------
 .../dispute-kits/DisputeKitSybilResistant.sol        |  4 ++--
 .../src/arbitration/evidence/EvidenceModule.sol      |  8 ++------
 .../arbitration/university/KlerosCoreUniversity.sol  |  4 ++--
 .../university/SortitionModuleUniversity.sol         |  4 ++--
 contracts/src/gateway/ForeignGateway.sol             |  2 +-
 contracts/src/gateway/HomeGateway.sol                |  2 +-
 contracts/src/proxy/Initializable.sol                |  2 +-
 .../mock/by-inheritance/UpgradedByInheritance.sol    |  4 ++--
 .../src/proxy/mock/by-rewrite/UpgradedByRewrite.sol  |  2 +-
 21 files changed, 38 insertions(+), 90 deletions(-)

diff --git a/contracts/deploy/upgrade-all.ts b/contracts/deploy/upgrade-all.ts
index 74433c413..dfd0d882c 100644
--- a/contracts/deploy/upgrade-all.ts
+++ b/contracts/deploy/upgrade-all.ts
@@ -98,11 +98,11 @@ const deployUpgradeAll: DeployFunction = async (hre: HardhatRuntimeEnvironment)
   await upgrade(disputeKitShutter, "reinitialize", [wETH.address]);
   await upgrade(disputeKitGated, "reinitialize", [wETH.address]);
   await upgrade(disputeKitGatedShutter, "reinitialize", [wETH.address]);
-  await upgrade(disputeTemplateRegistry, "initialize2", []);
-  await upgrade(evidence, "initialize2", []);
+  await upgrade(disputeTemplateRegistry, "reinitialize", []);
+  await upgrade(evidence, "reinitialize", []);
   await upgrade(core, "reinitialize", [wETH.address]);
-  await upgrade(policyRegistry, "initialize2", []);
-  await upgrade(sortition, "initialize4", []);
+  await upgrade(policyRegistry, "reinitialize", []);
+  await upgrade(sortition, "reinitialize", []);
 };
 
 deployUpgradeAll.tags = ["UpgradeAll"];
diff --git a/contracts/src/arbitration/DisputeTemplateRegistry.sol b/contracts/src/arbitration/DisputeTemplateRegistry.sol
index b9354aa0a..8d3d68d58 100644
--- a/contracts/src/arbitration/DisputeTemplateRegistry.sol
+++ b/contracts/src/arbitration/DisputeTemplateRegistry.sol
@@ -8,7 +8,7 @@ import "./interfaces/IDisputeTemplateRegistry.sol";
 /// @title Dispute Template Registry
 /// @dev A contract to maintain a registry of dispute templates.
 contract DisputeTemplateRegistry is IDisputeTemplateRegistry, UUPSProxiable, Initializable {
-    string public constant override version = "0.8.0";
+    string public constant override version = "2.0.0";
 
     // ************************************* //
     // *             Storage               * //
@@ -40,14 +40,10 @@ contract DisputeTemplateRegistry is IDisputeTemplateRegistry, UUPSProxiable, Ini
 
     /// @dev Initializer
     /// @param _owner Owner of the contract.
-    function initialize(address _owner) external reinitializer(1) {
+    function initialize(address _owner) external initializer {
         owner = _owner;
     }
 
-    function initialize2() external reinitializer(2) {
-        // NOP
-    }
-
     // ************************ //
     // *      Governance      * //
     // ************************ //
diff --git a/contracts/src/arbitration/KlerosCore.sol b/contracts/src/arbitration/KlerosCore.sol
index 912a57269..4dd30f61b 100644
--- a/contracts/src/arbitration/KlerosCore.sol
+++ b/contracts/src/arbitration/KlerosCore.sol
@@ -8,7 +8,7 @@ import {KlerosCoreBase, IDisputeKit, ISortitionModule, IERC20} from "./KlerosCor
 /// Core arbitrator contract for Kleros v2.
 /// Note that this contract trusts the PNK token, the dispute kit and the sortition module contracts.
 contract KlerosCore is KlerosCoreBase {
-    string public constant override version = "0.10.0";
+    string public constant override version = "2.0.0";
 
     // ************************************* //
     // *            Constructor            * //
@@ -43,7 +43,7 @@ contract KlerosCore is KlerosCoreBase {
         bytes memory _sortitionExtraData,
         ISortitionModule _sortitionModuleAddress,
         address _wNative
-    ) external reinitializer(1) {
+    ) external initializer {
         __KlerosCoreBase_initialize(
             _owner,
             _guardian,
@@ -59,10 +59,6 @@ contract KlerosCore is KlerosCoreBase {
         );
     }
 
-    function reinitialize(address _wNative) external reinitializer(6) {
-        wNative = _wNative;
-    }
-
     // ************************************* //
     // *             Governance            * //
     // ************************************* //
diff --git a/contracts/src/arbitration/KlerosCoreNeo.sol b/contracts/src/arbitration/KlerosCoreNeo.sol
index ebfd1bb72..8f0a413b3 100644
--- a/contracts/src/arbitration/KlerosCoreNeo.sol
+++ b/contracts/src/arbitration/KlerosCoreNeo.sol
@@ -9,7 +9,7 @@ import "@openzeppelin/contracts/token/ERC721/IERC721.sol";
 /// Core arbitrator contract for Kleros v2.
 /// Note that this contract trusts the PNK token, the dispute kit and the sortition module contracts.
 contract KlerosCoreNeo is KlerosCoreBase {
-    string public constant override version = "0.10.0";
+    string public constant override version = "2.0.0";
 
     // ************************************* //
     // *             Storage               * //
@@ -70,10 +70,6 @@ contract KlerosCoreNeo is KlerosCoreBase {
         jurorNft = _jurorNft;
     }
 
-    function reinitialize(address _wNative) external reinitializer(6) {
-        wNative = _wNative;
-    }
-
     // ************************************* //
     // *             Governance            * //
     // ************************************* //
diff --git a/contracts/src/arbitration/PolicyRegistry.sol b/contracts/src/arbitration/PolicyRegistry.sol
index acea8d01b..9c8d09f3e 100644
--- a/contracts/src/arbitration/PolicyRegistry.sol
+++ b/contracts/src/arbitration/PolicyRegistry.sol
@@ -7,7 +7,7 @@ import "../proxy/Initializable.sol";
 /// @title PolicyRegistry
 /// @dev A contract to maintain a policy for each court.
 contract PolicyRegistry is UUPSProxiable, Initializable {
-    string public constant override version = "0.8.0";
+    string public constant override version = "2.0.0";
 
     // ************************************* //
     // *              Events               * //
@@ -47,14 +47,10 @@ contract PolicyRegistry is UUPSProxiable, Initializable {
 
     /// @dev Constructs the `PolicyRegistry` contract.
     /// @param _owner The owner's address.
-    function initialize(address _owner) external reinitializer(1) {
+    function initialize(address _owner) external initializer {
         owner = _owner;
     }
 
-    function initialize2() external reinitializer(2) {
-        // NOP
-    }
-
     // ************************************* //
     // *            Governance             * //
     // ************************************* //
diff --git a/contracts/src/arbitration/SortitionModule.sol b/contracts/src/arbitration/SortitionModule.sol
index ae89335b0..bd0f6e007 100644
--- a/contracts/src/arbitration/SortitionModule.sol
+++ b/contracts/src/arbitration/SortitionModule.sol
@@ -7,7 +7,7 @@ import {SortitionModuleBase, KlerosCore, IRNG} from "./SortitionModuleBase.sol";
 /// @title SortitionModule
 /// @dev A factory of trees that keeps track of staked values for sortition.
 contract SortitionModule is SortitionModuleBase {
-    string public constant override version = "0.9.0";
+    string public constant override version = "2.0.0";
 
     // ************************************* //
     // *            Constructor            * //
@@ -30,14 +30,10 @@ contract SortitionModule is SortitionModuleBase {
         uint256 _minStakingTime,
         uint256 _maxDrawingTime,
         IRNG _rng
-    ) external reinitializer(1) {
+    ) external initializer {
         __SortitionModuleBase_initialize(_owner, _core, _minStakingTime, _maxDrawingTime, _rng);
     }
 
-    function initialize4() external reinitializer(4) {
-        // NOP
-    }
-
     // ************************************* //
     // *             Governance            * //
     // ************************************* //
diff --git a/contracts/src/arbitration/SortitionModuleNeo.sol b/contracts/src/arbitration/SortitionModuleNeo.sol
index 4d28f97b5..66dbba7e5 100644
--- a/contracts/src/arbitration/SortitionModuleNeo.sol
+++ b/contracts/src/arbitration/SortitionModuleNeo.sol
@@ -7,7 +7,7 @@ import {SortitionModuleBase, KlerosCore, IRNG, StakingResult} from "./SortitionM
 /// @title SortitionModuleNeo
 /// @dev A factory of trees that keeps track of staked values for sortition.
 contract SortitionModuleNeo is SortitionModuleBase {
-    string public constant override version = "0.9.0";
+    string public constant override version = "2.0.0";
 
     // ************************************* //
     // *             Storage               * //
@@ -48,10 +48,6 @@ contract SortitionModuleNeo is SortitionModuleBase {
         maxTotalStaked = _maxTotalStaked;
     }
 
-    function initialize4() external reinitializer(4) {
-        // NOP
-    }
-
     // ************************************* //
     // *             Governance            * //
     // ************************************* //
diff --git a/contracts/src/arbitration/devtools/KlerosCoreRuler.sol b/contracts/src/arbitration/devtools/KlerosCoreRuler.sol
index 9350ebd57..42a428299 100644
--- a/contracts/src/arbitration/devtools/KlerosCoreRuler.sol
+++ b/contracts/src/arbitration/devtools/KlerosCoreRuler.sol
@@ -13,7 +13,7 @@ import "../../libraries/Constants.sol";
 contract KlerosCoreRuler is IArbitratorV2, UUPSProxiable, Initializable {
     using SafeERC20 for IERC20;
 
-    string public constant override version = "0.8.0";
+    string public constant override version = "2.0.0";
 
     // ************************************* //
     // *         Enums / Structs           * //
@@ -175,11 +175,7 @@ contract KlerosCoreRuler is IArbitratorV2, UUPSProxiable, Initializable {
     /// @param _owner The owner's address.
     /// @param _pinakion The address of the token contract.
     /// @param _courtParameters Numeric parameters of General court (minStake, alpha, feeForJuror and jurorsForCourtJump respectively).
-    function initialize(
-        address _owner,
-        IERC20 _pinakion,
-        uint256[4] memory _courtParameters
-    ) external reinitializer(1) {
+    function initialize(address _owner, IERC20 _pinakion, uint256[4] memory _courtParameters) external initializer {
         owner = _owner;
         pinakion = _pinakion;
 
@@ -210,10 +206,6 @@ contract KlerosCoreRuler is IArbitratorV2, UUPSProxiable, Initializable {
         );
     }
 
-    function initialize2() external reinitializer(2) {
-        // NOP
-    }
-
     // ************************************* //
     // *             Governance            * //
     // ************************************* //
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassic.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassic.sol
index af89d2816..dd2edbab8 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassic.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassic.sol
@@ -11,7 +11,7 @@ import {DisputeKitClassicBase, KlerosCore} from "./DisputeKitClassicBase.sol";
 /// - an incentive system: equal split between coherent votes,
 /// - an appeal system: fund 2 choices only, vote on any choice.
 contract DisputeKitClassic is DisputeKitClassicBase {
-    string public constant override version = "0.13.0";
+    string public constant override version = "2.0.0";
 
     // ************************************* //
     // *            Constructor            * //
@@ -32,14 +32,10 @@ contract DisputeKitClassic is DisputeKitClassicBase {
         KlerosCore _core,
         address _wNative,
         uint256 _jumpDisputeKitID
-    ) external reinitializer(1) {
+    ) external initializer {
         __DisputeKitClassicBase_initialize(_owner, _core, _wNative, _jumpDisputeKitID);
     }
 
-    function reinitialize(uint256 _jumpDisputeKitID) external reinitializer(10) {
-        jumpDisputeKitID = _jumpDisputeKitID;
-    }
-
     // ************************ //
     // *      Governance      * //
     // ************************ //
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol b/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol
index 9097a8fd3..8abfdecac 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol
@@ -27,7 +27,7 @@ interface IBalanceHolderERC1155 {
 /// - an incentive system: equal split between coherent votes,
 /// - an appeal system: fund 2 choices only, vote on any choice.
 contract DisputeKitGated is DisputeKitClassicBase {
-    string public constant override version = "0.13.0";
+    string public constant override version = "2.0.0";
 
     // ************************************* //
     // *            Constructor            * //
@@ -48,14 +48,10 @@ contract DisputeKitGated is DisputeKitClassicBase {
         KlerosCore _core,
         address _wNative,
         uint256 _jumpDisputeKitID
-    ) external reinitializer(1) {
+    ) external initializer {
         __DisputeKitClassicBase_initialize(_owner, _core, _wNative, _jumpDisputeKitID);
     }
 
-    function reinitialize(uint256 _jumpDisputeKitID) external reinitializer(10) {
-        jumpDisputeKitID = _jumpDisputeKitID;
-    }
-
     // ************************ //
     // *      Governance      * //
     // ************************ //
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
index 67d9ddbea..573f81f11 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
@@ -28,7 +28,7 @@ interface IBalanceHolderERC1155 {
 /// - an incentive system: equal split between coherent votes,
 /// - an appeal system: fund 2 choices only, vote on any choice.
 contract DisputeKitGatedShutter is DisputeKitClassicBase {
-    string public constant override version = "0.13.0";
+    string public constant override version = "2.0.0";
 
     // ************************************* //
     // *             Storage               * //
@@ -82,14 +82,10 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
         KlerosCore _core,
         address _wNative,
         uint256 _jumpDisputeKitID
-    ) external reinitializer(1) {
+    ) external initializer {
         __DisputeKitClassicBase_initialize(_owner, _core, _wNative, _jumpDisputeKitID);
     }
 
-    function reinitialize(uint256 _jumpDisputeKitID) external reinitializer(10) {
-        jumpDisputeKitID = _jumpDisputeKitID;
-    }
-
     // ************************ //
     // *      Governance      * //
     // ************************ //
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol b/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
index b8bef461f..bbcb28b24 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
@@ -12,7 +12,7 @@ import {DisputeKitClassicBase, KlerosCore} from "./DisputeKitClassicBase.sol";
 /// - an incentive system: equal split between coherent votes,
 /// - an appeal system: fund 2 choices only, vote on any choice.
 contract DisputeKitShutter is DisputeKitClassicBase {
-    string public constant override version = "0.13.0";
+    string public constant override version = "2.0.0";
 
     // ************************************* //
     // *             Storage               * //
@@ -66,14 +66,10 @@ contract DisputeKitShutter is DisputeKitClassicBase {
         KlerosCore _core,
         address _wNative,
         uint256 _jumpDisputeKitID
-    ) external reinitializer(1) {
+    ) external initializer {
         __DisputeKitClassicBase_initialize(_owner, _core, _wNative, _jumpDisputeKitID);
     }
 
-    function reinitialize(uint256 _jumpDisputeKitID) external reinitializer(10) {
-        jumpDisputeKitID = _jumpDisputeKitID;
-    }
-
     // ************************ //
     // *      Governance      * //
     // ************************ //
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitSybilResistant.sol b/contracts/src/arbitration/dispute-kits/DisputeKitSybilResistant.sol
index 66553f02a..10cc67c5c 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitSybilResistant.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitSybilResistant.sol
@@ -18,7 +18,7 @@ interface IProofOfHumanity {
 /// - an incentive system: equal split between coherent votes,
 /// - an appeal system: fund 2 choices only, vote on any choice.
 contract DisputeKitSybilResistant is DisputeKitClassicBase {
-    string public constant override version = "0.13.0";
+    string public constant override version = "2.0.0";
 
     // ************************************* //
     // *             Storage               * //
@@ -47,7 +47,7 @@ contract DisputeKitSybilResistant is DisputeKitClassicBase {
         IProofOfHumanity _poh,
         address _wNative,
         uint256 _jumpDisputeKitID
-    ) external reinitializer(1) {
+    ) external initializer {
         __DisputeKitClassicBase_initialize(_owner, _core, _wNative, _jumpDisputeKitID);
         poh = _poh;
         singleDrawPerJuror = true;
diff --git a/contracts/src/arbitration/evidence/EvidenceModule.sol b/contracts/src/arbitration/evidence/EvidenceModule.sol
index d1eb5f99c..8321e55ba 100644
--- a/contracts/src/arbitration/evidence/EvidenceModule.sol
+++ b/contracts/src/arbitration/evidence/EvidenceModule.sol
@@ -9,7 +9,7 @@ import "../../proxy/Initializable.sol";
 
 /// @title Evidence Module
 contract EvidenceModule is IEvidence, Initializable, UUPSProxiable {
-    string public constant override version = "0.8.0";
+    string public constant override version = "2.0.0";
 
     // ************************************* //
     // *             Storage               * //
@@ -37,14 +37,10 @@ contract EvidenceModule is IEvidence, Initializable, UUPSProxiable {
 
     /// @dev Initializer.
     /// @param _owner The owner's address.
-    function initialize(address _owner) external reinitializer(1) {
+    function initialize(address _owner) external initializer {
         owner = _owner;
     }
 
-    function initialize2() external reinitializer(2) {
-        // NOP
-    }
-
     // ************************ //
     // *      Governance      * //
     // ************************ //
diff --git a/contracts/src/arbitration/university/KlerosCoreUniversity.sol b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
index b2519fdd7..afe7fc4d4 100644
--- a/contracts/src/arbitration/university/KlerosCoreUniversity.sol
+++ b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
@@ -15,7 +15,7 @@ import "../../libraries/Constants.sol";
 contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
     using SafeERC20 for IERC20;
 
-    string public constant override version = "0.8.0";
+    string public constant override version = "2.0.0";
 
     // ************************************* //
     // *         Enums / Structs           * //
@@ -207,7 +207,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         uint256[4] memory _courtParameters,
         uint256[4] memory _timesPerPeriod,
         ISortitionModuleUniversity _sortitionModuleAddress
-    ) external reinitializer(1) {
+    ) external initializer {
         owner = _owner;
         instructor = _instructor;
         pinakion = _pinakion;
diff --git a/contracts/src/arbitration/university/SortitionModuleUniversity.sol b/contracts/src/arbitration/university/SortitionModuleUniversity.sol
index 63720eb18..66e815e4a 100644
--- a/contracts/src/arbitration/university/SortitionModuleUniversity.sol
+++ b/contracts/src/arbitration/university/SortitionModuleUniversity.sol
@@ -12,7 +12,7 @@ import "../../libraries/Constants.sol";
 /// @title SortitionModuleUniversity
 /// @dev An adapted version of the SortitionModule contract for educational purposes.
 contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable, Initializable {
-    string public constant override version = "0.8.0";
+    string public constant override version = "2.0.0";
 
     // ************************************* //
     // *         Enums / Structs           * //
@@ -87,7 +87,7 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
 
     /// @dev Initializer (constructor equivalent for upgradable contracts).
     /// @param _core The KlerosCore.
-    function initialize(address _owner, KlerosCoreUniversity _core) external reinitializer(1) {
+    function initialize(address _owner, KlerosCoreUniversity _core) external initializer {
         owner = _owner;
         core = _core;
     }
diff --git a/contracts/src/gateway/ForeignGateway.sol b/contracts/src/gateway/ForeignGateway.sol
index 712790d0d..366f3e6f0 100644
--- a/contracts/src/gateway/ForeignGateway.sol
+++ b/contracts/src/gateway/ForeignGateway.sol
@@ -81,7 +81,7 @@ contract ForeignGateway is IForeignGateway, UUPSProxiable, Initializable {
         address _veaOutbox,
         uint256 _homeChainID,
         address _homeGateway
-    ) external reinitializer(1) {
+    ) external initializer {
         owner = _owner;
         veaOutbox = _veaOutbox;
         homeChainID = _homeChainID;
diff --git a/contracts/src/gateway/HomeGateway.sol b/contracts/src/gateway/HomeGateway.sol
index d0062dc52..2a23913ef 100644
--- a/contracts/src/gateway/HomeGateway.sol
+++ b/contracts/src/gateway/HomeGateway.sol
@@ -72,7 +72,7 @@ contract HomeGateway is IHomeGateway, UUPSProxiable, Initializable {
         uint256 _foreignChainID,
         address _foreignGateway,
         IERC20 _feeToken
-    ) external reinitializer(1) {
+    ) external initializer {
         owner = _owner;
         arbitrator = _arbitrator;
         veaInbox = _veaInbox;
diff --git a/contracts/src/proxy/Initializable.sol b/contracts/src/proxy/Initializable.sol
index 47769a9f2..7bdf08eb4 100644
--- a/contracts/src/proxy/Initializable.sol
+++ b/contracts/src/proxy/Initializable.sol
@@ -93,7 +93,7 @@ abstract contract Initializable {
      * @dev A modifier that defines a protected initializer function that can be invoked at most once. In its scope,
      * `onlyInitializing` functions can be used to initialize parent contracts.
      *
-     * Similar to `reinitializer(1)`, except that functions marked with `initializer` can be nested in the context of a
+     * Similar to `initializer()`, except that functions marked with `initializer` can be nested in the context of a
      * constructor.
      *
      * Emits an {Initialized} event.
diff --git a/contracts/src/proxy/mock/by-inheritance/UpgradedByInheritance.sol b/contracts/src/proxy/mock/by-inheritance/UpgradedByInheritance.sol
index c5f796995..b443051a8 100644
--- a/contracts/src/proxy/mock/by-inheritance/UpgradedByInheritance.sol
+++ b/contracts/src/proxy/mock/by-inheritance/UpgradedByInheritance.sol
@@ -20,7 +20,7 @@ contract UpgradedByInheritanceV1 is UUPSProxiable, Initializable {
         _disableInitializers();
     }
 
-    function initialize(address _owner) external virtual reinitializer(1) {
+    function initialize(address _owner) external virtual initializer {
         owner = _owner;
         counter = 1;
     }
@@ -61,7 +61,7 @@ contract UpgradedByInheritanceV3Bad is UpgradedByInheritanceV2 {
         _disableInitializers();
     }
 
-    function initializeV3() external reinitializer(1) {
+    function initializeV3() external initializer {
         // Wrong reinitializer version.
     }
 }
diff --git a/contracts/src/proxy/mock/by-rewrite/UpgradedByRewrite.sol b/contracts/src/proxy/mock/by-rewrite/UpgradedByRewrite.sol
index f5e5eae77..d8930796d 100644
--- a/contracts/src/proxy/mock/by-rewrite/UpgradedByRewrite.sol
+++ b/contracts/src/proxy/mock/by-rewrite/UpgradedByRewrite.sol
@@ -23,7 +23,7 @@ contract UpgradedByRewrite is UUPSProxiable, Initializable {
         _disableInitializers();
     }
 
-    function initialize(address _owner) external virtual reinitializer(1) {
+    function initialize(address _owner) external virtual initializer {
         owner = _owner;
         counter = 1;
     }

From 63744e9f1292f83f5488ed325fa078250c6cac81 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 4 Sep 2025 18:12:38 +0100
Subject: [PATCH 093/175] feat: added a arbitrableWhitelistEnabled flag to
 KlerosCoreNeo

---
 .../deploy/00-home-chain-arbitration-neo.ts   |  2 +
 contracts/src/arbitration/KlerosCoreNeo.sol   |  8 +++-
 contracts/test/arbitration/staking-neo.ts     | 45 +++++++++++++------
 3 files changed, 41 insertions(+), 14 deletions(-)

diff --git a/contracts/deploy/00-home-chain-arbitration-neo.ts b/contracts/deploy/00-home-chain-arbitration-neo.ts
index 36a895c74..d5d8a136c 100644
--- a/contracts/deploy/00-home-chain-arbitration-neo.ts
+++ b/contracts/deploy/00-home-chain-arbitration-neo.ts
@@ -119,6 +119,8 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
     args: [core.target, disputeTemplateRegistry.target],
     log: true,
   });
+  console.log(`core.changeArbitrableWhitelistEnabled(true)`);
+  await core.changeArbitrableWhitelistEnabled(true);
   console.log(`core.changeArbitrableWhitelist(${resolver.address}, true)`);
   await core.changeArbitrableWhitelist(resolver.address, true);
 
diff --git a/contracts/src/arbitration/KlerosCoreNeo.sol b/contracts/src/arbitration/KlerosCoreNeo.sol
index 8f0a413b3..25cef5b25 100644
--- a/contracts/src/arbitration/KlerosCoreNeo.sol
+++ b/contracts/src/arbitration/KlerosCoreNeo.sol
@@ -16,6 +16,7 @@ contract KlerosCoreNeo is KlerosCoreBase {
     // ************************************* //
 
     mapping(address => bool) public arbitrableWhitelist; // Arbitrable whitelist.
+    bool public arbitrableWhitelistEnabled; // Whether the arbitrable whitelist is enabled.
     IERC721 public jurorNft; // Eligible jurors NFT.
 
     // ************************************* //
@@ -93,6 +94,11 @@ contract KlerosCoreNeo is KlerosCoreBase {
         arbitrableWhitelist[_arbitrable] = _allowed;
     }
 
+    /// @dev Enables or disables the arbitrable whitelist.
+    function changeArbitrableWhitelistEnabled(bool _enabled) external onlyByOwner {
+        arbitrableWhitelistEnabled = _enabled;
+    }
+
     // ************************************* //
     // *         State Modifiers           * //
     // ************************************* //
@@ -117,7 +123,7 @@ contract KlerosCoreNeo is KlerosCoreBase {
         IERC20 _feeToken,
         uint256 _feeAmount
     ) internal override returns (uint256 disputeID) {
-        if (!arbitrableWhitelist[msg.sender]) revert ArbitrableNotWhitelisted();
+        if (arbitrableWhitelistEnabled && !arbitrableWhitelist[msg.sender]) revert ArbitrableNotWhitelisted();
         return super._createDispute(_numberOfChoices, _extraData, _feeToken, _feeAmount);
     }
 
diff --git a/contracts/test/arbitration/staking-neo.ts b/contracts/test/arbitration/staking-neo.ts
index 5537742a6..a21bd0c7b 100644
--- a/contracts/test/arbitration/staking-neo.ts
+++ b/contracts/test/arbitration/staking-neo.ts
@@ -128,31 +128,50 @@ describe("Staking", async () => {
     SHOULD BEHAVE LIKE A NEO ARBITRATOR
   ************************************************************************************************/
 
-  describe("When arbitrable is not whitelisted", () => {
+  describe("When arbitrable whitelist is disabled", () => {
     before("Setup", async () => {
       await deployUnhappy();
-      await core.changeArbitrableWhitelist(resolver.target, false);
+      await core.changeArbitrableWhitelistEnabled(false);
     });
 
-    it("Should fail to create a dispute", async () => {
+    it("Should create a dispute", async () => {
       const arbitrationCost = ETH(0.5);
-      await expect(
-        resolver.createDisputeForTemplate(extraData, "", "", 2, { value: arbitrationCost })
-      ).to.be.revertedWithCustomError(core, "ArbitrableNotWhitelisted");
+      expect(await resolver.createDisputeForTemplate(extraData, "", "", 2, { value: arbitrationCost }))
+        .to.emit(core, "DisputeCreation")
+        .withArgs(0, resolver.target);
     });
   });
 
-  describe("When arbitrable is whitelisted", () => {
+  describe("When arbitrable whitelist is enabled", () => {
     before("Setup", async () => {
       await deployUnhappy();
-      await core.changeArbitrableWhitelist(resolver.target, true);
+      await core.changeArbitrableWhitelistEnabled(true);
     });
 
-    it("Should create a dispute", async () => {
-      const arbitrationCost = ETH(0.5);
-      expect(await resolver.createDisputeForTemplate(extraData, "", "", 2, { value: arbitrationCost }))
-        .to.emit(core, "DisputeCreation")
-        .withArgs(0, resolver.target);
+    describe("When arbitrable is not whitelisted", () => {
+      before("Setup", async () => {
+        await core.changeArbitrableWhitelist(resolver.target, false);
+      });
+
+      it("Should fail to create a dispute", async () => {
+        const arbitrationCost = ETH(0.5);
+        await expect(
+          resolver.createDisputeForTemplate(extraData, "", "", 2, { value: arbitrationCost })
+        ).to.be.revertedWithCustomError(core, "ArbitrableNotWhitelisted");
+      });
+    });
+
+    describe("When arbitrable is whitelisted", () => {
+      before("Setup", async () => {
+        await core.changeArbitrableWhitelist(resolver.target, true);
+      });
+
+      it("Should create a dispute", async () => {
+        const arbitrationCost = ETH(0.5);
+        expect(await resolver.createDisputeForTemplate(extraData, "", "", 2, { value: arbitrationCost }))
+          .to.emit(core, "DisputeCreation")
+          .withArgs(0, resolver.target);
+      });
     });
   });
 

From 262f940fcc918205f0b41aa60394c155456ec8c4 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 4 Sep 2025 18:20:39 +0100
Subject: [PATCH 094/175] feat: allow jurorNft to be address(0) which disables
 gating

---
 contracts/src/arbitration/KlerosCoreNeo.sol |  2 +-
 contracts/test/arbitration/staking-neo.ts   | 53 ++++++++++++++-------
 2 files changed, 37 insertions(+), 18 deletions(-)

diff --git a/contracts/src/arbitration/KlerosCoreNeo.sol b/contracts/src/arbitration/KlerosCoreNeo.sol
index 25cef5b25..6f43132d1 100644
--- a/contracts/src/arbitration/KlerosCoreNeo.sol
+++ b/contracts/src/arbitration/KlerosCoreNeo.sol
@@ -109,7 +109,7 @@ contract KlerosCoreNeo is KlerosCoreBase {
     /// @param _newStake The new stake.
     /// Note that the existing delayed stake will be nullified as non-relevant.
     function setStake(uint96 _courtID, uint256 _newStake) external override whenNotPaused {
-        if (jurorNft.balanceOf(msg.sender) == 0) revert NotEligibleForStaking();
+        if (address(jurorNft) != address(0) && jurorNft.balanceOf(msg.sender) == 0) revert NotEligibleForStaking();
         super._setStake(msg.sender, _courtID, _newStake, false, OnError.Revert);
     }
 
diff --git a/contracts/test/arbitration/staking-neo.ts b/contracts/test/arbitration/staking-neo.ts
index a21bd0c7b..fb36787d8 100644
--- a/contracts/test/arbitration/staking-neo.ts
+++ b/contracts/test/arbitration/staking-neo.ts
@@ -175,32 +175,51 @@ describe("Staking", async () => {
     });
   });
 
-  describe("When juror has no NFT", async () => {
+  describe("When juror NFT is not set", async () => {
     before("Setup", async () => {
       await deployUnhappy();
+      await core.changeJurorNft(ethers.ZeroAddress);
     });
 
-    it("Should not be able to stake", async () => {
-      await pnk.connect(juror).approve(core.target, PNK(1000));
-      await expect(core.connect(juror).setStake(1, PNK(1000))).to.be.revertedWithCustomError(
-        core,
-        "NotEligibleForStaking"
-      );
+    describe("When juror has no NFT", async () => {
+      it("Should be able to stake", async () => {
+        await pnk.connect(juror).approve(core.target, PNK(1000));
+        await expect(await core.connect(juror).setStake(1, PNK(1000)))
+          .to.emit(sortition, "StakeSet")
+          .withArgs(juror.address, 1, PNK(1000), PNK(1000));
+        expect(await sortition.totalStaked()).to.be.equal(PNK(1000));
+      });
     });
   });
 
-  describe("When juror does have a NFT", async () => {
-    before("Setup", async () => {
-      await deployUnhappy();
-      await nft.safeMint(juror.address);
+  describe("When juror NFT is set", async () => {
+    describe("When juror has no NFT", async () => {
+      before("Setup", async () => {
+        await deployUnhappy();
+      });
+
+      it("Should not be able to stake", async () => {
+        await pnk.connect(juror).approve(core.target, PNK(1000));
+        await expect(core.connect(juror).setStake(1, PNK(1000))).to.be.revertedWithCustomError(
+          core,
+          "NotEligibleForStaking"
+        );
+      });
     });
 
-    it("Should be able to stake", async () => {
-      await pnk.connect(juror).approve(core.target, PNK(1000));
-      await expect(await core.connect(juror).setStake(1, PNK(1000)))
-        .to.emit(sortition, "StakeSet")
-        .withArgs(juror.address, 1, PNK(1000), PNK(1000));
-      expect(await sortition.totalStaked()).to.be.equal(PNK(1000));
+    describe("When juror does have a NFT", async () => {
+      before("Setup", async () => {
+        await deployUnhappy();
+        await nft.safeMint(juror.address);
+      });
+
+      it("Should be able to stake", async () => {
+        await pnk.connect(juror).approve(core.target, PNK(1000));
+        await expect(await core.connect(juror).setStake(1, PNK(1000)))
+          .to.emit(sortition, "StakeSet")
+          .withArgs(juror.address, 1, PNK(1000), PNK(1000));
+        expect(await sortition.totalStaked()).to.be.equal(PNK(1000));
+      });
     });
   });
 

From bd210be7bd26adfa33232606ce582b699e61fc9b Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 4 Sep 2025 18:39:43 +0100
Subject: [PATCH 095/175] feat: only KlerosCore, no more KlerosCoreBase and
 KlerosCoreNeo

---
 contracts/src/arbitration/KlerosCore.sol      | 1282 ++++++++++++++++-
 contracts/src/arbitration/KlerosCoreBase.sol  | 1275 ----------------
 contracts/src/arbitration/KlerosCoreNeo.sol   |  144 --
 .../dispute-kits/DisputeKitClassicBase.sol    |    8 +-
 contracts/src/proxy/KlerosProxies.sol         |   12 -
 .../test/foundry/KlerosCore_Appeals.t.sol     |   56 +-
 .../test/foundry/KlerosCore_Disputes.t.sol    |   22 +-
 .../test/foundry/KlerosCore_Drawing.t.sol     |   14 +-
 .../test/foundry/KlerosCore_Execution.t.sol   |   52 +-
 .../test/foundry/KlerosCore_Governance.t.sol  |   78 +-
 .../foundry/KlerosCore_Initialization.t.sol   |   11 +-
 .../test/foundry/KlerosCore_Staking.t.sol     |   20 +-
 .../test/foundry/KlerosCore_TestBase.sol      |    7 +-
 .../test/foundry/KlerosCore_Voting.t.sol      |   36 +-
 14 files changed, 1422 insertions(+), 1595 deletions(-)
 delete mode 100644 contracts/src/arbitration/KlerosCoreBase.sol
 delete mode 100644 contracts/src/arbitration/KlerosCoreNeo.sol

diff --git a/contracts/src/arbitration/KlerosCore.sol b/contracts/src/arbitration/KlerosCore.sol
index 4dd30f61b..f7d6cf493 100644
--- a/contracts/src/arbitration/KlerosCore.sol
+++ b/contracts/src/arbitration/KlerosCore.sol
@@ -2,14 +2,198 @@
 
 pragma solidity ^0.8.24;
 
-import {KlerosCoreBase, IDisputeKit, ISortitionModule, IERC20} from "./KlerosCoreBase.sol";
+import {IArbitrableV2, IArbitratorV2} from "./interfaces/IArbitratorV2.sol";
+import {IDisputeKit} from "./interfaces/IDisputeKit.sol";
+import {ISortitionModule} from "./interfaces/ISortitionModule.sol";
+import {Initializable} from "../proxy/Initializable.sol";
+import {UUPSProxiable} from "../proxy/UUPSProxiable.sol";
+import {SafeERC20, IERC20} from "../libraries/SafeERC20.sol";
+import {SafeSend} from "../libraries/SafeSend.sol";
+import {IERC721} from "@openzeppelin/contracts/token/ERC721/IERC721.sol";
+import "../libraries/Constants.sol";
 
 /// @title KlerosCore
 /// Core arbitrator contract for Kleros v2.
 /// Note that this contract trusts the PNK token, the dispute kit and the sortition module contracts.
-contract KlerosCore is KlerosCoreBase {
+contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
+    using SafeERC20 for IERC20;
+    using SafeSend for address payable;
+
     string public constant override version = "2.0.0";
 
+    // ************************************* //
+    // *         Enums / Structs           * //
+    // ************************************* //
+
+    enum Period {
+        evidence, // Evidence can be submitted. This is also when drawing has to take place.
+        commit, // Jurors commit a hashed vote. This is skipped for courts without hidden votes.
+        vote, // Jurors reveal/cast their vote depending on whether the court has hidden votes or not.
+        appeal, // The dispute can be appealed.
+        execution // Tokens are redistributed and the ruling is executed.
+    }
+
+    struct Court {
+        uint96 parent; // The parent court.
+        bool hiddenVotes; // Whether to use commit and reveal or not.
+        uint256[] children; // List of child courts.
+        uint256 minStake; // Minimum PNKs needed to stake in the court.
+        uint256 alpha; // Basis point of PNKs that are lost when incoherent.
+        uint256 feeForJuror; // Arbitration fee paid per juror.
+        uint256 jurorsForCourtJump; // The appeal after the one that reaches this number of jurors will go to the parent court if any.
+        uint256[4] timesPerPeriod; // The time allotted to each dispute period in the form `timesPerPeriod[period]`.
+        mapping(uint256 disputeKitId => bool) supportedDisputeKits; // True if DK with this ID is supported by the court. Note that each court must support classic dispute kit.
+        bool disabled; // True if the court is disabled. Unused for now, will be implemented later.
+    }
+
+    struct Dispute {
+        uint96 courtID; // The ID of the court the dispute is in.
+        IArbitrableV2 arbitrated; // The arbitrable contract.
+        Period period; // The current period of the dispute.
+        bool ruled; // True if the ruling has been executed, false otherwise.
+        uint256 lastPeriodChange; // The last time the period was changed.
+        Round[] rounds;
+    }
+
+    struct Round {
+        uint256 disputeKitID; // Index of the dispute kit in the array.
+        uint256 pnkAtStakePerJuror; // The amount of PNKs at stake for each juror in this round.
+        uint256 totalFeesForJurors; // The total juror fees paid in this round.
+        uint256 nbVotes; // The total number of votes the dispute can possibly have in the current round. Former votes[_round].length.
+        uint256 repartitions; // A counter of reward repartitions made in this round.
+        uint256 pnkPenalties; // The amount of PNKs collected from penalties in this round.
+        address[] drawnJurors; // Addresses of the jurors that were drawn in this round.
+        uint96[] drawnJurorFromCourtIDs; // The courtIDs where the juror was drawn from, possibly their stake in a subcourt.
+        uint256 sumFeeRewardPaid; // Total sum of arbitration fees paid to coherent jurors as a reward in this round.
+        uint256 sumPnkRewardPaid; // Total sum of PNK paid to coherent jurors as a reward in this round.
+        IERC20 feeToken; // The token used for paying fees in this round.
+        uint256 drawIterations; // The number of iterations passed drawing the jurors for this round.
+    }
+
+    // Workaround "stack too deep" errors
+    struct ExecuteParams {
+        uint256 disputeID; // The ID of the dispute to execute.
+        uint256 round; // The round to execute.
+        uint256 coherentCount; // The number of coherent votes in the round.
+        uint256 numberOfVotesInRound; // The number of votes in the round.
+        uint256 feePerJurorInRound; // The fee per juror in the round.
+        uint256 pnkAtStakePerJurorInRound; // The amount of PNKs at stake for each juror in the round.
+        uint256 pnkPenaltiesInRound; // The amount of PNKs collected from penalties in the round.
+        uint256 repartition; // The index of the repartition to execute.
+    }
+
+    struct CurrencyRate {
+        bool feePaymentAccepted;
+        uint64 rateInEth;
+        uint8 rateDecimals;
+    }
+
+    // ************************************* //
+    // *             Storage               * //
+    // ************************************* //
+
+    uint256 private constant NON_PAYABLE_AMOUNT = (2 ** 256 - 2) / 2; // An amount higher than the supply of ETH.
+
+    address public owner; // The owner of the contract.
+    address public guardian; // The guardian able to pause asset withdrawals.
+    IERC20 public pinakion; // The Pinakion token contract.
+    address public jurorProsecutionModule; // The module for juror's prosecution.
+    ISortitionModule public sortitionModule; // Sortition module for drawing.
+    Court[] public courts; // The courts.
+    IDisputeKit[] public disputeKits; // Array of dispute kits.
+    Dispute[] public disputes; // The disputes.
+    mapping(IERC20 => CurrencyRate) public currencyRates; // The price of each token in ETH.
+    bool public paused; // Whether asset withdrawals are paused.
+    address public wNative; // The wrapped native token for safeSend().
+    mapping(address => bool) public arbitrableWhitelist; // Arbitrable whitelist.
+    bool public arbitrableWhitelistEnabled; // Whether the arbitrable whitelist is enabled.
+    IERC721 public jurorNft; // Eligible jurors NFT.
+
+    // ************************************* //
+    // *              Events               * //
+    // ************************************* //
+
+    event NewPeriod(uint256 indexed _disputeID, Period _period);
+    event AppealPossible(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);
+    event AppealDecision(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);
+    event Draw(address indexed _address, uint256 indexed _disputeID, uint256 _roundID, uint256 _voteID);
+    event CourtCreated(
+        uint96 indexed _courtID,
+        uint96 indexed _parent,
+        bool _hiddenVotes,
+        uint256 _minStake,
+        uint256 _alpha,
+        uint256 _feeForJuror,
+        uint256 _jurorsForCourtJump,
+        uint256[4] _timesPerPeriod,
+        uint256[] _supportedDisputeKits
+    );
+    event CourtModified(
+        uint96 indexed _courtID,
+        bool _hiddenVotes,
+        uint256 _minStake,
+        uint256 _alpha,
+        uint256 _feeForJuror,
+        uint256 _jurorsForCourtJump,
+        uint256[4] _timesPerPeriod
+    );
+    event DisputeKitCreated(uint256 indexed _disputeKitID, IDisputeKit indexed _disputeKitAddress);
+    event DisputeKitEnabled(uint96 indexed _courtID, uint256 indexed _disputeKitID, bool indexed _enable);
+    event CourtJump(
+        uint256 indexed _disputeID,
+        uint256 indexed _roundID,
+        uint96 indexed _fromCourtID,
+        uint96 _toCourtID
+    );
+    event DisputeKitJump(
+        uint256 indexed _disputeID,
+        uint256 indexed _roundID,
+        uint256 indexed _fromDisputeKitID,
+        uint256 _toDisputeKitID
+    );
+    event TokenAndETHShift(
+        address indexed _account,
+        uint256 indexed _disputeID,
+        uint256 indexed _roundID,
+        uint256 _degreeOfCoherency,
+        int256 _pnkAmount,
+        int256 _feeAmount,
+        IERC20 _feeToken
+    );
+    event LeftoverRewardSent(
+        uint256 indexed _disputeID,
+        uint256 indexed _roundID,
+        uint256 _pnkAmount,
+        uint256 _feeAmount,
+        IERC20 _feeToken
+    );
+    event Paused();
+    event Unpaused();
+
+    // ************************************* //
+    // *        Function Modifiers         * //
+    // ************************************* //
+
+    modifier onlyByOwner() {
+        if (owner != msg.sender) revert OwnerOnly();
+        _;
+    }
+
+    modifier onlyByGuardianOrOwner() {
+        if (guardian != msg.sender && owner != msg.sender) revert GuardianOrOwnerOnly();
+        _;
+    }
+
+    modifier whenPaused() {
+        if (!paused) revert WhenPausedOnly();
+        _;
+    }
+
+    modifier whenNotPaused() {
+        if (paused) revert WhenNotPausedOnly();
+        _;
+    }
+
     // ************************************* //
     // *            Constructor            * //
     // ************************************* //
@@ -31,6 +215,7 @@ contract KlerosCore is KlerosCoreBase {
     /// @param _sortitionExtraData The extra data for sortition module.
     /// @param _sortitionModuleAddress The sortition module responsible for sortition of the jurors.
     /// @param _wNative The wrapped native token address, typically wETH.
+    /// @param _jurorNft NFT contract to vet the jurors.
     function initialize(
         address _owner,
         address _guardian,
@@ -42,21 +227,57 @@ contract KlerosCore is KlerosCoreBase {
         uint256[4] memory _timesPerPeriod,
         bytes memory _sortitionExtraData,
         ISortitionModule _sortitionModuleAddress,
-        address _wNative
+        address _wNative,
+        IERC721 _jurorNft
     ) external initializer {
-        __KlerosCoreBase_initialize(
-            _owner,
-            _guardian,
-            _pinakion,
-            _jurorProsecutionModule,
-            _disputeKit,
+        owner = _owner;
+        guardian = _guardian;
+        pinakion = _pinakion;
+        jurorProsecutionModule = _jurorProsecutionModule;
+        sortitionModule = _sortitionModuleAddress;
+        wNative = _wNative;
+        jurorNft = _jurorNft;
+
+        // NULL_DISPUTE_KIT: an empty element at index 0 to indicate when a dispute kit is not supported.
+        disputeKits.push();
+
+        // DISPUTE_KIT_CLASSIC
+        disputeKits.push(_disputeKit);
+
+        emit DisputeKitCreated(DISPUTE_KIT_CLASSIC, _disputeKit);
+
+        // FORKING_COURT
+        // TODO: Fill the properties for the Forking court, emit CourtCreated.
+        courts.push();
+        sortitionModule.createTree(FORKING_COURT, _sortitionExtraData);
+
+        // GENERAL_COURT
+        Court storage court = courts.push();
+        court.parent = FORKING_COURT;
+        court.children = new uint256[](0);
+        court.hiddenVotes = _hiddenVotes;
+        court.minStake = _courtParameters[0];
+        court.alpha = _courtParameters[1];
+        court.feeForJuror = _courtParameters[2];
+        court.jurorsForCourtJump = _courtParameters[3];
+        court.timesPerPeriod = _timesPerPeriod;
+
+        sortitionModule.createTree(GENERAL_COURT, _sortitionExtraData);
+
+        uint256[] memory supportedDisputeKits = new uint256[](1);
+        supportedDisputeKits[0] = DISPUTE_KIT_CLASSIC;
+        emit CourtCreated(
+            GENERAL_COURT,
+            court.parent,
             _hiddenVotes,
-            _courtParameters,
+            _courtParameters[0],
+            _courtParameters[1],
+            _courtParameters[2],
+            _courtParameters[3],
             _timesPerPeriod,
-            _sortitionExtraData,
-            _sortitionModuleAddress,
-            _wNative
+            supportedDisputeKits
         );
+        _enableDisputeKit(GENERAL_COURT, DISPUTE_KIT_CLASSIC, true);
     }
 
     // ************************************* //
@@ -68,4 +289,1039 @@ contract KlerosCore is KlerosCoreBase {
     function _authorizeUpgrade(address) internal view override onlyByOwner {
         // NOP
     }
+
+    /// @dev Pause staking and reward execution. Can only be done by guardian or owner.
+    function pause() external onlyByGuardianOrOwner whenNotPaused {
+        paused = true;
+        emit Paused();
+    }
+
+    /// @dev Unpause staking and reward execution. Can only be done by owner.
+    function unpause() external onlyByOwner whenPaused {
+        paused = false;
+        emit Unpaused();
+    }
+
+    /// @dev Allows the owner to call anything on behalf of the contract.
+    /// @param _destination The destination of the call.
+    /// @param _amount The value sent with the call.
+    /// @param _data The data sent with the call.
+    function executeOwnerProposal(address _destination, uint256 _amount, bytes memory _data) external onlyByOwner {
+        (bool success, ) = _destination.call{value: _amount}(_data);
+        if (!success) revert UnsuccessfulCall();
+    }
+
+    /// @dev Changes the `owner` storage variable.
+    /// @param _owner The new value for the `owner` storage variable.
+    function changeOwner(address payable _owner) external onlyByOwner {
+        owner = _owner;
+    }
+
+    /// @dev Changes the `guardian` storage variable.
+    /// @param _guardian The new value for the `guardian` storage variable.
+    function changeGuardian(address _guardian) external onlyByOwner {
+        guardian = _guardian;
+    }
+
+    /// @dev Changes the `pinakion` storage variable.
+    /// @param _pinakion The new value for the `pinakion` storage variable.
+    function changePinakion(IERC20 _pinakion) external onlyByOwner {
+        pinakion = _pinakion;
+    }
+
+    /// @dev Changes the `jurorProsecutionModule` storage variable.
+    /// @param _jurorProsecutionModule The new value for the `jurorProsecutionModule` storage variable.
+    function changeJurorProsecutionModule(address _jurorProsecutionModule) external onlyByOwner {
+        jurorProsecutionModule = _jurorProsecutionModule;
+    }
+
+    /// @dev Changes the `_sortitionModule` storage variable.
+    /// Note that the new module should be initialized for all courts.
+    /// @param _sortitionModule The new value for the `sortitionModule` storage variable.
+    function changeSortitionModule(ISortitionModule _sortitionModule) external onlyByOwner {
+        sortitionModule = _sortitionModule;
+    }
+
+    /// @dev Add a new supported dispute kit module to the court.
+    /// @param _disputeKitAddress The address of the dispute kit contract.
+    function addNewDisputeKit(IDisputeKit _disputeKitAddress) external onlyByOwner {
+        uint256 disputeKitID = disputeKits.length;
+        disputeKits.push(_disputeKitAddress);
+        emit DisputeKitCreated(disputeKitID, _disputeKitAddress);
+    }
+
+    /// @dev Creates a court under a specified parent court.
+    /// @param _parent The `parent` property value of the court.
+    /// @param _hiddenVotes The `hiddenVotes` property value of the court.
+    /// @param _minStake The `minStake` property value of the court.
+    /// @param _alpha The `alpha` property value of the court.
+    /// @param _feeForJuror The `feeForJuror` property value of the court.
+    /// @param _jurorsForCourtJump The `jurorsForCourtJump` property value of the court.
+    /// @param _timesPerPeriod The `timesPerPeriod` property value of the court.
+    /// @param _sortitionExtraData Extra data for sortition module.
+    /// @param _supportedDisputeKits Indexes of dispute kits that this court will support.
+    function createCourt(
+        uint96 _parent,
+        bool _hiddenVotes,
+        uint256 _minStake,
+        uint256 _alpha,
+        uint256 _feeForJuror,
+        uint256 _jurorsForCourtJump,
+        uint256[4] memory _timesPerPeriod,
+        bytes memory _sortitionExtraData,
+        uint256[] memory _supportedDisputeKits
+    ) external onlyByOwner {
+        if (courts[_parent].minStake > _minStake) revert MinStakeLowerThanParentCourt();
+        if (_supportedDisputeKits.length == 0) revert UnsupportedDisputeKit();
+        if (_parent == FORKING_COURT) revert InvalidForkingCourtAsParent();
+
+        uint96 courtID = uint96(courts.length);
+        Court storage court = courts.push();
+
+        for (uint256 i = 0; i < _supportedDisputeKits.length; i++) {
+            if (_supportedDisputeKits[i] == 0 || _supportedDisputeKits[i] >= disputeKits.length) {
+                revert WrongDisputeKitIndex();
+            }
+            _enableDisputeKit(uint96(courtID), _supportedDisputeKits[i], true);
+        }
+        // Check that Classic DK support was added.
+        if (!court.supportedDisputeKits[DISPUTE_KIT_CLASSIC]) revert MustSupportDisputeKitClassic();
+
+        court.parent = _parent;
+        court.children = new uint256[](0);
+        court.hiddenVotes = _hiddenVotes;
+        court.minStake = _minStake;
+        court.alpha = _alpha;
+        court.feeForJuror = _feeForJuror;
+        court.jurorsForCourtJump = _jurorsForCourtJump;
+        court.timesPerPeriod = _timesPerPeriod;
+
+        sortitionModule.createTree(courtID, _sortitionExtraData);
+
+        // Update the parent.
+        courts[_parent].children.push(courtID);
+        emit CourtCreated(
+            uint96(courtID),
+            _parent,
+            _hiddenVotes,
+            _minStake,
+            _alpha,
+            _feeForJuror,
+            _jurorsForCourtJump,
+            _timesPerPeriod,
+            _supportedDisputeKits
+        );
+    }
+
+    function changeCourtParameters(
+        uint96 _courtID,
+        bool _hiddenVotes,
+        uint256 _minStake,
+        uint256 _alpha,
+        uint256 _feeForJuror,
+        uint256 _jurorsForCourtJump,
+        uint256[4] memory _timesPerPeriod
+    ) external onlyByOwner {
+        Court storage court = courts[_courtID];
+        if (_courtID != GENERAL_COURT && courts[court.parent].minStake > _minStake) {
+            revert MinStakeLowerThanParentCourt();
+        }
+        for (uint256 i = 0; i < court.children.length; i++) {
+            if (courts[court.children[i]].minStake < _minStake) {
+                revert MinStakeLowerThanParentCourt();
+            }
+        }
+        court.minStake = _minStake;
+        court.hiddenVotes = _hiddenVotes;
+        court.alpha = _alpha;
+        court.feeForJuror = _feeForJuror;
+        court.jurorsForCourtJump = _jurorsForCourtJump;
+        court.timesPerPeriod = _timesPerPeriod;
+        emit CourtModified(
+            _courtID,
+            _hiddenVotes,
+            _minStake,
+            _alpha,
+            _feeForJuror,
+            _jurorsForCourtJump,
+            _timesPerPeriod
+        );
+    }
+
+    /// @dev Adds/removes court's support for specified dispute kits.
+    /// @param _courtID The ID of the court.
+    /// @param _disputeKitIDs The IDs of dispute kits which support should be added/removed.
+    /// @param _enable Whether add or remove the dispute kits from the court.
+    function enableDisputeKits(uint96 _courtID, uint256[] memory _disputeKitIDs, bool _enable) external onlyByOwner {
+        for (uint256 i = 0; i < _disputeKitIDs.length; i++) {
+            if (_enable) {
+                if (_disputeKitIDs[i] == 0 || _disputeKitIDs[i] >= disputeKits.length) {
+                    revert WrongDisputeKitIndex();
+                }
+                _enableDisputeKit(_courtID, _disputeKitIDs[i], true);
+            } else {
+                // Classic dispute kit must be supported by all courts.
+                if (_disputeKitIDs[i] == DISPUTE_KIT_CLASSIC) {
+                    revert CannotDisableClassicDK();
+                }
+                _enableDisputeKit(_courtID, _disputeKitIDs[i], false);
+            }
+        }
+    }
+
+    /// @dev Changes the supported fee tokens.
+    /// @param _feeToken The fee token.
+    /// @param _accepted Whether the token is supported or not as a method of fee payment.
+    function changeAcceptedFeeTokens(IERC20 _feeToken, bool _accepted) external onlyByOwner {
+        currencyRates[_feeToken].feePaymentAccepted = _accepted;
+        emit AcceptedFeeToken(_feeToken, _accepted);
+    }
+
+    /// @dev Changes the currency rate of a fee token.
+    /// @param _feeToken The fee token.
+    /// @param _rateInEth The new rate of the fee token in ETH.
+    /// @param _rateDecimals The new decimals of the fee token rate.
+    function changeCurrencyRates(IERC20 _feeToken, uint64 _rateInEth, uint8 _rateDecimals) external onlyByOwner {
+        currencyRates[_feeToken].rateInEth = _rateInEth;
+        currencyRates[_feeToken].rateDecimals = _rateDecimals;
+        emit NewCurrencyRate(_feeToken, _rateInEth, _rateDecimals);
+    }
+
+    /// @dev Adds or removes an arbitrable from whitelist.
+    /// @param _arbitrable Arbitrable address.
+    /// @param _allowed Whether add or remove permission.
+    function changeArbitrableWhitelist(address _arbitrable, bool _allowed) external onlyByOwner {
+        arbitrableWhitelist[_arbitrable] = _allowed;
+    }
+
+    /// @dev Enables or disables the arbitrable whitelist.
+    function changeArbitrableWhitelistEnabled(bool _enabled) external onlyByOwner {
+        arbitrableWhitelistEnabled = _enabled;
+    }
+
+    // ************************************* //
+    // *         State Modifiers           * //
+    // ************************************* //
+
+    /// @dev Sets the caller's stake in a court.
+    /// @param _courtID The ID of the court.
+    /// @param _newStake The new stake.
+    /// Note that the existing delayed stake will be nullified as non-relevant.
+    function setStake(uint96 _courtID, uint256 _newStake) external virtual whenNotPaused {
+        if (address(jurorNft) != address(0) && jurorNft.balanceOf(msg.sender) == 0) revert NotEligibleForStaking();
+        _setStake(msg.sender, _courtID, _newStake, false, OnError.Revert);
+    }
+
+    /// @dev Sets the stake of a specified account in a court without delaying stake changes, typically to apply a delayed stake or unstake inactive jurors.
+    /// @param _account The account whose stake is being set.
+    /// @param _courtID The ID of the court.
+    /// @param _newStake The new stake.
+    function setStakeBySortitionModule(address _account, uint96 _courtID, uint256 _newStake) external {
+        if (msg.sender != address(sortitionModule)) revert SortitionModuleOnly();
+        _setStake(_account, _courtID, _newStake, true, OnError.Return);
+    }
+
+    /// @dev Transfers PNK to the juror by SortitionModule.
+    /// @param _account The account of the juror whose PNK to transfer.
+    /// @param _amount The amount to transfer.
+    function transferBySortitionModule(address _account, uint256 _amount) external {
+        if (msg.sender != address(sortitionModule)) revert SortitionModuleOnly();
+        // Note eligibility is checked in SortitionModule.
+        pinakion.safeTransfer(_account, _amount);
+    }
+
+    /// @inheritdoc IArbitratorV2
+    function createDispute(
+        uint256 _numberOfChoices,
+        bytes memory _extraData
+    ) external payable override returns (uint256 disputeID) {
+        if (msg.value < arbitrationCost(_extraData)) revert ArbitrationFeesNotEnough();
+
+        return _createDispute(_numberOfChoices, _extraData, NATIVE_CURRENCY, msg.value);
+    }
+
+    /// @inheritdoc IArbitratorV2
+    function createDispute(
+        uint256 _numberOfChoices,
+        bytes calldata _extraData,
+        IERC20 _feeToken,
+        uint256 _feeAmount
+    ) external override returns (uint256 disputeID) {
+        if (!currencyRates[_feeToken].feePaymentAccepted) revert TokenNotAccepted();
+        if (_feeAmount < arbitrationCost(_extraData, _feeToken)) revert ArbitrationFeesNotEnough();
+
+        if (!_feeToken.safeTransferFrom(msg.sender, address(this), _feeAmount)) revert TransferFailed();
+        return _createDispute(_numberOfChoices, _extraData, _feeToken, _feeAmount);
+    }
+
+    function _createDispute(
+        uint256 _numberOfChoices,
+        bytes memory _extraData,
+        IERC20 _feeToken,
+        uint256 _feeAmount
+    ) internal virtual returns (uint256 disputeID) {
+        if (arbitrableWhitelistEnabled && !arbitrableWhitelist[msg.sender]) revert ArbitrableNotWhitelisted();
+        (uint96 courtID, , uint256 disputeKitID) = _extraDataToCourtIDMinJurorsDisputeKit(_extraData);
+        if (!courts[courtID].supportedDisputeKits[disputeKitID]) revert DisputeKitNotSupportedByCourt();
+
+        disputeID = disputes.length;
+        Dispute storage dispute = disputes.push();
+        dispute.courtID = courtID;
+        dispute.arbitrated = IArbitrableV2(msg.sender);
+        dispute.lastPeriodChange = block.timestamp;
+
+        IDisputeKit disputeKit = disputeKits[disputeKitID];
+        Court storage court = courts[courtID];
+        Round storage round = dispute.rounds.push();
+
+        // Obtain the feeForJuror in the same currency as the _feeAmount
+        uint256 feeForJuror = (_feeToken == NATIVE_CURRENCY)
+            ? court.feeForJuror
+            : convertEthToTokenAmount(_feeToken, court.feeForJuror);
+        round.nbVotes = _feeAmount / feeForJuror;
+        round.disputeKitID = disputeKitID;
+        round.pnkAtStakePerJuror = _calculatePnkAtStake(court.minStake, court.alpha);
+        round.totalFeesForJurors = _feeAmount;
+        round.feeToken = IERC20(_feeToken);
+
+        sortitionModule.createDisputeHook(disputeID, 0); // Default round ID.
+
+        disputeKit.createDispute(disputeID, _numberOfChoices, _extraData, round.nbVotes);
+        emit DisputeCreation(disputeID, IArbitrableV2(msg.sender));
+    }
+
+    /// @dev Passes the period of a specified dispute.
+    /// @param _disputeID The ID of the dispute.
+    function passPeriod(uint256 _disputeID) external {
+        Dispute storage dispute = disputes[_disputeID];
+        Court storage court = courts[dispute.courtID];
+
+        uint256 currentRound = dispute.rounds.length - 1;
+        Round storage round = dispute.rounds[currentRound];
+        if (dispute.period == Period.evidence) {
+            if (
+                currentRound == 0 &&
+                block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)]
+            ) {
+                revert EvidenceNotPassedAndNotAppeal();
+            }
+            if (round.drawnJurors.length != round.nbVotes) revert DisputeStillDrawing();
+            dispute.period = court.hiddenVotes ? Period.commit : Period.vote;
+        } else if (dispute.period == Period.commit) {
+            // Note that we do not want to pass to Voting period if all the commits are cast because it breaks the Shutter auto-reveal currently.
+            if (block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)]) {
+                revert CommitPeriodNotPassed();
+            }
+            dispute.period = Period.vote;
+        } else if (dispute.period == Period.vote) {
+            if (
+                block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)] &&
+                !disputeKits[round.disputeKitID].areVotesAllCast(_disputeID)
+            ) {
+                revert VotePeriodNotPassed();
+            }
+            dispute.period = Period.appeal;
+            emit AppealPossible(_disputeID, dispute.arbitrated);
+        } else if (dispute.period == Period.appeal) {
+            if (
+                block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)] &&
+                !disputeKits[round.disputeKitID].isAppealFunded(_disputeID)
+            ) {
+                revert AppealPeriodNotPassed();
+            }
+            dispute.period = Period.execution;
+        } else if (dispute.period == Period.execution) {
+            revert DisputePeriodIsFinal();
+        }
+
+        dispute.lastPeriodChange = block.timestamp;
+        emit NewPeriod(_disputeID, dispute.period);
+    }
+
+    /// @dev Draws jurors for the dispute. Can be called in parts.
+    /// @param _disputeID The ID of the dispute.
+    /// @param _iterations The number of iterations to run.
+    /// @return nbDrawnJurors The total number of jurors drawn in the round.
+    function draw(uint256 _disputeID, uint256 _iterations) external returns (uint256 nbDrawnJurors) {
+        Dispute storage dispute = disputes[_disputeID];
+        uint256 currentRound = dispute.rounds.length - 1;
+        Round storage round = dispute.rounds[currentRound];
+        if (dispute.period != Period.evidence) revert NotEvidencePeriod();
+
+        IDisputeKit disputeKit = disputeKits[round.disputeKitID];
+
+        uint256 startIndex = round.drawIterations; // for gas: less storage reads
+        uint256 i;
+        while (i < _iterations && round.drawnJurors.length < round.nbVotes) {
+            (address drawnAddress, uint96 fromSubcourtID) = disputeKit.draw(_disputeID, startIndex + i++);
+            if (drawnAddress == address(0)) {
+                continue;
+            }
+            sortitionModule.lockStake(drawnAddress, round.pnkAtStakePerJuror);
+            emit Draw(drawnAddress, _disputeID, currentRound, round.drawnJurors.length);
+            round.drawnJurors.push(drawnAddress);
+            round.drawnJurorFromCourtIDs.push(fromSubcourtID != 0 ? fromSubcourtID : dispute.courtID);
+            if (round.drawnJurors.length == round.nbVotes) {
+                sortitionModule.postDrawHook(_disputeID, currentRound);
+            }
+        }
+        round.drawIterations += i;
+        return round.drawnJurors.length;
+    }
+
+    /// @dev Appeals the ruling of a specified dispute.
+    /// Note: Access restricted to the Dispute Kit for this `disputeID`.
+    /// @param _disputeID The ID of the dispute.
+    /// @param _numberOfChoices Number of choices for the dispute. Can be required during court jump.
+    /// @param _extraData Extradata for the dispute. Can be required during court jump.
+    function appeal(uint256 _disputeID, uint256 _numberOfChoices, bytes memory _extraData) external payable {
+        if (msg.value < appealCost(_disputeID)) revert AppealFeesNotEnough();
+
+        Dispute storage dispute = disputes[_disputeID];
+        if (dispute.period != Period.appeal) revert DisputeNotAppealable();
+
+        Round storage round = dispute.rounds[dispute.rounds.length - 1];
+        if (msg.sender != address(disputeKits[round.disputeKitID])) revert DisputeKitOnly();
+
+        // Warning: the extra round must be created before calling disputeKit.createDispute()
+        Round storage extraRound = dispute.rounds.push();
+
+        (uint96 newCourtID, uint256 newDisputeKitID, bool courtJump, ) = _getCourtAndDisputeKitJumps(
+            dispute,
+            round,
+            courts[dispute.courtID],
+            _disputeID
+        );
+        if (courtJump) {
+            emit CourtJump(_disputeID, dispute.rounds.length - 1, dispute.courtID, newCourtID);
+        }
+
+        dispute.courtID = newCourtID;
+        dispute.period = Period.evidence;
+        dispute.lastPeriodChange = block.timestamp;
+
+        Court storage court = courts[newCourtID];
+        extraRound.nbVotes = msg.value / court.feeForJuror; // As many votes that can be afforded by the provided funds.
+        extraRound.pnkAtStakePerJuror = _calculatePnkAtStake(court.minStake, court.alpha);
+        extraRound.totalFeesForJurors = msg.value;
+        extraRound.disputeKitID = newDisputeKitID;
+
+        sortitionModule.createDisputeHook(_disputeID, dispute.rounds.length - 1);
+
+        // Dispute kit was changed, so create a dispute in the new DK contract.
+        if (extraRound.disputeKitID != round.disputeKitID) {
+            emit DisputeKitJump(_disputeID, dispute.rounds.length - 1, round.disputeKitID, extraRound.disputeKitID);
+            disputeKits[extraRound.disputeKitID].createDispute(
+                _disputeID,
+                _numberOfChoices,
+                _extraData,
+                extraRound.nbVotes
+            );
+        }
+
+        emit AppealDecision(_disputeID, dispute.arbitrated);
+        emit NewPeriod(_disputeID, Period.evidence);
+    }
+
+    /// @dev Distribute the PNKs at stake and the dispute fees for the specific round of the dispute. Can be called in parts.
+    /// Note: Reward distributions are forbidden during pause.
+    /// @param _disputeID The ID of the dispute.
+    /// @param _round The appeal round.
+    /// @param _iterations The number of iterations to run.
+    function execute(uint256 _disputeID, uint256 _round, uint256 _iterations) external whenNotPaused {
+        Round storage round;
+        {
+            Dispute storage dispute = disputes[_disputeID];
+            if (dispute.period != Period.execution) revert NotExecutionPeriod();
+
+            round = dispute.rounds[_round];
+        } // stack too deep workaround
+
+        uint256 start = round.repartitions;
+        uint256 end = round.repartitions + _iterations;
+
+        uint256 pnkPenaltiesInRound = round.pnkPenalties; // Keep in memory to save gas.
+        uint256 numberOfVotesInRound = round.drawnJurors.length;
+        uint256 feePerJurorInRound = round.totalFeesForJurors / numberOfVotesInRound;
+        uint256 pnkAtStakePerJurorInRound = round.pnkAtStakePerJuror;
+        uint256 coherentCount;
+        {
+            IDisputeKit disputeKit = disputeKits[round.disputeKitID];
+            coherentCount = disputeKit.getCoherentCount(_disputeID, _round); // Total number of jurors that are eligible to a reward in this round.
+        } // stack too deep workaround
+
+        if (coherentCount == 0) {
+            // We loop over the votes once as there are no rewards because it is not a tie and no one in this round is coherent with the final outcome.
+            if (end > numberOfVotesInRound) end = numberOfVotesInRound;
+        } else {
+            // We loop over the votes twice, first to collect the PNK penalties, and second to distribute them as rewards along with arbitration fees.
+            if (end > numberOfVotesInRound * 2) end = numberOfVotesInRound * 2;
+        }
+        round.repartitions = end;
+
+        for (uint256 i = start; i < end; i++) {
+            if (i < numberOfVotesInRound) {
+                pnkPenaltiesInRound = _executePenalties(
+                    ExecuteParams({
+                        disputeID: _disputeID,
+                        round: _round,
+                        coherentCount: coherentCount,
+                        numberOfVotesInRound: numberOfVotesInRound,
+                        feePerJurorInRound: feePerJurorInRound,
+                        pnkAtStakePerJurorInRound: pnkAtStakePerJurorInRound,
+                        pnkPenaltiesInRound: pnkPenaltiesInRound,
+                        repartition: i
+                    })
+                );
+            } else {
+                _executeRewards(
+                    ExecuteParams({
+                        disputeID: _disputeID,
+                        round: _round,
+                        coherentCount: coherentCount,
+                        numberOfVotesInRound: numberOfVotesInRound,
+                        feePerJurorInRound: feePerJurorInRound,
+                        pnkAtStakePerJurorInRound: pnkAtStakePerJurorInRound,
+                        pnkPenaltiesInRound: pnkPenaltiesInRound,
+                        repartition: i
+                    })
+                );
+            }
+        }
+        if (round.pnkPenalties != pnkPenaltiesInRound) {
+            round.pnkPenalties = pnkPenaltiesInRound; // Reentrancy risk: breaks Check-Effect-Interact
+        }
+    }
+
+    /// @dev Distribute the PNKs at stake and the dispute fees for the specific round of the dispute, penalties only.
+    /// @param _params The parameters for the execution, see `ExecuteParams`.
+    /// @return pnkPenaltiesInRoundCache The updated penalties in round cache.
+    function _executePenalties(ExecuteParams memory _params) internal returns (uint256) {
+        Dispute storage dispute = disputes[_params.disputeID];
+        Round storage round = dispute.rounds[_params.round];
+        IDisputeKit disputeKit = disputeKits[round.disputeKitID];
+
+        // [0, 1] value that determines how coherent the juror was in this round, in basis points.
+        uint256 coherence = disputeKit.getDegreeOfCoherencePenalty(
+            _params.disputeID,
+            _params.round,
+            _params.repartition,
+            _params.feePerJurorInRound,
+            _params.pnkAtStakePerJurorInRound
+        );
+
+        // Guard against degree exceeding 1, though it should be ensured by the dispute kit.
+        if (coherence > ONE_BASIS_POINT) {
+            coherence = ONE_BASIS_POINT;
+        }
+
+        // Fully coherent jurors won't be penalized.
+        uint256 penalty = (round.pnkAtStakePerJuror * (ONE_BASIS_POINT - coherence)) / ONE_BASIS_POINT;
+
+        // Unlock the PNKs affected by the penalty
+        address account = round.drawnJurors[_params.repartition];
+        sortitionModule.unlockStake(account, penalty);
+
+        // Apply the penalty to the staked PNKs.
+        uint96 penalizedInCourtID = round.drawnJurorFromCourtIDs[_params.repartition];
+        (uint256 pnkBalance, uint256 newCourtStake, uint256 availablePenalty) = sortitionModule.setStakePenalty(
+            account,
+            penalizedInCourtID,
+            penalty
+        );
+        _params.pnkPenaltiesInRound += availablePenalty;
+        emit TokenAndETHShift(
+            account,
+            _params.disputeID,
+            _params.round,
+            coherence,
+            -int256(availablePenalty),
+            0,
+            round.feeToken
+        );
+
+        if (pnkBalance == 0 || !disputeKit.isVoteActive(_params.disputeID, _params.round, _params.repartition)) {
+            // The juror is inactive or their balance is can't cover penalties anymore, unstake them from all courts.
+            sortitionModule.forcedUnstakeAllCourts(account);
+        } else if (newCourtStake < courts[penalizedInCourtID].minStake) {
+            // The juror's balance fell below the court minStake, unstake them from the court.
+            sortitionModule.forcedUnstake(account, penalizedInCourtID);
+        }
+
+        if (_params.repartition == _params.numberOfVotesInRound - 1 && _params.coherentCount == 0) {
+            // No one was coherent, send the rewards to the owner.
+            _transferFeeToken(round.feeToken, payable(owner), round.totalFeesForJurors);
+            pinakion.safeTransfer(owner, _params.pnkPenaltiesInRound);
+            emit LeftoverRewardSent(
+                _params.disputeID,
+                _params.round,
+                _params.pnkPenaltiesInRound,
+                round.totalFeesForJurors,
+                round.feeToken
+            );
+        }
+        return _params.pnkPenaltiesInRound;
+    }
+
+    /// @dev Distribute the PNKs at stake and the dispute fees for the specific round of the dispute, rewards only.
+    /// @param _params The parameters for the execution, see `ExecuteParams`.
+    function _executeRewards(ExecuteParams memory _params) internal {
+        Dispute storage dispute = disputes[_params.disputeID];
+        Round storage round = dispute.rounds[_params.round];
+        IDisputeKit disputeKit = disputeKits[round.disputeKitID];
+
+        // [0, 1] value that determines how coherent the juror was in this round, in basis points.
+        (uint256 pnkCoherence, uint256 feeCoherence) = disputeKit.getDegreeOfCoherenceReward(
+            _params.disputeID,
+            _params.round,
+            _params.repartition % _params.numberOfVotesInRound,
+            _params.feePerJurorInRound,
+            _params.pnkAtStakePerJurorInRound
+        );
+
+        // Guard against degree exceeding 1, though it should be ensured by the dispute kit.
+        if (pnkCoherence > ONE_BASIS_POINT) {
+            pnkCoherence = ONE_BASIS_POINT;
+        }
+        if (feeCoherence > ONE_BASIS_POINT) {
+            feeCoherence = ONE_BASIS_POINT;
+        }
+
+        address account = round.drawnJurors[_params.repartition % _params.numberOfVotesInRound];
+        uint256 pnkLocked = _applyCoherence(round.pnkAtStakePerJuror, pnkCoherence);
+
+        // Release the rest of the PNKs of the juror for this round.
+        sortitionModule.unlockStake(account, pnkLocked);
+
+        // Compute the rewards
+        uint256 pnkReward = _applyCoherence(_params.pnkPenaltiesInRound / _params.coherentCount, pnkCoherence);
+        round.sumPnkRewardPaid += pnkReward;
+        uint256 feeReward = _applyCoherence(round.totalFeesForJurors / _params.coherentCount, feeCoherence);
+        round.sumFeeRewardPaid += feeReward;
+
+        // Transfer the fee reward
+        _transferFeeToken(round.feeToken, payable(account), feeReward);
+
+        // Stake the PNK reward if possible, by-passes delayed stakes and other checks usually done by validateStake()
+        if (!sortitionModule.setStakeReward(account, dispute.courtID, pnkReward)) {
+            pinakion.safeTransfer(account, pnkReward);
+        }
+
+        emit TokenAndETHShift(
+            account,
+            _params.disputeID,
+            _params.round,
+            pnkCoherence,
+            int256(pnkReward),
+            int256(feeReward),
+            round.feeToken
+        );
+
+        // Transfer any residual rewards to the owner. It may happen due to partial coherence of the jurors.
+        if (_params.repartition == _params.numberOfVotesInRound * 2 - 1) {
+            uint256 leftoverPnkReward = _params.pnkPenaltiesInRound - round.sumPnkRewardPaid;
+            uint256 leftoverFeeReward = round.totalFeesForJurors - round.sumFeeRewardPaid;
+            if (leftoverPnkReward != 0 || leftoverFeeReward != 0) {
+                if (leftoverPnkReward != 0) {
+                    pinakion.safeTransfer(owner, leftoverPnkReward);
+                }
+                if (leftoverFeeReward != 0) {
+                    _transferFeeToken(round.feeToken, payable(owner), leftoverFeeReward);
+                }
+                emit LeftoverRewardSent(
+                    _params.disputeID,
+                    _params.round,
+                    leftoverPnkReward,
+                    leftoverFeeReward,
+                    round.feeToken
+                );
+            }
+        }
+    }
+
+    /// @dev Executes a specified dispute's ruling.
+    /// @param _disputeID The ID of the dispute.
+    function executeRuling(uint256 _disputeID) external {
+        Dispute storage dispute = disputes[_disputeID];
+        if (dispute.period != Period.execution) revert NotExecutionPeriod();
+        if (dispute.ruled) revert RulingAlreadyExecuted();
+
+        (uint256 winningChoice, , ) = currentRuling(_disputeID);
+        dispute.ruled = true;
+        emit Ruling(dispute.arbitrated, _disputeID, winningChoice);
+        dispute.arbitrated.rule(_disputeID, winningChoice);
+    }
+
+    // ************************************* //
+    // *           Public Views            * //
+    // ************************************* //
+
+    /// @dev Compute the cost of arbitration denominated in ETH.
+    ///      It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.
+    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).
+    /// @return cost The arbitration cost in ETH.
+    function arbitrationCost(bytes memory _extraData) public view override returns (uint256 cost) {
+        (uint96 courtID, uint256 minJurors, ) = _extraDataToCourtIDMinJurorsDisputeKit(_extraData);
+        cost = courts[courtID].feeForJuror * minJurors;
+    }
+
+    /// @dev Compute the cost of arbitration denominated in `_feeToken`.
+    ///      It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.
+    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).
+    /// @param _feeToken The ERC20 token used to pay fees.
+    /// @return cost The arbitration cost in `_feeToken`.
+    function arbitrationCost(bytes calldata _extraData, IERC20 _feeToken) public view override returns (uint256 cost) {
+        cost = convertEthToTokenAmount(_feeToken, arbitrationCost(_extraData));
+    }
+
+    /// @dev Gets the cost of appealing a specified dispute.
+    /// @param _disputeID The ID of the dispute.
+    /// @return cost The appeal cost.
+    function appealCost(uint256 _disputeID) public view returns (uint256 cost) {
+        Dispute storage dispute = disputes[_disputeID];
+        Round storage round = dispute.rounds[dispute.rounds.length - 1];
+        Court storage court = courts[dispute.courtID];
+
+        (, uint256 newDisputeKitID, bool courtJump, ) = _getCourtAndDisputeKitJumps(dispute, round, court, _disputeID);
+
+        uint256 nbVotesAfterAppeal = disputeKits[newDisputeKitID].getNbVotesAfterAppeal(
+            disputeKits[round.disputeKitID],
+            round.nbVotes
+        );
+
+        if (courtJump) {
+            // Jump to parent court.
+            if (dispute.courtID == GENERAL_COURT) {
+                // TODO: Handle the forking when appealed in General court.
+                cost = NON_PAYABLE_AMOUNT; // Get the cost of the parent court.
+            } else {
+                cost = courts[court.parent].feeForJuror * nbVotesAfterAppeal;
+            }
+        } else {
+            // Stay in current court.
+            cost = court.feeForJuror * nbVotesAfterAppeal;
+        }
+    }
+
+    /// @dev Gets the start and the end of a specified dispute's current appeal period.
+    /// @param _disputeID The ID of the dispute.
+    /// @return start The start of the appeal period.
+    /// @return end The end of the appeal period.
+    function appealPeriod(uint256 _disputeID) external view returns (uint256 start, uint256 end) {
+        Dispute storage dispute = disputes[_disputeID];
+        if (dispute.period == Period.appeal) {
+            start = dispute.lastPeriodChange;
+            end = dispute.lastPeriodChange + courts[dispute.courtID].timesPerPeriod[uint256(Period.appeal)];
+        } else {
+            start = 0;
+            end = 0;
+        }
+    }
+
+    /// @dev Gets the current ruling of a specified dispute.
+    /// @param _disputeID The ID of the dispute.
+    /// @return ruling The current ruling.
+    /// @return tied Whether it's a tie or not.
+    /// @return overridden Whether the ruling was overridden by appeal funding or not.
+    function currentRuling(uint256 _disputeID) public view returns (uint256 ruling, bool tied, bool overridden) {
+        Dispute storage dispute = disputes[_disputeID];
+        Round storage round = dispute.rounds[dispute.rounds.length - 1];
+        IDisputeKit disputeKit = disputeKits[round.disputeKitID];
+        (ruling, tied, overridden) = disputeKit.currentRuling(_disputeID);
+    }
+
+    /// @dev Gets the round info for a specified dispute and round.
+    /// @dev This function must not be called from a non-view function because it returns a dynamic array which might be very large, theoretically exceeding the block gas limit.
+    /// @param _disputeID The ID of the dispute.
+    /// @param _round The round to get the info for.
+    /// @return round The round info.
+    function getRoundInfo(uint256 _disputeID, uint256 _round) external view returns (Round memory) {
+        return disputes[_disputeID].rounds[_round];
+    }
+
+    /// @dev Gets the PNK at stake per juror for a specified dispute and round.
+    /// @param _disputeID The ID of the dispute.
+    /// @param _round The round to get the info for.
+    /// @return pnkAtStakePerJuror The PNK at stake per juror.
+    function getPnkAtStakePerJuror(uint256 _disputeID, uint256 _round) external view returns (uint256) {
+        return disputes[_disputeID].rounds[_round].pnkAtStakePerJuror;
+    }
+
+    /// @dev Gets the number of rounds for a specified dispute.
+    /// @param _disputeID The ID of the dispute.
+    /// @return The number of rounds.
+    function getNumberOfRounds(uint256 _disputeID) external view returns (uint256) {
+        return disputes[_disputeID].rounds.length;
+    }
+
+    /// @dev Checks if a given dispute kit is supported by a given court.
+    /// @param _courtID The ID of the court to check the support for.
+    /// @param _disputeKitID The ID of the dispute kit to check the support for.
+    /// @return Whether the dispute kit is supported or not.
+    function isSupported(uint96 _courtID, uint256 _disputeKitID) external view returns (bool) {
+        return courts[_courtID].supportedDisputeKits[_disputeKitID];
+    }
+
+    /// @dev Gets the timesPerPeriod array for a given court.
+    /// @param _courtID The ID of the court to get the times from.
+    /// @return timesPerPeriod The timesPerPeriod array for the given court.
+    function getTimesPerPeriod(uint96 _courtID) external view returns (uint256[4] memory timesPerPeriod) {
+        timesPerPeriod = courts[_courtID].timesPerPeriod;
+    }
+
+    // ************************************* //
+    // *   Public Views for Dispute Kits   * //
+    // ************************************* //
+
+    /// @dev Gets the number of votes permitted for the specified dispute in the latest round.
+    /// @param _disputeID The ID of the dispute.
+    function getNumberOfVotes(uint256 _disputeID) external view returns (uint256) {
+        Dispute storage dispute = disputes[_disputeID];
+        return dispute.rounds[dispute.rounds.length - 1].nbVotes;
+    }
+
+    /// @dev Returns true if the dispute kit will be switched to a parent DK.
+    /// @param _disputeID The ID of the dispute.
+    /// @return Whether DK will be switched or not.
+    function isDisputeKitJumping(uint256 _disputeID) external view returns (bool) {
+        Dispute storage dispute = disputes[_disputeID];
+        Round storage round = dispute.rounds[dispute.rounds.length - 1];
+        Court storage court = courts[dispute.courtID];
+
+        if (!_isCourtJumping(round, court, _disputeID)) {
+            return false;
+        }
+
+        // Jump if the parent court doesn't support the current DK.
+        return !courts[court.parent].supportedDisputeKits[round.disputeKitID];
+    }
+
+    function getDisputeKitsLength() external view returns (uint256) {
+        return disputeKits.length;
+    }
+
+    function convertEthToTokenAmount(IERC20 _toToken, uint256 _amountInEth) public view returns (uint256) {
+        return (_amountInEth * 10 ** currencyRates[_toToken].rateDecimals) / currencyRates[_toToken].rateInEth;
+    }
+
+    // ************************************* //
+    // *            Internal               * //
+    // ************************************* //
+
+    /// @dev Returns true if the round is jumping to a parent court.
+    /// @param _round The round to check.
+    /// @param _court The court to check.
+    /// @return Whether the round is jumping to a parent court or not.
+    function _isCourtJumping(
+        Round storage _round,
+        Court storage _court,
+        uint256 _disputeID
+    ) internal view returns (bool) {
+        return
+            disputeKits[_round.disputeKitID].earlyCourtJump(_disputeID) || _round.nbVotes >= _court.jurorsForCourtJump;
+    }
+
+    function _getCourtAndDisputeKitJumps(
+        Dispute storage _dispute,
+        Round storage _round,
+        Court storage _court,
+        uint256 _disputeID
+    ) internal view returns (uint96 newCourtID, uint256 newDisputeKitID, bool courtJump, bool disputeKitJump) {
+        newCourtID = _dispute.courtID;
+        newDisputeKitID = _round.disputeKitID;
+
+        if (!_isCourtJumping(_round, _court, _disputeID)) return (newCourtID, newDisputeKitID, false, false);
+
+        // Jump to parent court.
+        newCourtID = courts[newCourtID].parent;
+        courtJump = true;
+
+        if (!courts[newCourtID].supportedDisputeKits[newDisputeKitID]) {
+            // The current Dispute Kit is not compatible with the new court, jump to another Dispute Kit.
+            newDisputeKitID = disputeKits[_round.disputeKitID].getJumpDisputeKitID();
+            if (newDisputeKitID == NULL_DISPUTE_KIT || !courts[newCourtID].supportedDisputeKits[newDisputeKitID]) {
+                // The new Dispute Kit is not defined or still not compatible, fall back to `DisputeKitClassic` which is always supported.
+                newDisputeKitID = DISPUTE_KIT_CLASSIC;
+            }
+            disputeKitJump = true;
+        }
+    }
+
+    /// @dev Internal function to transfer fee tokens (ETH or ERC20)
+    /// @param _feeToken The token to transfer (NATIVE_CURRENCY for ETH).
+    /// @param _recipient The recipient address.
+    /// @param _amount The amount to transfer.
+    function _transferFeeToken(IERC20 _feeToken, address payable _recipient, uint256 _amount) internal {
+        if (_feeToken == NATIVE_CURRENCY) {
+            _recipient.safeSend(_amount, wNative);
+        } else {
+            _feeToken.safeTransfer(_recipient, _amount);
+        }
+    }
+
+    /// @dev Applies degree of coherence to an amount
+    /// @param _amount The base amount to apply coherence to.
+    /// @param _coherence The degree of coherence in basis points.
+    /// @return The amount after applying the degree of coherence.
+    function _applyCoherence(uint256 _amount, uint256 _coherence) internal pure returns (uint256) {
+        return (_amount * _coherence) / ONE_BASIS_POINT;
+    }
+
+    /// @dev Calculates PNK at stake per juror based on court parameters
+    /// @param _minStake The minimum stake for the court.
+    /// @param _alpha The alpha parameter for the court in basis points.
+    /// @return The amount of PNK at stake per juror.
+    function _calculatePnkAtStake(uint256 _minStake, uint256 _alpha) internal pure returns (uint256) {
+        return (_minStake * _alpha) / ONE_BASIS_POINT;
+    }
+
+    /// @dev Toggles the dispute kit support for a given court.
+    /// @param _courtID The ID of the court to toggle the support for.
+    /// @param _disputeKitID The ID of the dispute kit to toggle the support for.
+    /// @param _enable Whether to enable or disable the support. Note that classic dispute kit should always be enabled.
+    function _enableDisputeKit(uint96 _courtID, uint256 _disputeKitID, bool _enable) internal {
+        courts[_courtID].supportedDisputeKits[_disputeKitID] = _enable;
+        emit DisputeKitEnabled(_courtID, _disputeKitID, _enable);
+    }
+
+    /// @dev If called only once then set _onError to Revert, otherwise set it to Return
+    /// @param _account The account to set the stake for.
+    /// @param _courtID The ID of the court to set the stake for.
+    /// @param _newStake The new stake.
+    /// @param _noDelay True if the stake change should not be delayed.
+    /// @param _onError Whether to revert or return false on error.
+    /// @return Whether the stake was successfully set or not.
+    function _setStake(
+        address _account,
+        uint96 _courtID,
+        uint256 _newStake,
+        bool _noDelay,
+        OnError _onError
+    ) internal returns (bool) {
+        if (_courtID == FORKING_COURT || _courtID >= courts.length) {
+            _stakingFailed(_onError, StakingResult.CannotStakeInThisCourt); // Staking directly into the forking court is not allowed.
+            return false;
+        }
+        if (_newStake != 0 && _newStake < courts[_courtID].minStake) {
+            _stakingFailed(_onError, StakingResult.CannotStakeLessThanMinStake); // Staking less than the minimum stake is not allowed.
+            return false;
+        }
+        (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult) = sortitionModule.validateStake(
+            _account,
+            _courtID,
+            _newStake,
+            _noDelay
+        );
+        if (stakingResult != StakingResult.Successful && stakingResult != StakingResult.Delayed) {
+            _stakingFailed(_onError, stakingResult);
+            return false;
+        } else if (stakingResult == StakingResult.Delayed) {
+            return true;
+        }
+        if (pnkDeposit > 0) {
+            if (!pinakion.safeTransferFrom(_account, address(this), pnkDeposit)) {
+                _stakingFailed(_onError, StakingResult.StakingTransferFailed);
+                return false;
+            }
+        }
+        if (pnkWithdrawal > 0) {
+            if (!pinakion.safeTransfer(_account, pnkWithdrawal)) {
+                _stakingFailed(_onError, StakingResult.UnstakingTransferFailed);
+                return false;
+            }
+        }
+        sortitionModule.setStake(_account, _courtID, pnkDeposit, pnkWithdrawal, _newStake);
+
+        return true;
+    }
+
+    /// @dev It may revert depending on the _onError parameter.
+    function _stakingFailed(OnError _onError, StakingResult _result) internal pure virtual {
+        if (_onError == OnError.Return) return;
+        if (_result == StakingResult.StakingTransferFailed) revert StakingTransferFailed();
+        if (_result == StakingResult.UnstakingTransferFailed) revert UnstakingTransferFailed();
+        if (_result == StakingResult.CannotStakeInMoreCourts) revert StakingInTooManyCourts();
+        if (_result == StakingResult.CannotStakeInThisCourt) revert StakingNotPossibleInThisCourt();
+        if (_result == StakingResult.CannotStakeLessThanMinStake) revert StakingLessThanCourtMinStake();
+        if (_result == StakingResult.CannotStakeZeroWhenNoStake) revert StakingZeroWhenNoStake();
+        if (_result == StakingResult.CannotStakeMoreThanMaxStakePerJuror) revert StakingMoreThanMaxStakePerJuror();
+        if (_result == StakingResult.CannotStakeMoreThanMaxTotalStaked) revert StakingMoreThanMaxTotalStaked();
+    }
+
+    /// @dev Gets a court ID, the minimum number of jurors and an ID of a dispute kit from a specified extra data bytes array.
+    /// Note that if extradata contains an incorrect value then this value will be switched to default.
+    /// @param _extraData The extra data bytes array. The first 32 bytes are the court ID, the next are the minimum number of jurors and the last are the dispute kit ID.
+    /// @return courtID The court ID.
+    /// @return minJurors The minimum number of jurors required.
+    /// @return disputeKitID The ID of the dispute kit.
+    function _extraDataToCourtIDMinJurorsDisputeKit(
+        bytes memory _extraData
+    ) internal view returns (uint96 courtID, uint256 minJurors, uint256 disputeKitID) {
+        // Note that if the extradata doesn't contain 32 bytes for the dispute kit ID it'll return the default 0 index.
+        if (_extraData.length >= 64) {
+            assembly {
+                // solium-disable-line security/no-inline-assembly
+                courtID := mload(add(_extraData, 0x20))
+                minJurors := mload(add(_extraData, 0x40))
+                disputeKitID := mload(add(_extraData, 0x60))
+            }
+            if (courtID == FORKING_COURT || courtID >= courts.length) {
+                courtID = GENERAL_COURT;
+            }
+            if (minJurors == 0) {
+                minJurors = DEFAULT_NB_OF_JURORS;
+            }
+            if (disputeKitID == NULL_DISPUTE_KIT || disputeKitID >= disputeKits.length) {
+                disputeKitID = DISPUTE_KIT_CLASSIC; // 0 index is not used.
+            }
+        } else {
+            courtID = GENERAL_COURT;
+            minJurors = DEFAULT_NB_OF_JURORS;
+            disputeKitID = DISPUTE_KIT_CLASSIC;
+        }
+    }
+
+    // ************************************* //
+    // *              Errors               * //
+    // ************************************* //
+
+    error OwnerOnly();
+    error GuardianOrOwnerOnly();
+    error DisputeKitOnly();
+    error SortitionModuleOnly();
+    error UnsuccessfulCall();
+    error InvalidDisputKitParent();
+    error MinStakeLowerThanParentCourt();
+    error UnsupportedDisputeKit();
+    error InvalidForkingCourtAsParent();
+    error WrongDisputeKitIndex();
+    error CannotDisableClassicDK();
+    error NotEligibleForStaking();
+    error StakingMoreThanMaxStakePerJuror();
+    error StakingMoreThanMaxTotalStaked();
+    error StakingInTooManyCourts();
+    error StakingNotPossibleInThisCourt();
+    error StakingLessThanCourtMinStake();
+    error StakingTransferFailed();
+    error UnstakingTransferFailed();
+    error ArbitrableNotWhitelisted();
+    error ArbitrationFeesNotEnough();
+    error DisputeKitNotSupportedByCourt();
+    error MustSupportDisputeKitClassic();
+    error TokenNotAccepted();
+    error EvidenceNotPassedAndNotAppeal();
+    error DisputeStillDrawing();
+    error CommitPeriodNotPassed();
+    error VotePeriodNotPassed();
+    error AppealPeriodNotPassed();
+    error NotEvidencePeriod();
+    error AppealFeesNotEnough();
+    error DisputeNotAppealable();
+    error NotExecutionPeriod();
+    error RulingAlreadyExecuted();
+    error DisputePeriodIsFinal();
+    error TransferFailed();
+    error WhenNotPausedOnly();
+    error WhenPausedOnly();
+    error StakingZeroWhenNoStake();
 }
diff --git a/contracts/src/arbitration/KlerosCoreBase.sol b/contracts/src/arbitration/KlerosCoreBase.sol
deleted file mode 100644
index fc8095715..000000000
--- a/contracts/src/arbitration/KlerosCoreBase.sol
+++ /dev/null
@@ -1,1275 +0,0 @@
-// SPDX-License-Identifier: MIT
-
-pragma solidity ^0.8.24;
-
-import {IArbitrableV2, IArbitratorV2} from "./interfaces/IArbitratorV2.sol";
-import {IDisputeKit} from "./interfaces/IDisputeKit.sol";
-import {ISortitionModule} from "./interfaces/ISortitionModule.sol";
-import {Initializable} from "../proxy/Initializable.sol";
-import {UUPSProxiable} from "../proxy/UUPSProxiable.sol";
-import {SafeERC20, IERC20} from "../libraries/SafeERC20.sol";
-import {SafeSend} from "../libraries/SafeSend.sol";
-import "../libraries/Constants.sol";
-
-/// @title KlerosCoreBase
-/// Core arbitrator contract for Kleros v2.
-/// Note that this contract trusts the PNK token, the dispute kit and the sortition module contracts.
-abstract contract KlerosCoreBase is IArbitratorV2, Initializable, UUPSProxiable {
-    using SafeERC20 for IERC20;
-    using SafeSend for address payable;
-
-    // ************************************* //
-    // *         Enums / Structs           * //
-    // ************************************* //
-
-    enum Period {
-        evidence, // Evidence can be submitted. This is also when drawing has to take place.
-        commit, // Jurors commit a hashed vote. This is skipped for courts without hidden votes.
-        vote, // Jurors reveal/cast their vote depending on whether the court has hidden votes or not.
-        appeal, // The dispute can be appealed.
-        execution // Tokens are redistributed and the ruling is executed.
-    }
-
-    struct Court {
-        uint96 parent; // The parent court.
-        bool hiddenVotes; // Whether to use commit and reveal or not.
-        uint256[] children; // List of child courts.
-        uint256 minStake; // Minimum PNKs needed to stake in the court.
-        uint256 alpha; // Basis point of PNKs that are lost when incoherent.
-        uint256 feeForJuror; // Arbitration fee paid per juror.
-        uint256 jurorsForCourtJump; // The appeal after the one that reaches this number of jurors will go to the parent court if any.
-        uint256[4] timesPerPeriod; // The time allotted to each dispute period in the form `timesPerPeriod[period]`.
-        mapping(uint256 disputeKitId => bool) supportedDisputeKits; // True if DK with this ID is supported by the court. Note that each court must support classic dispute kit.
-        bool disabled; // True if the court is disabled. Unused for now, will be implemented later.
-    }
-
-    struct Dispute {
-        uint96 courtID; // The ID of the court the dispute is in.
-        IArbitrableV2 arbitrated; // The arbitrable contract.
-        Period period; // The current period of the dispute.
-        bool ruled; // True if the ruling has been executed, false otherwise.
-        uint256 lastPeriodChange; // The last time the period was changed.
-        Round[] rounds;
-    }
-
-    struct Round {
-        uint256 disputeKitID; // Index of the dispute kit in the array.
-        uint256 pnkAtStakePerJuror; // The amount of PNKs at stake for each juror in this round.
-        uint256 totalFeesForJurors; // The total juror fees paid in this round.
-        uint256 nbVotes; // The total number of votes the dispute can possibly have in the current round. Former votes[_round].length.
-        uint256 repartitions; // A counter of reward repartitions made in this round.
-        uint256 pnkPenalties; // The amount of PNKs collected from penalties in this round.
-        address[] drawnJurors; // Addresses of the jurors that were drawn in this round.
-        uint96[] drawnJurorFromCourtIDs; // The courtIDs where the juror was drawn from, possibly their stake in a subcourt.
-        uint256 sumFeeRewardPaid; // Total sum of arbitration fees paid to coherent jurors as a reward in this round.
-        uint256 sumPnkRewardPaid; // Total sum of PNK paid to coherent jurors as a reward in this round.
-        IERC20 feeToken; // The token used for paying fees in this round.
-        uint256 drawIterations; // The number of iterations passed drawing the jurors for this round.
-    }
-
-    // Workaround "stack too deep" errors
-    struct ExecuteParams {
-        uint256 disputeID; // The ID of the dispute to execute.
-        uint256 round; // The round to execute.
-        uint256 coherentCount; // The number of coherent votes in the round.
-        uint256 numberOfVotesInRound; // The number of votes in the round.
-        uint256 feePerJurorInRound; // The fee per juror in the round.
-        uint256 pnkAtStakePerJurorInRound; // The amount of PNKs at stake for each juror in the round.
-        uint256 pnkPenaltiesInRound; // The amount of PNKs collected from penalties in the round.
-        uint256 repartition; // The index of the repartition to execute.
-    }
-
-    struct CurrencyRate {
-        bool feePaymentAccepted;
-        uint64 rateInEth;
-        uint8 rateDecimals;
-    }
-
-    // ************************************* //
-    // *             Storage               * //
-    // ************************************* //
-
-    uint256 private constant NON_PAYABLE_AMOUNT = (2 ** 256 - 2) / 2; // An amount higher than the supply of ETH.
-
-    address public owner; // The owner of the contract.
-    address public guardian; // The guardian able to pause asset withdrawals.
-    IERC20 public pinakion; // The Pinakion token contract.
-    address public jurorProsecutionModule; // The module for juror's prosecution.
-    ISortitionModule public sortitionModule; // Sortition module for drawing.
-    Court[] public courts; // The courts.
-    IDisputeKit[] public disputeKits; // Array of dispute kits.
-    Dispute[] public disputes; // The disputes.
-    mapping(IERC20 => CurrencyRate) public currencyRates; // The price of each token in ETH.
-    bool public paused; // Whether asset withdrawals are paused.
-    address public wNative; // The wrapped native token for safeSend().
-
-    // ************************************* //
-    // *              Events               * //
-    // ************************************* //
-
-    event NewPeriod(uint256 indexed _disputeID, Period _period);
-    event AppealPossible(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);
-    event AppealDecision(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);
-    event Draw(address indexed _address, uint256 indexed _disputeID, uint256 _roundID, uint256 _voteID);
-    event CourtCreated(
-        uint96 indexed _courtID,
-        uint96 indexed _parent,
-        bool _hiddenVotes,
-        uint256 _minStake,
-        uint256 _alpha,
-        uint256 _feeForJuror,
-        uint256 _jurorsForCourtJump,
-        uint256[4] _timesPerPeriod,
-        uint256[] _supportedDisputeKits
-    );
-    event CourtModified(
-        uint96 indexed _courtID,
-        bool _hiddenVotes,
-        uint256 _minStake,
-        uint256 _alpha,
-        uint256 _feeForJuror,
-        uint256 _jurorsForCourtJump,
-        uint256[4] _timesPerPeriod
-    );
-    event DisputeKitCreated(uint256 indexed _disputeKitID, IDisputeKit indexed _disputeKitAddress);
-    event DisputeKitEnabled(uint96 indexed _courtID, uint256 indexed _disputeKitID, bool indexed _enable);
-    event CourtJump(
-        uint256 indexed _disputeID,
-        uint256 indexed _roundID,
-        uint96 indexed _fromCourtID,
-        uint96 _toCourtID
-    );
-    event DisputeKitJump(
-        uint256 indexed _disputeID,
-        uint256 indexed _roundID,
-        uint256 indexed _fromDisputeKitID,
-        uint256 _toDisputeKitID
-    );
-    event TokenAndETHShift(
-        address indexed _account,
-        uint256 indexed _disputeID,
-        uint256 indexed _roundID,
-        uint256 _degreeOfCoherency,
-        int256 _pnkAmount,
-        int256 _feeAmount,
-        IERC20 _feeToken
-    );
-    event LeftoverRewardSent(
-        uint256 indexed _disputeID,
-        uint256 indexed _roundID,
-        uint256 _pnkAmount,
-        uint256 _feeAmount,
-        IERC20 _feeToken
-    );
-    event Paused();
-    event Unpaused();
-
-    // ************************************* //
-    // *        Function Modifiers         * //
-    // ************************************* //
-
-    modifier onlyByOwner() {
-        if (owner != msg.sender) revert OwnerOnly();
-        _;
-    }
-
-    modifier onlyByGuardianOrOwner() {
-        if (guardian != msg.sender && owner != msg.sender) revert GuardianOrOwnerOnly();
-        _;
-    }
-
-    modifier whenPaused() {
-        if (!paused) revert WhenPausedOnly();
-        _;
-    }
-
-    modifier whenNotPaused() {
-        if (paused) revert WhenNotPausedOnly();
-        _;
-    }
-
-    // ************************************* //
-    // *            Constructor            * //
-    // ************************************* //
-
-    function __KlerosCoreBase_initialize(
-        address _owner,
-        address _guardian,
-        IERC20 _pinakion,
-        address _jurorProsecutionModule,
-        IDisputeKit _disputeKit,
-        bool _hiddenVotes,
-        uint256[4] memory _courtParameters,
-        uint256[4] memory _timesPerPeriod,
-        bytes memory _sortitionExtraData,
-        ISortitionModule _sortitionModuleAddress,
-        address _wNative
-    ) internal onlyInitializing {
-        owner = _owner;
-        guardian = _guardian;
-        pinakion = _pinakion;
-        jurorProsecutionModule = _jurorProsecutionModule;
-        sortitionModule = _sortitionModuleAddress;
-        wNative = _wNative;
-
-        // NULL_DISPUTE_KIT: an empty element at index 0 to indicate when a dispute kit is not supported.
-        disputeKits.push();
-
-        // DISPUTE_KIT_CLASSIC
-        disputeKits.push(_disputeKit);
-
-        emit DisputeKitCreated(DISPUTE_KIT_CLASSIC, _disputeKit);
-
-        // FORKING_COURT
-        // TODO: Fill the properties for the Forking court, emit CourtCreated.
-        courts.push();
-        sortitionModule.createTree(FORKING_COURT, _sortitionExtraData);
-
-        // GENERAL_COURT
-        Court storage court = courts.push();
-        court.parent = FORKING_COURT;
-        court.children = new uint256[](0);
-        court.hiddenVotes = _hiddenVotes;
-        court.minStake = _courtParameters[0];
-        court.alpha = _courtParameters[1];
-        court.feeForJuror = _courtParameters[2];
-        court.jurorsForCourtJump = _courtParameters[3];
-        court.timesPerPeriod = _timesPerPeriod;
-
-        sortitionModule.createTree(GENERAL_COURT, _sortitionExtraData);
-
-        uint256[] memory supportedDisputeKits = new uint256[](1);
-        supportedDisputeKits[0] = DISPUTE_KIT_CLASSIC;
-        emit CourtCreated(
-            GENERAL_COURT,
-            court.parent,
-            _hiddenVotes,
-            _courtParameters[0],
-            _courtParameters[1],
-            _courtParameters[2],
-            _courtParameters[3],
-            _timesPerPeriod,
-            supportedDisputeKits
-        );
-        _enableDisputeKit(GENERAL_COURT, DISPUTE_KIT_CLASSIC, true);
-    }
-
-    // ************************************* //
-    // *             Governance            * //
-    // ************************************* //
-
-    /// @dev Pause staking and reward execution. Can only be done by guardian or owner.
-    function pause() external onlyByGuardianOrOwner whenNotPaused {
-        paused = true;
-        emit Paused();
-    }
-
-    /// @dev Unpause staking and reward execution. Can only be done by owner.
-    function unpause() external onlyByOwner whenPaused {
-        paused = false;
-        emit Unpaused();
-    }
-
-    /// @dev Allows the owner to call anything on behalf of the contract.
-    /// @param _destination The destination of the call.
-    /// @param _amount The value sent with the call.
-    /// @param _data The data sent with the call.
-    function executeOwnerProposal(address _destination, uint256 _amount, bytes memory _data) external onlyByOwner {
-        (bool success, ) = _destination.call{value: _amount}(_data);
-        if (!success) revert UnsuccessfulCall();
-    }
-
-    /// @dev Changes the `owner` storage variable.
-    /// @param _owner The new value for the `owner` storage variable.
-    function changeOwner(address payable _owner) external onlyByOwner {
-        owner = _owner;
-    }
-
-    /// @dev Changes the `guardian` storage variable.
-    /// @param _guardian The new value for the `guardian` storage variable.
-    function changeGuardian(address _guardian) external onlyByOwner {
-        guardian = _guardian;
-    }
-
-    /// @dev Changes the `pinakion` storage variable.
-    /// @param _pinakion The new value for the `pinakion` storage variable.
-    function changePinakion(IERC20 _pinakion) external onlyByOwner {
-        pinakion = _pinakion;
-    }
-
-    /// @dev Changes the `jurorProsecutionModule` storage variable.
-    /// @param _jurorProsecutionModule The new value for the `jurorProsecutionModule` storage variable.
-    function changeJurorProsecutionModule(address _jurorProsecutionModule) external onlyByOwner {
-        jurorProsecutionModule = _jurorProsecutionModule;
-    }
-
-    /// @dev Changes the `_sortitionModule` storage variable.
-    /// Note that the new module should be initialized for all courts.
-    /// @param _sortitionModule The new value for the `sortitionModule` storage variable.
-    function changeSortitionModule(ISortitionModule _sortitionModule) external onlyByOwner {
-        sortitionModule = _sortitionModule;
-    }
-
-    /// @dev Add a new supported dispute kit module to the court.
-    /// @param _disputeKitAddress The address of the dispute kit contract.
-    function addNewDisputeKit(IDisputeKit _disputeKitAddress) external onlyByOwner {
-        uint256 disputeKitID = disputeKits.length;
-        disputeKits.push(_disputeKitAddress);
-        emit DisputeKitCreated(disputeKitID, _disputeKitAddress);
-    }
-
-    /// @dev Creates a court under a specified parent court.
-    /// @param _parent The `parent` property value of the court.
-    /// @param _hiddenVotes The `hiddenVotes` property value of the court.
-    /// @param _minStake The `minStake` property value of the court.
-    /// @param _alpha The `alpha` property value of the court.
-    /// @param _feeForJuror The `feeForJuror` property value of the court.
-    /// @param _jurorsForCourtJump The `jurorsForCourtJump` property value of the court.
-    /// @param _timesPerPeriod The `timesPerPeriod` property value of the court.
-    /// @param _sortitionExtraData Extra data for sortition module.
-    /// @param _supportedDisputeKits Indexes of dispute kits that this court will support.
-    function createCourt(
-        uint96 _parent,
-        bool _hiddenVotes,
-        uint256 _minStake,
-        uint256 _alpha,
-        uint256 _feeForJuror,
-        uint256 _jurorsForCourtJump,
-        uint256[4] memory _timesPerPeriod,
-        bytes memory _sortitionExtraData,
-        uint256[] memory _supportedDisputeKits
-    ) external onlyByOwner {
-        if (courts[_parent].minStake > _minStake) revert MinStakeLowerThanParentCourt();
-        if (_supportedDisputeKits.length == 0) revert UnsupportedDisputeKit();
-        if (_parent == FORKING_COURT) revert InvalidForkingCourtAsParent();
-
-        uint96 courtID = uint96(courts.length);
-        Court storage court = courts.push();
-
-        for (uint256 i = 0; i < _supportedDisputeKits.length; i++) {
-            if (_supportedDisputeKits[i] == 0 || _supportedDisputeKits[i] >= disputeKits.length) {
-                revert WrongDisputeKitIndex();
-            }
-            _enableDisputeKit(uint96(courtID), _supportedDisputeKits[i], true);
-        }
-        // Check that Classic DK support was added.
-        if (!court.supportedDisputeKits[DISPUTE_KIT_CLASSIC]) revert MustSupportDisputeKitClassic();
-
-        court.parent = _parent;
-        court.children = new uint256[](0);
-        court.hiddenVotes = _hiddenVotes;
-        court.minStake = _minStake;
-        court.alpha = _alpha;
-        court.feeForJuror = _feeForJuror;
-        court.jurorsForCourtJump = _jurorsForCourtJump;
-        court.timesPerPeriod = _timesPerPeriod;
-
-        sortitionModule.createTree(courtID, _sortitionExtraData);
-
-        // Update the parent.
-        courts[_parent].children.push(courtID);
-        emit CourtCreated(
-            uint96(courtID),
-            _parent,
-            _hiddenVotes,
-            _minStake,
-            _alpha,
-            _feeForJuror,
-            _jurorsForCourtJump,
-            _timesPerPeriod,
-            _supportedDisputeKits
-        );
-    }
-
-    function changeCourtParameters(
-        uint96 _courtID,
-        bool _hiddenVotes,
-        uint256 _minStake,
-        uint256 _alpha,
-        uint256 _feeForJuror,
-        uint256 _jurorsForCourtJump,
-        uint256[4] memory _timesPerPeriod
-    ) external onlyByOwner {
-        Court storage court = courts[_courtID];
-        if (_courtID != GENERAL_COURT && courts[court.parent].minStake > _minStake) {
-            revert MinStakeLowerThanParentCourt();
-        }
-        for (uint256 i = 0; i < court.children.length; i++) {
-            if (courts[court.children[i]].minStake < _minStake) {
-                revert MinStakeLowerThanParentCourt();
-            }
-        }
-        court.minStake = _minStake;
-        court.hiddenVotes = _hiddenVotes;
-        court.alpha = _alpha;
-        court.feeForJuror = _feeForJuror;
-        court.jurorsForCourtJump = _jurorsForCourtJump;
-        court.timesPerPeriod = _timesPerPeriod;
-        emit CourtModified(
-            _courtID,
-            _hiddenVotes,
-            _minStake,
-            _alpha,
-            _feeForJuror,
-            _jurorsForCourtJump,
-            _timesPerPeriod
-        );
-    }
-
-    /// @dev Adds/removes court's support for specified dispute kits.
-    /// @param _courtID The ID of the court.
-    /// @param _disputeKitIDs The IDs of dispute kits which support should be added/removed.
-    /// @param _enable Whether add or remove the dispute kits from the court.
-    function enableDisputeKits(uint96 _courtID, uint256[] memory _disputeKitIDs, bool _enable) external onlyByOwner {
-        for (uint256 i = 0; i < _disputeKitIDs.length; i++) {
-            if (_enable) {
-                if (_disputeKitIDs[i] == 0 || _disputeKitIDs[i] >= disputeKits.length) {
-                    revert WrongDisputeKitIndex();
-                }
-                _enableDisputeKit(_courtID, _disputeKitIDs[i], true);
-            } else {
-                // Classic dispute kit must be supported by all courts.
-                if (_disputeKitIDs[i] == DISPUTE_KIT_CLASSIC) {
-                    revert CannotDisableClassicDK();
-                }
-                _enableDisputeKit(_courtID, _disputeKitIDs[i], false);
-            }
-        }
-    }
-
-    /// @dev Changes the supported fee tokens.
-    /// @param _feeToken The fee token.
-    /// @param _accepted Whether the token is supported or not as a method of fee payment.
-    function changeAcceptedFeeTokens(IERC20 _feeToken, bool _accepted) external onlyByOwner {
-        currencyRates[_feeToken].feePaymentAccepted = _accepted;
-        emit AcceptedFeeToken(_feeToken, _accepted);
-    }
-
-    /// @dev Changes the currency rate of a fee token.
-    /// @param _feeToken The fee token.
-    /// @param _rateInEth The new rate of the fee token in ETH.
-    /// @param _rateDecimals The new decimals of the fee token rate.
-    function changeCurrencyRates(IERC20 _feeToken, uint64 _rateInEth, uint8 _rateDecimals) external onlyByOwner {
-        currencyRates[_feeToken].rateInEth = _rateInEth;
-        currencyRates[_feeToken].rateDecimals = _rateDecimals;
-        emit NewCurrencyRate(_feeToken, _rateInEth, _rateDecimals);
-    }
-
-    // ************************************* //
-    // *         State Modifiers           * //
-    // ************************************* //
-
-    /// @dev Sets the caller's stake in a court.
-    /// @param _courtID The ID of the court.
-    /// @param _newStake The new stake.
-    /// Note that the existing delayed stake will be nullified as non-relevant.
-    function setStake(uint96 _courtID, uint256 _newStake) external virtual whenNotPaused {
-        _setStake(msg.sender, _courtID, _newStake, false, OnError.Revert);
-    }
-
-    /// @dev Sets the stake of a specified account in a court without delaying stake changes, typically to apply a delayed stake or unstake inactive jurors.
-    /// @param _account The account whose stake is being set.
-    /// @param _courtID The ID of the court.
-    /// @param _newStake The new stake.
-    function setStakeBySortitionModule(address _account, uint96 _courtID, uint256 _newStake) external {
-        if (msg.sender != address(sortitionModule)) revert SortitionModuleOnly();
-        _setStake(_account, _courtID, _newStake, true, OnError.Return);
-    }
-
-    /// @dev Transfers PNK to the juror by SortitionModule.
-    /// @param _account The account of the juror whose PNK to transfer.
-    /// @param _amount The amount to transfer.
-    function transferBySortitionModule(address _account, uint256 _amount) external {
-        if (msg.sender != address(sortitionModule)) revert SortitionModuleOnly();
-        // Note eligibility is checked in SortitionModule.
-        pinakion.safeTransfer(_account, _amount);
-    }
-
-    /// @inheritdoc IArbitratorV2
-    function createDispute(
-        uint256 _numberOfChoices,
-        bytes memory _extraData
-    ) external payable override returns (uint256 disputeID) {
-        if (msg.value < arbitrationCost(_extraData)) revert ArbitrationFeesNotEnough();
-
-        return _createDispute(_numberOfChoices, _extraData, NATIVE_CURRENCY, msg.value);
-    }
-
-    /// @inheritdoc IArbitratorV2
-    function createDispute(
-        uint256 _numberOfChoices,
-        bytes calldata _extraData,
-        IERC20 _feeToken,
-        uint256 _feeAmount
-    ) external override returns (uint256 disputeID) {
-        if (!currencyRates[_feeToken].feePaymentAccepted) revert TokenNotAccepted();
-        if (_feeAmount < arbitrationCost(_extraData, _feeToken)) revert ArbitrationFeesNotEnough();
-
-        if (!_feeToken.safeTransferFrom(msg.sender, address(this), _feeAmount)) revert TransferFailed();
-        return _createDispute(_numberOfChoices, _extraData, _feeToken, _feeAmount);
-    }
-
-    function _createDispute(
-        uint256 _numberOfChoices,
-        bytes memory _extraData,
-        IERC20 _feeToken,
-        uint256 _feeAmount
-    ) internal virtual returns (uint256 disputeID) {
-        (uint96 courtID, , uint256 disputeKitID) = _extraDataToCourtIDMinJurorsDisputeKit(_extraData);
-        if (!courts[courtID].supportedDisputeKits[disputeKitID]) revert DisputeKitNotSupportedByCourt();
-
-        disputeID = disputes.length;
-        Dispute storage dispute = disputes.push();
-        dispute.courtID = courtID;
-        dispute.arbitrated = IArbitrableV2(msg.sender);
-        dispute.lastPeriodChange = block.timestamp;
-
-        IDisputeKit disputeKit = disputeKits[disputeKitID];
-        Court storage court = courts[courtID];
-        Round storage round = dispute.rounds.push();
-
-        // Obtain the feeForJuror in the same currency as the _feeAmount
-        uint256 feeForJuror = (_feeToken == NATIVE_CURRENCY)
-            ? court.feeForJuror
-            : convertEthToTokenAmount(_feeToken, court.feeForJuror);
-        round.nbVotes = _feeAmount / feeForJuror;
-        round.disputeKitID = disputeKitID;
-        round.pnkAtStakePerJuror = _calculatePnkAtStake(court.minStake, court.alpha);
-        round.totalFeesForJurors = _feeAmount;
-        round.feeToken = IERC20(_feeToken);
-
-        sortitionModule.createDisputeHook(disputeID, 0); // Default round ID.
-
-        disputeKit.createDispute(disputeID, _numberOfChoices, _extraData, round.nbVotes);
-        emit DisputeCreation(disputeID, IArbitrableV2(msg.sender));
-    }
-
-    /// @dev Passes the period of a specified dispute.
-    /// @param _disputeID The ID of the dispute.
-    function passPeriod(uint256 _disputeID) external {
-        Dispute storage dispute = disputes[_disputeID];
-        Court storage court = courts[dispute.courtID];
-
-        uint256 currentRound = dispute.rounds.length - 1;
-        Round storage round = dispute.rounds[currentRound];
-        if (dispute.period == Period.evidence) {
-            if (
-                currentRound == 0 &&
-                block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)]
-            ) {
-                revert EvidenceNotPassedAndNotAppeal();
-            }
-            if (round.drawnJurors.length != round.nbVotes) revert DisputeStillDrawing();
-            dispute.period = court.hiddenVotes ? Period.commit : Period.vote;
-        } else if (dispute.period == Period.commit) {
-            // Note that we do not want to pass to Voting period if all the commits are cast because it breaks the Shutter auto-reveal currently.
-            if (block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)]) {
-                revert CommitPeriodNotPassed();
-            }
-            dispute.period = Period.vote;
-        } else if (dispute.period == Period.vote) {
-            if (
-                block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)] &&
-                !disputeKits[round.disputeKitID].areVotesAllCast(_disputeID)
-            ) {
-                revert VotePeriodNotPassed();
-            }
-            dispute.period = Period.appeal;
-            emit AppealPossible(_disputeID, dispute.arbitrated);
-        } else if (dispute.period == Period.appeal) {
-            if (
-                block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)] &&
-                !disputeKits[round.disputeKitID].isAppealFunded(_disputeID)
-            ) {
-                revert AppealPeriodNotPassed();
-            }
-            dispute.period = Period.execution;
-        } else if (dispute.period == Period.execution) {
-            revert DisputePeriodIsFinal();
-        }
-
-        dispute.lastPeriodChange = block.timestamp;
-        emit NewPeriod(_disputeID, dispute.period);
-    }
-
-    /// @dev Draws jurors for the dispute. Can be called in parts.
-    /// @param _disputeID The ID of the dispute.
-    /// @param _iterations The number of iterations to run.
-    /// @return nbDrawnJurors The total number of jurors drawn in the round.
-    function draw(uint256 _disputeID, uint256 _iterations) external returns (uint256 nbDrawnJurors) {
-        Dispute storage dispute = disputes[_disputeID];
-        uint256 currentRound = dispute.rounds.length - 1;
-        Round storage round = dispute.rounds[currentRound];
-        if (dispute.period != Period.evidence) revert NotEvidencePeriod();
-
-        IDisputeKit disputeKit = disputeKits[round.disputeKitID];
-
-        uint256 startIndex = round.drawIterations; // for gas: less storage reads
-        uint256 i;
-        while (i < _iterations && round.drawnJurors.length < round.nbVotes) {
-            (address drawnAddress, uint96 fromSubcourtID) = disputeKit.draw(_disputeID, startIndex + i++);
-            if (drawnAddress == address(0)) {
-                continue;
-            }
-            sortitionModule.lockStake(drawnAddress, round.pnkAtStakePerJuror);
-            emit Draw(drawnAddress, _disputeID, currentRound, round.drawnJurors.length);
-            round.drawnJurors.push(drawnAddress);
-            round.drawnJurorFromCourtIDs.push(fromSubcourtID != 0 ? fromSubcourtID : dispute.courtID);
-            if (round.drawnJurors.length == round.nbVotes) {
-                sortitionModule.postDrawHook(_disputeID, currentRound);
-            }
-        }
-        round.drawIterations += i;
-        return round.drawnJurors.length;
-    }
-
-    /// @dev Appeals the ruling of a specified dispute.
-    /// Note: Access restricted to the Dispute Kit for this `disputeID`.
-    /// @param _disputeID The ID of the dispute.
-    /// @param _numberOfChoices Number of choices for the dispute. Can be required during court jump.
-    /// @param _extraData Extradata for the dispute. Can be required during court jump.
-    function appeal(uint256 _disputeID, uint256 _numberOfChoices, bytes memory _extraData) external payable {
-        if (msg.value < appealCost(_disputeID)) revert AppealFeesNotEnough();
-
-        Dispute storage dispute = disputes[_disputeID];
-        if (dispute.period != Period.appeal) revert DisputeNotAppealable();
-
-        Round storage round = dispute.rounds[dispute.rounds.length - 1];
-        if (msg.sender != address(disputeKits[round.disputeKitID])) revert DisputeKitOnly();
-
-        // Warning: the extra round must be created before calling disputeKit.createDispute()
-        Round storage extraRound = dispute.rounds.push();
-
-        (uint96 newCourtID, uint256 newDisputeKitID, bool courtJump, ) = _getCourtAndDisputeKitJumps(
-            dispute,
-            round,
-            courts[dispute.courtID],
-            _disputeID
-        );
-        if (courtJump) {
-            emit CourtJump(_disputeID, dispute.rounds.length - 1, dispute.courtID, newCourtID);
-        }
-
-        dispute.courtID = newCourtID;
-        dispute.period = Period.evidence;
-        dispute.lastPeriodChange = block.timestamp;
-
-        Court storage court = courts[newCourtID];
-        extraRound.nbVotes = msg.value / court.feeForJuror; // As many votes that can be afforded by the provided funds.
-        extraRound.pnkAtStakePerJuror = _calculatePnkAtStake(court.minStake, court.alpha);
-        extraRound.totalFeesForJurors = msg.value;
-        extraRound.disputeKitID = newDisputeKitID;
-
-        sortitionModule.createDisputeHook(_disputeID, dispute.rounds.length - 1);
-
-        // Dispute kit was changed, so create a dispute in the new DK contract.
-        if (extraRound.disputeKitID != round.disputeKitID) {
-            emit DisputeKitJump(_disputeID, dispute.rounds.length - 1, round.disputeKitID, extraRound.disputeKitID);
-            disputeKits[extraRound.disputeKitID].createDispute(
-                _disputeID,
-                _numberOfChoices,
-                _extraData,
-                extraRound.nbVotes
-            );
-        }
-
-        emit AppealDecision(_disputeID, dispute.arbitrated);
-        emit NewPeriod(_disputeID, Period.evidence);
-    }
-
-    /// @dev Distribute the PNKs at stake and the dispute fees for the specific round of the dispute. Can be called in parts.
-    /// Note: Reward distributions are forbidden during pause.
-    /// @param _disputeID The ID of the dispute.
-    /// @param _round The appeal round.
-    /// @param _iterations The number of iterations to run.
-    function execute(uint256 _disputeID, uint256 _round, uint256 _iterations) external whenNotPaused {
-        Round storage round;
-        {
-            Dispute storage dispute = disputes[_disputeID];
-            if (dispute.period != Period.execution) revert NotExecutionPeriod();
-
-            round = dispute.rounds[_round];
-        } // stack too deep workaround
-
-        uint256 start = round.repartitions;
-        uint256 end = round.repartitions + _iterations;
-
-        uint256 pnkPenaltiesInRound = round.pnkPenalties; // Keep in memory to save gas.
-        uint256 numberOfVotesInRound = round.drawnJurors.length;
-        uint256 feePerJurorInRound = round.totalFeesForJurors / numberOfVotesInRound;
-        uint256 pnkAtStakePerJurorInRound = round.pnkAtStakePerJuror;
-        uint256 coherentCount;
-        {
-            IDisputeKit disputeKit = disputeKits[round.disputeKitID];
-            coherentCount = disputeKit.getCoherentCount(_disputeID, _round); // Total number of jurors that are eligible to a reward in this round.
-        } // stack too deep workaround
-
-        if (coherentCount == 0) {
-            // We loop over the votes once as there are no rewards because it is not a tie and no one in this round is coherent with the final outcome.
-            if (end > numberOfVotesInRound) end = numberOfVotesInRound;
-        } else {
-            // We loop over the votes twice, first to collect the PNK penalties, and second to distribute them as rewards along with arbitration fees.
-            if (end > numberOfVotesInRound * 2) end = numberOfVotesInRound * 2;
-        }
-        round.repartitions = end;
-
-        for (uint256 i = start; i < end; i++) {
-            if (i < numberOfVotesInRound) {
-                pnkPenaltiesInRound = _executePenalties(
-                    ExecuteParams({
-                        disputeID: _disputeID,
-                        round: _round,
-                        coherentCount: coherentCount,
-                        numberOfVotesInRound: numberOfVotesInRound,
-                        feePerJurorInRound: feePerJurorInRound,
-                        pnkAtStakePerJurorInRound: pnkAtStakePerJurorInRound,
-                        pnkPenaltiesInRound: pnkPenaltiesInRound,
-                        repartition: i
-                    })
-                );
-            } else {
-                _executeRewards(
-                    ExecuteParams({
-                        disputeID: _disputeID,
-                        round: _round,
-                        coherentCount: coherentCount,
-                        numberOfVotesInRound: numberOfVotesInRound,
-                        feePerJurorInRound: feePerJurorInRound,
-                        pnkAtStakePerJurorInRound: pnkAtStakePerJurorInRound,
-                        pnkPenaltiesInRound: pnkPenaltiesInRound,
-                        repartition: i
-                    })
-                );
-            }
-        }
-        if (round.pnkPenalties != pnkPenaltiesInRound) {
-            round.pnkPenalties = pnkPenaltiesInRound; // Reentrancy risk: breaks Check-Effect-Interact
-        }
-    }
-
-    /// @dev Distribute the PNKs at stake and the dispute fees for the specific round of the dispute, penalties only.
-    /// @param _params The parameters for the execution, see `ExecuteParams`.
-    /// @return pnkPenaltiesInRoundCache The updated penalties in round cache.
-    function _executePenalties(ExecuteParams memory _params) internal returns (uint256) {
-        Dispute storage dispute = disputes[_params.disputeID];
-        Round storage round = dispute.rounds[_params.round];
-        IDisputeKit disputeKit = disputeKits[round.disputeKitID];
-
-        // [0, 1] value that determines how coherent the juror was in this round, in basis points.
-        uint256 coherence = disputeKit.getDegreeOfCoherencePenalty(
-            _params.disputeID,
-            _params.round,
-            _params.repartition,
-            _params.feePerJurorInRound,
-            _params.pnkAtStakePerJurorInRound
-        );
-
-        // Guard against degree exceeding 1, though it should be ensured by the dispute kit.
-        if (coherence > ONE_BASIS_POINT) {
-            coherence = ONE_BASIS_POINT;
-        }
-
-        // Fully coherent jurors won't be penalized.
-        uint256 penalty = (round.pnkAtStakePerJuror * (ONE_BASIS_POINT - coherence)) / ONE_BASIS_POINT;
-
-        // Unlock the PNKs affected by the penalty
-        address account = round.drawnJurors[_params.repartition];
-        sortitionModule.unlockStake(account, penalty);
-
-        // Apply the penalty to the staked PNKs.
-        uint96 penalizedInCourtID = round.drawnJurorFromCourtIDs[_params.repartition];
-        (uint256 pnkBalance, uint256 newCourtStake, uint256 availablePenalty) = sortitionModule.setStakePenalty(
-            account,
-            penalizedInCourtID,
-            penalty
-        );
-        _params.pnkPenaltiesInRound += availablePenalty;
-        emit TokenAndETHShift(
-            account,
-            _params.disputeID,
-            _params.round,
-            coherence,
-            -int256(availablePenalty),
-            0,
-            round.feeToken
-        );
-
-        if (pnkBalance == 0 || !disputeKit.isVoteActive(_params.disputeID, _params.round, _params.repartition)) {
-            // The juror is inactive or their balance is can't cover penalties anymore, unstake them from all courts.
-            sortitionModule.forcedUnstakeAllCourts(account);
-        } else if (newCourtStake < courts[penalizedInCourtID].minStake) {
-            // The juror's balance fell below the court minStake, unstake them from the court.
-            sortitionModule.forcedUnstake(account, penalizedInCourtID);
-        }
-
-        if (_params.repartition == _params.numberOfVotesInRound - 1 && _params.coherentCount == 0) {
-            // No one was coherent, send the rewards to the owner.
-            _transferFeeToken(round.feeToken, payable(owner), round.totalFeesForJurors);
-            pinakion.safeTransfer(owner, _params.pnkPenaltiesInRound);
-            emit LeftoverRewardSent(
-                _params.disputeID,
-                _params.round,
-                _params.pnkPenaltiesInRound,
-                round.totalFeesForJurors,
-                round.feeToken
-            );
-        }
-        return _params.pnkPenaltiesInRound;
-    }
-
-    /// @dev Distribute the PNKs at stake and the dispute fees for the specific round of the dispute, rewards only.
-    /// @param _params The parameters for the execution, see `ExecuteParams`.
-    function _executeRewards(ExecuteParams memory _params) internal {
-        Dispute storage dispute = disputes[_params.disputeID];
-        Round storage round = dispute.rounds[_params.round];
-        IDisputeKit disputeKit = disputeKits[round.disputeKitID];
-
-        // [0, 1] value that determines how coherent the juror was in this round, in basis points.
-        (uint256 pnkCoherence, uint256 feeCoherence) = disputeKit.getDegreeOfCoherenceReward(
-            _params.disputeID,
-            _params.round,
-            _params.repartition % _params.numberOfVotesInRound,
-            _params.feePerJurorInRound,
-            _params.pnkAtStakePerJurorInRound
-        );
-
-        // Guard against degree exceeding 1, though it should be ensured by the dispute kit.
-        if (pnkCoherence > ONE_BASIS_POINT) {
-            pnkCoherence = ONE_BASIS_POINT;
-        }
-        if (feeCoherence > ONE_BASIS_POINT) {
-            feeCoherence = ONE_BASIS_POINT;
-        }
-
-        address account = round.drawnJurors[_params.repartition % _params.numberOfVotesInRound];
-        uint256 pnkLocked = _applyCoherence(round.pnkAtStakePerJuror, pnkCoherence);
-
-        // Release the rest of the PNKs of the juror for this round.
-        sortitionModule.unlockStake(account, pnkLocked);
-
-        // Compute the rewards
-        uint256 pnkReward = _applyCoherence(_params.pnkPenaltiesInRound / _params.coherentCount, pnkCoherence);
-        round.sumPnkRewardPaid += pnkReward;
-        uint256 feeReward = _applyCoherence(round.totalFeesForJurors / _params.coherentCount, feeCoherence);
-        round.sumFeeRewardPaid += feeReward;
-
-        // Transfer the fee reward
-        _transferFeeToken(round.feeToken, payable(account), feeReward);
-
-        // Stake the PNK reward if possible, by-passes delayed stakes and other checks usually done by validateStake()
-        if (!sortitionModule.setStakeReward(account, dispute.courtID, pnkReward)) {
-            pinakion.safeTransfer(account, pnkReward);
-        }
-
-        emit TokenAndETHShift(
-            account,
-            _params.disputeID,
-            _params.round,
-            pnkCoherence,
-            int256(pnkReward),
-            int256(feeReward),
-            round.feeToken
-        );
-
-        // Transfer any residual rewards to the owner. It may happen due to partial coherence of the jurors.
-        if (_params.repartition == _params.numberOfVotesInRound * 2 - 1) {
-            uint256 leftoverPnkReward = _params.pnkPenaltiesInRound - round.sumPnkRewardPaid;
-            uint256 leftoverFeeReward = round.totalFeesForJurors - round.sumFeeRewardPaid;
-            if (leftoverPnkReward != 0 || leftoverFeeReward != 0) {
-                if (leftoverPnkReward != 0) {
-                    pinakion.safeTransfer(owner, leftoverPnkReward);
-                }
-                if (leftoverFeeReward != 0) {
-                    _transferFeeToken(round.feeToken, payable(owner), leftoverFeeReward);
-                }
-                emit LeftoverRewardSent(
-                    _params.disputeID,
-                    _params.round,
-                    leftoverPnkReward,
-                    leftoverFeeReward,
-                    round.feeToken
-                );
-            }
-        }
-    }
-
-    /// @dev Executes a specified dispute's ruling.
-    /// @param _disputeID The ID of the dispute.
-    function executeRuling(uint256 _disputeID) external {
-        Dispute storage dispute = disputes[_disputeID];
-        if (dispute.period != Period.execution) revert NotExecutionPeriod();
-        if (dispute.ruled) revert RulingAlreadyExecuted();
-
-        (uint256 winningChoice, , ) = currentRuling(_disputeID);
-        dispute.ruled = true;
-        emit Ruling(dispute.arbitrated, _disputeID, winningChoice);
-        dispute.arbitrated.rule(_disputeID, winningChoice);
-    }
-
-    // ************************************* //
-    // *           Public Views            * //
-    // ************************************* //
-
-    /// @dev Compute the cost of arbitration denominated in ETH.
-    ///      It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.
-    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).
-    /// @return cost The arbitration cost in ETH.
-    function arbitrationCost(bytes memory _extraData) public view override returns (uint256 cost) {
-        (uint96 courtID, uint256 minJurors, ) = _extraDataToCourtIDMinJurorsDisputeKit(_extraData);
-        cost = courts[courtID].feeForJuror * minJurors;
-    }
-
-    /// @dev Compute the cost of arbitration denominated in `_feeToken`.
-    ///      It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.
-    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).
-    /// @param _feeToken The ERC20 token used to pay fees.
-    /// @return cost The arbitration cost in `_feeToken`.
-    function arbitrationCost(bytes calldata _extraData, IERC20 _feeToken) public view override returns (uint256 cost) {
-        cost = convertEthToTokenAmount(_feeToken, arbitrationCost(_extraData));
-    }
-
-    /// @dev Gets the cost of appealing a specified dispute.
-    /// @param _disputeID The ID of the dispute.
-    /// @return cost The appeal cost.
-    function appealCost(uint256 _disputeID) public view returns (uint256 cost) {
-        Dispute storage dispute = disputes[_disputeID];
-        Round storage round = dispute.rounds[dispute.rounds.length - 1];
-        Court storage court = courts[dispute.courtID];
-
-        (, uint256 newDisputeKitID, bool courtJump, ) = _getCourtAndDisputeKitJumps(dispute, round, court, _disputeID);
-
-        uint256 nbVotesAfterAppeal = disputeKits[newDisputeKitID].getNbVotesAfterAppeal(
-            disputeKits[round.disputeKitID],
-            round.nbVotes
-        );
-
-        if (courtJump) {
-            // Jump to parent court.
-            if (dispute.courtID == GENERAL_COURT) {
-                // TODO: Handle the forking when appealed in General court.
-                cost = NON_PAYABLE_AMOUNT; // Get the cost of the parent court.
-            } else {
-                cost = courts[court.parent].feeForJuror * nbVotesAfterAppeal;
-            }
-        } else {
-            // Stay in current court.
-            cost = court.feeForJuror * nbVotesAfterAppeal;
-        }
-    }
-
-    /// @dev Gets the start and the end of a specified dispute's current appeal period.
-    /// @param _disputeID The ID of the dispute.
-    /// @return start The start of the appeal period.
-    /// @return end The end of the appeal period.
-    function appealPeriod(uint256 _disputeID) external view returns (uint256 start, uint256 end) {
-        Dispute storage dispute = disputes[_disputeID];
-        if (dispute.period == Period.appeal) {
-            start = dispute.lastPeriodChange;
-            end = dispute.lastPeriodChange + courts[dispute.courtID].timesPerPeriod[uint256(Period.appeal)];
-        } else {
-            start = 0;
-            end = 0;
-        }
-    }
-
-    /// @dev Gets the current ruling of a specified dispute.
-    /// @param _disputeID The ID of the dispute.
-    /// @return ruling The current ruling.
-    /// @return tied Whether it's a tie or not.
-    /// @return overridden Whether the ruling was overridden by appeal funding or not.
-    function currentRuling(uint256 _disputeID) public view returns (uint256 ruling, bool tied, bool overridden) {
-        Dispute storage dispute = disputes[_disputeID];
-        Round storage round = dispute.rounds[dispute.rounds.length - 1];
-        IDisputeKit disputeKit = disputeKits[round.disputeKitID];
-        (ruling, tied, overridden) = disputeKit.currentRuling(_disputeID);
-    }
-
-    /// @dev Gets the round info for a specified dispute and round.
-    /// @dev This function must not be called from a non-view function because it returns a dynamic array which might be very large, theoretically exceeding the block gas limit.
-    /// @param _disputeID The ID of the dispute.
-    /// @param _round The round to get the info for.
-    /// @return round The round info.
-    function getRoundInfo(uint256 _disputeID, uint256 _round) external view returns (Round memory) {
-        return disputes[_disputeID].rounds[_round];
-    }
-
-    /// @dev Gets the PNK at stake per juror for a specified dispute and round.
-    /// @param _disputeID The ID of the dispute.
-    /// @param _round The round to get the info for.
-    /// @return pnkAtStakePerJuror The PNK at stake per juror.
-    function getPnkAtStakePerJuror(uint256 _disputeID, uint256 _round) external view returns (uint256) {
-        return disputes[_disputeID].rounds[_round].pnkAtStakePerJuror;
-    }
-
-    /// @dev Gets the number of rounds for a specified dispute.
-    /// @param _disputeID The ID of the dispute.
-    /// @return The number of rounds.
-    function getNumberOfRounds(uint256 _disputeID) external view returns (uint256) {
-        return disputes[_disputeID].rounds.length;
-    }
-
-    /// @dev Checks if a given dispute kit is supported by a given court.
-    /// @param _courtID The ID of the court to check the support for.
-    /// @param _disputeKitID The ID of the dispute kit to check the support for.
-    /// @return Whether the dispute kit is supported or not.
-    function isSupported(uint96 _courtID, uint256 _disputeKitID) external view returns (bool) {
-        return courts[_courtID].supportedDisputeKits[_disputeKitID];
-    }
-
-    /// @dev Gets the timesPerPeriod array for a given court.
-    /// @param _courtID The ID of the court to get the times from.
-    /// @return timesPerPeriod The timesPerPeriod array for the given court.
-    function getTimesPerPeriod(uint96 _courtID) external view returns (uint256[4] memory timesPerPeriod) {
-        timesPerPeriod = courts[_courtID].timesPerPeriod;
-    }
-
-    // ************************************* //
-    // *   Public Views for Dispute Kits   * //
-    // ************************************* //
-
-    /// @dev Gets the number of votes permitted for the specified dispute in the latest round.
-    /// @param _disputeID The ID of the dispute.
-    function getNumberOfVotes(uint256 _disputeID) external view returns (uint256) {
-        Dispute storage dispute = disputes[_disputeID];
-        return dispute.rounds[dispute.rounds.length - 1].nbVotes;
-    }
-
-    /// @dev Returns true if the dispute kit will be switched to a parent DK.
-    /// @param _disputeID The ID of the dispute.
-    /// @return Whether DK will be switched or not.
-    function isDisputeKitJumping(uint256 _disputeID) external view returns (bool) {
-        Dispute storage dispute = disputes[_disputeID];
-        Round storage round = dispute.rounds[dispute.rounds.length - 1];
-        Court storage court = courts[dispute.courtID];
-
-        if (!_isCourtJumping(round, court, _disputeID)) {
-            return false;
-        }
-
-        // Jump if the parent court doesn't support the current DK.
-        return !courts[court.parent].supportedDisputeKits[round.disputeKitID];
-    }
-
-    function getDisputeKitsLength() external view returns (uint256) {
-        return disputeKits.length;
-    }
-
-    function convertEthToTokenAmount(IERC20 _toToken, uint256 _amountInEth) public view returns (uint256) {
-        return (_amountInEth * 10 ** currencyRates[_toToken].rateDecimals) / currencyRates[_toToken].rateInEth;
-    }
-
-    // ************************************* //
-    // *            Internal               * //
-    // ************************************* //
-
-    /// @dev Returns true if the round is jumping to a parent court.
-    /// @param _round The round to check.
-    /// @param _court The court to check.
-    /// @return Whether the round is jumping to a parent court or not.
-    function _isCourtJumping(
-        Round storage _round,
-        Court storage _court,
-        uint256 _disputeID
-    ) internal view returns (bool) {
-        return
-            disputeKits[_round.disputeKitID].earlyCourtJump(_disputeID) || _round.nbVotes >= _court.jurorsForCourtJump;
-    }
-
-    function _getCourtAndDisputeKitJumps(
-        Dispute storage _dispute,
-        Round storage _round,
-        Court storage _court,
-        uint256 _disputeID
-    ) internal view returns (uint96 newCourtID, uint256 newDisputeKitID, bool courtJump, bool disputeKitJump) {
-        newCourtID = _dispute.courtID;
-        newDisputeKitID = _round.disputeKitID;
-
-        if (!_isCourtJumping(_round, _court, _disputeID)) return (newCourtID, newDisputeKitID, false, false);
-
-        // Jump to parent court.
-        newCourtID = courts[newCourtID].parent;
-        courtJump = true;
-
-        if (!courts[newCourtID].supportedDisputeKits[newDisputeKitID]) {
-            // The current Dispute Kit is not compatible with the new court, jump to another Dispute Kit.
-            newDisputeKitID = disputeKits[_round.disputeKitID].getJumpDisputeKitID();
-            if (newDisputeKitID == NULL_DISPUTE_KIT || !courts[newCourtID].supportedDisputeKits[newDisputeKitID]) {
-                // The new Dispute Kit is not defined or still not compatible, fall back to `DisputeKitClassic` which is always supported.
-                newDisputeKitID = DISPUTE_KIT_CLASSIC;
-            }
-            disputeKitJump = true;
-        }
-    }
-
-    /// @dev Internal function to transfer fee tokens (ETH or ERC20)
-    /// @param _feeToken The token to transfer (NATIVE_CURRENCY for ETH).
-    /// @param _recipient The recipient address.
-    /// @param _amount The amount to transfer.
-    function _transferFeeToken(IERC20 _feeToken, address payable _recipient, uint256 _amount) internal {
-        if (_feeToken == NATIVE_CURRENCY) {
-            _recipient.safeSend(_amount, wNative);
-        } else {
-            _feeToken.safeTransfer(_recipient, _amount);
-        }
-    }
-
-    /// @dev Applies degree of coherence to an amount
-    /// @param _amount The base amount to apply coherence to.
-    /// @param _coherence The degree of coherence in basis points.
-    /// @return The amount after applying the degree of coherence.
-    function _applyCoherence(uint256 _amount, uint256 _coherence) internal pure returns (uint256) {
-        return (_amount * _coherence) / ONE_BASIS_POINT;
-    }
-
-    /// @dev Calculates PNK at stake per juror based on court parameters
-    /// @param _minStake The minimum stake for the court.
-    /// @param _alpha The alpha parameter for the court in basis points.
-    /// @return The amount of PNK at stake per juror.
-    function _calculatePnkAtStake(uint256 _minStake, uint256 _alpha) internal pure returns (uint256) {
-        return (_minStake * _alpha) / ONE_BASIS_POINT;
-    }
-
-    /// @dev Toggles the dispute kit support for a given court.
-    /// @param _courtID The ID of the court to toggle the support for.
-    /// @param _disputeKitID The ID of the dispute kit to toggle the support for.
-    /// @param _enable Whether to enable or disable the support. Note that classic dispute kit should always be enabled.
-    function _enableDisputeKit(uint96 _courtID, uint256 _disputeKitID, bool _enable) internal {
-        courts[_courtID].supportedDisputeKits[_disputeKitID] = _enable;
-        emit DisputeKitEnabled(_courtID, _disputeKitID, _enable);
-    }
-
-    /// @dev If called only once then set _onError to Revert, otherwise set it to Return
-    /// @param _account The account to set the stake for.
-    /// @param _courtID The ID of the court to set the stake for.
-    /// @param _newStake The new stake.
-    /// @param _noDelay True if the stake change should not be delayed.
-    /// @param _onError Whether to revert or return false on error.
-    /// @return Whether the stake was successfully set or not.
-    function _setStake(
-        address _account,
-        uint96 _courtID,
-        uint256 _newStake,
-        bool _noDelay,
-        OnError _onError
-    ) internal returns (bool) {
-        if (_courtID == FORKING_COURT || _courtID >= courts.length) {
-            _stakingFailed(_onError, StakingResult.CannotStakeInThisCourt); // Staking directly into the forking court is not allowed.
-            return false;
-        }
-        if (_newStake != 0 && _newStake < courts[_courtID].minStake) {
-            _stakingFailed(_onError, StakingResult.CannotStakeLessThanMinStake); // Staking less than the minimum stake is not allowed.
-            return false;
-        }
-        (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult) = sortitionModule.validateStake(
-            _account,
-            _courtID,
-            _newStake,
-            _noDelay
-        );
-        if (stakingResult != StakingResult.Successful && stakingResult != StakingResult.Delayed) {
-            _stakingFailed(_onError, stakingResult);
-            return false;
-        } else if (stakingResult == StakingResult.Delayed) {
-            return true;
-        }
-        if (pnkDeposit > 0) {
-            if (!pinakion.safeTransferFrom(_account, address(this), pnkDeposit)) {
-                _stakingFailed(_onError, StakingResult.StakingTransferFailed);
-                return false;
-            }
-        }
-        if (pnkWithdrawal > 0) {
-            if (!pinakion.safeTransfer(_account, pnkWithdrawal)) {
-                _stakingFailed(_onError, StakingResult.UnstakingTransferFailed);
-                return false;
-            }
-        }
-        sortitionModule.setStake(_account, _courtID, pnkDeposit, pnkWithdrawal, _newStake);
-
-        return true;
-    }
-
-    /// @dev It may revert depending on the _onError parameter.
-    function _stakingFailed(OnError _onError, StakingResult _result) internal pure virtual {
-        if (_onError == OnError.Return) return;
-        if (_result == StakingResult.StakingTransferFailed) revert StakingTransferFailed();
-        if (_result == StakingResult.UnstakingTransferFailed) revert UnstakingTransferFailed();
-        if (_result == StakingResult.CannotStakeInMoreCourts) revert StakingInTooManyCourts();
-        if (_result == StakingResult.CannotStakeInThisCourt) revert StakingNotPossibleInThisCourt();
-        if (_result == StakingResult.CannotStakeLessThanMinStake) revert StakingLessThanCourtMinStake();
-        if (_result == StakingResult.CannotStakeZeroWhenNoStake) revert StakingZeroWhenNoStake();
-    }
-
-    /// @dev Gets a court ID, the minimum number of jurors and an ID of a dispute kit from a specified extra data bytes array.
-    /// Note that if extradata contains an incorrect value then this value will be switched to default.
-    /// @param _extraData The extra data bytes array. The first 32 bytes are the court ID, the next are the minimum number of jurors and the last are the dispute kit ID.
-    /// @return courtID The court ID.
-    /// @return minJurors The minimum number of jurors required.
-    /// @return disputeKitID The ID of the dispute kit.
-    function _extraDataToCourtIDMinJurorsDisputeKit(
-        bytes memory _extraData
-    ) internal view returns (uint96 courtID, uint256 minJurors, uint256 disputeKitID) {
-        // Note that if the extradata doesn't contain 32 bytes for the dispute kit ID it'll return the default 0 index.
-        if (_extraData.length >= 64) {
-            assembly {
-                // solium-disable-line security/no-inline-assembly
-                courtID := mload(add(_extraData, 0x20))
-                minJurors := mload(add(_extraData, 0x40))
-                disputeKitID := mload(add(_extraData, 0x60))
-            }
-            if (courtID == FORKING_COURT || courtID >= courts.length) {
-                courtID = GENERAL_COURT;
-            }
-            if (minJurors == 0) {
-                minJurors = DEFAULT_NB_OF_JURORS;
-            }
-            if (disputeKitID == NULL_DISPUTE_KIT || disputeKitID >= disputeKits.length) {
-                disputeKitID = DISPUTE_KIT_CLASSIC; // 0 index is not used.
-            }
-        } else {
-            courtID = GENERAL_COURT;
-            minJurors = DEFAULT_NB_OF_JURORS;
-            disputeKitID = DISPUTE_KIT_CLASSIC;
-        }
-    }
-
-    // ************************************* //
-    // *              Errors               * //
-    // ************************************* //
-
-    error OwnerOnly();
-    error GuardianOrOwnerOnly();
-    error DisputeKitOnly();
-    error SortitionModuleOnly();
-    error UnsuccessfulCall();
-    error InvalidDisputKitParent();
-    error MinStakeLowerThanParentCourt();
-    error UnsupportedDisputeKit();
-    error InvalidForkingCourtAsParent();
-    error WrongDisputeKitIndex();
-    error CannotDisableClassicDK();
-    error StakingInTooManyCourts();
-    error StakingNotPossibleInThisCourt();
-    error StakingLessThanCourtMinStake();
-    error StakingTransferFailed();
-    error UnstakingTransferFailed();
-    error ArbitrationFeesNotEnough();
-    error DisputeKitNotSupportedByCourt();
-    error MustSupportDisputeKitClassic();
-    error TokenNotAccepted();
-    error EvidenceNotPassedAndNotAppeal();
-    error DisputeStillDrawing();
-    error CommitPeriodNotPassed();
-    error VotePeriodNotPassed();
-    error AppealPeriodNotPassed();
-    error NotEvidencePeriod();
-    error AppealFeesNotEnough();
-    error DisputeNotAppealable();
-    error NotExecutionPeriod();
-    error RulingAlreadyExecuted();
-    error DisputePeriodIsFinal();
-    error TransferFailed();
-    error WhenNotPausedOnly();
-    error WhenPausedOnly();
-    error StakingZeroWhenNoStake();
-}
diff --git a/contracts/src/arbitration/KlerosCoreNeo.sol b/contracts/src/arbitration/KlerosCoreNeo.sol
deleted file mode 100644
index 6f43132d1..000000000
--- a/contracts/src/arbitration/KlerosCoreNeo.sol
+++ /dev/null
@@ -1,144 +0,0 @@
-// SPDX-License-Identifier: MIT
-
-pragma solidity ^0.8.24;
-
-import {KlerosCoreBase, IDisputeKit, ISortitionModule, IERC20, OnError, StakingResult} from "./KlerosCoreBase.sol";
-import "@openzeppelin/contracts/token/ERC721/IERC721.sol";
-
-/// @title KlerosCoreNeo
-/// Core arbitrator contract for Kleros v2.
-/// Note that this contract trusts the PNK token, the dispute kit and the sortition module contracts.
-contract KlerosCoreNeo is KlerosCoreBase {
-    string public constant override version = "2.0.0";
-
-    // ************************************* //
-    // *             Storage               * //
-    // ************************************* //
-
-    mapping(address => bool) public arbitrableWhitelist; // Arbitrable whitelist.
-    bool public arbitrableWhitelistEnabled; // Whether the arbitrable whitelist is enabled.
-    IERC721 public jurorNft; // Eligible jurors NFT.
-
-    // ************************************* //
-    // *            Constructor            * //
-    // ************************************* //
-
-    /// @custom:oz-upgrades-unsafe-allow constructor
-    constructor() {
-        _disableInitializers();
-    }
-
-    /// @dev Initializer (constructor equivalent for upgradable contracts).
-    /// @param _owner The owner's address.
-    /// @param _guardian The guardian's address.
-    /// @param _pinakion The address of the token contract.
-    /// @param _jurorProsecutionModule The address of the juror prosecution module.
-    /// @param _disputeKit The address of the default dispute kit.
-    /// @param _hiddenVotes The `hiddenVotes` property value of the general court.
-    /// @param _courtParameters Numeric parameters of General court (minStake, alpha, feeForJuror and jurorsForCourtJump respectively).
-    /// @param _timesPerPeriod The `timesPerPeriod` property value of the general court.
-    /// @param _sortitionExtraData The extra data for sortition module.
-    /// @param _sortitionModuleAddress The sortition module responsible for sortition of the jurors.
-    /// @param _jurorNft NFT contract to vet the jurors.
-    /// @param _wNative The wrapped native token address, typically wETH.
-    function initialize(
-        address _owner,
-        address _guardian,
-        IERC20 _pinakion,
-        address _jurorProsecutionModule,
-        IDisputeKit _disputeKit,
-        bool _hiddenVotes,
-        uint256[4] memory _courtParameters,
-        uint256[4] memory _timesPerPeriod,
-        bytes memory _sortitionExtraData,
-        ISortitionModule _sortitionModuleAddress,
-        IERC721 _jurorNft,
-        address _wNative
-    ) external reinitializer(2) {
-        __KlerosCoreBase_initialize(
-            _owner,
-            _guardian,
-            _pinakion,
-            _jurorProsecutionModule,
-            _disputeKit,
-            _hiddenVotes,
-            _courtParameters,
-            _timesPerPeriod,
-            _sortitionExtraData,
-            _sortitionModuleAddress,
-            _wNative
-        );
-        jurorNft = _jurorNft;
-    }
-
-    // ************************************* //
-    // *             Governance            * //
-    // ************************************* //
-
-    /// @dev Access Control to perform implementation upgrades (UUPS Proxiable)
-    ///      Only the owner can perform upgrades (`onlyByOwner`)
-    function _authorizeUpgrade(address) internal view override onlyByOwner {
-        // NOP
-    }
-
-    /// @dev Changes the `jurorNft` storage variable.
-    /// @param _jurorNft The new value for the `jurorNft` storage variable.
-    function changeJurorNft(IERC721 _jurorNft) external onlyByOwner {
-        jurorNft = _jurorNft;
-    }
-
-    /// @dev Adds or removes an arbitrable from whitelist.
-    /// @param _arbitrable Arbitrable address.
-    /// @param _allowed Whether add or remove permission.
-    function changeArbitrableWhitelist(address _arbitrable, bool _allowed) external onlyByOwner {
-        arbitrableWhitelist[_arbitrable] = _allowed;
-    }
-
-    /// @dev Enables or disables the arbitrable whitelist.
-    function changeArbitrableWhitelistEnabled(bool _enabled) external onlyByOwner {
-        arbitrableWhitelistEnabled = _enabled;
-    }
-
-    // ************************************* //
-    // *         State Modifiers           * //
-    // ************************************* //
-
-    /// @dev Sets the caller's stake in a court.
-    /// Note: Staking and unstaking is forbidden during pause.
-    /// @param _courtID The ID of the court.
-    /// @param _newStake The new stake.
-    /// Note that the existing delayed stake will be nullified as non-relevant.
-    function setStake(uint96 _courtID, uint256 _newStake) external override whenNotPaused {
-        if (address(jurorNft) != address(0) && jurorNft.balanceOf(msg.sender) == 0) revert NotEligibleForStaking();
-        super._setStake(msg.sender, _courtID, _newStake, false, OnError.Revert);
-    }
-
-    // ************************************* //
-    // *            Internal               * //
-    // ************************************* //
-
-    function _createDispute(
-        uint256 _numberOfChoices,
-        bytes memory _extraData,
-        IERC20 _feeToken,
-        uint256 _feeAmount
-    ) internal override returns (uint256 disputeID) {
-        if (arbitrableWhitelistEnabled && !arbitrableWhitelist[msg.sender]) revert ArbitrableNotWhitelisted();
-        return super._createDispute(_numberOfChoices, _extraData, _feeToken, _feeAmount);
-    }
-
-    function _stakingFailed(OnError _onError, StakingResult _result) internal pure override {
-        super._stakingFailed(_onError, _result);
-        if (_result == StakingResult.CannotStakeMoreThanMaxStakePerJuror) revert StakingMoreThanMaxStakePerJuror();
-        if (_result == StakingResult.CannotStakeMoreThanMaxTotalStaked) revert StakingMoreThanMaxTotalStaked();
-    }
-
-    // ************************************* //
-    // *              Errors               * //
-    // ************************************* //
-
-    error NotEligibleForStaking();
-    error StakingMoreThanMaxStakePerJuror();
-    error StakingMoreThanMaxTotalStaked();
-    error ArbitrableNotWhitelisted();
-}
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index 369789ab1..5dc1c3522 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -2,7 +2,7 @@
 
 pragma solidity ^0.8.24;
 
-import {KlerosCore, KlerosCoreBase, IDisputeKit, ISortitionModule} from "../KlerosCore.sol";
+import {KlerosCore, IDisputeKit, ISortitionModule} from "../KlerosCore.sol";
 import {Initializable} from "../../proxy/Initializable.sol";
 import {UUPSProxiable} from "../../proxy/UUPSProxiable.sol";
 import {SafeSend} from "../../libraries/SafeSend.sol";
@@ -273,7 +273,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         bytes32 _commit
     ) internal notJumped(_coreDisputeID) {
         (, , KlerosCore.Period period, , ) = core.disputes(_coreDisputeID);
-        if (period != KlerosCoreBase.Period.commit) revert NotCommitPeriod();
+        if (period != KlerosCore.Period.commit) revert NotCommitPeriod();
         if (_commit == bytes32(0)) revert EmptyCommit();
         if (!coreDisputeIDToActive[_coreDisputeID]) revert NotActiveForCoreDisputeID();
 
@@ -314,7 +314,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         address _juror
     ) internal notJumped(_coreDisputeID) {
         (, , KlerosCore.Period period, , ) = core.disputes(_coreDisputeID);
-        if (period != KlerosCoreBase.Period.vote) revert NotVotePeriod();
+        if (period != KlerosCore.Period.vote) revert NotVotePeriod();
         if (_voteIDs.length == 0) revert EmptyVoteIDs();
         if (!coreDisputeIDToActive[_coreDisputeID]) revert NotActiveForCoreDisputeID();
 
@@ -517,7 +517,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         ruling = tied ? 0 : round.winningChoice;
         (, , KlerosCore.Period period, , ) = core.disputes(_coreDisputeID);
         // Override the final ruling if only one side funded the appeals.
-        if (period == KlerosCoreBase.Period.execution) {
+        if (period == KlerosCore.Period.execution) {
             uint256[] memory fundedChoices = getFundedChoices(_coreDisputeID);
             if (fundedChoices.length == 1) {
                 ruling = fundedChoices[0];
diff --git a/contracts/src/proxy/KlerosProxies.sol b/contracts/src/proxy/KlerosProxies.sol
index 57b521ffd..7db79b67c 100644
--- a/contracts/src/proxy/KlerosProxies.sol
+++ b/contracts/src/proxy/KlerosProxies.sol
@@ -7,10 +7,6 @@ import "./UUPSProxy.sol";
 /// Workaround to get meaningful names for the proxy contracts
 /// Otherwise all the contracts are called `UUPSProxy` on the chain explorers
 
-contract DisputeKitClassicNeoProxy is UUPSProxy {
-    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}
-}
-
 contract DisputeKitClassicUniversityProxy is UUPSProxy {
     constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}
 }
@@ -51,10 +47,6 @@ contract HomeGatewayToEthereumProxy is UUPSProxy {
     constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}
 }
 
-contract KlerosCoreNeoProxy is UUPSProxy {
-    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}
-}
-
 contract KlerosCoreRulerProxy is UUPSProxy {
     constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}
 }
@@ -75,10 +67,6 @@ contract RandomizerRNGProxy is UUPSProxy {
     constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}
 }
 
-contract SortitionModuleNeoProxy is UUPSProxy {
-    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}
-}
-
 contract SortitionModuleUniversityProxy is UUPSProxy {
     constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}
 }
diff --git a/contracts/test/foundry/KlerosCore_Appeals.t.sol b/contracts/test/foundry/KlerosCore_Appeals.t.sol
index 6421cb119..c5016f23c 100644
--- a/contracts/test/foundry/KlerosCore_Appeals.t.sol
+++ b/contracts/test/foundry/KlerosCore_Appeals.t.sol
@@ -2,7 +2,7 @@
 pragma solidity ^0.8.24;
 
 import {KlerosCore_TestBase} from "./KlerosCore_TestBase.sol";
-import {KlerosCoreBase} from "../../src/arbitration/KlerosCoreBase.sol";
+import {KlerosCore} from "../../src/arbitration/KlerosCore.sol";
 import {DisputeKitClassic, DisputeKitClassicBase} from "../../src/arbitration/dispute-kits/DisputeKitClassic.sol";
 import {UUPSProxy} from "../../src/proxy/UUPSProxy.sol";
 import "../../src/libraries/Constants.sol";
@@ -42,34 +42,34 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
 
         // Simulate the call from dispute kit to check the requires unrelated to caller
         vm.prank(address(disputeKit));
-        vm.expectRevert(KlerosCoreBase.DisputeNotAppealable.selector);
+        vm.expectRevert(KlerosCore.DisputeNotAppealable.selector);
         core.appeal{value: 0.21 ether}(disputeID, 2, arbitratorExtraData);
 
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.AppealPossible(disputeID, arbitrable);
+        emit KlerosCore.AppealPossible(disputeID, arbitrable);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.appeal);
+        emit KlerosCore.NewPeriod(disputeID, KlerosCore.Period.appeal);
         core.passPeriod(disputeID);
 
-        (, , KlerosCoreBase.Period period, , uint256 lastPeriodChange) = core.disputes(disputeID);
+        (, , KlerosCore.Period period, , uint256 lastPeriodChange) = core.disputes(disputeID);
         (start, end) = core.appealPeriod(0);
-        assertEq(uint256(period), uint256(KlerosCoreBase.Period.appeal), "Wrong period");
+        assertEq(uint256(period), uint256(KlerosCore.Period.appeal), "Wrong period");
         assertEq(lastPeriodChange, block.timestamp, "Wrong lastPeriodChange");
         assertEq(core.appealCost(0), 0.21 ether, "Wrong appealCost");
         assertEq(start, lastPeriodChange, "Appeal period start is incorrect");
         assertEq(end, lastPeriodChange + timesPerPeriod[3], "Appeal period end is incorrect");
 
-        vm.expectRevert(KlerosCoreBase.AppealPeriodNotPassed.selector);
+        vm.expectRevert(KlerosCore.AppealPeriodNotPassed.selector);
         core.passPeriod(disputeID);
 
         // Simulate the call from dispute kit to check the requires unrelated to caller
         vm.prank(address(disputeKit));
-        vm.expectRevert(KlerosCoreBase.AppealFeesNotEnough.selector);
+        vm.expectRevert(KlerosCore.AppealFeesNotEnough.selector);
         core.appeal{value: 0.21 ether - 1}(disputeID, 2, arbitratorExtraData);
         vm.deal(address(disputeKit), 0); // Nullify the balance so it doesn't get in the way.
 
         vm.prank(staker1);
-        vm.expectRevert(KlerosCoreBase.DisputeKitOnly.selector);
+        vm.expectRevert(KlerosCore.DisputeKitOnly.selector);
         core.appeal{value: 0.21 ether}(disputeID, 2, arbitratorExtraData);
 
         vm.prank(crowdfunder1);
@@ -177,9 +177,9 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
 
         vm.prank(crowdfunder2);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.AppealDecision(disputeID, arbitrable);
+        emit KlerosCore.AppealDecision(disputeID, arbitrable);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.evidence);
+        emit KlerosCore.NewPeriod(disputeID, KlerosCore.Period.evidence);
         disputeKit.fundAppeal{value: 0.42 ether}(disputeID, 2);
 
         assertEq((disputeKit.getFundedChoices(disputeID)).length, 0, "No funded choices in the fresh round");
@@ -194,17 +194,17 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
         assertEq(sortitionModule.disputesWithoutJurors(), 1, "Wrong disputesWithoutJurors count after appeal");
         assertEq(core.getNumberOfRounds(disputeID), 2, "Wrong number of rounds");
 
-        (, , KlerosCoreBase.Period period, , uint256 lastPeriodChange) = core.disputes(disputeID);
-        assertEq(uint256(period), uint256(KlerosCoreBase.Period.evidence), "Wrong period");
+        (, , KlerosCore.Period period, , uint256 lastPeriodChange) = core.disputes(disputeID);
+        assertEq(uint256(period), uint256(KlerosCore.Period.evidence), "Wrong period");
         assertEq(lastPeriodChange, block.timestamp, "Wrong lastPeriodChange");
 
-        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 1); // Check the new round
+        KlerosCore.Round memory round = core.getRoundInfo(disputeID, 1); // Check the new round
         assertEq(round.pnkAtStakePerJuror, 1000, "Wrong pnkAtStakePerJuror");
         assertEq(round.totalFeesForJurors, 0.21 ether, "Wrong totalFeesForJurors");
         assertEq(round.nbVotes, 7, "Wrong nbVotes");
 
         core.draw(disputeID, 7);
-        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.vote); // Check that we don't have to wait for the timeout to pass the evidence period after appeal
+        emit KlerosCore.NewPeriod(disputeID, KlerosCore.Period.vote); // Check that we don't have to wait for the timeout to pass the evidence period after appeal
         core.passPeriod(disputeID);
     }
 
@@ -263,7 +263,7 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
         vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
 
-        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 0);
+        KlerosCore.Round memory round = core.getRoundInfo(disputeID, 0);
         assertEq(round.disputeKitID, newDkID, "Wrong DK ID");
 
         core.draw(disputeID, DEFAULT_NB_OF_JURORS);
@@ -286,15 +286,15 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
         assertEq(core.isDisputeKitJumping(disputeID), true, "Should be jumping");
 
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.CourtJump(disputeID, 1, newCourtID, GENERAL_COURT);
+        emit KlerosCore.CourtJump(disputeID, 1, newCourtID, GENERAL_COURT);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.DisputeKitJump(disputeID, 1, newDkID, DISPUTE_KIT_CLASSIC);
+        emit KlerosCore.DisputeKitJump(disputeID, 1, newDkID, DISPUTE_KIT_CLASSIC);
         vm.expectEmit(true, true, true, true);
         emit DisputeKitClassicBase.DisputeCreation(disputeID, 2, newExtraData);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.AppealDecision(disputeID, arbitrable);
+        emit KlerosCore.AppealDecision(disputeID, arbitrable);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.evidence);
+        emit KlerosCore.NewPeriod(disputeID, KlerosCore.Period.evidence);
         vm.prank(crowdfunder2);
         newDisputeKit.fundAppeal{value: 0.42 ether}(disputeID, 2);
 
@@ -322,7 +322,7 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
 
         // And check that draw in the new round works
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.Draw(staker1, disputeID, 1, 0); // roundID = 1 VoteID = 0
+        emit KlerosCore.Draw(staker1, disputeID, 1, 0); // roundID = 1 VoteID = 0
         core.draw(disputeID, 1);
 
         (address account, , , ) = disputeKit.getVoteInfo(disputeID, 1, 0);
@@ -401,7 +401,7 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
         vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
 
-        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 0);
+        KlerosCore.Round memory round = core.getRoundInfo(disputeID, 0);
         assertEq(round.disputeKitID, dkID3, "Wrong DK ID");
 
         core.draw(disputeID, DEFAULT_NB_OF_JURORS);
@@ -424,15 +424,15 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
         assertEq(core.isDisputeKitJumping(disputeID), true, "Should be jumping");
 
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.CourtJump(disputeID, 1, newCourtID, GENERAL_COURT);
+        emit KlerosCore.CourtJump(disputeID, 1, newCourtID, GENERAL_COURT);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.DisputeKitJump(disputeID, 1, dkID3, dkID2);
+        emit KlerosCore.DisputeKitJump(disputeID, 1, dkID3, dkID2);
         vm.expectEmit(true, true, true, true);
         emit DisputeKitClassicBase.DisputeCreation(disputeID, 2, newExtraData);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.AppealDecision(disputeID, arbitrable);
+        emit KlerosCore.AppealDecision(disputeID, arbitrable);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.evidence);
+        emit KlerosCore.NewPeriod(disputeID, KlerosCore.Period.evidence);
         vm.prank(crowdfunder2);
         disputeKit3.fundAppeal{value: 0.42 ether}(disputeID, 2);
 
@@ -460,7 +460,7 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
 
         // And check that draw in the new round works
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.Draw(staker1, disputeID, 1, 0); // roundID = 1 VoteID = 0
+        emit KlerosCore.Draw(staker1, disputeID, 1, 0); // roundID = 1 VoteID = 0
         core.draw(disputeID, 1);
 
         (address account, , , ) = disputeKit2.getVoteInfo(disputeID, 1, 0);
@@ -497,7 +497,7 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
 
         // Should pass to execution period without waiting for the 2nd half of the appeal.
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.execution);
+        emit KlerosCore.NewPeriod(disputeID, KlerosCore.Period.execution);
         core.passPeriod(disputeID);
     }
 }
diff --git a/contracts/test/foundry/KlerosCore_Disputes.t.sol b/contracts/test/foundry/KlerosCore_Disputes.t.sol
index 954789f92..f9840014d 100644
--- a/contracts/test/foundry/KlerosCore_Disputes.t.sol
+++ b/contracts/test/foundry/KlerosCore_Disputes.t.sol
@@ -2,8 +2,8 @@
 pragma solidity ^0.8.24;
 
 import {KlerosCore_TestBase} from "./KlerosCore_TestBase.sol";
-import {KlerosCoreBase} from "../../src/arbitration/KlerosCoreBase.sol";
-import {IArbitratorV2} from "../../src/arbitration/KlerosCoreBase.sol";
+import {KlerosCore} from "../../src/arbitration/KlerosCore.sol";
+import {IArbitratorV2} from "../../src/arbitration/KlerosCore.sol";
 import {DisputeKitClassicBase} from "../../src/arbitration/dispute-kits/DisputeKitClassicBase.sol";
 import {IArbitrableV2} from "../../src/arbitration/arbitrables/ArbitrableExample.sol";
 import "../../src/libraries/Constants.sol";
@@ -38,11 +38,11 @@ contract KlerosCore_DisputesTest is KlerosCore_TestBase {
 
         arbitrable.changeArbitratorExtraData(newExtraData);
 
-        vm.expectRevert(KlerosCoreBase.ArbitrationFeesNotEnough.selector);
+        vm.expectRevert(KlerosCore.ArbitrationFeesNotEnough.selector);
         vm.prank(disputer);
         arbitrable.createDispute{value: newFee * newNbJurors - 1}("Action");
 
-        vm.expectRevert(KlerosCoreBase.DisputeKitNotSupportedByCourt.selector);
+        vm.expectRevert(KlerosCore.DisputeKitNotSupportedByCourt.selector);
         vm.prank(disputer);
         arbitrable.createDispute{value: 0.04 ether}("Action");
 
@@ -64,18 +64,18 @@ contract KlerosCore_DisputesTest is KlerosCore_TestBase {
         (
             uint96 courtID,
             IArbitrableV2 arbitrated,
-            KlerosCoreBase.Period period,
+            KlerosCore.Period period,
             bool ruled,
             uint256 lastPeriodChange
         ) = core.disputes(disputeID);
 
         assertEq(courtID, newCourtID, "Wrong court ID");
         assertEq(address(arbitrated), address(arbitrable), "Wrong arbitrable");
-        assertEq(uint256(period), uint256(KlerosCoreBase.Period.evidence), "Wrong period");
+        assertEq(uint256(period), uint256(KlerosCore.Period.evidence), "Wrong period");
         assertEq(ruled, false, "Should not be ruled");
         assertEq(lastPeriodChange, block.timestamp, "Wrong lastPeriodChange");
 
-        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 0);
+        KlerosCore.Round memory round = core.getRoundInfo(disputeID, 0);
         assertEq(round.disputeKitID, newDkID, "Wrong DK ID");
         assertEq(round.pnkAtStakePerJuror, 4000, "Wrong pnkAtStakePerJuror"); // minStake * alpha / divisor = 2000 * 20000/10000
         assertEq(round.totalFeesForJurors, 0.04 ether, "Wrong totalFeesForJurors");
@@ -116,7 +116,7 @@ contract KlerosCore_DisputesTest is KlerosCore_TestBase {
         vm.prank(disputer);
         feeToken.approve(address(arbitrable), 1 ether);
 
-        vm.expectRevert(KlerosCoreBase.TokenNotAccepted.selector);
+        vm.expectRevert(KlerosCore.TokenNotAccepted.selector);
         vm.prank(disputer);
         arbitrable.createDispute("Action", 0.18 ether);
 
@@ -125,11 +125,11 @@ contract KlerosCore_DisputesTest is KlerosCore_TestBase {
         vm.prank(owner);
         core.changeCurrencyRates(feeToken, 500, 3);
 
-        vm.expectRevert(KlerosCoreBase.ArbitrationFeesNotEnough.selector);
+        vm.expectRevert(KlerosCore.ArbitrationFeesNotEnough.selector);
         vm.prank(disputer);
         arbitrable.createDispute("Action", 0.18 ether - 1);
 
-        vm.expectRevert(KlerosCoreBase.TransferFailed.selector);
+        vm.expectRevert(KlerosCore.TransferFailed.selector);
         vm.prank(address(arbitrable)); // Bypass createDispute in arbitrable to avoid transfer checks there and make the arbitrable call KC directly
         core.createDispute(2, arbitratorExtraData, feeToken, 0.18 ether);
 
@@ -137,7 +137,7 @@ contract KlerosCore_DisputesTest is KlerosCore_TestBase {
         vm.prank(disputer);
         arbitrable.createDispute("Action", 0.18 ether);
 
-        KlerosCoreBase.Round memory round = core.getRoundInfo(0, 0);
+        KlerosCore.Round memory round = core.getRoundInfo(0, 0);
         assertEq(round.totalFeesForJurors, 0.18 ether, "Wrong totalFeesForJurors");
         assertEq(round.nbVotes, 3, "Wrong nbVotes");
         assertEq(address(round.feeToken), address(feeToken), "Wrong feeToken");
diff --git a/contracts/test/foundry/KlerosCore_Drawing.t.sol b/contracts/test/foundry/KlerosCore_Drawing.t.sol
index d6ffc9ea9..b8c644392 100644
--- a/contracts/test/foundry/KlerosCore_Drawing.t.sol
+++ b/contracts/test/foundry/KlerosCore_Drawing.t.sol
@@ -2,7 +2,7 @@
 pragma solidity ^0.8.24;
 
 import {KlerosCore_TestBase} from "./KlerosCore_TestBase.sol";
-import {KlerosCoreBase} from "../../src/arbitration/KlerosCoreBase.sol";
+import {KlerosCore} from "../../src/arbitration/KlerosCore.sol";
 import {SortitionModuleBase} from "../../src/arbitration/SortitionModuleBase.sol";
 import {ISortitionModule} from "../../src/arbitration/interfaces/ISortitionModule.sol";
 import "../../src/libraries/Constants.sol";
@@ -26,7 +26,7 @@ contract KlerosCore_DrawingTest is KlerosCore_TestBase {
         vm.expectEmit(true, true, true, true);
         emit SortitionModuleBase.StakeLocked(staker1, 1000, false);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.Draw(staker1, disputeID, roundID, 0); // VoteID = 0
+        emit KlerosCore.Draw(staker1, disputeID, roundID, 0); // VoteID = 0
 
         core.draw(disputeID, DEFAULT_NB_OF_JURORS); // Do 3 iterations and see that the juror will get drawn 3 times despite low stake.
 
@@ -61,7 +61,7 @@ contract KlerosCore_DrawingTest is KlerosCore_TestBase {
 
         core.draw(disputeID, DEFAULT_NB_OF_JURORS); // No one is staked so check that the empty addresses are not drawn.
 
-        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, roundID);
+        KlerosCore.Round memory round = core.getRoundInfo(disputeID, roundID);
         assertEq(round.drawIterations, 3, "Wrong drawIterations number");
 
         (, , , , uint256 nbVoters, ) = disputeKit.getRoundInfo(disputeID, roundID, 0);
@@ -106,16 +106,16 @@ contract KlerosCore_DrawingTest is KlerosCore_TestBase {
         assertEq(courtID, GENERAL_COURT, "Wrong court ID of the dispute");
 
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.Draw(staker1, disputeID, roundID, 0);
+        emit KlerosCore.Draw(staker1, disputeID, roundID, 0);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.Draw(staker1, disputeID, roundID, 1);
+        emit KlerosCore.Draw(staker1, disputeID, roundID, 1);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.Draw(staker1, disputeID, roundID, 2);
+        emit KlerosCore.Draw(staker1, disputeID, roundID, 2);
         core.draw(disputeID, DEFAULT_NB_OF_JURORS);
 
         assertEq(sortitionModule.disputesWithoutJurors(), 0, "Wrong disputesWithoutJurors count");
 
-        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, roundID);
+        KlerosCore.Round memory round = core.getRoundInfo(disputeID, roundID);
         assertEq(round.drawIterations, 3, "Wrong drawIterations number");
 
         (, , , , uint256 nbVoters, ) = disputeKit.getRoundInfo(disputeID, roundID, 0);
diff --git a/contracts/test/foundry/KlerosCore_Execution.t.sol b/contracts/test/foundry/KlerosCore_Execution.t.sol
index c5763964e..33b2cda65 100644
--- a/contracts/test/foundry/KlerosCore_Execution.t.sol
+++ b/contracts/test/foundry/KlerosCore_Execution.t.sol
@@ -2,10 +2,10 @@
 pragma solidity ^0.8.24;
 
 import {KlerosCore_TestBase} from "./KlerosCore_TestBase.sol";
-import {KlerosCoreBase} from "../../src/arbitration/KlerosCoreBase.sol";
+import {KlerosCore} from "../../src/arbitration/KlerosCore.sol";
 import {SortitionModuleBase} from "../../src/arbitration/SortitionModuleBase.sol";
 import {DisputeKitClassicBase} from "../../src/arbitration/dispute-kits/DisputeKitClassicBase.sol";
-import {IArbitratorV2, IArbitrableV2} from "../../src/arbitration/KlerosCoreBase.sol";
+import {IArbitratorV2, IArbitrableV2} from "../../src/arbitration/KlerosCore.sol";
 import {IERC20} from "../../src/libraries/SafeERC20.sol";
 import "../../src/libraries/Constants.sol";
 
@@ -53,7 +53,7 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
         disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
         core.passPeriod(disputeID); // Appeal
 
-        vm.expectRevert(KlerosCoreBase.NotExecutionPeriod.selector);
+        vm.expectRevert(KlerosCore.NotExecutionPeriod.selector);
         core.execute(disputeID, 0, 1);
 
         vm.warp(block.timestamp + timesPerPeriod[3]);
@@ -61,7 +61,7 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
 
         vm.prank(owner);
         core.pause();
-        vm.expectRevert(KlerosCoreBase.WhenNotPausedOnly.selector);
+        vm.expectRevert(KlerosCore.WhenNotPausedOnly.selector);
         core.execute(disputeID, 0, 1);
         vm.prank(owner);
         core.unpause();
@@ -98,16 +98,16 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
         vm.expectEmit(true, true, true, true);
         emit SortitionModuleBase.StakeLocked(staker1, 1000, true);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.TokenAndETHShift(staker1, disputeID, 0, 0, -int256(1000), 0, IERC20(address(0)));
+        emit KlerosCore.TokenAndETHShift(staker1, disputeID, 0, 0, -int256(1000), 0, IERC20(address(0)));
         // Check iterations for the winning staker to see the shifts
         vm.expectEmit(true, true, true, true);
         emit SortitionModuleBase.StakeLocked(staker2, 0, true);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.TokenAndETHShift(staker2, disputeID, 0, 10000, 0, 0, IERC20(address(0)));
+        emit KlerosCore.TokenAndETHShift(staker2, disputeID, 0, 10000, 0, 0, IERC20(address(0)));
         vm.expectEmit(true, true, true, true);
         emit SortitionModuleBase.StakeLocked(staker2, 0, true);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.TokenAndETHShift(staker2, disputeID, 0, 10000, 0, 0, IERC20(address(0)));
+        emit KlerosCore.TokenAndETHShift(staker2, disputeID, 0, 10000, 0, 0, IERC20(address(0)));
         core.execute(disputeID, 0, 3); // Do 3 iterations to check penalties first
 
         (uint256 totalStaked, uint256 totalLocked, , ) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
@@ -116,23 +116,23 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
         (, totalLocked, , ) = sortitionModule.getJurorBalance(staker2, GENERAL_COURT);
         assertEq(totalLocked, 2000, "Tokens should still be locked for staker2");
 
-        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 0);
+        KlerosCore.Round memory round = core.getRoundInfo(disputeID, 0);
         assertEq(round.repartitions, 3, "Wrong repartitions");
         assertEq(round.pnkPenalties, 1000, "Wrong pnkPenalties");
 
         vm.expectEmit(true, true, true, true);
         emit SortitionModuleBase.StakeLocked(staker1, 0, true);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.TokenAndETHShift(staker1, disputeID, 0, 0, 0, 0, IERC20(address(0)));
+        emit KlerosCore.TokenAndETHShift(staker1, disputeID, 0, 0, 0, 0, IERC20(address(0)));
         // Check iterations for the winning staker to see the shifts
         vm.expectEmit(true, true, true, true);
         emit SortitionModuleBase.StakeLocked(staker2, 1000, true);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.TokenAndETHShift(staker2, disputeID, 0, 10000, 500, 0.045 ether, IERC20(address(0)));
+        emit KlerosCore.TokenAndETHShift(staker2, disputeID, 0, 10000, 500, 0.045 ether, IERC20(address(0)));
         vm.expectEmit(true, true, true, true);
         emit SortitionModuleBase.StakeLocked(staker2, 1000, true);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.TokenAndETHShift(staker2, disputeID, 0, 10000, 500, 0.045 ether, IERC20(address(0)));
+        emit KlerosCore.TokenAndETHShift(staker2, disputeID, 0, 10000, 500, 0.045 ether, IERC20(address(0)));
         core.execute(disputeID, 0, 10); // Finish the iterations. We need only 3 but check that it corrects the count.
 
         (, totalLocked, , ) = sortitionModule.getJurorBalance(staker2, GENERAL_COURT);
@@ -201,10 +201,10 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
         uint256 ownerTokenBalance = pinakion.balanceOf(owner);
 
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.LeftoverRewardSent(disputeID, 0, 3000, 0.09 ether, IERC20(address(0)));
+        emit KlerosCore.LeftoverRewardSent(disputeID, 0, 3000, 0.09 ether, IERC20(address(0)));
         core.execute(disputeID, 0, 3);
 
-        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 0);
+        KlerosCore.Round memory round = core.getRoundInfo(disputeID, 0);
         assertEq(round.pnkPenalties, 3000, "Wrong pnkPenalties");
         assertEq(round.sumFeeRewardPaid, 0, "Wrong sumFeeRewardPaid");
         assertEq(round.sumPnkRewardPaid, 0, "Wrong sumPnkRewardPaid");
@@ -471,7 +471,7 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
         assertEq(totalStaked, 1000, "Wrong amount staked");
         assertEq(totalLocked, 0, "Should be fully unlocked");
 
-        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 0);
+        KlerosCore.Round memory round = core.getRoundInfo(disputeID, 0);
         assertEq(round.pnkPenalties, 0, "Wrong pnkPenalties");
         assertEq(round.sumFeeRewardPaid, 0.09 ether, "Wrong sumFeeRewardPaid");
         assertEq(round.sumPnkRewardPaid, 0, "Wrong sumPnkRewardPaid"); // No penalty so no rewards in pnk
@@ -480,7 +480,7 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
         assertEq(pinakion.balanceOf(address(core)), 1000, "Wrong token balance of the core");
         assertEq(pinakion.balanceOf(staker1), 999999999999999000, "Wrong token balance of staker1");
 
-        vm.expectRevert(KlerosCoreBase.SortitionModuleOnly.selector);
+        vm.expectRevert(KlerosCore.SortitionModuleOnly.selector);
         vm.prank(owner);
         core.transferBySortitionModule(staker1, 1000);
 
@@ -537,12 +537,12 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
 
         // Check only once per penalty and per reward
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.TokenAndETHShift(staker1, disputeID, 0, 10000, 0, 0, feeToken);
+        emit KlerosCore.TokenAndETHShift(staker1, disputeID, 0, 10000, 0, 0, feeToken);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.TokenAndETHShift(staker1, disputeID, 0, 10000, 0, 0.06 ether, feeToken);
+        emit KlerosCore.TokenAndETHShift(staker1, disputeID, 0, 10000, 0, 0.06 ether, feeToken);
         core.execute(disputeID, 0, 6);
 
-        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 0);
+        KlerosCore.Round memory round = core.getRoundInfo(disputeID, 0);
         assertEq(round.sumFeeRewardPaid, 0.18 ether, "Wrong sumFeeRewardPaid");
 
         assertEq(feeToken.balanceOf(address(core)), 0, "Wrong fee token balance of the core");
@@ -584,10 +584,10 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
         core.passPeriod(disputeID); // Execution
 
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.LeftoverRewardSent(disputeID, 0, 3000, 0.18 ether, feeToken);
+        emit KlerosCore.LeftoverRewardSent(disputeID, 0, 3000, 0.18 ether, feeToken);
         core.execute(disputeID, 0, 10); // Put more iterations to check that they're capped
 
-        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 0);
+        KlerosCore.Round memory round = core.getRoundInfo(disputeID, 0);
         assertEq(round.pnkPenalties, 3000, "Wrong pnkPenalties");
         assertEq(round.sumFeeRewardPaid, 0, "Wrong sumFeeRewardPaid");
         assertEq(round.sumPnkRewardPaid, 0, "Wrong sumPnkRewardPaid");
@@ -624,19 +624,19 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
         disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
         core.passPeriod(disputeID); // Appeal
 
-        vm.expectRevert(KlerosCoreBase.NotExecutionPeriod.selector);
+        vm.expectRevert(KlerosCore.NotExecutionPeriod.selector);
         core.executeRuling(disputeID);
 
         vm.warp(block.timestamp + timesPerPeriod[3]);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.execution);
+        emit KlerosCore.NewPeriod(disputeID, KlerosCore.Period.execution);
         core.passPeriod(disputeID); // Execution
 
-        (, , KlerosCoreBase.Period period, , uint256 lastPeriodChange) = core.disputes(disputeID);
-        assertEq(uint256(period), uint256(KlerosCoreBase.Period.execution), "Wrong period");
+        (, , KlerosCore.Period period, , uint256 lastPeriodChange) = core.disputes(disputeID);
+        assertEq(uint256(period), uint256(KlerosCore.Period.execution), "Wrong period");
         assertEq(lastPeriodChange, block.timestamp, "Wrong lastPeriodChange");
 
-        vm.expectRevert(KlerosCoreBase.DisputePeriodIsFinal.selector);
+        vm.expectRevert(KlerosCore.DisputePeriodIsFinal.selector);
         core.passPeriod(disputeID);
 
         vm.expectEmit(true, true, true, true);
@@ -645,7 +645,7 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
         emit IArbitrableV2.Ruling(core, disputeID, 2);
         core.executeRuling(disputeID);
 
-        vm.expectRevert(KlerosCoreBase.RulingAlreadyExecuted.selector);
+        vm.expectRevert(KlerosCore.RulingAlreadyExecuted.selector);
         core.executeRuling(disputeID);
 
         (, , , bool ruled, ) = core.disputes(disputeID);
diff --git a/contracts/test/foundry/KlerosCore_Governance.t.sol b/contracts/test/foundry/KlerosCore_Governance.t.sol
index f34d64e79..53d438c4d 100644
--- a/contracts/test/foundry/KlerosCore_Governance.t.sol
+++ b/contracts/test/foundry/KlerosCore_Governance.t.sol
@@ -2,8 +2,8 @@
 pragma solidity ^0.8.24;
 
 import {KlerosCore_TestBase} from "./KlerosCore_TestBase.sol";
-import {KlerosCoreBase} from "../../src/arbitration/KlerosCoreBase.sol";
-import {IArbitratorV2} from "../../src/arbitration/KlerosCoreBase.sol";
+import {KlerosCore} from "../../src/arbitration/KlerosCore.sol";
+import {IArbitratorV2} from "../../src/arbitration/KlerosCore.sol";
 import {DisputeKitSybilResistant} from "../../src/arbitration/dispute-kits/DisputeKitSybilResistant.sol";
 import {SortitionModuleMock} from "../../src/test/SortitionModuleMock.sol";
 import {PNK} from "../../src/token/PNK.sol";
@@ -13,27 +13,27 @@ import "../../src/libraries/Constants.sol";
 /// @dev Tests for KlerosCore governance functions (owner/guardian operations)
 contract KlerosCore_GovernanceTest is KlerosCore_TestBase {
     function test_pause() public {
-        vm.expectRevert(KlerosCoreBase.GuardianOrOwnerOnly.selector);
+        vm.expectRevert(KlerosCore.GuardianOrOwnerOnly.selector);
         vm.prank(other);
         core.pause();
         // Note that we must explicitly switch to the owner/guardian address to make the call, otherwise Foundry treats UUPS proxy as msg.sender.
         vm.prank(guardian);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.Paused();
+        emit KlerosCore.Paused();
         core.pause();
         assertEq(core.paused(), true, "Wrong paused value");
         // Switch between owner and guardian to test both. WhenNotPausedOnly modifier is triggered after owner's check.
         vm.prank(owner);
-        vm.expectRevert(KlerosCoreBase.WhenNotPausedOnly.selector);
+        vm.expectRevert(KlerosCore.WhenNotPausedOnly.selector);
         core.pause();
     }
 
     function test_unpause() public {
-        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
+        vm.expectRevert(KlerosCore.OwnerOnly.selector);
         vm.prank(other);
         core.unpause();
 
-        vm.expectRevert(KlerosCoreBase.WhenPausedOnly.selector);
+        vm.expectRevert(KlerosCore.WhenPausedOnly.selector);
         vm.prank(owner);
         core.unpause();
 
@@ -41,18 +41,18 @@ contract KlerosCore_GovernanceTest is KlerosCore_TestBase {
         core.pause();
         vm.prank(owner);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.Unpaused();
+        emit KlerosCore.Unpaused();
         core.unpause();
         assertEq(core.paused(), false, "Wrong paused value");
     }
 
     function test_executeOwnerProposal() public {
         bytes memory data = abi.encodeWithSignature("changeOwner(address)", other);
-        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
+        vm.expectRevert(KlerosCore.OwnerOnly.selector);
         vm.prank(other);
         core.executeOwnerProposal(address(core), 0, data);
 
-        vm.expectRevert(KlerosCoreBase.UnsuccessfulCall.selector);
+        vm.expectRevert(KlerosCore.UnsuccessfulCall.selector);
         vm.prank(owner);
         core.executeOwnerProposal(address(core), 0, data); // It'll fail because the core is not its own owner
 
@@ -64,7 +64,7 @@ contract KlerosCore_GovernanceTest is KlerosCore_TestBase {
     }
 
     function test_changeOwner() public {
-        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
+        vm.expectRevert(KlerosCore.OwnerOnly.selector);
         vm.prank(other);
         core.changeOwner(payable(other));
         vm.prank(owner);
@@ -73,7 +73,7 @@ contract KlerosCore_GovernanceTest is KlerosCore_TestBase {
     }
 
     function test_changeGuardian() public {
-        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
+        vm.expectRevert(KlerosCore.OwnerOnly.selector);
         vm.prank(other);
         core.changeGuardian(other);
         vm.prank(owner);
@@ -83,7 +83,7 @@ contract KlerosCore_GovernanceTest is KlerosCore_TestBase {
 
     function test_changePinakion() public {
         PNK fakePNK = new PNK();
-        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
+        vm.expectRevert(KlerosCore.OwnerOnly.selector);
         vm.prank(other);
         core.changePinakion(fakePNK);
         vm.prank(owner);
@@ -92,7 +92,7 @@ contract KlerosCore_GovernanceTest is KlerosCore_TestBase {
     }
 
     function test_changeJurorProsecutionModule() public {
-        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
+        vm.expectRevert(KlerosCore.OwnerOnly.selector);
         vm.prank(other);
         core.changeJurorProsecutionModule(other);
         vm.prank(owner);
@@ -102,7 +102,7 @@ contract KlerosCore_GovernanceTest is KlerosCore_TestBase {
 
     function test_changeSortitionModule() public {
         SortitionModuleMock fakeSM = new SortitionModuleMock();
-        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
+        vm.expectRevert(KlerosCore.OwnerOnly.selector);
         vm.prank(other);
         core.changeSortitionModule(fakeSM);
         vm.prank(owner);
@@ -112,19 +112,19 @@ contract KlerosCore_GovernanceTest is KlerosCore_TestBase {
 
     function test_addNewDisputeKit() public {
         DisputeKitSybilResistant newDK = new DisputeKitSybilResistant();
-        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
+        vm.expectRevert(KlerosCore.OwnerOnly.selector);
         vm.prank(other);
         core.addNewDisputeKit(newDK);
         vm.prank(owner);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.DisputeKitCreated(2, newDK);
+        emit KlerosCore.DisputeKitCreated(2, newDK);
         core.addNewDisputeKit(newDK);
         assertEq(address(core.disputeKits(2)), address(newDK), "Wrong address of new DK");
         assertEq(core.getDisputeKitsLength(), 3, "Wrong DK array length");
     }
 
     function test_createCourt() public {
-        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
+        vm.expectRevert(KlerosCore.OwnerOnly.selector);
         vm.prank(other);
         uint256[] memory supportedDK = new uint256[](2);
         supportedDK[0] = DISPUTE_KIT_CLASSIC;
@@ -141,7 +141,7 @@ contract KlerosCore_GovernanceTest is KlerosCore_TestBase {
             supportedDK
         );
 
-        vm.expectRevert(KlerosCoreBase.MinStakeLowerThanParentCourt.selector);
+        vm.expectRevert(KlerosCore.MinStakeLowerThanParentCourt.selector);
         vm.prank(owner);
         core.createCourt(
             GENERAL_COURT,
@@ -155,7 +155,7 @@ contract KlerosCore_GovernanceTest is KlerosCore_TestBase {
             supportedDK
         );
 
-        vm.expectRevert(KlerosCoreBase.UnsupportedDisputeKit.selector);
+        vm.expectRevert(KlerosCore.UnsupportedDisputeKit.selector);
         vm.prank(owner);
         uint256[] memory emptySupportedDK = new uint256[](0);
         core.createCourt(
@@ -170,7 +170,7 @@ contract KlerosCore_GovernanceTest is KlerosCore_TestBase {
             emptySupportedDK
         );
 
-        vm.expectRevert(KlerosCoreBase.InvalidForkingCourtAsParent.selector);
+        vm.expectRevert(KlerosCore.InvalidForkingCourtAsParent.selector);
         vm.prank(owner);
         core.createCourt(
             FORKING_COURT,
@@ -187,7 +187,7 @@ contract KlerosCore_GovernanceTest is KlerosCore_TestBase {
         uint256[] memory badSupportedDK = new uint256[](2);
         badSupportedDK[0] = NULL_DISPUTE_KIT; // Include NULL_DK to check that it reverts
         badSupportedDK[1] = DISPUTE_KIT_CLASSIC;
-        vm.expectRevert(KlerosCoreBase.WrongDisputeKitIndex.selector);
+        vm.expectRevert(KlerosCore.WrongDisputeKitIndex.selector);
         vm.prank(owner);
         core.createCourt(
             GENERAL_COURT,
@@ -203,7 +203,7 @@ contract KlerosCore_GovernanceTest is KlerosCore_TestBase {
 
         badSupportedDK[0] = DISPUTE_KIT_CLASSIC;
         badSupportedDK[1] = 2; // Check out of bounds index
-        vm.expectRevert(KlerosCoreBase.WrongDisputeKitIndex.selector);
+        vm.expectRevert(KlerosCore.WrongDisputeKitIndex.selector);
         vm.prank(owner);
         core.createCourt(
             GENERAL_COURT,
@@ -223,7 +223,7 @@ contract KlerosCore_GovernanceTest is KlerosCore_TestBase {
         core.addNewDisputeKit(newDK);
         badSupportedDK = new uint256[](1);
         badSupportedDK[0] = 2; // Include only sybil resistant dk
-        vm.expectRevert(KlerosCoreBase.MustSupportDisputeKitClassic.selector);
+        vm.expectRevert(KlerosCore.MustSupportDisputeKitClassic.selector);
         vm.prank(owner);
         core.createCourt(
             GENERAL_COURT,
@@ -239,11 +239,11 @@ contract KlerosCore_GovernanceTest is KlerosCore_TestBase {
 
         vm.prank(owner);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.DisputeKitEnabled(2, DISPUTE_KIT_CLASSIC, true);
+        emit KlerosCore.DisputeKitEnabled(2, DISPUTE_KIT_CLASSIC, true);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.DisputeKitEnabled(2, 2, true);
+        emit KlerosCore.DisputeKitEnabled(2, 2, true);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.CourtCreated(
+        emit KlerosCore.CourtCreated(
             2,
             GENERAL_COURT,
             true,
@@ -299,7 +299,7 @@ contract KlerosCore_GovernanceTest is KlerosCore_TestBase {
             supportedDK
         );
 
-        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
+        vm.expectRevert(KlerosCore.OwnerOnly.selector);
         vm.prank(other);
         core.changeCourtParameters(
             GENERAL_COURT,
@@ -310,7 +310,7 @@ contract KlerosCore_GovernanceTest is KlerosCore_TestBase {
             50, // jurors for jump
             [uint256(10), uint256(20), uint256(30), uint256(40)] // Times per period
         );
-        vm.expectRevert(KlerosCoreBase.MinStakeLowerThanParentCourt.selector);
+        vm.expectRevert(KlerosCore.MinStakeLowerThanParentCourt.selector);
         vm.prank(owner);
         // Min stake of a parent became higher than of a child
         core.changeCourtParameters(
@@ -323,7 +323,7 @@ contract KlerosCore_GovernanceTest is KlerosCore_TestBase {
             [uint256(10), uint256(20), uint256(30), uint256(40)] // Times per period
         );
         // Min stake of a child became lower than of a parent
-        vm.expectRevert(KlerosCoreBase.MinStakeLowerThanParentCourt.selector);
+        vm.expectRevert(KlerosCore.MinStakeLowerThanParentCourt.selector);
         vm.prank(owner);
         core.changeCourtParameters(
             newCourtID,
@@ -337,7 +337,7 @@ contract KlerosCore_GovernanceTest is KlerosCore_TestBase {
 
         vm.prank(owner);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.CourtModified(
+        emit KlerosCore.CourtModified(
             GENERAL_COURT,
             true,
             2000,
@@ -366,43 +366,43 @@ contract KlerosCore_GovernanceTest is KlerosCore_TestBase {
         vm.prank(owner);
         core.addNewDisputeKit(newDK);
 
-        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
+        vm.expectRevert(KlerosCore.OwnerOnly.selector);
         vm.prank(other);
         uint256[] memory supportedDK = new uint256[](1);
         supportedDK[0] = newDkID;
         core.enableDisputeKits(GENERAL_COURT, supportedDK, true);
 
-        vm.expectRevert(KlerosCoreBase.WrongDisputeKitIndex.selector);
+        vm.expectRevert(KlerosCore.WrongDisputeKitIndex.selector);
         vm.prank(owner);
         supportedDK[0] = NULL_DISPUTE_KIT;
         core.enableDisputeKits(GENERAL_COURT, supportedDK, true);
 
-        vm.expectRevert(KlerosCoreBase.WrongDisputeKitIndex.selector);
+        vm.expectRevert(KlerosCore.WrongDisputeKitIndex.selector);
         vm.prank(owner);
         supportedDK[0] = 3; // Out of bounds
         core.enableDisputeKits(GENERAL_COURT, supportedDK, true);
 
-        vm.expectRevert(KlerosCoreBase.CannotDisableClassicDK.selector);
+        vm.expectRevert(KlerosCore.CannotDisableClassicDK.selector);
         vm.prank(owner);
         supportedDK[0] = DISPUTE_KIT_CLASSIC;
         core.enableDisputeKits(GENERAL_COURT, supportedDK, false);
 
         vm.prank(owner);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.DisputeKitEnabled(GENERAL_COURT, newDkID, true);
+        emit KlerosCore.DisputeKitEnabled(GENERAL_COURT, newDkID, true);
         supportedDK[0] = newDkID;
         core.enableDisputeKits(GENERAL_COURT, supportedDK, true);
         assertEq(core.isSupported(GENERAL_COURT, newDkID), true, "New DK should be supported by General court");
 
         vm.prank(owner);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.DisputeKitEnabled(GENERAL_COURT, newDkID, false);
+        emit KlerosCore.DisputeKitEnabled(GENERAL_COURT, newDkID, false);
         core.enableDisputeKits(GENERAL_COURT, supportedDK, false);
         assertEq(core.isSupported(GENERAL_COURT, newDkID), false, "New DK should be disabled in General court");
     }
 
     function test_changeAcceptedFeeTokens() public {
-        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
+        vm.expectRevert(KlerosCore.OwnerOnly.selector);
         vm.prank(other);
         core.changeAcceptedFeeTokens(feeToken, true);
 
@@ -418,7 +418,7 @@ contract KlerosCore_GovernanceTest is KlerosCore_TestBase {
     }
 
     function test_changeCurrencyRates() public {
-        vm.expectRevert(KlerosCoreBase.OwnerOnly.selector);
+        vm.expectRevert(KlerosCore.OwnerOnly.selector);
         vm.prank(other);
         core.changeCurrencyRates(feeToken, 100, 200);
 
diff --git a/contracts/test/foundry/KlerosCore_Initialization.t.sol b/contracts/test/foundry/KlerosCore_Initialization.t.sol
index d35190870..d9113bbb7 100644
--- a/contracts/test/foundry/KlerosCore_Initialization.t.sol
+++ b/contracts/test/foundry/KlerosCore_Initialization.t.sol
@@ -2,7 +2,7 @@
 pragma solidity ^0.8.24;
 
 import {KlerosCore_TestBase} from "./KlerosCore_TestBase.sol";
-import {KlerosCoreBase} from "../../src/arbitration/KlerosCoreBase.sol";
+import {KlerosCore, IERC721} from "../../src/arbitration/KlerosCore.sol";
 import {KlerosCoreMock} from "../../src/test/KlerosCoreMock.sol";
 import {DisputeKitClassic} from "../../src/arbitration/dispute-kits/DisputeKitClassic.sol";
 import {SortitionModuleMock} from "../../src/test/SortitionModuleMock.sol";
@@ -138,12 +138,12 @@ contract KlerosCore_InitializationTest is KlerosCore_TestBase {
 
         KlerosCoreMock newCore = KlerosCoreMock(address(proxyCore));
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.DisputeKitCreated(DISPUTE_KIT_CLASSIC, newDisputeKit);
+        emit KlerosCore.DisputeKitCreated(DISPUTE_KIT_CLASSIC, newDisputeKit);
         vm.expectEmit(true, true, true, true);
 
         uint256[] memory supportedDK = new uint256[](1);
         supportedDK[0] = DISPUTE_KIT_CLASSIC;
-        emit KlerosCoreBase.CourtCreated(
+        emit KlerosCore.CourtCreated(
             GENERAL_COURT,
             FORKING_COURT,
             false,
@@ -155,7 +155,7 @@ contract KlerosCore_InitializationTest is KlerosCore_TestBase {
             supportedDK
         );
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.DisputeKitEnabled(GENERAL_COURT, DISPUTE_KIT_CLASSIC, true);
+        emit KlerosCore.DisputeKitEnabled(GENERAL_COURT, DISPUTE_KIT_CLASSIC, true);
         newCore.initialize(
             newOwner,
             newGuardian,
@@ -167,7 +167,8 @@ contract KlerosCore_InitializationTest is KlerosCore_TestBase {
             newTimesPerPeriod,
             newSortitionExtraData,
             newSortitionModule,
-            address(wNative)
+            address(wNative),
+            IERC721(address(0))
         );
     }
 }
diff --git a/contracts/test/foundry/KlerosCore_Staking.t.sol b/contracts/test/foundry/KlerosCore_Staking.t.sol
index a315debcf..805b8ae7e 100644
--- a/contracts/test/foundry/KlerosCore_Staking.t.sol
+++ b/contracts/test/foundry/KlerosCore_Staking.t.sol
@@ -2,7 +2,7 @@
 pragma solidity ^0.8.24;
 
 import {KlerosCore_TestBase} from "./KlerosCore_TestBase.sol";
-import {KlerosCoreBase} from "../../src/arbitration/KlerosCoreBase.sol";
+import {KlerosCore} from "../../src/arbitration/KlerosCore.sol";
 import {SortitionModuleBase} from "../../src/arbitration/SortitionModuleBase.sol";
 import {ISortitionModule} from "../../src/arbitration/interfaces/ISortitionModule.sol";
 import {IKlerosCore, KlerosCoreSnapshotProxy} from "../../src/arbitration/view/KlerosCoreSnapshotProxy.sol";
@@ -14,26 +14,26 @@ contract KlerosCore_StakingTest is KlerosCore_TestBase {
     function test_setStake_increase() public {
         vm.prank(owner);
         core.pause();
-        vm.expectRevert(KlerosCoreBase.WhenNotPausedOnly.selector);
+        vm.expectRevert(KlerosCore.WhenNotPausedOnly.selector);
         vm.prank(staker1);
         core.setStake(GENERAL_COURT, 1000);
         vm.prank(owner);
         core.unpause();
 
-        vm.expectRevert(KlerosCoreBase.StakingNotPossibleInThisCourt.selector);
+        vm.expectRevert(KlerosCore.StakingNotPossibleInThisCourt.selector);
         vm.prank(staker1);
         core.setStake(FORKING_COURT, 1000);
 
         uint96 badCourtID = 2;
-        vm.expectRevert(KlerosCoreBase.StakingNotPossibleInThisCourt.selector);
+        vm.expectRevert(KlerosCore.StakingNotPossibleInThisCourt.selector);
         vm.prank(staker1);
         core.setStake(badCourtID, 1000);
 
-        vm.expectRevert(KlerosCoreBase.StakingLessThanCourtMinStake.selector);
+        vm.expectRevert(KlerosCore.StakingLessThanCourtMinStake.selector);
         vm.prank(staker1);
         core.setStake(GENERAL_COURT, 800);
 
-        vm.expectRevert(KlerosCoreBase.StakingZeroWhenNoStake.selector);
+        vm.expectRevert(KlerosCore.StakingZeroWhenNoStake.selector);
         vm.prank(staker1);
         core.setStake(GENERAL_COURT, 0);
 
@@ -58,7 +58,7 @@ contract KlerosCore_StakingTest is KlerosCore_TestBase {
         assertEq(pinakion.balanceOf(staker1), 999999999999998999, "Wrong token balance of staker1"); // 1 eth - 1001 wei
         assertEq(pinakion.allowance(staker1, address(core)), 999999999999998999, "Wrong allowance for staker1");
 
-        vm.expectRevert(KlerosCoreBase.StakingTransferFailed.selector); // This  error will be caught because owner didn't approve any tokens for KlerosCore
+        vm.expectRevert(KlerosCore.StakingTransferFailed.selector); // This  error will be caught because owner didn't approve any tokens for KlerosCore
         vm.prank(owner);
         core.setStake(GENERAL_COURT, 1000);
 
@@ -111,7 +111,7 @@ contract KlerosCore_StakingTest is KlerosCore_TestBase {
         vm.prank(address(core));
         pinakion.transfer(staker1, 1); // Manually send 1 token to make the withdrawal fail
 
-        vm.expectRevert(KlerosCoreBase.UnstakingTransferFailed.selector);
+        vm.expectRevert(KlerosCore.UnstakingTransferFailed.selector);
         vm.prank(staker1);
         core.setStake(GENERAL_COURT, 0);
 
@@ -165,7 +165,7 @@ contract KlerosCore_StakingTest is KlerosCore_TestBase {
         assertEq(courts.length, 4, "Wrong courts count");
 
         uint96 excessiveCourtID = 5;
-        vm.expectRevert(KlerosCoreBase.StakingInTooManyCourts.selector);
+        vm.expectRevert(KlerosCore.StakingInTooManyCourts.selector);
         vm.prank(staker1);
         core.setStake(excessiveCourtID, 2000);
     }
@@ -416,7 +416,7 @@ contract KlerosCore_StakingTest is KlerosCore_TestBase {
 
     function test_setStakeBySortitionModule() public {
         // Note that functionality of this function was checked during delayed stakes execution
-        vm.expectRevert(KlerosCoreBase.SortitionModuleOnly.selector);
+        vm.expectRevert(KlerosCore.SortitionModuleOnly.selector);
         vm.prank(owner);
         core.setStakeBySortitionModule(staker1, GENERAL_COURT, 1000);
     }
diff --git a/contracts/test/foundry/KlerosCore_TestBase.sol b/contracts/test/foundry/KlerosCore_TestBase.sol
index 762d71db9..612db5bb7 100644
--- a/contracts/test/foundry/KlerosCore_TestBase.sol
+++ b/contracts/test/foundry/KlerosCore_TestBase.sol
@@ -3,8 +3,8 @@ pragma solidity ^0.8.24;
 
 import {Test} from "forge-std/Test.sol";
 import {console} from "forge-std/console.sol"; // Import the console for logging
-import {KlerosCoreMock, KlerosCoreBase} from "../../src/test/KlerosCoreMock.sol";
-import {IArbitratorV2} from "../../src/arbitration/KlerosCoreBase.sol";
+import {KlerosCoreMock, KlerosCore, IERC721} from "../../src/test/KlerosCoreMock.sol";
+import {IArbitratorV2} from "../../src/arbitration/KlerosCore.sol";
 import {IDisputeKit} from "../../src/arbitration/interfaces/IDisputeKit.sol";
 import {DisputeKitClassic, DisputeKitClassicBase} from "../../src/arbitration/dispute-kits/DisputeKitClassic.sol";
 import {DisputeKitSybilResistant} from "../../src/arbitration/dispute-kits/DisputeKitSybilResistant.sol";
@@ -151,7 +151,8 @@ abstract contract KlerosCore_TestBase is Test {
             timesPerPeriod,
             sortitionExtraData,
             sortitionModule,
-            address(wNative)
+            address(wNative),
+            IERC721(address(0))
         );
         vm.prank(staker1);
         pinakion.approve(address(core), 1 ether);
diff --git a/contracts/test/foundry/KlerosCore_Voting.t.sol b/contracts/test/foundry/KlerosCore_Voting.t.sol
index 7d84f18e1..504c9c644 100644
--- a/contracts/test/foundry/KlerosCore_Voting.t.sol
+++ b/contracts/test/foundry/KlerosCore_Voting.t.sol
@@ -2,7 +2,7 @@
 pragma solidity ^0.8.24;
 
 import {KlerosCore_TestBase} from "./KlerosCore_TestBase.sol";
-import {KlerosCoreBase} from "../../src/arbitration/KlerosCoreBase.sol";
+import {KlerosCore} from "../../src/arbitration/KlerosCore.sol";
 import {DisputeKitClassic, DisputeKitClassicBase} from "../../src/arbitration/dispute-kits/DisputeKitClassic.sol";
 import {IDisputeKit} from "../../src/arbitration/interfaces/IDisputeKit.sol";
 import {UUPSProxy} from "../../src/proxy/UUPSProxy.sol";
@@ -44,17 +44,17 @@ contract KlerosCore_VotingTest is KlerosCore_TestBase {
         vm.expectRevert(DisputeKitClassicBase.NotCommitPeriod.selector);
         disputeKit.castCommit(disputeID, voteIDs, commit);
 
-        vm.expectRevert(KlerosCoreBase.EvidenceNotPassedAndNotAppeal.selector);
+        vm.expectRevert(KlerosCore.EvidenceNotPassedAndNotAppeal.selector);
         core.passPeriod(disputeID);
         vm.warp(block.timestamp + timesPerPeriod[0]);
 
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.commit);
+        emit KlerosCore.NewPeriod(disputeID, KlerosCore.Period.commit);
         core.passPeriod(disputeID);
 
-        (, , KlerosCoreBase.Period period, , uint256 lastPeriodChange) = core.disputes(disputeID);
+        (, , KlerosCore.Period period, , uint256 lastPeriodChange) = core.disputes(disputeID);
 
-        assertEq(uint256(period), uint256(KlerosCoreBase.Period.commit), "Wrong period");
+        assertEq(uint256(period), uint256(KlerosCore.Period.commit), "Wrong period");
         assertEq(lastPeriodChange, block.timestamp, "Wrong lastPeriodChange");
 
         vm.prank(staker1);
@@ -149,12 +149,12 @@ contract KlerosCore_VotingTest is KlerosCore_TestBase {
         vm.warp(block.timestamp + timesPerPeriod[0]);
         core.passPeriod(disputeID); // Commit
 
-        vm.expectRevert(KlerosCoreBase.CommitPeriodNotPassed.selector);
+        vm.expectRevert(KlerosCore.CommitPeriodNotPassed.selector);
         core.passPeriod(disputeID);
 
         vm.warp(block.timestamp + timesPerPeriod[1]);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.vote);
+        emit KlerosCore.NewPeriod(disputeID, KlerosCore.Period.vote);
         core.passPeriod(disputeID);
     }
 
@@ -178,18 +178,18 @@ contract KlerosCore_VotingTest is KlerosCore_TestBase {
         vm.expectRevert(DisputeKitClassicBase.NotVotePeriod.selector);
         disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ"); // Leave salt empty as not needed
 
-        vm.expectRevert(KlerosCoreBase.DisputeStillDrawing.selector);
+        vm.expectRevert(KlerosCore.DisputeStillDrawing.selector);
         core.passPeriod(disputeID);
 
         core.draw(disputeID, 1); // Draw the last juror
 
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.vote);
+        emit KlerosCore.NewPeriod(disputeID, KlerosCore.Period.vote);
         core.passPeriod(disputeID); // Vote
 
-        (, , KlerosCoreBase.Period period, , uint256 lastPeriodChange) = core.disputes(disputeID);
+        (, , KlerosCore.Period period, , uint256 lastPeriodChange) = core.disputes(disputeID);
 
-        assertEq(uint256(period), uint256(KlerosCoreBase.Period.vote), "Wrong period");
+        assertEq(uint256(period), uint256(KlerosCore.Period.vote), "Wrong period");
         assertEq(lastPeriodChange, block.timestamp, "Wrong lastPeriodChange");
 
         vm.prank(staker1);
@@ -250,7 +250,7 @@ contract KlerosCore_VotingTest is KlerosCore_TestBase {
         assertEq(totalVoted, 2, "totalVoted should be 2");
         assertEq(choiceCount, 1, "choiceCount should be 1 for first choice");
 
-        vm.expectRevert(KlerosCoreBase.VotePeriodNotPassed.selector);
+        vm.expectRevert(KlerosCore.VotePeriodNotPassed.selector);
         core.passPeriod(disputeID);
 
         voteIDs = new uint256[](1);
@@ -285,14 +285,14 @@ contract KlerosCore_VotingTest is KlerosCore_TestBase {
         vm.warp(block.timestamp + timesPerPeriod[0]);
         core.passPeriod(disputeID); // Votes
 
-        vm.expectRevert(KlerosCoreBase.VotePeriodNotPassed.selector);
+        vm.expectRevert(KlerosCore.VotePeriodNotPassed.selector);
         core.passPeriod(disputeID);
 
         vm.warp(block.timestamp + timesPerPeriod[2]);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.AppealPossible(disputeID, arbitrable);
+        emit KlerosCore.AppealPossible(disputeID, arbitrable);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.appeal);
+        emit KlerosCore.NewPeriod(disputeID, KlerosCore.Period.appeal);
         core.passPeriod(disputeID);
     }
 
@@ -380,7 +380,7 @@ contract KlerosCore_VotingTest is KlerosCore_TestBase {
 
         // Should pass period by counting only committed votes.
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.NewPeriod(disputeID, KlerosCoreBase.Period.appeal);
+        emit KlerosCore.NewPeriod(disputeID, KlerosCore.Period.appeal);
         core.passPeriod(disputeID);
     }
 
@@ -407,7 +407,7 @@ contract KlerosCore_VotingTest is KlerosCore_TestBase {
 
         vm.prank(owner);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCoreBase.DisputeKitEnabled(GENERAL_COURT, newDkID, true);
+        emit KlerosCore.DisputeKitEnabled(GENERAL_COURT, newDkID, true);
         supportedDK[0] = newDkID;
         core.enableDisputeKits(GENERAL_COURT, supportedDK, true);
         assertEq(core.isSupported(GENERAL_COURT, newDkID), true, "New DK should be supported by General court");
@@ -434,7 +434,7 @@ contract KlerosCore_VotingTest is KlerosCore_TestBase {
         vm.warp(block.timestamp + rngLookahead);
         sortitionModule.passPhase(); // Drawing phase
 
-        KlerosCoreBase.Round memory round = core.getRoundInfo(disputeID, 0);
+        KlerosCore.Round memory round = core.getRoundInfo(disputeID, 0);
         assertEq(round.disputeKitID, newDkID, "Wrong DK ID");
 
         core.draw(disputeID, DEFAULT_NB_OF_JURORS);

From 40714da2b2122a34b10047f9a639b17fc6b18718 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 4 Sep 2025 18:55:39 +0100
Subject: [PATCH 096/175] feat: only SortitionModule, no more
 SortitionModuleBase and SortitionModuleNeo

---
 contracts/src/arbitration/SortitionModule.sol | 587 +++++++++++++++++-
 .../src/arbitration/SortitionModuleBase.sol   | 572 -----------------
 .../src/arbitration/SortitionModuleNeo.sol    | 100 ---
 .../test/foundry/KlerosCore_Drawing.t.sol     |   4 +-
 .../test/foundry/KlerosCore_Execution.t.sol   |  30 +-
 .../foundry/KlerosCore_Initialization.t.sol   |   6 +-
 contracts/test/foundry/KlerosCore_RNG.t.sol   |   4 +-
 .../test/foundry/KlerosCore_Staking.t.sol     |  24 +-
 .../test/foundry/KlerosCore_TestBase.sol      |   8 +-
 9 files changed, 622 insertions(+), 713 deletions(-)
 delete mode 100644 contracts/src/arbitration/SortitionModuleBase.sol
 delete mode 100644 contracts/src/arbitration/SortitionModuleNeo.sol

diff --git a/contracts/src/arbitration/SortitionModule.sol b/contracts/src/arbitration/SortitionModule.sol
index bd0f6e007..8c0f4de86 100644
--- a/contracts/src/arbitration/SortitionModule.sol
+++ b/contracts/src/arbitration/SortitionModule.sol
@@ -2,13 +2,98 @@
 
 pragma solidity ^0.8.24;
 
-import {SortitionModuleBase, KlerosCore, IRNG} from "./SortitionModuleBase.sol";
+import {KlerosCore} from "./KlerosCore.sol";
+import {ISortitionModule} from "./interfaces/ISortitionModule.sol";
+import {IDisputeKit} from "./interfaces/IDisputeKit.sol";
+import {Initializable} from "../proxy/Initializable.sol";
+import {UUPSProxiable} from "../proxy/UUPSProxiable.sol";
+import {SortitionTrees, TreeKey, CourtID} from "../libraries/SortitionTrees.sol";
+import {IRNG} from "../rng/IRNG.sol";
+import "../libraries/Constants.sol";
 
 /// @title SortitionModule
 /// @dev A factory of trees that keeps track of staked values for sortition.
-contract SortitionModule is SortitionModuleBase {
+contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
+    using SortitionTrees for SortitionTrees.Tree;
+    using SortitionTrees for mapping(TreeKey key => SortitionTrees.Tree);
+
     string public constant override version = "2.0.0";
 
+    // ************************************* //
+    // *         Enums / Structs           * //
+    // ************************************* //
+
+    struct DelayedStake {
+        address account; // The address of the juror.
+        uint96 courtID; // The ID of the court.
+        uint256 stake; // The new stake.
+        bool alreadyTransferred; // DEPRECATED. True if tokens were already transferred before delayed stake's execution.
+    }
+
+    struct Juror {
+        uint96[] courtIDs; // The IDs of courts where the juror's stake path ends. A stake path is a path from the general court to a court the juror directly staked in using `_setStake`.
+        uint256 stakedPnk; // The juror's total amount of tokens staked in subcourts. PNK balance including locked PNK and penalty deductions.
+        uint256 lockedPnk; // The juror's total amount of tokens locked in disputes.
+    }
+
+    // ************************************* //
+    // *             Storage               * //
+    // ************************************* //
+
+    address public owner; // The owner of the contract.
+    KlerosCore public core; // The core arbitrator contract.
+    Phase public phase; // The current phase.
+    uint256 public minStakingTime; // The time after which the phase can be switched to Drawing if there are open disputes.
+    uint256 public maxDrawingTime; // The time after which the phase can be switched back to Staking.
+    uint256 public lastPhaseChange; // The last time the phase was changed.
+    uint256 public randomNumberRequestBlock; // DEPRECATED: to be removed in the next redeploy
+    uint256 public disputesWithoutJurors; // The number of disputes that have not finished drawing jurors.
+    IRNG public rng; // The random number generator.
+    uint256 public randomNumber; // Random number returned by RNG.
+    uint256 public rngLookahead; // DEPRECATED: to be removed in the next redeploy
+    uint256 public delayedStakeWriteIndex; // The index of the last `delayedStake` item that was written to the array. 0 index is skipped.
+    uint256 public delayedStakeReadIndex; // The index of the next `delayedStake` item that should be processed. Starts at 1 because 0 index is skipped.
+    mapping(TreeKey key => SortitionTrees.Tree) sortitionSumTrees; // The mapping of sortition trees by keys.
+    mapping(address account => Juror) public jurors; // The jurors.
+    mapping(uint256 => DelayedStake) public delayedStakes; // Stores the stakes that were changed during Drawing phase, to update them when the phase is switched to Staking.
+    mapping(address jurorAccount => mapping(uint96 courtId => uint256)) public latestDelayedStakeIndex; // DEPRECATED. Maps the juror to its latest delayed stake. If there is already a delayed stake for this juror then it'll be replaced. latestDelayedStakeIndex[juror][courtID].
+    uint256 public maxStakePerJuror;
+    uint256 public maxTotalStaked;
+    uint256 public totalStaked;
+
+    // ************************************* //
+    // *              Events               * //
+    // ************************************* //
+
+    /// @notice Emitted when a juror stakes in a court.
+    /// @param _address The address of the juror.
+    /// @param _courtID The ID of the court.
+    /// @param _amount The amount of tokens staked in the court.
+    /// @param _amountAllCourts The amount of tokens staked in all courts.
+    event StakeSet(address indexed _address, uint256 _courtID, uint256 _amount, uint256 _amountAllCourts);
+
+    /// @notice Emitted when a juror's stake is delayed.
+    /// @param _address The address of the juror.
+    /// @param _courtID The ID of the court.
+    /// @param _amount The amount of tokens staked in the court.
+    event StakeDelayed(address indexed _address, uint96 indexed _courtID, uint256 _amount);
+
+    /// @notice Emitted when a juror's stake is locked.
+    /// @param _address The address of the juror.
+    /// @param _relativeAmount The amount of tokens locked.
+    /// @param _unlock Whether the stake is locked or unlocked.
+    event StakeLocked(address indexed _address, uint256 _relativeAmount, bool _unlock);
+
+    /// @dev Emitted when leftover PNK is available.
+    /// @param _account The account of the juror.
+    /// @param _amount The amount of PNK available.
+    event LeftoverPNK(address indexed _account, uint256 _amount);
+
+    /// @dev Emitted when leftover PNK is withdrawn.
+    /// @param _account The account of the juror withdrawing PNK.
+    /// @param _amount The amount of PNK withdrawn.
+    event LeftoverPNKWithdrawn(address indexed _account, uint256 _amount);
+
     // ************************************* //
     // *            Constructor            * //
     // ************************************* //
@@ -24,14 +109,40 @@ contract SortitionModule is SortitionModuleBase {
     /// @param _minStakingTime Minimal time to stake
     /// @param _maxDrawingTime Time after which the drawing phase can be switched
     /// @param _rng The random number generator.
+    /// @param _maxStakePerJuror The maximum amount of PNK a juror can stake in a court.
+    /// @param _maxTotalStaked The maximum amount of PNK that can be staked in all courts.
     function initialize(
         address _owner,
         KlerosCore _core,
         uint256 _minStakingTime,
         uint256 _maxDrawingTime,
-        IRNG _rng
+        IRNG _rng,
+        uint256 _maxStakePerJuror,
+        uint256 _maxTotalStaked
     ) external initializer {
-        __SortitionModuleBase_initialize(_owner, _core, _minStakingTime, _maxDrawingTime, _rng);
+        owner = _owner;
+        core = _core;
+        minStakingTime = _minStakingTime;
+        maxDrawingTime = _maxDrawingTime;
+        lastPhaseChange = block.timestamp;
+        rng = _rng;
+        maxStakePerJuror = _maxStakePerJuror;
+        maxTotalStaked = _maxTotalStaked;
+        delayedStakeReadIndex = 1;
+    }
+
+    // ************************************* //
+    // *        Function Modifiers         * //
+    // ************************************* //
+
+    modifier onlyByOwner() {
+        if (owner != msg.sender) revert OwnerOnly();
+        _;
+    }
+
+    modifier onlyByCore() {
+        if (address(core) != msg.sender) revert KlerosCoreOnly();
+        _;
     }
 
     // ************************************* //
@@ -40,7 +151,473 @@ contract SortitionModule is SortitionModuleBase {
 
     /// @dev Access Control to perform implementation upgrades (UUPS Proxiable)
     ///      Only the owner can perform upgrades (`onlyByOwner`)
-    function _authorizeUpgrade(address) internal view virtual override onlyByOwner {
+    function _authorizeUpgrade(address) internal view override onlyByOwner {
         // NOP
     }
+
+    /// @dev Changes the owner of the contract.
+    /// @param _owner The new owner.
+    function changeOwner(address _owner) external onlyByOwner {
+        owner = _owner;
+    }
+
+    /// @dev Changes the `minStakingTime` storage variable.
+    /// @param _minStakingTime The new value for the `minStakingTime` storage variable.
+    function changeMinStakingTime(uint256 _minStakingTime) external onlyByOwner {
+        minStakingTime = _minStakingTime;
+    }
+
+    /// @dev Changes the `maxDrawingTime` storage variable.
+    /// @param _maxDrawingTime The new value for the `maxDrawingTime` storage variable.
+    function changeMaxDrawingTime(uint256 _maxDrawingTime) external onlyByOwner {
+        maxDrawingTime = _maxDrawingTime;
+    }
+
+    /// @dev Changes the `rng` storage variable.
+    /// @param _rng The new random number generator.
+    function changeRandomNumberGenerator(IRNG _rng) external onlyByOwner {
+        rng = _rng;
+        if (phase == Phase.generating) {
+            rng.requestRandomness();
+        }
+    }
+
+    function changeMaxStakePerJuror(uint256 _maxStakePerJuror) external onlyByOwner {
+        maxStakePerJuror = _maxStakePerJuror;
+    }
+
+    function changeMaxTotalStaked(uint256 _maxTotalStaked) external onlyByOwner {
+        maxTotalStaked = _maxTotalStaked;
+    }
+
+    // ************************************* //
+    // *         State Modifiers           * //
+    // ************************************* //
+
+    function passPhase() external {
+        if (phase == Phase.staking) {
+            if (block.timestamp - lastPhaseChange < minStakingTime) revert MinStakingTimeNotPassed();
+            if (disputesWithoutJurors == 0) revert NoDisputesThatNeedJurors();
+            rng.requestRandomness();
+            phase = Phase.generating;
+        } else if (phase == Phase.generating) {
+            randomNumber = rng.receiveRandomness();
+            if (randomNumber == 0) revert RandomNumberNotReady();
+            phase = Phase.drawing;
+        } else if (phase == Phase.drawing) {
+            if (disputesWithoutJurors > 0 && block.timestamp - lastPhaseChange < maxDrawingTime) {
+                revert DisputesWithoutJurorsAndMaxDrawingTimeNotPassed();
+            }
+            phase = Phase.staking;
+        }
+
+        lastPhaseChange = block.timestamp;
+        emit NewPhase(phase);
+    }
+
+    /// @dev Create a sortition sum tree at the specified key.
+    /// @param _courtID The ID of the court.
+    /// @param _extraData Extra data that contains the number of children each node in the tree should have.
+    function createTree(uint96 _courtID, bytes memory _extraData) external override onlyByCore {
+        TreeKey key = CourtID.wrap(_courtID).toTreeKey();
+        uint256 K = _extraDataToTreeK(_extraData);
+        sortitionSumTrees.createTree(key, K);
+    }
+
+    /// @dev Executes the next delayed stakes.
+    /// @param _iterations The number of delayed stakes to execute.
+    function executeDelayedStakes(uint256 _iterations) external {
+        if (phase != Phase.staking) revert NotStakingPhase();
+        if (delayedStakeWriteIndex < delayedStakeReadIndex) revert NoDelayedStakeToExecute();
+
+        uint256 actualIterations = (delayedStakeReadIndex + _iterations) - 1 > delayedStakeWriteIndex
+            ? (delayedStakeWriteIndex - delayedStakeReadIndex) + 1
+            : _iterations;
+        uint256 newDelayedStakeReadIndex = delayedStakeReadIndex + actualIterations;
+
+        for (uint256 i = delayedStakeReadIndex; i < newDelayedStakeReadIndex; i++) {
+            DelayedStake storage delayedStake = delayedStakes[i];
+            core.setStakeBySortitionModule(delayedStake.account, delayedStake.courtID, delayedStake.stake);
+            delete delayedStakes[i];
+        }
+        delayedStakeReadIndex = newDelayedStakeReadIndex;
+    }
+
+    function createDisputeHook(uint256 /*_disputeID*/, uint256 /*_roundID*/) external override onlyByCore {
+        disputesWithoutJurors++;
+    }
+
+    function postDrawHook(uint256 /*_disputeID*/, uint256 /*_roundID*/) external override onlyByCore {
+        disputesWithoutJurors--;
+    }
+
+    /// @dev Saves the random number to use it in sortition. Not used by this contract because the storing of the number is inlined in passPhase().
+    /// @param _randomNumber Random number returned by RNG contract.
+    function notifyRandomNumber(uint256 _randomNumber) public override {}
+
+    /// @dev Validate the specified juror's new stake for a court.
+    /// Note: no state changes should be made when returning stakingResult != Successful, otherwise delayed stakes might break invariants.
+    /// @param _account The address of the juror.
+    /// @param _courtID The ID of the court.
+    /// @param _newStake The new stake.
+    /// @param _noDelay True if the stake change should not be delayed.
+    /// @return pnkDeposit The amount of PNK to be deposited.
+    /// @return pnkWithdrawal The amount of PNK to be withdrawn.
+    /// @return stakingResult The result of the staking operation.
+    function validateStake(
+        address _account,
+        uint96 _courtID,
+        uint256 _newStake,
+        bool _noDelay
+    ) external override onlyByCore returns (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult) {
+        (pnkDeposit, pnkWithdrawal, stakingResult) = _validateStake(_account, _courtID, _newStake, _noDelay);
+    }
+
+    function _validateStake(
+        address _account,
+        uint96 _courtID,
+        uint256 _newStake,
+        bool _noDelay
+    ) internal virtual returns (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult) {
+        Juror storage juror = jurors[_account];
+        uint256 currentStake = stakeOf(_account, _courtID);
+        bool stakeIncrease = _newStake > currentStake;
+        uint256 stakeChange = stakeIncrease ? _newStake - currentStake : currentStake - _newStake;
+
+        uint256 nbCourts = juror.courtIDs.length;
+        if (currentStake == 0 && nbCourts >= MAX_STAKE_PATHS) {
+            return (0, 0, StakingResult.CannotStakeInMoreCourts); // Prevent staking beyond MAX_STAKE_PATHS but unstaking is always allowed.
+        }
+
+        if (currentStake == 0 && _newStake == 0) {
+            return (0, 0, StakingResult.CannotStakeZeroWhenNoStake); // Forbid staking 0 amount when current stake is 0 to avoid flaky behaviour.
+        }
+
+        if (stakeIncrease) {
+            // Check if the stake increase is within the limits.
+            if (juror.stakedPnk + stakeChange > maxStakePerJuror || currentStake + stakeChange > maxStakePerJuror) {
+                return (0, 0, StakingResult.CannotStakeMoreThanMaxStakePerJuror);
+            }
+            if (totalStaked + stakeChange > maxTotalStaked) {
+                return (0, 0, StakingResult.CannotStakeMoreThanMaxTotalStaked);
+            }
+        }
+
+        if (phase != Phase.staking && !_noDelay) {
+            // Store the stake change as delayed, to be applied when the phase switches back to Staking.
+            DelayedStake storage delayedStake = delayedStakes[++delayedStakeWriteIndex];
+            delayedStake.account = _account;
+            delayedStake.courtID = _courtID;
+            delayedStake.stake = _newStake;
+            emit StakeDelayed(_account, _courtID, _newStake);
+            return (pnkDeposit, pnkWithdrawal, StakingResult.Delayed);
+        }
+
+        // Current phase is Staking: set stakes.
+        if (stakeIncrease) {
+            pnkDeposit = stakeChange;
+            totalStaked += stakeChange;
+        } else {
+            pnkWithdrawal = stakeChange;
+            totalStaked -= stakeChange;
+
+            // Ensure locked tokens remain in the contract. They can only be released during Execution.
+            uint256 possibleWithdrawal = juror.stakedPnk > juror.lockedPnk ? juror.stakedPnk - juror.lockedPnk : 0;
+            if (pnkWithdrawal > possibleWithdrawal) {
+                pnkWithdrawal = possibleWithdrawal;
+            }
+        }
+        return (pnkDeposit, pnkWithdrawal, StakingResult.Successful);
+    }
+
+    /// @dev Update the state of the stakes, called by KC at the end of setStake flow.
+    /// `O(n + p * log_k(j))` where
+    /// `n` is the number of courts the juror has staked in,
+    /// `p` is the depth of the court tree,
+    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
+    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
+    /// @param _account The address of the juror.
+    /// @param _courtID The ID of the court.
+    /// @param _pnkDeposit The amount of PNK to be deposited.
+    /// @param _pnkWithdrawal The amount of PNK to be withdrawn.
+    /// @param _newStake The new stake.
+    function setStake(
+        address _account,
+        uint96 _courtID,
+        uint256 _pnkDeposit,
+        uint256 _pnkWithdrawal,
+        uint256 _newStake
+    ) external override onlyByCore {
+        _setStake(_account, _courtID, _pnkDeposit, _pnkWithdrawal, _newStake);
+    }
+
+    /// @dev Update the state of the stakes with a PNK reward deposit, called by KC during rewards execution.
+    /// `O(n + p * log_k(j))` where
+    /// `n` is the number of courts the juror has staked in,
+    /// `p` is the depth of the court tree,
+    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
+    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
+    /// @param _account The address of the juror.
+    /// @param _courtID The ID of the court.
+    /// @param _penalty The amount of PNK to be deducted.
+    /// @return pnkBalance The updated total PNK balance of the juror, including the penalty.
+    /// @return newCourtStake The updated stake of the juror in the court.
+    /// @return availablePenalty The amount of PNK that was actually deducted.
+    function setStakePenalty(
+        address _account,
+        uint96 _courtID,
+        uint256 _penalty
+    ) external override onlyByCore returns (uint256 pnkBalance, uint256 newCourtStake, uint256 availablePenalty) {
+        Juror storage juror = jurors[_account];
+        availablePenalty = _penalty;
+        newCourtStake = stakeOf(_account, _courtID);
+        if (juror.stakedPnk < _penalty) {
+            availablePenalty = juror.stakedPnk;
+        }
+
+        if (availablePenalty == 0) return (juror.stakedPnk, newCourtStake, 0); // No penalty to apply.
+
+        uint256 currentStake = stakeOf(_account, _courtID);
+        uint256 newStake = 0;
+        if (currentStake >= availablePenalty) {
+            newStake = currentStake - availablePenalty;
+        }
+        _setStake(_account, _courtID, 0, availablePenalty, newStake);
+        pnkBalance = juror.stakedPnk; // updated by _setStake()
+        newCourtStake = stakeOf(_account, _courtID); // updated by _setStake()
+    }
+
+    /// @dev Update the state of the stakes with a PNK reward deposit, called by KC during rewards execution.
+    /// `O(n + p * log_k(j))` where
+    /// `n` is the number of courts the juror has staked in,
+    /// `p` is the depth of the court tree,
+    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
+    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
+    /// @param _account The address of the juror.
+    /// @param _courtID The ID of the court.
+    /// @param _reward The amount of PNK to be deposited as a reward.
+    function setStakeReward(
+        address _account,
+        uint96 _courtID,
+        uint256 _reward
+    ) external override onlyByCore returns (bool success) {
+        if (_reward == 0) return true; // No reward to add.
+
+        uint256 currentStake = stakeOf(_account, _courtID);
+        if (currentStake == 0) return false; // Juror has been unstaked, don't increase their stake.
+
+        uint256 newStake = currentStake + _reward;
+        _setStake(_account, _courtID, _reward, 0, newStake);
+        return true;
+    }
+
+    function _setStake(
+        address _account,
+        uint96 _courtID,
+        uint256 _pnkDeposit,
+        uint256 _pnkWithdrawal,
+        uint256 _newStake
+    ) internal virtual {
+        Juror storage juror = jurors[_account];
+        if (_pnkDeposit > 0) {
+            uint256 currentStake = stakeOf(_account, _courtID);
+            if (currentStake == 0) {
+                juror.courtIDs.push(_courtID);
+            }
+            // Increase juror's balance by deposited amount.
+            juror.stakedPnk += _pnkDeposit;
+        } else {
+            juror.stakedPnk -= _pnkWithdrawal;
+            if (_newStake == 0) {
+                // Cleanup
+                for (uint256 i = juror.courtIDs.length; i > 0; i--) {
+                    if (juror.courtIDs[i - 1] == _courtID) {
+                        juror.courtIDs[i - 1] = juror.courtIDs[juror.courtIDs.length - 1];
+                        juror.courtIDs.pop();
+                        break;
+                    }
+                }
+            }
+        }
+
+        // Update the sortition sum tree.
+        bytes32 stakePathID = SortitionTrees.toStakePathID(_account, _courtID);
+        bool finished = false;
+        uint96 currentCourtID = _courtID;
+        while (!finished) {
+            // Tokens are also implicitly staked in parent courts through sortition module to increase the chance of being drawn.
+            TreeKey key = CourtID.wrap(currentCourtID).toTreeKey();
+            sortitionSumTrees[key].set(_newStake, stakePathID);
+            if (currentCourtID == GENERAL_COURT) {
+                finished = true;
+            } else {
+                (currentCourtID, , , , , , ) = core.courts(currentCourtID); // Get the parent court.
+            }
+        }
+        emit StakeSet(_account, _courtID, _newStake, juror.stakedPnk);
+    }
+
+    function lockStake(address _account, uint256 _relativeAmount) external override onlyByCore {
+        jurors[_account].lockedPnk += _relativeAmount;
+        emit StakeLocked(_account, _relativeAmount, false);
+    }
+
+    function unlockStake(address _account, uint256 _relativeAmount) external override onlyByCore {
+        Juror storage juror = jurors[_account];
+        juror.lockedPnk -= _relativeAmount;
+        emit StakeLocked(_account, _relativeAmount, true);
+
+        uint256 amount = getJurorLeftoverPNK(_account);
+        if (amount > 0) {
+            emit LeftoverPNK(_account, amount);
+        }
+    }
+
+    /// @dev Unstakes the inactive juror from all courts.
+    /// `O(n * (p * log_k(j)) )` where
+    /// `n` is the number of courts the juror has staked in,
+    /// `p` is the depth of the court tree,
+    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
+    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
+    /// @param _account The juror to unstake.
+    function forcedUnstakeAllCourts(address _account) external override onlyByCore {
+        uint96[] memory courtIDs = getJurorCourtIDs(_account);
+        for (uint256 j = courtIDs.length; j > 0; j--) {
+            core.setStakeBySortitionModule(_account, courtIDs[j - 1], 0);
+        }
+    }
+
+    /// @dev Unstakes the inactive juror from a specific court.
+    /// `O(n * (p * log_k(j)) )` where
+    /// `n` is the number of courts the juror has staked in,
+    /// `p` is the depth of the court tree,
+    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
+    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
+    /// @param _account The juror to unstake.
+    /// @param _courtID The ID of the court.
+    function forcedUnstake(address _account, uint96 _courtID) external override onlyByCore {
+        core.setStakeBySortitionModule(_account, _courtID, 0);
+    }
+
+    /// @dev Gives back the locked PNKs in case the juror fully unstaked earlier.
+    /// Note that since locked and staked PNK are async it is possible for the juror to have positive staked PNK balance
+    /// while having 0 stake in courts and 0 locked tokens (eg. when the juror fully unstaked during dispute and later got his tokens unlocked).
+    /// In this case the juror can use this function to withdraw the leftover tokens.
+    /// Also note that if the juror has some leftover PNK while not fully unstaked he'll have to manually unstake from all courts to trigger this function.
+    /// @param _account The juror whose PNK to withdraw.
+    function withdrawLeftoverPNK(address _account) external override {
+        // Can withdraw the leftover PNK if fully unstaked, has no tokens locked and has positive balance.
+        // This withdrawal can't be triggered by calling setStake() in KlerosCore because current stake is technically 0, thus it is done via separate function.
+        uint256 amount = getJurorLeftoverPNK(_account);
+        if (amount == 0) revert NotEligibleForWithdrawal();
+        jurors[_account].stakedPnk = 0;
+        core.transferBySortitionModule(_account, amount);
+        emit LeftoverPNKWithdrawn(_account, amount);
+    }
+
+    // ************************************* //
+    // *           Public Views            * //
+    // ************************************* //
+
+    /// @dev Draw an ID from a tree using a number.
+    /// Note that this function reverts if the sum of all values in the tree is 0.
+    /// @param _courtID The ID of the court.
+    /// @param _coreDisputeID Index of the dispute in Kleros Core.
+    /// @param _nonce Nonce to hash with random number.
+    /// @return drawnAddress The drawn address.
+    /// `O(k * log_k(n))` where
+    /// `k` is the maximum number of children per node in the tree,
+    ///  and `n` is the maximum number of nodes ever appended.
+    function draw(
+        uint96 _courtID,
+        uint256 _coreDisputeID,
+        uint256 _nonce
+    ) public view override returns (address drawnAddress, uint96 fromSubcourtID) {
+        if (phase != Phase.drawing) revert NotDrawingPhase();
+
+        TreeKey key = CourtID.wrap(_courtID).toTreeKey();
+        (drawnAddress, fromSubcourtID) = sortitionSumTrees[key].draw(_coreDisputeID, _nonce, randomNumber);
+    }
+
+    /// @dev Get the stake of a juror in a court.
+    /// @param _juror The address of the juror.
+    /// @param _courtID The ID of the court.
+    /// @return value The stake of the juror in the court.
+    function stakeOf(address _juror, uint96 _courtID) public view returns (uint256) {
+        bytes32 stakePathID = SortitionTrees.toStakePathID(_juror, _courtID);
+        TreeKey key = CourtID.wrap(_courtID).toTreeKey();
+        return sortitionSumTrees[key].stakeOf(stakePathID);
+    }
+
+    /// @dev Gets the balance of a juror in a court.
+    /// @param _juror The address of the juror.
+    /// @param _courtID The ID of the court.
+    /// @return totalStaked The total amount of tokens staked including locked tokens and penalty deductions. Equivalent to the effective stake in the General court.
+    /// @return totalLocked The total amount of tokens locked in disputes.
+    /// @return stakedInCourt The amount of tokens staked in the specified court including locked tokens and penalty deductions.
+    /// @return nbCourts The number of courts the juror has directly staked in.
+    function getJurorBalance(
+        address _juror,
+        uint96 _courtID
+    )
+        external
+        view
+        override
+        returns (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts)
+    {
+        Juror storage juror = jurors[_juror];
+        totalStaked = juror.stakedPnk;
+        totalLocked = juror.lockedPnk;
+        stakedInCourt = stakeOf(_juror, _courtID);
+        nbCourts = juror.courtIDs.length;
+    }
+
+    /// @dev Gets the court identifiers where a specific `_juror` has staked.
+    /// @param _juror The address of the juror.
+    function getJurorCourtIDs(address _juror) public view override returns (uint96[] memory) {
+        return jurors[_juror].courtIDs;
+    }
+
+    function isJurorStaked(address _juror) external view override returns (bool) {
+        return jurors[_juror].stakedPnk > 0;
+    }
+
+    function getJurorLeftoverPNK(address _juror) public view override returns (uint256) {
+        Juror storage juror = jurors[_juror];
+        if (juror.courtIDs.length == 0 && juror.lockedPnk == 0) {
+            return juror.stakedPnk;
+        } else {
+            return 0;
+        }
+    }
+
+    // ************************************* //
+    // *            Internal               * //
+    // ************************************* //
+
+    function _extraDataToTreeK(bytes memory _extraData) internal pure returns (uint256 K) {
+        if (_extraData.length >= 32) {
+            assembly {
+                // solium-disable-line security/no-inline-assembly
+                K := mload(add(_extraData, 0x20))
+            }
+        } else {
+            K = DEFAULT_K;
+        }
+    }
+
+    // ************************************* //
+    // *              Errors               * //
+    // ************************************* //
+
+    error OwnerOnly();
+    error KlerosCoreOnly();
+    error MinStakingTimeNotPassed();
+    error NoDisputesThatNeedJurors();
+    error RandomNumberNotReady();
+    error DisputesWithoutJurorsAndMaxDrawingTimeNotPassed();
+    error NotStakingPhase();
+    error NoDelayedStakeToExecute();
+    error NotEligibleForWithdrawal();
+    error NotDrawingPhase();
 }
diff --git a/contracts/src/arbitration/SortitionModuleBase.sol b/contracts/src/arbitration/SortitionModuleBase.sol
deleted file mode 100644
index 3c528b017..000000000
--- a/contracts/src/arbitration/SortitionModuleBase.sol
+++ /dev/null
@@ -1,572 +0,0 @@
-// SPDX-License-Identifier: MIT
-
-pragma solidity ^0.8.24;
-
-import {KlerosCore} from "./KlerosCore.sol";
-import {ISortitionModule} from "./interfaces/ISortitionModule.sol";
-import {IDisputeKit} from "./interfaces/IDisputeKit.sol";
-import {Initializable} from "../proxy/Initializable.sol";
-import {UUPSProxiable} from "../proxy/UUPSProxiable.sol";
-import {SortitionTrees, TreeKey, CourtID} from "../libraries/SortitionTrees.sol";
-import {IRNG} from "../rng/IRNG.sol";
-import "../libraries/Constants.sol";
-
-/// @title SortitionModuleBase
-/// @dev A factory of trees that keeps track of staked values for sortition.
-abstract contract SortitionModuleBase is ISortitionModule, Initializable, UUPSProxiable {
-    using SortitionTrees for SortitionTrees.Tree;
-    using SortitionTrees for mapping(TreeKey key => SortitionTrees.Tree);
-
-    // ************************************* //
-    // *         Enums / Structs           * //
-    // ************************************* //
-
-    struct DelayedStake {
-        address account; // The address of the juror.
-        uint96 courtID; // The ID of the court.
-        uint256 stake; // The new stake.
-        bool alreadyTransferred; // DEPRECATED. True if tokens were already transferred before delayed stake's execution.
-    }
-
-    struct Juror {
-        uint96[] courtIDs; // The IDs of courts where the juror's stake path ends. A stake path is a path from the general court to a court the juror directly staked in using `_setStake`.
-        uint256 stakedPnk; // The juror's total amount of tokens staked in subcourts. PNK balance including locked PNK and penalty deductions.
-        uint256 lockedPnk; // The juror's total amount of tokens locked in disputes.
-    }
-
-    // ************************************* //
-    // *             Storage               * //
-    // ************************************* //
-
-    address public owner; // The owner of the contract.
-    KlerosCore public core; // The core arbitrator contract.
-    Phase public phase; // The current phase.
-    uint256 public minStakingTime; // The time after which the phase can be switched to Drawing if there are open disputes.
-    uint256 public maxDrawingTime; // The time after which the phase can be switched back to Staking.
-    uint256 public lastPhaseChange; // The last time the phase was changed.
-    uint256 public randomNumberRequestBlock; // DEPRECATED: to be removed in the next redeploy
-    uint256 public disputesWithoutJurors; // The number of disputes that have not finished drawing jurors.
-    IRNG public rng; // The random number generator.
-    uint256 public randomNumber; // Random number returned by RNG.
-    uint256 public rngLookahead; // DEPRECATED: to be removed in the next redeploy
-    uint256 public delayedStakeWriteIndex; // The index of the last `delayedStake` item that was written to the array. 0 index is skipped.
-    uint256 public delayedStakeReadIndex; // The index of the next `delayedStake` item that should be processed. Starts at 1 because 0 index is skipped.
-    mapping(TreeKey key => SortitionTrees.Tree) sortitionSumTrees; // The mapping of sortition trees by keys.
-    mapping(address account => Juror) public jurors; // The jurors.
-    mapping(uint256 => DelayedStake) public delayedStakes; // Stores the stakes that were changed during Drawing phase, to update them when the phase is switched to Staking.
-    mapping(address jurorAccount => mapping(uint96 courtId => uint256)) public latestDelayedStakeIndex; // DEPRECATED. Maps the juror to its latest delayed stake. If there is already a delayed stake for this juror then it'll be replaced. latestDelayedStakeIndex[juror][courtID].
-
-    // ************************************* //
-    // *              Events               * //
-    // ************************************* //
-
-    /// @notice Emitted when a juror stakes in a court.
-    /// @param _address The address of the juror.
-    /// @param _courtID The ID of the court.
-    /// @param _amount The amount of tokens staked in the court.
-    /// @param _amountAllCourts The amount of tokens staked in all courts.
-    event StakeSet(address indexed _address, uint256 _courtID, uint256 _amount, uint256 _amountAllCourts);
-
-    /// @notice Emitted when a juror's stake is delayed.
-    /// @param _address The address of the juror.
-    /// @param _courtID The ID of the court.
-    /// @param _amount The amount of tokens staked in the court.
-    event StakeDelayed(address indexed _address, uint96 indexed _courtID, uint256 _amount);
-
-    /// @notice Emitted when a juror's stake is locked.
-    /// @param _address The address of the juror.
-    /// @param _relativeAmount The amount of tokens locked.
-    /// @param _unlock Whether the stake is locked or unlocked.
-    event StakeLocked(address indexed _address, uint256 _relativeAmount, bool _unlock);
-
-    /// @dev Emitted when leftover PNK is available.
-    /// @param _account The account of the juror.
-    /// @param _amount The amount of PNK available.
-    event LeftoverPNK(address indexed _account, uint256 _amount);
-
-    /// @dev Emitted when leftover PNK is withdrawn.
-    /// @param _account The account of the juror withdrawing PNK.
-    /// @param _amount The amount of PNK withdrawn.
-    event LeftoverPNKWithdrawn(address indexed _account, uint256 _amount);
-
-    // ************************************* //
-    // *            Constructor            * //
-    // ************************************* //
-
-    function __SortitionModuleBase_initialize(
-        address _owner,
-        KlerosCore _core,
-        uint256 _minStakingTime,
-        uint256 _maxDrawingTime,
-        IRNG _rng
-    ) internal onlyInitializing {
-        owner = _owner;
-        core = _core;
-        minStakingTime = _minStakingTime;
-        maxDrawingTime = _maxDrawingTime;
-        lastPhaseChange = block.timestamp;
-        rng = _rng;
-        delayedStakeReadIndex = 1;
-    }
-
-    // ************************************* //
-    // *        Function Modifiers         * //
-    // ************************************* //
-
-    modifier onlyByOwner() {
-        if (owner != msg.sender) revert OwnerOnly();
-        _;
-    }
-
-    modifier onlyByCore() {
-        if (address(core) != msg.sender) revert KlerosCoreOnly();
-        _;
-    }
-
-    // ************************************* //
-    // *             Governance            * //
-    // ************************************* //
-
-    /// @dev Changes the owner of the contract.
-    /// @param _owner The new owner.
-    function changeOwner(address _owner) external onlyByOwner {
-        owner = _owner;
-    }
-
-    /// @dev Changes the `minStakingTime` storage variable.
-    /// @param _minStakingTime The new value for the `minStakingTime` storage variable.
-    function changeMinStakingTime(uint256 _minStakingTime) external onlyByOwner {
-        minStakingTime = _minStakingTime;
-    }
-
-    /// @dev Changes the `maxDrawingTime` storage variable.
-    /// @param _maxDrawingTime The new value for the `maxDrawingTime` storage variable.
-    function changeMaxDrawingTime(uint256 _maxDrawingTime) external onlyByOwner {
-        maxDrawingTime = _maxDrawingTime;
-    }
-
-    /// @dev Changes the `rng` storage variable.
-    /// @param _rng The new random number generator.
-    function changeRandomNumberGenerator(IRNG _rng) external onlyByOwner {
-        rng = _rng;
-        if (phase == Phase.generating) {
-            rng.requestRandomness();
-        }
-    }
-
-    // ************************************* //
-    // *         State Modifiers           * //
-    // ************************************* //
-
-    function passPhase() external {
-        if (phase == Phase.staking) {
-            if (block.timestamp - lastPhaseChange < minStakingTime) revert MinStakingTimeNotPassed();
-            if (disputesWithoutJurors == 0) revert NoDisputesThatNeedJurors();
-            rng.requestRandomness();
-            phase = Phase.generating;
-        } else if (phase == Phase.generating) {
-            randomNumber = rng.receiveRandomness();
-            if (randomNumber == 0) revert RandomNumberNotReady();
-            phase = Phase.drawing;
-        } else if (phase == Phase.drawing) {
-            if (disputesWithoutJurors > 0 && block.timestamp - lastPhaseChange < maxDrawingTime) {
-                revert DisputesWithoutJurorsAndMaxDrawingTimeNotPassed();
-            }
-            phase = Phase.staking;
-        }
-
-        lastPhaseChange = block.timestamp;
-        emit NewPhase(phase);
-    }
-
-    /// @dev Create a sortition sum tree at the specified key.
-    /// @param _courtID The ID of the court.
-    /// @param _extraData Extra data that contains the number of children each node in the tree should have.
-    function createTree(uint96 _courtID, bytes memory _extraData) external override onlyByCore {
-        TreeKey key = CourtID.wrap(_courtID).toTreeKey();
-        uint256 K = _extraDataToTreeK(_extraData);
-        sortitionSumTrees.createTree(key, K);
-    }
-
-    /// @dev Executes the next delayed stakes.
-    /// @param _iterations The number of delayed stakes to execute.
-    function executeDelayedStakes(uint256 _iterations) external {
-        if (phase != Phase.staking) revert NotStakingPhase();
-        if (delayedStakeWriteIndex < delayedStakeReadIndex) revert NoDelayedStakeToExecute();
-
-        uint256 actualIterations = (delayedStakeReadIndex + _iterations) - 1 > delayedStakeWriteIndex
-            ? (delayedStakeWriteIndex - delayedStakeReadIndex) + 1
-            : _iterations;
-        uint256 newDelayedStakeReadIndex = delayedStakeReadIndex + actualIterations;
-
-        for (uint256 i = delayedStakeReadIndex; i < newDelayedStakeReadIndex; i++) {
-            DelayedStake storage delayedStake = delayedStakes[i];
-            core.setStakeBySortitionModule(delayedStake.account, delayedStake.courtID, delayedStake.stake);
-            delete delayedStakes[i];
-        }
-        delayedStakeReadIndex = newDelayedStakeReadIndex;
-    }
-
-    function createDisputeHook(uint256 /*_disputeID*/, uint256 /*_roundID*/) external override onlyByCore {
-        disputesWithoutJurors++;
-    }
-
-    function postDrawHook(uint256 /*_disputeID*/, uint256 /*_roundID*/) external override onlyByCore {
-        disputesWithoutJurors--;
-    }
-
-    /// @dev Saves the random number to use it in sortition. Not used by this contract because the storing of the number is inlined in passPhase().
-    /// @param _randomNumber Random number returned by RNG contract.
-    function notifyRandomNumber(uint256 _randomNumber) public override {}
-
-    /// @dev Validate the specified juror's new stake for a court.
-    /// Note: no state changes should be made when returning stakingResult != Successful, otherwise delayed stakes might break invariants.
-    /// @param _account The address of the juror.
-    /// @param _courtID The ID of the court.
-    /// @param _newStake The new stake.
-    /// @param _noDelay True if the stake change should not be delayed.
-    /// @return pnkDeposit The amount of PNK to be deposited.
-    /// @return pnkWithdrawal The amount of PNK to be withdrawn.
-    /// @return stakingResult The result of the staking operation.
-    function validateStake(
-        address _account,
-        uint96 _courtID,
-        uint256 _newStake,
-        bool _noDelay
-    ) external override onlyByCore returns (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult) {
-        (pnkDeposit, pnkWithdrawal, stakingResult) = _validateStake(_account, _courtID, _newStake, _noDelay);
-    }
-
-    function _validateStake(
-        address _account,
-        uint96 _courtID,
-        uint256 _newStake,
-        bool _noDelay
-    ) internal virtual returns (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult) {
-        Juror storage juror = jurors[_account];
-        uint256 currentStake = stakeOf(_account, _courtID);
-
-        uint256 nbCourts = juror.courtIDs.length;
-        if (currentStake == 0 && nbCourts >= MAX_STAKE_PATHS) {
-            return (0, 0, StakingResult.CannotStakeInMoreCourts); // Prevent staking beyond MAX_STAKE_PATHS but unstaking is always allowed.
-        }
-
-        if (currentStake == 0 && _newStake == 0) {
-            return (0, 0, StakingResult.CannotStakeZeroWhenNoStake); // Forbid staking 0 amount when current stake is 0 to avoid flaky behaviour.
-        }
-
-        if (phase != Phase.staking && !_noDelay) {
-            // Store the stake change as delayed, to be applied when the phase switches back to Staking.
-            DelayedStake storage delayedStake = delayedStakes[++delayedStakeWriteIndex];
-            delayedStake.account = _account;
-            delayedStake.courtID = _courtID;
-            delayedStake.stake = _newStake;
-            emit StakeDelayed(_account, _courtID, _newStake);
-            return (pnkDeposit, pnkWithdrawal, StakingResult.Delayed);
-        }
-
-        // Current phase is Staking: set stakes.
-        if (_newStake >= currentStake) {
-            pnkDeposit = _newStake - currentStake;
-        } else {
-            pnkWithdrawal = currentStake - _newStake;
-            // Ensure locked tokens remain in the contract. They can only be released during Execution.
-            uint256 possibleWithdrawal = juror.stakedPnk > juror.lockedPnk ? juror.stakedPnk - juror.lockedPnk : 0;
-            if (pnkWithdrawal > possibleWithdrawal) {
-                pnkWithdrawal = possibleWithdrawal;
-            }
-        }
-        return (pnkDeposit, pnkWithdrawal, StakingResult.Successful);
-    }
-
-    /// @dev Update the state of the stakes, called by KC at the end of setStake flow.
-    /// `O(n + p * log_k(j))` where
-    /// `n` is the number of courts the juror has staked in,
-    /// `p` is the depth of the court tree,
-    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
-    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
-    /// @param _account The address of the juror.
-    /// @param _courtID The ID of the court.
-    /// @param _pnkDeposit The amount of PNK to be deposited.
-    /// @param _pnkWithdrawal The amount of PNK to be withdrawn.
-    /// @param _newStake The new stake.
-    function setStake(
-        address _account,
-        uint96 _courtID,
-        uint256 _pnkDeposit,
-        uint256 _pnkWithdrawal,
-        uint256 _newStake
-    ) external override onlyByCore {
-        _setStake(_account, _courtID, _pnkDeposit, _pnkWithdrawal, _newStake);
-    }
-
-    /// @dev Update the state of the stakes with a PNK reward deposit, called by KC during rewards execution.
-    /// `O(n + p * log_k(j))` where
-    /// `n` is the number of courts the juror has staked in,
-    /// `p` is the depth of the court tree,
-    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
-    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
-    /// @param _account The address of the juror.
-    /// @param _courtID The ID of the court.
-    /// @param _penalty The amount of PNK to be deducted.
-    /// @return pnkBalance The updated total PNK balance of the juror, including the penalty.
-    /// @return newCourtStake The updated stake of the juror in the court.
-    /// @return availablePenalty The amount of PNK that was actually deducted.
-    function setStakePenalty(
-        address _account,
-        uint96 _courtID,
-        uint256 _penalty
-    ) external override onlyByCore returns (uint256 pnkBalance, uint256 newCourtStake, uint256 availablePenalty) {
-        Juror storage juror = jurors[_account];
-        availablePenalty = _penalty;
-        newCourtStake = stakeOf(_account, _courtID);
-        if (juror.stakedPnk < _penalty) {
-            availablePenalty = juror.stakedPnk;
-        }
-
-        if (availablePenalty == 0) return (juror.stakedPnk, newCourtStake, 0); // No penalty to apply.
-
-        uint256 currentStake = stakeOf(_account, _courtID);
-        uint256 newStake = 0;
-        if (currentStake >= availablePenalty) {
-            newStake = currentStake - availablePenalty;
-        }
-        _setStake(_account, _courtID, 0, availablePenalty, newStake);
-        pnkBalance = juror.stakedPnk; // updated by _setStake()
-        newCourtStake = stakeOf(_account, _courtID); // updated by _setStake()
-    }
-
-    /// @dev Update the state of the stakes with a PNK reward deposit, called by KC during rewards execution.
-    /// `O(n + p * log_k(j))` where
-    /// `n` is the number of courts the juror has staked in,
-    /// `p` is the depth of the court tree,
-    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
-    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
-    /// @param _account The address of the juror.
-    /// @param _courtID The ID of the court.
-    /// @param _reward The amount of PNK to be deposited as a reward.
-    function setStakeReward(
-        address _account,
-        uint96 _courtID,
-        uint256 _reward
-    ) external override onlyByCore returns (bool success) {
-        if (_reward == 0) return true; // No reward to add.
-
-        uint256 currentStake = stakeOf(_account, _courtID);
-        if (currentStake == 0) return false; // Juror has been unstaked, don't increase their stake.
-
-        uint256 newStake = currentStake + _reward;
-        _setStake(_account, _courtID, _reward, 0, newStake);
-        return true;
-    }
-
-    function _setStake(
-        address _account,
-        uint96 _courtID,
-        uint256 _pnkDeposit,
-        uint256 _pnkWithdrawal,
-        uint256 _newStake
-    ) internal virtual {
-        Juror storage juror = jurors[_account];
-        if (_pnkDeposit > 0) {
-            uint256 currentStake = stakeOf(_account, _courtID);
-            if (currentStake == 0) {
-                juror.courtIDs.push(_courtID);
-            }
-            // Increase juror's balance by deposited amount.
-            juror.stakedPnk += _pnkDeposit;
-        } else {
-            juror.stakedPnk -= _pnkWithdrawal;
-            if (_newStake == 0) {
-                // Cleanup
-                for (uint256 i = juror.courtIDs.length; i > 0; i--) {
-                    if (juror.courtIDs[i - 1] == _courtID) {
-                        juror.courtIDs[i - 1] = juror.courtIDs[juror.courtIDs.length - 1];
-                        juror.courtIDs.pop();
-                        break;
-                    }
-                }
-            }
-        }
-
-        // Update the sortition sum tree.
-        bytes32 stakePathID = SortitionTrees.toStakePathID(_account, _courtID);
-        bool finished = false;
-        uint96 currentCourtID = _courtID;
-        while (!finished) {
-            // Tokens are also implicitly staked in parent courts through sortition module to increase the chance of being drawn.
-            TreeKey key = CourtID.wrap(currentCourtID).toTreeKey();
-            sortitionSumTrees[key].set(_newStake, stakePathID);
-            if (currentCourtID == GENERAL_COURT) {
-                finished = true;
-            } else {
-                (currentCourtID, , , , , , ) = core.courts(currentCourtID); // Get the parent court.
-            }
-        }
-        emit StakeSet(_account, _courtID, _newStake, juror.stakedPnk);
-    }
-
-    function lockStake(address _account, uint256 _relativeAmount) external override onlyByCore {
-        jurors[_account].lockedPnk += _relativeAmount;
-        emit StakeLocked(_account, _relativeAmount, false);
-    }
-
-    function unlockStake(address _account, uint256 _relativeAmount) external override onlyByCore {
-        Juror storage juror = jurors[_account];
-        juror.lockedPnk -= _relativeAmount;
-        emit StakeLocked(_account, _relativeAmount, true);
-
-        uint256 amount = getJurorLeftoverPNK(_account);
-        if (amount > 0) {
-            emit LeftoverPNK(_account, amount);
-        }
-    }
-
-    /// @dev Unstakes the inactive juror from all courts.
-    /// `O(n * (p * log_k(j)) )` where
-    /// `n` is the number of courts the juror has staked in,
-    /// `p` is the depth of the court tree,
-    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
-    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
-    /// @param _account The juror to unstake.
-    function forcedUnstakeAllCourts(address _account) external override onlyByCore {
-        uint96[] memory courtIDs = getJurorCourtIDs(_account);
-        for (uint256 j = courtIDs.length; j > 0; j--) {
-            core.setStakeBySortitionModule(_account, courtIDs[j - 1], 0);
-        }
-    }
-
-    /// @dev Unstakes the inactive juror from a specific court.
-    /// `O(n * (p * log_k(j)) )` where
-    /// `n` is the number of courts the juror has staked in,
-    /// `p` is the depth of the court tree,
-    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
-    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
-    /// @param _account The juror to unstake.
-    /// @param _courtID The ID of the court.
-    function forcedUnstake(address _account, uint96 _courtID) external override onlyByCore {
-        core.setStakeBySortitionModule(_account, _courtID, 0);
-    }
-
-    /// @dev Gives back the locked PNKs in case the juror fully unstaked earlier.
-    /// Note that since locked and staked PNK are async it is possible for the juror to have positive staked PNK balance
-    /// while having 0 stake in courts and 0 locked tokens (eg. when the juror fully unstaked during dispute and later got his tokens unlocked).
-    /// In this case the juror can use this function to withdraw the leftover tokens.
-    /// Also note that if the juror has some leftover PNK while not fully unstaked he'll have to manually unstake from all courts to trigger this function.
-    /// @param _account The juror whose PNK to withdraw.
-    function withdrawLeftoverPNK(address _account) external override {
-        // Can withdraw the leftover PNK if fully unstaked, has no tokens locked and has positive balance.
-        // This withdrawal can't be triggered by calling setStake() in KlerosCore because current stake is technically 0, thus it is done via separate function.
-        uint256 amount = getJurorLeftoverPNK(_account);
-        if (amount == 0) revert NotEligibleForWithdrawal();
-        jurors[_account].stakedPnk = 0;
-        core.transferBySortitionModule(_account, amount);
-        emit LeftoverPNKWithdrawn(_account, amount);
-    }
-
-    // ************************************* //
-    // *           Public Views            * //
-    // ************************************* //
-
-    /// @dev Draw an ID from a tree using a number.
-    /// Note that this function reverts if the sum of all values in the tree is 0.
-    /// @param _courtID The ID of the court.
-    /// @param _coreDisputeID Index of the dispute in Kleros Core.
-    /// @param _nonce Nonce to hash with random number.
-    /// @return drawnAddress The drawn address.
-    /// `O(k * log_k(n))` where
-    /// `k` is the maximum number of children per node in the tree,
-    ///  and `n` is the maximum number of nodes ever appended.
-    function draw(
-        uint96 _courtID,
-        uint256 _coreDisputeID,
-        uint256 _nonce
-    ) public view override returns (address drawnAddress, uint96 fromSubcourtID) {
-        if (phase != Phase.drawing) revert NotDrawingPhase();
-
-        TreeKey key = CourtID.wrap(_courtID).toTreeKey();
-        (drawnAddress, fromSubcourtID) = sortitionSumTrees[key].draw(_coreDisputeID, _nonce, randomNumber);
-    }
-
-    /// @dev Get the stake of a juror in a court.
-    /// @param _juror The address of the juror.
-    /// @param _courtID The ID of the court.
-    /// @return value The stake of the juror in the court.
-    function stakeOf(address _juror, uint96 _courtID) public view returns (uint256) {
-        bytes32 stakePathID = SortitionTrees.toStakePathID(_juror, _courtID);
-        TreeKey key = CourtID.wrap(_courtID).toTreeKey();
-        return sortitionSumTrees[key].stakeOf(stakePathID);
-    }
-
-    /// @dev Gets the balance of a juror in a court.
-    /// @param _juror The address of the juror.
-    /// @param _courtID The ID of the court.
-    /// @return totalStaked The total amount of tokens staked including locked tokens and penalty deductions. Equivalent to the effective stake in the General court.
-    /// @return totalLocked The total amount of tokens locked in disputes.
-    /// @return stakedInCourt The amount of tokens staked in the specified court including locked tokens and penalty deductions.
-    /// @return nbCourts The number of courts the juror has directly staked in.
-    function getJurorBalance(
-        address _juror,
-        uint96 _courtID
-    )
-        external
-        view
-        override
-        returns (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts)
-    {
-        Juror storage juror = jurors[_juror];
-        totalStaked = juror.stakedPnk;
-        totalLocked = juror.lockedPnk;
-        stakedInCourt = stakeOf(_juror, _courtID);
-        nbCourts = juror.courtIDs.length;
-    }
-
-    /// @dev Gets the court identifiers where a specific `_juror` has staked.
-    /// @param _juror The address of the juror.
-    function getJurorCourtIDs(address _juror) public view override returns (uint96[] memory) {
-        return jurors[_juror].courtIDs;
-    }
-
-    function isJurorStaked(address _juror) external view override returns (bool) {
-        return jurors[_juror].stakedPnk > 0;
-    }
-
-    function getJurorLeftoverPNK(address _juror) public view override returns (uint256) {
-        Juror storage juror = jurors[_juror];
-        if (juror.courtIDs.length == 0 && juror.lockedPnk == 0) {
-            return juror.stakedPnk;
-        } else {
-            return 0;
-        }
-    }
-
-    // ************************************* //
-    // *            Internal               * //
-    // ************************************* //
-
-    function _extraDataToTreeK(bytes memory _extraData) internal pure returns (uint256 K) {
-        if (_extraData.length >= 32) {
-            assembly {
-                // solium-disable-line security/no-inline-assembly
-                K := mload(add(_extraData, 0x20))
-            }
-        } else {
-            K = DEFAULT_K;
-        }
-    }
-
-    // ************************************* //
-    // *              Errors               * //
-    // ************************************* //
-
-    error OwnerOnly();
-    error KlerosCoreOnly();
-    error MinStakingTimeNotPassed();
-    error NoDisputesThatNeedJurors();
-    error RandomNumberNotReady();
-    error DisputesWithoutJurorsAndMaxDrawingTimeNotPassed();
-    error NotStakingPhase();
-    error NoDelayedStakeToExecute();
-    error NotEligibleForWithdrawal();
-    error NotDrawingPhase();
-}
diff --git a/contracts/src/arbitration/SortitionModuleNeo.sol b/contracts/src/arbitration/SortitionModuleNeo.sol
deleted file mode 100644
index 66dbba7e5..000000000
--- a/contracts/src/arbitration/SortitionModuleNeo.sol
+++ /dev/null
@@ -1,100 +0,0 @@
-// SPDX-License-Identifier: MIT
-
-pragma solidity ^0.8.24;
-
-import {SortitionModuleBase, KlerosCore, IRNG, StakingResult} from "./SortitionModuleBase.sol";
-
-/// @title SortitionModuleNeo
-/// @dev A factory of trees that keeps track of staked values for sortition.
-contract SortitionModuleNeo is SortitionModuleBase {
-    string public constant override version = "2.0.0";
-
-    // ************************************* //
-    // *             Storage               * //
-    // ************************************* //
-
-    uint256 public maxStakePerJuror;
-    uint256 public maxTotalStaked;
-    uint256 public totalStaked;
-
-    // ************************************* //
-    // *            Constructor            * //
-    // ************************************* //
-
-    /// @custom:oz-upgrades-unsafe-allow constructor
-    constructor() {
-        _disableInitializers();
-    }
-
-    /// @dev Initializer (constructor equivalent for upgradable contracts).
-    /// @param _owner The owner.
-    /// @param _core The KlerosCore.
-    /// @param _minStakingTime Minimal time to stake
-    /// @param _maxDrawingTime Time after which the drawing phase can be switched
-    /// @param _rng The random number generator.
-    /// @param _maxStakePerJuror The maximum amount of PNK a juror can stake in a court.
-    /// @param _maxTotalStaked The maximum amount of PNK that can be staked in all courts.
-    function initialize(
-        address _owner,
-        KlerosCore _core,
-        uint256 _minStakingTime,
-        uint256 _maxDrawingTime,
-        IRNG _rng,
-        uint256 _maxStakePerJuror,
-        uint256 _maxTotalStaked
-    ) external reinitializer(2) {
-        __SortitionModuleBase_initialize(_owner, _core, _minStakingTime, _maxDrawingTime, _rng);
-        maxStakePerJuror = _maxStakePerJuror;
-        maxTotalStaked = _maxTotalStaked;
-    }
-
-    // ************************************* //
-    // *             Governance            * //
-    // ************************************* //
-
-    /// @dev Access Control to perform implementation upgrades (UUPS Proxiable)
-    ///      Only the owner can perform upgrades (`onlyByOwner`)
-    function _authorizeUpgrade(address) internal view override onlyByOwner {
-        // NOP
-    }
-
-    function changeMaxStakePerJuror(uint256 _maxStakePerJuror) external onlyByOwner {
-        maxStakePerJuror = _maxStakePerJuror;
-    }
-
-    function changeMaxTotalStaked(uint256 _maxTotalStaked) external onlyByOwner {
-        maxTotalStaked = _maxTotalStaked;
-    }
-
-    // ************************************* //
-    // *         State Modifiers           * //
-    // ************************************* //
-
-    function _validateStake(
-        address _account,
-        uint96 _courtID,
-        uint256 _newStake,
-        bool _noDelay
-    ) internal override onlyByCore returns (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult) {
-        uint256 currentStake = stakeOf(_account, _courtID);
-        bool stakeIncrease = _newStake > currentStake;
-        uint256 stakeChange = stakeIncrease ? _newStake - currentStake : currentStake - _newStake;
-        Juror storage juror = jurors[_account];
-        if (stakeIncrease) {
-            if (juror.stakedPnk + stakeChange > maxStakePerJuror || currentStake + stakeChange > maxStakePerJuror) {
-                return (0, 0, StakingResult.CannotStakeMoreThanMaxStakePerJuror);
-            }
-            if (totalStaked + stakeChange > maxTotalStaked) {
-                return (0, 0, StakingResult.CannotStakeMoreThanMaxTotalStaked);
-            }
-        }
-        if (phase == Phase.staking) {
-            if (stakeIncrease) {
-                totalStaked += stakeChange;
-            } else {
-                totalStaked -= stakeChange;
-            }
-        }
-        (pnkDeposit, pnkWithdrawal, stakingResult) = super._validateStake(_account, _courtID, _newStake, _noDelay);
-    }
-}
diff --git a/contracts/test/foundry/KlerosCore_Drawing.t.sol b/contracts/test/foundry/KlerosCore_Drawing.t.sol
index b8c644392..9bffbc27d 100644
--- a/contracts/test/foundry/KlerosCore_Drawing.t.sol
+++ b/contracts/test/foundry/KlerosCore_Drawing.t.sol
@@ -3,7 +3,7 @@ pragma solidity ^0.8.24;
 
 import {KlerosCore_TestBase} from "./KlerosCore_TestBase.sol";
 import {KlerosCore} from "../../src/arbitration/KlerosCore.sol";
-import {SortitionModuleBase} from "../../src/arbitration/SortitionModuleBase.sol";
+import {SortitionModule} from "../../src/arbitration/SortitionModule.sol";
 import {ISortitionModule} from "../../src/arbitration/interfaces/ISortitionModule.sol";
 import "../../src/libraries/Constants.sol";
 
@@ -24,7 +24,7 @@ contract KlerosCore_DrawingTest is KlerosCore_TestBase {
         sortitionModule.passPhase(); // Drawing phase
 
         vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeLocked(staker1, 1000, false);
+        emit SortitionModule.StakeLocked(staker1, 1000, false);
         vm.expectEmit(true, true, true, true);
         emit KlerosCore.Draw(staker1, disputeID, roundID, 0); // VoteID = 0
 
diff --git a/contracts/test/foundry/KlerosCore_Execution.t.sol b/contracts/test/foundry/KlerosCore_Execution.t.sol
index 33b2cda65..01efd6409 100644
--- a/contracts/test/foundry/KlerosCore_Execution.t.sol
+++ b/contracts/test/foundry/KlerosCore_Execution.t.sol
@@ -3,7 +3,7 @@ pragma solidity ^0.8.24;
 
 import {KlerosCore_TestBase} from "./KlerosCore_TestBase.sol";
 import {KlerosCore} from "../../src/arbitration/KlerosCore.sol";
-import {SortitionModuleBase} from "../../src/arbitration/SortitionModuleBase.sol";
+import {SortitionModule} from "../../src/arbitration/SortitionModule.sol";
 import {DisputeKitClassicBase} from "../../src/arbitration/dispute-kits/DisputeKitClassicBase.sol";
 import {IArbitratorV2, IArbitrableV2} from "../../src/arbitration/KlerosCore.sol";
 import {IERC20} from "../../src/libraries/SafeERC20.sol";
@@ -96,16 +96,16 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
         );
 
         vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeLocked(staker1, 1000, true);
+        emit SortitionModule.StakeLocked(staker1, 1000, true);
         vm.expectEmit(true, true, true, true);
         emit KlerosCore.TokenAndETHShift(staker1, disputeID, 0, 0, -int256(1000), 0, IERC20(address(0)));
         // Check iterations for the winning staker to see the shifts
         vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeLocked(staker2, 0, true);
+        emit SortitionModule.StakeLocked(staker2, 0, true);
         vm.expectEmit(true, true, true, true);
         emit KlerosCore.TokenAndETHShift(staker2, disputeID, 0, 10000, 0, 0, IERC20(address(0)));
         vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeLocked(staker2, 0, true);
+        emit SortitionModule.StakeLocked(staker2, 0, true);
         vm.expectEmit(true, true, true, true);
         emit KlerosCore.TokenAndETHShift(staker2, disputeID, 0, 10000, 0, 0, IERC20(address(0)));
         core.execute(disputeID, 0, 3); // Do 3 iterations to check penalties first
@@ -121,16 +121,16 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
         assertEq(round.pnkPenalties, 1000, "Wrong pnkPenalties");
 
         vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeLocked(staker1, 0, true);
+        emit SortitionModule.StakeLocked(staker1, 0, true);
         vm.expectEmit(true, true, true, true);
         emit KlerosCore.TokenAndETHShift(staker1, disputeID, 0, 0, 0, 0, IERC20(address(0)));
         // Check iterations for the winning staker to see the shifts
         vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeLocked(staker2, 1000, true);
+        emit SortitionModule.StakeLocked(staker2, 1000, true);
         vm.expectEmit(true, true, true, true);
         emit KlerosCore.TokenAndETHShift(staker2, disputeID, 0, 10000, 500, 0.045 ether, IERC20(address(0)));
         vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeLocked(staker2, 1000, true);
+        emit SortitionModule.StakeLocked(staker2, 1000, true);
         vm.expectEmit(true, true, true, true);
         emit KlerosCore.TokenAndETHShift(staker2, disputeID, 0, 10000, 500, 0.045 ether, IERC20(address(0)));
         core.execute(disputeID, 0, 10); // Finish the iterations. We need only 3 but check that it corrects the count.
@@ -272,11 +272,11 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
 
         // Note that these events are emitted only after the first iteration of execute() therefore the juror has been penalized only for 1000 PNK her.
         vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeSet(staker1, newCourtID, 19000, 39000); // 1000 PNK penalty for voteID 0
+        emit SortitionModule.StakeSet(staker1, newCourtID, 19000, 39000); // 1000 PNK penalty for voteID 0
         vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeSet(staker1, newCourtID, 0, 20000); // Starting with 40000 we first nullify the stake and remove 19000 and then remove penalty once since there was only first iteration (40000 - 20000 - 1000)
+        emit SortitionModule.StakeSet(staker1, newCourtID, 0, 20000); // Starting with 40000 we first nullify the stake and remove 19000 and then remove penalty once since there was only first iteration (40000 - 20000 - 1000)
         vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeSet(staker1, GENERAL_COURT, 0, 2000); // 2000 PNK should remain in balance to cover penalties since the first 1000 of locked pnk was already unlocked
+        emit SortitionModule.StakeSet(staker1, GENERAL_COURT, 0, 2000); // 2000 PNK should remain in balance to cover penalties since the first 1000 of locked pnk was already unlocked
         core.execute(disputeID, 0, 3);
 
         assertEq(pinakion.balanceOf(address(core)), 0, "Wrong token balance of the core");
@@ -335,7 +335,7 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
         core.passPeriod(disputeID); // Execution
 
         vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeSet(staker1, GENERAL_COURT, 0, 0); // Juror should have no stake left and should be unstaked from the court automatically.
+        emit SortitionModule.StakeSet(staker1, GENERAL_COURT, 0, 0); // Juror should have no stake left and should be unstaked from the court automatically.
         core.execute(disputeID, 0, 6);
 
         assertEq(pinakion.balanceOf(address(core)), 0, "Wrong token balance of the core");
@@ -397,7 +397,7 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
         core.passPeriod(disputeID); // Execution
 
         vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeSet(staker1, GENERAL_COURT, 0, 0); // Juror balance should be below minStake and should be unstaked from the court automatically.
+        emit SortitionModule.StakeSet(staker1, GENERAL_COURT, 0, 0); // Juror balance should be below minStake and should be unstaked from the court automatically.
         core.execute(disputeID, 0, 6);
 
         assertEq(pinakion.balanceOf(address(core)), 11000, "Wrong token balance of the core");
@@ -460,11 +460,11 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
         assertEq(pinakion.balanceOf(address(core)), 1000, "Wrong token balance of the core");
         assertEq(pinakion.balanceOf(staker1), 999999999999999000, "Wrong token balance of staker1");
 
-        vm.expectRevert(SortitionModuleBase.NotEligibleForWithdrawal.selector);
+        vm.expectRevert(SortitionModule.NotEligibleForWithdrawal.selector);
         sortitionModule.withdrawLeftoverPNK(staker1);
 
         vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.LeftoverPNK(staker1, 1000);
+        emit SortitionModule.LeftoverPNK(staker1, 1000);
         core.execute(disputeID, 0, 6);
 
         (totalStaked, totalLocked, , ) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
@@ -485,7 +485,7 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
         core.transferBySortitionModule(staker1, 1000);
 
         vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.LeftoverPNKWithdrawn(staker1, 1000);
+        emit SortitionModule.LeftoverPNKWithdrawn(staker1, 1000);
         sortitionModule.withdrawLeftoverPNK(staker1);
 
         (totalStaked, , , ) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
diff --git a/contracts/test/foundry/KlerosCore_Initialization.t.sol b/contracts/test/foundry/KlerosCore_Initialization.t.sol
index d9113bbb7..d6df4a932 100644
--- a/contracts/test/foundry/KlerosCore_Initialization.t.sol
+++ b/contracts/test/foundry/KlerosCore_Initialization.t.sol
@@ -123,12 +123,14 @@ contract KlerosCore_InitializationTest is KlerosCore_TestBase {
         DisputeKitClassic newDisputeKit = DisputeKitClassic(address(proxyDk));
 
         bytes memory initDataSm = abi.encodeWithSignature(
-            "initialize(address,address,uint256,uint256,address)",
+            "initialize(address,address,uint256,uint256,address,uint256,uint256)",
             newOwner,
             address(proxyCore),
             newMinStakingTime,
             newMaxDrawingTime,
-            newRng
+            newRng,
+            type(int256).max,
+            type(int256).max
         );
 
         UUPSProxy proxySm = new UUPSProxy(address(smLogic), initDataSm);
diff --git a/contracts/test/foundry/KlerosCore_RNG.t.sol b/contracts/test/foundry/KlerosCore_RNG.t.sol
index da3df03ed..0afd0ba43 100644
--- a/contracts/test/foundry/KlerosCore_RNG.t.sol
+++ b/contracts/test/foundry/KlerosCore_RNG.t.sol
@@ -2,7 +2,7 @@
 pragma solidity ^0.8.24;
 
 import {KlerosCore_TestBase} from "./KlerosCore_TestBase.sol";
-import {SortitionModuleBase} from "../../src/arbitration/SortitionModuleBase.sol";
+import {SortitionModule} from "../../src/arbitration/SortitionModule.sol";
 import {RNGWithFallback, IRNG} from "../../src/rng/RNGWithFallback.sol";
 import {RNGMock} from "../../src/test/RNGMock.sol";
 import "../../src/libraries/Constants.sol";
@@ -34,7 +34,7 @@ contract KlerosCore_RNGTest is KlerosCore_TestBase {
         sortitionModule.passPhase(); // Generating
         assertEq(rngFallback.requestTimestamp(), block.timestamp, "Wrong request timestamp");
 
-        vm.expectRevert(SortitionModuleBase.RandomNumberNotReady.selector);
+        vm.expectRevert(SortitionModule.RandomNumberNotReady.selector);
         sortitionModule.passPhase();
 
         vm.warp(block.timestamp + fallbackTimeout + 1);
diff --git a/contracts/test/foundry/KlerosCore_Staking.t.sol b/contracts/test/foundry/KlerosCore_Staking.t.sol
index 805b8ae7e..070a38716 100644
--- a/contracts/test/foundry/KlerosCore_Staking.t.sol
+++ b/contracts/test/foundry/KlerosCore_Staking.t.sol
@@ -3,7 +3,7 @@ pragma solidity ^0.8.24;
 
 import {KlerosCore_TestBase} from "./KlerosCore_TestBase.sol";
 import {KlerosCore} from "../../src/arbitration/KlerosCore.sol";
-import {SortitionModuleBase} from "../../src/arbitration/SortitionModuleBase.sol";
+import {SortitionModule} from "../../src/arbitration/SortitionModule.sol";
 import {ISortitionModule} from "../../src/arbitration/interfaces/ISortitionModule.sol";
 import {IKlerosCore, KlerosCoreSnapshotProxy} from "../../src/arbitration/view/KlerosCoreSnapshotProxy.sol";
 import "../../src/libraries/Constants.sol";
@@ -39,7 +39,7 @@ contract KlerosCore_StakingTest is KlerosCore_TestBase {
 
         vm.prank(staker1);
         vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeSet(staker1, GENERAL_COURT, 1001, 1001);
+        emit SortitionModule.StakeSet(staker1, GENERAL_COURT, 1001, 1001);
         core.setStake(GENERAL_COURT, 1001);
 
         (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts) = sortitionModule
@@ -65,7 +65,7 @@ contract KlerosCore_StakingTest is KlerosCore_TestBase {
         // Increase stake one more time to verify the correct behavior
         vm.prank(staker1);
         vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeSet(staker1, GENERAL_COURT, 2000, 2000);
+        emit SortitionModule.StakeSet(staker1, GENERAL_COURT, 2000, 2000);
         core.setStake(GENERAL_COURT, 2000);
 
         (totalStaked, totalLocked, stakedInCourt, nbCourts) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
@@ -188,7 +188,7 @@ contract KlerosCore_StakingTest is KlerosCore_TestBase {
 
         vm.prank(staker1);
         vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeDelayed(staker1, GENERAL_COURT, 1500);
+        emit SortitionModule.StakeDelayed(staker1, GENERAL_COURT, 1500);
         core.setStake(GENERAL_COURT, 1500);
 
         uint256 delayedStakeId = sortitionModule.delayedStakeWriteIndex();
@@ -234,7 +234,7 @@ contract KlerosCore_StakingTest is KlerosCore_TestBase {
 
         vm.prank(staker1);
         vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeDelayed(staker1, GENERAL_COURT, 1800);
+        emit SortitionModule.StakeDelayed(staker1, GENERAL_COURT, 1800);
         core.setStake(GENERAL_COURT, 1800);
 
         (uint256 totalStaked, , uint256 stakedInCourt, ) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
@@ -301,7 +301,7 @@ contract KlerosCore_StakingTest is KlerosCore_TestBase {
         vm.prank(staker2);
         core.setStake(GENERAL_COURT, 10000);
 
-        vm.expectRevert(SortitionModuleBase.NoDelayedStakeToExecute.selector);
+        vm.expectRevert(SortitionModule.NoDelayedStakeToExecute.selector);
         sortitionModule.executeDelayedStakes(5);
 
         // Set the stake and create a dispute to advance the phase
@@ -314,13 +314,13 @@ contract KlerosCore_StakingTest is KlerosCore_TestBase {
         uint256 disputeID = 0;
         core.draw(disputeID, DEFAULT_NB_OF_JURORS);
 
-        vm.expectRevert(SortitionModuleBase.NotStakingPhase.selector);
+        vm.expectRevert(SortitionModule.NotStakingPhase.selector);
         sortitionModule.executeDelayedStakes(5);
 
         // Create delayed stake
         vm.prank(staker1);
         vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeDelayed(staker1, GENERAL_COURT, 1500);
+        emit SortitionModule.StakeDelayed(staker1, GENERAL_COURT, 1500);
         core.setStake(GENERAL_COURT, 1500);
 
         assertEq(pinakion.balanceOf(address(core)), 10000, "Wrong token balance of the core"); // Balance should not increase because the stake was delayed
@@ -329,14 +329,14 @@ contract KlerosCore_StakingTest is KlerosCore_TestBase {
         // Create delayed stake for another staker
         vm.prank(staker2);
         vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeDelayed(staker2, GENERAL_COURT, 0);
+        emit SortitionModule.StakeDelayed(staker2, GENERAL_COURT, 0);
         core.setStake(GENERAL_COURT, 0);
         assertEq(pinakion.balanceOf(staker2), 999999999999990000, "Wrong token balance of staker2"); // Balance should not change since wrong phase
 
         // Create another delayed stake for staker1 on top of it to check the execution
         vm.prank(staker1);
         vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeDelayed(staker1, GENERAL_COURT, 1800);
+        emit SortitionModule.StakeDelayed(staker1, GENERAL_COURT, 1800);
         core.setStake(GENERAL_COURT, 1800);
 
         assertEq(sortitionModule.delayedStakeWriteIndex(), 3, "Wrong delayedStakeWriteIndex");
@@ -384,9 +384,9 @@ contract KlerosCore_StakingTest is KlerosCore_TestBase {
 
         // 2 events should be emitted but the 2nd stake supersedes the first one in the end.
         vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeSet(staker1, GENERAL_COURT, 1500, 1500);
+        emit SortitionModule.StakeSet(staker1, GENERAL_COURT, 1500, 1500);
         vm.expectEmit(true, true, true, true);
-        emit SortitionModuleBase.StakeSet(staker1, GENERAL_COURT, 1800, 1800);
+        emit SortitionModule.StakeSet(staker1, GENERAL_COURT, 1800, 1800);
         sortitionModule.executeDelayedStakes(20); // Deliberately ask for more iterations than needed
 
         assertEq(sortitionModule.delayedStakeWriteIndex(), 3, "Wrong delayedStakeWriteIndex");
diff --git a/contracts/test/foundry/KlerosCore_TestBase.sol b/contracts/test/foundry/KlerosCore_TestBase.sol
index 612db5bb7..17132cb28 100644
--- a/contracts/test/foundry/KlerosCore_TestBase.sol
+++ b/contracts/test/foundry/KlerosCore_TestBase.sol
@@ -9,7 +9,7 @@ import {IDisputeKit} from "../../src/arbitration/interfaces/IDisputeKit.sol";
 import {DisputeKitClassic, DisputeKitClassicBase} from "../../src/arbitration/dispute-kits/DisputeKitClassic.sol";
 import {DisputeKitSybilResistant} from "../../src/arbitration/dispute-kits/DisputeKitSybilResistant.sol";
 import {ISortitionModule} from "../../src/arbitration/interfaces/ISortitionModule.sol";
-import {SortitionModuleMock, SortitionModuleBase} from "../../src/test/SortitionModuleMock.sol";
+import {SortitionModuleMock, SortitionModule} from "../../src/test/SortitionModuleMock.sol";
 import {UUPSProxy} from "../../src/proxy/UUPSProxy.sol";
 import {BlockHashRNG} from "../../src/rng/BlockHashRNG.sol";
 import {RNGWithFallback, IRNG} from "../../src/rng/RNGWithFallback.sol";
@@ -126,12 +126,14 @@ abstract contract KlerosCore_TestBase is Test {
         disputeKit = DisputeKitClassic(address(proxyDk));
 
         bytes memory initDataSm = abi.encodeWithSignature(
-            "initialize(address,address,uint256,uint256,address)",
+            "initialize(address,address,uint256,uint256,address,uint256,uint256)",
             owner,
             address(proxyCore),
             minStakingTime,
             maxDrawingTime,
-            rng
+            rng,
+            type(int256).max,
+            type(int256).max
         );
 
         UUPSProxy proxySm = new UUPSProxy(address(smLogic), initDataSm);

From 758a809a6237ed2d171adb214b23a6c629a64613 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 4 Sep 2025 19:17:02 +0100
Subject: [PATCH 097/175] test: extra init asserts in foundry tests

---
 contracts/test/foundry/KlerosCore_Initialization.t.sol | 10 ++++++++--
 contracts/test/foundry/KlerosCore_TestBase.sol         |  4 ++--
 2 files changed, 10 insertions(+), 4 deletions(-)

diff --git a/contracts/test/foundry/KlerosCore_Initialization.t.sol b/contracts/test/foundry/KlerosCore_Initialization.t.sol
index d6df4a932..7e521063d 100644
--- a/contracts/test/foundry/KlerosCore_Initialization.t.sol
+++ b/contracts/test/foundry/KlerosCore_Initialization.t.sol
@@ -45,6 +45,9 @@ contract KlerosCore_InitializationTest is KlerosCore_TestBase {
         assertEq(core.isSupported(GENERAL_COURT, NULL_DISPUTE_KIT), false, "General court null dk should be false");
         assertEq(core.isSupported(GENERAL_COURT, DISPUTE_KIT_CLASSIC), true, "General court classic dk should be true");
         assertEq(core.paused(), false, "Wrong paused value");
+        assertEq(core.wNative(), address(wNative), "Wrong wNative");
+        assertEq(address(core.jurorNft()), address(0), "Wrong jurorNft");
+        assertEq(core.arbitrableWhitelistEnabled(), false, "Wrong arbitrableWhitelistEnabled");
 
         assertEq(pinakion.name(), "Pinakion", "Wrong token name");
         assertEq(pinakion.symbol(), "PNK", "Wrong token symbol");
@@ -71,6 +74,9 @@ contract KlerosCore_InitializationTest is KlerosCore_TestBase {
         assertEq(sortitionModule.randomNumber(), 0, "randomNumber should be 0");
         assertEq(sortitionModule.delayedStakeWriteIndex(), 0, "delayedStakeWriteIndex should be 0");
         assertEq(sortitionModule.delayedStakeReadIndex(), 1, "Wrong delayedStakeReadIndex");
+        assertEq(sortitionModule.maxStakePerJuror(), type(uint256).max, "Wrong maxStakePerJuror");
+        assertEq(sortitionModule.maxTotalStaked(), type(uint256).max, "Wrong maxTotalStaked");
+        assertEq(sortitionModule.totalStaked(), 0, "Wrong totalStaked");
 
         (uint256 K, uint256 nodeLength) = sortitionModule.getSortitionProperties(bytes32(uint256(FORKING_COURT)));
         assertEq(K, 5, "Wrong tree K FORKING_COURT");
@@ -129,8 +135,8 @@ contract KlerosCore_InitializationTest is KlerosCore_TestBase {
             newMinStakingTime,
             newMaxDrawingTime,
             newRng,
-            type(int256).max,
-            type(int256).max
+            type(uint256).max,
+            type(uint256).max
         );
 
         UUPSProxy proxySm = new UUPSProxy(address(smLogic), initDataSm);
diff --git a/contracts/test/foundry/KlerosCore_TestBase.sol b/contracts/test/foundry/KlerosCore_TestBase.sol
index 17132cb28..9418f2444 100644
--- a/contracts/test/foundry/KlerosCore_TestBase.sol
+++ b/contracts/test/foundry/KlerosCore_TestBase.sol
@@ -132,8 +132,8 @@ abstract contract KlerosCore_TestBase is Test {
             minStakingTime,
             maxDrawingTime,
             rng,
-            type(int256).max,
-            type(int256).max
+            type(uint256).max,
+            type(uint256).max
         );
 
         UUPSProxy proxySm = new UUPSProxy(address(smLogic), initDataSm);

From 7a5d08df33f6872630ba38e0b880b7aad5bf137e Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 4 Sep 2025 22:55:57 +0100
Subject: [PATCH 098/175] fix: hardhat tests, deploy scripts, unnecessary
 virtual keyword

---
 .../deploy/00-home-chain-arbitration-neo.ts   | 24 +++++++++----------
 contracts/deploy/00-home-chain-arbitration.ts | 11 ++++++++-
 contracts/src/arbitration/KlerosCore.sol      | 12 +++++++---
 contracts/src/arbitration/SortitionModule.sol |  9 ++++---
 contracts/test/arbitration/staking-neo.ts     | 16 ++++++-------
 5 files changed, 42 insertions(+), 30 deletions(-)

diff --git a/contracts/deploy/00-home-chain-arbitration-neo.ts b/contracts/deploy/00-home-chain-arbitration-neo.ts
index d5d8a136c..879573676 100644
--- a/contracts/deploy/00-home-chain-arbitration-neo.ts
+++ b/contracts/deploy/00-home-chain-arbitration-neo.ts
@@ -6,7 +6,7 @@ import { changeCurrencyRate } from "./utils/klerosCoreHelper";
 import { HomeChains, isSkipped, isDevnet, PNK, ETH } from "./utils";
 import { getContractOrDeploy, getContractOrDeployUpgradable } from "./utils/getContractOrDeploy";
 import { deployERC20AndFaucet, deployERC721 } from "./utils/deployTokens";
-import { ChainlinkRNG, DisputeKitClassic, KlerosCoreNeo, RNGWithFallback } from "../typechain-types";
+import { ChainlinkRNG, DisputeKitClassic, KlerosCore, RNGWithFallback } from "../typechain-types";
 
 const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment) => {
   const { ethers, deployments, getNamedAccounts, getChainId } = hre;
@@ -29,18 +29,17 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
   await deployUpgradable(deployments, "EvidenceModule", { from: deployer, args: [deployer], log: true });
 
   const classicDisputeKitID = 1; // Classic DK
-  const disputeKit = await deployUpgradable(deployments, "DisputeKitClassicNeo", {
+  const disputeKit = await deployUpgradable(deployments, "DisputeKitClassic", {
     from: deployer,
-    contract: "DisputeKitClassic",
     args: [deployer, ZeroAddress, weth.target, classicDisputeKitID],
     log: true,
   });
 
-  let klerosCoreAddress = await deployments.getOrNull("KlerosCoreNeo").then((deployment) => deployment?.address);
+  let klerosCoreAddress = await deployments.getOrNull("KlerosCore").then((deployment) => deployment?.address);
   if (!klerosCoreAddress) {
     const nonce = await ethers.provider.getTransactionCount(deployer);
     klerosCoreAddress = getContractAddress(deployer, nonce + 3); // deployed on the 4th tx (nonce+3): SortitionModule Impl tx, SortitionModule Proxy tx, KlerosCore Impl tx, KlerosCore Proxy tx
-    console.log("calculated future KlerosCoreNeo address for nonce %d: %s", nonce + 3, klerosCoreAddress);
+    console.log("calculated future KlerosCore address for nonce %d: %s", nonce + 3, klerosCoreAddress);
   }
   const devnet = isDevnet(hre.network);
   const minStakingTime = devnet ? 180 : 1800;
@@ -48,7 +47,7 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
   const rngWithFallback = await ethers.getContract<RNGWithFallback>("RNGWithFallback");
   const maxStakePerJuror = PNK(2_000);
   const maxTotalStaked = PNK(2_000_000);
-  const sortitionModule = await deployUpgradable(deployments, "SortitionModuleNeo", {
+  const sortitionModule = await deployUpgradable(deployments, "SortitionModule", {
     from: deployer,
     args: [
       deployer,
@@ -66,7 +65,7 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
   const alpha = 10000;
   const feeForJuror = ETH(0.1);
   const jurorsForCourtJump = 256;
-  const klerosCore = await deployUpgradable(deployments, "KlerosCoreNeo", {
+  const klerosCore = await deployUpgradable(deployments, "KlerosCore", {
     from: deployer,
     args: [
       deployer,
@@ -79,14 +78,14 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
       [0, 0, 0, 10], // evidencePeriod, commitPeriod, votePeriod, appealPeriod
       ethers.toBeHex(5), // Extra data for sortition module will return the default value of K
       sortitionModule.address,
-      nft.target,
       weth.target,
+      nft.target,
     ],
     log: true,
   }); // nonce+2 (implementation), nonce+3 (proxy)
 
   // disputeKit.changeCore() only if necessary
-  const disputeKitContract = await hre.ethers.getContract<DisputeKitClassic>("DisputeKitClassicNeo");
+  const disputeKitContract = await hre.ethers.getContract<DisputeKitClassic>("DisputeKitClassic");
   const currentCore = await disputeKitContract.core();
   if (currentCore !== klerosCore.address) {
     console.log(`disputeKit.changeCore(${klerosCore.address})`);
@@ -100,7 +99,7 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
     await rngWithFallback.changeConsumer(sortitionModule.address);
   }
 
-  const core = await hre.ethers.getContract<KlerosCoreNeo>("KlerosCoreNeo");
+  const core = await hre.ethers.getContract<KlerosCore>("KlerosCore");
   try {
     await changeCurrencyRate(core, await weth.getAddress(), true, 1, 1);
   } catch (e) {
@@ -113,9 +112,8 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
     log: true,
   });
 
-  const resolver = await deploy("DisputeResolverNeo", {
+  const resolver = await deploy("DisputeResolver", {
     from: deployer,
-    contract: "DisputeResolver",
     args: [core.target, disputeTemplateRegistry.target],
     log: true,
   });
@@ -157,7 +155,7 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
   });
 };
 
-deployArbitration.tags = ["ArbitrationNeo"];
+deployArbitration.tags = ["ArbitrationMainnet"];
 deployArbitration.dependencies = ["ChainlinkRNG"];
 deployArbitration.skip = async ({ network }) => {
   return isSkipped(network, !HomeChains[network.config.chainId ?? 0]);
diff --git a/contracts/deploy/00-home-chain-arbitration.ts b/contracts/deploy/00-home-chain-arbitration.ts
index 25291052d..72334eb77 100644
--- a/contracts/deploy/00-home-chain-arbitration.ts
+++ b/contracts/deploy/00-home-chain-arbitration.ts
@@ -53,7 +53,15 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
   const rngWithFallback = await ethers.getContract<RNGWithFallback>("RNGWithFallback");
   const sortitionModule = await deployUpgradable(deployments, "SortitionModule", {
     from: deployer,
-    args: [deployer, klerosCoreAddress, minStakingTime, maxFreezingTime, rngWithFallback.target],
+    args: [
+      deployer,
+      klerosCoreAddress,
+      minStakingTime,
+      maxFreezingTime,
+      rngWithFallback.target,
+      ethers.MaxUint256, // maxStakePerJuror
+      ethers.MaxUint256, // maxTotalStaked
+    ],
     log: true,
   }); // nonce (implementation), nonce+1 (proxy)
 
@@ -75,6 +83,7 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
       ethers.toBeHex(5), // Extra data for sortition module will return the default value of K
       sortitionModule.address,
       weth.target,
+      ZeroAddress, // jurorNft
     ],
     log: true,
   }); // nonce+2 (implementation), nonce+3 (proxy)
diff --git a/contracts/src/arbitration/KlerosCore.sol b/contracts/src/arbitration/KlerosCore.sol
index f7d6cf493..a8c78a910 100644
--- a/contracts/src/arbitration/KlerosCore.sol
+++ b/contracts/src/arbitration/KlerosCore.sol
@@ -487,6 +487,12 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         emit NewCurrencyRate(_feeToken, _rateInEth, _rateDecimals);
     }
 
+    /// @dev Changes the `jurorNft` storage variable.
+    /// @param _jurorNft The new value for the `jurorNft` storage variable.
+    function changeJurorNft(IERC721 _jurorNft) external onlyByOwner {
+        jurorNft = _jurorNft;
+    }
+
     /// @dev Adds or removes an arbitrable from whitelist.
     /// @param _arbitrable Arbitrable address.
     /// @param _allowed Whether add or remove permission.
@@ -507,7 +513,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
     /// @param _courtID The ID of the court.
     /// @param _newStake The new stake.
     /// Note that the existing delayed stake will be nullified as non-relevant.
-    function setStake(uint96 _courtID, uint256 _newStake) external virtual whenNotPaused {
+    function setStake(uint96 _courtID, uint256 _newStake) external whenNotPaused {
         if (address(jurorNft) != address(0) && jurorNft.balanceOf(msg.sender) == 0) revert NotEligibleForStaking();
         _setStake(msg.sender, _courtID, _newStake, false, OnError.Revert);
     }
@@ -559,7 +565,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         bytes memory _extraData,
         IERC20 _feeToken,
         uint256 _feeAmount
-    ) internal virtual returns (uint256 disputeID) {
+    ) internal returns (uint256 disputeID) {
         if (arbitrableWhitelistEnabled && !arbitrableWhitelist[msg.sender]) revert ArbitrableNotWhitelisted();
         (uint96 courtID, , uint256 disputeKitID) = _extraDataToCourtIDMinJurorsDisputeKit(_extraData);
         if (!courts[courtID].supportedDisputeKits[disputeKitID]) revert DisputeKitNotSupportedByCourt();
@@ -1236,7 +1242,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
     }
 
     /// @dev It may revert depending on the _onError parameter.
-    function _stakingFailed(OnError _onError, StakingResult _result) internal pure virtual {
+    function _stakingFailed(OnError _onError, StakingResult _result) internal pure {
         if (_onError == OnError.Return) return;
         if (_result == StakingResult.StakingTransferFailed) revert StakingTransferFailed();
         if (_result == StakingResult.UnstakingTransferFailed) revert UnstakingTransferFailed();
diff --git a/contracts/src/arbitration/SortitionModule.sol b/contracts/src/arbitration/SortitionModule.sol
index 8c0f4de86..bf61255ae 100644
--- a/contracts/src/arbitration/SortitionModule.sol
+++ b/contracts/src/arbitration/SortitionModule.sol
@@ -278,7 +278,7 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
         uint96 _courtID,
         uint256 _newStake,
         bool _noDelay
-    ) internal virtual returns (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult) {
+    ) internal returns (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult) {
         Juror storage juror = jurors[_account];
         uint256 currentStake = stakeOf(_account, _courtID);
         bool stakeIncrease = _newStake > currentStake;
@@ -319,13 +319,12 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
             totalStaked += stakeChange;
         } else {
             pnkWithdrawal = stakeChange;
-            totalStaked -= stakeChange;
-
-            // Ensure locked tokens remain in the contract. They can only be released during Execution.
             uint256 possibleWithdrawal = juror.stakedPnk > juror.lockedPnk ? juror.stakedPnk - juror.lockedPnk : 0;
             if (pnkWithdrawal > possibleWithdrawal) {
+                // Ensure locked tokens remain in the contract. They can only be released during Execution.
                 pnkWithdrawal = possibleWithdrawal;
             }
+            totalStaked -= pnkWithdrawal;
         }
         return (pnkDeposit, pnkWithdrawal, StakingResult.Successful);
     }
@@ -417,7 +416,7 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
         uint256 _pnkDeposit,
         uint256 _pnkWithdrawal,
         uint256 _newStake
-    ) internal virtual {
+    ) internal {
         Juror storage juror = jurors[_account];
         if (_pnkDeposit > 0) {
             uint256 currentStake = stakeOf(_account, _courtID);
diff --git a/contracts/test/arbitration/staking-neo.ts b/contracts/test/arbitration/staking-neo.ts
index fb36787d8..9cd83efeb 100644
--- a/contracts/test/arbitration/staking-neo.ts
+++ b/contracts/test/arbitration/staking-neo.ts
@@ -3,8 +3,8 @@ import {
   PNK,
   RandomizerRNG,
   RandomizerMock,
-  SortitionModuleNeo,
-  KlerosCoreNeo,
+  SortitionModule,
+  KlerosCore,
   TestERC721,
   DisputeResolver,
   ChainlinkRNG,
@@ -41,8 +41,8 @@ describe("Staking", async () => {
   let juror: HardhatEthersSigner;
   let guardian: HardhatEthersSigner;
   let pnk: PNK;
-  let core: KlerosCoreNeo;
-  let sortition: SortitionModuleNeo;
+  let core: KlerosCore;
+  let sortition: SortitionModule;
   let rng: ChainlinkRNG;
   let vrfCoordinator: ChainlinkVRFCoordinatorV2Mock;
   let nft: TestERC721;
@@ -52,16 +52,16 @@ describe("Staking", async () => {
   const deployUnhappy = async () => {
     ({ deployer } = await getNamedAccounts());
 
-    await deployments.fixture(["ArbitrationNeo"], {
+    await deployments.fixture(["ArbitrationMainnet"], {
       fallbackToGlobal: true,
       keepExistingDeployments: false,
     });
     pnk = await ethers.getContract<PNK>("PNK");
-    core = await ethers.getContract<KlerosCoreNeo>("KlerosCoreNeo");
-    sortition = await ethers.getContract<SortitionModuleNeo>("SortitionModuleNeo");
+    core = await ethers.getContract<KlerosCore>("KlerosCore");
+    sortition = await ethers.getContract<SortitionModule>("SortitionModule");
     rng = await ethers.getContract<ChainlinkRNG>("ChainlinkRNG");
     vrfCoordinator = await ethers.getContract<ChainlinkVRFCoordinatorV2Mock>("ChainlinkVRFCoordinator");
-    resolver = await ethers.getContract<DisputeResolver>("DisputeResolverNeo");
+    resolver = await ethers.getContract<DisputeResolver>("DisputeResolver");
     nft = await ethers.getContract<TestERC721>("KlerosV2NeoEarlyUser");
 
     // Juror signer setup and funding

From e9f8a0a186f1cbf1ad3c5853e4035f931d7cd894 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 4 Sep 2025 22:58:16 +0100
Subject: [PATCH 099/175] refactor: renamed 00-home-chain-arbitration-neo into
 00-home-chain-arbitration-mainnet

---
 ...in-arbitration-neo.ts => 00-home-chain-arbitration-mainnet.ts} | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename contracts/deploy/{00-home-chain-arbitration-neo.ts => 00-home-chain-arbitration-mainnet.ts} (100%)

diff --git a/contracts/deploy/00-home-chain-arbitration-neo.ts b/contracts/deploy/00-home-chain-arbitration-mainnet.ts
similarity index 100%
rename from contracts/deploy/00-home-chain-arbitration-neo.ts
rename to contracts/deploy/00-home-chain-arbitration-mainnet.ts

From 923bd7bdc2f3af082c050a1d2247f55347e72edd Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 4 Sep 2025 23:14:58 +0100
Subject: [PATCH 100/175] chore: removed traces of Neo in many scripts and
 filenames

---
 ...ainnet-neo.json => courts.v2.mainnet.json} |  0
 ...nnet-neo.json => policies.v2.mainnet.json} |  0
 .../00-home-chain-arbitration-mainnet.ts      |  2 +-
 contracts/deploy/00-home-chain-arbitration.ts |  2 +-
 .../deploy/change-sortition-module-rng.ts     | 14 ++-----
 contracts/deploy/upgrade-all.ts               | 41 ++++---------------
 contracts/deploy/utils/klerosCoreHelper.ts    |  4 +-
 contracts/package.json                        |  6 +--
 .../scripts/generateDeploymentsMarkdown.sh    |  6 +--
 contracts/scripts/storage-layout.ts           |  4 +-
 10 files changed, 22 insertions(+), 57 deletions(-)
 rename contracts/config/{courts.v2.mainnet-neo.json => courts.v2.mainnet.json} (100%)
 rename contracts/config/{policies.v2.mainnet-neo.json => policies.v2.mainnet.json} (100%)

diff --git a/contracts/config/courts.v2.mainnet-neo.json b/contracts/config/courts.v2.mainnet.json
similarity index 100%
rename from contracts/config/courts.v2.mainnet-neo.json
rename to contracts/config/courts.v2.mainnet.json
diff --git a/contracts/config/policies.v2.mainnet-neo.json b/contracts/config/policies.v2.mainnet.json
similarity index 100%
rename from contracts/config/policies.v2.mainnet-neo.json
rename to contracts/config/policies.v2.mainnet.json
diff --git a/contracts/deploy/00-home-chain-arbitration-mainnet.ts b/contracts/deploy/00-home-chain-arbitration-mainnet.ts
index 879573676..a3d87f51f 100644
--- a/contracts/deploy/00-home-chain-arbitration-mainnet.ts
+++ b/contracts/deploy/00-home-chain-arbitration-mainnet.ts
@@ -6,7 +6,7 @@ import { changeCurrencyRate } from "./utils/klerosCoreHelper";
 import { HomeChains, isSkipped, isDevnet, PNK, ETH } from "./utils";
 import { getContractOrDeploy, getContractOrDeployUpgradable } from "./utils/getContractOrDeploy";
 import { deployERC20AndFaucet, deployERC721 } from "./utils/deployTokens";
-import { ChainlinkRNG, DisputeKitClassic, KlerosCore, RNGWithFallback } from "../typechain-types";
+import { DisputeKitClassic, KlerosCore, RNGWithFallback } from "../typechain-types";
 
 const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment) => {
   const { ethers, deployments, getNamedAccounts, getChainId } = hre;
diff --git a/contracts/deploy/00-home-chain-arbitration.ts b/contracts/deploy/00-home-chain-arbitration.ts
index 72334eb77..1c4c29695 100644
--- a/contracts/deploy/00-home-chain-arbitration.ts
+++ b/contracts/deploy/00-home-chain-arbitration.ts
@@ -6,7 +6,7 @@ import { changeCurrencyRate } from "./utils/klerosCoreHelper";
 import { HomeChains, isSkipped, isDevnet, PNK, ETH, Courts } from "./utils";
 import { getContractOrDeploy, getContractOrDeployUpgradable } from "./utils/getContractOrDeploy";
 import { deployERC20AndFaucet } from "./utils/deployTokens";
-import { ChainlinkRNG, DisputeKitClassic, KlerosCore, RNGWithFallback } from "../typechain-types";
+import { DisputeKitClassic, KlerosCore, RNGWithFallback } from "../typechain-types";
 
 const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment) => {
   const { ethers, deployments, getNamedAccounts, getChainId } = hre;
diff --git a/contracts/deploy/change-sortition-module-rng.ts b/contracts/deploy/change-sortition-module-rng.ts
index 2b5e72435..986e408ec 100644
--- a/contracts/deploy/change-sortition-module-rng.ts
+++ b/contracts/deploy/change-sortition-module-rng.ts
@@ -1,8 +1,8 @@
 import { HardhatRuntimeEnvironment } from "hardhat/types";
 import { DeployFunction } from "hardhat-deploy/types";
-import { HomeChains, isMainnet, isSkipped } from "./utils";
+import { HomeChains, isSkipped } from "./utils";
 import { ethers } from "hardhat";
-import { ChainlinkRNG, SortitionModule, SortitionModuleNeo } from "../typechain-types";
+import { ChainlinkRNG, SortitionModule } from "../typechain-types";
 
 const task: DeployFunction = async (hre: HardhatRuntimeEnvironment) => {
   const { getNamedAccounts, getChainId } = hre;
@@ -13,15 +13,7 @@ const task: DeployFunction = async (hre: HardhatRuntimeEnvironment) => {
   console.log("deploying to %s with deployer %s", HomeChains[chainId], deployer);
 
   const chainlinkRng = await ethers.getContract<ChainlinkRNG>("ChainlinkRNG");
-
-  let sortitionModule: SortitionModule | SortitionModuleNeo;
-  if (isMainnet(hre.network)) {
-    console.log("Using SortitionModuleNeo");
-    sortitionModule = await ethers.getContract<SortitionModuleNeo>("SortitionModuleNeo");
-  } else {
-    console.log("Using SortitionModule");
-    sortitionModule = await ethers.getContract<SortitionModule>("SortitionModule");
-  }
+  const sortitionModule = await ethers.getContract<SortitionModule>("SortitionModule");
 
   console.log(`chainlinkRng.changeConsumer(${sortitionModule.target})`);
   await chainlinkRng.changeConsumer(sortitionModule.target);
diff --git a/contracts/deploy/upgrade-all.ts b/contracts/deploy/upgrade-all.ts
index dfd0d882c..572ed7187 100644
--- a/contracts/deploy/upgrade-all.ts
+++ b/contracts/deploy/upgrade-all.ts
@@ -3,7 +3,7 @@ import { DeployFunction } from "hardhat-deploy/types";
 import { prompt, print } from "gluegun";
 import { deployUpgradable } from "./utils/deployUpgradable";
 import { HomeChains, isSkipped } from "./utils";
-import { getContractNames, getContractNamesFromNetwork } from "../scripts/utils/contracts";
+import { getContractNamesFromNetwork } from "../scripts/utils/contracts";
 
 const { bold } = print.colors;
 
@@ -36,21 +36,7 @@ const deployUpgradeAll: DeployFunction = async (hre: HardhatRuntimeEnvironment)
     try {
       print.highlight(`🔍 Validating upgrade of ${bold(contractName)}`);
 
-      const contractNameWithoutNeo = contractName.replace(/Neo.*$/, "");
       let compareStorageOptions = { contract: contractName } as any;
-      if (hre.network.name === "arbitrum") {
-        switch (contractName) {
-          case "KlerosCoreNeo":
-          case "SortitionModuleNeo":
-            compareStorageOptions = { deployedArtifact: `${contractName}_Implementation`, contract: contractName };
-            break;
-          default:
-            compareStorageOptions = {
-              deployedArtifact: `${contractName}_Implementation`,
-              contract: contractNameWithoutNeo,
-            };
-        }
-      }
       await hre.run("compare-storage", compareStorageOptions);
       print.newline();
       print.highlight(`💣 Upgrading ${bold(contractName)}`);
@@ -65,25 +51,12 @@ const deployUpgradeAll: DeployFunction = async (hre: HardhatRuntimeEnvironment)
       }
       print.info(`Upgrading ${contractName}...`);
 
-      switch (contractName) {
-        case "DisputeKitClassicNeo":
-        case "DisputeResolverNeo":
-          await deployUpgradable(deployments, contractName, {
-            contract: contractName,
-            newImplementation: contractNameWithoutNeo,
-            initializer,
-            from: deployer,
-            args, // Warning: do not reinitialize existing state variables, only the new ones
-          });
-          break;
-        default:
-          await deployUpgradable(deployments, contractName, {
-            newImplementation: contractName,
-            initializer,
-            from: deployer,
-            args, // Warning: do not reinitialize existing state variables, only the new ones
-          });
-      }
+      await deployUpgradable(deployments, contractName, {
+        newImplementation: contractName,
+        initializer,
+        from: deployer,
+        args, // Warning: do not reinitialize existing state variables, only the new ones
+      });
       print.info(`Verifying ${contractName} on Etherscan...`);
       await hre.run("etherscan-verify", { contractName: `${contractName}_Implementation` });
     } catch (err) {
diff --git a/contracts/deploy/utils/klerosCoreHelper.ts b/contracts/deploy/utils/klerosCoreHelper.ts
index 3419ae64e..3325652a3 100644
--- a/contracts/deploy/utils/klerosCoreHelper.ts
+++ b/contracts/deploy/utils/klerosCoreHelper.ts
@@ -1,8 +1,8 @@
-import { KlerosCore, KlerosCoreNeo, KlerosCoreRuler, KlerosCoreUniversity } from "../../typechain-types";
+import { KlerosCore, KlerosCoreRuler, KlerosCoreUniversity } from "../../typechain-types";
 import { BigNumberish, toBigInt } from "ethers";
 
 export const changeCurrencyRate = async (
-  core: KlerosCore | KlerosCoreNeo | KlerosCoreRuler | KlerosCoreUniversity,
+  core: KlerosCore | KlerosCoreRuler | KlerosCoreUniversity,
   erc20: string,
   accepted: boolean,
   rateInEth: BigNumberish,
diff --git a/contracts/package.json b/contracts/package.json
index 0bca4e700..fd40b404d 100644
--- a/contracts/package.json
+++ b/contracts/package.json
@@ -91,11 +91,11 @@
     "docbuild": "scripts/docPreprocess.sh && forge doc --build --out dist && scripts/docPostprocess.sh",
     "populate:courts:devnet": "hardhat populate:courts --from v2_devnet  --network arbitrumSepoliaDevnet",
     "populate:courts:testnet": "hardhat populate:courts --from v2_testnet  --network arbitrumSepolia",
-    "populate:courts:mainnetNeo": "hardhat populate:courts --core-type neo --from v2_mainnet_neo  --network arbitrum",
-    "populate:policiesUris": "scripts/setPoliciesURIs.sh config/policies.v2.{devnet,testnet,mainnet-neo}.json",
+    "populate:courts:mainnet": "hardhat populate:courts --from v2_mainnet  --network arbitrum",
+    "populate:policiesUris": "scripts/setPoliciesURIs.sh config/policies.v2.{devnet,testnet,mainnet}.json",
     "populate:policies:devnet": "hardhat populate:policy-registry --from v2_devnet --network arbitrumSepoliaDevnet",
     "populate:policies:testnet": "hardhat populate:policy-registry --from v2_testnet --network arbitrumSepolia",
-    "populate:policies:mainnetNeo": "hardhat populate:policy-registry --from v2_mainnet_neo --network arbitrum",
+    "populate:policies:mainnet": "hardhat populate:policy-registry --from v2_mainnet --network arbitrum",
     "release:patch": "scripts/publish.sh patch",
     "release:minor": "scripts/publish.sh minor",
     "release:major": "scripts/publish.sh major",
diff --git a/contracts/scripts/generateDeploymentsMarkdown.sh b/contracts/scripts/generateDeploymentsMarkdown.sh
index 6fa3c2932..43c3bf9b7 100755
--- a/contracts/scripts/generateDeploymentsMarkdown.sh
+++ b/contracts/scripts/generateDeploymentsMarkdown.sh
@@ -28,12 +28,12 @@ function generate() { #deploymentDir #explorerUrl
     done
 }
 
-echo "### V2 Neo (prelaunch)"
+echo "### V2 Mainnet"
 echo "#### Arbitrum One"
 echo
 generate "$SCRIPT_DIR/../deployments/arbitrum" "https://arbiscan.io/address/" | grep -v 'DAI\|WETH\|PNKFaucet'
 echo
-echo "### Official Testnet"
+echo "### V2 Testnet"
 echo "#### Arbitrum Sepolia"
 echo
 generate "$SCRIPT_DIR/../deployments/arbitrumSepolia" "https://sepolia.arbiscan.io/address/"
@@ -47,7 +47,7 @@ echo
 generate "$SCRIPT_DIR/../deployments/chiado" "https://gnosis-chiado.blockscout.com/address/"
 echo
 
-echo "### Devnet"
+echo "### V2 Devnet (unstable)"
 echo "#### Arbitrum Sepolia"
 echo
 generate "$SCRIPT_DIR/../deployments/arbitrumSepoliaDevnet" "https://sepolia.arbiscan.io/address/"
diff --git a/contracts/scripts/storage-layout.ts b/contracts/scripts/storage-layout.ts
index 697b7d48f..70cf166e7 100644
--- a/contracts/scripts/storage-layout.ts
+++ b/contracts/scripts/storage-layout.ts
@@ -4,7 +4,7 @@ import { HardhatRuntimeEnvironment } from "hardhat/types";
 task("storage-layout", "Prints the storage layout of a contract").setAction(
   async ({}, hre: HardhatRuntimeEnvironment) => {
     await hre.run("compile");
-    const buildInfo = await hre.artifacts.getBuildInfo(`src/arbitration/KlerosCoreNeo.sol:KlerosCoreNeo`);
-    console.log(buildInfo.output.contracts["src/arbitration/KlerosCoreNeo.sol"]["KlerosCoreNeo"].storageLayout);
+    const buildInfo = await hre.artifacts.getBuildInfo(`src/arbitration/KlerosCore.sol:KlerosCore`);
+    console.log(buildInfo.output.contracts["src/arbitration/KlerosCore.sol"]["KlerosCore"].storageLayout);
   }
 );

From daa8bf944327075a403298a4bdf3f9a017a81db2 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 4 Sep 2025 23:46:24 +0100
Subject: [PATCH 101/175] chore: removed traces of Neo in more scripts

---
 contracts/deployments/contractsEthers.ts      | 14 +++----
 contracts/deployments/contractsViem.ts        |  2 +-
 contracts/deployments/utils.ts                |  2 +-
 contracts/scripts/changeOwner.ts              |  4 +-
 .../scripts/generateDeploymentArtifact.sh     |  2 +-
 .../scripts/generateDeploymentsMarkdown.sh    |  1 +
 contracts/scripts/keeperBot.ts                |  7 +---
 contracts/scripts/keeperBotShutter.ts         |  5 +--
 contracts/scripts/populateCourts.ts           | 18 ++++-----
 contracts/scripts/populatePolicyRegistry.ts   | 12 +++---
 contracts/scripts/utils/contracts.ts          | 40 +++++--------------
 .../integration/getContractsEthers.test.ts    | 14 +++----
 .../test/integration/getContractsViem.test.ts |  8 ++--
 13 files changed, 50 insertions(+), 79 deletions(-)

diff --git a/contracts/deployments/contractsEthers.ts b/contracts/deployments/contractsEthers.ts
index 49bc0552e..35e204488 100644
--- a/contracts/deployments/contractsEthers.ts
+++ b/contracts/deployments/contractsEthers.ts
@@ -92,10 +92,6 @@ import {
   KlerosCoreUniversity__factory,
   SortitionModuleUniversity,
   SortitionModuleUniversity__factory,
-  KlerosCoreNeo,
-  KlerosCoreNeo__factory,
-  SortitionModuleNeo,
-  SortitionModuleNeo__factory,
 } from "../typechain-types";
 import { type ContractConfig, type DeploymentName, deployments, getAddress } from "./utils";
 
@@ -171,8 +167,8 @@ function getCommonFactories(
 
 export const getContracts = async (provider: ethers.Provider, deployment: DeploymentName) => {
   const { chainId } = deployments[deployment];
-  let klerosCore: KlerosCore | KlerosCoreNeo | KlerosCoreUniversity;
-  let sortition: SortitionModule | SortitionModuleNeo | SortitionModuleUniversity;
+  let klerosCore: KlerosCore | KlerosCoreUniversity;
+  let sortition: SortitionModule | SortitionModuleUniversity;
   let commonFactories: CommonFactories;
 
   switch (deployment) {
@@ -247,9 +243,9 @@ export const getContracts = async (provider: ethers.Provider, deployment: Deploy
         chainId
       );
       break;
-    case "mainnetNeo":
-      klerosCore = KlerosCoreNeo__factory.connect(getAddress(mainnetCoreConfig, chainId), provider);
-      sortition = SortitionModuleNeo__factory.connect(getAddress(mainnetSortitionConfig, chainId), provider);
+    case "mainnet":
+      klerosCore = KlerosCore__factory.connect(getAddress(mainnetCoreConfig, chainId), provider);
+      sortition = SortitionModule__factory.connect(getAddress(mainnetSortitionConfig, chainId), provider);
       commonFactories = getCommonFactories(
         {
           dkClassicConfig: mainnetDkcConfig,
diff --git a/contracts/deployments/contractsViem.ts b/contracts/deployments/contractsViem.ts
index 792ce5b3e..9e3abc4f8 100644
--- a/contracts/deployments/contractsViem.ts
+++ b/contracts/deployments/contractsViem.ts
@@ -203,7 +203,7 @@ export const getConfigs = ({ deployment }: { deployment: DeploymentName }): Cont
         },
       });
 
-    case "mainnetNeo":
+    case "mainnet":
       return getCommonConfigs({
         chainId,
         configs: {
diff --git a/contracts/deployments/utils.ts b/contracts/deployments/utils.ts
index e2711a377..a876fbd5a 100644
--- a/contracts/deployments/utils.ts
+++ b/contracts/deployments/utils.ts
@@ -10,7 +10,7 @@ export const deployments = {
   testnet: {
     chainId: arbitrumSepolia.id,
   },
-  mainnetNeo: {
+  mainnet: {
     chainId: arbitrum.id,
   },
 } as const;
diff --git a/contracts/scripts/changeOwner.ts b/contracts/scripts/changeOwner.ts
index 72eeaeef7..fcb64137b 100644
--- a/contracts/scripts/changeOwner.ts
+++ b/contracts/scripts/changeOwner.ts
@@ -7,7 +7,7 @@ const { bold } = print.colors;
 
 task("change-owner", "Changes the owner for all the contracts")
   .addPositionalParam("newOwner", "The address of the new owner")
-  .addOptionalParam("coreType", "The type of core to use between base, neo, university (default: base)", Cores.BASE)
+  .addOptionalParam("coreType", "The type of core to use between base, university (default: base)", Cores.BASE)
   .setAction(async (taskArgs, hre) => {
     const newOwner = taskArgs.newOwner;
     if (!isAddress(newOwner)) {
@@ -27,7 +27,7 @@ task("change-owner", "Changes the owner for all the contracts")
 
     const coreType = Cores[taskArgs.coreType.toUpperCase() as keyof typeof Cores];
     if (coreType === undefined) {
-      console.error("Invalid core type, must be one of base, neo, university");
+      console.error("Invalid core type, must be one of base, university");
       return;
     }
     console.log("Using core type %s", coreType);
diff --git a/contracts/scripts/generateDeploymentArtifact.sh b/contracts/scripts/generateDeploymentArtifact.sh
index dedcf1c0b..6daf2a585 100755
--- a/contracts/scripts/generateDeploymentArtifact.sh
+++ b/contracts/scripts/generateDeploymentArtifact.sh
@@ -2,7 +2,7 @@
 
 SCRIPT_DIR="$( cd "$( dirname "${BASH_SOURCE[0]}" )" >/dev/null 2>&1 && pwd )"
 
-if [[ $# < 2 ]]
+if [[ $# -lt 2 ]]
 then
   echo "usage: $(basename $0) network address"
   exit 1
diff --git a/contracts/scripts/generateDeploymentsMarkdown.sh b/contracts/scripts/generateDeploymentsMarkdown.sh
index 43c3bf9b7..5ae9dbf7f 100755
--- a/contracts/scripts/generateDeploymentsMarkdown.sh
+++ b/contracts/scripts/generateDeploymentsMarkdown.sh
@@ -15,6 +15,7 @@ IGNORED_ARTIFACTS=(
 function generate() { #deploymentDir #explorerUrl
     deploymentDir=$1
     explorerUrl=$2
+    # shellcheck disable=SC2068
     for f in $(ls -1 $deploymentDir/*.json 2>/dev/null | grep -v ${IGNORED_ARTIFACTS[@]/#/-e } | sort); do
         contractName=$(basename $f .json)
         address=$(cat $f | jq -r .address)
diff --git a/contracts/scripts/keeperBot.ts b/contracts/scripts/keeperBot.ts
index 593d97e4a..5d1b2751f 100644
--- a/contracts/scripts/keeperBot.ts
+++ b/contracts/scripts/keeperBot.ts
@@ -6,7 +6,6 @@ import {
   DisputeKitGatedShutter,
   DisputeKitShutter,
   SortitionModule,
-  SortitionModuleNeo,
 } from "../typechain-types";
 import env from "./utils/env";
 import loggerFactory from "./utils/logger";
@@ -49,7 +48,7 @@ const getContracts = async () => {
     throw new Error("University is not supported yet");
   }
   const contracts = await getContractsForCoreType(hre, coreType);
-  return { ...contracts, sortition: contracts.sortition as SortitionModule | SortitionModuleNeo };
+  return { ...contracts, sortition: contracts.sortition as SortitionModule };
 };
 
 type Contribution = {
@@ -277,9 +276,7 @@ const isRngReady = async () => {
       return true;
     }
   } else if (currentRng === blockHashRNG?.target && blockHashRNG !== null) {
-    const requestBlock = await sortition.randomNumberRequestBlock();
-    const lookahead = await sortition.rngLookahead();
-    const n = await blockHashRNG.receiveRandomness.staticCall(requestBlock + lookahead);
+    const n = await blockHashRNG.receiveRandomness.staticCall();
     if (Number(n) === 0) {
       logger.info("BlockHashRNG is NOT ready yet");
       return false;
diff --git a/contracts/scripts/keeperBotShutter.ts b/contracts/scripts/keeperBotShutter.ts
index 0b9724cae..fff463513 100644
--- a/contracts/scripts/keeperBotShutter.ts
+++ b/contracts/scripts/keeperBotShutter.ts
@@ -1,6 +1,6 @@
 import hre from "hardhat";
 import { getBytes } from "ethers";
-import { DisputeKitGatedShutter, DisputeKitShutter, SortitionModule, SortitionModuleNeo } from "../typechain-types";
+import { DisputeKitGatedShutter, DisputeKitShutter } from "../typechain-types";
 import { decrypt } from "./shutter";
 import env from "./utils/env";
 import loggerFactory from "./utils/logger";
@@ -312,8 +312,7 @@ const getContracts = async () => {
   if (coreType === Cores.UNIVERSITY) {
     throw new Error("University is not supported yet");
   }
-  const contracts = await getContractsForCoreType(hre, coreType);
-  return { ...contracts, sortition: contracts.sortition as SortitionModule | SortitionModuleNeo };
+  return await getContractsForCoreType(hre, coreType);
 };
 
 async function main() {
diff --git a/contracts/scripts/populateCourts.ts b/contracts/scripts/populateCourts.ts
index ee95dee71..cf86c9cbb 100644
--- a/contracts/scripts/populateCourts.ts
+++ b/contracts/scripts/populateCourts.ts
@@ -1,11 +1,11 @@
 import { task, types } from "hardhat/config";
-import { KlerosCore, KlerosCoreNeo, KlerosCoreUniversity } from "../typechain-types";
+import { KlerosCore, KlerosCoreUniversity } from "../typechain-types";
 import { BigNumberish, toBigInt, toNumber } from "ethers";
 import courtsV1Mainnet from "../config/courts.v1.mainnet.json";
 import courtsV1GnosisChain from "../config/courts.v1.gnosischain.json";
 import courtsV2ArbitrumTestnet from "../config/courts.v2.testnet.json";
 import courtsV2ArbitrumDevnet from "../config/courts.v2.devnet.json";
-import courtsV2MainnetNeo from "../config/courts.v2.mainnet-neo.json";
+import courtsV2Mainnet from "../config/courts.v2.mainnet.json";
 import { isDevnet } from "../deploy/utils";
 import { execute, writeTransactionBatch } from "./utils/execution";
 import { getContracts, Cores } from "./utils/contracts";
@@ -21,7 +21,7 @@ enum Sources {
   V1_GNOSIS,
   V2_DEVNET,
   V2_TESTNET,
-  V2_MAINNET_NEO,
+  V2_MAINNET,
 }
 
 type Court = {
@@ -43,7 +43,7 @@ const TEN_THOUSAND_GWEI = 10n ** 13n;
 task("populate:courts", "Populates the courts and their parameters")
   .addOptionalParam(
     "from",
-    "The source of the policies between v1_mainnet, v1_gnosis, v2_devnet, v2_testnet, v2_mainnet_neo (default: auto depending on the network)",
+    "The source of the policies between v1_mainnet, v1_gnosis, v2_devnet, v2_testnet, v2_mainnet (default: auto depending on the network)",
     undefined
   )
   .addOptionalParam("start", "The starting index for the courts to populate (default: 0)", 0, types.int)
@@ -53,7 +53,7 @@ task("populate:courts", "Populates the courts and their parameters")
     undefined,
     types.int
   )
-  .addOptionalParam("coreType", "The type of core to use between base, neo, university (default: base)", Cores.BASE)
+  .addOptionalParam("coreType", "The type of core to use between base, university (default: base)", Cores.BASE)
   .addFlag("reverse", "Iterates the courts in reverse order, useful to increase minStake in the child courts first")
   .addFlag("forceV1ParametersToDev", "Use development values for the v1 courts parameters")
   .setAction(async (taskArgs, hre) => {
@@ -74,7 +74,7 @@ task("populate:courts", "Populates the courts and their parameters")
     if (taskArgs.from) {
       from = Sources[taskArgs.from.toUpperCase() as keyof typeof Sources];
       if (from === undefined) {
-        console.error("Invalid source, must be one of v1_mainnet, v1_gnosis, v2_devnet, v2_testnet, v2_mainnet_neo");
+        console.error("Invalid source, must be one of v1_mainnet, v1_gnosis, v2_devnet, v2_testnet, v2_mainnet");
         return;
       }
     } else {
@@ -84,7 +84,7 @@ task("populate:courts", "Populates the courts and their parameters")
 
     const coreType = Cores[taskArgs.coreType.toUpperCase() as keyof typeof Cores];
     if (coreType === undefined) {
-      console.error("Invalid core type, must be one of base, neo, university");
+      console.error("Invalid core type, must be one of base, university");
       return;
     }
     console.log("Using core type %s", coreType);
@@ -133,8 +133,8 @@ task("populate:courts", "Populates the courts and their parameters")
         courtsV2 = courtsV2ArbitrumTestnet;
         break;
       }
-      case Sources.V2_MAINNET_NEO: {
-        courtsV2 = courtsV2MainnetNeo;
+      case Sources.V2_MAINNET: {
+        courtsV2 = courtsV2Mainnet;
         break;
       }
       default:
diff --git a/contracts/scripts/populatePolicyRegistry.ts b/contracts/scripts/populatePolicyRegistry.ts
index 6ffdacd8e..43087268a 100644
--- a/contracts/scripts/populatePolicyRegistry.ts
+++ b/contracts/scripts/populatePolicyRegistry.ts
@@ -4,7 +4,7 @@ import policiesV1Mainnet from "../config/policies.v1.mainnet.json";
 import policiesV1GnosisChain from "../config/policies.v1.gnosischain.json";
 import policiesV2ArbitrumTestnet from "../config/policies.v2.testnet.json";
 import policiesV2ArbitrumDevnet from "../config/policies.v2.devnet.json";
-import policiesV2MainnetNeo from "../config/policies.v2.mainnet-neo.json";
+import policiesV2Mainnet from "../config/policies.v2.mainnet.json";
 import { isDevnet } from "../deploy/utils";
 import { execute, writeTransactionBatch } from "./utils/execution";
 
@@ -19,13 +19,13 @@ enum Sources {
   V1_GNOSIS,
   V2_DEVNET,
   V2_TESTNET,
-  V2_MAINNET_NEO,
+  V2_MAINNET,
 }
 
 task("populate:policy-registry", "Populates the policy registry for each court")
   .addOptionalParam(
     "from",
-    "The source of the policies between v1_mainnet, v1_gnosis, v2_devnet, v2_testnet, v2_mainnet_neo (default: auto depending on the network)",
+    "The source of the policies between v1_mainnet, v1_gnosis, v2_devnet, v2_testnet, v2_mainnet (default: auto depending on the network)",
     undefined
   )
   .addOptionalParam("start", "The starting index for the courts to populate (default: 0)", 0, types.int)
@@ -53,7 +53,7 @@ task("populate:policy-registry", "Populates the policy registry for each court")
     if (taskArgs.from) {
       from = Sources[taskArgs.from.toUpperCase() as keyof typeof Sources];
       if (from === undefined) {
-        console.error("Invalid source, must be one of v1_mainnet, v1_gnosis, v2_devnet, v2_testnet, v2_mainnet_neo");
+        console.error("Invalid source, must be one of v1_mainnet, v1_gnosis, v2_devnet, v2_testnet, v2_mainnet");
         return;
       }
     } else {
@@ -88,8 +88,8 @@ task("populate:policy-registry", "Populates the policy registry for each court")
         policiesV2 = policiesV2ArbitrumTestnet;
         break;
       }
-      case Sources.V2_MAINNET_NEO: {
-        policiesV2 = policiesV2MainnetNeo;
+      case Sources.V2_MAINNET: {
+        policiesV2 = policiesV2Mainnet;
         break;
       }
       default:
diff --git a/contracts/scripts/utils/contracts.ts b/contracts/scripts/utils/contracts.ts
index cc7bf2429..50bcac2f6 100644
--- a/contracts/scripts/utils/contracts.ts
+++ b/contracts/scripts/utils/contracts.ts
@@ -7,13 +7,11 @@ import {
   DisputeResolver,
   DisputeTemplateRegistry,
   KlerosCore,
-  KlerosCoreNeo,
   KlerosCoreUniversity,
   PNK,
   PolicyRegistry,
   RandomizerRNG,
   SortitionModule,
-  SortitionModuleNeo,
   SortitionModuleUniversity,
   TransactionBatcher,
   KlerosCoreSnapshotProxy,
@@ -24,28 +22,18 @@ import {
 
 export const Cores = {
   BASE: "BASE",
-  NEO: "NEO",
   UNIVERSITY: "UNIVERSITY",
 } as const;
 
 export type Core = (typeof Cores)[keyof typeof Cores];
 
 /**
- * Get contract names by specifying the coreType (BASE, NEO, UNIVERSITY).
+ * Get contract names by specifying the coreType (BASE, UNIVERSITY).
  * @param coreType - Core type
  * @returns Contract names
  */
 export const getContractNames = (coreType: Core) => {
   const coreSpecificNames = {
-    [Cores.NEO]: {
-      core: "KlerosCoreNeo",
-      sortition: "SortitionModuleNeo",
-      disputeKitClassic: "DisputeKitClassicNeo",
-      disputeKitShutter: "DisputeKitShutterNeo",
-      disputeKitGated: "DisputeKitGatedNeo",
-      disputeKitGatedShutter: "DisputeKitGatedShutterNeo",
-      disputeResolver: "DisputeResolverNeo",
-    },
     [Cores.BASE]: {
       core: "KlerosCore",
       sortition: "SortitionModule",
@@ -66,7 +54,7 @@ export const getContractNames = (coreType: Core) => {
     },
   };
 
-  if (!(coreType in coreSpecificNames)) throw new Error("Invalid core type, must be one of BASE, NEO, or UNIVERSITY");
+  if (!(coreType in coreSpecificNames)) throw new Error("Invalid core type, must be one of BASE, or UNIVERSITY");
 
   return {
     ...coreSpecificNames[coreType],
@@ -83,20 +71,16 @@ export const getContractNames = (coreType: Core) => {
 };
 
 /**
- * Get contracts by specifying the coreType (BASE, NEO, UNIVERSITY).
+ * Get contracts by specifying the coreType (BASE, UNIVERSITY).
  * @param hre - Hardhat runtime environment
  * @param coreType - Core type
  * @returns Contracts
  */
 export const getContracts = async (hre: HardhatRuntimeEnvironment, coreType: Core) => {
   const { ethers } = hre;
-  let core: KlerosCore | KlerosCoreNeo | KlerosCoreUniversity;
-  let sortition: SortitionModule | SortitionModuleNeo | SortitionModuleUniversity;
+  let core: KlerosCore | KlerosCoreUniversity;
+  let sortition: SortitionModule | SortitionModuleUniversity;
   switch (coreType) {
-    case Cores.NEO:
-      core = await ethers.getContract<KlerosCoreNeo>(getContractNames(coreType).core);
-      sortition = await ethers.getContract<SortitionModuleNeo>(getContractNames(coreType).sortition);
-      break;
     case Cores.BASE:
       core = await ethers.getContract<KlerosCore>(getContractNames(coreType).core);
       sortition = await ethers.getContract<SortitionModule>(getContractNames(coreType).sortition);
@@ -106,7 +90,7 @@ export const getContracts = async (hre: HardhatRuntimeEnvironment, coreType: Cor
       sortition = await ethers.getContract<SortitionModuleUniversity>(getContractNames(coreType).sortition);
       break;
     default:
-      throw new Error("Invalid core type, must be one of BASE, NEO, or UNIVERSITY");
+      throw new Error("Invalid core type, must be one of BASE, or UNIVERSITY");
   }
   const disputeKitClassic = await ethers.getContract<DisputeKitClassic>(getContractNames(coreType).disputeKitClassic);
   const disputeKitShutter = await ethers.getContractOrNull<DisputeKitShutter>(
@@ -151,32 +135,28 @@ export const getContracts = async (hre: HardhatRuntimeEnvironment, coreType: Cor
 };
 
 /**
- * Get contracts by inferring the coreType (BASE, NEO, UNIVERSITY) from the network, most convenient for most cases.
+ * Get contracts by inferring the coreType (BASE, UNIVERSITY) from the network, most convenient for most cases.
  * @param hre - Hardhat runtime environment
  * @returns Contracts
  */
 export const getContractsFromNetwork = async (hre: HardhatRuntimeEnvironment) => {
   const { network } = hre;
-  if (network.name === "arbitrumSepoliaDevnet" || network.name === "arbitrumSepolia") {
+  if (["arbitrumSepoliaDevnet", "arbitrumSepolia", "arbitrum"].includes(network.name)) {
     return getContracts(hre, Cores.BASE);
-  } else if (network.name === "arbitrum") {
-    return getContracts(hre, Cores.NEO);
   } else {
     throw new Error("Invalid network");
   }
 };
 
 /**
- * Get contract names by inferring the coreType (BASE, NEO, UNIVERSITY) from the network, most convenient for most cases.
+ * Get contract names by inferring the coreType (BASE, UNIVERSITY) from the network, most convenient for most cases.
  * @param hre - Hardhat runtime environment
  * @returns Contract names
  */
 export const getContractNamesFromNetwork = async (hre: HardhatRuntimeEnvironment) => {
   const { network } = hre;
-  if (network.name === "arbitrumSepoliaDevnet" || network.name === "arbitrumSepolia") {
+  if (["arbitrumSepoliaDevnet", "arbitrumSepolia", "arbitrum"].includes(network.name)) {
     return getContractNames(Cores.BASE);
-  } else if (network.name === "arbitrum") {
-    return getContractNames(Cores.NEO);
   } else {
     throw new Error("Invalid network");
   }
diff --git a/contracts/test/integration/getContractsEthers.test.ts b/contracts/test/integration/getContractsEthers.test.ts
index 736717626..59a04dfab 100644
--- a/contracts/test/integration/getContractsEthers.test.ts
+++ b/contracts/test/integration/getContractsEthers.test.ts
@@ -4,10 +4,8 @@ import { arbitrum, arbitrumSepolia } from "viem/chains";
 import { getContracts } from "../../deployments/contractsEthers";
 import {
   KlerosCore__factory,
-  KlerosCoreNeo__factory,
   KlerosCoreUniversity__factory,
   SortitionModule__factory,
-  SortitionModuleNeo__factory,
   SortitionModuleUniversity__factory,
   DisputeKitClassic__factory,
   DisputeResolver__factory,
@@ -99,7 +97,7 @@ const universityContractMapping: ContractMapping = {
   klerosCoreSnapshotProxy: { name: "KlerosCoreSnapshotProxy" },
 };
 
-const neoContractMapping: ContractMapping = {
+const mainnetContractMapping: ContractMapping = {
   klerosCore: { name: "KlerosCoreNeo" },
   sortition: { name: "SortitionModuleNeo" },
   disputeKitClassic: { name: "DisputeKitClassicNeo" },
@@ -291,16 +289,16 @@ describe("getContractsEthers", async () => {
     await verifyDeployedAddresses(contracts, NETWORKS.TESTNET, testnetContractMapping);
   });
 
-  it("should return correct contract instances for mainnetNeo", async () => {
-    const contracts = await getContracts(arbitrumProvider, "mainnetNeo");
+  it("should return correct contract instances for mainnet", async () => {
+    const contracts = await getContracts(arbitrumProvider, "mainnet");
 
     // Verify chain ID
     const network = await arbitrumProvider.getNetwork();
     expect(network.chainId).to.equal(arbitrum.id);
 
     // Verify contract instances
-    expect(contracts.klerosCore).to.be.instanceOf(getConstructor(KlerosCoreNeo__factory, arbitrumProvider));
-    expect(contracts.sortition).to.be.instanceOf(getConstructor(SortitionModuleNeo__factory, arbitrumProvider));
+    expect(contracts.klerosCore).to.be.instanceOf(getConstructor(KlerosCore__factory, arbitrumProvider));
+    expect(contracts.sortition).to.be.instanceOf(getConstructor(SortitionModule__factory, arbitrumProvider));
     verifyCommonContractInstances(contracts, arbitrumProvider);
     expect(contracts.disputeKitShutter).to.not.be.null;
     expect(contracts.disputeKitGated).to.not.be.null;
@@ -310,7 +308,7 @@ describe("getContractsEthers", async () => {
 
     // Verify all contract addresses
     await verifyAllContractAddresses(contracts);
-    await verifyDeployedAddresses(contracts, NETWORKS.MAINNET, neoContractMapping);
+    await verifyDeployedAddresses(contracts, NETWORKS.MAINNET, mainnetContractMapping);
   });
 
   it("should throw error for unsupported deployment", async () => {
diff --git a/contracts/test/integration/getContractsViem.test.ts b/contracts/test/integration/getContractsViem.test.ts
index a32db3c86..4231164ad 100644
--- a/contracts/test/integration/getContractsViem.test.ts
+++ b/contracts/test/integration/getContractsViem.test.ts
@@ -77,7 +77,7 @@ const universityContractMapping: ContractMapping = {
   klerosCoreSnapshotProxy: { name: "KlerosCoreSnapshotProxy" },
 };
 
-const neoContractMapping: ContractMapping = {
+const mainnetContractMapping: ContractMapping = {
   klerosCore: { name: "KlerosCoreNeo" },
   sortition: { name: "SortitionModuleNeo" },
   disputeKitClassic: { name: "DisputeKitClassicNeo" },
@@ -240,10 +240,10 @@ describe("getContractsViem", () => {
     await verifyDeployedAddresses(contracts, NETWORKS.TESTNET, testnetContractMapping);
   });
 
-  it("should return correct contract instances for mainnetNeo", async () => {
+  it("should return correct contract instances for mainnet", async () => {
     const contracts = getContracts({
       publicClient: arbitrumClient,
-      deployment: "mainnetNeo",
+      deployment: "mainnet",
     });
 
     // Verify chain ID
@@ -262,7 +262,7 @@ describe("getContractsViem", () => {
     expect(contracts.randomizerRng).to.not.be.undefined;
 
     // Verify deployed addresses
-    await verifyDeployedAddresses(contracts, NETWORKS.MAINNET, neoContractMapping);
+    await verifyDeployedAddresses(contracts, NETWORKS.MAINNET, mainnetContractMapping);
   });
 
   it("should throw error for unsupported deployment", () => {

From 4e384c90ad03532ac51ebfd7a8ef5c561ebc00fb Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 4 Sep 2025 23:59:43 +0100
Subject: [PATCH 102/175] chore: updated audit METRICS files

---
 contracts/audit/METRICS.html | 832 +++++++++++++++++------------------
 contracts/audit/METRICS.md   | 779 ++++++++++++++++----------------
 2 files changed, 789 insertions(+), 822 deletions(-)

diff --git a/contracts/audit/METRICS.html b/contracts/audit/METRICS.html
index df48b7b11..31a6b6e73 100644
--- a/contracts/audit/METRICS.html
+++ b/contracts/audit/METRICS.html
@@ -208793,25 +208793,24 @@
     <script>
       let staticMetrics = {
         markdownTemplate:
-          '\n[<img width="200" alt="get in touch with Consensys Diligence" src="https://user-images.githubusercontent.com/2865694/56826101-91dcf380-685b-11e9-937c-af49c2510aa0.png">](https://consensys.io/diligence)<br/>\n<sup>\n[[  🌐  ](https://consensys.io/diligence)  [  📩  ](mailto:diligence@consensys.net)  [  🔥  ](https://consensys.io/diligence/tools/)]\n</sup><br/><br/>\n\n\n\n# Solidity Metrics for \'CLI\'\n\n## Table of contents\n\n- [Scope](#t-scope)\n    - [Source Units in Scope](#t-source-Units-in-Scope)\n        - [Deployable Logic Contracts](#t-deployable-contracts)\n    - [Out of Scope](#t-out-of-scope)\n        - [Excluded Source Units](#t-out-of-scope-excluded-source-units)\n        - [Duplicate Source Units](#t-out-of-scope-duplicate-source-units)\n        - [Doppelganger Contracts](#t-out-of-scope-doppelganger-contracts)\n- [Report Overview](#t-report)\n    - [Risk Summary](#t-risk)\n    - [Source Lines](#t-source-lines)\n    - [Inline Documentation](#t-inline-documentation)\n    - [Components](#t-components)\n    - [Exposed Functions](#t-exposed-functions)\n    - [StateVariables](#t-statevariables)\n    - [Capabilities](#t-capabilities)\n    - [Dependencies](#t-package-imports)\n    - [Totals](#t-totals)\n\n## <span id=t-scope>Scope</span>\n\nThis section lists files that are in scope for the metrics report. \n\n- **Project:** `\'CLI\'`\n- **Included Files:** \n    - ``\n- **Excluded Paths:** \n    - ``\n- **File Limit:** `undefined`\n    - **Exclude File list Limit:** `undefined`\n\n- **Workspace Repository:** `unknown` (`undefined`@`undefined`)\n\n### <span id=t-source-Units-in-Scope>Source Units in Scope</span>\n\nSource Units Analyzed: **`31`**<br>\nSource Units in Scope: **`31`** (**100%**)\n\n| Type | File   | Logic Contracts | Interfaces | Lines | nLines | nSLOC | Comment Lines | Complex. Score | Capabilities |\n| ---- | ------ | --------------- | ---------- | ----- | ------ | ----- | ------------- | -------------- | ------------ | \n| 📝 | src/arbitration/KlerosCore.sol | 1 | **** | 75 | 63 | 28 | 26 | 13 | **** |\n| 🎨 | src/arbitration/KlerosCoreBase.sol | 1 | **** | 1211 | 1162 | 809 | 286 | 449 | **<abbr title=\'Uses Assembly\'>🖥</abbr><abbr title=\'Payable Functions\'>💰</abbr>** |\n| 📝 | src/arbitration/KlerosCoreNeo.sol | 1 | **** | 142 | 124 | 55 | 51 | 36 | **** |\n| 📝 | src/arbitration/PolicyRegistry.sol | 1 | **** | 88 | 88 | 30 | 41 | 24 | **** |\n| 📝 | src/arbitration/SortitionModule.sol | 1 | **** | 50 | 44 | 15 | 20 | 13 | **** |\n| 🎨 | src/arbitration/SortitionModuleBase.sol | 1 | **** | 689 | 645 | 393 | 205 | 300 | **<abbr title=\'Uses Assembly\'>🖥</abbr><abbr title=\'Uses Hash-Functions\'>🧮</abbr>** |\n| 📝 | src/arbitration/SortitionModuleNeo.sol | 1 | **** | 103 | 91 | 48 | 28 | 31 | **** |\n| 📝 | src/arbitration/arbitrables/DisputeResolver.sol | 1 | **** | 149 | 134 | 72 | 50 | 43 | **<abbr title=\'Payable Functions\'>💰</abbr>** |\n| 📝 | src/arbitration/DisputeTemplateRegistry.sol | 1 | **** | 83 | 79 | 30 | 33 | 25 | **** |\n| 📝 | src/arbitration/dispute-kits/DisputeKitClassic.sol | 1 | **** | 46 | 46 | 16 | 21 | 13 | **** |\n| 🎨 | src/arbitration/dispute-kits/DisputeKitClassicBase.sol | 1 | **** | 713 | 632 | 365 | 225 | 192 | **<abbr title=\'Payable Functions\'>💰</abbr><abbr title=\'Uses Hash-Functions\'>🧮</abbr>** |\n| 📝🔍 | src/arbitration/dispute-kits/DisputeKitGated.sol | 1 | 2 | 117 | 99 | 39 | 51 | 57 | **<abbr title=\'Uses Assembly\'>🖥</abbr><abbr title=\'doppelganger(IBalanceHolderERC1155)\'>🔆</abbr>** |\n| 📝🔍 | src/arbitration/dispute-kits/DisputeKitGatedShutter.sol | 1 | 2 | 194 | 159 | 59 | 84 | 69 | **<abbr title=\'Uses Assembly\'>🖥</abbr><abbr title=\'Uses Hash-Functions\'>🧮</abbr><abbr title=\'doppelganger(IBalanceHolderERC1155)\'>🔆</abbr>** |\n| 📝 | src/arbitration/dispute-kits/DisputeKitShutter.sol | 1 | **** | 123 | 107 | 36 | 54 | 27 | **<abbr title=\'Uses Hash-Functions\'>🧮</abbr>** |\n| 📝🔍 | src/arbitration/dispute-kits/DisputeKitSybilResistant.sol | 1 | 1 | 76 | 58 | 20 | 33 | 16 | **<abbr title=\'doppelganger(IProofOfHumanity)\'>🔆</abbr>** |\n| 📝 | src/arbitration/evidence/EvidenceModule.sol | 1 | **** | 70 | 70 | 26 | 30 | 21 | **** |\n| 🔍 | src/arbitration/interfaces/IArbitrableV2.sol | **** | 1 | 40 | 39 | 12 | 22 | 3 | **** |\n| 🔍 | src/arbitration/interfaces/IArbitratorV2.sol | **** | 1 | 83 | 44 | 9 | 50 | 14 | **<abbr title=\'Payable Functions\'>💰</abbr>** |\n| 🔍 | src/arbitration/interfaces/IDisputeKit.sol | **** | 1 | 128 | 39 | 11 | 60 | 23 | **** |\n| 🔍 | src/arbitration/interfaces/IDisputeTemplateRegistry.sol | **** | 1 | 25 | 20 | 9 | 8 | 3 | **** |\n| 🔍 | src/arbitration/interfaces/IEvidence.sol | **** | 1 | 12 | 12 | 4 | 6 | 1 | **** |\n| 🔍 | src/arbitration/interfaces/ISortitionModule.sol | **** | 1 | 63 | 16 | 10 | 4 | 33 | **** |\n|  | src/libraries/Constants.sol | **** | **** | 39 | 39 | 26 | 13 | 2 | **** |\n| 📚 | src/libraries/SafeERC20.sol | 1 | **** | 47 | 47 | 18 | 24 | 12 | **** |\n| 📚🔍 | src/libraries/SafeSend.sol | 1 | 1 | 24 | 19 | 9 | 7 | 15 | **<abbr title=\'Payable Functions\'>💰</abbr><abbr title=\'Initiates ETH Value Transfer\'>📤</abbr>** |\n| 📝 | src/rng/RNGWithFallback.sol | 1 | **** | 103 | 103 | 48 | 41 | 35 | **** |\n| 📝 | src/rng/ChainlinkRNG.sol | 1 | **** | 173 | 173 | 85 | 70 | 50 | **** |\n| 🔍 | src/rng/IRNG.sol | **** | 1 | 13 | 8 | 3 | 5 | 5 | **** |\n| 🎨 | src/proxy/UUPSProxiable.sol | 1 | **** | 140 | 122 | 44 | 71 | 46 | **<abbr title=\'Uses Assembly\'>🖥</abbr><abbr title=\'Payable Functions\'>💰</abbr><abbr title=\'DelegateCall\'>👥</abbr><abbr title=\'TryCatch Blocks\'>♻️</abbr>** |\n| 📝 | src/proxy/UUPSProxy.sol | 1 | **** | 90 | 90 | 38 | 37 | 65 | **<abbr title=\'Uses Assembly\'>🖥</abbr><abbr title=\'Payable Functions\'>💰</abbr><abbr title=\'DelegateCall\'>👥</abbr>** |\n| 🎨 | src/proxy/Initializable.sol | 1 | **** | 215 | 215 | 70 | 128 | 31 | **<abbr title=\'Uses Assembly\'>🖥</abbr>** |\n| 📝📚🔍🎨 | **Totals** | **23** | **13** | **5124**  | **4587** | **2437** | **1784** | **1667** | **<abbr title=\'Uses Assembly\'>🖥</abbr><abbr title=\'Payable Functions\'>💰</abbr><abbr title=\'Initiates ETH Value Transfer\'>📤</abbr><abbr title=\'DelegateCall\'>👥</abbr><abbr title=\'Uses Hash-Functions\'>🧮</abbr><abbr title=\'doppelganger\'>🔆</abbr><abbr title=\'TryCatch Blocks\'>♻️</abbr>** |\n\n<sub>\nLegend: <a onclick="toggleVisibility(\'table-legend\', this)">[➕]</a>\n<div id="table-legend" style="display:none">\n\n<ul>\n<li> <b>Lines</b>: total lines of the source unit </li>\n<li> <b>nLines</b>: normalized lines of the source unit (e.g. normalizes functions spanning multiple lines) </li>\n<li> <b>nSLOC</b>: normalized source lines of code (only source-code lines; no comments, no blank lines) </li>\n<li> <b>Comment Lines</b>: lines containing single or block comments </li>\n<li> <b>Complexity Score</b>: a custom complexity score derived from code statements that are known to introduce code complexity (branches, loops, calls, external interfaces, ...) </li>\n</ul>\n\n</div>\n</sub>\n\n\n##### <span id=t-deployable-contracts>Deployable Logic Contracts</span>\nTotal: 16\n* 📝 `KlerosCore`\n* 📝 `KlerosCoreNeo`\n* 📝 `PolicyRegistry`\n* 📝 `SortitionModule`\n* 📝 `SortitionModuleNeo`\n* <a onclick="toggleVisibility(\'deployables\', this)">[➕]</a>\n<div id="deployables" style="display:none">\n<ul>\n<li> 📝 <code>DisputeResolver</code></li>\n<li> 📝 <code>DisputeTemplateRegistry</code></li>\n<li> 📝 <code>DisputeKitClassic</code></li>\n<li> 📝 <code>DisputeKitGated</code></li>\n<li> 📝 <code>DisputeKitGatedShutter</code></li>\n<li> 📝 <code>DisputeKitShutter</code></li>\n<li> 📝 <code>DisputeKitSybilResistant</code></li>\n<li> 📝 <code>EvidenceModule</code></li>\n<li> 📝 <code>RNGWithFallback</code></li>\n<li> 📝 <code>ChainlinkRNG</code></li>\n<li> 📝 <code>UUPSProxy</code></li>\n</ul>\n</div>\n            \n\n\n\n#### <span id=t-out-of-scope>Out of Scope</span>\n\n##### <span id=t-out-of-scope-excluded-source-units>Excluded Source Units</span>\n\nSource Units Excluded: **`0`**\n\n<a onclick="toggleVisibility(\'excluded-files\', this)">[➕]</a>\n<div id="excluded-files" style="display:none">\n| File   |\n| ------ |\n| None |\n\n</div>\n\n\n##### <span id=t-out-of-scope-duplicate-source-units>Duplicate Source Units</span>\n\nDuplicate Source Units Excluded: **`0`** \n\n<a onclick="toggleVisibility(\'duplicate-files\', this)">[➕]</a>\n<div id="duplicate-files" style="display:none">\n| File   |\n| ------ |\n| None |\n\n</div>\n\n##### <span id=t-out-of-scope-doppelganger-contracts>Doppelganger Contracts</span>\n\nDoppelganger Contracts: **`3`** \n\n<a onclick="toggleVisibility(\'doppelganger-contracts\', this)">[➕]</a>\n<div id="doppelganger-contracts" style="display:none">\n| File   | Contract | Doppelganger | \n| ------ | -------- | ------------ |\n| src/arbitration/dispute-kits/DisputeKitGated.sol | IBalanceHolderERC1155 | (fuzzy) [0](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.5.0/contracts/introspection/IERC1820Implementer.sol), [1](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.2.0/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [2](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.2.2-solc-0.7/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [3](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.3.0/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [4](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.3.0-solc-0.7/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [5](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.4.0/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [6](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.4.0-solc-0.7/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [7](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [8](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0-beta.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [9](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0-rc.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [10](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.1.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [11](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.1.0-rc.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [12](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.2.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [13](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0/contracts/introspection/IERC1820Implementer.sol), [14](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.0/contracts/drafts/IERC1820Implementer.sol), [15](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.1/contracts/drafts/IERC1820Implementer.sol), [16](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.2/contracts/introspection/IERC1820Implementer.sol), [17](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.3/contracts/introspection/IERC1820Implementer.sol), [18](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0/contracts/introspection/IERC1820Implementer.sol), [19](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.0/contracts/introspection/IERC1820Implementer.sol), [20](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.1/contracts/introspection/IERC1820Implementer.sol), [21](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.2/contracts/introspection/IERC1820Implementer.sol), [22](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.0/contracts/introspection/IERC1820Implementer.sol), [23](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [24](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.1/contracts/introspection/IERC1820Implementer.sol), [25](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0/contracts/introspection/IERC1820Implementer.sol), [26](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-beta.0/contracts/introspection/IERC1820Implementer.sol), [27](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [28](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-rc.1/contracts/introspection/IERC1820Implementer.sol), [29](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.1/contracts/introspection/IERC1820Implementer.sol), [30](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.2/contracts/introspection/IERC1820Implementer.sol), [31](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.1.0/contracts/introspection/IERC1820Implementer.sol), [32](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.1.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [33](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.0/contracts/introspection/IERC1820Implementer.sol), [34](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [35](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.1-solc-0.7/contracts/introspection/IERC1820Implementer.sol), [36](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.2-solc-0.7/contracts/introspection/IERC1820Implementer.sol) |\n| src/arbitration/dispute-kits/DisputeKitGatedShutter.sol | IBalanceHolderERC1155 | (fuzzy) [0](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.5.0/contracts/introspection/IERC1820Implementer.sol), [1](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.2.0/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [2](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.2.2-solc-0.7/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [3](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.3.0/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [4](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.3.0-solc-0.7/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [5](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.4.0/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [6](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.4.0-solc-0.7/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [7](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [8](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0-beta.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [9](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0-rc.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [10](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.1.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [11](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.1.0-rc.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [12](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.2.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [13](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0/contracts/introspection/IERC1820Implementer.sol), [14](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.0/contracts/drafts/IERC1820Implementer.sol), [15](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.1/contracts/drafts/IERC1820Implementer.sol), [16](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.2/contracts/introspection/IERC1820Implementer.sol), [17](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.3/contracts/introspection/IERC1820Implementer.sol), [18](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0/contracts/introspection/IERC1820Implementer.sol), [19](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.0/contracts/introspection/IERC1820Implementer.sol), [20](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.1/contracts/introspection/IERC1820Implementer.sol), [21](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.2/contracts/introspection/IERC1820Implementer.sol), [22](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.0/contracts/introspection/IERC1820Implementer.sol), [23](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [24](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.1/contracts/introspection/IERC1820Implementer.sol), [25](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0/contracts/introspection/IERC1820Implementer.sol), [26](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-beta.0/contracts/introspection/IERC1820Implementer.sol), [27](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [28](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-rc.1/contracts/introspection/IERC1820Implementer.sol), [29](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.1/contracts/introspection/IERC1820Implementer.sol), [30](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.2/contracts/introspection/IERC1820Implementer.sol), [31](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.1.0/contracts/introspection/IERC1820Implementer.sol), [32](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.1.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [33](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.0/contracts/introspection/IERC1820Implementer.sol), [34](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [35](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.1-solc-0.7/contracts/introspection/IERC1820Implementer.sol), [36](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.2-solc-0.7/contracts/introspection/IERC1820Implementer.sol) |\n| src/arbitration/dispute-kits/DisputeKitSybilResistant.sol | IProofOfHumanity | (fuzzy) [0](https://github.com/smartcontractkit/chainlink/blob/explorer-v0.8.5/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [1](https://github.com/smartcontractkit/chainlink/blob/upgrade/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [2](https://github.com/smartcontractkit/chainlink/blob/v.0.8.12/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [3](https://github.com/smartcontractkit/chainlink/blob/v0.8.12/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [4](https://github.com/smartcontractkit/chainlink/blob/v0.8.13/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [5](https://github.com/smartcontractkit/chainlink/blob/v0.8.14/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [6](https://github.com/smartcontractkit/chainlink/blob/v0.8.15/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [7](https://github.com/smartcontractkit/chainlink/blob/v0.8.16/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [8](https://github.com/smartcontractkit/chainlink/blob/v0.8.17/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [9](https://github.com/smartcontractkit/chainlink/blob/v0.8.18/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [10](https://github.com/smartcontractkit/chainlink/blob/v0.9.0/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [11](https://github.com/smartcontractkit/chainlink/blob/v0.9.2/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [12](https://github.com/smartcontractkit/chainlink/blob/v0.9.3/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [13](https://github.com/smartcontractkit/chainlink/blob/v0.9.4/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [14](https://github.com/smartcontractkit/chainlink/blob/v0.9.5/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [15](https://github.com/smartcontractkit/chainlink/blob/v0.9.6/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [16](https://github.com/smartcontractkit/chainlink/blob/v0.9.7/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [17](https://github.com/smartcontractkit/chainlink/blob/v0.9.8/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [18](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.0.0/contracts/introspection/IERC165.sol), [19](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.0.1/contracts/introspection/IERC165.sol), [20](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.0.2/contracts/introspection/IERC165.sol), [21](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.1.2/contracts/introspection/IERC165.sol), [22](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.1.3/contracts/introspection/IERC165.sol), [23](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.2.1/contracts/introspection/IERC165.sol), [24](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.2.2/contracts/introspection/IERC165.sol), [25](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.2.3/contracts/introspection/IERC165.sol), [26](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.5.0/contracts/introspection/IERC165.sol), [27](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.2.0/contracts/introspection/IERC165Upgradeable.sol), [28](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.2.2-solc-0.7/contracts/introspection/IERC165Upgradeable.sol), [29](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.3.0/contracts/introspection/IERC165Upgradeable.sol), [30](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.3.0-solc-0.7/contracts/introspection/IERC165Upgradeable.sol), [31](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.4.0/contracts/introspection/IERC165Upgradeable.sol), [32](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.4.0-solc-0.7/contracts/introspection/IERC165Upgradeable.sol), [33](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0/contracts/utils/introspection/IERC165Upgradeable.sol), [34](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0-beta.0/contracts/utils/introspection/IERC165Upgradeable.sol), [35](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0-rc.0/contracts/utils/introspection/IERC165Upgradeable.sol), [36](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.1.0/contracts/utils/introspection/IERC165Upgradeable.sol), [37](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.1.0-rc.0/contracts/utils/introspection/IERC165Upgradeable.sol), [38](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.2.0/contracts/utils/introspection/IERC165Upgradeable.sol), [39](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.0.0/contracts/introspection/IERC165.sol), [40](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.0.0-rc.1/contracts/introspection/IERC165.sol), [41](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.0.0-rc.2/contracts/introspection/IERC165.sol), [42](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.0.0-rc.3/contracts/introspection/IERC165.sol), [43](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.0.0-rc.4/contracts/introspection/IERC165.sol), [44](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.0.1/contracts/introspection/IERC165.sol), [45](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.1.0-rc.1/contracts/introspection/IERC165.sol), [46](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.1.0-rc.2/contracts/introspection/IERC165.sol), [47](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.1.1/contracts/introspection/IERC165.sol), [48](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.1.2/contracts/introspection/IERC165.sol), [49](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.1.3/contracts/introspection/IERC165.sol), [50](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.2.0/contracts/introspection/IERC165.sol), [51](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.2.0-rc.1/contracts/introspection/IERC165.sol), [52](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0/contracts/introspection/IERC165.sol), [53](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.0/contracts/introspection/IERC165.sol), [54](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.1/contracts/introspection/IERC165.sol), [55](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.2/contracts/introspection/IERC165.sol), [56](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.3/contracts/introspection/IERC165.sol), [57](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0/contracts/introspection/IERC165.sol), [58](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.0/contracts/introspection/IERC165.sol), [59](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.1/contracts/introspection/IERC165.sol), [60](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.2/contracts/introspection/IERC165.sol), [61](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.0/contracts/introspection/IERC165.sol), [62](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.0-rc.0/contracts/introspection/IERC165.sol), [63](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.1/contracts/introspection/IERC165.sol), [64](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0/contracts/introspection/IERC165.sol), [65](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-beta.0/contracts/introspection/IERC165.sol), [66](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-rc.0/contracts/introspection/IERC165.sol), [67](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-rc.1/contracts/introspection/IERC165.sol), [68](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.1/contracts/introspection/IERC165.sol), [69](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.2/contracts/introspection/IERC165.sol), [70](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.1.0/contracts/introspection/IERC165.sol), [71](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.1.0-rc.0/contracts/introspection/IERC165.sol), [72](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.0/contracts/introspection/IERC165.sol), [73](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.0-rc.0/contracts/introspection/IERC165.sol), [74](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.1-solc-0.7/contracts/introspection/IERC165.sol), [75](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.2-solc-0.7/contracts/introspection/IERC165.sol) |\n\n</div>\n\n\n## <span id=t-report>Report</span>\n\n### Overview\n\nThe analysis finished with **`0`** errors and **`0`** duplicate files.\n\n\n\n\n\n#### <span id=t-risk>Risk</span>\n\n<div class="wrapper" style="max-width: 512px; margin: auto">\n\t\t\t<canvas id="chart-risk-summary"></canvas>\n</div>\n\n#### <span id=t-source-lines>Source Lines (sloc vs. nsloc)</span>\n\n<div class="wrapper" style="max-width: 512px; margin: auto">\n    <canvas id="chart-nsloc-total"></canvas>\n</div>\n\n#### <span id=t-inline-documentation>Inline Documentation</span>\n\n- **Comment-to-Source Ratio:** On average there are`1.59` code lines per comment (lower=better).\n- **ToDo\'s:** `2` \n\n#### <span id=t-components>Components</span>\n\n| 📝Contracts   | 📚Libraries | 🔍Interfaces | 🎨Abstract |\n| ------------- | ----------- | ------------ | ---------- |\n| 16 | 2  | 13  | 5 |\n\n#### <span id=t-exposed-functions>Exposed Functions</span>\n\nThis section lists functions that are explicitly declared public or payable. Please note that getter methods for public stateVars are not included.  \n\n| 🌐Public   | 💰Payable |\n| ---------- | --------- |\n| 192 | 10  | \n\n| External   | Internal | Private | Pure | View |\n| ---------- | -------- | ------- | ---- | ---- |\n| 175 | 217  | 2 | 13 | 80 |\n\n#### <span id=t-statevariables>StateVariables</span>\n\n| Total      | 🌐Public  |\n| ---------- | --------- |\n| 87  | 80 |\n\n#### <span id=t-capabilities>Capabilities</span>\n\n| Solidity Versions observed | 🧪 Experimental Features | 💰 Can Receive Funds | 🖥 Uses Assembly | 💣 Has Destroyable Contracts | \n| -------------------------- | ------------------------ | -------------------- | ---------------- | ---------------------------- |\n| `^0.8.24`<br/>`>=0.8.0 <0.9.0` |  | `yes` | `yes` <br/>(12 asm blocks) | **** | \n\n| 📤 Transfers ETH | ⚡ Low-Level Calls | 👥 DelegateCall | 🧮 Uses Hash Functions | 🔖 ECRecover | 🌀 New/Create/Create2 |\n| ---------------- | ----------------- | --------------- | ---------------------- | ------------ | --------------------- |\n| `yes` | **** | `yes` | `yes` | **** | **** | \n\n| ♻️ TryCatch | Σ Unchecked |\n| ---------- | ----------- |\n| `yes` | **** |\n\n#### <span id=t-package-imports>Dependencies / External Imports</span>\n\n| Dependency / Import Path | Count  | \n| ------------------------ | ------ |\n| @chainlink/contracts/src/v0.8/vrf/dev/VRFConsumerBaseV2Plus.sol | 1 |\n| @chainlink/contracts/src/v0.8/vrf/dev/libraries/VRFV2PlusClient.sol | 1 |\n| @openzeppelin/contracts/token/ERC20/IERC20.sol | 3 |\n| @openzeppelin/contracts/token/ERC721/IERC721.sol | 1 |\n\n#### <span id=t-totals>Totals</span>\n\n##### Summary\n\n<div class="wrapper" style="max-width: 90%; margin: auto">\n    <canvas id="chart-num-bar"></canvas>\n</div>\n\n##### AST Node Statistics\n\n###### Function Calls\n\n<div class="wrapper" style="max-width: 90%; margin: auto">\n    <canvas id="chart-num-bar-ast-funccalls"></canvas>\n</div>\n\n###### Assembly Calls\n\n<div class="wrapper" style="max-width: 90%; margin: auto">\n    <canvas id="chart-num-bar-ast-asmcalls"></canvas>\n</div>\n\n###### AST Total\n\n<div class="wrapper" style="max-width: 90%; margin: auto">\n    <canvas id="chart-num-bar-ast"></canvas>\n</div>\n\n##### Inheritance Graph\n\n<a onclick="toggleVisibility(\'surya-inherit\', this)">[➕]</a>\n<div id="surya-inherit" style="display:none">\n<div class="wrapper" style="max-width: 512px; margin: auto">\n    <div id="surya-inheritance" style="text-align: center;"></div> \n</div>\n</div>\n\n##### CallGraph\n\n<a onclick="toggleVisibility(\'surya-call\', this)">[➕]</a>\n<div id="surya-call" style="display:none">\n<div class="wrapper" style="max-width: 512px; margin: auto">\n    <div id="surya-callgraph" style="text-align: center;"></div>\n</div>\n</div>\n\n###### Contract Summary\n\n<a onclick="toggleVisibility(\'surya-mdreport\', this)">[➕]</a>\n<div id="surya-mdreport" style="display:none">\n \n\n Files Description Table\n\n\n|  File Name  |  SHA-1 Hash  |\n|-------------|--------------|\n| src/arbitration/KlerosCore.sol | 5362842ab3a88870e8b3b42cd7cf7a2058240483 |\n| src/arbitration/KlerosCoreBase.sol | fe829c80ad434e185151a8b5d299a585f576c619 |\n| src/arbitration/KlerosCoreNeo.sol | 0260ef7a9309d5c73c4c9b1a3f5c7653904f79c7 |\n| src/arbitration/PolicyRegistry.sol | c36299120ac7318dd29e4ab86f50b0447d87af96 |\n| src/arbitration/SortitionModule.sol | c1c1b2dd061590cd6c7eee41767e5c3fb898d506 |\n| src/arbitration/SortitionModuleBase.sol | 7b1037fcdfffc58bf3522f70ed128cad4915e032 |\n| src/arbitration/SortitionModuleNeo.sol | 8570ebeff10d723ce33b75e077dffb6fcf6e2f08 |\n| src/arbitration/arbitrables/DisputeResolver.sol | 7dad21f0219e0a1b698859205bbf31b07abfdc7c |\n| src/arbitration/DisputeTemplateRegistry.sol | c31e000957b979dc513d8b123253adb9edce50c7 |\n| src/arbitration/dispute-kits/DisputeKitClassic.sol | 32bcb287571a3c4a861659be31a1ee2dc6ea6784 |\n| src/arbitration/dispute-kits/DisputeKitClassicBase.sol | 7c0b04f3e73c0a10a29abfa78f78220e4e43f983 |\n| src/arbitration/dispute-kits/DisputeKitGated.sol | e5f7f2ecd65f5e279c7b55e9edbe6f4cfc5fd632 |\n| src/arbitration/dispute-kits/DisputeKitGatedShutter.sol | abb7f1ac20fa60db95d97fea6e9396b108d40924 |\n| src/arbitration/dispute-kits/DisputeKitShutter.sol | 3720b60db303b866eacbb3dee529a638eaf6782e |\n| src/arbitration/dispute-kits/DisputeKitSybilResistant.sol | 69158bf07e78b3cb9892a5fd6cfc768181989a7f |\n| src/arbitration/evidence/EvidenceModule.sol | 45845f3d5ad5548a30698105061bc0e64fd7718f |\n| src/arbitration/interfaces/IArbitrableV2.sol | ce54b7140a6109b2d919cea38ff94ac2ad775398 |\n| src/arbitration/interfaces/IArbitratorV2.sol | 4e0baa0ff6155737540105f9fdb5b54ba2905d2c |\n| src/arbitration/interfaces/IDisputeKit.sol | f21b52ed28a905b3073adaf68961938200cfd644 |\n| src/arbitration/interfaces/IDisputeTemplateRegistry.sol | 8d0351ebeee1ebd8603af9cf50c2ab62f6e8fecb |\n| src/arbitration/interfaces/IEvidence.sol | 12ee130f67f5d38afbcc810129b030cf7f58f058 |\n| src/arbitration/interfaces/ISortitionModule.sol | 2c6d74752298263f7c649e3feecfb9a03c87a16a |\n| src/libraries/Constants.sol | 4d1d44dbeeda03f47a646e9552873d26acf4254d |\n| src/libraries/SafeERC20.sol | 68e49603280eab2b68eabc554dc310ff3313a64c |\n| src/libraries/SafeSend.sol | 9d282cf6456950471debec28103fcb99638fa83d |\n| src/rng/RNGWithFallback.sol | 9729dbce3e1dd5981073df38ac31fe356aae0027 |\n| src/rng/ChainlinkRNG.sol | ce0d145807bc7b5b59b0e29ba468d9b0c0dc0314 |\n| src/rng/IRNG.sol | d701581ef4910cdde9dbc3006dd0229cc3ea6012 |\n| src/proxy/UUPSProxiable.sol | 80d46ace20ea4c9c6a0cbc1093d6e88eb19aeb12 |\n| src/proxy/UUPSProxy.sol | 18a2a570a8ef2ec5f02d59bd1c03a176203e8ccf |\n| src/proxy/Initializable.sol | 7079462341810d12b0c0ea93845d053bdcbdabff |\n\n\n Contracts Description Table\n\n\n|  Contract  |         Type        |       Bases      |                  |                 |\n|:----------:|:-------------------:|:----------------:|:----------------:|:---------------:|\n|     └      |  **Function Name**  |  **Visibility**  |  **Mutability**  |  **Modifiers**  |\n||||||\n| **KlerosCore** | Implementation | KlerosCoreBase |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | reinitializer |\n| └ | reinitialize | External ❗️ | 🛑  | reinitializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByGovernor |\n||||||\n| **KlerosCoreBase** | Implementation | IArbitratorV2, Initializable, UUPSProxiable |||\n| └ | __KlerosCoreBase_initialize | Internal 🔒 | 🛑  | onlyInitializing |\n| └ | pause | External ❗️ | 🛑  | onlyByGuardianOrGovernor whenNotPaused |\n| └ | unpause | External ❗️ | 🛑  | onlyByGovernor whenPaused |\n| └ | executeGovernorProposal | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeGovernor | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeGuardian | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changePinakion | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeJurorProsecutionModule | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeSortitionModule | External ❗️ | 🛑  | onlyByGovernor |\n| └ | addNewDisputeKit | External ❗️ | 🛑  | onlyByGovernor |\n| └ | createCourt | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeCourtParameters | External ❗️ | 🛑  | onlyByGovernor |\n| └ | enableDisputeKits | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeAcceptedFeeTokens | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeCurrencyRates | External ❗️ | 🛑  | onlyByGovernor |\n| └ | setStake | External ❗️ | 🛑  | whenNotPaused |\n| └ | setStakeBySortitionModule | External ❗️ | 🛑  |NO❗️ |\n| └ | transferBySortitionModule | External ❗️ | 🛑  |NO❗️ |\n| └ | createDispute | External ❗️ |  💵 |NO❗️ |\n| └ | createDispute | External ❗️ | 🛑  |NO❗️ |\n| └ | _createDispute | Internal 🔒 | 🛑  | |\n| └ | passPeriod | External ❗️ | 🛑  |NO❗️ |\n| └ | draw | External ❗️ | 🛑  |NO❗️ |\n| └ | appeal | External ❗️ |  💵 |NO❗️ |\n| └ | execute | External ❗️ | 🛑  | whenNotPaused |\n| └ | _executePenalties | Internal 🔒 | 🛑  | |\n| └ | _executeRewards | Internal 🔒 | 🛑  | |\n| └ | executeRuling | External ❗️ | 🛑  |NO❗️ |\n| └ | arbitrationCost | Public ❗️ |   |NO❗️ |\n| └ | arbitrationCost | Public ❗️ |   |NO❗️ |\n| └ | appealCost | Public ❗️ |   |NO❗️ |\n| └ | appealPeriod | External ❗️ |   |NO❗️ |\n| └ | currentRuling | Public ❗️ |   |NO❗️ |\n| └ | getRoundInfo | External ❗️ |   |NO❗️ |\n| └ | getPnkAtStakePerJuror | External ❗️ |   |NO❗️ |\n| └ | getNumberOfRounds | External ❗️ |   |NO❗️ |\n| └ | isSupported | External ❗️ |   |NO❗️ |\n| └ | getTimesPerPeriod | External ❗️ |   |NO❗️ |\n| └ | getNumberOfVotes | External ❗️ |   |NO❗️ |\n| └ | isDisputeKitJumping | External ❗️ |   |NO❗️ |\n| └ | getDisputeKitsLength | External ❗️ |   |NO❗️ |\n| └ | convertEthToTokenAmount | Public ❗️ |   |NO❗️ |\n| └ | _transferFeeToken | Internal 🔒 | 🛑  | |\n| └ | _applyCoherence | Internal 🔒 |   | |\n| └ | _calculatePnkAtStake | Internal 🔒 |   | |\n| └ | _enableDisputeKit | Internal 🔒 | 🛑  | |\n| └ | _setStake | Internal 🔒 | 🛑  | |\n| └ | _stakingFailed | Internal 🔒 |   | |\n| └ | _extraDataToCourtIDMinJurorsDisputeKit | Internal 🔒 |   | |\n||||||\n| **KlerosCoreNeo** | Implementation | KlerosCoreBase |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | reinitializer |\n| └ | reinitialize | External ❗️ | 🛑  | reinitializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByGovernor |\n| └ | changeJurorNft | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeArbitrableWhitelist | External ❗️ | 🛑  | onlyByGovernor |\n| └ | setStake | External ❗️ | 🛑  | whenNotPaused |\n| └ | _createDispute | Internal 🔒 | 🛑  | |\n| └ | _stakingFailed | Internal 🔒 |   | |\n||||||\n| **PolicyRegistry** | Implementation | UUPSProxiable, Initializable |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | reinitializer |\n| └ | initialize2 | External ❗️ | 🛑  | reinitializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByGovernor |\n| └ | changeGovernor | External ❗️ | 🛑  | onlyByGovernor |\n| └ | setPolicy | External ❗️ | 🛑  | onlyByGovernor |\n||||||\n| **SortitionModule** | Implementation | SortitionModuleBase |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | reinitializer |\n| └ | initialize4 | External ❗️ | 🛑  | reinitializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByGovernor |\n||||||\n| **SortitionModuleBase** | Implementation | ISortitionModule, Initializable, UUPSProxiable |||\n| └ | __SortitionModuleBase_initialize | Internal 🔒 | 🛑  | onlyInitializing |\n| └ | changeGovernor | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeMinStakingTime | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeMaxDrawingTime | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeRandomNumberGenerator | External ❗️ | 🛑  | onlyByGovernor |\n| └ | passPhase | External ❗️ | 🛑  |NO❗️ |\n| └ | createTree | External ❗️ | 🛑  | onlyByCore |\n| └ | executeDelayedStakes | External ❗️ | 🛑  |NO❗️ |\n| └ | createDisputeHook | External ❗️ | 🛑  | onlyByCore |\n| └ | postDrawHook | External ❗️ | 🛑  | onlyByCore |\n| └ | notifyRandomNumber | Public ❗️ | 🛑  |NO❗️ |\n| └ | validateStake | External ❗️ | 🛑  | onlyByCore |\n| └ | _validateStake | Internal 🔒 | 🛑  | |\n| └ | setStake | External ❗️ | 🛑  | onlyByCore |\n| └ | _setStake | Internal 🔒 | 🛑  | |\n| └ | lockStake | External ❗️ | 🛑  | onlyByCore |\n| └ | unlockStake | External ❗️ | 🛑  | onlyByCore |\n| └ | penalizeStake | External ❗️ | 🛑  | onlyByCore |\n| └ | setJurorInactive | External ❗️ | 🛑  | onlyByCore |\n| └ | withdrawLeftoverPNK | External ❗️ | 🛑  |NO❗️ |\n| └ | draw | Public ❗️ |   |NO❗️ |\n| └ | stakeOf | Public ❗️ |   |NO❗️ |\n| └ | stakeOf | Public ❗️ |   |NO❗️ |\n| └ | getJurorBalance | External ❗️ |   |NO❗️ |\n| └ | getJurorCourtIDs | Public ❗️ |   |NO❗️ |\n| └ | isJurorStaked | External ❗️ |   |NO❗️ |\n| └ | getJurorLeftoverPNK | Public ❗️ |   |NO❗️ |\n| └ | _updateParents | Private 🔐 | 🛑  | |\n| └ | _stakePathIDToAccount | Internal 🔒 |   | |\n| └ | _extraDataToTreeK | Internal 🔒 |   | |\n| └ | _set | Internal 🔒 | 🛑  | |\n| └ | _accountAndCourtIDToStakePathID | Internal 🔒 |   | |\n||||||\n| **SortitionModuleNeo** | Implementation | SortitionModuleBase |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | reinitializer |\n| └ | initialize4 | External ❗️ | 🛑  | reinitializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByGovernor |\n| └ | changeMaxStakePerJuror | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeMaxTotalStaked | External ❗️ | 🛑  | onlyByGovernor |\n| └ | _validateStake | Internal 🔒 | 🛑  | onlyByCore |\n||||||\n| **DisputeResolver** | Implementation | IArbitrableV2 |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | changeGovernor | External ❗️ | 🛑  |NO❗️ |\n| └ | changeArbitrator | External ❗️ | 🛑  |NO❗️ |\n| └ | changeTemplateRegistry | External ❗️ | 🛑  |NO❗️ |\n| └ | createDisputeForTemplate | External ❗️ |  💵 |NO❗️ |\n| └ | createDisputeForTemplateUri | External ❗️ |  💵 |NO❗️ |\n| └ | rule | External ❗️ | 🛑  |NO❗️ |\n| └ | _createDispute | Internal 🔒 | 🛑  | |\n||||||\n| **DisputeTemplateRegistry** | Implementation | IDisputeTemplateRegistry, UUPSProxiable, Initializable |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | reinitializer |\n| └ | initialize2 | External ❗️ | 🛑  | reinitializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByGovernor |\n| └ | changeGovernor | External ❗️ | 🛑  | onlyByGovernor |\n| └ | setDisputeTemplate | External ❗️ | 🛑  |NO❗️ |\n||||||\n| **DisputeKitClassic** | Implementation | DisputeKitClassicBase |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | reinitializer |\n| └ | reinitialize | External ❗️ | 🛑  | reinitializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByGovernor |\n||||||\n| **DisputeKitClassicBase** | Implementation | IDisputeKit, Initializable, UUPSProxiable |||\n| └ | __DisputeKitClassicBase_initialize | Internal 🔒 | 🛑  | onlyInitializing |\n| └ | executeGovernorProposal | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeGovernor | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeCore | External ❗️ | 🛑  | onlyByGovernor |\n| └ | createDispute | External ❗️ | 🛑  | onlyByCore |\n| └ | draw | External ❗️ | 🛑  | onlyByCore notJumped |\n| └ | castCommit | External ❗️ | 🛑  |NO❗️ |\n| └ | _castCommit | Internal 🔒 | 🛑  | notJumped |\n| └ | castVote | External ❗️ | 🛑  |NO❗️ |\n| └ | _castVote | Internal 🔒 | 🛑  | notJumped |\n| └ | fundAppeal | External ❗️ |  💵 | notJumped |\n| └ | withdrawFeesAndRewards | External ❗️ | 🛑  |NO❗️ |\n| └ | hashVote | Public ❗️ |   |NO❗️ |\n| └ | getFundedChoices | Public ❗️ |   |NO❗️ |\n| └ | currentRuling | External ❗️ |   |NO❗️ |\n| └ | getDegreeOfCoherence | External ❗️ |   |NO❗️ |\n| └ | getCoherentCount | External ❗️ |   |NO❗️ |\n| └ | areCommitsAllCast | External ❗️ |   |NO❗️ |\n| └ | areVotesAllCast | External ❗️ |   |NO❗️ |\n| └ | isAppealFunded | External ❗️ |   |NO❗️ |\n| └ | isVoteActive | External ❗️ |   |NO❗️ |\n| └ | getRoundInfo | External ❗️ |   |NO❗️ |\n| └ | getNumberOfRounds | External ❗️ |   |NO❗️ |\n| └ | getLocalDisputeRoundID | External ❗️ |   |NO❗️ |\n| └ | getVoteInfo | External ❗️ |   |NO❗️ |\n| └ | _postDrawCheck | Internal 🔒 |   | |\n||||||\n| **IBalanceHolder** | Interface |  |||\n| └ | balanceOf | External ❗️ |   |NO❗️ |\n||||||\n| **IBalanceHolderERC1155** | Interface |  |||\n| └ | balanceOf | External ❗️ |   |NO❗️ |\n||||||\n| **DisputeKitGated** | Implementation | DisputeKitClassicBase |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | reinitializer |\n| └ | reinitialize | External ❗️ | 🛑  | reinitializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByGovernor |\n| └ | extraDataToTokenInfo | Public ❗️ |   |NO❗️ |\n| └ | _postDrawCheck | Internal 🔒 |   | |\n||||||\n| **IBalanceHolder** | Interface |  |||\n| └ | balanceOf | External ❗️ |   |NO❗️ |\n||||||\n| **IBalanceHolderERC1155** | Interface |  |||\n| └ | balanceOf | External ❗️ |   |NO❗️ |\n||||||\n| **DisputeKitGatedShutter** | Implementation | DisputeKitClassicBase |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | reinitializer |\n| └ | reinitialize | External ❗️ | 🛑  | reinitializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByGovernor |\n| └ | castCommitShutter | External ❗️ | 🛑  | notJumped |\n| └ | castVoteShutter | External ❗️ | 🛑  |NO❗️ |\n| └ | hashVote | Public ❗️ |   |NO❗️ |\n| └ | _extraDataToTokenInfo | Internal 🔒 |   | |\n| └ | _postDrawCheck | Internal 🔒 |   | |\n||||||\n| **DisputeKitShutter** | Implementation | DisputeKitClassicBase |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | reinitializer |\n| └ | reinitialize | External ❗️ | 🛑  | reinitializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByGovernor |\n| └ | castCommitShutter | External ❗️ | 🛑  | notJumped |\n| └ | castVoteShutter | External ❗️ | 🛑  |NO❗️ |\n| └ | hashVote | Public ❗️ |   |NO❗️ |\n||||||\n| **IProofOfHumanity** | Interface |  |||\n| └ | isRegistered | External ❗️ |   |NO❗️ |\n||||||\n| **DisputeKitSybilResistant** | Implementation | DisputeKitClassicBase |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | reinitializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByGovernor |\n| └ | _postDrawCheck | Internal 🔒 |   | |\n||||||\n| **EvidenceModule** | Implementation | IEvidence, Initializable, UUPSProxiable |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | reinitializer |\n| └ | initialize2 | External ❗️ | 🛑  | reinitializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByGovernor |\n| └ | submitEvidence | External ❗️ | 🛑  |NO❗️ |\n||||||\n| **IArbitrableV2** | Interface |  |||\n| └ | rule | External ❗️ | 🛑  |NO❗️ |\n||||||\n| **IArbitratorV2** | Interface |  |||\n| └ | createDispute | External ❗️ |  💵 |NO❗️ |\n| └ | createDispute | External ❗️ | 🛑  |NO❗️ |\n| └ | arbitrationCost | External ❗️ |   |NO❗️ |\n| └ | arbitrationCost | External ❗️ |   |NO❗️ |\n| └ | currentRuling | External ❗️ |   |NO❗️ |\n||||||\n| **IDisputeKit** | Interface |  |||\n| └ | createDispute | External ❗️ | 🛑  |NO❗️ |\n| └ | draw | External ❗️ | 🛑  |NO❗️ |\n| └ | currentRuling | External ❗️ |   |NO❗️ |\n| └ | getDegreeOfCoherence | External ❗️ |   |NO❗️ |\n| └ | getCoherentCount | External ❗️ |   |NO❗️ |\n| └ | areCommitsAllCast | External ❗️ |   |NO❗️ |\n| └ | areVotesAllCast | External ❗️ |   |NO❗️ |\n| └ | isAppealFunded | External ❗️ |   |NO❗️ |\n| └ | isVoteActive | External ❗️ |   |NO❗️ |\n| └ | getRoundInfo | External ❗️ |   |NO❗️ |\n| └ | getVoteInfo | External ❗️ |   |NO❗️ |\n||||||\n| **IDisputeTemplateRegistry** | Interface |  |||\n| └ | setDisputeTemplate | External ❗️ | 🛑  |NO❗️ |\n||||||\n| **IEvidence** | Interface |  |||\n||||||\n| **ISortitionModule** | Interface |  |||\n| └ | createTree | External ❗️ | 🛑  |NO❗️ |\n| └ | validateStake | External ❗️ | 🛑  |NO❗️ |\n| └ | setStake | External ❗️ | 🛑  |NO❗️ |\n| └ | setJurorInactive | External ❗️ | 🛑  |NO❗️ |\n| └ | lockStake | External ❗️ | 🛑  |NO❗️ |\n| └ | unlockStake | External ❗️ | 🛑  |NO❗️ |\n| └ | penalizeStake | External ❗️ | 🛑  |NO❗️ |\n| └ | notifyRandomNumber | External ❗️ | 🛑  |NO❗️ |\n| └ | draw | External ❗️ |   |NO❗️ |\n| └ | getJurorBalance | External ❗️ |   |NO❗️ |\n| └ | getJurorCourtIDs | External ❗️ |   |NO❗️ |\n| └ | isJurorStaked | External ❗️ |   |NO❗️ |\n| └ | getJurorLeftoverPNK | External ❗️ |   |NO❗️ |\n| └ | createDisputeHook | External ❗️ | 🛑  |NO❗️ |\n| └ | postDrawHook | External ❗️ | 🛑  |NO❗️ |\n| └ | withdrawLeftoverPNK | External ❗️ | 🛑  |NO❗️ |\n||||||\n| **SafeERC20** | Library |  |||\n| └ | increaseAllowance | Internal 🔒 | 🛑  | |\n| └ | safeTransfer | Internal 🔒 | 🛑  | |\n| └ | safeTransferFrom | Internal 🔒 | 🛑  | |\n||||||\n| **WethLike** | Interface |  |||\n| └ | deposit | External ❗️ |  💵 |NO❗️ |\n| └ | transfer | External ❗️ | 🛑  |NO❗️ |\n||||||\n| **SafeSend** | Library |  |||\n| └ | safeSend | Internal 🔒 | 🛑  | |\n||||||\n| **RNGWithFallback** | Implementation | IRNG |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | changeGovernor | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeConsumer | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeFallbackTimeout | External ❗️ | 🛑  | onlyByGovernor |\n| └ | requestRandomness | External ❗️ | 🛑  | onlyByConsumer |\n| └ | receiveRandomness | External ❗️ | 🛑  | onlyByConsumer |\n||||||\n| **ChainlinkRNG** | Implementation | IRNG, VRFConsumerBaseV2Plus |||\n| └ | <Constructor> | Public ❗️ | 🛑  | VRFConsumerBaseV2Plus |\n| └ | changeGovernor | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeConsumer | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeVrfCoordinator | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeKeyHash | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeSubscriptionId | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeRequestConfirmations | External ❗️ | 🛑  | onlyByGovernor |\n| └ | changeCallbackGasLimit | External ❗️ | 🛑  | onlyByGovernor |\n| └ | requestRandomness | External ❗️ | 🛑  | onlyByConsumer |\n| └ | fulfillRandomWords | Internal 🔒 | 🛑  | |\n| └ | receiveRandomness | External ❗️ |   |NO❗️ |\n||||||\n| **IRNG** | Interface |  |||\n| └ | requestRandomness | External ❗️ | 🛑  |NO❗️ |\n| └ | receiveRandomness | External ❗️ | 🛑  |NO❗️ |\n||||||\n| **UUPSProxiable** | Implementation |  |||\n| └ | _authorizeUpgrade | Internal 🔒 | 🛑  | |\n| └ | upgradeToAndCall | Public ❗️ |  💵 |NO❗️ |\n| └ | proxiableUUID | External ❗️ |   |NO❗️ |\n| └ | version | External ❗️ |   |NO❗️ |\n| └ | _getImplementation | Internal 🔒 |   | |\n||||||\n| **UUPSProxy** | Implementation |  |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | _delegate | Internal 🔒 | 🛑  | |\n| └ | _getImplementation | Internal 🔒 |   | |\n| └ | <Fallback> | External ❗️ |  💵 |NO❗️ |\n| └ | <Receive Ether> | External ❗️ |  💵 |NO❗️ |\n||||||\n| **Initializable** | Implementation |  |||\n| └ | _checkInitializing | Internal 🔒 |   | |\n| └ | _disableInitializers | Internal 🔒 | 🛑  | |\n| └ | _getInitializedVersion | Internal 🔒 |   | |\n| └ | _isInitializing | Internal 🔒 |   | |\n| └ | _getInitializableStorage | Private 🔐 |   | |\n\n\n Legend\n\n|  Symbol  |  Meaning  |\n|:--------:|-----------|\n|    🛑    | Function can modify state |\n|    💵    | Function is payable |\n \n\n</div>\n____\n<sub>\nThinking about smart contract security? We can provide training, ongoing advice, and smart contract auditing. [Contact us](https://consensys.io/diligence/contact/).\n</sub>\n\n',
+          '\n[<img width="200" alt="get in touch with Consensys Diligence" src="https://user-images.githubusercontent.com/2865694/56826101-91dcf380-685b-11e9-937c-af49c2510aa0.png">](https://consensys.io/diligence)<br/>\n<sup>\n[[  🌐  ](https://consensys.io/diligence)  [  📩  ](mailto:diligence@consensys.net)  [  🔥  ](https://consensys.io/diligence/tools/)]\n</sup><br/><br/>\n\n\n\n# Solidity Metrics for \'CLI\'\n\n## Table of contents\n\n- [Scope](#t-scope)\n    - [Source Units in Scope](#t-source-Units-in-Scope)\n        - [Deployable Logic Contracts](#t-deployable-contracts)\n    - [Out of Scope](#t-out-of-scope)\n        - [Excluded Source Units](#t-out-of-scope-excluded-source-units)\n        - [Duplicate Source Units](#t-out-of-scope-duplicate-source-units)\n        - [Doppelganger Contracts](#t-out-of-scope-doppelganger-contracts)\n- [Report Overview](#t-report)\n    - [Risk Summary](#t-risk)\n    - [Source Lines](#t-source-lines)\n    - [Inline Documentation](#t-inline-documentation)\n    - [Components](#t-components)\n    - [Exposed Functions](#t-exposed-functions)\n    - [StateVariables](#t-statevariables)\n    - [Capabilities](#t-capabilities)\n    - [Dependencies](#t-package-imports)\n    - [Totals](#t-totals)\n\n## <span id=t-scope>Scope</span>\n\nThis section lists files that are in scope for the metrics report. \n\n- **Project:** `\'CLI\'`\n- **Included Files:** \n    - ``\n- **Excluded Paths:** \n    - ``\n- **File Limit:** `undefined`\n    - **Exclude File list Limit:** `undefined`\n\n- **Workspace Repository:** `unknown` (`undefined`@`undefined`)\n\n### <span id=t-source-Units-in-Scope>Source Units in Scope</span>\n\nSource Units Analyzed: **`27`**<br>\nSource Units in Scope: **`27`** (**100%**)\n\n| Type | File   | Logic Contracts | Interfaces | Lines | nLines | nSLOC | Comment Lines | Complex. Score | Capabilities |\n| ---- | ------ | --------------- | ---------- | ----- | ------ | ----- | ------------- | -------------- | ------------ | \n| 📝 | src/arbitration/KlerosCore.sol | 1 | **** | 1333 | 1272 | 869 | 322 | 486 | **<abbr title=\'Uses Assembly\'>🖥</abbr><abbr title=\'Payable Functions\'>💰</abbr>** |\n| 📝 | src/arbitration/PolicyRegistry.sol | 1 | **** | 90 | 90 | 29 | 43 | 22 | **** |\n| 📝 | src/arbitration/SortitionModule.sol | 1 | **** | 622 | 572 | 325 | 208 | 223 | **<abbr title=\'Uses Assembly\'>🖥</abbr>** |\n| 📝 | src/arbitration/arbitrables/DisputeResolver.sol | 1 | **** | 159 | 144 | 77 | 53 | 50 | **<abbr title=\'Payable Functions\'>💰</abbr>** |\n| 📝 | src/arbitration/DisputeTemplateRegistry.sol | 1 | **** | 85 | 81 | 29 | 35 | 23 | **** |\n| 📝 | src/arbitration/dispute-kits/DisputeKitClassic.sol | 1 | **** | 48 | 43 | 13 | 22 | 10 | **** |\n| 🎨 | src/arbitration/dispute-kits/DisputeKitClassicBase.sol | 1 | **** | 800 | 705 | 407 | 253 | 228 | **<abbr title=\'Payable Functions\'>💰</abbr><abbr title=\'Uses Hash-Functions\'>🧮</abbr>** |\n| 📝🔍 | src/arbitration/dispute-kits/DisputeKitGated.sol | 1 | 2 | 119 | 96 | 36 | 52 | 54 | **<abbr title=\'Uses Assembly\'>🖥</abbr><abbr title=\'doppelganger(IBalanceHolderERC1155)\'>🔆</abbr>** |\n| 📝🔍 | src/arbitration/dispute-kits/DisputeKitGatedShutter.sol | 1 | 2 | 256 | 211 | 81 | 104 | 80 | **<abbr title=\'Uses Assembly\'>🖥</abbr><abbr title=\'Uses Hash-Functions\'>🧮</abbr><abbr title=\'doppelganger(IBalanceHolderERC1155)\'>🔆</abbr>** |\n| 📝 | src/arbitration/dispute-kits/DisputeKitShutter.sol | 1 | **** | 189 | 163 | 58 | 77 | 38 | **<abbr title=\'Uses Hash-Functions\'>🧮</abbr>** |\n| 📝🔍 | src/arbitration/dispute-kits/DisputeKitSybilResistant.sol | 1 | 1 | 78 | 59 | 20 | 34 | 16 | **<abbr title=\'doppelganger(IProofOfHumanity)\'>🔆</abbr>** |\n| 📝 | src/arbitration/evidence/EvidenceModule.sol | 1 | **** | 72 | 72 | 25 | 32 | 19 | **** |\n| 🔍 | src/arbitration/interfaces/IArbitrableV2.sol | **** | 1 | 40 | 39 | 12 | 22 | 3 | **** |\n| 🔍 | src/arbitration/interfaces/IArbitratorV2.sol | **** | 1 | 83 | 44 | 9 | 50 | 14 | **<abbr title=\'Payable Functions\'>💰</abbr>** |\n| 🔍 | src/arbitration/interfaces/IDisputeKit.sol | **** | 1 | 165 | 39 | 11 | 78 | 31 | **** |\n| 🔍 | src/arbitration/interfaces/IDisputeTemplateRegistry.sol | **** | 1 | 25 | 20 | 9 | 8 | 3 | **** |\n| 🔍 | src/arbitration/interfaces/IEvidence.sol | **** | 1 | 12 | 12 | 4 | 6 | 1 | **** |\n| 🔍 | src/arbitration/interfaces/ISortitionModule.sol | **** | 1 | 73 | 16 | 10 | 4 | 37 | **** |\n|  | src/libraries/Constants.sol | **** | **** | 42 | 42 | 27 | 14 | 2 | **** |\n| 📚 | src/libraries/SafeERC20.sol | 1 | **** | 47 | 47 | 18 | 24 | 12 | **** |\n| 📚🔍 | src/libraries/SafeSend.sol | 1 | 1 | 24 | 19 | 9 | 7 | 15 | **<abbr title=\'Payable Functions\'>💰</abbr><abbr title=\'Initiates ETH Value Transfer\'>📤</abbr>** |\n| 📝 | src/rng/RNGWithFallback.sol | 1 | **** | 109 | 109 | 49 | 44 | 38 | **** |\n| 📝 | src/rng/ChainlinkRNG.sol | 1 | **** | 171 | 171 | 83 | 69 | 51 | **** |\n| 🔍 | src/rng/IRNG.sol | **** | 1 | 16 | 8 | 3 | 5 | 5 | **** |\n| 🎨 | src/proxy/UUPSProxiable.sol | 1 | **** | 140 | 122 | 44 | 71 | 46 | **<abbr title=\'Uses Assembly\'>🖥</abbr><abbr title=\'Payable Functions\'>💰</abbr><abbr title=\'DelegateCall\'>👥</abbr><abbr title=\'TryCatch Blocks\'>♻️</abbr>** |\n| 📝 | src/proxy/UUPSProxy.sol | 1 | **** | 90 | 90 | 38 | 37 | 65 | **<abbr title=\'Uses Assembly\'>🖥</abbr><abbr title=\'Payable Functions\'>💰</abbr><abbr title=\'DelegateCall\'>👥</abbr>** |\n| 🎨 | src/proxy/Initializable.sol | 1 | **** | 215 | 215 | 70 | 128 | 31 | **<abbr title=\'Uses Assembly\'>🖥</abbr>** |\n| 📝📚🔍🎨 | **Totals** | **19** | **13** | **5103**  | **4501** | **2365** | **1802** | **1603** | **<abbr title=\'Uses Assembly\'>🖥</abbr><abbr title=\'Payable Functions\'>💰</abbr><abbr title=\'Initiates ETH Value Transfer\'>📤</abbr><abbr title=\'DelegateCall\'>👥</abbr><abbr title=\'Uses Hash-Functions\'>🧮</abbr><abbr title=\'doppelganger\'>🔆</abbr><abbr title=\'TryCatch Blocks\'>♻️</abbr>** |\n\n<sub>\nLegend: <a onclick="toggleVisibility(\'table-legend\', this)">[➕]</a>\n<div id="table-legend" style="display:none">\n\n<ul>\n<li> <b>Lines</b>: total lines of the source unit </li>\n<li> <b>nLines</b>: normalized lines of the source unit (e.g. normalizes functions spanning multiple lines) </li>\n<li> <b>nSLOC</b>: normalized source lines of code (only source-code lines; no comments, no blank lines) </li>\n<li> <b>Comment Lines</b>: lines containing single or block comments </li>\n<li> <b>Complexity Score</b>: a custom complexity score derived from code statements that are known to introduce code complexity (branches, loops, calls, external interfaces, ...) </li>\n</ul>\n\n</div>\n</sub>\n\n\n##### <span id=t-deployable-contracts>Deployable Logic Contracts</span>\nTotal: 14\n* 📝 `KlerosCore`\n* 📝 `PolicyRegistry`\n* 📝 `SortitionModule`\n* 📝 `DisputeResolver`\n* 📝 `DisputeTemplateRegistry`\n* <a onclick="toggleVisibility(\'deployables\', this)">[➕]</a>\n<div id="deployables" style="display:none">\n<ul>\n<li> 📝 <code>DisputeKitClassic</code></li>\n<li> 📝 <code>DisputeKitGated</code></li>\n<li> 📝 <code>DisputeKitGatedShutter</code></li>\n<li> 📝 <code>DisputeKitShutter</code></li>\n<li> 📝 <code>DisputeKitSybilResistant</code></li>\n<li> 📝 <code>EvidenceModule</code></li>\n<li> 📝 <code>RNGWithFallback</code></li>\n<li> 📝 <code>ChainlinkRNG</code></li>\n<li> 📝 <code>UUPSProxy</code></li>\n</ul>\n</div>\n            \n\n\n\n#### <span id=t-out-of-scope>Out of Scope</span>\n\n##### <span id=t-out-of-scope-excluded-source-units>Excluded Source Units</span>\n\nSource Units Excluded: **`0`**\n\n<a onclick="toggleVisibility(\'excluded-files\', this)">[➕]</a>\n<div id="excluded-files" style="display:none">\n| File   |\n| ------ |\n| None |\n\n</div>\n\n\n##### <span id=t-out-of-scope-duplicate-source-units>Duplicate Source Units</span>\n\nDuplicate Source Units Excluded: **`0`** \n\n<a onclick="toggleVisibility(\'duplicate-files\', this)">[➕]</a>\n<div id="duplicate-files" style="display:none">\n| File   |\n| ------ |\n| None |\n\n</div>\n\n##### <span id=t-out-of-scope-doppelganger-contracts>Doppelganger Contracts</span>\n\nDoppelganger Contracts: **`3`** \n\n<a onclick="toggleVisibility(\'doppelganger-contracts\', this)">[➕]</a>\n<div id="doppelganger-contracts" style="display:none">\n| File   | Contract | Doppelganger | \n| ------ | -------- | ------------ |\n| src/arbitration/dispute-kits/DisputeKitGated.sol | IBalanceHolderERC1155 | (fuzzy) [0](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.5.0/contracts/introspection/IERC1820Implementer.sol), [1](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.2.0/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [2](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.2.2-solc-0.7/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [3](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.3.0/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [4](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.3.0-solc-0.7/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [5](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.4.0/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [6](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.4.0-solc-0.7/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [7](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [8](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0-beta.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [9](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0-rc.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [10](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.1.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [11](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.1.0-rc.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [12](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.2.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [13](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0/contracts/introspection/IERC1820Implementer.sol), [14](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.0/contracts/drafts/IERC1820Implementer.sol), [15](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.1/contracts/drafts/IERC1820Implementer.sol), [16](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.2/contracts/introspection/IERC1820Implementer.sol), [17](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.3/contracts/introspection/IERC1820Implementer.sol), [18](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0/contracts/introspection/IERC1820Implementer.sol), [19](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.0/contracts/introspection/IERC1820Implementer.sol), [20](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.1/contracts/introspection/IERC1820Implementer.sol), [21](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.2/contracts/introspection/IERC1820Implementer.sol), [22](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.0/contracts/introspection/IERC1820Implementer.sol), [23](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [24](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.1/contracts/introspection/IERC1820Implementer.sol), [25](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0/contracts/introspection/IERC1820Implementer.sol), [26](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-beta.0/contracts/introspection/IERC1820Implementer.sol), [27](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [28](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-rc.1/contracts/introspection/IERC1820Implementer.sol), [29](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.1/contracts/introspection/IERC1820Implementer.sol), [30](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.2/contracts/introspection/IERC1820Implementer.sol), [31](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.1.0/contracts/introspection/IERC1820Implementer.sol), [32](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.1.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [33](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.0/contracts/introspection/IERC1820Implementer.sol), [34](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [35](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.1-solc-0.7/contracts/introspection/IERC1820Implementer.sol), [36](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.2-solc-0.7/contracts/introspection/IERC1820Implementer.sol) |\n| src/arbitration/dispute-kits/DisputeKitGatedShutter.sol | IBalanceHolderERC1155 | (fuzzy) [0](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.5.0/contracts/introspection/IERC1820Implementer.sol), [1](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.2.0/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [2](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.2.2-solc-0.7/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [3](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.3.0/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [4](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.3.0-solc-0.7/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [5](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.4.0/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [6](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.4.0-solc-0.7/contracts/introspection/IERC1820ImplementerUpgradeable.sol), [7](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [8](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0-beta.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [9](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0-rc.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [10](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.1.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [11](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.1.0-rc.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [12](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.2.0/contracts/utils/introspection/IERC1820ImplementerUpgradeable.sol), [13](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0/contracts/introspection/IERC1820Implementer.sol), [14](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.0/contracts/drafts/IERC1820Implementer.sol), [15](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.1/contracts/drafts/IERC1820Implementer.sol), [16](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.2/contracts/introspection/IERC1820Implementer.sol), [17](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.3/contracts/introspection/IERC1820Implementer.sol), [18](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0/contracts/introspection/IERC1820Implementer.sol), [19](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.0/contracts/introspection/IERC1820Implementer.sol), [20](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.1/contracts/introspection/IERC1820Implementer.sol), [21](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.2/contracts/introspection/IERC1820Implementer.sol), [22](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.0/contracts/introspection/IERC1820Implementer.sol), [23](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [24](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.1/contracts/introspection/IERC1820Implementer.sol), [25](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0/contracts/introspection/IERC1820Implementer.sol), [26](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-beta.0/contracts/introspection/IERC1820Implementer.sol), [27](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [28](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-rc.1/contracts/introspection/IERC1820Implementer.sol), [29](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.1/contracts/introspection/IERC1820Implementer.sol), [30](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.2/contracts/introspection/IERC1820Implementer.sol), [31](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.1.0/contracts/introspection/IERC1820Implementer.sol), [32](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.1.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [33](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.0/contracts/introspection/IERC1820Implementer.sol), [34](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.0-rc.0/contracts/introspection/IERC1820Implementer.sol), [35](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.1-solc-0.7/contracts/introspection/IERC1820Implementer.sol), [36](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.2-solc-0.7/contracts/introspection/IERC1820Implementer.sol) |\n| src/arbitration/dispute-kits/DisputeKitSybilResistant.sol | IProofOfHumanity | (fuzzy) [0](https://github.com/smartcontractkit/chainlink/blob/explorer-v0.8.5/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [1](https://github.com/smartcontractkit/chainlink/blob/upgrade/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [2](https://github.com/smartcontractkit/chainlink/blob/v.0.8.12/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [3](https://github.com/smartcontractkit/chainlink/blob/v0.8.12/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [4](https://github.com/smartcontractkit/chainlink/blob/v0.8.13/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [5](https://github.com/smartcontractkit/chainlink/blob/v0.8.14/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [6](https://github.com/smartcontractkit/chainlink/blob/v0.8.15/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [7](https://github.com/smartcontractkit/chainlink/blob/v0.8.16/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [8](https://github.com/smartcontractkit/chainlink/blob/v0.8.17/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [9](https://github.com/smartcontractkit/chainlink/blob/v0.8.18/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [10](https://github.com/smartcontractkit/chainlink/blob/v0.9.0/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [11](https://github.com/smartcontractkit/chainlink/blob/v0.9.2/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [12](https://github.com/smartcontractkit/chainlink/blob/v0.9.3/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [13](https://github.com/smartcontractkit/chainlink/blob/v0.9.4/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [14](https://github.com/smartcontractkit/chainlink/blob/v0.9.5/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [15](https://github.com/smartcontractkit/chainlink/blob/v0.9.6/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [16](https://github.com/smartcontractkit/chainlink/blob/v0.9.7/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [17](https://github.com/smartcontractkit/chainlink/blob/v0.9.8/evm-contracts/src/v0.6/interfaces/BlockHashStoreInterface.sol), [18](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.0.0/contracts/introspection/IERC165.sol), [19](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.0.1/contracts/introspection/IERC165.sol), [20](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.0.2/contracts/introspection/IERC165.sol), [21](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.1.2/contracts/introspection/IERC165.sol), [22](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.1.3/contracts/introspection/IERC165.sol), [23](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.2.1/contracts/introspection/IERC165.sol), [24](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.2.2/contracts/introspection/IERC165.sol), [25](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.2.3/contracts/introspection/IERC165.sol), [26](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v2.5.0/contracts/introspection/IERC165.sol), [27](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.2.0/contracts/introspection/IERC165Upgradeable.sol), [28](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.2.2-solc-0.7/contracts/introspection/IERC165Upgradeable.sol), [29](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.3.0/contracts/introspection/IERC165Upgradeable.sol), [30](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.3.0-solc-0.7/contracts/introspection/IERC165Upgradeable.sol), [31](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.4.0/contracts/introspection/IERC165Upgradeable.sol), [32](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v3.4.0-solc-0.7/contracts/introspection/IERC165Upgradeable.sol), [33](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0/contracts/utils/introspection/IERC165Upgradeable.sol), [34](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0-beta.0/contracts/utils/introspection/IERC165Upgradeable.sol), [35](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.0.0-rc.0/contracts/utils/introspection/IERC165Upgradeable.sol), [36](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.1.0/contracts/utils/introspection/IERC165Upgradeable.sol), [37](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.1.0-rc.0/contracts/utils/introspection/IERC165Upgradeable.sol), [38](https://github.com/OpenZeppelin/openzeppelin-contracts-upgradeable/blob/v4.2.0/contracts/utils/introspection/IERC165Upgradeable.sol), [39](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.0.0/contracts/introspection/IERC165.sol), [40](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.0.0-rc.1/contracts/introspection/IERC165.sol), [41](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.0.0-rc.2/contracts/introspection/IERC165.sol), [42](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.0.0-rc.3/contracts/introspection/IERC165.sol), [43](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.0.0-rc.4/contracts/introspection/IERC165.sol), [44](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.0.1/contracts/introspection/IERC165.sol), [45](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.1.0-rc.1/contracts/introspection/IERC165.sol), [46](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.1.0-rc.2/contracts/introspection/IERC165.sol), [47](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.1.1/contracts/introspection/IERC165.sol), [48](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.1.2/contracts/introspection/IERC165.sol), [49](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.1.3/contracts/introspection/IERC165.sol), [50](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.2.0/contracts/introspection/IERC165.sol), [51](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.2.0-rc.1/contracts/introspection/IERC165.sol), [52](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0/contracts/introspection/IERC165.sol), [53](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.0/contracts/introspection/IERC165.sol), [54](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.1/contracts/introspection/IERC165.sol), [55](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.2/contracts/introspection/IERC165.sol), [56](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.3.0-rc.3/contracts/introspection/IERC165.sol), [57](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0/contracts/introspection/IERC165.sol), [58](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.0/contracts/introspection/IERC165.sol), [59](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.1/contracts/introspection/IERC165.sol), [60](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.4.0-beta.2/contracts/introspection/IERC165.sol), [61](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.0/contracts/introspection/IERC165.sol), [62](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.0-rc.0/contracts/introspection/IERC165.sol), [63](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v2.5.1/contracts/introspection/IERC165.sol), [64](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0/contracts/introspection/IERC165.sol), [65](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-beta.0/contracts/introspection/IERC165.sol), [66](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-rc.0/contracts/introspection/IERC165.sol), [67](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.0-rc.1/contracts/introspection/IERC165.sol), [68](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.1/contracts/introspection/IERC165.sol), [69](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.0.2/contracts/introspection/IERC165.sol), [70](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.1.0/contracts/introspection/IERC165.sol), [71](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.1.0-rc.0/contracts/introspection/IERC165.sol), [72](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.0/contracts/introspection/IERC165.sol), [73](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.0-rc.0/contracts/introspection/IERC165.sol), [74](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.1-solc-0.7/contracts/introspection/IERC165.sol), [75](https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v3.2.2-solc-0.7/contracts/introspection/IERC165.sol) |\n\n</div>\n\n\n## <span id=t-report>Report</span>\n\n### Overview\n\nThe analysis finished with **`0`** errors and **`0`** duplicate files.\n\n\n\n\n\n#### <span id=t-risk>Risk</span>\n\n<div class="wrapper" style="max-width: 512px; margin: auto">\n\t\t\t<canvas id="chart-risk-summary"></canvas>\n</div>\n\n#### <span id=t-source-lines>Source Lines (sloc vs. nsloc)</span>\n\n<div class="wrapper" style="max-width: 512px; margin: auto">\n    <canvas id="chart-nsloc-total"></canvas>\n</div>\n\n#### <span id=t-inline-documentation>Inline Documentation</span>\n\n- **Comment-to-Source Ratio:** On average there are`1.56` code lines per comment (lower=better).\n- **ToDo\'s:** `3` \n\n#### <span id=t-components>Components</span>\n\n| 📝Contracts   | 📚Libraries | 🔍Interfaces | 🎨Abstract |\n| ------------- | ----------- | ------------ | ---------- |\n| 14 | 2  | 13  | 3 |\n\n#### <span id=t-exposed-functions>Exposed Functions</span>\n\nThis section lists functions that are explicitly declared public or payable. Please note that getter methods for public stateVars are not included.  \n\n| 🌐Public   | 💰Payable |\n| ---------- | --------- |\n| 191 | 10  | \n\n| External   | Internal | Private | Pure | View |\n| ---------- | -------- | ------- | ---- | ---- |\n| 175 | 197  | 1 | 9 | 92 |\n\n#### <span id=t-statevariables>StateVariables</span>\n\n| Total      | 🌐Public  |\n| ---------- | --------- |\n| 88  | 82 |\n\n#### <span id=t-capabilities>Capabilities</span>\n\n| Solidity Versions observed | 🧪 Experimental Features | 💰 Can Receive Funds | 🖥 Uses Assembly | 💣 Has Destroyable Contracts | \n| -------------------------- | ------------------------ | -------------------- | ---------------- | ---------------------------- |\n| `^0.8.24`<br/>`^0.8.28`<br/>`>=0.8.0 <0.9.0` |  | `yes` | `yes` <br/>(10 asm blocks) | **** | \n\n| 📤 Transfers ETH | ⚡ Low-Level Calls | 👥 DelegateCall | 🧮 Uses Hash Functions | 🔖 ECRecover | 🌀 New/Create/Create2 |\n| ---------------- | ----------------- | --------------- | ---------------------- | ------------ | --------------------- |\n| `yes` | **** | `yes` | `yes` | **** | **** | \n\n| ♻️ TryCatch | Σ Unchecked |\n| ---------- | ----------- |\n| `yes` | **** |\n\n#### <span id=t-package-imports>Dependencies / External Imports</span>\n\n| Dependency / Import Path | Count  | \n| ------------------------ | ------ |\n| @chainlink/contracts/src/v0.8/vrf/dev/libraries/VRFV2PlusClient.sol | 1 |\n| @openzeppelin/contracts/token/ERC20/IERC20.sol | 3 |\n| @openzeppelin/contracts/token/ERC721/IERC721.sol | 1 |\n\n#### <span id=t-totals>Totals</span>\n\n##### Summary\n\n<div class="wrapper" style="max-width: 90%; margin: auto">\n    <canvas id="chart-num-bar"></canvas>\n</div>\n\n##### AST Node Statistics\n\n###### Function Calls\n\n<div class="wrapper" style="max-width: 90%; margin: auto">\n    <canvas id="chart-num-bar-ast-funccalls"></canvas>\n</div>\n\n###### Assembly Calls\n\n<div class="wrapper" style="max-width: 90%; margin: auto">\n    <canvas id="chart-num-bar-ast-asmcalls"></canvas>\n</div>\n\n###### AST Total\n\n<div class="wrapper" style="max-width: 90%; margin: auto">\n    <canvas id="chart-num-bar-ast"></canvas>\n</div>\n\n##### Inheritance Graph\n\n<a onclick="toggleVisibility(\'surya-inherit\', this)">[➕]</a>\n<div id="surya-inherit" style="display:none">\n<div class="wrapper" style="max-width: 512px; margin: auto">\n    <div id="surya-inheritance" style="text-align: center;"></div> \n</div>\n</div>\n\n##### CallGraph\n\n<a onclick="toggleVisibility(\'surya-call\', this)">[➕]</a>\n<div id="surya-call" style="display:none">\n<div class="wrapper" style="max-width: 512px; margin: auto">\n    <div id="surya-callgraph" style="text-align: center;"></div>\n</div>\n</div>\n\n###### Contract Summary\n\n<a onclick="toggleVisibility(\'surya-mdreport\', this)">[➕]</a>\n<div id="surya-mdreport" style="display:none">\n \n\n Files Description Table\n\n\n|  File Name  |  SHA-1 Hash  |\n|-------------|--------------|\n| src/arbitration/KlerosCore.sol | 383e209070883ddd480ef42f775d9c46dd3a9312 |\n| src/arbitration/PolicyRegistry.sol | 513ee51fc5262e41bf1ee58c19011b2166bb8281 |\n| src/arbitration/SortitionModule.sol | 455986084175670bcd15911f4f04cbf64203da41 |\n| src/arbitration/arbitrables/DisputeResolver.sol | 985b9082c8187d8c4d35e1c88c54f954532cd94f |\n| src/arbitration/DisputeTemplateRegistry.sol | 3cc2892233d940bf4523414680e361869f6df054 |\n| src/arbitration/dispute-kits/DisputeKitClassic.sol | b7a6a3c1e021f11c8f6f8ae7c184e947a7cd45d9 |\n| src/arbitration/dispute-kits/DisputeKitClassicBase.sol | c0d30028020e75203758df5241cdaf1138464b75 |\n| src/arbitration/dispute-kits/DisputeKitGated.sol | c98ed7a48f251debdd88a325245dcb8e04926311 |\n| src/arbitration/dispute-kits/DisputeKitGatedShutter.sol | bfe8f9e2598454027643644e246140623d5c73a8 |\n| src/arbitration/dispute-kits/DisputeKitShutter.sol | b77e1e9ddfcf19c31570f0bfbf01c18086c99f56 |\n| src/arbitration/dispute-kits/DisputeKitSybilResistant.sol | 8bba9bb201d66fc07abc436b7830701a92e0ffb6 |\n| src/arbitration/evidence/EvidenceModule.sol | 0098cc5e9939d1193f152890dfc94729a0d8bbd4 |\n| src/arbitration/interfaces/IArbitrableV2.sol | ce54b7140a6109b2d919cea38ff94ac2ad775398 |\n| src/arbitration/interfaces/IArbitratorV2.sol | 4e0baa0ff6155737540105f9fdb5b54ba2905d2c |\n| src/arbitration/interfaces/IDisputeKit.sol | 06e3c893fca325de50367a1a862036771295885b |\n| src/arbitration/interfaces/IDisputeTemplateRegistry.sol | 8d0351ebeee1ebd8603af9cf50c2ab62f6e8fecb |\n| src/arbitration/interfaces/IEvidence.sol | 12ee130f67f5d38afbcc810129b030cf7f58f058 |\n| src/arbitration/interfaces/ISortitionModule.sol | ea2526039c8675ddbc387198b29600a49c3584c1 |\n| src/libraries/Constants.sol | 6ce9e86c301042de2d32f9a3a5cfc2d65c34fa47 |\n| src/libraries/SafeERC20.sol | 68e49603280eab2b68eabc554dc310ff3313a64c |\n| src/libraries/SafeSend.sol | 9d282cf6456950471debec28103fcb99638fa83d |\n| src/rng/RNGWithFallback.sol | 0d90b33bb4fdeb9492d5b2474135790cd0c986e5 |\n| src/rng/ChainlinkRNG.sol | 54f081a26e78c5aa0d58207372944a603eae5cf7 |\n| src/rng/IRNG.sol | 25eee63b46a76183c24b39d81ae85044474a6a02 |\n| src/proxy/UUPSProxiable.sol | 80d46ace20ea4c9c6a0cbc1093d6e88eb19aeb12 |\n| src/proxy/UUPSProxy.sol | 18a2a570a8ef2ec5f02d59bd1c03a176203e8ccf |\n| src/proxy/Initializable.sol | bf3ba9453bab903eda4247e90e39376e20744353 |\n\n\n Contracts Description Table\n\n\n|  Contract  |         Type        |       Bases      |                  |                 |\n|:----------:|:-------------------:|:----------------:|:----------------:|:---------------:|\n|     └      |  **Function Name**  |  **Visibility**  |  **Mutability**  |  **Modifiers**  |\n||||||\n| **KlerosCore** | Implementation | IArbitratorV2, Initializable, UUPSProxiable |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | initializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByOwner |\n| └ | pause | External ❗️ | 🛑  | onlyByGuardianOrOwner whenNotPaused |\n| └ | unpause | External ❗️ | 🛑  | onlyByOwner whenPaused |\n| └ | executeOwnerProposal | External ❗️ | 🛑  | onlyByOwner |\n| └ | changeOwner | External ❗️ | 🛑  | onlyByOwner |\n| └ | changeGuardian | External ❗️ | 🛑  | onlyByOwner |\n| └ | changePinakion | External ❗️ | 🛑  | onlyByOwner |\n| └ | changeJurorProsecutionModule | External ❗️ | 🛑  | onlyByOwner |\n| └ | changeSortitionModule | External ❗️ | 🛑  | onlyByOwner |\n| └ | addNewDisputeKit | External ❗️ | 🛑  | onlyByOwner |\n| └ | createCourt | External ❗️ | 🛑  | onlyByOwner |\n| └ | changeCourtParameters | External ❗️ | 🛑  | onlyByOwner |\n| └ | enableDisputeKits | External ❗️ | 🛑  | onlyByOwner |\n| └ | changeAcceptedFeeTokens | External ❗️ | 🛑  | onlyByOwner |\n| └ | changeCurrencyRates | External ❗️ | 🛑  | onlyByOwner |\n| └ | changeJurorNft | External ❗️ | 🛑  | onlyByOwner |\n| └ | changeArbitrableWhitelist | External ❗️ | 🛑  | onlyByOwner |\n| └ | changeArbitrableWhitelistEnabled | External ❗️ | 🛑  | onlyByOwner |\n| └ | setStake | External ❗️ | 🛑  | whenNotPaused |\n| └ | setStakeBySortitionModule | External ❗️ | 🛑  |NO❗️ |\n| └ | transferBySortitionModule | External ❗️ | 🛑  |NO❗️ |\n| └ | createDispute | External ❗️ |  💵 |NO❗️ |\n| └ | createDispute | External ❗️ | 🛑  |NO❗️ |\n| └ | _createDispute | Internal 🔒 | 🛑  | |\n| └ | passPeriod | External ❗️ | 🛑  |NO❗️ |\n| └ | draw | External ❗️ | 🛑  |NO❗️ |\n| └ | appeal | External ❗️ |  💵 |NO❗️ |\n| └ | execute | External ❗️ | 🛑  | whenNotPaused |\n| └ | _executePenalties | Internal 🔒 | 🛑  | |\n| └ | _executeRewards | Internal 🔒 | 🛑  | |\n| └ | executeRuling | External ❗️ | 🛑  |NO❗️ |\n| └ | arbitrationCost | Public ❗️ |   |NO❗️ |\n| └ | arbitrationCost | Public ❗️ |   |NO❗️ |\n| └ | appealCost | Public ❗️ |   |NO❗️ |\n| └ | appealPeriod | External ❗️ |   |NO❗️ |\n| └ | currentRuling | Public ❗️ |   |NO❗️ |\n| └ | getRoundInfo | External ❗️ |   |NO❗️ |\n| └ | getPnkAtStakePerJuror | External ❗️ |   |NO❗️ |\n| └ | getNumberOfRounds | External ❗️ |   |NO❗️ |\n| └ | isSupported | External ❗️ |   |NO❗️ |\n| └ | getTimesPerPeriod | External ❗️ |   |NO❗️ |\n| └ | getNumberOfVotes | External ❗️ |   |NO❗️ |\n| └ | isDisputeKitJumping | External ❗️ |   |NO❗️ |\n| └ | getDisputeKitsLength | External ❗️ |   |NO❗️ |\n| └ | convertEthToTokenAmount | Public ❗️ |   |NO❗️ |\n| └ | _isCourtJumping | Internal 🔒 |   | |\n| └ | _getCourtAndDisputeKitJumps | Internal 🔒 |   | |\n| └ | _transferFeeToken | Internal 🔒 | 🛑  | |\n| └ | _applyCoherence | Internal 🔒 |   | |\n| └ | _calculatePnkAtStake | Internal 🔒 |   | |\n| └ | _enableDisputeKit | Internal 🔒 | 🛑  | |\n| └ | _setStake | Internal 🔒 | 🛑  | |\n| └ | _stakingFailed | Internal 🔒 |   | |\n| └ | _extraDataToCourtIDMinJurorsDisputeKit | Internal 🔒 |   | |\n||||||\n| **PolicyRegistry** | Implementation | UUPSProxiable, Initializable |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | initializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByOwner |\n| └ | changeOwner | External ❗️ | 🛑  | onlyByOwner |\n| └ | setPolicy | External ❗️ | 🛑  | onlyByOwner |\n||||||\n| **SortitionModule** | Implementation | ISortitionModule, Initializable, UUPSProxiable |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | initializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByOwner |\n| └ | changeOwner | External ❗️ | 🛑  | onlyByOwner |\n| └ | changeMinStakingTime | External ❗️ | 🛑  | onlyByOwner |\n| └ | changeMaxDrawingTime | External ❗️ | 🛑  | onlyByOwner |\n| └ | changeRandomNumberGenerator | External ❗️ | 🛑  | onlyByOwner |\n| └ | changeMaxStakePerJuror | External ❗️ | 🛑  | onlyByOwner |\n| └ | changeMaxTotalStaked | External ❗️ | 🛑  | onlyByOwner |\n| └ | passPhase | External ❗️ | 🛑  |NO❗️ |\n| └ | createTree | External ❗️ | 🛑  | onlyByCore |\n| └ | executeDelayedStakes | External ❗️ | 🛑  |NO❗️ |\n| └ | createDisputeHook | External ❗️ | 🛑  | onlyByCore |\n| └ | postDrawHook | External ❗️ | 🛑  | onlyByCore |\n| └ | notifyRandomNumber | Public ❗️ | 🛑  |NO❗️ |\n| └ | validateStake | External ❗️ | 🛑  | onlyByCore |\n| └ | _validateStake | Internal 🔒 | 🛑  | |\n| └ | setStake | External ❗️ | 🛑  | onlyByCore |\n| └ | setStakePenalty | External ❗️ | 🛑  | onlyByCore |\n| └ | setStakeReward | External ❗️ | 🛑  | onlyByCore |\n| └ | _setStake | Internal 🔒 | 🛑  | |\n| └ | lockStake | External ❗️ | 🛑  | onlyByCore |\n| └ | unlockStake | External ❗️ | 🛑  | onlyByCore |\n| └ | forcedUnstakeAllCourts | External ❗️ | 🛑  | onlyByCore |\n| └ | forcedUnstake | External ❗️ | 🛑  | onlyByCore |\n| └ | withdrawLeftoverPNK | External ❗️ | 🛑  |NO❗️ |\n| └ | draw | Public ❗️ |   |NO❗️ |\n| └ | stakeOf | Public ❗️ |   |NO❗️ |\n| └ | getJurorBalance | External ❗️ |   |NO❗️ |\n| └ | getJurorCourtIDs | Public ❗️ |   |NO❗️ |\n| └ | isJurorStaked | External ❗️ |   |NO❗️ |\n| └ | getJurorLeftoverPNK | Public ❗️ |   |NO❗️ |\n| └ | _extraDataToTreeK | Internal 🔒 |   | |\n||||||\n| **DisputeResolver** | Implementation | IArbitrableV2 |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | changeOwner | External ❗️ | 🛑  |NO❗️ |\n| └ | changeArbitrator | External ❗️ | 🛑  |NO❗️ |\n| └ | changeTemplateRegistry | External ❗️ | 🛑  |NO❗️ |\n| └ | createDisputeForTemplate | External ❗️ |  💵 |NO❗️ |\n| └ | createDisputeForTemplateUri | External ❗️ |  💵 |NO❗️ |\n| └ | rule | External ❗️ | 🛑  |NO❗️ |\n| └ | _createDispute | Internal 🔒 | 🛑  | |\n||||||\n| **DisputeTemplateRegistry** | Implementation | IDisputeTemplateRegistry, UUPSProxiable, Initializable |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | initializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByOwner |\n| └ | changeOwner | External ❗️ | 🛑  | onlyByOwner |\n| └ | setDisputeTemplate | External ❗️ | 🛑  |NO❗️ |\n||||||\n| **DisputeKitClassic** | Implementation | DisputeKitClassicBase |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | initializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByOwner |\n||||||\n| **DisputeKitClassicBase** | Implementation | IDisputeKit, Initializable, UUPSProxiable |||\n| └ | __DisputeKitClassicBase_initialize | Internal 🔒 | 🛑  | onlyInitializing |\n| └ | executeOwnerProposal | External ❗️ | 🛑  | onlyByOwner |\n| └ | changeOwner | External ❗️ | 🛑  | onlyByOwner |\n| └ | changeCore | External ❗️ | 🛑  | onlyByOwner |\n| └ | changeJumpDisputeKitID | External ❗️ | 🛑  | onlyByOwner |\n| └ | createDispute | External ❗️ | 🛑  | onlyByCore |\n| └ | draw | External ❗️ | 🛑  | onlyByCore notJumped |\n| └ | castCommit | External ❗️ | 🛑  |NO❗️ |\n| └ | _castCommit | Internal 🔒 | 🛑  | notJumped |\n| └ | castVote | External ❗️ | 🛑  |NO❗️ |\n| └ | _castVote | Internal 🔒 | 🛑  | notJumped |\n| └ | fundAppeal | External ❗️ |  💵 | notJumped |\n| └ | withdrawFeesAndRewards | External ❗️ | 🛑  |NO❗️ |\n| └ | hashVote | Public ❗️ |   |NO❗️ |\n| └ | getFundedChoices | Public ❗️ |   |NO❗️ |\n| └ | currentRuling | External ❗️ |   |NO❗️ |\n| └ | getDegreeOfCoherenceReward | External ❗️ |   |NO❗️ |\n| └ | getDegreeOfCoherencePenalty | External ❗️ |   |NO❗️ |\n| └ | _getDegreeOfCoherence | Internal 🔒 |   | |\n| └ | getCoherentCount | External ❗️ |   |NO❗️ |\n| └ | areCommitsAllCast | External ❗️ |   |NO❗️ |\n| └ | areVotesAllCast | External ❗️ |   |NO❗️ |\n| └ | isAppealFunded | External ❗️ |   |NO❗️ |\n| └ | earlyCourtJump | External ❗️ |   |NO❗️ |\n| └ | getNbVotesAfterAppeal | External ❗️ |   |NO❗️ |\n| └ | getJumpDisputeKitID | External ❗️ |   |NO❗️ |\n| └ | isVoteActive | External ❗️ |   |NO❗️ |\n| └ | getRoundInfo | External ❗️ |   |NO❗️ |\n| └ | getNumberOfRounds | External ❗️ |   |NO❗️ |\n| └ | getLocalDisputeRoundID | External ❗️ |   |NO❗️ |\n| └ | getVoteInfo | External ❗️ |   |NO❗️ |\n| └ | _getExpectedVoteHash | Internal 🔒 |   | |\n| └ | _postDrawCheck | Internal 🔒 |   | |\n||||||\n| **IBalanceHolder** | Interface |  |||\n| └ | balanceOf | External ❗️ |   |NO❗️ |\n||||||\n| **IBalanceHolderERC1155** | Interface |  |||\n| └ | balanceOf | External ❗️ |   |NO❗️ |\n||||||\n| **DisputeKitGated** | Implementation | DisputeKitClassicBase |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | initializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByOwner |\n| └ | extraDataToTokenInfo | Public ❗️ |   |NO❗️ |\n| └ | _postDrawCheck | Internal 🔒 |   | |\n||||||\n| **IBalanceHolder** | Interface |  |||\n| └ | balanceOf | External ❗️ |   |NO❗️ |\n||||||\n| **IBalanceHolderERC1155** | Interface |  |||\n| └ | balanceOf | External ❗️ |   |NO❗️ |\n||||||\n| **DisputeKitGatedShutter** | Implementation | DisputeKitClassicBase |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | initializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByOwner |\n| └ | castCommitShutter | External ❗️ | 🛑  | notJumped |\n| └ | castVoteShutter | External ❗️ | 🛑  |NO❗️ |\n| └ | hashVote | Public ❗️ |   |NO❗️ |\n| └ | _getExpectedVoteHash | Internal 🔒 |   | |\n| └ | _extraDataToTokenInfo | Internal 🔒 |   | |\n| └ | _postDrawCheck | Internal 🔒 |   | |\n||||||\n| **DisputeKitShutter** | Implementation | DisputeKitClassicBase |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | initializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByOwner |\n| └ | castCommitShutter | External ❗️ | 🛑  | notJumped |\n| └ | castVoteShutter | External ❗️ | 🛑  |NO❗️ |\n| └ | hashVote | Public ❗️ |   |NO❗️ |\n| └ | _getExpectedVoteHash | Internal 🔒 |   | |\n||||||\n| **IProofOfHumanity** | Interface |  |||\n| └ | isRegistered | External ❗️ |   |NO❗️ |\n||||||\n| **DisputeKitSybilResistant** | Implementation | DisputeKitClassicBase |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | initializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByOwner |\n| └ | _postDrawCheck | Internal 🔒 |   | |\n||||||\n| **EvidenceModule** | Implementation | IEvidence, Initializable, UUPSProxiable |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | initialize | External ❗️ | 🛑  | initializer |\n| └ | _authorizeUpgrade | Internal 🔒 |   | onlyByOwner |\n| └ | submitEvidence | External ❗️ | 🛑  |NO❗️ |\n||||||\n| **IArbitrableV2** | Interface |  |||\n| └ | rule | External ❗️ | 🛑  |NO❗️ |\n||||||\n| **IArbitratorV2** | Interface |  |||\n| └ | createDispute | External ❗️ |  💵 |NO❗️ |\n| └ | createDispute | External ❗️ | 🛑  |NO❗️ |\n| └ | arbitrationCost | External ❗️ |   |NO❗️ |\n| └ | arbitrationCost | External ❗️ |   |NO❗️ |\n| └ | currentRuling | External ❗️ |   |NO❗️ |\n||||||\n| **IDisputeKit** | Interface |  |||\n| └ | createDispute | External ❗️ | 🛑  |NO❗️ |\n| └ | draw | External ❗️ | 🛑  |NO❗️ |\n| └ | currentRuling | External ❗️ |   |NO❗️ |\n| └ | getDegreeOfCoherenceReward | External ❗️ |   |NO❗️ |\n| └ | getDegreeOfCoherencePenalty | External ❗️ |   |NO❗️ |\n| └ | getCoherentCount | External ❗️ |   |NO❗️ |\n| └ | areCommitsAllCast | External ❗️ |   |NO❗️ |\n| └ | areVotesAllCast | External ❗️ |   |NO❗️ |\n| └ | isAppealFunded | External ❗️ |   |NO❗️ |\n| └ | earlyCourtJump | External ❗️ |   |NO❗️ |\n| └ | getNbVotesAfterAppeal | External ❗️ |   |NO❗️ |\n| └ | getJumpDisputeKitID | External ❗️ |   |NO❗️ |\n| └ | isVoteActive | External ❗️ |   |NO❗️ |\n| └ | getRoundInfo | External ❗️ |   |NO❗️ |\n| └ | getVoteInfo | External ❗️ |   |NO❗️ |\n||||||\n| **IDisputeTemplateRegistry** | Interface |  |||\n| └ | setDisputeTemplate | External ❗️ | 🛑  |NO❗️ |\n||||||\n| **IEvidence** | Interface |  |||\n||||||\n| **ISortitionModule** | Interface |  |||\n| └ | createTree | External ❗️ | 🛑  |NO❗️ |\n| └ | validateStake | External ❗️ | 🛑  |NO❗️ |\n| └ | setStake | External ❗️ | 🛑  |NO❗️ |\n| └ | setStakePenalty | External ❗️ | 🛑  |NO❗️ |\n| └ | setStakeReward | External ❗️ | 🛑  |NO❗️ |\n| └ | forcedUnstakeAllCourts | External ❗️ | 🛑  |NO❗️ |\n| └ | forcedUnstake | External ❗️ | 🛑  |NO❗️ |\n| └ | lockStake | External ❗️ | 🛑  |NO❗️ |\n| └ | unlockStake | External ❗️ | 🛑  |NO❗️ |\n| └ | notifyRandomNumber | External ❗️ | 🛑  |NO❗️ |\n| └ | draw | External ❗️ |   |NO❗️ |\n| └ | getJurorBalance | External ❗️ |   |NO❗️ |\n| └ | getJurorCourtIDs | External ❗️ |   |NO❗️ |\n| └ | isJurorStaked | External ❗️ |   |NO❗️ |\n| └ | getJurorLeftoverPNK | External ❗️ |   |NO❗️ |\n| └ | createDisputeHook | External ❗️ | 🛑  |NO❗️ |\n| └ | postDrawHook | External ❗️ | 🛑  |NO❗️ |\n| └ | withdrawLeftoverPNK | External ❗️ | 🛑  |NO❗️ |\n||||||\n| **SafeERC20** | Library |  |||\n| └ | increaseAllowance | Internal 🔒 | 🛑  | |\n| └ | safeTransfer | Internal 🔒 | 🛑  | |\n| └ | safeTransferFrom | Internal 🔒 | 🛑  | |\n||||||\n| **WethLike** | Interface |  |||\n| └ | deposit | External ❗️ |  💵 |NO❗️ |\n| └ | transfer | External ❗️ | 🛑  |NO❗️ |\n||||||\n| **SafeSend** | Library |  |||\n| └ | safeSend | Internal 🔒 | 🛑  | |\n||||||\n| **RNGWithFallback** | Implementation | IRNG |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | changeOwner | External ❗️ | 🛑  | onlyByOwner |\n| └ | changeConsumer | External ❗️ | 🛑  | onlyByOwner |\n| └ | changeFallbackTimeout | External ❗️ | 🛑  | onlyByOwner |\n| └ | requestRandomness | External ❗️ | 🛑  | onlyByConsumer |\n| └ | receiveRandomness | External ❗️ | 🛑  | onlyByConsumer |\n||||||\n| **ChainlinkRNG** | Implementation | IRNG, VRFConsumerBaseV2Plus |||\n| └ | <Constructor> | Public ❗️ | 🛑  | VRFConsumerBaseV2Plus |\n| └ | changeOwner | External ❗️ | 🛑  | onlyByOwner |\n| └ | changeConsumer | External ❗️ | 🛑  | onlyByOwner |\n| └ | changeVrfCoordinator | External ❗️ | 🛑  | onlyByOwner |\n| └ | changeKeyHash | External ❗️ | 🛑  | onlyByOwner |\n| └ | changeSubscriptionId | External ❗️ | 🛑  | onlyByOwner |\n| └ | changeRequestConfirmations | External ❗️ | 🛑  | onlyByOwner |\n| └ | changeCallbackGasLimit | External ❗️ | 🛑  | onlyByOwner |\n| └ | requestRandomness | External ❗️ | 🛑  | onlyByConsumer |\n| └ | fulfillRandomWords | Internal 🔒 | 🛑  | |\n| └ | receiveRandomness | External ❗️ |   |NO❗️ |\n||||||\n| **IRNG** | Interface |  |||\n| └ | requestRandomness | External ❗️ | 🛑  |NO❗️ |\n| └ | receiveRandomness | External ❗️ | 🛑  |NO❗️ |\n||||||\n| **UUPSProxiable** | Implementation |  |||\n| └ | _authorizeUpgrade | Internal 🔒 | 🛑  | |\n| └ | upgradeToAndCall | Public ❗️ |  💵 |NO❗️ |\n| └ | proxiableUUID | External ❗️ |   |NO❗️ |\n| └ | version | External ❗️ |   |NO❗️ |\n| └ | _getImplementation | Internal 🔒 |   | |\n||||||\n| **UUPSProxy** | Implementation |  |||\n| └ | <Constructor> | Public ❗️ | 🛑  |NO❗️ |\n| └ | _delegate | Internal 🔒 | 🛑  | |\n| └ | _getImplementation | Internal 🔒 |   | |\n| └ | <Fallback> | External ❗️ |  💵 |NO❗️ |\n| └ | <Receive Ether> | External ❗️ |  💵 |NO❗️ |\n||||||\n| **Initializable** | Implementation |  |||\n| └ | _checkInitializing | Internal 🔒 |   | |\n| └ | _disableInitializers | Internal 🔒 | 🛑  | |\n| └ | _getInitializedVersion | Internal 🔒 |   | |\n| └ | _isInitializing | Internal 🔒 |   | |\n| └ | _getInitializableStorage | Private 🔐 |   | |\n\n\n Legend\n\n|  Symbol  |  Meaning  |\n|:--------:|-----------|\n|    🛑    | Function can modify state |\n|    💵    | Function is payable |\n \n\n</div>\n____\n<sub>\nThinking about smart contract security? We can provide training, ongoing advice, and smart contract auditing. [Contact us](https://consensys.io/diligence/contact/).\n</sub>\n\n',
         jsonData: {
           totals: {
             ast: {
-              SourceUnit: 31,
-              PragmaDirective: 31,
-              "Pragma:solidity:^0.8.24": 24,
-              ImportDirective: 51,
-              StringLiteral: 130,
-              Identifier: 3787,
-              ContractDefinition: 36,
-              "ContractDefinition:Contract": 16,
-              "ContractDefinition:BaseContracts": 30,
+              SourceUnit: 27,
+              PragmaDirective: 27,
+              "Pragma:solidity:^0.8.24": 19,
+              ImportDirective: 49,
+              StringLiteral: 74,
+              Identifier: 3775,
+              "ImportDirective:Path:@openzeppelin/contracts/token/ERC721/IERC721.sol": 1,
+              ContractDefinition: 32,
+              "ContractDefinition:Contract": 14,
+              "ContractDefinition:BaseContracts": 26,
               "ContractDefinition:LogicContractNames": [
                 "KlerosCore",
-                "KlerosCoreNeo",
                 "PolicyRegistry",
                 "SortitionModule",
-                "SortitionModuleNeo",
                 "DisputeResolver",
                 "DisputeTemplateRegistry",
                 "DisputeKitClassic",
@@ -208825,11 +208824,9 @@
                 "UUPSProxy",
               ],
               "ContractDefinition:BaseContractNames": [
-                "KlerosCoreBase",
                 "IArbitratorV2",
                 "Initializable",
                 "UUPSProxiable",
-                "SortitionModuleBase",
                 "ISortitionModule",
                 "IArbitrableV2",
                 "IDisputeTemplateRegistry",
@@ -208839,76 +208836,75 @@
                 "IRNG",
                 "VRFConsumerBaseV2Plus",
               ],
-              InheritanceSpecifier: 30,
-              UserDefinedTypeName: 232,
-              "UserDefinedTypeName:KlerosCoreBase": 2,
-              StateVariableDeclaration: 87,
-              VariableDeclaration: 1206,
-              "StateVariableDeclaration:Public": 80,
-              "StateVariableDeclaration:Const": 21,
-              ElementaryTypeName: 1074,
-              FunctionDefinition: 265,
-              "FunctionDefinition:Internal": 217,
-              "FunctionDefinition:Default": 16,
-              Block: 403,
-              ExpressionStatement: 457,
-              FunctionCall: 476,
-              "FunctionCall:Type:Regular": 134,
-              "FunctionCall:Name:_disableInitializers": 12,
-              "FunctionDefinition:External": 175,
-              "UserDefinedTypeName:IERC20": 26,
-              "UserDefinedTypeName:IDisputeKit": 13,
-              "VariableDeclaration:Memory": 60,
-              ArrayTypeName: 50,
-              NumberLiteral: 253,
-              "UserDefinedTypeName:ISortitionModule": 7,
-              "FunctionCall:Name:__KlerosCoreBase_initialize": 2,
-              ModifierInvocation: 103,
-              BinaryOperation: 660,
-              "FunctionDefinition:View": 80,
-              "ContractDefinition:Abstract": 5,
+              InheritanceSpecifier: 26,
+              UserDefinedTypeName: 225,
               "UserDefinedTypeName:IArbitratorV2": 6,
               "UserDefinedTypeName:Initializable": 6,
               "UserDefinedTypeName:UUPSProxiable": 6,
-              UsingForDeclaration: 3,
+              UsingForDeclaration: 5,
+              "UserDefinedTypeName:IERC20": 23,
+              ElementaryTypeName: 1097,
+              StateVariableDeclaration: 88,
+              VariableDeclaration: 1227,
+              "StateVariableDeclaration:Public": 82,
+              "StateVariableDeclaration:Const": 17,
               EnumDefinition: 4,
               EnumValue: 20,
-              StructDefinition: 13,
-              Mapping: 24,
+              StructDefinition: 12,
+              ArrayTypeName: 45,
+              NumberLiteral: 213,
+              Mapping: 29,
               "UserDefinedTypeName:IArbitrableV2": 6,
               "UserDefinedTypeName:Period": 2,
-              "UserDefinedTypeName:Round": 31,
-              "StateVariableDeclaration:Private": 6,
-              TupleExpression: 54,
-              "UserDefinedTypeName:Court": 9,
-              "UserDefinedTypeName:Dispute": 35,
+              "UserDefinedTypeName:Round": 33,
+              "StateVariableDeclaration:Private": 5,
+              BinaryOperation: 639,
+              TupleExpression: 51,
+              "UserDefinedTypeName:ISortitionModule": 5,
+              "UserDefinedTypeName:Court": 11,
+              "UserDefinedTypeName:IDisputeKit": 13,
+              "UserDefinedTypeName:Dispute": 38,
               "UserDefinedTypeName:CurrencyRate": 1,
+              "UserDefinedTypeName:IERC721": 3,
               EventDefinition: 43,
               "VariableDeclaration:Indexed": 72,
               ModifierDefinition: 19,
-              IfStatement: 164,
-              MemberAccess: 844,
-              RevertStatement: 53,
-              UnaryOperation: 54,
+              Block: 386,
+              IfStatement: 215,
+              MemberAccess: 823,
+              RevertStatement: 103,
+              FunctionCall: 478,
+              ExpressionStatement: 389,
+              UnaryOperation: 56,
+              FunctionDefinition: 257,
+              "FunctionDefinition:Internal": 197,
+              "FunctionDefinition:Default": 14,
+              "FunctionCall:Type:Regular": 132,
+              "FunctionCall:Name:_disableInitializers": 10,
+              "FunctionDefinition:External": 175,
+              "VariableDeclaration:Memory": 53,
               EmitStatement: 52,
-              "FunctionCall:Type:MemberAccess": 97,
-              "FunctionCall:Name:createTree": 3,
-              VariableDeclarationStatement: 217,
-              "VariableDeclaration:Storage": 91,
+              "FunctionCall:Type:MemberAccess": 113,
+              "FunctionCall:Name:createTree": 4,
+              VariableDeclarationStatement: 215,
+              "VariableDeclaration:Storage": 92,
               NewExpression: 3,
-              IndexAccess: 295,
+              IndexAccess: 297,
               "FunctionCall:Name:_enableDisputeKit": 4,
-              BooleanLiteral: 51,
+              BooleanLiteral: 61,
+              ModifierInvocation: 88,
+              "FunctionDefinition:View": 92,
               NameValueExpression: 5,
               NameValueList: 5,
-              ForStatement: 10,
-              "FunctionCall:Name:_setStake": 4,
+              ForStatement: 11,
               "FunctionCall:Name:address": 28,
+              "FunctionCall:Name:balanceOf": 5,
+              "FunctionCall:Name:_setStake": 5,
               "FunctionCall:Name:safeTransfer": 6,
               "FunctionDefinition:Payable": 10,
               "FunctionCall:Name:arbitrationCost": 3,
-              ReturnStatement: 77,
-              "FunctionCall:Name:_createDispute": 5,
+              ReturnStatement: 90,
+              "FunctionCall:Name:_createDispute": 4,
               "VariableDeclaration:Calldata": 27,
               "FunctionCall:Name:safeTransferFrom": 2,
               "FunctionCall:Name:_extraDataToCourtIDMinJurorsDisputeKit": 2,
@@ -208917,87 +208913,81 @@
               "FunctionCall:Name:_calculatePnkAtStake": 2,
               "FunctionCall:Name:createDisputeHook": 2,
               "FunctionCall:Name:createDispute": 2,
-              "FunctionCall:Name:areCommitsAllCast": 1,
               "FunctionCall:Name:areVotesAllCast": 1,
               "FunctionCall:Name:isAppealFunded": 1,
-              WhileStatement: 4,
-              "FunctionCall:Name:draw": 2,
+              WhileStatement: 2,
+              "FunctionCall:Name:draw": 3,
               ContinueStatement: 1,
               "FunctionCall:Name:lockStake": 1,
               "FunctionCall:Name:postDrawHook": 1,
               "FunctionCall:Name:appealCost": 2,
+              "FunctionCall:Name:_getCourtAndDisputeKitJumps": 2,
               "FunctionCall:Name:getCoherentCount": 1,
               "FunctionCall:Name:_executePenalties": 1,
               "FunctionCall:Name:_executeRewards": 1,
               "UserDefinedTypeName:ExecuteParams": 2,
-              "FunctionCall:Name:getDegreeOfCoherence": 2,
+              "FunctionCall:Name:getDegreeOfCoherencePenalty": 1,
               "FunctionCall:Name:unlockStake": 2,
-              "FunctionCall:Name:penalizeStake": 1,
+              "FunctionCall:Name:setStakePenalty": 1,
               "FunctionCall:Name:isVoteActive": 1,
-              "FunctionCall:Name:setJurorInactive": 1,
+              "FunctionCall:Name:forcedUnstakeAllCourts": 1,
+              "FunctionCall:Name:forcedUnstake": 1,
               "FunctionCall:Name:_transferFeeToken": 3,
               "FunctionCall:Name:payable": 4,
+              "FunctionCall:Name:getDegreeOfCoherenceReward": 1,
               "FunctionCall:Name:_applyCoherence": 3,
+              "FunctionCall:Name:setStakeReward": 1,
               "FunctionCall:Name:currentRuling": 6,
               "FunctionCall:Name:rule": 1,
-              "FunctionDefinition:Public": 17,
+              "FunctionDefinition:Public": 16,
+              "FunctionCall:Name:getNbVotesAfterAppeal": 1,
+              "FunctionCall:Name:_isCourtJumping": 2,
+              "FunctionCall:Name:earlyCourtJump": 1,
+              "FunctionCall:Name:getJumpDisputeKitID": 1,
               "FunctionCall:Name:safeSend": 3,
-              "FunctionDefinition:Pure": 13,
-              "UserDefinedTypeName:OnError": 3,
-              "FunctionCall:Name:_stakingFailed": 6,
-              "UserDefinedTypeName:StakingResult": 7,
+              "FunctionDefinition:Pure": 9,
+              "UserDefinedTypeName:OnError": 2,
+              "FunctionCall:Name:_stakingFailed": 5,
+              "UserDefinedTypeName:StakingResult": 5,
               "FunctionCall:Name:validateStake": 1,
               "FunctionCall:Name:setStake": 1,
-              InlineAssemblyStatement: 12,
-              AssemblyBlock: 23,
-              AssemblyAssignment: 18,
-              AssemblyCall: 99,
-              "AssemblyCall:Name:mload": 12,
-              "AssemblyCall:Name:add": 16,
-              HexNumber: 23,
-              CustomErrorDefinition: 45,
-              "ImportDirective:Path:@openzeppelin/contracts/token/ERC721/IERC721.sol": 1,
-              "UserDefinedTypeName:IERC721": 3,
-              "FunctionCall:Name:balanceOf": 5,
-              "FunctionCall:Type:BuiltIn": 57,
-              "FunctionCall:Name:require": 51,
-              "UserDefinedTypeName:SortitionModuleBase": 2,
-              "UserDefinedTypeName:KlerosCore": 11,
-              "UserDefinedTypeName:IRNG": 9,
-              "FunctionCall:Name:__SortitionModuleBase_initialize": 2,
+              InlineAssemblyStatement: 10,
+              AssemblyBlock: 12,
+              AssemblyAssignment: 13,
+              AssemblyCall: 58,
+              "AssemblyCall:Name:mload": 8,
+              "AssemblyCall:Name:add": 8,
+              HexNumber: 10,
+              CustomErrorDefinition: 86,
+              "UserDefinedTypeName:SortitionTrees.Tree": 3,
+              "UserDefinedTypeName:TreeKey": 6,
+              "UserDefinedTypeName:KlerosCore": 9,
               "UserDefinedTypeName:Phase": 2,
+              "UserDefinedTypeName:IRNG": 7,
               "StateVariableDeclaration:Default": 1,
-              "UserDefinedTypeName:SortitionSumTree": 6,
-              "UserDefinedTypeName:Juror": 8,
+              "UserDefinedTypeName:Juror": 7,
               "UserDefinedTypeName:DelayedStake": 3,
               "FunctionCall:Name:requestRandomness": 3,
               "FunctionCall:Name:receiveRandomness": 2,
+              "FunctionCall:Name:toTreeKey": 4,
+              "FunctionCall:Name:wrap": 4,
               "FunctionCall:Name:_extraDataToTreeK": 1,
-              "FunctionCall:Name:setStakeBySortitionModule": 2,
-              "FunctionCall:Name:_validateStake": 2,
-              "FunctionCall:Name:stakeOf": 5,
-              BreakStatement: 2,
-              "FunctionCall:Name:_accountAndCourtIDToStakePathID": 2,
-              "FunctionCall:Name:_set": 1,
+              "FunctionCall:Name:setStakeBySortitionModule": 3,
+              "FunctionCall:Name:_validateStake": 1,
+              "FunctionCall:Name:stakeOf": 8,
+              BreakStatement: 1,
+              "FunctionCall:Name:toStakePathID": 2,
+              "FunctionCall:Name:set": 1,
               "FunctionCall:Name:courts": 3,
               "FunctionCall:Name:getJurorLeftoverPNK": 2,
               "FunctionCall:Name:getJurorCourtIDs": 1,
               "FunctionCall:Name:transferBySortitionModule": 1,
-              "FunctionCall:Name:keccak256": 6,
-              "FunctionCall:Name:encodePacked": 2,
-              "FunctionCall:Name:_stakePathIDToAccount": 1,
-              "FunctionDefinition:Private": 2,
-              AssemblyLocalDefinition: 8,
-              AssemblyFor: 3,
-              "AssemblyCall:Name:lt": 3,
-              "AssemblyCall:Name:mstore8": 3,
-              "AssemblyCall:Name:byte": 3,
-              "FunctionCall:Name:_updateParents": 3,
               "UserDefinedTypeName:IDisputeTemplateRegistry": 4,
               "UserDefinedTypeName:DisputeStruct": 2,
               "FunctionCall:Name:setDisputeTemplate": 1,
               "UserDefinedTypeName:DisputeKitClassicBase": 5,
               "FunctionCall:Name:__DisputeKitClassicBase_initialize": 5,
+              "ContractDefinition:Abstract": 3,
               "UserDefinedTypeName:Vote": 4,
               "FunctionCall:Name:getNumberOfRounds": 2,
               "FunctionCall:Name:sortitionModule": 1,
@@ -209007,12 +208997,18 @@
               "UserDefinedTypeName:KlerosCore.Period": 3,
               "FunctionCall:Name:_castVote": 3,
               "FunctionCall:Name:hashVote": 1,
+              "FunctionCall:Name:_getExpectedVoteHash": 1,
               "FunctionCall:Name:appealPeriod": 2,
               "FunctionCall:Name:isDisputeKitJumping": 1,
               "FunctionCall:Name:getNumberOfVotes": 1,
               "FunctionCall:Name:paused": 1,
+              "FunctionCall:Type:BuiltIn": 8,
+              "FunctionCall:Name:keccak256": 7,
+              "FunctionCall:Name:encodePacked": 3,
               "FunctionCall:Name:getFundedChoices": 2,
+              "FunctionCall:Name:_getDegreeOfCoherence": 2,
               "ContractDefinition:Interface": 13,
+              AssemblyLocalDefinition: 3,
               "AssemblyCall:Name:and": 4,
               "AssemblyCall:Name:shr": 2,
               DecimalNumber: 14,
@@ -209020,12 +209016,13 @@
               "FunctionCall:Type:ContractTypecast": 6,
               "FunctionCall:Name:encode": 2,
               "FunctionCall:Name:_extraDataToTokenInfo": 1,
+              "Pragma:solidity:^0.8.28": 1,
               "UserDefinedTypeName:IProofOfHumanity": 2,
               "FunctionCall:Name:isRegistered": 1,
               "UserDefinedTypeName:IEvidence": 1,
               "Pragma:solidity:>=0.8.0_<0.9.0": 7,
               "ImportDirective:Path:@openzeppelin/contracts/token/ERC20/IERC20.sol": 3,
-              FileLevelConstant: 8,
+              FileLevelConstant: 9,
               "ContractDefinition:Library": 2,
               "FunctionCall:Name:approve": 1,
               "FunctionCall:Name:allowance": 1,
@@ -209035,7 +209032,6 @@
               "FunctionCall:Name:send": 1,
               "FunctionCall:Name:transfer": 1,
               "FunctionCall:Name:blockhash": 1,
-              "ImportDirective:Path:@chainlink/contracts/src/v0.8/vrf/dev/VRFConsumerBaseV2Plus.sol": 1,
               "ImportDirective:Path:@chainlink/contracts/src/v0.8/vrf/dev/libraries/VRFV2PlusClient.sol": 1,
               "UserDefinedTypeName:VRFConsumerBaseV2Plus": 1,
               "FunctionCall:Name:requestRandomWords": 1,
@@ -209050,6 +209046,7 @@
               "FunctionCall:Name:delegatecall": 2,
               CatchClause: 1,
               "AssemblyCall:Name:sload": 2,
+              "FunctionCall:Name:require": 1,
               "AssemblyCall:Name:calldatacopy": 1,
               "AssemblyCall:Name:calldatasize": 2,
               "AssemblyCall:Name:delegatecall": 1,
@@ -209066,59 +209063,60 @@
               "FunctionCall:Name:_checkInitializing": 1,
               "FunctionCall:Name:_isInitializing": 1,
               "FunctionCall:Name:type": 3,
+              "FunctionDefinition:Private": 1,
               AssemblyMemberAccess: 1,
             },
             sloc: {
-              total: 5124,
-              source: 2839,
-              comment: 1784,
-              single: 1622,
-              block: 162,
-              mixed: 175,
-              empty: 676,
-              todo: 2,
+              total: 5103,
+              source: 2808,
+              comment: 1802,
+              single: 1635,
+              block: 167,
+              mixed: 184,
+              empty: 677,
+              todo: 3,
               blockEmpty: 0,
-              commentToSourceRatio: 0.6283902782669955,
+              commentToSourceRatio: 0.6417378917378918,
             },
             nsloc: {
-              total: 4587,
-              source: 2437,
-              comment: 1687,
-              single: 1529,
-              block: 158,
-              mixed: 171,
-              empty: 634,
+              total: 4501,
+              source: 2365,
+              comment: 1681,
+              single: 1524,
+              block: 157,
+              mixed: 173,
+              empty: 628,
               todo: 2,
               blockEmpty: 0,
-              commentToSourceRatio: 0.6922445629872794,
+              commentToSourceRatio: 0.7107822410147991,
             },
-            complexity: { perceivedNaiveScore: 1667 },
+            complexity: { perceivedNaiveScore: 1603 },
             summary: {
               perceivedComplexity: 6,
               size: 4,
-              numLogicContracts: 3,
-              numFiles: 4,
+              numLogicContracts: 2,
+              numFiles: 3,
               interfaceRisk: 6,
               inlineDocumentation: 1,
               compilerFeatures: 2,
               compilerVersion: 1,
             },
             num: {
-              astStatements: 14132,
-              contractDefinitions: 36,
-              contracts: 16,
+              astStatements: 13938,
+              contractDefinitions: 32,
+              contracts: 14,
               libraries: 2,
               interfaces: 13,
-              abstract: 5,
-              imports: 51,
-              functionsPublic: 192,
+              abstract: 3,
+              imports: 49,
+              functionsPublic: 191,
               functionsPayable: 10,
-              assemblyBlocks: 12,
-              stateVars: 87,
-              stateVarsPublic: 80,
+              assemblyBlocks: 10,
+              stateVars: 88,
+              stateVarsPublic: 82,
             },
             capabilities: {
-              solidityVersions: ["^0.8.24", ">=0.8.0 <0.9.0"],
+              solidityVersions: ["^0.8.24", "^0.8.28", ">=0.8.0 <0.9.0"],
               assembly: true,
               experimental: [],
               canReceiveFunds: true,
@@ -209166,10 +209164,6 @@
                 {},
                 {},
                 {},
-                {},
-                {},
-                {},
-                {},
               ],
             },
           },
@@ -209177,293 +209171,295 @@
             ast: {
               SourceUnit: 1,
               PragmaDirective: 1,
-              "Pragma:solidity:^0.8.24": 0.7741935483870968,
-              ImportDirective: 1.6451612903225807,
-              StringLiteral: 4.193548387096774,
-              Identifier: 122.16129032258064,
-              ContractDefinition: 1.1612903225806452,
-              "ContractDefinition:Contract": 0.5161290322580645,
-              "ContractDefinition:BaseContracts": 0.967741935483871,
-              InheritanceSpecifier: 0.967741935483871,
-              UserDefinedTypeName: 7.483870967741935,
-              "UserDefinedTypeName:KlerosCoreBase": 0.06451612903225806,
-              StateVariableDeclaration: 2.806451612903226,
-              VariableDeclaration: 38.903225806451616,
-              "StateVariableDeclaration:Public": 2.5806451612903225,
-              "StateVariableDeclaration:Const": 0.6774193548387096,
-              ElementaryTypeName: 34.645161290322584,
-              FunctionDefinition: 8.548387096774194,
-              "FunctionDefinition:Internal": 7,
-              "FunctionDefinition:Default": 0.5161290322580645,
-              Block: 13,
-              ExpressionStatement: 14.741935483870968,
-              FunctionCall: 15.35483870967742,
-              "FunctionCall:Type:Regular": 4.32258064516129,
-              "FunctionCall:Name:_disableInitializers": 0.3870967741935484,
-              "FunctionDefinition:External": 5.645161290322581,
-              "UserDefinedTypeName:IERC20": 0.8387096774193549,
-              "UserDefinedTypeName:IDisputeKit": 0.41935483870967744,
-              "VariableDeclaration:Memory": 1.935483870967742,
-              ArrayTypeName: 1.6129032258064515,
-              NumberLiteral: 8.161290322580646,
-              "UserDefinedTypeName:ISortitionModule": 0.22580645161290322,
-              "FunctionCall:Name:__KlerosCoreBase_initialize": 0.06451612903225806,
-              ModifierInvocation: 3.3225806451612905,
-              BinaryOperation: 21.29032258064516,
-              "FunctionDefinition:View": 2.5806451612903225,
-              "ContractDefinition:Abstract": 0.16129032258064516,
-              "UserDefinedTypeName:IArbitratorV2": 0.1935483870967742,
-              "UserDefinedTypeName:Initializable": 0.1935483870967742,
-              "UserDefinedTypeName:UUPSProxiable": 0.1935483870967742,
-              UsingForDeclaration: 0.0967741935483871,
-              EnumDefinition: 0.12903225806451613,
-              EnumValue: 0.6451612903225806,
-              StructDefinition: 0.41935483870967744,
-              Mapping: 0.7741935483870968,
-              "UserDefinedTypeName:IArbitrableV2": 0.1935483870967742,
-              "UserDefinedTypeName:Period": 0.06451612903225806,
-              "UserDefinedTypeName:Round": 1,
-              "StateVariableDeclaration:Private": 0.1935483870967742,
-              TupleExpression: 1.7419354838709677,
-              "UserDefinedTypeName:Court": 0.2903225806451613,
-              "UserDefinedTypeName:Dispute": 1.1290322580645162,
-              "UserDefinedTypeName:CurrencyRate": 0.03225806451612903,
-              EventDefinition: 1.3870967741935485,
-              "VariableDeclaration:Indexed": 2.3225806451612905,
-              ModifierDefinition: 0.6129032258064516,
-              IfStatement: 5.290322580645161,
-              MemberAccess: 27.225806451612904,
-              RevertStatement: 1.7096774193548387,
-              UnaryOperation: 1.7419354838709677,
-              EmitStatement: 1.6774193548387097,
-              "FunctionCall:Type:MemberAccess": 3.129032258064516,
-              "FunctionCall:Name:createTree": 0.0967741935483871,
-              VariableDeclarationStatement: 7,
-              "VariableDeclaration:Storage": 2.935483870967742,
-              NewExpression: 0.0967741935483871,
-              IndexAccess: 9.516129032258064,
-              "FunctionCall:Name:_enableDisputeKit": 0.12903225806451613,
-              BooleanLiteral: 1.6451612903225807,
-              NameValueExpression: 0.16129032258064516,
-              NameValueList: 0.16129032258064516,
-              ForStatement: 0.3225806451612903,
-              "FunctionCall:Name:_setStake": 0.12903225806451613,
-              "FunctionCall:Name:address": 0.9032258064516129,
-              "FunctionCall:Name:safeTransfer": 0.1935483870967742,
-              "FunctionDefinition:Payable": 0.3225806451612903,
-              "FunctionCall:Name:arbitrationCost": 0.0967741935483871,
-              ReturnStatement: 2.4838709677419355,
-              "FunctionCall:Name:_createDispute": 0.16129032258064516,
-              "VariableDeclaration:Calldata": 0.8709677419354839,
-              "FunctionCall:Name:safeTransferFrom": 0.06451612903225806,
-              "FunctionCall:Name:_extraDataToCourtIDMinJurorsDisputeKit": 0.06451612903225806,
-              Conditional: 0.3548387096774194,
-              "FunctionCall:Name:convertEthToTokenAmount": 0.06451612903225806,
-              "FunctionCall:Name:_calculatePnkAtStake": 0.06451612903225806,
-              "FunctionCall:Name:createDisputeHook": 0.06451612903225806,
-              "FunctionCall:Name:createDispute": 0.06451612903225806,
-              "FunctionCall:Name:areCommitsAllCast": 0.03225806451612903,
-              "FunctionCall:Name:areVotesAllCast": 0.03225806451612903,
-              "FunctionCall:Name:isAppealFunded": 0.03225806451612903,
-              WhileStatement: 0.12903225806451613,
-              "FunctionCall:Name:draw": 0.06451612903225806,
-              ContinueStatement: 0.03225806451612903,
-              "FunctionCall:Name:lockStake": 0.03225806451612903,
-              "FunctionCall:Name:postDrawHook": 0.03225806451612903,
-              "FunctionCall:Name:appealCost": 0.06451612903225806,
-              "FunctionCall:Name:getCoherentCount": 0.03225806451612903,
-              "FunctionCall:Name:_executePenalties": 0.03225806451612903,
-              "FunctionCall:Name:_executeRewards": 0.03225806451612903,
-              "UserDefinedTypeName:ExecuteParams": 0.06451612903225806,
-              "FunctionCall:Name:getDegreeOfCoherence": 0.06451612903225806,
-              "FunctionCall:Name:unlockStake": 0.06451612903225806,
-              "FunctionCall:Name:penalizeStake": 0.03225806451612903,
-              "FunctionCall:Name:isVoteActive": 0.03225806451612903,
-              "FunctionCall:Name:setJurorInactive": 0.03225806451612903,
-              "FunctionCall:Name:_transferFeeToken": 0.0967741935483871,
-              "FunctionCall:Name:payable": 0.12903225806451613,
-              "FunctionCall:Name:_applyCoherence": 0.0967741935483871,
-              "FunctionCall:Name:currentRuling": 0.1935483870967742,
-              "FunctionCall:Name:rule": 0.03225806451612903,
-              "FunctionDefinition:Public": 0.5483870967741935,
-              "FunctionCall:Name:safeSend": 0.0967741935483871,
-              "FunctionDefinition:Pure": 0.41935483870967744,
-              "UserDefinedTypeName:OnError": 0.0967741935483871,
-              "FunctionCall:Name:_stakingFailed": 0.1935483870967742,
-              "UserDefinedTypeName:StakingResult": 0.22580645161290322,
-              "FunctionCall:Name:validateStake": 0.03225806451612903,
-              "FunctionCall:Name:setStake": 0.03225806451612903,
-              InlineAssemblyStatement: 0.3870967741935484,
-              AssemblyBlock: 0.7419354838709677,
-              AssemblyAssignment: 0.5806451612903226,
-              AssemblyCall: 3.193548387096774,
-              "AssemblyCall:Name:mload": 0.3870967741935484,
-              "AssemblyCall:Name:add": 0.5161290322580645,
-              HexNumber: 0.7419354838709677,
-              CustomErrorDefinition: 1.4516129032258065,
-              "ImportDirective:Path:@openzeppelin/contracts/token/ERC721/IERC721.sol": 0.03225806451612903,
-              "UserDefinedTypeName:IERC721": 0.0967741935483871,
-              "FunctionCall:Name:balanceOf": 0.16129032258064516,
-              "FunctionCall:Type:BuiltIn": 1.8387096774193548,
-              "FunctionCall:Name:require": 1.6451612903225807,
-              "UserDefinedTypeName:SortitionModuleBase": 0.06451612903225806,
-              "UserDefinedTypeName:KlerosCore": 0.3548387096774194,
-              "UserDefinedTypeName:IRNG": 0.2903225806451613,
-              "FunctionCall:Name:__SortitionModuleBase_initialize": 0.06451612903225806,
-              "UserDefinedTypeName:Phase": 0.06451612903225806,
-              "StateVariableDeclaration:Default": 0.03225806451612903,
-              "UserDefinedTypeName:SortitionSumTree": 0.1935483870967742,
-              "UserDefinedTypeName:Juror": 0.25806451612903225,
-              "UserDefinedTypeName:DelayedStake": 0.0967741935483871,
-              "FunctionCall:Name:requestRandomness": 0.0967741935483871,
-              "FunctionCall:Name:receiveRandomness": 0.06451612903225806,
-              "FunctionCall:Name:_extraDataToTreeK": 0.03225806451612903,
-              "FunctionCall:Name:setStakeBySortitionModule": 0.06451612903225806,
-              "FunctionCall:Name:_validateStake": 0.06451612903225806,
-              "FunctionCall:Name:stakeOf": 0.16129032258064516,
-              BreakStatement: 0.06451612903225806,
-              "FunctionCall:Name:_accountAndCourtIDToStakePathID": 0.06451612903225806,
-              "FunctionCall:Name:_set": 0.03225806451612903,
-              "FunctionCall:Name:courts": 0.0967741935483871,
-              "FunctionCall:Name:getJurorLeftoverPNK": 0.06451612903225806,
-              "FunctionCall:Name:getJurorCourtIDs": 0.03225806451612903,
-              "FunctionCall:Name:transferBySortitionModule": 0.03225806451612903,
-              "FunctionCall:Name:keccak256": 0.1935483870967742,
-              "FunctionCall:Name:encodePacked": 0.06451612903225806,
-              "FunctionCall:Name:_stakePathIDToAccount": 0.03225806451612903,
-              "FunctionDefinition:Private": 0.06451612903225806,
-              AssemblyLocalDefinition: 0.25806451612903225,
-              AssemblyFor: 0.0967741935483871,
-              "AssemblyCall:Name:lt": 0.0967741935483871,
-              "AssemblyCall:Name:mstore8": 0.0967741935483871,
-              "AssemblyCall:Name:byte": 0.0967741935483871,
-              "FunctionCall:Name:_updateParents": 0.0967741935483871,
-              "UserDefinedTypeName:IDisputeTemplateRegistry": 0.12903225806451613,
-              "UserDefinedTypeName:DisputeStruct": 0.06451612903225806,
-              "FunctionCall:Name:setDisputeTemplate": 0.03225806451612903,
-              "UserDefinedTypeName:DisputeKitClassicBase": 0.16129032258064516,
-              "FunctionCall:Name:__DisputeKitClassicBase_initialize": 0.16129032258064516,
-              "UserDefinedTypeName:Vote": 0.12903225806451613,
-              "FunctionCall:Name:getNumberOfRounds": 0.06451612903225806,
-              "FunctionCall:Name:sortitionModule": 0.03225806451612903,
-              "FunctionCall:Name:disputes": 0.22580645161290322,
-              "FunctionCall:Name:_postDrawCheck": 0.12903225806451613,
-              "FunctionCall:Name:_castCommit": 0.0967741935483871,
-              "UserDefinedTypeName:KlerosCore.Period": 0.0967741935483871,
-              "FunctionCall:Name:_castVote": 0.0967741935483871,
-              "FunctionCall:Name:hashVote": 0.03225806451612903,
-              "FunctionCall:Name:appealPeriod": 0.06451612903225806,
-              "FunctionCall:Name:isDisputeKitJumping": 0.03225806451612903,
-              "FunctionCall:Name:getNumberOfVotes": 0.03225806451612903,
-              "FunctionCall:Name:paused": 0.03225806451612903,
-              "FunctionCall:Name:getFundedChoices": 0.06451612903225806,
-              "ContractDefinition:Interface": 0.41935483870967744,
-              "AssemblyCall:Name:and": 0.12903225806451613,
-              "AssemblyCall:Name:shr": 0.06451612903225806,
-              DecimalNumber: 0.45161290322580644,
-              "FunctionCall:Name:extraDataToTokenInfo": 0.03225806451612903,
-              "FunctionCall:Type:ContractTypecast": 0.1935483870967742,
-              "FunctionCall:Name:encode": 0.06451612903225806,
-              "FunctionCall:Name:_extraDataToTokenInfo": 0.03225806451612903,
-              "UserDefinedTypeName:IProofOfHumanity": 0.06451612903225806,
-              "FunctionCall:Name:isRegistered": 0.03225806451612903,
-              "UserDefinedTypeName:IEvidence": 0.03225806451612903,
-              "Pragma:solidity:>=0.8.0_<0.9.0": 0.22580645161290322,
-              "ImportDirective:Path:@openzeppelin/contracts/token/ERC20/IERC20.sol": 0.0967741935483871,
-              FileLevelConstant: 0.25806451612903225,
-              "ContractDefinition:Library": 0.06451612903225806,
-              "FunctionCall:Name:approve": 0.03225806451612903,
-              "FunctionCall:Name:allowance": 0.03225806451612903,
-              "FunctionCall:Name:call": 0.06451612903225806,
-              "FunctionCall:Name:encodeCall": 0.06451612903225806,
-              "FunctionCall:Name:decode": 0.06451612903225806,
-              "FunctionCall:Name:send": 0.03225806451612903,
-              "FunctionCall:Name:transfer": 0.03225806451612903,
-              "FunctionCall:Name:blockhash": 0.03225806451612903,
-              "ImportDirective:Path:@chainlink/contracts/src/v0.8/vrf/dev/VRFConsumerBaseV2Plus.sol": 0.03225806451612903,
-              "ImportDirective:Path:@chainlink/contracts/src/v0.8/vrf/dev/libraries/VRFV2PlusClient.sol": 0.03225806451612903,
-              "UserDefinedTypeName:VRFConsumerBaseV2Plus": 0.03225806451612903,
-              "FunctionCall:Name:requestRandomWords": 0.03225806451612903,
-              "FunctionCall:Name:RandomWordsRequest": 0.03225806451612903,
-              "FunctionCall:Name:_argsToBytes": 0.03225806451612903,
-              "FunctionCall:Name:ExtraArgsV1": 0.03225806451612903,
-              "FunctionCall:Name:_authorizeUpgrade": 0.03225806451612903,
-              "FunctionCall:Name:_getImplementation": 0.0967741935483871,
-              TryStatement: 0.03225806451612903,
-              "FunctionCall:Name:proxiableUUID": 0.03225806451612903,
-              "AssemblyCall:Name:sstore": 0.06451612903225806,
-              "FunctionCall:Name:delegatecall": 0.06451612903225806,
-              CatchClause: 0.03225806451612903,
-              "AssemblyCall:Name:sload": 0.06451612903225806,
-              "AssemblyCall:Name:calldatacopy": 0.03225806451612903,
-              "AssemblyCall:Name:calldatasize": 0.06451612903225806,
-              "AssemblyCall:Name:delegatecall": 0.03225806451612903,
-              "AssemblyCall:Name:gas": 0.03225806451612903,
-              "AssemblyCall:Name:returndatacopy": 0.03225806451612903,
-              "AssemblyCall:Name:returndatasize": 0.0967741935483871,
-              AssemblySwitch: 0.03225806451612903,
-              AssemblyCase: 0.06451612903225806,
-              "AssemblyCall:Name:revert": 0.03225806451612903,
-              "AssemblyCall:Name:return": 0.03225806451612903,
-              "FunctionCall:Name:_delegate": 0.06451612903225806,
-              "UserDefinedTypeName:InitializableStorage": 0.12903225806451613,
-              "FunctionCall:Name:_getInitializableStorage": 0.16129032258064516,
-              "FunctionCall:Name:_checkInitializing": 0.03225806451612903,
-              "FunctionCall:Name:_isInitializing": 0.03225806451612903,
-              "FunctionCall:Name:type": 0.0967741935483871,
-              AssemblyMemberAccess: 0.03225806451612903,
+              "Pragma:solidity:^0.8.24": 0.7037037037037037,
+              ImportDirective: 1.8148148148148149,
+              StringLiteral: 2.740740740740741,
+              Identifier: 139.8148148148148,
+              "ImportDirective:Path:@openzeppelin/contracts/token/ERC721/IERC721.sol": 0.037037037037037035,
+              ContractDefinition: 1.1851851851851851,
+              "ContractDefinition:Contract": 0.5185185185185185,
+              "ContractDefinition:BaseContracts": 0.9629629629629629,
+              InheritanceSpecifier: 0.9629629629629629,
+              UserDefinedTypeName: 8.333333333333334,
+              "UserDefinedTypeName:IArbitratorV2": 0.2222222222222222,
+              "UserDefinedTypeName:Initializable": 0.2222222222222222,
+              "UserDefinedTypeName:UUPSProxiable": 0.2222222222222222,
+              UsingForDeclaration: 0.18518518518518517,
+              "UserDefinedTypeName:IERC20": 0.8518518518518519,
+              ElementaryTypeName: 40.629629629629626,
+              StateVariableDeclaration: 3.259259259259259,
+              VariableDeclaration: 45.44444444444444,
+              "StateVariableDeclaration:Public": 3.037037037037037,
+              "StateVariableDeclaration:Const": 0.6296296296296297,
+              EnumDefinition: 0.14814814814814814,
+              EnumValue: 0.7407407407407407,
+              StructDefinition: 0.4444444444444444,
+              ArrayTypeName: 1.6666666666666667,
+              NumberLiteral: 7.888888888888889,
+              Mapping: 1.0740740740740742,
+              "UserDefinedTypeName:IArbitrableV2": 0.2222222222222222,
+              "UserDefinedTypeName:Period": 0.07407407407407407,
+              "UserDefinedTypeName:Round": 1.2222222222222223,
+              "StateVariableDeclaration:Private": 0.18518518518518517,
+              BinaryOperation: 23.666666666666668,
+              TupleExpression: 1.8888888888888888,
+              "UserDefinedTypeName:ISortitionModule": 0.18518518518518517,
+              "UserDefinedTypeName:Court": 0.4074074074074074,
+              "UserDefinedTypeName:IDisputeKit": 0.48148148148148145,
+              "UserDefinedTypeName:Dispute": 1.4074074074074074,
+              "UserDefinedTypeName:CurrencyRate": 0.037037037037037035,
+              "UserDefinedTypeName:IERC721": 0.1111111111111111,
+              EventDefinition: 1.5925925925925926,
+              "VariableDeclaration:Indexed": 2.6666666666666665,
+              ModifierDefinition: 0.7037037037037037,
+              Block: 14.296296296296296,
+              IfStatement: 7.962962962962963,
+              MemberAccess: 30.48148148148148,
+              RevertStatement: 3.814814814814815,
+              FunctionCall: 17.703703703703702,
+              ExpressionStatement: 14.407407407407407,
+              UnaryOperation: 2.074074074074074,
+              FunctionDefinition: 9.518518518518519,
+              "FunctionDefinition:Internal": 7.296296296296297,
+              "FunctionDefinition:Default": 0.5185185185185185,
+              "FunctionCall:Type:Regular": 4.888888888888889,
+              "FunctionCall:Name:_disableInitializers": 0.37037037037037035,
+              "FunctionDefinition:External": 6.481481481481482,
+              "VariableDeclaration:Memory": 1.962962962962963,
+              EmitStatement: 1.9259259259259258,
+              "FunctionCall:Type:MemberAccess": 4.185185185185185,
+              "FunctionCall:Name:createTree": 0.14814814814814814,
+              VariableDeclarationStatement: 7.962962962962963,
+              "VariableDeclaration:Storage": 3.4074074074074074,
+              NewExpression: 0.1111111111111111,
+              IndexAccess: 11,
+              "FunctionCall:Name:_enableDisputeKit": 0.14814814814814814,
+              BooleanLiteral: 2.259259259259259,
+              ModifierInvocation: 3.259259259259259,
+              "FunctionDefinition:View": 3.4074074074074074,
+              NameValueExpression: 0.18518518518518517,
+              NameValueList: 0.18518518518518517,
+              ForStatement: 0.4074074074074074,
+              "FunctionCall:Name:address": 1.037037037037037,
+              "FunctionCall:Name:balanceOf": 0.18518518518518517,
+              "FunctionCall:Name:_setStake": 0.18518518518518517,
+              "FunctionCall:Name:safeTransfer": 0.2222222222222222,
+              "FunctionDefinition:Payable": 0.37037037037037035,
+              "FunctionCall:Name:arbitrationCost": 0.1111111111111111,
+              ReturnStatement: 3.3333333333333335,
+              "FunctionCall:Name:_createDispute": 0.14814814814814814,
+              "VariableDeclaration:Calldata": 1,
+              "FunctionCall:Name:safeTransferFrom": 0.07407407407407407,
+              "FunctionCall:Name:_extraDataToCourtIDMinJurorsDisputeKit": 0.07407407407407407,
+              Conditional: 0.4074074074074074,
+              "FunctionCall:Name:convertEthToTokenAmount": 0.07407407407407407,
+              "FunctionCall:Name:_calculatePnkAtStake": 0.07407407407407407,
+              "FunctionCall:Name:createDisputeHook": 0.07407407407407407,
+              "FunctionCall:Name:createDispute": 0.07407407407407407,
+              "FunctionCall:Name:areVotesAllCast": 0.037037037037037035,
+              "FunctionCall:Name:isAppealFunded": 0.037037037037037035,
+              WhileStatement: 0.07407407407407407,
+              "FunctionCall:Name:draw": 0.1111111111111111,
+              ContinueStatement: 0.037037037037037035,
+              "FunctionCall:Name:lockStake": 0.037037037037037035,
+              "FunctionCall:Name:postDrawHook": 0.037037037037037035,
+              "FunctionCall:Name:appealCost": 0.07407407407407407,
+              "FunctionCall:Name:_getCourtAndDisputeKitJumps": 0.07407407407407407,
+              "FunctionCall:Name:getCoherentCount": 0.037037037037037035,
+              "FunctionCall:Name:_executePenalties": 0.037037037037037035,
+              "FunctionCall:Name:_executeRewards": 0.037037037037037035,
+              "UserDefinedTypeName:ExecuteParams": 0.07407407407407407,
+              "FunctionCall:Name:getDegreeOfCoherencePenalty": 0.037037037037037035,
+              "FunctionCall:Name:unlockStake": 0.07407407407407407,
+              "FunctionCall:Name:setStakePenalty": 0.037037037037037035,
+              "FunctionCall:Name:isVoteActive": 0.037037037037037035,
+              "FunctionCall:Name:forcedUnstakeAllCourts": 0.037037037037037035,
+              "FunctionCall:Name:forcedUnstake": 0.037037037037037035,
+              "FunctionCall:Name:_transferFeeToken": 0.1111111111111111,
+              "FunctionCall:Name:payable": 0.14814814814814814,
+              "FunctionCall:Name:getDegreeOfCoherenceReward": 0.037037037037037035,
+              "FunctionCall:Name:_applyCoherence": 0.1111111111111111,
+              "FunctionCall:Name:setStakeReward": 0.037037037037037035,
+              "FunctionCall:Name:currentRuling": 0.2222222222222222,
+              "FunctionCall:Name:rule": 0.037037037037037035,
+              "FunctionDefinition:Public": 0.5925925925925926,
+              "FunctionCall:Name:getNbVotesAfterAppeal": 0.037037037037037035,
+              "FunctionCall:Name:_isCourtJumping": 0.07407407407407407,
+              "FunctionCall:Name:earlyCourtJump": 0.037037037037037035,
+              "FunctionCall:Name:getJumpDisputeKitID": 0.037037037037037035,
+              "FunctionCall:Name:safeSend": 0.1111111111111111,
+              "FunctionDefinition:Pure": 0.3333333333333333,
+              "UserDefinedTypeName:OnError": 0.07407407407407407,
+              "FunctionCall:Name:_stakingFailed": 0.18518518518518517,
+              "UserDefinedTypeName:StakingResult": 0.18518518518518517,
+              "FunctionCall:Name:validateStake": 0.037037037037037035,
+              "FunctionCall:Name:setStake": 0.037037037037037035,
+              InlineAssemblyStatement: 0.37037037037037035,
+              AssemblyBlock: 0.4444444444444444,
+              AssemblyAssignment: 0.48148148148148145,
+              AssemblyCall: 2.1481481481481484,
+              "AssemblyCall:Name:mload": 0.2962962962962963,
+              "AssemblyCall:Name:add": 0.2962962962962963,
+              HexNumber: 0.37037037037037035,
+              CustomErrorDefinition: 3.185185185185185,
+              "UserDefinedTypeName:SortitionTrees.Tree": 0.1111111111111111,
+              "UserDefinedTypeName:TreeKey": 0.2222222222222222,
+              "UserDefinedTypeName:KlerosCore": 0.3333333333333333,
+              "UserDefinedTypeName:Phase": 0.07407407407407407,
+              "UserDefinedTypeName:IRNG": 0.25925925925925924,
+              "StateVariableDeclaration:Default": 0.037037037037037035,
+              "UserDefinedTypeName:Juror": 0.25925925925925924,
+              "UserDefinedTypeName:DelayedStake": 0.1111111111111111,
+              "FunctionCall:Name:requestRandomness": 0.1111111111111111,
+              "FunctionCall:Name:receiveRandomness": 0.07407407407407407,
+              "FunctionCall:Name:toTreeKey": 0.14814814814814814,
+              "FunctionCall:Name:wrap": 0.14814814814814814,
+              "FunctionCall:Name:_extraDataToTreeK": 0.037037037037037035,
+              "FunctionCall:Name:setStakeBySortitionModule": 0.1111111111111111,
+              "FunctionCall:Name:_validateStake": 0.037037037037037035,
+              "FunctionCall:Name:stakeOf": 0.2962962962962963,
+              BreakStatement: 0.037037037037037035,
+              "FunctionCall:Name:toStakePathID": 0.07407407407407407,
+              "FunctionCall:Name:set": 0.037037037037037035,
+              "FunctionCall:Name:courts": 0.1111111111111111,
+              "FunctionCall:Name:getJurorLeftoverPNK": 0.07407407407407407,
+              "FunctionCall:Name:getJurorCourtIDs": 0.037037037037037035,
+              "FunctionCall:Name:transferBySortitionModule": 0.037037037037037035,
+              "UserDefinedTypeName:IDisputeTemplateRegistry": 0.14814814814814814,
+              "UserDefinedTypeName:DisputeStruct": 0.07407407407407407,
+              "FunctionCall:Name:setDisputeTemplate": 0.037037037037037035,
+              "UserDefinedTypeName:DisputeKitClassicBase": 0.18518518518518517,
+              "FunctionCall:Name:__DisputeKitClassicBase_initialize": 0.18518518518518517,
+              "ContractDefinition:Abstract": 0.1111111111111111,
+              "UserDefinedTypeName:Vote": 0.14814814814814814,
+              "FunctionCall:Name:getNumberOfRounds": 0.07407407407407407,
+              "FunctionCall:Name:sortitionModule": 0.037037037037037035,
+              "FunctionCall:Name:disputes": 0.25925925925925924,
+              "FunctionCall:Name:_postDrawCheck": 0.14814814814814814,
+              "FunctionCall:Name:_castCommit": 0.1111111111111111,
+              "UserDefinedTypeName:KlerosCore.Period": 0.1111111111111111,
+              "FunctionCall:Name:_castVote": 0.1111111111111111,
+              "FunctionCall:Name:hashVote": 0.037037037037037035,
+              "FunctionCall:Name:_getExpectedVoteHash": 0.037037037037037035,
+              "FunctionCall:Name:appealPeriod": 0.07407407407407407,
+              "FunctionCall:Name:isDisputeKitJumping": 0.037037037037037035,
+              "FunctionCall:Name:getNumberOfVotes": 0.037037037037037035,
+              "FunctionCall:Name:paused": 0.037037037037037035,
+              "FunctionCall:Type:BuiltIn": 0.2962962962962963,
+              "FunctionCall:Name:keccak256": 0.25925925925925924,
+              "FunctionCall:Name:encodePacked": 0.1111111111111111,
+              "FunctionCall:Name:getFundedChoices": 0.07407407407407407,
+              "FunctionCall:Name:_getDegreeOfCoherence": 0.07407407407407407,
+              "ContractDefinition:Interface": 0.48148148148148145,
+              AssemblyLocalDefinition: 0.1111111111111111,
+              "AssemblyCall:Name:and": 0.14814814814814814,
+              "AssemblyCall:Name:shr": 0.07407407407407407,
+              DecimalNumber: 0.5185185185185185,
+              "FunctionCall:Name:extraDataToTokenInfo": 0.037037037037037035,
+              "FunctionCall:Type:ContractTypecast": 0.2222222222222222,
+              "FunctionCall:Name:encode": 0.07407407407407407,
+              "FunctionCall:Name:_extraDataToTokenInfo": 0.037037037037037035,
+              "Pragma:solidity:^0.8.28": 0.037037037037037035,
+              "UserDefinedTypeName:IProofOfHumanity": 0.07407407407407407,
+              "FunctionCall:Name:isRegistered": 0.037037037037037035,
+              "UserDefinedTypeName:IEvidence": 0.037037037037037035,
+              "Pragma:solidity:>=0.8.0_<0.9.0": 0.25925925925925924,
+              "ImportDirective:Path:@openzeppelin/contracts/token/ERC20/IERC20.sol": 0.1111111111111111,
+              FileLevelConstant: 0.3333333333333333,
+              "ContractDefinition:Library": 0.07407407407407407,
+              "FunctionCall:Name:approve": 0.037037037037037035,
+              "FunctionCall:Name:allowance": 0.037037037037037035,
+              "FunctionCall:Name:call": 0.07407407407407407,
+              "FunctionCall:Name:encodeCall": 0.07407407407407407,
+              "FunctionCall:Name:decode": 0.07407407407407407,
+              "FunctionCall:Name:send": 0.037037037037037035,
+              "FunctionCall:Name:transfer": 0.037037037037037035,
+              "FunctionCall:Name:blockhash": 0.037037037037037035,
+              "ImportDirective:Path:@chainlink/contracts/src/v0.8/vrf/dev/libraries/VRFV2PlusClient.sol": 0.037037037037037035,
+              "UserDefinedTypeName:VRFConsumerBaseV2Plus": 0.037037037037037035,
+              "FunctionCall:Name:requestRandomWords": 0.037037037037037035,
+              "FunctionCall:Name:RandomWordsRequest": 0.037037037037037035,
+              "FunctionCall:Name:_argsToBytes": 0.037037037037037035,
+              "FunctionCall:Name:ExtraArgsV1": 0.037037037037037035,
+              "FunctionCall:Name:_authorizeUpgrade": 0.037037037037037035,
+              "FunctionCall:Name:_getImplementation": 0.1111111111111111,
+              TryStatement: 0.037037037037037035,
+              "FunctionCall:Name:proxiableUUID": 0.037037037037037035,
+              "AssemblyCall:Name:sstore": 0.07407407407407407,
+              "FunctionCall:Name:delegatecall": 0.07407407407407407,
+              CatchClause: 0.037037037037037035,
+              "AssemblyCall:Name:sload": 0.07407407407407407,
+              "FunctionCall:Name:require": 0.037037037037037035,
+              "AssemblyCall:Name:calldatacopy": 0.037037037037037035,
+              "AssemblyCall:Name:calldatasize": 0.07407407407407407,
+              "AssemblyCall:Name:delegatecall": 0.037037037037037035,
+              "AssemblyCall:Name:gas": 0.037037037037037035,
+              "AssemblyCall:Name:returndatacopy": 0.037037037037037035,
+              "AssemblyCall:Name:returndatasize": 0.1111111111111111,
+              AssemblySwitch: 0.037037037037037035,
+              AssemblyCase: 0.07407407407407407,
+              "AssemblyCall:Name:revert": 0.037037037037037035,
+              "AssemblyCall:Name:return": 0.037037037037037035,
+              "FunctionCall:Name:_delegate": 0.07407407407407407,
+              "UserDefinedTypeName:InitializableStorage": 0.14814814814814814,
+              "FunctionCall:Name:_getInitializableStorage": 0.18518518518518517,
+              "FunctionCall:Name:_checkInitializing": 0.037037037037037035,
+              "FunctionCall:Name:_isInitializing": 0.037037037037037035,
+              "FunctionCall:Name:type": 0.1111111111111111,
+              "FunctionDefinition:Private": 0.037037037037037035,
+              AssemblyMemberAccess: 0.037037037037037035,
             },
             sloc: {
-              total: 165.29032258064515,
-              source: 91.58064516129032,
-              comment: 57.54838709677419,
-              single: 52.32258064516129,
-              block: 5.225806451612903,
-              mixed: 5.645161290322581,
-              empty: 21.806451612903224,
-              todo: 0.06451612903225806,
+              total: 189,
+              source: 104,
+              comment: 66.74074074074075,
+              single: 60.55555555555556,
+              block: 6.185185185185185,
+              mixed: 6.814814814814815,
+              empty: 25.074074074074073,
+              todo: 0.1111111111111111,
               blockEmpty: 0,
-              commentToSourceRatio: 0.9784907999489301,
+              commentToSourceRatio: 1.0155317212422816,
             },
             nsloc: {
-              total: 147.96774193548387,
-              source: 78.61290322580645,
-              comment: 54.41935483870968,
-              single: 49.32258064516129,
-              block: 5.096774193548387,
-              mixed: 5.516129032258065,
-              empty: 20.451612903225808,
-              todo: 0.06451612903225806,
+              total: 166.7037037037037,
+              source: 87.5925925925926,
+              comment: 62.25925925925926,
+              single: 56.44444444444444,
+              block: 5.814814814814815,
+              mixed: 6.407407407407407,
+              empty: 23.25925925925926,
+              todo: 0.07407407407407407,
               blockEmpty: 0,
-              commentToSourceRatio: 1.1404911436132485,
+              commentToSourceRatio: 1.1998123773006808,
             },
-            complexity: { perceivedNaiveScore: 53.77419354838709 },
+            complexity: { perceivedNaiveScore: 59.370370370370374 },
             summary: {
               perceivedComplexity: 2,
               size: 1,
               numLogicContracts: 1,
-              numFiles: 0.12903225806451613,
+              numFiles: 0.1111111111111111,
               interfaceRisk: 2,
               inlineDocumentation: 1,
               compilerFeatures: 1,
               compilerVersion: 1,
             },
             num: {
-              astStatements: 455.8709677419355,
-              contractDefinitions: 1.1612903225806452,
-              contracts: 0.5161290322580645,
-              libraries: 0.06451612903225806,
-              interfaces: 0.41935483870967744,
-              abstract: 0.16129032258064516,
-              imports: 1.6451612903225807,
-              functionsPublic: 6.193548387096774,
-              functionsPayable: 0.3225806451612903,
-              assemblyBlocks: 0.3870967741935484,
-              stateVars: 2.806451612903226,
-              stateVarsPublic: 2.5806451612903225,
+              astStatements: 516.2222222222222,
+              contractDefinitions: 1.1851851851851851,
+              contracts: 0.5185185185185185,
+              libraries: 0.07407407407407407,
+              interfaces: 0.48148148148148145,
+              abstract: 0.1111111111111111,
+              imports: 1.8148148148148149,
+              functionsPublic: 7.074074074074074,
+              functionsPayable: 0.37037037037037035,
+              assemblyBlocks: 0.37037037037037035,
+              stateVars: 3.259259259259259,
+              stateVarsPublic: 3.037037037037037,
             },
             capabilities: {
-              explicitValueTransfer: 0.03225806451612903,
+              explicitValueTransfer: 0.037037037037037035,
               assembly: true,
               canReceiveFunds: true,
               destroyable: false,
@@ -209477,14 +209473,12 @@
             },
             other: {},
           },
-          num: { sourceUnits: 31, metrics: 31, duplicates: 0, errors: 0 },
+          num: { sourceUnits: 27, metrics: 27, duplicates: 0, errors: 0 },
           other: {
             deployableContracts: [
               "KlerosCore",
-              "KlerosCoreNeo",
               "PolicyRegistry",
               "SortitionModule",
-              "SortitionModuleNeo",
               "DisputeResolver",
               "DisputeTemplateRegistry",
               "DisputeKitClassic",
@@ -209501,9 +209495,9 @@
         },
         dotGraphs: {
           "#surya-inheritance":
-            'digraph G {\n  graph [ ratio = "auto", page = "40" ];\n  "KlerosCore";\n  "KlerosCoreBase";\n  "IArbitratorV2";\n  "Initializable";\n  "UUPSProxiable";\n  "KlerosCoreNeo";\n  "PolicyRegistry";\n  "SortitionModule";\n  "SortitionModuleBase";\n  "ISortitionModule";\n  "SortitionModuleNeo";\n  "DisputeResolver";\n  "IArbitrableV2";\n  "DisputeTemplateRegistry";\n  "IDisputeTemplateRegistry";\n  "DisputeKitClassic";\n  "DisputeKitClassicBase";\n  "IDisputeKit";\n  "IBalanceHolder";\n  "IBalanceHolderERC1155";\n  "DisputeKitGated";\n  "DisputeKitGatedShutter";\n  "DisputeKitShutter";\n  "IProofOfHumanity";\n  "DisputeKitSybilResistant";\n  "EvidenceModule";\n  "IEvidence";\n  "SafeERC20";\n  "WethLike";\n  "SafeSend";\n  "RNGWithFallback";\n  "IRNG";\n  "ChainlinkRNG";\n  "VRFConsumerBaseV2Plus";\n  "UUPSProxy";\n  "KlerosCore" -> "KlerosCoreBase";\n  "KlerosCoreBase" -> "IArbitratorV2";\n  "KlerosCoreBase" -> "Initializable";\n  "KlerosCoreBase" -> "UUPSProxiable";\n  "KlerosCoreNeo" -> "KlerosCoreBase";\n  "PolicyRegistry" -> "UUPSProxiable";\n  "PolicyRegistry" -> "Initializable";\n  "SortitionModule" -> "SortitionModuleBase";\n  "SortitionModuleBase" -> "ISortitionModule";\n  "SortitionModuleBase" -> "Initializable";\n  "SortitionModuleBase" -> "UUPSProxiable";\n  "SortitionModuleNeo" -> "SortitionModuleBase";\n  "DisputeResolver" -> "IArbitrableV2";\n  "DisputeTemplateRegistry" -> "IDisputeTemplateRegistry";\n  "DisputeTemplateRegistry" -> "UUPSProxiable";\n  "DisputeTemplateRegistry" -> "Initializable";\n  "DisputeKitClassic" -> "DisputeKitClassicBase";\n  "DisputeKitClassicBase" -> "IDisputeKit";\n  "DisputeKitClassicBase" -> "Initializable";\n  "DisputeKitClassicBase" -> "UUPSProxiable";\n  "DisputeKitGated" -> "DisputeKitClassicBase";\n  "DisputeKitGatedShutter" -> "DisputeKitClassicBase";\n  "DisputeKitShutter" -> "DisputeKitClassicBase";\n  "DisputeKitSybilResistant" -> "DisputeKitClassicBase";\n  "EvidenceModule" -> "IEvidence";\n  "EvidenceModule" -> "Initializable";\n  "EvidenceModule" -> "UUPSProxiable";\n  "RNGWithFallback" -> "IRNG";\n  "ChainlinkRNG" -> "IRNG";\n  "ChainlinkRNG" -> "VRFConsumerBaseV2Plus";\n}\n',
+            'digraph G {\n  graph [ ratio = "auto", page = "40" ];\n  "KlerosCore";\n  "IArbitratorV2";\n  "Initializable";\n  "UUPSProxiable";\n  "PolicyRegistry";\n  "SortitionModule";\n  "ISortitionModule";\n  "DisputeResolver";\n  "IArbitrableV2";\n  "DisputeTemplateRegistry";\n  "IDisputeTemplateRegistry";\n  "DisputeKitClassic";\n  "DisputeKitClassicBase";\n  "IDisputeKit";\n  "IBalanceHolder";\n  "IBalanceHolderERC1155";\n  "DisputeKitGated";\n  "DisputeKitGatedShutter";\n  "DisputeKitShutter";\n  "IProofOfHumanity";\n  "DisputeKitSybilResistant";\n  "EvidenceModule";\n  "IEvidence";\n  "SafeERC20";\n  "WethLike";\n  "SafeSend";\n  "RNGWithFallback";\n  "IRNG";\n  "ChainlinkRNG";\n  "VRFConsumerBaseV2Plus";\n  "UUPSProxy";\n  "KlerosCore" -> "IArbitratorV2";\n  "KlerosCore" -> "Initializable";\n  "KlerosCore" -> "UUPSProxiable";\n  "PolicyRegistry" -> "UUPSProxiable";\n  "PolicyRegistry" -> "Initializable";\n  "SortitionModule" -> "ISortitionModule";\n  "SortitionModule" -> "Initializable";\n  "SortitionModule" -> "UUPSProxiable";\n  "DisputeResolver" -> "IArbitrableV2";\n  "DisputeTemplateRegistry" -> "IDisputeTemplateRegistry";\n  "DisputeTemplateRegistry" -> "UUPSProxiable";\n  "DisputeTemplateRegistry" -> "Initializable";\n  "DisputeKitClassic" -> "DisputeKitClassicBase";\n  "DisputeKitClassicBase" -> "IDisputeKit";\n  "DisputeKitClassicBase" -> "Initializable";\n  "DisputeKitClassicBase" -> "UUPSProxiable";\n  "DisputeKitGated" -> "DisputeKitClassicBase";\n  "DisputeKitGatedShutter" -> "DisputeKitClassicBase";\n  "DisputeKitShutter" -> "DisputeKitClassicBase";\n  "DisputeKitSybilResistant" -> "DisputeKitClassicBase";\n  "EvidenceModule" -> "IEvidence";\n  "EvidenceModule" -> "Initializable";\n  "EvidenceModule" -> "UUPSProxiable";\n  "RNGWithFallback" -> "IRNG";\n  "ChainlinkRNG" -> "IRNG";\n  "ChainlinkRNG" -> "VRFConsumerBaseV2Plus";\n}\n',
           "#surya-callgraph":
-            'digraph G {\n  graph [ ratio = "auto", page = "100", compound =true ];\nsubgraph "clusterKlerosCore" {\n  graph [ label = "KlerosCore", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "KlerosCore.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "KlerosCore.initialize" [ label = "initialize", color = "blue" ];\n  "KlerosCore.reinitialize" [ label = "reinitialize", color = "blue" ];\n  "KlerosCore._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "KlerosCore._disableInitializers" [ label = "_disableInitializers" ];\n  "KlerosCore.__KlerosCoreBase_initialize" [ label = "__KlerosCoreBase_initialize" ];\n  "KlerosCore.courts" [ label = "courts" ];\n  "KlerosCore.getNumberOfRounds" [ label = "getNumberOfRounds" ];\n  "KlerosCore.sortitionModule" [ label = "sortitionModule" ];\n  "KlerosCore.disputes" [ label = "disputes" ];\n  "KlerosCore.appealPeriod" [ label = "appealPeriod" ];\n  "KlerosCore.isDisputeKitJumping" [ label = "isDisputeKitJumping" ];\n  "KlerosCore.getNumberOfVotes" [ label = "getNumberOfVotes" ];\n  "KlerosCore.paused" [ label = "paused" ];\n}\n\nsubgraph "clusterKlerosCoreBase" {\n  graph [ label = "KlerosCoreBase", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "KlerosCoreBase.onlyByGovernor" [ label = "onlyByGovernor", color = "yellow" ];\n  "KlerosCoreBase.onlyByGuardianOrGovernor" [ label = "onlyByGuardianOrGovernor", color = "yellow" ];\n  "KlerosCoreBase.whenPaused" [ label = "whenPaused", color = "yellow" ];\n  "KlerosCoreBase.whenNotPaused" [ label = "whenNotPaused", color = "yellow" ];\n  "KlerosCoreBase.__KlerosCoreBase_initialize" [ label = "__KlerosCoreBase_initialize", color = "white" ];\n  "KlerosCoreBase.pause" [ label = "pause", color = "blue" ];\n  "KlerosCoreBase.unpause" [ label = "unpause", color = "blue" ];\n  "KlerosCoreBase.executeGovernorProposal" [ label = "executeGovernorProposal", color = "blue" ];\n  "KlerosCoreBase.changeGovernor" [ label = "changeGovernor", color = "blue" ];\n  "KlerosCoreBase.changeGuardian" [ label = "changeGuardian", color = "blue" ];\n  "KlerosCoreBase.changePinakion" [ label = "changePinakion", color = "blue" ];\n  "KlerosCoreBase.changeJurorProsecutionModule" [ label = "changeJurorProsecutionModule", color = "blue" ];\n  "KlerosCoreBase.changeSortitionModule" [ label = "changeSortitionModule", color = "blue" ];\n  "KlerosCoreBase.addNewDisputeKit" [ label = "addNewDisputeKit", color = "blue" ];\n  "KlerosCoreBase.createCourt" [ label = "createCourt", color = "blue" ];\n  "KlerosCoreBase.changeCourtParameters" [ label = "changeCourtParameters", color = "blue" ];\n  "KlerosCoreBase.enableDisputeKits" [ label = "enableDisputeKits", color = "blue" ];\n  "KlerosCoreBase.changeAcceptedFeeTokens" [ label = "changeAcceptedFeeTokens", color = "blue" ];\n  "KlerosCoreBase.changeCurrencyRates" [ label = "changeCurrencyRates", color = "blue" ];\n  "KlerosCoreBase.setStake" [ label = "setStake", color = "blue" ];\n  "KlerosCoreBase.setStakeBySortitionModule" [ label = "setStakeBySortitionModule", color = "blue" ];\n  "KlerosCoreBase.transferBySortitionModule" [ label = "transferBySortitionModule", color = "blue" ];\n  "KlerosCoreBase.createDispute" [ label = "createDispute", color = "blue" ];\n  "KlerosCoreBase._createDispute" [ label = "_createDispute" ];\n  "KlerosCoreBase.passPeriod" [ label = "passPeriod", color = "blue" ];\n  "KlerosCoreBase.draw" [ label = "draw", color = "blue" ];\n  "KlerosCoreBase.appeal" [ label = "appeal", color = "blue" ];\n  "KlerosCoreBase.execute" [ label = "execute", color = "blue" ];\n  "KlerosCoreBase._executePenalties" [ label = "_executePenalties" ];\n  "KlerosCoreBase._executeRewards" [ label = "_executeRewards" ];\n  "KlerosCoreBase.executeRuling" [ label = "executeRuling", color = "blue" ];\n  "KlerosCoreBase.arbitrationCost" [ label = "arbitrationCost" ];\n  "KlerosCoreBase.appealCost" [ label = "appealCost" ];\n  "KlerosCoreBase.appealPeriod" [ label = "appealPeriod", color = "blue" ];\n  "KlerosCoreBase.currentRuling" [ label = "currentRuling" ];\n  "KlerosCoreBase.getRoundInfo" [ label = "getRoundInfo", color = "blue" ];\n  "KlerosCoreBase.getPnkAtStakePerJuror" [ label = "getPnkAtStakePerJuror", color = "blue" ];\n  "KlerosCoreBase.getNumberOfRounds" [ label = "getNumberOfRounds", color = "blue" ];\n  "KlerosCoreBase.isSupported" [ label = "isSupported", color = "blue" ];\n  "KlerosCoreBase.getTimesPerPeriod" [ label = "getTimesPerPeriod", color = "blue" ];\n  "KlerosCoreBase.getNumberOfVotes" [ label = "getNumberOfVotes", color = "blue" ];\n  "KlerosCoreBase.isDisputeKitJumping" [ label = "isDisputeKitJumping", color = "blue" ];\n  "KlerosCoreBase.getDisputeKitsLength" [ label = "getDisputeKitsLength", color = "blue" ];\n  "KlerosCoreBase.convertEthToTokenAmount" [ label = "convertEthToTokenAmount" ];\n  "KlerosCoreBase._transferFeeToken" [ label = "_transferFeeToken" ];\n  "KlerosCoreBase._applyCoherence" [ label = "_applyCoherence" ];\n  "KlerosCoreBase._calculatePnkAtStake" [ label = "_calculatePnkAtStake" ];\n  "KlerosCoreBase._enableDisputeKit" [ label = "_enableDisputeKit" ];\n  "KlerosCoreBase._setStake" [ label = "_setStake" ];\n  "KlerosCoreBase._stakingFailed" [ label = "_stakingFailed" ];\n  "KlerosCoreBase._extraDataToCourtIDMinJurorsDisputeKit" [ label = "_extraDataToCourtIDMinJurorsDisputeKit" ];\n  "KlerosCoreBase.GovernorOnly" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.GuardianOrGovernorOnly" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.WhenPausedOnly" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.WhenNotPausedOnly" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.UnsuccessfulCall" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.MinStakeLowerThanParentCourt" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.UnsupportedDisputeKit" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.InvalidForkingCourtAsParent" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.WrongDisputeKitIndex" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.MustSupportDisputeKitClassic" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.CannotDisableClassicDK" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.address" [ label = "address" ];\n  "KlerosCoreBase.SortitionModuleOnly" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.ArbitrationFeesNotEnough" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.TokenNotAccepted" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.TransferFailed" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.DisputeKitNotSupportedByCourt" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.IERC20" [ label = "IERC20" ];\n  "KlerosCoreBase.EvidenceNotPassedAndNotAppeal" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.DisputeStillDrawing" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.CommitPeriodNotPassed" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.VotePeriodNotPassed" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.AppealPeriodNotPassed" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.DisputePeriodIsFinal" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.NotEvidencePeriod" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.AppealFeesNotEnough" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.DisputeNotAppealable" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.DisputeKitOnly" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.NotExecutionPeriod" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.payable" [ label = "payable" ];\n  "KlerosCoreBase.RulingAlreadyExecuted" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.StakingTransferFailed" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.UnstakingTransferFailed" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.StakingInTooManyCourts" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.StakingNotPossibleInThisCourt" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.StakingLessThanCourtMinStake" [ color = "brown2", shape =box ];\n  "KlerosCoreBase.StakingZeroWhenNoStake" [ color = "brown2", shape =box ];\n}\n\nsubgraph "clusterKlerosCoreNeo" {\n  graph [ label = "KlerosCoreNeo", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "KlerosCoreNeo.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "KlerosCoreNeo.initialize" [ label = "initialize", color = "blue" ];\n  "KlerosCoreNeo.reinitialize" [ label = "reinitialize", color = "blue" ];\n  "KlerosCoreNeo._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "KlerosCoreNeo.changeJurorNft" [ label = "changeJurorNft", color = "blue" ];\n  "KlerosCoreNeo.changeArbitrableWhitelist" [ label = "changeArbitrableWhitelist", color = "blue" ];\n  "KlerosCoreBase.setStake" [ label = "setStake", color = "blue" ];\n  "KlerosCoreBase._createDispute" [ label = "_createDispute", color = "white" ];\n  "KlerosCoreBase._stakingFailed" [ label = "_stakingFailed", color = "white" ];\n  "KlerosCoreNeo._disableInitializers" [ label = "_disableInitializers" ];\n  "KlerosCoreNeo.NotEligibleForStaking" [ color = "brown2", shape =box ];\n  "KlerosCoreNeo.ArbitrableNotWhitelisted" [ color = "brown2", shape =box ];\n  "KlerosCoreNeo.StakingMoreThanMaxStakePerJuror" [ color = "brown2", shape =box ];\n  "KlerosCoreNeo.StakingMoreThanMaxTotalStaked" [ color = "brown2", shape =box ];\n}\n\nsubgraph "clusterPolicyRegistry" {\n  graph [ label = "PolicyRegistry", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "PolicyRegistry.onlyByGovernor" [ label = "onlyByGovernor", color = "yellow" ];\n  "PolicyRegistry.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "PolicyRegistry.initialize" [ label = "initialize", color = "blue" ];\n  "PolicyRegistry.initialize2" [ label = "initialize2", color = "blue" ];\n  "PolicyRegistry._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "PolicyRegistry.changeGovernor" [ label = "changeGovernor", color = "blue" ];\n  "PolicyRegistry.setPolicy" [ label = "setPolicy", color = "blue" ];\n  "PolicyRegistry._disableInitializers" [ label = "_disableInitializers" ];\n}\n\nsubgraph "clusterSortitionModule" {\n  graph [ label = "SortitionModule", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "SortitionModule.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "SortitionModule.initialize" [ label = "initialize", color = "blue" ];\n  "SortitionModule.initialize4" [ label = "initialize4", color = "blue" ];\n  "SortitionModule._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "SortitionModule._disableInitializers" [ label = "_disableInitializers" ];\n  "SortitionModule.__SortitionModuleBase_initialize" [ label = "__SortitionModuleBase_initialize" ];\n}\n\nsubgraph "clusterSortitionModuleBase" {\n  graph [ label = "SortitionModuleBase", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "SortitionModuleBase.__SortitionModuleBase_initialize" [ label = "__SortitionModuleBase_initialize", color = "white" ];\n  "SortitionModuleBase.onlyByGovernor" [ label = "onlyByGovernor", color = "yellow" ];\n  "SortitionModuleBase.onlyByCore" [ label = "onlyByCore", color = "yellow" ];\n  "SortitionModuleBase.changeGovernor" [ label = "changeGovernor", color = "blue" ];\n  "SortitionModuleBase.changeMinStakingTime" [ label = "changeMinStakingTime", color = "blue" ];\n  "SortitionModuleBase.changeMaxDrawingTime" [ label = "changeMaxDrawingTime", color = "blue" ];\n  "SortitionModuleBase.changeRandomNumberGenerator" [ label = "changeRandomNumberGenerator", color = "blue" ];\n  "SortitionModuleBase.passPhase" [ label = "passPhase", color = "blue" ];\n  "ISortitionModule.createTree" [ label = "createTree", color = "blue" ];\n  "SortitionModuleBase.executeDelayedStakes" [ label = "executeDelayedStakes", color = "blue" ];\n  "ISortitionModule.createDisputeHook" [ label = "createDisputeHook", color = "blue" ];\n  "ISortitionModule.postDrawHook" [ label = "postDrawHook", color = "blue" ];\n  "SortitionModuleBase.notifyRandomNumber" [ label = "notifyRandomNumber", color = "green" ];\n  "ISortitionModule.validateStake" [ label = "validateStake", color = "blue" ];\n  "SortitionModuleBase._validateStake" [ label = "_validateStake" ];\n  "ISortitionModule.setStake" [ label = "setStake", color = "blue" ];\n  "SortitionModuleBase._setStake" [ label = "_setStake" ];\n  "ISortitionModule.lockStake" [ label = "lockStake", color = "blue" ];\n  "ISortitionModule.unlockStake" [ label = "unlockStake", color = "blue" ];\n  "ISortitionModule.penalizeStake" [ label = "penalizeStake", color = "blue" ];\n  "ISortitionModule.setJurorInactive" [ label = "setJurorInactive", color = "blue" ];\n  "SortitionModuleBase.withdrawLeftoverPNK" [ label = "withdrawLeftoverPNK", color = "blue" ];\n  "SortitionModuleBase.draw" [ label = "draw", color = "green" ];\n  "SortitionModuleBase.stakeOf" [ label = "stakeOf" ];\n  "SortitionModuleBase.getJurorBalance" [ label = "getJurorBalance", color = "blue" ];\n  "SortitionModuleBase.getJurorCourtIDs" [ label = "getJurorCourtIDs" ];\n  "SortitionModuleBase.isJurorStaked" [ label = "isJurorStaked", color = "blue" ];\n  "SortitionModuleBase.getJurorLeftoverPNK" [ label = "getJurorLeftoverPNK" ];\n  "SortitionModuleBase._updateParents" [ label = "_updateParents" ];\n  "SortitionModuleBase._stakePathIDToAccount" [ label = "_stakePathIDToAccount" ];\n  "SortitionModuleBase._extraDataToTreeK" [ label = "_extraDataToTreeK" ];\n  "SortitionModuleBase._set" [ label = "_set" ];\n  "SortitionModuleBase._accountAndCourtIDToStakePathID" [ label = "_accountAndCourtIDToStakePathID" ];\n  "SortitionModuleBase.address" [ label = "address" ];\n}\n\nsubgraph "clusterSortitionModuleNeo" {\n  graph [ label = "SortitionModuleNeo", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "SortitionModuleNeo.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "SortitionModuleNeo.initialize" [ label = "initialize", color = "blue" ];\n  "SortitionModuleNeo.initialize4" [ label = "initialize4", color = "blue" ];\n  "SortitionModuleNeo._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "SortitionModuleNeo.changeMaxStakePerJuror" [ label = "changeMaxStakePerJuror", color = "blue" ];\n  "SortitionModuleNeo.changeMaxTotalStaked" [ label = "changeMaxTotalStaked", color = "blue" ];\n  "SortitionModuleBase._validateStake" [ label = "_validateStake", color = "white" ];\n  "SortitionModuleNeo._disableInitializers" [ label = "_disableInitializers" ];\n  "SortitionModuleNeo.__SortitionModuleBase_initialize" [ label = "__SortitionModuleBase_initialize" ];\n}\n\nsubgraph "clusterDisputeResolver" {\n  graph [ label = "DisputeResolver", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "DisputeResolver.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "DisputeResolver.changeGovernor" [ label = "changeGovernor", color = "blue" ];\n  "DisputeResolver.changeArbitrator" [ label = "changeArbitrator", color = "blue" ];\n  "DisputeResolver.changeTemplateRegistry" [ label = "changeTemplateRegistry", color = "blue" ];\n  "DisputeResolver.createDisputeForTemplate" [ label = "createDisputeForTemplate", color = "blue" ];\n  "DisputeResolver.createDisputeForTemplateUri" [ label = "createDisputeForTemplateUri", color = "blue" ];\n  "DisputeResolver.rule" [ label = "rule", color = "blue" ];\n  "DisputeResolver._createDispute" [ label = "_createDispute" ];\n  "DisputeResolver.address" [ label = "address" ];\n}\n\nsubgraph "clusterDisputeTemplateRegistry" {\n  graph [ label = "DisputeTemplateRegistry", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "DisputeTemplateRegistry.onlyByGovernor" [ label = "onlyByGovernor", color = "yellow" ];\n  "DisputeTemplateRegistry.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "DisputeTemplateRegistry.initialize" [ label = "initialize", color = "blue" ];\n  "DisputeTemplateRegistry.initialize2" [ label = "initialize2", color = "blue" ];\n  "DisputeTemplateRegistry._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "DisputeTemplateRegistry.changeGovernor" [ label = "changeGovernor", color = "blue" ];\n  "IDisputeTemplateRegistry.setDisputeTemplate" [ label = "setDisputeTemplate", color = "blue" ];\n  "DisputeTemplateRegistry._disableInitializers" [ label = "_disableInitializers" ];\n}\n\nsubgraph "clusterDisputeKitClassic" {\n  graph [ label = "DisputeKitClassic", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "DisputeKitClassic.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "DisputeKitClassic.initialize" [ label = "initialize", color = "blue" ];\n  "DisputeKitClassic.reinitialize" [ label = "reinitialize", color = "blue" ];\n  "DisputeKitClassic._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "DisputeKitClassic._disableInitializers" [ label = "_disableInitializers" ];\n  "DisputeKitClassic.__DisputeKitClassicBase_initialize" [ label = "__DisputeKitClassicBase_initialize" ];\n}\n\nsubgraph "clusterDisputeKitClassicBase" {\n  graph [ label = "DisputeKitClassicBase", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "DisputeKitClassicBase.onlyByGovernor" [ label = "onlyByGovernor", color = "yellow" ];\n  "DisputeKitClassicBase.onlyByCore" [ label = "onlyByCore", color = "yellow" ];\n  "DisputeKitClassicBase.notJumped" [ label = "notJumped", color = "yellow" ];\n  "DisputeKitClassicBase.__DisputeKitClassicBase_initialize" [ label = "__DisputeKitClassicBase_initialize", color = "white" ];\n  "DisputeKitClassicBase.executeGovernorProposal" [ label = "executeGovernorProposal", color = "blue" ];\n  "DisputeKitClassicBase.changeGovernor" [ label = "changeGovernor", color = "blue" ];\n  "DisputeKitClassicBase.changeCore" [ label = "changeCore", color = "blue" ];\n  "IDisputeKit.createDispute" [ label = "createDispute", color = "blue" ];\n  "IDisputeKit.draw" [ label = "draw", color = "blue" ];\n  "DisputeKitClassicBase.castCommit" [ label = "castCommit", color = "blue" ];\n  "DisputeKitClassicBase._castCommit" [ label = "_castCommit" ];\n  "DisputeKitClassicBase.castVote" [ label = "castVote", color = "blue" ];\n  "DisputeKitClassicBase._castVote" [ label = "_castVote" ];\n  "DisputeKitClassicBase.fundAppeal" [ label = "fundAppeal", color = "blue" ];\n  "DisputeKitClassicBase.withdrawFeesAndRewards" [ label = "withdrawFeesAndRewards", color = "blue" ];\n  "DisputeKitClassicBase.hashVote" [ label = "hashVote" ];\n  "DisputeKitClassicBase.getFundedChoices" [ label = "getFundedChoices" ];\n  "IDisputeKit.currentRuling" [ label = "currentRuling", color = "blue" ];\n  "IDisputeKit.getDegreeOfCoherence" [ label = "getDegreeOfCoherence", color = "blue" ];\n  "IDisputeKit.getCoherentCount" [ label = "getCoherentCount", color = "blue" ];\n  "DisputeKitClassicBase.areCommitsAllCast" [ label = "areCommitsAllCast", color = "blue" ];\n  "DisputeKitClassicBase.areVotesAllCast" [ label = "areVotesAllCast", color = "blue" ];\n  "DisputeKitClassicBase.isAppealFunded" [ label = "isAppealFunded", color = "blue" ];\n  "IDisputeKit.isVoteActive" [ label = "isVoteActive", color = "blue" ];\n  "DisputeKitClassicBase.getRoundInfo" [ label = "getRoundInfo", color = "blue" ];\n  "DisputeKitClassicBase.getNumberOfRounds" [ label = "getNumberOfRounds", color = "blue" ];\n  "DisputeKitClassicBase.getLocalDisputeRoundID" [ label = "getLocalDisputeRoundID", color = "blue" ];\n  "DisputeKitClassicBase.getVoteInfo" [ label = "getVoteInfo", color = "blue" ];\n  "DisputeKitClassicBase._postDrawCheck" [ label = "_postDrawCheck" ];\n  "DisputeKitClassicBase.address" [ label = "address" ];\n  "DisputeKitClassicBase.payable" [ label = "payable" ];\n}\n\nsubgraph "clusterIBalanceHolder" {\n  graph [ label = "IBalanceHolder  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "IBalanceHolder.balanceOf" [ label = "balanceOf", color = "blue" ];\n}\n\nsubgraph "clusterIBalanceHolderERC1155" {\n  graph [ label = "IBalanceHolderERC1155  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "IBalanceHolderERC1155.balanceOf" [ label = "balanceOf", color = "blue" ];\n}\n\nsubgraph "clusterDisputeKitGated" {\n  graph [ label = "DisputeKitGated", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "DisputeKitGated.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "DisputeKitGated.initialize" [ label = "initialize", color = "blue" ];\n  "DisputeKitGated.reinitialize" [ label = "reinitialize", color = "blue" ];\n  "DisputeKitGated._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "DisputeKitGated.extraDataToTokenInfo" [ label = "extraDataToTokenInfo", color = "green" ];\n  "DisputeKitClassicBase._postDrawCheck" [ label = "_postDrawCheck", color = "white" ];\n  "DisputeKitGated._disableInitializers" [ label = "_disableInitializers" ];\n  "DisputeKitGated.__DisputeKitClassicBase_initialize" [ label = "__DisputeKitClassicBase_initialize" ];\n}\n\nsubgraph "clusterDisputeKitGatedShutter" {\n  graph [ label = "DisputeKitGatedShutter", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "DisputeKitGatedShutter.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "DisputeKitGatedShutter.initialize" [ label = "initialize", color = "blue" ];\n  "DisputeKitGatedShutter.reinitialize" [ label = "reinitialize", color = "blue" ];\n  "DisputeKitGatedShutter._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "DisputeKitGatedShutter.castCommitShutter" [ label = "castCommitShutter", color = "blue" ];\n  "DisputeKitGatedShutter.castVoteShutter" [ label = "castVoteShutter", color = "blue" ];\n  "DisputeKitClassicBase.hashVote" [ label = "hashVote", color = "green" ];\n  "DisputeKitGatedShutter._extraDataToTokenInfo" [ label = "_extraDataToTokenInfo", color = "white" ];\n  "DisputeKitClassicBase._postDrawCheck" [ label = "_postDrawCheck", color = "white" ];\n  "DisputeKitGatedShutter._disableInitializers" [ label = "_disableInitializers" ];\n  "DisputeKitGatedShutter.__DisputeKitClassicBase_initialize" [ label = "__DisputeKitClassicBase_initialize" ];\n}\n\nsubgraph "clusterDisputeKitShutter" {\n  graph [ label = "DisputeKitShutter", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "DisputeKitShutter.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "DisputeKitShutter.initialize" [ label = "initialize", color = "blue" ];\n  "DisputeKitShutter.reinitialize" [ label = "reinitialize", color = "blue" ];\n  "DisputeKitShutter._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "DisputeKitShutter.castCommitShutter" [ label = "castCommitShutter", color = "blue" ];\n  "DisputeKitShutter.castVoteShutter" [ label = "castVoteShutter", color = "blue" ];\n  "DisputeKitClassicBase.hashVote" [ label = "hashVote", color = "green" ];\n  "DisputeKitShutter._disableInitializers" [ label = "_disableInitializers" ];\n  "DisputeKitShutter.__DisputeKitClassicBase_initialize" [ label = "__DisputeKitClassicBase_initialize" ];\n}\n\nsubgraph "clusterIProofOfHumanity" {\n  graph [ label = "IProofOfHumanity  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "IProofOfHumanity.isRegistered" [ label = "isRegistered" ];\n}\n\nsubgraph "clusterDisputeKitSybilResistant" {\n  graph [ label = "DisputeKitSybilResistant", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "DisputeKitSybilResistant.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "DisputeKitSybilResistant.initialize" [ label = "initialize", color = "blue" ];\n  "DisputeKitSybilResistant._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "DisputeKitClassicBase._postDrawCheck" [ label = "_postDrawCheck", color = "white" ];\n  "DisputeKitSybilResistant._disableInitializers" [ label = "_disableInitializers" ];\n  "DisputeKitSybilResistant.__DisputeKitClassicBase_initialize" [ label = "__DisputeKitClassicBase_initialize" ];\n}\n\nsubgraph "clusterEvidenceModule" {\n  graph [ label = "EvidenceModule", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "EvidenceModule.onlyByGovernor" [ label = "onlyByGovernor", color = "yellow" ];\n  "EvidenceModule.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "EvidenceModule.initialize" [ label = "initialize", color = "blue" ];\n  "EvidenceModule.initialize2" [ label = "initialize2", color = "blue" ];\n  "EvidenceModule._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "EvidenceModule.submitEvidence" [ label = "submitEvidence", color = "blue" ];\n  "EvidenceModule._disableInitializers" [ label = "_disableInitializers" ];\n}\n\nsubgraph "clusterIArbitrableV2" {\n  graph [ label = "IArbitrableV2  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "IArbitrableV2.rule" [ label = "rule", color = "blue" ];\n}\n\nsubgraph "clusterIArbitratorV2" {\n  graph [ label = "IArbitratorV2  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "IArbitratorV2.createDispute" [ label = "createDispute", color = "blue" ];\n  "IArbitratorV2.arbitrationCost" [ label = "arbitrationCost", color = "blue" ];\n  "IArbitratorV2.currentRuling" [ label = "currentRuling", color = "blue" ];\n}\n\nsubgraph "clusterIDisputeKit" {\n  graph [ label = "IDisputeKit  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "IDisputeKit.createDispute" [ label = "createDispute", color = "blue" ];\n  "IDisputeKit.draw" [ label = "draw", color = "blue" ];\n  "IDisputeKit.getCoherentCount" [ label = "getCoherentCount", color = "blue" ];\n  "IDisputeKit.getDegreeOfCoherence" [ label = "getDegreeOfCoherence", color = "blue" ];\n  "IDisputeKit.isVoteActive" [ label = "isVoteActive", color = "blue" ];\n  "IDisputeKit.currentRuling" [ label = "currentRuling", color = "blue" ];\n  "IDisputeKit.areCommitsAllCast" [ label = "areCommitsAllCast", color = "blue" ];\n  "IDisputeKit.areVotesAllCast" [ label = "areVotesAllCast", color = "blue" ];\n  "IDisputeKit.isAppealFunded" [ label = "isAppealFunded", color = "blue" ];\n  "IDisputeKit.getRoundInfo" [ label = "getRoundInfo", color = "blue" ];\n  "IDisputeKit.getVoteInfo" [ label = "getVoteInfo", color = "blue" ];\n}\n\nsubgraph "clusterIDisputeTemplateRegistry" {\n  graph [ label = "IDisputeTemplateRegistry  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "IDisputeTemplateRegistry.setDisputeTemplate" [ label = "setDisputeTemplate", color = "blue" ];\n}\n\nsubgraph "clusterIEvidence" {\n  graph [ label = "IEvidence  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n}\n\nsubgraph "clusterISortitionModule" {\n  graph [ label = "ISortitionModule  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "ISortitionModule.createTree" [ label = "createTree", color = "blue" ];\n  "ISortitionModule.createDisputeHook" [ label = "createDisputeHook", color = "blue" ];\n  "ISortitionModule.lockStake" [ label = "lockStake", color = "blue" ];\n  "ISortitionModule.postDrawHook" [ label = "postDrawHook", color = "blue" ];\n  "ISortitionModule.unlockStake" [ label = "unlockStake", color = "blue" ];\n  "ISortitionModule.penalizeStake" [ label = "penalizeStake", color = "blue" ];\n  "ISortitionModule.setJurorInactive" [ label = "setJurorInactive", color = "blue" ];\n  "ISortitionModule.validateStake" [ label = "validateStake", color = "blue" ];\n  "ISortitionModule.setStake" [ label = "setStake", color = "blue" ];\n  "ISortitionModule.draw" [ label = "draw", color = "blue" ];\n  "ISortitionModule.notifyRandomNumber" [ label = "notifyRandomNumber", color = "blue" ];\n  "ISortitionModule.getJurorBalance" [ label = "getJurorBalance", color = "blue" ];\n  "ISortitionModule.getJurorCourtIDs" [ label = "getJurorCourtIDs", color = "blue" ];\n  "ISortitionModule.isJurorStaked" [ label = "isJurorStaked", color = "blue" ];\n  "ISortitionModule.getJurorLeftoverPNK" [ label = "getJurorLeftoverPNK", color = "blue" ];\n  "ISortitionModule.withdrawLeftoverPNK" [ label = "withdrawLeftoverPNK", color = "blue" ];\n}\n\nsubgraph "clusterSafeERC20" {\n  graph [ label = "SafeERC20  (lib)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "SafeERC20.increaseAllowance" [ label = "increaseAllowance", color = "white" ];\n  "SafeERC20.safeTransfer" [ label = "safeTransfer", color = "white" ];\n  "SafeERC20.safeTransferFrom" [ label = "safeTransferFrom", color = "white" ];\n  "SafeERC20.address" [ label = "address" ];\n}\n\nsubgraph "clusterWethLike" {\n  graph [ label = "WethLike  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "WethLike.deposit" [ label = "deposit", color = "blue" ];\n  "WethLike.transfer" [ label = "transfer", color = "blue" ];\n}\n\nsubgraph "clusterSafeSend" {\n  graph [ label = "SafeSend  (lib)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "SafeSend.safeSend" [ label = "safeSend", color = "white" ];\n}\n\nsubgraph "clusterRNGWithFallback" {\n  graph [ label = "RNGWithFallback", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "RNGWithFallback.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "RNGWithFallback.onlyByGovernor" [ label = "onlyByGovernor", color = "yellow" ];\n  "RNGWithFallback.onlyByConsumer" [ label = "onlyByConsumer", color = "yellow" ];\n  "RNGWithFallback.changeGovernor" [ label = "changeGovernor", color = "blue" ];\n  "RNGWithFallback.changeConsumer" [ label = "changeConsumer", color = "blue" ];\n  "RNGWithFallback.changeFallbackTimeout" [ label = "changeFallbackTimeout", color = "blue" ];\n  "IRNG.requestRandomness" [ label = "requestRandomness", color = "blue" ];\n  "IRNG.receiveRandomness" [ label = "receiveRandomness", color = "blue" ];\n  "RNGWithFallback.address" [ label = "address" ];\n  "RNGWithFallback.blockhash" [ label = "blockhash" ];\n}\n\nsubgraph "clusterChainlinkRNG" {\n  graph [ label = "ChainlinkRNG", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "ChainlinkRNG.onlyByGovernor" [ label = "onlyByGovernor", color = "yellow" ];\n  "ChainlinkRNG.onlyByConsumer" [ label = "onlyByConsumer", color = "yellow" ];\n  "ChainlinkRNG.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "ChainlinkRNG.changeGovernor" [ label = "changeGovernor", color = "blue" ];\n  "ChainlinkRNG.changeConsumer" [ label = "changeConsumer", color = "blue" ];\n  "ChainlinkRNG.changeVrfCoordinator" [ label = "changeVrfCoordinator", color = "blue" ];\n  "ChainlinkRNG.changeKeyHash" [ label = "changeKeyHash", color = "blue" ];\n  "ChainlinkRNG.changeSubscriptionId" [ label = "changeSubscriptionId", color = "blue" ];\n  "ChainlinkRNG.changeRequestConfirmations" [ label = "changeRequestConfirmations", color = "blue" ];\n  "ChainlinkRNG.changeCallbackGasLimit" [ label = "changeCallbackGasLimit", color = "blue" ];\n  "IRNG.requestRandomness" [ label = "requestRandomness", color = "blue" ];\n  "ChainlinkRNG.fulfillRandomWords" [ label = "fulfillRandomWords", color = "white" ];\n  "IRNG.receiveRandomness" [ label = "receiveRandomness", color = "blue" ];\n  "ChainlinkRNG.IVRFCoordinatorV2Plus" [ label = "IVRFCoordinatorV2Plus" ];\n  "ChainlinkRNG.CoordinatorSet" [ label = "CoordinatorSet" ];\n}\n\nsubgraph "clusterIRNG" {\n  graph [ label = "IRNG  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "IRNG.requestRandomness" [ label = "requestRandomness", color = "blue" ];\n  "IRNG.receiveRandomness" [ label = "receiveRandomness", color = "blue" ];\n}\n\nsubgraph "clusterUUPSProxiable" {\n  graph [ label = "UUPSProxiable", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "UUPSProxiable._authorizeUpgrade" [ label = "_authorizeUpgrade" ];\n  "UUPSProxiable.upgradeToAndCall" [ label = "upgradeToAndCall", color = "green" ];\n  "UUPSProxiable.proxiableUUID" [ label = "proxiableUUID", color = "blue" ];\n  "UUPSProxiable.version" [ label = "version", color = "blue" ];\n  "UUPSProxiable._getImplementation" [ label = "_getImplementation" ];\n  "UUPSProxiable.address" [ label = "address" ];\n  "UUPSProxiable.UUPSUnauthorizedCallContext" [ color = "brown2", shape =box ];\n  "UUPSProxiable.UUPSUnsupportedProxiableUUID" [ color = "brown2", shape =box ];\n  "UUPSProxiable.FailedDelegateCall" [ color = "brown2", shape =box ];\n  "UUPSProxiable.InvalidImplementation" [ color = "brown2", shape =box ];\n}\n\nsubgraph "clusterUUPSProxy" {\n  graph [ label = "UUPSProxy", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "UUPSProxy.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "UUPSProxy._delegate" [ label = "_delegate" ];\n  "UUPSProxy._getImplementation" [ label = "_getImplementation" ];\n  "UUPSProxy.<Fallback>" [ label = "<Fallback>", color = "blue" ];\n  "UUPSProxy.<Receive Ether>" [ label = "<Receive Ether>", color = "blue" ];\n}\n\nsubgraph "clusterInitializable" {\n  graph [ label = "Initializable", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "Initializable.initializer" [ label = "initializer", color = "yellow" ];\n  "Initializable.reinitializer" [ label = "reinitializer", color = "yellow" ];\n  "Initializable.onlyInitializing" [ label = "onlyInitializing", color = "yellow" ];\n  "Initializable._checkInitializing" [ label = "_checkInitializing" ];\n  "Initializable._disableInitializers" [ label = "_disableInitializers", color = "white" ];\n  "Initializable._getInitializedVersion" [ label = "_getInitializedVersion", color = "white" ];\n  "Initializable._isInitializing" [ label = "_isInitializing" ];\n  "Initializable._getInitializableStorage" [ label = "_getInitializableStorage" ];\n  "Initializable.address" [ label = "address" ];\n  "Initializable.AlreadyInitialized" [ color = "brown2", shape =box ];\n  "Initializable.NotInitializing" [ color = "brown2", shape =box ];\n  "Initializable.type" [ label = "type" ];\n}\n\nsubgraph "clusterIERC20" {\n  graph [ label = "IERC20", color = "lightgray" ];\n  "IERC20.safeTransfer" [ label = "safeTransfer" ];\n  "IERC20.safeTransferFrom" [ label = "safeTransferFrom" ];\n  "IERC20.approve" [ label = "approve" ];\n  "IERC20.allowance" [ label = "allowance" ];\n  "IERC20.UTION: When used with inheritance, manual care" [ label = "UTION: When used with inheritance, manual care" ];\n  "IERC20.utomatically lock it when it is deployed:\n *\n * ```\n * //" [ label = "utomatically lock it when it is deployed:\n *\n * ```\n * //" ];\n}\n\nsubgraph "cluster_recipient" {\n  graph [ label = "_recipient", color = "lightgray" ];\n  "_recipient.safeSend" [ label = "safeSend" ];\n}\n\nsubgraph "clusterIERC721" {\n  graph [ label = "IERC721", color = "lightgray" ];\n  "IERC721.balanceOf" [ label = "balanceOf" ];\n}\n\nsubgraph "cluster_beneficiary" {\n  graph [ label = "_beneficiary", color = "lightgray" ];\n  "_beneficiary.safeSend" [ label = "safeSend" ];\n}\n\nsubgraph "clusterabi" {\n  graph [ label = "abi", color = "lightgray" ];\n  "abi.encodeCall" [ label = "encodeCall" ];\n}\n\nsubgraph "cluster_to" {\n  graph [ label = "_to", color = "lightgray" ];\n  "_to.send" [ label = "send" ];\n}\n\nsubgraph "clusters_vrfCoordinator" {\n  graph [ label = "s_vrfCoordinator", color = "lightgray" ];\n  "s_vrfCoordinator.requestRandomWords" [ label = "requestRandomWords" ];\n}\n\nsubgraph "clusterVRFV2PlusClient" {\n  graph [ label = "VRFV2PlusClient", color = "lightgray" ];\n  "VRFV2PlusClient.RandomWordsRequest" [ label = "RandomWordsRequest" ];\n  "VRFV2PlusClient._argsToBytes" [ label = "_argsToBytes" ];\n  "VRFV2PlusClient.ExtraArgsV1" [ label = "ExtraArgsV1" ];\n}\n\nsubgraph "clusternewImplementation" {\n  graph [ label = "newImplementation", color = "lightgray" ];\n  "newImplementation.delegatecall" [ label = "delegatecall" ];\n}\n\nsubgraph "cluster_implementation" {\n  graph [ label = "_implementation", color = "lightgray" ];\n  "_implementation.delegatecall" [ label = "delegatecall" ];\n}\n\n  "KlerosCore.<Constructor>";\n  "KlerosCore._disableInitializers";\n  "KlerosCore.initialize";\n  "KlerosCore.__KlerosCoreBase_initialize";\n  "KlerosCoreBase.onlyByGovernor";\n  "KlerosCoreBase.GovernorOnly";\n  "KlerosCoreBase.onlyByGuardianOrGovernor";\n  "KlerosCoreBase.GuardianOrGovernorOnly";\n  "KlerosCoreBase.whenPaused";\n  "KlerosCoreBase.WhenPausedOnly";\n  "KlerosCoreBase.whenNotPaused";\n  "KlerosCoreBase.WhenNotPausedOnly";\n  "KlerosCoreBase.__KlerosCoreBase_initialize";\n  "ISortitionModule.createTree";\n  "KlerosCoreBase._enableDisputeKit";\n  "KlerosCoreBase.executeGovernorProposal";\n  "KlerosCoreBase.UnsuccessfulCall";\n  "KlerosCoreBase.createCourt";\n  "KlerosCoreBase.MinStakeLowerThanParentCourt";\n  "KlerosCoreBase.UnsupportedDisputeKit";\n  "KlerosCoreBase.InvalidForkingCourtAsParent";\n  "KlerosCoreBase.WrongDisputeKitIndex";\n  "KlerosCoreBase.MustSupportDisputeKitClassic";\n  "KlerosCoreBase.changeCourtParameters";\n  "KlerosCoreBase.enableDisputeKits";\n  "KlerosCoreBase.CannotDisableClassicDK";\n  "KlerosCoreBase.setStake";\n  "KlerosCoreBase._setStake";\n  "KlerosCoreBase.setStakeBySortitionModule";\n  "KlerosCoreBase.address";\n  "KlerosCoreBase.SortitionModuleOnly";\n  "KlerosCoreBase.transferBySortitionModule";\n  "IERC20.safeTransfer";\n  "KlerosCoreBase.createDispute";\n  "KlerosCoreBase.arbitrationCost";\n  "KlerosCoreBase.ArbitrationFeesNotEnough";\n  "KlerosCoreBase._createDispute";\n  "KlerosCoreBase.TokenNotAccepted";\n  "IERC20.safeTransferFrom";\n  "KlerosCoreBase.TransferFailed";\n  "KlerosCoreBase._extraDataToCourtIDMinJurorsDisputeKit";\n  "KlerosCoreBase.DisputeKitNotSupportedByCourt";\n  "KlerosCoreBase.convertEthToTokenAmount";\n  "KlerosCoreBase._calculatePnkAtStake";\n  "KlerosCoreBase.IERC20";\n  "ISortitionModule.createDisputeHook";\n  "IDisputeKit.createDispute";\n  "KlerosCoreBase.passPeriod";\n  "KlerosCoreBase.EvidenceNotPassedAndNotAppeal";\n  "KlerosCoreBase.DisputeStillDrawing";\n  "KlerosCoreBase.CommitPeriodNotPassed";\n  "KlerosCoreBase.VotePeriodNotPassed";\n  "KlerosCoreBase.AppealPeriodNotPassed";\n  "KlerosCoreBase.DisputePeriodIsFinal";\n  "KlerosCoreBase.draw";\n  "KlerosCoreBase.NotEvidencePeriod";\n  "IDisputeKit.draw";\n  "ISortitionModule.lockStake";\n  "ISortitionModule.postDrawHook";\n  "KlerosCoreBase.appeal";\n  "KlerosCoreBase.appealCost";\n  "KlerosCoreBase.AppealFeesNotEnough";\n  "KlerosCoreBase.DisputeNotAppealable";\n  "KlerosCoreBase.DisputeKitOnly";\n  "KlerosCoreBase.execute";\n  "KlerosCoreBase.NotExecutionPeriod";\n  "IDisputeKit.getCoherentCount";\n  "KlerosCoreBase._executePenalties";\n  "KlerosCoreBase._executeRewards";\n  "IDisputeKit.getDegreeOfCoherence";\n  "ISortitionModule.unlockStake";\n  "ISortitionModule.penalizeStake";\n  "IDisputeKit.isVoteActive";\n  "ISortitionModule.setJurorInactive";\n  "KlerosCoreBase._transferFeeToken";\n  "KlerosCoreBase.payable";\n  "KlerosCoreBase._applyCoherence";\n  "KlerosCoreBase.executeRuling";\n  "KlerosCoreBase.RulingAlreadyExecuted";\n  "KlerosCoreBase.currentRuling";\n  "IDisputeKit.currentRuling";\n  "_recipient.safeSend";\n  "KlerosCoreBase._stakingFailed";\n  "ISortitionModule.validateStake";\n  "ISortitionModule.setStake";\n  "KlerosCoreBase.StakingTransferFailed";\n  "KlerosCoreBase.UnstakingTransferFailed";\n  "KlerosCoreBase.StakingInTooManyCourts";\n  "KlerosCoreBase.StakingNotPossibleInThisCourt";\n  "KlerosCoreBase.StakingLessThanCourtMinStake";\n  "KlerosCoreBase.StakingZeroWhenNoStake";\n  "KlerosCoreNeo.<Constructor>";\n  "KlerosCoreNeo._disableInitializers";\n  "KlerosCoreNeo.initialize";\n  "IERC721.balanceOf";\n  "KlerosCoreNeo.NotEligibleForStaking";\n  "KlerosCoreNeo.ArbitrableNotWhitelisted";\n  "KlerosCoreNeo.StakingMoreThanMaxStakePerJuror";\n  "KlerosCoreNeo.StakingMoreThanMaxTotalStaked";\n  "PolicyRegistry.<Constructor>";\n  "PolicyRegistry._disableInitializers";\n  "SortitionModule.<Constructor>";\n  "SortitionModule._disableInitializers";\n  "SortitionModule.initialize";\n  "SortitionModule.__SortitionModuleBase_initialize";\n  "SortitionModuleBase.onlyByGovernor";\n  "SortitionModuleBase.address";\n  "SortitionModuleBase.onlyByCore";\n  "SortitionModuleBase.changeRandomNumberGenerator";\n  "IRNG.requestRandomness";\n  "SortitionModuleBase.passPhase";\n  "IRNG.receiveRandomness";\n  "SortitionModuleBase._extraDataToTreeK";\n  "SortitionModuleBase.executeDelayedStakes";\n  "SortitionModuleBase._validateStake";\n  "SortitionModuleBase.stakeOf";\n  "SortitionModuleBase._setStake";\n  "SortitionModuleBase._accountAndCourtIDToStakePathID";\n  "SortitionModuleBase._set";\n  "KlerosCore.courts";\n  "SortitionModuleBase.getJurorLeftoverPNK";\n  "SortitionModuleBase.getJurorCourtIDs";\n  "SortitionModuleBase.withdrawLeftoverPNK";\n  "SortitionModuleBase.draw";\n  "SortitionModuleBase._stakePathIDToAccount";\n  "SortitionModuleBase.getJurorBalance";\n  "SortitionModuleBase._updateParents";\n  "SortitionModuleNeo.<Constructor>";\n  "SortitionModuleNeo._disableInitializers";\n  "SortitionModuleNeo.initialize";\n  "SortitionModuleNeo.__SortitionModuleBase_initialize";\n  "DisputeResolver.createDisputeForTemplate";\n  "DisputeResolver._createDispute";\n  "DisputeResolver.createDisputeForTemplateUri";\n  "DisputeResolver.rule";\n  "DisputeResolver.address";\n  "IDisputeTemplateRegistry.setDisputeTemplate";\n  "DisputeTemplateRegistry.<Constructor>";\n  "DisputeTemplateRegistry._disableInitializers";\n  "DisputeKitClassic.<Constructor>";\n  "DisputeKitClassic._disableInitializers";\n  "DisputeKitClassic.initialize";\n  "DisputeKitClassic.__DisputeKitClassicBase_initialize";\n  "DisputeKitClassicBase.onlyByCore";\n  "DisputeKitClassicBase.address";\n  "KlerosCore.getNumberOfRounds";\n  "KlerosCore.sortitionModule";\n  "KlerosCore.disputes";\n  "ISortitionModule.draw";\n  "DisputeKitClassicBase._postDrawCheck";\n  "DisputeKitClassicBase.castCommit";\n  "DisputeKitClassicBase._castCommit";\n  "DisputeKitClassicBase.castVote";\n  "DisputeKitClassicBase._castVote";\n  "DisputeKitClassicBase.hashVote";\n  "DisputeKitClassicBase.fundAppeal";\n  "KlerosCore.appealPeriod";\n  "KlerosCore.isDisputeKitJumping";\n  "KlerosCore.getNumberOfVotes";\n  "DisputeKitClassicBase.payable";\n  "DisputeKitClassicBase.withdrawFeesAndRewards";\n  "KlerosCore.paused";\n  "_beneficiary.safeSend";\n  "DisputeKitClassicBase.getFundedChoices";\n  "DisputeKitClassicBase.areVotesAllCast";\n  "DisputeKitClassicBase.isAppealFunded";\n  "DisputeKitGated.<Constructor>";\n  "DisputeKitGated._disableInitializers";\n  "DisputeKitGated.initialize";\n  "DisputeKitGated.__DisputeKitClassicBase_initialize";\n  "DisputeKitGated.extraDataToTokenInfo";\n  "DisputeKitGatedShutter.<Constructor>";\n  "DisputeKitGatedShutter._disableInitializers";\n  "DisputeKitGatedShutter.initialize";\n  "DisputeKitGatedShutter.__DisputeKitClassicBase_initialize";\n  "DisputeKitGatedShutter.castCommitShutter";\n  "DisputeKitGatedShutter.castVoteShutter";\n  "DisputeKitGatedShutter._extraDataToTokenInfo";\n  "DisputeKitShutter.<Constructor>";\n  "DisputeKitShutter._disableInitializers";\n  "DisputeKitShutter.initialize";\n  "DisputeKitShutter.__DisputeKitClassicBase_initialize";\n  "DisputeKitShutter.castCommitShutter";\n  "DisputeKitShutter.castVoteShutter";\n  "DisputeKitSybilResistant.<Constructor>";\n  "DisputeKitSybilResistant._disableInitializers";\n  "DisputeKitSybilResistant.initialize";\n  "DisputeKitSybilResistant.__DisputeKitClassicBase_initialize";\n  "IProofOfHumanity.isRegistered";\n  "EvidenceModule.<Constructor>";\n  "EvidenceModule._disableInitializers";\n  "SafeERC20.increaseAllowance";\n  "IERC20.approve";\n  "IERC20.allowance";\n  "SafeERC20.address";\n  "SafeERC20.safeTransfer";\n  "IERC20.UTION: When used with inheritance, manual care";\n  "abi.encodeCall";\n  "SafeERC20.safeTransferFrom";\n  "IERC20.utomatically lock it when it is deployed:\n *\n * ```\n * //";\n  "SafeSend.safeSend";\n  "_to.send";\n  "RNGWithFallback.<Constructor>";\n  "RNGWithFallback.address";\n  "RNGWithFallback.blockhash";\n  "ChainlinkRNG.changeVrfCoordinator";\n  "ChainlinkRNG.IVRFCoordinatorV2Plus";\n  "ChainlinkRNG.CoordinatorSet";\n  "s_vrfCoordinator.requestRandomWords";\n  "VRFV2PlusClient.RandomWordsRequest";\n  "VRFV2PlusClient._argsToBytes";\n  "VRFV2PlusClient.ExtraArgsV1";\n  "UUPSProxiable.upgradeToAndCall";\n  "UUPSProxiable._authorizeUpgrade";\n  "UUPSProxiable.address";\n  "UUPSProxiable._getImplementation";\n  "UUPSProxiable.UUPSUnauthorizedCallContext";\n  "UUPSProxiable.UUPSUnsupportedProxiableUUID";\n  "newImplementation.delegatecall";\n  "UUPSProxiable.FailedDelegateCall";\n  "UUPSProxiable.InvalidImplementation";\n  "UUPSProxiable.proxiableUUID";\n  "UUPSProxy.<Constructor>";\n  "_implementation.delegatecall";\n  "UUPSProxy.<Fallback>";\n  "UUPSProxy._delegate";\n  "UUPSProxy._getImplementation";\n  "UUPSProxy.<Receive Ether>";\n  "Initializable.initializer";\n  "Initializable._getInitializableStorage";\n  "Initializable.address";\n  "Initializable.AlreadyInitialized";\n  "Initializable.reinitializer";\n  "Initializable.onlyInitializing";\n  "Initializable._checkInitializing";\n  "Initializable._isInitializing";\n  "Initializable.NotInitializing";\n  "Initializable._disableInitializers";\n  "Initializable.type";\n  "Initializable._getInitializedVersion";\n  "KlerosCore.<Constructor>" -> "KlerosCore._disableInitializers" [ color = "green" ];\n  "KlerosCore.initialize" -> "KlerosCore.__KlerosCoreBase_initialize" [ color = "green" ];\n  "KlerosCoreBase.onlyByGovernor" -> "KlerosCoreBase.GovernorOnly" [ color = "red" ];\n  "KlerosCoreBase.onlyByGuardianOrGovernor" -> "KlerosCoreBase.GuardianOrGovernorOnly" [ color = "red" ];\n  "KlerosCoreBase.whenPaused" -> "KlerosCoreBase.WhenPausedOnly" [ color = "red" ];\n  "KlerosCoreBase.whenNotPaused" -> "KlerosCoreBase.WhenNotPausedOnly" [ color = "red" ];\n  "KlerosCoreBase.__KlerosCoreBase_initialize" -> "ISortitionModule.createTree" [ color = "orange" ];\n  "KlerosCoreBase.__KlerosCoreBase_initialize" -> "ISortitionModule.createTree" [ color = "orange" ];\n  "KlerosCoreBase.__KlerosCoreBase_initialize" -> "KlerosCoreBase._enableDisputeKit" [ color = "green" ];\n  "KlerosCoreBase.executeGovernorProposal" -> "KlerosCoreBase.UnsuccessfulCall" [ color = "red" ];\n  "KlerosCoreBase.createCourt" -> "KlerosCoreBase.MinStakeLowerThanParentCourt" [ color = "red" ];\n  "KlerosCoreBase.createCourt" -> "KlerosCoreBase.UnsupportedDisputeKit" [ color = "red" ];\n  "KlerosCoreBase.createCourt" -> "KlerosCoreBase.InvalidForkingCourtAsParent" [ color = "red" ];\n  "KlerosCoreBase.createCourt" -> "KlerosCoreBase.WrongDisputeKitIndex" [ color = "red" ];\n  "KlerosCoreBase.createCourt" -> "KlerosCoreBase._enableDisputeKit" [ color = "green" ];\n  "KlerosCoreBase.createCourt" -> "KlerosCoreBase.MustSupportDisputeKitClassic" [ color = "red" ];\n  "KlerosCoreBase.createCourt" -> "ISortitionModule.createTree" [ color = "orange" ];\n  "KlerosCoreBase.changeCourtParameters" -> "KlerosCoreBase.MinStakeLowerThanParentCourt" [ color = "red" ];\n  "KlerosCoreBase.changeCourtParameters" -> "KlerosCoreBase.MinStakeLowerThanParentCourt" [ color = "red" ];\n  "KlerosCoreBase.enableDisputeKits" -> "KlerosCoreBase.WrongDisputeKitIndex" [ color = "red" ];\n  "KlerosCoreBase.enableDisputeKits" -> "KlerosCoreBase._enableDisputeKit" [ color = "green" ];\n  "KlerosCoreBase.enableDisputeKits" -> "KlerosCoreBase.CannotDisableClassicDK" [ color = "red" ];\n  "KlerosCoreBase.enableDisputeKits" -> "KlerosCoreBase._enableDisputeKit" [ color = "green" ];\n  "KlerosCoreBase.setStake" -> "KlerosCoreBase._setStake" [ color = "green" ];\n  "KlerosCoreBase.setStakeBySortitionModule" -> "KlerosCoreBase.address" [ color = "green" ];\n  "KlerosCoreBase.setStakeBySortitionModule" -> "KlerosCoreBase.SortitionModuleOnly" [ color = "red" ];\n  "KlerosCoreBase.setStakeBySortitionModule" -> "KlerosCoreBase._setStake" [ color = "green" ];\n  "KlerosCoreBase.transferBySortitionModule" -> "KlerosCoreBase.address" [ color = "green" ];\n  "KlerosCoreBase.transferBySortitionModule" -> "KlerosCoreBase.SortitionModuleOnly" [ color = "red" ];\n  "KlerosCoreBase.transferBySortitionModule" -> "IERC20.safeTransfer" [ color = "orange" ];\n  "KlerosCoreBase.createDispute" -> "KlerosCoreBase.arbitrationCost" [ color = "green" ];\n  "KlerosCoreBase.createDispute" -> "KlerosCoreBase.ArbitrationFeesNotEnough" [ color = "red" ];\n  "KlerosCoreBase.createDispute" -> "KlerosCoreBase._createDispute" [ color = "green" ];\n  "KlerosCoreBase.createDispute" -> "KlerosCoreBase.TokenNotAccepted" [ color = "red" ];\n  "KlerosCoreBase.createDispute" -> "KlerosCoreBase.arbitrationCost" [ color = "green" ];\n  "KlerosCoreBase.createDispute" -> "KlerosCoreBase.ArbitrationFeesNotEnough" [ color = "red" ];\n  "KlerosCoreBase.createDispute" -> "IERC20.safeTransferFrom" [ color = "orange" ];\n  "KlerosCoreBase.createDispute" -> "KlerosCoreBase.address" [ color = "green" ];\n  "KlerosCoreBase.createDispute" -> "KlerosCoreBase.TransferFailed" [ color = "red" ];\n  "KlerosCoreBase.createDispute" -> "KlerosCoreBase._createDispute" [ color = "green" ];\n  "KlerosCoreBase._createDispute" -> "KlerosCoreBase._extraDataToCourtIDMinJurorsDisputeKit" [ color = "green" ];\n  "KlerosCoreBase._createDispute" -> "KlerosCoreBase.DisputeKitNotSupportedByCourt" [ color = "red" ];\n  "KlerosCoreBase._createDispute" -> "KlerosCoreBase.convertEthToTokenAmount" [ color = "green" ];\n  "KlerosCoreBase._createDispute" -> "KlerosCoreBase._calculatePnkAtStake" [ color = "green" ];\n  "KlerosCoreBase._createDispute" -> "KlerosCoreBase.IERC20" [ color = "green" ];\n  "KlerosCoreBase._createDispute" -> "ISortitionModule.createDisputeHook" [ color = "orange" ];\n  "KlerosCoreBase._createDispute" -> "IDisputeKit.createDispute" [ color = "orange" ];\n  "KlerosCoreBase.passPeriod" -> "KlerosCoreBase.EvidenceNotPassedAndNotAppeal" [ color = "red" ];\n  "KlerosCoreBase.passPeriod" -> "KlerosCoreBase.DisputeStillDrawing" [ color = "red" ];\n  "KlerosCoreBase.passPeriod" -> "KlerosCoreBase.CommitPeriodNotPassed" [ color = "red" ];\n  "KlerosCoreBase.passPeriod" -> "KlerosCoreBase.VotePeriodNotPassed" [ color = "red" ];\n  "KlerosCoreBase.passPeriod" -> "KlerosCoreBase.AppealPeriodNotPassed" [ color = "red" ];\n  "KlerosCoreBase.passPeriod" -> "KlerosCoreBase.DisputePeriodIsFinal" [ color = "red" ];\n  "KlerosCoreBase.draw" -> "KlerosCoreBase.NotEvidencePeriod" [ color = "red" ];\n  "KlerosCoreBase.draw" -> "IDisputeKit.draw" [ color = "orange" ];\n  "KlerosCoreBase.draw" -> "KlerosCoreBase.address" [ color = "green" ];\n  "KlerosCoreBase.draw" -> "ISortitionModule.lockStake" [ color = "orange" ];\n  "KlerosCoreBase.draw" -> "ISortitionModule.postDrawHook" [ color = "orange" ];\n  "KlerosCoreBase.appeal" -> "KlerosCoreBase.appealCost" [ color = "green" ];\n  "KlerosCoreBase.appeal" -> "KlerosCoreBase.AppealFeesNotEnough" [ color = "red" ];\n  "KlerosCoreBase.appeal" -> "KlerosCoreBase.DisputeNotAppealable" [ color = "red" ];\n  "KlerosCoreBase.appeal" -> "KlerosCoreBase.address" [ color = "green" ];\n  "KlerosCoreBase.appeal" -> "KlerosCoreBase.DisputeKitOnly" [ color = "red" ];\n  "KlerosCoreBase.appeal" -> "KlerosCoreBase._calculatePnkAtStake" [ color = "green" ];\n  "KlerosCoreBase.appeal" -> "ISortitionModule.createDisputeHook" [ color = "orange" ];\n  "KlerosCoreBase.execute" -> "KlerosCoreBase.NotExecutionPeriod" [ color = "red" ];\n  "KlerosCoreBase.execute" -> "IDisputeKit.getCoherentCount" [ color = "orange" ];\n  "KlerosCoreBase.execute" -> "KlerosCoreBase._executePenalties" [ color = "green" ];\n  "KlerosCoreBase.execute" -> "KlerosCoreBase._executeRewards" [ color = "green" ];\n  "KlerosCoreBase._executePenalties" -> "IDisputeKit.getDegreeOfCoherence" [ color = "orange" ];\n  "KlerosCoreBase._executePenalties" -> "ISortitionModule.unlockStake" [ color = "orange" ];\n  "KlerosCoreBase._executePenalties" -> "ISortitionModule.penalizeStake" [ color = "orange" ];\n  "KlerosCoreBase._executePenalties" -> "IDisputeKit.isVoteActive" [ color = "orange" ];\n  "KlerosCoreBase._executePenalties" -> "ISortitionModule.setJurorInactive" [ color = "orange" ];\n  "KlerosCoreBase._executePenalties" -> "KlerosCoreBase._transferFeeToken" [ color = "green" ];\n  "KlerosCoreBase._executePenalties" -> "KlerosCoreBase.payable" [ color = "green" ];\n  "KlerosCoreBase._executePenalties" -> "IERC20.safeTransfer" [ color = "orange" ];\n  "KlerosCoreBase._executeRewards" -> "IDisputeKit.getDegreeOfCoherence" [ color = "orange" ];\n  "KlerosCoreBase._executeRewards" -> "KlerosCoreBase._applyCoherence" [ color = "green" ];\n  "KlerosCoreBase._executeRewards" -> "ISortitionModule.unlockStake" [ color = "orange" ];\n  "KlerosCoreBase._executeRewards" -> "KlerosCoreBase._applyCoherence" [ color = "green" ];\n  "KlerosCoreBase._executeRewards" -> "KlerosCoreBase._applyCoherence" [ color = "green" ];\n  "KlerosCoreBase._executeRewards" -> "IERC20.safeTransfer" [ color = "orange" ];\n  "KlerosCoreBase._executeRewards" -> "KlerosCoreBase._transferFeeToken" [ color = "green" ];\n  "KlerosCoreBase._executeRewards" -> "KlerosCoreBase.payable" [ color = "green" ];\n  "KlerosCoreBase._executeRewards" -> "IERC20.safeTransfer" [ color = "orange" ];\n  "KlerosCoreBase._executeRewards" -> "KlerosCoreBase._transferFeeToken" [ color = "green" ];\n  "KlerosCoreBase._executeRewards" -> "KlerosCoreBase.payable" [ color = "green" ];\n  "KlerosCoreBase.executeRuling" -> "KlerosCoreBase.NotExecutionPeriod" [ color = "red" ];\n  "KlerosCoreBase.executeRuling" -> "KlerosCoreBase.RulingAlreadyExecuted" [ color = "red" ];\n  "KlerosCoreBase.executeRuling" -> "KlerosCoreBase.currentRuling" [ color = "green" ];\n  "KlerosCoreBase.arbitrationCost" -> "KlerosCoreBase._extraDataToCourtIDMinJurorsDisputeKit" [ color = "green" ];\n  "KlerosCoreBase.arbitrationCost" -> "KlerosCoreBase.convertEthToTokenAmount" [ color = "green" ];\n  "KlerosCoreBase.arbitrationCost" -> "KlerosCoreBase.arbitrationCost" [ color = "green" ];\n  "KlerosCoreBase.currentRuling" -> "IDisputeKit.currentRuling" [ color = "orange" ];\n  "KlerosCoreBase._transferFeeToken" -> "_recipient.safeSend" [ color = "orange" ];\n  "KlerosCoreBase._transferFeeToken" -> "IERC20.safeTransfer" [ color = "orange" ];\n  "KlerosCoreBase._setStake" -> "KlerosCoreBase._stakingFailed" [ color = "green" ];\n  "KlerosCoreBase._setStake" -> "KlerosCoreBase._stakingFailed" [ color = "green" ];\n  "KlerosCoreBase._setStake" -> "ISortitionModule.validateStake" [ color = "orange" ];\n  "KlerosCoreBase._setStake" -> "KlerosCoreBase._stakingFailed" [ color = "green" ];\n  "KlerosCoreBase._setStake" -> "IERC20.safeTransferFrom" [ color = "orange" ];\n  "KlerosCoreBase._setStake" -> "KlerosCoreBase.address" [ color = "green" ];\n  "KlerosCoreBase._setStake" -> "KlerosCoreBase._stakingFailed" [ color = "green" ];\n  "KlerosCoreBase._setStake" -> "IERC20.safeTransfer" [ color = "orange" ];\n  "KlerosCoreBase._setStake" -> "KlerosCoreBase._stakingFailed" [ color = "green" ];\n  "KlerosCoreBase._setStake" -> "ISortitionModule.setStake" [ color = "orange" ];\n  "KlerosCoreBase._stakingFailed" -> "KlerosCoreBase.StakingTransferFailed" [ color = "red" ];\n  "KlerosCoreBase._stakingFailed" -> "KlerosCoreBase.UnstakingTransferFailed" [ color = "red" ];\n  "KlerosCoreBase._stakingFailed" -> "KlerosCoreBase.StakingInTooManyCourts" [ color = "red" ];\n  "KlerosCoreBase._stakingFailed" -> "KlerosCoreBase.StakingNotPossibleInThisCourt" [ color = "red" ];\n  "KlerosCoreBase._stakingFailed" -> "KlerosCoreBase.StakingLessThanCourtMinStake" [ color = "red" ];\n  "KlerosCoreBase._stakingFailed" -> "KlerosCoreBase.StakingZeroWhenNoStake" [ color = "red" ];\n  "KlerosCoreNeo.<Constructor>" -> "KlerosCoreNeo._disableInitializers" [ color = "green" ];\n  "KlerosCoreNeo.initialize" -> "KlerosCoreBase.__KlerosCoreBase_initialize" [ color = "green" ];\n  "KlerosCoreBase.setStake" -> "IERC721.balanceOf" [ color = "orange" ];\n  "KlerosCoreBase.setStake" -> "KlerosCoreNeo.NotEligibleForStaking" [ color = "red" ];\n  "KlerosCoreBase.setStake" -> "KlerosCoreBase._setStake" [ color = "orange" ];\n  "KlerosCoreBase._createDispute" -> "KlerosCoreNeo.ArbitrableNotWhitelisted" [ color = "red" ];\n  "KlerosCoreBase._createDispute" -> "KlerosCoreBase._createDispute" [ color = "orange" ];\n  "KlerosCoreBase._stakingFailed" -> "KlerosCoreBase._stakingFailed" [ color = "orange" ];\n  "KlerosCoreBase._stakingFailed" -> "KlerosCoreNeo.StakingMoreThanMaxStakePerJuror" [ color = "red" ];\n  "KlerosCoreBase._stakingFailed" -> "KlerosCoreNeo.StakingMoreThanMaxTotalStaked" [ color = "red" ];\n  "PolicyRegistry.<Constructor>" -> "PolicyRegistry._disableInitializers" [ color = "green" ];\n  "SortitionModule.<Constructor>" -> "SortitionModule._disableInitializers" [ color = "green" ];\n  "SortitionModule.initialize" -> "SortitionModule.__SortitionModuleBase_initialize" [ color = "green" ];\n  "SortitionModuleBase.onlyByGovernor" -> "SortitionModuleBase.address" [ color = "green" ];\n  "SortitionModuleBase.onlyByCore" -> "SortitionModuleBase.address" [ color = "green" ];\n  "SortitionModuleBase.changeRandomNumberGenerator" -> "IRNG.requestRandomness" [ color = "orange" ];\n  "SortitionModuleBase.passPhase" -> "IRNG.requestRandomness" [ color = "orange" ];\n  "SortitionModuleBase.passPhase" -> "IRNG.receiveRandomness" [ color = "orange" ];\n  "ISortitionModule.createTree" -> "SortitionModuleBase._extraDataToTreeK" [ color = "green" ];\n  "SortitionModuleBase.executeDelayedStakes" -> "KlerosCoreBase.setStakeBySortitionModule" [ color = "orange" ];\n  "ISortitionModule.validateStake" -> "SortitionModuleBase._validateStake" [ color = "green" ];\n  "SortitionModuleBase._validateStake" -> "SortitionModuleBase.stakeOf" [ color = "green" ];\n  "ISortitionModule.setStake" -> "SortitionModuleBase._setStake" [ color = "green" ];\n  "SortitionModuleBase._setStake" -> "SortitionModuleBase.stakeOf" [ color = "green" ];\n  "SortitionModuleBase._setStake" -> "SortitionModuleBase._accountAndCourtIDToStakePathID" [ color = "green" ];\n  "SortitionModuleBase._setStake" -> "SortitionModuleBase._set" [ color = "green" ];\n  "SortitionModuleBase._setStake" -> "KlerosCore.courts" [ color = "orange" ];\n  "ISortitionModule.unlockStake" -> "SortitionModuleBase.getJurorLeftoverPNK" [ color = "green" ];\n  "ISortitionModule.setJurorInactive" -> "SortitionModuleBase.getJurorCourtIDs" [ color = "green" ];\n  "ISortitionModule.setJurorInactive" -> "KlerosCoreBase.setStakeBySortitionModule" [ color = "orange" ];\n  "SortitionModuleBase.withdrawLeftoverPNK" -> "SortitionModuleBase.getJurorLeftoverPNK" [ color = "green" ];\n  "SortitionModuleBase.withdrawLeftoverPNK" -> "KlerosCoreBase.transferBySortitionModule" [ color = "orange" ];\n  "SortitionModuleBase.draw" -> "SortitionModuleBase.address" [ color = "green" ];\n  "SortitionModuleBase.draw" -> "SortitionModuleBase._stakePathIDToAccount" [ color = "green" ];\n  "SortitionModuleBase.stakeOf" -> "SortitionModuleBase._accountAndCourtIDToStakePathID" [ color = "green" ];\n  "SortitionModuleBase.stakeOf" -> "SortitionModuleBase.stakeOf" [ color = "green" ];\n  "SortitionModuleBase.getJurorBalance" -> "SortitionModuleBase.stakeOf" [ color = "green" ];\n  "SortitionModuleBase._set" -> "SortitionModuleBase._updateParents" [ color = "green" ];\n  "SortitionModuleBase._set" -> "SortitionModuleBase._updateParents" [ color = "green" ];\n  "SortitionModuleBase._set" -> "SortitionModuleBase._updateParents" [ color = "green" ];\n  "SortitionModuleNeo.<Constructor>" -> "SortitionModuleNeo._disableInitializers" [ color = "green" ];\n  "SortitionModuleNeo.initialize" -> "SortitionModuleNeo.__SortitionModuleBase_initialize" [ color = "green" ];\n  "SortitionModuleBase._validateStake" -> "SortitionModuleBase.stakeOf" [ color = "green" ];\n  "SortitionModuleBase._validateStake" -> "SortitionModuleBase._validateStake" [ color = "orange" ];\n  "DisputeResolver.createDisputeForTemplate" -> "DisputeResolver._createDispute" [ color = "green" ];\n  "DisputeResolver.createDisputeForTemplateUri" -> "DisputeResolver._createDispute" [ color = "green" ];\n  "DisputeResolver.rule" -> "DisputeResolver.address" [ color = "green" ];\n  "DisputeResolver._createDispute" -> "IDisputeTemplateRegistry.setDisputeTemplate" [ color = "orange" ];\n  "DisputeTemplateRegistry.<Constructor>" -> "DisputeTemplateRegistry._disableInitializers" [ color = "green" ];\n  "DisputeKitClassic.<Constructor>" -> "DisputeKitClassic._disableInitializers" [ color = "green" ];\n  "DisputeKitClassic.initialize" -> "DisputeKitClassic.__DisputeKitClassicBase_initialize" [ color = "green" ];\n  "DisputeKitClassicBase.onlyByCore" -> "DisputeKitClassicBase.address" [ color = "green" ];\n  "IDisputeKit.createDispute" -> "KlerosCore.getNumberOfRounds" [ color = "orange" ];\n  "IDisputeKit.draw" -> "KlerosCore.sortitionModule" [ color = "orange" ];\n  "IDisputeKit.draw" -> "KlerosCore.disputes" [ color = "orange" ];\n  "IDisputeKit.draw" -> "ISortitionModule.draw" [ color = "orange" ];\n  "IDisputeKit.draw" -> "DisputeKitClassicBase.address" [ color = "green" ];\n  "IDisputeKit.draw" -> "DisputeKitClassicBase._postDrawCheck" [ color = "green" ];\n  "IDisputeKit.draw" -> "DisputeKitClassicBase.address" [ color = "green" ];\n  "DisputeKitClassicBase.castCommit" -> "DisputeKitClassicBase._castCommit" [ color = "green" ];\n  "DisputeKitClassicBase._castCommit" -> "KlerosCore.disputes" [ color = "orange" ];\n  "DisputeKitClassicBase.castVote" -> "DisputeKitClassicBase._castVote" [ color = "green" ];\n  "DisputeKitClassicBase._castVote" -> "KlerosCore.disputes" [ color = "orange" ];\n  "DisputeKitClassicBase._castVote" -> "KlerosCore.disputes" [ color = "orange" ];\n  "DisputeKitClassicBase._castVote" -> "KlerosCore.courts" [ color = "orange" ];\n  "DisputeKitClassicBase._castVote" -> "DisputeKitClassicBase.hashVote" [ color = "green" ];\n  "DisputeKitClassicBase.fundAppeal" -> "KlerosCore.appealPeriod" [ color = "orange" ];\n  "DisputeKitClassicBase.fundAppeal" -> "IDisputeKit.currentRuling" [ color = "green" ];\n  "DisputeKitClassicBase.fundAppeal" -> "KlerosCore.getNumberOfRounds" [ color = "orange" ];\n  "DisputeKitClassicBase.fundAppeal" -> "KlerosCoreBase.appealCost" [ color = "orange" ];\n  "DisputeKitClassicBase.fundAppeal" -> "KlerosCore.isDisputeKitJumping" [ color = "orange" ];\n  "DisputeKitClassicBase.fundAppeal" -> "KlerosCore.getNumberOfVotes" [ color = "orange" ];\n  "DisputeKitClassicBase.fundAppeal" -> "DisputeKitClassicBase.payable" [ color = "green" ];\n  "DisputeKitClassicBase.withdrawFeesAndRewards" -> "KlerosCore.disputes" [ color = "orange" ];\n  "DisputeKitClassicBase.withdrawFeesAndRewards" -> "KlerosCore.paused" [ color = "orange" ];\n  "DisputeKitClassicBase.withdrawFeesAndRewards" -> "KlerosCoreBase.currentRuling" [ color = "orange" ];\n  "DisputeKitClassicBase.withdrawFeesAndRewards" -> "_beneficiary.safeSend" [ color = "orange" ];\n  "IDisputeKit.currentRuling" -> "KlerosCore.disputes" [ color = "orange" ];\n  "IDisputeKit.currentRuling" -> "DisputeKitClassicBase.getFundedChoices" [ color = "green" ];\n  "IDisputeKit.getDegreeOfCoherence" -> "KlerosCoreBase.currentRuling" [ color = "orange" ];\n  "IDisputeKit.getCoherentCount" -> "KlerosCoreBase.currentRuling" [ color = "orange" ];\n  "DisputeKitClassicBase.areVotesAllCast" -> "KlerosCore.disputes" [ color = "orange" ];\n  "DisputeKitClassicBase.areVotesAllCast" -> "KlerosCore.courts" [ color = "orange" ];\n  "DisputeKitClassicBase.isAppealFunded" -> "KlerosCore.appealPeriod" [ color = "orange" ];\n  "DisputeKitClassicBase.isAppealFunded" -> "DisputeKitClassicBase.getFundedChoices" [ color = "green" ];\n  "DisputeKitGated.<Constructor>" -> "DisputeKitGated._disableInitializers" [ color = "green" ];\n  "DisputeKitGated.initialize" -> "DisputeKitGated.__DisputeKitClassicBase_initialize" [ color = "green" ];\n  "DisputeKitGated.extraDataToTokenInfo" -> "DisputeKitClassicBase.address" [ color = "green" ];\n  "DisputeKitClassicBase._postDrawCheck" -> "DisputeKitClassicBase._postDrawCheck" [ color = "orange" ];\n  "DisputeKitClassicBase._postDrawCheck" -> "DisputeKitGated.extraDataToTokenInfo" [ color = "green" ];\n  "DisputeKitClassicBase._postDrawCheck" -> "DisputeKitClassicBase.address" [ color = "green" ];\n  "DisputeKitGatedShutter.<Constructor>" -> "DisputeKitGatedShutter._disableInitializers" [ color = "green" ];\n  "DisputeKitGatedShutter.initialize" -> "DisputeKitGatedShutter.__DisputeKitClassicBase_initialize" [ color = "green" ];\n  "DisputeKitGatedShutter.castCommitShutter" -> "DisputeKitClassicBase._castCommit" [ color = "green" ];\n  "DisputeKitGatedShutter.castVoteShutter" -> "DisputeKitClassicBase._castVote" [ color = "green" ];\n  "DisputeKitGatedShutter._extraDataToTokenInfo" -> "DisputeKitClassicBase.address" [ color = "green" ];\n  "DisputeKitClassicBase._postDrawCheck" -> "DisputeKitClassicBase._postDrawCheck" [ color = "orange" ];\n  "DisputeKitClassicBase._postDrawCheck" -> "DisputeKitGatedShutter._extraDataToTokenInfo" [ color = "green" ];\n  "DisputeKitClassicBase._postDrawCheck" -> "DisputeKitClassicBase.address" [ color = "green" ];\n  "DisputeKitShutter.<Constructor>" -> "DisputeKitShutter._disableInitializers" [ color = "green" ];\n  "DisputeKitShutter.initialize" -> "DisputeKitShutter.__DisputeKitClassicBase_initialize" [ color = "green" ];\n  "DisputeKitShutter.castCommitShutter" -> "DisputeKitClassicBase._castCommit" [ color = "green" ];\n  "DisputeKitShutter.castVoteShutter" -> "DisputeKitClassicBase._castVote" [ color = "green" ];\n  "DisputeKitSybilResistant.<Constructor>" -> "DisputeKitSybilResistant._disableInitializers" [ color = "green" ];\n  "DisputeKitSybilResistant.initialize" -> "DisputeKitSybilResistant.__DisputeKitClassicBase_initialize" [ color = "green" ];\n  "DisputeKitClassicBase._postDrawCheck" -> "DisputeKitClassicBase._postDrawCheck" [ color = "orange" ];\n  "DisputeKitClassicBase._postDrawCheck" -> "IProofOfHumanity.isRegistered" [ color = "orange" ];\n  "EvidenceModule.<Constructor>" -> "EvidenceModule._disableInitializers" [ color = "green" ];\n  "SafeERC20.increaseAllowance" -> "IERC20.approve" [ color = "orange" ];\n  "SafeERC20.increaseAllowance" -> "IERC20.allowance" [ color = "orange" ];\n  "SafeERC20.increaseAllowance" -> "SafeERC20.address" [ color = "green" ];\n  "SafeERC20.safeTransfer" -> "IERC20.UTION: When used with inheritance, manual care" [ color = "orange" ];\n  "SafeERC20.safeTransfer" -> "SafeERC20.address" [ color = "green" ];\n  "SafeERC20.safeTransfer" -> "abi.encodeCall" [ color = "orange" ];\n  "SafeERC20.safeTransferFrom" -> "IERC20.utomatically lock it when it is deployed:\n *\n * ```\n * //" [ color = "orange" ];\n  "SafeERC20.safeTransferFrom" -> "SafeERC20.address" [ color = "green" ];\n  "SafeERC20.safeTransferFrom" -> "abi.encodeCall" [ color = "orange" ];\n  "SafeSend.safeSend" -> "_to.send" [ color = "orange" ];\n  "RNGWithFallback.<Constructor>" -> "RNGWithFallback.address" [ color = "green" ];\n  "RNGWithFallback.<Constructor>" -> "RNGWithFallback.address" [ color = "green" ];\n  "IRNG.requestRandomness" -> "IRNG.requestRandomness" [ color = "orange" ];\n  "IRNG.receiveRandomness" -> "IRNG.receiveRandomness" [ color = "orange" ];\n  "IRNG.receiveRandomness" -> "RNGWithFallback.blockhash" [ color = "green" ];\n  "ChainlinkRNG.changeVrfCoordinator" -> "ChainlinkRNG.IVRFCoordinatorV2Plus" [ color = "green" ];\n  "ChainlinkRNG.changeVrfCoordinator" -> "ChainlinkRNG.CoordinatorSet" [ color = "green" ];\n  "IRNG.requestRandomness" -> "s_vrfCoordinator.requestRandomWords" [ color = "orange" ];\n  "IRNG.requestRandomness" -> "VRFV2PlusClient.RandomWordsRequest" [ color = "orange" ];\n  "IRNG.requestRandomness" -> "VRFV2PlusClient._argsToBytes" [ color = "orange" ];\n  "IRNG.requestRandomness" -> "VRFV2PlusClient.ExtraArgsV1" [ color = "orange" ];\n  "UUPSProxiable.upgradeToAndCall" -> "UUPSProxiable._authorizeUpgrade" [ color = "green" ];\n  "UUPSProxiable.upgradeToAndCall" -> "UUPSProxiable.address" [ color = "green" ];\n  "UUPSProxiable.upgradeToAndCall" -> "UUPSProxiable._getImplementation" [ color = "green" ];\n  "UUPSProxiable.upgradeToAndCall" -> "UUPSProxiable.UUPSUnauthorizedCallContext" [ color = "red" ];\n  "UUPSProxiable.upgradeToAndCall" -> "UUPSProxiable.UUPSUnsupportedProxiableUUID" [ color = "red" ];\n  "UUPSProxiable.upgradeToAndCall" -> "newImplementation.delegatecall" [ color = "orange" ];\n  "UUPSProxiable.upgradeToAndCall" -> "UUPSProxiable.FailedDelegateCall" [ color = "red" ];\n  "UUPSProxiable.upgradeToAndCall" -> "UUPSProxiable.InvalidImplementation" [ color = "red" ];\n  "UUPSProxiable.proxiableUUID" -> "UUPSProxiable.address" [ color = "green" ];\n  "UUPSProxiable.proxiableUUID" -> "UUPSProxiable.UUPSUnauthorizedCallContext" [ color = "red" ];\n  "UUPSProxy.<Constructor>" -> "_implementation.delegatecall" [ color = "orange" ];\n  "UUPSProxy.<Fallback>" -> "UUPSProxy._delegate" [ color = "green" ];\n  "UUPSProxy.<Fallback>" -> "UUPSProxy._getImplementation" [ color = "green" ];\n  "UUPSProxy.<Receive Ether>" -> "UUPSProxy._delegate" [ color = "green" ];\n  "UUPSProxy.<Receive Ether>" -> "UUPSProxy._getImplementation" [ color = "green" ];\n  "Initializable.initializer" -> "Initializable._getInitializableStorage" [ color = "green" ];\n  "Initializable.initializer" -> "Initializable.address" [ color = "green" ];\n  "Initializable.initializer" -> "Initializable.AlreadyInitialized" [ color = "red" ];\n  "Initializable.reinitializer" -> "Initializable._getInitializableStorage" [ color = "green" ];\n  "Initializable.reinitializer" -> "Initializable.AlreadyInitialized" [ color = "red" ];\n  "Initializable.onlyInitializing" -> "Initializable._checkInitializing" [ color = "green" ];\n  "Initializable._checkInitializing" -> "Initializable._isInitializing" [ color = "green" ];\n  "Initializable._checkInitializing" -> "Initializable.NotInitializing" [ color = "red" ];\n  "Initializable._disableInitializers" -> "Initializable._getInitializableStorage" [ color = "green" ];\n  "Initializable._disableInitializers" -> "Initializable.AlreadyInitialized" [ color = "red" ];\n  "Initializable._disableInitializers" -> "Initializable.type" [ color = "green" ];\n  "Initializable._disableInitializers" -> "Initializable.type" [ color = "green" ];\n  "Initializable._disableInitializers" -> "Initializable.type" [ color = "green" ];\n  "Initializable._getInitializedVersion" -> "Initializable._getInitializableStorage" [ color = "green" ];\n  "Initializable._isInitializing" -> "Initializable._getInitializableStorage" [ color = "green" ];\n\n\nrankdir=LR\nnode [shape=plaintext]\nsubgraph cluster_01 { \nlabel = "Legend";\nkey [label=<<table border="0" cellpadding="2" cellspacing="0" cellborder="0">\n  <tr><td align="right" port="i1">Internal Call</td></tr>\n  <tr><td align="right" port="i2">External Call</td></tr>\n  <tr><td align="right" port="i2">Custom Error Call</td></tr>\n  <tr><td align="right" port="i3">Defined Contract</td></tr>\n  <tr><td align="right" port="i4">Undefined Contract</td></tr>\n  </table>>]\nkey2 [label=<<table border="0" cellpadding="2" cellspacing="0" cellborder="0">\n  <tr><td port="i1">&nbsp;&nbsp;&nbsp;</td></tr>\n  <tr><td port="i2">&nbsp;&nbsp;&nbsp;</td></tr>\n  <tr><td port="i3" bgcolor="lightgray">&nbsp;&nbsp;&nbsp;</td></tr>\n  <tr><td port="i4">\n    <table border="1" cellborder="0" cellspacing="0" cellpadding="7" color="lightgray">\n      <tr>\n       <td></td>\n      </tr>\n     </table>\n  </td></tr>\n  </table>>]\nkey:i1:e -> key2:i1:w [color="green"]\nkey:i2:e -> key2:i2:w [color="orange"]\nkey:i2:e -> key2:i2:w [color="red"]\n}\n}\n',
+            'digraph G {\n  graph [ ratio = "auto", page = "100", compound =true ];\nsubgraph "clusterKlerosCore" {\n  graph [ label = "KlerosCore", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "KlerosCore.onlyByOwner" [ label = "onlyByOwner", color = "yellow" ];\n  "KlerosCore.onlyByGuardianOrOwner" [ label = "onlyByGuardianOrOwner", color = "yellow" ];\n  "KlerosCore.whenPaused" [ label = "whenPaused", color = "yellow" ];\n  "KlerosCore.whenNotPaused" [ label = "whenNotPaused", color = "yellow" ];\n  "KlerosCore.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "KlerosCore.initialize" [ label = "initialize", color = "blue" ];\n  "KlerosCore._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "KlerosCore.pause" [ label = "pause", color = "blue" ];\n  "KlerosCore.unpause" [ label = "unpause", color = "blue" ];\n  "KlerosCore.executeOwnerProposal" [ label = "executeOwnerProposal", color = "blue" ];\n  "KlerosCore.changeOwner" [ label = "changeOwner", color = "blue" ];\n  "KlerosCore.changeGuardian" [ label = "changeGuardian", color = "blue" ];\n  "KlerosCore.changePinakion" [ label = "changePinakion", color = "blue" ];\n  "KlerosCore.changeJurorProsecutionModule" [ label = "changeJurorProsecutionModule", color = "blue" ];\n  "KlerosCore.changeSortitionModule" [ label = "changeSortitionModule", color = "blue" ];\n  "KlerosCore.addNewDisputeKit" [ label = "addNewDisputeKit", color = "blue" ];\n  "KlerosCore.createCourt" [ label = "createCourt", color = "blue" ];\n  "KlerosCore.changeCourtParameters" [ label = "changeCourtParameters", color = "blue" ];\n  "KlerosCore.enableDisputeKits" [ label = "enableDisputeKits", color = "blue" ];\n  "KlerosCore.changeAcceptedFeeTokens" [ label = "changeAcceptedFeeTokens", color = "blue" ];\n  "KlerosCore.changeCurrencyRates" [ label = "changeCurrencyRates", color = "blue" ];\n  "KlerosCore.changeJurorNft" [ label = "changeJurorNft", color = "blue" ];\n  "KlerosCore.changeArbitrableWhitelist" [ label = "changeArbitrableWhitelist", color = "blue" ];\n  "KlerosCore.changeArbitrableWhitelistEnabled" [ label = "changeArbitrableWhitelistEnabled", color = "blue" ];\n  "KlerosCore.setStake" [ label = "setStake", color = "blue" ];\n  "KlerosCore.setStakeBySortitionModule" [ label = "setStakeBySortitionModule", color = "blue" ];\n  "KlerosCore.transferBySortitionModule" [ label = "transferBySortitionModule", color = "blue" ];\n  "KlerosCore.createDispute" [ label = "createDispute", color = "blue" ];\n  "KlerosCore._createDispute" [ label = "_createDispute" ];\n  "KlerosCore.passPeriod" [ label = "passPeriod", color = "blue" ];\n  "KlerosCore.draw" [ label = "draw", color = "blue" ];\n  "KlerosCore.appeal" [ label = "appeal", color = "blue" ];\n  "KlerosCore.execute" [ label = "execute", color = "blue" ];\n  "KlerosCore._executePenalties" [ label = "_executePenalties" ];\n  "KlerosCore._executeRewards" [ label = "_executeRewards" ];\n  "KlerosCore.executeRuling" [ label = "executeRuling", color = "blue" ];\n  "KlerosCore.arbitrationCost" [ label = "arbitrationCost" ];\n  "KlerosCore.appealCost" [ label = "appealCost" ];\n  "KlerosCore.appealPeriod" [ label = "appealPeriod" ];\n  "KlerosCore.currentRuling" [ label = "currentRuling" ];\n  "KlerosCore.getRoundInfo" [ label = "getRoundInfo", color = "blue" ];\n  "KlerosCore.getPnkAtStakePerJuror" [ label = "getPnkAtStakePerJuror", color = "blue" ];\n  "KlerosCore.getNumberOfRounds" [ label = "getNumberOfRounds" ];\n  "KlerosCore.isSupported" [ label = "isSupported", color = "blue" ];\n  "KlerosCore.getTimesPerPeriod" [ label = "getTimesPerPeriod", color = "blue" ];\n  "KlerosCore.getNumberOfVotes" [ label = "getNumberOfVotes" ];\n  "KlerosCore.isDisputeKitJumping" [ label = "isDisputeKitJumping", color = "blue" ];\n  "KlerosCore.getDisputeKitsLength" [ label = "getDisputeKitsLength", color = "blue" ];\n  "KlerosCore.convertEthToTokenAmount" [ label = "convertEthToTokenAmount" ];\n  "KlerosCore._isCourtJumping" [ label = "_isCourtJumping" ];\n  "KlerosCore._getCourtAndDisputeKitJumps" [ label = "_getCourtAndDisputeKitJumps" ];\n  "KlerosCore._transferFeeToken" [ label = "_transferFeeToken" ];\n  "KlerosCore._applyCoherence" [ label = "_applyCoherence" ];\n  "KlerosCore._calculatePnkAtStake" [ label = "_calculatePnkAtStake" ];\n  "KlerosCore._enableDisputeKit" [ label = "_enableDisputeKit" ];\n  "KlerosCore._setStake" [ label = "_setStake" ];\n  "KlerosCore._stakingFailed" [ label = "_stakingFailed" ];\n  "KlerosCore._extraDataToCourtIDMinJurorsDisputeKit" [ label = "_extraDataToCourtIDMinJurorsDisputeKit" ];\n  "KlerosCore.OwnerOnly" [ color = "brown2", shape =box ];\n  "KlerosCore.GuardianOrOwnerOnly" [ color = "brown2", shape =box ];\n  "KlerosCore.WhenPausedOnly" [ color = "brown2", shape =box ];\n  "KlerosCore.WhenNotPausedOnly" [ color = "brown2", shape =box ];\n  "KlerosCore._disableInitializers" [ label = "_disableInitializers" ];\n  "KlerosCore.UnsuccessfulCall" [ color = "brown2", shape =box ];\n  "KlerosCore.MinStakeLowerThanParentCourt" [ color = "brown2", shape =box ];\n  "KlerosCore.UnsupportedDisputeKit" [ color = "brown2", shape =box ];\n  "KlerosCore.InvalidForkingCourtAsParent" [ color = "brown2", shape =box ];\n  "KlerosCore.WrongDisputeKitIndex" [ color = "brown2", shape =box ];\n  "KlerosCore.MustSupportDisputeKitClassic" [ color = "brown2", shape =box ];\n  "KlerosCore.CannotDisableClassicDK" [ color = "brown2", shape =box ];\n  "KlerosCore.address" [ label = "address" ];\n  "KlerosCore.NotEligibleForStaking" [ color = "brown2", shape =box ];\n  "KlerosCore.SortitionModuleOnly" [ color = "brown2", shape =box ];\n  "KlerosCore.ArbitrationFeesNotEnough" [ color = "brown2", shape =box ];\n  "KlerosCore.TokenNotAccepted" [ color = "brown2", shape =box ];\n  "KlerosCore.TransferFailed" [ color = "brown2", shape =box ];\n  "KlerosCore.ArbitrableNotWhitelisted" [ color = "brown2", shape =box ];\n  "KlerosCore.DisputeKitNotSupportedByCourt" [ color = "brown2", shape =box ];\n  "KlerosCore.IERC20" [ label = "IERC20" ];\n  "KlerosCore.EvidenceNotPassedAndNotAppeal" [ color = "brown2", shape =box ];\n  "KlerosCore.DisputeStillDrawing" [ color = "brown2", shape =box ];\n  "KlerosCore.CommitPeriodNotPassed" [ color = "brown2", shape =box ];\n  "KlerosCore.VotePeriodNotPassed" [ color = "brown2", shape =box ];\n  "KlerosCore.AppealPeriodNotPassed" [ color = "brown2", shape =box ];\n  "KlerosCore.DisputePeriodIsFinal" [ color = "brown2", shape =box ];\n  "KlerosCore.NotEvidencePeriod" [ color = "brown2", shape =box ];\n  "KlerosCore.AppealFeesNotEnough" [ color = "brown2", shape =box ];\n  "KlerosCore.DisputeNotAppealable" [ color = "brown2", shape =box ];\n  "KlerosCore.DisputeKitOnly" [ color = "brown2", shape =box ];\n  "KlerosCore.NotExecutionPeriod" [ color = "brown2", shape =box ];\n  "KlerosCore.payable" [ label = "payable" ];\n  "KlerosCore.RulingAlreadyExecuted" [ color = "brown2", shape =box ];\n  "KlerosCore.StakingTransferFailed" [ color = "brown2", shape =box ];\n  "KlerosCore.UnstakingTransferFailed" [ color = "brown2", shape =box ];\n  "KlerosCore.StakingInTooManyCourts" [ color = "brown2", shape =box ];\n  "KlerosCore.StakingNotPossibleInThisCourt" [ color = "brown2", shape =box ];\n  "KlerosCore.StakingLessThanCourtMinStake" [ color = "brown2", shape =box ];\n  "KlerosCore.StakingZeroWhenNoStake" [ color = "brown2", shape =box ];\n  "KlerosCore.StakingMoreThanMaxStakePerJuror" [ color = "brown2", shape =box ];\n  "KlerosCore.StakingMoreThanMaxTotalStaked" [ color = "brown2", shape =box ];\n  "KlerosCore.courts" [ label = "courts" ];\n  "KlerosCore.sortitionModule" [ label = "sortitionModule" ];\n  "KlerosCore.disputes" [ label = "disputes" ];\n  "KlerosCore.paused" [ label = "paused" ];\n}\n\nsubgraph "clusterPolicyRegistry" {\n  graph [ label = "PolicyRegistry", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "PolicyRegistry.onlyByOwner" [ label = "onlyByOwner", color = "yellow" ];\n  "PolicyRegistry.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "PolicyRegistry.initialize" [ label = "initialize", color = "blue" ];\n  "PolicyRegistry._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "PolicyRegistry.changeOwner" [ label = "changeOwner", color = "blue" ];\n  "PolicyRegistry.setPolicy" [ label = "setPolicy", color = "blue" ];\n  "PolicyRegistry.OwnerOnly" [ color = "brown2", shape =box ];\n  "PolicyRegistry._disableInitializers" [ label = "_disableInitializers" ];\n}\n\nsubgraph "clusterSortitionModule" {\n  graph [ label = "SortitionModule", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "SortitionModule.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "SortitionModule.initialize" [ label = "initialize", color = "blue" ];\n  "SortitionModule.onlyByOwner" [ label = "onlyByOwner", color = "yellow" ];\n  "SortitionModule.onlyByCore" [ label = "onlyByCore", color = "yellow" ];\n  "SortitionModule._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "SortitionModule.changeOwner" [ label = "changeOwner", color = "blue" ];\n  "SortitionModule.changeMinStakingTime" [ label = "changeMinStakingTime", color = "blue" ];\n  "SortitionModule.changeMaxDrawingTime" [ label = "changeMaxDrawingTime", color = "blue" ];\n  "SortitionModule.changeRandomNumberGenerator" [ label = "changeRandomNumberGenerator", color = "blue" ];\n  "SortitionModule.changeMaxStakePerJuror" [ label = "changeMaxStakePerJuror", color = "blue" ];\n  "SortitionModule.changeMaxTotalStaked" [ label = "changeMaxTotalStaked", color = "blue" ];\n  "SortitionModule.passPhase" [ label = "passPhase", color = "blue" ];\n  "ISortitionModule.createTree" [ label = "createTree", color = "blue" ];\n  "SortitionModule.executeDelayedStakes" [ label = "executeDelayedStakes", color = "blue" ];\n  "ISortitionModule.createDisputeHook" [ label = "createDisputeHook", color = "blue" ];\n  "ISortitionModule.postDrawHook" [ label = "postDrawHook", color = "blue" ];\n  "SortitionModule.notifyRandomNumber" [ label = "notifyRandomNumber", color = "green" ];\n  "ISortitionModule.validateStake" [ label = "validateStake", color = "blue" ];\n  "SortitionModule._validateStake" [ label = "_validateStake" ];\n  "ISortitionModule.setStake" [ label = "setStake", color = "blue" ];\n  "ISortitionModule.setStakePenalty" [ label = "setStakePenalty", color = "blue" ];\n  "ISortitionModule.setStakeReward" [ label = "setStakeReward", color = "blue" ];\n  "SortitionModule._setStake" [ label = "_setStake" ];\n  "ISortitionModule.lockStake" [ label = "lockStake", color = "blue" ];\n  "ISortitionModule.unlockStake" [ label = "unlockStake", color = "blue" ];\n  "ISortitionModule.forcedUnstakeAllCourts" [ label = "forcedUnstakeAllCourts", color = "blue" ];\n  "ISortitionModule.forcedUnstake" [ label = "forcedUnstake", color = "blue" ];\n  "SortitionModule.withdrawLeftoverPNK" [ label = "withdrawLeftoverPNK", color = "blue" ];\n  "SortitionModule.draw" [ label = "draw", color = "green" ];\n  "SortitionModule.stakeOf" [ label = "stakeOf" ];\n  "SortitionModule.getJurorBalance" [ label = "getJurorBalance", color = "blue" ];\n  "SortitionModule.getJurorCourtIDs" [ label = "getJurorCourtIDs" ];\n  "SortitionModule.isJurorStaked" [ label = "isJurorStaked", color = "blue" ];\n  "SortitionModule.getJurorLeftoverPNK" [ label = "getJurorLeftoverPNK" ];\n  "SortitionModule._extraDataToTreeK" [ label = "_extraDataToTreeK" ];\n  "SortitionModule._disableInitializers" [ label = "_disableInitializers" ];\n  "SortitionModule.OwnerOnly" [ color = "brown2", shape =box ];\n  "SortitionModule.address" [ label = "address" ];\n  "SortitionModule.KlerosCoreOnly" [ color = "brown2", shape =box ];\n  "SortitionModule.MinStakingTimeNotPassed" [ color = "brown2", shape =box ];\n  "SortitionModule.NoDisputesThatNeedJurors" [ color = "brown2", shape =box ];\n  "SortitionModule.RandomNumberNotReady" [ color = "brown2", shape =box ];\n  "SortitionModule.DisputesWithoutJurorsAndMaxDrawingTimeNotPassed" [ color = "brown2", shape =box ];\n  "SortitionModule.NotStakingPhase" [ color = "brown2", shape =box ];\n  "SortitionModule.NoDelayedStakeToExecute" [ color = "brown2", shape =box ];\n  "SortitionModule.NotEligibleForWithdrawal" [ color = "brown2", shape =box ];\n  "SortitionModule.NotDrawingPhase" [ color = "brown2", shape =box ];\n}\n\nsubgraph "clusterDisputeResolver" {\n  graph [ label = "DisputeResolver", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "DisputeResolver.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "DisputeResolver.changeOwner" [ label = "changeOwner", color = "blue" ];\n  "DisputeResolver.changeArbitrator" [ label = "changeArbitrator", color = "blue" ];\n  "DisputeResolver.changeTemplateRegistry" [ label = "changeTemplateRegistry", color = "blue" ];\n  "DisputeResolver.createDisputeForTemplate" [ label = "createDisputeForTemplate", color = "blue" ];\n  "DisputeResolver.createDisputeForTemplateUri" [ label = "createDisputeForTemplateUri", color = "blue" ];\n  "DisputeResolver.rule" [ label = "rule", color = "blue" ];\n  "DisputeResolver._createDispute" [ label = "_createDispute" ];\n  "DisputeResolver.OwnerOnly" [ color = "brown2", shape =box ];\n  "DisputeResolver.address" [ label = "address" ];\n  "DisputeResolver.ArbitratorOnly" [ color = "brown2", shape =box ];\n  "DisputeResolver.RulingOutOfBounds" [ color = "brown2", shape =box ];\n  "DisputeResolver.DisputeAlreadyRuled" [ color = "brown2", shape =box ];\n  "DisputeResolver.ShouldBeAtLeastTwoRulingOptions" [ color = "brown2", shape =box ];\n}\n\nsubgraph "clusterDisputeTemplateRegistry" {\n  graph [ label = "DisputeTemplateRegistry", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "DisputeTemplateRegistry.onlyByOwner" [ label = "onlyByOwner", color = "yellow" ];\n  "DisputeTemplateRegistry.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "DisputeTemplateRegistry.initialize" [ label = "initialize", color = "blue" ];\n  "DisputeTemplateRegistry._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "DisputeTemplateRegistry.changeOwner" [ label = "changeOwner", color = "blue" ];\n  "IDisputeTemplateRegistry.setDisputeTemplate" [ label = "setDisputeTemplate", color = "blue" ];\n  "DisputeTemplateRegistry.OwnerOnly" [ color = "brown2", shape =box ];\n  "DisputeTemplateRegistry._disableInitializers" [ label = "_disableInitializers" ];\n}\n\nsubgraph "clusterDisputeKitClassic" {\n  graph [ label = "DisputeKitClassic", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "DisputeKitClassic.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "DisputeKitClassic.initialize" [ label = "initialize", color = "blue" ];\n  "DisputeKitClassic._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "DisputeKitClassic._disableInitializers" [ label = "_disableInitializers" ];\n  "DisputeKitClassic.__DisputeKitClassicBase_initialize" [ label = "__DisputeKitClassicBase_initialize" ];\n}\n\nsubgraph "clusterDisputeKitClassicBase" {\n  graph [ label = "DisputeKitClassicBase", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "DisputeKitClassicBase.onlyByOwner" [ label = "onlyByOwner", color = "yellow" ];\n  "DisputeKitClassicBase.onlyByCore" [ label = "onlyByCore", color = "yellow" ];\n  "DisputeKitClassicBase.notJumped" [ label = "notJumped", color = "yellow" ];\n  "DisputeKitClassicBase.__DisputeKitClassicBase_initialize" [ label = "__DisputeKitClassicBase_initialize", color = "white" ];\n  "DisputeKitClassicBase.executeOwnerProposal" [ label = "executeOwnerProposal", color = "blue" ];\n  "DisputeKitClassicBase.changeOwner" [ label = "changeOwner", color = "blue" ];\n  "DisputeKitClassicBase.changeCore" [ label = "changeCore", color = "blue" ];\n  "DisputeKitClassicBase.changeJumpDisputeKitID" [ label = "changeJumpDisputeKitID", color = "blue" ];\n  "IDisputeKit.createDispute" [ label = "createDispute", color = "blue" ];\n  "IDisputeKit.draw" [ label = "draw", color = "blue" ];\n  "DisputeKitClassicBase.castCommit" [ label = "castCommit", color = "blue" ];\n  "DisputeKitClassicBase._castCommit" [ label = "_castCommit" ];\n  "DisputeKitClassicBase.castVote" [ label = "castVote", color = "blue" ];\n  "DisputeKitClassicBase._castVote" [ label = "_castVote" ];\n  "DisputeKitClassicBase.fundAppeal" [ label = "fundAppeal", color = "blue" ];\n  "DisputeKitClassicBase.withdrawFeesAndRewards" [ label = "withdrawFeesAndRewards", color = "blue" ];\n  "DisputeKitClassicBase.hashVote" [ label = "hashVote" ];\n  "DisputeKitClassicBase.getFundedChoices" [ label = "getFundedChoices" ];\n  "IDisputeKit.currentRuling" [ label = "currentRuling", color = "blue" ];\n  "IDisputeKit.getDegreeOfCoherenceReward" [ label = "getDegreeOfCoherenceReward", color = "blue" ];\n  "IDisputeKit.getDegreeOfCoherencePenalty" [ label = "getDegreeOfCoherencePenalty", color = "blue" ];\n  "DisputeKitClassicBase._getDegreeOfCoherence" [ label = "_getDegreeOfCoherence" ];\n  "IDisputeKit.getCoherentCount" [ label = "getCoherentCount", color = "blue" ];\n  "DisputeKitClassicBase.areCommitsAllCast" [ label = "areCommitsAllCast", color = "blue" ];\n  "DisputeKitClassicBase.areVotesAllCast" [ label = "areVotesAllCast", color = "blue" ];\n  "DisputeKitClassicBase.isAppealFunded" [ label = "isAppealFunded", color = "blue" ];\n  "DisputeKitClassicBase.earlyCourtJump" [ label = "earlyCourtJump", color = "blue" ];\n  "DisputeKitClassicBase.getNbVotesAfterAppeal" [ label = "getNbVotesAfterAppeal", color = "blue" ];\n  "DisputeKitClassicBase.getJumpDisputeKitID" [ label = "getJumpDisputeKitID", color = "blue" ];\n  "IDisputeKit.isVoteActive" [ label = "isVoteActive", color = "blue" ];\n  "DisputeKitClassicBase.getRoundInfo" [ label = "getRoundInfo", color = "blue" ];\n  "DisputeKitClassicBase.getNumberOfRounds" [ label = "getNumberOfRounds", color = "blue" ];\n  "DisputeKitClassicBase.getLocalDisputeRoundID" [ label = "getLocalDisputeRoundID", color = "blue" ];\n  "DisputeKitClassicBase.getVoteInfo" [ label = "getVoteInfo", color = "blue" ];\n  "DisputeKitClassicBase._getExpectedVoteHash" [ label = "_getExpectedVoteHash" ];\n  "DisputeKitClassicBase._postDrawCheck" [ label = "_postDrawCheck" ];\n  "DisputeKitClassicBase.OwnerOnly" [ color = "brown2", shape =box ];\n  "DisputeKitClassicBase.address" [ label = "address" ];\n  "DisputeKitClassicBase.KlerosCoreOnly" [ color = "brown2", shape =box ];\n  "DisputeKitClassicBase.DisputeJumpedToParentDK" [ color = "brown2", shape =box ];\n  "DisputeKitClassicBase.UnsuccessfulCall" [ color = "brown2", shape =box ];\n  "DisputeKitClassicBase.NotCommitPeriod" [ color = "brown2", shape =box ];\n  "DisputeKitClassicBase.EmptyCommit" [ color = "brown2", shape =box ];\n  "DisputeKitClassicBase.NotActiveForCoreDisputeID" [ color = "brown2", shape =box ];\n  "DisputeKitClassicBase.JurorHasToOwnTheVote" [ color = "brown2", shape =box ];\n  "DisputeKitClassicBase.NotVotePeriod" [ color = "brown2", shape =box ];\n  "DisputeKitClassicBase.EmptyVoteIDs" [ color = "brown2", shape =box ];\n  "DisputeKitClassicBase.ChoiceOutOfBounds" [ color = "brown2", shape =box ];\n  "DisputeKitClassicBase.HashDoesNotMatchHiddenVoteCommitment" [ color = "brown2", shape =box ];\n  "DisputeKitClassicBase.VoteAlreadyCast" [ color = "brown2", shape =box ];\n  "DisputeKitClassicBase.AppealPeriodIsOver" [ color = "brown2", shape =box ];\n  "DisputeKitClassicBase.AppealPeriodIsOverForLoser" [ color = "brown2", shape =box ];\n  "DisputeKitClassicBase.AppealFeeIsAlreadyPaid" [ color = "brown2", shape =box ];\n  "DisputeKitClassicBase.payable" [ label = "payable" ];\n  "DisputeKitClassicBase.DisputeNotResolved" [ color = "brown2", shape =box ];\n  "DisputeKitClassicBase.CoreIsPaused" [ color = "brown2", shape =box ];\n}\n\nsubgraph "clusterIBalanceHolder" {\n  graph [ label = "IBalanceHolder  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "IBalanceHolder.balanceOf" [ label = "balanceOf", color = "blue" ];\n}\n\nsubgraph "clusterIBalanceHolderERC1155" {\n  graph [ label = "IBalanceHolderERC1155  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "IBalanceHolderERC1155.balanceOf" [ label = "balanceOf", color = "blue" ];\n}\n\nsubgraph "clusterDisputeKitGated" {\n  graph [ label = "DisputeKitGated", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "DisputeKitGated.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "DisputeKitGated.initialize" [ label = "initialize", color = "blue" ];\n  "DisputeKitGated._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "DisputeKitGated.extraDataToTokenInfo" [ label = "extraDataToTokenInfo", color = "green" ];\n  "DisputeKitClassicBase._postDrawCheck" [ label = "_postDrawCheck", color = "white" ];\n  "DisputeKitGated._disableInitializers" [ label = "_disableInitializers" ];\n  "DisputeKitGated.__DisputeKitClassicBase_initialize" [ label = "__DisputeKitClassicBase_initialize" ];\n}\n\nsubgraph "clusterDisputeKitGatedShutter" {\n  graph [ label = "DisputeKitGatedShutter", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "DisputeKitGatedShutter.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "DisputeKitGatedShutter.initialize" [ label = "initialize", color = "blue" ];\n  "DisputeKitGatedShutter._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "DisputeKitGatedShutter.castCommitShutter" [ label = "castCommitShutter", color = "blue" ];\n  "DisputeKitGatedShutter.castVoteShutter" [ label = "castVoteShutter", color = "blue" ];\n  "DisputeKitClassicBase.hashVote" [ label = "hashVote", color = "green" ];\n  "DisputeKitClassicBase._getExpectedVoteHash" [ label = "_getExpectedVoteHash", color = "white" ];\n  "DisputeKitGatedShutter._extraDataToTokenInfo" [ label = "_extraDataToTokenInfo", color = "white" ];\n  "DisputeKitClassicBase._postDrawCheck" [ label = "_postDrawCheck", color = "white" ];\n  "DisputeKitGatedShutter._disableInitializers" [ label = "_disableInitializers" ];\n  "DisputeKitGatedShutter.__DisputeKitClassicBase_initialize" [ label = "__DisputeKitClassicBase_initialize" ];\n  "DisputeKitGatedShutter.EmptyRecoveryCommit" [ color = "brown2", shape =box ];\n}\n\nsubgraph "clusterDisputeKitShutter" {\n  graph [ label = "DisputeKitShutter", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "DisputeKitShutter.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "DisputeKitShutter.initialize" [ label = "initialize", color = "blue" ];\n  "DisputeKitShutter._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "DisputeKitShutter.castCommitShutter" [ label = "castCommitShutter", color = "blue" ];\n  "DisputeKitShutter.castVoteShutter" [ label = "castVoteShutter", color = "blue" ];\n  "DisputeKitClassicBase.hashVote" [ label = "hashVote", color = "green" ];\n  "DisputeKitClassicBase._getExpectedVoteHash" [ label = "_getExpectedVoteHash", color = "white" ];\n  "DisputeKitShutter._disableInitializers" [ label = "_disableInitializers" ];\n  "DisputeKitShutter.__DisputeKitClassicBase_initialize" [ label = "__DisputeKitClassicBase_initialize" ];\n  "DisputeKitShutter.EmptyRecoveryCommit" [ color = "brown2", shape =box ];\n}\n\nsubgraph "clusterIProofOfHumanity" {\n  graph [ label = "IProofOfHumanity  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "IProofOfHumanity.isRegistered" [ label = "isRegistered" ];\n}\n\nsubgraph "clusterDisputeKitSybilResistant" {\n  graph [ label = "DisputeKitSybilResistant", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "DisputeKitSybilResistant.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "DisputeKitSybilResistant.initialize" [ label = "initialize", color = "blue" ];\n  "DisputeKitSybilResistant._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "DisputeKitClassicBase._postDrawCheck" [ label = "_postDrawCheck", color = "white" ];\n  "DisputeKitSybilResistant._disableInitializers" [ label = "_disableInitializers" ];\n  "DisputeKitSybilResistant.__DisputeKitClassicBase_initialize" [ label = "__DisputeKitClassicBase_initialize" ];\n}\n\nsubgraph "clusterEvidenceModule" {\n  graph [ label = "EvidenceModule", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "EvidenceModule.onlyByOwner" [ label = "onlyByOwner", color = "yellow" ];\n  "EvidenceModule.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "EvidenceModule.initialize" [ label = "initialize", color = "blue" ];\n  "EvidenceModule._authorizeUpgrade" [ label = "_authorizeUpgrade", color = "white" ];\n  "EvidenceModule.submitEvidence" [ label = "submitEvidence", color = "blue" ];\n  "EvidenceModule.OwnerOnly" [ color = "brown2", shape =box ];\n  "EvidenceModule._disableInitializers" [ label = "_disableInitializers" ];\n}\n\nsubgraph "clusterIArbitrableV2" {\n  graph [ label = "IArbitrableV2  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "IArbitrableV2.rule" [ label = "rule", color = "blue" ];\n}\n\nsubgraph "clusterIArbitratorV2" {\n  graph [ label = "IArbitratorV2  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "IArbitratorV2.createDispute" [ label = "createDispute", color = "blue" ];\n  "IArbitratorV2.arbitrationCost" [ label = "arbitrationCost", color = "blue" ];\n  "IArbitratorV2.currentRuling" [ label = "currentRuling", color = "blue" ];\n}\n\nsubgraph "clusterIDisputeKit" {\n  graph [ label = "IDisputeKit  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "IDisputeKit.createDispute" [ label = "createDispute", color = "blue" ];\n  "IDisputeKit.draw" [ label = "draw", color = "blue" ];\n  "IDisputeKit.getCoherentCount" [ label = "getCoherentCount", color = "blue" ];\n  "IDisputeKit.getDegreeOfCoherencePenalty" [ label = "getDegreeOfCoherencePenalty", color = "blue" ];\n  "IDisputeKit.isVoteActive" [ label = "isVoteActive", color = "blue" ];\n  "IDisputeKit.getDegreeOfCoherenceReward" [ label = "getDegreeOfCoherenceReward", color = "blue" ];\n  "IDisputeKit.currentRuling" [ label = "currentRuling", color = "blue" ];\n  "IDisputeKit.areCommitsAllCast" [ label = "areCommitsAllCast", color = "blue" ];\n  "IDisputeKit.areVotesAllCast" [ label = "areVotesAllCast", color = "blue" ];\n  "IDisputeKit.isAppealFunded" [ label = "isAppealFunded", color = "blue" ];\n  "IDisputeKit.earlyCourtJump" [ label = "earlyCourtJump", color = "blue" ];\n  "IDisputeKit.getNbVotesAfterAppeal" [ label = "getNbVotesAfterAppeal", color = "blue" ];\n  "IDisputeKit.getJumpDisputeKitID" [ label = "getJumpDisputeKitID", color = "blue" ];\n  "IDisputeKit.getRoundInfo" [ label = "getRoundInfo", color = "blue" ];\n  "IDisputeKit.getVoteInfo" [ label = "getVoteInfo", color = "blue" ];\n}\n\nsubgraph "clusterIDisputeTemplateRegistry" {\n  graph [ label = "IDisputeTemplateRegistry  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "IDisputeTemplateRegistry.setDisputeTemplate" [ label = "setDisputeTemplate", color = "blue" ];\n}\n\nsubgraph "clusterIEvidence" {\n  graph [ label = "IEvidence  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n}\n\nsubgraph "clusterISortitionModule" {\n  graph [ label = "ISortitionModule  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "ISortitionModule.createTree" [ label = "createTree", color = "blue" ];\n  "ISortitionModule.createDisputeHook" [ label = "createDisputeHook", color = "blue" ];\n  "ISortitionModule.lockStake" [ label = "lockStake", color = "blue" ];\n  "ISortitionModule.postDrawHook" [ label = "postDrawHook", color = "blue" ];\n  "ISortitionModule.unlockStake" [ label = "unlockStake", color = "blue" ];\n  "ISortitionModule.setStakePenalty" [ label = "setStakePenalty", color = "blue" ];\n  "ISortitionModule.forcedUnstakeAllCourts" [ label = "forcedUnstakeAllCourts", color = "blue" ];\n  "ISortitionModule.forcedUnstake" [ label = "forcedUnstake", color = "blue" ];\n  "ISortitionModule.setStakeReward" [ label = "setStakeReward", color = "blue" ];\n  "ISortitionModule.validateStake" [ label = "validateStake", color = "blue" ];\n  "ISortitionModule.setStake" [ label = "setStake", color = "blue" ];\n  "ISortitionModule.draw" [ label = "draw", color = "blue" ];\n  "ISortitionModule.notifyRandomNumber" [ label = "notifyRandomNumber", color = "blue" ];\n  "ISortitionModule.getJurorBalance" [ label = "getJurorBalance", color = "blue" ];\n  "ISortitionModule.getJurorCourtIDs" [ label = "getJurorCourtIDs", color = "blue" ];\n  "ISortitionModule.isJurorStaked" [ label = "isJurorStaked", color = "blue" ];\n  "ISortitionModule.getJurorLeftoverPNK" [ label = "getJurorLeftoverPNK", color = "blue" ];\n  "ISortitionModule.withdrawLeftoverPNK" [ label = "withdrawLeftoverPNK", color = "blue" ];\n}\n\nsubgraph "clusterSafeERC20" {\n  graph [ label = "SafeERC20  (lib)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "SafeERC20.increaseAllowance" [ label = "increaseAllowance", color = "white" ];\n  "SafeERC20.safeTransfer" [ label = "safeTransfer", color = "white" ];\n  "SafeERC20.safeTransferFrom" [ label = "safeTransferFrom", color = "white" ];\n  "SafeERC20.address" [ label = "address" ];\n}\n\nsubgraph "clusterWethLike" {\n  graph [ label = "WethLike  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "WethLike.deposit" [ label = "deposit", color = "blue" ];\n  "WethLike.transfer" [ label = "transfer", color = "blue" ];\n}\n\nsubgraph "clusterSafeSend" {\n  graph [ label = "SafeSend  (lib)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "SafeSend.safeSend" [ label = "safeSend", color = "white" ];\n}\n\nsubgraph "clusterRNGWithFallback" {\n  graph [ label = "RNGWithFallback", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "RNGWithFallback.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "RNGWithFallback.onlyByOwner" [ label = "onlyByOwner", color = "yellow" ];\n  "RNGWithFallback.onlyByConsumer" [ label = "onlyByConsumer", color = "yellow" ];\n  "RNGWithFallback.changeOwner" [ label = "changeOwner", color = "blue" ];\n  "RNGWithFallback.changeConsumer" [ label = "changeConsumer", color = "blue" ];\n  "RNGWithFallback.changeFallbackTimeout" [ label = "changeFallbackTimeout", color = "blue" ];\n  "IRNG.requestRandomness" [ label = "requestRandomness", color = "blue" ];\n  "IRNG.receiveRandomness" [ label = "receiveRandomness", color = "blue" ];\n  "RNGWithFallback.address" [ label = "address" ];\n  "RNGWithFallback.InvalidDefaultRNG" [ color = "brown2", shape =box ];\n  "RNGWithFallback.OwnerOnly" [ color = "brown2", shape =box ];\n  "RNGWithFallback.ConsumerOnly" [ color = "brown2", shape =box ];\n  "RNGWithFallback.blockhash" [ label = "blockhash" ];\n}\n\nsubgraph "clusterChainlinkRNG" {\n  graph [ label = "ChainlinkRNG", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "ChainlinkRNG.onlyByOwner" [ label = "onlyByOwner", color = "yellow" ];\n  "ChainlinkRNG.onlyByConsumer" [ label = "onlyByConsumer", color = "yellow" ];\n  "ChainlinkRNG.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "ChainlinkRNG.changeOwner" [ label = "changeOwner", color = "blue" ];\n  "ChainlinkRNG.changeConsumer" [ label = "changeConsumer", color = "blue" ];\n  "ChainlinkRNG.changeVrfCoordinator" [ label = "changeVrfCoordinator", color = "blue" ];\n  "ChainlinkRNG.changeKeyHash" [ label = "changeKeyHash", color = "blue" ];\n  "ChainlinkRNG.changeSubscriptionId" [ label = "changeSubscriptionId", color = "blue" ];\n  "ChainlinkRNG.changeRequestConfirmations" [ label = "changeRequestConfirmations", color = "blue" ];\n  "ChainlinkRNG.changeCallbackGasLimit" [ label = "changeCallbackGasLimit", color = "blue" ];\n  "IRNG.requestRandomness" [ label = "requestRandomness", color = "blue" ];\n  "ChainlinkRNG.fulfillRandomWords" [ label = "fulfillRandomWords", color = "white" ];\n  "IRNG.receiveRandomness" [ label = "receiveRandomness", color = "blue" ];\n  "ChainlinkRNG.OwnerOnly" [ color = "brown2", shape =box ];\n  "ChainlinkRNG.ConsumerOnly" [ color = "brown2", shape =box ];\n  "ChainlinkRNG.IVRFCoordinatorV2Plus" [ label = "IVRFCoordinatorV2Plus" ];\n  "ChainlinkRNG.CoordinatorSet" [ label = "CoordinatorSet" ];\n}\n\nsubgraph "clusterIRNG" {\n  graph [ label = "IRNG  (iface)", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "IRNG.requestRandomness" [ label = "requestRandomness", color = "blue" ];\n  "IRNG.receiveRandomness" [ label = "receiveRandomness", color = "blue" ];\n}\n\nsubgraph "clusterUUPSProxiable" {\n  graph [ label = "UUPSProxiable", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "UUPSProxiable._authorizeUpgrade" [ label = "_authorizeUpgrade" ];\n  "UUPSProxiable.upgradeToAndCall" [ label = "upgradeToAndCall", color = "green" ];\n  "UUPSProxiable.proxiableUUID" [ label = "proxiableUUID", color = "blue" ];\n  "UUPSProxiable.version" [ label = "version", color = "blue" ];\n  "UUPSProxiable._getImplementation" [ label = "_getImplementation" ];\n  "UUPSProxiable.address" [ label = "address" ];\n  "UUPSProxiable.UUPSUnauthorizedCallContext" [ color = "brown2", shape =box ];\n  "UUPSProxiable.UUPSUnsupportedProxiableUUID" [ color = "brown2", shape =box ];\n  "UUPSProxiable.FailedDelegateCall" [ color = "brown2", shape =box ];\n  "UUPSProxiable.InvalidImplementation" [ color = "brown2", shape =box ];\n}\n\nsubgraph "clusterUUPSProxy" {\n  graph [ label = "UUPSProxy", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "UUPSProxy.<Constructor>" [ label = "<Constructor>", color = "green" ];\n  "UUPSProxy._delegate" [ label = "_delegate" ];\n  "UUPSProxy._getImplementation" [ label = "_getImplementation" ];\n  "UUPSProxy.<Fallback>" [ label = "<Fallback>", color = "blue" ];\n  "UUPSProxy.<Receive Ether>" [ label = "<Receive Ether>", color = "blue" ];\n}\n\nsubgraph "clusterInitializable" {\n  graph [ label = "Initializable", color = "lightgray", style = "filled", bgcolor = "lightgray" ];\n  "Initializable.initializer" [ label = "initializer", color = "yellow" ];\n  "Initializable.reinitializer" [ label = "reinitializer", color = "yellow" ];\n  "Initializable.onlyInitializing" [ label = "onlyInitializing", color = "yellow" ];\n  "Initializable._checkInitializing" [ label = "_checkInitializing" ];\n  "Initializable._disableInitializers" [ label = "_disableInitializers", color = "white" ];\n  "Initializable._getInitializedVersion" [ label = "_getInitializedVersion", color = "white" ];\n  "Initializable._isInitializing" [ label = "_isInitializing" ];\n  "Initializable._getInitializableStorage" [ label = "_getInitializableStorage" ];\n  "Initializable.address" [ label = "address" ];\n  "Initializable.AlreadyInitialized" [ color = "brown2", shape =box ];\n  "Initializable.NotInitializing" [ color = "brown2", shape =box ];\n  "Initializable.type" [ label = "type" ];\n}\n\nsubgraph "clusterIERC721" {\n  graph [ label = "IERC721", color = "lightgray" ];\n  "IERC721.balanceOf" [ label = "balanceOf" ];\n}\n\nsubgraph "clusterIERC20" {\n  graph [ label = "IERC20", color = "lightgray" ];\n  "IERC20.safeTransfer" [ label = "safeTransfer" ];\n  "IERC20.safeTransferFrom" [ label = "safeTransferFrom" ];\n  "IERC20.approve" [ label = "approve" ];\n  "IERC20.allowance" [ label = "allowance" ];\n  "IERC20.UTION: When used with inheritance, manual care" [ label = "UTION: When used with inheritance, manual care" ];\n  "IERC20.utomatically lock it when it is deployed:\n *\n * ```\n * //" [ label = "utomatically lock it when it is deployed:\n *\n * ```\n * //" ];\n}\n\nsubgraph "cluster_recipient" {\n  graph [ label = "_recipient", color = "lightgray" ];\n  "_recipient.safeSend" [ label = "safeSend" ];\n}\n\nsubgraph "clusterCourtID" {\n  graph [ label = "CourtID", color = "lightgray" ];\n  "CourtID.wrap" [ label = "wrap" ];\n}\n\nsubgraph "clustersortitionSumTrees" {\n  graph [ label = "sortitionSumTrees", color = "lightgray" ];\n  "sortitionSumTrees.createTree" [ label = "createTree" ];\n}\n\nsubgraph "clusterSortitionTrees" {\n  graph [ label = "SortitionTrees", color = "lightgray" ];\n  "SortitionTrees.toStakePathID" [ label = "toStakePathID" ];\n}\n\nsubgraph "cluster_beneficiary" {\n  graph [ label = "_beneficiary", color = "lightgray" ];\n  "_beneficiary.safeSend" [ label = "safeSend" ];\n}\n\nsubgraph "clusterabi" {\n  graph [ label = "abi", color = "lightgray" ];\n  "abi.encodeCall" [ label = "encodeCall" ];\n}\n\nsubgraph "cluster_to" {\n  graph [ label = "_to", color = "lightgray" ];\n  "_to.send" [ label = "send" ];\n}\n\nsubgraph "clusters_vrfCoordinator" {\n  graph [ label = "s_vrfCoordinator", color = "lightgray" ];\n  "s_vrfCoordinator.requestRandomWords" [ label = "requestRandomWords" ];\n}\n\nsubgraph "clusterVRFV2PlusClient" {\n  graph [ label = "VRFV2PlusClient", color = "lightgray" ];\n  "VRFV2PlusClient.RandomWordsRequest" [ label = "RandomWordsRequest" ];\n  "VRFV2PlusClient._argsToBytes" [ label = "_argsToBytes" ];\n  "VRFV2PlusClient.ExtraArgsV1" [ label = "ExtraArgsV1" ];\n}\n\nsubgraph "clusternewImplementation" {\n  graph [ label = "newImplementation", color = "lightgray" ];\n  "newImplementation.delegatecall" [ label = "delegatecall" ];\n}\n\nsubgraph "cluster_implementation" {\n  graph [ label = "_implementation", color = "lightgray" ];\n  "_implementation.delegatecall" [ label = "delegatecall" ];\n}\n\n  "KlerosCore.onlyByOwner";\n  "KlerosCore.OwnerOnly";\n  "KlerosCore.onlyByGuardianOrOwner";\n  "KlerosCore.GuardianOrOwnerOnly";\n  "KlerosCore.whenPaused";\n  "KlerosCore.WhenPausedOnly";\n  "KlerosCore.whenNotPaused";\n  "KlerosCore.WhenNotPausedOnly";\n  "KlerosCore.<Constructor>";\n  "KlerosCore._disableInitializers";\n  "KlerosCore.initialize";\n  "ISortitionModule.createTree";\n  "KlerosCore._enableDisputeKit";\n  "KlerosCore.executeOwnerProposal";\n  "KlerosCore.UnsuccessfulCall";\n  "KlerosCore.createCourt";\n  "KlerosCore.MinStakeLowerThanParentCourt";\n  "KlerosCore.UnsupportedDisputeKit";\n  "KlerosCore.InvalidForkingCourtAsParent";\n  "KlerosCore.WrongDisputeKitIndex";\n  "KlerosCore.MustSupportDisputeKitClassic";\n  "KlerosCore.changeCourtParameters";\n  "KlerosCore.enableDisputeKits";\n  "KlerosCore.CannotDisableClassicDK";\n  "KlerosCore.setStake";\n  "KlerosCore.address";\n  "IERC721.balanceOf";\n  "KlerosCore.NotEligibleForStaking";\n  "KlerosCore._setStake";\n  "KlerosCore.setStakeBySortitionModule";\n  "KlerosCore.SortitionModuleOnly";\n  "KlerosCore.transferBySortitionModule";\n  "IERC20.safeTransfer";\n  "KlerosCore.createDispute";\n  "KlerosCore.arbitrationCost";\n  "KlerosCore.ArbitrationFeesNotEnough";\n  "KlerosCore._createDispute";\n  "KlerosCore.TokenNotAccepted";\n  "IERC20.safeTransferFrom";\n  "KlerosCore.TransferFailed";\n  "KlerosCore.ArbitrableNotWhitelisted";\n  "KlerosCore._extraDataToCourtIDMinJurorsDisputeKit";\n  "KlerosCore.DisputeKitNotSupportedByCourt";\n  "KlerosCore.convertEthToTokenAmount";\n  "KlerosCore._calculatePnkAtStake";\n  "KlerosCore.IERC20";\n  "ISortitionModule.createDisputeHook";\n  "IDisputeKit.createDispute";\n  "KlerosCore.passPeriod";\n  "KlerosCore.EvidenceNotPassedAndNotAppeal";\n  "KlerosCore.DisputeStillDrawing";\n  "KlerosCore.CommitPeriodNotPassed";\n  "KlerosCore.VotePeriodNotPassed";\n  "KlerosCore.AppealPeriodNotPassed";\n  "KlerosCore.DisputePeriodIsFinal";\n  "KlerosCore.draw";\n  "KlerosCore.NotEvidencePeriod";\n  "IDisputeKit.draw";\n  "ISortitionModule.lockStake";\n  "ISortitionModule.postDrawHook";\n  "KlerosCore.appeal";\n  "KlerosCore.appealCost";\n  "KlerosCore.AppealFeesNotEnough";\n  "KlerosCore.DisputeNotAppealable";\n  "KlerosCore.DisputeKitOnly";\n  "KlerosCore._getCourtAndDisputeKitJumps";\n  "KlerosCore.execute";\n  "KlerosCore.NotExecutionPeriod";\n  "IDisputeKit.getCoherentCount";\n  "KlerosCore._executePenalties";\n  "KlerosCore._executeRewards";\n  "IDisputeKit.getDegreeOfCoherencePenalty";\n  "ISortitionModule.unlockStake";\n  "ISortitionModule.setStakePenalty";\n  "IDisputeKit.isVoteActive";\n  "ISortitionModule.forcedUnstakeAllCourts";\n  "ISortitionModule.forcedUnstake";\n  "KlerosCore._transferFeeToken";\n  "KlerosCore.payable";\n  "IDisputeKit.getDegreeOfCoherenceReward";\n  "KlerosCore._applyCoherence";\n  "ISortitionModule.setStakeReward";\n  "KlerosCore.executeRuling";\n  "KlerosCore.RulingAlreadyExecuted";\n  "KlerosCore.currentRuling";\n  "IDisputeKit.currentRuling";\n  "KlerosCore.isDisputeKitJumping";\n  "KlerosCore._isCourtJumping";\n  "_recipient.safeSend";\n  "KlerosCore._stakingFailed";\n  "ISortitionModule.validateStake";\n  "ISortitionModule.setStake";\n  "KlerosCore.StakingTransferFailed";\n  "KlerosCore.UnstakingTransferFailed";\n  "KlerosCore.StakingInTooManyCourts";\n  "KlerosCore.StakingNotPossibleInThisCourt";\n  "KlerosCore.StakingLessThanCourtMinStake";\n  "KlerosCore.StakingZeroWhenNoStake";\n  "KlerosCore.StakingMoreThanMaxStakePerJuror";\n  "KlerosCore.StakingMoreThanMaxTotalStaked";\n  "PolicyRegistry.onlyByOwner";\n  "PolicyRegistry.OwnerOnly";\n  "PolicyRegistry.<Constructor>";\n  "PolicyRegistry._disableInitializers";\n  "SortitionModule.<Constructor>";\n  "SortitionModule._disableInitializers";\n  "SortitionModule.onlyByOwner";\n  "SortitionModule.OwnerOnly";\n  "SortitionModule.onlyByCore";\n  "SortitionModule.address";\n  "SortitionModule.KlerosCoreOnly";\n  "SortitionModule.changeRandomNumberGenerator";\n  "IRNG.requestRandomness";\n  "SortitionModule.passPhase";\n  "SortitionModule.MinStakingTimeNotPassed";\n  "SortitionModule.NoDisputesThatNeedJurors";\n  "IRNG.receiveRandomness";\n  "SortitionModule.RandomNumberNotReady";\n  "SortitionModule.DisputesWithoutJurorsAndMaxDrawingTimeNotPassed";\n  "CourtID.wrap";\n  "SortitionModule._extraDataToTreeK";\n  "sortitionSumTrees.createTree";\n  "SortitionModule.executeDelayedStakes";\n  "SortitionModule.NotStakingPhase";\n  "SortitionModule.NoDelayedStakeToExecute";\n  "SortitionModule._validateStake";\n  "SortitionModule.stakeOf";\n  "SortitionModule._setStake";\n  "SortitionTrees.toStakePathID";\n  "KlerosCore.courts";\n  "SortitionModule.getJurorLeftoverPNK";\n  "SortitionModule.getJurorCourtIDs";\n  "SortitionModule.withdrawLeftoverPNK";\n  "SortitionModule.NotEligibleForWithdrawal";\n  "SortitionModule.draw";\n  "SortitionModule.NotDrawingPhase";\n  "SortitionModule.getJurorBalance";\n  "DisputeResolver.changeOwner";\n  "DisputeResolver.OwnerOnly";\n  "DisputeResolver.changeArbitrator";\n  "DisputeResolver.changeTemplateRegistry";\n  "DisputeResolver.createDisputeForTemplate";\n  "DisputeResolver._createDispute";\n  "DisputeResolver.createDisputeForTemplateUri";\n  "DisputeResolver.rule";\n  "DisputeResolver.address";\n  "DisputeResolver.ArbitratorOnly";\n  "DisputeResolver.RulingOutOfBounds";\n  "DisputeResolver.DisputeAlreadyRuled";\n  "DisputeResolver.ShouldBeAtLeastTwoRulingOptions";\n  "IDisputeTemplateRegistry.setDisputeTemplate";\n  "DisputeTemplateRegistry.onlyByOwner";\n  "DisputeTemplateRegistry.OwnerOnly";\n  "DisputeTemplateRegistry.<Constructor>";\n  "DisputeTemplateRegistry._disableInitializers";\n  "DisputeKitClassic.<Constructor>";\n  "DisputeKitClassic._disableInitializers";\n  "DisputeKitClassic.initialize";\n  "DisputeKitClassic.__DisputeKitClassicBase_initialize";\n  "DisputeKitClassicBase.onlyByOwner";\n  "DisputeKitClassicBase.OwnerOnly";\n  "DisputeKitClassicBase.onlyByCore";\n  "DisputeKitClassicBase.address";\n  "DisputeKitClassicBase.KlerosCoreOnly";\n  "DisputeKitClassicBase.notJumped";\n  "DisputeKitClassicBase.DisputeJumpedToParentDK";\n  "DisputeKitClassicBase.executeOwnerProposal";\n  "DisputeKitClassicBase.UnsuccessfulCall";\n  "KlerosCore.getNumberOfRounds";\n  "KlerosCore.sortitionModule";\n  "KlerosCore.disputes";\n  "ISortitionModule.draw";\n  "DisputeKitClassicBase._postDrawCheck";\n  "DisputeKitClassicBase.castCommit";\n  "DisputeKitClassicBase._castCommit";\n  "DisputeKitClassicBase.NotCommitPeriod";\n  "DisputeKitClassicBase.EmptyCommit";\n  "DisputeKitClassicBase.NotActiveForCoreDisputeID";\n  "DisputeKitClassicBase.JurorHasToOwnTheVote";\n  "DisputeKitClassicBase.castVote";\n  "DisputeKitClassicBase._castVote";\n  "DisputeKitClassicBase.NotVotePeriod";\n  "DisputeKitClassicBase.EmptyVoteIDs";\n  "DisputeKitClassicBase.ChoiceOutOfBounds";\n  "DisputeKitClassicBase.hashVote";\n  "DisputeKitClassicBase._getExpectedVoteHash";\n  "DisputeKitClassicBase.HashDoesNotMatchHiddenVoteCommitment";\n  "DisputeKitClassicBase.VoteAlreadyCast";\n  "DisputeKitClassicBase.fundAppeal";\n  "KlerosCore.appealPeriod";\n  "DisputeKitClassicBase.AppealPeriodIsOver";\n  "DisputeKitClassicBase.AppealPeriodIsOverForLoser";\n  "DisputeKitClassicBase.AppealFeeIsAlreadyPaid";\n  "KlerosCore.getNumberOfVotes";\n  "DisputeKitClassicBase.payable";\n  "DisputeKitClassicBase.withdrawFeesAndRewards";\n  "DisputeKitClassicBase.DisputeNotResolved";\n  "KlerosCore.paused";\n  "DisputeKitClassicBase.CoreIsPaused";\n  "_beneficiary.safeSend";\n  "DisputeKitClassicBase.getFundedChoices";\n  "DisputeKitClassicBase._getDegreeOfCoherence";\n  "DisputeKitClassicBase.areVotesAllCast";\n  "DisputeKitClassicBase.isAppealFunded";\n  "DisputeKitGated.<Constructor>";\n  "DisputeKitGated._disableInitializers";\n  "DisputeKitGated.initialize";\n  "DisputeKitGated.__DisputeKitClassicBase_initialize";\n  "DisputeKitGated.extraDataToTokenInfo";\n  "DisputeKitGatedShutter.<Constructor>";\n  "DisputeKitGatedShutter._disableInitializers";\n  "DisputeKitGatedShutter.initialize";\n  "DisputeKitGatedShutter.__DisputeKitClassicBase_initialize";\n  "DisputeKitGatedShutter.castCommitShutter";\n  "DisputeKitGatedShutter.EmptyRecoveryCommit";\n  "DisputeKitGatedShutter.castVoteShutter";\n  "DisputeKitGatedShutter._extraDataToTokenInfo";\n  "DisputeKitShutter.<Constructor>";\n  "DisputeKitShutter._disableInitializers";\n  "DisputeKitShutter.initialize";\n  "DisputeKitShutter.__DisputeKitClassicBase_initialize";\n  "DisputeKitShutter.castCommitShutter";\n  "DisputeKitShutter.EmptyRecoveryCommit";\n  "DisputeKitShutter.castVoteShutter";\n  "DisputeKitSybilResistant.<Constructor>";\n  "DisputeKitSybilResistant._disableInitializers";\n  "DisputeKitSybilResistant.initialize";\n  "DisputeKitSybilResistant.__DisputeKitClassicBase_initialize";\n  "IProofOfHumanity.isRegistered";\n  "EvidenceModule.onlyByOwner";\n  "EvidenceModule.OwnerOnly";\n  "EvidenceModule.<Constructor>";\n  "EvidenceModule._disableInitializers";\n  "SafeERC20.increaseAllowance";\n  "IERC20.approve";\n  "IERC20.allowance";\n  "SafeERC20.address";\n  "SafeERC20.safeTransfer";\n  "IERC20.UTION: When used with inheritance, manual care";\n  "abi.encodeCall";\n  "SafeERC20.safeTransferFrom";\n  "IERC20.utomatically lock it when it is deployed:\n *\n * ```\n * //";\n  "SafeSend.safeSend";\n  "_to.send";\n  "RNGWithFallback.<Constructor>";\n  "RNGWithFallback.address";\n  "RNGWithFallback.InvalidDefaultRNG";\n  "RNGWithFallback.onlyByOwner";\n  "RNGWithFallback.OwnerOnly";\n  "RNGWithFallback.onlyByConsumer";\n  "RNGWithFallback.ConsumerOnly";\n  "RNGWithFallback.blockhash";\n  "ChainlinkRNG.onlyByOwner";\n  "ChainlinkRNG.OwnerOnly";\n  "ChainlinkRNG.onlyByConsumer";\n  "ChainlinkRNG.ConsumerOnly";\n  "ChainlinkRNG.changeVrfCoordinator";\n  "ChainlinkRNG.IVRFCoordinatorV2Plus";\n  "ChainlinkRNG.CoordinatorSet";\n  "s_vrfCoordinator.requestRandomWords";\n  "VRFV2PlusClient.RandomWordsRequest";\n  "VRFV2PlusClient._argsToBytes";\n  "VRFV2PlusClient.ExtraArgsV1";\n  "UUPSProxiable.upgradeToAndCall";\n  "UUPSProxiable._authorizeUpgrade";\n  "UUPSProxiable.address";\n  "UUPSProxiable._getImplementation";\n  "UUPSProxiable.UUPSUnauthorizedCallContext";\n  "UUPSProxiable.UUPSUnsupportedProxiableUUID";\n  "newImplementation.delegatecall";\n  "UUPSProxiable.FailedDelegateCall";\n  "UUPSProxiable.InvalidImplementation";\n  "UUPSProxiable.proxiableUUID";\n  "UUPSProxy.<Constructor>";\n  "_implementation.delegatecall";\n  "UUPSProxy.<Fallback>";\n  "UUPSProxy._delegate";\n  "UUPSProxy._getImplementation";\n  "UUPSProxy.<Receive Ether>";\n  "Initializable.initializer";\n  "Initializable._getInitializableStorage";\n  "Initializable.address";\n  "Initializable.AlreadyInitialized";\n  "Initializable.reinitializer";\n  "Initializable.onlyInitializing";\n  "Initializable._checkInitializing";\n  "Initializable._isInitializing";\n  "Initializable.NotInitializing";\n  "Initializable._disableInitializers";\n  "Initializable.type";\n  "Initializable._getInitializedVersion";\n  "KlerosCore.onlyByOwner" -> "KlerosCore.OwnerOnly" [ color = "red" ];\n  "KlerosCore.onlyByGuardianOrOwner" -> "KlerosCore.GuardianOrOwnerOnly" [ color = "red" ];\n  "KlerosCore.whenPaused" -> "KlerosCore.WhenPausedOnly" [ color = "red" ];\n  "KlerosCore.whenNotPaused" -> "KlerosCore.WhenNotPausedOnly" [ color = "red" ];\n  "KlerosCore.<Constructor>" -> "KlerosCore._disableInitializers" [ color = "green" ];\n  "KlerosCore.initialize" -> "ISortitionModule.createTree" [ color = "orange" ];\n  "KlerosCore.initialize" -> "ISortitionModule.createTree" [ color = "orange" ];\n  "KlerosCore.initialize" -> "KlerosCore._enableDisputeKit" [ color = "green" ];\n  "KlerosCore.executeOwnerProposal" -> "KlerosCore.UnsuccessfulCall" [ color = "red" ];\n  "KlerosCore.createCourt" -> "KlerosCore.MinStakeLowerThanParentCourt" [ color = "red" ];\n  "KlerosCore.createCourt" -> "KlerosCore.UnsupportedDisputeKit" [ color = "red" ];\n  "KlerosCore.createCourt" -> "KlerosCore.InvalidForkingCourtAsParent" [ color = "red" ];\n  "KlerosCore.createCourt" -> "KlerosCore.WrongDisputeKitIndex" [ color = "red" ];\n  "KlerosCore.createCourt" -> "KlerosCore._enableDisputeKit" [ color = "green" ];\n  "KlerosCore.createCourt" -> "KlerosCore.MustSupportDisputeKitClassic" [ color = "red" ];\n  "KlerosCore.createCourt" -> "ISortitionModule.createTree" [ color = "orange" ];\n  "KlerosCore.changeCourtParameters" -> "KlerosCore.MinStakeLowerThanParentCourt" [ color = "red" ];\n  "KlerosCore.changeCourtParameters" -> "KlerosCore.MinStakeLowerThanParentCourt" [ color = "red" ];\n  "KlerosCore.enableDisputeKits" -> "KlerosCore.WrongDisputeKitIndex" [ color = "red" ];\n  "KlerosCore.enableDisputeKits" -> "KlerosCore._enableDisputeKit" [ color = "green" ];\n  "KlerosCore.enableDisputeKits" -> "KlerosCore.CannotDisableClassicDK" [ color = "red" ];\n  "KlerosCore.enableDisputeKits" -> "KlerosCore._enableDisputeKit" [ color = "green" ];\n  "KlerosCore.setStake" -> "KlerosCore.address" [ color = "green" ];\n  "KlerosCore.setStake" -> "KlerosCore.address" [ color = "green" ];\n  "KlerosCore.setStake" -> "IERC721.balanceOf" [ color = "orange" ];\n  "KlerosCore.setStake" -> "KlerosCore.NotEligibleForStaking" [ color = "red" ];\n  "KlerosCore.setStake" -> "KlerosCore._setStake" [ color = "green" ];\n  "KlerosCore.setStakeBySortitionModule" -> "KlerosCore.address" [ color = "green" ];\n  "KlerosCore.setStakeBySortitionModule" -> "KlerosCore.SortitionModuleOnly" [ color = "red" ];\n  "KlerosCore.setStakeBySortitionModule" -> "KlerosCore._setStake" [ color = "green" ];\n  "KlerosCore.transferBySortitionModule" -> "KlerosCore.address" [ color = "green" ];\n  "KlerosCore.transferBySortitionModule" -> "KlerosCore.SortitionModuleOnly" [ color = "red" ];\n  "KlerosCore.transferBySortitionModule" -> "IERC20.safeTransfer" [ color = "orange" ];\n  "KlerosCore.createDispute" -> "KlerosCore.arbitrationCost" [ color = "green" ];\n  "KlerosCore.createDispute" -> "KlerosCore.ArbitrationFeesNotEnough" [ color = "red" ];\n  "KlerosCore.createDispute" -> "KlerosCore._createDispute" [ color = "green" ];\n  "KlerosCore.createDispute" -> "KlerosCore.TokenNotAccepted" [ color = "red" ];\n  "KlerosCore.createDispute" -> "KlerosCore.arbitrationCost" [ color = "green" ];\n  "KlerosCore.createDispute" -> "KlerosCore.ArbitrationFeesNotEnough" [ color = "red" ];\n  "KlerosCore.createDispute" -> "IERC20.safeTransferFrom" [ color = "orange" ];\n  "KlerosCore.createDispute" -> "KlerosCore.address" [ color = "green" ];\n  "KlerosCore.createDispute" -> "KlerosCore.TransferFailed" [ color = "red" ];\n  "KlerosCore.createDispute" -> "KlerosCore._createDispute" [ color = "green" ];\n  "KlerosCore._createDispute" -> "KlerosCore.ArbitrableNotWhitelisted" [ color = "red" ];\n  "KlerosCore._createDispute" -> "KlerosCore._extraDataToCourtIDMinJurorsDisputeKit" [ color = "green" ];\n  "KlerosCore._createDispute" -> "KlerosCore.DisputeKitNotSupportedByCourt" [ color = "red" ];\n  "KlerosCore._createDispute" -> "KlerosCore.convertEthToTokenAmount" [ color = "green" ];\n  "KlerosCore._createDispute" -> "KlerosCore._calculatePnkAtStake" [ color = "green" ];\n  "KlerosCore._createDispute" -> "KlerosCore.IERC20" [ color = "green" ];\n  "KlerosCore._createDispute" -> "ISortitionModule.createDisputeHook" [ color = "orange" ];\n  "KlerosCore._createDispute" -> "IDisputeKit.createDispute" [ color = "orange" ];\n  "KlerosCore.passPeriod" -> "KlerosCore.EvidenceNotPassedAndNotAppeal" [ color = "red" ];\n  "KlerosCore.passPeriod" -> "KlerosCore.DisputeStillDrawing" [ color = "red" ];\n  "KlerosCore.passPeriod" -> "KlerosCore.CommitPeriodNotPassed" [ color = "red" ];\n  "KlerosCore.passPeriod" -> "KlerosCore.VotePeriodNotPassed" [ color = "red" ];\n  "KlerosCore.passPeriod" -> "KlerosCore.AppealPeriodNotPassed" [ color = "red" ];\n  "KlerosCore.passPeriod" -> "KlerosCore.DisputePeriodIsFinal" [ color = "red" ];\n  "KlerosCore.draw" -> "KlerosCore.NotEvidencePeriod" [ color = "red" ];\n  "KlerosCore.draw" -> "IDisputeKit.draw" [ color = "orange" ];\n  "KlerosCore.draw" -> "KlerosCore.address" [ color = "green" ];\n  "KlerosCore.draw" -> "ISortitionModule.lockStake" [ color = "orange" ];\n  "KlerosCore.draw" -> "ISortitionModule.postDrawHook" [ color = "orange" ];\n  "KlerosCore.appeal" -> "KlerosCore.appealCost" [ color = "green" ];\n  "KlerosCore.appeal" -> "KlerosCore.AppealFeesNotEnough" [ color = "red" ];\n  "KlerosCore.appeal" -> "KlerosCore.DisputeNotAppealable" [ color = "red" ];\n  "KlerosCore.appeal" -> "KlerosCore.address" [ color = "green" ];\n  "KlerosCore.appeal" -> "KlerosCore.DisputeKitOnly" [ color = "red" ];\n  "KlerosCore.appeal" -> "KlerosCore._getCourtAndDisputeKitJumps" [ color = "green" ];\n  "KlerosCore.appeal" -> "KlerosCore._calculatePnkAtStake" [ color = "green" ];\n  "KlerosCore.appeal" -> "ISortitionModule.createDisputeHook" [ color = "orange" ];\n  "KlerosCore.execute" -> "KlerosCore.NotExecutionPeriod" [ color = "red" ];\n  "KlerosCore.execute" -> "IDisputeKit.getCoherentCount" [ color = "orange" ];\n  "KlerosCore.execute" -> "KlerosCore._executePenalties" [ color = "green" ];\n  "KlerosCore.execute" -> "KlerosCore._executeRewards" [ color = "green" ];\n  "KlerosCore._executePenalties" -> "IDisputeKit.getDegreeOfCoherencePenalty" [ color = "orange" ];\n  "KlerosCore._executePenalties" -> "ISortitionModule.unlockStake" [ color = "orange" ];\n  "KlerosCore._executePenalties" -> "ISortitionModule.setStakePenalty" [ color = "orange" ];\n  "KlerosCore._executePenalties" -> "IDisputeKit.isVoteActive" [ color = "orange" ];\n  "KlerosCore._executePenalties" -> "ISortitionModule.forcedUnstakeAllCourts" [ color = "orange" ];\n  "KlerosCore._executePenalties" -> "ISortitionModule.forcedUnstake" [ color = "orange" ];\n  "KlerosCore._executePenalties" -> "KlerosCore._transferFeeToken" [ color = "green" ];\n  "KlerosCore._executePenalties" -> "KlerosCore.payable" [ color = "green" ];\n  "KlerosCore._executePenalties" -> "IERC20.safeTransfer" [ color = "orange" ];\n  "KlerosCore._executeRewards" -> "IDisputeKit.getDegreeOfCoherenceReward" [ color = "orange" ];\n  "KlerosCore._executeRewards" -> "KlerosCore._applyCoherence" [ color = "green" ];\n  "KlerosCore._executeRewards" -> "ISortitionModule.unlockStake" [ color = "orange" ];\n  "KlerosCore._executeRewards" -> "KlerosCore._applyCoherence" [ color = "green" ];\n  "KlerosCore._executeRewards" -> "KlerosCore._applyCoherence" [ color = "green" ];\n  "KlerosCore._executeRewards" -> "KlerosCore._transferFeeToken" [ color = "green" ];\n  "KlerosCore._executeRewards" -> "KlerosCore.payable" [ color = "green" ];\n  "KlerosCore._executeRewards" -> "ISortitionModule.setStakeReward" [ color = "orange" ];\n  "KlerosCore._executeRewards" -> "IERC20.safeTransfer" [ color = "orange" ];\n  "KlerosCore._executeRewards" -> "IERC20.safeTransfer" [ color = "orange" ];\n  "KlerosCore._executeRewards" -> "KlerosCore._transferFeeToken" [ color = "green" ];\n  "KlerosCore._executeRewards" -> "KlerosCore.payable" [ color = "green" ];\n  "KlerosCore.executeRuling" -> "KlerosCore.NotExecutionPeriod" [ color = "red" ];\n  "KlerosCore.executeRuling" -> "KlerosCore.RulingAlreadyExecuted" [ color = "red" ];\n  "KlerosCore.executeRuling" -> "KlerosCore.currentRuling" [ color = "green" ];\n  "KlerosCore.arbitrationCost" -> "KlerosCore._extraDataToCourtIDMinJurorsDisputeKit" [ color = "green" ];\n  "KlerosCore.arbitrationCost" -> "KlerosCore.convertEthToTokenAmount" [ color = "green" ];\n  "KlerosCore.arbitrationCost" -> "KlerosCore.arbitrationCost" [ color = "green" ];\n  "KlerosCore.appealCost" -> "KlerosCore._getCourtAndDisputeKitJumps" [ color = "green" ];\n  "KlerosCore.currentRuling" -> "IDisputeKit.currentRuling" [ color = "orange" ];\n  "KlerosCore.isDisputeKitJumping" -> "KlerosCore._isCourtJumping" [ color = "green" ];\n  "KlerosCore._getCourtAndDisputeKitJumps" -> "KlerosCore._isCourtJumping" [ color = "green" ];\n  "KlerosCore._transferFeeToken" -> "_recipient.safeSend" [ color = "orange" ];\n  "KlerosCore._transferFeeToken" -> "IERC20.safeTransfer" [ color = "orange" ];\n  "KlerosCore._setStake" -> "KlerosCore._stakingFailed" [ color = "green" ];\n  "KlerosCore._setStake" -> "KlerosCore._stakingFailed" [ color = "green" ];\n  "KlerosCore._setStake" -> "ISortitionModule.validateStake" [ color = "orange" ];\n  "KlerosCore._setStake" -> "KlerosCore._stakingFailed" [ color = "green" ];\n  "KlerosCore._setStake" -> "IERC20.safeTransferFrom" [ color = "orange" ];\n  "KlerosCore._setStake" -> "KlerosCore.address" [ color = "green" ];\n  "KlerosCore._setStake" -> "KlerosCore._stakingFailed" [ color = "green" ];\n  "KlerosCore._setStake" -> "IERC20.safeTransfer" [ color = "orange" ];\n  "KlerosCore._setStake" -> "KlerosCore._stakingFailed" [ color = "green" ];\n  "KlerosCore._setStake" -> "ISortitionModule.setStake" [ color = "orange" ];\n  "KlerosCore._stakingFailed" -> "KlerosCore.StakingTransferFailed" [ color = "red" ];\n  "KlerosCore._stakingFailed" -> "KlerosCore.UnstakingTransferFailed" [ color = "red" ];\n  "KlerosCore._stakingFailed" -> "KlerosCore.StakingInTooManyCourts" [ color = "red" ];\n  "KlerosCore._stakingFailed" -> "KlerosCore.StakingNotPossibleInThisCourt" [ color = "red" ];\n  "KlerosCore._stakingFailed" -> "KlerosCore.StakingLessThanCourtMinStake" [ color = "red" ];\n  "KlerosCore._stakingFailed" -> "KlerosCore.StakingZeroWhenNoStake" [ color = "red" ];\n  "KlerosCore._stakingFailed" -> "KlerosCore.StakingMoreThanMaxStakePerJuror" [ color = "red" ];\n  "KlerosCore._stakingFailed" -> "KlerosCore.StakingMoreThanMaxTotalStaked" [ color = "red" ];\n  "PolicyRegistry.onlyByOwner" -> "PolicyRegistry.OwnerOnly" [ color = "red" ];\n  "PolicyRegistry.<Constructor>" -> "PolicyRegistry._disableInitializers" [ color = "green" ];\n  "SortitionModule.<Constructor>" -> "SortitionModule._disableInitializers" [ color = "green" ];\n  "SortitionModule.onlyByOwner" -> "SortitionModule.OwnerOnly" [ color = "red" ];\n  "SortitionModule.onlyByCore" -> "SortitionModule.address" [ color = "green" ];\n  "SortitionModule.onlyByCore" -> "SortitionModule.KlerosCoreOnly" [ color = "red" ];\n  "SortitionModule.changeRandomNumberGenerator" -> "IRNG.requestRandomness" [ color = "orange" ];\n  "SortitionModule.passPhase" -> "SortitionModule.MinStakingTimeNotPassed" [ color = "red" ];\n  "SortitionModule.passPhase" -> "SortitionModule.NoDisputesThatNeedJurors" [ color = "red" ];\n  "SortitionModule.passPhase" -> "IRNG.requestRandomness" [ color = "orange" ];\n  "SortitionModule.passPhase" -> "IRNG.receiveRandomness" [ color = "orange" ];\n  "SortitionModule.passPhase" -> "SortitionModule.RandomNumberNotReady" [ color = "red" ];\n  "SortitionModule.passPhase" -> "SortitionModule.DisputesWithoutJurorsAndMaxDrawingTimeNotPassed" [ color = "red" ];\n  "ISortitionModule.createTree" -> "CourtID.wrap" [ color = "orange" ];\n  "ISortitionModule.createTree" -> "SortitionModule._extraDataToTreeK" [ color = "green" ];\n  "ISortitionModule.createTree" -> "sortitionSumTrees.createTree" [ color = "orange" ];\n  "SortitionModule.executeDelayedStakes" -> "SortitionModule.NotStakingPhase" [ color = "red" ];\n  "SortitionModule.executeDelayedStakes" -> "SortitionModule.NoDelayedStakeToExecute" [ color = "red" ];\n  "SortitionModule.executeDelayedStakes" -> "KlerosCore.setStakeBySortitionModule" [ color = "orange" ];\n  "ISortitionModule.validateStake" -> "SortitionModule._validateStake" [ color = "green" ];\n  "SortitionModule._validateStake" -> "SortitionModule.stakeOf" [ color = "green" ];\n  "ISortitionModule.setStake" -> "SortitionModule._setStake" [ color = "green" ];\n  "ISortitionModule.setStakePenalty" -> "SortitionModule.stakeOf" [ color = "green" ];\n  "ISortitionModule.setStakePenalty" -> "SortitionModule.stakeOf" [ color = "green" ];\n  "ISortitionModule.setStakePenalty" -> "SortitionModule._setStake" [ color = "green" ];\n  "ISortitionModule.setStakePenalty" -> "SortitionModule.stakeOf" [ color = "green" ];\n  "ISortitionModule.setStakeReward" -> "SortitionModule.stakeOf" [ color = "green" ];\n  "ISortitionModule.setStakeReward" -> "SortitionModule._setStake" [ color = "green" ];\n  "SortitionModule._setStake" -> "SortitionModule.stakeOf" [ color = "green" ];\n  "SortitionModule._setStake" -> "SortitionTrees.toStakePathID" [ color = "orange" ];\n  "SortitionModule._setStake" -> "CourtID.wrap" [ color = "orange" ];\n  "SortitionModule._setStake" -> "KlerosCore.courts" [ color = "orange" ];\n  "ISortitionModule.unlockStake" -> "SortitionModule.getJurorLeftoverPNK" [ color = "green" ];\n  "ISortitionModule.forcedUnstakeAllCourts" -> "SortitionModule.getJurorCourtIDs" [ color = "green" ];\n  "ISortitionModule.forcedUnstakeAllCourts" -> "KlerosCore.setStakeBySortitionModule" [ color = "orange" ];\n  "ISortitionModule.forcedUnstake" -> "KlerosCore.setStakeBySortitionModule" [ color = "orange" ];\n  "SortitionModule.withdrawLeftoverPNK" -> "SortitionModule.getJurorLeftoverPNK" [ color = "green" ];\n  "SortitionModule.withdrawLeftoverPNK" -> "SortitionModule.NotEligibleForWithdrawal" [ color = "red" ];\n  "SortitionModule.withdrawLeftoverPNK" -> "KlerosCore.transferBySortitionModule" [ color = "orange" ];\n  "SortitionModule.draw" -> "SortitionModule.NotDrawingPhase" [ color = "red" ];\n  "SortitionModule.draw" -> "CourtID.wrap" [ color = "orange" ];\n  "SortitionModule.stakeOf" -> "SortitionTrees.toStakePathID" [ color = "orange" ];\n  "SortitionModule.stakeOf" -> "CourtID.wrap" [ color = "orange" ];\n  "SortitionModule.getJurorBalance" -> "SortitionModule.stakeOf" [ color = "green" ];\n  "DisputeResolver.changeOwner" -> "DisputeResolver.OwnerOnly" [ color = "red" ];\n  "DisputeResolver.changeArbitrator" -> "DisputeResolver.OwnerOnly" [ color = "red" ];\n  "DisputeResolver.changeTemplateRegistry" -> "DisputeResolver.OwnerOnly" [ color = "red" ];\n  "DisputeResolver.createDisputeForTemplate" -> "DisputeResolver._createDispute" [ color = "green" ];\n  "DisputeResolver.createDisputeForTemplateUri" -> "DisputeResolver._createDispute" [ color = "green" ];\n  "DisputeResolver.rule" -> "DisputeResolver.address" [ color = "green" ];\n  "DisputeResolver.rule" -> "DisputeResolver.ArbitratorOnly" [ color = "red" ];\n  "DisputeResolver.rule" -> "DisputeResolver.RulingOutOfBounds" [ color = "red" ];\n  "DisputeResolver.rule" -> "DisputeResolver.DisputeAlreadyRuled" [ color = "red" ];\n  "DisputeResolver._createDispute" -> "DisputeResolver.ShouldBeAtLeastTwoRulingOptions" [ color = "red" ];\n  "DisputeResolver._createDispute" -> "IDisputeTemplateRegistry.setDisputeTemplate" [ color = "orange" ];\n  "DisputeTemplateRegistry.onlyByOwner" -> "DisputeTemplateRegistry.OwnerOnly" [ color = "red" ];\n  "DisputeTemplateRegistry.<Constructor>" -> "DisputeTemplateRegistry._disableInitializers" [ color = "green" ];\n  "DisputeKitClassic.<Constructor>" -> "DisputeKitClassic._disableInitializers" [ color = "green" ];\n  "DisputeKitClassic.initialize" -> "DisputeKitClassic.__DisputeKitClassicBase_initialize" [ color = "green" ];\n  "DisputeKitClassicBase.onlyByOwner" -> "DisputeKitClassicBase.OwnerOnly" [ color = "red" ];\n  "DisputeKitClassicBase.onlyByCore" -> "DisputeKitClassicBase.address" [ color = "green" ];\n  "DisputeKitClassicBase.onlyByCore" -> "DisputeKitClassicBase.KlerosCoreOnly" [ color = "red" ];\n  "DisputeKitClassicBase.notJumped" -> "DisputeKitClassicBase.DisputeJumpedToParentDK" [ color = "red" ];\n  "DisputeKitClassicBase.executeOwnerProposal" -> "DisputeKitClassicBase.UnsuccessfulCall" [ color = "red" ];\n  "IDisputeKit.createDispute" -> "KlerosCore.getNumberOfRounds" [ color = "orange" ];\n  "IDisputeKit.draw" -> "KlerosCore.sortitionModule" [ color = "orange" ];\n  "IDisputeKit.draw" -> "KlerosCore.disputes" [ color = "orange" ];\n  "IDisputeKit.draw" -> "ISortitionModule.draw" [ color = "orange" ];\n  "IDisputeKit.draw" -> "DisputeKitClassicBase.address" [ color = "green" ];\n  "IDisputeKit.draw" -> "DisputeKitClassicBase._postDrawCheck" [ color = "green" ];\n  "IDisputeKit.draw" -> "DisputeKitClassicBase.address" [ color = "green" ];\n  "DisputeKitClassicBase.castCommit" -> "DisputeKitClassicBase._castCommit" [ color = "green" ];\n  "DisputeKitClassicBase._castCommit" -> "KlerosCore.disputes" [ color = "orange" ];\n  "DisputeKitClassicBase._castCommit" -> "DisputeKitClassicBase.NotCommitPeriod" [ color = "red" ];\n  "DisputeKitClassicBase._castCommit" -> "DisputeKitClassicBase.EmptyCommit" [ color = "red" ];\n  "DisputeKitClassicBase._castCommit" -> "DisputeKitClassicBase.NotActiveForCoreDisputeID" [ color = "red" ];\n  "DisputeKitClassicBase._castCommit" -> "DisputeKitClassicBase.JurorHasToOwnTheVote" [ color = "red" ];\n  "DisputeKitClassicBase.castVote" -> "DisputeKitClassicBase._castVote" [ color = "green" ];\n  "DisputeKitClassicBase._castVote" -> "KlerosCore.disputes" [ color = "orange" ];\n  "DisputeKitClassicBase._castVote" -> "DisputeKitClassicBase.NotVotePeriod" [ color = "red" ];\n  "DisputeKitClassicBase._castVote" -> "DisputeKitClassicBase.EmptyVoteIDs" [ color = "red" ];\n  "DisputeKitClassicBase._castVote" -> "DisputeKitClassicBase.NotActiveForCoreDisputeID" [ color = "red" ];\n  "DisputeKitClassicBase._castVote" -> "DisputeKitClassicBase.ChoiceOutOfBounds" [ color = "red" ];\n  "DisputeKitClassicBase._castVote" -> "KlerosCore.disputes" [ color = "orange" ];\n  "DisputeKitClassicBase._castVote" -> "KlerosCore.courts" [ color = "orange" ];\n  "DisputeKitClassicBase._castVote" -> "DisputeKitClassicBase.hashVote" [ color = "green" ];\n  "DisputeKitClassicBase._castVote" -> "DisputeKitClassicBase.JurorHasToOwnTheVote" [ color = "red" ];\n  "DisputeKitClassicBase._castVote" -> "DisputeKitClassicBase._getExpectedVoteHash" [ color = "green" ];\n  "DisputeKitClassicBase._castVote" -> "DisputeKitClassicBase.HashDoesNotMatchHiddenVoteCommitment" [ color = "red" ];\n  "DisputeKitClassicBase._castVote" -> "DisputeKitClassicBase.VoteAlreadyCast" [ color = "red" ];\n  "DisputeKitClassicBase.fundAppeal" -> "DisputeKitClassicBase.ChoiceOutOfBounds" [ color = "red" ];\n  "DisputeKitClassicBase.fundAppeal" -> "DisputeKitClassicBase.NotActiveForCoreDisputeID" [ color = "red" ];\n  "DisputeKitClassicBase.fundAppeal" -> "KlerosCore.appealPeriod" [ color = "orange" ];\n  "DisputeKitClassicBase.fundAppeal" -> "DisputeKitClassicBase.AppealPeriodIsOver" [ color = "red" ];\n  "DisputeKitClassicBase.fundAppeal" -> "IDisputeKit.currentRuling" [ color = "green" ];\n  "DisputeKitClassicBase.fundAppeal" -> "DisputeKitClassicBase.AppealPeriodIsOverForLoser" [ color = "red" ];\n  "DisputeKitClassicBase.fundAppeal" -> "KlerosCore.getNumberOfRounds" [ color = "orange" ];\n  "DisputeKitClassicBase.fundAppeal" -> "DisputeKitClassicBase.AppealFeeIsAlreadyPaid" [ color = "red" ];\n  "DisputeKitClassicBase.fundAppeal" -> "KlerosCore.appealCost" [ color = "orange" ];\n  "DisputeKitClassicBase.fundAppeal" -> "KlerosCore.isDisputeKitJumping" [ color = "orange" ];\n  "DisputeKitClassicBase.fundAppeal" -> "KlerosCore.getNumberOfVotes" [ color = "orange" ];\n  "DisputeKitClassicBase.fundAppeal" -> "DisputeKitClassicBase.payable" [ color = "green" ];\n  "DisputeKitClassicBase.withdrawFeesAndRewards" -> "KlerosCore.disputes" [ color = "orange" ];\n  "DisputeKitClassicBase.withdrawFeesAndRewards" -> "DisputeKitClassicBase.DisputeNotResolved" [ color = "red" ];\n  "DisputeKitClassicBase.withdrawFeesAndRewards" -> "KlerosCore.paused" [ color = "orange" ];\n  "DisputeKitClassicBase.withdrawFeesAndRewards" -> "DisputeKitClassicBase.CoreIsPaused" [ color = "red" ];\n  "DisputeKitClassicBase.withdrawFeesAndRewards" -> "DisputeKitClassicBase.NotActiveForCoreDisputeID" [ color = "red" ];\n  "DisputeKitClassicBase.withdrawFeesAndRewards" -> "KlerosCore.currentRuling" [ color = "orange" ];\n  "DisputeKitClassicBase.withdrawFeesAndRewards" -> "_beneficiary.safeSend" [ color = "orange" ];\n  "IDisputeKit.currentRuling" -> "KlerosCore.disputes" [ color = "orange" ];\n  "IDisputeKit.currentRuling" -> "DisputeKitClassicBase.getFundedChoices" [ color = "green" ];\n  "IDisputeKit.getDegreeOfCoherenceReward" -> "DisputeKitClassicBase._getDegreeOfCoherence" [ color = "green" ];\n  "IDisputeKit.getDegreeOfCoherencePenalty" -> "DisputeKitClassicBase._getDegreeOfCoherence" [ color = "green" ];\n  "DisputeKitClassicBase._getDegreeOfCoherence" -> "KlerosCore.currentRuling" [ color = "orange" ];\n  "IDisputeKit.getCoherentCount" -> "KlerosCore.currentRuling" [ color = "orange" ];\n  "DisputeKitClassicBase.areVotesAllCast" -> "KlerosCore.disputes" [ color = "orange" ];\n  "DisputeKitClassicBase.areVotesAllCast" -> "KlerosCore.courts" [ color = "orange" ];\n  "DisputeKitClassicBase.isAppealFunded" -> "KlerosCore.appealPeriod" [ color = "orange" ];\n  "DisputeKitClassicBase.isAppealFunded" -> "DisputeKitClassicBase.getFundedChoices" [ color = "green" ];\n  "DisputeKitGated.<Constructor>" -> "DisputeKitGated._disableInitializers" [ color = "green" ];\n  "DisputeKitGated.initialize" -> "DisputeKitGated.__DisputeKitClassicBase_initialize" [ color = "green" ];\n  "DisputeKitGated.extraDataToTokenInfo" -> "DisputeKitClassicBase.address" [ color = "green" ];\n  "DisputeKitClassicBase._postDrawCheck" -> "DisputeKitClassicBase._postDrawCheck" [ color = "orange" ];\n  "DisputeKitClassicBase._postDrawCheck" -> "DisputeKitGated.extraDataToTokenInfo" [ color = "green" ];\n  "DisputeKitClassicBase._postDrawCheck" -> "DisputeKitClassicBase.address" [ color = "green" ];\n  "DisputeKitGatedShutter.<Constructor>" -> "DisputeKitGatedShutter._disableInitializers" [ color = "green" ];\n  "DisputeKitGatedShutter.initialize" -> "DisputeKitGatedShutter.__DisputeKitClassicBase_initialize" [ color = "green" ];\n  "DisputeKitGatedShutter.castCommitShutter" -> "DisputeKitGatedShutter.EmptyRecoveryCommit" [ color = "red" ];\n  "DisputeKitGatedShutter.castCommitShutter" -> "DisputeKitClassicBase._castCommit" [ color = "green" ];\n  "DisputeKitGatedShutter.castVoteShutter" -> "DisputeKitClassicBase._castVote" [ color = "green" ];\n  "DisputeKitGatedShutter._extraDataToTokenInfo" -> "DisputeKitClassicBase.address" [ color = "green" ];\n  "DisputeKitClassicBase._postDrawCheck" -> "DisputeKitClassicBase._postDrawCheck" [ color = "orange" ];\n  "DisputeKitClassicBase._postDrawCheck" -> "DisputeKitGatedShutter._extraDataToTokenInfo" [ color = "green" ];\n  "DisputeKitClassicBase._postDrawCheck" -> "DisputeKitClassicBase.address" [ color = "green" ];\n  "DisputeKitShutter.<Constructor>" -> "DisputeKitShutter._disableInitializers" [ color = "green" ];\n  "DisputeKitShutter.initialize" -> "DisputeKitShutter.__DisputeKitClassicBase_initialize" [ color = "green" ];\n  "DisputeKitShutter.castCommitShutter" -> "DisputeKitShutter.EmptyRecoveryCommit" [ color = "red" ];\n  "DisputeKitShutter.castCommitShutter" -> "DisputeKitClassicBase._castCommit" [ color = "green" ];\n  "DisputeKitShutter.castVoteShutter" -> "DisputeKitClassicBase._castVote" [ color = "green" ];\n  "DisputeKitSybilResistant.<Constructor>" -> "DisputeKitSybilResistant._disableInitializers" [ color = "green" ];\n  "DisputeKitSybilResistant.initialize" -> "DisputeKitSybilResistant.__DisputeKitClassicBase_initialize" [ color = "green" ];\n  "DisputeKitClassicBase._postDrawCheck" -> "DisputeKitClassicBase._postDrawCheck" [ color = "orange" ];\n  "DisputeKitClassicBase._postDrawCheck" -> "IProofOfHumanity.isRegistered" [ color = "orange" ];\n  "EvidenceModule.onlyByOwner" -> "EvidenceModule.OwnerOnly" [ color = "red" ];\n  "EvidenceModule.<Constructor>" -> "EvidenceModule._disableInitializers" [ color = "green" ];\n  "SafeERC20.increaseAllowance" -> "IERC20.approve" [ color = "orange" ];\n  "SafeERC20.increaseAllowance" -> "IERC20.allowance" [ color = "orange" ];\n  "SafeERC20.increaseAllowance" -> "SafeERC20.address" [ color = "green" ];\n  "SafeERC20.safeTransfer" -> "IERC20.UTION: When used with inheritance, manual care" [ color = "orange" ];\n  "SafeERC20.safeTransfer" -> "SafeERC20.address" [ color = "green" ];\n  "SafeERC20.safeTransfer" -> "abi.encodeCall" [ color = "orange" ];\n  "SafeERC20.safeTransferFrom" -> "IERC20.utomatically lock it when it is deployed:\n *\n * ```\n * //" [ color = "orange" ];\n  "SafeERC20.safeTransferFrom" -> "SafeERC20.address" [ color = "green" ];\n  "SafeERC20.safeTransferFrom" -> "abi.encodeCall" [ color = "orange" ];\n  "SafeSend.safeSend" -> "_to.send" [ color = "orange" ];\n  "RNGWithFallback.<Constructor>" -> "RNGWithFallback.address" [ color = "green" ];\n  "RNGWithFallback.<Constructor>" -> "RNGWithFallback.address" [ color = "green" ];\n  "RNGWithFallback.<Constructor>" -> "RNGWithFallback.InvalidDefaultRNG" [ color = "red" ];\n  "RNGWithFallback.onlyByOwner" -> "RNGWithFallback.OwnerOnly" [ color = "red" ];\n  "RNGWithFallback.onlyByConsumer" -> "RNGWithFallback.ConsumerOnly" [ color = "red" ];\n  "IRNG.requestRandomness" -> "IRNG.requestRandomness" [ color = "orange" ];\n  "IRNG.receiveRandomness" -> "IRNG.receiveRandomness" [ color = "orange" ];\n  "IRNG.receiveRandomness" -> "RNGWithFallback.blockhash" [ color = "green" ];\n  "ChainlinkRNG.onlyByOwner" -> "ChainlinkRNG.OwnerOnly" [ color = "red" ];\n  "ChainlinkRNG.onlyByConsumer" -> "ChainlinkRNG.ConsumerOnly" [ color = "red" ];\n  "ChainlinkRNG.changeVrfCoordinator" -> "ChainlinkRNG.IVRFCoordinatorV2Plus" [ color = "green" ];\n  "ChainlinkRNG.changeVrfCoordinator" -> "ChainlinkRNG.CoordinatorSet" [ color = "green" ];\n  "IRNG.requestRandomness" -> "s_vrfCoordinator.requestRandomWords" [ color = "orange" ];\n  "IRNG.requestRandomness" -> "VRFV2PlusClient.RandomWordsRequest" [ color = "orange" ];\n  "IRNG.requestRandomness" -> "VRFV2PlusClient._argsToBytes" [ color = "orange" ];\n  "IRNG.requestRandomness" -> "VRFV2PlusClient.ExtraArgsV1" [ color = "orange" ];\n  "UUPSProxiable.upgradeToAndCall" -> "UUPSProxiable._authorizeUpgrade" [ color = "green" ];\n  "UUPSProxiable.upgradeToAndCall" -> "UUPSProxiable.address" [ color = "green" ];\n  "UUPSProxiable.upgradeToAndCall" -> "UUPSProxiable._getImplementation" [ color = "green" ];\n  "UUPSProxiable.upgradeToAndCall" -> "UUPSProxiable.UUPSUnauthorizedCallContext" [ color = "red" ];\n  "UUPSProxiable.upgradeToAndCall" -> "UUPSProxiable.UUPSUnsupportedProxiableUUID" [ color = "red" ];\n  "UUPSProxiable.upgradeToAndCall" -> "newImplementation.delegatecall" [ color = "orange" ];\n  "UUPSProxiable.upgradeToAndCall" -> "UUPSProxiable.FailedDelegateCall" [ color = "red" ];\n  "UUPSProxiable.upgradeToAndCall" -> "UUPSProxiable.InvalidImplementation" [ color = "red" ];\n  "UUPSProxiable.proxiableUUID" -> "UUPSProxiable.address" [ color = "green" ];\n  "UUPSProxiable.proxiableUUID" -> "UUPSProxiable.UUPSUnauthorizedCallContext" [ color = "red" ];\n  "UUPSProxy.<Constructor>" -> "_implementation.delegatecall" [ color = "orange" ];\n  "UUPSProxy.<Fallback>" -> "UUPSProxy._delegate" [ color = "green" ];\n  "UUPSProxy.<Fallback>" -> "UUPSProxy._getImplementation" [ color = "green" ];\n  "UUPSProxy.<Receive Ether>" -> "UUPSProxy._delegate" [ color = "green" ];\n  "UUPSProxy.<Receive Ether>" -> "UUPSProxy._getImplementation" [ color = "green" ];\n  "Initializable.initializer" -> "Initializable._getInitializableStorage" [ color = "green" ];\n  "Initializable.initializer" -> "Initializable.address" [ color = "green" ];\n  "Initializable.initializer" -> "Initializable.AlreadyInitialized" [ color = "red" ];\n  "Initializable.reinitializer" -> "Initializable._getInitializableStorage" [ color = "green" ];\n  "Initializable.reinitializer" -> "Initializable.AlreadyInitialized" [ color = "red" ];\n  "Initializable.onlyInitializing" -> "Initializable._checkInitializing" [ color = "green" ];\n  "Initializable._checkInitializing" -> "Initializable._isInitializing" [ color = "green" ];\n  "Initializable._checkInitializing" -> "Initializable.NotInitializing" [ color = "red" ];\n  "Initializable._disableInitializers" -> "Initializable._getInitializableStorage" [ color = "green" ];\n  "Initializable._disableInitializers" -> "Initializable.AlreadyInitialized" [ color = "red" ];\n  "Initializable._disableInitializers" -> "Initializable.type" [ color = "green" ];\n  "Initializable._disableInitializers" -> "Initializable.type" [ color = "green" ];\n  "Initializable._disableInitializers" -> "Initializable.type" [ color = "green" ];\n  "Initializable._getInitializedVersion" -> "Initializable._getInitializableStorage" [ color = "green" ];\n  "Initializable._isInitializing" -> "Initializable._getInitializableStorage" [ color = "green" ];\n\n\nrankdir=LR\nnode [shape=plaintext]\nsubgraph cluster_01 { \nlabel = "Legend";\nkey [label=<<table border="0" cellpadding="2" cellspacing="0" cellborder="0">\n  <tr><td align="right" port="i1">Internal Call</td></tr>\n  <tr><td align="right" port="i2">External Call</td></tr>\n  <tr><td align="right" port="i2">Custom Error Call</td></tr>\n  <tr><td align="right" port="i3">Defined Contract</td></tr>\n  <tr><td align="right" port="i4">Undefined Contract</td></tr>\n  </table>>]\nkey2 [label=<<table border="0" cellpadding="2" cellspacing="0" cellborder="0">\n  <tr><td port="i1">&nbsp;&nbsp;&nbsp;</td></tr>\n  <tr><td port="i2">&nbsp;&nbsp;&nbsp;</td></tr>\n  <tr><td port="i3" bgcolor="lightgray">&nbsp;&nbsp;&nbsp;</td></tr>\n  <tr><td port="i4">\n    <table border="1" cellborder="0" cellspacing="0" cellpadding="7" color="lightgray">\n      <tr>\n       <td></td>\n      </tr>\n     </table>\n  </td></tr>\n  </table>>]\nkey:i1:e -> key2:i1:w [color="green"]\nkey:i2:e -> key2:i2:w [color="orange"]\nkey:i2:e -> key2:i2:w [color="red"]\n}\n}\n',
         },
       };
 
diff --git a/contracts/audit/METRICS.md b/contracts/audit/METRICS.md
index 1a1a40ea3..ae2620a40 100644
--- a/contracts/audit/METRICS.md
+++ b/contracts/audit/METRICS.md
@@ -42,43 +42,39 @@ This section lists files that are in scope for the metrics report.
 
 ### <span id=t-source-Units-in-Scope>Source Units in Scope</span>
 
-Source Units Analyzed: **`31`**<br>
-Source Units in Scope: **`31`** (**100%**)
+Source Units Analyzed: **`27`**<br>
+Source Units in Scope: **`27`** (**100%**)
 
 | Type     | File                                                      | Logic Contracts | Interfaces | Lines    | nLines   | nSLOC    | Comment Lines | Complex. Score | Capabilities                                                                                                                                                                                                                                                                                     |
 | -------- | --------------------------------------------------------- | --------------- | ---------- | -------- | -------- | -------- | ------------- | -------------- | ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ |
-| 📝       | src/arbitration/KlerosCore.sol                            | 1               | \*\*\*\*   | 75       | 63       | 28       | 26            | 13             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
-| 🎨       | src/arbitration/KlerosCoreBase.sol                        | 1               | \*\*\*\*   | 1211     | 1162     | 809      | 286           | 449            | **<abbr title='Uses Assembly'>🖥</abbr><abbr title='Payable Functions'>💰</abbr>**                                                                                                                                                                                                               |
-| 📝       | src/arbitration/KlerosCoreNeo.sol                         | 1               | \*\*\*\*   | 142      | 124      | 55       | 51            | 36             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
-| 📝       | src/arbitration/PolicyRegistry.sol                        | 1               | \*\*\*\*   | 88       | 88       | 30       | 41            | 24             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
-| 📝       | src/arbitration/SortitionModule.sol                       | 1               | \*\*\*\*   | 50       | 44       | 15       | 20            | 13             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
-| 🎨       | src/arbitration/SortitionModuleBase.sol                   | 1               | \*\*\*\*   | 689      | 645      | 393      | 205           | 300            | **<abbr title='Uses Assembly'>🖥</abbr><abbr title='Uses Hash-Functions'>🧮</abbr>**                                                                                                                                                                                                             |
-| 📝       | src/arbitration/SortitionModuleNeo.sol                    | 1               | \*\*\*\*   | 103      | 91       | 48       | 28            | 31             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
-| 📝       | src/arbitration/arbitrables/DisputeResolver.sol           | 1               | \*\*\*\*   | 149      | 134      | 72       | 50            | 43             | **<abbr title='Payable Functions'>💰</abbr>**                                                                                                                                                                                                                                                    |
-| 📝       | src/arbitration/DisputeTemplateRegistry.sol               | 1               | \*\*\*\*   | 83       | 79       | 30       | 33            | 25             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
-| 📝       | src/arbitration/dispute-kits/DisputeKitClassic.sol        | 1               | \*\*\*\*   | 46       | 46       | 16       | 21            | 13             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
-| 🎨       | src/arbitration/dispute-kits/DisputeKitClassicBase.sol    | 1               | \*\*\*\*   | 713      | 632      | 365      | 225           | 192            | **<abbr title='Payable Functions'>💰</abbr><abbr title='Uses Hash-Functions'>🧮</abbr>**                                                                                                                                                                                                         |
-| 📝🔍     | src/arbitration/dispute-kits/DisputeKitGated.sol          | 1               | 2          | 117      | 99       | 39       | 51            | 57             | **<abbr title='Uses Assembly'>🖥</abbr><abbr title='doppelganger(IBalanceHolderERC1155)'>🔆</abbr>**                                                                                                                                                                                             |
-| 📝🔍     | src/arbitration/dispute-kits/DisputeKitGatedShutter.sol   | 1               | 2          | 194      | 159      | 59       | 84            | 69             | **<abbr title='Uses Assembly'>🖥</abbr><abbr title='Uses Hash-Functions'>🧮</abbr><abbr title='doppelganger(IBalanceHolderERC1155)'>🔆</abbr>**                                                                                                                                                  |
-| 📝       | src/arbitration/dispute-kits/DisputeKitShutter.sol        | 1               | \*\*\*\*   | 123      | 107      | 36       | 54            | 27             | **<abbr title='Uses Hash-Functions'>🧮</abbr>**                                                                                                                                                                                                                                                  |
-| 📝🔍     | src/arbitration/dispute-kits/DisputeKitSybilResistant.sol | 1               | 1          | 76       | 58       | 20       | 33            | 16             | **<abbr title='doppelganger(IProofOfHumanity)'>🔆</abbr>**                                                                                                                                                                                                                                       |
-| 📝       | src/arbitration/evidence/EvidenceModule.sol               | 1               | \*\*\*\*   | 70       | 70       | 26       | 30            | 21             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
+| 📝       | src/arbitration/KlerosCore.sol                            | 1               | \*\*\*\*   | 1333     | 1272     | 869      | 322           | 486            | **<abbr title='Uses Assembly'>🖥</abbr><abbr title='Payable Functions'>💰</abbr>**                                                                                                                                                                                                               |
+| 📝       | src/arbitration/PolicyRegistry.sol                        | 1               | \*\*\*\*   | 90       | 90       | 29       | 43            | 22             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
+| 📝       | src/arbitration/SortitionModule.sol                       | 1               | \*\*\*\*   | 622      | 572      | 325      | 208           | 223            | **<abbr title='Uses Assembly'>🖥</abbr>**                                                                                                                                                                                                                                                        |
+| 📝       | src/arbitration/arbitrables/DisputeResolver.sol           | 1               | \*\*\*\*   | 159      | 144      | 77       | 53            | 50             | **<abbr title='Payable Functions'>💰</abbr>**                                                                                                                                                                                                                                                    |
+| 📝       | src/arbitration/DisputeTemplateRegistry.sol               | 1               | \*\*\*\*   | 85       | 81       | 29       | 35            | 23             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
+| 📝       | src/arbitration/dispute-kits/DisputeKitClassic.sol        | 1               | \*\*\*\*   | 48       | 43       | 13       | 22            | 10             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
+| 🎨       | src/arbitration/dispute-kits/DisputeKitClassicBase.sol    | 1               | \*\*\*\*   | 800      | 705      | 407      | 253           | 228            | **<abbr title='Payable Functions'>💰</abbr><abbr title='Uses Hash-Functions'>🧮</abbr>**                                                                                                                                                                                                         |
+| 📝🔍     | src/arbitration/dispute-kits/DisputeKitGated.sol          | 1               | 2          | 119      | 96       | 36       | 52            | 54             | **<abbr title='Uses Assembly'>🖥</abbr><abbr title='doppelganger(IBalanceHolderERC1155)'>🔆</abbr>**                                                                                                                                                                                             |
+| 📝🔍     | src/arbitration/dispute-kits/DisputeKitGatedShutter.sol   | 1               | 2          | 256      | 211      | 81       | 104           | 80             | **<abbr title='Uses Assembly'>🖥</abbr><abbr title='Uses Hash-Functions'>🧮</abbr><abbr title='doppelganger(IBalanceHolderERC1155)'>🔆</abbr>**                                                                                                                                                  |
+| 📝       | src/arbitration/dispute-kits/DisputeKitShutter.sol        | 1               | \*\*\*\*   | 189      | 163      | 58       | 77            | 38             | **<abbr title='Uses Hash-Functions'>🧮</abbr>**                                                                                                                                                                                                                                                  |
+| 📝🔍     | src/arbitration/dispute-kits/DisputeKitSybilResistant.sol | 1               | 1          | 78       | 59       | 20       | 34            | 16             | **<abbr title='doppelganger(IProofOfHumanity)'>🔆</abbr>**                                                                                                                                                                                                                                       |
+| 📝       | src/arbitration/evidence/EvidenceModule.sol               | 1               | \*\*\*\*   | 72       | 72       | 25       | 32            | 19             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
 | 🔍       | src/arbitration/interfaces/IArbitrableV2.sol              | \*\*\*\*        | 1          | 40       | 39       | 12       | 22            | 3              | \*\*\*\*                                                                                                                                                                                                                                                                                         |
 | 🔍       | src/arbitration/interfaces/IArbitratorV2.sol              | \*\*\*\*        | 1          | 83       | 44       | 9        | 50            | 14             | **<abbr title='Payable Functions'>💰</abbr>**                                                                                                                                                                                                                                                    |
-| 🔍       | src/arbitration/interfaces/IDisputeKit.sol                | \*\*\*\*        | 1          | 128      | 39       | 11       | 60            | 23             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
+| 🔍       | src/arbitration/interfaces/IDisputeKit.sol                | \*\*\*\*        | 1          | 165      | 39       | 11       | 78            | 31             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
 | 🔍       | src/arbitration/interfaces/IDisputeTemplateRegistry.sol   | \*\*\*\*        | 1          | 25       | 20       | 9        | 8             | 3              | \*\*\*\*                                                                                                                                                                                                                                                                                         |
 | 🔍       | src/arbitration/interfaces/IEvidence.sol                  | \*\*\*\*        | 1          | 12       | 12       | 4        | 6             | 1              | \*\*\*\*                                                                                                                                                                                                                                                                                         |
-| 🔍       | src/arbitration/interfaces/ISortitionModule.sol           | \*\*\*\*        | 1          | 63       | 16       | 10       | 4             | 33             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
-|          | src/libraries/Constants.sol                               | \*\*\*\*        | \*\*\*\*   | 39       | 39       | 26       | 13            | 2              | \*\*\*\*                                                                                                                                                                                                                                                                                         |
+| 🔍       | src/arbitration/interfaces/ISortitionModule.sol           | \*\*\*\*        | 1          | 73       | 16       | 10       | 4             | 37             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
+|          | src/libraries/Constants.sol                               | \*\*\*\*        | \*\*\*\*   | 42       | 42       | 27       | 14            | 2              | \*\*\*\*                                                                                                                                                                                                                                                                                         |
 | 📚       | src/libraries/SafeERC20.sol                               | 1               | \*\*\*\*   | 47       | 47       | 18       | 24            | 12             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
 | 📚🔍     | src/libraries/SafeSend.sol                                | 1               | 1          | 24       | 19       | 9        | 7             | 15             | **<abbr title='Payable Functions'>💰</abbr><abbr title='Initiates ETH Value Transfer'>📤</abbr>**                                                                                                                                                                                                |
-| 📝       | src/rng/RNGWithFallback.sol                               | 1               | \*\*\*\*   | 103      | 103      | 48       | 41            | 35             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
-| 📝       | src/rng/ChainlinkRNG.sol                                  | 1               | \*\*\*\*   | 173      | 173      | 85       | 70            | 50             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
-| 🔍       | src/rng/IRNG.sol                                          | \*\*\*\*        | 1          | 13       | 8        | 3        | 5             | 5              | \*\*\*\*                                                                                                                                                                                                                                                                                         |
+| 📝       | src/rng/RNGWithFallback.sol                               | 1               | \*\*\*\*   | 109      | 109      | 49       | 44            | 38             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
+| 📝       | src/rng/ChainlinkRNG.sol                                  | 1               | \*\*\*\*   | 171      | 171      | 83       | 69            | 51             | \*\*\*\*                                                                                                                                                                                                                                                                                         |
+| 🔍       | src/rng/IRNG.sol                                          | \*\*\*\*        | 1          | 16       | 8        | 3        | 5             | 5              | \*\*\*\*                                                                                                                                                                                                                                                                                         |
 | 🎨       | src/proxy/UUPSProxiable.sol                               | 1               | \*\*\*\*   | 140      | 122      | 44       | 71            | 46             | **<abbr title='Uses Assembly'>🖥</abbr><abbr title='Payable Functions'>💰</abbr><abbr title='DelegateCall'>👥</abbr><abbr title='TryCatch Blocks'>♻️</abbr>**                                                                                                                                    |
 | 📝       | src/proxy/UUPSProxy.sol                                   | 1               | \*\*\*\*   | 90       | 90       | 38       | 37            | 65             | **<abbr title='Uses Assembly'>🖥</abbr><abbr title='Payable Functions'>💰</abbr><abbr title='DelegateCall'>👥</abbr>**                                                                                                                                                                           |
 | 🎨       | src/proxy/Initializable.sol                               | 1               | \*\*\*\*   | 215      | 215      | 70       | 128           | 31             | **<abbr title='Uses Assembly'>🖥</abbr>**                                                                                                                                                                                                                                                        |
-| 📝📚🔍🎨 | **Totals**                                                | **23**          | **13**     | **5124** | **4587** | **2437** | **1784**      | **1667**       | **<abbr title='Uses Assembly'>🖥</abbr><abbr title='Payable Functions'>💰</abbr><abbr title='Initiates ETH Value Transfer'>📤</abbr><abbr title='DelegateCall'>👥</abbr><abbr title='Uses Hash-Functions'>🧮</abbr><abbr title='doppelganger'>🔆</abbr><abbr title='TryCatch Blocks'>♻️</abbr>** |
+| 📝📚🔍🎨 | **Totals**                                                | **19**          | **13**     | **5103** | **4501** | **2365** | **1802**      | **1603**       | **<abbr title='Uses Assembly'>🖥</abbr><abbr title='Payable Functions'>💰</abbr><abbr title='Initiates ETH Value Transfer'>📤</abbr><abbr title='DelegateCall'>👥</abbr><abbr title='Uses Hash-Functions'>🧮</abbr><abbr title='doppelganger'>🔆</abbr><abbr title='TryCatch Blocks'>♻️</abbr>** |
 
 <sub>
 Legend: <a onclick="toggleVisibility('table-legend', this)">[➕]</a>
@@ -97,18 +93,16 @@ Legend: <a onclick="toggleVisibility('table-legend', this)">[➕]</a>
 
 ##### <span id=t-deployable-contracts>Deployable Logic Contracts</span>
 
-Total: 16
+Total: 14
 
 - 📝 `KlerosCore`
-- 📝 `KlerosCoreNeo`
 - 📝 `PolicyRegistry`
 - 📝 `SortitionModule`
-- 📝 `SortitionModuleNeo`
+- 📝 `DisputeResolver`
+- 📝 `DisputeTemplateRegistry`
 - <a onclick="toggleVisibility('deployables', this)">[➕]</a>
 <div id="deployables" style="display:none">
 <ul>
-<li> 📝 <code>DisputeResolver</code></li>
-<li> 📝 <code>DisputeTemplateRegistry</code></li>
 <li> 📝 <code>DisputeKitClassic</code></li>
 <li> 📝 <code>DisputeKitGated</code></li>
 <li> 📝 <code>DisputeKitGatedShutter</code></li>
@@ -184,14 +178,14 @@ The analysis finished with **`0`** errors and **`0`** duplicate files.
 
 #### <span id=t-inline-documentation>Inline Documentation</span>
 
-- **Comment-to-Source Ratio:** On average there are`1.59` code lines per comment (lower=better).
-- **ToDo's:** `2`
+- **Comment-to-Source Ratio:** On average there are`1.56` code lines per comment (lower=better).
+- **ToDo's:** `3`
 
 #### <span id=t-components>Components</span>
 
 | 📝Contracts | 📚Libraries | 🔍Interfaces | 🎨Abstract |
 | ----------- | ----------- | ------------ | ---------- |
-| 16          | 2           | 13           | 5          |
+| 14          | 2           | 13           | 3          |
 
 #### <span id=t-exposed-functions>Exposed Functions</span>
 
@@ -199,23 +193,23 @@ This section lists functions that are explicitly declared public or payable. Ple
 
 | 🌐Public | 💰Payable |
 | -------- | --------- |
-| 192      | 10        |
+| 191      | 10        |
 
 | External | Internal | Private | Pure | View |
 | -------- | -------- | ------- | ---- | ---- |
-| 175      | 217      | 2       | 13   | 80   |
+| 175      | 197      | 1       | 9    | 92   |
 
 #### <span id=t-statevariables>StateVariables</span>
 
 | Total | 🌐Public |
 | ----- | -------- |
-| 87    | 80       |
+| 88    | 82       |
 
 #### <span id=t-capabilities>Capabilities</span>
 
-| Solidity Versions observed     | 🧪 Experimental Features | 💰 Can Receive Funds | 🖥 Uses Assembly           | 💣 Has Destroyable Contracts |
-| ------------------------------ | ------------------------ | -------------------- | -------------------------- | ---------------------------- |
-| `^0.8.24`<br/>`>=0.8.0 <0.9.0` |                          | `yes`                | `yes` <br/>(12 asm blocks) | \*\*\*\*                     |
+| Solidity Versions observed                   | 🧪 Experimental Features | 💰 Can Receive Funds | 🖥 Uses Assembly           | 💣 Has Destroyable Contracts |
+| -------------------------------------------- | ------------------------ | -------------------- | -------------------------- | ---------------------------- |
+| `^0.8.24`<br/>`^0.8.28`<br/>`>=0.8.0 <0.9.0` |                          | `yes`                | `yes` <br/>(10 asm blocks) | \*\*\*\*                     |
 
 | 📤 Transfers ETH | ⚡ Low-Level Calls | 👥 DelegateCall | 🧮 Uses Hash Functions | 🔖 ECRecover | 🌀 New/Create/Create2 |
 | ---------------- | ------------------ | --------------- | ---------------------- | ------------ | --------------------- |
@@ -229,7 +223,6 @@ This section lists functions that are explicitly declared public or payable. Ple
 
 | Dependency / Import Path                                            | Count |
 | ------------------------------------------------------------------- | ----- |
-| @chainlink/contracts/src/v0.8/vrf/dev/VRFConsumerBaseV2Plus.sol     | 1     |
 | @chainlink/contracts/src/v0.8/vrf/dev/libraries/VRFV2PlusClient.sol | 1     |
 | @openzeppelin/contracts/token/ERC20/IERC20.sol                      | 3     |
 | @openzeppelin/contracts/token/ERC721/IERC721.sol                    | 1     |
@@ -292,380 +285,360 @@ Files Description Table
 
 | File Name                                                 | SHA-1 Hash                               |
 | --------------------------------------------------------- | ---------------------------------------- |
-| src/arbitration/KlerosCore.sol                            | 5362842ab3a88870e8b3b42cd7cf7a2058240483 |
-| src/arbitration/KlerosCoreBase.sol                        | fe829c80ad434e185151a8b5d299a585f576c619 |
-| src/arbitration/KlerosCoreNeo.sol                         | 0260ef7a9309d5c73c4c9b1a3f5c7653904f79c7 |
-| src/arbitration/PolicyRegistry.sol                        | c36299120ac7318dd29e4ab86f50b0447d87af96 |
-| src/arbitration/SortitionModule.sol                       | c1c1b2dd061590cd6c7eee41767e5c3fb898d506 |
-| src/arbitration/SortitionModuleBase.sol                   | 7b1037fcdfffc58bf3522f70ed128cad4915e032 |
-| src/arbitration/SortitionModuleNeo.sol                    | 8570ebeff10d723ce33b75e077dffb6fcf6e2f08 |
-| src/arbitration/arbitrables/DisputeResolver.sol           | 7dad21f0219e0a1b698859205bbf31b07abfdc7c |
-| src/arbitration/DisputeTemplateRegistry.sol               | c31e000957b979dc513d8b123253adb9edce50c7 |
-| src/arbitration/dispute-kits/DisputeKitClassic.sol        | 32bcb287571a3c4a861659be31a1ee2dc6ea6784 |
-| src/arbitration/dispute-kits/DisputeKitClassicBase.sol    | 7c0b04f3e73c0a10a29abfa78f78220e4e43f983 |
-| src/arbitration/dispute-kits/DisputeKitGated.sol          | e5f7f2ecd65f5e279c7b55e9edbe6f4cfc5fd632 |
-| src/arbitration/dispute-kits/DisputeKitGatedShutter.sol   | abb7f1ac20fa60db95d97fea6e9396b108d40924 |
-| src/arbitration/dispute-kits/DisputeKitShutter.sol        | 3720b60db303b866eacbb3dee529a638eaf6782e |
-| src/arbitration/dispute-kits/DisputeKitSybilResistant.sol | 69158bf07e78b3cb9892a5fd6cfc768181989a7f |
-| src/arbitration/evidence/EvidenceModule.sol               | 45845f3d5ad5548a30698105061bc0e64fd7718f |
+| src/arbitration/KlerosCore.sol                            | 383e209070883ddd480ef42f775d9c46dd3a9312 |
+| src/arbitration/PolicyRegistry.sol                        | 513ee51fc5262e41bf1ee58c19011b2166bb8281 |
+| src/arbitration/SortitionModule.sol                       | 455986084175670bcd15911f4f04cbf64203da41 |
+| src/arbitration/arbitrables/DisputeResolver.sol           | 985b9082c8187d8c4d35e1c88c54f954532cd94f |
+| src/arbitration/DisputeTemplateRegistry.sol               | 3cc2892233d940bf4523414680e361869f6df054 |
+| src/arbitration/dispute-kits/DisputeKitClassic.sol        | b7a6a3c1e021f11c8f6f8ae7c184e947a7cd45d9 |
+| src/arbitration/dispute-kits/DisputeKitClassicBase.sol    | c0d30028020e75203758df5241cdaf1138464b75 |
+| src/arbitration/dispute-kits/DisputeKitGated.sol          | c98ed7a48f251debdd88a325245dcb8e04926311 |
+| src/arbitration/dispute-kits/DisputeKitGatedShutter.sol   | bfe8f9e2598454027643644e246140623d5c73a8 |
+| src/arbitration/dispute-kits/DisputeKitShutter.sol        | b77e1e9ddfcf19c31570f0bfbf01c18086c99f56 |
+| src/arbitration/dispute-kits/DisputeKitSybilResistant.sol | 8bba9bb201d66fc07abc436b7830701a92e0ffb6 |
+| src/arbitration/evidence/EvidenceModule.sol               | 0098cc5e9939d1193f152890dfc94729a0d8bbd4 |
 | src/arbitration/interfaces/IArbitrableV2.sol              | ce54b7140a6109b2d919cea38ff94ac2ad775398 |
 | src/arbitration/interfaces/IArbitratorV2.sol              | 4e0baa0ff6155737540105f9fdb5b54ba2905d2c |
-| src/arbitration/interfaces/IDisputeKit.sol                | f21b52ed28a905b3073adaf68961938200cfd644 |
+| src/arbitration/interfaces/IDisputeKit.sol                | 06e3c893fca325de50367a1a862036771295885b |
 | src/arbitration/interfaces/IDisputeTemplateRegistry.sol   | 8d0351ebeee1ebd8603af9cf50c2ab62f6e8fecb |
 | src/arbitration/interfaces/IEvidence.sol                  | 12ee130f67f5d38afbcc810129b030cf7f58f058 |
-| src/arbitration/interfaces/ISortitionModule.sol           | 2c6d74752298263f7c649e3feecfb9a03c87a16a |
-| src/libraries/Constants.sol                               | 4d1d44dbeeda03f47a646e9552873d26acf4254d |
+| src/arbitration/interfaces/ISortitionModule.sol           | ea2526039c8675ddbc387198b29600a49c3584c1 |
+| src/libraries/Constants.sol                               | 6ce9e86c301042de2d32f9a3a5cfc2d65c34fa47 |
 | src/libraries/SafeERC20.sol                               | 68e49603280eab2b68eabc554dc310ff3313a64c |
 | src/libraries/SafeSend.sol                                | 9d282cf6456950471debec28103fcb99638fa83d |
-| src/rng/RNGWithFallback.sol                               | 9729dbce3e1dd5981073df38ac31fe356aae0027 |
-| src/rng/ChainlinkRNG.sol                                  | ce0d145807bc7b5b59b0e29ba468d9b0c0dc0314 |
-| src/rng/IRNG.sol                                          | d701581ef4910cdde9dbc3006dd0229cc3ea6012 |
+| src/rng/RNGWithFallback.sol                               | 0d90b33bb4fdeb9492d5b2474135790cd0c986e5 |
+| src/rng/ChainlinkRNG.sol                                  | 54f081a26e78c5aa0d58207372944a603eae5cf7 |
+| src/rng/IRNG.sol                                          | 25eee63b46a76183c24b39d81ae85044474a6a02 |
 | src/proxy/UUPSProxiable.sol                               | 80d46ace20ea4c9c6a0cbc1093d6e88eb19aeb12 |
 | src/proxy/UUPSProxy.sol                                   | 18a2a570a8ef2ec5f02d59bd1c03a176203e8ccf |
-| src/proxy/Initializable.sol                               | 7079462341810d12b0c0ea93845d053bdcbdabff |
+| src/proxy/Initializable.sol                               | bf3ba9453bab903eda4247e90e39376e20744353 |
 
 Contracts Description Table
 
-|           Contract           |                  Type                   |                         Bases                          |                |                                        |
-| :--------------------------: | :-------------------------------------: | :----------------------------------------------------: | :------------: | :------------------------------------: |
-|              └               |            **Function Name**            |                     **Visibility**                     | **Mutability** |             **Modifiers**              |
-|                              |                                         |                                                        |                |                                        |
-|        **KlerosCore**        |             Implementation              |                     KlerosCoreBase                     |                |                                        |
-|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
-|              └               |               initialize                |                      External ❗️                       |       🛑       |             reinitializer              |
-|              └               |              reinitialize               |                      External ❗️                       |       🛑       |             reinitializer              |
-|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByGovernor             |
-|                              |                                         |                                                        |                |                                        |
-|      **KlerosCoreBase**      |             Implementation              |      IArbitratorV2, Initializable, UUPSProxiable       |                |                                        |
-|              └               |      \_\_KlerosCoreBase_initialize      |                      Internal 🔒                       |       🛑       |            onlyInitializing            |
-|              └               |                  pause                  |                      External ❗️                       |       🛑       | onlyByGuardianOrGovernor whenNotPaused |
-|              └               |                 unpause                 |                      External ❗️                       |       🛑       |       onlyByGovernor whenPaused        |
-|              └               |         executeGovernorProposal         |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |             changeGovernor              |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |             changeGuardian              |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |             changePinakion              |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |      changeJurorProsecutionModule       |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |          changeSortitionModule          |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |            addNewDisputeKit             |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |               createCourt               |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |          changeCourtParameters          |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |            enableDisputeKits            |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |         changeAcceptedFeeTokens         |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |           changeCurrencyRates           |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |                setStake                 |                      External ❗️                       |       🛑       |             whenNotPaused              |
-|              └               |        setStakeBySortitionModule        |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |        transferBySortitionModule        |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |              createDispute              |                      External ❗️                       |       💵       |                  NO❗️                  |
-|              └               |              createDispute              |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |             \_createDispute             |                      Internal 🔒                       |       🛑       |                                        |
-|              └               |               passPeriod                |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |                  draw                   |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |                 appeal                  |                      External ❗️                       |       💵       |                  NO❗️                  |
-|              └               |                 execute                 |                      External ❗️                       |       🛑       |             whenNotPaused              |
-|              └               |           \_executePenalties            |                      Internal 🔒                       |       🛑       |                                        |
-|              └               |            \_executeRewards             |                      Internal 🔒                       |       🛑       |                                        |
-|              └               |              executeRuling              |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |             arbitrationCost             |                       Public ❗️                        |                |                  NO❗️                  |
-|              └               |             arbitrationCost             |                       Public ❗️                        |                |                  NO❗️                  |
-|              └               |               appealCost                |                       Public ❗️                        |                |                  NO❗️                  |
-|              └               |              appealPeriod               |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |              currentRuling              |                       Public ❗️                        |                |                  NO❗️                  |
-|              └               |              getRoundInfo               |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |          getPnkAtStakePerJuror          |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |            getNumberOfRounds            |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |               isSupported               |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |            getTimesPerPeriod            |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |            getNumberOfVotes             |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |           isDisputeKitJumping           |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |          getDisputeKitsLength           |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |         convertEthToTokenAmount         |                       Public ❗️                        |                |                  NO❗️                  |
-|              └               |           \_transferFeeToken            |                      Internal 🔒                       |       🛑       |                                        |
-|              └               |            \_applyCoherence             |                      Internal 🔒                       |                |                                        |
-|              └               |          \_calculatePnkAtStake          |                      Internal 🔒                       |                |                                        |
-|              └               |           \_enableDisputeKit            |                      Internal 🔒                       |       🛑       |                                        |
-|              └               |               \_setStake                |                      Internal 🔒                       |       🛑       |                                        |
-|              └               |             \_stakingFailed             |                      Internal 🔒                       |                |                                        |
-|              └               | \_extraDataToCourtIDMinJurorsDisputeKit |                      Internal 🔒                       |                |                                        |
-|                              |                                         |                                                        |                |                                        |
-|      **KlerosCoreNeo**       |             Implementation              |                     KlerosCoreBase                     |                |                                        |
-|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
-|              └               |               initialize                |                      External ❗️                       |       🛑       |             reinitializer              |
-|              └               |              reinitialize               |                      External ❗️                       |       🛑       |             reinitializer              |
-|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByGovernor             |
-|              └               |             changeJurorNft              |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |        changeArbitrableWhitelist        |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |                setStake                 |                      External ❗️                       |       🛑       |             whenNotPaused              |
-|              └               |             \_createDispute             |                      Internal 🔒                       |       🛑       |                                        |
-|              └               |             \_stakingFailed             |                      Internal 🔒                       |                |                                        |
-|                              |                                         |                                                        |                |                                        |
-|      **PolicyRegistry**      |             Implementation              |              UUPSProxiable, Initializable              |                |                                        |
-|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
-|              └               |               initialize                |                      External ❗️                       |       🛑       |             reinitializer              |
-|              └               |               initialize2               |                      External ❗️                       |       🛑       |             reinitializer              |
-|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByGovernor             |
-|              └               |             changeGovernor              |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |                setPolicy                |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|                              |                                         |                                                        |                |                                        |
-|     **SortitionModule**      |             Implementation              |                  SortitionModuleBase                   |                |                                        |
-|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
-|              └               |               initialize                |                      External ❗️                       |       🛑       |             reinitializer              |
-|              └               |               initialize4               |                      External ❗️                       |       🛑       |             reinitializer              |
-|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByGovernor             |
-|                              |                                         |                                                        |                |                                        |
-|   **SortitionModuleBase**    |             Implementation              |     ISortitionModule, Initializable, UUPSProxiable     |                |                                        |
-|              └               |   \_\_SortitionModuleBase_initialize    |                      Internal 🔒                       |       🛑       |            onlyInitializing            |
-|              └               |             changeGovernor              |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |          changeMinStakingTime           |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |          changeMaxDrawingTime           |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |       changeRandomNumberGenerator       |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |                passPhase                |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |               createTree                |                      External ❗️                       |       🛑       |               onlyByCore               |
-|              └               |          executeDelayedStakes           |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |            createDisputeHook            |                      External ❗️                       |       🛑       |               onlyByCore               |
-|              └               |              postDrawHook               |                      External ❗️                       |       🛑       |               onlyByCore               |
-|              └               |           notifyRandomNumber            |                       Public ❗️                        |       🛑       |                  NO❗️                  |
-|              └               |              validateStake              |                      External ❗️                       |       🛑       |               onlyByCore               |
-|              └               |             \_validateStake             |                      Internal 🔒                       |       🛑       |                                        |
-|              └               |                setStake                 |                      External ❗️                       |       🛑       |               onlyByCore               |
-|              └               |               \_setStake                |                      Internal 🔒                       |       🛑       |                                        |
-|              └               |                lockStake                |                      External ❗️                       |       🛑       |               onlyByCore               |
-|              └               |               unlockStake               |                      External ❗️                       |       🛑       |               onlyByCore               |
-|              └               |              penalizeStake              |                      External ❗️                       |       🛑       |               onlyByCore               |
-|              └               |            setJurorInactive             |                      External ❗️                       |       🛑       |               onlyByCore               |
-|              └               |           withdrawLeftoverPNK           |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |                  draw                   |                       Public ❗️                        |                |                  NO❗️                  |
-|              └               |                 stakeOf                 |                       Public ❗️                        |                |                  NO❗️                  |
-|              └               |                 stakeOf                 |                       Public ❗️                        |                |                  NO❗️                  |
-|              └               |             getJurorBalance             |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |            getJurorCourtIDs             |                       Public ❗️                        |                |                  NO❗️                  |
-|              └               |              isJurorStaked              |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |           getJurorLeftoverPNK           |                       Public ❗️                        |                |                  NO❗️                  |
-|              └               |             \_updateParents             |                       Private 🔐                       |       🛑       |                                        |
-|              └               |         \_stakePathIDToAccount          |                      Internal 🔒                       |                |                                        |
-|              └               |           \_extraDataToTreeK            |                      Internal 🔒                       |                |                                        |
-|              └               |                  \_set                  |                      Internal 🔒                       |       🛑       |                                        |
-|              └               |    \_accountAndCourtIDToStakePathID     |                      Internal 🔒                       |                |                                        |
-|                              |                                         |                                                        |                |                                        |
-|    **SortitionModuleNeo**    |             Implementation              |                  SortitionModuleBase                   |                |                                        |
-|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
-|              └               |               initialize                |                      External ❗️                       |       🛑       |             reinitializer              |
-|              └               |               initialize4               |                      External ❗️                       |       🛑       |             reinitializer              |
-|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByGovernor             |
-|              └               |         changeMaxStakePerJuror          |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |          changeMaxTotalStaked           |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |             \_validateStake             |                      Internal 🔒                       |       🛑       |               onlyByCore               |
-|                              |                                         |                                                        |                |                                        |
-|     **DisputeResolver**      |             Implementation              |                     IArbitrableV2                      |                |                                        |
-|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
-|              └               |             changeGovernor              |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |            changeArbitrator             |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |         changeTemplateRegistry          |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |        createDisputeForTemplate         |                      External ❗️                       |       💵       |                  NO❗️                  |
-|              └               |       createDisputeForTemplateUri       |                      External ❗️                       |       💵       |                  NO❗️                  |
-|              └               |                  rule                   |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |             \_createDispute             |                      Internal 🔒                       |       🛑       |                                        |
-|                              |                                         |                                                        |                |                                        |
-| **DisputeTemplateRegistry**  |             Implementation              | IDisputeTemplateRegistry, UUPSProxiable, Initializable |                |                                        |
-|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
-|              └               |               initialize                |                      External ❗️                       |       🛑       |             reinitializer              |
-|              └               |               initialize2               |                      External ❗️                       |       🛑       |             reinitializer              |
-|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByGovernor             |
-|              └               |             changeGovernor              |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |           setDisputeTemplate            |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|                              |                                         |                                                        |                |                                        |
-|    **DisputeKitClassic**     |             Implementation              |                 DisputeKitClassicBase                  |                |                                        |
-|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
-|              └               |               initialize                |                      External ❗️                       |       🛑       |             reinitializer              |
-|              └               |              reinitialize               |                      External ❗️                       |       🛑       |             reinitializer              |
-|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByGovernor             |
-|                              |                                         |                                                        |                |                                        |
-|  **DisputeKitClassicBase**   |             Implementation              |       IDisputeKit, Initializable, UUPSProxiable        |                |                                        |
-|              └               |  \_\_DisputeKitClassicBase_initialize   |                      Internal 🔒                       |       🛑       |            onlyInitializing            |
-|              └               |         executeGovernorProposal         |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |             changeGovernor              |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |               changeCore                |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |              createDispute              |                      External ❗️                       |       🛑       |               onlyByCore               |
-|              └               |                  draw                   |                      External ❗️                       |       🛑       |          onlyByCore notJumped          |
-|              └               |               castCommit                |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |              \_castCommit               |                      Internal 🔒                       |       🛑       |               notJumped                |
-|              └               |                castVote                 |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |               \_castVote                |                      Internal 🔒                       |       🛑       |               notJumped                |
-|              └               |               fundAppeal                |                      External ❗️                       |       💵       |               notJumped                |
-|              └               |         withdrawFeesAndRewards          |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |                hashVote                 |                       Public ❗️                        |                |                  NO❗️                  |
-|              └               |            getFundedChoices             |                       Public ❗️                        |                |                  NO❗️                  |
-|              └               |              currentRuling              |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |          getDegreeOfCoherence           |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |            getCoherentCount             |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |            areCommitsAllCast            |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |             areVotesAllCast             |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |             isAppealFunded              |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |              isVoteActive               |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |              getRoundInfo               |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |            getNumberOfRounds            |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |         getLocalDisputeRoundID          |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |               getVoteInfo               |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |             \_postDrawCheck             |                      Internal 🔒                       |                |                                        |
-|                              |                                         |                                                        |                |                                        |
-|      **IBalanceHolder**      |                Interface                |                                                        |                |                                        |
-|              └               |                balanceOf                |                      External ❗️                       |                |                  NO❗️                  |
-|                              |                                         |                                                        |                |                                        |
-|  **IBalanceHolderERC1155**   |                Interface                |                                                        |                |                                        |
-|              └               |                balanceOf                |                      External ❗️                       |                |                  NO❗️                  |
-|                              |                                         |                                                        |                |                                        |
-|     **DisputeKitGated**      |             Implementation              |                 DisputeKitClassicBase                  |                |                                        |
-|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
-|              └               |               initialize                |                      External ❗️                       |       🛑       |             reinitializer              |
-|              └               |              reinitialize               |                      External ❗️                       |       🛑       |             reinitializer              |
-|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByGovernor             |
-|              └               |          extraDataToTokenInfo           |                       Public ❗️                        |                |                  NO❗️                  |
-|              └               |             \_postDrawCheck             |                      Internal 🔒                       |                |                                        |
-|                              |                                         |                                                        |                |                                        |
-|      **IBalanceHolder**      |                Interface                |                                                        |                |                                        |
-|              └               |                balanceOf                |                      External ❗️                       |                |                  NO❗️                  |
-|                              |                                         |                                                        |                |                                        |
-|  **IBalanceHolderERC1155**   |                Interface                |                                                        |                |                                        |
-|              └               |                balanceOf                |                      External ❗️                       |                |                  NO❗️                  |
-|                              |                                         |                                                        |                |                                        |
-|  **DisputeKitGatedShutter**  |             Implementation              |                 DisputeKitClassicBase                  |                |                                        |
-|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
-|              └               |               initialize                |                      External ❗️                       |       🛑       |             reinitializer              |
-|              └               |              reinitialize               |                      External ❗️                       |       🛑       |             reinitializer              |
-|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByGovernor             |
-|              └               |            castCommitShutter            |                      External ❗️                       |       🛑       |               notJumped                |
-|              └               |             castVoteShutter             |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |                hashVote                 |                       Public ❗️                        |                |                  NO❗️                  |
-|              └               |         \_extraDataToTokenInfo          |                      Internal 🔒                       |                |                                        |
-|              └               |             \_postDrawCheck             |                      Internal 🔒                       |                |                                        |
-|                              |                                         |                                                        |                |                                        |
-|    **DisputeKitShutter**     |             Implementation              |                 DisputeKitClassicBase                  |                |                                        |
-|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
-|              └               |               initialize                |                      External ❗️                       |       🛑       |             reinitializer              |
-|              └               |              reinitialize               |                      External ❗️                       |       🛑       |             reinitializer              |
-|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByGovernor             |
-|              └               |            castCommitShutter            |                      External ❗️                       |       🛑       |               notJumped                |
-|              └               |             castVoteShutter             |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |                hashVote                 |                       Public ❗️                        |                |                  NO❗️                  |
-|                              |                                         |                                                        |                |                                        |
-|     **IProofOfHumanity**     |                Interface                |                                                        |                |                                        |
-|              └               |              isRegistered               |                      External ❗️                       |                |                  NO❗️                  |
-|                              |                                         |                                                        |                |                                        |
-| **DisputeKitSybilResistant** |             Implementation              |                 DisputeKitClassicBase                  |                |                                        |
-|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
-|              └               |               initialize                |                      External ❗️                       |       🛑       |             reinitializer              |
-|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByGovernor             |
-|              └               |             \_postDrawCheck             |                      Internal 🔒                       |                |                                        |
-|                              |                                         |                                                        |                |                                        |
-|      **EvidenceModule**      |             Implementation              |        IEvidence, Initializable, UUPSProxiable         |                |                                        |
-|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
-|              └               |               initialize                |                      External ❗️                       |       🛑       |             reinitializer              |
-|              └               |               initialize2               |                      External ❗️                       |       🛑       |             reinitializer              |
-|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByGovernor             |
-|              └               |             submitEvidence              |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|                              |                                         |                                                        |                |                                        |
-|      **IArbitrableV2**       |                Interface                |                                                        |                |                                        |
-|              └               |                  rule                   |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|                              |                                         |                                                        |                |                                        |
-|      **IArbitratorV2**       |                Interface                |                                                        |                |                                        |
-|              └               |              createDispute              |                      External ❗️                       |       💵       |                  NO❗️                  |
-|              └               |              createDispute              |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |             arbitrationCost             |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |             arbitrationCost             |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |              currentRuling              |                      External ❗️                       |                |                  NO❗️                  |
-|                              |                                         |                                                        |                |                                        |
-|       **IDisputeKit**        |                Interface                |                                                        |                |                                        |
-|              └               |              createDispute              |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |                  draw                   |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |              currentRuling              |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |          getDegreeOfCoherence           |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |            getCoherentCount             |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |            areCommitsAllCast            |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |             areVotesAllCast             |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |             isAppealFunded              |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |              isVoteActive               |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |              getRoundInfo               |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |               getVoteInfo               |                      External ❗️                       |                |                  NO❗️                  |
-|                              |                                         |                                                        |                |                                        |
-| **IDisputeTemplateRegistry** |                Interface                |                                                        |                |                                        |
-|              └               |           setDisputeTemplate            |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|                              |                                         |                                                        |                |                                        |
-|        **IEvidence**         |                Interface                |                                                        |                |                                        |
-|                              |                                         |                                                        |                |                                        |
-|     **ISortitionModule**     |                Interface                |                                                        |                |                                        |
-|              └               |               createTree                |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |              validateStake              |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |                setStake                 |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |            setJurorInactive             |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |                lockStake                |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |               unlockStake               |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |              penalizeStake              |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |           notifyRandomNumber            |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |                  draw                   |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |             getJurorBalance             |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |            getJurorCourtIDs             |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |              isJurorStaked              |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |           getJurorLeftoverPNK           |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |            createDisputeHook            |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |              postDrawHook               |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |           withdrawLeftoverPNK           |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|                              |                                         |                                                        |                |                                        |
-|        **SafeERC20**         |                 Library                 |                                                        |                |                                        |
-|              └               |            increaseAllowance            |                      Internal 🔒                       |       🛑       |                                        |
-|              └               |              safeTransfer               |                      Internal 🔒                       |       🛑       |                                        |
-|              └               |            safeTransferFrom             |                      Internal 🔒                       |       🛑       |                                        |
-|                              |                                         |                                                        |                |                                        |
-|         **WethLike**         |                Interface                |                                                        |                |                                        |
-|              └               |                 deposit                 |                      External ❗️                       |       💵       |                  NO❗️                  |
-|              └               |                transfer                 |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|                              |                                         |                                                        |                |                                        |
-|         **SafeSend**         |                 Library                 |                                                        |                |                                        |
-|              └               |                safeSend                 |                      Internal 🔒                       |       🛑       |                                        |
-|                              |                                         |                                                        |                |                                        |
-|     **RNGWithFallback**      |             Implementation              |                          IRNG                          |                |                                        |
-|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
-|              └               |             changeGovernor              |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |             changeConsumer              |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |          changeFallbackTimeout          |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |            requestRandomness            |                      External ❗️                       |       🛑       |             onlyByConsumer             |
-|              └               |            receiveRandomness            |                      External ❗️                       |       🛑       |             onlyByConsumer             |
-|                              |                                         |                                                        |                |                                        |
-|       **ChainlinkRNG**       |             Implementation              |              IRNG, VRFConsumerBaseV2Plus               |                |                                        |
-|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |         VRFConsumerBaseV2Plus          |
-|              └               |             changeGovernor              |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |             changeConsumer              |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |          changeVrfCoordinator           |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |              changeKeyHash              |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |          changeSubscriptionId           |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |       changeRequestConfirmations        |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |         changeCallbackGasLimit          |                      External ❗️                       |       🛑       |             onlyByGovernor             |
-|              └               |            requestRandomness            |                      External ❗️                       |       🛑       |             onlyByConsumer             |
-|              └               |           fulfillRandomWords            |                      Internal 🔒                       |       🛑       |                                        |
-|              └               |            receiveRandomness            |                      External ❗️                       |                |                  NO❗️                  |
-|                              |                                         |                                                        |                |                                        |
-|           **IRNG**           |                Interface                |                                                        |                |                                        |
-|              └               |            requestRandomness            |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|              └               |            receiveRandomness            |                      External ❗️                       |       🛑       |                  NO❗️                  |
-|                              |                                         |                                                        |                |                                        |
-|      **UUPSProxiable**       |             Implementation              |                                                        |                |                                        |
-|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |       🛑       |                                        |
-|              └               |            upgradeToAndCall             |                       Public ❗️                        |       💵       |                  NO❗️                  |
-|              └               |              proxiableUUID              |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |                 version                 |                      External ❗️                       |                |                  NO❗️                  |
-|              └               |           \_getImplementation           |                      Internal 🔒                       |                |                                        |
-|                              |                                         |                                                        |                |                                        |
-|        **UUPSProxy**         |             Implementation              |                                                        |                |                                        |
-|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                  NO❗️                  |
-|              └               |               \_delegate                |                      Internal 🔒                       |       🛑       |                                        |
-|              └               |           \_getImplementation           |                      Internal 🔒                       |                |                                        |
-|              └               |               <Fallback>                |                      External ❗️                       |       💵       |                  NO❗️                  |
-|              └               |             <Receive Ether>             |                      External ❗️                       |       💵       |                  NO❗️                  |
-|                              |                                         |                                                        |                |                                        |
-|      **Initializable**       |             Implementation              |                                                        |                |                                        |
-|              └               |           \_checkInitializing           |                      Internal 🔒                       |                |                                        |
-|              └               |          \_disableInitializers          |                      Internal 🔒                       |       🛑       |                                        |
-|              └               |         \_getInitializedVersion         |                      Internal 🔒                       |                |                                        |
-|              └               |            \_isInitializing             |                      Internal 🔒                       |                |                                        |
-|              └               |        \_getInitializableStorage        |                       Private 🔐                       |                |                                        |
+|           Contract           |                  Type                   |                         Bases                          |                |                                     |
+| :--------------------------: | :-------------------------------------: | :----------------------------------------------------: | :------------: | :---------------------------------: |
+|              └               |            **Function Name**            |                     **Visibility**                     | **Mutability** |            **Modifiers**            |
+|                              |                                         |                                                        |                |                                     |
+|        **KlerosCore**        |             Implementation              |      IArbitratorV2, Initializable, UUPSProxiable       |                |                                     |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                NO❗️                 |
+|              └               |               initialize                |                      External ❗️                       |       🛑       |             initializer             |
+|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByOwner             |
+|              └               |                  pause                  |                      External ❗️                       |       🛑       | onlyByGuardianOrOwner whenNotPaused |
+|              └               |                 unpause                 |                      External ❗️                       |       🛑       |       onlyByOwner whenPaused        |
+|              └               |          executeOwnerProposal           |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |               changeOwner               |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |             changeGuardian              |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |             changePinakion              |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |      changeJurorProsecutionModule       |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |          changeSortitionModule          |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |            addNewDisputeKit             |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |               createCourt               |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |          changeCourtParameters          |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |            enableDisputeKits            |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |         changeAcceptedFeeTokens         |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |           changeCurrencyRates           |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |             changeJurorNft              |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |        changeArbitrableWhitelist        |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |    changeArbitrableWhitelistEnabled     |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |                setStake                 |                      External ❗️                       |       🛑       |            whenNotPaused            |
+|              └               |        setStakeBySortitionModule        |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |        transferBySortitionModule        |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |              createDispute              |                      External ❗️                       |       💵       |                NO❗️                 |
+|              └               |              createDispute              |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |             \_createDispute             |                      Internal 🔒                       |       🛑       |                                     |
+|              └               |               passPeriod                |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |                  draw                   |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |                 appeal                  |                      External ❗️                       |       💵       |                NO❗️                 |
+|              └               |                 execute                 |                      External ❗️                       |       🛑       |            whenNotPaused            |
+|              └               |           \_executePenalties            |                      Internal 🔒                       |       🛑       |                                     |
+|              └               |            \_executeRewards             |                      Internal 🔒                       |       🛑       |                                     |
+|              └               |              executeRuling              |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |             arbitrationCost             |                       Public ❗️                        |                |                NO❗️                 |
+|              └               |             arbitrationCost             |                       Public ❗️                        |                |                NO❗️                 |
+|              └               |               appealCost                |                       Public ❗️                        |                |                NO❗️                 |
+|              └               |              appealPeriod               |                      External ❗️                       |                |                NO❗️                 |
+|              └               |              currentRuling              |                       Public ❗️                        |                |                NO❗️                 |
+|              └               |              getRoundInfo               |                      External ❗️                       |                |                NO❗️                 |
+|              └               |          getPnkAtStakePerJuror          |                      External ❗️                       |                |                NO❗️                 |
+|              └               |            getNumberOfRounds            |                      External ❗️                       |                |                NO❗️                 |
+|              └               |               isSupported               |                      External ❗️                       |                |                NO❗️                 |
+|              └               |            getTimesPerPeriod            |                      External ❗️                       |                |                NO❗️                 |
+|              └               |            getNumberOfVotes             |                      External ❗️                       |                |                NO❗️                 |
+|              └               |           isDisputeKitJumping           |                      External ❗️                       |                |                NO❗️                 |
+|              └               |          getDisputeKitsLength           |                      External ❗️                       |                |                NO❗️                 |
+|              └               |         convertEthToTokenAmount         |                       Public ❗️                        |                |                NO❗️                 |
+|              └               |            \_isCourtJumping             |                      Internal 🔒                       |                |                                     |
+|              └               |      \_getCourtAndDisputeKitJumps       |                      Internal 🔒                       |                |                                     |
+|              └               |           \_transferFeeToken            |                      Internal 🔒                       |       🛑       |                                     |
+|              └               |            \_applyCoherence             |                      Internal 🔒                       |                |                                     |
+|              └               |          \_calculatePnkAtStake          |                      Internal 🔒                       |                |                                     |
+|              └               |           \_enableDisputeKit            |                      Internal 🔒                       |       🛑       |                                     |
+|              └               |               \_setStake                |                      Internal 🔒                       |       🛑       |                                     |
+|              └               |             \_stakingFailed             |                      Internal 🔒                       |                |                                     |
+|              └               | \_extraDataToCourtIDMinJurorsDisputeKit |                      Internal 🔒                       |                |                                     |
+|                              |                                         |                                                        |                |                                     |
+|      **PolicyRegistry**      |             Implementation              |              UUPSProxiable, Initializable              |                |                                     |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                NO❗️                 |
+|              └               |               initialize                |                      External ❗️                       |       🛑       |             initializer             |
+|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByOwner             |
+|              └               |               changeOwner               |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |                setPolicy                |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|                              |                                         |                                                        |                |                                     |
+|     **SortitionModule**      |             Implementation              |     ISortitionModule, Initializable, UUPSProxiable     |                |                                     |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                NO❗️                 |
+|              └               |               initialize                |                      External ❗️                       |       🛑       |             initializer             |
+|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByOwner             |
+|              └               |               changeOwner               |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |          changeMinStakingTime           |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |          changeMaxDrawingTime           |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |       changeRandomNumberGenerator       |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |         changeMaxStakePerJuror          |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |          changeMaxTotalStaked           |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |                passPhase                |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |               createTree                |                      External ❗️                       |       🛑       |             onlyByCore              |
+|              └               |          executeDelayedStakes           |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |            createDisputeHook            |                      External ❗️                       |       🛑       |             onlyByCore              |
+|              └               |              postDrawHook               |                      External ❗️                       |       🛑       |             onlyByCore              |
+|              └               |           notifyRandomNumber            |                       Public ❗️                        |       🛑       |                NO❗️                 |
+|              └               |              validateStake              |                      External ❗️                       |       🛑       |             onlyByCore              |
+|              └               |             \_validateStake             |                      Internal 🔒                       |       🛑       |                                     |
+|              └               |                setStake                 |                      External ❗️                       |       🛑       |             onlyByCore              |
+|              └               |             setStakePenalty             |                      External ❗️                       |       🛑       |             onlyByCore              |
+|              └               |             setStakeReward              |                      External ❗️                       |       🛑       |             onlyByCore              |
+|              └               |               \_setStake                |                      Internal 🔒                       |       🛑       |                                     |
+|              └               |                lockStake                |                      External ❗️                       |       🛑       |             onlyByCore              |
+|              └               |               unlockStake               |                      External ❗️                       |       🛑       |             onlyByCore              |
+|              └               |         forcedUnstakeAllCourts          |                      External ❗️                       |       🛑       |             onlyByCore              |
+|              └               |              forcedUnstake              |                      External ❗️                       |       🛑       |             onlyByCore              |
+|              └               |           withdrawLeftoverPNK           |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |                  draw                   |                       Public ❗️                        |                |                NO❗️                 |
+|              └               |                 stakeOf                 |                       Public ❗️                        |                |                NO❗️                 |
+|              └               |             getJurorBalance             |                      External ❗️                       |                |                NO❗️                 |
+|              └               |            getJurorCourtIDs             |                       Public ❗️                        |                |                NO❗️                 |
+|              └               |              isJurorStaked              |                      External ❗️                       |                |                NO❗️                 |
+|              └               |           getJurorLeftoverPNK           |                       Public ❗️                        |                |                NO❗️                 |
+|              └               |           \_extraDataToTreeK            |                      Internal 🔒                       |                |                                     |
+|                              |                                         |                                                        |                |                                     |
+|     **DisputeResolver**      |             Implementation              |                     IArbitrableV2                      |                |                                     |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                NO❗️                 |
+|              └               |               changeOwner               |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |            changeArbitrator             |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |         changeTemplateRegistry          |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |        createDisputeForTemplate         |                      External ❗️                       |       💵       |                NO❗️                 |
+|              └               |       createDisputeForTemplateUri       |                      External ❗️                       |       💵       |                NO❗️                 |
+|              └               |                  rule                   |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |             \_createDispute             |                      Internal 🔒                       |       🛑       |                                     |
+|                              |                                         |                                                        |                |                                     |
+| **DisputeTemplateRegistry**  |             Implementation              | IDisputeTemplateRegistry, UUPSProxiable, Initializable |                |                                     |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                NO❗️                 |
+|              └               |               initialize                |                      External ❗️                       |       🛑       |             initializer             |
+|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByOwner             |
+|              └               |               changeOwner               |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |           setDisputeTemplate            |                      External ❗️                       |       🛑       |                NO❗️                 |
+|                              |                                         |                                                        |                |                                     |
+|    **DisputeKitClassic**     |             Implementation              |                 DisputeKitClassicBase                  |                |                                     |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                NO❗️                 |
+|              └               |               initialize                |                      External ❗️                       |       🛑       |             initializer             |
+|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByOwner             |
+|                              |                                         |                                                        |                |                                     |
+|  **DisputeKitClassicBase**   |             Implementation              |       IDisputeKit, Initializable, UUPSProxiable        |                |                                     |
+|              └               |  \_\_DisputeKitClassicBase_initialize   |                      Internal 🔒                       |       🛑       |          onlyInitializing           |
+|              └               |          executeOwnerProposal           |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |               changeOwner               |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |               changeCore                |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |         changeJumpDisputeKitID          |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |              createDispute              |                      External ❗️                       |       🛑       |             onlyByCore              |
+|              └               |                  draw                   |                      External ❗️                       |       🛑       |        onlyByCore notJumped         |
+|              └               |               castCommit                |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |              \_castCommit               |                      Internal 🔒                       |       🛑       |              notJumped              |
+|              └               |                castVote                 |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |               \_castVote                |                      Internal 🔒                       |       🛑       |              notJumped              |
+|              └               |               fundAppeal                |                      External ❗️                       |       💵       |              notJumped              |
+|              └               |         withdrawFeesAndRewards          |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |                hashVote                 |                       Public ❗️                        |                |                NO❗️                 |
+|              └               |            getFundedChoices             |                       Public ❗️                        |                |                NO❗️                 |
+|              └               |              currentRuling              |                      External ❗️                       |                |                NO❗️                 |
+|              └               |       getDegreeOfCoherenceReward        |                      External ❗️                       |                |                NO❗️                 |
+|              └               |       getDegreeOfCoherencePenalty       |                      External ❗️                       |                |                NO❗️                 |
+|              └               |         \_getDegreeOfCoherence          |                      Internal 🔒                       |                |                                     |
+|              └               |            getCoherentCount             |                      External ❗️                       |                |                NO❗️                 |
+|              └               |            areCommitsAllCast            |                      External ❗️                       |                |                NO❗️                 |
+|              └               |             areVotesAllCast             |                      External ❗️                       |                |                NO❗️                 |
+|              └               |             isAppealFunded              |                      External ❗️                       |                |                NO❗️                 |
+|              └               |             earlyCourtJump              |                      External ❗️                       |                |                NO❗️                 |
+|              └               |          getNbVotesAfterAppeal          |                      External ❗️                       |                |                NO❗️                 |
+|              └               |           getJumpDisputeKitID           |                      External ❗️                       |                |                NO❗️                 |
+|              └               |              isVoteActive               |                      External ❗️                       |                |                NO❗️                 |
+|              └               |              getRoundInfo               |                      External ❗️                       |                |                NO❗️                 |
+|              └               |            getNumberOfRounds            |                      External ❗️                       |                |                NO❗️                 |
+|              └               |         getLocalDisputeRoundID          |                      External ❗️                       |                |                NO❗️                 |
+|              └               |               getVoteInfo               |                      External ❗️                       |                |                NO❗️                 |
+|              └               |          \_getExpectedVoteHash          |                      Internal 🔒                       |                |                                     |
+|              └               |             \_postDrawCheck             |                      Internal 🔒                       |                |                                     |
+|                              |                                         |                                                        |                |                                     |
+|      **IBalanceHolder**      |                Interface                |                                                        |                |                                     |
+|              └               |                balanceOf                |                      External ❗️                       |                |                NO❗️                 |
+|                              |                                         |                                                        |                |                                     |
+|  **IBalanceHolderERC1155**   |                Interface                |                                                        |                |                                     |
+|              └               |                balanceOf                |                      External ❗️                       |                |                NO❗️                 |
+|                              |                                         |                                                        |                |                                     |
+|     **DisputeKitGated**      |             Implementation              |                 DisputeKitClassicBase                  |                |                                     |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                NO❗️                 |
+|              └               |               initialize                |                      External ❗️                       |       🛑       |             initializer             |
+|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByOwner             |
+|              └               |          extraDataToTokenInfo           |                       Public ❗️                        |                |                NO❗️                 |
+|              └               |             \_postDrawCheck             |                      Internal 🔒                       |                |                                     |
+|                              |                                         |                                                        |                |                                     |
+|      **IBalanceHolder**      |                Interface                |                                                        |                |                                     |
+|              └               |                balanceOf                |                      External ❗️                       |                |                NO❗️                 |
+|                              |                                         |                                                        |                |                                     |
+|  **IBalanceHolderERC1155**   |                Interface                |                                                        |                |                                     |
+|              └               |                balanceOf                |                      External ❗️                       |                |                NO❗️                 |
+|                              |                                         |                                                        |                |                                     |
+|  **DisputeKitGatedShutter**  |             Implementation              |                 DisputeKitClassicBase                  |                |                                     |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                NO❗️                 |
+|              └               |               initialize                |                      External ❗️                       |       🛑       |             initializer             |
+|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByOwner             |
+|              └               |            castCommitShutter            |                      External ❗️                       |       🛑       |              notJumped              |
+|              └               |             castVoteShutter             |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |                hashVote                 |                       Public ❗️                        |                |                NO❗️                 |
+|              └               |          \_getExpectedVoteHash          |                      Internal 🔒                       |                |                                     |
+|              └               |         \_extraDataToTokenInfo          |                      Internal 🔒                       |                |                                     |
+|              └               |             \_postDrawCheck             |                      Internal 🔒                       |                |                                     |
+|                              |                                         |                                                        |                |                                     |
+|    **DisputeKitShutter**     |             Implementation              |                 DisputeKitClassicBase                  |                |                                     |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                NO❗️                 |
+|              └               |               initialize                |                      External ❗️                       |       🛑       |             initializer             |
+|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByOwner             |
+|              └               |            castCommitShutter            |                      External ❗️                       |       🛑       |              notJumped              |
+|              └               |             castVoteShutter             |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |                hashVote                 |                       Public ❗️                        |                |                NO❗️                 |
+|              └               |          \_getExpectedVoteHash          |                      Internal 🔒                       |                |                                     |
+|                              |                                         |                                                        |                |                                     |
+|     **IProofOfHumanity**     |                Interface                |                                                        |                |                                     |
+|              └               |              isRegistered               |                      External ❗️                       |                |                NO❗️                 |
+|                              |                                         |                                                        |                |                                     |
+| **DisputeKitSybilResistant** |             Implementation              |                 DisputeKitClassicBase                  |                |                                     |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                NO❗️                 |
+|              └               |               initialize                |                      External ❗️                       |       🛑       |             initializer             |
+|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByOwner             |
+|              └               |             \_postDrawCheck             |                      Internal 🔒                       |                |                                     |
+|                              |                                         |                                                        |                |                                     |
+|      **EvidenceModule**      |             Implementation              |        IEvidence, Initializable, UUPSProxiable         |                |                                     |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                NO❗️                 |
+|              └               |               initialize                |                      External ❗️                       |       🛑       |             initializer             |
+|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |                |             onlyByOwner             |
+|              └               |             submitEvidence              |                      External ❗️                       |       🛑       |                NO❗️                 |
+|                              |                                         |                                                        |                |                                     |
+|      **IArbitrableV2**       |                Interface                |                                                        |                |                                     |
+|              └               |                  rule                   |                      External ❗️                       |       🛑       |                NO❗️                 |
+|                              |                                         |                                                        |                |                                     |
+|      **IArbitratorV2**       |                Interface                |                                                        |                |                                     |
+|              └               |              createDispute              |                      External ❗️                       |       💵       |                NO❗️                 |
+|              └               |              createDispute              |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |             arbitrationCost             |                      External ❗️                       |                |                NO❗️                 |
+|              └               |             arbitrationCost             |                      External ❗️                       |                |                NO❗️                 |
+|              └               |              currentRuling              |                      External ❗️                       |                |                NO❗️                 |
+|                              |                                         |                                                        |                |                                     |
+|       **IDisputeKit**        |                Interface                |                                                        |                |                                     |
+|              └               |              createDispute              |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |                  draw                   |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |              currentRuling              |                      External ❗️                       |                |                NO❗️                 |
+|              └               |       getDegreeOfCoherenceReward        |                      External ❗️                       |                |                NO❗️                 |
+|              └               |       getDegreeOfCoherencePenalty       |                      External ❗️                       |                |                NO❗️                 |
+|              └               |            getCoherentCount             |                      External ❗️                       |                |                NO❗️                 |
+|              └               |            areCommitsAllCast            |                      External ❗️                       |                |                NO❗️                 |
+|              └               |             areVotesAllCast             |                      External ❗️                       |                |                NO❗️                 |
+|              └               |             isAppealFunded              |                      External ❗️                       |                |                NO❗️                 |
+|              └               |             earlyCourtJump              |                      External ❗️                       |                |                NO❗️                 |
+|              └               |          getNbVotesAfterAppeal          |                      External ❗️                       |                |                NO❗️                 |
+|              └               |           getJumpDisputeKitID           |                      External ❗️                       |                |                NO❗️                 |
+|              └               |              isVoteActive               |                      External ❗️                       |                |                NO❗️                 |
+|              └               |              getRoundInfo               |                      External ❗️                       |                |                NO❗️                 |
+|              └               |               getVoteInfo               |                      External ❗️                       |                |                NO❗️                 |
+|                              |                                         |                                                        |                |                                     |
+| **IDisputeTemplateRegistry** |                Interface                |                                                        |                |                                     |
+|              └               |           setDisputeTemplate            |                      External ❗️                       |       🛑       |                NO❗️                 |
+|                              |                                         |                                                        |                |                                     |
+|        **IEvidence**         |                Interface                |                                                        |                |                                     |
+|                              |                                         |                                                        |                |                                     |
+|     **ISortitionModule**     |                Interface                |                                                        |                |                                     |
+|              └               |               createTree                |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |              validateStake              |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |                setStake                 |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |             setStakePenalty             |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |             setStakeReward              |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |         forcedUnstakeAllCourts          |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |              forcedUnstake              |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |                lockStake                |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |               unlockStake               |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |           notifyRandomNumber            |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |                  draw                   |                      External ❗️                       |                |                NO❗️                 |
+|              └               |             getJurorBalance             |                      External ❗️                       |                |                NO❗️                 |
+|              └               |            getJurorCourtIDs             |                      External ❗️                       |                |                NO❗️                 |
+|              └               |              isJurorStaked              |                      External ❗️                       |                |                NO❗️                 |
+|              └               |           getJurorLeftoverPNK           |                      External ❗️                       |                |                NO❗️                 |
+|              └               |            createDisputeHook            |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |              postDrawHook               |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |           withdrawLeftoverPNK           |                      External ❗️                       |       🛑       |                NO❗️                 |
+|                              |                                         |                                                        |                |                                     |
+|        **SafeERC20**         |                 Library                 |                                                        |                |                                     |
+|              └               |            increaseAllowance            |                      Internal 🔒                       |       🛑       |                                     |
+|              └               |              safeTransfer               |                      Internal 🔒                       |       🛑       |                                     |
+|              └               |            safeTransferFrom             |                      Internal 🔒                       |       🛑       |                                     |
+|                              |                                         |                                                        |                |                                     |
+|         **WethLike**         |                Interface                |                                                        |                |                                     |
+|              └               |                 deposit                 |                      External ❗️                       |       💵       |                NO❗️                 |
+|              └               |                transfer                 |                      External ❗️                       |       🛑       |                NO❗️                 |
+|                              |                                         |                                                        |                |                                     |
+|         **SafeSend**         |                 Library                 |                                                        |                |                                     |
+|              └               |                safeSend                 |                      Internal 🔒                       |       🛑       |                                     |
+|                              |                                         |                                                        |                |                                     |
+|     **RNGWithFallback**      |             Implementation              |                          IRNG                          |                |                                     |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                NO❗️                 |
+|              └               |               changeOwner               |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |             changeConsumer              |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |          changeFallbackTimeout          |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |            requestRandomness            |                      External ❗️                       |       🛑       |           onlyByConsumer            |
+|              └               |            receiveRandomness            |                      External ❗️                       |       🛑       |           onlyByConsumer            |
+|                              |                                         |                                                        |                |                                     |
+|       **ChainlinkRNG**       |             Implementation              |              IRNG, VRFConsumerBaseV2Plus               |                |                                     |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |        VRFConsumerBaseV2Plus        |
+|              └               |               changeOwner               |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |             changeConsumer              |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |          changeVrfCoordinator           |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |              changeKeyHash              |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |          changeSubscriptionId           |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |       changeRequestConfirmations        |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |         changeCallbackGasLimit          |                      External ❗️                       |       🛑       |             onlyByOwner             |
+|              └               |            requestRandomness            |                      External ❗️                       |       🛑       |           onlyByConsumer            |
+|              └               |           fulfillRandomWords            |                      Internal 🔒                       |       🛑       |                                     |
+|              └               |            receiveRandomness            |                      External ❗️                       |                |                NO❗️                 |
+|                              |                                         |                                                        |                |                                     |
+|           **IRNG**           |                Interface                |                                                        |                |                                     |
+|              └               |            requestRandomness            |                      External ❗️                       |       🛑       |                NO❗️                 |
+|              └               |            receiveRandomness            |                      External ❗️                       |       🛑       |                NO❗️                 |
+|                              |                                         |                                                        |                |                                     |
+|      **UUPSProxiable**       |             Implementation              |                                                        |                |                                     |
+|              └               |           \_authorizeUpgrade            |                      Internal 🔒                       |       🛑       |                                     |
+|              └               |            upgradeToAndCall             |                       Public ❗️                        |       💵       |                NO❗️                 |
+|              └               |              proxiableUUID              |                      External ❗️                       |                |                NO❗️                 |
+|              └               |                 version                 |                      External ❗️                       |                |                NO❗️                 |
+|              └               |           \_getImplementation           |                      Internal 🔒                       |                |                                     |
+|                              |                                         |                                                        |                |                                     |
+|        **UUPSProxy**         |             Implementation              |                                                        |                |                                     |
+|              └               |              <Constructor>              |                       Public ❗️                        |       🛑       |                NO❗️                 |
+|              └               |               \_delegate                |                      Internal 🔒                       |       🛑       |                                     |
+|              └               |           \_getImplementation           |                      Internal 🔒                       |                |                                     |
+|              └               |               <Fallback>                |                      External ❗️                       |       💵       |                NO❗️                 |
+|              └               |             <Receive Ether>             |                      External ❗️                       |       💵       |                NO❗️                 |
+|                              |                                         |                                                        |                |                                     |
+|      **Initializable**       |             Implementation              |                                                        |                |                                     |
+|              └               |           \_checkInitializing           |                      Internal 🔒                       |                |                                     |
+|              └               |          \_disableInitializers          |                      Internal 🔒                       |       🛑       |                                     |
+|              └               |         \_getInitializedVersion         |                      Internal 🔒                       |                |                                     |
+|              └               |            \_isInitializing             |                      Internal 🔒                       |                |                                     |
+|              └               |        \_getInitializableStorage        |                       Private 🔐                       |                |                                     |
 
 Legend
 

From 8636c2352728a929c1f11d40b0ad8302afac66ac Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Fri, 5 Sep 2025 00:13:47 +0100
Subject: [PATCH 103/175] chore: rename of the arbitrum contract artifacts, no
 more Neo suffix in Ethers/Viem helpers

---
 contracts/deployments/arbitrum.ts             | 2668 ++++++++---------
 ...ClassicNeo.json => DisputeKitClassic.json} |    0
 ... => DisputeKitClassic_Implementation.json} |    0
 ...roxy.json => DisputeKitClassic_Proxy.json} |    0
 ...eKitGatedNeo.json => DisputeKitGated.json} |    0
 ...erNeo.json => DisputeKitGatedShutter.json} |    0
 ...isputeKitGatedShutter_Implementation.json} |    0
 ...json => DisputeKitGatedShutter_Proxy.json} |    0
 ...on => DisputeKitGated_Implementation.json} |    0
 ..._Proxy.json => DisputeKitGated_Proxy.json} |    0
 ...ShutterNeo.json => DisputeKitShutter.json} |    0
 ... => DisputeKitShutter_Implementation.json} |    0
 ...roxy.json => DisputeKitShutter_Proxy.json} |    0
 ...eResolverNeo.json => DisputeResolver.json} |    0
 ...ulerNeo.json => DisputeResolverRuler.json} |    0
 .../{KlerosCoreNeo.json => KlerosCore.json}   |    0
 ...CoreRulerNeo.json => KlerosCoreRuler.json} |    0
 ...on => KlerosCoreRuler_Implementation.json} |    0
 ..._Proxy.json => KlerosCoreRuler_Proxy.json} |    0
 ...on.json => KlerosCore_Implementation.json} |    0
 ...reNeo_Proxy.json => KlerosCore_Proxy.json} |    0
 ...ionModuleNeo.json => SortitionModule.json} |    0
 ...on => SortitionModule_Implementation.json} |    0
 ..._Proxy.json => SortitionModule_Proxy.json} |    0
 contracts/deployments/contractsEthers.ts      |   14 +-
 contracts/deployments/contractsViem.ts        |   14 +-
 contracts/deployments/mainnet.viem.ts         | 1930 ++++++------
 .../integration/getContractsEthers.test.ts    |   14 +-
 .../test/integration/getContractsViem.test.ts |   14 +-
 29 files changed, 2327 insertions(+), 2327 deletions(-)
 rename contracts/deployments/arbitrum/{DisputeKitClassicNeo.json => DisputeKitClassic.json} (100%)
 rename contracts/deployments/arbitrum/{DisputeKitClassicNeo_Implementation.json => DisputeKitClassic_Implementation.json} (100%)
 rename contracts/deployments/arbitrum/{DisputeKitClassicNeo_Proxy.json => DisputeKitClassic_Proxy.json} (100%)
 rename contracts/deployments/arbitrum/{DisputeKitGatedNeo.json => DisputeKitGated.json} (100%)
 rename contracts/deployments/arbitrum/{DisputeKitGatedShutterNeo.json => DisputeKitGatedShutter.json} (100%)
 rename contracts/deployments/arbitrum/{DisputeKitGatedShutterNeo_Implementation.json => DisputeKitGatedShutter_Implementation.json} (100%)
 rename contracts/deployments/arbitrum/{DisputeKitGatedShutterNeo_Proxy.json => DisputeKitGatedShutter_Proxy.json} (100%)
 rename contracts/deployments/arbitrum/{DisputeKitGatedNeo_Implementation.json => DisputeKitGated_Implementation.json} (100%)
 rename contracts/deployments/arbitrum/{DisputeKitGatedNeo_Proxy.json => DisputeKitGated_Proxy.json} (100%)
 rename contracts/deployments/arbitrum/{DisputeKitShutterNeo.json => DisputeKitShutter.json} (100%)
 rename contracts/deployments/arbitrum/{DisputeKitShutterNeo_Implementation.json => DisputeKitShutter_Implementation.json} (100%)
 rename contracts/deployments/arbitrum/{DisputeKitShutterNeo_Proxy.json => DisputeKitShutter_Proxy.json} (100%)
 rename contracts/deployments/arbitrum/{DisputeResolverNeo.json => DisputeResolver.json} (100%)
 rename contracts/deployments/arbitrum/{DisputeResolverRulerNeo.json => DisputeResolverRuler.json} (100%)
 rename contracts/deployments/arbitrum/{KlerosCoreNeo.json => KlerosCore.json} (100%)
 rename contracts/deployments/arbitrum/{KlerosCoreRulerNeo.json => KlerosCoreRuler.json} (100%)
 rename contracts/deployments/arbitrum/{KlerosCoreRulerNeo_Implementation.json => KlerosCoreRuler_Implementation.json} (100%)
 rename contracts/deployments/arbitrum/{KlerosCoreRulerNeo_Proxy.json => KlerosCoreRuler_Proxy.json} (100%)
 rename contracts/deployments/arbitrum/{KlerosCoreNeo_Implementation.json => KlerosCore_Implementation.json} (100%)
 rename contracts/deployments/arbitrum/{KlerosCoreNeo_Proxy.json => KlerosCore_Proxy.json} (100%)
 rename contracts/deployments/arbitrum/{SortitionModuleNeo.json => SortitionModule.json} (100%)
 rename contracts/deployments/arbitrum/{SortitionModuleNeo_Implementation.json => SortitionModule_Implementation.json} (100%)
 rename contracts/deployments/arbitrum/{SortitionModuleNeo_Proxy.json => SortitionModule_Proxy.json} (100%)

diff --git a/contracts/deployments/arbitrum.ts b/contracts/deployments/arbitrum.ts
index b0b8e8fd8..2b5d6eb3f 100644
--- a/contracts/deployments/arbitrum.ts
+++ b/contracts/deployments/arbitrum.ts
@@ -2793,7 +2793,7 @@ export default {
         },
       ],
     },
-    DisputeKitClassicNeo: {
+    DisputeKitClassic: {
       address: "0x70B464be85A547144C72485eBa2577E5D3A45421",
       abi: [
         {
@@ -3943,7 +3943,7 @@ export default {
         },
       ],
     },
-    DisputeKitClassicNeo_Implementation: {
+    DisputeKitClassic_Implementation: {
       address: "0x371Aa4B1AE5b5f9422f3Ff1d105029AAd1D319BC",
       abi: [
         {
@@ -5074,7 +5074,7 @@ export default {
         },
       ],
     },
-    DisputeKitClassicNeo_Proxy: {
+    DisputeKitClassic_Proxy: {
       address: "0x70B464be85A547144C72485eBa2577E5D3A45421",
       abi: [
         {
@@ -5103,7 +5103,7 @@ export default {
         },
       ],
     },
-    DisputeKitGatedNeo: {
+    DisputeKitGated: {
       address: "0xaE1eed20C125B739b64c948820C61F809ad9a925",
       abi: [
         {
@@ -6282,13 +6282,16 @@ export default {
         },
       ],
     },
-    DisputeKitGatedNeo_Implementation: {
-      address: "0xEA7863E6dE863e8E6d037D8693ad5dA45Db7790a",
+    DisputeKitGatedShutter: {
+      address: "0x788330092B9704809C19858E39EB9Ac402c2E47b",
       abi: [
         {
-          inputs: [],
-          stateMutability: "nonpayable",
-          type: "constructor",
+          stateMutability: "payable",
+          type: "fallback",
+        },
+        {
+          stateMutability: "payable",
+          type: "receive",
         },
         {
           inputs: [],
@@ -6388,6 +6391,43 @@ export default {
           name: "CommitCast",
           type: "event",
         },
+        {
+          anonymous: false,
+          inputs: [
+            {
+              indexed: true,
+              internalType: "uint256",
+              name: "_coreDisputeID",
+              type: "uint256",
+            },
+            {
+              indexed: true,
+              internalType: "address",
+              name: "_juror",
+              type: "address",
+            },
+            {
+              indexed: true,
+              internalType: "bytes32",
+              name: "_commit",
+              type: "bytes32",
+            },
+            {
+              indexed: false,
+              internalType: "bytes32",
+              name: "_identity",
+              type: "bytes32",
+            },
+            {
+              indexed: false,
+              internalType: "bytes",
+              name: "_encryptedVote",
+              type: "bytes",
+            },
+          ],
+          name: "CommitCastShutter",
+          type: "event",
+        },
         {
           anonymous: false,
           inputs: [
@@ -6692,6 +6732,39 @@ export default {
           stateMutability: "nonpayable",
           type: "function",
         },
+        {
+          inputs: [
+            {
+              internalType: "uint256",
+              name: "_coreDisputeID",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256[]",
+              name: "_voteIDs",
+              type: "uint256[]",
+            },
+            {
+              internalType: "bytes32",
+              name: "_commit",
+              type: "bytes32",
+            },
+            {
+              internalType: "bytes32",
+              name: "_identity",
+              type: "bytes32",
+            },
+            {
+              internalType: "bytes",
+              name: "_encryptedVote",
+              type: "bytes",
+            },
+          ],
+          name: "castCommitShutter",
+          outputs: [],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -6725,6 +6798,39 @@ export default {
           stateMutability: "nonpayable",
           type: "function",
         },
+        {
+          inputs: [
+            {
+              internalType: "uint256",
+              name: "_coreDisputeID",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256[]",
+              name: "_voteIDs",
+              type: "uint256[]",
+            },
+            {
+              internalType: "uint256",
+              name: "_choice",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "_salt",
+              type: "uint256",
+            },
+            {
+              internalType: "string",
+              name: "_justification",
+              type: "string",
+            },
+          ],
+          name: "castVoteShutter",
+          outputs: [],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -6935,35 +7041,6 @@ export default {
           stateMutability: "nonpayable",
           type: "function",
         },
-        {
-          inputs: [
-            {
-              internalType: "bytes",
-              name: "_extraData",
-              type: "bytes",
-            },
-          ],
-          name: "extraDataToTokenInfo",
-          outputs: [
-            {
-              internalType: "address",
-              name: "tokenGate",
-              type: "address",
-            },
-            {
-              internalType: "bool",
-              name: "isERC1155",
-              type: "bool",
-            },
-            {
-              internalType: "uint256",
-              name: "tokenId",
-              type: "uint256",
-            },
-          ],
-          stateMutability: "pure",
-          type: "function",
-        },
         {
           inputs: [
             {
@@ -7440,11 +7517,6 @@ export default {
           stateMutability: "nonpayable",
           type: "function",
         },
-      ],
-    },
-    DisputeKitGatedNeo_Proxy: {
-      address: "0xaE1eed20C125B739b64c948820C61F809ad9a925",
-      abi: [
         {
           inputs: [
             {
@@ -7461,26 +7533,15 @@ export default {
           stateMutability: "nonpayable",
           type: "constructor",
         },
-        {
-          stateMutability: "payable",
-          type: "fallback",
-        },
-        {
-          stateMutability: "payable",
-          type: "receive",
-        },
       ],
     },
-    DisputeKitGatedShutterNeo: {
-      address: "0x788330092B9704809C19858E39EB9Ac402c2E47b",
+    DisputeKitGatedShutter_Implementation: {
+      address: "0xb12EB4c0716d3A9861a9AC471c6CdDB808d61b32",
       abi: [
         {
-          stateMutability: "payable",
-          type: "fallback",
-        },
-        {
-          stateMutability: "payable",
-          type: "receive",
+          inputs: [],
+          stateMutability: "nonpayable",
+          type: "constructor",
         },
         {
           inputs: [],
@@ -8706,6 +8767,11 @@ export default {
           stateMutability: "nonpayable",
           type: "function",
         },
+      ],
+    },
+    DisputeKitGatedShutter_Proxy: {
+      address: "0x788330092B9704809C19858E39EB9Ac402c2E47b",
+      abi: [
         {
           inputs: [
             {
@@ -8722,10 +8788,18 @@ export default {
           stateMutability: "nonpayable",
           type: "constructor",
         },
+        {
+          stateMutability: "payable",
+          type: "fallback",
+        },
+        {
+          stateMutability: "payable",
+          type: "receive",
+        },
       ],
     },
-    DisputeKitGatedShutterNeo_Implementation: {
-      address: "0xb12EB4c0716d3A9861a9AC471c6CdDB808d61b32",
+    DisputeKitGated_Implementation: {
+      address: "0xEA7863E6dE863e8E6d037D8693ad5dA45Db7790a",
       abi: [
         {
           inputs: [],
@@ -8830,43 +8904,6 @@ export default {
           name: "CommitCast",
           type: "event",
         },
-        {
-          anonymous: false,
-          inputs: [
-            {
-              indexed: true,
-              internalType: "uint256",
-              name: "_coreDisputeID",
-              type: "uint256",
-            },
-            {
-              indexed: true,
-              internalType: "address",
-              name: "_juror",
-              type: "address",
-            },
-            {
-              indexed: true,
-              internalType: "bytes32",
-              name: "_commit",
-              type: "bytes32",
-            },
-            {
-              indexed: false,
-              internalType: "bytes32",
-              name: "_identity",
-              type: "bytes32",
-            },
-            {
-              indexed: false,
-              internalType: "bytes",
-              name: "_encryptedVote",
-              type: "bytes",
-            },
-          ],
-          name: "CommitCastShutter",
-          type: "event",
-        },
         {
           anonymous: false,
           inputs: [
@@ -9171,39 +9208,6 @@ export default {
           stateMutability: "nonpayable",
           type: "function",
         },
-        {
-          inputs: [
-            {
-              internalType: "uint256",
-              name: "_coreDisputeID",
-              type: "uint256",
-            },
-            {
-              internalType: "uint256[]",
-              name: "_voteIDs",
-              type: "uint256[]",
-            },
-            {
-              internalType: "bytes32",
-              name: "_commit",
-              type: "bytes32",
-            },
-            {
-              internalType: "bytes32",
-              name: "_identity",
-              type: "bytes32",
-            },
-            {
-              internalType: "bytes",
-              name: "_encryptedVote",
-              type: "bytes",
-            },
-          ],
-          name: "castCommitShutter",
-          outputs: [],
-          stateMutability: "nonpayable",
-          type: "function",
-        },
         {
           inputs: [
             {
@@ -9240,42 +9244,9 @@ export default {
         {
           inputs: [
             {
-              internalType: "uint256",
-              name: "_coreDisputeID",
-              type: "uint256",
-            },
-            {
-              internalType: "uint256[]",
-              name: "_voteIDs",
-              type: "uint256[]",
-            },
-            {
-              internalType: "uint256",
-              name: "_choice",
-              type: "uint256",
-            },
-            {
-              internalType: "uint256",
-              name: "_salt",
-              type: "uint256",
-            },
-            {
-              internalType: "string",
-              name: "_justification",
-              type: "string",
-            },
-          ],
-          name: "castVoteShutter",
-          outputs: [],
-          stateMutability: "nonpayable",
-          type: "function",
-        },
-        {
-          inputs: [
-            {
-              internalType: "address",
-              name: "_core",
-              type: "address",
+              internalType: "address",
+              name: "_core",
+              type: "address",
             },
           ],
           name: "changeCore",
@@ -9480,6 +9451,35 @@ export default {
           stateMutability: "nonpayable",
           type: "function",
         },
+        {
+          inputs: [
+            {
+              internalType: "bytes",
+              name: "_extraData",
+              type: "bytes",
+            },
+          ],
+          name: "extraDataToTokenInfo",
+          outputs: [
+            {
+              internalType: "address",
+              name: "tokenGate",
+              type: "address",
+            },
+            {
+              internalType: "bool",
+              name: "isERC1155",
+              type: "bool",
+            },
+            {
+              internalType: "uint256",
+              name: "tokenId",
+              type: "uint256",
+            },
+          ],
+          stateMutability: "pure",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -9958,8 +9958,8 @@ export default {
         },
       ],
     },
-    DisputeKitGatedShutterNeo_Proxy: {
-      address: "0x788330092B9704809C19858E39EB9Ac402c2E47b",
+    DisputeKitGated_Proxy: {
+      address: "0xaE1eed20C125B739b64c948820C61F809ad9a925",
       abi: [
         {
           inputs: [
@@ -9987,7 +9987,7 @@ export default {
         },
       ],
     },
-    DisputeKitShutterNeo: {
+    DisputeKitShutter: {
       address: "0x9D3e3f1765744c2a1BC6F6088549770444BBC768",
       abi: [
         {
@@ -11240,7 +11240,7 @@ export default {
         },
       ],
     },
-    DisputeKitShutterNeo_Implementation: {
+    DisputeKitShutter_Implementation: {
       address: "0xF3103B46403A0bBd4551648BFb29BCC2b8783947",
       abi: [
         {
@@ -12474,7 +12474,7 @@ export default {
         },
       ],
     },
-    DisputeKitShutterNeo_Proxy: {
+    DisputeKitShutter_Proxy: {
       address: "0x9D3e3f1765744c2a1BC6F6088549770444BBC768",
       abi: [
         {
@@ -12503,7 +12503,7 @@ export default {
         },
       ],
     },
-    DisputeResolverNeo: {
+    DisputeResolver: {
       address: "0xb5526D022962A1fFf6eD32C93e8b714c901F4323",
       abi: [
         {
@@ -12798,7 +12798,7 @@ export default {
         },
       ],
     },
-    DisputeResolverRulerNeo: {
+    DisputeResolverRuler: {
       address: "0xb3a5FdEAF461c42caCe148e978e6FBCa97bE6140",
       abi: [
         {
@@ -14027,7 +14027,7 @@ export default {
         },
       ],
     },
-    KlerosCoreNeo: {
+    KlerosCore: {
       address: "0x991d2df165670b9cac3B022f4B68D65b664222ea",
       abi: [
         {
@@ -16069,32 +16069,25 @@ export default {
         },
       ],
     },
-    KlerosCoreNeo_Implementation: {
-      address: "0xC1210493804eEF123096F9581Ee82B915150E54c",
+    KlerosCoreRuler: {
+      address: "0xc0169e0B19aE02ac4fADD689260CF038726DFE13",
       abi: [
         {
-          inputs: [],
-          stateMutability: "nonpayable",
-          type: "constructor",
-        },
-        {
-          inputs: [],
-          name: "AlreadyInitialized",
-          type: "error",
+          stateMutability: "payable",
+          type: "fallback",
         },
         {
-          inputs: [],
-          name: "AppealFeesNotEnough",
-          type: "error",
+          stateMutability: "payable",
+          type: "receive",
         },
         {
           inputs: [],
-          name: "AppealPeriodNotPassed",
+          name: "AlreadyInitialized",
           type: "error",
         },
         {
           inputs: [],
-          name: "ArbitrableNotWhitelisted",
+          name: "AppealFeesNotEnough",
           type: "error",
         },
         {
@@ -16102,46 +16095,11 @@ export default {
           name: "ArbitrationFeesNotEnough",
           type: "error",
         },
-        {
-          inputs: [],
-          name: "CannotDisableClassicDK",
-          type: "error",
-        },
-        {
-          inputs: [],
-          name: "CommitPeriodNotPassed",
-          type: "error",
-        },
-        {
-          inputs: [],
-          name: "DisputeKitNotSupportedByCourt",
-          type: "error",
-        },
-        {
-          inputs: [],
-          name: "DisputeKitOnly",
-          type: "error",
-        },
         {
           inputs: [],
           name: "DisputeNotAppealable",
           type: "error",
         },
-        {
-          inputs: [],
-          name: "DisputePeriodIsFinal",
-          type: "error",
-        },
-        {
-          inputs: [],
-          name: "DisputeStillDrawing",
-          type: "error",
-        },
-        {
-          inputs: [],
-          name: "EvidenceNotPassedAndNotAppeal",
-          type: "error",
-        },
         {
           inputs: [],
           name: "FailedDelegateCall",
@@ -16154,12 +16112,7 @@ export default {
         },
         {
           inputs: [],
-          name: "GuardianOrGovernorOnly",
-          type: "error",
-        },
-        {
-          inputs: [],
-          name: "InvalidDisputKitParent",
+          name: "GovernorOrInstructorOnly",
           type: "error",
         },
         {
@@ -16180,27 +16133,7 @@ export default {
         },
         {
           inputs: [],
-          name: "MinStakeLowerThanParentCourt",
-          type: "error",
-        },
-        {
-          inputs: [],
-          name: "MustSupportDisputeKitClassic",
-          type: "error",
-        },
-        {
-          inputs: [],
-          name: "NotEligibleForStaking",
-          type: "error",
-        },
-        {
-          inputs: [],
-          name: "NotEvidencePeriod",
-          type: "error",
-        },
-        {
-          inputs: [],
-          name: "NotExecutionPeriod",
+          name: "NoRulerSet",
           type: "error",
         },
         {
@@ -16210,47 +16143,17 @@ export default {
         },
         {
           inputs: [],
-          name: "RulingAlreadyExecuted",
-          type: "error",
-        },
-        {
-          inputs: [],
-          name: "SortitionModuleOnly",
-          type: "error",
-        },
-        {
-          inputs: [],
-          name: "StakingInTooManyCourts",
-          type: "error",
-        },
-        {
-          inputs: [],
-          name: "StakingLessThanCourtMinStake",
-          type: "error",
-        },
-        {
-          inputs: [],
-          name: "StakingMoreThanMaxStakePerJuror",
-          type: "error",
-        },
-        {
-          inputs: [],
-          name: "StakingMoreThanMaxTotalStaked",
-          type: "error",
-        },
-        {
-          inputs: [],
-          name: "StakingNotPossibleInThisCourt",
+          name: "RulerOnly",
           type: "error",
         },
         {
           inputs: [],
-          name: "StakingTransferFailed",
+          name: "RulingAlreadyExecuted",
           type: "error",
         },
         {
           inputs: [],
-          name: "StakingZeroWhenNoStake",
+          name: "RulingModeNotSet",
           type: "error",
         },
         {
@@ -16279,41 +16182,11 @@ export default {
           name: "UUPSUnsupportedProxiableUUID",
           type: "error",
         },
-        {
-          inputs: [],
-          name: "UnstakingTransferFailed",
-          type: "error",
-        },
         {
           inputs: [],
           name: "UnsuccessfulCall",
           type: "error",
         },
-        {
-          inputs: [],
-          name: "UnsupportedDisputeKit",
-          type: "error",
-        },
-        {
-          inputs: [],
-          name: "VotePeriodNotPassed",
-          type: "error",
-        },
-        {
-          inputs: [],
-          name: "WhenNotPausedOnly",
-          type: "error",
-        },
-        {
-          inputs: [],
-          name: "WhenPausedOnly",
-          type: "error",
-        },
-        {
-          inputs: [],
-          name: "WrongDisputeKitIndex",
-          type: "error",
-        },
         {
           anonymous: false,
           inputs: [
@@ -16376,60 +16249,42 @@ export default {
           inputs: [
             {
               indexed: true,
-              internalType: "uint96",
-              name: "_courtID",
-              type: "uint96",
+              internalType: "contract IArbitrableV2",
+              name: "_arbitrable",
+              type: "address",
             },
             {
               indexed: true,
-              internalType: "uint96",
-              name: "_parent",
-              type: "uint96",
-            },
-            {
-              indexed: false,
-              internalType: "bool",
-              name: "_hiddenVotes",
-              type: "bool",
+              internalType: "enum KlerosCoreRuler.RulingMode",
+              name: "mode",
+              type: "uint8",
             },
             {
-              indexed: false,
+              indexed: true,
               internalType: "uint256",
-              name: "_minStake",
+              name: "_disputeID",
               type: "uint256",
             },
             {
               indexed: false,
               internalType: "uint256",
-              name: "_alpha",
+              name: "_ruling",
               type: "uint256",
             },
             {
               indexed: false,
-              internalType: "uint256",
-              name: "_feeForJuror",
-              type: "uint256",
+              internalType: "bool",
+              name: "tied",
+              type: "bool",
             },
             {
               indexed: false,
-              internalType: "uint256",
-              name: "_jurorsForCourtJump",
-              type: "uint256",
-            },
-            {
-              indexed: false,
-              internalType: "uint256[4]",
-              name: "_timesPerPeriod",
-              type: "uint256[4]",
-            },
-            {
-              indexed: false,
-              internalType: "uint256[]",
-              name: "_supportedDisputeKits",
-              type: "uint256[]",
+              internalType: "bool",
+              name: "overridden",
+              type: "bool",
             },
           ],
-          name: "CourtCreated",
+          name: "AutoRuled",
           type: "event",
         },
         {
@@ -16438,38 +16293,13 @@ export default {
             {
               indexed: true,
               internalType: "uint256",
-              name: "_disputeID",
-              type: "uint256",
-            },
-            {
-              indexed: true,
-              internalType: "uint256",
-              name: "_roundID",
+              name: "_courtID",
               type: "uint256",
             },
             {
               indexed: true,
               internalType: "uint96",
-              name: "_fromCourtID",
-              type: "uint96",
-            },
-            {
-              indexed: false,
-              internalType: "uint96",
-              name: "_toCourtID",
-              type: "uint96",
-            },
-          ],
-          name: "CourtJump",
-          type: "event",
-        },
-        {
-          anonymous: false,
-          inputs: [
-            {
-              indexed: true,
-              internalType: "uint96",
-              name: "_courtID",
+              name: "_parent",
               type: "uint96",
             },
             {
@@ -16509,7 +16339,7 @@ export default {
               type: "uint256[4]",
             },
           ],
-          name: "CourtModified",
+          name: "CourtCreated",
           type: "event",
         },
         {
@@ -16521,33 +16351,26 @@ export default {
               name: "_disputeID",
               type: "uint256",
             },
-            {
-              indexed: true,
-              internalType: "contract IArbitrableV2",
-              name: "_arbitrable",
-              type: "address",
-            },
-          ],
-          name: "DisputeCreation",
-          type: "event",
-        },
-        {
-          anonymous: false,
-          inputs: [
             {
               indexed: true,
               internalType: "uint256",
-              name: "_disputeKitID",
+              name: "_roundID",
               type: "uint256",
             },
             {
               indexed: true,
-              internalType: "contract IDisputeKit",
-              name: "_disputeKitAddress",
-              type: "address",
+              internalType: "uint96",
+              name: "_fromCourtID",
+              type: "uint96",
+            },
+            {
+              indexed: false,
+              internalType: "uint96",
+              name: "_toCourtID",
+              type: "uint96",
             },
           ],
-          name: "DisputeKitCreated",
+          name: "CourtJump",
           type: "event",
         },
         {
@@ -16560,61 +16383,48 @@ export default {
               type: "uint96",
             },
             {
-              indexed: true,
-              internalType: "uint256",
-              name: "_disputeKitID",
-              type: "uint256",
-            },
-            {
-              indexed: true,
+              indexed: false,
               internalType: "bool",
-              name: "_enable",
+              name: "_hiddenVotes",
               type: "bool",
             },
-          ],
-          name: "DisputeKitEnabled",
-          type: "event",
-        },
-        {
-          anonymous: false,
-          inputs: [
             {
-              indexed: true,
+              indexed: false,
               internalType: "uint256",
-              name: "_disputeID",
+              name: "_minStake",
               type: "uint256",
             },
             {
-              indexed: true,
+              indexed: false,
               internalType: "uint256",
-              name: "_roundID",
+              name: "_alpha",
               type: "uint256",
             },
             {
-              indexed: true,
+              indexed: false,
               internalType: "uint256",
-              name: "_fromDisputeKitID",
+              name: "_feeForJuror",
               type: "uint256",
             },
             {
               indexed: false,
               internalType: "uint256",
-              name: "_toDisputeKitID",
+              name: "_jurorsForCourtJump",
               type: "uint256",
             },
+            {
+              indexed: false,
+              internalType: "uint256[4]",
+              name: "_timesPerPeriod",
+              type: "uint256[4]",
+            },
           ],
-          name: "DisputeKitJump",
+          name: "CourtModified",
           type: "event",
         },
         {
           anonymous: false,
           inputs: [
-            {
-              indexed: true,
-              internalType: "address",
-              name: "_address",
-              type: "address",
-            },
             {
               indexed: true,
               internalType: "uint256",
@@ -16622,19 +16432,13 @@ export default {
               type: "uint256",
             },
             {
-              indexed: false,
-              internalType: "uint256",
-              name: "_roundID",
-              type: "uint256",
-            },
-            {
-              indexed: false,
-              internalType: "uint256",
-              name: "_voteID",
-              type: "uint256",
+              indexed: true,
+              internalType: "contract IArbitrableV2",
+              name: "_arbitrable",
+              type: "address",
             },
           ],
-          name: "Draw",
+          name: "DisputeCreation",
           type: "event",
         },
         {
@@ -16723,7 +16527,7 @@ export default {
             },
             {
               indexed: false,
-              internalType: "enum KlerosCoreBase.Period",
+              internalType: "enum KlerosCoreRuler.Period",
               name: "_period",
               type: "uint8",
             },
@@ -16733,8 +16537,68 @@ export default {
         },
         {
           anonymous: false,
-          inputs: [],
-          name: "Paused",
+          inputs: [
+            {
+              indexed: true,
+              internalType: "contract IArbitrableV2",
+              name: "_arbitrable",
+              type: "address",
+            },
+            {
+              indexed: true,
+              internalType: "address",
+              name: "_oldRuler",
+              type: "address",
+            },
+            {
+              indexed: true,
+              internalType: "address",
+              name: "_newRuler",
+              type: "address",
+            },
+          ],
+          name: "RulerChanged",
+          type: "event",
+        },
+        {
+          anonymous: false,
+          inputs: [
+            {
+              indexed: true,
+              internalType: "contract IArbitrableV2",
+              name: "_arbitrable",
+              type: "address",
+            },
+            {
+              components: [
+                {
+                  internalType: "enum KlerosCoreRuler.RulingMode",
+                  name: "rulingMode",
+                  type: "uint8",
+                },
+                {
+                  internalType: "uint256",
+                  name: "presetRuling",
+                  type: "uint256",
+                },
+                {
+                  internalType: "bool",
+                  name: "presetTied",
+                  type: "bool",
+                },
+                {
+                  internalType: "bool",
+                  name: "presetOverridden",
+                  type: "bool",
+                },
+              ],
+              indexed: false,
+              internalType: "struct KlerosCoreRuler.RulerSettings",
+              name: "_settings",
+              type: "tuple",
+            },
+          ],
+          name: "RulerSettingsChanged",
           type: "event",
         },
         {
@@ -16811,12 +16675,6 @@ export default {
           name: "TokenAndETHShift",
           type: "event",
         },
-        {
-          anonymous: false,
-          inputs: [],
-          name: "Unpaused",
-          type: "event",
-        },
         {
           anonymous: false,
           inputs: [
@@ -16830,19 +16688,6 @@ export default {
           name: "Upgraded",
           type: "event",
         },
-        {
-          inputs: [
-            {
-              internalType: "contract IDisputeKit",
-              name: "_disputeKitAddress",
-              type: "address",
-            },
-          ],
-          name: "addNewDisputeKit",
-          outputs: [],
-          stateMutability: "nonpayable",
-          type: "function",
-        },
         {
           inputs: [
             {
@@ -16857,9 +16702,14 @@ export default {
             },
             {
               internalType: "bytes",
-              name: "_extraData",
+              name: "",
               type: "bytes",
             },
+            {
+              internalType: "bool",
+              name: "_jump",
+              type: "bool",
+            },
           ],
           name: "appeal",
           outputs: [],
@@ -16873,6 +16723,11 @@ export default {
               name: "_disputeID",
               type: "uint256",
             },
+            {
+              internalType: "bool",
+              name: "_jump",
+              type: "bool",
+            },
           ],
           name: "appealCost",
           outputs: [
@@ -16888,21 +16743,21 @@ export default {
         {
           inputs: [
             {
-              internalType: "uint256",
-              name: "_disputeID",
-              type: "uint256",
+              internalType: "bytes",
+              name: "_extraData",
+              type: "bytes",
             },
-          ],
-          name: "appealPeriod",
-          outputs: [
             {
-              internalType: "uint256",
-              name: "start",
-              type: "uint256",
+              internalType: "contract IERC20",
+              name: "_feeToken",
+              type: "address",
             },
+          ],
+          name: "arbitrationCost",
+          outputs: [
             {
               internalType: "uint256",
-              name: "end",
+              name: "cost",
               type: "uint256",
             },
           ],
@@ -16912,55 +16767,12 @@ export default {
         {
           inputs: [
             {
-              internalType: "address",
-              name: "",
-              type: "address",
+              internalType: "bytes",
+              name: "_extraData",
+              type: "bytes",
             },
           ],
-          name: "arbitrableWhitelist",
-          outputs: [
-            {
-              internalType: "bool",
-              name: "",
-              type: "bool",
-            },
-          ],
-          stateMutability: "view",
-          type: "function",
-        },
-        {
-          inputs: [
-            {
-              internalType: "bytes",
-              name: "_extraData",
-              type: "bytes",
-            },
-            {
-              internalType: "contract IERC20",
-              name: "_feeToken",
-              type: "address",
-            },
-          ],
-          name: "arbitrationCost",
-          outputs: [
-            {
-              internalType: "uint256",
-              name: "cost",
-              type: "uint256",
-            },
-          ],
-          stateMutability: "view",
-          type: "function",
-        },
-        {
-          inputs: [
-            {
-              internalType: "bytes",
-              name: "_extraData",
-              type: "bytes",
-            },
-          ],
-          name: "arbitrationCost",
+          name: "arbitrationCost",
           outputs: [
             {
               internalType: "uint256",
@@ -16989,24 +16801,6 @@ export default {
           stateMutability: "nonpayable",
           type: "function",
         },
-        {
-          inputs: [
-            {
-              internalType: "address",
-              name: "_arbitrable",
-              type: "address",
-            },
-            {
-              internalType: "bool",
-              name: "_allowed",
-              type: "bool",
-            },
-          ],
-          name: "changeArbitrableWhitelist",
-          outputs: [],
-          stateMutability: "nonpayable",
-          type: "function",
-        },
         {
           inputs: [
             {
@@ -17089,12 +16883,12 @@ export default {
         {
           inputs: [
             {
-              internalType: "address",
-              name: "_guardian",
+              internalType: "contract IERC20",
+              name: "_pinakion",
               type: "address",
             },
           ],
-          name: "changeGuardian",
+          name: "changePinakion",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
@@ -17102,12 +16896,17 @@ export default {
         {
           inputs: [
             {
-              internalType: "contract IERC721",
-              name: "_jurorNft",
+              internalType: "contract IArbitrableV2",
+              name: "_arbitrable",
+              type: "address",
+            },
+            {
+              internalType: "address",
+              name: "_newRuler",
               type: "address",
             },
           ],
-          name: "changeJurorNft",
+          name: "changeRuler",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
@@ -17115,12 +16914,27 @@ export default {
         {
           inputs: [
             {
-              internalType: "address",
-              name: "_jurorProsecutionModule",
+              internalType: "contract IArbitrableV2",
+              name: "_arbitrable",
               type: "address",
             },
+            {
+              internalType: "uint256",
+              name: "_presetRuling",
+              type: "uint256",
+            },
+            {
+              internalType: "bool",
+              name: "_presetTied",
+              type: "bool",
+            },
+            {
+              internalType: "bool",
+              name: "_presetOverridden",
+              type: "bool",
+            },
           ],
-          name: "changeJurorProsecutionModule",
+          name: "changeRulingModeToAutomaticPreset",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
@@ -17128,12 +16942,12 @@ export default {
         {
           inputs: [
             {
-              internalType: "contract IERC20",
-              name: "_pinakion",
+              internalType: "contract IArbitrableV2",
+              name: "_arbitrable",
               type: "address",
             },
           ],
-          name: "changePinakion",
+          name: "changeRulingModeToAutomaticRandom",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
@@ -17141,12 +16955,12 @@ export default {
         {
           inputs: [
             {
-              internalType: "contract ISortitionModule",
-              name: "_sortitionModule",
+              internalType: "contract IArbitrableV2",
+              name: "_arbitrable",
               type: "address",
             },
           ],
-          name: "changeSortitionModule",
+          name: "changeRulingModeToManual",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
@@ -17261,16 +17075,6 @@ export default {
               name: "_timesPerPeriod",
               type: "uint256[4]",
             },
-            {
-              internalType: "bytes",
-              name: "_sortitionExtraData",
-              type: "bytes",
-            },
-            {
-              internalType: "uint256[]",
-              name: "_supportedDisputeKits",
-              type: "uint256[]",
-            },
           ],
           name: "createCourt",
           outputs: [],
@@ -17393,25 +17197,6 @@ export default {
           stateMutability: "view",
           type: "function",
         },
-        {
-          inputs: [
-            {
-              internalType: "uint256",
-              name: "",
-              type: "uint256",
-            },
-          ],
-          name: "disputeKits",
-          outputs: [
-            {
-              internalType: "contract IDisputeKit",
-              name: "",
-              type: "address",
-            },
-          ],
-          stateMutability: "view",
-          type: "function",
-        },
         {
           inputs: [
             {
@@ -17433,7 +17218,7 @@ export default {
               type: "address",
             },
             {
-              internalType: "enum KlerosCoreBase.Period",
+              internalType: "enum KlerosCoreRuler.Period",
               name: "period",
               type: "uint8",
             },
@@ -17442,62 +17227,10 @@ export default {
               name: "ruled",
               type: "bool",
             },
-            {
-              internalType: "uint256",
-              name: "lastPeriodChange",
-              type: "uint256",
-            },
           ],
           stateMutability: "view",
           type: "function",
         },
-        {
-          inputs: [
-            {
-              internalType: "uint256",
-              name: "_disputeID",
-              type: "uint256",
-            },
-            {
-              internalType: "uint256",
-              name: "_iterations",
-              type: "uint256",
-            },
-          ],
-          name: "draw",
-          outputs: [
-            {
-              internalType: "uint256",
-              name: "nbDrawnJurors",
-              type: "uint256",
-            },
-          ],
-          stateMutability: "nonpayable",
-          type: "function",
-        },
-        {
-          inputs: [
-            {
-              internalType: "uint96",
-              name: "_courtID",
-              type: "uint96",
-            },
-            {
-              internalType: "uint256[]",
-              name: "_disputeKitIDs",
-              type: "uint256[]",
-            },
-            {
-              internalType: "bool",
-              name: "_enable",
-              type: "bool",
-            },
-          ],
-          name: "enableDisputeKits",
-          outputs: [],
-          stateMutability: "nonpayable",
-          type: "function",
-        },
         {
           inputs: [
             {
@@ -17510,11 +17243,6 @@ export default {
               name: "_round",
               type: "uint256",
             },
-            {
-              internalType: "uint256",
-              name: "_iterations",
-              type: "uint256",
-            },
           ],
           name: "execute",
           outputs: [],
@@ -17551,6 +17279,21 @@ export default {
               name: "_disputeID",
               type: "uint256",
             },
+            {
+              internalType: "uint256",
+              name: "_ruling",
+              type: "uint256",
+            },
+            {
+              internalType: "bool",
+              name: "tied",
+              type: "bool",
+            },
+            {
+              internalType: "bool",
+              name: "overridden",
+              type: "bool",
+            },
           ],
           name: "executeRuling",
           outputs: [],
@@ -17559,7 +17302,7 @@ export default {
         },
         {
           inputs: [],
-          name: "getDisputeKitsLength",
+          name: "getNextDisputeID",
           outputs: [
             {
               internalType: "uint256",
@@ -17621,12 +17364,29 @@ export default {
               type: "uint256",
             },
           ],
-          name: "getPnkAtStakePerJuror",
+          name: "getRoundInfo",
           outputs: [
             {
-              internalType: "uint256",
+              components: [
+                {
+                  internalType: "uint256",
+                  name: "totalFeesForJurors",
+                  type: "uint256",
+                },
+                {
+                  internalType: "uint256",
+                  name: "sumFeeRewardPaid",
+                  type: "uint256",
+                },
+                {
+                  internalType: "contract IERC20",
+                  name: "feeToken",
+                  type: "address",
+                },
+              ],
+              internalType: "struct KlerosCoreRuler.Round",
               name: "",
-              type: "uint256",
+              type: "tuple",
             },
           ],
           stateMutability: "view",
@@ -17635,93 +17395,12 @@ export default {
         {
           inputs: [
             {
-              internalType: "uint256",
-              name: "_disputeID",
-              type: "uint256",
-            },
-            {
-              internalType: "uint256",
-              name: "_round",
-              type: "uint256",
+              internalType: "uint96",
+              name: "_courtID",
+              type: "uint96",
             },
           ],
-          name: "getRoundInfo",
-          outputs: [
-            {
-              components: [
-                {
-                  internalType: "uint256",
-                  name: "disputeKitID",
-                  type: "uint256",
-                },
-                {
-                  internalType: "uint256",
-                  name: "pnkAtStakePerJuror",
-                  type: "uint256",
-                },
-                {
-                  internalType: "uint256",
-                  name: "totalFeesForJurors",
-                  type: "uint256",
-                },
-                {
-                  internalType: "uint256",
-                  name: "nbVotes",
-                  type: "uint256",
-                },
-                {
-                  internalType: "uint256",
-                  name: "repartitions",
-                  type: "uint256",
-                },
-                {
-                  internalType: "uint256",
-                  name: "pnkPenalties",
-                  type: "uint256",
-                },
-                {
-                  internalType: "address[]",
-                  name: "drawnJurors",
-                  type: "address[]",
-                },
-                {
-                  internalType: "uint256",
-                  name: "sumFeeRewardPaid",
-                  type: "uint256",
-                },
-                {
-                  internalType: "uint256",
-                  name: "sumPnkRewardPaid",
-                  type: "uint256",
-                },
-                {
-                  internalType: "contract IERC20",
-                  name: "feeToken",
-                  type: "address",
-                },
-                {
-                  internalType: "uint256",
-                  name: "drawIterations",
-                  type: "uint256",
-                },
-              ],
-              internalType: "struct KlerosCoreBase.Round",
-              name: "",
-              type: "tuple",
-            },
-          ],
-          stateMutability: "view",
-          type: "function",
-        },
-        {
-          inputs: [
-            {
-              internalType: "uint96",
-              name: "_courtID",
-              type: "uint96",
-            },
-          ],
-          name: "getTimesPerPeriod",
+          name: "getTimesPerPeriod",
           outputs: [
             {
               internalType: "uint256[4]",
@@ -17745,19 +17424,6 @@ export default {
           stateMutability: "view",
           type: "function",
         },
-        {
-          inputs: [],
-          name: "guardian",
-          outputs: [
-            {
-              internalType: "address",
-              name: "",
-              type: "address",
-            },
-          ],
-          stateMutability: "view",
-          type: "function",
-        },
         {
           inputs: [
             {
@@ -17765,61 +17431,16 @@ export default {
               name: "_governor",
               type: "address",
             },
-            {
-              internalType: "address",
-              name: "_guardian",
-              type: "address",
-            },
             {
               internalType: "contract IERC20",
               name: "_pinakion",
               type: "address",
             },
-            {
-              internalType: "address",
-              name: "_jurorProsecutionModule",
-              type: "address",
-            },
-            {
-              internalType: "contract IDisputeKit",
-              name: "_disputeKit",
-              type: "address",
-            },
-            {
-              internalType: "bool",
-              name: "_hiddenVotes",
-              type: "bool",
-            },
             {
               internalType: "uint256[4]",
               name: "_courtParameters",
               type: "uint256[4]",
             },
-            {
-              internalType: "uint256[4]",
-              name: "_timesPerPeriod",
-              type: "uint256[4]",
-            },
-            {
-              internalType: "bytes",
-              name: "_sortitionExtraData",
-              type: "bytes",
-            },
-            {
-              internalType: "contract ISortitionModule",
-              name: "_sortitionModuleAddress",
-              type: "address",
-            },
-            {
-              internalType: "contract IERC721",
-              name: "_jurorNft",
-              type: "address",
-            },
-            {
-              internalType: "address",
-              name: "_wNative",
-              type: "address",
-            },
           ],
           name: "initialize",
           outputs: [],
@@ -17827,68 +17448,44 @@ export default {
           type: "function",
         },
         {
-          inputs: [
-            {
-              internalType: "uint256",
-              name: "_disputeID",
-              type: "uint256",
-            },
-          ],
-          name: "isDisputeKitJumping",
+          inputs: [],
+          name: "pinakion",
           outputs: [
             {
-              internalType: "bool",
+              internalType: "contract IERC20",
               name: "",
-              type: "bool",
+              type: "address",
             },
           ],
           stateMutability: "view",
           type: "function",
         },
         {
-          inputs: [
-            {
-              internalType: "uint96",
-              name: "_courtID",
-              type: "uint96",
-            },
-            {
-              internalType: "uint256",
-              name: "_disputeKitID",
-              type: "uint256",
-            },
-          ],
-          name: "isSupported",
+          inputs: [],
+          name: "proxiableUUID",
           outputs: [
             {
-              internalType: "bool",
+              internalType: "bytes32",
               name: "",
-              type: "bool",
+              type: "bytes32",
             },
           ],
           stateMutability: "view",
           type: "function",
         },
         {
-          inputs: [],
-          name: "jurorNft",
-          outputs: [
+          inputs: [
             {
-              internalType: "contract IERC721",
-              name: "",
+              internalType: "contract IArbitrableV2",
+              name: "arbitrable",
               type: "address",
             },
           ],
-          stateMutability: "view",
-          type: "function",
-        },
-        {
-          inputs: [],
-          name: "jurorProsecutionModule",
+          name: "rulers",
           outputs: [
             {
               internalType: "address",
-              name: "",
+              name: "ruler",
               type: "address",
             },
           ],
@@ -17899,56 +17496,26 @@ export default {
           inputs: [
             {
               internalType: "uint256",
-              name: "_disputeID",
+              name: "disputeID",
               type: "uint256",
             },
           ],
-          name: "passPeriod",
-          outputs: [],
-          stateMutability: "nonpayable",
-          type: "function",
-        },
-        {
-          inputs: [],
-          name: "pause",
-          outputs: [],
-          stateMutability: "nonpayable",
-          type: "function",
-        },
-        {
-          inputs: [],
-          name: "paused",
+          name: "rulingResults",
           outputs: [
             {
-              internalType: "bool",
-              name: "",
-              type: "bool",
+              internalType: "uint256",
+              name: "ruling",
+              type: "uint256",
             },
-          ],
-          stateMutability: "view",
-          type: "function",
-        },
-        {
-          inputs: [],
-          name: "pinakion",
-          outputs: [
             {
-              internalType: "contract IERC20",
-              name: "",
-              type: "address",
+              internalType: "bool",
+              name: "tied",
+              type: "bool",
             },
-          ],
-          stateMutability: "view",
-          type: "function",
-        },
-        {
-          inputs: [],
-          name: "proxiableUUID",
-          outputs: [
             {
-              internalType: "bytes32",
-              name: "",
-              type: "bytes32",
+              internalType: "bool",
+              name: "overridden",
+              type: "bool",
             },
           ],
           stateMutability: "view",
@@ -17957,93 +17524,35 @@ export default {
         {
           inputs: [
             {
-              internalType: "address",
-              name: "_wNative",
-              type: "address",
-            },
-          ],
-          name: "reinitialize",
-          outputs: [],
-          stateMutability: "nonpayable",
-          type: "function",
-        },
-        {
-          inputs: [
-            {
-              internalType: "uint96",
-              name: "_courtID",
-              type: "uint96",
-            },
-            {
-              internalType: "uint256",
-              name: "_newStake",
-              type: "uint256",
-            },
-          ],
-          name: "setStake",
-          outputs: [],
-          stateMutability: "nonpayable",
-          type: "function",
-        },
-        {
-          inputs: [
-            {
-              internalType: "address",
-              name: "_account",
+              internalType: "contract IArbitrableV2",
+              name: "arbitrable",
               type: "address",
             },
-            {
-              internalType: "uint96",
-              name: "_courtID",
-              type: "uint96",
-            },
-            {
-              internalType: "uint256",
-              name: "_newStake",
-              type: "uint256",
-            },
           ],
-          name: "setStakeBySortitionModule",
-          outputs: [],
-          stateMutability: "nonpayable",
-          type: "function",
-        },
-        {
-          inputs: [],
-          name: "sortitionModule",
+          name: "settings",
           outputs: [
             {
-              internalType: "contract ISortitionModule",
-              name: "",
-              type: "address",
-            },
-          ],
-          stateMutability: "view",
-          type: "function",
-        },
-        {
-          inputs: [
-            {
-              internalType: "address",
-              name: "_account",
-              type: "address",
+              internalType: "enum KlerosCoreRuler.RulingMode",
+              name: "rulingMode",
+              type: "uint8",
             },
             {
               internalType: "uint256",
-              name: "_amount",
+              name: "presetRuling",
               type: "uint256",
             },
-          ],
-          name: "transferBySortitionModule",
-          outputs: [],
-          stateMutability: "nonpayable",
-          type: "function",
-        },
-        {
-          inputs: [],
-          name: "unpause",
-          outputs: [],
-          stateMutability: "nonpayable",
+            {
+              internalType: "bool",
+              name: "presetTied",
+              type: "bool",
+            },
+            {
+              internalType: "bool",
+              name: "presetOverridden",
+              type: "bool",
+            },
+          ],
+          stateMutability: "view",
           type: "function",
         },
         {
@@ -18064,37 +17573,6 @@ export default {
           stateMutability: "payable",
           type: "function",
         },
-        {
-          inputs: [],
-          name: "version",
-          outputs: [
-            {
-              internalType: "string",
-              name: "",
-              type: "string",
-            },
-          ],
-          stateMutability: "view",
-          type: "function",
-        },
-        {
-          inputs: [],
-          name: "wNative",
-          outputs: [
-            {
-              internalType: "address",
-              name: "",
-              type: "address",
-            },
-          ],
-          stateMutability: "view",
-          type: "function",
-        },
-      ],
-    },
-    KlerosCoreNeo_Proxy: {
-      address: "0x991d2df165670b9cac3B022f4B68D65b664222ea",
-      abi: [
         {
           inputs: [
             {
@@ -18111,26 +17589,15 @@ export default {
           stateMutability: "nonpayable",
           type: "constructor",
         },
-        {
-          stateMutability: "payable",
-          type: "fallback",
-        },
-        {
-          stateMutability: "payable",
-          type: "receive",
-        },
       ],
     },
-    KlerosCoreRulerNeo: {
-      address: "0xc0169e0B19aE02ac4fADD689260CF038726DFE13",
+    KlerosCoreRuler_Implementation: {
+      address: "0x85093b5EDa4F2e2E2fEDae34Da91239D6a08e324",
       abi: [
         {
-          stateMutability: "payable",
-          type: "fallback",
-        },
-        {
-          stateMutability: "payable",
-          type: "receive",
+          inputs: [],
+          stateMutability: "nonpayable",
+          type: "constructor",
         },
         {
           inputs: [],
@@ -19625,50 +19092,239 @@ export default {
           stateMutability: "payable",
           type: "function",
         },
+      ],
+    },
+    KlerosCoreRuler_Proxy: {
+      address: "0xc0169e0B19aE02ac4fADD689260CF038726DFE13",
+      abi: [
+        {
+          inputs: [
+            {
+              internalType: "address",
+              name: "_implementation",
+              type: "address",
+            },
+            {
+              internalType: "bytes",
+              name: "_data",
+              type: "bytes",
+            },
+          ],
+          stateMutability: "nonpayable",
+          type: "constructor",
+        },
+        {
+          stateMutability: "payable",
+          type: "fallback",
+        },
+        {
+          stateMutability: "payable",
+          type: "receive",
+        },
+      ],
+    },
+    KlerosCoreSnapshotProxy: {
+      address: "0xEF719a5B3352F607e6C4E17b7e0cDAd8322fEC95",
+      abi: [
+        {
+          inputs: [
+            {
+              internalType: "address",
+              name: "_governor",
+              type: "address",
+            },
+            {
+              internalType: "contract IKlerosCore",
+              name: "_core",
+              type: "address",
+            },
+          ],
+          stateMutability: "nonpayable",
+          type: "constructor",
+        },
+        {
+          inputs: [
+            {
+              internalType: "address",
+              name: "_account",
+              type: "address",
+            },
+          ],
+          name: "balanceOf",
+          outputs: [
+            {
+              internalType: "uint256",
+              name: "totalStaked",
+              type: "uint256",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [
+            {
+              internalType: "contract IKlerosCore",
+              name: "_core",
+              type: "address",
+            },
+          ],
+          name: "changeCore",
+          outputs: [],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
+        {
+          inputs: [
+            {
+              internalType: "address",
+              name: "_governor",
+              type: "address",
+            },
+          ],
+          name: "changeGovernor",
+          outputs: [],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
+        {
+          inputs: [],
+          name: "core",
+          outputs: [
+            {
+              internalType: "contract IKlerosCore",
+              name: "",
+              type: "address",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [],
+          name: "decimals",
+          outputs: [
+            {
+              internalType: "uint8",
+              name: "",
+              type: "uint8",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [],
+          name: "governor",
+          outputs: [
+            {
+              internalType: "address",
+              name: "",
+              type: "address",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [],
+          name: "name",
+          outputs: [
+            {
+              internalType: "string",
+              name: "",
+              type: "string",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [],
+          name: "symbol",
+          outputs: [
+            {
+              internalType: "string",
+              name: "",
+              type: "string",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+      ],
+    },
+    KlerosCore_Implementation: {
+      address: "0xC1210493804eEF123096F9581Ee82B915150E54c",
+      abi: [
+        {
+          inputs: [],
+          stateMutability: "nonpayable",
+          type: "constructor",
+        },
+        {
+          inputs: [],
+          name: "AlreadyInitialized",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "AppealFeesNotEnough",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "AppealPeriodNotPassed",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "ArbitrableNotWhitelisted",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "ArbitrationFeesNotEnough",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "CannotDisableClassicDK",
+          type: "error",
+        },
         {
-          inputs: [
-            {
-              internalType: "address",
-              name: "_implementation",
-              type: "address",
-            },
-            {
-              internalType: "bytes",
-              name: "_data",
-              type: "bytes",
-            },
-          ],
-          stateMutability: "nonpayable",
-          type: "constructor",
+          inputs: [],
+          name: "CommitPeriodNotPassed",
+          type: "error",
         },
-      ],
-    },
-    KlerosCoreRulerNeo_Implementation: {
-      address: "0x85093b5EDa4F2e2E2fEDae34Da91239D6a08e324",
-      abi: [
         {
           inputs: [],
-          stateMutability: "nonpayable",
-          type: "constructor",
+          name: "DisputeKitNotSupportedByCourt",
+          type: "error",
         },
         {
           inputs: [],
-          name: "AlreadyInitialized",
+          name: "DisputeKitOnly",
           type: "error",
         },
         {
           inputs: [],
-          name: "AppealFeesNotEnough",
+          name: "DisputeNotAppealable",
           type: "error",
         },
         {
           inputs: [],
-          name: "ArbitrationFeesNotEnough",
+          name: "DisputePeriodIsFinal",
           type: "error",
         },
         {
           inputs: [],
-          name: "DisputeNotAppealable",
+          name: "DisputeStillDrawing",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "EvidenceNotPassedAndNotAppeal",
           type: "error",
         },
         {
@@ -19683,7 +19339,12 @@ export default {
         },
         {
           inputs: [],
-          name: "GovernorOrInstructorOnly",
+          name: "GuardianOrGovernorOnly",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "InvalidDisputKitParent",
           type: "error",
         },
         {
@@ -19704,17 +19365,32 @@ export default {
         },
         {
           inputs: [],
-          name: "NoRulerSet",
+          name: "MinStakeLowerThanParentCourt",
           type: "error",
         },
         {
           inputs: [],
-          name: "NotInitializing",
+          name: "MustSupportDisputeKitClassic",
           type: "error",
         },
         {
           inputs: [],
-          name: "RulerOnly",
+          name: "NotEligibleForStaking",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "NotEvidencePeriod",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "NotExecutionPeriod",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "NotInitializing",
           type: "error",
         },
         {
@@ -19724,7 +19400,42 @@ export default {
         },
         {
           inputs: [],
-          name: "RulingModeNotSet",
+          name: "SortitionModuleOnly",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "StakingInTooManyCourts",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "StakingLessThanCourtMinStake",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "StakingMoreThanMaxStakePerJuror",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "StakingMoreThanMaxTotalStaked",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "StakingNotPossibleInThisCourt",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "StakingTransferFailed",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "StakingZeroWhenNoStake",
           type: "error",
         },
         {
@@ -19753,11 +19464,41 @@ export default {
           name: "UUPSUnsupportedProxiableUUID",
           type: "error",
         },
+        {
+          inputs: [],
+          name: "UnstakingTransferFailed",
+          type: "error",
+        },
         {
           inputs: [],
           name: "UnsuccessfulCall",
           type: "error",
         },
+        {
+          inputs: [],
+          name: "UnsupportedDisputeKit",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "VotePeriodNotPassed",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "WhenNotPausedOnly",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "WhenPausedOnly",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "WrongDisputeKitIndex",
+          type: "error",
+        },
         {
           anonymous: false,
           inputs: [
@@ -19820,42 +19561,60 @@ export default {
           inputs: [
             {
               indexed: true,
-              internalType: "contract IArbitrableV2",
-              name: "_arbitrable",
-              type: "address",
+              internalType: "uint96",
+              name: "_courtID",
+              type: "uint96",
             },
             {
               indexed: true,
-              internalType: "enum KlerosCoreRuler.RulingMode",
-              name: "mode",
-              type: "uint8",
+              internalType: "uint96",
+              name: "_parent",
+              type: "uint96",
             },
             {
-              indexed: true,
+              indexed: false,
+              internalType: "bool",
+              name: "_hiddenVotes",
+              type: "bool",
+            },
+            {
+              indexed: false,
               internalType: "uint256",
-              name: "_disputeID",
+              name: "_minStake",
               type: "uint256",
             },
             {
               indexed: false,
               internalType: "uint256",
-              name: "_ruling",
+              name: "_alpha",
               type: "uint256",
             },
             {
               indexed: false,
-              internalType: "bool",
-              name: "tied",
-              type: "bool",
+              internalType: "uint256",
+              name: "_feeForJuror",
+              type: "uint256",
             },
             {
               indexed: false,
-              internalType: "bool",
-              name: "overridden",
-              type: "bool",
+              internalType: "uint256",
+              name: "_jurorsForCourtJump",
+              type: "uint256",
+            },
+            {
+              indexed: false,
+              internalType: "uint256[4]",
+              name: "_timesPerPeriod",
+              type: "uint256[4]",
+            },
+            {
+              indexed: false,
+              internalType: "uint256[]",
+              name: "_supportedDisputeKits",
+              type: "uint256[]",
             },
           ],
-          name: "AutoRuled",
+          name: "CourtCreated",
           type: "event",
         },
         {
@@ -19864,13 +19623,38 @@ export default {
             {
               indexed: true,
               internalType: "uint256",
-              name: "_courtID",
+              name: "_disputeID",
+              type: "uint256",
+            },
+            {
+              indexed: true,
+              internalType: "uint256",
+              name: "_roundID",
               type: "uint256",
             },
             {
               indexed: true,
               internalType: "uint96",
-              name: "_parent",
+              name: "_fromCourtID",
+              type: "uint96",
+            },
+            {
+              indexed: false,
+              internalType: "uint96",
+              name: "_toCourtID",
+              type: "uint96",
+            },
+          ],
+          name: "CourtJump",
+          type: "event",
+        },
+        {
+          anonymous: false,
+          inputs: [
+            {
+              indexed: true,
+              internalType: "uint96",
+              name: "_courtID",
               type: "uint96",
             },
             {
@@ -19910,7 +19694,7 @@ export default {
               type: "uint256[4]",
             },
           ],
-          name: "CourtCreated",
+          name: "CourtModified",
           type: "event",
         },
         {
@@ -19924,24 +19708,31 @@ export default {
             },
             {
               indexed: true,
-              internalType: "uint256",
-              name: "_roundID",
-              type: "uint256",
+              internalType: "contract IArbitrableV2",
+              name: "_arbitrable",
+              type: "address",
             },
+          ],
+          name: "DisputeCreation",
+          type: "event",
+        },
+        {
+          anonymous: false,
+          inputs: [
             {
               indexed: true,
-              internalType: "uint96",
-              name: "_fromCourtID",
-              type: "uint96",
+              internalType: "uint256",
+              name: "_disputeKitID",
+              type: "uint256",
             },
             {
-              indexed: false,
-              internalType: "uint96",
-              name: "_toCourtID",
-              type: "uint96",
+              indexed: true,
+              internalType: "contract IDisputeKit",
+              name: "_disputeKitAddress",
+              type: "address",
             },
           ],
-          name: "CourtJump",
+          name: "DisputeKitCreated",
           type: "event",
         },
         {
@@ -19954,48 +19745,61 @@ export default {
               type: "uint96",
             },
             {
-              indexed: false,
+              indexed: true,
+              internalType: "uint256",
+              name: "_disputeKitID",
+              type: "uint256",
+            },
+            {
+              indexed: true,
               internalType: "bool",
-              name: "_hiddenVotes",
+              name: "_enable",
               type: "bool",
             },
+          ],
+          name: "DisputeKitEnabled",
+          type: "event",
+        },
+        {
+          anonymous: false,
+          inputs: [
             {
-              indexed: false,
+              indexed: true,
               internalType: "uint256",
-              name: "_minStake",
+              name: "_disputeID",
               type: "uint256",
             },
             {
-              indexed: false,
+              indexed: true,
               internalType: "uint256",
-              name: "_alpha",
+              name: "_roundID",
               type: "uint256",
             },
             {
-              indexed: false,
+              indexed: true,
               internalType: "uint256",
-              name: "_feeForJuror",
+              name: "_fromDisputeKitID",
               type: "uint256",
             },
             {
               indexed: false,
               internalType: "uint256",
-              name: "_jurorsForCourtJump",
+              name: "_toDisputeKitID",
               type: "uint256",
             },
-            {
-              indexed: false,
-              internalType: "uint256[4]",
-              name: "_timesPerPeriod",
-              type: "uint256[4]",
-            },
           ],
-          name: "CourtModified",
+          name: "DisputeKitJump",
           type: "event",
         },
         {
           anonymous: false,
           inputs: [
+            {
+              indexed: true,
+              internalType: "address",
+              name: "_address",
+              type: "address",
+            },
             {
               indexed: true,
               internalType: "uint256",
@@ -20003,13 +19807,19 @@ export default {
               type: "uint256",
             },
             {
-              indexed: true,
-              internalType: "contract IArbitrableV2",
-              name: "_arbitrable",
-              type: "address",
+              indexed: false,
+              internalType: "uint256",
+              name: "_roundID",
+              type: "uint256",
+            },
+            {
+              indexed: false,
+              internalType: "uint256",
+              name: "_voteID",
+              type: "uint256",
             },
           ],
-          name: "DisputeCreation",
+          name: "Draw",
           type: "event",
         },
         {
@@ -20098,7 +19908,7 @@ export default {
             },
             {
               indexed: false,
-              internalType: "enum KlerosCoreRuler.Period",
+              internalType: "enum KlerosCoreBase.Period",
               name: "_period",
               type: "uint8",
             },
@@ -20108,68 +19918,8 @@ export default {
         },
         {
           anonymous: false,
-          inputs: [
-            {
-              indexed: true,
-              internalType: "contract IArbitrableV2",
-              name: "_arbitrable",
-              type: "address",
-            },
-            {
-              indexed: true,
-              internalType: "address",
-              name: "_oldRuler",
-              type: "address",
-            },
-            {
-              indexed: true,
-              internalType: "address",
-              name: "_newRuler",
-              type: "address",
-            },
-          ],
-          name: "RulerChanged",
-          type: "event",
-        },
-        {
-          anonymous: false,
-          inputs: [
-            {
-              indexed: true,
-              internalType: "contract IArbitrableV2",
-              name: "_arbitrable",
-              type: "address",
-            },
-            {
-              components: [
-                {
-                  internalType: "enum KlerosCoreRuler.RulingMode",
-                  name: "rulingMode",
-                  type: "uint8",
-                },
-                {
-                  internalType: "uint256",
-                  name: "presetRuling",
-                  type: "uint256",
-                },
-                {
-                  internalType: "bool",
-                  name: "presetTied",
-                  type: "bool",
-                },
-                {
-                  internalType: "bool",
-                  name: "presetOverridden",
-                  type: "bool",
-                },
-              ],
-              indexed: false,
-              internalType: "struct KlerosCoreRuler.RulerSettings",
-              name: "_settings",
-              type: "tuple",
-            },
-          ],
-          name: "RulerSettingsChanged",
+          inputs: [],
+          name: "Paused",
           type: "event",
         },
         {
@@ -20246,6 +19996,12 @@ export default {
           name: "TokenAndETHShift",
           type: "event",
         },
+        {
+          anonymous: false,
+          inputs: [],
+          name: "Unpaused",
+          type: "event",
+        },
         {
           anonymous: false,
           inputs: [
@@ -20259,6 +20015,19 @@ export default {
           name: "Upgraded",
           type: "event",
         },
+        {
+          inputs: [
+            {
+              internalType: "contract IDisputeKit",
+              name: "_disputeKitAddress",
+              type: "address",
+            },
+          ],
+          name: "addNewDisputeKit",
+          outputs: [],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -20273,14 +20042,9 @@ export default {
             },
             {
               internalType: "bytes",
-              name: "",
+              name: "_extraData",
               type: "bytes",
             },
-            {
-              internalType: "bool",
-              name: "_jump",
-              type: "bool",
-            },
           ],
           name: "appeal",
           outputs: [],
@@ -20294,11 +20058,6 @@ export default {
               name: "_disputeID",
               type: "uint256",
             },
-            {
-              internalType: "bool",
-              name: "_jump",
-              type: "bool",
-            },
           ],
           name: "appealCost",
           outputs: [
@@ -20311,6 +20070,49 @@ export default {
           stateMutability: "view",
           type: "function",
         },
+        {
+          inputs: [
+            {
+              internalType: "uint256",
+              name: "_disputeID",
+              type: "uint256",
+            },
+          ],
+          name: "appealPeriod",
+          outputs: [
+            {
+              internalType: "uint256",
+              name: "start",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "end",
+              type: "uint256",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [
+            {
+              internalType: "address",
+              name: "",
+              type: "address",
+            },
+          ],
+          name: "arbitrableWhitelist",
+          outputs: [
+            {
+              internalType: "bool",
+              name: "",
+              type: "bool",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -20372,6 +20174,24 @@ export default {
           stateMutability: "nonpayable",
           type: "function",
         },
+        {
+          inputs: [
+            {
+              internalType: "address",
+              name: "_arbitrable",
+              type: "address",
+            },
+            {
+              internalType: "bool",
+              name: "_allowed",
+              type: "bool",
+            },
+          ],
+          name: "changeArbitrableWhitelist",
+          outputs: [],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -20454,12 +20274,12 @@ export default {
         {
           inputs: [
             {
-              internalType: "contract IERC20",
-              name: "_pinakion",
+              internalType: "address",
+              name: "_guardian",
               type: "address",
             },
           ],
-          name: "changePinakion",
+          name: "changeGuardian",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
@@ -20467,17 +20287,12 @@ export default {
         {
           inputs: [
             {
-              internalType: "contract IArbitrableV2",
-              name: "_arbitrable",
-              type: "address",
-            },
-            {
-              internalType: "address",
-              name: "_newRuler",
+              internalType: "contract IERC721",
+              name: "_jurorNft",
               type: "address",
             },
           ],
-          name: "changeRuler",
+          name: "changeJurorNft",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
@@ -20485,27 +20300,12 @@ export default {
         {
           inputs: [
             {
-              internalType: "contract IArbitrableV2",
-              name: "_arbitrable",
+              internalType: "address",
+              name: "_jurorProsecutionModule",
               type: "address",
             },
-            {
-              internalType: "uint256",
-              name: "_presetRuling",
-              type: "uint256",
-            },
-            {
-              internalType: "bool",
-              name: "_presetTied",
-              type: "bool",
-            },
-            {
-              internalType: "bool",
-              name: "_presetOverridden",
-              type: "bool",
-            },
           ],
-          name: "changeRulingModeToAutomaticPreset",
+          name: "changeJurorProsecutionModule",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
@@ -20513,12 +20313,12 @@ export default {
         {
           inputs: [
             {
-              internalType: "contract IArbitrableV2",
-              name: "_arbitrable",
+              internalType: "contract IERC20",
+              name: "_pinakion",
               type: "address",
             },
           ],
-          name: "changeRulingModeToAutomaticRandom",
+          name: "changePinakion",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
@@ -20526,12 +20326,12 @@ export default {
         {
           inputs: [
             {
-              internalType: "contract IArbitrableV2",
-              name: "_arbitrable",
+              internalType: "contract ISortitionModule",
+              name: "_sortitionModule",
               type: "address",
             },
           ],
-          name: "changeRulingModeToManual",
+          name: "changeSortitionModule",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
@@ -20646,6 +20446,16 @@ export default {
               name: "_timesPerPeriod",
               type: "uint256[4]",
             },
+            {
+              internalType: "bytes",
+              name: "_sortitionExtraData",
+              type: "bytes",
+            },
+            {
+              internalType: "uint256[]",
+              name: "_supportedDisputeKits",
+              type: "uint256[]",
+            },
           ],
           name: "createCourt",
           outputs: [],
@@ -20768,6 +20578,25 @@ export default {
           stateMutability: "view",
           type: "function",
         },
+        {
+          inputs: [
+            {
+              internalType: "uint256",
+              name: "",
+              type: "uint256",
+            },
+          ],
+          name: "disputeKits",
+          outputs: [
+            {
+              internalType: "contract IDisputeKit",
+              name: "",
+              type: "address",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -20789,7 +20618,7 @@ export default {
               type: "address",
             },
             {
-              internalType: "enum KlerosCoreRuler.Period",
+              internalType: "enum KlerosCoreBase.Period",
               name: "period",
               type: "uint8",
             },
@@ -20798,10 +20627,62 @@ export default {
               name: "ruled",
               type: "bool",
             },
+            {
+              internalType: "uint256",
+              name: "lastPeriodChange",
+              type: "uint256",
+            },
           ],
           stateMutability: "view",
           type: "function",
         },
+        {
+          inputs: [
+            {
+              internalType: "uint256",
+              name: "_disputeID",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "_iterations",
+              type: "uint256",
+            },
+          ],
+          name: "draw",
+          outputs: [
+            {
+              internalType: "uint256",
+              name: "nbDrawnJurors",
+              type: "uint256",
+            },
+          ],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
+        {
+          inputs: [
+            {
+              internalType: "uint96",
+              name: "_courtID",
+              type: "uint96",
+            },
+            {
+              internalType: "uint256[]",
+              name: "_disputeKitIDs",
+              type: "uint256[]",
+            },
+            {
+              internalType: "bool",
+              name: "_enable",
+              type: "bool",
+            },
+          ],
+          name: "enableDisputeKits",
+          outputs: [],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -20814,6 +20695,11 @@ export default {
               name: "_round",
               type: "uint256",
             },
+            {
+              internalType: "uint256",
+              name: "_iterations",
+              type: "uint256",
+            },
           ],
           name: "execute",
           outputs: [],
@@ -20850,21 +20736,6 @@ export default {
               name: "_disputeID",
               type: "uint256",
             },
-            {
-              internalType: "uint256",
-              name: "_ruling",
-              type: "uint256",
-            },
-            {
-              internalType: "bool",
-              name: "tied",
-              type: "bool",
-            },
-            {
-              internalType: "bool",
-              name: "overridden",
-              type: "bool",
-            },
           ],
           name: "executeRuling",
           outputs: [],
@@ -20873,7 +20744,7 @@ export default {
         },
         {
           inputs: [],
-          name: "getNextDisputeID",
+          name: "getDisputeKitsLength",
           outputs: [
             {
               internalType: "uint256",
@@ -20922,6 +20793,30 @@ export default {
           stateMutability: "view",
           type: "function",
         },
+        {
+          inputs: [
+            {
+              internalType: "uint256",
+              name: "_disputeID",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "_round",
+              type: "uint256",
+            },
+          ],
+          name: "getPnkAtStakePerJuror",
+          outputs: [
+            {
+              internalType: "uint256",
+              name: "",
+              type: "uint256",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -20939,23 +20834,63 @@ export default {
           outputs: [
             {
               components: [
+                {
+                  internalType: "uint256",
+                  name: "disputeKitID",
+                  type: "uint256",
+                },
+                {
+                  internalType: "uint256",
+                  name: "pnkAtStakePerJuror",
+                  type: "uint256",
+                },
                 {
                   internalType: "uint256",
                   name: "totalFeesForJurors",
                   type: "uint256",
                 },
+                {
+                  internalType: "uint256",
+                  name: "nbVotes",
+                  type: "uint256",
+                },
+                {
+                  internalType: "uint256",
+                  name: "repartitions",
+                  type: "uint256",
+                },
+                {
+                  internalType: "uint256",
+                  name: "pnkPenalties",
+                  type: "uint256",
+                },
+                {
+                  internalType: "address[]",
+                  name: "drawnJurors",
+                  type: "address[]",
+                },
                 {
                   internalType: "uint256",
                   name: "sumFeeRewardPaid",
                   type: "uint256",
                 },
+                {
+                  internalType: "uint256",
+                  name: "sumPnkRewardPaid",
+                  type: "uint256",
+                },
                 {
                   internalType: "contract IERC20",
                   name: "feeToken",
                   type: "address",
                 },
+                {
+                  internalType: "uint256",
+                  name: "drawIterations",
+                  type: "uint256",
+                },
               ],
-              internalType: "struct KlerosCoreRuler.Round",
+              internalType: "struct KlerosCoreBase.Round",
               name: "",
               type: "tuple",
             },
@@ -20995,6 +20930,19 @@ export default {
           stateMutability: "view",
           type: "function",
         },
+        {
+          inputs: [],
+          name: "guardian",
+          outputs: [
+            {
+              internalType: "address",
+              name: "",
+              type: "address",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -21002,16 +20950,61 @@ export default {
               name: "_governor",
               type: "address",
             },
+            {
+              internalType: "address",
+              name: "_guardian",
+              type: "address",
+            },
             {
               internalType: "contract IERC20",
               name: "_pinakion",
               type: "address",
             },
+            {
+              internalType: "address",
+              name: "_jurorProsecutionModule",
+              type: "address",
+            },
+            {
+              internalType: "contract IDisputeKit",
+              name: "_disputeKit",
+              type: "address",
+            },
+            {
+              internalType: "bool",
+              name: "_hiddenVotes",
+              type: "bool",
+            },
             {
               internalType: "uint256[4]",
               name: "_courtParameters",
               type: "uint256[4]",
             },
+            {
+              internalType: "uint256[4]",
+              name: "_timesPerPeriod",
+              type: "uint256[4]",
+            },
+            {
+              internalType: "bytes",
+              name: "_sortitionExtraData",
+              type: "bytes",
+            },
+            {
+              internalType: "contract ISortitionModule",
+              name: "_sortitionModuleAddress",
+              type: "address",
+            },
+            {
+              internalType: "contract IERC721",
+              name: "_jurorNft",
+              type: "address",
+            },
+            {
+              internalType: "address",
+              name: "_wNative",
+              type: "address",
+            },
           ],
           name: "initialize",
           outputs: [],
@@ -21019,13 +21012,43 @@ export default {
           type: "function",
         },
         {
-          inputs: [],
-          name: "pinakion",
+          inputs: [
+            {
+              internalType: "uint256",
+              name: "_disputeID",
+              type: "uint256",
+            },
+          ],
+          name: "isDisputeKitJumping",
+          outputs: [
+            {
+              internalType: "bool",
+              name: "",
+              type: "bool",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [
+            {
+              internalType: "uint96",
+              name: "_courtID",
+              type: "uint96",
+            },
+            {
+              internalType: "uint256",
+              name: "_disputeKitID",
+              type: "uint256",
+            },
+          ],
+          name: "isSupported",
           outputs: [
             {
-              internalType: "contract IERC20",
+              internalType: "bool",
               name: "",
-              type: "address",
+              type: "bool",
             },
           ],
           stateMutability: "view",
@@ -21033,30 +21056,24 @@ export default {
         },
         {
           inputs: [],
-          name: "proxiableUUID",
+          name: "jurorNft",
           outputs: [
             {
-              internalType: "bytes32",
+              internalType: "contract IERC721",
               name: "",
-              type: "bytes32",
+              type: "address",
             },
           ],
           stateMutability: "view",
           type: "function",
         },
         {
-          inputs: [
-            {
-              internalType: "contract IArbitrableV2",
-              name: "arbitrable",
-              type: "address",
-            },
-          ],
-          name: "rulers",
+          inputs: [],
+          name: "jurorProsecutionModule",
           outputs: [
             {
               internalType: "address",
-              name: "ruler",
+              name: "",
               type: "address",
             },
           ],
@@ -21067,25 +21084,29 @@ export default {
           inputs: [
             {
               internalType: "uint256",
-              name: "disputeID",
+              name: "_disputeID",
               type: "uint256",
             },
           ],
-          name: "rulingResults",
+          name: "passPeriod",
+          outputs: [],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
+        {
+          inputs: [],
+          name: "pause",
+          outputs: [],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
+        {
+          inputs: [],
+          name: "paused",
           outputs: [
-            {
-              internalType: "uint256",
-              name: "ruling",
-              type: "uint256",
-            },
-            {
-              internalType: "bool",
-              name: "tied",
-              type: "bool",
-            },
             {
               internalType: "bool",
-              name: "overridden",
+              name: "",
               type: "bool",
             },
           ],
@@ -21093,34 +21114,26 @@ export default {
           type: "function",
         },
         {
-          inputs: [
+          inputs: [],
+          name: "pinakion",
+          outputs: [
             {
-              internalType: "contract IArbitrableV2",
-              name: "arbitrable",
+              internalType: "contract IERC20",
+              name: "",
               type: "address",
             },
           ],
-          name: "settings",
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [],
+          name: "proxiableUUID",
           outputs: [
             {
-              internalType: "enum KlerosCoreRuler.RulingMode",
-              name: "rulingMode",
-              type: "uint8",
-            },
-            {
-              internalType: "uint256",
-              name: "presetRuling",
-              type: "uint256",
-            },
-            {
-              internalType: "bool",
-              name: "presetTied",
-              type: "bool",
-            },
-            {
-              internalType: "bool",
-              name: "presetOverridden",
-              type: "bool",
+              internalType: "bytes32",
+              name: "",
+              type: "bytes32",
             },
           ],
           stateMutability: "view",
@@ -21130,69 +21143,68 @@ export default {
           inputs: [
             {
               internalType: "address",
-              name: "newImplementation",
+              name: "_wNative",
               type: "address",
             },
-            {
-              internalType: "bytes",
-              name: "data",
-              type: "bytes",
-            },
           ],
-          name: "upgradeToAndCall",
+          name: "reinitialize",
           outputs: [],
-          stateMutability: "payable",
+          stateMutability: "nonpayable",
           type: "function",
         },
-      ],
-    },
-    KlerosCoreRulerNeo_Proxy: {
-      address: "0xc0169e0B19aE02ac4fADD689260CF038726DFE13",
-      abi: [
         {
           inputs: [
             {
-              internalType: "address",
-              name: "_implementation",
-              type: "address",
+              internalType: "uint96",
+              name: "_courtID",
+              type: "uint96",
             },
             {
-              internalType: "bytes",
-              name: "_data",
-              type: "bytes",
+              internalType: "uint256",
+              name: "_newStake",
+              type: "uint256",
             },
           ],
+          name: "setStake",
+          outputs: [],
           stateMutability: "nonpayable",
-          type: "constructor",
-        },
-        {
-          stateMutability: "payable",
-          type: "fallback",
-        },
-        {
-          stateMutability: "payable",
-          type: "receive",
+          type: "function",
         },
-      ],
-    },
-    KlerosCoreSnapshotProxy: {
-      address: "0xEF719a5B3352F607e6C4E17b7e0cDAd8322fEC95",
-      abi: [
         {
           inputs: [
             {
               internalType: "address",
-              name: "_governor",
+              name: "_account",
               type: "address",
             },
             {
-              internalType: "contract IKlerosCore",
-              name: "_core",
-              type: "address",
+              internalType: "uint96",
+              name: "_courtID",
+              type: "uint96",
+            },
+            {
+              internalType: "uint256",
+              name: "_newStake",
+              type: "uint256",
             },
           ],
+          name: "setStakeBySortitionModule",
+          outputs: [],
           stateMutability: "nonpayable",
-          type: "constructor",
+          type: "function",
+        },
+        {
+          inputs: [],
+          name: "sortitionModule",
+          outputs: [
+            {
+              internalType: "contract ISortitionModule",
+              name: "",
+              type: "address",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
         },
         {
           inputs: [
@@ -21201,27 +21213,20 @@ export default {
               name: "_account",
               type: "address",
             },
-          ],
-          name: "balanceOf",
-          outputs: [
             {
               internalType: "uint256",
-              name: "totalStaked",
+              name: "_amount",
               type: "uint256",
             },
           ],
-          stateMutability: "view",
+          name: "transferBySortitionModule",
+          outputs: [],
+          stateMutability: "nonpayable",
           type: "function",
         },
         {
-          inputs: [
-            {
-              internalType: "contract IKlerosCore",
-              name: "_core",
-              type: "address",
-            },
-          ],
-          name: "changeCore",
+          inputs: [],
+          name: "unpause",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
@@ -21230,23 +21235,28 @@ export default {
           inputs: [
             {
               internalType: "address",
-              name: "_governor",
+              name: "newImplementation",
               type: "address",
             },
+            {
+              internalType: "bytes",
+              name: "data",
+              type: "bytes",
+            },
           ],
-          name: "changeGovernor",
+          name: "upgradeToAndCall",
           outputs: [],
-          stateMutability: "nonpayable",
+          stateMutability: "payable",
           type: "function",
         },
         {
           inputs: [],
-          name: "core",
+          name: "version",
           outputs: [
             {
-              internalType: "contract IKlerosCore",
+              internalType: "string",
               name: "",
-              type: "address",
+              type: "string",
             },
           ],
           stateMutability: "view",
@@ -21254,55 +21264,45 @@ export default {
         },
         {
           inputs: [],
-          name: "decimals",
+          name: "wNative",
           outputs: [
             {
-              internalType: "uint8",
+              internalType: "address",
               name: "",
-              type: "uint8",
+              type: "address",
             },
           ],
           stateMutability: "view",
           type: "function",
         },
+      ],
+    },
+    KlerosCore_Proxy: {
+      address: "0x991d2df165670b9cac3B022f4B68D65b664222ea",
+      abi: [
         {
-          inputs: [],
-          name: "governor",
-          outputs: [
+          inputs: [
             {
               internalType: "address",
-              name: "",
+              name: "_implementation",
               type: "address",
             },
-          ],
-          stateMutability: "view",
-          type: "function",
-        },
-        {
-          inputs: [],
-          name: "name",
-          outputs: [
             {
-              internalType: "string",
-              name: "",
-              type: "string",
+              internalType: "bytes",
+              name: "_data",
+              type: "bytes",
             },
           ],
-          stateMutability: "view",
-          type: "function",
+          stateMutability: "nonpayable",
+          type: "constructor",
         },
         {
-          inputs: [],
-          name: "symbol",
-          outputs: [
-            {
-              internalType: "string",
-              name: "",
-              type: "string",
-            },
-          ],
-          stateMutability: "view",
-          type: "function",
+          stateMutability: "payable",
+          type: "fallback",
+        },
+        {
+          stateMutability: "payable",
+          type: "receive",
         },
       ],
     },
@@ -23898,7 +23898,7 @@ export default {
         },
       ],
     },
-    SortitionModuleNeo: {
+    SortitionModule: {
       address: "0x21A9402aDb818744B296e1d1BE58C804118DC03D",
       abi: [
         {
@@ -25022,7 +25022,7 @@ export default {
         },
       ],
     },
-    SortitionModuleNeo_Implementation: {
+    SortitionModule_Implementation: {
       address: "0x3f6D0daeD166b64FCfBb9bc7c9E26423c6C08eEE",
       abi: [
         {
@@ -26127,7 +26127,7 @@ export default {
         },
       ],
     },
-    SortitionModuleNeo_Proxy: {
+    SortitionModule_Proxy: {
       address: "0x21A9402aDb818744B296e1d1BE58C804118DC03D",
       abi: [
         {
diff --git a/contracts/deployments/arbitrum/DisputeKitClassicNeo.json b/contracts/deployments/arbitrum/DisputeKitClassic.json
similarity index 100%
rename from contracts/deployments/arbitrum/DisputeKitClassicNeo.json
rename to contracts/deployments/arbitrum/DisputeKitClassic.json
diff --git a/contracts/deployments/arbitrum/DisputeKitClassicNeo_Implementation.json b/contracts/deployments/arbitrum/DisputeKitClassic_Implementation.json
similarity index 100%
rename from contracts/deployments/arbitrum/DisputeKitClassicNeo_Implementation.json
rename to contracts/deployments/arbitrum/DisputeKitClassic_Implementation.json
diff --git a/contracts/deployments/arbitrum/DisputeKitClassicNeo_Proxy.json b/contracts/deployments/arbitrum/DisputeKitClassic_Proxy.json
similarity index 100%
rename from contracts/deployments/arbitrum/DisputeKitClassicNeo_Proxy.json
rename to contracts/deployments/arbitrum/DisputeKitClassic_Proxy.json
diff --git a/contracts/deployments/arbitrum/DisputeKitGatedNeo.json b/contracts/deployments/arbitrum/DisputeKitGated.json
similarity index 100%
rename from contracts/deployments/arbitrum/DisputeKitGatedNeo.json
rename to contracts/deployments/arbitrum/DisputeKitGated.json
diff --git a/contracts/deployments/arbitrum/DisputeKitGatedShutterNeo.json b/contracts/deployments/arbitrum/DisputeKitGatedShutter.json
similarity index 100%
rename from contracts/deployments/arbitrum/DisputeKitGatedShutterNeo.json
rename to contracts/deployments/arbitrum/DisputeKitGatedShutter.json
diff --git a/contracts/deployments/arbitrum/DisputeKitGatedShutterNeo_Implementation.json b/contracts/deployments/arbitrum/DisputeKitGatedShutter_Implementation.json
similarity index 100%
rename from contracts/deployments/arbitrum/DisputeKitGatedShutterNeo_Implementation.json
rename to contracts/deployments/arbitrum/DisputeKitGatedShutter_Implementation.json
diff --git a/contracts/deployments/arbitrum/DisputeKitGatedShutterNeo_Proxy.json b/contracts/deployments/arbitrum/DisputeKitGatedShutter_Proxy.json
similarity index 100%
rename from contracts/deployments/arbitrum/DisputeKitGatedShutterNeo_Proxy.json
rename to contracts/deployments/arbitrum/DisputeKitGatedShutter_Proxy.json
diff --git a/contracts/deployments/arbitrum/DisputeKitGatedNeo_Implementation.json b/contracts/deployments/arbitrum/DisputeKitGated_Implementation.json
similarity index 100%
rename from contracts/deployments/arbitrum/DisputeKitGatedNeo_Implementation.json
rename to contracts/deployments/arbitrum/DisputeKitGated_Implementation.json
diff --git a/contracts/deployments/arbitrum/DisputeKitGatedNeo_Proxy.json b/contracts/deployments/arbitrum/DisputeKitGated_Proxy.json
similarity index 100%
rename from contracts/deployments/arbitrum/DisputeKitGatedNeo_Proxy.json
rename to contracts/deployments/arbitrum/DisputeKitGated_Proxy.json
diff --git a/contracts/deployments/arbitrum/DisputeKitShutterNeo.json b/contracts/deployments/arbitrum/DisputeKitShutter.json
similarity index 100%
rename from contracts/deployments/arbitrum/DisputeKitShutterNeo.json
rename to contracts/deployments/arbitrum/DisputeKitShutter.json
diff --git a/contracts/deployments/arbitrum/DisputeKitShutterNeo_Implementation.json b/contracts/deployments/arbitrum/DisputeKitShutter_Implementation.json
similarity index 100%
rename from contracts/deployments/arbitrum/DisputeKitShutterNeo_Implementation.json
rename to contracts/deployments/arbitrum/DisputeKitShutter_Implementation.json
diff --git a/contracts/deployments/arbitrum/DisputeKitShutterNeo_Proxy.json b/contracts/deployments/arbitrum/DisputeKitShutter_Proxy.json
similarity index 100%
rename from contracts/deployments/arbitrum/DisputeKitShutterNeo_Proxy.json
rename to contracts/deployments/arbitrum/DisputeKitShutter_Proxy.json
diff --git a/contracts/deployments/arbitrum/DisputeResolverNeo.json b/contracts/deployments/arbitrum/DisputeResolver.json
similarity index 100%
rename from contracts/deployments/arbitrum/DisputeResolverNeo.json
rename to contracts/deployments/arbitrum/DisputeResolver.json
diff --git a/contracts/deployments/arbitrum/DisputeResolverRulerNeo.json b/contracts/deployments/arbitrum/DisputeResolverRuler.json
similarity index 100%
rename from contracts/deployments/arbitrum/DisputeResolverRulerNeo.json
rename to contracts/deployments/arbitrum/DisputeResolverRuler.json
diff --git a/contracts/deployments/arbitrum/KlerosCoreNeo.json b/contracts/deployments/arbitrum/KlerosCore.json
similarity index 100%
rename from contracts/deployments/arbitrum/KlerosCoreNeo.json
rename to contracts/deployments/arbitrum/KlerosCore.json
diff --git a/contracts/deployments/arbitrum/KlerosCoreRulerNeo.json b/contracts/deployments/arbitrum/KlerosCoreRuler.json
similarity index 100%
rename from contracts/deployments/arbitrum/KlerosCoreRulerNeo.json
rename to contracts/deployments/arbitrum/KlerosCoreRuler.json
diff --git a/contracts/deployments/arbitrum/KlerosCoreRulerNeo_Implementation.json b/contracts/deployments/arbitrum/KlerosCoreRuler_Implementation.json
similarity index 100%
rename from contracts/deployments/arbitrum/KlerosCoreRulerNeo_Implementation.json
rename to contracts/deployments/arbitrum/KlerosCoreRuler_Implementation.json
diff --git a/contracts/deployments/arbitrum/KlerosCoreRulerNeo_Proxy.json b/contracts/deployments/arbitrum/KlerosCoreRuler_Proxy.json
similarity index 100%
rename from contracts/deployments/arbitrum/KlerosCoreRulerNeo_Proxy.json
rename to contracts/deployments/arbitrum/KlerosCoreRuler_Proxy.json
diff --git a/contracts/deployments/arbitrum/KlerosCoreNeo_Implementation.json b/contracts/deployments/arbitrum/KlerosCore_Implementation.json
similarity index 100%
rename from contracts/deployments/arbitrum/KlerosCoreNeo_Implementation.json
rename to contracts/deployments/arbitrum/KlerosCore_Implementation.json
diff --git a/contracts/deployments/arbitrum/KlerosCoreNeo_Proxy.json b/contracts/deployments/arbitrum/KlerosCore_Proxy.json
similarity index 100%
rename from contracts/deployments/arbitrum/KlerosCoreNeo_Proxy.json
rename to contracts/deployments/arbitrum/KlerosCore_Proxy.json
diff --git a/contracts/deployments/arbitrum/SortitionModuleNeo.json b/contracts/deployments/arbitrum/SortitionModule.json
similarity index 100%
rename from contracts/deployments/arbitrum/SortitionModuleNeo.json
rename to contracts/deployments/arbitrum/SortitionModule.json
diff --git a/contracts/deployments/arbitrum/SortitionModuleNeo_Implementation.json b/contracts/deployments/arbitrum/SortitionModule_Implementation.json
similarity index 100%
rename from contracts/deployments/arbitrum/SortitionModuleNeo_Implementation.json
rename to contracts/deployments/arbitrum/SortitionModule_Implementation.json
diff --git a/contracts/deployments/arbitrum/SortitionModuleNeo_Proxy.json b/contracts/deployments/arbitrum/SortitionModule_Proxy.json
similarity index 100%
rename from contracts/deployments/arbitrum/SortitionModuleNeo_Proxy.json
rename to contracts/deployments/arbitrum/SortitionModule_Proxy.json
diff --git a/contracts/deployments/contractsEthers.ts b/contracts/deployments/contractsEthers.ts
index 35e204488..b5da4705e 100644
--- a/contracts/deployments/contractsEthers.ts
+++ b/contracts/deployments/contractsEthers.ts
@@ -38,13 +38,13 @@ import {
   klerosCoreSnapshotProxyConfig as testnetSnapshotProxyConfig,
 } from "./testnet.viem";
 import {
-  klerosCoreNeoConfig as mainnetCoreConfig,
-  sortitionModuleNeoConfig as mainnetSortitionConfig,
-  disputeKitClassicNeoConfig as mainnetDkcConfig,
-  disputeKitShutterNeoConfig as mainnetDkShutterConfig,
-  disputeKitGatedNeoConfig as mainnetDkGatedConfig,
-  disputeKitGatedShutterNeoConfig as mainnetDkGatedShutterConfig,
-  disputeResolverNeoConfig as mainnetDrConfig,
+  klerosCoreConfig as mainnetCoreConfig,
+  sortitionModuleConfig as mainnetSortitionConfig,
+  disputeKitClassicConfig as mainnetDkcConfig,
+  disputeKitShutterConfig as mainnetDkShutterConfig,
+  disputeKitGatedConfig as mainnetDkGatedConfig,
+  disputeKitGatedShutterConfig as mainnetDkGatedShutterConfig,
+  disputeResolverConfig as mainnetDrConfig,
   disputeTemplateRegistryConfig as mainnetDtrConfig,
   evidenceModuleConfig as mainnetEvidenceConfig,
   policyRegistryConfig as mainnetPolicyRegistryConfig,
diff --git a/contracts/deployments/contractsViem.ts b/contracts/deployments/contractsViem.ts
index 9e3abc4f8..7a7338d71 100644
--- a/contracts/deployments/contractsViem.ts
+++ b/contracts/deployments/contractsViem.ts
@@ -39,13 +39,13 @@ import {
   klerosCoreSnapshotProxyConfig as testnetSnapshotProxyConfig,
 } from "./testnet.viem";
 import {
-  klerosCoreNeoConfig as mainnetCoreConfig,
-  sortitionModuleNeoConfig as mainnetSortitionConfig,
-  disputeKitClassicNeoConfig as mainnetDkClassicConfig,
-  disputeKitShutterNeoConfig as mainnetDkShutterConfig,
-  disputeKitGatedNeoConfig as mainnetDkGatedConfig,
-  disputeKitGatedShutterNeoConfig as mainnetDkGatedShutterConfig,
-  disputeResolverNeoConfig as mainnetDrConfig,
+  klerosCoreConfig as mainnetCoreConfig,
+  sortitionModuleConfig as mainnetSortitionConfig,
+  disputeKitClassicConfig as mainnetDkClassicConfig,
+  disputeKitShutterConfig as mainnetDkShutterConfig,
+  disputeKitGatedConfig as mainnetDkGatedConfig,
+  disputeKitGatedShutterConfig as mainnetDkGatedShutterConfig,
+  disputeResolverConfig as mainnetDrConfig,
   disputeTemplateRegistryConfig as mainnetDtrConfig,
   evidenceModuleConfig as mainnetEvidenceConfig,
   policyRegistryConfig as mainnetPolicyRegistryConfig,
diff --git a/contracts/deployments/mainnet.viem.ts b/contracts/deployments/mainnet.viem.ts
index c57906c57..eeada4b95 100644
--- a/contracts/deployments/mainnet.viem.ts
+++ b/contracts/deployments/mainnet.viem.ts
@@ -1725,13 +1725,13 @@ export const daiAddress = {
 export const daiConfig = { address: daiAddress, abi: daiAbi } as const;
 
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-// DisputeKitClassicNeo
+// DisputeKitClassic
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x70B464be85A547144C72485eBa2577E5D3A45421)
  */
-export const disputeKitClassicNeoAbi = [
+export const disputeKitClassicAbi = [
   { type: "fallback", stateMutability: "payable" },
   { type: "receive", stateMutability: "payable" },
   { type: "error", inputs: [], name: "AlreadyInitialized" },
@@ -2348,26 +2348,26 @@ export const disputeKitClassicNeoAbi = [
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x70B464be85A547144C72485eBa2577E5D3A45421)
  */
-export const disputeKitClassicNeoAddress = {
+export const disputeKitClassicAddress = {
   42161: "0x70B464be85A547144C72485eBa2577E5D3A45421",
 } as const;
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x70B464be85A547144C72485eBa2577E5D3A45421)
  */
-export const disputeKitClassicNeoConfig = {
-  address: disputeKitClassicNeoAddress,
-  abi: disputeKitClassicNeoAbi,
+export const disputeKitClassicConfig = {
+  address: disputeKitClassicAddress,
+  abi: disputeKitClassicAbi,
 } as const;
 
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-// DisputeKitClassicNeo_Implementation
+// DisputeKitClassic_Implementation
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x371Aa4B1AE5b5f9422f3Ff1d105029AAd1D319BC)
  */
-export const disputeKitClassicNeoImplementationAbi = [
+export const disputeKitClassicImplementationAbi = [
   { type: "constructor", inputs: [], stateMutability: "nonpayable" },
   { type: "error", inputs: [], name: "AlreadyInitialized" },
   { type: "error", inputs: [], name: "FailedDelegateCall" },
@@ -2975,26 +2975,26 @@ export const disputeKitClassicNeoImplementationAbi = [
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x371Aa4B1AE5b5f9422f3Ff1d105029AAd1D319BC)
  */
-export const disputeKitClassicNeoImplementationAddress = {
+export const disputeKitClassicImplementationAddress = {
   42161: "0x371Aa4B1AE5b5f9422f3Ff1d105029AAd1D319BC",
 } as const;
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x371Aa4B1AE5b5f9422f3Ff1d105029AAd1D319BC)
  */
-export const disputeKitClassicNeoImplementationConfig = {
-  address: disputeKitClassicNeoImplementationAddress,
-  abi: disputeKitClassicNeoImplementationAbi,
+export const disputeKitClassicImplementationConfig = {
+  address: disputeKitClassicImplementationAddress,
+  abi: disputeKitClassicImplementationAbi,
 } as const;
 
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-// DisputeKitClassicNeo_Proxy
+// DisputeKitClassic_Proxy
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x70B464be85A547144C72485eBa2577E5D3A45421)
  */
-export const disputeKitClassicNeoProxyAbi = [
+export const disputeKitClassicProxyAbi = [
   {
     type: "constructor",
     inputs: [
@@ -3010,26 +3010,26 @@ export const disputeKitClassicNeoProxyAbi = [
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x70B464be85A547144C72485eBa2577E5D3A45421)
  */
-export const disputeKitClassicNeoProxyAddress = {
+export const disputeKitClassicProxyAddress = {
   42161: "0x70B464be85A547144C72485eBa2577E5D3A45421",
 } as const;
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x70B464be85A547144C72485eBa2577E5D3A45421)
  */
-export const disputeKitClassicNeoProxyConfig = {
-  address: disputeKitClassicNeoProxyAddress,
-  abi: disputeKitClassicNeoProxyAbi,
+export const disputeKitClassicProxyConfig = {
+  address: disputeKitClassicProxyAddress,
+  abi: disputeKitClassicProxyAbi,
 } as const;
 
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-// DisputeKitGatedNeo
+// DisputeKitGated
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xaE1eed20C125B739b64c948820C61F809ad9a925)
  */
-export const disputeKitGatedNeoAbi = [
+export const disputeKitGatedAbi = [
   { type: "fallback", stateMutability: "payable" },
   { type: "receive", stateMutability: "payable" },
   { type: "error", inputs: [], name: "AlreadyInitialized" },
@@ -3657,27 +3657,28 @@ export const disputeKitGatedNeoAbi = [
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xaE1eed20C125B739b64c948820C61F809ad9a925)
  */
-export const disputeKitGatedNeoAddress = {
+export const disputeKitGatedAddress = {
   42161: "0xaE1eed20C125B739b64c948820C61F809ad9a925",
 } as const;
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xaE1eed20C125B739b64c948820C61F809ad9a925)
  */
-export const disputeKitGatedNeoConfig = {
-  address: disputeKitGatedNeoAddress,
-  abi: disputeKitGatedNeoAbi,
+export const disputeKitGatedConfig = {
+  address: disputeKitGatedAddress,
+  abi: disputeKitGatedAbi,
 } as const;
 
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-// DisputeKitGatedNeo_Implementation
+// DisputeKitGatedShutter
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xEA7863E6dE863e8E6d037D8693ad5dA45Db7790a)
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x788330092B9704809C19858E39EB9Ac402c2E47b)
  */
-export const disputeKitGatedNeoImplementationAbi = [
-  { type: "constructor", inputs: [], stateMutability: "nonpayable" },
+export const disputeKitGatedShutterAbi = [
+  { type: "fallback", stateMutability: "payable" },
+  { type: "receive", stateMutability: "payable" },
   { type: "error", inputs: [], name: "AlreadyInitialized" },
   { type: "error", inputs: [], name: "FailedDelegateCall" },
   {
@@ -3748,6 +3749,43 @@ export const disputeKitGatedNeoImplementationAbi = [
     ],
     name: "CommitCast",
   },
+  {
+    type: "event",
+    anonymous: false,
+    inputs: [
+      {
+        name: "_coreDisputeID",
+        internalType: "uint256",
+        type: "uint256",
+        indexed: true,
+      },
+      {
+        name: "_juror",
+        internalType: "address",
+        type: "address",
+        indexed: true,
+      },
+      {
+        name: "_commit",
+        internalType: "bytes32",
+        type: "bytes32",
+        indexed: true,
+      },
+      {
+        name: "_identity",
+        internalType: "bytes32",
+        type: "bytes32",
+        indexed: false,
+      },
+      {
+        name: "_encryptedVote",
+        internalType: "bytes",
+        type: "bytes",
+        indexed: false,
+      },
+    ],
+    name: "CommitCastShutter",
+  },
   {
     type: "event",
     anonymous: false,
@@ -3974,6 +4012,19 @@ export const disputeKitGatedNeoImplementationAbi = [
     outputs: [],
     stateMutability: "nonpayable",
   },
+  {
+    type: "function",
+    inputs: [
+      { name: "_coreDisputeID", internalType: "uint256", type: "uint256" },
+      { name: "_voteIDs", internalType: "uint256[]", type: "uint256[]" },
+      { name: "_commit", internalType: "bytes32", type: "bytes32" },
+      { name: "_identity", internalType: "bytes32", type: "bytes32" },
+      { name: "_encryptedVote", internalType: "bytes", type: "bytes" },
+    ],
+    name: "castCommitShutter",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
   {
     type: "function",
     inputs: [
@@ -3987,6 +4038,19 @@ export const disputeKitGatedNeoImplementationAbi = [
     outputs: [],
     stateMutability: "nonpayable",
   },
+  {
+    type: "function",
+    inputs: [
+      { name: "_coreDisputeID", internalType: "uint256", type: "uint256" },
+      { name: "_voteIDs", internalType: "uint256[]", type: "uint256[]" },
+      { name: "_choice", internalType: "uint256", type: "uint256" },
+      { name: "_salt", internalType: "uint256", type: "uint256" },
+      { name: "_justification", internalType: "string", type: "string" },
+    ],
+    name: "castVoteShutter",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
   {
     type: "function",
     inputs: [{ name: "_core", internalType: "address", type: "address" }],
@@ -4077,17 +4141,6 @@ export const disputeKitGatedNeoImplementationAbi = [
     outputs: [],
     stateMutability: "nonpayable",
   },
-  {
-    type: "function",
-    inputs: [{ name: "_extraData", internalType: "bytes", type: "bytes" }],
-    name: "extraDataToTokenInfo",
-    outputs: [
-      { name: "tokenGate", internalType: "address", type: "address" },
-      { name: "isERC1155", internalType: "bool", type: "bool" },
-      { name: "tokenId", internalType: "uint256", type: "uint256" },
-    ],
-    stateMutability: "pure",
-  },
   {
     type: "function",
     inputs: [
@@ -4290,31 +4343,6 @@ export const disputeKitGatedNeoImplementationAbi = [
     outputs: [{ name: "amount", internalType: "uint256", type: "uint256" }],
     stateMutability: "nonpayable",
   },
-] as const;
-
-/**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xEA7863E6dE863e8E6d037D8693ad5dA45Db7790a)
- */
-export const disputeKitGatedNeoImplementationAddress = {
-  42161: "0xEA7863E6dE863e8E6d037D8693ad5dA45Db7790a",
-} as const;
-
-/**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xEA7863E6dE863e8E6d037D8693ad5dA45Db7790a)
- */
-export const disputeKitGatedNeoImplementationConfig = {
-  address: disputeKitGatedNeoImplementationAddress,
-  abi: disputeKitGatedNeoImplementationAbi,
-} as const;
-
-//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-// DisputeKitGatedNeo_Proxy
-//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-
-/**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xaE1eed20C125B739b64c948820C61F809ad9a925)
- */
-export const disputeKitGatedNeoProxyAbi = [
   {
     type: "constructor",
     inputs: [
@@ -4323,35 +4351,32 @@ export const disputeKitGatedNeoProxyAbi = [
     ],
     stateMutability: "nonpayable",
   },
-  { type: "fallback", stateMutability: "payable" },
-  { type: "receive", stateMutability: "payable" },
 ] as const;
 
 /**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xaE1eed20C125B739b64c948820C61F809ad9a925)
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x788330092B9704809C19858E39EB9Ac402c2E47b)
  */
-export const disputeKitGatedNeoProxyAddress = {
-  42161: "0xaE1eed20C125B739b64c948820C61F809ad9a925",
+export const disputeKitGatedShutterAddress = {
+  42161: "0x788330092B9704809C19858E39EB9Ac402c2E47b",
 } as const;
 
 /**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xaE1eed20C125B739b64c948820C61F809ad9a925)
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x788330092B9704809C19858E39EB9Ac402c2E47b)
  */
-export const disputeKitGatedNeoProxyConfig = {
-  address: disputeKitGatedNeoProxyAddress,
-  abi: disputeKitGatedNeoProxyAbi,
+export const disputeKitGatedShutterConfig = {
+  address: disputeKitGatedShutterAddress,
+  abi: disputeKitGatedShutterAbi,
 } as const;
 
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-// DisputeKitGatedShutterNeo
+// DisputeKitGatedShutter_Implementation
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x788330092B9704809C19858E39EB9Ac402c2E47b)
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xb12EB4c0716d3A9861a9AC471c6CdDB808d61b32)
  */
-export const disputeKitGatedShutterNeoAbi = [
-  { type: "fallback", stateMutability: "payable" },
-  { type: "receive", stateMutability: "payable" },
+export const disputeKitGatedShutterImplementationAbi = [
+  { type: "constructor", inputs: [], stateMutability: "nonpayable" },
   { type: "error", inputs: [], name: "AlreadyInitialized" },
   { type: "error", inputs: [], name: "FailedDelegateCall" },
   {
@@ -5016,6 +5041,31 @@ export const disputeKitGatedShutterNeoAbi = [
     outputs: [{ name: "amount", internalType: "uint256", type: "uint256" }],
     stateMutability: "nonpayable",
   },
+] as const;
+
+/**
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xb12EB4c0716d3A9861a9AC471c6CdDB808d61b32)
+ */
+export const disputeKitGatedShutterImplementationAddress = {
+  42161: "0xb12EB4c0716d3A9861a9AC471c6CdDB808d61b32",
+} as const;
+
+/**
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xb12EB4c0716d3A9861a9AC471c6CdDB808d61b32)
+ */
+export const disputeKitGatedShutterImplementationConfig = {
+  address: disputeKitGatedShutterImplementationAddress,
+  abi: disputeKitGatedShutterImplementationAbi,
+} as const;
+
+//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+// DisputeKitGatedShutter_Proxy
+//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+
+/**
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x788330092B9704809C19858E39EB9Ac402c2E47b)
+ */
+export const disputeKitGatedShutterProxyAbi = [
   {
     type: "constructor",
     inputs: [
@@ -5024,31 +5074,33 @@ export const disputeKitGatedShutterNeoAbi = [
     ],
     stateMutability: "nonpayable",
   },
+  { type: "fallback", stateMutability: "payable" },
+  { type: "receive", stateMutability: "payable" },
 ] as const;
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x788330092B9704809C19858E39EB9Ac402c2E47b)
  */
-export const disputeKitGatedShutterNeoAddress = {
+export const disputeKitGatedShutterProxyAddress = {
   42161: "0x788330092B9704809C19858E39EB9Ac402c2E47b",
 } as const;
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x788330092B9704809C19858E39EB9Ac402c2E47b)
  */
-export const disputeKitGatedShutterNeoConfig = {
-  address: disputeKitGatedShutterNeoAddress,
-  abi: disputeKitGatedShutterNeoAbi,
+export const disputeKitGatedShutterProxyConfig = {
+  address: disputeKitGatedShutterProxyAddress,
+  abi: disputeKitGatedShutterProxyAbi,
 } as const;
 
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-// DisputeKitGatedShutterNeo_Implementation
+// DisputeKitGated_Implementation
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xb12EB4c0716d3A9861a9AC471c6CdDB808d61b32)
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xEA7863E6dE863e8E6d037D8693ad5dA45Db7790a)
  */
-export const disputeKitGatedShutterNeoImplementationAbi = [
+export const disputeKitGatedImplementationAbi = [
   { type: "constructor", inputs: [], stateMutability: "nonpayable" },
   { type: "error", inputs: [], name: "AlreadyInitialized" },
   { type: "error", inputs: [], name: "FailedDelegateCall" },
@@ -5120,43 +5172,6 @@ export const disputeKitGatedShutterNeoImplementationAbi = [
     ],
     name: "CommitCast",
   },
-  {
-    type: "event",
-    anonymous: false,
-    inputs: [
-      {
-        name: "_coreDisputeID",
-        internalType: "uint256",
-        type: "uint256",
-        indexed: true,
-      },
-      {
-        name: "_juror",
-        internalType: "address",
-        type: "address",
-        indexed: true,
-      },
-      {
-        name: "_commit",
-        internalType: "bytes32",
-        type: "bytes32",
-        indexed: true,
-      },
-      {
-        name: "_identity",
-        internalType: "bytes32",
-        type: "bytes32",
-        indexed: false,
-      },
-      {
-        name: "_encryptedVote",
-        internalType: "bytes",
-        type: "bytes",
-        indexed: false,
-      },
-    ],
-    name: "CommitCastShutter",
-  },
   {
     type: "event",
     anonymous: false,
@@ -5383,19 +5398,6 @@ export const disputeKitGatedShutterNeoImplementationAbi = [
     outputs: [],
     stateMutability: "nonpayable",
   },
-  {
-    type: "function",
-    inputs: [
-      { name: "_coreDisputeID", internalType: "uint256", type: "uint256" },
-      { name: "_voteIDs", internalType: "uint256[]", type: "uint256[]" },
-      { name: "_commit", internalType: "bytes32", type: "bytes32" },
-      { name: "_identity", internalType: "bytes32", type: "bytes32" },
-      { name: "_encryptedVote", internalType: "bytes", type: "bytes" },
-    ],
-    name: "castCommitShutter",
-    outputs: [],
-    stateMutability: "nonpayable",
-  },
   {
     type: "function",
     inputs: [
@@ -5409,19 +5411,6 @@ export const disputeKitGatedShutterNeoImplementationAbi = [
     outputs: [],
     stateMutability: "nonpayable",
   },
-  {
-    type: "function",
-    inputs: [
-      { name: "_coreDisputeID", internalType: "uint256", type: "uint256" },
-      { name: "_voteIDs", internalType: "uint256[]", type: "uint256[]" },
-      { name: "_choice", internalType: "uint256", type: "uint256" },
-      { name: "_salt", internalType: "uint256", type: "uint256" },
-      { name: "_justification", internalType: "string", type: "string" },
-    ],
-    name: "castVoteShutter",
-    outputs: [],
-    stateMutability: "nonpayable",
-  },
   {
     type: "function",
     inputs: [{ name: "_core", internalType: "address", type: "address" }],
@@ -5512,6 +5501,17 @@ export const disputeKitGatedShutterNeoImplementationAbi = [
     outputs: [],
     stateMutability: "nonpayable",
   },
+  {
+    type: "function",
+    inputs: [{ name: "_extraData", internalType: "bytes", type: "bytes" }],
+    name: "extraDataToTokenInfo",
+    outputs: [
+      { name: "tokenGate", internalType: "address", type: "address" },
+      { name: "isERC1155", internalType: "bool", type: "bool" },
+      { name: "tokenId", internalType: "uint256", type: "uint256" },
+    ],
+    stateMutability: "pure",
+  },
   {
     type: "function",
     inputs: [
@@ -5717,28 +5717,28 @@ export const disputeKitGatedShutterNeoImplementationAbi = [
 ] as const;
 
 /**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xb12EB4c0716d3A9861a9AC471c6CdDB808d61b32)
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xEA7863E6dE863e8E6d037D8693ad5dA45Db7790a)
  */
-export const disputeKitGatedShutterNeoImplementationAddress = {
-  42161: "0xb12EB4c0716d3A9861a9AC471c6CdDB808d61b32",
+export const disputeKitGatedImplementationAddress = {
+  42161: "0xEA7863E6dE863e8E6d037D8693ad5dA45Db7790a",
 } as const;
 
 /**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xb12EB4c0716d3A9861a9AC471c6CdDB808d61b32)
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xEA7863E6dE863e8E6d037D8693ad5dA45Db7790a)
  */
-export const disputeKitGatedShutterNeoImplementationConfig = {
-  address: disputeKitGatedShutterNeoImplementationAddress,
-  abi: disputeKitGatedShutterNeoImplementationAbi,
+export const disputeKitGatedImplementationConfig = {
+  address: disputeKitGatedImplementationAddress,
+  abi: disputeKitGatedImplementationAbi,
 } as const;
 
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-// DisputeKitGatedShutterNeo_Proxy
+// DisputeKitGated_Proxy
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x788330092B9704809C19858E39EB9Ac402c2E47b)
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xaE1eed20C125B739b64c948820C61F809ad9a925)
  */
-export const disputeKitGatedShutterNeoProxyAbi = [
+export const disputeKitGatedProxyAbi = [
   {
     type: "constructor",
     inputs: [
@@ -5752,28 +5752,28 @@ export const disputeKitGatedShutterNeoProxyAbi = [
 ] as const;
 
 /**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x788330092B9704809C19858E39EB9Ac402c2E47b)
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xaE1eed20C125B739b64c948820C61F809ad9a925)
  */
-export const disputeKitGatedShutterNeoProxyAddress = {
-  42161: "0x788330092B9704809C19858E39EB9Ac402c2E47b",
+export const disputeKitGatedProxyAddress = {
+  42161: "0xaE1eed20C125B739b64c948820C61F809ad9a925",
 } as const;
 
 /**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x788330092B9704809C19858E39EB9Ac402c2E47b)
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xaE1eed20C125B739b64c948820C61F809ad9a925)
  */
-export const disputeKitGatedShutterNeoProxyConfig = {
-  address: disputeKitGatedShutterNeoProxyAddress,
-  abi: disputeKitGatedShutterNeoProxyAbi,
+export const disputeKitGatedProxyConfig = {
+  address: disputeKitGatedProxyAddress,
+  abi: disputeKitGatedProxyAbi,
 } as const;
 
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-// DisputeKitShutterNeo
+// DisputeKitShutter
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x9D3e3f1765744c2a1BC6F6088549770444BBC768)
  */
-export const disputeKitShutterNeoAbi = [
+export const disputeKitShutterAbi = [
   { type: "fallback", stateMutability: "payable" },
   { type: "receive", stateMutability: "payable" },
   { type: "error", inputs: [], name: "AlreadyInitialized" },
@@ -6453,26 +6453,26 @@ export const disputeKitShutterNeoAbi = [
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x9D3e3f1765744c2a1BC6F6088549770444BBC768)
  */
-export const disputeKitShutterNeoAddress = {
+export const disputeKitShutterAddress = {
   42161: "0x9D3e3f1765744c2a1BC6F6088549770444BBC768",
 } as const;
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x9D3e3f1765744c2a1BC6F6088549770444BBC768)
  */
-export const disputeKitShutterNeoConfig = {
-  address: disputeKitShutterNeoAddress,
-  abi: disputeKitShutterNeoAbi,
+export const disputeKitShutterConfig = {
+  address: disputeKitShutterAddress,
+  abi: disputeKitShutterAbi,
 } as const;
 
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-// DisputeKitShutterNeo_Implementation
+// DisputeKitShutter_Implementation
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xF3103B46403A0bBd4551648BFb29BCC2b8783947)
  */
-export const disputeKitShutterNeoImplementationAbi = [
+export const disputeKitShutterImplementationAbi = [
   { type: "constructor", inputs: [], stateMutability: "nonpayable" },
   { type: "error", inputs: [], name: "AlreadyInitialized" },
   { type: "error", inputs: [], name: "FailedDelegateCall" },
@@ -7143,26 +7143,26 @@ export const disputeKitShutterNeoImplementationAbi = [
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xF3103B46403A0bBd4551648BFb29BCC2b8783947)
  */
-export const disputeKitShutterNeoImplementationAddress = {
+export const disputeKitShutterImplementationAddress = {
   42161: "0xF3103B46403A0bBd4551648BFb29BCC2b8783947",
 } as const;
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xF3103B46403A0bBd4551648BFb29BCC2b8783947)
  */
-export const disputeKitShutterNeoImplementationConfig = {
-  address: disputeKitShutterNeoImplementationAddress,
-  abi: disputeKitShutterNeoImplementationAbi,
+export const disputeKitShutterImplementationConfig = {
+  address: disputeKitShutterImplementationAddress,
+  abi: disputeKitShutterImplementationAbi,
 } as const;
 
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-// DisputeKitShutterNeo_Proxy
+// DisputeKitShutter_Proxy
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x9D3e3f1765744c2a1BC6F6088549770444BBC768)
  */
-export const disputeKitShutterNeoProxyAbi = [
+export const disputeKitShutterProxyAbi = [
   {
     type: "constructor",
     inputs: [
@@ -7178,26 +7178,26 @@ export const disputeKitShutterNeoProxyAbi = [
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x9D3e3f1765744c2a1BC6F6088549770444BBC768)
  */
-export const disputeKitShutterNeoProxyAddress = {
+export const disputeKitShutterProxyAddress = {
   42161: "0x9D3e3f1765744c2a1BC6F6088549770444BBC768",
 } as const;
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x9D3e3f1765744c2a1BC6F6088549770444BBC768)
  */
-export const disputeKitShutterNeoProxyConfig = {
-  address: disputeKitShutterNeoProxyAddress,
-  abi: disputeKitShutterNeoProxyAbi,
+export const disputeKitShutterProxyConfig = {
+  address: disputeKitShutterProxyAddress,
+  abi: disputeKitShutterProxyAbi,
 } as const;
 
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-// DisputeResolverNeo
+// DisputeResolver
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xb5526D022962A1fFf6eD32C93e8b714c901F4323)
  */
-export const disputeResolverNeoAbi = [
+export const disputeResolverAbi = [
   {
     type: "constructor",
     inputs: [
@@ -7413,26 +7413,26 @@ export const disputeResolverNeoAbi = [
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xb5526D022962A1fFf6eD32C93e8b714c901F4323)
  */
-export const disputeResolverNeoAddress = {
+export const disputeResolverAddress = {
   42161: "0xb5526D022962A1fFf6eD32C93e8b714c901F4323",
 } as const;
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xb5526D022962A1fFf6eD32C93e8b714c901F4323)
  */
-export const disputeResolverNeoConfig = {
-  address: disputeResolverNeoAddress,
-  abi: disputeResolverNeoAbi,
+export const disputeResolverConfig = {
+  address: disputeResolverAddress,
+  abi: disputeResolverAbi,
 } as const;
 
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-// DisputeResolverRulerNeo
+// DisputeResolverRuler
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xb3a5FdEAF461c42caCe148e978e6FBCa97bE6140)
  */
-export const disputeResolverRulerNeoAbi = [
+export const disputeResolverRulerAbi = [
   {
     type: "constructor",
     inputs: [
@@ -7648,16 +7648,16 @@ export const disputeResolverRulerNeoAbi = [
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xb3a5FdEAF461c42caCe148e978e6FBCa97bE6140)
  */
-export const disputeResolverRulerNeoAddress = {
+export const disputeResolverRulerAddress = {
   42161: "0xb3a5FdEAF461c42caCe148e978e6FBCa97bE6140",
 } as const;
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xb3a5FdEAF461c42caCe148e978e6FBCa97bE6140)
  */
-export const disputeResolverRulerNeoConfig = {
-  address: disputeResolverRulerNeoAddress,
-  abi: disputeResolverRulerNeoAbi,
+export const disputeResolverRulerConfig = {
+  address: disputeResolverRulerAddress,
+  abi: disputeResolverRulerAbi,
 } as const;
 
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
@@ -8604,13 +8604,13 @@ export const iHomeGatewayAbi = [
 ] as const;
 
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-// KlerosCoreNeo
+// KlerosCore
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x991d2df165670b9cac3B022f4B68D65b664222ea)
  */
-export const klerosCoreNeoAbi = [
+export const klerosCoreAbi = [
   { type: "fallback", stateMutability: "payable" },
   { type: "receive", stateMutability: "payable" },
   { type: "error", inputs: [], name: "AlreadyInitialized" },
@@ -9805,65 +9805,46 @@ export const klerosCoreNeoAbi = [
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x991d2df165670b9cac3B022f4B68D65b664222ea)
  */
-export const klerosCoreNeoAddress = {
+export const klerosCoreAddress = {
   42161: "0x991d2df165670b9cac3B022f4B68D65b664222ea",
 } as const;
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x991d2df165670b9cac3B022f4B68D65b664222ea)
  */
-export const klerosCoreNeoConfig = {
-  address: klerosCoreNeoAddress,
-  abi: klerosCoreNeoAbi,
+export const klerosCoreConfig = {
+  address: klerosCoreAddress,
+  abi: klerosCoreAbi,
 } as const;
 
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-// KlerosCoreNeo_Implementation
+// KlerosCoreRuler
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xC1210493804eEF123096F9581Ee82B915150E54c)
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xc0169e0B19aE02ac4fADD689260CF038726DFE13)
  */
-export const klerosCoreNeoImplementationAbi = [
-  { type: "constructor", inputs: [], stateMutability: "nonpayable" },
+export const klerosCoreRulerAbi = [
+  { type: "fallback", stateMutability: "payable" },
+  { type: "receive", stateMutability: "payable" },
   { type: "error", inputs: [], name: "AlreadyInitialized" },
   { type: "error", inputs: [], name: "AppealFeesNotEnough" },
-  { type: "error", inputs: [], name: "AppealPeriodNotPassed" },
-  { type: "error", inputs: [], name: "ArbitrableNotWhitelisted" },
   { type: "error", inputs: [], name: "ArbitrationFeesNotEnough" },
-  { type: "error", inputs: [], name: "CannotDisableClassicDK" },
-  { type: "error", inputs: [], name: "CommitPeriodNotPassed" },
-  { type: "error", inputs: [], name: "DisputeKitNotSupportedByCourt" },
-  { type: "error", inputs: [], name: "DisputeKitOnly" },
   { type: "error", inputs: [], name: "DisputeNotAppealable" },
-  { type: "error", inputs: [], name: "DisputePeriodIsFinal" },
-  { type: "error", inputs: [], name: "DisputeStillDrawing" },
-  { type: "error", inputs: [], name: "EvidenceNotPassedAndNotAppeal" },
   { type: "error", inputs: [], name: "FailedDelegateCall" },
   { type: "error", inputs: [], name: "GovernorOnly" },
-  { type: "error", inputs: [], name: "GuardianOrGovernorOnly" },
-  { type: "error", inputs: [], name: "InvalidDisputKitParent" },
+  { type: "error", inputs: [], name: "GovernorOrInstructorOnly" },
   { type: "error", inputs: [], name: "InvalidForkingCourtAsParent" },
   {
     type: "error",
     inputs: [{ name: "implementation", internalType: "address", type: "address" }],
     name: "InvalidImplementation",
   },
-  { type: "error", inputs: [], name: "MinStakeLowerThanParentCourt" },
-  { type: "error", inputs: [], name: "MustSupportDisputeKitClassic" },
-  { type: "error", inputs: [], name: "NotEligibleForStaking" },
-  { type: "error", inputs: [], name: "NotEvidencePeriod" },
-  { type: "error", inputs: [], name: "NotExecutionPeriod" },
+  { type: "error", inputs: [], name: "NoRulerSet" },
   { type: "error", inputs: [], name: "NotInitializing" },
+  { type: "error", inputs: [], name: "RulerOnly" },
   { type: "error", inputs: [], name: "RulingAlreadyExecuted" },
-  { type: "error", inputs: [], name: "SortitionModuleOnly" },
-  { type: "error", inputs: [], name: "StakingInTooManyCourts" },
-  { type: "error", inputs: [], name: "StakingLessThanCourtMinStake" },
-  { type: "error", inputs: [], name: "StakingMoreThanMaxStakePerJuror" },
-  { type: "error", inputs: [], name: "StakingMoreThanMaxTotalStaked" },
-  { type: "error", inputs: [], name: "StakingNotPossibleInThisCourt" },
-  { type: "error", inputs: [], name: "StakingTransferFailed" },
-  { type: "error", inputs: [], name: "StakingZeroWhenNoStake" },
+  { type: "error", inputs: [], name: "RulingModeNotSet" },
   { type: "error", inputs: [], name: "TokenNotAccepted" },
   { type: "error", inputs: [], name: "TransferFailed" },
   { type: "error", inputs: [], name: "UUPSUnauthorizedCallContext" },
@@ -9872,13 +9853,7 @@ export const klerosCoreNeoImplementationAbi = [
     inputs: [{ name: "slot", internalType: "bytes32", type: "bytes32" }],
     name: "UUPSUnsupportedProxiableUUID",
   },
-  { type: "error", inputs: [], name: "UnstakingTransferFailed" },
   { type: "error", inputs: [], name: "UnsuccessfulCall" },
-  { type: "error", inputs: [], name: "UnsupportedDisputeKit" },
-  { type: "error", inputs: [], name: "VotePeriodNotPassed" },
-  { type: "error", inputs: [], name: "WhenNotPausedOnly" },
-  { type: "error", inputs: [], name: "WhenPausedOnly" },
-  { type: "error", inputs: [], name: "WrongDisputeKitIndex" },
   {
     type: "event",
     anonymous: false,
@@ -9931,14 +9906,52 @@ export const klerosCoreNeoImplementationAbi = [
     ],
     name: "AppealPossible",
   },
+  {
+    type: "event",
+    anonymous: false,
+    inputs: [
+      {
+        name: "_arbitrable",
+        internalType: "contract IArbitrableV2",
+        type: "address",
+        indexed: true,
+      },
+      {
+        name: "mode",
+        internalType: "enum KlerosCoreRuler.RulingMode",
+        type: "uint8",
+        indexed: true,
+      },
+      {
+        name: "_disputeID",
+        internalType: "uint256",
+        type: "uint256",
+        indexed: true,
+      },
+      {
+        name: "_ruling",
+        internalType: "uint256",
+        type: "uint256",
+        indexed: false,
+      },
+      { name: "tied", internalType: "bool", type: "bool", indexed: false },
+      {
+        name: "overridden",
+        internalType: "bool",
+        type: "bool",
+        indexed: false,
+      },
+    ],
+    name: "AutoRuled",
+  },
   {
     type: "event",
     anonymous: false,
     inputs: [
       {
         name: "_courtID",
-        internalType: "uint96",
-        type: "uint96",
+        internalType: "uint256",
+        type: "uint256",
         indexed: true,
       },
       {
@@ -9983,12 +9996,6 @@ export const klerosCoreNeoImplementationAbi = [
         type: "uint256[4]",
         indexed: false,
       },
-      {
-        name: "_supportedDisputeKits",
-        internalType: "uint256[]",
-        type: "uint256[]",
-        indexed: false,
-      },
     ],
     name: "CourtCreated",
   },
@@ -10091,107 +10098,6 @@ export const klerosCoreNeoImplementationAbi = [
     ],
     name: "DisputeCreation",
   },
-  {
-    type: "event",
-    anonymous: false,
-    inputs: [
-      {
-        name: "_disputeKitID",
-        internalType: "uint256",
-        type: "uint256",
-        indexed: true,
-      },
-      {
-        name: "_disputeKitAddress",
-        internalType: "contract IDisputeKit",
-        type: "address",
-        indexed: true,
-      },
-    ],
-    name: "DisputeKitCreated",
-  },
-  {
-    type: "event",
-    anonymous: false,
-    inputs: [
-      {
-        name: "_courtID",
-        internalType: "uint96",
-        type: "uint96",
-        indexed: true,
-      },
-      {
-        name: "_disputeKitID",
-        internalType: "uint256",
-        type: "uint256",
-        indexed: true,
-      },
-      { name: "_enable", internalType: "bool", type: "bool", indexed: true },
-    ],
-    name: "DisputeKitEnabled",
-  },
-  {
-    type: "event",
-    anonymous: false,
-    inputs: [
-      {
-        name: "_disputeID",
-        internalType: "uint256",
-        type: "uint256",
-        indexed: true,
-      },
-      {
-        name: "_roundID",
-        internalType: "uint256",
-        type: "uint256",
-        indexed: true,
-      },
-      {
-        name: "_fromDisputeKitID",
-        internalType: "uint256",
-        type: "uint256",
-        indexed: true,
-      },
-      {
-        name: "_toDisputeKitID",
-        internalType: "uint256",
-        type: "uint256",
-        indexed: false,
-      },
-    ],
-    name: "DisputeKitJump",
-  },
-  {
-    type: "event",
-    anonymous: false,
-    inputs: [
-      {
-        name: "_address",
-        internalType: "address",
-        type: "address",
-        indexed: true,
-      },
-      {
-        name: "_disputeID",
-        internalType: "uint256",
-        type: "uint256",
-        indexed: true,
-      },
-      {
-        name: "_roundID",
-        internalType: "uint256",
-        type: "uint256",
-        indexed: false,
-      },
-      {
-        name: "_voteID",
-        internalType: "uint256",
-        type: "uint256",
-        indexed: false,
-      },
-    ],
-    name: "Draw",
-  },
   {
     type: "event",
     anonymous: false,
@@ -10279,14 +10185,67 @@ export const klerosCoreNeoImplementationAbi = [
       },
       {
         name: "_period",
-        internalType: "enum KlerosCoreBase.Period",
+        internalType: "enum KlerosCoreRuler.Period",
         type: "uint8",
         indexed: false,
       },
     ],
     name: "NewPeriod",
   },
-  { type: "event", anonymous: false, inputs: [], name: "Paused" },
+  {
+    type: "event",
+    anonymous: false,
+    inputs: [
+      {
+        name: "_arbitrable",
+        internalType: "contract IArbitrableV2",
+        type: "address",
+        indexed: true,
+      },
+      {
+        name: "_oldRuler",
+        internalType: "address",
+        type: "address",
+        indexed: true,
+      },
+      {
+        name: "_newRuler",
+        internalType: "address",
+        type: "address",
+        indexed: true,
+      },
+    ],
+    name: "RulerChanged",
+  },
+  {
+    type: "event",
+    anonymous: false,
+    inputs: [
+      {
+        name: "_arbitrable",
+        internalType: "contract IArbitrableV2",
+        type: "address",
+        indexed: true,
+      },
+      {
+        name: "_settings",
+        internalType: "struct KlerosCoreRuler.RulerSettings",
+        type: "tuple",
+        components: [
+          {
+            name: "rulingMode",
+            internalType: "enum KlerosCoreRuler.RulingMode",
+            type: "uint8",
+          },
+          { name: "presetRuling", internalType: "uint256", type: "uint256" },
+          { name: "presetTied", internalType: "bool", type: "bool" },
+          { name: "presetOverridden", internalType: "bool", type: "bool" },
+        ],
+        indexed: false,
+      },
+    ],
+    name: "RulerSettingsChanged",
+  },
   {
     type: "event",
     anonymous: false,
@@ -10361,7 +10320,6 @@ export const klerosCoreNeoImplementationAbi = [
     ],
     name: "TokenAndETHShift",
   },
-  { type: "event", anonymous: false, inputs: [], name: "Unpaused" },
   {
     type: "event",
     anonymous: false,
@@ -10375,25 +10333,13 @@ export const klerosCoreNeoImplementationAbi = [
     ],
     name: "Upgraded",
   },
-  {
-    type: "function",
-    inputs: [
-      {
-        name: "_disputeKitAddress",
-        internalType: "contract IDisputeKit",
-        type: "address",
-      },
-    ],
-    name: "addNewDisputeKit",
-    outputs: [],
-    stateMutability: "nonpayable",
-  },
   {
     type: "function",
     inputs: [
       { name: "_disputeID", internalType: "uint256", type: "uint256" },
       { name: "_numberOfChoices", internalType: "uint256", type: "uint256" },
-      { name: "_extraData", internalType: "bytes", type: "bytes" },
+      { name: "", internalType: "bytes", type: "bytes" },
+      { name: "_jump", internalType: "bool", type: "bool" },
     ],
     name: "appeal",
     outputs: [],
@@ -10401,28 +10347,14 @@ export const klerosCoreNeoImplementationAbi = [
   },
   {
     type: "function",
-    inputs: [{ name: "_disputeID", internalType: "uint256", type: "uint256" }],
+    inputs: [
+      { name: "_disputeID", internalType: "uint256", type: "uint256" },
+      { name: "_jump", internalType: "bool", type: "bool" },
+    ],
     name: "appealCost",
     outputs: [{ name: "cost", internalType: "uint256", type: "uint256" }],
     stateMutability: "view",
   },
-  {
-    type: "function",
-    inputs: [{ name: "_disputeID", internalType: "uint256", type: "uint256" }],
-    name: "appealPeriod",
-    outputs: [
-      { name: "start", internalType: "uint256", type: "uint256" },
-      { name: "end", internalType: "uint256", type: "uint256" },
-    ],
-    stateMutability: "view",
-  },
-  {
-    type: "function",
-    inputs: [{ name: "", internalType: "address", type: "address" }],
-    name: "arbitrableWhitelist",
-    outputs: [{ name: "", internalType: "bool", type: "bool" }],
-    stateMutability: "view",
-  },
   {
     type: "function",
     inputs: [
@@ -10450,16 +10382,6 @@ export const klerosCoreNeoImplementationAbi = [
     outputs: [],
     stateMutability: "nonpayable",
   },
-  {
-    type: "function",
-    inputs: [
-      { name: "_arbitrable", internalType: "address", type: "address" },
-      { name: "_allowed", internalType: "bool", type: "bool" },
-    ],
-    name: "changeArbitrableWhitelist",
-    outputs: [],
-    stateMutability: "nonpayable",
-  },
   {
     type: "function",
     inputs: [
@@ -10499,15 +10421,22 @@ export const klerosCoreNeoImplementationAbi = [
   },
   {
     type: "function",
-    inputs: [{ name: "_guardian", internalType: "address", type: "address" }],
-    name: "changeGuardian",
+    inputs: [{ name: "_pinakion", internalType: "contract IERC20", type: "address" }],
+    name: "changePinakion",
     outputs: [],
     stateMutability: "nonpayable",
   },
   {
     type: "function",
-    inputs: [{ name: "_jurorNft", internalType: "contract IERC721", type: "address" }],
-    name: "changeJurorNft",
+    inputs: [
+      {
+        name: "_arbitrable",
+        internalType: "contract IArbitrableV2",
+        type: "address",
+      },
+      { name: "_newRuler", internalType: "address", type: "address" },
+    ],
+    name: "changeRuler",
     outputs: [],
     stateMutability: "nonpayable",
   },
@@ -10515,19 +10444,28 @@ export const klerosCoreNeoImplementationAbi = [
     type: "function",
     inputs: [
       {
-        name: "_jurorProsecutionModule",
-        internalType: "address",
+        name: "_arbitrable",
+        internalType: "contract IArbitrableV2",
         type: "address",
       },
+      { name: "_presetRuling", internalType: "uint256", type: "uint256" },
+      { name: "_presetTied", internalType: "bool", type: "bool" },
+      { name: "_presetOverridden", internalType: "bool", type: "bool" },
     ],
-    name: "changeJurorProsecutionModule",
+    name: "changeRulingModeToAutomaticPreset",
     outputs: [],
     stateMutability: "nonpayable",
   },
   {
     type: "function",
-    inputs: [{ name: "_pinakion", internalType: "contract IERC20", type: "address" }],
-    name: "changePinakion",
+    inputs: [
+      {
+        name: "_arbitrable",
+        internalType: "contract IArbitrableV2",
+        type: "address",
+      },
+    ],
+    name: "changeRulingModeToAutomaticRandom",
     outputs: [],
     stateMutability: "nonpayable",
   },
@@ -10535,12 +10473,12 @@ export const klerosCoreNeoImplementationAbi = [
     type: "function",
     inputs: [
       {
-        name: "_sortitionModule",
-        internalType: "contract ISortitionModule",
+        name: "_arbitrable",
+        internalType: "contract IArbitrableV2",
         type: "address",
       },
     ],
-    name: "changeSortitionModule",
+    name: "changeRulingModeToManual",
     outputs: [],
     stateMutability: "nonpayable",
   },
@@ -10583,12 +10521,6 @@ export const klerosCoreNeoImplementationAbi = [
         internalType: "uint256[4]",
         type: "uint256[4]",
       },
-      { name: "_sortitionExtraData", internalType: "bytes", type: "bytes" },
-      {
-        name: "_supportedDisputeKits",
-        internalType: "uint256[]",
-        type: "uint256[]",
-      },
     ],
     name: "createCourt",
     outputs: [],
@@ -10638,13 +10570,6 @@ export const klerosCoreNeoImplementationAbi = [
     ],
     stateMutability: "view",
   },
-  {
-    type: "function",
-    inputs: [{ name: "", internalType: "uint256", type: "uint256" }],
-    name: "disputeKits",
-    outputs: [{ name: "", internalType: "contract IDisputeKit", type: "address" }],
-    stateMutability: "view",
-  },
   {
     type: "function",
     inputs: [{ name: "", internalType: "uint256", type: "uint256" }],
@@ -10658,41 +10583,18 @@ export const klerosCoreNeoImplementationAbi = [
       },
       {
         name: "period",
-        internalType: "enum KlerosCoreBase.Period",
+        internalType: "enum KlerosCoreRuler.Period",
         type: "uint8",
       },
       { name: "ruled", internalType: "bool", type: "bool" },
-      { name: "lastPeriodChange", internalType: "uint256", type: "uint256" },
     ],
     stateMutability: "view",
   },
-  {
-    type: "function",
-    inputs: [
-      { name: "_disputeID", internalType: "uint256", type: "uint256" },
-      { name: "_iterations", internalType: "uint256", type: "uint256" },
-    ],
-    name: "draw",
-    outputs: [{ name: "nbDrawnJurors", internalType: "uint256", type: "uint256" }],
-    stateMutability: "nonpayable",
-  },
-  {
-    type: "function",
-    inputs: [
-      { name: "_courtID", internalType: "uint96", type: "uint96" },
-      { name: "_disputeKitIDs", internalType: "uint256[]", type: "uint256[]" },
-      { name: "_enable", internalType: "bool", type: "bool" },
-    ],
-    name: "enableDisputeKits",
-    outputs: [],
-    stateMutability: "nonpayable",
-  },
   {
     type: "function",
     inputs: [
       { name: "_disputeID", internalType: "uint256", type: "uint256" },
       { name: "_round", internalType: "uint256", type: "uint256" },
-      { name: "_iterations", internalType: "uint256", type: "uint256" },
     ],
     name: "execute",
     outputs: [],
@@ -10711,7 +10613,12 @@ export const klerosCoreNeoImplementationAbi = [
   },
   {
     type: "function",
-    inputs: [{ name: "_disputeID", internalType: "uint256", type: "uint256" }],
+    inputs: [
+      { name: "_disputeID", internalType: "uint256", type: "uint256" },
+      { name: "_ruling", internalType: "uint256", type: "uint256" },
+      { name: "tied", internalType: "bool", type: "bool" },
+      { name: "overridden", internalType: "bool", type: "bool" },
+    ],
     name: "executeRuling",
     outputs: [],
     stateMutability: "nonpayable",
@@ -10719,7 +10626,7 @@ export const klerosCoreNeoImplementationAbi = [
   {
     type: "function",
     inputs: [],
-    name: "getDisputeKitsLength",
+    name: "getNextDisputeID",
     outputs: [{ name: "", internalType: "uint256", type: "uint256" }],
     stateMutability: "view",
   },
@@ -10737,16 +10644,6 @@ export const klerosCoreNeoImplementationAbi = [
     outputs: [{ name: "", internalType: "uint256", type: "uint256" }],
     stateMutability: "view",
   },
-  {
-    type: "function",
-    inputs: [
-      { name: "_disputeID", internalType: "uint256", type: "uint256" },
-      { name: "_round", internalType: "uint256", type: "uint256" },
-    ],
-    name: "getPnkAtStakePerJuror",
-    outputs: [{ name: "", internalType: "uint256", type: "uint256" }],
-    stateMutability: "view",
-  },
   {
     type: "function",
     inputs: [
@@ -10757,40 +10654,24 @@ export const klerosCoreNeoImplementationAbi = [
     outputs: [
       {
         name: "",
-        internalType: "struct KlerosCoreBase.Round",
+        internalType: "struct KlerosCoreRuler.Round",
         type: "tuple",
         components: [
-          { name: "disputeKitID", internalType: "uint256", type: "uint256" },
-          {
-            name: "pnkAtStakePerJuror",
-            internalType: "uint256",
-            type: "uint256",
-          },
           {
             name: "totalFeesForJurors",
             internalType: "uint256",
             type: "uint256",
           },
-          { name: "nbVotes", internalType: "uint256", type: "uint256" },
-          { name: "repartitions", internalType: "uint256", type: "uint256" },
-          { name: "pnkPenalties", internalType: "uint256", type: "uint256" },
-          { name: "drawnJurors", internalType: "address[]", type: "address[]" },
           {
             name: "sumFeeRewardPaid",
             internalType: "uint256",
             type: "uint256",
           },
-          {
-            name: "sumPnkRewardPaid",
-            internalType: "uint256",
-            type: "uint256",
-          },
           {
             name: "feeToken",
             internalType: "contract IERC20",
             type: "address",
           },
-          { name: "drawIterations", internalType: "uint256", type: "uint256" },
         ],
       },
     ],
@@ -10816,257 +10697,125 @@ export const klerosCoreNeoImplementationAbi = [
     outputs: [{ name: "", internalType: "address", type: "address" }],
     stateMutability: "view",
   },
-  {
-    type: "function",
-    inputs: [],
-    name: "guardian",
-    outputs: [{ name: "", internalType: "address", type: "address" }],
-    stateMutability: "view",
-  },
   {
     type: "function",
     inputs: [
       { name: "_governor", internalType: "address", type: "address" },
-      { name: "_guardian", internalType: "address", type: "address" },
       { name: "_pinakion", internalType: "contract IERC20", type: "address" },
-      {
-        name: "_jurorProsecutionModule",
-        internalType: "address",
-        type: "address",
-      },
-      {
-        name: "_disputeKit",
-        internalType: "contract IDisputeKit",
-        type: "address",
-      },
-      { name: "_hiddenVotes", internalType: "bool", type: "bool" },
       {
         name: "_courtParameters",
         internalType: "uint256[4]",
         type: "uint256[4]",
       },
-      {
-        name: "_timesPerPeriod",
-        internalType: "uint256[4]",
-        type: "uint256[4]",
-      },
-      { name: "_sortitionExtraData", internalType: "bytes", type: "bytes" },
-      {
-        name: "_sortitionModuleAddress",
-        internalType: "contract ISortitionModule",
-        type: "address",
-      },
-      { name: "_jurorNft", internalType: "contract IERC721", type: "address" },
-      { name: "_wNative", internalType: "address", type: "address" },
     ],
     name: "initialize",
     outputs: [],
     stateMutability: "nonpayable",
   },
-  {
-    type: "function",
-    inputs: [{ name: "_disputeID", internalType: "uint256", type: "uint256" }],
-    name: "isDisputeKitJumping",
-    outputs: [{ name: "", internalType: "bool", type: "bool" }],
-    stateMutability: "view",
-  },
-  {
-    type: "function",
-    inputs: [
-      { name: "_courtID", internalType: "uint96", type: "uint96" },
-      { name: "_disputeKitID", internalType: "uint256", type: "uint256" },
-    ],
-    name: "isSupported",
-    outputs: [{ name: "", internalType: "bool", type: "bool" }],
-    stateMutability: "view",
-  },
   {
     type: "function",
     inputs: [],
-    name: "jurorNft",
-    outputs: [{ name: "", internalType: "contract IERC721", type: "address" }],
+    name: "pinakion",
+    outputs: [{ name: "", internalType: "contract IERC20", type: "address" }],
     stateMutability: "view",
   },
   {
     type: "function",
     inputs: [],
-    name: "jurorProsecutionModule",
-    outputs: [{ name: "", internalType: "address", type: "address" }],
+    name: "proxiableUUID",
+    outputs: [{ name: "", internalType: "bytes32", type: "bytes32" }],
     stateMutability: "view",
   },
   {
     type: "function",
-    inputs: [{ name: "_disputeID", internalType: "uint256", type: "uint256" }],
-    name: "passPeriod",
-    outputs: [],
-    stateMutability: "nonpayable",
-  },
-  {
-    type: "function",
-    inputs: [],
-    name: "pause",
-    outputs: [],
-    stateMutability: "nonpayable",
-  },
-  {
-    type: "function",
-    inputs: [],
-    name: "paused",
-    outputs: [{ name: "", internalType: "bool", type: "bool" }],
+    inputs: [
+      {
+        name: "arbitrable",
+        internalType: "contract IArbitrableV2",
+        type: "address",
+      },
+    ],
+    name: "rulers",
+    outputs: [{ name: "ruler", internalType: "address", type: "address" }],
     stateMutability: "view",
   },
   {
     type: "function",
-    inputs: [],
-    name: "pinakion",
-    outputs: [{ name: "", internalType: "contract IERC20", type: "address" }],
+    inputs: [{ name: "disputeID", internalType: "uint256", type: "uint256" }],
+    name: "rulingResults",
+    outputs: [
+      { name: "ruling", internalType: "uint256", type: "uint256" },
+      { name: "tied", internalType: "bool", type: "bool" },
+      { name: "overridden", internalType: "bool", type: "bool" },
+    ],
     stateMutability: "view",
   },
   {
     type: "function",
-    inputs: [],
-    name: "proxiableUUID",
-    outputs: [{ name: "", internalType: "bytes32", type: "bytes32" }],
+    inputs: [
+      {
+        name: "arbitrable",
+        internalType: "contract IArbitrableV2",
+        type: "address",
+      },
+    ],
+    name: "settings",
+    outputs: [
+      {
+        name: "rulingMode",
+        internalType: "enum KlerosCoreRuler.RulingMode",
+        type: "uint8",
+      },
+      { name: "presetRuling", internalType: "uint256", type: "uint256" },
+      { name: "presetTied", internalType: "bool", type: "bool" },
+      { name: "presetOverridden", internalType: "bool", type: "bool" },
+    ],
     stateMutability: "view",
   },
-  {
-    type: "function",
-    inputs: [{ name: "_wNative", internalType: "address", type: "address" }],
-    name: "reinitialize",
-    outputs: [],
-    stateMutability: "nonpayable",
-  },
   {
     type: "function",
     inputs: [
-      { name: "_courtID", internalType: "uint96", type: "uint96" },
-      { name: "_newStake", internalType: "uint256", type: "uint256" },
+      { name: "newImplementation", internalType: "address", type: "address" },
+      { name: "data", internalType: "bytes", type: "bytes" },
     ],
-    name: "setStake",
+    name: "upgradeToAndCall",
     outputs: [],
-    stateMutability: "nonpayable",
+    stateMutability: "payable",
   },
   {
-    type: "function",
+    type: "constructor",
     inputs: [
-      { name: "_account", internalType: "address", type: "address" },
-      { name: "_courtID", internalType: "uint96", type: "uint96" },
-      { name: "_newStake", internalType: "uint256", type: "uint256" },
-    ],
-    name: "setStakeBySortitionModule",
-    outputs: [],
-    stateMutability: "nonpayable",
-  },
-  {
-    type: "function",
-    inputs: [],
-    name: "sortitionModule",
-    outputs: [{ name: "", internalType: "contract ISortitionModule", type: "address" }],
-    stateMutability: "view",
-  },
-  {
-    type: "function",
-    inputs: [
-      { name: "_account", internalType: "address", type: "address" },
-      { name: "_amount", internalType: "uint256", type: "uint256" },
-    ],
-    name: "transferBySortitionModule",
-    outputs: [],
-    stateMutability: "nonpayable",
-  },
-  {
-    type: "function",
-    inputs: [],
-    name: "unpause",
-    outputs: [],
-    stateMutability: "nonpayable",
-  },
-  {
-    type: "function",
-    inputs: [
-      { name: "newImplementation", internalType: "address", type: "address" },
-      { name: "data", internalType: "bytes", type: "bytes" },
-    ],
-    name: "upgradeToAndCall",
-    outputs: [],
-    stateMutability: "payable",
-  },
-  {
-    type: "function",
-    inputs: [],
-    name: "version",
-    outputs: [{ name: "", internalType: "string", type: "string" }],
-    stateMutability: "view",
-  },
-  {
-    type: "function",
-    inputs: [],
-    name: "wNative",
-    outputs: [{ name: "", internalType: "address", type: "address" }],
-    stateMutability: "view",
-  },
-] as const;
-
-/**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xC1210493804eEF123096F9581Ee82B915150E54c)
- */
-export const klerosCoreNeoImplementationAddress = {
-  42161: "0xC1210493804eEF123096F9581Ee82B915150E54c",
-} as const;
-
-/**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xC1210493804eEF123096F9581Ee82B915150E54c)
- */
-export const klerosCoreNeoImplementationConfig = {
-  address: klerosCoreNeoImplementationAddress,
-  abi: klerosCoreNeoImplementationAbi,
-} as const;
-
-//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-// KlerosCoreNeo_Proxy
-//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-
-/**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x991d2df165670b9cac3B022f4B68D65b664222ea)
- */
-export const klerosCoreNeoProxyAbi = [
-  {
-    type: "constructor",
-    inputs: [
-      { name: "_implementation", internalType: "address", type: "address" },
-      { name: "_data", internalType: "bytes", type: "bytes" },
+      { name: "_implementation", internalType: "address", type: "address" },
+      { name: "_data", internalType: "bytes", type: "bytes" },
     ],
     stateMutability: "nonpayable",
   },
-  { type: "fallback", stateMutability: "payable" },
-  { type: "receive", stateMutability: "payable" },
 ] as const;
 
 /**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x991d2df165670b9cac3B022f4B68D65b664222ea)
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xc0169e0B19aE02ac4fADD689260CF038726DFE13)
  */
-export const klerosCoreNeoProxyAddress = {
-  42161: "0x991d2df165670b9cac3B022f4B68D65b664222ea",
+export const klerosCoreRulerAddress = {
+  42161: "0xc0169e0B19aE02ac4fADD689260CF038726DFE13",
 } as const;
 
 /**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x991d2df165670b9cac3B022f4B68D65b664222ea)
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xc0169e0B19aE02ac4fADD689260CF038726DFE13)
  */
-export const klerosCoreNeoProxyConfig = {
-  address: klerosCoreNeoProxyAddress,
-  abi: klerosCoreNeoProxyAbi,
+export const klerosCoreRulerConfig = {
+  address: klerosCoreRulerAddress,
+  abi: klerosCoreRulerAbi,
 } as const;
 
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-// KlerosCoreRulerNeo
+// KlerosCoreRuler_Implementation
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xc0169e0B19aE02ac4fADD689260CF038726DFE13)
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x85093b5EDa4F2e2E2fEDae34Da91239D6a08e324)
  */
-export const klerosCoreRulerNeoAbi = [
-  { type: "fallback", stateMutability: "payable" },
-  { type: "receive", stateMutability: "payable" },
+export const klerosCoreRulerImplementationAbi = [
+  { type: "constructor", inputs: [], stateMutability: "nonpayable" },
   { type: "error", inputs: [], name: "AlreadyInitialized" },
   { type: "error", inputs: [], name: "AppealFeesNotEnough" },
   { type: "error", inputs: [], name: "ArbitrationFeesNotEnough" },
@@ -12022,6 +11771,31 @@ export const klerosCoreRulerNeoAbi = [
     outputs: [],
     stateMutability: "payable",
   },
+] as const;
+
+/**
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x85093b5EDa4F2e2E2fEDae34Da91239D6a08e324)
+ */
+export const klerosCoreRulerImplementationAddress = {
+  42161: "0x85093b5EDa4F2e2E2fEDae34Da91239D6a08e324",
+} as const;
+
+/**
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x85093b5EDa4F2e2E2fEDae34Da91239D6a08e324)
+ */
+export const klerosCoreRulerImplementationConfig = {
+  address: klerosCoreRulerImplementationAddress,
+  abi: klerosCoreRulerImplementationAbi,
+} as const;
+
+//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+// KlerosCoreRuler_Proxy
+//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+
+/**
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xc0169e0B19aE02ac4fADD689260CF038726DFE13)
+ */
+export const klerosCoreRulerProxyAbi = [
   {
     type: "constructor",
     inputs: [
@@ -12030,50 +11804,161 @@ export const klerosCoreRulerNeoAbi = [
     ],
     stateMutability: "nonpayable",
   },
+  { type: "fallback", stateMutability: "payable" },
+  { type: "receive", stateMutability: "payable" },
 ] as const;
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xc0169e0B19aE02ac4fADD689260CF038726DFE13)
  */
-export const klerosCoreRulerNeoAddress = {
+export const klerosCoreRulerProxyAddress = {
   42161: "0xc0169e0B19aE02ac4fADD689260CF038726DFE13",
 } as const;
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xc0169e0B19aE02ac4fADD689260CF038726DFE13)
  */
-export const klerosCoreRulerNeoConfig = {
-  address: klerosCoreRulerNeoAddress,
-  abi: klerosCoreRulerNeoAbi,
+export const klerosCoreRulerProxyConfig = {
+  address: klerosCoreRulerProxyAddress,
+  abi: klerosCoreRulerProxyAbi,
 } as const;
 
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-// KlerosCoreRulerNeo_Implementation
+// KlerosCoreSnapshotProxy
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x85093b5EDa4F2e2E2fEDae34Da91239D6a08e324)
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xEF719a5B3352F607e6C4E17b7e0cDAd8322fEC95)
+ */
+export const klerosCoreSnapshotProxyAbi = [
+  {
+    type: "constructor",
+    inputs: [
+      { name: "_governor", internalType: "address", type: "address" },
+      { name: "_core", internalType: "contract IKlerosCore", type: "address" },
+    ],
+    stateMutability: "nonpayable",
+  },
+  {
+    type: "function",
+    inputs: [{ name: "_account", internalType: "address", type: "address" }],
+    name: "balanceOf",
+    outputs: [{ name: "totalStaked", internalType: "uint256", type: "uint256" }],
+    stateMutability: "view",
+  },
+  {
+    type: "function",
+    inputs: [{ name: "_core", internalType: "contract IKlerosCore", type: "address" }],
+    name: "changeCore",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
+  {
+    type: "function",
+    inputs: [{ name: "_governor", internalType: "address", type: "address" }],
+    name: "changeGovernor",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
+  {
+    type: "function",
+    inputs: [],
+    name: "core",
+    outputs: [{ name: "", internalType: "contract IKlerosCore", type: "address" }],
+    stateMutability: "view",
+  },
+  {
+    type: "function",
+    inputs: [],
+    name: "decimals",
+    outputs: [{ name: "", internalType: "uint8", type: "uint8" }],
+    stateMutability: "view",
+  },
+  {
+    type: "function",
+    inputs: [],
+    name: "governor",
+    outputs: [{ name: "", internalType: "address", type: "address" }],
+    stateMutability: "view",
+  },
+  {
+    type: "function",
+    inputs: [],
+    name: "name",
+    outputs: [{ name: "", internalType: "string", type: "string" }],
+    stateMutability: "view",
+  },
+  {
+    type: "function",
+    inputs: [],
+    name: "symbol",
+    outputs: [{ name: "", internalType: "string", type: "string" }],
+    stateMutability: "view",
+  },
+] as const;
+
+/**
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xEF719a5B3352F607e6C4E17b7e0cDAd8322fEC95)
+ */
+export const klerosCoreSnapshotProxyAddress = {
+  42161: "0xEF719a5B3352F607e6C4E17b7e0cDAd8322fEC95",
+} as const;
+
+/**
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xEF719a5B3352F607e6C4E17b7e0cDAd8322fEC95)
+ */
+export const klerosCoreSnapshotProxyConfig = {
+  address: klerosCoreSnapshotProxyAddress,
+  abi: klerosCoreSnapshotProxyAbi,
+} as const;
+
+//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+// KlerosCore_Implementation
+//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+
+/**
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xC1210493804eEF123096F9581Ee82B915150E54c)
  */
-export const klerosCoreRulerNeoImplementationAbi = [
+export const klerosCoreImplementationAbi = [
   { type: "constructor", inputs: [], stateMutability: "nonpayable" },
   { type: "error", inputs: [], name: "AlreadyInitialized" },
   { type: "error", inputs: [], name: "AppealFeesNotEnough" },
+  { type: "error", inputs: [], name: "AppealPeriodNotPassed" },
+  { type: "error", inputs: [], name: "ArbitrableNotWhitelisted" },
   { type: "error", inputs: [], name: "ArbitrationFeesNotEnough" },
+  { type: "error", inputs: [], name: "CannotDisableClassicDK" },
+  { type: "error", inputs: [], name: "CommitPeriodNotPassed" },
+  { type: "error", inputs: [], name: "DisputeKitNotSupportedByCourt" },
+  { type: "error", inputs: [], name: "DisputeKitOnly" },
   { type: "error", inputs: [], name: "DisputeNotAppealable" },
+  { type: "error", inputs: [], name: "DisputePeriodIsFinal" },
+  { type: "error", inputs: [], name: "DisputeStillDrawing" },
+  { type: "error", inputs: [], name: "EvidenceNotPassedAndNotAppeal" },
   { type: "error", inputs: [], name: "FailedDelegateCall" },
   { type: "error", inputs: [], name: "GovernorOnly" },
-  { type: "error", inputs: [], name: "GovernorOrInstructorOnly" },
+  { type: "error", inputs: [], name: "GuardianOrGovernorOnly" },
+  { type: "error", inputs: [], name: "InvalidDisputKitParent" },
   { type: "error", inputs: [], name: "InvalidForkingCourtAsParent" },
   {
     type: "error",
     inputs: [{ name: "implementation", internalType: "address", type: "address" }],
     name: "InvalidImplementation",
   },
-  { type: "error", inputs: [], name: "NoRulerSet" },
+  { type: "error", inputs: [], name: "MinStakeLowerThanParentCourt" },
+  { type: "error", inputs: [], name: "MustSupportDisputeKitClassic" },
+  { type: "error", inputs: [], name: "NotEligibleForStaking" },
+  { type: "error", inputs: [], name: "NotEvidencePeriod" },
+  { type: "error", inputs: [], name: "NotExecutionPeriod" },
   { type: "error", inputs: [], name: "NotInitializing" },
-  { type: "error", inputs: [], name: "RulerOnly" },
   { type: "error", inputs: [], name: "RulingAlreadyExecuted" },
-  { type: "error", inputs: [], name: "RulingModeNotSet" },
+  { type: "error", inputs: [], name: "SortitionModuleOnly" },
+  { type: "error", inputs: [], name: "StakingInTooManyCourts" },
+  { type: "error", inputs: [], name: "StakingLessThanCourtMinStake" },
+  { type: "error", inputs: [], name: "StakingMoreThanMaxStakePerJuror" },
+  { type: "error", inputs: [], name: "StakingMoreThanMaxTotalStaked" },
+  { type: "error", inputs: [], name: "StakingNotPossibleInThisCourt" },
+  { type: "error", inputs: [], name: "StakingTransferFailed" },
+  { type: "error", inputs: [], name: "StakingZeroWhenNoStake" },
   { type: "error", inputs: [], name: "TokenNotAccepted" },
   { type: "error", inputs: [], name: "TransferFailed" },
   { type: "error", inputs: [], name: "UUPSUnauthorizedCallContext" },
@@ -12082,7 +11967,13 @@ export const klerosCoreRulerNeoImplementationAbi = [
     inputs: [{ name: "slot", internalType: "bytes32", type: "bytes32" }],
     name: "UUPSUnsupportedProxiableUUID",
   },
+  { type: "error", inputs: [], name: "UnstakingTransferFailed" },
   { type: "error", inputs: [], name: "UnsuccessfulCall" },
+  { type: "error", inputs: [], name: "UnsupportedDisputeKit" },
+  { type: "error", inputs: [], name: "VotePeriodNotPassed" },
+  { type: "error", inputs: [], name: "WhenNotPausedOnly" },
+  { type: "error", inputs: [], name: "WhenPausedOnly" },
+  { type: "error", inputs: [], name: "WrongDisputeKitIndex" },
   {
     type: "event",
     anonymous: false,
@@ -12140,60 +12031,22 @@ export const klerosCoreRulerNeoImplementationAbi = [
     anonymous: false,
     inputs: [
       {
-        name: "_arbitrable",
-        internalType: "contract IArbitrableV2",
-        type: "address",
+        name: "_courtID",
+        internalType: "uint96",
+        type: "uint96",
         indexed: true,
       },
       {
-        name: "mode",
-        internalType: "enum KlerosCoreRuler.RulingMode",
-        type: "uint8",
+        name: "_parent",
+        internalType: "uint96",
+        type: "uint96",
         indexed: true,
       },
       {
-        name: "_disputeID",
-        internalType: "uint256",
-        type: "uint256",
-        indexed: true,
-      },
-      {
-        name: "_ruling",
-        internalType: "uint256",
-        type: "uint256",
-        indexed: false,
-      },
-      { name: "tied", internalType: "bool", type: "bool", indexed: false },
-      {
-        name: "overridden",
-        internalType: "bool",
-        type: "bool",
-        indexed: false,
-      },
-    ],
-    name: "AutoRuled",
-  },
-  {
-    type: "event",
-    anonymous: false,
-    inputs: [
-      {
-        name: "_courtID",
-        internalType: "uint256",
-        type: "uint256",
-        indexed: true,
-      },
-      {
-        name: "_parent",
-        internalType: "uint96",
-        type: "uint96",
-        indexed: true,
-      },
-      {
-        name: "_hiddenVotes",
-        internalType: "bool",
-        type: "bool",
-        indexed: false,
+        name: "_hiddenVotes",
+        internalType: "bool",
+        type: "bool",
+        indexed: false,
       },
       {
         name: "_minStake",
@@ -12225,6 +12078,12 @@ export const klerosCoreRulerNeoImplementationAbi = [
         type: "uint256[4]",
         indexed: false,
       },
+      {
+        name: "_supportedDisputeKits",
+        internalType: "uint256[]",
+        type: "uint256[]",
+        indexed: false,
+      },
     ],
     name: "CourtCreated",
   },
@@ -12327,6 +12186,107 @@ export const klerosCoreRulerNeoImplementationAbi = [
     ],
     name: "DisputeCreation",
   },
+  {
+    type: "event",
+    anonymous: false,
+    inputs: [
+      {
+        name: "_disputeKitID",
+        internalType: "uint256",
+        type: "uint256",
+        indexed: true,
+      },
+      {
+        name: "_disputeKitAddress",
+        internalType: "contract IDisputeKit",
+        type: "address",
+        indexed: true,
+      },
+    ],
+    name: "DisputeKitCreated",
+  },
+  {
+    type: "event",
+    anonymous: false,
+    inputs: [
+      {
+        name: "_courtID",
+        internalType: "uint96",
+        type: "uint96",
+        indexed: true,
+      },
+      {
+        name: "_disputeKitID",
+        internalType: "uint256",
+        type: "uint256",
+        indexed: true,
+      },
+      { name: "_enable", internalType: "bool", type: "bool", indexed: true },
+    ],
+    name: "DisputeKitEnabled",
+  },
+  {
+    type: "event",
+    anonymous: false,
+    inputs: [
+      {
+        name: "_disputeID",
+        internalType: "uint256",
+        type: "uint256",
+        indexed: true,
+      },
+      {
+        name: "_roundID",
+        internalType: "uint256",
+        type: "uint256",
+        indexed: true,
+      },
+      {
+        name: "_fromDisputeKitID",
+        internalType: "uint256",
+        type: "uint256",
+        indexed: true,
+      },
+      {
+        name: "_toDisputeKitID",
+        internalType: "uint256",
+        type: "uint256",
+        indexed: false,
+      },
+    ],
+    name: "DisputeKitJump",
+  },
+  {
+    type: "event",
+    anonymous: false,
+    inputs: [
+      {
+        name: "_address",
+        internalType: "address",
+        type: "address",
+        indexed: true,
+      },
+      {
+        name: "_disputeID",
+        internalType: "uint256",
+        type: "uint256",
+        indexed: true,
+      },
+      {
+        name: "_roundID",
+        internalType: "uint256",
+        type: "uint256",
+        indexed: false,
+      },
+      {
+        name: "_voteID",
+        internalType: "uint256",
+        type: "uint256",
+        indexed: false,
+      },
+    ],
+    name: "Draw",
+  },
   {
     type: "event",
     anonymous: false,
@@ -12414,67 +12374,14 @@ export const klerosCoreRulerNeoImplementationAbi = [
       },
       {
         name: "_period",
-        internalType: "enum KlerosCoreRuler.Period",
+        internalType: "enum KlerosCoreBase.Period",
         type: "uint8",
         indexed: false,
       },
     ],
     name: "NewPeriod",
   },
-  {
-    type: "event",
-    anonymous: false,
-    inputs: [
-      {
-        name: "_arbitrable",
-        internalType: "contract IArbitrableV2",
-        type: "address",
-        indexed: true,
-      },
-      {
-        name: "_oldRuler",
-        internalType: "address",
-        type: "address",
-        indexed: true,
-      },
-      {
-        name: "_newRuler",
-        internalType: "address",
-        type: "address",
-        indexed: true,
-      },
-    ],
-    name: "RulerChanged",
-  },
-  {
-    type: "event",
-    anonymous: false,
-    inputs: [
-      {
-        name: "_arbitrable",
-        internalType: "contract IArbitrableV2",
-        type: "address",
-        indexed: true,
-      },
-      {
-        name: "_settings",
-        internalType: "struct KlerosCoreRuler.RulerSettings",
-        type: "tuple",
-        components: [
-          {
-            name: "rulingMode",
-            internalType: "enum KlerosCoreRuler.RulingMode",
-            type: "uint8",
-          },
-          { name: "presetRuling", internalType: "uint256", type: "uint256" },
-          { name: "presetTied", internalType: "bool", type: "bool" },
-          { name: "presetOverridden", internalType: "bool", type: "bool" },
-        ],
-        indexed: false,
-      },
-    ],
-    name: "RulerSettingsChanged",
-  },
+  { type: "event", anonymous: false, inputs: [], name: "Paused" },
   {
     type: "event",
     anonymous: false,
@@ -12549,6 +12456,7 @@ export const klerosCoreRulerNeoImplementationAbi = [
     ],
     name: "TokenAndETHShift",
   },
+  { type: "event", anonymous: false, inputs: [], name: "Unpaused" },
   {
     type: "event",
     anonymous: false,
@@ -12562,13 +12470,25 @@ export const klerosCoreRulerNeoImplementationAbi = [
     ],
     name: "Upgraded",
   },
+  {
+    type: "function",
+    inputs: [
+      {
+        name: "_disputeKitAddress",
+        internalType: "contract IDisputeKit",
+        type: "address",
+      },
+    ],
+    name: "addNewDisputeKit",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
   {
     type: "function",
     inputs: [
       { name: "_disputeID", internalType: "uint256", type: "uint256" },
       { name: "_numberOfChoices", internalType: "uint256", type: "uint256" },
-      { name: "", internalType: "bytes", type: "bytes" },
-      { name: "_jump", internalType: "bool", type: "bool" },
+      { name: "_extraData", internalType: "bytes", type: "bytes" },
     ],
     name: "appeal",
     outputs: [],
@@ -12576,14 +12496,28 @@ export const klerosCoreRulerNeoImplementationAbi = [
   },
   {
     type: "function",
-    inputs: [
-      { name: "_disputeID", internalType: "uint256", type: "uint256" },
-      { name: "_jump", internalType: "bool", type: "bool" },
-    ],
+    inputs: [{ name: "_disputeID", internalType: "uint256", type: "uint256" }],
     name: "appealCost",
     outputs: [{ name: "cost", internalType: "uint256", type: "uint256" }],
     stateMutability: "view",
   },
+  {
+    type: "function",
+    inputs: [{ name: "_disputeID", internalType: "uint256", type: "uint256" }],
+    name: "appealPeriod",
+    outputs: [
+      { name: "start", internalType: "uint256", type: "uint256" },
+      { name: "end", internalType: "uint256", type: "uint256" },
+    ],
+    stateMutability: "view",
+  },
+  {
+    type: "function",
+    inputs: [{ name: "", internalType: "address", type: "address" }],
+    name: "arbitrableWhitelist",
+    outputs: [{ name: "", internalType: "bool", type: "bool" }],
+    stateMutability: "view",
+  },
   {
     type: "function",
     inputs: [
@@ -12611,6 +12545,16 @@ export const klerosCoreRulerNeoImplementationAbi = [
     outputs: [],
     stateMutability: "nonpayable",
   },
+  {
+    type: "function",
+    inputs: [
+      { name: "_arbitrable", internalType: "address", type: "address" },
+      { name: "_allowed", internalType: "bool", type: "bool" },
+    ],
+    name: "changeArbitrableWhitelist",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
   {
     type: "function",
     inputs: [
@@ -12650,22 +12594,15 @@ export const klerosCoreRulerNeoImplementationAbi = [
   },
   {
     type: "function",
-    inputs: [{ name: "_pinakion", internalType: "contract IERC20", type: "address" }],
-    name: "changePinakion",
+    inputs: [{ name: "_guardian", internalType: "address", type: "address" }],
+    name: "changeGuardian",
     outputs: [],
     stateMutability: "nonpayable",
   },
   {
     type: "function",
-    inputs: [
-      {
-        name: "_arbitrable",
-        internalType: "contract IArbitrableV2",
-        type: "address",
-      },
-      { name: "_newRuler", internalType: "address", type: "address" },
-    ],
-    name: "changeRuler",
+    inputs: [{ name: "_jurorNft", internalType: "contract IERC721", type: "address" }],
+    name: "changeJurorNft",
     outputs: [],
     stateMutability: "nonpayable",
   },
@@ -12673,28 +12610,19 @@ export const klerosCoreRulerNeoImplementationAbi = [
     type: "function",
     inputs: [
       {
-        name: "_arbitrable",
-        internalType: "contract IArbitrableV2",
+        name: "_jurorProsecutionModule",
+        internalType: "address",
         type: "address",
       },
-      { name: "_presetRuling", internalType: "uint256", type: "uint256" },
-      { name: "_presetTied", internalType: "bool", type: "bool" },
-      { name: "_presetOverridden", internalType: "bool", type: "bool" },
     ],
-    name: "changeRulingModeToAutomaticPreset",
+    name: "changeJurorProsecutionModule",
     outputs: [],
     stateMutability: "nonpayable",
   },
   {
     type: "function",
-    inputs: [
-      {
-        name: "_arbitrable",
-        internalType: "contract IArbitrableV2",
-        type: "address",
-      },
-    ],
-    name: "changeRulingModeToAutomaticRandom",
+    inputs: [{ name: "_pinakion", internalType: "contract IERC20", type: "address" }],
+    name: "changePinakion",
     outputs: [],
     stateMutability: "nonpayable",
   },
@@ -12702,12 +12630,12 @@ export const klerosCoreRulerNeoImplementationAbi = [
     type: "function",
     inputs: [
       {
-        name: "_arbitrable",
-        internalType: "contract IArbitrableV2",
+        name: "_sortitionModule",
+        internalType: "contract ISortitionModule",
         type: "address",
       },
     ],
-    name: "changeRulingModeToManual",
+    name: "changeSortitionModule",
     outputs: [],
     stateMutability: "nonpayable",
   },
@@ -12750,6 +12678,12 @@ export const klerosCoreRulerNeoImplementationAbi = [
         internalType: "uint256[4]",
         type: "uint256[4]",
       },
+      { name: "_sortitionExtraData", internalType: "bytes", type: "bytes" },
+      {
+        name: "_supportedDisputeKits",
+        internalType: "uint256[]",
+        type: "uint256[]",
+      },
     ],
     name: "createCourt",
     outputs: [],
@@ -12799,6 +12733,13 @@ export const klerosCoreRulerNeoImplementationAbi = [
     ],
     stateMutability: "view",
   },
+  {
+    type: "function",
+    inputs: [{ name: "", internalType: "uint256", type: "uint256" }],
+    name: "disputeKits",
+    outputs: [{ name: "", internalType: "contract IDisputeKit", type: "address" }],
+    stateMutability: "view",
+  },
   {
     type: "function",
     inputs: [{ name: "", internalType: "uint256", type: "uint256" }],
@@ -12812,18 +12753,41 @@ export const klerosCoreRulerNeoImplementationAbi = [
       },
       {
         name: "period",
-        internalType: "enum KlerosCoreRuler.Period",
+        internalType: "enum KlerosCoreBase.Period",
         type: "uint8",
       },
       { name: "ruled", internalType: "bool", type: "bool" },
+      { name: "lastPeriodChange", internalType: "uint256", type: "uint256" },
     ],
     stateMutability: "view",
   },
+  {
+    type: "function",
+    inputs: [
+      { name: "_disputeID", internalType: "uint256", type: "uint256" },
+      { name: "_iterations", internalType: "uint256", type: "uint256" },
+    ],
+    name: "draw",
+    outputs: [{ name: "nbDrawnJurors", internalType: "uint256", type: "uint256" }],
+    stateMutability: "nonpayable",
+  },
+  {
+    type: "function",
+    inputs: [
+      { name: "_courtID", internalType: "uint96", type: "uint96" },
+      { name: "_disputeKitIDs", internalType: "uint256[]", type: "uint256[]" },
+      { name: "_enable", internalType: "bool", type: "bool" },
+    ],
+    name: "enableDisputeKits",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
   {
     type: "function",
     inputs: [
       { name: "_disputeID", internalType: "uint256", type: "uint256" },
       { name: "_round", internalType: "uint256", type: "uint256" },
+      { name: "_iterations", internalType: "uint256", type: "uint256" },
     ],
     name: "execute",
     outputs: [],
@@ -12842,12 +12806,7 @@ export const klerosCoreRulerNeoImplementationAbi = [
   },
   {
     type: "function",
-    inputs: [
-      { name: "_disputeID", internalType: "uint256", type: "uint256" },
-      { name: "_ruling", internalType: "uint256", type: "uint256" },
-      { name: "tied", internalType: "bool", type: "bool" },
-      { name: "overridden", internalType: "bool", type: "bool" },
-    ],
+    inputs: [{ name: "_disputeID", internalType: "uint256", type: "uint256" }],
     name: "executeRuling",
     outputs: [],
     stateMutability: "nonpayable",
@@ -12855,7 +12814,7 @@ export const klerosCoreRulerNeoImplementationAbi = [
   {
     type: "function",
     inputs: [],
-    name: "getNextDisputeID",
+    name: "getDisputeKitsLength",
     outputs: [{ name: "", internalType: "uint256", type: "uint256" }],
     stateMutability: "view",
   },
@@ -12873,6 +12832,16 @@ export const klerosCoreRulerNeoImplementationAbi = [
     outputs: [{ name: "", internalType: "uint256", type: "uint256" }],
     stateMutability: "view",
   },
+  {
+    type: "function",
+    inputs: [
+      { name: "_disputeID", internalType: "uint256", type: "uint256" },
+      { name: "_round", internalType: "uint256", type: "uint256" },
+    ],
+    name: "getPnkAtStakePerJuror",
+    outputs: [{ name: "", internalType: "uint256", type: "uint256" }],
+    stateMutability: "view",
+  },
   {
     type: "function",
     inputs: [
@@ -12883,24 +12852,40 @@ export const klerosCoreRulerNeoImplementationAbi = [
     outputs: [
       {
         name: "",
-        internalType: "struct KlerosCoreRuler.Round",
+        internalType: "struct KlerosCoreBase.Round",
         type: "tuple",
         components: [
+          { name: "disputeKitID", internalType: "uint256", type: "uint256" },
+          {
+            name: "pnkAtStakePerJuror",
+            internalType: "uint256",
+            type: "uint256",
+          },
           {
             name: "totalFeesForJurors",
             internalType: "uint256",
             type: "uint256",
           },
+          { name: "nbVotes", internalType: "uint256", type: "uint256" },
+          { name: "repartitions", internalType: "uint256", type: "uint256" },
+          { name: "pnkPenalties", internalType: "uint256", type: "uint256" },
+          { name: "drawnJurors", internalType: "address[]", type: "address[]" },
           {
             name: "sumFeeRewardPaid",
             internalType: "uint256",
             type: "uint256",
           },
+          {
+            name: "sumPnkRewardPaid",
+            internalType: "uint256",
+            type: "uint256",
+          },
           {
             name: "feeToken",
             internalType: "contract IERC20",
             type: "address",
           },
+          { name: "drawIterations", internalType: "uint256", type: "uint256" },
         ],
       },
     ],
@@ -12926,230 +12911,245 @@ export const klerosCoreRulerNeoImplementationAbi = [
     outputs: [{ name: "", internalType: "address", type: "address" }],
     stateMutability: "view",
   },
+  {
+    type: "function",
+    inputs: [],
+    name: "guardian",
+    outputs: [{ name: "", internalType: "address", type: "address" }],
+    stateMutability: "view",
+  },
   {
     type: "function",
     inputs: [
       { name: "_governor", internalType: "address", type: "address" },
+      { name: "_guardian", internalType: "address", type: "address" },
       { name: "_pinakion", internalType: "contract IERC20", type: "address" },
+      {
+        name: "_jurorProsecutionModule",
+        internalType: "address",
+        type: "address",
+      },
+      {
+        name: "_disputeKit",
+        internalType: "contract IDisputeKit",
+        type: "address",
+      },
+      { name: "_hiddenVotes", internalType: "bool", type: "bool" },
       {
         name: "_courtParameters",
         internalType: "uint256[4]",
         type: "uint256[4]",
       },
+      {
+        name: "_timesPerPeriod",
+        internalType: "uint256[4]",
+        type: "uint256[4]",
+      },
+      { name: "_sortitionExtraData", internalType: "bytes", type: "bytes" },
+      {
+        name: "_sortitionModuleAddress",
+        internalType: "contract ISortitionModule",
+        type: "address",
+      },
+      { name: "_jurorNft", internalType: "contract IERC721", type: "address" },
+      { name: "_wNative", internalType: "address", type: "address" },
     ],
     name: "initialize",
     outputs: [],
     stateMutability: "nonpayable",
   },
+  {
+    type: "function",
+    inputs: [{ name: "_disputeID", internalType: "uint256", type: "uint256" }],
+    name: "isDisputeKitJumping",
+    outputs: [{ name: "", internalType: "bool", type: "bool" }],
+    stateMutability: "view",
+  },
+  {
+    type: "function",
+    inputs: [
+      { name: "_courtID", internalType: "uint96", type: "uint96" },
+      { name: "_disputeKitID", internalType: "uint256", type: "uint256" },
+    ],
+    name: "isSupported",
+    outputs: [{ name: "", internalType: "bool", type: "bool" }],
+    stateMutability: "view",
+  },
   {
     type: "function",
     inputs: [],
-    name: "pinakion",
-    outputs: [{ name: "", internalType: "contract IERC20", type: "address" }],
+    name: "jurorNft",
+    outputs: [{ name: "", internalType: "contract IERC721", type: "address" }],
     stateMutability: "view",
   },
   {
     type: "function",
     inputs: [],
-    name: "proxiableUUID",
-    outputs: [{ name: "", internalType: "bytes32", type: "bytes32" }],
+    name: "jurorProsecutionModule",
+    outputs: [{ name: "", internalType: "address", type: "address" }],
     stateMutability: "view",
   },
   {
     type: "function",
-    inputs: [
-      {
-        name: "arbitrable",
-        internalType: "contract IArbitrableV2",
-        type: "address",
-      },
-    ],
-    name: "rulers",
-    outputs: [{ name: "ruler", internalType: "address", type: "address" }],
+    inputs: [{ name: "_disputeID", internalType: "uint256", type: "uint256" }],
+    name: "passPeriod",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
+  {
+    type: "function",
+    inputs: [],
+    name: "pause",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
+  {
+    type: "function",
+    inputs: [],
+    name: "paused",
+    outputs: [{ name: "", internalType: "bool", type: "bool" }],
     stateMutability: "view",
   },
   {
     type: "function",
-    inputs: [{ name: "disputeID", internalType: "uint256", type: "uint256" }],
-    name: "rulingResults",
-    outputs: [
-      { name: "ruling", internalType: "uint256", type: "uint256" },
-      { name: "tied", internalType: "bool", type: "bool" },
-      { name: "overridden", internalType: "bool", type: "bool" },
-    ],
+    inputs: [],
+    name: "pinakion",
+    outputs: [{ name: "", internalType: "contract IERC20", type: "address" }],
     stateMutability: "view",
   },
   {
     type: "function",
-    inputs: [
-      {
-        name: "arbitrable",
-        internalType: "contract IArbitrableV2",
-        type: "address",
-      },
-    ],
-    name: "settings",
-    outputs: [
-      {
-        name: "rulingMode",
-        internalType: "enum KlerosCoreRuler.RulingMode",
-        type: "uint8",
-      },
-      { name: "presetRuling", internalType: "uint256", type: "uint256" },
-      { name: "presetTied", internalType: "bool", type: "bool" },
-      { name: "presetOverridden", internalType: "bool", type: "bool" },
-    ],
+    inputs: [],
+    name: "proxiableUUID",
+    outputs: [{ name: "", internalType: "bytes32", type: "bytes32" }],
     stateMutability: "view",
   },
   {
     type: "function",
-    inputs: [
-      { name: "newImplementation", internalType: "address", type: "address" },
-      { name: "data", internalType: "bytes", type: "bytes" },
-    ],
-    name: "upgradeToAndCall",
+    inputs: [{ name: "_wNative", internalType: "address", type: "address" }],
+    name: "reinitialize",
     outputs: [],
-    stateMutability: "payable",
+    stateMutability: "nonpayable",
   },
-] as const;
-
-/**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x85093b5EDa4F2e2E2fEDae34Da91239D6a08e324)
- */
-export const klerosCoreRulerNeoImplementationAddress = {
-  42161: "0x85093b5EDa4F2e2E2fEDae34Da91239D6a08e324",
-} as const;
-
-/**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x85093b5EDa4F2e2E2fEDae34Da91239D6a08e324)
- */
-export const klerosCoreRulerNeoImplementationConfig = {
-  address: klerosCoreRulerNeoImplementationAddress,
-  abi: klerosCoreRulerNeoImplementationAbi,
-} as const;
-
-//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-// KlerosCoreRulerNeo_Proxy
-//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-
-/**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xc0169e0B19aE02ac4fADD689260CF038726DFE13)
- */
-export const klerosCoreRulerNeoProxyAbi = [
   {
-    type: "constructor",
+    type: "function",
     inputs: [
-      { name: "_implementation", internalType: "address", type: "address" },
-      { name: "_data", internalType: "bytes", type: "bytes" },
+      { name: "_courtID", internalType: "uint96", type: "uint96" },
+      { name: "_newStake", internalType: "uint256", type: "uint256" },
     ],
+    name: "setStake",
+    outputs: [],
     stateMutability: "nonpayable",
   },
-  { type: "fallback", stateMutability: "payable" },
-  { type: "receive", stateMutability: "payable" },
-] as const;
-
-/**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xc0169e0B19aE02ac4fADD689260CF038726DFE13)
- */
-export const klerosCoreRulerNeoProxyAddress = {
-  42161: "0xc0169e0B19aE02ac4fADD689260CF038726DFE13",
-} as const;
-
-/**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xc0169e0B19aE02ac4fADD689260CF038726DFE13)
- */
-export const klerosCoreRulerNeoProxyConfig = {
-  address: klerosCoreRulerNeoProxyAddress,
-  abi: klerosCoreRulerNeoProxyAbi,
-} as const;
-
-//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-// KlerosCoreSnapshotProxy
-//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-
-/**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xEF719a5B3352F607e6C4E17b7e0cDAd8322fEC95)
- */
-export const klerosCoreSnapshotProxyAbi = [
   {
-    type: "constructor",
+    type: "function",
     inputs: [
-      { name: "_governor", internalType: "address", type: "address" },
-      { name: "_core", internalType: "contract IKlerosCore", type: "address" },
+      { name: "_account", internalType: "address", type: "address" },
+      { name: "_courtID", internalType: "uint96", type: "uint96" },
+      { name: "_newStake", internalType: "uint256", type: "uint256" },
     ],
+    name: "setStakeBySortitionModule",
+    outputs: [],
     stateMutability: "nonpayable",
   },
   {
     type: "function",
-    inputs: [{ name: "_account", internalType: "address", type: "address" }],
-    name: "balanceOf",
-    outputs: [{ name: "totalStaked", internalType: "uint256", type: "uint256" }],
+    inputs: [],
+    name: "sortitionModule",
+    outputs: [{ name: "", internalType: "contract ISortitionModule", type: "address" }],
     stateMutability: "view",
   },
   {
     type: "function",
-    inputs: [{ name: "_core", internalType: "contract IKlerosCore", type: "address" }],
-    name: "changeCore",
+    inputs: [
+      { name: "_account", internalType: "address", type: "address" },
+      { name: "_amount", internalType: "uint256", type: "uint256" },
+    ],
+    name: "transferBySortitionModule",
     outputs: [],
     stateMutability: "nonpayable",
   },
   {
     type: "function",
-    inputs: [{ name: "_governor", internalType: "address", type: "address" }],
-    name: "changeGovernor",
+    inputs: [],
+    name: "unpause",
     outputs: [],
     stateMutability: "nonpayable",
   },
   {
     type: "function",
-    inputs: [],
-    name: "core",
-    outputs: [{ name: "", internalType: "contract IKlerosCore", type: "address" }],
-    stateMutability: "view",
+    inputs: [
+      { name: "newImplementation", internalType: "address", type: "address" },
+      { name: "data", internalType: "bytes", type: "bytes" },
+    ],
+    name: "upgradeToAndCall",
+    outputs: [],
+    stateMutability: "payable",
   },
   {
     type: "function",
     inputs: [],
-    name: "decimals",
-    outputs: [{ name: "", internalType: "uint8", type: "uint8" }],
+    name: "version",
+    outputs: [{ name: "", internalType: "string", type: "string" }],
     stateMutability: "view",
   },
   {
     type: "function",
     inputs: [],
-    name: "governor",
+    name: "wNative",
     outputs: [{ name: "", internalType: "address", type: "address" }],
     stateMutability: "view",
   },
+] as const;
+
+/**
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xC1210493804eEF123096F9581Ee82B915150E54c)
+ */
+export const klerosCoreImplementationAddress = {
+  42161: "0xC1210493804eEF123096F9581Ee82B915150E54c",
+} as const;
+
+/**
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xC1210493804eEF123096F9581Ee82B915150E54c)
+ */
+export const klerosCoreImplementationConfig = {
+  address: klerosCoreImplementationAddress,
+  abi: klerosCoreImplementationAbi,
+} as const;
+
+//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+// KlerosCore_Proxy
+//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+
+/**
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x991d2df165670b9cac3B022f4B68D65b664222ea)
+ */
+export const klerosCoreProxyAbi = [
   {
-    type: "function",
-    inputs: [],
-    name: "name",
-    outputs: [{ name: "", internalType: "string", type: "string" }],
-    stateMutability: "view",
-  },
-  {
-    type: "function",
-    inputs: [],
-    name: "symbol",
-    outputs: [{ name: "", internalType: "string", type: "string" }],
-    stateMutability: "view",
+    type: "constructor",
+    inputs: [
+      { name: "_implementation", internalType: "address", type: "address" },
+      { name: "_data", internalType: "bytes", type: "bytes" },
+    ],
+    stateMutability: "nonpayable",
   },
+  { type: "fallback", stateMutability: "payable" },
+  { type: "receive", stateMutability: "payable" },
 ] as const;
 
 /**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xEF719a5B3352F607e6C4E17b7e0cDAd8322fEC95)
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x991d2df165670b9cac3B022f4B68D65b664222ea)
  */
-export const klerosCoreSnapshotProxyAddress = {
-  42161: "0xEF719a5B3352F607e6C4E17b7e0cDAd8322fEC95",
+export const klerosCoreProxyAddress = {
+  42161: "0x991d2df165670b9cac3B022f4B68D65b664222ea",
 } as const;
 
 /**
- * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0xEF719a5B3352F607e6C4E17b7e0cDAd8322fEC95)
+ * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x991d2df165670b9cac3B022f4B68D65b664222ea)
  */
-export const klerosCoreSnapshotProxyConfig = {
-  address: klerosCoreSnapshotProxyAddress,
-  abi: klerosCoreSnapshotProxyAbi,
+export const klerosCoreProxyConfig = {
+  address: klerosCoreProxyAddress,
+  abi: klerosCoreProxyAbi,
 } as const;
 
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
@@ -14783,13 +14783,13 @@ export const randomizerRngProxyConfig = {
 } as const;
 
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-// SortitionModuleNeo
+// SortitionModule
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x21A9402aDb818744B296e1d1BE58C804118DC03D)
  */
-export const sortitionModuleNeoAbi = [
+export const sortitionModuleAbi = [
   { type: "fallback", stateMutability: "payable" },
   { type: "receive", stateMutability: "payable" },
   { type: "error", inputs: [], name: "AlreadyInitialized" },
@@ -15405,26 +15405,26 @@ export const sortitionModuleNeoAbi = [
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x21A9402aDb818744B296e1d1BE58C804118DC03D)
  */
-export const sortitionModuleNeoAddress = {
+export const sortitionModuleAddress = {
   42161: "0x21A9402aDb818744B296e1d1BE58C804118DC03D",
 } as const;
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x21A9402aDb818744B296e1d1BE58C804118DC03D)
  */
-export const sortitionModuleNeoConfig = {
-  address: sortitionModuleNeoAddress,
-  abi: sortitionModuleNeoAbi,
+export const sortitionModuleConfig = {
+  address: sortitionModuleAddress,
+  abi: sortitionModuleAbi,
 } as const;
 
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-// SortitionModuleNeo_Implementation
+// SortitionModule_Implementation
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x3f6D0daeD166b64FCfBb9bc7c9E26423c6C08eEE)
  */
-export const sortitionModuleNeoImplementationAbi = [
+export const sortitionModuleImplementationAbi = [
   { type: "constructor", inputs: [], stateMutability: "nonpayable" },
   { type: "error", inputs: [], name: "AlreadyInitialized" },
   { type: "error", inputs: [], name: "FailedDelegateCall" },
@@ -16031,26 +16031,26 @@ export const sortitionModuleNeoImplementationAbi = [
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x3f6D0daeD166b64FCfBb9bc7c9E26423c6C08eEE)
  */
-export const sortitionModuleNeoImplementationAddress = {
+export const sortitionModuleImplementationAddress = {
   42161: "0x3f6D0daeD166b64FCfBb9bc7c9E26423c6C08eEE",
 } as const;
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x3f6D0daeD166b64FCfBb9bc7c9E26423c6C08eEE)
  */
-export const sortitionModuleNeoImplementationConfig = {
-  address: sortitionModuleNeoImplementationAddress,
-  abi: sortitionModuleNeoImplementationAbi,
+export const sortitionModuleImplementationConfig = {
+  address: sortitionModuleImplementationAddress,
+  abi: sortitionModuleImplementationAbi,
 } as const;
 
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-// SortitionModuleNeo_Proxy
+// SortitionModule_Proxy
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x21A9402aDb818744B296e1d1BE58C804118DC03D)
  */
-export const sortitionModuleNeoProxyAbi = [
+export const sortitionModuleProxyAbi = [
   {
     type: "constructor",
     inputs: [
@@ -16066,16 +16066,16 @@ export const sortitionModuleNeoProxyAbi = [
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x21A9402aDb818744B296e1d1BE58C804118DC03D)
  */
-export const sortitionModuleNeoProxyAddress = {
+export const sortitionModuleProxyAddress = {
   42161: "0x21A9402aDb818744B296e1d1BE58C804118DC03D",
 } as const;
 
 /**
  * [__View Contract on Arbitrum One Arbiscan__](https://arbiscan.io/address/0x21A9402aDb818744B296e1d1BE58C804118DC03D)
  */
-export const sortitionModuleNeoProxyConfig = {
-  address: sortitionModuleNeoProxyAddress,
-  abi: sortitionModuleNeoProxyAbi,
+export const sortitionModuleProxyConfig = {
+  address: sortitionModuleProxyAddress,
+  abi: sortitionModuleProxyAbi,
 } as const;
 
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
diff --git a/contracts/test/integration/getContractsEthers.test.ts b/contracts/test/integration/getContractsEthers.test.ts
index 59a04dfab..8bd2b9cf5 100644
--- a/contracts/test/integration/getContractsEthers.test.ts
+++ b/contracts/test/integration/getContractsEthers.test.ts
@@ -98,13 +98,13 @@ const universityContractMapping: ContractMapping = {
 };
 
 const mainnetContractMapping: ContractMapping = {
-  klerosCore: { name: "KlerosCoreNeo" },
-  sortition: { name: "SortitionModuleNeo" },
-  disputeKitClassic: { name: "DisputeKitClassicNeo" },
-  disputeKitShutter: { name: "DisputeKitShutterNeo" },
-  disputeKitGated: { name: "DisputeKitGatedNeo" },
-  disputeKitGatedShutter: { name: "DisputeKitGatedShutterNeo" },
-  disputeResolver: { name: "DisputeResolverNeo" },
+  klerosCore: { name: "KlerosCore" },
+  sortition: { name: "SortitionModule" },
+  disputeKitClassic: { name: "DisputeKitClassic" },
+  disputeKitShutter: { name: "DisputeKitShutter" },
+  disputeKitGated: { name: "DisputeKitGated" },
+  disputeKitGatedShutter: { name: "DisputeKitGatedShutter" },
+  disputeResolver: { name: "DisputeResolver" },
   disputeTemplateRegistry: { name: "DisputeTemplateRegistry" },
   evidence: { name: "EvidenceModule" },
   policyRegistry: { name: "PolicyRegistry" },
diff --git a/contracts/test/integration/getContractsViem.test.ts b/contracts/test/integration/getContractsViem.test.ts
index 4231164ad..67c5a92af 100644
--- a/contracts/test/integration/getContractsViem.test.ts
+++ b/contracts/test/integration/getContractsViem.test.ts
@@ -78,13 +78,13 @@ const universityContractMapping: ContractMapping = {
 };
 
 const mainnetContractMapping: ContractMapping = {
-  klerosCore: { name: "KlerosCoreNeo" },
-  sortition: { name: "SortitionModuleNeo" },
-  disputeKitClassic: { name: "DisputeKitClassicNeo" },
-  disputeKitShutter: { name: "DisputeKitShutterNeo" },
-  disputeKitGated: { name: "DisputeKitGatedNeo" },
-  disputeKitGatedShutter: { name: "DisputeKitGatedShutterNeo" },
-  disputeResolver: { name: "DisputeResolverNeo" },
+  klerosCore: { name: "KlerosCore" },
+  sortition: { name: "SortitionModule" },
+  disputeKitClassic: { name: "DisputeKitClassic" },
+  disputeKitShutter: { name: "DisputeKitShutter" },
+  disputeKitGated: { name: "DisputeKitGated" },
+  disputeKitGatedShutter: { name: "DisputeKitGatedShutter" },
+  disputeResolver: { name: "DisputeResolver" },
   disputeTemplateRegistry: { name: "DisputeTemplateRegistry" },
   evidence: { name: "EvidenceModule" },
   policyRegistry: { name: "PolicyRegistry" },

From 59ca8e1441bd7b4bf52923d07a4e8e9073e36d3c Mon Sep 17 00:00:00 2001
From: unknownunknown1 <danil@kleros.io>
Date: Fri, 5 Sep 2025 03:32:10 +1000
Subject: [PATCH 104/175] fix: update storage layout

---
 .../dispute-kits/DisputeKitClassicBase.sol    | 16 +++----
 .../arbitration/interfaces/IDisputeKit.sol    |  2 +-
 contracts/test/arbitration/staking-neo.ts     | 48 +++++++------------
 contracts/test/arbitration/staking.ts         | 48 +++++++------------
 .../test/foundry/KlerosCore_Staking.t.sol     | 17 ++-----
 5 files changed, 44 insertions(+), 87 deletions(-)

diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index 5dc1c3522..d998150e6 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -41,7 +41,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         mapping(address account => mapping(uint256 choiceId => uint256)) contributions; // Maps contributors to their contributions for each choice.
         uint256 feeRewards; // Sum of reimbursable appeal fees available to the parties that made contributions to the ruling that ultimately wins a dispute.
         uint256[] fundedChoices; // Stores the choices that are fully funded.
-        uint256 nbVotes; // Maximal number of votes this dispute can get.
+        mapping(address drawnAddress => bool) alreadyDrawn; // True if the address has already been drawn, false by default.
     }
 
     struct Vote {
@@ -64,12 +64,11 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     Dispute[] public disputes; // Array of the locally created disputes.
     mapping(uint256 => uint256) public coreDisputeIDToLocal; // Maps the dispute ID in Kleros Core to the local dispute ID.
     bool public singleDrawPerJuror; // Whether each juror can only draw once per dispute, false by default.
-    mapping(uint256 localDisputeID => mapping(uint256 localRoundID => mapping(address drawnAddress => bool)))
-        public alreadyDrawn; // True if the address has already been drawn, false by default. To be added to the Round struct when fully redeploying rather than upgrading.
     mapping(uint256 coreDisputeID => bool) public coreDisputeIDToActive; // True if this dispute kit is active for this core dispute ID.
     address public wNative; // The wrapped native token for safeSend().
     uint256 public jumpDisputeKitID; // The ID of the dispute kit in Kleros Core disputeKits array that the dispute should switch to after the court jump, in case the new court doesn't support this dispute kit.
 
+    uint256[50] private __gap; // Reserved slots for future upgrades.
     // ************************************* //
     // *              Events               * //
     // ************************************* //
@@ -201,12 +200,11 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     /// @param _coreDisputeID The ID of the dispute in Kleros Core.
     /// @param _numberOfChoices Number of choices of the dispute
     /// @param _extraData Additional info about the dispute, for possible use in future dispute kits.
-    /// @param _nbVotes Number of votes for this dispute.
     function createDispute(
         uint256 _coreDisputeID,
         uint256 _numberOfChoices,
         bytes calldata _extraData,
-        uint256 _nbVotes
+        uint256 /*_nbVotes*/
     ) external override onlyByCore {
         uint256 localDisputeID = disputes.length;
         Dispute storage dispute = disputes.push();
@@ -218,7 +216,6 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         dispute.coreRoundIDToLocal[core.getNumberOfRounds(_coreDisputeID) - 1] = dispute.rounds.length;
 
         Round storage round = dispute.rounds.push();
-        round.nbVotes = _nbVotes;
         round.tied = true;
 
         coreDisputeIDToLocal[_coreDisputeID] = localDisputeID;
@@ -250,7 +247,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
 
         if (_postDrawCheck(round, _coreDisputeID, drawnAddress)) {
             round.votes.push(Vote({account: drawnAddress, commit: bytes32(0), choice: 0, voted: false}));
-            alreadyDrawn[localDisputeID][localRoundID][drawnAddress] = true;
+            round.alreadyDrawn[drawnAddress] = true;
         } else {
             drawnAddress = address(0);
         }
@@ -422,7 +419,6 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
                 dispute.coreRoundIDToLocal[coreRoundID + 1] = dispute.rounds.length;
 
                 Round storage newRound = dispute.rounds.push();
-                newRound.nbVotes = core.getNumberOfVotes(_coreDisputeID);
                 newRound.tied = true;
             }
             core.appeal{value: appealCost}(_coreDisputeID, dispute.numberOfChoices, dispute.extraData);
@@ -768,8 +764,8 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         if (singleDrawPerJuror) {
             uint256 localDisputeID = coreDisputeIDToLocal[_coreDisputeID];
             Dispute storage dispute = disputes[localDisputeID];
-            uint256 localRoundID = dispute.rounds.length - 1;
-            result = !alreadyDrawn[localDisputeID][localRoundID][_juror];
+            Round storage round = dispute.rounds[dispute.rounds.length - 1];
+            result = !round.alreadyDrawn[_juror];
         } else {
             result = true;
         }
diff --git a/contracts/src/arbitration/interfaces/IDisputeKit.sol b/contracts/src/arbitration/interfaces/IDisputeKit.sol
index 90fbbd727..a1c25c97c 100644
--- a/contracts/src/arbitration/interfaces/IDisputeKit.sol
+++ b/contracts/src/arbitration/interfaces/IDisputeKit.sol
@@ -35,7 +35,7 @@ interface IDisputeKit {
     /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
     /// @param _numberOfChoices Number of choices of the dispute
     /// @param _extraData Additional info about the dispute, for possible use in future dispute kits.
-    /// @param _nbVotes Maximal number of votes this dispute can get. DEPRECATED as we don't need to pass it now. KC handles the count.
+    /// @param _nbVotes Maximal number of votes this dispute can get. Added for future-proofing.
     function createDispute(
         uint256 _coreDisputeID,
         uint256 _numberOfChoices,
diff --git a/contracts/test/arbitration/staking-neo.ts b/contracts/test/arbitration/staking-neo.ts
index 9cd83efeb..3e34fb8cb 100644
--- a/contracts/test/arbitration/staking-neo.ts
+++ b/contracts/test/arbitration/staking-neo.ts
@@ -469,7 +469,6 @@ describe("Staking", async () => {
           expect(await sortition.delayedStakeWriteIndex()).to.be.equal(0);
           expect(await sortition.delayedStakeReadIndex()).to.be.equal(1);
           await pnk.approve(core.target, PNK(1000));
-          expect(await sortition.latestDelayedStakeIndex(deployer, 2)).to.be.equal(0); // Deprecated. Always 0
           await expect(core.setStake(2, PNK(3000)))
             .to.emit(sortition, "StakeDelayed")
             .withArgs(deployer, 2, PNK(3000));
@@ -481,10 +480,9 @@ describe("Staking", async () => {
         });
 
         it("Should store the delayed stake for later", async () => {
-          expect(await sortition.latestDelayedStakeIndex(deployer, 2)).to.be.equal(0); // Deprecated. Always 0
           expect(await sortition.delayedStakeWriteIndex()).to.be.equal(1);
           expect(await sortition.delayedStakeReadIndex()).to.be.equal(1);
-          expect(await sortition.delayedStakes(1)).to.be.deep.equal([deployer, 2, PNK(3000), false]);
+          expect(await sortition.delayedStakes(1)).to.be.deep.equal([deployer, 2, PNK(3000)]);
         });
       });
 
@@ -507,9 +505,8 @@ describe("Staking", async () => {
           ]); // stake unchanged, delayed
           expect(await sortition.delayedStakeWriteIndex()).to.be.equal(1);
           expect(await sortition.delayedStakeReadIndex()).to.be.equal(2);
-          expect(await sortition.delayedStakes(1)).to.be.deep.equal([ethers.ZeroAddress, 0, 0, false]); // the 1st delayed stake got deleted
-          expect(await sortition.delayedStakes(2)).to.be.deep.equal([ethers.ZeroAddress, 0, 0, false]); // the 2nd delayed stake got deleted
-          expect(await sortition.latestDelayedStakeIndex(deployer, 1)).to.be.equal(0); // Deprecated. Always 0
+          expect(await sortition.delayedStakes(1)).to.be.deep.equal([ethers.ZeroAddress, 0, 0]); // the 1st delayed stake got deleted
+          expect(await sortition.delayedStakes(2)).to.be.deep.equal([ethers.ZeroAddress, 0, 0]); // the 2nd delayed stake got deleted
         });
 
         it("Should transfer PNK after delayed stake execution", async () => {
@@ -535,7 +532,6 @@ describe("Staking", async () => {
         it("Should delay the stake decrease", async () => {
           expect(await sortition.delayedStakeWriteIndex()).to.be.equal(0);
           expect(await sortition.delayedStakeReadIndex()).to.be.equal(1);
-          expect(await sortition.latestDelayedStakeIndex(deployer, 2)).to.be.equal(0); // Deprecated. Always 0
           await expect(core.setStake(2, PNK(1000)))
             .to.emit(sortition, "StakeDelayed")
             .withArgs(deployer, 2, PNK(1000));
@@ -547,10 +543,9 @@ describe("Staking", async () => {
         });
 
         it("Should store the delayed stake for later", async () => {
-          expect(await sortition.latestDelayedStakeIndex(deployer, 2)).to.be.equal(0); // Deprecated. Always 0
           expect(await sortition.delayedStakeWriteIndex()).to.be.equal(1);
           expect(await sortition.delayedStakeReadIndex()).to.be.equal(1);
-          expect(await sortition.delayedStakes(1)).to.be.deep.equal([deployer, 2, PNK(1000), false]);
+          expect(await sortition.delayedStakes(1)).to.be.deep.equal([deployer, 2, PNK(1000)]);
         });
       });
 
@@ -572,9 +567,8 @@ describe("Staking", async () => {
           ]); // stake unchanged, delayed
           expect(await sortition.delayedStakeWriteIndex()).to.be.equal(1);
           expect(await sortition.delayedStakeReadIndex()).to.be.equal(2);
-          expect(await sortition.delayedStakes(1)).to.be.deep.equal([ethers.ZeroAddress, 0, 0, false]); // the 1st delayed stake got deleted
-          expect(await sortition.delayedStakes(2)).to.be.deep.equal([ethers.ZeroAddress, 0, 0, false]); // the 2nd delayed stake got deleted
-          expect(await sortition.latestDelayedStakeIndex(deployer, 1)).to.be.equal(0); // Deprecated. Always 0
+          expect(await sortition.delayedStakes(1)).to.be.deep.equal([ethers.ZeroAddress, 0, 0]); // the 1st delayed stake got deleted
+          expect(await sortition.delayedStakes(2)).to.be.deep.equal([ethers.ZeroAddress, 0, 0]); // the 2nd delayed stake got deleted
         });
 
         it("Should withdraw some PNK", async () => {
@@ -600,7 +594,6 @@ describe("Staking", async () => {
         it("Should delay the stake decrease", async () => {
           expect(await sortition.delayedStakeWriteIndex()).to.be.equal(0);
           expect(await sortition.delayedStakeReadIndex()).to.be.equal(1);
-          expect(await sortition.latestDelayedStakeIndex(deployer, 2)).to.be.equal(0); // Deprecated. Always 0
           await expect(core.setStake(2, PNK(1000)))
             .to.emit(sortition, "StakeDelayed")
             .withArgs(deployer, 2, PNK(1000));
@@ -612,17 +605,15 @@ describe("Staking", async () => {
         });
 
         it("Should store the delayed stake for later", async () => {
-          expect(await sortition.latestDelayedStakeIndex(deployer, 2)).to.be.equal(0); // Deprecated. Always 0
           expect(await sortition.delayedStakeWriteIndex()).to.be.equal(1);
           expect(await sortition.delayedStakeReadIndex()).to.be.equal(1);
-          expect(await sortition.delayedStakes(1)).to.be.deep.equal([deployer, 2, PNK(1000), false]);
+          expect(await sortition.delayedStakes(1)).to.be.deep.equal([deployer, 2, PNK(1000)]);
         });
       });
 
       describe("When stake is increased back to the previous amount", () => {
         it("Should delay the stake increase", async () => {
           balanceBefore = await pnk.balanceOf(deployer);
-          expect(await sortition.latestDelayedStakeIndex(deployer, 2)).to.be.equal(0); // Deprecated. Always 0
           await expect(core.setStake(2, PNK(2000)))
             .to.emit(sortition, "StakeDelayed")
             .withArgs(deployer, 2, PNK(2000));
@@ -634,11 +625,10 @@ describe("Staking", async () => {
         });
 
         it("Should store the delayed stake for later", async () => {
-          expect(await sortition.latestDelayedStakeIndex(deployer, 2)).to.be.equal(0); // Deprecated. Always 0
           expect(await sortition.delayedStakeWriteIndex()).to.be.equal(2);
           expect(await sortition.delayedStakeReadIndex()).to.be.equal(1);
-          expect(await sortition.delayedStakes(1)).to.be.deep.equal([deployer, 2, PNK(1000), false]);
-          expect(await sortition.delayedStakes(2)).to.be.deep.equal([deployer, 2, PNK(2000), false]);
+          expect(await sortition.delayedStakes(1)).to.be.deep.equal([deployer, 2, PNK(1000)]);
+          expect(await sortition.delayedStakes(2)).to.be.deep.equal([deployer, 2, PNK(2000)]);
         });
       });
 
@@ -663,9 +653,8 @@ describe("Staking", async () => {
           ]); // stake unchanged, delayed
           expect(await sortition.delayedStakeWriteIndex()).to.be.equal(2);
           expect(await sortition.delayedStakeReadIndex()).to.be.equal(3);
-          expect(await sortition.delayedStakes(1)).to.be.deep.equal([ethers.ZeroAddress, 0, 0, false]); // the 1st delayed stake got deleted
-          expect(await sortition.delayedStakes(2)).to.be.deep.equal([ethers.ZeroAddress, 0, 0, false]); // the 2nd delayed stake got deleted
-          expect(await sortition.latestDelayedStakeIndex(deployer, 2)).to.be.equal(0); // Deprecated. Always 0
+          expect(await sortition.delayedStakes(1)).to.be.deep.equal([ethers.ZeroAddress, 0, 0]); // the 1st delayed stake got deleted
+          expect(await sortition.delayedStakes(2)).to.be.deep.equal([ethers.ZeroAddress, 0, 0]); // the 2nd delayed stake got deleted
         });
 
         it("Should not transfer any PNK", async () => {
@@ -692,7 +681,6 @@ describe("Staking", async () => {
           expect(await sortition.delayedStakeWriteIndex()).to.be.equal(0);
           expect(await sortition.delayedStakeReadIndex()).to.be.equal(1);
           await pnk.approve(core.target, PNK(1000));
-          expect(await sortition.latestDelayedStakeIndex(deployer, 2)).to.be.equal(0); // Deprecated. Always 0
           await expect(core.setStake(2, PNK(3000)))
             .to.emit(sortition, "StakeDelayed")
             .withArgs(deployer, 2, PNK(3000));
@@ -704,17 +692,15 @@ describe("Staking", async () => {
         });
 
         it("Should store the delayed stake for later", async () => {
-          expect(await sortition.latestDelayedStakeIndex(deployer, 2)).to.be.equal(0); // Deprecated. Always 0
           expect(await sortition.delayedStakeWriteIndex()).to.be.equal(1);
           expect(await sortition.delayedStakeReadIndex()).to.be.equal(1);
-          expect(await sortition.delayedStakes(1)).to.be.deep.equal([deployer, 2, PNK(3000), false]);
+          expect(await sortition.delayedStakes(1)).to.be.deep.equal([deployer, 2, PNK(3000)]);
         });
       });
 
       describe("When stake is decreased back to the previous amount", () => {
         it("Should cancel out the stake decrease back", async () => {
           balanceBefore = await pnk.balanceOf(deployer);
-          expect(await sortition.latestDelayedStakeIndex(deployer, 2)).to.be.equal(0); // Deprecated. Always 0
           await expect(core.setStake(2, PNK(2000)))
             .to.emit(sortition, "StakeDelayed")
             .withArgs(deployer, 2, PNK(2000));
@@ -726,11 +712,10 @@ describe("Staking", async () => {
         });
 
         it("Should store the delayed stake for later", async () => {
-          expect(await sortition.latestDelayedStakeIndex(deployer, 2)).to.be.equal(0); // Deprecated. Always 0
           expect(await sortition.delayedStakeWriteIndex()).to.be.equal(2);
           expect(await sortition.delayedStakeReadIndex()).to.be.equal(1);
-          expect(await sortition.delayedStakes(1)).to.be.deep.equal([deployer, 2, PNK(3000), false]);
-          expect(await sortition.delayedStakes(2)).to.be.deep.equal([deployer, 2, PNK(2000), false]);
+          expect(await sortition.delayedStakes(1)).to.be.deep.equal([deployer, 2, PNK(3000)]);
+          expect(await sortition.delayedStakes(2)).to.be.deep.equal([deployer, 2, PNK(2000)]);
         });
       });
 
@@ -753,9 +738,8 @@ describe("Staking", async () => {
           ]); // stake unchanged, delayed
           expect(await sortition.delayedStakeWriteIndex()).to.be.equal(2);
           expect(await sortition.delayedStakeReadIndex()).to.be.equal(3);
-          expect(await sortition.delayedStakes(1)).to.be.deep.equal([ethers.ZeroAddress, 0, 0, false]); // the 1st delayed stake got deleted
-          expect(await sortition.delayedStakes(2)).to.be.deep.equal([ethers.ZeroAddress, 0, 0, false]); // the 2nd delayed stake got deleted
-          expect(await sortition.latestDelayedStakeIndex(deployer, 2)).to.be.equal(0); // Deprecated. Always 0
+          expect(await sortition.delayedStakes(1)).to.be.deep.equal([ethers.ZeroAddress, 0, 0]); // the 1st delayed stake got deleted
+          expect(await sortition.delayedStakes(2)).to.be.deep.equal([ethers.ZeroAddress, 0, 0]); // the 2nd delayed stake got deleted
         });
 
         it("Should not transfer any PNK", async () => {
diff --git a/contracts/test/arbitration/staking.ts b/contracts/test/arbitration/staking.ts
index d27a5f10e..7e5344c39 100644
--- a/contracts/test/arbitration/staking.ts
+++ b/contracts/test/arbitration/staking.ts
@@ -82,7 +82,6 @@ describe("Staking", async () => {
           expect(await sortition.delayedStakeWriteIndex()).to.be.equal(0);
           expect(await sortition.delayedStakeReadIndex()).to.be.equal(1);
           await pnk.approve(core.target, PNK(1000));
-          expect(await sortition.latestDelayedStakeIndex(deployer, 2)).to.be.equal(0); // Deprecated. Always 0
           await expect(core.setStake(2, PNK(3000)))
             .to.emit(sortition, "StakeDelayed")
             .withArgs(deployer, 2, PNK(3000));
@@ -94,10 +93,9 @@ describe("Staking", async () => {
         });
 
         it("Should store the delayed stake for later", async () => {
-          expect(await sortition.latestDelayedStakeIndex(deployer, 2)).to.be.equal(0); // Deprecated. Always 0
           expect(await sortition.delayedStakeWriteIndex()).to.be.equal(1);
           expect(await sortition.delayedStakeReadIndex()).to.be.equal(1);
-          expect(await sortition.delayedStakes(1)).to.be.deep.equal([deployer, 2, PNK(3000), false]);
+          expect(await sortition.delayedStakes(1)).to.be.deep.equal([deployer, 2, PNK(3000)]);
         });
       });
 
@@ -120,9 +118,8 @@ describe("Staking", async () => {
           ]); // stake unchanged, delayed
           expect(await sortition.delayedStakeWriteIndex()).to.be.equal(1);
           expect(await sortition.delayedStakeReadIndex()).to.be.equal(2);
-          expect(await sortition.delayedStakes(1)).to.be.deep.equal([ethers.ZeroAddress, 0, 0, false]); // the 1st delayed stake got deleted
-          expect(await sortition.delayedStakes(2)).to.be.deep.equal([ethers.ZeroAddress, 0, 0, false]); // the 2nd delayed stake got deleted
-          expect(await sortition.latestDelayedStakeIndex(deployer, 1)).to.be.equal(0); // Deprecated. Always 0
+          expect(await sortition.delayedStakes(1)).to.be.deep.equal([ethers.ZeroAddress, 0, 0]); // the 1st delayed stake got deleted
+          expect(await sortition.delayedStakes(2)).to.be.deep.equal([ethers.ZeroAddress, 0, 0]); // the 2nd delayed stake got deleted
         });
 
         it("Should transfer PNK after delayed stake execution", async () => {
@@ -146,7 +143,6 @@ describe("Staking", async () => {
         it("Should delay the stake decrease", async () => {
           expect(await sortition.delayedStakeWriteIndex()).to.be.equal(0);
           expect(await sortition.delayedStakeReadIndex()).to.be.equal(1);
-          expect(await sortition.latestDelayedStakeIndex(deployer, 2)).to.be.equal(0); // Deprecated. Always 0
           await expect(core.setStake(2, PNK(1000)))
             .to.emit(sortition, "StakeDelayed")
             .withArgs(deployer, 2, PNK(1000));
@@ -158,10 +154,9 @@ describe("Staking", async () => {
         });
 
         it("Should store the delayed stake for later", async () => {
-          expect(await sortition.latestDelayedStakeIndex(deployer, 2)).to.be.equal(0); // Deprecated. Always 0
           expect(await sortition.delayedStakeWriteIndex()).to.be.equal(1);
           expect(await sortition.delayedStakeReadIndex()).to.be.equal(1);
-          expect(await sortition.delayedStakes(1)).to.be.deep.equal([deployer, 2, PNK(1000), false]);
+          expect(await sortition.delayedStakes(1)).to.be.deep.equal([deployer, 2, PNK(1000)]);
         });
       });
 
@@ -183,9 +178,8 @@ describe("Staking", async () => {
           ]); // stake unchanged, delayed
           expect(await sortition.delayedStakeWriteIndex()).to.be.equal(1);
           expect(await sortition.delayedStakeReadIndex()).to.be.equal(2);
-          expect(await sortition.delayedStakes(1)).to.be.deep.equal([ethers.ZeroAddress, 0, 0, false]); // the 1st delayed stake got deleted
-          expect(await sortition.delayedStakes(2)).to.be.deep.equal([ethers.ZeroAddress, 0, 0, false]); // the 2nd delayed stake got deleted
-          expect(await sortition.latestDelayedStakeIndex(deployer, 1)).to.be.equal(0); // Deprecated. Always 0
+          expect(await sortition.delayedStakes(1)).to.be.deep.equal([ethers.ZeroAddress, 0, 0]); // the 1st delayed stake got deleted
+          expect(await sortition.delayedStakes(2)).to.be.deep.equal([ethers.ZeroAddress, 0, 0]); // the 2nd delayed stake got deleted
         });
 
         it("Should withdraw some PNK", async () => {
@@ -209,7 +203,6 @@ describe("Staking", async () => {
         it("Should delay the stake decrease", async () => {
           expect(await sortition.delayedStakeWriteIndex()).to.be.equal(0);
           expect(await sortition.delayedStakeReadIndex()).to.be.equal(1);
-          expect(await sortition.latestDelayedStakeIndex(deployer, 2)).to.be.equal(0); // Deprecated. Always 0
           await expect(core.setStake(2, PNK(1000)))
             .to.emit(sortition, "StakeDelayed")
             .withArgs(deployer, 2, PNK(1000));
@@ -221,17 +214,15 @@ describe("Staking", async () => {
         });
 
         it("Should store the delayed stake for later", async () => {
-          expect(await sortition.latestDelayedStakeIndex(deployer, 2)).to.be.equal(0); // Deprecated. Always 0
           expect(await sortition.delayedStakeWriteIndex()).to.be.equal(1);
           expect(await sortition.delayedStakeReadIndex()).to.be.equal(1);
-          expect(await sortition.delayedStakes(1)).to.be.deep.equal([deployer, 2, PNK(1000), false]);
+          expect(await sortition.delayedStakes(1)).to.be.deep.equal([deployer, 2, PNK(1000)]);
         });
       });
 
       describe("When stake is increased back to the previous amount", () => {
         it("Should delay the stake increase", async () => {
           balanceBefore = await pnk.balanceOf(deployer);
-          expect(await sortition.latestDelayedStakeIndex(deployer, 2)).to.be.equal(0); // Deprecated. Always 0
           await expect(core.setStake(2, PNK(2000))).to.emit(sortition, "StakeDelayed");
           expect(await sortition.getJurorBalance(deployer, 2)).to.be.deep.equal([PNK(4000), 0, PNK(2000), 2]); // stake unchanged, delayed
         });
@@ -241,11 +232,10 @@ describe("Staking", async () => {
         });
 
         it("Should store the delayed stake for later", async () => {
-          expect(await sortition.latestDelayedStakeIndex(deployer, 2)).to.be.equal(0); // Deprecated. Always 0
           expect(await sortition.delayedStakeWriteIndex()).to.be.equal(2);
           expect(await sortition.delayedStakeReadIndex()).to.be.equal(1);
-          expect(await sortition.delayedStakes(1)).to.be.deep.equal([deployer, 2, PNK(1000), false]);
-          expect(await sortition.delayedStakes(2)).to.be.deep.equal([deployer, 2, PNK(2000), false]);
+          expect(await sortition.delayedStakes(1)).to.be.deep.equal([deployer, 2, PNK(1000)]);
+          expect(await sortition.delayedStakes(2)).to.be.deep.equal([deployer, 2, PNK(2000)]);
         });
       });
 
@@ -270,9 +260,8 @@ describe("Staking", async () => {
           ]); // stake unchanged, delayed
           expect(await sortition.delayedStakeWriteIndex()).to.be.equal(2);
           expect(await sortition.delayedStakeReadIndex()).to.be.equal(3);
-          expect(await sortition.delayedStakes(1)).to.be.deep.equal([ethers.ZeroAddress, 0, 0, false]); // the 1st delayed stake got deleted
-          expect(await sortition.delayedStakes(2)).to.be.deep.equal([ethers.ZeroAddress, 0, 0, false]); // the 2nd delayed stake got deleted
-          expect(await sortition.latestDelayedStakeIndex(deployer, 2)).to.be.equal(0); // Deprecated. Always 0
+          expect(await sortition.delayedStakes(1)).to.be.deep.equal([ethers.ZeroAddress, 0, 0]); // the 1st delayed stake got deleted
+          expect(await sortition.delayedStakes(2)).to.be.deep.equal([ethers.ZeroAddress, 0, 0]); // the 2nd delayed stake got deleted
         });
 
         it("Should not transfer any PNK", async () => {
@@ -297,7 +286,6 @@ describe("Staking", async () => {
           expect(await sortition.delayedStakeWriteIndex()).to.be.equal(0);
           expect(await sortition.delayedStakeReadIndex()).to.be.equal(1);
           await pnk.approve(core.target, PNK(1000));
-          expect(await sortition.latestDelayedStakeIndex(deployer, 2)).to.be.equal(0); // Deprecated. Always 0
           await expect(core.setStake(2, PNK(3000)))
             .to.emit(sortition, "StakeDelayed")
             .withArgs(deployer, 2, PNK(3000));
@@ -309,17 +297,15 @@ describe("Staking", async () => {
         });
 
         it("Should store the delayed stake for later", async () => {
-          expect(await sortition.latestDelayedStakeIndex(deployer, 2)).to.be.equal(0); // Deprecated. Always 0
           expect(await sortition.delayedStakeWriteIndex()).to.be.equal(1);
           expect(await sortition.delayedStakeReadIndex()).to.be.equal(1);
-          expect(await sortition.delayedStakes(1)).to.be.deep.equal([deployer, 2, PNK(3000), false]);
+          expect(await sortition.delayedStakes(1)).to.be.deep.equal([deployer, 2, PNK(3000)]);
         });
       });
 
       describe("When stake is decreased back to the previous amount", () => {
         it("Should cancel out the stake decrease back", async () => {
           balanceBefore = await pnk.balanceOf(deployer);
-          expect(await sortition.latestDelayedStakeIndex(deployer, 2)).to.be.equal(0); // Deprecated. Always 0
           await expect(core.setStake(2, PNK(2000)))
             .to.emit(sortition, "StakeDelayed")
             .withArgs(deployer, 2, PNK(2000));
@@ -331,11 +317,10 @@ describe("Staking", async () => {
         });
 
         it("Should store the delayed stake for later", async () => {
-          expect(await sortition.latestDelayedStakeIndex(deployer, 2)).to.be.equal(0); // Deprecated. Always 0
           expect(await sortition.delayedStakeWriteIndex()).to.be.equal(2);
           expect(await sortition.delayedStakeReadIndex()).to.be.equal(1);
-          expect(await sortition.delayedStakes(1)).to.be.deep.equal([deployer, 2, PNK(3000), false]);
-          expect(await sortition.delayedStakes(2)).to.be.deep.equal([deployer, 2, PNK(2000), false]);
+          expect(await sortition.delayedStakes(1)).to.be.deep.equal([deployer, 2, PNK(3000)]);
+          expect(await sortition.delayedStakes(2)).to.be.deep.equal([deployer, 2, PNK(2000)]);
         });
       });
 
@@ -358,9 +343,8 @@ describe("Staking", async () => {
           ]); // stake unchanged, delayed
           expect(await sortition.delayedStakeWriteIndex()).to.be.equal(2);
           expect(await sortition.delayedStakeReadIndex()).to.be.equal(3);
-          expect(await sortition.delayedStakes(1)).to.be.deep.equal([ethers.ZeroAddress, 0, 0, false]); // the 1st delayed stake got deleted
-          expect(await sortition.delayedStakes(2)).to.be.deep.equal([ethers.ZeroAddress, 0, 0, false]); // the 2nd delayed stake got deleted
-          expect(await sortition.latestDelayedStakeIndex(deployer, 2)).to.be.equal(0); // Deprecated. Always 0
+          expect(await sortition.delayedStakes(1)).to.be.deep.equal([ethers.ZeroAddress, 0, 0]); // the 1st delayed stake got deleted
+          expect(await sortition.delayedStakes(2)).to.be.deep.equal([ethers.ZeroAddress, 0, 0]); // the 2nd delayed stake got deleted
         });
 
         it("Should not transfer any PNK", async () => {
diff --git a/contracts/test/foundry/KlerosCore_Staking.t.sol b/contracts/test/foundry/KlerosCore_Staking.t.sol
index 070a38716..03a253a71 100644
--- a/contracts/test/foundry/KlerosCore_Staking.t.sol
+++ b/contracts/test/foundry/KlerosCore_Staking.t.sol
@@ -194,13 +194,10 @@ contract KlerosCore_StakingTest is KlerosCore_TestBase {
         uint256 delayedStakeId = sortitionModule.delayedStakeWriteIndex();
         assertEq(delayedStakeId, 1, "Wrong delayedStakeWriteIndex");
         assertEq(sortitionModule.delayedStakeReadIndex(), 1, "Wrong delayedStakeReadIndex");
-        (address account, uint96 courtID, uint256 stake, bool alreadyTransferred) = sortitionModule.delayedStakes(
-            delayedStakeId
-        );
+        (address account, uint96 courtID, uint256 stake) = sortitionModule.delayedStakes(delayedStakeId);
         assertEq(account, staker1, "Wrong staker account");
         assertEq(courtID, GENERAL_COURT, "Wrong court id");
         assertEq(stake, 1500, "Wrong amount staked in court");
-        assertEq(alreadyTransferred, false, "Should be flagged as transferred");
 
         (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts) = sortitionModule
             .getJurorBalance(staker1, GENERAL_COURT);
@@ -342,25 +339,22 @@ contract KlerosCore_StakingTest is KlerosCore_TestBase {
         assertEq(sortitionModule.delayedStakeWriteIndex(), 3, "Wrong delayedStakeWriteIndex");
         assertEq(sortitionModule.delayedStakeReadIndex(), 1, "Wrong delayedStakeReadIndex");
 
-        (address account, uint96 courtID, uint256 stake, bool alreadyTransferred) = sortitionModule.delayedStakes(1);
+        (address account, uint96 courtID, uint256 stake) = sortitionModule.delayedStakes(1);
 
         // Check each delayed stake
         assertEq(account, staker1, "Wrong staker account for the first delayed stake");
         assertEq(courtID, GENERAL_COURT, "Wrong court ID");
         assertEq(stake, 1500, "Wrong staking amount");
-        assertEq(alreadyTransferred, false, "Should be false");
 
-        (account, courtID, stake, alreadyTransferred) = sortitionModule.delayedStakes(2);
+        (account, courtID, stake) = sortitionModule.delayedStakes(2);
         assertEq(account, staker2, "Wrong staker2 account");
         assertEq(courtID, GENERAL_COURT, "Wrong court id for staker2");
         assertEq(stake, 0, "Wrong amount for delayed stake of staker2");
-        assertEq(alreadyTransferred, false, "Should be false");
 
-        (account, courtID, stake, alreadyTransferred) = sortitionModule.delayedStakes(3);
+        (account, courtID, stake) = sortitionModule.delayedStakes(3);
         assertEq(account, staker1, "Wrong staker1 account");
         assertEq(courtID, GENERAL_COURT, "Wrong court id for staker1");
         assertEq(stake, 1800, "Wrong amount for delayed stake of staker1");
-        assertEq(alreadyTransferred, false, "Should be false");
 
         // So far the only amount transferred was 10000 by staker2. Staker 1 has two delayed stakes, for 1500 and 1800 pnk.
         assertEq(pinakion.balanceOf(address(core)), 10000, "Wrong token balance of the core");
@@ -394,12 +388,11 @@ contract KlerosCore_StakingTest is KlerosCore_TestBase {
 
         // Check that delayed stakes are nullified
         for (uint i = 2; i <= sortitionModule.delayedStakeWriteIndex(); i++) {
-            (account, courtID, stake, alreadyTransferred) = sortitionModule.delayedStakes(i);
+            (account, courtID, stake) = sortitionModule.delayedStakes(i);
 
             assertEq(account, address(0), "Wrong staker account after delayed stake deletion");
             assertEq(courtID, 0, "Court id should be nullified");
             assertEq(stake, 0, "No amount to stake");
-            assertEq(alreadyTransferred, false, "Should be false");
         }
 
         assertEq(pinakion.balanceOf(staker1), 999999999999998200, "Wrong token balance of staker1");

From 5dc39fa5b269029accef4ef824c4dcaa175158b1 Mon Sep 17 00:00:00 2001
From: unknownunknown1 <danil@kleros.io>
Date: Sat, 6 Sep 2025 00:47:51 +1000
Subject: [PATCH 105/175] feat(DK): struct gaps

---
 .../src/arbitration/dispute-kits/DisputeKitClassicBase.sol  | 6 +++++-
 1 file changed, 5 insertions(+), 1 deletion(-)

diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index d998150e6..d661f8b2d 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -27,6 +27,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         bool jumped; // True if dispute jumped to a parent dispute kit and won't be handled by this DK anymore.
         mapping(uint256 => uint256) coreRoundIDToLocal; // Maps id of the round in the core contract to the index of the round of related local dispute.
         bytes extraData; // Extradata for the dispute.
+        uint256[10] __gap; // Reserved slots for future upgrades.
     }
 
     struct Round {
@@ -42,6 +43,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         uint256 feeRewards; // Sum of reimbursable appeal fees available to the parties that made contributions to the ruling that ultimately wins a dispute.
         uint256[] fundedChoices; // Stores the choices that are fully funded.
         mapping(address drawnAddress => bool) alreadyDrawn; // True if the address has already been drawn, false by default.
+        uint256[10] __gap; // Reserved slots for future upgrades.
     }
 
     struct Vote {
@@ -49,6 +51,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         bytes32 commit; // The commit of the juror. For courts with hidden votes.
         uint256 choice; // The choice of the juror.
         bool voted; // True if the vote has been cast.
+        uint256[10] __gap; // Reserved slots for future upgrades.
     }
 
     // ************************************* //
@@ -246,7 +249,8 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         }
 
         if (_postDrawCheck(round, _coreDisputeID, drawnAddress)) {
-            round.votes.push(Vote({account: drawnAddress, commit: bytes32(0), choice: 0, voted: false}));
+            Vote storage vote = round.votes.push();
+            vote.account = drawnAddress;
             round.alreadyDrawn[drawnAddress] = true;
         } else {
             drawnAddress = address(0);

From 79a458cfd56a9d5c826f2669b434e56436ef1aee Mon Sep 17 00:00:00 2001
From: unknownunknown1 <danil@kleros.io>
Date: Sat, 6 Sep 2025 02:02:40 +1000
Subject: [PATCH 106/175] fix(SM): storage update

---
 contracts/src/arbitration/SortitionModule.sol | 4 ----
 1 file changed, 4 deletions(-)

diff --git a/contracts/src/arbitration/SortitionModule.sol b/contracts/src/arbitration/SortitionModule.sol
index bf61255ae..306a6c289 100644
--- a/contracts/src/arbitration/SortitionModule.sol
+++ b/contracts/src/arbitration/SortitionModule.sol
@@ -27,7 +27,6 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
         address account; // The address of the juror.
         uint96 courtID; // The ID of the court.
         uint256 stake; // The new stake.
-        bool alreadyTransferred; // DEPRECATED. True if tokens were already transferred before delayed stake's execution.
     }
 
     struct Juror {
@@ -46,17 +45,14 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
     uint256 public minStakingTime; // The time after which the phase can be switched to Drawing if there are open disputes.
     uint256 public maxDrawingTime; // The time after which the phase can be switched back to Staking.
     uint256 public lastPhaseChange; // The last time the phase was changed.
-    uint256 public randomNumberRequestBlock; // DEPRECATED: to be removed in the next redeploy
     uint256 public disputesWithoutJurors; // The number of disputes that have not finished drawing jurors.
     IRNG public rng; // The random number generator.
     uint256 public randomNumber; // Random number returned by RNG.
-    uint256 public rngLookahead; // DEPRECATED: to be removed in the next redeploy
     uint256 public delayedStakeWriteIndex; // The index of the last `delayedStake` item that was written to the array. 0 index is skipped.
     uint256 public delayedStakeReadIndex; // The index of the next `delayedStake` item that should be processed. Starts at 1 because 0 index is skipped.
     mapping(TreeKey key => SortitionTrees.Tree) sortitionSumTrees; // The mapping of sortition trees by keys.
     mapping(address account => Juror) public jurors; // The jurors.
     mapping(uint256 => DelayedStake) public delayedStakes; // Stores the stakes that were changed during Drawing phase, to update them when the phase is switched to Staking.
-    mapping(address jurorAccount => mapping(uint96 courtId => uint256)) public latestDelayedStakeIndex; // DEPRECATED. Maps the juror to its latest delayed stake. If there is already a delayed stake for this juror then it'll be replaced. latestDelayedStakeIndex[juror][courtID].
     uint256 public maxStakePerJuror;
     uint256 public maxTotalStaked;
     uint256 public totalStaked;

From 1ec4e023e23c61e91db6dad915d3faf425889bdb Mon Sep 17 00:00:00 2001
From: unknownunknown1 <danil@kleros.io>
Date: Mon, 8 Sep 2025 17:12:44 +1000
Subject: [PATCH 107/175] docs: natspec update

---
 contracts/src/arbitration/KlerosCore.sol      | 117 ++++++++++++++++--
 contracts/src/arbitration/SortitionModule.sol |  28 ++++-
 .../dispute-kits/DisputeKitClassicBase.sol    |  91 ++++----------
 .../dispute-kits/DisputeKitGatedShutter.sol   |  26 ++--
 .../dispute-kits/DisputeKitShutter.sol        |  20 +--
 .../arbitration/interfaces/IArbitrableV2.sol  |   2 +-
 .../arbitration/interfaces/IDisputeKit.sol    |  24 +++-
 .../src/arbitration/interfaces/IEvidence.sol  |   2 +-
 8 files changed, 209 insertions(+), 101 deletions(-)

diff --git a/contracts/src/arbitration/KlerosCore.sol b/contracts/src/arbitration/KlerosCore.sol
index a8c78a910..9c18554e2 100644
--- a/contracts/src/arbitration/KlerosCore.sol
+++ b/contracts/src/arbitration/KlerosCore.sol
@@ -52,7 +52,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         Period period; // The current period of the dispute.
         bool ruled; // True if the ruling has been executed, false otherwise.
         uint256 lastPeriodChange; // The last time the period was changed.
-        Round[] rounds;
+        Round[] rounds; // Rounds of the dispute.
     }
 
     struct Round {
@@ -83,9 +83,9 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
     }
 
     struct CurrencyRate {
-        bool feePaymentAccepted;
-        uint64 rateInEth;
-        uint8 rateDecimals;
+        bool feePaymentAccepted; // True if this token is supported as payment method.
+        uint64 rateInEth; // Rate of the fee token in ETH.
+        uint8 rateDecimals; // Decimals of the fee token rate.
     }
 
     // ************************************* //
@@ -113,10 +113,38 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
     // *              Events               * //
     // ************************************* //
 
+    /// @dev Emitted when period is passed.
+    /// @param _disputeID ID of the related dispute.
+    /// @param _period The new period.
     event NewPeriod(uint256 indexed _disputeID, Period _period);
+
+    /// @dev Emitted when appeal period starts.
+    /// @param _disputeID ID of the related dispute.
+    /// @param _arbitrable The arbitrable contract.
     event AppealPossible(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);
+
+    /// @dev Emitted when the dispute is successfully appealed.
+    /// @param _disputeID ID of the related dispute.
+    /// @param _arbitrable The arbitrable contract.
     event AppealDecision(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);
+
+    /// @dev Emitted when an address is successfully drawn.
+    /// @param _address The drawn address.
+    /// @param _disputeID ID of the related dispute.
+    /// @param _roundID ID of the related round.
+    /// @param _voteID ID of the vote given to the drawn juror.
     event Draw(address indexed _address, uint256 indexed _disputeID, uint256 _roundID, uint256 _voteID);
+
+    /// @dev Emitted when a new court is created.
+    /// @param _courtID ID of the new court.
+    /// @param _parent ID of the parent court.
+    /// @param _hiddenVotes Whether the court has hidden votes or not.
+    /// @param _minStake The `minStake` property value of the court.
+    /// @param _alpha The `alpha` property value of the court.
+    /// @param _feeForJuror The `feeForJuror` property value of the court.
+    /// @param _jurorsForCourtJump The `jurorsForCourtJump` property value of the court.
+    /// @param _timesPerPeriod The `timesPerPeriod` property value of the court.
+    /// @param _supportedDisputeKits Indexes of dispute kits that this court will support.
     event CourtCreated(
         uint96 indexed _courtID,
         uint96 indexed _parent,
@@ -128,6 +156,15 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         uint256[4] _timesPerPeriod,
         uint256[] _supportedDisputeKits
     );
+
+    /// @dev Emitted when court's parameters are changed.
+    /// @param _courtID ID of the court.
+    /// @param _hiddenVotes Whether the court has hidden votes or not.
+    /// @param _minStake The `minStake` property value of the court.
+    /// @param _alpha The `alpha` property value of the court.
+    /// @param _feeForJuror The `feeForJuror` property value of the court.
+    /// @param _jurorsForCourtJump The `jurorsForCourtJump` property value of the court.
+    /// @param _timesPerPeriod The `timesPerPeriod` property value of the court.
     event CourtModified(
         uint96 indexed _courtID,
         bool _hiddenVotes,
@@ -137,20 +174,50 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         uint256 _jurorsForCourtJump,
         uint256[4] _timesPerPeriod
     );
+
+    /// @dev Emitted when a dispute kit is created.
+    /// @param _disputeKitID ID of the new dispute kit.
+    /// @param _disputeKitAddress Address of the new dispute kit.
     event DisputeKitCreated(uint256 indexed _disputeKitID, IDisputeKit indexed _disputeKitAddress);
+
+    /// @dev Emitted when a dispute kit is enabled/disabled in a court.
+    /// @param _courtID ID of the related court.
+    /// @param _disputeKitID ID of the dispute kit.
+    /// @param _enable Whether the dispute kit has been enabled or disabled.
     event DisputeKitEnabled(uint96 indexed _courtID, uint256 indexed _disputeKitID, bool indexed _enable);
+
+    /// @dev Emitted when a dispute jumps to a new court.
+    /// @param _disputeID ID of the dispute.
+    /// @param _roundID ID of the round.
+    /// @param _fromCourtID ID of the previous court.
+    /// @param _toCourtID ID of the new court.
     event CourtJump(
         uint256 indexed _disputeID,
         uint256 indexed _roundID,
         uint96 indexed _fromCourtID,
         uint96 _toCourtID
     );
+
+    /// @dev Emitted when a dispute jumps to a new dispute kit.
+    /// @param _disputeID ID of the dispute.
+    /// @param _roundID ID of the round.
+    /// @param _fromDisputeKitID ID of the previous dispute kit.
+    /// @param _toDisputeKitID ID of the new dispute kit.
     event DisputeKitJump(
         uint256 indexed _disputeID,
         uint256 indexed _roundID,
         uint256 indexed _fromDisputeKitID,
         uint256 _toDisputeKitID
     );
+
+    /// @dev Emitted when juror's balance shifts after penalties/rewards has been processed.
+    /// @param _account Juror's address.
+    /// @param _disputeID ID of the dispute.
+    /// @param _roundID ID of the round.
+    /// @param _degreeOfCoherency Juror's degree of coherency in this round.
+    /// @param _pnkAmount Amount of PNK shifted.
+    /// @param _feeAmount Amount of fee shifted.
+    /// @param _feeToken Address of the fee token.
     event TokenAndETHShift(
         address indexed _account,
         uint256 indexed _disputeID,
@@ -160,6 +227,13 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         int256 _feeAmount,
         IERC20 _feeToken
     );
+
+    /// @dev Emitted when leftover reward sent to owner.
+    /// @param _disputeID ID of the dispute.
+    /// @param _roundID ID of the round.
+    /// @param _pnkAmount Amount of PNK sent.
+    /// @param _feeAmount Amount of fee sent.
+    /// @param _feeToken Address of the fee token.
     event LeftoverRewardSent(
         uint256 indexed _disputeID,
         uint256 indexed _roundID,
@@ -167,7 +241,11 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         uint256 _feeAmount,
         IERC20 _feeToken
     );
+
+    /// @dev Emitted when this contract is paused.
     event Paused();
+
+    /// @dev Emitted when this contract is unpaused.
     event Unpaused();
 
     // ************************************* //
@@ -413,6 +491,14 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         );
     }
 
+    /// @dev Changes the parameters of the court.
+    /// @param _courtID ID of the court.
+    /// @param _hiddenVotes The `hiddenVotes` property value of the court.
+    /// @param _minStake The `minStake` property value of the court.
+    /// @param _alpha The `alpha` property value of the court.
+    /// @param _feeForJuror The `feeForJuror` property value of the court.
+    /// @param _jurorsForCourtJump The `jurorsForCourtJump` property value of the court.
+    /// @param _timesPerPeriod The `timesPerPeriod` property value of the court.
     function changeCourtParameters(
         uint96 _courtID,
         bool _hiddenVotes,
@@ -795,7 +881,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
             }
         }
         if (round.pnkPenalties != pnkPenaltiesInRound) {
-            round.pnkPenalties = pnkPenaltiesInRound; // Reentrancy risk: breaks Check-Effect-Interact
+            round.pnkPenalties = pnkPenaltiesInRound; // Note: Check-Effect-Interaction pattern is compromised here, but in the current state it doesn't cause any issues.
         }
     }
 
@@ -816,7 +902,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
             _params.pnkAtStakePerJurorInRound
         );
 
-        // Guard against degree exceeding 1, though it should be ensured by the dispute kit.
+        // Extra check to guard against degree exceeding 1, though it should be ensured by the dispute kit.
         if (coherence > ONE_BASIS_POINT) {
             coherence = ONE_BASIS_POINT;
         }
@@ -885,7 +971,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
             _params.pnkAtStakePerJurorInRound
         );
 
-        // Guard against degree exceeding 1, though it should be ensured by the dispute kit.
+        // Extra check to guard against degree exceeding 1, though it should be ensured by the dispute kit.
         if (pnkCoherence > ONE_BASIS_POINT) {
             pnkCoherence = ONE_BASIS_POINT;
         }
@@ -908,7 +994,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         // Transfer the fee reward
         _transferFeeToken(round.feeToken, payable(account), feeReward);
 
-        // Stake the PNK reward if possible, by-passes delayed stakes and other checks usually done by validateStake()
+        // Stake the PNK reward if possible, bypasses delayed stakes and other checks done by validateStake()
         if (!sortitionModule.setStakeReward(account, dispute.courtID, pnkReward)) {
             pinakion.safeTransfer(account, pnkReward);
         }
@@ -1102,10 +1188,16 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         return !courts[court.parent].supportedDisputeKits[round.disputeKitID];
     }
 
+    /// @dev Returns the length of disputeKits array.
+    /// @return disputeKits length.
     function getDisputeKitsLength() external view returns (uint256) {
         return disputeKits.length;
     }
 
+    /// @dev Converts ETH into tokens.
+    /// @param _toToken The token to convert ETH into.
+    /// @param _amountInEth ETH amount.
+    /// @return Amount of tokens.
     function convertEthToTokenAmount(IERC20 _toToken, uint256 _amountInEth) public view returns (uint256) {
         return (_amountInEth * 10 ** currencyRates[_toToken].rateDecimals) / currencyRates[_toToken].rateInEth;
     }
@@ -1127,6 +1219,15 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
             disputeKits[_round.disputeKitID].earlyCourtJump(_disputeID) || _round.nbVotes >= _court.jurorsForCourtJump;
     }
 
+    /// @dev Checks whether a dispute will jump to new court/DK, and returns new court and DK.
+    /// @param _dispute Dispute data.
+    /// @param _round Round ID.
+    /// @param _court Current court ID.
+    /// @param _disputeID Dispute ID.
+    /// @return newCourtID Court ID after jump.
+    /// @return newDisputeKitID Dispute kit ID after jump.
+    /// @return courtJump Whether the dispute jumps to a new court or not.
+    /// @return disputeKitJump Whether the dispute jumps to a new dispute kit or not.
     function _getCourtAndDisputeKitJumps(
         Dispute storage _dispute,
         Round storage _round,
diff --git a/contracts/src/arbitration/SortitionModule.sol b/contracts/src/arbitration/SortitionModule.sol
index 306a6c289..c6b62e357 100644
--- a/contracts/src/arbitration/SortitionModule.sol
+++ b/contracts/src/arbitration/SortitionModule.sol
@@ -53,9 +53,9 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
     mapping(TreeKey key => SortitionTrees.Tree) sortitionSumTrees; // The mapping of sortition trees by keys.
     mapping(address account => Juror) public jurors; // The jurors.
     mapping(uint256 => DelayedStake) public delayedStakes; // Stores the stakes that were changed during Drawing phase, to update them when the phase is switched to Staking.
-    uint256 public maxStakePerJuror;
-    uint256 public maxTotalStaked;
-    uint256 public totalStaked;
+    uint256 public maxStakePerJuror; // The maximum amount of PNK a juror can stake in a court.
+    uint256 public maxTotalStaked; // The maximum amount of PNK that can be staked in all courts.
+    uint256 public totalStaked; // The amount that is currently staked in all courts.
 
     // ************************************* //
     // *              Events               * //
@@ -178,10 +178,14 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
         }
     }
 
+    /// @dev Changes the `maxStakePerJuror` storage variable.
+    /// @param _maxStakePerJuror The new `maxStakePerJuror` storage variable.
     function changeMaxStakePerJuror(uint256 _maxStakePerJuror) external onlyByOwner {
         maxStakePerJuror = _maxStakePerJuror;
     }
 
+    /// @dev Changes the `maxTotalStaked` storage variable.
+    /// @param _maxTotalStaked The new `maxTotalStaked` storage variable.
     function changeMaxTotalStaked(uint256 _maxTotalStaked) external onlyByOwner {
         maxTotalStaked = _maxTotalStaked;
     }
@@ -190,6 +194,7 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
     // *         State Modifiers           * //
     // ************************************* //
 
+    /// @dev Passes the phase.
     function passPhase() external {
         if (phase == Phase.staking) {
             if (block.timestamp - lastPhaseChange < minStakingTime) revert MinStakingTimeNotPassed();
@@ -239,10 +244,12 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
         delayedStakeReadIndex = newDelayedStakeReadIndex;
     }
 
+    /// @dev Triggers the state changes after dispute creation.
     function createDisputeHook(uint256 /*_disputeID*/, uint256 /*_roundID*/) external override onlyByCore {
         disputesWithoutJurors++;
     }
 
+    /// @dev Triggers the state changes after drawing.
     function postDrawHook(uint256 /*_disputeID*/, uint256 /*_roundID*/) external override onlyByCore {
         disputesWithoutJurors--;
     }
@@ -452,11 +459,17 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
         emit StakeSet(_account, _courtID, _newStake, juror.stakedPnk);
     }
 
+    /// @dev Locks the tokens of the drawn juror.
+    /// @param _account The address of the juror.
+    /// @param _relativeAmount The amount to lock.
     function lockStake(address _account, uint256 _relativeAmount) external override onlyByCore {
         jurors[_account].lockedPnk += _relativeAmount;
         emit StakeLocked(_account, _relativeAmount, false);
     }
 
+    /// @dev Unlocks the tokens of the drawn juror.
+    /// @param _account The address of the juror.
+    /// @param _relativeAmount The amount to unlock.
     function unlockStake(address _account, uint256 _relativeAmount) external override onlyByCore {
         Juror storage juror = jurors[_account];
         juror.lockedPnk -= _relativeAmount;
@@ -573,10 +586,16 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
         return jurors[_juror].courtIDs;
     }
 
+    /// @dev Checks if the juror is staked in any court.
+    /// @param _juror The address of the juror.
+    /// @return Whether the juror is staked or not.
     function isJurorStaked(address _juror) external view override returns (bool) {
         return jurors[_juror].stakedPnk > 0;
     }
 
+    /// @dev Checks if the juror has any leftover PNK in the contract.
+    /// @param _juror The address of the juror.
+    /// @return Whether the juror has leftover PNK.
     function getJurorLeftoverPNK(address _juror) public view override returns (uint256) {
         Juror storage juror = jurors[_juror];
         if (juror.courtIDs.length == 0 && juror.lockedPnk == 0) {
@@ -590,6 +609,9 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
     // *            Internal               * //
     // ************************************* //
 
+    /// @dev Converts sortition extradata into K value of sortition tree.
+    /// @param _extraData Sortition extra data.
+    /// @return K The value of K.
     function _extraDataToTreeK(bytes memory _extraData) internal pure returns (uint256 K) {
         if (_extraData.length >= 32) {
             assembly {
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index d661f8b2d..b5aa042de 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -198,11 +198,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     // *         State Modifiers           * //
     // ************************************* //
 
-    /// @dev Creates a local dispute and maps it to the dispute ID in the Core contract.
-    /// Note: Access restricted to Kleros Core only.
-    /// @param _coreDisputeID The ID of the dispute in Kleros Core.
-    /// @param _numberOfChoices Number of choices of the dispute
-    /// @param _extraData Additional info about the dispute, for possible use in future dispute kits.
+    /// @inheritdoc IDisputeKit
     function createDispute(
         uint256 _coreDisputeID,
         uint256 _numberOfChoices,
@@ -226,11 +222,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         emit DisputeCreation(_coreDisputeID, _numberOfChoices, _extraData);
     }
 
-    /// @dev Draws the juror from the sortition tree. The drawn address is picked up by Kleros Core.
-    /// Note: Access restricted to Kleros Core only.
-    /// @param _coreDisputeID The ID of the dispute in Kleros Core.
-    /// @param _nonce Nonce of the drawing iteration.
-    /// @return drawnAddress The drawn address.
+    /// @inheritdoc IDisputeKit
     function draw(
         uint256 _coreDisputeID,
         uint256 _nonce
@@ -482,13 +474,11 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     // *           Public Views            * //
     // ************************************* //
 
-    /**
-     * @dev Computes the hash of a vote using ABI encoding
-     * @dev The unused parameters may be used by overriding contracts.
-     * @param _choice The choice being voted for
-     * @param _salt A random salt for commitment
-     * @return bytes32 The hash of the encoded vote parameters
-     */
+    /// @dev Computes the hash of a vote using ABI encoding
+    /// @dev The unused parameters may be used by overriding contracts.
+    /// @param _choice The choice being voted for
+    /// @param _salt A random salt for commitment
+    /// @return bytes32 The hash of the encoded vote parameters
     function hashVote(
         uint256 _choice,
         uint256 _salt,
@@ -497,17 +487,16 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         return keccak256(abi.encodePacked(_choice, _salt));
     }
 
+    /// @dev Returns the rulings that were fully funded in the latest appeal round.
+    /// @param _coreDisputeID The ID of the dispute in Kleros Core.
+    /// @return fundedChoices Fully funded rulings.
     function getFundedChoices(uint256 _coreDisputeID) public view returns (uint256[] memory fundedChoices) {
         Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];
         Round storage lastRound = dispute.rounds[dispute.rounds.length - 1];
         return lastRound.fundedChoices;
     }
 
-    /// @dev Gets the current ruling of a specified dispute.
-    /// @param _coreDisputeID The ID of the dispute in Kleros Core.
-    /// @return ruling The current ruling.
-    /// @return tied Whether it's a tie or not.
-    /// @return overridden Whether the ruling was overridden by appeal funding or not.
+    /// @inheritdoc IDisputeKit
     function currentRuling(
         uint256 _coreDisputeID
     ) external view override returns (uint256 ruling, bool tied, bool overridden) {
@@ -527,12 +516,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         }
     }
 
-    /// @dev Gets the degree of coherence of a particular voter. This function is called by Kleros Core in order to determine the amount of the reward.
-    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
-    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.
-    /// @param _voteID The ID of the vote.
-    /// @return pnkCoherence The degree of coherence in basis points for the dispute PNK reward.
-    /// @return feeCoherence The degree of coherence in basis points for the dispute fee reward.
+    /// @inheritdoc IDisputeKit
     function getDegreeOfCoherenceReward(
         uint256 _coreDisputeID,
         uint256 _coreRoundID,
@@ -544,11 +528,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         return (coherence, coherence);
     }
 
-    /// @dev Gets the degree of coherence of a particular voter. This function is called by Kleros Core in order to determine the amount of the penalty.
-    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
-    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.
-    /// @param _voteID The ID of the vote.
-    /// @return pnkCoherence The degree of coherence in basis points for the dispute PNK reward.
+    /// @inheritdoc IDisputeKit
     function getDegreeOfCoherencePenalty(
         uint256 _coreDisputeID,
         uint256 _coreRoundID,
@@ -576,10 +556,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         }
     }
 
-    /// @dev Gets the number of jurors who are eligible to a reward in this round.
-    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
-    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.
-    /// @return The number of coherent jurors.
+    /// @inheritdoc IDisputeKit
     function getCoherentCount(uint256 _coreDisputeID, uint256 _coreRoundID) external view override returns (uint256) {
         Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];
         Round storage currentRound = dispute.rounds[dispute.coreRoundIDToLocal[_coreRoundID]];
@@ -594,19 +571,14 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         }
     }
 
-    /// @dev Returns true if all of the jurors have cast their commits for the last round.
-    /// @param _coreDisputeID The ID of the dispute in Kleros Core.
-    /// @return Whether all of the jurors have cast their commits for the last round.
+    /// @inheritdoc IDisputeKit
     function areCommitsAllCast(uint256 _coreDisputeID) external view override returns (bool) {
         Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];
         Round storage round = dispute.rounds[dispute.rounds.length - 1];
         return round.totalCommitted == round.votes.length;
     }
 
-    /// @dev Returns true if all of the jurors have cast their votes for the last round.
-    /// Note that this function is to be called directly by the core contract and is not for off-chain usage.
-    /// @param _coreDisputeID The ID of the dispute in Kleros Core.
-    /// @return Whether all of the jurors have cast their votes for the last round.
+    /// @inheritdoc IDisputeKit
     function areVotesAllCast(uint256 _coreDisputeID) external view override returns (bool) {
         Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];
         Round storage round = dispute.rounds[dispute.rounds.length - 1];
@@ -618,10 +590,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         return round.totalVoted == expectedTotalVoted;
     }
 
-    /// @dev Returns true if the appeal funding is finished prematurely (e.g. when losing side didn't fund).
-    /// Note that this function is to be called directly by the core contract and is not for off-chain usage.
-    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
-    /// @return Whether the appeal funding is finished.
+    /// @inheritdoc IDisputeKit
     function isAppealFunded(uint256 _coreDisputeID) external view override returns (bool) {
         (uint256 appealPeriodStart, uint256 appealPeriodEnd) = core.appealPeriod(_coreDisputeID);
 
@@ -632,15 +601,12 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
             ((appealPeriodEnd - appealPeriodStart) * LOSER_APPEAL_PERIOD_MULTIPLIER) / ONE_BASIS_POINT);
     }
 
-    /// @dev Returns true if the dispute is jumping to a parent court.
-    /// @return Whether the dispute is jumping to a parent court or not.
+    /// @inheritdoc IDisputeKit
     function earlyCourtJump(uint256 /* _coreDisputeID */) external pure override returns (bool) {
         return false;
     }
 
-    /// @dev Returns the number of votes after the appeal.
-    /// @param _currentNbVotes The number of votes before the appeal.
-    /// @return The number of votes after the appeal.
+    /// @inheritdoc IDisputeKit
     function getNbVotesAfterAppeal(
         IDisputeKit /* _previousDisputeKit */,
         uint256 _currentNbVotes
@@ -648,18 +614,13 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         return (_currentNbVotes * 2) + 1;
     }
 
-    /// @dev Returns the dispute kid ID be used after court jump by Kleros Core.
-    /// @return The ID of the dispute kit in Kleros Core disputeKits array.
+    /// @inheritdoc IDisputeKit
     function getJumpDisputeKitID() external view override returns (uint256) {
         // Fall back to classic DK in case the jump ID is not defined.
         return jumpDisputeKitID == 0 ? DISPUTE_KIT_CLASSIC : jumpDisputeKitID;
     }
 
-    /// @dev Returns true if the specified voter was active in this round.
-    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
-    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.
-    /// @param _voteID The ID of the voter.
-    /// @return Whether the voter was active or not.
+    /// @inheritdoc IDisputeKit
     function isVoteActive(
         uint256 _coreDisputeID,
         uint256 _coreRoundID,
@@ -670,6 +631,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         return vote.voted;
     }
 
+    /// @inheritdoc IDisputeKit
     function getRoundInfo(
         uint256 _coreDisputeID,
         uint256 _coreRoundID,
@@ -682,7 +644,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
             uint256 winningChoice,
             bool tied,
             uint256 totalVoted,
-            uint256 totalCommited,
+            uint256 totalCommitted,
             uint256 nbVoters,
             uint256 choiceCount
         )
@@ -719,12 +681,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         localRoundID = disputes[localDisputeID].coreRoundIDToLocal[_coreRoundID];
     }
 
-    /// @dev Returns the vote information for a given vote ID.
-    /// @param _coreDisputeID The ID of the dispute in Kleros Core.
-    /// @param _coreRoundID The ID of the round in Kleros Core.
-    /// @param _voteID The ID of the vote.
-    /// @return account The address of the juror who cast the vote.
-    /// @return commit The commit of the vote.
+    /// @inheritdoc IDisputeKit
     function getVoteInfo(
         uint256 _coreDisputeID,
         uint256 _coreRoundID,
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
index 573f81f11..54e1c93b7 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
@@ -132,6 +132,14 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
         emit CommitCastShutter(_coreDisputeID, msg.sender, _commit, _recoveryCommit, _identity, _encryptedVote);
     }
 
+    /// @dev Version of `castVote` function designed specifically for Shutter.
+    /// `O(n)` where
+    /// `n` is the number of votes.
+    /// @param _coreDisputeID The ID of the dispute in Kleros Core.
+    /// @param _voteIDs The IDs of the votes.
+    /// @param _choice The choice.
+    /// @param _salt The salt for the commit if the votes were hidden.
+    /// @param _justification Justification of the choice.
     function castVoteShutter(
         uint256 _coreDisputeID,
         uint256[] calldata _voteIDs,
@@ -154,13 +162,11 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
     // *           Public Views            * //
     // ************************************* //
 
-    /**
-     * @dev Computes the hash of a vote using ABI encoding
-     * @param _choice The choice being voted for
-     * @param _justification The justification for the vote
-     * @param _salt A random salt for commitment
-     * @return bytes32 The hash of the encoded vote parameters
-     */
+    /// @dev Computes the hash of a vote using ABI encoding
+    /// @param _choice The choice being voted for
+    /// @param _salt A random salt for commitment
+    /// @param _justification The justification for the vote
+    /// @return bytes32 The hash of the encoded vote parameters
     function hashVote(
         uint256 _choice,
         uint256 _salt,
@@ -180,11 +186,7 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
     // *            Internal               * //
     // ************************************* //
 
-    /// @dev Returns the expected vote hash for a given vote.
-    /// @param _localDisputeID The ID of the dispute in the Dispute Kit.
-    /// @param _localRoundID The ID of the round in the Dispute Kit.
-    /// @param _voteID The ID of the vote.
-    /// @return The expected vote hash.
+    /// @inheritdoc DisputeKitClassicBase
     function _getExpectedVoteHash(
         uint256 _localDisputeID,
         uint256 _localRoundID,
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol b/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
index bbcb28b24..abb1feed9 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
@@ -116,6 +116,14 @@ contract DisputeKitShutter is DisputeKitClassicBase {
         emit CommitCastShutter(_coreDisputeID, msg.sender, _commit, _recoveryCommit, _identity, _encryptedVote);
     }
 
+    /// @dev Version of `castVote` function designed specifically for Shutter.
+    /// `O(n)` where
+    /// `n` is the number of votes.
+    /// @param _coreDisputeID The ID of the dispute in Kleros Core.
+    /// @param _voteIDs The IDs of the votes.
+    /// @param _choice The choice.
+    /// @param _salt The salt for the commit if the votes were hidden.
+    /// @param _justification Justification of the choice.
     function castVoteShutter(
         uint256 _coreDisputeID,
         uint256[] calldata _voteIDs,
@@ -138,13 +146,11 @@ contract DisputeKitShutter is DisputeKitClassicBase {
     // *           Public Views            * //
     // ************************************* //
 
-    /**
-     * @dev Computes the hash of a vote using ABI encoding
-     * @param _choice The choice being voted for
-     * @param _justification The justification for the vote
-     * @param _salt A random salt for commitment
-     * @return bytes32 The hash of the encoded vote parameters
-     */
+    /// @dev Computes the hash of a vote using ABI encoding
+    /// @param _choice The choice being voted for
+    /// @param _salt A random salt for commitment
+    /// @param _justification The justification for the vote
+    /// @return bytes32 The hash of the encoded vote parameters
     function hashVote(
         uint256 _choice,
         uint256 _salt,
diff --git a/contracts/src/arbitration/interfaces/IArbitrableV2.sol b/contracts/src/arbitration/interfaces/IArbitrableV2.sol
index 22dac6e4a..8751446cd 100644
--- a/contracts/src/arbitration/interfaces/IArbitrableV2.sol
+++ b/contracts/src/arbitration/interfaces/IArbitrableV2.sol
@@ -10,7 +10,7 @@ import "./IArbitratorV2.sol";
 /// - Define the action taken when a ruling is received by the contract.
 /// - Allow dispute creation. For this a function must call arbitrator.createDispute{value: _fee}(_choices,_extraData);
 interface IArbitrableV2 {
-    /// @dev To be emitted when a dispute is created to link the correct meta-evidence to the disputeID.
+    /// @dev To be emitted when a dispute is created to link the correct template to the disputeID.
     /// @param _arbitrator The arbitrator of the contract.
     /// @param _arbitratorDisputeID The identifier of the dispute in the Arbitrator contract.
     /// @param _externalDisputeID An identifier created outside Kleros by the protocol requesting arbitration.
diff --git a/contracts/src/arbitration/interfaces/IDisputeKit.sol b/contracts/src/arbitration/interfaces/IDisputeKit.sol
index a1c25c97c..00966d097 100644
--- a/contracts/src/arbitration/interfaces/IDisputeKit.sol
+++ b/contracts/src/arbitration/interfaces/IDisputeKit.sol
@@ -107,11 +107,13 @@ interface IDisputeKit {
     function areCommitsAllCast(uint256 _coreDisputeID) external view returns (bool);
 
     /// @dev Returns true if all of the jurors have cast their votes for the last round.
+    /// Note that this function is to be called directly by the core contract and is not for off-chain usage.
     /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
     /// @return Whether all of the jurors have cast their votes for the last round.
     function areVotesAllCast(uint256 _coreDisputeID) external view returns (bool);
 
     /// @dev Returns true if the appeal funding is finished prematurely (e.g. when losing side didn't fund).
+    /// Note that this function is to be called directly by the core contract and is not for off-chain usage.
     /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
     /// @return Whether the appeal funding is finished.
     function isAppealFunded(uint256 _coreDisputeID) external view returns (bool);
@@ -128,9 +130,9 @@ interface IDisputeKit {
     function getNbVotesAfterAppeal(
         IDisputeKit _previousDisputeKit,
         uint256 _currentNbVotes
-    ) external view returns (uint256); // TODO: remove previousDisputeKit
+    ) external view returns (uint256);
 
-    /// @dev Returns the dispute kid ID be used after court jump by Kleros Core.
+    /// @dev Returns the dispute kit ID to be used after court jump by Kleros Core.
     /// @return The ID of the dispute kit in Kleros Core disputeKits array.
     function getJumpDisputeKitID() external view returns (uint256);
 
@@ -141,6 +143,16 @@ interface IDisputeKit {
     /// @return Whether the voter was active or not.
     function isVoteActive(uint256 _coreDisputeID, uint256 _coreRoundID, uint256 _voteID) external view returns (bool);
 
+    /// @dev Returns the info of the specified round in the core contract.
+    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
+    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.
+    /// @param _choice The choice to query.
+    /// @return winningChoice The winning choice of this round.
+    /// @return tied Whether it's a tie or not.
+    /// @return totalVoted Number of jurors who cast the vote already.
+    /// @return totalCommited Number of jurors who cast the commit already (only relevant for hidden votes).
+    /// @return nbVoters Total number of voters in this round.
+    /// @return choiceCount Number of votes cast for the queried choice.
     function getRoundInfo(
         uint256 _coreDisputeID,
         uint256 _coreRoundID,
@@ -157,6 +169,14 @@ interface IDisputeKit {
             uint256 choiceCount
         );
 
+    /// @dev Returns the vote information for a given vote ID.
+    /// @param _coreDisputeID The ID of the dispute in Kleros Core.
+    /// @param _coreRoundID The ID of the round in Kleros Core.
+    /// @param _voteID The ID of the vote.
+    /// @return account The address of the juror who cast the vote.
+    /// @return commit The commit of the vote.
+    /// @return choice The choice that got the vote.
+    /// @return voted Whether the vote was cast or not.
     function getVoteInfo(
         uint256 _coreDisputeID,
         uint256 _coreRoundID,
diff --git a/contracts/src/arbitration/interfaces/IEvidence.sol b/contracts/src/arbitration/interfaces/IEvidence.sol
index a7683186a..d995a996b 100644
--- a/contracts/src/arbitration/interfaces/IEvidence.sol
+++ b/contracts/src/arbitration/interfaces/IEvidence.sol
@@ -5,7 +5,7 @@ pragma solidity >=0.8.0 <0.9.0;
 /// @title IEvidence
 interface IEvidence {
     /// @dev To be raised when evidence is submitted. Should point to the resource (evidences are not to be stored on chain due to gas considerations).
-    /// @param _externalDisputeID Unique identifier for this dispute outside Kleros. It's the submitter responsability to submit the right external dispute ID.
+    /// @param _externalDisputeID Unique identifier for this dispute outside Kleros. It's the submitter responsibility to submit the right external dispute ID.
     /// @param _party The address of the party submiting the evidence. Note that 0x0 refers to evidence not submitted by any party.
     /// @param _evidence Stringified evidence object, example: '{"name" : "Justification", "description" : "Description", "fileURI" : "/ipfs/QmWQV5ZFFhEJiW8Lm7ay2zLxC2XS4wx1b2W7FfdrLMyQQc"}'.
     event Evidence(uint256 indexed _externalDisputeID, address indexed _party, string _evidence);

From f1ec484516111e5a5233045546df406fc1201e04 Mon Sep 17 00:00:00 2001
From: unknownunknown1 <danil@kleros.io>
Date: Mon, 8 Sep 2025 17:22:36 +1000
Subject: [PATCH 108/175] fix(SM): shadow var

---
 contracts/src/arbitration/SortitionModule.sol |  6 +++---
 contracts/test/integration/index.ts           | 16 ++++++++++------
 2 files changed, 13 insertions(+), 9 deletions(-)

diff --git a/contracts/src/arbitration/SortitionModule.sol b/contracts/src/arbitration/SortitionModule.sol
index c6b62e357..05b3e63ff 100644
--- a/contracts/src/arbitration/SortitionModule.sol
+++ b/contracts/src/arbitration/SortitionModule.sol
@@ -560,7 +560,7 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
     /// @dev Gets the balance of a juror in a court.
     /// @param _juror The address of the juror.
     /// @param _courtID The ID of the court.
-    /// @return totalStaked The total amount of tokens staked including locked tokens and penalty deductions. Equivalent to the effective stake in the General court.
+    /// @return totalStakedPnk The total amount of tokens staked including locked tokens and penalty deductions. Equivalent to the effective stake in the General court.
     /// @return totalLocked The total amount of tokens locked in disputes.
     /// @return stakedInCourt The amount of tokens staked in the specified court including locked tokens and penalty deductions.
     /// @return nbCourts The number of courts the juror has directly staked in.
@@ -571,10 +571,10 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
         external
         view
         override
-        returns (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts)
+        returns (uint256 totalStakedPnk, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts)
     {
         Juror storage juror = jurors[_juror];
-        totalStaked = juror.stakedPnk;
+        totalStakedPnk = juror.stakedPnk;
         totalLocked = juror.lockedPnk;
         stakedInCourt = stakeOf(_juror, _courtID);
         nbCourts = juror.courtIDs.length;
diff --git a/contracts/test/integration/index.ts b/contracts/test/integration/index.ts
index f3c97b2a1..109d4ad9f 100644
--- a/contracts/test/integration/index.ts
+++ b/contracts/test/integration/index.ts
@@ -76,28 +76,28 @@ describe("Integration tests", async () => {
 
     await core.setStake(1, ONE_THOUSAND_PNK);
     await sortitionModule.getJurorBalance(deployer, 1).then((result) => {
-      expect(result.totalStaked).to.equal(ONE_THOUSAND_PNK);
+      expect(result.totalStakedPnk).to.equal(ONE_THOUSAND_PNK);
       expect(result.totalLocked).to.equal(0);
       logJurorBalance(result);
     });
 
     await core.setStake(1, ONE_HUNDRED_PNK * 5n);
     await sortitionModule.getJurorBalance(deployer, 1).then((result) => {
-      expect(result.totalStaked).to.equal(ONE_HUNDRED_PNK * 5n);
+      expect(result.totalStakedPnk).to.equal(ONE_HUNDRED_PNK * 5n);
       expect(result.totalLocked).to.equal(0);
       logJurorBalance(result);
     });
 
     await core.setStake(1, 0);
     await sortitionModule.getJurorBalance(deployer, 1).then((result) => {
-      expect(result.totalStaked).to.equal(0);
+      expect(result.totalStakedPnk).to.equal(0);
       expect(result.totalLocked).to.equal(0);
       logJurorBalance(result);
     });
 
     await core.setStake(1, ONE_THOUSAND_PNK * 4n);
     await sortitionModule.getJurorBalance(deployer, 1).then((result) => {
-      expect(result.totalStaked).to.equal(ONE_THOUSAND_PNK * 4n);
+      expect(result.totalStakedPnk).to.equal(ONE_THOUSAND_PNK * 4n);
       expect(result.totalLocked).to.equal(0);
       logJurorBalance(result);
     });
@@ -203,6 +203,10 @@ describe("Integration tests", async () => {
   };
 });
 
-const logJurorBalance = async (result: { totalStaked: bigint; totalLocked: bigint }) => {
-  console.log("staked=%s, locked=%s", ethers.formatUnits(result.totalStaked), ethers.formatUnits(result.totalLocked));
+const logJurorBalance = async (result: { totalStakedPnk: bigint; totalLocked: bigint }) => {
+  console.log(
+    "staked=%s, locked=%s",
+    ethers.formatUnits(result.totalStakedPnk),
+    ethers.formatUnits(result.totalLocked)
+  );
 };

From 8b6e1f9c662cf285aa2ac0f75c5bbf375a048f9e Mon Sep 17 00:00:00 2001
From: Harman-singh-waraich <Waraichharman68@gmail.com>
Date: Tue, 9 Sep 2025 00:20:12 +0530
Subject: [PATCH 109/175] fix(web): invalid-dispute-vote-reveal

---
 web/src/pages/Cases/CaseDetails/Voting/Classic/Reveal.tsx | 5 +++++
 1 file changed, 5 insertions(+)

diff --git a/web/src/pages/Cases/CaseDetails/Voting/Classic/Reveal.tsx b/web/src/pages/Cases/CaseDetails/Voting/Classic/Reveal.tsx
index 432f07e2a..5173f7dda 100644
--- a/web/src/pages/Cases/CaseDetails/Voting/Classic/Reveal.tsx
+++ b/web/src/pages/Cases/CaseDetails/Voting/Classic/Reveal.tsx
@@ -149,6 +149,11 @@ const getSaltAndChoice = async (
   if (isUndefined(rawSalt)) return;
   const salt = keccak256(rawSalt);
 
+  // when dispute is invalid, just add RFA to the answers array
+  if (answers.length === 0) {
+    answers.unshift({ id: "0x0", title: "Refuse To Arbitrate", description: "Refuse To Arbitrate" });
+  }
+
   const { choice } = answers.reduce<{ found: boolean; choice: bigint }>(
     (acc, answer) => {
       if (acc.found) return acc;

From 7a78b275e752179f82b6da3679b76a9ab5cf69e3 Mon Sep 17 00:00:00 2001
From: Harman-singh-waraich <Waraichharman68@gmail.com>
Date: Tue, 9 Sep 2025 00:30:01 +0530
Subject: [PATCH 110/175] chore: rabbit-feedback

---
 .../pages/Cases/CaseDetails/Voting/Classic/Reveal.tsx    | 9 +++++----
 1 file changed, 5 insertions(+), 4 deletions(-)

diff --git a/web/src/pages/Cases/CaseDetails/Voting/Classic/Reveal.tsx b/web/src/pages/Cases/CaseDetails/Voting/Classic/Reveal.tsx
index 5173f7dda..3bea21339 100644
--- a/web/src/pages/Cases/CaseDetails/Voting/Classic/Reveal.tsx
+++ b/web/src/pages/Cases/CaseDetails/Voting/Classic/Reveal.tsx
@@ -150,11 +150,12 @@ const getSaltAndChoice = async (
   const salt = keccak256(rawSalt);
 
   // when dispute is invalid, just add RFA to the answers array
-  if (answers.length === 0) {
-    answers.unshift({ id: "0x0", title: "Refuse To Arbitrate", description: "Refuse To Arbitrate" });
-  }
+  const candidates =
+    answers?.length > 0
+      ? answers
+      : [{ id: "0x0", title: "Refuse To Arbitrate", description: "Refuse To Arbitrate" } as Answer];
 
-  const { choice } = answers.reduce<{ found: boolean; choice: bigint }>(
+  const { choice } = candidates.reduce<{ found: boolean; choice: bigint }>(
     (acc, answer) => {
       if (acc.found) return acc;
       const innerCommit = keccak256(encodePacked(["uint256", "uint256"], [BigInt(answer.id), BigInt(salt)]));

From 83a21bd426d078d26c731f004852a092eb477c8e Mon Sep 17 00:00:00 2001
From: Harman-singh-waraich <Waraichharman68@gmail.com>
Date: Tue, 9 Sep 2025 16:21:28 +0530
Subject: [PATCH 111/175] feat(web): dynamic-dispute-kit-feature-selection

---
 .../DisputeFeatures/Features/ClassicVote.tsx  |  31 +++
 .../DisputeFeatures/Features/GatedErc1155.tsx | 121 +++++++++
 .../DisputeFeatures/Features/GatedErc20.tsx   | 105 ++++++++
 .../DisputeFeatures/Features/index.tsx        |  50 ++++
 .../components/DisputeFeatures/GroupsUI.tsx   |  53 ++++
 web/src/consts/disputeFeature.ts              | 242 +++++++++++++++++
 web/src/context/NewDisputeContext.tsx         |  29 +-
 web/src/hooks/queries/useCourtDetails.ts      |   1 +
 .../FeatureSelection/FeatureSkeleton.tsx      |  47 ++++
 .../FeatureSelection/JurorEligibility.tsx     | 248 ------------------
 .../Court/FeatureSelection/ShieldedVoting.tsx | 107 --------
 .../Court/FeatureSelection/index.tsx          | 166 +++++++++---
 .../pages/Resolver/Parameters/Court/index.tsx |   7 +-
 13 files changed, 793 insertions(+), 414 deletions(-)
 create mode 100644 web/src/components/DisputeFeatures/Features/ClassicVote.tsx
 create mode 100644 web/src/components/DisputeFeatures/Features/GatedErc1155.tsx
 create mode 100644 web/src/components/DisputeFeatures/Features/GatedErc20.tsx
 create mode 100644 web/src/components/DisputeFeatures/Features/index.tsx
 create mode 100644 web/src/components/DisputeFeatures/GroupsUI.tsx
 create mode 100644 web/src/consts/disputeFeature.ts
 create mode 100644 web/src/pages/Resolver/Parameters/Court/FeatureSelection/FeatureSkeleton.tsx
 delete mode 100644 web/src/pages/Resolver/Parameters/Court/FeatureSelection/JurorEligibility.tsx
 delete mode 100644 web/src/pages/Resolver/Parameters/Court/FeatureSelection/ShieldedVoting.tsx

diff --git a/web/src/components/DisputeFeatures/Features/ClassicVote.tsx b/web/src/components/DisputeFeatures/Features/ClassicVote.tsx
new file mode 100644
index 000000000..efc780a02
--- /dev/null
+++ b/web/src/components/DisputeFeatures/Features/ClassicVote.tsx
@@ -0,0 +1,31 @@
+import React from "react";
+
+import { useNewDisputeContext } from "context/NewDisputeContext";
+
+import { useCourtDetails } from "queries/useCourtDetails";
+
+import WithHelpTooltip from "components/WithHelpTooltip";
+
+import { RadioInput, StyledRadio } from ".";
+
+const ClassicVote: React.FC<RadioInput> = (props) => {
+  const { disputeData } = useNewDisputeContext();
+  const { data: courtData } = useCourtDetails(disputeData.courtId);
+  const isCommitEnabled = Boolean(courtData?.court?.hiddenVotes);
+  return (
+    <WithHelpTooltip
+      tooltipMsg={
+        isCommitEnabled
+          ? `The jurors' votes are hidden. 
+        Nobody can see them before the voting period completes. 
+        (It takes place in two steps commit-reveal)`
+          : `The jurors' votes are not hidden. 
+        Everybody can see the justification and voted choice before the voting period completes.`
+      }
+    >
+      <StyledRadio label={isCommitEnabled ? "Two-steps commit-reveal" : "Classic one step voting"} small {...props} />
+    </WithHelpTooltip>
+  );
+};
+
+export default ClassicVote;
diff --git a/web/src/components/DisputeFeatures/Features/GatedErc1155.tsx b/web/src/components/DisputeFeatures/Features/GatedErc1155.tsx
new file mode 100644
index 000000000..1467379ca
--- /dev/null
+++ b/web/src/components/DisputeFeatures/Features/GatedErc1155.tsx
@@ -0,0 +1,121 @@
+import React, { useEffect, useMemo } from "react";
+import styled from "styled-components";
+
+import { Field } from "@kleros/ui-components-library";
+
+import { IGatedDisputeData, useNewDisputeContext } from "context/NewDisputeContext";
+import { useERC1155Validation } from "hooks/useTokenAddressValidation";
+
+import { isUndefined } from "src/utils";
+
+import WithHelpTooltip from "components/WithHelpTooltip";
+
+import { RadioInput, StyledRadio } from ".";
+
+const FieldContainer = styled.div`
+  width: 100%;
+  padding-left: 32px;
+`;
+
+const StyledField = styled(Field)`
+  width: 100%;
+  margin-top: 8px;
+  margin-bottom: 32px;
+  > small {
+    margin-top: 16px;
+  }
+`;
+
+const GatedErc1155: React.FC<RadioInput> = (props) => {
+  const { disputeData, setDisputeData } = useNewDisputeContext();
+
+  const tokenGateAddress = (disputeData.disputeKitData as IGatedDisputeData)?.tokenGate ?? "";
+  const validationEnabled = !isUndefined(tokenGateAddress) && tokenGateAddress.trim() !== "";
+
+  const {
+    isValidating,
+    isValid,
+    error: validationError,
+  } = useERC1155Validation({
+    address: tokenGateAddress,
+    enabled: validationEnabled,
+  });
+
+  const [validationMessage, variant] = useMemo(() => {
+    if (isValidating) return [`Validating ERC-1155 token...`, "info"];
+    else if (validationError) return [validationError, "error"];
+    else if (isValid === true) return [`Valid ERC-1155 token`, "success"];
+    else return [undefined, "info"];
+  }, [isValidating, validationError, isValid]);
+
+  // Update validation state in dispute context
+  useEffect(() => {
+    // this can clash with erc20 check
+    if (!props.checked) return;
+    // Only update if isValid has actually changed
+    if (disputeData.disputeKitData) {
+      const currentData = disputeData.disputeKitData as IGatedDisputeData;
+
+      if (currentData.isTokenGateValid !== isValid) {
+        setDisputeData({
+          ...disputeData,
+          disputeKitData: { ...currentData, isTokenGateValid: isValid },
+        });
+      }
+    }
+  }, [isValid, setDisputeData, props.checked]);
+
+  const handleTokenAddressChange = (event: React.ChangeEvent<HTMLInputElement>) => {
+    const currentData = disputeData.disputeKitData as IGatedDisputeData;
+
+    setDisputeData({
+      ...disputeData,
+      disputeKitData: {
+        ...currentData,
+        tokenGate: event.target.value,
+        isTokenGateValid: null, // Reset validation state when address changes
+      },
+    });
+  };
+
+  const handleTokenIdChange = (event: React.ChangeEvent<HTMLInputElement>) => {
+    const currentData = disputeData.disputeKitData as IGatedDisputeData;
+    // DEV: we only update the tokenGate value here, and the disputeKidID,
+    // and type are still handled in Resolver/Court/FeatureSelection.tsx
+    setDisputeData({
+      ...disputeData,
+      disputeKitData: { ...currentData, tokenId: event.target.value },
+    });
+  };
+
+  return (
+    <>
+      <WithHelpTooltip
+        tooltipMsg="Only jurors who possess the token or NFT indicated below can be selected as jurors for this case.
+        Add the token address below."
+      >
+        <StyledRadio label="Jurors owning at least 1 token ERC-1155" small {...props} />
+      </WithHelpTooltip>
+      {props.checked ? (
+        <FieldContainer>
+          <StyledField
+            dir="auto"
+            onChange={handleTokenAddressChange}
+            value={tokenGateAddress}
+            placeholder="Eg. 0xda10009cbd5d07dd0cecc66161fc93d7c9000da1"
+            variant={variant}
+            message={validationMessage}
+          />
+          <StyledField
+            dir="auto"
+            onChange={handleTokenIdChange}
+            value={(disputeData.disputeKitData as IGatedDisputeData)?.tokenId ?? "0"}
+            placeholder="Eg. 1"
+          />
+        </FieldContainer>
+      ) : null}
+    </>
+  );
+};
+
+export default GatedErc1155;
diff --git a/web/src/components/DisputeFeatures/Features/GatedErc20.tsx b/web/src/components/DisputeFeatures/Features/GatedErc20.tsx
new file mode 100644
index 000000000..748f320a2
--- /dev/null
+++ b/web/src/components/DisputeFeatures/Features/GatedErc20.tsx
@@ -0,0 +1,105 @@
+import React, { useEffect, useMemo } from "react";
+import styled from "styled-components";
+
+import { Field } from "@kleros/ui-components-library";
+
+import { IGatedDisputeData, useNewDisputeContext } from "context/NewDisputeContext";
+import { useERC20ERC721Validation } from "hooks/useTokenAddressValidation";
+
+import { isUndefined } from "src/utils";
+
+import WithHelpTooltip from "components/WithHelpTooltip";
+
+import { RadioInput, StyledRadio } from ".";
+
+const FieldContainer = styled.div`
+  width: 100%;
+  padding-left: 32px;
+`;
+
+const StyledField = styled(Field)`
+  width: 100%;
+  margin-top: 8px;
+  margin-bottom: 32px;
+  > small {
+    margin-top: 16px;
+  }
+`;
+
+const GatedErc20: React.FC<RadioInput> = (props) => {
+  const { disputeData, setDisputeData } = useNewDisputeContext();
+
+  const tokenGateAddress = (disputeData.disputeKitData as IGatedDisputeData)?.tokenGate ?? "";
+  const validationEnabled = !isUndefined(tokenGateAddress) && tokenGateAddress.trim() !== "";
+
+  const {
+    isValidating,
+    isValid,
+    error: validationError,
+  } = useERC20ERC721Validation({
+    address: tokenGateAddress,
+    enabled: validationEnabled && props.checked,
+  });
+
+  const [validationMessage, variant] = useMemo(() => {
+    if (isValidating) return [`Validating ERC-20 or ERC-721 token...`, "info"];
+    else if (validationError) return [validationError, "error"];
+    else if (isValid === true) return [`Valid ERC-20 or ERC-721 token`, "success"];
+    else return [undefined, "info"];
+  }, [isValidating, validationError, isValid]);
+
+  // Update validation state in dispute context
+  useEffect(() => {
+    // this can clash with erc1155 check
+    if (!props.checked) return;
+    if (disputeData.disputeKitData) {
+      const currentData = disputeData.disputeKitData as IGatedDisputeData;
+
+      if (currentData.isTokenGateValid !== isValid) {
+        setDisputeData({
+          ...disputeData,
+          disputeKitData: { ...currentData, isTokenGateValid: isValid },
+        });
+      }
+    }
+  }, [isValid, setDisputeData, props.checked]);
+
+  const handleTokenAddressChange = (event: React.ChangeEvent<HTMLInputElement>) => {
+    const currentData = disputeData.disputeKitData as IGatedDisputeData;
+    // DEV: we only update the tokenGate value here, and the disputeKidID,
+    // and type are still handled in Resolver/Court/FeatureSelection.tsx
+    setDisputeData({
+      ...disputeData,
+      disputeKitData: {
+        ...currentData,
+        tokenGate: event.target.value,
+        isTokenGateValid: null, // Reset validation state when address changes
+      },
+    });
+  };
+
+  return (
+    <>
+      <WithHelpTooltip
+        tooltipMsg="Only jurors who possess the token or NFT indicated below can be selected as jurors for this case.
+        Add the token address below."
+      >
+        <StyledRadio label="Jurors owning at least 1 token ERC-20 or ERC-721" small {...props} />
+      </WithHelpTooltip>
+      {props.checked ? (
+        <FieldContainer>
+          <StyledField
+            dir="auto"
+            onChange={handleTokenAddressChange}
+            value={tokenGateAddress}
+            placeholder="Eg. 0xda10009cbd5d07dd0cecc66161fc93d7c9000da1"
+            variant={variant}
+            message={validationMessage}
+          />
+        </FieldContainer>
+      ) : null}
+    </>
+  );
+};
+
+export default GatedErc20;
diff --git a/web/src/components/DisputeFeatures/Features/index.tsx b/web/src/components/DisputeFeatures/Features/index.tsx
new file mode 100644
index 000000000..5c3157a52
--- /dev/null
+++ b/web/src/components/DisputeFeatures/Features/index.tsx
@@ -0,0 +1,50 @@
+import React from "react";
+import styled from "styled-components";
+
+import { Radio } from "@kleros/ui-components-library";
+
+import { Features } from "consts/disputeFeature";
+
+import WithHelpTooltip from "components/WithHelpTooltip";
+
+import ClassicVote from "./ClassicVote";
+import GatedErc1155 from "./GatedErc1155";
+import GatedErc20 from "./GatedErc20";
+
+export type RadioInput = {
+  name: string;
+  value: Features;
+  checked: boolean;
+  disabled: boolean;
+  onClick: () => void;
+};
+
+export type FeatureUI = (props: RadioInput) => JSX.Element;
+
+export const StyledRadio = styled(Radio)`
+  font-size: 14px;
+  color: ${({ theme, disabled }) => (disabled ? theme.secondaryText : theme.primaryText)};
+  opacity: ${({ disabled }) => (disabled ? "0.7" : 1)};
+`;
+
+export const FeatureUIs: Record<Features, FeatureUI> = {
+  [Features.ShieldedVote]: (props: RadioInput) => (
+    <WithHelpTooltip
+      tooltipMsg={`The jurors' votes are hidden. 
+        Nobody can see them before the voting period completes. 
+        (It takes place in one step via Shutter Network)`}
+    >
+      <StyledRadio label="Single-step via Shutter Network" small {...props} />
+    </WithHelpTooltip>
+  ),
+
+  [Features.ClassicVote]: (props: RadioInput) => <ClassicVote {...props} />,
+
+  [Features.ClassicEligibility]: (props: RadioInput) => (
+    <StyledRadio label="All the jurors in this court" small {...props} />
+  ),
+
+  [Features.GatedErc20]: (props: RadioInput) => <GatedErc20 {...props} />,
+
+  [Features.GatedErc1155]: (props: RadioInput) => <GatedErc1155 {...props} />,
+};
diff --git a/web/src/components/DisputeFeatures/GroupsUI.tsx b/web/src/components/DisputeFeatures/GroupsUI.tsx
new file mode 100644
index 000000000..4a2714287
--- /dev/null
+++ b/web/src/components/DisputeFeatures/GroupsUI.tsx
@@ -0,0 +1,53 @@
+import React from "react";
+import styled from "styled-components";
+
+import { Group } from "consts/disputeFeature";
+
+const Container = styled.div`
+  width: 100%;
+  display: flex;
+  flex-direction: column;
+  gap: 16px;
+  align-items: start;
+  padding-bottom: 16px;
+`;
+
+const HeaderContainer = styled.div`
+  width: 100%;
+  padding-top: 16px;
+`;
+
+const Header = styled.h2`
+  font-size: 16px;
+  font-weight: 600;
+  margin: 0;
+`;
+
+const SubTitle = styled.p`
+  font-size: 14px;
+  color: ${({ theme }) => theme.secondaryText};
+  padding: 0;
+  margin: 0;
+`;
+
+export type GroupUI = (props: { children: JSX.Element }) => JSX.Element;
+export const GroupsUI: Record<Group, GroupUI> = {
+  [Group.Voting]: ({ children }) => (
+    <Container key={Group.Voting}>
+      <HeaderContainer>
+        <Header>Shielded Voting</Header>
+        <SubTitle>It hides the jurors&apos; votes until the end of the voting period.</SubTitle>
+      </HeaderContainer>
+      {children}
+    </Container>
+  ),
+  [Group.Eligibility]: ({ children }) => (
+    <Container key={Group.Eligibility}>
+      <HeaderContainer>
+        <Header>Jurors Eligibility</Header>
+        <SubTitle>Who can be selected as a juror?.</SubTitle>
+      </HeaderContainer>
+      {children}
+    </Container>
+  ),
+};
diff --git a/web/src/consts/disputeFeature.ts b/web/src/consts/disputeFeature.ts
new file mode 100644
index 000000000..a6f257c48
--- /dev/null
+++ b/web/src/consts/disputeFeature.ts
@@ -0,0 +1,242 @@
+export enum Group {
+  Voting = "Voting",
+  Eligibility = "Eligibility",
+}
+
+/** A single feature, grouped into categories. has to be atomic.
+ * For gated, we split them into atomic erc20 and erc1155 */
+export enum Features {
+  ShieldedVote = "shieldedVote",
+  ClassicVote = "classicVote",
+  ClassicEligibility = "classicEligibility",
+  GatedErc20 = "gatedErc20",
+  GatedErc1155 = "gatedErc1155",
+}
+
+/** Group of features (like radio buttons per category) */
+export type FeatureGroups = Record<string, Features[]>;
+
+/** Definition of a dispute kit */
+export interface DisputeKit {
+  id: number;
+  /**
+   * The feature sets this kit supports.
+   * Each array represents a valid configuration, and has to be 1:1,
+   * if either subset matches the selected feature array this dispute kit is selected
+   */
+  featureSets: Features[][];
+  /**
+   * If true => kit accepts any subset of a featureSet.
+   * If false => must be an exact match.
+   */
+  allowSubset?: boolean;
+
+  type: "general" | "gated";
+}
+
+export type DisputeKits = DisputeKit[];
+
+// groups
+// withing a group only one feature can be selected, we deselect the other one when a new one is selected
+// we don't use these directly in here for utils because these need to be filtered based on court selection.
+// NOTE: a feature cannot appear in more than one Group
+// DEV: the order of features in array , determine the order the radios appear on UI
+export const featureGroups: FeatureGroups = {
+  [Group.Voting]: [Features.ClassicVote, Features.ShieldedVote],
+  [Group.Eligibility]: [Features.ClassicEligibility, Features.GatedErc20, Features.GatedErc1155],
+};
+
+// dispute kits
+// each array is a unique match, for multiple combinations, add more arrays.
+export const disputeKits: DisputeKits = [
+  {
+    id: 1,
+    featureSets: [[Features.ClassicVote, Features.ClassicEligibility]],
+    type: "general",
+  }, // strict
+  { id: 2, featureSets: [[Features.ShieldedVote, Features.ClassicEligibility]], type: "general" }, // strict
+  {
+    id: 3,
+    // strictly keep the common feature in front and in order.
+    featureSets: [
+      [Features.ClassicVote, Features.GatedErc20],
+      [Features.ClassicVote, Features.GatedErc1155],
+    ],
+    allowSubset: true,
+    type: "gated",
+  },
+  {
+    id: 4,
+    featureSets: [
+      [Features.ShieldedVote, Features.GatedErc20],
+      [Features.ShieldedVote, Features.GatedErc1155],
+    ],
+    allowSubset: true,
+    type: "gated",
+  },
+];
+
+/** Canonical string for a feature set (order-independent) */
+function normalize(features: Features[]): string {
+  return [...features].sort().join("|");
+}
+
+/** Check if `a` is exactly the same as `b` (order-insensitive) */
+function arraysEqual(a: Features[], b: Features[]): boolean {
+  return normalize(a) === normalize(b);
+}
+
+/** Check if `a` is a superset of `b` */
+function includesAll(a: Features[], b: Features[]): boolean {
+  const setA = new Set(a);
+  return b.every((x) => setA.has(x));
+}
+
+/**
+ * Toggle a feature, ensuring radio behavior per group
+ * @returns the updated selected features array
+ */
+export function toggleFeature(selected: Features[], feature: Features, groups: FeatureGroups): Features[] {
+  const group = Object.entries(groups).find(([_, feats]) => feats.includes(feature));
+  if (!group) return selected; // not found in any group
+  const [_, features] = group; // <= this is the group we are making selection in currently
+
+  // Remove any feature from this group
+  const withoutGroup = selected.filter((f) => !features.includes(f));
+
+  // If it was already selected => deselect
+  if (selected.includes(feature)) {
+    return withoutGroup;
+  }
+
+  // Otherwise => select this one
+  return [...withoutGroup, feature];
+}
+
+/**
+ * Find dispute kits that match the given selection
+ */
+export function findMatchingKits(selected: Features[], kits: DisputeKits): DisputeKit[] {
+  return kits.filter((kit) =>
+    kit.featureSets.some(
+      (set) =>
+        kit.allowSubset
+          ? includesAll(selected, set) // kit allows subset
+          : arraysEqual(set, selected) // strict exact match
+    )
+  );
+}
+
+/**
+ * Ensures that the current selection of features is always in a valid state.
+ * We use this just to make sure we don't accidently allow user to select an invalid state in handleToggle
+ *
+ * "Valid" means:
+ *   - Either matches at least one dispute kit fully, OR
+ *   - Could still be completed into a valid kit (prefix of a valid set).
+ *
+ * If the selection is invalid:
+ *   1. Try removing one conflicting group to recover validity.
+ *   2. If nothing works, fallback to keeping only the last clicked feature.
+ *
+ * @returns  A corrected selection that is guaranteed to be valid.
+ */
+export function ensureValidSmart(selected: Features[], groups: FeatureGroups, kits: DisputeKits): Features[] {
+  // --- Helper: checks if a candidate is valid or could still become valid ---
+  function isValidOrPrefix(candidate: Features[]): boolean {
+    return (
+      findMatchingKits(candidate, kits).length > 0 ||
+      kits.some((kit) =>
+        kit.featureSets.some(
+          (set) => candidate.every((f) => set.includes(f)) // prefix check
+        )
+      )
+    );
+  }
+
+  // --- Case 1: Current selection is already valid ---
+  if (isValidOrPrefix(selected)) {
+    return selected;
+  }
+
+  // --- Case 2: Try fixing by removing one group at a time ---
+  for (const [_, features] of Object.entries(groups)) {
+    const withoutGroup = selected.filter((f) => !features.includes(f));
+    if (isValidOrPrefix(withoutGroup)) {
+      return withoutGroup;
+    }
+  }
+
+  // --- Case 3: Fallback to only the last picked feature ---
+  return selected.length > 0 ? [selected[selected.length - 1]] : [];
+}
+
+// Checks if the candidate if selected, can still lead to a match
+function canStillLeadToMatch(candidate: Features[], kits: DisputeKits): boolean {
+  return kits.some((kit) =>
+    kit.featureSets.some((set) =>
+      // candidate must be subset of this set
+      candidate.every((f) => set.includes(f))
+    )
+  );
+}
+
+/**
+ * Compute which features should be disabled,
+ * given the current selection.
+ */
+export function getDisabledOptions(selected: Features[], groups: FeatureGroups, kits: DisputeKits): Set<Features> {
+  const disabled = new Set<Features>();
+
+  // If nothing is selected => allow all
+  if (selected.length === 0) {
+    return disabled;
+  }
+
+  for (const [_, features] of Object.entries(groups)) {
+    for (const feature of features) {
+      const candidate = toggleFeature(selected, feature, groups);
+
+      // Instead of only checking full matches:
+      const valid = findMatchingKits(candidate, kits).length > 0 || canStillLeadToMatch(candidate, kits);
+
+      if (!valid) {
+        disabled.add(feature);
+      }
+    }
+  }
+
+  return disabled;
+}
+
+/**
+ * Features that are visible for a given court,
+ * based only on the kits that court supports.
+ */
+export function getVisibleFeaturesForCourt(
+  supportedKits: number[],
+  allKits: DisputeKits,
+  groups: FeatureGroups
+): FeatureGroups {
+  // Get supported kits for this court
+  const filteredKits = allKits.filter((kit) => supportedKits.includes(kit.id));
+
+  // Gather all features that appear in these kits
+  const visible = new Set<Features>();
+  for (const kit of filteredKits) {
+    for (const set of kit.featureSets) {
+      set.forEach((f) => visible.add(f));
+    }
+  }
+
+  // Filter groups => only keep features that are visible
+  const filteredGroups: FeatureGroups = {};
+  for (const [groupName, features] of Object.entries(groups)) {
+    const visibleFeatures = features.filter((f) => visible.has(f));
+    if (visibleFeatures.length > 0) {
+      filteredGroups[groupName] = visibleFeatures;
+    }
+  }
+
+  return filteredGroups;
+}
diff --git a/web/src/context/NewDisputeContext.tsx b/web/src/context/NewDisputeContext.tsx
index e59c9cfc3..25fdb1ccd 100644
--- a/web/src/context/NewDisputeContext.tsx
+++ b/web/src/context/NewDisputeContext.tsx
@@ -4,9 +4,8 @@ import { useLocation } from "react-router-dom";
 import { Address } from "viem";
 
 import { DEFAULT_CHAIN } from "consts/chains";
+import { Features } from "consts/disputeFeature";
 import { klerosCoreAddress } from "hooks/contracts/generated";
-import { useSupportedDisputeKits } from "hooks/queries/useSupportedDisputeKits";
-import { useDisputeKitAddressesAll } from "hooks/useDisputeKitAddresses";
 import { useLocalStorage } from "hooks/useLocalStorage";
 import { isEmpty, isUndefined } from "utils/index";
 
@@ -93,7 +92,8 @@ interface INewDisputeContext {
   setIsBatchCreation: (isBatchCreation: boolean) => void;
   batchSize: number;
   setBatchSize: (batchSize?: number) => void;
-  disputeKitOptions: DisputeKitOption[];
+  selectedFeatures: Features[];
+  setSelectedFeatures: React.Dispatch<React.SetStateAction<Features[]>>;
 }
 
 const getInitialDisputeData = (): IDisputeData => ({
@@ -129,6 +129,7 @@ export const NewDisputeProvider: React.FC<{ children: React.ReactNode }> = ({ ch
   const [isPolicyUploading, setIsPolicyUploading] = useState<boolean>(false);
   const [isBatchCreation, setIsBatchCreation] = useState<boolean>(false);
   const [batchSize, setBatchSize] = useLocalStorage<number>("disputeBatchSize", MIN_DISPUTE_BATCH_SIZE);
+  const [selectedFeatures, setSelectedFeatures] = useState<Features[]>([]);
 
   const disputeTemplate = useMemo(() => constructDisputeTemplate(disputeData), [disputeData]);
   const location = useLocation();
@@ -148,22 +149,6 @@ export const NewDisputeProvider: React.FC<{ children: React.ReactNode }> = ({ ch
     // eslint-disable-next-line react-hooks/exhaustive-deps
   }, [location.pathname]);
 
-  const { data: supportedDisputeKits } = useSupportedDisputeKits(disputeData.courtId);
-  const { availableDisputeKits } = useDisputeKitAddressesAll();
-
-  const disputeKitOptions: DisputeKitOption[] = useMemo(() => {
-    return (
-      supportedDisputeKits?.court?.supportedDisputeKits.map((dk) => {
-        const text = availableDisputeKits[dk.address.toLowerCase()] ?? "";
-        return {
-          text,
-          value: Number(dk.id),
-          gated: text === DisputeKits.Gated || text === DisputeKits.GatedShutter,
-        };
-      }) || []
-    );
-  }, [supportedDisputeKits, availableDisputeKits]);
-
   const contextValues = useMemo(
     () => ({
       disputeData,
@@ -178,7 +163,8 @@ export const NewDisputeProvider: React.FC<{ children: React.ReactNode }> = ({ ch
       setIsBatchCreation,
       batchSize,
       setBatchSize,
-      disputeKitOptions,
+      selectedFeatures,
+      setSelectedFeatures,
     }),
     [
       disputeData,
@@ -191,7 +177,8 @@ export const NewDisputeProvider: React.FC<{ children: React.ReactNode }> = ({ ch
       setIsBatchCreation,
       batchSize,
       setBatchSize,
-      disputeKitOptions,
+      selectedFeatures,
+      setSelectedFeatures,
     ]
   );
 
diff --git a/web/src/hooks/queries/useCourtDetails.ts b/web/src/hooks/queries/useCourtDetails.ts
index 46795d763..5cfa7a2e9 100644
--- a/web/src/hooks/queries/useCourtDetails.ts
+++ b/web/src/hooks/queries/useCourtDetails.ts
@@ -26,6 +26,7 @@ const courtDetailsQuery = graphql(`
       timesPerPeriod
       feeForJuror
       name
+      hiddenVotes
     }
   }
 `);
diff --git a/web/src/pages/Resolver/Parameters/Court/FeatureSelection/FeatureSkeleton.tsx b/web/src/pages/Resolver/Parameters/Court/FeatureSelection/FeatureSkeleton.tsx
new file mode 100644
index 000000000..3e38e8716
--- /dev/null
+++ b/web/src/pages/Resolver/Parameters/Court/FeatureSelection/FeatureSkeleton.tsx
@@ -0,0 +1,47 @@
+import React from "react";
+import styled from "styled-components";
+
+import Skeleton from "react-loading-skeleton";
+
+const Container = styled.div`
+  width: 100%;
+  display: flex;
+  flex-direction: column;
+  gap: 16px;
+  margin-top: 16px;
+`;
+
+const HeaderContainer = styled.div`
+  display: flex;
+  flex-direction: column;
+  gap: 8px;
+`;
+
+const HeaderSkeleton = styled(Skeleton)`
+  width: 25%;
+  height: 22px;
+`;
+
+const SubHeaderSkeleton = styled(Skeleton)`
+  width: 75%;
+  height: 19px;
+`;
+
+const RadioSkeleton = styled(Skeleton)`
+  width: 20%;
+  height: 19px;
+`;
+
+const FeatureSkeleton: React.FC = () => {
+  return (
+    <Container>
+      <HeaderContainer>
+        <HeaderSkeleton /> <SubHeaderSkeleton />
+      </HeaderContainer>
+      <RadioSkeleton />
+      <RadioSkeleton />
+    </Container>
+  );
+};
+
+export default FeatureSkeleton;
diff --git a/web/src/pages/Resolver/Parameters/Court/FeatureSelection/JurorEligibility.tsx b/web/src/pages/Resolver/Parameters/Court/FeatureSelection/JurorEligibility.tsx
deleted file mode 100644
index 3e1febbd4..000000000
--- a/web/src/pages/Resolver/Parameters/Court/FeatureSelection/JurorEligibility.tsx
+++ /dev/null
@@ -1,248 +0,0 @@
-import React, { useEffect, useMemo, useState } from "react";
-import styled from "styled-components";
-
-import { Field, Radio } from "@kleros/ui-components-library";
-
-import { IGatedDisputeData, useNewDisputeContext } from "context/NewDisputeContext";
-import { useERC1155Validation, useERC20ERC721Validation } from "hooks/useTokenAddressValidation";
-
-import { DisputeKits } from "src/consts";
-import { isUndefined } from "src/utils";
-
-import WithHelpTooltip from "components/WithHelpTooltip";
-
-const Container = styled.div`
-  width: 100%;
-  display: flex;
-  flex-direction: column;
-  gap: 16px;
-  align-items: start;
-  padding-top: 16px;
-`;
-
-const HeaderContainer = styled.div`
-  width: 100%;
-  padding-top: 16px;
-`;
-
-const Header = styled.h2`
-  font-size: 16px;
-  font-weight: 600;
-  margin: 0;
-`;
-
-const SubTitle = styled.p`
-  font-size: 14px;
-  color: ${({ theme }) => theme.secondaryText};
-  padding: 0;
-  margin: 0;
-`;
-
-const FieldContainer = styled.div`
-  width: 100%;
-  padding-left: 32px;
-`;
-const StyledField = styled(Field)`
-  width: 100%;
-  margin-top: 8px;
-  margin-bottom: 32px;
-  > small {
-    margin-top: 16px;
-  }
-`;
-
-const StyledRadio = styled(Radio)`
-  font-size: 14px;
-`;
-
-enum EligibilityType {
-  Classic,
-  GatedERC20,
-  GatedERC1155,
-}
-
-const JurorEligibility: React.FC = () => {
-  const [eligibilityType, setEligibilityType] = useState<EligibilityType>();
-  const { disputeData, setDisputeData, disputeKitOptions } = useNewDisputeContext();
-
-  const tokenGateAddress = (disputeData.disputeKitData as IGatedDisputeData)?.tokenGate ?? "";
-  const validationEnabled = !isUndefined(tokenGateAddress) && tokenGateAddress.trim() !== "";
-  const isERC1155 = eligibilityType === EligibilityType.GatedERC1155;
-  const {
-    isValidating: isValidatingERC20,
-    isValid: isValidERC20,
-    error: validationErrorERC20,
-  } = useERC20ERC721Validation({
-    address: tokenGateAddress,
-    enabled: validationEnabled && !isERC1155,
-  });
-
-  const {
-    isValidating: isValidatingERC1155,
-    isValid: isValidERC1155,
-    error: validationErrorERC1155,
-  } = useERC1155Validation({
-    address: tokenGateAddress,
-    enabled: validationEnabled && isERC1155,
-  });
-
-  // Combine validation results based on token type
-  const isValidating = isERC1155 ? isValidatingERC1155 : isValidatingERC20;
-  const isValidToken = isERC1155 ? isValidERC1155 : isValidERC20;
-  const validationError = isERC1155 ? validationErrorERC1155 : validationErrorERC20;
-
-  const [validationMessage, variant] = useMemo(() => {
-    if (isValidating) return [`Validating ${isERC1155 ? "ERC-1155" : "ERC-20 or ERC-721"} token...`, "info"];
-    else if (validationError) return [validationError, "error"];
-    else if (isValidToken === true) return [`Valid ${isERC1155 ? "ERC-1155" : "ERC-20 or ERC-721"} token`, "success"];
-    else return [undefined, "info"];
-  }, [isValidating, validationError, isERC1155, isValidToken]);
-
-  // Update validation state in dispute context
-  useEffect(() => {
-    if (disputeData.disputeKitData) {
-      const currentData = disputeData.disputeKitData as IGatedDisputeData;
-      if (currentData.isTokenGateValid !== isValidToken) {
-        setDisputeData({
-          ...disputeData,
-          disputeKitData: { ...currentData, isTokenGateValid: isValidToken },
-        });
-      }
-    }
-  }, [isValidToken, disputeData.disputeKitData, setDisputeData]);
-
-  const handleTokenAddressChange = (event: React.ChangeEvent<HTMLInputElement>) => {
-    const currentData = disputeData.disputeKitData as IGatedDisputeData;
-    setDisputeData({
-      ...disputeData,
-      disputeKitData: {
-        ...currentData,
-        tokenGate: event.target.value,
-        isTokenGateValid: null, // Reset validation state when address changes
-      },
-    });
-  };
-
-  const handleTokenIdChange = (event: React.ChangeEvent<HTMLInputElement>) => {
-    const currentData = disputeData.disputeKitData as IGatedDisputeData;
-    setDisputeData({
-      ...disputeData,
-      disputeKitData: { ...currentData, tokenId: event.target.value },
-    });
-  };
-
-  useEffect(() => {
-    if (eligibilityType === EligibilityType.Classic) {
-      const disputeKit = disputeKitOptions.find((dk) => dk.text === DisputeKits.Classic);
-
-      setDisputeData({ ...disputeData, disputeKitId: disputeKit?.value, disputeKitData: undefined });
-    } else if (eligibilityType === EligibilityType.GatedERC20 || eligibilityType === EligibilityType.GatedERC1155) {
-      const disputeKitGated = disputeKitOptions.find((dk) => dk.text === DisputeKits.Gated);
-      const disputeKitGatedShutter = disputeKitOptions.find((dk) => dk.text === DisputeKits.GatedShutter);
-
-      const currentDisputeKit = disputeKitOptions.find((dk) => dk.value === disputeData.disputeKitId);
-
-      const disputeKitData: IGatedDisputeData = {
-        ...(disputeData.disputeKitData as IGatedDisputeData),
-        type: "gated",
-        isERC1155: eligibilityType === EligibilityType.GatedERC1155,
-      };
-      // classic is selected, so here we change it to TokenGated
-      if (currentDisputeKit?.text === DisputeKits.Classic) {
-        setDisputeData({
-          ...disputeData,
-          disputeKitId: disputeKitGated?.value,
-          disputeKitData,
-        });
-      }
-      // shutter is selected, so here we change it to TokenGatedShutter
-      else if (currentDisputeKit?.text === DisputeKits.Shutter) {
-        setDisputeData({
-          ...disputeData,
-          disputeKitId: disputeKitGatedShutter?.value,
-          disputeKitData,
-        });
-      } else {
-        setDisputeData({
-          ...disputeData,
-          disputeKitId: disputeKitGated?.value,
-          disputeKitData,
-        });
-      }
-    }
-  }, [eligibilityType, disputeKitOptions]);
-
-  return (
-    <Container>
-      <HeaderContainer>
-        <Header>Jurors Eligibility</Header>
-        <SubTitle>Who can be selected as a juror?.</SubTitle>
-      </HeaderContainer>
-
-      <StyledRadio
-        label="All the jurors in this court"
-        name="classicEligibility"
-        small
-        onChange={() => setEligibilityType(EligibilityType.Classic)}
-        checked={eligibilityType === EligibilityType.Classic}
-      />
-
-      <WithHelpTooltip
-        tooltipMsg="Only jurors who possess the token or NFT indicated below can be selected as jurors for this case.
-        Add the token address below."
-      >
-        <StyledRadio
-          label="Jurors owning at least 1 token ERC-20 or ERC-721"
-          name="erc20Gated"
-          small
-          onChange={() => setEligibilityType(EligibilityType.GatedERC20)}
-          checked={eligibilityType === EligibilityType.GatedERC20}
-        />
-      </WithHelpTooltip>
-      {eligibilityType === EligibilityType.GatedERC20 ? (
-        <FieldContainer>
-          <StyledField
-            dir="auto"
-            onChange={handleTokenAddressChange}
-            value={tokenGateAddress}
-            placeholder="Eg. 0xda10009cbd5d07dd0cecc66161fc93d7c9000da1"
-            variant={variant}
-            message={validationMessage}
-          />
-        </FieldContainer>
-      ) : null}
-      <WithHelpTooltip
-        tooltipMsg="Only jurors who possess the token or NFT indicated below can be selected as jurors for this case.
-        Add the token address below."
-      >
-        <StyledRadio
-          label="Jurors owning at least 1 token ERC-1155"
-          name="erc1155Gated"
-          small
-          onChange={() => setEligibilityType(EligibilityType.GatedERC1155)}
-          checked={eligibilityType === EligibilityType.GatedERC1155}
-        />
-      </WithHelpTooltip>
-      {eligibilityType === EligibilityType.GatedERC1155 ? (
-        <FieldContainer>
-          <StyledField
-            dir="auto"
-            onChange={handleTokenAddressChange}
-            value={tokenGateAddress}
-            placeholder="Eg. 0xda10009cbd5d07dd0cecc66161fc93d7c9000da1"
-            variant={variant}
-            message={validationMessage}
-          />
-          <StyledField
-            dir="auto"
-            onChange={handleTokenIdChange}
-            value={(disputeData.disputeKitData as IGatedDisputeData)?.tokenId ?? "0"}
-            placeholder="Eg. 1"
-          />
-        </FieldContainer>
-      ) : null}
-    </Container>
-  );
-};
-
-export default JurorEligibility;
diff --git a/web/src/pages/Resolver/Parameters/Court/FeatureSelection/ShieldedVoting.tsx b/web/src/pages/Resolver/Parameters/Court/FeatureSelection/ShieldedVoting.tsx
deleted file mode 100644
index 85a5caf98..000000000
--- a/web/src/pages/Resolver/Parameters/Court/FeatureSelection/ShieldedVoting.tsx
+++ /dev/null
@@ -1,107 +0,0 @@
-import React, { useEffect, useState } from "react";
-import styled from "styled-components";
-
-import { Radio } from "@kleros/ui-components-library";
-
-import { useNewDisputeContext } from "context/NewDisputeContext";
-
-import { DisputeKits } from "src/consts";
-
-import WithHelpTooltip from "components/WithHelpTooltip";
-
-const VotingContainer = styled.div`
-  width: 100%;
-  display: flex;
-  flex-direction: column;
-  gap: 16px;
-  align-items: start;
-  border-bottom: 1px solid ${({ theme }) => theme.stroke};
-  padding-bottom: 16px;
-`;
-
-const VotingHeaderContainer = styled.div`
-  width: 100%;
-  padding-top: 16px;
-`;
-
-const VotingHeader = styled.h2`
-  font-size: 16px;
-  font-weight: 600;
-  margin: 0;
-`;
-
-const VotingSubTitle = styled.p`
-  font-size: 14px;
-  color: ${({ theme }) => theme.secondaryText};
-  padding: 0;
-  margin: 0;
-`;
-
-const StyledRadio = styled(Radio)`
-  font-size: 14px;
-`;
-
-enum VotingType {
-  OneStep = "Shutter",
-  TwoStep = "Classic",
-}
-
-// Selects one of Classic or Shutter DisputeKit
-const ShieldedVoting: React.FC = () => {
-  const [votingType, setVotingType] = useState<VotingType>();
-  const { disputeData, setDisputeData, disputeKitOptions } = useNewDisputeContext();
-
-  // we try to keep this structure among feature components
-  // keep in mind the other options that will need to be disabled if a certain feature is selected
-  useEffect(() => {
-    // disable TokenGatedShutter if selected, if TokenGated Selected do nothing
-    if (votingType === VotingType.TwoStep && disputeData.disputeKitData?.type !== "gated") {
-      const disputeKit = disputeKitOptions.find((dk) => dk.text === DisputeKits.Classic);
-
-      setDisputeData({ ...disputeData, disputeKitId: disputeKit?.value });
-    }
-
-    if (votingType === VotingType.OneStep) {
-      // user has already selected TokenGated, so selecting Shutter here, we need to select TokenGatedShutter
-      if (disputeData.disputeKitData?.type === "gated") {
-        const disputeKit = disputeKitOptions.find((dk) => dk.text === DisputeKits.GatedShutter);
-
-        // no need to set DisputeKitData, will already be set by JurorEligibility
-        setDisputeData({ ...disputeData, disputeKitId: disputeKit?.value });
-      } else {
-        const disputeKit = disputeKitOptions.find((dk) => dk.text === DisputeKits.Shutter);
-
-        setDisputeData({ ...disputeData, disputeKitId: disputeKit?.value });
-      }
-    }
-  }, [votingType]);
-
-  return (
-    <VotingContainer>
-      <VotingHeaderContainer>
-        <VotingHeader>Shielded Voting</VotingHeader>
-        <VotingSubTitle>It hides the jurors&apos; votes until the end of the voting period.</VotingSubTitle>
-      </VotingHeaderContainer>
-      <WithHelpTooltip tooltipMsg="The jurors’ votes are hidden. Nobody can see them before the voting period completes. (It takes place in one step via Shutter Network) ">
-        <StyledRadio
-          label="Single-step via Shutter Network"
-          name="shieldedVoting"
-          small
-          onChange={() => setVotingType(VotingType.OneStep)}
-          checked={votingType === VotingType.OneStep}
-        />
-      </WithHelpTooltip>
-      <WithHelpTooltip tooltipMsg="The jurors’ votes are hidden. Nobody can see them before the voting period completes. (It takes place in two steps commit-reveal) ">
-        <StyledRadio
-          label="Two-steps commit-reveal"
-          name="shieldedVoting"
-          small
-          onChange={() => setVotingType(VotingType.TwoStep)}
-          checked={votingType === VotingType.TwoStep}
-        />
-      </WithHelpTooltip>
-    </VotingContainer>
-  );
-};
-
-export default ShieldedVoting;
diff --git a/web/src/pages/Resolver/Parameters/Court/FeatureSelection/index.tsx b/web/src/pages/Resolver/Parameters/Court/FeatureSelection/index.tsx
index 8fdb8d7af..6f6e4f102 100644
--- a/web/src/pages/Resolver/Parameters/Court/FeatureSelection/index.tsx
+++ b/web/src/pages/Resolver/Parameters/Court/FeatureSelection/index.tsx
@@ -1,14 +1,28 @@
-import React, { useEffect, useMemo, useState } from "react";
+import React, { Fragment, useEffect, useMemo } from "react";
 import styled from "styled-components";
 
 import { Card } from "@kleros/ui-components-library";
 
-import { useNewDisputeContext } from "context/NewDisputeContext";
+import {
+  disputeKits,
+  ensureValidSmart,
+  featureGroups,
+  Features,
+  findMatchingKits,
+  getDisabledOptions,
+  getVisibleFeaturesForCourt,
+  toggleFeature,
+} from "consts/disputeFeature";
+import { IGatedDisputeData, useNewDisputeContext } from "context/NewDisputeContext";
 
-import { DisputeKits } from "src/consts";
+import { useSupportedDisputeKits } from "queries/useSupportedDisputeKits";
 
-import JurorEligibility from "./JurorEligibility";
-import ShieldedVoting from "./ShieldedVoting";
+import { isUndefined } from "src/utils";
+
+import { FeatureUIs } from "components/DisputeFeatures/Features";
+import { GroupsUI } from "components/DisputeFeatures/GroupsUI";
+
+import FeatureSkeleton from "./FeatureSkeleton";
 
 const Container = styled(Card)`
   width: 100%;
@@ -26,44 +40,126 @@ const SubTitle = styled.p`
   margin: 0;
 `;
 
+const Separator = styled.hr`
+  width: 100%;
+`;
 const FeatureSelection: React.FC = () => {
-  const [showFeatures, setShowFeatures] = useState(false);
-  const { disputeKitOptions, disputeData, setDisputeData } = useNewDisputeContext();
-
-  // if supported dispute kits have Classic and Shutter
-  const showVotingFeatures = useMemo(() => {
-    return (
-      disputeKitOptions.some((dk) => dk.text === DisputeKits.Classic) &&
-      disputeKitOptions.some((dk) => dk.text === DisputeKits.Shutter)
-    );
-  }, [disputeKitOptions]);
-
-  // if supported dispute kits have Classic, TokenGated, TokenGatedShutter
-  const showEligibilityFeatures = useMemo(() => {
-    return (
-      disputeKitOptions.some((dk) => dk.text === DisputeKits.Classic) &&
-      disputeKitOptions.some((dk) => dk.text === DisputeKits.GatedShutter) &&
-      disputeKitOptions.some((dk) => dk.text === DisputeKits.Gated)
-    );
-  }, [disputeKitOptions]);
+  const {
+    disputeData,
+    setDisputeData,
+    selectedFeatures: selected,
+    setSelectedFeatures: setSelected,
+  } = useNewDisputeContext();
+  const { data: supportedDisputeKits } = useSupportedDisputeKits(disputeData.courtId);
 
+  // DEV: initial feature selection logic, included hardcoded logic
   useEffect(() => {
-    // there's only one, NOTE: what happens when here only TokenGated is support? we need the value
-    if (disputeKitOptions.length === 1) {
-      const disputeKit = disputeKitOptions[0];
-      setDisputeData({ ...disputeData, disputeKitId: disputeKit.value });
-      setShowFeatures(false);
-    } else {
-      setShowFeatures(true);
+    if (!isUndefined(disputeData?.disputeKitId)) {
+      const defaultKit = disputeKits.find((dk) => dk.id === disputeData.disputeKitId);
+      if (!defaultKit) return;
+
+      // some kits like gated can have two feature sets, one for gatedERC20 and other for ERC1155
+      if (defaultKit?.allowSubset) {
+        if ((disputeData?.disputeKitData as IGatedDisputeData)?.isERC1155) {
+          // defaultKit.featureSets[0][0] - is either Classic or Shutter
+          setSelected([defaultKit.featureSets[0][0], Features.GatedErc1155]);
+        } else {
+          setSelected([defaultKit.featureSets[0][0], Features.GatedErc20]);
+        }
+      } else {
+        setSelected(defaultKit.featureSets[0]);
+      }
     }
-  }, [disputeKitOptions]);
+  }, []);
+
+  const allowedDisputeKits = useMemo(() => {
+    if (!supportedDisputeKits?.court?.supportedDisputeKits) return [];
+    const allowedIds = supportedDisputeKits.court.supportedDisputeKits.map((dk) => Number(dk.id));
+    return disputeKits.filter((kit) => allowedIds.includes(kit.id));
+  }, [supportedDisputeKits]);
+
+  // Court specific groups
+  const courtGroups = useMemo(() => {
+    const courtKits = supportedDisputeKits?.court?.supportedDisputeKits.map((dk) => Number(dk.id));
+    if (isUndefined(courtKits) || allowedDisputeKits.length === 0) return {};
+    return getVisibleFeaturesForCourt(courtKits, allowedDisputeKits, featureGroups);
+  }, [supportedDisputeKits, allowedDisputeKits]);
+
+  const disabled = useMemo(
+    () => getDisabledOptions(selected, courtGroups, allowedDisputeKits),
+    [selected, courtGroups, allowedDisputeKits]
+  );
+
+  const matchingKits = useMemo(() => findMatchingKits(selected, allowedDisputeKits), [selected, allowedDisputeKits]);
+
+  const handleToggle = (feature: Features) => {
+    setSelected((prev) => {
+      const toggled = toggleFeature(prev, feature, courtGroups);
+      // we don't necessarily need ensureValidSmart here,
+      // but in case a bug allows picking a disabled option, this will correct that
+      return ensureValidSmart(toggled, courtGroups, allowedDisputeKits);
+    });
+  };
+
+  // if each group only has one feature, select them by default
+  // This should not clash with the initial selection logic,
+  // as it only runs when there's one disputeKit and featureSet to pick
+  useEffect(() => {
+    // if only one disputeKit is found, and that dk has only one featureSEt to pick, then select by default
+    if (allowedDisputeKits.length === 1 && allowedDisputeKits[0].featureSets.length === 1) {
+      setSelected(allowedDisputeKits[0].featureSets[0]);
+    }
+  }, [allowedDisputeKits, setSelected]);
+
+  useEffect(() => {
+    // work of feature selection ends here by giving us the disputeKitId,
+    // any further checks we do separately, like for NextButton
+    // right now we don't have kits that can have same features, so we assume it will be 1 length array
+    if (matchingKits.length === 1) {
+      const selectedKit = matchingKits[0];
+
+      setDisputeData({
+        ...disputeData,
+        disputeKitId: selectedKit.id,
+        disputeKitData:
+          selectedKit.type === "general"
+            ? undefined
+            : ({ ...disputeData.disputeKitData, type: selectedKit.type } as IGatedDisputeData),
+      });
+    } else if (matchingKits.length === 0) {
+      setDisputeData({ ...disputeData, disputeKitId: undefined });
+    }
+    // eslint-disable-next-line react-hooks/exhaustive-deps
+  }, [matchingKits]);
 
-  if (!showFeatures) return null;
   return (
     <Container>
       <SubTitle>Additional features available in this court:</SubTitle>
-      {showVotingFeatures ? <ShieldedVoting /> : null}
-      {showEligibilityFeatures ? <JurorEligibility /> : null}
+
+      {Object.entries(courtGroups).length > 0 ? (
+        Object.entries(courtGroups).map(([groupName, features], index) => (
+          <>
+            {GroupsUI[groupName]({
+              children: (
+                <Fragment>
+                  {features.map((feature) =>
+                    FeatureUIs[feature]({
+                      name: groupName,
+                      checked: selected.includes(feature),
+                      disabled: disabled.has(feature),
+                      onClick: () => handleToggle(feature),
+                      value: feature,
+                    })
+                  )}
+                </Fragment>
+              ),
+            })}
+            {index !== Object.entries(courtGroups).length - 1 ? <Separator /> : null}
+          </>
+        ))
+      ) : (
+        <FeatureSkeleton />
+      )}
     </Container>
   );
 };
diff --git a/web/src/pages/Resolver/Parameters/Court/index.tsx b/web/src/pages/Resolver/Parameters/Court/index.tsx
index 4e50c0bdc..758f167bc 100644
--- a/web/src/pages/Resolver/Parameters/Court/index.tsx
+++ b/web/src/pages/Resolver/Parameters/Court/index.tsx
@@ -52,13 +52,14 @@ const AlertMessageContainer = styled.div`
 `;
 
 const Court: React.FC = () => {
-  const { disputeData, setDisputeData } = useNewDisputeContext();
+  const { disputeData, setDisputeData, setSelectedFeatures } = useNewDisputeContext();
   const { data: courtTree } = useCourtTree();
   const items = useMemo(() => !isUndefined(courtTree?.court) && [rootCourtToItems(courtTree.court)], [courtTree]);
 
   const handleCourtChange = (courtId: string) => {
     if (disputeData.courtId !== courtId) {
-      setDisputeData({ ...disputeData, courtId, disputeKitId: undefined });
+      setDisputeData({ ...disputeData, courtId, disputeKitId: undefined, disputeKitData: undefined });
+      setSelectedFeatures([]);
     }
   };
 
@@ -83,7 +84,7 @@ const Court: React.FC = () => {
           variant="info"
         />
       </AlertMessageContainer>
-      <FeatureSelection />
+      {isUndefined(disputeData.courtId) ? null : <FeatureSelection />}
       <NavigationButtons prevRoute="/resolver/description" nextRoute="/resolver/category" />
     </Container>
   );

From 6bea07295faed622e887f1822094a564f305b0d0 Mon Sep 17 00:00:00 2001
From: Harman-singh-waraich <Waraichharman68@gmail.com>
Date: Tue, 9 Sep 2025 17:28:22 +0530
Subject: [PATCH 112/175] fix(web): neo-codegen

---
 web/wagmi.config.ts | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/web/wagmi.config.ts b/web/wagmi.config.ts
index 893df2554..f3b21dd0d 100644
--- a/web/wagmi.config.ts
+++ b/web/wagmi.config.ts
@@ -18,7 +18,7 @@ dotenv.config();
 
 const readArtifacts = async (type: ArbitratorTypes, viemChainName: string, hardhatChainName?: string) => {
   const artifactSuffix =
-    type === ArbitratorTypes.vanilla
+    type === ArbitratorTypes.vanilla || type === ArbitratorTypes.neo
       ? ""
       : ArbitratorTypes[type].toString().charAt(0).toUpperCase() + ArbitratorTypes[type].toString().slice(1);
   const vanillaArtifacts = [
@@ -59,7 +59,7 @@ const readArtifacts = async (type: ArbitratorTypes, viemChainName: string, hardh
           // console.debug(`Skipping ${name} for deployment type ${ArbitratorTypes[type]}`);
           continue;
         }
-        if (type !== ArbitratorTypes.vanilla) {
+        if (type === ArbitratorTypes.university) {
           nameWithoutSuffix = name.slice(0, -artifactSuffix.length);
           // console.debug(`Using ${nameWithoutSuffix} instead of ${name}`);
         }

From 0e3fb9c5d7068385d5b01cece7c0fdd6ca203858 Mon Sep 17 00:00:00 2001
From: Harman-singh-waraich <Waraichharman68@gmail.com>
Date: Tue, 9 Sep 2025 19:32:03 +0530
Subject: [PATCH 113/175] chore(web): rabbit-review

---
 .../DisputeFeatures/Features/ClassicVote.tsx   |  2 ++
 .../DisputeFeatures/Features/GatedErc1155.tsx  |  9 +++++----
 .../DisputeFeatures/Features/GatedErc20.tsx    |  7 ++++---
 .../DisputeFeatures/Features/index.tsx         |  5 +++--
 web/src/consts/disputeFeature.ts               | 18 +-----------------
 .../Court/FeatureSelection/index.tsx           |  4 ++--
 6 files changed, 17 insertions(+), 28 deletions(-)

diff --git a/web/src/components/DisputeFeatures/Features/ClassicVote.tsx b/web/src/components/DisputeFeatures/Features/ClassicVote.tsx
index efc780a02..1cbf78c3c 100644
--- a/web/src/components/DisputeFeatures/Features/ClassicVote.tsx
+++ b/web/src/components/DisputeFeatures/Features/ClassicVote.tsx
@@ -1,5 +1,6 @@
 import React from "react";
 
+import { Features } from "consts/disputeFeature";
 import { useNewDisputeContext } from "context/NewDisputeContext";
 
 import { useCourtDetails } from "queries/useCourtDetails";
@@ -22,6 +23,7 @@ const ClassicVote: React.FC<RadioInput> = (props) => {
           : `The jurors' votes are not hidden. 
         Everybody can see the justification and voted choice before the voting period completes.`
       }
+      key={Features.ClassicVote}
     >
       <StyledRadio label={isCommitEnabled ? "Two-steps commit-reveal" : "Classic one step voting"} small {...props} />
     </WithHelpTooltip>
diff --git a/web/src/components/DisputeFeatures/Features/GatedErc1155.tsx b/web/src/components/DisputeFeatures/Features/GatedErc1155.tsx
index 1467379ca..beaec398b 100644
--- a/web/src/components/DisputeFeatures/Features/GatedErc1155.tsx
+++ b/web/src/components/DisputeFeatures/Features/GatedErc1155.tsx
@@ -1,8 +1,9 @@
-import React, { useEffect, useMemo } from "react";
+import React, { Fragment, useEffect, useMemo } from "react";
 import styled from "styled-components";
 
 import { Field } from "@kleros/ui-components-library";
 
+import { Features } from "consts/disputeFeature";
 import { IGatedDisputeData, useNewDisputeContext } from "context/NewDisputeContext";
 import { useERC1155Validation } from "hooks/useTokenAddressValidation";
 
@@ -38,7 +39,7 @@ const GatedErc1155: React.FC<RadioInput> = (props) => {
     error: validationError,
   } = useERC1155Validation({
     address: tokenGateAddress,
-    enabled: validationEnabled,
+    enabled: validationEnabled && props.checked,
   });
 
   const [validationMessage, variant] = useMemo(() => {
@@ -89,7 +90,7 @@ const GatedErc1155: React.FC<RadioInput> = (props) => {
   };
 
   return (
-    <>
+    <Fragment key={Features.GatedErc1155}>
       <WithHelpTooltip
         tooltipMsg="Only jurors who possess the token or NFT indicated below can be selected as jurors for this case.
         Add the token address below."
@@ -114,7 +115,7 @@ const GatedErc1155: React.FC<RadioInput> = (props) => {
           />
         </FieldContainer>
       ) : null}
-    </>
+    </Fragment>
   );
 };
 
diff --git a/web/src/components/DisputeFeatures/Features/GatedErc20.tsx b/web/src/components/DisputeFeatures/Features/GatedErc20.tsx
index 748f320a2..7f072daab 100644
--- a/web/src/components/DisputeFeatures/Features/GatedErc20.tsx
+++ b/web/src/components/DisputeFeatures/Features/GatedErc20.tsx
@@ -1,8 +1,9 @@
-import React, { useEffect, useMemo } from "react";
+import React, { Fragment, useEffect, useMemo } from "react";
 import styled from "styled-components";
 
 import { Field } from "@kleros/ui-components-library";
 
+import { Features } from "consts/disputeFeature";
 import { IGatedDisputeData, useNewDisputeContext } from "context/NewDisputeContext";
 import { useERC20ERC721Validation } from "hooks/useTokenAddressValidation";
 
@@ -79,7 +80,7 @@ const GatedErc20: React.FC<RadioInput> = (props) => {
   };
 
   return (
-    <>
+    <Fragment key={Features.GatedErc20}>
       <WithHelpTooltip
         tooltipMsg="Only jurors who possess the token or NFT indicated below can be selected as jurors for this case.
         Add the token address below."
@@ -98,7 +99,7 @@ const GatedErc20: React.FC<RadioInput> = (props) => {
           />
         </FieldContainer>
       ) : null}
-    </>
+    </Fragment>
   );
 };
 
diff --git a/web/src/components/DisputeFeatures/Features/index.tsx b/web/src/components/DisputeFeatures/Features/index.tsx
index 5c3157a52..d1b6d7c48 100644
--- a/web/src/components/DisputeFeatures/Features/index.tsx
+++ b/web/src/components/DisputeFeatures/Features/index.tsx
@@ -19,7 +19,7 @@ export type RadioInput = {
   onClick: () => void;
 };
 
-export type FeatureUI = (props: RadioInput) => JSX.Element;
+export type FeatureUI = React.FC<RadioInput>;
 
 export const StyledRadio = styled(Radio)`
   font-size: 14px;
@@ -33,6 +33,7 @@ export const FeatureUIs: Record<Features, FeatureUI> = {
       tooltipMsg={`The jurors' votes are hidden. 
         Nobody can see them before the voting period completes. 
         (It takes place in one step via Shutter Network)`}
+      key={Features.ShieldedVote}
     >
       <StyledRadio label="Single-step via Shutter Network" small {...props} />
     </WithHelpTooltip>
@@ -41,7 +42,7 @@ export const FeatureUIs: Record<Features, FeatureUI> = {
   [Features.ClassicVote]: (props: RadioInput) => <ClassicVote {...props} />,
 
   [Features.ClassicEligibility]: (props: RadioInput) => (
-    <StyledRadio label="All the jurors in this court" small {...props} />
+    <StyledRadio key={Features.ClassicEligibility} label="All the jurors in this court" small {...props} />
   ),
 
   [Features.GatedErc20]: (props: RadioInput) => <GatedErc20 {...props} />,
diff --git a/web/src/consts/disputeFeature.ts b/web/src/consts/disputeFeature.ts
index a6f257c48..f852047ac 100644
--- a/web/src/consts/disputeFeature.ts
+++ b/web/src/consts/disputeFeature.ts
@@ -25,11 +25,6 @@ export interface DisputeKit {
    * if either subset matches the selected feature array this dispute kit is selected
    */
   featureSets: Features[][];
-  /**
-   * If true => kit accepts any subset of a featureSet.
-   * If false => must be an exact match.
-   */
-  allowSubset?: boolean;
 
   type: "general" | "gated";
 }
@@ -62,7 +57,6 @@ export const disputeKits: DisputeKits = [
       [Features.ClassicVote, Features.GatedErc20],
       [Features.ClassicVote, Features.GatedErc1155],
     ],
-    allowSubset: true,
     type: "gated",
   },
   {
@@ -71,7 +65,6 @@ export const disputeKits: DisputeKits = [
       [Features.ShieldedVote, Features.GatedErc20],
       [Features.ShieldedVote, Features.GatedErc1155],
     ],
-    allowSubset: true,
     type: "gated",
   },
 ];
@@ -86,12 +79,6 @@ function arraysEqual(a: Features[], b: Features[]): boolean {
   return normalize(a) === normalize(b);
 }
 
-/** Check if `a` is a superset of `b` */
-function includesAll(a: Features[], b: Features[]): boolean {
-  const setA = new Set(a);
-  return b.every((x) => setA.has(x));
-}
-
 /**
  * Toggle a feature, ensuring radio behavior per group
  * @returns the updated selected features array
@@ -119,10 +106,7 @@ export function toggleFeature(selected: Features[], feature: Features, groups: F
 export function findMatchingKits(selected: Features[], kits: DisputeKits): DisputeKit[] {
   return kits.filter((kit) =>
     kit.featureSets.some(
-      (set) =>
-        kit.allowSubset
-          ? includesAll(selected, set) // kit allows subset
-          : arraysEqual(set, selected) // strict exact match
+      (set) => arraysEqual(set, selected) // strict exact match
     )
   );
 }
diff --git a/web/src/pages/Resolver/Parameters/Court/FeatureSelection/index.tsx b/web/src/pages/Resolver/Parameters/Court/FeatureSelection/index.tsx
index 6f6e4f102..56860e906 100644
--- a/web/src/pages/Resolver/Parameters/Court/FeatureSelection/index.tsx
+++ b/web/src/pages/Resolver/Parameters/Court/FeatureSelection/index.tsx
@@ -59,7 +59,7 @@ const FeatureSelection: React.FC = () => {
       if (!defaultKit) return;
 
       // some kits like gated can have two feature sets, one for gatedERC20 and other for ERC1155
-      if (defaultKit?.allowSubset) {
+      if (defaultKit?.featureSets.length > 0) {
         if ((disputeData?.disputeKitData as IGatedDisputeData)?.isERC1155) {
           // defaultKit.featureSets[0][0] - is either Classic or Shutter
           setSelected([defaultKit.featureSets[0][0], Features.GatedErc1155]);
@@ -141,7 +141,7 @@ const FeatureSelection: React.FC = () => {
           <>
             {GroupsUI[groupName]({
               children: (
-                <Fragment>
+                <Fragment key={groupName}>
                   {features.map((feature) =>
                     FeatureUIs[feature]({
                       name: groupName,

From f77b92f892891a447145ebb115f9d4ae3f863640 Mon Sep 17 00:00:00 2001
From: Harman-singh-waraich <Waraichharman68@gmail.com>
Date: Tue, 9 Sep 2025 19:54:13 +0530
Subject: [PATCH 114/175] fix(web): incorrect-feature-selection

---
 .../Resolver/Parameters/Court/FeatureSelection/index.tsx      | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/web/src/pages/Resolver/Parameters/Court/FeatureSelection/index.tsx b/web/src/pages/Resolver/Parameters/Court/FeatureSelection/index.tsx
index 56860e906..f750345bd 100644
--- a/web/src/pages/Resolver/Parameters/Court/FeatureSelection/index.tsx
+++ b/web/src/pages/Resolver/Parameters/Court/FeatureSelection/index.tsx
@@ -59,14 +59,14 @@ const FeatureSelection: React.FC = () => {
       if (!defaultKit) return;
 
       // some kits like gated can have two feature sets, one for gatedERC20 and other for ERC1155
-      if (defaultKit?.featureSets.length > 0) {
+      if (defaultKit?.featureSets.length > 1) {
         if ((disputeData?.disputeKitData as IGatedDisputeData)?.isERC1155) {
           // defaultKit.featureSets[0][0] - is either Classic or Shutter
           setSelected([defaultKit.featureSets[0][0], Features.GatedErc1155]);
         } else {
           setSelected([defaultKit.featureSets[0][0], Features.GatedErc20]);
         }
-      } else {
+      } else if (defaultKit.featureSets.length === 1) {
         setSelected(defaultKit.featureSets[0]);
       }
     }

From e41329b59175b8062169f73489fd40c2ffc05346 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Tue, 9 Sep 2025 16:56:16 +0100
Subject: [PATCH 115/175] feat: court features wording, sub-title styling

---
 .../components/DisputeFeatures/Features/ClassicVote.tsx   | 8 ++++----
 .../components/DisputeFeatures/Features/GatedErc1155.tsx  | 4 ++--
 .../components/DisputeFeatures/Features/GatedErc20.tsx    | 4 ++--
 web/src/components/DisputeFeatures/Features/index.tsx     | 4 ++--
 web/src/components/DisputeFeatures/GroupsUI.tsx           | 4 ++--
 .../Resolver/Parameters/Court/FeatureSelection/index.tsx  | 4 ++--
 6 files changed, 14 insertions(+), 14 deletions(-)

diff --git a/web/src/components/DisputeFeatures/Features/ClassicVote.tsx b/web/src/components/DisputeFeatures/Features/ClassicVote.tsx
index 1cbf78c3c..44f3bf237 100644
--- a/web/src/components/DisputeFeatures/Features/ClassicVote.tsx
+++ b/web/src/components/DisputeFeatures/Features/ClassicVote.tsx
@@ -17,15 +17,15 @@ const ClassicVote: React.FC<RadioInput> = (props) => {
     <WithHelpTooltip
       tooltipMsg={
         isCommitEnabled
-          ? `The jurors' votes are hidden. 
+          ? `The jurors votes are hidden. 
         Nobody can see them before the voting period completes. 
-        (It takes place in two steps commit-reveal)`
-          : `The jurors' votes are not hidden. 
+        It takes place in a two-step commit-reveal process.`
+          : `The jurors votes are not hidden. 
         Everybody can see the justification and voted choice before the voting period completes.`
       }
       key={Features.ClassicVote}
     >
-      <StyledRadio label={isCommitEnabled ? "Two-steps commit-reveal" : "Classic one step voting"} small {...props} />
+      <StyledRadio label={isCommitEnabled ? "Two-step commit-reveal" : "Disabled"} small {...props} />
     </WithHelpTooltip>
   );
 };
diff --git a/web/src/components/DisputeFeatures/Features/GatedErc1155.tsx b/web/src/components/DisputeFeatures/Features/GatedErc1155.tsx
index beaec398b..3d48228c1 100644
--- a/web/src/components/DisputeFeatures/Features/GatedErc1155.tsx
+++ b/web/src/components/DisputeFeatures/Features/GatedErc1155.tsx
@@ -92,8 +92,8 @@ const GatedErc1155: React.FC<RadioInput> = (props) => {
   return (
     <Fragment key={Features.GatedErc1155}>
       <WithHelpTooltip
-        tooltipMsg="Only jurors who possess the token or NFT indicated below can be selected as jurors for this case.
-        Add the token address below."
+        tooltipMsg="Only the jurors who possess the specified token or NFT 
+        can be selected as jurors for this case. Please input the token details below."
       >
         <StyledRadio label="Jurors owning at least 1 token ERC-1155" small {...props} />
       </WithHelpTooltip>
diff --git a/web/src/components/DisputeFeatures/Features/GatedErc20.tsx b/web/src/components/DisputeFeatures/Features/GatedErc20.tsx
index 7f072daab..1ac053b42 100644
--- a/web/src/components/DisputeFeatures/Features/GatedErc20.tsx
+++ b/web/src/components/DisputeFeatures/Features/GatedErc20.tsx
@@ -82,8 +82,8 @@ const GatedErc20: React.FC<RadioInput> = (props) => {
   return (
     <Fragment key={Features.GatedErc20}>
       <WithHelpTooltip
-        tooltipMsg="Only jurors who possess the token or NFT indicated below can be selected as jurors for this case.
-        Add the token address below."
+        tooltipMsg="Only the jurors who possess the specified token or NFT 
+        can be selected as jurors for this case. Please input the token details below."
       >
         <StyledRadio label="Jurors owning at least 1 token ERC-20 or ERC-721" small {...props} />
       </WithHelpTooltip>
diff --git a/web/src/components/DisputeFeatures/Features/index.tsx b/web/src/components/DisputeFeatures/Features/index.tsx
index d1b6d7c48..c98cc77e0 100644
--- a/web/src/components/DisputeFeatures/Features/index.tsx
+++ b/web/src/components/DisputeFeatures/Features/index.tsx
@@ -30,9 +30,9 @@ export const StyledRadio = styled(Radio)`
 export const FeatureUIs: Record<Features, FeatureUI> = {
   [Features.ShieldedVote]: (props: RadioInput) => (
     <WithHelpTooltip
-      tooltipMsg={`The jurors' votes are hidden. 
+      tooltipMsg={`The jurors votes are hidden. 
         Nobody can see them before the voting period completes. 
-        (It takes place in one step via Shutter Network)`}
+        It takes place in a single step via Shutter Network`}
       key={Features.ShieldedVote}
     >
       <StyledRadio label="Single-step via Shutter Network" small {...props} />
diff --git a/web/src/components/DisputeFeatures/GroupsUI.tsx b/web/src/components/DisputeFeatures/GroupsUI.tsx
index 4a2714287..ca28c05a4 100644
--- a/web/src/components/DisputeFeatures/GroupsUI.tsx
+++ b/web/src/components/DisputeFeatures/GroupsUI.tsx
@@ -36,7 +36,7 @@ export const GroupsUI: Record<Group, GroupUI> = {
     <Container key={Group.Voting}>
       <HeaderContainer>
         <Header>Shielded Voting</Header>
-        <SubTitle>It hides the jurors&apos; votes until the end of the voting period.</SubTitle>
+        <SubTitle>This feature hides the jurors votes until the end of the voting period.</SubTitle>
       </HeaderContainer>
       {children}
     </Container>
@@ -45,7 +45,7 @@ export const GroupsUI: Record<Group, GroupUI> = {
     <Container key={Group.Eligibility}>
       <HeaderContainer>
         <Header>Jurors Eligibility</Header>
-        <SubTitle>Who can be selected as a juror?.</SubTitle>
+        <SubTitle>This feature determines who can be selected as a juror.</SubTitle>
       </HeaderContainer>
       {children}
     </Container>
diff --git a/web/src/pages/Resolver/Parameters/Court/FeatureSelection/index.tsx b/web/src/pages/Resolver/Parameters/Court/FeatureSelection/index.tsx
index f750345bd..5444836c3 100644
--- a/web/src/pages/Resolver/Parameters/Court/FeatureSelection/index.tsx
+++ b/web/src/pages/Resolver/Parameters/Court/FeatureSelection/index.tsx
@@ -34,7 +34,7 @@ const Container = styled(Card)`
 `;
 
 const SubTitle = styled.p`
-  font-size: 14px;
+  font-size: 18px;
   color: ${({ theme }) => theme.secondaryBlue};
   padding: 0;
   margin: 0;
@@ -134,7 +134,7 @@ const FeatureSelection: React.FC = () => {
 
   return (
     <Container>
-      <SubTitle>Additional features available in this court:</SubTitle>
+      <SubTitle>Features in this Court</SubTitle>
 
       {Object.entries(courtGroups).length > 0 ? (
         Object.entries(courtGroups).map(([groupName, features], index) => (

From 80329176ff52e606c2fd6056a708cfb540bae206 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Tue, 9 Sep 2025 17:53:49 +0100
Subject: [PATCH 116/175] chore: storage optimisation by reordering Vote.voted

---
 .../src/arbitration/dispute-kits/DisputeKitClassicBase.sol     | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index b5aa042de..9035ee1e5 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -47,10 +47,10 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     }
 
     struct Vote {
+        bool voted; // True if the vote has been cast.
         address account; // The address of the juror.
         bytes32 commit; // The commit of the juror. For courts with hidden votes.
         uint256 choice; // The choice of the juror.
-        bool voted; // True if the vote has been cast.
         uint256[10] __gap; // Reserved slots for future upgrades.
     }
 
@@ -72,6 +72,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     uint256 public jumpDisputeKitID; // The ID of the dispute kit in Kleros Core disputeKits array that the dispute should switch to after the court jump, in case the new court doesn't support this dispute kit.
 
     uint256[50] private __gap; // Reserved slots for future upgrades.
+
     // ************************************* //
     // *              Events               * //
     // ************************************* //

From 1b6c98a3cc41ad054c3c18bbb43c673e88842760 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Tue, 9 Sep 2025 18:20:07 +0100
Subject: [PATCH 117/175] chore: added storage gaps to KC Court, Dispute and
 Round, and removed unused Court.disabled

---
 contracts/src/arbitration/KlerosCore.sol                   | 4 +++-
 contracts/src/arbitration/SortitionModule.sol              | 2 +-
 .../src/arbitration/dispute-kits/DisputeKitClassicBase.sol | 4 ++--
 .../src/arbitration/university/KlerosCoreUniversity.sol    | 4 +++-
 .../arbitration/university/SortitionModuleUniversity.sol   | 2 +-
 contracts/test/foundry/KlerosCore_Governance.t.sol         | 4 ++--
 contracts/test/foundry/KlerosCore_Initialization.t.sol     | 4 ++--
 contracts/test/foundry/KlerosCore_TestBase.sol             | 7 ++-----
 8 files changed, 16 insertions(+), 15 deletions(-)

diff --git a/contracts/src/arbitration/KlerosCore.sol b/contracts/src/arbitration/KlerosCore.sol
index 9c18554e2..3bee7a963 100644
--- a/contracts/src/arbitration/KlerosCore.sol
+++ b/contracts/src/arbitration/KlerosCore.sol
@@ -43,7 +43,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         uint256 jurorsForCourtJump; // The appeal after the one that reaches this number of jurors will go to the parent court if any.
         uint256[4] timesPerPeriod; // The time allotted to each dispute period in the form `timesPerPeriod[period]`.
         mapping(uint256 disputeKitId => bool) supportedDisputeKits; // True if DK with this ID is supported by the court. Note that each court must support classic dispute kit.
-        bool disabled; // True if the court is disabled. Unused for now, will be implemented later.
+        uint256[10] __gap; // Reserved slots for future upgrades.
     }
 
     struct Dispute {
@@ -53,6 +53,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         bool ruled; // True if the ruling has been executed, false otherwise.
         uint256 lastPeriodChange; // The last time the period was changed.
         Round[] rounds; // Rounds of the dispute.
+        uint256[10] __gap; // Reserved slots for future upgrades.
     }
 
     struct Round {
@@ -68,6 +69,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         uint256 sumPnkRewardPaid; // Total sum of PNK paid to coherent jurors as a reward in this round.
         IERC20 feeToken; // The token used for paying fees in this round.
         uint256 drawIterations; // The number of iterations passed drawing the jurors for this round.
+        uint256[10] __gap; // Reserved slots for future upgrades.
     }
 
     // Workaround "stack too deep" errors
diff --git a/contracts/src/arbitration/SortitionModule.sol b/contracts/src/arbitration/SortitionModule.sol
index 05b3e63ff..5c46f4b6d 100644
--- a/contracts/src/arbitration/SortitionModule.sol
+++ b/contracts/src/arbitration/SortitionModule.sol
@@ -453,7 +453,7 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
             if (currentCourtID == GENERAL_COURT) {
                 finished = true;
             } else {
-                (currentCourtID, , , , , , ) = core.courts(currentCourtID); // Get the parent court.
+                (currentCourtID, , , , , ) = core.courts(currentCourtID); // Get the parent court.
             }
         }
         emit StakeSet(_account, _courtID, _newStake, juror.stakedPnk);
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index 9035ee1e5..e2a017750 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -320,7 +320,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         Round storage round = dispute.rounds[localRoundID];
         {
             (uint96 courtID, , , , ) = core.disputes(_coreDisputeID);
-            (, bool hiddenVotes, , , , , ) = core.courts(courtID);
+            (, bool hiddenVotes, , , , ) = core.courts(courtID);
             bytes32 actualVoteHash = hashVote(_choice, _salt, _justification);
 
             //  Save the votes.
@@ -585,7 +585,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         Round storage round = dispute.rounds[dispute.rounds.length - 1];
 
         (uint96 courtID, , , , ) = core.disputes(_coreDisputeID);
-        (, bool hiddenVotes, , , , , ) = core.courts(courtID);
+        (, bool hiddenVotes, , , , ) = core.courts(courtID);
         uint256 expectedTotalVoted = hiddenVotes ? round.totalCommitted : round.votes.length;
 
         return round.totalVoted == expectedTotalVoted;
diff --git a/contracts/src/arbitration/university/KlerosCoreUniversity.sol b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
index afe7fc4d4..7139a8be2 100644
--- a/contracts/src/arbitration/university/KlerosCoreUniversity.sol
+++ b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
@@ -39,7 +39,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         uint256 jurorsForCourtJump; // The appeal after the one that reaches this number of jurors will go to the parent court if any.
         uint256[4] timesPerPeriod; // The time allotted to each dispute period in the form `timesPerPeriod[period]`.
         mapping(uint256 disputeKitId => bool) supportedDisputeKits; // True if DK with this ID is supported by the court. Note that each court must support classic dispute kit.
-        bool disabled; // True if the court is disabled. Unused for now, will be implemented later.
+        uint256[10] __gap; // Reserved slots for future upgrades.
     }
 
     struct Dispute {
@@ -49,6 +49,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         bool ruled; // True if the ruling has been executed, false otherwise.
         uint256 lastPeriodChange; // The last time the period was changed.
         Round[] rounds;
+        uint256[10] __gap; // Reserved slots for future upgrades.
     }
 
     struct Round {
@@ -64,6 +65,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         uint256 sumPnkRewardPaid; // Total sum of PNK paid to coherent jurors as a reward in this round.
         IERC20 feeToken; // The token used for paying fees in this round.
         uint256 drawIterations; // The number of iterations passed drawing the jurors for this round.
+        uint256[10] __gap; // Reserved slots for future upgrades.
     }
 
     // Workaround "stack too deep" errors
diff --git a/contracts/src/arbitration/university/SortitionModuleUniversity.sol b/contracts/src/arbitration/university/SortitionModuleUniversity.sol
index 66e815e4a..8d562d0b7 100644
--- a/contracts/src/arbitration/university/SortitionModuleUniversity.sol
+++ b/contracts/src/arbitration/university/SortitionModuleUniversity.sol
@@ -280,7 +280,7 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
             if (currentCourtID == GENERAL_COURT) {
                 finished = true;
             } else {
-                (currentCourtID, , , , , , ) = core.courts(currentCourtID);
+                (currentCourtID, , , , , ) = core.courts(currentCourtID);
             }
         }
         emit StakeSet(_account, _courtID, _newStake, juror.stakedPnk);
diff --git a/contracts/test/foundry/KlerosCore_Governance.t.sol b/contracts/test/foundry/KlerosCore_Governance.t.sol
index 53d438c4d..c95ba123f 100644
--- a/contracts/test/foundry/KlerosCore_Governance.t.sol
+++ b/contracts/test/foundry/KlerosCore_Governance.t.sol
@@ -266,7 +266,7 @@ contract KlerosCore_GovernanceTest is KlerosCore_TestBase {
             supportedDK
         );
 
-        _assertCourtParameters(2, GENERAL_COURT, true, 2000, 20000, 0.04 ether, 50, false);
+        _assertCourtParameters(2, GENERAL_COURT, true, 2000, 20000, 0.04 ether, 50);
 
         uint256[] memory children = core.getCourtChildren(2);
         assertEq(children.length, 0, "No children");
@@ -356,7 +356,7 @@ contract KlerosCore_GovernanceTest is KlerosCore_TestBase {
             [uint256(10), uint256(20), uint256(30), uint256(40)] // Times per period
         );
 
-        _assertCourtParameters(GENERAL_COURT, FORKING_COURT, true, 2000, 20000, 0.04 ether, 50, false);
+        _assertCourtParameters(GENERAL_COURT, FORKING_COURT, true, 2000, 20000, 0.04 ether, 50);
         _assertTimesPerPeriod(GENERAL_COURT, [uint256(10), uint256(20), uint256(30), uint256(40)]);
     }
 
diff --git a/contracts/test/foundry/KlerosCore_Initialization.t.sol b/contracts/test/foundry/KlerosCore_Initialization.t.sol
index 7e521063d..a5c0faada 100644
--- a/contracts/test/foundry/KlerosCore_Initialization.t.sol
+++ b/contracts/test/foundry/KlerosCore_Initialization.t.sol
@@ -23,8 +23,8 @@ contract KlerosCore_InitializationTest is KlerosCore_TestBase {
         assertEq(address(core.sortitionModule()), address(sortitionModule), "Wrong sortitionModule address");
         assertEq(core.getDisputeKitsLength(), 2, "Wrong DK array length");
 
-        _assertCourtParameters(FORKING_COURT, FORKING_COURT, false, 0, 0, 0, 0, false);
-        _assertCourtParameters(GENERAL_COURT, FORKING_COURT, false, 1000, 10000, 0.03 ether, 511, false);
+        _assertCourtParameters(FORKING_COURT, FORKING_COURT, false, 0, 0, 0, 0);
+        _assertCourtParameters(GENERAL_COURT, FORKING_COURT, false, 1000, 10000, 0.03 ether, 511);
 
         uint256[] memory children = core.getCourtChildren(GENERAL_COURT);
         assertEq(children.length, 0, "No children");
diff --git a/contracts/test/foundry/KlerosCore_TestBase.sol b/contracts/test/foundry/KlerosCore_TestBase.sol
index 9418f2444..27679aa1a 100644
--- a/contracts/test/foundry/KlerosCore_TestBase.sol
+++ b/contracts/test/foundry/KlerosCore_TestBase.sol
@@ -223,8 +223,7 @@ abstract contract KlerosCore_TestBase is Test {
         uint256 expectedMinStake,
         uint256 expectedAlpha,
         uint256 expectedFeeForJuror,
-        uint256 expectedJurorsForJump,
-        bool expectedDisabled
+        uint256 expectedJurorsForJump
     ) internal {
         (
             uint96 courtParent,
@@ -232,8 +231,7 @@ abstract contract KlerosCore_TestBase is Test {
             uint256 courtMinStake,
             uint256 courtAlpha,
             uint256 courtFeeForJuror,
-            uint256 courtJurorsForCourtJump,
-            bool courtDisabled
+            uint256 courtJurorsForCourtJump
         ) = core.courts(courtId);
 
         assertEq(courtParent, expectedParent, "Wrong court parent");
@@ -242,7 +240,6 @@ abstract contract KlerosCore_TestBase is Test {
         assertEq(courtAlpha, expectedAlpha, "Wrong alpha value");
         assertEq(courtFeeForJuror, expectedFeeForJuror, "Wrong feeForJuror value");
         assertEq(courtJurorsForCourtJump, expectedJurorsForJump, "Wrong jurorsForCourtJump value");
-        assertEq(courtDisabled, expectedDisabled, "Wrong disabled state");
     }
 
     /// @dev Helper function to check times per period

From 568eb40431c32845e723e2609bae5db4196c39f6 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Tue, 9 Sep 2025 18:46:11 +0100
Subject: [PATCH 118/175] chore: foundry lint

---
 contracts/foundry.toml                                       | 3 +++
 .../src/arbitration/university/KlerosCoreUniversity.sol      | 4 ++--
 contracts/src/libraries/SafeSend.sol                         | 2 +-
 contracts/src/token/Faucet.sol                               | 1 +
 contracts/src/utils/TransactionBatcher.sol                   | 1 +
 contracts/test/foundry/KlerosCore_Disputes.t.sol             | 1 +
 contracts/test/foundry/KlerosCore_Execution.t.sol            | 1 +
 contracts/test/foundry/KlerosCore_Initialization.t.sol       | 4 ++--
 contracts/test/foundry/KlerosCore_Staking.t.sol              | 1 +
 contracts/test/foundry/KlerosCore_TestBase.sol               | 5 +++--
 10 files changed, 16 insertions(+), 7 deletions(-)

diff --git a/contracts/foundry.toml b/contracts/foundry.toml
index 2dcdd2711..7c2d48987 100644
--- a/contracts/foundry.toml
+++ b/contracts/foundry.toml
@@ -10,6 +10,9 @@ src = 'src'
 out = 'out'
 libs = ['../node_modules', 'lib']
 
+[lint]
+severity = ['high', 'medium']
+
 [rpc_endpoints]
 arbitrumSepolia = "https://sepolia-rollup.arbitrum.io/rpc"
 arbitrum = "https://arb1.arbitrum.io/rpc"
diff --git a/contracts/src/arbitration/university/KlerosCoreUniversity.sol b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
index 7139a8be2..48187790e 100644
--- a/contracts/src/arbitration/university/KlerosCoreUniversity.sol
+++ b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
@@ -851,9 +851,9 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         sortitionModule.unlockStake(account, pnkLocked);
 
         // Compute the rewards
-        uint256 pnkReward = ((_params.pnkPenaltiesInRound / _params.coherentCount) * pnkCoherence) / ONE_BASIS_POINT;
+        uint256 pnkReward = ((_params.pnkPenaltiesInRound / _params.coherentCount) * pnkCoherence) / ONE_BASIS_POINT; /// forge-lint: disable-line(divide-before-multiply)
         round.sumPnkRewardPaid += pnkReward;
-        uint256 feeReward = ((round.totalFeesForJurors / _params.coherentCount) * feeCoherence) / ONE_BASIS_POINT;
+        uint256 feeReward = ((round.totalFeesForJurors / _params.coherentCount) * feeCoherence) / ONE_BASIS_POINT; /// forge-lint: disable-line(divide-before-multiply)
         round.sumFeeRewardPaid += feeReward;
 
         // Transfer the fee reward
diff --git a/contracts/src/libraries/SafeSend.sol b/contracts/src/libraries/SafeSend.sol
index fcd02d815..850aaf0df 100644
--- a/contracts/src/libraries/SafeSend.sol
+++ b/contracts/src/libraries/SafeSend.sol
@@ -19,6 +19,6 @@ library SafeSend {
         if (_to.send(_value)) return;
 
         WethLike(_wethLike).deposit{value: _value}();
-        WethLike(_wethLike).transfer(_to, _value);
+        WethLike(_wethLike).transfer(_to, _value); /// forge-lint: disable-line(erc20-unchecked-transfer)
     }
 }
diff --git a/contracts/src/token/Faucet.sol b/contracts/src/token/Faucet.sol
index b64a7e2ab..2790bc20e 100644
--- a/contracts/src/token/Faucet.sol
+++ b/contracts/src/token/Faucet.sol
@@ -4,6 +4,7 @@ pragma solidity ^0.8.24;
 
 import "@openzeppelin/contracts/token/ERC20/IERC20.sol";
 
+/// forge-lint: disable-next-item(erc20-unchecked-transfer)
 contract Faucet {
     // ************************************* //
     // *             Storage               * //
diff --git a/contracts/src/utils/TransactionBatcher.sol b/contracts/src/utils/TransactionBatcher.sol
index 1bbff78a2..e4f85a5bb 100644
--- a/contracts/src/utils/TransactionBatcher.sol
+++ b/contracts/src/utils/TransactionBatcher.sol
@@ -17,6 +17,7 @@ contract TransactionBatcher {
         bytes[] memory datas
     ) public payable {
         for (uint256 i = 0; i < targets.length; i++) {
+            /// forge-lint: disable-next-line(unchecked-call)
             targets[i].call{value: values[i]}(datas[i]); // Intentionally ignoring return value.
         }
     }
diff --git a/contracts/test/foundry/KlerosCore_Disputes.t.sol b/contracts/test/foundry/KlerosCore_Disputes.t.sol
index f9840014d..5b61c93cb 100644
--- a/contracts/test/foundry/KlerosCore_Disputes.t.sol
+++ b/contracts/test/foundry/KlerosCore_Disputes.t.sol
@@ -10,6 +10,7 @@ import "../../src/libraries/Constants.sol";
 
 /// @title KlerosCore_DisputesTest
 /// @dev Tests for KlerosCore dispute creation and management
+/// forge-lint: disable-next-item(erc20-unchecked-transfer)
 contract KlerosCore_DisputesTest is KlerosCore_TestBase {
     function test_createDispute_eth() public {
         // Create a new court and DK to test non-standard extra data
diff --git a/contracts/test/foundry/KlerosCore_Execution.t.sol b/contracts/test/foundry/KlerosCore_Execution.t.sol
index 01efd6409..06b02a4e4 100644
--- a/contracts/test/foundry/KlerosCore_Execution.t.sol
+++ b/contracts/test/foundry/KlerosCore_Execution.t.sol
@@ -11,6 +11,7 @@ import "../../src/libraries/Constants.sol";
 
 /// @title KlerosCore_ExecutionTest
 /// @dev Tests for KlerosCore execution, rewards, and ruling finalization
+/// forge-lint: disable-next-item(erc20-unchecked-transfer)
 contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
     function test_execute() public {
         uint256 disputeID = 0;
diff --git a/contracts/test/foundry/KlerosCore_Initialization.t.sol b/contracts/test/foundry/KlerosCore_Initialization.t.sol
index a5c0faada..3aa316c0d 100644
--- a/contracts/test/foundry/KlerosCore_Initialization.t.sol
+++ b/contracts/test/foundry/KlerosCore_Initialization.t.sol
@@ -14,8 +14,9 @@ import "../../src/libraries/Constants.sol";
 
 /// @title KlerosCore_InitializationTest
 /// @dev Tests for KlerosCore initialization and basic configuration
+/// forge-lint: disable-next-item(erc20-unchecked-transfer)
 contract KlerosCore_InitializationTest is KlerosCore_TestBase {
-    function test_initialize() public {
+    function test_initialize() public view {
         assertEq(core.owner(), msg.sender, "Wrong owner");
         assertEq(core.guardian(), guardian, "Wrong guardian");
         assertEq(address(core.pinakion()), address(pinakion), "Wrong pinakion address");
@@ -96,7 +97,6 @@ contract KlerosCore_InitializationTest is KlerosCore_TestBase {
         address newOwner = msg.sender;
         address newGuardian = vm.addr(1);
         address newStaker1 = vm.addr(2);
-        address newOther = vm.addr(9);
         address newJurorProsecutionModule = vm.addr(8);
         uint256 newMinStake = 1000;
         uint256 newAlpha = 10000;
diff --git a/contracts/test/foundry/KlerosCore_Staking.t.sol b/contracts/test/foundry/KlerosCore_Staking.t.sol
index 03a253a71..a7cb96bef 100644
--- a/contracts/test/foundry/KlerosCore_Staking.t.sol
+++ b/contracts/test/foundry/KlerosCore_Staking.t.sol
@@ -10,6 +10,7 @@ import "../../src/libraries/Constants.sol";
 
 /// @title KlerosCore_StakingTest
 /// @dev Tests for KlerosCore staking mechanics and stake management
+/// forge-lint: disable-next-item(erc20-unchecked-transfer)
 contract KlerosCore_StakingTest is KlerosCore_TestBase {
     function test_setStake_increase() public {
         vm.prank(owner);
diff --git a/contracts/test/foundry/KlerosCore_TestBase.sol b/contracts/test/foundry/KlerosCore_TestBase.sol
index 27679aa1a..991cd7469 100644
--- a/contracts/test/foundry/KlerosCore_TestBase.sol
+++ b/contracts/test/foundry/KlerosCore_TestBase.sol
@@ -23,6 +23,7 @@ import {IKlerosCore, KlerosCoreSnapshotProxy} from "../../src/arbitration/view/K
 
 /// @title KlerosCore_TestBase
 /// @dev Abstract base contract for KlerosCore tests containing shared setup and utilities
+/// forge-lint: disable-next-item(erc20-unchecked-transfer)
 abstract contract KlerosCore_TestBase is Test {
     event Initialized(uint64 version);
 
@@ -224,7 +225,7 @@ abstract contract KlerosCore_TestBase is Test {
         uint256 expectedAlpha,
         uint256 expectedFeeForJuror,
         uint256 expectedJurorsForJump
-    ) internal {
+    ) internal view {
         (
             uint96 courtParent,
             bool courtHiddenVotes,
@@ -243,7 +244,7 @@ abstract contract KlerosCore_TestBase is Test {
     }
 
     /// @dev Helper function to check times per period
-    function _assertTimesPerPeriod(uint96 courtId, uint256[4] memory expectedTimes) internal {
+    function _assertTimesPerPeriod(uint96 courtId, uint256[4] memory expectedTimes) internal view {
         uint256[4] memory courtTimesPerPeriod = core.getTimesPerPeriod(courtId);
         for (uint256 i = 0; i < 4; i++) {
             assertEq(courtTimesPerPeriod[i], expectedTimes[i], "Wrong times per period");

From 96bb505770315bff3b8e8d13aee165ef7111aca6 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 10 Sep 2025 00:43:54 +0100
Subject: [PATCH 119/175] chore: event parameter tweaks

Added TokenAndETHShift._degreeOfCoherencyFee, rename other parameters
Removed IArbitrableV2.DisputeRequest._templateUri
---
 contracts/src/arbitration/KlerosCore.sol      | 24 +++++++++++--------
 contracts/src/arbitration/KlerosGovernor.sol  |  2 +-
 .../arbitrables/ArbitrableExample.sol         |  4 ++--
 .../arbitrables/DisputeResolver.sol           | 18 +-------------
 .../devtools/DisputeResolverRuler.sol         |  3 +--
 .../arbitration/devtools/KlerosCoreRuler.sol  | 22 ++++++++++++-----
 .../evidence/ModeratedEvidenceModule.sol      |  3 +--
 .../arbitration/interfaces/IArbitrableV2.sol  |  6 ++---
 .../university/KlerosCoreUniversity.sol       | 13 ++++++----
 contracts/src/gateway/HomeGateway.sol         | 10 ++++----
 .../src/gateway/interfaces/IHomeGateway.sol   |  6 +----
 contracts/test/arbitration/draw.ts            |  3 +--
 contracts/test/arbitration/ruler.ts           | 12 +++++-----
 .../test/foundry/KlerosCore_Execution.t.sol   | 16 ++++++-------
 contracts/test/integration/index.ts           |  6 ++---
 15 files changed, 68 insertions(+), 80 deletions(-)

diff --git a/contracts/src/arbitration/KlerosCore.sol b/contracts/src/arbitration/KlerosCore.sol
index 3bee7a963..59215d667 100644
--- a/contracts/src/arbitration/KlerosCore.sol
+++ b/contracts/src/arbitration/KlerosCore.sol
@@ -216,31 +216,33 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
     /// @param _account Juror's address.
     /// @param _disputeID ID of the dispute.
     /// @param _roundID ID of the round.
-    /// @param _degreeOfCoherency Juror's degree of coherency in this round.
-    /// @param _pnkAmount Amount of PNK shifted.
-    /// @param _feeAmount Amount of fee shifted.
+    /// @param _degreeOfCoherencyPnk Juror's degree of coherency in this round applied to PNK.
+    /// @param _degreeOfCoherencyFee Juror's degree of coherency in this round applied to the dispute fee.
+    /// @param _amountPnk Amount of PNK shifted.
+    /// @param _amountFee Amount of fee shifted.
     /// @param _feeToken Address of the fee token.
     event TokenAndETHShift(
         address indexed _account,
         uint256 indexed _disputeID,
         uint256 indexed _roundID,
-        uint256 _degreeOfCoherency,
-        int256 _pnkAmount,
-        int256 _feeAmount,
+        uint256 _degreeOfCoherencyPnk,
+        uint256 _degreeOfCoherencyFee,
+        int256 _amountPnk,
+        int256 _amountFee,
         IERC20 _feeToken
     );
 
     /// @dev Emitted when leftover reward sent to owner.
     /// @param _disputeID ID of the dispute.
     /// @param _roundID ID of the round.
-    /// @param _pnkAmount Amount of PNK sent.
-    /// @param _feeAmount Amount of fee sent.
+    /// @param _amountPnk Amount of PNK sent.
+    /// @param _amountFee Amount of fee sent.
     /// @param _feeToken Address of the fee token.
     event LeftoverRewardSent(
         uint256 indexed _disputeID,
         uint256 indexed _roundID,
-        uint256 _pnkAmount,
-        uint256 _feeAmount,
+        uint256 _amountPnk,
+        uint256 _amountFee,
         IERC20 _feeToken
     );
 
@@ -929,6 +931,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
             _params.disputeID,
             _params.round,
             coherence,
+            0,
             -int256(availablePenalty),
             0,
             round.feeToken
@@ -1006,6 +1009,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
             _params.disputeID,
             _params.round,
             pnkCoherence,
+            feeCoherence,
             int256(pnkReward),
             int256(feeReward),
             round.feeToken
diff --git a/contracts/src/arbitration/KlerosGovernor.sol b/contracts/src/arbitration/KlerosGovernor.sol
index 11957a745..db5ddbda0 100644
--- a/contracts/src/arbitration/KlerosGovernor.sol
+++ b/contracts/src/arbitration/KlerosGovernor.sol
@@ -300,7 +300,7 @@ contract KlerosGovernor is IArbitrableV2 {
             // Check in case arbitration cost increased after the submission. It's unlikely that its increase won't be covered by the base deposit, but technically possible.
             session.sumDeposit = session.sumDeposit > arbitrationCost ? session.sumDeposit - arbitrationCost : 0;
             reservedETH = reservedETH > arbitrationCost ? reservedETH - arbitrationCost : 0;
-            emit DisputeRequest(arbitrator, session.disputeID, sessions.length - 1, templateId, "");
+            emit DisputeRequest(arbitrator, session.disputeID, sessions.length - 1, templateId);
         }
     }
 
diff --git a/contracts/src/arbitration/arbitrables/ArbitrableExample.sol b/contracts/src/arbitration/arbitrables/ArbitrableExample.sol
index 4dd60cb82..dbd5692b5 100644
--- a/contracts/src/arbitration/arbitrables/ArbitrableExample.sol
+++ b/contracts/src/arbitration/arbitrables/ArbitrableExample.sol
@@ -111,7 +111,7 @@ contract ArbitrableExample is IArbitrableV2 {
         externalIDtoLocalID[disputeID] = localDisputeID;
 
         uint256 externalDisputeID = uint256(keccak256(abi.encodePacked(_action)));
-        emit DisputeRequest(arbitrator, disputeID, externalDisputeID, templateId, "");
+        emit DisputeRequest(arbitrator, disputeID, externalDisputeID, templateId);
     }
 
     /// @dev Calls createDispute function of the specified arbitrator to create a dispute.
@@ -133,7 +133,7 @@ contract ArbitrableExample is IArbitrableV2 {
         externalIDtoLocalID[disputeID] = localDisputeID;
 
         uint256 externalDisputeID = uint256(keccak256(abi.encodePacked(_action)));
-        emit DisputeRequest(arbitrator, disputeID, externalDisputeID, templateId, "");
+        emit DisputeRequest(arbitrator, disputeID, externalDisputeID, templateId);
     }
 
     /// @dev To be called by the arbitrator of the dispute, to declare the winning ruling.
diff --git a/contracts/src/arbitration/arbitrables/DisputeResolver.sol b/contracts/src/arbitration/arbitrables/DisputeResolver.sol
index 949d282b2..3607966e1 100644
--- a/contracts/src/arbitration/arbitrables/DisputeResolver.sol
+++ b/contracts/src/arbitration/arbitrables/DisputeResolver.sol
@@ -84,25 +84,10 @@ contract DisputeResolver is IArbitrableV2 {
                 _arbitratorExtraData,
                 _disputeTemplate,
                 _disputeTemplateDataMappings,
-                "",
                 _numberOfRulingOptions
             );
     }
 
-    /// @dev Calls createDispute function of the specified arbitrator to create a dispute.
-    /// Note that we don’t need to check that msg.value is enough to pay arbitration fees as it’s the responsibility of the arbitrator contract.
-    /// @param _arbitratorExtraData Extra data for the arbitrator of the dispute.
-    /// @param _disputeTemplateUri The URI to the dispute template. For example on IPFS: starting with '/ipfs/'.
-    /// @param _numberOfRulingOptions Number of ruling options.
-    /// @return disputeID Dispute id (on arbitrator side) of the created dispute.
-    function createDisputeForTemplateUri(
-        bytes calldata _arbitratorExtraData,
-        string calldata _disputeTemplateUri,
-        uint256 _numberOfRulingOptions
-    ) external payable returns (uint256 disputeID) {
-        return _createDispute(_arbitratorExtraData, "", "", _disputeTemplateUri, _numberOfRulingOptions);
-    }
-
     /// @dev To be called by the arbitrator of the dispute, to declare the winning ruling.
     /// @param _arbitratorDisputeID ID of the dispute in arbitrator contract.
     /// @param _ruling The ruling choice of the arbitration.
@@ -127,7 +112,6 @@ contract DisputeResolver is IArbitrableV2 {
         bytes calldata _arbitratorExtraData,
         string memory _disputeTemplate,
         string memory _disputeTemplateDataMappings,
-        string memory _disputeTemplateUri,
         uint256 _numberOfRulingOptions
     ) internal virtual returns (uint256 arbitratorDisputeID) {
         if (_numberOfRulingOptions <= 1) revert ShouldBeAtLeastTwoRulingOptions();
@@ -144,7 +128,7 @@ contract DisputeResolver is IArbitrableV2 {
         );
         arbitratorDisputeIDToLocalID[arbitratorDisputeID] = localDisputeID;
         uint256 templateId = templateRegistry.setDisputeTemplate("", _disputeTemplate, _disputeTemplateDataMappings);
-        emit DisputeRequest(arbitrator, arbitratorDisputeID, localDisputeID, templateId, _disputeTemplateUri);
+        emit DisputeRequest(arbitrator, arbitratorDisputeID, localDisputeID, templateId);
     }
 
     // ************************************* //
diff --git a/contracts/src/arbitration/devtools/DisputeResolverRuler.sol b/contracts/src/arbitration/devtools/DisputeResolverRuler.sol
index eed2c8092..cfb8e3e4c 100644
--- a/contracts/src/arbitration/devtools/DisputeResolverRuler.sol
+++ b/contracts/src/arbitration/devtools/DisputeResolverRuler.sol
@@ -33,7 +33,6 @@ contract DisputeResolverRuler is DisputeResolver {
         bytes calldata _arbitratorExtraData,
         string memory _disputeTemplate,
         string memory _disputeTemplateDataMappings,
-        string memory _disputeTemplateUri,
         uint256 _numberOfRulingOptions
     ) internal override returns (uint256 arbitratorDisputeID) {
         if (_numberOfRulingOptions <= 1) revert ShouldBeAtLeastTwoRulingOptions();
@@ -47,7 +46,7 @@ contract DisputeResolverRuler is DisputeResolver {
         arbitratorDisputeID = IKlerosCoreRulerFragment(address(arbitrator)).getNextDisputeID();
         arbitratorDisputeIDToLocalID[arbitratorDisputeID] = localDisputeID;
         uint256 templateId = templateRegistry.setDisputeTemplate("", _disputeTemplate, _disputeTemplateDataMappings);
-        emit DisputeRequest(arbitrator, arbitratorDisputeID, localDisputeID, templateId, _disputeTemplateUri);
+        emit DisputeRequest(arbitrator, arbitratorDisputeID, localDisputeID, templateId);
 
         arbitrator.createDispute{value: msg.value}(_numberOfRulingOptions, _arbitratorExtraData);
     }
diff --git a/contracts/src/arbitration/devtools/KlerosCoreRuler.sol b/contracts/src/arbitration/devtools/KlerosCoreRuler.sol
index 42a428299..4ea1be3ee 100644
--- a/contracts/src/arbitration/devtools/KlerosCoreRuler.sol
+++ b/contracts/src/arbitration/devtools/KlerosCoreRuler.sol
@@ -130,16 +130,17 @@ contract KlerosCoreRuler is IArbitratorV2, UUPSProxiable, Initializable {
         address indexed _account,
         uint256 indexed _disputeID,
         uint256 indexed _roundID,
-        uint256 _degreeOfCoherency,
-        int256 _pnkAmount,
-        int256 _feeAmount,
+        uint256 _degreeOfCoherencyPnk,
+        uint256 _degreeOfCoherencyFee,
+        int256 _amountPnk,
+        int256 _amountFee,
         IERC20 _feeToken
     );
     event LeftoverRewardSent(
         uint256 indexed _disputeID,
         uint256 indexed _roundID,
-        uint256 _pnkAmount,
-        uint256 _feeAmount,
+        uint256 _amountPnk,
+        uint256 _amountFee,
         IERC20 _feeToken
     );
     event AutoRuled(
@@ -518,7 +519,16 @@ contract KlerosCoreRuler is IArbitratorV2, UUPSProxiable, Initializable {
             // The dispute fees were paid in ERC20
             round.feeToken.safeTransfer(account, feeReward);
         }
-        emit TokenAndETHShift(account, _disputeID, _round, 1, int256(0), int256(feeReward), round.feeToken);
+        emit TokenAndETHShift(
+            account,
+            _disputeID,
+            _round,
+            ONE_BASIS_POINT,
+            ONE_BASIS_POINT,
+            int256(0),
+            int256(feeReward),
+            round.feeToken
+        );
     }
 
     /// @dev Executes a specified dispute's ruling.
diff --git a/contracts/src/arbitration/evidence/ModeratedEvidenceModule.sol b/contracts/src/arbitration/evidence/ModeratedEvidenceModule.sol
index b2b64a4d3..90947a5b3 100644
--- a/contracts/src/arbitration/evidence/ModeratedEvidenceModule.sol
+++ b/contracts/src/arbitration/evidence/ModeratedEvidenceModule.sol
@@ -269,8 +269,7 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
                 arbitrator,
                 evidenceData.disputeID,
                 uint256(_evidenceID),
-                arbitratorData.disputeTemplateId,
-                ""
+                arbitratorData.disputeTemplateId
             );
             evidenceData.disputed = true;
             moderation.bondDeadline = 0;
diff --git a/contracts/src/arbitration/interfaces/IArbitrableV2.sol b/contracts/src/arbitration/interfaces/IArbitrableV2.sol
index 8751446cd..69597c383 100644
--- a/contracts/src/arbitration/interfaces/IArbitrableV2.sol
+++ b/contracts/src/arbitration/interfaces/IArbitrableV2.sol
@@ -14,14 +14,12 @@ interface IArbitrableV2 {
     /// @param _arbitrator The arbitrator of the contract.
     /// @param _arbitratorDisputeID The identifier of the dispute in the Arbitrator contract.
     /// @param _externalDisputeID An identifier created outside Kleros by the protocol requesting arbitration.
-    /// @param _templateId The identifier of the dispute template. Should not be used with _templateUri.
-    /// @param _templateUri The URI to the dispute template. For example on IPFS: starting with '/ipfs/'. Should not be used with _templateId.
+    /// @param _templateId The identifier of the dispute template.
     event DisputeRequest(
         IArbitratorV2 indexed _arbitrator,
         uint256 indexed _arbitratorDisputeID,
         uint256 _externalDisputeID,
-        uint256 _templateId,
-        string _templateUri
+        uint256 _templateId
     );
 
     /// @dev To be raised when a ruling is given.
diff --git a/contracts/src/arbitration/university/KlerosCoreUniversity.sol b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
index 48187790e..895e0bc88 100644
--- a/contracts/src/arbitration/university/KlerosCoreUniversity.sol
+++ b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
@@ -148,16 +148,17 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         address indexed _account,
         uint256 indexed _disputeID,
         uint256 indexed _roundID,
-        uint256 _degreeOfCoherency,
-        int256 _pnkAmount,
-        int256 _feeAmount,
+        uint256 _degreeOfCoherencyPnk,
+        uint256 _degreeOfCoherencyFee,
+        int256 _amountPnk,
+        int256 _amountFee,
         IERC20 _feeToken
     );
     event LeftoverRewardSent(
         uint256 indexed _disputeID,
         uint256 indexed _roundID,
-        uint256 _pnkAmount,
-        uint256 _feeAmount,
+        uint256 _amountPnk,
+        uint256 _amountFee,
         IERC20 _feeToken
     );
 
@@ -786,6 +787,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
             _params.disputeID,
             _params.round,
             coherence,
+            coherence,
             -int256(availablePenalty),
             0,
             round.feeToken
@@ -875,6 +877,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
             _params.disputeID,
             _params.round,
             pnkCoherence,
+            feeCoherence,
             int256(pnkReward),
             int256(feeReward),
             round.feeToken
diff --git a/contracts/src/gateway/HomeGateway.sol b/contracts/src/gateway/HomeGateway.sol
index 2a23913ef..e8cf0509b 100644
--- a/contracts/src/gateway/HomeGateway.sol
+++ b/contracts/src/gateway/HomeGateway.sol
@@ -151,7 +151,7 @@ contract HomeGateway is IHomeGateway, UUPSProxiable, Initializable {
         disputeHashtoID[disputeHash] = disputeID;
         relayedData.relayer = msg.sender;
 
-        emit DisputeRequest(arbitrator, disputeID, _params.externalDisputeID, _params.templateId, _params.templateUri);
+        emit DisputeRequest(arbitrator, disputeID, _params.externalDisputeID, _params.templateId);
 
         emit CrossChainDisputeIncoming(
             arbitrator,
@@ -160,8 +160,7 @@ contract HomeGateway is IHomeGateway, UUPSProxiable, Initializable {
             _params.foreignDisputeID,
             disputeID,
             _params.externalDisputeID,
-            _params.templateId,
-            _params.templateUri
+            _params.templateId
         );
     }
 
@@ -193,7 +192,7 @@ contract HomeGateway is IHomeGateway, UUPSProxiable, Initializable {
         relayedData.relayer = msg.sender;
 
         // Not strictly necessary for functionality, only to satisfy IArbitrableV2
-        emit DisputeRequest(arbitrator, disputeID, _params.externalDisputeID, _params.templateId, _params.templateUri);
+        emit DisputeRequest(arbitrator, disputeID, _params.externalDisputeID, _params.templateId);
 
         emit CrossChainDisputeIncoming(
             arbitrator,
@@ -202,8 +201,7 @@ contract HomeGateway is IHomeGateway, UUPSProxiable, Initializable {
             _params.foreignDisputeID,
             disputeID,
             _params.externalDisputeID,
-            _params.templateId,
-            _params.templateUri
+            _params.templateId
         );
     }
 
diff --git a/contracts/src/gateway/interfaces/IHomeGateway.sol b/contracts/src/gateway/interfaces/IHomeGateway.sol
index b80f194d6..d895759ae 100644
--- a/contracts/src/gateway/interfaces/IHomeGateway.sol
+++ b/contracts/src/gateway/interfaces/IHomeGateway.sol
@@ -14,8 +14,6 @@ interface IHomeGateway is IArbitrableV2, ISenderGateway {
     /// @param _arbitrableDisputeID The identifier of the dispute in the Arbitrable contract.
     /// @param _arbitratorDisputeID The identifier of the dispute in the Arbitrator contract.
     /// @param _externalDisputeID An identifier created outside Kleros by the protocol requesting arbitration.
-    /// @param _templateId The identifier of the dispute template. Should not be used with _templateUri.
-    /// @param _templateUri IPFS path to the dispute template starting with '/ipfs/'. Should not be used with _templateId.
     event CrossChainDisputeIncoming(
         IArbitratorV2 _arbitrator,
         uint256 _arbitrableChainId,
@@ -23,8 +21,7 @@ interface IHomeGateway is IArbitrableV2, ISenderGateway {
         uint256 indexed _arbitrableDisputeID,
         uint256 indexed _arbitratorDisputeID,
         uint256 _externalDisputeID,
-        uint256 _templateId,
-        string _templateUri
+        uint256 _templateId
     );
 
     // Workaround stack too deep for relayCreateDispute()
@@ -35,7 +32,6 @@ interface IHomeGateway is IArbitrableV2, ISenderGateway {
         uint256 foreignDisputeID;
         uint256 externalDisputeID;
         uint256 templateId;
-        string templateUri;
         uint256 choices;
         bytes extraData;
     }
diff --git a/contracts/test/arbitration/draw.ts b/contracts/test/arbitration/draw.ts
index 4992501f1..3c0b9fac4 100644
--- a/contracts/test/arbitration/draw.ts
+++ b/contracts/test/arbitration/draw.ts
@@ -154,7 +154,7 @@ describe("Draw Benchmark", async () => {
     // Relayer tx
     await homeGateway
       .connect(await ethers.getSigner(relayer))
-      ["relayCreateDispute((bytes32,uint256,address,uint256,uint256,uint256,string,uint256,bytes))"](
+      ["relayCreateDispute((bytes32,uint256,address,uint256,uint256,uint256,uint256,bytes))"](
         {
           foreignBlockHash: lastBlock?.hash,
           foreignChainID: 31337,
@@ -162,7 +162,6 @@ describe("Draw Benchmark", async () => {
           foreignDisputeID: disputeId,
           externalDisputeID: ethers.keccak256(ethers.toUtf8Bytes("future of france")),
           templateId: 0,
-          templateUri: "",
           choices: 2,
           extraData: `0x000000000000000000000000000000000000000000000000000000000000000${createDisputeCourtId}0000000000000000000000000000000000000000000000000000000000000003`,
         },
diff --git a/contracts/test/arbitration/ruler.ts b/contracts/test/arbitration/ruler.ts
index dafdb59da..fef56ac8f 100644
--- a/contracts/test/arbitration/ruler.ts
+++ b/contracts/test/arbitration/ruler.ts
@@ -95,9 +95,9 @@ describe("KlerosCoreRuler", async () => {
       .and.to.emit(core, "Ruling")
       .withArgs(resolver.target, disputeID, anyValue)
       .and.to.emit(core, "TokenAndETHShift")
-      .withArgs(dev.address, disputeID, 0, 1, 0, anyValue, ZeroAddress)
+      .withArgs(dev.address, disputeID, 0, 10000, 10000, 0, anyValue, ZeroAddress)
       .and.to.emit(resolver, "DisputeRequest")
-      .withArgs(core.target, disputeID, localDisputeID, templateId, "")
+      .withArgs(core.target, disputeID, localDisputeID, templateId)
       .and.to.emit(resolver, "Ruling")
       .withArgs(core.target, disputeID, anyValue);
   });
@@ -119,9 +119,9 @@ describe("KlerosCoreRuler", async () => {
       .and.to.emit(core, "Ruling")
       .withArgs(resolver.target, disputeID, 2)
       .and.to.emit(core, "TokenAndETHShift")
-      .withArgs(dev.address, disputeID, 0, 1, 0, anyValue, ZeroAddress)
+      .withArgs(dev.address, disputeID, 0, 10000, 10000, 0, anyValue, ZeroAddress)
       .and.to.emit(resolver, "DisputeRequest")
-      .withArgs(core.target, disputeID, localDisputeID, templateId, "")
+      .withArgs(core.target, disputeID, localDisputeID, templateId)
       .and.to.emit(resolver, "Ruling")
       .withArgs(core.target, disputeID, 2);
   });
@@ -139,7 +139,7 @@ describe("KlerosCoreRuler", async () => {
       .to.emit(core, "DisputeCreation")
       .withArgs(disputeID, resolver.target)
       .and.to.emit(resolver, "DisputeRequest")
-      .withArgs(core.target, disputeID, localDisputeID, templateId, "");
+      .withArgs(core.target, disputeID, localDisputeID, templateId);
 
     await expect(core.connect(deployer).executeRuling(disputeID, 3, true, true)).revertedWithCustomError(
       core,
@@ -154,7 +154,7 @@ describe("KlerosCoreRuler", async () => {
 
     await expect(core.execute(disputeID, 0))
       .and.to.emit(core, "TokenAndETHShift")
-      .withArgs(dev.address, disputeID, 0, 1, 0, anyValue, ZeroAddress);
+      .withArgs(dev.address, disputeID, 0, 10000, 10000, 0, anyValue, ZeroAddress);
   });
 });
 
diff --git a/contracts/test/foundry/KlerosCore_Execution.t.sol b/contracts/test/foundry/KlerosCore_Execution.t.sol
index 06b02a4e4..7681eff29 100644
--- a/contracts/test/foundry/KlerosCore_Execution.t.sol
+++ b/contracts/test/foundry/KlerosCore_Execution.t.sol
@@ -99,16 +99,16 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
         vm.expectEmit(true, true, true, true);
         emit SortitionModule.StakeLocked(staker1, 1000, true);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCore.TokenAndETHShift(staker1, disputeID, 0, 0, -int256(1000), 0, IERC20(address(0)));
+        emit KlerosCore.TokenAndETHShift(staker1, disputeID, 0, 0, 0, -int256(1000), 0, IERC20(address(0))); // penalties
         // Check iterations for the winning staker to see the shifts
         vm.expectEmit(true, true, true, true);
         emit SortitionModule.StakeLocked(staker2, 0, true);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCore.TokenAndETHShift(staker2, disputeID, 0, 10000, 0, 0, IERC20(address(0)));
+        emit KlerosCore.TokenAndETHShift(staker2, disputeID, 0, 10000, 0, 0, 0, IERC20(address(0))); // penalties but amounts are 0
         vm.expectEmit(true, true, true, true);
         emit SortitionModule.StakeLocked(staker2, 0, true);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCore.TokenAndETHShift(staker2, disputeID, 0, 10000, 0, 0, IERC20(address(0)));
+        emit KlerosCore.TokenAndETHShift(staker2, disputeID, 0, 10000, 0, 0, 0, IERC20(address(0))); // penalties but amounts are 0
         core.execute(disputeID, 0, 3); // Do 3 iterations to check penalties first
 
         (uint256 totalStaked, uint256 totalLocked, , ) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
@@ -124,16 +124,16 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
         vm.expectEmit(true, true, true, true);
         emit SortitionModule.StakeLocked(staker1, 0, true);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCore.TokenAndETHShift(staker1, disputeID, 0, 0, 0, 0, IERC20(address(0)));
+        emit KlerosCore.TokenAndETHShift(staker1, disputeID, 0, 0, 0, 0, 0, IERC20(address(0))); // rewards but amounts are 0
         // Check iterations for the winning staker to see the shifts
         vm.expectEmit(true, true, true, true);
         emit SortitionModule.StakeLocked(staker2, 1000, true);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCore.TokenAndETHShift(staker2, disputeID, 0, 10000, 500, 0.045 ether, IERC20(address(0)));
+        emit KlerosCore.TokenAndETHShift(staker2, disputeID, 0, 10000, 10000, 500, 0.045 ether, IERC20(address(0))); // rewards
         vm.expectEmit(true, true, true, true);
         emit SortitionModule.StakeLocked(staker2, 1000, true);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCore.TokenAndETHShift(staker2, disputeID, 0, 10000, 500, 0.045 ether, IERC20(address(0)));
+        emit KlerosCore.TokenAndETHShift(staker2, disputeID, 0, 10000, 10000, 500, 0.045 ether, IERC20(address(0))); // rewards
         core.execute(disputeID, 0, 10); // Finish the iterations. We need only 3 but check that it corrects the count.
 
         (, totalLocked, , ) = sortitionModule.getJurorBalance(staker2, GENERAL_COURT);
@@ -538,9 +538,9 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
 
         // Check only once per penalty and per reward
         vm.expectEmit(true, true, true, true);
-        emit KlerosCore.TokenAndETHShift(staker1, disputeID, 0, 10000, 0, 0, feeToken);
+        emit KlerosCore.TokenAndETHShift(staker1, disputeID, 0, 10000, 0, 0, 0, feeToken); // penalties but amounts are 0
         vm.expectEmit(true, true, true, true);
-        emit KlerosCore.TokenAndETHShift(staker1, disputeID, 0, 10000, 0, 0.06 ether, feeToken);
+        emit KlerosCore.TokenAndETHShift(staker1, disputeID, 0, 10000, 10000, 0, 0.06 ether, feeToken); // rewards
         core.execute(disputeID, 0, 6);
 
         KlerosCore.Round memory round = core.getRoundInfo(disputeID, 0);
diff --git a/contracts/test/integration/index.ts b/contracts/test/integration/index.ts
index 109d4ad9f..c8a656357 100644
--- a/contracts/test/integration/index.ts
+++ b/contracts/test/integration/index.ts
@@ -117,8 +117,7 @@ describe("Integration tests", async () => {
         foreignGateway.target,
         1,
         46619385602526556702049273755915206310773794210139929511467397410441395547901n,
-        0,
-        ""
+        0
       );
     if (tx.blockNumber === null) throw new Error("tx.blockNumber is null");
     const lastBlock = await ethers.provider.getBlock(tx.blockNumber - 1);
@@ -134,7 +133,7 @@ describe("Integration tests", async () => {
     // Relayer tx
     const tx2 = await homeGateway
       .connect(relayer)
-      ["relayCreateDispute((bytes32,uint256,address,uint256,uint256,uint256,string,uint256,bytes))"](
+      ["relayCreateDispute((bytes32,uint256,address,uint256,uint256,uint256,uint256,bytes))"](
         {
           foreignBlockHash: ethers.toBeHex(lastBlock.hash),
           foreignChainID: 31337,
@@ -142,7 +141,6 @@ describe("Integration tests", async () => {
           foreignDisputeID: disputeId,
           externalDisputeID: ethers.keccak256(ethers.toUtf8Bytes("future of france")),
           templateId: 0,
-          templateUri: "",
           choices: 2,
           extraData: "0x00",
         },

From 78833f37f87f9fc24626692d72e456f8e89a8192 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 10 Sep 2025 01:54:19 +0100
Subject: [PATCH 120/175] chore: tweaked sortition module natspec, added the
 phase related functions to the interface

---
 contracts/src/arbitration/SortitionModule.sol | 161 +++++-------------
 .../interfaces/ISortitionModule.sol           | 143 +++++++++++++++-
 .../university/SortitionModuleUniversity.sol  |  12 +-
 3 files changed, 181 insertions(+), 135 deletions(-)

diff --git a/contracts/src/arbitration/SortitionModule.sol b/contracts/src/arbitration/SortitionModule.sol
index 5c46f4b6d..16112ed07 100644
--- a/contracts/src/arbitration/SortitionModule.sol
+++ b/contracts/src/arbitration/SortitionModule.sol
@@ -194,8 +194,8 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
     // *         State Modifiers           * //
     // ************************************* //
 
-    /// @dev Passes the phase.
-    function passPhase() external {
+    /// @inheritdoc ISortitionModule
+    function passPhase() external override {
         if (phase == Phase.staking) {
             if (block.timestamp - lastPhaseChange < minStakingTime) revert MinStakingTimeNotPassed();
             if (disputesWithoutJurors == 0) revert NoDisputesThatNeedJurors();
@@ -216,18 +216,15 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
         emit NewPhase(phase);
     }
 
-    /// @dev Create a sortition sum tree at the specified key.
-    /// @param _courtID The ID of the court.
-    /// @param _extraData Extra data that contains the number of children each node in the tree should have.
+    /// @inheritdoc ISortitionModule
     function createTree(uint96 _courtID, bytes memory _extraData) external override onlyByCore {
         TreeKey key = CourtID.wrap(_courtID).toTreeKey();
         uint256 K = _extraDataToTreeK(_extraData);
         sortitionSumTrees.createTree(key, K);
     }
 
-    /// @dev Executes the next delayed stakes.
-    /// @param _iterations The number of delayed stakes to execute.
-    function executeDelayedStakes(uint256 _iterations) external {
+    /// @inheritdoc ISortitionModule
+    function executeDelayedStakes(uint256 _iterations) external override {
         if (phase != Phase.staking) revert NotStakingPhase();
         if (delayedStakeWriteIndex < delayedStakeReadIndex) revert NoDelayedStakeToExecute();
 
@@ -244,29 +241,17 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
         delayedStakeReadIndex = newDelayedStakeReadIndex;
     }
 
-    /// @dev Triggers the state changes after dispute creation.
+    /// @inheritdoc ISortitionModule
     function createDisputeHook(uint256 /*_disputeID*/, uint256 /*_roundID*/) external override onlyByCore {
         disputesWithoutJurors++;
     }
 
-    /// @dev Triggers the state changes after drawing.
+    /// @inheritdoc ISortitionModule
     function postDrawHook(uint256 /*_disputeID*/, uint256 /*_roundID*/) external override onlyByCore {
         disputesWithoutJurors--;
     }
 
-    /// @dev Saves the random number to use it in sortition. Not used by this contract because the storing of the number is inlined in passPhase().
-    /// @param _randomNumber Random number returned by RNG contract.
-    function notifyRandomNumber(uint256 _randomNumber) public override {}
-
-    /// @dev Validate the specified juror's new stake for a court.
-    /// Note: no state changes should be made when returning stakingResult != Successful, otherwise delayed stakes might break invariants.
-    /// @param _account The address of the juror.
-    /// @param _courtID The ID of the court.
-    /// @param _newStake The new stake.
-    /// @param _noDelay True if the stake change should not be delayed.
-    /// @return pnkDeposit The amount of PNK to be deposited.
-    /// @return pnkWithdrawal The amount of PNK to be withdrawn.
-    /// @return stakingResult The result of the staking operation.
+    /// @inheritdoc ISortitionModule
     function validateStake(
         address _account,
         uint96 _courtID,
@@ -283,7 +268,7 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
         bool _noDelay
     ) internal returns (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult) {
         Juror storage juror = jurors[_account];
-        uint256 currentStake = stakeOf(_account, _courtID);
+        uint256 currentStake = _stakeOf(_account, _courtID);
         bool stakeIncrease = _newStake > currentStake;
         uint256 stakeChange = stakeIncrease ? _newStake - currentStake : currentStake - _newStake;
 
@@ -332,17 +317,7 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
         return (pnkDeposit, pnkWithdrawal, StakingResult.Successful);
     }
 
-    /// @dev Update the state of the stakes, called by KC at the end of setStake flow.
-    /// `O(n + p * log_k(j))` where
-    /// `n` is the number of courts the juror has staked in,
-    /// `p` is the depth of the court tree,
-    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
-    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
-    /// @param _account The address of the juror.
-    /// @param _courtID The ID of the court.
-    /// @param _pnkDeposit The amount of PNK to be deposited.
-    /// @param _pnkWithdrawal The amount of PNK to be withdrawn.
-    /// @param _newStake The new stake.
+    /// @inheritdoc ISortitionModule
     function setStake(
         address _account,
         uint96 _courtID,
@@ -353,18 +328,7 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
         _setStake(_account, _courtID, _pnkDeposit, _pnkWithdrawal, _newStake);
     }
 
-    /// @dev Update the state of the stakes with a PNK reward deposit, called by KC during rewards execution.
-    /// `O(n + p * log_k(j))` where
-    /// `n` is the number of courts the juror has staked in,
-    /// `p` is the depth of the court tree,
-    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
-    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
-    /// @param _account The address of the juror.
-    /// @param _courtID The ID of the court.
-    /// @param _penalty The amount of PNK to be deducted.
-    /// @return pnkBalance The updated total PNK balance of the juror, including the penalty.
-    /// @return newCourtStake The updated stake of the juror in the court.
-    /// @return availablePenalty The amount of PNK that was actually deducted.
+    /// @inheritdoc ISortitionModule
     function setStakePenalty(
         address _account,
         uint96 _courtID,
@@ -372,32 +336,24 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
     ) external override onlyByCore returns (uint256 pnkBalance, uint256 newCourtStake, uint256 availablePenalty) {
         Juror storage juror = jurors[_account];
         availablePenalty = _penalty;
-        newCourtStake = stakeOf(_account, _courtID);
+        newCourtStake = _stakeOf(_account, _courtID);
         if (juror.stakedPnk < _penalty) {
             availablePenalty = juror.stakedPnk;
         }
 
         if (availablePenalty == 0) return (juror.stakedPnk, newCourtStake, 0); // No penalty to apply.
 
-        uint256 currentStake = stakeOf(_account, _courtID);
+        uint256 currentStake = _stakeOf(_account, _courtID);
         uint256 newStake = 0;
         if (currentStake >= availablePenalty) {
             newStake = currentStake - availablePenalty;
         }
         _setStake(_account, _courtID, 0, availablePenalty, newStake);
         pnkBalance = juror.stakedPnk; // updated by _setStake()
-        newCourtStake = stakeOf(_account, _courtID); // updated by _setStake()
+        newCourtStake = _stakeOf(_account, _courtID); // updated by _setStake()
     }
 
-    /// @dev Update the state of the stakes with a PNK reward deposit, called by KC during rewards execution.
-    /// `O(n + p * log_k(j))` where
-    /// `n` is the number of courts the juror has staked in,
-    /// `p` is the depth of the court tree,
-    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
-    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
-    /// @param _account The address of the juror.
-    /// @param _courtID The ID of the court.
-    /// @param _reward The amount of PNK to be deposited as a reward.
+    /// @inheritdoc ISortitionModule
     function setStakeReward(
         address _account,
         uint96 _courtID,
@@ -405,7 +361,7 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
     ) external override onlyByCore returns (bool success) {
         if (_reward == 0) return true; // No reward to add.
 
-        uint256 currentStake = stakeOf(_account, _courtID);
+        uint256 currentStake = _stakeOf(_account, _courtID);
         if (currentStake == 0) return false; // Juror has been unstaked, don't increase their stake.
 
         uint256 newStake = currentStake + _reward;
@@ -422,7 +378,7 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
     ) internal {
         Juror storage juror = jurors[_account];
         if (_pnkDeposit > 0) {
-            uint256 currentStake = stakeOf(_account, _courtID);
+            uint256 currentStake = _stakeOf(_account, _courtID);
             if (currentStake == 0) {
                 juror.courtIDs.push(_courtID);
             }
@@ -459,17 +415,13 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
         emit StakeSet(_account, _courtID, _newStake, juror.stakedPnk);
     }
 
-    /// @dev Locks the tokens of the drawn juror.
-    /// @param _account The address of the juror.
-    /// @param _relativeAmount The amount to lock.
+    /// @inheritdoc ISortitionModule
     function lockStake(address _account, uint256 _relativeAmount) external override onlyByCore {
         jurors[_account].lockedPnk += _relativeAmount;
         emit StakeLocked(_account, _relativeAmount, false);
     }
 
-    /// @dev Unlocks the tokens of the drawn juror.
-    /// @param _account The address of the juror.
-    /// @param _relativeAmount The amount to unlock.
+    /// @inheritdoc ISortitionModule
     function unlockStake(address _account, uint256 _relativeAmount) external override onlyByCore {
         Juror storage juror = jurors[_account];
         juror.lockedPnk -= _relativeAmount;
@@ -481,13 +433,7 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
         }
     }
 
-    /// @dev Unstakes the inactive juror from all courts.
-    /// `O(n * (p * log_k(j)) )` where
-    /// `n` is the number of courts the juror has staked in,
-    /// `p` is the depth of the court tree,
-    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
-    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
-    /// @param _account The juror to unstake.
+    /// @inheritdoc ISortitionModule
     function forcedUnstakeAllCourts(address _account) external override onlyByCore {
         uint96[] memory courtIDs = getJurorCourtIDs(_account);
         for (uint256 j = courtIDs.length; j > 0; j--) {
@@ -495,24 +441,12 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
         }
     }
 
-    /// @dev Unstakes the inactive juror from a specific court.
-    /// `O(n * (p * log_k(j)) )` where
-    /// `n` is the number of courts the juror has staked in,
-    /// `p` is the depth of the court tree,
-    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
-    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
-    /// @param _account The juror to unstake.
-    /// @param _courtID The ID of the court.
+    /// @inheritdoc ISortitionModule
     function forcedUnstake(address _account, uint96 _courtID) external override onlyByCore {
         core.setStakeBySortitionModule(_account, _courtID, 0);
     }
 
-    /// @dev Gives back the locked PNKs in case the juror fully unstaked earlier.
-    /// Note that since locked and staked PNK are async it is possible for the juror to have positive staked PNK balance
-    /// while having 0 stake in courts and 0 locked tokens (eg. when the juror fully unstaked during dispute and later got his tokens unlocked).
-    /// In this case the juror can use this function to withdraw the leftover tokens.
-    /// Also note that if the juror has some leftover PNK while not fully unstaked he'll have to manually unstake from all courts to trigger this function.
-    /// @param _account The juror whose PNK to withdraw.
+    /// @inheritdoc ISortitionModule
     function withdrawLeftoverPNK(address _account) external override {
         // Can withdraw the leftover PNK if fully unstaked, has no tokens locked and has positive balance.
         // This withdrawal can't be triggered by calling setStake() in KlerosCore because current stake is technically 0, thus it is done via separate function.
@@ -527,15 +461,7 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
     // *           Public Views            * //
     // ************************************* //
 
-    /// @dev Draw an ID from a tree using a number.
-    /// Note that this function reverts if the sum of all values in the tree is 0.
-    /// @param _courtID The ID of the court.
-    /// @param _coreDisputeID Index of the dispute in Kleros Core.
-    /// @param _nonce Nonce to hash with random number.
-    /// @return drawnAddress The drawn address.
-    /// `O(k * log_k(n))` where
-    /// `k` is the maximum number of children per node in the tree,
-    ///  and `n` is the maximum number of nodes ever appended.
+    /// @inheritdoc ISortitionModule
     function draw(
         uint96 _courtID,
         uint256 _coreDisputeID,
@@ -547,23 +473,7 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
         (drawnAddress, fromSubcourtID) = sortitionSumTrees[key].draw(_coreDisputeID, _nonce, randomNumber);
     }
 
-    /// @dev Get the stake of a juror in a court.
-    /// @param _juror The address of the juror.
-    /// @param _courtID The ID of the court.
-    /// @return value The stake of the juror in the court.
-    function stakeOf(address _juror, uint96 _courtID) public view returns (uint256) {
-        bytes32 stakePathID = SortitionTrees.toStakePathID(_juror, _courtID);
-        TreeKey key = CourtID.wrap(_courtID).toTreeKey();
-        return sortitionSumTrees[key].stakeOf(stakePathID);
-    }
-
-    /// @dev Gets the balance of a juror in a court.
-    /// @param _juror The address of the juror.
-    /// @param _courtID The ID of the court.
-    /// @return totalStakedPnk The total amount of tokens staked including locked tokens and penalty deductions. Equivalent to the effective stake in the General court.
-    /// @return totalLocked The total amount of tokens locked in disputes.
-    /// @return stakedInCourt The amount of tokens staked in the specified court including locked tokens and penalty deductions.
-    /// @return nbCourts The number of courts the juror has directly staked in.
+    /// @inheritdoc ISortitionModule
     function getJurorBalance(
         address _juror,
         uint96 _courtID
@@ -576,26 +486,21 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
         Juror storage juror = jurors[_juror];
         totalStakedPnk = juror.stakedPnk;
         totalLocked = juror.lockedPnk;
-        stakedInCourt = stakeOf(_juror, _courtID);
+        stakedInCourt = _stakeOf(_juror, _courtID);
         nbCourts = juror.courtIDs.length;
     }
 
-    /// @dev Gets the court identifiers where a specific `_juror` has staked.
-    /// @param _juror The address of the juror.
+    /// @inheritdoc ISortitionModule
     function getJurorCourtIDs(address _juror) public view override returns (uint96[] memory) {
         return jurors[_juror].courtIDs;
     }
 
-    /// @dev Checks if the juror is staked in any court.
-    /// @param _juror The address of the juror.
-    /// @return Whether the juror is staked or not.
+    /// @inheritdoc ISortitionModule
     function isJurorStaked(address _juror) external view override returns (bool) {
         return jurors[_juror].stakedPnk > 0;
     }
 
-    /// @dev Checks if the juror has any leftover PNK in the contract.
-    /// @param _juror The address of the juror.
-    /// @return Whether the juror has leftover PNK.
+    /// @inheritdoc ISortitionModule
     function getJurorLeftoverPNK(address _juror) public view override returns (uint256) {
         Juror storage juror = jurors[_juror];
         if (juror.courtIDs.length == 0 && juror.lockedPnk == 0) {
@@ -609,6 +514,16 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
     // *            Internal               * //
     // ************************************* //
 
+    /// @dev Get the stake of a juror in a court.
+    /// @param _juror The address of the juror.
+    /// @param _courtID The ID of the court.
+    /// @return value The stake of the juror in the court.
+    function _stakeOf(address _juror, uint96 _courtID) internal view returns (uint256) {
+        bytes32 stakePathID = SortitionTrees.toStakePathID(_juror, _courtID);
+        TreeKey key = CourtID.wrap(_courtID).toTreeKey();
+        return sortitionSumTrees[key].stakeOf(stakePathID);
+    }
+
     /// @dev Converts sortition extradata into K value of sortition tree.
     /// @param _extraData Sortition extra data.
     /// @return K The value of K.
diff --git a/contracts/src/arbitration/interfaces/ISortitionModule.sol b/contracts/src/arbitration/interfaces/ISortitionModule.sol
index d9fe7e485..b10e39a42 100644
--- a/contracts/src/arbitration/interfaces/ISortitionModule.sol
+++ b/contracts/src/arbitration/interfaces/ISortitionModule.sol
@@ -4,17 +4,52 @@ pragma solidity >=0.8.0 <0.9.0;
 
 import "../../libraries/Constants.sol";
 
+/// @title ISortitionModule
+/// @dev Interface for the SortitionModule contract.
 interface ISortitionModule {
+    // ************************************* //
+    // *              Enums                * //
+    // ************************************* //
+
     enum Phase {
         staking, // Stake sum trees can be updated. Pass after `minStakingTime` passes and there is at least one dispute without jurors.
         generating, // Waiting for a random number. Pass as soon as it is ready.
         drawing // Jurors can be drawn. Pass after all disputes have jurors or `maxDrawingTime` passes.
     }
 
+    // ************************************* //
+    // *              Events               * //
+    // ************************************* //
+
+    /// @dev Emitted when the phase is changed.
+    /// @param _phase The new phase.
     event NewPhase(Phase _phase);
 
+    // ************************************* //
+    // *         State Modifiers           * //
+    // ************************************* //
+
+    /// @dev Passes the phase.
+    function passPhase() external;
+
+    /// @dev Executes the next delayed stakes.
+    /// @param _iterations The number of delayed stakes to execute.
+    function executeDelayedStakes(uint256 _iterations) external;
+
+    /// @dev Create a sortition sum tree at the specified key.
+    /// @param _courtID The ID of the court.
+    /// @param _extraData Extra data that contains the number of children each node in the tree should have.
     function createTree(uint96 _courtID, bytes memory _extraData) external;
 
+    /// @dev Validate the specified juror's new stake for a court.
+    /// Note: no state changes should be made when returning stakingResult != Successful, otherwise delayed stakes might break invariants.
+    /// @param _account The address of the juror.
+    /// @param _courtID The ID of the court.
+    /// @param _newStake The new stake.
+    /// @param _noDelay True if the stake change should not be delayed.
+    /// @return pnkDeposit The amount of PNK to be deposited.
+    /// @return pnkWithdrawal The amount of PNK to be withdrawn.
+    /// @return stakingResult The result of the staking operation.
     function validateStake(
         address _account,
         uint96 _courtID,
@@ -22,6 +57,17 @@ interface ISortitionModule {
         bool _noDelay
     ) external returns (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult);
 
+    /// @dev Update the state of the stakes, called by KC at the end of setStake flow.
+    /// `O(n + p * log_k(j))` where
+    /// `n` is the number of courts the juror has staked in,
+    /// `p` is the depth of the court tree,
+    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
+    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
+    /// @param _account The address of the juror.
+    /// @param _courtID The ID of the court.
+    /// @param _pnkDeposit The amount of PNK to be deposited.
+    /// @param _pnkWithdrawal The amount of PNK to be withdrawn.
+    /// @param _newStake The new stake.
     function setStake(
         address _account,
         uint96 _courtID,
@@ -30,44 +76,125 @@ interface ISortitionModule {
         uint256 _newStake
     ) external;
 
+    /// @dev Update the state of the stakes with a PNK reward deposit, called by KC during rewards execution.
+    /// `O(n + p * log_k(j))` where
+    /// `n` is the number of courts the juror has staked in,
+    /// `p` is the depth of the court tree,
+    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
+    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
+    /// @param _account The address of the juror.
+    /// @param _courtID The ID of the court.
+    /// @param _penalty The amount of PNK to be deducted.
+    /// @return pnkBalance The updated total PNK balance of the juror, including the penalty.
+    /// @return newCourtStake The updated stake of the juror in the court.
+    /// @return availablePenalty The amount of PNK that was actually deducted.
     function setStakePenalty(
         address _account,
         uint96 _courtID,
         uint256 _penalty
     ) external returns (uint256 pnkBalance, uint256 newCourtStake, uint256 availablePenalty);
 
+    /// @dev Update the state of the stakes with a PNK reward deposit, called by KC during rewards execution.
+    /// `O(n + p * log_k(j))` where
+    /// `n` is the number of courts the juror has staked in,
+    /// `p` is the depth of the court tree,
+    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
+    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
+    /// @param _account The address of the juror.
+    /// @param _courtID The ID of the court.
+    /// @param _reward The amount of PNK to be deposited as a reward.
+    /// @return success True if the reward was added successfully.
     function setStakeReward(address _account, uint96 _courtID, uint256 _reward) external returns (bool success);
 
+    /// @dev Unstakes the inactive juror from all courts.
+    /// `O(n * (p * log_k(j)) )` where
+    /// `n` is the number of courts the juror has staked in,
+    /// `p` is the depth of the court tree,
+    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
+    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
+    /// @param _account The juror to unstake.
     function forcedUnstakeAllCourts(address _account) external;
 
+    /// @dev Unstakes the inactive juror from a specific court.
+    /// `O(n * (p * log_k(j)) )` where
+    /// `n` is the number of courts the juror has staked in,
+    /// `p` is the depth of the court tree,
+    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
+    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
+    /// @param _account The juror to unstake.
+    /// @param _courtID The ID of the court.
     function forcedUnstake(address _account, uint96 _courtID) external;
 
+    /// @dev Locks the tokens of the drawn juror.
+    /// @param _account The address of the juror.
+    /// @param _relativeAmount The amount to lock.
     function lockStake(address _account, uint256 _relativeAmount) external;
 
+    /// @dev Unlocks the tokens of the drawn juror.
+    /// @param _account The address of the juror.
+    /// @param _relativeAmount The amount to unlock.
     function unlockStake(address _account, uint256 _relativeAmount) external;
 
-    function notifyRandomNumber(uint256 _drawnNumber) external;
+    /// @dev Triggers the state changes after dispute creation.
+    /// @param _disputeID The ID of the dispute.
+    /// @param _roundID The ID of the round.
+    function createDisputeHook(uint256 _disputeID, uint256 _roundID) external;
+
+    /// @dev Triggers the state changes after drawing.
+    /// @param _disputeID The ID of the dispute.
+    /// @param _roundID The ID of the round.
+    function postDrawHook(uint256 _disputeID, uint256 _roundID) external;
+
+    /// @dev Gives back the locked PNKs in case the juror fully unstaked earlier.
+    /// Note that since locked and staked PNK are async it is possible for the juror to have positive staked PNK balance
+    /// while having 0 stake in courts and 0 locked tokens (eg. when the juror fully unstaked during dispute and later got his tokens unlocked).
+    /// In this case the juror can use this function to withdraw the leftover tokens.
+    /// Also note that if the juror has some leftover PNK while not fully unstaked he'll have to manually unstake from all courts to trigger this function.
+    /// @param _account The juror whose PNK to withdraw.
+    function withdrawLeftoverPNK(address _account) external;
 
+    // ************************************* //
+    // *           Public Views            * //
+    // ************************************* //
+
+    /// @dev Draw an ID from a tree using a number.
+    /// Note that this function reverts if the sum of all values in the tree is 0.
+    /// @param _courtID The ID of the court.
+    /// @param _coreDisputeID Index of the dispute in Kleros Core.
+    /// @param _nonce Nonce to hash with random number.
+    /// @return drawnAddress The drawn address.
+    /// `O(k * log_k(n))` where
+    /// `k` is the maximum number of children per node in the tree,
+    ///  and `n` is the maximum number of nodes ever appended.
     function draw(
         uint96 _courtID,
         uint256 _coreDisputeID,
         uint256 _nonce
     ) external view returns (address drawnAddress, uint96 fromSubcourtID);
 
+    /// @dev Gets the balance of a juror in a court.
+    /// @param _juror The address of the juror.
+    /// @param _courtID The ID of the court.
+    /// @return totalStakedPnk The total amount of tokens staked including locked tokens and penalty deductions. Equivalent to the effective stake in the General court.
+    /// @return totalLocked The total amount of tokens locked in disputes.
+    /// @return stakedInCourt The amount of tokens staked in the specified court including locked tokens and penalty deductions.
+    /// @return nbCourts The number of courts the juror has directly staked in.
     function getJurorBalance(
         address _juror,
         uint96 _courtID
-    ) external view returns (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts);
+    ) external view returns (uint256 totalStakedPnk, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts);
 
+    /// @dev Gets the court identifiers where a specific `_juror` has staked.
+    /// @param _juror The address of the juror.
     function getJurorCourtIDs(address _juror) external view returns (uint96[] memory);
 
+    /// @dev Checks if the juror is staked in any court.
+    /// @param _juror The address of the juror.
+    /// @return Whether the juror is staked or not.
     function isJurorStaked(address _juror) external view returns (bool);
 
+    /// @dev Checks if the juror has any leftover PNK in the contract.
+    /// @param _juror The address of the juror.
+    /// @return Whether the juror has leftover PNK.
     function getJurorLeftoverPNK(address _juror) external view returns (uint256);
-
-    function createDisputeHook(uint256 _disputeID, uint256 _roundID) external;
-
-    function postDrawHook(uint256 _disputeID, uint256 _roundID) external;
-
-    function withdrawLeftoverPNK(address _account) external;
 }
diff --git a/contracts/src/arbitration/university/SortitionModuleUniversity.sol b/contracts/src/arbitration/university/SortitionModuleUniversity.sol
index 8d562d0b7..0af8317e2 100644
--- a/contracts/src/arbitration/university/SortitionModuleUniversity.sol
+++ b/contracts/src/arbitration/university/SortitionModuleUniversity.sol
@@ -108,6 +108,14 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
     // *         State Modifiers           * //
     // ************************************* //
 
+    function passPhase() external override onlyByCore {
+        // NOP
+    }
+
+    function executeDelayedStakes(uint256 _iterations) external override onlyByCore {
+        // NOP
+    }
+
     function setTransientJuror(address _juror) external override onlyByCore {
         transientJuror = _juror;
     }
@@ -124,10 +132,6 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
         disputesWithoutJurors--;
     }
 
-    /// @dev Saves the random number to use it in sortition. Not used by this contract because the storing of the number is inlined in passPhase().
-    /// @param _randomNumber Random number returned by RNG contract.
-    function notifyRandomNumber(uint256 _randomNumber) public override {}
-
     /// @dev Validate the specified juror's new stake for a court.
     /// Note: no state changes should be made when returning stakingResult != Successful, otherwise delayed stakes might break invariants.
     /// @param _account The address of the juror.

From 45308698cacb9e3c1001b421f55cfbd21d7253ed Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 10 Sep 2025 03:51:38 +0100
Subject: [PATCH 121/175] chore: replaced @dev natspec with @notice where
 relevant, fixed foundry doc generation

---
 contracts/package.json                        |   2 -
 .../arbitration/DisputeTemplateRegistry.sol   |  15 +-
 contracts/src/arbitration/KlerosCore.sol      | 151 ++++++++----------
 contracts/src/arbitration/KlerosGovernor.sol  |  55 ++++---
 contracts/src/arbitration/PolicyRegistry.sol  |  12 +-
 contracts/src/arbitration/SortitionModule.sol |  24 +--
 .../arbitrables/ArbitrableExample.sol         |  24 +--
 .../arbitrables/DisputeResolver.sol           |  15 +-
 .../devtools/DisputeResolverRuler.sol         |   6 +-
 .../dispute-kits/DisputeKitClassic.sol        |   4 +-
 .../dispute-kits/DisputeKitClassicBase.sol    |  60 +++----
 .../dispute-kits/DisputeKitGated.sol          |  20 +--
 .../dispute-kits/DisputeKitGatedShutter.sol   |  36 ++---
 .../dispute-kits/DisputeKitShutter.sol        |  24 +--
 .../dispute-kits/DisputeKitSybilResistant.sol |   6 +-
 .../arbitration/evidence/EvidenceModule.sol   |   8 +-
 .../evidence/ModeratedEvidenceModule.sol      |  51 +++---
 .../arbitration/interfaces/IArbitrableV2.sol  |  24 ++-
 .../arbitration/interfaces/IArbitratorV2.sol  |  48 +++---
 .../arbitration/interfaces/IDisputeKit.sol    |  44 ++---
 .../interfaces/IDisputeTemplateRegistry.sol   |  15 +-
 .../src/arbitration/interfaces/IEvidence.sol  |   2 +-
 .../interfaces/ISortitionModule.sol           |  76 +++++----
 .../university/KlerosCoreUniversity.sol       |  93 +++++------
 .../university/SortitionModuleUniversity.sol  |  94 +++--------
 .../view/KlerosCoreSnapshotProxy.sol          |  12 +-
 contracts/src/gateway/ForeignGateway.sol      |  14 +-
 contracts/src/gateway/HomeGateway.sol         |  18 +--
 .../gateway/interfaces/IForeignGateway.sol    |  30 +++-
 .../src/gateway/interfaces/IHomeGateway.sol   |  42 +++--
 contracts/src/libraries/SafeERC20.sol         |  16 +-
 contracts/src/libraries/SortitionTrees.sol    |  41 +++--
 contracts/src/proxy/UUPSProxiable.sol         |  19 +--
 contracts/src/proxy/UUPSProxy.sol             |  13 +-
 contracts/src/rng/BlockhashRNG.sol            |  25 +--
 contracts/src/rng/ChainlinkRNG.sol            |  27 ++--
 contracts/src/rng/IRNG.sol                    |  12 +-
 contracts/src/rng/IRandomizer.sol             |   2 +-
 contracts/src/rng/IncrementalNG.sol           |   4 +-
 contracts/src/rng/RNGWithFallback.sol         |  11 +-
 contracts/src/rng/RandomizerRNG.sol           |  21 +--
 contracts/src/utils/TransactionBatcher.sol    |   9 ++
 foundry.toml                                  |  12 ++
 package.json                                  |   4 +-
 remappings.txt                                |   9 ++
 45 files changed, 670 insertions(+), 580 deletions(-)
 create mode 100644 foundry.toml
 create mode 100644 remappings.txt

diff --git a/contracts/package.json b/contracts/package.json
index fd40b404d..ad8174fb6 100644
--- a/contracts/package.json
+++ b/contracts/package.json
@@ -87,8 +87,6 @@
     "watch": "hardhat watch",
     "natspec-smells": "natspec-smells",
     "docgen": "hardhat docgen",
-    "docserve": "scripts/docPreprocess.sh && forge doc --serve",
-    "docbuild": "scripts/docPreprocess.sh && forge doc --build --out dist && scripts/docPostprocess.sh",
     "populate:courts:devnet": "hardhat populate:courts --from v2_devnet  --network arbitrumSepoliaDevnet",
     "populate:courts:testnet": "hardhat populate:courts --from v2_testnet  --network arbitrumSepolia",
     "populate:courts:mainnet": "hardhat populate:courts --from v2_mainnet  --network arbitrum",
diff --git a/contracts/src/arbitration/DisputeTemplateRegistry.sol b/contracts/src/arbitration/DisputeTemplateRegistry.sol
index 8d3d68d58..2abbe1911 100644
--- a/contracts/src/arbitration/DisputeTemplateRegistry.sol
+++ b/contracts/src/arbitration/DisputeTemplateRegistry.sol
@@ -6,7 +6,7 @@ import "../proxy/Initializable.sol";
 import "./interfaces/IDisputeTemplateRegistry.sol";
 
 /// @title Dispute Template Registry
-/// @dev A contract to maintain a registry of dispute templates.
+/// @notice A contract to maintain a registry of dispute templates.
 contract DisputeTemplateRegistry is IDisputeTemplateRegistry, UUPSProxiable, Initializable {
     string public constant override version = "2.0.0";
 
@@ -14,10 +14,10 @@ contract DisputeTemplateRegistry is IDisputeTemplateRegistry, UUPSProxiable, Ini
     // *             Storage               * //
     // ************************************* //
 
-    /// @dev The owner of the contract.
+    /// @notice The owner of the contract.
     address public owner;
 
-    /// @dev The number of templates.
+    /// @notice The number of templates.
     uint256 public templates;
 
     // ************************************* //
@@ -38,7 +38,7 @@ contract DisputeTemplateRegistry is IDisputeTemplateRegistry, UUPSProxiable, Ini
         _disableInitializers();
     }
 
-    /// @dev Initializer
+    /// @notice Initializer
     /// @param _owner Owner of the contract.
     function initialize(address _owner) external initializer {
         owner = _owner;
@@ -54,7 +54,7 @@ contract DisputeTemplateRegistry is IDisputeTemplateRegistry, UUPSProxiable, Ini
         // NOP
     }
 
-    /// @dev Changes the owner of the contract.
+    /// @notice Changes the owner of the contract.
     /// @param _owner The new owner.
     function changeOwner(address _owner) external onlyByOwner {
         owner = _owner;
@@ -64,10 +64,7 @@ contract DisputeTemplateRegistry is IDisputeTemplateRegistry, UUPSProxiable, Ini
     // *         State Modifiers           * //
     // ************************************* //
 
-    /// @dev Registers a new dispute template.
-    /// @param _templateTag The tag of the template (optional).
-    /// @param _templateData The data of the template.
-    /// @param _templateDataMappings The data mappings of the template.
+    /// @inheritdoc IDisputeTemplateRegistry
     function setDisputeTemplate(
         string memory _templateTag,
         string memory _templateData,
diff --git a/contracts/src/arbitration/KlerosCore.sol b/contracts/src/arbitration/KlerosCore.sol
index 59215d667..fab1f2882 100644
--- a/contracts/src/arbitration/KlerosCore.sol
+++ b/contracts/src/arbitration/KlerosCore.sol
@@ -13,8 +13,8 @@ import {IERC721} from "@openzeppelin/contracts/token/ERC721/IERC721.sol";
 import "../libraries/Constants.sol";
 
 /// @title KlerosCore
-/// Core arbitrator contract for Kleros v2.
-/// Note that this contract trusts the PNK token, the dispute kit and the sortition module contracts.
+/// @notice Core arbitrator contract for Kleros v2.
+/// @dev This contract trusts the PNK token, the dispute kits and the sortition module contracts.
 contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
     using SafeERC20 for IERC20;
     using SafeSend for address payable;
@@ -115,29 +115,29 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
     // *              Events               * //
     // ************************************* //
 
-    /// @dev Emitted when period is passed.
+    /// @notice Emitted when period is passed.
     /// @param _disputeID ID of the related dispute.
     /// @param _period The new period.
     event NewPeriod(uint256 indexed _disputeID, Period _period);
 
-    /// @dev Emitted when appeal period starts.
+    /// @notice Emitted when appeal period starts.
     /// @param _disputeID ID of the related dispute.
     /// @param _arbitrable The arbitrable contract.
     event AppealPossible(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);
 
-    /// @dev Emitted when the dispute is successfully appealed.
+    /// @notice Emitted when the dispute is successfully appealed.
     /// @param _disputeID ID of the related dispute.
     /// @param _arbitrable The arbitrable contract.
     event AppealDecision(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);
 
-    /// @dev Emitted when an address is successfully drawn.
+    /// @notice Emitted when an address is successfully drawn.
     /// @param _address The drawn address.
     /// @param _disputeID ID of the related dispute.
     /// @param _roundID ID of the related round.
     /// @param _voteID ID of the vote given to the drawn juror.
     event Draw(address indexed _address, uint256 indexed _disputeID, uint256 _roundID, uint256 _voteID);
 
-    /// @dev Emitted when a new court is created.
+    /// @notice Emitted when a new court is created.
     /// @param _courtID ID of the new court.
     /// @param _parent ID of the parent court.
     /// @param _hiddenVotes Whether the court has hidden votes or not.
@@ -159,7 +159,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         uint256[] _supportedDisputeKits
     );
 
-    /// @dev Emitted when court's parameters are changed.
+    /// @notice Emitted when court's parameters are changed.
     /// @param _courtID ID of the court.
     /// @param _hiddenVotes Whether the court has hidden votes or not.
     /// @param _minStake The `minStake` property value of the court.
@@ -177,18 +177,18 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         uint256[4] _timesPerPeriod
     );
 
-    /// @dev Emitted when a dispute kit is created.
+    /// @notice Emitted when a dispute kit is created.
     /// @param _disputeKitID ID of the new dispute kit.
     /// @param _disputeKitAddress Address of the new dispute kit.
     event DisputeKitCreated(uint256 indexed _disputeKitID, IDisputeKit indexed _disputeKitAddress);
 
-    /// @dev Emitted when a dispute kit is enabled/disabled in a court.
+    /// @notice Emitted when a dispute kit is enabled/disabled in a court.
     /// @param _courtID ID of the related court.
     /// @param _disputeKitID ID of the dispute kit.
     /// @param _enable Whether the dispute kit has been enabled or disabled.
     event DisputeKitEnabled(uint96 indexed _courtID, uint256 indexed _disputeKitID, bool indexed _enable);
 
-    /// @dev Emitted when a dispute jumps to a new court.
+    /// @notice Emitted when a dispute jumps to a new court.
     /// @param _disputeID ID of the dispute.
     /// @param _roundID ID of the round.
     /// @param _fromCourtID ID of the previous court.
@@ -200,7 +200,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         uint96 _toCourtID
     );
 
-    /// @dev Emitted when a dispute jumps to a new dispute kit.
+    /// @notice Emitted when a dispute jumps to a new dispute kit.
     /// @param _disputeID ID of the dispute.
     /// @param _roundID ID of the round.
     /// @param _fromDisputeKitID ID of the previous dispute kit.
@@ -212,7 +212,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         uint256 _toDisputeKitID
     );
 
-    /// @dev Emitted when juror's balance shifts after penalties/rewards has been processed.
+    /// @notice Emitted when juror's balance shifts after penalties/rewards has been processed.
     /// @param _account Juror's address.
     /// @param _disputeID ID of the dispute.
     /// @param _roundID ID of the round.
@@ -232,7 +232,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         IERC20 _feeToken
     );
 
-    /// @dev Emitted when leftover reward sent to owner.
+    /// @notice Emitted when leftover reward sent to owner.
     /// @param _disputeID ID of the dispute.
     /// @param _roundID ID of the round.
     /// @param _amountPnk Amount of PNK sent.
@@ -246,10 +246,10 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         IERC20 _feeToken
     );
 
-    /// @dev Emitted when this contract is paused.
+    /// @notice Emitted when this contract is paused.
     event Paused();
 
-    /// @dev Emitted when this contract is unpaused.
+    /// @notice Emitted when this contract is unpaused.
     event Unpaused();
 
     // ************************************* //
@@ -285,7 +285,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         _disableInitializers();
     }
 
-    /// @dev Initializer (constructor equivalent for upgradable contracts).
+    /// @notice Initializer (constructor equivalent for upgradable contracts).
     /// @param _owner The owner's address.
     /// @param _guardian The guardian's address.
     /// @param _pinakion The address of the token contract.
@@ -372,19 +372,19 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         // NOP
     }
 
-    /// @dev Pause staking and reward execution. Can only be done by guardian or owner.
+    /// @notice Pause staking and reward execution. Can only be done by guardian or owner.
     function pause() external onlyByGuardianOrOwner whenNotPaused {
         paused = true;
         emit Paused();
     }
 
-    /// @dev Unpause staking and reward execution. Can only be done by owner.
+    /// @notice Unpause staking and reward execution. Can only be done by owner.
     function unpause() external onlyByOwner whenPaused {
         paused = false;
         emit Unpaused();
     }
 
-    /// @dev Allows the owner to call anything on behalf of the contract.
+    /// @notice Allows the owner to call anything on behalf of the contract.
     /// @param _destination The destination of the call.
     /// @param _amount The value sent with the call.
     /// @param _data The data sent with the call.
@@ -393,38 +393,38 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         if (!success) revert UnsuccessfulCall();
     }
 
-    /// @dev Changes the `owner` storage variable.
+    /// @notice Changes the `owner` storage variable.
     /// @param _owner The new value for the `owner` storage variable.
     function changeOwner(address payable _owner) external onlyByOwner {
         owner = _owner;
     }
 
-    /// @dev Changes the `guardian` storage variable.
+    /// @notice Changes the `guardian` storage variable.
     /// @param _guardian The new value for the `guardian` storage variable.
     function changeGuardian(address _guardian) external onlyByOwner {
         guardian = _guardian;
     }
 
-    /// @dev Changes the `pinakion` storage variable.
+    /// @notice Changes the `pinakion` storage variable.
     /// @param _pinakion The new value for the `pinakion` storage variable.
     function changePinakion(IERC20 _pinakion) external onlyByOwner {
         pinakion = _pinakion;
     }
 
-    /// @dev Changes the `jurorProsecutionModule` storage variable.
+    /// @notice Changes the `jurorProsecutionModule` storage variable.
     /// @param _jurorProsecutionModule The new value for the `jurorProsecutionModule` storage variable.
     function changeJurorProsecutionModule(address _jurorProsecutionModule) external onlyByOwner {
         jurorProsecutionModule = _jurorProsecutionModule;
     }
 
-    /// @dev Changes the `_sortitionModule` storage variable.
+    /// @notice Changes the `_sortitionModule` storage variable.
     /// Note that the new module should be initialized for all courts.
     /// @param _sortitionModule The new value for the `sortitionModule` storage variable.
     function changeSortitionModule(ISortitionModule _sortitionModule) external onlyByOwner {
         sortitionModule = _sortitionModule;
     }
 
-    /// @dev Add a new supported dispute kit module to the court.
+    /// @notice Add a new supported dispute kit module to the court.
     /// @param _disputeKitAddress The address of the dispute kit contract.
     function addNewDisputeKit(IDisputeKit _disputeKitAddress) external onlyByOwner {
         uint256 disputeKitID = disputeKits.length;
@@ -432,7 +432,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         emit DisputeKitCreated(disputeKitID, _disputeKitAddress);
     }
 
-    /// @dev Creates a court under a specified parent court.
+    /// @notice Creates a court under a specified parent court.
     /// @param _parent The `parent` property value of the court.
     /// @param _hiddenVotes The `hiddenVotes` property value of the court.
     /// @param _minStake The `minStake` property value of the court.
@@ -495,7 +495,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         );
     }
 
-    /// @dev Changes the parameters of the court.
+    /// @notice Changes the parameters of the court.
     /// @param _courtID ID of the court.
     /// @param _hiddenVotes The `hiddenVotes` property value of the court.
     /// @param _minStake The `minStake` property value of the court.
@@ -538,7 +538,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         );
     }
 
-    /// @dev Adds/removes court's support for specified dispute kits.
+    /// @notice Adds/removes court's support for specified dispute kits.
     /// @param _courtID The ID of the court.
     /// @param _disputeKitIDs The IDs of dispute kits which support should be added/removed.
     /// @param _enable Whether add or remove the dispute kits from the court.
@@ -559,7 +559,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         }
     }
 
-    /// @dev Changes the supported fee tokens.
+    /// @notice Changes the supported fee tokens.
     /// @param _feeToken The fee token.
     /// @param _accepted Whether the token is supported or not as a method of fee payment.
     function changeAcceptedFeeTokens(IERC20 _feeToken, bool _accepted) external onlyByOwner {
@@ -567,7 +567,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         emit AcceptedFeeToken(_feeToken, _accepted);
     }
 
-    /// @dev Changes the currency rate of a fee token.
+    /// @notice Changes the currency rate of a fee token.
     /// @param _feeToken The fee token.
     /// @param _rateInEth The new rate of the fee token in ETH.
     /// @param _rateDecimals The new decimals of the fee token rate.
@@ -577,20 +577,20 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         emit NewCurrencyRate(_feeToken, _rateInEth, _rateDecimals);
     }
 
-    /// @dev Changes the `jurorNft` storage variable.
+    /// @notice Changes the `jurorNft` storage variable.
     /// @param _jurorNft The new value for the `jurorNft` storage variable.
     function changeJurorNft(IERC721 _jurorNft) external onlyByOwner {
         jurorNft = _jurorNft;
     }
 
-    /// @dev Adds or removes an arbitrable from whitelist.
+    /// @notice Adds or removes an arbitrable from whitelist.
     /// @param _arbitrable Arbitrable address.
     /// @param _allowed Whether add or remove permission.
     function changeArbitrableWhitelist(address _arbitrable, bool _allowed) external onlyByOwner {
         arbitrableWhitelist[_arbitrable] = _allowed;
     }
 
-    /// @dev Enables or disables the arbitrable whitelist.
+    /// @notice Enables or disables the arbitrable whitelist.
     function changeArbitrableWhitelistEnabled(bool _enabled) external onlyByOwner {
         arbitrableWhitelistEnabled = _enabled;
     }
@@ -599,7 +599,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
     // *         State Modifiers           * //
     // ************************************* //
 
-    /// @dev Sets the caller's stake in a court.
+    /// @notice Sets the caller's stake in a court.
     /// @param _courtID The ID of the court.
     /// @param _newStake The new stake.
     /// Note that the existing delayed stake will be nullified as non-relevant.
@@ -608,7 +608,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         _setStake(msg.sender, _courtID, _newStake, false, OnError.Revert);
     }
 
-    /// @dev Sets the stake of a specified account in a court without delaying stake changes, typically to apply a delayed stake or unstake inactive jurors.
+    /// @notice Sets the stake of a specified account in a court without delaying stake changes, typically to apply a delayed stake or unstake inactive jurors.
     /// @param _account The account whose stake is being set.
     /// @param _courtID The ID of the court.
     /// @param _newStake The new stake.
@@ -617,7 +617,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         _setStake(_account, _courtID, _newStake, true, OnError.Return);
     }
 
-    /// @dev Transfers PNK to the juror by SortitionModule.
+    /// @notice Transfers PNK to the juror by SortitionModule.
     /// @param _account The account of the juror whose PNK to transfer.
     /// @param _amount The amount to transfer.
     function transferBySortitionModule(address _account, uint256 _amount) external {
@@ -686,7 +686,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         emit DisputeCreation(disputeID, IArbitrableV2(msg.sender));
     }
 
-    /// @dev Passes the period of a specified dispute.
+    /// @notice Passes the period of a specified dispute.
     /// @param _disputeID The ID of the dispute.
     function passPeriod(uint256 _disputeID) external {
         Dispute storage dispute = disputes[_disputeID];
@@ -734,7 +734,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         emit NewPeriod(_disputeID, dispute.period);
     }
 
-    /// @dev Draws jurors for the dispute. Can be called in parts.
+    /// @notice Draws jurors for the dispute. Can be called in parts.
     /// @param _disputeID The ID of the dispute.
     /// @param _iterations The number of iterations to run.
     /// @return nbDrawnJurors The total number of jurors drawn in the round.
@@ -765,8 +765,8 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         return round.drawnJurors.length;
     }
 
-    /// @dev Appeals the ruling of a specified dispute.
-    /// Note: Access restricted to the Dispute Kit for this `disputeID`.
+    /// @notice Appeals the ruling of a specified dispute.
+    /// @dev Access restricted to the Dispute Kit for this `_disputeID`.
     /// @param _disputeID The ID of the dispute.
     /// @param _numberOfChoices Number of choices for the dispute. Can be required during court jump.
     /// @param _extraData Extradata for the dispute. Can be required during court jump.
@@ -819,8 +819,8 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         emit NewPeriod(_disputeID, Period.evidence);
     }
 
-    /// @dev Distribute the PNKs at stake and the dispute fees for the specific round of the dispute. Can be called in parts.
-    /// Note: Reward distributions are forbidden during pause.
+    /// @notice Distribute the PNKs at stake and the dispute fees for the specific round of the dispute. Can be called in parts.
+    /// @dev Reward distributions are forbidden during pause.
     /// @param _disputeID The ID of the dispute.
     /// @param _round The appeal round.
     /// @param _iterations The number of iterations to run.
@@ -889,7 +889,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         }
     }
 
-    /// @dev Distribute the PNKs at stake and the dispute fees for the specific round of the dispute, penalties only.
+    /// @notice Distribute the PNKs at stake and the dispute fees for the specific round of the dispute, penalties only.
     /// @param _params The parameters for the execution, see `ExecuteParams`.
     /// @return pnkPenaltiesInRoundCache The updated penalties in round cache.
     function _executePenalties(ExecuteParams memory _params) internal returns (uint256) {
@@ -960,7 +960,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         return _params.pnkPenaltiesInRound;
     }
 
-    /// @dev Distribute the PNKs at stake and the dispute fees for the specific round of the dispute, rewards only.
+    /// @notice Distribute the PNKs at stake and the dispute fees for the specific round of the dispute, rewards only.
     /// @param _params The parameters for the execution, see `ExecuteParams`.
     function _executeRewards(ExecuteParams memory _params) internal {
         Dispute storage dispute = disputes[_params.disputeID];
@@ -1037,7 +1037,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         }
     }
 
-    /// @dev Executes a specified dispute's ruling.
+    /// @notice Executes a specified dispute's ruling.
     /// @param _disputeID The ID of the dispute.
     function executeRuling(uint256 _disputeID) external {
         Dispute storage dispute = disputes[_disputeID];
@@ -1054,25 +1054,18 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
     // *           Public Views            * //
     // ************************************* //
 
-    /// @dev Compute the cost of arbitration denominated in ETH.
-    ///      It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.
-    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).
-    /// @return cost The arbitration cost in ETH.
+    /// @inheritdoc IArbitratorV2
     function arbitrationCost(bytes memory _extraData) public view override returns (uint256 cost) {
         (uint96 courtID, uint256 minJurors, ) = _extraDataToCourtIDMinJurorsDisputeKit(_extraData);
         cost = courts[courtID].feeForJuror * minJurors;
     }
 
-    /// @dev Compute the cost of arbitration denominated in `_feeToken`.
-    ///      It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.
-    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).
-    /// @param _feeToken The ERC20 token used to pay fees.
-    /// @return cost The arbitration cost in `_feeToken`.
+    /// @inheritdoc IArbitratorV2
     function arbitrationCost(bytes calldata _extraData, IERC20 _feeToken) public view override returns (uint256 cost) {
         cost = convertEthToTokenAmount(_feeToken, arbitrationCost(_extraData));
     }
 
-    /// @dev Gets the cost of appealing a specified dispute.
+    /// @notice Gets the cost of appealing a specified dispute.
     /// @param _disputeID The ID of the dispute.
     /// @return cost The appeal cost.
     function appealCost(uint256 _disputeID) public view returns (uint256 cost) {
@@ -1101,7 +1094,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         }
     }
 
-    /// @dev Gets the start and the end of a specified dispute's current appeal period.
+    /// @notice Gets the start and the end of a specified dispute's current appeal period.
     /// @param _disputeID The ID of the dispute.
     /// @return start The start of the appeal period.
     /// @return end The end of the appeal period.
@@ -1116,11 +1109,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         }
     }
 
-    /// @dev Gets the current ruling of a specified dispute.
-    /// @param _disputeID The ID of the dispute.
-    /// @return ruling The current ruling.
-    /// @return tied Whether it's a tie or not.
-    /// @return overridden Whether the ruling was overridden by appeal funding or not.
+    /// @inheritdoc IArbitratorV2
     function currentRuling(uint256 _disputeID) public view returns (uint256 ruling, bool tied, bool overridden) {
         Dispute storage dispute = disputes[_disputeID];
         Round storage round = dispute.rounds[dispute.rounds.length - 1];
@@ -1128,7 +1117,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         (ruling, tied, overridden) = disputeKit.currentRuling(_disputeID);
     }
 
-    /// @dev Gets the round info for a specified dispute and round.
+    /// @notice Gets the round info for a specified dispute and round.
     /// @dev This function must not be called from a non-view function because it returns a dynamic array which might be very large, theoretically exceeding the block gas limit.
     /// @param _disputeID The ID of the dispute.
     /// @param _round The round to get the info for.
@@ -1137,7 +1126,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         return disputes[_disputeID].rounds[_round];
     }
 
-    /// @dev Gets the PNK at stake per juror for a specified dispute and round.
+    /// @notice Gets the PNK at stake per juror for a specified dispute and round.
     /// @param _disputeID The ID of the dispute.
     /// @param _round The round to get the info for.
     /// @return pnkAtStakePerJuror The PNK at stake per juror.
@@ -1145,14 +1134,14 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         return disputes[_disputeID].rounds[_round].pnkAtStakePerJuror;
     }
 
-    /// @dev Gets the number of rounds for a specified dispute.
+    /// @notice Gets the number of rounds for a specified dispute.
     /// @param _disputeID The ID of the dispute.
     /// @return The number of rounds.
     function getNumberOfRounds(uint256 _disputeID) external view returns (uint256) {
         return disputes[_disputeID].rounds.length;
     }
 
-    /// @dev Checks if a given dispute kit is supported by a given court.
+    /// @notice Checks if a given dispute kit is supported by a given court.
     /// @param _courtID The ID of the court to check the support for.
     /// @param _disputeKitID The ID of the dispute kit to check the support for.
     /// @return Whether the dispute kit is supported or not.
@@ -1160,7 +1149,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         return courts[_courtID].supportedDisputeKits[_disputeKitID];
     }
 
-    /// @dev Gets the timesPerPeriod array for a given court.
+    /// @notice Gets the timesPerPeriod array for a given court.
     /// @param _courtID The ID of the court to get the times from.
     /// @return timesPerPeriod The timesPerPeriod array for the given court.
     function getTimesPerPeriod(uint96 _courtID) external view returns (uint256[4] memory timesPerPeriod) {
@@ -1171,14 +1160,14 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
     // *   Public Views for Dispute Kits   * //
     // ************************************* //
 
-    /// @dev Gets the number of votes permitted for the specified dispute in the latest round.
+    /// @notice Gets the number of votes permitted for the specified dispute in the latest round.
     /// @param _disputeID The ID of the dispute.
     function getNumberOfVotes(uint256 _disputeID) external view returns (uint256) {
         Dispute storage dispute = disputes[_disputeID];
         return dispute.rounds[dispute.rounds.length - 1].nbVotes;
     }
 
-    /// @dev Returns true if the dispute kit will be switched to a parent DK.
+    /// @notice Returns true if the dispute kit will be switched to a parent DK.
     /// @param _disputeID The ID of the dispute.
     /// @return Whether DK will be switched or not.
     function isDisputeKitJumping(uint256 _disputeID) external view returns (bool) {
@@ -1194,13 +1183,13 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         return !courts[court.parent].supportedDisputeKits[round.disputeKitID];
     }
 
-    /// @dev Returns the length of disputeKits array.
+    /// @notice Returns the length of disputeKits array.
     /// @return disputeKits length.
     function getDisputeKitsLength() external view returns (uint256) {
         return disputeKits.length;
     }
 
-    /// @dev Converts ETH into tokens.
+    /// @notice Converts ETH into tokens.
     /// @param _toToken The token to convert ETH into.
     /// @param _amountInEth ETH amount.
     /// @return Amount of tokens.
@@ -1212,7 +1201,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
     // *            Internal               * //
     // ************************************* //
 
-    /// @dev Returns true if the round is jumping to a parent court.
+    /// @notice Returns true if the round is jumping to a parent court.
     /// @param _round The round to check.
     /// @param _court The court to check.
     /// @return Whether the round is jumping to a parent court or not.
@@ -1225,7 +1214,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
             disputeKits[_round.disputeKitID].earlyCourtJump(_disputeID) || _round.nbVotes >= _court.jurorsForCourtJump;
     }
 
-    /// @dev Checks whether a dispute will jump to new court/DK, and returns new court and DK.
+    /// @notice Checks whether a dispute will jump to new court/DK, and returns new court and DK.
     /// @param _dispute Dispute data.
     /// @param _round Round ID.
     /// @param _court Current court ID.
@@ -1260,7 +1249,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         }
     }
 
-    /// @dev Internal function to transfer fee tokens (ETH or ERC20)
+    /// @notice Internal function to transfer fee tokens (ETH or ERC20)
     /// @param _feeToken The token to transfer (NATIVE_CURRENCY for ETH).
     /// @param _recipient The recipient address.
     /// @param _amount The amount to transfer.
@@ -1272,7 +1261,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         }
     }
 
-    /// @dev Applies degree of coherence to an amount
+    /// @notice Applies degree of coherence to an amount
     /// @param _amount The base amount to apply coherence to.
     /// @param _coherence The degree of coherence in basis points.
     /// @return The amount after applying the degree of coherence.
@@ -1280,7 +1269,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         return (_amount * _coherence) / ONE_BASIS_POINT;
     }
 
-    /// @dev Calculates PNK at stake per juror based on court parameters
+    /// @notice Calculates PNK at stake per juror based on court parameters
     /// @param _minStake The minimum stake for the court.
     /// @param _alpha The alpha parameter for the court in basis points.
     /// @return The amount of PNK at stake per juror.
@@ -1288,7 +1277,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         return (_minStake * _alpha) / ONE_BASIS_POINT;
     }
 
-    /// @dev Toggles the dispute kit support for a given court.
+    /// @notice Toggles the dispute kit support for a given court.
     /// @param _courtID The ID of the court to toggle the support for.
     /// @param _disputeKitID The ID of the dispute kit to toggle the support for.
     /// @param _enable Whether to enable or disable the support. Note that classic dispute kit should always be enabled.
@@ -1297,7 +1286,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         emit DisputeKitEnabled(_courtID, _disputeKitID, _enable);
     }
 
-    /// @dev If called only once then set _onError to Revert, otherwise set it to Return
+    /// @notice If called only once then set _onError to Revert, otherwise set it to Return
     /// @param _account The account to set the stake for.
     /// @param _courtID The ID of the court to set the stake for.
     /// @param _newStake The new stake.
@@ -1348,7 +1337,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         return true;
     }
 
-    /// @dev It may revert depending on the _onError parameter.
+    /// @notice It may revert depending on the _onError parameter.
     function _stakingFailed(OnError _onError, StakingResult _result) internal pure {
         if (_onError == OnError.Return) return;
         if (_result == StakingResult.StakingTransferFailed) revert StakingTransferFailed();
@@ -1361,8 +1350,8 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         if (_result == StakingResult.CannotStakeMoreThanMaxTotalStaked) revert StakingMoreThanMaxTotalStaked();
     }
 
-    /// @dev Gets a court ID, the minimum number of jurors and an ID of a dispute kit from a specified extra data bytes array.
-    /// Note that if extradata contains an incorrect value then this value will be switched to default.
+    /// @notice Gets a court ID, the minimum number of jurors and an ID of a dispute kit from a specified extra data bytes array.
+    /// @dev If `_extraData` contains an incorrect value then this value will be switched to default.
     /// @param _extraData The extra data bytes array. The first 32 bytes are the court ID, the next are the minimum number of jurors and the last are the dispute kit ID.
     /// @return courtID The court ID.
     /// @return minJurors The minimum number of jurors required.
diff --git a/contracts/src/arbitration/KlerosGovernor.sol b/contracts/src/arbitration/KlerosGovernor.sol
index db5ddbda0..37f857c80 100644
--- a/contracts/src/arbitration/KlerosGovernor.sol
+++ b/contracts/src/arbitration/KlerosGovernor.sol
@@ -6,7 +6,8 @@ import {IArbitrableV2, IArbitratorV2} from "./interfaces/IArbitrableV2.sol";
 import {SafeSend} from "../libraries/SafeSend.sol";
 import "./interfaces/IDisputeTemplateRegistry.sol";
 
-/// @title KlerosGovernor for V2. Note that appeal functionality and evidence submission will be handled by the court.
+/// @title KlerosGovernor for V2.
+/// @dev Appeal and evidence submission is handled by the court.
 contract KlerosGovernor is IArbitrableV2 {
     using SafeSend for address payable;
 
@@ -89,7 +90,7 @@ contract KlerosGovernor is IArbitrableV2 {
     // *              Events               * //
     // ************************************* //
 
-    /// @dev Emitted when a new list is submitted.
+    /// @notice Emitted when a new list is submitted.
     /// @param _listID The index of the transaction list in the array of lists.
     /// @param _submitter The address that submitted the list.
     /// @param _session The number of the current session.
@@ -106,7 +107,7 @@ contract KlerosGovernor is IArbitrableV2 {
     // *            Constructor            * //
     // ************************************* //
 
-    /// @dev Constructor.
+    /// @notice Constructor.
     /// @param _arbitrator The arbitrator of the contract.
     /// @param _arbitratorExtraData Extra data for the arbitrator.
     /// @param _templateData The dispute template data.
@@ -145,32 +146,34 @@ contract KlerosGovernor is IArbitrableV2 {
     // *             Governance            * //
     // ************************************* //
 
-    /// @dev Changes the value of the base deposit required for submitting a list.
+    /// @notice Changes the value of the base deposit required for submitting a list.
     /// @param _submissionBaseDeposit The new value of the base deposit, in wei.
     function changeSubmissionDeposit(uint256 _submissionBaseDeposit) external onlyByOwner {
         submissionBaseDeposit = _submissionBaseDeposit;
     }
 
-    /// @dev Changes the time allocated for submission. Note that it can't be changed during approval period because there can be an active dispute in the old arbitrator contract
+    /// @notice Changes the time allocated for submission.
+    /// @dev It cannot be changed during approval period because there can be an active dispute in the old arbitrator contract
     /// and prolonging submission timeout might switch it back to submission period.
     /// @param _submissionTimeout The new duration of the submission period, in seconds.
     function changeSubmissionTimeout(uint256 _submissionTimeout) external onlyByOwner duringSubmissionPeriod {
         submissionTimeout = _submissionTimeout;
     }
 
-    /// @dev Changes the time allocated for list's execution.
+    /// @notice Changes the time allocated for list's execution.
     /// @param _executionTimeout The new duration of the execution timeout, in seconds.
     function changeExecutionTimeout(uint256 _executionTimeout) external onlyByOwner {
         executionTimeout = _executionTimeout;
     }
 
-    /// @dev Changes list withdrawal timeout. Note that withdrawals are only possible in the first half of the submission period.
+    /// @notice Changes list withdrawal timeout. Note that withdrawals are only possible in the first half of the submission period.
     /// @param _withdrawTimeout The new duration of withdraw period, in seconds.
     function changeWithdrawTimeout(uint256 _withdrawTimeout) external onlyByOwner {
         withdrawTimeout = _withdrawTimeout;
     }
 
-    /// @dev Changes the arbitrator of the contract. Note that it can't be changed during approval period because there can be an active dispute in the old arbitrator contract.
+    /// @notice Changes the arbitrator of the contract.
+    /// @dev It cannot be changed during approval period because there can be an active dispute in the old arbitrator contract.
     /// @param _arbitrator The new trusted arbitrator.
     /// @param _arbitratorExtraData The extra data used by the new arbitrator.
     function changeArbitrator(
@@ -181,7 +184,7 @@ contract KlerosGovernor is IArbitrableV2 {
         arbitratorExtraData = _arbitratorExtraData;
     }
 
-    /// @dev Update the dispute template data.
+    /// @notice Update the dispute template data.
     /// @param _templateData The new dispute template data.
     /// @param _templateDataMappings The new dispute template data mappings.
     function changeDisputeTemplate(
@@ -195,7 +198,7 @@ contract KlerosGovernor is IArbitrableV2 {
     // *         State Modifiers           * //
     // ************************************* //
 
-    /// @dev Creates transaction list based on input parameters and submits it for potential approval and execution.
+    /// @notice Creates transaction list based on input parameters and submits it for potential approval and execution.
     /// @param _target List of addresses to call.
     /// @param _value List of values required for respective addresses.
     /// @param _data Concatenated calldata of all transactions of this list.
@@ -249,8 +252,8 @@ contract KlerosGovernor is IArbitrableV2 {
         reservedETH += submission.deposit;
     }
 
-    /// @dev Withdraws submitted transaction list. Reimburses submission deposit.
-    /// Withdrawal is only possible during the first half of the submission period and during withdrawTimeout after the submission is made.
+    /// @notice Withdraws submitted transaction list. Reimburses submission deposit.
+    /// @dev Withdrawal is only possible during the first half of the submission period and during withdrawTimeout after the submission is made.
     /// @param _submissionID Submission's index in the array of submitted lists of the current sesssion.
     /// @param _listHash Hash of a withdrawing list.
     function withdrawTransactionList(uint256 _submissionID, bytes32 _listHash) external {
@@ -269,8 +272,8 @@ contract KlerosGovernor is IArbitrableV2 {
         payable(msg.sender).transfer(submission.deposit);
     }
 
-    /// @dev Approves a transaction list or creates a dispute if more than one list was submitted.
-    /// If nothing was submitted changes session.
+    /// @notice Approves a transaction list or creates a dispute if more than one list was submitted.
+    /// @dev If nothing was submitted changes session.
     function executeSubmissions() external duringApprovalPeriod {
         Session storage session = sessions[sessions.length - 1];
         if (session.status != Status.NoDispute) revert AlreadyDisputed();
@@ -304,7 +307,8 @@ contract KlerosGovernor is IArbitrableV2 {
         }
     }
 
-    /// @dev Gives a ruling for a dispute. Must be called by the arbitrator.
+    /// @notice Gives a ruling for a dispute.
+    /// @dev Must be called by the arbitrator.
     /// @param _disputeID ID of the dispute in the Arbitrator contract.
     /// @param _ruling Ruling given by the arbitrator. Note that 0 is reserved for "Refuse to arbitrate".
     /// Note If the final ruling is "0" nothing is approved and deposits will stay locked in the contract.
@@ -332,7 +336,7 @@ contract KlerosGovernor is IArbitrableV2 {
         emit Ruling(IArbitratorV2(msg.sender), _disputeID, _ruling);
     }
 
-    /// @dev Executes selected transactions of the list.
+    /// @notice Executes selected transactions of the list.
     /// @param _listID The index of the transaction list in the array of lists.
     /// @param _cursor Index of the transaction from which to start executing.
     /// @param _count Number of transactions to execute. Executes until the end if set to "0" or number higher than number of transactions in the list.
@@ -354,16 +358,16 @@ contract KlerosGovernor is IArbitrableV2 {
         }
     }
 
-    /// @dev Receive function to receive funds for the execution of transactions.
+    /// @notice Receive function to receive funds for the execution of transactions.
     receive() external payable {}
 
-    /// @dev Gets the sum of contract funds that are used for the execution of transactions.
+    /// @notice Gets the sum of contract funds that are used for the execution of transactions.
     /// @return Contract balance without reserved ETH.
     function getExpendableFunds() public view returns (uint256) {
         return address(this).balance - reservedETH;
     }
 
-    /// @dev Gets the info of the specific transaction in the specific list.
+    /// @notice Gets the info of the specific transaction in the specific list.
     /// @param _listID The index of the transaction list in the array of lists.
     /// @param _transactionIndex The index of the transaction.
     /// @return target The target of the transaction.
@@ -379,8 +383,11 @@ contract KlerosGovernor is IArbitrableV2 {
         return (transaction.target, transaction.value, transaction.data, transaction.executed);
     }
 
-    /// @dev Gets the array of submitted lists in the session.
-    /// Note that this function is O(n), where n is the number of submissions in the session. This could exceed the gas limit, therefore this function should only be used for interface display and not by other contracts.
+    /// @notice Gets the array of submitted lists in the session.
+    ///
+    /// @dev This function is O(n), where `n` is the number of submissions in the session.
+    /// This could exceed the gas limit, therefore this function should only be used for interface display and not by other contracts.
+    ///
     /// @param _session The ID of the session.
     /// @return submittedLists Indexes of lists that were submitted during the session.
     function getSubmittedLists(uint256 _session) external view returns (uint256[] memory submittedLists) {
@@ -388,7 +395,7 @@ contract KlerosGovernor is IArbitrableV2 {
         submittedLists = session.submittedLists;
     }
 
-    /// @dev Gets the number of transactions in the list.
+    /// @notice Gets the number of transactions in the list.
     /// @param _listID The index of the transaction list in the array of lists.
     /// @return txCount The number of transactions in the list.
     function getNumberOfTransactions(uint256 _listID) external view returns (uint256 txCount) {
@@ -396,13 +403,13 @@ contract KlerosGovernor is IArbitrableV2 {
         return submission.txs.length;
     }
 
-    /// @dev Gets the number of lists created in contract's lifetime.
+    /// @notice Gets the number of lists created in contract's lifetime.
     /// @return The number of created lists.
     function getNumberOfCreatedLists() external view returns (uint256) {
         return submissions.length;
     }
 
-    /// @dev Gets the number of the ongoing session.
+    /// @notice Gets the number of the ongoing session.
     /// @return The number of the ongoing session.
     function getCurrentSessionNumber() external view returns (uint256) {
         return sessions.length - 1;
diff --git a/contracts/src/arbitration/PolicyRegistry.sol b/contracts/src/arbitration/PolicyRegistry.sol
index 9c8d09f3e..ac8e6f44c 100644
--- a/contracts/src/arbitration/PolicyRegistry.sol
+++ b/contracts/src/arbitration/PolicyRegistry.sol
@@ -5,7 +5,7 @@ import "../proxy/UUPSProxiable.sol";
 import "../proxy/Initializable.sol";
 
 /// @title PolicyRegistry
-/// @dev A contract to maintain a policy for each court.
+/// @notice A contract to maintain a policy for each court.
 contract PolicyRegistry is UUPSProxiable, Initializable {
     string public constant override version = "2.0.0";
 
@@ -13,7 +13,7 @@ contract PolicyRegistry is UUPSProxiable, Initializable {
     // *              Events               * //
     // ************************************* //
 
-    /// @dev Emitted when a policy is updated.
+    /// @notice Emitted when a policy is updated.
     /// @param _courtID The ID of the policy's court.
     /// @param _courtName The name of the policy's court.
     /// @param _policy The URI of the policy JSON.
@@ -30,7 +30,7 @@ contract PolicyRegistry is UUPSProxiable, Initializable {
     // *        Function Modifiers         * //
     // ************************************* //
 
-    /// @dev Requires that the sender is the owner.
+    /// @notice Requires that the sender is the owner.
     modifier onlyByOwner() {
         if (owner != msg.sender) revert OwnerOnly();
         _;
@@ -45,7 +45,7 @@ contract PolicyRegistry is UUPSProxiable, Initializable {
         _disableInitializers();
     }
 
-    /// @dev Constructs the `PolicyRegistry` contract.
+    /// @notice Constructs the `PolicyRegistry` contract.
     /// @param _owner The owner's address.
     function initialize(address _owner) external initializer {
         owner = _owner;
@@ -63,7 +63,7 @@ contract PolicyRegistry is UUPSProxiable, Initializable {
         // NOP
     }
 
-    /// @dev Changes the `owner` storage variable.
+    /// @notice Changes the `owner` storage variable.
     /// @param _owner The new value for the `owner` storage variable.
     function changeOwner(address _owner) external onlyByOwner {
         owner = _owner;
@@ -73,7 +73,7 @@ contract PolicyRegistry is UUPSProxiable, Initializable {
     // *         State Modifiers           * //
     // ************************************* //
 
-    /// @dev Sets the policy for the specified court.
+    /// @notice Sets the policy for the specified court.
     /// @param _courtID The ID of the specified court.
     /// @param _courtName The name of the specified court.
     /// @param _policy The URI of the policy JSON.
diff --git a/contracts/src/arbitration/SortitionModule.sol b/contracts/src/arbitration/SortitionModule.sol
index 16112ed07..e46753f0a 100644
--- a/contracts/src/arbitration/SortitionModule.sol
+++ b/contracts/src/arbitration/SortitionModule.sol
@@ -12,7 +12,7 @@ import {IRNG} from "../rng/IRNG.sol";
 import "../libraries/Constants.sol";
 
 /// @title SortitionModule
-/// @dev A factory of trees that keeps track of staked values for sortition.
+/// @notice A factory of trees that keeps track of staked values for sortition.
 contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
     using SortitionTrees for SortitionTrees.Tree;
     using SortitionTrees for mapping(TreeKey key => SortitionTrees.Tree);
@@ -80,12 +80,12 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
     /// @param _unlock Whether the stake is locked or unlocked.
     event StakeLocked(address indexed _address, uint256 _relativeAmount, bool _unlock);
 
-    /// @dev Emitted when leftover PNK is available.
+    /// @notice Emitted when leftover PNK is available.
     /// @param _account The account of the juror.
     /// @param _amount The amount of PNK available.
     event LeftoverPNK(address indexed _account, uint256 _amount);
 
-    /// @dev Emitted when leftover PNK is withdrawn.
+    /// @notice Emitted when leftover PNK is withdrawn.
     /// @param _account The account of the juror withdrawing PNK.
     /// @param _amount The amount of PNK withdrawn.
     event LeftoverPNKWithdrawn(address indexed _account, uint256 _amount);
@@ -99,7 +99,7 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
         _disableInitializers();
     }
 
-    /// @dev Initializer (constructor equivalent for upgradable contracts).
+    /// @notice Initializer (constructor equivalent for upgradable contracts).
     /// @param _owner The owner.
     /// @param _core The KlerosCore.
     /// @param _minStakingTime Minimal time to stake
@@ -151,25 +151,25 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
         // NOP
     }
 
-    /// @dev Changes the owner of the contract.
+    /// @notice Changes the owner of the contract.
     /// @param _owner The new owner.
     function changeOwner(address _owner) external onlyByOwner {
         owner = _owner;
     }
 
-    /// @dev Changes the `minStakingTime` storage variable.
+    /// @notice Changes the `minStakingTime` storage variable.
     /// @param _minStakingTime The new value for the `minStakingTime` storage variable.
     function changeMinStakingTime(uint256 _minStakingTime) external onlyByOwner {
         minStakingTime = _minStakingTime;
     }
 
-    /// @dev Changes the `maxDrawingTime` storage variable.
+    /// @notice Changes the `maxDrawingTime` storage variable.
     /// @param _maxDrawingTime The new value for the `maxDrawingTime` storage variable.
     function changeMaxDrawingTime(uint256 _maxDrawingTime) external onlyByOwner {
         maxDrawingTime = _maxDrawingTime;
     }
 
-    /// @dev Changes the `rng` storage variable.
+    /// @notice Changes the `rng` storage variable.
     /// @param _rng The new random number generator.
     function changeRandomNumberGenerator(IRNG _rng) external onlyByOwner {
         rng = _rng;
@@ -178,13 +178,13 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
         }
     }
 
-    /// @dev Changes the `maxStakePerJuror` storage variable.
+    /// @notice Changes the `maxStakePerJuror` storage variable.
     /// @param _maxStakePerJuror The new `maxStakePerJuror` storage variable.
     function changeMaxStakePerJuror(uint256 _maxStakePerJuror) external onlyByOwner {
         maxStakePerJuror = _maxStakePerJuror;
     }
 
-    /// @dev Changes the `maxTotalStaked` storage variable.
+    /// @notice Changes the `maxTotalStaked` storage variable.
     /// @param _maxTotalStaked The new `maxTotalStaked` storage variable.
     function changeMaxTotalStaked(uint256 _maxTotalStaked) external onlyByOwner {
         maxTotalStaked = _maxTotalStaked;
@@ -514,7 +514,7 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
     // *            Internal               * //
     // ************************************* //
 
-    /// @dev Get the stake of a juror in a court.
+    /// @notice Get the stake of a juror in a court.
     /// @param _juror The address of the juror.
     /// @param _courtID The ID of the court.
     /// @return value The stake of the juror in the court.
@@ -524,7 +524,7 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
         return sortitionSumTrees[key].stakeOf(stakePathID);
     }
 
-    /// @dev Converts sortition extradata into K value of sortition tree.
+    /// @notice Converts sortition extradata into K value of sortition tree.
     /// @param _extraData Sortition extra data.
     /// @return K The value of K.
     function _extraDataToTreeK(bytes memory _extraData) internal pure returns (uint256 K) {
diff --git a/contracts/src/arbitration/arbitrables/ArbitrableExample.sol b/contracts/src/arbitration/arbitrables/ArbitrableExample.sol
index dbd5692b5..c0f052202 100644
--- a/contracts/src/arbitration/arbitrables/ArbitrableExample.sol
+++ b/contracts/src/arbitration/arbitrables/ArbitrableExample.sol
@@ -7,7 +7,7 @@ import "../interfaces/IDisputeTemplateRegistry.sol";
 import "../../libraries/SafeERC20.sol";
 
 /// @title ArbitrableExample
-/// An example of an arbitrable contract which connects to the arbitator that implements the updated interface.
+/// @notice An example of an arbitrable contract which connects to the arbitator that implements the updated interface.
 contract ArbitrableExample is IArbitrableV2 {
     using SafeERC20 for IERC20;
 
@@ -21,8 +21,16 @@ contract ArbitrableExample is IArbitrableV2 {
         uint256 numberOfRulingOptions; // The number of choices the arbitrator can give.
     }
 
+    // ************************************* //
+    // *              Events               * //
+    // ************************************* //
+
     event Action(string indexed _action);
 
+    // ************************************* //
+    // *             Storage               * //
+    // ************************************* //
+
     address public immutable owner;
     IArbitratorV2 public arbitrator; // Arbitrator is set in constructor.
     IDisputeTemplateRegistry public templateRegistry; // The dispute template registry.
@@ -45,7 +53,7 @@ contract ArbitrableExample is IArbitrableV2 {
     // *            Constructor            * //
     // ************************************* //
 
-    /// @dev Constructor
+    /// @notice Constructor
     /// @param _arbitrator The arbitrator to rule on created disputes.
     /// @param _templateData The dispute template data.
     /// @param _templateDataMappings The dispute template data mappings.
@@ -96,8 +104,8 @@ contract ArbitrableExample is IArbitrableV2 {
     // *         State Modifiers           * //
     // ************************************* //
 
-    /// @dev Calls createDispute function of the specified arbitrator to create a dispute.
-    /// Note that we don’t need to check that msg.value is enough to pay arbitration fees as it’s the responsibility of the arbitrator contract.
+    /// @notice Calls createDispute function of the specified arbitrator to create a dispute.
+    /// @dev No need to check that msg.value is enough to pay arbitration fees as it’s the responsibility of the arbitrator contract.
     /// @param _action The action that requires arbitration.
     /// @return disputeID Dispute id (on arbitrator side) of the dispute created.
     function createDispute(string calldata _action) external payable returns (uint256 disputeID) {
@@ -114,8 +122,8 @@ contract ArbitrableExample is IArbitrableV2 {
         emit DisputeRequest(arbitrator, disputeID, externalDisputeID, templateId);
     }
 
-    /// @dev Calls createDispute function of the specified arbitrator to create a dispute.
-    /// Note that we don’t need to check that msg.value is enough to pay arbitration fees as it’s the responsibility of the arbitrator contract.
+    /// @notice Calls createDispute function of the specified arbitrator to create a dispute.
+    /// @dev No need to check that msg.value is enough to pay arbitration fees as it’s the responsibility of the arbitrator contract.
     /// @param _action The action that requires arbitration.
     /// @param _feeInWeth Amount of fees in WETH for the arbitrator.
     /// @return disputeID Dispute id (on arbitrator side) of the dispute created.
@@ -136,9 +144,7 @@ contract ArbitrableExample is IArbitrableV2 {
         emit DisputeRequest(arbitrator, disputeID, externalDisputeID, templateId);
     }
 
-    /// @dev To be called by the arbitrator of the dispute, to declare the winning ruling.
-    /// @param _arbitratorDisputeID ID of the dispute in arbitrator contract.
-    /// @param _ruling The ruling choice of the arbitration.
+    /// @inheritdoc IArbitrableV2
     function rule(uint256 _arbitratorDisputeID, uint256 _ruling) external override {
         uint256 localDisputeID = externalIDtoLocalID[_arbitratorDisputeID];
         DisputeStruct storage dispute = disputes[localDisputeID];
diff --git a/contracts/src/arbitration/arbitrables/DisputeResolver.sol b/contracts/src/arbitration/arbitrables/DisputeResolver.sol
index 3607966e1..64fef2ee6 100644
--- a/contracts/src/arbitration/arbitrables/DisputeResolver.sol
+++ b/contracts/src/arbitration/arbitrables/DisputeResolver.sol
@@ -6,7 +6,8 @@ import "../interfaces/IDisputeTemplateRegistry.sol";
 pragma solidity ^0.8.24;
 
 /// @title DisputeResolver
-/// DisputeResolver contract adapted for V2 from https://github.com/kleros/arbitrable-proxy-contracts/blob/master/contracts/ArbitrableProxy.sol.
+/// @notice DisputeResolver contract
+/// @dev Adapted for V2 from https://github.com/kleros/arbitrable-proxy-contracts/blob/master/contracts/ArbitrableProxy.sol.
 contract DisputeResolver is IArbitrableV2 {
     // ************************************* //
     // *         Enums / Structs           * //
@@ -33,7 +34,7 @@ contract DisputeResolver is IArbitrableV2 {
     // *            Constructor            * //
     // ************************************* //
 
-    /// @dev Constructor
+    /// @notice Constructor
     /// @param _arbitrator Target global arbitrator for any disputes.
     constructor(IArbitratorV2 _arbitrator, IDisputeTemplateRegistry _templateRegistry) {
         owner = msg.sender;
@@ -45,7 +46,7 @@ contract DisputeResolver is IArbitrableV2 {
     // *           Governance              * //
     // ************************************* //
 
-    /// @dev Changes the owner.
+    /// @notice Changes the owner.
     /// @param _owner The address of the new owner.
     function changeOwner(address _owner) external {
         if (owner != msg.sender) revert OwnerOnly();
@@ -66,8 +67,8 @@ contract DisputeResolver is IArbitrableV2 {
     // *         State Modifiers           * //
     // ************************************* //
 
-    /// @dev Calls createDispute function of the specified arbitrator to create a dispute.
-    /// Note that we don’t need to check that msg.value is enough to pay arbitration fees as it’s the responsibility of the arbitrator contract.
+    /// @notice Calls createDispute function of the specified arbitrator to create a dispute.
+    /// @dev No need to check that msg.value is enough to pay arbitration fees as it’s the responsibility of the arbitrator contract.
     /// @param _arbitratorExtraData Extra data for the arbitrator of the dispute.
     /// @param _disputeTemplate Dispute template.
     /// @param _disputeTemplateDataMappings The data mappings.
@@ -88,9 +89,7 @@ contract DisputeResolver is IArbitrableV2 {
             );
     }
 
-    /// @dev To be called by the arbitrator of the dispute, to declare the winning ruling.
-    /// @param _arbitratorDisputeID ID of the dispute in arbitrator contract.
-    /// @param _ruling The ruling choice of the arbitration.
+    /// @inheritdoc IArbitrableV2
     function rule(uint256 _arbitratorDisputeID, uint256 _ruling) external override {
         uint256 localDisputeID = arbitratorDisputeIDToLocalID[_arbitratorDisputeID];
         DisputeStruct storage dispute = disputes[localDisputeID];
diff --git a/contracts/src/arbitration/devtools/DisputeResolverRuler.sol b/contracts/src/arbitration/devtools/DisputeResolverRuler.sol
index cfb8e3e4c..3ca5607ea 100644
--- a/contracts/src/arbitration/devtools/DisputeResolverRuler.sol
+++ b/contracts/src/arbitration/devtools/DisputeResolverRuler.sol
@@ -9,14 +9,14 @@ interface IKlerosCoreRulerFragment {
 }
 
 /// @title DisputeResolverRuler
-/// It extends DisputeResolver for testing purposes of the automatic ruling modes.
-/// The arbitrator disputeID must be known before dispute creation, otherwise the dispute cannot be retrieved during the immediate call to rule().
+/// @notice Extension of the DisputeResolver for development tooling and testing of the automatic ruling modes.
+/// @dev The arbitrator disputeID must be known before dispute creation, otherwise the dispute cannot be retrieved during the immediate call to rule().
 contract DisputeResolverRuler is DisputeResolver {
     // ************************************* //
     // *            Constructor            * //
     // ************************************* //
 
-    /// @dev Constructor
+    /// @notice Constructor
     /// @param _arbitrator Target global arbitrator for any disputes.
     constructor(
         IArbitratorV2 _arbitrator,
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassic.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassic.sol
index dd2edbab8..95f551a48 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassic.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassic.sol
@@ -5,7 +5,7 @@ pragma solidity ^0.8.24;
 import {DisputeKitClassicBase, KlerosCore} from "./DisputeKitClassicBase.sol";
 
 /// @title DisputeKitClassic
-/// Dispute kit implementation of the Kleros v1 features including:
+/// @notice Dispute kit implementation of the Kleros v1 features including:
 /// - a drawing system: proportional to staked PNK,
 /// - a vote aggregation system: plurality,
 /// - an incentive system: equal split between coherent votes,
@@ -22,7 +22,7 @@ contract DisputeKitClassic is DisputeKitClassicBase {
         _disableInitializers();
     }
 
-    /// @dev Initializer.
+    /// @notice Initializer.
     /// @param _owner The owner's address.
     /// @param _core The KlerosCore arbitrator.
     /// @param _wNative The wrapped native token address, typically wETH.
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index e2a017750..912155986 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -9,7 +9,7 @@ import {SafeSend} from "../../libraries/SafeSend.sol";
 import {ONE_BASIS_POINT, DISPUTE_KIT_CLASSIC} from "../../libraries/Constants.sol";
 
 /// @title DisputeKitClassicBase
-/// Abstract Dispute kit classic implementation of the Kleros v1 features including:
+/// @notice Abstract Dispute kit classic implementation of the Kleros v1 features including:
 /// - a drawing system: proportional to staked PNK,
 /// - a vote aggregation system: plurality,
 /// - an incentive system: equal split between coherent votes,
@@ -77,20 +77,20 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     // *              Events               * //
     // ************************************* //
 
-    /// @dev To be emitted when a dispute is created.
+    /// @notice To be emitted when a dispute is created.
     /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.
     /// @param _numberOfChoices The number of choices available in the dispute.
     /// @param _extraData The extra data for the dispute.
     event DisputeCreation(uint256 indexed _coreDisputeID, uint256 _numberOfChoices, bytes _extraData);
 
-    /// @dev To be emitted when a vote commitment is cast.
+    /// @notice To be emitted when a vote commitment is cast.
     /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.
     /// @param _juror The address of the juror casting the vote commitment.
     /// @param _voteIDs The identifiers of the votes in the dispute.
     /// @param _commit The commitment of the juror.
     event CommitCast(uint256 indexed _coreDisputeID, address indexed _juror, uint256[] _voteIDs, bytes32 _commit);
 
-    /// @dev To be emitted when a funding contribution is made.
+    /// @notice To be emitted when a funding contribution is made.
     /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.
     /// @param _coreRoundID The identifier of the round in the Arbitrator contract.
     /// @param _choice The choice that is being funded.
@@ -104,7 +104,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         uint256 _amount
     );
 
-    /// @dev To be emitted when the contributed funds are withdrawn.
+    /// @notice To be emitted when the contributed funds are withdrawn.
     /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.
     /// @param _coreRoundID The identifier of the round in the Arbitrator contract.
     /// @param _choice The choice that is being funded.
@@ -118,7 +118,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         uint256 _amount
     );
 
-    /// @dev To be emitted when a choice is fully funded for an appeal.
+    /// @notice To be emitted when a choice is fully funded for an appeal.
     /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.
     /// @param _coreRoundID The identifier of the round in the Arbitrator contract.
     /// @param _choice The choice that is being funded.
@@ -147,7 +147,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     // *            Constructor            * //
     // ************************************* //
 
-    /// @dev Initializer.
+    /// @notice Initializer.
     /// @param _owner The owner's address.
     /// @param _core The KlerosCore arbitrator.
     /// @param _wNative The wrapped native token address, typically wETH.
@@ -168,7 +168,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     // *      Governance      * //
     // ************************ //
 
-    /// @dev Allows the owner to call anything on behalf of the contract.
+    /// @notice Allows the owner to call anything on behalf of the contract.
     /// @param _destination The destination of the call.
     /// @param _amount The value sent with the call.
     /// @param _data The data sent with the call.
@@ -177,19 +177,19 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         if (!success) revert UnsuccessfulCall();
     }
 
-    /// @dev Changes the `owner` storage variable.
+    /// @notice Changes the `owner` storage variable.
     /// @param _owner The new value for the `owner` storage variable.
     function changeOwner(address payable _owner) external onlyByOwner {
         owner = _owner;
     }
 
-    /// @dev Changes the `core` storage variable.
+    /// @notice Changes the `core` storage variable.
     /// @param _core The new value for the `core` storage variable.
     function changeCore(address _core) external onlyByOwner {
         core = KlerosCore(_core);
     }
 
-    /// @dev Changes the dispute kit ID used for the jump.
+    /// @notice Changes the dispute kit ID used for the jump.
     /// @param _jumpDisputeKitID The new value for the `jumpDisputeKitID` storage variable.
     function changeJumpDisputeKitID(uint256 _jumpDisputeKitID) external onlyByOwner {
         jumpDisputeKitID = _jumpDisputeKitID;
@@ -250,10 +250,11 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         }
     }
 
-    /// @dev Sets the caller's commit for the specified votes. It can be called multiple times during the
-    /// commit period, each call overrides the commits of the previous one.
-    /// `O(n)` where
-    /// `n` is the number of votes.
+    /// @notice Sets the caller's commit for the specified votes.
+    ///
+    /// @dev It can be called multiple times during the commit period, each call overrides the commits of the previous one.
+    /// `O(n)` where `n` is the number of votes.
+    ///
     /// @param _coreDisputeID The ID of the dispute in Kleros Core.
     /// @param _voteIDs The IDs of the votes.
     /// @param _commit The commitment hash.
@@ -281,9 +282,10 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         emit CommitCast(_coreDisputeID, msg.sender, _voteIDs, _commit);
     }
 
-    /// @dev Sets the caller's choices for the specified votes.
-    /// `O(n)` where
-    /// `n` is the number of votes.
+    /// @notice Sets the caller's choices for the specified votes.
+    ///
+    /// @dev `O(n)` where `n` is the number of votes.
+    ///
     /// @param _coreDisputeID The ID of the dispute in Kleros Core.
     /// @param _voteIDs The IDs of the votes.
     /// @param _choice The choice.
@@ -353,7 +355,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         emit VoteCast(_coreDisputeID, _juror, _voteIDs, _choice, _justification);
     }
 
-    /// @dev Manages contributions, and appeals a dispute if at least two choices are fully funded.
+    /// @notice Manages contributions, and appeals a dispute if at least two choices are fully funded.
     /// Note that the surplus deposit will be reimbursed.
     /// @param _coreDisputeID Index of the dispute in Kleros Core.
     /// @param _choice A choice that receives funding.
@@ -424,8 +426,8 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         if (msg.value > contribution) payable(msg.sender).safeSend(msg.value - contribution, wNative);
     }
 
-    /// @dev Allows those contributors who attempted to fund an appeal round to withdraw any reimbursable fees or rewards after the dispute gets resolved.
-    /// Note that withdrawals are not possible if the core contract is paused.
+    /// @notice Allows those contributors who attempted to fund an appeal round to withdraw any reimbursable fees or rewards after the dispute gets resolved.
+    /// @dev Withdrawals are not possible if the core contract is paused.
     /// @param _coreDisputeID Index of the dispute in Kleros Core contract.
     /// @param _beneficiary The address whose rewards to withdraw.
     /// @param _coreRoundID The round in the Kleros Core contract the caller wants to withdraw from.
@@ -475,7 +477,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     // *           Public Views            * //
     // ************************************* //
 
-    /// @dev Computes the hash of a vote using ABI encoding
+    /// @notice Computes the hash of a vote using ABI encoding
     /// @dev The unused parameters may be used by overriding contracts.
     /// @param _choice The choice being voted for
     /// @param _salt A random salt for commitment
@@ -488,7 +490,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         return keccak256(abi.encodePacked(_choice, _salt));
     }
 
-    /// @dev Returns the rulings that were fully funded in the latest appeal round.
+    /// @notice Returns the rulings that were fully funded in the latest appeal round.
     /// @param _coreDisputeID The ID of the dispute in Kleros Core.
     /// @return fundedChoices Fully funded rulings.
     function getFundedChoices(uint256 _coreDisputeID) public view returns (uint256[] memory fundedChoices) {
@@ -662,14 +664,14 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         );
     }
 
-    /// @dev Returns the number of rounds in a dispute.
+    /// @notice Returns the number of rounds in a dispute.
     /// @param _localDisputeID The ID of the dispute in the Dispute Kit.
     /// @return The number of rounds in the dispute.
     function getNumberOfRounds(uint256 _localDisputeID) external view returns (uint256) {
         return disputes[_localDisputeID].rounds.length;
     }
 
-    /// @dev Returns the local dispute ID and round ID for a given core dispute ID and core round ID.
+    /// @notice Returns the local dispute ID and round ID for a given core dispute ID and core round ID.
     /// @param _coreDisputeID The ID of the dispute in Kleros Core.
     /// @param _coreRoundID The ID of the round in Kleros Core.
     /// @return localDisputeID The ID of the dispute in the Dispute Kit.
@@ -697,7 +699,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     // *            Internal               * //
     // ************************************* //
 
-    /// @dev Returns the expected vote hash for a given vote.
+    /// @notice Returns the expected vote hash for a given vote.
     /// @param _localDisputeID The ID of the dispute in the Dispute Kit.
     /// @param _localRoundID The ID of the round in the Dispute Kit.
     /// @param _voteID The ID of the vote.
@@ -710,11 +712,13 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         return disputes[_localDisputeID].rounds[_localRoundID].votes[_voteID].commit;
     }
 
-    /// @dev Checks that the chosen address satisfies certain conditions for being drawn.
-    /// Note that we don't check the minStake requirement here because of the implicit staking in parent courts.
+    /// @notice Checks that the chosen address satisfies certain conditions for being drawn.
+    ///
+    /// @dev No need to check the minStake requirement here because of the implicit staking in parent courts.
     /// minStake is checked directly during staking process however it's possible for the juror to get drawn
     /// while having < minStake if it is later increased by governance.
     /// This issue is expected and harmless.
+    ///
     /// @param _coreDisputeID ID of the dispute in the core contract.
     /// @param _juror Chosen address.
     /// @return result Whether the address passes the check or not.
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol b/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol
index 8abfdecac..1cbf21df8 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol
@@ -5,7 +5,7 @@ pragma solidity ^0.8.24;
 import {DisputeKitClassicBase, KlerosCore} from "./DisputeKitClassicBase.sol";
 
 interface IBalanceHolder {
-    /// @dev Returns the number of tokens in `owner` account.
+    /// @notice Returns the number of tokens in `owner` account.
     /// @dev Compatible with ERC-20 and ERC-721.
     /// @param owner The address of the owner.
     /// @return balance The number of tokens in `owner` account.
@@ -13,7 +13,7 @@ interface IBalanceHolder {
 }
 
 interface IBalanceHolderERC1155 {
-    /// @dev Returns the balance of an ERC-1155 token.
+    /// @notice Returns the balance of an ERC-1155 token.
     /// @param account The address of the token holder
     /// @param id ID of the token
     /// @return The token balance
@@ -21,7 +21,7 @@ interface IBalanceHolderERC1155 {
 }
 
 /// @title DisputeKitGated
-/// Dispute kit implementation adapted from DisputeKitClassic
+/// @notice Dispute kit implementation adapted from DisputeKitClassic
 /// - a drawing system: proportional to staked PNK with a non-zero balance of `tokenGate` where `tokenGate` is an ERC20, ERC721 or ERC1155
 /// - a vote aggregation system: plurality,
 /// - an incentive system: equal split between coherent votes,
@@ -38,7 +38,7 @@ contract DisputeKitGated is DisputeKitClassicBase {
         _disableInitializers();
     }
 
-    /// @dev Initializer.
+    /// @notice Initializer.
     /// @param _owner The owner's address.
     /// @param _core The KlerosCore arbitrator.
     /// @param _wNative The wrapped native token address, typically wETH.
@@ -66,13 +66,13 @@ contract DisputeKitGated is DisputeKitClassicBase {
     // *            Internal               * //
     // ************************************* //
 
-    /// @dev Extracts token gating information from the extra data.
+    /// @notice Extracts token gating information from the extra data.
     /// @param _extraData The extra data bytes array with the following encoding:
-    ///        - bytes 0-31: uint96 courtID, not used here
-    ///        - bytes 32-63: uint256 minJurors, not used here
-    ///        - bytes 64-95: uint256 disputeKitID, not used here
-    ///        - bytes 96-127: uint256 packedTokenGateAndFlag (address tokenGate in bits 0-159, bool isERC1155 in bit 160)
-    ///        - bytes 128-159: uint256 tokenId
+    /// - bytes 0-31: uint96 courtID, not used here
+    /// - bytes 32-63: uint256 minJurors, not used here
+    /// - bytes 64-95: uint256 disputeKitID, not used here
+    /// - bytes 96-127: uint256 packedTokenGateAndFlag (address tokenGate in bits 0-159, bool isERC1155 in bit 160)
+    /// - bytes 128-159: uint256 tokenId
     /// @return tokenGate The address of the token contract used for gating access.
     /// @return isERC1155 True if the token is an ERC-1155, false for ERC-20/ERC-721.
     /// @return tokenId The token ID for ERC-1155 tokens (ignored for ERC-20/ERC-721).
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
index 54e1c93b7..b408e27a4 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
@@ -5,7 +5,7 @@ pragma solidity ^0.8.24;
 import {DisputeKitClassicBase, KlerosCore} from "./DisputeKitClassicBase.sol";
 
 interface IBalanceHolder {
-    /// @dev Returns the number of tokens in `owner` account.
+    /// @notice Returns the number of tokens in `owner` account.
     /// @dev Compatible with ERC-20 and ERC-721.
     /// @param owner The address of the owner.
     /// @return balance The number of tokens in `owner` account.
@@ -13,7 +13,7 @@ interface IBalanceHolder {
 }
 
 interface IBalanceHolderERC1155 {
-    /// @dev Returns the balance of an ERC-1155 token.
+    /// @notice Returns the balance of an ERC-1155 token.
     /// @param account The address of the token holder
     /// @param id ID of the token
     /// @return The token balance
@@ -21,7 +21,7 @@ interface IBalanceHolderERC1155 {
 }
 
 /// @title DisputeKitGatedShutter
-/// Added functionality: shielded voting.
+/// @notice Added functionality: shielded voting.
 /// Dispute kit implementation adapted from DisputeKitClassic
 /// - a drawing system: proportional to staked PNK with a non-zero balance of `tokenGate` where `tokenGate` is an ERC20, ERC721 or ERC1155
 /// - a vote aggregation system: plurality,
@@ -72,7 +72,7 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
         _disableInitializers();
     }
 
-    /// @dev Initializer.
+    /// @notice Initializer.
     /// @param _owner The owner's address.
     /// @param _core The KlerosCore arbitrator.
     /// @param _wNative The wrapped native token address, typically wETH.
@@ -100,10 +100,11 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
     // *         State Modifiers           * //
     // ************************************* //
 
-    /// @dev Sets the caller's commit for the specified votes. It can be called multiple times during the
-    /// commit period, each call overrides the commits of the previous one.
-    /// `O(n)` where
-    /// `n` is the number of votes.
+    /// @notice Sets the caller's commit for the specified votes.
+    ///
+    /// @dev It can be called multiple times during the commit period, each call overrides the commits of the previous one.
+    /// `O(n)` where `n` is the number of votes.
+    ///
     /// @param _coreDisputeID The ID of the dispute in Kleros Core.
     /// @param _voteIDs The IDs of the votes.
     /// @param _commit The commitment hash including the justification.
@@ -132,9 +133,8 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
         emit CommitCastShutter(_coreDisputeID, msg.sender, _commit, _recoveryCommit, _identity, _encryptedVote);
     }
 
-    /// @dev Version of `castVote` function designed specifically for Shutter.
-    /// `O(n)` where
-    /// `n` is the number of votes.
+    /// @notice Version of the `castVote` function designed specifically for Shutter.
+    /// @dev `O(n)` where `n` is the number of votes.
     /// @param _coreDisputeID The ID of the dispute in Kleros Core.
     /// @param _voteIDs The IDs of the votes.
     /// @param _choice The choice.
@@ -162,7 +162,7 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
     // *           Public Views            * //
     // ************************************* //
 
-    /// @dev Computes the hash of a vote using ABI encoding
+    /// @notice Computes the hash of a vote using ABI encoding
     /// @param _choice The choice being voted for
     /// @param _salt A random salt for commitment
     /// @param _justification The justification for the vote
@@ -199,13 +199,13 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
         }
     }
 
-    /// @dev Extracts token gating information from the extra data.
+    /// @notice Extracts token gating information from the extra data.
     /// @param _extraData The extra data bytes array with the following encoding:
-    ///        - bytes 0-31: uint96 courtID, not used here
-    ///        - bytes 32-63: uint256 minJurors, not used here
-    ///        - bytes 64-95: uint256 disputeKitID, not used here
-    ///        - bytes 96-127: uint256 packedTokenGateAndFlag (address tokenGate in bits 0-159, bool isERC1155 in bit 160)
-    ///        - bytes 128-159: uint256 tokenId
+    /// - bytes 0-31: uint96 courtID, not used here
+    /// - bytes 32-63: uint256 minJurors, not used here
+    /// - bytes 64-95: uint256 disputeKitID, not used here
+    /// - bytes 96-127: uint256 packedTokenGateAndFlag (address tokenGate in bits 0-159, bool isERC1155 in bit 160)
+    /// - bytes 128-159: uint256 tokenId
     /// @return tokenGate The address of the token contract used for gating access.
     /// @return isERC1155 True if the token is an ERC-1155, false for ERC-20/ERC-721.
     /// @return tokenId The token ID for ERC-1155 tokens (ignored for ERC-20/ERC-721).
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol b/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
index abb1feed9..0ea8bdb41 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
@@ -5,7 +5,7 @@ pragma solidity ^0.8.28;
 import {DisputeKitClassicBase, KlerosCore} from "./DisputeKitClassicBase.sol";
 
 /// @title DisputeKitShutter
-/// Added functionality: shielded voting.
+/// @notice Added functionality: shielded voting.
 /// Dispute kit implementation of the Kleros v1 features including:
 /// - a drawing system: proportional to staked PNK,
 /// - a vote aggregation system: plurality,
@@ -31,7 +31,7 @@ contract DisputeKitShutter is DisputeKitClassicBase {
     // *              Events               * //
     // ************************************* //
 
-    /// @dev Emitted when a vote is cast.
+    /// @notice Emitted when a vote is cast.
     /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.
     /// @param _juror The address of the juror casting the vote commitment.
     /// @param _commit The commitment hash.
@@ -56,7 +56,7 @@ contract DisputeKitShutter is DisputeKitClassicBase {
         _disableInitializers();
     }
 
-    /// @dev Initializer.
+    /// @notice Initializer.
     /// @param _owner The owner's address.
     /// @param _core The KlerosCore arbitrator.
     /// @param _wNative The wrapped native token address, typically wETH.
@@ -84,10 +84,11 @@ contract DisputeKitShutter is DisputeKitClassicBase {
     // *         State Modifiers           * //
     // ************************************* //
 
-    /// @dev Sets the caller's commit for the specified votes. It can be called multiple times during the
-    /// commit period, each call overrides the commits of the previous one.
-    /// `O(n)` where
-    /// `n` is the number of votes.
+    /// @notice Sets the caller's commit for the specified votes.
+    ///
+    /// @dev It can be called multiple times during the commit period, each call overrides the commits of the previous one.
+    /// `O(n)` where `n` is the number of votes.
+    ///
     /// @param _coreDisputeID The ID of the dispute in Kleros Core.
     /// @param _voteIDs The IDs of the votes.
     /// @param _commit The commitment hash including the justification.
@@ -116,9 +117,8 @@ contract DisputeKitShutter is DisputeKitClassicBase {
         emit CommitCastShutter(_coreDisputeID, msg.sender, _commit, _recoveryCommit, _identity, _encryptedVote);
     }
 
-    /// @dev Version of `castVote` function designed specifically for Shutter.
-    /// `O(n)` where
-    /// `n` is the number of votes.
+    /// @notice Version of `castVote` function designed specifically for Shutter.
+    /// @dev `O(n)` where `n` is the number of votes.
     /// @param _coreDisputeID The ID of the dispute in Kleros Core.
     /// @param _voteIDs The IDs of the votes.
     /// @param _choice The choice.
@@ -146,7 +146,7 @@ contract DisputeKitShutter is DisputeKitClassicBase {
     // *           Public Views            * //
     // ************************************* //
 
-    /// @dev Computes the hash of a vote using ABI encoding
+    /// @notice Computes the hash of a vote using ABI encoding
     /// @param _choice The choice being voted for
     /// @param _salt A random salt for commitment
     /// @param _justification The justification for the vote
@@ -170,7 +170,7 @@ contract DisputeKitShutter is DisputeKitClassicBase {
     // *            Internal               * //
     // ************************************* //
 
-    /// @dev Returns the expected vote hash for a given vote.
+    /// @notice Returns the expected vote hash for a given vote.
     /// @param _localDisputeID The ID of the dispute in the Dispute Kit.
     /// @param _localRoundID The ID of the round in the Dispute Kit.
     /// @param _voteID The ID of the vote.
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitSybilResistant.sol b/contracts/src/arbitration/dispute-kits/DisputeKitSybilResistant.sol
index 10cc67c5c..983fb63df 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitSybilResistant.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitSybilResistant.sol
@@ -5,14 +5,14 @@ pragma solidity ^0.8.24;
 import {DisputeKitClassicBase, KlerosCore} from "./DisputeKitClassicBase.sol";
 
 interface IProofOfHumanity {
-    /// @dev Return true if the submission is registered and not expired.
+    /// @notice Return true if the submission is registered and not expired.
     /// @param _submissionID The address of the submission.
     /// @return Whether the submission is registered or not.
     function isRegistered(address _submissionID) external view returns (bool);
 }
 
 /// @title DisputeKitSybilResistant
-/// Dispute kit implementation adapted from DisputeKitClassic
+/// @notice Dispute kit implementation adapted from DisputeKitClassic
 /// - a drawing system: at most 1 vote per juror registered on Proof of Humanity,
 /// - a vote aggregation system: plurality,
 /// - an incentive system: equal split between coherent votes,
@@ -35,7 +35,7 @@ contract DisputeKitSybilResistant is DisputeKitClassicBase {
         _disableInitializers();
     }
 
-    /// @dev Initializer.
+    /// @notice Initializer.
     /// @param _owner The owner's address.
     /// @param _core The KlerosCore arbitrator.
     /// @param _poh The Proof of Humanity registry.
diff --git a/contracts/src/arbitration/evidence/EvidenceModule.sol b/contracts/src/arbitration/evidence/EvidenceModule.sol
index 8321e55ba..e29e3a6ac 100644
--- a/contracts/src/arbitration/evidence/EvidenceModule.sol
+++ b/contracts/src/arbitration/evidence/EvidenceModule.sol
@@ -35,7 +35,7 @@ contract EvidenceModule is IEvidence, Initializable, UUPSProxiable {
         _disableInitializers();
     }
 
-    /// @dev Initializer.
+    /// @notice Initializer.
     /// @param _owner The owner's address.
     function initialize(address _owner) external initializer {
         owner = _owner;
@@ -57,9 +57,9 @@ contract EvidenceModule is IEvidence, Initializable, UUPSProxiable {
     // *        Function Modifiers         * //
     // ************************************* //
 
-    /// @dev Submits evidence for a dispute.
-    /// @param _externalDisputeID Unique identifier for this dispute outside Kleros. It's the submitter responsability to submit the right evidence group ID.
-    /// @param _evidence Stringified evidence object, example: '{"name" : "Justification", "description" : "Description", "fileURI" : "/ipfs/QmWQV5ZFFhEJiW8Lm7ay2zLxC2XS4wx1b2W7FfdrLMyQQc"}'.
+    /// @notice Submits evidence for a dispute.
+    /// @param _externalDisputeID Unique identifier for this dispute outside Kleros. It's the submitter responsibility to submit the right evidence group ID.
+    /// @param _evidence Stringified evidence object, example: `{"name" : "Justification", "description" : "Description", "fileURI" : "/ipfs/QmWQV5ZFFhEJiW8Lm7ay2zLxC2XS4wx1b2W7FfdrLMyQQc"}`.
     function submitEvidence(uint256 _externalDisputeID, string calldata _evidence) external {
         emit Evidence(_externalDisputeID, msg.sender, _evidence);
     }
diff --git a/contracts/src/arbitration/evidence/ModeratedEvidenceModule.sol b/contracts/src/arbitration/evidence/ModeratedEvidenceModule.sol
index 90947a5b3..2ffd0b30b 100644
--- a/contracts/src/arbitration/evidence/ModeratedEvidenceModule.sol
+++ b/contracts/src/arbitration/evidence/ModeratedEvidenceModule.sol
@@ -70,9 +70,9 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
     // *              Events               * //
     // ************************************* //
 
-    /// @dev To be raised when a moderated evidence is submitted. Should point to the resource (evidences are not to be stored on chain due to gas considerations).
+    /// @notice To be raised when a moderated evidence is submitted. Should point to the resource (evidences are not to be stored on chain due to gas considerations).
     /// @param _arbitrator The arbitrator of the contract.
-    /// @param _externalDisputeID Unique identifier for this dispute outside Kleros. It's the submitter responsability to submit the right evidence group ID.
+    /// @param _externalDisputeID Unique identifier for this dispute outside Kleros. It's the submitter responsibility to submit the right evidence group ID.
     /// @param _party The address of the party submiting the evidence. Note that 0x0 refers to evidence not submitted by any party.
     /// @param _evidence Stringified evidence object, example: '{"name" : "Justification", "description" : "Description", "fileURI" : "/ipfs/QmWQV5ZFFhEJiW8Lm7ay2zLxC2XS4wx1b2W7FfdrLMyQQc"}'.
     event ModeratedEvidence(
@@ -82,7 +82,7 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
         string _evidence
     );
 
-    /// @dev Indicate that a party has to pay a fee or would otherwise be considered as losing.
+    /// @notice Indicate that a party has to pay a fee or would otherwise be considered as losing.
     /// @param _evidenceID The ID of the evidence being moderated.
     /// @param _currentWinner The party who is currently winning.
     event ModerationStatusChanged(bytes32 indexed _evidenceID, Party _currentWinner);
@@ -91,7 +91,7 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
     // *            Constructor            * //
     // ************************************* //
 
-    /// @dev Constructor.
+    /// @notice Constructor.
     /// @param _arbitrator The trusted arbitrator to resolve potential disputes.
     /// @param _owner The trusted owner of the contract.
     /// @param _totalCostMultiplier Multiplier of arbitration fees that must be ultimately paid as fee stake. In basis points.
@@ -132,32 +132,32 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
     // *             Governance            * //
     // ************************************* //
 
-    /// @dev Change the owner of the contract.
+    /// @notice Change the owner of the contract.
     /// @param _owner The address of the new owner.
     function changeOwner(address _owner) external onlyOwner {
         owner = _owner;
     }
 
-    /// @dev Change the proportion of arbitration fees that must be paid as fee stake by parties when there is no winner or loser (e.g. when the arbitrator refused to rule).
+    /// @notice Change the proportion of arbitration fees that must be paid as fee stake by parties when there is no winner or loser (e.g. when the arbitrator refused to rule).
     /// @param _initialDepositMultiplier Multiplier of arbitration fees that must be paid as fee stake. In basis points.
     function changeInitialDepositMultiplier(uint256 _initialDepositMultiplier) external onlyOwner {
         initialDepositMultiplier = _initialDepositMultiplier;
     }
 
-    /// @dev Change the proportion of arbitration fees that must be paid as fee stake by the winner of the previous round.
+    /// @notice Change the proportion of arbitration fees that must be paid as fee stake by the winner of the previous round.
     /// @param _totalCostMultiplier Multiplier of arbitration fees that must be paid as fee stake. In basis points.
     function changeTotalCostMultiplier(uint256 _totalCostMultiplier) external onlyOwner {
         totalCostMultiplier = _totalCostMultiplier;
     }
 
-    /// @dev Change the time window within which evidence submissions and removals can be contested.
+    /// @notice Change the time window within which evidence submissions and removals can be contested.
     /// Ongoing moderations will start using the latest bondTimeout available after calling moderate() again.
     /// @param _bondTimeout Multiplier of arbitration fees that must be paid as fee stake. In basis points.
     function changeBondTimeout(uint256 _bondTimeout) external onlyOwner {
         bondTimeout = _bondTimeout;
     }
 
-    /// @dev Update the dispute template data.
+    /// @notice Update the dispute template data.
     /// @param _templateData The new dispute template data.
     function changeDisputeTemplate(
         string calldata _templateData,
@@ -173,7 +173,7 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
         );
     }
 
-    /// @dev Change the arbitrator to be used for disputes that may be raised in the next requests. The arbitrator is trusted to support appeal period and not reenter.
+    /// @notice Change the arbitrator to be used for disputes that may be raised in the next requests. The arbitrator is trusted to support appeal period and not reenter.
     /// @param _arbitratorExtraData The extra data used by the new arbitrator.
     function changeArbitratorExtraData(bytes calldata _arbitratorExtraData) external onlyOwner {
         ArbitratorData storage arbitratorData = arbitratorDataList[arbitratorDataList.length - 1];
@@ -189,8 +189,8 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
     // *         State Modifiers           * //
     // ************************************* //
 
-    /// @dev Submits evidence.
-    /// @param _evidenceGroupID Unique identifier of the evidence group the evidence belongs to. It's the submitter responsability to submit the right evidence group ID.
+    /// @notice Submits evidence.
+    /// @param _evidenceGroupID Unique identifier of the evidence group the evidence belongs to. It's the submitter responsibility to submit the right evidence group ID.
     /// @param _evidence Stringified evidence object, example: '{"name" : "Justification", "description" : "Description", "fileURI" : "/ipfs/QmWQV5ZFFhEJiW8Lm7ay2zLxC2XS4wx1b2W7FfdrLMyQQc"}'.
     function submitEvidence(uint256 _evidenceGroupID, string calldata _evidence) external payable {
         // Optimization opportunity: map evidenceID to an incremental index that can be safely assumed to be less than a small uint.
@@ -217,7 +217,7 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
         emit ModeratedEvidence(arbitrator, _evidenceGroupID, msg.sender, _evidence);
     }
 
-    /// @dev Moderates an evidence submission. Requires the contester to at least double the accumulated stake of the oposing party.
+    /// @notice Moderates an evidence submission. Requires the contester to at least double the accumulated stake of the oposing party.
     /// Optimization opportunity: use `bytes calldata args` and compress _evidenceID and _side (only for optimistic rollups).
     /// @param _evidenceID Unique identifier of the evidence submission.
     /// @param _side The side to contribute to.
@@ -281,7 +281,7 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
         emit ModerationStatusChanged(_evidenceID, moderation.currentWinner);
     }
 
-    /// @dev Resolves a moderation event once the timeout has passed.
+    /// @notice Resolves a moderation event once the timeout has passed.
     /// @param _evidenceID Unique identifier of the evidence submission.
     function resolveModerationMarket(bytes32 _evidenceID) external {
         // Moderation market resolutions are not final.
@@ -297,7 +297,7 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
         evidenceData.ruling = moderation.currentWinner;
     }
 
-    /// @dev Make a fee contribution.
+    /// @notice Make a fee contribution.
     /// @param _moderation The moderation to contribute to.
     /// @param _side The side to contribute to.
     /// @param _contributor The contributor.
@@ -326,7 +326,7 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
         return contribution;
     }
 
-    /// @dev Returns the contribution value and remainder from available ETH and required amount.
+    /// @notice Returns the contribution value and remainder from available ETH and required amount.
     /// @param _available The amount of ETH available for the contribution.
     /// @param _requiredAmount The amount of ETH required for the contribution.
     /// @return taken The amount of ETH taken.
@@ -341,9 +341,11 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
         return (_requiredAmount, remainder);
     }
 
-    /// @dev Withdraws contributions of moderations. Reimburses contributions if the appeal was not fully funded.
-    /// If the appeal was fully funded, sends the fee stake rewards and reimbursements proportional to the contributions made to the winner of a dispute.
+    /// @notice Withdraws contributions of moderations. Reimburses contributions if the appeal was not fully funded.
+    ///
+    /// @dev If the appeal was fully funded, sends the fee stake rewards and reimbursements proportional to the contributions made to the winner of a dispute.
     /// Optimization opportunity: use `bytes calldata args` and compress _evidenceID and _moderationID (only for optimistic rollups).
+    ///
     /// @param _beneficiary The address that made contributions.
     /// @param _evidenceID The ID of the associated evidence submission.
     /// @param _moderationID The ID of the moderatino occurence.
@@ -378,10 +380,7 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
         _beneficiary.send(reward); // It is the user responsibility to accept ETH.
     }
 
-    /// @dev Give a ruling for a dispute. Must be called by the arbitrator to enforce the final ruling.
-    /// The purpose of this function is to ensure that the address calling it has the right to rule on the contract.
-    /// @param _disputeID ID of the dispute in the Arbitrator contract.
-    /// @param _ruling Ruling given by the arbitrator. Note that 0 is reserved for "Not able/wanting to make a decision".
+    /// @inheritdoc IArbitrableV2
     function rule(uint256 _disputeID, uint256 _ruling) public override {
         bytes32 evidenceID = disputeIDtoEvidenceID[_disputeID];
         EvidenceData storage evidenceData = evidences[evidenceID];
@@ -404,7 +403,7 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
     // *           Public Views            * //
     // ************************************* //
 
-    /// @dev Gets the number of moderation events of the specific evidence submission.
+    /// @notice Gets the number of moderation events of the specific evidence submission.
     /// @param _evidenceID The ID of the evidence submission.
     /// @return The number of moderations.
     function getNumberOfModerations(bytes32 _evidenceID) external view returns (uint256) {
@@ -412,7 +411,7 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
         return evidenceData.moderations.length;
     }
 
-    /// @dev Gets the contributions made by a party for a given moderation.
+    /// @notice Gets the contributions made by a party for a given moderation.
     /// @param _evidenceID The ID of the evidence submission.
     /// @param _moderationID The ID of the moderation occurence.
     /// @param _contributor The address of the contributor.
@@ -427,7 +426,7 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
         contributions = moderation.contributions[_contributor];
     }
 
-    /// @dev Gets the information of a moderation event.
+    /// @notice Gets the information of a moderation event.
     /// @param _evidenceID The ID of the evidence submission.
     /// @param _moderationID The ID of the moderation occurence.
     /// @return paidFees currentWinner feeRewards The moderation information.
@@ -440,7 +439,7 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
         return (moderation.paidFees, moderation.currentWinner, moderation.feeRewards);
     }
 
-    /// @dev Gets the last arbitrator data index, which is used for current new submissions.
+    /// @notice Gets the last arbitrator data index, which is used for current new submissions.
     /// @return The last arbitrator data index.
     function getCurrentArbitratorIndex() external view returns (uint256) {
         return arbitratorDataList.length - 1;
diff --git a/contracts/src/arbitration/interfaces/IArbitrableV2.sol b/contracts/src/arbitration/interfaces/IArbitrableV2.sol
index 69597c383..b371aa867 100644
--- a/contracts/src/arbitration/interfaces/IArbitrableV2.sol
+++ b/contracts/src/arbitration/interfaces/IArbitrableV2.sol
@@ -8,9 +8,13 @@ import "./IArbitratorV2.sol";
 /// @notice Arbitrable interface.
 /// @dev When developing arbitrable contracts, we need to:
 /// - Define the action taken when a ruling is received by the contract.
-/// - Allow dispute creation. For this a function must call arbitrator.createDispute{value: _fee}(_choices,_extraData);
+/// - Allow dispute creation which calls `arbitrator.createDispute{value: _fee}(_choices,_extraData)`.
 interface IArbitrableV2 {
-    /// @dev To be emitted when a dispute is created to link the correct template to the disputeID.
+    // ************************************* //
+    // *              Events               * //
+    // ************************************* //
+
+    /// @notice To be emitted when a dispute is created to link the correct template to the disputeID.
     /// @param _arbitrator The arbitrator of the contract.
     /// @param _arbitratorDisputeID The identifier of the dispute in the Arbitrator contract.
     /// @param _externalDisputeID An identifier created outside Kleros by the protocol requesting arbitration.
@@ -22,17 +26,23 @@ interface IArbitrableV2 {
         uint256 _templateId
     );
 
-    /// @dev To be raised when a ruling is given.
+    /// @notice To be raised when a ruling is given.
     /// @param _arbitrator The arbitrator giving the ruling.
     /// @param _disputeID The identifier of the dispute in the Arbitrator contract.
     /// @param _ruling The ruling which was given.
     event Ruling(IArbitratorV2 indexed _arbitrator, uint256 indexed _disputeID, uint256 _ruling);
 
-    /// @dev Give a ruling for a dispute.
-    ///      Must be called by the arbitrator.
-    ///      The purpose of this function is to ensure that the address calling it has the right to rule on the contract.
+    // ************************************* //
+    // *         State Modifiers           * //
+    // ************************************* //
+
+    /// @notice Give a ruling for a dispute.
+    ///
+    /// @dev This is a callback function for the arbitrator to provide the ruling to this contract.
+    /// Only the arbitrator must be allowed to call this function.
+    /// Ruling 0 is reserved for "Not able/wanting to make a decision".
+    ///
     /// @param _disputeID The identifier of the dispute in the Arbitrator contract.
     /// @param _ruling Ruling given by the arbitrator.
-    /// Note that 0 is reserved for "Not able/wanting to make a decision".
     function rule(uint256 _disputeID, uint256 _ruling) external;
 }
diff --git a/contracts/src/arbitration/interfaces/IArbitratorV2.sol b/contracts/src/arbitration/interfaces/IArbitratorV2.sol
index 9559c81b3..125baab92 100644
--- a/contracts/src/arbitration/interfaces/IArbitratorV2.sol
+++ b/contracts/src/arbitration/interfaces/IArbitratorV2.sol
@@ -6,38 +6,41 @@ import "@openzeppelin/contracts/token/ERC20/IERC20.sol";
 import "./IArbitrableV2.sol";
 
 /// @title Arbitrator
-/// Arbitrator interface that implements the new arbitration standard.
-/// Unlike the ERC-792 this standard is not concerned with appeals, so each arbitrator can implement an appeal system that suits it the most.
-/// When developing arbitrator contracts we need to:
-/// - Define the functions for dispute creation (createDispute). Don't forget to store the arbitrated contract and the disputeID (which should be unique, may nbDisputes).
-/// - Define the functions for cost display (arbitrationCost).
-/// - Allow giving rulings. For this a function must call arbitrable.rule(disputeID, ruling).
+/// @notice Arbitrator interface for the Kleros V2 protocol.
+/// @dev Unlike the ERC-792 this standard is not concerned with appeals, so each arbitrator can implement an appeal system that suits it the most.
 interface IArbitratorV2 {
-    /// @dev To be emitted when a dispute is created.
+    // ************************************* //
+    // *              Events               * //
+    // ************************************* //
+
+    /// @notice To be emitted when a dispute is created.
     /// @param _disputeID The identifier of the dispute in the Arbitrator contract.
     /// @param _arbitrable The contract which created the dispute.
     event DisputeCreation(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);
 
-    /// @dev To be raised when a ruling is given.
+    /// @notice To be raised when a ruling is given.
     /// @param _arbitrable The arbitrable receiving the ruling.
     /// @param _disputeID The identifier of the dispute in the Arbitrator contract.
     /// @param _ruling The ruling which was given.
     event Ruling(IArbitrableV2 indexed _arbitrable, uint256 indexed _disputeID, uint256 _ruling);
 
-    /// @dev To be emitted when an ERC20 token is added or removed as a method to pay fees.
+    /// @notice To be emitted when an ERC20 token is added or removed as a method to pay fees.
     /// @param _token The ERC20 token.
     /// @param _accepted Whether the token is accepted or not.
     event AcceptedFeeToken(IERC20 indexed _token, bool indexed _accepted);
 
-    /// @dev To be emitted when the fee for a particular ERC20 token is updated.
+    /// @notice To be emitted when the fee for a particular ERC20 token is updated.
     /// @param _feeToken The ERC20 token.
     /// @param _rateInEth The new rate of the fee token in ETH.
     /// @param _rateDecimals The new decimals of the fee token rate.
     event NewCurrencyRate(IERC20 indexed _feeToken, uint64 _rateInEth, uint8 _rateDecimals);
 
-    /// @dev Create a dispute and pay for the fees in the native currency, typically ETH.
-    ///      Must be called by the arbitrable contract.
-    ///      Must pay at least arbitrationCost(_extraData).
+    // ************************************* //
+    // *         State Modifiers           * //
+    // ************************************* //
+
+    /// @notice Create a dispute and pay for the fees in the native currency, typically ETH.
+    /// @dev Must be called by the arbitrable contract and pay at least `arbitrationCost(_extraData)` in ETH.
     /// @param _numberOfChoices The number of choices the arbitrator can choose from in this dispute.
     /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).
     /// @return disputeID The identifier of the dispute created.
@@ -46,9 +49,8 @@ interface IArbitratorV2 {
         bytes calldata _extraData
     ) external payable returns (uint256 disputeID);
 
-    /// @dev Create a dispute and pay for the fees in a supported ERC20 token.
-    ///      Must be called by the arbitrable contract.
-    ///      Must pay at least arbitrationCost(_extraData).
+    /// @notice Create a dispute and pay for the fees in a supported ERC20 token.
+    /// @dev Must be called by the arbitrable contract and pay at least `arbitrationCost(_extraData)` in the supported ERC20 token.
     /// @param _numberOfChoices The number of choices the arbitrator can choose from in this dispute.
     /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).
     /// @param _feeToken The ERC20 token used to pay fees.
@@ -61,20 +63,24 @@ interface IArbitratorV2 {
         uint256 _feeAmount
     ) external returns (uint256 disputeID);
 
-    /// @dev Compute the cost of arbitration denominated in the native currency, typically ETH.
-    ///      It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.
+    // ************************************* //
+    // *           Public Views            * //
+    // ************************************* //
+
+    /// @notice Compute the cost of arbitration denominated in the native currency, typically ETH.
+    /// @dev It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.
     /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).
     /// @return cost The arbitration cost in ETH.
     function arbitrationCost(bytes calldata _extraData) external view returns (uint256 cost);
 
-    /// @dev Compute the cost of arbitration denominated in `_feeToken`.
-    ///      It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.
+    /// @notice Compute the cost of arbitration denominated in `_feeToken`.
+    /// @dev It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.
     /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).
     /// @param _feeToken The ERC20 token used to pay fees.
     /// @return cost The arbitration cost in `_feeToken`.
     function arbitrationCost(bytes calldata _extraData, IERC20 _feeToken) external view returns (uint256 cost);
 
-    /// @dev Gets the current ruling of a specified dispute.
+    /// @notice Gets the current ruling of a specified dispute.
     /// @param _disputeID The ID of the dispute.
     /// @return ruling The current ruling.
     /// @return tied Whether it's a tie or not.
diff --git a/contracts/src/arbitration/interfaces/IDisputeKit.sol b/contracts/src/arbitration/interfaces/IDisputeKit.sol
index 00966d097..20e42a0d2 100644
--- a/contracts/src/arbitration/interfaces/IDisputeKit.sol
+++ b/contracts/src/arbitration/interfaces/IDisputeKit.sol
@@ -5,14 +5,14 @@ pragma solidity >=0.8.0 <0.9.0;
 import "./IArbitratorV2.sol";
 
 /// @title IDisputeKit
-/// An abstraction of the Dispute Kits intended for interfacing with KlerosCore.
-/// It does not intend to abstract the interactions with the user (such as voting or appeal funding) to allow for implementation-specific parameters.
+/// @notice An abstraction of the Dispute Kits intended for interfacing with KlerosCore.
+/// @dev It does not intend to abstract the interactions with the user (such as voting or appeal funding) to allow for implementation-specific parameters.
 interface IDisputeKit {
     // ************************************ //
     // *             Events               * //
     // ************************************ //
 
-    /// @dev Emitted when casting a vote to provide the justification of juror's choice.
+    /// @notice Emitted when casting a vote to provide the justification of juror's choice.
     /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.
     /// @param _juror Address of the juror.
     /// @param _voteIDs The identifiers of the votes in the dispute.
@@ -30,8 +30,8 @@ interface IDisputeKit {
     // *         State Modifiers           * //
     // ************************************* //
 
-    /// @dev Creates a local dispute and maps it to the dispute ID in the Core contract.
-    /// Note: Access restricted to Kleros Core only.
+    /// @notice Creates a local dispute and maps it to the dispute ID in the Core contract.
+    /// @dev Access restricted to Kleros Core only.
     /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
     /// @param _numberOfChoices Number of choices of the dispute
     /// @param _extraData Additional info about the dispute, for possible use in future dispute kits.
@@ -43,8 +43,8 @@ interface IDisputeKit {
         uint256 _nbVotes
     ) external;
 
-    /// @dev Draws the juror from the sortition tree. The drawn address is picked up by Kleros Core.
-    /// Note: Access restricted to Kleros Core only.
+    /// @notice Draws the juror from the sortition tree. The drawn address is picked up by Kleros Core.
+    /// @dev Access restricted to Kleros Core only.
     /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
     /// @param _nonce Nonce.
     /// @return drawnAddress The drawn address.
@@ -57,14 +57,15 @@ interface IDisputeKit {
     // *           Public Views            * //
     // ************************************* //
 
-    /// @dev Gets the current ruling of a specified dispute.
+    /// @notice Gets the current ruling of a specified dispute.
     /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
     /// @return ruling The current ruling.
     /// @return tied Whether it's a tie or not.
     /// @return overridden Whether the ruling was overridden by appeal funding or not.
     function currentRuling(uint256 _coreDisputeID) external view returns (uint256 ruling, bool tied, bool overridden);
 
-    /// @dev Gets the degree of coherence of a particular voter. This function is called by Kleros Core in order to determine the amount of the reward.
+    /// @notice Gets the degree of coherence of a particular voter.
+    /// @dev This function is called by Kleros Core in order to determine the amount of the reward.
     /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
     /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.
     /// @param _voteID The ID of the vote.
@@ -80,7 +81,8 @@ interface IDisputeKit {
         uint256 _pnkAtStakePerJuror
     ) external view returns (uint256 pnkCoherence, uint256 feeCoherence);
 
-    /// @dev Gets the degree of coherence of a particular voter. This function is called by Kleros Core in order to determine the amount of the penalty.
+    /// @notice Gets the degree of coherence of a particular voter.
+    /// @dev This function is called by Kleros Core in order to determine the amount of the penalty.
     /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
     /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.
     /// @param _voteID The ID of the vote.
@@ -95,25 +97,25 @@ interface IDisputeKit {
         uint256 _pnkAtStakePerJuror
     ) external view returns (uint256 pnkCoherence);
 
-    /// @dev Gets the number of jurors who are eligible to a reward in this round.
+    /// @notice Gets the number of jurors who are eligible to a reward in this round.
     /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
     /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.
     /// @return The number of coherent jurors.
     function getCoherentCount(uint256 _coreDisputeID, uint256 _coreRoundID) external view returns (uint256);
 
-    /// @dev Returns true if all of the jurors have cast their commits for the last round.
+    /// @notice Returns true if all of the jurors have cast their commits for the last round.
     /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
     /// @return Whether all of the jurors have cast their commits for the last round.
     function areCommitsAllCast(uint256 _coreDisputeID) external view returns (bool);
 
-    /// @dev Returns true if all of the jurors have cast their votes for the last round.
-    /// Note that this function is to be called directly by the core contract and is not for off-chain usage.
+    /// @notice Returns true if all of the jurors have cast their votes for the last round.
+    /// @dev This function is to be called directly by the core contract and is not for off-chain usage.
     /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
     /// @return Whether all of the jurors have cast their votes for the last round.
     function areVotesAllCast(uint256 _coreDisputeID) external view returns (bool);
 
-    /// @dev Returns true if the appeal funding is finished prematurely (e.g. when losing side didn't fund).
-    /// Note that this function is to be called directly by the core contract and is not for off-chain usage.
+    /// @notice Returns true if the appeal funding is finished prematurely (e.g. when losing side didn't fund).
+    /// @dev This function is to be called directly by the core contract and is not for off-chain usage.
     /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
     /// @return Whether the appeal funding is finished.
     function isAppealFunded(uint256 _coreDisputeID) external view returns (bool);
@@ -123,7 +125,7 @@ interface IDisputeKit {
     /// @return Whether the dispute is jumping to a parent court or not.
     function earlyCourtJump(uint256 _coreDisputeID) external view returns (bool);
 
-    /// @dev Returns the number of votes after the appeal.
+    /// @notice Returns the number of votes after the appeal.
     /// @param _previousDisputeKit The previous Dispute Kit.
     /// @param _currentNbVotes The number of votes before the appeal.
     /// @return The number of votes after the appeal.
@@ -132,18 +134,18 @@ interface IDisputeKit {
         uint256 _currentNbVotes
     ) external view returns (uint256);
 
-    /// @dev Returns the dispute kit ID to be used after court jump by Kleros Core.
+    /// @notice Returns the dispute kit ID to be used after court jump by Kleros Core.
     /// @return The ID of the dispute kit in Kleros Core disputeKits array.
     function getJumpDisputeKitID() external view returns (uint256);
 
-    /// @dev Returns true if the specified voter was active in this round.
+    /// @notice Returns true if the specified voter was active in this round.
     /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
     /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.
     /// @param _voteID The ID of the voter.
     /// @return Whether the voter was active or not.
     function isVoteActive(uint256 _coreDisputeID, uint256 _coreRoundID, uint256 _voteID) external view returns (bool);
 
-    /// @dev Returns the info of the specified round in the core contract.
+    /// @notice Returns the info of the specified round in the core contract.
     /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
     /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.
     /// @param _choice The choice to query.
@@ -169,7 +171,7 @@ interface IDisputeKit {
             uint256 choiceCount
         );
 
-    /// @dev Returns the vote information for a given vote ID.
+    /// @notice Returns the vote information for a given vote ID.
     /// @param _coreDisputeID The ID of the dispute in Kleros Core.
     /// @param _coreRoundID The ID of the round in Kleros Core.
     /// @param _voteID The ID of the vote.
diff --git a/contracts/src/arbitration/interfaces/IDisputeTemplateRegistry.sol b/contracts/src/arbitration/interfaces/IDisputeTemplateRegistry.sol
index 23e09f8d5..cfa207448 100644
--- a/contracts/src/arbitration/interfaces/IDisputeTemplateRegistry.sol
+++ b/contracts/src/arbitration/interfaces/IDisputeTemplateRegistry.sol
@@ -5,7 +5,11 @@ pragma solidity >=0.8.0 <0.9.0;
 /// @title IDisputeTemplate
 /// @notice Dispute Template interface.
 interface IDisputeTemplateRegistry {
-    /// @dev To be emitted when a new dispute template is created.
+    // ************************************* //
+    // *              Events               * //
+    // ************************************* //
+
+    /// @notice To be emitted when a new dispute template is created.
     /// @param _templateId The identifier of the dispute template.
     /// @param _templateTag An optional tag for the dispute template, such as "registration" or "removal".
     /// @param _templateData The template data.
@@ -17,6 +21,15 @@ interface IDisputeTemplateRegistry {
         string _templateDataMappings
     );
 
+    // ************************************* //
+    // *         State Modifiers           * //
+    // ************************************* //
+
+    /// @notice Registers a new dispute template.
+    /// @param _templateTag An optional tag for the dispute template, such as "registration" or "removal".
+    /// @param _templateData The template data.
+    /// @param _templateDataMappings The data mappings for the template.
+    /// @return templateId The identifier of the dispute template.
     function setDisputeTemplate(
         string memory _templateTag,
         string memory _templateData,
diff --git a/contracts/src/arbitration/interfaces/IEvidence.sol b/contracts/src/arbitration/interfaces/IEvidence.sol
index d995a996b..4b6477ff2 100644
--- a/contracts/src/arbitration/interfaces/IEvidence.sol
+++ b/contracts/src/arbitration/interfaces/IEvidence.sol
@@ -4,7 +4,7 @@ pragma solidity >=0.8.0 <0.9.0;
 
 /// @title IEvidence
 interface IEvidence {
-    /// @dev To be raised when evidence is submitted. Should point to the resource (evidences are not to be stored on chain due to gas considerations).
+    /// @notice To be raised when evidence is submitted. Should point to the resource (evidences are not to be stored on chain due to gas considerations).
     /// @param _externalDisputeID Unique identifier for this dispute outside Kleros. It's the submitter responsibility to submit the right external dispute ID.
     /// @param _party The address of the party submiting the evidence. Note that 0x0 refers to evidence not submitted by any party.
     /// @param _evidence Stringified evidence object, example: '{"name" : "Justification", "description" : "Description", "fileURI" : "/ipfs/QmWQV5ZFFhEJiW8Lm7ay2zLxC2XS4wx1b2W7FfdrLMyQQc"}'.
diff --git a/contracts/src/arbitration/interfaces/ISortitionModule.sol b/contracts/src/arbitration/interfaces/ISortitionModule.sol
index b10e39a42..0803666ff 100644
--- a/contracts/src/arbitration/interfaces/ISortitionModule.sol
+++ b/contracts/src/arbitration/interfaces/ISortitionModule.sol
@@ -5,7 +5,7 @@ pragma solidity >=0.8.0 <0.9.0;
 import "../../libraries/Constants.sol";
 
 /// @title ISortitionModule
-/// @dev Interface for the SortitionModule contract.
+/// @notice Interface for the SortitionModule contract.
 interface ISortitionModule {
     // ************************************* //
     // *              Enums                * //
@@ -21,7 +21,7 @@ interface ISortitionModule {
     // *              Events               * //
     // ************************************* //
 
-    /// @dev Emitted when the phase is changed.
+    /// @notice Emitted when the phase is changed.
     /// @param _phase The new phase.
     event NewPhase(Phase _phase);
 
@@ -29,20 +29,20 @@ interface ISortitionModule {
     // *         State Modifiers           * //
     // ************************************* //
 
-    /// @dev Passes the phase.
+    /// @notice Passes the phase.
     function passPhase() external;
 
-    /// @dev Executes the next delayed stakes.
+    /// @notice Executes the next delayed stakes.
     /// @param _iterations The number of delayed stakes to execute.
     function executeDelayedStakes(uint256 _iterations) external;
 
-    /// @dev Create a sortition sum tree at the specified key.
+    /// @notice Create a sortition sum tree at the specified key.
     /// @param _courtID The ID of the court.
     /// @param _extraData Extra data that contains the number of children each node in the tree should have.
     function createTree(uint96 _courtID, bytes memory _extraData) external;
 
-    /// @dev Validate the specified juror's new stake for a court.
-    /// Note: no state changes should be made when returning stakingResult != Successful, otherwise delayed stakes might break invariants.
+    /// @notice Validate the specified juror's new stake for a court.
+    /// @dev No state changes should be made when returning stakingResult != Successful, otherwise delayed stakes might break invariants.
     /// @param _account The address of the juror.
     /// @param _courtID The ID of the court.
     /// @param _newStake The new stake.
@@ -57,12 +57,14 @@ interface ISortitionModule {
         bool _noDelay
     ) external returns (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult);
 
-    /// @dev Update the state of the stakes, called by KC at the end of setStake flow.
-    /// `O(n + p * log_k(j))` where
+    /// @notice Update the state of the stakes, called by KC at the end of setStake flow.
+    ///
+    /// @dev `O(n + p * log_k(j))` where
     /// `n` is the number of courts the juror has staked in,
     /// `p` is the depth of the court tree,
     /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
     /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
+    ///
     /// @param _account The address of the juror.
     /// @param _courtID The ID of the court.
     /// @param _pnkDeposit The amount of PNK to be deposited.
@@ -76,12 +78,14 @@ interface ISortitionModule {
         uint256 _newStake
     ) external;
 
-    /// @dev Update the state of the stakes with a PNK reward deposit, called by KC during rewards execution.
-    /// `O(n + p * log_k(j))` where
+    /// @notice Update the state of the stakes with a PNK reward deposit, called by KC during rewards execution.
+    ///
+    /// @dev `O(n + p * log_k(j))` where
     /// `n` is the number of courts the juror has staked in,
     /// `p` is the depth of the court tree,
     /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
     /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
+    ///
     /// @param _account The address of the juror.
     /// @param _courtID The ID of the court.
     /// @param _penalty The amount of PNK to be deducted.
@@ -94,62 +98,72 @@ interface ISortitionModule {
         uint256 _penalty
     ) external returns (uint256 pnkBalance, uint256 newCourtStake, uint256 availablePenalty);
 
-    /// @dev Update the state of the stakes with a PNK reward deposit, called by KC during rewards execution.
+    /// @notice Update the state of the stakes with a PNK reward deposit, called by KC during rewards execution.
+    ///
+    /// @dev `O(n + p * log_k(j))` where
     /// `O(n + p * log_k(j))` where
     /// `n` is the number of courts the juror has staked in,
     /// `p` is the depth of the court tree,
     /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
     /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
+    ///
     /// @param _account The address of the juror.
     /// @param _courtID The ID of the court.
     /// @param _reward The amount of PNK to be deposited as a reward.
     /// @return success True if the reward was added successfully.
     function setStakeReward(address _account, uint96 _courtID, uint256 _reward) external returns (bool success);
 
-    /// @dev Unstakes the inactive juror from all courts.
+    /// @notice Unstakes the inactive juror from all courts.
+    ///
+    /// @dev `O(n * (p * log_k(j)) )` where
     /// `O(n * (p * log_k(j)) )` where
     /// `n` is the number of courts the juror has staked in,
     /// `p` is the depth of the court tree,
     /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
     /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
+    ///
     /// @param _account The juror to unstake.
     function forcedUnstakeAllCourts(address _account) external;
 
-    /// @dev Unstakes the inactive juror from a specific court.
-    /// `O(n * (p * log_k(j)) )` where
+    /// @notice Unstakes the inactive juror from a specific court.
+    ///
+    /// @dev `O(n * (p * log_k(j)) )` where
     /// `n` is the number of courts the juror has staked in,
     /// `p` is the depth of the court tree,
     /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
     /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
+    ///
     /// @param _account The juror to unstake.
     /// @param _courtID The ID of the court.
     function forcedUnstake(address _account, uint96 _courtID) external;
 
-    /// @dev Locks the tokens of the drawn juror.
+    /// @notice Locks the tokens of the drawn juror.
     /// @param _account The address of the juror.
     /// @param _relativeAmount The amount to lock.
     function lockStake(address _account, uint256 _relativeAmount) external;
 
-    /// @dev Unlocks the tokens of the drawn juror.
+    /// @notice Unlocks the tokens of the drawn juror.
     /// @param _account The address of the juror.
     /// @param _relativeAmount The amount to unlock.
     function unlockStake(address _account, uint256 _relativeAmount) external;
 
-    /// @dev Triggers the state changes after dispute creation.
+    /// @notice Triggers the state changes after dispute creation.
     /// @param _disputeID The ID of the dispute.
     /// @param _roundID The ID of the round.
     function createDisputeHook(uint256 _disputeID, uint256 _roundID) external;
 
-    /// @dev Triggers the state changes after drawing.
+    /// @notice Triggers the state changes after drawing.
     /// @param _disputeID The ID of the dispute.
     /// @param _roundID The ID of the round.
     function postDrawHook(uint256 _disputeID, uint256 _roundID) external;
 
-    /// @dev Gives back the locked PNKs in case the juror fully unstaked earlier.
-    /// Note that since locked and staked PNK are async it is possible for the juror to have positive staked PNK balance
+    /// @notice Gives back the locked PNKs in case the juror fully unstaked earlier.
+    ///
+    /// @dev that since locked and staked PNK are async it is possible for the juror to have positive staked PNK balance
     /// while having 0 stake in courts and 0 locked tokens (eg. when the juror fully unstaked during dispute and later got his tokens unlocked).
     /// In this case the juror can use this function to withdraw the leftover tokens.
     /// Also note that if the juror has some leftover PNK while not fully unstaked he'll have to manually unstake from all courts to trigger this function.
+    ///
     /// @param _account The juror whose PNK to withdraw.
     function withdrawLeftoverPNK(address _account) external;
 
@@ -157,22 +171,24 @@ interface ISortitionModule {
     // *           Public Views            * //
     // ************************************* //
 
-    /// @dev Draw an ID from a tree using a number.
-    /// Note that this function reverts if the sum of all values in the tree is 0.
+    /// @notice Draw an ID from a tree using a number.
+    ///
+    /// @dev that this function reverts if the sum of all values in the tree is 0.
+    /// `O(k * log_k(n))` where
+    /// `k` is the maximum number of children per node in the tree,
+    ///  and `n` is the maximum number of nodes ever appended.
+    ///
     /// @param _courtID The ID of the court.
     /// @param _coreDisputeID Index of the dispute in Kleros Core.
     /// @param _nonce Nonce to hash with random number.
     /// @return drawnAddress The drawn address.
-    /// `O(k * log_k(n))` where
-    /// `k` is the maximum number of children per node in the tree,
-    ///  and `n` is the maximum number of nodes ever appended.
     function draw(
         uint96 _courtID,
         uint256 _coreDisputeID,
         uint256 _nonce
     ) external view returns (address drawnAddress, uint96 fromSubcourtID);
 
-    /// @dev Gets the balance of a juror in a court.
+    /// @notice Gets the balance of a juror in a court.
     /// @param _juror The address of the juror.
     /// @param _courtID The ID of the court.
     /// @return totalStakedPnk The total amount of tokens staked including locked tokens and penalty deductions. Equivalent to the effective stake in the General court.
@@ -184,16 +200,16 @@ interface ISortitionModule {
         uint96 _courtID
     ) external view returns (uint256 totalStakedPnk, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts);
 
-    /// @dev Gets the court identifiers where a specific `_juror` has staked.
+    /// @notice Gets the court identifiers where a specific `_juror` has staked.
     /// @param _juror The address of the juror.
     function getJurorCourtIDs(address _juror) external view returns (uint96[] memory);
 
-    /// @dev Checks if the juror is staked in any court.
+    /// @notice Checks if the juror is staked in any court.
     /// @param _juror The address of the juror.
     /// @return Whether the juror is staked or not.
     function isJurorStaked(address _juror) external view returns (bool);
 
-    /// @dev Checks if the juror has any leftover PNK in the contract.
+    /// @notice Checks if the juror has any leftover PNK in the contract.
     /// @param _juror The address of the juror.
     /// @return Whether the juror has leftover PNK.
     function getJurorLeftoverPNK(address _juror) external view returns (uint256);
diff --git a/contracts/src/arbitration/university/KlerosCoreUniversity.sol b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
index 895e0bc88..2a29a54be 100644
--- a/contracts/src/arbitration/university/KlerosCoreUniversity.sol
+++ b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
@@ -11,7 +11,7 @@ import {Initializable} from "../../proxy/Initializable.sol";
 import "../../libraries/Constants.sol";
 
 /// @title KlerosCoreUniversity
-/// Core arbitrator contract for educational purposes.
+/// @notice Core arbitrator contract for educational purposes.
 contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
     using SafeERC20 for IERC20;
 
@@ -190,7 +190,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         _disableInitializers();
     }
 
-    /// @dev Initializer (constructor equivalent for upgradable contracts).
+    /// @notice Initializer (constructor equivalent for upgradable contracts).
     /// @param _owner The owner's address.
     /// @param _instructor The address of the instructor.
     /// @param _pinakion The address of the token contract.
@@ -265,7 +265,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         // NOP
     }
 
-    /// @dev Allows the owner to call anything on behalf of the contract.
+    /// @notice Allows the owner to call anything on behalf of the contract.
     /// @param _destination The destination of the call.
     /// @param _amount The value sent with the call.
     /// @param _data The data sent with the call.
@@ -274,38 +274,38 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         if (!success) revert UnsuccessfulCall();
     }
 
-    /// @dev Changes the `owner` storage variable.
+    /// @notice Changes the `owner` storage variable.
     /// @param _owner The new value for the `owner` storage variable.
     function changeOwner(address payable _owner) external onlyByOwner {
         owner = _owner;
     }
 
-    /// @dev Changes the `instructor` storage variable.
+    /// @notice Changes the `instructor` storage variable.
     /// @param _instructor The new value for the `instructor` storage variable.
     function changeInstructor(address _instructor) external onlyByOwnerOrInstructor {
         instructor = _instructor;
     }
 
-    /// @dev Changes the `pinakion` storage variable.
+    /// @notice Changes the `pinakion` storage variable.
     /// @param _pinakion The new value for the `pinakion` storage variable.
     function changePinakion(IERC20 _pinakion) external onlyByOwner {
         pinakion = _pinakion;
     }
 
-    /// @dev Changes the `jurorProsecutionModule` storage variable.
+    /// @notice Changes the `jurorProsecutionModule` storage variable.
     /// @param _jurorProsecutionModule The new value for the `jurorProsecutionModule` storage variable.
     function changeJurorProsecutionModule(address _jurorProsecutionModule) external onlyByOwner {
         jurorProsecutionModule = _jurorProsecutionModule;
     }
 
-    /// @dev Changes the `_sortitionModule` storage variable.
+    /// @notice Changes the `_sortitionModule` storage variable.
     /// Note that the new module should be initialized for all courts.
     /// @param _sortitionModule The new value for the `sortitionModule` storage variable.
     function changeSortitionModule(ISortitionModuleUniversity _sortitionModule) external onlyByOwner {
         sortitionModule = _sortitionModule;
     }
 
-    /// @dev Add a new supported dispute kit module to the court.
+    /// @notice Add a new supported dispute kit module to the court.
     /// @param _disputeKitAddress The address of the dispute kit contract.
     function addNewDisputeKit(IDisputeKit _disputeKitAddress) external onlyByOwner {
         uint256 disputeKitID = disputeKits.length;
@@ -313,7 +313,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         emit DisputeKitCreated(disputeKitID, _disputeKitAddress);
     }
 
-    /// @dev Creates a court under a specified parent court.
+    /// @notice Creates a court under a specified parent court.
     /// @param _parent The `parent` property value of the court.
     /// @param _hiddenVotes The `hiddenVotes` property value of the court.
     /// @param _minStake The `minStake` property value of the court.
@@ -407,7 +407,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         );
     }
 
-    /// @dev Adds/removes court's support for specified dispute kits.
+    /// @notice Adds/removes court's support for specified dispute kits.
     /// @param _courtID The ID of the court.
     /// @param _disputeKitIDs The IDs of dispute kits which support should be added/removed.
     /// @param _enable Whether add or remove the dispute kits from the court.
@@ -428,7 +428,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         }
     }
 
-    /// @dev Changes the supported fee tokens.
+    /// @notice Changes the supported fee tokens.
     /// @param _feeToken The fee token.
     /// @param _accepted Whether the token is supported or not as a method of fee payment.
     function changeAcceptedFeeTokens(IERC20 _feeToken, bool _accepted) external onlyByOwner {
@@ -436,7 +436,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         emit AcceptedFeeToken(_feeToken, _accepted);
     }
 
-    /// @dev Changes the currency rate of a fee token.
+    /// @notice Changes the currency rate of a fee token.
     /// @param _feeToken The fee token.
     /// @param _rateInEth The new rate of the fee token in ETH.
     /// @param _rateDecimals The new decimals of the fee token rate.
@@ -450,7 +450,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
     // *         State Modifiers           * //
     // ************************************* //
 
-    /// @dev Sets the caller's stake in a court.
+    /// @notice Sets the caller's stake in a court.
     /// @param _courtID The ID of the court.
     /// @param _newStake The new stake.
     /// Note that the existing delayed stake will be nullified as non-relevant.
@@ -458,7 +458,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         _setStake(msg.sender, _courtID, _newStake, false, OnError.Revert);
     }
 
-    /// @dev Sets the stake of a specified account in a court, typically to apply a delayed stake or unstake inactive jurors.
+    /// @notice Sets the stake of a specified account in a court, typically to apply a delayed stake or unstake inactive jurors.
     /// @param _account The account whose stake is being set.
     /// @param _courtID The ID of the court.
     /// @param _newStake The new stake.
@@ -467,7 +467,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         _setStake(_account, _courtID, _newStake, true, OnError.Return);
     }
 
-    /// @dev Transfers PNK to the juror by SortitionModule.
+    /// @notice Transfers PNK to the juror by SortitionModule.
     /// @param _account The account of the juror whose PNK to transfer.
     /// @param _amount The amount to transfer.
     function transferBySortitionModule(address _account, uint256 _amount) external {
@@ -535,7 +535,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         emit DisputeCreation(disputeID, IArbitrableV2(msg.sender));
     }
 
-    /// @dev Passes the period of a specified dispute.
+    /// @notice Passes the period of a specified dispute.
     /// @param _disputeID The ID of the dispute.
     function passPeriod(uint256 _disputeID) external {
         Dispute storage dispute = disputes[_disputeID];
@@ -585,7 +585,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         emit NewPeriod(_disputeID, dispute.period);
     }
 
-    /// @dev Draws one juror for the dispute until the number votes paid for is reached.
+    /// @notice Draws one juror for the dispute until the number votes paid for is reached.
     /// @param _disputeID The ID of the dispute.
     /// @param _juror The address of the juror to draw.
     function draw(uint256 _disputeID, address _juror) external onlyByOwnerOrInstructor {
@@ -615,8 +615,8 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         sortitionModule.setTransientJuror(address(0));
     }
 
-    /// @dev Appeals the ruling of a specified dispute.
-    /// Note: Access restricted to the Dispute Kit for this `disputeID`.
+    /// @notice Appeals the ruling of a specified dispute.
+    /// @dev Access restricted to the Dispute Kit for this `disputeID`.
     /// @param _disputeID The ID of the dispute.
     /// @param _numberOfChoices Number of choices for the dispute. Can be required during court jump.
     /// @param _extraData Extradata for the dispute. Can be required during court jump.
@@ -676,7 +676,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         emit NewPeriod(_disputeID, Period.evidence);
     }
 
-    /// @dev Distribute the PNKs at stake and the dispute fees for the specific round of the dispute. Can be called in parts.
+    /// @notice Distribute the PNKs at stake and the dispute fees for the specific round of the dispute. Can be called in parts.
     /// @param _disputeID The ID of the dispute.
     /// @param _round The appeal round.
     /// @param _iterations The number of iterations to run.
@@ -745,7 +745,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         }
     }
 
-    /// @dev Distribute the PNKs at stake and the dispute fees for the specific round of the dispute, penalties only.
+    /// @notice Distribute the PNKs at stake and the dispute fees for the specific round of the dispute, penalties only.
     /// @param _params The parameters for the execution, see `ExecuteParams`.
     /// @return pnkPenaltiesInRoundCache The updated penalties in round cache.
     function _executePenalties(ExecuteParams memory _params) internal returns (uint256) {
@@ -822,7 +822,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         return _params.pnkPenaltiesInRound;
     }
 
-    /// @dev Distribute the PNKs at stake and the dispute fees for the specific round of the dispute, rewards only.
+    /// @notice Distribute the PNKs at stake and the dispute fees for the specific round of the dispute, rewards only.
     /// @param _params The parameters for the execution, see `ExecuteParams`.
     function _executeRewards(ExecuteParams memory _params) internal {
         Dispute storage dispute = disputes[_params.disputeID];
@@ -911,7 +911,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         }
     }
 
-    /// @dev Executes a specified dispute's ruling.
+    /// @notice Executes a specified dispute's ruling.
     /// @param _disputeID The ID of the dispute.
     function executeRuling(uint256 _disputeID) external {
         Dispute storage dispute = disputes[_disputeID];
@@ -928,25 +928,18 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
     // *           Public Views            * //
     // ************************************* //
 
-    /// @dev Compute the cost of arbitration denominated in ETH.
-    ///      It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.
-    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).
-    /// @return cost The arbitration cost in ETH.
+    /// @inheritdoc IArbitratorV2
     function arbitrationCost(bytes memory _extraData) public view override returns (uint256 cost) {
         (uint96 courtID, uint256 minJurors, ) = _extraDataToCourtIDMinJurorsDisputeKit(_extraData);
         cost = courts[courtID].feeForJuror * minJurors;
     }
 
-    /// @dev Compute the cost of arbitration denominated in `_feeToken`.
-    ///      It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.
-    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).
-    /// @param _feeToken The ERC20 token used to pay fees.
-    /// @return cost The arbitration cost in `_feeToken`.
+    /// @inheritdoc IArbitratorV2
     function arbitrationCost(bytes calldata _extraData, IERC20 _feeToken) public view override returns (uint256 cost) {
         cost = convertEthToTokenAmount(_feeToken, arbitrationCost(_extraData));
     }
 
-    /// @dev Gets the cost of appealing a specified dispute.
+    /// @notice Gets the cost of appealing a specified dispute.
     /// @param _disputeID The ID of the dispute.
     /// @return cost The appeal cost.
     function appealCost(uint256 _disputeID) public view returns (uint256 cost) {
@@ -967,7 +960,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         }
     }
 
-    /// @dev Gets the start and the end of a specified dispute's current appeal period.
+    /// @notice Gets the start and the end of a specified dispute's current appeal period.
     /// @param _disputeID The ID of the dispute.
     /// @return start The start of the appeal period.
     /// @return end The end of the appeal period.
@@ -982,11 +975,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         }
     }
 
-    /// @dev Gets the current ruling of a specified dispute.
-    /// @param _disputeID The ID of the dispute.
-    /// @return ruling The current ruling.
-    /// @return tied Whether it's a tie or not.
-    /// @return overridden Whether the ruling was overridden by appeal funding or not.
+    /// @inheritdoc IArbitratorV2
     function currentRuling(uint256 _disputeID) public view returns (uint256 ruling, bool tied, bool overridden) {
         Dispute storage dispute = disputes[_disputeID];
         Round storage round = dispute.rounds[dispute.rounds.length - 1];
@@ -994,7 +983,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         (ruling, tied, overridden) = disputeKit.currentRuling(_disputeID);
     }
 
-    /// @dev Gets the round info for a specified dispute and round.
+    /// @notice Gets the round info for a specified dispute and round.
     /// @dev This function must not be called from a non-view function because it returns a dynamic array which might be very large, theoretically exceeding the block gas limit.
     /// @param _disputeID The ID of the dispute.
     /// @param _round The round to get the info for.
@@ -1003,7 +992,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         return disputes[_disputeID].rounds[_round];
     }
 
-    /// @dev Gets the PNK at stake per juror for a specified dispute and round.
+    /// @notice Gets the PNK at stake per juror for a specified dispute and round.
     /// @param _disputeID The ID of the dispute.
     /// @param _round The round to get the info for.
     /// @return pnkAtStakePerJuror The PNK at stake per juror.
@@ -1011,14 +1000,14 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         return disputes[_disputeID].rounds[_round].pnkAtStakePerJuror;
     }
 
-    /// @dev Gets the number of rounds for a specified dispute.
+    /// @notice Gets the number of rounds for a specified dispute.
     /// @param _disputeID The ID of the dispute.
     /// @return The number of rounds.
     function getNumberOfRounds(uint256 _disputeID) external view returns (uint256) {
         return disputes[_disputeID].rounds.length;
     }
 
-    /// @dev Checks if a given dispute kit is supported by a given court.
+    /// @notice Checks if a given dispute kit is supported by a given court.
     /// @param _courtID The ID of the court to check the support for.
     /// @param _disputeKitID The ID of the dispute kit to check the support for.
     /// @return Whether the dispute kit is supported or not.
@@ -1026,7 +1015,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         return courts[_courtID].supportedDisputeKits[_disputeKitID];
     }
 
-    /// @dev Gets the timesPerPeriod array for a given court.
+    /// @notice Gets the timesPerPeriod array for a given court.
     /// @param _courtID The ID of the court to get the times from.
     /// @return timesPerPeriod The timesPerPeriod array for the given court.
     function getTimesPerPeriod(uint96 _courtID) external view returns (uint256[4] memory timesPerPeriod) {
@@ -1037,14 +1026,14 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
     // *   Public Views for Dispute Kits   * //
     // ************************************* //
 
-    /// @dev Gets the number of votes permitted for the specified dispute in the latest round.
+    /// @notice Gets the number of votes permitted for the specified dispute in the latest round.
     /// @param _disputeID The ID of the dispute.
     function getNumberOfVotes(uint256 _disputeID) external view returns (uint256) {
         Dispute storage dispute = disputes[_disputeID];
         return dispute.rounds[dispute.rounds.length - 1].nbVotes;
     }
 
-    /// @dev Returns true if the dispute kit will be switched to a parent DK.
+    /// @notice Returns true if the dispute kit will be switched to a parent DK.
     /// @param _disputeID The ID of the dispute.
     /// @return Whether DK will be switched or not.
     function isDisputeKitJumping(uint256 _disputeID) external view returns (bool) {
@@ -1072,7 +1061,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
     // *            Internal               * //
     // ************************************* //
 
-    /// @dev Toggles the dispute kit support for a given court.
+    /// @notice Toggles the dispute kit support for a given court.
     /// @param _courtID The ID of the court to toggle the support for.
     /// @param _disputeKitID The ID of the dispute kit to toggle the support for.
     /// @param _enable Whether to enable or disable the support. Note that classic dispute kit should always be enabled.
@@ -1081,7 +1070,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         emit DisputeKitEnabled(_courtID, _disputeKitID, _enable);
     }
 
-    /// @dev If called only once then set _onError to Revert, otherwise set it to Return
+    /// @notice If called only once then set _onError to Revert, otherwise set it to Return
     /// @param _account The account to set the stake for.
     /// @param _courtID The ID of the court to set the stake for.
     /// @param _newStake The new stake.
@@ -1130,7 +1119,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         return true;
     }
 
-    /// @dev It may revert depending on the _onError parameter.
+    /// @notice It may revert depending on the _onError parameter.
     function _stakingFailed(OnError _onError, StakingResult _result) internal pure virtual {
         if (_onError == OnError.Return) return;
         if (_result == StakingResult.StakingTransferFailed) revert StakingTransferFailed();
@@ -1141,8 +1130,8 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         if (_result == StakingResult.CannotStakeZeroWhenNoStake) revert StakingZeroWhenNoStake();
     }
 
-    /// @dev Gets a court ID, the minimum number of jurors and an ID of a dispute kit from a specified extra data bytes array.
-    /// Note that if extradata contains an incorrect value then this value will be switched to default.
+    /// @notice Gets a court ID, the minimum number of jurors and an ID of a dispute kit from a specified extra data bytes array.
+    /// @dev If `_extraData` contains an incorrect value then this value will be switched to default.
     /// @param _extraData The extra data bytes array. The first 32 bytes are the court ID, the next are the minimum number of jurors and the last are the dispute kit ID.
     /// @return courtID The court ID.
     /// @return minJurors The minimum number of jurors required.
diff --git a/contracts/src/arbitration/university/SortitionModuleUniversity.sol b/contracts/src/arbitration/university/SortitionModuleUniversity.sol
index 0af8317e2..c1c1cd076 100644
--- a/contracts/src/arbitration/university/SortitionModuleUniversity.sol
+++ b/contracts/src/arbitration/university/SortitionModuleUniversity.sol
@@ -10,7 +10,7 @@ import "../../proxy/Initializable.sol";
 import "../../libraries/Constants.sol";
 
 /// @title SortitionModuleUniversity
-/// @dev An adapted version of the SortitionModule contract for educational purposes.
+/// @notice An adapted version of the SortitionModule contract for educational purposes.
 contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable, Initializable {
     string public constant override version = "2.0.0";
 
@@ -52,12 +52,12 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
     /// @param _unlock Whether the stake is locked or unlocked.
     event StakeLocked(address indexed _address, uint256 _relativeAmount, bool _unlock);
 
-    /// @dev Emitted when leftover PNK is available.
+    /// @notice Emitted when leftover PNK is available.
     /// @param _account The account of the juror.
     /// @param _amount The amount of PNK available.
     event LeftoverPNK(address indexed _account, uint256 _amount);
 
-    /// @dev Emitted when leftover PNK is withdrawn.
+    /// @notice Emitted when leftover PNK is withdrawn.
     /// @param _account The account of the juror withdrawing PNK.
     /// @param _amount The amount of PNK withdrawn.
     event LeftoverPNKWithdrawn(address indexed _account, uint256 _amount);
@@ -85,7 +85,7 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
         _disableInitializers();
     }
 
-    /// @dev Initializer (constructor equivalent for upgradable contracts).
+    /// @notice Initializer (constructor equivalent for upgradable contracts).
     /// @param _core The KlerosCore.
     function initialize(address _owner, KlerosCoreUniversity _core) external initializer {
         owner = _owner;
@@ -108,38 +108,37 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
     // *         State Modifiers           * //
     // ************************************* //
 
+    /// @inheritdoc ISortitionModule
     function passPhase() external override onlyByCore {
         // NOP
     }
 
+    /// @inheritdoc ISortitionModule
     function executeDelayedStakes(uint256 _iterations) external override onlyByCore {
         // NOP
     }
 
+    /// @inheritdoc ISortitionModuleUniversity
     function setTransientJuror(address _juror) external override onlyByCore {
         transientJuror = _juror;
     }
 
+    /// @inheritdoc ISortitionModule
     function createTree(uint96 _courtID, bytes memory _extraData) external {
         // NOP
     }
 
+    /// @inheritdoc ISortitionModule
     function createDisputeHook(uint256 /*_disputeID*/, uint256 /*_roundID*/) external override onlyByCore {
         disputesWithoutJurors++;
     }
 
+    /// @inheritdoc ISortitionModule
     function postDrawHook(uint256 /*_disputeID*/, uint256 /*_roundID*/) external override onlyByCore {
         disputesWithoutJurors--;
     }
 
-    /// @dev Validate the specified juror's new stake for a court.
-    /// Note: no state changes should be made when returning stakingResult != Successful, otherwise delayed stakes might break invariants.
-    /// @param _account The address of the juror.
-    /// @param _courtID The ID of the court.
-    /// @param _newStake The new stake.
-    /// @return pnkDeposit The amount of PNK to be deposited.
-    /// @return pnkWithdrawal The amount of PNK to be withdrawn.
-    /// @return stakingResult The result of the staking operation.
+    /// @inheritdoc ISortitionModule
     function validateStake(
         address _account,
         uint96 _courtID,
@@ -177,17 +176,7 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
         return (pnkDeposit, pnkWithdrawal, StakingResult.Successful);
     }
 
-    /// @dev Update the state of the stakes, called by KC at the end of setStake flow.
-    /// `O(n + p * log_k(j))` where
-    /// `n` is the number of courts the juror has staked in,
-    /// `p` is the depth of the court tree,
-    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
-    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
-    /// @param _account The address of the juror.
-    /// @param _courtID The ID of the court.
-    /// @param _pnkDeposit The amount of PNK to be deposited.
-    /// @param _pnkWithdrawal The amount of PNK to be withdrawn.
-    /// @param _newStake The new stake.
+    /// @inheritdoc ISortitionModule
     function setStake(
         address _account,
         uint96 _courtID,
@@ -222,15 +211,7 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
         newCourtStake = _stakeOf(_account, _courtID); // updated by _setStake()
     }
 
-    /// @dev Update the state of the stakes with a PNK reward deposit, called by KC during rewards execution.
-    /// `O(n + p * log_k(j))` where
-    /// `n` is the number of courts the juror has staked in,
-    /// `p` is the depth of the court tree,
-    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
-    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
-    /// @param _account The address of the juror.
-    /// @param _courtID The ID of the court.
-    /// @param _reward The amount of PNK to be deposited as a reward.
+    /// @inheritdoc ISortitionModule
     function setStakeReward(
         address _account,
         uint96 _courtID,
@@ -300,13 +281,7 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
         emit StakeLocked(_account, _relativeAmount, true);
     }
 
-    /// @dev Unstakes the inactive juror from all courts.
-    /// `O(n * (p * log_k(j)) )` where
-    /// `n` is the number of courts the juror has staked in,
-    /// `p` is the depth of the court tree,
-    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
-    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
-    /// @param _account The juror to unstake.
+    /// @inheritdoc ISortitionModule
     function forcedUnstakeAllCourts(address _account) external override onlyByCore {
         uint96[] memory courtIDs = getJurorCourtIDs(_account);
         for (uint256 j = courtIDs.length; j > 0; j--) {
@@ -314,24 +289,12 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
         }
     }
 
-    /// @dev Unstakes the inactive juror from a specific court.
-    /// `O(n * (p * log_k(j)) )` where
-    /// `n` is the number of courts the juror has staked in,
-    /// `p` is the depth of the court tree,
-    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,
-    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.
-    /// @param _account The juror to unstake.
-    /// @param _courtID The ID of the court.
+    /// @inheritdoc ISortitionModule
     function forcedUnstake(address _account, uint96 _courtID) external override onlyByCore {
         core.setStakeBySortitionModule(_account, _courtID, 0);
     }
 
-    /// @dev Gives back the locked PNKs in case the juror fully unstaked earlier.
-    /// Note that since locked and staked PNK are async it is possible for the juror to have positive staked PNK balance
-    /// while having 0 stake in courts and 0 locked tokens (eg. when the juror fully unstaked during dispute and later got his tokens unlocked).
-    /// In this case the juror can use this function to withdraw the leftover tokens.
-    /// Also note that if the juror has some leftover PNK while not fully unstaked he'll have to manually unstake from all courts to trigger this function.
-    /// @param _account The juror whose PNK to withdraw.
+    /// @inheritdoc ISortitionModule
     function withdrawLeftoverPNK(address _account) external override {
         // Can withdraw the leftover PNK if fully unstaked, has no tokens locked and has positive balance.
         // This withdrawal can't be triggered by calling setStake() in KlerosCore because current stake is technically 0, thus it is done via separate function.
@@ -346,22 +309,12 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
     // *           Public Views            * //
     // ************************************* //
 
-    /// @dev Draw an ID from a tree using a number.
-    /// Note that this function reverts if the sum of all values in the tree is 0.
-    /// @return drawnAddress The drawn address.
+    /// @inheritdoc ISortitionModule
     function draw(uint96, uint256, uint256) public view override returns (address drawnAddress, uint96 fromSubcourtID) {
         drawnAddress = transientJuror;
     }
 
-    /// @dev Gets the stake of a juror in a court.
-    /// Warning: `O(n)` complexity where `n` is the number of courts the juror has staked in
-    /// but acceptable for this educational implementation.
-    /// @param _juror The address of the juror.
-    /// @param _courtID The ID of the court.
-    /// @return totalStaked The total amount of tokens staked by the juror in the court.
-    /// @return totalLocked The total amount of tokens locked by the juror in the court.
-    /// @return stakedInCourt The amount of tokens staked by the juror in the court.
-    /// @return nbCourts The number of courts the juror has staked in.
+    /// @inheritdoc ISortitionModule
     function getJurorBalance(
         address _juror,
         uint96 _courtID
@@ -383,16 +336,17 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
         }
     }
 
-    /// @dev Gets the court identifiers where a specific `_juror` has staked.
-    /// @param _juror The address of the juror.
+    /// @inheritdoc ISortitionModule
     function getJurorCourtIDs(address _juror) public view override returns (uint96[] memory) {
         return jurors[_juror].courtIDs;
     }
 
+    /// @inheritdoc ISortitionModule
     function isJurorStaked(address _juror) external view override returns (bool) {
         return jurors[_juror].stakedPnk > 0;
     }
 
+    /// @inheritdoc ISortitionModule
     function getJurorLeftoverPNK(address _juror) public view override returns (uint256) {
         Juror storage juror = jurors[_juror];
         if (juror.courtIDs.length == 0 && juror.lockedPnk == 0) {
@@ -405,9 +359,11 @@ contract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable,
     // *            Internal               * //
     // ************************************* //
 
-    /// @dev Gets the stake of a juror in a court.
-    /// Warning: `O(n)` complexity where `n` is the number of courts the juror has staked in
+    /// @notice Gets the stake of a juror in a court.
+    ///
+    /// @dev Warning: `O(n)` complexity where `n` is the number of courts the juror has staked in
     /// but acceptable for this educational implementation.
+    ///
     /// @param _juror The address of the juror.
     /// @param _courtID The ID of the court.
     /// @return stakedInCourt The amount of tokens staked by the juror in the court.
diff --git a/contracts/src/arbitration/view/KlerosCoreSnapshotProxy.sol b/contracts/src/arbitration/view/KlerosCoreSnapshotProxy.sol
index 70c3c77ce..82f5b90ac 100644
--- a/contracts/src/arbitration/view/KlerosCoreSnapshotProxy.sol
+++ b/contracts/src/arbitration/view/KlerosCoreSnapshotProxy.sol
@@ -9,7 +9,7 @@ interface IKlerosCore {
 }
 
 /// @title KlerosCoreSnapshotProxy
-/// Proxy contract for V2 that exposes staked PNK with balanceOf() function for Snapshot voting.
+/// @notice Proxy contract for V2 that exposes staked PNK with balanceOf() function for Snapshot voting.
 contract KlerosCoreSnapshotProxy {
     // ************************************* //
     // *         State Modifiers           * //
@@ -34,7 +34,7 @@ contract KlerosCoreSnapshotProxy {
     // *         Constructor               * //
     // ************************************* //
 
-    /// @dev Constructor
+    /// @notice Constructor
     /// @param _owner The owner of the contract.
     /// @param _core KlerosCore to read the balance from.
     constructor(address _owner, IKlerosCore _core) {
@@ -46,13 +46,13 @@ contract KlerosCoreSnapshotProxy {
     // *             Governance            * //
     // ************************************* //
 
-    /// @dev Changes the `owner` storage variable.
+    /// @notice Changes the `owner` storage variable.
     /// @param _owner The new value for the `owner` storage variable.
     function changeOwner(address _owner) external onlyByOwner {
         owner = _owner;
     }
 
-    /// @dev Changes the `core` storage variable.
+    /// @notice Changes the `core` storage variable.
     /// @param _core The new value for the `core` storage variable.
     function changeCore(IKlerosCore _core) external onlyByOwner {
         core = _core;
@@ -62,8 +62,8 @@ contract KlerosCoreSnapshotProxy {
     // *           Public Views            * //
     // ************************************* //
 
-    /// @dev Returns the amount of PNK staked in KlerosV2 for a particular address.
-    /// Note: Proxy doesn't need to differentiate between courts so we pass 0 as courtID.
+    /// @notice Returns the amount of PNK staked in KlerosV2 for a particular address.
+    /// @dev Proxy doesn't need to differentiate between courts so we pass 0 as courtID.
     /// @param _account The address to query.
     /// @return totalStaked Total amount staked in V2 by the address.
     function balanceOf(address _account) external view returns (uint256 totalStaked) {
diff --git a/contracts/src/gateway/ForeignGateway.sol b/contracts/src/gateway/ForeignGateway.sol
index 366f3e6f0..76f17bb4e 100644
--- a/contracts/src/gateway/ForeignGateway.sol
+++ b/contracts/src/gateway/ForeignGateway.sol
@@ -7,8 +7,8 @@ import "../proxy/UUPSProxiable.sol";
 import "../proxy/Initializable.sol";
 import "../libraries/Constants.sol";
 
-/// Foreign Gateway
-/// Counterpart of `HomeGateway`
+/// @title Foreign Gateway
+/// @notice Counterpart of `HomeGateway`
 contract ForeignGateway is IForeignGateway, UUPSProxiable, Initializable {
     string public constant override version = "0.8.0";
 
@@ -71,7 +71,7 @@ contract ForeignGateway is IForeignGateway, UUPSProxiable, Initializable {
         _disableInitializers();
     }
 
-    /// @dev Constructs the `PolicyRegistry` contract.
+    /// @notice Constructs the `PolicyRegistry` contract.
     /// @param _owner The owner's address.
     /// @param _veaOutbox The address of the VeaOutbox.
     /// @param _homeChainID The chainID of the home chain.
@@ -101,14 +101,14 @@ contract ForeignGateway is IForeignGateway, UUPSProxiable, Initializable {
         // NOP
     }
 
-    /// @dev Changes the owner.
+    /// @notice Changes the owner.
     /// @param _owner The address of the new owner.
     function changeOwner(address _owner) external {
         if (owner != msg.sender) revert OwnerOnly();
         owner = _owner;
     }
 
-    /// @dev Changes the outbox.
+    /// @notice Changes the outbox.
     /// @param _veaOutbox The address of the new outbox.
     /// @param _gracePeriod The duration to accept messages from the deprecated bridge (if at all).
     function changeVea(address _veaOutbox, uint256 _gracePeriod) external onlyByOwner {
@@ -118,14 +118,14 @@ contract ForeignGateway is IForeignGateway, UUPSProxiable, Initializable {
         veaOutbox = _veaOutbox;
     }
 
-    /// @dev Changes the home gateway.
+    /// @notice Changes the home gateway.
     /// @param _homeGateway The address of the new home gateway.
     function changeHomeGateway(address _homeGateway) external {
         if (owner != msg.sender) revert OwnerOnly();
         homeGateway = _homeGateway;
     }
 
-    /// @dev Changes the `feeForJuror` property value of a specified court.
+    /// @notice Changes the `feeForJuror` property value of a specified court.
     /// @param _courtID The ID of the court on the v2 arbitrator. Not to be confused with the courtID on KlerosLiquid.
     /// @param _feeForJuror The new value for the `feeForJuror` property value.
     function changeCourtJurorFee(uint96 _courtID, uint256 _feeForJuror) external onlyByOwner {
diff --git a/contracts/src/gateway/HomeGateway.sol b/contracts/src/gateway/HomeGateway.sol
index e8cf0509b..19a2e4337 100644
--- a/contracts/src/gateway/HomeGateway.sol
+++ b/contracts/src/gateway/HomeGateway.sol
@@ -9,8 +9,8 @@ import "../libraries/Constants.sol";
 import "../proxy/UUPSProxiable.sol";
 import "../proxy/Initializable.sol";
 
-/// Home Gateway
-/// Counterpart of `ForeignGateway`
+/// @title Home Gateway
+/// @notice Counterpart of `ForeignGateway`
 contract HomeGateway is IHomeGateway, UUPSProxiable, Initializable {
     using SafeERC20 for IERC20;
 
@@ -43,7 +43,7 @@ contract HomeGateway is IHomeGateway, UUPSProxiable, Initializable {
     // *        Function Modifiers         * //
     // ************************************* //
 
-    /// @dev Requires that the sender is the owner.
+    /// @notice Requires that the sender is the owner.
     modifier onlyByOwner() {
         if (owner != msg.sender) revert OwnerOnly();
         _;
@@ -58,7 +58,7 @@ contract HomeGateway is IHomeGateway, UUPSProxiable, Initializable {
         _disableInitializers();
     }
 
-    /// @dev Constructs the `PolicyRegistry` contract.
+    /// @notice Constructs the `PolicyRegistry` contract.
     /// @param _owner The owner's address.
     /// @param _arbitrator The address of the arbitrator.
     /// @param _veaInbox The address of the vea inbox.
@@ -93,31 +93,31 @@ contract HomeGateway is IHomeGateway, UUPSProxiable, Initializable {
         // NOP
     }
 
-    /// @dev Changes the owner.
+    /// @notice Changes the owner.
     /// @param _owner The address of the new owner.
     function changeOwner(address _owner) external onlyByOwner {
         owner = _owner;
     }
 
-    /// @dev Changes the arbitrator.
+    /// @notice Changes the arbitrator.
     /// @param _arbitrator The address of the new arbitrator.
     function changeArbitrator(IArbitratorV2 _arbitrator) external onlyByOwner {
         arbitrator = _arbitrator;
     }
 
-    /// @dev Changes the vea inbox, useful to increase the claim deposit.
+    /// @notice Changes the vea inbox, useful to increase the claim deposit.
     /// @param _veaInbox The address of the new vea inbox.
     function changeVea(IVeaInbox _veaInbox) external onlyByOwner {
         veaInbox = _veaInbox;
     }
 
-    /// @dev Changes the foreign gateway.
+    /// @notice Changes the foreign gateway.
     /// @param _foreignGateway The address of the new foreign gateway.
     function changeForeignGateway(address _foreignGateway) external onlyByOwner {
         foreignGateway = _foreignGateway;
     }
 
-    /// @dev Changes the fee token.
+    /// @notice Changes the fee token.
     /// @param _feeToken The address of the new fee token.
     function changeFeeToken(IERC20 _feeToken) external onlyByOwner {
         feeToken = _feeToken;
diff --git a/contracts/src/gateway/interfaces/IForeignGateway.sol b/contracts/src/gateway/interfaces/IForeignGateway.sol
index 49f51e5de..845713440 100644
--- a/contracts/src/gateway/interfaces/IForeignGateway.sol
+++ b/contracts/src/gateway/interfaces/IForeignGateway.sol
@@ -5,8 +5,13 @@ pragma solidity >=0.8.0 <0.9.0;
 import "../../arbitration/interfaces/IArbitratorV2.sol";
 import "@kleros/vea-contracts/src/interfaces/gateways/IReceiverGateway.sol";
 
+/// @title Foreign Gateway Interface
 interface IForeignGateway is IArbitratorV2, IReceiverGateway {
-    /// @dev To be emitted when a dispute is sent to the IHomeGateway.
+    // ************************************* //
+    // *              Events               * //
+    // ************************************* //
+
+    /// @notice To be emitted when a dispute is sent to the IHomeGateway.
     /// @param _foreignBlockHash foreignBlockHash
     /// @param _foreignArbitrable The address of the Arbitrable contract.
     /// @param _foreignDisputeID The identifier of the dispute in the Arbitrable contract.
@@ -20,20 +25,35 @@ interface IForeignGateway is IArbitratorV2, IReceiverGateway {
         bytes _extraData
     );
 
-    /// Relay the rule call from the home gateway to the arbitrable.
+    // ************************************* //
+    // *         State Modifiers           * //
+    // ************************************* //
+
+    /// @notice Relay the rule call from the home gateway to the arbitrable.
+    /// @param _messageSender The address of the message sender.
+    /// @param _disputeHash The dispute hash.
+    /// @param _ruling The ruling.
+    /// @param _forwarder The address of the forwarder.
     function relayRule(address _messageSender, bytes32 _disputeHash, uint256 _ruling, address _forwarder) external;
 
-    /// Reimburses the dispute fees to the relayer who paid for these fees on the home chain.
+    /// @notice Reimburses the dispute fees to the relayer who paid for these fees on the home chain.
     /// @param _disputeHash The dispute hash for which to withdraw the fees.
     function withdrawFees(bytes32 _disputeHash) external;
 
-    /// @dev Looks up the local foreign disputeID for a disputeHash
-    /// @param _disputeHash dispute hash
+    // ************************************* //
+    // *           Public Views            * //
+    // ************************************* //
+
+    /// @notice Looks up the local foreign disputeID for a disputeHash
+    /// @param _disputeHash The dispute hash.
+    /// @return The local foreign disputeID.
     function disputeHashToForeignID(bytes32 _disputeHash) external view returns (uint256);
 
+    /// @notice Home chain identifier.
     /// @return The chain ID where the corresponding home gateway is deployed.
     function homeChainID() external view returns (uint256);
 
+    /// @notice Home gateway address.
     /// @return The address of the corresponding home gateway.
     function homeGateway() external view returns (address);
 }
diff --git a/contracts/src/gateway/interfaces/IHomeGateway.sol b/contracts/src/gateway/interfaces/IHomeGateway.sol
index d895759ae..407d7b1ce 100644
--- a/contracts/src/gateway/interfaces/IHomeGateway.sol
+++ b/contracts/src/gateway/interfaces/IHomeGateway.sol
@@ -6,8 +6,13 @@ import "@openzeppelin/contracts/token/ERC20/IERC20.sol";
 import "@kleros/vea-contracts/src/interfaces/gateways/ISenderGateway.sol";
 import "../../arbitration/interfaces/IArbitrableV2.sol";
 
+/// @title Home Gateway Interface
 interface IHomeGateway is IArbitrableV2, ISenderGateway {
-    /// @dev To be emitted when a dispute is received from the IForeignGateway.
+    // ************************************* //
+    // *              Events               * //
+    // ************************************* //
+
+    /// @notice To be emitted when a dispute is received from the IForeignGateway.
     /// @param _arbitrator The arbitrator of the contract.
     /// @param _arbitrableChainId The chain identifier where the Arbitrable contract is deployed.
     /// @param _arbitrable The address of the Arbitrable contract.
@@ -24,6 +29,10 @@ interface IHomeGateway is IArbitrableV2, ISenderGateway {
         uint256 _templateId
     );
 
+    // ************************************* //
+    // *         Enums / Structs           * //
+    // ************************************* //
+
     // Workaround stack too deep for relayCreateDispute()
     struct RelayCreateDisputeParams {
         bytes32 foreignBlockHash;
@@ -36,29 +45,44 @@ interface IHomeGateway is IArbitrableV2, ISenderGateway {
         bytes extraData;
     }
 
-    /// @dev Relays a dispute creation from the ForeignGateway to the home arbitrator using the same parameters as the ones on the foreign chain.
-    ///      Providing incorrect parameters will create a different hash than on the foreignChain and will not affect the actual dispute/arbitrable's ruling.
-    ///      This function accepts the fees payment in the native currency of the home chain, typically ETH.
+    // ************************************* //
+    // *         State Modifiers           * //
+    // ************************************* //
+
+    /// @notice Relays a dispute creation from the ForeignGateway to the home arbitrator using the same parameters as the ones on the foreign chain.
+    ///
+    /// @dev Providing incorrect parameters will create a different hash than on the foreignChain and will not affect the actual dispute/arbitrable's ruling.
+    /// This function accepts the fees payment in the native currency of the home chain, typically ETH.
+    ///
     /// @param _params The parameters of the dispute, see `RelayCreateDisputeParams`.
     function relayCreateDispute(RelayCreateDisputeParams memory _params) external payable;
 
-    /// @dev Relays a dispute creation from the ForeignGateway to the home arbitrator using the same parameters as the ones on the foreign chain.
-    ///      Providing incorrect parameters will create a different hash than on the foreignChain and will not affect the actual dispute/arbitrable's ruling.
-    ///      This function accepts the fees payment in the ERC20 `acceptedFeeToken()`.
+    /// @notice Relays a dispute creation from the ForeignGateway to the home arbitrator using the same parameters as the ones on the foreign chain.
+    ///
+    /// @dev Providing incorrect parameters will create a different hash than on the foreignChain and will not affect the actual dispute/arbitrable's ruling.
+    /// This function accepts the fees payment in the ERC20 `acceptedFeeToken()`.
+    ///
     /// @param _params The parameters of the dispute, see `RelayCreateDisputeParams`.
     function relayCreateDispute(RelayCreateDisputeParams memory _params, uint256 _feeAmount) external;
 
-    /// @dev Looks up the local home disputeID for a disputeHash
+    // ************************************* //
+    // *           Public Views            * //
+    // ************************************* //
+
+    /// @notice Looks up the local home disputeID for a disputeHash
     /// @param _disputeHash dispute hash
     /// @return disputeID dispute identifier on the home chain
     function disputeHashToHomeID(bytes32 _disputeHash) external view returns (uint256);
 
+    /// @notice Foreign chain identifier.
     /// @return The chain ID where the corresponding foreign gateway is deployed.
     function foreignChainID() external view returns (uint256);
 
+    /// @notice Foreign gateway address.
     /// @return The address of the corresponding foreign gateway.
     function foreignGateway() external view returns (address);
 
-    /// return The fee token.
+    /// @notice Fee token.
+    /// @return The fee token.
     function feeToken() external view returns (IERC20);
 }
diff --git a/contracts/src/libraries/SafeERC20.sol b/contracts/src/libraries/SafeERC20.sol
index 35f538350..35d1401f9 100644
--- a/contracts/src/libraries/SafeERC20.sol
+++ b/contracts/src/libraries/SafeERC20.sol
@@ -6,14 +6,16 @@ pragma solidity ^0.8.24;
 import "@openzeppelin/contracts/token/ERC20/IERC20.sol";
 
 /// @title SafeERC20
-/// @dev Wrappers around ERC20 operations that throw on failure (when the token
-/// contract returns false). Tokens that return no value (and instead revert or
-/// throw on failure) are also supported, non-reverting calls are assumed to be
-/// successful.
+///
+/// @notice Wrappers around ERC20 operations
+///
+/// @dev Throws on failure (when the token contract returns false).
+/// Tokens that return no value (and instead revert or throw on failure) are also supported.
+/// Non-reverting calls are assumed to be successful.
 /// To use this library you can add a `using SafeERC20 for IERC20;` statement to your contract,
 /// which allows you to call the safe operations as `token.safeTransfer(...)`, etc.
 library SafeERC20 {
-    /// @dev Increases the allowance granted to `spender` by the caller.
+    /// @notice Increases the allowance granted to `spender` by the caller.
     /// @param _token Token to transfer.
     /// @param _spender The address which will spend the funds.
     /// @param _addedValue The amount of tokens to increase the allowance by.
@@ -22,7 +24,7 @@ library SafeERC20 {
         return true;
     }
 
-    /// @dev Calls transfer() without reverting.
+    /// @notice Calls transfer() without reverting.
     /// @param _token Token to transfer.
     /// @param _to Recipient address.
     /// @param _value Amount transferred.
@@ -32,7 +34,7 @@ library SafeERC20 {
         return (success && (data.length == 0 || abi.decode(data, (bool))));
     }
 
-    /// @dev Calls transferFrom() without reverting.
+    /// @notice Calls transferFrom() without reverting.
     /// @param _token Token to transfer.
     /// @param _from Sender address.
     /// @param _to Recipient address.
diff --git a/contracts/src/libraries/SortitionTrees.sol b/contracts/src/libraries/SortitionTrees.sol
index f8d9706fe..b6db48e20 100644
--- a/contracts/src/libraries/SortitionTrees.sol
+++ b/contracts/src/libraries/SortitionTrees.sol
@@ -29,7 +29,7 @@ library SortitionTrees {
     // *         State Modifiers           * //
     // ************************************* //
 
-    /// @dev Create a sortition sum tree at the specified key.
+    /// @notice Create a sortition sum tree at the specified key.
     /// @param _trees The mapping of sortition sum trees.
     /// @param _key The key of the new tree.
     /// @param _k The maximum number of children per node.
@@ -41,15 +41,17 @@ library SortitionTrees {
         tree.nodes.push(0);
     }
 
-    /// @dev Draw an ID from a tree using a number.
-    /// Note that this function reverts if the sum of all values in the tree is 0.
+    /// @notice Draw an ID from a tree using a number.
+    ///
+    /// @dev This function reverts if the sum of all values in the tree is 0.
+    /// `O(k * log_k(n))` where
+    /// `k` is the maximum number of children per node in the tree,
+    ///  and `n` is the maximum number of nodes ever appended.
+    ///
     /// @param _tree The sortition sum tree.
     /// @param _coreDisputeID Index of the dispute in Kleros Core.
     /// @param _nonce Nonce to hash with random number.
     /// @return drawnAddress The drawn address.
-    /// `O(k * log_k(n))` where
-    /// `k` is the maximum number of children per node in the tree,
-    ///  and `n` is the maximum number of nodes ever appended.
     function draw(
         Tree storage _tree,
         uint256 _coreDisputeID,
@@ -86,13 +88,15 @@ library SortitionTrees {
         (drawnAddress, fromSubcourtID) = toAccountAndCourtID(stakePathID);
     }
 
-    /// @dev Set a value in a tree.
+    /// @notice Set a value in a tree.
+    ///
+    /// @dev `O(log_k(n))` where
+    /// `k` is the maximum number of children per node in the tree,
+    ///  and `n` is the maximum number of nodes ever appended.
+    ///
     /// @param _tree The sortition sum tree.
     /// @param _value The new value.
     /// @param _stakePathID The ID of the value.
-    /// `O(log_k(n))` where
-    /// `k` is the maximum number of children per node in the tree,
-    ///  and `n` is the maximum number of nodes ever appended.
     function set(Tree storage _tree, uint256 _value, bytes32 _stakePathID) internal {
         uint256 treeIndex = _tree.IDsToNodeIndexes[_stakePathID];
 
@@ -164,14 +168,16 @@ library SortitionTrees {
         }
     }
 
-    /// @dev Update all the parents of a node.
+    /// @notice Update all the parents of a node.
+    ///
+    /// @dev `O(log_k(n))` where
+    /// `k` is the maximum number of children per node in the tree,
+    ///  and `n` is the maximum number of nodes ever appended.
+    ///
     /// @param _tree The sortition sum tree.
     /// @param _treeIndex The index of the node to start from.
     /// @param _plusOrMinus Whether to add (true) or substract (false).
     /// @param _value The value to add or substract.
-    /// `O(log_k(n))` where
-    /// `k` is the maximum number of children per node in the tree,
-    ///  and `n` is the maximum number of nodes ever appended.
     function updateParents(Tree storage _tree, uint256 _treeIndex, bool _plusOrMinus, uint256 _value) private {
         uint256 parentIndex = _treeIndex;
         while (parentIndex != 0) {
@@ -186,7 +192,7 @@ library SortitionTrees {
     // *           Public Views            * //
     // ************************************* //
 
-    /// @dev Get the stake of a juror in a court.
+    /// @notice Get the stake of a juror in a court.
     /// @param _tree The sortition sum tree.
     /// @param _stakePathID The stake path ID, corresponding to a juror.
     /// @return The stake of the juror in the court.
@@ -198,7 +204,8 @@ library SortitionTrees {
         return _tree.nodes[treeIndex];
     }
 
-    /// @dev Packs an account and a court ID into a stake path ID: [20 bytes of address][12 bytes of courtID] = 32 bytes total.
+    /// @notice Packs an account and a court ID into a stake path ID
+    /// @dev [20 bytes of address][12 bytes of courtID] = 32 bytes total.
     /// @param _account The address of the juror to pack.
     /// @param _courtID The court ID to pack.
     /// @return stakePathID The stake path ID.
@@ -210,7 +217,7 @@ library SortitionTrees {
         }
     }
 
-    /// @dev Retrieves both juror's address and court ID from the stake path ID.
+    /// @notice Retrieves both juror's address and court ID from the stake path ID.
     /// @param _stakePathID The stake path ID to unpack.
     /// @return account The account.
     /// @return courtID The court ID.
diff --git a/contracts/src/proxy/UUPSProxiable.sol b/contracts/src/proxy/UUPSProxiable.sol
index 34504f686..57e28b3a1 100644
--- a/contracts/src/proxy/UUPSProxiable.sol
+++ b/contracts/src/proxy/UUPSProxiable.sol
@@ -4,7 +4,8 @@ pragma solidity ^0.8.24;
 
 /// @title UUPS Proxiable
 /// @author Simon Malatrait <simon.malatrait@grenoble-inp.org>
-/// @dev This contract implements an upgradeability mechanism designed for UUPS proxies.
+/// @notice This contract implements an upgradeability mechanism designed for UUPS proxies.
+///
 /// @dev Adapted from <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/utils/UUPSUpgradeable.sol>
 /// The functions included here can perform an upgrade of an UUPS Proxy, when this contract is set as the implementation behind such a proxy.
 ///
@@ -21,7 +22,7 @@ abstract contract UUPSProxiable {
     // *             Event                 * //
     // ************************************* //
 
-    /// @dev Emitted when the `implementation` has been successfully upgraded.
+    /// @notice Emitted when the `implementation` has been successfully upgraded.
     /// @param newImplementation Address of the new implementation the proxy is now forwarding calls to.
     event Upgraded(address indexed newImplementation);
 
@@ -29,13 +30,13 @@ abstract contract UUPSProxiable {
     // *             Error                 * //
     // ************************************* //
 
-    /// @dev The call is from an unauthorized context.
+    /// @notice The call is from an unauthorized context.
     error UUPSUnauthorizedCallContext();
 
-    /// @dev The storage `slot` is unsupported as a UUID.
+    /// @notice The storage `slot` is unsupported as a UUID.
     error UUPSUnsupportedProxiableUUID(bytes32 slot);
 
-    /// @dev The `implementation` is not UUPS-compliant
+    /// @notice The `implementation` is not UUPS-compliant
     error InvalidImplementation(address implementation);
 
     /// Failed Delegated call
@@ -68,7 +69,7 @@ abstract contract UUPSProxiable {
     // *         State Modifiers           * //
     // ************************************* //
 
-    /// @dev Upgrade mechanism including access control and UUPS-compliance.
+    /// @notice Upgrade mechanism including access control and UUPS-compliance.
     /// @param newImplementation Address of the new implementation contract.
     /// @param data Data used in a delegate call to `newImplementation` if non-empty. This will typically be an encoded
     /// function call, and allows initializing the storage of the proxy like a Solidity constructor.
@@ -110,10 +111,10 @@ abstract contract UUPSProxiable {
     // *           Public Views            * //
     // ************************************* //
 
-    /// @dev Implementation of the ERC1822 `proxiableUUID` function. This returns the storage slot used by the
+    /// @notice Implementation of the ERC1822 `proxiableUUID` function. This returns the storage slot used by the
     /// implementation. It is used to validate the implementation's compatibility when performing an upgrade.
     ///
-    /// IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks
+    /// @dev IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks
     /// bricking a proxy that upgrades to it, by delegating to itself until out of gas. Thus it is critical that this
     /// function revert if invoked through a proxy. This is guaranteed by the if statement.
     function proxiableUUID() external view virtual returns (bytes32) {
@@ -124,7 +125,7 @@ abstract contract UUPSProxiable {
         return IMPLEMENTATION_SLOT;
     }
 
-    /// @dev Returns the version of the implementation.
+    /// @notice Returns the version of the implementation.
     /// @return Version string.
     function version() external view virtual returns (string memory);
 
diff --git a/contracts/src/proxy/UUPSProxy.sol b/contracts/src/proxy/UUPSProxy.sol
index 4f190158d..328b0381a 100644
--- a/contracts/src/proxy/UUPSProxy.sol
+++ b/contracts/src/proxy/UUPSProxy.sol
@@ -4,10 +4,11 @@ pragma solidity ^0.8.24;
 
 /// @title UUPS Proxy
 /// @author Simon Malatrait <simon.malatrait@grenoble-inp.org>
-/// @dev This contract implements a UUPS Proxy compliant with ERC-1967 & ERC-1822.
+/// @notice This contract implements a UUPS Proxy compliant with ERC-1967 & ERC-1822.
+///
 /// @dev This contract delegates all calls to another contract (UUPS Proxiable) through a fallback function and the use of the `delegatecall` EVM instruction.
-/// @dev We refer to the Proxiable contract (as per ERC-1822) with `implementation`.
-/// @dev Adapted from <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/ERC1967/ERC1967Proxy.sol>
+/// We refer to the Proxiable contract (as per ERC-1822) with `implementation`.
+/// Adapted from <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/ERC1967/ERC1967Proxy.sol>
 contract UUPSProxy {
     /// @dev Storage slot with the address of the current implementation.
     /// This is the keccak-256 hash of "eip1967.proxy.implementation" subtracted by 1, and is
@@ -19,9 +20,9 @@ contract UUPSProxy {
     // *            Constructor            * //
     // ************************************* //
 
-    /// @dev Initializes the upgradeable proxy with an initial implementation specified by `_implementation`.
-    /// If `_data` is nonempty, it's used as data in a delegate call to `_implementation`. This will typically be an encoded
-    /// function call, and allows initializing the storage of the proxy like a Solidity constructor.
+    /// @notice Initializes the upgradeable proxy with an initial implementation specified by `_implementation`.
+    /// @dev If `_data` is nonempty, it's used as data in a delegate call to `_implementation`.
+    /// This will typically be an encoded function call, and allows initializing the storage of the proxy like a Solidity constructor.
     constructor(address _implementation, bytes memory _data) {
         assembly {
             sstore(IMPLEMENTATION_SLOT, _implementation)
diff --git a/contracts/src/rng/BlockhashRNG.sol b/contracts/src/rng/BlockhashRNG.sol
index d104780f4..f6cfc3f90 100644
--- a/contracts/src/rng/BlockhashRNG.sol
+++ b/contracts/src/rng/BlockhashRNG.sol
@@ -5,11 +5,11 @@ pragma solidity ^0.8.24;
 import "./IRNG.sol";
 
 /// @title Random Number Generator using blockhash with fallback.
-/// @dev
-///  Random Number Generator returning the blockhash with a fallback behaviour.
-///  On L2 like Arbitrum block production is sporadic so block timestamp is more reliable than block number.
-///  Returns 0 when no random number is available.
-///  Allows saving the random number for use in the future. It allows the contract to retrieve the blockhash even after the time window.
+/// @notice Random Number Generator returning the blockhash with a fallback behaviour.
+///
+/// @dev On L2 like Arbitrum block production is sporadic so block timestamp is more reliable than block number.
+/// Returns 0 when no random number is available.
+/// Allows saving the random number for use in the future. It allows the contract to retrieve the blockhash even after the time window.
 contract BlockHashRNG is IRNG {
     // ************************************* //
     // *             Storage               * //
@@ -39,7 +39,7 @@ contract BlockHashRNG is IRNG {
     // *            Constructor            * //
     // ************************************* //
 
-    /// @dev Constructor.
+    /// @notice Constructor.
     /// @param _owner The Owner of the contract.
     /// @param _consumer The address that can request random numbers.
     /// @param _lookaheadTime The time lookahead in seconds for the random number.
@@ -53,13 +53,13 @@ contract BlockHashRNG is IRNG {
     // *             Governance            * //
     // ************************************* //
 
-    /// @dev Changes the owner of the contract.
+    /// @notice Changes the owner of the contract.
     /// @param _owner The new owner.
     function changeOwner(address _owner) external onlyByOwner {
         owner = _owner;
     }
 
-    /// @dev Changes the consumer of the RNG.
+    /// @notice Changes the consumer of the RNG.
     /// @param _consumer The new consumer.
     function changeConsumer(address _consumer) external onlyByOwner {
         consumer = _consumer;
@@ -69,12 +69,13 @@ contract BlockHashRNG is IRNG {
     // *         State Modifiers           * //
     // ************************************* //
 
-    /// @dev Request a random number.
+    /// @notice Request a random number.
     function requestRandomness() external override onlyByConsumer {
         requestTimestamp = block.timestamp;
     }
 
-    /// @dev Return the random number. If it has not been saved and is still computable compute it.
+    /// @notice Return the random number.
+    /// @dev If it has not been saved and is still computable compute it.
     /// @return randomNumber The random number or 0 if it is not ready or has not been requested.
     function receiveRandomness() external override onlyByConsumer returns (uint256 randomNumber) {
         if (requestTimestamp == 0) return 0; // No requests were made yet.
@@ -104,14 +105,14 @@ contract BlockHashRNG is IRNG {
     // *             View Functions        * //
     // ************************************* //
 
-    /// @dev Check if randomness is ready to be received.
+    /// @notice Check if randomness is ready to be received.
     /// @return ready True if randomness can be received.
     function isRandomnessReady() external view returns (bool ready) {
         if (requestTimestamp == 0) return false; // No requests were made yet.
         return block.timestamp >= requestTimestamp + lookaheadTime;
     }
 
-    /// @dev Get the timestamp when randomness will be ready.
+    /// @notice Get the timestamp when randomness will be ready.
     /// @return readyTimestamp The timestamp when randomness will be available.
     function getRandomnessReadyTimestamp() external view returns (uint256 readyTimestamp) {
         if (requestTimestamp == 0) return 0; // No requests were made yet.
diff --git a/contracts/src/rng/ChainlinkRNG.sol b/contracts/src/rng/ChainlinkRNG.sol
index 744bc5248..b493bfc0d 100644
--- a/contracts/src/rng/ChainlinkRNG.sol
+++ b/contracts/src/rng/ChainlinkRNG.sol
@@ -8,7 +8,7 @@ import {VRFV2PlusClient} from "@chainlink/contracts/src/v0.8/vrf/dev/libraries/V
 import "./IRNG.sol";
 
 /// @title Random Number Generator that uses Chainlink VRF v2.5
-/// https://blog.chain.link/introducing-vrf-v2-5/
+/// @dev https://blog.chain.link/introducing-vrf-v2-5/
 contract ChainlinkRNG is IRNG, VRFConsumerBaseV2Plus {
     // ************************************* //
     // *             Storage               * //
@@ -27,7 +27,7 @@ contract ChainlinkRNG is IRNG, VRFConsumerBaseV2Plus {
     // *              Events               * //
     // ************************************* //
 
-    /// @dev Emitted when a request is sent to the VRF Coordinator
+    /// @notice Emitted when a request is sent to the VRF Coordinator
     /// @param _requestId The ID of the request
     event RequestSent(uint256 indexed _requestId);
 
@@ -54,7 +54,7 @@ contract ChainlinkRNG is IRNG, VRFConsumerBaseV2Plus {
     // *            Constructor            * //
     // ************************************* //
 
-    /// @dev Constructor, initializing the implementation to reduce attack surface.
+    /// @notice Constructor, initializing the implementation to reduce attack surface.
     /// @param _owner The owner of the contract.
     /// @param _consumer The address that can request random numbers.
     /// @param _vrfCoordinator The address of the VRFCoordinator contract.
@@ -83,44 +83,44 @@ contract ChainlinkRNG is IRNG, VRFConsumerBaseV2Plus {
     // *             Governance            * //
     // ************************************* //
 
-    /// @dev Changes the owner of the contract.
+    /// @notice Changes the owner of the contract.
     /// @param _owner The new owner.
     function changeOwner(address _owner) external onlyByOwner {
         owner = _owner;
     }
 
-    /// @dev Changes the consumer of the RNG.
+    /// @notice Changes the consumer of the RNG.
     /// @param _consumer The new consumer.
     function changeConsumer(address _consumer) external onlyByOwner {
         consumer = _consumer;
     }
 
-    /// @dev Changes the VRF Coordinator of the contract.
+    /// @notice Changes the VRF Coordinator of the contract.
     /// @param _vrfCoordinator The new VRF Coordinator.
     function changeVrfCoordinator(address _vrfCoordinator) external onlyByOwner {
         s_vrfCoordinator = IVRFCoordinatorV2Plus(_vrfCoordinator);
         emit CoordinatorSet(_vrfCoordinator);
     }
 
-    /// @dev Changes the key hash of the contract.
+    /// @notice Changes the key hash of the contract.
     /// @param _keyHash The new key hash.
     function changeKeyHash(bytes32 _keyHash) external onlyByOwner {
         keyHash = _keyHash;
     }
 
-    /// @dev Changes the subscription ID of the contract.
+    /// @notice Changes the subscription ID of the contract.
     /// @param _subscriptionId The new subscription ID.
     function changeSubscriptionId(uint256 _subscriptionId) external onlyByOwner {
         subscriptionId = _subscriptionId;
     }
 
-    /// @dev Changes the request confirmations of the contract.
+    /// @notice Changes the request confirmations of the contract.
     /// @param _requestConfirmations The new request confirmations.
     function changeRequestConfirmations(uint16 _requestConfirmations) external onlyByOwner {
         requestConfirmations = _requestConfirmations;
     }
 
-    /// @dev Changes the callback gas limit of the contract.
+    /// @notice Changes the callback gas limit of the contract.
     /// @param _callbackGasLimit The new callback gas limit.
     function changeCallbackGasLimit(uint32 _callbackGasLimit) external onlyByOwner {
         callbackGasLimit = _callbackGasLimit;
@@ -130,7 +130,8 @@ contract ChainlinkRNG is IRNG, VRFConsumerBaseV2Plus {
     // *         State Modifiers           * //
     // ************************************* //
 
-    /// @dev Request a random number. Consumer only.
+    /// @notice Request a random number.
+    /// @dev Consumer only.
     function requestRandomness() external override onlyByConsumer {
         // Will revert if subscription is not set and funded.
         uint256 requestId = s_vrfCoordinator.requestRandomWords(
@@ -150,7 +151,7 @@ contract ChainlinkRNG is IRNG, VRFConsumerBaseV2Plus {
         emit RequestSent(requestId);
     }
 
-    /// @dev Callback function called by the VRF Coordinator when the random value is generated.
+    /// @notice Callback function called by the VRF Coordinator when the random value is generated.
     /// @param _requestId The ID of the request.
     /// @param _randomWords The random values answering the request.
     function fulfillRandomWords(uint256 _requestId, uint256[] calldata _randomWords) internal override {
@@ -163,7 +164,7 @@ contract ChainlinkRNG is IRNG, VRFConsumerBaseV2Plus {
     // *           Public Views            * //
     // ************************************* //
 
-    /// @dev Return the random number.
+    /// @notice Return the random number.
     /// @return randomNumber The random number or 0 if it is not ready or has not been requested.
     function receiveRandomness() external view override returns (uint256 randomNumber) {
         randomNumber = randomNumbers[lastRequestId];
diff --git a/contracts/src/rng/IRNG.sol b/contracts/src/rng/IRNG.sol
index c407b763f..4945a80af 100644
--- a/contracts/src/rng/IRNG.sol
+++ b/contracts/src/rng/IRNG.sol
@@ -4,13 +4,21 @@ pragma solidity >=0.8.0 <0.9.0;
 
 /// @title Random Number Generator interface
 interface IRNG {
-    /// @dev Request a random number.
+    // ************************************* //
+    // *         State Modifiers           * //
+    // ************************************* //
+
+    /// @notice Request a random number.
     function requestRandomness() external;
 
-    /// @dev Receive the random number.
+    /// @notice Receive the random number.
     /// @return randomNumber Random number or 0 if not available
     function receiveRandomness() external returns (uint256 randomNumber);
 
+    // ************************************* //
+    // *              Errors               * //
+    // ************************************* //
+
     error OwnerOnly();
     error ConsumerOnly();
 }
diff --git a/contracts/src/rng/IRandomizer.sol b/contracts/src/rng/IRandomizer.sol
index 6a6296f82..875d5b574 100644
--- a/contracts/src/rng/IRandomizer.sol
+++ b/contracts/src/rng/IRandomizer.sol
@@ -2,7 +2,7 @@
 
 pragma solidity >=0.8.0 <0.9.0;
 
-// Randomizer protocol interface
+// @title Randomizer protocol interface
 interface IRandomizer {
     function request(uint256 callbackGasLimit) external returns (uint256);
 
diff --git a/contracts/src/rng/IncrementalNG.sol b/contracts/src/rng/IncrementalNG.sol
index 542090e71..7f6170244 100644
--- a/contracts/src/rng/IncrementalNG.sol
+++ b/contracts/src/rng/IncrementalNG.sol
@@ -13,12 +13,12 @@ contract IncrementalNG is IRNG {
         number = _start;
     }
 
-    /// @dev Request a random number.
+    /// @notice Request a random number.
     function requestRandomness() external override {
         // nop
     }
 
-    /// @dev Get the "random number" (which is always the same).
+    /// @notice Get the "random number" (which is always the same).
     /// @return randomNumber The random number or 0 if it is not ready or has not been requested.
     function receiveRandomness() external override returns (uint256 randomNumber) {
         unchecked {
diff --git a/contracts/src/rng/RNGWithFallback.sol b/contracts/src/rng/RNGWithFallback.sol
index 8501d4db9..30c84ea4c 100644
--- a/contracts/src/rng/RNGWithFallback.sol
+++ b/contracts/src/rng/RNGWithFallback.sol
@@ -27,6 +27,7 @@ contract RNGWithFallback is IRNG {
     // *            Constructor            * //
     // ************************************* //
 
+    /// @notice Constructor
     /// @param _owner Owner address
     /// @param _consumer Consumer address
     /// @param _fallbackTimeoutSeconds Time in seconds to wait before falling back to next RNG
@@ -58,19 +59,19 @@ contract RNGWithFallback is IRNG {
     // *         Governance Functions      * //
     // ************************************* //
 
-    /// @dev Change the owner
+    /// @notice Change the owner
     /// @param _newOwner Address of the new owner
     function changeOwner(address _newOwner) external onlyByOwner {
         owner = _newOwner;
     }
 
-    /// @dev Change the consumer
+    /// @notice Change the consumer
     /// @param _consumer Address of the new consumer
     function changeConsumer(address _consumer) external onlyByOwner {
         consumer = _consumer;
     }
 
-    /// @dev Change the fallback timeout
+    /// @notice Change the fallback timeout
     /// @param _fallbackTimeoutSeconds New timeout in seconds
     function changeFallbackTimeout(uint256 _fallbackTimeoutSeconds) external onlyByOwner {
         fallbackTimeoutSeconds = _fallbackTimeoutSeconds;
@@ -81,14 +82,14 @@ contract RNGWithFallback is IRNG {
     // *         State Modifiers          * //
     // ************************************* //
 
-    /// @dev Request a random number from the primary RNG
+    /// @notice Request a random number from the primary RNG
     /// @dev The consumer is trusted not to make concurrent requests.
     function requestRandomness() external override onlyByConsumer {
         requestTimestamp = block.timestamp;
         rng.requestRandomness();
     }
 
-    /// @dev Receive the random number from the primary RNG with fallback to the blockhash RNG if the primary RNG does not respond passed a timeout.
+    /// @notice Receive the random number from the primary RNG with fallback to the blockhash RNG if the primary RNG does not respond passed a timeout.
     /// @return randomNumber Random number or 0 if not available
     function receiveRandomness() external override onlyByConsumer returns (uint256 randomNumber) {
         randomNumber = rng.receiveRandomness();
diff --git a/contracts/src/rng/RandomizerRNG.sol b/contracts/src/rng/RandomizerRNG.sol
index 648ce5c3d..2107702bd 100644
--- a/contracts/src/rng/RandomizerRNG.sol
+++ b/contracts/src/rng/RandomizerRNG.sol
@@ -23,7 +23,7 @@ contract RandomizerRNG is IRNG {
     // *              Events               * //
     // ************************************* //
 
-    /// @dev Emitted when a request is sent to the VRF Coordinator
+    /// @notice Emitted when a request is sent to the VRF Coordinator
     /// @param requestId The ID of the request
     event RequestSent(uint256 indexed requestId);
 
@@ -50,7 +50,7 @@ contract RandomizerRNG is IRNG {
     // *            Constructor            * //
     // ************************************* //
 
-    /// @dev Constructor
+    /// @notice Constructor
     /// @param _owner The Owner of the contract.
     /// @param _consumer The address that can request random numbers.
     /// @param _randomizer The Randomizer.ai oracle contract.
@@ -65,31 +65,31 @@ contract RandomizerRNG is IRNG {
     // *      Governance      * //
     // ************************ //
 
-    /// @dev Changes the owner of the contract.
+    /// @notice Changes the owner of the contract.
     /// @param _owner The new owner.
     function changeOwner(address _owner) external onlyByOwner {
         owner = _owner;
     }
 
-    /// @dev Changes the consumer of the RNG.
+    /// @notice Changes the consumer of the RNG.
     /// @param _consumer The new consumer.
     function changeConsumer(address _consumer) external onlyByOwner {
         consumer = _consumer;
     }
 
-    /// @dev Change the Randomizer callback gas limit.
+    /// @notice Change the Randomizer callback gas limit.
     /// @param _callbackGasLimit the new limit.
     function setCallbackGasLimit(uint256 _callbackGasLimit) external onlyByOwner {
         callbackGasLimit = _callbackGasLimit;
     }
 
-    /// @dev Change the Randomizer address.
+    /// @notice Change the Randomizer address.
     /// @param _randomizer the new Randomizer address.
     function setRandomizer(address _randomizer) external onlyByOwner {
         randomizer = IRandomizer(_randomizer);
     }
 
-    /// @dev Allows the owner to withdraw randomizer funds.
+    /// @notice Allows the owner to withdraw randomizer funds.
     /// @param _amount Amount to withdraw in wei.
     function randomizerWithdraw(uint256 _amount) external onlyByOwner {
         randomizer.clientWithdrawTo(msg.sender, _amount);
@@ -99,14 +99,15 @@ contract RandomizerRNG is IRNG {
     // *         State Modifiers           * //
     // ************************************* //
 
-    /// @dev Request a random number. Consumer only.
+    /// @notice Request a random number.
+    /// @dev Consumer only.
     function requestRandomness() external override onlyByConsumer {
         uint256 requestId = randomizer.request(callbackGasLimit);
         lastRequestId = requestId;
         emit RequestSent(requestId);
     }
 
-    /// @dev Callback function called by the randomizer contract when the random value is generated.
+    /// @notice Callback function called by the randomizer contract when the random value is generated.
     /// @param _id The ID of the request.
     /// @param _value The random value answering the request.
     function randomizerCallback(uint256 _id, bytes32 _value) external {
@@ -119,7 +120,7 @@ contract RandomizerRNG is IRNG {
     // *           Public Views            * //
     // ************************************* //
 
-    /// @dev Return the random number.
+    /// @notice Return the random number.
     /// @return randomNumber The random number or 0 if it is not ready or has not been requested.
     function receiveRandomness() external view override returns (uint256 randomNumber) {
         randomNumber = randomNumbers[lastRequestId];
diff --git a/contracts/src/utils/TransactionBatcher.sol b/contracts/src/utils/TransactionBatcher.sol
index e4f85a5bb..bb6d25b23 100644
--- a/contracts/src/utils/TransactionBatcher.sol
+++ b/contracts/src/utils/TransactionBatcher.sol
@@ -3,7 +3,12 @@ pragma solidity ^0.8.0;
 
 // Adapted from https://github.com/daostack/web3-transaction-batcher/blob/1b88d2ea062f8f2d9fdfdf9bbe85d2bbef780151/contracts/Batcher.sol
 
+/// @title Transaction Batcher
 contract TransactionBatcher {
+    /// @notice Batch send transactions, all the calls must succeed.
+    /// @param targets The targets of the calls.
+    /// @param values The values of the calls.
+    /// @param datas The datas of the calls.
     function batchSend(address[] memory targets, uint256[] memory values, bytes[] memory datas) public payable {
         for (uint256 i = 0; i < targets.length; i++) {
             (bool success, ) = targets[i].call{value: values[i]}(datas[i]);
@@ -11,6 +16,10 @@ contract TransactionBatcher {
         }
     }
 
+    /// @notice Batch send transactions WITHOUT reverting on call failure.
+    /// @param targets The targets of the calls.
+    /// @param values The values of the calls.
+    /// @param datas The datas of the calls.
     function batchSendUnchecked(
         address[] memory targets,
         uint256[] memory values,
diff --git a/foundry.toml b/foundry.toml
new file mode 100644
index 000000000..fad3d8b70
--- /dev/null
+++ b/foundry.toml
@@ -0,0 +1,12 @@
+# For `forge doc` only which requires running from the top-level folder
+[profile.default]
+solc = "0.8.30"
+evm_version = "cancun"
+via_ir = true
+optimizer = true
+optimizer_runs = 10000
+
+src = 'contracts/src'
+out = 'contracts/out'
+libs = ['./node_modules', 'contracts/lib']
+
diff --git a/package.json b/package.json
index 01e9468a1..6104cc7cc 100644
--- a/package.json
+++ b/package.json
@@ -87,7 +87,9 @@
     "postinstall": "yarn check-prerequisites; husky install",
     "reinstall": "YARN_CHECKSUM_BEHAVIOR=update yarn install --no-immutable",
     "build:web:ci": "yarn workspaces focus @kleros/kleros-v2-web && yarn workspaces foreach -Ap --include kleros-app --include contracts run build && yarn workspace @kleros/kleros-v2-web build-netlify",
-    "build:web-devtools:ci": "yarn workspaces focus @kleros/kleros-v2-web-devtools && yarn workspaces foreach -Ap --include contracts run build && yarn workspace @kleros/kleros-v2-web-devtools build-netlify"
+    "build:web-devtools:ci": "yarn workspaces focus @kleros/kleros-v2-web-devtools && yarn workspaces foreach -Ap --include contracts run build && yarn workspace @kleros/kleros-v2-web-devtools build-netlify",
+    "build:contract-docs": "forge doc --build --out contracts/dist",
+    "start:contract-docs": "forge doc --serve"
   },
   "alias": {
     "process": "process/browser.js",
diff --git a/remappings.txt b/remappings.txt
new file mode 100644
index 000000000..c54475ab1
--- /dev/null
+++ b/remappings.txt
@@ -0,0 +1,9 @@
+@ensdomains/=node_modules/@ensdomains/
+@openzeppelin/=node_modules/@openzeppelin/
+@kleros/=node_modules/@kleros/
+ds-test/=contracts/
+forge-std/=contracts/
+eth-gas-reporter/=node_modules/eth-gas-reporter/
+hardhat-deploy/=node_modules/hardhat-deploy/
+hardhat/=node_modules/hardhat/
+solmate/=contracts/lib/solmate/src/

From cfdb1f48c415b21dde5a07d839c4b9dd4ff7bf81 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 11 Sep 2025 01:57:08 +0100
Subject: [PATCH 122/175] chore: changelog

---
 contracts/CHANGELOG.md | 12 +++++++++++-
 1 file changed, 11 insertions(+), 1 deletion(-)

diff --git a/contracts/CHANGELOG.md b/contracts/CHANGELOG.md
index 2e61786fb..299b686d0 100644
--- a/contracts/CHANGELOG.md
+++ b/contracts/CHANGELOG.md
@@ -8,10 +8,11 @@ The format is based on [Common Changelog](https://common-changelog.org/).
 
 ### Changed
 
+- **Breaking:** Add event parameter `KlerosCore.TokenAndETHShift._degreeOfCoherencyFee` and renamed the other parameters to `_degreeOfCoherencyPnk`, `_amountPnk`, `_amountFee` ([#2097](https://github.com/kleros/kleros-v2/issues/2097))
+- **Breaking:** Move state variable `DisputeKitClassicBase.nbVotes` to the `Round` struct ([#2097](https://github.com/kleros/kleros-v2/issues/2097))
 - **Breaking:** Stake the juror's PNK rewards instead of transferring them out ([#2099](https://github.com/kleros/kleros-v2/issues/2099))
 - **Breaking:** Replace `require()` with `revert()` and custom errors outside KlerosCore for consistency and smaller bytecode ([#2084](https://github.com/kleros/kleros-v2/issues/2084))
 - **Breaking:** Rename the interface from `RNG` to `IRNG` ([#2054](https://github.com/kleros/kleros-v2/issues/2054))
-- **Breaking:** Remove the `_block` parameter from `IRNG.requestRandomness()` and `IRNG.receiveRandomness()`, not needed for the primary VRF-based RNG ([#2054](https://github.com/kleros/kleros-v2/issues/2054))
 - **Breaking:** Rename `governor` to `owner` in order to comply with the lightweight ownership standard [ERC-5313](https://eipsinsight.com/ercs/erc-5313) ([#2112](https://github.com/kleros/kleros-v2/issues/2112))
 - **Breaking:** Apply the penalties to the stakes in the Sortition Tree ([#2107](https://github.com/kleros/kleros-v2/issues/2107))
 - **Breaking:** Make `SortitionModule.getJurorBalance().stakedInCourt` include the penalties ([#2107](https://github.com/kleros/kleros-v2/issues/2107))
@@ -32,6 +33,8 @@ The format is based on [Common Changelog](https://common-changelog.org/).
 
 ### Added
 
+- **Breaking:** Add storage gap arrays to `KlerosCore` structs `Round`, `Dispute` and `Court` ([#2097](https://github.com/kleros/kleros-v2/issues/2097))
+- **Breaking:** Add storage gap arrays to `DisputeKitClassicBase` state variables and to the structs `Round`, `Dispute` and `Vote` ([#2097](https://github.com/kleros/kleros-v2/issues/2097))
 - **Breaking:** Add a new field `drawnJurorFromCourtIDs` to the `Round` struct in `KlerosCoreBase` and `KlerosCoreUniversity` ([#2107](https://github.com/kleros/kleros-v2/issues/2107))
 - **Breaking:** Add a new state variable `jumpDisputeKitID` to the `DisputeKitClassicBase` contract ([#2114](https://github.com/kleros/kleros-v2/issues/2114))
 - **Breaking:** Add a parameter `_recoveryCommit` to the event `DisputeKitShutter.CommitCastShutter` ([#2100](https://github.com/kleros/kleros-v2/issues/2100))
@@ -41,6 +44,13 @@ The format is based on [Common Changelog](https://common-changelog.org/).
 - Allow the dispute kits to specify which new dispute kit to use when a court jump occurs ([#2114](https://github.com/kleros/kleros-v2/issues/2114))
 - Allow stake changes to by-pass delayed stakes when initiated by the SortitionModule by setting the `_noDelay` parameter to `true` in `SortitionModule.validateStake()` ([#2107](https://github.com/kleros/kleros-v2/issues/2107))
 
+### Removed
+
+- **Breaking:** Remove unused event parameters `IArbitrableV2.DisputeRequest._templateUri` ([#2097](https://github.com/kleros/kleros-v2/issues/2097))
+- **Breaking:** Remove deprecated `SortitionModule` state variables `alreadyTransferred`, `randomNumberRequestBlock`, `rngLookahead` and `latestDelayedStakeIndex` ([#2097](https://github.com/kleros/kleros-v2/issues/2097))
+- **Breaking:** Remove struct variable `DisputeKitClassicBase.Round.nbVotes` ([#2097](https://github.com/kleros/kleros-v2/issues/2097))
+- **Breaking:** Remove the `_block` parameter from `IRNG.requestRandomness()` and `IRNG.receiveRandomness()`, not needed for the primary VRF-based RNG ([#2054](https://github.com/kleros/kleros-v2/issues/2054))
+
 ### Fixed
 
 - Do not pass to Voting period if all the commits are cast because it breaks the current Shutter auto-reveal process. ([#2085](https://github.com/kleros/kleros-v2/issues/2085))

From e7578d21a89ddacf70158a9ced0a1e7f6eec0893 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 10 Sep 2025 01:13:00 +0100
Subject: [PATCH 123/175] fix: do not emit TokenAndETHShift for zero amounts,
 no zero transfer

---
 contracts/src/arbitration/KlerosCore.sol      | 62 ++++++++++---------
 .../test/foundry/KlerosCore_Execution.t.sol   | 10 ---
 contracts/test/integration/index.ts           | 48 +++++++-------
 3 files changed, 60 insertions(+), 60 deletions(-)

diff --git a/contracts/src/arbitration/KlerosCore.sol b/contracts/src/arbitration/KlerosCore.sol
index fab1f2882..589da7c48 100644
--- a/contracts/src/arbitration/KlerosCore.sol
+++ b/contracts/src/arbitration/KlerosCore.sol
@@ -925,17 +925,19 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
             penalizedInCourtID,
             penalty
         );
-        _params.pnkPenaltiesInRound += availablePenalty;
-        emit TokenAndETHShift(
-            account,
-            _params.disputeID,
-            _params.round,
-            coherence,
-            0,
-            -int256(availablePenalty),
-            0,
-            round.feeToken
-        );
+        if (availablePenalty != 0) {
+            _params.pnkPenaltiesInRound += availablePenalty;
+            emit TokenAndETHShift(
+                account,
+                _params.disputeID,
+                _params.round,
+                coherence,
+                0,
+                -int256(availablePenalty),
+                0,
+                round.feeToken
+            );
+        }
 
         if (pnkBalance == 0 || !disputeKit.isVoteActive(_params.disputeID, _params.round, _params.repartition)) {
             // The juror is inactive or their balance is can't cover penalties anymore, unstake them from all courts.
@@ -996,24 +998,28 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         uint256 feeReward = _applyCoherence(round.totalFeesForJurors / _params.coherentCount, feeCoherence);
         round.sumFeeRewardPaid += feeReward;
 
-        // Transfer the fee reward
-        _transferFeeToken(round.feeToken, payable(account), feeReward);
-
-        // Stake the PNK reward if possible, bypasses delayed stakes and other checks done by validateStake()
-        if (!sortitionModule.setStakeReward(account, dispute.courtID, pnkReward)) {
-            pinakion.safeTransfer(account, pnkReward);
+        if (feeReward != 0) {
+            // Transfer the fee reward
+            _transferFeeToken(round.feeToken, payable(account), feeReward);
+        }
+        if (pnkReward != 0) {
+            // Stake the PNK reward if possible, bypasses delayed stakes and other checks done by validateStake()
+            if (!sortitionModule.setStakeReward(account, dispute.courtID, pnkReward)) {
+                pinakion.safeTransfer(account, pnkReward);
+            }
+        }
+        if (pnkReward != 0 || feeReward != 0) {
+            emit TokenAndETHShift(
+                account,
+                _params.disputeID,
+                _params.round,
+                pnkCoherence,
+                feeCoherence,
+                int256(pnkReward),
+                int256(feeReward),
+                round.feeToken
+            );
         }
-
-        emit TokenAndETHShift(
-            account,
-            _params.disputeID,
-            _params.round,
-            pnkCoherence,
-            feeCoherence,
-            int256(pnkReward),
-            int256(feeReward),
-            round.feeToken
-        );
 
         // Transfer any residual rewards to the owner. It may happen due to partial coherence of the jurors.
         if (_params.repartition == _params.numberOfVotesInRound * 2 - 1) {
diff --git a/contracts/test/foundry/KlerosCore_Execution.t.sol b/contracts/test/foundry/KlerosCore_Execution.t.sol
index 7681eff29..e0677b81a 100644
--- a/contracts/test/foundry/KlerosCore_Execution.t.sol
+++ b/contracts/test/foundry/KlerosCore_Execution.t.sol
@@ -103,12 +103,6 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
         // Check iterations for the winning staker to see the shifts
         vm.expectEmit(true, true, true, true);
         emit SortitionModule.StakeLocked(staker2, 0, true);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCore.TokenAndETHShift(staker2, disputeID, 0, 10000, 0, 0, 0, IERC20(address(0))); // penalties but amounts are 0
-        vm.expectEmit(true, true, true, true);
-        emit SortitionModule.StakeLocked(staker2, 0, true);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCore.TokenAndETHShift(staker2, disputeID, 0, 10000, 0, 0, 0, IERC20(address(0))); // penalties but amounts are 0
         core.execute(disputeID, 0, 3); // Do 3 iterations to check penalties first
 
         (uint256 totalStaked, uint256 totalLocked, , ) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
@@ -123,8 +117,6 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
 
         vm.expectEmit(true, true, true, true);
         emit SortitionModule.StakeLocked(staker1, 0, true);
-        vm.expectEmit(true, true, true, true);
-        emit KlerosCore.TokenAndETHShift(staker1, disputeID, 0, 0, 0, 0, 0, IERC20(address(0))); // rewards but amounts are 0
         // Check iterations for the winning staker to see the shifts
         vm.expectEmit(true, true, true, true);
         emit SortitionModule.StakeLocked(staker2, 1000, true);
@@ -538,8 +530,6 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
 
         // Check only once per penalty and per reward
         vm.expectEmit(true, true, true, true);
-        emit KlerosCore.TokenAndETHShift(staker1, disputeID, 0, 10000, 0, 0, 0, feeToken); // penalties but amounts are 0
-        vm.expectEmit(true, true, true, true);
         emit KlerosCore.TokenAndETHShift(staker1, disputeID, 0, 10000, 10000, 0, 0.06 ether, feeToken); // rewards
         core.execute(disputeID, 0, 6);
 
diff --git a/contracts/test/integration/index.ts b/contracts/test/integration/index.ts
index c8a656357..3884c9712 100644
--- a/contracts/test/integration/index.ts
+++ b/contracts/test/integration/index.ts
@@ -131,23 +131,23 @@ describe("Integration tests", async () => {
       throw new Error("Block hash is null - cannot calculate dispute hash");
     }
     // Relayer tx
-    const tx2 = await homeGateway
-      .connect(relayer)
-      ["relayCreateDispute((bytes32,uint256,address,uint256,uint256,uint256,uint256,bytes))"](
-        {
-          foreignBlockHash: ethers.toBeHex(lastBlock.hash),
-          foreignChainID: 31337,
-          foreignArbitrable: arbitrable.target,
-          foreignDisputeID: disputeId,
-          externalDisputeID: ethers.keccak256(ethers.toUtf8Bytes("future of france")),
-          templateId: 0,
-          choices: 2,
-          extraData: "0x00",
-        },
-        { value: arbitrationCost }
-      );
-    expect(tx2).to.emit(homeGateway, "DisputeRequest");
-    await tx2.wait();
+    await expect(
+      homeGateway
+        .connect(relayer)
+        ["relayCreateDispute((bytes32,uint256,address,uint256,uint256,uint256,uint256,bytes))"](
+          {
+            foreignBlockHash: ethers.toBeHex(lastBlock.hash),
+            foreignChainID: 31337,
+            foreignArbitrable: arbitrable.target,
+            foreignDisputeID: disputeId,
+            externalDisputeID: ethers.keccak256(ethers.toUtf8Bytes("future of france")),
+            templateId: 0,
+            choices: 2,
+            extraData: "0x00",
+          },
+          { value: arbitrationCost }
+        )
+    ).to.emit(homeGateway, "DisputeRequest");
 
     await network.provider.send("evm_increaseTime", [2000]); // Wait for minStakingTime
     await network.provider.send("evm_mine");
@@ -186,12 +186,16 @@ describe("Integration tests", async () => {
 
     await core.passPeriod(0);
     expect((await core.disputes(0)).period).to.equal(Period.execution);
-    expect(await core.execute(0, 0, 1000)).to.emit(core, "TokenAndETHShift");
-
-    const tx4 = await core.executeRuling(0, { gasLimit: 10000000, gasPrice: 5000000000 });
+    await expect(core.execute(0, 0, 1000))
+      .to.emit(core, "TokenAndETHShift")
+      .withArgs(deployer, 0, 0, 10000, 10000, 0, arbitrationCost / 3n, ethers.ZeroAddress);
+
+    await expect(core.executeRuling(0, { gasLimit: 10000000, gasPrice: 5000000000 }))
+      .to.emit(core, "Ruling")
+      .withArgs(homeGateway.target, 0, 0)
+      .and.to.emit(arbitrable, "Ruling")
+      .withArgs(foreignGateway.target, 1, 0); // The ForeignGateway starts counting disputeID from 1.
     console.log("Ruling executed on KlerosCore");
-    expect(tx4).to.emit(core, "Ruling").withArgs(homeGateway.target, 0, 0);
-    expect(tx4).to.emit(arbitrable, "Ruling").withArgs(foreignGateway.target, 1, 0); // The ForeignGateway starts counting disputeID from 1.
   });
 
   const mineBlocks = async (n: number) => {

From bd983ca666436c92de57b995f6354191f7d7ed1f Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 11 Sep 2025 02:11:37 +0100
Subject: [PATCH 124/175] chore: changelog

---
 contracts/CHANGELOG.md | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/contracts/CHANGELOG.md b/contracts/CHANGELOG.md
index 299b686d0..5b15e04f7 100644
--- a/contracts/CHANGELOG.md
+++ b/contracts/CHANGELOG.md
@@ -54,6 +54,8 @@ The format is based on [Common Changelog](https://common-changelog.org/).
 ### Fixed
 
 - Do not pass to Voting period if all the commits are cast because it breaks the current Shutter auto-reveal process. ([#2085](https://github.com/kleros/kleros-v2/issues/2085))
+- Do not emit the `KlerosCore.TokenAndETHShift` event if the both the PNK and fee amounts are zero ([#2135](https://github.com/kleros/kleros-v2/issues/2135))
+- Do not make PNK or ETH transfers if the amounts are zero ([#2135](https://github.com/kleros/kleros-v2/issues/2135))
 
 ## [0.12.0] - 2025-08-05
 

From f1dd5590ad122aa3a7dcf836eb942b61fe7c5562 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 11 Sep 2025 02:20:27 +0100
Subject: [PATCH 125/175] refactor: renamed event TokenAndEthShift into
 JurorRewardPenalty

---
 contracts/src/arbitration/KlerosCore.sol                  | 6 +++---
 contracts/src/arbitration/devtools/KlerosCoreRuler.sol    | 4 ++--
 .../src/arbitration/university/KlerosCoreUniversity.sol   | 6 +++---
 contracts/test/arbitration/ruler.ts                       | 6 +++---
 contracts/test/foundry/KlerosCore_Execution.t.sol         | 8 ++++----
 contracts/test/integration/index.ts                       | 2 +-
 6 files changed, 16 insertions(+), 16 deletions(-)

diff --git a/contracts/src/arbitration/KlerosCore.sol b/contracts/src/arbitration/KlerosCore.sol
index 589da7c48..08653e057 100644
--- a/contracts/src/arbitration/KlerosCore.sol
+++ b/contracts/src/arbitration/KlerosCore.sol
@@ -221,7 +221,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
     /// @param _amountPnk Amount of PNK shifted.
     /// @param _amountFee Amount of fee shifted.
     /// @param _feeToken Address of the fee token.
-    event TokenAndETHShift(
+    event JurorRewardPenalty(
         address indexed _account,
         uint256 indexed _disputeID,
         uint256 indexed _roundID,
@@ -927,7 +927,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         );
         if (availablePenalty != 0) {
             _params.pnkPenaltiesInRound += availablePenalty;
-            emit TokenAndETHShift(
+            emit JurorRewardPenalty(
                 account,
                 _params.disputeID,
                 _params.round,
@@ -1009,7 +1009,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
             }
         }
         if (pnkReward != 0 || feeReward != 0) {
-            emit TokenAndETHShift(
+            emit JurorRewardPenalty(
                 account,
                 _params.disputeID,
                 _params.round,
diff --git a/contracts/src/arbitration/devtools/KlerosCoreRuler.sol b/contracts/src/arbitration/devtools/KlerosCoreRuler.sol
index 4ea1be3ee..a12a87972 100644
--- a/contracts/src/arbitration/devtools/KlerosCoreRuler.sol
+++ b/contracts/src/arbitration/devtools/KlerosCoreRuler.sol
@@ -126,7 +126,7 @@ contract KlerosCoreRuler is IArbitratorV2, UUPSProxiable, Initializable {
         uint96 indexed _fromCourtID,
         uint96 _toCourtID
     );
-    event TokenAndETHShift(
+    event JurorRewardPenalty(
         address indexed _account,
         uint256 indexed _disputeID,
         uint256 indexed _roundID,
@@ -519,7 +519,7 @@ contract KlerosCoreRuler is IArbitratorV2, UUPSProxiable, Initializable {
             // The dispute fees were paid in ERC20
             round.feeToken.safeTransfer(account, feeReward);
         }
-        emit TokenAndETHShift(
+        emit JurorRewardPenalty(
             account,
             _disputeID,
             _round,
diff --git a/contracts/src/arbitration/university/KlerosCoreUniversity.sol b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
index 2a29a54be..bf27dfbb2 100644
--- a/contracts/src/arbitration/university/KlerosCoreUniversity.sol
+++ b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
@@ -144,7 +144,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         uint256 indexed _fromDisputeKitID,
         uint256 _toDisputeKitID
     );
-    event TokenAndETHShift(
+    event JurorRewardPenalty(
         address indexed _account,
         uint256 indexed _disputeID,
         uint256 indexed _roundID,
@@ -782,7 +782,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
             penalty
         );
         _params.pnkPenaltiesInRound += availablePenalty;
-        emit TokenAndETHShift(
+        emit JurorRewardPenalty(
             account,
             _params.disputeID,
             _params.round,
@@ -872,7 +872,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
             pinakion.safeTransfer(account, pnkReward);
         }
 
-        emit TokenAndETHShift(
+        emit JurorRewardPenalty(
             account,
             _params.disputeID,
             _params.round,
diff --git a/contracts/test/arbitration/ruler.ts b/contracts/test/arbitration/ruler.ts
index fef56ac8f..9defca63e 100644
--- a/contracts/test/arbitration/ruler.ts
+++ b/contracts/test/arbitration/ruler.ts
@@ -94,7 +94,7 @@ describe("KlerosCoreRuler", async () => {
       .withArgs(resolver.target, RulingMode.automaticRandom, disputeID, anyValue, anyValue, anyValue)
       .and.to.emit(core, "Ruling")
       .withArgs(resolver.target, disputeID, anyValue)
-      .and.to.emit(core, "TokenAndETHShift")
+      .and.to.emit(core, "JurorRewardPenalty")
       .withArgs(dev.address, disputeID, 0, 10000, 10000, 0, anyValue, ZeroAddress)
       .and.to.emit(resolver, "DisputeRequest")
       .withArgs(core.target, disputeID, localDisputeID, templateId)
@@ -118,7 +118,7 @@ describe("KlerosCoreRuler", async () => {
       .withArgs(resolver.target, RulingMode.automaticPreset, disputeID, 2, true, false)
       .and.to.emit(core, "Ruling")
       .withArgs(resolver.target, disputeID, 2)
-      .and.to.emit(core, "TokenAndETHShift")
+      .and.to.emit(core, "JurorRewardPenalty")
       .withArgs(dev.address, disputeID, 0, 10000, 10000, 0, anyValue, ZeroAddress)
       .and.to.emit(resolver, "DisputeRequest")
       .withArgs(core.target, disputeID, localDisputeID, templateId)
@@ -153,7 +153,7 @@ describe("KlerosCoreRuler", async () => {
       .withArgs(core.target, disputeID, 3);
 
     await expect(core.execute(disputeID, 0))
-      .and.to.emit(core, "TokenAndETHShift")
+      .and.to.emit(core, "JurorRewardPenalty")
       .withArgs(dev.address, disputeID, 0, 10000, 10000, 0, anyValue, ZeroAddress);
   });
 });
diff --git a/contracts/test/foundry/KlerosCore_Execution.t.sol b/contracts/test/foundry/KlerosCore_Execution.t.sol
index e0677b81a..c6f03ac49 100644
--- a/contracts/test/foundry/KlerosCore_Execution.t.sol
+++ b/contracts/test/foundry/KlerosCore_Execution.t.sol
@@ -99,7 +99,7 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
         vm.expectEmit(true, true, true, true);
         emit SortitionModule.StakeLocked(staker1, 1000, true);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCore.TokenAndETHShift(staker1, disputeID, 0, 0, 0, -int256(1000), 0, IERC20(address(0))); // penalties
+        emit KlerosCore.JurorRewardPenalty(staker1, disputeID, 0, 0, 0, -int256(1000), 0, IERC20(address(0))); // penalties
         // Check iterations for the winning staker to see the shifts
         vm.expectEmit(true, true, true, true);
         emit SortitionModule.StakeLocked(staker2, 0, true);
@@ -121,11 +121,11 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
         vm.expectEmit(true, true, true, true);
         emit SortitionModule.StakeLocked(staker2, 1000, true);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCore.TokenAndETHShift(staker2, disputeID, 0, 10000, 10000, 500, 0.045 ether, IERC20(address(0))); // rewards
+        emit KlerosCore.JurorRewardPenalty(staker2, disputeID, 0, 10000, 10000, 500, 0.045 ether, IERC20(address(0))); // rewards
         vm.expectEmit(true, true, true, true);
         emit SortitionModule.StakeLocked(staker2, 1000, true);
         vm.expectEmit(true, true, true, true);
-        emit KlerosCore.TokenAndETHShift(staker2, disputeID, 0, 10000, 10000, 500, 0.045 ether, IERC20(address(0))); // rewards
+        emit KlerosCore.JurorRewardPenalty(staker2, disputeID, 0, 10000, 10000, 500, 0.045 ether, IERC20(address(0))); // rewards
         core.execute(disputeID, 0, 10); // Finish the iterations. We need only 3 but check that it corrects the count.
 
         (, totalLocked, , ) = sortitionModule.getJurorBalance(staker2, GENERAL_COURT);
@@ -530,7 +530,7 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
 
         // Check only once per penalty and per reward
         vm.expectEmit(true, true, true, true);
-        emit KlerosCore.TokenAndETHShift(staker1, disputeID, 0, 10000, 10000, 0, 0.06 ether, feeToken); // rewards
+        emit KlerosCore.JurorRewardPenalty(staker1, disputeID, 0, 10000, 10000, 0, 0.06 ether, feeToken); // rewards
         core.execute(disputeID, 0, 6);
 
         KlerosCore.Round memory round = core.getRoundInfo(disputeID, 0);
diff --git a/contracts/test/integration/index.ts b/contracts/test/integration/index.ts
index 3884c9712..cc7dd2b13 100644
--- a/contracts/test/integration/index.ts
+++ b/contracts/test/integration/index.ts
@@ -187,7 +187,7 @@ describe("Integration tests", async () => {
     await core.passPeriod(0);
     expect((await core.disputes(0)).period).to.equal(Period.execution);
     await expect(core.execute(0, 0, 1000))
-      .to.emit(core, "TokenAndETHShift")
+      .to.emit(core, "JurorRewardPenalty")
       .withArgs(deployer, 0, 0, 10000, 10000, 0, arbitrationCost / 3n, ethers.ZeroAddress);
 
     await expect(core.executeRuling(0, { gasLimit: 10000000, gasPrice: 5000000000 }))

From fd465a43af32314c75b6712d55e45dbd01bcf770 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 11 Sep 2025 02:22:20 +0100
Subject: [PATCH 126/175] chore: changelog

---
 contracts/CHANGELOG.md | 1 +
 1 file changed, 1 insertion(+)

diff --git a/contracts/CHANGELOG.md b/contracts/CHANGELOG.md
index 5b15e04f7..11a24ebc9 100644
--- a/contracts/CHANGELOG.md
+++ b/contracts/CHANGELOG.md
@@ -8,6 +8,7 @@ The format is based on [Common Changelog](https://common-changelog.org/).
 
 ### Changed
 
+- **Breaking:** Rename `KlerosCore.TokenAndETHShift` into `KlerosCore.JurorRewardPenalty` ([#2136](https://github.com/kleros/kleros-v2/issues/2136))
 - **Breaking:** Add event parameter `KlerosCore.TokenAndETHShift._degreeOfCoherencyFee` and renamed the other parameters to `_degreeOfCoherencyPnk`, `_amountPnk`, `_amountFee` ([#2097](https://github.com/kleros/kleros-v2/issues/2097))
 - **Breaking:** Move state variable `DisputeKitClassicBase.nbVotes` to the `Round` struct ([#2097](https://github.com/kleros/kleros-v2/issues/2097))
 - **Breaking:** Stake the juror's PNK rewards instead of transferring them out ([#2099](https://github.com/kleros/kleros-v2/issues/2099))

From 41a5b772580cca37e8935a71e13705f28aaac5d6 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 11 Sep 2025 02:49:08 +0100
Subject: [PATCH 127/175] refactor: minor internal function rename

---
 contracts/src/arbitration/dispute-kits/DisputeKitGated.sol    | 4 ++--
 .../src/arbitration/dispute-kits/DisputeKitGatedShutter.sol   | 4 ++--
 contracts/test/arbitration/dispute-kit-gated.ts               | 2 +-
 3 files changed, 5 insertions(+), 5 deletions(-)

diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol b/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol
index 1cbf21df8..309f5c566 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol
@@ -76,7 +76,7 @@ contract DisputeKitGated is DisputeKitClassicBase {
     /// @return tokenGate The address of the token contract used for gating access.
     /// @return isERC1155 True if the token is an ERC-1155, false for ERC-20/ERC-721.
     /// @return tokenId The token ID for ERC-1155 tokens (ignored for ERC-20/ERC-721).
-    function extraDataToTokenInfo(
+    function _extraDataToTokenInfo(
         bytes memory _extraData
     ) public pure returns (address tokenGate, bool isERC1155, uint256 tokenId) {
         // Need at least 160 bytes to safely read the parameters
@@ -104,7 +104,7 @@ contract DisputeKitGated is DisputeKitClassicBase {
         // Get the local dispute and extract token info from extraData
         uint256 localDisputeID = coreDisputeIDToLocal[_coreDisputeID];
         Dispute storage dispute = disputes[localDisputeID];
-        (address tokenGate, bool isERC1155, uint256 tokenId) = extraDataToTokenInfo(dispute.extraData);
+        (address tokenGate, bool isERC1155, uint256 tokenId) = _extraDataToTokenInfo(dispute.extraData);
 
         // If no token gate is specified, allow all jurors
         if (tokenGate == address(0)) return true;
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
index b408e27a4..dbcde618c 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
@@ -209,7 +209,7 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
     /// @return tokenGate The address of the token contract used for gating access.
     /// @return isERC1155 True if the token is an ERC-1155, false for ERC-20/ERC-721.
     /// @return tokenId The token ID for ERC-1155 tokens (ignored for ERC-20/ERC-721).
-    function _extraDataToTokenInfo(
+    function __extraDataToTokenInfo(
         bytes memory _extraData
     ) internal pure returns (address tokenGate, bool isERC1155, uint256 tokenId) {
         // Need at least 160 bytes to safely read the parameters
@@ -237,7 +237,7 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
         // Get the local dispute and extract token info from extraData
         uint256 localDisputeID = coreDisputeIDToLocal[_coreDisputeID];
         Dispute storage dispute = disputes[localDisputeID];
-        (address tokenGate, bool isERC1155, uint256 tokenId) = _extraDataToTokenInfo(dispute.extraData);
+        (address tokenGate, bool isERC1155, uint256 tokenId) = __extraDataToTokenInfo(dispute.extraData);
 
         // If no token gate is specified, allow all jurors
         if (tokenGate == address(0)) return true;
diff --git a/contracts/test/arbitration/dispute-kit-gated.ts b/contracts/test/arbitration/dispute-kit-gated.ts
index b7336087c..a6db6e473 100644
--- a/contracts/test/arbitration/dispute-kit-gated.ts
+++ b/contracts/test/arbitration/dispute-kit-gated.ts
@@ -123,7 +123,7 @@ describe("DisputeKitGated", async () => {
     const extraData = encodeExtraData(courtId, minJurors, disputeKitId, tokenGate, isERC1155, tokenId);
     // console.log("extraData", extraData);
 
-    const tokenInfo = await disputeKitGated.extraDataToTokenInfo(extraData);
+    const tokenInfo = await disputeKitGated._extraDataToTokenInfo(extraData);
     expect(tokenInfo[0]).to.equal(tokenGate);
     expect(tokenInfo[1]).to.equal(isERC1155);
     expect(tokenInfo[2]).to.equal(tokenId);

From cbc111a9e55d89fa0b4f1297c6b6732f4841c07a Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 11 Sep 2025 03:27:26 +0100
Subject: [PATCH 128/175] chore: less optimizer iterations to shrink KlerosCore

---
 contracts/hardhat.config.ts | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/contracts/hardhat.config.ts b/contracts/hardhat.config.ts
index 9d8e9c49d..41a4fb63e 100644
--- a/contracts/hardhat.config.ts
+++ b/contracts/hardhat.config.ts
@@ -32,7 +32,7 @@ const config: HardhatUserConfig = {
           viaIR: process.env.VIA_IR !== "false", // Defaults to true
           optimizer: {
             enabled: true,
-            runs: 2000,
+            runs: 1000,
           },
           outputSelection: {
             "*": {

From 452246fe5aa2d6266c0932146f3e620f89378fb7 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Sat, 13 Sep 2025 00:16:23 +0100
Subject: [PATCH 129/175] chore: university contracts redeploy

---
 contracts/README.md                           |   11 +-
 .../00-home-chain-arbitration-university.ts   |   11 +-
 .../deployments/arbitrumSepoliaDevnet.ts      | 2882 ++++++++++++++---
 .../DisputeKitClassicUniversity.json          |  471 ++-
 ...teKitClassicUniversity_Implementation.json |  983 +++++-
 .../DisputeKitClassicUniversity_Proxy.json    |   45 +-
 .../DisputeResolverUniversity.json            |  189 +-
 .../DisputeTemplateRegistryUniversity.json    |  317 ++
 ...lateRegistryUniversity_Implementation.json |  445 +++
 ...sputeTemplateRegistryUniversity_Proxy.json |   81 +
 .../KlerosCoreUniversity.json                 |  360 +-
 .../KlerosCoreUniversity_Implementation.json  |  758 +++--
 .../KlerosCoreUniversity_Proxy.json           |   84 +-
 .../SortitionModuleUniversity.json            |  351 +-
 ...titionModuleUniversity_Implementation.json |  664 +++-
 .../SortitionModuleUniversity_Proxy.json      |   44 +-
 contracts/deployments/contractsEthers.ts      |    3 +-
 contracts/deployments/contractsViem.ts        |    3 +-
 contracts/deployments/devnet.viem.ts          | 1798 +++++++---
 contracts/scripts/utils/contracts.ts          |    3 +-
 contracts/scripts/utils/execution.ts          |    4 +-
 contracts/src/proxy/KlerosProxies.sol         |    4 +
 .../integration/getContractsEthers.test.ts    |    2 +-
 .../test/integration/getContractsViem.test.ts |    2 +-
 24 files changed, 7546 insertions(+), 1969 deletions(-)
 create mode 100644 contracts/deployments/arbitrumSepoliaDevnet/DisputeTemplateRegistryUniversity.json
 create mode 100644 contracts/deployments/arbitrumSepoliaDevnet/DisputeTemplateRegistryUniversity_Implementation.json
 create mode 100644 contracts/deployments/arbitrumSepoliaDevnet/DisputeTemplateRegistryUniversity_Proxy.json

diff --git a/contracts/README.md b/contracts/README.md
index 4f5d6d657..1e6ff14c3 100644
--- a/contracts/README.md
+++ b/contracts/README.md
@@ -74,7 +74,7 @@ Refresh the list of deployed contracts by running `./scripts/generateDeployments
 - [WrappedPinakionV2](https://gnosis-chiado.blockscout.com/address/0xD75E27A56AaF9eE7F8d9A472a8C2EF2f65a764dd)
 - [xKlerosLiquidV2](https://gnosis-chiado.blockscout.com/address/0x34E520dc1d2Db660113b64724e14CEdCD01Ee879)
 
-### Devnet
+### V2 Devnet (unstable)
 
 #### Arbitrum Sepolia
 
@@ -84,25 +84,26 @@ Refresh the list of deployed contracts by running `./scripts/generateDeployments
 - [DAI](https://sepolia.arbiscan.io/address/0x593e89704D285B0c3fbF157c7CF2537456CE64b5)
 - [DAIFaucet](https://sepolia.arbiscan.io/address/0xB5b39A1bcD2D7097A8824B3cC18Ebd2dFb0D9B5E)
 - [DisputeKitClassic: proxy](https://sepolia.arbiscan.io/address/0xeEEbbbff8f377dCFc7d4F7876C531db0d22720e1), [implementation](https://sepolia.arbiscan.io/address/0xc4cC0274E55a9818f8cF42640B1De61d269425ad)
-- [DisputeKitClassicUniversity: proxy](https://sepolia.arbiscan.io/address/0xd6E96b7c993763B5CDDa1139C7387B82A7c8B8B5), [implementation](https://sepolia.arbiscan.io/address/0x87e863b94d2CB79A8aB53bD87Dc4A10E11C0918B)
+- [DisputeKitClassicUniversity: proxy](https://sepolia.arbiscan.io/address/0x82F2089442979A6b56c80274D144575980092F91), [implementation](https://sepolia.arbiscan.io/address/0x602ADa1cE706404BFb5417e497cdDae934436081)
 - [DisputeKitGated: proxy](https://sepolia.arbiscan.io/address/0x677dA30B4b27D129354DdA1e219Bcc86802132d1), [implementation](https://sepolia.arbiscan.io/address/0xA27EedcEA916BC1ab91720cE70c56666E854F55e)
 - [DisputeKitGatedShutter: proxy](https://sepolia.arbiscan.io/address/0xd86b84eb36Cd48f3f384b4490F255b494385F429), [implementation](https://sepolia.arbiscan.io/address/0x56199F9E5C0ef9251A251a41597A971141199EDF)
 - [DisputeKitShutter: proxy](https://sepolia.arbiscan.io/address/0xfE0a958bc744Bb9E224E1822625B53134ac5CB69), [implementation](https://sepolia.arbiscan.io/address/0x6582CE0FdB29B5673E6650e34728C784BafB2139)
 - [DisputeResolver](https://sepolia.arbiscan.io/address/0x71f8537e925C753Fe88DA7e69Ae423f9f3a9A292)
 - [DisputeResolverRuler](https://sepolia.arbiscan.io/address/0xAEB1bbaE58125BA5F32349c69e4274d15dfD6EC3)
-- [DisputeResolverUniversity](https://sepolia.arbiscan.io/address/0x2Aa1a94307E772BeE42E9EfbD137b1053F1fCfd4)
+- [DisputeResolverUniversity](https://sepolia.arbiscan.io/address/0x8a7902Ef9a5308C7DF0A68A28EEDd6D83436993D)
 - [DisputeTemplateRegistry: proxy](https://sepolia.arbiscan.io/address/0xc852F94f90E3B06Da6eCfB61d76561ECfb94613f), [implementation](https://sepolia.arbiscan.io/address/0xBc9B5643C9B1C478DAe1b950e886CC50D8d868b1)
+- [DisputeTemplateRegistryUniversity: proxy](https://sepolia.arbiscan.io/address/0x75A5D16e9A699162506E4d79D68CF646e6600ba1), [implementation](https://sepolia.arbiscan.io/address/0xC3f638389635bF33E019c845FdaF2ed9bca3DF67)
 - [EvidenceModule: proxy](https://sepolia.arbiscan.io/address/0xA1F72e0445fc395A393247F5B8c958Ec9b7C0B49), [implementation](https://sepolia.arbiscan.io/address/0x450Aa35da0ad8B282C5d910254055651417C2200)
 - [KlerosCore: proxy](https://sepolia.arbiscan.io/address/0x1Bd44c4a4511DbFa7DC1d5BC201635596E7200f9), [implementation](https://sepolia.arbiscan.io/address/0xaBf1AA1D08F98ED800938B1B086d0904c5BF4f0E)
 - [KlerosCoreRuler: proxy](https://sepolia.arbiscan.io/address/0x0630e4248a17b506809009F5D88E2f5bEE584c83), [implementation](https://sepolia.arbiscan.io/address/0xb8bF3A32730cEc3B0a8516b87246ceE24ca2eaCF)
 - [KlerosCoreSnapshotProxy](https://sepolia.arbiscan.io/address/0xF924ac62b20901914c101Fa089Da1FB6A0585138)
-- [KlerosCoreUniversity: proxy](https://sepolia.arbiscan.io/address/0x5AB37F38778Bc175852fA353056591D91c744ce6), [implementation](https://sepolia.arbiscan.io/address/0xF74DaBfC5F5dbdBD07636637204d9C35326D2906)
+- [KlerosCoreUniversity: proxy](https://sepolia.arbiscan.io/address/0xA34dBBD0E5e1d09bd683455f9dbC393797BC558f), [implementation](https://sepolia.arbiscan.io/address/0xb75b0cc01af4aD0D65D50082ae0717004D479Aa0)
 - [KlerosV2NeoEarlyUser](https://sepolia.arbiscan.io/address/0x0d60Ff8bbCF49Bc5352328E7E28e141834d7750F)
 - [PinakionV2](https://sepolia.arbiscan.io/address/0x34B944D42cAcfC8266955D07A80181D2054aa225)
 - [PNKFaucet](https://sepolia.arbiscan.io/address/0x7EFE468003Ad6A858b5350CDE0A67bBED58739dD)
 - [PolicyRegistry: proxy](https://sepolia.arbiscan.io/address/0xd8681dBF525ecBda2F799BFddB96840065075e8A), [implementation](https://sepolia.arbiscan.io/address/0x472846F88D1356bb483a88f97B55026654Fc5deD)
 - [SortitionModule: proxy](https://sepolia.arbiscan.io/address/0x6F24A90fBBeabB2B4343Bb9c1eD8ee6AcAa50663), [implementation](https://sepolia.arbiscan.io/address/0x8a26445989c944C58503275ad87Ab4d7b17d4F1e)
-- [SortitionModuleUniversity: proxy](https://sepolia.arbiscan.io/address/0x4B2c2d048921f694cCE3AEa35698c6B1f5fcbb79), [implementation](https://sepolia.arbiscan.io/address/0x5CAD621D69E0535422aCFaCC0017bC32beC7A486)
+- [SortitionModuleUniversity: proxy](https://sepolia.arbiscan.io/address/0x9f55804177e7E44E558616cD7d06B865788214cA), [implementation](https://sepolia.arbiscan.io/address/0x270e3D63d3d275604df0a1Bd312E1255DCd96936)
 - [TransactionBatcher](https://sepolia.arbiscan.io/address/0x35f93986950804ac1F93519BF68C2a7Dd776db0E)
 - [WETH](https://sepolia.arbiscan.io/address/0x3829A2486d53ee984a0ca2D76552715726b77138)
 - [WETHFaucet](https://sepolia.arbiscan.io/address/0x6F8C10E0030aDf5B8030a5E282F026ADdB6525fd)
diff --git a/contracts/deploy/00-home-chain-arbitration-university.ts b/contracts/deploy/00-home-chain-arbitration-university.ts
index 2aa5f747b..5f862575a 100644
--- a/contracts/deploy/00-home-chain-arbitration-university.ts
+++ b/contracts/deploy/00-home-chain-arbitration-university.ts
@@ -24,10 +24,19 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
 
   await getContractOrDeploy(hre, "TransactionBatcher", { from: deployer, args: [], log: true });
 
+  await deployUpgradable(deployments, "DisputeTemplateRegistryUniversity", {
+    from: deployer,
+    contract: "DisputeTemplateRegistry",
+    args: [deployer],
+    log: true,
+  });
+
+  return;
+
   const disputeKit = await deployUpgradable(deployments, "DisputeKitClassicUniversity", {
     from: deployer,
     contract: "DisputeKitClassic",
-    args: [deployer, ZeroAddress, weth.target],
+    args: [deployer, ZeroAddress, weth.target, 1],
     log: true,
   });
 
diff --git a/contracts/deployments/arbitrumSepoliaDevnet.ts b/contracts/deployments/arbitrumSepoliaDevnet.ts
index bd581ea30..037880be7 100644
--- a/contracts/deployments/arbitrumSepoliaDevnet.ts
+++ b/contracts/deployments/arbitrumSepoliaDevnet.ts
@@ -4221,7 +4221,7 @@ export default {
       ],
     },
     DisputeKitClassicUniversity: {
-      address: "0xd6E96b7c993763B5CDDa1139C7387B82A7c8B8B5",
+      address: "0x82F2089442979A6b56c80274D144575980092F91",
       abi: [
         {
           stateMutability: "payable",
@@ -4236,11 +4236,61 @@ export default {
           name: "AlreadyInitialized",
           type: "error",
         },
+        {
+          inputs: [],
+          name: "AppealFeeIsAlreadyPaid",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "AppealPeriodIsOver",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "AppealPeriodIsOverForLoser",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "ChoiceOutOfBounds",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "CoreIsPaused",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "DisputeJumpedToParentDK",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "DisputeNotResolved",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "EmptyCommit",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "EmptyVoteIDs",
+          type: "error",
+        },
         {
           inputs: [],
           name: "FailedDelegateCall",
           type: "error",
         },
+        {
+          inputs: [],
+          name: "HashDoesNotMatchHiddenVoteCommitment",
+          type: "error",
+        },
         {
           inputs: [
             {
@@ -4252,11 +4302,41 @@ export default {
           name: "InvalidImplementation",
           type: "error",
         },
+        {
+          inputs: [],
+          name: "JurorHasToOwnTheVote",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "KlerosCoreOnly",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "NotActiveForCoreDisputeID",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "NotCommitPeriod",
+          type: "error",
+        },
         {
           inputs: [],
           name: "NotInitializing",
           type: "error",
         },
+        {
+          inputs: [],
+          name: "NotVotePeriod",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "OwnerOnly",
+          type: "error",
+        },
         {
           inputs: [],
           name: "UUPSUnauthorizedCallContext",
@@ -4273,6 +4353,16 @@ export default {
           name: "UUPSUnsupportedProxiableUUID",
           type: "error",
         },
+        {
+          inputs: [],
+          name: "UnsuccessfulCall",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "VoteAlreadyCast",
+          type: "error",
+        },
         {
           anonymous: false,
           inputs: [
@@ -4517,19 +4607,6 @@ export default {
           stateMutability: "view",
           type: "function",
         },
-        {
-          inputs: [],
-          name: "ONE_BASIS_POINT",
-          outputs: [
-            {
-              internalType: "uint256",
-              name: "",
-              type: "uint256",
-            },
-          ],
-          stateMutability: "view",
-          type: "function",
-        },
         {
           inputs: [],
           name: "WINNER_STAKE_MULTIPLIER",
@@ -4650,15 +4727,28 @@ export default {
           stateMutability: "nonpayable",
           type: "function",
         },
+        {
+          inputs: [
+            {
+              internalType: "uint256",
+              name: "_jumpDisputeKitID",
+              type: "uint256",
+            },
+          ],
+          name: "changeJumpDisputeKitID",
+          outputs: [],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
         {
           inputs: [
             {
               internalType: "address payable",
-              name: "_governor",
+              name: "_owner",
               type: "address",
             },
           ],
-          name: "changeGovernor",
+          name: "changeOwner",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
@@ -4676,6 +4766,25 @@ export default {
           stateMutability: "view",
           type: "function",
         },
+        {
+          inputs: [
+            {
+              internalType: "uint256",
+              name: "coreDisputeID",
+              type: "uint256",
+            },
+          ],
+          name: "coreDisputeIDToActive",
+          outputs: [
+            {
+              internalType: "bool",
+              name: "",
+              type: "bool",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -4714,7 +4823,7 @@ export default {
             },
             {
               internalType: "uint256",
-              name: "_nbVotes",
+              name: "",
               type: "uint256",
             },
           ],
@@ -4801,10 +4910,34 @@ export default {
               name: "drawnAddress",
               type: "address",
             },
+            {
+              internalType: "uint96",
+              name: "fromSubcourtID",
+              type: "uint96",
+            },
           ],
           stateMutability: "nonpayable",
           type: "function",
         },
+        {
+          inputs: [
+            {
+              internalType: "uint256",
+              name: "",
+              type: "uint256",
+            },
+          ],
+          name: "earlyCourtJump",
+          outputs: [
+            {
+              internalType: "bool",
+              name: "",
+              type: "bool",
+            },
+          ],
+          stateMutability: "pure",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -4823,7 +4956,7 @@ export default {
               type: "bytes",
             },
           ],
-          name: "executeGovernorProposal",
+          name: "executeOwnerProposal",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
@@ -4898,14 +5031,58 @@ export default {
               type: "uint256",
             },
           ],
-          name: "getDegreeOfCoherence",
+          name: "getDegreeOfCoherencePenalty",
           outputs: [
+            {
+              internalType: "uint256",
+              name: "pnkCoherence",
+              type: "uint256",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [
+            {
+              internalType: "uint256",
+              name: "_coreDisputeID",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "_coreRoundID",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "_voteID",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "",
+              type: "uint256",
+            },
             {
               internalType: "uint256",
               name: "",
               type: "uint256",
             },
           ],
+          name: "getDegreeOfCoherenceReward",
+          outputs: [
+            {
+              internalType: "uint256",
+              name: "pnkCoherence",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "feeCoherence",
+              type: "uint256",
+            },
+          ],
           stateMutability: "view",
           type: "function",
         },
@@ -4928,6 +5105,19 @@ export default {
           stateMutability: "view",
           type: "function",
         },
+        {
+          inputs: [],
+          name: "getJumpDisputeKitID",
+          outputs: [
+            {
+              internalType: "uint256",
+              name: "",
+              type: "uint256",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -4940,42 +5130,60 @@ export default {
               name: "_coreRoundID",
               type: "uint256",
             },
+          ],
+          name: "getLocalDisputeRoundID",
+          outputs: [
             {
               internalType: "uint256",
-              name: "_choice",
+              name: "localDisputeID",
               type: "uint256",
             },
-          ],
-          name: "getRoundInfo",
-          outputs: [
             {
               internalType: "uint256",
-              name: "winningChoice",
+              name: "localRoundID",
               type: "uint256",
             },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [
             {
-              internalType: "bool",
-              name: "tied",
-              type: "bool",
+              internalType: "contract IDisputeKit",
+              name: "",
+              type: "address",
             },
             {
               internalType: "uint256",
-              name: "totalVoted",
+              name: "_currentNbVotes",
               type: "uint256",
             },
+          ],
+          name: "getNbVotesAfterAppeal",
+          outputs: [
             {
               internalType: "uint256",
-              name: "totalCommited",
+              name: "",
               type: "uint256",
             },
+          ],
+          stateMutability: "pure",
+          type: "function",
+        },
+        {
+          inputs: [
             {
               internalType: "uint256",
-              name: "nbVoters",
+              name: "_localDisputeID",
               type: "uint256",
             },
+          ],
+          name: "getNumberOfRounds",
+          outputs: [
             {
               internalType: "uint256",
-              name: "choiceCount",
+              name: "",
               type: "uint256",
             },
           ],
@@ -4996,29 +5204,83 @@ export default {
             },
             {
               internalType: "uint256",
-              name: "_voteID",
+              name: "_choice",
               type: "uint256",
             },
           ],
-          name: "getVoteInfo",
+          name: "getRoundInfo",
           outputs: [
             {
-              internalType: "address",
-              name: "account",
-              type: "address",
+              internalType: "uint256",
+              name: "winningChoice",
+              type: "uint256",
             },
             {
-              internalType: "bytes32",
-              name: "commit",
-              type: "bytes32",
+              internalType: "bool",
+              name: "tied",
+              type: "bool",
             },
             {
               internalType: "uint256",
-              name: "choice",
+              name: "totalVoted",
               type: "uint256",
             },
             {
-              internalType: "bool",
+              internalType: "uint256",
+              name: "totalCommitted",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "nbVoters",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "choiceCount",
+              type: "uint256",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [
+            {
+              internalType: "uint256",
+              name: "_coreDisputeID",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "_coreRoundID",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "_voteID",
+              type: "uint256",
+            },
+          ],
+          name: "getVoteInfo",
+          outputs: [
+            {
+              internalType: "address",
+              name: "account",
+              type: "address",
+            },
+            {
+              internalType: "bytes32",
+              name: "commit",
+              type: "bytes32",
+            },
+            {
+              internalType: "uint256",
+              name: "choice",
+              type: "uint256",
+            },
+            {
+              internalType: "bool",
               name: "voted",
               type: "bool",
             },
@@ -5027,13 +5289,29 @@ export default {
           type: "function",
         },
         {
-          inputs: [],
-          name: "governor",
+          inputs: [
+            {
+              internalType: "uint256",
+              name: "_choice",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "_salt",
+              type: "uint256",
+            },
+            {
+              internalType: "string",
+              name: "",
+              type: "string",
+            },
+          ],
+          name: "hashVote",
           outputs: [
             {
-              internalType: "address",
+              internalType: "bytes32",
               name: "",
-              type: "address",
+              type: "bytes32",
             },
           ],
           stateMutability: "view",
@@ -5043,7 +5321,7 @@ export default {
           inputs: [
             {
               internalType: "address",
-              name: "_governor",
+              name: "_owner",
               type: "address",
             },
             {
@@ -5051,12 +5329,41 @@ export default {
               name: "_core",
               type: "address",
             },
+            {
+              internalType: "address",
+              name: "_wNative",
+              type: "address",
+            },
+            {
+              internalType: "uint256",
+              name: "_jumpDisputeKitID",
+              type: "uint256",
+            },
           ],
           name: "initialize",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
         },
+        {
+          inputs: [
+            {
+              internalType: "uint256",
+              name: "_coreDisputeID",
+              type: "uint256",
+            },
+          ],
+          name: "isAppealFunded",
+          outputs: [
+            {
+              internalType: "bool",
+              name: "",
+              type: "bool",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -5086,6 +5393,32 @@ export default {
           stateMutability: "view",
           type: "function",
         },
+        {
+          inputs: [],
+          name: "jumpDisputeKitID",
+          outputs: [
+            {
+              internalType: "uint256",
+              name: "",
+              type: "uint256",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [],
+          name: "owner",
+          outputs: [
+            {
+              internalType: "address",
+              name: "",
+              type: "address",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
         {
           inputs: [],
           name: "proxiableUUID",
@@ -5099,6 +5432,19 @@ export default {
           stateMutability: "view",
           type: "function",
         },
+        {
+          inputs: [],
+          name: "singleDrawPerJuror",
+          outputs: [
+            {
+              internalType: "bool",
+              name: "",
+              type: "bool",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -5117,6 +5463,32 @@ export default {
           stateMutability: "payable",
           type: "function",
         },
+        {
+          inputs: [],
+          name: "version",
+          outputs: [
+            {
+              internalType: "string",
+              name: "",
+              type: "string",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [],
+          name: "wNative",
+          outputs: [
+            {
+              internalType: "address",
+              name: "",
+              type: "address",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -5170,7 +5542,7 @@ export default {
       ],
     },
     DisputeKitClassicUniversity_Implementation: {
-      address: "0x87e863b94d2CB79A8aB53bD87Dc4A10E11C0918B",
+      address: "0x602ADa1cE706404BFb5417e497cdDae934436081",
       abi: [
         {
           inputs: [],
@@ -5182,11 +5554,61 @@ export default {
           name: "AlreadyInitialized",
           type: "error",
         },
+        {
+          inputs: [],
+          name: "AppealFeeIsAlreadyPaid",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "AppealPeriodIsOver",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "AppealPeriodIsOverForLoser",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "ChoiceOutOfBounds",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "CoreIsPaused",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "DisputeJumpedToParentDK",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "DisputeNotResolved",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "EmptyCommit",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "EmptyVoteIDs",
+          type: "error",
+        },
         {
           inputs: [],
           name: "FailedDelegateCall",
           type: "error",
         },
+        {
+          inputs: [],
+          name: "HashDoesNotMatchHiddenVoteCommitment",
+          type: "error",
+        },
         {
           inputs: [
             {
@@ -5198,11 +5620,41 @@ export default {
           name: "InvalidImplementation",
           type: "error",
         },
+        {
+          inputs: [],
+          name: "JurorHasToOwnTheVote",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "KlerosCoreOnly",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "NotActiveForCoreDisputeID",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "NotCommitPeriod",
+          type: "error",
+        },
         {
           inputs: [],
           name: "NotInitializing",
           type: "error",
         },
+        {
+          inputs: [],
+          name: "NotVotePeriod",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "OwnerOnly",
+          type: "error",
+        },
         {
           inputs: [],
           name: "UUPSUnauthorizedCallContext",
@@ -5219,6 +5671,16 @@ export default {
           name: "UUPSUnsupportedProxiableUUID",
           type: "error",
         },
+        {
+          inputs: [],
+          name: "UnsuccessfulCall",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "VoteAlreadyCast",
+          type: "error",
+        },
         {
           anonymous: false,
           inputs: [
@@ -5465,7 +5927,7 @@ export default {
         },
         {
           inputs: [],
-          name: "ONE_BASIS_POINT",
+          name: "WINNER_STAKE_MULTIPLIER",
           outputs: [
             {
               internalType: "uint256",
@@ -5477,23 +5939,10 @@ export default {
           type: "function",
         },
         {
-          inputs: [],
-          name: "WINNER_STAKE_MULTIPLIER",
-          outputs: [
+          inputs: [
             {
               internalType: "uint256",
-              name: "",
-              type: "uint256",
-            },
-          ],
-          stateMutability: "view",
-          type: "function",
-        },
-        {
-          inputs: [
-            {
-              internalType: "uint256",
-              name: "_coreDisputeID",
+              name: "_coreDisputeID",
               type: "uint256",
             },
           ],
@@ -5596,15 +6045,28 @@ export default {
           stateMutability: "nonpayable",
           type: "function",
         },
+        {
+          inputs: [
+            {
+              internalType: "uint256",
+              name: "_jumpDisputeKitID",
+              type: "uint256",
+            },
+          ],
+          name: "changeJumpDisputeKitID",
+          outputs: [],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
         {
           inputs: [
             {
               internalType: "address payable",
-              name: "_governor",
+              name: "_owner",
               type: "address",
             },
           ],
-          name: "changeGovernor",
+          name: "changeOwner",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
@@ -5622,6 +6084,25 @@ export default {
           stateMutability: "view",
           type: "function",
         },
+        {
+          inputs: [
+            {
+              internalType: "uint256",
+              name: "coreDisputeID",
+              type: "uint256",
+            },
+          ],
+          name: "coreDisputeIDToActive",
+          outputs: [
+            {
+              internalType: "bool",
+              name: "",
+              type: "bool",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -5660,7 +6141,7 @@ export default {
             },
             {
               internalType: "uint256",
-              name: "_nbVotes",
+              name: "",
               type: "uint256",
             },
           ],
@@ -5747,10 +6228,34 @@ export default {
               name: "drawnAddress",
               type: "address",
             },
+            {
+              internalType: "uint96",
+              name: "fromSubcourtID",
+              type: "uint96",
+            },
           ],
           stateMutability: "nonpayable",
           type: "function",
         },
+        {
+          inputs: [
+            {
+              internalType: "uint256",
+              name: "",
+              type: "uint256",
+            },
+          ],
+          name: "earlyCourtJump",
+          outputs: [
+            {
+              internalType: "bool",
+              name: "",
+              type: "bool",
+            },
+          ],
+          stateMutability: "pure",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -5769,7 +6274,7 @@ export default {
               type: "bytes",
             },
           ],
-          name: "executeGovernorProposal",
+          name: "executeOwnerProposal",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
@@ -5844,14 +6349,58 @@ export default {
               type: "uint256",
             },
           ],
-          name: "getDegreeOfCoherence",
+          name: "getDegreeOfCoherencePenalty",
           outputs: [
+            {
+              internalType: "uint256",
+              name: "pnkCoherence",
+              type: "uint256",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [
+            {
+              internalType: "uint256",
+              name: "_coreDisputeID",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "_coreRoundID",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "_voteID",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "",
+              type: "uint256",
+            },
             {
               internalType: "uint256",
               name: "",
               type: "uint256",
             },
           ],
+          name: "getDegreeOfCoherenceReward",
+          outputs: [
+            {
+              internalType: "uint256",
+              name: "pnkCoherence",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "feeCoherence",
+              type: "uint256",
+            },
+          ],
           stateMutability: "view",
           type: "function",
         },
@@ -5874,6 +6423,91 @@ export default {
           stateMutability: "view",
           type: "function",
         },
+        {
+          inputs: [],
+          name: "getJumpDisputeKitID",
+          outputs: [
+            {
+              internalType: "uint256",
+              name: "",
+              type: "uint256",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [
+            {
+              internalType: "uint256",
+              name: "_coreDisputeID",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "_coreRoundID",
+              type: "uint256",
+            },
+          ],
+          name: "getLocalDisputeRoundID",
+          outputs: [
+            {
+              internalType: "uint256",
+              name: "localDisputeID",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "localRoundID",
+              type: "uint256",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [
+            {
+              internalType: "contract IDisputeKit",
+              name: "",
+              type: "address",
+            },
+            {
+              internalType: "uint256",
+              name: "_currentNbVotes",
+              type: "uint256",
+            },
+          ],
+          name: "getNbVotesAfterAppeal",
+          outputs: [
+            {
+              internalType: "uint256",
+              name: "",
+              type: "uint256",
+            },
+          ],
+          stateMutability: "pure",
+          type: "function",
+        },
+        {
+          inputs: [
+            {
+              internalType: "uint256",
+              name: "_localDisputeID",
+              type: "uint256",
+            },
+          ],
+          name: "getNumberOfRounds",
+          outputs: [
+            {
+              internalType: "uint256",
+              name: "",
+              type: "uint256",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -5911,7 +6545,7 @@ export default {
             },
             {
               internalType: "uint256",
-              name: "totalCommited",
+              name: "totalCommitted",
               type: "uint256",
             },
             {
@@ -5973,13 +6607,29 @@ export default {
           type: "function",
         },
         {
-          inputs: [],
-          name: "governor",
+          inputs: [
+            {
+              internalType: "uint256",
+              name: "_choice",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "_salt",
+              type: "uint256",
+            },
+            {
+              internalType: "string",
+              name: "",
+              type: "string",
+            },
+          ],
+          name: "hashVote",
           outputs: [
             {
-              internalType: "address",
+              internalType: "bytes32",
               name: "",
-              type: "address",
+              type: "bytes32",
             },
           ],
           stateMutability: "view",
@@ -5989,7 +6639,7 @@ export default {
           inputs: [
             {
               internalType: "address",
-              name: "_governor",
+              name: "_owner",
               type: "address",
             },
             {
@@ -5997,12 +6647,41 @@ export default {
               name: "_core",
               type: "address",
             },
+            {
+              internalType: "address",
+              name: "_wNative",
+              type: "address",
+            },
+            {
+              internalType: "uint256",
+              name: "_jumpDisputeKitID",
+              type: "uint256",
+            },
           ],
           name: "initialize",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
         },
+        {
+          inputs: [
+            {
+              internalType: "uint256",
+              name: "_coreDisputeID",
+              type: "uint256",
+            },
+          ],
+          name: "isAppealFunded",
+          outputs: [
+            {
+              internalType: "bool",
+              name: "",
+              type: "bool",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -6034,27 +6713,66 @@ export default {
         },
         {
           inputs: [],
-          name: "proxiableUUID",
+          name: "jumpDisputeKitID",
           outputs: [
             {
-              internalType: "bytes32",
+              internalType: "uint256",
               name: "",
-              type: "bytes32",
+              type: "uint256",
             },
           ],
           stateMutability: "view",
           type: "function",
         },
         {
-          inputs: [
+          inputs: [],
+          name: "owner",
+          outputs: [
             {
               internalType: "address",
-              name: "newImplementation",
+              name: "",
               type: "address",
             },
-            {
-              internalType: "bytes",
-              name: "data",
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [],
+          name: "proxiableUUID",
+          outputs: [
+            {
+              internalType: "bytes32",
+              name: "",
+              type: "bytes32",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [],
+          name: "singleDrawPerJuror",
+          outputs: [
+            {
+              internalType: "bool",
+              name: "",
+              type: "bool",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [
+            {
+              internalType: "address",
+              name: "newImplementation",
+              type: "address",
+            },
+            {
+              internalType: "bytes",
+              name: "data",
               type: "bytes",
             },
           ],
@@ -6063,6 +6781,32 @@ export default {
           stateMutability: "payable",
           type: "function",
         },
+        {
+          inputs: [],
+          name: "version",
+          outputs: [
+            {
+              internalType: "string",
+              name: "",
+              type: "string",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [],
+          name: "wNative",
+          outputs: [
+            {
+              internalType: "address",
+              name: "",
+              type: "address",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -6100,7 +6844,7 @@ export default {
       ],
     },
     DisputeKitClassicUniversity_Proxy: {
-      address: "0xd6E96b7c993763B5CDDa1139C7387B82A7c8B8B5",
+      address: "0x82F2089442979A6b56c80274D144575980092F91",
       abi: [
         {
           inputs: [
@@ -15279,7 +16023,7 @@ export default {
       ],
     },
     DisputeResolverUniversity: {
-      address: "0x2Aa1a94307E772BeE42E9EfbD137b1053F1fCfd4",
+      address: "0x8a7902Ef9a5308C7DF0A68A28EEDd6D83436993D",
       abi: [
         {
           inputs: [
@@ -15297,6 +16041,31 @@ export default {
           stateMutability: "nonpayable",
           type: "constructor",
         },
+        {
+          inputs: [],
+          name: "ArbitratorOnly",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "DisputeAlreadyRuled",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "OwnerOnly",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "RulingOutOfBounds",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "ShouldBeAtLeastTwoRulingOptions",
+          type: "error",
+        },
         {
           anonymous: false,
           inputs: [
@@ -15324,12 +16093,6 @@ export default {
               name: "_templateId",
               type: "uint256",
             },
-            {
-              indexed: false,
-              internalType: "string",
-              name: "_templateUri",
-              type: "string",
-            },
           ],
           name: "DisputeRequest",
           type: "event",
@@ -15408,11 +16171,11 @@ export default {
           inputs: [
             {
               internalType: "address",
-              name: "_governor",
+              name: "_owner",
               type: "address",
             },
           ],
-          name: "changeGovernor",
+          name: "changeOwner",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
@@ -15464,35 +16227,6 @@ export default {
           stateMutability: "payable",
           type: "function",
         },
-        {
-          inputs: [
-            {
-              internalType: "bytes",
-              name: "_arbitratorExtraData",
-              type: "bytes",
-            },
-            {
-              internalType: "string",
-              name: "_disputeTemplateUri",
-              type: "string",
-            },
-            {
-              internalType: "uint256",
-              name: "_numberOfRulingOptions",
-              type: "uint256",
-            },
-          ],
-          name: "createDisputeForTemplateUri",
-          outputs: [
-            {
-              internalType: "uint256",
-              name: "disputeID",
-              type: "uint256",
-            },
-          ],
-          stateMutability: "payable",
-          type: "function",
-        },
         {
           inputs: [
             {
@@ -15529,7 +16263,7 @@ export default {
         },
         {
           inputs: [],
-          name: "governor",
+          name: "owner",
           outputs: [
             {
               internalType: "address",
@@ -15833,13 +16567,16 @@ export default {
         },
       ],
     },
-    DisputeTemplateRegistry_Implementation: {
-      address: "0xBc9B5643C9B1C478DAe1b950e886CC50D8d868b1",
+    DisputeTemplateRegistryUniversity: {
+      address: "0x75A5D16e9A699162506E4d79D68CF646e6600ba1",
       abi: [
         {
-          inputs: [],
-          stateMutability: "nonpayable",
-          type: "constructor",
+          stateMutability: "payable",
+          type: "fallback",
+        },
+        {
+          stateMutability: "payable",
+          type: "receive",
         },
         {
           inputs: [],
@@ -15867,6 +16604,11 @@ export default {
           name: "NotInitializing",
           type: "error",
         },
+        {
+          inputs: [],
+          name: "OwnerOnly",
+          type: "error",
+        },
         {
           inputs: [],
           name: "UUPSUnauthorizedCallContext",
@@ -15944,33 +16686,20 @@ export default {
           inputs: [
             {
               internalType: "address",
-              name: "_governor",
+              name: "_owner",
               type: "address",
             },
           ],
-          name: "changeGovernor",
+          name: "changeOwner",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
         },
-        {
-          inputs: [],
-          name: "governor",
-          outputs: [
-            {
-              internalType: "address",
-              name: "",
-              type: "address",
-            },
-          ],
-          stateMutability: "view",
-          type: "function",
-        },
         {
           inputs: [
             {
               internalType: "address",
-              name: "_governor",
+              name: "_owner",
               type: "address",
             },
           ],
@@ -15981,9 +16710,15 @@ export default {
         },
         {
           inputs: [],
-          name: "initialize2",
-          outputs: [],
-          stateMutability: "nonpayable",
+          name: "owner",
+          outputs: [
+            {
+              internalType: "address",
+              name: "",
+              type: "address",
+            },
+          ],
+          stateMutability: "view",
           type: "function",
         },
         {
@@ -16072,11 +16807,6 @@ export default {
           stateMutability: "view",
           type: "function",
         },
-      ],
-    },
-    DisputeTemplateRegistry_Proxy: {
-      address: "0xc852F94f90E3B06Da6eCfB61d76561ECfb94613f",
-      abi: [
         {
           inputs: [
             {
@@ -16093,26 +16823,15 @@ export default {
           stateMutability: "nonpayable",
           type: "constructor",
         },
-        {
-          stateMutability: "payable",
-          type: "fallback",
-        },
-        {
-          stateMutability: "payable",
-          type: "receive",
-        },
       ],
     },
-    EvidenceModule: {
-      address: "0xA1F72e0445fc395A393247F5B8c958Ec9b7C0B49",
+    DisputeTemplateRegistryUniversity_Implementation: {
+      address: "0xC3f638389635bF33E019c845FdaF2ed9bca3DF67",
       abi: [
         {
-          stateMutability: "payable",
-          type: "fallback",
-        },
-        {
-          stateMutability: "payable",
-          type: "receive",
+          inputs: [],
+          stateMutability: "nonpayable",
+          type: "constructor",
         },
         {
           inputs: [],
@@ -16140,6 +16859,11 @@ export default {
           name: "NotInitializing",
           type: "error",
         },
+        {
+          inputs: [],
+          name: "OwnerOnly",
+          type: "error",
+        },
         {
           inputs: [],
           name: "UUPSUnauthorizedCallContext",
@@ -16162,23 +16886,29 @@ export default {
             {
               indexed: true,
               internalType: "uint256",
-              name: "_externalDisputeID",
+              name: "_templateId",
               type: "uint256",
             },
             {
               indexed: true,
-              internalType: "address",
-              name: "_party",
-              type: "address",
+              internalType: "string",
+              name: "_templateTag",
+              type: "string",
             },
             {
               indexed: false,
               internalType: "string",
-              name: "_evidence",
+              name: "_templateData",
+              type: "string",
+            },
+            {
+              indexed: false,
+              internalType: "string",
+              name: "_templateDataMappings",
               type: "string",
             },
           ],
-          name: "Evidence",
+          name: "DisputeTemplate",
           type: "event",
         },
         {
@@ -16208,23 +16938,23 @@ export default {
           type: "event",
         },
         {
-          inputs: [],
-          name: "governor",
-          outputs: [
+          inputs: [
             {
               internalType: "address",
-              name: "",
+              name: "_owner",
               type: "address",
             },
           ],
-          stateMutability: "view",
+          name: "changeOwner",
+          outputs: [],
+          stateMutability: "nonpayable",
           type: "function",
         },
         {
           inputs: [
             {
               internalType: "address",
-              name: "_governor",
+              name: "_owner",
               type: "address",
             },
           ],
@@ -16235,9 +16965,15 @@ export default {
         },
         {
           inputs: [],
-          name: "initialize2",
-          outputs: [],
-          stateMutability: "nonpayable",
+          name: "owner",
+          outputs: [
+            {
+              internalType: "address",
+              name: "",
+              type: "address",
+            },
+          ],
+          stateMutability: "view",
           type: "function",
         },
         {
@@ -16256,26 +16992,550 @@ export default {
         {
           inputs: [
             {
-              internalType: "uint256",
-              name: "_externalDisputeID",
-              type: "uint256",
+              internalType: "string",
+              name: "_templateTag",
+              type: "string",
             },
             {
               internalType: "string",
-              name: "_evidence",
+              name: "_templateData",
               type: "string",
             },
-          ],
-          name: "submitEvidence",
-          outputs: [],
-          stateMutability: "nonpayable",
-          type: "function",
-        },
-        {
-          inputs: [
             {
-              internalType: "address",
-              name: "newImplementation",
+              internalType: "string",
+              name: "_templateDataMappings",
+              type: "string",
+            },
+          ],
+          name: "setDisputeTemplate",
+          outputs: [
+            {
+              internalType: "uint256",
+              name: "templateId",
+              type: "uint256",
+            },
+          ],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
+        {
+          inputs: [],
+          name: "templates",
+          outputs: [
+            {
+              internalType: "uint256",
+              name: "",
+              type: "uint256",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [
+            {
+              internalType: "address",
+              name: "newImplementation",
+              type: "address",
+            },
+            {
+              internalType: "bytes",
+              name: "data",
+              type: "bytes",
+            },
+          ],
+          name: "upgradeToAndCall",
+          outputs: [],
+          stateMutability: "payable",
+          type: "function",
+        },
+        {
+          inputs: [],
+          name: "version",
+          outputs: [
+            {
+              internalType: "string",
+              name: "",
+              type: "string",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+      ],
+    },
+    DisputeTemplateRegistryUniversity_Proxy: {
+      address: "0x75A5D16e9A699162506E4d79D68CF646e6600ba1",
+      abi: [
+        {
+          inputs: [
+            {
+              internalType: "address",
+              name: "_implementation",
+              type: "address",
+            },
+            {
+              internalType: "bytes",
+              name: "_data",
+              type: "bytes",
+            },
+          ],
+          stateMutability: "nonpayable",
+          type: "constructor",
+        },
+        {
+          stateMutability: "payable",
+          type: "fallback",
+        },
+        {
+          stateMutability: "payable",
+          type: "receive",
+        },
+      ],
+    },
+    DisputeTemplateRegistry_Implementation: {
+      address: "0xBc9B5643C9B1C478DAe1b950e886CC50D8d868b1",
+      abi: [
+        {
+          inputs: [],
+          stateMutability: "nonpayable",
+          type: "constructor",
+        },
+        {
+          inputs: [],
+          name: "AlreadyInitialized",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "FailedDelegateCall",
+          type: "error",
+        },
+        {
+          inputs: [
+            {
+              internalType: "address",
+              name: "implementation",
+              type: "address",
+            },
+          ],
+          name: "InvalidImplementation",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "NotInitializing",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "UUPSUnauthorizedCallContext",
+          type: "error",
+        },
+        {
+          inputs: [
+            {
+              internalType: "bytes32",
+              name: "slot",
+              type: "bytes32",
+            },
+          ],
+          name: "UUPSUnsupportedProxiableUUID",
+          type: "error",
+        },
+        {
+          anonymous: false,
+          inputs: [
+            {
+              indexed: true,
+              internalType: "uint256",
+              name: "_templateId",
+              type: "uint256",
+            },
+            {
+              indexed: true,
+              internalType: "string",
+              name: "_templateTag",
+              type: "string",
+            },
+            {
+              indexed: false,
+              internalType: "string",
+              name: "_templateData",
+              type: "string",
+            },
+            {
+              indexed: false,
+              internalType: "string",
+              name: "_templateDataMappings",
+              type: "string",
+            },
+          ],
+          name: "DisputeTemplate",
+          type: "event",
+        },
+        {
+          anonymous: false,
+          inputs: [
+            {
+              indexed: false,
+              internalType: "uint64",
+              name: "version",
+              type: "uint64",
+            },
+          ],
+          name: "Initialized",
+          type: "event",
+        },
+        {
+          anonymous: false,
+          inputs: [
+            {
+              indexed: true,
+              internalType: "address",
+              name: "newImplementation",
+              type: "address",
+            },
+          ],
+          name: "Upgraded",
+          type: "event",
+        },
+        {
+          inputs: [
+            {
+              internalType: "address",
+              name: "_governor",
+              type: "address",
+            },
+          ],
+          name: "changeGovernor",
+          outputs: [],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
+        {
+          inputs: [],
+          name: "governor",
+          outputs: [
+            {
+              internalType: "address",
+              name: "",
+              type: "address",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [
+            {
+              internalType: "address",
+              name: "_governor",
+              type: "address",
+            },
+          ],
+          name: "initialize",
+          outputs: [],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
+        {
+          inputs: [],
+          name: "initialize2",
+          outputs: [],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
+        {
+          inputs: [],
+          name: "proxiableUUID",
+          outputs: [
+            {
+              internalType: "bytes32",
+              name: "",
+              type: "bytes32",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [
+            {
+              internalType: "string",
+              name: "_templateTag",
+              type: "string",
+            },
+            {
+              internalType: "string",
+              name: "_templateData",
+              type: "string",
+            },
+            {
+              internalType: "string",
+              name: "_templateDataMappings",
+              type: "string",
+            },
+          ],
+          name: "setDisputeTemplate",
+          outputs: [
+            {
+              internalType: "uint256",
+              name: "templateId",
+              type: "uint256",
+            },
+          ],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
+        {
+          inputs: [],
+          name: "templates",
+          outputs: [
+            {
+              internalType: "uint256",
+              name: "",
+              type: "uint256",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [
+            {
+              internalType: "address",
+              name: "newImplementation",
+              type: "address",
+            },
+            {
+              internalType: "bytes",
+              name: "data",
+              type: "bytes",
+            },
+          ],
+          name: "upgradeToAndCall",
+          outputs: [],
+          stateMutability: "payable",
+          type: "function",
+        },
+        {
+          inputs: [],
+          name: "version",
+          outputs: [
+            {
+              internalType: "string",
+              name: "",
+              type: "string",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+      ],
+    },
+    DisputeTemplateRegistry_Proxy: {
+      address: "0xc852F94f90E3B06Da6eCfB61d76561ECfb94613f",
+      abi: [
+        {
+          inputs: [
+            {
+              internalType: "address",
+              name: "_implementation",
+              type: "address",
+            },
+            {
+              internalType: "bytes",
+              name: "_data",
+              type: "bytes",
+            },
+          ],
+          stateMutability: "nonpayable",
+          type: "constructor",
+        },
+        {
+          stateMutability: "payable",
+          type: "fallback",
+        },
+        {
+          stateMutability: "payable",
+          type: "receive",
+        },
+      ],
+    },
+    EvidenceModule: {
+      address: "0xA1F72e0445fc395A393247F5B8c958Ec9b7C0B49",
+      abi: [
+        {
+          stateMutability: "payable",
+          type: "fallback",
+        },
+        {
+          stateMutability: "payable",
+          type: "receive",
+        },
+        {
+          inputs: [],
+          name: "AlreadyInitialized",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "FailedDelegateCall",
+          type: "error",
+        },
+        {
+          inputs: [
+            {
+              internalType: "address",
+              name: "implementation",
+              type: "address",
+            },
+          ],
+          name: "InvalidImplementation",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "NotInitializing",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "UUPSUnauthorizedCallContext",
+          type: "error",
+        },
+        {
+          inputs: [
+            {
+              internalType: "bytes32",
+              name: "slot",
+              type: "bytes32",
+            },
+          ],
+          name: "UUPSUnsupportedProxiableUUID",
+          type: "error",
+        },
+        {
+          anonymous: false,
+          inputs: [
+            {
+              indexed: true,
+              internalType: "uint256",
+              name: "_externalDisputeID",
+              type: "uint256",
+            },
+            {
+              indexed: true,
+              internalType: "address",
+              name: "_party",
+              type: "address",
+            },
+            {
+              indexed: false,
+              internalType: "string",
+              name: "_evidence",
+              type: "string",
+            },
+          ],
+          name: "Evidence",
+          type: "event",
+        },
+        {
+          anonymous: false,
+          inputs: [
+            {
+              indexed: false,
+              internalType: "uint64",
+              name: "version",
+              type: "uint64",
+            },
+          ],
+          name: "Initialized",
+          type: "event",
+        },
+        {
+          anonymous: false,
+          inputs: [
+            {
+              indexed: true,
+              internalType: "address",
+              name: "newImplementation",
+              type: "address",
+            },
+          ],
+          name: "Upgraded",
+          type: "event",
+        },
+        {
+          inputs: [],
+          name: "governor",
+          outputs: [
+            {
+              internalType: "address",
+              name: "",
+              type: "address",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [
+            {
+              internalType: "address",
+              name: "_governor",
+              type: "address",
+            },
+          ],
+          name: "initialize",
+          outputs: [],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
+        {
+          inputs: [],
+          name: "initialize2",
+          outputs: [],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
+        {
+          inputs: [],
+          name: "proxiableUUID",
+          outputs: [
+            {
+              internalType: "bytes32",
+              name: "",
+              type: "bytes32",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [
+            {
+              internalType: "uint256",
+              name: "_externalDisputeID",
+              type: "uint256",
+            },
+            {
+              internalType: "string",
+              name: "_evidence",
+              type: "string",
+            },
+          ],
+          name: "submitEvidence",
+          outputs: [],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
+        {
+          inputs: [
+            {
+              internalType: "address",
+              name: "newImplementation",
               type: "address",
             },
             {
@@ -21727,7 +22987,7 @@ export default {
       ],
     },
     KlerosCoreUniversity: {
-      address: "0x5AB37F38778Bc175852fA353056591D91c744ce6",
+      address: "0xA34dBBD0E5e1d09bd683455f9dbC393797BC558f",
       abi: [
         {
           stateMutability: "payable",
@@ -21762,11 +23022,6 @@ export default {
           name: "ArbitrationFeesNotEnough",
           type: "error",
         },
-        {
-          inputs: [],
-          name: "ArraysLengthMismatch",
-          type: "error",
-        },
         {
           inputs: [],
           name: "CannotDisableClassicDK",
@@ -21777,11 +23032,6 @@ export default {
           name: "CommitPeriodNotPassed",
           type: "error",
         },
-        {
-          inputs: [],
-          name: "DepthLevelMax",
-          type: "error",
-        },
         {
           inputs: [],
           name: "DisputeKitNotSupportedByCourt",
@@ -21817,16 +23067,6 @@ export default {
           name: "FailedDelegateCall",
           type: "error",
         },
-        {
-          inputs: [],
-          name: "GovernorOnly",
-          type: "error",
-        },
-        {
-          inputs: [],
-          name: "GovernorOrInstructorOnly",
-          type: "error",
-        },
         {
           inputs: [],
           name: "InstructorOnly",
@@ -21883,6 +23123,16 @@ export default {
           name: "NotInitializing",
           type: "error",
         },
+        {
+          inputs: [],
+          name: "OwnerOnly",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "OwnerOrInstructorOnly",
+          type: "error",
+        },
         {
           inputs: [],
           name: "RulingAlreadyExecuted",
@@ -21905,7 +23155,7 @@ export default {
         },
         {
           inputs: [],
-          name: "StakingNotPossibeInThisCourt",
+          name: "StakingNotPossibleInThisCourt",
           type: "error",
         },
         {
@@ -21913,6 +23163,11 @@ export default {
           name: "StakingTransferFailed",
           type: "error",
         },
+        {
+          inputs: [],
+          name: "StakingZeroWhenNoStake",
+          type: "error",
+        },
         {
           inputs: [],
           name: "TokenNotAccepted",
@@ -22026,9 +23281,9 @@ export default {
           inputs: [
             {
               indexed: true,
-              internalType: "uint256",
+              internalType: "uint96",
               name: "_courtID",
-              type: "uint256",
+              type: "uint96",
             },
             {
               indexed: true,
@@ -22303,6 +23558,12 @@ export default {
         {
           anonymous: false,
           inputs: [
+            {
+              indexed: true,
+              internalType: "address",
+              name: "_account",
+              type: "address",
+            },
             {
               indexed: true,
               internalType: "uint256",
@@ -22318,13 +23579,62 @@ export default {
             {
               indexed: false,
               internalType: "uint256",
-              name: "_pnkAmount",
+              name: "_degreeOfCoherencyPnk",
               type: "uint256",
             },
             {
               indexed: false,
               internalType: "uint256",
-              name: "_feeAmount",
+              name: "_degreeOfCoherencyFee",
+              type: "uint256",
+            },
+            {
+              indexed: false,
+              internalType: "int256",
+              name: "_amountPnk",
+              type: "int256",
+            },
+            {
+              indexed: false,
+              internalType: "int256",
+              name: "_amountFee",
+              type: "int256",
+            },
+            {
+              indexed: false,
+              internalType: "contract IERC20",
+              name: "_feeToken",
+              type: "address",
+            },
+          ],
+          name: "JurorRewardPenalty",
+          type: "event",
+        },
+        {
+          anonymous: false,
+          inputs: [
+            {
+              indexed: true,
+              internalType: "uint256",
+              name: "_disputeID",
+              type: "uint256",
+            },
+            {
+              indexed: true,
+              internalType: "uint256",
+              name: "_roundID",
+              type: "uint256",
+            },
+            {
+              indexed: false,
+              internalType: "uint256",
+              name: "_amountPnk",
+              type: "uint256",
+            },
+            {
+              indexed: false,
+              internalType: "uint256",
+              name: "_amountFee",
               type: "uint256",
             },
             {
@@ -22383,76 +23693,27 @@ export default {
         },
         {
           anonymous: false,
-          inputs: [
-            {
-              indexed: true,
-              internalType: "contract IArbitrableV2",
-              name: "_arbitrable",
-              type: "address",
-            },
-            {
-              indexed: true,
-              internalType: "uint256",
-              name: "_disputeID",
-              type: "uint256",
-            },
-            {
-              indexed: false,
-              internalType: "uint256",
-              name: "_ruling",
-              type: "uint256",
-            },
-          ],
-          name: "Ruling",
-          type: "event",
-        },
-        {
-          anonymous: false,
-          inputs: [
-            {
-              indexed: true,
-              internalType: "address",
-              name: "_account",
-              type: "address",
-            },
+          inputs: [
             {
               indexed: true,
-              internalType: "uint256",
-              name: "_disputeID",
-              type: "uint256",
+              internalType: "contract IArbitrableV2",
+              name: "_arbitrable",
+              type: "address",
             },
             {
               indexed: true,
               internalType: "uint256",
-              name: "_roundID",
+              name: "_disputeID",
               type: "uint256",
             },
             {
               indexed: false,
               internalType: "uint256",
-              name: "_degreeOfCoherency",
+              name: "_ruling",
               type: "uint256",
             },
-            {
-              indexed: false,
-              internalType: "int256",
-              name: "_pnkAmount",
-              type: "int256",
-            },
-            {
-              indexed: false,
-              internalType: "int256",
-              name: "_feeAmount",
-              type: "int256",
-            },
-            {
-              indexed: false,
-              internalType: "contract IERC20",
-              name: "_feeToken",
-              type: "address",
-            },
           ],
-          name: "TokenAndETHShift",
+          name: "Ruling",
           type: "event",
         },
         {
@@ -22677,12 +23938,12 @@ export default {
         {
           inputs: [
             {
-              internalType: "address payable",
-              name: "_governor",
+              internalType: "address",
+              name: "_instructor",
               type: "address",
             },
           ],
-          name: "changeGovernor",
+          name: "changeInstructor",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
@@ -22691,11 +23952,11 @@ export default {
           inputs: [
             {
               internalType: "address",
-              name: "_instructor",
+              name: "_jurorProsecutionModule",
               type: "address",
             },
           ],
-          name: "changeInstructor",
+          name: "changeJurorProsecutionModule",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
@@ -22703,12 +23964,12 @@ export default {
         {
           inputs: [
             {
-              internalType: "address",
-              name: "_jurorProsecutionModule",
+              internalType: "address payable",
+              name: "_owner",
               type: "address",
             },
           ],
-          name: "changeJurorProsecutionModule",
+          name: "changeOwner",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
@@ -22803,11 +24064,6 @@ export default {
               name: "jurorsForCourtJump",
               type: "uint256",
             },
-            {
-              internalType: "bool",
-              name: "disabled",
-              type: "bool",
-            },
           ],
           stateMutability: "view",
           type: "function",
@@ -23116,7 +24372,7 @@ export default {
               type: "bytes",
             },
           ],
-          name: "executeGovernorProposal",
+          name: "executeOwnerProposal",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
@@ -23185,6 +24441,30 @@ export default {
           stateMutability: "view",
           type: "function",
         },
+        {
+          inputs: [
+            {
+              internalType: "uint256",
+              name: "_disputeID",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "_round",
+              type: "uint256",
+            },
+          ],
+          name: "getPnkAtStakePerJuror",
+          outputs: [
+            {
+              internalType: "uint256",
+              name: "",
+              type: "uint256",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -23237,6 +24517,11 @@ export default {
                   name: "drawnJurors",
                   type: "address[]",
                 },
+                {
+                  internalType: "uint96[]",
+                  name: "drawnJurorFromCourtIDs",
+                  type: "uint96[]",
+                },
                 {
                   internalType: "uint256",
                   name: "sumFeeRewardPaid",
@@ -23257,6 +24542,11 @@ export default {
                   name: "drawIterations",
                   type: "uint256",
                 },
+                {
+                  internalType: "uint256[10]",
+                  name: "__gap",
+                  type: "uint256[10]",
+                },
               ],
               internalType: "struct KlerosCoreUniversity.Round",
               name: "",
@@ -23285,24 +24575,11 @@ export default {
           stateMutability: "view",
           type: "function",
         },
-        {
-          inputs: [],
-          name: "governor",
-          outputs: [
-            {
-              internalType: "address",
-              name: "",
-              type: "address",
-            },
-          ],
-          stateMutability: "view",
-          type: "function",
-        },
         {
           inputs: [
             {
               internalType: "address",
-              name: "_governor",
+              name: "_owner",
               type: "address",
             },
             {
@@ -23420,6 +24697,19 @@ export default {
           stateMutability: "view",
           type: "function",
         },
+        {
+          inputs: [],
+          name: "owner",
+          outputs: [
+            {
+              internalType: "address",
+              name: "",
+              type: "address",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -23494,11 +24784,6 @@ export default {
               name: "_newStake",
               type: "uint256",
             },
-            {
-              internalType: "bool",
-              name: "_alreadyTransferred",
-              type: "bool",
-            },
           ],
           name: "setStakeBySortitionModule",
           outputs: [],
@@ -23518,6 +24803,24 @@ export default {
           stateMutability: "view",
           type: "function",
         },
+        {
+          inputs: [
+            {
+              internalType: "address",
+              name: "_account",
+              type: "address",
+            },
+            {
+              internalType: "uint256",
+              name: "_amount",
+              type: "uint256",
+            },
+          ],
+          name: "transferBySortitionModule",
+          outputs: [],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -23536,6 +24839,19 @@ export default {
           stateMutability: "payable",
           type: "function",
         },
+        {
+          inputs: [],
+          name: "version",
+          outputs: [
+            {
+              internalType: "string",
+              name: "",
+              type: "string",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -23555,7 +24871,7 @@ export default {
       ],
     },
     KlerosCoreUniversity_Implementation: {
-      address: "0xF74DaBfC5F5dbdBD07636637204d9C35326D2906",
+      address: "0xb75b0cc01af4aD0D65D50082ae0717004D479Aa0",
       abi: [
         {
           inputs: [],
@@ -23587,11 +24903,6 @@ export default {
           name: "ArbitrationFeesNotEnough",
           type: "error",
         },
-        {
-          inputs: [],
-          name: "ArraysLengthMismatch",
-          type: "error",
-        },
         {
           inputs: [],
           name: "CannotDisableClassicDK",
@@ -23602,11 +24913,6 @@ export default {
           name: "CommitPeriodNotPassed",
           type: "error",
         },
-        {
-          inputs: [],
-          name: "DepthLevelMax",
-          type: "error",
-        },
         {
           inputs: [],
           name: "DisputeKitNotSupportedByCourt",
@@ -23642,16 +24948,6 @@ export default {
           name: "FailedDelegateCall",
           type: "error",
         },
-        {
-          inputs: [],
-          name: "GovernorOnly",
-          type: "error",
-        },
-        {
-          inputs: [],
-          name: "GovernorOrInstructorOnly",
-          type: "error",
-        },
         {
           inputs: [],
           name: "InstructorOnly",
@@ -23708,6 +25004,16 @@ export default {
           name: "NotInitializing",
           type: "error",
         },
+        {
+          inputs: [],
+          name: "OwnerOnly",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "OwnerOrInstructorOnly",
+          type: "error",
+        },
         {
           inputs: [],
           name: "RulingAlreadyExecuted",
@@ -23730,7 +25036,7 @@ export default {
         },
         {
           inputs: [],
-          name: "StakingNotPossibeInThisCourt",
+          name: "StakingNotPossibleInThisCourt",
           type: "error",
         },
         {
@@ -23738,6 +25044,11 @@ export default {
           name: "StakingTransferFailed",
           type: "error",
         },
+        {
+          inputs: [],
+          name: "StakingZeroWhenNoStake",
+          type: "error",
+        },
         {
           inputs: [],
           name: "TokenNotAccepted",
@@ -23851,9 +25162,9 @@ export default {
           inputs: [
             {
               indexed: true,
-              internalType: "uint256",
+              internalType: "uint96",
               name: "_courtID",
-              type: "uint256",
+              type: "uint96",
             },
             {
               indexed: true,
@@ -24128,6 +25439,12 @@ export default {
         {
           anonymous: false,
           inputs: [
+            {
+              indexed: true,
+              internalType: "address",
+              name: "_account",
+              type: "address",
+            },
             {
               indexed: true,
               internalType: "uint256",
@@ -24143,15 +25460,27 @@ export default {
             {
               indexed: false,
               internalType: "uint256",
-              name: "_pnkAmount",
+              name: "_degreeOfCoherencyPnk",
               type: "uint256",
             },
             {
               indexed: false,
               internalType: "uint256",
-              name: "_feeAmount",
+              name: "_degreeOfCoherencyFee",
               type: "uint256",
             },
+            {
+              indexed: false,
+              internalType: "int256",
+              name: "_amountPnk",
+              type: "int256",
+            },
+            {
+              indexed: false,
+              internalType: "int256",
+              name: "_amountFee",
+              type: "int256",
+            },
             {
               indexed: false,
               internalType: "contract IERC20",
@@ -24159,7 +25488,7 @@ export default {
               type: "address",
             },
           ],
-          name: "LeftoverRewardSent",
+          name: "JurorRewardPenalty",
           type: "event",
         },
         {
@@ -24167,24 +25496,36 @@ export default {
           inputs: [
             {
               indexed: true,
-              internalType: "contract IERC20",
-              name: "_feeToken",
-              type: "address",
+              internalType: "uint256",
+              name: "_disputeID",
+              type: "uint256",
+            },
+            {
+              indexed: true,
+              internalType: "uint256",
+              name: "_roundID",
+              type: "uint256",
             },
             {
               indexed: false,
-              internalType: "uint64",
-              name: "_rateInEth",
-              type: "uint64",
+              internalType: "uint256",
+              name: "_amountPnk",
+              type: "uint256",
             },
             {
               indexed: false,
-              internalType: "uint8",
-              name: "_rateDecimals",
-              type: "uint8",
+              internalType: "uint256",
+              name: "_amountFee",
+              type: "uint256",
+            },
+            {
+              indexed: false,
+              internalType: "contract IERC20",
+              name: "_feeToken",
+              type: "address",
             },
           ],
-          name: "NewCurrencyRate",
+          name: "LeftoverRewardSent",
           type: "event",
         },
         {
@@ -24192,43 +25533,43 @@ export default {
           inputs: [
             {
               indexed: true,
-              internalType: "uint256",
-              name: "_disputeID",
-              type: "uint256",
+              internalType: "contract IERC20",
+              name: "_feeToken",
+              type: "address",
             },
             {
               indexed: false,
-              internalType: "enum KlerosCoreUniversity.Period",
-              name: "_period",
+              internalType: "uint64",
+              name: "_rateInEth",
+              type: "uint64",
+            },
+            {
+              indexed: false,
+              internalType: "uint8",
+              name: "_rateDecimals",
               type: "uint8",
             },
           ],
-          name: "NewPeriod",
+          name: "NewCurrencyRate",
           type: "event",
         },
         {
           anonymous: false,
           inputs: [
-            {
-              indexed: true,
-              internalType: "contract IArbitrableV2",
-              name: "_arbitrable",
-              type: "address",
-            },
             {
               indexed: true,
               internalType: "uint256",
               name: "_disputeID",
               type: "uint256",
             },
-            {
-              indexed: false,
-              internalType: "uint256",
-              name: "_ruling",
-              type: "uint256",
+            {
+              indexed: false,
+              internalType: "enum KlerosCoreUniversity.Period",
+              name: "_period",
+              type: "uint8",
             },
           ],
-          name: "Ruling",
+          name: "NewPeriod",
           type: "event",
         },
         {
@@ -24236,8 +25577,8 @@ export default {
           inputs: [
             {
               indexed: true,
-              internalType: "address",
-              name: "_account",
+              internalType: "contract IArbitrableV2",
+              name: "_arbitrable",
               type: "address",
             },
             {
@@ -24246,38 +25587,14 @@ export default {
               name: "_disputeID",
               type: "uint256",
             },
-            {
-              indexed: true,
-              internalType: "uint256",
-              name: "_roundID",
-              type: "uint256",
-            },
             {
               indexed: false,
               internalType: "uint256",
-              name: "_degreeOfCoherency",
+              name: "_ruling",
               type: "uint256",
             },
-            {
-              indexed: false,
-              internalType: "int256",
-              name: "_pnkAmount",
-              type: "int256",
-            },
-            {
-              indexed: false,
-              internalType: "int256",
-              name: "_feeAmount",
-              type: "int256",
-            },
-            {
-              indexed: false,
-              internalType: "contract IERC20",
-              name: "_feeToken",
-              type: "address",
-            },
           ],
-          name: "TokenAndETHShift",
+          name: "Ruling",
           type: "event",
         },
         {
@@ -24502,12 +25819,12 @@ export default {
         {
           inputs: [
             {
-              internalType: "address payable",
-              name: "_governor",
+              internalType: "address",
+              name: "_instructor",
               type: "address",
             },
           ],
-          name: "changeGovernor",
+          name: "changeInstructor",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
@@ -24516,11 +25833,11 @@ export default {
           inputs: [
             {
               internalType: "address",
-              name: "_instructor",
+              name: "_jurorProsecutionModule",
               type: "address",
             },
           ],
-          name: "changeInstructor",
+          name: "changeJurorProsecutionModule",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
@@ -24528,12 +25845,12 @@ export default {
         {
           inputs: [
             {
-              internalType: "address",
-              name: "_jurorProsecutionModule",
+              internalType: "address payable",
+              name: "_owner",
               type: "address",
             },
           ],
-          name: "changeJurorProsecutionModule",
+          name: "changeOwner",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
@@ -24628,11 +25945,6 @@ export default {
               name: "jurorsForCourtJump",
               type: "uint256",
             },
-            {
-              internalType: "bool",
-              name: "disabled",
-              type: "bool",
-            },
           ],
           stateMutability: "view",
           type: "function",
@@ -24941,7 +26253,7 @@ export default {
               type: "bytes",
             },
           ],
-          name: "executeGovernorProposal",
+          name: "executeOwnerProposal",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
@@ -25010,6 +26322,30 @@ export default {
           stateMutability: "view",
           type: "function",
         },
+        {
+          inputs: [
+            {
+              internalType: "uint256",
+              name: "_disputeID",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "_round",
+              type: "uint256",
+            },
+          ],
+          name: "getPnkAtStakePerJuror",
+          outputs: [
+            {
+              internalType: "uint256",
+              name: "",
+              type: "uint256",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -25062,6 +26398,11 @@ export default {
                   name: "drawnJurors",
                   type: "address[]",
                 },
+                {
+                  internalType: "uint96[]",
+                  name: "drawnJurorFromCourtIDs",
+                  type: "uint96[]",
+                },
                 {
                   internalType: "uint256",
                   name: "sumFeeRewardPaid",
@@ -25082,6 +26423,11 @@ export default {
                   name: "drawIterations",
                   type: "uint256",
                 },
+                {
+                  internalType: "uint256[10]",
+                  name: "__gap",
+                  type: "uint256[10]",
+                },
               ],
               internalType: "struct KlerosCoreUniversity.Round",
               name: "",
@@ -25110,24 +26456,11 @@ export default {
           stateMutability: "view",
           type: "function",
         },
-        {
-          inputs: [],
-          name: "governor",
-          outputs: [
-            {
-              internalType: "address",
-              name: "",
-              type: "address",
-            },
-          ],
-          stateMutability: "view",
-          type: "function",
-        },
         {
           inputs: [
             {
               internalType: "address",
-              name: "_governor",
+              name: "_owner",
               type: "address",
             },
             {
@@ -25245,6 +26578,19 @@ export default {
           stateMutability: "view",
           type: "function",
         },
+        {
+          inputs: [],
+          name: "owner",
+          outputs: [
+            {
+              internalType: "address",
+              name: "",
+              type: "address",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -25319,11 +26665,6 @@ export default {
               name: "_newStake",
               type: "uint256",
             },
-            {
-              internalType: "bool",
-              name: "_alreadyTransferred",
-              type: "bool",
-            },
           ],
           name: "setStakeBySortitionModule",
           outputs: [],
@@ -25343,6 +26684,24 @@ export default {
           stateMutability: "view",
           type: "function",
         },
+        {
+          inputs: [
+            {
+              internalType: "address",
+              name: "_account",
+              type: "address",
+            },
+            {
+              internalType: "uint256",
+              name: "_amount",
+              type: "uint256",
+            },
+          ],
+          name: "transferBySortitionModule",
+          outputs: [],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -25361,10 +26720,23 @@ export default {
           stateMutability: "payable",
           type: "function",
         },
+        {
+          inputs: [],
+          name: "version",
+          outputs: [
+            {
+              internalType: "string",
+              name: "",
+              type: "string",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
       ],
     },
     KlerosCoreUniversity_Proxy: {
-      address: "0x5AB37F38778Bc175852fA353056591D91c744ce6",
+      address: "0xA34dBBD0E5e1d09bd683455f9dbC393797BC558f",
       abi: [
         {
           inputs: [
@@ -30005,7 +31377,7 @@ export default {
       ],
     },
     SortitionModuleUniversity: {
-      address: "0x4B2c2d048921f694cCE3AEa35698c6B1f5fcbb79",
+      address: "0x9f55804177e7E44E558616cD7d06B865788214cA",
       abi: [
         {
           stateMutability: "payable",
@@ -30036,11 +31408,26 @@ export default {
           name: "InvalidImplementation",
           type: "error",
         },
+        {
+          inputs: [],
+          name: "KlerosCoreOnly",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "NotEligibleForWithdrawal",
+          type: "error",
+        },
         {
           inputs: [],
           name: "NotInitializing",
           type: "error",
         },
+        {
+          inputs: [],
+          name: "OwnerOnly",
+          type: "error",
+        },
         {
           inputs: [],
           name: "UUPSUnauthorizedCallContext",
@@ -30070,6 +31457,44 @@ export default {
           name: "Initialized",
           type: "event",
         },
+        {
+          anonymous: false,
+          inputs: [
+            {
+              indexed: true,
+              internalType: "address",
+              name: "_account",
+              type: "address",
+            },
+            {
+              indexed: false,
+              internalType: "uint256",
+              name: "_amount",
+              type: "uint256",
+            },
+          ],
+          name: "LeftoverPNK",
+          type: "event",
+        },
+        {
+          anonymous: false,
+          inputs: [
+            {
+              indexed: true,
+              internalType: "address",
+              name: "_account",
+              type: "address",
+            },
+            {
+              indexed: false,
+              internalType: "uint256",
+              name: "_amount",
+              type: "uint256",
+            },
+          ],
+          name: "LeftoverPNKWithdrawn",
+          type: "event",
+        },
         {
           anonymous: false,
           inputs: [
@@ -30129,6 +31554,12 @@ export default {
               name: "_amount",
               type: "uint256",
             },
+            {
+              indexed: false,
+              internalType: "uint256",
+              name: "_amountAllCourts",
+              type: "uint256",
+            },
           ],
           name: "StakeSet",
           type: "event",
@@ -30180,9 +31611,9 @@ export default {
         {
           inputs: [
             {
-              internalType: "bytes32",
-              name: "_key",
-              type: "bytes32",
+              internalType: "uint96",
+              name: "_courtID",
+              type: "uint96",
             },
             {
               internalType: "bytes",
@@ -30201,40 +31632,89 @@ export default {
           outputs: [
             {
               internalType: "uint256",
-              name: "",
+              name: "",
+              type: "uint256",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [
+            {
+              internalType: "uint96",
+              name: "",
+              type: "uint96",
+            },
+            {
+              internalType: "uint256",
+              name: "",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "",
+              type: "uint256",
+            },
+          ],
+          name: "draw",
+          outputs: [
+            {
+              internalType: "address",
+              name: "drawnAddress",
+              type: "address",
+            },
+            {
+              internalType: "uint96",
+              name: "fromSubcourtID",
+              type: "uint96",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [
+            {
+              internalType: "uint256",
+              name: "_iterations",
               type: "uint256",
             },
           ],
-          stateMutability: "view",
+          name: "executeDelayedStakes",
+          outputs: [],
+          stateMutability: "nonpayable",
           type: "function",
         },
         {
           inputs: [
             {
-              internalType: "bytes32",
-              name: "",
-              type: "bytes32",
-            },
-            {
-              internalType: "uint256",
-              name: "",
-              type: "uint256",
+              internalType: "address",
+              name: "_account",
+              type: "address",
             },
             {
-              internalType: "uint256",
-              name: "",
-              type: "uint256",
+              internalType: "uint96",
+              name: "_courtID",
+              type: "uint96",
             },
           ],
-          name: "draw",
-          outputs: [
+          name: "forcedUnstake",
+          outputs: [],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
+        {
+          inputs: [
             {
               internalType: "address",
-              name: "drawnAddress",
+              name: "_account",
               type: "address",
             },
           ],
-          stateMutability: "view",
+          name: "forcedUnstakeAllCourts",
+          outputs: [],
+          stateMutability: "nonpayable",
           type: "function",
         },
         {
@@ -30296,15 +31776,21 @@ export default {
           type: "function",
         },
         {
-          inputs: [],
-          name: "governor",
-          outputs: [
+          inputs: [
             {
               internalType: "address",
-              name: "",
+              name: "_juror",
               type: "address",
             },
           ],
+          name: "getJurorLeftoverPNK",
+          outputs: [
+            {
+              internalType: "uint256",
+              name: "",
+              type: "uint256",
+            },
+          ],
           stateMutability: "view",
           type: "function",
         },
@@ -30312,7 +31798,7 @@ export default {
           inputs: [
             {
               internalType: "address",
-              name: "_governor",
+              name: "_owner",
               type: "address",
             },
             {
@@ -30388,32 +31874,21 @@ export default {
           type: "function",
         },
         {
-          inputs: [
+          inputs: [],
+          name: "owner",
+          outputs: [
             {
-              internalType: "uint256",
-              name: "_randomNumber",
-              type: "uint256",
+              internalType: "address",
+              name: "",
+              type: "address",
             },
           ],
-          name: "notifyRandomNumber",
-          outputs: [],
-          stateMutability: "nonpayable",
+          stateMutability: "view",
           type: "function",
         },
         {
-          inputs: [
-            {
-              internalType: "address",
-              name: "_account",
-              type: "address",
-            },
-            {
-              internalType: "uint256",
-              name: "_relativeAmount",
-              type: "uint256",
-            },
-          ],
-          name: "penalizeStake",
+          inputs: [],
+          name: "passPhase",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
@@ -30456,8 +31931,28 @@ export default {
               name: "_account",
               type: "address",
             },
+            {
+              internalType: "uint96",
+              name: "_courtID",
+              type: "uint96",
+            },
+            {
+              internalType: "uint256",
+              name: "_pnkDeposit",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "_pnkWithdrawal",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "_newStake",
+              type: "uint256",
+            },
           ],
-          name: "setJurorInactive",
+          name: "setStake",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
@@ -30476,31 +31971,55 @@ export default {
             },
             {
               internalType: "uint256",
-              name: "_newStake",
+              name: "_penalty",
               type: "uint256",
             },
-            {
-              internalType: "bool",
-              name: "_alreadyTransferred",
-              type: "bool",
-            },
           ],
-          name: "setStake",
+          name: "setStakePenalty",
           outputs: [
             {
               internalType: "uint256",
-              name: "pnkDeposit",
+              name: "pnkBalance",
               type: "uint256",
             },
             {
               internalType: "uint256",
-              name: "pnkWithdrawal",
+              name: "newCourtStake",
               type: "uint256",
             },
             {
-              internalType: "enum StakingResult",
-              name: "stakingResult",
-              type: "uint8",
+              internalType: "uint256",
+              name: "availablePenalty",
+              type: "uint256",
+            },
+          ],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
+        {
+          inputs: [
+            {
+              internalType: "address",
+              name: "_account",
+              type: "address",
+            },
+            {
+              internalType: "uint96",
+              name: "_courtID",
+              type: "uint96",
+            },
+            {
+              internalType: "uint256",
+              name: "_reward",
+              type: "uint256",
+            },
+          ],
+          name: "setStakeReward",
+          outputs: [
+            {
+              internalType: "bool",
+              name: "success",
+              type: "bool",
             },
           ],
           stateMutability: "nonpayable",
@@ -30555,6 +32074,76 @@ export default {
           stateMutability: "payable",
           type: "function",
         },
+        {
+          inputs: [
+            {
+              internalType: "address",
+              name: "_account",
+              type: "address",
+            },
+            {
+              internalType: "uint96",
+              name: "_courtID",
+              type: "uint96",
+            },
+            {
+              internalType: "uint256",
+              name: "_newStake",
+              type: "uint256",
+            },
+            {
+              internalType: "bool",
+              name: "",
+              type: "bool",
+            },
+          ],
+          name: "validateStake",
+          outputs: [
+            {
+              internalType: "uint256",
+              name: "pnkDeposit",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "pnkWithdrawal",
+              type: "uint256",
+            },
+            {
+              internalType: "enum StakingResult",
+              name: "stakingResult",
+              type: "uint8",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [],
+          name: "version",
+          outputs: [
+            {
+              internalType: "string",
+              name: "",
+              type: "string",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [
+            {
+              internalType: "address",
+              name: "_account",
+              type: "address",
+            },
+          ],
+          name: "withdrawLeftoverPNK",
+          outputs: [],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -30574,7 +32163,7 @@ export default {
       ],
     },
     SortitionModuleUniversity_Implementation: {
-      address: "0x5CAD621D69E0535422aCFaCC0017bC32beC7A486",
+      address: "0x270e3D63d3d275604df0a1Bd312E1255DCd96936",
       abi: [
         {
           inputs: [],
@@ -30602,11 +32191,26 @@ export default {
           name: "InvalidImplementation",
           type: "error",
         },
+        {
+          inputs: [],
+          name: "KlerosCoreOnly",
+          type: "error",
+        },
+        {
+          inputs: [],
+          name: "NotEligibleForWithdrawal",
+          type: "error",
+        },
         {
           inputs: [],
           name: "NotInitializing",
           type: "error",
         },
+        {
+          inputs: [],
+          name: "OwnerOnly",
+          type: "error",
+        },
         {
           inputs: [],
           name: "UUPSUnauthorizedCallContext",
@@ -30628,12 +32232,50 @@ export default {
           inputs: [
             {
               indexed: false,
-              internalType: "uint64",
-              name: "version",
-              type: "uint64",
+              internalType: "uint64",
+              name: "version",
+              type: "uint64",
+            },
+          ],
+          name: "Initialized",
+          type: "event",
+        },
+        {
+          anonymous: false,
+          inputs: [
+            {
+              indexed: true,
+              internalType: "address",
+              name: "_account",
+              type: "address",
+            },
+            {
+              indexed: false,
+              internalType: "uint256",
+              name: "_amount",
+              type: "uint256",
+            },
+          ],
+          name: "LeftoverPNK",
+          type: "event",
+        },
+        {
+          anonymous: false,
+          inputs: [
+            {
+              indexed: true,
+              internalType: "address",
+              name: "_account",
+              type: "address",
+            },
+            {
+              indexed: false,
+              internalType: "uint256",
+              name: "_amount",
+              type: "uint256",
             },
           ],
-          name: "Initialized",
+          name: "LeftoverPNKWithdrawn",
           type: "event",
         },
         {
@@ -30695,6 +32337,12 @@ export default {
               name: "_amount",
               type: "uint256",
             },
+            {
+              indexed: false,
+              internalType: "uint256",
+              name: "_amountAllCourts",
+              type: "uint256",
+            },
           ],
           name: "StakeSet",
           type: "event",
@@ -30746,9 +32394,9 @@ export default {
         {
           inputs: [
             {
-              internalType: "bytes32",
-              name: "_key",
-              type: "bytes32",
+              internalType: "uint96",
+              name: "_courtID",
+              type: "uint96",
             },
             {
               internalType: "bytes",
@@ -30777,9 +32425,9 @@ export default {
         {
           inputs: [
             {
-              internalType: "bytes32",
+              internalType: "uint96",
               name: "",
-              type: "bytes32",
+              type: "uint96",
             },
             {
               internalType: "uint256",
@@ -30799,10 +32447,59 @@ export default {
               name: "drawnAddress",
               type: "address",
             },
+            {
+              internalType: "uint96",
+              name: "fromSubcourtID",
+              type: "uint96",
+            },
           ],
           stateMutability: "view",
           type: "function",
         },
+        {
+          inputs: [
+            {
+              internalType: "uint256",
+              name: "_iterations",
+              type: "uint256",
+            },
+          ],
+          name: "executeDelayedStakes",
+          outputs: [],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
+        {
+          inputs: [
+            {
+              internalType: "address",
+              name: "_account",
+              type: "address",
+            },
+            {
+              internalType: "uint96",
+              name: "_courtID",
+              type: "uint96",
+            },
+          ],
+          name: "forcedUnstake",
+          outputs: [],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
+        {
+          inputs: [
+            {
+              internalType: "address",
+              name: "_account",
+              type: "address",
+            },
+          ],
+          name: "forcedUnstakeAllCourts",
+          outputs: [],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
         {
           inputs: [
             {
@@ -30862,15 +32559,21 @@ export default {
           type: "function",
         },
         {
-          inputs: [],
-          name: "governor",
-          outputs: [
+          inputs: [
             {
               internalType: "address",
-              name: "",
+              name: "_juror",
               type: "address",
             },
           ],
+          name: "getJurorLeftoverPNK",
+          outputs: [
+            {
+              internalType: "uint256",
+              name: "",
+              type: "uint256",
+            },
+          ],
           stateMutability: "view",
           type: "function",
         },
@@ -30878,7 +32581,7 @@ export default {
           inputs: [
             {
               internalType: "address",
-              name: "_governor",
+              name: "_owner",
               type: "address",
             },
             {
@@ -30954,32 +32657,21 @@ export default {
           type: "function",
         },
         {
-          inputs: [
+          inputs: [],
+          name: "owner",
+          outputs: [
             {
-              internalType: "uint256",
-              name: "_randomNumber",
-              type: "uint256",
+              internalType: "address",
+              name: "",
+              type: "address",
             },
           ],
-          name: "notifyRandomNumber",
-          outputs: [],
-          stateMutability: "nonpayable",
+          stateMutability: "view",
           type: "function",
         },
         {
-          inputs: [
-            {
-              internalType: "address",
-              name: "_account",
-              type: "address",
-            },
-            {
-              internalType: "uint256",
-              name: "_relativeAmount",
-              type: "uint256",
-            },
-          ],
-          name: "penalizeStake",
+          inputs: [],
+          name: "passPhase",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
@@ -31022,8 +32714,28 @@ export default {
               name: "_account",
               type: "address",
             },
+            {
+              internalType: "uint96",
+              name: "_courtID",
+              type: "uint96",
+            },
+            {
+              internalType: "uint256",
+              name: "_pnkDeposit",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "_pnkWithdrawal",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "_newStake",
+              type: "uint256",
+            },
           ],
-          name: "setJurorInactive",
+          name: "setStake",
           outputs: [],
           stateMutability: "nonpayable",
           type: "function",
@@ -31042,31 +32754,55 @@ export default {
             },
             {
               internalType: "uint256",
-              name: "_newStake",
+              name: "_penalty",
               type: "uint256",
             },
-            {
-              internalType: "bool",
-              name: "_alreadyTransferred",
-              type: "bool",
-            },
           ],
-          name: "setStake",
+          name: "setStakePenalty",
           outputs: [
             {
               internalType: "uint256",
-              name: "pnkDeposit",
+              name: "pnkBalance",
               type: "uint256",
             },
             {
               internalType: "uint256",
-              name: "pnkWithdrawal",
+              name: "newCourtStake",
               type: "uint256",
             },
             {
-              internalType: "enum StakingResult",
-              name: "stakingResult",
-              type: "uint8",
+              internalType: "uint256",
+              name: "availablePenalty",
+              type: "uint256",
+            },
+          ],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
+        {
+          inputs: [
+            {
+              internalType: "address",
+              name: "_account",
+              type: "address",
+            },
+            {
+              internalType: "uint96",
+              name: "_courtID",
+              type: "uint96",
+            },
+            {
+              internalType: "uint256",
+              name: "_reward",
+              type: "uint256",
+            },
+          ],
+          name: "setStakeReward",
+          outputs: [
+            {
+              internalType: "bool",
+              name: "success",
+              type: "bool",
             },
           ],
           stateMutability: "nonpayable",
@@ -31121,10 +32857,80 @@ export default {
           stateMutability: "payable",
           type: "function",
         },
+        {
+          inputs: [
+            {
+              internalType: "address",
+              name: "_account",
+              type: "address",
+            },
+            {
+              internalType: "uint96",
+              name: "_courtID",
+              type: "uint96",
+            },
+            {
+              internalType: "uint256",
+              name: "_newStake",
+              type: "uint256",
+            },
+            {
+              internalType: "bool",
+              name: "",
+              type: "bool",
+            },
+          ],
+          name: "validateStake",
+          outputs: [
+            {
+              internalType: "uint256",
+              name: "pnkDeposit",
+              type: "uint256",
+            },
+            {
+              internalType: "uint256",
+              name: "pnkWithdrawal",
+              type: "uint256",
+            },
+            {
+              internalType: "enum StakingResult",
+              name: "stakingResult",
+              type: "uint8",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [],
+          name: "version",
+          outputs: [
+            {
+              internalType: "string",
+              name: "",
+              type: "string",
+            },
+          ],
+          stateMutability: "view",
+          type: "function",
+        },
+        {
+          inputs: [
+            {
+              internalType: "address",
+              name: "_account",
+              type: "address",
+            },
+          ],
+          name: "withdrawLeftoverPNK",
+          outputs: [],
+          stateMutability: "nonpayable",
+          type: "function",
+        },
       ],
     },
     SortitionModuleUniversity_Proxy: {
-      address: "0x4B2c2d048921f694cCE3AEa35698c6B1f5fcbb79",
+      address: "0x9f55804177e7E44E558616cD7d06B865788214cA",
       abi: [
         {
           inputs: [
@@ -32953,7 +34759,7 @@ export default {
       ],
     },
     VeaInboxArbToEthTestnet: {
-      address: "0xE12daFE59Bc3A996362d54b37DFd2BA9279cAd06",
+      address: "0xAA4F00c86bf956C0Fae603D030CBc2dA7f8B7C5B",
       abi: [
         {
           inputs: [
@@ -33502,7 +35308,7 @@ export default {
       ],
     },
     VeaInboxArbToGnosisTestnet: {
-      address: "0x62403e9Fbac618301175C89fb21920e4FF235A6a",
+      address: "0xa0d410b202D69C36871d5135ce42fC7D379BBB1c",
       abi: [
         {
           inputs: [
diff --git a/contracts/deployments/arbitrumSepoliaDevnet/DisputeKitClassicUniversity.json b/contracts/deployments/arbitrumSepoliaDevnet/DisputeKitClassicUniversity.json
index 19f34b347..baac41f51 100644
--- a/contracts/deployments/arbitrumSepoliaDevnet/DisputeKitClassicUniversity.json
+++ b/contracts/deployments/arbitrumSepoliaDevnet/DisputeKitClassicUniversity.json
@@ -1,5 +1,5 @@
 {
-  "address": "0xd6E96b7c993763B5CDDa1139C7387B82A7c8B8B5",
+  "address": "0x82F2089442979A6b56c80274D144575980092F91",
   "abi": [
     {
       "stateMutability": "payable",
@@ -14,11 +14,61 @@
       "name": "AlreadyInitialized",
       "type": "error"
     },
+    {
+      "inputs": [],
+      "name": "AppealFeeIsAlreadyPaid",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "AppealPeriodIsOver",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "AppealPeriodIsOverForLoser",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "ChoiceOutOfBounds",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "CoreIsPaused",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "DisputeJumpedToParentDK",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "DisputeNotResolved",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "EmptyCommit",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "EmptyVoteIDs",
+      "type": "error"
+    },
     {
       "inputs": [],
       "name": "FailedDelegateCall",
       "type": "error"
     },
+    {
+      "inputs": [],
+      "name": "HashDoesNotMatchHiddenVoteCommitment",
+      "type": "error"
+    },
     {
       "inputs": [
         {
@@ -30,11 +80,41 @@
       "name": "InvalidImplementation",
       "type": "error"
     },
+    {
+      "inputs": [],
+      "name": "JurorHasToOwnTheVote",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "KlerosCoreOnly",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "NotActiveForCoreDisputeID",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "NotCommitPeriod",
+      "type": "error"
+    },
     {
       "inputs": [],
       "name": "NotInitializing",
       "type": "error"
     },
+    {
+      "inputs": [],
+      "name": "NotVotePeriod",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "OwnerOnly",
+      "type": "error"
+    },
     {
       "inputs": [],
       "name": "UUPSUnauthorizedCallContext",
@@ -51,6 +131,16 @@
       "name": "UUPSUnsupportedProxiableUUID",
       "type": "error"
     },
+    {
+      "inputs": [],
+      "name": "UnsuccessfulCall",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "VoteAlreadyCast",
+      "type": "error"
+    },
     {
       "anonymous": false,
       "inputs": [
@@ -295,19 +385,6 @@
       "stateMutability": "view",
       "type": "function"
     },
-    {
-      "inputs": [],
-      "name": "ONE_BASIS_POINT",
-      "outputs": [
-        {
-          "internalType": "uint256",
-          "name": "",
-          "type": "uint256"
-        }
-      ],
-      "stateMutability": "view",
-      "type": "function"
-    },
     {
       "inputs": [],
       "name": "WINNER_STAKE_MULTIPLIER",
@@ -428,15 +505,28 @@
       "stateMutability": "nonpayable",
       "type": "function"
     },
+    {
+      "inputs": [
+        {
+          "internalType": "uint256",
+          "name": "_jumpDisputeKitID",
+          "type": "uint256"
+        }
+      ],
+      "name": "changeJumpDisputeKitID",
+      "outputs": [],
+      "stateMutability": "nonpayable",
+      "type": "function"
+    },
     {
       "inputs": [
         {
           "internalType": "address payable",
-          "name": "_governor",
+          "name": "_owner",
           "type": "address"
         }
       ],
-      "name": "changeGovernor",
+      "name": "changeOwner",
       "outputs": [],
       "stateMutability": "nonpayable",
       "type": "function"
@@ -454,6 +544,25 @@
       "stateMutability": "view",
       "type": "function"
     },
+    {
+      "inputs": [
+        {
+          "internalType": "uint256",
+          "name": "coreDisputeID",
+          "type": "uint256"
+        }
+      ],
+      "name": "coreDisputeIDToActive",
+      "outputs": [
+        {
+          "internalType": "bool",
+          "name": "",
+          "type": "bool"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
     {
       "inputs": [
         {
@@ -492,7 +601,7 @@
         },
         {
           "internalType": "uint256",
-          "name": "_nbVotes",
+          "name": "",
           "type": "uint256"
         }
       ],
@@ -578,11 +687,35 @@
           "internalType": "address",
           "name": "drawnAddress",
           "type": "address"
+        },
+        {
+          "internalType": "uint96",
+          "name": "fromSubcourtID",
+          "type": "uint96"
         }
       ],
       "stateMutability": "nonpayable",
       "type": "function"
     },
+    {
+      "inputs": [
+        {
+          "internalType": "uint256",
+          "name": "",
+          "type": "uint256"
+        }
+      ],
+      "name": "earlyCourtJump",
+      "outputs": [
+        {
+          "internalType": "bool",
+          "name": "",
+          "type": "bool"
+        }
+      ],
+      "stateMutability": "pure",
+      "type": "function"
+    },
     {
       "inputs": [
         {
@@ -601,7 +734,7 @@
           "type": "bytes"
         }
       ],
-      "name": "executeGovernorProposal",
+      "name": "executeOwnerProposal",
       "outputs": [],
       "stateMutability": "nonpayable",
       "type": "function"
@@ -676,14 +809,58 @@
           "type": "uint256"
         }
       ],
-      "name": "getDegreeOfCoherence",
+      "name": "getDegreeOfCoherencePenalty",
       "outputs": [
+        {
+          "internalType": "uint256",
+          "name": "pnkCoherence",
+          "type": "uint256"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "uint256",
+          "name": "_coreDisputeID",
+          "type": "uint256"
+        },
+        {
+          "internalType": "uint256",
+          "name": "_coreRoundID",
+          "type": "uint256"
+        },
+        {
+          "internalType": "uint256",
+          "name": "_voteID",
+          "type": "uint256"
+        },
+        {
+          "internalType": "uint256",
+          "name": "",
+          "type": "uint256"
+        },
         {
           "internalType": "uint256",
           "name": "",
           "type": "uint256"
         }
       ],
+      "name": "getDegreeOfCoherenceReward",
+      "outputs": [
+        {
+          "internalType": "uint256",
+          "name": "pnkCoherence",
+          "type": "uint256"
+        },
+        {
+          "internalType": "uint256",
+          "name": "feeCoherence",
+          "type": "uint256"
+        }
+      ],
       "stateMutability": "view",
       "type": "function"
     },
@@ -706,6 +883,91 @@
       "stateMutability": "view",
       "type": "function"
     },
+    {
+      "inputs": [],
+      "name": "getJumpDisputeKitID",
+      "outputs": [
+        {
+          "internalType": "uint256",
+          "name": "",
+          "type": "uint256"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "uint256",
+          "name": "_coreDisputeID",
+          "type": "uint256"
+        },
+        {
+          "internalType": "uint256",
+          "name": "_coreRoundID",
+          "type": "uint256"
+        }
+      ],
+      "name": "getLocalDisputeRoundID",
+      "outputs": [
+        {
+          "internalType": "uint256",
+          "name": "localDisputeID",
+          "type": "uint256"
+        },
+        {
+          "internalType": "uint256",
+          "name": "localRoundID",
+          "type": "uint256"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "contract IDisputeKit",
+          "name": "",
+          "type": "address"
+        },
+        {
+          "internalType": "uint256",
+          "name": "_currentNbVotes",
+          "type": "uint256"
+        }
+      ],
+      "name": "getNbVotesAfterAppeal",
+      "outputs": [
+        {
+          "internalType": "uint256",
+          "name": "",
+          "type": "uint256"
+        }
+      ],
+      "stateMutability": "pure",
+      "type": "function"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "uint256",
+          "name": "_localDisputeID",
+          "type": "uint256"
+        }
+      ],
+      "name": "getNumberOfRounds",
+      "outputs": [
+        {
+          "internalType": "uint256",
+          "name": "",
+          "type": "uint256"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
     {
       "inputs": [
         {
@@ -743,7 +1005,7 @@
         },
         {
           "internalType": "uint256",
-          "name": "totalCommited",
+          "name": "totalCommitted",
           "type": "uint256"
         },
         {
@@ -805,13 +1067,29 @@
       "type": "function"
     },
     {
-      "inputs": [],
-      "name": "governor",
+      "inputs": [
+        {
+          "internalType": "uint256",
+          "name": "_choice",
+          "type": "uint256"
+        },
+        {
+          "internalType": "uint256",
+          "name": "_salt",
+          "type": "uint256"
+        },
+        {
+          "internalType": "string",
+          "name": "",
+          "type": "string"
+        }
+      ],
+      "name": "hashVote",
       "outputs": [
         {
-          "internalType": "address",
+          "internalType": "bytes32",
           "name": "",
-          "type": "address"
+          "type": "bytes32"
         }
       ],
       "stateMutability": "view",
@@ -821,13 +1099,23 @@
       "inputs": [
         {
           "internalType": "address",
-          "name": "_governor",
+          "name": "_owner",
           "type": "address"
         },
         {
           "internalType": "contract KlerosCore",
           "name": "_core",
           "type": "address"
+        },
+        {
+          "internalType": "address",
+          "name": "_wNative",
+          "type": "address"
+        },
+        {
+          "internalType": "uint256",
+          "name": "_jumpDisputeKitID",
+          "type": "uint256"
         }
       ],
       "name": "initialize",
@@ -835,6 +1123,25 @@
       "stateMutability": "nonpayable",
       "type": "function"
     },
+    {
+      "inputs": [
+        {
+          "internalType": "uint256",
+          "name": "_coreDisputeID",
+          "type": "uint256"
+        }
+      ],
+      "name": "isAppealFunded",
+      "outputs": [
+        {
+          "internalType": "bool",
+          "name": "",
+          "type": "bool"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
     {
       "inputs": [
         {
@@ -864,6 +1171,32 @@
       "stateMutability": "view",
       "type": "function"
     },
+    {
+      "inputs": [],
+      "name": "jumpDisputeKitID",
+      "outputs": [
+        {
+          "internalType": "uint256",
+          "name": "",
+          "type": "uint256"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
+    {
+      "inputs": [],
+      "name": "owner",
+      "outputs": [
+        {
+          "internalType": "address",
+          "name": "",
+          "type": "address"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
     {
       "inputs": [],
       "name": "proxiableUUID",
@@ -877,6 +1210,19 @@
       "stateMutability": "view",
       "type": "function"
     },
+    {
+      "inputs": [],
+      "name": "singleDrawPerJuror",
+      "outputs": [
+        {
+          "internalType": "bool",
+          "name": "",
+          "type": "bool"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
     {
       "inputs": [
         {
@@ -895,6 +1241,32 @@
       "stateMutability": "payable",
       "type": "function"
     },
+    {
+      "inputs": [],
+      "name": "version",
+      "outputs": [
+        {
+          "internalType": "string",
+          "name": "",
+          "type": "string"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
+    {
+      "inputs": [],
+      "name": "wNative",
+      "outputs": [
+        {
+          "internalType": "address",
+          "name": "",
+          "type": "address"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
     {
       "inputs": [
         {
@@ -946,52 +1318,54 @@
       "type": "constructor"
     }
   ],
-  "transactionHash": "0xbe90d4066f62381a1a2c725364c3d35093e1ff685736f3fa0a7b75c3b0e82f93",
+  "transactionHash": "0xbc5117fa79c44f4304b16dfe26f072d80a71dce7cf9986f10f363c6e20457bd5",
   "receipt": {
     "to": null,
     "from": "0xf1C7c037891525E360C59f708739Ac09A7670c59",
-    "contractAddress": "0xd6E96b7c993763B5CDDa1139C7387B82A7c8B8B5",
-    "transactionIndex": 1,
-    "gasUsed": "189732",
-    "logsBloom": "0x00000000000000000000000000000000000000000000000000000000000000000000000000004000400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000200000000000000000000000000000000000000000000000000000000000000000000000000000000800000000000000000000000080000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
-    "blockHash": "0x1e4647532736ec4a239971727f05a17b1bb50fc89c0ec7a8da6e34f4f5bfcc90",
-    "transactionHash": "0xbe90d4066f62381a1a2c725364c3d35093e1ff685736f3fa0a7b75c3b0e82f93",
+    "contractAddress": "0x82F2089442979A6b56c80274D144575980092F91",
+    "transactionIndex": 2,
+    "gasUsed": "205891",
+    "logsBloom": "0x00000000000000000000000000000000000000000000000000000000000000000000000080000001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000800000000000000000000000080000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+    "blockHash": "0x11a1f340150df5f9ad32caef5cb1157e97be0914fb56af4c3835a86a743a5184",
+    "transactionHash": "0xbc5117fa79c44f4304b16dfe26f072d80a71dce7cf9986f10f363c6e20457bd5",
     "logs": [
       {
-        "transactionIndex": 1,
-        "blockNumber": 96308536,
-        "transactionHash": "0xbe90d4066f62381a1a2c725364c3d35093e1ff685736f3fa0a7b75c3b0e82f93",
-        "address": "0xd6E96b7c993763B5CDDa1139C7387B82A7c8B8B5",
+        "transactionIndex": 2,
+        "blockNumber": 193533776,
+        "transactionHash": "0xbc5117fa79c44f4304b16dfe26f072d80a71dce7cf9986f10f363c6e20457bd5",
+        "address": "0x82F2089442979A6b56c80274D144575980092F91",
         "topics": [
           "0xc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d2"
         ],
         "data": "0x0000000000000000000000000000000000000000000000000000000000000001",
-        "logIndex": 0,
-        "blockHash": "0x1e4647532736ec4a239971727f05a17b1bb50fc89c0ec7a8da6e34f4f5bfcc90"
+        "logIndex": 4,
+        "blockHash": "0x11a1f340150df5f9ad32caef5cb1157e97be0914fb56af4c3835a86a743a5184"
       }
     ],
-    "blockNumber": 96308536,
-    "cumulativeGasUsed": "189732",
+    "blockNumber": 193533776,
+    "cumulativeGasUsed": "320063",
     "status": 1,
     "byzantium": true
   },
   "args": [
-    "0x87e863b94d2CB79A8aB53bD87Dc4A10E11C0918B",
-    "0x485cc955000000000000000000000000f1c7c037891525e360c59f708739ac09a7670c590000000000000000000000000000000000000000000000000000000000000000"
+    "0x602ADa1cE706404BFb5417e497cdDae934436081",
+    "0xcf756fdf000000000000000000000000f1c7c037891525e360c59f708739ac09a7670c5900000000000000000000000000000000000000000000000000000000000000000000000000000000000000003829a2486d53ee984a0ca2d76552715726b771380000000000000000000000000000000000000000000000000000000000000001"
   ],
   "numDeployments": 1,
-  "solcInputHash": "a5602534c00c2f67ca4b6a1cab8c717e",
-  "metadata": "{\"compiler\":{\"version\":\"0.8.24+commit.e11b9ed9\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_implementation\",\"type\":\"address\"},{\"internalType\":\"bytes\",\"name\":\"_data\",\"type\":\"bytes\"}],\"stateMutability\":\"nonpayable\",\"type\":\"constructor\"},{\"stateMutability\":\"payable\",\"type\":\"fallback\"},{\"stateMutability\":\"payable\",\"type\":\"receive\"}],\"devdoc\":{\"kind\":\"dev\",\"methods\":{},\"version\":1},\"userdoc\":{\"kind\":\"user\",\"methods\":{},\"version\":1}},\"settings\":{\"compilationTarget\":{\"src/proxy/KlerosProxies.sol\":\"DisputeKitClassicUniversityProxy\"},\"evmVersion\":\"paris\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\",\"useLiteralContent\":true},\"optimizer\":{\"enabled\":true,\"runs\":100},\"remappings\":[]},\"sources\":{\"src/proxy/KlerosProxies.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n\\npragma solidity 0.8.24;\\n\\nimport \\\"./UUPSProxy.sol\\\";\\n\\n/// Workaround to get meaningful names for the proxy contracts\\n/// Otherwise all the contracts are called `UUPSProxy` on the chain explorers\\n\\ncontract DisputeKitClassicNeoProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitClassicUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitClassicProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeTemplateRegistryProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract EvidenceModuleProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract ForeignGatewayOnEthereumProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract HomeGatewayToEthereumProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreNeoProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreRulerProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract PolicyRegistryProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract RandomizerRNGProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleNeoProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\",\"keccak256\":\"0x4393c05bbfda204b9992e1e546142a0fbf4c92a1c4061f5985463d02a71b84d4\",\"license\":\"MIT\"},\"src/proxy/UUPSProxy.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n// Adapted from <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/ERC1967/ERC1967Proxy.sol>\\n\\n/**\\n *  @authors: [@malatrax]\\n *  @reviewers: []\\n *  @auditors: []\\n *  @bounties: []\\n *  @deployments: []\\n */\\npragma solidity 0.8.24;\\n\\n/**\\n * @title UUPS Proxy\\n * @author Simon Malatrait <simon.malatrait@grenoble-inp.org>\\n * @dev This contract implements a UUPS Proxy compliant with ERC-1967 & ERC-1822.\\n * @dev This contract delegates all calls to another contract (UUPS Proxiable) through a fallback function and the use of the `delegatecall` EVM instruction.\\n * @dev We refer to the Proxiable contract (as per ERC-1822) with `implementation`.\\n */\\ncontract UUPSProxy {\\n    /**\\n     * @dev Storage slot with the address of the current implementation.\\n     * This is the keccak-256 hash of \\\"eip1967.proxy.implementation\\\" subtracted by 1, and is\\n     * validated in the constructor.\\n     * NOTE: bytes32(uint256(keccak256('eip1967.proxy.implementation')) - 1)\\n     */\\n    bytes32 private constant IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;\\n\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Initializes the upgradeable proxy with an initial implementation specified by `_implementation`.\\n     *\\n     * If `_data` is nonempty, it's used as data in a delegate call to `_implementation`. This will typically be an encoded\\n     * function call, and allows initializing the storage of the proxy like a Solidity constructor.\\n     */\\n    constructor(address _implementation, bytes memory _data) {\\n        assembly {\\n            sstore(IMPLEMENTATION_SLOT, _implementation)\\n        }\\n\\n        if (_data.length != 0) {\\n            (bool success, ) = _implementation.delegatecall(_data);\\n            require(success, \\\"Proxy Constructor failed\\\");\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Delegates the current call to `implementation`.\\n     *\\n     * NOTE: This function does not return to its internal call site, it will return directly to the external caller.\\n     */\\n    function _delegate(address implementation) internal {\\n        assembly {\\n            // Copy msg.data. We take full control of memory in this inline assembly\\n            // block because it will not return to Solidity code. We overwrite the\\n            // Solidity scratch pad at memory position 0.\\n            calldatacopy(0, 0, calldatasize())\\n\\n            // Call the implementation.\\n            // out and outsize are 0 because we don't know the size yet.\\n            let result := delegatecall(gas(), implementation, 0, calldatasize(), 0, 0)\\n\\n            // Copy the returned data.\\n            returndatacopy(0, 0, returndatasize())\\n\\n            switch result\\n            // delegatecall returns 0 on error.\\n            case 0 {\\n                revert(0, returndatasize())\\n            }\\n            default {\\n                return(0, returndatasize())\\n            }\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Internal Views            * //\\n    // ************************************* //\\n\\n    function _getImplementation() internal view returns (address implementation) {\\n        assembly {\\n            implementation := sload(IMPLEMENTATION_SLOT)\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Fallback                * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Fallback function that delegates calls to the address returned by `_implementation()`. Will run if no other\\n     * function in the contract matches the call data.\\n     */\\n    fallback() external payable {\\n        _delegate(_getImplementation());\\n    }\\n\\n    receive() external payable {\\n        _delegate(_getImplementation());\\n    }\\n}\\n\",\"keccak256\":\"0x7aa5f14ce351299722ac1a1afca9e65e1c795f32ea3e9702b0d5faaf7ca822a0\",\"license\":\"MIT\"}},\"version\":1}",
-  "bytecode": "0x608060405234801561001057600080fd5b5060405161030238038061030283398101604081905261002f91610151565b8181817f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc55805160001461010e576000826001600160a01b031682604051610077919061021f565b600060405180830381855af49150503d80600081146100b2576040519150601f19603f3d011682016040523d82523d6000602084013e6100b7565b606091505b505090508061010c5760405162461bcd60e51b815260206004820152601860248201527f50726f787920436f6e7374727563746f72206661696c65640000000000000000604482015260640160405180910390fd5b505b5050505061023b565b634e487b7160e01b600052604160045260246000fd5b60005b83811015610148578181015183820152602001610130565b50506000910152565b6000806040838503121561016457600080fd5b82516001600160a01b038116811461017b57600080fd5b60208401519092506001600160401b038082111561019857600080fd5b818501915085601f8301126101ac57600080fd5b8151818111156101be576101be610117565b604051601f8201601f19908116603f011681019083821181831017156101e6576101e6610117565b816040528281528860208487010111156101ff57600080fd5b61021083602083016020880161012d565b80955050505050509250929050565b6000825161023181846020870161012d565b9190910192915050565b60b9806102496000396000f3fe608060405236603757603560317f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5490565b6060565b005b603560317f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5490565b3660008037600080366000845af43d6000803e808015607e573d6000f35b3d6000fdfea2646970667358221220a67e53546ab2c83f023c185d90506ad48d4e7af6339cf6db0c4ed97ec9ed376f64736f6c63430008180033",
-  "deployedBytecode": "0x608060405236603757603560317f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5490565b6060565b005b603560317f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5490565b3660008037600080366000845af43d6000803e808015607e573d6000f35b3d6000fdfea2646970667358221220a67e53546ab2c83f023c185d90506ad48d4e7af6339cf6db0c4ed97ec9ed376f64736f6c63430008180033",
+  "solcInputHash": "d547d738900bce1310e91a5d1adfc179",
+  "metadata": "{\"compiler\":{\"version\":\"0.8.30+commit.73712a01\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_implementation\",\"type\":\"address\"},{\"internalType\":\"bytes\",\"name\":\"_data\",\"type\":\"bytes\"}],\"stateMutability\":\"nonpayable\",\"type\":\"constructor\"},{\"stateMutability\":\"payable\",\"type\":\"fallback\"},{\"stateMutability\":\"payable\",\"type\":\"receive\"}],\"devdoc\":{\"kind\":\"dev\",\"methods\":{},\"version\":1},\"userdoc\":{\"kind\":\"user\",\"methods\":{},\"notice\":\"Workaround to get meaningful names for the proxy contracts Otherwise all the contracts are called `UUPSProxy` on the chain explorers\",\"version\":1}},\"settings\":{\"compilationTarget\":{\"src/proxy/KlerosProxies.sol\":\"DisputeKitClassicUniversityProxy\"},\"evmVersion\":\"cancun\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\",\"useLiteralContent\":true},\"optimizer\":{\"enabled\":true,\"runs\":1000},\"remappings\":[],\"viaIR\":true},\"sources\":{\"src/proxy/KlerosProxies.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\nimport \\\"./UUPSProxy.sol\\\";\\n\\n/// Workaround to get meaningful names for the proxy contracts\\n/// Otherwise all the contracts are called `UUPSProxy` on the chain explorers\\n\\ncontract DisputeKitClassicUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitClassicProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitGatedProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitGatedShutterProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitShutterProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitSybilResistantProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeTemplateRegistryProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract EvidenceModuleProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract ForeignGatewayOnEthereumProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract HomeGatewayToEthereumProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreRulerProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract PolicyRegistryProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract RandomizerRNGProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\",\"keccak256\":\"0x3160bd320b23c6ec0c21862b455c3044a9b33654ae84a1b6cd76255626c9154b\",\"license\":\"MIT\"},\"src/proxy/UUPSProxy.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\n/// @title UUPS Proxy\\n/// @author Simon Malatrait <simon.malatrait@grenoble-inp.org>\\n/// @notice This contract implements a UUPS Proxy compliant with ERC-1967 & ERC-1822.\\n///\\n/// @dev This contract delegates all calls to another contract (UUPS Proxiable) through a fallback function and the use of the `delegatecall` EVM instruction.\\n/// We refer to the Proxiable contract (as per ERC-1822) with `implementation`.\\n/// Adapted from <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/ERC1967/ERC1967Proxy.sol>\\ncontract UUPSProxy {\\n    /// @dev Storage slot with the address of the current implementation.\\n    /// This is the keccak-256 hash of \\\"eip1967.proxy.implementation\\\" subtracted by 1, and is\\n    /// validated in the constructor.\\n    /// NOTE: bytes32(uint256(keccak256('eip1967.proxy.implementation')) - 1)\\n    bytes32 private constant IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;\\n\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    /// @notice Initializes the upgradeable proxy with an initial implementation specified by `_implementation`.\\n    /// @dev If `_data` is nonempty, it's used as data in a delegate call to `_implementation`.\\n    /// This will typically be an encoded function call, and allows initializing the storage of the proxy like a Solidity constructor.\\n    constructor(address _implementation, bytes memory _data) {\\n        assembly {\\n            sstore(IMPLEMENTATION_SLOT, _implementation)\\n        }\\n\\n        if (_data.length != 0) {\\n            (bool success, ) = _implementation.delegatecall(_data);\\n            require(success, \\\"Proxy Constructor failed\\\");\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @dev Delegates the current call to `implementation`.\\n    /// NOTE: This function does not return to its internal call site, it will return directly to the external caller.\\n    function _delegate(address implementation) internal {\\n        assembly {\\n            // Copy msg.data. We take full control of memory in this inline assembly\\n            // block because it will not return to Solidity code. We overwrite the\\n            // Solidity scratch pad at memory position 0.\\n            calldatacopy(0, 0, calldatasize())\\n\\n            // Call the implementation.\\n            // out and outsize are 0 because we don't know the size yet.\\n            let result := delegatecall(gas(), implementation, 0, calldatasize(), 0, 0)\\n\\n            // Copy the returned data.\\n            returndatacopy(0, 0, returndatasize())\\n\\n            switch result\\n            // delegatecall returns 0 on error.\\n            case 0 {\\n                revert(0, returndatasize())\\n            }\\n            default {\\n                return(0, returndatasize())\\n            }\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Internal Views            * //\\n    // ************************************* //\\n\\n    function _getImplementation() internal view returns (address implementation) {\\n        assembly {\\n            implementation := sload(IMPLEMENTATION_SLOT)\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Fallback                * //\\n    // ************************************* //\\n\\n    /// @dev Fallback function that delegates calls to the address returned by `_implementation()`.\\n    /// @dev Will run if no other function in the contract matches the call data.\\n    fallback() external payable {\\n        _delegate(_getImplementation());\\n    }\\n\\n    receive() external payable {\\n        _delegate(_getImplementation());\\n    }\\n}\\n\",\"keccak256\":\"0x2d7b1f81e525787f1b8b033ce381a81cb5f39e411ff31490e019113205a661cd\",\"license\":\"MIT\"}},\"version\":1}",
+  "bytecode": "0x608060405234610144576102148038038061001981610148565b928339810190604081830312610144578051906001600160a01b0382168203610144576020810151906001600160401b038211610144570182601f8201121561014457805161006f61006a82610181565b610148565b9181835260208301946020838301011161014457815f926020809301875e83010152817f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5551806100c9575b6040516077908161019d8239f35b5f9283925af43d1561013f573d6100e261006a82610181565b9081525f60203d92013e5b156100fa575f80806100bb565b60405162461bcd60e51b815260206004820152601860248201527f50726f787920436f6e7374727563746f72206661696c656400000000000000006044820152606490fd5b6100ed565b5f80fd5b6040519190601f01601f191682016001600160401b0381118382101761016d57604052565b634e487b7160e01b5f52604160045260245ffd5b6001600160401b03811161016d57601f01601f19166020019056fe60806040525f807f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc54368280378136915af43d5f803e15603d573d5ff35b3d5ffdfea264697066735822122078e638e186ffb95282090eae06b37667016702ebe14876894d9cb231ea135b1264736f6c634300081e0033",
+  "deployedBytecode": "0x60806040525f807f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc54368280378136915af43d5f803e15603d573d5ff35b3d5ffdfea264697066735822122078e638e186ffb95282090eae06b37667016702ebe14876894d9cb231ea135b1264736f6c634300081e0033",
   "execute": {
     "methodName": "initialize",
     "args": [
       "0xf1C7c037891525E360C59f708739Ac09A7670c59",
-      "0x0000000000000000000000000000000000000000"
+      "0x0000000000000000000000000000000000000000",
+      "0x3829A2486d53ee984a0ca2D76552715726b77138",
+      1
     ]
   },
-  "implementation": "0x87e863b94d2CB79A8aB53bD87Dc4A10E11C0918B",
+  "implementation": "0x602ADa1cE706404BFb5417e497cdDae934436081",
   "devdoc": {
     "kind": "dev",
     "methods": {},
@@ -1000,6 +1374,7 @@
   "userdoc": {
     "kind": "user",
     "methods": {},
+    "notice": "Workaround to get meaningful names for the proxy contracts Otherwise all the contracts are called `UUPSProxy` on the chain explorers",
     "version": 1
   },
   "storageLayout": {
diff --git a/contracts/deployments/arbitrumSepoliaDevnet/DisputeKitClassicUniversity_Implementation.json b/contracts/deployments/arbitrumSepoliaDevnet/DisputeKitClassicUniversity_Implementation.json
index 3ac36edd4..dd3e3b270 100644
--- a/contracts/deployments/arbitrumSepoliaDevnet/DisputeKitClassicUniversity_Implementation.json
+++ b/contracts/deployments/arbitrumSepoliaDevnet/DisputeKitClassicUniversity_Implementation.json
@@ -1,5 +1,5 @@
 {
-  "address": "0x87e863b94d2CB79A8aB53bD87Dc4A10E11C0918B",
+  "address": "0x602ADa1cE706404BFb5417e497cdDae934436081",
   "abi": [
     {
       "inputs": [],
@@ -11,11 +11,61 @@
       "name": "AlreadyInitialized",
       "type": "error"
     },
+    {
+      "inputs": [],
+      "name": "AppealFeeIsAlreadyPaid",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "AppealPeriodIsOver",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "AppealPeriodIsOverForLoser",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "ChoiceOutOfBounds",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "CoreIsPaused",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "DisputeJumpedToParentDK",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "DisputeNotResolved",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "EmptyCommit",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "EmptyVoteIDs",
+      "type": "error"
+    },
     {
       "inputs": [],
       "name": "FailedDelegateCall",
       "type": "error"
     },
+    {
+      "inputs": [],
+      "name": "HashDoesNotMatchHiddenVoteCommitment",
+      "type": "error"
+    },
     {
       "inputs": [
         {
@@ -27,11 +77,41 @@
       "name": "InvalidImplementation",
       "type": "error"
     },
+    {
+      "inputs": [],
+      "name": "JurorHasToOwnTheVote",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "KlerosCoreOnly",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "NotActiveForCoreDisputeID",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "NotCommitPeriod",
+      "type": "error"
+    },
     {
       "inputs": [],
       "name": "NotInitializing",
       "type": "error"
     },
+    {
+      "inputs": [],
+      "name": "NotVotePeriod",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "OwnerOnly",
+      "type": "error"
+    },
     {
       "inputs": [],
       "name": "UUPSUnauthorizedCallContext",
@@ -48,6 +128,16 @@
       "name": "UUPSUnsupportedProxiableUUID",
       "type": "error"
     },
+    {
+      "inputs": [],
+      "name": "UnsuccessfulCall",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "VoteAlreadyCast",
+      "type": "error"
+    },
     {
       "anonymous": false,
       "inputs": [
@@ -292,19 +382,6 @@
       "stateMutability": "view",
       "type": "function"
     },
-    {
-      "inputs": [],
-      "name": "ONE_BASIS_POINT",
-      "outputs": [
-        {
-          "internalType": "uint256",
-          "name": "",
-          "type": "uint256"
-        }
-      ],
-      "stateMutability": "view",
-      "type": "function"
-    },
     {
       "inputs": [],
       "name": "WINNER_STAKE_MULTIPLIER",
@@ -425,15 +502,28 @@
       "stateMutability": "nonpayable",
       "type": "function"
     },
+    {
+      "inputs": [
+        {
+          "internalType": "uint256",
+          "name": "_jumpDisputeKitID",
+          "type": "uint256"
+        }
+      ],
+      "name": "changeJumpDisputeKitID",
+      "outputs": [],
+      "stateMutability": "nonpayable",
+      "type": "function"
+    },
     {
       "inputs": [
         {
           "internalType": "address payable",
-          "name": "_governor",
+          "name": "_owner",
           "type": "address"
         }
       ],
-      "name": "changeGovernor",
+      "name": "changeOwner",
       "outputs": [],
       "stateMutability": "nonpayable",
       "type": "function"
@@ -451,6 +541,25 @@
       "stateMutability": "view",
       "type": "function"
     },
+    {
+      "inputs": [
+        {
+          "internalType": "uint256",
+          "name": "coreDisputeID",
+          "type": "uint256"
+        }
+      ],
+      "name": "coreDisputeIDToActive",
+      "outputs": [
+        {
+          "internalType": "bool",
+          "name": "",
+          "type": "bool"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
     {
       "inputs": [
         {
@@ -489,7 +598,7 @@
         },
         {
           "internalType": "uint256",
-          "name": "_nbVotes",
+          "name": "",
           "type": "uint256"
         }
       ],
@@ -575,11 +684,35 @@
           "internalType": "address",
           "name": "drawnAddress",
           "type": "address"
+        },
+        {
+          "internalType": "uint96",
+          "name": "fromSubcourtID",
+          "type": "uint96"
         }
       ],
       "stateMutability": "nonpayable",
       "type": "function"
     },
+    {
+      "inputs": [
+        {
+          "internalType": "uint256",
+          "name": "",
+          "type": "uint256"
+        }
+      ],
+      "name": "earlyCourtJump",
+      "outputs": [
+        {
+          "internalType": "bool",
+          "name": "",
+          "type": "bool"
+        }
+      ],
+      "stateMutability": "pure",
+      "type": "function"
+    },
     {
       "inputs": [
         {
@@ -598,7 +731,7 @@
           "type": "bytes"
         }
       ],
-      "name": "executeGovernorProposal",
+      "name": "executeOwnerProposal",
       "outputs": [],
       "stateMutability": "nonpayable",
       "type": "function"
@@ -673,14 +806,58 @@
           "type": "uint256"
         }
       ],
-      "name": "getDegreeOfCoherence",
+      "name": "getDegreeOfCoherencePenalty",
       "outputs": [
+        {
+          "internalType": "uint256",
+          "name": "pnkCoherence",
+          "type": "uint256"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "uint256",
+          "name": "_coreDisputeID",
+          "type": "uint256"
+        },
+        {
+          "internalType": "uint256",
+          "name": "_coreRoundID",
+          "type": "uint256"
+        },
+        {
+          "internalType": "uint256",
+          "name": "_voteID",
+          "type": "uint256"
+        },
+        {
+          "internalType": "uint256",
+          "name": "",
+          "type": "uint256"
+        },
         {
           "internalType": "uint256",
           "name": "",
           "type": "uint256"
         }
       ],
+      "name": "getDegreeOfCoherenceReward",
+      "outputs": [
+        {
+          "internalType": "uint256",
+          "name": "pnkCoherence",
+          "type": "uint256"
+        },
+        {
+          "internalType": "uint256",
+          "name": "feeCoherence",
+          "type": "uint256"
+        }
+      ],
       "stateMutability": "view",
       "type": "function"
     },
@@ -703,6 +880,91 @@
       "stateMutability": "view",
       "type": "function"
     },
+    {
+      "inputs": [],
+      "name": "getJumpDisputeKitID",
+      "outputs": [
+        {
+          "internalType": "uint256",
+          "name": "",
+          "type": "uint256"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "uint256",
+          "name": "_coreDisputeID",
+          "type": "uint256"
+        },
+        {
+          "internalType": "uint256",
+          "name": "_coreRoundID",
+          "type": "uint256"
+        }
+      ],
+      "name": "getLocalDisputeRoundID",
+      "outputs": [
+        {
+          "internalType": "uint256",
+          "name": "localDisputeID",
+          "type": "uint256"
+        },
+        {
+          "internalType": "uint256",
+          "name": "localRoundID",
+          "type": "uint256"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "contract IDisputeKit",
+          "name": "",
+          "type": "address"
+        },
+        {
+          "internalType": "uint256",
+          "name": "_currentNbVotes",
+          "type": "uint256"
+        }
+      ],
+      "name": "getNbVotesAfterAppeal",
+      "outputs": [
+        {
+          "internalType": "uint256",
+          "name": "",
+          "type": "uint256"
+        }
+      ],
+      "stateMutability": "pure",
+      "type": "function"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "uint256",
+          "name": "_localDisputeID",
+          "type": "uint256"
+        }
+      ],
+      "name": "getNumberOfRounds",
+      "outputs": [
+        {
+          "internalType": "uint256",
+          "name": "",
+          "type": "uint256"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
     {
       "inputs": [
         {
@@ -740,7 +1002,7 @@
         },
         {
           "internalType": "uint256",
-          "name": "totalCommited",
+          "name": "totalCommitted",
           "type": "uint256"
         },
         {
@@ -802,29 +1064,55 @@
       "type": "function"
     },
     {
-      "inputs": [],
-      "name": "governor",
-      "outputs": [
+      "inputs": [
         {
-          "internalType": "address",
-          "name": "",
-          "type": "address"
-        }
-      ],
-      "stateMutability": "view",
+          "internalType": "uint256",
+          "name": "_choice",
+          "type": "uint256"
+        },
+        {
+          "internalType": "uint256",
+          "name": "_salt",
+          "type": "uint256"
+        },
+        {
+          "internalType": "string",
+          "name": "",
+          "type": "string"
+        }
+      ],
+      "name": "hashVote",
+      "outputs": [
+        {
+          "internalType": "bytes32",
+          "name": "",
+          "type": "bytes32"
+        }
+      ],
+      "stateMutability": "view",
       "type": "function"
     },
     {
       "inputs": [
         {
           "internalType": "address",
-          "name": "_governor",
+          "name": "_owner",
           "type": "address"
         },
         {
           "internalType": "contract KlerosCore",
           "name": "_core",
           "type": "address"
+        },
+        {
+          "internalType": "address",
+          "name": "_wNative",
+          "type": "address"
+        },
+        {
+          "internalType": "uint256",
+          "name": "_jumpDisputeKitID",
+          "type": "uint256"
         }
       ],
       "name": "initialize",
@@ -832,6 +1120,25 @@
       "stateMutability": "nonpayable",
       "type": "function"
     },
+    {
+      "inputs": [
+        {
+          "internalType": "uint256",
+          "name": "_coreDisputeID",
+          "type": "uint256"
+        }
+      ],
+      "name": "isAppealFunded",
+      "outputs": [
+        {
+          "internalType": "bool",
+          "name": "",
+          "type": "bool"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
     {
       "inputs": [
         {
@@ -861,6 +1168,32 @@
       "stateMutability": "view",
       "type": "function"
     },
+    {
+      "inputs": [],
+      "name": "jumpDisputeKitID",
+      "outputs": [
+        {
+          "internalType": "uint256",
+          "name": "",
+          "type": "uint256"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
+    {
+      "inputs": [],
+      "name": "owner",
+      "outputs": [
+        {
+          "internalType": "address",
+          "name": "",
+          "type": "address"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
     {
       "inputs": [],
       "name": "proxiableUUID",
@@ -874,6 +1207,19 @@
       "stateMutability": "view",
       "type": "function"
     },
+    {
+      "inputs": [],
+      "name": "singleDrawPerJuror",
+      "outputs": [
+        {
+          "internalType": "bool",
+          "name": "",
+          "type": "bool"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
     {
       "inputs": [
         {
@@ -892,6 +1238,32 @@
       "stateMutability": "payable",
       "type": "function"
     },
+    {
+      "inputs": [],
+      "name": "version",
+      "outputs": [
+        {
+          "internalType": "string",
+          "name": "",
+          "type": "string"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
+    {
+      "inputs": [],
+      "name": "wNative",
+      "outputs": [
+        {
+          "internalType": "address",
+          "name": "",
+          "type": "address"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
     {
       "inputs": [
         {
@@ -927,41 +1299,41 @@
       "type": "function"
     }
   ],
-  "transactionHash": "0x89ac5a2ce88c22071edfaf2f092cb26862b52facde1274b9a495dccdd03a41d9",
+  "transactionHash": "0x140fcdeaa468903f80081c238adf55c9e98ed99dfccc7d9c3e5f1b0fe90cf644",
   "receipt": {
     "to": null,
     "from": "0xf1C7c037891525E360C59f708739Ac09A7670c59",
-    "contractAddress": "0x87e863b94d2CB79A8aB53bD87Dc4A10E11C0918B",
+    "contractAddress": "0x602ADa1cE706404BFb5417e497cdDae934436081",
     "transactionIndex": 2,
-    "gasUsed": "3665145",
-    "logsBloom": "0x00000800000000000000000000000000000000000000000000000000040000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000800000000000000000400000080000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
-    "blockHash": "0x9c2007f9245166eb377461ad5c2dd50dfa7e21fc79284f7d7591fb8348960fe3",
-    "transactionHash": "0x89ac5a2ce88c22071edfaf2f092cb26862b52facde1274b9a495dccdd03a41d9",
+    "gasUsed": "2891480",
+    "logsBloom": "0x00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000040000000000000000000000000800000000000000000000000080000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000004000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+    "blockHash": "0xa1d507b667521779bef446125f900ce13bca11861cf05645709556422aad0f04",
+    "transactionHash": "0x140fcdeaa468903f80081c238adf55c9e98ed99dfccc7d9c3e5f1b0fe90cf644",
     "logs": [
       {
         "transactionIndex": 2,
-        "blockNumber": 96308519,
-        "transactionHash": "0x89ac5a2ce88c22071edfaf2f092cb26862b52facde1274b9a495dccdd03a41d9",
-        "address": "0x87e863b94d2CB79A8aB53bD87Dc4A10E11C0918B",
+        "blockNumber": 193533768,
+        "transactionHash": "0x140fcdeaa468903f80081c238adf55c9e98ed99dfccc7d9c3e5f1b0fe90cf644",
+        "address": "0x602ADa1cE706404BFb5417e497cdDae934436081",
         "topics": [
           "0xc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d2"
         ],
         "data": "0x000000000000000000000000000000000000000000000000ffffffffffffffff",
-        "logIndex": 6,
-        "blockHash": "0x9c2007f9245166eb377461ad5c2dd50dfa7e21fc79284f7d7591fb8348960fe3"
+        "logIndex": 1,
+        "blockHash": "0xa1d507b667521779bef446125f900ce13bca11861cf05645709556422aad0f04"
       }
     ],
-    "blockNumber": 96308519,
-    "cumulativeGasUsed": "3756092",
+    "blockNumber": 193533768,
+    "cumulativeGasUsed": "3568712",
     "status": 1,
     "byzantium": true
   },
   "args": [],
   "numDeployments": 1,
-  "solcInputHash": "a5602534c00c2f67ca4b6a1cab8c717e",
-  "metadata": "{\"compiler\":{\"version\":\"0.8.24+commit.e11b9ed9\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"inputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"constructor\"},{\"inputs\":[],\"name\":\"AlreadyInitialized\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"FailedDelegateCall\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"implementation\",\"type\":\"address\"}],\"name\":\"InvalidImplementation\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"NotInitializing\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"UUPSUnauthorizedCallContext\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"slot\",\"type\":\"bytes32\"}],\"name\":\"UUPSUnsupportedProxiableUUID\",\"type\":\"error\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_coreRoundID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_choice\",\"type\":\"uint256\"}],\"name\":\"ChoiceFunded\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"address\",\"name\":\"_juror\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"uint256[]\",\"name\":\"_voteIDs\",\"type\":\"uint256[]\"},{\"indexed\":false,\"internalType\":\"bytes32\",\"name\":\"_commit\",\"type\":\"bytes32\"}],\"name\":\"CommitCast\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_coreRoundID\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_choice\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"address\",\"name\":\"_contributor\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_amount\",\"type\":\"uint256\"}],\"name\":\"Contribution\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_numberOfChoices\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"bytes\",\"name\":\"_extraData\",\"type\":\"bytes\"}],\"name\":\"DisputeCreation\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":false,\"internalType\":\"uint64\",\"name\":\"version\",\"type\":\"uint64\"}],\"name\":\"Initialized\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"newImplementation\",\"type\":\"address\"}],\"name\":\"Upgraded\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"address\",\"name\":\"_juror\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"uint256[]\",\"name\":\"_voteIDs\",\"type\":\"uint256[]\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_choice\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"string\",\"name\":\"_justification\",\"type\":\"string\"}],\"name\":\"VoteCast\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_coreRoundID\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_choice\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"address\",\"name\":\"_contributor\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_amount\",\"type\":\"uint256\"}],\"name\":\"Withdrawal\",\"type\":\"event\"},{\"inputs\":[],\"name\":\"LOSER_APPEAL_PERIOD_MULTIPLIER\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"LOSER_STAKE_MULTIPLIER\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"ONE_BASIS_POINT\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"WINNER_STAKE_MULTIPLIER\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"}],\"name\":\"areCommitsAllCast\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"}],\"name\":\"areVotesAllCast\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256[]\",\"name\":\"_voteIDs\",\"type\":\"uint256[]\"},{\"internalType\":\"bytes32\",\"name\":\"_commit\",\"type\":\"bytes32\"}],\"name\":\"castCommit\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256[]\",\"name\":\"_voteIDs\",\"type\":\"uint256[]\"},{\"internalType\":\"uint256\",\"name\":\"_choice\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_salt\",\"type\":\"uint256\"},{\"internalType\":\"string\",\"name\":\"_justification\",\"type\":\"string\"}],\"name\":\"castVote\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_core\",\"type\":\"address\"}],\"name\":\"changeCore\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address payable\",\"name\":\"_governor\",\"type\":\"address\"}],\"name\":\"changeGovernor\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"core\",\"outputs\":[{\"internalType\":\"contract KlerosCore\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"name\":\"coreDisputeIDToLocal\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_numberOfChoices\",\"type\":\"uint256\"},{\"internalType\":\"bytes\",\"name\":\"_extraData\",\"type\":\"bytes\"},{\"internalType\":\"uint256\",\"name\":\"_nbVotes\",\"type\":\"uint256\"}],\"name\":\"createDispute\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"}],\"name\":\"currentRuling\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"ruling\",\"type\":\"uint256\"},{\"internalType\":\"bool\",\"name\":\"tied\",\"type\":\"bool\"},{\"internalType\":\"bool\",\"name\":\"overridden\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"name\":\"disputes\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"numberOfChoices\",\"type\":\"uint256\"},{\"internalType\":\"bool\",\"name\":\"jumped\",\"type\":\"bool\"},{\"internalType\":\"bytes\",\"name\":\"extraData\",\"type\":\"bytes\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_nonce\",\"type\":\"uint256\"}],\"name\":\"draw\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"drawnAddress\",\"type\":\"address\"}],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_destination\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"_amount\",\"type\":\"uint256\"},{\"internalType\":\"bytes\",\"name\":\"_data\",\"type\":\"bytes\"}],\"name\":\"executeGovernorProposal\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_choice\",\"type\":\"uint256\"}],\"name\":\"fundAppeal\",\"outputs\":[],\"stateMutability\":\"payable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_coreRoundID\",\"type\":\"uint256\"}],\"name\":\"getCoherentCount\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_coreRoundID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_voteID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"name\":\"getDegreeOfCoherence\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"}],\"name\":\"getFundedChoices\",\"outputs\":[{\"internalType\":\"uint256[]\",\"name\":\"fundedChoices\",\"type\":\"uint256[]\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_coreRoundID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_choice\",\"type\":\"uint256\"}],\"name\":\"getRoundInfo\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"winningChoice\",\"type\":\"uint256\"},{\"internalType\":\"bool\",\"name\":\"tied\",\"type\":\"bool\"},{\"internalType\":\"uint256\",\"name\":\"totalVoted\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"totalCommited\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"nbVoters\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"choiceCount\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_coreRoundID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_voteID\",\"type\":\"uint256\"}],\"name\":\"getVoteInfo\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"account\",\"type\":\"address\"},{\"internalType\":\"bytes32\",\"name\":\"commit\",\"type\":\"bytes32\"},{\"internalType\":\"uint256\",\"name\":\"choice\",\"type\":\"uint256\"},{\"internalType\":\"bool\",\"name\":\"voted\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"governor\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_governor\",\"type\":\"address\"},{\"internalType\":\"contract KlerosCore\",\"name\":\"_core\",\"type\":\"address\"}],\"name\":\"initialize\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_coreRoundID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_voteID\",\"type\":\"uint256\"}],\"name\":\"isVoteActive\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"proxiableUUID\",\"outputs\":[{\"internalType\":\"bytes32\",\"name\":\"\",\"type\":\"bytes32\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"newImplementation\",\"type\":\"address\"},{\"internalType\":\"bytes\",\"name\":\"data\",\"type\":\"bytes\"}],\"name\":\"upgradeToAndCall\",\"outputs\":[],\"stateMutability\":\"payable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"internalType\":\"address payable\",\"name\":\"_beneficiary\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"_coreRoundID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_choice\",\"type\":\"uint256\"}],\"name\":\"withdrawFeesAndRewards\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"amount\",\"type\":\"uint256\"}],\"stateMutability\":\"nonpayable\",\"type\":\"function\"}],\"devdoc\":{\"errors\":{\"AlreadyInitialized()\":[{\"details\":\"The contract is already initialized.\"}],\"NotInitializing()\":[{\"details\":\"The contract is not initializing.\"}],\"UUPSUnauthorizedCallContext()\":[{\"details\":\"The call is from an unauthorized context.\"}],\"UUPSUnsupportedProxiableUUID(bytes32)\":[{\"details\":\"The storage `slot` is unsupported as a UUID.\"}]},\"events\":{\"ChoiceFunded(uint256,uint256,uint256)\":{\"details\":\"To be emitted when a choice is fully funded for an appeal.\",\"params\":{\"_choice\":\"The choice that is being funded.\",\"_coreDisputeID\":\"The identifier of the dispute in the Arbitrator contract.\",\"_coreRoundID\":\"The identifier of the round in the Arbitrator contract.\"}},\"CommitCast(uint256,address,uint256[],bytes32)\":{\"details\":\"To be emitted when a vote commitment is cast.\",\"params\":{\"_commit\":\"The commitment of the juror.\",\"_coreDisputeID\":\"The identifier of the dispute in the Arbitrator contract.\",\"_juror\":\"The address of the juror casting the vote commitment.\",\"_voteIDs\":\"The identifiers of the votes in the dispute.\"}},\"Contribution(uint256,uint256,uint256,address,uint256)\":{\"details\":\"To be emitted when a funding contribution is made.\",\"params\":{\"_amount\":\"The amount contributed.\",\"_choice\":\"The choice that is being funded.\",\"_contributor\":\"The address of the contributor.\",\"_coreDisputeID\":\"The identifier of the dispute in the Arbitrator contract.\",\"_coreRoundID\":\"The identifier of the round in the Arbitrator contract.\"}},\"DisputeCreation(uint256,uint256,bytes)\":{\"details\":\"To be emitted when a dispute is created.\",\"params\":{\"_coreDisputeID\":\"The identifier of the dispute in the Arbitrator contract.\",\"_extraData\":\"The extra data for the dispute.\",\"_numberOfChoices\":\"The number of choices available in the dispute.\"}},\"Initialized(uint64)\":{\"details\":\"Triggered when the contract has been initialized or reinitialized.\"},\"Upgraded(address)\":{\"params\":{\"newImplementation\":\"Address of the new implementation the proxy is now forwarding calls to.\"}},\"VoteCast(uint256,address,uint256[],uint256,string)\":{\"details\":\"Emitted when casting a vote to provide the justification of juror's choice.\",\"params\":{\"_choice\":\"The choice juror voted for.\",\"_coreDisputeID\":\"The identifier of the dispute in the Arbitrator contract.\",\"_juror\":\"Address of the juror.\",\"_justification\":\"Justification of the choice.\",\"_voteIDs\":\"The identifiers of the votes in the dispute.\"}},\"Withdrawal(uint256,uint256,uint256,address,uint256)\":{\"details\":\"To be emitted when the contributed funds are withdrawn.\",\"params\":{\"_amount\":\"The amount withdrawn.\",\"_choice\":\"The choice that is being funded.\",\"_contributor\":\"The address of the contributor.\",\"_coreDisputeID\":\"The identifier of the dispute in the Arbitrator contract.\",\"_coreRoundID\":\"The identifier of the round in the Arbitrator contract.\"}}},\"kind\":\"dev\",\"methods\":{\"areCommitsAllCast(uint256)\":{\"details\":\"Returns true if all of the jurors have cast their commits for the last round.\",\"params\":{\"_coreDisputeID\":\"The ID of the dispute in Kleros Core.\"},\"returns\":{\"_0\":\"Whether all of the jurors have cast their commits for the last round.\"}},\"areVotesAllCast(uint256)\":{\"details\":\"Returns true if all of the jurors have cast their votes for the last round.\",\"params\":{\"_coreDisputeID\":\"The ID of the dispute in Kleros Core.\"},\"returns\":{\"_0\":\"Whether all of the jurors have cast their votes for the last round.\"}},\"castCommit(uint256,uint256[],bytes32)\":{\"details\":\"Sets the caller's commit for the specified votes. It can be called multiple times during the commit period, each call overrides the commits of the previous one. `O(n)` where `n` is the number of votes.\",\"params\":{\"_commit\":\"The commit. Note that justification string is a part of the commit.\",\"_coreDisputeID\":\"The ID of the dispute in Kleros Core.\",\"_voteIDs\":\"The IDs of the votes.\"}},\"castVote(uint256,uint256[],uint256,uint256,string)\":{\"details\":\"Sets the caller's choices for the specified votes. `O(n)` where `n` is the number of votes.\",\"params\":{\"_choice\":\"The choice.\",\"_coreDisputeID\":\"The ID of the dispute in Kleros Core.\",\"_justification\":\"Justification of the choice.\",\"_salt\":\"The salt for the commit if the votes were hidden.\",\"_voteIDs\":\"The IDs of the votes.\"}},\"changeCore(address)\":{\"details\":\"Changes the `core` storage variable.\",\"params\":{\"_core\":\"The new value for the `core` storage variable.\"}},\"changeGovernor(address)\":{\"details\":\"Changes the `governor` storage variable.\",\"params\":{\"_governor\":\"The new value for the `governor` storage variable.\"}},\"constructor\":{\"details\":\"Constructor, initializing the implementation to reduce attack surface.\"},\"createDispute(uint256,uint256,bytes,uint256)\":{\"details\":\"Creates a local dispute and maps it to the dispute ID in the Core contract. Note: Access restricted to Kleros Core only.\",\"params\":{\"_coreDisputeID\":\"The ID of the dispute in Kleros Core.\",\"_extraData\":\"Additional info about the dispute, for possible use in future dispute kits.\",\"_nbVotes\":\"Number of votes for this dispute.\",\"_numberOfChoices\":\"Number of choices of the dispute\"}},\"currentRuling(uint256)\":{\"details\":\"Gets the current ruling of a specified dispute.\",\"params\":{\"_coreDisputeID\":\"The ID of the dispute in Kleros Core.\"},\"returns\":{\"overridden\":\"Whether the ruling was overridden by appeal funding or not.\",\"ruling\":\"The current ruling.\",\"tied\":\"Whether it's a tie or not.\"}},\"draw(uint256,uint256)\":{\"details\":\"Draws the juror from the sortition tree. The drawn address is picked up by Kleros Core. Note: Access restricted to Kleros Core only.\",\"params\":{\"_coreDisputeID\":\"The ID of the dispute in Kleros Core.\",\"_nonce\":\"Nonce of the drawing iteration.\"},\"returns\":{\"drawnAddress\":\"The drawn address.\"}},\"executeGovernorProposal(address,uint256,bytes)\":{\"details\":\"Allows the governor to call anything on behalf of the contract.\",\"params\":{\"_amount\":\"The value sent with the call.\",\"_data\":\"The data sent with the call.\",\"_destination\":\"The destination of the call.\"}},\"fundAppeal(uint256,uint256)\":{\"details\":\"Manages contributions, and appeals a dispute if at least two choices are fully funded. Note that the surplus deposit will be reimbursed.\",\"params\":{\"_choice\":\"A choice that receives funding.\",\"_coreDisputeID\":\"Index of the dispute in Kleros Core.\"}},\"getCoherentCount(uint256,uint256)\":{\"details\":\"Gets the number of jurors who are eligible to a reward in this round.\",\"params\":{\"_coreDisputeID\":\"The ID of the dispute in Kleros Core, not in the Dispute Kit.\",\"_coreRoundID\":\"The ID of the round in Kleros Core, not in the Dispute Kit.\"},\"returns\":{\"_0\":\"The number of coherent jurors.\"}},\"getDegreeOfCoherence(uint256,uint256,uint256,uint256,uint256)\":{\"details\":\"Gets the degree of coherence of a particular voter. This function is called by Kleros Core in order to determine the amount of the reward.\",\"params\":{\"_coreDisputeID\":\"The ID of the dispute in Kleros Core, not in the Dispute Kit.\",\"_coreRoundID\":\"The ID of the round in Kleros Core, not in the Dispute Kit.\",\"_voteID\":\"The ID of the vote.\"},\"returns\":{\"_0\":\"The degree of coherence in basis points.\"}},\"initialize(address,address)\":{\"details\":\"Initializer.\",\"params\":{\"_core\":\"The KlerosCore arbitrator.\",\"_governor\":\"The governor's address.\"}},\"isVoteActive(uint256,uint256,uint256)\":{\"details\":\"Returns true if the specified voter was active in this round.\",\"params\":{\"_coreDisputeID\":\"The ID of the dispute in Kleros Core, not in the Dispute Kit.\",\"_coreRoundID\":\"The ID of the round in Kleros Core, not in the Dispute Kit.\",\"_voteID\":\"The ID of the voter.\"},\"returns\":{\"_0\":\"Whether the voter was active or not.\"}},\"proxiableUUID()\":{\"details\":\"Implementation of the ERC1822 `proxiableUUID` function. This returns the storage slot used by the implementation. It is used to validate the implementation's compatibility when performing an upgrade. IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks bricking a proxy that upgrades to it, by delegating to itself until out of gas. Thus it is critical that this function revert if invoked through a proxy. This is guaranteed by the if statement.\"},\"upgradeToAndCall(address,bytes)\":{\"details\":\"Upgrade mechanism including access control and UUPS-compliance.Reverts if the execution is not performed via delegatecall or the execution context is not of a proxy with an ERC1967-compliant implementation pointing to self.\",\"params\":{\"data\":\"Data used in a delegate call to `newImplementation` if non-empty. This will typically be an encoded function call, and allows initializing the storage of the proxy like a Solidity constructor.\",\"newImplementation\":\"Address of the new implementation contract.\"}},\"withdrawFeesAndRewards(uint256,address,uint256,uint256)\":{\"details\":\"Allows those contributors who attempted to fund an appeal round to withdraw any reimbursable fees or rewards after the dispute gets resolved. Note that withdrawals are not possible if the core contract is paused.\",\"params\":{\"_beneficiary\":\"The address whose rewards to withdraw.\",\"_choice\":\"The ruling option that the caller wants to withdraw from.\",\"_coreDisputeID\":\"Index of the dispute in Kleros Core contract.\",\"_coreRoundID\":\"The round in the Kleros Core contract the caller wants to withdraw from.\"},\"returns\":{\"amount\":\"The withdrawn amount.\"}}},\"title\":\"DisputeKitClassic Dispute kit implementation of the Kleros v1 features including: - a drawing system: proportional to staked PNK, - a vote aggregation system: plurality, - an incentive system: equal split between coherent votes, - an appeal system: fund 2 choices only, vote on any choice.\",\"version\":1},\"userdoc\":{\"errors\":{\"FailedDelegateCall()\":[{\"notice\":\"Failed Delegated call\"}],\"InvalidImplementation(address)\":[{\"notice\":\"The `implementation` is not UUPS-compliant\"}]},\"events\":{\"Upgraded(address)\":{\"notice\":\"Emitted when the `implementation` has been successfully upgraded.\"}},\"kind\":\"user\",\"methods\":{},\"version\":1}},\"settings\":{\"compilationTarget\":{\"src/arbitration/dispute-kits/DisputeKitClassic.sol\":\"DisputeKitClassic\"},\"evmVersion\":\"paris\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\",\"useLiteralContent\":true},\"optimizer\":{\"enabled\":true,\"runs\":100},\"remappings\":[]},\"sources\":{\"@openzeppelin/contracts/token/ERC20/IERC20.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC20/IERC20.sol)\\n\\npragma solidity ^0.8.20;\\n\\n/**\\n * @dev Interface of the ERC-20 standard as defined in the ERC.\\n */\\ninterface IERC20 {\\n    /**\\n     * @dev Emitted when `value` tokens are moved from one account (`from`) to\\n     * another (`to`).\\n     *\\n     * Note that `value` may be zero.\\n     */\\n    event Transfer(address indexed from, address indexed to, uint256 value);\\n\\n    /**\\n     * @dev Emitted when the allowance of a `spender` for an `owner` is set by\\n     * a call to {approve}. `value` is the new allowance.\\n     */\\n    event Approval(address indexed owner, address indexed spender, uint256 value);\\n\\n    /**\\n     * @dev Returns the value of tokens in existence.\\n     */\\n    function totalSupply() external view returns (uint256);\\n\\n    /**\\n     * @dev Returns the value of tokens owned by `account`.\\n     */\\n    function balanceOf(address account) external view returns (uint256);\\n\\n    /**\\n     * @dev Moves a `value` amount of tokens from the caller's account to `to`.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * Emits a {Transfer} event.\\n     */\\n    function transfer(address to, uint256 value) external returns (bool);\\n\\n    /**\\n     * @dev Returns the remaining number of tokens that `spender` will be\\n     * allowed to spend on behalf of `owner` through {transferFrom}. This is\\n     * zero by default.\\n     *\\n     * This value changes when {approve} or {transferFrom} are called.\\n     */\\n    function allowance(address owner, address spender) external view returns (uint256);\\n\\n    /**\\n     * @dev Sets a `value` amount of tokens as the allowance of `spender` over the\\n     * caller's tokens.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * IMPORTANT: Beware that changing an allowance with this method brings the risk\\n     * that someone may use both the old and the new allowance by unfortunate\\n     * transaction ordering. One possible solution to mitigate this race\\n     * condition is to first reduce the spender's allowance to 0 and set the\\n     * desired value afterwards:\\n     * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729\\n     *\\n     * Emits an {Approval} event.\\n     */\\n    function approve(address spender, uint256 value) external returns (bool);\\n\\n    /**\\n     * @dev Moves a `value` amount of tokens from `from` to `to` using the\\n     * allowance mechanism. `value` is then deducted from the caller's\\n     * allowance.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * Emits a {Transfer} event.\\n     */\\n    function transferFrom(address from, address to, uint256 value) external returns (bool);\\n}\\n\",\"keccak256\":\"0xe06a3f08a987af6ad2e1c1e774405d4fe08f1694b67517438b467cecf0da0ef7\",\"license\":\"MIT\"},\"src/arbitration/KlerosCore.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n/// @custom:authors: [@unknownunknown1, @jaybuidl]\\n/// @custom:reviewers: []\\n/// @custom:auditors: []\\n/// @custom:bounties: []\\n/// @custom:deployments: []\\n\\npragma solidity 0.8.24;\\n\\nimport \\\"./KlerosCoreBase.sol\\\";\\nimport {UUPSProxiable} from \\\"../proxy/UUPSProxiable.sol\\\";\\nimport {Initializable} from \\\"../proxy/Initializable.sol\\\";\\n\\n/// @title KlerosCore\\n/// Core arbitrator contract for Kleros v2.\\n/// Note that this contract trusts the PNK token, the dispute kit and the sortition module contracts.\\ncontract KlerosCore is KlerosCoreBase, UUPSProxiable, Initializable {\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    /// @dev Constructor, initializing the implementation to reduce attack surface.\\n    constructor() {\\n        _disableInitializers();\\n    }\\n\\n    /// @dev Initializer (constructor equivalent for upgradable contracts).\\n    /// @param _governor The governor's address.\\n    /// @param _guardian The guardian's address.\\n    /// @param _pinakion The address of the token contract.\\n    /// @param _jurorProsecutionModule The address of the juror prosecution module.\\n    /// @param _disputeKit The address of the default dispute kit.\\n    /// @param _hiddenVotes The `hiddenVotes` property value of the general court.\\n    /// @param _courtParameters Numeric parameters of General court (minStake, alpha, feeForJuror and jurorsForCourtJump respectively).\\n    /// @param _timesPerPeriod The `timesPerPeriod` property value of the general court.\\n    /// @param _sortitionExtraData The extra data for sortition module.\\n    /// @param _sortitionModuleAddress The sortition module responsible for sortition of the jurors.\\n    function initialize(\\n        address _governor,\\n        address _guardian,\\n        IERC20 _pinakion,\\n        address _jurorProsecutionModule,\\n        IDisputeKit _disputeKit,\\n        bool _hiddenVotes,\\n        uint256[4] memory _courtParameters,\\n        uint256[4] memory _timesPerPeriod,\\n        bytes memory _sortitionExtraData,\\n        ISortitionModule _sortitionModuleAddress\\n    ) external reinitializer(1) {\\n        _initialize(\\n            _governor,\\n            _guardian,\\n            _pinakion,\\n            _jurorProsecutionModule,\\n            _disputeKit,\\n            _hiddenVotes,\\n            _courtParameters,\\n            _timesPerPeriod,\\n            _sortitionExtraData,\\n            _sortitionModuleAddress\\n        );\\n    }\\n\\n    // ************************************* //\\n    // *             Governance            * //\\n    // ************************************* //\\n\\n    /// @dev Access Control to perform implementation upgrades (UUPS Proxiable)\\n    ///      Only the governor can perform upgrades (`onlyByGovernor`)\\n    function _authorizeUpgrade(address) internal view override onlyByGovernor {\\n        // NOP\\n    }\\n}\\n\",\"keccak256\":\"0x1dc9311f4df8d5c707be5fc0f0e87574b2ca4a4957eb0ffecdf2153a8eace1d2\",\"license\":\"MIT\"},\"src/arbitration/KlerosCoreBase.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n/// @custom:authors: [@unknownunknown1, @jaybuidl]\\n/// @custom:reviewers: []\\n/// @custom:auditors: []\\n/// @custom:bounties: []\\n/// @custom:deployments: []\\n\\npragma solidity 0.8.24;\\n\\nimport {IArbitrableV2, IArbitratorV2} from \\\"./interfaces/IArbitratorV2.sol\\\";\\nimport {IDisputeKit} from \\\"./interfaces/IDisputeKit.sol\\\";\\nimport {ISortitionModule} from \\\"./interfaces/ISortitionModule.sol\\\";\\nimport {SafeERC20, IERC20} from \\\"../libraries/SafeERC20.sol\\\";\\nimport \\\"../libraries/Constants.sol\\\";\\n\\n/// @title KlerosCoreBase\\n/// Core arbitrator contract for Kleros v2.\\n/// Note that this contract trusts the PNK token, the dispute kit and the sortition module contracts.\\nabstract contract KlerosCoreBase is IArbitratorV2 {\\n    using SafeERC20 for IERC20;\\n\\n    // ************************************* //\\n    // *         Enums / Structs           * //\\n    // ************************************* //\\n\\n    enum Period {\\n        evidence, // Evidence can be submitted. This is also when drawing has to take place.\\n        commit, // Jurors commit a hashed vote. This is skipped for courts without hidden votes.\\n        vote, // Jurors reveal/cast their vote depending on whether the court has hidden votes or not.\\n        appeal, // The dispute can be appealed.\\n        execution // Tokens are redistributed and the ruling is executed.\\n    }\\n\\n    struct Court {\\n        uint96 parent; // The parent court.\\n        bool hiddenVotes; // Whether to use commit and reveal or not.\\n        uint256[] children; // List of child courts.\\n        uint256 minStake; // Minimum PNKs needed to stake in the court.\\n        uint256 alpha; // Basis point of PNKs that are lost when incoherent.\\n        uint256 feeForJuror; // Arbitration fee paid per juror.\\n        uint256 jurorsForCourtJump; // The appeal after the one that reaches this number of jurors will go to the parent court if any.\\n        uint256[4] timesPerPeriod; // The time allotted to each dispute period in the form `timesPerPeriod[period]`.\\n        mapping(uint256 disputeKitId => bool) supportedDisputeKits; // True if DK with this ID is supported by the court. Note that each court must support classic dispute kit.\\n        bool disabled; // True if the court is disabled. Unused for now, will be implemented later.\\n    }\\n\\n    struct Dispute {\\n        uint96 courtID; // The ID of the court the dispute is in.\\n        IArbitrableV2 arbitrated; // The arbitrable contract.\\n        Period period; // The current period of the dispute.\\n        bool ruled; // True if the ruling has been executed, false otherwise.\\n        uint256 lastPeriodChange; // The last time the period was changed.\\n        Round[] rounds;\\n    }\\n\\n    struct Round {\\n        uint256 disputeKitID; // Index of the dispute kit in the array.\\n        uint256 pnkAtStakePerJuror; // The amount of PNKs at stake for each juror in this round.\\n        uint256 totalFeesForJurors; // The total juror fees paid in this round.\\n        uint256 nbVotes; // The total number of votes the dispute can possibly have in the current round. Former votes[_round].length.\\n        uint256 repartitions; // A counter of reward repartitions made in this round.\\n        uint256 pnkPenalties; // The amount of PNKs collected from penalties in this round.\\n        address[] drawnJurors; // Addresses of the jurors that were drawn in this round.\\n        uint256 sumFeeRewardPaid; // Total sum of arbitration fees paid to coherent jurors as a reward in this round.\\n        uint256 sumPnkRewardPaid; // Total sum of PNK paid to coherent jurors as a reward in this round.\\n        IERC20 feeToken; // The token used for paying fees in this round.\\n        uint256 drawIterations; // The number of iterations passed drawing the jurors for this round.\\n    }\\n\\n    // Workaround \\\"stack too deep\\\" errors\\n    struct ExecuteParams {\\n        uint256 disputeID; // The ID of the dispute to execute.\\n        uint256 round; // The round to execute.\\n        uint256 coherentCount; // The number of coherent votes in the round.\\n        uint256 numberOfVotesInRound; // The number of votes in the round.\\n        uint256 feePerJurorInRound; // The fee per juror in the round.\\n        uint256 pnkAtStakePerJurorInRound; // The amount of PNKs at stake for each juror in the round.\\n        uint256 pnkPenaltiesInRound; // The amount of PNKs collected from penalties in the round.\\n        uint256 repartition; // The index of the repartition to execute.\\n    }\\n\\n    struct CurrencyRate {\\n        bool feePaymentAccepted;\\n        uint64 rateInEth;\\n        uint8 rateDecimals;\\n    }\\n\\n    // ************************************* //\\n    // *             Storage               * //\\n    // ************************************* //\\n\\n    uint256 private constant ALPHA_DIVISOR = 1e4; // The number to divide `Court.alpha` by.\\n    uint256 private constant NON_PAYABLE_AMOUNT = (2 ** 256 - 2) / 2; // An amount higher than the supply of ETH.\\n\\n    address public governor; // The governor of the contract.\\n    address public guardian; // The guardian able to pause asset withdrawals.\\n    IERC20 public pinakion; // The Pinakion token contract.\\n    address public jurorProsecutionModule; // The module for juror's prosecution.\\n    ISortitionModule public sortitionModule; // Sortition module for drawing.\\n    Court[] public courts; // The courts.\\n    IDisputeKit[] public disputeKits; // Array of dispute kits.\\n    Dispute[] public disputes; // The disputes.\\n    mapping(IERC20 => CurrencyRate) public currencyRates; // The price of each token in ETH.\\n    bool public paused; // Whether asset withdrawals are paused.\\n\\n    // ************************************* //\\n    // *              Events               * //\\n    // ************************************* //\\n\\n    event NewPeriod(uint256 indexed _disputeID, Period _period);\\n    event AppealPossible(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);\\n    event AppealDecision(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);\\n    event Draw(address indexed _address, uint256 indexed _disputeID, uint256 _roundID, uint256 _voteID);\\n    event CourtCreated(\\n        uint256 indexed _courtID,\\n        uint96 indexed _parent,\\n        bool _hiddenVotes,\\n        uint256 _minStake,\\n        uint256 _alpha,\\n        uint256 _feeForJuror,\\n        uint256 _jurorsForCourtJump,\\n        uint256[4] _timesPerPeriod,\\n        uint256[] _supportedDisputeKits\\n    );\\n    event CourtModified(\\n        uint96 indexed _courtID,\\n        bool _hiddenVotes,\\n        uint256 _minStake,\\n        uint256 _alpha,\\n        uint256 _feeForJuror,\\n        uint256 _jurorsForCourtJump,\\n        uint256[4] _timesPerPeriod\\n    );\\n    event DisputeKitCreated(uint256 indexed _disputeKitID, IDisputeKit indexed _disputeKitAddress);\\n    event DisputeKitEnabled(uint96 indexed _courtID, uint256 indexed _disputeKitID, bool indexed _enable);\\n    event CourtJump(\\n        uint256 indexed _disputeID,\\n        uint256 indexed _roundID,\\n        uint96 indexed _fromCourtID,\\n        uint96 _toCourtID\\n    );\\n    event DisputeKitJump(\\n        uint256 indexed _disputeID,\\n        uint256 indexed _roundID,\\n        uint256 indexed _fromDisputeKitID,\\n        uint256 _toDisputeKitID\\n    );\\n    event TokenAndETHShift(\\n        address indexed _account,\\n        uint256 indexed _disputeID,\\n        uint256 indexed _roundID,\\n        uint256 _degreeOfCoherency,\\n        int256 _pnkAmount,\\n        int256 _feeAmount,\\n        IERC20 _feeToken\\n    );\\n    event LeftoverRewardSent(\\n        uint256 indexed _disputeID,\\n        uint256 indexed _roundID,\\n        uint256 _pnkAmount,\\n        uint256 _feeAmount,\\n        IERC20 _feeToken\\n    );\\n    event Paused();\\n    event Unpaused();\\n\\n    // ************************************* //\\n    // *        Function Modifiers         * //\\n    // ************************************* //\\n\\n    modifier onlyByGovernor() {\\n        if (governor != msg.sender) revert GovernorOnly();\\n        _;\\n    }\\n\\n    modifier onlyByGuardianOrGovernor() {\\n        if (guardian != msg.sender && governor != msg.sender) revert GuardianOrGovernorOnly();\\n        _;\\n    }\\n\\n    modifier whenPaused() {\\n        if (!paused) revert WhenPausedOnly();\\n        _;\\n    }\\n\\n    modifier whenNotPaused() {\\n        if (paused) revert WhenNotPausedOnly();\\n        _;\\n    }\\n\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    function _initialize(\\n        address _governor,\\n        address _guardian,\\n        IERC20 _pinakion,\\n        address _jurorProsecutionModule,\\n        IDisputeKit _disputeKit,\\n        bool _hiddenVotes,\\n        uint256[4] memory _courtParameters,\\n        uint256[4] memory _timesPerPeriod,\\n        bytes memory _sortitionExtraData,\\n        ISortitionModule _sortitionModuleAddress\\n    ) internal {\\n        governor = _governor;\\n        guardian = _guardian;\\n        pinakion = _pinakion;\\n        jurorProsecutionModule = _jurorProsecutionModule;\\n        sortitionModule = _sortitionModuleAddress;\\n\\n        // NULL_DISPUTE_KIT: an empty element at index 0 to indicate when a dispute kit is not supported.\\n        disputeKits.push();\\n\\n        // DISPUTE_KIT_CLASSIC\\n        disputeKits.push(_disputeKit);\\n\\n        emit DisputeKitCreated(DISPUTE_KIT_CLASSIC, _disputeKit);\\n\\n        // FORKING_COURT\\n        // TODO: Fill the properties for the Forking court, emit CourtCreated.\\n        courts.push();\\n        sortitionModule.createTree(bytes32(uint256(FORKING_COURT)), _sortitionExtraData);\\n\\n        // GENERAL_COURT\\n        Court storage court = courts.push();\\n        court.parent = FORKING_COURT;\\n        court.children = new uint256[](0);\\n        court.hiddenVotes = _hiddenVotes;\\n        court.minStake = _courtParameters[0];\\n        court.alpha = _courtParameters[1];\\n        court.feeForJuror = _courtParameters[2];\\n        court.jurorsForCourtJump = _courtParameters[3];\\n        court.timesPerPeriod = _timesPerPeriod;\\n\\n        sortitionModule.createTree(bytes32(uint256(GENERAL_COURT)), _sortitionExtraData);\\n\\n        emit CourtCreated(\\n            1,\\n            court.parent,\\n            _hiddenVotes,\\n            _courtParameters[0],\\n            _courtParameters[1],\\n            _courtParameters[2],\\n            _courtParameters[3],\\n            _timesPerPeriod,\\n            new uint256[](0)\\n        );\\n        _enableDisputeKit(GENERAL_COURT, DISPUTE_KIT_CLASSIC, true);\\n    }\\n\\n    // ************************************* //\\n    // *             Governance            * //\\n    // ************************************* //\\n\\n    /// @dev Pause staking and reward execution. Can only be done by guardian or governor.\\n    function pause() external onlyByGuardianOrGovernor whenNotPaused {\\n        paused = true;\\n        emit Paused();\\n    }\\n\\n    /// @dev Unpause staking and reward execution. Can only be done by governor.\\n    function unpause() external onlyByGovernor whenPaused {\\n        paused = false;\\n        emit Unpaused();\\n    }\\n\\n    /// @dev Allows the governor to call anything on behalf of the contract.\\n    /// @param _destination The destination of the call.\\n    /// @param _amount The value sent with the call.\\n    /// @param _data The data sent with the call.\\n    function executeGovernorProposal(\\n        address _destination,\\n        uint256 _amount,\\n        bytes memory _data\\n    ) external onlyByGovernor {\\n        (bool success, ) = _destination.call{value: _amount}(_data);\\n        if (!success) revert UnsuccessfulCall();\\n    }\\n\\n    /// @dev Changes the `governor` storage variable.\\n    /// @param _governor The new value for the `governor` storage variable.\\n    function changeGovernor(address payable _governor) external onlyByGovernor {\\n        governor = _governor;\\n    }\\n\\n    /// @dev Changes the `guardian` storage variable.\\n    /// @param _guardian The new value for the `guardian` storage variable.\\n    function changeGuardian(address _guardian) external onlyByGovernor {\\n        guardian = _guardian;\\n    }\\n\\n    /// @dev Changes the `pinakion` storage variable.\\n    /// @param _pinakion The new value for the `pinakion` storage variable.\\n    function changePinakion(IERC20 _pinakion) external onlyByGovernor {\\n        pinakion = _pinakion;\\n    }\\n\\n    /// @dev Changes the `jurorProsecutionModule` storage variable.\\n    /// @param _jurorProsecutionModule The new value for the `jurorProsecutionModule` storage variable.\\n    function changeJurorProsecutionModule(address _jurorProsecutionModule) external onlyByGovernor {\\n        jurorProsecutionModule = _jurorProsecutionModule;\\n    }\\n\\n    /// @dev Changes the `_sortitionModule` storage variable.\\n    /// Note that the new module should be initialized for all courts.\\n    /// @param _sortitionModule The new value for the `sortitionModule` storage variable.\\n    function changeSortitionModule(ISortitionModule _sortitionModule) external onlyByGovernor {\\n        sortitionModule = _sortitionModule;\\n    }\\n\\n    /// @dev Add a new supported dispute kit module to the court.\\n    /// @param _disputeKitAddress The address of the dispute kit contract.\\n    function addNewDisputeKit(IDisputeKit _disputeKitAddress) external onlyByGovernor {\\n        uint256 disputeKitID = disputeKits.length;\\n        disputeKits.push(_disputeKitAddress);\\n        emit DisputeKitCreated(disputeKitID, _disputeKitAddress);\\n    }\\n\\n    /// @dev Creates a court under a specified parent court.\\n    /// @param _parent The `parent` property value of the court.\\n    /// @param _hiddenVotes The `hiddenVotes` property value of the court.\\n    /// @param _minStake The `minStake` property value of the court.\\n    /// @param _alpha The `alpha` property value of the court.\\n    /// @param _feeForJuror The `feeForJuror` property value of the court.\\n    /// @param _jurorsForCourtJump The `jurorsForCourtJump` property value of the court.\\n    /// @param _timesPerPeriod The `timesPerPeriod` property value of the court.\\n    /// @param _sortitionExtraData Extra data for sortition module.\\n    /// @param _supportedDisputeKits Indexes of dispute kits that this court will support.\\n    function createCourt(\\n        uint96 _parent,\\n        bool _hiddenVotes,\\n        uint256 _minStake,\\n        uint256 _alpha,\\n        uint256 _feeForJuror,\\n        uint256 _jurorsForCourtJump,\\n        uint256[4] memory _timesPerPeriod,\\n        bytes memory _sortitionExtraData,\\n        uint256[] memory _supportedDisputeKits\\n    ) external onlyByGovernor {\\n        if (courts[_parent].minStake > _minStake) revert MinStakeLowerThanParentCourt();\\n        if (_supportedDisputeKits.length == 0) revert UnsupportedDisputeKit();\\n        if (_parent == FORKING_COURT) revert InvalidForkingCourtAsParent();\\n\\n        uint256 courtID = courts.length;\\n        Court storage court = courts.push();\\n\\n        for (uint256 i = 0; i < _supportedDisputeKits.length; i++) {\\n            if (_supportedDisputeKits[i] == 0 || _supportedDisputeKits[i] >= disputeKits.length) {\\n                revert WrongDisputeKitIndex();\\n            }\\n            court.supportedDisputeKits[_supportedDisputeKits[i]] = true;\\n        }\\n        // Check that Classic DK support was added.\\n        if (!court.supportedDisputeKits[DISPUTE_KIT_CLASSIC]) revert MustSupportDisputeKitClassic();\\n\\n        court.parent = _parent;\\n        court.children = new uint256[](0);\\n        court.hiddenVotes = _hiddenVotes;\\n        court.minStake = _minStake;\\n        court.alpha = _alpha;\\n        court.feeForJuror = _feeForJuror;\\n        court.jurorsForCourtJump = _jurorsForCourtJump;\\n        court.timesPerPeriod = _timesPerPeriod;\\n\\n        sortitionModule.createTree(bytes32(courtID), _sortitionExtraData);\\n\\n        // Update the parent.\\n        courts[_parent].children.push(courtID);\\n        emit CourtCreated(\\n            courtID,\\n            _parent,\\n            _hiddenVotes,\\n            _minStake,\\n            _alpha,\\n            _feeForJuror,\\n            _jurorsForCourtJump,\\n            _timesPerPeriod,\\n            _supportedDisputeKits\\n        );\\n    }\\n\\n    function changeCourtParameters(\\n        uint96 _courtID,\\n        bool _hiddenVotes,\\n        uint256 _minStake,\\n        uint256 _alpha,\\n        uint256 _feeForJuror,\\n        uint256 _jurorsForCourtJump,\\n        uint256[4] memory _timesPerPeriod\\n    ) external onlyByGovernor {\\n        Court storage court = courts[_courtID];\\n        if (_courtID != GENERAL_COURT && courts[court.parent].minStake > _minStake) {\\n            revert MinStakeLowerThanParentCourt();\\n        }\\n        for (uint256 i = 0; i < court.children.length; i++) {\\n            if (courts[court.children[i]].minStake < _minStake) {\\n                revert MinStakeLowerThanParentCourt();\\n            }\\n        }\\n        court.minStake = _minStake;\\n        court.hiddenVotes = _hiddenVotes;\\n        court.alpha = _alpha;\\n        court.feeForJuror = _feeForJuror;\\n        court.jurorsForCourtJump = _jurorsForCourtJump;\\n        court.timesPerPeriod = _timesPerPeriod;\\n        emit CourtModified(\\n            _courtID,\\n            _hiddenVotes,\\n            _minStake,\\n            _alpha,\\n            _feeForJuror,\\n            _jurorsForCourtJump,\\n            _timesPerPeriod\\n        );\\n    }\\n\\n    /// @dev Adds/removes court's support for specified dispute kits.\\n    /// @param _courtID The ID of the court.\\n    /// @param _disputeKitIDs The IDs of dispute kits which support should be added/removed.\\n    /// @param _enable Whether add or remove the dispute kits from the court.\\n    function enableDisputeKits(uint96 _courtID, uint256[] memory _disputeKitIDs, bool _enable) external onlyByGovernor {\\n        for (uint256 i = 0; i < _disputeKitIDs.length; i++) {\\n            if (_enable) {\\n                if (_disputeKitIDs[i] == 0 || _disputeKitIDs[i] >= disputeKits.length) {\\n                    revert WrongDisputeKitIndex();\\n                }\\n                _enableDisputeKit(_courtID, _disputeKitIDs[i], true);\\n            } else {\\n                // Classic dispute kit must be supported by all courts.\\n                if (_disputeKitIDs[i] == DISPUTE_KIT_CLASSIC) {\\n                    revert CannotDisableClassicDK();\\n                }\\n                _enableDisputeKit(_courtID, _disputeKitIDs[i], false);\\n            }\\n        }\\n    }\\n\\n    /// @dev Changes the supported fee tokens.\\n    /// @param _feeToken The fee token.\\n    /// @param _accepted Whether the token is supported or not as a method of fee payment.\\n    function changeAcceptedFeeTokens(IERC20 _feeToken, bool _accepted) external onlyByGovernor {\\n        currencyRates[_feeToken].feePaymentAccepted = _accepted;\\n        emit AcceptedFeeToken(_feeToken, _accepted);\\n    }\\n\\n    /// @dev Changes the currency rate of a fee token.\\n    /// @param _feeToken The fee token.\\n    /// @param _rateInEth The new rate of the fee token in ETH.\\n    /// @param _rateDecimals The new decimals of the fee token rate.\\n    function changeCurrencyRates(IERC20 _feeToken, uint64 _rateInEth, uint8 _rateDecimals) external onlyByGovernor {\\n        currencyRates[_feeToken].rateInEth = _rateInEth;\\n        currencyRates[_feeToken].rateDecimals = _rateDecimals;\\n        emit NewCurrencyRate(_feeToken, _rateInEth, _rateDecimals);\\n    }\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @dev Sets the caller's stake in a court.\\n    /// @param _courtID The ID of the court.\\n    /// @param _newStake The new stake.\\n    /// Note that the existing delayed stake will be nullified as non-relevant.\\n    function setStake(uint96 _courtID, uint256 _newStake) external virtual whenNotPaused {\\n        _setStake(msg.sender, _courtID, _newStake, false, OnError.Revert);\\n    }\\n\\n    /// @dev Sets the stake of a specified account in a court, typically to apply a delayed stake or unstake inactive jurors.\\n    /// @param _account The account whose stake is being set.\\n    /// @param _courtID The ID of the court.\\n    /// @param _newStake The new stake.\\n    /// @param _alreadyTransferred Whether the PNKs have already been transferred to the contract.\\n    function setStakeBySortitionModule(\\n        address _account,\\n        uint96 _courtID,\\n        uint256 _newStake,\\n        bool _alreadyTransferred\\n    ) external {\\n        if (msg.sender != address(sortitionModule)) revert SortitionModuleOnly();\\n        _setStake(_account, _courtID, _newStake, _alreadyTransferred, OnError.Return);\\n    }\\n\\n    /// @inheritdoc IArbitratorV2\\n    function createDispute(\\n        uint256 _numberOfChoices,\\n        bytes memory _extraData\\n    ) external payable override returns (uint256 disputeID) {\\n        if (msg.value < arbitrationCost(_extraData)) revert ArbitrationFeesNotEnough();\\n\\n        return _createDispute(_numberOfChoices, _extraData, NATIVE_CURRENCY, msg.value);\\n    }\\n\\n    /// @inheritdoc IArbitratorV2\\n    function createDispute(\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData,\\n        IERC20 _feeToken,\\n        uint256 _feeAmount\\n    ) external override returns (uint256 disputeID) {\\n        if (!currencyRates[_feeToken].feePaymentAccepted) revert TokenNotAccepted();\\n        if (_feeAmount < arbitrationCost(_extraData, _feeToken)) revert ArbitrationFeesNotEnough();\\n\\n        if (!_feeToken.safeTransferFrom(msg.sender, address(this), _feeAmount)) revert TransferFailed();\\n        return _createDispute(_numberOfChoices, _extraData, _feeToken, _feeAmount);\\n    }\\n\\n    function _createDispute(\\n        uint256 _numberOfChoices,\\n        bytes memory _extraData,\\n        IERC20 _feeToken,\\n        uint256 _feeAmount\\n    ) internal virtual returns (uint256 disputeID) {\\n        (uint96 courtID, , uint256 disputeKitID) = _extraDataToCourtIDMinJurorsDisputeKit(_extraData);\\n        if (!courts[courtID].supportedDisputeKits[disputeKitID]) revert DisputeKitNotSupportedByCourt();\\n\\n        disputeID = disputes.length;\\n        Dispute storage dispute = disputes.push();\\n        dispute.courtID = courtID;\\n        dispute.arbitrated = IArbitrableV2(msg.sender);\\n        dispute.lastPeriodChange = block.timestamp;\\n\\n        IDisputeKit disputeKit = disputeKits[disputeKitID];\\n        Court storage court = courts[courtID];\\n        Round storage round = dispute.rounds.push();\\n\\n        // Obtain the feeForJuror in the same currency as the _feeAmount\\n        uint256 feeForJuror = (_feeToken == NATIVE_CURRENCY)\\n            ? court.feeForJuror\\n            : convertEthToTokenAmount(_feeToken, court.feeForJuror);\\n        round.nbVotes = _feeAmount / feeForJuror;\\n        round.disputeKitID = disputeKitID;\\n        round.pnkAtStakePerJuror = (court.minStake * court.alpha) / ALPHA_DIVISOR;\\n        round.totalFeesForJurors = _feeAmount;\\n        round.feeToken = IERC20(_feeToken);\\n\\n        sortitionModule.createDisputeHook(disputeID, 0); // Default round ID.\\n\\n        disputeKit.createDispute(disputeID, _numberOfChoices, _extraData, round.nbVotes);\\n        emit DisputeCreation(disputeID, IArbitrableV2(msg.sender));\\n    }\\n\\n    /// @dev Passes the period of a specified dispute.\\n    /// @param _disputeID The ID of the dispute.\\n    function passPeriod(uint256 _disputeID) external {\\n        Dispute storage dispute = disputes[_disputeID];\\n        Court storage court = courts[dispute.courtID];\\n\\n        uint256 currentRound = dispute.rounds.length - 1;\\n        Round storage round = dispute.rounds[currentRound];\\n        if (dispute.period == Period.evidence) {\\n            if (\\n                currentRound == 0 &&\\n                block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)]\\n            ) {\\n                revert EvidenceNotPassedAndNotAppeal();\\n            }\\n            if (round.drawnJurors.length != round.nbVotes) revert DisputeStillDrawing();\\n            dispute.period = court.hiddenVotes ? Period.commit : Period.vote;\\n        } else if (dispute.period == Period.commit) {\\n            if (\\n                block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)] &&\\n                !disputeKits[round.disputeKitID].areCommitsAllCast(_disputeID)\\n            ) {\\n                revert CommitPeriodNotPassed();\\n            }\\n            dispute.period = Period.vote;\\n        } else if (dispute.period == Period.vote) {\\n            if (\\n                block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)] &&\\n                !disputeKits[round.disputeKitID].areVotesAllCast(_disputeID)\\n            ) {\\n                revert VotePeriodNotPassed();\\n            }\\n            dispute.period = Period.appeal;\\n            emit AppealPossible(_disputeID, dispute.arbitrated);\\n        } else if (dispute.period == Period.appeal) {\\n            if (block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)]) {\\n                revert AppealPeriodNotPassed();\\n            }\\n            dispute.period = Period.execution;\\n        } else if (dispute.period == Period.execution) {\\n            revert DisputePeriodIsFinal();\\n        }\\n\\n        dispute.lastPeriodChange = block.timestamp;\\n        emit NewPeriod(_disputeID, dispute.period);\\n    }\\n\\n    /// @dev Draws jurors for the dispute. Can be called in parts.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _iterations The number of iterations to run.\\n    function draw(uint256 _disputeID, uint256 _iterations) external {\\n        Dispute storage dispute = disputes[_disputeID];\\n        uint256 currentRound = dispute.rounds.length - 1;\\n        Round storage round = dispute.rounds[currentRound];\\n        if (dispute.period != Period.evidence) revert NotEvidencePeriod();\\n\\n        IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n\\n        uint256 startIndex = round.drawIterations; // for gas: less storage reads\\n        uint256 i;\\n        while (i < _iterations && round.drawnJurors.length < round.nbVotes) {\\n            address drawnAddress = disputeKit.draw(_disputeID, startIndex + i++);\\n            if (drawnAddress == address(0)) {\\n                continue;\\n            }\\n            sortitionModule.lockStake(drawnAddress, round.pnkAtStakePerJuror);\\n            emit Draw(drawnAddress, _disputeID, currentRound, round.drawnJurors.length);\\n            round.drawnJurors.push(drawnAddress);\\n            if (round.drawnJurors.length == round.nbVotes) {\\n                sortitionModule.postDrawHook(_disputeID, currentRound);\\n            }\\n        }\\n        round.drawIterations += i;\\n    }\\n\\n    /// @dev Appeals the ruling of a specified dispute.\\n    /// Note: Access restricted to the Dispute Kit for this `disputeID`.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _numberOfChoices Number of choices for the dispute. Can be required during court jump.\\n    /// @param _extraData Extradata for the dispute. Can be required during court jump.\\n    function appeal(uint256 _disputeID, uint256 _numberOfChoices, bytes memory _extraData) external payable {\\n        if (msg.value < appealCost(_disputeID)) revert AppealFeesNotEnough();\\n\\n        Dispute storage dispute = disputes[_disputeID];\\n        if (dispute.period != Period.appeal) revert DisputeNotAppealable();\\n\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        if (msg.sender != address(disputeKits[round.disputeKitID])) revert DisputeKitOnly();\\n\\n        uint96 newCourtID = dispute.courtID;\\n        uint256 newDisputeKitID = round.disputeKitID;\\n\\n        // Warning: the extra round must be created before calling disputeKit.createDispute()\\n        Round storage extraRound = dispute.rounds.push();\\n\\n        if (round.nbVotes >= courts[newCourtID].jurorsForCourtJump) {\\n            // Jump to parent court.\\n            newCourtID = courts[newCourtID].parent;\\n\\n            if (!courts[newCourtID].supportedDisputeKits[newDisputeKitID]) {\\n                // Switch to classic dispute kit if parent court doesn't support the current one.\\n                newDisputeKitID = DISPUTE_KIT_CLASSIC;\\n            }\\n\\n            if (newCourtID != dispute.courtID) {\\n                emit CourtJump(_disputeID, dispute.rounds.length - 1, dispute.courtID, newCourtID);\\n            }\\n        }\\n\\n        dispute.courtID = newCourtID;\\n        dispute.period = Period.evidence;\\n        dispute.lastPeriodChange = block.timestamp;\\n\\n        Court storage court = courts[newCourtID];\\n        extraRound.nbVotes = msg.value / court.feeForJuror; // As many votes that can be afforded by the provided funds.\\n        extraRound.pnkAtStakePerJuror = (court.minStake * court.alpha) / ALPHA_DIVISOR;\\n        extraRound.totalFeesForJurors = msg.value;\\n        extraRound.disputeKitID = newDisputeKitID;\\n\\n        sortitionModule.createDisputeHook(_disputeID, dispute.rounds.length - 1);\\n\\n        // Dispute kit was changed, so create a dispute in the new DK contract.\\n        if (extraRound.disputeKitID != round.disputeKitID) {\\n            emit DisputeKitJump(_disputeID, dispute.rounds.length - 1, round.disputeKitID, extraRound.disputeKitID);\\n            disputeKits[extraRound.disputeKitID].createDispute(\\n                _disputeID,\\n                _numberOfChoices,\\n                _extraData,\\n                extraRound.nbVotes\\n            );\\n        }\\n\\n        emit AppealDecision(_disputeID, dispute.arbitrated);\\n        emit NewPeriod(_disputeID, Period.evidence);\\n    }\\n\\n    /// @dev Distribute the PNKs at stake and the dispute fees for the specific round of the dispute. Can be called in parts.\\n    /// Note: Reward distributions are forbidden during pause.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _round The appeal round.\\n    /// @param _iterations The number of iterations to run.\\n    function execute(uint256 _disputeID, uint256 _round, uint256 _iterations) external whenNotPaused {\\n        Round storage round;\\n        {\\n            Dispute storage dispute = disputes[_disputeID];\\n            if (dispute.period != Period.execution) revert NotExecutionPeriod();\\n\\n            round = dispute.rounds[_round];\\n        } // stack too deep workaround\\n\\n        uint256 start = round.repartitions;\\n        uint256 end = round.repartitions + _iterations;\\n\\n        uint256 pnkPenaltiesInRound = round.pnkPenalties; // Keep in memory to save gas.\\n        uint256 numberOfVotesInRound = round.drawnJurors.length;\\n        uint256 feePerJurorInRound = round.totalFeesForJurors / numberOfVotesInRound;\\n        uint256 pnkAtStakePerJurorInRound = round.pnkAtStakePerJuror;\\n        uint256 coherentCount;\\n        {\\n            IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n            coherentCount = disputeKit.getCoherentCount(_disputeID, _round); // Total number of jurors that are eligible to a reward in this round.\\n        } // stack too deep workaround\\n\\n        if (coherentCount == 0) {\\n            // We loop over the votes once as there are no rewards because it is not a tie and no one in this round is coherent with the final outcome.\\n            if (end > numberOfVotesInRound) end = numberOfVotesInRound;\\n        } else {\\n            // We loop over the votes twice, first to collect the PNK penalties, and second to distribute them as rewards along with arbitration fees.\\n            if (end > numberOfVotesInRound * 2) end = numberOfVotesInRound * 2;\\n        }\\n        round.repartitions = end;\\n\\n        for (uint256 i = start; i < end; i++) {\\n            if (i < numberOfVotesInRound) {\\n                pnkPenaltiesInRound = _executePenalties(\\n                    ExecuteParams({\\n                        disputeID: _disputeID,\\n                        round: _round,\\n                        coherentCount: coherentCount,\\n                        numberOfVotesInRound: numberOfVotesInRound,\\n                        feePerJurorInRound: feePerJurorInRound,\\n                        pnkAtStakePerJurorInRound: pnkAtStakePerJurorInRound,\\n                        pnkPenaltiesInRound: pnkPenaltiesInRound,\\n                        repartition: i\\n                    })\\n                );\\n            } else {\\n                _executeRewards(\\n                    ExecuteParams({\\n                        disputeID: _disputeID,\\n                        round: _round,\\n                        coherentCount: coherentCount,\\n                        numberOfVotesInRound: numberOfVotesInRound,\\n                        feePerJurorInRound: feePerJurorInRound,\\n                        pnkAtStakePerJurorInRound: pnkAtStakePerJurorInRound,\\n                        pnkPenaltiesInRound: pnkPenaltiesInRound,\\n                        repartition: i\\n                    })\\n                );\\n            }\\n        }\\n        if (round.pnkPenalties != pnkPenaltiesInRound) {\\n            round.pnkPenalties = pnkPenaltiesInRound; // Reentrancy risk: breaks Check-Effect-Interact\\n        }\\n    }\\n\\n    /// @dev Distribute the PNKs at stake and the dispute fees for the specific round of the dispute, penalties only.\\n    /// @param _params The parameters for the execution, see `ExecuteParams`.\\n    /// @return pnkPenaltiesInRoundCache The updated penalties in round cache.\\n    function _executePenalties(ExecuteParams memory _params) internal returns (uint256) {\\n        Dispute storage dispute = disputes[_params.disputeID];\\n        Round storage round = dispute.rounds[_params.round];\\n        IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n\\n        // [0, 1] value that determines how coherent the juror was in this round, in basis points.\\n        uint256 degreeOfCoherence = disputeKit.getDegreeOfCoherence(\\n            _params.disputeID,\\n            _params.round,\\n            _params.repartition,\\n            _params.feePerJurorInRound,\\n            _params.pnkAtStakePerJurorInRound\\n        );\\n        if (degreeOfCoherence > ALPHA_DIVISOR) {\\n            // Make sure the degree doesn't exceed 1, though it should be ensured by the dispute kit.\\n            degreeOfCoherence = ALPHA_DIVISOR;\\n        }\\n\\n        // Fully coherent jurors won't be penalized.\\n        uint256 penalty = (round.pnkAtStakePerJuror * (ALPHA_DIVISOR - degreeOfCoherence)) / ALPHA_DIVISOR;\\n        _params.pnkPenaltiesInRound += penalty;\\n\\n        // Unlock the PNKs affected by the penalty\\n        address account = round.drawnJurors[_params.repartition];\\n        sortitionModule.unlockStake(account, penalty);\\n\\n        // Apply the penalty to the staked PNKs.\\n        sortitionModule.penalizeStake(account, penalty);\\n        emit TokenAndETHShift(\\n            account,\\n            _params.disputeID,\\n            _params.round,\\n            degreeOfCoherence,\\n            -int256(penalty),\\n            0,\\n            round.feeToken\\n        );\\n\\n        if (!disputeKit.isVoteActive(_params.disputeID, _params.round, _params.repartition)) {\\n            // The juror is inactive, unstake them.\\n            sortitionModule.setJurorInactive(account);\\n        }\\n        if (_params.repartition == _params.numberOfVotesInRound - 1 && _params.coherentCount == 0) {\\n            // No one was coherent, send the rewards to the governor.\\n            if (round.feeToken == NATIVE_CURRENCY) {\\n                // The dispute fees were paid in ETH\\n                payable(governor).send(round.totalFeesForJurors);\\n            } else {\\n                // The dispute fees were paid in ERC20\\n                round.feeToken.safeTransfer(governor, round.totalFeesForJurors);\\n            }\\n            pinakion.safeTransfer(governor, _params.pnkPenaltiesInRound);\\n            emit LeftoverRewardSent(\\n                _params.disputeID,\\n                _params.round,\\n                _params.pnkPenaltiesInRound,\\n                round.totalFeesForJurors,\\n                round.feeToken\\n            );\\n        }\\n        return _params.pnkPenaltiesInRound;\\n    }\\n\\n    /// @dev Distribute the PNKs at stake and the dispute fees for the specific round of the dispute, rewards only.\\n    /// @param _params The parameters for the execution, see `ExecuteParams`.\\n    function _executeRewards(ExecuteParams memory _params) internal {\\n        Dispute storage dispute = disputes[_params.disputeID];\\n        Round storage round = dispute.rounds[_params.round];\\n        IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n\\n        // [0, 1] value that determines how coherent the juror was in this round, in basis points.\\n        uint256 degreeOfCoherence = disputeKit.getDegreeOfCoherence(\\n            _params.disputeID,\\n            _params.round,\\n            _params.repartition % _params.numberOfVotesInRound,\\n            _params.feePerJurorInRound,\\n            _params.pnkAtStakePerJurorInRound\\n        );\\n\\n        // Make sure the degree doesn't exceed 1, though it should be ensured by the dispute kit.\\n        if (degreeOfCoherence > ALPHA_DIVISOR) {\\n            degreeOfCoherence = ALPHA_DIVISOR;\\n        }\\n\\n        address account = round.drawnJurors[_params.repartition % _params.numberOfVotesInRound];\\n        uint256 pnkLocked = (round.pnkAtStakePerJuror * degreeOfCoherence) / ALPHA_DIVISOR;\\n\\n        // Release the rest of the PNKs of the juror for this round.\\n        sortitionModule.unlockStake(account, pnkLocked);\\n\\n        // Give back the locked PNKs in case the juror fully unstaked earlier.\\n        if (!sortitionModule.isJurorStaked(account)) {\\n            pinakion.safeTransfer(account, pnkLocked);\\n        }\\n\\n        // Transfer the rewards\\n        uint256 pnkReward = ((_params.pnkPenaltiesInRound / _params.coherentCount) * degreeOfCoherence) / ALPHA_DIVISOR;\\n        round.sumPnkRewardPaid += pnkReward;\\n        uint256 feeReward = ((round.totalFeesForJurors / _params.coherentCount) * degreeOfCoherence) / ALPHA_DIVISOR;\\n        round.sumFeeRewardPaid += feeReward;\\n        pinakion.safeTransfer(account, pnkReward);\\n        if (round.feeToken == NATIVE_CURRENCY) {\\n            // The dispute fees were paid in ETH\\n            payable(account).send(feeReward);\\n        } else {\\n            // The dispute fees were paid in ERC20\\n            round.feeToken.safeTransfer(account, feeReward);\\n        }\\n        emit TokenAndETHShift(\\n            account,\\n            _params.disputeID,\\n            _params.round,\\n            degreeOfCoherence,\\n            int256(pnkReward),\\n            int256(feeReward),\\n            round.feeToken\\n        );\\n\\n        // Transfer any residual rewards to the governor. It may happen due to partial coherence of the jurors.\\n        if (_params.repartition == _params.numberOfVotesInRound * 2 - 1) {\\n            uint256 leftoverPnkReward = _params.pnkPenaltiesInRound - round.sumPnkRewardPaid;\\n            uint256 leftoverFeeReward = round.totalFeesForJurors - round.sumFeeRewardPaid;\\n            if (leftoverPnkReward != 0 || leftoverFeeReward != 0) {\\n                if (leftoverPnkReward != 0) {\\n                    pinakion.safeTransfer(governor, leftoverPnkReward);\\n                }\\n                if (leftoverFeeReward != 0) {\\n                    if (round.feeToken == NATIVE_CURRENCY) {\\n                        // The dispute fees were paid in ETH\\n                        payable(governor).send(leftoverFeeReward);\\n                    } else {\\n                        // The dispute fees were paid in ERC20\\n                        round.feeToken.safeTransfer(governor, leftoverFeeReward);\\n                    }\\n                }\\n                emit LeftoverRewardSent(\\n                    _params.disputeID,\\n                    _params.round,\\n                    leftoverPnkReward,\\n                    leftoverFeeReward,\\n                    round.feeToken\\n                );\\n            }\\n        }\\n    }\\n\\n    /// @dev Executes a specified dispute's ruling.\\n    /// @param _disputeID The ID of the dispute.\\n    function executeRuling(uint256 _disputeID) external {\\n        Dispute storage dispute = disputes[_disputeID];\\n        if (dispute.period != Period.execution) revert NotExecutionPeriod();\\n        if (dispute.ruled) revert RulingAlreadyExecuted();\\n\\n        (uint256 winningChoice, , ) = currentRuling(_disputeID);\\n        dispute.ruled = true;\\n        emit Ruling(dispute.arbitrated, _disputeID, winningChoice);\\n        dispute.arbitrated.rule(_disputeID, winningChoice);\\n    }\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /// @dev Compute the cost of arbitration denominated in ETH.\\n    ///      It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @return cost The arbitration cost in ETH.\\n    function arbitrationCost(bytes memory _extraData) public view override returns (uint256 cost) {\\n        (uint96 courtID, uint256 minJurors, ) = _extraDataToCourtIDMinJurorsDisputeKit(_extraData);\\n        cost = courts[courtID].feeForJuror * minJurors;\\n    }\\n\\n    /// @dev Compute the cost of arbitration denominated in `_feeToken`.\\n    ///      It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @param _feeToken The ERC20 token used to pay fees.\\n    /// @return cost The arbitration cost in `_feeToken`.\\n    function arbitrationCost(bytes calldata _extraData, IERC20 _feeToken) public view override returns (uint256 cost) {\\n        cost = convertEthToTokenAmount(_feeToken, arbitrationCost(_extraData));\\n    }\\n\\n    /// @dev Gets the cost of appealing a specified dispute.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return cost The appeal cost.\\n    function appealCost(uint256 _disputeID) public view returns (uint256 cost) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        Court storage court = courts[dispute.courtID];\\n        if (round.nbVotes >= court.jurorsForCourtJump) {\\n            // Jump to parent court.\\n            if (dispute.courtID == GENERAL_COURT) {\\n                // TODO: Handle the forking when appealed in General court.\\n                cost = NON_PAYABLE_AMOUNT; // Get the cost of the parent court.\\n            } else {\\n                cost = courts[court.parent].feeForJuror * ((round.nbVotes * 2) + 1);\\n            }\\n        } else {\\n            // Stay in current court.\\n            cost = court.feeForJuror * ((round.nbVotes * 2) + 1);\\n        }\\n    }\\n\\n    /// @dev Gets the start and the end of a specified dispute's current appeal period.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return start The start of the appeal period.\\n    /// @return end The end of the appeal period.\\n    function appealPeriod(uint256 _disputeID) public view returns (uint256 start, uint256 end) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        if (dispute.period == Period.appeal) {\\n            start = dispute.lastPeriodChange;\\n            end = dispute.lastPeriodChange + courts[dispute.courtID].timesPerPeriod[uint256(Period.appeal)];\\n        } else {\\n            start = 0;\\n            end = 0;\\n        }\\n    }\\n\\n    /// @dev Gets the current ruling of a specified dispute.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return ruling The current ruling.\\n    /// @return tied Whether it's a tie or not.\\n    /// @return overridden Whether the ruling was overridden by appeal funding or not.\\n    function currentRuling(uint256 _disputeID) public view returns (uint256 ruling, bool tied, bool overridden) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n        (ruling, tied, overridden) = disputeKit.currentRuling(_disputeID);\\n    }\\n\\n    function getRoundInfo(uint256 _disputeID, uint256 _round) external view returns (Round memory) {\\n        return disputes[_disputeID].rounds[_round];\\n    }\\n\\n    function getNumberOfRounds(uint256 _disputeID) external view returns (uint256) {\\n        return disputes[_disputeID].rounds.length;\\n    }\\n\\n    function isSupported(uint96 _courtID, uint256 _disputeKitID) external view returns (bool) {\\n        return courts[_courtID].supportedDisputeKits[_disputeKitID];\\n    }\\n\\n    /// @dev Gets the timesPerPeriod array for a given court.\\n    /// @param _courtID The ID of the court to get the times from.\\n    /// @return timesPerPeriod The timesPerPeriod array for the given court.\\n    function getTimesPerPeriod(uint96 _courtID) external view returns (uint256[4] memory timesPerPeriod) {\\n        timesPerPeriod = courts[_courtID].timesPerPeriod;\\n    }\\n\\n    // ************************************* //\\n    // *   Public Views for Dispute Kits   * //\\n    // ************************************* //\\n\\n    /// @dev Gets the number of votes permitted for the specified dispute in the latest round.\\n    /// @param _disputeID The ID of the dispute.\\n    function getNumberOfVotes(uint256 _disputeID) external view returns (uint256) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        return dispute.rounds[dispute.rounds.length - 1].nbVotes;\\n    }\\n\\n    /// @dev Returns true if the dispute kit will be switched to a parent DK.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return Whether DK will be switched or not.\\n    function isDisputeKitJumping(uint256 _disputeID) external view returns (bool) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        Court storage court = courts[dispute.courtID];\\n\\n        if (round.nbVotes < court.jurorsForCourtJump) {\\n            return false;\\n        }\\n\\n        // Jump if the parent court doesn't support the current DK.\\n        return !courts[court.parent].supportedDisputeKits[round.disputeKitID];\\n    }\\n\\n    function getDisputeKitsLength() external view returns (uint256) {\\n        return disputeKits.length;\\n    }\\n\\n    function convertEthToTokenAmount(IERC20 _toToken, uint256 _amountInEth) public view returns (uint256) {\\n        return (_amountInEth * 10 ** currencyRates[_toToken].rateDecimals) / currencyRates[_toToken].rateInEth;\\n    }\\n\\n    // ************************************* //\\n    // *            Internal               * //\\n    // ************************************* //\\n\\n    /// @dev Toggles the dispute kit support for a given court.\\n    /// @param _courtID The ID of the court to toggle the support for.\\n    /// @param _disputeKitID The ID of the dispute kit to toggle the support for.\\n    /// @param _enable Whether to enable or disable the support. Note that classic dispute kit should always be enabled.\\n    function _enableDisputeKit(uint96 _courtID, uint256 _disputeKitID, bool _enable) internal {\\n        courts[_courtID].supportedDisputeKits[_disputeKitID] = _enable;\\n        emit DisputeKitEnabled(_courtID, _disputeKitID, _enable);\\n    }\\n\\n    /// @dev If called only once then set _onError to Revert, otherwise set it to Return\\n    /// @param _account The account to set the stake for.\\n    /// @param _courtID The ID of the court to set the stake for.\\n    /// @param _newStake The new stake.\\n    /// @param _alreadyTransferred Whether the PNKs were already transferred to/from the staking contract.\\n    /// @param _onError Whether to revert or return false on error.\\n    /// @return Whether the stake was successfully set or not.\\n    function _setStake(\\n        address _account,\\n        uint96 _courtID,\\n        uint256 _newStake,\\n        bool _alreadyTransferred,\\n        OnError _onError\\n    ) internal returns (bool) {\\n        if (_courtID == FORKING_COURT || _courtID > courts.length) {\\n            _stakingFailed(_onError, StakingResult.CannotStakeInThisCourt); // Staking directly into the forking court is not allowed.\\n            return false;\\n        }\\n        if (_newStake != 0 && _newStake < courts[_courtID].minStake) {\\n            _stakingFailed(_onError, StakingResult.CannotStakeLessThanMinStake); // Staking less than the minimum stake is not allowed.\\n            return false;\\n        }\\n        (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult) = sortitionModule.setStake(\\n            _account,\\n            _courtID,\\n            _newStake,\\n            _alreadyTransferred\\n        );\\n        if (stakingResult != StakingResult.Successful) {\\n            _stakingFailed(_onError, stakingResult);\\n            return false;\\n        }\\n        if (pnkDeposit > 0) {\\n            if (!pinakion.safeTransferFrom(_account, address(this), pnkDeposit)) {\\n                _stakingFailed(_onError, StakingResult.StakingTransferFailed);\\n                return false;\\n            }\\n        }\\n        if (pnkWithdrawal > 0) {\\n            if (!pinakion.safeTransfer(_account, pnkWithdrawal)) {\\n                _stakingFailed(_onError, StakingResult.UnstakingTransferFailed);\\n                return false;\\n            }\\n        }\\n        return true;\\n    }\\n\\n    /// @dev It may revert depending on the _onError parameter.\\n    function _stakingFailed(OnError _onError, StakingResult _result) internal pure virtual {\\n        if (_onError == OnError.Return) return;\\n        if (_result == StakingResult.StakingTransferFailed) revert StakingTransferFailed();\\n        if (_result == StakingResult.UnstakingTransferFailed) revert UnstakingTransferFailed();\\n        if (_result == StakingResult.CannotStakeInMoreCourts) revert StakingInTooManyCourts();\\n        if (_result == StakingResult.CannotStakeInThisCourt) revert StakingNotPossibeInThisCourt();\\n        if (_result == StakingResult.CannotStakeLessThanMinStake) revert StakingLessThanCourtMinStake();\\n    }\\n\\n    /// @dev Gets a court ID, the minimum number of jurors and an ID of a dispute kit from a specified extra data bytes array.\\n    /// Note that if extradata contains an incorrect value then this value will be switched to default.\\n    /// @param _extraData The extra data bytes array. The first 32 bytes are the court ID, the next are the minimum number of jurors and the last are the dispute kit ID.\\n    /// @return courtID The court ID.\\n    /// @return minJurors The minimum number of jurors required.\\n    /// @return disputeKitID The ID of the dispute kit.\\n    function _extraDataToCourtIDMinJurorsDisputeKit(\\n        bytes memory _extraData\\n    ) internal view returns (uint96 courtID, uint256 minJurors, uint256 disputeKitID) {\\n        // Note that if the extradata doesn't contain 32 bytes for the dispute kit ID it'll return the default 0 index.\\n        if (_extraData.length >= 64) {\\n            assembly {\\n                // solium-disable-line security/no-inline-assembly\\n                courtID := mload(add(_extraData, 0x20))\\n                minJurors := mload(add(_extraData, 0x40))\\n                disputeKitID := mload(add(_extraData, 0x60))\\n            }\\n            if (courtID == FORKING_COURT || courtID >= courts.length) {\\n                courtID = GENERAL_COURT;\\n            }\\n            if (minJurors == 0) {\\n                minJurors = DEFAULT_NB_OF_JURORS;\\n            }\\n            if (disputeKitID == NULL_DISPUTE_KIT || disputeKitID >= disputeKits.length) {\\n                disputeKitID = DISPUTE_KIT_CLASSIC; // 0 index is not used.\\n            }\\n        } else {\\n            courtID = GENERAL_COURT;\\n            minJurors = DEFAULT_NB_OF_JURORS;\\n            disputeKitID = DISPUTE_KIT_CLASSIC;\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *              Errors               * //\\n    // ************************************* //\\n\\n    error GovernorOnly();\\n    error GuardianOrGovernorOnly();\\n    error DisputeKitOnly();\\n    error SortitionModuleOnly();\\n    error UnsuccessfulCall();\\n    error InvalidDisputKitParent();\\n    error DepthLevelMax();\\n    error MinStakeLowerThanParentCourt();\\n    error UnsupportedDisputeKit();\\n    error InvalidForkingCourtAsParent();\\n    error WrongDisputeKitIndex();\\n    error CannotDisableClassicDK();\\n    error ArraysLengthMismatch();\\n    error StakingInTooManyCourts();\\n    error StakingNotPossibeInThisCourt();\\n    error StakingLessThanCourtMinStake();\\n    error StakingTransferFailed();\\n    error UnstakingTransferFailed();\\n    error ArbitrationFeesNotEnough();\\n    error DisputeKitNotSupportedByCourt();\\n    error MustSupportDisputeKitClassic();\\n    error TokenNotAccepted();\\n    error EvidenceNotPassedAndNotAppeal();\\n    error DisputeStillDrawing();\\n    error CommitPeriodNotPassed();\\n    error VotePeriodNotPassed();\\n    error AppealPeriodNotPassed();\\n    error NotEvidencePeriod();\\n    error AppealFeesNotEnough();\\n    error DisputeNotAppealable();\\n    error NotExecutionPeriod();\\n    error RulingAlreadyExecuted();\\n    error DisputePeriodIsFinal();\\n    error TransferFailed();\\n    error WhenNotPausedOnly();\\n    error WhenPausedOnly();\\n}\\n\",\"keccak256\":\"0x7435f0d24fde25165d4de404cbd4040339be136bac507196bfed0bb1f9f493f4\",\"license\":\"MIT\"},\"src/arbitration/dispute-kits/DisputeKitClassic.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n/// @custom:authors: [@unknownunknown1, @jaybuidl]\\n/// @custom:reviewers: []\\n/// @custom:auditors: []\\n/// @custom:bounties: []\\n/// @custom:deployments: []\\n\\npragma solidity 0.8.24;\\n\\nimport \\\"../KlerosCore.sol\\\";\\nimport \\\"../interfaces/IDisputeKit.sol\\\";\\nimport \\\"../../proxy/UUPSProxiable.sol\\\";\\nimport \\\"../../proxy/Initializable.sol\\\";\\n\\n/// @title DisputeKitClassic\\n/// Dispute kit implementation of the Kleros v1 features including:\\n/// - a drawing system: proportional to staked PNK,\\n/// - a vote aggregation system: plurality,\\n/// - an incentive system: equal split between coherent votes,\\n/// - an appeal system: fund 2 choices only, vote on any choice.\\ncontract DisputeKitClassic is IDisputeKit, Initializable, UUPSProxiable {\\n    // ************************************* //\\n    // *             Structs               * //\\n    // ************************************* //\\n\\n    struct Dispute {\\n        Round[] rounds; // Rounds of the dispute. 0 is the default round, and [1, ..n] are the appeal rounds.\\n        uint256 numberOfChoices; // The number of choices jurors have when voting. This does not include choice `0` which is reserved for \\\"refuse to arbitrate\\\".\\n        bool jumped; // True if dispute jumped to a parent dispute kit and won't be handled by this DK anymore.\\n        mapping(uint256 => uint256) coreRoundIDToLocal; // Maps id of the round in the core contract to the index of the round of related local dispute.\\n        bytes extraData; // Extradata for the dispute.\\n    }\\n\\n    struct Round {\\n        Vote[] votes; // Former votes[_appeal][].\\n        uint256 winningChoice; // The choice with the most votes. Note that in the case of a tie, it is the choice that reached the tied number of votes first.\\n        mapping(uint256 => uint256) counts; // The sum of votes for each choice in the form `counts[choice]`.\\n        bool tied; // True if there is a tie, false otherwise.\\n        uint256 totalVoted; // Former uint[_appeal] votesInEachRound.\\n        uint256 totalCommitted; // Former commitsInRound.\\n        mapping(uint256 choiceId => uint256) paidFees; // Tracks the fees paid for each choice in this round.\\n        mapping(uint256 choiceId => bool) hasPaid; // True if this choice was fully funded, false otherwise.\\n        mapping(address account => mapping(uint256 choiceId => uint256)) contributions; // Maps contributors to their contributions for each choice.\\n        uint256 feeRewards; // Sum of reimbursable appeal fees available to the parties that made contributions to the ruling that ultimately wins a dispute.\\n        uint256[] fundedChoices; // Stores the choices that are fully funded.\\n        uint256 nbVotes; // Maximal number of votes this dispute can get.\\n    }\\n\\n    struct Vote {\\n        address account; // The address of the juror.\\n        bytes32 commit; // The commit of the juror. For courts with hidden votes.\\n        uint256 choice; // The choice of the juror.\\n        bool voted; // True if the vote has been cast.\\n    }\\n\\n    // ************************************* //\\n    // *             Storage               * //\\n    // ************************************* //\\n\\n    uint256 public constant WINNER_STAKE_MULTIPLIER = 10000; // Multiplier of the appeal cost that the winner has to pay as fee stake for a round in basis points. Default is 1x of appeal fee.\\n    uint256 public constant LOSER_STAKE_MULTIPLIER = 20000; // Multiplier of the appeal cost that the loser has to pay as fee stake for a round in basis points. Default is 2x of appeal fee.\\n    uint256 public constant LOSER_APPEAL_PERIOD_MULTIPLIER = 5000; // Multiplier of the appeal period for the choice that wasn't voted for in the previous round, in basis points. Default is 1/2 of original appeal period.\\n    uint256 public constant ONE_BASIS_POINT = 10000; // One basis point, for scaling.\\n\\n    address public governor; // The governor of the contract.\\n    KlerosCore public core; // The Kleros Core arbitrator\\n    Dispute[] public disputes; // Array of the locally created disputes.\\n    mapping(uint256 => uint256) public coreDisputeIDToLocal; // Maps the dispute ID in Kleros Core to the local dispute ID.\\n\\n    // ************************************* //\\n    // *              Events               * //\\n    // ************************************* //\\n\\n    /// @dev To be emitted when a dispute is created.\\n    /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _numberOfChoices The number of choices available in the dispute.\\n    /// @param _extraData The extra data for the dispute.\\n    event DisputeCreation(uint256 indexed _coreDisputeID, uint256 _numberOfChoices, bytes _extraData);\\n\\n    /// @dev To be emitted when a vote commitment is cast.\\n    /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _juror The address of the juror casting the vote commitment.\\n    /// @param _voteIDs The identifiers of the votes in the dispute.\\n    /// @param _commit The commitment of the juror.\\n    event CommitCast(uint256 indexed _coreDisputeID, address indexed _juror, uint256[] _voteIDs, bytes32 _commit);\\n\\n    /// @dev To be emitted when a funding contribution is made.\\n    /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _coreRoundID The identifier of the round in the Arbitrator contract.\\n    /// @param _choice The choice that is being funded.\\n    /// @param _contributor The address of the contributor.\\n    /// @param _amount The amount contributed.\\n    event Contribution(\\n        uint256 indexed _coreDisputeID,\\n        uint256 indexed _coreRoundID,\\n        uint256 _choice,\\n        address indexed _contributor,\\n        uint256 _amount\\n    );\\n\\n    /// @dev To be emitted when the contributed funds are withdrawn.\\n    /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _coreRoundID The identifier of the round in the Arbitrator contract.\\n    /// @param _choice The choice that is being funded.\\n    /// @param _contributor The address of the contributor.\\n    /// @param _amount The amount withdrawn.\\n    event Withdrawal(\\n        uint256 indexed _coreDisputeID,\\n        uint256 indexed _coreRoundID,\\n        uint256 _choice,\\n        address indexed _contributor,\\n        uint256 _amount\\n    );\\n\\n    /// @dev To be emitted when a choice is fully funded for an appeal.\\n    /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _coreRoundID The identifier of the round in the Arbitrator contract.\\n    /// @param _choice The choice that is being funded.\\n    event ChoiceFunded(uint256 indexed _coreDisputeID, uint256 indexed _coreRoundID, uint256 indexed _choice);\\n\\n    // ************************************* //\\n    // *              Modifiers            * //\\n    // ************************************* //\\n\\n    modifier onlyByGovernor() {\\n        require(governor == msg.sender, \\\"Access not allowed: Governor only.\\\");\\n        _;\\n    }\\n\\n    modifier onlyByCore() {\\n        require(address(core) == msg.sender, \\\"Access not allowed: KlerosCore only.\\\");\\n        _;\\n    }\\n\\n    modifier notJumped(uint256 _coreDisputeID) {\\n        require(!disputes[coreDisputeIDToLocal[_coreDisputeID]].jumped, \\\"Dispute jumped to a parent DK!\\\");\\n        _;\\n    }\\n\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    /// @dev Constructor, initializing the implementation to reduce attack surface.\\n    constructor() {\\n        _disableInitializers();\\n    }\\n\\n    /// @dev Initializer.\\n    /// @param _governor The governor's address.\\n    /// @param _core The KlerosCore arbitrator.\\n    function initialize(address _governor, KlerosCore _core) external reinitializer(1) {\\n        governor = _governor;\\n        core = _core;\\n    }\\n\\n    // ************************ //\\n    // *      Governance      * //\\n    // ************************ //\\n\\n    /// @dev Access Control to perform implementation upgrades (UUPS Proxiable)\\n    ///      Only the governor can perform upgrades (`onlyByGovernor`)\\n    function _authorizeUpgrade(address) internal view override onlyByGovernor {\\n        // NOP\\n    }\\n\\n    /// @dev Allows the governor to call anything on behalf of the contract.\\n    /// @param _destination The destination of the call.\\n    /// @param _amount The value sent with the call.\\n    /// @param _data The data sent with the call.\\n    function executeGovernorProposal(\\n        address _destination,\\n        uint256 _amount,\\n        bytes memory _data\\n    ) external onlyByGovernor {\\n        (bool success, ) = _destination.call{value: _amount}(_data);\\n        require(success, \\\"Unsuccessful call\\\");\\n    }\\n\\n    /// @dev Changes the `governor` storage variable.\\n    /// @param _governor The new value for the `governor` storage variable.\\n    function changeGovernor(address payable _governor) external onlyByGovernor {\\n        governor = _governor;\\n    }\\n\\n    /// @dev Changes the `core` storage variable.\\n    /// @param _core The new value for the `core` storage variable.\\n    function changeCore(address _core) external onlyByGovernor {\\n        core = KlerosCore(_core);\\n    }\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @dev Creates a local dispute and maps it to the dispute ID in the Core contract.\\n    /// Note: Access restricted to Kleros Core only.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core.\\n    /// @param _numberOfChoices Number of choices of the dispute\\n    /// @param _extraData Additional info about the dispute, for possible use in future dispute kits.\\n    /// @param _nbVotes Number of votes for this dispute.\\n    function createDispute(\\n        uint256 _coreDisputeID,\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData,\\n        uint256 _nbVotes\\n    ) external override onlyByCore {\\n        uint256 localDisputeID = disputes.length;\\n        Dispute storage dispute = disputes.push();\\n        dispute.numberOfChoices = _numberOfChoices;\\n        dispute.extraData = _extraData;\\n\\n        // New round in the Core should be created before the dispute creation in DK.\\n        dispute.coreRoundIDToLocal[core.getNumberOfRounds(_coreDisputeID) - 1] = dispute.rounds.length;\\n\\n        Round storage round = dispute.rounds.push();\\n        round.nbVotes = _nbVotes;\\n        round.tied = true;\\n\\n        coreDisputeIDToLocal[_coreDisputeID] = localDisputeID;\\n        emit DisputeCreation(_coreDisputeID, _numberOfChoices, _extraData);\\n    }\\n\\n    /// @dev Draws the juror from the sortition tree. The drawn address is picked up by Kleros Core.\\n    /// Note: Access restricted to Kleros Core only.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core.\\n    /// @param _nonce Nonce of the drawing iteration.\\n    /// @return drawnAddress The drawn address.\\n    function draw(\\n        uint256 _coreDisputeID,\\n        uint256 _nonce\\n    ) external override onlyByCore notJumped(_coreDisputeID) returns (address drawnAddress) {\\n        Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n\\n        ISortitionModule sortitionModule = core.sortitionModule();\\n        (uint96 courtID, , , , ) = core.disputes(_coreDisputeID);\\n        bytes32 key = bytes32(uint256(courtID)); // Get the ID of the tree.\\n\\n        // TODO: Handle the situation when no one has staked yet.\\n        drawnAddress = sortitionModule.draw(key, _coreDisputeID, _nonce);\\n\\n        if (_postDrawCheck(_coreDisputeID, drawnAddress)) {\\n            round.votes.push(Vote({account: drawnAddress, commit: bytes32(0), choice: 0, voted: false}));\\n        } else {\\n            drawnAddress = address(0);\\n        }\\n    }\\n\\n    /// @dev Sets the caller's commit for the specified votes. It can be called multiple times during the\\n    /// commit period, each call overrides the commits of the previous one.\\n    /// `O(n)` where\\n    /// `n` is the number of votes.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core.\\n    /// @param _voteIDs The IDs of the votes.\\n    /// @param _commit The commit. Note that justification string is a part of the commit.\\n    function castCommit(\\n        uint256 _coreDisputeID,\\n        uint256[] calldata _voteIDs,\\n        bytes32 _commit\\n    ) external notJumped(_coreDisputeID) {\\n        (, , KlerosCore.Period period, , ) = core.disputes(_coreDisputeID);\\n        require(period == KlerosCoreBase.Period.commit, \\\"The dispute should be in Commit period.\\\");\\n        require(_commit != bytes32(0), \\\"Empty commit.\\\");\\n\\n        Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        for (uint256 i = 0; i < _voteIDs.length; i++) {\\n            require(round.votes[_voteIDs[i]].account == msg.sender, \\\"The caller has to own the vote.\\\");\\n            round.votes[_voteIDs[i]].commit = _commit;\\n        }\\n        round.totalCommitted += _voteIDs.length;\\n        emit CommitCast(_coreDisputeID, msg.sender, _voteIDs, _commit);\\n    }\\n\\n    /// @dev Sets the caller's choices for the specified votes.\\n    /// `O(n)` where\\n    /// `n` is the number of votes.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core.\\n    /// @param _voteIDs The IDs of the votes.\\n    /// @param _choice The choice.\\n    /// @param _salt The salt for the commit if the votes were hidden.\\n    /// @param _justification Justification of the choice.\\n    function castVote(\\n        uint256 _coreDisputeID,\\n        uint256[] calldata _voteIDs,\\n        uint256 _choice,\\n        uint256 _salt,\\n        string memory _justification\\n    ) external notJumped(_coreDisputeID) {\\n        (, , KlerosCore.Period period, , ) = core.disputes(_coreDisputeID);\\n        require(period == KlerosCoreBase.Period.vote, \\\"The dispute should be in Vote period.\\\");\\n        require(_voteIDs.length > 0, \\\"No voteID provided\\\");\\n\\n        Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];\\n        require(_choice <= dispute.numberOfChoices, \\\"Choice out of bounds\\\");\\n\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        (uint96 courtID, , , , ) = core.disputes(_coreDisputeID);\\n        (, bool hiddenVotes, , , , , ) = core.courts(courtID);\\n\\n        //  Save the votes.\\n        for (uint256 i = 0; i < _voteIDs.length; i++) {\\n            require(round.votes[_voteIDs[i]].account == msg.sender, \\\"The caller has to own the vote.\\\");\\n            require(\\n                !hiddenVotes || round.votes[_voteIDs[i]].commit == keccak256(abi.encodePacked(_choice, _salt)),\\n                \\\"The commit must match the choice in courts with hidden votes.\\\"\\n            );\\n            require(!round.votes[_voteIDs[i]].voted, \\\"Vote already cast.\\\");\\n            round.votes[_voteIDs[i]].choice = _choice;\\n            round.votes[_voteIDs[i]].voted = true;\\n        }\\n\\n        round.totalVoted += _voteIDs.length;\\n\\n        round.counts[_choice] += _voteIDs.length;\\n        if (_choice == round.winningChoice) {\\n            if (round.tied) round.tied = false;\\n        } else {\\n            // Voted for another choice.\\n            if (round.counts[_choice] == round.counts[round.winningChoice]) {\\n                // Tie.\\n                if (!round.tied) round.tied = true;\\n            } else if (round.counts[_choice] > round.counts[round.winningChoice]) {\\n                // New winner.\\n                round.winningChoice = _choice;\\n                round.tied = false;\\n            }\\n        }\\n        emit VoteCast(_coreDisputeID, msg.sender, _voteIDs, _choice, _justification);\\n    }\\n\\n    /// @dev Manages contributions, and appeals a dispute if at least two choices are fully funded.\\n    /// Note that the surplus deposit will be reimbursed.\\n    /// @param _coreDisputeID Index of the dispute in Kleros Core.\\n    /// @param _choice A choice that receives funding.\\n    function fundAppeal(uint256 _coreDisputeID, uint256 _choice) external payable notJumped(_coreDisputeID) {\\n        Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];\\n        require(_choice <= dispute.numberOfChoices, \\\"There is no such ruling to fund.\\\");\\n\\n        (uint256 appealPeriodStart, uint256 appealPeriodEnd) = core.appealPeriod(_coreDisputeID);\\n        require(block.timestamp >= appealPeriodStart && block.timestamp < appealPeriodEnd, \\\"Appeal period is over.\\\");\\n\\n        uint256 multiplier;\\n        (uint256 ruling, , ) = this.currentRuling(_coreDisputeID);\\n        if (ruling == _choice) {\\n            multiplier = WINNER_STAKE_MULTIPLIER;\\n        } else {\\n            require(\\n                block.timestamp - appealPeriodStart <\\n                    ((appealPeriodEnd - appealPeriodStart) * LOSER_APPEAL_PERIOD_MULTIPLIER) / ONE_BASIS_POINT,\\n                \\\"Appeal period is over for loser\\\"\\n            );\\n            multiplier = LOSER_STAKE_MULTIPLIER;\\n        }\\n\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        uint256 coreRoundID = core.getNumberOfRounds(_coreDisputeID) - 1;\\n\\n        require(!round.hasPaid[_choice], \\\"Appeal fee is already paid.\\\");\\n        uint256 appealCost = core.appealCost(_coreDisputeID);\\n        uint256 totalCost = appealCost + (appealCost * multiplier) / ONE_BASIS_POINT;\\n\\n        // Take up to the amount necessary to fund the current round at the current costs.\\n        uint256 contribution;\\n        if (totalCost > round.paidFees[_choice]) {\\n            contribution = totalCost - round.paidFees[_choice] > msg.value // Overflows and underflows will be managed on the compiler level.\\n                ? msg.value\\n                : totalCost - round.paidFees[_choice];\\n            emit Contribution(_coreDisputeID, coreRoundID, _choice, msg.sender, contribution);\\n        }\\n\\n        round.contributions[msg.sender][_choice] += contribution;\\n        round.paidFees[_choice] += contribution;\\n        if (round.paidFees[_choice] >= totalCost) {\\n            round.feeRewards += round.paidFees[_choice];\\n            round.fundedChoices.push(_choice);\\n            round.hasPaid[_choice] = true;\\n            emit ChoiceFunded(_coreDisputeID, coreRoundID, _choice);\\n        }\\n\\n        if (round.fundedChoices.length > 1) {\\n            // At least two sides are fully funded.\\n            round.feeRewards = round.feeRewards - appealCost;\\n\\n            if (core.isDisputeKitJumping(_coreDisputeID)) {\\n                // Don't create a new round in case of a jump, and remove local dispute from the flow.\\n                dispute.jumped = true;\\n            } else {\\n                // Don't subtract 1 from length since both round arrays haven't been updated yet.\\n                dispute.coreRoundIDToLocal[coreRoundID + 1] = dispute.rounds.length;\\n\\n                Round storage newRound = dispute.rounds.push();\\n                newRound.nbVotes = core.getNumberOfVotes(_coreDisputeID);\\n                newRound.tied = true;\\n            }\\n            core.appeal{value: appealCost}(_coreDisputeID, dispute.numberOfChoices, dispute.extraData);\\n        }\\n\\n        if (msg.value > contribution) payable(msg.sender).send(msg.value - contribution);\\n    }\\n\\n    /// @dev Allows those contributors who attempted to fund an appeal round to withdraw any reimbursable fees or rewards after the dispute gets resolved.\\n    /// Note that withdrawals are not possible if the core contract is paused.\\n    /// @param _coreDisputeID Index of the dispute in Kleros Core contract.\\n    /// @param _beneficiary The address whose rewards to withdraw.\\n    /// @param _coreRoundID The round in the Kleros Core contract the caller wants to withdraw from.\\n    /// @param _choice The ruling option that the caller wants to withdraw from.\\n    /// @return amount The withdrawn amount.\\n    function withdrawFeesAndRewards(\\n        uint256 _coreDisputeID,\\n        address payable _beneficiary,\\n        uint256 _coreRoundID,\\n        uint256 _choice\\n    ) external returns (uint256 amount) {\\n        (, , , bool isRuled, ) = core.disputes(_coreDisputeID);\\n        require(isRuled, \\\"Dispute should be resolved.\\\");\\n        require(!core.paused(), \\\"Core is paused\\\");\\n\\n        Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];\\n        Round storage round = dispute.rounds[dispute.coreRoundIDToLocal[_coreRoundID]];\\n        (uint256 finalRuling, , ) = core.currentRuling(_coreDisputeID);\\n\\n        if (!round.hasPaid[_choice]) {\\n            // Allow to reimburse if funding was unsuccessful for this ruling option.\\n            amount = round.contributions[_beneficiary][_choice];\\n        } else {\\n            // Funding was successful for this ruling option.\\n            if (_choice == finalRuling) {\\n                // This ruling option is the ultimate winner.\\n                amount = round.paidFees[_choice] > 0\\n                    ? (round.contributions[_beneficiary][_choice] * round.feeRewards) / round.paidFees[_choice]\\n                    : 0;\\n            } else if (!round.hasPaid[finalRuling]) {\\n                // The ultimate winner was not funded in this round. In this case funded ruling option(s) are reimbursed.\\n                amount =\\n                    (round.contributions[_beneficiary][_choice] * round.feeRewards) /\\n                    (round.paidFees[round.fundedChoices[0]] + round.paidFees[round.fundedChoices[1]]);\\n            }\\n        }\\n        round.contributions[_beneficiary][_choice] = 0;\\n\\n        if (amount != 0) {\\n            _beneficiary.send(amount); // Deliberate use of send to prevent reverting fallback. It's the user's responsibility to accept ETH.\\n            emit Withdrawal(_coreDisputeID, _coreRoundID, _choice, _beneficiary, amount);\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    function getFundedChoices(uint256 _coreDisputeID) public view returns (uint256[] memory fundedChoices) {\\n        Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];\\n        Round storage lastRound = dispute.rounds[dispute.rounds.length - 1];\\n        return lastRound.fundedChoices;\\n    }\\n\\n    /// @dev Gets the current ruling of a specified dispute.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core.\\n    /// @return ruling The current ruling.\\n    /// @return tied Whether it's a tie or not.\\n    /// @return overridden Whether the ruling was overridden by appeal funding or not.\\n    function currentRuling(\\n        uint256 _coreDisputeID\\n    ) external view override returns (uint256 ruling, bool tied, bool overridden) {\\n        Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        tied = round.tied;\\n        ruling = tied ? 0 : round.winningChoice;\\n        (, , KlerosCore.Period period, , ) = core.disputes(_coreDisputeID);\\n        // Override the final ruling if only one side funded the appeals.\\n        if (period == KlerosCoreBase.Period.execution) {\\n            uint256[] memory fundedChoices = getFundedChoices(_coreDisputeID);\\n            if (fundedChoices.length == 1) {\\n                ruling = fundedChoices[0];\\n                tied = false;\\n                overridden = true;\\n            }\\n        }\\n    }\\n\\n    /// @dev Gets the degree of coherence of a particular voter. This function is called by Kleros Core in order to determine the amount of the reward.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.\\n    /// @param _voteID The ID of the vote.\\n    /// @return The degree of coherence in basis points.\\n    function getDegreeOfCoherence(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _voteID,\\n        uint256 /* _feePerJuror */,\\n        uint256 /* _pnkAtStakePerJuror */\\n    ) external view override returns (uint256) {\\n        // In this contract this degree can be either 0 or 1, but in other dispute kits this value can be something in between.\\n        Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];\\n        Vote storage vote = dispute.rounds[dispute.coreRoundIDToLocal[_coreRoundID]].votes[_voteID];\\n        (uint256 winningChoice, bool tied, ) = core.currentRuling(_coreDisputeID);\\n\\n        if (vote.voted && (vote.choice == winningChoice || tied)) {\\n            return ONE_BASIS_POINT;\\n        } else {\\n            return 0;\\n        }\\n    }\\n\\n    /// @dev Gets the number of jurors who are eligible to a reward in this round.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.\\n    /// @return The number of coherent jurors.\\n    function getCoherentCount(uint256 _coreDisputeID, uint256 _coreRoundID) external view override returns (uint256) {\\n        Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];\\n        Round storage currentRound = dispute.rounds[dispute.coreRoundIDToLocal[_coreRoundID]];\\n        (uint256 winningChoice, bool tied, ) = core.currentRuling(_coreDisputeID);\\n\\n        if (currentRound.totalVoted == 0 || (!tied && currentRound.counts[winningChoice] == 0)) {\\n            return 0;\\n        } else if (tied) {\\n            return currentRound.totalVoted;\\n        } else {\\n            return currentRound.counts[winningChoice];\\n        }\\n    }\\n\\n    /// @dev Returns true if all of the jurors have cast their commits for the last round.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core.\\n    /// @return Whether all of the jurors have cast their commits for the last round.\\n    function areCommitsAllCast(uint256 _coreDisputeID) external view override returns (bool) {\\n        Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        return round.totalCommitted == round.votes.length;\\n    }\\n\\n    /// @dev Returns true if all of the jurors have cast their votes for the last round.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core.\\n    /// @return Whether all of the jurors have cast their votes for the last round.\\n    function areVotesAllCast(uint256 _coreDisputeID) external view override returns (bool) {\\n        Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        return round.totalVoted == round.votes.length;\\n    }\\n\\n    /// @dev Returns true if the specified voter was active in this round.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.\\n    /// @param _voteID The ID of the voter.\\n    /// @return Whether the voter was active or not.\\n    function isVoteActive(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _voteID\\n    ) external view override returns (bool) {\\n        Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];\\n        Vote storage vote = dispute.rounds[dispute.coreRoundIDToLocal[_coreRoundID]].votes[_voteID];\\n        return vote.voted;\\n    }\\n\\n    function getRoundInfo(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _choice\\n    )\\n        external\\n        view\\n        override\\n        returns (\\n            uint256 winningChoice,\\n            bool tied,\\n            uint256 totalVoted,\\n            uint256 totalCommited,\\n            uint256 nbVoters,\\n            uint256 choiceCount\\n        )\\n    {\\n        Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];\\n        Round storage round = dispute.rounds[dispute.coreRoundIDToLocal[_coreRoundID]];\\n        return (\\n            round.winningChoice,\\n            round.tied,\\n            round.totalVoted,\\n            round.totalCommitted,\\n            round.votes.length,\\n            round.counts[_choice]\\n        );\\n    }\\n\\n    function getVoteInfo(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _voteID\\n    ) external view override returns (address account, bytes32 commit, uint256 choice, bool voted) {\\n        Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];\\n        Vote storage vote = dispute.rounds[dispute.coreRoundIDToLocal[_coreRoundID]].votes[_voteID];\\n        return (vote.account, vote.commit, vote.choice, vote.voted);\\n    }\\n\\n    // ************************************* //\\n    // *            Internal               * //\\n    // ************************************* //\\n\\n    /// @dev Checks that the chosen address satisfies certain conditions for being drawn.\\n    /// @param _coreDisputeID ID of the dispute in the core contract.\\n    /// @param _juror Chosen address.\\n    /// @return Whether the address can be drawn or not.\\n    function _postDrawCheck(uint256 _coreDisputeID, address _juror) internal view returns (bool) {\\n        (uint96 courtID, , , , ) = core.disputes(_coreDisputeID);\\n        uint256 lockedAmountPerJuror = core\\n            .getRoundInfo(_coreDisputeID, core.getNumberOfRounds(_coreDisputeID) - 1)\\n            .pnkAtStakePerJuror;\\n        (uint256 totalStaked, uint256 totalLocked, , ) = core.sortitionModule().getJurorBalance(_juror, courtID);\\n        return totalStaked >= totalLocked + lockedAmountPerJuror;\\n    }\\n}\\n\",\"keccak256\":\"0xde57a6569422626bf1ec215f3442ede6c13df57f6f5d27da3bc8cd8bc3d313cd\",\"license\":\"MIT\"},\"src/arbitration/interfaces/IArbitrableV2.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity 0.8.24;\\n\\nimport \\\"./IArbitratorV2.sol\\\";\\n\\n/// @title IArbitrableV2\\n/// @notice Arbitrable interface.\\n/// @dev When developing arbitrable contracts, we need to:\\n/// - Define the action taken when a ruling is received by the contract.\\n/// - Allow dispute creation. For this a function must call arbitrator.createDispute{value: _fee}(_choices,_extraData);\\ninterface IArbitrableV2 {\\n    /// @dev To be emitted when a dispute is created to link the correct meta-evidence to the disputeID.\\n    /// @param _arbitrator The arbitrator of the contract.\\n    /// @param _arbitratorDisputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _externalDisputeID An identifier created outside Kleros by the protocol requesting arbitration.\\n    /// @param _templateId The identifier of the dispute template. Should not be used with _templateUri.\\n    /// @param _templateUri The URI to the dispute template. For example on IPFS: starting with '/ipfs/'. Should not be used with _templateId.\\n    event DisputeRequest(\\n        IArbitratorV2 indexed _arbitrator,\\n        uint256 indexed _arbitratorDisputeID,\\n        uint256 _externalDisputeID,\\n        uint256 _templateId,\\n        string _templateUri\\n    );\\n\\n    /// @dev To be raised when a ruling is given.\\n    /// @param _arbitrator The arbitrator giving the ruling.\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _ruling The ruling which was given.\\n    event Ruling(IArbitratorV2 indexed _arbitrator, uint256 indexed _disputeID, uint256 _ruling);\\n\\n    /// @dev Give a ruling for a dispute.\\n    ///      Must be called by the arbitrator.\\n    ///      The purpose of this function is to ensure that the address calling it has the right to rule on the contract.\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _ruling Ruling given by the arbitrator.\\n    /// Note that 0 is reserved for \\\"Not able/wanting to make a decision\\\".\\n    function rule(uint256 _disputeID, uint256 _ruling) external;\\n}\\n\",\"keccak256\":\"0xe841a4fe8ec109ce17dde4457bf1583c8b499109b05887c53a49a3207fc6e80b\",\"license\":\"MIT\"},\"src/arbitration/interfaces/IArbitratorV2.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity 0.8.24;\\n\\nimport \\\"@openzeppelin/contracts/token/ERC20/IERC20.sol\\\";\\nimport \\\"./IArbitrableV2.sol\\\";\\n\\n/// @title Arbitrator\\n/// Arbitrator interface that implements the new arbitration standard.\\n/// Unlike the ERC-792 this standard is not concerned with appeals, so each arbitrator can implement an appeal system that suits it the most.\\n/// When developing arbitrator contracts we need to:\\n/// - Define the functions for dispute creation (createDispute). Don't forget to store the arbitrated contract and the disputeID (which should be unique, may nbDisputes).\\n/// - Define the functions for cost display (arbitrationCost).\\n/// - Allow giving rulings. For this a function must call arbitrable.rule(disputeID, ruling).\\ninterface IArbitratorV2 {\\n    /// @dev To be emitted when a dispute is created.\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _arbitrable The contract which created the dispute.\\n    event DisputeCreation(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);\\n\\n    /// @dev To be raised when a ruling is given.\\n    /// @param _arbitrable The arbitrable receiving the ruling.\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _ruling The ruling which was given.\\n    event Ruling(IArbitrableV2 indexed _arbitrable, uint256 indexed _disputeID, uint256 _ruling);\\n\\n    /// @dev To be emitted when an ERC20 token is added or removed as a method to pay fees.\\n    /// @param _token The ERC20 token.\\n    /// @param _accepted Whether the token is accepted or not.\\n    event AcceptedFeeToken(IERC20 indexed _token, bool indexed _accepted);\\n\\n    /// @dev To be emitted when the fee for a particular ERC20 token is updated.\\n    /// @param _feeToken The ERC20 token.\\n    /// @param _rateInEth The new rate of the fee token in ETH.\\n    /// @param _rateDecimals The new decimals of the fee token rate.\\n    event NewCurrencyRate(IERC20 indexed _feeToken, uint64 _rateInEth, uint8 _rateDecimals);\\n\\n    /// @dev Create a dispute and pay for the fees in the native currency, typically ETH.\\n    ///      Must be called by the arbitrable contract.\\n    ///      Must pay at least arbitrationCost(_extraData).\\n    /// @param _numberOfChoices The number of choices the arbitrator can choose from in this dispute.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @return disputeID The identifier of the dispute created.\\n    function createDispute(\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData\\n    ) external payable returns (uint256 disputeID);\\n\\n    /// @dev Create a dispute and pay for the fees in a supported ERC20 token.\\n    ///      Must be called by the arbitrable contract.\\n    ///      Must pay at least arbitrationCost(_extraData).\\n    /// @param _numberOfChoices The number of choices the arbitrator can choose from in this dispute.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @param _feeToken The ERC20 token used to pay fees.\\n    /// @param _feeAmount Amount of the ERC20 token used to pay fees.\\n    /// @return disputeID The identifier of the dispute created.\\n    function createDispute(\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData,\\n        IERC20 _feeToken,\\n        uint256 _feeAmount\\n    ) external returns (uint256 disputeID);\\n\\n    /// @dev Compute the cost of arbitration denominated in the native currency, typically ETH.\\n    ///      It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @return cost The arbitration cost in ETH.\\n    function arbitrationCost(bytes calldata _extraData) external view returns (uint256 cost);\\n\\n    /// @dev Compute the cost of arbitration denominated in `_feeToken`.\\n    ///      It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @param _feeToken The ERC20 token used to pay fees.\\n    /// @return cost The arbitration cost in `_feeToken`.\\n    function arbitrationCost(bytes calldata _extraData, IERC20 _feeToken) external view returns (uint256 cost);\\n\\n    /// @dev Gets the current ruling of a specified dispute.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return ruling The current ruling.\\n    /// @return tied Whether it's a tie or not.\\n    /// @return overridden Whether the ruling was overridden by appeal funding or not.\\n    function currentRuling(uint256 _disputeID) external view returns (uint256 ruling, bool tied, bool overridden);\\n}\\n\",\"keccak256\":\"0xa4dc6b958197adead238de4246cd04e7389c3dc1b9f968acd10985f8fc5b74cf\",\"license\":\"MIT\"},\"src/arbitration/interfaces/IDisputeKit.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n/// @custom:authors: [@unknownunknown1, @jaybuidl]\\n/// @custom:reviewers: []\\n/// @custom:auditors: []\\n/// @custom:bounties: []\\n/// @custom:deployments: []\\n\\npragma solidity 0.8.24;\\n\\nimport \\\"./IArbitratorV2.sol\\\";\\n\\n/// @title IDisputeKit\\n/// An abstraction of the Dispute Kits intended for interfacing with KlerosCore.\\n/// It does not intend to abstract the interactions with the user (such as voting or appeal funding) to allow for implementation-specific parameters.\\ninterface IDisputeKit {\\n    // ************************************ //\\n    // *             Events               * //\\n    // ************************************ //\\n\\n    /// @dev Emitted when casting a vote to provide the justification of juror's choice.\\n    /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _juror Address of the juror.\\n    /// @param _voteIDs The identifiers of the votes in the dispute.\\n    /// @param _choice The choice juror voted for.\\n    /// @param _justification Justification of the choice.\\n    event VoteCast(\\n        uint256 indexed _coreDisputeID,\\n        address indexed _juror,\\n        uint256[] _voteIDs,\\n        uint256 indexed _choice,\\n        string _justification\\n    );\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @dev Creates a local dispute and maps it to the dispute ID in the Core contract.\\n    /// Note: Access restricted to Kleros Core only.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _numberOfChoices Number of choices of the dispute\\n    /// @param _extraData Additional info about the dispute, for possible use in future dispute kits.\\n    function createDispute(\\n        uint256 _coreDisputeID,\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData,\\n        uint256 _nbVotes\\n    ) external;\\n\\n    /// @dev Draws the juror from the sortition tree. The drawn address is picked up by Kleros Core.\\n    /// Note: Access restricted to Kleros Core only.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _nonce Nonce.\\n    /// @return drawnAddress The drawn address.\\n    function draw(uint256 _coreDisputeID, uint256 _nonce) external returns (address drawnAddress);\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /// @dev Gets the current ruling of a specified dispute.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @return ruling The current ruling.\\n    /// @return tied Whether it's a tie or not.\\n    /// @return overridden Whether the ruling was overridden by appeal funding or not.\\n    function currentRuling(uint256 _coreDisputeID) external view returns (uint256 ruling, bool tied, bool overridden);\\n\\n    /// @dev Gets the degree of coherence of a particular voter. This function is called by Kleros Core in order to determine the amount of the reward.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.\\n    /// @param _voteID The ID of the vote.\\n    /// @param _feePerJuror The fee per juror.\\n    /// @param _pnkAtStakePerJuror The PNK at stake per juror.\\n    /// @return The degree of coherence in basis points.\\n    function getDegreeOfCoherence(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _voteID,\\n        uint256 _feePerJuror,\\n        uint256 _pnkAtStakePerJuror\\n    ) external view returns (uint256);\\n\\n    /// @dev Gets the number of jurors who are eligible to a reward in this round.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.\\n    /// @return The number of coherent jurors.\\n    function getCoherentCount(uint256 _coreDisputeID, uint256 _coreRoundID) external view returns (uint256);\\n\\n    /// @dev Returns true if all of the jurors have cast their commits for the last round.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @return Whether all of the jurors have cast their commits for the last round.\\n    function areCommitsAllCast(uint256 _coreDisputeID) external view returns (bool);\\n\\n    /// @dev Returns true if all of the jurors have cast their votes for the last round.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @return Whether all of the jurors have cast their votes for the last round.\\n    function areVotesAllCast(uint256 _coreDisputeID) external view returns (bool);\\n\\n    /// @dev Returns true if the specified voter was active in this round.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.\\n    /// @param _voteID The ID of the voter.\\n    /// @return Whether the voter was active or not.\\n    function isVoteActive(uint256 _coreDisputeID, uint256 _coreRoundID, uint256 _voteID) external view returns (bool);\\n\\n    function getRoundInfo(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _choice\\n    )\\n        external\\n        view\\n        returns (\\n            uint256 winningChoice,\\n            bool tied,\\n            uint256 totalVoted,\\n            uint256 totalCommited,\\n            uint256 nbVoters,\\n            uint256 choiceCount\\n        );\\n\\n    function getVoteInfo(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _voteID\\n    ) external view returns (address account, bytes32 commit, uint256 choice, bool voted);\\n}\\n\",\"keccak256\":\"0xb9590d05f9df08dd0ed027b2eb40c7b1885b7574a121b1b0b7da0920429bb4d5\",\"license\":\"MIT\"},\"src/arbitration/interfaces/ISortitionModule.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\npragma solidity 0.8.24;\\n\\nimport \\\"../../libraries/Constants.sol\\\";\\n\\ninterface ISortitionModule {\\n    enum Phase {\\n        staking, // Stake sum trees can be updated. Pass after `minStakingTime` passes and there is at least one dispute without jurors.\\n        generating, // Waiting for a random number. Pass as soon as it is ready.\\n        drawing // Jurors can be drawn. Pass after all disputes have jurors or `maxDrawingTime` passes.\\n    }\\n\\n    event NewPhase(Phase _phase);\\n\\n    function createTree(bytes32 _key, bytes memory _extraData) external;\\n\\n    function setStake(\\n        address _account,\\n        uint96 _courtID,\\n        uint256 _newStake,\\n        bool _alreadyTransferred\\n    ) external returns (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult);\\n\\n    function setJurorInactive(address _account) external;\\n\\n    function lockStake(address _account, uint256 _relativeAmount) external;\\n\\n    function unlockStake(address _account, uint256 _relativeAmount) external;\\n\\n    function penalizeStake(address _account, uint256 _relativeAmount) external;\\n\\n    function notifyRandomNumber(uint256 _drawnNumber) external;\\n\\n    function draw(bytes32 _court, uint256 _coreDisputeID, uint256 _nonce) external view returns (address);\\n\\n    function getJurorBalance(\\n        address _juror,\\n        uint96 _courtID\\n    ) external view returns (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts);\\n\\n    function getJurorCourtIDs(address _juror) external view returns (uint96[] memory);\\n\\n    function isJurorStaked(address _juror) external view returns (bool);\\n\\n    function createDisputeHook(uint256 _disputeID, uint256 _roundID) external;\\n\\n    function postDrawHook(uint256 _disputeID, uint256 _roundID) external;\\n}\\n\",\"keccak256\":\"0x18a4ff126bb51e7b5b0e3fbff7cf0dbbcfff7195ad79307e69cdbc9226e63502\",\"license\":\"MIT\"},\"src/libraries/Constants.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity 0.8.24;\\n\\nimport \\\"@openzeppelin/contracts/token/ERC20/IERC20.sol\\\";\\n\\n// Courts\\nuint96 constant FORKING_COURT = 0; // Index of the forking court.\\nuint96 constant GENERAL_COURT = 1; // Index of the default (general) court.\\n\\n// Dispute Kits\\nuint256 constant NULL_DISPUTE_KIT = 0; // Null pattern to indicate a top-level DK which has no parent.\\nuint256 constant DISPUTE_KIT_CLASSIC = 1; // Index of the default DK. 0 index is skipped.\\n\\n// Sortition Module\\nuint256 constant MAX_STAKE_PATHS = 4; // The maximum number of stake paths a juror can have.\\nuint256 constant DEFAULT_K = 6; // Default number of children per node.\\n\\n// Defaults\\nuint256 constant DEFAULT_NB_OF_JURORS = 3; // The default number of jurors in a dispute.\\nIERC20 constant NATIVE_CURRENCY = IERC20(address(0)); // The native currency, such as ETH on Arbitrum, Optimism and Ethereum L1.\\n\\nenum OnError {\\n    Revert,\\n    Return\\n}\\n\\nenum StakingResult {\\n    Successful,\\n    StakingTransferFailed,\\n    UnstakingTransferFailed,\\n    CannotStakeInMoreCourts,\\n    CannotStakeInThisCourt,\\n    CannotStakeLessThanMinStake,\\n    CannotStakeMoreThanMaxStakePerJuror,\\n    CannotStakeMoreThanMaxTotalStaked\\n}\\n\",\"keccak256\":\"0x486016fb74cc91439c2ec918e97a79190ab4eed223987d516986fff8eaeecfbf\",\"license\":\"MIT\"},\"src/libraries/SafeERC20.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n// Adapted from https://github.com/OpenZeppelin/openzeppelin-contracts/blob/a7a94c77463acea95d979aae1580fb0ddc3b6a1e/contracts/token/ERC20/utils/SafeERC20.sol\\n\\npragma solidity 0.8.24;\\n\\nimport \\\"@openzeppelin/contracts/token/ERC20/IERC20.sol\\\";\\n\\n/// @title SafeERC20\\n/// @dev Wrappers around ERC20 operations that throw on failure (when the token\\n/// contract returns false). Tokens that return no value (and instead revert or\\n/// throw on failure) are also supported, non-reverting calls are assumed to be\\n/// successful.\\n/// To use this library you can add a `using SafeERC20 for IERC20;` statement to your contract,\\n/// which allows you to call the safe operations as `token.safeTransfer(...)`, etc.\\nlibrary SafeERC20 {\\n    /// @dev Increases the allowance granted to `spender` by the caller.\\n    /// @param _token Token to transfer.\\n    /// @param _spender The address which will spend the funds.\\n    /// @param _addedValue The amount of tokens to increase the allowance by.\\n    function increaseAllowance(IERC20 _token, address _spender, uint256 _addedValue) internal returns (bool) {\\n        _token.approve(_spender, _token.allowance(address(this), _spender) + _addedValue);\\n        return true;\\n    }\\n\\n    /// @dev Calls transfer() without reverting.\\n    /// @param _token Token to transfer.\\n    /// @param _to Recepient address.\\n    /// @param _value Amount transferred.\\n    /// @return Whether transfer succeeded or not.\\n    function safeTransfer(IERC20 _token, address _to, uint256 _value) internal returns (bool) {\\n        (bool success, bytes memory data) = address(_token).call(abi.encodeCall(IERC20.transfer, (_to, _value)));\\n        return (success && (data.length == 0 || abi.decode(data, (bool))));\\n    }\\n\\n    /// @dev Calls transferFrom() without reverting.\\n    /// @param _token Token to transfer.\\n    /// @param _from Sender address.\\n    /// @param _to Recepient address.\\n    /// @param _value Amount transferred.\\n    /// @return Whether transfer succeeded or not.\\n    function safeTransferFrom(IERC20 _token, address _from, address _to, uint256 _value) internal returns (bool) {\\n        (bool success, bytes memory data) = address(_token).call(\\n            abi.encodeCall(IERC20.transferFrom, (_from, _to, _value))\\n        );\\n        return (success && (data.length == 0 || abi.decode(data, (bool))));\\n    }\\n}\\n\",\"keccak256\":\"0x3e39adb9cdd9f86b0defc8f6e1223533d86f82c804e186193f729c32c10161b1\",\"license\":\"MIT\"},\"src/proxy/Initializable.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v4.9.0) (proxy/utils/Initializable.sol) <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/utils/Initializable.sol>\\n\\npragma solidity 0.8.24;\\n\\n/**\\n * @dev This is a base contract to aid in writing upgradeable contracts, or any kind of contract that will be deployed\\n * behind a proxy. Since proxied contracts do not make use of a constructor, it's common to move constructor logic to an\\n * external initializer function, usually called `initialize`. It then becomes necessary to protect this initializer\\n * function so it can only be called once. The {initializer} modifier provided by this contract will have this effect.\\n *\\n * The initialization functions use a version number. Once a version number is used, it is consumed and cannot be\\n * reused. This mechanism prevents re-execution of each \\\"step\\\" but allows the creation of new initialization steps in\\n * case an upgrade adds a module that needs to be initialized.\\n *\\n * For example:\\n *\\n * ```solidity\\n * contract MyToken is ERC20Upgradeable {\\n *     function initialize() initializer public {\\n *         __ERC20_init(\\\"MyToken\\\", \\\"MTK\\\");\\n *     }\\n * }\\n *\\n * contract MyTokenV2 is MyToken, ERC20PermitUpgradeable {\\n *     function initializeV2() reinitializer(2) public {\\n *         __ERC20Permit_init(\\\"MyToken\\\");\\n *     }\\n * }\\n * ```\\n *\\n * TIP: To avoid leaving the proxy in an uninitialized state, the initializer function should be called as early as\\n * possible by providing the encoded function call as the `_data` argument to the proxy constructor\\n *\\n * CAUTION: When used with inheritance, manual care must be taken to not invoke a parent initializer twice, or to ensure\\n * that all initializers are idempotent. This is not verified automatically as constructors are by Solidity.\\n *\\n * [CAUTION]\\n * ====\\n * Avoid leaving a contract uninitialized.\\n *\\n * An uninitialized contract can be taken over by an attacker. This applies to both a proxy and its implementation\\n * contract, which may impact the proxy. To prevent the implementation contract from being used, you should invoke\\n * the {_disableInitializers} function in the constructor to automatically lock it when it is deployed:\\n *\\n * ```\\n * /// @custom:oz-upgrades-unsafe-allow constructor\\n * constructor() {\\n *     _disableInitializers();\\n * }\\n * ```\\n */\\nabstract contract Initializable {\\n    /**\\n     * @dev Storage of the initializable contract.\\n     *\\n     * It's implemented on a custom ERC-7201 namespace to reduce the risk of storage collisions\\n     * when using with upgradeable contracts.\\n     *\\n     * @custom:storage-location erc7201:openzeppelin.storage.Initializable\\n     */\\n    struct InitializableStorage {\\n        /**\\n         * @dev Indicates that the contract has been initialized.\\n         */\\n        uint64 _initialized;\\n        /**\\n         * @dev Indicates that the contract is in the process of being initialized.\\n         */\\n        bool _initializing;\\n    }\\n\\n    // keccak256(abi.encode(uint256(keccak256(\\\"openzeppelin.storage.Initializable\\\")) - 1))\\n    bytes32 private constant _INITIALIZABLE_STORAGE =\\n        0xf0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e;\\n\\n    /**\\n     * @dev The contract is already initialized.\\n     */\\n    error AlreadyInitialized();\\n\\n    /**\\n     * @dev The contract is not initializing.\\n     */\\n    error NotInitializing();\\n\\n    /**\\n     * @dev Triggered when the contract has been initialized or reinitialized.\\n     */\\n    event Initialized(uint64 version);\\n\\n    /**\\n     * @dev A modifier that defines a protected initializer function that can be invoked at most once. In its scope,\\n     * `onlyInitializing` functions can be used to initialize parent contracts.\\n     *\\n     * Similar to `reinitializer(1)`, except that functions marked with `initializer` can be nested in the context of a\\n     * constructor.\\n     *\\n     * Emits an {Initialized} event.\\n     */\\n    modifier initializer() {\\n        // solhint-disable-next-line var-name-mixedcase\\n        InitializableStorage storage $ = _getInitializableStorage();\\n\\n        bool isTopLevelCall = !$._initializing;\\n        uint64 initialized = $._initialized;\\n        if (!(isTopLevelCall && initialized < 1) && !(address(this).code.length == 0 && initialized == 1)) {\\n            revert AlreadyInitialized();\\n        }\\n        $._initialized = 1;\\n        if (isTopLevelCall) {\\n            $._initializing = true;\\n        }\\n        _;\\n        if (isTopLevelCall) {\\n            $._initializing = false;\\n            emit Initialized(1);\\n        }\\n    }\\n\\n    /**\\n     * @dev A modifier that defines a protected reinitializer function that can be invoked at most once, and only if the\\n     * contract hasn't been initialized to a greater version before. In its scope, `onlyInitializing` functions can be\\n     * used to initialize parent contracts.\\n     *\\n     * A reinitializer may be used after the original initialization step. This is essential to configure modules that\\n     * are added through upgrades and that require initialization.\\n     *\\n     * When `version` is 1, this modifier is similar to `initializer`, except that functions marked with `reinitializer`\\n     * cannot be nested. If one is invoked in the context of another, execution will revert.\\n     *\\n     * Note that versions can jump in increments greater than 1; this implies that if multiple reinitializers coexist in\\n     * a contract, executing them in the right order is up to the developer or operator.\\n     *\\n     * WARNING: setting the version to 255 will prevent any future reinitialization.\\n     *\\n     * Emits an {Initialized} event.\\n     */\\n    modifier reinitializer(uint64 version) {\\n        // solhint-disable-next-line var-name-mixedcase\\n        InitializableStorage storage $ = _getInitializableStorage();\\n\\n        if ($._initializing || $._initialized >= version) {\\n            revert AlreadyInitialized();\\n        }\\n        $._initialized = version;\\n        $._initializing = true;\\n        _;\\n        $._initializing = false;\\n        emit Initialized(version);\\n    }\\n\\n    /**\\n     * @dev Modifier to protect an initialization function so that it can only be invoked by functions with the\\n     * {initializer} and {reinitializer} modifiers, directly or indirectly.\\n     */\\n    modifier onlyInitializing() {\\n        _checkInitializing();\\n        _;\\n    }\\n\\n    /**\\n     * @dev Reverts if the contract is not in an initializing state. See {onlyInitializing}.\\n     */\\n    function _checkInitializing() internal view virtual {\\n        if (!_isInitializing()) {\\n            revert NotInitializing();\\n        }\\n    }\\n\\n    /**\\n     * @dev Locks the contract, preventing any future reinitialization. This cannot be part of an initializer call.\\n     * Calling this in the constructor of a contract will prevent that contract from being initialized or reinitialized\\n     * to any version. It is recommended to use this to lock implementation contracts that are designed to be called\\n     * through proxies.\\n     *\\n     * Emits an {Initialized} event the first time it is successfully executed.\\n     */\\n    function _disableInitializers() internal virtual {\\n        // solhint-disable-next-line var-name-mixedcase\\n        InitializableStorage storage $ = _getInitializableStorage();\\n\\n        if ($._initializing) {\\n            revert AlreadyInitialized();\\n        }\\n        if ($._initialized != type(uint64).max) {\\n            $._initialized = type(uint64).max;\\n            emit Initialized(type(uint64).max);\\n        }\\n    }\\n\\n    /**\\n     * @dev Returns the highest version that has been initialized. See {reinitializer}.\\n     */\\n    function _getInitializedVersion() internal view returns (uint64) {\\n        return _getInitializableStorage()._initialized;\\n    }\\n\\n    /**\\n     * @dev Returns `true` if the contract is currently initializing. See {onlyInitializing}.\\n     */\\n    function _isInitializing() internal view returns (bool) {\\n        return _getInitializableStorage()._initializing;\\n    }\\n\\n    /**\\n     * @dev Returns a pointer to the storage namespace.\\n     */\\n    // solhint-disable-next-line var-name-mixedcase\\n    function _getInitializableStorage() private pure returns (InitializableStorage storage $) {\\n        assembly {\\n            $.slot := _INITIALIZABLE_STORAGE\\n        }\\n    }\\n}\\n\",\"keccak256\":\"0x560ea64115636ecd6b3596248817125551c038ce1648019fde3cbe02d9759a30\",\"license\":\"MIT\"},\"src/proxy/UUPSProxiable.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n// Adapted from <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/utils/UUPSUpgradeable.sol>\\n\\n/**\\n *  @authors: [@malatrax]\\n *  @reviewers: []\\n *  @auditors: []\\n *  @bounties: []\\n *  @deployments: []\\n */\\npragma solidity 0.8.24;\\n\\n/**\\n * @title UUPS Proxiable\\n * @author Simon Malatrait <simon.malatrait@grenoble-inp.org>\\n * @dev This contract implements an upgradeability mechanism designed for UUPS proxies.\\n * The functions included here can perform an upgrade of an UUPS Proxy, when this contract is set as the implementation behind such a proxy.\\n *\\n * IMPORTANT: A UUPS proxy requires its upgradeability functions to be in the implementation as opposed to the transparent proxy.\\n * This means that if the proxy is upgraded to an implementation that does not support this interface, it will no longer be upgradeable.\\n *\\n * A security mechanism ensures that an upgrade does not turn off upgradeability accidentally, although this risk is\\n * reinstated if the upgrade retains upgradeability but removes the security mechanism, e.g. by replacing\\n * `UUPSProxiable` with a custom implementation of upgrades.\\n *\\n * The `_authorizeUpgrade` function must be overridden to include access restriction to the upgrade mechanism.\\n */\\nabstract contract UUPSProxiable {\\n    // ************************************* //\\n    // *             Event                 * //\\n    // ************************************* //\\n\\n    /**\\n     * Emitted when the `implementation` has been successfully upgraded.\\n     * @param newImplementation Address of the new implementation the proxy is now forwarding calls to.\\n     */\\n    event Upgraded(address indexed newImplementation);\\n\\n    // ************************************* //\\n    // *             Error                 * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev The call is from an unauthorized context.\\n     */\\n    error UUPSUnauthorizedCallContext();\\n\\n    /**\\n     * @dev The storage `slot` is unsupported as a UUID.\\n     */\\n    error UUPSUnsupportedProxiableUUID(bytes32 slot);\\n\\n    /// The `implementation` is not UUPS-compliant\\n    error InvalidImplementation(address implementation);\\n\\n    /// Failed Delegated call\\n    error FailedDelegateCall();\\n\\n    // ************************************* //\\n    // *             Storage               * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Storage slot with the address of the current implementation.\\n     * This is the keccak-256 hash of \\\"eip1967.proxy.implementation\\\" subtracted by 1, and is\\n     * validated in the constructor.\\n     * NOTE: bytes32(uint256(keccak256('eip1967.proxy.implementation')) - 1)\\n     */\\n    bytes32 private constant IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;\\n\\n    /**\\n     * @dev Storage variable of the proxiable contract address.\\n     * It is used to check whether or not the current call is from the proxy.\\n     */\\n    address private immutable __self = address(this);\\n\\n    // ************************************* //\\n    // *             Governance            * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Function that should revert when `msg.sender` is not authorized to upgrade the contract.\\n     * @dev Called by {upgradeToAndCall}.\\n     */\\n    function _authorizeUpgrade(address newImplementation) internal virtual;\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Upgrade mechanism including access control and UUPS-compliance.\\n     * @param newImplementation Address of the new implementation contract.\\n     * @param data Data used in a delegate call to `newImplementation` if non-empty. This will typically be an encoded\\n     * function call, and allows initializing the storage of the proxy like a Solidity constructor.\\n     *\\n     * @dev Reverts if the execution is not performed via delegatecall or the execution\\n     * context is not of a proxy with an ERC1967-compliant implementation pointing to self.\\n     */\\n    function upgradeToAndCall(address newImplementation, bytes memory data) public payable virtual {\\n        _authorizeUpgrade(newImplementation);\\n\\n        /* Check that the execution is being performed through a delegatecall call and that the execution context is\\n        a proxy contract with an implementation (as defined in ERC1967) pointing to self. */\\n        if (address(this) == __self || _getImplementation() != __self) {\\n            revert UUPSUnauthorizedCallContext();\\n        }\\n\\n        try UUPSProxiable(newImplementation).proxiableUUID() returns (bytes32 slot) {\\n            if (slot != IMPLEMENTATION_SLOT) {\\n                revert UUPSUnsupportedProxiableUUID(slot);\\n            }\\n            // Store the new implementation address to the implementation storage slot.\\n            assembly {\\n                sstore(IMPLEMENTATION_SLOT, newImplementation)\\n            }\\n            emit Upgraded(newImplementation);\\n\\n            if (data.length != 0) {\\n                // The return data is not checked (checking, in case of success, that the newImplementation code is non-empty if the return data is empty) because the authorized callee is trusted.\\n                (bool success, ) = newImplementation.delegatecall(data);\\n                if (!success) {\\n                    revert FailedDelegateCall();\\n                }\\n            }\\n        } catch {\\n            revert InvalidImplementation(newImplementation);\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Implementation of the ERC1822 `proxiableUUID` function. This returns the storage slot used by the\\n     * implementation. It is used to validate the implementation's compatibility when performing an upgrade.\\n     *\\n     * IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks\\n     * bricking a proxy that upgrades to it, by delegating to itself until out of gas. Thus it is critical that this\\n     * function revert if invoked through a proxy. This is guaranteed by the if statement.\\n     */\\n    function proxiableUUID() external view virtual returns (bytes32) {\\n        if (address(this) != __self) {\\n            // Must not be called through delegatecall\\n            revert UUPSUnauthorizedCallContext();\\n        }\\n        return IMPLEMENTATION_SLOT;\\n    }\\n\\n    // ************************************* //\\n    // *           Internal Views          * //\\n    // ************************************* //\\n\\n    function _getImplementation() internal view returns (address implementation) {\\n        assembly {\\n            implementation := sload(IMPLEMENTATION_SLOT)\\n        }\\n    }\\n}\\n\",\"keccak256\":\"0x5956855046cdda7aa45f44e379ef45323af7266c44c817d1266d8b32d52b0e22\",\"license\":\"MIT\"}},\"version\":1}",
-  "bytecode": "0x60a0604052306080523480156200001557600080fd5b506200002062000026565b620000d9565b7ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e805468010000000000000000900460ff1615620000765760405162dc149f60e41b815260040160405180910390fd5b80546001600160401b0390811614620000d65780546001600160401b0319166001600160401b0390811782556040519081527fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d29060200160405180910390a15b50565b608051613ec76200010360003960008181611588015281816115b101526117a90152613ec76000f3fe6080604052600436106101825760003560e01c80636d4cd8ea116100d7578063b6ede54011610085578063b6ede540146104ca578063ba66fde7146104ea578063be4676041461050a578063d2b8035a14610520578063da3beb8c14610540578063e349ad3014610412578063e4c0aaf414610560578063f2f4eb261461058057600080fd5b80636d4cd8ea146103d2578063751accd0146103f2578063796490f9146104125780637c04034e146104285780638e42646014610448578063a7cc08fe14610468578063b34bfaa8146104b457600080fd5b80634f1ef286116101345780634f1ef286146102c157806352d1902d146102d4578063564a565d146102e95780635c92e2f61461031857806365540b9614610338578063675926f61461036557806369f3f0411461038557600080fd5b80630baa64d1146101875780630c340a24146101bc5780631200aabc146101f45780631c3db16d1461022f578063362c34791461026c578063485cc9551461028c5780634b2f0ea0146102ae575b600080fd5b34801561019357600080fd5b506101a76101a2366004613174565b6105a0565b60405190151581526020015b60405180910390f35b3480156101c857600080fd5b506000546101dc906001600160a01b031681565b6040516001600160a01b0390911681526020016101b3565b34801561020057600080fd5b5061022161020f366004613174565b60036020526000908152604090205481565b6040519081526020016101b3565b34801561023b57600080fd5b5061024f61024a366004613174565b610617565b6040805193845291151560208401521515908201526060016101b3565b34801561027857600080fd5b506102216102873660046131a2565b610785565b34801561029857600080fd5b506102ac6102a73660046131df565b610c10565b005b6102ac6102bc366004613218565b610d0d565b6102ac6102cf366004613327565b611574565b3480156102e057600080fd5b5061022161179c565b3480156102f557600080fd5b50610309610304366004613174565b6117fa565b6040516101b3939291906133c6565b34801561032457600080fd5b506102ac610333366004613432565b6118c0565b34801561034457600080fd5b50610358610353366004613174565b611bc5565b6040516101b39190613484565b34801561037157600080fd5b506102216103803660046134c8565b611c89565b34801561039157600080fd5b506103a56103a0366004613503565b611dce565b604080519687529415156020870152938501929092526060840152608083015260a082015260c0016101b3565b3480156103de57600080fd5b506101a76103ed366004613174565b611e86565b3480156103fe57600080fd5b506102ac61040d36600461352f565b611efd565b34801561041e57600080fd5b5061022161271081565b34801561043457600080fd5b506102ac610443366004613587565b611fc9565b34801561045457600080fd5b506102ac61046336600461361f565b61269a565b34801561047457600080fd5b50610488610483366004613503565b6126e6565b604080516001600160a01b039095168552602085019390935291830152151560608201526080016101b3565b3480156104c057600080fd5b50610221614e2081565b3480156104d657600080fd5b506102ac6104e536600461363c565b6127ac565b3480156104f657600080fd5b506101a7610505366004613503565b612981565b34801561051657600080fd5b5061022161138881565b34801561052c57600080fd5b506101dc61053b366004613218565b612a1c565b34801561054c57600080fd5b5061022161055b366004613218565b612d25565b34801561056c57600080fd5b506102ac61057b36600461361f565b612e78565b34801561058c57600080fd5b506001546101dc906001600160a01b031681565b6000818152600360205260408120546002805483929081106105c4576105c46136c3565b600091825260208220600590910201805490925082906105e6906001906136ef565b815481106105f6576105f66136c3565b60009182526020909120600c90910201805460059091015414949350505050565b6000806000806002600360008781526020019081526020016000205481548110610643576106436136c3565b60009182526020822060059091020180549092508290610665906001906136ef565b81548110610675576106756136c3565b60009182526020909120600c90910201600381015460ff1694509050836106a05780600101546106a3565b60005b60015460405163564a565d60e01b8152600481018990529196506000916001600160a01b039091169063564a565d9060240160a060405180830381865afa1580156106f2573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190610716919061372e565b5090935060049250610726915050565b81600481111561073857610738613795565b0361077b57600061074888611bc5565b905080516001036107795780600081518110610766576107666136c3565b6020026020010151965060009550600194505b505b5050509193909250565b60015460405163564a565d60e01b81526004810186905260009182916001600160a01b039091169063564a565d9060240160a060405180830381865afa1580156107d3573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906107f7919061372e565b5093505050508061084f5760405162461bcd60e51b815260206004820152601b60248201527f446973707574652073686f756c64206265207265736f6c7665642e000000000060448201526064015b60405180910390fd5b600160009054906101000a90046001600160a01b03166001600160a01b0316635c975abb6040518163ffffffff1660e01b8152600401602060405180830381865afa1580156108a2573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906108c691906137ab565b156109045760405162461bcd60e51b815260206004820152600e60248201526d10dbdc99481a5cc81c185d5cd95960921b6044820152606401610846565b600086815260036020526040812054600280549091908110610928576109286136c3565b6000918252602080832088845260036005909302019182019052604082205481549193508391811061095c5761095c6136c3565b600091825260208220600154604051631c3db16d60e01b8152600481018d9052600c9390930290910193506001600160a01b031690631c3db16d90602401606060405180830381865afa1580156109b7573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906109db91906137c6565b5050600087815260078401602052604090205490915060ff16610a25576001600160a01b038816600090815260088301602090815260408083208984529091529020549450610b6a565b808603610a9a576000868152600683016020526040902054610a48576000610a93565b600086815260068301602090815260408083205460098601546001600160a01b038d1685526008870184528285208b8652909352922054610a899190613802565b610a939190613819565b9450610b6a565b600081815260078301602052604090205460ff16610b6a5781600601600083600a01600181548110610ace57610ace6136c3565b906000526020600020015481526020019081526020016000205482600601600084600a01600081548110610b0457610b046136c3565b9060005260206000200154815260200190815260200160002054610b28919061383b565b60098301546001600160a01b038a16600090815260088501602090815260408083208b8452909152902054610b5d9190613802565b610b679190613819565b94505b6001600160a01b038816600090815260088301602090815260408083208984529091528120558415610c04576040516001600160a01b0389169086156108fc029087906000818181858888f15050604080518a8152602081018a90526001600160a01b038d1694508b93508d92507f54b3cab3cb5c4aca3209db1151caff092e878011202e43a36782d4ebe0b963ae910160405180910390a45b50505050949350505050565b7ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e805460019190600160401b900460ff1680610c59575080546001600160401b03808416911610155b15610c765760405162dc149f60e41b815260040160405180910390fd5b805468ffffffffffffffffff19166001600160401b038316908117600160401b178255600080546001600160a01b038781166001600160a01b0319928316179092556001805492871692909116919091179055815460ff60401b191682556040519081527fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d29060200160405180910390a150505050565b600082815260036020526040902054600280548492908110610d3157610d316136c3565b600091825260209091206002600590920201015460ff1615610d655760405162461bcd60e51b81526004016108469061384e565b600083815260036020526040812054600280549091908110610d8957610d896136c3565b906000526020600020906005020190508060010154831115610ded5760405162461bcd60e51b815260206004820181905260248201527f5468657265206973206e6f20737563682072756c696e6720746f2066756e642e6044820152606401610846565b60015460405163afe15cfb60e01b81526004810186905260009182916001600160a01b039091169063afe15cfb906024016040805180830381865afa158015610e3a573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190610e5e9190613885565b91509150814210158015610e7157508042105b610eb65760405162461bcd60e51b815260206004820152601660248201527520b83832b0b6103832b934b7b21034b99037bb32b91760511b6044820152606401610846565b604051631c3db16d60e01b81526004810187905260009081903090631c3db16d90602401606060405180830381865afa158015610ef7573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190610f1b91906137c6565b50509050868103610f30576127109150610fb1565b612710611388610f4086866136ef565b610f4a9190613802565b610f549190613819565b610f5e85426136ef565b10610fab5760405162461bcd60e51b815260206004820152601f60248201527f41707065616c20706572696f64206973206f76657220666f72206c6f736572006044820152606401610846565b614e2091505b84546000908690610fc4906001906136ef565b81548110610fd457610fd46136c3565b60009182526020822060018054604051637e37c78b60e11b8152600481018f9052600c949094029092019450916001600160a01b039091169063fc6f8f1690602401602060405180830381865afa158015611033573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061105791906138a9565b61106191906136ef565b60008a815260078401602052604090205490915060ff16156110c55760405162461bcd60e51b815260206004820152601b60248201527f41707065616c2066656520697320616c726561647920706169642e00000000006044820152606401610846565b600154604051632cf6413f60e11b8152600481018c90526000916001600160a01b0316906359ec827e90602401602060405180830381865afa15801561110f573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061113391906138a9565b905060006127106111448784613802565b61114e9190613819565b611158908361383b565b60008c8152600686016020526040812054919250908211156112095760008c8152600686016020526040902054349061119190846136ef565b116111b65760008c81526006860160205260409020546111b190836136ef565b6111b8565b345b9050336001600160a01b0316848e7fcae597f39a3ad75c2e10d46b031f023c5c2babcd58ca0491b122acda3968d4c08f85604051611200929190918252602082015260400190565b60405180910390a45b33600090815260088601602090815260408083208f84529091528120805483929061123590849061383b565b909155505060008c81526006860160205260408120805483929061125a90849061383b565b909155505060008c8152600686016020526040902054821161132c5760008c81526006860160205260408120546009870180549192909161129c90849061383b565b9250508190555084600a018c908060018154018082558091505060019003906000526020600020016000909190919091505560018560070160008e815260200190815260200160002060006101000a81548160ff0219169083151502179055508b848e7fed764996238e4c1c873ae3af7ae2f00f1f6f4f10b9ac7d4bbea4a764c5dea00960405160405180910390a45b600a850154600110156115375782856009015461134991906136ef565b60098601556001546040516319b8152960e01b8152600481018f90526001600160a01b03909116906319b8152990602401602060405180830381865afa158015611397573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906113bb91906137ab565b156113d45760028a01805460ff191660011790556114b7565b895460038b0160006113e787600161383b565b81526020019081526020016000208190555060008a6000016001816001815401808255809150500390600052602060002090600c02019050600160009054906101000a90046001600160a01b03166001600160a01b031663c71f42538f6040518263ffffffff1660e01b815260040161146291815260200190565b602060405180830381865afa15801561147f573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906114a391906138a9565b600b820155600301805460ff191660011790555b600160009054906101000a90046001600160a01b03166001600160a01b031663c3569902848f8d600101548e6004016040518563ffffffff1660e01b8152600401611504939291906138fc565b6000604051808303818588803b15801561151d57600080fd5b505af1158015611531573d6000803e3d6000fd5b50505050505b8034111561156557336108fc61154d83346136ef565b6040518115909202916000818181858888f150505050505b50505050505050505050505050565b61157d82612ec4565b306001600160a01b037f00000000000000000000000000000000000000000000000000000000000000001614806115fb57507f00000000000000000000000000000000000000000000000000000000000000006001600160a01b03166115ef600080516020613e728339815191525490565b6001600160a01b031614155b156116195760405163703e46dd60e11b815260040160405180910390fd5b816001600160a01b03166352d1902d6040518163ffffffff1660e01b8152600401602060405180830381865afa925050508015611673575060408051601f3d908101601f19168201909252611670918101906138a9565b60015b61169b57604051630c76093760e01b81526001600160a01b0383166004820152602401610846565b600080516020613e7283398151915281146116cc57604051632a87526960e21b815260048101829052602401610846565b600080516020613e728339815191528390556040516001600160a01b038416907fbc7cd75a20ee27fd9adebab32041f755214dbc6bffa90cc0225b39da2e5c2d3b90600090a2815115611797576000836001600160a01b031683604051611733919061399b565b600060405180830381855af49150503d806000811461176e576040519150601f19603f3d011682016040523d82523d6000602084013e611773565b606091505b5050905080611795576040516339b21b5d60e11b815260040160405180910390fd5b505b505050565b6000306001600160a01b037f000000000000000000000000000000000000000000000000000000000000000016146117e75760405163703e46dd60e11b815260040160405180910390fd5b50600080516020613e7283398151915290565b6002818154811061180a57600080fd5b600091825260209091206005909102016001810154600282015460048301805492945060ff909116929161183d906138c2565b80601f0160208091040260200160405190810160405280929190818152602001828054611869906138c2565b80156118b65780601f1061188b576101008083540402835291602001916118b6565b820191906000526020600020905b81548152906001019060200180831161189957829003601f168201915b5050505050905083565b6000848152600360205260409020546002805486929081106118e4576118e46136c3565b600091825260209091206002600590920201015460ff16156119185760405162461bcd60e51b81526004016108469061384e565b60015460405163564a565d60e01b8152600481018790526000916001600160a01b03169063564a565d9060240160a060405180830381865afa158015611962573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190611986919061372e565b5090935060019250611996915050565b8160048111156119a8576119a8613795565b14611a055760405162461bcd60e51b815260206004820152602760248201527f54686520646973707574652073686f756c6420626520696e20436f6d6d6974206044820152663832b934b7b21760c91b6064820152608401610846565b82611a425760405162461bcd60e51b815260206004820152600d60248201526c22b6b83a3c9031b7b6b6b4ba1760991b6044820152606401610846565b600086815260036020526040812054600280549091908110611a6657611a666136c3565b60009182526020822060059091020180549092508290611a88906001906136ef565b81548110611a9857611a986136c3565b90600052602060002090600c0201905060005b86811015611b5e573382898984818110611ac757611ac76136c3565b9050602002013581548110611ade57611ade6136c3565b60009182526020909120600490910201546001600160a01b031614611b155760405162461bcd60e51b8152600401610846906139b7565b8582898984818110611b2957611b296136c3565b9050602002013581548110611b4057611b406136c3565b60009182526020909120600160049092020181019190915501611aab565b5086869050816005016000828254611b76919061383b565b9091555050604051339089907f05cc2f1c94966f1c961b410a50f3d3ffb64501346753a258177097ea23707f0890611bb3908b908b908b90613a20565b60405180910390a35050505050505050565b6000818152600360205260408120546002805460609392908110611beb57611beb6136c3565b60009182526020822060059091020180549092508290611c0d906001906136ef565b81548110611c1d57611c1d6136c3565b90600052602060002090600c0201905080600a01805480602002602001604051908101604052809291908181526020018280548015611c7b57602002820191906000526020600020905b815481526020019060010190808311611c67575b505050505092505050919050565b600085815260036020526040812054600280548392908110611cad57611cad6136c3565b60009182526020808320898452600360059093020191820190526040822054815491935083918110611ce157611ce16136c3565b90600052602060002090600c02016000018681548110611d0357611d036136c3565b600091825260208220600154604051631c3db16d60e01b815260048082018e905293909302909101935082916001600160a01b0390911690631c3db16d90602401606060405180830381865afa158015611d61573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190611d8591906137c6565b506003850154919350915060ff168015611da957508183600201541480611da95750805b15611dbc57612710945050505050611dc5565b60009450505050505b95945050505050565b60008060008060008060006002600360008c81526020019081526020016000205481548110611dff57611dff6136c3565b600091825260208083208c8452600360059093020191820190526040822054815491935083918110611e3357611e336136c3565b600091825260208083206001600c909302019182015460038301546004840154600585015485549f87526002909501909352604090942054909f60ff9094169e50909c50909a9950975095505050505050565b600081815260036020526040812054600280548392908110611eaa57611eaa6136c3565b60009182526020822060059091020180549092508290611ecc906001906136ef565b81548110611edc57611edc6136c3565b60009182526020909120600c90910201805460049091015414949350505050565b6000546001600160a01b03163314611f275760405162461bcd60e51b815260040161084690613a44565b6000836001600160a01b03168383604051611f42919061399b565b60006040518083038185875af1925050503d8060008114611f7f576040519150601f19603f3d011682016040523d82523d6000602084013e611f84565b606091505b50509050806117955760405162461bcd60e51b8152602060048201526011602482015270155b9cdd58d8d95cdcd99d5b0818d85b1b607a1b6044820152606401610846565b600086815260036020526040902054600280548892908110611fed57611fed6136c3565b600091825260209091206002600590920201015460ff16156120215760405162461bcd60e51b81526004016108469061384e565b60015460405163564a565d60e01b8152600481018990526000916001600160a01b03169063564a565d9060240160a060405180830381865afa15801561206b573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061208f919061372e565b509093506002925061209f915050565b8160048111156120b1576120b1613795565b1461210c5760405162461bcd60e51b815260206004820152602560248201527f54686520646973707574652073686f756c6420626520696e20566f74652070656044820152643934b7b21760d91b6064820152608401610846565b8561214e5760405162461bcd60e51b8152602060048201526012602482015271139bc81d9bdd195251081c1c9bdd9a59195960721b6044820152606401610846565b600088815260036020526040812054600280549091908110612172576121726136c3565b9060005260206000209060050201905080600101548611156121cd5760405162461bcd60e51b815260206004820152601460248201527343686f696365206f7574206f6620626f756e647360601b6044820152606401610846565b805460009082906121e0906001906136ef565b815481106121f0576121f06136c3565b60009182526020822060015460405163564a565d60e01b8152600481018f9052600c9390930290910193506001600160a01b03169063564a565d9060240160a060405180830381865afa15801561224b573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061226f919061372e565b5050600154604051630fad06e960e11b81526001600160601b03851660048201529394506000936001600160a01b039091169250631f5a0dd2915060240160e060405180830381865afa1580156122ca573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906122ee9190613a86565b505050505091505060005b8a8110156125605733848d8d84818110612315576123156136c3565b905060200201358154811061232c5761232c6136c3565b60009182526020909120600490910201546001600160a01b0316146123635760405162461bcd60e51b8152600401610846906139b7565b8115806123d6575060408051602081018c90529081018a905260600160405160208183030381529060405280519060200120846000018d8d848181106123ab576123ab6136c3565b90506020020135815481106123c2576123c26136c3565b906000526020600020906004020160010154145b6124485760405162461bcd60e51b815260206004820152603d60248201527f54686520636f6d6d6974206d757374206d61746368207468652063686f69636560448201527f20696e20636f7572747320776974682068696464656e20766f7465732e0000006064820152608401610846565b838c8c8381811061245b5761245b6136c3565b9050602002013581548110612472576124726136c3565b600091825260209091206003600490920201015460ff16156124cb5760405162461bcd60e51b81526020600482015260126024820152712b37ba329030b63932b0b23c9031b0b9ba1760711b6044820152606401610846565b89848d8d848181106124df576124df6136c3565b90506020020135815481106124f6576124f66136c3565b60009182526020909120600260049092020101556001848d8d8481811061251f5761251f6136c3565b9050602002013581548110612536576125366136c3565b60009182526020909120600490910201600301805460ff19169115159190911790556001016122f9565b508a8a9050836004016000828254612578919061383b565b90915550506000898152600284016020526040812080548c929061259d90849061383b565b9091555050600183015489036125cc57600383015460ff16156125c75760038301805460ff191690555b612645565b60018301546000908152600284016020526040808220548b83529120540361260e57600383015460ff166125c75760038301805460ff19166001179055612645565b60018301546000908152600284016020526040808220548b83529120541115612645576001830189905560038301805460ff191690555b88336001600160a01b03168d7fa000893c71384499023d2d7b21234f7b9e80c78e0330f357dcd667ff578bd3a48e8e8c60405161268493929190613af0565b60405180910390a4505050505050505050505050565b6000546001600160a01b031633146126c45760405162461bcd60e51b815260040161084690613a44565b600180546001600160a01b0319166001600160a01b0392909216919091179055565b60008060008060006002600360008a81526020019081526020016000205481548110612714576127146136c3565b600091825260208083208a8452600360059093020191820190526040822054815491935083918110612748576127486136c3565b90600052602060002090600c0201600001878154811061276a5761276a6136c3565b600091825260209091206004909102018054600182015460028301546003909301546001600160a01b039092169c909b5091995060ff16975095505050505050565b6001546001600160a01b031633146127d65760405162461bcd60e51b815260040161084690613b20565b60028054600181018255600091909152600581027f405787fa12a823e0f2b7631cc41b3ba8828b3321ca811111fa75cd3aa3bb5acf81018690557f405787fa12a823e0f2b7631cc41b3ba8828b3321ca811111fa75cd3aa3bb5ace8101907f405787fa12a823e0f2b7631cc41b3ba8828b3321ca811111fa75cd3aa3bb5ad201612861858783613bb4565b50805460018054604051637e37c78b60e11b8152600481018b9052600385019260009290916001600160a01b039091169063fc6f8f1690602401602060405180830381865afa1580156128b8573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906128dc91906138a9565b6128e691906136ef565b81526020808201929092526040908101600090812093909355835460018181018655858552838520600b600c909302019182018890556003808301805460ff19169092179091558b855290925291829020849055905188907fd3106f74c2d30a4b9230e756a3e78bde53865d40f6af4c479bb010ebaab581089061296f908a908a908a90613c74565b60405180910390a25050505050505050565b6000838152600360205260408120546002805483929081106129a5576129a56136c3565b600091825260208083208784526003600590930201918201905260408220548154919350839181106129d9576129d96136c3565b90600052602060002090600c020160000184815481106129fb576129fb6136c3565b600091825260209091206004909102016003015460ff169695505050505050565b6001546000906001600160a01b03163314612a495760405162461bcd60e51b815260040161084690613b20565b600083815260036020526040902054600280548592908110612a6d57612a6d6136c3565b600091825260209091206002600590920201015460ff1615612aa15760405162461bcd60e51b81526004016108469061384e565b600084815260036020526040812054600280549091908110612ac557612ac56136c3565b60009182526020822060059091020180549092508290612ae7906001906136ef565b81548110612af757612af76136c3565b90600052602060002090600c020190506000600160009054906101000a90046001600160a01b03166001600160a01b0316632e1daf2f6040518163ffffffff1660e01b8152600401602060405180830381865afa158015612b5c573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190612b809190613caa565b60015460405163564a565d60e01b8152600481018a90529192506000916001600160a01b039091169063564a565d9060240160a060405180830381865afa158015612bcf573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190612bf3919061372e565b5050604051632638506b60e11b81526001600160601b03841660048201819052602482018d9052604482018c90529394506001600160a01b0386169250634c70a0d69150606401602060405180830381865afa158015612c57573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190612c7b9190613caa565b9650612c878988612ef1565b15612d1457604080516080810182526001600160a01b03898116825260006020808401828152948401828152606085018381528a5460018082018d558c8652939094209551600490940290950180546001600160a01b0319169390941692909217835593519382019390935591516002830155516003909101805460ff1916911515919091179055612d19565b600096505b50505050505092915050565b600082815260036020526040812054600280548392908110612d4957612d496136c3565b60009182526020808320868452600360059093020191820190526040822054815491935083918110612d7d57612d7d6136c3565b600091825260208220600154604051631c3db16d60e01b8152600481018a9052600c93909302909101935082916001600160a01b0390911690631c3db16d90602401606060405180830381865afa158015612ddc573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190612e0091906137c6565b5091509150826004015460001480612e2f575080158015612e2f57506000828152600284016020526040902054155b15612e41576000945050505050612e72565b8015612e56575050600401549150612e729050565b506000908152600290910160205260409020549150612e729050565b92915050565b6000546001600160a01b03163314612ea25760405162461bcd60e51b815260040161084690613a44565b600080546001600160a01b0319166001600160a01b0392909216919091179055565b6000546001600160a01b03163314612eee5760405162461bcd60e51b815260040161084690613a44565b50565b60015460405163564a565d60e01b81526004810184905260009182916001600160a01b039091169063564a565d9060240160a060405180830381865afa158015612f3f573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190612f63919061372e565b505060018054604051637e37c78b60e11b8152600481018a90529495506000946001600160a01b039091169350638a9bb02a9250889190849063fc6f8f1690602401602060405180830381865afa158015612fc2573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190612fe691906138a9565b612ff091906136ef565b6040516001600160e01b031960e085901b16815260048101929092526024820152604401600060405180830381865afa158015613031573d6000803e3d6000fd5b505050506040513d6000823e601f3d908101601f191682016040526130599190810190613d5a565b602001519050600080600160009054906101000a90046001600160a01b03166001600160a01b0316632e1daf2f6040518163ffffffff1660e01b8152600401602060405180830381865afa1580156130b5573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906130d99190613caa565b604051631a383be960e31b81526001600160a01b0388811660048301526001600160601b0387166024830152919091169063d1c1df4890604401608060405180830381865afa158015613130573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906131549190613e3b565b5050915091508281613166919061383b565b909110159695505050505050565b60006020828403121561318657600080fd5b5035919050565b6001600160a01b0381168114612eee57600080fd5b600080600080608085870312156131b857600080fd5b8435935060208501356131ca8161318d565b93969395505050506040820135916060013590565b600080604083850312156131f257600080fd5b82356131fd8161318d565b9150602083013561320d8161318d565b809150509250929050565b6000806040838503121561322b57600080fd5b50508035926020909101359150565b634e487b7160e01b600052604160045260246000fd5b60405161016081016001600160401b03811182821017156132735761327361323a565b60405290565b604051601f8201601f191681016001600160401b03811182821017156132a1576132a161323a565b604052919050565b60006001600160401b038311156132c2576132c261323a565b6132d5601f8401601f1916602001613279565b90508281528383830111156132e957600080fd5b828260208301376000602084830101529392505050565b600082601f83011261331157600080fd5b613320838335602085016132a9565b9392505050565b6000806040838503121561333a57600080fd5b82356133458161318d565b915060208301356001600160401b0381111561336057600080fd5b61336c85828601613300565b9150509250929050565b60005b83811015613391578181015183820152602001613379565b50506000910152565b600081518084526133b2816020860160208601613376565b601f01601f19169290920160200192915050565b8381528215156020820152606060408201526000611dc5606083018461339a565b60008083601f8401126133f957600080fd5b5081356001600160401b0381111561341057600080fd5b6020830191508360208260051b850101111561342b57600080fd5b9250929050565b6000806000806060858703121561344857600080fd5b8435935060208501356001600160401b0381111561346557600080fd5b613471878288016133e7565b9598909750949560400135949350505050565b6020808252825182820181905260009190848201906040850190845b818110156134bc578351835292840192918401916001016134a0565b50909695505050505050565b600080600080600060a086880312156134e057600080fd5b505083359560208501359550604085013594606081013594506080013592509050565b60008060006060848603121561351857600080fd5b505081359360208301359350604090920135919050565b60008060006060848603121561354457600080fd5b833561354f8161318d565b92506020840135915060408401356001600160401b0381111561357157600080fd5b61357d86828701613300565b9150509250925092565b60008060008060008060a087890312156135a057600080fd5b8635955060208701356001600160401b03808211156135be57600080fd5b6135ca8a838b016133e7565b9097509550604089013594506060890135935060808901359150808211156135f157600080fd5b508701601f8101891361360357600080fd5b613612898235602084016132a9565b9150509295509295509295565b60006020828403121561363157600080fd5b81356133208161318d565b60008060008060006080868803121561365457600080fd5b853594506020860135935060408601356001600160401b038082111561367957600080fd5b818801915088601f83011261368d57600080fd5b81358181111561369c57600080fd5b8960208285010111156136ae57600080fd5b96999598505060200195606001359392505050565b634e487b7160e01b600052603260045260246000fd5b634e487b7160e01b600052601160045260246000fd5b81810381811115612e7257612e726136d9565b80516001600160601b038116811461371957600080fd5b919050565b8051801515811461371957600080fd5b600080600080600060a0868803121561374657600080fd5b61374f86613702565b9450602086015161375f8161318d565b60408701519094506005811061377457600080fd5b92506137826060870161371e565b9150608086015190509295509295909350565b634e487b7160e01b600052602160045260246000fd5b6000602082840312156137bd57600080fd5b6133208261371e565b6000806000606084860312156137db57600080fd5b835192506137eb6020850161371e565b91506137f96040850161371e565b90509250925092565b8082028115828204841417612e7257612e726136d9565b60008261383657634e487b7160e01b600052601260045260246000fd5b500490565b80820180821115612e7257612e726136d9565b6020808252601e908201527f44697370757465206a756d70656420746f206120706172656e7420444b210000604082015260600190565b6000806040838503121561389857600080fd5b505080516020909101519092909150565b6000602082840312156138bb57600080fd5b5051919050565b600181811c908216806138d657607f821691505b6020821081036138f657634e487b7160e01b600052602260045260246000fd5b50919050565b83815260006020846020840152606060408401526000845461391d816138c2565b806060870152608060018084166000811461393f576001811461395b5761398b565b60ff19851660808a0152608084151560051b8a0101955061398b565b89600052602060002060005b858110156139825781548b8201860152908301908801613967565b8a016080019650505b50939a9950505050505050505050565b600082516139ad818460208701613376565b9190910192915050565b6020808252601f908201527f5468652063616c6c65722068617320746f206f776e2074686520766f74652e00604082015260600190565b81835260006001600160fb1b03831115613a0757600080fd5b8260051b80836020870137939093016020019392505050565b604081526000613a346040830185876139ee565b9050826020830152949350505050565b60208082526022908201527f416363657373206e6f7420616c6c6f7765643a20476f7665726e6f72206f6e6c6040820152613c9760f11b606082015260800190565b600080600080600080600060e0888a031215613aa157600080fd5b613aaa88613702565b9650613ab86020890161371e565b955060408801519450606088015193506080880151925060a08801519150613ae260c0890161371e565b905092959891949750929550565b604081526000613b046040830185876139ee565b8281036020840152613b16818561339a565b9695505050505050565b60208082526024908201527f416363657373206e6f7420616c6c6f7765643a204b6c65726f73436f7265206f60408201526337363c9760e11b606082015260800190565b601f821115611797576000816000526020600020601f850160051c81016020861015613b8d5750805b601f850160051c820191505b81811015613bac57828155600101613b99565b505050505050565b6001600160401b03831115613bcb57613bcb61323a565b613bdf83613bd983546138c2565b83613b64565b6000601f841160018114613c135760008515613bfb5750838201355b600019600387901b1c1916600186901b178355613c6d565b600083815260209020601f19861690835b82811015613c445786850135825560209485019460019092019101613c24565b5086821015613c615760001960f88860031b161c19848701351681555b505060018560011b0183555b5050505050565b83815260406020820152816040820152818360608301376000818301606090810191909152601f909201601f1916010192915050565b600060208284031215613cbc57600080fd5b81516133208161318d565b600082601f830112613cd857600080fd5b815160206001600160401b03821115613cf357613cf361323a565b8160051b613d02828201613279565b9283528481018201928281019087851115613d1c57600080fd5b83870192505b84831015613d44578251613d358161318d565b82529183019190830190613d22565b979650505050505050565b80516137198161318d565b600060208284031215613d6c57600080fd5b81516001600160401b0380821115613d8357600080fd5b908301906101608286031215613d9857600080fd5b613da0613250565b825181526020830151602082015260408301516040820152606083015160608201526080830151608082015260a083015160a082015260c083015182811115613de857600080fd5b613df487828601613cc7565b60c08301525060e0838101519082015261010080840151908201526101209150613e1f828401613d4f565b9181019190915261014091820151918101919091529392505050565b60008060008060808587031215613e5157600080fd5b50508251602084015160408501516060909501519196909550909250905056fe360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbca2646970667358221220ece2f97e5f37049420403eea1739d27d704a432100da66c99ed49ffe1796440264736f6c63430008180033",
-  "deployedBytecode": "0x6080604052600436106101825760003560e01c80636d4cd8ea116100d7578063b6ede54011610085578063b6ede540146104ca578063ba66fde7146104ea578063be4676041461050a578063d2b8035a14610520578063da3beb8c14610540578063e349ad3014610412578063e4c0aaf414610560578063f2f4eb261461058057600080fd5b80636d4cd8ea146103d2578063751accd0146103f2578063796490f9146104125780637c04034e146104285780638e42646014610448578063a7cc08fe14610468578063b34bfaa8146104b457600080fd5b80634f1ef286116101345780634f1ef286146102c157806352d1902d146102d4578063564a565d146102e95780635c92e2f61461031857806365540b9614610338578063675926f61461036557806369f3f0411461038557600080fd5b80630baa64d1146101875780630c340a24146101bc5780631200aabc146101f45780631c3db16d1461022f578063362c34791461026c578063485cc9551461028c5780634b2f0ea0146102ae575b600080fd5b34801561019357600080fd5b506101a76101a2366004613174565b6105a0565b60405190151581526020015b60405180910390f35b3480156101c857600080fd5b506000546101dc906001600160a01b031681565b6040516001600160a01b0390911681526020016101b3565b34801561020057600080fd5b5061022161020f366004613174565b60036020526000908152604090205481565b6040519081526020016101b3565b34801561023b57600080fd5b5061024f61024a366004613174565b610617565b6040805193845291151560208401521515908201526060016101b3565b34801561027857600080fd5b506102216102873660046131a2565b610785565b34801561029857600080fd5b506102ac6102a73660046131df565b610c10565b005b6102ac6102bc366004613218565b610d0d565b6102ac6102cf366004613327565b611574565b3480156102e057600080fd5b5061022161179c565b3480156102f557600080fd5b50610309610304366004613174565b6117fa565b6040516101b3939291906133c6565b34801561032457600080fd5b506102ac610333366004613432565b6118c0565b34801561034457600080fd5b50610358610353366004613174565b611bc5565b6040516101b39190613484565b34801561037157600080fd5b506102216103803660046134c8565b611c89565b34801561039157600080fd5b506103a56103a0366004613503565b611dce565b604080519687529415156020870152938501929092526060840152608083015260a082015260c0016101b3565b3480156103de57600080fd5b506101a76103ed366004613174565b611e86565b3480156103fe57600080fd5b506102ac61040d36600461352f565b611efd565b34801561041e57600080fd5b5061022161271081565b34801561043457600080fd5b506102ac610443366004613587565b611fc9565b34801561045457600080fd5b506102ac61046336600461361f565b61269a565b34801561047457600080fd5b50610488610483366004613503565b6126e6565b604080516001600160a01b039095168552602085019390935291830152151560608201526080016101b3565b3480156104c057600080fd5b50610221614e2081565b3480156104d657600080fd5b506102ac6104e536600461363c565b6127ac565b3480156104f657600080fd5b506101a7610505366004613503565b612981565b34801561051657600080fd5b5061022161138881565b34801561052c57600080fd5b506101dc61053b366004613218565b612a1c565b34801561054c57600080fd5b5061022161055b366004613218565b612d25565b34801561056c57600080fd5b506102ac61057b36600461361f565b612e78565b34801561058c57600080fd5b506001546101dc906001600160a01b031681565b6000818152600360205260408120546002805483929081106105c4576105c46136c3565b600091825260208220600590910201805490925082906105e6906001906136ef565b815481106105f6576105f66136c3565b60009182526020909120600c90910201805460059091015414949350505050565b6000806000806002600360008781526020019081526020016000205481548110610643576106436136c3565b60009182526020822060059091020180549092508290610665906001906136ef565b81548110610675576106756136c3565b60009182526020909120600c90910201600381015460ff1694509050836106a05780600101546106a3565b60005b60015460405163564a565d60e01b8152600481018990529196506000916001600160a01b039091169063564a565d9060240160a060405180830381865afa1580156106f2573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190610716919061372e565b5090935060049250610726915050565b81600481111561073857610738613795565b0361077b57600061074888611bc5565b905080516001036107795780600081518110610766576107666136c3565b6020026020010151965060009550600194505b505b5050509193909250565b60015460405163564a565d60e01b81526004810186905260009182916001600160a01b039091169063564a565d9060240160a060405180830381865afa1580156107d3573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906107f7919061372e565b5093505050508061084f5760405162461bcd60e51b815260206004820152601b60248201527f446973707574652073686f756c64206265207265736f6c7665642e000000000060448201526064015b60405180910390fd5b600160009054906101000a90046001600160a01b03166001600160a01b0316635c975abb6040518163ffffffff1660e01b8152600401602060405180830381865afa1580156108a2573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906108c691906137ab565b156109045760405162461bcd60e51b815260206004820152600e60248201526d10dbdc99481a5cc81c185d5cd95960921b6044820152606401610846565b600086815260036020526040812054600280549091908110610928576109286136c3565b6000918252602080832088845260036005909302019182019052604082205481549193508391811061095c5761095c6136c3565b600091825260208220600154604051631c3db16d60e01b8152600481018d9052600c9390930290910193506001600160a01b031690631c3db16d90602401606060405180830381865afa1580156109b7573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906109db91906137c6565b5050600087815260078401602052604090205490915060ff16610a25576001600160a01b038816600090815260088301602090815260408083208984529091529020549450610b6a565b808603610a9a576000868152600683016020526040902054610a48576000610a93565b600086815260068301602090815260408083205460098601546001600160a01b038d1685526008870184528285208b8652909352922054610a899190613802565b610a939190613819565b9450610b6a565b600081815260078301602052604090205460ff16610b6a5781600601600083600a01600181548110610ace57610ace6136c3565b906000526020600020015481526020019081526020016000205482600601600084600a01600081548110610b0457610b046136c3565b9060005260206000200154815260200190815260200160002054610b28919061383b565b60098301546001600160a01b038a16600090815260088501602090815260408083208b8452909152902054610b5d9190613802565b610b679190613819565b94505b6001600160a01b038816600090815260088301602090815260408083208984529091528120558415610c04576040516001600160a01b0389169086156108fc029087906000818181858888f15050604080518a8152602081018a90526001600160a01b038d1694508b93508d92507f54b3cab3cb5c4aca3209db1151caff092e878011202e43a36782d4ebe0b963ae910160405180910390a45b50505050949350505050565b7ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e805460019190600160401b900460ff1680610c59575080546001600160401b03808416911610155b15610c765760405162dc149f60e41b815260040160405180910390fd5b805468ffffffffffffffffff19166001600160401b038316908117600160401b178255600080546001600160a01b038781166001600160a01b0319928316179092556001805492871692909116919091179055815460ff60401b191682556040519081527fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d29060200160405180910390a150505050565b600082815260036020526040902054600280548492908110610d3157610d316136c3565b600091825260209091206002600590920201015460ff1615610d655760405162461bcd60e51b81526004016108469061384e565b600083815260036020526040812054600280549091908110610d8957610d896136c3565b906000526020600020906005020190508060010154831115610ded5760405162461bcd60e51b815260206004820181905260248201527f5468657265206973206e6f20737563682072756c696e6720746f2066756e642e6044820152606401610846565b60015460405163afe15cfb60e01b81526004810186905260009182916001600160a01b039091169063afe15cfb906024016040805180830381865afa158015610e3a573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190610e5e9190613885565b91509150814210158015610e7157508042105b610eb65760405162461bcd60e51b815260206004820152601660248201527520b83832b0b6103832b934b7b21034b99037bb32b91760511b6044820152606401610846565b604051631c3db16d60e01b81526004810187905260009081903090631c3db16d90602401606060405180830381865afa158015610ef7573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190610f1b91906137c6565b50509050868103610f30576127109150610fb1565b612710611388610f4086866136ef565b610f4a9190613802565b610f549190613819565b610f5e85426136ef565b10610fab5760405162461bcd60e51b815260206004820152601f60248201527f41707065616c20706572696f64206973206f76657220666f72206c6f736572006044820152606401610846565b614e2091505b84546000908690610fc4906001906136ef565b81548110610fd457610fd46136c3565b60009182526020822060018054604051637e37c78b60e11b8152600481018f9052600c949094029092019450916001600160a01b039091169063fc6f8f1690602401602060405180830381865afa158015611033573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061105791906138a9565b61106191906136ef565b60008a815260078401602052604090205490915060ff16156110c55760405162461bcd60e51b815260206004820152601b60248201527f41707065616c2066656520697320616c726561647920706169642e00000000006044820152606401610846565b600154604051632cf6413f60e11b8152600481018c90526000916001600160a01b0316906359ec827e90602401602060405180830381865afa15801561110f573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061113391906138a9565b905060006127106111448784613802565b61114e9190613819565b611158908361383b565b60008c8152600686016020526040812054919250908211156112095760008c8152600686016020526040902054349061119190846136ef565b116111b65760008c81526006860160205260409020546111b190836136ef565b6111b8565b345b9050336001600160a01b0316848e7fcae597f39a3ad75c2e10d46b031f023c5c2babcd58ca0491b122acda3968d4c08f85604051611200929190918252602082015260400190565b60405180910390a45b33600090815260088601602090815260408083208f84529091528120805483929061123590849061383b565b909155505060008c81526006860160205260408120805483929061125a90849061383b565b909155505060008c8152600686016020526040902054821161132c5760008c81526006860160205260408120546009870180549192909161129c90849061383b565b9250508190555084600a018c908060018154018082558091505060019003906000526020600020016000909190919091505560018560070160008e815260200190815260200160002060006101000a81548160ff0219169083151502179055508b848e7fed764996238e4c1c873ae3af7ae2f00f1f6f4f10b9ac7d4bbea4a764c5dea00960405160405180910390a45b600a850154600110156115375782856009015461134991906136ef565b60098601556001546040516319b8152960e01b8152600481018f90526001600160a01b03909116906319b8152990602401602060405180830381865afa158015611397573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906113bb91906137ab565b156113d45760028a01805460ff191660011790556114b7565b895460038b0160006113e787600161383b565b81526020019081526020016000208190555060008a6000016001816001815401808255809150500390600052602060002090600c02019050600160009054906101000a90046001600160a01b03166001600160a01b031663c71f42538f6040518263ffffffff1660e01b815260040161146291815260200190565b602060405180830381865afa15801561147f573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906114a391906138a9565b600b820155600301805460ff191660011790555b600160009054906101000a90046001600160a01b03166001600160a01b031663c3569902848f8d600101548e6004016040518563ffffffff1660e01b8152600401611504939291906138fc565b6000604051808303818588803b15801561151d57600080fd5b505af1158015611531573d6000803e3d6000fd5b50505050505b8034111561156557336108fc61154d83346136ef565b6040518115909202916000818181858888f150505050505b50505050505050505050505050565b61157d82612ec4565b306001600160a01b037f00000000000000000000000000000000000000000000000000000000000000001614806115fb57507f00000000000000000000000000000000000000000000000000000000000000006001600160a01b03166115ef600080516020613e728339815191525490565b6001600160a01b031614155b156116195760405163703e46dd60e11b815260040160405180910390fd5b816001600160a01b03166352d1902d6040518163ffffffff1660e01b8152600401602060405180830381865afa925050508015611673575060408051601f3d908101601f19168201909252611670918101906138a9565b60015b61169b57604051630c76093760e01b81526001600160a01b0383166004820152602401610846565b600080516020613e7283398151915281146116cc57604051632a87526960e21b815260048101829052602401610846565b600080516020613e728339815191528390556040516001600160a01b038416907fbc7cd75a20ee27fd9adebab32041f755214dbc6bffa90cc0225b39da2e5c2d3b90600090a2815115611797576000836001600160a01b031683604051611733919061399b565b600060405180830381855af49150503d806000811461176e576040519150601f19603f3d011682016040523d82523d6000602084013e611773565b606091505b5050905080611795576040516339b21b5d60e11b815260040160405180910390fd5b505b505050565b6000306001600160a01b037f000000000000000000000000000000000000000000000000000000000000000016146117e75760405163703e46dd60e11b815260040160405180910390fd5b50600080516020613e7283398151915290565b6002818154811061180a57600080fd5b600091825260209091206005909102016001810154600282015460048301805492945060ff909116929161183d906138c2565b80601f0160208091040260200160405190810160405280929190818152602001828054611869906138c2565b80156118b65780601f1061188b576101008083540402835291602001916118b6565b820191906000526020600020905b81548152906001019060200180831161189957829003601f168201915b5050505050905083565b6000848152600360205260409020546002805486929081106118e4576118e46136c3565b600091825260209091206002600590920201015460ff16156119185760405162461bcd60e51b81526004016108469061384e565b60015460405163564a565d60e01b8152600481018790526000916001600160a01b03169063564a565d9060240160a060405180830381865afa158015611962573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190611986919061372e565b5090935060019250611996915050565b8160048111156119a8576119a8613795565b14611a055760405162461bcd60e51b815260206004820152602760248201527f54686520646973707574652073686f756c6420626520696e20436f6d6d6974206044820152663832b934b7b21760c91b6064820152608401610846565b82611a425760405162461bcd60e51b815260206004820152600d60248201526c22b6b83a3c9031b7b6b6b4ba1760991b6044820152606401610846565b600086815260036020526040812054600280549091908110611a6657611a666136c3565b60009182526020822060059091020180549092508290611a88906001906136ef565b81548110611a9857611a986136c3565b90600052602060002090600c0201905060005b86811015611b5e573382898984818110611ac757611ac76136c3565b9050602002013581548110611ade57611ade6136c3565b60009182526020909120600490910201546001600160a01b031614611b155760405162461bcd60e51b8152600401610846906139b7565b8582898984818110611b2957611b296136c3565b9050602002013581548110611b4057611b406136c3565b60009182526020909120600160049092020181019190915501611aab565b5086869050816005016000828254611b76919061383b565b9091555050604051339089907f05cc2f1c94966f1c961b410a50f3d3ffb64501346753a258177097ea23707f0890611bb3908b908b908b90613a20565b60405180910390a35050505050505050565b6000818152600360205260408120546002805460609392908110611beb57611beb6136c3565b60009182526020822060059091020180549092508290611c0d906001906136ef565b81548110611c1d57611c1d6136c3565b90600052602060002090600c0201905080600a01805480602002602001604051908101604052809291908181526020018280548015611c7b57602002820191906000526020600020905b815481526020019060010190808311611c67575b505050505092505050919050565b600085815260036020526040812054600280548392908110611cad57611cad6136c3565b60009182526020808320898452600360059093020191820190526040822054815491935083918110611ce157611ce16136c3565b90600052602060002090600c02016000018681548110611d0357611d036136c3565b600091825260208220600154604051631c3db16d60e01b815260048082018e905293909302909101935082916001600160a01b0390911690631c3db16d90602401606060405180830381865afa158015611d61573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190611d8591906137c6565b506003850154919350915060ff168015611da957508183600201541480611da95750805b15611dbc57612710945050505050611dc5565b60009450505050505b95945050505050565b60008060008060008060006002600360008c81526020019081526020016000205481548110611dff57611dff6136c3565b600091825260208083208c8452600360059093020191820190526040822054815491935083918110611e3357611e336136c3565b600091825260208083206001600c909302019182015460038301546004840154600585015485549f87526002909501909352604090942054909f60ff9094169e50909c50909a9950975095505050505050565b600081815260036020526040812054600280548392908110611eaa57611eaa6136c3565b60009182526020822060059091020180549092508290611ecc906001906136ef565b81548110611edc57611edc6136c3565b60009182526020909120600c90910201805460049091015414949350505050565b6000546001600160a01b03163314611f275760405162461bcd60e51b815260040161084690613a44565b6000836001600160a01b03168383604051611f42919061399b565b60006040518083038185875af1925050503d8060008114611f7f576040519150601f19603f3d011682016040523d82523d6000602084013e611f84565b606091505b50509050806117955760405162461bcd60e51b8152602060048201526011602482015270155b9cdd58d8d95cdcd99d5b0818d85b1b607a1b6044820152606401610846565b600086815260036020526040902054600280548892908110611fed57611fed6136c3565b600091825260209091206002600590920201015460ff16156120215760405162461bcd60e51b81526004016108469061384e565b60015460405163564a565d60e01b8152600481018990526000916001600160a01b03169063564a565d9060240160a060405180830381865afa15801561206b573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061208f919061372e565b509093506002925061209f915050565b8160048111156120b1576120b1613795565b1461210c5760405162461bcd60e51b815260206004820152602560248201527f54686520646973707574652073686f756c6420626520696e20566f74652070656044820152643934b7b21760d91b6064820152608401610846565b8561214e5760405162461bcd60e51b8152602060048201526012602482015271139bc81d9bdd195251081c1c9bdd9a59195960721b6044820152606401610846565b600088815260036020526040812054600280549091908110612172576121726136c3565b9060005260206000209060050201905080600101548611156121cd5760405162461bcd60e51b815260206004820152601460248201527343686f696365206f7574206f6620626f756e647360601b6044820152606401610846565b805460009082906121e0906001906136ef565b815481106121f0576121f06136c3565b60009182526020822060015460405163564a565d60e01b8152600481018f9052600c9390930290910193506001600160a01b03169063564a565d9060240160a060405180830381865afa15801561224b573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061226f919061372e565b5050600154604051630fad06e960e11b81526001600160601b03851660048201529394506000936001600160a01b039091169250631f5a0dd2915060240160e060405180830381865afa1580156122ca573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906122ee9190613a86565b505050505091505060005b8a8110156125605733848d8d84818110612315576123156136c3565b905060200201358154811061232c5761232c6136c3565b60009182526020909120600490910201546001600160a01b0316146123635760405162461bcd60e51b8152600401610846906139b7565b8115806123d6575060408051602081018c90529081018a905260600160405160208183030381529060405280519060200120846000018d8d848181106123ab576123ab6136c3565b90506020020135815481106123c2576123c26136c3565b906000526020600020906004020160010154145b6124485760405162461bcd60e51b815260206004820152603d60248201527f54686520636f6d6d6974206d757374206d61746368207468652063686f69636560448201527f20696e20636f7572747320776974682068696464656e20766f7465732e0000006064820152608401610846565b838c8c8381811061245b5761245b6136c3565b9050602002013581548110612472576124726136c3565b600091825260209091206003600490920201015460ff16156124cb5760405162461bcd60e51b81526020600482015260126024820152712b37ba329030b63932b0b23c9031b0b9ba1760711b6044820152606401610846565b89848d8d848181106124df576124df6136c3565b90506020020135815481106124f6576124f66136c3565b60009182526020909120600260049092020101556001848d8d8481811061251f5761251f6136c3565b9050602002013581548110612536576125366136c3565b60009182526020909120600490910201600301805460ff19169115159190911790556001016122f9565b508a8a9050836004016000828254612578919061383b565b90915550506000898152600284016020526040812080548c929061259d90849061383b565b9091555050600183015489036125cc57600383015460ff16156125c75760038301805460ff191690555b612645565b60018301546000908152600284016020526040808220548b83529120540361260e57600383015460ff166125c75760038301805460ff19166001179055612645565b60018301546000908152600284016020526040808220548b83529120541115612645576001830189905560038301805460ff191690555b88336001600160a01b03168d7fa000893c71384499023d2d7b21234f7b9e80c78e0330f357dcd667ff578bd3a48e8e8c60405161268493929190613af0565b60405180910390a4505050505050505050505050565b6000546001600160a01b031633146126c45760405162461bcd60e51b815260040161084690613a44565b600180546001600160a01b0319166001600160a01b0392909216919091179055565b60008060008060006002600360008a81526020019081526020016000205481548110612714576127146136c3565b600091825260208083208a8452600360059093020191820190526040822054815491935083918110612748576127486136c3565b90600052602060002090600c0201600001878154811061276a5761276a6136c3565b600091825260209091206004909102018054600182015460028301546003909301546001600160a01b039092169c909b5091995060ff16975095505050505050565b6001546001600160a01b031633146127d65760405162461bcd60e51b815260040161084690613b20565b60028054600181018255600091909152600581027f405787fa12a823e0f2b7631cc41b3ba8828b3321ca811111fa75cd3aa3bb5acf81018690557f405787fa12a823e0f2b7631cc41b3ba8828b3321ca811111fa75cd3aa3bb5ace8101907f405787fa12a823e0f2b7631cc41b3ba8828b3321ca811111fa75cd3aa3bb5ad201612861858783613bb4565b50805460018054604051637e37c78b60e11b8152600481018b9052600385019260009290916001600160a01b039091169063fc6f8f1690602401602060405180830381865afa1580156128b8573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906128dc91906138a9565b6128e691906136ef565b81526020808201929092526040908101600090812093909355835460018181018655858552838520600b600c909302019182018890556003808301805460ff19169092179091558b855290925291829020849055905188907fd3106f74c2d30a4b9230e756a3e78bde53865d40f6af4c479bb010ebaab581089061296f908a908a908a90613c74565b60405180910390a25050505050505050565b6000838152600360205260408120546002805483929081106129a5576129a56136c3565b600091825260208083208784526003600590930201918201905260408220548154919350839181106129d9576129d96136c3565b90600052602060002090600c020160000184815481106129fb576129fb6136c3565b600091825260209091206004909102016003015460ff169695505050505050565b6001546000906001600160a01b03163314612a495760405162461bcd60e51b815260040161084690613b20565b600083815260036020526040902054600280548592908110612a6d57612a6d6136c3565b600091825260209091206002600590920201015460ff1615612aa15760405162461bcd60e51b81526004016108469061384e565b600084815260036020526040812054600280549091908110612ac557612ac56136c3565b60009182526020822060059091020180549092508290612ae7906001906136ef565b81548110612af757612af76136c3565b90600052602060002090600c020190506000600160009054906101000a90046001600160a01b03166001600160a01b0316632e1daf2f6040518163ffffffff1660e01b8152600401602060405180830381865afa158015612b5c573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190612b809190613caa565b60015460405163564a565d60e01b8152600481018a90529192506000916001600160a01b039091169063564a565d9060240160a060405180830381865afa158015612bcf573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190612bf3919061372e565b5050604051632638506b60e11b81526001600160601b03841660048201819052602482018d9052604482018c90529394506001600160a01b0386169250634c70a0d69150606401602060405180830381865afa158015612c57573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190612c7b9190613caa565b9650612c878988612ef1565b15612d1457604080516080810182526001600160a01b03898116825260006020808401828152948401828152606085018381528a5460018082018d558c8652939094209551600490940290950180546001600160a01b0319169390941692909217835593519382019390935591516002830155516003909101805460ff1916911515919091179055612d19565b600096505b50505050505092915050565b600082815260036020526040812054600280548392908110612d4957612d496136c3565b60009182526020808320868452600360059093020191820190526040822054815491935083918110612d7d57612d7d6136c3565b600091825260208220600154604051631c3db16d60e01b8152600481018a9052600c93909302909101935082916001600160a01b0390911690631c3db16d90602401606060405180830381865afa158015612ddc573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190612e0091906137c6565b5091509150826004015460001480612e2f575080158015612e2f57506000828152600284016020526040902054155b15612e41576000945050505050612e72565b8015612e56575050600401549150612e729050565b506000908152600290910160205260409020549150612e729050565b92915050565b6000546001600160a01b03163314612ea25760405162461bcd60e51b815260040161084690613a44565b600080546001600160a01b0319166001600160a01b0392909216919091179055565b6000546001600160a01b03163314612eee5760405162461bcd60e51b815260040161084690613a44565b50565b60015460405163564a565d60e01b81526004810184905260009182916001600160a01b039091169063564a565d9060240160a060405180830381865afa158015612f3f573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190612f63919061372e565b505060018054604051637e37c78b60e11b8152600481018a90529495506000946001600160a01b039091169350638a9bb02a9250889190849063fc6f8f1690602401602060405180830381865afa158015612fc2573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190612fe691906138a9565b612ff091906136ef565b6040516001600160e01b031960e085901b16815260048101929092526024820152604401600060405180830381865afa158015613031573d6000803e3d6000fd5b505050506040513d6000823e601f3d908101601f191682016040526130599190810190613d5a565b602001519050600080600160009054906101000a90046001600160a01b03166001600160a01b0316632e1daf2f6040518163ffffffff1660e01b8152600401602060405180830381865afa1580156130b5573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906130d99190613caa565b604051631a383be960e31b81526001600160a01b0388811660048301526001600160601b0387166024830152919091169063d1c1df4890604401608060405180830381865afa158015613130573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906131549190613e3b565b5050915091508281613166919061383b565b909110159695505050505050565b60006020828403121561318657600080fd5b5035919050565b6001600160a01b0381168114612eee57600080fd5b600080600080608085870312156131b857600080fd5b8435935060208501356131ca8161318d565b93969395505050506040820135916060013590565b600080604083850312156131f257600080fd5b82356131fd8161318d565b9150602083013561320d8161318d565b809150509250929050565b6000806040838503121561322b57600080fd5b50508035926020909101359150565b634e487b7160e01b600052604160045260246000fd5b60405161016081016001600160401b03811182821017156132735761327361323a565b60405290565b604051601f8201601f191681016001600160401b03811182821017156132a1576132a161323a565b604052919050565b60006001600160401b038311156132c2576132c261323a565b6132d5601f8401601f1916602001613279565b90508281528383830111156132e957600080fd5b828260208301376000602084830101529392505050565b600082601f83011261331157600080fd5b613320838335602085016132a9565b9392505050565b6000806040838503121561333a57600080fd5b82356133458161318d565b915060208301356001600160401b0381111561336057600080fd5b61336c85828601613300565b9150509250929050565b60005b83811015613391578181015183820152602001613379565b50506000910152565b600081518084526133b2816020860160208601613376565b601f01601f19169290920160200192915050565b8381528215156020820152606060408201526000611dc5606083018461339a565b60008083601f8401126133f957600080fd5b5081356001600160401b0381111561341057600080fd5b6020830191508360208260051b850101111561342b57600080fd5b9250929050565b6000806000806060858703121561344857600080fd5b8435935060208501356001600160401b0381111561346557600080fd5b613471878288016133e7565b9598909750949560400135949350505050565b6020808252825182820181905260009190848201906040850190845b818110156134bc578351835292840192918401916001016134a0565b50909695505050505050565b600080600080600060a086880312156134e057600080fd5b505083359560208501359550604085013594606081013594506080013592509050565b60008060006060848603121561351857600080fd5b505081359360208301359350604090920135919050565b60008060006060848603121561354457600080fd5b833561354f8161318d565b92506020840135915060408401356001600160401b0381111561357157600080fd5b61357d86828701613300565b9150509250925092565b60008060008060008060a087890312156135a057600080fd5b8635955060208701356001600160401b03808211156135be57600080fd5b6135ca8a838b016133e7565b9097509550604089013594506060890135935060808901359150808211156135f157600080fd5b508701601f8101891361360357600080fd5b613612898235602084016132a9565b9150509295509295509295565b60006020828403121561363157600080fd5b81356133208161318d565b60008060008060006080868803121561365457600080fd5b853594506020860135935060408601356001600160401b038082111561367957600080fd5b818801915088601f83011261368d57600080fd5b81358181111561369c57600080fd5b8960208285010111156136ae57600080fd5b96999598505060200195606001359392505050565b634e487b7160e01b600052603260045260246000fd5b634e487b7160e01b600052601160045260246000fd5b81810381811115612e7257612e726136d9565b80516001600160601b038116811461371957600080fd5b919050565b8051801515811461371957600080fd5b600080600080600060a0868803121561374657600080fd5b61374f86613702565b9450602086015161375f8161318d565b60408701519094506005811061377457600080fd5b92506137826060870161371e565b9150608086015190509295509295909350565b634e487b7160e01b600052602160045260246000fd5b6000602082840312156137bd57600080fd5b6133208261371e565b6000806000606084860312156137db57600080fd5b835192506137eb6020850161371e565b91506137f96040850161371e565b90509250925092565b8082028115828204841417612e7257612e726136d9565b60008261383657634e487b7160e01b600052601260045260246000fd5b500490565b80820180821115612e7257612e726136d9565b6020808252601e908201527f44697370757465206a756d70656420746f206120706172656e7420444b210000604082015260600190565b6000806040838503121561389857600080fd5b505080516020909101519092909150565b6000602082840312156138bb57600080fd5b5051919050565b600181811c908216806138d657607f821691505b6020821081036138f657634e487b7160e01b600052602260045260246000fd5b50919050565b83815260006020846020840152606060408401526000845461391d816138c2565b806060870152608060018084166000811461393f576001811461395b5761398b565b60ff19851660808a0152608084151560051b8a0101955061398b565b89600052602060002060005b858110156139825781548b8201860152908301908801613967565b8a016080019650505b50939a9950505050505050505050565b600082516139ad818460208701613376565b9190910192915050565b6020808252601f908201527f5468652063616c6c65722068617320746f206f776e2074686520766f74652e00604082015260600190565b81835260006001600160fb1b03831115613a0757600080fd5b8260051b80836020870137939093016020019392505050565b604081526000613a346040830185876139ee565b9050826020830152949350505050565b60208082526022908201527f416363657373206e6f7420616c6c6f7765643a20476f7665726e6f72206f6e6c6040820152613c9760f11b606082015260800190565b600080600080600080600060e0888a031215613aa157600080fd5b613aaa88613702565b9650613ab86020890161371e565b955060408801519450606088015193506080880151925060a08801519150613ae260c0890161371e565b905092959891949750929550565b604081526000613b046040830185876139ee565b8281036020840152613b16818561339a565b9695505050505050565b60208082526024908201527f416363657373206e6f7420616c6c6f7765643a204b6c65726f73436f7265206f60408201526337363c9760e11b606082015260800190565b601f821115611797576000816000526020600020601f850160051c81016020861015613b8d5750805b601f850160051c820191505b81811015613bac57828155600101613b99565b505050505050565b6001600160401b03831115613bcb57613bcb61323a565b613bdf83613bd983546138c2565b83613b64565b6000601f841160018114613c135760008515613bfb5750838201355b600019600387901b1c1916600186901b178355613c6d565b600083815260209020601f19861690835b82811015613c445786850135825560209485019460019092019101613c24565b5086821015613c615760001960f88860031b161c19848701351681555b505060018560011b0183555b5050505050565b83815260406020820152816040820152818360608301376000818301606090810191909152601f909201601f1916010192915050565b600060208284031215613cbc57600080fd5b81516133208161318d565b600082601f830112613cd857600080fd5b815160206001600160401b03821115613cf357613cf361323a565b8160051b613d02828201613279565b9283528481018201928281019087851115613d1c57600080fd5b83870192505b84831015613d44578251613d358161318d565b82529183019190830190613d22565b979650505050505050565b80516137198161318d565b600060208284031215613d6c57600080fd5b81516001600160401b0380821115613d8357600080fd5b908301906101608286031215613d9857600080fd5b613da0613250565b825181526020830151602082015260408301516040820152606083015160608201526080830151608082015260a083015160a082015260c083015182811115613de857600080fd5b613df487828601613cc7565b60c08301525060e0838101519082015261010080840151908201526101209150613e1f828401613d4f565b9181019190915261014091820151918101919091529392505050565b60008060008060808587031215613e5157600080fd5b50508251602084015160408501516060909501519196909550909250905056fe360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbca2646970667358221220ece2f97e5f37049420403eea1739d27d704a432100da66c99ed49ffe1796440264736f6c63430008180033",
+  "solcInputHash": "d547d738900bce1310e91a5d1adfc179",
+  "metadata": "{\"compiler\":{\"version\":\"0.8.30+commit.73712a01\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"inputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"constructor\"},{\"inputs\":[],\"name\":\"AlreadyInitialized\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"AppealFeeIsAlreadyPaid\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"AppealPeriodIsOver\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"AppealPeriodIsOverForLoser\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"ChoiceOutOfBounds\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"CoreIsPaused\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"DisputeJumpedToParentDK\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"DisputeNotResolved\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"EmptyCommit\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"EmptyVoteIDs\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"FailedDelegateCall\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"HashDoesNotMatchHiddenVoteCommitment\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"implementation\",\"type\":\"address\"}],\"name\":\"InvalidImplementation\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"JurorHasToOwnTheVote\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"KlerosCoreOnly\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"NotActiveForCoreDisputeID\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"NotCommitPeriod\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"NotInitializing\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"NotVotePeriod\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"OwnerOnly\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"UUPSUnauthorizedCallContext\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"slot\",\"type\":\"bytes32\"}],\"name\":\"UUPSUnsupportedProxiableUUID\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"UnsuccessfulCall\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"VoteAlreadyCast\",\"type\":\"error\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_coreRoundID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_choice\",\"type\":\"uint256\"}],\"name\":\"ChoiceFunded\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"address\",\"name\":\"_juror\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"uint256[]\",\"name\":\"_voteIDs\",\"type\":\"uint256[]\"},{\"indexed\":false,\"internalType\":\"bytes32\",\"name\":\"_commit\",\"type\":\"bytes32\"}],\"name\":\"CommitCast\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_coreRoundID\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_choice\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"address\",\"name\":\"_contributor\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_amount\",\"type\":\"uint256\"}],\"name\":\"Contribution\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_numberOfChoices\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"bytes\",\"name\":\"_extraData\",\"type\":\"bytes\"}],\"name\":\"DisputeCreation\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":false,\"internalType\":\"uint64\",\"name\":\"version\",\"type\":\"uint64\"}],\"name\":\"Initialized\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"newImplementation\",\"type\":\"address\"}],\"name\":\"Upgraded\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"address\",\"name\":\"_juror\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"uint256[]\",\"name\":\"_voteIDs\",\"type\":\"uint256[]\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_choice\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"string\",\"name\":\"_justification\",\"type\":\"string\"}],\"name\":\"VoteCast\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_coreRoundID\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_choice\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"address\",\"name\":\"_contributor\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_amount\",\"type\":\"uint256\"}],\"name\":\"Withdrawal\",\"type\":\"event\"},{\"inputs\":[],\"name\":\"LOSER_APPEAL_PERIOD_MULTIPLIER\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"LOSER_STAKE_MULTIPLIER\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"WINNER_STAKE_MULTIPLIER\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"}],\"name\":\"areCommitsAllCast\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"}],\"name\":\"areVotesAllCast\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256[]\",\"name\":\"_voteIDs\",\"type\":\"uint256[]\"},{\"internalType\":\"bytes32\",\"name\":\"_commit\",\"type\":\"bytes32\"}],\"name\":\"castCommit\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256[]\",\"name\":\"_voteIDs\",\"type\":\"uint256[]\"},{\"internalType\":\"uint256\",\"name\":\"_choice\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_salt\",\"type\":\"uint256\"},{\"internalType\":\"string\",\"name\":\"_justification\",\"type\":\"string\"}],\"name\":\"castVote\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_core\",\"type\":\"address\"}],\"name\":\"changeCore\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_jumpDisputeKitID\",\"type\":\"uint256\"}],\"name\":\"changeJumpDisputeKitID\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address payable\",\"name\":\"_owner\",\"type\":\"address\"}],\"name\":\"changeOwner\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"core\",\"outputs\":[{\"internalType\":\"contract KlerosCore\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"coreDisputeID\",\"type\":\"uint256\"}],\"name\":\"coreDisputeIDToActive\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"name\":\"coreDisputeIDToLocal\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_numberOfChoices\",\"type\":\"uint256\"},{\"internalType\":\"bytes\",\"name\":\"_extraData\",\"type\":\"bytes\"},{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"name\":\"createDispute\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"}],\"name\":\"currentRuling\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"ruling\",\"type\":\"uint256\"},{\"internalType\":\"bool\",\"name\":\"tied\",\"type\":\"bool\"},{\"internalType\":\"bool\",\"name\":\"overridden\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"name\":\"disputes\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"numberOfChoices\",\"type\":\"uint256\"},{\"internalType\":\"bool\",\"name\":\"jumped\",\"type\":\"bool\"},{\"internalType\":\"bytes\",\"name\":\"extraData\",\"type\":\"bytes\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_nonce\",\"type\":\"uint256\"}],\"name\":\"draw\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"drawnAddress\",\"type\":\"address\"},{\"internalType\":\"uint96\",\"name\":\"fromSubcourtID\",\"type\":\"uint96\"}],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"name\":\"earlyCourtJump\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"\",\"type\":\"bool\"}],\"stateMutability\":\"pure\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_destination\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"_amount\",\"type\":\"uint256\"},{\"internalType\":\"bytes\",\"name\":\"_data\",\"type\":\"bytes\"}],\"name\":\"executeOwnerProposal\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_choice\",\"type\":\"uint256\"}],\"name\":\"fundAppeal\",\"outputs\":[],\"stateMutability\":\"payable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_coreRoundID\",\"type\":\"uint256\"}],\"name\":\"getCoherentCount\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_coreRoundID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_voteID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"name\":\"getDegreeOfCoherencePenalty\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"pnkCoherence\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_coreRoundID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_voteID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"name\":\"getDegreeOfCoherenceReward\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"pnkCoherence\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"feeCoherence\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"}],\"name\":\"getFundedChoices\",\"outputs\":[{\"internalType\":\"uint256[]\",\"name\":\"fundedChoices\",\"type\":\"uint256[]\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"getJumpDisputeKitID\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_coreRoundID\",\"type\":\"uint256\"}],\"name\":\"getLocalDisputeRoundID\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"localDisputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"localRoundID\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"contract IDisputeKit\",\"name\":\"\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"_currentNbVotes\",\"type\":\"uint256\"}],\"name\":\"getNbVotesAfterAppeal\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"pure\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_localDisputeID\",\"type\":\"uint256\"}],\"name\":\"getNumberOfRounds\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_coreRoundID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_choice\",\"type\":\"uint256\"}],\"name\":\"getRoundInfo\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"winningChoice\",\"type\":\"uint256\"},{\"internalType\":\"bool\",\"name\":\"tied\",\"type\":\"bool\"},{\"internalType\":\"uint256\",\"name\":\"totalVoted\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"totalCommitted\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"nbVoters\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"choiceCount\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_coreRoundID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_voteID\",\"type\":\"uint256\"}],\"name\":\"getVoteInfo\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"account\",\"type\":\"address\"},{\"internalType\":\"bytes32\",\"name\":\"commit\",\"type\":\"bytes32\"},{\"internalType\":\"uint256\",\"name\":\"choice\",\"type\":\"uint256\"},{\"internalType\":\"bool\",\"name\":\"voted\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_choice\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_salt\",\"type\":\"uint256\"},{\"internalType\":\"string\",\"name\":\"\",\"type\":\"string\"}],\"name\":\"hashVote\",\"outputs\":[{\"internalType\":\"bytes32\",\"name\":\"\",\"type\":\"bytes32\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_owner\",\"type\":\"address\"},{\"internalType\":\"contract KlerosCore\",\"name\":\"_core\",\"type\":\"address\"},{\"internalType\":\"address\",\"name\":\"_wNative\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"_jumpDisputeKitID\",\"type\":\"uint256\"}],\"name\":\"initialize\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"}],\"name\":\"isAppealFunded\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_coreRoundID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_voteID\",\"type\":\"uint256\"}],\"name\":\"isVoteActive\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"jumpDisputeKitID\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"owner\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"proxiableUUID\",\"outputs\":[{\"internalType\":\"bytes32\",\"name\":\"\",\"type\":\"bytes32\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"singleDrawPerJuror\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"newImplementation\",\"type\":\"address\"},{\"internalType\":\"bytes\",\"name\":\"data\",\"type\":\"bytes\"}],\"name\":\"upgradeToAndCall\",\"outputs\":[],\"stateMutability\":\"payable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"version\",\"outputs\":[{\"internalType\":\"string\",\"name\":\"\",\"type\":\"string\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"wNative\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_coreDisputeID\",\"type\":\"uint256\"},{\"internalType\":\"address payable\",\"name\":\"_beneficiary\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"_coreRoundID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_choice\",\"type\":\"uint256\"}],\"name\":\"withdrawFeesAndRewards\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"amount\",\"type\":\"uint256\"}],\"stateMutability\":\"nonpayable\",\"type\":\"function\"}],\"devdoc\":{\"errors\":{\"AlreadyInitialized()\":[{\"details\":\"The contract is already initialized.\"}],\"NotInitializing()\":[{\"details\":\"The contract is not initializing.\"}]},\"events\":{\"ChoiceFunded(uint256,uint256,uint256)\":{\"params\":{\"_choice\":\"The choice that is being funded.\",\"_coreDisputeID\":\"The identifier of the dispute in the Arbitrator contract.\",\"_coreRoundID\":\"The identifier of the round in the Arbitrator contract.\"}},\"CommitCast(uint256,address,uint256[],bytes32)\":{\"params\":{\"_commit\":\"The commitment of the juror.\",\"_coreDisputeID\":\"The identifier of the dispute in the Arbitrator contract.\",\"_juror\":\"The address of the juror casting the vote commitment.\",\"_voteIDs\":\"The identifiers of the votes in the dispute.\"}},\"Contribution(uint256,uint256,uint256,address,uint256)\":{\"params\":{\"_amount\":\"The amount contributed.\",\"_choice\":\"The choice that is being funded.\",\"_contributor\":\"The address of the contributor.\",\"_coreDisputeID\":\"The identifier of the dispute in the Arbitrator contract.\",\"_coreRoundID\":\"The identifier of the round in the Arbitrator contract.\"}},\"DisputeCreation(uint256,uint256,bytes)\":{\"params\":{\"_coreDisputeID\":\"The identifier of the dispute in the Arbitrator contract.\",\"_extraData\":\"The extra data for the dispute.\",\"_numberOfChoices\":\"The number of choices available in the dispute.\"}},\"Initialized(uint64)\":{\"details\":\"Triggered when the contract has been initialized or reinitialized.\"},\"Upgraded(address)\":{\"params\":{\"newImplementation\":\"Address of the new implementation the proxy is now forwarding calls to.\"}},\"VoteCast(uint256,address,uint256[],uint256,string)\":{\"params\":{\"_choice\":\"The choice juror voted for.\",\"_coreDisputeID\":\"The identifier of the dispute in the Arbitrator contract.\",\"_juror\":\"Address of the juror.\",\"_justification\":\"Justification of the choice.\",\"_voteIDs\":\"The identifiers of the votes in the dispute.\"}},\"Withdrawal(uint256,uint256,uint256,address,uint256)\":{\"params\":{\"_amount\":\"The amount withdrawn.\",\"_choice\":\"The choice that is being funded.\",\"_contributor\":\"The address of the contributor.\",\"_coreDisputeID\":\"The identifier of the dispute in the Arbitrator contract.\",\"_coreRoundID\":\"The identifier of the round in the Arbitrator contract.\"}}},\"kind\":\"dev\",\"methods\":{\"areCommitsAllCast(uint256)\":{\"params\":{\"_coreDisputeID\":\"The ID of the dispute in Kleros Core, not in the Dispute Kit.\"},\"returns\":{\"_0\":\"Whether all of the jurors have cast their commits for the last round.\"}},\"areVotesAllCast(uint256)\":{\"details\":\"This function is to be called directly by the core contract and is not for off-chain usage.\",\"params\":{\"_coreDisputeID\":\"The ID of the dispute in Kleros Core, not in the Dispute Kit.\"},\"returns\":{\"_0\":\"Whether all of the jurors have cast their votes for the last round.\"}},\"castCommit(uint256,uint256[],bytes32)\":{\"details\":\"It can be called multiple times during the commit period, each call overrides the commits of the previous one. `O(n)` where `n` is the number of votes.\",\"params\":{\"_commit\":\"The commitment hash.\",\"_coreDisputeID\":\"The ID of the dispute in Kleros Core.\",\"_voteIDs\":\"The IDs of the votes.\"}},\"castVote(uint256,uint256[],uint256,uint256,string)\":{\"details\":\"`O(n)` where `n` is the number of votes.\",\"params\":{\"_choice\":\"The choice.\",\"_coreDisputeID\":\"The ID of the dispute in Kleros Core.\",\"_justification\":\"Justification of the choice.\",\"_salt\":\"The salt for the commit if the votes were hidden.\",\"_voteIDs\":\"The IDs of the votes.\"}},\"changeCore(address)\":{\"params\":{\"_core\":\"The new value for the `core` storage variable.\"}},\"changeJumpDisputeKitID(uint256)\":{\"params\":{\"_jumpDisputeKitID\":\"The new value for the `jumpDisputeKitID` storage variable.\"}},\"changeOwner(address)\":{\"params\":{\"_owner\":\"The new value for the `owner` storage variable.\"}},\"constructor\":{\"custom:oz-upgrades-unsafe-allow\":\"constructor\"},\"createDispute(uint256,uint256,bytes,uint256)\":{\"details\":\"Access restricted to Kleros Core only.\",\"params\":{\"_coreDisputeID\":\"The ID of the dispute in Kleros Core, not in the Dispute Kit.\",\"_extraData\":\"Additional info about the dispute, for possible use in future dispute kits.\",\"_nbVotes\":\"Maximal number of votes this dispute can get. Added for future-proofing.\",\"_numberOfChoices\":\"Number of choices of the dispute\"}},\"currentRuling(uint256)\":{\"params\":{\"_coreDisputeID\":\"The ID of the dispute in Kleros Core, not in the Dispute Kit.\"},\"returns\":{\"overridden\":\"Whether the ruling was overridden by appeal funding or not.\",\"ruling\":\"The current ruling.\",\"tied\":\"Whether it's a tie or not.\"}},\"draw(uint256,uint256)\":{\"details\":\"Access restricted to Kleros Core only.\",\"params\":{\"_coreDisputeID\":\"The ID of the dispute in Kleros Core, not in the Dispute Kit.\",\"_nonce\":\"Nonce.\"},\"returns\":{\"drawnAddress\":\"The drawn address.\"}},\"earlyCourtJump(uint256)\":{\"details\":\"Returns true if the dispute is jumping to a parent court.\",\"params\":{\"_coreDisputeID\":\"The ID of the dispute in Kleros Core, not in the Dispute Kit.\"},\"returns\":{\"_0\":\"Whether the dispute is jumping to a parent court or not.\"}},\"executeOwnerProposal(address,uint256,bytes)\":{\"params\":{\"_amount\":\"The value sent with the call.\",\"_data\":\"The data sent with the call.\",\"_destination\":\"The destination of the call.\"}},\"fundAppeal(uint256,uint256)\":{\"params\":{\"_choice\":\"A choice that receives funding.\",\"_coreDisputeID\":\"Index of the dispute in Kleros Core.\"}},\"getCoherentCount(uint256,uint256)\":{\"params\":{\"_coreDisputeID\":\"The ID of the dispute in Kleros Core, not in the Dispute Kit.\",\"_coreRoundID\":\"The ID of the round in Kleros Core, not in the Dispute Kit.\"},\"returns\":{\"_0\":\"The number of coherent jurors.\"}},\"getDegreeOfCoherencePenalty(uint256,uint256,uint256,uint256,uint256)\":{\"details\":\"This function is called by Kleros Core in order to determine the amount of the penalty.\",\"params\":{\"_coreDisputeID\":\"The ID of the dispute in Kleros Core, not in the Dispute Kit.\",\"_coreRoundID\":\"The ID of the round in Kleros Core, not in the Dispute Kit.\",\"_feePerJuror\":\"The fee per juror.\",\"_pnkAtStakePerJuror\":\"The PNK at stake per juror.\",\"_voteID\":\"The ID of the vote.\"},\"returns\":{\"pnkCoherence\":\"The degree of coherence in basis points for the dispute PNK reward.\"}},\"getDegreeOfCoherenceReward(uint256,uint256,uint256,uint256,uint256)\":{\"details\":\"This function is called by Kleros Core in order to determine the amount of the reward.\",\"params\":{\"_coreDisputeID\":\"The ID of the dispute in Kleros Core, not in the Dispute Kit.\",\"_coreRoundID\":\"The ID of the round in Kleros Core, not in the Dispute Kit.\",\"_feePerJuror\":\"The fee per juror.\",\"_pnkAtStakePerJuror\":\"The PNK at stake per juror.\",\"_voteID\":\"The ID of the vote.\"},\"returns\":{\"feeCoherence\":\"The degree of coherence in basis points for the dispute fee reward.\",\"pnkCoherence\":\"The degree of coherence in basis points for the dispute PNK reward.\"}},\"getFundedChoices(uint256)\":{\"params\":{\"_coreDisputeID\":\"The ID of the dispute in Kleros Core.\"},\"returns\":{\"fundedChoices\":\"Fully funded rulings.\"}},\"getJumpDisputeKitID()\":{\"returns\":{\"_0\":\"The ID of the dispute kit in Kleros Core disputeKits array.\"}},\"getLocalDisputeRoundID(uint256,uint256)\":{\"params\":{\"_coreDisputeID\":\"The ID of the dispute in Kleros Core.\",\"_coreRoundID\":\"The ID of the round in Kleros Core.\"},\"returns\":{\"localDisputeID\":\"The ID of the dispute in the Dispute Kit.\",\"localRoundID\":\"The ID of the round in the Dispute Kit.\"}},\"getNbVotesAfterAppeal(address,uint256)\":{\"params\":{\"_currentNbVotes\":\"The number of votes before the appeal.\",\"_previousDisputeKit\":\"The previous Dispute Kit.\"},\"returns\":{\"_0\":\"The number of votes after the appeal.\"}},\"getNumberOfRounds(uint256)\":{\"params\":{\"_localDisputeID\":\"The ID of the dispute in the Dispute Kit.\"},\"returns\":{\"_0\":\"The number of rounds in the dispute.\"}},\"getRoundInfo(uint256,uint256,uint256)\":{\"params\":{\"_choice\":\"The choice to query.\",\"_coreDisputeID\":\"The ID of the dispute in Kleros Core, not in the Dispute Kit.\",\"_coreRoundID\":\"The ID of the round in Kleros Core, not in the Dispute Kit.\"},\"returns\":{\"choiceCount\":\"Number of votes cast for the queried choice.\",\"nbVoters\":\"Total number of voters in this round.\",\"tied\":\"Whether it's a tie or not.\",\"totalCommitted\":\"Number of jurors who cast the commit already (only relevant for hidden votes).\",\"totalVoted\":\"Number of jurors who cast the vote already.\",\"winningChoice\":\"The winning choice of this round.\"}},\"getVoteInfo(uint256,uint256,uint256)\":{\"params\":{\"_coreDisputeID\":\"The ID of the dispute in Kleros Core.\",\"_coreRoundID\":\"The ID of the round in Kleros Core.\",\"_voteID\":\"The ID of the vote.\"},\"returns\":{\"account\":\"The address of the juror who cast the vote.\",\"choice\":\"The choice that got the vote.\",\"commit\":\"The commit of the vote.\",\"voted\":\"Whether the vote was cast or not.\"}},\"hashVote(uint256,uint256,string)\":{\"details\":\"The unused parameters may be used by overriding contracts.\",\"params\":{\"_choice\":\"The choice being voted for\",\"_salt\":\"A random salt for commitment\"},\"returns\":{\"_0\":\"bytes32 The hash of the encoded vote parameters\"}},\"initialize(address,address,address,uint256)\":{\"params\":{\"_core\":\"The KlerosCore arbitrator.\",\"_jumpDisputeKitID\":\"The ID of the dispute kit to switch to after the court jump.\",\"_owner\":\"The owner's address.\",\"_wNative\":\"The wrapped native token address, typically wETH.\"}},\"isAppealFunded(uint256)\":{\"details\":\"This function is to be called directly by the core contract and is not for off-chain usage.\",\"params\":{\"_coreDisputeID\":\"The ID of the dispute in Kleros Core, not in the Dispute Kit.\"},\"returns\":{\"_0\":\"Whether the appeal funding is finished.\"}},\"isVoteActive(uint256,uint256,uint256)\":{\"params\":{\"_coreDisputeID\":\"The ID of the dispute in Kleros Core, not in the Dispute Kit.\",\"_coreRoundID\":\"The ID of the round in Kleros Core, not in the Dispute Kit.\",\"_voteID\":\"The ID of the voter.\"},\"returns\":{\"_0\":\"Whether the voter was active or not.\"}},\"proxiableUUID()\":{\"details\":\"IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks bricking a proxy that upgrades to it, by delegating to itself until out of gas. Thus it is critical that this function revert if invoked through a proxy. This is guaranteed by the if statement.\"},\"upgradeToAndCall(address,bytes)\":{\"details\":\"Reverts if the execution is not performed via delegatecall or the execution context is not of a proxy with an ERC1967-compliant implementation pointing to self.\",\"params\":{\"data\":\"Data used in a delegate call to `newImplementation` if non-empty. This will typically be an encoded function call, and allows initializing the storage of the proxy like a Solidity constructor.\",\"newImplementation\":\"Address of the new implementation contract.\"}},\"withdrawFeesAndRewards(uint256,address,uint256,uint256)\":{\"details\":\"Withdrawals are not possible if the core contract is paused.\",\"params\":{\"_beneficiary\":\"The address whose rewards to withdraw.\",\"_choice\":\"The ruling option that the caller wants to withdraw from.\",\"_coreDisputeID\":\"Index of the dispute in Kleros Core contract.\",\"_coreRoundID\":\"The round in the Kleros Core contract the caller wants to withdraw from.\"},\"returns\":{\"amount\":\"The withdrawn amount.\"}}},\"stateVariables\":{\"version\":{\"return\":\"Version string.\",\"returns\":{\"_0\":\"Version string.\"}}},\"title\":\"DisputeKitClassic\",\"version\":1},\"userdoc\":{\"errors\":{\"FailedDelegateCall()\":[{\"notice\":\"Failed Delegated call\"}],\"InvalidImplementation(address)\":[{\"notice\":\"The `implementation` is not UUPS-compliant\"}],\"UUPSUnauthorizedCallContext()\":[{\"notice\":\"The call is from an unauthorized context.\"}],\"UUPSUnsupportedProxiableUUID(bytes32)\":[{\"notice\":\"The storage `slot` is unsupported as a UUID.\"}]},\"events\":{\"ChoiceFunded(uint256,uint256,uint256)\":{\"notice\":\"To be emitted when a choice is fully funded for an appeal.\"},\"CommitCast(uint256,address,uint256[],bytes32)\":{\"notice\":\"To be emitted when a vote commitment is cast.\"},\"Contribution(uint256,uint256,uint256,address,uint256)\":{\"notice\":\"To be emitted when a funding contribution is made.\"},\"DisputeCreation(uint256,uint256,bytes)\":{\"notice\":\"To be emitted when a dispute is created.\"},\"Upgraded(address)\":{\"notice\":\"Emitted when the `implementation` has been successfully upgraded.\"},\"VoteCast(uint256,address,uint256[],uint256,string)\":{\"notice\":\"Emitted when casting a vote to provide the justification of juror's choice.\"},\"Withdrawal(uint256,uint256,uint256,address,uint256)\":{\"notice\":\"To be emitted when the contributed funds are withdrawn.\"}},\"kind\":\"user\",\"methods\":{\"areCommitsAllCast(uint256)\":{\"notice\":\"Returns true if all of the jurors have cast their commits for the last round.\"},\"areVotesAllCast(uint256)\":{\"notice\":\"Returns true if all of the jurors have cast their votes for the last round.\"},\"castCommit(uint256,uint256[],bytes32)\":{\"notice\":\"Sets the caller's commit for the specified votes.\"},\"castVote(uint256,uint256[],uint256,uint256,string)\":{\"notice\":\"Sets the caller's choices for the specified votes.\"},\"changeCore(address)\":{\"notice\":\"Changes the `core` storage variable.\"},\"changeJumpDisputeKitID(uint256)\":{\"notice\":\"Changes the dispute kit ID used for the jump.\"},\"changeOwner(address)\":{\"notice\":\"Changes the `owner` storage variable.\"},\"createDispute(uint256,uint256,bytes,uint256)\":{\"notice\":\"Creates a local dispute and maps it to the dispute ID in the Core contract.\"},\"currentRuling(uint256)\":{\"notice\":\"Gets the current ruling of a specified dispute.\"},\"draw(uint256,uint256)\":{\"notice\":\"Draws the juror from the sortition tree. The drawn address is picked up by Kleros Core.\"},\"executeOwnerProposal(address,uint256,bytes)\":{\"notice\":\"Allows the owner to call anything on behalf of the contract.\"},\"fundAppeal(uint256,uint256)\":{\"notice\":\"Manages contributions, and appeals a dispute if at least two choices are fully funded. Note that the surplus deposit will be reimbursed.\"},\"getCoherentCount(uint256,uint256)\":{\"notice\":\"Gets the number of jurors who are eligible to a reward in this round.\"},\"getDegreeOfCoherencePenalty(uint256,uint256,uint256,uint256,uint256)\":{\"notice\":\"Gets the degree of coherence of a particular voter.\"},\"getDegreeOfCoherenceReward(uint256,uint256,uint256,uint256,uint256)\":{\"notice\":\"Gets the degree of coherence of a particular voter.\"},\"getFundedChoices(uint256)\":{\"notice\":\"Returns the rulings that were fully funded in the latest appeal round.\"},\"getJumpDisputeKitID()\":{\"notice\":\"Returns the dispute kit ID to be used after court jump by Kleros Core.\"},\"getLocalDisputeRoundID(uint256,uint256)\":{\"notice\":\"Returns the local dispute ID and round ID for a given core dispute ID and core round ID.\"},\"getNbVotesAfterAppeal(address,uint256)\":{\"notice\":\"Returns the number of votes after the appeal.\"},\"getNumberOfRounds(uint256)\":{\"notice\":\"Returns the number of rounds in a dispute.\"},\"getRoundInfo(uint256,uint256,uint256)\":{\"notice\":\"Returns the info of the specified round in the core contract.\"},\"getVoteInfo(uint256,uint256,uint256)\":{\"notice\":\"Returns the vote information for a given vote ID.\"},\"hashVote(uint256,uint256,string)\":{\"notice\":\"Computes the hash of a vote using ABI encoding\"},\"initialize(address,address,address,uint256)\":{\"notice\":\"Initializer.\"},\"isAppealFunded(uint256)\":{\"notice\":\"Returns true if the appeal funding is finished prematurely (e.g. when losing side didn't fund).\"},\"isVoteActive(uint256,uint256,uint256)\":{\"notice\":\"Returns true if the specified voter was active in this round.\"},\"proxiableUUID()\":{\"notice\":\"Implementation of the ERC1822 `proxiableUUID` function. This returns the storage slot used by the implementation. It is used to validate the implementation's compatibility when performing an upgrade.\"},\"upgradeToAndCall(address,bytes)\":{\"notice\":\"Upgrade mechanism including access control and UUPS-compliance.\"},\"version()\":{\"notice\":\"Returns the version of the implementation.\"},\"withdrawFeesAndRewards(uint256,address,uint256,uint256)\":{\"notice\":\"Allows those contributors who attempted to fund an appeal round to withdraw any reimbursable fees or rewards after the dispute gets resolved.\"}},\"notice\":\"Dispute kit implementation of the Kleros v1 features including: - a drawing system: proportional to staked PNK, - a vote aggregation system: plurality, - an incentive system: equal split between coherent votes, - an appeal system: fund 2 choices only, vote on any choice.\",\"version\":1}},\"settings\":{\"compilationTarget\":{\"src/arbitration/dispute-kits/DisputeKitClassic.sol\":\"DisputeKitClassic\"},\"evmVersion\":\"cancun\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\",\"useLiteralContent\":true},\"optimizer\":{\"enabled\":true,\"runs\":1000},\"remappings\":[],\"viaIR\":true},\"sources\":{\"@openzeppelin/contracts/token/ERC20/IERC20.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v5.4.0) (token/ERC20/IERC20.sol)\\n\\npragma solidity >=0.4.16;\\n\\n/**\\n * @dev Interface of the ERC-20 standard as defined in the ERC.\\n */\\ninterface IERC20 {\\n    /**\\n     * @dev Emitted when `value` tokens are moved from one account (`from`) to\\n     * another (`to`).\\n     *\\n     * Note that `value` may be zero.\\n     */\\n    event Transfer(address indexed from, address indexed to, uint256 value);\\n\\n    /**\\n     * @dev Emitted when the allowance of a `spender` for an `owner` is set by\\n     * a call to {approve}. `value` is the new allowance.\\n     */\\n    event Approval(address indexed owner, address indexed spender, uint256 value);\\n\\n    /**\\n     * @dev Returns the value of tokens in existence.\\n     */\\n    function totalSupply() external view returns (uint256);\\n\\n    /**\\n     * @dev Returns the value of tokens owned by `account`.\\n     */\\n    function balanceOf(address account) external view returns (uint256);\\n\\n    /**\\n     * @dev Moves a `value` amount of tokens from the caller's account to `to`.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * Emits a {Transfer} event.\\n     */\\n    function transfer(address to, uint256 value) external returns (bool);\\n\\n    /**\\n     * @dev Returns the remaining number of tokens that `spender` will be\\n     * allowed to spend on behalf of `owner` through {transferFrom}. This is\\n     * zero by default.\\n     *\\n     * This value changes when {approve} or {transferFrom} are called.\\n     */\\n    function allowance(address owner, address spender) external view returns (uint256);\\n\\n    /**\\n     * @dev Sets a `value` amount of tokens as the allowance of `spender` over the\\n     * caller's tokens.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * IMPORTANT: Beware that changing an allowance with this method brings the risk\\n     * that someone may use both the old and the new allowance by unfortunate\\n     * transaction ordering. One possible solution to mitigate this race\\n     * condition is to first reduce the spender's allowance to 0 and set the\\n     * desired value afterwards:\\n     * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729\\n     *\\n     * Emits an {Approval} event.\\n     */\\n    function approve(address spender, uint256 value) external returns (bool);\\n\\n    /**\\n     * @dev Moves a `value` amount of tokens from `from` to `to` using the\\n     * allowance mechanism. `value` is then deducted from the caller's\\n     * allowance.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * Emits a {Transfer} event.\\n     */\\n    function transferFrom(address from, address to, uint256 value) external returns (bool);\\n}\\n\",\"keccak256\":\"0x74ed01eb66b923d0d0cfe3be84604ac04b76482a55f9dd655e1ef4d367f95bc2\",\"license\":\"MIT\"},\"@openzeppelin/contracts/token/ERC721/IERC721.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v5.4.0) (token/ERC721/IERC721.sol)\\n\\npragma solidity >=0.6.2;\\n\\nimport {IERC165} from \\\"../../utils/introspection/IERC165.sol\\\";\\n\\n/**\\n * @dev Required interface of an ERC-721 compliant contract.\\n */\\ninterface IERC721 is IERC165 {\\n    /**\\n     * @dev Emitted when `tokenId` token is transferred from `from` to `to`.\\n     */\\n    event Transfer(address indexed from, address indexed to, uint256 indexed tokenId);\\n\\n    /**\\n     * @dev Emitted when `owner` enables `approved` to manage the `tokenId` token.\\n     */\\n    event Approval(address indexed owner, address indexed approved, uint256 indexed tokenId);\\n\\n    /**\\n     * @dev Emitted when `owner` enables or disables (`approved`) `operator` to manage all of its assets.\\n     */\\n    event ApprovalForAll(address indexed owner, address indexed operator, bool approved);\\n\\n    /**\\n     * @dev Returns the number of tokens in ``owner``'s account.\\n     */\\n    function balanceOf(address owner) external view returns (uint256 balance);\\n\\n    /**\\n     * @dev Returns the owner of the `tokenId` token.\\n     *\\n     * Requirements:\\n     *\\n     * - `tokenId` must exist.\\n     */\\n    function ownerOf(uint256 tokenId) external view returns (address owner);\\n\\n    /**\\n     * @dev Safely transfers `tokenId` token from `from` to `to`.\\n     *\\n     * Requirements:\\n     *\\n     * - `from` cannot be the zero address.\\n     * - `to` cannot be the zero address.\\n     * - `tokenId` token must exist and be owned by `from`.\\n     * - If the caller is not `from`, it must be approved to move this token by either {approve} or {setApprovalForAll}.\\n     * - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon\\n     *   a safe transfer.\\n     *\\n     * Emits a {Transfer} event.\\n     */\\n    function safeTransferFrom(address from, address to, uint256 tokenId, bytes calldata data) external;\\n\\n    /**\\n     * @dev Safely transfers `tokenId` token from `from` to `to`, checking first that contract recipients\\n     * are aware of the ERC-721 protocol to prevent tokens from being forever locked.\\n     *\\n     * Requirements:\\n     *\\n     * - `from` cannot be the zero address.\\n     * - `to` cannot be the zero address.\\n     * - `tokenId` token must exist and be owned by `from`.\\n     * - If the caller is not `from`, it must have been allowed to move this token by either {approve} or\\n     *   {setApprovalForAll}.\\n     * - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon\\n     *   a safe transfer.\\n     *\\n     * Emits a {Transfer} event.\\n     */\\n    function safeTransferFrom(address from, address to, uint256 tokenId) external;\\n\\n    /**\\n     * @dev Transfers `tokenId` token from `from` to `to`.\\n     *\\n     * WARNING: Note that the caller is responsible to confirm that the recipient is capable of receiving ERC-721\\n     * or else they may be permanently lost. Usage of {safeTransferFrom} prevents loss, though the caller must\\n     * understand this adds an external call which potentially creates a reentrancy vulnerability.\\n     *\\n     * Requirements:\\n     *\\n     * - `from` cannot be the zero address.\\n     * - `to` cannot be the zero address.\\n     * - `tokenId` token must be owned by `from`.\\n     * - If the caller is not `from`, it must be approved to move this token by either {approve} or {setApprovalForAll}.\\n     *\\n     * Emits a {Transfer} event.\\n     */\\n    function transferFrom(address from, address to, uint256 tokenId) external;\\n\\n    /**\\n     * @dev Gives permission to `to` to transfer `tokenId` token to another account.\\n     * The approval is cleared when the token is transferred.\\n     *\\n     * Only a single account can be approved at a time, so approving the zero address clears previous approvals.\\n     *\\n     * Requirements:\\n     *\\n     * - The caller must own the token or be an approved operator.\\n     * - `tokenId` must exist.\\n     *\\n     * Emits an {Approval} event.\\n     */\\n    function approve(address to, uint256 tokenId) external;\\n\\n    /**\\n     * @dev Approve or remove `operator` as an operator for the caller.\\n     * Operators can call {transferFrom} or {safeTransferFrom} for any token owned by the caller.\\n     *\\n     * Requirements:\\n     *\\n     * - The `operator` cannot be the address zero.\\n     *\\n     * Emits an {ApprovalForAll} event.\\n     */\\n    function setApprovalForAll(address operator, bool approved) external;\\n\\n    /**\\n     * @dev Returns the account approved for `tokenId` token.\\n     *\\n     * Requirements:\\n     *\\n     * - `tokenId` must exist.\\n     */\\n    function getApproved(uint256 tokenId) external view returns (address operator);\\n\\n    /**\\n     * @dev Returns if the `operator` is allowed to manage all of the assets of `owner`.\\n     *\\n     * See {setApprovalForAll}\\n     */\\n    function isApprovedForAll(address owner, address operator) external view returns (bool);\\n}\\n\",\"keccak256\":\"0xf78f05f3b8c9f75570e85300d7b4600d7f6f6a198449273f31d44c1641adb46f\",\"license\":\"MIT\"},\"@openzeppelin/contracts/utils/introspection/IERC165.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v5.4.0) (utils/introspection/IERC165.sol)\\n\\npragma solidity >=0.4.16;\\n\\n/**\\n * @dev Interface of the ERC-165 standard, as defined in the\\n * https://eips.ethereum.org/EIPS/eip-165[ERC].\\n *\\n * Implementers can declare support of contract interfaces, which can then be\\n * queried by others ({ERC165Checker}).\\n *\\n * For an implementation, see {ERC165}.\\n */\\ninterface IERC165 {\\n    /**\\n     * @dev Returns true if this contract implements the interface defined by\\n     * `interfaceId`. See the corresponding\\n     * https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified[ERC section]\\n     * to learn more about how these ids are created.\\n     *\\n     * This function call must use less than 30 000 gas.\\n     */\\n    function supportsInterface(bytes4 interfaceId) external view returns (bool);\\n}\\n\",\"keccak256\":\"0x8891738ffe910f0cf2da09566928589bf5d63f4524dd734fd9cedbac3274dd5c\",\"license\":\"MIT\"},\"src/arbitration/KlerosCore.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\nimport {IArbitrableV2, IArbitratorV2} from \\\"./interfaces/IArbitratorV2.sol\\\";\\nimport {IDisputeKit} from \\\"./interfaces/IDisputeKit.sol\\\";\\nimport {ISortitionModule} from \\\"./interfaces/ISortitionModule.sol\\\";\\nimport {Initializable} from \\\"../proxy/Initializable.sol\\\";\\nimport {UUPSProxiable} from \\\"../proxy/UUPSProxiable.sol\\\";\\nimport {SafeERC20, IERC20} from \\\"../libraries/SafeERC20.sol\\\";\\nimport {SafeSend} from \\\"../libraries/SafeSend.sol\\\";\\nimport {IERC721} from \\\"@openzeppelin/contracts/token/ERC721/IERC721.sol\\\";\\nimport \\\"../libraries/Constants.sol\\\";\\n\\n/// @title KlerosCore\\n/// @notice Core arbitrator contract for Kleros v2.\\n/// @dev This contract trusts the PNK token, the dispute kits and the sortition module contracts.\\ncontract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {\\n    using SafeERC20 for IERC20;\\n    using SafeSend for address payable;\\n\\n    string public constant override version = \\\"2.0.0\\\";\\n\\n    // ************************************* //\\n    // *         Enums / Structs           * //\\n    // ************************************* //\\n\\n    enum Period {\\n        evidence, // Evidence can be submitted. This is also when drawing has to take place.\\n        commit, // Jurors commit a hashed vote. This is skipped for courts without hidden votes.\\n        vote, // Jurors reveal/cast their vote depending on whether the court has hidden votes or not.\\n        appeal, // The dispute can be appealed.\\n        execution // Tokens are redistributed and the ruling is executed.\\n    }\\n\\n    struct Court {\\n        uint96 parent; // The parent court.\\n        bool hiddenVotes; // Whether to use commit and reveal or not.\\n        uint256[] children; // List of child courts.\\n        uint256 minStake; // Minimum PNKs needed to stake in the court.\\n        uint256 alpha; // Basis point of PNKs that are lost when incoherent.\\n        uint256 feeForJuror; // Arbitration fee paid per juror.\\n        uint256 jurorsForCourtJump; // The appeal after the one that reaches this number of jurors will go to the parent court if any.\\n        uint256[4] timesPerPeriod; // The time allotted to each dispute period in the form `timesPerPeriod[period]`.\\n        mapping(uint256 disputeKitId => bool) supportedDisputeKits; // True if DK with this ID is supported by the court. Note that each court must support classic dispute kit.\\n        uint256[10] __gap; // Reserved slots for future upgrades.\\n    }\\n\\n    struct Dispute {\\n        uint96 courtID; // The ID of the court the dispute is in.\\n        IArbitrableV2 arbitrated; // The arbitrable contract.\\n        Period period; // The current period of the dispute.\\n        bool ruled; // True if the ruling has been executed, false otherwise.\\n        uint256 lastPeriodChange; // The last time the period was changed.\\n        Round[] rounds; // Rounds of the dispute.\\n        uint256[10] __gap; // Reserved slots for future upgrades.\\n    }\\n\\n    struct Round {\\n        uint256 disputeKitID; // Index of the dispute kit in the array.\\n        uint256 pnkAtStakePerJuror; // The amount of PNKs at stake for each juror in this round.\\n        uint256 totalFeesForJurors; // The total juror fees paid in this round.\\n        uint256 nbVotes; // The total number of votes the dispute can possibly have in the current round. Former votes[_round].length.\\n        uint256 repartitions; // A counter of reward repartitions made in this round.\\n        uint256 pnkPenalties; // The amount of PNKs collected from penalties in this round.\\n        address[] drawnJurors; // Addresses of the jurors that were drawn in this round.\\n        uint96[] drawnJurorFromCourtIDs; // The courtIDs where the juror was drawn from, possibly their stake in a subcourt.\\n        uint256 sumFeeRewardPaid; // Total sum of arbitration fees paid to coherent jurors as a reward in this round.\\n        uint256 sumPnkRewardPaid; // Total sum of PNK paid to coherent jurors as a reward in this round.\\n        IERC20 feeToken; // The token used for paying fees in this round.\\n        uint256 drawIterations; // The number of iterations passed drawing the jurors for this round.\\n        uint256[10] __gap; // Reserved slots for future upgrades.\\n    }\\n\\n    // Workaround \\\"stack too deep\\\" errors\\n    struct ExecuteParams {\\n        uint256 disputeID; // The ID of the dispute to execute.\\n        uint256 round; // The round to execute.\\n        uint256 coherentCount; // The number of coherent votes in the round.\\n        uint256 numberOfVotesInRound; // The number of votes in the round.\\n        uint256 feePerJurorInRound; // The fee per juror in the round.\\n        uint256 pnkAtStakePerJurorInRound; // The amount of PNKs at stake for each juror in the round.\\n        uint256 pnkPenaltiesInRound; // The amount of PNKs collected from penalties in the round.\\n        uint256 repartition; // The index of the repartition to execute.\\n    }\\n\\n    struct CurrencyRate {\\n        bool feePaymentAccepted; // True if this token is supported as payment method.\\n        uint64 rateInEth; // Rate of the fee token in ETH.\\n        uint8 rateDecimals; // Decimals of the fee token rate.\\n    }\\n\\n    // ************************************* //\\n    // *             Storage               * //\\n    // ************************************* //\\n\\n    uint256 private constant NON_PAYABLE_AMOUNT = (2 ** 256 - 2) / 2; // An amount higher than the supply of ETH.\\n\\n    address public owner; // The owner of the contract.\\n    address public guardian; // The guardian able to pause asset withdrawals.\\n    IERC20 public pinakion; // The Pinakion token contract.\\n    address public jurorProsecutionModule; // The module for juror's prosecution.\\n    ISortitionModule public sortitionModule; // Sortition module for drawing.\\n    Court[] public courts; // The courts.\\n    IDisputeKit[] public disputeKits; // Array of dispute kits.\\n    Dispute[] public disputes; // The disputes.\\n    mapping(IERC20 => CurrencyRate) public currencyRates; // The price of each token in ETH.\\n    bool public paused; // Whether asset withdrawals are paused.\\n    address public wNative; // The wrapped native token for safeSend().\\n    mapping(address => bool) public arbitrableWhitelist; // Arbitrable whitelist.\\n    bool public arbitrableWhitelistEnabled; // Whether the arbitrable whitelist is enabled.\\n    IERC721 public jurorNft; // Eligible jurors NFT.\\n\\n    // ************************************* //\\n    // *              Events               * //\\n    // ************************************* //\\n\\n    /// @notice Emitted when period is passed.\\n    /// @param _disputeID ID of the related dispute.\\n    /// @param _period The new period.\\n    event NewPeriod(uint256 indexed _disputeID, Period _period);\\n\\n    /// @notice Emitted when appeal period starts.\\n    /// @param _disputeID ID of the related dispute.\\n    /// @param _arbitrable The arbitrable contract.\\n    event AppealPossible(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);\\n\\n    /// @notice Emitted when the dispute is successfully appealed.\\n    /// @param _disputeID ID of the related dispute.\\n    /// @param _arbitrable The arbitrable contract.\\n    event AppealDecision(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);\\n\\n    /// @notice Emitted when an address is successfully drawn.\\n    /// @param _address The drawn address.\\n    /// @param _disputeID ID of the related dispute.\\n    /// @param _roundID ID of the related round.\\n    /// @param _voteID ID of the vote given to the drawn juror.\\n    event Draw(address indexed _address, uint256 indexed _disputeID, uint256 _roundID, uint256 _voteID);\\n\\n    /// @notice Emitted when a new court is created.\\n    /// @param _courtID ID of the new court.\\n    /// @param _parent ID of the parent court.\\n    /// @param _hiddenVotes Whether the court has hidden votes or not.\\n    /// @param _minStake The `minStake` property value of the court.\\n    /// @param _alpha The `alpha` property value of the court.\\n    /// @param _feeForJuror The `feeForJuror` property value of the court.\\n    /// @param _jurorsForCourtJump The `jurorsForCourtJump` property value of the court.\\n    /// @param _timesPerPeriod The `timesPerPeriod` property value of the court.\\n    /// @param _supportedDisputeKits Indexes of dispute kits that this court will support.\\n    event CourtCreated(\\n        uint96 indexed _courtID,\\n        uint96 indexed _parent,\\n        bool _hiddenVotes,\\n        uint256 _minStake,\\n        uint256 _alpha,\\n        uint256 _feeForJuror,\\n        uint256 _jurorsForCourtJump,\\n        uint256[4] _timesPerPeriod,\\n        uint256[] _supportedDisputeKits\\n    );\\n\\n    /// @notice Emitted when court's parameters are changed.\\n    /// @param _courtID ID of the court.\\n    /// @param _hiddenVotes Whether the court has hidden votes or not.\\n    /// @param _minStake The `minStake` property value of the court.\\n    /// @param _alpha The `alpha` property value of the court.\\n    /// @param _feeForJuror The `feeForJuror` property value of the court.\\n    /// @param _jurorsForCourtJump The `jurorsForCourtJump` property value of the court.\\n    /// @param _timesPerPeriod The `timesPerPeriod` property value of the court.\\n    event CourtModified(\\n        uint96 indexed _courtID,\\n        bool _hiddenVotes,\\n        uint256 _minStake,\\n        uint256 _alpha,\\n        uint256 _feeForJuror,\\n        uint256 _jurorsForCourtJump,\\n        uint256[4] _timesPerPeriod\\n    );\\n\\n    /// @notice Emitted when a dispute kit is created.\\n    /// @param _disputeKitID ID of the new dispute kit.\\n    /// @param _disputeKitAddress Address of the new dispute kit.\\n    event DisputeKitCreated(uint256 indexed _disputeKitID, IDisputeKit indexed _disputeKitAddress);\\n\\n    /// @notice Emitted when a dispute kit is enabled/disabled in a court.\\n    /// @param _courtID ID of the related court.\\n    /// @param _disputeKitID ID of the dispute kit.\\n    /// @param _enable Whether the dispute kit has been enabled or disabled.\\n    event DisputeKitEnabled(uint96 indexed _courtID, uint256 indexed _disputeKitID, bool indexed _enable);\\n\\n    /// @notice Emitted when a dispute jumps to a new court.\\n    /// @param _disputeID ID of the dispute.\\n    /// @param _roundID ID of the round.\\n    /// @param _fromCourtID ID of the previous court.\\n    /// @param _toCourtID ID of the new court.\\n    event CourtJump(\\n        uint256 indexed _disputeID,\\n        uint256 indexed _roundID,\\n        uint96 indexed _fromCourtID,\\n        uint96 _toCourtID\\n    );\\n\\n    /// @notice Emitted when a dispute jumps to a new dispute kit.\\n    /// @param _disputeID ID of the dispute.\\n    /// @param _roundID ID of the round.\\n    /// @param _fromDisputeKitID ID of the previous dispute kit.\\n    /// @param _toDisputeKitID ID of the new dispute kit.\\n    event DisputeKitJump(\\n        uint256 indexed _disputeID,\\n        uint256 indexed _roundID,\\n        uint256 indexed _fromDisputeKitID,\\n        uint256 _toDisputeKitID\\n    );\\n\\n    /// @notice Emitted when juror's balance shifts after penalties/rewards has been processed.\\n    /// @param _account Juror's address.\\n    /// @param _disputeID ID of the dispute.\\n    /// @param _roundID ID of the round.\\n    /// @param _degreeOfCoherencyPnk Juror's degree of coherency in this round applied to PNK.\\n    /// @param _degreeOfCoherencyFee Juror's degree of coherency in this round applied to the dispute fee.\\n    /// @param _amountPnk Amount of PNK shifted.\\n    /// @param _amountFee Amount of fee shifted.\\n    /// @param _feeToken Address of the fee token.\\n    event JurorRewardPenalty(\\n        address indexed _account,\\n        uint256 indexed _disputeID,\\n        uint256 indexed _roundID,\\n        uint256 _degreeOfCoherencyPnk,\\n        uint256 _degreeOfCoherencyFee,\\n        int256 _amountPnk,\\n        int256 _amountFee,\\n        IERC20 _feeToken\\n    );\\n\\n    /// @notice Emitted when leftover reward sent to owner.\\n    /// @param _disputeID ID of the dispute.\\n    /// @param _roundID ID of the round.\\n    /// @param _amountPnk Amount of PNK sent.\\n    /// @param _amountFee Amount of fee sent.\\n    /// @param _feeToken Address of the fee token.\\n    event LeftoverRewardSent(\\n        uint256 indexed _disputeID,\\n        uint256 indexed _roundID,\\n        uint256 _amountPnk,\\n        uint256 _amountFee,\\n        IERC20 _feeToken\\n    );\\n\\n    /// @notice Emitted when this contract is paused.\\n    event Paused();\\n\\n    /// @notice Emitted when this contract is unpaused.\\n    event Unpaused();\\n\\n    // ************************************* //\\n    // *        Function Modifiers         * //\\n    // ************************************* //\\n\\n    modifier onlyByOwner() {\\n        if (owner != msg.sender) revert OwnerOnly();\\n        _;\\n    }\\n\\n    modifier onlyByGuardianOrOwner() {\\n        if (guardian != msg.sender && owner != msg.sender) revert GuardianOrOwnerOnly();\\n        _;\\n    }\\n\\n    modifier whenPaused() {\\n        if (!paused) revert WhenPausedOnly();\\n        _;\\n    }\\n\\n    modifier whenNotPaused() {\\n        if (paused) revert WhenNotPausedOnly();\\n        _;\\n    }\\n\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    /// @custom:oz-upgrades-unsafe-allow constructor\\n    constructor() {\\n        _disableInitializers();\\n    }\\n\\n    /// @notice Initializer (constructor equivalent for upgradable contracts).\\n    /// @param _owner The owner's address.\\n    /// @param _guardian The guardian's address.\\n    /// @param _pinakion The address of the token contract.\\n    /// @param _jurorProsecutionModule The address of the juror prosecution module.\\n    /// @param _disputeKit The address of the default dispute kit.\\n    /// @param _hiddenVotes The `hiddenVotes` property value of the general court.\\n    /// @param _courtParameters Numeric parameters of General court (minStake, alpha, feeForJuror and jurorsForCourtJump respectively).\\n    /// @param _timesPerPeriod The `timesPerPeriod` property value of the general court.\\n    /// @param _sortitionExtraData The extra data for sortition module.\\n    /// @param _sortitionModuleAddress The sortition module responsible for sortition of the jurors.\\n    /// @param _wNative The wrapped native token address, typically wETH.\\n    /// @param _jurorNft NFT contract to vet the jurors.\\n    function initialize(\\n        address _owner,\\n        address _guardian,\\n        IERC20 _pinakion,\\n        address _jurorProsecutionModule,\\n        IDisputeKit _disputeKit,\\n        bool _hiddenVotes,\\n        uint256[4] memory _courtParameters,\\n        uint256[4] memory _timesPerPeriod,\\n        bytes memory _sortitionExtraData,\\n        ISortitionModule _sortitionModuleAddress,\\n        address _wNative,\\n        IERC721 _jurorNft\\n    ) external initializer {\\n        owner = _owner;\\n        guardian = _guardian;\\n        pinakion = _pinakion;\\n        jurorProsecutionModule = _jurorProsecutionModule;\\n        sortitionModule = _sortitionModuleAddress;\\n        wNative = _wNative;\\n        jurorNft = _jurorNft;\\n\\n        // NULL_DISPUTE_KIT: an empty element at index 0 to indicate when a dispute kit is not supported.\\n        disputeKits.push();\\n\\n        // DISPUTE_KIT_CLASSIC\\n        disputeKits.push(_disputeKit);\\n\\n        emit DisputeKitCreated(DISPUTE_KIT_CLASSIC, _disputeKit);\\n\\n        // FORKING_COURT\\n        // TODO: Fill the properties for the Forking court, emit CourtCreated.\\n        courts.push();\\n        sortitionModule.createTree(FORKING_COURT, _sortitionExtraData);\\n\\n        // GENERAL_COURT\\n        Court storage court = courts.push();\\n        court.parent = FORKING_COURT;\\n        court.children = new uint256[](0);\\n        court.hiddenVotes = _hiddenVotes;\\n        court.minStake = _courtParameters[0];\\n        court.alpha = _courtParameters[1];\\n        court.feeForJuror = _courtParameters[2];\\n        court.jurorsForCourtJump = _courtParameters[3];\\n        court.timesPerPeriod = _timesPerPeriod;\\n\\n        sortitionModule.createTree(GENERAL_COURT, _sortitionExtraData);\\n\\n        uint256[] memory supportedDisputeKits = new uint256[](1);\\n        supportedDisputeKits[0] = DISPUTE_KIT_CLASSIC;\\n        emit CourtCreated(\\n            GENERAL_COURT,\\n            court.parent,\\n            _hiddenVotes,\\n            _courtParameters[0],\\n            _courtParameters[1],\\n            _courtParameters[2],\\n            _courtParameters[3],\\n            _timesPerPeriod,\\n            supportedDisputeKits\\n        );\\n        _enableDisputeKit(GENERAL_COURT, DISPUTE_KIT_CLASSIC, true);\\n    }\\n\\n    // ************************************* //\\n    // *             Governance            * //\\n    // ************************************* //\\n\\n    /// @dev Access Control to perform implementation upgrades (UUPS Proxiable)\\n    ///      Only the owner can perform upgrades (`onlyByOwner`)\\n    function _authorizeUpgrade(address) internal view override onlyByOwner {\\n        // NOP\\n    }\\n\\n    /// @notice Pause staking and reward execution. Can only be done by guardian or owner.\\n    function pause() external onlyByGuardianOrOwner whenNotPaused {\\n        paused = true;\\n        emit Paused();\\n    }\\n\\n    /// @notice Unpause staking and reward execution. Can only be done by owner.\\n    function unpause() external onlyByOwner whenPaused {\\n        paused = false;\\n        emit Unpaused();\\n    }\\n\\n    /// @notice Allows the owner to call anything on behalf of the contract.\\n    /// @param _destination The destination of the call.\\n    /// @param _amount The value sent with the call.\\n    /// @param _data The data sent with the call.\\n    function executeOwnerProposal(address _destination, uint256 _amount, bytes memory _data) external onlyByOwner {\\n        (bool success, ) = _destination.call{value: _amount}(_data);\\n        if (!success) revert UnsuccessfulCall();\\n    }\\n\\n    /// @notice Changes the `owner` storage variable.\\n    /// @param _owner The new value for the `owner` storage variable.\\n    function changeOwner(address payable _owner) external onlyByOwner {\\n        owner = _owner;\\n    }\\n\\n    /// @notice Changes the `guardian` storage variable.\\n    /// @param _guardian The new value for the `guardian` storage variable.\\n    function changeGuardian(address _guardian) external onlyByOwner {\\n        guardian = _guardian;\\n    }\\n\\n    /// @notice Changes the `pinakion` storage variable.\\n    /// @param _pinakion The new value for the `pinakion` storage variable.\\n    function changePinakion(IERC20 _pinakion) external onlyByOwner {\\n        pinakion = _pinakion;\\n    }\\n\\n    /// @notice Changes the `jurorProsecutionModule` storage variable.\\n    /// @param _jurorProsecutionModule The new value for the `jurorProsecutionModule` storage variable.\\n    function changeJurorProsecutionModule(address _jurorProsecutionModule) external onlyByOwner {\\n        jurorProsecutionModule = _jurorProsecutionModule;\\n    }\\n\\n    /// @notice Changes the `_sortitionModule` storage variable.\\n    /// Note that the new module should be initialized for all courts.\\n    /// @param _sortitionModule The new value for the `sortitionModule` storage variable.\\n    function changeSortitionModule(ISortitionModule _sortitionModule) external onlyByOwner {\\n        sortitionModule = _sortitionModule;\\n    }\\n\\n    /// @notice Add a new supported dispute kit module to the court.\\n    /// @param _disputeKitAddress The address of the dispute kit contract.\\n    function addNewDisputeKit(IDisputeKit _disputeKitAddress) external onlyByOwner {\\n        uint256 disputeKitID = disputeKits.length;\\n        disputeKits.push(_disputeKitAddress);\\n        emit DisputeKitCreated(disputeKitID, _disputeKitAddress);\\n    }\\n\\n    /// @notice Creates a court under a specified parent court.\\n    /// @param _parent The `parent` property value of the court.\\n    /// @param _hiddenVotes The `hiddenVotes` property value of the court.\\n    /// @param _minStake The `minStake` property value of the court.\\n    /// @param _alpha The `alpha` property value of the court.\\n    /// @param _feeForJuror The `feeForJuror` property value of the court.\\n    /// @param _jurorsForCourtJump The `jurorsForCourtJump` property value of the court.\\n    /// @param _timesPerPeriod The `timesPerPeriod` property value of the court.\\n    /// @param _sortitionExtraData Extra data for sortition module.\\n    /// @param _supportedDisputeKits Indexes of dispute kits that this court will support.\\n    function createCourt(\\n        uint96 _parent,\\n        bool _hiddenVotes,\\n        uint256 _minStake,\\n        uint256 _alpha,\\n        uint256 _feeForJuror,\\n        uint256 _jurorsForCourtJump,\\n        uint256[4] memory _timesPerPeriod,\\n        bytes memory _sortitionExtraData,\\n        uint256[] memory _supportedDisputeKits\\n    ) external onlyByOwner {\\n        if (courts[_parent].minStake > _minStake) revert MinStakeLowerThanParentCourt();\\n        if (_supportedDisputeKits.length == 0) revert UnsupportedDisputeKit();\\n        if (_parent == FORKING_COURT) revert InvalidForkingCourtAsParent();\\n\\n        uint96 courtID = uint96(courts.length);\\n        Court storage court = courts.push();\\n\\n        for (uint256 i = 0; i < _supportedDisputeKits.length; i++) {\\n            if (_supportedDisputeKits[i] == 0 || _supportedDisputeKits[i] >= disputeKits.length) {\\n                revert WrongDisputeKitIndex();\\n            }\\n            _enableDisputeKit(uint96(courtID), _supportedDisputeKits[i], true);\\n        }\\n        // Check that Classic DK support was added.\\n        if (!court.supportedDisputeKits[DISPUTE_KIT_CLASSIC]) revert MustSupportDisputeKitClassic();\\n\\n        court.parent = _parent;\\n        court.children = new uint256[](0);\\n        court.hiddenVotes = _hiddenVotes;\\n        court.minStake = _minStake;\\n        court.alpha = _alpha;\\n        court.feeForJuror = _feeForJuror;\\n        court.jurorsForCourtJump = _jurorsForCourtJump;\\n        court.timesPerPeriod = _timesPerPeriod;\\n\\n        sortitionModule.createTree(courtID, _sortitionExtraData);\\n\\n        // Update the parent.\\n        courts[_parent].children.push(courtID);\\n        emit CourtCreated(\\n            uint96(courtID),\\n            _parent,\\n            _hiddenVotes,\\n            _minStake,\\n            _alpha,\\n            _feeForJuror,\\n            _jurorsForCourtJump,\\n            _timesPerPeriod,\\n            _supportedDisputeKits\\n        );\\n    }\\n\\n    /// @notice Changes the parameters of the court.\\n    /// @param _courtID ID of the court.\\n    /// @param _hiddenVotes The `hiddenVotes` property value of the court.\\n    /// @param _minStake The `minStake` property value of the court.\\n    /// @param _alpha The `alpha` property value of the court.\\n    /// @param _feeForJuror The `feeForJuror` property value of the court.\\n    /// @param _jurorsForCourtJump The `jurorsForCourtJump` property value of the court.\\n    /// @param _timesPerPeriod The `timesPerPeriod` property value of the court.\\n    function changeCourtParameters(\\n        uint96 _courtID,\\n        bool _hiddenVotes,\\n        uint256 _minStake,\\n        uint256 _alpha,\\n        uint256 _feeForJuror,\\n        uint256 _jurorsForCourtJump,\\n        uint256[4] memory _timesPerPeriod\\n    ) external onlyByOwner {\\n        Court storage court = courts[_courtID];\\n        if (_courtID != GENERAL_COURT && courts[court.parent].minStake > _minStake) {\\n            revert MinStakeLowerThanParentCourt();\\n        }\\n        for (uint256 i = 0; i < court.children.length; i++) {\\n            if (courts[court.children[i]].minStake < _minStake) {\\n                revert MinStakeLowerThanParentCourt();\\n            }\\n        }\\n        court.minStake = _minStake;\\n        court.hiddenVotes = _hiddenVotes;\\n        court.alpha = _alpha;\\n        court.feeForJuror = _feeForJuror;\\n        court.jurorsForCourtJump = _jurorsForCourtJump;\\n        court.timesPerPeriod = _timesPerPeriod;\\n        emit CourtModified(\\n            _courtID,\\n            _hiddenVotes,\\n            _minStake,\\n            _alpha,\\n            _feeForJuror,\\n            _jurorsForCourtJump,\\n            _timesPerPeriod\\n        );\\n    }\\n\\n    /// @notice Adds/removes court's support for specified dispute kits.\\n    /// @param _courtID The ID of the court.\\n    /// @param _disputeKitIDs The IDs of dispute kits which support should be added/removed.\\n    /// @param _enable Whether add or remove the dispute kits from the court.\\n    function enableDisputeKits(uint96 _courtID, uint256[] memory _disputeKitIDs, bool _enable) external onlyByOwner {\\n        for (uint256 i = 0; i < _disputeKitIDs.length; i++) {\\n            if (_enable) {\\n                if (_disputeKitIDs[i] == 0 || _disputeKitIDs[i] >= disputeKits.length) {\\n                    revert WrongDisputeKitIndex();\\n                }\\n                _enableDisputeKit(_courtID, _disputeKitIDs[i], true);\\n            } else {\\n                // Classic dispute kit must be supported by all courts.\\n                if (_disputeKitIDs[i] == DISPUTE_KIT_CLASSIC) {\\n                    revert CannotDisableClassicDK();\\n                }\\n                _enableDisputeKit(_courtID, _disputeKitIDs[i], false);\\n            }\\n        }\\n    }\\n\\n    /// @notice Changes the supported fee tokens.\\n    /// @param _feeToken The fee token.\\n    /// @param _accepted Whether the token is supported or not as a method of fee payment.\\n    function changeAcceptedFeeTokens(IERC20 _feeToken, bool _accepted) external onlyByOwner {\\n        currencyRates[_feeToken].feePaymentAccepted = _accepted;\\n        emit AcceptedFeeToken(_feeToken, _accepted);\\n    }\\n\\n    /// @notice Changes the currency rate of a fee token.\\n    /// @param _feeToken The fee token.\\n    /// @param _rateInEth The new rate of the fee token in ETH.\\n    /// @param _rateDecimals The new decimals of the fee token rate.\\n    function changeCurrencyRates(IERC20 _feeToken, uint64 _rateInEth, uint8 _rateDecimals) external onlyByOwner {\\n        currencyRates[_feeToken].rateInEth = _rateInEth;\\n        currencyRates[_feeToken].rateDecimals = _rateDecimals;\\n        emit NewCurrencyRate(_feeToken, _rateInEth, _rateDecimals);\\n    }\\n\\n    /// @notice Changes the `jurorNft` storage variable.\\n    /// @param _jurorNft The new value for the `jurorNft` storage variable.\\n    function changeJurorNft(IERC721 _jurorNft) external onlyByOwner {\\n        jurorNft = _jurorNft;\\n    }\\n\\n    /// @notice Adds or removes an arbitrable from whitelist.\\n    /// @param _arbitrable Arbitrable address.\\n    /// @param _allowed Whether add or remove permission.\\n    function changeArbitrableWhitelist(address _arbitrable, bool _allowed) external onlyByOwner {\\n        arbitrableWhitelist[_arbitrable] = _allowed;\\n    }\\n\\n    /// @notice Enables or disables the arbitrable whitelist.\\n    function changeArbitrableWhitelistEnabled(bool _enabled) external onlyByOwner {\\n        arbitrableWhitelistEnabled = _enabled;\\n    }\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @notice Sets the caller's stake in a court.\\n    /// @param _courtID The ID of the court.\\n    /// @param _newStake The new stake.\\n    /// Note that the existing delayed stake will be nullified as non-relevant.\\n    function setStake(uint96 _courtID, uint256 _newStake) external whenNotPaused {\\n        if (address(jurorNft) != address(0) && jurorNft.balanceOf(msg.sender) == 0) revert NotEligibleForStaking();\\n        _setStake(msg.sender, _courtID, _newStake, false, OnError.Revert);\\n    }\\n\\n    /// @notice Sets the stake of a specified account in a court without delaying stake changes, typically to apply a delayed stake or unstake inactive jurors.\\n    /// @param _account The account whose stake is being set.\\n    /// @param _courtID The ID of the court.\\n    /// @param _newStake The new stake.\\n    function setStakeBySortitionModule(address _account, uint96 _courtID, uint256 _newStake) external {\\n        if (msg.sender != address(sortitionModule)) revert SortitionModuleOnly();\\n        _setStake(_account, _courtID, _newStake, true, OnError.Return);\\n    }\\n\\n    /// @notice Transfers PNK to the juror by SortitionModule.\\n    /// @param _account The account of the juror whose PNK to transfer.\\n    /// @param _amount The amount to transfer.\\n    function transferBySortitionModule(address _account, uint256 _amount) external {\\n        if (msg.sender != address(sortitionModule)) revert SortitionModuleOnly();\\n        // Note eligibility is checked in SortitionModule.\\n        pinakion.safeTransfer(_account, _amount);\\n    }\\n\\n    /// @inheritdoc IArbitratorV2\\n    function createDispute(\\n        uint256 _numberOfChoices,\\n        bytes memory _extraData\\n    ) external payable override returns (uint256 disputeID) {\\n        if (msg.value < arbitrationCost(_extraData)) revert ArbitrationFeesNotEnough();\\n\\n        return _createDispute(_numberOfChoices, _extraData, NATIVE_CURRENCY, msg.value);\\n    }\\n\\n    /// @inheritdoc IArbitratorV2\\n    function createDispute(\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData,\\n        IERC20 _feeToken,\\n        uint256 _feeAmount\\n    ) external override returns (uint256 disputeID) {\\n        if (!currencyRates[_feeToken].feePaymentAccepted) revert TokenNotAccepted();\\n        if (_feeAmount < arbitrationCost(_extraData, _feeToken)) revert ArbitrationFeesNotEnough();\\n\\n        if (!_feeToken.safeTransferFrom(msg.sender, address(this), _feeAmount)) revert TransferFailed();\\n        return _createDispute(_numberOfChoices, _extraData, _feeToken, _feeAmount);\\n    }\\n\\n    function _createDispute(\\n        uint256 _numberOfChoices,\\n        bytes memory _extraData,\\n        IERC20 _feeToken,\\n        uint256 _feeAmount\\n    ) internal returns (uint256 disputeID) {\\n        if (arbitrableWhitelistEnabled && !arbitrableWhitelist[msg.sender]) revert ArbitrableNotWhitelisted();\\n        (uint96 courtID, , uint256 disputeKitID) = _extraDataToCourtIDMinJurorsDisputeKit(_extraData);\\n        if (!courts[courtID].supportedDisputeKits[disputeKitID]) revert DisputeKitNotSupportedByCourt();\\n\\n        disputeID = disputes.length;\\n        Dispute storage dispute = disputes.push();\\n        dispute.courtID = courtID;\\n        dispute.arbitrated = IArbitrableV2(msg.sender);\\n        dispute.lastPeriodChange = block.timestamp;\\n\\n        IDisputeKit disputeKit = disputeKits[disputeKitID];\\n        Court storage court = courts[courtID];\\n        Round storage round = dispute.rounds.push();\\n\\n        // Obtain the feeForJuror in the same currency as the _feeAmount\\n        uint256 feeForJuror = (_feeToken == NATIVE_CURRENCY)\\n            ? court.feeForJuror\\n            : convertEthToTokenAmount(_feeToken, court.feeForJuror);\\n        round.nbVotes = _feeAmount / feeForJuror;\\n        round.disputeKitID = disputeKitID;\\n        round.pnkAtStakePerJuror = _calculatePnkAtStake(court.minStake, court.alpha);\\n        round.totalFeesForJurors = _feeAmount;\\n        round.feeToken = IERC20(_feeToken);\\n\\n        sortitionModule.createDisputeHook(disputeID, 0); // Default round ID.\\n\\n        disputeKit.createDispute(disputeID, _numberOfChoices, _extraData, round.nbVotes);\\n        emit DisputeCreation(disputeID, IArbitrableV2(msg.sender));\\n    }\\n\\n    /// @notice Passes the period of a specified dispute.\\n    /// @param _disputeID The ID of the dispute.\\n    function passPeriod(uint256 _disputeID) external {\\n        Dispute storage dispute = disputes[_disputeID];\\n        Court storage court = courts[dispute.courtID];\\n\\n        uint256 currentRound = dispute.rounds.length - 1;\\n        Round storage round = dispute.rounds[currentRound];\\n        if (dispute.period == Period.evidence) {\\n            if (\\n                currentRound == 0 &&\\n                block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)]\\n            ) {\\n                revert EvidenceNotPassedAndNotAppeal();\\n            }\\n            if (round.drawnJurors.length != round.nbVotes) revert DisputeStillDrawing();\\n            dispute.period = court.hiddenVotes ? Period.commit : Period.vote;\\n        } else if (dispute.period == Period.commit) {\\n            // Note that we do not want to pass to Voting period if all the commits are cast because it breaks the Shutter auto-reveal currently.\\n            if (block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)]) {\\n                revert CommitPeriodNotPassed();\\n            }\\n            dispute.period = Period.vote;\\n        } else if (dispute.period == Period.vote) {\\n            if (\\n                block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)] &&\\n                !disputeKits[round.disputeKitID].areVotesAllCast(_disputeID)\\n            ) {\\n                revert VotePeriodNotPassed();\\n            }\\n            dispute.period = Period.appeal;\\n            emit AppealPossible(_disputeID, dispute.arbitrated);\\n        } else if (dispute.period == Period.appeal) {\\n            if (\\n                block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)] &&\\n                !disputeKits[round.disputeKitID].isAppealFunded(_disputeID)\\n            ) {\\n                revert AppealPeriodNotPassed();\\n            }\\n            dispute.period = Period.execution;\\n        } else if (dispute.period == Period.execution) {\\n            revert DisputePeriodIsFinal();\\n        }\\n\\n        dispute.lastPeriodChange = block.timestamp;\\n        emit NewPeriod(_disputeID, dispute.period);\\n    }\\n\\n    /// @notice Draws jurors for the dispute. Can be called in parts.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _iterations The number of iterations to run.\\n    /// @return nbDrawnJurors The total number of jurors drawn in the round.\\n    function draw(uint256 _disputeID, uint256 _iterations) external returns (uint256 nbDrawnJurors) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        uint256 currentRound = dispute.rounds.length - 1;\\n        Round storage round = dispute.rounds[currentRound];\\n        if (dispute.period != Period.evidence) revert NotEvidencePeriod();\\n\\n        IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n\\n        uint256 startIndex = round.drawIterations; // for gas: less storage reads\\n        uint256 i;\\n        while (i < _iterations && round.drawnJurors.length < round.nbVotes) {\\n            (address drawnAddress, uint96 fromSubcourtID) = disputeKit.draw(_disputeID, startIndex + i++);\\n            if (drawnAddress == address(0)) {\\n                continue;\\n            }\\n            sortitionModule.lockStake(drawnAddress, round.pnkAtStakePerJuror);\\n            emit Draw(drawnAddress, _disputeID, currentRound, round.drawnJurors.length);\\n            round.drawnJurors.push(drawnAddress);\\n            round.drawnJurorFromCourtIDs.push(fromSubcourtID != 0 ? fromSubcourtID : dispute.courtID);\\n            if (round.drawnJurors.length == round.nbVotes) {\\n                sortitionModule.postDrawHook(_disputeID, currentRound);\\n            }\\n        }\\n        round.drawIterations += i;\\n        return round.drawnJurors.length;\\n    }\\n\\n    /// @notice Appeals the ruling of a specified dispute.\\n    /// @dev Access restricted to the Dispute Kit for this `_disputeID`.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _numberOfChoices Number of choices for the dispute. Can be required during court jump.\\n    /// @param _extraData Extradata for the dispute. Can be required during court jump.\\n    function appeal(uint256 _disputeID, uint256 _numberOfChoices, bytes memory _extraData) external payable {\\n        if (msg.value < appealCost(_disputeID)) revert AppealFeesNotEnough();\\n\\n        Dispute storage dispute = disputes[_disputeID];\\n        if (dispute.period != Period.appeal) revert DisputeNotAppealable();\\n\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        if (msg.sender != address(disputeKits[round.disputeKitID])) revert DisputeKitOnly();\\n\\n        // Warning: the extra round must be created before calling disputeKit.createDispute()\\n        Round storage extraRound = dispute.rounds.push();\\n\\n        (uint96 newCourtID, uint256 newDisputeKitID, bool courtJump, ) = _getCourtAndDisputeKitJumps(\\n            dispute,\\n            round,\\n            courts[dispute.courtID],\\n            _disputeID\\n        );\\n        if (courtJump) {\\n            emit CourtJump(_disputeID, dispute.rounds.length - 1, dispute.courtID, newCourtID);\\n        }\\n\\n        dispute.courtID = newCourtID;\\n        dispute.period = Period.evidence;\\n        dispute.lastPeriodChange = block.timestamp;\\n\\n        Court storage court = courts[newCourtID];\\n        extraRound.nbVotes = msg.value / court.feeForJuror; // As many votes that can be afforded by the provided funds.\\n        extraRound.pnkAtStakePerJuror = _calculatePnkAtStake(court.minStake, court.alpha);\\n        extraRound.totalFeesForJurors = msg.value;\\n        extraRound.disputeKitID = newDisputeKitID;\\n\\n        sortitionModule.createDisputeHook(_disputeID, dispute.rounds.length - 1);\\n\\n        // Dispute kit was changed, so create a dispute in the new DK contract.\\n        if (extraRound.disputeKitID != round.disputeKitID) {\\n            emit DisputeKitJump(_disputeID, dispute.rounds.length - 1, round.disputeKitID, extraRound.disputeKitID);\\n            disputeKits[extraRound.disputeKitID].createDispute(\\n                _disputeID,\\n                _numberOfChoices,\\n                _extraData,\\n                extraRound.nbVotes\\n            );\\n        }\\n\\n        emit AppealDecision(_disputeID, dispute.arbitrated);\\n        emit NewPeriod(_disputeID, Period.evidence);\\n    }\\n\\n    /// @notice Distribute the PNKs at stake and the dispute fees for the specific round of the dispute. Can be called in parts.\\n    /// @dev Reward distributions are forbidden during pause.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _round The appeal round.\\n    /// @param _iterations The number of iterations to run.\\n    function execute(uint256 _disputeID, uint256 _round, uint256 _iterations) external whenNotPaused {\\n        Round storage round;\\n        {\\n            Dispute storage dispute = disputes[_disputeID];\\n            if (dispute.period != Period.execution) revert NotExecutionPeriod();\\n\\n            round = dispute.rounds[_round];\\n        } // stack too deep workaround\\n\\n        uint256 start = round.repartitions;\\n        uint256 end = round.repartitions + _iterations;\\n\\n        uint256 pnkPenaltiesInRound = round.pnkPenalties; // Keep in memory to save gas.\\n        uint256 numberOfVotesInRound = round.drawnJurors.length;\\n        uint256 feePerJurorInRound = round.totalFeesForJurors / numberOfVotesInRound;\\n        uint256 pnkAtStakePerJurorInRound = round.pnkAtStakePerJuror;\\n        uint256 coherentCount;\\n        {\\n            IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n            coherentCount = disputeKit.getCoherentCount(_disputeID, _round); // Total number of jurors that are eligible to a reward in this round.\\n        } // stack too deep workaround\\n\\n        if (coherentCount == 0) {\\n            // We loop over the votes once as there are no rewards because it is not a tie and no one in this round is coherent with the final outcome.\\n            if (end > numberOfVotesInRound) end = numberOfVotesInRound;\\n        } else {\\n            // We loop over the votes twice, first to collect the PNK penalties, and second to distribute them as rewards along with arbitration fees.\\n            if (end > numberOfVotesInRound * 2) end = numberOfVotesInRound * 2;\\n        }\\n        round.repartitions = end;\\n\\n        for (uint256 i = start; i < end; i++) {\\n            if (i < numberOfVotesInRound) {\\n                pnkPenaltiesInRound = _executePenalties(\\n                    ExecuteParams({\\n                        disputeID: _disputeID,\\n                        round: _round,\\n                        coherentCount: coherentCount,\\n                        numberOfVotesInRound: numberOfVotesInRound,\\n                        feePerJurorInRound: feePerJurorInRound,\\n                        pnkAtStakePerJurorInRound: pnkAtStakePerJurorInRound,\\n                        pnkPenaltiesInRound: pnkPenaltiesInRound,\\n                        repartition: i\\n                    })\\n                );\\n            } else {\\n                _executeRewards(\\n                    ExecuteParams({\\n                        disputeID: _disputeID,\\n                        round: _round,\\n                        coherentCount: coherentCount,\\n                        numberOfVotesInRound: numberOfVotesInRound,\\n                        feePerJurorInRound: feePerJurorInRound,\\n                        pnkAtStakePerJurorInRound: pnkAtStakePerJurorInRound,\\n                        pnkPenaltiesInRound: pnkPenaltiesInRound,\\n                        repartition: i\\n                    })\\n                );\\n            }\\n        }\\n        if (round.pnkPenalties != pnkPenaltiesInRound) {\\n            round.pnkPenalties = pnkPenaltiesInRound; // Note: Check-Effect-Interaction pattern is compromised here, but in the current state it doesn't cause any issues.\\n        }\\n    }\\n\\n    /// @notice Distribute the PNKs at stake and the dispute fees for the specific round of the dispute, penalties only.\\n    /// @param _params The parameters for the execution, see `ExecuteParams`.\\n    /// @return pnkPenaltiesInRoundCache The updated penalties in round cache.\\n    function _executePenalties(ExecuteParams memory _params) internal returns (uint256) {\\n        Dispute storage dispute = disputes[_params.disputeID];\\n        Round storage round = dispute.rounds[_params.round];\\n        IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n\\n        // [0, 1] value that determines how coherent the juror was in this round, in basis points.\\n        uint256 coherence = disputeKit.getDegreeOfCoherencePenalty(\\n            _params.disputeID,\\n            _params.round,\\n            _params.repartition,\\n            _params.feePerJurorInRound,\\n            _params.pnkAtStakePerJurorInRound\\n        );\\n\\n        // Extra check to guard against degree exceeding 1, though it should be ensured by the dispute kit.\\n        if (coherence > ONE_BASIS_POINT) {\\n            coherence = ONE_BASIS_POINT;\\n        }\\n\\n        // Fully coherent jurors won't be penalized.\\n        uint256 penalty = (round.pnkAtStakePerJuror * (ONE_BASIS_POINT - coherence)) / ONE_BASIS_POINT;\\n\\n        // Unlock the PNKs affected by the penalty\\n        address account = round.drawnJurors[_params.repartition];\\n        sortitionModule.unlockStake(account, penalty);\\n\\n        // Apply the penalty to the staked PNKs.\\n        uint96 penalizedInCourtID = round.drawnJurorFromCourtIDs[_params.repartition];\\n        (uint256 pnkBalance, uint256 newCourtStake, uint256 availablePenalty) = sortitionModule.setStakePenalty(\\n            account,\\n            penalizedInCourtID,\\n            penalty\\n        );\\n        if (availablePenalty != 0) {\\n            _params.pnkPenaltiesInRound += availablePenalty;\\n            emit JurorRewardPenalty(\\n                account,\\n                _params.disputeID,\\n                _params.round,\\n                coherence,\\n                0,\\n                -int256(availablePenalty),\\n                0,\\n                round.feeToken\\n            );\\n        }\\n\\n        if (pnkBalance == 0 || !disputeKit.isVoteActive(_params.disputeID, _params.round, _params.repartition)) {\\n            // The juror is inactive or their balance is can't cover penalties anymore, unstake them from all courts.\\n            sortitionModule.forcedUnstakeAllCourts(account);\\n        } else if (newCourtStake < courts[penalizedInCourtID].minStake) {\\n            // The juror's balance fell below the court minStake, unstake them from the court.\\n            sortitionModule.forcedUnstake(account, penalizedInCourtID);\\n        }\\n\\n        if (_params.repartition == _params.numberOfVotesInRound - 1 && _params.coherentCount == 0) {\\n            // No one was coherent, send the rewards to the owner.\\n            _transferFeeToken(round.feeToken, payable(owner), round.totalFeesForJurors);\\n            pinakion.safeTransfer(owner, _params.pnkPenaltiesInRound);\\n            emit LeftoverRewardSent(\\n                _params.disputeID,\\n                _params.round,\\n                _params.pnkPenaltiesInRound,\\n                round.totalFeesForJurors,\\n                round.feeToken\\n            );\\n        }\\n        return _params.pnkPenaltiesInRound;\\n    }\\n\\n    /// @notice Distribute the PNKs at stake and the dispute fees for the specific round of the dispute, rewards only.\\n    /// @param _params The parameters for the execution, see `ExecuteParams`.\\n    function _executeRewards(ExecuteParams memory _params) internal {\\n        Dispute storage dispute = disputes[_params.disputeID];\\n        Round storage round = dispute.rounds[_params.round];\\n        IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n\\n        // [0, 1] value that determines how coherent the juror was in this round, in basis points.\\n        (uint256 pnkCoherence, uint256 feeCoherence) = disputeKit.getDegreeOfCoherenceReward(\\n            _params.disputeID,\\n            _params.round,\\n            _params.repartition % _params.numberOfVotesInRound,\\n            _params.feePerJurorInRound,\\n            _params.pnkAtStakePerJurorInRound\\n        );\\n\\n        // Extra check to guard against degree exceeding 1, though it should be ensured by the dispute kit.\\n        if (pnkCoherence > ONE_BASIS_POINT) {\\n            pnkCoherence = ONE_BASIS_POINT;\\n        }\\n        if (feeCoherence > ONE_BASIS_POINT) {\\n            feeCoherence = ONE_BASIS_POINT;\\n        }\\n\\n        address account = round.drawnJurors[_params.repartition % _params.numberOfVotesInRound];\\n        uint256 pnkLocked = _applyCoherence(round.pnkAtStakePerJuror, pnkCoherence);\\n\\n        // Release the rest of the PNKs of the juror for this round.\\n        sortitionModule.unlockStake(account, pnkLocked);\\n\\n        // Compute the rewards\\n        uint256 pnkReward = _applyCoherence(_params.pnkPenaltiesInRound / _params.coherentCount, pnkCoherence);\\n        round.sumPnkRewardPaid += pnkReward;\\n        uint256 feeReward = _applyCoherence(round.totalFeesForJurors / _params.coherentCount, feeCoherence);\\n        round.sumFeeRewardPaid += feeReward;\\n\\n        if (feeReward != 0) {\\n            // Transfer the fee reward\\n            _transferFeeToken(round.feeToken, payable(account), feeReward);\\n        }\\n        if (pnkReward != 0) {\\n            // Stake the PNK reward if possible, bypasses delayed stakes and other checks done by validateStake()\\n            if (!sortitionModule.setStakeReward(account, dispute.courtID, pnkReward)) {\\n                pinakion.safeTransfer(account, pnkReward);\\n            }\\n        }\\n        if (pnkReward != 0 || feeReward != 0) {\\n            emit JurorRewardPenalty(\\n                account,\\n                _params.disputeID,\\n                _params.round,\\n                pnkCoherence,\\n                feeCoherence,\\n                int256(pnkReward),\\n                int256(feeReward),\\n                round.feeToken\\n            );\\n        }\\n\\n        // Transfer any residual rewards to the owner. It may happen due to partial coherence of the jurors.\\n        if (_params.repartition == _params.numberOfVotesInRound * 2 - 1) {\\n            uint256 leftoverPnkReward = _params.pnkPenaltiesInRound - round.sumPnkRewardPaid;\\n            uint256 leftoverFeeReward = round.totalFeesForJurors - round.sumFeeRewardPaid;\\n            if (leftoverPnkReward != 0 || leftoverFeeReward != 0) {\\n                if (leftoverPnkReward != 0) {\\n                    pinakion.safeTransfer(owner, leftoverPnkReward);\\n                }\\n                if (leftoverFeeReward != 0) {\\n                    _transferFeeToken(round.feeToken, payable(owner), leftoverFeeReward);\\n                }\\n                emit LeftoverRewardSent(\\n                    _params.disputeID,\\n                    _params.round,\\n                    leftoverPnkReward,\\n                    leftoverFeeReward,\\n                    round.feeToken\\n                );\\n            }\\n        }\\n    }\\n\\n    /// @notice Executes a specified dispute's ruling.\\n    /// @param _disputeID The ID of the dispute.\\n    function executeRuling(uint256 _disputeID) external {\\n        Dispute storage dispute = disputes[_disputeID];\\n        if (dispute.period != Period.execution) revert NotExecutionPeriod();\\n        if (dispute.ruled) revert RulingAlreadyExecuted();\\n\\n        (uint256 winningChoice, , ) = currentRuling(_disputeID);\\n        dispute.ruled = true;\\n        emit Ruling(dispute.arbitrated, _disputeID, winningChoice);\\n        dispute.arbitrated.rule(_disputeID, winningChoice);\\n    }\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /// @inheritdoc IArbitratorV2\\n    function arbitrationCost(bytes memory _extraData) public view override returns (uint256 cost) {\\n        (uint96 courtID, uint256 minJurors, ) = _extraDataToCourtIDMinJurorsDisputeKit(_extraData);\\n        cost = courts[courtID].feeForJuror * minJurors;\\n    }\\n\\n    /// @inheritdoc IArbitratorV2\\n    function arbitrationCost(bytes calldata _extraData, IERC20 _feeToken) public view override returns (uint256 cost) {\\n        cost = convertEthToTokenAmount(_feeToken, arbitrationCost(_extraData));\\n    }\\n\\n    /// @notice Gets the cost of appealing a specified dispute.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return cost The appeal cost.\\n    function appealCost(uint256 _disputeID) public view returns (uint256 cost) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        Court storage court = courts[dispute.courtID];\\n\\n        (, uint256 newDisputeKitID, bool courtJump, ) = _getCourtAndDisputeKitJumps(dispute, round, court, _disputeID);\\n\\n        uint256 nbVotesAfterAppeal = disputeKits[newDisputeKitID].getNbVotesAfterAppeal(\\n            disputeKits[round.disputeKitID],\\n            round.nbVotes\\n        );\\n\\n        if (courtJump) {\\n            // Jump to parent court.\\n            if (dispute.courtID == GENERAL_COURT) {\\n                // TODO: Handle the forking when appealed in General court.\\n                cost = NON_PAYABLE_AMOUNT; // Get the cost of the parent court.\\n            } else {\\n                cost = courts[court.parent].feeForJuror * nbVotesAfterAppeal;\\n            }\\n        } else {\\n            // Stay in current court.\\n            cost = court.feeForJuror * nbVotesAfterAppeal;\\n        }\\n    }\\n\\n    /// @notice Gets the start and the end of a specified dispute's current appeal period.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return start The start of the appeal period.\\n    /// @return end The end of the appeal period.\\n    function appealPeriod(uint256 _disputeID) external view returns (uint256 start, uint256 end) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        if (dispute.period == Period.appeal) {\\n            start = dispute.lastPeriodChange;\\n            end = dispute.lastPeriodChange + courts[dispute.courtID].timesPerPeriod[uint256(Period.appeal)];\\n        } else {\\n            start = 0;\\n            end = 0;\\n        }\\n    }\\n\\n    /// @inheritdoc IArbitratorV2\\n    function currentRuling(uint256 _disputeID) public view returns (uint256 ruling, bool tied, bool overridden) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n        (ruling, tied, overridden) = disputeKit.currentRuling(_disputeID);\\n    }\\n\\n    /// @notice Gets the round info for a specified dispute and round.\\n    /// @dev This function must not be called from a non-view function because it returns a dynamic array which might be very large, theoretically exceeding the block gas limit.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _round The round to get the info for.\\n    /// @return round The round info.\\n    function getRoundInfo(uint256 _disputeID, uint256 _round) external view returns (Round memory) {\\n        return disputes[_disputeID].rounds[_round];\\n    }\\n\\n    /// @notice Gets the PNK at stake per juror for a specified dispute and round.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _round The round to get the info for.\\n    /// @return pnkAtStakePerJuror The PNK at stake per juror.\\n    function getPnkAtStakePerJuror(uint256 _disputeID, uint256 _round) external view returns (uint256) {\\n        return disputes[_disputeID].rounds[_round].pnkAtStakePerJuror;\\n    }\\n\\n    /// @notice Gets the number of rounds for a specified dispute.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return The number of rounds.\\n    function getNumberOfRounds(uint256 _disputeID) external view returns (uint256) {\\n        return disputes[_disputeID].rounds.length;\\n    }\\n\\n    /// @notice Checks if a given dispute kit is supported by a given court.\\n    /// @param _courtID The ID of the court to check the support for.\\n    /// @param _disputeKitID The ID of the dispute kit to check the support for.\\n    /// @return Whether the dispute kit is supported or not.\\n    function isSupported(uint96 _courtID, uint256 _disputeKitID) external view returns (bool) {\\n        return courts[_courtID].supportedDisputeKits[_disputeKitID];\\n    }\\n\\n    /// @notice Gets the timesPerPeriod array for a given court.\\n    /// @param _courtID The ID of the court to get the times from.\\n    /// @return timesPerPeriod The timesPerPeriod array for the given court.\\n    function getTimesPerPeriod(uint96 _courtID) external view returns (uint256[4] memory timesPerPeriod) {\\n        timesPerPeriod = courts[_courtID].timesPerPeriod;\\n    }\\n\\n    // ************************************* //\\n    // *   Public Views for Dispute Kits   * //\\n    // ************************************* //\\n\\n    /// @notice Gets the number of votes permitted for the specified dispute in the latest round.\\n    /// @param _disputeID The ID of the dispute.\\n    function getNumberOfVotes(uint256 _disputeID) external view returns (uint256) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        return dispute.rounds[dispute.rounds.length - 1].nbVotes;\\n    }\\n\\n    /// @notice Returns true if the dispute kit will be switched to a parent DK.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return Whether DK will be switched or not.\\n    function isDisputeKitJumping(uint256 _disputeID) external view returns (bool) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        Court storage court = courts[dispute.courtID];\\n\\n        if (!_isCourtJumping(round, court, _disputeID)) {\\n            return false;\\n        }\\n\\n        // Jump if the parent court doesn't support the current DK.\\n        return !courts[court.parent].supportedDisputeKits[round.disputeKitID];\\n    }\\n\\n    /// @notice Returns the length of disputeKits array.\\n    /// @return disputeKits length.\\n    function getDisputeKitsLength() external view returns (uint256) {\\n        return disputeKits.length;\\n    }\\n\\n    /// @notice Converts ETH into tokens.\\n    /// @param _toToken The token to convert ETH into.\\n    /// @param _amountInEth ETH amount.\\n    /// @return Amount of tokens.\\n    function convertEthToTokenAmount(IERC20 _toToken, uint256 _amountInEth) public view returns (uint256) {\\n        return (_amountInEth * 10 ** currencyRates[_toToken].rateDecimals) / currencyRates[_toToken].rateInEth;\\n    }\\n\\n    // ************************************* //\\n    // *            Internal               * //\\n    // ************************************* //\\n\\n    /// @notice Returns true if the round is jumping to a parent court.\\n    /// @param _round The round to check.\\n    /// @param _court The court to check.\\n    /// @return Whether the round is jumping to a parent court or not.\\n    function _isCourtJumping(\\n        Round storage _round,\\n        Court storage _court,\\n        uint256 _disputeID\\n    ) internal view returns (bool) {\\n        return\\n            disputeKits[_round.disputeKitID].earlyCourtJump(_disputeID) || _round.nbVotes >= _court.jurorsForCourtJump;\\n    }\\n\\n    /// @notice Checks whether a dispute will jump to new court/DK, and returns new court and DK.\\n    /// @param _dispute Dispute data.\\n    /// @param _round Round ID.\\n    /// @param _court Current court ID.\\n    /// @param _disputeID Dispute ID.\\n    /// @return newCourtID Court ID after jump.\\n    /// @return newDisputeKitID Dispute kit ID after jump.\\n    /// @return courtJump Whether the dispute jumps to a new court or not.\\n    /// @return disputeKitJump Whether the dispute jumps to a new dispute kit or not.\\n    function _getCourtAndDisputeKitJumps(\\n        Dispute storage _dispute,\\n        Round storage _round,\\n        Court storage _court,\\n        uint256 _disputeID\\n    ) internal view returns (uint96 newCourtID, uint256 newDisputeKitID, bool courtJump, bool disputeKitJump) {\\n        newCourtID = _dispute.courtID;\\n        newDisputeKitID = _round.disputeKitID;\\n\\n        if (!_isCourtJumping(_round, _court, _disputeID)) return (newCourtID, newDisputeKitID, false, false);\\n\\n        // Jump to parent court.\\n        newCourtID = courts[newCourtID].parent;\\n        courtJump = true;\\n\\n        if (!courts[newCourtID].supportedDisputeKits[newDisputeKitID]) {\\n            // The current Dispute Kit is not compatible with the new court, jump to another Dispute Kit.\\n            newDisputeKitID = disputeKits[_round.disputeKitID].getJumpDisputeKitID();\\n            if (newDisputeKitID == NULL_DISPUTE_KIT || !courts[newCourtID].supportedDisputeKits[newDisputeKitID]) {\\n                // The new Dispute Kit is not defined or still not compatible, fall back to `DisputeKitClassic` which is always supported.\\n                newDisputeKitID = DISPUTE_KIT_CLASSIC;\\n            }\\n            disputeKitJump = true;\\n        }\\n    }\\n\\n    /// @notice Internal function to transfer fee tokens (ETH or ERC20)\\n    /// @param _feeToken The token to transfer (NATIVE_CURRENCY for ETH).\\n    /// @param _recipient The recipient address.\\n    /// @param _amount The amount to transfer.\\n    function _transferFeeToken(IERC20 _feeToken, address payable _recipient, uint256 _amount) internal {\\n        if (_feeToken == NATIVE_CURRENCY) {\\n            _recipient.safeSend(_amount, wNative);\\n        } else {\\n            _feeToken.safeTransfer(_recipient, _amount);\\n        }\\n    }\\n\\n    /// @notice Applies degree of coherence to an amount\\n    /// @param _amount The base amount to apply coherence to.\\n    /// @param _coherence The degree of coherence in basis points.\\n    /// @return The amount after applying the degree of coherence.\\n    function _applyCoherence(uint256 _amount, uint256 _coherence) internal pure returns (uint256) {\\n        return (_amount * _coherence) / ONE_BASIS_POINT;\\n    }\\n\\n    /// @notice Calculates PNK at stake per juror based on court parameters\\n    /// @param _minStake The minimum stake for the court.\\n    /// @param _alpha The alpha parameter for the court in basis points.\\n    /// @return The amount of PNK at stake per juror.\\n    function _calculatePnkAtStake(uint256 _minStake, uint256 _alpha) internal pure returns (uint256) {\\n        return (_minStake * _alpha) / ONE_BASIS_POINT;\\n    }\\n\\n    /// @notice Toggles the dispute kit support for a given court.\\n    /// @param _courtID The ID of the court to toggle the support for.\\n    /// @param _disputeKitID The ID of the dispute kit to toggle the support for.\\n    /// @param _enable Whether to enable or disable the support. Note that classic dispute kit should always be enabled.\\n    function _enableDisputeKit(uint96 _courtID, uint256 _disputeKitID, bool _enable) internal {\\n        courts[_courtID].supportedDisputeKits[_disputeKitID] = _enable;\\n        emit DisputeKitEnabled(_courtID, _disputeKitID, _enable);\\n    }\\n\\n    /// @notice If called only once then set _onError to Revert, otherwise set it to Return\\n    /// @param _account The account to set the stake for.\\n    /// @param _courtID The ID of the court to set the stake for.\\n    /// @param _newStake The new stake.\\n    /// @param _noDelay True if the stake change should not be delayed.\\n    /// @param _onError Whether to revert or return false on error.\\n    /// @return Whether the stake was successfully set or not.\\n    function _setStake(\\n        address _account,\\n        uint96 _courtID,\\n        uint256 _newStake,\\n        bool _noDelay,\\n        OnError _onError\\n    ) internal returns (bool) {\\n        if (_courtID == FORKING_COURT || _courtID >= courts.length) {\\n            _stakingFailed(_onError, StakingResult.CannotStakeInThisCourt); // Staking directly into the forking court is not allowed.\\n            return false;\\n        }\\n        if (_newStake != 0 && _newStake < courts[_courtID].minStake) {\\n            _stakingFailed(_onError, StakingResult.CannotStakeLessThanMinStake); // Staking less than the minimum stake is not allowed.\\n            return false;\\n        }\\n        (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult) = sortitionModule.validateStake(\\n            _account,\\n            _courtID,\\n            _newStake,\\n            _noDelay\\n        );\\n        if (stakingResult != StakingResult.Successful && stakingResult != StakingResult.Delayed) {\\n            _stakingFailed(_onError, stakingResult);\\n            return false;\\n        } else if (stakingResult == StakingResult.Delayed) {\\n            return true;\\n        }\\n        if (pnkDeposit > 0) {\\n            if (!pinakion.safeTransferFrom(_account, address(this), pnkDeposit)) {\\n                _stakingFailed(_onError, StakingResult.StakingTransferFailed);\\n                return false;\\n            }\\n        }\\n        if (pnkWithdrawal > 0) {\\n            if (!pinakion.safeTransfer(_account, pnkWithdrawal)) {\\n                _stakingFailed(_onError, StakingResult.UnstakingTransferFailed);\\n                return false;\\n            }\\n        }\\n        sortitionModule.setStake(_account, _courtID, pnkDeposit, pnkWithdrawal, _newStake);\\n\\n        return true;\\n    }\\n\\n    /// @notice It may revert depending on the _onError parameter.\\n    function _stakingFailed(OnError _onError, StakingResult _result) internal pure {\\n        if (_onError == OnError.Return) return;\\n        if (_result == StakingResult.StakingTransferFailed) revert StakingTransferFailed();\\n        if (_result == StakingResult.UnstakingTransferFailed) revert UnstakingTransferFailed();\\n        if (_result == StakingResult.CannotStakeInMoreCourts) revert StakingInTooManyCourts();\\n        if (_result == StakingResult.CannotStakeInThisCourt) revert StakingNotPossibleInThisCourt();\\n        if (_result == StakingResult.CannotStakeLessThanMinStake) revert StakingLessThanCourtMinStake();\\n        if (_result == StakingResult.CannotStakeZeroWhenNoStake) revert StakingZeroWhenNoStake();\\n        if (_result == StakingResult.CannotStakeMoreThanMaxStakePerJuror) revert StakingMoreThanMaxStakePerJuror();\\n        if (_result == StakingResult.CannotStakeMoreThanMaxTotalStaked) revert StakingMoreThanMaxTotalStaked();\\n    }\\n\\n    /// @notice Gets a court ID, the minimum number of jurors and an ID of a dispute kit from a specified extra data bytes array.\\n    /// @dev If `_extraData` contains an incorrect value then this value will be switched to default.\\n    /// @param _extraData The extra data bytes array. The first 32 bytes are the court ID, the next are the minimum number of jurors and the last are the dispute kit ID.\\n    /// @return courtID The court ID.\\n    /// @return minJurors The minimum number of jurors required.\\n    /// @return disputeKitID The ID of the dispute kit.\\n    function _extraDataToCourtIDMinJurorsDisputeKit(\\n        bytes memory _extraData\\n    ) internal view returns (uint96 courtID, uint256 minJurors, uint256 disputeKitID) {\\n        // Note that if the extradata doesn't contain 32 bytes for the dispute kit ID it'll return the default 0 index.\\n        if (_extraData.length >= 64) {\\n            assembly {\\n                // solium-disable-line security/no-inline-assembly\\n                courtID := mload(add(_extraData, 0x20))\\n                minJurors := mload(add(_extraData, 0x40))\\n                disputeKitID := mload(add(_extraData, 0x60))\\n            }\\n            if (courtID == FORKING_COURT || courtID >= courts.length) {\\n                courtID = GENERAL_COURT;\\n            }\\n            if (minJurors == 0) {\\n                minJurors = DEFAULT_NB_OF_JURORS;\\n            }\\n            if (disputeKitID == NULL_DISPUTE_KIT || disputeKitID >= disputeKits.length) {\\n                disputeKitID = DISPUTE_KIT_CLASSIC; // 0 index is not used.\\n            }\\n        } else {\\n            courtID = GENERAL_COURT;\\n            minJurors = DEFAULT_NB_OF_JURORS;\\n            disputeKitID = DISPUTE_KIT_CLASSIC;\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *              Errors               * //\\n    // ************************************* //\\n\\n    error OwnerOnly();\\n    error GuardianOrOwnerOnly();\\n    error DisputeKitOnly();\\n    error SortitionModuleOnly();\\n    error UnsuccessfulCall();\\n    error InvalidDisputKitParent();\\n    error MinStakeLowerThanParentCourt();\\n    error UnsupportedDisputeKit();\\n    error InvalidForkingCourtAsParent();\\n    error WrongDisputeKitIndex();\\n    error CannotDisableClassicDK();\\n    error NotEligibleForStaking();\\n    error StakingMoreThanMaxStakePerJuror();\\n    error StakingMoreThanMaxTotalStaked();\\n    error StakingInTooManyCourts();\\n    error StakingNotPossibleInThisCourt();\\n    error StakingLessThanCourtMinStake();\\n    error StakingTransferFailed();\\n    error UnstakingTransferFailed();\\n    error ArbitrableNotWhitelisted();\\n    error ArbitrationFeesNotEnough();\\n    error DisputeKitNotSupportedByCourt();\\n    error MustSupportDisputeKitClassic();\\n    error TokenNotAccepted();\\n    error EvidenceNotPassedAndNotAppeal();\\n    error DisputeStillDrawing();\\n    error CommitPeriodNotPassed();\\n    error VotePeriodNotPassed();\\n    error AppealPeriodNotPassed();\\n    error NotEvidencePeriod();\\n    error AppealFeesNotEnough();\\n    error DisputeNotAppealable();\\n    error NotExecutionPeriod();\\n    error RulingAlreadyExecuted();\\n    error DisputePeriodIsFinal();\\n    error TransferFailed();\\n    error WhenNotPausedOnly();\\n    error WhenPausedOnly();\\n    error StakingZeroWhenNoStake();\\n}\\n\",\"keccak256\":\"0xcb6d1b26b8a595effc86f8d19a42aef42a20c23c28d361b084c62e0a332e3cf3\",\"license\":\"MIT\"},\"src/arbitration/dispute-kits/DisputeKitClassic.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\nimport {DisputeKitClassicBase, KlerosCore} from \\\"./DisputeKitClassicBase.sol\\\";\\n\\n/// @title DisputeKitClassic\\n/// @notice Dispute kit implementation of the Kleros v1 features including:\\n/// - a drawing system: proportional to staked PNK,\\n/// - a vote aggregation system: plurality,\\n/// - an incentive system: equal split between coherent votes,\\n/// - an appeal system: fund 2 choices only, vote on any choice.\\ncontract DisputeKitClassic is DisputeKitClassicBase {\\n    string public constant override version = \\\"2.0.0\\\";\\n\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    /// @custom:oz-upgrades-unsafe-allow constructor\\n    constructor() {\\n        _disableInitializers();\\n    }\\n\\n    /// @notice Initializer.\\n    /// @param _owner The owner's address.\\n    /// @param _core The KlerosCore arbitrator.\\n    /// @param _wNative The wrapped native token address, typically wETH.\\n    /// @param _jumpDisputeKitID The ID of the dispute kit to switch to after the court jump.\\n    function initialize(\\n        address _owner,\\n        KlerosCore _core,\\n        address _wNative,\\n        uint256 _jumpDisputeKitID\\n    ) external initializer {\\n        __DisputeKitClassicBase_initialize(_owner, _core, _wNative, _jumpDisputeKitID);\\n    }\\n\\n    // ************************ //\\n    // *      Governance      * //\\n    // ************************ //\\n\\n    /// @dev Access Control to perform implementation upgrades (UUPS Proxiable)\\n    ///      Only the owner can perform upgrades (`onlyByOwner`)\\n    function _authorizeUpgrade(address) internal view override onlyByOwner {\\n        // NOP\\n    }\\n}\\n\",\"keccak256\":\"0xf87fdd5b448a31b915bd881760a7c1ac1ad697d051d1357b5831476125256237\",\"license\":\"MIT\"},\"src/arbitration/dispute-kits/DisputeKitClassicBase.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\nimport {KlerosCore, IDisputeKit, ISortitionModule} from \\\"../KlerosCore.sol\\\";\\nimport {Initializable} from \\\"../../proxy/Initializable.sol\\\";\\nimport {UUPSProxiable} from \\\"../../proxy/UUPSProxiable.sol\\\";\\nimport {SafeSend} from \\\"../../libraries/SafeSend.sol\\\";\\nimport {ONE_BASIS_POINT, DISPUTE_KIT_CLASSIC} from \\\"../../libraries/Constants.sol\\\";\\n\\n/// @title DisputeKitClassicBase\\n/// @notice Abstract Dispute kit classic implementation of the Kleros v1 features including:\\n/// - a drawing system: proportional to staked PNK,\\n/// - a vote aggregation system: plurality,\\n/// - an incentive system: equal split between coherent votes,\\n/// - an appeal system: fund 2 choices only, vote on any choice.\\nabstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxiable {\\n    using SafeSend for address payable;\\n\\n    // ************************************* //\\n    // *             Structs               * //\\n    // ************************************* //\\n\\n    struct Dispute {\\n        Round[] rounds; // Rounds of the dispute. 0 is the default round, and [1, ..n] are the appeal rounds.\\n        uint256 numberOfChoices; // The number of choices jurors have when voting. This does not include choice `0` which is reserved for \\\"refuse to arbitrate\\\".\\n        bool jumped; // True if dispute jumped to a parent dispute kit and won't be handled by this DK anymore.\\n        mapping(uint256 => uint256) coreRoundIDToLocal; // Maps id of the round in the core contract to the index of the round of related local dispute.\\n        bytes extraData; // Extradata for the dispute.\\n        uint256[10] __gap; // Reserved slots for future upgrades.\\n    }\\n\\n    struct Round {\\n        Vote[] votes; // Former votes[_appeal][].\\n        uint256 winningChoice; // The choice with the most votes. Note that in the case of a tie, it is the choice that reached the tied number of votes first.\\n        mapping(uint256 => uint256) counts; // The sum of votes for each choice in the form `counts[choice]`.\\n        bool tied; // True if there is a tie, false otherwise.\\n        uint256 totalVoted; // Former uint[_appeal] votesInEachRound.\\n        uint256 totalCommitted; // Former commitsInRound.\\n        mapping(uint256 choiceId => uint256) paidFees; // Tracks the fees paid for each choice in this round.\\n        mapping(uint256 choiceId => bool) hasPaid; // True if this choice was fully funded, false otherwise.\\n        mapping(address account => mapping(uint256 choiceId => uint256)) contributions; // Maps contributors to their contributions for each choice.\\n        uint256 feeRewards; // Sum of reimbursable appeal fees available to the parties that made contributions to the ruling that ultimately wins a dispute.\\n        uint256[] fundedChoices; // Stores the choices that are fully funded.\\n        mapping(address drawnAddress => bool) alreadyDrawn; // True if the address has already been drawn, false by default.\\n        uint256[10] __gap; // Reserved slots for future upgrades.\\n    }\\n\\n    struct Vote {\\n        bool voted; // True if the vote has been cast.\\n        address account; // The address of the juror.\\n        bytes32 commit; // The commit of the juror. For courts with hidden votes.\\n        uint256 choice; // The choice of the juror.\\n        uint256[10] __gap; // Reserved slots for future upgrades.\\n    }\\n\\n    // ************************************* //\\n    // *             Storage               * //\\n    // ************************************* //\\n\\n    uint256 public constant WINNER_STAKE_MULTIPLIER = 10000; // Multiplier of the appeal cost that the winner has to pay as fee stake for a round in basis points. Default is 1x of appeal fee.\\n    uint256 public constant LOSER_STAKE_MULTIPLIER = 20000; // Multiplier of the appeal cost that the loser has to pay as fee stake for a round in basis points. Default is 2x of appeal fee.\\n    uint256 public constant LOSER_APPEAL_PERIOD_MULTIPLIER = 5000; // Multiplier of the appeal period for the choice that wasn't voted for in the previous round, in basis points. Default is 1/2 of original appeal period.\\n\\n    address public owner; // The owner of the contract.\\n    KlerosCore public core; // The Kleros Core arbitrator\\n    Dispute[] public disputes; // Array of the locally created disputes.\\n    mapping(uint256 => uint256) public coreDisputeIDToLocal; // Maps the dispute ID in Kleros Core to the local dispute ID.\\n    bool public singleDrawPerJuror; // Whether each juror can only draw once per dispute, false by default.\\n    mapping(uint256 coreDisputeID => bool) public coreDisputeIDToActive; // True if this dispute kit is active for this core dispute ID.\\n    address public wNative; // The wrapped native token for safeSend().\\n    uint256 public jumpDisputeKitID; // The ID of the dispute kit in Kleros Core disputeKits array that the dispute should switch to after the court jump, in case the new court doesn't support this dispute kit.\\n\\n    uint256[50] private __gap; // Reserved slots for future upgrades.\\n\\n    // ************************************* //\\n    // *              Events               * //\\n    // ************************************* //\\n\\n    /// @notice To be emitted when a dispute is created.\\n    /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _numberOfChoices The number of choices available in the dispute.\\n    /// @param _extraData The extra data for the dispute.\\n    event DisputeCreation(uint256 indexed _coreDisputeID, uint256 _numberOfChoices, bytes _extraData);\\n\\n    /// @notice To be emitted when a vote commitment is cast.\\n    /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _juror The address of the juror casting the vote commitment.\\n    /// @param _voteIDs The identifiers of the votes in the dispute.\\n    /// @param _commit The commitment of the juror.\\n    event CommitCast(uint256 indexed _coreDisputeID, address indexed _juror, uint256[] _voteIDs, bytes32 _commit);\\n\\n    /// @notice To be emitted when a funding contribution is made.\\n    /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _coreRoundID The identifier of the round in the Arbitrator contract.\\n    /// @param _choice The choice that is being funded.\\n    /// @param _contributor The address of the contributor.\\n    /// @param _amount The amount contributed.\\n    event Contribution(\\n        uint256 indexed _coreDisputeID,\\n        uint256 indexed _coreRoundID,\\n        uint256 _choice,\\n        address indexed _contributor,\\n        uint256 _amount\\n    );\\n\\n    /// @notice To be emitted when the contributed funds are withdrawn.\\n    /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _coreRoundID The identifier of the round in the Arbitrator contract.\\n    /// @param _choice The choice that is being funded.\\n    /// @param _contributor The address of the contributor.\\n    /// @param _amount The amount withdrawn.\\n    event Withdrawal(\\n        uint256 indexed _coreDisputeID,\\n        uint256 indexed _coreRoundID,\\n        uint256 _choice,\\n        address indexed _contributor,\\n        uint256 _amount\\n    );\\n\\n    /// @notice To be emitted when a choice is fully funded for an appeal.\\n    /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _coreRoundID The identifier of the round in the Arbitrator contract.\\n    /// @param _choice The choice that is being funded.\\n    event ChoiceFunded(uint256 indexed _coreDisputeID, uint256 indexed _coreRoundID, uint256 indexed _choice);\\n\\n    // ************************************* //\\n    // *              Modifiers            * //\\n    // ************************************* //\\n\\n    modifier onlyByOwner() {\\n        if (owner != msg.sender) revert OwnerOnly();\\n        _;\\n    }\\n\\n    modifier onlyByCore() {\\n        if (address(core) != msg.sender) revert KlerosCoreOnly();\\n        _;\\n    }\\n\\n    modifier notJumped(uint256 _coreDisputeID) {\\n        if (disputes[coreDisputeIDToLocal[_coreDisputeID]].jumped) revert DisputeJumpedToParentDK();\\n        _;\\n    }\\n\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    /// @notice Initializer.\\n    /// @param _owner The owner's address.\\n    /// @param _core The KlerosCore arbitrator.\\n    /// @param _wNative The wrapped native token address, typically wETH.\\n    /// @param _jumpDisputeKitID The ID of the dispute kit to switch to after the court jump.\\n    function __DisputeKitClassicBase_initialize(\\n        address _owner,\\n        KlerosCore _core,\\n        address _wNative,\\n        uint256 _jumpDisputeKitID\\n    ) internal onlyInitializing {\\n        owner = _owner;\\n        core = _core;\\n        wNative = _wNative;\\n        jumpDisputeKitID = _jumpDisputeKitID;\\n    }\\n\\n    // ************************ //\\n    // *      Governance      * //\\n    // ************************ //\\n\\n    /// @notice Allows the owner to call anything on behalf of the contract.\\n    /// @param _destination The destination of the call.\\n    /// @param _amount The value sent with the call.\\n    /// @param _data The data sent with the call.\\n    function executeOwnerProposal(address _destination, uint256 _amount, bytes memory _data) external onlyByOwner {\\n        (bool success, ) = _destination.call{value: _amount}(_data);\\n        if (!success) revert UnsuccessfulCall();\\n    }\\n\\n    /// @notice Changes the `owner` storage variable.\\n    /// @param _owner The new value for the `owner` storage variable.\\n    function changeOwner(address payable _owner) external onlyByOwner {\\n        owner = _owner;\\n    }\\n\\n    /// @notice Changes the `core` storage variable.\\n    /// @param _core The new value for the `core` storage variable.\\n    function changeCore(address _core) external onlyByOwner {\\n        core = KlerosCore(_core);\\n    }\\n\\n    /// @notice Changes the dispute kit ID used for the jump.\\n    /// @param _jumpDisputeKitID The new value for the `jumpDisputeKitID` storage variable.\\n    function changeJumpDisputeKitID(uint256 _jumpDisputeKitID) external onlyByOwner {\\n        jumpDisputeKitID = _jumpDisputeKitID;\\n    }\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @inheritdoc IDisputeKit\\n    function createDispute(\\n        uint256 _coreDisputeID,\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData,\\n        uint256 /*_nbVotes*/\\n    ) external override onlyByCore {\\n        uint256 localDisputeID = disputes.length;\\n        Dispute storage dispute = disputes.push();\\n        dispute.numberOfChoices = _numberOfChoices;\\n        dispute.extraData = _extraData;\\n        dispute.jumped = false; // Possibly true if this DK has jumped in a previous round.\\n\\n        // New round in the Core should be created before the dispute creation in DK.\\n        dispute.coreRoundIDToLocal[core.getNumberOfRounds(_coreDisputeID) - 1] = dispute.rounds.length;\\n\\n        Round storage round = dispute.rounds.push();\\n        round.tied = true;\\n\\n        coreDisputeIDToLocal[_coreDisputeID] = localDisputeID;\\n        coreDisputeIDToActive[_coreDisputeID] = true;\\n        emit DisputeCreation(_coreDisputeID, _numberOfChoices, _extraData);\\n    }\\n\\n    /// @inheritdoc IDisputeKit\\n    function draw(\\n        uint256 _coreDisputeID,\\n        uint256 _nonce\\n    ) external override onlyByCore notJumped(_coreDisputeID) returns (address drawnAddress, uint96 fromSubcourtID) {\\n        uint256 localDisputeID = coreDisputeIDToLocal[_coreDisputeID];\\n        Dispute storage dispute = disputes[localDisputeID];\\n        uint256 localRoundID = dispute.rounds.length - 1;\\n        Round storage round = dispute.rounds[localRoundID];\\n\\n        ISortitionModule sortitionModule = core.sortitionModule();\\n        (uint96 courtID, , , , ) = core.disputes(_coreDisputeID);\\n        (drawnAddress, fromSubcourtID) = sortitionModule.draw(courtID, _coreDisputeID, _nonce);\\n        if (drawnAddress == address(0)) {\\n            // Sortition can return 0 address if no one has staked yet.\\n            return (drawnAddress, fromSubcourtID);\\n        }\\n\\n        if (_postDrawCheck(round, _coreDisputeID, drawnAddress)) {\\n            Vote storage vote = round.votes.push();\\n            vote.account = drawnAddress;\\n            round.alreadyDrawn[drawnAddress] = true;\\n        } else {\\n            drawnAddress = address(0);\\n        }\\n    }\\n\\n    /// @notice Sets the caller's commit for the specified votes.\\n    ///\\n    /// @dev It can be called multiple times during the commit period, each call overrides the commits of the previous one.\\n    /// `O(n)` where `n` is the number of votes.\\n    ///\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core.\\n    /// @param _voteIDs The IDs of the votes.\\n    /// @param _commit The commitment hash.\\n    function castCommit(uint256 _coreDisputeID, uint256[] calldata _voteIDs, bytes32 _commit) external {\\n        _castCommit(_coreDisputeID, _voteIDs, _commit);\\n    }\\n\\n    function _castCommit(\\n        uint256 _coreDisputeID,\\n        uint256[] calldata _voteIDs,\\n        bytes32 _commit\\n    ) internal notJumped(_coreDisputeID) {\\n        (, , KlerosCore.Period period, , ) = core.disputes(_coreDisputeID);\\n        if (period != KlerosCore.Period.commit) revert NotCommitPeriod();\\n        if (_commit == bytes32(0)) revert EmptyCommit();\\n        if (!coreDisputeIDToActive[_coreDisputeID]) revert NotActiveForCoreDisputeID();\\n\\n        Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        for (uint256 i = 0; i < _voteIDs.length; i++) {\\n            if (round.votes[_voteIDs[i]].account != msg.sender) revert JurorHasToOwnTheVote();\\n            round.votes[_voteIDs[i]].commit = _commit;\\n        }\\n        round.totalCommitted += _voteIDs.length;\\n        emit CommitCast(_coreDisputeID, msg.sender, _voteIDs, _commit);\\n    }\\n\\n    /// @notice Sets the caller's choices for the specified votes.\\n    ///\\n    /// @dev `O(n)` where `n` is the number of votes.\\n    ///\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core.\\n    /// @param _voteIDs The IDs of the votes.\\n    /// @param _choice The choice.\\n    /// @param _salt The salt for the commit if the votes were hidden.\\n    /// @param _justification Justification of the choice.\\n    function castVote(\\n        uint256 _coreDisputeID,\\n        uint256[] calldata _voteIDs,\\n        uint256 _choice,\\n        uint256 _salt,\\n        string memory _justification\\n    ) external {\\n        _castVote(_coreDisputeID, _voteIDs, _choice, _salt, _justification, msg.sender);\\n    }\\n\\n    function _castVote(\\n        uint256 _coreDisputeID,\\n        uint256[] calldata _voteIDs,\\n        uint256 _choice,\\n        uint256 _salt,\\n        string memory _justification,\\n        address _juror\\n    ) internal notJumped(_coreDisputeID) {\\n        (, , KlerosCore.Period period, , ) = core.disputes(_coreDisputeID);\\n        if (period != KlerosCore.Period.vote) revert NotVotePeriod();\\n        if (_voteIDs.length == 0) revert EmptyVoteIDs();\\n        if (!coreDisputeIDToActive[_coreDisputeID]) revert NotActiveForCoreDisputeID();\\n\\n        uint256 localDisputeID = coreDisputeIDToLocal[_coreDisputeID];\\n        Dispute storage dispute = disputes[localDisputeID];\\n        if (_choice > dispute.numberOfChoices) revert ChoiceOutOfBounds();\\n\\n        uint256 localRoundID = dispute.rounds.length - 1;\\n        Round storage round = dispute.rounds[localRoundID];\\n        {\\n            (uint96 courtID, , , , ) = core.disputes(_coreDisputeID);\\n            (, bool hiddenVotes, , , , ) = core.courts(courtID);\\n            bytes32 actualVoteHash = hashVote(_choice, _salt, _justification);\\n\\n            //  Save the votes.\\n            for (uint256 i = 0; i < _voteIDs.length; i++) {\\n                if (round.votes[_voteIDs[i]].account != _juror) revert JurorHasToOwnTheVote();\\n                if (hiddenVotes && _getExpectedVoteHash(localDisputeID, localRoundID, _voteIDs[i]) != actualVoteHash)\\n                    revert HashDoesNotMatchHiddenVoteCommitment();\\n                if (round.votes[_voteIDs[i]].voted) revert VoteAlreadyCast();\\n                round.votes[_voteIDs[i]].choice = _choice;\\n                round.votes[_voteIDs[i]].voted = true;\\n            }\\n        } // Workaround stack too deep\\n\\n        round.totalVoted += _voteIDs.length;\\n\\n        round.counts[_choice] += _voteIDs.length;\\n        if (_choice == round.winningChoice) {\\n            if (round.tied) round.tied = false;\\n        } else {\\n            // Voted for another choice.\\n            if (round.counts[_choice] == round.counts[round.winningChoice]) {\\n                // Tie.\\n                if (!round.tied) round.tied = true;\\n            } else if (round.counts[_choice] > round.counts[round.winningChoice]) {\\n                // New winner.\\n                round.winningChoice = _choice;\\n                round.tied = false;\\n            }\\n        }\\n        emit VoteCast(_coreDisputeID, _juror, _voteIDs, _choice, _justification);\\n    }\\n\\n    /// @notice Manages contributions, and appeals a dispute if at least two choices are fully funded.\\n    /// Note that the surplus deposit will be reimbursed.\\n    /// @param _coreDisputeID Index of the dispute in Kleros Core.\\n    /// @param _choice A choice that receives funding.\\n    function fundAppeal(uint256 _coreDisputeID, uint256 _choice) external payable notJumped(_coreDisputeID) {\\n        Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];\\n        if (_choice > dispute.numberOfChoices) revert ChoiceOutOfBounds();\\n        if (!coreDisputeIDToActive[_coreDisputeID]) revert NotActiveForCoreDisputeID();\\n\\n        (uint256 appealPeriodStart, uint256 appealPeriodEnd) = core.appealPeriod(_coreDisputeID);\\n        if (block.timestamp < appealPeriodStart || block.timestamp >= appealPeriodEnd) revert AppealPeriodIsOver();\\n\\n        uint256 multiplier;\\n        (uint256 ruling, , ) = this.currentRuling(_coreDisputeID);\\n        if (ruling == _choice) {\\n            multiplier = WINNER_STAKE_MULTIPLIER;\\n        } else {\\n            if (\\n                block.timestamp - appealPeriodStart >=\\n                ((appealPeriodEnd - appealPeriodStart) * LOSER_APPEAL_PERIOD_MULTIPLIER) / ONE_BASIS_POINT\\n            ) {\\n                revert AppealPeriodIsOverForLoser();\\n            }\\n            multiplier = LOSER_STAKE_MULTIPLIER;\\n        }\\n\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        uint256 coreRoundID = core.getNumberOfRounds(_coreDisputeID) - 1;\\n\\n        if (round.hasPaid[_choice]) revert AppealFeeIsAlreadyPaid();\\n        uint256 appealCost = core.appealCost(_coreDisputeID);\\n        uint256 totalCost = appealCost + (appealCost * multiplier) / ONE_BASIS_POINT;\\n\\n        // Take up to the amount necessary to fund the current round at the current costs.\\n        uint256 contribution;\\n        if (totalCost > round.paidFees[_choice]) {\\n            contribution = totalCost - round.paidFees[_choice] > msg.value // Overflows and underflows will be managed on the compiler level.\\n                ? msg.value\\n                : totalCost - round.paidFees[_choice];\\n            emit Contribution(_coreDisputeID, coreRoundID, _choice, msg.sender, contribution);\\n        }\\n\\n        round.contributions[msg.sender][_choice] += contribution;\\n        round.paidFees[_choice] += contribution;\\n        if (round.paidFees[_choice] >= totalCost) {\\n            round.feeRewards += round.paidFees[_choice];\\n            round.fundedChoices.push(_choice);\\n            round.hasPaid[_choice] = true;\\n            emit ChoiceFunded(_coreDisputeID, coreRoundID, _choice);\\n        }\\n\\n        if (round.fundedChoices.length > 1) {\\n            // At least two sides are fully funded.\\n            round.feeRewards = round.feeRewards - appealCost;\\n\\n            if (core.isDisputeKitJumping(_coreDisputeID)) {\\n                // Don't create a new round in case of a jump, and remove local dispute from the flow.\\n                dispute.jumped = true;\\n            } else {\\n                // Don't subtract 1 from length since both round arrays haven't been updated yet.\\n                dispute.coreRoundIDToLocal[coreRoundID + 1] = dispute.rounds.length;\\n\\n                Round storage newRound = dispute.rounds.push();\\n                newRound.tied = true;\\n            }\\n            core.appeal{value: appealCost}(_coreDisputeID, dispute.numberOfChoices, dispute.extraData);\\n        }\\n\\n        if (msg.value > contribution) payable(msg.sender).safeSend(msg.value - contribution, wNative);\\n    }\\n\\n    /// @notice Allows those contributors who attempted to fund an appeal round to withdraw any reimbursable fees or rewards after the dispute gets resolved.\\n    /// @dev Withdrawals are not possible if the core contract is paused.\\n    /// @param _coreDisputeID Index of the dispute in Kleros Core contract.\\n    /// @param _beneficiary The address whose rewards to withdraw.\\n    /// @param _coreRoundID The round in the Kleros Core contract the caller wants to withdraw from.\\n    /// @param _choice The ruling option that the caller wants to withdraw from.\\n    /// @return amount The withdrawn amount.\\n    function withdrawFeesAndRewards(\\n        uint256 _coreDisputeID,\\n        address payable _beneficiary,\\n        uint256 _coreRoundID,\\n        uint256 _choice\\n    ) external returns (uint256 amount) {\\n        (, , , bool isRuled, ) = core.disputes(_coreDisputeID);\\n        if (!isRuled) revert DisputeNotResolved();\\n        if (core.paused()) revert CoreIsPaused();\\n        if (!coreDisputeIDToActive[_coreDisputeID]) revert NotActiveForCoreDisputeID();\\n\\n        Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];\\n        Round storage round = dispute.rounds[dispute.coreRoundIDToLocal[_coreRoundID]];\\n        (uint256 finalRuling, , ) = core.currentRuling(_coreDisputeID);\\n\\n        if (!round.hasPaid[_choice]) {\\n            // Allow to reimburse if funding was unsuccessful for this ruling option.\\n            amount = round.contributions[_beneficiary][_choice];\\n        } else {\\n            // Funding was successful for this ruling option.\\n            if (_choice == finalRuling) {\\n                // This ruling option is the ultimate winner.\\n                amount = round.paidFees[_choice] > 0\\n                    ? (round.contributions[_beneficiary][_choice] * round.feeRewards) / round.paidFees[_choice]\\n                    : 0;\\n            } else if (!round.hasPaid[finalRuling]) {\\n                // The ultimate winner was not funded in this round. In this case funded ruling option(s) are reimbursed.\\n                amount =\\n                    (round.contributions[_beneficiary][_choice] * round.feeRewards) /\\n                    (round.paidFees[round.fundedChoices[0]] + round.paidFees[round.fundedChoices[1]]);\\n            }\\n        }\\n        round.contributions[_beneficiary][_choice] = 0;\\n\\n        if (amount != 0) {\\n            _beneficiary.safeSend(amount, wNative);\\n            emit Withdrawal(_coreDisputeID, _coreRoundID, _choice, _beneficiary, amount);\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /// @notice Computes the hash of a vote using ABI encoding\\n    /// @dev The unused parameters may be used by overriding contracts.\\n    /// @param _choice The choice being voted for\\n    /// @param _salt A random salt for commitment\\n    /// @return bytes32 The hash of the encoded vote parameters\\n    function hashVote(\\n        uint256 _choice,\\n        uint256 _salt,\\n        string memory /*_justification*/\\n    ) public view virtual returns (bytes32) {\\n        return keccak256(abi.encodePacked(_choice, _salt));\\n    }\\n\\n    /// @notice Returns the rulings that were fully funded in the latest appeal round.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core.\\n    /// @return fundedChoices Fully funded rulings.\\n    function getFundedChoices(uint256 _coreDisputeID) public view returns (uint256[] memory fundedChoices) {\\n        Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];\\n        Round storage lastRound = dispute.rounds[dispute.rounds.length - 1];\\n        return lastRound.fundedChoices;\\n    }\\n\\n    /// @inheritdoc IDisputeKit\\n    function currentRuling(\\n        uint256 _coreDisputeID\\n    ) external view override returns (uint256 ruling, bool tied, bool overridden) {\\n        Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        tied = round.tied;\\n        ruling = tied ? 0 : round.winningChoice;\\n        (, , KlerosCore.Period period, , ) = core.disputes(_coreDisputeID);\\n        // Override the final ruling if only one side funded the appeals.\\n        if (period == KlerosCore.Period.execution) {\\n            uint256[] memory fundedChoices = getFundedChoices(_coreDisputeID);\\n            if (fundedChoices.length == 1) {\\n                ruling = fundedChoices[0];\\n                tied = false;\\n                overridden = true;\\n            }\\n        }\\n    }\\n\\n    /// @inheritdoc IDisputeKit\\n    function getDegreeOfCoherenceReward(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _voteID,\\n        uint256 /* _feePerJuror */,\\n        uint256 /* _pnkAtStakePerJuror */\\n    ) external view override returns (uint256 pnkCoherence, uint256 feeCoherence) {\\n        uint256 coherence = _getDegreeOfCoherence(_coreDisputeID, _coreRoundID, _voteID);\\n        return (coherence, coherence);\\n    }\\n\\n    /// @inheritdoc IDisputeKit\\n    function getDegreeOfCoherencePenalty(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _voteID,\\n        uint256 /* _feePerJuror */,\\n        uint256 /* _pnkAtStakePerJuror */\\n    ) external view override returns (uint256 pnkCoherence) {\\n        return _getDegreeOfCoherence(_coreDisputeID, _coreRoundID, _voteID);\\n    }\\n\\n    function _getDegreeOfCoherence(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _voteID\\n    ) internal view returns (uint256 coherence) {\\n        // In this contract this degree can be either 0 or 1, but in other dispute kits this value can be something in between.\\n        Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];\\n        Vote storage vote = dispute.rounds[dispute.coreRoundIDToLocal[_coreRoundID]].votes[_voteID];\\n        (uint256 winningChoice, bool tied, ) = core.currentRuling(_coreDisputeID);\\n\\n        if (vote.voted && (vote.choice == winningChoice || tied)) {\\n            return ONE_BASIS_POINT;\\n        } else {\\n            return 0;\\n        }\\n    }\\n\\n    /// @inheritdoc IDisputeKit\\n    function getCoherentCount(uint256 _coreDisputeID, uint256 _coreRoundID) external view override returns (uint256) {\\n        Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];\\n        Round storage currentRound = dispute.rounds[dispute.coreRoundIDToLocal[_coreRoundID]];\\n        (uint256 winningChoice, bool tied, ) = core.currentRuling(_coreDisputeID);\\n\\n        if (currentRound.totalVoted == 0 || (!tied && currentRound.counts[winningChoice] == 0)) {\\n            return 0;\\n        } else if (tied) {\\n            return currentRound.totalVoted;\\n        } else {\\n            return currentRound.counts[winningChoice];\\n        }\\n    }\\n\\n    /// @inheritdoc IDisputeKit\\n    function areCommitsAllCast(uint256 _coreDisputeID) external view override returns (bool) {\\n        Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        return round.totalCommitted == round.votes.length;\\n    }\\n\\n    /// @inheritdoc IDisputeKit\\n    function areVotesAllCast(uint256 _coreDisputeID) external view override returns (bool) {\\n        Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n\\n        (uint96 courtID, , , , ) = core.disputes(_coreDisputeID);\\n        (, bool hiddenVotes, , , , ) = core.courts(courtID);\\n        uint256 expectedTotalVoted = hiddenVotes ? round.totalCommitted : round.votes.length;\\n\\n        return round.totalVoted == expectedTotalVoted;\\n    }\\n\\n    /// @inheritdoc IDisputeKit\\n    function isAppealFunded(uint256 _coreDisputeID) external view override returns (bool) {\\n        (uint256 appealPeriodStart, uint256 appealPeriodEnd) = core.appealPeriod(_coreDisputeID);\\n\\n        uint256[] memory fundedChoices = getFundedChoices(_coreDisputeID);\\n        // Uses block.timestamp from the current tx when called by the core contract.\\n        return (fundedChoices.length == 0 &&\\n            block.timestamp - appealPeriodStart >=\\n            ((appealPeriodEnd - appealPeriodStart) * LOSER_APPEAL_PERIOD_MULTIPLIER) / ONE_BASIS_POINT);\\n    }\\n\\n    /// @inheritdoc IDisputeKit\\n    function earlyCourtJump(uint256 /* _coreDisputeID */) external pure override returns (bool) {\\n        return false;\\n    }\\n\\n    /// @inheritdoc IDisputeKit\\n    function getNbVotesAfterAppeal(\\n        IDisputeKit /* _previousDisputeKit */,\\n        uint256 _currentNbVotes\\n    ) external pure override returns (uint256) {\\n        return (_currentNbVotes * 2) + 1;\\n    }\\n\\n    /// @inheritdoc IDisputeKit\\n    function getJumpDisputeKitID() external view override returns (uint256) {\\n        // Fall back to classic DK in case the jump ID is not defined.\\n        return jumpDisputeKitID == 0 ? DISPUTE_KIT_CLASSIC : jumpDisputeKitID;\\n    }\\n\\n    /// @inheritdoc IDisputeKit\\n    function isVoteActive(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _voteID\\n    ) external view override returns (bool) {\\n        Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];\\n        Vote storage vote = dispute.rounds[dispute.coreRoundIDToLocal[_coreRoundID]].votes[_voteID];\\n        return vote.voted;\\n    }\\n\\n    /// @inheritdoc IDisputeKit\\n    function getRoundInfo(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _choice\\n    )\\n        external\\n        view\\n        override\\n        returns (\\n            uint256 winningChoice,\\n            bool tied,\\n            uint256 totalVoted,\\n            uint256 totalCommitted,\\n            uint256 nbVoters,\\n            uint256 choiceCount\\n        )\\n    {\\n        Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];\\n        Round storage round = dispute.rounds[dispute.coreRoundIDToLocal[_coreRoundID]];\\n        return (\\n            round.winningChoice,\\n            round.tied,\\n            round.totalVoted,\\n            round.totalCommitted,\\n            round.votes.length,\\n            round.counts[_choice]\\n        );\\n    }\\n\\n    /// @notice Returns the number of rounds in a dispute.\\n    /// @param _localDisputeID The ID of the dispute in the Dispute Kit.\\n    /// @return The number of rounds in the dispute.\\n    function getNumberOfRounds(uint256 _localDisputeID) external view returns (uint256) {\\n        return disputes[_localDisputeID].rounds.length;\\n    }\\n\\n    /// @notice Returns the local dispute ID and round ID for a given core dispute ID and core round ID.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core.\\n    /// @param _coreRoundID The ID of the round in Kleros Core.\\n    /// @return localDisputeID The ID of the dispute in the Dispute Kit.\\n    /// @return localRoundID The ID of the round in the Dispute Kit.\\n    function getLocalDisputeRoundID(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID\\n    ) external view returns (uint256 localDisputeID, uint256 localRoundID) {\\n        localDisputeID = coreDisputeIDToLocal[_coreDisputeID];\\n        localRoundID = disputes[localDisputeID].coreRoundIDToLocal[_coreRoundID];\\n    }\\n\\n    /// @inheritdoc IDisputeKit\\n    function getVoteInfo(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _voteID\\n    ) external view override returns (address account, bytes32 commit, uint256 choice, bool voted) {\\n        Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];\\n        Vote storage vote = dispute.rounds[dispute.coreRoundIDToLocal[_coreRoundID]].votes[_voteID];\\n        return (vote.account, vote.commit, vote.choice, vote.voted);\\n    }\\n\\n    // ************************************* //\\n    // *            Internal               * //\\n    // ************************************* //\\n\\n    /// @notice Returns the expected vote hash for a given vote.\\n    /// @param _localDisputeID The ID of the dispute in the Dispute Kit.\\n    /// @param _localRoundID The ID of the round in the Dispute Kit.\\n    /// @param _voteID The ID of the vote.\\n    /// @return The expected vote hash.\\n    function _getExpectedVoteHash(\\n        uint256 _localDisputeID,\\n        uint256 _localRoundID,\\n        uint256 _voteID\\n    ) internal view virtual returns (bytes32) {\\n        return disputes[_localDisputeID].rounds[_localRoundID].votes[_voteID].commit;\\n    }\\n\\n    /// @notice Checks that the chosen address satisfies certain conditions for being drawn.\\n    ///\\n    /// @dev No need to check the minStake requirement here because of the implicit staking in parent courts.\\n    /// minStake is checked directly during staking process however it's possible for the juror to get drawn\\n    /// while having < minStake if it is later increased by governance.\\n    /// This issue is expected and harmless.\\n    ///\\n    /// @param _coreDisputeID ID of the dispute in the core contract.\\n    /// @param _juror Chosen address.\\n    /// @return result Whether the address passes the check or not.\\n    function _postDrawCheck(\\n        Round storage /*_round*/,\\n        uint256 _coreDisputeID,\\n        address _juror\\n    ) internal view virtual returns (bool result) {\\n        if (singleDrawPerJuror) {\\n            uint256 localDisputeID = coreDisputeIDToLocal[_coreDisputeID];\\n            Dispute storage dispute = disputes[localDisputeID];\\n            Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n            result = !round.alreadyDrawn[_juror];\\n        } else {\\n            result = true;\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *              Errors               * //\\n    // ************************************* //\\n\\n    error OwnerOnly();\\n    error KlerosCoreOnly();\\n    error DisputeJumpedToParentDK();\\n    error UnsuccessfulCall();\\n    error NotCommitPeriod();\\n    error EmptyCommit();\\n    error NotActiveForCoreDisputeID();\\n    error JurorHasToOwnTheVote();\\n    error NotVotePeriod();\\n    error EmptyVoteIDs();\\n    error ChoiceOutOfBounds();\\n    error HashDoesNotMatchHiddenVoteCommitment();\\n    error VoteAlreadyCast();\\n    error AppealPeriodIsOver();\\n    error AppealPeriodIsOverForLoser();\\n    error AppealFeeIsAlreadyPaid();\\n    error DisputeNotResolved();\\n    error CoreIsPaused();\\n}\\n\",\"keccak256\":\"0x15d38f814fc59844571eddbfddad77730cc541f8b86cd094139f4c8771dde011\",\"license\":\"MIT\"},\"src/arbitration/interfaces/IArbitrableV2.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity >=0.8.0 <0.9.0;\\n\\nimport \\\"./IArbitratorV2.sol\\\";\\n\\n/// @title IArbitrableV2\\n/// @notice Arbitrable interface.\\n/// @dev When developing arbitrable contracts, we need to:\\n/// - Define the action taken when a ruling is received by the contract.\\n/// - Allow dispute creation which calls `arbitrator.createDispute{value: _fee}(_choices,_extraData)`.\\ninterface IArbitrableV2 {\\n    // ************************************* //\\n    // *              Events               * //\\n    // ************************************* //\\n\\n    /// @notice To be emitted when a dispute is created to link the correct template to the disputeID.\\n    /// @param _arbitrator The arbitrator of the contract.\\n    /// @param _arbitratorDisputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _externalDisputeID An identifier created outside Kleros by the protocol requesting arbitration.\\n    /// @param _templateId The identifier of the dispute template.\\n    event DisputeRequest(\\n        IArbitratorV2 indexed _arbitrator,\\n        uint256 indexed _arbitratorDisputeID,\\n        uint256 _externalDisputeID,\\n        uint256 _templateId\\n    );\\n\\n    /// @notice To be raised when a ruling is given.\\n    /// @param _arbitrator The arbitrator giving the ruling.\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _ruling The ruling which was given.\\n    event Ruling(IArbitratorV2 indexed _arbitrator, uint256 indexed _disputeID, uint256 _ruling);\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @notice Give a ruling for a dispute.\\n    ///\\n    /// @dev This is a callback function for the arbitrator to provide the ruling to this contract.\\n    /// Only the arbitrator must be allowed to call this function.\\n    /// Ruling 0 is reserved for \\\"Not able/wanting to make a decision\\\".\\n    ///\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _ruling Ruling given by the arbitrator.\\n    function rule(uint256 _disputeID, uint256 _ruling) external;\\n}\\n\",\"keccak256\":\"0x3afa29a93847399c8705103350b69bb70706b2075ca41b39d523b007e69e23db\",\"license\":\"MIT\"},\"src/arbitration/interfaces/IArbitratorV2.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity >=0.8.0 <0.9.0;\\n\\nimport \\\"@openzeppelin/contracts/token/ERC20/IERC20.sol\\\";\\nimport \\\"./IArbitrableV2.sol\\\";\\n\\n/// @title Arbitrator\\n/// @notice Arbitrator interface for the Kleros V2 protocol.\\n/// @dev Unlike the ERC-792 this standard is not concerned with appeals, so each arbitrator can implement an appeal system that suits it the most.\\ninterface IArbitratorV2 {\\n    // ************************************* //\\n    // *              Events               * //\\n    // ************************************* //\\n\\n    /// @notice To be emitted when a dispute is created.\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _arbitrable The contract which created the dispute.\\n    event DisputeCreation(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);\\n\\n    /// @notice To be raised when a ruling is given.\\n    /// @param _arbitrable The arbitrable receiving the ruling.\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _ruling The ruling which was given.\\n    event Ruling(IArbitrableV2 indexed _arbitrable, uint256 indexed _disputeID, uint256 _ruling);\\n\\n    /// @notice To be emitted when an ERC20 token is added or removed as a method to pay fees.\\n    /// @param _token The ERC20 token.\\n    /// @param _accepted Whether the token is accepted or not.\\n    event AcceptedFeeToken(IERC20 indexed _token, bool indexed _accepted);\\n\\n    /// @notice To be emitted when the fee for a particular ERC20 token is updated.\\n    /// @param _feeToken The ERC20 token.\\n    /// @param _rateInEth The new rate of the fee token in ETH.\\n    /// @param _rateDecimals The new decimals of the fee token rate.\\n    event NewCurrencyRate(IERC20 indexed _feeToken, uint64 _rateInEth, uint8 _rateDecimals);\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @notice Create a dispute and pay for the fees in the native currency, typically ETH.\\n    /// @dev Must be called by the arbitrable contract and pay at least `arbitrationCost(_extraData)` in ETH.\\n    /// @param _numberOfChoices The number of choices the arbitrator can choose from in this dispute.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @return disputeID The identifier of the dispute created.\\n    function createDispute(\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData\\n    ) external payable returns (uint256 disputeID);\\n\\n    /// @notice Create a dispute and pay for the fees in a supported ERC20 token.\\n    /// @dev Must be called by the arbitrable contract and pay at least `arbitrationCost(_extraData)` in the supported ERC20 token.\\n    /// @param _numberOfChoices The number of choices the arbitrator can choose from in this dispute.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @param _feeToken The ERC20 token used to pay fees.\\n    /// @param _feeAmount Amount of the ERC20 token used to pay fees.\\n    /// @return disputeID The identifier of the dispute created.\\n    function createDispute(\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData,\\n        IERC20 _feeToken,\\n        uint256 _feeAmount\\n    ) external returns (uint256 disputeID);\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /// @notice Compute the cost of arbitration denominated in the native currency, typically ETH.\\n    /// @dev It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @return cost The arbitration cost in ETH.\\n    function arbitrationCost(bytes calldata _extraData) external view returns (uint256 cost);\\n\\n    /// @notice Compute the cost of arbitration denominated in `_feeToken`.\\n    /// @dev It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @param _feeToken The ERC20 token used to pay fees.\\n    /// @return cost The arbitration cost in `_feeToken`.\\n    function arbitrationCost(bytes calldata _extraData, IERC20 _feeToken) external view returns (uint256 cost);\\n\\n    /// @notice Gets the current ruling of a specified dispute.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return ruling The current ruling.\\n    /// @return tied Whether it's a tie or not.\\n    /// @return overridden Whether the ruling was overridden by appeal funding or not.\\n    function currentRuling(uint256 _disputeID) external view returns (uint256 ruling, bool tied, bool overridden);\\n}\\n\",\"keccak256\":\"0x65ba87c5309cd6e6562e569f79778ca423c9be7b0a44b9407e5bd2bdf8fdc3b0\",\"license\":\"MIT\"},\"src/arbitration/interfaces/IDisputeKit.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity >=0.8.0 <0.9.0;\\n\\nimport \\\"./IArbitratorV2.sol\\\";\\n\\n/// @title IDisputeKit\\n/// @notice An abstraction of the Dispute Kits intended for interfacing with KlerosCore.\\n/// @dev It does not intend to abstract the interactions with the user (such as voting or appeal funding) to allow for implementation-specific parameters.\\ninterface IDisputeKit {\\n    // ************************************ //\\n    // *             Events               * //\\n    // ************************************ //\\n\\n    /// @notice Emitted when casting a vote to provide the justification of juror's choice.\\n    /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _juror Address of the juror.\\n    /// @param _voteIDs The identifiers of the votes in the dispute.\\n    /// @param _choice The choice juror voted for.\\n    /// @param _justification Justification of the choice.\\n    event VoteCast(\\n        uint256 indexed _coreDisputeID,\\n        address indexed _juror,\\n        uint256[] _voteIDs,\\n        uint256 indexed _choice,\\n        string _justification\\n    );\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @notice Creates a local dispute and maps it to the dispute ID in the Core contract.\\n    /// @dev Access restricted to Kleros Core only.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _numberOfChoices Number of choices of the dispute\\n    /// @param _extraData Additional info about the dispute, for possible use in future dispute kits.\\n    /// @param _nbVotes Maximal number of votes this dispute can get. Added for future-proofing.\\n    function createDispute(\\n        uint256 _coreDisputeID,\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData,\\n        uint256 _nbVotes\\n    ) external;\\n\\n    /// @notice Draws the juror from the sortition tree. The drawn address is picked up by Kleros Core.\\n    /// @dev Access restricted to Kleros Core only.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _nonce Nonce.\\n    /// @return drawnAddress The drawn address.\\n    function draw(\\n        uint256 _coreDisputeID,\\n        uint256 _nonce\\n    ) external returns (address drawnAddress, uint96 fromSubcourtID);\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /// @notice Gets the current ruling of a specified dispute.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @return ruling The current ruling.\\n    /// @return tied Whether it's a tie or not.\\n    /// @return overridden Whether the ruling was overridden by appeal funding or not.\\n    function currentRuling(uint256 _coreDisputeID) external view returns (uint256 ruling, bool tied, bool overridden);\\n\\n    /// @notice Gets the degree of coherence of a particular voter.\\n    /// @dev This function is called by Kleros Core in order to determine the amount of the reward.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.\\n    /// @param _voteID The ID of the vote.\\n    /// @param _feePerJuror The fee per juror.\\n    /// @param _pnkAtStakePerJuror The PNK at stake per juror.\\n    /// @return pnkCoherence The degree of coherence in basis points for the dispute PNK reward.\\n    /// @return feeCoherence The degree of coherence in basis points for the dispute fee reward.\\n    function getDegreeOfCoherenceReward(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _voteID,\\n        uint256 _feePerJuror,\\n        uint256 _pnkAtStakePerJuror\\n    ) external view returns (uint256 pnkCoherence, uint256 feeCoherence);\\n\\n    /// @notice Gets the degree of coherence of a particular voter.\\n    /// @dev This function is called by Kleros Core in order to determine the amount of the penalty.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.\\n    /// @param _voteID The ID of the vote.\\n    /// @param _feePerJuror The fee per juror.\\n    /// @param _pnkAtStakePerJuror The PNK at stake per juror.\\n    /// @return pnkCoherence The degree of coherence in basis points for the dispute PNK reward.\\n    function getDegreeOfCoherencePenalty(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _voteID,\\n        uint256 _feePerJuror,\\n        uint256 _pnkAtStakePerJuror\\n    ) external view returns (uint256 pnkCoherence);\\n\\n    /// @notice Gets the number of jurors who are eligible to a reward in this round.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.\\n    /// @return The number of coherent jurors.\\n    function getCoherentCount(uint256 _coreDisputeID, uint256 _coreRoundID) external view returns (uint256);\\n\\n    /// @notice Returns true if all of the jurors have cast their commits for the last round.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @return Whether all of the jurors have cast their commits for the last round.\\n    function areCommitsAllCast(uint256 _coreDisputeID) external view returns (bool);\\n\\n    /// @notice Returns true if all of the jurors have cast their votes for the last round.\\n    /// @dev This function is to be called directly by the core contract and is not for off-chain usage.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @return Whether all of the jurors have cast their votes for the last round.\\n    function areVotesAllCast(uint256 _coreDisputeID) external view returns (bool);\\n\\n    /// @notice Returns true if the appeal funding is finished prematurely (e.g. when losing side didn't fund).\\n    /// @dev This function is to be called directly by the core contract and is not for off-chain usage.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @return Whether the appeal funding is finished.\\n    function isAppealFunded(uint256 _coreDisputeID) external view returns (bool);\\n\\n    /// @dev Returns true if the dispute is jumping to a parent court.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @return Whether the dispute is jumping to a parent court or not.\\n    function earlyCourtJump(uint256 _coreDisputeID) external view returns (bool);\\n\\n    /// @notice Returns the number of votes after the appeal.\\n    /// @param _previousDisputeKit The previous Dispute Kit.\\n    /// @param _currentNbVotes The number of votes before the appeal.\\n    /// @return The number of votes after the appeal.\\n    function getNbVotesAfterAppeal(\\n        IDisputeKit _previousDisputeKit,\\n        uint256 _currentNbVotes\\n    ) external view returns (uint256);\\n\\n    /// @notice Returns the dispute kit ID to be used after court jump by Kleros Core.\\n    /// @return The ID of the dispute kit in Kleros Core disputeKits array.\\n    function getJumpDisputeKitID() external view returns (uint256);\\n\\n    /// @notice Returns true if the specified voter was active in this round.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.\\n    /// @param _voteID The ID of the voter.\\n    /// @return Whether the voter was active or not.\\n    function isVoteActive(uint256 _coreDisputeID, uint256 _coreRoundID, uint256 _voteID) external view returns (bool);\\n\\n    /// @notice Returns the info of the specified round in the core contract.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.\\n    /// @param _choice The choice to query.\\n    /// @return winningChoice The winning choice of this round.\\n    /// @return tied Whether it's a tie or not.\\n    /// @return totalVoted Number of jurors who cast the vote already.\\n    /// @return totalCommited Number of jurors who cast the commit already (only relevant for hidden votes).\\n    /// @return nbVoters Total number of voters in this round.\\n    /// @return choiceCount Number of votes cast for the queried choice.\\n    function getRoundInfo(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _choice\\n    )\\n        external\\n        view\\n        returns (\\n            uint256 winningChoice,\\n            bool tied,\\n            uint256 totalVoted,\\n            uint256 totalCommited,\\n            uint256 nbVoters,\\n            uint256 choiceCount\\n        );\\n\\n    /// @notice Returns the vote information for a given vote ID.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core.\\n    /// @param _coreRoundID The ID of the round in Kleros Core.\\n    /// @param _voteID The ID of the vote.\\n    /// @return account The address of the juror who cast the vote.\\n    /// @return commit The commit of the vote.\\n    /// @return choice The choice that got the vote.\\n    /// @return voted Whether the vote was cast or not.\\n    function getVoteInfo(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _voteID\\n    ) external view returns (address account, bytes32 commit, uint256 choice, bool voted);\\n}\\n\",\"keccak256\":\"0x1f12d2574dffd9bf83cf33a54aa4abbbfa4203251a0f962edd8e5c3b370408bc\",\"license\":\"MIT\"},\"src/arbitration/interfaces/ISortitionModule.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity >=0.8.0 <0.9.0;\\n\\nimport \\\"../../libraries/Constants.sol\\\";\\n\\n/// @title ISortitionModule\\n/// @notice Interface for the SortitionModule contract.\\ninterface ISortitionModule {\\n    // ************************************* //\\n    // *              Enums                * //\\n    // ************************************* //\\n\\n    enum Phase {\\n        staking, // Stake sum trees can be updated. Pass after `minStakingTime` passes and there is at least one dispute without jurors.\\n        generating, // Waiting for a random number. Pass as soon as it is ready.\\n        drawing // Jurors can be drawn. Pass after all disputes have jurors or `maxDrawingTime` passes.\\n    }\\n\\n    // ************************************* //\\n    // *              Events               * //\\n    // ************************************* //\\n\\n    /// @notice Emitted when the phase is changed.\\n    /// @param _phase The new phase.\\n    event NewPhase(Phase _phase);\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @notice Passes the phase.\\n    function passPhase() external;\\n\\n    /// @notice Executes the next delayed stakes.\\n    /// @param _iterations The number of delayed stakes to execute.\\n    function executeDelayedStakes(uint256 _iterations) external;\\n\\n    /// @notice Create a sortition sum tree at the specified key.\\n    /// @param _courtID The ID of the court.\\n    /// @param _extraData Extra data that contains the number of children each node in the tree should have.\\n    function createTree(uint96 _courtID, bytes memory _extraData) external;\\n\\n    /// @notice Validate the specified juror's new stake for a court.\\n    /// @dev No state changes should be made when returning stakingResult != Successful, otherwise delayed stakes might break invariants.\\n    /// @param _account The address of the juror.\\n    /// @param _courtID The ID of the court.\\n    /// @param _newStake The new stake.\\n    /// @param _noDelay True if the stake change should not be delayed.\\n    /// @return pnkDeposit The amount of PNK to be deposited.\\n    /// @return pnkWithdrawal The amount of PNK to be withdrawn.\\n    /// @return stakingResult The result of the staking operation.\\n    function validateStake(\\n        address _account,\\n        uint96 _courtID,\\n        uint256 _newStake,\\n        bool _noDelay\\n    ) external returns (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult);\\n\\n    /// @notice Update the state of the stakes, called by KC at the end of setStake flow.\\n    ///\\n    /// @dev `O(n + p * log_k(j))` where\\n    /// `n` is the number of courts the juror has staked in,\\n    /// `p` is the depth of the court tree,\\n    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,\\n    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.\\n    ///\\n    /// @param _account The address of the juror.\\n    /// @param _courtID The ID of the court.\\n    /// @param _pnkDeposit The amount of PNK to be deposited.\\n    /// @param _pnkWithdrawal The amount of PNK to be withdrawn.\\n    /// @param _newStake The new stake.\\n    function setStake(\\n        address _account,\\n        uint96 _courtID,\\n        uint256 _pnkDeposit,\\n        uint256 _pnkWithdrawal,\\n        uint256 _newStake\\n    ) external;\\n\\n    /// @notice Update the state of the stakes with a PNK reward deposit, called by KC during rewards execution.\\n    ///\\n    /// @dev `O(n + p * log_k(j))` where\\n    /// `n` is the number of courts the juror has staked in,\\n    /// `p` is the depth of the court tree,\\n    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,\\n    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.\\n    ///\\n    /// @param _account The address of the juror.\\n    /// @param _courtID The ID of the court.\\n    /// @param _penalty The amount of PNK to be deducted.\\n    /// @return pnkBalance The updated total PNK balance of the juror, including the penalty.\\n    /// @return newCourtStake The updated stake of the juror in the court.\\n    /// @return availablePenalty The amount of PNK that was actually deducted.\\n    function setStakePenalty(\\n        address _account,\\n        uint96 _courtID,\\n        uint256 _penalty\\n    ) external returns (uint256 pnkBalance, uint256 newCourtStake, uint256 availablePenalty);\\n\\n    /// @notice Update the state of the stakes with a PNK reward deposit, called by KC during rewards execution.\\n    ///\\n    /// @dev `O(n + p * log_k(j))` where\\n    /// `O(n + p * log_k(j))` where\\n    /// `n` is the number of courts the juror has staked in,\\n    /// `p` is the depth of the court tree,\\n    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,\\n    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.\\n    ///\\n    /// @param _account The address of the juror.\\n    /// @param _courtID The ID of the court.\\n    /// @param _reward The amount of PNK to be deposited as a reward.\\n    /// @return success True if the reward was added successfully.\\n    function setStakeReward(address _account, uint96 _courtID, uint256 _reward) external returns (bool success);\\n\\n    /// @notice Unstakes the inactive juror from all courts.\\n    ///\\n    /// @dev `O(n * (p * log_k(j)) )` where\\n    /// `O(n * (p * log_k(j)) )` where\\n    /// `n` is the number of courts the juror has staked in,\\n    /// `p` is the depth of the court tree,\\n    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,\\n    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.\\n    ///\\n    /// @param _account The juror to unstake.\\n    function forcedUnstakeAllCourts(address _account) external;\\n\\n    /// @notice Unstakes the inactive juror from a specific court.\\n    ///\\n    /// @dev `O(n * (p * log_k(j)) )` where\\n    /// `n` is the number of courts the juror has staked in,\\n    /// `p` is the depth of the court tree,\\n    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,\\n    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.\\n    ///\\n    /// @param _account The juror to unstake.\\n    /// @param _courtID The ID of the court.\\n    function forcedUnstake(address _account, uint96 _courtID) external;\\n\\n    /// @notice Locks the tokens of the drawn juror.\\n    /// @param _account The address of the juror.\\n    /// @param _relativeAmount The amount to lock.\\n    function lockStake(address _account, uint256 _relativeAmount) external;\\n\\n    /// @notice Unlocks the tokens of the drawn juror.\\n    /// @param _account The address of the juror.\\n    /// @param _relativeAmount The amount to unlock.\\n    function unlockStake(address _account, uint256 _relativeAmount) external;\\n\\n    /// @notice Triggers the state changes after dispute creation.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _roundID The ID of the round.\\n    function createDisputeHook(uint256 _disputeID, uint256 _roundID) external;\\n\\n    /// @notice Triggers the state changes after drawing.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _roundID The ID of the round.\\n    function postDrawHook(uint256 _disputeID, uint256 _roundID) external;\\n\\n    /// @notice Gives back the locked PNKs in case the juror fully unstaked earlier.\\n    ///\\n    /// @dev that since locked and staked PNK are async it is possible for the juror to have positive staked PNK balance\\n    /// while having 0 stake in courts and 0 locked tokens (eg. when the juror fully unstaked during dispute and later got his tokens unlocked).\\n    /// In this case the juror can use this function to withdraw the leftover tokens.\\n    /// Also note that if the juror has some leftover PNK while not fully unstaked he'll have to manually unstake from all courts to trigger this function.\\n    ///\\n    /// @param _account The juror whose PNK to withdraw.\\n    function withdrawLeftoverPNK(address _account) external;\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /// @notice Draw an ID from a tree using a number.\\n    ///\\n    /// @dev that this function reverts if the sum of all values in the tree is 0.\\n    /// `O(k * log_k(n))` where\\n    /// `k` is the maximum number of children per node in the tree,\\n    ///  and `n` is the maximum number of nodes ever appended.\\n    ///\\n    /// @param _courtID The ID of the court.\\n    /// @param _coreDisputeID Index of the dispute in Kleros Core.\\n    /// @param _nonce Nonce to hash with random number.\\n    /// @return drawnAddress The drawn address.\\n    function draw(\\n        uint96 _courtID,\\n        uint256 _coreDisputeID,\\n        uint256 _nonce\\n    ) external view returns (address drawnAddress, uint96 fromSubcourtID);\\n\\n    /// @notice Gets the balance of a juror in a court.\\n    /// @param _juror The address of the juror.\\n    /// @param _courtID The ID of the court.\\n    /// @return totalStakedPnk The total amount of tokens staked including locked tokens and penalty deductions. Equivalent to the effective stake in the General court.\\n    /// @return totalLocked The total amount of tokens locked in disputes.\\n    /// @return stakedInCourt The amount of tokens staked in the specified court including locked tokens and penalty deductions.\\n    /// @return nbCourts The number of courts the juror has directly staked in.\\n    function getJurorBalance(\\n        address _juror,\\n        uint96 _courtID\\n    ) external view returns (uint256 totalStakedPnk, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts);\\n\\n    /// @notice Gets the court identifiers where a specific `_juror` has staked.\\n    /// @param _juror The address of the juror.\\n    function getJurorCourtIDs(address _juror) external view returns (uint96[] memory);\\n\\n    /// @notice Checks if the juror is staked in any court.\\n    /// @param _juror The address of the juror.\\n    /// @return Whether the juror is staked or not.\\n    function isJurorStaked(address _juror) external view returns (bool);\\n\\n    /// @notice Checks if the juror has any leftover PNK in the contract.\\n    /// @param _juror The address of the juror.\\n    /// @return Whether the juror has leftover PNK.\\n    function getJurorLeftoverPNK(address _juror) external view returns (uint256);\\n}\\n\",\"keccak256\":\"0x3eeff4281ddf3c731c6503094bbbcc80d8015e3a60a27c8cadadfffdf1bf5437\",\"license\":\"MIT\"},\"src/libraries/Constants.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\nimport \\\"@openzeppelin/contracts/token/ERC20/IERC20.sol\\\";\\n\\n// Courts\\nuint96 constant FORKING_COURT = 0; // Index of the forking court.\\nuint96 constant GENERAL_COURT = 1; // Index of the default (general) court.\\n\\n// Dispute Kits\\nuint256 constant NULL_DISPUTE_KIT = 0; // Null pattern to indicate a top-level DK which has no parent.\\nuint256 constant DISPUTE_KIT_CLASSIC = 1; // Index of the default DK. 0 index is skipped.\\n\\n// Sortition Module\\nuint256 constant MAX_STAKE_PATHS = 4; // The maximum number of stake paths a juror can have.\\nuint256 constant DEFAULT_K = 6; // Default number of children per node.\\n\\n// Defaults\\nuint256 constant DEFAULT_NB_OF_JURORS = 3; // The default number of jurors in a dispute.\\nIERC20 constant NATIVE_CURRENCY = IERC20(address(0)); // The native currency, such as ETH on Arbitrum, Optimism and Ethereum L1.\\n\\n// Units\\nuint256 constant ONE_BASIS_POINT = 10000;\\n\\nenum OnError {\\n    Revert,\\n    Return\\n}\\n\\nenum StakingResult {\\n    Successful,\\n    Delayed,\\n    StakingTransferFailed,\\n    UnstakingTransferFailed,\\n    CannotStakeInMoreCourts,\\n    CannotStakeInThisCourt,\\n    CannotStakeLessThanMinStake,\\n    CannotStakeMoreThanMaxStakePerJuror,\\n    CannotStakeMoreThanMaxTotalStaked,\\n    CannotStakeZeroWhenNoStake\\n}\\n\",\"keccak256\":\"0xb8c96c842259ca1384e8450dfb214f0fcd604829c84293dd3f8981f3421b66c9\",\"license\":\"MIT\"},\"src/libraries/SafeERC20.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n// Adapted from https://github.com/OpenZeppelin/openzeppelin-contracts/blob/a7a94c77463acea95d979aae1580fb0ddc3b6a1e/contracts/token/ERC20/utils/SafeERC20.sol\\n\\npragma solidity ^0.8.24;\\n\\nimport \\\"@openzeppelin/contracts/token/ERC20/IERC20.sol\\\";\\n\\n/// @title SafeERC20\\n///\\n/// @notice Wrappers around ERC20 operations\\n///\\n/// @dev Throws on failure (when the token contract returns false).\\n/// Tokens that return no value (and instead revert or throw on failure) are also supported.\\n/// Non-reverting calls are assumed to be successful.\\n/// To use this library you can add a `using SafeERC20 for IERC20;` statement to your contract,\\n/// which allows you to call the safe operations as `token.safeTransfer(...)`, etc.\\nlibrary SafeERC20 {\\n    /// @notice Increases the allowance granted to `spender` by the caller.\\n    /// @param _token Token to transfer.\\n    /// @param _spender The address which will spend the funds.\\n    /// @param _addedValue The amount of tokens to increase the allowance by.\\n    function increaseAllowance(IERC20 _token, address _spender, uint256 _addedValue) internal returns (bool) {\\n        _token.approve(_spender, _token.allowance(address(this), _spender) + _addedValue);\\n        return true;\\n    }\\n\\n    /// @notice Calls transfer() without reverting.\\n    /// @param _token Token to transfer.\\n    /// @param _to Recipient address.\\n    /// @param _value Amount transferred.\\n    /// @return Whether transfer succeeded or not.\\n    function safeTransfer(IERC20 _token, address _to, uint256 _value) internal returns (bool) {\\n        (bool success, bytes memory data) = address(_token).call(abi.encodeCall(IERC20.transfer, (_to, _value)));\\n        return (success && (data.length == 0 || abi.decode(data, (bool))));\\n    }\\n\\n    /// @notice Calls transferFrom() without reverting.\\n    /// @param _token Token to transfer.\\n    /// @param _from Sender address.\\n    /// @param _to Recipient address.\\n    /// @param _value Amount transferred.\\n    /// @return Whether transfer succeeded or not.\\n    function safeTransferFrom(IERC20 _token, address _from, address _to, uint256 _value) internal returns (bool) {\\n        (bool success, bytes memory data) = address(_token).call(\\n            abi.encodeCall(IERC20.transferFrom, (_from, _to, _value))\\n        );\\n        return (success && (data.length == 0 || abi.decode(data, (bool))));\\n    }\\n}\\n\",\"keccak256\":\"0x36b92f984484f9dfd63a40ccb1c1e23cde0085db36ec8adb7afe7e98ef667bd7\",\"license\":\"MIT\"},\"src/libraries/SafeSend.sol\":{\"content\":\"/**\\n * @authors: [@andreimvp]\\n * @reviewers: [@divyangchauhan, @wadader, @fcanela, @unknownunknown1]\\n * @auditors: []\\n * @bounties: []\\n * SPDX-License-Identifier: MIT\\n */\\n\\npragma solidity ^0.8.24;\\n\\ninterface WethLike {\\n    function deposit() external payable;\\n\\n    function transfer(address dst, uint256 wad) external;\\n}\\n\\nlibrary SafeSend {\\n    function safeSend(address payable _to, uint256 _value, address _wethLike) internal {\\n        if (_to.send(_value)) return;\\n\\n        WethLike(_wethLike).deposit{value: _value}();\\n        WethLike(_wethLike).transfer(_to, _value); /// forge-lint: disable-line(erc20-unchecked-transfer)\\n    }\\n}\\n\",\"keccak256\":\"0xd4d5b25d0eb7f7965ea7a9e3d3d6bc13368de9aaf882543a75dc9c57c85e9283\",\"license\":\"MIT\"},\"src/proxy/Initializable.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v4.9.0) (proxy/utils/Initializable.sol) <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/utils/Initializable.sol>\\n\\npragma solidity ^0.8.24;\\n\\n/**\\n * @dev This is a base contract to aid in writing upgradeable contracts, or any kind of contract that will be deployed\\n * behind a proxy. Since proxied contracts do not make use of a constructor, it's common to move constructor logic to an\\n * external initializer function, usually called `initialize`. It then becomes necessary to protect this initializer\\n * function so it can only be called once. The {initializer} modifier provided by this contract will have this effect.\\n *\\n * The initialization functions use a version number. Once a version number is used, it is consumed and cannot be\\n * reused. This mechanism prevents re-execution of each \\\"step\\\" but allows the creation of new initialization steps in\\n * case an upgrade adds a module that needs to be initialized.\\n *\\n * For example:\\n *\\n * ```solidity\\n * contract MyToken is ERC20Upgradeable {\\n *     function initialize() initializer public {\\n *         __ERC20_init(\\\"MyToken\\\", \\\"MTK\\\");\\n *     }\\n * }\\n *\\n * contract MyTokenV2 is MyToken, ERC20PermitUpgradeable {\\n *     function initializeV2() reinitializer(2) public {\\n *         __ERC20Permit_init(\\\"MyToken\\\");\\n *     }\\n * }\\n * ```\\n *\\n * TIP: To avoid leaving the proxy in an uninitialized state, the initializer function should be called as early as\\n * possible by providing the encoded function call as the `_data` argument to the proxy constructor\\n *\\n * CAUTION: When used with inheritance, manual care must be taken to not invoke a parent initializer twice, or to ensure\\n * that all initializers are idempotent. This is not verified automatically as constructors are by Solidity.\\n *\\n * [CAUTION]\\n * ====\\n * Avoid leaving a contract uninitialized.\\n *\\n * An uninitialized contract can be taken over by an attacker. This applies to both a proxy and its implementation\\n * contract, which may impact the proxy. To prevent the implementation contract from being used, you should invoke\\n * the {_disableInitializers} function in the constructor to automatically lock it when it is deployed:\\n *\\n * ```\\n * /// @custom:oz-upgrades-unsafe-allow constructor\\n * constructor() {\\n *     _disableInitializers();\\n * }\\n * ```\\n */\\nabstract contract Initializable {\\n    /**\\n     * @dev Storage of the initializable contract.\\n     *\\n     * It's implemented on a custom ERC-7201 namespace to reduce the risk of storage collisions\\n     * when using with upgradeable contracts.\\n     *\\n     * @custom:storage-location erc7201:openzeppelin.storage.Initializable\\n     */\\n    struct InitializableStorage {\\n        /**\\n         * @dev Indicates that the contract has been initialized.\\n         */\\n        uint64 _initialized;\\n        /**\\n         * @dev Indicates that the contract is in the process of being initialized.\\n         */\\n        bool _initializing;\\n    }\\n\\n    // keccak256(abi.encode(uint256(keccak256(\\\"openzeppelin.storage.Initializable\\\")) - 1))\\n    bytes32 private constant _INITIALIZABLE_STORAGE =\\n        0xf0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e;\\n\\n    /**\\n     * @dev The contract is already initialized.\\n     */\\n    error AlreadyInitialized();\\n\\n    /**\\n     * @dev The contract is not initializing.\\n     */\\n    error NotInitializing();\\n\\n    /**\\n     * @dev Triggered when the contract has been initialized or reinitialized.\\n     */\\n    event Initialized(uint64 version);\\n\\n    /**\\n     * @dev A modifier that defines a protected initializer function that can be invoked at most once. In its scope,\\n     * `onlyInitializing` functions can be used to initialize parent contracts.\\n     *\\n     * Similar to `initializer()`, except that functions marked with `initializer` can be nested in the context of a\\n     * constructor.\\n     *\\n     * Emits an {Initialized} event.\\n     */\\n    modifier initializer() {\\n        // solhint-disable-next-line var-name-mixedcase\\n        InitializableStorage storage $ = _getInitializableStorage();\\n\\n        bool isTopLevelCall = !$._initializing;\\n        uint64 initialized = $._initialized;\\n        if (!(isTopLevelCall && initialized < 1) && !(address(this).code.length == 0 && initialized == 1)) {\\n            revert AlreadyInitialized();\\n        }\\n        $._initialized = 1;\\n        if (isTopLevelCall) {\\n            $._initializing = true;\\n        }\\n        _;\\n        if (isTopLevelCall) {\\n            $._initializing = false;\\n            emit Initialized(1);\\n        }\\n    }\\n\\n    /**\\n     * @dev A modifier that defines a protected reinitializer function that can be invoked at most once, and only if the\\n     * contract hasn't been initialized to a greater version before. In its scope, `onlyInitializing` functions can be\\n     * used to initialize parent contracts.\\n     *\\n     * A reinitializer may be used after the original initialization step. This is essential to configure modules that\\n     * are added through upgrades and that require initialization.\\n     *\\n     * When `version` is 1, this modifier is similar to `initializer`, except that functions marked with `reinitializer`\\n     * cannot be nested. If one is invoked in the context of another, execution will revert.\\n     *\\n     * Note that versions can jump in increments greater than 1; this implies that if multiple reinitializers coexist in\\n     * a contract, executing them in the right order is up to the developer or operator.\\n     *\\n     * WARNING: setting the version to 255 will prevent any future reinitialization.\\n     *\\n     * Emits an {Initialized} event.\\n     */\\n    modifier reinitializer(uint64 version) {\\n        // solhint-disable-next-line var-name-mixedcase\\n        InitializableStorage storage $ = _getInitializableStorage();\\n\\n        if ($._initializing || $._initialized >= version) {\\n            revert AlreadyInitialized();\\n        }\\n        $._initialized = version;\\n        $._initializing = true;\\n        _;\\n        $._initializing = false;\\n        emit Initialized(version);\\n    }\\n\\n    /**\\n     * @dev Modifier to protect an initialization function so that it can only be invoked by functions with the\\n     * {initializer} and {reinitializer} modifiers, directly or indirectly.\\n     */\\n    modifier onlyInitializing() {\\n        _checkInitializing();\\n        _;\\n    }\\n\\n    /**\\n     * @dev Reverts if the contract is not in an initializing state. See {onlyInitializing}.\\n     */\\n    function _checkInitializing() internal view virtual {\\n        if (!_isInitializing()) {\\n            revert NotInitializing();\\n        }\\n    }\\n\\n    /**\\n     * @dev Locks the contract, preventing any future reinitialization. This cannot be part of an initializer call.\\n     * Calling this in the constructor of a contract will prevent that contract from being initialized or reinitialized\\n     * to any version. It is recommended to use this to lock implementation contracts that are designed to be called\\n     * through proxies.\\n     *\\n     * Emits an {Initialized} event the first time it is successfully executed.\\n     */\\n    function _disableInitializers() internal virtual {\\n        // solhint-disable-next-line var-name-mixedcase\\n        InitializableStorage storage $ = _getInitializableStorage();\\n\\n        if ($._initializing) {\\n            revert AlreadyInitialized();\\n        }\\n        if ($._initialized != type(uint64).max) {\\n            $._initialized = type(uint64).max;\\n            emit Initialized(type(uint64).max);\\n        }\\n    }\\n\\n    /**\\n     * @dev Returns the highest version that has been initialized. See {reinitializer}.\\n     */\\n    function _getInitializedVersion() internal view returns (uint64) {\\n        return _getInitializableStorage()._initialized;\\n    }\\n\\n    /**\\n     * @dev Returns `true` if the contract is currently initializing. See {onlyInitializing}.\\n     */\\n    function _isInitializing() internal view returns (bool) {\\n        return _getInitializableStorage()._initializing;\\n    }\\n\\n    /**\\n     * @dev Returns a pointer to the storage namespace.\\n     */\\n    // solhint-disable-next-line var-name-mixedcase\\n    function _getInitializableStorage() private pure returns (InitializableStorage storage $) {\\n        assembly {\\n            $.slot := _INITIALIZABLE_STORAGE\\n        }\\n    }\\n}\\n\",\"keccak256\":\"0xdad09e5f773fa6940dbd8c28480f602a7eaa3c70d3da9d06df140187cbf5dad4\",\"license\":\"MIT\"},\"src/proxy/UUPSProxiable.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\n/// @title UUPS Proxiable\\n/// @author Simon Malatrait <simon.malatrait@grenoble-inp.org>\\n/// @notice This contract implements an upgradeability mechanism designed for UUPS proxies.\\n///\\n/// @dev Adapted from <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/utils/UUPSUpgradeable.sol>\\n/// The functions included here can perform an upgrade of an UUPS Proxy, when this contract is set as the implementation behind such a proxy.\\n///\\n/// IMPORTANT: A UUPS proxy requires its upgradeability functions to be in the implementation as opposed to the transparent proxy.\\n/// This means that if the proxy is upgraded to an implementation that does not support this interface, it will no longer be upgradeable.\\n///\\n/// A security mechanism ensures that an upgrade does not turn off upgradeability accidentally, although this risk is\\n/// reinstated if the upgrade retains upgradeability but removes the security mechanism, e.g. by replacing\\n/// `UUPSProxiable` with a custom implementation of upgrades.\\n///\\n/// The `_authorizeUpgrade` function must be overridden to include access restriction to the upgrade mechanism.\\nabstract contract UUPSProxiable {\\n    // ************************************* //\\n    // *             Event                 * //\\n    // ************************************* //\\n\\n    /// @notice Emitted when the `implementation` has been successfully upgraded.\\n    /// @param newImplementation Address of the new implementation the proxy is now forwarding calls to.\\n    event Upgraded(address indexed newImplementation);\\n\\n    // ************************************* //\\n    // *             Error                 * //\\n    // ************************************* //\\n\\n    /// @notice The call is from an unauthorized context.\\n    error UUPSUnauthorizedCallContext();\\n\\n    /// @notice The storage `slot` is unsupported as a UUID.\\n    error UUPSUnsupportedProxiableUUID(bytes32 slot);\\n\\n    /// @notice The `implementation` is not UUPS-compliant\\n    error InvalidImplementation(address implementation);\\n\\n    /// Failed Delegated call\\n    error FailedDelegateCall();\\n\\n    // ************************************* //\\n    // *             Storage               * //\\n    // ************************************* //\\n\\n    /// @dev Storage slot with the address of the current implementation.\\n    /// @dev This is the keccak-256 hash of \\\"eip1967.proxy.implementation\\\" subtracted by 1, and is\\n    /// @dev validated in the constructor.\\n    /// @dev NOTE: bytes32(uint256(keccak256('eip1967.proxy.implementation')) - 1)\\n    bytes32 private constant IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;\\n\\n    /// @dev Storage variable of the proxiable contract address.\\n    /// @dev It is used to check whether or not the current call is from the proxy.\\n    /// @custom:oz-upgrades-unsafe-allow state-variable-immutable\\n    address private immutable __self = address(this);\\n\\n    // ************************************* //\\n    // *             Governance            * //\\n    // ************************************* //\\n\\n    /// @dev Function that should revert when `msg.sender` is not authorized to upgrade the contract.\\n    /// @dev Called by {upgradeToAndCall}.\\n    function _authorizeUpgrade(address newImplementation) internal virtual;\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @notice Upgrade mechanism including access control and UUPS-compliance.\\n    /// @param newImplementation Address of the new implementation contract.\\n    /// @param data Data used in a delegate call to `newImplementation` if non-empty. This will typically be an encoded\\n    /// function call, and allows initializing the storage of the proxy like a Solidity constructor.\\n    /// @dev Reverts if the execution is not performed via delegatecall or the execution\\n    /// context is not of a proxy with an ERC1967-compliant implementation pointing to self.\\n    function upgradeToAndCall(address newImplementation, bytes memory data) public payable virtual {\\n        _authorizeUpgrade(newImplementation);\\n\\n        // Check that the execution is being performed through a delegatecall call and that the execution context is\\n        // a proxy contract with an implementation (as defined in ERC1967) pointing to self.\\n        if (address(this) == __self || _getImplementation() != __self) {\\n            revert UUPSUnauthorizedCallContext();\\n        }\\n\\n        try UUPSProxiable(newImplementation).proxiableUUID() returns (bytes32 slot) {\\n            if (slot != IMPLEMENTATION_SLOT) {\\n                revert UUPSUnsupportedProxiableUUID(slot);\\n            }\\n            // Store the new implementation address to the implementation storage slot.\\n            assembly {\\n                sstore(IMPLEMENTATION_SLOT, newImplementation)\\n            }\\n            emit Upgraded(newImplementation);\\n\\n            if (data.length != 0) {\\n                // The return data is not checked (checking, in case of success, that the newImplementation code is non-empty if the return data is empty) because the authorized callee is trusted.\\n                /// @custom:oz-upgrades-unsafe-allow delegatecall\\n                (bool success, ) = newImplementation.delegatecall(data);\\n                if (!success) {\\n                    revert FailedDelegateCall();\\n                }\\n            }\\n        } catch {\\n            revert InvalidImplementation(newImplementation);\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /// @notice Implementation of the ERC1822 `proxiableUUID` function. This returns the storage slot used by the\\n    /// implementation. It is used to validate the implementation's compatibility when performing an upgrade.\\n    ///\\n    /// @dev IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks\\n    /// bricking a proxy that upgrades to it, by delegating to itself until out of gas. Thus it is critical that this\\n    /// function revert if invoked through a proxy. This is guaranteed by the if statement.\\n    function proxiableUUID() external view virtual returns (bytes32) {\\n        if (address(this) != __self) {\\n            // Must not be called through delegatecall\\n            revert UUPSUnauthorizedCallContext();\\n        }\\n        return IMPLEMENTATION_SLOT;\\n    }\\n\\n    /// @notice Returns the version of the implementation.\\n    /// @return Version string.\\n    function version() external view virtual returns (string memory);\\n\\n    // ************************************* //\\n    // *           Internal Views          * //\\n    // ************************************* //\\n\\n    function _getImplementation() internal view returns (address implementation) {\\n        assembly {\\n            implementation := sload(IMPLEMENTATION_SLOT)\\n        }\\n    }\\n}\\n\",\"keccak256\":\"0xa369061748e8a7b02873d597d4c78a2a09328111f04a97428b1c209e82cf5414\",\"license\":\"MIT\"}},\"version\":1}",
+  "bytecode": "0x60a080604052346100c157306080525f5160206133bf5f395f51905f525460ff8160401c166100b3576002600160401b03196001600160401b03821601610060575b6040516132f990816100c682396080518181816117f601526118a60152f35b6001600160401b0319166001600160401b039081175f5160206133bf5f395f51905f525581527fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d290602090a15f80610041565b62dc149f60e41b5f5260045ffd5b5f80fdfe6080806040526004361015610012575f80fd5b5f905f3560e01c9081630855bbe914612836575080630baa64d1146127e25780631200aabc146127b8578063149a5dc0146127a55780631c3db16d146126755780631cc3423a146126335780632621b9a2146126115780632d68efc9146125eb578063362c34791461222d5780634b2f0ea014611ad65780634e514a1b14611ab95780634f1ef2861461185557806352d1902d146117db57806354fd4d501461177a578063564a565d1461166e5780635c92e2f6146113fc57806365540b961461139a57806369f3f041146113095780636a8c9194146112725780636d4cd8ea1461111e57806372d610d9146110e35780637c04034e14610b915780638da5cb5b14610b6b5780638e42646014610b145780639146cd4714610aaf5780639d61ab6e14610a86578063a0d216d114610a68578063a6f9dae114610a11578063a7cc08fe14610997578063b34bfaa81461097a578063b6ede5401461067a578063b70020d61461064b578063ba66fde7146105f4578063be467604146105d7578063cf756fdf14610380578063d2b8035a146102ee578063da3beb8c146102cc578063e349ad30146102af578063f2f4eb2614610288578063f32ab92714610246578063f8abee10146102175763fc6f8f16146101ec575f80fd5b3461021457602036600319011261021457602061020a6004356129ee565b5054604051908152f35b80fd5b50346102145760203660031901126102145760ff60406020926004358152600584522054166040519015158152f35b50346102145760409081610259366129b4565b92908152600360205260038282205493610272856129ee565b5090835201602052205482519182526020820152f35b503461021457806003193601126102145760206001600160a01b0360015416604051908152f35b503461021457806003193601126102145760206040516127108152f35b50346102145760206102e66102e0366129b4565b90612fd2565b604051908152f35b5034610214576102fd366129b4565b916001600160a01b0360015416330361037257818152600360205260ff600261032960408420546129ee565b500154166103635760406bffffffffffffffffffffffff61034a8585612cec565b6001600160a01b03849392935193168352166020820152f35b8063070f7fa560e51b60049252fd5b80628448c760e31b60049252fd5b50346102145760803660031901126102145761039a61299e565b6024356001600160a01b0381168091036105d3576044356001600160a01b0381168091036105cf577ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e549160ff8360401c16159267ffffffffffffffff811684806105c5575b1590816105a7575b5061057f5767ffffffffffffffff1981166001177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e5583610540575b507ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e549360ff8560401c1615610518576001600160a01b03166001600160a01b03198654161785556001600160a01b031960015416176001556001600160a01b031960065416176006556064356007556104bc575080f35b68ff000000000000000019167ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e557fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d2602060405160018152a180f35b6004867fd7e6bcf8000000000000000000000000000000000000000000000000000000008152fd5b68ffffffffffffffffff191668010000000000000001177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e555f610444565b6004867f0dc149f0000000000000000000000000000000000000000000000000000000008152fd5b303b159150816105ba575b50155f610408565b60019150145f6105b2565b5060018110610400565b8380fd5b8280fd5b503461021457806003193601126102145760206040516113888152f35b50346102145760ff61063e604061063860209461061036612a73565b94918391935260038852610626828220546129ee565b50928152600383018852205490612ae1565b50612cd3565b5054166040519015158152f35b50346102145780600319360112610214575060075480610672575060206001604051908152f35b6020906102e6565b50346102145760803660031901126102145760043560443560243567ffffffffffffffff82116105cf57366023830112156105cf57816004013567ffffffffffffffff8111610976573660248285010111610976576001600160a01b0360015416330361096857600254680100000000000000008110156109545760018101600255610705816129ee565b508360018201556004810161071a8154612a0a565b601f811161090f575b508388601f82116001146108a6578991610898575b508460011b905f198660031b1c19161790555b6002810160ff1981541690558054602460206001600160a01b036001541660405192838092637e37c78b60e11b82528c60048301525afa90811561088d578991610857575b505f198101908111610843576107dd606095937fd3106f74c2d30a4b9230e756a3e78bde53865d40f6af4c479bb010ebaab58108989795936003938c5283820160205260408c2055612bca565b5001600160ff1982541617905586885260036020526040882055858752600560205260408720600160ff1982541617905580602460405195869485526040602086015282604086015201848401378181018301879052601f01601f19168101030190a280f35b602489634e487b7160e01b81526011600452fd5b90506020813d602011610885575b816108726020938361291c565b8101031261088157515f610790565b5f80fd5b3d9150610865565b6040513d8b823e3d90fd5b60249150870101355f610738565b828a5260208a20915085601f1981168b5b8a8282106108f2575050106108d6575b5050600184811b01905561074b565b8701602401355f19600387901b60f8161c191690555f806108c7565b8401602401358555600190940193602093840193899350016108b7565b81895260208920601f860160051c8101916020871061094a575b601f0160051c01905b81811061093f5750610723565b898155600101610932565b9091508190610929565b602486634e487b7160e01b81526041600452fd5b600485628448c760e31b8152fd5b8480fd5b50346102145780600319360112610214576020604051614e208152f35b5034610214576109db60406106386080936109b136612a73565b94918391935260036020526109c8828220546129ee565b5092815260038301602052205490612ae1565b5060ff815460026001840154930154604051936001600160a01b038360081c168552602085015260408401521615156060820152f35b503461021457602036600319011261021457610a2b61299e565b815490336001600160a01b03831603610a59576001600160a01b036001600160a01b03199116911617815580f35b600483630b2db9b760e31b8152fd5b50346102145780600319360112610214576020600754604051908152f35b5034610214576040610aa2610a9a366128fa565b5050916130b9565b8151908082526020820152f35b5034610214576040366003190112610214576004356001600160a01b0381160361021457602435908160011b9180830460021490151715610b005760018201809211610b0057602082604051908152f35b80634e487b7160e01b602492526011600452fd5b503461021457602036600319011261021457610b2e61299e565b6001600160a01b038254163303610b5c576001600160a01b03166001600160a01b0319600154161760015580f35b600482630b2db9b760e31b8152fd5b50346102145780600319360112610214576001600160a01b036020915416604051908152f35b50346102145760a03660031901126102145760043560243567ffffffffffffffff81116105d357610bc6903690600401612a42565b90916044359260843567ffffffffffffffff81116110df57610bec90369060040161295a565b92828652600360205260ff6002610c0660408920546129ee565b500154166110d0576001600160a01b036001541660405163564a565d60e01b815284600482015260a081602481855afa9081156110c55788916110a1575b50600581101561108d5760020361106557811561103d57838752600560205260ff6040882054161561102e578387526003602052604087205490610c87826129ee565b50906001820154881161101f5781545f1981019290831161100b5782610cac91612ae1565b509260405163564a565d60e01b815287600482015260a081602481865afa908b8215610fff5760c0926bffffffffffffffffffffffff9260249291610fcc575b506040519586938492630fad06e960e11b84521660048301525afa918215610fc1578a92610f8a575b50610d226064358a612b6e565b908a5b868110610e6b575050505050908160047fa000893c71384499023d2d7b21234f7b9e80c78e0330f357dcd667ff578bd3a4949301610d64838254612bbd565b905560028101908789528160205260408920610d81848254612bbd565b90558760018201928354908183145f14610de7575050506003915001805460ff8116610dda575b50505b610dd4610dc5604051938493604085526040850191613286565b828103602084015233966129ca565b0390a480f35b60ff191690555f80610da8565b828c528060205260408c2054828d528160205260408d2054145f14610e31575050506003915001805460ff811615610e21575b5050610dab565b60ff191660011790555f80610e1a565b828c528060205260408c2054918c5260205260408b205410610e56575b505050610dab565b600392550160ff1981541690555f8087610e4e565b610e80610e7982898b613276565b3587612cd3565b506001600160a01b0333915460081c1603610f7b578380610f4b575b610f235760ff610eb7610eb0838a8c613276565b3588612cd3565b505416610efb57808b6002610ed9610ed26001958c8e613276565b358a612cd3565b500155610eea610eb0828a8c613276565b50805460ff19168317905501610d25565b60048c7fb3808bab000000000000000000000000000000000000000000000000000000008152fd5b60048c7f953075a3000000000000000000000000000000000000000000000000000000008152fd5b50826001610f71610f5d848b8d613276565b3561063889610f6b886129ee565b50612ae1565b5001541415610e9c565b60048c638016bef760e01b8152fd5b610fad91925060c03d60c011610fba575b610fa5818361291c565b810190612c97565b505050509050905f610d15565b503d610f9b565b6040513d8c823e3d90fd5b610fee915060a03d60a011610ff8575b610fe6818361291c565b810190612b20565b505050505f610cec565b503d610fdc565b604051903d90823e3d90fd5b60248a634e487b7160e01b81526011600452fd5b600489637cd5012560e11b8152fd5b6004876333f97f8960e01b8152fd5b6004877fb7a08e6e000000000000000000000000000000000000000000000000000000008152fd5b6004877febd6a5e7000000000000000000000000000000000000000000000000000000008152fd5b602488634e487b7160e01b81526021600452fd5b6110ba915060a03d60a011610ff857610fe6818361291c565b50509150505f610c44565b6040513d8a823e3d90fd5b60048663070f7fa560e51b8152fd5b8580fd5b5034610214576020366003190112610214576001600160a01b03815416330361110f5760043560075580f35b80630b2db9b760e31b60049252fd5b503461021457602036600319011261021457600435808252600360205261114860408320546129ee565b5080545f1981019190821161125e579061116191612ae1565b50906001600160a01b0360015416906040519063564a565d60e01b8252600482015260a081602481855afa80156112535760246bffffffffffffffffffffffff9160c0938791611230575b506040519485938492630fad06e960e11b84521660048301525afa908115611225579260209381926111fe575b5050156111f45760046005820154915b015414604051908152f35b60048154916111e9565b61121891925060c03d60c011610fba57610fa5818361291c565b505050509050905f6111d9565b6040513d85823e3d90fd5b611249915060a03d60a011610ff857610fe6818361291c565b505050505f6111ac565b6040513d86823e3d90fd5b602484634e487b7160e01b81526011600452fd5b50346102145760603660031901126102145761128c61299e565b60443567ffffffffffffffff81116105d3576112ac90369060040161295a565b906001600160a01b038354163303610a5957818392916020849351920190602435905af16112d8612bf0565b50156112e15780f35b807f44125e5e0000000000000000000000000000000000000000000000000000000060049252fd5b50346102145761134a60c09161131e36612a73565b93918352600360205261133460408420546129ee565b5090835260038101602052604083205490612ae1565b509160018301549260ff60038201541692604060048301549160026005850154948054968352016020522054936040519586521515602086015260408501526060840152608083015260a0820152f35b5034610214576020366003190112610214576113b7600435612c1f565b90604051918291602083016020845282518091526020604085019301915b8181106113e3575050500390f35b82518452859450602093840193909201916001016113d5565b50346102145760603660031901126102145760043560243567ffffffffffffffff81116105d357611431903690600401612a42565b60449291923592828552600360205260ff600261145160408820546129ee565b5001541661165f57602460a06001600160a01b03600154166040519283809263564a565d60e01b82528860048301525afa908115611654578691611630575b50600581101561161c576001036115f45783156115cc57828552600560205260ff604086205416156115bd5782855260036020526114d160408620546129ee565b5080545f198101919082116115a957906114ea91612ae1565b50855b83811061154d57507f05cc2f1c94966f1c961b410a50f3d3ffb64501346753a258177097ea23707f089291600561153e920161152a848254612bbd565b905560405192604084526040840191613286565b9360208201528033940390a380f35b61156261155b828686613276565b3583612cd3565b506001600160a01b0333915460081c160361159a578086600161159161158a82958989613276565b3586612cd3565b500155016114ed565b600487638016bef760e01b8152fd5b602487634e487b7160e01b81526011600452fd5b6004856333f97f8960e01b8152fd5b6004857f37b5b73d000000000000000000000000000000000000000000000000000000008152fd5b6004857f97ab7f79000000000000000000000000000000000000000000000000000000008152fd5b602486634e487b7160e01b81526021600452fd5b611649915060a03d60a011610ff857610fe6818361291c565b50509150505f611490565b6040513d88823e3d90fd5b60048563070f7fa560e51b8152fd5b50346102145760203660031901126102145760043560025481101561177657611696906129ee565b5090600182015490600460ff60028501541693019060405191818154916116bc83612a0a565b808652926001811690811561174c575060011461170b575b505050906116e78161170793038261291c565b6040519384938452151560208401526060604084015260608301906129ca565b0390f35b815260208120939250905b808210611732575090915081016020016116e7826117076116d4565b919260018160209254838588010152019101909291611716565b869550611707969350602092506116e794915060ff191682840152151560051b82010192936116d4565b5080fd5b50346102145780600319360112610214575061170760405161179d60408261291c565b600581527f322e302e3000000000000000000000000000000000000000000000000000000060208201526040519182916020835260208301906129ca565b50346102145780600319360112610214576001600160a01b037f00000000000000000000000000000000000000000000000000000000000000001630036118465760206040517f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc8152f35b8063703e46dd60e11b60049252fd5b5060403660031901126102145761186a61299e565b9060243567ffffffffffffffff81116117765761188b90369060040161295a565b6001600160a01b038254163303610b5c576001600160a01b037f000000000000000000000000000000000000000000000000000000000000000016803014908115611a84575b50611a75576001600160a01b03831690604051937f52d1902d000000000000000000000000000000000000000000000000000000008552602085600481865afa80958596611a41575b5061194b57602484847f0c760937000000000000000000000000000000000000000000000000000000008252600452fd5b90917f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc8503611a1557839450817f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc557fbc7cd75a20ee27fd9adebab32041f755214dbc6bffa90cc0225b39da2e5c2d3b8480a2815190816119ce575b5050505080f35b6020849301905af46119de612bf0565b50156119ed57805f80806119c7565b807f736436ba0000000000000000000000000000000000000000000000000000000060049252fd5b602484867faa1d49a4000000000000000000000000000000000000000000000000000000008252600452fd5b9095506020813d602011611a6d575b81611a5d6020938361291c565b810103126109765751945f61191a565b3d9150611a50565b60048263703e46dd60e11b8152fd5b90506001600160a01b037f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc541614155f6118d1565b503461021457602036600319011261021457602090604051908152f35b50611ae0366129b4565b90805f52600360205260ff6002611afa60405f20546129ee565b5001541661221e57805f526003602052611b1760405f20546129ee565b509060018201908154841161220f57805f52600560205260ff60405f20541615612200576001600160a01b036001541660405163afe15cfb60e01b8152826004820152604081602481855afa908115611e61575f905f926121ce575b5080421080156121c4575b61219c57604051631c3db16d60e01b8152846004820152606081602481305afa8015611e615788915f9161216b575b5003612106575050612710945b84545f1981019081116120be57611bd19086612ae1565b5060405191637e37c78b60e11b8352846004840152602083602481875afa928315611e61575f936120d2575b505f1983018381116120be576007830198825f528960205260ff60405f205416612096576020602496604051978880927f59ec827e0000000000000000000000000000000000000000000000000000000082528b60048301525afa958615611e61575f96612060575b50612710611c77611c7e9288612ab0565b0486612bbd565b985f996006850190845f528160205260405f20548111611fea575b6001600160a01b0333165f526008860160205260405f20855f5260205260405f20611cc58d8254612bbd565b9055845f528160205260405f20611cdd8d8254612bbd565b9055845f528160205260405f20541015611f34575b505050506001600a82015411611d37575b505050505050803411611d14575080f35b611d21611d349134612aa3565b6001600160a01b03600654169033613173565b80f35b600901611d45838254612aa3565b9055602460206001600160a01b0360015416604051928380927f19b815290000000000000000000000000000000000000000000000000000000082528860048301525afa908115611e61575f91611efa575b5015611ecc575060028401805460ff191660011790555b60046001600160a01b036001541693549401833b15610881576040519485937fc356990200000000000000000000000000000000000000000000000000000000855260048501526024840152606060448401525f90805490611e0f82612a0a565b918260648701526001811690815f14611ea75750600114611e6c575b50505f939183809203925af18015611e6157611e4c575b8080808080611d03565b611e599192505f9061291c565b5f905f611e42565b6040513d5f823e3d90fd5b5f908152602081209092505b818310611e8d57505082016084018183611e2b565b805460848489010152869450602090920191600101611e78565b60ff191660848088019190915292151560051b86019092019250839150849050611e2b565b8454905f526003850160205260405f20556003611ee885612bca565b5001805460ff19166001179055611dae565b90506020813d602011611f2c575b81611f156020938361291c565b8101031261088157611f2690612b13565b5f611d97565b3d9150611f08565b835f5260205260405f2054611f4e60098601918254612bbd565b9055600a8401805468010000000000000000811015611fd65760018101808355811015611fc25784915f5260205f200155825f5260205260405f20600160ff19825416179055857fed764996238e4c1c873ae3af7ae2f00f1f6f4f10b9ac7d4bbea4a764c5dea0095f80a45f808080611cf2565b634e487b7160e01b5f52603260045260245ffd5b634e487b7160e01b5f52604160045260245ffd5b9a50835f528060205261200160405f20548c612aa3565b34101561204557349a5b8b604051908682526020820152848a7fcae597f39a3ad75c2e10d46b031f023c5c2babcd58ca0491b122acda3968d4c060403394a4611c99565b835f528060205261205a60405f20548c612aa3565b9a61200b565b9095506020813d60201161208e575b8161207c6020938361291c565b81010312610881575194612710611c66565b3d915061206f565b7fbcdf54db000000000000000000000000000000000000000000000000000000005f5260045ffd5b634e487b7160e01b5f52601160045260245ffd5b9092506020813d6020116120fe575b816120ee6020938361291c565b810103126108815751915f611bfd565b3d91506120e1565b8061211461211a9242612aa3565b92612aa3565b61138881029080820461138814901517156120be576127109004111561214357614e2094611bba565b7f508aa06c000000000000000000000000000000000000000000000000000000005f5260045ffd5b61218d915060603d606011612195575b612185818361291c565b810190612b94565b50505f611bad565b503d61217b565b7f13e72a50000000000000000000000000000000000000000000000000000000005f5260045ffd5b5081421015611b7e565b90506121f2915060403d6040116121f9575b6121ea818361291c565b810190612a8d565b905f611b73565b503d6121e0565b6333f97f8960e01b5f5260045ffd5b637cd5012560e11b5f5260045ffd5b63070f7fa560e51b5f5260045ffd5b34610881576080366003190112610881576024356004356001600160a01b03821680830361088157604435606435925f936001600160a01b03600154169460405163564a565d60e01b815283600482015260a0816024818a5afa908115611e61575f916125c7575b501561259f576040517f5c975abb0000000000000000000000000000000000000000000000000000000081526020816004818a5afa908115611e61575f91612565575b5061253d57825f52600560205260ff60405f2054161561220057825f5260036020526024606061232461230e60405f20546129ee565b50875f526003810160205260405f205490612ae1565b509760405192838092631c3db16d60e01b82528860048301525afa908115611e61575f9161251c575b506007870190835f528160205260ff60405f205416155f146123ff57505050602095845f5260088601875260405f20825f528752600860405f2054965b865f5201875260405f20825f5287525f6040812055856123af575b8686604051908152f35b7f54b3cab3cb5c4aca3209db1151caff092e878011202e43a36782d4ebe0b963ae916123ea604092886001600160a01b036006541691613173565b81519081528688820152a482808080806123a5565b83810361246d5750505060209560068601825f5280885260405f205415155f146124645761245e600891875f528289018a5260405f20855f528a5261244d60405f205460098b015490612ab0565b90855f528a5260405f205490612ac3565b9661238a565b5060085f61245e565b5f9792975260205260ff60405f2054161561248e575b95600860209761238a565b9450835f526008850160205260405f20815f526020526124b760405f2054600987015490612ab0565b956006860196600a870197885415611fc257885f5260205f20545f528060205260405f205491895460011015611fc25761250c6008936125129360209c5f5260018d5f2001545f528c5260405f205490612bbd565b90612ac3565b9691975050612483565b612535915060603d60601161219557612185818361291c565b50508861234d565b7f88226c22000000000000000000000000000000000000000000000000000000005f5260045ffd5b90506020813d602011612597575b816125806020938361291c565b810103126108815761259190612b13565b886122d8565b3d9150612573565b7f8a7dc9ee000000000000000000000000000000000000000000000000000000005f5260045ffd5b6125e0915060a03d60a011610ff857610fe6818361291c565b509250505088612295565b34610881575f3660031901126108815760206001600160a01b0360065416604051908152f35b34610881575f36600319011261088157602060ff600454166040519015158152f35b346108815760603660031901126108815760443567ffffffffffffffff81116108815761266490369060040161295a565b5060206102e6602435600435612b6e565b34610881576020366003190112610881576004355f90805f5260036020526126a060405f20546129ee565b5080545f1981019081116120be576126b791612ae1565b50600381015460ff169290831561279c57505f5b91602460a06001600160a01b03600154166040519283809263564a565d60e01b82528660048301525afa908115611e61575f91612778575b5060058110156127645760041461272f575b506060926040519283521515602083015215156040820152f35b61273890612c1f565b9283516001811461274b575b5092612715565b9250505015611fc2576020015160609060015f84612744565b634e487b7160e01b5f52602160045260245ffd5b612791915060a03d60a011610ff857610fe6818361291c565b505091505085612703565b600101546126cb565b346108815760206102e6610a9a366128fa565b34610881576020366003190112610881576004355f526003602052602060405f2054604051908152f35b34610881576020366003190112610881576004355f52600360205261280a60405f20546129ee565b5080545f198101919082116120be5760209161282591612ae1565b506005810154905414604051908152f35b3461088157602036600319011261088157600435906040816024816001600160a01b036001541663afe15cfb60e01b82528660048301525afa918215611e61575f915f936128d3575b5061288990612c1f565b5115908161289f575b6020826040519015158152f35b6128ae91506121148142612aa3565b9061138882029180830461138814901517156120be5761271060209204111582612892565b6128f2919350612889925060403d6040116121f9576121ea818361291c565b92909161287f565b60a0906003190112610881576004359060243590604435906064359060843590565b90601f8019910116810190811067ffffffffffffffff821117611fd657604052565b67ffffffffffffffff8111611fd657601f01601f191660200190565b81601f82011215610881576020813591016129748261293e565b92612982604051948561291c565b8284528282011161088157815f92602092838601378301015290565b600435906001600160a01b038216820361088157565b6040906003190112610881576004359060243590565b805180835260209291819084018484015e5f828201840152601f01601f1916010190565b600254811015611fc25760025f52600f60205f20910201905f90565b90600182811c92168015612a38575b6020831014612a2457565b634e487b7160e01b5f52602260045260245ffd5b91607f1691612a19565b9181601f840112156108815782359167ffffffffffffffff8311610881576020808501948460051b01011161088157565b606090600319011261088157600435906024359060443590565b9190826040910312610881576020825192015190565b919082039182116120be57565b818102929181159184041417156120be57565b8115612acd570490565b634e487b7160e01b5f52601260045260245ffd5b8054821015611fc2575f52601660205f20910201905f90565b51906bffffffffffffffffffffffff8216820361088157565b5190811515820361088157565b908160a091031261088157612b3481612afa565b9160208201516001600160a01b038116810361088157916040810151600581101561088157916080612b6860608401612b13565b92015190565b906040519060208201928352604082015260408152612b8e60608261291c565b51902090565b9081606091031261088157805191612bba6040612bb360208501612b13565b9301612b13565b90565b919082018092116120be57565b805468010000000000000000811015611fd657612bec91600182018155612ae1565b9091565b3d15612c1a573d90612c018261293e565b91612c0f604051938461291c565b82523d5f602084013e565b606090565b5f526003602052612c3360405f20546129ee565b5080545f198101919082116120be57600a91612c4e91612ae1565b5001604051808260208294549384815201905f5260205f20925f5b818110612c7e575050612bba9250038261291c565b8454835260019485019486945060209093019201612c69565b91908260c091031261088157612cac82612afa565b91612cb960208201612b13565b9160408201519160608101519160a0608083015192015190565b8054821015611fc2575f52600d60205f20910201905f90565b9091815f526003602052612d0360405f20546129ee565b5080545f1981019081116120be57612d1a91612ae1565b506001600160a01b03600154166040517f2e1daf2f000000000000000000000000000000000000000000000000000000008152602081600481855afa908115611e61575f91612f8d575b5060a06024926040519384809263564a565d60e01b82528960048301525afa918215611e61576040926bffffffffffffffffffffffff926064925f92612f5f575b506001600160a01b03908551998a9586947fd045e0020000000000000000000000000000000000000000000000000000000086521660048501528960248501526044840152165afa928315611e61575f945f94612f0c575b5083856001600160a01b03811615612f0457505060045460ff1615612efc575f526003602052612e3060405f20546129ee565b5080545f198101919082116120be57600b91612e4b91612ae1565b506001600160a01b0386165f520160205260ff60405f205416155b15612ef65780549068010000000000000000821015611fd657612e91826001600b9401835582612cd3565b5080547fffffffffffffffffffffff0000000000000000000000000000000000000000ff74ffffffffffffffffffffffffffffffffffffffff008860081b1691161790556001600160a01b0385165f520160205260405f20600160ff19825416179055565b505f9250565b506001612e66565b955093505050565b945092506040843d604011612f57575b81612f296040938361291c565b81010312610881578351936001600160a01b0385168503610881576020612f509101612afa565b925f612dfd565b3d9150612f1c565b6001600160a01b03919250612f829060a03d60a011610ff857610fe6818361291c565b505050509190612da5565b90506020813d602011612fca575b81612fa86020938361291c565b810103126108815751906001600160a01b0382168203610881579060a0612d64565b3d9150612f9b565b9061300290825f526003602052612fec60405f20546129ee565b50905f526003810160205260405f205490612ae1565b5060606001600160a01b036001541692602460405180958193631c3db16d60e01b835260048301525afa918215611e61575f905f93613094575b5060048201549283158015613075575b1561305957505050505f90565b1561306357505090565b600292505f520160205260405f205490565b508015801561304c5750815f526002830160205260405f20541561304c565b90506130b091925060603d60601161219557612185818361291c565b5091905f61303c565b916106386130d692845f526003602052612fec60405f20546129ee565b509060606001600160a01b036001541691602460405180948193631c3db16d60e01b835260048301525afa908115611e61575f905f92613150575b5060ff8354169283613131575b5050505f1461312d5761271090565b5f90565b600201541491508115613148575b505f808061311e565b90505f61313f565b905061316b915060603d60601161219557612185818361291c565b50905f613111565b6001600160a01b0316905f925f8284811561326c575b5f92839283928392f1613266576001600160a01b031691823b15610881576040517fd0e30db00000000000000000000000000000000000000000000000000000000081525f8160048186885af18015611e6157613251575b50823b156105cf5790604484928360405195869485937fa9059cbb000000000000000000000000000000000000000000000000000000008552600485015260248401525af1801561324657613234575050565b61323f82809261291c565b6102145750565b6040513d84823e3d90fd5b61325e9194505f9061291c565b5f925f6131e1565b50505050565b6108fc9250613189565b9190811015611fc25760051b0190565b90918281527f07ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff83116108815760209260051b80928483013701019056fea2646970667358221220b5aaba208006c2770b2a559bb6595fe7390db7c206ee67f59edf25055757c98c64736f6c634300081e0033f0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e",
+  "deployedBytecode": "0x6080806040526004361015610012575f80fd5b5f905f3560e01c9081630855bbe914612836575080630baa64d1146127e25780631200aabc146127b8578063149a5dc0146127a55780631c3db16d146126755780631cc3423a146126335780632621b9a2146126115780632d68efc9146125eb578063362c34791461222d5780634b2f0ea014611ad65780634e514a1b14611ab95780634f1ef2861461185557806352d1902d146117db57806354fd4d501461177a578063564a565d1461166e5780635c92e2f6146113fc57806365540b961461139a57806369f3f041146113095780636a8c9194146112725780636d4cd8ea1461111e57806372d610d9146110e35780637c04034e14610b915780638da5cb5b14610b6b5780638e42646014610b145780639146cd4714610aaf5780639d61ab6e14610a86578063a0d216d114610a68578063a6f9dae114610a11578063a7cc08fe14610997578063b34bfaa81461097a578063b6ede5401461067a578063b70020d61461064b578063ba66fde7146105f4578063be467604146105d7578063cf756fdf14610380578063d2b8035a146102ee578063da3beb8c146102cc578063e349ad30146102af578063f2f4eb2614610288578063f32ab92714610246578063f8abee10146102175763fc6f8f16146101ec575f80fd5b3461021457602036600319011261021457602061020a6004356129ee565b5054604051908152f35b80fd5b50346102145760203660031901126102145760ff60406020926004358152600584522054166040519015158152f35b50346102145760409081610259366129b4565b92908152600360205260038282205493610272856129ee565b5090835201602052205482519182526020820152f35b503461021457806003193601126102145760206001600160a01b0360015416604051908152f35b503461021457806003193601126102145760206040516127108152f35b50346102145760206102e66102e0366129b4565b90612fd2565b604051908152f35b5034610214576102fd366129b4565b916001600160a01b0360015416330361037257818152600360205260ff600261032960408420546129ee565b500154166103635760406bffffffffffffffffffffffff61034a8585612cec565b6001600160a01b03849392935193168352166020820152f35b8063070f7fa560e51b60049252fd5b80628448c760e31b60049252fd5b50346102145760803660031901126102145761039a61299e565b6024356001600160a01b0381168091036105d3576044356001600160a01b0381168091036105cf577ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e549160ff8360401c16159267ffffffffffffffff811684806105c5575b1590816105a7575b5061057f5767ffffffffffffffff1981166001177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e5583610540575b507ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e549360ff8560401c1615610518576001600160a01b03166001600160a01b03198654161785556001600160a01b031960015416176001556001600160a01b031960065416176006556064356007556104bc575080f35b68ff000000000000000019167ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e557fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d2602060405160018152a180f35b6004867fd7e6bcf8000000000000000000000000000000000000000000000000000000008152fd5b68ffffffffffffffffff191668010000000000000001177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e555f610444565b6004867f0dc149f0000000000000000000000000000000000000000000000000000000008152fd5b303b159150816105ba575b50155f610408565b60019150145f6105b2565b5060018110610400565b8380fd5b8280fd5b503461021457806003193601126102145760206040516113888152f35b50346102145760ff61063e604061063860209461061036612a73565b94918391935260038852610626828220546129ee565b50928152600383018852205490612ae1565b50612cd3565b5054166040519015158152f35b50346102145780600319360112610214575060075480610672575060206001604051908152f35b6020906102e6565b50346102145760803660031901126102145760043560443560243567ffffffffffffffff82116105cf57366023830112156105cf57816004013567ffffffffffffffff8111610976573660248285010111610976576001600160a01b0360015416330361096857600254680100000000000000008110156109545760018101600255610705816129ee565b508360018201556004810161071a8154612a0a565b601f811161090f575b508388601f82116001146108a6578991610898575b508460011b905f198660031b1c19161790555b6002810160ff1981541690558054602460206001600160a01b036001541660405192838092637e37c78b60e11b82528c60048301525afa90811561088d578991610857575b505f198101908111610843576107dd606095937fd3106f74c2d30a4b9230e756a3e78bde53865d40f6af4c479bb010ebaab58108989795936003938c5283820160205260408c2055612bca565b5001600160ff1982541617905586885260036020526040882055858752600560205260408720600160ff1982541617905580602460405195869485526040602086015282604086015201848401378181018301879052601f01601f19168101030190a280f35b602489634e487b7160e01b81526011600452fd5b90506020813d602011610885575b816108726020938361291c565b8101031261088157515f610790565b5f80fd5b3d9150610865565b6040513d8b823e3d90fd5b60249150870101355f610738565b828a5260208a20915085601f1981168b5b8a8282106108f2575050106108d6575b5050600184811b01905561074b565b8701602401355f19600387901b60f8161c191690555f806108c7565b8401602401358555600190940193602093840193899350016108b7565b81895260208920601f860160051c8101916020871061094a575b601f0160051c01905b81811061093f5750610723565b898155600101610932565b9091508190610929565b602486634e487b7160e01b81526041600452fd5b600485628448c760e31b8152fd5b8480fd5b50346102145780600319360112610214576020604051614e208152f35b5034610214576109db60406106386080936109b136612a73565b94918391935260036020526109c8828220546129ee565b5092815260038301602052205490612ae1565b5060ff815460026001840154930154604051936001600160a01b038360081c168552602085015260408401521615156060820152f35b503461021457602036600319011261021457610a2b61299e565b815490336001600160a01b03831603610a59576001600160a01b036001600160a01b03199116911617815580f35b600483630b2db9b760e31b8152fd5b50346102145780600319360112610214576020600754604051908152f35b5034610214576040610aa2610a9a366128fa565b5050916130b9565b8151908082526020820152f35b5034610214576040366003190112610214576004356001600160a01b0381160361021457602435908160011b9180830460021490151715610b005760018201809211610b0057602082604051908152f35b80634e487b7160e01b602492526011600452fd5b503461021457602036600319011261021457610b2e61299e565b6001600160a01b038254163303610b5c576001600160a01b03166001600160a01b0319600154161760015580f35b600482630b2db9b760e31b8152fd5b50346102145780600319360112610214576001600160a01b036020915416604051908152f35b50346102145760a03660031901126102145760043560243567ffffffffffffffff81116105d357610bc6903690600401612a42565b90916044359260843567ffffffffffffffff81116110df57610bec90369060040161295a565b92828652600360205260ff6002610c0660408920546129ee565b500154166110d0576001600160a01b036001541660405163564a565d60e01b815284600482015260a081602481855afa9081156110c55788916110a1575b50600581101561108d5760020361106557811561103d57838752600560205260ff6040882054161561102e578387526003602052604087205490610c87826129ee565b50906001820154881161101f5781545f1981019290831161100b5782610cac91612ae1565b509260405163564a565d60e01b815287600482015260a081602481865afa908b8215610fff5760c0926bffffffffffffffffffffffff9260249291610fcc575b506040519586938492630fad06e960e11b84521660048301525afa918215610fc1578a92610f8a575b50610d226064358a612b6e565b908a5b868110610e6b575050505050908160047fa000893c71384499023d2d7b21234f7b9e80c78e0330f357dcd667ff578bd3a4949301610d64838254612bbd565b905560028101908789528160205260408920610d81848254612bbd565b90558760018201928354908183145f14610de7575050506003915001805460ff8116610dda575b50505b610dd4610dc5604051938493604085526040850191613286565b828103602084015233966129ca565b0390a480f35b60ff191690555f80610da8565b828c528060205260408c2054828d528160205260408d2054145f14610e31575050506003915001805460ff811615610e21575b5050610dab565b60ff191660011790555f80610e1a565b828c528060205260408c2054918c5260205260408b205410610e56575b505050610dab565b600392550160ff1981541690555f8087610e4e565b610e80610e7982898b613276565b3587612cd3565b506001600160a01b0333915460081c1603610f7b578380610f4b575b610f235760ff610eb7610eb0838a8c613276565b3588612cd3565b505416610efb57808b6002610ed9610ed26001958c8e613276565b358a612cd3565b500155610eea610eb0828a8c613276565b50805460ff19168317905501610d25565b60048c7fb3808bab000000000000000000000000000000000000000000000000000000008152fd5b60048c7f953075a3000000000000000000000000000000000000000000000000000000008152fd5b50826001610f71610f5d848b8d613276565b3561063889610f6b886129ee565b50612ae1565b5001541415610e9c565b60048c638016bef760e01b8152fd5b610fad91925060c03d60c011610fba575b610fa5818361291c565b810190612c97565b505050509050905f610d15565b503d610f9b565b6040513d8c823e3d90fd5b610fee915060a03d60a011610ff8575b610fe6818361291c565b810190612b20565b505050505f610cec565b503d610fdc565b604051903d90823e3d90fd5b60248a634e487b7160e01b81526011600452fd5b600489637cd5012560e11b8152fd5b6004876333f97f8960e01b8152fd5b6004877fb7a08e6e000000000000000000000000000000000000000000000000000000008152fd5b6004877febd6a5e7000000000000000000000000000000000000000000000000000000008152fd5b602488634e487b7160e01b81526021600452fd5b6110ba915060a03d60a011610ff857610fe6818361291c565b50509150505f610c44565b6040513d8a823e3d90fd5b60048663070f7fa560e51b8152fd5b8580fd5b5034610214576020366003190112610214576001600160a01b03815416330361110f5760043560075580f35b80630b2db9b760e31b60049252fd5b503461021457602036600319011261021457600435808252600360205261114860408320546129ee565b5080545f1981019190821161125e579061116191612ae1565b50906001600160a01b0360015416906040519063564a565d60e01b8252600482015260a081602481855afa80156112535760246bffffffffffffffffffffffff9160c0938791611230575b506040519485938492630fad06e960e11b84521660048301525afa908115611225579260209381926111fe575b5050156111f45760046005820154915b015414604051908152f35b60048154916111e9565b61121891925060c03d60c011610fba57610fa5818361291c565b505050509050905f6111d9565b6040513d85823e3d90fd5b611249915060a03d60a011610ff857610fe6818361291c565b505050505f6111ac565b6040513d86823e3d90fd5b602484634e487b7160e01b81526011600452fd5b50346102145760603660031901126102145761128c61299e565b60443567ffffffffffffffff81116105d3576112ac90369060040161295a565b906001600160a01b038354163303610a5957818392916020849351920190602435905af16112d8612bf0565b50156112e15780f35b807f44125e5e0000000000000000000000000000000000000000000000000000000060049252fd5b50346102145761134a60c09161131e36612a73565b93918352600360205261133460408420546129ee565b5090835260038101602052604083205490612ae1565b509160018301549260ff60038201541692604060048301549160026005850154948054968352016020522054936040519586521515602086015260408501526060840152608083015260a0820152f35b5034610214576020366003190112610214576113b7600435612c1f565b90604051918291602083016020845282518091526020604085019301915b8181106113e3575050500390f35b82518452859450602093840193909201916001016113d5565b50346102145760603660031901126102145760043560243567ffffffffffffffff81116105d357611431903690600401612a42565b60449291923592828552600360205260ff600261145160408820546129ee565b5001541661165f57602460a06001600160a01b03600154166040519283809263564a565d60e01b82528860048301525afa908115611654578691611630575b50600581101561161c576001036115f45783156115cc57828552600560205260ff604086205416156115bd5782855260036020526114d160408620546129ee565b5080545f198101919082116115a957906114ea91612ae1565b50855b83811061154d57507f05cc2f1c94966f1c961b410a50f3d3ffb64501346753a258177097ea23707f089291600561153e920161152a848254612bbd565b905560405192604084526040840191613286565b9360208201528033940390a380f35b61156261155b828686613276565b3583612cd3565b506001600160a01b0333915460081c160361159a578086600161159161158a82958989613276565b3586612cd3565b500155016114ed565b600487638016bef760e01b8152fd5b602487634e487b7160e01b81526011600452fd5b6004856333f97f8960e01b8152fd5b6004857f37b5b73d000000000000000000000000000000000000000000000000000000008152fd5b6004857f97ab7f79000000000000000000000000000000000000000000000000000000008152fd5b602486634e487b7160e01b81526021600452fd5b611649915060a03d60a011610ff857610fe6818361291c565b50509150505f611490565b6040513d88823e3d90fd5b60048563070f7fa560e51b8152fd5b50346102145760203660031901126102145760043560025481101561177657611696906129ee565b5090600182015490600460ff60028501541693019060405191818154916116bc83612a0a565b808652926001811690811561174c575060011461170b575b505050906116e78161170793038261291c565b6040519384938452151560208401526060604084015260608301906129ca565b0390f35b815260208120939250905b808210611732575090915081016020016116e7826117076116d4565b919260018160209254838588010152019101909291611716565b869550611707969350602092506116e794915060ff191682840152151560051b82010192936116d4565b5080fd5b50346102145780600319360112610214575061170760405161179d60408261291c565b600581527f322e302e3000000000000000000000000000000000000000000000000000000060208201526040519182916020835260208301906129ca565b50346102145780600319360112610214576001600160a01b037f00000000000000000000000000000000000000000000000000000000000000001630036118465760206040517f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc8152f35b8063703e46dd60e11b60049252fd5b5060403660031901126102145761186a61299e565b9060243567ffffffffffffffff81116117765761188b90369060040161295a565b6001600160a01b038254163303610b5c576001600160a01b037f000000000000000000000000000000000000000000000000000000000000000016803014908115611a84575b50611a75576001600160a01b03831690604051937f52d1902d000000000000000000000000000000000000000000000000000000008552602085600481865afa80958596611a41575b5061194b57602484847f0c760937000000000000000000000000000000000000000000000000000000008252600452fd5b90917f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc8503611a1557839450817f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc557fbc7cd75a20ee27fd9adebab32041f755214dbc6bffa90cc0225b39da2e5c2d3b8480a2815190816119ce575b5050505080f35b6020849301905af46119de612bf0565b50156119ed57805f80806119c7565b807f736436ba0000000000000000000000000000000000000000000000000000000060049252fd5b602484867faa1d49a4000000000000000000000000000000000000000000000000000000008252600452fd5b9095506020813d602011611a6d575b81611a5d6020938361291c565b810103126109765751945f61191a565b3d9150611a50565b60048263703e46dd60e11b8152fd5b90506001600160a01b037f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc541614155f6118d1565b503461021457602036600319011261021457602090604051908152f35b50611ae0366129b4565b90805f52600360205260ff6002611afa60405f20546129ee565b5001541661221e57805f526003602052611b1760405f20546129ee565b509060018201908154841161220f57805f52600560205260ff60405f20541615612200576001600160a01b036001541660405163afe15cfb60e01b8152826004820152604081602481855afa908115611e61575f905f926121ce575b5080421080156121c4575b61219c57604051631c3db16d60e01b8152846004820152606081602481305afa8015611e615788915f9161216b575b5003612106575050612710945b84545f1981019081116120be57611bd19086612ae1565b5060405191637e37c78b60e11b8352846004840152602083602481875afa928315611e61575f936120d2575b505f1983018381116120be576007830198825f528960205260ff60405f205416612096576020602496604051978880927f59ec827e0000000000000000000000000000000000000000000000000000000082528b60048301525afa958615611e61575f96612060575b50612710611c77611c7e9288612ab0565b0486612bbd565b985f996006850190845f528160205260405f20548111611fea575b6001600160a01b0333165f526008860160205260405f20855f5260205260405f20611cc58d8254612bbd565b9055845f528160205260405f20611cdd8d8254612bbd565b9055845f528160205260405f20541015611f34575b505050506001600a82015411611d37575b505050505050803411611d14575080f35b611d21611d349134612aa3565b6001600160a01b03600654169033613173565b80f35b600901611d45838254612aa3565b9055602460206001600160a01b0360015416604051928380927f19b815290000000000000000000000000000000000000000000000000000000082528860048301525afa908115611e61575f91611efa575b5015611ecc575060028401805460ff191660011790555b60046001600160a01b036001541693549401833b15610881576040519485937fc356990200000000000000000000000000000000000000000000000000000000855260048501526024840152606060448401525f90805490611e0f82612a0a565b918260648701526001811690815f14611ea75750600114611e6c575b50505f939183809203925af18015611e6157611e4c575b8080808080611d03565b611e599192505f9061291c565b5f905f611e42565b6040513d5f823e3d90fd5b5f908152602081209092505b818310611e8d57505082016084018183611e2b565b805460848489010152869450602090920191600101611e78565b60ff191660848088019190915292151560051b86019092019250839150849050611e2b565b8454905f526003850160205260405f20556003611ee885612bca565b5001805460ff19166001179055611dae565b90506020813d602011611f2c575b81611f156020938361291c565b8101031261088157611f2690612b13565b5f611d97565b3d9150611f08565b835f5260205260405f2054611f4e60098601918254612bbd565b9055600a8401805468010000000000000000811015611fd65760018101808355811015611fc25784915f5260205f200155825f5260205260405f20600160ff19825416179055857fed764996238e4c1c873ae3af7ae2f00f1f6f4f10b9ac7d4bbea4a764c5dea0095f80a45f808080611cf2565b634e487b7160e01b5f52603260045260245ffd5b634e487b7160e01b5f52604160045260245ffd5b9a50835f528060205261200160405f20548c612aa3565b34101561204557349a5b8b604051908682526020820152848a7fcae597f39a3ad75c2e10d46b031f023c5c2babcd58ca0491b122acda3968d4c060403394a4611c99565b835f528060205261205a60405f20548c612aa3565b9a61200b565b9095506020813d60201161208e575b8161207c6020938361291c565b81010312610881575194612710611c66565b3d915061206f565b7fbcdf54db000000000000000000000000000000000000000000000000000000005f5260045ffd5b634e487b7160e01b5f52601160045260245ffd5b9092506020813d6020116120fe575b816120ee6020938361291c565b810103126108815751915f611bfd565b3d91506120e1565b8061211461211a9242612aa3565b92612aa3565b61138881029080820461138814901517156120be576127109004111561214357614e2094611bba565b7f508aa06c000000000000000000000000000000000000000000000000000000005f5260045ffd5b61218d915060603d606011612195575b612185818361291c565b810190612b94565b50505f611bad565b503d61217b565b7f13e72a50000000000000000000000000000000000000000000000000000000005f5260045ffd5b5081421015611b7e565b90506121f2915060403d6040116121f9575b6121ea818361291c565b810190612a8d565b905f611b73565b503d6121e0565b6333f97f8960e01b5f5260045ffd5b637cd5012560e11b5f5260045ffd5b63070f7fa560e51b5f5260045ffd5b34610881576080366003190112610881576024356004356001600160a01b03821680830361088157604435606435925f936001600160a01b03600154169460405163564a565d60e01b815283600482015260a0816024818a5afa908115611e61575f916125c7575b501561259f576040517f5c975abb0000000000000000000000000000000000000000000000000000000081526020816004818a5afa908115611e61575f91612565575b5061253d57825f52600560205260ff60405f2054161561220057825f5260036020526024606061232461230e60405f20546129ee565b50875f526003810160205260405f205490612ae1565b509760405192838092631c3db16d60e01b82528860048301525afa908115611e61575f9161251c575b506007870190835f528160205260ff60405f205416155f146123ff57505050602095845f5260088601875260405f20825f528752600860405f2054965b865f5201875260405f20825f5287525f6040812055856123af575b8686604051908152f35b7f54b3cab3cb5c4aca3209db1151caff092e878011202e43a36782d4ebe0b963ae916123ea604092886001600160a01b036006541691613173565b81519081528688820152a482808080806123a5565b83810361246d5750505060209560068601825f5280885260405f205415155f146124645761245e600891875f528289018a5260405f20855f528a5261244d60405f205460098b015490612ab0565b90855f528a5260405f205490612ac3565b9661238a565b5060085f61245e565b5f9792975260205260ff60405f2054161561248e575b95600860209761238a565b9450835f526008850160205260405f20815f526020526124b760405f2054600987015490612ab0565b956006860196600a870197885415611fc257885f5260205f20545f528060205260405f205491895460011015611fc25761250c6008936125129360209c5f5260018d5f2001545f528c5260405f205490612bbd565b90612ac3565b9691975050612483565b612535915060603d60601161219557612185818361291c565b50508861234d565b7f88226c22000000000000000000000000000000000000000000000000000000005f5260045ffd5b90506020813d602011612597575b816125806020938361291c565b810103126108815761259190612b13565b886122d8565b3d9150612573565b7f8a7dc9ee000000000000000000000000000000000000000000000000000000005f5260045ffd5b6125e0915060a03d60a011610ff857610fe6818361291c565b509250505088612295565b34610881575f3660031901126108815760206001600160a01b0360065416604051908152f35b34610881575f36600319011261088157602060ff600454166040519015158152f35b346108815760603660031901126108815760443567ffffffffffffffff81116108815761266490369060040161295a565b5060206102e6602435600435612b6e565b34610881576020366003190112610881576004355f90805f5260036020526126a060405f20546129ee565b5080545f1981019081116120be576126b791612ae1565b50600381015460ff169290831561279c57505f5b91602460a06001600160a01b03600154166040519283809263564a565d60e01b82528660048301525afa908115611e61575f91612778575b5060058110156127645760041461272f575b506060926040519283521515602083015215156040820152f35b61273890612c1f565b9283516001811461274b575b5092612715565b9250505015611fc2576020015160609060015f84612744565b634e487b7160e01b5f52602160045260245ffd5b612791915060a03d60a011610ff857610fe6818361291c565b505091505085612703565b600101546126cb565b346108815760206102e6610a9a366128fa565b34610881576020366003190112610881576004355f526003602052602060405f2054604051908152f35b34610881576020366003190112610881576004355f52600360205261280a60405f20546129ee565b5080545f198101919082116120be5760209161282591612ae1565b506005810154905414604051908152f35b3461088157602036600319011261088157600435906040816024816001600160a01b036001541663afe15cfb60e01b82528660048301525afa918215611e61575f915f936128d3575b5061288990612c1f565b5115908161289f575b6020826040519015158152f35b6128ae91506121148142612aa3565b9061138882029180830461138814901517156120be5761271060209204111582612892565b6128f2919350612889925060403d6040116121f9576121ea818361291c565b92909161287f565b60a0906003190112610881576004359060243590604435906064359060843590565b90601f8019910116810190811067ffffffffffffffff821117611fd657604052565b67ffffffffffffffff8111611fd657601f01601f191660200190565b81601f82011215610881576020813591016129748261293e565b92612982604051948561291c565b8284528282011161088157815f92602092838601378301015290565b600435906001600160a01b038216820361088157565b6040906003190112610881576004359060243590565b805180835260209291819084018484015e5f828201840152601f01601f1916010190565b600254811015611fc25760025f52600f60205f20910201905f90565b90600182811c92168015612a38575b6020831014612a2457565b634e487b7160e01b5f52602260045260245ffd5b91607f1691612a19565b9181601f840112156108815782359167ffffffffffffffff8311610881576020808501948460051b01011161088157565b606090600319011261088157600435906024359060443590565b9190826040910312610881576020825192015190565b919082039182116120be57565b818102929181159184041417156120be57565b8115612acd570490565b634e487b7160e01b5f52601260045260245ffd5b8054821015611fc2575f52601660205f20910201905f90565b51906bffffffffffffffffffffffff8216820361088157565b5190811515820361088157565b908160a091031261088157612b3481612afa565b9160208201516001600160a01b038116810361088157916040810151600581101561088157916080612b6860608401612b13565b92015190565b906040519060208201928352604082015260408152612b8e60608261291c565b51902090565b9081606091031261088157805191612bba6040612bb360208501612b13565b9301612b13565b90565b919082018092116120be57565b805468010000000000000000811015611fd657612bec91600182018155612ae1565b9091565b3d15612c1a573d90612c018261293e565b91612c0f604051938461291c565b82523d5f602084013e565b606090565b5f526003602052612c3360405f20546129ee565b5080545f198101919082116120be57600a91612c4e91612ae1565b5001604051808260208294549384815201905f5260205f20925f5b818110612c7e575050612bba9250038261291c565b8454835260019485019486945060209093019201612c69565b91908260c091031261088157612cac82612afa565b91612cb960208201612b13565b9160408201519160608101519160a0608083015192015190565b8054821015611fc2575f52600d60205f20910201905f90565b9091815f526003602052612d0360405f20546129ee565b5080545f1981019081116120be57612d1a91612ae1565b506001600160a01b03600154166040517f2e1daf2f000000000000000000000000000000000000000000000000000000008152602081600481855afa908115611e61575f91612f8d575b5060a06024926040519384809263564a565d60e01b82528960048301525afa918215611e61576040926bffffffffffffffffffffffff926064925f92612f5f575b506001600160a01b03908551998a9586947fd045e0020000000000000000000000000000000000000000000000000000000086521660048501528960248501526044840152165afa928315611e61575f945f94612f0c575b5083856001600160a01b03811615612f0457505060045460ff1615612efc575f526003602052612e3060405f20546129ee565b5080545f198101919082116120be57600b91612e4b91612ae1565b506001600160a01b0386165f520160205260ff60405f205416155b15612ef65780549068010000000000000000821015611fd657612e91826001600b9401835582612cd3565b5080547fffffffffffffffffffffff0000000000000000000000000000000000000000ff74ffffffffffffffffffffffffffffffffffffffff008860081b1691161790556001600160a01b0385165f520160205260405f20600160ff19825416179055565b505f9250565b506001612e66565b955093505050565b945092506040843d604011612f57575b81612f296040938361291c565b81010312610881578351936001600160a01b0385168503610881576020612f509101612afa565b925f612dfd565b3d9150612f1c565b6001600160a01b03919250612f829060a03d60a011610ff857610fe6818361291c565b505050509190612da5565b90506020813d602011612fca575b81612fa86020938361291c565b810103126108815751906001600160a01b0382168203610881579060a0612d64565b3d9150612f9b565b9061300290825f526003602052612fec60405f20546129ee565b50905f526003810160205260405f205490612ae1565b5060606001600160a01b036001541692602460405180958193631c3db16d60e01b835260048301525afa918215611e61575f905f93613094575b5060048201549283158015613075575b1561305957505050505f90565b1561306357505090565b600292505f520160205260405f205490565b508015801561304c5750815f526002830160205260405f20541561304c565b90506130b091925060603d60601161219557612185818361291c565b5091905f61303c565b916106386130d692845f526003602052612fec60405f20546129ee565b509060606001600160a01b036001541691602460405180948193631c3db16d60e01b835260048301525afa908115611e61575f905f92613150575b5060ff8354169283613131575b5050505f1461312d5761271090565b5f90565b600201541491508115613148575b505f808061311e565b90505f61313f565b905061316b915060603d60601161219557612185818361291c565b50905f613111565b6001600160a01b0316905f925f8284811561326c575b5f92839283928392f1613266576001600160a01b031691823b15610881576040517fd0e30db00000000000000000000000000000000000000000000000000000000081525f8160048186885af18015611e6157613251575b50823b156105cf5790604484928360405195869485937fa9059cbb000000000000000000000000000000000000000000000000000000008552600485015260248401525af1801561324657613234575050565b61323f82809261291c565b6102145750565b6040513d84823e3d90fd5b61325e9194505f9061291c565b5f925f6131e1565b50505050565b6108fc9250613189565b9190811015611fc25760051b0190565b90918281527f07ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff83116108815760209260051b80928483013701019056fea2646970667358221220b5aaba208006c2770b2a559bb6595fe7390db7c206ee67f59edf25055757c98c64736f6c634300081e0033",
   "devdoc": {
     "errors": {
       "AlreadyInitialized()": [
@@ -973,21 +1345,10 @@
         {
           "details": "The contract is not initializing."
         }
-      ],
-      "UUPSUnauthorizedCallContext()": [
-        {
-          "details": "The call is from an unauthorized context."
-        }
-      ],
-      "UUPSUnsupportedProxiableUUID(bytes32)": [
-        {
-          "details": "The storage `slot` is unsupported as a UUID."
-        }
       ]
     },
     "events": {
       "ChoiceFunded(uint256,uint256,uint256)": {
-        "details": "To be emitted when a choice is fully funded for an appeal.",
         "params": {
           "_choice": "The choice that is being funded.",
           "_coreDisputeID": "The identifier of the dispute in the Arbitrator contract.",
@@ -995,7 +1356,6 @@
         }
       },
       "CommitCast(uint256,address,uint256[],bytes32)": {
-        "details": "To be emitted when a vote commitment is cast.",
         "params": {
           "_commit": "The commitment of the juror.",
           "_coreDisputeID": "The identifier of the dispute in the Arbitrator contract.",
@@ -1004,7 +1364,6 @@
         }
       },
       "Contribution(uint256,uint256,uint256,address,uint256)": {
-        "details": "To be emitted when a funding contribution is made.",
         "params": {
           "_amount": "The amount contributed.",
           "_choice": "The choice that is being funded.",
@@ -1014,7 +1373,6 @@
         }
       },
       "DisputeCreation(uint256,uint256,bytes)": {
-        "details": "To be emitted when a dispute is created.",
         "params": {
           "_coreDisputeID": "The identifier of the dispute in the Arbitrator contract.",
           "_extraData": "The extra data for the dispute.",
@@ -1030,7 +1388,6 @@
         }
       },
       "VoteCast(uint256,address,uint256[],uint256,string)": {
-        "details": "Emitted when casting a vote to provide the justification of juror's choice.",
         "params": {
           "_choice": "The choice juror voted for.",
           "_coreDisputeID": "The identifier of the dispute in the Arbitrator contract.",
@@ -1040,7 +1397,6 @@
         }
       },
       "Withdrawal(uint256,uint256,uint256,address,uint256)": {
-        "details": "To be emitted when the contributed funds are withdrawn.",
         "params": {
           "_amount": "The amount withdrawn.",
           "_choice": "The choice that is being funded.",
@@ -1053,33 +1409,32 @@
     "kind": "dev",
     "methods": {
       "areCommitsAllCast(uint256)": {
-        "details": "Returns true if all of the jurors have cast their commits for the last round.",
         "params": {
-          "_coreDisputeID": "The ID of the dispute in Kleros Core."
+          "_coreDisputeID": "The ID of the dispute in Kleros Core, not in the Dispute Kit."
         },
         "returns": {
           "_0": "Whether all of the jurors have cast their commits for the last round."
         }
       },
       "areVotesAllCast(uint256)": {
-        "details": "Returns true if all of the jurors have cast their votes for the last round.",
+        "details": "This function is to be called directly by the core contract and is not for off-chain usage.",
         "params": {
-          "_coreDisputeID": "The ID of the dispute in Kleros Core."
+          "_coreDisputeID": "The ID of the dispute in Kleros Core, not in the Dispute Kit."
         },
         "returns": {
           "_0": "Whether all of the jurors have cast their votes for the last round."
         }
       },
       "castCommit(uint256,uint256[],bytes32)": {
-        "details": "Sets the caller's commit for the specified votes. It can be called multiple times during the commit period, each call overrides the commits of the previous one. `O(n)` where `n` is the number of votes.",
+        "details": "It can be called multiple times during the commit period, each call overrides the commits of the previous one. `O(n)` where `n` is the number of votes.",
         "params": {
-          "_commit": "The commit. Note that justification string is a part of the commit.",
+          "_commit": "The commitment hash.",
           "_coreDisputeID": "The ID of the dispute in Kleros Core.",
           "_voteIDs": "The IDs of the votes."
         }
       },
       "castVote(uint256,uint256[],uint256,uint256,string)": {
-        "details": "Sets the caller's choices for the specified votes. `O(n)` where `n` is the number of votes.",
+        "details": "`O(n)` where `n` is the number of votes.",
         "params": {
           "_choice": "The choice.",
           "_coreDisputeID": "The ID of the dispute in Kleros Core.",
@@ -1089,33 +1444,35 @@
         }
       },
       "changeCore(address)": {
-        "details": "Changes the `core` storage variable.",
         "params": {
           "_core": "The new value for the `core` storage variable."
         }
       },
-      "changeGovernor(address)": {
-        "details": "Changes the `governor` storage variable.",
+      "changeJumpDisputeKitID(uint256)": {
+        "params": {
+          "_jumpDisputeKitID": "The new value for the `jumpDisputeKitID` storage variable."
+        }
+      },
+      "changeOwner(address)": {
         "params": {
-          "_governor": "The new value for the `governor` storage variable."
+          "_owner": "The new value for the `owner` storage variable."
         }
       },
       "constructor": {
-        "details": "Constructor, initializing the implementation to reduce attack surface."
+        "custom:oz-upgrades-unsafe-allow": "constructor"
       },
       "createDispute(uint256,uint256,bytes,uint256)": {
-        "details": "Creates a local dispute and maps it to the dispute ID in the Core contract. Note: Access restricted to Kleros Core only.",
+        "details": "Access restricted to Kleros Core only.",
         "params": {
-          "_coreDisputeID": "The ID of the dispute in Kleros Core.",
+          "_coreDisputeID": "The ID of the dispute in Kleros Core, not in the Dispute Kit.",
           "_extraData": "Additional info about the dispute, for possible use in future dispute kits.",
-          "_nbVotes": "Number of votes for this dispute.",
+          "_nbVotes": "Maximal number of votes this dispute can get. Added for future-proofing.",
           "_numberOfChoices": "Number of choices of the dispute"
         }
       },
       "currentRuling(uint256)": {
-        "details": "Gets the current ruling of a specified dispute.",
         "params": {
-          "_coreDisputeID": "The ID of the dispute in Kleros Core."
+          "_coreDisputeID": "The ID of the dispute in Kleros Core, not in the Dispute Kit."
         },
         "returns": {
           "overridden": "Whether the ruling was overridden by appeal funding or not.",
@@ -1124,17 +1481,25 @@
         }
       },
       "draw(uint256,uint256)": {
-        "details": "Draws the juror from the sortition tree. The drawn address is picked up by Kleros Core. Note: Access restricted to Kleros Core only.",
+        "details": "Access restricted to Kleros Core only.",
         "params": {
-          "_coreDisputeID": "The ID of the dispute in Kleros Core.",
-          "_nonce": "Nonce of the drawing iteration."
+          "_coreDisputeID": "The ID of the dispute in Kleros Core, not in the Dispute Kit.",
+          "_nonce": "Nonce."
         },
         "returns": {
           "drawnAddress": "The drawn address."
         }
       },
-      "executeGovernorProposal(address,uint256,bytes)": {
-        "details": "Allows the governor to call anything on behalf of the contract.",
+      "earlyCourtJump(uint256)": {
+        "details": "Returns true if the dispute is jumping to a parent court.",
+        "params": {
+          "_coreDisputeID": "The ID of the dispute in Kleros Core, not in the Dispute Kit."
+        },
+        "returns": {
+          "_0": "Whether the dispute is jumping to a parent court or not."
+        }
+      },
+      "executeOwnerProposal(address,uint256,bytes)": {
         "params": {
           "_amount": "The value sent with the call.",
           "_data": "The data sent with the call.",
@@ -1142,14 +1507,12 @@
         }
       },
       "fundAppeal(uint256,uint256)": {
-        "details": "Manages contributions, and appeals a dispute if at least two choices are fully funded. Note that the surplus deposit will be reimbursed.",
         "params": {
           "_choice": "A choice that receives funding.",
           "_coreDisputeID": "Index of the dispute in Kleros Core."
         }
       },
       "getCoherentCount(uint256,uint256)": {
-        "details": "Gets the number of jurors who are eligible to a reward in this round.",
         "params": {
           "_coreDisputeID": "The ID of the dispute in Kleros Core, not in the Dispute Kit.",
           "_coreRoundID": "The ID of the round in Kleros Core, not in the Dispute Kit."
@@ -1158,26 +1521,129 @@
           "_0": "The number of coherent jurors."
         }
       },
-      "getDegreeOfCoherence(uint256,uint256,uint256,uint256,uint256)": {
-        "details": "Gets the degree of coherence of a particular voter. This function is called by Kleros Core in order to determine the amount of the reward.",
+      "getDegreeOfCoherencePenalty(uint256,uint256,uint256,uint256,uint256)": {
+        "details": "This function is called by Kleros Core in order to determine the amount of the penalty.",
         "params": {
           "_coreDisputeID": "The ID of the dispute in Kleros Core, not in the Dispute Kit.",
           "_coreRoundID": "The ID of the round in Kleros Core, not in the Dispute Kit.",
+          "_feePerJuror": "The fee per juror.",
+          "_pnkAtStakePerJuror": "The PNK at stake per juror.",
           "_voteID": "The ID of the vote."
         },
         "returns": {
-          "_0": "The degree of coherence in basis points."
+          "pnkCoherence": "The degree of coherence in basis points for the dispute PNK reward."
         }
       },
-      "initialize(address,address)": {
-        "details": "Initializer.",
+      "getDegreeOfCoherenceReward(uint256,uint256,uint256,uint256,uint256)": {
+        "details": "This function is called by Kleros Core in order to determine the amount of the reward.",
+        "params": {
+          "_coreDisputeID": "The ID of the dispute in Kleros Core, not in the Dispute Kit.",
+          "_coreRoundID": "The ID of the round in Kleros Core, not in the Dispute Kit.",
+          "_feePerJuror": "The fee per juror.",
+          "_pnkAtStakePerJuror": "The PNK at stake per juror.",
+          "_voteID": "The ID of the vote."
+        },
+        "returns": {
+          "feeCoherence": "The degree of coherence in basis points for the dispute fee reward.",
+          "pnkCoherence": "The degree of coherence in basis points for the dispute PNK reward."
+        }
+      },
+      "getFundedChoices(uint256)": {
+        "params": {
+          "_coreDisputeID": "The ID of the dispute in Kleros Core."
+        },
+        "returns": {
+          "fundedChoices": "Fully funded rulings."
+        }
+      },
+      "getJumpDisputeKitID()": {
+        "returns": {
+          "_0": "The ID of the dispute kit in Kleros Core disputeKits array."
+        }
+      },
+      "getLocalDisputeRoundID(uint256,uint256)": {
+        "params": {
+          "_coreDisputeID": "The ID of the dispute in Kleros Core.",
+          "_coreRoundID": "The ID of the round in Kleros Core."
+        },
+        "returns": {
+          "localDisputeID": "The ID of the dispute in the Dispute Kit.",
+          "localRoundID": "The ID of the round in the Dispute Kit."
+        }
+      },
+      "getNbVotesAfterAppeal(address,uint256)": {
+        "params": {
+          "_currentNbVotes": "The number of votes before the appeal.",
+          "_previousDisputeKit": "The previous Dispute Kit."
+        },
+        "returns": {
+          "_0": "The number of votes after the appeal."
+        }
+      },
+      "getNumberOfRounds(uint256)": {
+        "params": {
+          "_localDisputeID": "The ID of the dispute in the Dispute Kit."
+        },
+        "returns": {
+          "_0": "The number of rounds in the dispute."
+        }
+      },
+      "getRoundInfo(uint256,uint256,uint256)": {
+        "params": {
+          "_choice": "The choice to query.",
+          "_coreDisputeID": "The ID of the dispute in Kleros Core, not in the Dispute Kit.",
+          "_coreRoundID": "The ID of the round in Kleros Core, not in the Dispute Kit."
+        },
+        "returns": {
+          "choiceCount": "Number of votes cast for the queried choice.",
+          "nbVoters": "Total number of voters in this round.",
+          "tied": "Whether it's a tie or not.",
+          "totalCommitted": "Number of jurors who cast the commit already (only relevant for hidden votes).",
+          "totalVoted": "Number of jurors who cast the vote already.",
+          "winningChoice": "The winning choice of this round."
+        }
+      },
+      "getVoteInfo(uint256,uint256,uint256)": {
+        "params": {
+          "_coreDisputeID": "The ID of the dispute in Kleros Core.",
+          "_coreRoundID": "The ID of the round in Kleros Core.",
+          "_voteID": "The ID of the vote."
+        },
+        "returns": {
+          "account": "The address of the juror who cast the vote.",
+          "choice": "The choice that got the vote.",
+          "commit": "The commit of the vote.",
+          "voted": "Whether the vote was cast or not."
+        }
+      },
+      "hashVote(uint256,uint256,string)": {
+        "details": "The unused parameters may be used by overriding contracts.",
+        "params": {
+          "_choice": "The choice being voted for",
+          "_salt": "A random salt for commitment"
+        },
+        "returns": {
+          "_0": "bytes32 The hash of the encoded vote parameters"
+        }
+      },
+      "initialize(address,address,address,uint256)": {
         "params": {
           "_core": "The KlerosCore arbitrator.",
-          "_governor": "The governor's address."
+          "_jumpDisputeKitID": "The ID of the dispute kit to switch to after the court jump.",
+          "_owner": "The owner's address.",
+          "_wNative": "The wrapped native token address, typically wETH."
+        }
+      },
+      "isAppealFunded(uint256)": {
+        "details": "This function is to be called directly by the core contract and is not for off-chain usage.",
+        "params": {
+          "_coreDisputeID": "The ID of the dispute in Kleros Core, not in the Dispute Kit."
+        },
+        "returns": {
+          "_0": "Whether the appeal funding is finished."
         }
       },
       "isVoteActive(uint256,uint256,uint256)": {
-        "details": "Returns true if the specified voter was active in this round.",
         "params": {
           "_coreDisputeID": "The ID of the dispute in Kleros Core, not in the Dispute Kit.",
           "_coreRoundID": "The ID of the round in Kleros Core, not in the Dispute Kit.",
@@ -1188,17 +1654,17 @@
         }
       },
       "proxiableUUID()": {
-        "details": "Implementation of the ERC1822 `proxiableUUID` function. This returns the storage slot used by the implementation. It is used to validate the implementation's compatibility when performing an upgrade. IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks bricking a proxy that upgrades to it, by delegating to itself until out of gas. Thus it is critical that this function revert if invoked through a proxy. This is guaranteed by the if statement."
+        "details": "IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks bricking a proxy that upgrades to it, by delegating to itself until out of gas. Thus it is critical that this function revert if invoked through a proxy. This is guaranteed by the if statement."
       },
       "upgradeToAndCall(address,bytes)": {
-        "details": "Upgrade mechanism including access control and UUPS-compliance.Reverts if the execution is not performed via delegatecall or the execution context is not of a proxy with an ERC1967-compliant implementation pointing to self.",
+        "details": "Reverts if the execution is not performed via delegatecall or the execution context is not of a proxy with an ERC1967-compliant implementation pointing to self.",
         "params": {
           "data": "Data used in a delegate call to `newImplementation` if non-empty. This will typically be an encoded function call, and allows initializing the storage of the proxy like a Solidity constructor.",
           "newImplementation": "Address of the new implementation contract."
         }
       },
       "withdrawFeesAndRewards(uint256,address,uint256,uint256)": {
-        "details": "Allows those contributors who attempted to fund an appeal round to withdraw any reimbursable fees or rewards after the dispute gets resolved. Note that withdrawals are not possible if the core contract is paused.",
+        "details": "Withdrawals are not possible if the core contract is paused.",
         "params": {
           "_beneficiary": "The address whose rewards to withdraw.",
           "_choice": "The ruling option that the caller wants to withdraw from.",
@@ -1210,7 +1676,15 @@
         }
       }
     },
-    "title": "DisputeKitClassic Dispute kit implementation of the Kleros v1 features including: - a drawing system: proportional to staked PNK, - a vote aggregation system: plurality, - an incentive system: equal split between coherent votes, - an appeal system: fund 2 choices only, vote on any choice.",
+    "stateVariables": {
+      "version": {
+        "return": "Version string.",
+        "returns": {
+          "_0": "Version string."
+        }
+      }
+    },
+    "title": "DisputeKitClassic",
     "version": 1
   },
   "userdoc": {
@@ -1224,50 +1698,210 @@
         {
           "notice": "The `implementation` is not UUPS-compliant"
         }
+      ],
+      "UUPSUnauthorizedCallContext()": [
+        {
+          "notice": "The call is from an unauthorized context."
+        }
+      ],
+      "UUPSUnsupportedProxiableUUID(bytes32)": [
+        {
+          "notice": "The storage `slot` is unsupported as a UUID."
+        }
       ]
     },
     "events": {
+      "ChoiceFunded(uint256,uint256,uint256)": {
+        "notice": "To be emitted when a choice is fully funded for an appeal."
+      },
+      "CommitCast(uint256,address,uint256[],bytes32)": {
+        "notice": "To be emitted when a vote commitment is cast."
+      },
+      "Contribution(uint256,uint256,uint256,address,uint256)": {
+        "notice": "To be emitted when a funding contribution is made."
+      },
+      "DisputeCreation(uint256,uint256,bytes)": {
+        "notice": "To be emitted when a dispute is created."
+      },
       "Upgraded(address)": {
         "notice": "Emitted when the `implementation` has been successfully upgraded."
+      },
+      "VoteCast(uint256,address,uint256[],uint256,string)": {
+        "notice": "Emitted when casting a vote to provide the justification of juror's choice."
+      },
+      "Withdrawal(uint256,uint256,uint256,address,uint256)": {
+        "notice": "To be emitted when the contributed funds are withdrawn."
       }
     },
     "kind": "user",
-    "methods": {},
+    "methods": {
+      "areCommitsAllCast(uint256)": {
+        "notice": "Returns true if all of the jurors have cast their commits for the last round."
+      },
+      "areVotesAllCast(uint256)": {
+        "notice": "Returns true if all of the jurors have cast their votes for the last round."
+      },
+      "castCommit(uint256,uint256[],bytes32)": {
+        "notice": "Sets the caller's commit for the specified votes."
+      },
+      "castVote(uint256,uint256[],uint256,uint256,string)": {
+        "notice": "Sets the caller's choices for the specified votes."
+      },
+      "changeCore(address)": {
+        "notice": "Changes the `core` storage variable."
+      },
+      "changeJumpDisputeKitID(uint256)": {
+        "notice": "Changes the dispute kit ID used for the jump."
+      },
+      "changeOwner(address)": {
+        "notice": "Changes the `owner` storage variable."
+      },
+      "createDispute(uint256,uint256,bytes,uint256)": {
+        "notice": "Creates a local dispute and maps it to the dispute ID in the Core contract."
+      },
+      "currentRuling(uint256)": {
+        "notice": "Gets the current ruling of a specified dispute."
+      },
+      "draw(uint256,uint256)": {
+        "notice": "Draws the juror from the sortition tree. The drawn address is picked up by Kleros Core."
+      },
+      "executeOwnerProposal(address,uint256,bytes)": {
+        "notice": "Allows the owner to call anything on behalf of the contract."
+      },
+      "fundAppeal(uint256,uint256)": {
+        "notice": "Manages contributions, and appeals a dispute if at least two choices are fully funded. Note that the surplus deposit will be reimbursed."
+      },
+      "getCoherentCount(uint256,uint256)": {
+        "notice": "Gets the number of jurors who are eligible to a reward in this round."
+      },
+      "getDegreeOfCoherencePenalty(uint256,uint256,uint256,uint256,uint256)": {
+        "notice": "Gets the degree of coherence of a particular voter."
+      },
+      "getDegreeOfCoherenceReward(uint256,uint256,uint256,uint256,uint256)": {
+        "notice": "Gets the degree of coherence of a particular voter."
+      },
+      "getFundedChoices(uint256)": {
+        "notice": "Returns the rulings that were fully funded in the latest appeal round."
+      },
+      "getJumpDisputeKitID()": {
+        "notice": "Returns the dispute kit ID to be used after court jump by Kleros Core."
+      },
+      "getLocalDisputeRoundID(uint256,uint256)": {
+        "notice": "Returns the local dispute ID and round ID for a given core dispute ID and core round ID."
+      },
+      "getNbVotesAfterAppeal(address,uint256)": {
+        "notice": "Returns the number of votes after the appeal."
+      },
+      "getNumberOfRounds(uint256)": {
+        "notice": "Returns the number of rounds in a dispute."
+      },
+      "getRoundInfo(uint256,uint256,uint256)": {
+        "notice": "Returns the info of the specified round in the core contract."
+      },
+      "getVoteInfo(uint256,uint256,uint256)": {
+        "notice": "Returns the vote information for a given vote ID."
+      },
+      "hashVote(uint256,uint256,string)": {
+        "notice": "Computes the hash of a vote using ABI encoding"
+      },
+      "initialize(address,address,address,uint256)": {
+        "notice": "Initializer."
+      },
+      "isAppealFunded(uint256)": {
+        "notice": "Returns true if the appeal funding is finished prematurely (e.g. when losing side didn't fund)."
+      },
+      "isVoteActive(uint256,uint256,uint256)": {
+        "notice": "Returns true if the specified voter was active in this round."
+      },
+      "proxiableUUID()": {
+        "notice": "Implementation of the ERC1822 `proxiableUUID` function. This returns the storage slot used by the implementation. It is used to validate the implementation's compatibility when performing an upgrade."
+      },
+      "upgradeToAndCall(address,bytes)": {
+        "notice": "Upgrade mechanism including access control and UUPS-compliance."
+      },
+      "version()": {
+        "notice": "Returns the version of the implementation."
+      },
+      "withdrawFeesAndRewards(uint256,address,uint256,uint256)": {
+        "notice": "Allows those contributors who attempted to fund an appeal round to withdraw any reimbursable fees or rewards after the dispute gets resolved."
+      }
+    },
+    "notice": "Dispute kit implementation of the Kleros v1 features including: - a drawing system: proportional to staked PNK, - a vote aggregation system: plurality, - an incentive system: equal split between coherent votes, - an appeal system: fund 2 choices only, vote on any choice.",
     "version": 1
   },
   "storageLayout": {
     "storage": [
       {
-        "astId": 17736,
+        "astId": 21251,
         "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
-        "label": "governor",
+        "label": "owner",
         "offset": 0,
         "slot": "0",
         "type": "t_address"
       },
       {
-        "astId": 17739,
+        "astId": 21254,
         "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
         "label": "core",
         "offset": 0,
         "slot": "1",
-        "type": "t_contract(KlerosCore)7051"
+        "type": "t_contract(KlerosCore)15195"
       },
       {
-        "astId": 17743,
+        "astId": 21258,
         "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
         "label": "disputes",
         "offset": 0,
         "slot": "2",
-        "type": "t_array(t_struct(Dispute)17675_storage)dyn_storage"
+        "type": "t_array(t_struct(Dispute)21183_storage)dyn_storage"
       },
       {
-        "astId": 17747,
+        "astId": 21262,
         "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
         "label": "coreDisputeIDToLocal",
         "offset": 0,
         "slot": "3",
         "type": "t_mapping(t_uint256,t_uint256)"
+      },
+      {
+        "astId": 21264,
+        "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
+        "label": "singleDrawPerJuror",
+        "offset": 0,
+        "slot": "4",
+        "type": "t_bool"
+      },
+      {
+        "astId": 21268,
+        "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
+        "label": "coreDisputeIDToActive",
+        "offset": 0,
+        "slot": "5",
+        "type": "t_mapping(t_uint256,t_bool)"
+      },
+      {
+        "astId": 21270,
+        "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
+        "label": "wNative",
+        "offset": 0,
+        "slot": "6",
+        "type": "t_address"
+      },
+      {
+        "astId": 21272,
+        "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
+        "label": "jumpDisputeKitID",
+        "offset": 0,
+        "slot": "7",
+        "type": "t_uint256"
+      },
+      {
+        "astId": 21276,
+        "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
+        "label": "__gap",
+        "offset": 0,
+        "slot": "8",
+        "type": "t_array(t_uint256)50_storage"
       }
     ],
     "types": {
@@ -1276,24 +1910,36 @@
         "label": "address",
         "numberOfBytes": "20"
       },
-      "t_array(t_struct(Dispute)17675_storage)dyn_storage": {
-        "base": "t_struct(Dispute)17675_storage",
+      "t_array(t_struct(Dispute)21183_storage)dyn_storage": {
+        "base": "t_struct(Dispute)21183_storage",
         "encoding": "dynamic_array",
-        "label": "struct DisputeKitClassic.Dispute[]",
+        "label": "struct DisputeKitClassicBase.Dispute[]",
         "numberOfBytes": "32"
       },
-      "t_array(t_struct(Round)17713_storage)dyn_storage": {
-        "base": "t_struct(Round)17713_storage",
+      "t_array(t_struct(Round)21227_storage)dyn_storage": {
+        "base": "t_struct(Round)21227_storage",
         "encoding": "dynamic_array",
-        "label": "struct DisputeKitClassic.Round[]",
+        "label": "struct DisputeKitClassicBase.Round[]",
         "numberOfBytes": "32"
       },
-      "t_array(t_struct(Vote)17722_storage)dyn_storage": {
-        "base": "t_struct(Vote)17722_storage",
+      "t_array(t_struct(Vote)21240_storage)dyn_storage": {
+        "base": "t_struct(Vote)21240_storage",
         "encoding": "dynamic_array",
-        "label": "struct DisputeKitClassic.Vote[]",
+        "label": "struct DisputeKitClassicBase.Vote[]",
         "numberOfBytes": "32"
       },
+      "t_array(t_uint256)10_storage": {
+        "base": "t_uint256",
+        "encoding": "inplace",
+        "label": "uint256[10]",
+        "numberOfBytes": "320"
+      },
+      "t_array(t_uint256)50_storage": {
+        "base": "t_uint256",
+        "encoding": "inplace",
+        "label": "uint256[50]",
+        "numberOfBytes": "1600"
+      },
       "t_array(t_uint256)dyn_storage": {
         "base": "t_uint256",
         "encoding": "dynamic_array",
@@ -1315,11 +1961,18 @@
         "label": "bytes",
         "numberOfBytes": "32"
       },
-      "t_contract(KlerosCore)7051": {
+      "t_contract(KlerosCore)15195": {
         "encoding": "inplace",
         "label": "contract KlerosCore",
         "numberOfBytes": "20"
       },
+      "t_mapping(t_address,t_bool)": {
+        "encoding": "mapping",
+        "key": "t_address",
+        "label": "mapping(address => bool)",
+        "numberOfBytes": "32",
+        "value": "t_bool"
+      },
       "t_mapping(t_address,t_mapping(t_uint256,t_uint256))": {
         "encoding": "mapping",
         "key": "t_address",
@@ -1341,20 +1994,20 @@
         "numberOfBytes": "32",
         "value": "t_uint256"
       },
-      "t_struct(Dispute)17675_storage": {
+      "t_struct(Dispute)21183_storage": {
         "encoding": "inplace",
-        "label": "struct DisputeKitClassic.Dispute",
+        "label": "struct DisputeKitClassicBase.Dispute",
         "members": [
           {
-            "astId": 17664,
+            "astId": 21168,
             "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
             "label": "rounds",
             "offset": 0,
             "slot": "0",
-            "type": "t_array(t_struct(Round)17713_storage)dyn_storage"
+            "type": "t_array(t_struct(Round)21227_storage)dyn_storage"
           },
           {
-            "astId": 17666,
+            "astId": 21170,
             "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
             "label": "numberOfChoices",
             "offset": 0,
@@ -1362,7 +2015,7 @@
             "type": "t_uint256"
           },
           {
-            "astId": 17668,
+            "astId": 21172,
             "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
             "label": "jumped",
             "offset": 0,
@@ -1370,7 +2023,7 @@
             "type": "t_bool"
           },
           {
-            "astId": 17672,
+            "astId": 21176,
             "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
             "label": "coreRoundIDToLocal",
             "offset": 0,
@@ -1378,30 +2031,38 @@
             "type": "t_mapping(t_uint256,t_uint256)"
           },
           {
-            "astId": 17674,
+            "astId": 21178,
             "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
             "label": "extraData",
             "offset": 0,
             "slot": "4",
             "type": "t_bytes_storage"
+          },
+          {
+            "astId": 21182,
+            "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
+            "label": "__gap",
+            "offset": 0,
+            "slot": "5",
+            "type": "t_array(t_uint256)10_storage"
           }
         ],
-        "numberOfBytes": "160"
+        "numberOfBytes": "480"
       },
-      "t_struct(Round)17713_storage": {
+      "t_struct(Round)21227_storage": {
         "encoding": "inplace",
-        "label": "struct DisputeKitClassic.Round",
+        "label": "struct DisputeKitClassicBase.Round",
         "members": [
           {
-            "astId": 17679,
+            "astId": 21187,
             "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
             "label": "votes",
             "offset": 0,
             "slot": "0",
-            "type": "t_array(t_struct(Vote)17722_storage)dyn_storage"
+            "type": "t_array(t_struct(Vote)21240_storage)dyn_storage"
           },
           {
-            "astId": 17681,
+            "astId": 21189,
             "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
             "label": "winningChoice",
             "offset": 0,
@@ -1409,7 +2070,7 @@
             "type": "t_uint256"
           },
           {
-            "astId": 17685,
+            "astId": 21193,
             "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
             "label": "counts",
             "offset": 0,
@@ -1417,7 +2078,7 @@
             "type": "t_mapping(t_uint256,t_uint256)"
           },
           {
-            "astId": 17687,
+            "astId": 21195,
             "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
             "label": "tied",
             "offset": 0,
@@ -1425,7 +2086,7 @@
             "type": "t_bool"
           },
           {
-            "astId": 17689,
+            "astId": 21197,
             "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
             "label": "totalVoted",
             "offset": 0,
@@ -1433,7 +2094,7 @@
             "type": "t_uint256"
           },
           {
-            "astId": 17691,
+            "astId": 21199,
             "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
             "label": "totalCommitted",
             "offset": 0,
@@ -1441,7 +2102,7 @@
             "type": "t_uint256"
           },
           {
-            "astId": 17695,
+            "astId": 21203,
             "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
             "label": "paidFees",
             "offset": 0,
@@ -1449,7 +2110,7 @@
             "type": "t_mapping(t_uint256,t_uint256)"
           },
           {
-            "astId": 17699,
+            "astId": 21207,
             "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
             "label": "hasPaid",
             "offset": 0,
@@ -1457,7 +2118,7 @@
             "type": "t_mapping(t_uint256,t_bool)"
           },
           {
-            "astId": 17705,
+            "astId": 21213,
             "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
             "label": "contributions",
             "offset": 0,
@@ -1465,7 +2126,7 @@
             "type": "t_mapping(t_address,t_mapping(t_uint256,t_uint256))"
           },
           {
-            "astId": 17707,
+            "astId": 21215,
             "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
             "label": "feeRewards",
             "offset": 0,
@@ -1473,7 +2134,7 @@
             "type": "t_uint256"
           },
           {
-            "astId": 17710,
+            "astId": 21218,
             "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
             "label": "fundedChoices",
             "offset": 0,
@@ -1481,30 +2142,46 @@
             "type": "t_array(t_uint256)dyn_storage"
           },
           {
-            "astId": 17712,
+            "astId": 21222,
             "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
-            "label": "nbVotes",
+            "label": "alreadyDrawn",
             "offset": 0,
             "slot": "11",
-            "type": "t_uint256"
+            "type": "t_mapping(t_address,t_bool)"
+          },
+          {
+            "astId": 21226,
+            "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
+            "label": "__gap",
+            "offset": 0,
+            "slot": "12",
+            "type": "t_array(t_uint256)10_storage"
           }
         ],
-        "numberOfBytes": "384"
+        "numberOfBytes": "704"
       },
-      "t_struct(Vote)17722_storage": {
+      "t_struct(Vote)21240_storage": {
         "encoding": "inplace",
-        "label": "struct DisputeKitClassic.Vote",
+        "label": "struct DisputeKitClassicBase.Vote",
         "members": [
           {
-            "astId": 17715,
+            "astId": 21229,
             "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
-            "label": "account",
+            "label": "voted",
             "offset": 0,
             "slot": "0",
+            "type": "t_bool"
+          },
+          {
+            "astId": 21231,
+            "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
+            "label": "account",
+            "offset": 1,
+            "slot": "0",
             "type": "t_address"
           },
           {
-            "astId": 17717,
+            "astId": 21233,
             "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
             "label": "commit",
             "offset": 0,
@@ -1512,7 +2189,7 @@
             "type": "t_bytes32"
           },
           {
-            "astId": 17719,
+            "astId": 21235,
             "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
             "label": "choice",
             "offset": 0,
@@ -1520,15 +2197,15 @@
             "type": "t_uint256"
           },
           {
-            "astId": 17721,
+            "astId": 21239,
             "contract": "src/arbitration/dispute-kits/DisputeKitClassic.sol:DisputeKitClassic",
-            "label": "voted",
+            "label": "__gap",
             "offset": 0,
             "slot": "3",
-            "type": "t_bool"
+            "type": "t_array(t_uint256)10_storage"
           }
         ],
-        "numberOfBytes": "128"
+        "numberOfBytes": "416"
       },
       "t_uint256": {
         "encoding": "inplace",
diff --git a/contracts/deployments/arbitrumSepoliaDevnet/DisputeKitClassicUniversity_Proxy.json b/contracts/deployments/arbitrumSepoliaDevnet/DisputeKitClassicUniversity_Proxy.json
index 90c310630..9e6ff1681 100644
--- a/contracts/deployments/arbitrumSepoliaDevnet/DisputeKitClassicUniversity_Proxy.json
+++ b/contracts/deployments/arbitrumSepoliaDevnet/DisputeKitClassicUniversity_Proxy.json
@@ -1,5 +1,5 @@
 {
-  "address": "0xd6E96b7c993763B5CDDa1139C7387B82A7c8B8B5",
+  "address": "0x82F2089442979A6b56c80274D144575980092F91",
   "abi": [
     {
       "inputs": [
@@ -26,44 +26,44 @@
       "type": "receive"
     }
   ],
-  "transactionHash": "0xbe90d4066f62381a1a2c725364c3d35093e1ff685736f3fa0a7b75c3b0e82f93",
+  "transactionHash": "0xbc5117fa79c44f4304b16dfe26f072d80a71dce7cf9986f10f363c6e20457bd5",
   "receipt": {
     "to": null,
     "from": "0xf1C7c037891525E360C59f708739Ac09A7670c59",
-    "contractAddress": "0xd6E96b7c993763B5CDDa1139C7387B82A7c8B8B5",
-    "transactionIndex": 1,
-    "gasUsed": "189732",
-    "logsBloom": "0x00000000000000000000000000000000000000000000000000000000000000000000000000004000400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000200000000000000000000000000000000000000000000000000000000000000000000000000000000800000000000000000000000080000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
-    "blockHash": "0x1e4647532736ec4a239971727f05a17b1bb50fc89c0ec7a8da6e34f4f5bfcc90",
-    "transactionHash": "0xbe90d4066f62381a1a2c725364c3d35093e1ff685736f3fa0a7b75c3b0e82f93",
+    "contractAddress": "0x82F2089442979A6b56c80274D144575980092F91",
+    "transactionIndex": 2,
+    "gasUsed": "205891",
+    "logsBloom": "0x00000000000000000000000000000000000000000000000000000000000000000000000080000001000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000800000000000000000000000080000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+    "blockHash": "0x11a1f340150df5f9ad32caef5cb1157e97be0914fb56af4c3835a86a743a5184",
+    "transactionHash": "0xbc5117fa79c44f4304b16dfe26f072d80a71dce7cf9986f10f363c6e20457bd5",
     "logs": [
       {
-        "transactionIndex": 1,
-        "blockNumber": 96308536,
-        "transactionHash": "0xbe90d4066f62381a1a2c725364c3d35093e1ff685736f3fa0a7b75c3b0e82f93",
-        "address": "0xd6E96b7c993763B5CDDa1139C7387B82A7c8B8B5",
+        "transactionIndex": 2,
+        "blockNumber": 193533776,
+        "transactionHash": "0xbc5117fa79c44f4304b16dfe26f072d80a71dce7cf9986f10f363c6e20457bd5",
+        "address": "0x82F2089442979A6b56c80274D144575980092F91",
         "topics": [
           "0xc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d2"
         ],
         "data": "0x0000000000000000000000000000000000000000000000000000000000000001",
-        "logIndex": 0,
-        "blockHash": "0x1e4647532736ec4a239971727f05a17b1bb50fc89c0ec7a8da6e34f4f5bfcc90"
+        "logIndex": 4,
+        "blockHash": "0x11a1f340150df5f9ad32caef5cb1157e97be0914fb56af4c3835a86a743a5184"
       }
     ],
-    "blockNumber": 96308536,
-    "cumulativeGasUsed": "189732",
+    "blockNumber": 193533776,
+    "cumulativeGasUsed": "320063",
     "status": 1,
     "byzantium": true
   },
   "args": [
-    "0x87e863b94d2CB79A8aB53bD87Dc4A10E11C0918B",
-    "0x485cc955000000000000000000000000f1c7c037891525e360c59f708739ac09a7670c590000000000000000000000000000000000000000000000000000000000000000"
+    "0x602ADa1cE706404BFb5417e497cdDae934436081",
+    "0xcf756fdf000000000000000000000000f1c7c037891525e360c59f708739ac09a7670c5900000000000000000000000000000000000000000000000000000000000000000000000000000000000000003829a2486d53ee984a0ca2d76552715726b771380000000000000000000000000000000000000000000000000000000000000001"
   ],
   "numDeployments": 1,
-  "solcInputHash": "a5602534c00c2f67ca4b6a1cab8c717e",
-  "metadata": "{\"compiler\":{\"version\":\"0.8.24+commit.e11b9ed9\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_implementation\",\"type\":\"address\"},{\"internalType\":\"bytes\",\"name\":\"_data\",\"type\":\"bytes\"}],\"stateMutability\":\"nonpayable\",\"type\":\"constructor\"},{\"stateMutability\":\"payable\",\"type\":\"fallback\"},{\"stateMutability\":\"payable\",\"type\":\"receive\"}],\"devdoc\":{\"kind\":\"dev\",\"methods\":{},\"version\":1},\"userdoc\":{\"kind\":\"user\",\"methods\":{},\"version\":1}},\"settings\":{\"compilationTarget\":{\"src/proxy/KlerosProxies.sol\":\"DisputeKitClassicUniversityProxy\"},\"evmVersion\":\"paris\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\",\"useLiteralContent\":true},\"optimizer\":{\"enabled\":true,\"runs\":100},\"remappings\":[]},\"sources\":{\"src/proxy/KlerosProxies.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n\\npragma solidity 0.8.24;\\n\\nimport \\\"./UUPSProxy.sol\\\";\\n\\n/// Workaround to get meaningful names for the proxy contracts\\n/// Otherwise all the contracts are called `UUPSProxy` on the chain explorers\\n\\ncontract DisputeKitClassicNeoProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitClassicUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitClassicProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeTemplateRegistryProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract EvidenceModuleProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract ForeignGatewayOnEthereumProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract HomeGatewayToEthereumProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreNeoProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreRulerProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract PolicyRegistryProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract RandomizerRNGProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleNeoProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\",\"keccak256\":\"0x4393c05bbfda204b9992e1e546142a0fbf4c92a1c4061f5985463d02a71b84d4\",\"license\":\"MIT\"},\"src/proxy/UUPSProxy.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n// Adapted from <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/ERC1967/ERC1967Proxy.sol>\\n\\n/**\\n *  @authors: [@malatrax]\\n *  @reviewers: []\\n *  @auditors: []\\n *  @bounties: []\\n *  @deployments: []\\n */\\npragma solidity 0.8.24;\\n\\n/**\\n * @title UUPS Proxy\\n * @author Simon Malatrait <simon.malatrait@grenoble-inp.org>\\n * @dev This contract implements a UUPS Proxy compliant with ERC-1967 & ERC-1822.\\n * @dev This contract delegates all calls to another contract (UUPS Proxiable) through a fallback function and the use of the `delegatecall` EVM instruction.\\n * @dev We refer to the Proxiable contract (as per ERC-1822) with `implementation`.\\n */\\ncontract UUPSProxy {\\n    /**\\n     * @dev Storage slot with the address of the current implementation.\\n     * This is the keccak-256 hash of \\\"eip1967.proxy.implementation\\\" subtracted by 1, and is\\n     * validated in the constructor.\\n     * NOTE: bytes32(uint256(keccak256('eip1967.proxy.implementation')) - 1)\\n     */\\n    bytes32 private constant IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;\\n\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Initializes the upgradeable proxy with an initial implementation specified by `_implementation`.\\n     *\\n     * If `_data` is nonempty, it's used as data in a delegate call to `_implementation`. This will typically be an encoded\\n     * function call, and allows initializing the storage of the proxy like a Solidity constructor.\\n     */\\n    constructor(address _implementation, bytes memory _data) {\\n        assembly {\\n            sstore(IMPLEMENTATION_SLOT, _implementation)\\n        }\\n\\n        if (_data.length != 0) {\\n            (bool success, ) = _implementation.delegatecall(_data);\\n            require(success, \\\"Proxy Constructor failed\\\");\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Delegates the current call to `implementation`.\\n     *\\n     * NOTE: This function does not return to its internal call site, it will return directly to the external caller.\\n     */\\n    function _delegate(address implementation) internal {\\n        assembly {\\n            // Copy msg.data. We take full control of memory in this inline assembly\\n            // block because it will not return to Solidity code. We overwrite the\\n            // Solidity scratch pad at memory position 0.\\n            calldatacopy(0, 0, calldatasize())\\n\\n            // Call the implementation.\\n            // out and outsize are 0 because we don't know the size yet.\\n            let result := delegatecall(gas(), implementation, 0, calldatasize(), 0, 0)\\n\\n            // Copy the returned data.\\n            returndatacopy(0, 0, returndatasize())\\n\\n            switch result\\n            // delegatecall returns 0 on error.\\n            case 0 {\\n                revert(0, returndatasize())\\n            }\\n            default {\\n                return(0, returndatasize())\\n            }\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Internal Views            * //\\n    // ************************************* //\\n\\n    function _getImplementation() internal view returns (address implementation) {\\n        assembly {\\n            implementation := sload(IMPLEMENTATION_SLOT)\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Fallback                * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Fallback function that delegates calls to the address returned by `_implementation()`. Will run if no other\\n     * function in the contract matches the call data.\\n     */\\n    fallback() external payable {\\n        _delegate(_getImplementation());\\n    }\\n\\n    receive() external payable {\\n        _delegate(_getImplementation());\\n    }\\n}\\n\",\"keccak256\":\"0x7aa5f14ce351299722ac1a1afca9e65e1c795f32ea3e9702b0d5faaf7ca822a0\",\"license\":\"MIT\"}},\"version\":1}",
-  "bytecode": "0x608060405234801561001057600080fd5b5060405161030238038061030283398101604081905261002f91610151565b8181817f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc55805160001461010e576000826001600160a01b031682604051610077919061021f565b600060405180830381855af49150503d80600081146100b2576040519150601f19603f3d011682016040523d82523d6000602084013e6100b7565b606091505b505090508061010c5760405162461bcd60e51b815260206004820152601860248201527f50726f787920436f6e7374727563746f72206661696c65640000000000000000604482015260640160405180910390fd5b505b5050505061023b565b634e487b7160e01b600052604160045260246000fd5b60005b83811015610148578181015183820152602001610130565b50506000910152565b6000806040838503121561016457600080fd5b82516001600160a01b038116811461017b57600080fd5b60208401519092506001600160401b038082111561019857600080fd5b818501915085601f8301126101ac57600080fd5b8151818111156101be576101be610117565b604051601f8201601f19908116603f011681019083821181831017156101e6576101e6610117565b816040528281528860208487010111156101ff57600080fd5b61021083602083016020880161012d565b80955050505050509250929050565b6000825161023181846020870161012d565b9190910192915050565b60b9806102496000396000f3fe608060405236603757603560317f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5490565b6060565b005b603560317f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5490565b3660008037600080366000845af43d6000803e808015607e573d6000f35b3d6000fdfea2646970667358221220a67e53546ab2c83f023c185d90506ad48d4e7af6339cf6db0c4ed97ec9ed376f64736f6c63430008180033",
-  "deployedBytecode": "0x608060405236603757603560317f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5490565b6060565b005b603560317f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5490565b3660008037600080366000845af43d6000803e808015607e573d6000f35b3d6000fdfea2646970667358221220a67e53546ab2c83f023c185d90506ad48d4e7af6339cf6db0c4ed97ec9ed376f64736f6c63430008180033",
+  "solcInputHash": "d547d738900bce1310e91a5d1adfc179",
+  "metadata": "{\"compiler\":{\"version\":\"0.8.30+commit.73712a01\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_implementation\",\"type\":\"address\"},{\"internalType\":\"bytes\",\"name\":\"_data\",\"type\":\"bytes\"}],\"stateMutability\":\"nonpayable\",\"type\":\"constructor\"},{\"stateMutability\":\"payable\",\"type\":\"fallback\"},{\"stateMutability\":\"payable\",\"type\":\"receive\"}],\"devdoc\":{\"kind\":\"dev\",\"methods\":{},\"version\":1},\"userdoc\":{\"kind\":\"user\",\"methods\":{},\"notice\":\"Workaround to get meaningful names for the proxy contracts Otherwise all the contracts are called `UUPSProxy` on the chain explorers\",\"version\":1}},\"settings\":{\"compilationTarget\":{\"src/proxy/KlerosProxies.sol\":\"DisputeKitClassicUniversityProxy\"},\"evmVersion\":\"cancun\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\",\"useLiteralContent\":true},\"optimizer\":{\"enabled\":true,\"runs\":1000},\"remappings\":[],\"viaIR\":true},\"sources\":{\"src/proxy/KlerosProxies.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\nimport \\\"./UUPSProxy.sol\\\";\\n\\n/// Workaround to get meaningful names for the proxy contracts\\n/// Otherwise all the contracts are called `UUPSProxy` on the chain explorers\\n\\ncontract DisputeKitClassicUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitClassicProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitGatedProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitGatedShutterProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitShutterProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitSybilResistantProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeTemplateRegistryProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract EvidenceModuleProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract ForeignGatewayOnEthereumProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract HomeGatewayToEthereumProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreRulerProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract PolicyRegistryProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract RandomizerRNGProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\",\"keccak256\":\"0x3160bd320b23c6ec0c21862b455c3044a9b33654ae84a1b6cd76255626c9154b\",\"license\":\"MIT\"},\"src/proxy/UUPSProxy.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\n/// @title UUPS Proxy\\n/// @author Simon Malatrait <simon.malatrait@grenoble-inp.org>\\n/// @notice This contract implements a UUPS Proxy compliant with ERC-1967 & ERC-1822.\\n///\\n/// @dev This contract delegates all calls to another contract (UUPS Proxiable) through a fallback function and the use of the `delegatecall` EVM instruction.\\n/// We refer to the Proxiable contract (as per ERC-1822) with `implementation`.\\n/// Adapted from <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/ERC1967/ERC1967Proxy.sol>\\ncontract UUPSProxy {\\n    /// @dev Storage slot with the address of the current implementation.\\n    /// This is the keccak-256 hash of \\\"eip1967.proxy.implementation\\\" subtracted by 1, and is\\n    /// validated in the constructor.\\n    /// NOTE: bytes32(uint256(keccak256('eip1967.proxy.implementation')) - 1)\\n    bytes32 private constant IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;\\n\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    /// @notice Initializes the upgradeable proxy with an initial implementation specified by `_implementation`.\\n    /// @dev If `_data` is nonempty, it's used as data in a delegate call to `_implementation`.\\n    /// This will typically be an encoded function call, and allows initializing the storage of the proxy like a Solidity constructor.\\n    constructor(address _implementation, bytes memory _data) {\\n        assembly {\\n            sstore(IMPLEMENTATION_SLOT, _implementation)\\n        }\\n\\n        if (_data.length != 0) {\\n            (bool success, ) = _implementation.delegatecall(_data);\\n            require(success, \\\"Proxy Constructor failed\\\");\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @dev Delegates the current call to `implementation`.\\n    /// NOTE: This function does not return to its internal call site, it will return directly to the external caller.\\n    function _delegate(address implementation) internal {\\n        assembly {\\n            // Copy msg.data. We take full control of memory in this inline assembly\\n            // block because it will not return to Solidity code. We overwrite the\\n            // Solidity scratch pad at memory position 0.\\n            calldatacopy(0, 0, calldatasize())\\n\\n            // Call the implementation.\\n            // out and outsize are 0 because we don't know the size yet.\\n            let result := delegatecall(gas(), implementation, 0, calldatasize(), 0, 0)\\n\\n            // Copy the returned data.\\n            returndatacopy(0, 0, returndatasize())\\n\\n            switch result\\n            // delegatecall returns 0 on error.\\n            case 0 {\\n                revert(0, returndatasize())\\n            }\\n            default {\\n                return(0, returndatasize())\\n            }\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Internal Views            * //\\n    // ************************************* //\\n\\n    function _getImplementation() internal view returns (address implementation) {\\n        assembly {\\n            implementation := sload(IMPLEMENTATION_SLOT)\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Fallback                * //\\n    // ************************************* //\\n\\n    /// @dev Fallback function that delegates calls to the address returned by `_implementation()`.\\n    /// @dev Will run if no other function in the contract matches the call data.\\n    fallback() external payable {\\n        _delegate(_getImplementation());\\n    }\\n\\n    receive() external payable {\\n        _delegate(_getImplementation());\\n    }\\n}\\n\",\"keccak256\":\"0x2d7b1f81e525787f1b8b033ce381a81cb5f39e411ff31490e019113205a661cd\",\"license\":\"MIT\"}},\"version\":1}",
+  "bytecode": "0x608060405234610144576102148038038061001981610148565b928339810190604081830312610144578051906001600160a01b0382168203610144576020810151906001600160401b038211610144570182601f8201121561014457805161006f61006a82610181565b610148565b9181835260208301946020838301011161014457815f926020809301875e83010152817f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5551806100c9575b6040516077908161019d8239f35b5f9283925af43d1561013f573d6100e261006a82610181565b9081525f60203d92013e5b156100fa575f80806100bb565b60405162461bcd60e51b815260206004820152601860248201527f50726f787920436f6e7374727563746f72206661696c656400000000000000006044820152606490fd5b6100ed565b5f80fd5b6040519190601f01601f191682016001600160401b0381118382101761016d57604052565b634e487b7160e01b5f52604160045260245ffd5b6001600160401b03811161016d57601f01601f19166020019056fe60806040525f807f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc54368280378136915af43d5f803e15603d573d5ff35b3d5ffdfea264697066735822122078e638e186ffb95282090eae06b37667016702ebe14876894d9cb231ea135b1264736f6c634300081e0033",
+  "deployedBytecode": "0x60806040525f807f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc54368280378136915af43d5f803e15603d573d5ff35b3d5ffdfea264697066735822122078e638e186ffb95282090eae06b37667016702ebe14876894d9cb231ea135b1264736f6c634300081e0033",
   "devdoc": {
     "kind": "dev",
     "methods": {},
@@ -72,6 +72,7 @@
   "userdoc": {
     "kind": "user",
     "methods": {},
+    "notice": "Workaround to get meaningful names for the proxy contracts Otherwise all the contracts are called `UUPSProxy` on the chain explorers",
     "version": 1
   },
   "storageLayout": {
diff --git a/contracts/deployments/arbitrumSepoliaDevnet/DisputeResolverUniversity.json b/contracts/deployments/arbitrumSepoliaDevnet/DisputeResolverUniversity.json
index df70ac2d7..ced6acaaf 100644
--- a/contracts/deployments/arbitrumSepoliaDevnet/DisputeResolverUniversity.json
+++ b/contracts/deployments/arbitrumSepoliaDevnet/DisputeResolverUniversity.json
@@ -1,5 +1,5 @@
 {
-  "address": "0x2Aa1a94307E772BeE42E9EfbD137b1053F1fCfd4",
+  "address": "0x8a7902Ef9a5308C7DF0A68A28EEDd6D83436993D",
   "abi": [
     {
       "inputs": [
@@ -17,6 +17,31 @@
       "stateMutability": "nonpayable",
       "type": "constructor"
     },
+    {
+      "inputs": [],
+      "name": "ArbitratorOnly",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "DisputeAlreadyRuled",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "OwnerOnly",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "RulingOutOfBounds",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "ShouldBeAtLeastTwoRulingOptions",
+      "type": "error"
+    },
     {
       "anonymous": false,
       "inputs": [
@@ -43,12 +68,6 @@
           "internalType": "uint256",
           "name": "_templateId",
           "type": "uint256"
-        },
-        {
-          "indexed": false,
-          "internalType": "string",
-          "name": "_templateUri",
-          "type": "string"
         }
       ],
       "name": "DisputeRequest",
@@ -128,11 +147,11 @@
       "inputs": [
         {
           "internalType": "address",
-          "name": "_governor",
+          "name": "_owner",
           "type": "address"
         }
       ],
-      "name": "changeGovernor",
+      "name": "changeOwner",
       "outputs": [],
       "stateMutability": "nonpayable",
       "type": "function"
@@ -184,35 +203,6 @@
       "stateMutability": "payable",
       "type": "function"
     },
-    {
-      "inputs": [
-        {
-          "internalType": "bytes",
-          "name": "_arbitratorExtraData",
-          "type": "bytes"
-        },
-        {
-          "internalType": "string",
-          "name": "_disputeTemplateUri",
-          "type": "string"
-        },
-        {
-          "internalType": "uint256",
-          "name": "_numberOfRulingOptions",
-          "type": "uint256"
-        }
-      ],
-      "name": "createDisputeForTemplateUri",
-      "outputs": [
-        {
-          "internalType": "uint256",
-          "name": "disputeID",
-          "type": "uint256"
-        }
-      ],
-      "stateMutability": "payable",
-      "type": "function"
-    },
     {
       "inputs": [
         {
@@ -249,7 +239,7 @@
     },
     {
       "inputs": [],
-      "name": "governor",
+      "name": "owner",
       "outputs": [
         {
           "internalType": "address",
@@ -292,45 +282,43 @@
       "type": "function"
     }
   ],
-  "transactionHash": "0x6e6144da838df488664fec992cf96ff6d6d7e6d6b2239d15dbaa4db970be6116",
+  "transactionHash": "0x4f3a4aa6c10dc5486a14af9edbc0f2115240604e431b9902d5694f2e9bd893de",
   "receipt": {
     "to": null,
     "from": "0xf1C7c037891525E360C59f708739Ac09A7670c59",
-    "contractAddress": "0x2Aa1a94307E772BeE42E9EfbD137b1053F1fCfd4",
+    "contractAddress": "0x8a7902Ef9a5308C7DF0A68A28EEDd6D83436993D",
     "transactionIndex": 1,
-    "gasUsed": "935568",
+    "gasUsed": "676666",
     "logsBloom": "0x00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
-    "blockHash": "0x581b5decfadcbf1085c9383e7378b7f2738f8a0050031424ce6c036cf809ff5d",
-    "transactionHash": "0x6e6144da838df488664fec992cf96ff6d6d7e6d6b2239d15dbaa4db970be6116",
+    "blockHash": "0x9775b98bdf7d48f5236d3471c48cef965244309e2f8efa2435e030236005bc91",
+    "transactionHash": "0x4f3a4aa6c10dc5486a14af9edbc0f2115240604e431b9902d5694f2e9bd893de",
     "logs": [],
-    "blockNumber": 96308731,
-    "cumulativeGasUsed": "935568",
+    "blockNumber": 193533879,
+    "cumulativeGasUsed": "676666",
     "status": 1,
     "byzantium": true
   },
   "args": [
-    "0x5AB37F38778Bc175852fA353056591D91c744ce6",
-    "0x596D3B09E684D62217682216e9b7a0De75933391"
+    "0xA34dBBD0E5e1d09bd683455f9dbC393797BC558f",
+    "0xc852F94f90E3B06Da6eCfB61d76561ECfb94613f"
   ],
   "numDeployments": 1,
-  "solcInputHash": "a5602534c00c2f67ca4b6a1cab8c717e",
-  "metadata": "{\"compiler\":{\"version\":\"0.8.24+commit.e11b9ed9\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"inputs\":[{\"internalType\":\"contract IArbitratorV2\",\"name\":\"_arbitrator\",\"type\":\"address\"},{\"internalType\":\"contract IDisputeTemplateRegistry\",\"name\":\"_templateRegistry\",\"type\":\"address\"}],\"stateMutability\":\"nonpayable\",\"type\":\"constructor\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"contract IArbitratorV2\",\"name\":\"_arbitrator\",\"type\":\"address\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_arbitratorDisputeID\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_externalDisputeID\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_templateId\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"string\",\"name\":\"_templateUri\",\"type\":\"string\"}],\"name\":\"DisputeRequest\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"contract IArbitratorV2\",\"name\":\"_arbitrator\",\"type\":\"address\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_ruling\",\"type\":\"uint256\"}],\"name\":\"Ruling\",\"type\":\"event\"},{\"inputs\":[],\"name\":\"arbitrator\",\"outputs\":[{\"internalType\":\"contract IArbitratorV2\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"name\":\"arbitratorDisputeIDToLocalID\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"contract IArbitratorV2\",\"name\":\"_arbitrator\",\"type\":\"address\"}],\"name\":\"changeArbitrator\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_governor\",\"type\":\"address\"}],\"name\":\"changeGovernor\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"contract IDisputeTemplateRegistry\",\"name\":\"_templateRegistry\",\"type\":\"address\"}],\"name\":\"changeTemplateRegistry\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes\",\"name\":\"_arbitratorExtraData\",\"type\":\"bytes\"},{\"internalType\":\"string\",\"name\":\"_disputeTemplate\",\"type\":\"string\"},{\"internalType\":\"string\",\"name\":\"_disputeTemplateDataMappings\",\"type\":\"string\"},{\"internalType\":\"uint256\",\"name\":\"_numberOfRulingOptions\",\"type\":\"uint256\"}],\"name\":\"createDisputeForTemplate\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"disputeID\",\"type\":\"uint256\"}],\"stateMutability\":\"payable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes\",\"name\":\"_arbitratorExtraData\",\"type\":\"bytes\"},{\"internalType\":\"string\",\"name\":\"_disputeTemplateUri\",\"type\":\"string\"},{\"internalType\":\"uint256\",\"name\":\"_numberOfRulingOptions\",\"type\":\"uint256\"}],\"name\":\"createDisputeForTemplateUri\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"disputeID\",\"type\":\"uint256\"}],\"stateMutability\":\"payable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"name\":\"disputes\",\"outputs\":[{\"internalType\":\"bytes\",\"name\":\"arbitratorExtraData\",\"type\":\"bytes\"},{\"internalType\":\"bool\",\"name\":\"isRuled\",\"type\":\"bool\"},{\"internalType\":\"uint256\",\"name\":\"ruling\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"numberOfRulingOptions\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"governor\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_arbitratorDisputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_ruling\",\"type\":\"uint256\"}],\"name\":\"rule\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"templateRegistry\",\"outputs\":[{\"internalType\":\"contract IDisputeTemplateRegistry\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"}],\"devdoc\":{\"events\":{\"DisputeRequest(address,uint256,uint256,uint256,string)\":{\"details\":\"To be emitted when a dispute is created to link the correct meta-evidence to the disputeID.\",\"params\":{\"_arbitrator\":\"The arbitrator of the contract.\",\"_arbitratorDisputeID\":\"The identifier of the dispute in the Arbitrator contract.\",\"_externalDisputeID\":\"An identifier created outside Kleros by the protocol requesting arbitration.\",\"_templateId\":\"The identifier of the dispute template. Should not be used with _templateUri.\",\"_templateUri\":\"The URI to the dispute template. For example on IPFS: starting with '/ipfs/'. Should not be used with _templateId.\"}},\"Ruling(address,uint256,uint256)\":{\"details\":\"To be raised when a ruling is given.\",\"params\":{\"_arbitrator\":\"The arbitrator giving the ruling.\",\"_disputeID\":\"The identifier of the dispute in the Arbitrator contract.\",\"_ruling\":\"The ruling which was given.\"}}},\"kind\":\"dev\",\"methods\":{\"changeGovernor(address)\":{\"details\":\"Changes the governor.\",\"params\":{\"_governor\":\"The address of the new governor.\"}},\"constructor\":{\"details\":\"Constructor\",\"params\":{\"_arbitrator\":\"Target global arbitrator for any disputes.\"}},\"createDisputeForTemplate(bytes,string,string,uint256)\":{\"details\":\"Calls createDispute function of the specified arbitrator to create a dispute. Note that we don\\u2019t need to check that msg.value is enough to pay arbitration fees as it\\u2019s the responsibility of the arbitrator contract.\",\"params\":{\"_arbitratorExtraData\":\"Extra data for the arbitrator of the dispute.\",\"_disputeTemplate\":\"Dispute template.\",\"_disputeTemplateDataMappings\":\"The data mappings.\",\"_numberOfRulingOptions\":\"Number of ruling options.\"},\"returns\":{\"disputeID\":\"Dispute id (on arbitrator side) of the created dispute.\"}},\"createDisputeForTemplateUri(bytes,string,uint256)\":{\"details\":\"Calls createDispute function of the specified arbitrator to create a dispute. Note that we don\\u2019t need to check that msg.value is enough to pay arbitration fees as it\\u2019s the responsibility of the arbitrator contract.\",\"params\":{\"_arbitratorExtraData\":\"Extra data for the arbitrator of the dispute.\",\"_disputeTemplateUri\":\"The URI to the dispute template. For example on IPFS: starting with '/ipfs/'.\",\"_numberOfRulingOptions\":\"Number of ruling options.\"},\"returns\":{\"disputeID\":\"Dispute id (on arbitrator side) of the created dispute.\"}},\"rule(uint256,uint256)\":{\"details\":\"To be called by the arbitrator of the dispute, to declare the winning ruling.\",\"params\":{\"_arbitratorDisputeID\":\"ID of the dispute in arbitrator contract.\",\"_ruling\":\"The ruling choice of the arbitration.\"}}},\"title\":\"DisputeResolver DisputeResolver contract adapted for V2 from https://github.com/kleros/arbitrable-proxy-contracts/blob/master/contracts/ArbitrableProxy.sol.\",\"version\":1},\"userdoc\":{\"kind\":\"user\",\"methods\":{},\"version\":1}},\"settings\":{\"compilationTarget\":{\"src/arbitration/arbitrables/DisputeResolver.sol\":\"DisputeResolver\"},\"evmVersion\":\"paris\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\",\"useLiteralContent\":true},\"optimizer\":{\"enabled\":true,\"runs\":100},\"remappings\":[]},\"sources\":{\"@openzeppelin/contracts/token/ERC20/IERC20.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC20/IERC20.sol)\\n\\npragma solidity ^0.8.20;\\n\\n/**\\n * @dev Interface of the ERC-20 standard as defined in the ERC.\\n */\\ninterface IERC20 {\\n    /**\\n     * @dev Emitted when `value` tokens are moved from one account (`from`) to\\n     * another (`to`).\\n     *\\n     * Note that `value` may be zero.\\n     */\\n    event Transfer(address indexed from, address indexed to, uint256 value);\\n\\n    /**\\n     * @dev Emitted when the allowance of a `spender` for an `owner` is set by\\n     * a call to {approve}. `value` is the new allowance.\\n     */\\n    event Approval(address indexed owner, address indexed spender, uint256 value);\\n\\n    /**\\n     * @dev Returns the value of tokens in existence.\\n     */\\n    function totalSupply() external view returns (uint256);\\n\\n    /**\\n     * @dev Returns the value of tokens owned by `account`.\\n     */\\n    function balanceOf(address account) external view returns (uint256);\\n\\n    /**\\n     * @dev Moves a `value` amount of tokens from the caller's account to `to`.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * Emits a {Transfer} event.\\n     */\\n    function transfer(address to, uint256 value) external returns (bool);\\n\\n    /**\\n     * @dev Returns the remaining number of tokens that `spender` will be\\n     * allowed to spend on behalf of `owner` through {transferFrom}. This is\\n     * zero by default.\\n     *\\n     * This value changes when {approve} or {transferFrom} are called.\\n     */\\n    function allowance(address owner, address spender) external view returns (uint256);\\n\\n    /**\\n     * @dev Sets a `value` amount of tokens as the allowance of `spender` over the\\n     * caller's tokens.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * IMPORTANT: Beware that changing an allowance with this method brings the risk\\n     * that someone may use both the old and the new allowance by unfortunate\\n     * transaction ordering. One possible solution to mitigate this race\\n     * condition is to first reduce the spender's allowance to 0 and set the\\n     * desired value afterwards:\\n     * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729\\n     *\\n     * Emits an {Approval} event.\\n     */\\n    function approve(address spender, uint256 value) external returns (bool);\\n\\n    /**\\n     * @dev Moves a `value` amount of tokens from `from` to `to` using the\\n     * allowance mechanism. `value` is then deducted from the caller's\\n     * allowance.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * Emits a {Transfer} event.\\n     */\\n    function transferFrom(address from, address to, uint256 value) external returns (bool);\\n}\\n\",\"keccak256\":\"0xe06a3f08a987af6ad2e1c1e774405d4fe08f1694b67517438b467cecf0da0ef7\",\"license\":\"MIT\"},\"src/arbitration/arbitrables/DisputeResolver.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n/// @custom:authors: [@unknownunknown1, @jaybuidl]\\n/// @custom:reviewers: []\\n/// @custom:auditors: []\\n/// @custom:bounties: []\\n\\nimport {IArbitrableV2, IArbitratorV2} from \\\"../interfaces/IArbitrableV2.sol\\\";\\nimport \\\"../interfaces/IDisputeTemplateRegistry.sol\\\";\\n\\npragma solidity 0.8.24;\\n\\n/// @title DisputeResolver\\n/// DisputeResolver contract adapted for V2 from https://github.com/kleros/arbitrable-proxy-contracts/blob/master/contracts/ArbitrableProxy.sol.\\ncontract DisputeResolver is IArbitrableV2 {\\n    // ************************************* //\\n    // *         Enums / Structs           * //\\n    // ************************************* //\\n\\n    struct DisputeStruct {\\n        bytes arbitratorExtraData; // Extra data for the dispute.\\n        bool isRuled; // True if the dispute has been ruled.\\n        uint256 ruling; // Ruling given to the dispute.\\n        uint256 numberOfRulingOptions; // The number of choices the arbitrator can give.\\n    }\\n\\n    // ************************************* //\\n    // *             Storage               * //\\n    // ************************************* //\\n\\n    address public governor; // The governor.\\n    IArbitratorV2 public arbitrator; // The arbitrator.\\n    IDisputeTemplateRegistry public templateRegistry; // The dispute template registry.\\n    DisputeStruct[] public disputes; // Local disputes.\\n    mapping(uint256 => uint256) public arbitratorDisputeIDToLocalID; // Maps arbitrator-side dispute IDs to local dispute IDs.\\n\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    /// @dev Constructor\\n    /// @param _arbitrator Target global arbitrator for any disputes.\\n    constructor(IArbitratorV2 _arbitrator, IDisputeTemplateRegistry _templateRegistry) {\\n        governor = msg.sender;\\n        arbitrator = _arbitrator;\\n        templateRegistry = _templateRegistry;\\n    }\\n\\n    // ************************************* //\\n    // *           Governance              * //\\n    // ************************************* //\\n\\n    /// @dev Changes the governor.\\n    /// @param _governor The address of the new governor.\\n    function changeGovernor(address _governor) external {\\n        require(governor == msg.sender, \\\"Access not allowed: Governor only.\\\");\\n        governor = _governor;\\n    }\\n\\n    function changeArbitrator(IArbitratorV2 _arbitrator) external {\\n        require(governor == msg.sender, \\\"Access not allowed: Governor only.\\\");\\n        arbitrator = _arbitrator;\\n    }\\n\\n    function changeTemplateRegistry(IDisputeTemplateRegistry _templateRegistry) external {\\n        require(governor == msg.sender, \\\"Access not allowed: Governor only.\\\");\\n        templateRegistry = _templateRegistry;\\n    }\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @dev Calls createDispute function of the specified arbitrator to create a dispute.\\n    /// Note that we don\\u2019t need to check that msg.value is enough to pay arbitration fees as it\\u2019s the responsibility of the arbitrator contract.\\n    /// @param _arbitratorExtraData Extra data for the arbitrator of the dispute.\\n    /// @param _disputeTemplate Dispute template.\\n    /// @param _disputeTemplateDataMappings The data mappings.\\n    /// @param _numberOfRulingOptions Number of ruling options.\\n    /// @return disputeID Dispute id (on arbitrator side) of the created dispute.\\n    function createDisputeForTemplate(\\n        bytes calldata _arbitratorExtraData,\\n        string calldata _disputeTemplate,\\n        string memory _disputeTemplateDataMappings,\\n        uint256 _numberOfRulingOptions\\n    ) external payable returns (uint256 disputeID) {\\n        return\\n            _createDispute(\\n                _arbitratorExtraData,\\n                _disputeTemplate,\\n                _disputeTemplateDataMappings,\\n                \\\"\\\",\\n                _numberOfRulingOptions\\n            );\\n    }\\n\\n    /// @dev Calls createDispute function of the specified arbitrator to create a dispute.\\n    /// Note that we don\\u2019t need to check that msg.value is enough to pay arbitration fees as it\\u2019s the responsibility of the arbitrator contract.\\n    /// @param _arbitratorExtraData Extra data for the arbitrator of the dispute.\\n    /// @param _disputeTemplateUri The URI to the dispute template. For example on IPFS: starting with '/ipfs/'.\\n    /// @param _numberOfRulingOptions Number of ruling options.\\n    /// @return disputeID Dispute id (on arbitrator side) of the created dispute.\\n    function createDisputeForTemplateUri(\\n        bytes calldata _arbitratorExtraData,\\n        string calldata _disputeTemplateUri,\\n        uint256 _numberOfRulingOptions\\n    ) external payable returns (uint256 disputeID) {\\n        return _createDispute(_arbitratorExtraData, \\\"\\\", \\\"\\\", _disputeTemplateUri, _numberOfRulingOptions);\\n    }\\n\\n    /// @dev To be called by the arbitrator of the dispute, to declare the winning ruling.\\n    /// @param _arbitratorDisputeID ID of the dispute in arbitrator contract.\\n    /// @param _ruling The ruling choice of the arbitration.\\n    function rule(uint256 _arbitratorDisputeID, uint256 _ruling) external override {\\n        uint256 localDisputeID = arbitratorDisputeIDToLocalID[_arbitratorDisputeID];\\n        DisputeStruct storage dispute = disputes[localDisputeID];\\n        require(msg.sender == address(arbitrator), \\\"Only the arbitrator can execute this.\\\");\\n        require(_ruling <= dispute.numberOfRulingOptions, \\\"Invalid ruling.\\\");\\n        require(!dispute.isRuled, \\\"This dispute has been ruled already.\\\");\\n\\n        dispute.isRuled = true;\\n        dispute.ruling = _ruling;\\n\\n        emit Ruling(IArbitratorV2(msg.sender), _arbitratorDisputeID, dispute.ruling);\\n    }\\n\\n    // ************************************* //\\n    // *            Internal               * //\\n    // ************************************* //\\n\\n    function _createDispute(\\n        bytes calldata _arbitratorExtraData,\\n        string memory _disputeTemplate,\\n        string memory _disputeTemplateDataMappings,\\n        string memory _disputeTemplateUri,\\n        uint256 _numberOfRulingOptions\\n    ) internal virtual returns (uint256 arbitratorDisputeID) {\\n        require(_numberOfRulingOptions > 1, \\\"Should be at least 2 ruling options.\\\");\\n\\n        arbitratorDisputeID = arbitrator.createDispute{value: msg.value}(_numberOfRulingOptions, _arbitratorExtraData);\\n        uint256 localDisputeID = disputes.length;\\n        disputes.push(\\n            DisputeStruct({\\n                arbitratorExtraData: _arbitratorExtraData,\\n                isRuled: false,\\n                ruling: 0,\\n                numberOfRulingOptions: _numberOfRulingOptions\\n            })\\n        );\\n        arbitratorDisputeIDToLocalID[arbitratorDisputeID] = localDisputeID;\\n        uint256 templateId = templateRegistry.setDisputeTemplate(\\\"\\\", _disputeTemplate, _disputeTemplateDataMappings);\\n        emit DisputeRequest(arbitrator, arbitratorDisputeID, localDisputeID, templateId, _disputeTemplateUri);\\n    }\\n}\\n\",\"keccak256\":\"0xee61f409399f0e66be187def6fcbe2e23717475b2b752d913dfac0a32c7dca1a\",\"license\":\"MIT\"},\"src/arbitration/interfaces/IArbitrableV2.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity 0.8.24;\\n\\nimport \\\"./IArbitratorV2.sol\\\";\\n\\n/// @title IArbitrableV2\\n/// @notice Arbitrable interface.\\n/// @dev When developing arbitrable contracts, we need to:\\n/// - Define the action taken when a ruling is received by the contract.\\n/// - Allow dispute creation. For this a function must call arbitrator.createDispute{value: _fee}(_choices,_extraData);\\ninterface IArbitrableV2 {\\n    /// @dev To be emitted when a dispute is created to link the correct meta-evidence to the disputeID.\\n    /// @param _arbitrator The arbitrator of the contract.\\n    /// @param _arbitratorDisputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _externalDisputeID An identifier created outside Kleros by the protocol requesting arbitration.\\n    /// @param _templateId The identifier of the dispute template. Should not be used with _templateUri.\\n    /// @param _templateUri The URI to the dispute template. For example on IPFS: starting with '/ipfs/'. Should not be used with _templateId.\\n    event DisputeRequest(\\n        IArbitratorV2 indexed _arbitrator,\\n        uint256 indexed _arbitratorDisputeID,\\n        uint256 _externalDisputeID,\\n        uint256 _templateId,\\n        string _templateUri\\n    );\\n\\n    /// @dev To be raised when a ruling is given.\\n    /// @param _arbitrator The arbitrator giving the ruling.\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _ruling The ruling which was given.\\n    event Ruling(IArbitratorV2 indexed _arbitrator, uint256 indexed _disputeID, uint256 _ruling);\\n\\n    /// @dev Give a ruling for a dispute.\\n    ///      Must be called by the arbitrator.\\n    ///      The purpose of this function is to ensure that the address calling it has the right to rule on the contract.\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _ruling Ruling given by the arbitrator.\\n    /// Note that 0 is reserved for \\\"Not able/wanting to make a decision\\\".\\n    function rule(uint256 _disputeID, uint256 _ruling) external;\\n}\\n\",\"keccak256\":\"0xe841a4fe8ec109ce17dde4457bf1583c8b499109b05887c53a49a3207fc6e80b\",\"license\":\"MIT\"},\"src/arbitration/interfaces/IArbitratorV2.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity 0.8.24;\\n\\nimport \\\"@openzeppelin/contracts/token/ERC20/IERC20.sol\\\";\\nimport \\\"./IArbitrableV2.sol\\\";\\n\\n/// @title Arbitrator\\n/// Arbitrator interface that implements the new arbitration standard.\\n/// Unlike the ERC-792 this standard is not concerned with appeals, so each arbitrator can implement an appeal system that suits it the most.\\n/// When developing arbitrator contracts we need to:\\n/// - Define the functions for dispute creation (createDispute). Don't forget to store the arbitrated contract and the disputeID (which should be unique, may nbDisputes).\\n/// - Define the functions for cost display (arbitrationCost).\\n/// - Allow giving rulings. For this a function must call arbitrable.rule(disputeID, ruling).\\ninterface IArbitratorV2 {\\n    /// @dev To be emitted when a dispute is created.\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _arbitrable The contract which created the dispute.\\n    event DisputeCreation(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);\\n\\n    /// @dev To be raised when a ruling is given.\\n    /// @param _arbitrable The arbitrable receiving the ruling.\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _ruling The ruling which was given.\\n    event Ruling(IArbitrableV2 indexed _arbitrable, uint256 indexed _disputeID, uint256 _ruling);\\n\\n    /// @dev To be emitted when an ERC20 token is added or removed as a method to pay fees.\\n    /// @param _token The ERC20 token.\\n    /// @param _accepted Whether the token is accepted or not.\\n    event AcceptedFeeToken(IERC20 indexed _token, bool indexed _accepted);\\n\\n    /// @dev To be emitted when the fee for a particular ERC20 token is updated.\\n    /// @param _feeToken The ERC20 token.\\n    /// @param _rateInEth The new rate of the fee token in ETH.\\n    /// @param _rateDecimals The new decimals of the fee token rate.\\n    event NewCurrencyRate(IERC20 indexed _feeToken, uint64 _rateInEth, uint8 _rateDecimals);\\n\\n    /// @dev Create a dispute and pay for the fees in the native currency, typically ETH.\\n    ///      Must be called by the arbitrable contract.\\n    ///      Must pay at least arbitrationCost(_extraData).\\n    /// @param _numberOfChoices The number of choices the arbitrator can choose from in this dispute.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @return disputeID The identifier of the dispute created.\\n    function createDispute(\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData\\n    ) external payable returns (uint256 disputeID);\\n\\n    /// @dev Create a dispute and pay for the fees in a supported ERC20 token.\\n    ///      Must be called by the arbitrable contract.\\n    ///      Must pay at least arbitrationCost(_extraData).\\n    /// @param _numberOfChoices The number of choices the arbitrator can choose from in this dispute.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @param _feeToken The ERC20 token used to pay fees.\\n    /// @param _feeAmount Amount of the ERC20 token used to pay fees.\\n    /// @return disputeID The identifier of the dispute created.\\n    function createDispute(\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData,\\n        IERC20 _feeToken,\\n        uint256 _feeAmount\\n    ) external returns (uint256 disputeID);\\n\\n    /// @dev Compute the cost of arbitration denominated in the native currency, typically ETH.\\n    ///      It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @return cost The arbitration cost in ETH.\\n    function arbitrationCost(bytes calldata _extraData) external view returns (uint256 cost);\\n\\n    /// @dev Compute the cost of arbitration denominated in `_feeToken`.\\n    ///      It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @param _feeToken The ERC20 token used to pay fees.\\n    /// @return cost The arbitration cost in `_feeToken`.\\n    function arbitrationCost(bytes calldata _extraData, IERC20 _feeToken) external view returns (uint256 cost);\\n\\n    /// @dev Gets the current ruling of a specified dispute.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return ruling The current ruling.\\n    /// @return tied Whether it's a tie or not.\\n    /// @return overridden Whether the ruling was overridden by appeal funding or not.\\n    function currentRuling(uint256 _disputeID) external view returns (uint256 ruling, bool tied, bool overridden);\\n}\\n\",\"keccak256\":\"0xa4dc6b958197adead238de4246cd04e7389c3dc1b9f968acd10985f8fc5b74cf\",\"license\":\"MIT\"},\"src/arbitration/interfaces/IDisputeTemplateRegistry.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity 0.8.24;\\n\\n/// @title IDisputeTemplate\\n/// @notice Dispute Template interface.\\ninterface IDisputeTemplateRegistry {\\n    /// @dev To be emitted when a new dispute template is created.\\n    /// @param _templateId The identifier of the dispute template.\\n    /// @param _templateTag An optional tag for the dispute template, such as \\\"registration\\\" or \\\"removal\\\".\\n    /// @param _templateData The template data.\\n    /// @param _templateDataMappings The data mappings.\\n    event DisputeTemplate(\\n        uint256 indexed _templateId,\\n        string indexed _templateTag,\\n        string _templateData,\\n        string _templateDataMappings\\n    );\\n\\n    function setDisputeTemplate(\\n        string memory _templateTag,\\n        string memory _templateData,\\n        string memory _templateDataMappings\\n    ) external returns (uint256 templateId);\\n}\\n\",\"keccak256\":\"0xb46ff71c32a524a865fe8ca99d94c9daeb690bc9d7d49d963a45b06f60af19f3\",\"license\":\"MIT\"}},\"version\":1}",
-  "bytecode": "0x608060405234801561001057600080fd5b50604051610ed7380380610ed783398101604081905261002f91610083565b600080546001600160a01b03199081163317909155600180546001600160a01b03948516908316179055600280549290931691161790556100bd565b6001600160a01b038116811461008057600080fd5b50565b6000806040838503121561009657600080fd5b82516100a18161006b565b60208401519092506100b28161006b565b809150509250929050565b610e0b806100cc6000396000f3fe60806040526004361061009c5760003560e01c8063908bb29511610064578063908bb29514610170578063a0af81f014610191578063dc653511146101b1578063e09997d9146101c4578063e4c0aaf4146101f1578063fc548f081461021157600080fd5b80630c340a24146100a1578063311a6c56146100de5780634660ebbe14610100578063564a565d146101205780636cc6cde114610150575b600080fd5b3480156100ad57600080fd5b506000546100c1906001600160a01b031681565b6040516001600160a01b0390911681526020015b60405180910390f35b3480156100ea57600080fd5b506100fe6100f93660046108bb565b610231565b005b34801561010c57600080fd5b506100fe61011b3660046108f5565b6103d1565b34801561012c57600080fd5b5061014061013b366004610919565b61041d565b6040516100d59493929190610978565b34801561015c57600080fd5b506001546100c1906001600160a01b031681565b61018361017e3660046109f0565b6104eb565b6040519081526020016100d5565b34801561019d57600080fd5b506002546100c1906001600160a01b031681565b6101836101bf366004610a7a565b61055a565b3480156101d057600080fd5b506101836101df366004610919565b60046020526000908152604090205481565b3480156101fd57600080fd5b506100fe61020c3660046108f5565b6105b9565b34801561021d57600080fd5b506100fe61022c3660046108f5565b610605565b600082815260046020526040812054600380549192918390811061025757610257610b88565b6000918252602090912060015460049092020191506001600160a01b031633146102d65760405162461bcd60e51b815260206004820152602560248201527f4f6e6c79207468652061726269747261746f722063616e2065786563757465206044820152643a3434b99760d91b60648201526084015b60405180910390fd5b806003015483111561031c5760405162461bcd60e51b815260206004820152600f60248201526e24b73b30b634b210393ab634b7339760891b60448201526064016102cd565b600181015460ff161561037d5760405162461bcd60e51b8152602060048201526024808201527f54686973206469737075746520686173206265656e2072756c656420616c726560448201526330b23c9760e11b60648201526084016102cd565b6001818101805460ff1916909117905560028101839055604051838152849033907f394027a5fa6e098a1191094d1719d6929b9abc535fcc0c8f448d6a4e756222769060200160405180910390a350505050565b6000546001600160a01b031633146103fb5760405162461bcd60e51b81526004016102cd90610b9e565b600280546001600160a01b0319166001600160a01b0392909216919091179055565b6003818154811061042d57600080fd5b906000526020600020906004020160009150905080600001805461045090610be0565b80601f016020809104026020016040519081016040528092919081815260200182805461047c90610be0565b80156104c95780601f1061049e576101008083540402835291602001916104c9565b820191906000526020600020905b8154815290600101906020018083116104ac57829003601f168201915b5050505060018301546002840154600390940154929360ff9091169290915084565b60006105508686604051806020016040528060008152506040518060200160405280600081525088888080601f0160208091040260200160405190810160405280939291908181526020018383808284376000920191909152508a9250610651915050565b9695505050505050565b60006105ae878787878080601f016020809104026020016040519081016040528093929190818152602001838380828437600092018290525060408051602081019091529081528a93509150889050610651565b979650505050505050565b6000546001600160a01b031633146105e35760405162461bcd60e51b81526004016102cd90610b9e565b600080546001600160a01b0319166001600160a01b0392909216919091179055565b6000546001600160a01b0316331461062f5760405162461bcd60e51b81526004016102cd90610b9e565b600180546001600160a01b0319166001600160a01b0392909216919091179055565b6000600182116106af5760405162461bcd60e51b8152602060048201526024808201527f53686f756c64206265206174206c6561737420322072756c696e67206f70746960448201526337b7399760e11b60648201526084016102cd565b60015460405163c13517e160e01b81526001600160a01b039091169063c13517e19034906106e59086908c908c90600401610c1a565b60206040518083038185885af1158015610703573d6000803e3d6000fd5b50505050506040513d601f19601f820116820180604052508101906107289190610c50565b600380546040805160a06020601f8d018190040282018101909252608081018b8152949550919382918c908c90819085018382808284376000920182905250938552505050602080830182905260408301829052606090920187905283546001810185559381522081519192600402019081906107a59082610cba565b5060208281015160018301805460ff19169115159190911790556040808401516002808501919091556060909401516003909301929092556000858152600491829052828120859055925491516312a6505d60e21b81526001600160a01b0390921691634a9941749161081c918b918b9101610d7a565b6020604051808303816000875af115801561083b573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061085f9190610c50565b60015460405191925084916001600160a01b03909116907f8bd32f430ff060e6bd204709b3790c9807987263d3230c580dc80b5f89e27186906108a790869086908b90610db6565b60405180910390a350509695505050505050565b600080604083850312156108ce57600080fd5b50508035926020909101359150565b6001600160a01b03811681146108f257600080fd5b50565b60006020828403121561090757600080fd5b8135610912816108dd565b9392505050565b60006020828403121561092b57600080fd5b5035919050565b6000815180845260005b818110156109585760208185018101518683018201520161093c565b506000602082860101526020601f19601f83011685010191505092915050565b60808152600061098b6080830187610932565b9415156020830152506040810192909252606090910152919050565b60008083601f8401126109b957600080fd5b50813567ffffffffffffffff8111156109d157600080fd5b6020830191508360208285010111156109e957600080fd5b9250929050565b600080600080600060608688031215610a0857600080fd5b853567ffffffffffffffff80821115610a2057600080fd5b610a2c89838a016109a7565b90975095506020880135915080821115610a4557600080fd5b50610a52888289016109a7565b96999598509660400135949350505050565b634e487b7160e01b600052604160045260246000fd5b60008060008060008060808789031215610a9357600080fd5b863567ffffffffffffffff80821115610aab57600080fd5b610ab78a838b016109a7565b90985096506020890135915080821115610ad057600080fd5b610adc8a838b016109a7565b90965094506040890135915080821115610af557600080fd5b818901915089601f830112610b0957600080fd5b813581811115610b1b57610b1b610a64565b604051601f8201601f19908116603f01168101908382118183101715610b4357610b43610a64565b816040528281528c6020848701011115610b5c57600080fd5b826020860160208301376000602084830101528096505050505050606087013590509295509295509295565b634e487b7160e01b600052603260045260246000fd5b60208082526022908201527f416363657373206e6f7420616c6c6f7765643a20476f7665726e6f72206f6e6c6040820152613c9760f11b606082015260800190565b600181811c90821680610bf457607f821691505b602082108103610c1457634e487b7160e01b600052602260045260246000fd5b50919050565b83815260406020820152816040820152818360608301376000818301606090810191909152601f909201601f1916010192915050565b600060208284031215610c6257600080fd5b5051919050565b601f821115610cb5576000816000526020600020601f850160051c81016020861015610c925750805b601f850160051c820191505b81811015610cb157828155600101610c9e565b5050505b505050565b815167ffffffffffffffff811115610cd457610cd4610a64565b610ce881610ce28454610be0565b84610c69565b602080601f831160018114610d1d5760008415610d055750858301515b600019600386901b1c1916600185901b178555610cb1565b600085815260208120601f198616915b82811015610d4c57888601518255948401946001909101908401610d2d565b5085821015610d6a5787850151600019600388901b60f8161c191681555b5050505050600190811b01905550565b6060815260006060820152608060208201526000610d9b6080830185610932565b8281036040840152610dad8185610932565b95945050505050565b838152826020820152606060408201526000610dad606083018461093256fea264697066735822122028e3f1561d663e8479b35f936c2645829463b01bf5fedd3e120b732867bda19a64736f6c63430008180033",
-  "deployedBytecode": "0x60806040526004361061009c5760003560e01c8063908bb29511610064578063908bb29514610170578063a0af81f014610191578063dc653511146101b1578063e09997d9146101c4578063e4c0aaf4146101f1578063fc548f081461021157600080fd5b80630c340a24146100a1578063311a6c56146100de5780634660ebbe14610100578063564a565d146101205780636cc6cde114610150575b600080fd5b3480156100ad57600080fd5b506000546100c1906001600160a01b031681565b6040516001600160a01b0390911681526020015b60405180910390f35b3480156100ea57600080fd5b506100fe6100f93660046108bb565b610231565b005b34801561010c57600080fd5b506100fe61011b3660046108f5565b6103d1565b34801561012c57600080fd5b5061014061013b366004610919565b61041d565b6040516100d59493929190610978565b34801561015c57600080fd5b506001546100c1906001600160a01b031681565b61018361017e3660046109f0565b6104eb565b6040519081526020016100d5565b34801561019d57600080fd5b506002546100c1906001600160a01b031681565b6101836101bf366004610a7a565b61055a565b3480156101d057600080fd5b506101836101df366004610919565b60046020526000908152604090205481565b3480156101fd57600080fd5b506100fe61020c3660046108f5565b6105b9565b34801561021d57600080fd5b506100fe61022c3660046108f5565b610605565b600082815260046020526040812054600380549192918390811061025757610257610b88565b6000918252602090912060015460049092020191506001600160a01b031633146102d65760405162461bcd60e51b815260206004820152602560248201527f4f6e6c79207468652061726269747261746f722063616e2065786563757465206044820152643a3434b99760d91b60648201526084015b60405180910390fd5b806003015483111561031c5760405162461bcd60e51b815260206004820152600f60248201526e24b73b30b634b210393ab634b7339760891b60448201526064016102cd565b600181015460ff161561037d5760405162461bcd60e51b8152602060048201526024808201527f54686973206469737075746520686173206265656e2072756c656420616c726560448201526330b23c9760e11b60648201526084016102cd565b6001818101805460ff1916909117905560028101839055604051838152849033907f394027a5fa6e098a1191094d1719d6929b9abc535fcc0c8f448d6a4e756222769060200160405180910390a350505050565b6000546001600160a01b031633146103fb5760405162461bcd60e51b81526004016102cd90610b9e565b600280546001600160a01b0319166001600160a01b0392909216919091179055565b6003818154811061042d57600080fd5b906000526020600020906004020160009150905080600001805461045090610be0565b80601f016020809104026020016040519081016040528092919081815260200182805461047c90610be0565b80156104c95780601f1061049e576101008083540402835291602001916104c9565b820191906000526020600020905b8154815290600101906020018083116104ac57829003601f168201915b5050505060018301546002840154600390940154929360ff9091169290915084565b60006105508686604051806020016040528060008152506040518060200160405280600081525088888080601f0160208091040260200160405190810160405280939291908181526020018383808284376000920191909152508a9250610651915050565b9695505050505050565b60006105ae878787878080601f016020809104026020016040519081016040528093929190818152602001838380828437600092018290525060408051602081019091529081528a93509150889050610651565b979650505050505050565b6000546001600160a01b031633146105e35760405162461bcd60e51b81526004016102cd90610b9e565b600080546001600160a01b0319166001600160a01b0392909216919091179055565b6000546001600160a01b0316331461062f5760405162461bcd60e51b81526004016102cd90610b9e565b600180546001600160a01b0319166001600160a01b0392909216919091179055565b6000600182116106af5760405162461bcd60e51b8152602060048201526024808201527f53686f756c64206265206174206c6561737420322072756c696e67206f70746960448201526337b7399760e11b60648201526084016102cd565b60015460405163c13517e160e01b81526001600160a01b039091169063c13517e19034906106e59086908c908c90600401610c1a565b60206040518083038185885af1158015610703573d6000803e3d6000fd5b50505050506040513d601f19601f820116820180604052508101906107289190610c50565b600380546040805160a06020601f8d018190040282018101909252608081018b8152949550919382918c908c90819085018382808284376000920182905250938552505050602080830182905260408301829052606090920187905283546001810185559381522081519192600402019081906107a59082610cba565b5060208281015160018301805460ff19169115159190911790556040808401516002808501919091556060909401516003909301929092556000858152600491829052828120859055925491516312a6505d60e21b81526001600160a01b0390921691634a9941749161081c918b918b9101610d7a565b6020604051808303816000875af115801561083b573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061085f9190610c50565b60015460405191925084916001600160a01b03909116907f8bd32f430ff060e6bd204709b3790c9807987263d3230c580dc80b5f89e27186906108a790869086908b90610db6565b60405180910390a350509695505050505050565b600080604083850312156108ce57600080fd5b50508035926020909101359150565b6001600160a01b03811681146108f257600080fd5b50565b60006020828403121561090757600080fd5b8135610912816108dd565b9392505050565b60006020828403121561092b57600080fd5b5035919050565b6000815180845260005b818110156109585760208185018101518683018201520161093c565b506000602082860101526020601f19601f83011685010191505092915050565b60808152600061098b6080830187610932565b9415156020830152506040810192909252606090910152919050565b60008083601f8401126109b957600080fd5b50813567ffffffffffffffff8111156109d157600080fd5b6020830191508360208285010111156109e957600080fd5b9250929050565b600080600080600060608688031215610a0857600080fd5b853567ffffffffffffffff80821115610a2057600080fd5b610a2c89838a016109a7565b90975095506020880135915080821115610a4557600080fd5b50610a52888289016109a7565b96999598509660400135949350505050565b634e487b7160e01b600052604160045260246000fd5b60008060008060008060808789031215610a9357600080fd5b863567ffffffffffffffff80821115610aab57600080fd5b610ab78a838b016109a7565b90985096506020890135915080821115610ad057600080fd5b610adc8a838b016109a7565b90965094506040890135915080821115610af557600080fd5b818901915089601f830112610b0957600080fd5b813581811115610b1b57610b1b610a64565b604051601f8201601f19908116603f01168101908382118183101715610b4357610b43610a64565b816040528281528c6020848701011115610b5c57600080fd5b826020860160208301376000602084830101528096505050505050606087013590509295509295509295565b634e487b7160e01b600052603260045260246000fd5b60208082526022908201527f416363657373206e6f7420616c6c6f7765643a20476f7665726e6f72206f6e6c6040820152613c9760f11b606082015260800190565b600181811c90821680610bf457607f821691505b602082108103610c1457634e487b7160e01b600052602260045260246000fd5b50919050565b83815260406020820152816040820152818360608301376000818301606090810191909152601f909201601f1916010192915050565b600060208284031215610c6257600080fd5b5051919050565b601f821115610cb5576000816000526020600020601f850160051c81016020861015610c925750805b601f850160051c820191505b81811015610cb157828155600101610c9e565b5050505b505050565b815167ffffffffffffffff811115610cd457610cd4610a64565b610ce881610ce28454610be0565b84610c69565b602080601f831160018114610d1d5760008415610d055750858301515b600019600386901b1c1916600185901b178555610cb1565b600085815260208120601f198616915b82811015610d4c57888601518255948401946001909101908401610d2d565b5085821015610d6a5787850151600019600388901b60f8161c191681555b5050505050600190811b01905550565b6060815260006060820152608060208201526000610d9b6080830185610932565b8281036040840152610dad8185610932565b95945050505050565b838152826020820152606060408201526000610dad606083018461093256fea264697066735822122028e3f1561d663e8479b35f936c2645829463b01bf5fedd3e120b732867bda19a64736f6c63430008180033",
+  "solcInputHash": "d547d738900bce1310e91a5d1adfc179",
+  "metadata": "{\"compiler\":{\"version\":\"0.8.30+commit.73712a01\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"inputs\":[{\"internalType\":\"contract IArbitratorV2\",\"name\":\"_arbitrator\",\"type\":\"address\"},{\"internalType\":\"contract IDisputeTemplateRegistry\",\"name\":\"_templateRegistry\",\"type\":\"address\"}],\"stateMutability\":\"nonpayable\",\"type\":\"constructor\"},{\"inputs\":[],\"name\":\"ArbitratorOnly\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"DisputeAlreadyRuled\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"OwnerOnly\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"RulingOutOfBounds\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"ShouldBeAtLeastTwoRulingOptions\",\"type\":\"error\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"contract IArbitratorV2\",\"name\":\"_arbitrator\",\"type\":\"address\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_arbitratorDisputeID\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_externalDisputeID\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_templateId\",\"type\":\"uint256\"}],\"name\":\"DisputeRequest\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"contract IArbitratorV2\",\"name\":\"_arbitrator\",\"type\":\"address\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_ruling\",\"type\":\"uint256\"}],\"name\":\"Ruling\",\"type\":\"event\"},{\"inputs\":[],\"name\":\"arbitrator\",\"outputs\":[{\"internalType\":\"contract IArbitratorV2\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"name\":\"arbitratorDisputeIDToLocalID\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"contract IArbitratorV2\",\"name\":\"_arbitrator\",\"type\":\"address\"}],\"name\":\"changeArbitrator\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_owner\",\"type\":\"address\"}],\"name\":\"changeOwner\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"contract IDisputeTemplateRegistry\",\"name\":\"_templateRegistry\",\"type\":\"address\"}],\"name\":\"changeTemplateRegistry\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes\",\"name\":\"_arbitratorExtraData\",\"type\":\"bytes\"},{\"internalType\":\"string\",\"name\":\"_disputeTemplate\",\"type\":\"string\"},{\"internalType\":\"string\",\"name\":\"_disputeTemplateDataMappings\",\"type\":\"string\"},{\"internalType\":\"uint256\",\"name\":\"_numberOfRulingOptions\",\"type\":\"uint256\"}],\"name\":\"createDisputeForTemplate\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"disputeID\",\"type\":\"uint256\"}],\"stateMutability\":\"payable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"name\":\"disputes\",\"outputs\":[{\"internalType\":\"bytes\",\"name\":\"arbitratorExtraData\",\"type\":\"bytes\"},{\"internalType\":\"bool\",\"name\":\"isRuled\",\"type\":\"bool\"},{\"internalType\":\"uint256\",\"name\":\"ruling\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"numberOfRulingOptions\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"owner\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_arbitratorDisputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_ruling\",\"type\":\"uint256\"}],\"name\":\"rule\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"templateRegistry\",\"outputs\":[{\"internalType\":\"contract IDisputeTemplateRegistry\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"}],\"devdoc\":{\"details\":\"Adapted for V2 from https://github.com/kleros/arbitrable-proxy-contracts/blob/master/contracts/ArbitrableProxy.sol.\",\"events\":{\"DisputeRequest(address,uint256,uint256,uint256)\":{\"params\":{\"_arbitrator\":\"The arbitrator of the contract.\",\"_arbitratorDisputeID\":\"The identifier of the dispute in the Arbitrator contract.\",\"_externalDisputeID\":\"An identifier created outside Kleros by the protocol requesting arbitration.\",\"_templateId\":\"The identifier of the dispute template.\"}},\"Ruling(address,uint256,uint256)\":{\"params\":{\"_arbitrator\":\"The arbitrator giving the ruling.\",\"_disputeID\":\"The identifier of the dispute in the Arbitrator contract.\",\"_ruling\":\"The ruling which was given.\"}}},\"kind\":\"dev\",\"methods\":{\"changeOwner(address)\":{\"params\":{\"_owner\":\"The address of the new owner.\"}},\"constructor\":{\"params\":{\"_arbitrator\":\"Target global arbitrator for any disputes.\"}},\"createDisputeForTemplate(bytes,string,string,uint256)\":{\"details\":\"No need to check that msg.value is enough to pay arbitration fees as it\\u2019s the responsibility of the arbitrator contract.\",\"params\":{\"_arbitratorExtraData\":\"Extra data for the arbitrator of the dispute.\",\"_disputeTemplate\":\"Dispute template.\",\"_disputeTemplateDataMappings\":\"The data mappings.\",\"_numberOfRulingOptions\":\"Number of ruling options.\"},\"returns\":{\"disputeID\":\"Dispute id (on arbitrator side) of the created dispute.\"}},\"rule(uint256,uint256)\":{\"details\":\"This is a callback function for the arbitrator to provide the ruling to this contract. Only the arbitrator must be allowed to call this function. Ruling 0 is reserved for \\\"Not able/wanting to make a decision\\\".\",\"params\":{\"_disputeID\":\"The identifier of the dispute in the Arbitrator contract.\",\"_ruling\":\"Ruling given by the arbitrator.\"}}},\"title\":\"DisputeResolver\",\"version\":1},\"userdoc\":{\"events\":{\"DisputeRequest(address,uint256,uint256,uint256)\":{\"notice\":\"To be emitted when a dispute is created to link the correct template to the disputeID.\"},\"Ruling(address,uint256,uint256)\":{\"notice\":\"To be raised when a ruling is given.\"}},\"kind\":\"user\",\"methods\":{\"changeOwner(address)\":{\"notice\":\"Changes the owner.\"},\"constructor\":{\"notice\":\"Constructor\"},\"createDisputeForTemplate(bytes,string,string,uint256)\":{\"notice\":\"Calls createDispute function of the specified arbitrator to create a dispute.\"},\"rule(uint256,uint256)\":{\"notice\":\"Give a ruling for a dispute.\"}},\"notice\":\"DisputeResolver contract\",\"version\":1}},\"settings\":{\"compilationTarget\":{\"src/arbitration/arbitrables/DisputeResolver.sol\":\"DisputeResolver\"},\"evmVersion\":\"cancun\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\",\"useLiteralContent\":true},\"optimizer\":{\"enabled\":true,\"runs\":1000},\"remappings\":[],\"viaIR\":true},\"sources\":{\"@openzeppelin/contracts/token/ERC20/IERC20.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v5.4.0) (token/ERC20/IERC20.sol)\\n\\npragma solidity >=0.4.16;\\n\\n/**\\n * @dev Interface of the ERC-20 standard as defined in the ERC.\\n */\\ninterface IERC20 {\\n    /**\\n     * @dev Emitted when `value` tokens are moved from one account (`from`) to\\n     * another (`to`).\\n     *\\n     * Note that `value` may be zero.\\n     */\\n    event Transfer(address indexed from, address indexed to, uint256 value);\\n\\n    /**\\n     * @dev Emitted when the allowance of a `spender` for an `owner` is set by\\n     * a call to {approve}. `value` is the new allowance.\\n     */\\n    event Approval(address indexed owner, address indexed spender, uint256 value);\\n\\n    /**\\n     * @dev Returns the value of tokens in existence.\\n     */\\n    function totalSupply() external view returns (uint256);\\n\\n    /**\\n     * @dev Returns the value of tokens owned by `account`.\\n     */\\n    function balanceOf(address account) external view returns (uint256);\\n\\n    /**\\n     * @dev Moves a `value` amount of tokens from the caller's account to `to`.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * Emits a {Transfer} event.\\n     */\\n    function transfer(address to, uint256 value) external returns (bool);\\n\\n    /**\\n     * @dev Returns the remaining number of tokens that `spender` will be\\n     * allowed to spend on behalf of `owner` through {transferFrom}. This is\\n     * zero by default.\\n     *\\n     * This value changes when {approve} or {transferFrom} are called.\\n     */\\n    function allowance(address owner, address spender) external view returns (uint256);\\n\\n    /**\\n     * @dev Sets a `value` amount of tokens as the allowance of `spender` over the\\n     * caller's tokens.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * IMPORTANT: Beware that changing an allowance with this method brings the risk\\n     * that someone may use both the old and the new allowance by unfortunate\\n     * transaction ordering. One possible solution to mitigate this race\\n     * condition is to first reduce the spender's allowance to 0 and set the\\n     * desired value afterwards:\\n     * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729\\n     *\\n     * Emits an {Approval} event.\\n     */\\n    function approve(address spender, uint256 value) external returns (bool);\\n\\n    /**\\n     * @dev Moves a `value` amount of tokens from `from` to `to` using the\\n     * allowance mechanism. `value` is then deducted from the caller's\\n     * allowance.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * Emits a {Transfer} event.\\n     */\\n    function transferFrom(address from, address to, uint256 value) external returns (bool);\\n}\\n\",\"keccak256\":\"0x74ed01eb66b923d0d0cfe3be84604ac04b76482a55f9dd655e1ef4d367f95bc2\",\"license\":\"MIT\"},\"src/arbitration/arbitrables/DisputeResolver.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\nimport {IArbitrableV2, IArbitratorV2} from \\\"../interfaces/IArbitrableV2.sol\\\";\\nimport \\\"../interfaces/IDisputeTemplateRegistry.sol\\\";\\n\\npragma solidity ^0.8.24;\\n\\n/// @title DisputeResolver\\n/// @notice DisputeResolver contract\\n/// @dev Adapted for V2 from https://github.com/kleros/arbitrable-proxy-contracts/blob/master/contracts/ArbitrableProxy.sol.\\ncontract DisputeResolver is IArbitrableV2 {\\n    // ************************************* //\\n    // *         Enums / Structs           * //\\n    // ************************************* //\\n\\n    struct DisputeStruct {\\n        bytes arbitratorExtraData; // Extra data for the dispute.\\n        bool isRuled; // True if the dispute has been ruled.\\n        uint256 ruling; // Ruling given to the dispute.\\n        uint256 numberOfRulingOptions; // The number of choices the arbitrator can give.\\n    }\\n\\n    // ************************************* //\\n    // *             Storage               * //\\n    // ************************************* //\\n\\n    address public owner; // The owner.\\n    IArbitratorV2 public arbitrator; // The arbitrator.\\n    IDisputeTemplateRegistry public templateRegistry; // The dispute template registry.\\n    DisputeStruct[] public disputes; // Local disputes.\\n    mapping(uint256 => uint256) public arbitratorDisputeIDToLocalID; // Maps arbitrator-side dispute IDs to local dispute IDs.\\n\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    /// @notice Constructor\\n    /// @param _arbitrator Target global arbitrator for any disputes.\\n    constructor(IArbitratorV2 _arbitrator, IDisputeTemplateRegistry _templateRegistry) {\\n        owner = msg.sender;\\n        arbitrator = _arbitrator;\\n        templateRegistry = _templateRegistry;\\n    }\\n\\n    // ************************************* //\\n    // *           Governance              * //\\n    // ************************************* //\\n\\n    /// @notice Changes the owner.\\n    /// @param _owner The address of the new owner.\\n    function changeOwner(address _owner) external {\\n        if (owner != msg.sender) revert OwnerOnly();\\n        owner = _owner;\\n    }\\n\\n    function changeArbitrator(IArbitratorV2 _arbitrator) external {\\n        if (owner != msg.sender) revert OwnerOnly();\\n        arbitrator = _arbitrator;\\n    }\\n\\n    function changeTemplateRegistry(IDisputeTemplateRegistry _templateRegistry) external {\\n        if (owner != msg.sender) revert OwnerOnly();\\n        templateRegistry = _templateRegistry;\\n    }\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @notice Calls createDispute function of the specified arbitrator to create a dispute.\\n    /// @dev No need to check that msg.value is enough to pay arbitration fees as it\\u2019s the responsibility of the arbitrator contract.\\n    /// @param _arbitratorExtraData Extra data for the arbitrator of the dispute.\\n    /// @param _disputeTemplate Dispute template.\\n    /// @param _disputeTemplateDataMappings The data mappings.\\n    /// @param _numberOfRulingOptions Number of ruling options.\\n    /// @return disputeID Dispute id (on arbitrator side) of the created dispute.\\n    function createDisputeForTemplate(\\n        bytes calldata _arbitratorExtraData,\\n        string calldata _disputeTemplate,\\n        string memory _disputeTemplateDataMappings,\\n        uint256 _numberOfRulingOptions\\n    ) external payable returns (uint256 disputeID) {\\n        return\\n            _createDispute(\\n                _arbitratorExtraData,\\n                _disputeTemplate,\\n                _disputeTemplateDataMappings,\\n                _numberOfRulingOptions\\n            );\\n    }\\n\\n    /// @inheritdoc IArbitrableV2\\n    function rule(uint256 _arbitratorDisputeID, uint256 _ruling) external override {\\n        uint256 localDisputeID = arbitratorDisputeIDToLocalID[_arbitratorDisputeID];\\n        DisputeStruct storage dispute = disputes[localDisputeID];\\n        if (msg.sender != address(arbitrator)) revert ArbitratorOnly();\\n        if (_ruling > dispute.numberOfRulingOptions) revert RulingOutOfBounds();\\n        if (dispute.isRuled) revert DisputeAlreadyRuled();\\n\\n        dispute.isRuled = true;\\n        dispute.ruling = _ruling;\\n\\n        emit Ruling(IArbitratorV2(msg.sender), _arbitratorDisputeID, dispute.ruling);\\n    }\\n\\n    // ************************************* //\\n    // *            Internal               * //\\n    // ************************************* //\\n\\n    function _createDispute(\\n        bytes calldata _arbitratorExtraData,\\n        string memory _disputeTemplate,\\n        string memory _disputeTemplateDataMappings,\\n        uint256 _numberOfRulingOptions\\n    ) internal virtual returns (uint256 arbitratorDisputeID) {\\n        if (_numberOfRulingOptions <= 1) revert ShouldBeAtLeastTwoRulingOptions();\\n\\n        arbitratorDisputeID = arbitrator.createDispute{value: msg.value}(_numberOfRulingOptions, _arbitratorExtraData);\\n        uint256 localDisputeID = disputes.length;\\n        disputes.push(\\n            DisputeStruct({\\n                arbitratorExtraData: _arbitratorExtraData,\\n                isRuled: false,\\n                ruling: 0,\\n                numberOfRulingOptions: _numberOfRulingOptions\\n            })\\n        );\\n        arbitratorDisputeIDToLocalID[arbitratorDisputeID] = localDisputeID;\\n        uint256 templateId = templateRegistry.setDisputeTemplate(\\\"\\\", _disputeTemplate, _disputeTemplateDataMappings);\\n        emit DisputeRequest(arbitrator, arbitratorDisputeID, localDisputeID, templateId);\\n    }\\n\\n    // ************************************* //\\n    // *              Errors               * //\\n    // ************************************* //\\n\\n    error OwnerOnly();\\n    error ArbitratorOnly();\\n    error RulingOutOfBounds();\\n    error DisputeAlreadyRuled();\\n    error ShouldBeAtLeastTwoRulingOptions();\\n}\\n\",\"keccak256\":\"0xba17fdaa371403c1b9c1e6673e640aa4c70f409b479e5147a8db9755f6154f0f\",\"license\":\"MIT\"},\"src/arbitration/interfaces/IArbitrableV2.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity >=0.8.0 <0.9.0;\\n\\nimport \\\"./IArbitratorV2.sol\\\";\\n\\n/// @title IArbitrableV2\\n/// @notice Arbitrable interface.\\n/// @dev When developing arbitrable contracts, we need to:\\n/// - Define the action taken when a ruling is received by the contract.\\n/// - Allow dispute creation which calls `arbitrator.createDispute{value: _fee}(_choices,_extraData)`.\\ninterface IArbitrableV2 {\\n    // ************************************* //\\n    // *              Events               * //\\n    // ************************************* //\\n\\n    /// @notice To be emitted when a dispute is created to link the correct template to the disputeID.\\n    /// @param _arbitrator The arbitrator of the contract.\\n    /// @param _arbitratorDisputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _externalDisputeID An identifier created outside Kleros by the protocol requesting arbitration.\\n    /// @param _templateId The identifier of the dispute template.\\n    event DisputeRequest(\\n        IArbitratorV2 indexed _arbitrator,\\n        uint256 indexed _arbitratorDisputeID,\\n        uint256 _externalDisputeID,\\n        uint256 _templateId\\n    );\\n\\n    /// @notice To be raised when a ruling is given.\\n    /// @param _arbitrator The arbitrator giving the ruling.\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _ruling The ruling which was given.\\n    event Ruling(IArbitratorV2 indexed _arbitrator, uint256 indexed _disputeID, uint256 _ruling);\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @notice Give a ruling for a dispute.\\n    ///\\n    /// @dev This is a callback function for the arbitrator to provide the ruling to this contract.\\n    /// Only the arbitrator must be allowed to call this function.\\n    /// Ruling 0 is reserved for \\\"Not able/wanting to make a decision\\\".\\n    ///\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _ruling Ruling given by the arbitrator.\\n    function rule(uint256 _disputeID, uint256 _ruling) external;\\n}\\n\",\"keccak256\":\"0x3afa29a93847399c8705103350b69bb70706b2075ca41b39d523b007e69e23db\",\"license\":\"MIT\"},\"src/arbitration/interfaces/IArbitratorV2.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity >=0.8.0 <0.9.0;\\n\\nimport \\\"@openzeppelin/contracts/token/ERC20/IERC20.sol\\\";\\nimport \\\"./IArbitrableV2.sol\\\";\\n\\n/// @title Arbitrator\\n/// @notice Arbitrator interface for the Kleros V2 protocol.\\n/// @dev Unlike the ERC-792 this standard is not concerned with appeals, so each arbitrator can implement an appeal system that suits it the most.\\ninterface IArbitratorV2 {\\n    // ************************************* //\\n    // *              Events               * //\\n    // ************************************* //\\n\\n    /// @notice To be emitted when a dispute is created.\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _arbitrable The contract which created the dispute.\\n    event DisputeCreation(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);\\n\\n    /// @notice To be raised when a ruling is given.\\n    /// @param _arbitrable The arbitrable receiving the ruling.\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _ruling The ruling which was given.\\n    event Ruling(IArbitrableV2 indexed _arbitrable, uint256 indexed _disputeID, uint256 _ruling);\\n\\n    /// @notice To be emitted when an ERC20 token is added or removed as a method to pay fees.\\n    /// @param _token The ERC20 token.\\n    /// @param _accepted Whether the token is accepted or not.\\n    event AcceptedFeeToken(IERC20 indexed _token, bool indexed _accepted);\\n\\n    /// @notice To be emitted when the fee for a particular ERC20 token is updated.\\n    /// @param _feeToken The ERC20 token.\\n    /// @param _rateInEth The new rate of the fee token in ETH.\\n    /// @param _rateDecimals The new decimals of the fee token rate.\\n    event NewCurrencyRate(IERC20 indexed _feeToken, uint64 _rateInEth, uint8 _rateDecimals);\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @notice Create a dispute and pay for the fees in the native currency, typically ETH.\\n    /// @dev Must be called by the arbitrable contract and pay at least `arbitrationCost(_extraData)` in ETH.\\n    /// @param _numberOfChoices The number of choices the arbitrator can choose from in this dispute.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @return disputeID The identifier of the dispute created.\\n    function createDispute(\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData\\n    ) external payable returns (uint256 disputeID);\\n\\n    /// @notice Create a dispute and pay for the fees in a supported ERC20 token.\\n    /// @dev Must be called by the arbitrable contract and pay at least `arbitrationCost(_extraData)` in the supported ERC20 token.\\n    /// @param _numberOfChoices The number of choices the arbitrator can choose from in this dispute.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @param _feeToken The ERC20 token used to pay fees.\\n    /// @param _feeAmount Amount of the ERC20 token used to pay fees.\\n    /// @return disputeID The identifier of the dispute created.\\n    function createDispute(\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData,\\n        IERC20 _feeToken,\\n        uint256 _feeAmount\\n    ) external returns (uint256 disputeID);\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /// @notice Compute the cost of arbitration denominated in the native currency, typically ETH.\\n    /// @dev It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @return cost The arbitration cost in ETH.\\n    function arbitrationCost(bytes calldata _extraData) external view returns (uint256 cost);\\n\\n    /// @notice Compute the cost of arbitration denominated in `_feeToken`.\\n    /// @dev It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @param _feeToken The ERC20 token used to pay fees.\\n    /// @return cost The arbitration cost in `_feeToken`.\\n    function arbitrationCost(bytes calldata _extraData, IERC20 _feeToken) external view returns (uint256 cost);\\n\\n    /// @notice Gets the current ruling of a specified dispute.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return ruling The current ruling.\\n    /// @return tied Whether it's a tie or not.\\n    /// @return overridden Whether the ruling was overridden by appeal funding or not.\\n    function currentRuling(uint256 _disputeID) external view returns (uint256 ruling, bool tied, bool overridden);\\n}\\n\",\"keccak256\":\"0x65ba87c5309cd6e6562e569f79778ca423c9be7b0a44b9407e5bd2bdf8fdc3b0\",\"license\":\"MIT\"},\"src/arbitration/interfaces/IDisputeTemplateRegistry.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity >=0.8.0 <0.9.0;\\n\\n/// @title IDisputeTemplate\\n/// @notice Dispute Template interface.\\ninterface IDisputeTemplateRegistry {\\n    // ************************************* //\\n    // *              Events               * //\\n    // ************************************* //\\n\\n    /// @notice To be emitted when a new dispute template is created.\\n    /// @param _templateId The identifier of the dispute template.\\n    /// @param _templateTag An optional tag for the dispute template, such as \\\"registration\\\" or \\\"removal\\\".\\n    /// @param _templateData The template data.\\n    /// @param _templateDataMappings The data mappings.\\n    event DisputeTemplate(\\n        uint256 indexed _templateId,\\n        string indexed _templateTag,\\n        string _templateData,\\n        string _templateDataMappings\\n    );\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @notice Registers a new dispute template.\\n    /// @param _templateTag An optional tag for the dispute template, such as \\\"registration\\\" or \\\"removal\\\".\\n    /// @param _templateData The template data.\\n    /// @param _templateDataMappings The data mappings for the template.\\n    /// @return templateId The identifier of the dispute template.\\n    function setDisputeTemplate(\\n        string memory _templateTag,\\n        string memory _templateData,\\n        string memory _templateDataMappings\\n    ) external returns (uint256 templateId);\\n}\\n\",\"keccak256\":\"0x07ea0d9c5aea94cb73ca90f9a9f7689dcca2b37e7ec49bc6e02ee660ce2cee4f\",\"license\":\"MIT\"}},\"version\":1}",
+  "bytecode": "0x60803460a157601f610ac438819003918201601f19168301916001600160401b0383118484101760a557808492604094855283398101031260a15780516001600160a01b038116919082900360a157602001516001600160a01b038116919082900360a1575f80546001600160a01b031990811633179091556001805482169290921790915560028054909116919091179055604051610a0a90816100ba8239f35b5f80fd5b634e487b7160e01b5f52604160045260245ffdfe60806040526004361015610011575f80fd5b5f3560e01c8063311a6c56146107a25780634660ebbe1461074a578063564a565d1461064f5780636cc6cde1146106295780638da5cb5b14610604578063a0af81f0146105de578063a6f9dae11461058b578063dc65351114610135578063e09997d91461010b5763fc548f0814610087575f80fd5b34610107576020366003190112610107576004356001600160a01b038116809103610107576001600160a01b035f541633036100df5773ffffffffffffffffffffffffffffffffffffffff1960015416176001555f80f35b7f596dcdb8000000000000000000000000000000000000000000000000000000005f5260045ffd5b5f80fd5b34610107576020366003190112610107576004355f526004602052602060405f2054604051908152f35b60803660031901126101075760043567ffffffffffffffff811161010757610161903690600401610960565b9060243567ffffffffffffffff811161010757610182903690600401610960565b9160443567ffffffffffffffff81116101075736602382011215610107576101b76101c391369060248160040135910161098e565b9260643594369161098e565b906001841115610563576001600160a01b036001541693602060405180967fc13517e100000000000000000000000000000000000000000000000000000000825283600483015260406024830152886044830152888560648401375f60648a8401015281606481601f19601f8d0116810103019134905af194851561043e575f9561052f575b506003549560405192608084019184831067ffffffffffffffff8411176105085761027892604052369161098e565b8252602082015f815260408301905f8252606084019283526801000000000000000088101561050857600188016003556102b1886108b2565b94909461051c575180519067ffffffffffffffff8211610508576102d586546108e2565b601f81116104c3575b50602090601f831160011461045457928260209896936103b19a9896936003965f92610449575b50508160011b915f1990871b1c19161785555b600185019051151560ff8019835416911617905551600284015551910155845f52600483528560405f205561039f5f6001600160a01b036002541692604051968795869485937f4a9941740000000000000000000000000000000000000000000000000000000085526060600486015285606486015260806024860152608485019061093c565b8381036003190160448501529061093c565b03925af190811561043e575f9161040b575b5081907fa8a9266995639bff048ad93524a5a561269d3f742d2ee429089990d4d1bb09d460406020956001600160a01b036001541693825191825287820152a3604051908152f35b90506020813d602011610436575b816104266020938361091a565b81010312610107575160206103c3565b3d9150610419565b6040513d5f823e3d90fd5b015190508d80610305565b90601f19831691875f52815f20925f5b8181106104ab5750936103b19a989693600396936001938360209d9b9810610494575b505050811b018555610318565b01515f1983891b60f8161c191690558d8080610487565b92936020600181928786015181550195019301610464565b865f5260205f20601f840160051c810191602085106104fe575b601f0160051c01905b8181106104f357506102de565b5f81556001016104e6565b90915081906104dd565b634e487b7160e01b5f52604160045260245ffd5b634e487b7160e01b5f525f60045260245ffd5b9094506020813d60201161055b575b8161054b6020938361091a565b8101031261010757519386610249565b3d915061053e565b7f5fea5b86000000000000000000000000000000000000000000000000000000005f5260045ffd5b34610107576020366003190112610107576004356001600160a01b038116809103610107575f54336001600160a01b038216036100df5773ffffffffffffffffffffffffffffffffffffffff1916175f55005b34610107575f3660031901126101075760206001600160a01b0360025416604051908152f35b34610107575f3660031901126101075760206001600160a01b035f5416604051908152f35b34610107575f3660031901126101075760206001600160a01b0360015416604051908152f35b346101075760203660031901126101075760043560035481101561010757610676906108b2565b506040515f918054610687816108e2565b808452906001811690811561072657506001146106ed575b506106af826106d794038361091a565b60ff60018201541690600360028201549101549060405194859460808652608086019061093c565b9215156020850152604084015260608301520390f35b9250805f5260205f205f905b8482106107105750820160200192506106af61069f565b60018160209254838588010152019101906106f9565b60ff191660208086019190915291151560051b840190910193506106af905061069f565b34610107576020366003190112610107576004356001600160a01b038116809103610107576001600160a01b035f541633036100df5773ffffffffffffffffffffffffffffffffffffffff1960025416176002555f80f35b3461010757604036600319011261010757600435602435815f5260046020526107ce60405f20546108b2565b506001600160a01b0360015416330361088a576003810154821161086257600181019081549060ff821661083a578392600160029360ff191617905501556040519081527f394027a5fa6e098a1191094d1719d6929b9abc535fcc0c8f448d6a4e7562227660203392a3005b7fcbb4c9f3000000000000000000000000000000000000000000000000000000005f5260045ffd5b7f1f6edbfd000000000000000000000000000000000000000000000000000000005f5260045ffd5b7f4aafc238000000000000000000000000000000000000000000000000000000005f5260045ffd5b6003548110156108ce5760035f5260205f209060021b01905f90565b634e487b7160e01b5f52603260045260245ffd5b90600182811c92168015610910575b60208310146108fc57565b634e487b7160e01b5f52602260045260245ffd5b91607f16916108f1565b90601f8019910116810190811067ffffffffffffffff82111761050857604052565b805180835260209291819084018484015e5f828201840152601f01601f1916010190565b9181601f840112156101075782359167ffffffffffffffff8311610107576020838186019501011161010757565b92919267ffffffffffffffff821161050857604051916109b8601f8201601f19166020018461091a565b829481845281830111610107578281602093845f96013701015256fea2646970667358221220e532d202945144342a4a2c1b0b99b885b88a09bbedafe262a405f2c73673c2c464736f6c634300081e0033",
+  "deployedBytecode": "0x60806040526004361015610011575f80fd5b5f3560e01c8063311a6c56146107a25780634660ebbe1461074a578063564a565d1461064f5780636cc6cde1146106295780638da5cb5b14610604578063a0af81f0146105de578063a6f9dae11461058b578063dc65351114610135578063e09997d91461010b5763fc548f0814610087575f80fd5b34610107576020366003190112610107576004356001600160a01b038116809103610107576001600160a01b035f541633036100df5773ffffffffffffffffffffffffffffffffffffffff1960015416176001555f80f35b7f596dcdb8000000000000000000000000000000000000000000000000000000005f5260045ffd5b5f80fd5b34610107576020366003190112610107576004355f526004602052602060405f2054604051908152f35b60803660031901126101075760043567ffffffffffffffff811161010757610161903690600401610960565b9060243567ffffffffffffffff811161010757610182903690600401610960565b9160443567ffffffffffffffff81116101075736602382011215610107576101b76101c391369060248160040135910161098e565b9260643594369161098e565b906001841115610563576001600160a01b036001541693602060405180967fc13517e100000000000000000000000000000000000000000000000000000000825283600483015260406024830152886044830152888560648401375f60648a8401015281606481601f19601f8d0116810103019134905af194851561043e575f9561052f575b506003549560405192608084019184831067ffffffffffffffff8411176105085761027892604052369161098e565b8252602082015f815260408301905f8252606084019283526801000000000000000088101561050857600188016003556102b1886108b2565b94909461051c575180519067ffffffffffffffff8211610508576102d586546108e2565b601f81116104c3575b50602090601f831160011461045457928260209896936103b19a9896936003965f92610449575b50508160011b915f1990871b1c19161785555b600185019051151560ff8019835416911617905551600284015551910155845f52600483528560405f205561039f5f6001600160a01b036002541692604051968795869485937f4a9941740000000000000000000000000000000000000000000000000000000085526060600486015285606486015260806024860152608485019061093c565b8381036003190160448501529061093c565b03925af190811561043e575f9161040b575b5081907fa8a9266995639bff048ad93524a5a561269d3f742d2ee429089990d4d1bb09d460406020956001600160a01b036001541693825191825287820152a3604051908152f35b90506020813d602011610436575b816104266020938361091a565b81010312610107575160206103c3565b3d9150610419565b6040513d5f823e3d90fd5b015190508d80610305565b90601f19831691875f52815f20925f5b8181106104ab5750936103b19a989693600396936001938360209d9b9810610494575b505050811b018555610318565b01515f1983891b60f8161c191690558d8080610487565b92936020600181928786015181550195019301610464565b865f5260205f20601f840160051c810191602085106104fe575b601f0160051c01905b8181106104f357506102de565b5f81556001016104e6565b90915081906104dd565b634e487b7160e01b5f52604160045260245ffd5b634e487b7160e01b5f525f60045260245ffd5b9094506020813d60201161055b575b8161054b6020938361091a565b8101031261010757519386610249565b3d915061053e565b7f5fea5b86000000000000000000000000000000000000000000000000000000005f5260045ffd5b34610107576020366003190112610107576004356001600160a01b038116809103610107575f54336001600160a01b038216036100df5773ffffffffffffffffffffffffffffffffffffffff1916175f55005b34610107575f3660031901126101075760206001600160a01b0360025416604051908152f35b34610107575f3660031901126101075760206001600160a01b035f5416604051908152f35b34610107575f3660031901126101075760206001600160a01b0360015416604051908152f35b346101075760203660031901126101075760043560035481101561010757610676906108b2565b506040515f918054610687816108e2565b808452906001811690811561072657506001146106ed575b506106af826106d794038361091a565b60ff60018201541690600360028201549101549060405194859460808652608086019061093c565b9215156020850152604084015260608301520390f35b9250805f5260205f205f905b8482106107105750820160200192506106af61069f565b60018160209254838588010152019101906106f9565b60ff191660208086019190915291151560051b840190910193506106af905061069f565b34610107576020366003190112610107576004356001600160a01b038116809103610107576001600160a01b035f541633036100df5773ffffffffffffffffffffffffffffffffffffffff1960025416176002555f80f35b3461010757604036600319011261010757600435602435815f5260046020526107ce60405f20546108b2565b506001600160a01b0360015416330361088a576003810154821161086257600181019081549060ff821661083a578392600160029360ff191617905501556040519081527f394027a5fa6e098a1191094d1719d6929b9abc535fcc0c8f448d6a4e7562227660203392a3005b7fcbb4c9f3000000000000000000000000000000000000000000000000000000005f5260045ffd5b7f1f6edbfd000000000000000000000000000000000000000000000000000000005f5260045ffd5b7f4aafc238000000000000000000000000000000000000000000000000000000005f5260045ffd5b6003548110156108ce5760035f5260205f209060021b01905f90565b634e487b7160e01b5f52603260045260245ffd5b90600182811c92168015610910575b60208310146108fc57565b634e487b7160e01b5f52602260045260245ffd5b91607f16916108f1565b90601f8019910116810190811067ffffffffffffffff82111761050857604052565b805180835260209291819084018484015e5f828201840152601f01601f1916010190565b9181601f840112156101075782359167ffffffffffffffff8311610107576020838186019501011161010757565b92919267ffffffffffffffff821161050857604051916109b8601f8201601f19166020018461091a565b829481845281830111610107578281602093845f96013701015256fea2646970667358221220e532d202945144342a4a2c1b0b99b885b88a09bbedafe262a405f2c73673c2c464736f6c634300081e0033",
   "devdoc": {
+    "details": "Adapted for V2 from https://github.com/kleros/arbitrable-proxy-contracts/blob/master/contracts/ArbitrableProxy.sol.",
     "events": {
-      "DisputeRequest(address,uint256,uint256,uint256,string)": {
-        "details": "To be emitted when a dispute is created to link the correct meta-evidence to the disputeID.",
+      "DisputeRequest(address,uint256,uint256,uint256)": {
         "params": {
           "_arbitrator": "The arbitrator of the contract.",
           "_arbitratorDisputeID": "The identifier of the dispute in the Arbitrator contract.",
           "_externalDisputeID": "An identifier created outside Kleros by the protocol requesting arbitration.",
-          "_templateId": "The identifier of the dispute template. Should not be used with _templateUri.",
-          "_templateUri": "The URI to the dispute template. For example on IPFS: starting with '/ipfs/'. Should not be used with _templateId."
+          "_templateId": "The identifier of the dispute template."
         }
       },
       "Ruling(address,uint256,uint256)": {
-        "details": "To be raised when a ruling is given.",
         "params": {
           "_arbitrator": "The arbitrator giving the ruling.",
           "_disputeID": "The identifier of the dispute in the Arbitrator contract.",
@@ -340,20 +328,18 @@
     },
     "kind": "dev",
     "methods": {
-      "changeGovernor(address)": {
-        "details": "Changes the governor.",
+      "changeOwner(address)": {
         "params": {
-          "_governor": "The address of the new governor."
+          "_owner": "The address of the new owner."
         }
       },
       "constructor": {
-        "details": "Constructor",
         "params": {
           "_arbitrator": "Target global arbitrator for any disputes."
         }
       },
       "createDisputeForTemplate(bytes,string,string,uint256)": {
-        "details": "Calls createDispute function of the specified arbitrator to create a dispute. Note that we don’t need to check that msg.value is enough to pay arbitration fees as it’s the responsibility of the arbitrator contract.",
+        "details": "No need to check that msg.value is enough to pay arbitration fees as it’s the responsibility of the arbitrator contract.",
         "params": {
           "_arbitratorExtraData": "Extra data for the arbitrator of the dispute.",
           "_disputeTemplate": "Dispute template.",
@@ -364,69 +350,80 @@
           "disputeID": "Dispute id (on arbitrator side) of the created dispute."
         }
       },
-      "createDisputeForTemplateUri(bytes,string,uint256)": {
-        "details": "Calls createDispute function of the specified arbitrator to create a dispute. Note that we don’t need to check that msg.value is enough to pay arbitration fees as it’s the responsibility of the arbitrator contract.",
-        "params": {
-          "_arbitratorExtraData": "Extra data for the arbitrator of the dispute.",
-          "_disputeTemplateUri": "The URI to the dispute template. For example on IPFS: starting with '/ipfs/'.",
-          "_numberOfRulingOptions": "Number of ruling options."
-        },
-        "returns": {
-          "disputeID": "Dispute id (on arbitrator side) of the created dispute."
-        }
-      },
       "rule(uint256,uint256)": {
-        "details": "To be called by the arbitrator of the dispute, to declare the winning ruling.",
+        "details": "This is a callback function for the arbitrator to provide the ruling to this contract. Only the arbitrator must be allowed to call this function. Ruling 0 is reserved for \"Not able/wanting to make a decision\".",
         "params": {
-          "_arbitratorDisputeID": "ID of the dispute in arbitrator contract.",
-          "_ruling": "The ruling choice of the arbitration."
+          "_disputeID": "The identifier of the dispute in the Arbitrator contract.",
+          "_ruling": "Ruling given by the arbitrator."
         }
       }
     },
-    "title": "DisputeResolver DisputeResolver contract adapted for V2 from https://github.com/kleros/arbitrable-proxy-contracts/blob/master/contracts/ArbitrableProxy.sol.",
+    "title": "DisputeResolver",
     "version": 1
   },
   "userdoc": {
+    "events": {
+      "DisputeRequest(address,uint256,uint256,uint256)": {
+        "notice": "To be emitted when a dispute is created to link the correct template to the disputeID."
+      },
+      "Ruling(address,uint256,uint256)": {
+        "notice": "To be raised when a ruling is given."
+      }
+    },
     "kind": "user",
-    "methods": {},
+    "methods": {
+      "changeOwner(address)": {
+        "notice": "Changes the owner."
+      },
+      "constructor": {
+        "notice": "Constructor"
+      },
+      "createDisputeForTemplate(bytes,string,string,uint256)": {
+        "notice": "Calls createDispute function of the specified arbitrator to create a dispute."
+      },
+      "rule(uint256,uint256)": {
+        "notice": "Give a ruling for a dispute."
+      }
+    },
+    "notice": "DisputeResolver contract",
     "version": 1
   },
   "storageLayout": {
     "storage": [
       {
-        "astId": 14991,
+        "astId": 18721,
         "contract": "src/arbitration/arbitrables/DisputeResolver.sol:DisputeResolver",
-        "label": "governor",
+        "label": "owner",
         "offset": 0,
         "slot": "0",
         "type": "t_address"
       },
       {
-        "astId": 14994,
+        "astId": 18724,
         "contract": "src/arbitration/arbitrables/DisputeResolver.sol:DisputeResolver",
         "label": "arbitrator",
         "offset": 0,
         "slot": "1",
-        "type": "t_contract(IArbitratorV2)23044"
+        "type": "t_contract(IArbitratorV2)26051"
       },
       {
-        "astId": 14997,
+        "astId": 18727,
         "contract": "src/arbitration/arbitrables/DisputeResolver.sol:DisputeResolver",
         "label": "templateRegistry",
         "offset": 0,
         "slot": "2",
-        "type": "t_contract(IDisputeTemplateRegistry)23215"
+        "type": "t_contract(IDisputeTemplateRegistry)26278"
       },
       {
-        "astId": 15001,
+        "astId": 18731,
         "contract": "src/arbitration/arbitrables/DisputeResolver.sol:DisputeResolver",
         "label": "disputes",
         "offset": 0,
         "slot": "3",
-        "type": "t_array(t_struct(DisputeStruct)14989_storage)dyn_storage"
+        "type": "t_array(t_struct(DisputeStruct)18719_storage)dyn_storage"
       },
       {
-        "astId": 15005,
+        "astId": 18735,
         "contract": "src/arbitration/arbitrables/DisputeResolver.sol:DisputeResolver",
         "label": "arbitratorDisputeIDToLocalID",
         "offset": 0,
@@ -440,8 +437,8 @@
         "label": "address",
         "numberOfBytes": "20"
       },
-      "t_array(t_struct(DisputeStruct)14989_storage)dyn_storage": {
-        "base": "t_struct(DisputeStruct)14989_storage",
+      "t_array(t_struct(DisputeStruct)18719_storage)dyn_storage": {
+        "base": "t_struct(DisputeStruct)18719_storage",
         "encoding": "dynamic_array",
         "label": "struct DisputeResolver.DisputeStruct[]",
         "numberOfBytes": "32"
@@ -456,12 +453,12 @@
         "label": "bytes",
         "numberOfBytes": "32"
       },
-      "t_contract(IArbitratorV2)23044": {
+      "t_contract(IArbitratorV2)26051": {
         "encoding": "inplace",
         "label": "contract IArbitratorV2",
         "numberOfBytes": "20"
       },
-      "t_contract(IDisputeTemplateRegistry)23215": {
+      "t_contract(IDisputeTemplateRegistry)26278": {
         "encoding": "inplace",
         "label": "contract IDisputeTemplateRegistry",
         "numberOfBytes": "20"
@@ -473,12 +470,12 @@
         "numberOfBytes": "32",
         "value": "t_uint256"
       },
-      "t_struct(DisputeStruct)14989_storage": {
+      "t_struct(DisputeStruct)18719_storage": {
         "encoding": "inplace",
         "label": "struct DisputeResolver.DisputeStruct",
         "members": [
           {
-            "astId": 14982,
+            "astId": 18712,
             "contract": "src/arbitration/arbitrables/DisputeResolver.sol:DisputeResolver",
             "label": "arbitratorExtraData",
             "offset": 0,
@@ -486,7 +483,7 @@
             "type": "t_bytes_storage"
           },
           {
-            "astId": 14984,
+            "astId": 18714,
             "contract": "src/arbitration/arbitrables/DisputeResolver.sol:DisputeResolver",
             "label": "isRuled",
             "offset": 0,
@@ -494,7 +491,7 @@
             "type": "t_bool"
           },
           {
-            "astId": 14986,
+            "astId": 18716,
             "contract": "src/arbitration/arbitrables/DisputeResolver.sol:DisputeResolver",
             "label": "ruling",
             "offset": 0,
@@ -502,7 +499,7 @@
             "type": "t_uint256"
           },
           {
-            "astId": 14988,
+            "astId": 18718,
             "contract": "src/arbitration/arbitrables/DisputeResolver.sol:DisputeResolver",
             "label": "numberOfRulingOptions",
             "offset": 0,
diff --git a/contracts/deployments/arbitrumSepoliaDevnet/DisputeTemplateRegistryUniversity.json b/contracts/deployments/arbitrumSepoliaDevnet/DisputeTemplateRegistryUniversity.json
new file mode 100644
index 000000000..0586cb4bf
--- /dev/null
+++ b/contracts/deployments/arbitrumSepoliaDevnet/DisputeTemplateRegistryUniversity.json
@@ -0,0 +1,317 @@
+{
+  "address": "0x75A5D16e9A699162506E4d79D68CF646e6600ba1",
+  "abi": [
+    {
+      "stateMutability": "payable",
+      "type": "fallback"
+    },
+    {
+      "stateMutability": "payable",
+      "type": "receive"
+    },
+    {
+      "inputs": [],
+      "name": "AlreadyInitialized",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "FailedDelegateCall",
+      "type": "error"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "address",
+          "name": "implementation",
+          "type": "address"
+        }
+      ],
+      "name": "InvalidImplementation",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "NotInitializing",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "OwnerOnly",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "UUPSUnauthorizedCallContext",
+      "type": "error"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "bytes32",
+          "name": "slot",
+          "type": "bytes32"
+        }
+      ],
+      "name": "UUPSUnsupportedProxiableUUID",
+      "type": "error"
+    },
+    {
+      "anonymous": false,
+      "inputs": [
+        {
+          "indexed": true,
+          "internalType": "uint256",
+          "name": "_templateId",
+          "type": "uint256"
+        },
+        {
+          "indexed": true,
+          "internalType": "string",
+          "name": "_templateTag",
+          "type": "string"
+        },
+        {
+          "indexed": false,
+          "internalType": "string",
+          "name": "_templateData",
+          "type": "string"
+        },
+        {
+          "indexed": false,
+          "internalType": "string",
+          "name": "_templateDataMappings",
+          "type": "string"
+        }
+      ],
+      "name": "DisputeTemplate",
+      "type": "event"
+    },
+    {
+      "anonymous": false,
+      "inputs": [
+        {
+          "indexed": false,
+          "internalType": "uint64",
+          "name": "version",
+          "type": "uint64"
+        }
+      ],
+      "name": "Initialized",
+      "type": "event"
+    },
+    {
+      "anonymous": false,
+      "inputs": [
+        {
+          "indexed": true,
+          "internalType": "address",
+          "name": "newImplementation",
+          "type": "address"
+        }
+      ],
+      "name": "Upgraded",
+      "type": "event"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "address",
+          "name": "_owner",
+          "type": "address"
+        }
+      ],
+      "name": "changeOwner",
+      "outputs": [],
+      "stateMutability": "nonpayable",
+      "type": "function"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "address",
+          "name": "_owner",
+          "type": "address"
+        }
+      ],
+      "name": "initialize",
+      "outputs": [],
+      "stateMutability": "nonpayable",
+      "type": "function"
+    },
+    {
+      "inputs": [],
+      "name": "owner",
+      "outputs": [
+        {
+          "internalType": "address",
+          "name": "",
+          "type": "address"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
+    {
+      "inputs": [],
+      "name": "proxiableUUID",
+      "outputs": [
+        {
+          "internalType": "bytes32",
+          "name": "",
+          "type": "bytes32"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "string",
+          "name": "_templateTag",
+          "type": "string"
+        },
+        {
+          "internalType": "string",
+          "name": "_templateData",
+          "type": "string"
+        },
+        {
+          "internalType": "string",
+          "name": "_templateDataMappings",
+          "type": "string"
+        }
+      ],
+      "name": "setDisputeTemplate",
+      "outputs": [
+        {
+          "internalType": "uint256",
+          "name": "templateId",
+          "type": "uint256"
+        }
+      ],
+      "stateMutability": "nonpayable",
+      "type": "function"
+    },
+    {
+      "inputs": [],
+      "name": "templates",
+      "outputs": [
+        {
+          "internalType": "uint256",
+          "name": "",
+          "type": "uint256"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "address",
+          "name": "newImplementation",
+          "type": "address"
+        },
+        {
+          "internalType": "bytes",
+          "name": "data",
+          "type": "bytes"
+        }
+      ],
+      "name": "upgradeToAndCall",
+      "outputs": [],
+      "stateMutability": "payable",
+      "type": "function"
+    },
+    {
+      "inputs": [],
+      "name": "version",
+      "outputs": [
+        {
+          "internalType": "string",
+          "name": "",
+          "type": "string"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "address",
+          "name": "_implementation",
+          "type": "address"
+        },
+        {
+          "internalType": "bytes",
+          "name": "_data",
+          "type": "bytes"
+        }
+      ],
+      "stateMutability": "nonpayable",
+      "type": "constructor"
+    }
+  ],
+  "transactionHash": "0xbc50b201f6d4dfa0a74e83aeb201df1f0390ab361ba76bf72a696a36d3a5ffe4",
+  "receipt": {
+    "to": null,
+    "from": "0xf1C7c037891525E360C59f708739Ac09A7670c59",
+    "contractAddress": "0x75A5D16e9A699162506E4d79D68CF646e6600ba1",
+    "transactionIndex": 1,
+    "gasUsed": "157979",
+    "logsBloom": "0x00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000080000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002000000000000000000000800000000000000000000000080000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004000000000000000000000004000000000000000000000000000000000000000000000000000000000000",
+    "blockHash": "0x9656d572eb28bbdc716c7b34860d4e05442e4a488ce69c9f410f69a3d125df0c",
+    "transactionHash": "0xbc50b201f6d4dfa0a74e83aeb201df1f0390ab361ba76bf72a696a36d3a5ffe4",
+    "logs": [
+      {
+        "transactionIndex": 1,
+        "blockNumber": 193661064,
+        "transactionHash": "0xbc50b201f6d4dfa0a74e83aeb201df1f0390ab361ba76bf72a696a36d3a5ffe4",
+        "address": "0x75A5D16e9A699162506E4d79D68CF646e6600ba1",
+        "topics": [
+          "0xc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d2"
+        ],
+        "data": "0x0000000000000000000000000000000000000000000000000000000000000001",
+        "logIndex": 0,
+        "blockHash": "0x9656d572eb28bbdc716c7b34860d4e05442e4a488ce69c9f410f69a3d125df0c"
+      }
+    ],
+    "blockNumber": 193661064,
+    "cumulativeGasUsed": "157979",
+    "status": 1,
+    "byzantium": true
+  },
+  "args": [
+    "0xC3f638389635bF33E019c845FdaF2ed9bca3DF67",
+    "0xc4d66de8000000000000000000000000f1c7c037891525e360c59f708739ac09a7670c59"
+  ],
+  "numDeployments": 1,
+  "solcInputHash": "cff4f5de661c6299ed3bdc0f8613457a",
+  "metadata": "{\"compiler\":{\"version\":\"0.8.30+commit.73712a01\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_implementation\",\"type\":\"address\"},{\"internalType\":\"bytes\",\"name\":\"_data\",\"type\":\"bytes\"}],\"stateMutability\":\"nonpayable\",\"type\":\"constructor\"},{\"stateMutability\":\"payable\",\"type\":\"fallback\"},{\"stateMutability\":\"payable\",\"type\":\"receive\"}],\"devdoc\":{\"kind\":\"dev\",\"methods\":{},\"version\":1},\"userdoc\":{\"kind\":\"user\",\"methods\":{},\"version\":1}},\"settings\":{\"compilationTarget\":{\"src/proxy/KlerosProxies.sol\":\"DisputeTemplateRegistryUniversityProxy\"},\"evmVersion\":\"cancun\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\",\"useLiteralContent\":true},\"optimizer\":{\"enabled\":true,\"runs\":1000},\"remappings\":[],\"viaIR\":true},\"sources\":{\"src/proxy/KlerosProxies.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\nimport \\\"./UUPSProxy.sol\\\";\\n\\n/// Workaround to get meaningful names for the proxy contracts\\n/// Otherwise all the contracts are called `UUPSProxy` on the chain explorers\\n\\ncontract DisputeKitClassicUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitClassicProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitGatedProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitGatedShutterProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitShutterProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitSybilResistantProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeTemplateRegistryUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeTemplateRegistryProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract EvidenceModuleProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract ForeignGatewayOnEthereumProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract HomeGatewayToEthereumProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreRulerProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract PolicyRegistryProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract RandomizerRNGProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\",\"keccak256\":\"0x9dbd26ac5a026a32fc38e394188ab4a8dce0d7e8f249fa1412f757611f948767\",\"license\":\"MIT\"},\"src/proxy/UUPSProxy.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\n/// @title UUPS Proxy\\n/// @author Simon Malatrait <simon.malatrait@grenoble-inp.org>\\n/// @notice This contract implements a UUPS Proxy compliant with ERC-1967 & ERC-1822.\\n///\\n/// @dev This contract delegates all calls to another contract (UUPS Proxiable) through a fallback function and the use of the `delegatecall` EVM instruction.\\n/// We refer to the Proxiable contract (as per ERC-1822) with `implementation`.\\n/// Adapted from <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/ERC1967/ERC1967Proxy.sol>\\ncontract UUPSProxy {\\n    /// @dev Storage slot with the address of the current implementation.\\n    /// This is the keccak-256 hash of \\\"eip1967.proxy.implementation\\\" subtracted by 1, and is\\n    /// validated in the constructor.\\n    /// NOTE: bytes32(uint256(keccak256('eip1967.proxy.implementation')) - 1)\\n    bytes32 private constant IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;\\n\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    /// @notice Initializes the upgradeable proxy with an initial implementation specified by `_implementation`.\\n    /// @dev If `_data` is nonempty, it's used as data in a delegate call to `_implementation`.\\n    /// This will typically be an encoded function call, and allows initializing the storage of the proxy like a Solidity constructor.\\n    constructor(address _implementation, bytes memory _data) {\\n        assembly {\\n            sstore(IMPLEMENTATION_SLOT, _implementation)\\n        }\\n\\n        if (_data.length != 0) {\\n            (bool success, ) = _implementation.delegatecall(_data);\\n            require(success, \\\"Proxy Constructor failed\\\");\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @dev Delegates the current call to `implementation`.\\n    /// NOTE: This function does not return to its internal call site, it will return directly to the external caller.\\n    function _delegate(address implementation) internal {\\n        assembly {\\n            // Copy msg.data. We take full control of memory in this inline assembly\\n            // block because it will not return to Solidity code. We overwrite the\\n            // Solidity scratch pad at memory position 0.\\n            calldatacopy(0, 0, calldatasize())\\n\\n            // Call the implementation.\\n            // out and outsize are 0 because we don't know the size yet.\\n            let result := delegatecall(gas(), implementation, 0, calldatasize(), 0, 0)\\n\\n            // Copy the returned data.\\n            returndatacopy(0, 0, returndatasize())\\n\\n            switch result\\n            // delegatecall returns 0 on error.\\n            case 0 {\\n                revert(0, returndatasize())\\n            }\\n            default {\\n                return(0, returndatasize())\\n            }\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Internal Views            * //\\n    // ************************************* //\\n\\n    function _getImplementation() internal view returns (address implementation) {\\n        assembly {\\n            implementation := sload(IMPLEMENTATION_SLOT)\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Fallback                * //\\n    // ************************************* //\\n\\n    /// @dev Fallback function that delegates calls to the address returned by `_implementation()`.\\n    /// @dev Will run if no other function in the contract matches the call data.\\n    fallback() external payable {\\n        _delegate(_getImplementation());\\n    }\\n\\n    receive() external payable {\\n        _delegate(_getImplementation());\\n    }\\n}\\n\",\"keccak256\":\"0x2d7b1f81e525787f1b8b033ce381a81cb5f39e411ff31490e019113205a661cd\",\"license\":\"MIT\"}},\"version\":1}",
+  "bytecode": "0x608060405234610144576102148038038061001981610148565b928339810190604081830312610144578051906001600160a01b0382168203610144576020810151906001600160401b038211610144570182601f8201121561014457805161006f61006a82610181565b610148565b9181835260208301946020838301011161014457815f926020809301875e83010152817f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5551806100c9575b6040516077908161019d8239f35b5f9283925af43d1561013f573d6100e261006a82610181565b9081525f60203d92013e5b156100fa575f80806100bb565b60405162461bcd60e51b815260206004820152601860248201527f50726f787920436f6e7374727563746f72206661696c656400000000000000006044820152606490fd5b6100ed565b5f80fd5b6040519190601f01601f191682016001600160401b0381118382101761016d57604052565b634e487b7160e01b5f52604160045260245ffd5b6001600160401b03811161016d57601f01601f19166020019056fe60806040525f807f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc54368280378136915af43d5f803e15603d573d5ff35b3d5ffdfea2646970667358221220e347285b4ca364b0c82598fe294ad8b02e9adfbbac26ab00c24b1b747375019464736f6c634300081e0033",
+  "deployedBytecode": "0x60806040525f807f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc54368280378136915af43d5f803e15603d573d5ff35b3d5ffdfea2646970667358221220e347285b4ca364b0c82598fe294ad8b02e9adfbbac26ab00c24b1b747375019464736f6c634300081e0033",
+  "execute": {
+    "methodName": "initialize",
+    "args": [
+      "0xf1C7c037891525E360C59f708739Ac09A7670c59"
+    ]
+  },
+  "implementation": "0xC3f638389635bF33E019c845FdaF2ed9bca3DF67",
+  "devdoc": {
+    "kind": "dev",
+    "methods": {},
+    "version": 1
+  },
+  "userdoc": {
+    "kind": "user",
+    "methods": {},
+    "version": 1
+  },
+  "storageLayout": {
+    "storage": [],
+    "types": null
+  }
+}
diff --git a/contracts/deployments/arbitrumSepoliaDevnet/DisputeTemplateRegistryUniversity_Implementation.json b/contracts/deployments/arbitrumSepoliaDevnet/DisputeTemplateRegistryUniversity_Implementation.json
new file mode 100644
index 000000000..bb5d17755
--- /dev/null
+++ b/contracts/deployments/arbitrumSepoliaDevnet/DisputeTemplateRegistryUniversity_Implementation.json
@@ -0,0 +1,445 @@
+{
+  "address": "0xC3f638389635bF33E019c845FdaF2ed9bca3DF67",
+  "abi": [
+    {
+      "inputs": [],
+      "stateMutability": "nonpayable",
+      "type": "constructor"
+    },
+    {
+      "inputs": [],
+      "name": "AlreadyInitialized",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "FailedDelegateCall",
+      "type": "error"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "address",
+          "name": "implementation",
+          "type": "address"
+        }
+      ],
+      "name": "InvalidImplementation",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "NotInitializing",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "OwnerOnly",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "UUPSUnauthorizedCallContext",
+      "type": "error"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "bytes32",
+          "name": "slot",
+          "type": "bytes32"
+        }
+      ],
+      "name": "UUPSUnsupportedProxiableUUID",
+      "type": "error"
+    },
+    {
+      "anonymous": false,
+      "inputs": [
+        {
+          "indexed": true,
+          "internalType": "uint256",
+          "name": "_templateId",
+          "type": "uint256"
+        },
+        {
+          "indexed": true,
+          "internalType": "string",
+          "name": "_templateTag",
+          "type": "string"
+        },
+        {
+          "indexed": false,
+          "internalType": "string",
+          "name": "_templateData",
+          "type": "string"
+        },
+        {
+          "indexed": false,
+          "internalType": "string",
+          "name": "_templateDataMappings",
+          "type": "string"
+        }
+      ],
+      "name": "DisputeTemplate",
+      "type": "event"
+    },
+    {
+      "anonymous": false,
+      "inputs": [
+        {
+          "indexed": false,
+          "internalType": "uint64",
+          "name": "version",
+          "type": "uint64"
+        }
+      ],
+      "name": "Initialized",
+      "type": "event"
+    },
+    {
+      "anonymous": false,
+      "inputs": [
+        {
+          "indexed": true,
+          "internalType": "address",
+          "name": "newImplementation",
+          "type": "address"
+        }
+      ],
+      "name": "Upgraded",
+      "type": "event"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "address",
+          "name": "_owner",
+          "type": "address"
+        }
+      ],
+      "name": "changeOwner",
+      "outputs": [],
+      "stateMutability": "nonpayable",
+      "type": "function"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "address",
+          "name": "_owner",
+          "type": "address"
+        }
+      ],
+      "name": "initialize",
+      "outputs": [],
+      "stateMutability": "nonpayable",
+      "type": "function"
+    },
+    {
+      "inputs": [],
+      "name": "owner",
+      "outputs": [
+        {
+          "internalType": "address",
+          "name": "",
+          "type": "address"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
+    {
+      "inputs": [],
+      "name": "proxiableUUID",
+      "outputs": [
+        {
+          "internalType": "bytes32",
+          "name": "",
+          "type": "bytes32"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "string",
+          "name": "_templateTag",
+          "type": "string"
+        },
+        {
+          "internalType": "string",
+          "name": "_templateData",
+          "type": "string"
+        },
+        {
+          "internalType": "string",
+          "name": "_templateDataMappings",
+          "type": "string"
+        }
+      ],
+      "name": "setDisputeTemplate",
+      "outputs": [
+        {
+          "internalType": "uint256",
+          "name": "templateId",
+          "type": "uint256"
+        }
+      ],
+      "stateMutability": "nonpayable",
+      "type": "function"
+    },
+    {
+      "inputs": [],
+      "name": "templates",
+      "outputs": [
+        {
+          "internalType": "uint256",
+          "name": "",
+          "type": "uint256"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "address",
+          "name": "newImplementation",
+          "type": "address"
+        },
+        {
+          "internalType": "bytes",
+          "name": "data",
+          "type": "bytes"
+        }
+      ],
+      "name": "upgradeToAndCall",
+      "outputs": [],
+      "stateMutability": "payable",
+      "type": "function"
+    },
+    {
+      "inputs": [],
+      "name": "version",
+      "outputs": [
+        {
+          "internalType": "string",
+          "name": "",
+          "type": "string"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    }
+  ],
+  "transactionHash": "0xa6a4958a5881803297025fcb6b02ff4623b6c196dfc1c63ecdcc5dbca371f59c",
+  "receipt": {
+    "to": null,
+    "from": "0xf1C7c037891525E360C59f708739Ac09A7670c59",
+    "contractAddress": "0xC3f638389635bF33E019c845FdaF2ed9bca3DF67",
+    "transactionIndex": 1,
+    "gasUsed": "550773",
+    "logsBloom": "0x00080000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000020000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000800000000000000000000000080000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004000000000000000000000000000000000000000000000000000000100000000000000000000000000000",
+    "blockHash": "0x3831b40eb48160858d03c9e32ad925255ab201a6d738d0d223b347c63193ab27",
+    "transactionHash": "0xa6a4958a5881803297025fcb6b02ff4623b6c196dfc1c63ecdcc5dbca371f59c",
+    "logs": [
+      {
+        "transactionIndex": 1,
+        "blockNumber": 193661055,
+        "transactionHash": "0xa6a4958a5881803297025fcb6b02ff4623b6c196dfc1c63ecdcc5dbca371f59c",
+        "address": "0xC3f638389635bF33E019c845FdaF2ed9bca3DF67",
+        "topics": [
+          "0xc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d2"
+        ],
+        "data": "0x000000000000000000000000000000000000000000000000ffffffffffffffff",
+        "logIndex": 0,
+        "blockHash": "0x3831b40eb48160858d03c9e32ad925255ab201a6d738d0d223b347c63193ab27"
+      }
+    ],
+    "blockNumber": 193661055,
+    "cumulativeGasUsed": "550773",
+    "status": 1,
+    "byzantium": true
+  },
+  "args": [],
+  "numDeployments": 1,
+  "solcInputHash": "d547d738900bce1310e91a5d1adfc179",
+  "metadata": "{\"compiler\":{\"version\":\"0.8.30+commit.73712a01\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"inputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"constructor\"},{\"inputs\":[],\"name\":\"AlreadyInitialized\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"FailedDelegateCall\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"implementation\",\"type\":\"address\"}],\"name\":\"InvalidImplementation\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"NotInitializing\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"OwnerOnly\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"UUPSUnauthorizedCallContext\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"slot\",\"type\":\"bytes32\"}],\"name\":\"UUPSUnsupportedProxiableUUID\",\"type\":\"error\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_templateId\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"string\",\"name\":\"_templateTag\",\"type\":\"string\"},{\"indexed\":false,\"internalType\":\"string\",\"name\":\"_templateData\",\"type\":\"string\"},{\"indexed\":false,\"internalType\":\"string\",\"name\":\"_templateDataMappings\",\"type\":\"string\"}],\"name\":\"DisputeTemplate\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":false,\"internalType\":\"uint64\",\"name\":\"version\",\"type\":\"uint64\"}],\"name\":\"Initialized\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"newImplementation\",\"type\":\"address\"}],\"name\":\"Upgraded\",\"type\":\"event\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_owner\",\"type\":\"address\"}],\"name\":\"changeOwner\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_owner\",\"type\":\"address\"}],\"name\":\"initialize\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"owner\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"proxiableUUID\",\"outputs\":[{\"internalType\":\"bytes32\",\"name\":\"\",\"type\":\"bytes32\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"string\",\"name\":\"_templateTag\",\"type\":\"string\"},{\"internalType\":\"string\",\"name\":\"_templateData\",\"type\":\"string\"},{\"internalType\":\"string\",\"name\":\"_templateDataMappings\",\"type\":\"string\"}],\"name\":\"setDisputeTemplate\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"templateId\",\"type\":\"uint256\"}],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"templates\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"newImplementation\",\"type\":\"address\"},{\"internalType\":\"bytes\",\"name\":\"data\",\"type\":\"bytes\"}],\"name\":\"upgradeToAndCall\",\"outputs\":[],\"stateMutability\":\"payable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"version\",\"outputs\":[{\"internalType\":\"string\",\"name\":\"\",\"type\":\"string\"}],\"stateMutability\":\"view\",\"type\":\"function\"}],\"devdoc\":{\"errors\":{\"AlreadyInitialized()\":[{\"details\":\"The contract is already initialized.\"}],\"NotInitializing()\":[{\"details\":\"The contract is not initializing.\"}]},\"events\":{\"DisputeTemplate(uint256,string,string,string)\":{\"params\":{\"_templateData\":\"The template data.\",\"_templateDataMappings\":\"The data mappings.\",\"_templateId\":\"The identifier of the dispute template.\",\"_templateTag\":\"An optional tag for the dispute template, such as \\\"registration\\\" or \\\"removal\\\".\"}},\"Initialized(uint64)\":{\"details\":\"Triggered when the contract has been initialized or reinitialized.\"},\"Upgraded(address)\":{\"params\":{\"newImplementation\":\"Address of the new implementation the proxy is now forwarding calls to.\"}}},\"kind\":\"dev\",\"methods\":{\"changeOwner(address)\":{\"params\":{\"_owner\":\"The new owner.\"}},\"constructor\":{\"custom:oz-upgrades-unsafe-allow\":\"constructor\"},\"initialize(address)\":{\"params\":{\"_owner\":\"Owner of the contract.\"}},\"proxiableUUID()\":{\"details\":\"IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks bricking a proxy that upgrades to it, by delegating to itself until out of gas. Thus it is critical that this function revert if invoked through a proxy. This is guaranteed by the if statement.\"},\"setDisputeTemplate(string,string,string)\":{\"params\":{\"_templateData\":\"The template data.\",\"_templateDataMappings\":\"The data mappings for the template.\",\"_templateTag\":\"An optional tag for the dispute template, such as \\\"registration\\\" or \\\"removal\\\".\"},\"returns\":{\"templateId\":\"The identifier of the dispute template.\"}},\"upgradeToAndCall(address,bytes)\":{\"details\":\"Reverts if the execution is not performed via delegatecall or the execution context is not of a proxy with an ERC1967-compliant implementation pointing to self.\",\"params\":{\"data\":\"Data used in a delegate call to `newImplementation` if non-empty. This will typically be an encoded function call, and allows initializing the storage of the proxy like a Solidity constructor.\",\"newImplementation\":\"Address of the new implementation contract.\"}}},\"stateVariables\":{\"version\":{\"return\":\"Version string.\",\"returns\":{\"_0\":\"Version string.\"}}},\"title\":\"Dispute Template Registry\",\"version\":1},\"userdoc\":{\"errors\":{\"FailedDelegateCall()\":[{\"notice\":\"Failed Delegated call\"}],\"InvalidImplementation(address)\":[{\"notice\":\"The `implementation` is not UUPS-compliant\"}],\"UUPSUnauthorizedCallContext()\":[{\"notice\":\"The call is from an unauthorized context.\"}],\"UUPSUnsupportedProxiableUUID(bytes32)\":[{\"notice\":\"The storage `slot` is unsupported as a UUID.\"}]},\"events\":{\"DisputeTemplate(uint256,string,string,string)\":{\"notice\":\"To be emitted when a new dispute template is created.\"},\"Upgraded(address)\":{\"notice\":\"Emitted when the `implementation` has been successfully upgraded.\"}},\"kind\":\"user\",\"methods\":{\"changeOwner(address)\":{\"notice\":\"Changes the owner of the contract.\"},\"initialize(address)\":{\"notice\":\"Initializer\"},\"owner()\":{\"notice\":\"The owner of the contract.\"},\"proxiableUUID()\":{\"notice\":\"Implementation of the ERC1822 `proxiableUUID` function. This returns the storage slot used by the implementation. It is used to validate the implementation's compatibility when performing an upgrade.\"},\"setDisputeTemplate(string,string,string)\":{\"notice\":\"Registers a new dispute template.\"},\"templates()\":{\"notice\":\"The number of templates.\"},\"upgradeToAndCall(address,bytes)\":{\"notice\":\"Upgrade mechanism including access control and UUPS-compliance.\"},\"version()\":{\"notice\":\"Returns the version of the implementation.\"}},\"notice\":\"A contract to maintain a registry of dispute templates.\",\"version\":1}},\"settings\":{\"compilationTarget\":{\"src/arbitration/DisputeTemplateRegistry.sol\":\"DisputeTemplateRegistry\"},\"evmVersion\":\"cancun\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\",\"useLiteralContent\":true},\"optimizer\":{\"enabled\":true,\"runs\":1000},\"remappings\":[],\"viaIR\":true},\"sources\":{\"src/arbitration/DisputeTemplateRegistry.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\npragma solidity ^0.8.24;\\n\\nimport \\\"../proxy/UUPSProxiable.sol\\\";\\nimport \\\"../proxy/Initializable.sol\\\";\\nimport \\\"./interfaces/IDisputeTemplateRegistry.sol\\\";\\n\\n/// @title Dispute Template Registry\\n/// @notice A contract to maintain a registry of dispute templates.\\ncontract DisputeTemplateRegistry is IDisputeTemplateRegistry, UUPSProxiable, Initializable {\\n    string public constant override version = \\\"2.0.0\\\";\\n\\n    // ************************************* //\\n    // *             Storage               * //\\n    // ************************************* //\\n\\n    /// @notice The owner of the contract.\\n    address public owner;\\n\\n    /// @notice The number of templates.\\n    uint256 public templates;\\n\\n    // ************************************* //\\n    // *        Function Modifiers         * //\\n    // ************************************* //\\n\\n    modifier onlyByOwner() {\\n        if (owner != msg.sender) revert OwnerOnly();\\n        _;\\n    }\\n\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    /// @custom:oz-upgrades-unsafe-allow constructor\\n    constructor() {\\n        _disableInitializers();\\n    }\\n\\n    /// @notice Initializer\\n    /// @param _owner Owner of the contract.\\n    function initialize(address _owner) external initializer {\\n        owner = _owner;\\n    }\\n\\n    // ************************ //\\n    // *      Governance      * //\\n    // ************************ //\\n\\n    /// @dev Access Control to perform implementation upgrades (UUPS Proxiable)\\n    ///      Only the owner can perform upgrades (`onlyByOwner`)\\n    function _authorizeUpgrade(address) internal view override onlyByOwner {\\n        // NOP\\n    }\\n\\n    /// @notice Changes the owner of the contract.\\n    /// @param _owner The new owner.\\n    function changeOwner(address _owner) external onlyByOwner {\\n        owner = _owner;\\n    }\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @inheritdoc IDisputeTemplateRegistry\\n    function setDisputeTemplate(\\n        string memory _templateTag,\\n        string memory _templateData,\\n        string memory _templateDataMappings\\n    ) external returns (uint256 templateId) {\\n        templateId = templates++;\\n        emit DisputeTemplate(templateId, _templateTag, _templateData, _templateDataMappings);\\n    }\\n\\n    // ************************************* //\\n    // *              Errors               * //\\n    // ************************************* //\\n\\n    error OwnerOnly();\\n}\\n\",\"keccak256\":\"0x9790f4e6f1a6b77063f3d95595ad70d86b5076371b3c3e04e2ce73ec0f9365f4\",\"license\":\"MIT\"},\"src/arbitration/interfaces/IDisputeTemplateRegistry.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity >=0.8.0 <0.9.0;\\n\\n/// @title IDisputeTemplate\\n/// @notice Dispute Template interface.\\ninterface IDisputeTemplateRegistry {\\n    // ************************************* //\\n    // *              Events               * //\\n    // ************************************* //\\n\\n    /// @notice To be emitted when a new dispute template is created.\\n    /// @param _templateId The identifier of the dispute template.\\n    /// @param _templateTag An optional tag for the dispute template, such as \\\"registration\\\" or \\\"removal\\\".\\n    /// @param _templateData The template data.\\n    /// @param _templateDataMappings The data mappings.\\n    event DisputeTemplate(\\n        uint256 indexed _templateId,\\n        string indexed _templateTag,\\n        string _templateData,\\n        string _templateDataMappings\\n    );\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @notice Registers a new dispute template.\\n    /// @param _templateTag An optional tag for the dispute template, such as \\\"registration\\\" or \\\"removal\\\".\\n    /// @param _templateData The template data.\\n    /// @param _templateDataMappings The data mappings for the template.\\n    /// @return templateId The identifier of the dispute template.\\n    function setDisputeTemplate(\\n        string memory _templateTag,\\n        string memory _templateData,\\n        string memory _templateDataMappings\\n    ) external returns (uint256 templateId);\\n}\\n\",\"keccak256\":\"0x07ea0d9c5aea94cb73ca90f9a9f7689dcca2b37e7ec49bc6e02ee660ce2cee4f\",\"license\":\"MIT\"},\"src/proxy/Initializable.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v4.9.0) (proxy/utils/Initializable.sol) <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/utils/Initializable.sol>\\n\\npragma solidity ^0.8.24;\\n\\n/**\\n * @dev This is a base contract to aid in writing upgradeable contracts, or any kind of contract that will be deployed\\n * behind a proxy. Since proxied contracts do not make use of a constructor, it's common to move constructor logic to an\\n * external initializer function, usually called `initialize`. It then becomes necessary to protect this initializer\\n * function so it can only be called once. The {initializer} modifier provided by this contract will have this effect.\\n *\\n * The initialization functions use a version number. Once a version number is used, it is consumed and cannot be\\n * reused. This mechanism prevents re-execution of each \\\"step\\\" but allows the creation of new initialization steps in\\n * case an upgrade adds a module that needs to be initialized.\\n *\\n * For example:\\n *\\n * ```solidity\\n * contract MyToken is ERC20Upgradeable {\\n *     function initialize() initializer public {\\n *         __ERC20_init(\\\"MyToken\\\", \\\"MTK\\\");\\n *     }\\n * }\\n *\\n * contract MyTokenV2 is MyToken, ERC20PermitUpgradeable {\\n *     function initializeV2() reinitializer(2) public {\\n *         __ERC20Permit_init(\\\"MyToken\\\");\\n *     }\\n * }\\n * ```\\n *\\n * TIP: To avoid leaving the proxy in an uninitialized state, the initializer function should be called as early as\\n * possible by providing the encoded function call as the `_data` argument to the proxy constructor\\n *\\n * CAUTION: When used with inheritance, manual care must be taken to not invoke a parent initializer twice, or to ensure\\n * that all initializers are idempotent. This is not verified automatically as constructors are by Solidity.\\n *\\n * [CAUTION]\\n * ====\\n * Avoid leaving a contract uninitialized.\\n *\\n * An uninitialized contract can be taken over by an attacker. This applies to both a proxy and its implementation\\n * contract, which may impact the proxy. To prevent the implementation contract from being used, you should invoke\\n * the {_disableInitializers} function in the constructor to automatically lock it when it is deployed:\\n *\\n * ```\\n * /// @custom:oz-upgrades-unsafe-allow constructor\\n * constructor() {\\n *     _disableInitializers();\\n * }\\n * ```\\n */\\nabstract contract Initializable {\\n    /**\\n     * @dev Storage of the initializable contract.\\n     *\\n     * It's implemented on a custom ERC-7201 namespace to reduce the risk of storage collisions\\n     * when using with upgradeable contracts.\\n     *\\n     * @custom:storage-location erc7201:openzeppelin.storage.Initializable\\n     */\\n    struct InitializableStorage {\\n        /**\\n         * @dev Indicates that the contract has been initialized.\\n         */\\n        uint64 _initialized;\\n        /**\\n         * @dev Indicates that the contract is in the process of being initialized.\\n         */\\n        bool _initializing;\\n    }\\n\\n    // keccak256(abi.encode(uint256(keccak256(\\\"openzeppelin.storage.Initializable\\\")) - 1))\\n    bytes32 private constant _INITIALIZABLE_STORAGE =\\n        0xf0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e;\\n\\n    /**\\n     * @dev The contract is already initialized.\\n     */\\n    error AlreadyInitialized();\\n\\n    /**\\n     * @dev The contract is not initializing.\\n     */\\n    error NotInitializing();\\n\\n    /**\\n     * @dev Triggered when the contract has been initialized or reinitialized.\\n     */\\n    event Initialized(uint64 version);\\n\\n    /**\\n     * @dev A modifier that defines a protected initializer function that can be invoked at most once. In its scope,\\n     * `onlyInitializing` functions can be used to initialize parent contracts.\\n     *\\n     * Similar to `initializer()`, except that functions marked with `initializer` can be nested in the context of a\\n     * constructor.\\n     *\\n     * Emits an {Initialized} event.\\n     */\\n    modifier initializer() {\\n        // solhint-disable-next-line var-name-mixedcase\\n        InitializableStorage storage $ = _getInitializableStorage();\\n\\n        bool isTopLevelCall = !$._initializing;\\n        uint64 initialized = $._initialized;\\n        if (!(isTopLevelCall && initialized < 1) && !(address(this).code.length == 0 && initialized == 1)) {\\n            revert AlreadyInitialized();\\n        }\\n        $._initialized = 1;\\n        if (isTopLevelCall) {\\n            $._initializing = true;\\n        }\\n        _;\\n        if (isTopLevelCall) {\\n            $._initializing = false;\\n            emit Initialized(1);\\n        }\\n    }\\n\\n    /**\\n     * @dev A modifier that defines a protected reinitializer function that can be invoked at most once, and only if the\\n     * contract hasn't been initialized to a greater version before. In its scope, `onlyInitializing` functions can be\\n     * used to initialize parent contracts.\\n     *\\n     * A reinitializer may be used after the original initialization step. This is essential to configure modules that\\n     * are added through upgrades and that require initialization.\\n     *\\n     * When `version` is 1, this modifier is similar to `initializer`, except that functions marked with `reinitializer`\\n     * cannot be nested. If one is invoked in the context of another, execution will revert.\\n     *\\n     * Note that versions can jump in increments greater than 1; this implies that if multiple reinitializers coexist in\\n     * a contract, executing them in the right order is up to the developer or operator.\\n     *\\n     * WARNING: setting the version to 255 will prevent any future reinitialization.\\n     *\\n     * Emits an {Initialized} event.\\n     */\\n    modifier reinitializer(uint64 version) {\\n        // solhint-disable-next-line var-name-mixedcase\\n        InitializableStorage storage $ = _getInitializableStorage();\\n\\n        if ($._initializing || $._initialized >= version) {\\n            revert AlreadyInitialized();\\n        }\\n        $._initialized = version;\\n        $._initializing = true;\\n        _;\\n        $._initializing = false;\\n        emit Initialized(version);\\n    }\\n\\n    /**\\n     * @dev Modifier to protect an initialization function so that it can only be invoked by functions with the\\n     * {initializer} and {reinitializer} modifiers, directly or indirectly.\\n     */\\n    modifier onlyInitializing() {\\n        _checkInitializing();\\n        _;\\n    }\\n\\n    /**\\n     * @dev Reverts if the contract is not in an initializing state. See {onlyInitializing}.\\n     */\\n    function _checkInitializing() internal view virtual {\\n        if (!_isInitializing()) {\\n            revert NotInitializing();\\n        }\\n    }\\n\\n    /**\\n     * @dev Locks the contract, preventing any future reinitialization. This cannot be part of an initializer call.\\n     * Calling this in the constructor of a contract will prevent that contract from being initialized or reinitialized\\n     * to any version. It is recommended to use this to lock implementation contracts that are designed to be called\\n     * through proxies.\\n     *\\n     * Emits an {Initialized} event the first time it is successfully executed.\\n     */\\n    function _disableInitializers() internal virtual {\\n        // solhint-disable-next-line var-name-mixedcase\\n        InitializableStorage storage $ = _getInitializableStorage();\\n\\n        if ($._initializing) {\\n            revert AlreadyInitialized();\\n        }\\n        if ($._initialized != type(uint64).max) {\\n            $._initialized = type(uint64).max;\\n            emit Initialized(type(uint64).max);\\n        }\\n    }\\n\\n    /**\\n     * @dev Returns the highest version that has been initialized. See {reinitializer}.\\n     */\\n    function _getInitializedVersion() internal view returns (uint64) {\\n        return _getInitializableStorage()._initialized;\\n    }\\n\\n    /**\\n     * @dev Returns `true` if the contract is currently initializing. See {onlyInitializing}.\\n     */\\n    function _isInitializing() internal view returns (bool) {\\n        return _getInitializableStorage()._initializing;\\n    }\\n\\n    /**\\n     * @dev Returns a pointer to the storage namespace.\\n     */\\n    // solhint-disable-next-line var-name-mixedcase\\n    function _getInitializableStorage() private pure returns (InitializableStorage storage $) {\\n        assembly {\\n            $.slot := _INITIALIZABLE_STORAGE\\n        }\\n    }\\n}\\n\",\"keccak256\":\"0xdad09e5f773fa6940dbd8c28480f602a7eaa3c70d3da9d06df140187cbf5dad4\",\"license\":\"MIT\"},\"src/proxy/UUPSProxiable.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\n/// @title UUPS Proxiable\\n/// @author Simon Malatrait <simon.malatrait@grenoble-inp.org>\\n/// @notice This contract implements an upgradeability mechanism designed for UUPS proxies.\\n///\\n/// @dev Adapted from <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/utils/UUPSUpgradeable.sol>\\n/// The functions included here can perform an upgrade of an UUPS Proxy, when this contract is set as the implementation behind such a proxy.\\n///\\n/// IMPORTANT: A UUPS proxy requires its upgradeability functions to be in the implementation as opposed to the transparent proxy.\\n/// This means that if the proxy is upgraded to an implementation that does not support this interface, it will no longer be upgradeable.\\n///\\n/// A security mechanism ensures that an upgrade does not turn off upgradeability accidentally, although this risk is\\n/// reinstated if the upgrade retains upgradeability but removes the security mechanism, e.g. by replacing\\n/// `UUPSProxiable` with a custom implementation of upgrades.\\n///\\n/// The `_authorizeUpgrade` function must be overridden to include access restriction to the upgrade mechanism.\\nabstract contract UUPSProxiable {\\n    // ************************************* //\\n    // *             Event                 * //\\n    // ************************************* //\\n\\n    /// @notice Emitted when the `implementation` has been successfully upgraded.\\n    /// @param newImplementation Address of the new implementation the proxy is now forwarding calls to.\\n    event Upgraded(address indexed newImplementation);\\n\\n    // ************************************* //\\n    // *             Error                 * //\\n    // ************************************* //\\n\\n    /// @notice The call is from an unauthorized context.\\n    error UUPSUnauthorizedCallContext();\\n\\n    /// @notice The storage `slot` is unsupported as a UUID.\\n    error UUPSUnsupportedProxiableUUID(bytes32 slot);\\n\\n    /// @notice The `implementation` is not UUPS-compliant\\n    error InvalidImplementation(address implementation);\\n\\n    /// Failed Delegated call\\n    error FailedDelegateCall();\\n\\n    // ************************************* //\\n    // *             Storage               * //\\n    // ************************************* //\\n\\n    /// @dev Storage slot with the address of the current implementation.\\n    /// @dev This is the keccak-256 hash of \\\"eip1967.proxy.implementation\\\" subtracted by 1, and is\\n    /// @dev validated in the constructor.\\n    /// @dev NOTE: bytes32(uint256(keccak256('eip1967.proxy.implementation')) - 1)\\n    bytes32 private constant IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;\\n\\n    /// @dev Storage variable of the proxiable contract address.\\n    /// @dev It is used to check whether or not the current call is from the proxy.\\n    /// @custom:oz-upgrades-unsafe-allow state-variable-immutable\\n    address private immutable __self = address(this);\\n\\n    // ************************************* //\\n    // *             Governance            * //\\n    // ************************************* //\\n\\n    /// @dev Function that should revert when `msg.sender` is not authorized to upgrade the contract.\\n    /// @dev Called by {upgradeToAndCall}.\\n    function _authorizeUpgrade(address newImplementation) internal virtual;\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @notice Upgrade mechanism including access control and UUPS-compliance.\\n    /// @param newImplementation Address of the new implementation contract.\\n    /// @param data Data used in a delegate call to `newImplementation` if non-empty. This will typically be an encoded\\n    /// function call, and allows initializing the storage of the proxy like a Solidity constructor.\\n    /// @dev Reverts if the execution is not performed via delegatecall or the execution\\n    /// context is not of a proxy with an ERC1967-compliant implementation pointing to self.\\n    function upgradeToAndCall(address newImplementation, bytes memory data) public payable virtual {\\n        _authorizeUpgrade(newImplementation);\\n\\n        // Check that the execution is being performed through a delegatecall call and that the execution context is\\n        // a proxy contract with an implementation (as defined in ERC1967) pointing to self.\\n        if (address(this) == __self || _getImplementation() != __self) {\\n            revert UUPSUnauthorizedCallContext();\\n        }\\n\\n        try UUPSProxiable(newImplementation).proxiableUUID() returns (bytes32 slot) {\\n            if (slot != IMPLEMENTATION_SLOT) {\\n                revert UUPSUnsupportedProxiableUUID(slot);\\n            }\\n            // Store the new implementation address to the implementation storage slot.\\n            assembly {\\n                sstore(IMPLEMENTATION_SLOT, newImplementation)\\n            }\\n            emit Upgraded(newImplementation);\\n\\n            if (data.length != 0) {\\n                // The return data is not checked (checking, in case of success, that the newImplementation code is non-empty if the return data is empty) because the authorized callee is trusted.\\n                /// @custom:oz-upgrades-unsafe-allow delegatecall\\n                (bool success, ) = newImplementation.delegatecall(data);\\n                if (!success) {\\n                    revert FailedDelegateCall();\\n                }\\n            }\\n        } catch {\\n            revert InvalidImplementation(newImplementation);\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /// @notice Implementation of the ERC1822 `proxiableUUID` function. This returns the storage slot used by the\\n    /// implementation. It is used to validate the implementation's compatibility when performing an upgrade.\\n    ///\\n    /// @dev IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks\\n    /// bricking a proxy that upgrades to it, by delegating to itself until out of gas. Thus it is critical that this\\n    /// function revert if invoked through a proxy. This is guaranteed by the if statement.\\n    function proxiableUUID() external view virtual returns (bytes32) {\\n        if (address(this) != __self) {\\n            // Must not be called through delegatecall\\n            revert UUPSUnauthorizedCallContext();\\n        }\\n        return IMPLEMENTATION_SLOT;\\n    }\\n\\n    /// @notice Returns the version of the implementation.\\n    /// @return Version string.\\n    function version() external view virtual returns (string memory);\\n\\n    // ************************************* //\\n    // *           Internal Views          * //\\n    // ************************************* //\\n\\n    function _getImplementation() internal view returns (address implementation) {\\n        assembly {\\n            implementation := sload(IMPLEMENTATION_SLOT)\\n        }\\n    }\\n}\\n\",\"keccak256\":\"0xa369061748e8a7b02873d597d4c78a2a09328111f04a97428b1c209e82cf5414\",\"license\":\"MIT\"}},\"version\":1}",
+  "bytecode": "0x60a080604052346100c157306080525f5160206109585f395f51905f525460ff8160401c166100b3576002600160401b03196001600160401b03821601610060575b60405161089290816100c6823960805181818161036a01526104430152f35b6001600160401b0319166001600160401b039081175f5160206109585f395f51905f525581527fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d290602090a15f80610041565b62dc149f60e41b5f5260045ffd5b5f80fdfe6080806040526004361015610012575f80fd5b5f3560e01c9081633a283d7d14610762575080634a9941741461065a5780634f1ef286146103e257806352d1902d1461035057806354fd4d50146102ed5780638da5cb5b146102c8578063a6f9dae11461024b5763c4d66de814610074575f80fd5b346102475760203660031901126102475761008d610822565b7ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e5460ff8160401c16159167ffffffffffffffff8216838061023d575b15908161021f575b506101f75767ffffffffffffffff1982166001177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e556001600160a01b0391836101b8575b501673ffffffffffffffffffffffffffffffffffffffff195f5416175f5561013b57005b68ff0000000000000000197ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e54167ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e557fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d2602060405160018152a1005b68ffffffffffffffffff191668010000000000000001177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e555f610117565b7f0dc149f0000000000000000000000000000000000000000000000000000000005f5260045ffd5b303b15915081610232575b50155f6100d2565b60019150145f61022a565b50600181106100ca565b5f80fd5b3461024757602036600319011261024757610264610822565b5f5490336001600160a01b038316036102a0576001600160a01b0373ffffffffffffffffffffffffffffffffffffffff1991169116175f555f80f35b7f596dcdb8000000000000000000000000000000000000000000000000000000005f5260045ffd5b34610247575f3660031901126102475760206001600160a01b035f5416604051908152f35b34610247575f3660031901126102475761034c60405161030e60408261077c565b600581527f322e302e300000000000000000000000000000000000000000000000000000006020820152604051918291602083526020830190610838565b0390f35b34610247575f366003190112610247576001600160a01b037f00000000000000000000000000000000000000000000000000000000000000001630036103ba5760206040517f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc8152f35b7fe07c8dba000000000000000000000000000000000000000000000000000000005f5260045ffd5b6040366003190112610247576103f6610822565b60243567ffffffffffffffff81116102475736602382011215610247576104279036906024816004013591016107ce565b906001600160a01b035f541633036102a0576001600160a01b037f000000000000000000000000000000000000000000000000000000000000000016803014908115610625575b506103ba576001600160a01b038116916040517f52d1902d000000000000000000000000000000000000000000000000000000008152602081600481875afa5f91816105f1575b506104e657837f0c760937000000000000000000000000000000000000000000000000000000005f5260045260245ffd5b807f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc8592036105c65750827f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc557fbc7cd75a20ee27fd9adebab32041f755214dbc6bffa90cc0225b39da2e5c2d3b5f80a280518061056057005b5f926020849301905af43d156105c1573d61057a816107b2565b90610588604051928361077c565b81525f60203d92013e5b1561059957005b7f736436ba000000000000000000000000000000000000000000000000000000005f5260045ffd5b610592565b7faa1d49a4000000000000000000000000000000000000000000000000000000005f5260045260245ffd5b9091506020813d60201161061d575b8161060d6020938361077c565b81010312610247575190856104b5565b3d9150610600565b90506001600160a01b037f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc541614158361046e565b346102475760603660031901126102475760043567ffffffffffffffff81116102475761068b903690600401610804565b60243567ffffffffffffffff8111610247576106ab903690600401610804565b9060443567ffffffffffffffff8111610247576106cc903690600401610804565b600154915f19831461074e577ef7cd7255d1073b4e136dd477c38ea0020c051ab17110cc5bfab0c840ff992461073660209561074387879560018701600155604051918183925191829101835e81015f815203902095604051938493604085526040850190610838565b908382038a850152610838565b0390a3604051908152f35b634e487b7160e01b5f52601160045260245ffd5b34610247575f366003190112610247576020906001548152f35b90601f8019910116810190811067ffffffffffffffff82111761079e57604052565b634e487b7160e01b5f52604160045260245ffd5b67ffffffffffffffff811161079e57601f01601f191660200190565b9291926107da826107b2565b916107e8604051938461077c565b829481845281830111610247578281602093845f960137010152565b9080601f830112156102475781602061081f933591016107ce565b90565b600435906001600160a01b038216820361024757565b805180835260209291819084018484015e5f828201840152601f01601f191601019056fea2646970667358221220bb75c0a527977368a7b8fd2e1e5a73e20d804eb35645fe757271a9acd08c759764736f6c634300081e0033f0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e",
+  "deployedBytecode": "0x6080806040526004361015610012575f80fd5b5f3560e01c9081633a283d7d14610762575080634a9941741461065a5780634f1ef286146103e257806352d1902d1461035057806354fd4d50146102ed5780638da5cb5b146102c8578063a6f9dae11461024b5763c4d66de814610074575f80fd5b346102475760203660031901126102475761008d610822565b7ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e5460ff8160401c16159167ffffffffffffffff8216838061023d575b15908161021f575b506101f75767ffffffffffffffff1982166001177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e556001600160a01b0391836101b8575b501673ffffffffffffffffffffffffffffffffffffffff195f5416175f5561013b57005b68ff0000000000000000197ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e54167ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e557fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d2602060405160018152a1005b68ffffffffffffffffff191668010000000000000001177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e555f610117565b7f0dc149f0000000000000000000000000000000000000000000000000000000005f5260045ffd5b303b15915081610232575b50155f6100d2565b60019150145f61022a565b50600181106100ca565b5f80fd5b3461024757602036600319011261024757610264610822565b5f5490336001600160a01b038316036102a0576001600160a01b0373ffffffffffffffffffffffffffffffffffffffff1991169116175f555f80f35b7f596dcdb8000000000000000000000000000000000000000000000000000000005f5260045ffd5b34610247575f3660031901126102475760206001600160a01b035f5416604051908152f35b34610247575f3660031901126102475761034c60405161030e60408261077c565b600581527f322e302e300000000000000000000000000000000000000000000000000000006020820152604051918291602083526020830190610838565b0390f35b34610247575f366003190112610247576001600160a01b037f00000000000000000000000000000000000000000000000000000000000000001630036103ba5760206040517f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc8152f35b7fe07c8dba000000000000000000000000000000000000000000000000000000005f5260045ffd5b6040366003190112610247576103f6610822565b60243567ffffffffffffffff81116102475736602382011215610247576104279036906024816004013591016107ce565b906001600160a01b035f541633036102a0576001600160a01b037f000000000000000000000000000000000000000000000000000000000000000016803014908115610625575b506103ba576001600160a01b038116916040517f52d1902d000000000000000000000000000000000000000000000000000000008152602081600481875afa5f91816105f1575b506104e657837f0c760937000000000000000000000000000000000000000000000000000000005f5260045260245ffd5b807f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc8592036105c65750827f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc557fbc7cd75a20ee27fd9adebab32041f755214dbc6bffa90cc0225b39da2e5c2d3b5f80a280518061056057005b5f926020849301905af43d156105c1573d61057a816107b2565b90610588604051928361077c565b81525f60203d92013e5b1561059957005b7f736436ba000000000000000000000000000000000000000000000000000000005f5260045ffd5b610592565b7faa1d49a4000000000000000000000000000000000000000000000000000000005f5260045260245ffd5b9091506020813d60201161061d575b8161060d6020938361077c565b81010312610247575190856104b5565b3d9150610600565b90506001600160a01b037f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc541614158361046e565b346102475760603660031901126102475760043567ffffffffffffffff81116102475761068b903690600401610804565b60243567ffffffffffffffff8111610247576106ab903690600401610804565b9060443567ffffffffffffffff8111610247576106cc903690600401610804565b600154915f19831461074e577ef7cd7255d1073b4e136dd477c38ea0020c051ab17110cc5bfab0c840ff992461073660209561074387879560018701600155604051918183925191829101835e81015f815203902095604051938493604085526040850190610838565b908382038a850152610838565b0390a3604051908152f35b634e487b7160e01b5f52601160045260245ffd5b34610247575f366003190112610247576020906001548152f35b90601f8019910116810190811067ffffffffffffffff82111761079e57604052565b634e487b7160e01b5f52604160045260245ffd5b67ffffffffffffffff811161079e57601f01601f191660200190565b9291926107da826107b2565b916107e8604051938461077c565b829481845281830111610247578281602093845f960137010152565b9080601f830112156102475781602061081f933591016107ce565b90565b600435906001600160a01b038216820361024757565b805180835260209291819084018484015e5f828201840152601f01601f191601019056fea2646970667358221220bb75c0a527977368a7b8fd2e1e5a73e20d804eb35645fe757271a9acd08c759764736f6c634300081e0033",
+  "devdoc": {
+    "errors": {
+      "AlreadyInitialized()": [
+        {
+          "details": "The contract is already initialized."
+        }
+      ],
+      "NotInitializing()": [
+        {
+          "details": "The contract is not initializing."
+        }
+      ]
+    },
+    "events": {
+      "DisputeTemplate(uint256,string,string,string)": {
+        "params": {
+          "_templateData": "The template data.",
+          "_templateDataMappings": "The data mappings.",
+          "_templateId": "The identifier of the dispute template.",
+          "_templateTag": "An optional tag for the dispute template, such as \"registration\" or \"removal\"."
+        }
+      },
+      "Initialized(uint64)": {
+        "details": "Triggered when the contract has been initialized or reinitialized."
+      },
+      "Upgraded(address)": {
+        "params": {
+          "newImplementation": "Address of the new implementation the proxy is now forwarding calls to."
+        }
+      }
+    },
+    "kind": "dev",
+    "methods": {
+      "changeOwner(address)": {
+        "params": {
+          "_owner": "The new owner."
+        }
+      },
+      "constructor": {
+        "custom:oz-upgrades-unsafe-allow": "constructor"
+      },
+      "initialize(address)": {
+        "params": {
+          "_owner": "Owner of the contract."
+        }
+      },
+      "proxiableUUID()": {
+        "details": "IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks bricking a proxy that upgrades to it, by delegating to itself until out of gas. Thus it is critical that this function revert if invoked through a proxy. This is guaranteed by the if statement."
+      },
+      "setDisputeTemplate(string,string,string)": {
+        "params": {
+          "_templateData": "The template data.",
+          "_templateDataMappings": "The data mappings for the template.",
+          "_templateTag": "An optional tag for the dispute template, such as \"registration\" or \"removal\"."
+        },
+        "returns": {
+          "templateId": "The identifier of the dispute template."
+        }
+      },
+      "upgradeToAndCall(address,bytes)": {
+        "details": "Reverts if the execution is not performed via delegatecall or the execution context is not of a proxy with an ERC1967-compliant implementation pointing to self.",
+        "params": {
+          "data": "Data used in a delegate call to `newImplementation` if non-empty. This will typically be an encoded function call, and allows initializing the storage of the proxy like a Solidity constructor.",
+          "newImplementation": "Address of the new implementation contract."
+        }
+      }
+    },
+    "stateVariables": {
+      "version": {
+        "return": "Version string.",
+        "returns": {
+          "_0": "Version string."
+        }
+      }
+    },
+    "title": "Dispute Template Registry",
+    "version": 1
+  },
+  "userdoc": {
+    "errors": {
+      "FailedDelegateCall()": [
+        {
+          "notice": "Failed Delegated call"
+        }
+      ],
+      "InvalidImplementation(address)": [
+        {
+          "notice": "The `implementation` is not UUPS-compliant"
+        }
+      ],
+      "UUPSUnauthorizedCallContext()": [
+        {
+          "notice": "The call is from an unauthorized context."
+        }
+      ],
+      "UUPSUnsupportedProxiableUUID(bytes32)": [
+        {
+          "notice": "The storage `slot` is unsupported as a UUID."
+        }
+      ]
+    },
+    "events": {
+      "DisputeTemplate(uint256,string,string,string)": {
+        "notice": "To be emitted when a new dispute template is created."
+      },
+      "Upgraded(address)": {
+        "notice": "Emitted when the `implementation` has been successfully upgraded."
+      }
+    },
+    "kind": "user",
+    "methods": {
+      "changeOwner(address)": {
+        "notice": "Changes the owner of the contract."
+      },
+      "initialize(address)": {
+        "notice": "Initializer"
+      },
+      "owner()": {
+        "notice": "The owner of the contract."
+      },
+      "proxiableUUID()": {
+        "notice": "Implementation of the ERC1822 `proxiableUUID` function. This returns the storage slot used by the implementation. It is used to validate the implementation's compatibility when performing an upgrade."
+      },
+      "setDisputeTemplate(string,string,string)": {
+        "notice": "Registers a new dispute template."
+      },
+      "templates()": {
+        "notice": "The number of templates."
+      },
+      "upgradeToAndCall(address,bytes)": {
+        "notice": "Upgrade mechanism including access control and UUPS-compliance."
+      },
+      "version()": {
+        "notice": "Returns the version of the implementation."
+      }
+    },
+    "notice": "A contract to maintain a registry of dispute templates.",
+    "version": 1
+  },
+  "storageLayout": {
+    "storage": [
+      {
+        "astId": 11041,
+        "contract": "src/arbitration/DisputeTemplateRegistry.sol:DisputeTemplateRegistry",
+        "label": "owner",
+        "offset": 0,
+        "slot": "0",
+        "type": "t_address"
+      },
+      {
+        "astId": 11044,
+        "contract": "src/arbitration/DisputeTemplateRegistry.sol:DisputeTemplateRegistry",
+        "label": "templates",
+        "offset": 0,
+        "slot": "1",
+        "type": "t_uint256"
+      }
+    ],
+    "types": {
+      "t_address": {
+        "encoding": "inplace",
+        "label": "address",
+        "numberOfBytes": "20"
+      },
+      "t_uint256": {
+        "encoding": "inplace",
+        "label": "uint256",
+        "numberOfBytes": "32"
+      }
+    }
+  }
+}
diff --git a/contracts/deployments/arbitrumSepoliaDevnet/DisputeTemplateRegistryUniversity_Proxy.json b/contracts/deployments/arbitrumSepoliaDevnet/DisputeTemplateRegistryUniversity_Proxy.json
new file mode 100644
index 000000000..618d75a4e
--- /dev/null
+++ b/contracts/deployments/arbitrumSepoliaDevnet/DisputeTemplateRegistryUniversity_Proxy.json
@@ -0,0 +1,81 @@
+{
+  "address": "0x75A5D16e9A699162506E4d79D68CF646e6600ba1",
+  "abi": [
+    {
+      "inputs": [
+        {
+          "internalType": "address",
+          "name": "_implementation",
+          "type": "address"
+        },
+        {
+          "internalType": "bytes",
+          "name": "_data",
+          "type": "bytes"
+        }
+      ],
+      "stateMutability": "nonpayable",
+      "type": "constructor"
+    },
+    {
+      "stateMutability": "payable",
+      "type": "fallback"
+    },
+    {
+      "stateMutability": "payable",
+      "type": "receive"
+    }
+  ],
+  "transactionHash": "0xbc50b201f6d4dfa0a74e83aeb201df1f0390ab361ba76bf72a696a36d3a5ffe4",
+  "receipt": {
+    "to": null,
+    "from": "0xf1C7c037891525E360C59f708739Ac09A7670c59",
+    "contractAddress": "0x75A5D16e9A699162506E4d79D68CF646e6600ba1",
+    "transactionIndex": 1,
+    "gasUsed": "157979",
+    "logsBloom": "0x00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000080000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002000000000000000000000800000000000000000000000080000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004000000000000000000000004000000000000000000000000000000000000000000000000000000000000",
+    "blockHash": "0x9656d572eb28bbdc716c7b34860d4e05442e4a488ce69c9f410f69a3d125df0c",
+    "transactionHash": "0xbc50b201f6d4dfa0a74e83aeb201df1f0390ab361ba76bf72a696a36d3a5ffe4",
+    "logs": [
+      {
+        "transactionIndex": 1,
+        "blockNumber": 193661064,
+        "transactionHash": "0xbc50b201f6d4dfa0a74e83aeb201df1f0390ab361ba76bf72a696a36d3a5ffe4",
+        "address": "0x75A5D16e9A699162506E4d79D68CF646e6600ba1",
+        "topics": [
+          "0xc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d2"
+        ],
+        "data": "0x0000000000000000000000000000000000000000000000000000000000000001",
+        "logIndex": 0,
+        "blockHash": "0x9656d572eb28bbdc716c7b34860d4e05442e4a488ce69c9f410f69a3d125df0c"
+      }
+    ],
+    "blockNumber": 193661064,
+    "cumulativeGasUsed": "157979",
+    "status": 1,
+    "byzantium": true
+  },
+  "args": [
+    "0xC3f638389635bF33E019c845FdaF2ed9bca3DF67",
+    "0xc4d66de8000000000000000000000000f1c7c037891525e360c59f708739ac09a7670c59"
+  ],
+  "numDeployments": 1,
+  "solcInputHash": "cff4f5de661c6299ed3bdc0f8613457a",
+  "metadata": "{\"compiler\":{\"version\":\"0.8.30+commit.73712a01\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_implementation\",\"type\":\"address\"},{\"internalType\":\"bytes\",\"name\":\"_data\",\"type\":\"bytes\"}],\"stateMutability\":\"nonpayable\",\"type\":\"constructor\"},{\"stateMutability\":\"payable\",\"type\":\"fallback\"},{\"stateMutability\":\"payable\",\"type\":\"receive\"}],\"devdoc\":{\"kind\":\"dev\",\"methods\":{},\"version\":1},\"userdoc\":{\"kind\":\"user\",\"methods\":{},\"version\":1}},\"settings\":{\"compilationTarget\":{\"src/proxy/KlerosProxies.sol\":\"DisputeTemplateRegistryUniversityProxy\"},\"evmVersion\":\"cancun\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\",\"useLiteralContent\":true},\"optimizer\":{\"enabled\":true,\"runs\":1000},\"remappings\":[],\"viaIR\":true},\"sources\":{\"src/proxy/KlerosProxies.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\nimport \\\"./UUPSProxy.sol\\\";\\n\\n/// Workaround to get meaningful names for the proxy contracts\\n/// Otherwise all the contracts are called `UUPSProxy` on the chain explorers\\n\\ncontract DisputeKitClassicUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitClassicProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitGatedProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitGatedShutterProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitShutterProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitSybilResistantProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeTemplateRegistryUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeTemplateRegistryProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract EvidenceModuleProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract ForeignGatewayOnEthereumProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract HomeGatewayToEthereumProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreRulerProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract PolicyRegistryProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract RandomizerRNGProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\",\"keccak256\":\"0x9dbd26ac5a026a32fc38e394188ab4a8dce0d7e8f249fa1412f757611f948767\",\"license\":\"MIT\"},\"src/proxy/UUPSProxy.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\n/// @title UUPS Proxy\\n/// @author Simon Malatrait <simon.malatrait@grenoble-inp.org>\\n/// @notice This contract implements a UUPS Proxy compliant with ERC-1967 & ERC-1822.\\n///\\n/// @dev This contract delegates all calls to another contract (UUPS Proxiable) through a fallback function and the use of the `delegatecall` EVM instruction.\\n/// We refer to the Proxiable contract (as per ERC-1822) with `implementation`.\\n/// Adapted from <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/ERC1967/ERC1967Proxy.sol>\\ncontract UUPSProxy {\\n    /// @dev Storage slot with the address of the current implementation.\\n    /// This is the keccak-256 hash of \\\"eip1967.proxy.implementation\\\" subtracted by 1, and is\\n    /// validated in the constructor.\\n    /// NOTE: bytes32(uint256(keccak256('eip1967.proxy.implementation')) - 1)\\n    bytes32 private constant IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;\\n\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    /// @notice Initializes the upgradeable proxy with an initial implementation specified by `_implementation`.\\n    /// @dev If `_data` is nonempty, it's used as data in a delegate call to `_implementation`.\\n    /// This will typically be an encoded function call, and allows initializing the storage of the proxy like a Solidity constructor.\\n    constructor(address _implementation, bytes memory _data) {\\n        assembly {\\n            sstore(IMPLEMENTATION_SLOT, _implementation)\\n        }\\n\\n        if (_data.length != 0) {\\n            (bool success, ) = _implementation.delegatecall(_data);\\n            require(success, \\\"Proxy Constructor failed\\\");\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @dev Delegates the current call to `implementation`.\\n    /// NOTE: This function does not return to its internal call site, it will return directly to the external caller.\\n    function _delegate(address implementation) internal {\\n        assembly {\\n            // Copy msg.data. We take full control of memory in this inline assembly\\n            // block because it will not return to Solidity code. We overwrite the\\n            // Solidity scratch pad at memory position 0.\\n            calldatacopy(0, 0, calldatasize())\\n\\n            // Call the implementation.\\n            // out and outsize are 0 because we don't know the size yet.\\n            let result := delegatecall(gas(), implementation, 0, calldatasize(), 0, 0)\\n\\n            // Copy the returned data.\\n            returndatacopy(0, 0, returndatasize())\\n\\n            switch result\\n            // delegatecall returns 0 on error.\\n            case 0 {\\n                revert(0, returndatasize())\\n            }\\n            default {\\n                return(0, returndatasize())\\n            }\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Internal Views            * //\\n    // ************************************* //\\n\\n    function _getImplementation() internal view returns (address implementation) {\\n        assembly {\\n            implementation := sload(IMPLEMENTATION_SLOT)\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Fallback                * //\\n    // ************************************* //\\n\\n    /// @dev Fallback function that delegates calls to the address returned by `_implementation()`.\\n    /// @dev Will run if no other function in the contract matches the call data.\\n    fallback() external payable {\\n        _delegate(_getImplementation());\\n    }\\n\\n    receive() external payable {\\n        _delegate(_getImplementation());\\n    }\\n}\\n\",\"keccak256\":\"0x2d7b1f81e525787f1b8b033ce381a81cb5f39e411ff31490e019113205a661cd\",\"license\":\"MIT\"}},\"version\":1}",
+  "bytecode": "0x608060405234610144576102148038038061001981610148565b928339810190604081830312610144578051906001600160a01b0382168203610144576020810151906001600160401b038211610144570182601f8201121561014457805161006f61006a82610181565b610148565b9181835260208301946020838301011161014457815f926020809301875e83010152817f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5551806100c9575b6040516077908161019d8239f35b5f9283925af43d1561013f573d6100e261006a82610181565b9081525f60203d92013e5b156100fa575f80806100bb565b60405162461bcd60e51b815260206004820152601860248201527f50726f787920436f6e7374727563746f72206661696c656400000000000000006044820152606490fd5b6100ed565b5f80fd5b6040519190601f01601f191682016001600160401b0381118382101761016d57604052565b634e487b7160e01b5f52604160045260245ffd5b6001600160401b03811161016d57601f01601f19166020019056fe60806040525f807f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc54368280378136915af43d5f803e15603d573d5ff35b3d5ffdfea2646970667358221220e347285b4ca364b0c82598fe294ad8b02e9adfbbac26ab00c24b1b747375019464736f6c634300081e0033",
+  "deployedBytecode": "0x60806040525f807f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc54368280378136915af43d5f803e15603d573d5ff35b3d5ffdfea2646970667358221220e347285b4ca364b0c82598fe294ad8b02e9adfbbac26ab00c24b1b747375019464736f6c634300081e0033",
+  "devdoc": {
+    "kind": "dev",
+    "methods": {},
+    "version": 1
+  },
+  "userdoc": {
+    "kind": "user",
+    "methods": {},
+    "version": 1
+  },
+  "storageLayout": {
+    "storage": [],
+    "types": null
+  }
+}
diff --git a/contracts/deployments/arbitrumSepoliaDevnet/KlerosCoreUniversity.json b/contracts/deployments/arbitrumSepoliaDevnet/KlerosCoreUniversity.json
index b6b4080c4..f5511de8f 100644
--- a/contracts/deployments/arbitrumSepoliaDevnet/KlerosCoreUniversity.json
+++ b/contracts/deployments/arbitrumSepoliaDevnet/KlerosCoreUniversity.json
@@ -1,5 +1,5 @@
 {
-  "address": "0x5AB37F38778Bc175852fA353056591D91c744ce6",
+  "address": "0xA34dBBD0E5e1d09bd683455f9dbC393797BC558f",
   "abi": [
     {
       "stateMutability": "payable",
@@ -34,11 +34,6 @@
       "name": "ArbitrationFeesNotEnough",
       "type": "error"
     },
-    {
-      "inputs": [],
-      "name": "ArraysLengthMismatch",
-      "type": "error"
-    },
     {
       "inputs": [],
       "name": "CannotDisableClassicDK",
@@ -49,11 +44,6 @@
       "name": "CommitPeriodNotPassed",
       "type": "error"
     },
-    {
-      "inputs": [],
-      "name": "DepthLevelMax",
-      "type": "error"
-    },
     {
       "inputs": [],
       "name": "DisputeKitNotSupportedByCourt",
@@ -89,16 +79,6 @@
       "name": "FailedDelegateCall",
       "type": "error"
     },
-    {
-      "inputs": [],
-      "name": "GovernorOnly",
-      "type": "error"
-    },
-    {
-      "inputs": [],
-      "name": "GovernorOrInstructorOnly",
-      "type": "error"
-    },
     {
       "inputs": [],
       "name": "InstructorOnly",
@@ -155,6 +135,16 @@
       "name": "NotInitializing",
       "type": "error"
     },
+    {
+      "inputs": [],
+      "name": "OwnerOnly",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "OwnerOrInstructorOnly",
+      "type": "error"
+    },
     {
       "inputs": [],
       "name": "RulingAlreadyExecuted",
@@ -177,7 +167,7 @@
     },
     {
       "inputs": [],
-      "name": "StakingNotPossibeInThisCourt",
+      "name": "StakingNotPossibleInThisCourt",
       "type": "error"
     },
     {
@@ -185,6 +175,11 @@
       "name": "StakingTransferFailed",
       "type": "error"
     },
+    {
+      "inputs": [],
+      "name": "StakingZeroWhenNoStake",
+      "type": "error"
+    },
     {
       "inputs": [],
       "name": "TokenNotAccepted",
@@ -298,9 +293,9 @@
       "inputs": [
         {
           "indexed": true,
-          "internalType": "uint256",
+          "internalType": "uint96",
           "name": "_courtID",
-          "type": "uint256"
+          "type": "uint96"
         },
         {
           "indexed": true,
@@ -575,6 +570,12 @@
     {
       "anonymous": false,
       "inputs": [
+        {
+          "indexed": true,
+          "internalType": "address",
+          "name": "_account",
+          "type": "address"
+        },
         {
           "indexed": true,
           "internalType": "uint256",
@@ -590,13 +591,62 @@
         {
           "indexed": false,
           "internalType": "uint256",
-          "name": "_pnkAmount",
+          "name": "_degreeOfCoherencyPnk",
           "type": "uint256"
         },
         {
           "indexed": false,
           "internalType": "uint256",
-          "name": "_feeAmount",
+          "name": "_degreeOfCoherencyFee",
+          "type": "uint256"
+        },
+        {
+          "indexed": false,
+          "internalType": "int256",
+          "name": "_amountPnk",
+          "type": "int256"
+        },
+        {
+          "indexed": false,
+          "internalType": "int256",
+          "name": "_amountFee",
+          "type": "int256"
+        },
+        {
+          "indexed": false,
+          "internalType": "contract IERC20",
+          "name": "_feeToken",
+          "type": "address"
+        }
+      ],
+      "name": "JurorRewardPenalty",
+      "type": "event"
+    },
+    {
+      "anonymous": false,
+      "inputs": [
+        {
+          "indexed": true,
+          "internalType": "uint256",
+          "name": "_disputeID",
+          "type": "uint256"
+        },
+        {
+          "indexed": true,
+          "internalType": "uint256",
+          "name": "_roundID",
+          "type": "uint256"
+        },
+        {
+          "indexed": false,
+          "internalType": "uint256",
+          "name": "_amountPnk",
+          "type": "uint256"
+        },
+        {
+          "indexed": false,
+          "internalType": "uint256",
+          "name": "_amountFee",
           "type": "uint256"
         },
         {
@@ -678,55 +728,6 @@
       "name": "Ruling",
       "type": "event"
     },
-    {
-      "anonymous": false,
-      "inputs": [
-        {
-          "indexed": true,
-          "internalType": "address",
-          "name": "_account",
-          "type": "address"
-        },
-        {
-          "indexed": true,
-          "internalType": "uint256",
-          "name": "_disputeID",
-          "type": "uint256"
-        },
-        {
-          "indexed": true,
-          "internalType": "uint256",
-          "name": "_roundID",
-          "type": "uint256"
-        },
-        {
-          "indexed": false,
-          "internalType": "uint256",
-          "name": "_degreeOfCoherency",
-          "type": "uint256"
-        },
-        {
-          "indexed": false,
-          "internalType": "int256",
-          "name": "_pnkAmount",
-          "type": "int256"
-        },
-        {
-          "indexed": false,
-          "internalType": "int256",
-          "name": "_feeAmount",
-          "type": "int256"
-        },
-        {
-          "indexed": false,
-          "internalType": "contract IERC20",
-          "name": "_feeToken",
-          "type": "address"
-        }
-      ],
-      "name": "TokenAndETHShift",
-      "type": "event"
-    },
     {
       "anonymous": false,
       "inputs": [
@@ -949,12 +950,12 @@
     {
       "inputs": [
         {
-          "internalType": "address payable",
-          "name": "_governor",
+          "internalType": "address",
+          "name": "_instructor",
           "type": "address"
         }
       ],
-      "name": "changeGovernor",
+      "name": "changeInstructor",
       "outputs": [],
       "stateMutability": "nonpayable",
       "type": "function"
@@ -963,11 +964,11 @@
       "inputs": [
         {
           "internalType": "address",
-          "name": "_instructor",
+          "name": "_jurorProsecutionModule",
           "type": "address"
         }
       ],
-      "name": "changeInstructor",
+      "name": "changeJurorProsecutionModule",
       "outputs": [],
       "stateMutability": "nonpayable",
       "type": "function"
@@ -975,12 +976,12 @@
     {
       "inputs": [
         {
-          "internalType": "address",
-          "name": "_jurorProsecutionModule",
+          "internalType": "address payable",
+          "name": "_owner",
           "type": "address"
         }
       ],
-      "name": "changeJurorProsecutionModule",
+      "name": "changeOwner",
       "outputs": [],
       "stateMutability": "nonpayable",
       "type": "function"
@@ -1074,11 +1075,6 @@
           "internalType": "uint256",
           "name": "jurorsForCourtJump",
           "type": "uint256"
-        },
-        {
-          "internalType": "bool",
-          "name": "disabled",
-          "type": "bool"
         }
       ],
       "stateMutability": "view",
@@ -1388,7 +1384,7 @@
           "type": "bytes"
         }
       ],
-      "name": "executeGovernorProposal",
+      "name": "executeOwnerProposal",
       "outputs": [],
       "stateMutability": "nonpayable",
       "type": "function"
@@ -1457,6 +1453,30 @@
       "stateMutability": "view",
       "type": "function"
     },
+    {
+      "inputs": [
+        {
+          "internalType": "uint256",
+          "name": "_disputeID",
+          "type": "uint256"
+        },
+        {
+          "internalType": "uint256",
+          "name": "_round",
+          "type": "uint256"
+        }
+      ],
+      "name": "getPnkAtStakePerJuror",
+      "outputs": [
+        {
+          "internalType": "uint256",
+          "name": "",
+          "type": "uint256"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
     {
       "inputs": [
         {
@@ -1509,6 +1529,11 @@
               "name": "drawnJurors",
               "type": "address[]"
             },
+            {
+              "internalType": "uint96[]",
+              "name": "drawnJurorFromCourtIDs",
+              "type": "uint96[]"
+            },
             {
               "internalType": "uint256",
               "name": "sumFeeRewardPaid",
@@ -1528,6 +1553,11 @@
               "internalType": "uint256",
               "name": "drawIterations",
               "type": "uint256"
+            },
+            {
+              "internalType": "uint256[10]",
+              "name": "__gap",
+              "type": "uint256[10]"
             }
           ],
           "internalType": "struct KlerosCoreUniversity.Round",
@@ -1557,24 +1587,11 @@
       "stateMutability": "view",
       "type": "function"
     },
-    {
-      "inputs": [],
-      "name": "governor",
-      "outputs": [
-        {
-          "internalType": "address",
-          "name": "",
-          "type": "address"
-        }
-      ],
-      "stateMutability": "view",
-      "type": "function"
-    },
     {
       "inputs": [
         {
           "internalType": "address",
-          "name": "_governor",
+          "name": "_owner",
           "type": "address"
         },
         {
@@ -1692,6 +1709,19 @@
       "stateMutability": "view",
       "type": "function"
     },
+    {
+      "inputs": [],
+      "name": "owner",
+      "outputs": [
+        {
+          "internalType": "address",
+          "name": "",
+          "type": "address"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
     {
       "inputs": [
         {
@@ -1765,11 +1795,6 @@
           "internalType": "uint256",
           "name": "_newStake",
           "type": "uint256"
-        },
-        {
-          "internalType": "bool",
-          "name": "_alreadyTransferred",
-          "type": "bool"
         }
       ],
       "name": "setStakeBySortitionModule",
@@ -1790,6 +1815,24 @@
       "stateMutability": "view",
       "type": "function"
     },
+    {
+      "inputs": [
+        {
+          "internalType": "address",
+          "name": "_account",
+          "type": "address"
+        },
+        {
+          "internalType": "uint256",
+          "name": "_amount",
+          "type": "uint256"
+        }
+      ],
+      "name": "transferBySortitionModule",
+      "outputs": [],
+      "stateMutability": "nonpayable",
+      "type": "function"
+    },
     {
       "inputs": [
         {
@@ -1808,6 +1851,19 @@
       "stateMutability": "payable",
       "type": "function"
     },
+    {
+      "inputs": [],
+      "name": "version",
+      "outputs": [
+        {
+          "internalType": "string",
+          "name": "",
+          "type": "string"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
     {
       "inputs": [
         {
@@ -1825,50 +1881,50 @@
       "type": "constructor"
     }
   ],
-  "transactionHash": "0x6d19fdb430b5611f9aedf5792b44a297c36bd84d34e66ddaf82844f33eb1748a",
+  "transactionHash": "0x998456e4bf88144d618ef98fb44d1c7bb857cbbbefe8b7c523399abc23f581c1",
   "receipt": {
     "to": null,
     "from": "0xf1C7c037891525E360C59f708739Ac09A7670c59",
-    "contractAddress": "0x5AB37F38778Bc175852fA353056591D91c744ce6",
-    "transactionIndex": 1,
-    "gasUsed": "484460",
-    "logsBloom": "0x00000000000000000000000020000000000000000000000000000000020000000000000000000000000000000000000000000000000000000000000000040000000000000000000000000000000080000000000000040000000000000000000000000000020000000000000010200800402000000000000008000000000000008000000000000000000800000000000000000000000080000000000000000000000000000000800008000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004000000000000000060000000001001000000000000000000000008000000000200000000000000000000",
-    "blockHash": "0x152fd5195e3f7b8e0ab803f90700d35d20f4452193858d10558fc31c226227c8",
-    "transactionHash": "0x6d19fdb430b5611f9aedf5792b44a297c36bd84d34e66ddaf82844f33eb1748a",
+    "contractAddress": "0xA34dBBD0E5e1d09bd683455f9dbC393797BC558f",
+    "transactionIndex": 2,
+    "gasUsed": "453977",
+    "logsBloom": "0x000000000000000000000000200000000000000000000000000000000200000000000000000000000000000000000000000000000000000000000000000400000000000000000000000000000000000000800000000400000000000000000000000000000200000000000000100008004020000000000000000000000000040000008000000000000008000000000000000000000000800000000000100000000000000000000000080000000000000000000000000000000000000000000000000000000000000000000000000000000000000000040000000000000000e4000000001000000000000001000000000000000000000000000800000000000000",
+    "blockHash": "0xe5a6d446390c5a4cfe779ab765b5c591e177b2dcfe4263135a1943f55babc82f",
+    "transactionHash": "0x998456e4bf88144d618ef98fb44d1c7bb857cbbbefe8b7c523399abc23f581c1",
     "logs": [
       {
-        "transactionIndex": 1,
-        "blockNumber": 96308609,
-        "transactionHash": "0x6d19fdb430b5611f9aedf5792b44a297c36bd84d34e66ddaf82844f33eb1748a",
-        "address": "0x5AB37F38778Bc175852fA353056591D91c744ce6",
+        "transactionIndex": 2,
+        "blockNumber": 193533818,
+        "transactionHash": "0x998456e4bf88144d618ef98fb44d1c7bb857cbbbefe8b7c523399abc23f581c1",
+        "address": "0xA34dBBD0E5e1d09bd683455f9dbC393797BC558f",
         "topics": [
           "0x44063d258760b98116d53815adbc906a56b3563e540148cc0fc2457f83b5eeb2",
           "0x0000000000000000000000000000000000000000000000000000000000000001",
-          "0x000000000000000000000000d6e96b7c993763b5cdda1139c7387b82a7c8b8b5"
+          "0x00000000000000000000000082f2089442979a6b56c80274d144575980092f91"
         ],
         "data": "0x",
-        "logIndex": 0,
-        "blockHash": "0x152fd5195e3f7b8e0ab803f90700d35d20f4452193858d10558fc31c226227c8"
+        "logIndex": 3,
+        "blockHash": "0xe5a6d446390c5a4cfe779ab765b5c591e177b2dcfe4263135a1943f55babc82f"
       },
       {
-        "transactionIndex": 1,
-        "blockNumber": 96308609,
-        "transactionHash": "0x6d19fdb430b5611f9aedf5792b44a297c36bd84d34e66ddaf82844f33eb1748a",
-        "address": "0x5AB37F38778Bc175852fA353056591D91c744ce6",
+        "transactionIndex": 2,
+        "blockNumber": 193533818,
+        "transactionHash": "0x998456e4bf88144d618ef98fb44d1c7bb857cbbbefe8b7c523399abc23f581c1",
+        "address": "0xA34dBBD0E5e1d09bd683455f9dbC393797BC558f",
         "topics": [
-          "0x3475f0ed7216dd7d453db663a1c3024e4f36cc925521d54edb9d13e022cbee3d",
+          "0x550ff678017abc294b4786a99a046628d5a1eac07be0f1ea7e89543f13576ee6",
           "0x0000000000000000000000000000000000000000000000000000000000000001",
           "0x0000000000000000000000000000000000000000000000000000000000000000"
         ],
         "data": "0x000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ad78ebc5ac62000000000000000000000000000000000000000000000000000000000000000002710000000000000000000000000000000000000000000000000016345785d8a00000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000a00000000000000000000000000000000000000000000000000000000000001400000000000000000000000000000000000000000000000000000000000000000",
-        "logIndex": 1,
-        "blockHash": "0x152fd5195e3f7b8e0ab803f90700d35d20f4452193858d10558fc31c226227c8"
+        "logIndex": 4,
+        "blockHash": "0xe5a6d446390c5a4cfe779ab765b5c591e177b2dcfe4263135a1943f55babc82f"
       },
       {
-        "transactionIndex": 1,
-        "blockNumber": 96308609,
-        "transactionHash": "0x6d19fdb430b5611f9aedf5792b44a297c36bd84d34e66ddaf82844f33eb1748a",
-        "address": "0x5AB37F38778Bc175852fA353056591D91c744ce6",
+        "transactionIndex": 2,
+        "blockNumber": 193533818,
+        "transactionHash": "0x998456e4bf88144d618ef98fb44d1c7bb857cbbbefe8b7c523399abc23f581c1",
+        "address": "0xA34dBBD0E5e1d09bd683455f9dbC393797BC558f",
         "topics": [
           "0xb47629acdf64971062d40984f77d3dee212d735b11e3e8c7a4222d9f0572cc79",
           "0x0000000000000000000000000000000000000000000000000000000000000001",
@@ -1876,36 +1932,36 @@
           "0x0000000000000000000000000000000000000000000000000000000000000001"
         ],
         "data": "0x",
-        "logIndex": 2,
-        "blockHash": "0x152fd5195e3f7b8e0ab803f90700d35d20f4452193858d10558fc31c226227c8"
+        "logIndex": 5,
+        "blockHash": "0xe5a6d446390c5a4cfe779ab765b5c591e177b2dcfe4263135a1943f55babc82f"
       },
       {
-        "transactionIndex": 1,
-        "blockNumber": 96308609,
-        "transactionHash": "0x6d19fdb430b5611f9aedf5792b44a297c36bd84d34e66ddaf82844f33eb1748a",
-        "address": "0x5AB37F38778Bc175852fA353056591D91c744ce6",
+        "transactionIndex": 2,
+        "blockNumber": 193533818,
+        "transactionHash": "0x998456e4bf88144d618ef98fb44d1c7bb857cbbbefe8b7c523399abc23f581c1",
+        "address": "0xA34dBBD0E5e1d09bd683455f9dbC393797BC558f",
         "topics": [
           "0xc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d2"
         ],
         "data": "0x0000000000000000000000000000000000000000000000000000000000000001",
-        "logIndex": 3,
-        "blockHash": "0x152fd5195e3f7b8e0ab803f90700d35d20f4452193858d10558fc31c226227c8"
+        "logIndex": 6,
+        "blockHash": "0xe5a6d446390c5a4cfe779ab765b5c591e177b2dcfe4263135a1943f55babc82f"
       }
     ],
-    "blockNumber": 96308609,
-    "cumulativeGasUsed": "484460",
+    "blockNumber": 193533818,
+    "cumulativeGasUsed": "582464",
     "status": 1,
     "byzantium": true
   },
   "args": [
-    "0xF74DaBfC5F5dbdBD07636637204d9C35326D2906",
-    "0xe399d29b000000000000000000000000f1c7c037891525e360c59f708739ac09a7670c59000000000000000000000000f1c7c037891525e360c59f708739ac09a7670c5900000000000000000000000034b944d42cacfc8266955d07a80181d2054aa2250000000000000000000000000000000000000000000000000000000000000000000000000000000000000000d6e96b7c993763b5cdda1139c7387b82a7c8b8b5000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ad78ebc5ac62000000000000000000000000000000000000000000000000000000000000000002710000000000000000000000000000000000000000000000000016345785d8a00000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000a0000000000000000000000004b2c2d048921f694cce3aea35698c6b1f5fcbb79"
+    "0xb75b0cc01af4aD0D65D50082ae0717004D479Aa0",
+    "0xe399d29b000000000000000000000000f1c7c037891525e360c59f708739ac09a7670c59000000000000000000000000f1c7c037891525e360c59f708739ac09a7670c5900000000000000000000000034b944d42cacfc8266955d07a80181d2054aa225000000000000000000000000000000000000000000000000000000000000000000000000000000000000000082f2089442979a6b56c80274d144575980092f91000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ad78ebc5ac62000000000000000000000000000000000000000000000000000000000000000002710000000000000000000000000000000000000000000000000016345785d8a00000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000a0000000000000000000000009f55804177e7e44e558616cd7d06b865788214ca"
   ],
   "numDeployments": 1,
-  "solcInputHash": "a5602534c00c2f67ca4b6a1cab8c717e",
-  "metadata": "{\"compiler\":{\"version\":\"0.8.24+commit.e11b9ed9\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_implementation\",\"type\":\"address\"},{\"internalType\":\"bytes\",\"name\":\"_data\",\"type\":\"bytes\"}],\"stateMutability\":\"nonpayable\",\"type\":\"constructor\"},{\"stateMutability\":\"payable\",\"type\":\"fallback\"},{\"stateMutability\":\"payable\",\"type\":\"receive\"}],\"devdoc\":{\"kind\":\"dev\",\"methods\":{},\"version\":1},\"userdoc\":{\"kind\":\"user\",\"methods\":{},\"version\":1}},\"settings\":{\"compilationTarget\":{\"src/proxy/KlerosProxies.sol\":\"KlerosCoreUniversityProxy\"},\"evmVersion\":\"paris\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\",\"useLiteralContent\":true},\"optimizer\":{\"enabled\":true,\"runs\":100},\"remappings\":[]},\"sources\":{\"src/proxy/KlerosProxies.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n\\npragma solidity 0.8.24;\\n\\nimport \\\"./UUPSProxy.sol\\\";\\n\\n/// Workaround to get meaningful names for the proxy contracts\\n/// Otherwise all the contracts are called `UUPSProxy` on the chain explorers\\n\\ncontract DisputeKitClassicNeoProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitClassicUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitClassicProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeTemplateRegistryProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract EvidenceModuleProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract ForeignGatewayOnEthereumProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract HomeGatewayToEthereumProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreNeoProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreRulerProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract PolicyRegistryProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract RandomizerRNGProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleNeoProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\",\"keccak256\":\"0x4393c05bbfda204b9992e1e546142a0fbf4c92a1c4061f5985463d02a71b84d4\",\"license\":\"MIT\"},\"src/proxy/UUPSProxy.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n// Adapted from <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/ERC1967/ERC1967Proxy.sol>\\n\\n/**\\n *  @authors: [@malatrax]\\n *  @reviewers: []\\n *  @auditors: []\\n *  @bounties: []\\n *  @deployments: []\\n */\\npragma solidity 0.8.24;\\n\\n/**\\n * @title UUPS Proxy\\n * @author Simon Malatrait <simon.malatrait@grenoble-inp.org>\\n * @dev This contract implements a UUPS Proxy compliant with ERC-1967 & ERC-1822.\\n * @dev This contract delegates all calls to another contract (UUPS Proxiable) through a fallback function and the use of the `delegatecall` EVM instruction.\\n * @dev We refer to the Proxiable contract (as per ERC-1822) with `implementation`.\\n */\\ncontract UUPSProxy {\\n    /**\\n     * @dev Storage slot with the address of the current implementation.\\n     * This is the keccak-256 hash of \\\"eip1967.proxy.implementation\\\" subtracted by 1, and is\\n     * validated in the constructor.\\n     * NOTE: bytes32(uint256(keccak256('eip1967.proxy.implementation')) - 1)\\n     */\\n    bytes32 private constant IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;\\n\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Initializes the upgradeable proxy with an initial implementation specified by `_implementation`.\\n     *\\n     * If `_data` is nonempty, it's used as data in a delegate call to `_implementation`. This will typically be an encoded\\n     * function call, and allows initializing the storage of the proxy like a Solidity constructor.\\n     */\\n    constructor(address _implementation, bytes memory _data) {\\n        assembly {\\n            sstore(IMPLEMENTATION_SLOT, _implementation)\\n        }\\n\\n        if (_data.length != 0) {\\n            (bool success, ) = _implementation.delegatecall(_data);\\n            require(success, \\\"Proxy Constructor failed\\\");\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Delegates the current call to `implementation`.\\n     *\\n     * NOTE: This function does not return to its internal call site, it will return directly to the external caller.\\n     */\\n    function _delegate(address implementation) internal {\\n        assembly {\\n            // Copy msg.data. We take full control of memory in this inline assembly\\n            // block because it will not return to Solidity code. We overwrite the\\n            // Solidity scratch pad at memory position 0.\\n            calldatacopy(0, 0, calldatasize())\\n\\n            // Call the implementation.\\n            // out and outsize are 0 because we don't know the size yet.\\n            let result := delegatecall(gas(), implementation, 0, calldatasize(), 0, 0)\\n\\n            // Copy the returned data.\\n            returndatacopy(0, 0, returndatasize())\\n\\n            switch result\\n            // delegatecall returns 0 on error.\\n            case 0 {\\n                revert(0, returndatasize())\\n            }\\n            default {\\n                return(0, returndatasize())\\n            }\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Internal Views            * //\\n    // ************************************* //\\n\\n    function _getImplementation() internal view returns (address implementation) {\\n        assembly {\\n            implementation := sload(IMPLEMENTATION_SLOT)\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Fallback                * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Fallback function that delegates calls to the address returned by `_implementation()`. Will run if no other\\n     * function in the contract matches the call data.\\n     */\\n    fallback() external payable {\\n        _delegate(_getImplementation());\\n    }\\n\\n    receive() external payable {\\n        _delegate(_getImplementation());\\n    }\\n}\\n\",\"keccak256\":\"0x7aa5f14ce351299722ac1a1afca9e65e1c795f32ea3e9702b0d5faaf7ca822a0\",\"license\":\"MIT\"}},\"version\":1}",
-  "bytecode": "0x608060405234801561001057600080fd5b5060405161030238038061030283398101604081905261002f91610151565b8181817f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc55805160001461010e576000826001600160a01b031682604051610077919061021f565b600060405180830381855af49150503d80600081146100b2576040519150601f19603f3d011682016040523d82523d6000602084013e6100b7565b606091505b505090508061010c5760405162461bcd60e51b815260206004820152601860248201527f50726f787920436f6e7374727563746f72206661696c65640000000000000000604482015260640160405180910390fd5b505b5050505061023b565b634e487b7160e01b600052604160045260246000fd5b60005b83811015610148578181015183820152602001610130565b50506000910152565b6000806040838503121561016457600080fd5b82516001600160a01b038116811461017b57600080fd5b60208401519092506001600160401b038082111561019857600080fd5b818501915085601f8301126101ac57600080fd5b8151818111156101be576101be610117565b604051601f8201601f19908116603f011681019083821181831017156101e6576101e6610117565b816040528281528860208487010111156101ff57600080fd5b61021083602083016020880161012d565b80955050505050509250929050565b6000825161023181846020870161012d565b9190910192915050565b60b9806102496000396000f3fe608060405236603757603560317f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5490565b6060565b005b603560317f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5490565b3660008037600080366000845af43d6000803e808015607e573d6000f35b3d6000fdfea2646970667358221220025ed3e852b24305c0ac2e202b83cf5fed6ae313e772bad4b0c1340efea75f0764736f6c63430008180033",
-  "deployedBytecode": "0x608060405236603757603560317f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5490565b6060565b005b603560317f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5490565b3660008037600080366000845af43d6000803e808015607e573d6000f35b3d6000fdfea2646970667358221220025ed3e852b24305c0ac2e202b83cf5fed6ae313e772bad4b0c1340efea75f0764736f6c63430008180033",
+  "solcInputHash": "d547d738900bce1310e91a5d1adfc179",
+  "metadata": "{\"compiler\":{\"version\":\"0.8.30+commit.73712a01\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_implementation\",\"type\":\"address\"},{\"internalType\":\"bytes\",\"name\":\"_data\",\"type\":\"bytes\"}],\"stateMutability\":\"nonpayable\",\"type\":\"constructor\"},{\"stateMutability\":\"payable\",\"type\":\"fallback\"},{\"stateMutability\":\"payable\",\"type\":\"receive\"}],\"devdoc\":{\"kind\":\"dev\",\"methods\":{},\"version\":1},\"userdoc\":{\"kind\":\"user\",\"methods\":{},\"version\":1}},\"settings\":{\"compilationTarget\":{\"src/proxy/KlerosProxies.sol\":\"KlerosCoreUniversityProxy\"},\"evmVersion\":\"cancun\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\",\"useLiteralContent\":true},\"optimizer\":{\"enabled\":true,\"runs\":1000},\"remappings\":[],\"viaIR\":true},\"sources\":{\"src/proxy/KlerosProxies.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\nimport \\\"./UUPSProxy.sol\\\";\\n\\n/// Workaround to get meaningful names for the proxy contracts\\n/// Otherwise all the contracts are called `UUPSProxy` on the chain explorers\\n\\ncontract DisputeKitClassicUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitClassicProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitGatedProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitGatedShutterProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitShutterProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitSybilResistantProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeTemplateRegistryProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract EvidenceModuleProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract ForeignGatewayOnEthereumProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract HomeGatewayToEthereumProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreRulerProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract PolicyRegistryProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract RandomizerRNGProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\",\"keccak256\":\"0x3160bd320b23c6ec0c21862b455c3044a9b33654ae84a1b6cd76255626c9154b\",\"license\":\"MIT\"},\"src/proxy/UUPSProxy.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\n/// @title UUPS Proxy\\n/// @author Simon Malatrait <simon.malatrait@grenoble-inp.org>\\n/// @notice This contract implements a UUPS Proxy compliant with ERC-1967 & ERC-1822.\\n///\\n/// @dev This contract delegates all calls to another contract (UUPS Proxiable) through a fallback function and the use of the `delegatecall` EVM instruction.\\n/// We refer to the Proxiable contract (as per ERC-1822) with `implementation`.\\n/// Adapted from <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/ERC1967/ERC1967Proxy.sol>\\ncontract UUPSProxy {\\n    /// @dev Storage slot with the address of the current implementation.\\n    /// This is the keccak-256 hash of \\\"eip1967.proxy.implementation\\\" subtracted by 1, and is\\n    /// validated in the constructor.\\n    /// NOTE: bytes32(uint256(keccak256('eip1967.proxy.implementation')) - 1)\\n    bytes32 private constant IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;\\n\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    /// @notice Initializes the upgradeable proxy with an initial implementation specified by `_implementation`.\\n    /// @dev If `_data` is nonempty, it's used as data in a delegate call to `_implementation`.\\n    /// This will typically be an encoded function call, and allows initializing the storage of the proxy like a Solidity constructor.\\n    constructor(address _implementation, bytes memory _data) {\\n        assembly {\\n            sstore(IMPLEMENTATION_SLOT, _implementation)\\n        }\\n\\n        if (_data.length != 0) {\\n            (bool success, ) = _implementation.delegatecall(_data);\\n            require(success, \\\"Proxy Constructor failed\\\");\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @dev Delegates the current call to `implementation`.\\n    /// NOTE: This function does not return to its internal call site, it will return directly to the external caller.\\n    function _delegate(address implementation) internal {\\n        assembly {\\n            // Copy msg.data. We take full control of memory in this inline assembly\\n            // block because it will not return to Solidity code. We overwrite the\\n            // Solidity scratch pad at memory position 0.\\n            calldatacopy(0, 0, calldatasize())\\n\\n            // Call the implementation.\\n            // out and outsize are 0 because we don't know the size yet.\\n            let result := delegatecall(gas(), implementation, 0, calldatasize(), 0, 0)\\n\\n            // Copy the returned data.\\n            returndatacopy(0, 0, returndatasize())\\n\\n            switch result\\n            // delegatecall returns 0 on error.\\n            case 0 {\\n                revert(0, returndatasize())\\n            }\\n            default {\\n                return(0, returndatasize())\\n            }\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Internal Views            * //\\n    // ************************************* //\\n\\n    function _getImplementation() internal view returns (address implementation) {\\n        assembly {\\n            implementation := sload(IMPLEMENTATION_SLOT)\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Fallback                * //\\n    // ************************************* //\\n\\n    /// @dev Fallback function that delegates calls to the address returned by `_implementation()`.\\n    /// @dev Will run if no other function in the contract matches the call data.\\n    fallback() external payable {\\n        _delegate(_getImplementation());\\n    }\\n\\n    receive() external payable {\\n        _delegate(_getImplementation());\\n    }\\n}\\n\",\"keccak256\":\"0x2d7b1f81e525787f1b8b033ce381a81cb5f39e411ff31490e019113205a661cd\",\"license\":\"MIT\"}},\"version\":1}",
+  "bytecode": "0x608060405234610144576102148038038061001981610148565b928339810190604081830312610144578051906001600160a01b0382168203610144576020810151906001600160401b038211610144570182601f8201121561014457805161006f61006a82610181565b610148565b9181835260208301946020838301011161014457815f926020809301875e83010152817f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5551806100c9575b6040516077908161019d8239f35b5f9283925af43d1561013f573d6100e261006a82610181565b9081525f60203d92013e5b156100fa575f80806100bb565b60405162461bcd60e51b815260206004820152601860248201527f50726f787920436f6e7374727563746f72206661696c656400000000000000006044820152606490fd5b6100ed565b5f80fd5b6040519190601f01601f191682016001600160401b0381118382101761016d57604052565b634e487b7160e01b5f52604160045260245ffd5b6001600160401b03811161016d57601f01601f19166020019056fe60806040525f807f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc54368280378136915af43d5f803e15603d573d5ff35b3d5ffdfea264697066735822122094c812c85dc437a2ab3eda19f621c1ecfc3fbf77e5465f816bde0529d28053a664736f6c634300081e0033",
+  "deployedBytecode": "0x60806040525f807f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc54368280378136915af43d5f803e15603d573d5ff35b3d5ffdfea264697066735822122094c812c85dc437a2ab3eda19f621c1ecfc3fbf77e5465f816bde0529d28053a664736f6c634300081e0033",
   "execute": {
     "methodName": "initialize",
     "args": [
@@ -1913,7 +1969,7 @@
       "0xf1C7c037891525E360C59f708739Ac09A7670c59",
       "0x34B944D42cAcfC8266955D07A80181D2054aa225",
       "0x0000000000000000000000000000000000000000",
-      "0xd6E96b7c993763B5CDDa1139C7387B82A7c8B8B5",
+      "0x82F2089442979A6b56c80274D144575980092F91",
       false,
       [
         "200000000000000000000",
@@ -1927,10 +1983,10 @@
         0,
         10
       ],
-      "0x4B2c2d048921f694cCE3AEa35698c6B1f5fcbb79"
+      "0x9f55804177e7E44E558616cD7d06B865788214cA"
     ]
   },
-  "implementation": "0xF74DaBfC5F5dbdBD07636637204d9C35326D2906",
+  "implementation": "0xb75b0cc01af4aD0D65D50082ae0717004D479Aa0",
   "devdoc": {
     "kind": "dev",
     "methods": {},
diff --git a/contracts/deployments/arbitrumSepoliaDevnet/KlerosCoreUniversity_Implementation.json b/contracts/deployments/arbitrumSepoliaDevnet/KlerosCoreUniversity_Implementation.json
index c8261658d..30c8cb622 100644
--- a/contracts/deployments/arbitrumSepoliaDevnet/KlerosCoreUniversity_Implementation.json
+++ b/contracts/deployments/arbitrumSepoliaDevnet/KlerosCoreUniversity_Implementation.json
@@ -1,5 +1,5 @@
 {
-  "address": "0xF74DaBfC5F5dbdBD07636637204d9C35326D2906",
+  "address": "0xb75b0cc01af4aD0D65D50082ae0717004D479Aa0",
   "abi": [
     {
       "inputs": [],
@@ -31,11 +31,6 @@
       "name": "ArbitrationFeesNotEnough",
       "type": "error"
     },
-    {
-      "inputs": [],
-      "name": "ArraysLengthMismatch",
-      "type": "error"
-    },
     {
       "inputs": [],
       "name": "CannotDisableClassicDK",
@@ -46,11 +41,6 @@
       "name": "CommitPeriodNotPassed",
       "type": "error"
     },
-    {
-      "inputs": [],
-      "name": "DepthLevelMax",
-      "type": "error"
-    },
     {
       "inputs": [],
       "name": "DisputeKitNotSupportedByCourt",
@@ -86,16 +76,6 @@
       "name": "FailedDelegateCall",
       "type": "error"
     },
-    {
-      "inputs": [],
-      "name": "GovernorOnly",
-      "type": "error"
-    },
-    {
-      "inputs": [],
-      "name": "GovernorOrInstructorOnly",
-      "type": "error"
-    },
     {
       "inputs": [],
       "name": "InstructorOnly",
@@ -152,6 +132,16 @@
       "name": "NotInitializing",
       "type": "error"
     },
+    {
+      "inputs": [],
+      "name": "OwnerOnly",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "OwnerOrInstructorOnly",
+      "type": "error"
+    },
     {
       "inputs": [],
       "name": "RulingAlreadyExecuted",
@@ -174,7 +164,7 @@
     },
     {
       "inputs": [],
-      "name": "StakingNotPossibeInThisCourt",
+      "name": "StakingNotPossibleInThisCourt",
       "type": "error"
     },
     {
@@ -182,6 +172,11 @@
       "name": "StakingTransferFailed",
       "type": "error"
     },
+    {
+      "inputs": [],
+      "name": "StakingZeroWhenNoStake",
+      "type": "error"
+    },
     {
       "inputs": [],
       "name": "TokenNotAccepted",
@@ -295,9 +290,9 @@
       "inputs": [
         {
           "indexed": true,
-          "internalType": "uint256",
+          "internalType": "uint96",
           "name": "_courtID",
-          "type": "uint256"
+          "type": "uint96"
         },
         {
           "indexed": true,
@@ -572,6 +567,12 @@
     {
       "anonymous": false,
       "inputs": [
+        {
+          "indexed": true,
+          "internalType": "address",
+          "name": "_account",
+          "type": "address"
+        },
         {
           "indexed": true,
           "internalType": "uint256",
@@ -587,13 +588,62 @@
         {
           "indexed": false,
           "internalType": "uint256",
-          "name": "_pnkAmount",
+          "name": "_degreeOfCoherencyPnk",
           "type": "uint256"
         },
         {
           "indexed": false,
           "internalType": "uint256",
-          "name": "_feeAmount",
+          "name": "_degreeOfCoherencyFee",
+          "type": "uint256"
+        },
+        {
+          "indexed": false,
+          "internalType": "int256",
+          "name": "_amountPnk",
+          "type": "int256"
+        },
+        {
+          "indexed": false,
+          "internalType": "int256",
+          "name": "_amountFee",
+          "type": "int256"
+        },
+        {
+          "indexed": false,
+          "internalType": "contract IERC20",
+          "name": "_feeToken",
+          "type": "address"
+        }
+      ],
+      "name": "JurorRewardPenalty",
+      "type": "event"
+    },
+    {
+      "anonymous": false,
+      "inputs": [
+        {
+          "indexed": true,
+          "internalType": "uint256",
+          "name": "_disputeID",
+          "type": "uint256"
+        },
+        {
+          "indexed": true,
+          "internalType": "uint256",
+          "name": "_roundID",
+          "type": "uint256"
+        },
+        {
+          "indexed": false,
+          "internalType": "uint256",
+          "name": "_amountPnk",
+          "type": "uint256"
+        },
+        {
+          "indexed": false,
+          "internalType": "uint256",
+          "name": "_amountFee",
           "type": "uint256"
         },
         {
@@ -675,55 +725,6 @@
       "name": "Ruling",
       "type": "event"
     },
-    {
-      "anonymous": false,
-      "inputs": [
-        {
-          "indexed": true,
-          "internalType": "address",
-          "name": "_account",
-          "type": "address"
-        },
-        {
-          "indexed": true,
-          "internalType": "uint256",
-          "name": "_disputeID",
-          "type": "uint256"
-        },
-        {
-          "indexed": true,
-          "internalType": "uint256",
-          "name": "_roundID",
-          "type": "uint256"
-        },
-        {
-          "indexed": false,
-          "internalType": "uint256",
-          "name": "_degreeOfCoherency",
-          "type": "uint256"
-        },
-        {
-          "indexed": false,
-          "internalType": "int256",
-          "name": "_pnkAmount",
-          "type": "int256"
-        },
-        {
-          "indexed": false,
-          "internalType": "int256",
-          "name": "_feeAmount",
-          "type": "int256"
-        },
-        {
-          "indexed": false,
-          "internalType": "contract IERC20",
-          "name": "_feeToken",
-          "type": "address"
-        }
-      ],
-      "name": "TokenAndETHShift",
-      "type": "event"
-    },
     {
       "anonymous": false,
       "inputs": [
@@ -946,12 +947,12 @@
     {
       "inputs": [
         {
-          "internalType": "address payable",
-          "name": "_governor",
+          "internalType": "address",
+          "name": "_instructor",
           "type": "address"
         }
       ],
-      "name": "changeGovernor",
+      "name": "changeInstructor",
       "outputs": [],
       "stateMutability": "nonpayable",
       "type": "function"
@@ -960,11 +961,11 @@
       "inputs": [
         {
           "internalType": "address",
-          "name": "_instructor",
+          "name": "_jurorProsecutionModule",
           "type": "address"
         }
       ],
-      "name": "changeInstructor",
+      "name": "changeJurorProsecutionModule",
       "outputs": [],
       "stateMutability": "nonpayable",
       "type": "function"
@@ -972,12 +973,12 @@
     {
       "inputs": [
         {
-          "internalType": "address",
-          "name": "_jurorProsecutionModule",
+          "internalType": "address payable",
+          "name": "_owner",
           "type": "address"
         }
       ],
-      "name": "changeJurorProsecutionModule",
+      "name": "changeOwner",
       "outputs": [],
       "stateMutability": "nonpayable",
       "type": "function"
@@ -1071,11 +1072,6 @@
           "internalType": "uint256",
           "name": "jurorsForCourtJump",
           "type": "uint256"
-        },
-        {
-          "internalType": "bool",
-          "name": "disabled",
-          "type": "bool"
         }
       ],
       "stateMutability": "view",
@@ -1385,7 +1381,7 @@
           "type": "bytes"
         }
       ],
-      "name": "executeGovernorProposal",
+      "name": "executeOwnerProposal",
       "outputs": [],
       "stateMutability": "nonpayable",
       "type": "function"
@@ -1454,6 +1450,30 @@
       "stateMutability": "view",
       "type": "function"
     },
+    {
+      "inputs": [
+        {
+          "internalType": "uint256",
+          "name": "_disputeID",
+          "type": "uint256"
+        },
+        {
+          "internalType": "uint256",
+          "name": "_round",
+          "type": "uint256"
+        }
+      ],
+      "name": "getPnkAtStakePerJuror",
+      "outputs": [
+        {
+          "internalType": "uint256",
+          "name": "",
+          "type": "uint256"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
     {
       "inputs": [
         {
@@ -1506,6 +1526,11 @@
               "name": "drawnJurors",
               "type": "address[]"
             },
+            {
+              "internalType": "uint96[]",
+              "name": "drawnJurorFromCourtIDs",
+              "type": "uint96[]"
+            },
             {
               "internalType": "uint256",
               "name": "sumFeeRewardPaid",
@@ -1525,6 +1550,11 @@
               "internalType": "uint256",
               "name": "drawIterations",
               "type": "uint256"
+            },
+            {
+              "internalType": "uint256[10]",
+              "name": "__gap",
+              "type": "uint256[10]"
             }
           ],
           "internalType": "struct KlerosCoreUniversity.Round",
@@ -1554,24 +1584,11 @@
       "stateMutability": "view",
       "type": "function"
     },
-    {
-      "inputs": [],
-      "name": "governor",
-      "outputs": [
-        {
-          "internalType": "address",
-          "name": "",
-          "type": "address"
-        }
-      ],
-      "stateMutability": "view",
-      "type": "function"
-    },
     {
       "inputs": [
         {
           "internalType": "address",
-          "name": "_governor",
+          "name": "_owner",
           "type": "address"
         },
         {
@@ -1689,6 +1706,19 @@
       "stateMutability": "view",
       "type": "function"
     },
+    {
+      "inputs": [],
+      "name": "owner",
+      "outputs": [
+        {
+          "internalType": "address",
+          "name": "",
+          "type": "address"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
     {
       "inputs": [
         {
@@ -1762,11 +1792,6 @@
           "internalType": "uint256",
           "name": "_newStake",
           "type": "uint256"
-        },
-        {
-          "internalType": "bool",
-          "name": "_alreadyTransferred",
-          "type": "bool"
         }
       ],
       "name": "setStakeBySortitionModule",
@@ -1787,6 +1812,24 @@
       "stateMutability": "view",
       "type": "function"
     },
+    {
+      "inputs": [
+        {
+          "internalType": "address",
+          "name": "_account",
+          "type": "address"
+        },
+        {
+          "internalType": "uint256",
+          "name": "_amount",
+          "type": "uint256"
+        }
+      ],
+      "name": "transferBySortitionModule",
+      "outputs": [],
+      "stateMutability": "nonpayable",
+      "type": "function"
+    },
     {
       "inputs": [
         {
@@ -1804,43 +1847,56 @@
       "outputs": [],
       "stateMutability": "payable",
       "type": "function"
+    },
+    {
+      "inputs": [],
+      "name": "version",
+      "outputs": [
+        {
+          "internalType": "string",
+          "name": "",
+          "type": "string"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
     }
   ],
-  "transactionHash": "0xf99e544be3b28ba3d5d7dc89481e4698807522d7dd1d431faf2305c6cbb9265f",
+  "transactionHash": "0x6733cea855fc3ea83280d8dd2bc1de31a95423f55539cb924ed683d4444bf016",
   "receipt": {
     "to": null,
     "from": "0xf1C7c037891525E360C59f708739Ac09A7670c59",
-    "contractAddress": "0xF74DaBfC5F5dbdBD07636637204d9C35326D2906",
+    "contractAddress": "0xb75b0cc01af4aD0D65D50082ae0717004D479Aa0",
     "transactionIndex": 2,
-    "gasUsed": "5019437",
-    "logsBloom": "0x00000000000000000000000000000000000000000000000000000000000000000000000000020000000000000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000800000000000000000000000080000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004000008000000000000000000000000000000000000000000000000000000000000000000000000000000",
-    "blockHash": "0x02db98181f92e8759b1936b6812ee2468550ddd547787f25f966d5f49f589fc4",
-    "transactionHash": "0xf99e544be3b28ba3d5d7dc89481e4698807522d7dd1d431faf2305c6cbb9265f",
+    "gasUsed": "4792792",
+    "logsBloom": "0x00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000800000000200000000000000080000000000000000000000000000000000000000004000000000000000000000000000000000000004000000000000000000000000000000000000000000004000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+    "blockHash": "0x355195241087caacd449d7bcbb83dcb810fc9e09cfc475e69287a5285d1b23bb",
+    "transactionHash": "0x6733cea855fc3ea83280d8dd2bc1de31a95423f55539cb924ed683d4444bf016",
     "logs": [
       {
         "transactionIndex": 2,
-        "blockNumber": 96308594,
-        "transactionHash": "0xf99e544be3b28ba3d5d7dc89481e4698807522d7dd1d431faf2305c6cbb9265f",
-        "address": "0xF74DaBfC5F5dbdBD07636637204d9C35326D2906",
+        "blockNumber": 193533808,
+        "transactionHash": "0x6733cea855fc3ea83280d8dd2bc1de31a95423f55539cb924ed683d4444bf016",
+        "address": "0xb75b0cc01af4aD0D65D50082ae0717004D479Aa0",
         "topics": [
           "0xc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d2"
         ],
         "data": "0x000000000000000000000000000000000000000000000000ffffffffffffffff",
         "logIndex": 1,
-        "blockHash": "0x02db98181f92e8759b1936b6812ee2468550ddd547787f25f966d5f49f589fc4"
+        "blockHash": "0x355195241087caacd449d7bcbb83dcb810fc9e09cfc475e69287a5285d1b23bb"
       }
     ],
-    "blockNumber": 96308594,
-    "cumulativeGasUsed": "5609813",
+    "blockNumber": 193533808,
+    "cumulativeGasUsed": "4827069",
     "status": 1,
     "byzantium": true
   },
   "args": [],
   "numDeployments": 1,
-  "solcInputHash": "a5602534c00c2f67ca4b6a1cab8c717e",
-  "metadata": "{\"compiler\":{\"version\":\"0.8.24+commit.e11b9ed9\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"inputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"constructor\"},{\"inputs\":[],\"name\":\"AllJurorsDrawn\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"AlreadyInitialized\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"AppealFeesNotEnough\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"AppealPeriodNotPassed\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"ArbitrationFeesNotEnough\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"ArraysLengthMismatch\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"CannotDisableClassicDK\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"CommitPeriodNotPassed\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"DepthLevelMax\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"DisputeKitNotSupportedByCourt\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"DisputeKitOnly\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"DisputeNotAppealable\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"DisputePeriodIsFinal\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"DisputeStillDrawing\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"EvidenceNotPassedAndNotAppeal\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"FailedDelegateCall\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"GovernorOnly\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"GovernorOrInstructorOnly\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"InstructorOnly\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"InvalidDisputKitParent\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"InvalidForkingCourtAsParent\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"implementation\",\"type\":\"address\"}],\"name\":\"InvalidImplementation\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"MinStakeLowerThanParentCourt\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"MustSupportDisputeKitClassic\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"NoJurorDrawn\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"NotEvidencePeriod\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"NotExecutionPeriod\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"NotInitializing\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"RulingAlreadyExecuted\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"SortitionModuleOnly\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"StakingInTooManyCourts\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"StakingLessThanCourtMinStake\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"StakingNotPossibeInThisCourt\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"StakingTransferFailed\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"TokenNotAccepted\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"TransferFailed\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"UUPSUnauthorizedCallContext\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"slot\",\"type\":\"bytes32\"}],\"name\":\"UUPSUnsupportedProxiableUUID\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"UnstakingTransferFailed\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"UnsuccessfulCall\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"UnsupportedDisputeKit\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"VotePeriodNotPassed\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"WrongDisputeKitIndex\",\"type\":\"error\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"contract IERC20\",\"name\":\"_token\",\"type\":\"address\"},{\"indexed\":true,\"internalType\":\"bool\",\"name\":\"_accepted\",\"type\":\"bool\"}],\"name\":\"AcceptedFeeToken\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"contract IArbitrableV2\",\"name\":\"_arbitrable\",\"type\":\"address\"}],\"name\":\"AppealDecision\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"contract IArbitrableV2\",\"name\":\"_arbitrable\",\"type\":\"address\"}],\"name\":\"AppealPossible\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_courtID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"uint96\",\"name\":\"_parent\",\"type\":\"uint96\"},{\"indexed\":false,\"internalType\":\"bool\",\"name\":\"_hiddenVotes\",\"type\":\"bool\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_minStake\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_alpha\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_feeForJuror\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_jurorsForCourtJump\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256[4]\",\"name\":\"_timesPerPeriod\",\"type\":\"uint256[4]\"},{\"indexed\":false,\"internalType\":\"uint256[]\",\"name\":\"_supportedDisputeKits\",\"type\":\"uint256[]\"}],\"name\":\"CourtCreated\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_roundID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"uint96\",\"name\":\"_fromCourtID\",\"type\":\"uint96\"},{\"indexed\":false,\"internalType\":\"uint96\",\"name\":\"_toCourtID\",\"type\":\"uint96\"}],\"name\":\"CourtJump\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint96\",\"name\":\"_courtID\",\"type\":\"uint96\"},{\"indexed\":false,\"internalType\":\"bool\",\"name\":\"_hiddenVotes\",\"type\":\"bool\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_minStake\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_alpha\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_feeForJuror\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_jurorsForCourtJump\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256[4]\",\"name\":\"_timesPerPeriod\",\"type\":\"uint256[4]\"}],\"name\":\"CourtModified\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"contract IArbitrableV2\",\"name\":\"_arbitrable\",\"type\":\"address\"}],\"name\":\"DisputeCreation\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_disputeKitID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"contract IDisputeKit\",\"name\":\"_disputeKitAddress\",\"type\":\"address\"}],\"name\":\"DisputeKitCreated\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint96\",\"name\":\"_courtID\",\"type\":\"uint96\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_disputeKitID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"bool\",\"name\":\"_enable\",\"type\":\"bool\"}],\"name\":\"DisputeKitEnabled\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_roundID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_fromDisputeKitID\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_toDisputeKitID\",\"type\":\"uint256\"}],\"name\":\"DisputeKitJump\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"_address\",\"type\":\"address\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_roundID\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_voteID\",\"type\":\"uint256\"}],\"name\":\"Draw\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":false,\"internalType\":\"uint64\",\"name\":\"version\",\"type\":\"uint64\"}],\"name\":\"Initialized\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_roundID\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_pnkAmount\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_feeAmount\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"contract IERC20\",\"name\":\"_feeToken\",\"type\":\"address\"}],\"name\":\"LeftoverRewardSent\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"contract IERC20\",\"name\":\"_feeToken\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"uint64\",\"name\":\"_rateInEth\",\"type\":\"uint64\"},{\"indexed\":false,\"internalType\":\"uint8\",\"name\":\"_rateDecimals\",\"type\":\"uint8\"}],\"name\":\"NewCurrencyRate\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"enum KlerosCoreUniversity.Period\",\"name\":\"_period\",\"type\":\"uint8\"}],\"name\":\"NewPeriod\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"contract IArbitrableV2\",\"name\":\"_arbitrable\",\"type\":\"address\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_ruling\",\"type\":\"uint256\"}],\"name\":\"Ruling\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"_account\",\"type\":\"address\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_roundID\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_degreeOfCoherency\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"int256\",\"name\":\"_pnkAmount\",\"type\":\"int256\"},{\"indexed\":false,\"internalType\":\"int256\",\"name\":\"_feeAmount\",\"type\":\"int256\"},{\"indexed\":false,\"internalType\":\"contract IERC20\",\"name\":\"_feeToken\",\"type\":\"address\"}],\"name\":\"TokenAndETHShift\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"newImplementation\",\"type\":\"address\"}],\"name\":\"Upgraded\",\"type\":\"event\"},{\"inputs\":[{\"internalType\":\"contract IDisputeKit\",\"name\":\"_disputeKitAddress\",\"type\":\"address\"}],\"name\":\"addNewDisputeKit\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_numberOfChoices\",\"type\":\"uint256\"},{\"internalType\":\"bytes\",\"name\":\"_extraData\",\"type\":\"bytes\"}],\"name\":\"appeal\",\"outputs\":[],\"stateMutability\":\"payable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"}],\"name\":\"appealCost\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"cost\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"}],\"name\":\"appealPeriod\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"start\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"end\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes\",\"name\":\"_extraData\",\"type\":\"bytes\"},{\"internalType\":\"contract IERC20\",\"name\":\"_feeToken\",\"type\":\"address\"}],\"name\":\"arbitrationCost\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"cost\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes\",\"name\":\"_extraData\",\"type\":\"bytes\"}],\"name\":\"arbitrationCost\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"cost\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"contract IERC20\",\"name\":\"_feeToken\",\"type\":\"address\"},{\"internalType\":\"bool\",\"name\":\"_accepted\",\"type\":\"bool\"}],\"name\":\"changeAcceptedFeeTokens\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint96\",\"name\":\"_courtID\",\"type\":\"uint96\"},{\"internalType\":\"bool\",\"name\":\"_hiddenVotes\",\"type\":\"bool\"},{\"internalType\":\"uint256\",\"name\":\"_minStake\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_alpha\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_feeForJuror\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_jurorsForCourtJump\",\"type\":\"uint256\"},{\"internalType\":\"uint256[4]\",\"name\":\"_timesPerPeriod\",\"type\":\"uint256[4]\"}],\"name\":\"changeCourtParameters\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"contract IERC20\",\"name\":\"_feeToken\",\"type\":\"address\"},{\"internalType\":\"uint64\",\"name\":\"_rateInEth\",\"type\":\"uint64\"},{\"internalType\":\"uint8\",\"name\":\"_rateDecimals\",\"type\":\"uint8\"}],\"name\":\"changeCurrencyRates\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address payable\",\"name\":\"_governor\",\"type\":\"address\"}],\"name\":\"changeGovernor\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_instructor\",\"type\":\"address\"}],\"name\":\"changeInstructor\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_jurorProsecutionModule\",\"type\":\"address\"}],\"name\":\"changeJurorProsecutionModule\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"contract IERC20\",\"name\":\"_pinakion\",\"type\":\"address\"}],\"name\":\"changePinakion\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"contract ISortitionModuleUniversity\",\"name\":\"_sortitionModule\",\"type\":\"address\"}],\"name\":\"changeSortitionModule\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"contract IERC20\",\"name\":\"_toToken\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"_amountInEth\",\"type\":\"uint256\"}],\"name\":\"convertEthToTokenAmount\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"name\":\"courts\",\"outputs\":[{\"internalType\":\"uint96\",\"name\":\"parent\",\"type\":\"uint96\"},{\"internalType\":\"bool\",\"name\":\"hiddenVotes\",\"type\":\"bool\"},{\"internalType\":\"uint256\",\"name\":\"minStake\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"alpha\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"feeForJuror\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"jurorsForCourtJump\",\"type\":\"uint256\"},{\"internalType\":\"bool\",\"name\":\"disabled\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint96\",\"name\":\"_parent\",\"type\":\"uint96\"},{\"internalType\":\"bool\",\"name\":\"_hiddenVotes\",\"type\":\"bool\"},{\"internalType\":\"uint256\",\"name\":\"_minStake\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_alpha\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_feeForJuror\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_jurorsForCourtJump\",\"type\":\"uint256\"},{\"internalType\":\"uint256[4]\",\"name\":\"_timesPerPeriod\",\"type\":\"uint256[4]\"},{\"internalType\":\"uint256[]\",\"name\":\"_supportedDisputeKits\",\"type\":\"uint256[]\"}],\"name\":\"createCourt\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_numberOfChoices\",\"type\":\"uint256\"},{\"internalType\":\"bytes\",\"name\":\"_extraData\",\"type\":\"bytes\"}],\"name\":\"createDispute\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"disputeID\",\"type\":\"uint256\"}],\"stateMutability\":\"payable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_numberOfChoices\",\"type\":\"uint256\"},{\"internalType\":\"bytes\",\"name\":\"_extraData\",\"type\":\"bytes\"},{\"internalType\":\"contract IERC20\",\"name\":\"_feeToken\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"_feeAmount\",\"type\":\"uint256\"}],\"name\":\"createDispute\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"disputeID\",\"type\":\"uint256\"}],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"contract IERC20\",\"name\":\"\",\"type\":\"address\"}],\"name\":\"currencyRates\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"feePaymentAccepted\",\"type\":\"bool\"},{\"internalType\":\"uint64\",\"name\":\"rateInEth\",\"type\":\"uint64\"},{\"internalType\":\"uint8\",\"name\":\"rateDecimals\",\"type\":\"uint8\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"}],\"name\":\"currentRuling\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"ruling\",\"type\":\"uint256\"},{\"internalType\":\"bool\",\"name\":\"tied\",\"type\":\"bool\"},{\"internalType\":\"bool\",\"name\":\"overridden\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"name\":\"disputeKits\",\"outputs\":[{\"internalType\":\"contract IDisputeKit\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"name\":\"disputes\",\"outputs\":[{\"internalType\":\"uint96\",\"name\":\"courtID\",\"type\":\"uint96\"},{\"internalType\":\"contract IArbitrableV2\",\"name\":\"arbitrated\",\"type\":\"address\"},{\"internalType\":\"enum KlerosCoreUniversity.Period\",\"name\":\"period\",\"type\":\"uint8\"},{\"internalType\":\"bool\",\"name\":\"ruled\",\"type\":\"bool\"},{\"internalType\":\"uint256\",\"name\":\"lastPeriodChange\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"internalType\":\"address\",\"name\":\"_juror\",\"type\":\"address\"}],\"name\":\"draw\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint96\",\"name\":\"_courtID\",\"type\":\"uint96\"},{\"internalType\":\"uint256[]\",\"name\":\"_disputeKitIDs\",\"type\":\"uint256[]\"},{\"internalType\":\"bool\",\"name\":\"_enable\",\"type\":\"bool\"}],\"name\":\"enableDisputeKits\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_round\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_iterations\",\"type\":\"uint256\"}],\"name\":\"execute\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_destination\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"_amount\",\"type\":\"uint256\"},{\"internalType\":\"bytes\",\"name\":\"_data\",\"type\":\"bytes\"}],\"name\":\"executeGovernorProposal\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"}],\"name\":\"executeRuling\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"getDisputeKitsLength\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"}],\"name\":\"getNumberOfRounds\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"}],\"name\":\"getNumberOfVotes\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_round\",\"type\":\"uint256\"}],\"name\":\"getRoundInfo\",\"outputs\":[{\"components\":[{\"internalType\":\"uint256\",\"name\":\"disputeKitID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"pnkAtStakePerJuror\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"totalFeesForJurors\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"nbVotes\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"repartitions\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"pnkPenalties\",\"type\":\"uint256\"},{\"internalType\":\"address[]\",\"name\":\"drawnJurors\",\"type\":\"address[]\"},{\"internalType\":\"uint256\",\"name\":\"sumFeeRewardPaid\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"sumPnkRewardPaid\",\"type\":\"uint256\"},{\"internalType\":\"contract IERC20\",\"name\":\"feeToken\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"drawIterations\",\"type\":\"uint256\"}],\"internalType\":\"struct KlerosCoreUniversity.Round\",\"name\":\"\",\"type\":\"tuple\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint96\",\"name\":\"_courtID\",\"type\":\"uint96\"}],\"name\":\"getTimesPerPeriod\",\"outputs\":[{\"internalType\":\"uint256[4]\",\"name\":\"timesPerPeriod\",\"type\":\"uint256[4]\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"governor\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_governor\",\"type\":\"address\"},{\"internalType\":\"address\",\"name\":\"_instructor\",\"type\":\"address\"},{\"internalType\":\"contract IERC20\",\"name\":\"_pinakion\",\"type\":\"address\"},{\"internalType\":\"address\",\"name\":\"_jurorProsecutionModule\",\"type\":\"address\"},{\"internalType\":\"contract IDisputeKit\",\"name\":\"_disputeKit\",\"type\":\"address\"},{\"internalType\":\"bool\",\"name\":\"_hiddenVotes\",\"type\":\"bool\"},{\"internalType\":\"uint256[4]\",\"name\":\"_courtParameters\",\"type\":\"uint256[4]\"},{\"internalType\":\"uint256[4]\",\"name\":\"_timesPerPeriod\",\"type\":\"uint256[4]\"},{\"internalType\":\"contract ISortitionModuleUniversity\",\"name\":\"_sortitionModuleAddress\",\"type\":\"address\"}],\"name\":\"initialize\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"instructor\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"}],\"name\":\"isDisputeKitJumping\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint96\",\"name\":\"_courtID\",\"type\":\"uint96\"},{\"internalType\":\"uint256\",\"name\":\"_disputeKitID\",\"type\":\"uint256\"}],\"name\":\"isSupported\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"jurorProsecutionModule\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"}],\"name\":\"passPeriod\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"pinakion\",\"outputs\":[{\"internalType\":\"contract IERC20\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"proxiableUUID\",\"outputs\":[{\"internalType\":\"bytes32\",\"name\":\"\",\"type\":\"bytes32\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint96\",\"name\":\"_courtID\",\"type\":\"uint96\"},{\"internalType\":\"uint256\",\"name\":\"_newStake\",\"type\":\"uint256\"}],\"name\":\"setStake\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_account\",\"type\":\"address\"},{\"internalType\":\"uint96\",\"name\":\"_courtID\",\"type\":\"uint96\"},{\"internalType\":\"uint256\",\"name\":\"_newStake\",\"type\":\"uint256\"},{\"internalType\":\"bool\",\"name\":\"_alreadyTransferred\",\"type\":\"bool\"}],\"name\":\"setStakeBySortitionModule\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"sortitionModule\",\"outputs\":[{\"internalType\":\"contract ISortitionModuleUniversity\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"newImplementation\",\"type\":\"address\"},{\"internalType\":\"bytes\",\"name\":\"data\",\"type\":\"bytes\"}],\"name\":\"upgradeToAndCall\",\"outputs\":[],\"stateMutability\":\"payable\",\"type\":\"function\"}],\"devdoc\":{\"errors\":{\"AlreadyInitialized()\":[{\"details\":\"The contract is already initialized.\"}],\"NotInitializing()\":[{\"details\":\"The contract is not initializing.\"}],\"UUPSUnauthorizedCallContext()\":[{\"details\":\"The call is from an unauthorized context.\"}],\"UUPSUnsupportedProxiableUUID(bytes32)\":[{\"details\":\"The storage `slot` is unsupported as a UUID.\"}]},\"events\":{\"AcceptedFeeToken(address,bool)\":{\"details\":\"To be emitted when an ERC20 token is added or removed as a method to pay fees.\",\"params\":{\"_accepted\":\"Whether the token is accepted or not.\",\"_token\":\"The ERC20 token.\"}},\"DisputeCreation(uint256,address)\":{\"details\":\"To be emitted when a dispute is created.\",\"params\":{\"_arbitrable\":\"The contract which created the dispute.\",\"_disputeID\":\"The identifier of the dispute in the Arbitrator contract.\"}},\"Initialized(uint64)\":{\"details\":\"Triggered when the contract has been initialized or reinitialized.\"},\"NewCurrencyRate(address,uint64,uint8)\":{\"details\":\"To be emitted when the fee for a particular ERC20 token is updated.\",\"params\":{\"_feeToken\":\"The ERC20 token.\",\"_rateDecimals\":\"The new decimals of the fee token rate.\",\"_rateInEth\":\"The new rate of the fee token in ETH.\"}},\"Ruling(address,uint256,uint256)\":{\"details\":\"To be raised when a ruling is given.\",\"params\":{\"_arbitrable\":\"The arbitrable receiving the ruling.\",\"_disputeID\":\"The identifier of the dispute in the Arbitrator contract.\",\"_ruling\":\"The ruling which was given.\"}},\"Upgraded(address)\":{\"params\":{\"newImplementation\":\"Address of the new implementation the proxy is now forwarding calls to.\"}}},\"kind\":\"dev\",\"methods\":{\"addNewDisputeKit(address)\":{\"details\":\"Add a new supported dispute kit module to the court.\",\"params\":{\"_disputeKitAddress\":\"The address of the dispute kit contract.\"}},\"appeal(uint256,uint256,bytes)\":{\"details\":\"Appeals the ruling of a specified dispute. Note: Access restricted to the Dispute Kit for this `disputeID`.\",\"params\":{\"_disputeID\":\"The ID of the dispute.\",\"_extraData\":\"Extradata for the dispute. Can be required during court jump.\",\"_numberOfChoices\":\"Number of choices for the dispute. Can be required during court jump.\"}},\"appealCost(uint256)\":{\"details\":\"Gets the cost of appealing a specified dispute.\",\"params\":{\"_disputeID\":\"The ID of the dispute.\"},\"returns\":{\"cost\":\"The appeal cost.\"}},\"appealPeriod(uint256)\":{\"details\":\"Gets the start and the end of a specified dispute's current appeal period.\",\"params\":{\"_disputeID\":\"The ID of the dispute.\"},\"returns\":{\"end\":\"The end of the appeal period.\",\"start\":\"The start of the appeal period.\"}},\"arbitrationCost(bytes)\":{\"details\":\"Compute the cost of arbitration denominated in ETH.      It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.\",\"params\":{\"_extraData\":\"Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\"},\"returns\":{\"cost\":\"The arbitration cost in ETH.\"}},\"arbitrationCost(bytes,address)\":{\"details\":\"Compute the cost of arbitration denominated in `_feeToken`.      It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.\",\"params\":{\"_extraData\":\"Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\",\"_feeToken\":\"The ERC20 token used to pay fees.\"},\"returns\":{\"cost\":\"The arbitration cost in `_feeToken`.\"}},\"changeAcceptedFeeTokens(address,bool)\":{\"details\":\"Changes the supported fee tokens.\",\"params\":{\"_accepted\":\"Whether the token is supported or not as a method of fee payment.\",\"_feeToken\":\"The fee token.\"}},\"changeCurrencyRates(address,uint64,uint8)\":{\"details\":\"Changes the currency rate of a fee token.\",\"params\":{\"_feeToken\":\"The fee token.\",\"_rateDecimals\":\"The new decimals of the fee token rate.\",\"_rateInEth\":\"The new rate of the fee token in ETH.\"}},\"changeGovernor(address)\":{\"details\":\"Changes the `governor` storage variable.\",\"params\":{\"_governor\":\"The new value for the `governor` storage variable.\"}},\"changeInstructor(address)\":{\"details\":\"Changes the `instructor` storage variable.\",\"params\":{\"_instructor\":\"The new value for the `instructor` storage variable.\"}},\"changeJurorProsecutionModule(address)\":{\"details\":\"Changes the `jurorProsecutionModule` storage variable.\",\"params\":{\"_jurorProsecutionModule\":\"The new value for the `jurorProsecutionModule` storage variable.\"}},\"changePinakion(address)\":{\"details\":\"Changes the `pinakion` storage variable.\",\"params\":{\"_pinakion\":\"The new value for the `pinakion` storage variable.\"}},\"changeSortitionModule(address)\":{\"details\":\"Changes the `_sortitionModule` storage variable. Note that the new module should be initialized for all courts.\",\"params\":{\"_sortitionModule\":\"The new value for the `sortitionModule` storage variable.\"}},\"constructor\":{\"details\":\"Constructor, initializing the implementation to reduce attack surface.\"},\"createCourt(uint96,bool,uint256,uint256,uint256,uint256,uint256[4],uint256[])\":{\"details\":\"Creates a court under a specified parent court.\",\"params\":{\"_alpha\":\"The `alpha` property value of the court.\",\"_feeForJuror\":\"The `feeForJuror` property value of the court.\",\"_hiddenVotes\":\"The `hiddenVotes` property value of the court.\",\"_jurorsForCourtJump\":\"The `jurorsForCourtJump` property value of the court.\",\"_minStake\":\"The `minStake` property value of the court.\",\"_parent\":\"The `parent` property value of the court.\",\"_supportedDisputeKits\":\"Indexes of dispute kits that this court will support.\",\"_timesPerPeriod\":\"The `timesPerPeriod` property value of the court.\"}},\"createDispute(uint256,bytes)\":{\"details\":\"Create a dispute and pay for the fees in the native currency, typically ETH.      Must be called by the arbitrable contract.      Must pay at least arbitrationCost(_extraData).\",\"params\":{\"_extraData\":\"Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\",\"_numberOfChoices\":\"The number of choices the arbitrator can choose from in this dispute.\"},\"returns\":{\"disputeID\":\"The identifier of the dispute created.\"}},\"createDispute(uint256,bytes,address,uint256)\":{\"details\":\"Create a dispute and pay for the fees in a supported ERC20 token.      Must be called by the arbitrable contract.      Must pay at least arbitrationCost(_extraData).\",\"params\":{\"_extraData\":\"Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\",\"_feeAmount\":\"Amount of the ERC20 token used to pay fees.\",\"_feeToken\":\"The ERC20 token used to pay fees.\",\"_numberOfChoices\":\"The number of choices the arbitrator can choose from in this dispute.\"},\"returns\":{\"disputeID\":\"The identifier of the dispute created.\"}},\"currentRuling(uint256)\":{\"details\":\"Gets the current ruling of a specified dispute.\",\"params\":{\"_disputeID\":\"The ID of the dispute.\"},\"returns\":{\"overridden\":\"Whether the ruling was overridden by appeal funding or not.\",\"ruling\":\"The current ruling.\",\"tied\":\"Whether it's a tie or not.\"}},\"draw(uint256,address)\":{\"details\":\"Draws one juror for the dispute until the number votes paid for is reached.\",\"params\":{\"_disputeID\":\"The ID of the dispute.\",\"_juror\":\"The address of the juror to draw.\"}},\"enableDisputeKits(uint96,uint256[],bool)\":{\"details\":\"Adds/removes court's support for specified dispute kits.\",\"params\":{\"_courtID\":\"The ID of the court.\",\"_disputeKitIDs\":\"The IDs of dispute kits which support should be added/removed.\",\"_enable\":\"Whether add or remove the dispute kits from the court.\"}},\"execute(uint256,uint256,uint256)\":{\"details\":\"Distribute the PNKs at stake and the dispute fees for the specific round of the dispute. Can be called in parts.\",\"params\":{\"_disputeID\":\"The ID of the dispute.\",\"_iterations\":\"The number of iterations to run.\",\"_round\":\"The appeal round.\"}},\"executeGovernorProposal(address,uint256,bytes)\":{\"details\":\"Allows the governor to call anything on behalf of the contract.\",\"params\":{\"_amount\":\"The value sent with the call.\",\"_data\":\"The data sent with the call.\",\"_destination\":\"The destination of the call.\"}},\"executeRuling(uint256)\":{\"details\":\"Executes a specified dispute's ruling.\",\"params\":{\"_disputeID\":\"The ID of the dispute.\"}},\"getNumberOfVotes(uint256)\":{\"details\":\"Gets the number of votes permitted for the specified dispute in the latest round.\",\"params\":{\"_disputeID\":\"The ID of the dispute.\"}},\"getTimesPerPeriod(uint96)\":{\"details\":\"Gets the timesPerPeriod array for a given court.\",\"params\":{\"_courtID\":\"The ID of the court to get the times from.\"},\"returns\":{\"timesPerPeriod\":\"The timesPerPeriod array for the given court.\"}},\"initialize(address,address,address,address,address,bool,uint256[4],uint256[4],address)\":{\"details\":\"Initializer (constructor equivalent for upgradable contracts).\",\"params\":{\"_courtParameters\":\"Numeric parameters of General court (minStake, alpha, feeForJuror and jurorsForCourtJump respectively).\",\"_disputeKit\":\"The address of the default dispute kit.\",\"_governor\":\"The governor's address.\",\"_hiddenVotes\":\"The `hiddenVotes` property value of the general court.\",\"_instructor\":\"The address of the instructor.\",\"_jurorProsecutionModule\":\"The address of the juror prosecution module.\",\"_pinakion\":\"The address of the token contract.\",\"_sortitionModuleAddress\":\"The sortition module responsible for sortition of the jurors.\",\"_timesPerPeriod\":\"The `timesPerPeriod` property value of the general court.\"}},\"isDisputeKitJumping(uint256)\":{\"details\":\"Returns true if the dispute kit will be switched to a parent DK.\",\"params\":{\"_disputeID\":\"The ID of the dispute.\"},\"returns\":{\"_0\":\"Whether DK will be switched or not.\"}},\"passPeriod(uint256)\":{\"details\":\"Passes the period of a specified dispute.\",\"params\":{\"_disputeID\":\"The ID of the dispute.\"}},\"proxiableUUID()\":{\"details\":\"Implementation of the ERC1822 `proxiableUUID` function. This returns the storage slot used by the implementation. It is used to validate the implementation's compatibility when performing an upgrade. IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks bricking a proxy that upgrades to it, by delegating to itself until out of gas. Thus it is critical that this function revert if invoked through a proxy. This is guaranteed by the if statement.\"},\"setStake(uint96,uint256)\":{\"details\":\"Sets the caller's stake in a court.\",\"params\":{\"_courtID\":\"The ID of the court.\",\"_newStake\":\"The new stake. Note that the existing delayed stake will be nullified as non-relevant.\"}},\"setStakeBySortitionModule(address,uint96,uint256,bool)\":{\"details\":\"Sets the stake of a specified account in a court, typically to apply a delayed stake or unstake inactive jurors.\",\"params\":{\"_account\":\"The account whose stake is being set.\",\"_alreadyTransferred\":\"Whether the PNKs have already been transferred to the contract.\",\"_courtID\":\"The ID of the court.\",\"_newStake\":\"The new stake.\"}},\"upgradeToAndCall(address,bytes)\":{\"details\":\"Upgrade mechanism including access control and UUPS-compliance.Reverts if the execution is not performed via delegatecall or the execution context is not of a proxy with an ERC1967-compliant implementation pointing to self.\",\"params\":{\"data\":\"Data used in a delegate call to `newImplementation` if non-empty. This will typically be an encoded function call, and allows initializing the storage of the proxy like a Solidity constructor.\",\"newImplementation\":\"Address of the new implementation contract.\"}}},\"title\":\"KlerosCoreUniversity Core arbitrator contract for educational purposes.\",\"version\":1},\"userdoc\":{\"errors\":{\"FailedDelegateCall()\":[{\"notice\":\"Failed Delegated call\"}],\"InvalidImplementation(address)\":[{\"notice\":\"The `implementation` is not UUPS-compliant\"}]},\"events\":{\"Upgraded(address)\":{\"notice\":\"Emitted when the `implementation` has been successfully upgraded.\"}},\"kind\":\"user\",\"methods\":{},\"version\":1}},\"settings\":{\"compilationTarget\":{\"src/arbitration/university/KlerosCoreUniversity.sol\":\"KlerosCoreUniversity\"},\"evmVersion\":\"paris\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\",\"useLiteralContent\":true},\"optimizer\":{\"enabled\":true,\"runs\":100},\"remappings\":[]},\"sources\":{\"@openzeppelin/contracts/token/ERC20/IERC20.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC20/IERC20.sol)\\n\\npragma solidity ^0.8.20;\\n\\n/**\\n * @dev Interface of the ERC-20 standard as defined in the ERC.\\n */\\ninterface IERC20 {\\n    /**\\n     * @dev Emitted when `value` tokens are moved from one account (`from`) to\\n     * another (`to`).\\n     *\\n     * Note that `value` may be zero.\\n     */\\n    event Transfer(address indexed from, address indexed to, uint256 value);\\n\\n    /**\\n     * @dev Emitted when the allowance of a `spender` for an `owner` is set by\\n     * a call to {approve}. `value` is the new allowance.\\n     */\\n    event Approval(address indexed owner, address indexed spender, uint256 value);\\n\\n    /**\\n     * @dev Returns the value of tokens in existence.\\n     */\\n    function totalSupply() external view returns (uint256);\\n\\n    /**\\n     * @dev Returns the value of tokens owned by `account`.\\n     */\\n    function balanceOf(address account) external view returns (uint256);\\n\\n    /**\\n     * @dev Moves a `value` amount of tokens from the caller's account to `to`.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * Emits a {Transfer} event.\\n     */\\n    function transfer(address to, uint256 value) external returns (bool);\\n\\n    /**\\n     * @dev Returns the remaining number of tokens that `spender` will be\\n     * allowed to spend on behalf of `owner` through {transferFrom}. This is\\n     * zero by default.\\n     *\\n     * This value changes when {approve} or {transferFrom} are called.\\n     */\\n    function allowance(address owner, address spender) external view returns (uint256);\\n\\n    /**\\n     * @dev Sets a `value` amount of tokens as the allowance of `spender` over the\\n     * caller's tokens.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * IMPORTANT: Beware that changing an allowance with this method brings the risk\\n     * that someone may use both the old and the new allowance by unfortunate\\n     * transaction ordering. One possible solution to mitigate this race\\n     * condition is to first reduce the spender's allowance to 0 and set the\\n     * desired value afterwards:\\n     * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729\\n     *\\n     * Emits an {Approval} event.\\n     */\\n    function approve(address spender, uint256 value) external returns (bool);\\n\\n    /**\\n     * @dev Moves a `value` amount of tokens from `from` to `to` using the\\n     * allowance mechanism. `value` is then deducted from the caller's\\n     * allowance.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * Emits a {Transfer} event.\\n     */\\n    function transferFrom(address from, address to, uint256 value) external returns (bool);\\n}\\n\",\"keccak256\":\"0xe06a3f08a987af6ad2e1c1e774405d4fe08f1694b67517438b467cecf0da0ef7\",\"license\":\"MIT\"},\"src/arbitration/interfaces/IArbitrableV2.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity 0.8.24;\\n\\nimport \\\"./IArbitratorV2.sol\\\";\\n\\n/// @title IArbitrableV2\\n/// @notice Arbitrable interface.\\n/// @dev When developing arbitrable contracts, we need to:\\n/// - Define the action taken when a ruling is received by the contract.\\n/// - Allow dispute creation. For this a function must call arbitrator.createDispute{value: _fee}(_choices,_extraData);\\ninterface IArbitrableV2 {\\n    /// @dev To be emitted when a dispute is created to link the correct meta-evidence to the disputeID.\\n    /// @param _arbitrator The arbitrator of the contract.\\n    /// @param _arbitratorDisputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _externalDisputeID An identifier created outside Kleros by the protocol requesting arbitration.\\n    /// @param _templateId The identifier of the dispute template. Should not be used with _templateUri.\\n    /// @param _templateUri The URI to the dispute template. For example on IPFS: starting with '/ipfs/'. Should not be used with _templateId.\\n    event DisputeRequest(\\n        IArbitratorV2 indexed _arbitrator,\\n        uint256 indexed _arbitratorDisputeID,\\n        uint256 _externalDisputeID,\\n        uint256 _templateId,\\n        string _templateUri\\n    );\\n\\n    /// @dev To be raised when a ruling is given.\\n    /// @param _arbitrator The arbitrator giving the ruling.\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _ruling The ruling which was given.\\n    event Ruling(IArbitratorV2 indexed _arbitrator, uint256 indexed _disputeID, uint256 _ruling);\\n\\n    /// @dev Give a ruling for a dispute.\\n    ///      Must be called by the arbitrator.\\n    ///      The purpose of this function is to ensure that the address calling it has the right to rule on the contract.\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _ruling Ruling given by the arbitrator.\\n    /// Note that 0 is reserved for \\\"Not able/wanting to make a decision\\\".\\n    function rule(uint256 _disputeID, uint256 _ruling) external;\\n}\\n\",\"keccak256\":\"0xe841a4fe8ec109ce17dde4457bf1583c8b499109b05887c53a49a3207fc6e80b\",\"license\":\"MIT\"},\"src/arbitration/interfaces/IArbitratorV2.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity 0.8.24;\\n\\nimport \\\"@openzeppelin/contracts/token/ERC20/IERC20.sol\\\";\\nimport \\\"./IArbitrableV2.sol\\\";\\n\\n/// @title Arbitrator\\n/// Arbitrator interface that implements the new arbitration standard.\\n/// Unlike the ERC-792 this standard is not concerned with appeals, so each arbitrator can implement an appeal system that suits it the most.\\n/// When developing arbitrator contracts we need to:\\n/// - Define the functions for dispute creation (createDispute). Don't forget to store the arbitrated contract and the disputeID (which should be unique, may nbDisputes).\\n/// - Define the functions for cost display (arbitrationCost).\\n/// - Allow giving rulings. For this a function must call arbitrable.rule(disputeID, ruling).\\ninterface IArbitratorV2 {\\n    /// @dev To be emitted when a dispute is created.\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _arbitrable The contract which created the dispute.\\n    event DisputeCreation(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);\\n\\n    /// @dev To be raised when a ruling is given.\\n    /// @param _arbitrable The arbitrable receiving the ruling.\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _ruling The ruling which was given.\\n    event Ruling(IArbitrableV2 indexed _arbitrable, uint256 indexed _disputeID, uint256 _ruling);\\n\\n    /// @dev To be emitted when an ERC20 token is added or removed as a method to pay fees.\\n    /// @param _token The ERC20 token.\\n    /// @param _accepted Whether the token is accepted or not.\\n    event AcceptedFeeToken(IERC20 indexed _token, bool indexed _accepted);\\n\\n    /// @dev To be emitted when the fee for a particular ERC20 token is updated.\\n    /// @param _feeToken The ERC20 token.\\n    /// @param _rateInEth The new rate of the fee token in ETH.\\n    /// @param _rateDecimals The new decimals of the fee token rate.\\n    event NewCurrencyRate(IERC20 indexed _feeToken, uint64 _rateInEth, uint8 _rateDecimals);\\n\\n    /// @dev Create a dispute and pay for the fees in the native currency, typically ETH.\\n    ///      Must be called by the arbitrable contract.\\n    ///      Must pay at least arbitrationCost(_extraData).\\n    /// @param _numberOfChoices The number of choices the arbitrator can choose from in this dispute.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @return disputeID The identifier of the dispute created.\\n    function createDispute(\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData\\n    ) external payable returns (uint256 disputeID);\\n\\n    /// @dev Create a dispute and pay for the fees in a supported ERC20 token.\\n    ///      Must be called by the arbitrable contract.\\n    ///      Must pay at least arbitrationCost(_extraData).\\n    /// @param _numberOfChoices The number of choices the arbitrator can choose from in this dispute.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @param _feeToken The ERC20 token used to pay fees.\\n    /// @param _feeAmount Amount of the ERC20 token used to pay fees.\\n    /// @return disputeID The identifier of the dispute created.\\n    function createDispute(\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData,\\n        IERC20 _feeToken,\\n        uint256 _feeAmount\\n    ) external returns (uint256 disputeID);\\n\\n    /// @dev Compute the cost of arbitration denominated in the native currency, typically ETH.\\n    ///      It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @return cost The arbitration cost in ETH.\\n    function arbitrationCost(bytes calldata _extraData) external view returns (uint256 cost);\\n\\n    /// @dev Compute the cost of arbitration denominated in `_feeToken`.\\n    ///      It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @param _feeToken The ERC20 token used to pay fees.\\n    /// @return cost The arbitration cost in `_feeToken`.\\n    function arbitrationCost(bytes calldata _extraData, IERC20 _feeToken) external view returns (uint256 cost);\\n\\n    /// @dev Gets the current ruling of a specified dispute.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return ruling The current ruling.\\n    /// @return tied Whether it's a tie or not.\\n    /// @return overridden Whether the ruling was overridden by appeal funding or not.\\n    function currentRuling(uint256 _disputeID) external view returns (uint256 ruling, bool tied, bool overridden);\\n}\\n\",\"keccak256\":\"0xa4dc6b958197adead238de4246cd04e7389c3dc1b9f968acd10985f8fc5b74cf\",\"license\":\"MIT\"},\"src/arbitration/interfaces/IDisputeKit.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n/// @custom:authors: [@unknownunknown1, @jaybuidl]\\n/// @custom:reviewers: []\\n/// @custom:auditors: []\\n/// @custom:bounties: []\\n/// @custom:deployments: []\\n\\npragma solidity 0.8.24;\\n\\nimport \\\"./IArbitratorV2.sol\\\";\\n\\n/// @title IDisputeKit\\n/// An abstraction of the Dispute Kits intended for interfacing with KlerosCore.\\n/// It does not intend to abstract the interactions with the user (such as voting or appeal funding) to allow for implementation-specific parameters.\\ninterface IDisputeKit {\\n    // ************************************ //\\n    // *             Events               * //\\n    // ************************************ //\\n\\n    /// @dev Emitted when casting a vote to provide the justification of juror's choice.\\n    /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _juror Address of the juror.\\n    /// @param _voteIDs The identifiers of the votes in the dispute.\\n    /// @param _choice The choice juror voted for.\\n    /// @param _justification Justification of the choice.\\n    event VoteCast(\\n        uint256 indexed _coreDisputeID,\\n        address indexed _juror,\\n        uint256[] _voteIDs,\\n        uint256 indexed _choice,\\n        string _justification\\n    );\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @dev Creates a local dispute and maps it to the dispute ID in the Core contract.\\n    /// Note: Access restricted to Kleros Core only.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _numberOfChoices Number of choices of the dispute\\n    /// @param _extraData Additional info about the dispute, for possible use in future dispute kits.\\n    function createDispute(\\n        uint256 _coreDisputeID,\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData,\\n        uint256 _nbVotes\\n    ) external;\\n\\n    /// @dev Draws the juror from the sortition tree. The drawn address is picked up by Kleros Core.\\n    /// Note: Access restricted to Kleros Core only.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _nonce Nonce.\\n    /// @return drawnAddress The drawn address.\\n    function draw(uint256 _coreDisputeID, uint256 _nonce) external returns (address drawnAddress);\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /// @dev Gets the current ruling of a specified dispute.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @return ruling The current ruling.\\n    /// @return tied Whether it's a tie or not.\\n    /// @return overridden Whether the ruling was overridden by appeal funding or not.\\n    function currentRuling(uint256 _coreDisputeID) external view returns (uint256 ruling, bool tied, bool overridden);\\n\\n    /// @dev Gets the degree of coherence of a particular voter. This function is called by Kleros Core in order to determine the amount of the reward.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.\\n    /// @param _voteID The ID of the vote.\\n    /// @param _feePerJuror The fee per juror.\\n    /// @param _pnkAtStakePerJuror The PNK at stake per juror.\\n    /// @return The degree of coherence in basis points.\\n    function getDegreeOfCoherence(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _voteID,\\n        uint256 _feePerJuror,\\n        uint256 _pnkAtStakePerJuror\\n    ) external view returns (uint256);\\n\\n    /// @dev Gets the number of jurors who are eligible to a reward in this round.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.\\n    /// @return The number of coherent jurors.\\n    function getCoherentCount(uint256 _coreDisputeID, uint256 _coreRoundID) external view returns (uint256);\\n\\n    /// @dev Returns true if all of the jurors have cast their commits for the last round.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @return Whether all of the jurors have cast their commits for the last round.\\n    function areCommitsAllCast(uint256 _coreDisputeID) external view returns (bool);\\n\\n    /// @dev Returns true if all of the jurors have cast their votes for the last round.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @return Whether all of the jurors have cast their votes for the last round.\\n    function areVotesAllCast(uint256 _coreDisputeID) external view returns (bool);\\n\\n    /// @dev Returns true if the specified voter was active in this round.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.\\n    /// @param _voteID The ID of the voter.\\n    /// @return Whether the voter was active or not.\\n    function isVoteActive(uint256 _coreDisputeID, uint256 _coreRoundID, uint256 _voteID) external view returns (bool);\\n\\n    function getRoundInfo(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _choice\\n    )\\n        external\\n        view\\n        returns (\\n            uint256 winningChoice,\\n            bool tied,\\n            uint256 totalVoted,\\n            uint256 totalCommited,\\n            uint256 nbVoters,\\n            uint256 choiceCount\\n        );\\n\\n    function getVoteInfo(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _voteID\\n    ) external view returns (address account, bytes32 commit, uint256 choice, bool voted);\\n}\\n\",\"keccak256\":\"0xb9590d05f9df08dd0ed027b2eb40c7b1885b7574a121b1b0b7da0920429bb4d5\",\"license\":\"MIT\"},\"src/arbitration/interfaces/ISortitionModule.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\npragma solidity 0.8.24;\\n\\nimport \\\"../../libraries/Constants.sol\\\";\\n\\ninterface ISortitionModule {\\n    enum Phase {\\n        staking, // Stake sum trees can be updated. Pass after `minStakingTime` passes and there is at least one dispute without jurors.\\n        generating, // Waiting for a random number. Pass as soon as it is ready.\\n        drawing // Jurors can be drawn. Pass after all disputes have jurors or `maxDrawingTime` passes.\\n    }\\n\\n    event NewPhase(Phase _phase);\\n\\n    function createTree(bytes32 _key, bytes memory _extraData) external;\\n\\n    function setStake(\\n        address _account,\\n        uint96 _courtID,\\n        uint256 _newStake,\\n        bool _alreadyTransferred\\n    ) external returns (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult);\\n\\n    function setJurorInactive(address _account) external;\\n\\n    function lockStake(address _account, uint256 _relativeAmount) external;\\n\\n    function unlockStake(address _account, uint256 _relativeAmount) external;\\n\\n    function penalizeStake(address _account, uint256 _relativeAmount) external;\\n\\n    function notifyRandomNumber(uint256 _drawnNumber) external;\\n\\n    function draw(bytes32 _court, uint256 _coreDisputeID, uint256 _nonce) external view returns (address);\\n\\n    function getJurorBalance(\\n        address _juror,\\n        uint96 _courtID\\n    ) external view returns (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts);\\n\\n    function getJurorCourtIDs(address _juror) external view returns (uint96[] memory);\\n\\n    function isJurorStaked(address _juror) external view returns (bool);\\n\\n    function createDisputeHook(uint256 _disputeID, uint256 _roundID) external;\\n\\n    function postDrawHook(uint256 _disputeID, uint256 _roundID) external;\\n}\\n\",\"keccak256\":\"0x18a4ff126bb51e7b5b0e3fbff7cf0dbbcfff7195ad79307e69cdbc9226e63502\",\"license\":\"MIT\"},\"src/arbitration/university/ISortitionModuleUniversity.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\npragma solidity 0.8.24;\\n\\nimport {ISortitionModule} from \\\"../interfaces/ISortitionModule.sol\\\";\\n\\ninterface ISortitionModuleUniversity is ISortitionModule {\\n    function setTransientJuror(address _juror) external;\\n}\\n\",\"keccak256\":\"0x57fee0787ae90af01c57a7d2850f8e4ade1ca72163a388341cac017bfdbf163a\",\"license\":\"MIT\"},\"src/arbitration/university/KlerosCoreUniversity.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity 0.8.24;\\n\\nimport {IArbitrableV2, IArbitratorV2} from \\\"../interfaces/IArbitratorV2.sol\\\";\\nimport {IDisputeKit} from \\\"../interfaces/IDisputeKit.sol\\\";\\nimport {ISortitionModuleUniversity} from \\\"./ISortitionModuleUniversity.sol\\\";\\nimport {SafeERC20, IERC20} from \\\"../../libraries/SafeERC20.sol\\\";\\nimport \\\"../../libraries/Constants.sol\\\";\\nimport {UUPSProxiable} from \\\"../../proxy/UUPSProxiable.sol\\\";\\nimport {Initializable} from \\\"../../proxy/Initializable.sol\\\";\\n\\n/// @title KlerosCoreUniversity\\n/// Core arbitrator contract for educational purposes.\\ncontract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {\\n    using SafeERC20 for IERC20;\\n\\n    // ************************************* //\\n    // *         Enums / Structs           * //\\n    // ************************************* //\\n\\n    enum Period {\\n        evidence, // Evidence can be submitted. This is also when drawing has to take place.\\n        commit, // Jurors commit a hashed vote. This is skipped for courts without hidden votes.\\n        vote, // Jurors reveal/cast their vote depending on whether the court has hidden votes or not.\\n        appeal, // The dispute can be appealed.\\n        execution // Tokens are redistributed and the ruling is executed.\\n    }\\n\\n    struct Court {\\n        uint96 parent; // The parent court.\\n        bool hiddenVotes; // Whether to use commit and reveal or not.\\n        uint256[] children; // List of child courts.\\n        uint256 minStake; // Minimum PNKs needed to stake in the court.\\n        uint256 alpha; // Basis point of PNKs that are lost when incoherent.\\n        uint256 feeForJuror; // Arbitration fee paid per juror.\\n        uint256 jurorsForCourtJump; // The appeal after the one that reaches this number of jurors will go to the parent court if any.\\n        uint256[4] timesPerPeriod; // The time allotted to each dispute period in the form `timesPerPeriod[period]`.\\n        mapping(uint256 disputeKitId => bool) supportedDisputeKits; // True if DK with this ID is supported by the court. Note that each court must support classic dispute kit.\\n        bool disabled; // True if the court is disabled. Unused for now, will be implemented later.\\n    }\\n\\n    struct Dispute {\\n        uint96 courtID; // The ID of the court the dispute is in.\\n        IArbitrableV2 arbitrated; // The arbitrable contract.\\n        Period period; // The current period of the dispute.\\n        bool ruled; // True if the ruling has been executed, false otherwise.\\n        uint256 lastPeriodChange; // The last time the period was changed.\\n        Round[] rounds;\\n    }\\n\\n    struct Round {\\n        uint256 disputeKitID; // Index of the dispute kit in the array.\\n        uint256 pnkAtStakePerJuror; // The amount of PNKs at stake for each juror in this round.\\n        uint256 totalFeesForJurors; // The total juror fees paid in this round.\\n        uint256 nbVotes; // The total number of votes the dispute can possibly have in the current round. Former votes[_round].length.\\n        uint256 repartitions; // A counter of reward repartitions made in this round.\\n        uint256 pnkPenalties; // The amount of PNKs collected from penalties in this round.\\n        address[] drawnJurors; // Addresses of the jurors that were drawn in this round.\\n        uint256 sumFeeRewardPaid; // Total sum of arbitration fees paid to coherent jurors as a reward in this round.\\n        uint256 sumPnkRewardPaid; // Total sum of PNK paid to coherent jurors as a reward in this round.\\n        IERC20 feeToken; // The token used for paying fees in this round.\\n        uint256 drawIterations; // The number of iterations passed drawing the jurors for this round.\\n    }\\n\\n    // Workaround \\\"stack too deep\\\" errors\\n    struct ExecuteParams {\\n        uint256 disputeID; // The ID of the dispute to execute.\\n        uint256 round; // The round to execute.\\n        uint256 coherentCount; // The number of coherent votes in the round.\\n        uint256 numberOfVotesInRound; // The number of votes in the round.\\n        uint256 feePerJurorInRound; // The fee per juror in the round.\\n        uint256 pnkAtStakePerJurorInRound; // The amount of PNKs at stake for each juror in the round.\\n        uint256 pnkPenaltiesInRound; // The amount of PNKs collected from penalties in the round.\\n        uint256 repartition; // The index of the repartition to execute.\\n    }\\n\\n    struct CurrencyRate {\\n        bool feePaymentAccepted;\\n        uint64 rateInEth;\\n        uint8 rateDecimals;\\n    }\\n\\n    // ************************************* //\\n    // *             Storage               * //\\n    // ************************************* //\\n\\n    uint256 private constant ALPHA_DIVISOR = 1e4; // The number to divide `Court.alpha` by.\\n    uint256 private constant NON_PAYABLE_AMOUNT = (2 ** 256 - 2) / 2; // An amount higher than the supply of ETH.\\n\\n    address public governor; // The governor of the contract.\\n    address public instructor; // The instructor who is allowed to choose the jurors.\\n    IERC20 public pinakion; // The Pinakion token contract.\\n    address public jurorProsecutionModule; // The module for juror's prosecution.\\n    ISortitionModuleUniversity public sortitionModule; // Sortition module for drawing.\\n    Court[] public courts; // The courts.\\n    IDisputeKit[] public disputeKits; // Array of dispute kits.\\n    Dispute[] public disputes; // The disputes.\\n    mapping(IERC20 => CurrencyRate) public currencyRates; // The price of each token in ETH.\\n\\n    // ************************************* //\\n    // *              Events               * //\\n    // ************************************* //\\n\\n    event NewPeriod(uint256 indexed _disputeID, Period _period);\\n    event AppealPossible(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);\\n    event AppealDecision(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);\\n    event Draw(address indexed _address, uint256 indexed _disputeID, uint256 _roundID, uint256 _voteID);\\n    event CourtCreated(\\n        uint256 indexed _courtID,\\n        uint96 indexed _parent,\\n        bool _hiddenVotes,\\n        uint256 _minStake,\\n        uint256 _alpha,\\n        uint256 _feeForJuror,\\n        uint256 _jurorsForCourtJump,\\n        uint256[4] _timesPerPeriod,\\n        uint256[] _supportedDisputeKits\\n    );\\n    event CourtModified(\\n        uint96 indexed _courtID,\\n        bool _hiddenVotes,\\n        uint256 _minStake,\\n        uint256 _alpha,\\n        uint256 _feeForJuror,\\n        uint256 _jurorsForCourtJump,\\n        uint256[4] _timesPerPeriod\\n    );\\n    event DisputeKitCreated(uint256 indexed _disputeKitID, IDisputeKit indexed _disputeKitAddress);\\n    event DisputeKitEnabled(uint96 indexed _courtID, uint256 indexed _disputeKitID, bool indexed _enable);\\n    event CourtJump(\\n        uint256 indexed _disputeID,\\n        uint256 indexed _roundID,\\n        uint96 indexed _fromCourtID,\\n        uint96 _toCourtID\\n    );\\n    event DisputeKitJump(\\n        uint256 indexed _disputeID,\\n        uint256 indexed _roundID,\\n        uint256 indexed _fromDisputeKitID,\\n        uint256 _toDisputeKitID\\n    );\\n    event TokenAndETHShift(\\n        address indexed _account,\\n        uint256 indexed _disputeID,\\n        uint256 indexed _roundID,\\n        uint256 _degreeOfCoherency,\\n        int256 _pnkAmount,\\n        int256 _feeAmount,\\n        IERC20 _feeToken\\n    );\\n    event LeftoverRewardSent(\\n        uint256 indexed _disputeID,\\n        uint256 indexed _roundID,\\n        uint256 _pnkAmount,\\n        uint256 _feeAmount,\\n        IERC20 _feeToken\\n    );\\n\\n    // ************************************* //\\n    // *        Function Modifiers         * //\\n    // ************************************* //\\n\\n    modifier onlyByGovernor() {\\n        if (governor != msg.sender) revert GovernorOnly();\\n        _;\\n    }\\n\\n    modifier onlyByInstructor() {\\n        if (instructor != msg.sender) revert InstructorOnly();\\n        _;\\n    }\\n\\n    modifier onlyByGovernorOrInstructor() {\\n        if (msg.sender != governor && msg.sender != instructor) revert GovernorOrInstructorOnly();\\n        _;\\n    }\\n\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    /// @dev Constructor, initializing the implementation to reduce attack surface.\\n    constructor() {\\n        _disableInitializers();\\n    }\\n\\n    /// @dev Initializer (constructor equivalent for upgradable contracts).\\n    /// @param _governor The governor's address.\\n    /// @param _instructor The address of the instructor.\\n    /// @param _pinakion The address of the token contract.\\n    /// @param _jurorProsecutionModule The address of the juror prosecution module.\\n    /// @param _disputeKit The address of the default dispute kit.\\n    /// @param _hiddenVotes The `hiddenVotes` property value of the general court.\\n    /// @param _courtParameters Numeric parameters of General court (minStake, alpha, feeForJuror and jurorsForCourtJump respectively).\\n    /// @param _timesPerPeriod The `timesPerPeriod` property value of the general court.\\n    /// @param _sortitionModuleAddress The sortition module responsible for sortition of the jurors.\\n    function initialize(\\n        address _governor,\\n        address _instructor,\\n        IERC20 _pinakion,\\n        address _jurorProsecutionModule,\\n        IDisputeKit _disputeKit,\\n        bool _hiddenVotes,\\n        uint256[4] memory _courtParameters,\\n        uint256[4] memory _timesPerPeriod,\\n        ISortitionModuleUniversity _sortitionModuleAddress\\n    ) external reinitializer(1) {\\n        governor = _governor;\\n        instructor = _instructor;\\n        pinakion = _pinakion;\\n        jurorProsecutionModule = _jurorProsecutionModule;\\n        sortitionModule = _sortitionModuleAddress;\\n\\n        // NULL_DISPUTE_KIT: an empty element at index 0 to indicate when a dispute kit is not supported.\\n        disputeKits.push();\\n\\n        // DISPUTE_KIT_CLASSIC\\n        disputeKits.push(_disputeKit);\\n\\n        emit DisputeKitCreated(DISPUTE_KIT_CLASSIC, _disputeKit);\\n\\n        // FORKING_COURT\\n        // TODO: Fill the properties for the Forking court, emit CourtCreated.\\n        courts.push();\\n\\n        // GENERAL_COURT\\n        Court storage court = courts.push();\\n        court.parent = FORKING_COURT;\\n        court.children = new uint256[](0);\\n        court.hiddenVotes = _hiddenVotes;\\n        court.minStake = _courtParameters[0];\\n        court.alpha = _courtParameters[1];\\n        court.feeForJuror = _courtParameters[2];\\n        court.jurorsForCourtJump = _courtParameters[3];\\n        court.timesPerPeriod = _timesPerPeriod;\\n\\n        emit CourtCreated(\\n            1,\\n            court.parent,\\n            _hiddenVotes,\\n            _courtParameters[0],\\n            _courtParameters[1],\\n            _courtParameters[2],\\n            _courtParameters[3],\\n            _timesPerPeriod,\\n            new uint256[](0)\\n        );\\n        _enableDisputeKit(GENERAL_COURT, DISPUTE_KIT_CLASSIC, true);\\n    }\\n\\n    // ************************************* //\\n    // *             Governance            * //\\n    // ************************************* //\\n\\n    /* @dev Access Control to perform implementation upgrades (UUPS Proxiable)\\n     * @dev Only the governor can perform upgrades (`onlyByGovernor`)\\n     */\\n    function _authorizeUpgrade(address) internal view override onlyByGovernor {\\n        // NOP\\n    }\\n\\n    /// @dev Allows the governor to call anything on behalf of the contract.\\n    /// @param _destination The destination of the call.\\n    /// @param _amount The value sent with the call.\\n    /// @param _data The data sent with the call.\\n    function executeGovernorProposal(\\n        address _destination,\\n        uint256 _amount,\\n        bytes memory _data\\n    ) external onlyByGovernor {\\n        (bool success, ) = _destination.call{value: _amount}(_data);\\n        if (!success) revert UnsuccessfulCall();\\n    }\\n\\n    /// @dev Changes the `governor` storage variable.\\n    /// @param _governor The new value for the `governor` storage variable.\\n    function changeGovernor(address payable _governor) external onlyByGovernor {\\n        governor = _governor;\\n    }\\n\\n    /// @dev Changes the `instructor` storage variable.\\n    /// @param _instructor The new value for the `instructor` storage variable.\\n    function changeInstructor(address _instructor) external onlyByGovernorOrInstructor {\\n        instructor = _instructor;\\n    }\\n\\n    /// @dev Changes the `pinakion` storage variable.\\n    /// @param _pinakion The new value for the `pinakion` storage variable.\\n    function changePinakion(IERC20 _pinakion) external onlyByGovernor {\\n        pinakion = _pinakion;\\n    }\\n\\n    /// @dev Changes the `jurorProsecutionModule` storage variable.\\n    /// @param _jurorProsecutionModule The new value for the `jurorProsecutionModule` storage variable.\\n    function changeJurorProsecutionModule(address _jurorProsecutionModule) external onlyByGovernor {\\n        jurorProsecutionModule = _jurorProsecutionModule;\\n    }\\n\\n    /// @dev Changes the `_sortitionModule` storage variable.\\n    /// Note that the new module should be initialized for all courts.\\n    /// @param _sortitionModule The new value for the `sortitionModule` storage variable.\\n    function changeSortitionModule(ISortitionModuleUniversity _sortitionModule) external onlyByGovernor {\\n        sortitionModule = _sortitionModule;\\n    }\\n\\n    /// @dev Add a new supported dispute kit module to the court.\\n    /// @param _disputeKitAddress The address of the dispute kit contract.\\n    function addNewDisputeKit(IDisputeKit _disputeKitAddress) external onlyByGovernor {\\n        uint256 disputeKitID = disputeKits.length;\\n        disputeKits.push(_disputeKitAddress);\\n        emit DisputeKitCreated(disputeKitID, _disputeKitAddress);\\n    }\\n\\n    /// @dev Creates a court under a specified parent court.\\n    /// @param _parent The `parent` property value of the court.\\n    /// @param _hiddenVotes The `hiddenVotes` property value of the court.\\n    /// @param _minStake The `minStake` property value of the court.\\n    /// @param _alpha The `alpha` property value of the court.\\n    /// @param _feeForJuror The `feeForJuror` property value of the court.\\n    /// @param _jurorsForCourtJump The `jurorsForCourtJump` property value of the court.\\n    /// @param _timesPerPeriod The `timesPerPeriod` property value of the court.\\n    /// @param _supportedDisputeKits Indexes of dispute kits that this court will support.\\n    function createCourt(\\n        uint96 _parent,\\n        bool _hiddenVotes,\\n        uint256 _minStake,\\n        uint256 _alpha,\\n        uint256 _feeForJuror,\\n        uint256 _jurorsForCourtJump,\\n        uint256[4] memory _timesPerPeriod,\\n        uint256[] memory _supportedDisputeKits\\n    ) external onlyByGovernor {\\n        if (courts[_parent].minStake > _minStake) revert MinStakeLowerThanParentCourt();\\n        if (_supportedDisputeKits.length == 0) revert UnsupportedDisputeKit();\\n        if (_parent == FORKING_COURT) revert InvalidForkingCourtAsParent();\\n\\n        uint256 courtID = courts.length;\\n        Court storage court = courts.push();\\n\\n        for (uint256 i = 0; i < _supportedDisputeKits.length; i++) {\\n            if (_supportedDisputeKits[i] == 0 || _supportedDisputeKits[i] >= disputeKits.length) {\\n                revert WrongDisputeKitIndex();\\n            }\\n            court.supportedDisputeKits[_supportedDisputeKits[i]] = true;\\n        }\\n        // Check that Classic DK support was added.\\n        if (!court.supportedDisputeKits[DISPUTE_KIT_CLASSIC]) revert MustSupportDisputeKitClassic();\\n\\n        court.parent = _parent;\\n        court.children = new uint256[](0);\\n        court.hiddenVotes = _hiddenVotes;\\n        court.minStake = _minStake;\\n        court.alpha = _alpha;\\n        court.feeForJuror = _feeForJuror;\\n        court.jurorsForCourtJump = _jurorsForCourtJump;\\n        court.timesPerPeriod = _timesPerPeriod;\\n\\n        // Update the parent.\\n        courts[_parent].children.push(courtID);\\n        emit CourtCreated(\\n            courtID,\\n            _parent,\\n            _hiddenVotes,\\n            _minStake,\\n            _alpha,\\n            _feeForJuror,\\n            _jurorsForCourtJump,\\n            _timesPerPeriod,\\n            _supportedDisputeKits\\n        );\\n    }\\n\\n    function changeCourtParameters(\\n        uint96 _courtID,\\n        bool _hiddenVotes,\\n        uint256 _minStake,\\n        uint256 _alpha,\\n        uint256 _feeForJuror,\\n        uint256 _jurorsForCourtJump,\\n        uint256[4] memory _timesPerPeriod\\n    ) external onlyByGovernor {\\n        Court storage court = courts[_courtID];\\n        if (_courtID != GENERAL_COURT && courts[court.parent].minStake > _minStake) {\\n            revert MinStakeLowerThanParentCourt();\\n        }\\n        for (uint256 i = 0; i < court.children.length; i++) {\\n            if (courts[court.children[i]].minStake < _minStake) {\\n                revert MinStakeLowerThanParentCourt();\\n            }\\n        }\\n        court.minStake = _minStake;\\n        court.hiddenVotes = _hiddenVotes;\\n        court.alpha = _alpha;\\n        court.feeForJuror = _feeForJuror;\\n        court.jurorsForCourtJump = _jurorsForCourtJump;\\n        court.timesPerPeriod = _timesPerPeriod;\\n        emit CourtModified(\\n            _courtID,\\n            _hiddenVotes,\\n            _minStake,\\n            _alpha,\\n            _feeForJuror,\\n            _jurorsForCourtJump,\\n            _timesPerPeriod\\n        );\\n    }\\n\\n    /// @dev Adds/removes court's support for specified dispute kits.\\n    /// @param _courtID The ID of the court.\\n    /// @param _disputeKitIDs The IDs of dispute kits which support should be added/removed.\\n    /// @param _enable Whether add or remove the dispute kits from the court.\\n    function enableDisputeKits(uint96 _courtID, uint256[] memory _disputeKitIDs, bool _enable) external onlyByGovernor {\\n        for (uint256 i = 0; i < _disputeKitIDs.length; i++) {\\n            if (_enable) {\\n                if (_disputeKitIDs[i] == 0 || _disputeKitIDs[i] >= disputeKits.length) {\\n                    revert WrongDisputeKitIndex();\\n                }\\n                _enableDisputeKit(_courtID, _disputeKitIDs[i], true);\\n            } else {\\n                // Classic dispute kit must be supported by all courts.\\n                if (_disputeKitIDs[i] == DISPUTE_KIT_CLASSIC) {\\n                    revert CannotDisableClassicDK();\\n                }\\n                _enableDisputeKit(_courtID, _disputeKitIDs[i], false);\\n            }\\n        }\\n    }\\n\\n    /// @dev Changes the supported fee tokens.\\n    /// @param _feeToken The fee token.\\n    /// @param _accepted Whether the token is supported or not as a method of fee payment.\\n    function changeAcceptedFeeTokens(IERC20 _feeToken, bool _accepted) external onlyByGovernor {\\n        currencyRates[_feeToken].feePaymentAccepted = _accepted;\\n        emit AcceptedFeeToken(_feeToken, _accepted);\\n    }\\n\\n    /// @dev Changes the currency rate of a fee token.\\n    /// @param _feeToken The fee token.\\n    /// @param _rateInEth The new rate of the fee token in ETH.\\n    /// @param _rateDecimals The new decimals of the fee token rate.\\n    function changeCurrencyRates(IERC20 _feeToken, uint64 _rateInEth, uint8 _rateDecimals) external onlyByGovernor {\\n        currencyRates[_feeToken].rateInEth = _rateInEth;\\n        currencyRates[_feeToken].rateDecimals = _rateDecimals;\\n        emit NewCurrencyRate(_feeToken, _rateInEth, _rateDecimals);\\n    }\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @dev Sets the caller's stake in a court.\\n    /// @param _courtID The ID of the court.\\n    /// @param _newStake The new stake.\\n    /// Note that the existing delayed stake will be nullified as non-relevant.\\n    function setStake(uint96 _courtID, uint256 _newStake) external {\\n        _setStake(msg.sender, _courtID, _newStake, false, OnError.Revert);\\n    }\\n\\n    /// @dev Sets the stake of a specified account in a court, typically to apply a delayed stake or unstake inactive jurors.\\n    /// @param _account The account whose stake is being set.\\n    /// @param _courtID The ID of the court.\\n    /// @param _newStake The new stake.\\n    /// @param _alreadyTransferred Whether the PNKs have already been transferred to the contract.\\n    function setStakeBySortitionModule(\\n        address _account,\\n        uint96 _courtID,\\n        uint256 _newStake,\\n        bool _alreadyTransferred\\n    ) external {\\n        if (msg.sender != address(sortitionModule)) revert SortitionModuleOnly();\\n        _setStake(_account, _courtID, _newStake, _alreadyTransferred, OnError.Return);\\n    }\\n\\n    /// @inheritdoc IArbitratorV2\\n    function createDispute(\\n        uint256 _numberOfChoices,\\n        bytes memory _extraData\\n    ) external payable override returns (uint256 disputeID) {\\n        if (msg.value < arbitrationCost(_extraData)) revert ArbitrationFeesNotEnough();\\n\\n        return _createDispute(_numberOfChoices, _extraData, NATIVE_CURRENCY, msg.value);\\n    }\\n\\n    /// @inheritdoc IArbitratorV2\\n    function createDispute(\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData,\\n        IERC20 _feeToken,\\n        uint256 _feeAmount\\n    ) external override returns (uint256 disputeID) {\\n        if (!currencyRates[_feeToken].feePaymentAccepted) revert TokenNotAccepted();\\n        if (_feeAmount < arbitrationCost(_extraData, _feeToken)) revert ArbitrationFeesNotEnough();\\n\\n        if (!_feeToken.safeTransferFrom(msg.sender, address(this), _feeAmount)) revert TransferFailed();\\n        return _createDispute(_numberOfChoices, _extraData, _feeToken, _feeAmount);\\n    }\\n\\n    function _createDispute(\\n        uint256 _numberOfChoices,\\n        bytes memory _extraData,\\n        IERC20 _feeToken,\\n        uint256 _feeAmount\\n    ) internal returns (uint256 disputeID) {\\n        (uint96 courtID, , uint256 disputeKitID) = _extraDataToCourtIDMinJurorsDisputeKit(_extraData);\\n        if (!courts[courtID].supportedDisputeKits[disputeKitID]) revert DisputeKitNotSupportedByCourt();\\n\\n        disputeID = disputes.length;\\n        Dispute storage dispute = disputes.push();\\n        dispute.courtID = courtID;\\n        dispute.arbitrated = IArbitrableV2(msg.sender);\\n        dispute.lastPeriodChange = block.timestamp;\\n\\n        IDisputeKit disputeKit = disputeKits[disputeKitID];\\n        Court storage court = courts[courtID];\\n        Round storage round = dispute.rounds.push();\\n\\n        // Obtain the feeForJuror in the same currency as the _feeAmount\\n        uint256 feeForJuror = (_feeToken == NATIVE_CURRENCY)\\n            ? court.feeForJuror\\n            : convertEthToTokenAmount(_feeToken, court.feeForJuror);\\n        round.nbVotes = _feeAmount / feeForJuror;\\n        round.disputeKitID = disputeKitID;\\n        round.pnkAtStakePerJuror = (court.minStake * court.alpha) / ALPHA_DIVISOR;\\n        round.totalFeesForJurors = _feeAmount;\\n        round.feeToken = IERC20(_feeToken);\\n\\n        sortitionModule.createDisputeHook(disputeID, 0); // Default round ID.\\n\\n        disputeKit.createDispute(disputeID, _numberOfChoices, _extraData, round.nbVotes);\\n        emit DisputeCreation(disputeID, IArbitrableV2(msg.sender));\\n    }\\n\\n    /// @dev Passes the period of a specified dispute.\\n    /// @param _disputeID The ID of the dispute.\\n    function passPeriod(uint256 _disputeID) external {\\n        Dispute storage dispute = disputes[_disputeID];\\n        Court storage court = courts[dispute.courtID];\\n\\n        uint256 currentRound = dispute.rounds.length - 1;\\n        Round storage round = dispute.rounds[currentRound];\\n        if (dispute.period == Period.evidence) {\\n            if (\\n                currentRound == 0 &&\\n                block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)]\\n            ) {\\n                revert EvidenceNotPassedAndNotAppeal();\\n            }\\n            if (round.drawnJurors.length != round.nbVotes) revert DisputeStillDrawing();\\n            dispute.period = court.hiddenVotes ? Period.commit : Period.vote;\\n        } else if (dispute.period == Period.commit) {\\n            if (\\n                block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)] &&\\n                !disputeKits[round.disputeKitID].areCommitsAllCast(_disputeID)\\n            ) {\\n                revert CommitPeriodNotPassed();\\n            }\\n            dispute.period = Period.vote;\\n        } else if (dispute.period == Period.vote) {\\n            if (\\n                block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)] &&\\n                !disputeKits[round.disputeKitID].areVotesAllCast(_disputeID)\\n            ) {\\n                revert VotePeriodNotPassed();\\n            }\\n            dispute.period = Period.appeal;\\n            emit AppealPossible(_disputeID, dispute.arbitrated);\\n        } else if (dispute.period == Period.appeal) {\\n            if (block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)]) {\\n                revert AppealPeriodNotPassed();\\n            }\\n            dispute.period = Period.execution;\\n        } else if (dispute.period == Period.execution) {\\n            revert DisputePeriodIsFinal();\\n        }\\n\\n        dispute.lastPeriodChange = block.timestamp;\\n        emit NewPeriod(_disputeID, dispute.period);\\n    }\\n\\n    /// @dev Draws one juror for the dispute until the number votes paid for is reached.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _juror The address of the juror to draw.\\n    function draw(uint256 _disputeID, address _juror) external onlyByGovernorOrInstructor {\\n        Dispute storage dispute = disputes[_disputeID];\\n        uint256 currentRound = dispute.rounds.length - 1;\\n        Round storage round = dispute.rounds[currentRound];\\n        if (dispute.period != Period.evidence) revert NotEvidencePeriod();\\n        if (round.drawnJurors.length >= round.nbVotes) revert AllJurorsDrawn();\\n\\n        sortitionModule.setTransientJuror(_juror);\\n        {\\n            IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n            uint256 iteration = round.drawIterations + 1;\\n            address drawnAddress = disputeKit.draw(_disputeID, iteration);\\n            if (drawnAddress == address(0)) {\\n                revert NoJurorDrawn();\\n            }\\n            sortitionModule.lockStake(drawnAddress, round.pnkAtStakePerJuror);\\n            emit Draw(drawnAddress, _disputeID, currentRound, round.drawnJurors.length);\\n            round.drawnJurors.push(drawnAddress);\\n            if (round.drawnJurors.length == round.nbVotes) {\\n                sortitionModule.postDrawHook(_disputeID, currentRound);\\n            }\\n            round.drawIterations = iteration;\\n        }\\n        sortitionModule.setTransientJuror(address(0));\\n    }\\n\\n    /// @dev Appeals the ruling of a specified dispute.\\n    /// Note: Access restricted to the Dispute Kit for this `disputeID`.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _numberOfChoices Number of choices for the dispute. Can be required during court jump.\\n    /// @param _extraData Extradata for the dispute. Can be required during court jump.\\n    function appeal(uint256 _disputeID, uint256 _numberOfChoices, bytes memory _extraData) external payable {\\n        if (msg.value < appealCost(_disputeID)) revert AppealFeesNotEnough();\\n\\n        Dispute storage dispute = disputes[_disputeID];\\n        if (dispute.period != Period.appeal) revert DisputeNotAppealable();\\n\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        if (msg.sender != address(disputeKits[round.disputeKitID])) revert DisputeKitOnly();\\n\\n        uint96 newCourtID = dispute.courtID;\\n        uint256 newDisputeKitID = round.disputeKitID;\\n\\n        // Warning: the extra round must be created before calling disputeKit.createDispute()\\n        Round storage extraRound = dispute.rounds.push();\\n\\n        if (round.nbVotes >= courts[newCourtID].jurorsForCourtJump) {\\n            // Jump to parent court.\\n            newCourtID = courts[newCourtID].parent;\\n\\n            if (!courts[newCourtID].supportedDisputeKits[newDisputeKitID]) {\\n                // Switch to classic dispute kit if parent court doesn't support the current one.\\n                newDisputeKitID = DISPUTE_KIT_CLASSIC;\\n            }\\n\\n            if (newCourtID != dispute.courtID) {\\n                emit CourtJump(_disputeID, dispute.rounds.length - 1, dispute.courtID, newCourtID);\\n            }\\n        }\\n\\n        dispute.courtID = newCourtID;\\n        dispute.period = Period.evidence;\\n        dispute.lastPeriodChange = block.timestamp;\\n\\n        Court storage court = courts[newCourtID];\\n        extraRound.nbVotes = msg.value / court.feeForJuror; // As many votes that can be afforded by the provided funds.\\n        extraRound.pnkAtStakePerJuror = (court.minStake * court.alpha) / ALPHA_DIVISOR;\\n        extraRound.totalFeesForJurors = msg.value;\\n        extraRound.disputeKitID = newDisputeKitID;\\n\\n        sortitionModule.createDisputeHook(_disputeID, dispute.rounds.length - 1);\\n\\n        // Dispute kit was changed, so create a dispute in the new DK contract.\\n        if (extraRound.disputeKitID != round.disputeKitID) {\\n            emit DisputeKitJump(_disputeID, dispute.rounds.length - 1, round.disputeKitID, extraRound.disputeKitID);\\n            disputeKits[extraRound.disputeKitID].createDispute(\\n                _disputeID,\\n                _numberOfChoices,\\n                _extraData,\\n                extraRound.nbVotes\\n            );\\n        }\\n\\n        emit AppealDecision(_disputeID, dispute.arbitrated);\\n        emit NewPeriod(_disputeID, Period.evidence);\\n    }\\n\\n    /// @dev Distribute the PNKs at stake and the dispute fees for the specific round of the dispute. Can be called in parts.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _round The appeal round.\\n    /// @param _iterations The number of iterations to run.\\n    function execute(uint256 _disputeID, uint256 _round, uint256 _iterations) external {\\n        Round storage round;\\n        {\\n            Dispute storage dispute = disputes[_disputeID];\\n            if (dispute.period != Period.execution) revert NotExecutionPeriod();\\n\\n            round = dispute.rounds[_round];\\n        } // stack too deep workaround\\n\\n        uint256 start = round.repartitions;\\n        uint256 end = round.repartitions + _iterations;\\n\\n        uint256 pnkPenaltiesInRound = round.pnkPenalties; // Keep in memory to save gas.\\n        uint256 numberOfVotesInRound = round.drawnJurors.length;\\n        uint256 feePerJurorInRound = round.totalFeesForJurors / numberOfVotesInRound;\\n        uint256 pnkAtStakePerJurorInRound = round.pnkAtStakePerJuror;\\n        uint256 coherentCount;\\n        {\\n            IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n            coherentCount = disputeKit.getCoherentCount(_disputeID, _round); // Total number of jurors that are eligible to a reward in this round.\\n        } // stack too deep workaround\\n\\n        if (coherentCount == 0) {\\n            // We loop over the votes once as there are no rewards because it is not a tie and no one in this round is coherent with the final outcome.\\n            if (end > numberOfVotesInRound) end = numberOfVotesInRound;\\n        } else {\\n            // We loop over the votes twice, first to collect the PNK penalties, and second to distribute them as rewards along with arbitration fees.\\n            if (end > numberOfVotesInRound * 2) end = numberOfVotesInRound * 2;\\n        }\\n        round.repartitions = end;\\n\\n        for (uint256 i = start; i < end; i++) {\\n            if (i < numberOfVotesInRound) {\\n                pnkPenaltiesInRound = _executePenalties(\\n                    ExecuteParams({\\n                        disputeID: _disputeID,\\n                        round: _round,\\n                        coherentCount: coherentCount,\\n                        numberOfVotesInRound: numberOfVotesInRound,\\n                        feePerJurorInRound: feePerJurorInRound,\\n                        pnkAtStakePerJurorInRound: pnkAtStakePerJurorInRound,\\n                        pnkPenaltiesInRound: pnkPenaltiesInRound,\\n                        repartition: i\\n                    })\\n                );\\n            } else {\\n                _executeRewards(\\n                    ExecuteParams({\\n                        disputeID: _disputeID,\\n                        round: _round,\\n                        coherentCount: coherentCount,\\n                        numberOfVotesInRound: numberOfVotesInRound,\\n                        feePerJurorInRound: feePerJurorInRound,\\n                        pnkAtStakePerJurorInRound: pnkAtStakePerJurorInRound,\\n                        pnkPenaltiesInRound: pnkPenaltiesInRound,\\n                        repartition: i\\n                    })\\n                );\\n            }\\n        }\\n        if (round.pnkPenalties != pnkPenaltiesInRound) {\\n            round.pnkPenalties = pnkPenaltiesInRound; // Reentrancy risk: breaks Check-Effect-Interact\\n        }\\n    }\\n\\n    /// @dev Distribute the PNKs at stake and the dispute fees for the specific round of the dispute, penalties only.\\n    /// @param _params The parameters for the execution, see `ExecuteParams`.\\n    /// @return pnkPenaltiesInRoundCache The updated penalties in round cache.\\n    function _executePenalties(ExecuteParams memory _params) internal returns (uint256) {\\n        Dispute storage dispute = disputes[_params.disputeID];\\n        Round storage round = dispute.rounds[_params.round];\\n        IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n\\n        // [0, 1] value that determines how coherent the juror was in this round, in basis points.\\n        uint256 degreeOfCoherence = disputeKit.getDegreeOfCoherence(\\n            _params.disputeID,\\n            _params.round,\\n            _params.repartition,\\n            _params.feePerJurorInRound,\\n            _params.pnkAtStakePerJurorInRound\\n        );\\n        if (degreeOfCoherence > ALPHA_DIVISOR) {\\n            // Make sure the degree doesn't exceed 1, though it should be ensured by the dispute kit.\\n            degreeOfCoherence = ALPHA_DIVISOR;\\n        }\\n\\n        // Fully coherent jurors won't be penalized.\\n        uint256 penalty = (round.pnkAtStakePerJuror * (ALPHA_DIVISOR - degreeOfCoherence)) / ALPHA_DIVISOR;\\n        _params.pnkPenaltiesInRound += penalty;\\n\\n        // Unlock the PNKs affected by the penalty\\n        address account = round.drawnJurors[_params.repartition];\\n        sortitionModule.unlockStake(account, penalty);\\n\\n        // Apply the penalty to the staked PNKs.\\n        sortitionModule.penalizeStake(account, penalty);\\n        emit TokenAndETHShift(\\n            account,\\n            _params.disputeID,\\n            _params.round,\\n            degreeOfCoherence,\\n            -int256(penalty),\\n            0,\\n            round.feeToken\\n        );\\n\\n        if (!disputeKit.isVoteActive(_params.disputeID, _params.round, _params.repartition)) {\\n            // The juror is inactive, unstake them.\\n            sortitionModule.setJurorInactive(account);\\n        }\\n        if (_params.repartition == _params.numberOfVotesInRound - 1 && _params.coherentCount == 0) {\\n            // No one was coherent, send the rewards to the governor.\\n            if (round.feeToken == NATIVE_CURRENCY) {\\n                // The dispute fees were paid in ETH\\n                payable(governor).send(round.totalFeesForJurors);\\n            } else {\\n                // The dispute fees were paid in ERC20\\n                round.feeToken.safeTransfer(governor, round.totalFeesForJurors);\\n            }\\n            pinakion.safeTransfer(governor, _params.pnkPenaltiesInRound);\\n            emit LeftoverRewardSent(\\n                _params.disputeID,\\n                _params.round,\\n                _params.pnkPenaltiesInRound,\\n                round.totalFeesForJurors,\\n                round.feeToken\\n            );\\n        }\\n        return _params.pnkPenaltiesInRound;\\n    }\\n\\n    /// @dev Distribute the PNKs at stake and the dispute fees for the specific round of the dispute, rewards only.\\n    /// @param _params The parameters for the execution, see `ExecuteParams`.\\n    function _executeRewards(ExecuteParams memory _params) internal {\\n        Dispute storage dispute = disputes[_params.disputeID];\\n        Round storage round = dispute.rounds[_params.round];\\n        IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n\\n        // [0, 1] value that determines how coherent the juror was in this round, in basis points.\\n        uint256 degreeOfCoherence = disputeKit.getDegreeOfCoherence(\\n            _params.disputeID,\\n            _params.round,\\n            _params.repartition % _params.numberOfVotesInRound,\\n            _params.feePerJurorInRound,\\n            _params.pnkAtStakePerJurorInRound\\n        );\\n\\n        // Make sure the degree doesn't exceed 1, though it should be ensured by the dispute kit.\\n        if (degreeOfCoherence > ALPHA_DIVISOR) {\\n            degreeOfCoherence = ALPHA_DIVISOR;\\n        }\\n\\n        address account = round.drawnJurors[_params.repartition % _params.numberOfVotesInRound];\\n        uint256 pnkLocked = (round.pnkAtStakePerJuror * degreeOfCoherence) / ALPHA_DIVISOR;\\n\\n        // Release the rest of the PNKs of the juror for this round.\\n        sortitionModule.unlockStake(account, pnkLocked);\\n\\n        // Give back the locked PNKs in case the juror fully unstaked earlier.\\n        if (!sortitionModule.isJurorStaked(account)) {\\n            pinakion.safeTransfer(account, pnkLocked);\\n        }\\n\\n        // Transfer the rewards\\n        uint256 pnkReward = ((_params.pnkPenaltiesInRound / _params.coherentCount) * degreeOfCoherence) / ALPHA_DIVISOR;\\n        round.sumPnkRewardPaid += pnkReward;\\n        uint256 feeReward = ((round.totalFeesForJurors / _params.coherentCount) * degreeOfCoherence) / ALPHA_DIVISOR;\\n        round.sumFeeRewardPaid += feeReward;\\n        pinakion.safeTransfer(account, pnkReward);\\n        if (round.feeToken == NATIVE_CURRENCY) {\\n            // The dispute fees were paid in ETH\\n            payable(account).send(feeReward);\\n        } else {\\n            // The dispute fees were paid in ERC20\\n            round.feeToken.safeTransfer(account, feeReward);\\n        }\\n        emit TokenAndETHShift(\\n            account,\\n            _params.disputeID,\\n            _params.round,\\n            degreeOfCoherence,\\n            int256(pnkReward),\\n            int256(feeReward),\\n            round.feeToken\\n        );\\n\\n        // Transfer any residual rewards to the governor. It may happen due to partial coherence of the jurors.\\n        if (_params.repartition == _params.numberOfVotesInRound * 2 - 1) {\\n            uint256 leftoverPnkReward = _params.pnkPenaltiesInRound - round.sumPnkRewardPaid;\\n            uint256 leftoverFeeReward = round.totalFeesForJurors - round.sumFeeRewardPaid;\\n            if (leftoverPnkReward != 0 || leftoverFeeReward != 0) {\\n                if (leftoverPnkReward != 0) {\\n                    pinakion.safeTransfer(governor, leftoverPnkReward);\\n                }\\n                if (leftoverFeeReward != 0) {\\n                    if (round.feeToken == NATIVE_CURRENCY) {\\n                        // The dispute fees were paid in ETH\\n                        payable(governor).send(leftoverFeeReward);\\n                    } else {\\n                        // The dispute fees were paid in ERC20\\n                        round.feeToken.safeTransfer(governor, leftoverFeeReward);\\n                    }\\n                }\\n                emit LeftoverRewardSent(\\n                    _params.disputeID,\\n                    _params.round,\\n                    leftoverPnkReward,\\n                    leftoverFeeReward,\\n                    round.feeToken\\n                );\\n            }\\n        }\\n    }\\n\\n    /// @dev Executes a specified dispute's ruling.\\n    /// @param _disputeID The ID of the dispute.\\n    function executeRuling(uint256 _disputeID) external {\\n        Dispute storage dispute = disputes[_disputeID];\\n        if (dispute.period != Period.execution) revert NotExecutionPeriod();\\n        if (dispute.ruled) revert RulingAlreadyExecuted();\\n\\n        (uint256 winningChoice, , ) = currentRuling(_disputeID);\\n        dispute.ruled = true;\\n        emit Ruling(dispute.arbitrated, _disputeID, winningChoice);\\n        dispute.arbitrated.rule(_disputeID, winningChoice);\\n    }\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /// @dev Compute the cost of arbitration denominated in ETH.\\n    ///      It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @return cost The arbitration cost in ETH.\\n    function arbitrationCost(bytes memory _extraData) public view override returns (uint256 cost) {\\n        (uint96 courtID, uint256 minJurors, ) = _extraDataToCourtIDMinJurorsDisputeKit(_extraData);\\n        cost = courts[courtID].feeForJuror * minJurors;\\n    }\\n\\n    /// @dev Compute the cost of arbitration denominated in `_feeToken`.\\n    ///      It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @param _feeToken The ERC20 token used to pay fees.\\n    /// @return cost The arbitration cost in `_feeToken`.\\n    function arbitrationCost(bytes calldata _extraData, IERC20 _feeToken) public view override returns (uint256 cost) {\\n        cost = convertEthToTokenAmount(_feeToken, arbitrationCost(_extraData));\\n    }\\n\\n    /// @dev Gets the cost of appealing a specified dispute.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return cost The appeal cost.\\n    function appealCost(uint256 _disputeID) public view returns (uint256 cost) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        Court storage court = courts[dispute.courtID];\\n        if (round.nbVotes >= court.jurorsForCourtJump) {\\n            // Jump to parent court.\\n            if (dispute.courtID == GENERAL_COURT) {\\n                // TODO: Handle the forking when appealed in General court.\\n                cost = NON_PAYABLE_AMOUNT; // Get the cost of the parent court.\\n            } else {\\n                cost = courts[court.parent].feeForJuror * ((round.nbVotes * 2) + 1);\\n            }\\n        } else {\\n            // Stay in current court.\\n            cost = court.feeForJuror * ((round.nbVotes * 2) + 1);\\n        }\\n    }\\n\\n    /// @dev Gets the start and the end of a specified dispute's current appeal period.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return start The start of the appeal period.\\n    /// @return end The end of the appeal period.\\n    function appealPeriod(uint256 _disputeID) public view returns (uint256 start, uint256 end) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        if (dispute.period == Period.appeal) {\\n            start = dispute.lastPeriodChange;\\n            end = dispute.lastPeriodChange + courts[dispute.courtID].timesPerPeriod[uint256(Period.appeal)];\\n        } else {\\n            start = 0;\\n            end = 0;\\n        }\\n    }\\n\\n    /// @dev Gets the current ruling of a specified dispute.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return ruling The current ruling.\\n    /// @return tied Whether it's a tie or not.\\n    /// @return overridden Whether the ruling was overridden by appeal funding or not.\\n    function currentRuling(uint256 _disputeID) public view returns (uint256 ruling, bool tied, bool overridden) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n        (ruling, tied, overridden) = disputeKit.currentRuling(_disputeID);\\n    }\\n\\n    function getRoundInfo(uint256 _disputeID, uint256 _round) external view returns (Round memory) {\\n        return disputes[_disputeID].rounds[_round];\\n    }\\n\\n    function getNumberOfRounds(uint256 _disputeID) external view returns (uint256) {\\n        return disputes[_disputeID].rounds.length;\\n    }\\n\\n    function isSupported(uint96 _courtID, uint256 _disputeKitID) external view returns (bool) {\\n        return courts[_courtID].supportedDisputeKits[_disputeKitID];\\n    }\\n\\n    /// @dev Gets the timesPerPeriod array for a given court.\\n    /// @param _courtID The ID of the court to get the times from.\\n    /// @return timesPerPeriod The timesPerPeriod array for the given court.\\n    function getTimesPerPeriod(uint96 _courtID) external view returns (uint256[4] memory timesPerPeriod) {\\n        timesPerPeriod = courts[_courtID].timesPerPeriod;\\n    }\\n\\n    // ************************************* //\\n    // *   Public Views for Dispute Kits   * //\\n    // ************************************* //\\n\\n    /// @dev Gets the number of votes permitted for the specified dispute in the latest round.\\n    /// @param _disputeID The ID of the dispute.\\n    function getNumberOfVotes(uint256 _disputeID) external view returns (uint256) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        return dispute.rounds[dispute.rounds.length - 1].nbVotes;\\n    }\\n\\n    /// @dev Returns true if the dispute kit will be switched to a parent DK.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return Whether DK will be switched or not.\\n    function isDisputeKitJumping(uint256 _disputeID) external view returns (bool) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        Court storage court = courts[dispute.courtID];\\n\\n        if (round.nbVotes < court.jurorsForCourtJump) {\\n            return false;\\n        }\\n\\n        // Jump if the parent court doesn't support the current DK.\\n        return !courts[court.parent].supportedDisputeKits[round.disputeKitID];\\n    }\\n\\n    function getDisputeKitsLength() external view returns (uint256) {\\n        return disputeKits.length;\\n    }\\n\\n    function convertEthToTokenAmount(IERC20 _toToken, uint256 _amountInEth) public view returns (uint256) {\\n        return (_amountInEth * 10 ** currencyRates[_toToken].rateDecimals) / currencyRates[_toToken].rateInEth;\\n    }\\n\\n    // ************************************* //\\n    // *            Internal               * //\\n    // ************************************* //\\n\\n    /// @dev Toggles the dispute kit support for a given court.\\n    /// @param _courtID The ID of the court to toggle the support for.\\n    /// @param _disputeKitID The ID of the dispute kit to toggle the support for.\\n    /// @param _enable Whether to enable or disable the support. Note that classic dispute kit should always be enabled.\\n    function _enableDisputeKit(uint96 _courtID, uint256 _disputeKitID, bool _enable) internal {\\n        courts[_courtID].supportedDisputeKits[_disputeKitID] = _enable;\\n        emit DisputeKitEnabled(_courtID, _disputeKitID, _enable);\\n    }\\n\\n    /// @dev If called only once then set _onError to Revert, otherwise set it to Return\\n    /// @param _account The account to set the stake for.\\n    /// @param _courtID The ID of the court to set the stake for.\\n    /// @param _newStake The new stake.\\n    /// @param _alreadyTransferred Whether the PNKs were already transferred to/from the staking contract.\\n    /// @param _onError Whether to revert or return false on error.\\n    /// @return Whether the stake was successfully set or not.\\n    function _setStake(\\n        address _account,\\n        uint96 _courtID,\\n        uint256 _newStake,\\n        bool _alreadyTransferred,\\n        OnError _onError\\n    ) internal returns (bool) {\\n        if (_courtID == FORKING_COURT || _courtID > courts.length) {\\n            _stakingFailed(_onError, StakingResult.CannotStakeInThisCourt); // Staking directly into the forking court is not allowed.\\n            return false;\\n        }\\n        if (_newStake != 0 && _newStake < courts[_courtID].minStake) {\\n            _stakingFailed(_onError, StakingResult.CannotStakeLessThanMinStake); // Staking less than the minimum stake is not allowed.\\n            return false;\\n        }\\n        (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult) = sortitionModule.setStake(\\n            _account,\\n            _courtID,\\n            _newStake,\\n            _alreadyTransferred\\n        );\\n        if (stakingResult != StakingResult.Successful) {\\n            _stakingFailed(_onError, stakingResult);\\n            return false;\\n        }\\n        if (pnkDeposit > 0) {\\n            if (!pinakion.safeTransferFrom(_account, address(this), pnkDeposit)) {\\n                _stakingFailed(_onError, StakingResult.StakingTransferFailed);\\n                return false;\\n            }\\n        }\\n        if (pnkWithdrawal > 0) {\\n            if (!pinakion.safeTransfer(_account, pnkWithdrawal)) {\\n                _stakingFailed(_onError, StakingResult.UnstakingTransferFailed);\\n                return false;\\n            }\\n        }\\n        return true;\\n    }\\n\\n    /// @dev It may revert depending on the _onError parameter.\\n    function _stakingFailed(OnError _onError, StakingResult _result) internal pure virtual {\\n        if (_onError == OnError.Return) return;\\n        if (_result == StakingResult.StakingTransferFailed) revert StakingTransferFailed();\\n        if (_result == StakingResult.UnstakingTransferFailed) revert UnstakingTransferFailed();\\n        if (_result == StakingResult.CannotStakeInMoreCourts) revert StakingInTooManyCourts();\\n        if (_result == StakingResult.CannotStakeInThisCourt) revert StakingNotPossibeInThisCourt();\\n        if (_result == StakingResult.CannotStakeLessThanMinStake) revert StakingLessThanCourtMinStake();\\n    }\\n\\n    /// @dev Gets a court ID, the minimum number of jurors and an ID of a dispute kit from a specified extra data bytes array.\\n    /// Note that if extradata contains an incorrect value then this value will be switched to default.\\n    /// @param _extraData The extra data bytes array. The first 32 bytes are the court ID, the next are the minimum number of jurors and the last are the dispute kit ID.\\n    /// @return courtID The court ID.\\n    /// @return minJurors The minimum number of jurors required.\\n    /// @return disputeKitID The ID of the dispute kit.\\n    function _extraDataToCourtIDMinJurorsDisputeKit(\\n        bytes memory _extraData\\n    ) internal view returns (uint96 courtID, uint256 minJurors, uint256 disputeKitID) {\\n        // Note that if the extradata doesn't contain 32 bytes for the dispute kit ID it'll return the default 0 index.\\n        if (_extraData.length >= 64) {\\n            assembly {\\n                // solium-disable-line security/no-inline-assembly\\n                courtID := mload(add(_extraData, 0x20))\\n                minJurors := mload(add(_extraData, 0x40))\\n                disputeKitID := mload(add(_extraData, 0x60))\\n            }\\n            if (courtID == FORKING_COURT || courtID >= courts.length) {\\n                courtID = GENERAL_COURT;\\n            }\\n            if (minJurors == 0) {\\n                minJurors = DEFAULT_NB_OF_JURORS;\\n            }\\n            if (disputeKitID == NULL_DISPUTE_KIT || disputeKitID >= disputeKits.length) {\\n                disputeKitID = DISPUTE_KIT_CLASSIC; // 0 index is not used.\\n            }\\n        } else {\\n            courtID = GENERAL_COURT;\\n            minJurors = DEFAULT_NB_OF_JURORS;\\n            disputeKitID = DISPUTE_KIT_CLASSIC;\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *              Errors               * //\\n    // ************************************* //\\n\\n    error GovernorOnly();\\n    error InstructorOnly();\\n    error GovernorOrInstructorOnly();\\n    error DisputeKitOnly();\\n    error SortitionModuleOnly();\\n    error UnsuccessfulCall();\\n    error InvalidDisputKitParent();\\n    error DepthLevelMax();\\n    error MinStakeLowerThanParentCourt();\\n    error UnsupportedDisputeKit();\\n    error InvalidForkingCourtAsParent();\\n    error WrongDisputeKitIndex();\\n    error CannotDisableClassicDK();\\n    error ArraysLengthMismatch();\\n    error StakingInTooManyCourts();\\n    error StakingNotPossibeInThisCourt();\\n    error StakingLessThanCourtMinStake();\\n    error StakingTransferFailed();\\n    error UnstakingTransferFailed();\\n    error ArbitrationFeesNotEnough();\\n    error DisputeKitNotSupportedByCourt();\\n    error MustSupportDisputeKitClassic();\\n    error TokenNotAccepted();\\n    error EvidenceNotPassedAndNotAppeal();\\n    error DisputeStillDrawing();\\n    error CommitPeriodNotPassed();\\n    error VotePeriodNotPassed();\\n    error AppealPeriodNotPassed();\\n    error NotEvidencePeriod();\\n    error AppealFeesNotEnough();\\n    error DisputeNotAppealable();\\n    error NotExecutionPeriod();\\n    error RulingAlreadyExecuted();\\n    error DisputePeriodIsFinal();\\n    error TransferFailed();\\n    error AllJurorsDrawn();\\n    error NoJurorDrawn();\\n}\\n\",\"keccak256\":\"0xd636c2294d15110a20dcf97d67f2989e14233cd1de353032807ad44a8e828e49\",\"license\":\"MIT\"},\"src/libraries/Constants.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity 0.8.24;\\n\\nimport \\\"@openzeppelin/contracts/token/ERC20/IERC20.sol\\\";\\n\\n// Courts\\nuint96 constant FORKING_COURT = 0; // Index of the forking court.\\nuint96 constant GENERAL_COURT = 1; // Index of the default (general) court.\\n\\n// Dispute Kits\\nuint256 constant NULL_DISPUTE_KIT = 0; // Null pattern to indicate a top-level DK which has no parent.\\nuint256 constant DISPUTE_KIT_CLASSIC = 1; // Index of the default DK. 0 index is skipped.\\n\\n// Sortition Module\\nuint256 constant MAX_STAKE_PATHS = 4; // The maximum number of stake paths a juror can have.\\nuint256 constant DEFAULT_K = 6; // Default number of children per node.\\n\\n// Defaults\\nuint256 constant DEFAULT_NB_OF_JURORS = 3; // The default number of jurors in a dispute.\\nIERC20 constant NATIVE_CURRENCY = IERC20(address(0)); // The native currency, such as ETH on Arbitrum, Optimism and Ethereum L1.\\n\\nenum OnError {\\n    Revert,\\n    Return\\n}\\n\\nenum StakingResult {\\n    Successful,\\n    StakingTransferFailed,\\n    UnstakingTransferFailed,\\n    CannotStakeInMoreCourts,\\n    CannotStakeInThisCourt,\\n    CannotStakeLessThanMinStake,\\n    CannotStakeMoreThanMaxStakePerJuror,\\n    CannotStakeMoreThanMaxTotalStaked\\n}\\n\",\"keccak256\":\"0x486016fb74cc91439c2ec918e97a79190ab4eed223987d516986fff8eaeecfbf\",\"license\":\"MIT\"},\"src/libraries/SafeERC20.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n// Adapted from https://github.com/OpenZeppelin/openzeppelin-contracts/blob/a7a94c77463acea95d979aae1580fb0ddc3b6a1e/contracts/token/ERC20/utils/SafeERC20.sol\\n\\npragma solidity 0.8.24;\\n\\nimport \\\"@openzeppelin/contracts/token/ERC20/IERC20.sol\\\";\\n\\n/// @title SafeERC20\\n/// @dev Wrappers around ERC20 operations that throw on failure (when the token\\n/// contract returns false). Tokens that return no value (and instead revert or\\n/// throw on failure) are also supported, non-reverting calls are assumed to be\\n/// successful.\\n/// To use this library you can add a `using SafeERC20 for IERC20;` statement to your contract,\\n/// which allows you to call the safe operations as `token.safeTransfer(...)`, etc.\\nlibrary SafeERC20 {\\n    /// @dev Increases the allowance granted to `spender` by the caller.\\n    /// @param _token Token to transfer.\\n    /// @param _spender The address which will spend the funds.\\n    /// @param _addedValue The amount of tokens to increase the allowance by.\\n    function increaseAllowance(IERC20 _token, address _spender, uint256 _addedValue) internal returns (bool) {\\n        _token.approve(_spender, _token.allowance(address(this), _spender) + _addedValue);\\n        return true;\\n    }\\n\\n    /// @dev Calls transfer() without reverting.\\n    /// @param _token Token to transfer.\\n    /// @param _to Recepient address.\\n    /// @param _value Amount transferred.\\n    /// @return Whether transfer succeeded or not.\\n    function safeTransfer(IERC20 _token, address _to, uint256 _value) internal returns (bool) {\\n        (bool success, bytes memory data) = address(_token).call(abi.encodeCall(IERC20.transfer, (_to, _value)));\\n        return (success && (data.length == 0 || abi.decode(data, (bool))));\\n    }\\n\\n    /// @dev Calls transferFrom() without reverting.\\n    /// @param _token Token to transfer.\\n    /// @param _from Sender address.\\n    /// @param _to Recepient address.\\n    /// @param _value Amount transferred.\\n    /// @return Whether transfer succeeded or not.\\n    function safeTransferFrom(IERC20 _token, address _from, address _to, uint256 _value) internal returns (bool) {\\n        (bool success, bytes memory data) = address(_token).call(\\n            abi.encodeCall(IERC20.transferFrom, (_from, _to, _value))\\n        );\\n        return (success && (data.length == 0 || abi.decode(data, (bool))));\\n    }\\n}\\n\",\"keccak256\":\"0x3e39adb9cdd9f86b0defc8f6e1223533d86f82c804e186193f729c32c10161b1\",\"license\":\"MIT\"},\"src/proxy/Initializable.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v4.9.0) (proxy/utils/Initializable.sol) <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/utils/Initializable.sol>\\n\\npragma solidity 0.8.24;\\n\\n/**\\n * @dev This is a base contract to aid in writing upgradeable contracts, or any kind of contract that will be deployed\\n * behind a proxy. Since proxied contracts do not make use of a constructor, it's common to move constructor logic to an\\n * external initializer function, usually called `initialize`. It then becomes necessary to protect this initializer\\n * function so it can only be called once. The {initializer} modifier provided by this contract will have this effect.\\n *\\n * The initialization functions use a version number. Once a version number is used, it is consumed and cannot be\\n * reused. This mechanism prevents re-execution of each \\\"step\\\" but allows the creation of new initialization steps in\\n * case an upgrade adds a module that needs to be initialized.\\n *\\n * For example:\\n *\\n * ```solidity\\n * contract MyToken is ERC20Upgradeable {\\n *     function initialize() initializer public {\\n *         __ERC20_init(\\\"MyToken\\\", \\\"MTK\\\");\\n *     }\\n * }\\n *\\n * contract MyTokenV2 is MyToken, ERC20PermitUpgradeable {\\n *     function initializeV2() reinitializer(2) public {\\n *         __ERC20Permit_init(\\\"MyToken\\\");\\n *     }\\n * }\\n * ```\\n *\\n * TIP: To avoid leaving the proxy in an uninitialized state, the initializer function should be called as early as\\n * possible by providing the encoded function call as the `_data` argument to the proxy constructor\\n *\\n * CAUTION: When used with inheritance, manual care must be taken to not invoke a parent initializer twice, or to ensure\\n * that all initializers are idempotent. This is not verified automatically as constructors are by Solidity.\\n *\\n * [CAUTION]\\n * ====\\n * Avoid leaving a contract uninitialized.\\n *\\n * An uninitialized contract can be taken over by an attacker. This applies to both a proxy and its implementation\\n * contract, which may impact the proxy. To prevent the implementation contract from being used, you should invoke\\n * the {_disableInitializers} function in the constructor to automatically lock it when it is deployed:\\n *\\n * ```\\n * /// @custom:oz-upgrades-unsafe-allow constructor\\n * constructor() {\\n *     _disableInitializers();\\n * }\\n * ```\\n */\\nabstract contract Initializable {\\n    /**\\n     * @dev Storage of the initializable contract.\\n     *\\n     * It's implemented on a custom ERC-7201 namespace to reduce the risk of storage collisions\\n     * when using with upgradeable contracts.\\n     *\\n     * @custom:storage-location erc7201:openzeppelin.storage.Initializable\\n     */\\n    struct InitializableStorage {\\n        /**\\n         * @dev Indicates that the contract has been initialized.\\n         */\\n        uint64 _initialized;\\n        /**\\n         * @dev Indicates that the contract is in the process of being initialized.\\n         */\\n        bool _initializing;\\n    }\\n\\n    // keccak256(abi.encode(uint256(keccak256(\\\"openzeppelin.storage.Initializable\\\")) - 1))\\n    bytes32 private constant _INITIALIZABLE_STORAGE =\\n        0xf0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e;\\n\\n    /**\\n     * @dev The contract is already initialized.\\n     */\\n    error AlreadyInitialized();\\n\\n    /**\\n     * @dev The contract is not initializing.\\n     */\\n    error NotInitializing();\\n\\n    /**\\n     * @dev Triggered when the contract has been initialized or reinitialized.\\n     */\\n    event Initialized(uint64 version);\\n\\n    /**\\n     * @dev A modifier that defines a protected initializer function that can be invoked at most once. In its scope,\\n     * `onlyInitializing` functions can be used to initialize parent contracts.\\n     *\\n     * Similar to `reinitializer(1)`, except that functions marked with `initializer` can be nested in the context of a\\n     * constructor.\\n     *\\n     * Emits an {Initialized} event.\\n     */\\n    modifier initializer() {\\n        // solhint-disable-next-line var-name-mixedcase\\n        InitializableStorage storage $ = _getInitializableStorage();\\n\\n        bool isTopLevelCall = !$._initializing;\\n        uint64 initialized = $._initialized;\\n        if (!(isTopLevelCall && initialized < 1) && !(address(this).code.length == 0 && initialized == 1)) {\\n            revert AlreadyInitialized();\\n        }\\n        $._initialized = 1;\\n        if (isTopLevelCall) {\\n            $._initializing = true;\\n        }\\n        _;\\n        if (isTopLevelCall) {\\n            $._initializing = false;\\n            emit Initialized(1);\\n        }\\n    }\\n\\n    /**\\n     * @dev A modifier that defines a protected reinitializer function that can be invoked at most once, and only if the\\n     * contract hasn't been initialized to a greater version before. In its scope, `onlyInitializing` functions can be\\n     * used to initialize parent contracts.\\n     *\\n     * A reinitializer may be used after the original initialization step. This is essential to configure modules that\\n     * are added through upgrades and that require initialization.\\n     *\\n     * When `version` is 1, this modifier is similar to `initializer`, except that functions marked with `reinitializer`\\n     * cannot be nested. If one is invoked in the context of another, execution will revert.\\n     *\\n     * Note that versions can jump in increments greater than 1; this implies that if multiple reinitializers coexist in\\n     * a contract, executing them in the right order is up to the developer or operator.\\n     *\\n     * WARNING: setting the version to 255 will prevent any future reinitialization.\\n     *\\n     * Emits an {Initialized} event.\\n     */\\n    modifier reinitializer(uint64 version) {\\n        // solhint-disable-next-line var-name-mixedcase\\n        InitializableStorage storage $ = _getInitializableStorage();\\n\\n        if ($._initializing || $._initialized >= version) {\\n            revert AlreadyInitialized();\\n        }\\n        $._initialized = version;\\n        $._initializing = true;\\n        _;\\n        $._initializing = false;\\n        emit Initialized(version);\\n    }\\n\\n    /**\\n     * @dev Modifier to protect an initialization function so that it can only be invoked by functions with the\\n     * {initializer} and {reinitializer} modifiers, directly or indirectly.\\n     */\\n    modifier onlyInitializing() {\\n        _checkInitializing();\\n        _;\\n    }\\n\\n    /**\\n     * @dev Reverts if the contract is not in an initializing state. See {onlyInitializing}.\\n     */\\n    function _checkInitializing() internal view virtual {\\n        if (!_isInitializing()) {\\n            revert NotInitializing();\\n        }\\n    }\\n\\n    /**\\n     * @dev Locks the contract, preventing any future reinitialization. This cannot be part of an initializer call.\\n     * Calling this in the constructor of a contract will prevent that contract from being initialized or reinitialized\\n     * to any version. It is recommended to use this to lock implementation contracts that are designed to be called\\n     * through proxies.\\n     *\\n     * Emits an {Initialized} event the first time it is successfully executed.\\n     */\\n    function _disableInitializers() internal virtual {\\n        // solhint-disable-next-line var-name-mixedcase\\n        InitializableStorage storage $ = _getInitializableStorage();\\n\\n        if ($._initializing) {\\n            revert AlreadyInitialized();\\n        }\\n        if ($._initialized != type(uint64).max) {\\n            $._initialized = type(uint64).max;\\n            emit Initialized(type(uint64).max);\\n        }\\n    }\\n\\n    /**\\n     * @dev Returns the highest version that has been initialized. See {reinitializer}.\\n     */\\n    function _getInitializedVersion() internal view returns (uint64) {\\n        return _getInitializableStorage()._initialized;\\n    }\\n\\n    /**\\n     * @dev Returns `true` if the contract is currently initializing. See {onlyInitializing}.\\n     */\\n    function _isInitializing() internal view returns (bool) {\\n        return _getInitializableStorage()._initializing;\\n    }\\n\\n    /**\\n     * @dev Returns a pointer to the storage namespace.\\n     */\\n    // solhint-disable-next-line var-name-mixedcase\\n    function _getInitializableStorage() private pure returns (InitializableStorage storage $) {\\n        assembly {\\n            $.slot := _INITIALIZABLE_STORAGE\\n        }\\n    }\\n}\\n\",\"keccak256\":\"0x560ea64115636ecd6b3596248817125551c038ce1648019fde3cbe02d9759a30\",\"license\":\"MIT\"},\"src/proxy/UUPSProxiable.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n// Adapted from <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/utils/UUPSUpgradeable.sol>\\n\\n/**\\n *  @authors: [@malatrax]\\n *  @reviewers: []\\n *  @auditors: []\\n *  @bounties: []\\n *  @deployments: []\\n */\\npragma solidity 0.8.24;\\n\\n/**\\n * @title UUPS Proxiable\\n * @author Simon Malatrait <simon.malatrait@grenoble-inp.org>\\n * @dev This contract implements an upgradeability mechanism designed for UUPS proxies.\\n * The functions included here can perform an upgrade of an UUPS Proxy, when this contract is set as the implementation behind such a proxy.\\n *\\n * IMPORTANT: A UUPS proxy requires its upgradeability functions to be in the implementation as opposed to the transparent proxy.\\n * This means that if the proxy is upgraded to an implementation that does not support this interface, it will no longer be upgradeable.\\n *\\n * A security mechanism ensures that an upgrade does not turn off upgradeability accidentally, although this risk is\\n * reinstated if the upgrade retains upgradeability but removes the security mechanism, e.g. by replacing\\n * `UUPSProxiable` with a custom implementation of upgrades.\\n *\\n * The `_authorizeUpgrade` function must be overridden to include access restriction to the upgrade mechanism.\\n */\\nabstract contract UUPSProxiable {\\n    // ************************************* //\\n    // *             Event                 * //\\n    // ************************************* //\\n\\n    /**\\n     * Emitted when the `implementation` has been successfully upgraded.\\n     * @param newImplementation Address of the new implementation the proxy is now forwarding calls to.\\n     */\\n    event Upgraded(address indexed newImplementation);\\n\\n    // ************************************* //\\n    // *             Error                 * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev The call is from an unauthorized context.\\n     */\\n    error UUPSUnauthorizedCallContext();\\n\\n    /**\\n     * @dev The storage `slot` is unsupported as a UUID.\\n     */\\n    error UUPSUnsupportedProxiableUUID(bytes32 slot);\\n\\n    /// The `implementation` is not UUPS-compliant\\n    error InvalidImplementation(address implementation);\\n\\n    /// Failed Delegated call\\n    error FailedDelegateCall();\\n\\n    // ************************************* //\\n    // *             Storage               * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Storage slot with the address of the current implementation.\\n     * This is the keccak-256 hash of \\\"eip1967.proxy.implementation\\\" subtracted by 1, and is\\n     * validated in the constructor.\\n     * NOTE: bytes32(uint256(keccak256('eip1967.proxy.implementation')) - 1)\\n     */\\n    bytes32 private constant IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;\\n\\n    /**\\n     * @dev Storage variable of the proxiable contract address.\\n     * It is used to check whether or not the current call is from the proxy.\\n     */\\n    address private immutable __self = address(this);\\n\\n    // ************************************* //\\n    // *             Governance            * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Function that should revert when `msg.sender` is not authorized to upgrade the contract.\\n     * @dev Called by {upgradeToAndCall}.\\n     */\\n    function _authorizeUpgrade(address newImplementation) internal virtual;\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Upgrade mechanism including access control and UUPS-compliance.\\n     * @param newImplementation Address of the new implementation contract.\\n     * @param data Data used in a delegate call to `newImplementation` if non-empty. This will typically be an encoded\\n     * function call, and allows initializing the storage of the proxy like a Solidity constructor.\\n     *\\n     * @dev Reverts if the execution is not performed via delegatecall or the execution\\n     * context is not of a proxy with an ERC1967-compliant implementation pointing to self.\\n     */\\n    function upgradeToAndCall(address newImplementation, bytes memory data) public payable virtual {\\n        _authorizeUpgrade(newImplementation);\\n\\n        /* Check that the execution is being performed through a delegatecall call and that the execution context is\\n        a proxy contract with an implementation (as defined in ERC1967) pointing to self. */\\n        if (address(this) == __self || _getImplementation() != __self) {\\n            revert UUPSUnauthorizedCallContext();\\n        }\\n\\n        try UUPSProxiable(newImplementation).proxiableUUID() returns (bytes32 slot) {\\n            if (slot != IMPLEMENTATION_SLOT) {\\n                revert UUPSUnsupportedProxiableUUID(slot);\\n            }\\n            // Store the new implementation address to the implementation storage slot.\\n            assembly {\\n                sstore(IMPLEMENTATION_SLOT, newImplementation)\\n            }\\n            emit Upgraded(newImplementation);\\n\\n            if (data.length != 0) {\\n                // The return data is not checked (checking, in case of success, that the newImplementation code is non-empty if the return data is empty) because the authorized callee is trusted.\\n                (bool success, ) = newImplementation.delegatecall(data);\\n                if (!success) {\\n                    revert FailedDelegateCall();\\n                }\\n            }\\n        } catch {\\n            revert InvalidImplementation(newImplementation);\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Implementation of the ERC1822 `proxiableUUID` function. This returns the storage slot used by the\\n     * implementation. It is used to validate the implementation's compatibility when performing an upgrade.\\n     *\\n     * IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks\\n     * bricking a proxy that upgrades to it, by delegating to itself until out of gas. Thus it is critical that this\\n     * function revert if invoked through a proxy. This is guaranteed by the if statement.\\n     */\\n    function proxiableUUID() external view virtual returns (bytes32) {\\n        if (address(this) != __self) {\\n            // Must not be called through delegatecall\\n            revert UUPSUnauthorizedCallContext();\\n        }\\n        return IMPLEMENTATION_SLOT;\\n    }\\n\\n    // ************************************* //\\n    // *           Internal Views          * //\\n    // ************************************* //\\n\\n    function _getImplementation() internal view returns (address implementation) {\\n        assembly {\\n            implementation := sload(IMPLEMENTATION_SLOT)\\n        }\\n    }\\n}\\n\",\"keccak256\":\"0x5956855046cdda7aa45f44e379ef45323af7266c44c817d1266d8b32d52b0e22\",\"license\":\"MIT\"}},\"version\":1}",
-  "bytecode": "0x60a0604052306080523480156200001557600080fd5b506200002062000026565b620000d9565b7ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e805468010000000000000000900460ff1615620000765760405162dc149f60e41b815260040160405180910390fd5b80546001600160401b0390811614620000d65780546001600160401b0319166001600160401b0390811782556040519081527fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d29060200160405180910390a15b50565b60805161566962000103600039600081816115e10152818161160a015261180101526156696000f3fe60806040526004361061027c5760003560e01c80638a9bb02a1161014f578063d07368bd116100c1578063f6506db41161007a578063f6506db414610867578063f7434ea914610887578063fbb519e7146108a7578063fbf405b0146108c7578063fc6f8f16146108e7578063fe524c391461090757600080fd5b8063d07368bd146107b2578063d4d1d76a146107d2578063d874514b146107e7578063d98493f614610807578063e399d29b14610827578063e4c0aaf41461084757600080fd5b8063b702a87911610113578063b702a8791461070c578063c13517e11461072c578063c258bb191461073f578063c35699021461075f578063c71f425314610772578063cf0c38f81461079257600080fd5b80638a9bb02a1461064a5780638bb0487514610677578063acdbf51d14610697578063afe15cfb146106b7578063b0049637146106ec57600080fd5b80632e1daf2f116101f357806371ae413d116101ac57806371ae413d1461058a578063751accd0146105aa5780637717a6e8146105ca5780637934c0be146105ea57806382d022371461060a57806386541b241461062a57600080fd5b80632e1daf2f146104c45780633cfd1184146104e45780634f1ef2861461051157806352d1902d14610524578063564a565d1461053957806359ec827e1461056a57600080fd5b8063115d537611610245578063115d5376146103885780631860592b146103a857806319b81529146103d65780631c3db16d146104065780631f5a0dd2146104435780632d29a47b146104a457600080fd5b8062f5822c146102815780630219da79146102a357806309cfdc9c1461031b5780630b7414bc1461033b5780630c340a241461035b575b600080fd5b34801561028d57600080fd5b506102a161029c366004614846565b610927565b005b3480156102af57600080fd5b506102ee6102be366004614846565b60086020526000908152604090205460ff808216916001600160401b0361010082041691600160481b9091041683565b6040805193151584526001600160401b03909216602084015260ff16908201526060015b60405180910390f35b34801561032757600080fd5b506102a1610336366004614846565b610974565b34801561034757600080fd5b506102a161035636600461494e565b6109da565b34801561036757600080fd5b5060005461037b906001600160a01b031681565b60405161031291906149af565b34801561039457600080fd5b506102a16103a33660046149c3565b610b11565b3480156103b457600080fd5b506103c86103c33660046149dc565b611048565b604051908152602001610312565b3480156103e257600080fd5b506103f66103f13660046149c3565b6110a2565b6040519015158152602001610312565b34801561041257600080fd5b506104266104213660046149c3565b61119b565b604080519384529115156020840152151590820152606001610312565b34801561044f57600080fd5b5061046361045e3660046149c3565b61129c565b604080516001600160601b0390981688529515156020880152948601939093526060850191909152608084015260a0830152151560c082015260e001610312565b3480156104b057600080fd5b506102a16104bf366004614a08565b6112fb565b3480156104d057600080fd5b5060045461037b906001600160a01b031681565b3480156104f057600080fd5b506105046104ff366004614a34565b611563565b6040516103129190614a72565b6102a161051f366004614aef565b6115cd565b34801561053057600080fd5b506103c86117f4565b34801561054557600080fd5b506105596105543660046149c3565b611852565b604051610312959493929190614b76565b34801561057657600080fd5b506103c86105853660046149c3565b6118ae565b34801561059657600080fd5b5060015461037b906001600160a01b031681565b3480156105b657600080fd5b506102a16105c5366004614bb5565b611a03565b3480156105d657600080fd5b506102a16105e5366004614c0d565b611aad565b3480156105f657600080fd5b506102a1610605366004614c29565b611abb565b34801561061657600080fd5b506102a1610625366004614c62565b611b3a565b34801561063657600080fd5b506102a1610645366004614d21565b611bf7565b34801561065657600080fd5b5061066a610665366004614d8f565b611dd4565b6040516103129190614df6565b34801561068357600080fd5b506102a16106923660046149c3565b611f60565b3480156106a357600080fd5b5061037b6106b23660046149c3565b6120c4565b3480156106c357600080fd5b506106d76106d23660046149c3565b6120ee565b60408051928352602083019190915201610312565b3480156106f857600080fd5b506102a1610707366004614846565b61219a565b34801561071857600080fd5b506102a1610727366004614e9b565b6121e7565b6103c861073a366004614ec0565b6125fa565b34801561074b57600080fd5b506102a161075a366004614846565b612632565b6102a161076d366004614ef0565b61267f565b34801561077e57600080fd5b506103c861078d3660046149c3565b612b53565b34801561079e57600080fd5b5060035461037b906001600160a01b031681565b3480156107be57600080fd5b506102a16107cd366004614846565b612bbb565b3480156107de57600080fd5b506006546103c8565b3480156107f357600080fd5b506102a1610802366004614f29565b612c64565b34801561081357600080fd5b506103c861082236600461500a565b612f62565b34801561083357600080fd5b506102a1610842366004615055565b612faf565b34801561085357600080fd5b506102a1610862366004614846565b61329f565b34801561087357600080fd5b506103c8610882366004615110565b6132ec565b34801561089357600080fd5b506103c86108a2366004615176565b6133d2565b3480156108b357600080fd5b506102a16108c23660046151aa565b61341e565b3480156108d357600080fd5b5060025461037b906001600160a01b031681565b3480156108f357600080fd5b506103c86109023660046149c3565b61345e565b34801561091357600080fd5b506103f6610922366004614c0d565b61348d565b6000546001600160a01b031633146109525760405163c383977560e01b815260040160405180910390fd5b600280546001600160a01b0319166001600160a01b0392909216919091179055565b6000546001600160a01b0316331480159061099a57506001546001600160a01b03163314155b156109b857604051633244d29960e21b815260040160405180910390fd5b600180546001600160a01b0319166001600160a01b0392909216919091179055565b6000546001600160a01b03163314610a055760405163c383977560e01b815260040160405180910390fd5b60005b8251811015610b0b578115610aa457828181518110610a2957610a296151fb565b602002602001015160001480610a5c57506006548351849083908110610a5157610a516151fb565b602002602001015110155b15610a7a57604051633d58a98960e11b815260040160405180910390fd5b610a9f84848381518110610a9057610a906151fb565b602002602001015160016134d5565b610b03565b6001838281518110610ab857610ab86151fb565b602002602001015103610ade576040516356d111fd60e11b815260040160405180910390fd5b610b0384848381518110610af457610af46151fb565b602002602001015160006134d5565b600101610a08565b50505050565b600060078281548110610b2657610b266151fb565b600091825260208220600490910201805460058054929450916001600160601b03909116908110610b5957610b596151fb565b6000918252602082206003850154600c909202019250610b7b90600190615227565b90506000836003018281548110610b9457610b946151fb565b600091825260208220600b909102019150600185015460ff166004811115610bbe57610bbe614b3e565b03610c995781158015610c0d57506001840154600684019060ff166004811115610bea57610bea614b3e565b60048110610bfa57610bfa6151fb565b01546002850154610c0b9042615227565b105b15610c2b57604051633e9727df60e01b815260040160405180910390fd5b6003810154600682015414610c53576040516309e4486b60e41b815260040160405180910390fd5b8254600160601b900460ff16610c6a576002610c6d565b60015b60018086018054909160ff1990911690836004811115610c8f57610c8f614b3e565b0217905550610ffa565b60018085015460ff166004811115610cb357610cb3614b3e565b03610dc3576001840154600684019060ff166004811115610cd657610cd6614b3e565b60048110610ce657610ce66151fb565b01546002850154610cf79042615227565b108015610d8e57506006816000015481548110610d1657610d166151fb565b600091825260209091200154604051630baa64d160e01b8152600481018790526001600160a01b0390911690630baa64d190602401602060405180830381865afa158015610d68573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190610d8c919061523a565b155b15610dac57604051634dfa578560e11b815260040160405180910390fd5b6001808501805460029260ff199091169083610c8f565b6002600185015460ff166004811115610dde57610dde614b3e565b03610f2c576001840154600684019060ff166004811115610e0157610e01614b3e565b60048110610e1157610e116151fb565b01546002850154610e229042615227565b108015610eb957506006816000015481548110610e4157610e416151fb565b6000918252602090912001546040516336a66c7560e11b8152600481018790526001600160a01b0390911690636d4cd8ea90602401602060405180830381865afa158015610e93573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190610eb7919061523a565b155b15610ed757604051631988dead60e31b815260040160405180910390fd5b600184018054600360ff199091161790558354604051600160601b9091046001600160a01b03169086907fa5d41b970d849372be1da1481ffd78d162bfe57a7aa2fe4e5fb73481fa5ac24f90600090a3610ffa565b6003600185015460ff166004811115610f4757610f47614b3e565b03610fc1576001840154600684019060ff166004811115610f6a57610f6a614b3e565b60048110610f7a57610f7a6151fb565b01546002850154610f8b9042615227565b1015610faa57604051632f4dfd8760e01b815260040160405180910390fd5b6001808501805460049260ff199091169083610c8f565b6004600185015460ff166004811115610fdc57610fdc614b3e565b03610ffa576040516307f38c8f60e11b815260040160405180910390fd5b426002850155600184015460405186917f4e6f5cf43b95303e86aee81683df63992061723a829ee012db21dad388756b91916110399160ff1690615257565b60405180910390a25050505050565b6001600160a01b03821660009081526008602052604081205461010081046001600160401b03169061108590600160481b900460ff16600a615349565b61108f9084615358565b6110999190615385565b90505b92915050565b600080600783815481106110b8576110b86151fb565b60009182526020822060036004909202019081018054919350906110de90600190615227565b815481106110ee576110ee6151fb565b600091825260208220845460058054600b909402909201945090916001600160601b03909116908110611123576111236151fb565b90600052602060002090600c0201905080600501548260030154101561114e57506000949350505050565b80546005805490916001600160601b031690811061116e5761116e6151fb565b6000918252602080832094548352600a600c9092029094010190925250604090205460ff16159392505050565b600080600080600785815481106111b4576111b46151fb565b60009182526020822060036004909202019081018054919350906111da90600190615227565b815481106111ea576111ea6151fb565b90600052602060002090600b0201905060006006826000015481548110611213576112136151fb565b600091825260209091200154604051631c3db16d60e01b8152600481018990526001600160a01b0390911691508190631c3db16d90602401606060405180830381865afa158015611268573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061128c9190615399565b9199909850909650945050505050565b600581815481106112ac57600080fd5b60009182526020909120600c9091020180546002820154600383015460048401546005850154600b909501546001600160601b038516965060ff600160601b9095048516959394929391921687565b60008060078581548110611311576113116151fb565b600091825260209091206004918202019150600182015460ff16600481111561133c5761133c614b3e565b1461135a57604051638794ce4b60e01b815260040160405180910390fd5b80600301848154811061136f5761136f6151fb565b6000918252602082206004600b9092020190810154909350915061139384836153d1565b60058401546006850154600286015492935090916000906113b5908390615385565b905060008660010154905060008060068960000154815481106113da576113da6151fb565b60009182526020909120015460405163368efae360e21b8152600481018e9052602481018d90526001600160a01b039091169150819063da3beb8c90604401602060405180830381865afa158015611436573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061145a91906153e4565b915050806000036114765783861115611471578395505b611496565b611481846002615358565b86111561149657611493846002615358565b95505b60048801869055865b8681101561154257848110156114f8576114f16040518061010001604052808e81526020018d81526020018481526020018781526020018681526020018581526020018881526020018381525061355d565b955061153a565b61153a6040518061010001604052808e81526020018d815260200184815260200187815260200186815260200185815260200188815260200183815250613a2e565b60010161149f565b508488600501541461155657600588018590555b5050505050505050505050565b61156b614786565b6005826001600160601b031681548110611587576115876151fb565b6000918252602090912060408051608081019182905292600c029091016006019060049082845b8154815260200190600101908083116115ae5750505050509050919050565b6115d682613f70565b306001600160a01b037f000000000000000000000000000000000000000000000000000000000000000016148061165457507f00000000000000000000000000000000000000000000000000000000000000006001600160a01b03166116486000805160206156148339815191525490565b6001600160a01b031614155b156116725760405163703e46dd60e11b815260040160405180910390fd5b816001600160a01b03166352d1902d6040518163ffffffff1660e01b8152600401602060405180830381865afa9250505080156116cc575060408051601f3d908101601f191682019092526116c9918101906153e4565b60015b6116f45781604051630c76093760e01b81526004016116eb91906149af565b60405180910390fd5b600080516020615614833981519152811461172557604051632a87526960e21b8152600481018290526024016116eb565b6000805160206156148339815191528390556040516001600160a01b038416907fbc7cd75a20ee27fd9adebab32041f755214dbc6bffa90cc0225b39da2e5c2d3b90600090a28151156117ee576000836001600160a01b03168360405161178c9190615421565b600060405180830381855af49150503d80600081146117c7576040519150601f19603f3d011682016040523d82523d6000602084013e6117cc565b606091505b5050905080610b0b576040516339b21b5d60e11b815260040160405180910390fd5b505b5050565b6000306001600160a01b037f0000000000000000000000000000000000000000000000000000000000000000161461183f5760405163703e46dd60e11b815260040160405180910390fd5b5060008051602061561483398151915290565b6007818154811061186257600080fd5b60009182526020909120600490910201805460018201546002909201546001600160601b0382169350600160601b9091046001600160a01b03169160ff80821692610100909204169085565b600080600783815481106118c4576118c46151fb565b60009182526020822060036004909202019081018054919350906118ea90600190615227565b815481106118fa576118fa6151fb565b600091825260208220845460058054600b909402909201945090916001600160601b0390911690811061192f5761192f6151fb565b90600052602060002090600c0201905080600501548260030154106119ce5782546001600160601b031660001901611970576001600160ff1b0393506119fb565b6003820154611980906002615358565b61198b9060016153d1565b81546005805490916001600160601b03169081106119ab576119ab6151fb565b90600052602060002090600c0201600401546119c79190615358565b93506119fb565b60038201546119de906002615358565b6119e99060016153d1565b81600401546119f89190615358565b93505b505050919050565b6000546001600160a01b03163314611a2e5760405163c383977560e01b815260040160405180910390fd5b6000836001600160a01b03168383604051611a499190615421565b60006040518083038185875af1925050503d8060008114611a86576040519150601f19603f3d011682016040523d82523d6000602084013e611a8b565b606091505b5050905080610b0b576040516322092f2f60e11b815260040160405180910390fd5b6117ee338383600080613f9e565b6000546001600160a01b03163314611ae65760405163c383977560e01b815260040160405180910390fd5b6001600160a01b038216600081815260086020526040808220805460ff191685151590811790915590519092917f541615e167511d757a7067a700eb54431b256bb458dfdce0ac58bf2ed0aefd4491a35050565b6000546001600160a01b03163314611b655760405163c383977560e01b815260040160405180910390fd5b6001600160a01b038316600081815260086020908152604091829020805469ffffffffffffffffff0019166101006001600160401b03881690810260ff60481b191691909117600160481b60ff8816908102919091179092558351908152918201527fe6996b7f03e9bd02228b99d3d946932e3197f505f60542c4cfbc919441d8a4e6910160405180910390a2505050565b6000546001600160a01b03163314611c225760405163c383977560e01b815260040160405180910390fd5b60006005886001600160601b031681548110611c4057611c406151fb565b90600052602060002090600c0201905060016001600160601b0316886001600160601b031614158015611ca2575080546005805488926001600160601b0316908110611c8e57611c8e6151fb565b90600052602060002090600c020160020154115b15611cc057604051639717078960e01b815260040160405180910390fd5b60005b6001820154811015611d3b57866005836001018381548110611ce757611ce76151fb565b906000526020600020015481548110611d0257611d026151fb565b90600052602060002090600c0201600201541015611d3357604051639717078960e01b815260040160405180910390fd5b600101611cc3565b5060028101869055805460ff60601b1916600160601b8815150217815560038101859055600480820185905560058201849055611d7e90600683019084906147a4565b50876001600160601b03167f709b1f5fda58af9a4f52dacd1ec404840a8148455700cce155a2bd8cf127ef1a888888888888604051611dc29695949392919061543d565b60405180910390a25050505050505050565b611e3a60405180610160016040528060008152602001600081526020016000815260200160008152602001600081526020016000815260200160608152602001600081526020016000815260200160006001600160a01b03168152602001600081525090565b60078381548110611e4d57611e4d6151fb565b90600052602060002090600402016003018281548110611e6f57611e6f6151fb565b90600052602060002090600b02016040518061016001604052908160008201548152602001600182015481526020016002820154815260200160038201548152602001600482015481526020016005820154815260200160068201805480602002602001604051908101604052809291908181526020018280548015611f1e57602002820191906000526020600020905b81546001600160a01b03168152600190910190602001808311611f00575b5050509183525050600782015460208201526008820154604082015260098201546001600160a01b03166060820152600a909101546080909101529392505050565b600060078281548110611f7557611f756151fb565b600091825260209091206004918202019150600182015460ff166004811115611fa057611fa0614b3e565b14611fbe57604051638794ce4b60e01b815260040160405180910390fd5b6001810154610100900460ff1615611fe95760405163c977f8d360e01b815260040160405180910390fd5b6000611ff48361119b565b505060018301805461010061ff001990911617905582546040518281529192508491600160601b9091046001600160a01b0316907f394027a5fa6e098a1191094d1719d6929b9abc535fcc0c8f448d6a4e756222769060200160405180910390a3815460405163188d362b60e11b81526004810185905260248101839052600160601b9091046001600160a01b03169063311a6c5690604401600060405180830381600087803b1580156120a757600080fd5b505af11580156120bb573d6000803e3d6000fd5b50505050505050565b600681815481106120d457600080fd5b6000918252602090912001546001600160a01b0316905081565b600080600060078481548110612106576121066151fb565b6000918252602090912060049091020190506003600182015460ff16600481111561213357612133614b3e565b0361218b576002810154815460058054929550916001600160601b03909116908110612161576121616151fb565b600091825260209091206009600c909202010154600282015461218491906153d1565b9150612194565b60009250600091505b50915091565b6000546001600160a01b031633146121c55760405163c383977560e01b815260040160405180910390fd5b600480546001600160a01b0319166001600160a01b0392909216919091179055565b6000546001600160a01b0316331480159061220d57506001546001600160a01b03163314155b1561222b57604051633244d29960e21b815260040160405180910390fd5b600060078381548110612240576122406151fb565b906000526020600020906004020190506000600182600301805490506122669190615227565b9050600082600301828154811061227f5761227f6151fb565b600091825260208220600b909102019150600184015460ff1660048111156122a9576122a9614b3e565b146122c757604051638285c4ef60e01b815260040160405180910390fd5b60038101546006820154106122ef57604051634df06de360e01b815260040160405180910390fd5b60048054604051633c694c4160e21b81526001600160a01b039091169163f1a531049161231e918891016149af565b600060405180830381600087803b15801561233857600080fd5b505af115801561234c573d6000803e3d6000fd5b5050505060006006826000015481548110612369576123696151fb565b6000918252602082200154600a8401546001600160a01b0390911692506123919060016153d1565b60405163695c01ad60e11b815260048101899052602481018290529091506000906001600160a01b0384169063d2b8035a906044016020604051808303816000875af11580156123e5573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906124099190615470565b90506001600160a01b03811661243257604051632e38b8f760e11b815260040160405180910390fd5b6004805460018601546040516310f0b12f60e11b81526001600160a01b03909216926321e1625e9261246892869290910161548d565b600060405180830381600087803b15801561248257600080fd5b505af1158015612496573d6000803e3d6000fd5b50505060068501546040518a92506001600160a01b038416917f6119cf536152c11e0a9a6c22f3953ce4ecc93ee54fa72ffa326ffabded21509b916124e3918a8252602082015260400190565b60405180910390a36006840180546001810182556000828152602090200180546001600160a01b0319166001600160a01b038416179055600385015490540361258a5760048054604051632e96bc2360e11b81529182018a9052602482018790526001600160a01b031690635d2d784690604401600060405180830381600087803b15801561257157600080fd5b505af1158015612585573d6000803e3d6000fd5b505050505b50600a8301555060048054604051633c694c4160e21b81526001600160a01b039091169163f1a53104916125c191600091016149af565b600060405180830381600087803b1580156125db57600080fd5b505af11580156125ef573d6000803e3d6000fd5b505050505050505050565b6000612605826133d2565b34101561262557604051630e3360f160e21b815260040160405180910390fd5b6110998383600034614158565b6000546001600160a01b0316331461265d5760405163c383977560e01b815260040160405180910390fd5b600380546001600160a01b0319166001600160a01b0392909216919091179055565b612688836118ae565b3410156126a857604051633191f8f160e01b815260040160405180910390fd5b6000600784815481106126bd576126bd6151fb565b6000918252602090912060049091020190506003600182015460ff1660048111156126ea576126ea614b3e565b14612708576040516337cdefcb60e21b815260040160405180910390fd5b6003810180546000919061271e90600190615227565b8154811061272e5761272e6151fb565b90600052602060002090600b020190506006816000015481548110612755576127556151fb565b6000918252602090912001546001600160a01b031633146127895760405163065f245f60e01b815260040160405180910390fd5b8154815460038401805460018101825560009182526020909120600580546001600160601b0390951694600b90930290910191849081106127cc576127cc6151fb565b90600052602060002090600c0201600501548460030154106128d5576005836001600160601b031681548110612804576128046151fb565b60009182526020909120600c9091020154600580546001600160601b0390921694509084908110612837576128376151fb565b60009182526020808320858452600a600c90930201919091019052604090205460ff1661286357600191505b84546001600160601b038481169116146128d557845460038601546001600160601b039091169061289690600190615227565b6040516001600160601b03861681528a907f736e3f52761298c8c0823e1ebf482ed3c5ecb304f743d2d91a7c006e8e8d7a1f9060200160405180910390a45b84546001600160601b0319166001600160601b038416908117865560018601805460ff1916905542600287015560058054600092908110612918576129186151fb565b90600052602060002090600c020190508060040154346129389190615385565b8260030181905550612710816003015482600201546129579190615358565b6129619190615385565b60018084019190915534600284015583835560045460038801546001600160a01b039091169163d09f392d918c9161299891615227565b6040516001600160e01b031960e085901b16815260048101929092526024820152604401600060405180830381600087803b1580156129d657600080fd5b505af11580156129ea573d6000803e3d6000fd5b505086548454149150612ad090505784546003870154612a0c90600190615227565b83546040519081528b907fcbe7939a71f0b369c7471d760a0a99b60b7bb010ee0406cba8a46679d1ea77569060200160405180910390a46006826000015481548110612a5a57612a5a6151fb565b60009182526020909120015460038301546040516302dbb79560e61b81526001600160a01b039092169163b6ede54091612a9d918d918d918d91906004016154a6565b600060405180830381600087803b158015612ab757600080fd5b505af1158015612acb573d6000803e3d6000fd5b505050505b8554604051600160601b9091046001600160a01b0316908a907f9c9b64db9e130f48381bf697abf638e73117dbfbfd7a4484f2da3ba188f4187d90600090a3887f4e6f5cf43b95303e86aee81683df63992061723a829ee012db21dad388756b916000604051612b409190615257565b60405180910390a2505050505050505050565b60008060078381548110612b6957612b696151fb565b906000526020600020906004020190508060030160018260030180549050612b919190615227565b81548110612ba157612ba16151fb565b90600052602060002090600b020160030154915050919050565b6000546001600160a01b03163314612be65760405163c383977560e01b815260040160405180910390fd5b6006805460018101825560009182527ff652222313e28459528d920b65115c16c04f3efc82aaedc97be59f3f377c0d3f810180546001600160a01b0319166001600160a01b0385169081179091556040519192909183917f44063d258760b98116d53815adbc906a56b3563e540148cc0fc2457f83b5eeb291a35050565b6000546001600160a01b03163314612c8f5760405163c383977560e01b815260040160405180910390fd5b856005896001600160601b031681548110612cac57612cac6151fb565b90600052602060002090600c0201600201541115612cdd57604051639717078960e01b815260040160405180910390fd5b8051600003612cff5760405163402585f560e01b815260040160405180910390fd5b6001600160601b038816612d2657604051631ef4f64960e01b815260040160405180910390fd5b60058054600181018255600091825290600c82027f036b6384b5eca791c62761152d0c79bb0604c104a5fb6f4eb0703f3154bb3db001905b8351811015612e1557838181518110612d7957612d796151fb565b602002602001015160001480612dac57506006548451859083908110612da157612da16151fb565b602002602001015110155b15612dca57604051633d58a98960e11b815260040160405180910390fd5b600182600a016000868481518110612de457612de46151fb565b6020908102919091018101518252810191909152604001600020805460ff1916911515919091179055600101612d5e565b5060016000908152600a8201602052604090205460ff16612e49576040516306351b3d60e31b815260040160405180910390fd5b80546001600160601b0319166001600160601b038b161781556040805160008152602081019182905251612e819160018401916147e2565b50805460ff60601b1916600160601b8a1515021781556002810188905560038101879055600480820187905560058201869055612ec490600683019086906147a4565b5060058a6001600160601b031681548110612ee157612ee16151fb565b600091825260208083206001600c909302018201805492830181558352909120018290556040516001600160601b038b169083907f3475f0ed7216dd7d453db663a1c3024e4f36cc925521d54edb9d13e022cbee3d90612f4e908d908d908d908d908d908d908d906154ef565b60405180910390a350505050505050505050565b6000612fa7826103c386868080601f0160208091040260200160405190810160405280939291908181526020018383808284376000920191909152506133d292505050565b949350505050565b7ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e805460019190600160401b900460ff1680612ff8575080546001600160401b03808416911610155b156130155760405162dc149f60e41b815260040160405180910390fd5b805468ffffffffffffffffff19166001600160401b03831617600160401b178155600080546001600160a01b03808e166001600160a01b0319928316178355600180548e8316908416178155600280548e8416908516178155600380548e8516908616179055600480548985169086161790556006805481875291820190557ff652222313e28459528d920b65115c16c04f3efc82aaedc97be59f3f377c0d40018054928c1692909316821790925560405190927f44063d258760b98116d53815adbc906a56b3563e540148cc0fc2457f83b5eeb291a360058054600082815260028201909255600c6001909101027f036b6384b5eca791c62761152d0c79bb0604c104a5fb6f4eb0703f3154bb3db0810180546001600160601b031916815560408051938452602084019081905292519092613174927f036b6384b5eca791c62761152d0c79bb0604c104a5fb6f4eb0703f3154bb3db101916147e2565b50805460ff60601b1916600160601b8815150217815585516002820155602086015160038201556040860151600480830191909155606087015160058301556131c390600683019087906147a4565b50805486516020808901516040808b015160608c0151825160008082529581019093526001600160601b03909616956001957f3475f0ed7216dd7d453db663a1c3024e4f36cc925521d54edb9d13e022cbee3d958f959194919392918e915060405161323597969594939291906154ef565b60405180910390a361324a60018060016134d5565b50805460ff60401b191681556040516001600160401b03831681527fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d29060200160405180910390a15050505050505050505050565b6000546001600160a01b031633146132ca5760405163c383977560e01b815260040160405180910390fd5b600080546001600160a01b0319166001600160a01b0392909216919091179055565b6001600160a01b03821660009081526008602052604081205460ff166133255760405163e51cf7bf60e01b815260040160405180910390fd5b613330858585612f62565b82101561335057604051630e3360f160e21b815260040160405180910390fd5b6133656001600160a01b03841633308561443f565b613382576040516312171d8360e31b815260040160405180910390fd5b6133c68686868080601f0160208091040260200160405190810160405280939291908181526020018383808284376000920191909152508892508791506141589050565b90505b95945050505050565b60008060006133e08461451b565b5091509150806005836001600160601b031681548110613402576134026151fb565b90600052602060002090600c020160040154612fa79190615358565b6004546001600160a01b0316331461344957604051639d6cab9960e01b815260040160405180910390fd5b613457848484846001613f9e565b5050505050565b600060078281548110613473576134736151fb565b600091825260209091206003600490920201015492915050565b60006005836001600160601b0316815481106134ab576134ab6151fb565b60009182526020808320948352600c91909102909301600a0190925250604090205460ff16919050565b806005846001600160601b0316815481106134f2576134f26151fb565b60009182526020808320868452600c92909202909101600a0190526040808220805460ff19169315159390931790925590518215159184916001600160601b038716917fb47629acdf64971062d40984f77d3dee212d735b11e3e8c7a4222d9f0572cc7991a4505050565b6000806007836000015181548110613577576135776151fb565b906000526020600020906004020190506000816003018460200151815481106135a2576135a26151fb565b90600052602060002090600b02019050600060068260000154815481106135cb576135cb6151fb565b60009182526020808320919091015487519188015160e089015160808a015160a08b01516040516333ac937b60e11b8152600481019690965260248601939093526044850191909152606484015260848301526001600160a01b03169250829063675926f69060a401602060405180830381865afa158015613651573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061367591906153e4565b905061271081111561368657506127105b60006127106136958382615227565b85600101546136a49190615358565b6136ae9190615385565b9050808760c0018181516136c291906153d1565b90525060e08701516006850180546000929081106136e2576136e26151fb565b6000918252602090912001546004805460405163965af6c760e01b81526001600160a01b03938416945092169163965af6c79161372391859187910161548d565b600060405180830381600087803b15801561373d57600080fd5b505af1158015613751573d6000803e3d6000fd5b505060048054604051633c85b79360e21b81526001600160a01b03909116935063f216de4c925061378691859187910161548d565b600060405180830381600087803b1580156137a057600080fd5b505af11580156137b4573d6000803e3d6000fd5b50505050602088015188516001600160a01b0383167f8975b837fe0d18616c65abb8b843726a32b552ee4feca009944fa658bbb282e7866137f48761556e565b60098b01546040516138169392916000916001600160a01b039091169061558a565b60405180910390a48751602089015160e08a015160405163ba66fde760e01b81526004810193909352602483019190915260448201526001600160a01b0385169063ba66fde790606401602060405180830381865afa15801561387d573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906138a1919061523a565b613907576004805460405163b5d69e9960e01b81526001600160a01b039091169163b5d69e99916138d4918591016149af565b600060405180830381600087803b1580156138ee57600080fd5b505af1158015613902573d6000803e3d6000fd5b505050505b600188606001516139189190615227565b8860e0015114801561392c57506040880151155b15613a1d5760098501546001600160a01b0316613975576000805460028701546040516001600160a01b039092169281156108fc029290818181858888f193505050505061399c565b6000546002860154600987015461399a926001600160a01b03918216929116906145a2565b505b60005460c08901516002546139bf926001600160a01b03918216929116906145a2565b506020880151885160c08a0151600288015460098901546040517f6cecfd3ec56289ccb16e30eb194f9a87dfdc12630b9abbc31fc69af5a0b0eaf493613a1493909290916001600160a01b03909116906155ae565b60405180910390a35b50505060c090940151949350505050565b60006007826000015181548110613a4757613a476151fb565b90600052602060002090600402019050600081600301836020015181548110613a7257613a726151fb565b90600052602060002090600b0201905060006006826000015481548110613a9b57613a9b6151fb565b6000918252602080832090910154865191870151606088015160e08901516001600160a01b039093169550859363675926f693909291613ada916155cd565b60808a015160a08b01516040516001600160e01b031960e088901b1681526004810195909552602485019390935260448401919091526064830152608482015260a401602060405180830381865afa158015613b3a573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190613b5e91906153e4565b9050612710811115613b6f57506127105b60008360060186606001518760e00151613b8991906155cd565b81548110613b9957613b996151fb565b600091825260208220015460018601546001600160a01b03909116925061271090613bc5908590615358565b613bcf9190615385565b6004805460405163965af6c760e01b81529293506001600160a01b03169163965af6c791613c0191869186910161548d565b600060405180830381600087803b158015613c1b57600080fd5b505af1158015613c2f573d6000803e3d6000fd5b505060048054604051636624192f60e01b81526001600160a01b039091169350636624192f9250613c62918691016149af565b602060405180830381865afa158015613c7f573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190613ca3919061523a565b613cc057600254613cbe906001600160a01b031683836145a2565b505b60006127108489604001518a60c00151613cda9190615385565b613ce49190615358565b613cee9190615385565b905080866008016000828254613d0491906153d1565b925050819055506000612710858a604001518960020154613d259190615385565b613d2f9190615358565b613d399190615385565b905080876007016000828254613d4f91906153d1565b9091555050600254613d6b906001600160a01b031685846145a2565b5060098701546001600160a01b0316613da9576040516001600160a01b0385169082156108fc029083906000818181858888f1935050505050613dc4565b6009870154613dc2906001600160a01b031685836145a2565b505b6020890151895160098901546040516001600160a01b03888116927f8975b837fe0d18616c65abb8b843726a32b552ee4feca009944fa658bbb282e792613e14928c928a928a929091169061558a565b60405180910390a4600189606001516002613e2f9190615358565b613e399190615227565b8960e00151036125ef57600087600801548a60c00151613e599190615227565b9050600088600701548960020154613e719190615227565b905081151580613e8057508015155b15611556578115613eaa57600054600254613ea8916001600160a01b039182169116846145a2565b505b8015613f115760098901546001600160a01b0316613ef057600080546040516001600160a01b039091169183156108fc02918491818181858888f1935050505050613f11565b60005460098a0154613f0f916001600160a01b039182169116836145a2565b505b60208b01518b5160098b01546040517f6cecfd3ec56289ccb16e30eb194f9a87dfdc12630b9abbc31fc69af5a0b0eaf491613f5b91879187916001600160a01b03909116906155ae565b60405180910390a35050505050505050505050565b6000546001600160a01b03163314613f9b5760405163c383977560e01b815260040160405180910390fd5b50565b60006001600160601b0385161580613fc057506005546001600160601b038616115b15613fd857613fd082600461466f565b5060006133c9565b831580159061401357506005856001600160601b031681548110613ffe57613ffe6151fb565b90600052602060002090600c02016002015484105b1561402357613fd082600561466f565b60048054604051630a5861b960e41b81526001600160a01b03898116938201939093526001600160601b03881660248201526044810187905285151560648201526000928392839291169063a5861b90906084016060604051808303816000875af1158015614096573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906140ba91906155e1565b9194509250905060008160078111156140d5576140d5614b3e565b146140f0576140e4858261466f565b600093505050506133c9565b821561411d5760025461410e906001600160a01b03168a308661443f565b61411d576140e485600161466f565b81156141495760025461413a906001600160a01b03168a846145a2565b614149576140e485600261466f565b50600198975050505050505050565b60008060006141668661451b565b92505091506005826001600160601b031681548110614187576141876151fb565b60009182526020808320848452600a600c90930201919091019052604090205460ff166141c75760405163b34eb75d60e01b815260040160405180910390fd5b600780546001810182556000918252600160601b33026001600160601b03851617600482027fa66cc928b5edb82af9bd49922954155ab7b0942694bea4ce44661d9a8736c6888101918255427fa66cc928b5edb82af9bd49922954155ab7b0942694bea4ce44661d9a8736c68a909101556006805492965090929184908110614252576142526151fb565b6000918252602082200154600580546001600160a01b039092169350906001600160601b038716908110614288576142886151fb565b60009182526020808320600387018054600181018255908552918420600c909302019350600b0201906001600160a01b038a16156142d3576142ce8a8460040154611048565b6142d9565b82600401545b90506142e5818a615385565b60038084019190915586835583015460028401546127109161430691615358565b6143109190615385565b6001830155600282018990556009820180546001600160a01b0319166001600160a01b038c8116919091179091556004805460405163d09f392d60e01b81529182018b9052600060248301529091169063d09f392d90604401600060405180830381600087803b15801561438357600080fd5b505af1158015614397573d6000803e3d6000fd5b50505050836001600160a01b031663b6ede540898e8e86600301546040518563ffffffff1660e01b81526004016143d194939291906154a6565b600060405180830381600087803b1580156143eb57600080fd5b505af11580156143ff573d6000803e3d6000fd5b50506040513392508a91507f141dfc18aa6a56fc816f44f0e9e2f1ebc92b15ab167770e17db5b084c10ed99590600090a350505050505050949350505050565b6040516001600160a01b038481166024830152838116604483015260648201839052600091829182919088169060840160408051601f198184030181529181526020820180516001600160e01b03166323b872dd60e01b179052516144a49190615421565b6000604051808303816000865af19150503d80600081146144e1576040519150601f19603f3d011682016040523d82523d6000602084013e6144e6565b606091505b5091509150818015614510575080511580614510575080806020019051810190614510919061523a565b979650505050505050565b60008060006040845110614590575050506020810151604082015160608301516001600160601b038316158061455c57506005546001600160601b03841610155b1561456657600192505b8160000361457357600391505b80158061458257506006548110155b1561458b575060015b61459b565b506001915060039050815b9193909250565b6000806000856001600160a01b031685856040516024016145c492919061548d565b60408051601f198184030181529181526020820180516001600160e01b031663a9059cbb60e01b179052516145f99190615421565b6000604051808303816000865af19150503d8060008114614636576040519150601f19603f3d011682016040523d82523d6000602084013e61463b565b606091505b5091509150818015614665575080511580614665575080806020019051810190614665919061523a565b9695505050505050565b600182600181111561468357614683614b3e565b0361468c575050565b60018160078111156146a0576146a0614b3e565b036146be57604051630f323ed960e11b815260040160405180910390fd5b60028160078111156146d2576146d2614b3e565b036146f05760405163e45e13a360e01b815260040160405180910390fd5b600381600781111561470457614704614b3e565b0361472257604051631d91d0ed60e31b815260040160405180910390fd5b600481600781111561473657614736614b3e565b03614754576040516321f1774b60e11b815260040160405180910390fd5b600581600781111561476857614768614b3e565b036117f057604051630caac6b360e31b815260040160405180910390fd5b60405180608001604052806004906020820280368337509192915050565b82600481019282156147d2579160200282015b828111156147d25782518255916020019190600101906147b7565b506147de92915061481c565b5090565b8280548282559060005260206000209081019282156147d257916020028201828111156147d25782518255916020019190600101906147b7565b5b808211156147de576000815560010161481d565b6001600160a01b0381168114613f9b57600080fd5b60006020828403121561485857600080fd5b813561486381614831565b9392505050565b80356001600160601b038116811461488157600080fd5b919050565b634e487b7160e01b600052604160045260246000fd5b604051601f8201601f191681016001600160401b03811182821017156148c4576148c4614886565b604052919050565b600082601f8301126148dd57600080fd5b813560206001600160401b038211156148f8576148f8614886565b8160051b61490782820161489c565b928352848101820192828101908785111561492157600080fd5b83870192505b8483101561451057823582529183019190830190614927565b8015158114613f9b57600080fd5b60008060006060848603121561496357600080fd5b61496c8461486a565b925060208401356001600160401b0381111561498757600080fd5b614993868287016148cc565b92505060408401356149a481614940565b809150509250925092565b6001600160a01b0391909116815260200190565b6000602082840312156149d557600080fd5b5035919050565b600080604083850312156149ef57600080fd5b82356149fa81614831565b946020939093013593505050565b600080600060608486031215614a1d57600080fd5b505081359360208301359350604090920135919050565b600060208284031215614a4657600080fd5b6110998261486a565b8060005b6004811015610b0b578151845260209384019390910190600101614a53565b6080810161109c8284614a4f565b600082601f830112614a9157600080fd5b81356001600160401b03811115614aaa57614aaa614886565b614abd601f8201601f191660200161489c565b818152846020838601011115614ad257600080fd5b816020850160208301376000918101602001919091529392505050565b60008060408385031215614b0257600080fd5b8235614b0d81614831565b915060208301356001600160401b03811115614b2857600080fd5b614b3485828601614a80565b9150509250929050565b634e487b7160e01b600052602160045260246000fd5b60058110614b7257634e487b7160e01b600052602160045260246000fd5b9052565b6001600160601b03861681526001600160a01b038516602082015260a08101614ba26040830186614b54565b9215156060820152608001529392505050565b600080600060608486031215614bca57600080fd5b8335614bd581614831565b92506020840135915060408401356001600160401b03811115614bf757600080fd5b614c0386828701614a80565b9150509250925092565b60008060408385031215614c2057600080fd5b6149fa8361486a565b60008060408385031215614c3c57600080fd5b8235614c4781614831565b91506020830135614c5781614940565b809150509250929050565b600080600060608486031215614c7757600080fd5b8335614c8281614831565b925060208401356001600160401b0381168114614c9e57600080fd5b9150604084013560ff811681146149a457600080fd5b600082601f830112614cc557600080fd5b604051608081018181106001600160401b0382111715614ce757614ce7614886565b604052806080840185811115614cfc57600080fd5b845b81811015614d16578035835260209283019201614cfe565b509195945050505050565b6000806000806000806000610140888a031215614d3d57600080fd5b614d468861486a565b96506020880135614d5681614940565b955060408801359450606088013593506080880135925060a08801359150614d818960c08a01614cb4565b905092959891949750929550565b60008060408385031215614da257600080fd5b50508035926020909101359150565b60008151808452602080850194506020840160005b83811015614deb5781516001600160a01b031687529582019590820190600101614dc6565b509495945050505050565b6020815281516020820152602082015160408201526040820151606082015260608201516080820152608082015160a082015260a082015160c0820152600060c08301516101608060e0850152614e51610180850183614db1565b60e08601516101008681019190915286015161012080870191909152860151909250610140614e8a818701836001600160a01b03169052565b959095015193019290925250919050565b60008060408385031215614eae57600080fd5b823591506020830135614c5781614831565b60008060408385031215614ed357600080fd5b8235915060208301356001600160401b03811115614b2857600080fd5b600080600060608486031215614f0557600080fd5b833592506020840135915060408401356001600160401b03811115614bf757600080fd5b600080600080600080600080610160898b031215614f4657600080fd5b614f4f8961486a565b97506020890135614f5f81614940565b965060408901359550606089013594506080890135935060a08901359250614f8a8a60c08b01614cb4565b91506101408901356001600160401b03811115614fa657600080fd5b614fb28b828c016148cc565b9150509295985092959890939650565b60008083601f840112614fd457600080fd5b5081356001600160401b03811115614feb57600080fd5b60208301915083602082850101111561500357600080fd5b9250929050565b60008060006040848603121561501f57600080fd5b83356001600160401b0381111561503557600080fd5b61504186828701614fc2565b90945092505060208401356149a481614831565b60008060008060008060008060006101e08a8c03121561507457600080fd5b893561507f81614831565b985060208a013561508f81614831565b975060408a013561509f81614831565b965060608a01356150af81614831565b955060808a01356150bf81614831565b945060a08a01356150cf81614940565b93506150de8b60c08c01614cb4565b92506150ee8b6101408c01614cb4565b91506101c08a01356150ff81614831565b809150509295985092959850929598565b60008060008060006080868803121561512857600080fd5b8535945060208601356001600160401b0381111561514557600080fd5b61515188828901614fc2565b909550935050604086013561516581614831565b949793965091946060013592915050565b60006020828403121561518857600080fd5b81356001600160401b0381111561519e57600080fd5b612fa784828501614a80565b600080600080608085870312156151c057600080fd5b84356151cb81614831565b93506151d96020860161486a565b92506040850135915060608501356151f081614940565b939692955090935050565b634e487b7160e01b600052603260045260246000fd5b634e487b7160e01b600052601160045260246000fd5b8181038181111561109c5761109c615211565b60006020828403121561524c57600080fd5b815161486381614940565b6020810161109c8284614b54565b600181815b808511156152a057816000190482111561528657615286615211565b8085161561529357918102915b93841c939080029061526a565b509250929050565b6000826152b75750600161109c565b816152c45750600061109c565b81600181146152da57600281146152e457615300565b600191505061109c565b60ff8411156152f5576152f5615211565b50506001821b61109c565b5060208310610133831016604e8410600b8410161715615323575081810a61109c565b61532d8383615265565b806000190482111561534157615341615211565b029392505050565b600061109960ff8416836152a8565b808202811582820484141761109c5761109c615211565b634e487b7160e01b600052601260045260246000fd5b6000826153945761539461536f565b500490565b6000806000606084860312156153ae57600080fd5b8351925060208401516153c081614940565b60408501519092506149a481614940565b8082018082111561109c5761109c615211565b6000602082840312156153f657600080fd5b5051919050565b60005b83811015615418578181015183820152602001615400565b50506000910152565b600082516154338184602087016153fd565b9190910192915050565b600061012082019050871515825286602083015285604083015284606083015283608083015261451060a0830184614a4f565b60006020828403121561548257600080fd5b815161486381614831565b6001600160a01b03929092168252602082015260400190565b84815283602082015260806040820152600083518060808401526154d18160a08501602088016153fd565b606083019390935250601f91909101601f19160160a0019392505050565b60006101408083018a1515845260208a602086015289604086015288606086015287608086015261552360a0860188614a4f565b610120850192909252845190819052610160840191602086019160005b8181101561555c57835185529382019392820192600101615540565b50929c9b505050505050505050505050565b6000600160ff1b820161558357615583615211565b5060000390565b938452602084019290925260408301526001600160a01b0316606082015260800190565b92835260208301919091526001600160a01b0316604082015260600190565b6000826155dc576155dc61536f565b500690565b6000806000606084860312156155f657600080fd5b83519250602084015191506040840151600881106149a457600080fdfe360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbca264697066735822122088332e4bd463fd5a2a31ab980f2b2ead694ff8b8a10a33684171a45128537f0a64736f6c63430008180033",
-  "deployedBytecode": "0x60806040526004361061027c5760003560e01c80638a9bb02a1161014f578063d07368bd116100c1578063f6506db41161007a578063f6506db414610867578063f7434ea914610887578063fbb519e7146108a7578063fbf405b0146108c7578063fc6f8f16146108e7578063fe524c391461090757600080fd5b8063d07368bd146107b2578063d4d1d76a146107d2578063d874514b146107e7578063d98493f614610807578063e399d29b14610827578063e4c0aaf41461084757600080fd5b8063b702a87911610113578063b702a8791461070c578063c13517e11461072c578063c258bb191461073f578063c35699021461075f578063c71f425314610772578063cf0c38f81461079257600080fd5b80638a9bb02a1461064a5780638bb0487514610677578063acdbf51d14610697578063afe15cfb146106b7578063b0049637146106ec57600080fd5b80632e1daf2f116101f357806371ae413d116101ac57806371ae413d1461058a578063751accd0146105aa5780637717a6e8146105ca5780637934c0be146105ea57806382d022371461060a57806386541b241461062a57600080fd5b80632e1daf2f146104c45780633cfd1184146104e45780634f1ef2861461051157806352d1902d14610524578063564a565d1461053957806359ec827e1461056a57600080fd5b8063115d537611610245578063115d5376146103885780631860592b146103a857806319b81529146103d65780631c3db16d146104065780631f5a0dd2146104435780632d29a47b146104a457600080fd5b8062f5822c146102815780630219da79146102a357806309cfdc9c1461031b5780630b7414bc1461033b5780630c340a241461035b575b600080fd5b34801561028d57600080fd5b506102a161029c366004614846565b610927565b005b3480156102af57600080fd5b506102ee6102be366004614846565b60086020526000908152604090205460ff808216916001600160401b0361010082041691600160481b9091041683565b6040805193151584526001600160401b03909216602084015260ff16908201526060015b60405180910390f35b34801561032757600080fd5b506102a1610336366004614846565b610974565b34801561034757600080fd5b506102a161035636600461494e565b6109da565b34801561036757600080fd5b5060005461037b906001600160a01b031681565b60405161031291906149af565b34801561039457600080fd5b506102a16103a33660046149c3565b610b11565b3480156103b457600080fd5b506103c86103c33660046149dc565b611048565b604051908152602001610312565b3480156103e257600080fd5b506103f66103f13660046149c3565b6110a2565b6040519015158152602001610312565b34801561041257600080fd5b506104266104213660046149c3565b61119b565b604080519384529115156020840152151590820152606001610312565b34801561044f57600080fd5b5061046361045e3660046149c3565b61129c565b604080516001600160601b0390981688529515156020880152948601939093526060850191909152608084015260a0830152151560c082015260e001610312565b3480156104b057600080fd5b506102a16104bf366004614a08565b6112fb565b3480156104d057600080fd5b5060045461037b906001600160a01b031681565b3480156104f057600080fd5b506105046104ff366004614a34565b611563565b6040516103129190614a72565b6102a161051f366004614aef565b6115cd565b34801561053057600080fd5b506103c86117f4565b34801561054557600080fd5b506105596105543660046149c3565b611852565b604051610312959493929190614b76565b34801561057657600080fd5b506103c86105853660046149c3565b6118ae565b34801561059657600080fd5b5060015461037b906001600160a01b031681565b3480156105b657600080fd5b506102a16105c5366004614bb5565b611a03565b3480156105d657600080fd5b506102a16105e5366004614c0d565b611aad565b3480156105f657600080fd5b506102a1610605366004614c29565b611abb565b34801561061657600080fd5b506102a1610625366004614c62565b611b3a565b34801561063657600080fd5b506102a1610645366004614d21565b611bf7565b34801561065657600080fd5b5061066a610665366004614d8f565b611dd4565b6040516103129190614df6565b34801561068357600080fd5b506102a16106923660046149c3565b611f60565b3480156106a357600080fd5b5061037b6106b23660046149c3565b6120c4565b3480156106c357600080fd5b506106d76106d23660046149c3565b6120ee565b60408051928352602083019190915201610312565b3480156106f857600080fd5b506102a1610707366004614846565b61219a565b34801561071857600080fd5b506102a1610727366004614e9b565b6121e7565b6103c861073a366004614ec0565b6125fa565b34801561074b57600080fd5b506102a161075a366004614846565b612632565b6102a161076d366004614ef0565b61267f565b34801561077e57600080fd5b506103c861078d3660046149c3565b612b53565b34801561079e57600080fd5b5060035461037b906001600160a01b031681565b3480156107be57600080fd5b506102a16107cd366004614846565b612bbb565b3480156107de57600080fd5b506006546103c8565b3480156107f357600080fd5b506102a1610802366004614f29565b612c64565b34801561081357600080fd5b506103c861082236600461500a565b612f62565b34801561083357600080fd5b506102a1610842366004615055565b612faf565b34801561085357600080fd5b506102a1610862366004614846565b61329f565b34801561087357600080fd5b506103c8610882366004615110565b6132ec565b34801561089357600080fd5b506103c86108a2366004615176565b6133d2565b3480156108b357600080fd5b506102a16108c23660046151aa565b61341e565b3480156108d357600080fd5b5060025461037b906001600160a01b031681565b3480156108f357600080fd5b506103c86109023660046149c3565b61345e565b34801561091357600080fd5b506103f6610922366004614c0d565b61348d565b6000546001600160a01b031633146109525760405163c383977560e01b815260040160405180910390fd5b600280546001600160a01b0319166001600160a01b0392909216919091179055565b6000546001600160a01b0316331480159061099a57506001546001600160a01b03163314155b156109b857604051633244d29960e21b815260040160405180910390fd5b600180546001600160a01b0319166001600160a01b0392909216919091179055565b6000546001600160a01b03163314610a055760405163c383977560e01b815260040160405180910390fd5b60005b8251811015610b0b578115610aa457828181518110610a2957610a296151fb565b602002602001015160001480610a5c57506006548351849083908110610a5157610a516151fb565b602002602001015110155b15610a7a57604051633d58a98960e11b815260040160405180910390fd5b610a9f84848381518110610a9057610a906151fb565b602002602001015160016134d5565b610b03565b6001838281518110610ab857610ab86151fb565b602002602001015103610ade576040516356d111fd60e11b815260040160405180910390fd5b610b0384848381518110610af457610af46151fb565b602002602001015160006134d5565b600101610a08565b50505050565b600060078281548110610b2657610b266151fb565b600091825260208220600490910201805460058054929450916001600160601b03909116908110610b5957610b596151fb565b6000918252602082206003850154600c909202019250610b7b90600190615227565b90506000836003018281548110610b9457610b946151fb565b600091825260208220600b909102019150600185015460ff166004811115610bbe57610bbe614b3e565b03610c995781158015610c0d57506001840154600684019060ff166004811115610bea57610bea614b3e565b60048110610bfa57610bfa6151fb565b01546002850154610c0b9042615227565b105b15610c2b57604051633e9727df60e01b815260040160405180910390fd5b6003810154600682015414610c53576040516309e4486b60e41b815260040160405180910390fd5b8254600160601b900460ff16610c6a576002610c6d565b60015b60018086018054909160ff1990911690836004811115610c8f57610c8f614b3e565b0217905550610ffa565b60018085015460ff166004811115610cb357610cb3614b3e565b03610dc3576001840154600684019060ff166004811115610cd657610cd6614b3e565b60048110610ce657610ce66151fb565b01546002850154610cf79042615227565b108015610d8e57506006816000015481548110610d1657610d166151fb565b600091825260209091200154604051630baa64d160e01b8152600481018790526001600160a01b0390911690630baa64d190602401602060405180830381865afa158015610d68573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190610d8c919061523a565b155b15610dac57604051634dfa578560e11b815260040160405180910390fd5b6001808501805460029260ff199091169083610c8f565b6002600185015460ff166004811115610dde57610dde614b3e565b03610f2c576001840154600684019060ff166004811115610e0157610e01614b3e565b60048110610e1157610e116151fb565b01546002850154610e229042615227565b108015610eb957506006816000015481548110610e4157610e416151fb565b6000918252602090912001546040516336a66c7560e11b8152600481018790526001600160a01b0390911690636d4cd8ea90602401602060405180830381865afa158015610e93573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190610eb7919061523a565b155b15610ed757604051631988dead60e31b815260040160405180910390fd5b600184018054600360ff199091161790558354604051600160601b9091046001600160a01b03169086907fa5d41b970d849372be1da1481ffd78d162bfe57a7aa2fe4e5fb73481fa5ac24f90600090a3610ffa565b6003600185015460ff166004811115610f4757610f47614b3e565b03610fc1576001840154600684019060ff166004811115610f6a57610f6a614b3e565b60048110610f7a57610f7a6151fb565b01546002850154610f8b9042615227565b1015610faa57604051632f4dfd8760e01b815260040160405180910390fd5b6001808501805460049260ff199091169083610c8f565b6004600185015460ff166004811115610fdc57610fdc614b3e565b03610ffa576040516307f38c8f60e11b815260040160405180910390fd5b426002850155600184015460405186917f4e6f5cf43b95303e86aee81683df63992061723a829ee012db21dad388756b91916110399160ff1690615257565b60405180910390a25050505050565b6001600160a01b03821660009081526008602052604081205461010081046001600160401b03169061108590600160481b900460ff16600a615349565b61108f9084615358565b6110999190615385565b90505b92915050565b600080600783815481106110b8576110b86151fb565b60009182526020822060036004909202019081018054919350906110de90600190615227565b815481106110ee576110ee6151fb565b600091825260208220845460058054600b909402909201945090916001600160601b03909116908110611123576111236151fb565b90600052602060002090600c0201905080600501548260030154101561114e57506000949350505050565b80546005805490916001600160601b031690811061116e5761116e6151fb565b6000918252602080832094548352600a600c9092029094010190925250604090205460ff16159392505050565b600080600080600785815481106111b4576111b46151fb565b60009182526020822060036004909202019081018054919350906111da90600190615227565b815481106111ea576111ea6151fb565b90600052602060002090600b0201905060006006826000015481548110611213576112136151fb565b600091825260209091200154604051631c3db16d60e01b8152600481018990526001600160a01b0390911691508190631c3db16d90602401606060405180830381865afa158015611268573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061128c9190615399565b9199909850909650945050505050565b600581815481106112ac57600080fd5b60009182526020909120600c9091020180546002820154600383015460048401546005850154600b909501546001600160601b038516965060ff600160601b9095048516959394929391921687565b60008060078581548110611311576113116151fb565b600091825260209091206004918202019150600182015460ff16600481111561133c5761133c614b3e565b1461135a57604051638794ce4b60e01b815260040160405180910390fd5b80600301848154811061136f5761136f6151fb565b6000918252602082206004600b9092020190810154909350915061139384836153d1565b60058401546006850154600286015492935090916000906113b5908390615385565b905060008660010154905060008060068960000154815481106113da576113da6151fb565b60009182526020909120015460405163368efae360e21b8152600481018e9052602481018d90526001600160a01b039091169150819063da3beb8c90604401602060405180830381865afa158015611436573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061145a91906153e4565b915050806000036114765783861115611471578395505b611496565b611481846002615358565b86111561149657611493846002615358565b95505b60048801869055865b8681101561154257848110156114f8576114f16040518061010001604052808e81526020018d81526020018481526020018781526020018681526020018581526020018881526020018381525061355d565b955061153a565b61153a6040518061010001604052808e81526020018d815260200184815260200187815260200186815260200185815260200188815260200183815250613a2e565b60010161149f565b508488600501541461155657600588018590555b5050505050505050505050565b61156b614786565b6005826001600160601b031681548110611587576115876151fb565b6000918252602090912060408051608081019182905292600c029091016006019060049082845b8154815260200190600101908083116115ae5750505050509050919050565b6115d682613f70565b306001600160a01b037f000000000000000000000000000000000000000000000000000000000000000016148061165457507f00000000000000000000000000000000000000000000000000000000000000006001600160a01b03166116486000805160206156148339815191525490565b6001600160a01b031614155b156116725760405163703e46dd60e11b815260040160405180910390fd5b816001600160a01b03166352d1902d6040518163ffffffff1660e01b8152600401602060405180830381865afa9250505080156116cc575060408051601f3d908101601f191682019092526116c9918101906153e4565b60015b6116f45781604051630c76093760e01b81526004016116eb91906149af565b60405180910390fd5b600080516020615614833981519152811461172557604051632a87526960e21b8152600481018290526024016116eb565b6000805160206156148339815191528390556040516001600160a01b038416907fbc7cd75a20ee27fd9adebab32041f755214dbc6bffa90cc0225b39da2e5c2d3b90600090a28151156117ee576000836001600160a01b03168360405161178c9190615421565b600060405180830381855af49150503d80600081146117c7576040519150601f19603f3d011682016040523d82523d6000602084013e6117cc565b606091505b5050905080610b0b576040516339b21b5d60e11b815260040160405180910390fd5b505b5050565b6000306001600160a01b037f0000000000000000000000000000000000000000000000000000000000000000161461183f5760405163703e46dd60e11b815260040160405180910390fd5b5060008051602061561483398151915290565b6007818154811061186257600080fd5b60009182526020909120600490910201805460018201546002909201546001600160601b0382169350600160601b9091046001600160a01b03169160ff80821692610100909204169085565b600080600783815481106118c4576118c46151fb565b60009182526020822060036004909202019081018054919350906118ea90600190615227565b815481106118fa576118fa6151fb565b600091825260208220845460058054600b909402909201945090916001600160601b0390911690811061192f5761192f6151fb565b90600052602060002090600c0201905080600501548260030154106119ce5782546001600160601b031660001901611970576001600160ff1b0393506119fb565b6003820154611980906002615358565b61198b9060016153d1565b81546005805490916001600160601b03169081106119ab576119ab6151fb565b90600052602060002090600c0201600401546119c79190615358565b93506119fb565b60038201546119de906002615358565b6119e99060016153d1565b81600401546119f89190615358565b93505b505050919050565b6000546001600160a01b03163314611a2e5760405163c383977560e01b815260040160405180910390fd5b6000836001600160a01b03168383604051611a499190615421565b60006040518083038185875af1925050503d8060008114611a86576040519150601f19603f3d011682016040523d82523d6000602084013e611a8b565b606091505b5050905080610b0b576040516322092f2f60e11b815260040160405180910390fd5b6117ee338383600080613f9e565b6000546001600160a01b03163314611ae65760405163c383977560e01b815260040160405180910390fd5b6001600160a01b038216600081815260086020526040808220805460ff191685151590811790915590519092917f541615e167511d757a7067a700eb54431b256bb458dfdce0ac58bf2ed0aefd4491a35050565b6000546001600160a01b03163314611b655760405163c383977560e01b815260040160405180910390fd5b6001600160a01b038316600081815260086020908152604091829020805469ffffffffffffffffff0019166101006001600160401b03881690810260ff60481b191691909117600160481b60ff8816908102919091179092558351908152918201527fe6996b7f03e9bd02228b99d3d946932e3197f505f60542c4cfbc919441d8a4e6910160405180910390a2505050565b6000546001600160a01b03163314611c225760405163c383977560e01b815260040160405180910390fd5b60006005886001600160601b031681548110611c4057611c406151fb565b90600052602060002090600c0201905060016001600160601b0316886001600160601b031614158015611ca2575080546005805488926001600160601b0316908110611c8e57611c8e6151fb565b90600052602060002090600c020160020154115b15611cc057604051639717078960e01b815260040160405180910390fd5b60005b6001820154811015611d3b57866005836001018381548110611ce757611ce76151fb565b906000526020600020015481548110611d0257611d026151fb565b90600052602060002090600c0201600201541015611d3357604051639717078960e01b815260040160405180910390fd5b600101611cc3565b5060028101869055805460ff60601b1916600160601b8815150217815560038101859055600480820185905560058201849055611d7e90600683019084906147a4565b50876001600160601b03167f709b1f5fda58af9a4f52dacd1ec404840a8148455700cce155a2bd8cf127ef1a888888888888604051611dc29695949392919061543d565b60405180910390a25050505050505050565b611e3a60405180610160016040528060008152602001600081526020016000815260200160008152602001600081526020016000815260200160608152602001600081526020016000815260200160006001600160a01b03168152602001600081525090565b60078381548110611e4d57611e4d6151fb565b90600052602060002090600402016003018281548110611e6f57611e6f6151fb565b90600052602060002090600b02016040518061016001604052908160008201548152602001600182015481526020016002820154815260200160038201548152602001600482015481526020016005820154815260200160068201805480602002602001604051908101604052809291908181526020018280548015611f1e57602002820191906000526020600020905b81546001600160a01b03168152600190910190602001808311611f00575b5050509183525050600782015460208201526008820154604082015260098201546001600160a01b03166060820152600a909101546080909101529392505050565b600060078281548110611f7557611f756151fb565b600091825260209091206004918202019150600182015460ff166004811115611fa057611fa0614b3e565b14611fbe57604051638794ce4b60e01b815260040160405180910390fd5b6001810154610100900460ff1615611fe95760405163c977f8d360e01b815260040160405180910390fd5b6000611ff48361119b565b505060018301805461010061ff001990911617905582546040518281529192508491600160601b9091046001600160a01b0316907f394027a5fa6e098a1191094d1719d6929b9abc535fcc0c8f448d6a4e756222769060200160405180910390a3815460405163188d362b60e11b81526004810185905260248101839052600160601b9091046001600160a01b03169063311a6c5690604401600060405180830381600087803b1580156120a757600080fd5b505af11580156120bb573d6000803e3d6000fd5b50505050505050565b600681815481106120d457600080fd5b6000918252602090912001546001600160a01b0316905081565b600080600060078481548110612106576121066151fb565b6000918252602090912060049091020190506003600182015460ff16600481111561213357612133614b3e565b0361218b576002810154815460058054929550916001600160601b03909116908110612161576121616151fb565b600091825260209091206009600c909202010154600282015461218491906153d1565b9150612194565b60009250600091505b50915091565b6000546001600160a01b031633146121c55760405163c383977560e01b815260040160405180910390fd5b600480546001600160a01b0319166001600160a01b0392909216919091179055565b6000546001600160a01b0316331480159061220d57506001546001600160a01b03163314155b1561222b57604051633244d29960e21b815260040160405180910390fd5b600060078381548110612240576122406151fb565b906000526020600020906004020190506000600182600301805490506122669190615227565b9050600082600301828154811061227f5761227f6151fb565b600091825260208220600b909102019150600184015460ff1660048111156122a9576122a9614b3e565b146122c757604051638285c4ef60e01b815260040160405180910390fd5b60038101546006820154106122ef57604051634df06de360e01b815260040160405180910390fd5b60048054604051633c694c4160e21b81526001600160a01b039091169163f1a531049161231e918891016149af565b600060405180830381600087803b15801561233857600080fd5b505af115801561234c573d6000803e3d6000fd5b5050505060006006826000015481548110612369576123696151fb565b6000918252602082200154600a8401546001600160a01b0390911692506123919060016153d1565b60405163695c01ad60e11b815260048101899052602481018290529091506000906001600160a01b0384169063d2b8035a906044016020604051808303816000875af11580156123e5573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906124099190615470565b90506001600160a01b03811661243257604051632e38b8f760e11b815260040160405180910390fd5b6004805460018601546040516310f0b12f60e11b81526001600160a01b03909216926321e1625e9261246892869290910161548d565b600060405180830381600087803b15801561248257600080fd5b505af1158015612496573d6000803e3d6000fd5b50505060068501546040518a92506001600160a01b038416917f6119cf536152c11e0a9a6c22f3953ce4ecc93ee54fa72ffa326ffabded21509b916124e3918a8252602082015260400190565b60405180910390a36006840180546001810182556000828152602090200180546001600160a01b0319166001600160a01b038416179055600385015490540361258a5760048054604051632e96bc2360e11b81529182018a9052602482018790526001600160a01b031690635d2d784690604401600060405180830381600087803b15801561257157600080fd5b505af1158015612585573d6000803e3d6000fd5b505050505b50600a8301555060048054604051633c694c4160e21b81526001600160a01b039091169163f1a53104916125c191600091016149af565b600060405180830381600087803b1580156125db57600080fd5b505af11580156125ef573d6000803e3d6000fd5b505050505050505050565b6000612605826133d2565b34101561262557604051630e3360f160e21b815260040160405180910390fd5b6110998383600034614158565b6000546001600160a01b0316331461265d5760405163c383977560e01b815260040160405180910390fd5b600380546001600160a01b0319166001600160a01b0392909216919091179055565b612688836118ae565b3410156126a857604051633191f8f160e01b815260040160405180910390fd5b6000600784815481106126bd576126bd6151fb565b6000918252602090912060049091020190506003600182015460ff1660048111156126ea576126ea614b3e565b14612708576040516337cdefcb60e21b815260040160405180910390fd5b6003810180546000919061271e90600190615227565b8154811061272e5761272e6151fb565b90600052602060002090600b020190506006816000015481548110612755576127556151fb565b6000918252602090912001546001600160a01b031633146127895760405163065f245f60e01b815260040160405180910390fd5b8154815460038401805460018101825560009182526020909120600580546001600160601b0390951694600b90930290910191849081106127cc576127cc6151fb565b90600052602060002090600c0201600501548460030154106128d5576005836001600160601b031681548110612804576128046151fb565b60009182526020909120600c9091020154600580546001600160601b0390921694509084908110612837576128376151fb565b60009182526020808320858452600a600c90930201919091019052604090205460ff1661286357600191505b84546001600160601b038481169116146128d557845460038601546001600160601b039091169061289690600190615227565b6040516001600160601b03861681528a907f736e3f52761298c8c0823e1ebf482ed3c5ecb304f743d2d91a7c006e8e8d7a1f9060200160405180910390a45b84546001600160601b0319166001600160601b038416908117865560018601805460ff1916905542600287015560058054600092908110612918576129186151fb565b90600052602060002090600c020190508060040154346129389190615385565b8260030181905550612710816003015482600201546129579190615358565b6129619190615385565b60018084019190915534600284015583835560045460038801546001600160a01b039091169163d09f392d918c9161299891615227565b6040516001600160e01b031960e085901b16815260048101929092526024820152604401600060405180830381600087803b1580156129d657600080fd5b505af11580156129ea573d6000803e3d6000fd5b505086548454149150612ad090505784546003870154612a0c90600190615227565b83546040519081528b907fcbe7939a71f0b369c7471d760a0a99b60b7bb010ee0406cba8a46679d1ea77569060200160405180910390a46006826000015481548110612a5a57612a5a6151fb565b60009182526020909120015460038301546040516302dbb79560e61b81526001600160a01b039092169163b6ede54091612a9d918d918d918d91906004016154a6565b600060405180830381600087803b158015612ab757600080fd5b505af1158015612acb573d6000803e3d6000fd5b505050505b8554604051600160601b9091046001600160a01b0316908a907f9c9b64db9e130f48381bf697abf638e73117dbfbfd7a4484f2da3ba188f4187d90600090a3887f4e6f5cf43b95303e86aee81683df63992061723a829ee012db21dad388756b916000604051612b409190615257565b60405180910390a2505050505050505050565b60008060078381548110612b6957612b696151fb565b906000526020600020906004020190508060030160018260030180549050612b919190615227565b81548110612ba157612ba16151fb565b90600052602060002090600b020160030154915050919050565b6000546001600160a01b03163314612be65760405163c383977560e01b815260040160405180910390fd5b6006805460018101825560009182527ff652222313e28459528d920b65115c16c04f3efc82aaedc97be59f3f377c0d3f810180546001600160a01b0319166001600160a01b0385169081179091556040519192909183917f44063d258760b98116d53815adbc906a56b3563e540148cc0fc2457f83b5eeb291a35050565b6000546001600160a01b03163314612c8f5760405163c383977560e01b815260040160405180910390fd5b856005896001600160601b031681548110612cac57612cac6151fb565b90600052602060002090600c0201600201541115612cdd57604051639717078960e01b815260040160405180910390fd5b8051600003612cff5760405163402585f560e01b815260040160405180910390fd5b6001600160601b038816612d2657604051631ef4f64960e01b815260040160405180910390fd5b60058054600181018255600091825290600c82027f036b6384b5eca791c62761152d0c79bb0604c104a5fb6f4eb0703f3154bb3db001905b8351811015612e1557838181518110612d7957612d796151fb565b602002602001015160001480612dac57506006548451859083908110612da157612da16151fb565b602002602001015110155b15612dca57604051633d58a98960e11b815260040160405180910390fd5b600182600a016000868481518110612de457612de46151fb565b6020908102919091018101518252810191909152604001600020805460ff1916911515919091179055600101612d5e565b5060016000908152600a8201602052604090205460ff16612e49576040516306351b3d60e31b815260040160405180910390fd5b80546001600160601b0319166001600160601b038b161781556040805160008152602081019182905251612e819160018401916147e2565b50805460ff60601b1916600160601b8a1515021781556002810188905560038101879055600480820187905560058201869055612ec490600683019086906147a4565b5060058a6001600160601b031681548110612ee157612ee16151fb565b600091825260208083206001600c909302018201805492830181558352909120018290556040516001600160601b038b169083907f3475f0ed7216dd7d453db663a1c3024e4f36cc925521d54edb9d13e022cbee3d90612f4e908d908d908d908d908d908d908d906154ef565b60405180910390a350505050505050505050565b6000612fa7826103c386868080601f0160208091040260200160405190810160405280939291908181526020018383808284376000920191909152506133d292505050565b949350505050565b7ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e805460019190600160401b900460ff1680612ff8575080546001600160401b03808416911610155b156130155760405162dc149f60e41b815260040160405180910390fd5b805468ffffffffffffffffff19166001600160401b03831617600160401b178155600080546001600160a01b03808e166001600160a01b0319928316178355600180548e8316908416178155600280548e8416908516178155600380548e8516908616179055600480548985169086161790556006805481875291820190557ff652222313e28459528d920b65115c16c04f3efc82aaedc97be59f3f377c0d40018054928c1692909316821790925560405190927f44063d258760b98116d53815adbc906a56b3563e540148cc0fc2457f83b5eeb291a360058054600082815260028201909255600c6001909101027f036b6384b5eca791c62761152d0c79bb0604c104a5fb6f4eb0703f3154bb3db0810180546001600160601b031916815560408051938452602084019081905292519092613174927f036b6384b5eca791c62761152d0c79bb0604c104a5fb6f4eb0703f3154bb3db101916147e2565b50805460ff60601b1916600160601b8815150217815585516002820155602086015160038201556040860151600480830191909155606087015160058301556131c390600683019087906147a4565b50805486516020808901516040808b015160608c0151825160008082529581019093526001600160601b03909616956001957f3475f0ed7216dd7d453db663a1c3024e4f36cc925521d54edb9d13e022cbee3d958f959194919392918e915060405161323597969594939291906154ef565b60405180910390a361324a60018060016134d5565b50805460ff60401b191681556040516001600160401b03831681527fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d29060200160405180910390a15050505050505050505050565b6000546001600160a01b031633146132ca5760405163c383977560e01b815260040160405180910390fd5b600080546001600160a01b0319166001600160a01b0392909216919091179055565b6001600160a01b03821660009081526008602052604081205460ff166133255760405163e51cf7bf60e01b815260040160405180910390fd5b613330858585612f62565b82101561335057604051630e3360f160e21b815260040160405180910390fd5b6133656001600160a01b03841633308561443f565b613382576040516312171d8360e31b815260040160405180910390fd5b6133c68686868080601f0160208091040260200160405190810160405280939291908181526020018383808284376000920191909152508892508791506141589050565b90505b95945050505050565b60008060006133e08461451b565b5091509150806005836001600160601b031681548110613402576134026151fb565b90600052602060002090600c020160040154612fa79190615358565b6004546001600160a01b0316331461344957604051639d6cab9960e01b815260040160405180910390fd5b613457848484846001613f9e565b5050505050565b600060078281548110613473576134736151fb565b600091825260209091206003600490920201015492915050565b60006005836001600160601b0316815481106134ab576134ab6151fb565b60009182526020808320948352600c91909102909301600a0190925250604090205460ff16919050565b806005846001600160601b0316815481106134f2576134f26151fb565b60009182526020808320868452600c92909202909101600a0190526040808220805460ff19169315159390931790925590518215159184916001600160601b038716917fb47629acdf64971062d40984f77d3dee212d735b11e3e8c7a4222d9f0572cc7991a4505050565b6000806007836000015181548110613577576135776151fb565b906000526020600020906004020190506000816003018460200151815481106135a2576135a26151fb565b90600052602060002090600b02019050600060068260000154815481106135cb576135cb6151fb565b60009182526020808320919091015487519188015160e089015160808a015160a08b01516040516333ac937b60e11b8152600481019690965260248601939093526044850191909152606484015260848301526001600160a01b03169250829063675926f69060a401602060405180830381865afa158015613651573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061367591906153e4565b905061271081111561368657506127105b60006127106136958382615227565b85600101546136a49190615358565b6136ae9190615385565b9050808760c0018181516136c291906153d1565b90525060e08701516006850180546000929081106136e2576136e26151fb565b6000918252602090912001546004805460405163965af6c760e01b81526001600160a01b03938416945092169163965af6c79161372391859187910161548d565b600060405180830381600087803b15801561373d57600080fd5b505af1158015613751573d6000803e3d6000fd5b505060048054604051633c85b79360e21b81526001600160a01b03909116935063f216de4c925061378691859187910161548d565b600060405180830381600087803b1580156137a057600080fd5b505af11580156137b4573d6000803e3d6000fd5b50505050602088015188516001600160a01b0383167f8975b837fe0d18616c65abb8b843726a32b552ee4feca009944fa658bbb282e7866137f48761556e565b60098b01546040516138169392916000916001600160a01b039091169061558a565b60405180910390a48751602089015160e08a015160405163ba66fde760e01b81526004810193909352602483019190915260448201526001600160a01b0385169063ba66fde790606401602060405180830381865afa15801561387d573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906138a1919061523a565b613907576004805460405163b5d69e9960e01b81526001600160a01b039091169163b5d69e99916138d4918591016149af565b600060405180830381600087803b1580156138ee57600080fd5b505af1158015613902573d6000803e3d6000fd5b505050505b600188606001516139189190615227565b8860e0015114801561392c57506040880151155b15613a1d5760098501546001600160a01b0316613975576000805460028701546040516001600160a01b039092169281156108fc029290818181858888f193505050505061399c565b6000546002860154600987015461399a926001600160a01b03918216929116906145a2565b505b60005460c08901516002546139bf926001600160a01b03918216929116906145a2565b506020880151885160c08a0151600288015460098901546040517f6cecfd3ec56289ccb16e30eb194f9a87dfdc12630b9abbc31fc69af5a0b0eaf493613a1493909290916001600160a01b03909116906155ae565b60405180910390a35b50505060c090940151949350505050565b60006007826000015181548110613a4757613a476151fb565b90600052602060002090600402019050600081600301836020015181548110613a7257613a726151fb565b90600052602060002090600b0201905060006006826000015481548110613a9b57613a9b6151fb565b6000918252602080832090910154865191870151606088015160e08901516001600160a01b039093169550859363675926f693909291613ada916155cd565b60808a015160a08b01516040516001600160e01b031960e088901b1681526004810195909552602485019390935260448401919091526064830152608482015260a401602060405180830381865afa158015613b3a573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190613b5e91906153e4565b9050612710811115613b6f57506127105b60008360060186606001518760e00151613b8991906155cd565b81548110613b9957613b996151fb565b600091825260208220015460018601546001600160a01b03909116925061271090613bc5908590615358565b613bcf9190615385565b6004805460405163965af6c760e01b81529293506001600160a01b03169163965af6c791613c0191869186910161548d565b600060405180830381600087803b158015613c1b57600080fd5b505af1158015613c2f573d6000803e3d6000fd5b505060048054604051636624192f60e01b81526001600160a01b039091169350636624192f9250613c62918691016149af565b602060405180830381865afa158015613c7f573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190613ca3919061523a565b613cc057600254613cbe906001600160a01b031683836145a2565b505b60006127108489604001518a60c00151613cda9190615385565b613ce49190615358565b613cee9190615385565b905080866008016000828254613d0491906153d1565b925050819055506000612710858a604001518960020154613d259190615385565b613d2f9190615358565b613d399190615385565b905080876007016000828254613d4f91906153d1565b9091555050600254613d6b906001600160a01b031685846145a2565b5060098701546001600160a01b0316613da9576040516001600160a01b0385169082156108fc029083906000818181858888f1935050505050613dc4565b6009870154613dc2906001600160a01b031685836145a2565b505b6020890151895160098901546040516001600160a01b03888116927f8975b837fe0d18616c65abb8b843726a32b552ee4feca009944fa658bbb282e792613e14928c928a928a929091169061558a565b60405180910390a4600189606001516002613e2f9190615358565b613e399190615227565b8960e00151036125ef57600087600801548a60c00151613e599190615227565b9050600088600701548960020154613e719190615227565b905081151580613e8057508015155b15611556578115613eaa57600054600254613ea8916001600160a01b039182169116846145a2565b505b8015613f115760098901546001600160a01b0316613ef057600080546040516001600160a01b039091169183156108fc02918491818181858888f1935050505050613f11565b60005460098a0154613f0f916001600160a01b039182169116836145a2565b505b60208b01518b5160098b01546040517f6cecfd3ec56289ccb16e30eb194f9a87dfdc12630b9abbc31fc69af5a0b0eaf491613f5b91879187916001600160a01b03909116906155ae565b60405180910390a35050505050505050505050565b6000546001600160a01b03163314613f9b5760405163c383977560e01b815260040160405180910390fd5b50565b60006001600160601b0385161580613fc057506005546001600160601b038616115b15613fd857613fd082600461466f565b5060006133c9565b831580159061401357506005856001600160601b031681548110613ffe57613ffe6151fb565b90600052602060002090600c02016002015484105b1561402357613fd082600561466f565b60048054604051630a5861b960e41b81526001600160a01b03898116938201939093526001600160601b03881660248201526044810187905285151560648201526000928392839291169063a5861b90906084016060604051808303816000875af1158015614096573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906140ba91906155e1565b9194509250905060008160078111156140d5576140d5614b3e565b146140f0576140e4858261466f565b600093505050506133c9565b821561411d5760025461410e906001600160a01b03168a308661443f565b61411d576140e485600161466f565b81156141495760025461413a906001600160a01b03168a846145a2565b614149576140e485600261466f565b50600198975050505050505050565b60008060006141668661451b565b92505091506005826001600160601b031681548110614187576141876151fb565b60009182526020808320848452600a600c90930201919091019052604090205460ff166141c75760405163b34eb75d60e01b815260040160405180910390fd5b600780546001810182556000918252600160601b33026001600160601b03851617600482027fa66cc928b5edb82af9bd49922954155ab7b0942694bea4ce44661d9a8736c6888101918255427fa66cc928b5edb82af9bd49922954155ab7b0942694bea4ce44661d9a8736c68a909101556006805492965090929184908110614252576142526151fb565b6000918252602082200154600580546001600160a01b039092169350906001600160601b038716908110614288576142886151fb565b60009182526020808320600387018054600181018255908552918420600c909302019350600b0201906001600160a01b038a16156142d3576142ce8a8460040154611048565b6142d9565b82600401545b90506142e5818a615385565b60038084019190915586835583015460028401546127109161430691615358565b6143109190615385565b6001830155600282018990556009820180546001600160a01b0319166001600160a01b038c8116919091179091556004805460405163d09f392d60e01b81529182018b9052600060248301529091169063d09f392d90604401600060405180830381600087803b15801561438357600080fd5b505af1158015614397573d6000803e3d6000fd5b50505050836001600160a01b031663b6ede540898e8e86600301546040518563ffffffff1660e01b81526004016143d194939291906154a6565b600060405180830381600087803b1580156143eb57600080fd5b505af11580156143ff573d6000803e3d6000fd5b50506040513392508a91507f141dfc18aa6a56fc816f44f0e9e2f1ebc92b15ab167770e17db5b084c10ed99590600090a350505050505050949350505050565b6040516001600160a01b038481166024830152838116604483015260648201839052600091829182919088169060840160408051601f198184030181529181526020820180516001600160e01b03166323b872dd60e01b179052516144a49190615421565b6000604051808303816000865af19150503d80600081146144e1576040519150601f19603f3d011682016040523d82523d6000602084013e6144e6565b606091505b5091509150818015614510575080511580614510575080806020019051810190614510919061523a565b979650505050505050565b60008060006040845110614590575050506020810151604082015160608301516001600160601b038316158061455c57506005546001600160601b03841610155b1561456657600192505b8160000361457357600391505b80158061458257506006548110155b1561458b575060015b61459b565b506001915060039050815b9193909250565b6000806000856001600160a01b031685856040516024016145c492919061548d565b60408051601f198184030181529181526020820180516001600160e01b031663a9059cbb60e01b179052516145f99190615421565b6000604051808303816000865af19150503d8060008114614636576040519150601f19603f3d011682016040523d82523d6000602084013e61463b565b606091505b5091509150818015614665575080511580614665575080806020019051810190614665919061523a565b9695505050505050565b600182600181111561468357614683614b3e565b0361468c575050565b60018160078111156146a0576146a0614b3e565b036146be57604051630f323ed960e11b815260040160405180910390fd5b60028160078111156146d2576146d2614b3e565b036146f05760405163e45e13a360e01b815260040160405180910390fd5b600381600781111561470457614704614b3e565b0361472257604051631d91d0ed60e31b815260040160405180910390fd5b600481600781111561473657614736614b3e565b03614754576040516321f1774b60e11b815260040160405180910390fd5b600581600781111561476857614768614b3e565b036117f057604051630caac6b360e31b815260040160405180910390fd5b60405180608001604052806004906020820280368337509192915050565b82600481019282156147d2579160200282015b828111156147d25782518255916020019190600101906147b7565b506147de92915061481c565b5090565b8280548282559060005260206000209081019282156147d257916020028201828111156147d25782518255916020019190600101906147b7565b5b808211156147de576000815560010161481d565b6001600160a01b0381168114613f9b57600080fd5b60006020828403121561485857600080fd5b813561486381614831565b9392505050565b80356001600160601b038116811461488157600080fd5b919050565b634e487b7160e01b600052604160045260246000fd5b604051601f8201601f191681016001600160401b03811182821017156148c4576148c4614886565b604052919050565b600082601f8301126148dd57600080fd5b813560206001600160401b038211156148f8576148f8614886565b8160051b61490782820161489c565b928352848101820192828101908785111561492157600080fd5b83870192505b8483101561451057823582529183019190830190614927565b8015158114613f9b57600080fd5b60008060006060848603121561496357600080fd5b61496c8461486a565b925060208401356001600160401b0381111561498757600080fd5b614993868287016148cc565b92505060408401356149a481614940565b809150509250925092565b6001600160a01b0391909116815260200190565b6000602082840312156149d557600080fd5b5035919050565b600080604083850312156149ef57600080fd5b82356149fa81614831565b946020939093013593505050565b600080600060608486031215614a1d57600080fd5b505081359360208301359350604090920135919050565b600060208284031215614a4657600080fd5b6110998261486a565b8060005b6004811015610b0b578151845260209384019390910190600101614a53565b6080810161109c8284614a4f565b600082601f830112614a9157600080fd5b81356001600160401b03811115614aaa57614aaa614886565b614abd601f8201601f191660200161489c565b818152846020838601011115614ad257600080fd5b816020850160208301376000918101602001919091529392505050565b60008060408385031215614b0257600080fd5b8235614b0d81614831565b915060208301356001600160401b03811115614b2857600080fd5b614b3485828601614a80565b9150509250929050565b634e487b7160e01b600052602160045260246000fd5b60058110614b7257634e487b7160e01b600052602160045260246000fd5b9052565b6001600160601b03861681526001600160a01b038516602082015260a08101614ba26040830186614b54565b9215156060820152608001529392505050565b600080600060608486031215614bca57600080fd5b8335614bd581614831565b92506020840135915060408401356001600160401b03811115614bf757600080fd5b614c0386828701614a80565b9150509250925092565b60008060408385031215614c2057600080fd5b6149fa8361486a565b60008060408385031215614c3c57600080fd5b8235614c4781614831565b91506020830135614c5781614940565b809150509250929050565b600080600060608486031215614c7757600080fd5b8335614c8281614831565b925060208401356001600160401b0381168114614c9e57600080fd5b9150604084013560ff811681146149a457600080fd5b600082601f830112614cc557600080fd5b604051608081018181106001600160401b0382111715614ce757614ce7614886565b604052806080840185811115614cfc57600080fd5b845b81811015614d16578035835260209283019201614cfe565b509195945050505050565b6000806000806000806000610140888a031215614d3d57600080fd5b614d468861486a565b96506020880135614d5681614940565b955060408801359450606088013593506080880135925060a08801359150614d818960c08a01614cb4565b905092959891949750929550565b60008060408385031215614da257600080fd5b50508035926020909101359150565b60008151808452602080850194506020840160005b83811015614deb5781516001600160a01b031687529582019590820190600101614dc6565b509495945050505050565b6020815281516020820152602082015160408201526040820151606082015260608201516080820152608082015160a082015260a082015160c0820152600060c08301516101608060e0850152614e51610180850183614db1565b60e08601516101008681019190915286015161012080870191909152860151909250610140614e8a818701836001600160a01b03169052565b959095015193019290925250919050565b60008060408385031215614eae57600080fd5b823591506020830135614c5781614831565b60008060408385031215614ed357600080fd5b8235915060208301356001600160401b03811115614b2857600080fd5b600080600060608486031215614f0557600080fd5b833592506020840135915060408401356001600160401b03811115614bf757600080fd5b600080600080600080600080610160898b031215614f4657600080fd5b614f4f8961486a565b97506020890135614f5f81614940565b965060408901359550606089013594506080890135935060a08901359250614f8a8a60c08b01614cb4565b91506101408901356001600160401b03811115614fa657600080fd5b614fb28b828c016148cc565b9150509295985092959890939650565b60008083601f840112614fd457600080fd5b5081356001600160401b03811115614feb57600080fd5b60208301915083602082850101111561500357600080fd5b9250929050565b60008060006040848603121561501f57600080fd5b83356001600160401b0381111561503557600080fd5b61504186828701614fc2565b90945092505060208401356149a481614831565b60008060008060008060008060006101e08a8c03121561507457600080fd5b893561507f81614831565b985060208a013561508f81614831565b975060408a013561509f81614831565b965060608a01356150af81614831565b955060808a01356150bf81614831565b945060a08a01356150cf81614940565b93506150de8b60c08c01614cb4565b92506150ee8b6101408c01614cb4565b91506101c08a01356150ff81614831565b809150509295985092959850929598565b60008060008060006080868803121561512857600080fd5b8535945060208601356001600160401b0381111561514557600080fd5b61515188828901614fc2565b909550935050604086013561516581614831565b949793965091946060013592915050565b60006020828403121561518857600080fd5b81356001600160401b0381111561519e57600080fd5b612fa784828501614a80565b600080600080608085870312156151c057600080fd5b84356151cb81614831565b93506151d96020860161486a565b92506040850135915060608501356151f081614940565b939692955090935050565b634e487b7160e01b600052603260045260246000fd5b634e487b7160e01b600052601160045260246000fd5b8181038181111561109c5761109c615211565b60006020828403121561524c57600080fd5b815161486381614940565b6020810161109c8284614b54565b600181815b808511156152a057816000190482111561528657615286615211565b8085161561529357918102915b93841c939080029061526a565b509250929050565b6000826152b75750600161109c565b816152c45750600061109c565b81600181146152da57600281146152e457615300565b600191505061109c565b60ff8411156152f5576152f5615211565b50506001821b61109c565b5060208310610133831016604e8410600b8410161715615323575081810a61109c565b61532d8383615265565b806000190482111561534157615341615211565b029392505050565b600061109960ff8416836152a8565b808202811582820484141761109c5761109c615211565b634e487b7160e01b600052601260045260246000fd5b6000826153945761539461536f565b500490565b6000806000606084860312156153ae57600080fd5b8351925060208401516153c081614940565b60408501519092506149a481614940565b8082018082111561109c5761109c615211565b6000602082840312156153f657600080fd5b5051919050565b60005b83811015615418578181015183820152602001615400565b50506000910152565b600082516154338184602087016153fd565b9190910192915050565b600061012082019050871515825286602083015285604083015284606083015283608083015261451060a0830184614a4f565b60006020828403121561548257600080fd5b815161486381614831565b6001600160a01b03929092168252602082015260400190565b84815283602082015260806040820152600083518060808401526154d18160a08501602088016153fd565b606083019390935250601f91909101601f19160160a0019392505050565b60006101408083018a1515845260208a602086015289604086015288606086015287608086015261552360a0860188614a4f565b610120850192909252845190819052610160840191602086019160005b8181101561555c57835185529382019392820192600101615540565b50929c9b505050505050505050505050565b6000600160ff1b820161558357615583615211565b5060000390565b938452602084019290925260408301526001600160a01b0316606082015260800190565b92835260208301919091526001600160a01b0316604082015260600190565b6000826155dc576155dc61536f565b500690565b6000806000606084860312156155f657600080fd5b83519250602084015191506040840151600881106149a457600080fdfe360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbca264697066735822122088332e4bd463fd5a2a31ab980f2b2ead694ff8b8a10a33684171a45128537f0a64736f6c63430008180033",
+  "solcInputHash": "d547d738900bce1310e91a5d1adfc179",
+  "metadata": "{\"compiler\":{\"version\":\"0.8.30+commit.73712a01\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"inputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"constructor\"},{\"inputs\":[],\"name\":\"AllJurorsDrawn\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"AlreadyInitialized\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"AppealFeesNotEnough\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"AppealPeriodNotPassed\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"ArbitrationFeesNotEnough\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"CannotDisableClassicDK\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"CommitPeriodNotPassed\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"DisputeKitNotSupportedByCourt\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"DisputeKitOnly\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"DisputeNotAppealable\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"DisputePeriodIsFinal\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"DisputeStillDrawing\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"EvidenceNotPassedAndNotAppeal\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"FailedDelegateCall\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"InstructorOnly\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"InvalidDisputKitParent\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"InvalidForkingCourtAsParent\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"implementation\",\"type\":\"address\"}],\"name\":\"InvalidImplementation\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"MinStakeLowerThanParentCourt\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"MustSupportDisputeKitClassic\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"NoJurorDrawn\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"NotEvidencePeriod\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"NotExecutionPeriod\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"NotInitializing\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"OwnerOnly\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"OwnerOrInstructorOnly\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"RulingAlreadyExecuted\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"SortitionModuleOnly\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"StakingInTooManyCourts\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"StakingLessThanCourtMinStake\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"StakingNotPossibleInThisCourt\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"StakingTransferFailed\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"StakingZeroWhenNoStake\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"TokenNotAccepted\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"TransferFailed\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"UUPSUnauthorizedCallContext\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"slot\",\"type\":\"bytes32\"}],\"name\":\"UUPSUnsupportedProxiableUUID\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"UnstakingTransferFailed\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"UnsuccessfulCall\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"UnsupportedDisputeKit\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"VotePeriodNotPassed\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"WrongDisputeKitIndex\",\"type\":\"error\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"contract IERC20\",\"name\":\"_token\",\"type\":\"address\"},{\"indexed\":true,\"internalType\":\"bool\",\"name\":\"_accepted\",\"type\":\"bool\"}],\"name\":\"AcceptedFeeToken\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"contract IArbitrableV2\",\"name\":\"_arbitrable\",\"type\":\"address\"}],\"name\":\"AppealDecision\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"contract IArbitrableV2\",\"name\":\"_arbitrable\",\"type\":\"address\"}],\"name\":\"AppealPossible\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint96\",\"name\":\"_courtID\",\"type\":\"uint96\"},{\"indexed\":true,\"internalType\":\"uint96\",\"name\":\"_parent\",\"type\":\"uint96\"},{\"indexed\":false,\"internalType\":\"bool\",\"name\":\"_hiddenVotes\",\"type\":\"bool\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_minStake\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_alpha\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_feeForJuror\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_jurorsForCourtJump\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256[4]\",\"name\":\"_timesPerPeriod\",\"type\":\"uint256[4]\"},{\"indexed\":false,\"internalType\":\"uint256[]\",\"name\":\"_supportedDisputeKits\",\"type\":\"uint256[]\"}],\"name\":\"CourtCreated\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_roundID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"uint96\",\"name\":\"_fromCourtID\",\"type\":\"uint96\"},{\"indexed\":false,\"internalType\":\"uint96\",\"name\":\"_toCourtID\",\"type\":\"uint96\"}],\"name\":\"CourtJump\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint96\",\"name\":\"_courtID\",\"type\":\"uint96\"},{\"indexed\":false,\"internalType\":\"bool\",\"name\":\"_hiddenVotes\",\"type\":\"bool\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_minStake\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_alpha\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_feeForJuror\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_jurorsForCourtJump\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256[4]\",\"name\":\"_timesPerPeriod\",\"type\":\"uint256[4]\"}],\"name\":\"CourtModified\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"contract IArbitrableV2\",\"name\":\"_arbitrable\",\"type\":\"address\"}],\"name\":\"DisputeCreation\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_disputeKitID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"contract IDisputeKit\",\"name\":\"_disputeKitAddress\",\"type\":\"address\"}],\"name\":\"DisputeKitCreated\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint96\",\"name\":\"_courtID\",\"type\":\"uint96\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_disputeKitID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"bool\",\"name\":\"_enable\",\"type\":\"bool\"}],\"name\":\"DisputeKitEnabled\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_roundID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_fromDisputeKitID\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_toDisputeKitID\",\"type\":\"uint256\"}],\"name\":\"DisputeKitJump\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"_address\",\"type\":\"address\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_roundID\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_voteID\",\"type\":\"uint256\"}],\"name\":\"Draw\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":false,\"internalType\":\"uint64\",\"name\":\"version\",\"type\":\"uint64\"}],\"name\":\"Initialized\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"_account\",\"type\":\"address\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_roundID\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_degreeOfCoherencyPnk\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_degreeOfCoherencyFee\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"int256\",\"name\":\"_amountPnk\",\"type\":\"int256\"},{\"indexed\":false,\"internalType\":\"int256\",\"name\":\"_amountFee\",\"type\":\"int256\"},{\"indexed\":false,\"internalType\":\"contract IERC20\",\"name\":\"_feeToken\",\"type\":\"address\"}],\"name\":\"JurorRewardPenalty\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_roundID\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_amountPnk\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_amountFee\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"contract IERC20\",\"name\":\"_feeToken\",\"type\":\"address\"}],\"name\":\"LeftoverRewardSent\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"contract IERC20\",\"name\":\"_feeToken\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"uint64\",\"name\":\"_rateInEth\",\"type\":\"uint64\"},{\"indexed\":false,\"internalType\":\"uint8\",\"name\":\"_rateDecimals\",\"type\":\"uint8\"}],\"name\":\"NewCurrencyRate\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"enum KlerosCoreUniversity.Period\",\"name\":\"_period\",\"type\":\"uint8\"}],\"name\":\"NewPeriod\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"contract IArbitrableV2\",\"name\":\"_arbitrable\",\"type\":\"address\"},{\"indexed\":true,\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_ruling\",\"type\":\"uint256\"}],\"name\":\"Ruling\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"newImplementation\",\"type\":\"address\"}],\"name\":\"Upgraded\",\"type\":\"event\"},{\"inputs\":[{\"internalType\":\"contract IDisputeKit\",\"name\":\"_disputeKitAddress\",\"type\":\"address\"}],\"name\":\"addNewDisputeKit\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_numberOfChoices\",\"type\":\"uint256\"},{\"internalType\":\"bytes\",\"name\":\"_extraData\",\"type\":\"bytes\"}],\"name\":\"appeal\",\"outputs\":[],\"stateMutability\":\"payable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"}],\"name\":\"appealCost\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"cost\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"}],\"name\":\"appealPeriod\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"start\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"end\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes\",\"name\":\"_extraData\",\"type\":\"bytes\"},{\"internalType\":\"contract IERC20\",\"name\":\"_feeToken\",\"type\":\"address\"}],\"name\":\"arbitrationCost\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"cost\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes\",\"name\":\"_extraData\",\"type\":\"bytes\"}],\"name\":\"arbitrationCost\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"cost\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"contract IERC20\",\"name\":\"_feeToken\",\"type\":\"address\"},{\"internalType\":\"bool\",\"name\":\"_accepted\",\"type\":\"bool\"}],\"name\":\"changeAcceptedFeeTokens\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint96\",\"name\":\"_courtID\",\"type\":\"uint96\"},{\"internalType\":\"bool\",\"name\":\"_hiddenVotes\",\"type\":\"bool\"},{\"internalType\":\"uint256\",\"name\":\"_minStake\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_alpha\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_feeForJuror\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_jurorsForCourtJump\",\"type\":\"uint256\"},{\"internalType\":\"uint256[4]\",\"name\":\"_timesPerPeriod\",\"type\":\"uint256[4]\"}],\"name\":\"changeCourtParameters\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"contract IERC20\",\"name\":\"_feeToken\",\"type\":\"address\"},{\"internalType\":\"uint64\",\"name\":\"_rateInEth\",\"type\":\"uint64\"},{\"internalType\":\"uint8\",\"name\":\"_rateDecimals\",\"type\":\"uint8\"}],\"name\":\"changeCurrencyRates\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_instructor\",\"type\":\"address\"}],\"name\":\"changeInstructor\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_jurorProsecutionModule\",\"type\":\"address\"}],\"name\":\"changeJurorProsecutionModule\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address payable\",\"name\":\"_owner\",\"type\":\"address\"}],\"name\":\"changeOwner\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"contract IERC20\",\"name\":\"_pinakion\",\"type\":\"address\"}],\"name\":\"changePinakion\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"contract ISortitionModuleUniversity\",\"name\":\"_sortitionModule\",\"type\":\"address\"}],\"name\":\"changeSortitionModule\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"contract IERC20\",\"name\":\"_toToken\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"_amountInEth\",\"type\":\"uint256\"}],\"name\":\"convertEthToTokenAmount\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"name\":\"courts\",\"outputs\":[{\"internalType\":\"uint96\",\"name\":\"parent\",\"type\":\"uint96\"},{\"internalType\":\"bool\",\"name\":\"hiddenVotes\",\"type\":\"bool\"},{\"internalType\":\"uint256\",\"name\":\"minStake\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"alpha\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"feeForJuror\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"jurorsForCourtJump\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint96\",\"name\":\"_parent\",\"type\":\"uint96\"},{\"internalType\":\"bool\",\"name\":\"_hiddenVotes\",\"type\":\"bool\"},{\"internalType\":\"uint256\",\"name\":\"_minStake\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_alpha\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_feeForJuror\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_jurorsForCourtJump\",\"type\":\"uint256\"},{\"internalType\":\"uint256[4]\",\"name\":\"_timesPerPeriod\",\"type\":\"uint256[4]\"},{\"internalType\":\"uint256[]\",\"name\":\"_supportedDisputeKits\",\"type\":\"uint256[]\"}],\"name\":\"createCourt\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_numberOfChoices\",\"type\":\"uint256\"},{\"internalType\":\"bytes\",\"name\":\"_extraData\",\"type\":\"bytes\"}],\"name\":\"createDispute\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"disputeID\",\"type\":\"uint256\"}],\"stateMutability\":\"payable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_numberOfChoices\",\"type\":\"uint256\"},{\"internalType\":\"bytes\",\"name\":\"_extraData\",\"type\":\"bytes\"},{\"internalType\":\"contract IERC20\",\"name\":\"_feeToken\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"_feeAmount\",\"type\":\"uint256\"}],\"name\":\"createDispute\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"disputeID\",\"type\":\"uint256\"}],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"contract IERC20\",\"name\":\"\",\"type\":\"address\"}],\"name\":\"currencyRates\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"feePaymentAccepted\",\"type\":\"bool\"},{\"internalType\":\"uint64\",\"name\":\"rateInEth\",\"type\":\"uint64\"},{\"internalType\":\"uint8\",\"name\":\"rateDecimals\",\"type\":\"uint8\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"}],\"name\":\"currentRuling\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"ruling\",\"type\":\"uint256\"},{\"internalType\":\"bool\",\"name\":\"tied\",\"type\":\"bool\"},{\"internalType\":\"bool\",\"name\":\"overridden\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"name\":\"disputeKits\",\"outputs\":[{\"internalType\":\"contract IDisputeKit\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"name\":\"disputes\",\"outputs\":[{\"internalType\":\"uint96\",\"name\":\"courtID\",\"type\":\"uint96\"},{\"internalType\":\"contract IArbitrableV2\",\"name\":\"arbitrated\",\"type\":\"address\"},{\"internalType\":\"enum KlerosCoreUniversity.Period\",\"name\":\"period\",\"type\":\"uint8\"},{\"internalType\":\"bool\",\"name\":\"ruled\",\"type\":\"bool\"},{\"internalType\":\"uint256\",\"name\":\"lastPeriodChange\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"internalType\":\"address\",\"name\":\"_juror\",\"type\":\"address\"}],\"name\":\"draw\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint96\",\"name\":\"_courtID\",\"type\":\"uint96\"},{\"internalType\":\"uint256[]\",\"name\":\"_disputeKitIDs\",\"type\":\"uint256[]\"},{\"internalType\":\"bool\",\"name\":\"_enable\",\"type\":\"bool\"}],\"name\":\"enableDisputeKits\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_round\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_iterations\",\"type\":\"uint256\"}],\"name\":\"execute\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_destination\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"_amount\",\"type\":\"uint256\"},{\"internalType\":\"bytes\",\"name\":\"_data\",\"type\":\"bytes\"}],\"name\":\"executeOwnerProposal\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"}],\"name\":\"executeRuling\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"getDisputeKitsLength\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"}],\"name\":\"getNumberOfRounds\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"}],\"name\":\"getNumberOfVotes\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_round\",\"type\":\"uint256\"}],\"name\":\"getPnkAtStakePerJuror\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_round\",\"type\":\"uint256\"}],\"name\":\"getRoundInfo\",\"outputs\":[{\"components\":[{\"internalType\":\"uint256\",\"name\":\"disputeKitID\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"pnkAtStakePerJuror\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"totalFeesForJurors\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"nbVotes\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"repartitions\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"pnkPenalties\",\"type\":\"uint256\"},{\"internalType\":\"address[]\",\"name\":\"drawnJurors\",\"type\":\"address[]\"},{\"internalType\":\"uint96[]\",\"name\":\"drawnJurorFromCourtIDs\",\"type\":\"uint96[]\"},{\"internalType\":\"uint256\",\"name\":\"sumFeeRewardPaid\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"sumPnkRewardPaid\",\"type\":\"uint256\"},{\"internalType\":\"contract IERC20\",\"name\":\"feeToken\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"drawIterations\",\"type\":\"uint256\"},{\"internalType\":\"uint256[10]\",\"name\":\"__gap\",\"type\":\"uint256[10]\"}],\"internalType\":\"struct KlerosCoreUniversity.Round\",\"name\":\"\",\"type\":\"tuple\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint96\",\"name\":\"_courtID\",\"type\":\"uint96\"}],\"name\":\"getTimesPerPeriod\",\"outputs\":[{\"internalType\":\"uint256[4]\",\"name\":\"timesPerPeriod\",\"type\":\"uint256[4]\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_owner\",\"type\":\"address\"},{\"internalType\":\"address\",\"name\":\"_instructor\",\"type\":\"address\"},{\"internalType\":\"contract IERC20\",\"name\":\"_pinakion\",\"type\":\"address\"},{\"internalType\":\"address\",\"name\":\"_jurorProsecutionModule\",\"type\":\"address\"},{\"internalType\":\"contract IDisputeKit\",\"name\":\"_disputeKit\",\"type\":\"address\"},{\"internalType\":\"bool\",\"name\":\"_hiddenVotes\",\"type\":\"bool\"},{\"internalType\":\"uint256[4]\",\"name\":\"_courtParameters\",\"type\":\"uint256[4]\"},{\"internalType\":\"uint256[4]\",\"name\":\"_timesPerPeriod\",\"type\":\"uint256[4]\"},{\"internalType\":\"contract ISortitionModuleUniversity\",\"name\":\"_sortitionModuleAddress\",\"type\":\"address\"}],\"name\":\"initialize\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"instructor\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"}],\"name\":\"isDisputeKitJumping\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint96\",\"name\":\"_courtID\",\"type\":\"uint96\"},{\"internalType\":\"uint256\",\"name\":\"_disputeKitID\",\"type\":\"uint256\"}],\"name\":\"isSupported\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"jurorProsecutionModule\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"owner\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_disputeID\",\"type\":\"uint256\"}],\"name\":\"passPeriod\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"pinakion\",\"outputs\":[{\"internalType\":\"contract IERC20\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"proxiableUUID\",\"outputs\":[{\"internalType\":\"bytes32\",\"name\":\"\",\"type\":\"bytes32\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint96\",\"name\":\"_courtID\",\"type\":\"uint96\"},{\"internalType\":\"uint256\",\"name\":\"_newStake\",\"type\":\"uint256\"}],\"name\":\"setStake\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_account\",\"type\":\"address\"},{\"internalType\":\"uint96\",\"name\":\"_courtID\",\"type\":\"uint96\"},{\"internalType\":\"uint256\",\"name\":\"_newStake\",\"type\":\"uint256\"}],\"name\":\"setStakeBySortitionModule\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"sortitionModule\",\"outputs\":[{\"internalType\":\"contract ISortitionModuleUniversity\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_account\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"_amount\",\"type\":\"uint256\"}],\"name\":\"transferBySortitionModule\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"newImplementation\",\"type\":\"address\"},{\"internalType\":\"bytes\",\"name\":\"data\",\"type\":\"bytes\"}],\"name\":\"upgradeToAndCall\",\"outputs\":[],\"stateMutability\":\"payable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"version\",\"outputs\":[{\"internalType\":\"string\",\"name\":\"\",\"type\":\"string\"}],\"stateMutability\":\"view\",\"type\":\"function\"}],\"devdoc\":{\"errors\":{\"AlreadyInitialized()\":[{\"details\":\"The contract is already initialized.\"}],\"NotInitializing()\":[{\"details\":\"The contract is not initializing.\"}]},\"events\":{\"AcceptedFeeToken(address,bool)\":{\"params\":{\"_accepted\":\"Whether the token is accepted or not.\",\"_token\":\"The ERC20 token.\"}},\"DisputeCreation(uint256,address)\":{\"params\":{\"_arbitrable\":\"The contract which created the dispute.\",\"_disputeID\":\"The identifier of the dispute in the Arbitrator contract.\"}},\"Initialized(uint64)\":{\"details\":\"Triggered when the contract has been initialized or reinitialized.\"},\"NewCurrencyRate(address,uint64,uint8)\":{\"params\":{\"_feeToken\":\"The ERC20 token.\",\"_rateDecimals\":\"The new decimals of the fee token rate.\",\"_rateInEth\":\"The new rate of the fee token in ETH.\"}},\"Ruling(address,uint256,uint256)\":{\"params\":{\"_arbitrable\":\"The arbitrable receiving the ruling.\",\"_disputeID\":\"The identifier of the dispute in the Arbitrator contract.\",\"_ruling\":\"The ruling which was given.\"}},\"Upgraded(address)\":{\"params\":{\"newImplementation\":\"Address of the new implementation the proxy is now forwarding calls to.\"}}},\"kind\":\"dev\",\"methods\":{\"addNewDisputeKit(address)\":{\"params\":{\"_disputeKitAddress\":\"The address of the dispute kit contract.\"}},\"appeal(uint256,uint256,bytes)\":{\"details\":\"Access restricted to the Dispute Kit for this `disputeID`.\",\"params\":{\"_disputeID\":\"The ID of the dispute.\",\"_extraData\":\"Extradata for the dispute. Can be required during court jump.\",\"_numberOfChoices\":\"Number of choices for the dispute. Can be required during court jump.\"}},\"appealCost(uint256)\":{\"params\":{\"_disputeID\":\"The ID of the dispute.\"},\"returns\":{\"cost\":\"The appeal cost.\"}},\"appealPeriod(uint256)\":{\"params\":{\"_disputeID\":\"The ID of the dispute.\"},\"returns\":{\"end\":\"The end of the appeal period.\",\"start\":\"The start of the appeal period.\"}},\"arbitrationCost(bytes)\":{\"details\":\"It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.\",\"params\":{\"_extraData\":\"Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\"},\"returns\":{\"cost\":\"The arbitration cost in ETH.\"}},\"arbitrationCost(bytes,address)\":{\"details\":\"It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.\",\"params\":{\"_extraData\":\"Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\",\"_feeToken\":\"The ERC20 token used to pay fees.\"},\"returns\":{\"cost\":\"The arbitration cost in `_feeToken`.\"}},\"changeAcceptedFeeTokens(address,bool)\":{\"params\":{\"_accepted\":\"Whether the token is supported or not as a method of fee payment.\",\"_feeToken\":\"The fee token.\"}},\"changeCurrencyRates(address,uint64,uint8)\":{\"params\":{\"_feeToken\":\"The fee token.\",\"_rateDecimals\":\"The new decimals of the fee token rate.\",\"_rateInEth\":\"The new rate of the fee token in ETH.\"}},\"changeInstructor(address)\":{\"params\":{\"_instructor\":\"The new value for the `instructor` storage variable.\"}},\"changeJurorProsecutionModule(address)\":{\"params\":{\"_jurorProsecutionModule\":\"The new value for the `jurorProsecutionModule` storage variable.\"}},\"changeOwner(address)\":{\"params\":{\"_owner\":\"The new value for the `owner` storage variable.\"}},\"changePinakion(address)\":{\"params\":{\"_pinakion\":\"The new value for the `pinakion` storage variable.\"}},\"changeSortitionModule(address)\":{\"params\":{\"_sortitionModule\":\"The new value for the `sortitionModule` storage variable.\"}},\"constructor\":{\"custom:oz-upgrades-unsafe-allow\":\"constructor\"},\"createCourt(uint96,bool,uint256,uint256,uint256,uint256,uint256[4],uint256[])\":{\"params\":{\"_alpha\":\"The `alpha` property value of the court.\",\"_feeForJuror\":\"The `feeForJuror` property value of the court.\",\"_hiddenVotes\":\"The `hiddenVotes` property value of the court.\",\"_jurorsForCourtJump\":\"The `jurorsForCourtJump` property value of the court.\",\"_minStake\":\"The `minStake` property value of the court.\",\"_parent\":\"The `parent` property value of the court.\",\"_supportedDisputeKits\":\"Indexes of dispute kits that this court will support.\",\"_timesPerPeriod\":\"The `timesPerPeriod` property value of the court.\"}},\"createDispute(uint256,bytes)\":{\"details\":\"Must be called by the arbitrable contract and pay at least `arbitrationCost(_extraData)` in ETH.\",\"params\":{\"_extraData\":\"Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\",\"_numberOfChoices\":\"The number of choices the arbitrator can choose from in this dispute.\"},\"returns\":{\"disputeID\":\"The identifier of the dispute created.\"}},\"createDispute(uint256,bytes,address,uint256)\":{\"details\":\"Must be called by the arbitrable contract and pay at least `arbitrationCost(_extraData)` in the supported ERC20 token.\",\"params\":{\"_extraData\":\"Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\",\"_feeAmount\":\"Amount of the ERC20 token used to pay fees.\",\"_feeToken\":\"The ERC20 token used to pay fees.\",\"_numberOfChoices\":\"The number of choices the arbitrator can choose from in this dispute.\"},\"returns\":{\"disputeID\":\"The identifier of the dispute created.\"}},\"currentRuling(uint256)\":{\"params\":{\"_disputeID\":\"The ID of the dispute.\"},\"returns\":{\"overridden\":\"Whether the ruling was overridden by appeal funding or not.\",\"ruling\":\"The current ruling.\",\"tied\":\"Whether it's a tie or not.\"}},\"draw(uint256,address)\":{\"params\":{\"_disputeID\":\"The ID of the dispute.\",\"_juror\":\"The address of the juror to draw.\"}},\"enableDisputeKits(uint96,uint256[],bool)\":{\"params\":{\"_courtID\":\"The ID of the court.\",\"_disputeKitIDs\":\"The IDs of dispute kits which support should be added/removed.\",\"_enable\":\"Whether add or remove the dispute kits from the court.\"}},\"execute(uint256,uint256,uint256)\":{\"params\":{\"_disputeID\":\"The ID of the dispute.\",\"_iterations\":\"The number of iterations to run.\",\"_round\":\"The appeal round.\"}},\"executeOwnerProposal(address,uint256,bytes)\":{\"params\":{\"_amount\":\"The value sent with the call.\",\"_data\":\"The data sent with the call.\",\"_destination\":\"The destination of the call.\"}},\"executeRuling(uint256)\":{\"params\":{\"_disputeID\":\"The ID of the dispute.\"}},\"getNumberOfRounds(uint256)\":{\"params\":{\"_disputeID\":\"The ID of the dispute.\"},\"returns\":{\"_0\":\"The number of rounds.\"}},\"getNumberOfVotes(uint256)\":{\"params\":{\"_disputeID\":\"The ID of the dispute.\"}},\"getPnkAtStakePerJuror(uint256,uint256)\":{\"params\":{\"_disputeID\":\"The ID of the dispute.\",\"_round\":\"The round to get the info for.\"},\"returns\":{\"_0\":\"pnkAtStakePerJuror The PNK at stake per juror.\"}},\"getRoundInfo(uint256,uint256)\":{\"details\":\"This function must not be called from a non-view function because it returns a dynamic array which might be very large, theoretically exceeding the block gas limit.\",\"params\":{\"_disputeID\":\"The ID of the dispute.\",\"_round\":\"The round to get the info for.\"},\"returns\":{\"_0\":\"round The round info.\"}},\"getTimesPerPeriod(uint96)\":{\"params\":{\"_courtID\":\"The ID of the court to get the times from.\"},\"returns\":{\"timesPerPeriod\":\"The timesPerPeriod array for the given court.\"}},\"initialize(address,address,address,address,address,bool,uint256[4],uint256[4],address)\":{\"params\":{\"_courtParameters\":\"Numeric parameters of General court (minStake, alpha, feeForJuror and jurorsForCourtJump respectively).\",\"_disputeKit\":\"The address of the default dispute kit.\",\"_hiddenVotes\":\"The `hiddenVotes` property value of the general court.\",\"_instructor\":\"The address of the instructor.\",\"_jurorProsecutionModule\":\"The address of the juror prosecution module.\",\"_owner\":\"The owner's address.\",\"_pinakion\":\"The address of the token contract.\",\"_sortitionModuleAddress\":\"The sortition module responsible for sortition of the jurors.\",\"_timesPerPeriod\":\"The `timesPerPeriod` property value of the general court.\"}},\"isDisputeKitJumping(uint256)\":{\"params\":{\"_disputeID\":\"The ID of the dispute.\"},\"returns\":{\"_0\":\"Whether DK will be switched or not.\"}},\"isSupported(uint96,uint256)\":{\"params\":{\"_courtID\":\"The ID of the court to check the support for.\",\"_disputeKitID\":\"The ID of the dispute kit to check the support for.\"},\"returns\":{\"_0\":\"Whether the dispute kit is supported or not.\"}},\"passPeriod(uint256)\":{\"params\":{\"_disputeID\":\"The ID of the dispute.\"}},\"proxiableUUID()\":{\"details\":\"IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks bricking a proxy that upgrades to it, by delegating to itself until out of gas. Thus it is critical that this function revert if invoked through a proxy. This is guaranteed by the if statement.\"},\"setStake(uint96,uint256)\":{\"params\":{\"_courtID\":\"The ID of the court.\",\"_newStake\":\"The new stake. Note that the existing delayed stake will be nullified as non-relevant.\"}},\"setStakeBySortitionModule(address,uint96,uint256)\":{\"params\":{\"_account\":\"The account whose stake is being set.\",\"_courtID\":\"The ID of the court.\",\"_newStake\":\"The new stake.\"}},\"transferBySortitionModule(address,uint256)\":{\"params\":{\"_account\":\"The account of the juror whose PNK to transfer.\",\"_amount\":\"The amount to transfer.\"}},\"upgradeToAndCall(address,bytes)\":{\"details\":\"Reverts if the execution is not performed via delegatecall or the execution context is not of a proxy with an ERC1967-compliant implementation pointing to self.\",\"params\":{\"data\":\"Data used in a delegate call to `newImplementation` if non-empty. This will typically be an encoded function call, and allows initializing the storage of the proxy like a Solidity constructor.\",\"newImplementation\":\"Address of the new implementation contract.\"}}},\"stateVariables\":{\"version\":{\"return\":\"Version string.\",\"returns\":{\"_0\":\"Version string.\"}}},\"title\":\"KlerosCoreUniversity\",\"version\":1},\"userdoc\":{\"errors\":{\"FailedDelegateCall()\":[{\"notice\":\"Failed Delegated call\"}],\"InvalidImplementation(address)\":[{\"notice\":\"The `implementation` is not UUPS-compliant\"}],\"UUPSUnauthorizedCallContext()\":[{\"notice\":\"The call is from an unauthorized context.\"}],\"UUPSUnsupportedProxiableUUID(bytes32)\":[{\"notice\":\"The storage `slot` is unsupported as a UUID.\"}]},\"events\":{\"AcceptedFeeToken(address,bool)\":{\"notice\":\"To be emitted when an ERC20 token is added or removed as a method to pay fees.\"},\"DisputeCreation(uint256,address)\":{\"notice\":\"To be emitted when a dispute is created.\"},\"NewCurrencyRate(address,uint64,uint8)\":{\"notice\":\"To be emitted when the fee for a particular ERC20 token is updated.\"},\"Ruling(address,uint256,uint256)\":{\"notice\":\"To be raised when a ruling is given.\"},\"Upgraded(address)\":{\"notice\":\"Emitted when the `implementation` has been successfully upgraded.\"}},\"kind\":\"user\",\"methods\":{\"addNewDisputeKit(address)\":{\"notice\":\"Add a new supported dispute kit module to the court.\"},\"appeal(uint256,uint256,bytes)\":{\"notice\":\"Appeals the ruling of a specified dispute.\"},\"appealCost(uint256)\":{\"notice\":\"Gets the cost of appealing a specified dispute.\"},\"appealPeriod(uint256)\":{\"notice\":\"Gets the start and the end of a specified dispute's current appeal period.\"},\"arbitrationCost(bytes)\":{\"notice\":\"Compute the cost of arbitration denominated in the native currency, typically ETH.\"},\"arbitrationCost(bytes,address)\":{\"notice\":\"Compute the cost of arbitration denominated in `_feeToken`.\"},\"changeAcceptedFeeTokens(address,bool)\":{\"notice\":\"Changes the supported fee tokens.\"},\"changeCurrencyRates(address,uint64,uint8)\":{\"notice\":\"Changes the currency rate of a fee token.\"},\"changeInstructor(address)\":{\"notice\":\"Changes the `instructor` storage variable.\"},\"changeJurorProsecutionModule(address)\":{\"notice\":\"Changes the `jurorProsecutionModule` storage variable.\"},\"changeOwner(address)\":{\"notice\":\"Changes the `owner` storage variable.\"},\"changePinakion(address)\":{\"notice\":\"Changes the `pinakion` storage variable.\"},\"changeSortitionModule(address)\":{\"notice\":\"Changes the `_sortitionModule` storage variable. Note that the new module should be initialized for all courts.\"},\"createCourt(uint96,bool,uint256,uint256,uint256,uint256,uint256[4],uint256[])\":{\"notice\":\"Creates a court under a specified parent court.\"},\"createDispute(uint256,bytes)\":{\"notice\":\"Create a dispute and pay for the fees in the native currency, typically ETH.\"},\"createDispute(uint256,bytes,address,uint256)\":{\"notice\":\"Create a dispute and pay for the fees in a supported ERC20 token.\"},\"currentRuling(uint256)\":{\"notice\":\"Gets the current ruling of a specified dispute.\"},\"draw(uint256,address)\":{\"notice\":\"Draws one juror for the dispute until the number votes paid for is reached.\"},\"enableDisputeKits(uint96,uint256[],bool)\":{\"notice\":\"Adds/removes court's support for specified dispute kits.\"},\"execute(uint256,uint256,uint256)\":{\"notice\":\"Distribute the PNKs at stake and the dispute fees for the specific round of the dispute. Can be called in parts.\"},\"executeOwnerProposal(address,uint256,bytes)\":{\"notice\":\"Allows the owner to call anything on behalf of the contract.\"},\"executeRuling(uint256)\":{\"notice\":\"Executes a specified dispute's ruling.\"},\"getNumberOfRounds(uint256)\":{\"notice\":\"Gets the number of rounds for a specified dispute.\"},\"getNumberOfVotes(uint256)\":{\"notice\":\"Gets the number of votes permitted for the specified dispute in the latest round.\"},\"getPnkAtStakePerJuror(uint256,uint256)\":{\"notice\":\"Gets the PNK at stake per juror for a specified dispute and round.\"},\"getRoundInfo(uint256,uint256)\":{\"notice\":\"Gets the round info for a specified dispute and round.\"},\"getTimesPerPeriod(uint96)\":{\"notice\":\"Gets the timesPerPeriod array for a given court.\"},\"initialize(address,address,address,address,address,bool,uint256[4],uint256[4],address)\":{\"notice\":\"Initializer (constructor equivalent for upgradable contracts).\"},\"isDisputeKitJumping(uint256)\":{\"notice\":\"Returns true if the dispute kit will be switched to a parent DK.\"},\"isSupported(uint96,uint256)\":{\"notice\":\"Checks if a given dispute kit is supported by a given court.\"},\"passPeriod(uint256)\":{\"notice\":\"Passes the period of a specified dispute.\"},\"proxiableUUID()\":{\"notice\":\"Implementation of the ERC1822 `proxiableUUID` function. This returns the storage slot used by the implementation. It is used to validate the implementation's compatibility when performing an upgrade.\"},\"setStake(uint96,uint256)\":{\"notice\":\"Sets the caller's stake in a court.\"},\"setStakeBySortitionModule(address,uint96,uint256)\":{\"notice\":\"Sets the stake of a specified account in a court, typically to apply a delayed stake or unstake inactive jurors.\"},\"transferBySortitionModule(address,uint256)\":{\"notice\":\"Transfers PNK to the juror by SortitionModule.\"},\"upgradeToAndCall(address,bytes)\":{\"notice\":\"Upgrade mechanism including access control and UUPS-compliance.\"},\"version()\":{\"notice\":\"Returns the version of the implementation.\"}},\"notice\":\"Core arbitrator contract for educational purposes.\",\"version\":1}},\"settings\":{\"compilationTarget\":{\"src/arbitration/university/KlerosCoreUniversity.sol\":\"KlerosCoreUniversity\"},\"evmVersion\":\"cancun\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\",\"useLiteralContent\":true},\"optimizer\":{\"enabled\":true,\"runs\":1000},\"remappings\":[],\"viaIR\":true},\"sources\":{\"@openzeppelin/contracts/token/ERC20/IERC20.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v5.4.0) (token/ERC20/IERC20.sol)\\n\\npragma solidity >=0.4.16;\\n\\n/**\\n * @dev Interface of the ERC-20 standard as defined in the ERC.\\n */\\ninterface IERC20 {\\n    /**\\n     * @dev Emitted when `value` tokens are moved from one account (`from`) to\\n     * another (`to`).\\n     *\\n     * Note that `value` may be zero.\\n     */\\n    event Transfer(address indexed from, address indexed to, uint256 value);\\n\\n    /**\\n     * @dev Emitted when the allowance of a `spender` for an `owner` is set by\\n     * a call to {approve}. `value` is the new allowance.\\n     */\\n    event Approval(address indexed owner, address indexed spender, uint256 value);\\n\\n    /**\\n     * @dev Returns the value of tokens in existence.\\n     */\\n    function totalSupply() external view returns (uint256);\\n\\n    /**\\n     * @dev Returns the value of tokens owned by `account`.\\n     */\\n    function balanceOf(address account) external view returns (uint256);\\n\\n    /**\\n     * @dev Moves a `value` amount of tokens from the caller's account to `to`.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * Emits a {Transfer} event.\\n     */\\n    function transfer(address to, uint256 value) external returns (bool);\\n\\n    /**\\n     * @dev Returns the remaining number of tokens that `spender` will be\\n     * allowed to spend on behalf of `owner` through {transferFrom}. This is\\n     * zero by default.\\n     *\\n     * This value changes when {approve} or {transferFrom} are called.\\n     */\\n    function allowance(address owner, address spender) external view returns (uint256);\\n\\n    /**\\n     * @dev Sets a `value` amount of tokens as the allowance of `spender` over the\\n     * caller's tokens.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * IMPORTANT: Beware that changing an allowance with this method brings the risk\\n     * that someone may use both the old and the new allowance by unfortunate\\n     * transaction ordering. One possible solution to mitigate this race\\n     * condition is to first reduce the spender's allowance to 0 and set the\\n     * desired value afterwards:\\n     * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729\\n     *\\n     * Emits an {Approval} event.\\n     */\\n    function approve(address spender, uint256 value) external returns (bool);\\n\\n    /**\\n     * @dev Moves a `value` amount of tokens from `from` to `to` using the\\n     * allowance mechanism. `value` is then deducted from the caller's\\n     * allowance.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * Emits a {Transfer} event.\\n     */\\n    function transferFrom(address from, address to, uint256 value) external returns (bool);\\n}\\n\",\"keccak256\":\"0x74ed01eb66b923d0d0cfe3be84604ac04b76482a55f9dd655e1ef4d367f95bc2\",\"license\":\"MIT\"},\"src/arbitration/interfaces/IArbitrableV2.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity >=0.8.0 <0.9.0;\\n\\nimport \\\"./IArbitratorV2.sol\\\";\\n\\n/// @title IArbitrableV2\\n/// @notice Arbitrable interface.\\n/// @dev When developing arbitrable contracts, we need to:\\n/// - Define the action taken when a ruling is received by the contract.\\n/// - Allow dispute creation which calls `arbitrator.createDispute{value: _fee}(_choices,_extraData)`.\\ninterface IArbitrableV2 {\\n    // ************************************* //\\n    // *              Events               * //\\n    // ************************************* //\\n\\n    /// @notice To be emitted when a dispute is created to link the correct template to the disputeID.\\n    /// @param _arbitrator The arbitrator of the contract.\\n    /// @param _arbitratorDisputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _externalDisputeID An identifier created outside Kleros by the protocol requesting arbitration.\\n    /// @param _templateId The identifier of the dispute template.\\n    event DisputeRequest(\\n        IArbitratorV2 indexed _arbitrator,\\n        uint256 indexed _arbitratorDisputeID,\\n        uint256 _externalDisputeID,\\n        uint256 _templateId\\n    );\\n\\n    /// @notice To be raised when a ruling is given.\\n    /// @param _arbitrator The arbitrator giving the ruling.\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _ruling The ruling which was given.\\n    event Ruling(IArbitratorV2 indexed _arbitrator, uint256 indexed _disputeID, uint256 _ruling);\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @notice Give a ruling for a dispute.\\n    ///\\n    /// @dev This is a callback function for the arbitrator to provide the ruling to this contract.\\n    /// Only the arbitrator must be allowed to call this function.\\n    /// Ruling 0 is reserved for \\\"Not able/wanting to make a decision\\\".\\n    ///\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _ruling Ruling given by the arbitrator.\\n    function rule(uint256 _disputeID, uint256 _ruling) external;\\n}\\n\",\"keccak256\":\"0x3afa29a93847399c8705103350b69bb70706b2075ca41b39d523b007e69e23db\",\"license\":\"MIT\"},\"src/arbitration/interfaces/IArbitratorV2.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity >=0.8.0 <0.9.0;\\n\\nimport \\\"@openzeppelin/contracts/token/ERC20/IERC20.sol\\\";\\nimport \\\"./IArbitrableV2.sol\\\";\\n\\n/// @title Arbitrator\\n/// @notice Arbitrator interface for the Kleros V2 protocol.\\n/// @dev Unlike the ERC-792 this standard is not concerned with appeals, so each arbitrator can implement an appeal system that suits it the most.\\ninterface IArbitratorV2 {\\n    // ************************************* //\\n    // *              Events               * //\\n    // ************************************* //\\n\\n    /// @notice To be emitted when a dispute is created.\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _arbitrable The contract which created the dispute.\\n    event DisputeCreation(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);\\n\\n    /// @notice To be raised when a ruling is given.\\n    /// @param _arbitrable The arbitrable receiving the ruling.\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _ruling The ruling which was given.\\n    event Ruling(IArbitrableV2 indexed _arbitrable, uint256 indexed _disputeID, uint256 _ruling);\\n\\n    /// @notice To be emitted when an ERC20 token is added or removed as a method to pay fees.\\n    /// @param _token The ERC20 token.\\n    /// @param _accepted Whether the token is accepted or not.\\n    event AcceptedFeeToken(IERC20 indexed _token, bool indexed _accepted);\\n\\n    /// @notice To be emitted when the fee for a particular ERC20 token is updated.\\n    /// @param _feeToken The ERC20 token.\\n    /// @param _rateInEth The new rate of the fee token in ETH.\\n    /// @param _rateDecimals The new decimals of the fee token rate.\\n    event NewCurrencyRate(IERC20 indexed _feeToken, uint64 _rateInEth, uint8 _rateDecimals);\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @notice Create a dispute and pay for the fees in the native currency, typically ETH.\\n    /// @dev Must be called by the arbitrable contract and pay at least `arbitrationCost(_extraData)` in ETH.\\n    /// @param _numberOfChoices The number of choices the arbitrator can choose from in this dispute.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @return disputeID The identifier of the dispute created.\\n    function createDispute(\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData\\n    ) external payable returns (uint256 disputeID);\\n\\n    /// @notice Create a dispute and pay for the fees in a supported ERC20 token.\\n    /// @dev Must be called by the arbitrable contract and pay at least `arbitrationCost(_extraData)` in the supported ERC20 token.\\n    /// @param _numberOfChoices The number of choices the arbitrator can choose from in this dispute.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @param _feeToken The ERC20 token used to pay fees.\\n    /// @param _feeAmount Amount of the ERC20 token used to pay fees.\\n    /// @return disputeID The identifier of the dispute created.\\n    function createDispute(\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData,\\n        IERC20 _feeToken,\\n        uint256 _feeAmount\\n    ) external returns (uint256 disputeID);\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /// @notice Compute the cost of arbitration denominated in the native currency, typically ETH.\\n    /// @dev It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @return cost The arbitration cost in ETH.\\n    function arbitrationCost(bytes calldata _extraData) external view returns (uint256 cost);\\n\\n    /// @notice Compute the cost of arbitration denominated in `_feeToken`.\\n    /// @dev It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @param _feeToken The ERC20 token used to pay fees.\\n    /// @return cost The arbitration cost in `_feeToken`.\\n    function arbitrationCost(bytes calldata _extraData, IERC20 _feeToken) external view returns (uint256 cost);\\n\\n    /// @notice Gets the current ruling of a specified dispute.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return ruling The current ruling.\\n    /// @return tied Whether it's a tie or not.\\n    /// @return overridden Whether the ruling was overridden by appeal funding or not.\\n    function currentRuling(uint256 _disputeID) external view returns (uint256 ruling, bool tied, bool overridden);\\n}\\n\",\"keccak256\":\"0x65ba87c5309cd6e6562e569f79778ca423c9be7b0a44b9407e5bd2bdf8fdc3b0\",\"license\":\"MIT\"},\"src/arbitration/interfaces/IDisputeKit.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity >=0.8.0 <0.9.0;\\n\\nimport \\\"./IArbitratorV2.sol\\\";\\n\\n/// @title IDisputeKit\\n/// @notice An abstraction of the Dispute Kits intended for interfacing with KlerosCore.\\n/// @dev It does not intend to abstract the interactions with the user (such as voting or appeal funding) to allow for implementation-specific parameters.\\ninterface IDisputeKit {\\n    // ************************************ //\\n    // *             Events               * //\\n    // ************************************ //\\n\\n    /// @notice Emitted when casting a vote to provide the justification of juror's choice.\\n    /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _juror Address of the juror.\\n    /// @param _voteIDs The identifiers of the votes in the dispute.\\n    /// @param _choice The choice juror voted for.\\n    /// @param _justification Justification of the choice.\\n    event VoteCast(\\n        uint256 indexed _coreDisputeID,\\n        address indexed _juror,\\n        uint256[] _voteIDs,\\n        uint256 indexed _choice,\\n        string _justification\\n    );\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @notice Creates a local dispute and maps it to the dispute ID in the Core contract.\\n    /// @dev Access restricted to Kleros Core only.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _numberOfChoices Number of choices of the dispute\\n    /// @param _extraData Additional info about the dispute, for possible use in future dispute kits.\\n    /// @param _nbVotes Maximal number of votes this dispute can get. Added for future-proofing.\\n    function createDispute(\\n        uint256 _coreDisputeID,\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData,\\n        uint256 _nbVotes\\n    ) external;\\n\\n    /// @notice Draws the juror from the sortition tree. The drawn address is picked up by Kleros Core.\\n    /// @dev Access restricted to Kleros Core only.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _nonce Nonce.\\n    /// @return drawnAddress The drawn address.\\n    function draw(\\n        uint256 _coreDisputeID,\\n        uint256 _nonce\\n    ) external returns (address drawnAddress, uint96 fromSubcourtID);\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /// @notice Gets the current ruling of a specified dispute.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @return ruling The current ruling.\\n    /// @return tied Whether it's a tie or not.\\n    /// @return overridden Whether the ruling was overridden by appeal funding or not.\\n    function currentRuling(uint256 _coreDisputeID) external view returns (uint256 ruling, bool tied, bool overridden);\\n\\n    /// @notice Gets the degree of coherence of a particular voter.\\n    /// @dev This function is called by Kleros Core in order to determine the amount of the reward.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.\\n    /// @param _voteID The ID of the vote.\\n    /// @param _feePerJuror The fee per juror.\\n    /// @param _pnkAtStakePerJuror The PNK at stake per juror.\\n    /// @return pnkCoherence The degree of coherence in basis points for the dispute PNK reward.\\n    /// @return feeCoherence The degree of coherence in basis points for the dispute fee reward.\\n    function getDegreeOfCoherenceReward(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _voteID,\\n        uint256 _feePerJuror,\\n        uint256 _pnkAtStakePerJuror\\n    ) external view returns (uint256 pnkCoherence, uint256 feeCoherence);\\n\\n    /// @notice Gets the degree of coherence of a particular voter.\\n    /// @dev This function is called by Kleros Core in order to determine the amount of the penalty.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.\\n    /// @param _voteID The ID of the vote.\\n    /// @param _feePerJuror The fee per juror.\\n    /// @param _pnkAtStakePerJuror The PNK at stake per juror.\\n    /// @return pnkCoherence The degree of coherence in basis points for the dispute PNK reward.\\n    function getDegreeOfCoherencePenalty(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _voteID,\\n        uint256 _feePerJuror,\\n        uint256 _pnkAtStakePerJuror\\n    ) external view returns (uint256 pnkCoherence);\\n\\n    /// @notice Gets the number of jurors who are eligible to a reward in this round.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.\\n    /// @return The number of coherent jurors.\\n    function getCoherentCount(uint256 _coreDisputeID, uint256 _coreRoundID) external view returns (uint256);\\n\\n    /// @notice Returns true if all of the jurors have cast their commits for the last round.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @return Whether all of the jurors have cast their commits for the last round.\\n    function areCommitsAllCast(uint256 _coreDisputeID) external view returns (bool);\\n\\n    /// @notice Returns true if all of the jurors have cast their votes for the last round.\\n    /// @dev This function is to be called directly by the core contract and is not for off-chain usage.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @return Whether all of the jurors have cast their votes for the last round.\\n    function areVotesAllCast(uint256 _coreDisputeID) external view returns (bool);\\n\\n    /// @notice Returns true if the appeal funding is finished prematurely (e.g. when losing side didn't fund).\\n    /// @dev This function is to be called directly by the core contract and is not for off-chain usage.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @return Whether the appeal funding is finished.\\n    function isAppealFunded(uint256 _coreDisputeID) external view returns (bool);\\n\\n    /// @dev Returns true if the dispute is jumping to a parent court.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @return Whether the dispute is jumping to a parent court or not.\\n    function earlyCourtJump(uint256 _coreDisputeID) external view returns (bool);\\n\\n    /// @notice Returns the number of votes after the appeal.\\n    /// @param _previousDisputeKit The previous Dispute Kit.\\n    /// @param _currentNbVotes The number of votes before the appeal.\\n    /// @return The number of votes after the appeal.\\n    function getNbVotesAfterAppeal(\\n        IDisputeKit _previousDisputeKit,\\n        uint256 _currentNbVotes\\n    ) external view returns (uint256);\\n\\n    /// @notice Returns the dispute kit ID to be used after court jump by Kleros Core.\\n    /// @return The ID of the dispute kit in Kleros Core disputeKits array.\\n    function getJumpDisputeKitID() external view returns (uint256);\\n\\n    /// @notice Returns true if the specified voter was active in this round.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.\\n    /// @param _voteID The ID of the voter.\\n    /// @return Whether the voter was active or not.\\n    function isVoteActive(uint256 _coreDisputeID, uint256 _coreRoundID, uint256 _voteID) external view returns (bool);\\n\\n    /// @notice Returns the info of the specified round in the core contract.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.\\n    /// @param _choice The choice to query.\\n    /// @return winningChoice The winning choice of this round.\\n    /// @return tied Whether it's a tie or not.\\n    /// @return totalVoted Number of jurors who cast the vote already.\\n    /// @return totalCommited Number of jurors who cast the commit already (only relevant for hidden votes).\\n    /// @return nbVoters Total number of voters in this round.\\n    /// @return choiceCount Number of votes cast for the queried choice.\\n    function getRoundInfo(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _choice\\n    )\\n        external\\n        view\\n        returns (\\n            uint256 winningChoice,\\n            bool tied,\\n            uint256 totalVoted,\\n            uint256 totalCommited,\\n            uint256 nbVoters,\\n            uint256 choiceCount\\n        );\\n\\n    /// @notice Returns the vote information for a given vote ID.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core.\\n    /// @param _coreRoundID The ID of the round in Kleros Core.\\n    /// @param _voteID The ID of the vote.\\n    /// @return account The address of the juror who cast the vote.\\n    /// @return commit The commit of the vote.\\n    /// @return choice The choice that got the vote.\\n    /// @return voted Whether the vote was cast or not.\\n    function getVoteInfo(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _voteID\\n    ) external view returns (address account, bytes32 commit, uint256 choice, bool voted);\\n}\\n\",\"keccak256\":\"0x1f12d2574dffd9bf83cf33a54aa4abbbfa4203251a0f962edd8e5c3b370408bc\",\"license\":\"MIT\"},\"src/arbitration/interfaces/ISortitionModule.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity >=0.8.0 <0.9.0;\\n\\nimport \\\"../../libraries/Constants.sol\\\";\\n\\n/// @title ISortitionModule\\n/// @notice Interface for the SortitionModule contract.\\ninterface ISortitionModule {\\n    // ************************************* //\\n    // *              Enums                * //\\n    // ************************************* //\\n\\n    enum Phase {\\n        staking, // Stake sum trees can be updated. Pass after `minStakingTime` passes and there is at least one dispute without jurors.\\n        generating, // Waiting for a random number. Pass as soon as it is ready.\\n        drawing // Jurors can be drawn. Pass after all disputes have jurors or `maxDrawingTime` passes.\\n    }\\n\\n    // ************************************* //\\n    // *              Events               * //\\n    // ************************************* //\\n\\n    /// @notice Emitted when the phase is changed.\\n    /// @param _phase The new phase.\\n    event NewPhase(Phase _phase);\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @notice Passes the phase.\\n    function passPhase() external;\\n\\n    /// @notice Executes the next delayed stakes.\\n    /// @param _iterations The number of delayed stakes to execute.\\n    function executeDelayedStakes(uint256 _iterations) external;\\n\\n    /// @notice Create a sortition sum tree at the specified key.\\n    /// @param _courtID The ID of the court.\\n    /// @param _extraData Extra data that contains the number of children each node in the tree should have.\\n    function createTree(uint96 _courtID, bytes memory _extraData) external;\\n\\n    /// @notice Validate the specified juror's new stake for a court.\\n    /// @dev No state changes should be made when returning stakingResult != Successful, otherwise delayed stakes might break invariants.\\n    /// @param _account The address of the juror.\\n    /// @param _courtID The ID of the court.\\n    /// @param _newStake The new stake.\\n    /// @param _noDelay True if the stake change should not be delayed.\\n    /// @return pnkDeposit The amount of PNK to be deposited.\\n    /// @return pnkWithdrawal The amount of PNK to be withdrawn.\\n    /// @return stakingResult The result of the staking operation.\\n    function validateStake(\\n        address _account,\\n        uint96 _courtID,\\n        uint256 _newStake,\\n        bool _noDelay\\n    ) external returns (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult);\\n\\n    /// @notice Update the state of the stakes, called by KC at the end of setStake flow.\\n    ///\\n    /// @dev `O(n + p * log_k(j))` where\\n    /// `n` is the number of courts the juror has staked in,\\n    /// `p` is the depth of the court tree,\\n    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,\\n    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.\\n    ///\\n    /// @param _account The address of the juror.\\n    /// @param _courtID The ID of the court.\\n    /// @param _pnkDeposit The amount of PNK to be deposited.\\n    /// @param _pnkWithdrawal The amount of PNK to be withdrawn.\\n    /// @param _newStake The new stake.\\n    function setStake(\\n        address _account,\\n        uint96 _courtID,\\n        uint256 _pnkDeposit,\\n        uint256 _pnkWithdrawal,\\n        uint256 _newStake\\n    ) external;\\n\\n    /// @notice Update the state of the stakes with a PNK reward deposit, called by KC during rewards execution.\\n    ///\\n    /// @dev `O(n + p * log_k(j))` where\\n    /// `n` is the number of courts the juror has staked in,\\n    /// `p` is the depth of the court tree,\\n    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,\\n    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.\\n    ///\\n    /// @param _account The address of the juror.\\n    /// @param _courtID The ID of the court.\\n    /// @param _penalty The amount of PNK to be deducted.\\n    /// @return pnkBalance The updated total PNK balance of the juror, including the penalty.\\n    /// @return newCourtStake The updated stake of the juror in the court.\\n    /// @return availablePenalty The amount of PNK that was actually deducted.\\n    function setStakePenalty(\\n        address _account,\\n        uint96 _courtID,\\n        uint256 _penalty\\n    ) external returns (uint256 pnkBalance, uint256 newCourtStake, uint256 availablePenalty);\\n\\n    /// @notice Update the state of the stakes with a PNK reward deposit, called by KC during rewards execution.\\n    ///\\n    /// @dev `O(n + p * log_k(j))` where\\n    /// `O(n + p * log_k(j))` where\\n    /// `n` is the number of courts the juror has staked in,\\n    /// `p` is the depth of the court tree,\\n    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,\\n    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.\\n    ///\\n    /// @param _account The address of the juror.\\n    /// @param _courtID The ID of the court.\\n    /// @param _reward The amount of PNK to be deposited as a reward.\\n    /// @return success True if the reward was added successfully.\\n    function setStakeReward(address _account, uint96 _courtID, uint256 _reward) external returns (bool success);\\n\\n    /// @notice Unstakes the inactive juror from all courts.\\n    ///\\n    /// @dev `O(n * (p * log_k(j)) )` where\\n    /// `O(n * (p * log_k(j)) )` where\\n    /// `n` is the number of courts the juror has staked in,\\n    /// `p` is the depth of the court tree,\\n    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,\\n    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.\\n    ///\\n    /// @param _account The juror to unstake.\\n    function forcedUnstakeAllCourts(address _account) external;\\n\\n    /// @notice Unstakes the inactive juror from a specific court.\\n    ///\\n    /// @dev `O(n * (p * log_k(j)) )` where\\n    /// `n` is the number of courts the juror has staked in,\\n    /// `p` is the depth of the court tree,\\n    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,\\n    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.\\n    ///\\n    /// @param _account The juror to unstake.\\n    /// @param _courtID The ID of the court.\\n    function forcedUnstake(address _account, uint96 _courtID) external;\\n\\n    /// @notice Locks the tokens of the drawn juror.\\n    /// @param _account The address of the juror.\\n    /// @param _relativeAmount The amount to lock.\\n    function lockStake(address _account, uint256 _relativeAmount) external;\\n\\n    /// @notice Unlocks the tokens of the drawn juror.\\n    /// @param _account The address of the juror.\\n    /// @param _relativeAmount The amount to unlock.\\n    function unlockStake(address _account, uint256 _relativeAmount) external;\\n\\n    /// @notice Triggers the state changes after dispute creation.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _roundID The ID of the round.\\n    function createDisputeHook(uint256 _disputeID, uint256 _roundID) external;\\n\\n    /// @notice Triggers the state changes after drawing.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _roundID The ID of the round.\\n    function postDrawHook(uint256 _disputeID, uint256 _roundID) external;\\n\\n    /// @notice Gives back the locked PNKs in case the juror fully unstaked earlier.\\n    ///\\n    /// @dev that since locked and staked PNK are async it is possible for the juror to have positive staked PNK balance\\n    /// while having 0 stake in courts and 0 locked tokens (eg. when the juror fully unstaked during dispute and later got his tokens unlocked).\\n    /// In this case the juror can use this function to withdraw the leftover tokens.\\n    /// Also note that if the juror has some leftover PNK while not fully unstaked he'll have to manually unstake from all courts to trigger this function.\\n    ///\\n    /// @param _account The juror whose PNK to withdraw.\\n    function withdrawLeftoverPNK(address _account) external;\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /// @notice Draw an ID from a tree using a number.\\n    ///\\n    /// @dev that this function reverts if the sum of all values in the tree is 0.\\n    /// `O(k * log_k(n))` where\\n    /// `k` is the maximum number of children per node in the tree,\\n    ///  and `n` is the maximum number of nodes ever appended.\\n    ///\\n    /// @param _courtID The ID of the court.\\n    /// @param _coreDisputeID Index of the dispute in Kleros Core.\\n    /// @param _nonce Nonce to hash with random number.\\n    /// @return drawnAddress The drawn address.\\n    function draw(\\n        uint96 _courtID,\\n        uint256 _coreDisputeID,\\n        uint256 _nonce\\n    ) external view returns (address drawnAddress, uint96 fromSubcourtID);\\n\\n    /// @notice Gets the balance of a juror in a court.\\n    /// @param _juror The address of the juror.\\n    /// @param _courtID The ID of the court.\\n    /// @return totalStakedPnk The total amount of tokens staked including locked tokens and penalty deductions. Equivalent to the effective stake in the General court.\\n    /// @return totalLocked The total amount of tokens locked in disputes.\\n    /// @return stakedInCourt The amount of tokens staked in the specified court including locked tokens and penalty deductions.\\n    /// @return nbCourts The number of courts the juror has directly staked in.\\n    function getJurorBalance(\\n        address _juror,\\n        uint96 _courtID\\n    ) external view returns (uint256 totalStakedPnk, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts);\\n\\n    /// @notice Gets the court identifiers where a specific `_juror` has staked.\\n    /// @param _juror The address of the juror.\\n    function getJurorCourtIDs(address _juror) external view returns (uint96[] memory);\\n\\n    /// @notice Checks if the juror is staked in any court.\\n    /// @param _juror The address of the juror.\\n    /// @return Whether the juror is staked or not.\\n    function isJurorStaked(address _juror) external view returns (bool);\\n\\n    /// @notice Checks if the juror has any leftover PNK in the contract.\\n    /// @param _juror The address of the juror.\\n    /// @return Whether the juror has leftover PNK.\\n    function getJurorLeftoverPNK(address _juror) external view returns (uint256);\\n}\\n\",\"keccak256\":\"0x3eeff4281ddf3c731c6503094bbbcc80d8015e3a60a27c8cadadfffdf1bf5437\",\"license\":\"MIT\"},\"src/arbitration/university/ISortitionModuleUniversity.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\npragma solidity ^0.8.24;\\n\\nimport {ISortitionModule} from \\\"../interfaces/ISortitionModule.sol\\\";\\n\\ninterface ISortitionModuleUniversity is ISortitionModule {\\n    function setTransientJuror(address _juror) external;\\n}\\n\",\"keccak256\":\"0x57478726f4dd824eca06d8b5349395b5b37756f7988d3fffb6fdae4d0f4164ee\",\"license\":\"MIT\"},\"src/arbitration/university/KlerosCoreUniversity.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\nimport {IArbitrableV2, IArbitratorV2} from \\\"../interfaces/IArbitratorV2.sol\\\";\\nimport {IDisputeKit} from \\\"../interfaces/IDisputeKit.sol\\\";\\nimport {ISortitionModuleUniversity} from \\\"./ISortitionModuleUniversity.sol\\\";\\nimport {SafeERC20, IERC20} from \\\"../../libraries/SafeERC20.sol\\\";\\nimport {UUPSProxiable} from \\\"../../proxy/UUPSProxiable.sol\\\";\\nimport {Initializable} from \\\"../../proxy/Initializable.sol\\\";\\nimport \\\"../../libraries/Constants.sol\\\";\\n\\n/// @title KlerosCoreUniversity\\n/// @notice Core arbitrator contract for educational purposes.\\ncontract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {\\n    using SafeERC20 for IERC20;\\n\\n    string public constant override version = \\\"2.0.0\\\";\\n\\n    // ************************************* //\\n    // *         Enums / Structs           * //\\n    // ************************************* //\\n\\n    enum Period {\\n        evidence, // Evidence can be submitted. This is also when drawing has to take place.\\n        commit, // Jurors commit a hashed vote. This is skipped for courts without hidden votes.\\n        vote, // Jurors reveal/cast their vote depending on whether the court has hidden votes or not.\\n        appeal, // The dispute can be appealed.\\n        execution // Tokens are redistributed and the ruling is executed.\\n    }\\n\\n    struct Court {\\n        uint96 parent; // The parent court.\\n        bool hiddenVotes; // Whether to use commit and reveal or not.\\n        uint256[] children; // List of child courts.\\n        uint256 minStake; // Minimum PNKs needed to stake in the court.\\n        uint256 alpha; // Basis point of PNKs that are lost when incoherent.\\n        uint256 feeForJuror; // Arbitration fee paid per juror.\\n        uint256 jurorsForCourtJump; // The appeal after the one that reaches this number of jurors will go to the parent court if any.\\n        uint256[4] timesPerPeriod; // The time allotted to each dispute period in the form `timesPerPeriod[period]`.\\n        mapping(uint256 disputeKitId => bool) supportedDisputeKits; // True if DK with this ID is supported by the court. Note that each court must support classic dispute kit.\\n        uint256[10] __gap; // Reserved slots for future upgrades.\\n    }\\n\\n    struct Dispute {\\n        uint96 courtID; // The ID of the court the dispute is in.\\n        IArbitrableV2 arbitrated; // The arbitrable contract.\\n        Period period; // The current period of the dispute.\\n        bool ruled; // True if the ruling has been executed, false otherwise.\\n        uint256 lastPeriodChange; // The last time the period was changed.\\n        Round[] rounds;\\n        uint256[10] __gap; // Reserved slots for future upgrades.\\n    }\\n\\n    struct Round {\\n        uint256 disputeKitID; // Index of the dispute kit in the array.\\n        uint256 pnkAtStakePerJuror; // The amount of PNKs at stake for each juror in this round.\\n        uint256 totalFeesForJurors; // The total juror fees paid in this round.\\n        uint256 nbVotes; // The total number of votes the dispute can possibly have in the current round. Former votes[_round].length.\\n        uint256 repartitions; // A counter of reward repartitions made in this round.\\n        uint256 pnkPenalties; // The amount of PNKs collected from penalties in this round.\\n        address[] drawnJurors; // Addresses of the jurors that were drawn in this round.\\n        uint96[] drawnJurorFromCourtIDs; // The courtIDs where the juror was drawn from, possibly their stake in a subcourt.\\n        uint256 sumFeeRewardPaid; // Total sum of arbitration fees paid to coherent jurors as a reward in this round.\\n        uint256 sumPnkRewardPaid; // Total sum of PNK paid to coherent jurors as a reward in this round.\\n        IERC20 feeToken; // The token used for paying fees in this round.\\n        uint256 drawIterations; // The number of iterations passed drawing the jurors for this round.\\n        uint256[10] __gap; // Reserved slots for future upgrades.\\n    }\\n\\n    // Workaround \\\"stack too deep\\\" errors\\n    struct ExecuteParams {\\n        uint256 disputeID; // The ID of the dispute to execute.\\n        uint256 round; // The round to execute.\\n        uint256 coherentCount; // The number of coherent votes in the round.\\n        uint256 numberOfVotesInRound; // The number of votes in the round.\\n        uint256 feePerJurorInRound; // The fee per juror in the round.\\n        uint256 pnkAtStakePerJurorInRound; // The amount of PNKs at stake for each juror in the round.\\n        uint256 pnkPenaltiesInRound; // The amount of PNKs collected from penalties in the round.\\n        uint256 repartition; // The index of the repartition to execute.\\n    }\\n\\n    struct CurrencyRate {\\n        bool feePaymentAccepted;\\n        uint64 rateInEth;\\n        uint8 rateDecimals;\\n    }\\n\\n    // ************************************* //\\n    // *             Storage               * //\\n    // ************************************* //\\n\\n    uint256 private constant NON_PAYABLE_AMOUNT = (2 ** 256 - 2) / 2; // An amount higher than the supply of ETH.\\n\\n    address public owner; // The owner of the contract.\\n    address public instructor; // The instructor who is allowed to choose the jurors.\\n    IERC20 public pinakion; // The Pinakion token contract.\\n    address public jurorProsecutionModule; // The module for juror's prosecution.\\n    ISortitionModuleUniversity public sortitionModule; // Sortition module for drawing.\\n    Court[] public courts; // The courts.\\n    IDisputeKit[] public disputeKits; // Array of dispute kits.\\n    Dispute[] public disputes; // The disputes.\\n    mapping(IERC20 => CurrencyRate) public currencyRates; // The price of each token in ETH.\\n\\n    // ************************************* //\\n    // *              Events               * //\\n    // ************************************* //\\n\\n    event NewPeriod(uint256 indexed _disputeID, Period _period);\\n    event AppealPossible(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);\\n    event AppealDecision(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);\\n    event Draw(address indexed _address, uint256 indexed _disputeID, uint256 _roundID, uint256 _voteID);\\n    event CourtCreated(\\n        uint96 indexed _courtID,\\n        uint96 indexed _parent,\\n        bool _hiddenVotes,\\n        uint256 _minStake,\\n        uint256 _alpha,\\n        uint256 _feeForJuror,\\n        uint256 _jurorsForCourtJump,\\n        uint256[4] _timesPerPeriod,\\n        uint256[] _supportedDisputeKits\\n    );\\n    event CourtModified(\\n        uint96 indexed _courtID,\\n        bool _hiddenVotes,\\n        uint256 _minStake,\\n        uint256 _alpha,\\n        uint256 _feeForJuror,\\n        uint256 _jurorsForCourtJump,\\n        uint256[4] _timesPerPeriod\\n    );\\n    event DisputeKitCreated(uint256 indexed _disputeKitID, IDisputeKit indexed _disputeKitAddress);\\n    event DisputeKitEnabled(uint96 indexed _courtID, uint256 indexed _disputeKitID, bool indexed _enable);\\n    event CourtJump(\\n        uint256 indexed _disputeID,\\n        uint256 indexed _roundID,\\n        uint96 indexed _fromCourtID,\\n        uint96 _toCourtID\\n    );\\n    event DisputeKitJump(\\n        uint256 indexed _disputeID,\\n        uint256 indexed _roundID,\\n        uint256 indexed _fromDisputeKitID,\\n        uint256 _toDisputeKitID\\n    );\\n    event JurorRewardPenalty(\\n        address indexed _account,\\n        uint256 indexed _disputeID,\\n        uint256 indexed _roundID,\\n        uint256 _degreeOfCoherencyPnk,\\n        uint256 _degreeOfCoherencyFee,\\n        int256 _amountPnk,\\n        int256 _amountFee,\\n        IERC20 _feeToken\\n    );\\n    event LeftoverRewardSent(\\n        uint256 indexed _disputeID,\\n        uint256 indexed _roundID,\\n        uint256 _amountPnk,\\n        uint256 _amountFee,\\n        IERC20 _feeToken\\n    );\\n\\n    // ************************************* //\\n    // *        Function Modifiers         * //\\n    // ************************************* //\\n\\n    modifier onlyByOwner() {\\n        if (owner != msg.sender) revert OwnerOnly();\\n        _;\\n    }\\n\\n    modifier onlyByInstructor() {\\n        if (instructor != msg.sender) revert InstructorOnly();\\n        _;\\n    }\\n\\n    modifier onlyByOwnerOrInstructor() {\\n        if (msg.sender != owner && msg.sender != instructor) revert OwnerOrInstructorOnly();\\n        _;\\n    }\\n\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    /// @custom:oz-upgrades-unsafe-allow constructor\\n    constructor() {\\n        _disableInitializers();\\n    }\\n\\n    /// @notice Initializer (constructor equivalent for upgradable contracts).\\n    /// @param _owner The owner's address.\\n    /// @param _instructor The address of the instructor.\\n    /// @param _pinakion The address of the token contract.\\n    /// @param _jurorProsecutionModule The address of the juror prosecution module.\\n    /// @param _disputeKit The address of the default dispute kit.\\n    /// @param _hiddenVotes The `hiddenVotes` property value of the general court.\\n    /// @param _courtParameters Numeric parameters of General court (minStake, alpha, feeForJuror and jurorsForCourtJump respectively).\\n    /// @param _timesPerPeriod The `timesPerPeriod` property value of the general court.\\n    /// @param _sortitionModuleAddress The sortition module responsible for sortition of the jurors.\\n    function initialize(\\n        address _owner,\\n        address _instructor,\\n        IERC20 _pinakion,\\n        address _jurorProsecutionModule,\\n        IDisputeKit _disputeKit,\\n        bool _hiddenVotes,\\n        uint256[4] memory _courtParameters,\\n        uint256[4] memory _timesPerPeriod,\\n        ISortitionModuleUniversity _sortitionModuleAddress\\n    ) external initializer {\\n        owner = _owner;\\n        instructor = _instructor;\\n        pinakion = _pinakion;\\n        jurorProsecutionModule = _jurorProsecutionModule;\\n        sortitionModule = _sortitionModuleAddress;\\n\\n        // NULL_DISPUTE_KIT: an empty element at index 0 to indicate when a dispute kit is not supported.\\n        disputeKits.push();\\n\\n        // DISPUTE_KIT_CLASSIC\\n        disputeKits.push(_disputeKit);\\n\\n        emit DisputeKitCreated(DISPUTE_KIT_CLASSIC, _disputeKit);\\n\\n        // FORKING_COURT\\n        // TODO: Fill the properties for the Forking court, emit CourtCreated.\\n        courts.push();\\n\\n        // GENERAL_COURT\\n        Court storage court = courts.push();\\n        court.parent = FORKING_COURT;\\n        court.children = new uint256[](0);\\n        court.hiddenVotes = _hiddenVotes;\\n        court.minStake = _courtParameters[0];\\n        court.alpha = _courtParameters[1];\\n        court.feeForJuror = _courtParameters[2];\\n        court.jurorsForCourtJump = _courtParameters[3];\\n        court.timesPerPeriod = _timesPerPeriod;\\n\\n        emit CourtCreated(\\n            GENERAL_COURT,\\n            court.parent,\\n            _hiddenVotes,\\n            _courtParameters[0],\\n            _courtParameters[1],\\n            _courtParameters[2],\\n            _courtParameters[3],\\n            _timesPerPeriod,\\n            new uint256[](0)\\n        );\\n        _enableDisputeKit(GENERAL_COURT, DISPUTE_KIT_CLASSIC, true);\\n    }\\n\\n    // ************************************* //\\n    // *             Governance            * //\\n    // ************************************* //\\n\\n    /* @dev Access Control to perform implementation upgrades (UUPS Proxiable)\\n     * @dev Only the owner can perform upgrades (`onlyByOwner`)\\n     */\\n    function _authorizeUpgrade(address) internal view override onlyByOwner {\\n        // NOP\\n    }\\n\\n    /// @notice Allows the owner to call anything on behalf of the contract.\\n    /// @param _destination The destination of the call.\\n    /// @param _amount The value sent with the call.\\n    /// @param _data The data sent with the call.\\n    function executeOwnerProposal(address _destination, uint256 _amount, bytes memory _data) external onlyByOwner {\\n        (bool success, ) = _destination.call{value: _amount}(_data);\\n        if (!success) revert UnsuccessfulCall();\\n    }\\n\\n    /// @notice Changes the `owner` storage variable.\\n    /// @param _owner The new value for the `owner` storage variable.\\n    function changeOwner(address payable _owner) external onlyByOwner {\\n        owner = _owner;\\n    }\\n\\n    /// @notice Changes the `instructor` storage variable.\\n    /// @param _instructor The new value for the `instructor` storage variable.\\n    function changeInstructor(address _instructor) external onlyByOwnerOrInstructor {\\n        instructor = _instructor;\\n    }\\n\\n    /// @notice Changes the `pinakion` storage variable.\\n    /// @param _pinakion The new value for the `pinakion` storage variable.\\n    function changePinakion(IERC20 _pinakion) external onlyByOwner {\\n        pinakion = _pinakion;\\n    }\\n\\n    /// @notice Changes the `jurorProsecutionModule` storage variable.\\n    /// @param _jurorProsecutionModule The new value for the `jurorProsecutionModule` storage variable.\\n    function changeJurorProsecutionModule(address _jurorProsecutionModule) external onlyByOwner {\\n        jurorProsecutionModule = _jurorProsecutionModule;\\n    }\\n\\n    /// @notice Changes the `_sortitionModule` storage variable.\\n    /// Note that the new module should be initialized for all courts.\\n    /// @param _sortitionModule The new value for the `sortitionModule` storage variable.\\n    function changeSortitionModule(ISortitionModuleUniversity _sortitionModule) external onlyByOwner {\\n        sortitionModule = _sortitionModule;\\n    }\\n\\n    /// @notice Add a new supported dispute kit module to the court.\\n    /// @param _disputeKitAddress The address of the dispute kit contract.\\n    function addNewDisputeKit(IDisputeKit _disputeKitAddress) external onlyByOwner {\\n        uint256 disputeKitID = disputeKits.length;\\n        disputeKits.push(_disputeKitAddress);\\n        emit DisputeKitCreated(disputeKitID, _disputeKitAddress);\\n    }\\n\\n    /// @notice Creates a court under a specified parent court.\\n    /// @param _parent The `parent` property value of the court.\\n    /// @param _hiddenVotes The `hiddenVotes` property value of the court.\\n    /// @param _minStake The `minStake` property value of the court.\\n    /// @param _alpha The `alpha` property value of the court.\\n    /// @param _feeForJuror The `feeForJuror` property value of the court.\\n    /// @param _jurorsForCourtJump The `jurorsForCourtJump` property value of the court.\\n    /// @param _timesPerPeriod The `timesPerPeriod` property value of the court.\\n    /// @param _supportedDisputeKits Indexes of dispute kits that this court will support.\\n    function createCourt(\\n        uint96 _parent,\\n        bool _hiddenVotes,\\n        uint256 _minStake,\\n        uint256 _alpha,\\n        uint256 _feeForJuror,\\n        uint256 _jurorsForCourtJump,\\n        uint256[4] memory _timesPerPeriod,\\n        uint256[] memory _supportedDisputeKits\\n    ) external onlyByOwner {\\n        if (courts[_parent].minStake > _minStake) revert MinStakeLowerThanParentCourt();\\n        if (_supportedDisputeKits.length == 0) revert UnsupportedDisputeKit();\\n        if (_parent == FORKING_COURT) revert InvalidForkingCourtAsParent();\\n\\n        uint256 courtID = courts.length;\\n        Court storage court = courts.push();\\n\\n        for (uint256 i = 0; i < _supportedDisputeKits.length; i++) {\\n            if (_supportedDisputeKits[i] == 0 || _supportedDisputeKits[i] >= disputeKits.length) {\\n                revert WrongDisputeKitIndex();\\n            }\\n            court.supportedDisputeKits[_supportedDisputeKits[i]] = true;\\n        }\\n        // Check that Classic DK support was added.\\n        if (!court.supportedDisputeKits[DISPUTE_KIT_CLASSIC]) revert MustSupportDisputeKitClassic();\\n\\n        court.parent = _parent;\\n        court.children = new uint256[](0);\\n        court.hiddenVotes = _hiddenVotes;\\n        court.minStake = _minStake;\\n        court.alpha = _alpha;\\n        court.feeForJuror = _feeForJuror;\\n        court.jurorsForCourtJump = _jurorsForCourtJump;\\n        court.timesPerPeriod = _timesPerPeriod;\\n\\n        // Update the parent.\\n        courts[_parent].children.push(courtID);\\n        emit CourtCreated(\\n            uint96(courtID),\\n            _parent,\\n            _hiddenVotes,\\n            _minStake,\\n            _alpha,\\n            _feeForJuror,\\n            _jurorsForCourtJump,\\n            _timesPerPeriod,\\n            _supportedDisputeKits\\n        );\\n    }\\n\\n    function changeCourtParameters(\\n        uint96 _courtID,\\n        bool _hiddenVotes,\\n        uint256 _minStake,\\n        uint256 _alpha,\\n        uint256 _feeForJuror,\\n        uint256 _jurorsForCourtJump,\\n        uint256[4] memory _timesPerPeriod\\n    ) external onlyByOwner {\\n        Court storage court = courts[_courtID];\\n        if (_courtID != GENERAL_COURT && courts[court.parent].minStake > _minStake) {\\n            revert MinStakeLowerThanParentCourt();\\n        }\\n        for (uint256 i = 0; i < court.children.length; i++) {\\n            if (courts[court.children[i]].minStake < _minStake) {\\n                revert MinStakeLowerThanParentCourt();\\n            }\\n        }\\n        court.minStake = _minStake;\\n        court.hiddenVotes = _hiddenVotes;\\n        court.alpha = _alpha;\\n        court.feeForJuror = _feeForJuror;\\n        court.jurorsForCourtJump = _jurorsForCourtJump;\\n        court.timesPerPeriod = _timesPerPeriod;\\n        emit CourtModified(\\n            _courtID,\\n            _hiddenVotes,\\n            _minStake,\\n            _alpha,\\n            _feeForJuror,\\n            _jurorsForCourtJump,\\n            _timesPerPeriod\\n        );\\n    }\\n\\n    /// @notice Adds/removes court's support for specified dispute kits.\\n    /// @param _courtID The ID of the court.\\n    /// @param _disputeKitIDs The IDs of dispute kits which support should be added/removed.\\n    /// @param _enable Whether add or remove the dispute kits from the court.\\n    function enableDisputeKits(uint96 _courtID, uint256[] memory _disputeKitIDs, bool _enable) external onlyByOwner {\\n        for (uint256 i = 0; i < _disputeKitIDs.length; i++) {\\n            if (_enable) {\\n                if (_disputeKitIDs[i] == 0 || _disputeKitIDs[i] >= disputeKits.length) {\\n                    revert WrongDisputeKitIndex();\\n                }\\n                _enableDisputeKit(_courtID, _disputeKitIDs[i], true);\\n            } else {\\n                // Classic dispute kit must be supported by all courts.\\n                if (_disputeKitIDs[i] == DISPUTE_KIT_CLASSIC) {\\n                    revert CannotDisableClassicDK();\\n                }\\n                _enableDisputeKit(_courtID, _disputeKitIDs[i], false);\\n            }\\n        }\\n    }\\n\\n    /// @notice Changes the supported fee tokens.\\n    /// @param _feeToken The fee token.\\n    /// @param _accepted Whether the token is supported or not as a method of fee payment.\\n    function changeAcceptedFeeTokens(IERC20 _feeToken, bool _accepted) external onlyByOwner {\\n        currencyRates[_feeToken].feePaymentAccepted = _accepted;\\n        emit AcceptedFeeToken(_feeToken, _accepted);\\n    }\\n\\n    /// @notice Changes the currency rate of a fee token.\\n    /// @param _feeToken The fee token.\\n    /// @param _rateInEth The new rate of the fee token in ETH.\\n    /// @param _rateDecimals The new decimals of the fee token rate.\\n    function changeCurrencyRates(IERC20 _feeToken, uint64 _rateInEth, uint8 _rateDecimals) external onlyByOwner {\\n        currencyRates[_feeToken].rateInEth = _rateInEth;\\n        currencyRates[_feeToken].rateDecimals = _rateDecimals;\\n        emit NewCurrencyRate(_feeToken, _rateInEth, _rateDecimals);\\n    }\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @notice Sets the caller's stake in a court.\\n    /// @param _courtID The ID of the court.\\n    /// @param _newStake The new stake.\\n    /// Note that the existing delayed stake will be nullified as non-relevant.\\n    function setStake(uint96 _courtID, uint256 _newStake) external {\\n        _setStake(msg.sender, _courtID, _newStake, false, OnError.Revert);\\n    }\\n\\n    /// @notice Sets the stake of a specified account in a court, typically to apply a delayed stake or unstake inactive jurors.\\n    /// @param _account The account whose stake is being set.\\n    /// @param _courtID The ID of the court.\\n    /// @param _newStake The new stake.\\n    function setStakeBySortitionModule(address _account, uint96 _courtID, uint256 _newStake) external {\\n        if (msg.sender != address(sortitionModule)) revert SortitionModuleOnly();\\n        _setStake(_account, _courtID, _newStake, true, OnError.Return);\\n    }\\n\\n    /// @notice Transfers PNK to the juror by SortitionModule.\\n    /// @param _account The account of the juror whose PNK to transfer.\\n    /// @param _amount The amount to transfer.\\n    function transferBySortitionModule(address _account, uint256 _amount) external {\\n        if (msg.sender != address(sortitionModule)) revert SortitionModuleOnly();\\n        // Note eligibility is checked in SortitionModule.\\n        pinakion.safeTransfer(_account, _amount);\\n    }\\n\\n    /// @inheritdoc IArbitratorV2\\n    function createDispute(\\n        uint256 _numberOfChoices,\\n        bytes memory _extraData\\n    ) external payable override returns (uint256 disputeID) {\\n        if (msg.value < arbitrationCost(_extraData)) revert ArbitrationFeesNotEnough();\\n\\n        return _createDispute(_numberOfChoices, _extraData, NATIVE_CURRENCY, msg.value);\\n    }\\n\\n    /// @inheritdoc IArbitratorV2\\n    function createDispute(\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData,\\n        IERC20 _feeToken,\\n        uint256 _feeAmount\\n    ) external override returns (uint256 disputeID) {\\n        if (!currencyRates[_feeToken].feePaymentAccepted) revert TokenNotAccepted();\\n        if (_feeAmount < arbitrationCost(_extraData, _feeToken)) revert ArbitrationFeesNotEnough();\\n\\n        if (!_feeToken.safeTransferFrom(msg.sender, address(this), _feeAmount)) revert TransferFailed();\\n        return _createDispute(_numberOfChoices, _extraData, _feeToken, _feeAmount);\\n    }\\n\\n    function _createDispute(\\n        uint256 _numberOfChoices,\\n        bytes memory _extraData,\\n        IERC20 _feeToken,\\n        uint256 _feeAmount\\n    ) internal returns (uint256 disputeID) {\\n        (uint96 courtID, , uint256 disputeKitID) = _extraDataToCourtIDMinJurorsDisputeKit(_extraData);\\n        if (!courts[courtID].supportedDisputeKits[disputeKitID]) revert DisputeKitNotSupportedByCourt();\\n\\n        disputeID = disputes.length;\\n        Dispute storage dispute = disputes.push();\\n        dispute.courtID = courtID;\\n        dispute.arbitrated = IArbitrableV2(msg.sender);\\n        dispute.lastPeriodChange = block.timestamp;\\n\\n        IDisputeKit disputeKit = disputeKits[disputeKitID];\\n        Court storage court = courts[courtID];\\n        Round storage round = dispute.rounds.push();\\n\\n        // Obtain the feeForJuror in the same currency as the _feeAmount\\n        uint256 feeForJuror = (_feeToken == NATIVE_CURRENCY)\\n            ? court.feeForJuror\\n            : convertEthToTokenAmount(_feeToken, court.feeForJuror);\\n        round.nbVotes = _feeAmount / feeForJuror;\\n        round.disputeKitID = disputeKitID;\\n        round.pnkAtStakePerJuror = (court.minStake * court.alpha) / ONE_BASIS_POINT;\\n        round.totalFeesForJurors = _feeAmount;\\n        round.feeToken = IERC20(_feeToken);\\n\\n        sortitionModule.createDisputeHook(disputeID, 0); // Default round ID.\\n\\n        disputeKit.createDispute(disputeID, _numberOfChoices, _extraData, round.nbVotes);\\n        emit DisputeCreation(disputeID, IArbitrableV2(msg.sender));\\n    }\\n\\n    /// @notice Passes the period of a specified dispute.\\n    /// @param _disputeID The ID of the dispute.\\n    function passPeriod(uint256 _disputeID) external {\\n        Dispute storage dispute = disputes[_disputeID];\\n        Court storage court = courts[dispute.courtID];\\n\\n        uint256 currentRound = dispute.rounds.length - 1;\\n        Round storage round = dispute.rounds[currentRound];\\n        if (dispute.period == Period.evidence) {\\n            if (\\n                currentRound == 0 &&\\n                block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)]\\n            ) {\\n                revert EvidenceNotPassedAndNotAppeal();\\n            }\\n            if (round.drawnJurors.length != round.nbVotes) revert DisputeStillDrawing();\\n            dispute.period = court.hiddenVotes ? Period.commit : Period.vote;\\n        } else if (dispute.period == Period.commit) {\\n            if (\\n                block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)] &&\\n                !disputeKits[round.disputeKitID].areCommitsAllCast(_disputeID)\\n            ) {\\n                revert CommitPeriodNotPassed();\\n            }\\n            dispute.period = Period.vote;\\n        } else if (dispute.period == Period.vote) {\\n            if (\\n                block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)] &&\\n                !disputeKits[round.disputeKitID].areVotesAllCast(_disputeID)\\n            ) {\\n                revert VotePeriodNotPassed();\\n            }\\n            dispute.period = Period.appeal;\\n            emit AppealPossible(_disputeID, dispute.arbitrated);\\n        } else if (dispute.period == Period.appeal) {\\n            if (\\n                block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)] &&\\n                !disputeKits[round.disputeKitID].isAppealFunded(_disputeID)\\n            ) {\\n                revert AppealPeriodNotPassed();\\n            }\\n            dispute.period = Period.execution;\\n        } else if (dispute.period == Period.execution) {\\n            revert DisputePeriodIsFinal();\\n        }\\n\\n        dispute.lastPeriodChange = block.timestamp;\\n        emit NewPeriod(_disputeID, dispute.period);\\n    }\\n\\n    /// @notice Draws one juror for the dispute until the number votes paid for is reached.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _juror The address of the juror to draw.\\n    function draw(uint256 _disputeID, address _juror) external onlyByOwnerOrInstructor {\\n        Dispute storage dispute = disputes[_disputeID];\\n        uint256 currentRound = dispute.rounds.length - 1;\\n        Round storage round = dispute.rounds[currentRound];\\n        if (dispute.period != Period.evidence) revert NotEvidencePeriod();\\n        if (round.drawnJurors.length >= round.nbVotes) revert AllJurorsDrawn();\\n\\n        sortitionModule.setTransientJuror(_juror);\\n        {\\n            IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n            uint256 iteration = round.drawIterations + 1;\\n            (address drawnAddress, uint96 fromSubcourtID) = disputeKit.draw(_disputeID, iteration);\\n            if (drawnAddress == address(0)) {\\n                revert NoJurorDrawn();\\n            }\\n            sortitionModule.lockStake(drawnAddress, round.pnkAtStakePerJuror);\\n            emit Draw(drawnAddress, _disputeID, currentRound, round.drawnJurors.length);\\n            round.drawnJurors.push(drawnAddress);\\n            round.drawnJurorFromCourtIDs.push(fromSubcourtID != 0 ? fromSubcourtID : dispute.courtID);\\n            if (round.drawnJurors.length == round.nbVotes) {\\n                sortitionModule.postDrawHook(_disputeID, currentRound);\\n            }\\n            round.drawIterations = iteration;\\n        }\\n        sortitionModule.setTransientJuror(address(0));\\n    }\\n\\n    /// @notice Appeals the ruling of a specified dispute.\\n    /// @dev Access restricted to the Dispute Kit for this `disputeID`.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _numberOfChoices Number of choices for the dispute. Can be required during court jump.\\n    /// @param _extraData Extradata for the dispute. Can be required during court jump.\\n    function appeal(uint256 _disputeID, uint256 _numberOfChoices, bytes memory _extraData) external payable {\\n        if (msg.value < appealCost(_disputeID)) revert AppealFeesNotEnough();\\n\\n        Dispute storage dispute = disputes[_disputeID];\\n        if (dispute.period != Period.appeal) revert DisputeNotAppealable();\\n\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        if (msg.sender != address(disputeKits[round.disputeKitID])) revert DisputeKitOnly();\\n\\n        uint96 newCourtID = dispute.courtID;\\n        uint256 newDisputeKitID = round.disputeKitID;\\n\\n        // Warning: the extra round must be created before calling disputeKit.createDispute()\\n        Round storage extraRound = dispute.rounds.push();\\n\\n        if (round.nbVotes >= courts[newCourtID].jurorsForCourtJump) {\\n            // Jump to parent court.\\n            newCourtID = courts[newCourtID].parent;\\n\\n            if (!courts[newCourtID].supportedDisputeKits[newDisputeKitID]) {\\n                // Switch to classic dispute kit if parent court doesn't support the current one.\\n                newDisputeKitID = DISPUTE_KIT_CLASSIC;\\n            }\\n\\n            if (newCourtID != dispute.courtID) {\\n                emit CourtJump(_disputeID, dispute.rounds.length - 1, dispute.courtID, newCourtID);\\n            }\\n        }\\n\\n        dispute.courtID = newCourtID;\\n        dispute.period = Period.evidence;\\n        dispute.lastPeriodChange = block.timestamp;\\n\\n        Court storage court = courts[newCourtID];\\n        extraRound.nbVotes = msg.value / court.feeForJuror; // As many votes that can be afforded by the provided funds.\\n        extraRound.pnkAtStakePerJuror = (court.minStake * court.alpha) / ONE_BASIS_POINT;\\n        extraRound.totalFeesForJurors = msg.value;\\n        extraRound.disputeKitID = newDisputeKitID;\\n\\n        sortitionModule.createDisputeHook(_disputeID, dispute.rounds.length - 1);\\n\\n        // Dispute kit was changed, so create a dispute in the new DK contract.\\n        if (extraRound.disputeKitID != round.disputeKitID) {\\n            emit DisputeKitJump(_disputeID, dispute.rounds.length - 1, round.disputeKitID, extraRound.disputeKitID);\\n            disputeKits[extraRound.disputeKitID].createDispute(\\n                _disputeID,\\n                _numberOfChoices,\\n                _extraData,\\n                extraRound.nbVotes\\n            );\\n        }\\n\\n        emit AppealDecision(_disputeID, dispute.arbitrated);\\n        emit NewPeriod(_disputeID, Period.evidence);\\n    }\\n\\n    /// @notice Distribute the PNKs at stake and the dispute fees for the specific round of the dispute. Can be called in parts.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _round The appeal round.\\n    /// @param _iterations The number of iterations to run.\\n    function execute(uint256 _disputeID, uint256 _round, uint256 _iterations) external {\\n        Round storage round;\\n        {\\n            Dispute storage dispute = disputes[_disputeID];\\n            if (dispute.period != Period.execution) revert NotExecutionPeriod();\\n\\n            round = dispute.rounds[_round];\\n        } // stack too deep workaround\\n\\n        uint256 start = round.repartitions;\\n        uint256 end = round.repartitions + _iterations;\\n\\n        uint256 pnkPenaltiesInRound = round.pnkPenalties; // Keep in memory to save gas.\\n        uint256 numberOfVotesInRound = round.drawnJurors.length;\\n        uint256 feePerJurorInRound = round.totalFeesForJurors / numberOfVotesInRound;\\n        uint256 pnkAtStakePerJurorInRound = round.pnkAtStakePerJuror;\\n        uint256 coherentCount;\\n        {\\n            IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n            coherentCount = disputeKit.getCoherentCount(_disputeID, _round); // Total number of jurors that are eligible to a reward in this round.\\n        } // stack too deep workaround\\n\\n        if (coherentCount == 0) {\\n            // We loop over the votes once as there are no rewards because it is not a tie and no one in this round is coherent with the final outcome.\\n            if (end > numberOfVotesInRound) end = numberOfVotesInRound;\\n        } else {\\n            // We loop over the votes twice, first to collect the PNK penalties, and second to distribute them as rewards along with arbitration fees.\\n            if (end > numberOfVotesInRound * 2) end = numberOfVotesInRound * 2;\\n        }\\n        round.repartitions = end;\\n\\n        for (uint256 i = start; i < end; i++) {\\n            if (i < numberOfVotesInRound) {\\n                pnkPenaltiesInRound = _executePenalties(\\n                    ExecuteParams({\\n                        disputeID: _disputeID,\\n                        round: _round,\\n                        coherentCount: coherentCount,\\n                        numberOfVotesInRound: numberOfVotesInRound,\\n                        feePerJurorInRound: feePerJurorInRound,\\n                        pnkAtStakePerJurorInRound: pnkAtStakePerJurorInRound,\\n                        pnkPenaltiesInRound: pnkPenaltiesInRound,\\n                        repartition: i\\n                    })\\n                );\\n            } else {\\n                _executeRewards(\\n                    ExecuteParams({\\n                        disputeID: _disputeID,\\n                        round: _round,\\n                        coherentCount: coherentCount,\\n                        numberOfVotesInRound: numberOfVotesInRound,\\n                        feePerJurorInRound: feePerJurorInRound,\\n                        pnkAtStakePerJurorInRound: pnkAtStakePerJurorInRound,\\n                        pnkPenaltiesInRound: pnkPenaltiesInRound,\\n                        repartition: i\\n                    })\\n                );\\n            }\\n        }\\n        if (round.pnkPenalties != pnkPenaltiesInRound) {\\n            round.pnkPenalties = pnkPenaltiesInRound; // Reentrancy risk: breaks Check-Effect-Interact\\n        }\\n    }\\n\\n    /// @notice Distribute the PNKs at stake and the dispute fees for the specific round of the dispute, penalties only.\\n    /// @param _params The parameters for the execution, see `ExecuteParams`.\\n    /// @return pnkPenaltiesInRoundCache The updated penalties in round cache.\\n    function _executePenalties(ExecuteParams memory _params) internal returns (uint256) {\\n        Dispute storage dispute = disputes[_params.disputeID];\\n        Round storage round = dispute.rounds[_params.round];\\n        IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n\\n        // [0, 1] value that determines how coherent the juror was in this round, in basis points.\\n        uint256 coherence = disputeKit.getDegreeOfCoherencePenalty(\\n            _params.disputeID,\\n            _params.round,\\n            _params.repartition,\\n            _params.feePerJurorInRound,\\n            _params.pnkAtStakePerJurorInRound\\n        );\\n\\n        // Guard against degree exceeding 1, though it should be ensured by the dispute kit.\\n        if (coherence > ONE_BASIS_POINT) {\\n            coherence = ONE_BASIS_POINT;\\n        }\\n\\n        // Fully coherent jurors won't be penalized.\\n        uint256 penalty = (round.pnkAtStakePerJuror * (ONE_BASIS_POINT - coherence)) / ONE_BASIS_POINT;\\n\\n        // Unlock the PNKs affected by the penalty\\n        address account = round.drawnJurors[_params.repartition];\\n        sortitionModule.unlockStake(account, penalty);\\n\\n        // Apply the penalty to the staked PNKs.\\n        uint96 penalizedInCourtID = round.drawnJurorFromCourtIDs[_params.repartition];\\n        (uint256 pnkBalance, uint256 newCourtStake, uint256 availablePenalty) = sortitionModule.setStakePenalty(\\n            account,\\n            penalizedInCourtID,\\n            penalty\\n        );\\n        _params.pnkPenaltiesInRound += availablePenalty;\\n        emit JurorRewardPenalty(\\n            account,\\n            _params.disputeID,\\n            _params.round,\\n            coherence,\\n            coherence,\\n            -int256(availablePenalty),\\n            0,\\n            round.feeToken\\n        );\\n\\n        if (pnkBalance == 0 || !disputeKit.isVoteActive(_params.disputeID, _params.round, _params.repartition)) {\\n            // The juror is inactive or their balance is can't cover penalties anymore, unstake them from all courts.\\n            sortitionModule.forcedUnstakeAllCourts(account);\\n        } else if (newCourtStake < courts[penalizedInCourtID].minStake) {\\n            // The juror's balance fell below the court minStake, unstake them from the court.\\n            sortitionModule.forcedUnstake(account, penalizedInCourtID);\\n        }\\n\\n        if (_params.repartition == _params.numberOfVotesInRound - 1 && _params.coherentCount == 0) {\\n            // No one was coherent, send the rewards to the owner.\\n            if (round.feeToken == NATIVE_CURRENCY) {\\n                // The dispute fees were paid in ETH\\n                payable(owner).send(round.totalFeesForJurors);\\n            } else {\\n                // The dispute fees were paid in ERC20\\n                round.feeToken.safeTransfer(owner, round.totalFeesForJurors);\\n            }\\n            pinakion.safeTransfer(owner, _params.pnkPenaltiesInRound);\\n            emit LeftoverRewardSent(\\n                _params.disputeID,\\n                _params.round,\\n                _params.pnkPenaltiesInRound,\\n                round.totalFeesForJurors,\\n                round.feeToken\\n            );\\n        }\\n        return _params.pnkPenaltiesInRound;\\n    }\\n\\n    /// @notice Distribute the PNKs at stake and the dispute fees for the specific round of the dispute, rewards only.\\n    /// @param _params The parameters for the execution, see `ExecuteParams`.\\n    function _executeRewards(ExecuteParams memory _params) internal {\\n        Dispute storage dispute = disputes[_params.disputeID];\\n        Round storage round = dispute.rounds[_params.round];\\n        IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n\\n        // [0, 1] value that determines how coherent the juror was in this round, in basis points.\\n        (uint256 pnkCoherence, uint256 feeCoherence) = disputeKit.getDegreeOfCoherenceReward(\\n            _params.disputeID,\\n            _params.round,\\n            _params.repartition % _params.numberOfVotesInRound,\\n            _params.feePerJurorInRound,\\n            _params.pnkAtStakePerJurorInRound\\n        );\\n\\n        // Guard against degree exceeding 1, though it should be ensured by the dispute kit.\\n        if (pnkCoherence > ONE_BASIS_POINT) {\\n            pnkCoherence = ONE_BASIS_POINT;\\n        }\\n        if (feeCoherence > ONE_BASIS_POINT) {\\n            feeCoherence = ONE_BASIS_POINT;\\n        }\\n\\n        address account = round.drawnJurors[_params.repartition % _params.numberOfVotesInRound];\\n        uint256 pnkLocked = (round.pnkAtStakePerJuror * pnkCoherence) / ONE_BASIS_POINT;\\n\\n        // Release the rest of the PNKs of the juror for this round.\\n        sortitionModule.unlockStake(account, pnkLocked);\\n\\n        // Compute the rewards\\n        uint256 pnkReward = ((_params.pnkPenaltiesInRound / _params.coherentCount) * pnkCoherence) / ONE_BASIS_POINT; /// forge-lint: disable-line(divide-before-multiply)\\n        round.sumPnkRewardPaid += pnkReward;\\n        uint256 feeReward = ((round.totalFeesForJurors / _params.coherentCount) * feeCoherence) / ONE_BASIS_POINT; /// forge-lint: disable-line(divide-before-multiply)\\n        round.sumFeeRewardPaid += feeReward;\\n\\n        // Transfer the fee reward\\n        if (round.feeToken == NATIVE_CURRENCY) {\\n            // The dispute fees were paid in ETH\\n            payable(account).send(feeReward);\\n        } else {\\n            // The dispute fees were paid in ERC20\\n            round.feeToken.safeTransfer(account, feeReward);\\n        }\\n\\n        // Stake the PNK reward if possible, by-passes delayed stakes and other checks usually done by validateStake()\\n        if (!sortitionModule.setStakeReward(account, dispute.courtID, pnkReward)) {\\n            pinakion.safeTransfer(account, pnkReward);\\n        }\\n\\n        emit JurorRewardPenalty(\\n            account,\\n            _params.disputeID,\\n            _params.round,\\n            pnkCoherence,\\n            feeCoherence,\\n            int256(pnkReward),\\n            int256(feeReward),\\n            round.feeToken\\n        );\\n\\n        // Transfer any residual rewards to the owner. It may happen due to partial coherence of the jurors.\\n        if (_params.repartition == _params.numberOfVotesInRound * 2 - 1) {\\n            uint256 leftoverPnkReward = _params.pnkPenaltiesInRound - round.sumPnkRewardPaid;\\n            uint256 leftoverFeeReward = round.totalFeesForJurors - round.sumFeeRewardPaid;\\n            if (leftoverPnkReward != 0 || leftoverFeeReward != 0) {\\n                if (leftoverPnkReward != 0) {\\n                    pinakion.safeTransfer(owner, leftoverPnkReward);\\n                }\\n                if (leftoverFeeReward != 0) {\\n                    if (round.feeToken == NATIVE_CURRENCY) {\\n                        // The dispute fees were paid in ETH\\n                        payable(owner).send(leftoverFeeReward);\\n                    } else {\\n                        // The dispute fees were paid in ERC20\\n                        round.feeToken.safeTransfer(owner, leftoverFeeReward);\\n                    }\\n                }\\n                emit LeftoverRewardSent(\\n                    _params.disputeID,\\n                    _params.round,\\n                    leftoverPnkReward,\\n                    leftoverFeeReward,\\n                    round.feeToken\\n                );\\n            }\\n        }\\n    }\\n\\n    /// @notice Executes a specified dispute's ruling.\\n    /// @param _disputeID The ID of the dispute.\\n    function executeRuling(uint256 _disputeID) external {\\n        Dispute storage dispute = disputes[_disputeID];\\n        if (dispute.period != Period.execution) revert NotExecutionPeriod();\\n        if (dispute.ruled) revert RulingAlreadyExecuted();\\n\\n        (uint256 winningChoice, , ) = currentRuling(_disputeID);\\n        dispute.ruled = true;\\n        emit Ruling(dispute.arbitrated, _disputeID, winningChoice);\\n        dispute.arbitrated.rule(_disputeID, winningChoice);\\n    }\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /// @inheritdoc IArbitratorV2\\n    function arbitrationCost(bytes memory _extraData) public view override returns (uint256 cost) {\\n        (uint96 courtID, uint256 minJurors, ) = _extraDataToCourtIDMinJurorsDisputeKit(_extraData);\\n        cost = courts[courtID].feeForJuror * minJurors;\\n    }\\n\\n    /// @inheritdoc IArbitratorV2\\n    function arbitrationCost(bytes calldata _extraData, IERC20 _feeToken) public view override returns (uint256 cost) {\\n        cost = convertEthToTokenAmount(_feeToken, arbitrationCost(_extraData));\\n    }\\n\\n    /// @notice Gets the cost of appealing a specified dispute.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return cost The appeal cost.\\n    function appealCost(uint256 _disputeID) public view returns (uint256 cost) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        Court storage court = courts[dispute.courtID];\\n        if (round.nbVotes >= court.jurorsForCourtJump) {\\n            // Jump to parent court.\\n            if (dispute.courtID == GENERAL_COURT) {\\n                // TODO: Handle the forking when appealed in General court.\\n                cost = NON_PAYABLE_AMOUNT; // Get the cost of the parent court.\\n            } else {\\n                cost = courts[court.parent].feeForJuror * ((round.nbVotes * 2) + 1);\\n            }\\n        } else {\\n            // Stay in current court.\\n            cost = court.feeForJuror * ((round.nbVotes * 2) + 1);\\n        }\\n    }\\n\\n    /// @notice Gets the start and the end of a specified dispute's current appeal period.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return start The start of the appeal period.\\n    /// @return end The end of the appeal period.\\n    function appealPeriod(uint256 _disputeID) public view returns (uint256 start, uint256 end) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        if (dispute.period == Period.appeal) {\\n            start = dispute.lastPeriodChange;\\n            end = dispute.lastPeriodChange + courts[dispute.courtID].timesPerPeriod[uint256(Period.appeal)];\\n        } else {\\n            start = 0;\\n            end = 0;\\n        }\\n    }\\n\\n    /// @inheritdoc IArbitratorV2\\n    function currentRuling(uint256 _disputeID) public view returns (uint256 ruling, bool tied, bool overridden) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n        (ruling, tied, overridden) = disputeKit.currentRuling(_disputeID);\\n    }\\n\\n    /// @notice Gets the round info for a specified dispute and round.\\n    /// @dev This function must not be called from a non-view function because it returns a dynamic array which might be very large, theoretically exceeding the block gas limit.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _round The round to get the info for.\\n    /// @return round The round info.\\n    function getRoundInfo(uint256 _disputeID, uint256 _round) external view returns (Round memory) {\\n        return disputes[_disputeID].rounds[_round];\\n    }\\n\\n    /// @notice Gets the PNK at stake per juror for a specified dispute and round.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _round The round to get the info for.\\n    /// @return pnkAtStakePerJuror The PNK at stake per juror.\\n    function getPnkAtStakePerJuror(uint256 _disputeID, uint256 _round) external view returns (uint256) {\\n        return disputes[_disputeID].rounds[_round].pnkAtStakePerJuror;\\n    }\\n\\n    /// @notice Gets the number of rounds for a specified dispute.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return The number of rounds.\\n    function getNumberOfRounds(uint256 _disputeID) external view returns (uint256) {\\n        return disputes[_disputeID].rounds.length;\\n    }\\n\\n    /// @notice Checks if a given dispute kit is supported by a given court.\\n    /// @param _courtID The ID of the court to check the support for.\\n    /// @param _disputeKitID The ID of the dispute kit to check the support for.\\n    /// @return Whether the dispute kit is supported or not.\\n    function isSupported(uint96 _courtID, uint256 _disputeKitID) external view returns (bool) {\\n        return courts[_courtID].supportedDisputeKits[_disputeKitID];\\n    }\\n\\n    /// @notice Gets the timesPerPeriod array for a given court.\\n    /// @param _courtID The ID of the court to get the times from.\\n    /// @return timesPerPeriod The timesPerPeriod array for the given court.\\n    function getTimesPerPeriod(uint96 _courtID) external view returns (uint256[4] memory timesPerPeriod) {\\n        timesPerPeriod = courts[_courtID].timesPerPeriod;\\n    }\\n\\n    // ************************************* //\\n    // *   Public Views for Dispute Kits   * //\\n    // ************************************* //\\n\\n    /// @notice Gets the number of votes permitted for the specified dispute in the latest round.\\n    /// @param _disputeID The ID of the dispute.\\n    function getNumberOfVotes(uint256 _disputeID) external view returns (uint256) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        return dispute.rounds[dispute.rounds.length - 1].nbVotes;\\n    }\\n\\n    /// @notice Returns true if the dispute kit will be switched to a parent DK.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return Whether DK will be switched or not.\\n    function isDisputeKitJumping(uint256 _disputeID) external view returns (bool) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        Court storage court = courts[dispute.courtID];\\n\\n        if (round.nbVotes < court.jurorsForCourtJump) {\\n            return false;\\n        }\\n\\n        // Jump if the parent court doesn't support the current DK.\\n        return !courts[court.parent].supportedDisputeKits[round.disputeKitID];\\n    }\\n\\n    function getDisputeKitsLength() external view returns (uint256) {\\n        return disputeKits.length;\\n    }\\n\\n    function convertEthToTokenAmount(IERC20 _toToken, uint256 _amountInEth) public view returns (uint256) {\\n        return (_amountInEth * 10 ** currencyRates[_toToken].rateDecimals) / currencyRates[_toToken].rateInEth;\\n    }\\n\\n    // ************************************* //\\n    // *            Internal               * //\\n    // ************************************* //\\n\\n    /// @notice Toggles the dispute kit support for a given court.\\n    /// @param _courtID The ID of the court to toggle the support for.\\n    /// @param _disputeKitID The ID of the dispute kit to toggle the support for.\\n    /// @param _enable Whether to enable or disable the support. Note that classic dispute kit should always be enabled.\\n    function _enableDisputeKit(uint96 _courtID, uint256 _disputeKitID, bool _enable) internal {\\n        courts[_courtID].supportedDisputeKits[_disputeKitID] = _enable;\\n        emit DisputeKitEnabled(_courtID, _disputeKitID, _enable);\\n    }\\n\\n    /// @notice If called only once then set _onError to Revert, otherwise set it to Return\\n    /// @param _account The account to set the stake for.\\n    /// @param _courtID The ID of the court to set the stake for.\\n    /// @param _newStake The new stake.\\n    /// @param _noDelay True if the stake change should not be delayed.\\n    /// @param _onError Whether to revert or return false on error.\\n    /// @return Whether the stake was successfully set or not.\\n    function _setStake(\\n        address _account,\\n        uint96 _courtID,\\n        uint256 _newStake,\\n        bool _noDelay,\\n        OnError _onError\\n    ) internal returns (bool) {\\n        if (_courtID == FORKING_COURT || _courtID >= courts.length) {\\n            _stakingFailed(_onError, StakingResult.CannotStakeInThisCourt); // Staking directly into the forking court is not allowed.\\n            return false;\\n        }\\n        if (_newStake != 0 && _newStake < courts[_courtID].minStake) {\\n            _stakingFailed(_onError, StakingResult.CannotStakeLessThanMinStake); // Staking less than the minimum stake is not allowed.\\n            return false;\\n        }\\n        (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult) = sortitionModule.validateStake(\\n            _account,\\n            _courtID,\\n            _newStake,\\n            _noDelay\\n        );\\n        if (stakingResult != StakingResult.Successful) {\\n            _stakingFailed(_onError, stakingResult);\\n            return false;\\n        }\\n        if (pnkDeposit > 0) {\\n            if (!pinakion.safeTransferFrom(_account, address(this), pnkDeposit)) {\\n                _stakingFailed(_onError, StakingResult.StakingTransferFailed);\\n                return false;\\n            }\\n        }\\n        if (pnkWithdrawal > 0) {\\n            if (!pinakion.safeTransfer(_account, pnkWithdrawal)) {\\n                _stakingFailed(_onError, StakingResult.UnstakingTransferFailed);\\n                return false;\\n            }\\n        }\\n        sortitionModule.setStake(_account, _courtID, pnkDeposit, pnkWithdrawal, _newStake);\\n\\n        return true;\\n    }\\n\\n    /// @notice It may revert depending on the _onError parameter.\\n    function _stakingFailed(OnError _onError, StakingResult _result) internal pure virtual {\\n        if (_onError == OnError.Return) return;\\n        if (_result == StakingResult.StakingTransferFailed) revert StakingTransferFailed();\\n        if (_result == StakingResult.UnstakingTransferFailed) revert UnstakingTransferFailed();\\n        if (_result == StakingResult.CannotStakeInMoreCourts) revert StakingInTooManyCourts();\\n        if (_result == StakingResult.CannotStakeInThisCourt) revert StakingNotPossibleInThisCourt();\\n        if (_result == StakingResult.CannotStakeLessThanMinStake) revert StakingLessThanCourtMinStake();\\n        if (_result == StakingResult.CannotStakeZeroWhenNoStake) revert StakingZeroWhenNoStake();\\n    }\\n\\n    /// @notice Gets a court ID, the minimum number of jurors and an ID of a dispute kit from a specified extra data bytes array.\\n    /// @dev If `_extraData` contains an incorrect value then this value will be switched to default.\\n    /// @param _extraData The extra data bytes array. The first 32 bytes are the court ID, the next are the minimum number of jurors and the last are the dispute kit ID.\\n    /// @return courtID The court ID.\\n    /// @return minJurors The minimum number of jurors required.\\n    /// @return disputeKitID The ID of the dispute kit.\\n    function _extraDataToCourtIDMinJurorsDisputeKit(\\n        bytes memory _extraData\\n    ) internal view returns (uint96 courtID, uint256 minJurors, uint256 disputeKitID) {\\n        // Note that if the extradata doesn't contain 32 bytes for the dispute kit ID it'll return the default 0 index.\\n        if (_extraData.length >= 64) {\\n            assembly {\\n                // solium-disable-line security/no-inline-assembly\\n                courtID := mload(add(_extraData, 0x20))\\n                minJurors := mload(add(_extraData, 0x40))\\n                disputeKitID := mload(add(_extraData, 0x60))\\n            }\\n            if (courtID == FORKING_COURT || courtID >= courts.length) {\\n                courtID = GENERAL_COURT;\\n            }\\n            if (minJurors == 0) {\\n                minJurors = DEFAULT_NB_OF_JURORS;\\n            }\\n            if (disputeKitID == NULL_DISPUTE_KIT || disputeKitID >= disputeKits.length) {\\n                disputeKitID = DISPUTE_KIT_CLASSIC; // 0 index is not used.\\n            }\\n        } else {\\n            courtID = GENERAL_COURT;\\n            minJurors = DEFAULT_NB_OF_JURORS;\\n            disputeKitID = DISPUTE_KIT_CLASSIC;\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *              Errors               * //\\n    // ************************************* //\\n\\n    error OwnerOnly();\\n    error InstructorOnly();\\n    error OwnerOrInstructorOnly();\\n    error DisputeKitOnly();\\n    error SortitionModuleOnly();\\n    error UnsuccessfulCall();\\n    error InvalidDisputKitParent();\\n    error MinStakeLowerThanParentCourt();\\n    error UnsupportedDisputeKit();\\n    error InvalidForkingCourtAsParent();\\n    error WrongDisputeKitIndex();\\n    error CannotDisableClassicDK();\\n    error StakingInTooManyCourts();\\n    error StakingNotPossibleInThisCourt();\\n    error StakingLessThanCourtMinStake();\\n    error StakingTransferFailed();\\n    error UnstakingTransferFailed();\\n    error ArbitrationFeesNotEnough();\\n    error DisputeKitNotSupportedByCourt();\\n    error MustSupportDisputeKitClassic();\\n    error TokenNotAccepted();\\n    error EvidenceNotPassedAndNotAppeal();\\n    error DisputeStillDrawing();\\n    error CommitPeriodNotPassed();\\n    error VotePeriodNotPassed();\\n    error AppealPeriodNotPassed();\\n    error NotEvidencePeriod();\\n    error AppealFeesNotEnough();\\n    error DisputeNotAppealable();\\n    error NotExecutionPeriod();\\n    error RulingAlreadyExecuted();\\n    error DisputePeriodIsFinal();\\n    error TransferFailed();\\n    error AllJurorsDrawn();\\n    error NoJurorDrawn();\\n    error StakingZeroWhenNoStake();\\n}\\n\",\"keccak256\":\"0x6a0daf9a8720b0618dc69c8b29794fad12f5477d4ec96c778c7c140150b8214d\",\"license\":\"MIT\"},\"src/libraries/Constants.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\nimport \\\"@openzeppelin/contracts/token/ERC20/IERC20.sol\\\";\\n\\n// Courts\\nuint96 constant FORKING_COURT = 0; // Index of the forking court.\\nuint96 constant GENERAL_COURT = 1; // Index of the default (general) court.\\n\\n// Dispute Kits\\nuint256 constant NULL_DISPUTE_KIT = 0; // Null pattern to indicate a top-level DK which has no parent.\\nuint256 constant DISPUTE_KIT_CLASSIC = 1; // Index of the default DK. 0 index is skipped.\\n\\n// Sortition Module\\nuint256 constant MAX_STAKE_PATHS = 4; // The maximum number of stake paths a juror can have.\\nuint256 constant DEFAULT_K = 6; // Default number of children per node.\\n\\n// Defaults\\nuint256 constant DEFAULT_NB_OF_JURORS = 3; // The default number of jurors in a dispute.\\nIERC20 constant NATIVE_CURRENCY = IERC20(address(0)); // The native currency, such as ETH on Arbitrum, Optimism and Ethereum L1.\\n\\n// Units\\nuint256 constant ONE_BASIS_POINT = 10000;\\n\\nenum OnError {\\n    Revert,\\n    Return\\n}\\n\\nenum StakingResult {\\n    Successful,\\n    Delayed,\\n    StakingTransferFailed,\\n    UnstakingTransferFailed,\\n    CannotStakeInMoreCourts,\\n    CannotStakeInThisCourt,\\n    CannotStakeLessThanMinStake,\\n    CannotStakeMoreThanMaxStakePerJuror,\\n    CannotStakeMoreThanMaxTotalStaked,\\n    CannotStakeZeroWhenNoStake\\n}\\n\",\"keccak256\":\"0xb8c96c842259ca1384e8450dfb214f0fcd604829c84293dd3f8981f3421b66c9\",\"license\":\"MIT\"},\"src/libraries/SafeERC20.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n// Adapted from https://github.com/OpenZeppelin/openzeppelin-contracts/blob/a7a94c77463acea95d979aae1580fb0ddc3b6a1e/contracts/token/ERC20/utils/SafeERC20.sol\\n\\npragma solidity ^0.8.24;\\n\\nimport \\\"@openzeppelin/contracts/token/ERC20/IERC20.sol\\\";\\n\\n/// @title SafeERC20\\n///\\n/// @notice Wrappers around ERC20 operations\\n///\\n/// @dev Throws on failure (when the token contract returns false).\\n/// Tokens that return no value (and instead revert or throw on failure) are also supported.\\n/// Non-reverting calls are assumed to be successful.\\n/// To use this library you can add a `using SafeERC20 for IERC20;` statement to your contract,\\n/// which allows you to call the safe operations as `token.safeTransfer(...)`, etc.\\nlibrary SafeERC20 {\\n    /// @notice Increases the allowance granted to `spender` by the caller.\\n    /// @param _token Token to transfer.\\n    /// @param _spender The address which will spend the funds.\\n    /// @param _addedValue The amount of tokens to increase the allowance by.\\n    function increaseAllowance(IERC20 _token, address _spender, uint256 _addedValue) internal returns (bool) {\\n        _token.approve(_spender, _token.allowance(address(this), _spender) + _addedValue);\\n        return true;\\n    }\\n\\n    /// @notice Calls transfer() without reverting.\\n    /// @param _token Token to transfer.\\n    /// @param _to Recipient address.\\n    /// @param _value Amount transferred.\\n    /// @return Whether transfer succeeded or not.\\n    function safeTransfer(IERC20 _token, address _to, uint256 _value) internal returns (bool) {\\n        (bool success, bytes memory data) = address(_token).call(abi.encodeCall(IERC20.transfer, (_to, _value)));\\n        return (success && (data.length == 0 || abi.decode(data, (bool))));\\n    }\\n\\n    /// @notice Calls transferFrom() without reverting.\\n    /// @param _token Token to transfer.\\n    /// @param _from Sender address.\\n    /// @param _to Recipient address.\\n    /// @param _value Amount transferred.\\n    /// @return Whether transfer succeeded or not.\\n    function safeTransferFrom(IERC20 _token, address _from, address _to, uint256 _value) internal returns (bool) {\\n        (bool success, bytes memory data) = address(_token).call(\\n            abi.encodeCall(IERC20.transferFrom, (_from, _to, _value))\\n        );\\n        return (success && (data.length == 0 || abi.decode(data, (bool))));\\n    }\\n}\\n\",\"keccak256\":\"0x36b92f984484f9dfd63a40ccb1c1e23cde0085db36ec8adb7afe7e98ef667bd7\",\"license\":\"MIT\"},\"src/proxy/Initializable.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v4.9.0) (proxy/utils/Initializable.sol) <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/utils/Initializable.sol>\\n\\npragma solidity ^0.8.24;\\n\\n/**\\n * @dev This is a base contract to aid in writing upgradeable contracts, or any kind of contract that will be deployed\\n * behind a proxy. Since proxied contracts do not make use of a constructor, it's common to move constructor logic to an\\n * external initializer function, usually called `initialize`. It then becomes necessary to protect this initializer\\n * function so it can only be called once. The {initializer} modifier provided by this contract will have this effect.\\n *\\n * The initialization functions use a version number. Once a version number is used, it is consumed and cannot be\\n * reused. This mechanism prevents re-execution of each \\\"step\\\" but allows the creation of new initialization steps in\\n * case an upgrade adds a module that needs to be initialized.\\n *\\n * For example:\\n *\\n * ```solidity\\n * contract MyToken is ERC20Upgradeable {\\n *     function initialize() initializer public {\\n *         __ERC20_init(\\\"MyToken\\\", \\\"MTK\\\");\\n *     }\\n * }\\n *\\n * contract MyTokenV2 is MyToken, ERC20PermitUpgradeable {\\n *     function initializeV2() reinitializer(2) public {\\n *         __ERC20Permit_init(\\\"MyToken\\\");\\n *     }\\n * }\\n * ```\\n *\\n * TIP: To avoid leaving the proxy in an uninitialized state, the initializer function should be called as early as\\n * possible by providing the encoded function call as the `_data` argument to the proxy constructor\\n *\\n * CAUTION: When used with inheritance, manual care must be taken to not invoke a parent initializer twice, or to ensure\\n * that all initializers are idempotent. This is not verified automatically as constructors are by Solidity.\\n *\\n * [CAUTION]\\n * ====\\n * Avoid leaving a contract uninitialized.\\n *\\n * An uninitialized contract can be taken over by an attacker. This applies to both a proxy and its implementation\\n * contract, which may impact the proxy. To prevent the implementation contract from being used, you should invoke\\n * the {_disableInitializers} function in the constructor to automatically lock it when it is deployed:\\n *\\n * ```\\n * /// @custom:oz-upgrades-unsafe-allow constructor\\n * constructor() {\\n *     _disableInitializers();\\n * }\\n * ```\\n */\\nabstract contract Initializable {\\n    /**\\n     * @dev Storage of the initializable contract.\\n     *\\n     * It's implemented on a custom ERC-7201 namespace to reduce the risk of storage collisions\\n     * when using with upgradeable contracts.\\n     *\\n     * @custom:storage-location erc7201:openzeppelin.storage.Initializable\\n     */\\n    struct InitializableStorage {\\n        /**\\n         * @dev Indicates that the contract has been initialized.\\n         */\\n        uint64 _initialized;\\n        /**\\n         * @dev Indicates that the contract is in the process of being initialized.\\n         */\\n        bool _initializing;\\n    }\\n\\n    // keccak256(abi.encode(uint256(keccak256(\\\"openzeppelin.storage.Initializable\\\")) - 1))\\n    bytes32 private constant _INITIALIZABLE_STORAGE =\\n        0xf0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e;\\n\\n    /**\\n     * @dev The contract is already initialized.\\n     */\\n    error AlreadyInitialized();\\n\\n    /**\\n     * @dev The contract is not initializing.\\n     */\\n    error NotInitializing();\\n\\n    /**\\n     * @dev Triggered when the contract has been initialized or reinitialized.\\n     */\\n    event Initialized(uint64 version);\\n\\n    /**\\n     * @dev A modifier that defines a protected initializer function that can be invoked at most once. In its scope,\\n     * `onlyInitializing` functions can be used to initialize parent contracts.\\n     *\\n     * Similar to `initializer()`, except that functions marked with `initializer` can be nested in the context of a\\n     * constructor.\\n     *\\n     * Emits an {Initialized} event.\\n     */\\n    modifier initializer() {\\n        // solhint-disable-next-line var-name-mixedcase\\n        InitializableStorage storage $ = _getInitializableStorage();\\n\\n        bool isTopLevelCall = !$._initializing;\\n        uint64 initialized = $._initialized;\\n        if (!(isTopLevelCall && initialized < 1) && !(address(this).code.length == 0 && initialized == 1)) {\\n            revert AlreadyInitialized();\\n        }\\n        $._initialized = 1;\\n        if (isTopLevelCall) {\\n            $._initializing = true;\\n        }\\n        _;\\n        if (isTopLevelCall) {\\n            $._initializing = false;\\n            emit Initialized(1);\\n        }\\n    }\\n\\n    /**\\n     * @dev A modifier that defines a protected reinitializer function that can be invoked at most once, and only if the\\n     * contract hasn't been initialized to a greater version before. In its scope, `onlyInitializing` functions can be\\n     * used to initialize parent contracts.\\n     *\\n     * A reinitializer may be used after the original initialization step. This is essential to configure modules that\\n     * are added through upgrades and that require initialization.\\n     *\\n     * When `version` is 1, this modifier is similar to `initializer`, except that functions marked with `reinitializer`\\n     * cannot be nested. If one is invoked in the context of another, execution will revert.\\n     *\\n     * Note that versions can jump in increments greater than 1; this implies that if multiple reinitializers coexist in\\n     * a contract, executing them in the right order is up to the developer or operator.\\n     *\\n     * WARNING: setting the version to 255 will prevent any future reinitialization.\\n     *\\n     * Emits an {Initialized} event.\\n     */\\n    modifier reinitializer(uint64 version) {\\n        // solhint-disable-next-line var-name-mixedcase\\n        InitializableStorage storage $ = _getInitializableStorage();\\n\\n        if ($._initializing || $._initialized >= version) {\\n            revert AlreadyInitialized();\\n        }\\n        $._initialized = version;\\n        $._initializing = true;\\n        _;\\n        $._initializing = false;\\n        emit Initialized(version);\\n    }\\n\\n    /**\\n     * @dev Modifier to protect an initialization function so that it can only be invoked by functions with the\\n     * {initializer} and {reinitializer} modifiers, directly or indirectly.\\n     */\\n    modifier onlyInitializing() {\\n        _checkInitializing();\\n        _;\\n    }\\n\\n    /**\\n     * @dev Reverts if the contract is not in an initializing state. See {onlyInitializing}.\\n     */\\n    function _checkInitializing() internal view virtual {\\n        if (!_isInitializing()) {\\n            revert NotInitializing();\\n        }\\n    }\\n\\n    /**\\n     * @dev Locks the contract, preventing any future reinitialization. This cannot be part of an initializer call.\\n     * Calling this in the constructor of a contract will prevent that contract from being initialized or reinitialized\\n     * to any version. It is recommended to use this to lock implementation contracts that are designed to be called\\n     * through proxies.\\n     *\\n     * Emits an {Initialized} event the first time it is successfully executed.\\n     */\\n    function _disableInitializers() internal virtual {\\n        // solhint-disable-next-line var-name-mixedcase\\n        InitializableStorage storage $ = _getInitializableStorage();\\n\\n        if ($._initializing) {\\n            revert AlreadyInitialized();\\n        }\\n        if ($._initialized != type(uint64).max) {\\n            $._initialized = type(uint64).max;\\n            emit Initialized(type(uint64).max);\\n        }\\n    }\\n\\n    /**\\n     * @dev Returns the highest version that has been initialized. See {reinitializer}.\\n     */\\n    function _getInitializedVersion() internal view returns (uint64) {\\n        return _getInitializableStorage()._initialized;\\n    }\\n\\n    /**\\n     * @dev Returns `true` if the contract is currently initializing. See {onlyInitializing}.\\n     */\\n    function _isInitializing() internal view returns (bool) {\\n        return _getInitializableStorage()._initializing;\\n    }\\n\\n    /**\\n     * @dev Returns a pointer to the storage namespace.\\n     */\\n    // solhint-disable-next-line var-name-mixedcase\\n    function _getInitializableStorage() private pure returns (InitializableStorage storage $) {\\n        assembly {\\n            $.slot := _INITIALIZABLE_STORAGE\\n        }\\n    }\\n}\\n\",\"keccak256\":\"0xdad09e5f773fa6940dbd8c28480f602a7eaa3c70d3da9d06df140187cbf5dad4\",\"license\":\"MIT\"},\"src/proxy/UUPSProxiable.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\n/// @title UUPS Proxiable\\n/// @author Simon Malatrait <simon.malatrait@grenoble-inp.org>\\n/// @notice This contract implements an upgradeability mechanism designed for UUPS proxies.\\n///\\n/// @dev Adapted from <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/utils/UUPSUpgradeable.sol>\\n/// The functions included here can perform an upgrade of an UUPS Proxy, when this contract is set as the implementation behind such a proxy.\\n///\\n/// IMPORTANT: A UUPS proxy requires its upgradeability functions to be in the implementation as opposed to the transparent proxy.\\n/// This means that if the proxy is upgraded to an implementation that does not support this interface, it will no longer be upgradeable.\\n///\\n/// A security mechanism ensures that an upgrade does not turn off upgradeability accidentally, although this risk is\\n/// reinstated if the upgrade retains upgradeability but removes the security mechanism, e.g. by replacing\\n/// `UUPSProxiable` with a custom implementation of upgrades.\\n///\\n/// The `_authorizeUpgrade` function must be overridden to include access restriction to the upgrade mechanism.\\nabstract contract UUPSProxiable {\\n    // ************************************* //\\n    // *             Event                 * //\\n    // ************************************* //\\n\\n    /// @notice Emitted when the `implementation` has been successfully upgraded.\\n    /// @param newImplementation Address of the new implementation the proxy is now forwarding calls to.\\n    event Upgraded(address indexed newImplementation);\\n\\n    // ************************************* //\\n    // *             Error                 * //\\n    // ************************************* //\\n\\n    /// @notice The call is from an unauthorized context.\\n    error UUPSUnauthorizedCallContext();\\n\\n    /// @notice The storage `slot` is unsupported as a UUID.\\n    error UUPSUnsupportedProxiableUUID(bytes32 slot);\\n\\n    /// @notice The `implementation` is not UUPS-compliant\\n    error InvalidImplementation(address implementation);\\n\\n    /// Failed Delegated call\\n    error FailedDelegateCall();\\n\\n    // ************************************* //\\n    // *             Storage               * //\\n    // ************************************* //\\n\\n    /// @dev Storage slot with the address of the current implementation.\\n    /// @dev This is the keccak-256 hash of \\\"eip1967.proxy.implementation\\\" subtracted by 1, and is\\n    /// @dev validated in the constructor.\\n    /// @dev NOTE: bytes32(uint256(keccak256('eip1967.proxy.implementation')) - 1)\\n    bytes32 private constant IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;\\n\\n    /// @dev Storage variable of the proxiable contract address.\\n    /// @dev It is used to check whether or not the current call is from the proxy.\\n    /// @custom:oz-upgrades-unsafe-allow state-variable-immutable\\n    address private immutable __self = address(this);\\n\\n    // ************************************* //\\n    // *             Governance            * //\\n    // ************************************* //\\n\\n    /// @dev Function that should revert when `msg.sender` is not authorized to upgrade the contract.\\n    /// @dev Called by {upgradeToAndCall}.\\n    function _authorizeUpgrade(address newImplementation) internal virtual;\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @notice Upgrade mechanism including access control and UUPS-compliance.\\n    /// @param newImplementation Address of the new implementation contract.\\n    /// @param data Data used in a delegate call to `newImplementation` if non-empty. This will typically be an encoded\\n    /// function call, and allows initializing the storage of the proxy like a Solidity constructor.\\n    /// @dev Reverts if the execution is not performed via delegatecall or the execution\\n    /// context is not of a proxy with an ERC1967-compliant implementation pointing to self.\\n    function upgradeToAndCall(address newImplementation, bytes memory data) public payable virtual {\\n        _authorizeUpgrade(newImplementation);\\n\\n        // Check that the execution is being performed through a delegatecall call and that the execution context is\\n        // a proxy contract with an implementation (as defined in ERC1967) pointing to self.\\n        if (address(this) == __self || _getImplementation() != __self) {\\n            revert UUPSUnauthorizedCallContext();\\n        }\\n\\n        try UUPSProxiable(newImplementation).proxiableUUID() returns (bytes32 slot) {\\n            if (slot != IMPLEMENTATION_SLOT) {\\n                revert UUPSUnsupportedProxiableUUID(slot);\\n            }\\n            // Store the new implementation address to the implementation storage slot.\\n            assembly {\\n                sstore(IMPLEMENTATION_SLOT, newImplementation)\\n            }\\n            emit Upgraded(newImplementation);\\n\\n            if (data.length != 0) {\\n                // The return data is not checked (checking, in case of success, that the newImplementation code is non-empty if the return data is empty) because the authorized callee is trusted.\\n                /// @custom:oz-upgrades-unsafe-allow delegatecall\\n                (bool success, ) = newImplementation.delegatecall(data);\\n                if (!success) {\\n                    revert FailedDelegateCall();\\n                }\\n            }\\n        } catch {\\n            revert InvalidImplementation(newImplementation);\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /// @notice Implementation of the ERC1822 `proxiableUUID` function. This returns the storage slot used by the\\n    /// implementation. It is used to validate the implementation's compatibility when performing an upgrade.\\n    ///\\n    /// @dev IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks\\n    /// bricking a proxy that upgrades to it, by delegating to itself until out of gas. Thus it is critical that this\\n    /// function revert if invoked through a proxy. This is guaranteed by the if statement.\\n    function proxiableUUID() external view virtual returns (bytes32) {\\n        if (address(this) != __self) {\\n            // Must not be called through delegatecall\\n            revert UUPSUnauthorizedCallContext();\\n        }\\n        return IMPLEMENTATION_SLOT;\\n    }\\n\\n    /// @notice Returns the version of the implementation.\\n    /// @return Version string.\\n    function version() external view virtual returns (string memory);\\n\\n    // ************************************* //\\n    // *           Internal Views          * //\\n    // ************************************* //\\n\\n    function _getImplementation() internal view returns (address implementation) {\\n        assembly {\\n            implementation := sload(IMPLEMENTATION_SLOT)\\n        }\\n    }\\n}\\n\",\"keccak256\":\"0xa369061748e8a7b02873d597d4c78a2a09328111f04a97428b1c209e82cf5414\",\"license\":\"MIT\"}},\"version\":1}",
+  "bytecode": "0x60a080604052346100c157306080525f5160206156465f395f51905f525460ff8160401c166100b3576002600160401b03196001600160401b03821601610060575b60405161558090816100c682396080518181816112b001526114de0152f35b6001600160401b0319166001600160401b039081175f5160206156465f395f51905f525581527fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d290602090a15f80610041565b62dc149f60e41b5f5260045ffd5b5f80fdfe60806040526004361015610011575f80fd5b5f3560e01c8062f5822c146103235780630219da791461031e5780630761c14d1461031957806309cfdc9c146103145780630b7414bc1461030f578063115d53761461030a5780631860592b1461030557806319b81529146103005780631c3db16d146102fb5780631f5a0dd2146102f65780632d29a47b146102f15780632e1daf2f146102ec5780633cfd1184146102e757806342c37fa3146102e25780634f1ef286146102dd57806352d1902d146102d857806354fd4d50146102d3578063564a565d146102ce57806359ec827e146102c95780636a8c9194146102c457806371ae413d146102bf5780637717a6e8146102ba5780637934c0be146102b557806382d02237146102b057806386541b24146102ab57806386cdecef146102a65780638a9bb02a146102a15780638bb048751461029c5780638da5cb5b14610297578063a6f9dae114610292578063acdbf51d1461028d578063afe15cfb14610288578063b004963714610283578063b702a8791461027e578063c13517e114610279578063c258bb1914610274578063c35699021461026f578063c71f42531461026a578063cf0c38f814610265578063d07368bd14610260578063d4d1d76a1461025b578063d874514b14610256578063d98493f614610251578063e399d29b1461024c578063f6506db414610247578063f7434ea914610242578063fbf405b01461023d578063fc6f8f16146102385763fe524c3914610233575f80fd5b6131a5565b613185565b61315f565b613129565b613016565b612f55565b612ef8565b612c27565b612c0a565b612b9f565b612b79565b612b39565b6126f9565b6126ad565b61242e565b612017565b611fcb565b611f48565b611eef565b611e76565b611e51565b611d02565b611c54565b611ab6565b61193d565b61180d565b611784565b61175a565b611734565b61169e565b611680565b6115fd565b611552565b6114c4565b611266565b6111af565b611134565b6110d7565b610e80565b610e00565b610d96565b610d6e565b610d3b565b610750565b61061c565b610493565b610421565b6103b1565b61033d565b6001600160a01b0381160361033957565b5f80fd5b346103395760203660031901126103395760043561035a81610328565b6001600160a01b035f54163303610389576001600160a01b03166001600160a01b031960025416176002555f80f35b7f596dcdb8000000000000000000000000000000000000000000000000000000005f5260045ffd5b34610339576020366003190112610339576001600160a01b036004356103d681610328565b165f526008602052606060405f205460ff604051918181161515835267ffffffffffffffff8160081c16602084015260481c166040820152f35b6001600160601b0381160361033957565b346103395760603660031901126103395760043561043e81610328565b60243561044a81610410565b604435906001600160a01b0360045416330361046b5761046992613fb0565b005b7f9d6cab99000000000000000000000000000000000000000000000000000000005f5260045ffd5b34610339576020366003190112610339576004356104b081610328565b6001600160a01b035f54163314158061050e575b6104e6576001600160a01b03166001600160a01b031960015416176001555f80f35b7ff10d23b5000000000000000000000000000000000000000000000000000000005f5260045ffd5b506001600160a01b03600154163314156104c4565b634e487b7160e01b5f52604160045260245ffd5b6101a0810190811067ffffffffffffffff82111761055457604052565b610523565b90601f8019910116810190811067ffffffffffffffff82111761055457604052565b6040519061058b61010083610559565b565b6040519061058b6101a083610559565b67ffffffffffffffff81116105545760051b60200190565b9080601f830112156103395781356105cc8161059d565b926105da6040519485610559565b81845260208085019260051b82010192831161033957602001905b8282106106025750505090565b81358152602091820191016105f5565b8015150361033957565b346103395760603660031901126103395760043561063981610410565b60243567ffffffffffffffff8111610339576106599036906004016105b5565b6044359061066682610612565b6001600160a01b035f54163303610389575f5b81518110156104695782156106fa5761069281836131ec565b511580156106e4575b6106bc57806106b66106af600193856131ec565b51866143e8565b01610679565b7f7ab15312000000000000000000000000000000000000000000000000000000005f5260045ffd5b506106ef81836131ec565b51600654111561069b565b600161070682846131ec565b5114610728578061072361071c600193856131ec565b5186614397565b6106b6565b7fada223fa000000000000000000000000000000000000000000000000000000005f5260045ffd5b346103395760203660031901126103395760043561076d816115b1565b5061078761078282546001600160601b031690565b610ddf565b509060038101916107a261079b8454613214565b809461323f565b5060018301936107b3855460ff1690565b6107bc816115e1565b806108d857501580610896575b61086e57600360068201549101540361084657547f4e6f5cf43b95303e86aee81683df63992061723a829ee012db21dad388756b91926108379261082b9260601c60ff161561083c5761081e60015b83613287565b6002429101555460ff1690565b6040519182918261329f565b0390a2005b61081e6002610818565b7f9e4486b0000000000000000000000000000000000000000000000000000000005f5260045ffd5b7f3e9727df000000000000000000000000000000000000000000000000000000005f5260045ffd5b506108a5600284015442613232565b6108d26108c86108b6875460ff1690565b6108bf816115e1565b60068601613258565b90549060031b1c90565b116107c9565b90506108e9819594959392936115e1565b60018103610a5057506109246108c8610906600287015442613232565b926006610914875460ff1690565b9161091e836115e1565b01613258565b119081610993575b5061096b57805460ff191660021781557f4e6f5cf43b95303e86aee81683df63992061723a829ee012db21dad388756b91916108379161082b9161081e565b7f9bf4af0a000000000000000000000000000000000000000000000000000000005f5260045ffd5b6109c491506109a56109b89154611ec2565b90546001600160a01b039160031b1c1690565b6001600160a01b031690565b602060405180927f0baa64d10000000000000000000000000000000000000000000000000000000082528180610a0289600483019190602083019252565b03915afa908115610a4b575f91610a1c575b50155f61092c565b610a3e915060203d602011610a44575b610a368183610559565b810190613267565b5f610a14565b503d610a2c565b61327c565b610a59816115e1565b60028103610ba75750610a766108c8610906600287015442613232565b119081610b1e575b50610af657805460ff191660031781557f4e6f5cf43b95303e86aee81683df63992061723a829ee012db21dad388756b91916108379161082b916001600160a01b03610acb825460601c90565b16867fa5d41b970d849372be1da1481ffd78d162bfe57a7aa2fe4e5fb73481fa5ac24f5f80a361081e565b7fcc46f568000000000000000000000000000000000000000000000000000000005f5260045ffd5b610b3091506109a56109b89154611ec2565b602060405180927f6d4cd8ea0000000000000000000000000000000000000000000000000000000082528180610b6e89600483019190602083019252565b03915afa908115610a4b575f91610b88575b50155f610a7e565b610ba1915060203d602011610a4457610a368183610559565b5f610b80565b610bb0816115e1565b60038103610cd1576108c8610bd9916006610bcf600289015442613232565b9461091e836115e1565b119081610c48575b50610c2057805460ff191660041781557f4e6f5cf43b95303e86aee81683df63992061723a829ee012db21dad388756b91916108379161082b9161081e565b7f2f4dfd87000000000000000000000000000000000000000000000000000000005f5260045ffd5b610c5a91506109a56109b89154611ec2565b602060405180927f0855bbe90000000000000000000000000000000000000000000000000000000082528180610c9889600483019190602083019252565b03915afa908115610a4b575f91610cb2575b50155f610be1565b610ccb915060203d602011610a4457610a368183610559565b5f610caa565b905060049150610ce0816115e1565b14610d135761082b610837917f4e6f5cf43b95303e86aee81683df63992061723a829ee012db21dad388756b919361081e565b7f0fe7191e000000000000000000000000000000000000000000000000000000005f5260045ffd5b34610339576040366003190112610339576020610d66600435610d5d81610328565b602435906132fb565b604051908152f35b34610339576020366003190112610339576020610d8c600435613353565b6040519015158152f35b34610339576020366003190112610339576060610db46004356133f9565b906040519283521515602083015215156040820152f35b634e487b7160e01b5f52603260045260245ffd5b600554811015610dfb5760055f52601560205f20910201905f90565b610dcb565b346103395760203660031901126103395760043560055481101561033957610e2790610ddf565b508054600282015460038301546004840154600590940154604080516001600160601b0386168152606095861c60ff16151560208201529081019390935292820152608081019290925260a08201528060c081015b0390f35b3461033957606036600319011261033957600435604435602435610ea3836115b1565b506004610eb4600183015460ff1690565b610ebd816115e1565b036110a557816003610ecf920161323f565b50906004820193610ee2855494856134e1565b926005810194855496600683015490610eff8260028601546132ec565b92610f156109b86109a560018801549754611ec2565b6040517fda3beb8c00000000000000000000000000000000000000000000000000000000815260048101889052602481018990529290602090849060449082905afa928315610a4b575f93611074575b50826110455783891161103c575b9780979695949392985b55965b868810610f9657898981815403610f9357005b55005b9091929394959698828a105f14610ff657610fe7600191610fb561057b565b908882528960208301528460408301528560608301528660808301528760a083015260c08201528b60e0820152614a40565b995b0196959493929190610f80565b9860019061103761100561057b565b8881528960208201528460408201528560608201528660808201528760a08201528c60c08201528260e08201526144aa565b610fe9565b97508297610f73565b61104e846132af565b8911611063575b978097969594939298610f7d565b975061106e836132af565b97611055565b61109791935060203d60201161109e575b61108f8183610559565b8101906134ee565b915f610f65565b503d611085565b7f8794ce4b000000000000000000000000000000000000000000000000000000005f5260045ffd5b5f91031261033957565b34610339575f3660031901126103395760206001600160a01b0360045416604051908152f35b905f905b6004821061110e57505050565b6020806001928551815201930191019091611101565b60808101929161058b91906110fd565b346103395760203660031901126103395761116b60043561115481610410565b60806040516111638282610559565b369037610ddf565b50604051906006015f825b6004821061119957610e7c8461118d608082610559565b60405191829182611124565b6001602081928554815201930191019091611176565b34610339576040366003190112610339576004356111cc81610328565b6024356001600160a01b0360045416330361046b57610469916001600160a01b036002541661500d565b67ffffffffffffffff811161055457601f01601f191660200190565b92919261121e826111f6565b9161122c6040519384610559565b829481845281830111610339578281602093845f960137010152565b9080601f830112156103395781602061126393359101611212565b90565b60403660031901126103395760043561127e81610328565b60243567ffffffffffffffff81116103395761129e903690600401611248565b6112a66150a2565b6001600160a01b037f000000000000000000000000000000000000000000000000000000000000000016803014908115611489575b50611461576001600160a01b0382166040517f52d1902d000000000000000000000000000000000000000000000000000000008152602081600481855afa5f9181611440575b5061135b577f0c760937000000000000000000000000000000000000000000000000000000005f526001600160a01b03841660045260245ffd5b7f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc81036114155750827f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc557fbc7cd75a20ee27fd9adebab32041f755214dbc6bffa90cc0225b39da2e5c2d3b5f80a28051806113d357005b5f926020849301905af46113e56134fd565b50156113ed57005b7f736436ba000000000000000000000000000000000000000000000000000000005f5260045ffd5b7faa1d49a4000000000000000000000000000000000000000000000000000000005f5260045260245ffd5b61145a91925060203d60201161109e5761108f8183610559565b905f611321565b7fe07c8dba000000000000000000000000000000000000000000000000000000005f5260045ffd5b90506114bc7f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc546001600160a01b031690565b14155f6112db565b34610339575f366003190112610339576001600160a01b037f00000000000000000000000000000000000000000000000000000000000000001630036114615760206040517f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc8152f35b805180835260209291819084018484015e5f828201840152601f01601f1916010190565b34610339575f36600319011261033957610e7c604051611573604082610559565b600581527f322e302e30000000000000000000000000000000000000000000000000000000602082015260405191829160208352602083019061152e565b600754811015610dfb5760075f52600e60205f20910201905f90565b634e487b7160e01b5f52602160045260245ffd5b600511156115eb57565b6115cd565b9060058210156115eb5752565b34610339576020366003190112610339576004356007548110156103395761162660ff916115b1565b508054600260018301549201546040519384936001600160a01b0360a08601946001600160601b0380821616875260601c16602086015261166c604086018383166115f0565b60081c161515606084015260808301520390f35b34610339576020366003190112610339576020610d6660043561352c565b34610339576060366003190112610339576004356116bb81610328565b60243560443567ffffffffffffffff8111610339576116de903690600401611248565b6001600160a01b035f54163303610389575f928392602083519301915af16117046134fd565b501561170c57005b7f44125e5e000000000000000000000000000000000000000000000000000000005f5260045ffd5b34610339575f3660031901126103395760206001600160a01b0360015416604051908152f35b346103395760403660031901126103395761046960043561177a81610410565b6024359033614203565b34610339576040366003190112610339576004356117a181610328565b602435906117ae82610612565b6001600160a01b035f54163303610389576001600160a01b031690815f52600860205260405f2060ff1981541660ff831515161790551515907f541615e167511d757a7067a700eb54431b256bb458dfdce0ac58bf2ed0aefd445f80a3005b346103395760603660031901126103395760043561182a81610328565b6024359067ffffffffffffffff821682036103395760443560ff81168103610339576001600160a01b035f54163303610389576001600160a01b03919091165f81815260086020818152604092839020805469ffffffffffffffffff0019169287901b68ffffffffffffffff001692909217604886901b69ff0000000000000000001617909155815167ffffffffffffffff909516855260ff90931692840192909252917fe6996b7f03e9bd02228b99d3d946932e3197f505f60542c4cfbc919441d8a4e69181908101610837565b8060e312156103395760405190611911608083610559565b8190610144116103395760c4905b610144821061192d57505090565b813581526020918201910161191f565b34610339576101403660031901126103395760043561195b81610410565b60243561196781610612565b6044359060643560a43560843561197d366118f9565b926001600160a01b035f54163303610389576001600160601b036119a088610ddf565b50971696600188141580611a95575b611a6d575f600182018054915b828110611a4a57600284018a905583546cff000000000000000000000000191689151560601b6cff000000000000000000000000161784558a7f709b1f5fda58af9a4f52dacd1ec404840a8148455700cce155a2bd8cf127ef1a8b8b6108378c8c8c8c611a3e8460068f846003820155856004820155866005820155016135fa565b6040519687968761361e565b896002611a5d6107826108c88587611eda565b50015410611a6d576001016119bc565b7f97170789000000000000000000000000000000000000000000000000000000005f5260045ffd5b50866002611aad61078284546001600160601b031690565b500154116119af565b346103395760403660031901126103395760206001611ae56024356003611ade6004356115b1565b500161323f565b500154604051908152f35b90602080835192838152019201905f5b818110611b0d5750505090565b82516001600160a01b0316845260209384019390920191600101611b00565b90602080835192838152019201905f5b818110611b495750505090565b82516001600160601b0316845260209384019390920191600101611b3c565b905f905b600a8210611b7957505050565b6020806001928551815201930191019091611b6c565b611263906020815282516020820152602083015160408201526040830151606082015260608301516080820152608083015160a082015260a083015160c08201526101a0610180611c0b611bf460c08701516102c060e08701526102e0860190611af0565b60e0870151858203601f1901610100870152611b2c565b94610100810151610120850152610120810151610140850152611c406101408201516101608601906001600160a01b03169052565b610160810151828501520151910190611b68565b3461033957604036600319011261033957610e7c611cf6611cf06004356003611ade60243592604051611c8681610537565b5f81525f60208201525f60408201525f60608201525f60808201525f60a0820152606060c0820152606060e08201525f6101008201525f6101208201525f6101408201525f6101608201526101806101409160405192611ce68185610559565b36843701526115b1565b5061379b565b60405191829182611b8f565b3461033957602036600319011261033957600435611d1f816115b1565b5090600182019182546004611d348260ff1690565b611d3d816115e1565b036110a55760081c60ff16611e2957611d78611dbd91611d71611d5f856133f9565b5050865461ff00191661010017909655565b5460601c90565b60405184815283906001600160a01b038316907f394027a5fa6e098a1191094d1719d6929b9abc535fcc0c8f448d6a4e7562227690602090a36001600160a01b031690565b91823b15610339576040517f311a6c5600000000000000000000000000000000000000000000000000000000815260048101929092526024820152905f908290818381604481015b03925af18015610a4b57611e1557005b80611e235f61046993610559565b806110cd565b7fc977f8d3000000000000000000000000000000000000000000000000000000005f5260045ffd5b34610339575f3660031901126103395760206001600160a01b035f5416604051908152f35b3461033957602036600319011261033957600435611e9381610328565b5f5490336001600160a01b03831603610389576001600160a01b036001600160a01b031991169116175f555f80f35b600654811015610dfb5760065f5260205f2001905f90565b8054821015610dfb575f5260205f2001905f90565b3461033957602036600319011261033957600435600654811015610339576001600160a01b0360209160065f527ff652222313e28459528d920b65115c16c04f3efc82aaedc97be59f3f377c0d3f015416604051908152f35b3461033957602036600319011261033957611f646004356115b1565b5060ff60018201541660058110156115eb57600303611fc357611fb0611faa6108c86006611fa06001600160601b036002870154965416610ddf565b5001600301905f90565b826134e1565b905b604080519182526020820192909252f35b505f80611fb2565b3461033957602036600319011261033957600435611fe881610328565b6001600160a01b035f54163303610389576001600160a01b03166001600160a01b031960045416176004555f80f35b346103395760403660031901126103395760243560043561203782610328565b6001600160a01b035f541633141580612419575b6104e657612058816115b1565b5090600382019061207361206c8354613214565b809361323f565b5093612083600185015460ff1690565b61208c816115e1565b6123f157600685018054916003870192835411156123c9576120b96109b86004546001600160a01b031690565b803b1561033957604051633c694c4160e21b81526001600160a01b039290921660048301525f908290602490829084905af18015610a4b576123b5575b506121666121076109a58854611ec2565b96600b810196604061211989546134d3565b809a885f6001600160a01b0385518099819682957fd2b8035a0000000000000000000000000000000000000000000000000000000084526004840160209093929193604081019481520152565b0393165af18015610a4b575f935f91612380575b506001600160a01b038416918215612358576121a16109b86004546001600160a01b031690565b600185015490803b15610339576040517f21e1625e0000000000000000000000000000000000000000000000000000000081526001600160a01b038816600482015260248101929092525f908290604490829084905af1958615610a4b578960079561224b9361226399612344575b508954604080518f815260208101929092527f6119cf536152c11e0a9a6c22f3953ce4ecc93ee54fa72ffa326ffabded21509b91a38761387e565b6001600160601b038216156123325750915b016138e0565b549054146122af575b5050556122846109b86004546001600160a01b031690565b803b15610339575f6040518092633c694c4160e21b8252818381611e0560048201905f602083019252565b6122c46109b86004546001600160a01b031690565b91823b15610339576040517f5d2d784600000000000000000000000000000000000000000000000000000000815260048101929092526024820152905f908290604490829084905af18015610a4b5761231e575b8061226c565b80611e235f61232c93610559565b5f612318565b546001600160601b031690509161225d565b80611e235f61235293610559565b5f612210565b7f5c7171ee000000000000000000000000000000000000000000000000000000005f5260045ffd5b90506123a591935060403d6040116123ae575b61239d8183610559565b810190613859565b9290925f61217a565b503d612393565b80611e235f6123c393610559565b5f6120f6565b7f4df06de3000000000000000000000000000000000000000000000000000000005f5260045ffd5b7f8285c4ef000000000000000000000000000000000000000000000000000000005f5260045ffd5b506001600160a01b036001541633141561204b565b60403660031901126103395760043560243567ffffffffffffffff81116103395761245d903690600401611248565b9061246782613f61565b34106126855761247682615331565b90506124a96124a561249e83600a61248f879897610ddf565b5001905f5260205260405f2090565b5460ff1690565b1590565b61265d57600754926125675f600a6124bf6150b5565b503360601b6bffffffffffffffffffffffff19166001600160601b03861617815542600282015561254061253861250e60036125066125006109a58c611ec2565b99610ddf565b50940161391b565b509261251e6004820154346132ec565b9860038501998a55845560036002820154910154906132c5565b612710900490565b600182015534600282015501906001600160a01b03166001600160a01b0319825416179055565b61257c6109b86004546001600160a01b031690565b90813b156103395760405163d09f392d60e01b8152600481018690525f6024820181905290928390604490829084905af1918215610a4b576001600160a01b0392612649575b5016905490803b15610339576125f3945f8094604051978895869485936302dbb79560e61b85528a6004860161393c565b03925af1918215610a4b57602092612635575b5033817f141dfc18aa6a56fc816f44f0e9e2f1ebc92b15ab167770e17db5b084c10ed9955f80a3604051908152f35b80611e235f61264393610559565b5f612606565b80611e235f61265793610559565b5f6125c2565b7fb34eb75d000000000000000000000000000000000000000000000000000000005f5260045ffd5b7f38cd83c4000000000000000000000000000000000000000000000000000000005f5260045ffd5b34610339576020366003190112610339576004356126ca81610328565b6001600160a01b035f54163303610389576001600160a01b03166001600160a01b031960035416176003555f80f35b60603660031901126103395760043560243560443567ffffffffffffffff81116103395761272b903690600401611248565b6127348361352c565b3410612b1157612743836115b1565b5091600183016003612756825460ff1690565b61275f816115e1565b03612ae9576003840161277b6127758254613214565b8261323f565b509081546127916109b86109b86109a584611ec2565b3303612ac15786546001600160601b031681946127ad8461391b565b5092600386015460056127bf85610ddf565b50015411156129fa575b5088546bffffffffffffffffffffffff19166001600160601b03831617895561280691906127fb90805460ff19169055565b4260028a0155610ddf565b509361283461253861281c6004880154346132ec565b966003850197885560036002820154910154906132c5565b600183015534600283015581556128566109b86004546001600160a01b031690565b6128608354613214565b90803b156103395760405163d09f392d60e01b8152600481018b905260248101929092525f908290604490829084905af18015610a4b576129e6575b5054915490818303612915575b877f4e6f5cf43b95303e86aee81683df63992061723a829ee012db21dad388756b916001600160a01b036128de8a5460601c90565b1660405190837f9c9b64db9e130f48381bf697abf638e73117dbfbfd7a4484f2da3ba188f4187d5f80a35f81528060208101610837565b61295d926109b89261292a6109a59354613214565b6040518381528b907fcbe7939a71f0b369c7471d760a0a99b60b7bb010ee0406cba8a46679d1ea775690602090a4611ec2565b905490803b156103395761298c935f8094604051968795869485936302dbb79560e61b85528c6004860161393c565b03925af18015610a4b577f4e6f5cf43b95303e86aee81683df63992061723a829ee012db21dad388756b91926001600160a01b03926128de926129d2575b8194816128a9565b80611e235f6129e093610559565b5f6129ca565b80611e235f6129f493610559565b5f61289c565b916124a561249e612a1e612a10612a2a94610ddf565b50546001600160601b031690565b94600a61248f87610ddf565b612ab8575b906127fb61280692612a488b546001600160601b031690565b6001600160601b0381166001600160601b03851603612a6b575b509192506127c9565b612a758754613214565b6040516001600160601b03868116825292909216918e907f736e3f52761298c8c0823e1ebf482ed3c5ecb304f743d2d91a7c006e8e8d7a1f90602090a45f612a62565b60019550612a2f565b7f065f245f000000000000000000000000000000000000000000000000000000005f5260045ffd5b7fdf37bf2c000000000000000000000000000000000000000000000000000000005f5260045ffd5b7f3191f8f1000000000000000000000000000000000000000000000000000000005f5260045ffd5b34610339576020366003190112610339576003612b576004356115b1565b500180545f198101908111612b7457611ae560039160209361323f565b613200565b34610339575f3660031901126103395760206001600160a01b0360035416604051908152f35b3461033957602036600319011261033957600435612bbc81610328565b6001600160a01b035f54163303610389576001600160a01b0360065491612be281613963565b16907f44063d258760b98116d53815adbc906a56b3563e540148cc0fc2457f83b5eeb25f80a3005b34610339575f366003190112610339576020600654604051908152f35b346103395761016036600319011261033957600435612c4581610410565b602435612c5181610612565b604435606435906084359260a43591612c69366118f9565b956101443567ffffffffffffffff811161033957612c8b9036906004016105b5565b966001600160a01b035f5416330361038957826002612ca984610ddf565b50015411611a6d57875115612ea2576001600160601b038216948515612e7a5760059796975491612cd86139cb565b50915f98600a8401995b8c51811015612d54578c81612cf781836131ec565b5115918215612d3d575b50506106bc5780612d37612d2a8f612d1d8f91956001966131ec565b515f5260205260405f2090565b805460ff19166001179055565b01612ce2565b612d4792506131ec565b516006541115818e612d01565b50908b92918b612d726124a561249e8e60015f5260205260405f2090565b612e52577f550ff678017abc294b4786a99a046628d5a1eac07be0f1ea7e89543f13576ee698612e3f886001612e388c8f8a6001600160601b039f8e612e4d9f61078294612ddb600694612e1a93906001600160601b03166001600160601b0319825416179055565b612dee612de66139fd565b8a8501613a18565b82546cff000000000000000000000000191690151560601b6cff00000000000000000000000016178255565b8960028201558a60038201558b60048201558c6005820155016135fa565b5001613a96565b604051988998169a88613aca565b0390a3005b7f31a8d9e8000000000000000000000000000000000000000000000000000000005f5260045ffd5b7f1ef4f649000000000000000000000000000000000000000000000000000000005f5260045ffd5b7f402585f5000000000000000000000000000000000000000000000000000000005f5260045ffd5b9181601f840112156103395782359167ffffffffffffffff8311610339576020838186019501011161033957565b346103395760403660031901126103395760043567ffffffffffffffff811161033957610d66612f4a612f4f612f346020943690600401612eca565b929060243593612f4385610328565b3691611212565b613f61565b906132fb565b34610339576101e036600319011261033957600435612f7381610328565b60243590612f8082610328565b604435612f8c81610328565b606435612f9881610328565b608435612fa481610328565b60a43590612fb182610612565b612fba366118f9565b923661016312156103395760405194612fd4608087610559565b8597366101c41161033957610144985b6101c48a10613006575061046998506101c4359761300189610328565b613b38565b893581526020998a019901612fe4565b346103395760803660031901126103395760043560243567ffffffffffffffff81116103395761304a903690600401612eca565b9160443561305781610328565b606435916001600160a01b0382165f52600860205261307d6124a560405f205460ff1690565b61310157613098613092612f4a368888611212565b836132fb565b8310612685576130ad6124a5843033866152d4565b6130d9576130c36130c994610e7c963691611212565b906150e7565b6040519081529081906020820190565b7f90b8ec18000000000000000000000000000000000000000000000000000000005f5260045ffd5b7fe51cf7bf000000000000000000000000000000000000000000000000000000005f5260045ffd5b346103395760203660031901126103395760043567ffffffffffffffff811161033957610d66612f4a6020923690600401611248565b34610339575f3660031901126103395760206001600160a01b0360025416604051908152f35b346103395760203660031901126103395760206003611ae56004356115b1565b3461033957604036600319011261033957600a6004356131c481610410565b6131d060243591610ddf565b50905f5201602052602060ff60405f2054166040519015158152f35b8051821015610dfb5760209160051b010190565b634e487b7160e01b5f52601160045260245ffd5b5f19810191908211612b7457565b61271003906127108211612b7457565b91908203918211612b7457565b8054821015610dfb575f52601660205f20910201905f90565b6004821015610dfb5701905f90565b90816020910312610339575161126381610612565b6040513d5f823e3d90fd5b9060058110156115eb5760ff80198354169116179055565b60208101929161058b91906115f0565b908160011b9180830460021490151715612b7457565b81810292918115918404141715612b7457565b634e487b7160e01b5f52601260045260245ffd5b81156132f6570490565b6132d8565b6001600160a01b031690815f52600860205260ff60405f205460481c1690604d8211612b745761332e91600a0a906132c5565b905f52600860205267ffffffffffffffff60405f205460081c169081156132f6570490565b61335c906115b1565b506003810180545f198101908111612b74576133836001600160601b039161338c9361323f565b50925416610ddf565b509060038101546005830154116133c9576133b26001600160601b03600a935416610ddf565b5090545f520160205260ff60405f20541615151590565b50505f90565b9081606091031261033957805191604060208301516133ed81610612565b92015161126381610612565b6003613404826115b1565b500180545f19810192908311612b745761344c6001600160a01b036134386134316134859660609661323f565b5054611ec2565b90549060031b1c166001600160a01b031690565b60405180809581947f1c3db16d000000000000000000000000000000000000000000000000000000008352600483019190602083019252565b03915afa908115610a4b575f915f915f916134a1575b50909192565b9150506134c6915060603d6060116134cc575b6134be8183610559565b8101906133cf565b5f61349b565b503d6134b4565b9060018201809211612b7457565b91908201809211612b7457565b90816020910312610339575190565b3d15613527573d9061350e826111f6565b9161351c6040519384610559565b82523d5f602084013e565b606090565b613535906115b1565b5061355f6135506003830161354a8154613214565b9061323f565b5091546001600160601b031690565b600361356a82610ddf565b50920154600583015490919082106135e5576001600160601b03166001036135b25750507f7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff90565b6135df6135da60046135d161078261126396546001600160601b031690565b500154926132af565b6134d3565b906132c5565b506135df6135da6004611263940154926132af565b905f5b6004811061360a57505050565b6001906020835193019281850155016135fd565b919360a09361058b969298979561012085019915158552602085015260408401526060830152608082015201906110fd565b90604051918281549182825260208201905f5260205f20925f5b81811061367f57505061058b92500383610559565b84546001600160a01b031683526001948501948794506020909301920161366a565b604051815480825290929183906136bf60208301915f5260205f2090565b925f905b80600183011061371a5761058b945491818110613700575b106136e9575b500383610559565b60601c6001600160601b031681526020015f6136e1565b6001600160601b03831684529260019060200193016136db565b91600291935060406001916137588754613745836001600160601b0383166001600160601b03169052565b60601c6001600160601b03166020830152565b0194019201859293916136c3565b60405191905f835b600a82106137855750505061058b61014083610559565b600160208192855481520193019101909161376e565b90613851600c6137a961058d565b938054855260018101546020860152600281015460408601526003810154606086015260048101546080860152600581015460a08601526137ec60068201613650565b60c08601526137fd600782016136a1565b60e08601526008810154610100860152600981015461012086015261384061382f600a8301546001600160a01b031690565b6001600160a01b0316610140870152565b600b81015461016086015201613766565b610180830152565b9190826040910312610339576020825161387281610328565b92015161126381610410565b90815491600160401b83101561055457826138a191600161058b95018155611eda565b9091906001600160a01b038084549260031b9316831b921b1916179055565b9190918054831015610dfb575f52600c600160205f2084821c0193160290565b8054600160401b811015610554576138fd916001820181556138c0565b6001600160601b0380839493549260031b9316831b921b1916179055565b8054600160401b811015610554576139389160018201815561323f565b9091565b94939260609261395e928752602087015260806040870152608086019061152e565b930152565b60065490600160401b8210156105545760018201600655600654821015610dfb5760065f527ff652222313e28459528d920b65115c16c04f3efc82aaedc97be59f3f377c0d3f90910180546001600160a01b0319166001600160a01b03909216919091179055565b600554600160401b8110156105545760018101600555600554811015610dfb5760055f52601560205f20910201905f90565b60405190613a0c602083610559565b5f808352366020840137565b81519167ffffffffffffffff831161055457600160401b8311610554578154838355808410613a70575b50602001905f5260205f205f5b838110613a5c5750505050565b600190602084519401938184015501613a4f565b825f528360205f2091820191015b818110613a8b5750613a42565b5f8155600101613a7e565b8054600160401b81101561055457613ab391600182018155611eda565b819291549060031b91821b915f19901b1916179055565b929461016094602096613b0194989398610140870199151587528887015260408601526060850152608084015260a08301906110fd565b6101406101208201528451809452019201905f5b818110613b225750505090565b8251845260209384019390920191600101613b15565b96949290979593917ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e5498613b84613b7660ff8c60401c1615151590565b9a67ffffffffffffffff1690565b8a80613d37575b159081613d0f575b50613ce757613bfd988a613bf4600167ffffffffffffffff197ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e5416177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e55565b613c8757613d79565b613c0357565b613c5868ff0000000000000000197ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e54167ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e55565b604051600181527fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d290602090a1565b613ce2600160401b68ff0000000000000000197ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e5416177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e55565b613d79565b7f0dc149f0000000000000000000000000000000000000000000000000000000005f5260045ffd5b303b15915081613d22575b50155f613b93565b6001915067ffffffffffffffff16145f613d1a565b50600167ffffffffffffffff821610613b8b565b600654600160401b8110156105545760018101600655600654811015610dfb5760065f5260205f2001905f90565b93613e516001600160601b039699613e35613f5696613e1960019c97613dfd6001600160a01b0398613de17f550ff678017abc294b4786a99a046628d5a1eac07be0f1ea7e89543f13576ee69f9d6001600160a01b03166001600160a01b03195f5416175f55565b6001600160a01b03166001600160a01b03196001541617600155565b6001600160a01b03166001600160a01b03196002541617600255565b6001600160a01b03166001600160a01b03196003541617600355565b6001600160a01b03166001600160a01b03196004541617600455565b613e59613d4b565b5050613e6481613963565b16867f44063d258760b98116d53815adbc906a56b3563e540148cc0fc2457f83b5eeb25f80a3613e926139cb565b5050613e9c6139cb565b5080546bffffffffffffffffffffffff1916815590613ec4613ebc6139fd565b888401613a18565b81546cff000000000000000000000000191688151560601b6cff0000000000000000000000001617825583516002830155602084018051600384015591604085018051600483015590613f36606087019182516005820155613f2985600683016135fa565b546001600160601b031690565b955193519151905191613f476139fd565b94604051988998169b88613aca565b0390a361058b61443c565b613f7a6004613f7261126393615331565b509290610ddf565b5001546132c5565b908160609103126103395780519160406020830151920151600a8110156103395790565b600a11156115eb57565b906001600160601b03811680159081156141f6575b506141e957821515806141d3575b6141c657613fec6109b86004546001600160a01b031690565b60405163c70ba3b960e01b81526001600160a01b03841660048201526001600160601b038316602482015260448101859052600160648201529390606090859060849082905f905af1918215610a4b575f925f955f9161418d575b5061405181613fa6565b8061417c575082614147575b84614110575b6140786109b86004546001600160a01b031690565b91823b15610339576040517faac03ad20000000000000000000000000000000000000000000000000000000081526001600160a01b0390951660048601526001600160601b039091166024850152604484019290925260648301939093526084820152905f90829081838160a4810103925af18015610a4b576140fc575b50600190565b80611e235f61410a93610559565b5f6140f6565b61412f6124a5868661412a6002546001600160a01b031690565b61500d565b156140635750505050506141436001615422565b5f90565b6141686124a5846141606002546001600160a01b031690565b8730916152d4565b1561405d5750505050506141436001615402565b935050505061414391506001615442565b919350506141b491945060603d6060116141bf575b6141ac8183610559565b810190613f82565b94919290945f614047565b503d6141a2565b50505061414360016153e2565b5060026141df82610ddf565b5001548310613fd3565b50505061414360016153c2565b905060055411155f613fc5565b906001600160601b038116801590811561438a575b5061437e5782151580614368575b61435c5761423f6109b86004546001600160a01b031690565b60405163c70ba3b960e01b81526001600160a01b03841660048201526001600160601b0383166024820152604481018590525f60648201819052909491606091869160849183915af1918215610a4b575f925f955f91614333575b506142a481613fa6565b806143235750826142f7575b846142ca576140786109b86004546001600160a01b031690565b6142e46124a5868661412a6002546001600160a01b031690565b156140635750505050506141435f615422565b6143106124a5846141606002546001600160a01b031690565b156142b05750505050506141435f615402565b935050505061414391505f615442565b9193505061435191945060603d6060116141bf576141ac8183610559565b94919290945f61429a565b5050506141435f6153e2565b50600261437482610ddf565b5001548310614226565b5050506141435f6153c2565b905060055411155f614218565b906001600160601b035f92600a6143ad82610ddf565b508486520160205260408420805460ff19169055167fb47629acdf64971062d40984f77d3dee212d735b11e3e8c7a4222d9f0572cc798380a4565b906001600160601b03600192600a6143ff82610ddf565b50845f520160205260405f208460ff19825416179055167fb47629acdf64971062d40984f77d3dee212d735b11e3e8c7a4222d9f0572cc795f80a4565b600a6144486001610ddf565b5060015f520160205260405f20600160ff19825416179055600180807fb47629acdf64971062d40984f77d3dee212d735b11e3e8c7a4222d9f0572cc795f80a4565b81156132f6570690565b9190826040910312610339576020825192015190565b6144b481516115b1565b50906144c760208201516003840161323f565b50916144d96109b86109a58554611ec2565b9060408351926020850151906144f860e087015160608801519061448a565b608087015160a088015185517f9d61ab6e00000000000000000000000000000000000000000000000000000000815260048101989098526024880194909452604487019190915260648601526084850191909152839060a49082905afa8015610a4b575f925f916149c4575b50918261271082116149ba575b612710106149b0575b61459c6109a561459360e087015160608801519061448a565b60068801611eda565b926145ae6125388360018901546132c5565b936145c46109b86004546001600160a01b031690565b803b156103395760405163965af6c760e01b81526001600160a01b038316600482015260248101969096525f908690604490829084905af1908115610a4b576002956147279261499c575b5060208861465f6125388661463a8c61463f6125388c61463a604060c08601519501948551906132ec565b6132c5565b9c866146508f6009819a01546134e1565b600982015501549051906132ec565b9661466e8860088d01546134e1565b60088c0155600a8b01546001600160a01b031688858261498d575090505f8115614984575b5f80809381936001600160a01b038a1690f1505b6146cd6146bf6109b86004546001600160a01b031690565b91546001600160601b031690565b5f6040518097819582947f664bffc300000000000000000000000000000000000000000000000000000000845289600485016001600160601b036040929594936001600160a01b0360608401971683521660208201520152565b03925af1918215610a4b577fa90d30adac7f21a7def444f0fe0a60bdf16d7e8415973dd09bf869db8f94d58e936001600160a01b03936147bf925f91614965575b5015614948575b88519660208a01519861478c600a8d01546001600160a01b031690565b60408051998a5260208a01949094529288015260608701526001600160a01b0316608086015291169290819060a0820190565b0390a460e08101516147dc6147d760608401516132af565b613214565b146147e5575050565b6147f860c0820151600984015490613232565b61480b6002840154600885015490613232565b8115918215809361493f575b614823575b5050505050565b7f6cecfd3ec56289ccb16e30eb194f9a87dfdc12630b9abbc31fc69af5a0b0eaf492614913575b81801580156148a9575b505061489c614874600a602087519701519701546001600160a01b031690565b604051938493849160409194936001600160a01b039160608501968552602085015216910152565b0390a35f8080808061481c565b600a8701546001600160a01b0316806148f557505f80809381936148da6109b86109b885546001600160a01b031690565b9083906148ec575bf1505b815f614854565b506108fc6148e2565b5f5461490d9392506001600160a01b03165b9061500d565b506148e5565b614939816149296002546001600160a01b031690565b5f546001600160a01b0316614907565b5061484a565b50811515614817565b61495f888461412a6002546001600160a01b031690565b5061476f565b61497e915060203d602011610a4457610a368183610559565b5f614768565b506108fc614693565b6149969261500d565b506146a7565b80611e235f6149aa93610559565b5f61460f565b612710925061457a565b6127109150614571565b90506149e991925060403d6040116149f2575b6149e18183610559565b810190614494565b9190915f614564565b503d6149d7565b90816060910312610339578051916040602083015192015190565b7f80000000000000000000000000000000000000000000000000000000000000008114612b74575f0390565b614a4a81516115b1565b50614a5e602083019160038351910161323f565b5090614a706109b86109a58454611ec2565b8351825160e086018051608088015160a08901516040517f149a5dc0000000000000000000000000000000000000000000000000000000008152600481019690965260248601949094526044850191909152606484015260848301919091529094919060208660a481855afa958615610a4b575f96614fec575b506127108611614fe2575b614b0961253860018701546135df89613222565b614b1a6109a5835160068901611eda565b614b2f6109b86004546001600160a01b031690565b803b156103395760405163965af6c760e01b81526001600160a01b038316600482015260248101849052905f908290604490829084905af18015610a4b57614fce575b505f6060614c0e614b9d614b8a875160078d016138c0565b90546001600160601b039160031b1c1690565b94614bb36109b86004546001600160a01b031690565b906040519485809481937f771a27cb0000000000000000000000000000000000000000000000000000000083528a8a600485016001600160601b036040929594936001600160a01b0360608401971683521660208201520152565b03925af1948515610a4b5788955f905f935f91614f97575b508960c08a019c8d614c398482516134e1565b90527fa90d30adac7f21a7def444f0fe0a60bdf16d7e8415973dd09bf869db8f94d58e600a614c6b8d51945195614a14565b9b019a614c7f8c546001600160a01b031690565b6040805185815260208101959095528401919091525f60608401526001600160a01b03908116608084015288169160a090a415908115614f13575b5015614e6357509050614cd86109b86004546001600160a01b031690565b803b15610339576040517faa9ebfb70000000000000000000000000000000000000000000000000000000081526001600160a01b039290921660048301525f908290602490829084905af18015610a4b57614e4f575b505b51614d3e6060840151613214565b1480614e43575b614d52575b505050505190565b7f6cecfd3ec56289ccb16e30eb194f9a87dfdc12630b9abbc31fc69af5a0b0eaf491614d8582546001600160a01b031690565b6001600160a01b038116614e1d57505f808080614daf6109b86109b883546001600160a01b031690565b60028a015490828215614e14575bf1505b614de8614dd56002546001600160a01b031690565b5f546001600160a01b031688519161500d565b5051925193614e086148746002885193015493546001600160a01b031690565b0390a35f808080614d4a565b506108fc614dbd565b614e3d90614e325f546001600160a01b031690565b60028801549161500d565b50614dc0565b50604082015115614d45565b80611e235f614e5d93610559565b5f614d2e565b6002614e6e84610ddf565b50015411614e7e575b5050614d30565b614e936109b86004546001600160a01b031690565b91823b15610339576040517f9d5608670000000000000000000000000000000000000000000000000000000081526001600160a01b039290921660048301526001600160601b03166024820152905f908290604490829084905af18015610a4b57614eff575b80614e77565b80611e235f614f0d93610559565b5f614ef9565b8751895187516040517fba66fde70000000000000000000000000000000000000000000000000000000081526004810193909352602483019190915260448201529150602090829060649082905afa908115610a4b575f91614f78575b50155f614cba565b614f91915060203d602011610a4457610a368183610559565b5f614f70565b915050614fbd91925060603d606011614fc7575b614fb58183610559565b8101906149f9565b929190925f614c26565b503d614fab565b80611e235f614fdc93610559565b5f614b72565b6127109550614af5565b61500691965060203d60201161109e5761108f8183610559565b945f614aea565b6040517fa9059cbb00000000000000000000000000000000000000000000000000000000602082019081526001600160a01b0393841660248301526044808301959095529381525f9384939091849190615068606482610559565b5193165af16150756134fd565b8161507e575090565b805180159250821561508f57505090565b6112639250602080918301019101613267565b6001600160a01b035f5416330361038957565b600754600160401b8110156105545760018101600755600754811015610dfb5760075f52600e60205f20910201905f90565b90919392936150f583615331565b92905061510d6124a561249e85600a61248f87610ddf565b61265d576151d290600a600754986151236150b5565b503360601b6bffffffffffffffffffffffff19166001600160601b038716178155426002820155906151ac612538615173600361516b6151656109a58d611ec2565b9a610ddf565b50950161391b565b50936001600160a01b0387166152be5761519260048201545b856132ec565b99600386019a8b55855560036002820154910154906132c5565b6001830155600282015501906001600160a01b03166001600160a01b0319825416179055565b6151e76109b86004546001600160a01b031690565b90813b156103395760405163d09f392d60e01b8152600481018890525f6024820181905290928390604490829084905af1918215610a4b576001600160a01b03926152aa575b5016905490803b156103395761525e935f8094604051968795869485936302dbb79560e61b85528c6004860161393c565b03925af18015610a4b57615296575b5033827f141dfc18aa6a56fc816f44f0e9e2f1ebc92b15ab167770e17db5b084c10ed9955f80a3565b80611e235f6152a493610559565b5f61526d565b80611e235f6152b893610559565b5f61522d565b6151926152cf6004830154896132fb565b61518c565b905f6001600160a01b03819594829582604051928160208501977f23b872dd000000000000000000000000000000000000000000000000000000008952166024850152166044830152606482015260648152615068608482610559565b80516040116153ac5760208101519160606040830151920151906001600160601b038416801590811561539f575b50615396575b821561538d575b81158015615381575b61537b57565b60019150565b50600654821015615375565b6003925061536c565b60019350615365565b905060055411155f61535f565b50600190600390600190565b600211156115eb57565b6001906153ce816153b8565b1461058b57637c84af5160e01b5f5260045ffd5b6001906153ee816153b8565b1461058b57630caac6b360e31b5f5260045ffd5b60019061540e816153b8565b1461058b57630f323ed960e11b5f5260045ffd5b60019061542e816153b8565b1461058b5763e45e13a360e01b5f5260045ffd5b60019061544e816153b8565b146155475761545c81613fa6565b600281146155385761546d81613fa6565b600381146155295761547e81613fa6565b600481146155015761548f81613fa6565b600581146154f2576154a081613fa6565b600681146154e357806154b4600992613fa6565b146154bb57565b7ff95e58bc000000000000000000000000000000000000000000000000000000005f5260045ffd5b630caac6b360e31b5f5260045ffd5b637c84af5160e01b5f5260045ffd5b7fec8e8768000000000000000000000000000000000000000000000000000000005f5260045ffd5b63e45e13a360e01b5f5260045ffd5b630f323ed960e11b5f5260045ffd5b5056fea26469706673582212209d8693ceca011df52e9dd63f6056bbcd764f392dc1976d1654c7a6599b67d72c64736f6c634300081e0033f0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e",
+  "deployedBytecode": "0x60806040526004361015610011575f80fd5b5f3560e01c8062f5822c146103235780630219da791461031e5780630761c14d1461031957806309cfdc9c146103145780630b7414bc1461030f578063115d53761461030a5780631860592b1461030557806319b81529146103005780631c3db16d146102fb5780631f5a0dd2146102f65780632d29a47b146102f15780632e1daf2f146102ec5780633cfd1184146102e757806342c37fa3146102e25780634f1ef286146102dd57806352d1902d146102d857806354fd4d50146102d3578063564a565d146102ce57806359ec827e146102c95780636a8c9194146102c457806371ae413d146102bf5780637717a6e8146102ba5780637934c0be146102b557806382d02237146102b057806386541b24146102ab57806386cdecef146102a65780638a9bb02a146102a15780638bb048751461029c5780638da5cb5b14610297578063a6f9dae114610292578063acdbf51d1461028d578063afe15cfb14610288578063b004963714610283578063b702a8791461027e578063c13517e114610279578063c258bb1914610274578063c35699021461026f578063c71f42531461026a578063cf0c38f814610265578063d07368bd14610260578063d4d1d76a1461025b578063d874514b14610256578063d98493f614610251578063e399d29b1461024c578063f6506db414610247578063f7434ea914610242578063fbf405b01461023d578063fc6f8f16146102385763fe524c3914610233575f80fd5b6131a5565b613185565b61315f565b613129565b613016565b612f55565b612ef8565b612c27565b612c0a565b612b9f565b612b79565b612b39565b6126f9565b6126ad565b61242e565b612017565b611fcb565b611f48565b611eef565b611e76565b611e51565b611d02565b611c54565b611ab6565b61193d565b61180d565b611784565b61175a565b611734565b61169e565b611680565b6115fd565b611552565b6114c4565b611266565b6111af565b611134565b6110d7565b610e80565b610e00565b610d96565b610d6e565b610d3b565b610750565b61061c565b610493565b610421565b6103b1565b61033d565b6001600160a01b0381160361033957565b5f80fd5b346103395760203660031901126103395760043561035a81610328565b6001600160a01b035f54163303610389576001600160a01b03166001600160a01b031960025416176002555f80f35b7f596dcdb8000000000000000000000000000000000000000000000000000000005f5260045ffd5b34610339576020366003190112610339576001600160a01b036004356103d681610328565b165f526008602052606060405f205460ff604051918181161515835267ffffffffffffffff8160081c16602084015260481c166040820152f35b6001600160601b0381160361033957565b346103395760603660031901126103395760043561043e81610328565b60243561044a81610410565b604435906001600160a01b0360045416330361046b5761046992613fb0565b005b7f9d6cab99000000000000000000000000000000000000000000000000000000005f5260045ffd5b34610339576020366003190112610339576004356104b081610328565b6001600160a01b035f54163314158061050e575b6104e6576001600160a01b03166001600160a01b031960015416176001555f80f35b7ff10d23b5000000000000000000000000000000000000000000000000000000005f5260045ffd5b506001600160a01b03600154163314156104c4565b634e487b7160e01b5f52604160045260245ffd5b6101a0810190811067ffffffffffffffff82111761055457604052565b610523565b90601f8019910116810190811067ffffffffffffffff82111761055457604052565b6040519061058b61010083610559565b565b6040519061058b6101a083610559565b67ffffffffffffffff81116105545760051b60200190565b9080601f830112156103395781356105cc8161059d565b926105da6040519485610559565b81845260208085019260051b82010192831161033957602001905b8282106106025750505090565b81358152602091820191016105f5565b8015150361033957565b346103395760603660031901126103395760043561063981610410565b60243567ffffffffffffffff8111610339576106599036906004016105b5565b6044359061066682610612565b6001600160a01b035f54163303610389575f5b81518110156104695782156106fa5761069281836131ec565b511580156106e4575b6106bc57806106b66106af600193856131ec565b51866143e8565b01610679565b7f7ab15312000000000000000000000000000000000000000000000000000000005f5260045ffd5b506106ef81836131ec565b51600654111561069b565b600161070682846131ec565b5114610728578061072361071c600193856131ec565b5186614397565b6106b6565b7fada223fa000000000000000000000000000000000000000000000000000000005f5260045ffd5b346103395760203660031901126103395760043561076d816115b1565b5061078761078282546001600160601b031690565b610ddf565b509060038101916107a261079b8454613214565b809461323f565b5060018301936107b3855460ff1690565b6107bc816115e1565b806108d857501580610896575b61086e57600360068201549101540361084657547f4e6f5cf43b95303e86aee81683df63992061723a829ee012db21dad388756b91926108379261082b9260601c60ff161561083c5761081e60015b83613287565b6002429101555460ff1690565b6040519182918261329f565b0390a2005b61081e6002610818565b7f9e4486b0000000000000000000000000000000000000000000000000000000005f5260045ffd5b7f3e9727df000000000000000000000000000000000000000000000000000000005f5260045ffd5b506108a5600284015442613232565b6108d26108c86108b6875460ff1690565b6108bf816115e1565b60068601613258565b90549060031b1c90565b116107c9565b90506108e9819594959392936115e1565b60018103610a5057506109246108c8610906600287015442613232565b926006610914875460ff1690565b9161091e836115e1565b01613258565b119081610993575b5061096b57805460ff191660021781557f4e6f5cf43b95303e86aee81683df63992061723a829ee012db21dad388756b91916108379161082b9161081e565b7f9bf4af0a000000000000000000000000000000000000000000000000000000005f5260045ffd5b6109c491506109a56109b89154611ec2565b90546001600160a01b039160031b1c1690565b6001600160a01b031690565b602060405180927f0baa64d10000000000000000000000000000000000000000000000000000000082528180610a0289600483019190602083019252565b03915afa908115610a4b575f91610a1c575b50155f61092c565b610a3e915060203d602011610a44575b610a368183610559565b810190613267565b5f610a14565b503d610a2c565b61327c565b610a59816115e1565b60028103610ba75750610a766108c8610906600287015442613232565b119081610b1e575b50610af657805460ff191660031781557f4e6f5cf43b95303e86aee81683df63992061723a829ee012db21dad388756b91916108379161082b916001600160a01b03610acb825460601c90565b16867fa5d41b970d849372be1da1481ffd78d162bfe57a7aa2fe4e5fb73481fa5ac24f5f80a361081e565b7fcc46f568000000000000000000000000000000000000000000000000000000005f5260045ffd5b610b3091506109a56109b89154611ec2565b602060405180927f6d4cd8ea0000000000000000000000000000000000000000000000000000000082528180610b6e89600483019190602083019252565b03915afa908115610a4b575f91610b88575b50155f610a7e565b610ba1915060203d602011610a4457610a368183610559565b5f610b80565b610bb0816115e1565b60038103610cd1576108c8610bd9916006610bcf600289015442613232565b9461091e836115e1565b119081610c48575b50610c2057805460ff191660041781557f4e6f5cf43b95303e86aee81683df63992061723a829ee012db21dad388756b91916108379161082b9161081e565b7f2f4dfd87000000000000000000000000000000000000000000000000000000005f5260045ffd5b610c5a91506109a56109b89154611ec2565b602060405180927f0855bbe90000000000000000000000000000000000000000000000000000000082528180610c9889600483019190602083019252565b03915afa908115610a4b575f91610cb2575b50155f610be1565b610ccb915060203d602011610a4457610a368183610559565b5f610caa565b905060049150610ce0816115e1565b14610d135761082b610837917f4e6f5cf43b95303e86aee81683df63992061723a829ee012db21dad388756b919361081e565b7f0fe7191e000000000000000000000000000000000000000000000000000000005f5260045ffd5b34610339576040366003190112610339576020610d66600435610d5d81610328565b602435906132fb565b604051908152f35b34610339576020366003190112610339576020610d8c600435613353565b6040519015158152f35b34610339576020366003190112610339576060610db46004356133f9565b906040519283521515602083015215156040820152f35b634e487b7160e01b5f52603260045260245ffd5b600554811015610dfb5760055f52601560205f20910201905f90565b610dcb565b346103395760203660031901126103395760043560055481101561033957610e2790610ddf565b508054600282015460038301546004840154600590940154604080516001600160601b0386168152606095861c60ff16151560208201529081019390935292820152608081019290925260a08201528060c081015b0390f35b3461033957606036600319011261033957600435604435602435610ea3836115b1565b506004610eb4600183015460ff1690565b610ebd816115e1565b036110a557816003610ecf920161323f565b50906004820193610ee2855494856134e1565b926005810194855496600683015490610eff8260028601546132ec565b92610f156109b86109a560018801549754611ec2565b6040517fda3beb8c00000000000000000000000000000000000000000000000000000000815260048101889052602481018990529290602090849060449082905afa928315610a4b575f93611074575b50826110455783891161103c575b9780979695949392985b55965b868810610f9657898981815403610f9357005b55005b9091929394959698828a105f14610ff657610fe7600191610fb561057b565b908882528960208301528460408301528560608301528660808301528760a083015260c08201528b60e0820152614a40565b995b0196959493929190610f80565b9860019061103761100561057b565b8881528960208201528460408201528560608201528660808201528760a08201528c60c08201528260e08201526144aa565b610fe9565b97508297610f73565b61104e846132af565b8911611063575b978097969594939298610f7d565b975061106e836132af565b97611055565b61109791935060203d60201161109e575b61108f8183610559565b8101906134ee565b915f610f65565b503d611085565b7f8794ce4b000000000000000000000000000000000000000000000000000000005f5260045ffd5b5f91031261033957565b34610339575f3660031901126103395760206001600160a01b0360045416604051908152f35b905f905b6004821061110e57505050565b6020806001928551815201930191019091611101565b60808101929161058b91906110fd565b346103395760203660031901126103395761116b60043561115481610410565b60806040516111638282610559565b369037610ddf565b50604051906006015f825b6004821061119957610e7c8461118d608082610559565b60405191829182611124565b6001602081928554815201930191019091611176565b34610339576040366003190112610339576004356111cc81610328565b6024356001600160a01b0360045416330361046b57610469916001600160a01b036002541661500d565b67ffffffffffffffff811161055457601f01601f191660200190565b92919261121e826111f6565b9161122c6040519384610559565b829481845281830111610339578281602093845f960137010152565b9080601f830112156103395781602061126393359101611212565b90565b60403660031901126103395760043561127e81610328565b60243567ffffffffffffffff81116103395761129e903690600401611248565b6112a66150a2565b6001600160a01b037f000000000000000000000000000000000000000000000000000000000000000016803014908115611489575b50611461576001600160a01b0382166040517f52d1902d000000000000000000000000000000000000000000000000000000008152602081600481855afa5f9181611440575b5061135b577f0c760937000000000000000000000000000000000000000000000000000000005f526001600160a01b03841660045260245ffd5b7f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc81036114155750827f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc557fbc7cd75a20ee27fd9adebab32041f755214dbc6bffa90cc0225b39da2e5c2d3b5f80a28051806113d357005b5f926020849301905af46113e56134fd565b50156113ed57005b7f736436ba000000000000000000000000000000000000000000000000000000005f5260045ffd5b7faa1d49a4000000000000000000000000000000000000000000000000000000005f5260045260245ffd5b61145a91925060203d60201161109e5761108f8183610559565b905f611321565b7fe07c8dba000000000000000000000000000000000000000000000000000000005f5260045ffd5b90506114bc7f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc546001600160a01b031690565b14155f6112db565b34610339575f366003190112610339576001600160a01b037f00000000000000000000000000000000000000000000000000000000000000001630036114615760206040517f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc8152f35b805180835260209291819084018484015e5f828201840152601f01601f1916010190565b34610339575f36600319011261033957610e7c604051611573604082610559565b600581527f322e302e30000000000000000000000000000000000000000000000000000000602082015260405191829160208352602083019061152e565b600754811015610dfb5760075f52600e60205f20910201905f90565b634e487b7160e01b5f52602160045260245ffd5b600511156115eb57565b6115cd565b9060058210156115eb5752565b34610339576020366003190112610339576004356007548110156103395761162660ff916115b1565b508054600260018301549201546040519384936001600160a01b0360a08601946001600160601b0380821616875260601c16602086015261166c604086018383166115f0565b60081c161515606084015260808301520390f35b34610339576020366003190112610339576020610d6660043561352c565b34610339576060366003190112610339576004356116bb81610328565b60243560443567ffffffffffffffff8111610339576116de903690600401611248565b6001600160a01b035f54163303610389575f928392602083519301915af16117046134fd565b501561170c57005b7f44125e5e000000000000000000000000000000000000000000000000000000005f5260045ffd5b34610339575f3660031901126103395760206001600160a01b0360015416604051908152f35b346103395760403660031901126103395761046960043561177a81610410565b6024359033614203565b34610339576040366003190112610339576004356117a181610328565b602435906117ae82610612565b6001600160a01b035f54163303610389576001600160a01b031690815f52600860205260405f2060ff1981541660ff831515161790551515907f541615e167511d757a7067a700eb54431b256bb458dfdce0ac58bf2ed0aefd445f80a3005b346103395760603660031901126103395760043561182a81610328565b6024359067ffffffffffffffff821682036103395760443560ff81168103610339576001600160a01b035f54163303610389576001600160a01b03919091165f81815260086020818152604092839020805469ffffffffffffffffff0019169287901b68ffffffffffffffff001692909217604886901b69ff0000000000000000001617909155815167ffffffffffffffff909516855260ff90931692840192909252917fe6996b7f03e9bd02228b99d3d946932e3197f505f60542c4cfbc919441d8a4e69181908101610837565b8060e312156103395760405190611911608083610559565b8190610144116103395760c4905b610144821061192d57505090565b813581526020918201910161191f565b34610339576101403660031901126103395760043561195b81610410565b60243561196781610612565b6044359060643560a43560843561197d366118f9565b926001600160a01b035f54163303610389576001600160601b036119a088610ddf565b50971696600188141580611a95575b611a6d575f600182018054915b828110611a4a57600284018a905583546cff000000000000000000000000191689151560601b6cff000000000000000000000000161784558a7f709b1f5fda58af9a4f52dacd1ec404840a8148455700cce155a2bd8cf127ef1a8b8b6108378c8c8c8c611a3e8460068f846003820155856004820155866005820155016135fa565b6040519687968761361e565b896002611a5d6107826108c88587611eda565b50015410611a6d576001016119bc565b7f97170789000000000000000000000000000000000000000000000000000000005f5260045ffd5b50866002611aad61078284546001600160601b031690565b500154116119af565b346103395760403660031901126103395760206001611ae56024356003611ade6004356115b1565b500161323f565b500154604051908152f35b90602080835192838152019201905f5b818110611b0d5750505090565b82516001600160a01b0316845260209384019390920191600101611b00565b90602080835192838152019201905f5b818110611b495750505090565b82516001600160601b0316845260209384019390920191600101611b3c565b905f905b600a8210611b7957505050565b6020806001928551815201930191019091611b6c565b611263906020815282516020820152602083015160408201526040830151606082015260608301516080820152608083015160a082015260a083015160c08201526101a0610180611c0b611bf460c08701516102c060e08701526102e0860190611af0565b60e0870151858203601f1901610100870152611b2c565b94610100810151610120850152610120810151610140850152611c406101408201516101608601906001600160a01b03169052565b610160810151828501520151910190611b68565b3461033957604036600319011261033957610e7c611cf6611cf06004356003611ade60243592604051611c8681610537565b5f81525f60208201525f60408201525f60608201525f60808201525f60a0820152606060c0820152606060e08201525f6101008201525f6101208201525f6101408201525f6101608201526101806101409160405192611ce68185610559565b36843701526115b1565b5061379b565b60405191829182611b8f565b3461033957602036600319011261033957600435611d1f816115b1565b5090600182019182546004611d348260ff1690565b611d3d816115e1565b036110a55760081c60ff16611e2957611d78611dbd91611d71611d5f856133f9565b5050865461ff00191661010017909655565b5460601c90565b60405184815283906001600160a01b038316907f394027a5fa6e098a1191094d1719d6929b9abc535fcc0c8f448d6a4e7562227690602090a36001600160a01b031690565b91823b15610339576040517f311a6c5600000000000000000000000000000000000000000000000000000000815260048101929092526024820152905f908290818381604481015b03925af18015610a4b57611e1557005b80611e235f61046993610559565b806110cd565b7fc977f8d3000000000000000000000000000000000000000000000000000000005f5260045ffd5b34610339575f3660031901126103395760206001600160a01b035f5416604051908152f35b3461033957602036600319011261033957600435611e9381610328565b5f5490336001600160a01b03831603610389576001600160a01b036001600160a01b031991169116175f555f80f35b600654811015610dfb5760065f5260205f2001905f90565b8054821015610dfb575f5260205f2001905f90565b3461033957602036600319011261033957600435600654811015610339576001600160a01b0360209160065f527ff652222313e28459528d920b65115c16c04f3efc82aaedc97be59f3f377c0d3f015416604051908152f35b3461033957602036600319011261033957611f646004356115b1565b5060ff60018201541660058110156115eb57600303611fc357611fb0611faa6108c86006611fa06001600160601b036002870154965416610ddf565b5001600301905f90565b826134e1565b905b604080519182526020820192909252f35b505f80611fb2565b3461033957602036600319011261033957600435611fe881610328565b6001600160a01b035f54163303610389576001600160a01b03166001600160a01b031960045416176004555f80f35b346103395760403660031901126103395760243560043561203782610328565b6001600160a01b035f541633141580612419575b6104e657612058816115b1565b5090600382019061207361206c8354613214565b809361323f565b5093612083600185015460ff1690565b61208c816115e1565b6123f157600685018054916003870192835411156123c9576120b96109b86004546001600160a01b031690565b803b1561033957604051633c694c4160e21b81526001600160a01b039290921660048301525f908290602490829084905af18015610a4b576123b5575b506121666121076109a58854611ec2565b96600b810196604061211989546134d3565b809a885f6001600160a01b0385518099819682957fd2b8035a0000000000000000000000000000000000000000000000000000000084526004840160209093929193604081019481520152565b0393165af18015610a4b575f935f91612380575b506001600160a01b038416918215612358576121a16109b86004546001600160a01b031690565b600185015490803b15610339576040517f21e1625e0000000000000000000000000000000000000000000000000000000081526001600160a01b038816600482015260248101929092525f908290604490829084905af1958615610a4b578960079561224b9361226399612344575b508954604080518f815260208101929092527f6119cf536152c11e0a9a6c22f3953ce4ecc93ee54fa72ffa326ffabded21509b91a38761387e565b6001600160601b038216156123325750915b016138e0565b549054146122af575b5050556122846109b86004546001600160a01b031690565b803b15610339575f6040518092633c694c4160e21b8252818381611e0560048201905f602083019252565b6122c46109b86004546001600160a01b031690565b91823b15610339576040517f5d2d784600000000000000000000000000000000000000000000000000000000815260048101929092526024820152905f908290604490829084905af18015610a4b5761231e575b8061226c565b80611e235f61232c93610559565b5f612318565b546001600160601b031690509161225d565b80611e235f61235293610559565b5f612210565b7f5c7171ee000000000000000000000000000000000000000000000000000000005f5260045ffd5b90506123a591935060403d6040116123ae575b61239d8183610559565b810190613859565b9290925f61217a565b503d612393565b80611e235f6123c393610559565b5f6120f6565b7f4df06de3000000000000000000000000000000000000000000000000000000005f5260045ffd5b7f8285c4ef000000000000000000000000000000000000000000000000000000005f5260045ffd5b506001600160a01b036001541633141561204b565b60403660031901126103395760043560243567ffffffffffffffff81116103395761245d903690600401611248565b9061246782613f61565b34106126855761247682615331565b90506124a96124a561249e83600a61248f879897610ddf565b5001905f5260205260405f2090565b5460ff1690565b1590565b61265d57600754926125675f600a6124bf6150b5565b503360601b6bffffffffffffffffffffffff19166001600160601b03861617815542600282015561254061253861250e60036125066125006109a58c611ec2565b99610ddf565b50940161391b565b509261251e6004820154346132ec565b9860038501998a55845560036002820154910154906132c5565b612710900490565b600182015534600282015501906001600160a01b03166001600160a01b0319825416179055565b61257c6109b86004546001600160a01b031690565b90813b156103395760405163d09f392d60e01b8152600481018690525f6024820181905290928390604490829084905af1918215610a4b576001600160a01b0392612649575b5016905490803b15610339576125f3945f8094604051978895869485936302dbb79560e61b85528a6004860161393c565b03925af1918215610a4b57602092612635575b5033817f141dfc18aa6a56fc816f44f0e9e2f1ebc92b15ab167770e17db5b084c10ed9955f80a3604051908152f35b80611e235f61264393610559565b5f612606565b80611e235f61265793610559565b5f6125c2565b7fb34eb75d000000000000000000000000000000000000000000000000000000005f5260045ffd5b7f38cd83c4000000000000000000000000000000000000000000000000000000005f5260045ffd5b34610339576020366003190112610339576004356126ca81610328565b6001600160a01b035f54163303610389576001600160a01b03166001600160a01b031960035416176003555f80f35b60603660031901126103395760043560243560443567ffffffffffffffff81116103395761272b903690600401611248565b6127348361352c565b3410612b1157612743836115b1565b5091600183016003612756825460ff1690565b61275f816115e1565b03612ae9576003840161277b6127758254613214565b8261323f565b509081546127916109b86109b86109a584611ec2565b3303612ac15786546001600160601b031681946127ad8461391b565b5092600386015460056127bf85610ddf565b50015411156129fa575b5088546bffffffffffffffffffffffff19166001600160601b03831617895561280691906127fb90805460ff19169055565b4260028a0155610ddf565b509361283461253861281c6004880154346132ec565b966003850197885560036002820154910154906132c5565b600183015534600283015581556128566109b86004546001600160a01b031690565b6128608354613214565b90803b156103395760405163d09f392d60e01b8152600481018b905260248101929092525f908290604490829084905af18015610a4b576129e6575b5054915490818303612915575b877f4e6f5cf43b95303e86aee81683df63992061723a829ee012db21dad388756b916001600160a01b036128de8a5460601c90565b1660405190837f9c9b64db9e130f48381bf697abf638e73117dbfbfd7a4484f2da3ba188f4187d5f80a35f81528060208101610837565b61295d926109b89261292a6109a59354613214565b6040518381528b907fcbe7939a71f0b369c7471d760a0a99b60b7bb010ee0406cba8a46679d1ea775690602090a4611ec2565b905490803b156103395761298c935f8094604051968795869485936302dbb79560e61b85528c6004860161393c565b03925af18015610a4b577f4e6f5cf43b95303e86aee81683df63992061723a829ee012db21dad388756b91926001600160a01b03926128de926129d2575b8194816128a9565b80611e235f6129e093610559565b5f6129ca565b80611e235f6129f493610559565b5f61289c565b916124a561249e612a1e612a10612a2a94610ddf565b50546001600160601b031690565b94600a61248f87610ddf565b612ab8575b906127fb61280692612a488b546001600160601b031690565b6001600160601b0381166001600160601b03851603612a6b575b509192506127c9565b612a758754613214565b6040516001600160601b03868116825292909216918e907f736e3f52761298c8c0823e1ebf482ed3c5ecb304f743d2d91a7c006e8e8d7a1f90602090a45f612a62565b60019550612a2f565b7f065f245f000000000000000000000000000000000000000000000000000000005f5260045ffd5b7fdf37bf2c000000000000000000000000000000000000000000000000000000005f5260045ffd5b7f3191f8f1000000000000000000000000000000000000000000000000000000005f5260045ffd5b34610339576020366003190112610339576003612b576004356115b1565b500180545f198101908111612b7457611ae560039160209361323f565b613200565b34610339575f3660031901126103395760206001600160a01b0360035416604051908152f35b3461033957602036600319011261033957600435612bbc81610328565b6001600160a01b035f54163303610389576001600160a01b0360065491612be281613963565b16907f44063d258760b98116d53815adbc906a56b3563e540148cc0fc2457f83b5eeb25f80a3005b34610339575f366003190112610339576020600654604051908152f35b346103395761016036600319011261033957600435612c4581610410565b602435612c5181610612565b604435606435906084359260a43591612c69366118f9565b956101443567ffffffffffffffff811161033957612c8b9036906004016105b5565b966001600160a01b035f5416330361038957826002612ca984610ddf565b50015411611a6d57875115612ea2576001600160601b038216948515612e7a5760059796975491612cd86139cb565b50915f98600a8401995b8c51811015612d54578c81612cf781836131ec565b5115918215612d3d575b50506106bc5780612d37612d2a8f612d1d8f91956001966131ec565b515f5260205260405f2090565b805460ff19166001179055565b01612ce2565b612d4792506131ec565b516006541115818e612d01565b50908b92918b612d726124a561249e8e60015f5260205260405f2090565b612e52577f550ff678017abc294b4786a99a046628d5a1eac07be0f1ea7e89543f13576ee698612e3f886001612e388c8f8a6001600160601b039f8e612e4d9f61078294612ddb600694612e1a93906001600160601b03166001600160601b0319825416179055565b612dee612de66139fd565b8a8501613a18565b82546cff000000000000000000000000191690151560601b6cff00000000000000000000000016178255565b8960028201558a60038201558b60048201558c6005820155016135fa565b5001613a96565b604051988998169a88613aca565b0390a3005b7f31a8d9e8000000000000000000000000000000000000000000000000000000005f5260045ffd5b7f1ef4f649000000000000000000000000000000000000000000000000000000005f5260045ffd5b7f402585f5000000000000000000000000000000000000000000000000000000005f5260045ffd5b9181601f840112156103395782359167ffffffffffffffff8311610339576020838186019501011161033957565b346103395760403660031901126103395760043567ffffffffffffffff811161033957610d66612f4a612f4f612f346020943690600401612eca565b929060243593612f4385610328565b3691611212565b613f61565b906132fb565b34610339576101e036600319011261033957600435612f7381610328565b60243590612f8082610328565b604435612f8c81610328565b606435612f9881610328565b608435612fa481610328565b60a43590612fb182610612565b612fba366118f9565b923661016312156103395760405194612fd4608087610559565b8597366101c41161033957610144985b6101c48a10613006575061046998506101c4359761300189610328565b613b38565b893581526020998a019901612fe4565b346103395760803660031901126103395760043560243567ffffffffffffffff81116103395761304a903690600401612eca565b9160443561305781610328565b606435916001600160a01b0382165f52600860205261307d6124a560405f205460ff1690565b61310157613098613092612f4a368888611212565b836132fb565b8310612685576130ad6124a5843033866152d4565b6130d9576130c36130c994610e7c963691611212565b906150e7565b6040519081529081906020820190565b7f90b8ec18000000000000000000000000000000000000000000000000000000005f5260045ffd5b7fe51cf7bf000000000000000000000000000000000000000000000000000000005f5260045ffd5b346103395760203660031901126103395760043567ffffffffffffffff811161033957610d66612f4a6020923690600401611248565b34610339575f3660031901126103395760206001600160a01b0360025416604051908152f35b346103395760203660031901126103395760206003611ae56004356115b1565b3461033957604036600319011261033957600a6004356131c481610410565b6131d060243591610ddf565b50905f5201602052602060ff60405f2054166040519015158152f35b8051821015610dfb5760209160051b010190565b634e487b7160e01b5f52601160045260245ffd5b5f19810191908211612b7457565b61271003906127108211612b7457565b91908203918211612b7457565b8054821015610dfb575f52601660205f20910201905f90565b6004821015610dfb5701905f90565b90816020910312610339575161126381610612565b6040513d5f823e3d90fd5b9060058110156115eb5760ff80198354169116179055565b60208101929161058b91906115f0565b908160011b9180830460021490151715612b7457565b81810292918115918404141715612b7457565b634e487b7160e01b5f52601260045260245ffd5b81156132f6570490565b6132d8565b6001600160a01b031690815f52600860205260ff60405f205460481c1690604d8211612b745761332e91600a0a906132c5565b905f52600860205267ffffffffffffffff60405f205460081c169081156132f6570490565b61335c906115b1565b506003810180545f198101908111612b74576133836001600160601b039161338c9361323f565b50925416610ddf565b509060038101546005830154116133c9576133b26001600160601b03600a935416610ddf565b5090545f520160205260ff60405f20541615151590565b50505f90565b9081606091031261033957805191604060208301516133ed81610612565b92015161126381610612565b6003613404826115b1565b500180545f19810192908311612b745761344c6001600160a01b036134386134316134859660609661323f565b5054611ec2565b90549060031b1c166001600160a01b031690565b60405180809581947f1c3db16d000000000000000000000000000000000000000000000000000000008352600483019190602083019252565b03915afa908115610a4b575f915f915f916134a1575b50909192565b9150506134c6915060603d6060116134cc575b6134be8183610559565b8101906133cf565b5f61349b565b503d6134b4565b9060018201809211612b7457565b91908201809211612b7457565b90816020910312610339575190565b3d15613527573d9061350e826111f6565b9161351c6040519384610559565b82523d5f602084013e565b606090565b613535906115b1565b5061355f6135506003830161354a8154613214565b9061323f565b5091546001600160601b031690565b600361356a82610ddf565b50920154600583015490919082106135e5576001600160601b03166001036135b25750507f7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff90565b6135df6135da60046135d161078261126396546001600160601b031690565b500154926132af565b6134d3565b906132c5565b506135df6135da6004611263940154926132af565b905f5b6004811061360a57505050565b6001906020835193019281850155016135fd565b919360a09361058b969298979561012085019915158552602085015260408401526060830152608082015201906110fd565b90604051918281549182825260208201905f5260205f20925f5b81811061367f57505061058b92500383610559565b84546001600160a01b031683526001948501948794506020909301920161366a565b604051815480825290929183906136bf60208301915f5260205f2090565b925f905b80600183011061371a5761058b945491818110613700575b106136e9575b500383610559565b60601c6001600160601b031681526020015f6136e1565b6001600160601b03831684529260019060200193016136db565b91600291935060406001916137588754613745836001600160601b0383166001600160601b03169052565b60601c6001600160601b03166020830152565b0194019201859293916136c3565b60405191905f835b600a82106137855750505061058b61014083610559565b600160208192855481520193019101909161376e565b90613851600c6137a961058d565b938054855260018101546020860152600281015460408601526003810154606086015260048101546080860152600581015460a08601526137ec60068201613650565b60c08601526137fd600782016136a1565b60e08601526008810154610100860152600981015461012086015261384061382f600a8301546001600160a01b031690565b6001600160a01b0316610140870152565b600b81015461016086015201613766565b610180830152565b9190826040910312610339576020825161387281610328565b92015161126381610410565b90815491600160401b83101561055457826138a191600161058b95018155611eda565b9091906001600160a01b038084549260031b9316831b921b1916179055565b9190918054831015610dfb575f52600c600160205f2084821c0193160290565b8054600160401b811015610554576138fd916001820181556138c0565b6001600160601b0380839493549260031b9316831b921b1916179055565b8054600160401b811015610554576139389160018201815561323f565b9091565b94939260609261395e928752602087015260806040870152608086019061152e565b930152565b60065490600160401b8210156105545760018201600655600654821015610dfb5760065f527ff652222313e28459528d920b65115c16c04f3efc82aaedc97be59f3f377c0d3f90910180546001600160a01b0319166001600160a01b03909216919091179055565b600554600160401b8110156105545760018101600555600554811015610dfb5760055f52601560205f20910201905f90565b60405190613a0c602083610559565b5f808352366020840137565b81519167ffffffffffffffff831161055457600160401b8311610554578154838355808410613a70575b50602001905f5260205f205f5b838110613a5c5750505050565b600190602084519401938184015501613a4f565b825f528360205f2091820191015b818110613a8b5750613a42565b5f8155600101613a7e565b8054600160401b81101561055457613ab391600182018155611eda565b819291549060031b91821b915f19901b1916179055565b929461016094602096613b0194989398610140870199151587528887015260408601526060850152608084015260a08301906110fd565b6101406101208201528451809452019201905f5b818110613b225750505090565b8251845260209384019390920191600101613b15565b96949290979593917ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e5498613b84613b7660ff8c60401c1615151590565b9a67ffffffffffffffff1690565b8a80613d37575b159081613d0f575b50613ce757613bfd988a613bf4600167ffffffffffffffff197ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e5416177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e55565b613c8757613d79565b613c0357565b613c5868ff0000000000000000197ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e54167ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e55565b604051600181527fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d290602090a1565b613ce2600160401b68ff0000000000000000197ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e5416177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e55565b613d79565b7f0dc149f0000000000000000000000000000000000000000000000000000000005f5260045ffd5b303b15915081613d22575b50155f613b93565b6001915067ffffffffffffffff16145f613d1a565b50600167ffffffffffffffff821610613b8b565b600654600160401b8110156105545760018101600655600654811015610dfb5760065f5260205f2001905f90565b93613e516001600160601b039699613e35613f5696613e1960019c97613dfd6001600160a01b0398613de17f550ff678017abc294b4786a99a046628d5a1eac07be0f1ea7e89543f13576ee69f9d6001600160a01b03166001600160a01b03195f5416175f55565b6001600160a01b03166001600160a01b03196001541617600155565b6001600160a01b03166001600160a01b03196002541617600255565b6001600160a01b03166001600160a01b03196003541617600355565b6001600160a01b03166001600160a01b03196004541617600455565b613e59613d4b565b5050613e6481613963565b16867f44063d258760b98116d53815adbc906a56b3563e540148cc0fc2457f83b5eeb25f80a3613e926139cb565b5050613e9c6139cb565b5080546bffffffffffffffffffffffff1916815590613ec4613ebc6139fd565b888401613a18565b81546cff000000000000000000000000191688151560601b6cff0000000000000000000000001617825583516002830155602084018051600384015591604085018051600483015590613f36606087019182516005820155613f2985600683016135fa565b546001600160601b031690565b955193519151905191613f476139fd565b94604051988998169b88613aca565b0390a361058b61443c565b613f7a6004613f7261126393615331565b509290610ddf565b5001546132c5565b908160609103126103395780519160406020830151920151600a8110156103395790565b600a11156115eb57565b906001600160601b03811680159081156141f6575b506141e957821515806141d3575b6141c657613fec6109b86004546001600160a01b031690565b60405163c70ba3b960e01b81526001600160a01b03841660048201526001600160601b038316602482015260448101859052600160648201529390606090859060849082905f905af1918215610a4b575f925f955f9161418d575b5061405181613fa6565b8061417c575082614147575b84614110575b6140786109b86004546001600160a01b031690565b91823b15610339576040517faac03ad20000000000000000000000000000000000000000000000000000000081526001600160a01b0390951660048601526001600160601b039091166024850152604484019290925260648301939093526084820152905f90829081838160a4810103925af18015610a4b576140fc575b50600190565b80611e235f61410a93610559565b5f6140f6565b61412f6124a5868661412a6002546001600160a01b031690565b61500d565b156140635750505050506141436001615422565b5f90565b6141686124a5846141606002546001600160a01b031690565b8730916152d4565b1561405d5750505050506141436001615402565b935050505061414391506001615442565b919350506141b491945060603d6060116141bf575b6141ac8183610559565b810190613f82565b94919290945f614047565b503d6141a2565b50505061414360016153e2565b5060026141df82610ddf565b5001548310613fd3565b50505061414360016153c2565b905060055411155f613fc5565b906001600160601b038116801590811561438a575b5061437e5782151580614368575b61435c5761423f6109b86004546001600160a01b031690565b60405163c70ba3b960e01b81526001600160a01b03841660048201526001600160601b0383166024820152604481018590525f60648201819052909491606091869160849183915af1918215610a4b575f925f955f91614333575b506142a481613fa6565b806143235750826142f7575b846142ca576140786109b86004546001600160a01b031690565b6142e46124a5868661412a6002546001600160a01b031690565b156140635750505050506141435f615422565b6143106124a5846141606002546001600160a01b031690565b156142b05750505050506141435f615402565b935050505061414391505f615442565b9193505061435191945060603d6060116141bf576141ac8183610559565b94919290945f61429a565b5050506141435f6153e2565b50600261437482610ddf565b5001548310614226565b5050506141435f6153c2565b905060055411155f614218565b906001600160601b035f92600a6143ad82610ddf565b508486520160205260408420805460ff19169055167fb47629acdf64971062d40984f77d3dee212d735b11e3e8c7a4222d9f0572cc798380a4565b906001600160601b03600192600a6143ff82610ddf565b50845f520160205260405f208460ff19825416179055167fb47629acdf64971062d40984f77d3dee212d735b11e3e8c7a4222d9f0572cc795f80a4565b600a6144486001610ddf565b5060015f520160205260405f20600160ff19825416179055600180807fb47629acdf64971062d40984f77d3dee212d735b11e3e8c7a4222d9f0572cc795f80a4565b81156132f6570690565b9190826040910312610339576020825192015190565b6144b481516115b1565b50906144c760208201516003840161323f565b50916144d96109b86109a58554611ec2565b9060408351926020850151906144f860e087015160608801519061448a565b608087015160a088015185517f9d61ab6e00000000000000000000000000000000000000000000000000000000815260048101989098526024880194909452604487019190915260648601526084850191909152839060a49082905afa8015610a4b575f925f916149c4575b50918261271082116149ba575b612710106149b0575b61459c6109a561459360e087015160608801519061448a565b60068801611eda565b926145ae6125388360018901546132c5565b936145c46109b86004546001600160a01b031690565b803b156103395760405163965af6c760e01b81526001600160a01b038316600482015260248101969096525f908690604490829084905af1908115610a4b576002956147279261499c575b5060208861465f6125388661463a8c61463f6125388c61463a604060c08601519501948551906132ec565b6132c5565b9c866146508f6009819a01546134e1565b600982015501549051906132ec565b9661466e8860088d01546134e1565b60088c0155600a8b01546001600160a01b031688858261498d575090505f8115614984575b5f80809381936001600160a01b038a1690f1505b6146cd6146bf6109b86004546001600160a01b031690565b91546001600160601b031690565b5f6040518097819582947f664bffc300000000000000000000000000000000000000000000000000000000845289600485016001600160601b036040929594936001600160a01b0360608401971683521660208201520152565b03925af1918215610a4b577fa90d30adac7f21a7def444f0fe0a60bdf16d7e8415973dd09bf869db8f94d58e936001600160a01b03936147bf925f91614965575b5015614948575b88519660208a01519861478c600a8d01546001600160a01b031690565b60408051998a5260208a01949094529288015260608701526001600160a01b0316608086015291169290819060a0820190565b0390a460e08101516147dc6147d760608401516132af565b613214565b146147e5575050565b6147f860c0820151600984015490613232565b61480b6002840154600885015490613232565b8115918215809361493f575b614823575b5050505050565b7f6cecfd3ec56289ccb16e30eb194f9a87dfdc12630b9abbc31fc69af5a0b0eaf492614913575b81801580156148a9575b505061489c614874600a602087519701519701546001600160a01b031690565b604051938493849160409194936001600160a01b039160608501968552602085015216910152565b0390a35f8080808061481c565b600a8701546001600160a01b0316806148f557505f80809381936148da6109b86109b885546001600160a01b031690565b9083906148ec575bf1505b815f614854565b506108fc6148e2565b5f5461490d9392506001600160a01b03165b9061500d565b506148e5565b614939816149296002546001600160a01b031690565b5f546001600160a01b0316614907565b5061484a565b50811515614817565b61495f888461412a6002546001600160a01b031690565b5061476f565b61497e915060203d602011610a4457610a368183610559565b5f614768565b506108fc614693565b6149969261500d565b506146a7565b80611e235f6149aa93610559565b5f61460f565b612710925061457a565b6127109150614571565b90506149e991925060403d6040116149f2575b6149e18183610559565b810190614494565b9190915f614564565b503d6149d7565b90816060910312610339578051916040602083015192015190565b7f80000000000000000000000000000000000000000000000000000000000000008114612b74575f0390565b614a4a81516115b1565b50614a5e602083019160038351910161323f565b5090614a706109b86109a58454611ec2565b8351825160e086018051608088015160a08901516040517f149a5dc0000000000000000000000000000000000000000000000000000000008152600481019690965260248601949094526044850191909152606484015260848301919091529094919060208660a481855afa958615610a4b575f96614fec575b506127108611614fe2575b614b0961253860018701546135df89613222565b614b1a6109a5835160068901611eda565b614b2f6109b86004546001600160a01b031690565b803b156103395760405163965af6c760e01b81526001600160a01b038316600482015260248101849052905f908290604490829084905af18015610a4b57614fce575b505f6060614c0e614b9d614b8a875160078d016138c0565b90546001600160601b039160031b1c1690565b94614bb36109b86004546001600160a01b031690565b906040519485809481937f771a27cb0000000000000000000000000000000000000000000000000000000083528a8a600485016001600160601b036040929594936001600160a01b0360608401971683521660208201520152565b03925af1948515610a4b5788955f905f935f91614f97575b508960c08a019c8d614c398482516134e1565b90527fa90d30adac7f21a7def444f0fe0a60bdf16d7e8415973dd09bf869db8f94d58e600a614c6b8d51945195614a14565b9b019a614c7f8c546001600160a01b031690565b6040805185815260208101959095528401919091525f60608401526001600160a01b03908116608084015288169160a090a415908115614f13575b5015614e6357509050614cd86109b86004546001600160a01b031690565b803b15610339576040517faa9ebfb70000000000000000000000000000000000000000000000000000000081526001600160a01b039290921660048301525f908290602490829084905af18015610a4b57614e4f575b505b51614d3e6060840151613214565b1480614e43575b614d52575b505050505190565b7f6cecfd3ec56289ccb16e30eb194f9a87dfdc12630b9abbc31fc69af5a0b0eaf491614d8582546001600160a01b031690565b6001600160a01b038116614e1d57505f808080614daf6109b86109b883546001600160a01b031690565b60028a015490828215614e14575bf1505b614de8614dd56002546001600160a01b031690565b5f546001600160a01b031688519161500d565b5051925193614e086148746002885193015493546001600160a01b031690565b0390a35f808080614d4a565b506108fc614dbd565b614e3d90614e325f546001600160a01b031690565b60028801549161500d565b50614dc0565b50604082015115614d45565b80611e235f614e5d93610559565b5f614d2e565b6002614e6e84610ddf565b50015411614e7e575b5050614d30565b614e936109b86004546001600160a01b031690565b91823b15610339576040517f9d5608670000000000000000000000000000000000000000000000000000000081526001600160a01b039290921660048301526001600160601b03166024820152905f908290604490829084905af18015610a4b57614eff575b80614e77565b80611e235f614f0d93610559565b5f614ef9565b8751895187516040517fba66fde70000000000000000000000000000000000000000000000000000000081526004810193909352602483019190915260448201529150602090829060649082905afa908115610a4b575f91614f78575b50155f614cba565b614f91915060203d602011610a4457610a368183610559565b5f614f70565b915050614fbd91925060603d606011614fc7575b614fb58183610559565b8101906149f9565b929190925f614c26565b503d614fab565b80611e235f614fdc93610559565b5f614b72565b6127109550614af5565b61500691965060203d60201161109e5761108f8183610559565b945f614aea565b6040517fa9059cbb00000000000000000000000000000000000000000000000000000000602082019081526001600160a01b0393841660248301526044808301959095529381525f9384939091849190615068606482610559565b5193165af16150756134fd565b8161507e575090565b805180159250821561508f57505090565b6112639250602080918301019101613267565b6001600160a01b035f5416330361038957565b600754600160401b8110156105545760018101600755600754811015610dfb5760075f52600e60205f20910201905f90565b90919392936150f583615331565b92905061510d6124a561249e85600a61248f87610ddf565b61265d576151d290600a600754986151236150b5565b503360601b6bffffffffffffffffffffffff19166001600160601b038716178155426002820155906151ac612538615173600361516b6151656109a58d611ec2565b9a610ddf565b50950161391b565b50936001600160a01b0387166152be5761519260048201545b856132ec565b99600386019a8b55855560036002820154910154906132c5565b6001830155600282015501906001600160a01b03166001600160a01b0319825416179055565b6151e76109b86004546001600160a01b031690565b90813b156103395760405163d09f392d60e01b8152600481018890525f6024820181905290928390604490829084905af1918215610a4b576001600160a01b03926152aa575b5016905490803b156103395761525e935f8094604051968795869485936302dbb79560e61b85528c6004860161393c565b03925af18015610a4b57615296575b5033827f141dfc18aa6a56fc816f44f0e9e2f1ebc92b15ab167770e17db5b084c10ed9955f80a3565b80611e235f6152a493610559565b5f61526d565b80611e235f6152b893610559565b5f61522d565b6151926152cf6004830154896132fb565b61518c565b905f6001600160a01b03819594829582604051928160208501977f23b872dd000000000000000000000000000000000000000000000000000000008952166024850152166044830152606482015260648152615068608482610559565b80516040116153ac5760208101519160606040830151920151906001600160601b038416801590811561539f575b50615396575b821561538d575b81158015615381575b61537b57565b60019150565b50600654821015615375565b6003925061536c565b60019350615365565b905060055411155f61535f565b50600190600390600190565b600211156115eb57565b6001906153ce816153b8565b1461058b57637c84af5160e01b5f5260045ffd5b6001906153ee816153b8565b1461058b57630caac6b360e31b5f5260045ffd5b60019061540e816153b8565b1461058b57630f323ed960e11b5f5260045ffd5b60019061542e816153b8565b1461058b5763e45e13a360e01b5f5260045ffd5b60019061544e816153b8565b146155475761545c81613fa6565b600281146155385761546d81613fa6565b600381146155295761547e81613fa6565b600481146155015761548f81613fa6565b600581146154f2576154a081613fa6565b600681146154e357806154b4600992613fa6565b146154bb57565b7ff95e58bc000000000000000000000000000000000000000000000000000000005f5260045ffd5b630caac6b360e31b5f5260045ffd5b637c84af5160e01b5f5260045ffd5b7fec8e8768000000000000000000000000000000000000000000000000000000005f5260045ffd5b63e45e13a360e01b5f5260045ffd5b630f323ed960e11b5f5260045ffd5b5056fea26469706673582212209d8693ceca011df52e9dd63f6056bbcd764f392dc1976d1654c7a6599b67d72c64736f6c634300081e0033",
   "devdoc": {
     "errors": {
       "AlreadyInitialized()": [
@@ -1852,28 +1908,16 @@
         {
           "details": "The contract is not initializing."
         }
-      ],
-      "UUPSUnauthorizedCallContext()": [
-        {
-          "details": "The call is from an unauthorized context."
-        }
-      ],
-      "UUPSUnsupportedProxiableUUID(bytes32)": [
-        {
-          "details": "The storage `slot` is unsupported as a UUID."
-        }
       ]
     },
     "events": {
       "AcceptedFeeToken(address,bool)": {
-        "details": "To be emitted when an ERC20 token is added or removed as a method to pay fees.",
         "params": {
           "_accepted": "Whether the token is accepted or not.",
           "_token": "The ERC20 token."
         }
       },
       "DisputeCreation(uint256,address)": {
-        "details": "To be emitted when a dispute is created.",
         "params": {
           "_arbitrable": "The contract which created the dispute.",
           "_disputeID": "The identifier of the dispute in the Arbitrator contract."
@@ -1883,7 +1927,6 @@
         "details": "Triggered when the contract has been initialized or reinitialized."
       },
       "NewCurrencyRate(address,uint64,uint8)": {
-        "details": "To be emitted when the fee for a particular ERC20 token is updated.",
         "params": {
           "_feeToken": "The ERC20 token.",
           "_rateDecimals": "The new decimals of the fee token rate.",
@@ -1891,7 +1934,6 @@
         }
       },
       "Ruling(address,uint256,uint256)": {
-        "details": "To be raised when a ruling is given.",
         "params": {
           "_arbitrable": "The arbitrable receiving the ruling.",
           "_disputeID": "The identifier of the dispute in the Arbitrator contract.",
@@ -1907,13 +1949,12 @@
     "kind": "dev",
     "methods": {
       "addNewDisputeKit(address)": {
-        "details": "Add a new supported dispute kit module to the court.",
         "params": {
           "_disputeKitAddress": "The address of the dispute kit contract."
         }
       },
       "appeal(uint256,uint256,bytes)": {
-        "details": "Appeals the ruling of a specified dispute. Note: Access restricted to the Dispute Kit for this `disputeID`.",
+        "details": "Access restricted to the Dispute Kit for this `disputeID`.",
         "params": {
           "_disputeID": "The ID of the dispute.",
           "_extraData": "Extradata for the dispute. Can be required during court jump.",
@@ -1921,7 +1962,6 @@
         }
       },
       "appealCost(uint256)": {
-        "details": "Gets the cost of appealing a specified dispute.",
         "params": {
           "_disputeID": "The ID of the dispute."
         },
@@ -1930,7 +1970,6 @@
         }
       },
       "appealPeriod(uint256)": {
-        "details": "Gets the start and the end of a specified dispute's current appeal period.",
         "params": {
           "_disputeID": "The ID of the dispute."
         },
@@ -1940,7 +1979,7 @@
         }
       },
       "arbitrationCost(bytes)": {
-        "details": "Compute the cost of arbitration denominated in ETH.      It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.",
+        "details": "It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.",
         "params": {
           "_extraData": "Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes)."
         },
@@ -1949,7 +1988,7 @@
         }
       },
       "arbitrationCost(bytes,address)": {
-        "details": "Compute the cost of arbitration denominated in `_feeToken`.      It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.",
+        "details": "It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.",
         "params": {
           "_extraData": "Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).",
           "_feeToken": "The ERC20 token used to pay fees."
@@ -1959,55 +1998,47 @@
         }
       },
       "changeAcceptedFeeTokens(address,bool)": {
-        "details": "Changes the supported fee tokens.",
         "params": {
           "_accepted": "Whether the token is supported or not as a method of fee payment.",
           "_feeToken": "The fee token."
         }
       },
       "changeCurrencyRates(address,uint64,uint8)": {
-        "details": "Changes the currency rate of a fee token.",
         "params": {
           "_feeToken": "The fee token.",
           "_rateDecimals": "The new decimals of the fee token rate.",
           "_rateInEth": "The new rate of the fee token in ETH."
         }
       },
-      "changeGovernor(address)": {
-        "details": "Changes the `governor` storage variable.",
-        "params": {
-          "_governor": "The new value for the `governor` storage variable."
-        }
-      },
       "changeInstructor(address)": {
-        "details": "Changes the `instructor` storage variable.",
         "params": {
           "_instructor": "The new value for the `instructor` storage variable."
         }
       },
       "changeJurorProsecutionModule(address)": {
-        "details": "Changes the `jurorProsecutionModule` storage variable.",
         "params": {
           "_jurorProsecutionModule": "The new value for the `jurorProsecutionModule` storage variable."
         }
       },
+      "changeOwner(address)": {
+        "params": {
+          "_owner": "The new value for the `owner` storage variable."
+        }
+      },
       "changePinakion(address)": {
-        "details": "Changes the `pinakion` storage variable.",
         "params": {
           "_pinakion": "The new value for the `pinakion` storage variable."
         }
       },
       "changeSortitionModule(address)": {
-        "details": "Changes the `_sortitionModule` storage variable. Note that the new module should be initialized for all courts.",
         "params": {
           "_sortitionModule": "The new value for the `sortitionModule` storage variable."
         }
       },
       "constructor": {
-        "details": "Constructor, initializing the implementation to reduce attack surface."
+        "custom:oz-upgrades-unsafe-allow": "constructor"
       },
       "createCourt(uint96,bool,uint256,uint256,uint256,uint256,uint256[4],uint256[])": {
-        "details": "Creates a court under a specified parent court.",
         "params": {
           "_alpha": "The `alpha` property value of the court.",
           "_feeForJuror": "The `feeForJuror` property value of the court.",
@@ -2020,7 +2051,7 @@
         }
       },
       "createDispute(uint256,bytes)": {
-        "details": "Create a dispute and pay for the fees in the native currency, typically ETH.      Must be called by the arbitrable contract.      Must pay at least arbitrationCost(_extraData).",
+        "details": "Must be called by the arbitrable contract and pay at least `arbitrationCost(_extraData)` in ETH.",
         "params": {
           "_extraData": "Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).",
           "_numberOfChoices": "The number of choices the arbitrator can choose from in this dispute."
@@ -2030,7 +2061,7 @@
         }
       },
       "createDispute(uint256,bytes,address,uint256)": {
-        "details": "Create a dispute and pay for the fees in a supported ERC20 token.      Must be called by the arbitrable contract.      Must pay at least arbitrationCost(_extraData).",
+        "details": "Must be called by the arbitrable contract and pay at least `arbitrationCost(_extraData)` in the supported ERC20 token.",
         "params": {
           "_extraData": "Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).",
           "_feeAmount": "Amount of the ERC20 token used to pay fees.",
@@ -2042,7 +2073,6 @@
         }
       },
       "currentRuling(uint256)": {
-        "details": "Gets the current ruling of a specified dispute.",
         "params": {
           "_disputeID": "The ID of the dispute."
         },
@@ -2053,14 +2083,12 @@
         }
       },
       "draw(uint256,address)": {
-        "details": "Draws one juror for the dispute until the number votes paid for is reached.",
         "params": {
           "_disputeID": "The ID of the dispute.",
           "_juror": "The address of the juror to draw."
         }
       },
       "enableDisputeKits(uint96,uint256[],bool)": {
-        "details": "Adds/removes court's support for specified dispute kits.",
         "params": {
           "_courtID": "The ID of the court.",
           "_disputeKitIDs": "The IDs of dispute kits which support should be added/removed.",
@@ -2068,15 +2096,13 @@
         }
       },
       "execute(uint256,uint256,uint256)": {
-        "details": "Distribute the PNKs at stake and the dispute fees for the specific round of the dispute. Can be called in parts.",
         "params": {
           "_disputeID": "The ID of the dispute.",
           "_iterations": "The number of iterations to run.",
           "_round": "The appeal round."
         }
       },
-      "executeGovernorProposal(address,uint256,bytes)": {
-        "details": "Allows the governor to call anything on behalf of the contract.",
+      "executeOwnerProposal(address,uint256,bytes)": {
         "params": {
           "_amount": "The value sent with the call.",
           "_data": "The data sent with the call.",
@@ -2084,19 +2110,43 @@
         }
       },
       "executeRuling(uint256)": {
-        "details": "Executes a specified dispute's ruling.",
         "params": {
           "_disputeID": "The ID of the dispute."
         }
       },
+      "getNumberOfRounds(uint256)": {
+        "params": {
+          "_disputeID": "The ID of the dispute."
+        },
+        "returns": {
+          "_0": "The number of rounds."
+        }
+      },
       "getNumberOfVotes(uint256)": {
-        "details": "Gets the number of votes permitted for the specified dispute in the latest round.",
         "params": {
           "_disputeID": "The ID of the dispute."
         }
       },
+      "getPnkAtStakePerJuror(uint256,uint256)": {
+        "params": {
+          "_disputeID": "The ID of the dispute.",
+          "_round": "The round to get the info for."
+        },
+        "returns": {
+          "_0": "pnkAtStakePerJuror The PNK at stake per juror."
+        }
+      },
+      "getRoundInfo(uint256,uint256)": {
+        "details": "This function must not be called from a non-view function because it returns a dynamic array which might be very large, theoretically exceeding the block gas limit.",
+        "params": {
+          "_disputeID": "The ID of the dispute.",
+          "_round": "The round to get the info for."
+        },
+        "returns": {
+          "_0": "round The round info."
+        }
+      },
       "getTimesPerPeriod(uint96)": {
-        "details": "Gets the timesPerPeriod array for a given court.",
         "params": {
           "_courtID": "The ID of the court to get the times from."
         },
@@ -2105,21 +2155,19 @@
         }
       },
       "initialize(address,address,address,address,address,bool,uint256[4],uint256[4],address)": {
-        "details": "Initializer (constructor equivalent for upgradable contracts).",
         "params": {
           "_courtParameters": "Numeric parameters of General court (minStake, alpha, feeForJuror and jurorsForCourtJump respectively).",
           "_disputeKit": "The address of the default dispute kit.",
-          "_governor": "The governor's address.",
           "_hiddenVotes": "The `hiddenVotes` property value of the general court.",
           "_instructor": "The address of the instructor.",
           "_jurorProsecutionModule": "The address of the juror prosecution module.",
+          "_owner": "The owner's address.",
           "_pinakion": "The address of the token contract.",
           "_sortitionModuleAddress": "The sortition module responsible for sortition of the jurors.",
           "_timesPerPeriod": "The `timesPerPeriod` property value of the general court."
         }
       },
       "isDisputeKitJumping(uint256)": {
-        "details": "Returns true if the dispute kit will be switched to a parent DK.",
         "params": {
           "_disputeID": "The ID of the dispute."
         },
@@ -2127,40 +2175,59 @@
           "_0": "Whether DK will be switched or not."
         }
       },
+      "isSupported(uint96,uint256)": {
+        "params": {
+          "_courtID": "The ID of the court to check the support for.",
+          "_disputeKitID": "The ID of the dispute kit to check the support for."
+        },
+        "returns": {
+          "_0": "Whether the dispute kit is supported or not."
+        }
+      },
       "passPeriod(uint256)": {
-        "details": "Passes the period of a specified dispute.",
         "params": {
           "_disputeID": "The ID of the dispute."
         }
       },
       "proxiableUUID()": {
-        "details": "Implementation of the ERC1822 `proxiableUUID` function. This returns the storage slot used by the implementation. It is used to validate the implementation's compatibility when performing an upgrade. IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks bricking a proxy that upgrades to it, by delegating to itself until out of gas. Thus it is critical that this function revert if invoked through a proxy. This is guaranteed by the if statement."
+        "details": "IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks bricking a proxy that upgrades to it, by delegating to itself until out of gas. Thus it is critical that this function revert if invoked through a proxy. This is guaranteed by the if statement."
       },
       "setStake(uint96,uint256)": {
-        "details": "Sets the caller's stake in a court.",
         "params": {
           "_courtID": "The ID of the court.",
           "_newStake": "The new stake. Note that the existing delayed stake will be nullified as non-relevant."
         }
       },
-      "setStakeBySortitionModule(address,uint96,uint256,bool)": {
-        "details": "Sets the stake of a specified account in a court, typically to apply a delayed stake or unstake inactive jurors.",
+      "setStakeBySortitionModule(address,uint96,uint256)": {
         "params": {
           "_account": "The account whose stake is being set.",
-          "_alreadyTransferred": "Whether the PNKs have already been transferred to the contract.",
           "_courtID": "The ID of the court.",
           "_newStake": "The new stake."
         }
       },
+      "transferBySortitionModule(address,uint256)": {
+        "params": {
+          "_account": "The account of the juror whose PNK to transfer.",
+          "_amount": "The amount to transfer."
+        }
+      },
       "upgradeToAndCall(address,bytes)": {
-        "details": "Upgrade mechanism including access control and UUPS-compliance.Reverts if the execution is not performed via delegatecall or the execution context is not of a proxy with an ERC1967-compliant implementation pointing to self.",
+        "details": "Reverts if the execution is not performed via delegatecall or the execution context is not of a proxy with an ERC1967-compliant implementation pointing to self.",
         "params": {
           "data": "Data used in a delegate call to `newImplementation` if non-empty. This will typically be an encoded function call, and allows initializing the storage of the proxy like a Solidity constructor.",
           "newImplementation": "Address of the new implementation contract."
         }
       }
     },
-    "title": "KlerosCoreUniversity Core arbitrator contract for educational purposes.",
+    "stateVariables": {
+      "version": {
+        "return": "Version string.",
+        "returns": {
+          "_0": "Version string."
+        }
+      }
+    },
+    "title": "KlerosCoreUniversity",
     "version": 1
   },
   "userdoc": {
@@ -2174,29 +2241,164 @@
         {
           "notice": "The `implementation` is not UUPS-compliant"
         }
+      ],
+      "UUPSUnauthorizedCallContext()": [
+        {
+          "notice": "The call is from an unauthorized context."
+        }
+      ],
+      "UUPSUnsupportedProxiableUUID(bytes32)": [
+        {
+          "notice": "The storage `slot` is unsupported as a UUID."
+        }
       ]
     },
     "events": {
+      "AcceptedFeeToken(address,bool)": {
+        "notice": "To be emitted when an ERC20 token is added or removed as a method to pay fees."
+      },
+      "DisputeCreation(uint256,address)": {
+        "notice": "To be emitted when a dispute is created."
+      },
+      "NewCurrencyRate(address,uint64,uint8)": {
+        "notice": "To be emitted when the fee for a particular ERC20 token is updated."
+      },
+      "Ruling(address,uint256,uint256)": {
+        "notice": "To be raised when a ruling is given."
+      },
       "Upgraded(address)": {
         "notice": "Emitted when the `implementation` has been successfully upgraded."
       }
     },
     "kind": "user",
-    "methods": {},
+    "methods": {
+      "addNewDisputeKit(address)": {
+        "notice": "Add a new supported dispute kit module to the court."
+      },
+      "appeal(uint256,uint256,bytes)": {
+        "notice": "Appeals the ruling of a specified dispute."
+      },
+      "appealCost(uint256)": {
+        "notice": "Gets the cost of appealing a specified dispute."
+      },
+      "appealPeriod(uint256)": {
+        "notice": "Gets the start and the end of a specified dispute's current appeal period."
+      },
+      "arbitrationCost(bytes)": {
+        "notice": "Compute the cost of arbitration denominated in the native currency, typically ETH."
+      },
+      "arbitrationCost(bytes,address)": {
+        "notice": "Compute the cost of arbitration denominated in `_feeToken`."
+      },
+      "changeAcceptedFeeTokens(address,bool)": {
+        "notice": "Changes the supported fee tokens."
+      },
+      "changeCurrencyRates(address,uint64,uint8)": {
+        "notice": "Changes the currency rate of a fee token."
+      },
+      "changeInstructor(address)": {
+        "notice": "Changes the `instructor` storage variable."
+      },
+      "changeJurorProsecutionModule(address)": {
+        "notice": "Changes the `jurorProsecutionModule` storage variable."
+      },
+      "changeOwner(address)": {
+        "notice": "Changes the `owner` storage variable."
+      },
+      "changePinakion(address)": {
+        "notice": "Changes the `pinakion` storage variable."
+      },
+      "changeSortitionModule(address)": {
+        "notice": "Changes the `_sortitionModule` storage variable. Note that the new module should be initialized for all courts."
+      },
+      "createCourt(uint96,bool,uint256,uint256,uint256,uint256,uint256[4],uint256[])": {
+        "notice": "Creates a court under a specified parent court."
+      },
+      "createDispute(uint256,bytes)": {
+        "notice": "Create a dispute and pay for the fees in the native currency, typically ETH."
+      },
+      "createDispute(uint256,bytes,address,uint256)": {
+        "notice": "Create a dispute and pay for the fees in a supported ERC20 token."
+      },
+      "currentRuling(uint256)": {
+        "notice": "Gets the current ruling of a specified dispute."
+      },
+      "draw(uint256,address)": {
+        "notice": "Draws one juror for the dispute until the number votes paid for is reached."
+      },
+      "enableDisputeKits(uint96,uint256[],bool)": {
+        "notice": "Adds/removes court's support for specified dispute kits."
+      },
+      "execute(uint256,uint256,uint256)": {
+        "notice": "Distribute the PNKs at stake and the dispute fees for the specific round of the dispute. Can be called in parts."
+      },
+      "executeOwnerProposal(address,uint256,bytes)": {
+        "notice": "Allows the owner to call anything on behalf of the contract."
+      },
+      "executeRuling(uint256)": {
+        "notice": "Executes a specified dispute's ruling."
+      },
+      "getNumberOfRounds(uint256)": {
+        "notice": "Gets the number of rounds for a specified dispute."
+      },
+      "getNumberOfVotes(uint256)": {
+        "notice": "Gets the number of votes permitted for the specified dispute in the latest round."
+      },
+      "getPnkAtStakePerJuror(uint256,uint256)": {
+        "notice": "Gets the PNK at stake per juror for a specified dispute and round."
+      },
+      "getRoundInfo(uint256,uint256)": {
+        "notice": "Gets the round info for a specified dispute and round."
+      },
+      "getTimesPerPeriod(uint96)": {
+        "notice": "Gets the timesPerPeriod array for a given court."
+      },
+      "initialize(address,address,address,address,address,bool,uint256[4],uint256[4],address)": {
+        "notice": "Initializer (constructor equivalent for upgradable contracts)."
+      },
+      "isDisputeKitJumping(uint256)": {
+        "notice": "Returns true if the dispute kit will be switched to a parent DK."
+      },
+      "isSupported(uint96,uint256)": {
+        "notice": "Checks if a given dispute kit is supported by a given court."
+      },
+      "passPeriod(uint256)": {
+        "notice": "Passes the period of a specified dispute."
+      },
+      "proxiableUUID()": {
+        "notice": "Implementation of the ERC1822 `proxiableUUID` function. This returns the storage slot used by the implementation. It is used to validate the implementation's compatibility when performing an upgrade."
+      },
+      "setStake(uint96,uint256)": {
+        "notice": "Sets the caller's stake in a court."
+      },
+      "setStakeBySortitionModule(address,uint96,uint256)": {
+        "notice": "Sets the stake of a specified account in a court, typically to apply a delayed stake or unstake inactive jurors."
+      },
+      "transferBySortitionModule(address,uint256)": {
+        "notice": "Transfers PNK to the juror by SortitionModule."
+      },
+      "upgradeToAndCall(address,bytes)": {
+        "notice": "Upgrade mechanism including access control and UUPS-compliance."
+      },
+      "version()": {
+        "notice": "Returns the version of the implementation."
+      }
+    },
+    "notice": "Core arbitrator contract for educational purposes.",
     "version": 1
   },
   "storageLayout": {
     "storage": [
       {
-        "astId": 23505,
+        "astId": 26659,
         "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
-        "label": "governor",
+        "label": "owner",
         "offset": 0,
         "slot": "0",
         "type": "t_address"
       },
       {
-        "astId": 23507,
+        "astId": 26661,
         "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
         "label": "instructor",
         "offset": 0,
@@ -2204,15 +2406,15 @@
         "type": "t_address"
       },
       {
-        "astId": 23510,
+        "astId": 26664,
         "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
         "label": "pinakion",
         "offset": 0,
         "slot": "2",
-        "type": "t_contract(IERC20)1229"
+        "type": "t_contract(IERC20)3021"
       },
       {
-        "astId": 23512,
+        "astId": 26666,
         "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
         "label": "jurorProsecutionModule",
         "offset": 0,
@@ -2220,44 +2422,44 @@
         "type": "t_address"
       },
       {
-        "astId": 23515,
+        "astId": 26669,
         "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
         "label": "sortitionModule",
         "offset": 0,
         "slot": "4",
-        "type": "t_contract(ISortitionModuleUniversity)23364"
+        "type": "t_contract(ISortitionModuleUniversity)26504"
       },
       {
-        "astId": 23519,
+        "astId": 26673,
         "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
         "label": "courts",
         "offset": 0,
         "slot": "5",
-        "type": "t_array(t_struct(Court)23424_storage)dyn_storage"
+        "type": "t_array(t_struct(Court)26570_storage)dyn_storage"
       },
       {
-        "astId": 23523,
+        "astId": 26677,
         "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
         "label": "disputeKits",
         "offset": 0,
         "slot": "6",
-        "type": "t_array(t_contract(IDisputeKit)23189)dyn_storage"
+        "type": "t_array(t_contract(IDisputeKit)26251)dyn_storage"
       },
       {
-        "astId": 23527,
+        "astId": 26681,
         "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
         "label": "disputes",
         "offset": 0,
         "slot": "7",
-        "type": "t_array(t_struct(Dispute)23441_storage)dyn_storage"
+        "type": "t_array(t_struct(Dispute)26591_storage)dyn_storage"
       },
       {
-        "astId": 23533,
+        "astId": 26687,
         "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
         "label": "currencyRates",
         "offset": 0,
         "slot": "8",
-        "type": "t_mapping(t_contract(IERC20)1229,t_struct(CurrencyRate)23490_storage)"
+        "type": "t_mapping(t_contract(IERC20)3021,t_struct(CurrencyRate)26647_storage)"
       }
     ],
     "types": {
@@ -2272,30 +2474,36 @@
         "label": "address[]",
         "numberOfBytes": "32"
       },
-      "t_array(t_contract(IDisputeKit)23189)dyn_storage": {
-        "base": "t_contract(IDisputeKit)23189",
+      "t_array(t_contract(IDisputeKit)26251)dyn_storage": {
+        "base": "t_contract(IDisputeKit)26251",
         "encoding": "dynamic_array",
         "label": "contract IDisputeKit[]",
         "numberOfBytes": "32"
       },
-      "t_array(t_struct(Court)23424_storage)dyn_storage": {
-        "base": "t_struct(Court)23424_storage",
+      "t_array(t_struct(Court)26570_storage)dyn_storage": {
+        "base": "t_struct(Court)26570_storage",
         "encoding": "dynamic_array",
         "label": "struct KlerosCoreUniversity.Court[]",
         "numberOfBytes": "32"
       },
-      "t_array(t_struct(Dispute)23441_storage)dyn_storage": {
-        "base": "t_struct(Dispute)23441_storage",
+      "t_array(t_struct(Dispute)26591_storage)dyn_storage": {
+        "base": "t_struct(Dispute)26591_storage",
         "encoding": "dynamic_array",
         "label": "struct KlerosCoreUniversity.Dispute[]",
         "numberOfBytes": "32"
       },
-      "t_array(t_struct(Round)23466_storage)dyn_storage": {
-        "base": "t_struct(Round)23466_storage",
+      "t_array(t_struct(Round)26623_storage)dyn_storage": {
+        "base": "t_struct(Round)26623_storage",
         "encoding": "dynamic_array",
         "label": "struct KlerosCoreUniversity.Round[]",
         "numberOfBytes": "32"
       },
+      "t_array(t_uint256)10_storage": {
+        "base": "t_uint256",
+        "encoding": "inplace",
+        "label": "uint256[10]",
+        "numberOfBytes": "320"
+      },
       "t_array(t_uint256)4_storage": {
         "base": "t_uint256",
         "encoding": "inplace",
@@ -2308,42 +2516,48 @@
         "label": "uint256[]",
         "numberOfBytes": "32"
       },
+      "t_array(t_uint96)dyn_storage": {
+        "base": "t_uint96",
+        "encoding": "dynamic_array",
+        "label": "uint96[]",
+        "numberOfBytes": "32"
+      },
       "t_bool": {
         "encoding": "inplace",
         "label": "bool",
         "numberOfBytes": "1"
       },
-      "t_contract(IArbitrableV2)22946": {
+      "t_contract(IArbitrableV2)25953": {
         "encoding": "inplace",
         "label": "contract IArbitrableV2",
         "numberOfBytes": "20"
       },
-      "t_contract(IDisputeKit)23189": {
+      "t_contract(IDisputeKit)26251": {
         "encoding": "inplace",
         "label": "contract IDisputeKit",
         "numberOfBytes": "20"
       },
-      "t_contract(IERC20)1229": {
+      "t_contract(IERC20)3021": {
         "encoding": "inplace",
         "label": "contract IERC20",
         "numberOfBytes": "20"
       },
-      "t_contract(ISortitionModuleUniversity)23364": {
+      "t_contract(ISortitionModuleUniversity)26504": {
         "encoding": "inplace",
         "label": "contract ISortitionModuleUniversity",
         "numberOfBytes": "20"
       },
-      "t_enum(Period)23398": {
+      "t_enum(Period)26542": {
         "encoding": "inplace",
         "label": "enum KlerosCoreUniversity.Period",
         "numberOfBytes": "1"
       },
-      "t_mapping(t_contract(IERC20)1229,t_struct(CurrencyRate)23490_storage)": {
+      "t_mapping(t_contract(IERC20)3021,t_struct(CurrencyRate)26647_storage)": {
         "encoding": "mapping",
-        "key": "t_contract(IERC20)1229",
+        "key": "t_contract(IERC20)3021",
         "label": "mapping(contract IERC20 => struct KlerosCoreUniversity.CurrencyRate)",
         "numberOfBytes": "32",
-        "value": "t_struct(CurrencyRate)23490_storage"
+        "value": "t_struct(CurrencyRate)26647_storage"
       },
       "t_mapping(t_uint256,t_bool)": {
         "encoding": "mapping",
@@ -2352,12 +2566,12 @@
         "numberOfBytes": "32",
         "value": "t_bool"
       },
-      "t_struct(Court)23424_storage": {
+      "t_struct(Court)26570_storage": {
         "encoding": "inplace",
         "label": "struct KlerosCoreUniversity.Court",
         "members": [
           {
-            "astId": 23400,
+            "astId": 26544,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
             "label": "parent",
             "offset": 0,
@@ -2365,7 +2579,7 @@
             "type": "t_uint96"
           },
           {
-            "astId": 23402,
+            "astId": 26546,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
             "label": "hiddenVotes",
             "offset": 12,
@@ -2373,7 +2587,7 @@
             "type": "t_bool"
           },
           {
-            "astId": 23405,
+            "astId": 26549,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
             "label": "children",
             "offset": 0,
@@ -2381,7 +2595,7 @@
             "type": "t_array(t_uint256)dyn_storage"
           },
           {
-            "astId": 23407,
+            "astId": 26551,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
             "label": "minStake",
             "offset": 0,
@@ -2389,7 +2603,7 @@
             "type": "t_uint256"
           },
           {
-            "astId": 23409,
+            "astId": 26553,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
             "label": "alpha",
             "offset": 0,
@@ -2397,7 +2611,7 @@
             "type": "t_uint256"
           },
           {
-            "astId": 23411,
+            "astId": 26555,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
             "label": "feeForJuror",
             "offset": 0,
@@ -2405,7 +2619,7 @@
             "type": "t_uint256"
           },
           {
-            "astId": 23413,
+            "astId": 26557,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
             "label": "jurorsForCourtJump",
             "offset": 0,
@@ -2413,7 +2627,7 @@
             "type": "t_uint256"
           },
           {
-            "astId": 23417,
+            "astId": 26561,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
             "label": "timesPerPeriod",
             "offset": 0,
@@ -2421,7 +2635,7 @@
             "type": "t_array(t_uint256)4_storage"
           },
           {
-            "astId": 23421,
+            "astId": 26565,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
             "label": "supportedDisputeKits",
             "offset": 0,
@@ -2429,22 +2643,22 @@
             "type": "t_mapping(t_uint256,t_bool)"
           },
           {
-            "astId": 23423,
+            "astId": 26569,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
-            "label": "disabled",
+            "label": "__gap",
             "offset": 0,
             "slot": "11",
-            "type": "t_bool"
+            "type": "t_array(t_uint256)10_storage"
           }
         ],
-        "numberOfBytes": "384"
+        "numberOfBytes": "672"
       },
-      "t_struct(CurrencyRate)23490_storage": {
+      "t_struct(CurrencyRate)26647_storage": {
         "encoding": "inplace",
         "label": "struct KlerosCoreUniversity.CurrencyRate",
         "members": [
           {
-            "astId": 23485,
+            "astId": 26642,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
             "label": "feePaymentAccepted",
             "offset": 0,
@@ -2452,7 +2666,7 @@
             "type": "t_bool"
           },
           {
-            "astId": 23487,
+            "astId": 26644,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
             "label": "rateInEth",
             "offset": 1,
@@ -2460,7 +2674,7 @@
             "type": "t_uint64"
           },
           {
-            "astId": 23489,
+            "astId": 26646,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
             "label": "rateDecimals",
             "offset": 9,
@@ -2470,12 +2684,12 @@
         ],
         "numberOfBytes": "32"
       },
-      "t_struct(Dispute)23441_storage": {
+      "t_struct(Dispute)26591_storage": {
         "encoding": "inplace",
         "label": "struct KlerosCoreUniversity.Dispute",
         "members": [
           {
-            "astId": 23426,
+            "astId": 26572,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
             "label": "courtID",
             "offset": 0,
@@ -2483,23 +2697,23 @@
             "type": "t_uint96"
           },
           {
-            "astId": 23429,
+            "astId": 26575,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
             "label": "arbitrated",
             "offset": 12,
             "slot": "0",
-            "type": "t_contract(IArbitrableV2)22946"
+            "type": "t_contract(IArbitrableV2)25953"
           },
           {
-            "astId": 23432,
+            "astId": 26578,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
             "label": "period",
             "offset": 0,
             "slot": "1",
-            "type": "t_enum(Period)23398"
+            "type": "t_enum(Period)26542"
           },
           {
-            "astId": 23434,
+            "astId": 26580,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
             "label": "ruled",
             "offset": 1,
@@ -2507,7 +2721,7 @@
             "type": "t_bool"
           },
           {
-            "astId": 23436,
+            "astId": 26582,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
             "label": "lastPeriodChange",
             "offset": 0,
@@ -2515,22 +2729,30 @@
             "type": "t_uint256"
           },
           {
-            "astId": 23440,
+            "astId": 26586,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
             "label": "rounds",
             "offset": 0,
             "slot": "3",
-            "type": "t_array(t_struct(Round)23466_storage)dyn_storage"
+            "type": "t_array(t_struct(Round)26623_storage)dyn_storage"
+          },
+          {
+            "astId": 26590,
+            "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
+            "label": "__gap",
+            "offset": 0,
+            "slot": "4",
+            "type": "t_array(t_uint256)10_storage"
           }
         ],
-        "numberOfBytes": "128"
+        "numberOfBytes": "448"
       },
-      "t_struct(Round)23466_storage": {
+      "t_struct(Round)26623_storage": {
         "encoding": "inplace",
         "label": "struct KlerosCoreUniversity.Round",
         "members": [
           {
-            "astId": 23443,
+            "astId": 26593,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
             "label": "disputeKitID",
             "offset": 0,
@@ -2538,7 +2760,7 @@
             "type": "t_uint256"
           },
           {
-            "astId": 23445,
+            "astId": 26595,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
             "label": "pnkAtStakePerJuror",
             "offset": 0,
@@ -2546,7 +2768,7 @@
             "type": "t_uint256"
           },
           {
-            "astId": 23447,
+            "astId": 26597,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
             "label": "totalFeesForJurors",
             "offset": 0,
@@ -2554,7 +2776,7 @@
             "type": "t_uint256"
           },
           {
-            "astId": 23449,
+            "astId": 26599,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
             "label": "nbVotes",
             "offset": 0,
@@ -2562,7 +2784,7 @@
             "type": "t_uint256"
           },
           {
-            "astId": 23451,
+            "astId": 26601,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
             "label": "repartitions",
             "offset": 0,
@@ -2570,7 +2792,7 @@
             "type": "t_uint256"
           },
           {
-            "astId": 23453,
+            "astId": 26603,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
             "label": "pnkPenalties",
             "offset": 0,
@@ -2578,7 +2800,7 @@
             "type": "t_uint256"
           },
           {
-            "astId": 23456,
+            "astId": 26606,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
             "label": "drawnJurors",
             "offset": 0,
@@ -2586,39 +2808,55 @@
             "type": "t_array(t_address)dyn_storage"
           },
           {
-            "astId": 23458,
+            "astId": 26609,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
-            "label": "sumFeeRewardPaid",
+            "label": "drawnJurorFromCourtIDs",
             "offset": 0,
             "slot": "7",
+            "type": "t_array(t_uint96)dyn_storage"
+          },
+          {
+            "astId": 26611,
+            "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
+            "label": "sumFeeRewardPaid",
+            "offset": 0,
+            "slot": "8",
             "type": "t_uint256"
           },
           {
-            "astId": 23460,
+            "astId": 26613,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
             "label": "sumPnkRewardPaid",
             "offset": 0,
-            "slot": "8",
+            "slot": "9",
             "type": "t_uint256"
           },
           {
-            "astId": 23463,
+            "astId": 26616,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
             "label": "feeToken",
             "offset": 0,
-            "slot": "9",
-            "type": "t_contract(IERC20)1229"
+            "slot": "10",
+            "type": "t_contract(IERC20)3021"
           },
           {
-            "astId": 23465,
+            "astId": 26618,
             "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
             "label": "drawIterations",
             "offset": 0,
-            "slot": "10",
+            "slot": "11",
             "type": "t_uint256"
+          },
+          {
+            "astId": 26622,
+            "contract": "src/arbitration/university/KlerosCoreUniversity.sol:KlerosCoreUniversity",
+            "label": "__gap",
+            "offset": 0,
+            "slot": "12",
+            "type": "t_array(t_uint256)10_storage"
           }
         ],
-        "numberOfBytes": "352"
+        "numberOfBytes": "704"
       },
       "t_uint256": {
         "encoding": "inplace",
diff --git a/contracts/deployments/arbitrumSepoliaDevnet/KlerosCoreUniversity_Proxy.json b/contracts/deployments/arbitrumSepoliaDevnet/KlerosCoreUniversity_Proxy.json
index ca2512f0b..a6b30105b 100644
--- a/contracts/deployments/arbitrumSepoliaDevnet/KlerosCoreUniversity_Proxy.json
+++ b/contracts/deployments/arbitrumSepoliaDevnet/KlerosCoreUniversity_Proxy.json
@@ -1,5 +1,5 @@
 {
-  "address": "0x5AB37F38778Bc175852fA353056591D91c744ce6",
+  "address": "0xA34dBBD0E5e1d09bd683455f9dbC393797BC558f",
   "abi": [
     {
       "inputs": [
@@ -26,50 +26,50 @@
       "type": "receive"
     }
   ],
-  "transactionHash": "0x6d19fdb430b5611f9aedf5792b44a297c36bd84d34e66ddaf82844f33eb1748a",
+  "transactionHash": "0x998456e4bf88144d618ef98fb44d1c7bb857cbbbefe8b7c523399abc23f581c1",
   "receipt": {
     "to": null,
     "from": "0xf1C7c037891525E360C59f708739Ac09A7670c59",
-    "contractAddress": "0x5AB37F38778Bc175852fA353056591D91c744ce6",
-    "transactionIndex": 1,
-    "gasUsed": "484460",
-    "logsBloom": "0x00000000000000000000000020000000000000000000000000000000020000000000000000000000000000000000000000000000000000000000000000040000000000000000000000000000000080000000000000040000000000000000000000000000020000000000000010200800402000000000000008000000000000008000000000000000000800000000000000000000000080000000000000000000000000000000800008000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004000000000000000060000000001001000000000000000000000008000000000200000000000000000000",
-    "blockHash": "0x152fd5195e3f7b8e0ab803f90700d35d20f4452193858d10558fc31c226227c8",
-    "transactionHash": "0x6d19fdb430b5611f9aedf5792b44a297c36bd84d34e66ddaf82844f33eb1748a",
+    "contractAddress": "0xA34dBBD0E5e1d09bd683455f9dbC393797BC558f",
+    "transactionIndex": 2,
+    "gasUsed": "453977",
+    "logsBloom": "0x000000000000000000000000200000000000000000000000000000000200000000000000000000000000000000000000000000000000000000000000000400000000000000000000000000000000000000800000000400000000000000000000000000000200000000000000100008004020000000000000000000000000040000008000000000000008000000000000000000000000800000000000100000000000000000000000080000000000000000000000000000000000000000000000000000000000000000000000000000000000000000040000000000000000e4000000001000000000000001000000000000000000000000000800000000000000",
+    "blockHash": "0xe5a6d446390c5a4cfe779ab765b5c591e177b2dcfe4263135a1943f55babc82f",
+    "transactionHash": "0x998456e4bf88144d618ef98fb44d1c7bb857cbbbefe8b7c523399abc23f581c1",
     "logs": [
       {
-        "transactionIndex": 1,
-        "blockNumber": 96308609,
-        "transactionHash": "0x6d19fdb430b5611f9aedf5792b44a297c36bd84d34e66ddaf82844f33eb1748a",
-        "address": "0x5AB37F38778Bc175852fA353056591D91c744ce6",
+        "transactionIndex": 2,
+        "blockNumber": 193533818,
+        "transactionHash": "0x998456e4bf88144d618ef98fb44d1c7bb857cbbbefe8b7c523399abc23f581c1",
+        "address": "0xA34dBBD0E5e1d09bd683455f9dbC393797BC558f",
         "topics": [
           "0x44063d258760b98116d53815adbc906a56b3563e540148cc0fc2457f83b5eeb2",
           "0x0000000000000000000000000000000000000000000000000000000000000001",
-          "0x000000000000000000000000d6e96b7c993763b5cdda1139c7387b82a7c8b8b5"
+          "0x00000000000000000000000082f2089442979a6b56c80274d144575980092f91"
         ],
         "data": "0x",
-        "logIndex": 0,
-        "blockHash": "0x152fd5195e3f7b8e0ab803f90700d35d20f4452193858d10558fc31c226227c8"
+        "logIndex": 3,
+        "blockHash": "0xe5a6d446390c5a4cfe779ab765b5c591e177b2dcfe4263135a1943f55babc82f"
       },
       {
-        "transactionIndex": 1,
-        "blockNumber": 96308609,
-        "transactionHash": "0x6d19fdb430b5611f9aedf5792b44a297c36bd84d34e66ddaf82844f33eb1748a",
-        "address": "0x5AB37F38778Bc175852fA353056591D91c744ce6",
+        "transactionIndex": 2,
+        "blockNumber": 193533818,
+        "transactionHash": "0x998456e4bf88144d618ef98fb44d1c7bb857cbbbefe8b7c523399abc23f581c1",
+        "address": "0xA34dBBD0E5e1d09bd683455f9dbC393797BC558f",
         "topics": [
-          "0x3475f0ed7216dd7d453db663a1c3024e4f36cc925521d54edb9d13e022cbee3d",
+          "0x550ff678017abc294b4786a99a046628d5a1eac07be0f1ea7e89543f13576ee6",
           "0x0000000000000000000000000000000000000000000000000000000000000001",
           "0x0000000000000000000000000000000000000000000000000000000000000000"
         ],
         "data": "0x000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ad78ebc5ac62000000000000000000000000000000000000000000000000000000000000000002710000000000000000000000000000000000000000000000000016345785d8a00000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000a00000000000000000000000000000000000000000000000000000000000001400000000000000000000000000000000000000000000000000000000000000000",
-        "logIndex": 1,
-        "blockHash": "0x152fd5195e3f7b8e0ab803f90700d35d20f4452193858d10558fc31c226227c8"
+        "logIndex": 4,
+        "blockHash": "0xe5a6d446390c5a4cfe779ab765b5c591e177b2dcfe4263135a1943f55babc82f"
       },
       {
-        "transactionIndex": 1,
-        "blockNumber": 96308609,
-        "transactionHash": "0x6d19fdb430b5611f9aedf5792b44a297c36bd84d34e66ddaf82844f33eb1748a",
-        "address": "0x5AB37F38778Bc175852fA353056591D91c744ce6",
+        "transactionIndex": 2,
+        "blockNumber": 193533818,
+        "transactionHash": "0x998456e4bf88144d618ef98fb44d1c7bb857cbbbefe8b7c523399abc23f581c1",
+        "address": "0xA34dBBD0E5e1d09bd683455f9dbC393797BC558f",
         "topics": [
           "0xb47629acdf64971062d40984f77d3dee212d735b11e3e8c7a4222d9f0572cc79",
           "0x0000000000000000000000000000000000000000000000000000000000000001",
@@ -77,36 +77,36 @@
           "0x0000000000000000000000000000000000000000000000000000000000000001"
         ],
         "data": "0x",
-        "logIndex": 2,
-        "blockHash": "0x152fd5195e3f7b8e0ab803f90700d35d20f4452193858d10558fc31c226227c8"
+        "logIndex": 5,
+        "blockHash": "0xe5a6d446390c5a4cfe779ab765b5c591e177b2dcfe4263135a1943f55babc82f"
       },
       {
-        "transactionIndex": 1,
-        "blockNumber": 96308609,
-        "transactionHash": "0x6d19fdb430b5611f9aedf5792b44a297c36bd84d34e66ddaf82844f33eb1748a",
-        "address": "0x5AB37F38778Bc175852fA353056591D91c744ce6",
+        "transactionIndex": 2,
+        "blockNumber": 193533818,
+        "transactionHash": "0x998456e4bf88144d618ef98fb44d1c7bb857cbbbefe8b7c523399abc23f581c1",
+        "address": "0xA34dBBD0E5e1d09bd683455f9dbC393797BC558f",
         "topics": [
           "0xc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d2"
         ],
         "data": "0x0000000000000000000000000000000000000000000000000000000000000001",
-        "logIndex": 3,
-        "blockHash": "0x152fd5195e3f7b8e0ab803f90700d35d20f4452193858d10558fc31c226227c8"
+        "logIndex": 6,
+        "blockHash": "0xe5a6d446390c5a4cfe779ab765b5c591e177b2dcfe4263135a1943f55babc82f"
       }
     ],
-    "blockNumber": 96308609,
-    "cumulativeGasUsed": "484460",
+    "blockNumber": 193533818,
+    "cumulativeGasUsed": "582464",
     "status": 1,
     "byzantium": true
   },
   "args": [
-    "0xF74DaBfC5F5dbdBD07636637204d9C35326D2906",
-    "0xe399d29b000000000000000000000000f1c7c037891525e360c59f708739ac09a7670c59000000000000000000000000f1c7c037891525e360c59f708739ac09a7670c5900000000000000000000000034b944d42cacfc8266955d07a80181d2054aa2250000000000000000000000000000000000000000000000000000000000000000000000000000000000000000d6e96b7c993763b5cdda1139c7387b82a7c8b8b5000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ad78ebc5ac62000000000000000000000000000000000000000000000000000000000000000002710000000000000000000000000000000000000000000000000016345785d8a00000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000a0000000000000000000000004b2c2d048921f694cce3aea35698c6b1f5fcbb79"
+    "0xb75b0cc01af4aD0D65D50082ae0717004D479Aa0",
+    "0xe399d29b000000000000000000000000f1c7c037891525e360c59f708739ac09a7670c59000000000000000000000000f1c7c037891525e360c59f708739ac09a7670c5900000000000000000000000034b944d42cacfc8266955d07a80181d2054aa225000000000000000000000000000000000000000000000000000000000000000000000000000000000000000082f2089442979a6b56c80274d144575980092f91000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ad78ebc5ac62000000000000000000000000000000000000000000000000000000000000000002710000000000000000000000000000000000000000000000000016345785d8a00000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000a0000000000000000000000009f55804177e7e44e558616cd7d06b865788214ca"
   ],
   "numDeployments": 1,
-  "solcInputHash": "a5602534c00c2f67ca4b6a1cab8c717e",
-  "metadata": "{\"compiler\":{\"version\":\"0.8.24+commit.e11b9ed9\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_implementation\",\"type\":\"address\"},{\"internalType\":\"bytes\",\"name\":\"_data\",\"type\":\"bytes\"}],\"stateMutability\":\"nonpayable\",\"type\":\"constructor\"},{\"stateMutability\":\"payable\",\"type\":\"fallback\"},{\"stateMutability\":\"payable\",\"type\":\"receive\"}],\"devdoc\":{\"kind\":\"dev\",\"methods\":{},\"version\":1},\"userdoc\":{\"kind\":\"user\",\"methods\":{},\"version\":1}},\"settings\":{\"compilationTarget\":{\"src/proxy/KlerosProxies.sol\":\"KlerosCoreUniversityProxy\"},\"evmVersion\":\"paris\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\",\"useLiteralContent\":true},\"optimizer\":{\"enabled\":true,\"runs\":100},\"remappings\":[]},\"sources\":{\"src/proxy/KlerosProxies.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n\\npragma solidity 0.8.24;\\n\\nimport \\\"./UUPSProxy.sol\\\";\\n\\n/// Workaround to get meaningful names for the proxy contracts\\n/// Otherwise all the contracts are called `UUPSProxy` on the chain explorers\\n\\ncontract DisputeKitClassicNeoProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitClassicUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitClassicProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeTemplateRegistryProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract EvidenceModuleProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract ForeignGatewayOnEthereumProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract HomeGatewayToEthereumProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreNeoProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreRulerProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract PolicyRegistryProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract RandomizerRNGProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleNeoProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\",\"keccak256\":\"0x4393c05bbfda204b9992e1e546142a0fbf4c92a1c4061f5985463d02a71b84d4\",\"license\":\"MIT\"},\"src/proxy/UUPSProxy.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n// Adapted from <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/ERC1967/ERC1967Proxy.sol>\\n\\n/**\\n *  @authors: [@malatrax]\\n *  @reviewers: []\\n *  @auditors: []\\n *  @bounties: []\\n *  @deployments: []\\n */\\npragma solidity 0.8.24;\\n\\n/**\\n * @title UUPS Proxy\\n * @author Simon Malatrait <simon.malatrait@grenoble-inp.org>\\n * @dev This contract implements a UUPS Proxy compliant with ERC-1967 & ERC-1822.\\n * @dev This contract delegates all calls to another contract (UUPS Proxiable) through a fallback function and the use of the `delegatecall` EVM instruction.\\n * @dev We refer to the Proxiable contract (as per ERC-1822) with `implementation`.\\n */\\ncontract UUPSProxy {\\n    /**\\n     * @dev Storage slot with the address of the current implementation.\\n     * This is the keccak-256 hash of \\\"eip1967.proxy.implementation\\\" subtracted by 1, and is\\n     * validated in the constructor.\\n     * NOTE: bytes32(uint256(keccak256('eip1967.proxy.implementation')) - 1)\\n     */\\n    bytes32 private constant IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;\\n\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Initializes the upgradeable proxy with an initial implementation specified by `_implementation`.\\n     *\\n     * If `_data` is nonempty, it's used as data in a delegate call to `_implementation`. This will typically be an encoded\\n     * function call, and allows initializing the storage of the proxy like a Solidity constructor.\\n     */\\n    constructor(address _implementation, bytes memory _data) {\\n        assembly {\\n            sstore(IMPLEMENTATION_SLOT, _implementation)\\n        }\\n\\n        if (_data.length != 0) {\\n            (bool success, ) = _implementation.delegatecall(_data);\\n            require(success, \\\"Proxy Constructor failed\\\");\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Delegates the current call to `implementation`.\\n     *\\n     * NOTE: This function does not return to its internal call site, it will return directly to the external caller.\\n     */\\n    function _delegate(address implementation) internal {\\n        assembly {\\n            // Copy msg.data. We take full control of memory in this inline assembly\\n            // block because it will not return to Solidity code. We overwrite the\\n            // Solidity scratch pad at memory position 0.\\n            calldatacopy(0, 0, calldatasize())\\n\\n            // Call the implementation.\\n            // out and outsize are 0 because we don't know the size yet.\\n            let result := delegatecall(gas(), implementation, 0, calldatasize(), 0, 0)\\n\\n            // Copy the returned data.\\n            returndatacopy(0, 0, returndatasize())\\n\\n            switch result\\n            // delegatecall returns 0 on error.\\n            case 0 {\\n                revert(0, returndatasize())\\n            }\\n            default {\\n                return(0, returndatasize())\\n            }\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Internal Views            * //\\n    // ************************************* //\\n\\n    function _getImplementation() internal view returns (address implementation) {\\n        assembly {\\n            implementation := sload(IMPLEMENTATION_SLOT)\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Fallback                * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Fallback function that delegates calls to the address returned by `_implementation()`. Will run if no other\\n     * function in the contract matches the call data.\\n     */\\n    fallback() external payable {\\n        _delegate(_getImplementation());\\n    }\\n\\n    receive() external payable {\\n        _delegate(_getImplementation());\\n    }\\n}\\n\",\"keccak256\":\"0x7aa5f14ce351299722ac1a1afca9e65e1c795f32ea3e9702b0d5faaf7ca822a0\",\"license\":\"MIT\"}},\"version\":1}",
-  "bytecode": "0x608060405234801561001057600080fd5b5060405161030238038061030283398101604081905261002f91610151565b8181817f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc55805160001461010e576000826001600160a01b031682604051610077919061021f565b600060405180830381855af49150503d80600081146100b2576040519150601f19603f3d011682016040523d82523d6000602084013e6100b7565b606091505b505090508061010c5760405162461bcd60e51b815260206004820152601860248201527f50726f787920436f6e7374727563746f72206661696c65640000000000000000604482015260640160405180910390fd5b505b5050505061023b565b634e487b7160e01b600052604160045260246000fd5b60005b83811015610148578181015183820152602001610130565b50506000910152565b6000806040838503121561016457600080fd5b82516001600160a01b038116811461017b57600080fd5b60208401519092506001600160401b038082111561019857600080fd5b818501915085601f8301126101ac57600080fd5b8151818111156101be576101be610117565b604051601f8201601f19908116603f011681019083821181831017156101e6576101e6610117565b816040528281528860208487010111156101ff57600080fd5b61021083602083016020880161012d565b80955050505050509250929050565b6000825161023181846020870161012d565b9190910192915050565b60b9806102496000396000f3fe608060405236603757603560317f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5490565b6060565b005b603560317f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5490565b3660008037600080366000845af43d6000803e808015607e573d6000f35b3d6000fdfea2646970667358221220025ed3e852b24305c0ac2e202b83cf5fed6ae313e772bad4b0c1340efea75f0764736f6c63430008180033",
-  "deployedBytecode": "0x608060405236603757603560317f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5490565b6060565b005b603560317f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5490565b3660008037600080366000845af43d6000803e808015607e573d6000f35b3d6000fdfea2646970667358221220025ed3e852b24305c0ac2e202b83cf5fed6ae313e772bad4b0c1340efea75f0764736f6c63430008180033",
+  "solcInputHash": "d547d738900bce1310e91a5d1adfc179",
+  "metadata": "{\"compiler\":{\"version\":\"0.8.30+commit.73712a01\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_implementation\",\"type\":\"address\"},{\"internalType\":\"bytes\",\"name\":\"_data\",\"type\":\"bytes\"}],\"stateMutability\":\"nonpayable\",\"type\":\"constructor\"},{\"stateMutability\":\"payable\",\"type\":\"fallback\"},{\"stateMutability\":\"payable\",\"type\":\"receive\"}],\"devdoc\":{\"kind\":\"dev\",\"methods\":{},\"version\":1},\"userdoc\":{\"kind\":\"user\",\"methods\":{},\"version\":1}},\"settings\":{\"compilationTarget\":{\"src/proxy/KlerosProxies.sol\":\"KlerosCoreUniversityProxy\"},\"evmVersion\":\"cancun\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\",\"useLiteralContent\":true},\"optimizer\":{\"enabled\":true,\"runs\":1000},\"remappings\":[],\"viaIR\":true},\"sources\":{\"src/proxy/KlerosProxies.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\nimport \\\"./UUPSProxy.sol\\\";\\n\\n/// Workaround to get meaningful names for the proxy contracts\\n/// Otherwise all the contracts are called `UUPSProxy` on the chain explorers\\n\\ncontract DisputeKitClassicUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitClassicProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitGatedProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitGatedShutterProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitShutterProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitSybilResistantProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeTemplateRegistryProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract EvidenceModuleProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract ForeignGatewayOnEthereumProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract HomeGatewayToEthereumProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreRulerProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract PolicyRegistryProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract RandomizerRNGProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\",\"keccak256\":\"0x3160bd320b23c6ec0c21862b455c3044a9b33654ae84a1b6cd76255626c9154b\",\"license\":\"MIT\"},\"src/proxy/UUPSProxy.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\n/// @title UUPS Proxy\\n/// @author Simon Malatrait <simon.malatrait@grenoble-inp.org>\\n/// @notice This contract implements a UUPS Proxy compliant with ERC-1967 & ERC-1822.\\n///\\n/// @dev This contract delegates all calls to another contract (UUPS Proxiable) through a fallback function and the use of the `delegatecall` EVM instruction.\\n/// We refer to the Proxiable contract (as per ERC-1822) with `implementation`.\\n/// Adapted from <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/ERC1967/ERC1967Proxy.sol>\\ncontract UUPSProxy {\\n    /// @dev Storage slot with the address of the current implementation.\\n    /// This is the keccak-256 hash of \\\"eip1967.proxy.implementation\\\" subtracted by 1, and is\\n    /// validated in the constructor.\\n    /// NOTE: bytes32(uint256(keccak256('eip1967.proxy.implementation')) - 1)\\n    bytes32 private constant IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;\\n\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    /// @notice Initializes the upgradeable proxy with an initial implementation specified by `_implementation`.\\n    /// @dev If `_data` is nonempty, it's used as data in a delegate call to `_implementation`.\\n    /// This will typically be an encoded function call, and allows initializing the storage of the proxy like a Solidity constructor.\\n    constructor(address _implementation, bytes memory _data) {\\n        assembly {\\n            sstore(IMPLEMENTATION_SLOT, _implementation)\\n        }\\n\\n        if (_data.length != 0) {\\n            (bool success, ) = _implementation.delegatecall(_data);\\n            require(success, \\\"Proxy Constructor failed\\\");\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @dev Delegates the current call to `implementation`.\\n    /// NOTE: This function does not return to its internal call site, it will return directly to the external caller.\\n    function _delegate(address implementation) internal {\\n        assembly {\\n            // Copy msg.data. We take full control of memory in this inline assembly\\n            // block because it will not return to Solidity code. We overwrite the\\n            // Solidity scratch pad at memory position 0.\\n            calldatacopy(0, 0, calldatasize())\\n\\n            // Call the implementation.\\n            // out and outsize are 0 because we don't know the size yet.\\n            let result := delegatecall(gas(), implementation, 0, calldatasize(), 0, 0)\\n\\n            // Copy the returned data.\\n            returndatacopy(0, 0, returndatasize())\\n\\n            switch result\\n            // delegatecall returns 0 on error.\\n            case 0 {\\n                revert(0, returndatasize())\\n            }\\n            default {\\n                return(0, returndatasize())\\n            }\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Internal Views            * //\\n    // ************************************* //\\n\\n    function _getImplementation() internal view returns (address implementation) {\\n        assembly {\\n            implementation := sload(IMPLEMENTATION_SLOT)\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Fallback                * //\\n    // ************************************* //\\n\\n    /// @dev Fallback function that delegates calls to the address returned by `_implementation()`.\\n    /// @dev Will run if no other function in the contract matches the call data.\\n    fallback() external payable {\\n        _delegate(_getImplementation());\\n    }\\n\\n    receive() external payable {\\n        _delegate(_getImplementation());\\n    }\\n}\\n\",\"keccak256\":\"0x2d7b1f81e525787f1b8b033ce381a81cb5f39e411ff31490e019113205a661cd\",\"license\":\"MIT\"}},\"version\":1}",
+  "bytecode": "0x608060405234610144576102148038038061001981610148565b928339810190604081830312610144578051906001600160a01b0382168203610144576020810151906001600160401b038211610144570182601f8201121561014457805161006f61006a82610181565b610148565b9181835260208301946020838301011161014457815f926020809301875e83010152817f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5551806100c9575b6040516077908161019d8239f35b5f9283925af43d1561013f573d6100e261006a82610181565b9081525f60203d92013e5b156100fa575f80806100bb565b60405162461bcd60e51b815260206004820152601860248201527f50726f787920436f6e7374727563746f72206661696c656400000000000000006044820152606490fd5b6100ed565b5f80fd5b6040519190601f01601f191682016001600160401b0381118382101761016d57604052565b634e487b7160e01b5f52604160045260245ffd5b6001600160401b03811161016d57601f01601f19166020019056fe60806040525f807f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc54368280378136915af43d5f803e15603d573d5ff35b3d5ffdfea264697066735822122094c812c85dc437a2ab3eda19f621c1ecfc3fbf77e5465f816bde0529d28053a664736f6c634300081e0033",
+  "deployedBytecode": "0x60806040525f807f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc54368280378136915af43d5f803e15603d573d5ff35b3d5ffdfea264697066735822122094c812c85dc437a2ab3eda19f621c1ecfc3fbf77e5465f816bde0529d28053a664736f6c634300081e0033",
   "devdoc": {
     "kind": "dev",
     "methods": {},
diff --git a/contracts/deployments/arbitrumSepoliaDevnet/SortitionModuleUniversity.json b/contracts/deployments/arbitrumSepoliaDevnet/SortitionModuleUniversity.json
index 1ce05ea30..539868fe6 100644
--- a/contracts/deployments/arbitrumSepoliaDevnet/SortitionModuleUniversity.json
+++ b/contracts/deployments/arbitrumSepoliaDevnet/SortitionModuleUniversity.json
@@ -1,5 +1,5 @@
 {
-  "address": "0x4B2c2d048921f694cCE3AEa35698c6B1f5fcbb79",
+  "address": "0x9f55804177e7E44E558616cD7d06B865788214cA",
   "abi": [
     {
       "stateMutability": "payable",
@@ -30,11 +30,26 @@
       "name": "InvalidImplementation",
       "type": "error"
     },
+    {
+      "inputs": [],
+      "name": "KlerosCoreOnly",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "NotEligibleForWithdrawal",
+      "type": "error"
+    },
     {
       "inputs": [],
       "name": "NotInitializing",
       "type": "error"
     },
+    {
+      "inputs": [],
+      "name": "OwnerOnly",
+      "type": "error"
+    },
     {
       "inputs": [],
       "name": "UUPSUnauthorizedCallContext",
@@ -64,6 +79,44 @@
       "name": "Initialized",
       "type": "event"
     },
+    {
+      "anonymous": false,
+      "inputs": [
+        {
+          "indexed": true,
+          "internalType": "address",
+          "name": "_account",
+          "type": "address"
+        },
+        {
+          "indexed": false,
+          "internalType": "uint256",
+          "name": "_amount",
+          "type": "uint256"
+        }
+      ],
+      "name": "LeftoverPNK",
+      "type": "event"
+    },
+    {
+      "anonymous": false,
+      "inputs": [
+        {
+          "indexed": true,
+          "internalType": "address",
+          "name": "_account",
+          "type": "address"
+        },
+        {
+          "indexed": false,
+          "internalType": "uint256",
+          "name": "_amount",
+          "type": "uint256"
+        }
+      ],
+      "name": "LeftoverPNKWithdrawn",
+      "type": "event"
+    },
     {
       "anonymous": false,
       "inputs": [
@@ -122,6 +175,12 @@
           "internalType": "uint256",
           "name": "_amount",
           "type": "uint256"
+        },
+        {
+          "indexed": false,
+          "internalType": "uint256",
+          "name": "_amountAllCourts",
+          "type": "uint256"
         }
       ],
       "name": "StakeSet",
@@ -174,9 +233,9 @@
     {
       "inputs": [
         {
-          "internalType": "bytes32",
-          "name": "_key",
-          "type": "bytes32"
+          "internalType": "uint96",
+          "name": "_courtID",
+          "type": "uint96"
         },
         {
           "internalType": "bytes",
@@ -205,9 +264,9 @@
     {
       "inputs": [
         {
-          "internalType": "bytes32",
+          "internalType": "uint96",
           "name": "",
-          "type": "bytes32"
+          "type": "uint96"
         },
         {
           "internalType": "uint256",
@@ -226,11 +285,60 @@
           "internalType": "address",
           "name": "drawnAddress",
           "type": "address"
+        },
+        {
+          "internalType": "uint96",
+          "name": "fromSubcourtID",
+          "type": "uint96"
         }
       ],
       "stateMutability": "view",
       "type": "function"
     },
+    {
+      "inputs": [
+        {
+          "internalType": "uint256",
+          "name": "_iterations",
+          "type": "uint256"
+        }
+      ],
+      "name": "executeDelayedStakes",
+      "outputs": [],
+      "stateMutability": "nonpayable",
+      "type": "function"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "address",
+          "name": "_account",
+          "type": "address"
+        },
+        {
+          "internalType": "uint96",
+          "name": "_courtID",
+          "type": "uint96"
+        }
+      ],
+      "name": "forcedUnstake",
+      "outputs": [],
+      "stateMutability": "nonpayable",
+      "type": "function"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "address",
+          "name": "_account",
+          "type": "address"
+        }
+      ],
+      "name": "forcedUnstakeAllCourts",
+      "outputs": [],
+      "stateMutability": "nonpayable",
+      "type": "function"
+    },
     {
       "inputs": [
         {
@@ -290,15 +398,21 @@
       "type": "function"
     },
     {
-      "inputs": [],
-      "name": "governor",
-      "outputs": [
+      "inputs": [
         {
           "internalType": "address",
-          "name": "",
+          "name": "_juror",
           "type": "address"
         }
       ],
+      "name": "getJurorLeftoverPNK",
+      "outputs": [
+        {
+          "internalType": "uint256",
+          "name": "",
+          "type": "uint256"
+        }
+      ],
       "stateMutability": "view",
       "type": "function"
     },
@@ -306,7 +420,7 @@
       "inputs": [
         {
           "internalType": "address",
-          "name": "_governor",
+          "name": "_owner",
           "type": "address"
         },
         {
@@ -382,32 +496,21 @@
       "type": "function"
     },
     {
-      "inputs": [
+      "inputs": [],
+      "name": "owner",
+      "outputs": [
         {
-          "internalType": "uint256",
-          "name": "_randomNumber",
-          "type": "uint256"
+          "internalType": "address",
+          "name": "",
+          "type": "address"
         }
       ],
-      "name": "notifyRandomNumber",
-      "outputs": [],
-      "stateMutability": "nonpayable",
+      "stateMutability": "view",
       "type": "function"
     },
     {
-      "inputs": [
-        {
-          "internalType": "address",
-          "name": "_account",
-          "type": "address"
-        },
-        {
-          "internalType": "uint256",
-          "name": "_relativeAmount",
-          "type": "uint256"
-        }
-      ],
-      "name": "penalizeStake",
+      "inputs": [],
+      "name": "passPhase",
       "outputs": [],
       "stateMutability": "nonpayable",
       "type": "function"
@@ -449,9 +552,29 @@
           "internalType": "address",
           "name": "_account",
           "type": "address"
+        },
+        {
+          "internalType": "uint96",
+          "name": "_courtID",
+          "type": "uint96"
+        },
+        {
+          "internalType": "uint256",
+          "name": "_pnkDeposit",
+          "type": "uint256"
+        },
+        {
+          "internalType": "uint256",
+          "name": "_pnkWithdrawal",
+          "type": "uint256"
+        },
+        {
+          "internalType": "uint256",
+          "name": "_newStake",
+          "type": "uint256"
         }
       ],
-      "name": "setJurorInactive",
+      "name": "setStake",
       "outputs": [],
       "stateMutability": "nonpayable",
       "type": "function"
@@ -470,31 +593,55 @@
         },
         {
           "internalType": "uint256",
-          "name": "_newStake",
+          "name": "_penalty",
           "type": "uint256"
-        },
-        {
-          "internalType": "bool",
-          "name": "_alreadyTransferred",
-          "type": "bool"
         }
       ],
-      "name": "setStake",
+      "name": "setStakePenalty",
       "outputs": [
         {
           "internalType": "uint256",
-          "name": "pnkDeposit",
+          "name": "pnkBalance",
           "type": "uint256"
         },
         {
           "internalType": "uint256",
-          "name": "pnkWithdrawal",
+          "name": "newCourtStake",
           "type": "uint256"
         },
         {
-          "internalType": "enum StakingResult",
-          "name": "stakingResult",
-          "type": "uint8"
+          "internalType": "uint256",
+          "name": "availablePenalty",
+          "type": "uint256"
+        }
+      ],
+      "stateMutability": "nonpayable",
+      "type": "function"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "address",
+          "name": "_account",
+          "type": "address"
+        },
+        {
+          "internalType": "uint96",
+          "name": "_courtID",
+          "type": "uint96"
+        },
+        {
+          "internalType": "uint256",
+          "name": "_reward",
+          "type": "uint256"
+        }
+      ],
+      "name": "setStakeReward",
+      "outputs": [
+        {
+          "internalType": "bool",
+          "name": "success",
+          "type": "bool"
         }
       ],
       "stateMutability": "nonpayable",
@@ -549,6 +696,76 @@
       "stateMutability": "payable",
       "type": "function"
     },
+    {
+      "inputs": [
+        {
+          "internalType": "address",
+          "name": "_account",
+          "type": "address"
+        },
+        {
+          "internalType": "uint96",
+          "name": "_courtID",
+          "type": "uint96"
+        },
+        {
+          "internalType": "uint256",
+          "name": "_newStake",
+          "type": "uint256"
+        },
+        {
+          "internalType": "bool",
+          "name": "",
+          "type": "bool"
+        }
+      ],
+      "name": "validateStake",
+      "outputs": [
+        {
+          "internalType": "uint256",
+          "name": "pnkDeposit",
+          "type": "uint256"
+        },
+        {
+          "internalType": "uint256",
+          "name": "pnkWithdrawal",
+          "type": "uint256"
+        },
+        {
+          "internalType": "enum StakingResult",
+          "name": "stakingResult",
+          "type": "uint8"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
+    {
+      "inputs": [],
+      "name": "version",
+      "outputs": [
+        {
+          "internalType": "string",
+          "name": "",
+          "type": "string"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "address",
+          "name": "_account",
+          "type": "address"
+        }
+      ],
+      "name": "withdrawLeftoverPNK",
+      "outputs": [],
+      "stateMutability": "nonpayable",
+      "type": "function"
+    },
     {
       "inputs": [
         {
@@ -566,52 +783,52 @@
       "type": "constructor"
     }
   ],
-  "transactionHash": "0xb26dc1c9ca9c3ed561a1d9c3feaad474af38bc90ea240f927053e5e5868d6a7e",
+  "transactionHash": "0x816a335385508eb3b23f6e38ecbdb464110275a0059895f982bfb692c8e7a452",
   "receipt": {
     "to": null,
     "from": "0xf1C7c037891525E360C59f708739Ac09A7670c59",
-    "contractAddress": "0x4B2c2d048921f694cCE3AEa35698c6B1f5fcbb79",
-    "transactionIndex": 1,
-    "gasUsed": "210047",
-    "logsBloom": "0x00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000080000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010800000020000000000000000080000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
-    "blockHash": "0x6a08d6d6cf180ae6bf3126f86fbedfd17212528b22a7a9403addd2dd6b1109c3",
-    "transactionHash": "0xb26dc1c9ca9c3ed561a1d9c3feaad474af38bc90ea240f927053e5e5868d6a7e",
+    "contractAddress": "0x9f55804177e7E44E558616cD7d06B865788214cA",
+    "transactionIndex": 2,
+    "gasUsed": "180483",
+    "logsBloom": "0x00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000080000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000800000000000000000000000080000000000000000000000000000000000000000000000000000000000020000000000000000000000000000000000000000000000000000000000000000004000000000000000000000000000000000000000008000000000000000000000000000000000000000000",
+    "blockHash": "0xeb89982fc4a65212a277169f078d43cd1578b93b962c37ded52f9ddeb92610af",
+    "transactionHash": "0x816a335385508eb3b23f6e38ecbdb464110275a0059895f982bfb692c8e7a452",
     "logs": [
       {
-        "transactionIndex": 1,
-        "blockNumber": 96308572,
-        "transactionHash": "0xb26dc1c9ca9c3ed561a1d9c3feaad474af38bc90ea240f927053e5e5868d6a7e",
-        "address": "0x4B2c2d048921f694cCE3AEa35698c6B1f5fcbb79",
+        "transactionIndex": 2,
+        "blockNumber": 193533797,
+        "transactionHash": "0x816a335385508eb3b23f6e38ecbdb464110275a0059895f982bfb692c8e7a452",
+        "address": "0x9f55804177e7E44E558616cD7d06B865788214cA",
         "topics": [
           "0xc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d2"
         ],
         "data": "0x0000000000000000000000000000000000000000000000000000000000000001",
-        "logIndex": 0,
-        "blockHash": "0x6a08d6d6cf180ae6bf3126f86fbedfd17212528b22a7a9403addd2dd6b1109c3"
+        "logIndex": 1,
+        "blockHash": "0xeb89982fc4a65212a277169f078d43cd1578b93b962c37ded52f9ddeb92610af"
       }
     ],
-    "blockNumber": 96308572,
-    "cumulativeGasUsed": "210047",
+    "blockNumber": 193533797,
+    "cumulativeGasUsed": "214736",
     "status": 1,
     "byzantium": true
   },
   "args": [
-    "0x5CAD621D69E0535422aCFaCC0017bC32beC7A486",
-    "0x485cc955000000000000000000000000f1c7c037891525e360c59f708739ac09a7670c590000000000000000000000005ab37f38778bc175852fa353056591d91c744ce6"
+    "0x270e3D63d3d275604df0a1Bd312E1255DCd96936",
+    "0x485cc955000000000000000000000000f1c7c037891525e360c59f708739ac09a7670c59000000000000000000000000a34dbbd0e5e1d09bd683455f9dbc393797bc558f"
   ],
   "numDeployments": 1,
-  "solcInputHash": "a5602534c00c2f67ca4b6a1cab8c717e",
-  "metadata": "{\"compiler\":{\"version\":\"0.8.24+commit.e11b9ed9\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_implementation\",\"type\":\"address\"},{\"internalType\":\"bytes\",\"name\":\"_data\",\"type\":\"bytes\"}],\"stateMutability\":\"nonpayable\",\"type\":\"constructor\"},{\"stateMutability\":\"payable\",\"type\":\"fallback\"},{\"stateMutability\":\"payable\",\"type\":\"receive\"}],\"devdoc\":{\"kind\":\"dev\",\"methods\":{},\"version\":1},\"userdoc\":{\"kind\":\"user\",\"methods\":{},\"version\":1}},\"settings\":{\"compilationTarget\":{\"src/proxy/KlerosProxies.sol\":\"SortitionModuleUniversityProxy\"},\"evmVersion\":\"paris\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\",\"useLiteralContent\":true},\"optimizer\":{\"enabled\":true,\"runs\":100},\"remappings\":[]},\"sources\":{\"src/proxy/KlerosProxies.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n\\npragma solidity 0.8.24;\\n\\nimport \\\"./UUPSProxy.sol\\\";\\n\\n/// Workaround to get meaningful names for the proxy contracts\\n/// Otherwise all the contracts are called `UUPSProxy` on the chain explorers\\n\\ncontract DisputeKitClassicNeoProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitClassicUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitClassicProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeTemplateRegistryProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract EvidenceModuleProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract ForeignGatewayOnEthereumProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract HomeGatewayToEthereumProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreNeoProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreRulerProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract PolicyRegistryProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract RandomizerRNGProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleNeoProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\",\"keccak256\":\"0x4393c05bbfda204b9992e1e546142a0fbf4c92a1c4061f5985463d02a71b84d4\",\"license\":\"MIT\"},\"src/proxy/UUPSProxy.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n// Adapted from <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/ERC1967/ERC1967Proxy.sol>\\n\\n/**\\n *  @authors: [@malatrax]\\n *  @reviewers: []\\n *  @auditors: []\\n *  @bounties: []\\n *  @deployments: []\\n */\\npragma solidity 0.8.24;\\n\\n/**\\n * @title UUPS Proxy\\n * @author Simon Malatrait <simon.malatrait@grenoble-inp.org>\\n * @dev This contract implements a UUPS Proxy compliant with ERC-1967 & ERC-1822.\\n * @dev This contract delegates all calls to another contract (UUPS Proxiable) through a fallback function and the use of the `delegatecall` EVM instruction.\\n * @dev We refer to the Proxiable contract (as per ERC-1822) with `implementation`.\\n */\\ncontract UUPSProxy {\\n    /**\\n     * @dev Storage slot with the address of the current implementation.\\n     * This is the keccak-256 hash of \\\"eip1967.proxy.implementation\\\" subtracted by 1, and is\\n     * validated in the constructor.\\n     * NOTE: bytes32(uint256(keccak256('eip1967.proxy.implementation')) - 1)\\n     */\\n    bytes32 private constant IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;\\n\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Initializes the upgradeable proxy with an initial implementation specified by `_implementation`.\\n     *\\n     * If `_data` is nonempty, it's used as data in a delegate call to `_implementation`. This will typically be an encoded\\n     * function call, and allows initializing the storage of the proxy like a Solidity constructor.\\n     */\\n    constructor(address _implementation, bytes memory _data) {\\n        assembly {\\n            sstore(IMPLEMENTATION_SLOT, _implementation)\\n        }\\n\\n        if (_data.length != 0) {\\n            (bool success, ) = _implementation.delegatecall(_data);\\n            require(success, \\\"Proxy Constructor failed\\\");\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Delegates the current call to `implementation`.\\n     *\\n     * NOTE: This function does not return to its internal call site, it will return directly to the external caller.\\n     */\\n    function _delegate(address implementation) internal {\\n        assembly {\\n            // Copy msg.data. We take full control of memory in this inline assembly\\n            // block because it will not return to Solidity code. We overwrite the\\n            // Solidity scratch pad at memory position 0.\\n            calldatacopy(0, 0, calldatasize())\\n\\n            // Call the implementation.\\n            // out and outsize are 0 because we don't know the size yet.\\n            let result := delegatecall(gas(), implementation, 0, calldatasize(), 0, 0)\\n\\n            // Copy the returned data.\\n            returndatacopy(0, 0, returndatasize())\\n\\n            switch result\\n            // delegatecall returns 0 on error.\\n            case 0 {\\n                revert(0, returndatasize())\\n            }\\n            default {\\n                return(0, returndatasize())\\n            }\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Internal Views            * //\\n    // ************************************* //\\n\\n    function _getImplementation() internal view returns (address implementation) {\\n        assembly {\\n            implementation := sload(IMPLEMENTATION_SLOT)\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Fallback                * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Fallback function that delegates calls to the address returned by `_implementation()`. Will run if no other\\n     * function in the contract matches the call data.\\n     */\\n    fallback() external payable {\\n        _delegate(_getImplementation());\\n    }\\n\\n    receive() external payable {\\n        _delegate(_getImplementation());\\n    }\\n}\\n\",\"keccak256\":\"0x7aa5f14ce351299722ac1a1afca9e65e1c795f32ea3e9702b0d5faaf7ca822a0\",\"license\":\"MIT\"}},\"version\":1}",
-  "bytecode": "0x608060405234801561001057600080fd5b5060405161030238038061030283398101604081905261002f91610151565b8181817f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc55805160001461010e576000826001600160a01b031682604051610077919061021f565b600060405180830381855af49150503d80600081146100b2576040519150601f19603f3d011682016040523d82523d6000602084013e6100b7565b606091505b505090508061010c5760405162461bcd60e51b815260206004820152601860248201527f50726f787920436f6e7374727563746f72206661696c65640000000000000000604482015260640160405180910390fd5b505b5050505061023b565b634e487b7160e01b600052604160045260246000fd5b60005b83811015610148578181015183820152602001610130565b50506000910152565b6000806040838503121561016457600080fd5b82516001600160a01b038116811461017b57600080fd5b60208401519092506001600160401b038082111561019857600080fd5b818501915085601f8301126101ac57600080fd5b8151818111156101be576101be610117565b604051601f8201601f19908116603f011681019083821181831017156101e6576101e6610117565b816040528281528860208487010111156101ff57600080fd5b61021083602083016020880161012d565b80955050505050509250929050565b6000825161023181846020870161012d565b9190910192915050565b60b9806102496000396000f3fe608060405236603757603560317f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5490565b6060565b005b603560317f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5490565b3660008037600080366000845af43d6000803e808015607e573d6000f35b3d6000fdfea2646970667358221220cbf6c95b71e3c03306025a1af7f6aa4f021b4a8c8f5a8c68988b35c4442edb4964736f6c63430008180033",
-  "deployedBytecode": "0x608060405236603757603560317f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5490565b6060565b005b603560317f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5490565b3660008037600080366000845af43d6000803e808015607e573d6000f35b3d6000fdfea2646970667358221220cbf6c95b71e3c03306025a1af7f6aa4f021b4a8c8f5a8c68988b35c4442edb4964736f6c63430008180033",
+  "solcInputHash": "d547d738900bce1310e91a5d1adfc179",
+  "metadata": "{\"compiler\":{\"version\":\"0.8.30+commit.73712a01\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_implementation\",\"type\":\"address\"},{\"internalType\":\"bytes\",\"name\":\"_data\",\"type\":\"bytes\"}],\"stateMutability\":\"nonpayable\",\"type\":\"constructor\"},{\"stateMutability\":\"payable\",\"type\":\"fallback\"},{\"stateMutability\":\"payable\",\"type\":\"receive\"}],\"devdoc\":{\"kind\":\"dev\",\"methods\":{},\"version\":1},\"userdoc\":{\"kind\":\"user\",\"methods\":{},\"version\":1}},\"settings\":{\"compilationTarget\":{\"src/proxy/KlerosProxies.sol\":\"SortitionModuleUniversityProxy\"},\"evmVersion\":\"cancun\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\",\"useLiteralContent\":true},\"optimizer\":{\"enabled\":true,\"runs\":1000},\"remappings\":[],\"viaIR\":true},\"sources\":{\"src/proxy/KlerosProxies.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\nimport \\\"./UUPSProxy.sol\\\";\\n\\n/// Workaround to get meaningful names for the proxy contracts\\n/// Otherwise all the contracts are called `UUPSProxy` on the chain explorers\\n\\ncontract DisputeKitClassicUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitClassicProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitGatedProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitGatedShutterProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitShutterProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitSybilResistantProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeTemplateRegistryProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract EvidenceModuleProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract ForeignGatewayOnEthereumProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract HomeGatewayToEthereumProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreRulerProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract PolicyRegistryProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract RandomizerRNGProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\",\"keccak256\":\"0x3160bd320b23c6ec0c21862b455c3044a9b33654ae84a1b6cd76255626c9154b\",\"license\":\"MIT\"},\"src/proxy/UUPSProxy.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\n/// @title UUPS Proxy\\n/// @author Simon Malatrait <simon.malatrait@grenoble-inp.org>\\n/// @notice This contract implements a UUPS Proxy compliant with ERC-1967 & ERC-1822.\\n///\\n/// @dev This contract delegates all calls to another contract (UUPS Proxiable) through a fallback function and the use of the `delegatecall` EVM instruction.\\n/// We refer to the Proxiable contract (as per ERC-1822) with `implementation`.\\n/// Adapted from <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/ERC1967/ERC1967Proxy.sol>\\ncontract UUPSProxy {\\n    /// @dev Storage slot with the address of the current implementation.\\n    /// This is the keccak-256 hash of \\\"eip1967.proxy.implementation\\\" subtracted by 1, and is\\n    /// validated in the constructor.\\n    /// NOTE: bytes32(uint256(keccak256('eip1967.proxy.implementation')) - 1)\\n    bytes32 private constant IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;\\n\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    /// @notice Initializes the upgradeable proxy with an initial implementation specified by `_implementation`.\\n    /// @dev If `_data` is nonempty, it's used as data in a delegate call to `_implementation`.\\n    /// This will typically be an encoded function call, and allows initializing the storage of the proxy like a Solidity constructor.\\n    constructor(address _implementation, bytes memory _data) {\\n        assembly {\\n            sstore(IMPLEMENTATION_SLOT, _implementation)\\n        }\\n\\n        if (_data.length != 0) {\\n            (bool success, ) = _implementation.delegatecall(_data);\\n            require(success, \\\"Proxy Constructor failed\\\");\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @dev Delegates the current call to `implementation`.\\n    /// NOTE: This function does not return to its internal call site, it will return directly to the external caller.\\n    function _delegate(address implementation) internal {\\n        assembly {\\n            // Copy msg.data. We take full control of memory in this inline assembly\\n            // block because it will not return to Solidity code. We overwrite the\\n            // Solidity scratch pad at memory position 0.\\n            calldatacopy(0, 0, calldatasize())\\n\\n            // Call the implementation.\\n            // out and outsize are 0 because we don't know the size yet.\\n            let result := delegatecall(gas(), implementation, 0, calldatasize(), 0, 0)\\n\\n            // Copy the returned data.\\n            returndatacopy(0, 0, returndatasize())\\n\\n            switch result\\n            // delegatecall returns 0 on error.\\n            case 0 {\\n                revert(0, returndatasize())\\n            }\\n            default {\\n                return(0, returndatasize())\\n            }\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Internal Views            * //\\n    // ************************************* //\\n\\n    function _getImplementation() internal view returns (address implementation) {\\n        assembly {\\n            implementation := sload(IMPLEMENTATION_SLOT)\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Fallback                * //\\n    // ************************************* //\\n\\n    /// @dev Fallback function that delegates calls to the address returned by `_implementation()`.\\n    /// @dev Will run if no other function in the contract matches the call data.\\n    fallback() external payable {\\n        _delegate(_getImplementation());\\n    }\\n\\n    receive() external payable {\\n        _delegate(_getImplementation());\\n    }\\n}\\n\",\"keccak256\":\"0x2d7b1f81e525787f1b8b033ce381a81cb5f39e411ff31490e019113205a661cd\",\"license\":\"MIT\"}},\"version\":1}",
+  "bytecode": "0x608060405234610144576102148038038061001981610148565b928339810190604081830312610144578051906001600160a01b0382168203610144576020810151906001600160401b038211610144570182601f8201121561014457805161006f61006a82610181565b610148565b9181835260208301946020838301011161014457815f926020809301875e83010152817f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5551806100c9575b6040516077908161019d8239f35b5f9283925af43d1561013f573d6100e261006a82610181565b9081525f60203d92013e5b156100fa575f80806100bb565b60405162461bcd60e51b815260206004820152601860248201527f50726f787920436f6e7374727563746f72206661696c656400000000000000006044820152606490fd5b6100ed565b5f80fd5b6040519190601f01601f191682016001600160401b0381118382101761016d57604052565b634e487b7160e01b5f52604160045260245ffd5b6001600160401b03811161016d57601f01601f19166020019056fe60806040525f807f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc54368280378136915af43d5f803e15603d573d5ff35b3d5ffdfea2646970667358221220cebc238294db6f217e59b4194d65c951358927be9872c8bda288fff77348423e64736f6c634300081e0033",
+  "deployedBytecode": "0x60806040525f807f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc54368280378136915af43d5f803e15603d573d5ff35b3d5ffdfea2646970667358221220cebc238294db6f217e59b4194d65c951358927be9872c8bda288fff77348423e64736f6c634300081e0033",
   "execute": {
     "methodName": "initialize",
     "args": [
       "0xf1C7c037891525E360C59f708739Ac09A7670c59",
-      "0x5AB37F38778Bc175852fA353056591D91c744ce6"
+      "0xA34dBBD0E5e1d09bd683455f9dbC393797BC558f"
     ]
   },
-  "implementation": "0x5CAD621D69E0535422aCFaCC0017bC32beC7A486",
+  "implementation": "0x270e3D63d3d275604df0a1Bd312E1255DCd96936",
   "devdoc": {
     "kind": "dev",
     "methods": {},
diff --git a/contracts/deployments/arbitrumSepoliaDevnet/SortitionModuleUniversity_Implementation.json b/contracts/deployments/arbitrumSepoliaDevnet/SortitionModuleUniversity_Implementation.json
index 21360963b..909027f9a 100644
--- a/contracts/deployments/arbitrumSepoliaDevnet/SortitionModuleUniversity_Implementation.json
+++ b/contracts/deployments/arbitrumSepoliaDevnet/SortitionModuleUniversity_Implementation.json
@@ -1,5 +1,5 @@
 {
-  "address": "0x5CAD621D69E0535422aCFaCC0017bC32beC7A486",
+  "address": "0x270e3D63d3d275604df0a1Bd312E1255DCd96936",
   "abi": [
     {
       "inputs": [],
@@ -27,11 +27,26 @@
       "name": "InvalidImplementation",
       "type": "error"
     },
+    {
+      "inputs": [],
+      "name": "KlerosCoreOnly",
+      "type": "error"
+    },
+    {
+      "inputs": [],
+      "name": "NotEligibleForWithdrawal",
+      "type": "error"
+    },
     {
       "inputs": [],
       "name": "NotInitializing",
       "type": "error"
     },
+    {
+      "inputs": [],
+      "name": "OwnerOnly",
+      "type": "error"
+    },
     {
       "inputs": [],
       "name": "UUPSUnauthorizedCallContext",
@@ -61,6 +76,44 @@
       "name": "Initialized",
       "type": "event"
     },
+    {
+      "anonymous": false,
+      "inputs": [
+        {
+          "indexed": true,
+          "internalType": "address",
+          "name": "_account",
+          "type": "address"
+        },
+        {
+          "indexed": false,
+          "internalType": "uint256",
+          "name": "_amount",
+          "type": "uint256"
+        }
+      ],
+      "name": "LeftoverPNK",
+      "type": "event"
+    },
+    {
+      "anonymous": false,
+      "inputs": [
+        {
+          "indexed": true,
+          "internalType": "address",
+          "name": "_account",
+          "type": "address"
+        },
+        {
+          "indexed": false,
+          "internalType": "uint256",
+          "name": "_amount",
+          "type": "uint256"
+        }
+      ],
+      "name": "LeftoverPNKWithdrawn",
+      "type": "event"
+    },
     {
       "anonymous": false,
       "inputs": [
@@ -119,6 +172,12 @@
           "internalType": "uint256",
           "name": "_amount",
           "type": "uint256"
+        },
+        {
+          "indexed": false,
+          "internalType": "uint256",
+          "name": "_amountAllCourts",
+          "type": "uint256"
         }
       ],
       "name": "StakeSet",
@@ -171,9 +230,9 @@
     {
       "inputs": [
         {
-          "internalType": "bytes32",
-          "name": "_key",
-          "type": "bytes32"
+          "internalType": "uint96",
+          "name": "_courtID",
+          "type": "uint96"
         },
         {
           "internalType": "bytes",
@@ -202,9 +261,9 @@
     {
       "inputs": [
         {
-          "internalType": "bytes32",
+          "internalType": "uint96",
           "name": "",
-          "type": "bytes32"
+          "type": "uint96"
         },
         {
           "internalType": "uint256",
@@ -223,11 +282,60 @@
           "internalType": "address",
           "name": "drawnAddress",
           "type": "address"
+        },
+        {
+          "internalType": "uint96",
+          "name": "fromSubcourtID",
+          "type": "uint96"
         }
       ],
       "stateMutability": "view",
       "type": "function"
     },
+    {
+      "inputs": [
+        {
+          "internalType": "uint256",
+          "name": "_iterations",
+          "type": "uint256"
+        }
+      ],
+      "name": "executeDelayedStakes",
+      "outputs": [],
+      "stateMutability": "nonpayable",
+      "type": "function"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "address",
+          "name": "_account",
+          "type": "address"
+        },
+        {
+          "internalType": "uint96",
+          "name": "_courtID",
+          "type": "uint96"
+        }
+      ],
+      "name": "forcedUnstake",
+      "outputs": [],
+      "stateMutability": "nonpayable",
+      "type": "function"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "address",
+          "name": "_account",
+          "type": "address"
+        }
+      ],
+      "name": "forcedUnstakeAllCourts",
+      "outputs": [],
+      "stateMutability": "nonpayable",
+      "type": "function"
+    },
     {
       "inputs": [
         {
@@ -287,15 +395,21 @@
       "type": "function"
     },
     {
-      "inputs": [],
-      "name": "governor",
-      "outputs": [
+      "inputs": [
         {
           "internalType": "address",
-          "name": "",
+          "name": "_juror",
           "type": "address"
         }
       ],
+      "name": "getJurorLeftoverPNK",
+      "outputs": [
+        {
+          "internalType": "uint256",
+          "name": "",
+          "type": "uint256"
+        }
+      ],
       "stateMutability": "view",
       "type": "function"
     },
@@ -303,7 +417,7 @@
       "inputs": [
         {
           "internalType": "address",
-          "name": "_governor",
+          "name": "_owner",
           "type": "address"
         },
         {
@@ -379,32 +493,21 @@
       "type": "function"
     },
     {
-      "inputs": [
+      "inputs": [],
+      "name": "owner",
+      "outputs": [
         {
-          "internalType": "uint256",
-          "name": "_randomNumber",
-          "type": "uint256"
+          "internalType": "address",
+          "name": "",
+          "type": "address"
         }
       ],
-      "name": "notifyRandomNumber",
-      "outputs": [],
-      "stateMutability": "nonpayable",
+      "stateMutability": "view",
       "type": "function"
     },
     {
-      "inputs": [
-        {
-          "internalType": "address",
-          "name": "_account",
-          "type": "address"
-        },
-        {
-          "internalType": "uint256",
-          "name": "_relativeAmount",
-          "type": "uint256"
-        }
-      ],
-      "name": "penalizeStake",
+      "inputs": [],
+      "name": "passPhase",
       "outputs": [],
       "stateMutability": "nonpayable",
       "type": "function"
@@ -446,9 +549,29 @@
           "internalType": "address",
           "name": "_account",
           "type": "address"
+        },
+        {
+          "internalType": "uint96",
+          "name": "_courtID",
+          "type": "uint96"
+        },
+        {
+          "internalType": "uint256",
+          "name": "_pnkDeposit",
+          "type": "uint256"
+        },
+        {
+          "internalType": "uint256",
+          "name": "_pnkWithdrawal",
+          "type": "uint256"
+        },
+        {
+          "internalType": "uint256",
+          "name": "_newStake",
+          "type": "uint256"
         }
       ],
-      "name": "setJurorInactive",
+      "name": "setStake",
       "outputs": [],
       "stateMutability": "nonpayable",
       "type": "function"
@@ -467,31 +590,55 @@
         },
         {
           "internalType": "uint256",
-          "name": "_newStake",
+          "name": "_penalty",
           "type": "uint256"
-        },
-        {
-          "internalType": "bool",
-          "name": "_alreadyTransferred",
-          "type": "bool"
         }
       ],
-      "name": "setStake",
+      "name": "setStakePenalty",
       "outputs": [
         {
           "internalType": "uint256",
-          "name": "pnkDeposit",
+          "name": "pnkBalance",
           "type": "uint256"
         },
         {
           "internalType": "uint256",
-          "name": "pnkWithdrawal",
+          "name": "newCourtStake",
           "type": "uint256"
         },
         {
-          "internalType": "enum StakingResult",
-          "name": "stakingResult",
-          "type": "uint8"
+          "internalType": "uint256",
+          "name": "availablePenalty",
+          "type": "uint256"
+        }
+      ],
+      "stateMutability": "nonpayable",
+      "type": "function"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "address",
+          "name": "_account",
+          "type": "address"
+        },
+        {
+          "internalType": "uint96",
+          "name": "_courtID",
+          "type": "uint96"
+        },
+        {
+          "internalType": "uint256",
+          "name": "_reward",
+          "type": "uint256"
+        }
+      ],
+      "name": "setStakeReward",
+      "outputs": [
+        {
+          "internalType": "bool",
+          "name": "success",
+          "type": "bool"
         }
       ],
       "stateMutability": "nonpayable",
@@ -545,45 +692,114 @@
       "outputs": [],
       "stateMutability": "payable",
       "type": "function"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "address",
+          "name": "_account",
+          "type": "address"
+        },
+        {
+          "internalType": "uint96",
+          "name": "_courtID",
+          "type": "uint96"
+        },
+        {
+          "internalType": "uint256",
+          "name": "_newStake",
+          "type": "uint256"
+        },
+        {
+          "internalType": "bool",
+          "name": "",
+          "type": "bool"
+        }
+      ],
+      "name": "validateStake",
+      "outputs": [
+        {
+          "internalType": "uint256",
+          "name": "pnkDeposit",
+          "type": "uint256"
+        },
+        {
+          "internalType": "uint256",
+          "name": "pnkWithdrawal",
+          "type": "uint256"
+        },
+        {
+          "internalType": "enum StakingResult",
+          "name": "stakingResult",
+          "type": "uint8"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
+    {
+      "inputs": [],
+      "name": "version",
+      "outputs": [
+        {
+          "internalType": "string",
+          "name": "",
+          "type": "string"
+        }
+      ],
+      "stateMutability": "view",
+      "type": "function"
+    },
+    {
+      "inputs": [
+        {
+          "internalType": "address",
+          "name": "_account",
+          "type": "address"
+        }
+      ],
+      "name": "withdrawLeftoverPNK",
+      "outputs": [],
+      "stateMutability": "nonpayable",
+      "type": "function"
     }
   ],
-  "transactionHash": "0x204b96d9a80952f3d7f84a74ce0fe11b7a03ce93187949d2da7e793d56552c61",
+  "transactionHash": "0x0ccfa8e496e33cfb8956ab152907c8003a17df581534ed86b8ed60a5935d657a",
   "receipt": {
     "to": null,
     "from": "0xf1C7c037891525E360C59f708739Ac09A7670c59",
-    "contractAddress": "0x5CAD621D69E0535422aCFaCC0017bC32beC7A486",
+    "contractAddress": "0x270e3D63d3d275604df0a1Bd312E1255DCd96936",
     "transactionIndex": 1,
-    "gasUsed": "1471948",
-    "logsBloom": "0x00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000080000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001000004000000000000000000000000000000000000000000000000000000000000000000000800000000000000000000000080000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
-    "blockHash": "0xa593072d9d6d0d0c6ee98e672a112e47e0501bc4d4bca56a6a66060d7427021a",
-    "transactionHash": "0x204b96d9a80952f3d7f84a74ce0fe11b7a03ce93187949d2da7e793d56552c61",
+    "gasUsed": "1639716",
+    "logsBloom": "0x00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000800000000000000000000000080000000000000000000000000000000000000000200000000000000000040000000000000000000000000000000000000000000000000000000000000000004000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+    "blockHash": "0x44cafbfb6a05aee0aaa7a1e875dee979c45404904686c44cd3cd9f981b60e98b",
+    "transactionHash": "0x0ccfa8e496e33cfb8956ab152907c8003a17df581534ed86b8ed60a5935d657a",
     "logs": [
       {
         "transactionIndex": 1,
-        "blockNumber": 96308555,
-        "transactionHash": "0x204b96d9a80952f3d7f84a74ce0fe11b7a03ce93187949d2da7e793d56552c61",
-        "address": "0x5CAD621D69E0535422aCFaCC0017bC32beC7A486",
+        "blockNumber": 193533787,
+        "transactionHash": "0x0ccfa8e496e33cfb8956ab152907c8003a17df581534ed86b8ed60a5935d657a",
+        "address": "0x270e3D63d3d275604df0a1Bd312E1255DCd96936",
         "topics": [
           "0xc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d2"
         ],
         "data": "0x000000000000000000000000000000000000000000000000ffffffffffffffff",
         "logIndex": 0,
-        "blockHash": "0xa593072d9d6d0d0c6ee98e672a112e47e0501bc4d4bca56a6a66060d7427021a"
+        "blockHash": "0x44cafbfb6a05aee0aaa7a1e875dee979c45404904686c44cd3cd9f981b60e98b"
       }
     ],
-    "blockNumber": 96308555,
-    "cumulativeGasUsed": "1471948",
+    "blockNumber": 193533787,
+    "cumulativeGasUsed": "1639716",
     "status": 1,
     "byzantium": true
   },
   "args": [],
   "numDeployments": 1,
-  "solcInputHash": "a5602534c00c2f67ca4b6a1cab8c717e",
-  "metadata": "{\"compiler\":{\"version\":\"0.8.24+commit.e11b9ed9\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"inputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"constructor\"},{\"inputs\":[],\"name\":\"AlreadyInitialized\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"FailedDelegateCall\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"implementation\",\"type\":\"address\"}],\"name\":\"InvalidImplementation\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"NotInitializing\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"UUPSUnauthorizedCallContext\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"slot\",\"type\":\"bytes32\"}],\"name\":\"UUPSUnsupportedProxiableUUID\",\"type\":\"error\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":false,\"internalType\":\"uint64\",\"name\":\"version\",\"type\":\"uint64\"}],\"name\":\"Initialized\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":false,\"internalType\":\"enum ISortitionModule.Phase\",\"name\":\"_phase\",\"type\":\"uint8\"}],\"name\":\"NewPhase\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"_address\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_relativeAmount\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"bool\",\"name\":\"_unlock\",\"type\":\"bool\"}],\"name\":\"StakeLocked\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"_address\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_courtID\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_amount\",\"type\":\"uint256\"}],\"name\":\"StakeSet\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"newImplementation\",\"type\":\"address\"}],\"name\":\"Upgraded\",\"type\":\"event\"},{\"inputs\":[],\"name\":\"core\",\"outputs\":[{\"internalType\":\"contract KlerosCoreUniversity\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"name\":\"createDisputeHook\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"_key\",\"type\":\"bytes32\"},{\"internalType\":\"bytes\",\"name\":\"_extraData\",\"type\":\"bytes\"}],\"name\":\"createTree\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"disputesWithoutJurors\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"\",\"type\":\"bytes32\"},{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"name\":\"draw\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"drawnAddress\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_juror\",\"type\":\"address\"},{\"internalType\":\"uint96\",\"name\":\"_courtID\",\"type\":\"uint96\"}],\"name\":\"getJurorBalance\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"totalStaked\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"totalLocked\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"stakedInCourt\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"nbCourts\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_juror\",\"type\":\"address\"}],\"name\":\"getJurorCourtIDs\",\"outputs\":[{\"internalType\":\"uint96[]\",\"name\":\"\",\"type\":\"uint96[]\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"governor\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_governor\",\"type\":\"address\"},{\"internalType\":\"contract KlerosCoreUniversity\",\"name\":\"_core\",\"type\":\"address\"}],\"name\":\"initialize\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_juror\",\"type\":\"address\"}],\"name\":\"isJurorStaked\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"account\",\"type\":\"address\"}],\"name\":\"jurors\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"stakedPnk\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"lockedPnk\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_account\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"_relativeAmount\",\"type\":\"uint256\"}],\"name\":\"lockStake\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_randomNumber\",\"type\":\"uint256\"}],\"name\":\"notifyRandomNumber\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_account\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"_relativeAmount\",\"type\":\"uint256\"}],\"name\":\"penalizeStake\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"name\":\"postDrawHook\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"proxiableUUID\",\"outputs\":[{\"internalType\":\"bytes32\",\"name\":\"\",\"type\":\"bytes32\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_account\",\"type\":\"address\"}],\"name\":\"setJurorInactive\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_account\",\"type\":\"address\"},{\"internalType\":\"uint96\",\"name\":\"_courtID\",\"type\":\"uint96\"},{\"internalType\":\"uint256\",\"name\":\"_newStake\",\"type\":\"uint256\"},{\"internalType\":\"bool\",\"name\":\"_alreadyTransferred\",\"type\":\"bool\"}],\"name\":\"setStake\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"pnkDeposit\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"pnkWithdrawal\",\"type\":\"uint256\"},{\"internalType\":\"enum StakingResult\",\"name\":\"stakingResult\",\"type\":\"uint8\"}],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_juror\",\"type\":\"address\"}],\"name\":\"setTransientJuror\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_account\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"_relativeAmount\",\"type\":\"uint256\"}],\"name\":\"unlockStake\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"newImplementation\",\"type\":\"address\"},{\"internalType\":\"bytes\",\"name\":\"data\",\"type\":\"bytes\"}],\"name\":\"upgradeToAndCall\",\"outputs\":[],\"stateMutability\":\"payable\",\"type\":\"function\"}],\"devdoc\":{\"details\":\"An adapted version of the SortitionModule contract for educational purposes.\",\"errors\":{\"AlreadyInitialized()\":[{\"details\":\"The contract is already initialized.\"}],\"NotInitializing()\":[{\"details\":\"The contract is not initializing.\"}],\"UUPSUnauthorizedCallContext()\":[{\"details\":\"The call is from an unauthorized context.\"}],\"UUPSUnsupportedProxiableUUID(bytes32)\":[{\"details\":\"The storage `slot` is unsupported as a UUID.\"}]},\"events\":{\"Initialized(uint64)\":{\"details\":\"Triggered when the contract has been initialized or reinitialized.\"},\"Upgraded(address)\":{\"params\":{\"newImplementation\":\"Address of the new implementation the proxy is now forwarding calls to.\"}}},\"kind\":\"dev\",\"methods\":{\"constructor\":{\"details\":\"Constructor, initializing the implementation to reduce attack surface.\"},\"draw(bytes32,uint256,uint256)\":{\"details\":\"Draw an ID from a tree using a number. Note that this function reverts if the sum of all values in the tree is 0.\",\"returns\":{\"drawnAddress\":\"The drawn address. `O(k * log_k(n))` where `k` is the maximum number of children per node in the tree,  and `n` is the maximum number of nodes ever appended.\"}},\"getJurorBalance(address,uint96)\":{\"details\":\"Gets the stake of a juror in a court. Warning: `O(n)` complexity where `n` is the number of courts the juror has staked in but acceptable for this educational implementation.\",\"params\":{\"_courtID\":\"The ID of the court.\",\"_juror\":\"The address of the juror.\"},\"returns\":{\"nbCourts\":\"The number of courts the juror has staked in.\",\"stakedInCourt\":\"The amount of tokens staked by the juror in the court.\",\"totalLocked\":\"The total amount of tokens locked by the juror in the court.\",\"totalStaked\":\"The total amount of tokens staked by the juror in the court.\"}},\"getJurorCourtIDs(address)\":{\"details\":\"Gets the court identifiers where a specific `_juror` has staked.\",\"params\":{\"_juror\":\"The address of the juror.\"}},\"initialize(address,address)\":{\"details\":\"Initializer (constructor equivalent for upgradable contracts).\",\"params\":{\"_core\":\"The KlerosCore.\"}},\"notifyRandomNumber(uint256)\":{\"details\":\"Saves the random number to use it in sortition. Not used by this contract because the storing of the number is inlined in passPhase().\",\"params\":{\"_randomNumber\":\"Random number returned by RNG contract.\"}},\"proxiableUUID()\":{\"details\":\"Implementation of the ERC1822 `proxiableUUID` function. This returns the storage slot used by the implementation. It is used to validate the implementation's compatibility when performing an upgrade. IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks bricking a proxy that upgrades to it, by delegating to itself until out of gas. Thus it is critical that this function revert if invoked through a proxy. This is guaranteed by the if statement.\"},\"setJurorInactive(address)\":{\"details\":\"Unstakes the inactive juror from all courts. `O(n * (p * log_k(j)) )` where `n` is the number of courts the juror has staked in, `p` is the depth of the court tree, `k` is the minimum number of children per node of one of these courts' sortition sum tree, and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.\",\"params\":{\"_account\":\"The juror to unstake.\"}},\"setStake(address,uint96,uint256,bool)\":{\"details\":\"Sets the specified juror's stake in a court. `O(n + p * log_k(j))` where `n` is the number of courts the juror has staked in, `p` is the depth of the court tree, `k` is the minimum number of children per node of one of these courts' sortition sum tree, and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.\",\"params\":{\"_account\":\"The address of the juror.\",\"_alreadyTransferred\":\"True if the tokens were already transferred from juror. Only relevant for delayed stakes.\",\"_courtID\":\"The ID of the court.\",\"_newStake\":\"The new stake.\"},\"returns\":{\"pnkDeposit\":\"The amount of PNK to be deposited.\",\"pnkWithdrawal\":\"The amount of PNK to be withdrawn.\",\"stakingResult\":\"The result of the staking operation.\"}},\"upgradeToAndCall(address,bytes)\":{\"details\":\"Upgrade mechanism including access control and UUPS-compliance.Reverts if the execution is not performed via delegatecall or the execution context is not of a proxy with an ERC1967-compliant implementation pointing to self.\",\"params\":{\"data\":\"Data used in a delegate call to `newImplementation` if non-empty. This will typically be an encoded function call, and allows initializing the storage of the proxy like a Solidity constructor.\",\"newImplementation\":\"Address of the new implementation contract.\"}}},\"title\":\"SortitionModuleUniversity\",\"version\":1},\"userdoc\":{\"errors\":{\"FailedDelegateCall()\":[{\"notice\":\"Failed Delegated call\"}],\"InvalidImplementation(address)\":[{\"notice\":\"The `implementation` is not UUPS-compliant\"}]},\"events\":{\"Upgraded(address)\":{\"notice\":\"Emitted when the `implementation` has been successfully upgraded.\"}},\"kind\":\"user\",\"methods\":{},\"version\":1}},\"settings\":{\"compilationTarget\":{\"src/arbitration/university/SortitionModuleUniversity.sol\":\"SortitionModuleUniversity\"},\"evmVersion\":\"paris\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\",\"useLiteralContent\":true},\"optimizer\":{\"enabled\":true,\"runs\":100},\"remappings\":[]},\"sources\":{\"@openzeppelin/contracts/token/ERC20/IERC20.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC20/IERC20.sol)\\n\\npragma solidity ^0.8.20;\\n\\n/**\\n * @dev Interface of the ERC-20 standard as defined in the ERC.\\n */\\ninterface IERC20 {\\n    /**\\n     * @dev Emitted when `value` tokens are moved from one account (`from`) to\\n     * another (`to`).\\n     *\\n     * Note that `value` may be zero.\\n     */\\n    event Transfer(address indexed from, address indexed to, uint256 value);\\n\\n    /**\\n     * @dev Emitted when the allowance of a `spender` for an `owner` is set by\\n     * a call to {approve}. `value` is the new allowance.\\n     */\\n    event Approval(address indexed owner, address indexed spender, uint256 value);\\n\\n    /**\\n     * @dev Returns the value of tokens in existence.\\n     */\\n    function totalSupply() external view returns (uint256);\\n\\n    /**\\n     * @dev Returns the value of tokens owned by `account`.\\n     */\\n    function balanceOf(address account) external view returns (uint256);\\n\\n    /**\\n     * @dev Moves a `value` amount of tokens from the caller's account to `to`.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * Emits a {Transfer} event.\\n     */\\n    function transfer(address to, uint256 value) external returns (bool);\\n\\n    /**\\n     * @dev Returns the remaining number of tokens that `spender` will be\\n     * allowed to spend on behalf of `owner` through {transferFrom}. This is\\n     * zero by default.\\n     *\\n     * This value changes when {approve} or {transferFrom} are called.\\n     */\\n    function allowance(address owner, address spender) external view returns (uint256);\\n\\n    /**\\n     * @dev Sets a `value` amount of tokens as the allowance of `spender` over the\\n     * caller's tokens.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * IMPORTANT: Beware that changing an allowance with this method brings the risk\\n     * that someone may use both the old and the new allowance by unfortunate\\n     * transaction ordering. One possible solution to mitigate this race\\n     * condition is to first reduce the spender's allowance to 0 and set the\\n     * desired value afterwards:\\n     * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729\\n     *\\n     * Emits an {Approval} event.\\n     */\\n    function approve(address spender, uint256 value) external returns (bool);\\n\\n    /**\\n     * @dev Moves a `value` amount of tokens from `from` to `to` using the\\n     * allowance mechanism. `value` is then deducted from the caller's\\n     * allowance.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * Emits a {Transfer} event.\\n     */\\n    function transferFrom(address from, address to, uint256 value) external returns (bool);\\n}\\n\",\"keccak256\":\"0xe06a3f08a987af6ad2e1c1e774405d4fe08f1694b67517438b467cecf0da0ef7\",\"license\":\"MIT\"},\"src/arbitration/interfaces/IArbitrableV2.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity 0.8.24;\\n\\nimport \\\"./IArbitratorV2.sol\\\";\\n\\n/// @title IArbitrableV2\\n/// @notice Arbitrable interface.\\n/// @dev When developing arbitrable contracts, we need to:\\n/// - Define the action taken when a ruling is received by the contract.\\n/// - Allow dispute creation. For this a function must call arbitrator.createDispute{value: _fee}(_choices,_extraData);\\ninterface IArbitrableV2 {\\n    /// @dev To be emitted when a dispute is created to link the correct meta-evidence to the disputeID.\\n    /// @param _arbitrator The arbitrator of the contract.\\n    /// @param _arbitratorDisputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _externalDisputeID An identifier created outside Kleros by the protocol requesting arbitration.\\n    /// @param _templateId The identifier of the dispute template. Should not be used with _templateUri.\\n    /// @param _templateUri The URI to the dispute template. For example on IPFS: starting with '/ipfs/'. Should not be used with _templateId.\\n    event DisputeRequest(\\n        IArbitratorV2 indexed _arbitrator,\\n        uint256 indexed _arbitratorDisputeID,\\n        uint256 _externalDisputeID,\\n        uint256 _templateId,\\n        string _templateUri\\n    );\\n\\n    /// @dev To be raised when a ruling is given.\\n    /// @param _arbitrator The arbitrator giving the ruling.\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _ruling The ruling which was given.\\n    event Ruling(IArbitratorV2 indexed _arbitrator, uint256 indexed _disputeID, uint256 _ruling);\\n\\n    /// @dev Give a ruling for a dispute.\\n    ///      Must be called by the arbitrator.\\n    ///      The purpose of this function is to ensure that the address calling it has the right to rule on the contract.\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _ruling Ruling given by the arbitrator.\\n    /// Note that 0 is reserved for \\\"Not able/wanting to make a decision\\\".\\n    function rule(uint256 _disputeID, uint256 _ruling) external;\\n}\\n\",\"keccak256\":\"0xe841a4fe8ec109ce17dde4457bf1583c8b499109b05887c53a49a3207fc6e80b\",\"license\":\"MIT\"},\"src/arbitration/interfaces/IArbitratorV2.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity 0.8.24;\\n\\nimport \\\"@openzeppelin/contracts/token/ERC20/IERC20.sol\\\";\\nimport \\\"./IArbitrableV2.sol\\\";\\n\\n/// @title Arbitrator\\n/// Arbitrator interface that implements the new arbitration standard.\\n/// Unlike the ERC-792 this standard is not concerned with appeals, so each arbitrator can implement an appeal system that suits it the most.\\n/// When developing arbitrator contracts we need to:\\n/// - Define the functions for dispute creation (createDispute). Don't forget to store the arbitrated contract and the disputeID (which should be unique, may nbDisputes).\\n/// - Define the functions for cost display (arbitrationCost).\\n/// - Allow giving rulings. For this a function must call arbitrable.rule(disputeID, ruling).\\ninterface IArbitratorV2 {\\n    /// @dev To be emitted when a dispute is created.\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _arbitrable The contract which created the dispute.\\n    event DisputeCreation(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);\\n\\n    /// @dev To be raised when a ruling is given.\\n    /// @param _arbitrable The arbitrable receiving the ruling.\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _ruling The ruling which was given.\\n    event Ruling(IArbitrableV2 indexed _arbitrable, uint256 indexed _disputeID, uint256 _ruling);\\n\\n    /// @dev To be emitted when an ERC20 token is added or removed as a method to pay fees.\\n    /// @param _token The ERC20 token.\\n    /// @param _accepted Whether the token is accepted or not.\\n    event AcceptedFeeToken(IERC20 indexed _token, bool indexed _accepted);\\n\\n    /// @dev To be emitted when the fee for a particular ERC20 token is updated.\\n    /// @param _feeToken The ERC20 token.\\n    /// @param _rateInEth The new rate of the fee token in ETH.\\n    /// @param _rateDecimals The new decimals of the fee token rate.\\n    event NewCurrencyRate(IERC20 indexed _feeToken, uint64 _rateInEth, uint8 _rateDecimals);\\n\\n    /// @dev Create a dispute and pay for the fees in the native currency, typically ETH.\\n    ///      Must be called by the arbitrable contract.\\n    ///      Must pay at least arbitrationCost(_extraData).\\n    /// @param _numberOfChoices The number of choices the arbitrator can choose from in this dispute.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @return disputeID The identifier of the dispute created.\\n    function createDispute(\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData\\n    ) external payable returns (uint256 disputeID);\\n\\n    /// @dev Create a dispute and pay for the fees in a supported ERC20 token.\\n    ///      Must be called by the arbitrable contract.\\n    ///      Must pay at least arbitrationCost(_extraData).\\n    /// @param _numberOfChoices The number of choices the arbitrator can choose from in this dispute.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @param _feeToken The ERC20 token used to pay fees.\\n    /// @param _feeAmount Amount of the ERC20 token used to pay fees.\\n    /// @return disputeID The identifier of the dispute created.\\n    function createDispute(\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData,\\n        IERC20 _feeToken,\\n        uint256 _feeAmount\\n    ) external returns (uint256 disputeID);\\n\\n    /// @dev Compute the cost of arbitration denominated in the native currency, typically ETH.\\n    ///      It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @return cost The arbitration cost in ETH.\\n    function arbitrationCost(bytes calldata _extraData) external view returns (uint256 cost);\\n\\n    /// @dev Compute the cost of arbitration denominated in `_feeToken`.\\n    ///      It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @param _feeToken The ERC20 token used to pay fees.\\n    /// @return cost The arbitration cost in `_feeToken`.\\n    function arbitrationCost(bytes calldata _extraData, IERC20 _feeToken) external view returns (uint256 cost);\\n\\n    /// @dev Gets the current ruling of a specified dispute.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return ruling The current ruling.\\n    /// @return tied Whether it's a tie or not.\\n    /// @return overridden Whether the ruling was overridden by appeal funding or not.\\n    function currentRuling(uint256 _disputeID) external view returns (uint256 ruling, bool tied, bool overridden);\\n}\\n\",\"keccak256\":\"0xa4dc6b958197adead238de4246cd04e7389c3dc1b9f968acd10985f8fc5b74cf\",\"license\":\"MIT\"},\"src/arbitration/interfaces/IDisputeKit.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n/// @custom:authors: [@unknownunknown1, @jaybuidl]\\n/// @custom:reviewers: []\\n/// @custom:auditors: []\\n/// @custom:bounties: []\\n/// @custom:deployments: []\\n\\npragma solidity 0.8.24;\\n\\nimport \\\"./IArbitratorV2.sol\\\";\\n\\n/// @title IDisputeKit\\n/// An abstraction of the Dispute Kits intended for interfacing with KlerosCore.\\n/// It does not intend to abstract the interactions with the user (such as voting or appeal funding) to allow for implementation-specific parameters.\\ninterface IDisputeKit {\\n    // ************************************ //\\n    // *             Events               * //\\n    // ************************************ //\\n\\n    /// @dev Emitted when casting a vote to provide the justification of juror's choice.\\n    /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _juror Address of the juror.\\n    /// @param _voteIDs The identifiers of the votes in the dispute.\\n    /// @param _choice The choice juror voted for.\\n    /// @param _justification Justification of the choice.\\n    event VoteCast(\\n        uint256 indexed _coreDisputeID,\\n        address indexed _juror,\\n        uint256[] _voteIDs,\\n        uint256 indexed _choice,\\n        string _justification\\n    );\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @dev Creates a local dispute and maps it to the dispute ID in the Core contract.\\n    /// Note: Access restricted to Kleros Core only.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _numberOfChoices Number of choices of the dispute\\n    /// @param _extraData Additional info about the dispute, for possible use in future dispute kits.\\n    function createDispute(\\n        uint256 _coreDisputeID,\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData,\\n        uint256 _nbVotes\\n    ) external;\\n\\n    /// @dev Draws the juror from the sortition tree. The drawn address is picked up by Kleros Core.\\n    /// Note: Access restricted to Kleros Core only.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _nonce Nonce.\\n    /// @return drawnAddress The drawn address.\\n    function draw(uint256 _coreDisputeID, uint256 _nonce) external returns (address drawnAddress);\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /// @dev Gets the current ruling of a specified dispute.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @return ruling The current ruling.\\n    /// @return tied Whether it's a tie or not.\\n    /// @return overridden Whether the ruling was overridden by appeal funding or not.\\n    function currentRuling(uint256 _coreDisputeID) external view returns (uint256 ruling, bool tied, bool overridden);\\n\\n    /// @dev Gets the degree of coherence of a particular voter. This function is called by Kleros Core in order to determine the amount of the reward.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.\\n    /// @param _voteID The ID of the vote.\\n    /// @param _feePerJuror The fee per juror.\\n    /// @param _pnkAtStakePerJuror The PNK at stake per juror.\\n    /// @return The degree of coherence in basis points.\\n    function getDegreeOfCoherence(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _voteID,\\n        uint256 _feePerJuror,\\n        uint256 _pnkAtStakePerJuror\\n    ) external view returns (uint256);\\n\\n    /// @dev Gets the number of jurors who are eligible to a reward in this round.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.\\n    /// @return The number of coherent jurors.\\n    function getCoherentCount(uint256 _coreDisputeID, uint256 _coreRoundID) external view returns (uint256);\\n\\n    /// @dev Returns true if all of the jurors have cast their commits for the last round.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @return Whether all of the jurors have cast their commits for the last round.\\n    function areCommitsAllCast(uint256 _coreDisputeID) external view returns (bool);\\n\\n    /// @dev Returns true if all of the jurors have cast their votes for the last round.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @return Whether all of the jurors have cast their votes for the last round.\\n    function areVotesAllCast(uint256 _coreDisputeID) external view returns (bool);\\n\\n    /// @dev Returns true if the specified voter was active in this round.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.\\n    /// @param _voteID The ID of the voter.\\n    /// @return Whether the voter was active or not.\\n    function isVoteActive(uint256 _coreDisputeID, uint256 _coreRoundID, uint256 _voteID) external view returns (bool);\\n\\n    function getRoundInfo(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _choice\\n    )\\n        external\\n        view\\n        returns (\\n            uint256 winningChoice,\\n            bool tied,\\n            uint256 totalVoted,\\n            uint256 totalCommited,\\n            uint256 nbVoters,\\n            uint256 choiceCount\\n        );\\n\\n    function getVoteInfo(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _voteID\\n    ) external view returns (address account, bytes32 commit, uint256 choice, bool voted);\\n}\\n\",\"keccak256\":\"0xb9590d05f9df08dd0ed027b2eb40c7b1885b7574a121b1b0b7da0920429bb4d5\",\"license\":\"MIT\"},\"src/arbitration/interfaces/ISortitionModule.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\npragma solidity 0.8.24;\\n\\nimport \\\"../../libraries/Constants.sol\\\";\\n\\ninterface ISortitionModule {\\n    enum Phase {\\n        staking, // Stake sum trees can be updated. Pass after `minStakingTime` passes and there is at least one dispute without jurors.\\n        generating, // Waiting for a random number. Pass as soon as it is ready.\\n        drawing // Jurors can be drawn. Pass after all disputes have jurors or `maxDrawingTime` passes.\\n    }\\n\\n    event NewPhase(Phase _phase);\\n\\n    function createTree(bytes32 _key, bytes memory _extraData) external;\\n\\n    function setStake(\\n        address _account,\\n        uint96 _courtID,\\n        uint256 _newStake,\\n        bool _alreadyTransferred\\n    ) external returns (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult);\\n\\n    function setJurorInactive(address _account) external;\\n\\n    function lockStake(address _account, uint256 _relativeAmount) external;\\n\\n    function unlockStake(address _account, uint256 _relativeAmount) external;\\n\\n    function penalizeStake(address _account, uint256 _relativeAmount) external;\\n\\n    function notifyRandomNumber(uint256 _drawnNumber) external;\\n\\n    function draw(bytes32 _court, uint256 _coreDisputeID, uint256 _nonce) external view returns (address);\\n\\n    function getJurorBalance(\\n        address _juror,\\n        uint96 _courtID\\n    ) external view returns (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts);\\n\\n    function getJurorCourtIDs(address _juror) external view returns (uint96[] memory);\\n\\n    function isJurorStaked(address _juror) external view returns (bool);\\n\\n    function createDisputeHook(uint256 _disputeID, uint256 _roundID) external;\\n\\n    function postDrawHook(uint256 _disputeID, uint256 _roundID) external;\\n}\\n\",\"keccak256\":\"0x18a4ff126bb51e7b5b0e3fbff7cf0dbbcfff7195ad79307e69cdbc9226e63502\",\"license\":\"MIT\"},\"src/arbitration/university/ISortitionModuleUniversity.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\npragma solidity 0.8.24;\\n\\nimport {ISortitionModule} from \\\"../interfaces/ISortitionModule.sol\\\";\\n\\ninterface ISortitionModuleUniversity is ISortitionModule {\\n    function setTransientJuror(address _juror) external;\\n}\\n\",\"keccak256\":\"0x57fee0787ae90af01c57a7d2850f8e4ade1ca72163a388341cac017bfdbf163a\",\"license\":\"MIT\"},\"src/arbitration/university/KlerosCoreUniversity.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity 0.8.24;\\n\\nimport {IArbitrableV2, IArbitratorV2} from \\\"../interfaces/IArbitratorV2.sol\\\";\\nimport {IDisputeKit} from \\\"../interfaces/IDisputeKit.sol\\\";\\nimport {ISortitionModuleUniversity} from \\\"./ISortitionModuleUniversity.sol\\\";\\nimport {SafeERC20, IERC20} from \\\"../../libraries/SafeERC20.sol\\\";\\nimport \\\"../../libraries/Constants.sol\\\";\\nimport {UUPSProxiable} from \\\"../../proxy/UUPSProxiable.sol\\\";\\nimport {Initializable} from \\\"../../proxy/Initializable.sol\\\";\\n\\n/// @title KlerosCoreUniversity\\n/// Core arbitrator contract for educational purposes.\\ncontract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {\\n    using SafeERC20 for IERC20;\\n\\n    // ************************************* //\\n    // *         Enums / Structs           * //\\n    // ************************************* //\\n\\n    enum Period {\\n        evidence, // Evidence can be submitted. This is also when drawing has to take place.\\n        commit, // Jurors commit a hashed vote. This is skipped for courts without hidden votes.\\n        vote, // Jurors reveal/cast their vote depending on whether the court has hidden votes or not.\\n        appeal, // The dispute can be appealed.\\n        execution // Tokens are redistributed and the ruling is executed.\\n    }\\n\\n    struct Court {\\n        uint96 parent; // The parent court.\\n        bool hiddenVotes; // Whether to use commit and reveal or not.\\n        uint256[] children; // List of child courts.\\n        uint256 minStake; // Minimum PNKs needed to stake in the court.\\n        uint256 alpha; // Basis point of PNKs that are lost when incoherent.\\n        uint256 feeForJuror; // Arbitration fee paid per juror.\\n        uint256 jurorsForCourtJump; // The appeal after the one that reaches this number of jurors will go to the parent court if any.\\n        uint256[4] timesPerPeriod; // The time allotted to each dispute period in the form `timesPerPeriod[period]`.\\n        mapping(uint256 disputeKitId => bool) supportedDisputeKits; // True if DK with this ID is supported by the court. Note that each court must support classic dispute kit.\\n        bool disabled; // True if the court is disabled. Unused for now, will be implemented later.\\n    }\\n\\n    struct Dispute {\\n        uint96 courtID; // The ID of the court the dispute is in.\\n        IArbitrableV2 arbitrated; // The arbitrable contract.\\n        Period period; // The current period of the dispute.\\n        bool ruled; // True if the ruling has been executed, false otherwise.\\n        uint256 lastPeriodChange; // The last time the period was changed.\\n        Round[] rounds;\\n    }\\n\\n    struct Round {\\n        uint256 disputeKitID; // Index of the dispute kit in the array.\\n        uint256 pnkAtStakePerJuror; // The amount of PNKs at stake for each juror in this round.\\n        uint256 totalFeesForJurors; // The total juror fees paid in this round.\\n        uint256 nbVotes; // The total number of votes the dispute can possibly have in the current round. Former votes[_round].length.\\n        uint256 repartitions; // A counter of reward repartitions made in this round.\\n        uint256 pnkPenalties; // The amount of PNKs collected from penalties in this round.\\n        address[] drawnJurors; // Addresses of the jurors that were drawn in this round.\\n        uint256 sumFeeRewardPaid; // Total sum of arbitration fees paid to coherent jurors as a reward in this round.\\n        uint256 sumPnkRewardPaid; // Total sum of PNK paid to coherent jurors as a reward in this round.\\n        IERC20 feeToken; // The token used for paying fees in this round.\\n        uint256 drawIterations; // The number of iterations passed drawing the jurors for this round.\\n    }\\n\\n    // Workaround \\\"stack too deep\\\" errors\\n    struct ExecuteParams {\\n        uint256 disputeID; // The ID of the dispute to execute.\\n        uint256 round; // The round to execute.\\n        uint256 coherentCount; // The number of coherent votes in the round.\\n        uint256 numberOfVotesInRound; // The number of votes in the round.\\n        uint256 feePerJurorInRound; // The fee per juror in the round.\\n        uint256 pnkAtStakePerJurorInRound; // The amount of PNKs at stake for each juror in the round.\\n        uint256 pnkPenaltiesInRound; // The amount of PNKs collected from penalties in the round.\\n        uint256 repartition; // The index of the repartition to execute.\\n    }\\n\\n    struct CurrencyRate {\\n        bool feePaymentAccepted;\\n        uint64 rateInEth;\\n        uint8 rateDecimals;\\n    }\\n\\n    // ************************************* //\\n    // *             Storage               * //\\n    // ************************************* //\\n\\n    uint256 private constant ALPHA_DIVISOR = 1e4; // The number to divide `Court.alpha` by.\\n    uint256 private constant NON_PAYABLE_AMOUNT = (2 ** 256 - 2) / 2; // An amount higher than the supply of ETH.\\n\\n    address public governor; // The governor of the contract.\\n    address public instructor; // The instructor who is allowed to choose the jurors.\\n    IERC20 public pinakion; // The Pinakion token contract.\\n    address public jurorProsecutionModule; // The module for juror's prosecution.\\n    ISortitionModuleUniversity public sortitionModule; // Sortition module for drawing.\\n    Court[] public courts; // The courts.\\n    IDisputeKit[] public disputeKits; // Array of dispute kits.\\n    Dispute[] public disputes; // The disputes.\\n    mapping(IERC20 => CurrencyRate) public currencyRates; // The price of each token in ETH.\\n\\n    // ************************************* //\\n    // *              Events               * //\\n    // ************************************* //\\n\\n    event NewPeriod(uint256 indexed _disputeID, Period _period);\\n    event AppealPossible(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);\\n    event AppealDecision(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);\\n    event Draw(address indexed _address, uint256 indexed _disputeID, uint256 _roundID, uint256 _voteID);\\n    event CourtCreated(\\n        uint256 indexed _courtID,\\n        uint96 indexed _parent,\\n        bool _hiddenVotes,\\n        uint256 _minStake,\\n        uint256 _alpha,\\n        uint256 _feeForJuror,\\n        uint256 _jurorsForCourtJump,\\n        uint256[4] _timesPerPeriod,\\n        uint256[] _supportedDisputeKits\\n    );\\n    event CourtModified(\\n        uint96 indexed _courtID,\\n        bool _hiddenVotes,\\n        uint256 _minStake,\\n        uint256 _alpha,\\n        uint256 _feeForJuror,\\n        uint256 _jurorsForCourtJump,\\n        uint256[4] _timesPerPeriod\\n    );\\n    event DisputeKitCreated(uint256 indexed _disputeKitID, IDisputeKit indexed _disputeKitAddress);\\n    event DisputeKitEnabled(uint96 indexed _courtID, uint256 indexed _disputeKitID, bool indexed _enable);\\n    event CourtJump(\\n        uint256 indexed _disputeID,\\n        uint256 indexed _roundID,\\n        uint96 indexed _fromCourtID,\\n        uint96 _toCourtID\\n    );\\n    event DisputeKitJump(\\n        uint256 indexed _disputeID,\\n        uint256 indexed _roundID,\\n        uint256 indexed _fromDisputeKitID,\\n        uint256 _toDisputeKitID\\n    );\\n    event TokenAndETHShift(\\n        address indexed _account,\\n        uint256 indexed _disputeID,\\n        uint256 indexed _roundID,\\n        uint256 _degreeOfCoherency,\\n        int256 _pnkAmount,\\n        int256 _feeAmount,\\n        IERC20 _feeToken\\n    );\\n    event LeftoverRewardSent(\\n        uint256 indexed _disputeID,\\n        uint256 indexed _roundID,\\n        uint256 _pnkAmount,\\n        uint256 _feeAmount,\\n        IERC20 _feeToken\\n    );\\n\\n    // ************************************* //\\n    // *        Function Modifiers         * //\\n    // ************************************* //\\n\\n    modifier onlyByGovernor() {\\n        if (governor != msg.sender) revert GovernorOnly();\\n        _;\\n    }\\n\\n    modifier onlyByInstructor() {\\n        if (instructor != msg.sender) revert InstructorOnly();\\n        _;\\n    }\\n\\n    modifier onlyByGovernorOrInstructor() {\\n        if (msg.sender != governor && msg.sender != instructor) revert GovernorOrInstructorOnly();\\n        _;\\n    }\\n\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    /// @dev Constructor, initializing the implementation to reduce attack surface.\\n    constructor() {\\n        _disableInitializers();\\n    }\\n\\n    /// @dev Initializer (constructor equivalent for upgradable contracts).\\n    /// @param _governor The governor's address.\\n    /// @param _instructor The address of the instructor.\\n    /// @param _pinakion The address of the token contract.\\n    /// @param _jurorProsecutionModule The address of the juror prosecution module.\\n    /// @param _disputeKit The address of the default dispute kit.\\n    /// @param _hiddenVotes The `hiddenVotes` property value of the general court.\\n    /// @param _courtParameters Numeric parameters of General court (minStake, alpha, feeForJuror and jurorsForCourtJump respectively).\\n    /// @param _timesPerPeriod The `timesPerPeriod` property value of the general court.\\n    /// @param _sortitionModuleAddress The sortition module responsible for sortition of the jurors.\\n    function initialize(\\n        address _governor,\\n        address _instructor,\\n        IERC20 _pinakion,\\n        address _jurorProsecutionModule,\\n        IDisputeKit _disputeKit,\\n        bool _hiddenVotes,\\n        uint256[4] memory _courtParameters,\\n        uint256[4] memory _timesPerPeriod,\\n        ISortitionModuleUniversity _sortitionModuleAddress\\n    ) external reinitializer(1) {\\n        governor = _governor;\\n        instructor = _instructor;\\n        pinakion = _pinakion;\\n        jurorProsecutionModule = _jurorProsecutionModule;\\n        sortitionModule = _sortitionModuleAddress;\\n\\n        // NULL_DISPUTE_KIT: an empty element at index 0 to indicate when a dispute kit is not supported.\\n        disputeKits.push();\\n\\n        // DISPUTE_KIT_CLASSIC\\n        disputeKits.push(_disputeKit);\\n\\n        emit DisputeKitCreated(DISPUTE_KIT_CLASSIC, _disputeKit);\\n\\n        // FORKING_COURT\\n        // TODO: Fill the properties for the Forking court, emit CourtCreated.\\n        courts.push();\\n\\n        // GENERAL_COURT\\n        Court storage court = courts.push();\\n        court.parent = FORKING_COURT;\\n        court.children = new uint256[](0);\\n        court.hiddenVotes = _hiddenVotes;\\n        court.minStake = _courtParameters[0];\\n        court.alpha = _courtParameters[1];\\n        court.feeForJuror = _courtParameters[2];\\n        court.jurorsForCourtJump = _courtParameters[3];\\n        court.timesPerPeriod = _timesPerPeriod;\\n\\n        emit CourtCreated(\\n            1,\\n            court.parent,\\n            _hiddenVotes,\\n            _courtParameters[0],\\n            _courtParameters[1],\\n            _courtParameters[2],\\n            _courtParameters[3],\\n            _timesPerPeriod,\\n            new uint256[](0)\\n        );\\n        _enableDisputeKit(GENERAL_COURT, DISPUTE_KIT_CLASSIC, true);\\n    }\\n\\n    // ************************************* //\\n    // *             Governance            * //\\n    // ************************************* //\\n\\n    /* @dev Access Control to perform implementation upgrades (UUPS Proxiable)\\n     * @dev Only the governor can perform upgrades (`onlyByGovernor`)\\n     */\\n    function _authorizeUpgrade(address) internal view override onlyByGovernor {\\n        // NOP\\n    }\\n\\n    /// @dev Allows the governor to call anything on behalf of the contract.\\n    /// @param _destination The destination of the call.\\n    /// @param _amount The value sent with the call.\\n    /// @param _data The data sent with the call.\\n    function executeGovernorProposal(\\n        address _destination,\\n        uint256 _amount,\\n        bytes memory _data\\n    ) external onlyByGovernor {\\n        (bool success, ) = _destination.call{value: _amount}(_data);\\n        if (!success) revert UnsuccessfulCall();\\n    }\\n\\n    /// @dev Changes the `governor` storage variable.\\n    /// @param _governor The new value for the `governor` storage variable.\\n    function changeGovernor(address payable _governor) external onlyByGovernor {\\n        governor = _governor;\\n    }\\n\\n    /// @dev Changes the `instructor` storage variable.\\n    /// @param _instructor The new value for the `instructor` storage variable.\\n    function changeInstructor(address _instructor) external onlyByGovernorOrInstructor {\\n        instructor = _instructor;\\n    }\\n\\n    /// @dev Changes the `pinakion` storage variable.\\n    /// @param _pinakion The new value for the `pinakion` storage variable.\\n    function changePinakion(IERC20 _pinakion) external onlyByGovernor {\\n        pinakion = _pinakion;\\n    }\\n\\n    /// @dev Changes the `jurorProsecutionModule` storage variable.\\n    /// @param _jurorProsecutionModule The new value for the `jurorProsecutionModule` storage variable.\\n    function changeJurorProsecutionModule(address _jurorProsecutionModule) external onlyByGovernor {\\n        jurorProsecutionModule = _jurorProsecutionModule;\\n    }\\n\\n    /// @dev Changes the `_sortitionModule` storage variable.\\n    /// Note that the new module should be initialized for all courts.\\n    /// @param _sortitionModule The new value for the `sortitionModule` storage variable.\\n    function changeSortitionModule(ISortitionModuleUniversity _sortitionModule) external onlyByGovernor {\\n        sortitionModule = _sortitionModule;\\n    }\\n\\n    /// @dev Add a new supported dispute kit module to the court.\\n    /// @param _disputeKitAddress The address of the dispute kit contract.\\n    function addNewDisputeKit(IDisputeKit _disputeKitAddress) external onlyByGovernor {\\n        uint256 disputeKitID = disputeKits.length;\\n        disputeKits.push(_disputeKitAddress);\\n        emit DisputeKitCreated(disputeKitID, _disputeKitAddress);\\n    }\\n\\n    /// @dev Creates a court under a specified parent court.\\n    /// @param _parent The `parent` property value of the court.\\n    /// @param _hiddenVotes The `hiddenVotes` property value of the court.\\n    /// @param _minStake The `minStake` property value of the court.\\n    /// @param _alpha The `alpha` property value of the court.\\n    /// @param _feeForJuror The `feeForJuror` property value of the court.\\n    /// @param _jurorsForCourtJump The `jurorsForCourtJump` property value of the court.\\n    /// @param _timesPerPeriod The `timesPerPeriod` property value of the court.\\n    /// @param _supportedDisputeKits Indexes of dispute kits that this court will support.\\n    function createCourt(\\n        uint96 _parent,\\n        bool _hiddenVotes,\\n        uint256 _minStake,\\n        uint256 _alpha,\\n        uint256 _feeForJuror,\\n        uint256 _jurorsForCourtJump,\\n        uint256[4] memory _timesPerPeriod,\\n        uint256[] memory _supportedDisputeKits\\n    ) external onlyByGovernor {\\n        if (courts[_parent].minStake > _minStake) revert MinStakeLowerThanParentCourt();\\n        if (_supportedDisputeKits.length == 0) revert UnsupportedDisputeKit();\\n        if (_parent == FORKING_COURT) revert InvalidForkingCourtAsParent();\\n\\n        uint256 courtID = courts.length;\\n        Court storage court = courts.push();\\n\\n        for (uint256 i = 0; i < _supportedDisputeKits.length; i++) {\\n            if (_supportedDisputeKits[i] == 0 || _supportedDisputeKits[i] >= disputeKits.length) {\\n                revert WrongDisputeKitIndex();\\n            }\\n            court.supportedDisputeKits[_supportedDisputeKits[i]] = true;\\n        }\\n        // Check that Classic DK support was added.\\n        if (!court.supportedDisputeKits[DISPUTE_KIT_CLASSIC]) revert MustSupportDisputeKitClassic();\\n\\n        court.parent = _parent;\\n        court.children = new uint256[](0);\\n        court.hiddenVotes = _hiddenVotes;\\n        court.minStake = _minStake;\\n        court.alpha = _alpha;\\n        court.feeForJuror = _feeForJuror;\\n        court.jurorsForCourtJump = _jurorsForCourtJump;\\n        court.timesPerPeriod = _timesPerPeriod;\\n\\n        // Update the parent.\\n        courts[_parent].children.push(courtID);\\n        emit CourtCreated(\\n            courtID,\\n            _parent,\\n            _hiddenVotes,\\n            _minStake,\\n            _alpha,\\n            _feeForJuror,\\n            _jurorsForCourtJump,\\n            _timesPerPeriod,\\n            _supportedDisputeKits\\n        );\\n    }\\n\\n    function changeCourtParameters(\\n        uint96 _courtID,\\n        bool _hiddenVotes,\\n        uint256 _minStake,\\n        uint256 _alpha,\\n        uint256 _feeForJuror,\\n        uint256 _jurorsForCourtJump,\\n        uint256[4] memory _timesPerPeriod\\n    ) external onlyByGovernor {\\n        Court storage court = courts[_courtID];\\n        if (_courtID != GENERAL_COURT && courts[court.parent].minStake > _minStake) {\\n            revert MinStakeLowerThanParentCourt();\\n        }\\n        for (uint256 i = 0; i < court.children.length; i++) {\\n            if (courts[court.children[i]].minStake < _minStake) {\\n                revert MinStakeLowerThanParentCourt();\\n            }\\n        }\\n        court.minStake = _minStake;\\n        court.hiddenVotes = _hiddenVotes;\\n        court.alpha = _alpha;\\n        court.feeForJuror = _feeForJuror;\\n        court.jurorsForCourtJump = _jurorsForCourtJump;\\n        court.timesPerPeriod = _timesPerPeriod;\\n        emit CourtModified(\\n            _courtID,\\n            _hiddenVotes,\\n            _minStake,\\n            _alpha,\\n            _feeForJuror,\\n            _jurorsForCourtJump,\\n            _timesPerPeriod\\n        );\\n    }\\n\\n    /// @dev Adds/removes court's support for specified dispute kits.\\n    /// @param _courtID The ID of the court.\\n    /// @param _disputeKitIDs The IDs of dispute kits which support should be added/removed.\\n    /// @param _enable Whether add or remove the dispute kits from the court.\\n    function enableDisputeKits(uint96 _courtID, uint256[] memory _disputeKitIDs, bool _enable) external onlyByGovernor {\\n        for (uint256 i = 0; i < _disputeKitIDs.length; i++) {\\n            if (_enable) {\\n                if (_disputeKitIDs[i] == 0 || _disputeKitIDs[i] >= disputeKits.length) {\\n                    revert WrongDisputeKitIndex();\\n                }\\n                _enableDisputeKit(_courtID, _disputeKitIDs[i], true);\\n            } else {\\n                // Classic dispute kit must be supported by all courts.\\n                if (_disputeKitIDs[i] == DISPUTE_KIT_CLASSIC) {\\n                    revert CannotDisableClassicDK();\\n                }\\n                _enableDisputeKit(_courtID, _disputeKitIDs[i], false);\\n            }\\n        }\\n    }\\n\\n    /// @dev Changes the supported fee tokens.\\n    /// @param _feeToken The fee token.\\n    /// @param _accepted Whether the token is supported or not as a method of fee payment.\\n    function changeAcceptedFeeTokens(IERC20 _feeToken, bool _accepted) external onlyByGovernor {\\n        currencyRates[_feeToken].feePaymentAccepted = _accepted;\\n        emit AcceptedFeeToken(_feeToken, _accepted);\\n    }\\n\\n    /// @dev Changes the currency rate of a fee token.\\n    /// @param _feeToken The fee token.\\n    /// @param _rateInEth The new rate of the fee token in ETH.\\n    /// @param _rateDecimals The new decimals of the fee token rate.\\n    function changeCurrencyRates(IERC20 _feeToken, uint64 _rateInEth, uint8 _rateDecimals) external onlyByGovernor {\\n        currencyRates[_feeToken].rateInEth = _rateInEth;\\n        currencyRates[_feeToken].rateDecimals = _rateDecimals;\\n        emit NewCurrencyRate(_feeToken, _rateInEth, _rateDecimals);\\n    }\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @dev Sets the caller's stake in a court.\\n    /// @param _courtID The ID of the court.\\n    /// @param _newStake The new stake.\\n    /// Note that the existing delayed stake will be nullified as non-relevant.\\n    function setStake(uint96 _courtID, uint256 _newStake) external {\\n        _setStake(msg.sender, _courtID, _newStake, false, OnError.Revert);\\n    }\\n\\n    /// @dev Sets the stake of a specified account in a court, typically to apply a delayed stake or unstake inactive jurors.\\n    /// @param _account The account whose stake is being set.\\n    /// @param _courtID The ID of the court.\\n    /// @param _newStake The new stake.\\n    /// @param _alreadyTransferred Whether the PNKs have already been transferred to the contract.\\n    function setStakeBySortitionModule(\\n        address _account,\\n        uint96 _courtID,\\n        uint256 _newStake,\\n        bool _alreadyTransferred\\n    ) external {\\n        if (msg.sender != address(sortitionModule)) revert SortitionModuleOnly();\\n        _setStake(_account, _courtID, _newStake, _alreadyTransferred, OnError.Return);\\n    }\\n\\n    /// @inheritdoc IArbitratorV2\\n    function createDispute(\\n        uint256 _numberOfChoices,\\n        bytes memory _extraData\\n    ) external payable override returns (uint256 disputeID) {\\n        if (msg.value < arbitrationCost(_extraData)) revert ArbitrationFeesNotEnough();\\n\\n        return _createDispute(_numberOfChoices, _extraData, NATIVE_CURRENCY, msg.value);\\n    }\\n\\n    /// @inheritdoc IArbitratorV2\\n    function createDispute(\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData,\\n        IERC20 _feeToken,\\n        uint256 _feeAmount\\n    ) external override returns (uint256 disputeID) {\\n        if (!currencyRates[_feeToken].feePaymentAccepted) revert TokenNotAccepted();\\n        if (_feeAmount < arbitrationCost(_extraData, _feeToken)) revert ArbitrationFeesNotEnough();\\n\\n        if (!_feeToken.safeTransferFrom(msg.sender, address(this), _feeAmount)) revert TransferFailed();\\n        return _createDispute(_numberOfChoices, _extraData, _feeToken, _feeAmount);\\n    }\\n\\n    function _createDispute(\\n        uint256 _numberOfChoices,\\n        bytes memory _extraData,\\n        IERC20 _feeToken,\\n        uint256 _feeAmount\\n    ) internal returns (uint256 disputeID) {\\n        (uint96 courtID, , uint256 disputeKitID) = _extraDataToCourtIDMinJurorsDisputeKit(_extraData);\\n        if (!courts[courtID].supportedDisputeKits[disputeKitID]) revert DisputeKitNotSupportedByCourt();\\n\\n        disputeID = disputes.length;\\n        Dispute storage dispute = disputes.push();\\n        dispute.courtID = courtID;\\n        dispute.arbitrated = IArbitrableV2(msg.sender);\\n        dispute.lastPeriodChange = block.timestamp;\\n\\n        IDisputeKit disputeKit = disputeKits[disputeKitID];\\n        Court storage court = courts[courtID];\\n        Round storage round = dispute.rounds.push();\\n\\n        // Obtain the feeForJuror in the same currency as the _feeAmount\\n        uint256 feeForJuror = (_feeToken == NATIVE_CURRENCY)\\n            ? court.feeForJuror\\n            : convertEthToTokenAmount(_feeToken, court.feeForJuror);\\n        round.nbVotes = _feeAmount / feeForJuror;\\n        round.disputeKitID = disputeKitID;\\n        round.pnkAtStakePerJuror = (court.minStake * court.alpha) / ALPHA_DIVISOR;\\n        round.totalFeesForJurors = _feeAmount;\\n        round.feeToken = IERC20(_feeToken);\\n\\n        sortitionModule.createDisputeHook(disputeID, 0); // Default round ID.\\n\\n        disputeKit.createDispute(disputeID, _numberOfChoices, _extraData, round.nbVotes);\\n        emit DisputeCreation(disputeID, IArbitrableV2(msg.sender));\\n    }\\n\\n    /// @dev Passes the period of a specified dispute.\\n    /// @param _disputeID The ID of the dispute.\\n    function passPeriod(uint256 _disputeID) external {\\n        Dispute storage dispute = disputes[_disputeID];\\n        Court storage court = courts[dispute.courtID];\\n\\n        uint256 currentRound = dispute.rounds.length - 1;\\n        Round storage round = dispute.rounds[currentRound];\\n        if (dispute.period == Period.evidence) {\\n            if (\\n                currentRound == 0 &&\\n                block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)]\\n            ) {\\n                revert EvidenceNotPassedAndNotAppeal();\\n            }\\n            if (round.drawnJurors.length != round.nbVotes) revert DisputeStillDrawing();\\n            dispute.period = court.hiddenVotes ? Period.commit : Period.vote;\\n        } else if (dispute.period == Period.commit) {\\n            if (\\n                block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)] &&\\n                !disputeKits[round.disputeKitID].areCommitsAllCast(_disputeID)\\n            ) {\\n                revert CommitPeriodNotPassed();\\n            }\\n            dispute.period = Period.vote;\\n        } else if (dispute.period == Period.vote) {\\n            if (\\n                block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)] &&\\n                !disputeKits[round.disputeKitID].areVotesAllCast(_disputeID)\\n            ) {\\n                revert VotePeriodNotPassed();\\n            }\\n            dispute.period = Period.appeal;\\n            emit AppealPossible(_disputeID, dispute.arbitrated);\\n        } else if (dispute.period == Period.appeal) {\\n            if (block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)]) {\\n                revert AppealPeriodNotPassed();\\n            }\\n            dispute.period = Period.execution;\\n        } else if (dispute.period == Period.execution) {\\n            revert DisputePeriodIsFinal();\\n        }\\n\\n        dispute.lastPeriodChange = block.timestamp;\\n        emit NewPeriod(_disputeID, dispute.period);\\n    }\\n\\n    /// @dev Draws one juror for the dispute until the number votes paid for is reached.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _juror The address of the juror to draw.\\n    function draw(uint256 _disputeID, address _juror) external onlyByGovernorOrInstructor {\\n        Dispute storage dispute = disputes[_disputeID];\\n        uint256 currentRound = dispute.rounds.length - 1;\\n        Round storage round = dispute.rounds[currentRound];\\n        if (dispute.period != Period.evidence) revert NotEvidencePeriod();\\n        if (round.drawnJurors.length >= round.nbVotes) revert AllJurorsDrawn();\\n\\n        sortitionModule.setTransientJuror(_juror);\\n        {\\n            IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n            uint256 iteration = round.drawIterations + 1;\\n            address drawnAddress = disputeKit.draw(_disputeID, iteration);\\n            if (drawnAddress == address(0)) {\\n                revert NoJurorDrawn();\\n            }\\n            sortitionModule.lockStake(drawnAddress, round.pnkAtStakePerJuror);\\n            emit Draw(drawnAddress, _disputeID, currentRound, round.drawnJurors.length);\\n            round.drawnJurors.push(drawnAddress);\\n            if (round.drawnJurors.length == round.nbVotes) {\\n                sortitionModule.postDrawHook(_disputeID, currentRound);\\n            }\\n            round.drawIterations = iteration;\\n        }\\n        sortitionModule.setTransientJuror(address(0));\\n    }\\n\\n    /// @dev Appeals the ruling of a specified dispute.\\n    /// Note: Access restricted to the Dispute Kit for this `disputeID`.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _numberOfChoices Number of choices for the dispute. Can be required during court jump.\\n    /// @param _extraData Extradata for the dispute. Can be required during court jump.\\n    function appeal(uint256 _disputeID, uint256 _numberOfChoices, bytes memory _extraData) external payable {\\n        if (msg.value < appealCost(_disputeID)) revert AppealFeesNotEnough();\\n\\n        Dispute storage dispute = disputes[_disputeID];\\n        if (dispute.period != Period.appeal) revert DisputeNotAppealable();\\n\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        if (msg.sender != address(disputeKits[round.disputeKitID])) revert DisputeKitOnly();\\n\\n        uint96 newCourtID = dispute.courtID;\\n        uint256 newDisputeKitID = round.disputeKitID;\\n\\n        // Warning: the extra round must be created before calling disputeKit.createDispute()\\n        Round storage extraRound = dispute.rounds.push();\\n\\n        if (round.nbVotes >= courts[newCourtID].jurorsForCourtJump) {\\n            // Jump to parent court.\\n            newCourtID = courts[newCourtID].parent;\\n\\n            if (!courts[newCourtID].supportedDisputeKits[newDisputeKitID]) {\\n                // Switch to classic dispute kit if parent court doesn't support the current one.\\n                newDisputeKitID = DISPUTE_KIT_CLASSIC;\\n            }\\n\\n            if (newCourtID != dispute.courtID) {\\n                emit CourtJump(_disputeID, dispute.rounds.length - 1, dispute.courtID, newCourtID);\\n            }\\n        }\\n\\n        dispute.courtID = newCourtID;\\n        dispute.period = Period.evidence;\\n        dispute.lastPeriodChange = block.timestamp;\\n\\n        Court storage court = courts[newCourtID];\\n        extraRound.nbVotes = msg.value / court.feeForJuror; // As many votes that can be afforded by the provided funds.\\n        extraRound.pnkAtStakePerJuror = (court.minStake * court.alpha) / ALPHA_DIVISOR;\\n        extraRound.totalFeesForJurors = msg.value;\\n        extraRound.disputeKitID = newDisputeKitID;\\n\\n        sortitionModule.createDisputeHook(_disputeID, dispute.rounds.length - 1);\\n\\n        // Dispute kit was changed, so create a dispute in the new DK contract.\\n        if (extraRound.disputeKitID != round.disputeKitID) {\\n            emit DisputeKitJump(_disputeID, dispute.rounds.length - 1, round.disputeKitID, extraRound.disputeKitID);\\n            disputeKits[extraRound.disputeKitID].createDispute(\\n                _disputeID,\\n                _numberOfChoices,\\n                _extraData,\\n                extraRound.nbVotes\\n            );\\n        }\\n\\n        emit AppealDecision(_disputeID, dispute.arbitrated);\\n        emit NewPeriod(_disputeID, Period.evidence);\\n    }\\n\\n    /// @dev Distribute the PNKs at stake and the dispute fees for the specific round of the dispute. Can be called in parts.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _round The appeal round.\\n    /// @param _iterations The number of iterations to run.\\n    function execute(uint256 _disputeID, uint256 _round, uint256 _iterations) external {\\n        Round storage round;\\n        {\\n            Dispute storage dispute = disputes[_disputeID];\\n            if (dispute.period != Period.execution) revert NotExecutionPeriod();\\n\\n            round = dispute.rounds[_round];\\n        } // stack too deep workaround\\n\\n        uint256 start = round.repartitions;\\n        uint256 end = round.repartitions + _iterations;\\n\\n        uint256 pnkPenaltiesInRound = round.pnkPenalties; // Keep in memory to save gas.\\n        uint256 numberOfVotesInRound = round.drawnJurors.length;\\n        uint256 feePerJurorInRound = round.totalFeesForJurors / numberOfVotesInRound;\\n        uint256 pnkAtStakePerJurorInRound = round.pnkAtStakePerJuror;\\n        uint256 coherentCount;\\n        {\\n            IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n            coherentCount = disputeKit.getCoherentCount(_disputeID, _round); // Total number of jurors that are eligible to a reward in this round.\\n        } // stack too deep workaround\\n\\n        if (coherentCount == 0) {\\n            // We loop over the votes once as there are no rewards because it is not a tie and no one in this round is coherent with the final outcome.\\n            if (end > numberOfVotesInRound) end = numberOfVotesInRound;\\n        } else {\\n            // We loop over the votes twice, first to collect the PNK penalties, and second to distribute them as rewards along with arbitration fees.\\n            if (end > numberOfVotesInRound * 2) end = numberOfVotesInRound * 2;\\n        }\\n        round.repartitions = end;\\n\\n        for (uint256 i = start; i < end; i++) {\\n            if (i < numberOfVotesInRound) {\\n                pnkPenaltiesInRound = _executePenalties(\\n                    ExecuteParams({\\n                        disputeID: _disputeID,\\n                        round: _round,\\n                        coherentCount: coherentCount,\\n                        numberOfVotesInRound: numberOfVotesInRound,\\n                        feePerJurorInRound: feePerJurorInRound,\\n                        pnkAtStakePerJurorInRound: pnkAtStakePerJurorInRound,\\n                        pnkPenaltiesInRound: pnkPenaltiesInRound,\\n                        repartition: i\\n                    })\\n                );\\n            } else {\\n                _executeRewards(\\n                    ExecuteParams({\\n                        disputeID: _disputeID,\\n                        round: _round,\\n                        coherentCount: coherentCount,\\n                        numberOfVotesInRound: numberOfVotesInRound,\\n                        feePerJurorInRound: feePerJurorInRound,\\n                        pnkAtStakePerJurorInRound: pnkAtStakePerJurorInRound,\\n                        pnkPenaltiesInRound: pnkPenaltiesInRound,\\n                        repartition: i\\n                    })\\n                );\\n            }\\n        }\\n        if (round.pnkPenalties != pnkPenaltiesInRound) {\\n            round.pnkPenalties = pnkPenaltiesInRound; // Reentrancy risk: breaks Check-Effect-Interact\\n        }\\n    }\\n\\n    /// @dev Distribute the PNKs at stake and the dispute fees for the specific round of the dispute, penalties only.\\n    /// @param _params The parameters for the execution, see `ExecuteParams`.\\n    /// @return pnkPenaltiesInRoundCache The updated penalties in round cache.\\n    function _executePenalties(ExecuteParams memory _params) internal returns (uint256) {\\n        Dispute storage dispute = disputes[_params.disputeID];\\n        Round storage round = dispute.rounds[_params.round];\\n        IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n\\n        // [0, 1] value that determines how coherent the juror was in this round, in basis points.\\n        uint256 degreeOfCoherence = disputeKit.getDegreeOfCoherence(\\n            _params.disputeID,\\n            _params.round,\\n            _params.repartition,\\n            _params.feePerJurorInRound,\\n            _params.pnkAtStakePerJurorInRound\\n        );\\n        if (degreeOfCoherence > ALPHA_DIVISOR) {\\n            // Make sure the degree doesn't exceed 1, though it should be ensured by the dispute kit.\\n            degreeOfCoherence = ALPHA_DIVISOR;\\n        }\\n\\n        // Fully coherent jurors won't be penalized.\\n        uint256 penalty = (round.pnkAtStakePerJuror * (ALPHA_DIVISOR - degreeOfCoherence)) / ALPHA_DIVISOR;\\n        _params.pnkPenaltiesInRound += penalty;\\n\\n        // Unlock the PNKs affected by the penalty\\n        address account = round.drawnJurors[_params.repartition];\\n        sortitionModule.unlockStake(account, penalty);\\n\\n        // Apply the penalty to the staked PNKs.\\n        sortitionModule.penalizeStake(account, penalty);\\n        emit TokenAndETHShift(\\n            account,\\n            _params.disputeID,\\n            _params.round,\\n            degreeOfCoherence,\\n            -int256(penalty),\\n            0,\\n            round.feeToken\\n        );\\n\\n        if (!disputeKit.isVoteActive(_params.disputeID, _params.round, _params.repartition)) {\\n            // The juror is inactive, unstake them.\\n            sortitionModule.setJurorInactive(account);\\n        }\\n        if (_params.repartition == _params.numberOfVotesInRound - 1 && _params.coherentCount == 0) {\\n            // No one was coherent, send the rewards to the governor.\\n            if (round.feeToken == NATIVE_CURRENCY) {\\n                // The dispute fees were paid in ETH\\n                payable(governor).send(round.totalFeesForJurors);\\n            } else {\\n                // The dispute fees were paid in ERC20\\n                round.feeToken.safeTransfer(governor, round.totalFeesForJurors);\\n            }\\n            pinakion.safeTransfer(governor, _params.pnkPenaltiesInRound);\\n            emit LeftoverRewardSent(\\n                _params.disputeID,\\n                _params.round,\\n                _params.pnkPenaltiesInRound,\\n                round.totalFeesForJurors,\\n                round.feeToken\\n            );\\n        }\\n        return _params.pnkPenaltiesInRound;\\n    }\\n\\n    /// @dev Distribute the PNKs at stake and the dispute fees for the specific round of the dispute, rewards only.\\n    /// @param _params The parameters for the execution, see `ExecuteParams`.\\n    function _executeRewards(ExecuteParams memory _params) internal {\\n        Dispute storage dispute = disputes[_params.disputeID];\\n        Round storage round = dispute.rounds[_params.round];\\n        IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n\\n        // [0, 1] value that determines how coherent the juror was in this round, in basis points.\\n        uint256 degreeOfCoherence = disputeKit.getDegreeOfCoherence(\\n            _params.disputeID,\\n            _params.round,\\n            _params.repartition % _params.numberOfVotesInRound,\\n            _params.feePerJurorInRound,\\n            _params.pnkAtStakePerJurorInRound\\n        );\\n\\n        // Make sure the degree doesn't exceed 1, though it should be ensured by the dispute kit.\\n        if (degreeOfCoherence > ALPHA_DIVISOR) {\\n            degreeOfCoherence = ALPHA_DIVISOR;\\n        }\\n\\n        address account = round.drawnJurors[_params.repartition % _params.numberOfVotesInRound];\\n        uint256 pnkLocked = (round.pnkAtStakePerJuror * degreeOfCoherence) / ALPHA_DIVISOR;\\n\\n        // Release the rest of the PNKs of the juror for this round.\\n        sortitionModule.unlockStake(account, pnkLocked);\\n\\n        // Give back the locked PNKs in case the juror fully unstaked earlier.\\n        if (!sortitionModule.isJurorStaked(account)) {\\n            pinakion.safeTransfer(account, pnkLocked);\\n        }\\n\\n        // Transfer the rewards\\n        uint256 pnkReward = ((_params.pnkPenaltiesInRound / _params.coherentCount) * degreeOfCoherence) / ALPHA_DIVISOR;\\n        round.sumPnkRewardPaid += pnkReward;\\n        uint256 feeReward = ((round.totalFeesForJurors / _params.coherentCount) * degreeOfCoherence) / ALPHA_DIVISOR;\\n        round.sumFeeRewardPaid += feeReward;\\n        pinakion.safeTransfer(account, pnkReward);\\n        if (round.feeToken == NATIVE_CURRENCY) {\\n            // The dispute fees were paid in ETH\\n            payable(account).send(feeReward);\\n        } else {\\n            // The dispute fees were paid in ERC20\\n            round.feeToken.safeTransfer(account, feeReward);\\n        }\\n        emit TokenAndETHShift(\\n            account,\\n            _params.disputeID,\\n            _params.round,\\n            degreeOfCoherence,\\n            int256(pnkReward),\\n            int256(feeReward),\\n            round.feeToken\\n        );\\n\\n        // Transfer any residual rewards to the governor. It may happen due to partial coherence of the jurors.\\n        if (_params.repartition == _params.numberOfVotesInRound * 2 - 1) {\\n            uint256 leftoverPnkReward = _params.pnkPenaltiesInRound - round.sumPnkRewardPaid;\\n            uint256 leftoverFeeReward = round.totalFeesForJurors - round.sumFeeRewardPaid;\\n            if (leftoverPnkReward != 0 || leftoverFeeReward != 0) {\\n                if (leftoverPnkReward != 0) {\\n                    pinakion.safeTransfer(governor, leftoverPnkReward);\\n                }\\n                if (leftoverFeeReward != 0) {\\n                    if (round.feeToken == NATIVE_CURRENCY) {\\n                        // The dispute fees were paid in ETH\\n                        payable(governor).send(leftoverFeeReward);\\n                    } else {\\n                        // The dispute fees were paid in ERC20\\n                        round.feeToken.safeTransfer(governor, leftoverFeeReward);\\n                    }\\n                }\\n                emit LeftoverRewardSent(\\n                    _params.disputeID,\\n                    _params.round,\\n                    leftoverPnkReward,\\n                    leftoverFeeReward,\\n                    round.feeToken\\n                );\\n            }\\n        }\\n    }\\n\\n    /// @dev Executes a specified dispute's ruling.\\n    /// @param _disputeID The ID of the dispute.\\n    function executeRuling(uint256 _disputeID) external {\\n        Dispute storage dispute = disputes[_disputeID];\\n        if (dispute.period != Period.execution) revert NotExecutionPeriod();\\n        if (dispute.ruled) revert RulingAlreadyExecuted();\\n\\n        (uint256 winningChoice, , ) = currentRuling(_disputeID);\\n        dispute.ruled = true;\\n        emit Ruling(dispute.arbitrated, _disputeID, winningChoice);\\n        dispute.arbitrated.rule(_disputeID, winningChoice);\\n    }\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /// @dev Compute the cost of arbitration denominated in ETH.\\n    ///      It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @return cost The arbitration cost in ETH.\\n    function arbitrationCost(bytes memory _extraData) public view override returns (uint256 cost) {\\n        (uint96 courtID, uint256 minJurors, ) = _extraDataToCourtIDMinJurorsDisputeKit(_extraData);\\n        cost = courts[courtID].feeForJuror * minJurors;\\n    }\\n\\n    /// @dev Compute the cost of arbitration denominated in `_feeToken`.\\n    ///      It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @param _feeToken The ERC20 token used to pay fees.\\n    /// @return cost The arbitration cost in `_feeToken`.\\n    function arbitrationCost(bytes calldata _extraData, IERC20 _feeToken) public view override returns (uint256 cost) {\\n        cost = convertEthToTokenAmount(_feeToken, arbitrationCost(_extraData));\\n    }\\n\\n    /// @dev Gets the cost of appealing a specified dispute.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return cost The appeal cost.\\n    function appealCost(uint256 _disputeID) public view returns (uint256 cost) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        Court storage court = courts[dispute.courtID];\\n        if (round.nbVotes >= court.jurorsForCourtJump) {\\n            // Jump to parent court.\\n            if (dispute.courtID == GENERAL_COURT) {\\n                // TODO: Handle the forking when appealed in General court.\\n                cost = NON_PAYABLE_AMOUNT; // Get the cost of the parent court.\\n            } else {\\n                cost = courts[court.parent].feeForJuror * ((round.nbVotes * 2) + 1);\\n            }\\n        } else {\\n            // Stay in current court.\\n            cost = court.feeForJuror * ((round.nbVotes * 2) + 1);\\n        }\\n    }\\n\\n    /// @dev Gets the start and the end of a specified dispute's current appeal period.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return start The start of the appeal period.\\n    /// @return end The end of the appeal period.\\n    function appealPeriod(uint256 _disputeID) public view returns (uint256 start, uint256 end) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        if (dispute.period == Period.appeal) {\\n            start = dispute.lastPeriodChange;\\n            end = dispute.lastPeriodChange + courts[dispute.courtID].timesPerPeriod[uint256(Period.appeal)];\\n        } else {\\n            start = 0;\\n            end = 0;\\n        }\\n    }\\n\\n    /// @dev Gets the current ruling of a specified dispute.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return ruling The current ruling.\\n    /// @return tied Whether it's a tie or not.\\n    /// @return overridden Whether the ruling was overridden by appeal funding or not.\\n    function currentRuling(uint256 _disputeID) public view returns (uint256 ruling, bool tied, bool overridden) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n        (ruling, tied, overridden) = disputeKit.currentRuling(_disputeID);\\n    }\\n\\n    function getRoundInfo(uint256 _disputeID, uint256 _round) external view returns (Round memory) {\\n        return disputes[_disputeID].rounds[_round];\\n    }\\n\\n    function getNumberOfRounds(uint256 _disputeID) external view returns (uint256) {\\n        return disputes[_disputeID].rounds.length;\\n    }\\n\\n    function isSupported(uint96 _courtID, uint256 _disputeKitID) external view returns (bool) {\\n        return courts[_courtID].supportedDisputeKits[_disputeKitID];\\n    }\\n\\n    /// @dev Gets the timesPerPeriod array for a given court.\\n    /// @param _courtID The ID of the court to get the times from.\\n    /// @return timesPerPeriod The timesPerPeriod array for the given court.\\n    function getTimesPerPeriod(uint96 _courtID) external view returns (uint256[4] memory timesPerPeriod) {\\n        timesPerPeriod = courts[_courtID].timesPerPeriod;\\n    }\\n\\n    // ************************************* //\\n    // *   Public Views for Dispute Kits   * //\\n    // ************************************* //\\n\\n    /// @dev Gets the number of votes permitted for the specified dispute in the latest round.\\n    /// @param _disputeID The ID of the dispute.\\n    function getNumberOfVotes(uint256 _disputeID) external view returns (uint256) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        return dispute.rounds[dispute.rounds.length - 1].nbVotes;\\n    }\\n\\n    /// @dev Returns true if the dispute kit will be switched to a parent DK.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return Whether DK will be switched or not.\\n    function isDisputeKitJumping(uint256 _disputeID) external view returns (bool) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        Court storage court = courts[dispute.courtID];\\n\\n        if (round.nbVotes < court.jurorsForCourtJump) {\\n            return false;\\n        }\\n\\n        // Jump if the parent court doesn't support the current DK.\\n        return !courts[court.parent].supportedDisputeKits[round.disputeKitID];\\n    }\\n\\n    function getDisputeKitsLength() external view returns (uint256) {\\n        return disputeKits.length;\\n    }\\n\\n    function convertEthToTokenAmount(IERC20 _toToken, uint256 _amountInEth) public view returns (uint256) {\\n        return (_amountInEth * 10 ** currencyRates[_toToken].rateDecimals) / currencyRates[_toToken].rateInEth;\\n    }\\n\\n    // ************************************* //\\n    // *            Internal               * //\\n    // ************************************* //\\n\\n    /// @dev Toggles the dispute kit support for a given court.\\n    /// @param _courtID The ID of the court to toggle the support for.\\n    /// @param _disputeKitID The ID of the dispute kit to toggle the support for.\\n    /// @param _enable Whether to enable or disable the support. Note that classic dispute kit should always be enabled.\\n    function _enableDisputeKit(uint96 _courtID, uint256 _disputeKitID, bool _enable) internal {\\n        courts[_courtID].supportedDisputeKits[_disputeKitID] = _enable;\\n        emit DisputeKitEnabled(_courtID, _disputeKitID, _enable);\\n    }\\n\\n    /// @dev If called only once then set _onError to Revert, otherwise set it to Return\\n    /// @param _account The account to set the stake for.\\n    /// @param _courtID The ID of the court to set the stake for.\\n    /// @param _newStake The new stake.\\n    /// @param _alreadyTransferred Whether the PNKs were already transferred to/from the staking contract.\\n    /// @param _onError Whether to revert or return false on error.\\n    /// @return Whether the stake was successfully set or not.\\n    function _setStake(\\n        address _account,\\n        uint96 _courtID,\\n        uint256 _newStake,\\n        bool _alreadyTransferred,\\n        OnError _onError\\n    ) internal returns (bool) {\\n        if (_courtID == FORKING_COURT || _courtID > courts.length) {\\n            _stakingFailed(_onError, StakingResult.CannotStakeInThisCourt); // Staking directly into the forking court is not allowed.\\n            return false;\\n        }\\n        if (_newStake != 0 && _newStake < courts[_courtID].minStake) {\\n            _stakingFailed(_onError, StakingResult.CannotStakeLessThanMinStake); // Staking less than the minimum stake is not allowed.\\n            return false;\\n        }\\n        (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult) = sortitionModule.setStake(\\n            _account,\\n            _courtID,\\n            _newStake,\\n            _alreadyTransferred\\n        );\\n        if (stakingResult != StakingResult.Successful) {\\n            _stakingFailed(_onError, stakingResult);\\n            return false;\\n        }\\n        if (pnkDeposit > 0) {\\n            if (!pinakion.safeTransferFrom(_account, address(this), pnkDeposit)) {\\n                _stakingFailed(_onError, StakingResult.StakingTransferFailed);\\n                return false;\\n            }\\n        }\\n        if (pnkWithdrawal > 0) {\\n            if (!pinakion.safeTransfer(_account, pnkWithdrawal)) {\\n                _stakingFailed(_onError, StakingResult.UnstakingTransferFailed);\\n                return false;\\n            }\\n        }\\n        return true;\\n    }\\n\\n    /// @dev It may revert depending on the _onError parameter.\\n    function _stakingFailed(OnError _onError, StakingResult _result) internal pure virtual {\\n        if (_onError == OnError.Return) return;\\n        if (_result == StakingResult.StakingTransferFailed) revert StakingTransferFailed();\\n        if (_result == StakingResult.UnstakingTransferFailed) revert UnstakingTransferFailed();\\n        if (_result == StakingResult.CannotStakeInMoreCourts) revert StakingInTooManyCourts();\\n        if (_result == StakingResult.CannotStakeInThisCourt) revert StakingNotPossibeInThisCourt();\\n        if (_result == StakingResult.CannotStakeLessThanMinStake) revert StakingLessThanCourtMinStake();\\n    }\\n\\n    /// @dev Gets a court ID, the minimum number of jurors and an ID of a dispute kit from a specified extra data bytes array.\\n    /// Note that if extradata contains an incorrect value then this value will be switched to default.\\n    /// @param _extraData The extra data bytes array. The first 32 bytes are the court ID, the next are the minimum number of jurors and the last are the dispute kit ID.\\n    /// @return courtID The court ID.\\n    /// @return minJurors The minimum number of jurors required.\\n    /// @return disputeKitID The ID of the dispute kit.\\n    function _extraDataToCourtIDMinJurorsDisputeKit(\\n        bytes memory _extraData\\n    ) internal view returns (uint96 courtID, uint256 minJurors, uint256 disputeKitID) {\\n        // Note that if the extradata doesn't contain 32 bytes for the dispute kit ID it'll return the default 0 index.\\n        if (_extraData.length >= 64) {\\n            assembly {\\n                // solium-disable-line security/no-inline-assembly\\n                courtID := mload(add(_extraData, 0x20))\\n                minJurors := mload(add(_extraData, 0x40))\\n                disputeKitID := mload(add(_extraData, 0x60))\\n            }\\n            if (courtID == FORKING_COURT || courtID >= courts.length) {\\n                courtID = GENERAL_COURT;\\n            }\\n            if (minJurors == 0) {\\n                minJurors = DEFAULT_NB_OF_JURORS;\\n            }\\n            if (disputeKitID == NULL_DISPUTE_KIT || disputeKitID >= disputeKits.length) {\\n                disputeKitID = DISPUTE_KIT_CLASSIC; // 0 index is not used.\\n            }\\n        } else {\\n            courtID = GENERAL_COURT;\\n            minJurors = DEFAULT_NB_OF_JURORS;\\n            disputeKitID = DISPUTE_KIT_CLASSIC;\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *              Errors               * //\\n    // ************************************* //\\n\\n    error GovernorOnly();\\n    error InstructorOnly();\\n    error GovernorOrInstructorOnly();\\n    error DisputeKitOnly();\\n    error SortitionModuleOnly();\\n    error UnsuccessfulCall();\\n    error InvalidDisputKitParent();\\n    error DepthLevelMax();\\n    error MinStakeLowerThanParentCourt();\\n    error UnsupportedDisputeKit();\\n    error InvalidForkingCourtAsParent();\\n    error WrongDisputeKitIndex();\\n    error CannotDisableClassicDK();\\n    error ArraysLengthMismatch();\\n    error StakingInTooManyCourts();\\n    error StakingNotPossibeInThisCourt();\\n    error StakingLessThanCourtMinStake();\\n    error StakingTransferFailed();\\n    error UnstakingTransferFailed();\\n    error ArbitrationFeesNotEnough();\\n    error DisputeKitNotSupportedByCourt();\\n    error MustSupportDisputeKitClassic();\\n    error TokenNotAccepted();\\n    error EvidenceNotPassedAndNotAppeal();\\n    error DisputeStillDrawing();\\n    error CommitPeriodNotPassed();\\n    error VotePeriodNotPassed();\\n    error AppealPeriodNotPassed();\\n    error NotEvidencePeriod();\\n    error AppealFeesNotEnough();\\n    error DisputeNotAppealable();\\n    error NotExecutionPeriod();\\n    error RulingAlreadyExecuted();\\n    error DisputePeriodIsFinal();\\n    error TransferFailed();\\n    error AllJurorsDrawn();\\n    error NoJurorDrawn();\\n}\\n\",\"keccak256\":\"0xd636c2294d15110a20dcf97d67f2989e14233cd1de353032807ad44a8e828e49\",\"license\":\"MIT\"},\"src/arbitration/university/SortitionModuleUniversity.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\n/**\\n *  @custom:authors: [@epiqueras, @unknownunknown1, @jaybuidl, @shotaronowhere]\\n *  @custom:reviewers: []\\n *  @custom:auditors: []\\n *  @custom:bounties: []\\n *  @custom:deployments: []\\n */\\n\\npragma solidity 0.8.24;\\n\\nimport \\\"./KlerosCoreUniversity.sol\\\";\\nimport \\\"./ISortitionModuleUniversity.sol\\\";\\nimport \\\"../interfaces/IDisputeKit.sol\\\";\\nimport \\\"../../proxy/UUPSProxiable.sol\\\";\\nimport \\\"../../proxy/Initializable.sol\\\";\\nimport \\\"../../libraries/Constants.sol\\\";\\n\\n/// @title SortitionModuleUniversity\\n/// @dev An adapted version of the SortitionModule contract for educational purposes.\\ncontract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable, Initializable {\\n    // ************************************* //\\n    // *         Enums / Structs           * //\\n    // ************************************* //\\n\\n    struct Juror {\\n        mapping(uint96 => uint256) stakesByCourtID; // The stakes of the juror in particular courts.\\n        uint96[] courtIDs; // The IDs of courts where the juror's stake path ends. A stake path is a path from the general court to a court the juror directly staked in using `_setStake`.\\n        uint256 stakedPnk; // The juror's total amount of tokens staked in subcourts. Reflects actual pnk balance.\\n        uint256 lockedPnk; // The juror's total amount of tokens locked in disputes. Can reflect actual pnk balance when stakedPnk are fully withdrawn.\\n    }\\n\\n    // ************************************* //\\n    // *             Storage               * //\\n    // ************************************* //\\n\\n    address public governor; // The governor of the contract.\\n    KlerosCoreUniversity public core; // The core arbitrator contract.\\n    uint256 public disputesWithoutJurors; // The number of disputes that have not finished drawing jurors.\\n    mapping(address account => Juror) public jurors; // The jurors.\\n    address private transientJuror; // The juror address used between calls within the same transaction.\\n\\n    // ************************************* //\\n    // *              Events               * //\\n    // ************************************* //\\n\\n    event StakeSet(address indexed _address, uint256 _courtID, uint256 _amount);\\n    event StakeLocked(address indexed _address, uint256 _relativeAmount, bool _unlock);\\n\\n    // ************************************* //\\n    // *        Function Modifiers         * //\\n    // ************************************* //\\n\\n    modifier onlyByGovernor() {\\n        require(address(governor) == msg.sender, \\\"Access not allowed: Governor only.\\\");\\n        _;\\n    }\\n\\n    modifier onlyByCore() {\\n        require(address(core) == msg.sender, \\\"Access not allowed: KlerosCore only.\\\");\\n        _;\\n    }\\n\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    /// @dev Constructor, initializing the implementation to reduce attack surface.\\n    constructor() {\\n        _disableInitializers();\\n    }\\n\\n    /// @dev Initializer (constructor equivalent for upgradable contracts).\\n    /// @param _core The KlerosCore.\\n    function initialize(address _governor, KlerosCoreUniversity _core) external reinitializer(1) {\\n        governor = _governor;\\n        core = _core;\\n    }\\n\\n    // ************************************* //\\n    // *             Governance            * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Access Control to perform implementation upgrades (UUPS Proxiable)\\n     * @dev Only the governor can perform upgrades (`onlyByGovernor`)\\n     */\\n    function _authorizeUpgrade(address) internal view override onlyByGovernor {\\n        // NOP\\n    }\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    function setTransientJuror(address _juror) external override onlyByCore {\\n        transientJuror = _juror;\\n    }\\n\\n    function createTree(bytes32 _key, bytes memory _extraData) external {\\n        // NOP\\n    }\\n\\n    function createDisputeHook(uint256 /*_disputeID*/, uint256 /*_roundID*/) external override onlyByCore {\\n        disputesWithoutJurors++;\\n    }\\n\\n    function postDrawHook(uint256 /*_disputeID*/, uint256 /*_roundID*/) external override onlyByCore {\\n        disputesWithoutJurors--;\\n    }\\n\\n    /// @dev Saves the random number to use it in sortition. Not used by this contract because the storing of the number is inlined in passPhase().\\n    /// @param _randomNumber Random number returned by RNG contract.\\n    function notifyRandomNumber(uint256 _randomNumber) public override {}\\n\\n    /// @dev Sets the specified juror's stake in a court.\\n    /// `O(n + p * log_k(j))` where\\n    /// `n` is the number of courts the juror has staked in,\\n    /// `p` is the depth of the court tree,\\n    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,\\n    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.\\n    /// @param _account The address of the juror.\\n    /// @param _courtID The ID of the court.\\n    /// @param _newStake The new stake.\\n    /// @param _alreadyTransferred True if the tokens were already transferred from juror. Only relevant for delayed stakes.\\n    /// @return pnkDeposit The amount of PNK to be deposited.\\n    /// @return pnkWithdrawal The amount of PNK to be withdrawn.\\n    /// @return stakingResult The result of the staking operation.\\n    function setStake(\\n        address _account,\\n        uint96 _courtID,\\n        uint256 _newStake,\\n        bool _alreadyTransferred\\n    ) external override onlyByCore returns (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult) {\\n        Juror storage juror = jurors[_account];\\n        uint256 currentStake = _stakeOf(_account, _courtID);\\n\\n        uint256 nbCourts = juror.courtIDs.length;\\n        if (_newStake == 0 && (nbCourts >= MAX_STAKE_PATHS || currentStake == 0)) {\\n            return (0, 0, StakingResult.CannotStakeInMoreCourts); // Prevent staking beyond MAX_STAKE_PATHS but unstaking is always allowed.\\n        }\\n\\n        if (_newStake >= currentStake) {\\n            if (!_alreadyTransferred) {\\n                pnkDeposit = _increaseStake(juror, _courtID, _newStake, currentStake);\\n            }\\n        } else {\\n            pnkWithdrawal += _decreaseStake(juror, _courtID, _newStake, currentStake);\\n        }\\n\\n        bool finished = false;\\n        uint96 currentCourtID = _courtID;\\n        while (!finished) {\\n            // Tokens are also implicitly staked in parent courts through sortition module to increase the chance of being drawn.\\n            juror.stakesByCourtID[currentCourtID] += _newStake;\\n            juror.stakesByCourtID[currentCourtID] -= currentStake;\\n            if (currentCourtID == GENERAL_COURT) {\\n                finished = true;\\n            } else {\\n                (currentCourtID, , , , , , ) = core.courts(currentCourtID);\\n            }\\n        }\\n        emit StakeSet(_account, _courtID, _newStake);\\n        return (pnkDeposit, pnkWithdrawal, StakingResult.Successful);\\n    }\\n\\n    function _increaseStake(\\n        Juror storage juror,\\n        uint96 _courtID,\\n        uint256 _newStake,\\n        uint256 _currentStake\\n    ) internal returns (uint256 transferredAmount) {\\n        // Stake increase\\n        // When stakedPnk becomes lower than lockedPnk count the locked tokens in when transferring tokens from juror.\\n        // (E.g. stakedPnk = 0, lockedPnk = 150) which can happen if the juror unstaked fully while having some tokens locked.\\n        uint256 previouslyLocked = (juror.lockedPnk >= juror.stakedPnk) ? juror.lockedPnk - juror.stakedPnk : 0; // underflow guard\\n        transferredAmount = (_newStake >= _currentStake + previouslyLocked) // underflow guard\\n            ? _newStake - _currentStake - previouslyLocked\\n            : 0;\\n        if (_currentStake == 0) {\\n            juror.courtIDs.push(_courtID);\\n        }\\n        // stakedPnk can become async with _currentStake (e.g. after penalty).\\n        juror.stakedPnk = (juror.stakedPnk >= _currentStake) ? juror.stakedPnk - _currentStake + _newStake : _newStake;\\n    }\\n\\n    function _decreaseStake(\\n        Juror storage juror,\\n        uint96 _courtID,\\n        uint256 _newStake,\\n        uint256 _currentStake\\n    ) internal returns (uint256 transferredAmount) {\\n        // Stakes can be partially delayed only when stake is increased.\\n        // Stake decrease: make sure locked tokens always stay in the contract. They can only be released during Execution.\\n        if (juror.stakedPnk >= _currentStake - _newStake + juror.lockedPnk) {\\n            // We have enough pnk staked to afford withdrawal while keeping locked tokens.\\n            transferredAmount = _currentStake - _newStake;\\n        } else if (juror.stakedPnk >= juror.lockedPnk) {\\n            // Can't afford withdrawing the current stake fully. Take whatever is available while keeping locked tokens.\\n            transferredAmount = juror.stakedPnk - juror.lockedPnk;\\n        }\\n        if (_newStake == 0) {\\n            for (uint256 i = juror.courtIDs.length; i > 0; i--) {\\n                if (juror.courtIDs[i - 1] == _courtID) {\\n                    juror.courtIDs[i - 1] = juror.courtIDs[juror.courtIDs.length - 1];\\n                    juror.courtIDs.pop();\\n                    break;\\n                }\\n            }\\n        }\\n        // stakedPnk can become async with _currentStake (e.g. after penalty).\\n        juror.stakedPnk = (juror.stakedPnk >= _currentStake) ? juror.stakedPnk - _currentStake + _newStake : _newStake;\\n    }\\n\\n    function lockStake(address _account, uint256 _relativeAmount) external override onlyByCore {\\n        jurors[_account].lockedPnk += _relativeAmount;\\n        emit StakeLocked(_account, _relativeAmount, false);\\n    }\\n\\n    function unlockStake(address _account, uint256 _relativeAmount) external override onlyByCore {\\n        jurors[_account].lockedPnk -= _relativeAmount;\\n        emit StakeLocked(_account, _relativeAmount, true);\\n    }\\n\\n    function penalizeStake(address _account, uint256 _relativeAmount) external override onlyByCore {\\n        Juror storage juror = jurors[_account];\\n        if (juror.stakedPnk >= _relativeAmount) {\\n            juror.stakedPnk -= _relativeAmount;\\n        } else {\\n            juror.stakedPnk = 0; // stakedPnk might become lower after manual unstaking, but lockedPnk will always cover the difference.\\n        }\\n    }\\n\\n    /// @dev Unstakes the inactive juror from all courts.\\n    /// `O(n * (p * log_k(j)) )` where\\n    /// `n` is the number of courts the juror has staked in,\\n    /// `p` is the depth of the court tree,\\n    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,\\n    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.\\n    /// @param _account The juror to unstake.\\n    function setJurorInactive(address _account) external override onlyByCore {\\n        uint96[] memory courtIDs = getJurorCourtIDs(_account);\\n        for (uint256 j = courtIDs.length; j > 0; j--) {\\n            core.setStakeBySortitionModule(_account, courtIDs[j - 1], 0, false);\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /// @dev Draw an ID from a tree using a number.\\n    /// Note that this function reverts if the sum of all values in the tree is 0.\\n    /// @return drawnAddress The drawn address.\\n    /// `O(k * log_k(n))` where\\n    /// `k` is the maximum number of children per node in the tree,\\n    ///  and `n` is the maximum number of nodes ever appended.\\n    function draw(bytes32, uint256, uint256) public view override returns (address drawnAddress) {\\n        drawnAddress = transientJuror;\\n    }\\n\\n    /// @dev Gets the stake of a juror in a court.\\n    /// Warning: `O(n)` complexity where `n` is the number of courts the juror has staked in\\n    /// but acceptable for this educational implementation.\\n    /// @param _juror The address of the juror.\\n    /// @param _courtID The ID of the court.\\n    /// @return totalStaked The total amount of tokens staked by the juror in the court.\\n    /// @return totalLocked The total amount of tokens locked by the juror in the court.\\n    /// @return stakedInCourt The amount of tokens staked by the juror in the court.\\n    /// @return nbCourts The number of courts the juror has staked in.\\n    function getJurorBalance(\\n        address _juror,\\n        uint96 _courtID\\n    )\\n        external\\n        view\\n        override\\n        returns (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts)\\n    {\\n        Juror storage juror = jurors[_juror];\\n        totalStaked = juror.stakedPnk;\\n        totalLocked = juror.lockedPnk;\\n        nbCourts = juror.courtIDs.length;\\n        for (uint256 i = 0; i < nbCourts; i++) {\\n            if (juror.courtIDs[i] == _courtID) {\\n                stakedInCourt = juror.stakesByCourtID[_courtID];\\n                break;\\n            }\\n        }\\n    }\\n\\n    /// @dev Gets the court identifiers where a specific `_juror` has staked.\\n    /// @param _juror The address of the juror.\\n    function getJurorCourtIDs(address _juror) public view override returns (uint96[] memory) {\\n        return jurors[_juror].courtIDs;\\n    }\\n\\n    function isJurorStaked(address _juror) external view override returns (bool) {\\n        return jurors[_juror].stakedPnk > 0;\\n    }\\n\\n    // ************************************* //\\n    // *            Internal               * //\\n    // ************************************* //\\n\\n    /// @dev Gets the stake of a juror in a court.\\n    /// Warning: `O(n)` complexity where `n` is the number of courts the juror has staked in\\n    /// but acceptable for this educational implementation.\\n    /// @param _juror The address of the juror.\\n    /// @param _courtID The ID of the court.\\n    /// @return stakedInCourt The amount of tokens staked by the juror in the court.\\n    function _stakeOf(address _juror, uint96 _courtID) internal view returns (uint256 stakedInCourt) {\\n        Juror storage juror = jurors[_juror];\\n        for (uint256 i = 0; i < juror.courtIDs.length; i++) {\\n            if (juror.courtIDs[i] == _courtID) {\\n                stakedInCourt = juror.stakesByCourtID[_courtID];\\n                break;\\n            }\\n        }\\n    }\\n}\\n\",\"keccak256\":\"0x505563930b74c834195c7ae32792ee2b15e6478d404a9ff612133ad23080026b\",\"license\":\"MIT\"},\"src/libraries/Constants.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity 0.8.24;\\n\\nimport \\\"@openzeppelin/contracts/token/ERC20/IERC20.sol\\\";\\n\\n// Courts\\nuint96 constant FORKING_COURT = 0; // Index of the forking court.\\nuint96 constant GENERAL_COURT = 1; // Index of the default (general) court.\\n\\n// Dispute Kits\\nuint256 constant NULL_DISPUTE_KIT = 0; // Null pattern to indicate a top-level DK which has no parent.\\nuint256 constant DISPUTE_KIT_CLASSIC = 1; // Index of the default DK. 0 index is skipped.\\n\\n// Sortition Module\\nuint256 constant MAX_STAKE_PATHS = 4; // The maximum number of stake paths a juror can have.\\nuint256 constant DEFAULT_K = 6; // Default number of children per node.\\n\\n// Defaults\\nuint256 constant DEFAULT_NB_OF_JURORS = 3; // The default number of jurors in a dispute.\\nIERC20 constant NATIVE_CURRENCY = IERC20(address(0)); // The native currency, such as ETH on Arbitrum, Optimism and Ethereum L1.\\n\\nenum OnError {\\n    Revert,\\n    Return\\n}\\n\\nenum StakingResult {\\n    Successful,\\n    StakingTransferFailed,\\n    UnstakingTransferFailed,\\n    CannotStakeInMoreCourts,\\n    CannotStakeInThisCourt,\\n    CannotStakeLessThanMinStake,\\n    CannotStakeMoreThanMaxStakePerJuror,\\n    CannotStakeMoreThanMaxTotalStaked\\n}\\n\",\"keccak256\":\"0x486016fb74cc91439c2ec918e97a79190ab4eed223987d516986fff8eaeecfbf\",\"license\":\"MIT\"},\"src/libraries/SafeERC20.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n// Adapted from https://github.com/OpenZeppelin/openzeppelin-contracts/blob/a7a94c77463acea95d979aae1580fb0ddc3b6a1e/contracts/token/ERC20/utils/SafeERC20.sol\\n\\npragma solidity 0.8.24;\\n\\nimport \\\"@openzeppelin/contracts/token/ERC20/IERC20.sol\\\";\\n\\n/// @title SafeERC20\\n/// @dev Wrappers around ERC20 operations that throw on failure (when the token\\n/// contract returns false). Tokens that return no value (and instead revert or\\n/// throw on failure) are also supported, non-reverting calls are assumed to be\\n/// successful.\\n/// To use this library you can add a `using SafeERC20 for IERC20;` statement to your contract,\\n/// which allows you to call the safe operations as `token.safeTransfer(...)`, etc.\\nlibrary SafeERC20 {\\n    /// @dev Increases the allowance granted to `spender` by the caller.\\n    /// @param _token Token to transfer.\\n    /// @param _spender The address which will spend the funds.\\n    /// @param _addedValue The amount of tokens to increase the allowance by.\\n    function increaseAllowance(IERC20 _token, address _spender, uint256 _addedValue) internal returns (bool) {\\n        _token.approve(_spender, _token.allowance(address(this), _spender) + _addedValue);\\n        return true;\\n    }\\n\\n    /// @dev Calls transfer() without reverting.\\n    /// @param _token Token to transfer.\\n    /// @param _to Recepient address.\\n    /// @param _value Amount transferred.\\n    /// @return Whether transfer succeeded or not.\\n    function safeTransfer(IERC20 _token, address _to, uint256 _value) internal returns (bool) {\\n        (bool success, bytes memory data) = address(_token).call(abi.encodeCall(IERC20.transfer, (_to, _value)));\\n        return (success && (data.length == 0 || abi.decode(data, (bool))));\\n    }\\n\\n    /// @dev Calls transferFrom() without reverting.\\n    /// @param _token Token to transfer.\\n    /// @param _from Sender address.\\n    /// @param _to Recepient address.\\n    /// @param _value Amount transferred.\\n    /// @return Whether transfer succeeded or not.\\n    function safeTransferFrom(IERC20 _token, address _from, address _to, uint256 _value) internal returns (bool) {\\n        (bool success, bytes memory data) = address(_token).call(\\n            abi.encodeCall(IERC20.transferFrom, (_from, _to, _value))\\n        );\\n        return (success && (data.length == 0 || abi.decode(data, (bool))));\\n    }\\n}\\n\",\"keccak256\":\"0x3e39adb9cdd9f86b0defc8f6e1223533d86f82c804e186193f729c32c10161b1\",\"license\":\"MIT\"},\"src/proxy/Initializable.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v4.9.0) (proxy/utils/Initializable.sol) <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/utils/Initializable.sol>\\n\\npragma solidity 0.8.24;\\n\\n/**\\n * @dev This is a base contract to aid in writing upgradeable contracts, or any kind of contract that will be deployed\\n * behind a proxy. Since proxied contracts do not make use of a constructor, it's common to move constructor logic to an\\n * external initializer function, usually called `initialize`. It then becomes necessary to protect this initializer\\n * function so it can only be called once. The {initializer} modifier provided by this contract will have this effect.\\n *\\n * The initialization functions use a version number. Once a version number is used, it is consumed and cannot be\\n * reused. This mechanism prevents re-execution of each \\\"step\\\" but allows the creation of new initialization steps in\\n * case an upgrade adds a module that needs to be initialized.\\n *\\n * For example:\\n *\\n * ```solidity\\n * contract MyToken is ERC20Upgradeable {\\n *     function initialize() initializer public {\\n *         __ERC20_init(\\\"MyToken\\\", \\\"MTK\\\");\\n *     }\\n * }\\n *\\n * contract MyTokenV2 is MyToken, ERC20PermitUpgradeable {\\n *     function initializeV2() reinitializer(2) public {\\n *         __ERC20Permit_init(\\\"MyToken\\\");\\n *     }\\n * }\\n * ```\\n *\\n * TIP: To avoid leaving the proxy in an uninitialized state, the initializer function should be called as early as\\n * possible by providing the encoded function call as the `_data` argument to the proxy constructor\\n *\\n * CAUTION: When used with inheritance, manual care must be taken to not invoke a parent initializer twice, or to ensure\\n * that all initializers are idempotent. This is not verified automatically as constructors are by Solidity.\\n *\\n * [CAUTION]\\n * ====\\n * Avoid leaving a contract uninitialized.\\n *\\n * An uninitialized contract can be taken over by an attacker. This applies to both a proxy and its implementation\\n * contract, which may impact the proxy. To prevent the implementation contract from being used, you should invoke\\n * the {_disableInitializers} function in the constructor to automatically lock it when it is deployed:\\n *\\n * ```\\n * /// @custom:oz-upgrades-unsafe-allow constructor\\n * constructor() {\\n *     _disableInitializers();\\n * }\\n * ```\\n */\\nabstract contract Initializable {\\n    /**\\n     * @dev Storage of the initializable contract.\\n     *\\n     * It's implemented on a custom ERC-7201 namespace to reduce the risk of storage collisions\\n     * when using with upgradeable contracts.\\n     *\\n     * @custom:storage-location erc7201:openzeppelin.storage.Initializable\\n     */\\n    struct InitializableStorage {\\n        /**\\n         * @dev Indicates that the contract has been initialized.\\n         */\\n        uint64 _initialized;\\n        /**\\n         * @dev Indicates that the contract is in the process of being initialized.\\n         */\\n        bool _initializing;\\n    }\\n\\n    // keccak256(abi.encode(uint256(keccak256(\\\"openzeppelin.storage.Initializable\\\")) - 1))\\n    bytes32 private constant _INITIALIZABLE_STORAGE =\\n        0xf0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e;\\n\\n    /**\\n     * @dev The contract is already initialized.\\n     */\\n    error AlreadyInitialized();\\n\\n    /**\\n     * @dev The contract is not initializing.\\n     */\\n    error NotInitializing();\\n\\n    /**\\n     * @dev Triggered when the contract has been initialized or reinitialized.\\n     */\\n    event Initialized(uint64 version);\\n\\n    /**\\n     * @dev A modifier that defines a protected initializer function that can be invoked at most once. In its scope,\\n     * `onlyInitializing` functions can be used to initialize parent contracts.\\n     *\\n     * Similar to `reinitializer(1)`, except that functions marked with `initializer` can be nested in the context of a\\n     * constructor.\\n     *\\n     * Emits an {Initialized} event.\\n     */\\n    modifier initializer() {\\n        // solhint-disable-next-line var-name-mixedcase\\n        InitializableStorage storage $ = _getInitializableStorage();\\n\\n        bool isTopLevelCall = !$._initializing;\\n        uint64 initialized = $._initialized;\\n        if (!(isTopLevelCall && initialized < 1) && !(address(this).code.length == 0 && initialized == 1)) {\\n            revert AlreadyInitialized();\\n        }\\n        $._initialized = 1;\\n        if (isTopLevelCall) {\\n            $._initializing = true;\\n        }\\n        _;\\n        if (isTopLevelCall) {\\n            $._initializing = false;\\n            emit Initialized(1);\\n        }\\n    }\\n\\n    /**\\n     * @dev A modifier that defines a protected reinitializer function that can be invoked at most once, and only if the\\n     * contract hasn't been initialized to a greater version before. In its scope, `onlyInitializing` functions can be\\n     * used to initialize parent contracts.\\n     *\\n     * A reinitializer may be used after the original initialization step. This is essential to configure modules that\\n     * are added through upgrades and that require initialization.\\n     *\\n     * When `version` is 1, this modifier is similar to `initializer`, except that functions marked with `reinitializer`\\n     * cannot be nested. If one is invoked in the context of another, execution will revert.\\n     *\\n     * Note that versions can jump in increments greater than 1; this implies that if multiple reinitializers coexist in\\n     * a contract, executing them in the right order is up to the developer or operator.\\n     *\\n     * WARNING: setting the version to 255 will prevent any future reinitialization.\\n     *\\n     * Emits an {Initialized} event.\\n     */\\n    modifier reinitializer(uint64 version) {\\n        // solhint-disable-next-line var-name-mixedcase\\n        InitializableStorage storage $ = _getInitializableStorage();\\n\\n        if ($._initializing || $._initialized >= version) {\\n            revert AlreadyInitialized();\\n        }\\n        $._initialized = version;\\n        $._initializing = true;\\n        _;\\n        $._initializing = false;\\n        emit Initialized(version);\\n    }\\n\\n    /**\\n     * @dev Modifier to protect an initialization function so that it can only be invoked by functions with the\\n     * {initializer} and {reinitializer} modifiers, directly or indirectly.\\n     */\\n    modifier onlyInitializing() {\\n        _checkInitializing();\\n        _;\\n    }\\n\\n    /**\\n     * @dev Reverts if the contract is not in an initializing state. See {onlyInitializing}.\\n     */\\n    function _checkInitializing() internal view virtual {\\n        if (!_isInitializing()) {\\n            revert NotInitializing();\\n        }\\n    }\\n\\n    /**\\n     * @dev Locks the contract, preventing any future reinitialization. This cannot be part of an initializer call.\\n     * Calling this in the constructor of a contract will prevent that contract from being initialized or reinitialized\\n     * to any version. It is recommended to use this to lock implementation contracts that are designed to be called\\n     * through proxies.\\n     *\\n     * Emits an {Initialized} event the first time it is successfully executed.\\n     */\\n    function _disableInitializers() internal virtual {\\n        // solhint-disable-next-line var-name-mixedcase\\n        InitializableStorage storage $ = _getInitializableStorage();\\n\\n        if ($._initializing) {\\n            revert AlreadyInitialized();\\n        }\\n        if ($._initialized != type(uint64).max) {\\n            $._initialized = type(uint64).max;\\n            emit Initialized(type(uint64).max);\\n        }\\n    }\\n\\n    /**\\n     * @dev Returns the highest version that has been initialized. See {reinitializer}.\\n     */\\n    function _getInitializedVersion() internal view returns (uint64) {\\n        return _getInitializableStorage()._initialized;\\n    }\\n\\n    /**\\n     * @dev Returns `true` if the contract is currently initializing. See {onlyInitializing}.\\n     */\\n    function _isInitializing() internal view returns (bool) {\\n        return _getInitializableStorage()._initializing;\\n    }\\n\\n    /**\\n     * @dev Returns a pointer to the storage namespace.\\n     */\\n    // solhint-disable-next-line var-name-mixedcase\\n    function _getInitializableStorage() private pure returns (InitializableStorage storage $) {\\n        assembly {\\n            $.slot := _INITIALIZABLE_STORAGE\\n        }\\n    }\\n}\\n\",\"keccak256\":\"0x560ea64115636ecd6b3596248817125551c038ce1648019fde3cbe02d9759a30\",\"license\":\"MIT\"},\"src/proxy/UUPSProxiable.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n// Adapted from <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/utils/UUPSUpgradeable.sol>\\n\\n/**\\n *  @authors: [@malatrax]\\n *  @reviewers: []\\n *  @auditors: []\\n *  @bounties: []\\n *  @deployments: []\\n */\\npragma solidity 0.8.24;\\n\\n/**\\n * @title UUPS Proxiable\\n * @author Simon Malatrait <simon.malatrait@grenoble-inp.org>\\n * @dev This contract implements an upgradeability mechanism designed for UUPS proxies.\\n * The functions included here can perform an upgrade of an UUPS Proxy, when this contract is set as the implementation behind such a proxy.\\n *\\n * IMPORTANT: A UUPS proxy requires its upgradeability functions to be in the implementation as opposed to the transparent proxy.\\n * This means that if the proxy is upgraded to an implementation that does not support this interface, it will no longer be upgradeable.\\n *\\n * A security mechanism ensures that an upgrade does not turn off upgradeability accidentally, although this risk is\\n * reinstated if the upgrade retains upgradeability but removes the security mechanism, e.g. by replacing\\n * `UUPSProxiable` with a custom implementation of upgrades.\\n *\\n * The `_authorizeUpgrade` function must be overridden to include access restriction to the upgrade mechanism.\\n */\\nabstract contract UUPSProxiable {\\n    // ************************************* //\\n    // *             Event                 * //\\n    // ************************************* //\\n\\n    /**\\n     * Emitted when the `implementation` has been successfully upgraded.\\n     * @param newImplementation Address of the new implementation the proxy is now forwarding calls to.\\n     */\\n    event Upgraded(address indexed newImplementation);\\n\\n    // ************************************* //\\n    // *             Error                 * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev The call is from an unauthorized context.\\n     */\\n    error UUPSUnauthorizedCallContext();\\n\\n    /**\\n     * @dev The storage `slot` is unsupported as a UUID.\\n     */\\n    error UUPSUnsupportedProxiableUUID(bytes32 slot);\\n\\n    /// The `implementation` is not UUPS-compliant\\n    error InvalidImplementation(address implementation);\\n\\n    /// Failed Delegated call\\n    error FailedDelegateCall();\\n\\n    // ************************************* //\\n    // *             Storage               * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Storage slot with the address of the current implementation.\\n     * This is the keccak-256 hash of \\\"eip1967.proxy.implementation\\\" subtracted by 1, and is\\n     * validated in the constructor.\\n     * NOTE: bytes32(uint256(keccak256('eip1967.proxy.implementation')) - 1)\\n     */\\n    bytes32 private constant IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;\\n\\n    /**\\n     * @dev Storage variable of the proxiable contract address.\\n     * It is used to check whether or not the current call is from the proxy.\\n     */\\n    address private immutable __self = address(this);\\n\\n    // ************************************* //\\n    // *             Governance            * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Function that should revert when `msg.sender` is not authorized to upgrade the contract.\\n     * @dev Called by {upgradeToAndCall}.\\n     */\\n    function _authorizeUpgrade(address newImplementation) internal virtual;\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Upgrade mechanism including access control and UUPS-compliance.\\n     * @param newImplementation Address of the new implementation contract.\\n     * @param data Data used in a delegate call to `newImplementation` if non-empty. This will typically be an encoded\\n     * function call, and allows initializing the storage of the proxy like a Solidity constructor.\\n     *\\n     * @dev Reverts if the execution is not performed via delegatecall or the execution\\n     * context is not of a proxy with an ERC1967-compliant implementation pointing to self.\\n     */\\n    function upgradeToAndCall(address newImplementation, bytes memory data) public payable virtual {\\n        _authorizeUpgrade(newImplementation);\\n\\n        /* Check that the execution is being performed through a delegatecall call and that the execution context is\\n        a proxy contract with an implementation (as defined in ERC1967) pointing to self. */\\n        if (address(this) == __self || _getImplementation() != __self) {\\n            revert UUPSUnauthorizedCallContext();\\n        }\\n\\n        try UUPSProxiable(newImplementation).proxiableUUID() returns (bytes32 slot) {\\n            if (slot != IMPLEMENTATION_SLOT) {\\n                revert UUPSUnsupportedProxiableUUID(slot);\\n            }\\n            // Store the new implementation address to the implementation storage slot.\\n            assembly {\\n                sstore(IMPLEMENTATION_SLOT, newImplementation)\\n            }\\n            emit Upgraded(newImplementation);\\n\\n            if (data.length != 0) {\\n                // The return data is not checked (checking, in case of success, that the newImplementation code is non-empty if the return data is empty) because the authorized callee is trusted.\\n                (bool success, ) = newImplementation.delegatecall(data);\\n                if (!success) {\\n                    revert FailedDelegateCall();\\n                }\\n            }\\n        } catch {\\n            revert InvalidImplementation(newImplementation);\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Implementation of the ERC1822 `proxiableUUID` function. This returns the storage slot used by the\\n     * implementation. It is used to validate the implementation's compatibility when performing an upgrade.\\n     *\\n     * IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks\\n     * bricking a proxy that upgrades to it, by delegating to itself until out of gas. Thus it is critical that this\\n     * function revert if invoked through a proxy. This is guaranteed by the if statement.\\n     */\\n    function proxiableUUID() external view virtual returns (bytes32) {\\n        if (address(this) != __self) {\\n            // Must not be called through delegatecall\\n            revert UUPSUnauthorizedCallContext();\\n        }\\n        return IMPLEMENTATION_SLOT;\\n    }\\n\\n    // ************************************* //\\n    // *           Internal Views          * //\\n    // ************************************* //\\n\\n    function _getImplementation() internal view returns (address implementation) {\\n        assembly {\\n            implementation := sload(IMPLEMENTATION_SLOT)\\n        }\\n    }\\n}\\n\",\"keccak256\":\"0x5956855046cdda7aa45f44e379ef45323af7266c44c817d1266d8b32d52b0e22\",\"license\":\"MIT\"}},\"version\":1}",
-  "bytecode": "0x60a06040523060805234801561001457600080fd5b5061001d610022565b6100d3565b7ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e805468010000000000000000900460ff16156100715760405162dc149f60e41b815260040160405180910390fd5b80546001600160401b03908116146100d05780546001600160401b0319166001600160401b0390811782556040519081527fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d29060200160405180910390a15b50565b60805161183f6100fc60003960008181610637015281816106600152610858015261183f6000f3fe60806040526004361061012a5760003560e01c80635d2d7846116100ab578063d09f392d1161006f578063d09f392d1461036c578063d1c1df481461038c578063dca5f6b0146103cc578063f1a5310414610418578063f216de4c14610438578063f2f4eb261461045857600080fd5b80635d2d7846146102925780636624192f146102b2578063965af6c7146102fd578063a5861b901461031d578063b5d69e991461034c57600080fd5b8063485cc955116100f2578063485cc955146101ef5780634c70a0d61461020f5780634f1ef2861461023d57806352d1902d14610250578063543f8a361461026557600080fd5b8063034327441461012f5780630c340a241461015857806321e1625e1461019057806321ea9b3f146101b2578063477a655c146101d0575b600080fd5b34801561013b57600080fd5b5061014560025481565b6040519081526020015b60405180910390f35b34801561016457600080fd5b50600054610178906001600160a01b031681565b6040516001600160a01b03909116815260200161014f565b34801561019c57600080fd5b506101b06101ab36600461130b565b610478565b005b3480156101be57600080fd5b506101b06101cd366004611337565b50565b3480156101dc57600080fd5b506101b06101eb3660046113f3565b5050565b3480156101fb57600080fd5b506101b061020a36600461143a565b610524565b34801561021b57600080fd5b5061017861022a366004611473565b50506004546001600160a01b0316919050565b6101b061024b36600461149f565b610623565b34801561025c57600080fd5b5061014561084b565b34801561027157600080fd5b506102856102803660046114d9565b6108a9565b60405161014f91906114fd565b34801561029e57600080fd5b506101b06102ad36600461154a565b61094a565b3480156102be57600080fd5b506102ed6102cd3660046114d9565b6001600160a01b0316600090815260036020526040902060020154151590565b604051901515815260200161014f565b34801561030957600080fd5b506101b061031836600461130b565b61098d565b34801561032957600080fd5b5061033d61033836600461158f565b610a28565b60405161014f939291906115e2565b34801561035857600080fd5b506101b06103673660046114d9565b610c4f565b34801561037857600080fd5b506101b061038736600461154a565b610d55565b34801561039857600080fd5b506103ac6103a736600461161c565b610d8f565b60408051948552602085019390935291830152606082015260800161014f565b3480156103d857600080fd5b506104036103e73660046114d9565b6003602081905260009182526040909120600281015491015482565b6040805192835260208301919091520161014f565b34801561042457600080fd5b506101b06104333660046114d9565b610e45565b34801561044457600080fd5b506101b061045336600461130b565b610e91565b34801561046457600080fd5b50600154610178906001600160a01b031681565b6001546001600160a01b031633146104ab5760405162461bcd60e51b81526004016104a29061164a565b60405180910390fd5b6001600160a01b038216600090815260036020819052604082200180548392906104d69084906116a4565b909155505060408051828152600060208201526001600160a01b038416917f7a81a4ef419d50dbb5deb116fb983bf6ca7716bcbc84cd1cd2be81ccea9078b091015b60405180910390a25050565b7ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e805460019190600160401b900460ff168061056e5750805467ffffffffffffffff808416911610155b1561058b5760405162dc149f60e41b815260040160405180910390fd5b805468ffffffffffffffffff191667ffffffffffffffff8316908117600160401b178255600080546001600160a01b038781166001600160a01b0319928316179092556001805492871692909116919091179055815460ff60401b191682556040519081527fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d29060200160405180910390a150505050565b61062c82610f09565b306001600160a01b037f00000000000000000000000000000000000000000000000000000000000000001614806106aa57507f00000000000000000000000000000000000000000000000000000000000000006001600160a01b031661069e6000805160206117ea8339815191525490565b6001600160a01b031614155b156106c85760405163703e46dd60e11b815260040160405180910390fd5b816001600160a01b03166352d1902d6040518163ffffffff1660e01b8152600401602060405180830381865afa925050508015610722575060408051601f3d908101601f1916820190925261071f918101906116bd565b60015b61074a57604051630c76093760e01b81526001600160a01b03831660048201526024016104a2565b6000805160206117ea833981519152811461077b57604051632a87526960e21b8152600481018290526024016104a2565b6000805160206117ea8339815191528390556040516001600160a01b038416907fbc7cd75a20ee27fd9adebab32041f755214dbc6bffa90cc0225b39da2e5c2d3b90600090a2815115610846576000836001600160a01b0316836040516107e291906116d6565b600060405180830381855af49150503d806000811461081d576040519150601f19603f3d011682016040523d82523d6000602084013e610822565b606091505b5050905080610844576040516339b21b5d60e11b815260040160405180910390fd5b505b505050565b6000306001600160a01b037f000000000000000000000000000000000000000000000000000000000000000016146108965760405163703e46dd60e11b815260040160405180910390fd5b506000805160206117ea83398151915290565b6001600160a01b03811660009081526003602090815260409182902060010180548351818402810184019094528084526060939283018282801561093e57602002820191906000526020600020906000905b82829054906101000a90046001600160601b03166001600160601b0316815260200190600c0190602082600b010492830192600103820291508084116108fb5790505b50505050509050919050565b6001546001600160a01b031633146109745760405162461bcd60e51b81526004016104a29061164a565b6002805490600061098483611705565b91905055505050565b6001546001600160a01b031633146109b75760405162461bcd60e51b81526004016104a29061164a565b6001600160a01b038216600090815260036020819052604082200180548392906109e290849061171c565b909155505060408051828152600160208201526001600160a01b038416917f7a81a4ef419d50dbb5deb116fb983bf6ca7716bcbc84cd1cd2be81ccea9078b09101610518565b600154600090819081906001600160a01b03163314610a595760405162461bcd60e51b81526004016104a29061164a565b6001600160a01b038716600090815260036020526040812090610a7c8989610f6e565b600183015490915087158015610a9b5750600481101580610a9b575081155b15610ab3576000806003955095509550505050610c45565b818810610ad35786610ace57610acb838a8a8561100f565b95505b610aec565b610adf838a8a856110f3565b610ae990866116a4565b94505b6000895b81610bee576001600160601b038116600090815260208690526040812080548c9290610b1d9084906116a4565b90915550506001600160601b03811660009081526020869052604081208054869290610b4a90849061171c565b90915550506000196001600160601b03821601610b6a5760019150610af0565b600154604051630fad06e960e11b81526001600160601b03831660048201526001600160a01b0390911690631f5a0dd29060240160e060405180830381865afa158015610bbb573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190610bdf919061172f565b50949550610af0945050505050565b604080516001600160601b038d168152602081018c90526001600160a01b038e16917f4732545d01e38980276a17e6d394f01577ba63f2fea5eba41af0757d9c060c5c910160405180910390a25060009450505050505b9450945094915050565b6001546001600160a01b03163314610c795760405162461bcd60e51b81526004016104a29061164a565b6000610c84826108a9565b80519091505b801561084657600180546001600160a01b03169063fbb519e79085908590610cb2908661171c565b81518110610cc257610cc26117a4565b60209081029190910101516040516001600160e01b031960e085901b1681526001600160a01b0390921660048301526001600160601b031660248201526000604482018190526064820152608401600060405180830381600087803b158015610d2a57600080fd5b505af1158015610d3e573d6000803e3d6000fd5b505050508080610d4d90611705565b915050610c8a565b6001546001600160a01b03163314610d7f5760405162461bcd60e51b81526004016104a29061164a565b60028054906000610984836117ba565b6001600160a01b038216600090815260036020819052604082206002810154918101546001820154929390929091825b82811015610e3a57866001600160601b0316826001018281548110610de657610de66117a4565b600091825260209091206002820401546001909116600c026101000a90046001600160601b031603610e32576001600160601b0387166000908152602083905260409020549350610e3a565b600101610dbf565b505092959194509250565b6001546001600160a01b03163314610e6f5760405162461bcd60e51b81526004016104a29061164a565b600480546001600160a01b0319166001600160a01b0392909216919091179055565b6001546001600160a01b03163314610ebb5760405162461bcd60e51b81526004016104a29061164a565b6001600160a01b038216600090815260036020526040902060028101548211610efd5781816002016000828254610ef2919061171c565b909155506108469050565b60006002820155505050565b6000546001600160a01b031633146101cd5760405162461bcd60e51b815260206004820152602260248201527f416363657373206e6f7420616c6c6f7765643a20476f7665726e6f72206f6e6c6044820152613c9760f11b60648201526084016104a2565b6001600160a01b0382166000908152600360205260408120815b600182015481101561100757836001600160601b0316826001018281548110610fb357610fb36117a4565b600091825260209091206002820401546001909116600c026101000a90046001600160601b031603610fff576001600160601b0384166000908152602083905260409020549250611007565b600101610f88565b505092915050565b60008085600201548660030154101561102957600061103d565b8560020154866003015461103d919061171c565b905061104981846116a4565b84101561105757600061106c565b80611062848661171c565b61106c919061171c565b9150826000036110b557600186810180548083018255600091825260209091206002820401805491909216600c026101000a6001600160601b0381810219909216918816021790555b82866002015410156110c757836110e2565b838387600201546110d8919061171c565b6110e291906116a4565b866002018190555050949350505050565b6003840154600090611105848461171c565b61110f91906116a4565b85600201541061112a57611123838361171c565b9050611150565b8460030154856002015410611150578460030154856002015461114d919061171c565b90505b826000036112b95760018501545b80156112b757846001600160601b03168660010160018361117f919061171c565b8154811061118f5761118f6117a4565b600091825260209091206002820401546001909116600c026101000a90046001600160601b0316036112a5576001808701805490916111cd9161171c565b815481106111dd576111dd6117a4565b600091825260209091206002820401546001918216600c026101000a90046001600160601b03169087810190611213908461171c565b81548110611223576112236117a4565b9060005260206000209060029182820401919006600c026101000a8154816001600160601b0302191690836001600160601b031602179055508560010180548061126f5761126f6117d3565b60008281526020902060026000199092019182040180546001600160601b03600c60018516026101000a021916905590556112b7565b806112af81611705565b91505061115e565b505b81856002015410156112cb57826112e6565b828286600201546112dc919061171c565b6112e691906116a4565b8560020181905550949350505050565b6001600160a01b03811681146101cd57600080fd5b6000806040838503121561131e57600080fd5b8235611329816112f6565b946020939093013593505050565b60006020828403121561134957600080fd5b5035919050565b634e487b7160e01b600052604160045260246000fd5b600082601f83011261137757600080fd5b813567ffffffffffffffff8082111561139257611392611350565b604051601f8301601f19908116603f011681019082821181831017156113ba576113ba611350565b816040528381528660208588010111156113d357600080fd5b836020870160208301376000602085830101528094505050505092915050565b6000806040838503121561140657600080fd5b82359150602083013567ffffffffffffffff81111561142457600080fd5b61143085828601611366565b9150509250929050565b6000806040838503121561144d57600080fd5b8235611458816112f6565b91506020830135611468816112f6565b809150509250929050565b60008060006060848603121561148857600080fd5b505081359360208301359350604090920135919050565b600080604083850312156114b257600080fd5b82356114bd816112f6565b9150602083013567ffffffffffffffff81111561142457600080fd5b6000602082840312156114eb57600080fd5b81356114f6816112f6565b9392505050565b6020808252825182820181905260009190848201906040850190845b8181101561153e5783516001600160601b031683529284019291840191600101611519565b50909695505050505050565b6000806040838503121561155d57600080fd5b50508035926020909101359150565b6001600160601b03811681146101cd57600080fd5b80151581146101cd57600080fd5b600080600080608085870312156115a557600080fd5b84356115b0816112f6565b935060208501356115c08161156c565b92506040850135915060608501356115d781611581565b939692955090935050565b83815260208101839052606081016008831061160e57634e487b7160e01b600052602160045260246000fd5b826040830152949350505050565b6000806040838503121561162f57600080fd5b823561163a816112f6565b915060208301356114688161156c565b60208082526024908201527f416363657373206e6f7420616c6c6f7765643a204b6c65726f73436f7265206f60408201526337363c9760e11b606082015260800190565b634e487b7160e01b600052601160045260246000fd5b808201808211156116b7576116b761168e565b92915050565b6000602082840312156116cf57600080fd5b5051919050565b6000825160005b818110156116f757602081860181015185830152016116dd565b506000920191825250919050565b6000816117145761171461168e565b506000190190565b818103818111156116b7576116b761168e565b600080600080600080600060e0888a03121561174a57600080fd5b87516117558161156c565b602089015190975061176681611581565b8096505060408801519450606088015193506080880151925060a0880151915060c088015161179481611581565b8091505092959891949750929550565b634e487b7160e01b600052603260045260246000fd5b6000600182016117cc576117cc61168e565b5060010190565b634e487b7160e01b600052603160045260246000fdfe360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbca26469706673582212200166151e57cedd4332854be3f1b542627de717718d9832e670b79904c4b162d864736f6c63430008180033",
-  "deployedBytecode": "0x60806040526004361061012a5760003560e01c80635d2d7846116100ab578063d09f392d1161006f578063d09f392d1461036c578063d1c1df481461038c578063dca5f6b0146103cc578063f1a5310414610418578063f216de4c14610438578063f2f4eb261461045857600080fd5b80635d2d7846146102925780636624192f146102b2578063965af6c7146102fd578063a5861b901461031d578063b5d69e991461034c57600080fd5b8063485cc955116100f2578063485cc955146101ef5780634c70a0d61461020f5780634f1ef2861461023d57806352d1902d14610250578063543f8a361461026557600080fd5b8063034327441461012f5780630c340a241461015857806321e1625e1461019057806321ea9b3f146101b2578063477a655c146101d0575b600080fd5b34801561013b57600080fd5b5061014560025481565b6040519081526020015b60405180910390f35b34801561016457600080fd5b50600054610178906001600160a01b031681565b6040516001600160a01b03909116815260200161014f565b34801561019c57600080fd5b506101b06101ab36600461130b565b610478565b005b3480156101be57600080fd5b506101b06101cd366004611337565b50565b3480156101dc57600080fd5b506101b06101eb3660046113f3565b5050565b3480156101fb57600080fd5b506101b061020a36600461143a565b610524565b34801561021b57600080fd5b5061017861022a366004611473565b50506004546001600160a01b0316919050565b6101b061024b36600461149f565b610623565b34801561025c57600080fd5b5061014561084b565b34801561027157600080fd5b506102856102803660046114d9565b6108a9565b60405161014f91906114fd565b34801561029e57600080fd5b506101b06102ad36600461154a565b61094a565b3480156102be57600080fd5b506102ed6102cd3660046114d9565b6001600160a01b0316600090815260036020526040902060020154151590565b604051901515815260200161014f565b34801561030957600080fd5b506101b061031836600461130b565b61098d565b34801561032957600080fd5b5061033d61033836600461158f565b610a28565b60405161014f939291906115e2565b34801561035857600080fd5b506101b06103673660046114d9565b610c4f565b34801561037857600080fd5b506101b061038736600461154a565b610d55565b34801561039857600080fd5b506103ac6103a736600461161c565b610d8f565b60408051948552602085019390935291830152606082015260800161014f565b3480156103d857600080fd5b506104036103e73660046114d9565b6003602081905260009182526040909120600281015491015482565b6040805192835260208301919091520161014f565b34801561042457600080fd5b506101b06104333660046114d9565b610e45565b34801561044457600080fd5b506101b061045336600461130b565b610e91565b34801561046457600080fd5b50600154610178906001600160a01b031681565b6001546001600160a01b031633146104ab5760405162461bcd60e51b81526004016104a29061164a565b60405180910390fd5b6001600160a01b038216600090815260036020819052604082200180548392906104d69084906116a4565b909155505060408051828152600060208201526001600160a01b038416917f7a81a4ef419d50dbb5deb116fb983bf6ca7716bcbc84cd1cd2be81ccea9078b091015b60405180910390a25050565b7ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e805460019190600160401b900460ff168061056e5750805467ffffffffffffffff808416911610155b1561058b5760405162dc149f60e41b815260040160405180910390fd5b805468ffffffffffffffffff191667ffffffffffffffff8316908117600160401b178255600080546001600160a01b038781166001600160a01b0319928316179092556001805492871692909116919091179055815460ff60401b191682556040519081527fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d29060200160405180910390a150505050565b61062c82610f09565b306001600160a01b037f00000000000000000000000000000000000000000000000000000000000000001614806106aa57507f00000000000000000000000000000000000000000000000000000000000000006001600160a01b031661069e6000805160206117ea8339815191525490565b6001600160a01b031614155b156106c85760405163703e46dd60e11b815260040160405180910390fd5b816001600160a01b03166352d1902d6040518163ffffffff1660e01b8152600401602060405180830381865afa925050508015610722575060408051601f3d908101601f1916820190925261071f918101906116bd565b60015b61074a57604051630c76093760e01b81526001600160a01b03831660048201526024016104a2565b6000805160206117ea833981519152811461077b57604051632a87526960e21b8152600481018290526024016104a2565b6000805160206117ea8339815191528390556040516001600160a01b038416907fbc7cd75a20ee27fd9adebab32041f755214dbc6bffa90cc0225b39da2e5c2d3b90600090a2815115610846576000836001600160a01b0316836040516107e291906116d6565b600060405180830381855af49150503d806000811461081d576040519150601f19603f3d011682016040523d82523d6000602084013e610822565b606091505b5050905080610844576040516339b21b5d60e11b815260040160405180910390fd5b505b505050565b6000306001600160a01b037f000000000000000000000000000000000000000000000000000000000000000016146108965760405163703e46dd60e11b815260040160405180910390fd5b506000805160206117ea83398151915290565b6001600160a01b03811660009081526003602090815260409182902060010180548351818402810184019094528084526060939283018282801561093e57602002820191906000526020600020906000905b82829054906101000a90046001600160601b03166001600160601b0316815260200190600c0190602082600b010492830192600103820291508084116108fb5790505b50505050509050919050565b6001546001600160a01b031633146109745760405162461bcd60e51b81526004016104a29061164a565b6002805490600061098483611705565b91905055505050565b6001546001600160a01b031633146109b75760405162461bcd60e51b81526004016104a29061164a565b6001600160a01b038216600090815260036020819052604082200180548392906109e290849061171c565b909155505060408051828152600160208201526001600160a01b038416917f7a81a4ef419d50dbb5deb116fb983bf6ca7716bcbc84cd1cd2be81ccea9078b09101610518565b600154600090819081906001600160a01b03163314610a595760405162461bcd60e51b81526004016104a29061164a565b6001600160a01b038716600090815260036020526040812090610a7c8989610f6e565b600183015490915087158015610a9b5750600481101580610a9b575081155b15610ab3576000806003955095509550505050610c45565b818810610ad35786610ace57610acb838a8a8561100f565b95505b610aec565b610adf838a8a856110f3565b610ae990866116a4565b94505b6000895b81610bee576001600160601b038116600090815260208690526040812080548c9290610b1d9084906116a4565b90915550506001600160601b03811660009081526020869052604081208054869290610b4a90849061171c565b90915550506000196001600160601b03821601610b6a5760019150610af0565b600154604051630fad06e960e11b81526001600160601b03831660048201526001600160a01b0390911690631f5a0dd29060240160e060405180830381865afa158015610bbb573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190610bdf919061172f565b50949550610af0945050505050565b604080516001600160601b038d168152602081018c90526001600160a01b038e16917f4732545d01e38980276a17e6d394f01577ba63f2fea5eba41af0757d9c060c5c910160405180910390a25060009450505050505b9450945094915050565b6001546001600160a01b03163314610c795760405162461bcd60e51b81526004016104a29061164a565b6000610c84826108a9565b80519091505b801561084657600180546001600160a01b03169063fbb519e79085908590610cb2908661171c565b81518110610cc257610cc26117a4565b60209081029190910101516040516001600160e01b031960e085901b1681526001600160a01b0390921660048301526001600160601b031660248201526000604482018190526064820152608401600060405180830381600087803b158015610d2a57600080fd5b505af1158015610d3e573d6000803e3d6000fd5b505050508080610d4d90611705565b915050610c8a565b6001546001600160a01b03163314610d7f5760405162461bcd60e51b81526004016104a29061164a565b60028054906000610984836117ba565b6001600160a01b038216600090815260036020819052604082206002810154918101546001820154929390929091825b82811015610e3a57866001600160601b0316826001018281548110610de657610de66117a4565b600091825260209091206002820401546001909116600c026101000a90046001600160601b031603610e32576001600160601b0387166000908152602083905260409020549350610e3a565b600101610dbf565b505092959194509250565b6001546001600160a01b03163314610e6f5760405162461bcd60e51b81526004016104a29061164a565b600480546001600160a01b0319166001600160a01b0392909216919091179055565b6001546001600160a01b03163314610ebb5760405162461bcd60e51b81526004016104a29061164a565b6001600160a01b038216600090815260036020526040902060028101548211610efd5781816002016000828254610ef2919061171c565b909155506108469050565b60006002820155505050565b6000546001600160a01b031633146101cd5760405162461bcd60e51b815260206004820152602260248201527f416363657373206e6f7420616c6c6f7765643a20476f7665726e6f72206f6e6c6044820152613c9760f11b60648201526084016104a2565b6001600160a01b0382166000908152600360205260408120815b600182015481101561100757836001600160601b0316826001018281548110610fb357610fb36117a4565b600091825260209091206002820401546001909116600c026101000a90046001600160601b031603610fff576001600160601b0384166000908152602083905260409020549250611007565b600101610f88565b505092915050565b60008085600201548660030154101561102957600061103d565b8560020154866003015461103d919061171c565b905061104981846116a4565b84101561105757600061106c565b80611062848661171c565b61106c919061171c565b9150826000036110b557600186810180548083018255600091825260209091206002820401805491909216600c026101000a6001600160601b0381810219909216918816021790555b82866002015410156110c757836110e2565b838387600201546110d8919061171c565b6110e291906116a4565b866002018190555050949350505050565b6003840154600090611105848461171c565b61110f91906116a4565b85600201541061112a57611123838361171c565b9050611150565b8460030154856002015410611150578460030154856002015461114d919061171c565b90505b826000036112b95760018501545b80156112b757846001600160601b03168660010160018361117f919061171c565b8154811061118f5761118f6117a4565b600091825260209091206002820401546001909116600c026101000a90046001600160601b0316036112a5576001808701805490916111cd9161171c565b815481106111dd576111dd6117a4565b600091825260209091206002820401546001918216600c026101000a90046001600160601b03169087810190611213908461171c565b81548110611223576112236117a4565b9060005260206000209060029182820401919006600c026101000a8154816001600160601b0302191690836001600160601b031602179055508560010180548061126f5761126f6117d3565b60008281526020902060026000199092019182040180546001600160601b03600c60018516026101000a021916905590556112b7565b806112af81611705565b91505061115e565b505b81856002015410156112cb57826112e6565b828286600201546112dc919061171c565b6112e691906116a4565b8560020181905550949350505050565b6001600160a01b03811681146101cd57600080fd5b6000806040838503121561131e57600080fd5b8235611329816112f6565b946020939093013593505050565b60006020828403121561134957600080fd5b5035919050565b634e487b7160e01b600052604160045260246000fd5b600082601f83011261137757600080fd5b813567ffffffffffffffff8082111561139257611392611350565b604051601f8301601f19908116603f011681019082821181831017156113ba576113ba611350565b816040528381528660208588010111156113d357600080fd5b836020870160208301376000602085830101528094505050505092915050565b6000806040838503121561140657600080fd5b82359150602083013567ffffffffffffffff81111561142457600080fd5b61143085828601611366565b9150509250929050565b6000806040838503121561144d57600080fd5b8235611458816112f6565b91506020830135611468816112f6565b809150509250929050565b60008060006060848603121561148857600080fd5b505081359360208301359350604090920135919050565b600080604083850312156114b257600080fd5b82356114bd816112f6565b9150602083013567ffffffffffffffff81111561142457600080fd5b6000602082840312156114eb57600080fd5b81356114f6816112f6565b9392505050565b6020808252825182820181905260009190848201906040850190845b8181101561153e5783516001600160601b031683529284019291840191600101611519565b50909695505050505050565b6000806040838503121561155d57600080fd5b50508035926020909101359150565b6001600160601b03811681146101cd57600080fd5b80151581146101cd57600080fd5b600080600080608085870312156115a557600080fd5b84356115b0816112f6565b935060208501356115c08161156c565b92506040850135915060608501356115d781611581565b939692955090935050565b83815260208101839052606081016008831061160e57634e487b7160e01b600052602160045260246000fd5b826040830152949350505050565b6000806040838503121561162f57600080fd5b823561163a816112f6565b915060208301356114688161156c565b60208082526024908201527f416363657373206e6f7420616c6c6f7765643a204b6c65726f73436f7265206f60408201526337363c9760e11b606082015260800190565b634e487b7160e01b600052601160045260246000fd5b808201808211156116b7576116b761168e565b92915050565b6000602082840312156116cf57600080fd5b5051919050565b6000825160005b818110156116f757602081860181015185830152016116dd565b506000920191825250919050565b6000816117145761171461168e565b506000190190565b818103818111156116b7576116b761168e565b600080600080600080600060e0888a03121561174a57600080fd5b87516117558161156c565b602089015190975061176681611581565b8096505060408801519450606088015193506080880151925060a0880151915060c088015161179481611581565b8091505092959891949750929550565b634e487b7160e01b600052603260045260246000fd5b6000600182016117cc576117cc61168e565b5060010190565b634e487b7160e01b600052603160045260246000fdfe360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbca26469706673582212200166151e57cedd4332854be3f1b542627de717718d9832e670b79904c4b162d864736f6c63430008180033",
+  "solcInputHash": "d547d738900bce1310e91a5d1adfc179",
+  "metadata": "{\"compiler\":{\"version\":\"0.8.30+commit.73712a01\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"inputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"constructor\"},{\"inputs\":[],\"name\":\"AlreadyInitialized\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"FailedDelegateCall\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"implementation\",\"type\":\"address\"}],\"name\":\"InvalidImplementation\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"KlerosCoreOnly\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"NotEligibleForWithdrawal\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"NotInitializing\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"OwnerOnly\",\"type\":\"error\"},{\"inputs\":[],\"name\":\"UUPSUnauthorizedCallContext\",\"type\":\"error\"},{\"inputs\":[{\"internalType\":\"bytes32\",\"name\":\"slot\",\"type\":\"bytes32\"}],\"name\":\"UUPSUnsupportedProxiableUUID\",\"type\":\"error\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":false,\"internalType\":\"uint64\",\"name\":\"version\",\"type\":\"uint64\"}],\"name\":\"Initialized\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"_account\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_amount\",\"type\":\"uint256\"}],\"name\":\"LeftoverPNK\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"_account\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_amount\",\"type\":\"uint256\"}],\"name\":\"LeftoverPNKWithdrawn\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":false,\"internalType\":\"enum ISortitionModule.Phase\",\"name\":\"_phase\",\"type\":\"uint8\"}],\"name\":\"NewPhase\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"_address\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_relativeAmount\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"bool\",\"name\":\"_unlock\",\"type\":\"bool\"}],\"name\":\"StakeLocked\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"_address\",\"type\":\"address\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_courtID\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_amount\",\"type\":\"uint256\"},{\"indexed\":false,\"internalType\":\"uint256\",\"name\":\"_amountAllCourts\",\"type\":\"uint256\"}],\"name\":\"StakeSet\",\"type\":\"event\"},{\"anonymous\":false,\"inputs\":[{\"indexed\":true,\"internalType\":\"address\",\"name\":\"newImplementation\",\"type\":\"address\"}],\"name\":\"Upgraded\",\"type\":\"event\"},{\"inputs\":[],\"name\":\"core\",\"outputs\":[{\"internalType\":\"contract KlerosCoreUniversity\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"name\":\"createDisputeHook\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint96\",\"name\":\"_courtID\",\"type\":\"uint96\"},{\"internalType\":\"bytes\",\"name\":\"_extraData\",\"type\":\"bytes\"}],\"name\":\"createTree\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"disputesWithoutJurors\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint96\",\"name\":\"\",\"type\":\"uint96\"},{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"name\":\"draw\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"drawnAddress\",\"type\":\"address\"},{\"internalType\":\"uint96\",\"name\":\"fromSubcourtID\",\"type\":\"uint96\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"_iterations\",\"type\":\"uint256\"}],\"name\":\"executeDelayedStakes\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_account\",\"type\":\"address\"},{\"internalType\":\"uint96\",\"name\":\"_courtID\",\"type\":\"uint96\"}],\"name\":\"forcedUnstake\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_account\",\"type\":\"address\"}],\"name\":\"forcedUnstakeAllCourts\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_juror\",\"type\":\"address\"},{\"internalType\":\"uint96\",\"name\":\"_courtID\",\"type\":\"uint96\"}],\"name\":\"getJurorBalance\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"totalStaked\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"totalLocked\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"stakedInCourt\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"nbCourts\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_juror\",\"type\":\"address\"}],\"name\":\"getJurorCourtIDs\",\"outputs\":[{\"internalType\":\"uint96[]\",\"name\":\"\",\"type\":\"uint96[]\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_juror\",\"type\":\"address\"}],\"name\":\"getJurorLeftoverPNK\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_owner\",\"type\":\"address\"},{\"internalType\":\"contract KlerosCoreUniversity\",\"name\":\"_core\",\"type\":\"address\"}],\"name\":\"initialize\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_juror\",\"type\":\"address\"}],\"name\":\"isJurorStaked\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"\",\"type\":\"bool\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"account\",\"type\":\"address\"}],\"name\":\"jurors\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"stakedPnk\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"lockedPnk\",\"type\":\"uint256\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_account\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"_relativeAmount\",\"type\":\"uint256\"}],\"name\":\"lockStake\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"owner\",\"outputs\":[{\"internalType\":\"address\",\"name\":\"\",\"type\":\"address\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"passPhase\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"\",\"type\":\"uint256\"}],\"name\":\"postDrawHook\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"proxiableUUID\",\"outputs\":[{\"internalType\":\"bytes32\",\"name\":\"\",\"type\":\"bytes32\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_account\",\"type\":\"address\"},{\"internalType\":\"uint96\",\"name\":\"_courtID\",\"type\":\"uint96\"},{\"internalType\":\"uint256\",\"name\":\"_pnkDeposit\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_pnkWithdrawal\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"_newStake\",\"type\":\"uint256\"}],\"name\":\"setStake\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_account\",\"type\":\"address\"},{\"internalType\":\"uint96\",\"name\":\"_courtID\",\"type\":\"uint96\"},{\"internalType\":\"uint256\",\"name\":\"_penalty\",\"type\":\"uint256\"}],\"name\":\"setStakePenalty\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"pnkBalance\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"newCourtStake\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"availablePenalty\",\"type\":\"uint256\"}],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_account\",\"type\":\"address\"},{\"internalType\":\"uint96\",\"name\":\"_courtID\",\"type\":\"uint96\"},{\"internalType\":\"uint256\",\"name\":\"_reward\",\"type\":\"uint256\"}],\"name\":\"setStakeReward\",\"outputs\":[{\"internalType\":\"bool\",\"name\":\"success\",\"type\":\"bool\"}],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_juror\",\"type\":\"address\"}],\"name\":\"setTransientJuror\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_account\",\"type\":\"address\"},{\"internalType\":\"uint256\",\"name\":\"_relativeAmount\",\"type\":\"uint256\"}],\"name\":\"unlockStake\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"newImplementation\",\"type\":\"address\"},{\"internalType\":\"bytes\",\"name\":\"data\",\"type\":\"bytes\"}],\"name\":\"upgradeToAndCall\",\"outputs\":[],\"stateMutability\":\"payable\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_account\",\"type\":\"address\"},{\"internalType\":\"uint96\",\"name\":\"_courtID\",\"type\":\"uint96\"},{\"internalType\":\"uint256\",\"name\":\"_newStake\",\"type\":\"uint256\"},{\"internalType\":\"bool\",\"name\":\"\",\"type\":\"bool\"}],\"name\":\"validateStake\",\"outputs\":[{\"internalType\":\"uint256\",\"name\":\"pnkDeposit\",\"type\":\"uint256\"},{\"internalType\":\"uint256\",\"name\":\"pnkWithdrawal\",\"type\":\"uint256\"},{\"internalType\":\"enum StakingResult\",\"name\":\"stakingResult\",\"type\":\"uint8\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[],\"name\":\"version\",\"outputs\":[{\"internalType\":\"string\",\"name\":\"\",\"type\":\"string\"}],\"stateMutability\":\"view\",\"type\":\"function\"},{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_account\",\"type\":\"address\"}],\"name\":\"withdrawLeftoverPNK\",\"outputs\":[],\"stateMutability\":\"nonpayable\",\"type\":\"function\"}],\"devdoc\":{\"errors\":{\"AlreadyInitialized()\":[{\"details\":\"The contract is already initialized.\"}],\"NotInitializing()\":[{\"details\":\"The contract is not initializing.\"}]},\"events\":{\"Initialized(uint64)\":{\"details\":\"Triggered when the contract has been initialized or reinitialized.\"},\"LeftoverPNK(address,uint256)\":{\"params\":{\"_account\":\"The account of the juror.\",\"_amount\":\"The amount of PNK available.\"}},\"LeftoverPNKWithdrawn(address,uint256)\":{\"params\":{\"_account\":\"The account of the juror withdrawing PNK.\",\"_amount\":\"The amount of PNK withdrawn.\"}},\"NewPhase(uint8)\":{\"params\":{\"_phase\":\"The new phase.\"}},\"StakeLocked(address,uint256,bool)\":{\"params\":{\"_address\":\"The address of the juror.\",\"_relativeAmount\":\"The amount of tokens locked.\",\"_unlock\":\"Whether the stake is locked or unlocked.\"}},\"StakeSet(address,uint256,uint256,uint256)\":{\"params\":{\"_address\":\"The address of the juror.\",\"_amount\":\"The amount of tokens staked in the court.\",\"_amountAllCourts\":\"The amount of tokens staked in all courts.\",\"_courtID\":\"The ID of the court.\"}},\"Upgraded(address)\":{\"params\":{\"newImplementation\":\"Address of the new implementation the proxy is now forwarding calls to.\"}}},\"kind\":\"dev\",\"methods\":{\"constructor\":{\"custom:oz-upgrades-unsafe-allow\":\"constructor\"},\"createDisputeHook(uint256,uint256)\":{\"params\":{\"_disputeID\":\"The ID of the dispute.\",\"_roundID\":\"The ID of the round.\"}},\"createTree(uint96,bytes)\":{\"params\":{\"_courtID\":\"The ID of the court.\",\"_extraData\":\"Extra data that contains the number of children each node in the tree should have.\"}},\"draw(uint96,uint256,uint256)\":{\"details\":\"that this function reverts if the sum of all values in the tree is 0. `O(k * log_k(n))` where `k` is the maximum number of children per node in the tree,  and `n` is the maximum number of nodes ever appended.\",\"params\":{\"_coreDisputeID\":\"Index of the dispute in Kleros Core.\",\"_courtID\":\"The ID of the court.\",\"_nonce\":\"Nonce to hash with random number.\"},\"returns\":{\"drawnAddress\":\"The drawn address.\"}},\"executeDelayedStakes(uint256)\":{\"params\":{\"_iterations\":\"The number of delayed stakes to execute.\"}},\"forcedUnstake(address,uint96)\":{\"details\":\"`O(n * (p * log_k(j)) )` where `n` is the number of courts the juror has staked in, `p` is the depth of the court tree, `k` is the minimum number of children per node of one of these courts' sortition sum tree, and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.\",\"params\":{\"_account\":\"The juror to unstake.\",\"_courtID\":\"The ID of the court.\"}},\"forcedUnstakeAllCourts(address)\":{\"details\":\"`O(n * (p * log_k(j)) )` where `O(n * (p * log_k(j)) )` where `n` is the number of courts the juror has staked in, `p` is the depth of the court tree, `k` is the minimum number of children per node of one of these courts' sortition sum tree, and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.\",\"params\":{\"_account\":\"The juror to unstake.\"}},\"getJurorBalance(address,uint96)\":{\"params\":{\"_courtID\":\"The ID of the court.\",\"_juror\":\"The address of the juror.\"},\"returns\":{\"nbCourts\":\"The number of courts the juror has directly staked in.\",\"stakedInCourt\":\"The amount of tokens staked in the specified court including locked tokens and penalty deductions.\",\"totalLocked\":\"The total amount of tokens locked in disputes.\",\"totalStaked\":\"The total amount of tokens staked including locked tokens and penalty deductions. Equivalent to the effective stake in the General court.\"}},\"getJurorCourtIDs(address)\":{\"params\":{\"_juror\":\"The address of the juror.\"}},\"getJurorLeftoverPNK(address)\":{\"params\":{\"_juror\":\"The address of the juror.\"},\"returns\":{\"_0\":\"Whether the juror has leftover PNK.\"}},\"initialize(address,address)\":{\"params\":{\"_core\":\"The KlerosCore.\"}},\"isJurorStaked(address)\":{\"params\":{\"_juror\":\"The address of the juror.\"},\"returns\":{\"_0\":\"Whether the juror is staked or not.\"}},\"lockStake(address,uint256)\":{\"params\":{\"_account\":\"The address of the juror.\",\"_relativeAmount\":\"The amount to lock.\"}},\"postDrawHook(uint256,uint256)\":{\"params\":{\"_disputeID\":\"The ID of the dispute.\",\"_roundID\":\"The ID of the round.\"}},\"proxiableUUID()\":{\"details\":\"IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks bricking a proxy that upgrades to it, by delegating to itself until out of gas. Thus it is critical that this function revert if invoked through a proxy. This is guaranteed by the if statement.\"},\"setStake(address,uint96,uint256,uint256,uint256)\":{\"details\":\"`O(n + p * log_k(j))` where `n` is the number of courts the juror has staked in, `p` is the depth of the court tree, `k` is the minimum number of children per node of one of these courts' sortition sum tree, and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.\",\"params\":{\"_account\":\"The address of the juror.\",\"_courtID\":\"The ID of the court.\",\"_newStake\":\"The new stake.\",\"_pnkDeposit\":\"The amount of PNK to be deposited.\",\"_pnkWithdrawal\":\"The amount of PNK to be withdrawn.\"}},\"setStakePenalty(address,uint96,uint256)\":{\"details\":\"`O(n + p * log_k(j))` where `n` is the number of courts the juror has staked in, `p` is the depth of the court tree, `k` is the minimum number of children per node of one of these courts' sortition sum tree, and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.\",\"params\":{\"_account\":\"The address of the juror.\",\"_courtID\":\"The ID of the court.\",\"_penalty\":\"The amount of PNK to be deducted.\"},\"returns\":{\"availablePenalty\":\"The amount of PNK that was actually deducted.\",\"newCourtStake\":\"The updated stake of the juror in the court.\",\"pnkBalance\":\"The updated total PNK balance of the juror, including the penalty.\"}},\"setStakeReward(address,uint96,uint256)\":{\"details\":\"`O(n + p * log_k(j))` where `O(n + p * log_k(j))` where `n` is the number of courts the juror has staked in, `p` is the depth of the court tree, `k` is the minimum number of children per node of one of these courts' sortition sum tree, and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.\",\"params\":{\"_account\":\"The address of the juror.\",\"_courtID\":\"The ID of the court.\",\"_reward\":\"The amount of PNK to be deposited as a reward.\"},\"returns\":{\"success\":\"True if the reward was added successfully.\"}},\"unlockStake(address,uint256)\":{\"params\":{\"_account\":\"The address of the juror.\",\"_relativeAmount\":\"The amount to unlock.\"}},\"upgradeToAndCall(address,bytes)\":{\"details\":\"Reverts if the execution is not performed via delegatecall or the execution context is not of a proxy with an ERC1967-compliant implementation pointing to self.\",\"params\":{\"data\":\"Data used in a delegate call to `newImplementation` if non-empty. This will typically be an encoded function call, and allows initializing the storage of the proxy like a Solidity constructor.\",\"newImplementation\":\"Address of the new implementation contract.\"}},\"validateStake(address,uint96,uint256,bool)\":{\"details\":\"No state changes should be made when returning stakingResult != Successful, otherwise delayed stakes might break invariants.\",\"params\":{\"_account\":\"The address of the juror.\",\"_courtID\":\"The ID of the court.\",\"_newStake\":\"The new stake.\",\"_noDelay\":\"True if the stake change should not be delayed.\"},\"returns\":{\"pnkDeposit\":\"The amount of PNK to be deposited.\",\"pnkWithdrawal\":\"The amount of PNK to be withdrawn.\",\"stakingResult\":\"The result of the staking operation.\"}},\"withdrawLeftoverPNK(address)\":{\"details\":\"that since locked and staked PNK are async it is possible for the juror to have positive staked PNK balance while having 0 stake in courts and 0 locked tokens (eg. when the juror fully unstaked during dispute and later got his tokens unlocked). In this case the juror can use this function to withdraw the leftover tokens. Also note that if the juror has some leftover PNK while not fully unstaked he'll have to manually unstake from all courts to trigger this function.\",\"params\":{\"_account\":\"The juror whose PNK to withdraw.\"}}},\"stateVariables\":{\"version\":{\"return\":\"Version string.\",\"returns\":{\"_0\":\"Version string.\"}}},\"title\":\"SortitionModuleUniversity\",\"version\":1},\"userdoc\":{\"errors\":{\"FailedDelegateCall()\":[{\"notice\":\"Failed Delegated call\"}],\"InvalidImplementation(address)\":[{\"notice\":\"The `implementation` is not UUPS-compliant\"}],\"UUPSUnauthorizedCallContext()\":[{\"notice\":\"The call is from an unauthorized context.\"}],\"UUPSUnsupportedProxiableUUID(bytes32)\":[{\"notice\":\"The storage `slot` is unsupported as a UUID.\"}]},\"events\":{\"LeftoverPNK(address,uint256)\":{\"notice\":\"Emitted when leftover PNK is available.\"},\"LeftoverPNKWithdrawn(address,uint256)\":{\"notice\":\"Emitted when leftover PNK is withdrawn.\"},\"NewPhase(uint8)\":{\"notice\":\"Emitted when the phase is changed.\"},\"StakeLocked(address,uint256,bool)\":{\"notice\":\"Emitted when a juror's stake is locked.\"},\"StakeSet(address,uint256,uint256,uint256)\":{\"notice\":\"Emitted when a juror stakes in a court.\"},\"Upgraded(address)\":{\"notice\":\"Emitted when the `implementation` has been successfully upgraded.\"}},\"kind\":\"user\",\"methods\":{\"createDisputeHook(uint256,uint256)\":{\"notice\":\"Triggers the state changes after dispute creation.\"},\"createTree(uint96,bytes)\":{\"notice\":\"Create a sortition sum tree at the specified key.\"},\"draw(uint96,uint256,uint256)\":{\"notice\":\"Draw an ID from a tree using a number.\"},\"executeDelayedStakes(uint256)\":{\"notice\":\"Executes the next delayed stakes.\"},\"forcedUnstake(address,uint96)\":{\"notice\":\"Unstakes the inactive juror from a specific court.\"},\"forcedUnstakeAllCourts(address)\":{\"notice\":\"Unstakes the inactive juror from all courts.\"},\"getJurorBalance(address,uint96)\":{\"notice\":\"Gets the balance of a juror in a court.\"},\"getJurorCourtIDs(address)\":{\"notice\":\"Gets the court identifiers where a specific `_juror` has staked.\"},\"getJurorLeftoverPNK(address)\":{\"notice\":\"Checks if the juror has any leftover PNK in the contract.\"},\"initialize(address,address)\":{\"notice\":\"Initializer (constructor equivalent for upgradable contracts).\"},\"isJurorStaked(address)\":{\"notice\":\"Checks if the juror is staked in any court.\"},\"lockStake(address,uint256)\":{\"notice\":\"Locks the tokens of the drawn juror.\"},\"passPhase()\":{\"notice\":\"Passes the phase.\"},\"postDrawHook(uint256,uint256)\":{\"notice\":\"Triggers the state changes after drawing.\"},\"proxiableUUID()\":{\"notice\":\"Implementation of the ERC1822 `proxiableUUID` function. This returns the storage slot used by the implementation. It is used to validate the implementation's compatibility when performing an upgrade.\"},\"setStake(address,uint96,uint256,uint256,uint256)\":{\"notice\":\"Update the state of the stakes, called by KC at the end of setStake flow.\"},\"setStakePenalty(address,uint96,uint256)\":{\"notice\":\"Update the state of the stakes with a PNK reward deposit, called by KC during rewards execution.\"},\"setStakeReward(address,uint96,uint256)\":{\"notice\":\"Update the state of the stakes with a PNK reward deposit, called by KC during rewards execution.\"},\"unlockStake(address,uint256)\":{\"notice\":\"Unlocks the tokens of the drawn juror.\"},\"upgradeToAndCall(address,bytes)\":{\"notice\":\"Upgrade mechanism including access control and UUPS-compliance.\"},\"validateStake(address,uint96,uint256,bool)\":{\"notice\":\"Validate the specified juror's new stake for a court.\"},\"version()\":{\"notice\":\"Returns the version of the implementation.\"},\"withdrawLeftoverPNK(address)\":{\"notice\":\"Gives back the locked PNKs in case the juror fully unstaked earlier.\"}},\"notice\":\"An adapted version of the SortitionModule contract for educational purposes.\",\"version\":1}},\"settings\":{\"compilationTarget\":{\"src/arbitration/university/SortitionModuleUniversity.sol\":\"SortitionModuleUniversity\"},\"evmVersion\":\"cancun\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\",\"useLiteralContent\":true},\"optimizer\":{\"enabled\":true,\"runs\":1000},\"remappings\":[],\"viaIR\":true},\"sources\":{\"@openzeppelin/contracts/token/ERC20/IERC20.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v5.4.0) (token/ERC20/IERC20.sol)\\n\\npragma solidity >=0.4.16;\\n\\n/**\\n * @dev Interface of the ERC-20 standard as defined in the ERC.\\n */\\ninterface IERC20 {\\n    /**\\n     * @dev Emitted when `value` tokens are moved from one account (`from`) to\\n     * another (`to`).\\n     *\\n     * Note that `value` may be zero.\\n     */\\n    event Transfer(address indexed from, address indexed to, uint256 value);\\n\\n    /**\\n     * @dev Emitted when the allowance of a `spender` for an `owner` is set by\\n     * a call to {approve}. `value` is the new allowance.\\n     */\\n    event Approval(address indexed owner, address indexed spender, uint256 value);\\n\\n    /**\\n     * @dev Returns the value of tokens in existence.\\n     */\\n    function totalSupply() external view returns (uint256);\\n\\n    /**\\n     * @dev Returns the value of tokens owned by `account`.\\n     */\\n    function balanceOf(address account) external view returns (uint256);\\n\\n    /**\\n     * @dev Moves a `value` amount of tokens from the caller's account to `to`.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * Emits a {Transfer} event.\\n     */\\n    function transfer(address to, uint256 value) external returns (bool);\\n\\n    /**\\n     * @dev Returns the remaining number of tokens that `spender` will be\\n     * allowed to spend on behalf of `owner` through {transferFrom}. This is\\n     * zero by default.\\n     *\\n     * This value changes when {approve} or {transferFrom} are called.\\n     */\\n    function allowance(address owner, address spender) external view returns (uint256);\\n\\n    /**\\n     * @dev Sets a `value` amount of tokens as the allowance of `spender` over the\\n     * caller's tokens.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * IMPORTANT: Beware that changing an allowance with this method brings the risk\\n     * that someone may use both the old and the new allowance by unfortunate\\n     * transaction ordering. One possible solution to mitigate this race\\n     * condition is to first reduce the spender's allowance to 0 and set the\\n     * desired value afterwards:\\n     * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729\\n     *\\n     * Emits an {Approval} event.\\n     */\\n    function approve(address spender, uint256 value) external returns (bool);\\n\\n    /**\\n     * @dev Moves a `value` amount of tokens from `from` to `to` using the\\n     * allowance mechanism. `value` is then deducted from the caller's\\n     * allowance.\\n     *\\n     * Returns a boolean value indicating whether the operation succeeded.\\n     *\\n     * Emits a {Transfer} event.\\n     */\\n    function transferFrom(address from, address to, uint256 value) external returns (bool);\\n}\\n\",\"keccak256\":\"0x74ed01eb66b923d0d0cfe3be84604ac04b76482a55f9dd655e1ef4d367f95bc2\",\"license\":\"MIT\"},\"src/arbitration/interfaces/IArbitrableV2.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity >=0.8.0 <0.9.0;\\n\\nimport \\\"./IArbitratorV2.sol\\\";\\n\\n/// @title IArbitrableV2\\n/// @notice Arbitrable interface.\\n/// @dev When developing arbitrable contracts, we need to:\\n/// - Define the action taken when a ruling is received by the contract.\\n/// - Allow dispute creation which calls `arbitrator.createDispute{value: _fee}(_choices,_extraData)`.\\ninterface IArbitrableV2 {\\n    // ************************************* //\\n    // *              Events               * //\\n    // ************************************* //\\n\\n    /// @notice To be emitted when a dispute is created to link the correct template to the disputeID.\\n    /// @param _arbitrator The arbitrator of the contract.\\n    /// @param _arbitratorDisputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _externalDisputeID An identifier created outside Kleros by the protocol requesting arbitration.\\n    /// @param _templateId The identifier of the dispute template.\\n    event DisputeRequest(\\n        IArbitratorV2 indexed _arbitrator,\\n        uint256 indexed _arbitratorDisputeID,\\n        uint256 _externalDisputeID,\\n        uint256 _templateId\\n    );\\n\\n    /// @notice To be raised when a ruling is given.\\n    /// @param _arbitrator The arbitrator giving the ruling.\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _ruling The ruling which was given.\\n    event Ruling(IArbitratorV2 indexed _arbitrator, uint256 indexed _disputeID, uint256 _ruling);\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @notice Give a ruling for a dispute.\\n    ///\\n    /// @dev This is a callback function for the arbitrator to provide the ruling to this contract.\\n    /// Only the arbitrator must be allowed to call this function.\\n    /// Ruling 0 is reserved for \\\"Not able/wanting to make a decision\\\".\\n    ///\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _ruling Ruling given by the arbitrator.\\n    function rule(uint256 _disputeID, uint256 _ruling) external;\\n}\\n\",\"keccak256\":\"0x3afa29a93847399c8705103350b69bb70706b2075ca41b39d523b007e69e23db\",\"license\":\"MIT\"},\"src/arbitration/interfaces/IArbitratorV2.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity >=0.8.0 <0.9.0;\\n\\nimport \\\"@openzeppelin/contracts/token/ERC20/IERC20.sol\\\";\\nimport \\\"./IArbitrableV2.sol\\\";\\n\\n/// @title Arbitrator\\n/// @notice Arbitrator interface for the Kleros V2 protocol.\\n/// @dev Unlike the ERC-792 this standard is not concerned with appeals, so each arbitrator can implement an appeal system that suits it the most.\\ninterface IArbitratorV2 {\\n    // ************************************* //\\n    // *              Events               * //\\n    // ************************************* //\\n\\n    /// @notice To be emitted when a dispute is created.\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _arbitrable The contract which created the dispute.\\n    event DisputeCreation(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);\\n\\n    /// @notice To be raised when a ruling is given.\\n    /// @param _arbitrable The arbitrable receiving the ruling.\\n    /// @param _disputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _ruling The ruling which was given.\\n    event Ruling(IArbitrableV2 indexed _arbitrable, uint256 indexed _disputeID, uint256 _ruling);\\n\\n    /// @notice To be emitted when an ERC20 token is added or removed as a method to pay fees.\\n    /// @param _token The ERC20 token.\\n    /// @param _accepted Whether the token is accepted or not.\\n    event AcceptedFeeToken(IERC20 indexed _token, bool indexed _accepted);\\n\\n    /// @notice To be emitted when the fee for a particular ERC20 token is updated.\\n    /// @param _feeToken The ERC20 token.\\n    /// @param _rateInEth The new rate of the fee token in ETH.\\n    /// @param _rateDecimals The new decimals of the fee token rate.\\n    event NewCurrencyRate(IERC20 indexed _feeToken, uint64 _rateInEth, uint8 _rateDecimals);\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @notice Create a dispute and pay for the fees in the native currency, typically ETH.\\n    /// @dev Must be called by the arbitrable contract and pay at least `arbitrationCost(_extraData)` in ETH.\\n    /// @param _numberOfChoices The number of choices the arbitrator can choose from in this dispute.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @return disputeID The identifier of the dispute created.\\n    function createDispute(\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData\\n    ) external payable returns (uint256 disputeID);\\n\\n    /// @notice Create a dispute and pay for the fees in a supported ERC20 token.\\n    /// @dev Must be called by the arbitrable contract and pay at least `arbitrationCost(_extraData)` in the supported ERC20 token.\\n    /// @param _numberOfChoices The number of choices the arbitrator can choose from in this dispute.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @param _feeToken The ERC20 token used to pay fees.\\n    /// @param _feeAmount Amount of the ERC20 token used to pay fees.\\n    /// @return disputeID The identifier of the dispute created.\\n    function createDispute(\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData,\\n        IERC20 _feeToken,\\n        uint256 _feeAmount\\n    ) external returns (uint256 disputeID);\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /// @notice Compute the cost of arbitration denominated in the native currency, typically ETH.\\n    /// @dev It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @return cost The arbitration cost in ETH.\\n    function arbitrationCost(bytes calldata _extraData) external view returns (uint256 cost);\\n\\n    /// @notice Compute the cost of arbitration denominated in `_feeToken`.\\n    /// @dev It is recommended not to increase it often, as it can be highly time and gas consuming for the arbitrated contracts to cope with fee augmentation.\\n    /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).\\n    /// @param _feeToken The ERC20 token used to pay fees.\\n    /// @return cost The arbitration cost in `_feeToken`.\\n    function arbitrationCost(bytes calldata _extraData, IERC20 _feeToken) external view returns (uint256 cost);\\n\\n    /// @notice Gets the current ruling of a specified dispute.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return ruling The current ruling.\\n    /// @return tied Whether it's a tie or not.\\n    /// @return overridden Whether the ruling was overridden by appeal funding or not.\\n    function currentRuling(uint256 _disputeID) external view returns (uint256 ruling, bool tied, bool overridden);\\n}\\n\",\"keccak256\":\"0x65ba87c5309cd6e6562e569f79778ca423c9be7b0a44b9407e5bd2bdf8fdc3b0\",\"license\":\"MIT\"},\"src/arbitration/interfaces/IDisputeKit.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity >=0.8.0 <0.9.0;\\n\\nimport \\\"./IArbitratorV2.sol\\\";\\n\\n/// @title IDisputeKit\\n/// @notice An abstraction of the Dispute Kits intended for interfacing with KlerosCore.\\n/// @dev It does not intend to abstract the interactions with the user (such as voting or appeal funding) to allow for implementation-specific parameters.\\ninterface IDisputeKit {\\n    // ************************************ //\\n    // *             Events               * //\\n    // ************************************ //\\n\\n    /// @notice Emitted when casting a vote to provide the justification of juror's choice.\\n    /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.\\n    /// @param _juror Address of the juror.\\n    /// @param _voteIDs The identifiers of the votes in the dispute.\\n    /// @param _choice The choice juror voted for.\\n    /// @param _justification Justification of the choice.\\n    event VoteCast(\\n        uint256 indexed _coreDisputeID,\\n        address indexed _juror,\\n        uint256[] _voteIDs,\\n        uint256 indexed _choice,\\n        string _justification\\n    );\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @notice Creates a local dispute and maps it to the dispute ID in the Core contract.\\n    /// @dev Access restricted to Kleros Core only.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _numberOfChoices Number of choices of the dispute\\n    /// @param _extraData Additional info about the dispute, for possible use in future dispute kits.\\n    /// @param _nbVotes Maximal number of votes this dispute can get. Added for future-proofing.\\n    function createDispute(\\n        uint256 _coreDisputeID,\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData,\\n        uint256 _nbVotes\\n    ) external;\\n\\n    /// @notice Draws the juror from the sortition tree. The drawn address is picked up by Kleros Core.\\n    /// @dev Access restricted to Kleros Core only.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _nonce Nonce.\\n    /// @return drawnAddress The drawn address.\\n    function draw(\\n        uint256 _coreDisputeID,\\n        uint256 _nonce\\n    ) external returns (address drawnAddress, uint96 fromSubcourtID);\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /// @notice Gets the current ruling of a specified dispute.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @return ruling The current ruling.\\n    /// @return tied Whether it's a tie or not.\\n    /// @return overridden Whether the ruling was overridden by appeal funding or not.\\n    function currentRuling(uint256 _coreDisputeID) external view returns (uint256 ruling, bool tied, bool overridden);\\n\\n    /// @notice Gets the degree of coherence of a particular voter.\\n    /// @dev This function is called by Kleros Core in order to determine the amount of the reward.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.\\n    /// @param _voteID The ID of the vote.\\n    /// @param _feePerJuror The fee per juror.\\n    /// @param _pnkAtStakePerJuror The PNK at stake per juror.\\n    /// @return pnkCoherence The degree of coherence in basis points for the dispute PNK reward.\\n    /// @return feeCoherence The degree of coherence in basis points for the dispute fee reward.\\n    function getDegreeOfCoherenceReward(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _voteID,\\n        uint256 _feePerJuror,\\n        uint256 _pnkAtStakePerJuror\\n    ) external view returns (uint256 pnkCoherence, uint256 feeCoherence);\\n\\n    /// @notice Gets the degree of coherence of a particular voter.\\n    /// @dev This function is called by Kleros Core in order to determine the amount of the penalty.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.\\n    /// @param _voteID The ID of the vote.\\n    /// @param _feePerJuror The fee per juror.\\n    /// @param _pnkAtStakePerJuror The PNK at stake per juror.\\n    /// @return pnkCoherence The degree of coherence in basis points for the dispute PNK reward.\\n    function getDegreeOfCoherencePenalty(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _voteID,\\n        uint256 _feePerJuror,\\n        uint256 _pnkAtStakePerJuror\\n    ) external view returns (uint256 pnkCoherence);\\n\\n    /// @notice Gets the number of jurors who are eligible to a reward in this round.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.\\n    /// @return The number of coherent jurors.\\n    function getCoherentCount(uint256 _coreDisputeID, uint256 _coreRoundID) external view returns (uint256);\\n\\n    /// @notice Returns true if all of the jurors have cast their commits for the last round.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @return Whether all of the jurors have cast their commits for the last round.\\n    function areCommitsAllCast(uint256 _coreDisputeID) external view returns (bool);\\n\\n    /// @notice Returns true if all of the jurors have cast their votes for the last round.\\n    /// @dev This function is to be called directly by the core contract and is not for off-chain usage.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @return Whether all of the jurors have cast their votes for the last round.\\n    function areVotesAllCast(uint256 _coreDisputeID) external view returns (bool);\\n\\n    /// @notice Returns true if the appeal funding is finished prematurely (e.g. when losing side didn't fund).\\n    /// @dev This function is to be called directly by the core contract and is not for off-chain usage.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @return Whether the appeal funding is finished.\\n    function isAppealFunded(uint256 _coreDisputeID) external view returns (bool);\\n\\n    /// @dev Returns true if the dispute is jumping to a parent court.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @return Whether the dispute is jumping to a parent court or not.\\n    function earlyCourtJump(uint256 _coreDisputeID) external view returns (bool);\\n\\n    /// @notice Returns the number of votes after the appeal.\\n    /// @param _previousDisputeKit The previous Dispute Kit.\\n    /// @param _currentNbVotes The number of votes before the appeal.\\n    /// @return The number of votes after the appeal.\\n    function getNbVotesAfterAppeal(\\n        IDisputeKit _previousDisputeKit,\\n        uint256 _currentNbVotes\\n    ) external view returns (uint256);\\n\\n    /// @notice Returns the dispute kit ID to be used after court jump by Kleros Core.\\n    /// @return The ID of the dispute kit in Kleros Core disputeKits array.\\n    function getJumpDisputeKitID() external view returns (uint256);\\n\\n    /// @notice Returns true if the specified voter was active in this round.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.\\n    /// @param _voteID The ID of the voter.\\n    /// @return Whether the voter was active or not.\\n    function isVoteActive(uint256 _coreDisputeID, uint256 _coreRoundID, uint256 _voteID) external view returns (bool);\\n\\n    /// @notice Returns the info of the specified round in the core contract.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.\\n    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.\\n    /// @param _choice The choice to query.\\n    /// @return winningChoice The winning choice of this round.\\n    /// @return tied Whether it's a tie or not.\\n    /// @return totalVoted Number of jurors who cast the vote already.\\n    /// @return totalCommited Number of jurors who cast the commit already (only relevant for hidden votes).\\n    /// @return nbVoters Total number of voters in this round.\\n    /// @return choiceCount Number of votes cast for the queried choice.\\n    function getRoundInfo(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _choice\\n    )\\n        external\\n        view\\n        returns (\\n            uint256 winningChoice,\\n            bool tied,\\n            uint256 totalVoted,\\n            uint256 totalCommited,\\n            uint256 nbVoters,\\n            uint256 choiceCount\\n        );\\n\\n    /// @notice Returns the vote information for a given vote ID.\\n    /// @param _coreDisputeID The ID of the dispute in Kleros Core.\\n    /// @param _coreRoundID The ID of the round in Kleros Core.\\n    /// @param _voteID The ID of the vote.\\n    /// @return account The address of the juror who cast the vote.\\n    /// @return commit The commit of the vote.\\n    /// @return choice The choice that got the vote.\\n    /// @return voted Whether the vote was cast or not.\\n    function getVoteInfo(\\n        uint256 _coreDisputeID,\\n        uint256 _coreRoundID,\\n        uint256 _voteID\\n    ) external view returns (address account, bytes32 commit, uint256 choice, bool voted);\\n}\\n\",\"keccak256\":\"0x1f12d2574dffd9bf83cf33a54aa4abbbfa4203251a0f962edd8e5c3b370408bc\",\"license\":\"MIT\"},\"src/arbitration/interfaces/ISortitionModule.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity >=0.8.0 <0.9.0;\\n\\nimport \\\"../../libraries/Constants.sol\\\";\\n\\n/// @title ISortitionModule\\n/// @notice Interface for the SortitionModule contract.\\ninterface ISortitionModule {\\n    // ************************************* //\\n    // *              Enums                * //\\n    // ************************************* //\\n\\n    enum Phase {\\n        staking, // Stake sum trees can be updated. Pass after `minStakingTime` passes and there is at least one dispute without jurors.\\n        generating, // Waiting for a random number. Pass as soon as it is ready.\\n        drawing // Jurors can be drawn. Pass after all disputes have jurors or `maxDrawingTime` passes.\\n    }\\n\\n    // ************************************* //\\n    // *              Events               * //\\n    // ************************************* //\\n\\n    /// @notice Emitted when the phase is changed.\\n    /// @param _phase The new phase.\\n    event NewPhase(Phase _phase);\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @notice Passes the phase.\\n    function passPhase() external;\\n\\n    /// @notice Executes the next delayed stakes.\\n    /// @param _iterations The number of delayed stakes to execute.\\n    function executeDelayedStakes(uint256 _iterations) external;\\n\\n    /// @notice Create a sortition sum tree at the specified key.\\n    /// @param _courtID The ID of the court.\\n    /// @param _extraData Extra data that contains the number of children each node in the tree should have.\\n    function createTree(uint96 _courtID, bytes memory _extraData) external;\\n\\n    /// @notice Validate the specified juror's new stake for a court.\\n    /// @dev No state changes should be made when returning stakingResult != Successful, otherwise delayed stakes might break invariants.\\n    /// @param _account The address of the juror.\\n    /// @param _courtID The ID of the court.\\n    /// @param _newStake The new stake.\\n    /// @param _noDelay True if the stake change should not be delayed.\\n    /// @return pnkDeposit The amount of PNK to be deposited.\\n    /// @return pnkWithdrawal The amount of PNK to be withdrawn.\\n    /// @return stakingResult The result of the staking operation.\\n    function validateStake(\\n        address _account,\\n        uint96 _courtID,\\n        uint256 _newStake,\\n        bool _noDelay\\n    ) external returns (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult);\\n\\n    /// @notice Update the state of the stakes, called by KC at the end of setStake flow.\\n    ///\\n    /// @dev `O(n + p * log_k(j))` where\\n    /// `n` is the number of courts the juror has staked in,\\n    /// `p` is the depth of the court tree,\\n    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,\\n    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.\\n    ///\\n    /// @param _account The address of the juror.\\n    /// @param _courtID The ID of the court.\\n    /// @param _pnkDeposit The amount of PNK to be deposited.\\n    /// @param _pnkWithdrawal The amount of PNK to be withdrawn.\\n    /// @param _newStake The new stake.\\n    function setStake(\\n        address _account,\\n        uint96 _courtID,\\n        uint256 _pnkDeposit,\\n        uint256 _pnkWithdrawal,\\n        uint256 _newStake\\n    ) external;\\n\\n    /// @notice Update the state of the stakes with a PNK reward deposit, called by KC during rewards execution.\\n    ///\\n    /// @dev `O(n + p * log_k(j))` where\\n    /// `n` is the number of courts the juror has staked in,\\n    /// `p` is the depth of the court tree,\\n    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,\\n    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.\\n    ///\\n    /// @param _account The address of the juror.\\n    /// @param _courtID The ID of the court.\\n    /// @param _penalty The amount of PNK to be deducted.\\n    /// @return pnkBalance The updated total PNK balance of the juror, including the penalty.\\n    /// @return newCourtStake The updated stake of the juror in the court.\\n    /// @return availablePenalty The amount of PNK that was actually deducted.\\n    function setStakePenalty(\\n        address _account,\\n        uint96 _courtID,\\n        uint256 _penalty\\n    ) external returns (uint256 pnkBalance, uint256 newCourtStake, uint256 availablePenalty);\\n\\n    /// @notice Update the state of the stakes with a PNK reward deposit, called by KC during rewards execution.\\n    ///\\n    /// @dev `O(n + p * log_k(j))` where\\n    /// `O(n + p * log_k(j))` where\\n    /// `n` is the number of courts the juror has staked in,\\n    /// `p` is the depth of the court tree,\\n    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,\\n    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.\\n    ///\\n    /// @param _account The address of the juror.\\n    /// @param _courtID The ID of the court.\\n    /// @param _reward The amount of PNK to be deposited as a reward.\\n    /// @return success True if the reward was added successfully.\\n    function setStakeReward(address _account, uint96 _courtID, uint256 _reward) external returns (bool success);\\n\\n    /// @notice Unstakes the inactive juror from all courts.\\n    ///\\n    /// @dev `O(n * (p * log_k(j)) )` where\\n    /// `O(n * (p * log_k(j)) )` where\\n    /// `n` is the number of courts the juror has staked in,\\n    /// `p` is the depth of the court tree,\\n    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,\\n    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.\\n    ///\\n    /// @param _account The juror to unstake.\\n    function forcedUnstakeAllCourts(address _account) external;\\n\\n    /// @notice Unstakes the inactive juror from a specific court.\\n    ///\\n    /// @dev `O(n * (p * log_k(j)) )` where\\n    /// `n` is the number of courts the juror has staked in,\\n    /// `p` is the depth of the court tree,\\n    /// `k` is the minimum number of children per node of one of these courts' sortition sum tree,\\n    /// and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.\\n    ///\\n    /// @param _account The juror to unstake.\\n    /// @param _courtID The ID of the court.\\n    function forcedUnstake(address _account, uint96 _courtID) external;\\n\\n    /// @notice Locks the tokens of the drawn juror.\\n    /// @param _account The address of the juror.\\n    /// @param _relativeAmount The amount to lock.\\n    function lockStake(address _account, uint256 _relativeAmount) external;\\n\\n    /// @notice Unlocks the tokens of the drawn juror.\\n    /// @param _account The address of the juror.\\n    /// @param _relativeAmount The amount to unlock.\\n    function unlockStake(address _account, uint256 _relativeAmount) external;\\n\\n    /// @notice Triggers the state changes after dispute creation.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _roundID The ID of the round.\\n    function createDisputeHook(uint256 _disputeID, uint256 _roundID) external;\\n\\n    /// @notice Triggers the state changes after drawing.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _roundID The ID of the round.\\n    function postDrawHook(uint256 _disputeID, uint256 _roundID) external;\\n\\n    /// @notice Gives back the locked PNKs in case the juror fully unstaked earlier.\\n    ///\\n    /// @dev that since locked and staked PNK are async it is possible for the juror to have positive staked PNK balance\\n    /// while having 0 stake in courts and 0 locked tokens (eg. when the juror fully unstaked during dispute and later got his tokens unlocked).\\n    /// In this case the juror can use this function to withdraw the leftover tokens.\\n    /// Also note that if the juror has some leftover PNK while not fully unstaked he'll have to manually unstake from all courts to trigger this function.\\n    ///\\n    /// @param _account The juror whose PNK to withdraw.\\n    function withdrawLeftoverPNK(address _account) external;\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /// @notice Draw an ID from a tree using a number.\\n    ///\\n    /// @dev that this function reverts if the sum of all values in the tree is 0.\\n    /// `O(k * log_k(n))` where\\n    /// `k` is the maximum number of children per node in the tree,\\n    ///  and `n` is the maximum number of nodes ever appended.\\n    ///\\n    /// @param _courtID The ID of the court.\\n    /// @param _coreDisputeID Index of the dispute in Kleros Core.\\n    /// @param _nonce Nonce to hash with random number.\\n    /// @return drawnAddress The drawn address.\\n    function draw(\\n        uint96 _courtID,\\n        uint256 _coreDisputeID,\\n        uint256 _nonce\\n    ) external view returns (address drawnAddress, uint96 fromSubcourtID);\\n\\n    /// @notice Gets the balance of a juror in a court.\\n    /// @param _juror The address of the juror.\\n    /// @param _courtID The ID of the court.\\n    /// @return totalStakedPnk The total amount of tokens staked including locked tokens and penalty deductions. Equivalent to the effective stake in the General court.\\n    /// @return totalLocked The total amount of tokens locked in disputes.\\n    /// @return stakedInCourt The amount of tokens staked in the specified court including locked tokens and penalty deductions.\\n    /// @return nbCourts The number of courts the juror has directly staked in.\\n    function getJurorBalance(\\n        address _juror,\\n        uint96 _courtID\\n    ) external view returns (uint256 totalStakedPnk, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts);\\n\\n    /// @notice Gets the court identifiers where a specific `_juror` has staked.\\n    /// @param _juror The address of the juror.\\n    function getJurorCourtIDs(address _juror) external view returns (uint96[] memory);\\n\\n    /// @notice Checks if the juror is staked in any court.\\n    /// @param _juror The address of the juror.\\n    /// @return Whether the juror is staked or not.\\n    function isJurorStaked(address _juror) external view returns (bool);\\n\\n    /// @notice Checks if the juror has any leftover PNK in the contract.\\n    /// @param _juror The address of the juror.\\n    /// @return Whether the juror has leftover PNK.\\n    function getJurorLeftoverPNK(address _juror) external view returns (uint256);\\n}\\n\",\"keccak256\":\"0x3eeff4281ddf3c731c6503094bbbcc80d8015e3a60a27c8cadadfffdf1bf5437\",\"license\":\"MIT\"},\"src/arbitration/university/ISortitionModuleUniversity.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\npragma solidity ^0.8.24;\\n\\nimport {ISortitionModule} from \\\"../interfaces/ISortitionModule.sol\\\";\\n\\ninterface ISortitionModuleUniversity is ISortitionModule {\\n    function setTransientJuror(address _juror) external;\\n}\\n\",\"keccak256\":\"0x57478726f4dd824eca06d8b5349395b5b37756f7988d3fffb6fdae4d0f4164ee\",\"license\":\"MIT\"},\"src/arbitration/university/KlerosCoreUniversity.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\nimport {IArbitrableV2, IArbitratorV2} from \\\"../interfaces/IArbitratorV2.sol\\\";\\nimport {IDisputeKit} from \\\"../interfaces/IDisputeKit.sol\\\";\\nimport {ISortitionModuleUniversity} from \\\"./ISortitionModuleUniversity.sol\\\";\\nimport {SafeERC20, IERC20} from \\\"../../libraries/SafeERC20.sol\\\";\\nimport {UUPSProxiable} from \\\"../../proxy/UUPSProxiable.sol\\\";\\nimport {Initializable} from \\\"../../proxy/Initializable.sol\\\";\\nimport \\\"../../libraries/Constants.sol\\\";\\n\\n/// @title KlerosCoreUniversity\\n/// @notice Core arbitrator contract for educational purposes.\\ncontract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {\\n    using SafeERC20 for IERC20;\\n\\n    string public constant override version = \\\"2.0.0\\\";\\n\\n    // ************************************* //\\n    // *         Enums / Structs           * //\\n    // ************************************* //\\n\\n    enum Period {\\n        evidence, // Evidence can be submitted. This is also when drawing has to take place.\\n        commit, // Jurors commit a hashed vote. This is skipped for courts without hidden votes.\\n        vote, // Jurors reveal/cast their vote depending on whether the court has hidden votes or not.\\n        appeal, // The dispute can be appealed.\\n        execution // Tokens are redistributed and the ruling is executed.\\n    }\\n\\n    struct Court {\\n        uint96 parent; // The parent court.\\n        bool hiddenVotes; // Whether to use commit and reveal or not.\\n        uint256[] children; // List of child courts.\\n        uint256 minStake; // Minimum PNKs needed to stake in the court.\\n        uint256 alpha; // Basis point of PNKs that are lost when incoherent.\\n        uint256 feeForJuror; // Arbitration fee paid per juror.\\n        uint256 jurorsForCourtJump; // The appeal after the one that reaches this number of jurors will go to the parent court if any.\\n        uint256[4] timesPerPeriod; // The time allotted to each dispute period in the form `timesPerPeriod[period]`.\\n        mapping(uint256 disputeKitId => bool) supportedDisputeKits; // True if DK with this ID is supported by the court. Note that each court must support classic dispute kit.\\n        uint256[10] __gap; // Reserved slots for future upgrades.\\n    }\\n\\n    struct Dispute {\\n        uint96 courtID; // The ID of the court the dispute is in.\\n        IArbitrableV2 arbitrated; // The arbitrable contract.\\n        Period period; // The current period of the dispute.\\n        bool ruled; // True if the ruling has been executed, false otherwise.\\n        uint256 lastPeriodChange; // The last time the period was changed.\\n        Round[] rounds;\\n        uint256[10] __gap; // Reserved slots for future upgrades.\\n    }\\n\\n    struct Round {\\n        uint256 disputeKitID; // Index of the dispute kit in the array.\\n        uint256 pnkAtStakePerJuror; // The amount of PNKs at stake for each juror in this round.\\n        uint256 totalFeesForJurors; // The total juror fees paid in this round.\\n        uint256 nbVotes; // The total number of votes the dispute can possibly have in the current round. Former votes[_round].length.\\n        uint256 repartitions; // A counter of reward repartitions made in this round.\\n        uint256 pnkPenalties; // The amount of PNKs collected from penalties in this round.\\n        address[] drawnJurors; // Addresses of the jurors that were drawn in this round.\\n        uint96[] drawnJurorFromCourtIDs; // The courtIDs where the juror was drawn from, possibly their stake in a subcourt.\\n        uint256 sumFeeRewardPaid; // Total sum of arbitration fees paid to coherent jurors as a reward in this round.\\n        uint256 sumPnkRewardPaid; // Total sum of PNK paid to coherent jurors as a reward in this round.\\n        IERC20 feeToken; // The token used for paying fees in this round.\\n        uint256 drawIterations; // The number of iterations passed drawing the jurors for this round.\\n        uint256[10] __gap; // Reserved slots for future upgrades.\\n    }\\n\\n    // Workaround \\\"stack too deep\\\" errors\\n    struct ExecuteParams {\\n        uint256 disputeID; // The ID of the dispute to execute.\\n        uint256 round; // The round to execute.\\n        uint256 coherentCount; // The number of coherent votes in the round.\\n        uint256 numberOfVotesInRound; // The number of votes in the round.\\n        uint256 feePerJurorInRound; // The fee per juror in the round.\\n        uint256 pnkAtStakePerJurorInRound; // The amount of PNKs at stake for each juror in the round.\\n        uint256 pnkPenaltiesInRound; // The amount of PNKs collected from penalties in the round.\\n        uint256 repartition; // The index of the repartition to execute.\\n    }\\n\\n    struct CurrencyRate {\\n        bool feePaymentAccepted;\\n        uint64 rateInEth;\\n        uint8 rateDecimals;\\n    }\\n\\n    // ************************************* //\\n    // *             Storage               * //\\n    // ************************************* //\\n\\n    uint256 private constant NON_PAYABLE_AMOUNT = (2 ** 256 - 2) / 2; // An amount higher than the supply of ETH.\\n\\n    address public owner; // The owner of the contract.\\n    address public instructor; // The instructor who is allowed to choose the jurors.\\n    IERC20 public pinakion; // The Pinakion token contract.\\n    address public jurorProsecutionModule; // The module for juror's prosecution.\\n    ISortitionModuleUniversity public sortitionModule; // Sortition module for drawing.\\n    Court[] public courts; // The courts.\\n    IDisputeKit[] public disputeKits; // Array of dispute kits.\\n    Dispute[] public disputes; // The disputes.\\n    mapping(IERC20 => CurrencyRate) public currencyRates; // The price of each token in ETH.\\n\\n    // ************************************* //\\n    // *              Events               * //\\n    // ************************************* //\\n\\n    event NewPeriod(uint256 indexed _disputeID, Period _period);\\n    event AppealPossible(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);\\n    event AppealDecision(uint256 indexed _disputeID, IArbitrableV2 indexed _arbitrable);\\n    event Draw(address indexed _address, uint256 indexed _disputeID, uint256 _roundID, uint256 _voteID);\\n    event CourtCreated(\\n        uint96 indexed _courtID,\\n        uint96 indexed _parent,\\n        bool _hiddenVotes,\\n        uint256 _minStake,\\n        uint256 _alpha,\\n        uint256 _feeForJuror,\\n        uint256 _jurorsForCourtJump,\\n        uint256[4] _timesPerPeriod,\\n        uint256[] _supportedDisputeKits\\n    );\\n    event CourtModified(\\n        uint96 indexed _courtID,\\n        bool _hiddenVotes,\\n        uint256 _minStake,\\n        uint256 _alpha,\\n        uint256 _feeForJuror,\\n        uint256 _jurorsForCourtJump,\\n        uint256[4] _timesPerPeriod\\n    );\\n    event DisputeKitCreated(uint256 indexed _disputeKitID, IDisputeKit indexed _disputeKitAddress);\\n    event DisputeKitEnabled(uint96 indexed _courtID, uint256 indexed _disputeKitID, bool indexed _enable);\\n    event CourtJump(\\n        uint256 indexed _disputeID,\\n        uint256 indexed _roundID,\\n        uint96 indexed _fromCourtID,\\n        uint96 _toCourtID\\n    );\\n    event DisputeKitJump(\\n        uint256 indexed _disputeID,\\n        uint256 indexed _roundID,\\n        uint256 indexed _fromDisputeKitID,\\n        uint256 _toDisputeKitID\\n    );\\n    event JurorRewardPenalty(\\n        address indexed _account,\\n        uint256 indexed _disputeID,\\n        uint256 indexed _roundID,\\n        uint256 _degreeOfCoherencyPnk,\\n        uint256 _degreeOfCoherencyFee,\\n        int256 _amountPnk,\\n        int256 _amountFee,\\n        IERC20 _feeToken\\n    );\\n    event LeftoverRewardSent(\\n        uint256 indexed _disputeID,\\n        uint256 indexed _roundID,\\n        uint256 _amountPnk,\\n        uint256 _amountFee,\\n        IERC20 _feeToken\\n    );\\n\\n    // ************************************* //\\n    // *        Function Modifiers         * //\\n    // ************************************* //\\n\\n    modifier onlyByOwner() {\\n        if (owner != msg.sender) revert OwnerOnly();\\n        _;\\n    }\\n\\n    modifier onlyByInstructor() {\\n        if (instructor != msg.sender) revert InstructorOnly();\\n        _;\\n    }\\n\\n    modifier onlyByOwnerOrInstructor() {\\n        if (msg.sender != owner && msg.sender != instructor) revert OwnerOrInstructorOnly();\\n        _;\\n    }\\n\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    /// @custom:oz-upgrades-unsafe-allow constructor\\n    constructor() {\\n        _disableInitializers();\\n    }\\n\\n    /// @notice Initializer (constructor equivalent for upgradable contracts).\\n    /// @param _owner The owner's address.\\n    /// @param _instructor The address of the instructor.\\n    /// @param _pinakion The address of the token contract.\\n    /// @param _jurorProsecutionModule The address of the juror prosecution module.\\n    /// @param _disputeKit The address of the default dispute kit.\\n    /// @param _hiddenVotes The `hiddenVotes` property value of the general court.\\n    /// @param _courtParameters Numeric parameters of General court (minStake, alpha, feeForJuror and jurorsForCourtJump respectively).\\n    /// @param _timesPerPeriod The `timesPerPeriod` property value of the general court.\\n    /// @param _sortitionModuleAddress The sortition module responsible for sortition of the jurors.\\n    function initialize(\\n        address _owner,\\n        address _instructor,\\n        IERC20 _pinakion,\\n        address _jurorProsecutionModule,\\n        IDisputeKit _disputeKit,\\n        bool _hiddenVotes,\\n        uint256[4] memory _courtParameters,\\n        uint256[4] memory _timesPerPeriod,\\n        ISortitionModuleUniversity _sortitionModuleAddress\\n    ) external initializer {\\n        owner = _owner;\\n        instructor = _instructor;\\n        pinakion = _pinakion;\\n        jurorProsecutionModule = _jurorProsecutionModule;\\n        sortitionModule = _sortitionModuleAddress;\\n\\n        // NULL_DISPUTE_KIT: an empty element at index 0 to indicate when a dispute kit is not supported.\\n        disputeKits.push();\\n\\n        // DISPUTE_KIT_CLASSIC\\n        disputeKits.push(_disputeKit);\\n\\n        emit DisputeKitCreated(DISPUTE_KIT_CLASSIC, _disputeKit);\\n\\n        // FORKING_COURT\\n        // TODO: Fill the properties for the Forking court, emit CourtCreated.\\n        courts.push();\\n\\n        // GENERAL_COURT\\n        Court storage court = courts.push();\\n        court.parent = FORKING_COURT;\\n        court.children = new uint256[](0);\\n        court.hiddenVotes = _hiddenVotes;\\n        court.minStake = _courtParameters[0];\\n        court.alpha = _courtParameters[1];\\n        court.feeForJuror = _courtParameters[2];\\n        court.jurorsForCourtJump = _courtParameters[3];\\n        court.timesPerPeriod = _timesPerPeriod;\\n\\n        emit CourtCreated(\\n            GENERAL_COURT,\\n            court.parent,\\n            _hiddenVotes,\\n            _courtParameters[0],\\n            _courtParameters[1],\\n            _courtParameters[2],\\n            _courtParameters[3],\\n            _timesPerPeriod,\\n            new uint256[](0)\\n        );\\n        _enableDisputeKit(GENERAL_COURT, DISPUTE_KIT_CLASSIC, true);\\n    }\\n\\n    // ************************************* //\\n    // *             Governance            * //\\n    // ************************************* //\\n\\n    /* @dev Access Control to perform implementation upgrades (UUPS Proxiable)\\n     * @dev Only the owner can perform upgrades (`onlyByOwner`)\\n     */\\n    function _authorizeUpgrade(address) internal view override onlyByOwner {\\n        // NOP\\n    }\\n\\n    /// @notice Allows the owner to call anything on behalf of the contract.\\n    /// @param _destination The destination of the call.\\n    /// @param _amount The value sent with the call.\\n    /// @param _data The data sent with the call.\\n    function executeOwnerProposal(address _destination, uint256 _amount, bytes memory _data) external onlyByOwner {\\n        (bool success, ) = _destination.call{value: _amount}(_data);\\n        if (!success) revert UnsuccessfulCall();\\n    }\\n\\n    /// @notice Changes the `owner` storage variable.\\n    /// @param _owner The new value for the `owner` storage variable.\\n    function changeOwner(address payable _owner) external onlyByOwner {\\n        owner = _owner;\\n    }\\n\\n    /// @notice Changes the `instructor` storage variable.\\n    /// @param _instructor The new value for the `instructor` storage variable.\\n    function changeInstructor(address _instructor) external onlyByOwnerOrInstructor {\\n        instructor = _instructor;\\n    }\\n\\n    /// @notice Changes the `pinakion` storage variable.\\n    /// @param _pinakion The new value for the `pinakion` storage variable.\\n    function changePinakion(IERC20 _pinakion) external onlyByOwner {\\n        pinakion = _pinakion;\\n    }\\n\\n    /// @notice Changes the `jurorProsecutionModule` storage variable.\\n    /// @param _jurorProsecutionModule The new value for the `jurorProsecutionModule` storage variable.\\n    function changeJurorProsecutionModule(address _jurorProsecutionModule) external onlyByOwner {\\n        jurorProsecutionModule = _jurorProsecutionModule;\\n    }\\n\\n    /// @notice Changes the `_sortitionModule` storage variable.\\n    /// Note that the new module should be initialized for all courts.\\n    /// @param _sortitionModule The new value for the `sortitionModule` storage variable.\\n    function changeSortitionModule(ISortitionModuleUniversity _sortitionModule) external onlyByOwner {\\n        sortitionModule = _sortitionModule;\\n    }\\n\\n    /// @notice Add a new supported dispute kit module to the court.\\n    /// @param _disputeKitAddress The address of the dispute kit contract.\\n    function addNewDisputeKit(IDisputeKit _disputeKitAddress) external onlyByOwner {\\n        uint256 disputeKitID = disputeKits.length;\\n        disputeKits.push(_disputeKitAddress);\\n        emit DisputeKitCreated(disputeKitID, _disputeKitAddress);\\n    }\\n\\n    /// @notice Creates a court under a specified parent court.\\n    /// @param _parent The `parent` property value of the court.\\n    /// @param _hiddenVotes The `hiddenVotes` property value of the court.\\n    /// @param _minStake The `minStake` property value of the court.\\n    /// @param _alpha The `alpha` property value of the court.\\n    /// @param _feeForJuror The `feeForJuror` property value of the court.\\n    /// @param _jurorsForCourtJump The `jurorsForCourtJump` property value of the court.\\n    /// @param _timesPerPeriod The `timesPerPeriod` property value of the court.\\n    /// @param _supportedDisputeKits Indexes of dispute kits that this court will support.\\n    function createCourt(\\n        uint96 _parent,\\n        bool _hiddenVotes,\\n        uint256 _minStake,\\n        uint256 _alpha,\\n        uint256 _feeForJuror,\\n        uint256 _jurorsForCourtJump,\\n        uint256[4] memory _timesPerPeriod,\\n        uint256[] memory _supportedDisputeKits\\n    ) external onlyByOwner {\\n        if (courts[_parent].minStake > _minStake) revert MinStakeLowerThanParentCourt();\\n        if (_supportedDisputeKits.length == 0) revert UnsupportedDisputeKit();\\n        if (_parent == FORKING_COURT) revert InvalidForkingCourtAsParent();\\n\\n        uint256 courtID = courts.length;\\n        Court storage court = courts.push();\\n\\n        for (uint256 i = 0; i < _supportedDisputeKits.length; i++) {\\n            if (_supportedDisputeKits[i] == 0 || _supportedDisputeKits[i] >= disputeKits.length) {\\n                revert WrongDisputeKitIndex();\\n            }\\n            court.supportedDisputeKits[_supportedDisputeKits[i]] = true;\\n        }\\n        // Check that Classic DK support was added.\\n        if (!court.supportedDisputeKits[DISPUTE_KIT_CLASSIC]) revert MustSupportDisputeKitClassic();\\n\\n        court.parent = _parent;\\n        court.children = new uint256[](0);\\n        court.hiddenVotes = _hiddenVotes;\\n        court.minStake = _minStake;\\n        court.alpha = _alpha;\\n        court.feeForJuror = _feeForJuror;\\n        court.jurorsForCourtJump = _jurorsForCourtJump;\\n        court.timesPerPeriod = _timesPerPeriod;\\n\\n        // Update the parent.\\n        courts[_parent].children.push(courtID);\\n        emit CourtCreated(\\n            uint96(courtID),\\n            _parent,\\n            _hiddenVotes,\\n            _minStake,\\n            _alpha,\\n            _feeForJuror,\\n            _jurorsForCourtJump,\\n            _timesPerPeriod,\\n            _supportedDisputeKits\\n        );\\n    }\\n\\n    function changeCourtParameters(\\n        uint96 _courtID,\\n        bool _hiddenVotes,\\n        uint256 _minStake,\\n        uint256 _alpha,\\n        uint256 _feeForJuror,\\n        uint256 _jurorsForCourtJump,\\n        uint256[4] memory _timesPerPeriod\\n    ) external onlyByOwner {\\n        Court storage court = courts[_courtID];\\n        if (_courtID != GENERAL_COURT && courts[court.parent].minStake > _minStake) {\\n            revert MinStakeLowerThanParentCourt();\\n        }\\n        for (uint256 i = 0; i < court.children.length; i++) {\\n            if (courts[court.children[i]].minStake < _minStake) {\\n                revert MinStakeLowerThanParentCourt();\\n            }\\n        }\\n        court.minStake = _minStake;\\n        court.hiddenVotes = _hiddenVotes;\\n        court.alpha = _alpha;\\n        court.feeForJuror = _feeForJuror;\\n        court.jurorsForCourtJump = _jurorsForCourtJump;\\n        court.timesPerPeriod = _timesPerPeriod;\\n        emit CourtModified(\\n            _courtID,\\n            _hiddenVotes,\\n            _minStake,\\n            _alpha,\\n            _feeForJuror,\\n            _jurorsForCourtJump,\\n            _timesPerPeriod\\n        );\\n    }\\n\\n    /// @notice Adds/removes court's support for specified dispute kits.\\n    /// @param _courtID The ID of the court.\\n    /// @param _disputeKitIDs The IDs of dispute kits which support should be added/removed.\\n    /// @param _enable Whether add or remove the dispute kits from the court.\\n    function enableDisputeKits(uint96 _courtID, uint256[] memory _disputeKitIDs, bool _enable) external onlyByOwner {\\n        for (uint256 i = 0; i < _disputeKitIDs.length; i++) {\\n            if (_enable) {\\n                if (_disputeKitIDs[i] == 0 || _disputeKitIDs[i] >= disputeKits.length) {\\n                    revert WrongDisputeKitIndex();\\n                }\\n                _enableDisputeKit(_courtID, _disputeKitIDs[i], true);\\n            } else {\\n                // Classic dispute kit must be supported by all courts.\\n                if (_disputeKitIDs[i] == DISPUTE_KIT_CLASSIC) {\\n                    revert CannotDisableClassicDK();\\n                }\\n                _enableDisputeKit(_courtID, _disputeKitIDs[i], false);\\n            }\\n        }\\n    }\\n\\n    /// @notice Changes the supported fee tokens.\\n    /// @param _feeToken The fee token.\\n    /// @param _accepted Whether the token is supported or not as a method of fee payment.\\n    function changeAcceptedFeeTokens(IERC20 _feeToken, bool _accepted) external onlyByOwner {\\n        currencyRates[_feeToken].feePaymentAccepted = _accepted;\\n        emit AcceptedFeeToken(_feeToken, _accepted);\\n    }\\n\\n    /// @notice Changes the currency rate of a fee token.\\n    /// @param _feeToken The fee token.\\n    /// @param _rateInEth The new rate of the fee token in ETH.\\n    /// @param _rateDecimals The new decimals of the fee token rate.\\n    function changeCurrencyRates(IERC20 _feeToken, uint64 _rateInEth, uint8 _rateDecimals) external onlyByOwner {\\n        currencyRates[_feeToken].rateInEth = _rateInEth;\\n        currencyRates[_feeToken].rateDecimals = _rateDecimals;\\n        emit NewCurrencyRate(_feeToken, _rateInEth, _rateDecimals);\\n    }\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @notice Sets the caller's stake in a court.\\n    /// @param _courtID The ID of the court.\\n    /// @param _newStake The new stake.\\n    /// Note that the existing delayed stake will be nullified as non-relevant.\\n    function setStake(uint96 _courtID, uint256 _newStake) external {\\n        _setStake(msg.sender, _courtID, _newStake, false, OnError.Revert);\\n    }\\n\\n    /// @notice Sets the stake of a specified account in a court, typically to apply a delayed stake or unstake inactive jurors.\\n    /// @param _account The account whose stake is being set.\\n    /// @param _courtID The ID of the court.\\n    /// @param _newStake The new stake.\\n    function setStakeBySortitionModule(address _account, uint96 _courtID, uint256 _newStake) external {\\n        if (msg.sender != address(sortitionModule)) revert SortitionModuleOnly();\\n        _setStake(_account, _courtID, _newStake, true, OnError.Return);\\n    }\\n\\n    /// @notice Transfers PNK to the juror by SortitionModule.\\n    /// @param _account The account of the juror whose PNK to transfer.\\n    /// @param _amount The amount to transfer.\\n    function transferBySortitionModule(address _account, uint256 _amount) external {\\n        if (msg.sender != address(sortitionModule)) revert SortitionModuleOnly();\\n        // Note eligibility is checked in SortitionModule.\\n        pinakion.safeTransfer(_account, _amount);\\n    }\\n\\n    /// @inheritdoc IArbitratorV2\\n    function createDispute(\\n        uint256 _numberOfChoices,\\n        bytes memory _extraData\\n    ) external payable override returns (uint256 disputeID) {\\n        if (msg.value < arbitrationCost(_extraData)) revert ArbitrationFeesNotEnough();\\n\\n        return _createDispute(_numberOfChoices, _extraData, NATIVE_CURRENCY, msg.value);\\n    }\\n\\n    /// @inheritdoc IArbitratorV2\\n    function createDispute(\\n        uint256 _numberOfChoices,\\n        bytes calldata _extraData,\\n        IERC20 _feeToken,\\n        uint256 _feeAmount\\n    ) external override returns (uint256 disputeID) {\\n        if (!currencyRates[_feeToken].feePaymentAccepted) revert TokenNotAccepted();\\n        if (_feeAmount < arbitrationCost(_extraData, _feeToken)) revert ArbitrationFeesNotEnough();\\n\\n        if (!_feeToken.safeTransferFrom(msg.sender, address(this), _feeAmount)) revert TransferFailed();\\n        return _createDispute(_numberOfChoices, _extraData, _feeToken, _feeAmount);\\n    }\\n\\n    function _createDispute(\\n        uint256 _numberOfChoices,\\n        bytes memory _extraData,\\n        IERC20 _feeToken,\\n        uint256 _feeAmount\\n    ) internal returns (uint256 disputeID) {\\n        (uint96 courtID, , uint256 disputeKitID) = _extraDataToCourtIDMinJurorsDisputeKit(_extraData);\\n        if (!courts[courtID].supportedDisputeKits[disputeKitID]) revert DisputeKitNotSupportedByCourt();\\n\\n        disputeID = disputes.length;\\n        Dispute storage dispute = disputes.push();\\n        dispute.courtID = courtID;\\n        dispute.arbitrated = IArbitrableV2(msg.sender);\\n        dispute.lastPeriodChange = block.timestamp;\\n\\n        IDisputeKit disputeKit = disputeKits[disputeKitID];\\n        Court storage court = courts[courtID];\\n        Round storage round = dispute.rounds.push();\\n\\n        // Obtain the feeForJuror in the same currency as the _feeAmount\\n        uint256 feeForJuror = (_feeToken == NATIVE_CURRENCY)\\n            ? court.feeForJuror\\n            : convertEthToTokenAmount(_feeToken, court.feeForJuror);\\n        round.nbVotes = _feeAmount / feeForJuror;\\n        round.disputeKitID = disputeKitID;\\n        round.pnkAtStakePerJuror = (court.minStake * court.alpha) / ONE_BASIS_POINT;\\n        round.totalFeesForJurors = _feeAmount;\\n        round.feeToken = IERC20(_feeToken);\\n\\n        sortitionModule.createDisputeHook(disputeID, 0); // Default round ID.\\n\\n        disputeKit.createDispute(disputeID, _numberOfChoices, _extraData, round.nbVotes);\\n        emit DisputeCreation(disputeID, IArbitrableV2(msg.sender));\\n    }\\n\\n    /// @notice Passes the period of a specified dispute.\\n    /// @param _disputeID The ID of the dispute.\\n    function passPeriod(uint256 _disputeID) external {\\n        Dispute storage dispute = disputes[_disputeID];\\n        Court storage court = courts[dispute.courtID];\\n\\n        uint256 currentRound = dispute.rounds.length - 1;\\n        Round storage round = dispute.rounds[currentRound];\\n        if (dispute.period == Period.evidence) {\\n            if (\\n                currentRound == 0 &&\\n                block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)]\\n            ) {\\n                revert EvidenceNotPassedAndNotAppeal();\\n            }\\n            if (round.drawnJurors.length != round.nbVotes) revert DisputeStillDrawing();\\n            dispute.period = court.hiddenVotes ? Period.commit : Period.vote;\\n        } else if (dispute.period == Period.commit) {\\n            if (\\n                block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)] &&\\n                !disputeKits[round.disputeKitID].areCommitsAllCast(_disputeID)\\n            ) {\\n                revert CommitPeriodNotPassed();\\n            }\\n            dispute.period = Period.vote;\\n        } else if (dispute.period == Period.vote) {\\n            if (\\n                block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)] &&\\n                !disputeKits[round.disputeKitID].areVotesAllCast(_disputeID)\\n            ) {\\n                revert VotePeriodNotPassed();\\n            }\\n            dispute.period = Period.appeal;\\n            emit AppealPossible(_disputeID, dispute.arbitrated);\\n        } else if (dispute.period == Period.appeal) {\\n            if (\\n                block.timestamp - dispute.lastPeriodChange < court.timesPerPeriod[uint256(dispute.period)] &&\\n                !disputeKits[round.disputeKitID].isAppealFunded(_disputeID)\\n            ) {\\n                revert AppealPeriodNotPassed();\\n            }\\n            dispute.period = Period.execution;\\n        } else if (dispute.period == Period.execution) {\\n            revert DisputePeriodIsFinal();\\n        }\\n\\n        dispute.lastPeriodChange = block.timestamp;\\n        emit NewPeriod(_disputeID, dispute.period);\\n    }\\n\\n    /// @notice Draws one juror for the dispute until the number votes paid for is reached.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _juror The address of the juror to draw.\\n    function draw(uint256 _disputeID, address _juror) external onlyByOwnerOrInstructor {\\n        Dispute storage dispute = disputes[_disputeID];\\n        uint256 currentRound = dispute.rounds.length - 1;\\n        Round storage round = dispute.rounds[currentRound];\\n        if (dispute.period != Period.evidence) revert NotEvidencePeriod();\\n        if (round.drawnJurors.length >= round.nbVotes) revert AllJurorsDrawn();\\n\\n        sortitionModule.setTransientJuror(_juror);\\n        {\\n            IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n            uint256 iteration = round.drawIterations + 1;\\n            (address drawnAddress, uint96 fromSubcourtID) = disputeKit.draw(_disputeID, iteration);\\n            if (drawnAddress == address(0)) {\\n                revert NoJurorDrawn();\\n            }\\n            sortitionModule.lockStake(drawnAddress, round.pnkAtStakePerJuror);\\n            emit Draw(drawnAddress, _disputeID, currentRound, round.drawnJurors.length);\\n            round.drawnJurors.push(drawnAddress);\\n            round.drawnJurorFromCourtIDs.push(fromSubcourtID != 0 ? fromSubcourtID : dispute.courtID);\\n            if (round.drawnJurors.length == round.nbVotes) {\\n                sortitionModule.postDrawHook(_disputeID, currentRound);\\n            }\\n            round.drawIterations = iteration;\\n        }\\n        sortitionModule.setTransientJuror(address(0));\\n    }\\n\\n    /// @notice Appeals the ruling of a specified dispute.\\n    /// @dev Access restricted to the Dispute Kit for this `disputeID`.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _numberOfChoices Number of choices for the dispute. Can be required during court jump.\\n    /// @param _extraData Extradata for the dispute. Can be required during court jump.\\n    function appeal(uint256 _disputeID, uint256 _numberOfChoices, bytes memory _extraData) external payable {\\n        if (msg.value < appealCost(_disputeID)) revert AppealFeesNotEnough();\\n\\n        Dispute storage dispute = disputes[_disputeID];\\n        if (dispute.period != Period.appeal) revert DisputeNotAppealable();\\n\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        if (msg.sender != address(disputeKits[round.disputeKitID])) revert DisputeKitOnly();\\n\\n        uint96 newCourtID = dispute.courtID;\\n        uint256 newDisputeKitID = round.disputeKitID;\\n\\n        // Warning: the extra round must be created before calling disputeKit.createDispute()\\n        Round storage extraRound = dispute.rounds.push();\\n\\n        if (round.nbVotes >= courts[newCourtID].jurorsForCourtJump) {\\n            // Jump to parent court.\\n            newCourtID = courts[newCourtID].parent;\\n\\n            if (!courts[newCourtID].supportedDisputeKits[newDisputeKitID]) {\\n                // Switch to classic dispute kit if parent court doesn't support the current one.\\n                newDisputeKitID = DISPUTE_KIT_CLASSIC;\\n            }\\n\\n            if (newCourtID != dispute.courtID) {\\n                emit CourtJump(_disputeID, dispute.rounds.length - 1, dispute.courtID, newCourtID);\\n            }\\n        }\\n\\n        dispute.courtID = newCourtID;\\n        dispute.period = Period.evidence;\\n        dispute.lastPeriodChange = block.timestamp;\\n\\n        Court storage court = courts[newCourtID];\\n        extraRound.nbVotes = msg.value / court.feeForJuror; // As many votes that can be afforded by the provided funds.\\n        extraRound.pnkAtStakePerJuror = (court.minStake * court.alpha) / ONE_BASIS_POINT;\\n        extraRound.totalFeesForJurors = msg.value;\\n        extraRound.disputeKitID = newDisputeKitID;\\n\\n        sortitionModule.createDisputeHook(_disputeID, dispute.rounds.length - 1);\\n\\n        // Dispute kit was changed, so create a dispute in the new DK contract.\\n        if (extraRound.disputeKitID != round.disputeKitID) {\\n            emit DisputeKitJump(_disputeID, dispute.rounds.length - 1, round.disputeKitID, extraRound.disputeKitID);\\n            disputeKits[extraRound.disputeKitID].createDispute(\\n                _disputeID,\\n                _numberOfChoices,\\n                _extraData,\\n                extraRound.nbVotes\\n            );\\n        }\\n\\n        emit AppealDecision(_disputeID, dispute.arbitrated);\\n        emit NewPeriod(_disputeID, Period.evidence);\\n    }\\n\\n    /// @notice Distribute the PNKs at stake and the dispute fees for the specific round of the dispute. Can be called in parts.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _round The appeal round.\\n    /// @param _iterations The number of iterations to run.\\n    function execute(uint256 _disputeID, uint256 _round, uint256 _iterations) external {\\n        Round storage round;\\n        {\\n            Dispute storage dispute = disputes[_disputeID];\\n            if (dispute.period != Period.execution) revert NotExecutionPeriod();\\n\\n            round = dispute.rounds[_round];\\n        } // stack too deep workaround\\n\\n        uint256 start = round.repartitions;\\n        uint256 end = round.repartitions + _iterations;\\n\\n        uint256 pnkPenaltiesInRound = round.pnkPenalties; // Keep in memory to save gas.\\n        uint256 numberOfVotesInRound = round.drawnJurors.length;\\n        uint256 feePerJurorInRound = round.totalFeesForJurors / numberOfVotesInRound;\\n        uint256 pnkAtStakePerJurorInRound = round.pnkAtStakePerJuror;\\n        uint256 coherentCount;\\n        {\\n            IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n            coherentCount = disputeKit.getCoherentCount(_disputeID, _round); // Total number of jurors that are eligible to a reward in this round.\\n        } // stack too deep workaround\\n\\n        if (coherentCount == 0) {\\n            // We loop over the votes once as there are no rewards because it is not a tie and no one in this round is coherent with the final outcome.\\n            if (end > numberOfVotesInRound) end = numberOfVotesInRound;\\n        } else {\\n            // We loop over the votes twice, first to collect the PNK penalties, and second to distribute them as rewards along with arbitration fees.\\n            if (end > numberOfVotesInRound * 2) end = numberOfVotesInRound * 2;\\n        }\\n        round.repartitions = end;\\n\\n        for (uint256 i = start; i < end; i++) {\\n            if (i < numberOfVotesInRound) {\\n                pnkPenaltiesInRound = _executePenalties(\\n                    ExecuteParams({\\n                        disputeID: _disputeID,\\n                        round: _round,\\n                        coherentCount: coherentCount,\\n                        numberOfVotesInRound: numberOfVotesInRound,\\n                        feePerJurorInRound: feePerJurorInRound,\\n                        pnkAtStakePerJurorInRound: pnkAtStakePerJurorInRound,\\n                        pnkPenaltiesInRound: pnkPenaltiesInRound,\\n                        repartition: i\\n                    })\\n                );\\n            } else {\\n                _executeRewards(\\n                    ExecuteParams({\\n                        disputeID: _disputeID,\\n                        round: _round,\\n                        coherentCount: coherentCount,\\n                        numberOfVotesInRound: numberOfVotesInRound,\\n                        feePerJurorInRound: feePerJurorInRound,\\n                        pnkAtStakePerJurorInRound: pnkAtStakePerJurorInRound,\\n                        pnkPenaltiesInRound: pnkPenaltiesInRound,\\n                        repartition: i\\n                    })\\n                );\\n            }\\n        }\\n        if (round.pnkPenalties != pnkPenaltiesInRound) {\\n            round.pnkPenalties = pnkPenaltiesInRound; // Reentrancy risk: breaks Check-Effect-Interact\\n        }\\n    }\\n\\n    /// @notice Distribute the PNKs at stake and the dispute fees for the specific round of the dispute, penalties only.\\n    /// @param _params The parameters for the execution, see `ExecuteParams`.\\n    /// @return pnkPenaltiesInRoundCache The updated penalties in round cache.\\n    function _executePenalties(ExecuteParams memory _params) internal returns (uint256) {\\n        Dispute storage dispute = disputes[_params.disputeID];\\n        Round storage round = dispute.rounds[_params.round];\\n        IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n\\n        // [0, 1] value that determines how coherent the juror was in this round, in basis points.\\n        uint256 coherence = disputeKit.getDegreeOfCoherencePenalty(\\n            _params.disputeID,\\n            _params.round,\\n            _params.repartition,\\n            _params.feePerJurorInRound,\\n            _params.pnkAtStakePerJurorInRound\\n        );\\n\\n        // Guard against degree exceeding 1, though it should be ensured by the dispute kit.\\n        if (coherence > ONE_BASIS_POINT) {\\n            coherence = ONE_BASIS_POINT;\\n        }\\n\\n        // Fully coherent jurors won't be penalized.\\n        uint256 penalty = (round.pnkAtStakePerJuror * (ONE_BASIS_POINT - coherence)) / ONE_BASIS_POINT;\\n\\n        // Unlock the PNKs affected by the penalty\\n        address account = round.drawnJurors[_params.repartition];\\n        sortitionModule.unlockStake(account, penalty);\\n\\n        // Apply the penalty to the staked PNKs.\\n        uint96 penalizedInCourtID = round.drawnJurorFromCourtIDs[_params.repartition];\\n        (uint256 pnkBalance, uint256 newCourtStake, uint256 availablePenalty) = sortitionModule.setStakePenalty(\\n            account,\\n            penalizedInCourtID,\\n            penalty\\n        );\\n        _params.pnkPenaltiesInRound += availablePenalty;\\n        emit JurorRewardPenalty(\\n            account,\\n            _params.disputeID,\\n            _params.round,\\n            coherence,\\n            coherence,\\n            -int256(availablePenalty),\\n            0,\\n            round.feeToken\\n        );\\n\\n        if (pnkBalance == 0 || !disputeKit.isVoteActive(_params.disputeID, _params.round, _params.repartition)) {\\n            // The juror is inactive or their balance is can't cover penalties anymore, unstake them from all courts.\\n            sortitionModule.forcedUnstakeAllCourts(account);\\n        } else if (newCourtStake < courts[penalizedInCourtID].minStake) {\\n            // The juror's balance fell below the court minStake, unstake them from the court.\\n            sortitionModule.forcedUnstake(account, penalizedInCourtID);\\n        }\\n\\n        if (_params.repartition == _params.numberOfVotesInRound - 1 && _params.coherentCount == 0) {\\n            // No one was coherent, send the rewards to the owner.\\n            if (round.feeToken == NATIVE_CURRENCY) {\\n                // The dispute fees were paid in ETH\\n                payable(owner).send(round.totalFeesForJurors);\\n            } else {\\n                // The dispute fees were paid in ERC20\\n                round.feeToken.safeTransfer(owner, round.totalFeesForJurors);\\n            }\\n            pinakion.safeTransfer(owner, _params.pnkPenaltiesInRound);\\n            emit LeftoverRewardSent(\\n                _params.disputeID,\\n                _params.round,\\n                _params.pnkPenaltiesInRound,\\n                round.totalFeesForJurors,\\n                round.feeToken\\n            );\\n        }\\n        return _params.pnkPenaltiesInRound;\\n    }\\n\\n    /// @notice Distribute the PNKs at stake and the dispute fees for the specific round of the dispute, rewards only.\\n    /// @param _params The parameters for the execution, see `ExecuteParams`.\\n    function _executeRewards(ExecuteParams memory _params) internal {\\n        Dispute storage dispute = disputes[_params.disputeID];\\n        Round storage round = dispute.rounds[_params.round];\\n        IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n\\n        // [0, 1] value that determines how coherent the juror was in this round, in basis points.\\n        (uint256 pnkCoherence, uint256 feeCoherence) = disputeKit.getDegreeOfCoherenceReward(\\n            _params.disputeID,\\n            _params.round,\\n            _params.repartition % _params.numberOfVotesInRound,\\n            _params.feePerJurorInRound,\\n            _params.pnkAtStakePerJurorInRound\\n        );\\n\\n        // Guard against degree exceeding 1, though it should be ensured by the dispute kit.\\n        if (pnkCoherence > ONE_BASIS_POINT) {\\n            pnkCoherence = ONE_BASIS_POINT;\\n        }\\n        if (feeCoherence > ONE_BASIS_POINT) {\\n            feeCoherence = ONE_BASIS_POINT;\\n        }\\n\\n        address account = round.drawnJurors[_params.repartition % _params.numberOfVotesInRound];\\n        uint256 pnkLocked = (round.pnkAtStakePerJuror * pnkCoherence) / ONE_BASIS_POINT;\\n\\n        // Release the rest of the PNKs of the juror for this round.\\n        sortitionModule.unlockStake(account, pnkLocked);\\n\\n        // Compute the rewards\\n        uint256 pnkReward = ((_params.pnkPenaltiesInRound / _params.coherentCount) * pnkCoherence) / ONE_BASIS_POINT; /// forge-lint: disable-line(divide-before-multiply)\\n        round.sumPnkRewardPaid += pnkReward;\\n        uint256 feeReward = ((round.totalFeesForJurors / _params.coherentCount) * feeCoherence) / ONE_BASIS_POINT; /// forge-lint: disable-line(divide-before-multiply)\\n        round.sumFeeRewardPaid += feeReward;\\n\\n        // Transfer the fee reward\\n        if (round.feeToken == NATIVE_CURRENCY) {\\n            // The dispute fees were paid in ETH\\n            payable(account).send(feeReward);\\n        } else {\\n            // The dispute fees were paid in ERC20\\n            round.feeToken.safeTransfer(account, feeReward);\\n        }\\n\\n        // Stake the PNK reward if possible, by-passes delayed stakes and other checks usually done by validateStake()\\n        if (!sortitionModule.setStakeReward(account, dispute.courtID, pnkReward)) {\\n            pinakion.safeTransfer(account, pnkReward);\\n        }\\n\\n        emit JurorRewardPenalty(\\n            account,\\n            _params.disputeID,\\n            _params.round,\\n            pnkCoherence,\\n            feeCoherence,\\n            int256(pnkReward),\\n            int256(feeReward),\\n            round.feeToken\\n        );\\n\\n        // Transfer any residual rewards to the owner. It may happen due to partial coherence of the jurors.\\n        if (_params.repartition == _params.numberOfVotesInRound * 2 - 1) {\\n            uint256 leftoverPnkReward = _params.pnkPenaltiesInRound - round.sumPnkRewardPaid;\\n            uint256 leftoverFeeReward = round.totalFeesForJurors - round.sumFeeRewardPaid;\\n            if (leftoverPnkReward != 0 || leftoverFeeReward != 0) {\\n                if (leftoverPnkReward != 0) {\\n                    pinakion.safeTransfer(owner, leftoverPnkReward);\\n                }\\n                if (leftoverFeeReward != 0) {\\n                    if (round.feeToken == NATIVE_CURRENCY) {\\n                        // The dispute fees were paid in ETH\\n                        payable(owner).send(leftoverFeeReward);\\n                    } else {\\n                        // The dispute fees were paid in ERC20\\n                        round.feeToken.safeTransfer(owner, leftoverFeeReward);\\n                    }\\n                }\\n                emit LeftoverRewardSent(\\n                    _params.disputeID,\\n                    _params.round,\\n                    leftoverPnkReward,\\n                    leftoverFeeReward,\\n                    round.feeToken\\n                );\\n            }\\n        }\\n    }\\n\\n    /// @notice Executes a specified dispute's ruling.\\n    /// @param _disputeID The ID of the dispute.\\n    function executeRuling(uint256 _disputeID) external {\\n        Dispute storage dispute = disputes[_disputeID];\\n        if (dispute.period != Period.execution) revert NotExecutionPeriod();\\n        if (dispute.ruled) revert RulingAlreadyExecuted();\\n\\n        (uint256 winningChoice, , ) = currentRuling(_disputeID);\\n        dispute.ruled = true;\\n        emit Ruling(dispute.arbitrated, _disputeID, winningChoice);\\n        dispute.arbitrated.rule(_disputeID, winningChoice);\\n    }\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /// @inheritdoc IArbitratorV2\\n    function arbitrationCost(bytes memory _extraData) public view override returns (uint256 cost) {\\n        (uint96 courtID, uint256 minJurors, ) = _extraDataToCourtIDMinJurorsDisputeKit(_extraData);\\n        cost = courts[courtID].feeForJuror * minJurors;\\n    }\\n\\n    /// @inheritdoc IArbitratorV2\\n    function arbitrationCost(bytes calldata _extraData, IERC20 _feeToken) public view override returns (uint256 cost) {\\n        cost = convertEthToTokenAmount(_feeToken, arbitrationCost(_extraData));\\n    }\\n\\n    /// @notice Gets the cost of appealing a specified dispute.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return cost The appeal cost.\\n    function appealCost(uint256 _disputeID) public view returns (uint256 cost) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        Court storage court = courts[dispute.courtID];\\n        if (round.nbVotes >= court.jurorsForCourtJump) {\\n            // Jump to parent court.\\n            if (dispute.courtID == GENERAL_COURT) {\\n                // TODO: Handle the forking when appealed in General court.\\n                cost = NON_PAYABLE_AMOUNT; // Get the cost of the parent court.\\n            } else {\\n                cost = courts[court.parent].feeForJuror * ((round.nbVotes * 2) + 1);\\n            }\\n        } else {\\n            // Stay in current court.\\n            cost = court.feeForJuror * ((round.nbVotes * 2) + 1);\\n        }\\n    }\\n\\n    /// @notice Gets the start and the end of a specified dispute's current appeal period.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return start The start of the appeal period.\\n    /// @return end The end of the appeal period.\\n    function appealPeriod(uint256 _disputeID) public view returns (uint256 start, uint256 end) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        if (dispute.period == Period.appeal) {\\n            start = dispute.lastPeriodChange;\\n            end = dispute.lastPeriodChange + courts[dispute.courtID].timesPerPeriod[uint256(Period.appeal)];\\n        } else {\\n            start = 0;\\n            end = 0;\\n        }\\n    }\\n\\n    /// @inheritdoc IArbitratorV2\\n    function currentRuling(uint256 _disputeID) public view returns (uint256 ruling, bool tied, bool overridden) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        IDisputeKit disputeKit = disputeKits[round.disputeKitID];\\n        (ruling, tied, overridden) = disputeKit.currentRuling(_disputeID);\\n    }\\n\\n    /// @notice Gets the round info for a specified dispute and round.\\n    /// @dev This function must not be called from a non-view function because it returns a dynamic array which might be very large, theoretically exceeding the block gas limit.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _round The round to get the info for.\\n    /// @return round The round info.\\n    function getRoundInfo(uint256 _disputeID, uint256 _round) external view returns (Round memory) {\\n        return disputes[_disputeID].rounds[_round];\\n    }\\n\\n    /// @notice Gets the PNK at stake per juror for a specified dispute and round.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @param _round The round to get the info for.\\n    /// @return pnkAtStakePerJuror The PNK at stake per juror.\\n    function getPnkAtStakePerJuror(uint256 _disputeID, uint256 _round) external view returns (uint256) {\\n        return disputes[_disputeID].rounds[_round].pnkAtStakePerJuror;\\n    }\\n\\n    /// @notice Gets the number of rounds for a specified dispute.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return The number of rounds.\\n    function getNumberOfRounds(uint256 _disputeID) external view returns (uint256) {\\n        return disputes[_disputeID].rounds.length;\\n    }\\n\\n    /// @notice Checks if a given dispute kit is supported by a given court.\\n    /// @param _courtID The ID of the court to check the support for.\\n    /// @param _disputeKitID The ID of the dispute kit to check the support for.\\n    /// @return Whether the dispute kit is supported or not.\\n    function isSupported(uint96 _courtID, uint256 _disputeKitID) external view returns (bool) {\\n        return courts[_courtID].supportedDisputeKits[_disputeKitID];\\n    }\\n\\n    /// @notice Gets the timesPerPeriod array for a given court.\\n    /// @param _courtID The ID of the court to get the times from.\\n    /// @return timesPerPeriod The timesPerPeriod array for the given court.\\n    function getTimesPerPeriod(uint96 _courtID) external view returns (uint256[4] memory timesPerPeriod) {\\n        timesPerPeriod = courts[_courtID].timesPerPeriod;\\n    }\\n\\n    // ************************************* //\\n    // *   Public Views for Dispute Kits   * //\\n    // ************************************* //\\n\\n    /// @notice Gets the number of votes permitted for the specified dispute in the latest round.\\n    /// @param _disputeID The ID of the dispute.\\n    function getNumberOfVotes(uint256 _disputeID) external view returns (uint256) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        return dispute.rounds[dispute.rounds.length - 1].nbVotes;\\n    }\\n\\n    /// @notice Returns true if the dispute kit will be switched to a parent DK.\\n    /// @param _disputeID The ID of the dispute.\\n    /// @return Whether DK will be switched or not.\\n    function isDisputeKitJumping(uint256 _disputeID) external view returns (bool) {\\n        Dispute storage dispute = disputes[_disputeID];\\n        Round storage round = dispute.rounds[dispute.rounds.length - 1];\\n        Court storage court = courts[dispute.courtID];\\n\\n        if (round.nbVotes < court.jurorsForCourtJump) {\\n            return false;\\n        }\\n\\n        // Jump if the parent court doesn't support the current DK.\\n        return !courts[court.parent].supportedDisputeKits[round.disputeKitID];\\n    }\\n\\n    function getDisputeKitsLength() external view returns (uint256) {\\n        return disputeKits.length;\\n    }\\n\\n    function convertEthToTokenAmount(IERC20 _toToken, uint256 _amountInEth) public view returns (uint256) {\\n        return (_amountInEth * 10 ** currencyRates[_toToken].rateDecimals) / currencyRates[_toToken].rateInEth;\\n    }\\n\\n    // ************************************* //\\n    // *            Internal               * //\\n    // ************************************* //\\n\\n    /// @notice Toggles the dispute kit support for a given court.\\n    /// @param _courtID The ID of the court to toggle the support for.\\n    /// @param _disputeKitID The ID of the dispute kit to toggle the support for.\\n    /// @param _enable Whether to enable or disable the support. Note that classic dispute kit should always be enabled.\\n    function _enableDisputeKit(uint96 _courtID, uint256 _disputeKitID, bool _enable) internal {\\n        courts[_courtID].supportedDisputeKits[_disputeKitID] = _enable;\\n        emit DisputeKitEnabled(_courtID, _disputeKitID, _enable);\\n    }\\n\\n    /// @notice If called only once then set _onError to Revert, otherwise set it to Return\\n    /// @param _account The account to set the stake for.\\n    /// @param _courtID The ID of the court to set the stake for.\\n    /// @param _newStake The new stake.\\n    /// @param _noDelay True if the stake change should not be delayed.\\n    /// @param _onError Whether to revert or return false on error.\\n    /// @return Whether the stake was successfully set or not.\\n    function _setStake(\\n        address _account,\\n        uint96 _courtID,\\n        uint256 _newStake,\\n        bool _noDelay,\\n        OnError _onError\\n    ) internal returns (bool) {\\n        if (_courtID == FORKING_COURT || _courtID >= courts.length) {\\n            _stakingFailed(_onError, StakingResult.CannotStakeInThisCourt); // Staking directly into the forking court is not allowed.\\n            return false;\\n        }\\n        if (_newStake != 0 && _newStake < courts[_courtID].minStake) {\\n            _stakingFailed(_onError, StakingResult.CannotStakeLessThanMinStake); // Staking less than the minimum stake is not allowed.\\n            return false;\\n        }\\n        (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult) = sortitionModule.validateStake(\\n            _account,\\n            _courtID,\\n            _newStake,\\n            _noDelay\\n        );\\n        if (stakingResult != StakingResult.Successful) {\\n            _stakingFailed(_onError, stakingResult);\\n            return false;\\n        }\\n        if (pnkDeposit > 0) {\\n            if (!pinakion.safeTransferFrom(_account, address(this), pnkDeposit)) {\\n                _stakingFailed(_onError, StakingResult.StakingTransferFailed);\\n                return false;\\n            }\\n        }\\n        if (pnkWithdrawal > 0) {\\n            if (!pinakion.safeTransfer(_account, pnkWithdrawal)) {\\n                _stakingFailed(_onError, StakingResult.UnstakingTransferFailed);\\n                return false;\\n            }\\n        }\\n        sortitionModule.setStake(_account, _courtID, pnkDeposit, pnkWithdrawal, _newStake);\\n\\n        return true;\\n    }\\n\\n    /// @notice It may revert depending on the _onError parameter.\\n    function _stakingFailed(OnError _onError, StakingResult _result) internal pure virtual {\\n        if (_onError == OnError.Return) return;\\n        if (_result == StakingResult.StakingTransferFailed) revert StakingTransferFailed();\\n        if (_result == StakingResult.UnstakingTransferFailed) revert UnstakingTransferFailed();\\n        if (_result == StakingResult.CannotStakeInMoreCourts) revert StakingInTooManyCourts();\\n        if (_result == StakingResult.CannotStakeInThisCourt) revert StakingNotPossibleInThisCourt();\\n        if (_result == StakingResult.CannotStakeLessThanMinStake) revert StakingLessThanCourtMinStake();\\n        if (_result == StakingResult.CannotStakeZeroWhenNoStake) revert StakingZeroWhenNoStake();\\n    }\\n\\n    /// @notice Gets a court ID, the minimum number of jurors and an ID of a dispute kit from a specified extra data bytes array.\\n    /// @dev If `_extraData` contains an incorrect value then this value will be switched to default.\\n    /// @param _extraData The extra data bytes array. The first 32 bytes are the court ID, the next are the minimum number of jurors and the last are the dispute kit ID.\\n    /// @return courtID The court ID.\\n    /// @return minJurors The minimum number of jurors required.\\n    /// @return disputeKitID The ID of the dispute kit.\\n    function _extraDataToCourtIDMinJurorsDisputeKit(\\n        bytes memory _extraData\\n    ) internal view returns (uint96 courtID, uint256 minJurors, uint256 disputeKitID) {\\n        // Note that if the extradata doesn't contain 32 bytes for the dispute kit ID it'll return the default 0 index.\\n        if (_extraData.length >= 64) {\\n            assembly {\\n                // solium-disable-line security/no-inline-assembly\\n                courtID := mload(add(_extraData, 0x20))\\n                minJurors := mload(add(_extraData, 0x40))\\n                disputeKitID := mload(add(_extraData, 0x60))\\n            }\\n            if (courtID == FORKING_COURT || courtID >= courts.length) {\\n                courtID = GENERAL_COURT;\\n            }\\n            if (minJurors == 0) {\\n                minJurors = DEFAULT_NB_OF_JURORS;\\n            }\\n            if (disputeKitID == NULL_DISPUTE_KIT || disputeKitID >= disputeKits.length) {\\n                disputeKitID = DISPUTE_KIT_CLASSIC; // 0 index is not used.\\n            }\\n        } else {\\n            courtID = GENERAL_COURT;\\n            minJurors = DEFAULT_NB_OF_JURORS;\\n            disputeKitID = DISPUTE_KIT_CLASSIC;\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *              Errors               * //\\n    // ************************************* //\\n\\n    error OwnerOnly();\\n    error InstructorOnly();\\n    error OwnerOrInstructorOnly();\\n    error DisputeKitOnly();\\n    error SortitionModuleOnly();\\n    error UnsuccessfulCall();\\n    error InvalidDisputKitParent();\\n    error MinStakeLowerThanParentCourt();\\n    error UnsupportedDisputeKit();\\n    error InvalidForkingCourtAsParent();\\n    error WrongDisputeKitIndex();\\n    error CannotDisableClassicDK();\\n    error StakingInTooManyCourts();\\n    error StakingNotPossibleInThisCourt();\\n    error StakingLessThanCourtMinStake();\\n    error StakingTransferFailed();\\n    error UnstakingTransferFailed();\\n    error ArbitrationFeesNotEnough();\\n    error DisputeKitNotSupportedByCourt();\\n    error MustSupportDisputeKitClassic();\\n    error TokenNotAccepted();\\n    error EvidenceNotPassedAndNotAppeal();\\n    error DisputeStillDrawing();\\n    error CommitPeriodNotPassed();\\n    error VotePeriodNotPassed();\\n    error AppealPeriodNotPassed();\\n    error NotEvidencePeriod();\\n    error AppealFeesNotEnough();\\n    error DisputeNotAppealable();\\n    error NotExecutionPeriod();\\n    error RulingAlreadyExecuted();\\n    error DisputePeriodIsFinal();\\n    error TransferFailed();\\n    error AllJurorsDrawn();\\n    error NoJurorDrawn();\\n    error StakingZeroWhenNoStake();\\n}\\n\",\"keccak256\":\"0x6a0daf9a8720b0618dc69c8b29794fad12f5477d4ec96c778c7c140150b8214d\",\"license\":\"MIT\"},\"src/arbitration/university/SortitionModuleUniversity.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\nimport \\\"./KlerosCoreUniversity.sol\\\";\\nimport \\\"./ISortitionModuleUniversity.sol\\\";\\nimport \\\"../interfaces/IDisputeKit.sol\\\";\\nimport \\\"../../proxy/UUPSProxiable.sol\\\";\\nimport \\\"../../proxy/Initializable.sol\\\";\\nimport \\\"../../libraries/Constants.sol\\\";\\n\\n/// @title SortitionModuleUniversity\\n/// @notice An adapted version of the SortitionModule contract for educational purposes.\\ncontract SortitionModuleUniversity is ISortitionModuleUniversity, UUPSProxiable, Initializable {\\n    string public constant override version = \\\"2.0.0\\\";\\n\\n    // ************************************* //\\n    // *         Enums / Structs           * //\\n    // ************************************* //\\n\\n    struct Juror {\\n        mapping(uint96 => uint256) stakesByCourtID; // The stakes of the juror in particular courts.\\n        uint96[] courtIDs; // The IDs of courts where the juror's stake path ends. A stake path is a path from the general court to a court the juror directly staked in using `_setStake`.\\n        uint256 stakedPnk; // The juror's total amount of tokens staked in subcourts. Reflects actual pnk balance.\\n        uint256 lockedPnk; // The juror's total amount of tokens locked in disputes. Can reflect actual pnk balance when stakedPnk are fully withdrawn.\\n    }\\n\\n    // ************************************* //\\n    // *             Storage               * //\\n    // ************************************* //\\n\\n    address public owner; // The owner of the contract.\\n    KlerosCoreUniversity public core; // The core arbitrator contract.\\n    uint256 public disputesWithoutJurors; // The number of disputes that have not finished drawing jurors.\\n    mapping(address account => Juror) public jurors; // The jurors.\\n    address private transientJuror; // The juror address used between calls within the same transaction.\\n\\n    // ************************************* //\\n    // *              Events               * //\\n    // ************************************* //\\n\\n    /// @notice Emitted when a juror stakes in a court.\\n    /// @param _address The address of the juror.\\n    /// @param _courtID The ID of the court.\\n    /// @param _amount The amount of tokens staked in the court.\\n    /// @param _amountAllCourts The amount of tokens staked in all courts.\\n    event StakeSet(address indexed _address, uint256 _courtID, uint256 _amount, uint256 _amountAllCourts);\\n\\n    /// @notice Emitted when a juror's stake is locked.\\n    /// @param _address The address of the juror.\\n    /// @param _relativeAmount The amount of tokens locked.\\n    /// @param _unlock Whether the stake is locked or unlocked.\\n    event StakeLocked(address indexed _address, uint256 _relativeAmount, bool _unlock);\\n\\n    /// @notice Emitted when leftover PNK is available.\\n    /// @param _account The account of the juror.\\n    /// @param _amount The amount of PNK available.\\n    event LeftoverPNK(address indexed _account, uint256 _amount);\\n\\n    /// @notice Emitted when leftover PNK is withdrawn.\\n    /// @param _account The account of the juror withdrawing PNK.\\n    /// @param _amount The amount of PNK withdrawn.\\n    event LeftoverPNKWithdrawn(address indexed _account, uint256 _amount);\\n\\n    // ************************************* //\\n    // *        Function Modifiers         * //\\n    // ************************************* //\\n\\n    modifier onlyByOwner() {\\n        if (owner != msg.sender) revert OwnerOnly();\\n        _;\\n    }\\n\\n    modifier onlyByCore() {\\n        if (address(core) != msg.sender) revert KlerosCoreOnly();\\n        _;\\n    }\\n\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    /// @custom:oz-upgrades-unsafe-allow constructor\\n    constructor() {\\n        _disableInitializers();\\n    }\\n\\n    /// @notice Initializer (constructor equivalent for upgradable contracts).\\n    /// @param _core The KlerosCore.\\n    function initialize(address _owner, KlerosCoreUniversity _core) external initializer {\\n        owner = _owner;\\n        core = _core;\\n    }\\n\\n    // ************************************* //\\n    // *             Governance            * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Access Control to perform implementation upgrades (UUPS Proxiable)\\n     * @dev Only the owner can perform upgrades (`onlyByOwner`)\\n     */\\n    function _authorizeUpgrade(address) internal view override onlyByOwner {\\n        // NOP\\n    }\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @inheritdoc ISortitionModule\\n    function passPhase() external override onlyByCore {\\n        // NOP\\n    }\\n\\n    /// @inheritdoc ISortitionModule\\n    function executeDelayedStakes(uint256 _iterations) external override onlyByCore {\\n        // NOP\\n    }\\n\\n    /// @inheritdoc ISortitionModuleUniversity\\n    function setTransientJuror(address _juror) external override onlyByCore {\\n        transientJuror = _juror;\\n    }\\n\\n    /// @inheritdoc ISortitionModule\\n    function createTree(uint96 _courtID, bytes memory _extraData) external {\\n        // NOP\\n    }\\n\\n    /// @inheritdoc ISortitionModule\\n    function createDisputeHook(uint256 /*_disputeID*/, uint256 /*_roundID*/) external override onlyByCore {\\n        disputesWithoutJurors++;\\n    }\\n\\n    /// @inheritdoc ISortitionModule\\n    function postDrawHook(uint256 /*_disputeID*/, uint256 /*_roundID*/) external override onlyByCore {\\n        disputesWithoutJurors--;\\n    }\\n\\n    /// @inheritdoc ISortitionModule\\n    function validateStake(\\n        address _account,\\n        uint96 _courtID,\\n        uint256 _newStake,\\n        bool /*_noDelay*/\\n    )\\n        external\\n        view\\n        override\\n        onlyByCore\\n        returns (uint256 pnkDeposit, uint256 pnkWithdrawal, StakingResult stakingResult)\\n    {\\n        Juror storage juror = jurors[_account];\\n        uint256 currentStake = _stakeOf(_account, _courtID);\\n\\n        uint256 nbCourts = juror.courtIDs.length;\\n        if (currentStake == 0 && nbCourts >= MAX_STAKE_PATHS) {\\n            return (0, 0, StakingResult.CannotStakeInMoreCourts); // Prevent staking beyond MAX_STAKE_PATHS but unstaking is always allowed.\\n        }\\n\\n        if (currentStake == 0 && _newStake == 0) {\\n            return (0, 0, StakingResult.CannotStakeZeroWhenNoStake); // Forbid staking 0 amount when current stake is 0 to avoid flaky behaviour.\\n        }\\n\\n        if (_newStake >= currentStake) {\\n            pnkDeposit = _newStake - currentStake;\\n        } else {\\n            pnkWithdrawal = currentStake - _newStake;\\n            // Ensure locked tokens remain in the contract. They can only be released during Execution.\\n            uint256 possibleWithdrawal = juror.stakedPnk > juror.lockedPnk ? juror.stakedPnk - juror.lockedPnk : 0;\\n            if (pnkWithdrawal > possibleWithdrawal) {\\n                pnkWithdrawal = possibleWithdrawal;\\n            }\\n        }\\n        return (pnkDeposit, pnkWithdrawal, StakingResult.Successful);\\n    }\\n\\n    /// @inheritdoc ISortitionModule\\n    function setStake(\\n        address _account,\\n        uint96 _courtID,\\n        uint256 _pnkDeposit,\\n        uint256 _pnkWithdrawal,\\n        uint256 _newStake\\n    ) external override onlyByCore {\\n        _setStake(_account, _courtID, _pnkDeposit, _pnkWithdrawal, _newStake);\\n    }\\n\\n    function setStakePenalty(\\n        address _account,\\n        uint96 _courtID,\\n        uint256 _penalty\\n    ) external override onlyByCore returns (uint256 pnkBalance, uint256 newCourtStake, uint256 availablePenalty) {\\n        Juror storage juror = jurors[_account];\\n        availablePenalty = _penalty;\\n        newCourtStake = _stakeOf(_account, _courtID);\\n        if (juror.stakedPnk < _penalty) {\\n            availablePenalty = juror.stakedPnk;\\n        }\\n\\n        if (availablePenalty == 0) return (juror.stakedPnk, newCourtStake, 0); // No penalty to apply.\\n\\n        uint256 currentStake = _stakeOf(_account, _courtID);\\n        uint256 newStake = 0;\\n        if (currentStake >= availablePenalty) {\\n            newStake = currentStake - availablePenalty;\\n        }\\n        _setStake(_account, _courtID, 0, availablePenalty, newStake);\\n        pnkBalance = juror.stakedPnk; // updated by _setStake()\\n        newCourtStake = _stakeOf(_account, _courtID); // updated by _setStake()\\n    }\\n\\n    /// @inheritdoc ISortitionModule\\n    function setStakeReward(\\n        address _account,\\n        uint96 _courtID,\\n        uint256 _reward\\n    ) external override onlyByCore returns (bool success) {\\n        if (_reward == 0) return true; // No reward to add.\\n\\n        uint256 currentStake = _stakeOf(_account, _courtID);\\n        if (currentStake == 0) return false; // Juror has been unstaked, don't increase their stake.\\n\\n        uint256 newStake = currentStake + _reward;\\n        _setStake(_account, _courtID, _reward, 0, newStake);\\n        return true;\\n    }\\n\\n    function _setStake(\\n        address _account,\\n        uint96 _courtID,\\n        uint256 _pnkDeposit,\\n        uint256 _pnkWithdrawal,\\n        uint256 _newStake\\n    ) internal {\\n        Juror storage juror = jurors[_account];\\n        uint256 currentStake = _stakeOf(_account, _courtID);\\n        if (_pnkDeposit > 0) {\\n            if (currentStake == 0) {\\n                juror.courtIDs.push(_courtID);\\n            }\\n            // Increase juror's balance by deposited amount.\\n            juror.stakedPnk += _pnkDeposit;\\n        } else {\\n            juror.stakedPnk -= _pnkWithdrawal;\\n            if (_newStake == 0) {\\n                // Cleanup\\n                for (uint256 i = juror.courtIDs.length; i > 0; i--) {\\n                    if (juror.courtIDs[i - 1] == _courtID) {\\n                        juror.courtIDs[i - 1] = juror.courtIDs[juror.courtIDs.length - 1];\\n                        juror.courtIDs.pop();\\n                        break;\\n                    }\\n                }\\n            }\\n        }\\n\\n        bool finished = false;\\n        uint96 currentCourtID = _courtID;\\n        while (!finished) {\\n            // Tokens are also implicitly staked in parent courts through sortition module to increase the chance of being drawn.\\n            juror.stakesByCourtID[currentCourtID] += _newStake;\\n            juror.stakesByCourtID[currentCourtID] -= currentStake;\\n            if (currentCourtID == GENERAL_COURT) {\\n                finished = true;\\n            } else {\\n                (currentCourtID, , , , , ) = core.courts(currentCourtID);\\n            }\\n        }\\n        emit StakeSet(_account, _courtID, _newStake, juror.stakedPnk);\\n    }\\n\\n    function lockStake(address _account, uint256 _relativeAmount) external override onlyByCore {\\n        jurors[_account].lockedPnk += _relativeAmount;\\n        emit StakeLocked(_account, _relativeAmount, false);\\n    }\\n\\n    function unlockStake(address _account, uint256 _relativeAmount) external override onlyByCore {\\n        jurors[_account].lockedPnk -= _relativeAmount;\\n        emit StakeLocked(_account, _relativeAmount, true);\\n    }\\n\\n    /// @inheritdoc ISortitionModule\\n    function forcedUnstakeAllCourts(address _account) external override onlyByCore {\\n        uint96[] memory courtIDs = getJurorCourtIDs(_account);\\n        for (uint256 j = courtIDs.length; j > 0; j--) {\\n            core.setStakeBySortitionModule(_account, courtIDs[j - 1], 0);\\n        }\\n    }\\n\\n    /// @inheritdoc ISortitionModule\\n    function forcedUnstake(address _account, uint96 _courtID) external override onlyByCore {\\n        core.setStakeBySortitionModule(_account, _courtID, 0);\\n    }\\n\\n    /// @inheritdoc ISortitionModule\\n    function withdrawLeftoverPNK(address _account) external override {\\n        // Can withdraw the leftover PNK if fully unstaked, has no tokens locked and has positive balance.\\n        // This withdrawal can't be triggered by calling setStake() in KlerosCore because current stake is technically 0, thus it is done via separate function.\\n        uint256 amount = getJurorLeftoverPNK(_account);\\n        if (amount == 0) revert NotEligibleForWithdrawal();\\n        jurors[_account].stakedPnk = 0;\\n        core.transferBySortitionModule(_account, amount);\\n        emit LeftoverPNKWithdrawn(_account, amount);\\n    }\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /// @inheritdoc ISortitionModule\\n    function draw(uint96, uint256, uint256) public view override returns (address drawnAddress, uint96 fromSubcourtID) {\\n        drawnAddress = transientJuror;\\n    }\\n\\n    /// @inheritdoc ISortitionModule\\n    function getJurorBalance(\\n        address _juror,\\n        uint96 _courtID\\n    )\\n        external\\n        view\\n        override\\n        returns (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts)\\n    {\\n        Juror storage juror = jurors[_juror];\\n        totalStaked = juror.stakedPnk;\\n        totalLocked = juror.lockedPnk;\\n        nbCourts = juror.courtIDs.length;\\n        for (uint256 i = 0; i < nbCourts; i++) {\\n            if (juror.courtIDs[i] == _courtID) {\\n                stakedInCourt = juror.stakesByCourtID[_courtID];\\n                break;\\n            }\\n        }\\n    }\\n\\n    /// @inheritdoc ISortitionModule\\n    function getJurorCourtIDs(address _juror) public view override returns (uint96[] memory) {\\n        return jurors[_juror].courtIDs;\\n    }\\n\\n    /// @inheritdoc ISortitionModule\\n    function isJurorStaked(address _juror) external view override returns (bool) {\\n        return jurors[_juror].stakedPnk > 0;\\n    }\\n\\n    /// @inheritdoc ISortitionModule\\n    function getJurorLeftoverPNK(address _juror) public view override returns (uint256) {\\n        Juror storage juror = jurors[_juror];\\n        if (juror.courtIDs.length == 0 && juror.lockedPnk == 0) {\\n            return juror.stakedPnk;\\n        }\\n        return 0;\\n    }\\n\\n    // ************************************* //\\n    // *            Internal               * //\\n    // ************************************* //\\n\\n    /// @notice Gets the stake of a juror in a court.\\n    ///\\n    /// @dev Warning: `O(n)` complexity where `n` is the number of courts the juror has staked in\\n    /// but acceptable for this educational implementation.\\n    ///\\n    /// @param _juror The address of the juror.\\n    /// @param _courtID The ID of the court.\\n    /// @return stakedInCourt The amount of tokens staked by the juror in the court.\\n    function _stakeOf(address _juror, uint96 _courtID) internal view returns (uint256 stakedInCourt) {\\n        Juror storage juror = jurors[_juror];\\n        for (uint256 i = 0; i < juror.courtIDs.length; i++) {\\n            if (juror.courtIDs[i] == _courtID) {\\n                stakedInCourt = juror.stakesByCourtID[_courtID];\\n                break;\\n            }\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *              Errors               * //\\n    // ************************************* //\\n\\n    error OwnerOnly();\\n    error KlerosCoreOnly();\\n    error NotEligibleForWithdrawal();\\n}\\n\",\"keccak256\":\"0x518a3b161ea7c1199aed0932c71ec866106bfb13b24e633bd2fd0924c136403d\",\"license\":\"MIT\"},\"src/libraries/Constants.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\nimport \\\"@openzeppelin/contracts/token/ERC20/IERC20.sol\\\";\\n\\n// Courts\\nuint96 constant FORKING_COURT = 0; // Index of the forking court.\\nuint96 constant GENERAL_COURT = 1; // Index of the default (general) court.\\n\\n// Dispute Kits\\nuint256 constant NULL_DISPUTE_KIT = 0; // Null pattern to indicate a top-level DK which has no parent.\\nuint256 constant DISPUTE_KIT_CLASSIC = 1; // Index of the default DK. 0 index is skipped.\\n\\n// Sortition Module\\nuint256 constant MAX_STAKE_PATHS = 4; // The maximum number of stake paths a juror can have.\\nuint256 constant DEFAULT_K = 6; // Default number of children per node.\\n\\n// Defaults\\nuint256 constant DEFAULT_NB_OF_JURORS = 3; // The default number of jurors in a dispute.\\nIERC20 constant NATIVE_CURRENCY = IERC20(address(0)); // The native currency, such as ETH on Arbitrum, Optimism and Ethereum L1.\\n\\n// Units\\nuint256 constant ONE_BASIS_POINT = 10000;\\n\\nenum OnError {\\n    Revert,\\n    Return\\n}\\n\\nenum StakingResult {\\n    Successful,\\n    Delayed,\\n    StakingTransferFailed,\\n    UnstakingTransferFailed,\\n    CannotStakeInMoreCourts,\\n    CannotStakeInThisCourt,\\n    CannotStakeLessThanMinStake,\\n    CannotStakeMoreThanMaxStakePerJuror,\\n    CannotStakeMoreThanMaxTotalStaked,\\n    CannotStakeZeroWhenNoStake\\n}\\n\",\"keccak256\":\"0xb8c96c842259ca1384e8450dfb214f0fcd604829c84293dd3f8981f3421b66c9\",\"license\":\"MIT\"},\"src/libraries/SafeERC20.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n// Adapted from https://github.com/OpenZeppelin/openzeppelin-contracts/blob/a7a94c77463acea95d979aae1580fb0ddc3b6a1e/contracts/token/ERC20/utils/SafeERC20.sol\\n\\npragma solidity ^0.8.24;\\n\\nimport \\\"@openzeppelin/contracts/token/ERC20/IERC20.sol\\\";\\n\\n/// @title SafeERC20\\n///\\n/// @notice Wrappers around ERC20 operations\\n///\\n/// @dev Throws on failure (when the token contract returns false).\\n/// Tokens that return no value (and instead revert or throw on failure) are also supported.\\n/// Non-reverting calls are assumed to be successful.\\n/// To use this library you can add a `using SafeERC20 for IERC20;` statement to your contract,\\n/// which allows you to call the safe operations as `token.safeTransfer(...)`, etc.\\nlibrary SafeERC20 {\\n    /// @notice Increases the allowance granted to `spender` by the caller.\\n    /// @param _token Token to transfer.\\n    /// @param _spender The address which will spend the funds.\\n    /// @param _addedValue The amount of tokens to increase the allowance by.\\n    function increaseAllowance(IERC20 _token, address _spender, uint256 _addedValue) internal returns (bool) {\\n        _token.approve(_spender, _token.allowance(address(this), _spender) + _addedValue);\\n        return true;\\n    }\\n\\n    /// @notice Calls transfer() without reverting.\\n    /// @param _token Token to transfer.\\n    /// @param _to Recipient address.\\n    /// @param _value Amount transferred.\\n    /// @return Whether transfer succeeded or not.\\n    function safeTransfer(IERC20 _token, address _to, uint256 _value) internal returns (bool) {\\n        (bool success, bytes memory data) = address(_token).call(abi.encodeCall(IERC20.transfer, (_to, _value)));\\n        return (success && (data.length == 0 || abi.decode(data, (bool))));\\n    }\\n\\n    /// @notice Calls transferFrom() without reverting.\\n    /// @param _token Token to transfer.\\n    /// @param _from Sender address.\\n    /// @param _to Recipient address.\\n    /// @param _value Amount transferred.\\n    /// @return Whether transfer succeeded or not.\\n    function safeTransferFrom(IERC20 _token, address _from, address _to, uint256 _value) internal returns (bool) {\\n        (bool success, bytes memory data) = address(_token).call(\\n            abi.encodeCall(IERC20.transferFrom, (_from, _to, _value))\\n        );\\n        return (success && (data.length == 0 || abi.decode(data, (bool))));\\n    }\\n}\\n\",\"keccak256\":\"0x36b92f984484f9dfd63a40ccb1c1e23cde0085db36ec8adb7afe7e98ef667bd7\",\"license\":\"MIT\"},\"src/proxy/Initializable.sol\":{\"content\":\"// SPDX-License-Identifier: MIT\\n// OpenZeppelin Contracts (last updated v4.9.0) (proxy/utils/Initializable.sol) <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/utils/Initializable.sol>\\n\\npragma solidity ^0.8.24;\\n\\n/**\\n * @dev This is a base contract to aid in writing upgradeable contracts, or any kind of contract that will be deployed\\n * behind a proxy. Since proxied contracts do not make use of a constructor, it's common to move constructor logic to an\\n * external initializer function, usually called `initialize`. It then becomes necessary to protect this initializer\\n * function so it can only be called once. The {initializer} modifier provided by this contract will have this effect.\\n *\\n * The initialization functions use a version number. Once a version number is used, it is consumed and cannot be\\n * reused. This mechanism prevents re-execution of each \\\"step\\\" but allows the creation of new initialization steps in\\n * case an upgrade adds a module that needs to be initialized.\\n *\\n * For example:\\n *\\n * ```solidity\\n * contract MyToken is ERC20Upgradeable {\\n *     function initialize() initializer public {\\n *         __ERC20_init(\\\"MyToken\\\", \\\"MTK\\\");\\n *     }\\n * }\\n *\\n * contract MyTokenV2 is MyToken, ERC20PermitUpgradeable {\\n *     function initializeV2() reinitializer(2) public {\\n *         __ERC20Permit_init(\\\"MyToken\\\");\\n *     }\\n * }\\n * ```\\n *\\n * TIP: To avoid leaving the proxy in an uninitialized state, the initializer function should be called as early as\\n * possible by providing the encoded function call as the `_data` argument to the proxy constructor\\n *\\n * CAUTION: When used with inheritance, manual care must be taken to not invoke a parent initializer twice, or to ensure\\n * that all initializers are idempotent. This is not verified automatically as constructors are by Solidity.\\n *\\n * [CAUTION]\\n * ====\\n * Avoid leaving a contract uninitialized.\\n *\\n * An uninitialized contract can be taken over by an attacker. This applies to both a proxy and its implementation\\n * contract, which may impact the proxy. To prevent the implementation contract from being used, you should invoke\\n * the {_disableInitializers} function in the constructor to automatically lock it when it is deployed:\\n *\\n * ```\\n * /// @custom:oz-upgrades-unsafe-allow constructor\\n * constructor() {\\n *     _disableInitializers();\\n * }\\n * ```\\n */\\nabstract contract Initializable {\\n    /**\\n     * @dev Storage of the initializable contract.\\n     *\\n     * It's implemented on a custom ERC-7201 namespace to reduce the risk of storage collisions\\n     * when using with upgradeable contracts.\\n     *\\n     * @custom:storage-location erc7201:openzeppelin.storage.Initializable\\n     */\\n    struct InitializableStorage {\\n        /**\\n         * @dev Indicates that the contract has been initialized.\\n         */\\n        uint64 _initialized;\\n        /**\\n         * @dev Indicates that the contract is in the process of being initialized.\\n         */\\n        bool _initializing;\\n    }\\n\\n    // keccak256(abi.encode(uint256(keccak256(\\\"openzeppelin.storage.Initializable\\\")) - 1))\\n    bytes32 private constant _INITIALIZABLE_STORAGE =\\n        0xf0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e;\\n\\n    /**\\n     * @dev The contract is already initialized.\\n     */\\n    error AlreadyInitialized();\\n\\n    /**\\n     * @dev The contract is not initializing.\\n     */\\n    error NotInitializing();\\n\\n    /**\\n     * @dev Triggered when the contract has been initialized or reinitialized.\\n     */\\n    event Initialized(uint64 version);\\n\\n    /**\\n     * @dev A modifier that defines a protected initializer function that can be invoked at most once. In its scope,\\n     * `onlyInitializing` functions can be used to initialize parent contracts.\\n     *\\n     * Similar to `initializer()`, except that functions marked with `initializer` can be nested in the context of a\\n     * constructor.\\n     *\\n     * Emits an {Initialized} event.\\n     */\\n    modifier initializer() {\\n        // solhint-disable-next-line var-name-mixedcase\\n        InitializableStorage storage $ = _getInitializableStorage();\\n\\n        bool isTopLevelCall = !$._initializing;\\n        uint64 initialized = $._initialized;\\n        if (!(isTopLevelCall && initialized < 1) && !(address(this).code.length == 0 && initialized == 1)) {\\n            revert AlreadyInitialized();\\n        }\\n        $._initialized = 1;\\n        if (isTopLevelCall) {\\n            $._initializing = true;\\n        }\\n        _;\\n        if (isTopLevelCall) {\\n            $._initializing = false;\\n            emit Initialized(1);\\n        }\\n    }\\n\\n    /**\\n     * @dev A modifier that defines a protected reinitializer function that can be invoked at most once, and only if the\\n     * contract hasn't been initialized to a greater version before. In its scope, `onlyInitializing` functions can be\\n     * used to initialize parent contracts.\\n     *\\n     * A reinitializer may be used after the original initialization step. This is essential to configure modules that\\n     * are added through upgrades and that require initialization.\\n     *\\n     * When `version` is 1, this modifier is similar to `initializer`, except that functions marked with `reinitializer`\\n     * cannot be nested. If one is invoked in the context of another, execution will revert.\\n     *\\n     * Note that versions can jump in increments greater than 1; this implies that if multiple reinitializers coexist in\\n     * a contract, executing them in the right order is up to the developer or operator.\\n     *\\n     * WARNING: setting the version to 255 will prevent any future reinitialization.\\n     *\\n     * Emits an {Initialized} event.\\n     */\\n    modifier reinitializer(uint64 version) {\\n        // solhint-disable-next-line var-name-mixedcase\\n        InitializableStorage storage $ = _getInitializableStorage();\\n\\n        if ($._initializing || $._initialized >= version) {\\n            revert AlreadyInitialized();\\n        }\\n        $._initialized = version;\\n        $._initializing = true;\\n        _;\\n        $._initializing = false;\\n        emit Initialized(version);\\n    }\\n\\n    /**\\n     * @dev Modifier to protect an initialization function so that it can only be invoked by functions with the\\n     * {initializer} and {reinitializer} modifiers, directly or indirectly.\\n     */\\n    modifier onlyInitializing() {\\n        _checkInitializing();\\n        _;\\n    }\\n\\n    /**\\n     * @dev Reverts if the contract is not in an initializing state. See {onlyInitializing}.\\n     */\\n    function _checkInitializing() internal view virtual {\\n        if (!_isInitializing()) {\\n            revert NotInitializing();\\n        }\\n    }\\n\\n    /**\\n     * @dev Locks the contract, preventing any future reinitialization. This cannot be part of an initializer call.\\n     * Calling this in the constructor of a contract will prevent that contract from being initialized or reinitialized\\n     * to any version. It is recommended to use this to lock implementation contracts that are designed to be called\\n     * through proxies.\\n     *\\n     * Emits an {Initialized} event the first time it is successfully executed.\\n     */\\n    function _disableInitializers() internal virtual {\\n        // solhint-disable-next-line var-name-mixedcase\\n        InitializableStorage storage $ = _getInitializableStorage();\\n\\n        if ($._initializing) {\\n            revert AlreadyInitialized();\\n        }\\n        if ($._initialized != type(uint64).max) {\\n            $._initialized = type(uint64).max;\\n            emit Initialized(type(uint64).max);\\n        }\\n    }\\n\\n    /**\\n     * @dev Returns the highest version that has been initialized. See {reinitializer}.\\n     */\\n    function _getInitializedVersion() internal view returns (uint64) {\\n        return _getInitializableStorage()._initialized;\\n    }\\n\\n    /**\\n     * @dev Returns `true` if the contract is currently initializing. See {onlyInitializing}.\\n     */\\n    function _isInitializing() internal view returns (bool) {\\n        return _getInitializableStorage()._initializing;\\n    }\\n\\n    /**\\n     * @dev Returns a pointer to the storage namespace.\\n     */\\n    // solhint-disable-next-line var-name-mixedcase\\n    function _getInitializableStorage() private pure returns (InitializableStorage storage $) {\\n        assembly {\\n            $.slot := _INITIALIZABLE_STORAGE\\n        }\\n    }\\n}\\n\",\"keccak256\":\"0xdad09e5f773fa6940dbd8c28480f602a7eaa3c70d3da9d06df140187cbf5dad4\",\"license\":\"MIT\"},\"src/proxy/UUPSProxiable.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\n/// @title UUPS Proxiable\\n/// @author Simon Malatrait <simon.malatrait@grenoble-inp.org>\\n/// @notice This contract implements an upgradeability mechanism designed for UUPS proxies.\\n///\\n/// @dev Adapted from <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/utils/UUPSUpgradeable.sol>\\n/// The functions included here can perform an upgrade of an UUPS Proxy, when this contract is set as the implementation behind such a proxy.\\n///\\n/// IMPORTANT: A UUPS proxy requires its upgradeability functions to be in the implementation as opposed to the transparent proxy.\\n/// This means that if the proxy is upgraded to an implementation that does not support this interface, it will no longer be upgradeable.\\n///\\n/// A security mechanism ensures that an upgrade does not turn off upgradeability accidentally, although this risk is\\n/// reinstated if the upgrade retains upgradeability but removes the security mechanism, e.g. by replacing\\n/// `UUPSProxiable` with a custom implementation of upgrades.\\n///\\n/// The `_authorizeUpgrade` function must be overridden to include access restriction to the upgrade mechanism.\\nabstract contract UUPSProxiable {\\n    // ************************************* //\\n    // *             Event                 * //\\n    // ************************************* //\\n\\n    /// @notice Emitted when the `implementation` has been successfully upgraded.\\n    /// @param newImplementation Address of the new implementation the proxy is now forwarding calls to.\\n    event Upgraded(address indexed newImplementation);\\n\\n    // ************************************* //\\n    // *             Error                 * //\\n    // ************************************* //\\n\\n    /// @notice The call is from an unauthorized context.\\n    error UUPSUnauthorizedCallContext();\\n\\n    /// @notice The storage `slot` is unsupported as a UUID.\\n    error UUPSUnsupportedProxiableUUID(bytes32 slot);\\n\\n    /// @notice The `implementation` is not UUPS-compliant\\n    error InvalidImplementation(address implementation);\\n\\n    /// Failed Delegated call\\n    error FailedDelegateCall();\\n\\n    // ************************************* //\\n    // *             Storage               * //\\n    // ************************************* //\\n\\n    /// @dev Storage slot with the address of the current implementation.\\n    /// @dev This is the keccak-256 hash of \\\"eip1967.proxy.implementation\\\" subtracted by 1, and is\\n    /// @dev validated in the constructor.\\n    /// @dev NOTE: bytes32(uint256(keccak256('eip1967.proxy.implementation')) - 1)\\n    bytes32 private constant IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;\\n\\n    /// @dev Storage variable of the proxiable contract address.\\n    /// @dev It is used to check whether or not the current call is from the proxy.\\n    /// @custom:oz-upgrades-unsafe-allow state-variable-immutable\\n    address private immutable __self = address(this);\\n\\n    // ************************************* //\\n    // *             Governance            * //\\n    // ************************************* //\\n\\n    /// @dev Function that should revert when `msg.sender` is not authorized to upgrade the contract.\\n    /// @dev Called by {upgradeToAndCall}.\\n    function _authorizeUpgrade(address newImplementation) internal virtual;\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @notice Upgrade mechanism including access control and UUPS-compliance.\\n    /// @param newImplementation Address of the new implementation contract.\\n    /// @param data Data used in a delegate call to `newImplementation` if non-empty. This will typically be an encoded\\n    /// function call, and allows initializing the storage of the proxy like a Solidity constructor.\\n    /// @dev Reverts if the execution is not performed via delegatecall or the execution\\n    /// context is not of a proxy with an ERC1967-compliant implementation pointing to self.\\n    function upgradeToAndCall(address newImplementation, bytes memory data) public payable virtual {\\n        _authorizeUpgrade(newImplementation);\\n\\n        // Check that the execution is being performed through a delegatecall call and that the execution context is\\n        // a proxy contract with an implementation (as defined in ERC1967) pointing to self.\\n        if (address(this) == __self || _getImplementation() != __self) {\\n            revert UUPSUnauthorizedCallContext();\\n        }\\n\\n        try UUPSProxiable(newImplementation).proxiableUUID() returns (bytes32 slot) {\\n            if (slot != IMPLEMENTATION_SLOT) {\\n                revert UUPSUnsupportedProxiableUUID(slot);\\n            }\\n            // Store the new implementation address to the implementation storage slot.\\n            assembly {\\n                sstore(IMPLEMENTATION_SLOT, newImplementation)\\n            }\\n            emit Upgraded(newImplementation);\\n\\n            if (data.length != 0) {\\n                // The return data is not checked (checking, in case of success, that the newImplementation code is non-empty if the return data is empty) because the authorized callee is trusted.\\n                /// @custom:oz-upgrades-unsafe-allow delegatecall\\n                (bool success, ) = newImplementation.delegatecall(data);\\n                if (!success) {\\n                    revert FailedDelegateCall();\\n                }\\n            }\\n        } catch {\\n            revert InvalidImplementation(newImplementation);\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Public Views            * //\\n    // ************************************* //\\n\\n    /// @notice Implementation of the ERC1822 `proxiableUUID` function. This returns the storage slot used by the\\n    /// implementation. It is used to validate the implementation's compatibility when performing an upgrade.\\n    ///\\n    /// @dev IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks\\n    /// bricking a proxy that upgrades to it, by delegating to itself until out of gas. Thus it is critical that this\\n    /// function revert if invoked through a proxy. This is guaranteed by the if statement.\\n    function proxiableUUID() external view virtual returns (bytes32) {\\n        if (address(this) != __self) {\\n            // Must not be called through delegatecall\\n            revert UUPSUnauthorizedCallContext();\\n        }\\n        return IMPLEMENTATION_SLOT;\\n    }\\n\\n    /// @notice Returns the version of the implementation.\\n    /// @return Version string.\\n    function version() external view virtual returns (string memory);\\n\\n    // ************************************* //\\n    // *           Internal Views          * //\\n    // ************************************* //\\n\\n    function _getImplementation() internal view returns (address implementation) {\\n        assembly {\\n            implementation := sload(IMPLEMENTATION_SLOT)\\n        }\\n    }\\n}\\n\",\"keccak256\":\"0xa369061748e8a7b02873d597d4c78a2a09328111f04a97428b1c209e82cf5414\",\"license\":\"MIT\"}},\"version\":1}",
+  "bytecode": "0x60a080604052346100c157306080525f516020611d075f395f51905f525460ff8160401c166100b3576002600160401b03196001600160401b03821601610060575b604051611c4190816100c68239608051818181610d720152610e3a0152f35b6001600160401b0319166001600160401b039081175f516020611d075f395f51905f525581527fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d290602090a15f80610041565b62dc149f60e41b5f5260045ffd5b5f80fdfe6080806040526004361015610012575f80fd5b5f905f3560e01c9081630343274414611336575080630b274f2e1461131e57806321e1625e1461129857806335975f4a1461127f578063485cc9551461107a5780634f1ef28614610dea57806352d1902d14610d58578063543f8a3614610cea57806354fd4d5014610c745780635d2d784614610c425780636624192f14610c05578063664bffc314610bbe57806369f4587714610aa2578063771a27cb14610a5d5780638da5cb5b14610a37578063965af6c7146109ae5780639d560867146109105780639fbb56f1146108e4578063aa9ebfb7146107c6578063aac03ad21461044e578063b4ebe8381461040b578063c70ba3b914610378578063d045e00214610341578063d09f392d146102e8578063d1c1df4814610224578063dca5f6b0146101df578063f1a531041461017b5763f2f4eb2614610152575f80fd5b3461017857806003193601126101785760206001600160a01b0360015416604051908152f35b80fd5b503461017857602036600319011261017857610195611350565b6001600160a01b036001541633036101d1576001600160a01b031673ffffffffffffffffffffffffffffffffffffffff19600454161760045580f35b600482628448c760e31b8152fd5b503461017857602036600319011261017857604080916001600160a01b03610205611350565b1681526003602052206003600282015491015482519182526020820152f35b50346101785760403660031901126101785761023e611350565b610246611414565b916001600160a01b0381921681526003602052604081209160028301549260038101549060018101956001600160601b038754959116905b8581106102a4575b50505060809450604051938452602084015260408301526060820152f35b816001600160601b036102b7838b611b4f565b90549060031b1c16146102cc5760010161027e565b5090919250608095505f5260205260405f2054905f8080610286565b5034610178576102f7366113fe565b50506001600160a01b03600154163303610333576002545f19811461031f5760010160025580f35b602482634e487b7160e01b81526011600452fd5b80628448c760e31b60049252fd5b50346101785760603660031901126101785760409061035e61142a565b506001600160a01b03600454169082519182526020820152f35b503461017857608036600319011261017857610392611350565b61039a611414565b60643580151503610407576001600160a01b036001541633036103f957906103c59160443591611a76565b906040519283526020830152600a8110156103e557606092506040820152f35b602483634e487b7160e01b81526021600452fd5b600483628448c760e31b8152fd5b8280fd5b50346101785760403660031901126101785761042561142a565b5060243567ffffffffffffffff811161044a576104469036906004016113b8565b5080f35b5080fd5b50346101785760a036600319011261017857610468611350565b610470611414565b60443591608435906001600160a01b036001541633036107b8576001600160a01b0381169384865260036020526104ab846040882093611b83565b908015610684578115610620575b6104c86002840191825461148e565b90555b8390865b8015610520575050509160609160027f70ca4ec64687bf265f39041896f3dbf10b9f650503cb38f2b3569fdce7489c36940154906001600160601b036040519316835260208301526040820152a280f35b6001600160601b0383165f528360205260405f2061053f86825461148e565b90556001600160601b0383165f528360205260405f20610560838254611754565b90556001600160601b0383166001810361057d57505060016104cf565b90925060c06001600160a01b036001541691602460405180948193630fad06e960e11b835260048301525afa9081156106155788916105be575b50916104cf565b905060c0813d821161060d575b816105d860c09383611366565b81010312610605578051906001600160601b0382168203610609576020015180151503610605575f6105b7565b8780fd5b8880fd5b3d91506105cb565b6040513d8a823e3d90fd5b60018301805490680100000000000000008210156106705761064c828892600161066b95018155611b4f565b9091906001600160601b038084549260031b9316831b921b1916179055565b6104b9565b602489634e487b7160e01b81526041600452fd5b50600282016106966064358254611754565b9055826104cb57939291906001810194855495866001600160601b038616975b6106c8575b50509091929394506104cb565b5f1981018181116107a457886001600160601b036106e68386611b4f565b90549060031b1c161461070357506106fd9061156b565b806106b6565b91929394959697505081545f198101908111610790579061064c6001600160601b036107326107419486611b4f565b90549060031b1c169184611b4f565b8054801561077c575f19019061076f61075a8383611b4f565b6001600160601b0382549160031b1b19169055565b5590849392915f806106bb565b602488634e487b7160e01b81526031600452fd5b602489634e487b7160e01b81526011600452fd5b60248a634e487b7160e01b81526011600452fd5b600485628448c760e31b8152fd5b5034610178576020366003190112610178576107e0611350565b6001600160a01b036001541633036101d157806108046001600160a01b03926114af565b90815192839116925b610815578380f35b6001546001600160a01b03165f1982018281116108d05783518110156108bc57906001600160601b036020879360051b8601015116813b15610407578291606483926040519485938492630761c14d60e01b84528b600485015260248401528160448401525af180156108b157610898575b50506108929061156b565b8061080d565b816108a291611366565b6108ad57835f610887565b8380fd5b6040513d84823e3d90fd5b602486634e487b7160e01b81526032600452fd5b602486634e487b7160e01b81526011600452fd5b5034610178576020366003190112610178576020610908610903611350565b611a3a565b604051908152f35b50346101785760403660031901126101785761092a611350565b90610933611414565b6001600160a01b03600154163381036103f9578293813b156109a95760646001600160a01b03918580946001600160601b036040519788968795630761c14d60e01b87521660048601521660248401528160448401525af180156108b1576109985750f35b816109a291611366565b6101785780f35b505050fd5b5034610178576040366003190112610178576109c8611350565b602435906001600160a01b036001541633036103f95760406001600160a01b037f7a81a4ef419d50dbb5deb116fb983bf6ca7716bcbc84cd1cd2be81ccea9078b09216928385526003602052600382862001610a25828254611754565b9055815190815260016020820152a280f35b50346101785780600319360112610178576001600160a01b036020915416604051908152f35b503461017857610a6c36611440565b926001600160a01b03600193929354163303610333576060610a8f858585611761565b9060405192835260208301526040820152f35b5034610b92576020366003190112610b9257610abc611350565b610ac581611a3a565b908115610b96576001600160a01b031690815f5260036020525f60026040822001556001600160a01b0360015416803b15610b92575f80916044604051809481937f42c37fa30000000000000000000000000000000000000000000000000000000083528860048401528760248401525af18015610b8757610b71575b5060207f71bb1b604559acc3db697ccf2aa4228d727cd5b133d6ffa419518d51c117c95c91604051908152a280f35b610b7e9193505f90611366565b5f916020610b42565b6040513d5f823e3d90fd5b5f80fd5b7fdc604fd1000000000000000000000000000000000000000000000000000000005f5260045ffd5b34610b9257610bcc36611440565b6001600160a01b03600193929354163303610bf757602092610bed92611577565b6040519015158152f35b628448c760e31b5f5260045ffd5b34610b92576020366003190112610b92576001600160a01b03610c26611350565b165f5260036020526020600260405f2001541515604051908152f35b34610b9257610c50366113fe565b50506001600160a01b03600154163303610bf757610c6f60025461156b565b600255005b34610b92575f366003190112610b92576040805190610c938183611366565b6005825260208201917f322e302e3000000000000000000000000000000000000000000000000000000083528151928391602083525180918160208501528484015e5f828201840152601f01601f19168101030190f35b34610b92576020366003190112610b9257610d0b610d06611350565b6114af565b6040518091602082016020835281518091526020604084019201905f5b818110610d36575050500390f35b82516001600160601b0316845285945060209384019390920191600101610d28565b34610b92575f366003190112610b92576001600160a01b037f0000000000000000000000000000000000000000000000000000000000000000163003610dc25760206040517f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc8152f35b7fe07c8dba000000000000000000000000000000000000000000000000000000005f5260045ffd5b6040366003190112610b9257610dfe611350565b60243567ffffffffffffffff8111610b9257610e1e9036906004016113b8565b906001600160a01b035f54163303611052576001600160a01b037f00000000000000000000000000000000000000000000000000000000000000001680301490811561101d575b50610dc2576001600160a01b038116916040517f52d1902d000000000000000000000000000000000000000000000000000000008152602081600481875afa5f9181610fe9575b50610edd57837f0c760937000000000000000000000000000000000000000000000000000000005f5260045260245ffd5b807f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc859203610fbe5750827f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc557fbc7cd75a20ee27fd9adebab32041f755214dbc6bffa90cc0225b39da2e5c2d3b5f80a2805180610f58575b005b5f926020849301905af43d15610fb9573d610f728161139c565b90610f806040519283611366565b81525f60203d92013e5b15610f9157005b7f736436ba000000000000000000000000000000000000000000000000000000005f5260045ffd5b610f8a565b7faa1d49a4000000000000000000000000000000000000000000000000000000005f5260045260245ffd5b9091506020813d602011611015575b8161100560209383611366565b81010312610b9257519085610eac565b3d9150610ff8565b90506001600160a01b037f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5416141583610e65565b7f596dcdb8000000000000000000000000000000000000000000000000000000005f5260045ffd5b34610b92576040366003190112610b9257611093611350565b6024356001600160a01b038116809103610b92577ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e5460ff8160401c16159267ffffffffffffffff82168480611275575b159081611257575b5061122f5767ffffffffffffffff1982166001177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e556001600160a01b0391846111f0575b501673ffffffffffffffffffffffffffffffffffffffff195f5416175f5573ffffffffffffffffffffffffffffffffffffffff19600154161760015561117357005b68ff0000000000000000197ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e54167ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e557fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d2602060405160018152a1005b68ffffffffffffffffff191668010000000000000001177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e5584611131565b7f0dc149f0000000000000000000000000000000000000000000000000000000005f5260045ffd5b303b1591508161126a575b5015856110ec565b600191501485611262565b50600181106110e4565b34610b92576020366003190112610b9257610f5661147a565b34610b92576040366003190112610b92576112b1611350565b602435906001600160a01b03600154163303610bf75760406001600160a01b037f7a81a4ef419d50dbb5deb116fb983bf6ca7716bcbc84cd1cd2be81ccea9078b0921692835f5260036020526003825f200161130e82825461148e565b905581519081525f6020820152a2005b34610b92575f366003190112610b9257610f5661147a565b34610b92575f366003190112610b92576020906002548152f35b600435906001600160a01b0382168203610b9257565b90601f8019910116810190811067ffffffffffffffff82111761138857604052565b634e487b7160e01b5f52604160045260245ffd5b67ffffffffffffffff811161138857601f01601f191660200190565b81601f82011215610b92578035906113cf8261139c565b926113dd6040519485611366565b82845260208383010111610b9257815f926020809301838601378301015290565b6040906003190112610b92576004359060243590565b602435906001600160601b0382168203610b9257565b600435906001600160601b0382168203610b9257565b6060906003190112610b92576004356001600160a01b0381168103610b9257906024356001600160601b0381168103610b92579060443590565b6001600160a01b03600154163303610bf757565b9190820180921161149b57565b634e487b7160e01b5f52601160045260245ffd5b6001600160a01b03165f526003602052600160405f2001604051808260208294549384815201905f5260205f20925f905b80600183011061153a57611506945491818110611520575b10611509575b500382611366565b90565b60601c6001600160601b031681526020015f6114fe565b9260206001916001600160601b03851681520193016114f8565b91600291935060406001916001600160601b038754818116835260601c1660208201520194019201849293916114e0565b801561149b575f190190565b91801561174c576115888284611b83565b801561174457816115989161148e565b906001600160a01b03841693845f5260036020526115ba8460405f2092611b83565b8015611714575b6115d06002830193845461148e565b835584915f5b80156116275750505050916060917f70ca4ec64687bf265f39041896f3dbf10b9f650503cb38f2b3569fdce7489c369354906001600160601b036040519316835260208301526040820152a2600190565b6001600160601b0384165f528160205260405f2061164687825461148e565b90556001600160601b0384165f528160205260405f20611667848254611754565b90556001600160601b0384166001810361168457505060016115d6565b90935060c06001600160a01b036001541691602460405180948193630fad06e960e11b835260048301525afa908115610b87575f916116c5575b50926115d6565b905060c0813d821161170c575b816116df60c09383611366565b81010312610b92578051906001600160601b0382168203610b92576020015180151503610b92575f6116be565b3d91506116d2565b600182018054680100000000000000008110156113885761064c8161173f9360018a94018155611b4f565b6115c1565b505050505f90565b505050600190565b9190820391821161149b57565b919290926001600160a01b03831693845f52600360205260405f20918092600261178b8488611b83565b9101918254908110611a32575b8415611a265750506117aa8286611b83565b955f9684811015611a12575b50805f52600360205260405f206117cd8488611b83565b9060028101916117de878454611754565b83558915611933575b85915f5b801561184657505050506060611843959697987f70ca4ec64687bf265f39041896f3dbf10b9f650503cb38f2b3569fdce7489c369254604051916001600160601b038816835260208301526040820152a25494611b83565b91565b6001600160601b0384165f528160205260405f206118658d825461148e565b90556001600160601b0384165f528160205260405f20611886848254611754565b90556001600160601b038416600181036118a357505060016117eb565b90935060c06001600160a01b036001541691602460405180948193630fad06e960e11b835260048301525afa908115610b87575f916118e4575b50926117eb565b905060c0813d821161192b575b816118fe60c09383611366565b81010312610b92578051906001600160601b0382168203610b92576020015180151503610b92575f6118dd565b3d91506118f1565b979695949392919060018101988954998a6001600160601b0388169b5b611966575b5050909192939495969798506117e7565b5f19810181811161149b578c6001600160601b036119848386611b4f565b90549060031b1c16146119a1575061199b9061156b565b80611950565b9192939495969798999a9b50508154905f19820191821161149b5761064c6001600160601b036107326119d49486611b4f565b805480156119fe575f1901906119ed61075a8383611b4f565b559088979695949392915f80611955565b634e487b7160e01b5f52603160045260245ffd5b611a1f9197508490611754565b955f6117b6565b965094505f9392505050565b935083611798565b6001600160a01b03165f52600360205260405f2060018101541580611a6a575b611a6357505f90565b6002015490565b50600381015415611a5a565b9092915f91611a9b5f956001600160a01b0383165f52600360205260405f2092611b83565b926001820154841580918192611b43575b50611b335780611b2b575b611b1c57838310611ad457505090611ace91611754565b91905f90565b92611ae192919550611754565b92600360028201549101548082115f14611b1457611afe91611754565b808411611b0c575b50611ace565b92505f611b06565b50505f611afe565b5050505090505f905f90600990565b508215611ab7565b505050505090505f905f90600490565b6004915010155f611aac565b9190918054831015611b6f575f52600c600160205f2084821c0193160290565b634e487b7160e01b5f52603260045260245ffd5b91906001600160a01b035f93165f52600360205260405f205f91600182018054935b848110611bb4575b5050505050565b6001600160601b03611bc68284611b4f565b90549060031b1c166001600160601b03841614611be557600101611ba5565b5050909293506001600160601b039150165f5260205260405f2054905f80808080611bad56fea2646970667358221220610dcaf880c7003b3c15c538c4a9a9b4f317449d0eba3fbf1a60083d71651a8464736f6c634300081e0033f0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e",
+  "deployedBytecode": "0x6080806040526004361015610012575f80fd5b5f905f3560e01c9081630343274414611336575080630b274f2e1461131e57806321e1625e1461129857806335975f4a1461127f578063485cc9551461107a5780634f1ef28614610dea57806352d1902d14610d58578063543f8a3614610cea57806354fd4d5014610c745780635d2d784614610c425780636624192f14610c05578063664bffc314610bbe57806369f4587714610aa2578063771a27cb14610a5d5780638da5cb5b14610a37578063965af6c7146109ae5780639d560867146109105780639fbb56f1146108e4578063aa9ebfb7146107c6578063aac03ad21461044e578063b4ebe8381461040b578063c70ba3b914610378578063d045e00214610341578063d09f392d146102e8578063d1c1df4814610224578063dca5f6b0146101df578063f1a531041461017b5763f2f4eb2614610152575f80fd5b3461017857806003193601126101785760206001600160a01b0360015416604051908152f35b80fd5b503461017857602036600319011261017857610195611350565b6001600160a01b036001541633036101d1576001600160a01b031673ffffffffffffffffffffffffffffffffffffffff19600454161760045580f35b600482628448c760e31b8152fd5b503461017857602036600319011261017857604080916001600160a01b03610205611350565b1681526003602052206003600282015491015482519182526020820152f35b50346101785760403660031901126101785761023e611350565b610246611414565b916001600160a01b0381921681526003602052604081209160028301549260038101549060018101956001600160601b038754959116905b8581106102a4575b50505060809450604051938452602084015260408301526060820152f35b816001600160601b036102b7838b611b4f565b90549060031b1c16146102cc5760010161027e565b5090919250608095505f5260205260405f2054905f8080610286565b5034610178576102f7366113fe565b50506001600160a01b03600154163303610333576002545f19811461031f5760010160025580f35b602482634e487b7160e01b81526011600452fd5b80628448c760e31b60049252fd5b50346101785760603660031901126101785760409061035e61142a565b506001600160a01b03600454169082519182526020820152f35b503461017857608036600319011261017857610392611350565b61039a611414565b60643580151503610407576001600160a01b036001541633036103f957906103c59160443591611a76565b906040519283526020830152600a8110156103e557606092506040820152f35b602483634e487b7160e01b81526021600452fd5b600483628448c760e31b8152fd5b8280fd5b50346101785760403660031901126101785761042561142a565b5060243567ffffffffffffffff811161044a576104469036906004016113b8565b5080f35b5080fd5b50346101785760a036600319011261017857610468611350565b610470611414565b60443591608435906001600160a01b036001541633036107b8576001600160a01b0381169384865260036020526104ab846040882093611b83565b908015610684578115610620575b6104c86002840191825461148e565b90555b8390865b8015610520575050509160609160027f70ca4ec64687bf265f39041896f3dbf10b9f650503cb38f2b3569fdce7489c36940154906001600160601b036040519316835260208301526040820152a280f35b6001600160601b0383165f528360205260405f2061053f86825461148e565b90556001600160601b0383165f528360205260405f20610560838254611754565b90556001600160601b0383166001810361057d57505060016104cf565b90925060c06001600160a01b036001541691602460405180948193630fad06e960e11b835260048301525afa9081156106155788916105be575b50916104cf565b905060c0813d821161060d575b816105d860c09383611366565b81010312610605578051906001600160601b0382168203610609576020015180151503610605575f6105b7565b8780fd5b8880fd5b3d91506105cb565b6040513d8a823e3d90fd5b60018301805490680100000000000000008210156106705761064c828892600161066b95018155611b4f565b9091906001600160601b038084549260031b9316831b921b1916179055565b6104b9565b602489634e487b7160e01b81526041600452fd5b50600282016106966064358254611754565b9055826104cb57939291906001810194855495866001600160601b038616975b6106c8575b50509091929394506104cb565b5f1981018181116107a457886001600160601b036106e68386611b4f565b90549060031b1c161461070357506106fd9061156b565b806106b6565b91929394959697505081545f198101908111610790579061064c6001600160601b036107326107419486611b4f565b90549060031b1c169184611b4f565b8054801561077c575f19019061076f61075a8383611b4f565b6001600160601b0382549160031b1b19169055565b5590849392915f806106bb565b602488634e487b7160e01b81526031600452fd5b602489634e487b7160e01b81526011600452fd5b60248a634e487b7160e01b81526011600452fd5b600485628448c760e31b8152fd5b5034610178576020366003190112610178576107e0611350565b6001600160a01b036001541633036101d157806108046001600160a01b03926114af565b90815192839116925b610815578380f35b6001546001600160a01b03165f1982018281116108d05783518110156108bc57906001600160601b036020879360051b8601015116813b15610407578291606483926040519485938492630761c14d60e01b84528b600485015260248401528160448401525af180156108b157610898575b50506108929061156b565b8061080d565b816108a291611366565b6108ad57835f610887565b8380fd5b6040513d84823e3d90fd5b602486634e487b7160e01b81526032600452fd5b602486634e487b7160e01b81526011600452fd5b5034610178576020366003190112610178576020610908610903611350565b611a3a565b604051908152f35b50346101785760403660031901126101785761092a611350565b90610933611414565b6001600160a01b03600154163381036103f9578293813b156109a95760646001600160a01b03918580946001600160601b036040519788968795630761c14d60e01b87521660048601521660248401528160448401525af180156108b1576109985750f35b816109a291611366565b6101785780f35b505050fd5b5034610178576040366003190112610178576109c8611350565b602435906001600160a01b036001541633036103f95760406001600160a01b037f7a81a4ef419d50dbb5deb116fb983bf6ca7716bcbc84cd1cd2be81ccea9078b09216928385526003602052600382862001610a25828254611754565b9055815190815260016020820152a280f35b50346101785780600319360112610178576001600160a01b036020915416604051908152f35b503461017857610a6c36611440565b926001600160a01b03600193929354163303610333576060610a8f858585611761565b9060405192835260208301526040820152f35b5034610b92576020366003190112610b9257610abc611350565b610ac581611a3a565b908115610b96576001600160a01b031690815f5260036020525f60026040822001556001600160a01b0360015416803b15610b92575f80916044604051809481937f42c37fa30000000000000000000000000000000000000000000000000000000083528860048401528760248401525af18015610b8757610b71575b5060207f71bb1b604559acc3db697ccf2aa4228d727cd5b133d6ffa419518d51c117c95c91604051908152a280f35b610b7e9193505f90611366565b5f916020610b42565b6040513d5f823e3d90fd5b5f80fd5b7fdc604fd1000000000000000000000000000000000000000000000000000000005f5260045ffd5b34610b9257610bcc36611440565b6001600160a01b03600193929354163303610bf757602092610bed92611577565b6040519015158152f35b628448c760e31b5f5260045ffd5b34610b92576020366003190112610b92576001600160a01b03610c26611350565b165f5260036020526020600260405f2001541515604051908152f35b34610b9257610c50366113fe565b50506001600160a01b03600154163303610bf757610c6f60025461156b565b600255005b34610b92575f366003190112610b92576040805190610c938183611366565b6005825260208201917f322e302e3000000000000000000000000000000000000000000000000000000083528151928391602083525180918160208501528484015e5f828201840152601f01601f19168101030190f35b34610b92576020366003190112610b9257610d0b610d06611350565b6114af565b6040518091602082016020835281518091526020604084019201905f5b818110610d36575050500390f35b82516001600160601b0316845285945060209384019390920191600101610d28565b34610b92575f366003190112610b92576001600160a01b037f0000000000000000000000000000000000000000000000000000000000000000163003610dc25760206040517f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc8152f35b7fe07c8dba000000000000000000000000000000000000000000000000000000005f5260045ffd5b6040366003190112610b9257610dfe611350565b60243567ffffffffffffffff8111610b9257610e1e9036906004016113b8565b906001600160a01b035f54163303611052576001600160a01b037f00000000000000000000000000000000000000000000000000000000000000001680301490811561101d575b50610dc2576001600160a01b038116916040517f52d1902d000000000000000000000000000000000000000000000000000000008152602081600481875afa5f9181610fe9575b50610edd57837f0c760937000000000000000000000000000000000000000000000000000000005f5260045260245ffd5b807f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc859203610fbe5750827f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc557fbc7cd75a20ee27fd9adebab32041f755214dbc6bffa90cc0225b39da2e5c2d3b5f80a2805180610f58575b005b5f926020849301905af43d15610fb9573d610f728161139c565b90610f806040519283611366565b81525f60203d92013e5b15610f9157005b7f736436ba000000000000000000000000000000000000000000000000000000005f5260045ffd5b610f8a565b7faa1d49a4000000000000000000000000000000000000000000000000000000005f5260045260245ffd5b9091506020813d602011611015575b8161100560209383611366565b81010312610b9257519085610eac565b3d9150610ff8565b90506001600160a01b037f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5416141583610e65565b7f596dcdb8000000000000000000000000000000000000000000000000000000005f5260045ffd5b34610b92576040366003190112610b9257611093611350565b6024356001600160a01b038116809103610b92577ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e5460ff8160401c16159267ffffffffffffffff82168480611275575b159081611257575b5061122f5767ffffffffffffffff1982166001177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e556001600160a01b0391846111f0575b501673ffffffffffffffffffffffffffffffffffffffff195f5416175f5573ffffffffffffffffffffffffffffffffffffffff19600154161760015561117357005b68ff0000000000000000197ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e54167ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e557fc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d2602060405160018152a1005b68ffffffffffffffffff191668010000000000000001177ff0c57e16840df040f15088dc2f81fe391c3923bec73e23a9662efc9c229c6a0e5584611131565b7f0dc149f0000000000000000000000000000000000000000000000000000000005f5260045ffd5b303b1591508161126a575b5015856110ec565b600191501485611262565b50600181106110e4565b34610b92576020366003190112610b9257610f5661147a565b34610b92576040366003190112610b92576112b1611350565b602435906001600160a01b03600154163303610bf75760406001600160a01b037f7a81a4ef419d50dbb5deb116fb983bf6ca7716bcbc84cd1cd2be81ccea9078b0921692835f5260036020526003825f200161130e82825461148e565b905581519081525f6020820152a2005b34610b92575f366003190112610b9257610f5661147a565b34610b92575f366003190112610b92576020906002548152f35b600435906001600160a01b0382168203610b9257565b90601f8019910116810190811067ffffffffffffffff82111761138857604052565b634e487b7160e01b5f52604160045260245ffd5b67ffffffffffffffff811161138857601f01601f191660200190565b81601f82011215610b92578035906113cf8261139c565b926113dd6040519485611366565b82845260208383010111610b9257815f926020809301838601378301015290565b6040906003190112610b92576004359060243590565b602435906001600160601b0382168203610b9257565b600435906001600160601b0382168203610b9257565b6060906003190112610b92576004356001600160a01b0381168103610b9257906024356001600160601b0381168103610b92579060443590565b6001600160a01b03600154163303610bf757565b9190820180921161149b57565b634e487b7160e01b5f52601160045260245ffd5b6001600160a01b03165f526003602052600160405f2001604051808260208294549384815201905f5260205f20925f905b80600183011061153a57611506945491818110611520575b10611509575b500382611366565b90565b60601c6001600160601b031681526020015f6114fe565b9260206001916001600160601b03851681520193016114f8565b91600291935060406001916001600160601b038754818116835260601c1660208201520194019201849293916114e0565b801561149b575f190190565b91801561174c576115888284611b83565b801561174457816115989161148e565b906001600160a01b03841693845f5260036020526115ba8460405f2092611b83565b8015611714575b6115d06002830193845461148e565b835584915f5b80156116275750505050916060917f70ca4ec64687bf265f39041896f3dbf10b9f650503cb38f2b3569fdce7489c369354906001600160601b036040519316835260208301526040820152a2600190565b6001600160601b0384165f528160205260405f2061164687825461148e565b90556001600160601b0384165f528160205260405f20611667848254611754565b90556001600160601b0384166001810361168457505060016115d6565b90935060c06001600160a01b036001541691602460405180948193630fad06e960e11b835260048301525afa908115610b87575f916116c5575b50926115d6565b905060c0813d821161170c575b816116df60c09383611366565b81010312610b92578051906001600160601b0382168203610b92576020015180151503610b92575f6116be565b3d91506116d2565b600182018054680100000000000000008110156113885761064c8161173f9360018a94018155611b4f565b6115c1565b505050505f90565b505050600190565b9190820391821161149b57565b919290926001600160a01b03831693845f52600360205260405f20918092600261178b8488611b83565b9101918254908110611a32575b8415611a265750506117aa8286611b83565b955f9684811015611a12575b50805f52600360205260405f206117cd8488611b83565b9060028101916117de878454611754565b83558915611933575b85915f5b801561184657505050506060611843959697987f70ca4ec64687bf265f39041896f3dbf10b9f650503cb38f2b3569fdce7489c369254604051916001600160601b038816835260208301526040820152a25494611b83565b91565b6001600160601b0384165f528160205260405f206118658d825461148e565b90556001600160601b0384165f528160205260405f20611886848254611754565b90556001600160601b038416600181036118a357505060016117eb565b90935060c06001600160a01b036001541691602460405180948193630fad06e960e11b835260048301525afa908115610b87575f916118e4575b50926117eb565b905060c0813d821161192b575b816118fe60c09383611366565b81010312610b92578051906001600160601b0382168203610b92576020015180151503610b92575f6118dd565b3d91506118f1565b979695949392919060018101988954998a6001600160601b0388169b5b611966575b5050909192939495969798506117e7565b5f19810181811161149b578c6001600160601b036119848386611b4f565b90549060031b1c16146119a1575061199b9061156b565b80611950565b9192939495969798999a9b50508154905f19820191821161149b5761064c6001600160601b036107326119d49486611b4f565b805480156119fe575f1901906119ed61075a8383611b4f565b559088979695949392915f80611955565b634e487b7160e01b5f52603160045260245ffd5b611a1f9197508490611754565b955f6117b6565b965094505f9392505050565b935083611798565b6001600160a01b03165f52600360205260405f2060018101541580611a6a575b611a6357505f90565b6002015490565b50600381015415611a5a565b9092915f91611a9b5f956001600160a01b0383165f52600360205260405f2092611b83565b926001820154841580918192611b43575b50611b335780611b2b575b611b1c57838310611ad457505090611ace91611754565b91905f90565b92611ae192919550611754565b92600360028201549101548082115f14611b1457611afe91611754565b808411611b0c575b50611ace565b92505f611b06565b50505f611afe565b5050505090505f905f90600990565b508215611ab7565b505050505090505f905f90600490565b6004915010155f611aac565b9190918054831015611b6f575f52600c600160205f2084821c0193160290565b634e487b7160e01b5f52603260045260245ffd5b91906001600160a01b035f93165f52600360205260405f205f91600182018054935b848110611bb4575b5050505050565b6001600160601b03611bc68284611b4f565b90549060031b1c166001600160601b03841614611be557600101611ba5565b5050909293506001600160601b039150165f5260205260405f2054905f80808080611bad56fea2646970667358221220610dcaf880c7003b3c15c538c4a9a9b4f317449d0eba3fbf1a60083d71651a8464736f6c634300081e0033",
   "devdoc": {
-    "details": "An adapted version of the SortitionModule contract for educational purposes.",
     "errors": {
       "AlreadyInitialized()": [
         {
@@ -594,22 +810,44 @@
         {
           "details": "The contract is not initializing."
         }
-      ],
-      "UUPSUnauthorizedCallContext()": [
-        {
-          "details": "The call is from an unauthorized context."
-        }
-      ],
-      "UUPSUnsupportedProxiableUUID(bytes32)": [
-        {
-          "details": "The storage `slot` is unsupported as a UUID."
-        }
       ]
     },
     "events": {
       "Initialized(uint64)": {
         "details": "Triggered when the contract has been initialized or reinitialized."
       },
+      "LeftoverPNK(address,uint256)": {
+        "params": {
+          "_account": "The account of the juror.",
+          "_amount": "The amount of PNK available."
+        }
+      },
+      "LeftoverPNKWithdrawn(address,uint256)": {
+        "params": {
+          "_account": "The account of the juror withdrawing PNK.",
+          "_amount": "The amount of PNK withdrawn."
+        }
+      },
+      "NewPhase(uint8)": {
+        "params": {
+          "_phase": "The new phase."
+        }
+      },
+      "StakeLocked(address,uint256,bool)": {
+        "params": {
+          "_address": "The address of the juror.",
+          "_relativeAmount": "The amount of tokens locked.",
+          "_unlock": "Whether the stake is locked or unlocked."
+        }
+      },
+      "StakeSet(address,uint256,uint256,uint256)": {
+        "params": {
+          "_address": "The address of the juror.",
+          "_amount": "The amount of tokens staked in the court.",
+          "_amountAllCourts": "The amount of tokens staked in all courts.",
+          "_courtID": "The ID of the court."
+        }
+      },
       "Upgraded(address)": {
         "params": {
           "newImplementation": "Address of the new implementation the proxy is now forwarding calls to."
@@ -619,74 +857,176 @@
     "kind": "dev",
     "methods": {
       "constructor": {
-        "details": "Constructor, initializing the implementation to reduce attack surface."
+        "custom:oz-upgrades-unsafe-allow": "constructor"
       },
-      "draw(bytes32,uint256,uint256)": {
-        "details": "Draw an ID from a tree using a number. Note that this function reverts if the sum of all values in the tree is 0.",
+      "createDisputeHook(uint256,uint256)": {
+        "params": {
+          "_disputeID": "The ID of the dispute.",
+          "_roundID": "The ID of the round."
+        }
+      },
+      "createTree(uint96,bytes)": {
+        "params": {
+          "_courtID": "The ID of the court.",
+          "_extraData": "Extra data that contains the number of children each node in the tree should have."
+        }
+      },
+      "draw(uint96,uint256,uint256)": {
+        "details": "that this function reverts if the sum of all values in the tree is 0. `O(k * log_k(n))` where `k` is the maximum number of children per node in the tree,  and `n` is the maximum number of nodes ever appended.",
+        "params": {
+          "_coreDisputeID": "Index of the dispute in Kleros Core.",
+          "_courtID": "The ID of the court.",
+          "_nonce": "Nonce to hash with random number."
+        },
         "returns": {
-          "drawnAddress": "The drawn address. `O(k * log_k(n))` where `k` is the maximum number of children per node in the tree,  and `n` is the maximum number of nodes ever appended."
+          "drawnAddress": "The drawn address."
+        }
+      },
+      "executeDelayedStakes(uint256)": {
+        "params": {
+          "_iterations": "The number of delayed stakes to execute."
+        }
+      },
+      "forcedUnstake(address,uint96)": {
+        "details": "`O(n * (p * log_k(j)) )` where `n` is the number of courts the juror has staked in, `p` is the depth of the court tree, `k` is the minimum number of children per node of one of these courts' sortition sum tree, and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.",
+        "params": {
+          "_account": "The juror to unstake.",
+          "_courtID": "The ID of the court."
+        }
+      },
+      "forcedUnstakeAllCourts(address)": {
+        "details": "`O(n * (p * log_k(j)) )` where `O(n * (p * log_k(j)) )` where `n` is the number of courts the juror has staked in, `p` is the depth of the court tree, `k` is the minimum number of children per node of one of these courts' sortition sum tree, and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.",
+        "params": {
+          "_account": "The juror to unstake."
         }
       },
       "getJurorBalance(address,uint96)": {
-        "details": "Gets the stake of a juror in a court. Warning: `O(n)` complexity where `n` is the number of courts the juror has staked in but acceptable for this educational implementation.",
         "params": {
           "_courtID": "The ID of the court.",
           "_juror": "The address of the juror."
         },
         "returns": {
-          "nbCourts": "The number of courts the juror has staked in.",
-          "stakedInCourt": "The amount of tokens staked by the juror in the court.",
-          "totalLocked": "The total amount of tokens locked by the juror in the court.",
-          "totalStaked": "The total amount of tokens staked by the juror in the court."
+          "nbCourts": "The number of courts the juror has directly staked in.",
+          "stakedInCourt": "The amount of tokens staked in the specified court including locked tokens and penalty deductions.",
+          "totalLocked": "The total amount of tokens locked in disputes.",
+          "totalStaked": "The total amount of tokens staked including locked tokens and penalty deductions. Equivalent to the effective stake in the General court."
         }
       },
       "getJurorCourtIDs(address)": {
-        "details": "Gets the court identifiers where a specific `_juror` has staked.",
         "params": {
           "_juror": "The address of the juror."
         }
       },
+      "getJurorLeftoverPNK(address)": {
+        "params": {
+          "_juror": "The address of the juror."
+        },
+        "returns": {
+          "_0": "Whether the juror has leftover PNK."
+        }
+      },
       "initialize(address,address)": {
-        "details": "Initializer (constructor equivalent for upgradable contracts).",
         "params": {
           "_core": "The KlerosCore."
         }
       },
-      "notifyRandomNumber(uint256)": {
-        "details": "Saves the random number to use it in sortition. Not used by this contract because the storing of the number is inlined in passPhase().",
+      "isJurorStaked(address)": {
         "params": {
-          "_randomNumber": "Random number returned by RNG contract."
+          "_juror": "The address of the juror."
+        },
+        "returns": {
+          "_0": "Whether the juror is staked or not."
+        }
+      },
+      "lockStake(address,uint256)": {
+        "params": {
+          "_account": "The address of the juror.",
+          "_relativeAmount": "The amount to lock."
+        }
+      },
+      "postDrawHook(uint256,uint256)": {
+        "params": {
+          "_disputeID": "The ID of the dispute.",
+          "_roundID": "The ID of the round."
         }
       },
       "proxiableUUID()": {
-        "details": "Implementation of the ERC1822 `proxiableUUID` function. This returns the storage slot used by the implementation. It is used to validate the implementation's compatibility when performing an upgrade. IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks bricking a proxy that upgrades to it, by delegating to itself until out of gas. Thus it is critical that this function revert if invoked through a proxy. This is guaranteed by the if statement."
+        "details": "IMPORTANT: A proxy pointing at a proxiable contract should not be considered proxiable itself, because this risks bricking a proxy that upgrades to it, by delegating to itself until out of gas. Thus it is critical that this function revert if invoked through a proxy. This is guaranteed by the if statement."
       },
-      "setJurorInactive(address)": {
-        "details": "Unstakes the inactive juror from all courts. `O(n * (p * log_k(j)) )` where `n` is the number of courts the juror has staked in, `p` is the depth of the court tree, `k` is the minimum number of children per node of one of these courts' sortition sum tree, and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.",
+      "setStake(address,uint96,uint256,uint256,uint256)": {
+        "details": "`O(n + p * log_k(j))` where `n` is the number of courts the juror has staked in, `p` is the depth of the court tree, `k` is the minimum number of children per node of one of these courts' sortition sum tree, and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.",
         "params": {
-          "_account": "The juror to unstake."
+          "_account": "The address of the juror.",
+          "_courtID": "The ID of the court.",
+          "_newStake": "The new stake.",
+          "_pnkDeposit": "The amount of PNK to be deposited.",
+          "_pnkWithdrawal": "The amount of PNK to be withdrawn."
         }
       },
-      "setStake(address,uint96,uint256,bool)": {
-        "details": "Sets the specified juror's stake in a court. `O(n + p * log_k(j))` where `n` is the number of courts the juror has staked in, `p` is the depth of the court tree, `k` is the minimum number of children per node of one of these courts' sortition sum tree, and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.",
+      "setStakePenalty(address,uint96,uint256)": {
+        "details": "`O(n + p * log_k(j))` where `n` is the number of courts the juror has staked in, `p` is the depth of the court tree, `k` is the minimum number of children per node of one of these courts' sortition sum tree, and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.",
         "params": {
           "_account": "The address of the juror.",
-          "_alreadyTransferred": "True if the tokens were already transferred from juror. Only relevant for delayed stakes.",
           "_courtID": "The ID of the court.",
-          "_newStake": "The new stake."
+          "_penalty": "The amount of PNK to be deducted."
         },
         "returns": {
-          "pnkDeposit": "The amount of PNK to be deposited.",
-          "pnkWithdrawal": "The amount of PNK to be withdrawn.",
-          "stakingResult": "The result of the staking operation."
+          "availablePenalty": "The amount of PNK that was actually deducted.",
+          "newCourtStake": "The updated stake of the juror in the court.",
+          "pnkBalance": "The updated total PNK balance of the juror, including the penalty."
+        }
+      },
+      "setStakeReward(address,uint96,uint256)": {
+        "details": "`O(n + p * log_k(j))` where `O(n + p * log_k(j))` where `n` is the number of courts the juror has staked in, `p` is the depth of the court tree, `k` is the minimum number of children per node of one of these courts' sortition sum tree, and `j` is the maximum number of jurors that ever staked in one of these courts simultaneously.",
+        "params": {
+          "_account": "The address of the juror.",
+          "_courtID": "The ID of the court.",
+          "_reward": "The amount of PNK to be deposited as a reward."
+        },
+        "returns": {
+          "success": "True if the reward was added successfully."
+        }
+      },
+      "unlockStake(address,uint256)": {
+        "params": {
+          "_account": "The address of the juror.",
+          "_relativeAmount": "The amount to unlock."
         }
       },
       "upgradeToAndCall(address,bytes)": {
-        "details": "Upgrade mechanism including access control and UUPS-compliance.Reverts if the execution is not performed via delegatecall or the execution context is not of a proxy with an ERC1967-compliant implementation pointing to self.",
+        "details": "Reverts if the execution is not performed via delegatecall or the execution context is not of a proxy with an ERC1967-compliant implementation pointing to self.",
         "params": {
           "data": "Data used in a delegate call to `newImplementation` if non-empty. This will typically be an encoded function call, and allows initializing the storage of the proxy like a Solidity constructor.",
           "newImplementation": "Address of the new implementation contract."
         }
+      },
+      "validateStake(address,uint96,uint256,bool)": {
+        "details": "No state changes should be made when returning stakingResult != Successful, otherwise delayed stakes might break invariants.",
+        "params": {
+          "_account": "The address of the juror.",
+          "_courtID": "The ID of the court.",
+          "_newStake": "The new stake.",
+          "_noDelay": "True if the stake change should not be delayed."
+        },
+        "returns": {
+          "pnkDeposit": "The amount of PNK to be deposited.",
+          "pnkWithdrawal": "The amount of PNK to be withdrawn.",
+          "stakingResult": "The result of the staking operation."
+        }
+      },
+      "withdrawLeftoverPNK(address)": {
+        "details": "that since locked and staked PNK are async it is possible for the juror to have positive staked PNK balance while having 0 stake in courts and 0 locked tokens (eg. when the juror fully unstaked during dispute and later got his tokens unlocked). In this case the juror can use this function to withdraw the leftover tokens. Also note that if the juror has some leftover PNK while not fully unstaked he'll have to manually unstake from all courts to trigger this function.",
+        "params": {
+          "_account": "The juror whose PNK to withdraw."
+        }
+      }
+    },
+    "stateVariables": {
+      "version": {
+        "return": "Version string.",
+        "returns": {
+          "_0": "Version string."
+        }
       }
     },
     "title": "SortitionModuleUniversity",
@@ -703,37 +1043,133 @@
         {
           "notice": "The `implementation` is not UUPS-compliant"
         }
+      ],
+      "UUPSUnauthorizedCallContext()": [
+        {
+          "notice": "The call is from an unauthorized context."
+        }
+      ],
+      "UUPSUnsupportedProxiableUUID(bytes32)": [
+        {
+          "notice": "The storage `slot` is unsupported as a UUID."
+        }
       ]
     },
     "events": {
+      "LeftoverPNK(address,uint256)": {
+        "notice": "Emitted when leftover PNK is available."
+      },
+      "LeftoverPNKWithdrawn(address,uint256)": {
+        "notice": "Emitted when leftover PNK is withdrawn."
+      },
+      "NewPhase(uint8)": {
+        "notice": "Emitted when the phase is changed."
+      },
+      "StakeLocked(address,uint256,bool)": {
+        "notice": "Emitted when a juror's stake is locked."
+      },
+      "StakeSet(address,uint256,uint256,uint256)": {
+        "notice": "Emitted when a juror stakes in a court."
+      },
       "Upgraded(address)": {
         "notice": "Emitted when the `implementation` has been successfully upgraded."
       }
     },
     "kind": "user",
-    "methods": {},
+    "methods": {
+      "createDisputeHook(uint256,uint256)": {
+        "notice": "Triggers the state changes after dispute creation."
+      },
+      "createTree(uint96,bytes)": {
+        "notice": "Create a sortition sum tree at the specified key."
+      },
+      "draw(uint96,uint256,uint256)": {
+        "notice": "Draw an ID from a tree using a number."
+      },
+      "executeDelayedStakes(uint256)": {
+        "notice": "Executes the next delayed stakes."
+      },
+      "forcedUnstake(address,uint96)": {
+        "notice": "Unstakes the inactive juror from a specific court."
+      },
+      "forcedUnstakeAllCourts(address)": {
+        "notice": "Unstakes the inactive juror from all courts."
+      },
+      "getJurorBalance(address,uint96)": {
+        "notice": "Gets the balance of a juror in a court."
+      },
+      "getJurorCourtIDs(address)": {
+        "notice": "Gets the court identifiers where a specific `_juror` has staked."
+      },
+      "getJurorLeftoverPNK(address)": {
+        "notice": "Checks if the juror has any leftover PNK in the contract."
+      },
+      "initialize(address,address)": {
+        "notice": "Initializer (constructor equivalent for upgradable contracts)."
+      },
+      "isJurorStaked(address)": {
+        "notice": "Checks if the juror is staked in any court."
+      },
+      "lockStake(address,uint256)": {
+        "notice": "Locks the tokens of the drawn juror."
+      },
+      "passPhase()": {
+        "notice": "Passes the phase."
+      },
+      "postDrawHook(uint256,uint256)": {
+        "notice": "Triggers the state changes after drawing."
+      },
+      "proxiableUUID()": {
+        "notice": "Implementation of the ERC1822 `proxiableUUID` function. This returns the storage slot used by the implementation. It is used to validate the implementation's compatibility when performing an upgrade."
+      },
+      "setStake(address,uint96,uint256,uint256,uint256)": {
+        "notice": "Update the state of the stakes, called by KC at the end of setStake flow."
+      },
+      "setStakePenalty(address,uint96,uint256)": {
+        "notice": "Update the state of the stakes with a PNK reward deposit, called by KC during rewards execution."
+      },
+      "setStakeReward(address,uint96,uint256)": {
+        "notice": "Update the state of the stakes with a PNK reward deposit, called by KC during rewards execution."
+      },
+      "unlockStake(address,uint256)": {
+        "notice": "Unlocks the tokens of the drawn juror."
+      },
+      "upgradeToAndCall(address,bytes)": {
+        "notice": "Upgrade mechanism including access control and UUPS-compliance."
+      },
+      "validateStake(address,uint96,uint256,bool)": {
+        "notice": "Validate the specified juror's new stake for a court."
+      },
+      "version()": {
+        "notice": "Returns the version of the implementation."
+      },
+      "withdrawLeftoverPNK(address)": {
+        "notice": "Gives back the locked PNKs in case the juror fully unstaked earlier."
+      }
+    },
+    "notice": "An adapted version of the SortitionModule contract for educational purposes.",
     "version": 1
   },
   "storageLayout": {
     "storage": [
       {
-        "astId": 26933,
+        "astId": 30225,
         "contract": "src/arbitration/university/SortitionModuleUniversity.sol:SortitionModuleUniversity",
-        "label": "governor",
+        "label": "owner",
         "offset": 0,
         "slot": "0",
         "type": "t_address"
       },
       {
-        "astId": 26936,
+        "astId": 30228,
         "contract": "src/arbitration/university/SortitionModuleUniversity.sol:SortitionModuleUniversity",
         "label": "core",
         "offset": 0,
         "slot": "1",
-        "type": "t_contract(KlerosCoreUniversity)26904"
+        "type": "t_contract(KlerosCoreUniversity)30192"
       },
       {
-        "astId": 26938,
+        "astId": 30230,
         "contract": "src/arbitration/university/SortitionModuleUniversity.sol:SortitionModuleUniversity",
         "label": "disputesWithoutJurors",
         "offset": 0,
@@ -741,15 +1177,15 @@
         "type": "t_uint256"
       },
       {
-        "astId": 26943,
+        "astId": 30235,
         "contract": "src/arbitration/university/SortitionModuleUniversity.sol:SortitionModuleUniversity",
         "label": "jurors",
         "offset": 0,
         "slot": "3",
-        "type": "t_mapping(t_address,t_struct(Juror)26931_storage)"
+        "type": "t_mapping(t_address,t_struct(Juror)30223_storage)"
       },
       {
-        "astId": 26945,
+        "astId": 30237,
         "contract": "src/arbitration/university/SortitionModuleUniversity.sol:SortitionModuleUniversity",
         "label": "transientJuror",
         "offset": 0,
@@ -769,17 +1205,17 @@
         "label": "uint96[]",
         "numberOfBytes": "32"
       },
-      "t_contract(KlerosCoreUniversity)26904": {
+      "t_contract(KlerosCoreUniversity)30192": {
         "encoding": "inplace",
         "label": "contract KlerosCoreUniversity",
         "numberOfBytes": "20"
       },
-      "t_mapping(t_address,t_struct(Juror)26931_storage)": {
+      "t_mapping(t_address,t_struct(Juror)30223_storage)": {
         "encoding": "mapping",
         "key": "t_address",
         "label": "mapping(address => struct SortitionModuleUniversity.Juror)",
         "numberOfBytes": "32",
-        "value": "t_struct(Juror)26931_storage"
+        "value": "t_struct(Juror)30223_storage"
       },
       "t_mapping(t_uint96,t_uint256)": {
         "encoding": "mapping",
@@ -788,12 +1224,12 @@
         "numberOfBytes": "32",
         "value": "t_uint256"
       },
-      "t_struct(Juror)26931_storage": {
+      "t_struct(Juror)30223_storage": {
         "encoding": "inplace",
         "label": "struct SortitionModuleUniversity.Juror",
         "members": [
           {
-            "astId": 26923,
+            "astId": 30215,
             "contract": "src/arbitration/university/SortitionModuleUniversity.sol:SortitionModuleUniversity",
             "label": "stakesByCourtID",
             "offset": 0,
@@ -801,7 +1237,7 @@
             "type": "t_mapping(t_uint96,t_uint256)"
           },
           {
-            "astId": 26926,
+            "astId": 30218,
             "contract": "src/arbitration/university/SortitionModuleUniversity.sol:SortitionModuleUniversity",
             "label": "courtIDs",
             "offset": 0,
@@ -809,7 +1245,7 @@
             "type": "t_array(t_uint96)dyn_storage"
           },
           {
-            "astId": 26928,
+            "astId": 30220,
             "contract": "src/arbitration/university/SortitionModuleUniversity.sol:SortitionModuleUniversity",
             "label": "stakedPnk",
             "offset": 0,
@@ -817,7 +1253,7 @@
             "type": "t_uint256"
           },
           {
-            "astId": 26930,
+            "astId": 30222,
             "contract": "src/arbitration/university/SortitionModuleUniversity.sol:SortitionModuleUniversity",
             "label": "lockedPnk",
             "offset": 0,
diff --git a/contracts/deployments/arbitrumSepoliaDevnet/SortitionModuleUniversity_Proxy.json b/contracts/deployments/arbitrumSepoliaDevnet/SortitionModuleUniversity_Proxy.json
index e098e68d0..642ee37b3 100644
--- a/contracts/deployments/arbitrumSepoliaDevnet/SortitionModuleUniversity_Proxy.json
+++ b/contracts/deployments/arbitrumSepoliaDevnet/SortitionModuleUniversity_Proxy.json
@@ -1,5 +1,5 @@
 {
-  "address": "0x4B2c2d048921f694cCE3AEa35698c6B1f5fcbb79",
+  "address": "0x9f55804177e7E44E558616cD7d06B865788214cA",
   "abi": [
     {
       "inputs": [
@@ -26,44 +26,44 @@
       "type": "receive"
     }
   ],
-  "transactionHash": "0xb26dc1c9ca9c3ed561a1d9c3feaad474af38bc90ea240f927053e5e5868d6a7e",
+  "transactionHash": "0x816a335385508eb3b23f6e38ecbdb464110275a0059895f982bfb692c8e7a452",
   "receipt": {
     "to": null,
     "from": "0xf1C7c037891525E360C59f708739Ac09A7670c59",
-    "contractAddress": "0x4B2c2d048921f694cCE3AEa35698c6B1f5fcbb79",
-    "transactionIndex": 1,
-    "gasUsed": "210047",
-    "logsBloom": "0x00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000080000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010800000020000000000000000080000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
-    "blockHash": "0x6a08d6d6cf180ae6bf3126f86fbedfd17212528b22a7a9403addd2dd6b1109c3",
-    "transactionHash": "0xb26dc1c9ca9c3ed561a1d9c3feaad474af38bc90ea240f927053e5e5868d6a7e",
+    "contractAddress": "0x9f55804177e7E44E558616cD7d06B865788214cA",
+    "transactionIndex": 2,
+    "gasUsed": "180483",
+    "logsBloom": "0x00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000080000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000800000000000000000000000080000000000000000000000000000000000000000000000000000000000020000000000000000000000000000000000000000000000000000000000000000004000000000000000000000000000000000000000008000000000000000000000000000000000000000000",
+    "blockHash": "0xeb89982fc4a65212a277169f078d43cd1578b93b962c37ded52f9ddeb92610af",
+    "transactionHash": "0x816a335385508eb3b23f6e38ecbdb464110275a0059895f982bfb692c8e7a452",
     "logs": [
       {
-        "transactionIndex": 1,
-        "blockNumber": 96308572,
-        "transactionHash": "0xb26dc1c9ca9c3ed561a1d9c3feaad474af38bc90ea240f927053e5e5868d6a7e",
-        "address": "0x4B2c2d048921f694cCE3AEa35698c6B1f5fcbb79",
+        "transactionIndex": 2,
+        "blockNumber": 193533797,
+        "transactionHash": "0x816a335385508eb3b23f6e38ecbdb464110275a0059895f982bfb692c8e7a452",
+        "address": "0x9f55804177e7E44E558616cD7d06B865788214cA",
         "topics": [
           "0xc7f505b2f371ae2175ee4913f4499e1f2633a7b5936321eed1cdaeb6115181d2"
         ],
         "data": "0x0000000000000000000000000000000000000000000000000000000000000001",
-        "logIndex": 0,
-        "blockHash": "0x6a08d6d6cf180ae6bf3126f86fbedfd17212528b22a7a9403addd2dd6b1109c3"
+        "logIndex": 1,
+        "blockHash": "0xeb89982fc4a65212a277169f078d43cd1578b93b962c37ded52f9ddeb92610af"
       }
     ],
-    "blockNumber": 96308572,
-    "cumulativeGasUsed": "210047",
+    "blockNumber": 193533797,
+    "cumulativeGasUsed": "214736",
     "status": 1,
     "byzantium": true
   },
   "args": [
-    "0x5CAD621D69E0535422aCFaCC0017bC32beC7A486",
-    "0x485cc955000000000000000000000000f1c7c037891525e360c59f708739ac09a7670c590000000000000000000000005ab37f38778bc175852fa353056591d91c744ce6"
+    "0x270e3D63d3d275604df0a1Bd312E1255DCd96936",
+    "0x485cc955000000000000000000000000f1c7c037891525e360c59f708739ac09a7670c59000000000000000000000000a34dbbd0e5e1d09bd683455f9dbc393797bc558f"
   ],
   "numDeployments": 1,
-  "solcInputHash": "a5602534c00c2f67ca4b6a1cab8c717e",
-  "metadata": "{\"compiler\":{\"version\":\"0.8.24+commit.e11b9ed9\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_implementation\",\"type\":\"address\"},{\"internalType\":\"bytes\",\"name\":\"_data\",\"type\":\"bytes\"}],\"stateMutability\":\"nonpayable\",\"type\":\"constructor\"},{\"stateMutability\":\"payable\",\"type\":\"fallback\"},{\"stateMutability\":\"payable\",\"type\":\"receive\"}],\"devdoc\":{\"kind\":\"dev\",\"methods\":{},\"version\":1},\"userdoc\":{\"kind\":\"user\",\"methods\":{},\"version\":1}},\"settings\":{\"compilationTarget\":{\"src/proxy/KlerosProxies.sol\":\"SortitionModuleUniversityProxy\"},\"evmVersion\":\"paris\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\",\"useLiteralContent\":true},\"optimizer\":{\"enabled\":true,\"runs\":100},\"remappings\":[]},\"sources\":{\"src/proxy/KlerosProxies.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n\\npragma solidity 0.8.24;\\n\\nimport \\\"./UUPSProxy.sol\\\";\\n\\n/// Workaround to get meaningful names for the proxy contracts\\n/// Otherwise all the contracts are called `UUPSProxy` on the chain explorers\\n\\ncontract DisputeKitClassicNeoProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitClassicUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitClassicProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeTemplateRegistryProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract EvidenceModuleProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract ForeignGatewayOnEthereumProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract HomeGatewayToEthereumProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreNeoProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreRulerProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract PolicyRegistryProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract RandomizerRNGProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleNeoProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\",\"keccak256\":\"0x4393c05bbfda204b9992e1e546142a0fbf4c92a1c4061f5985463d02a71b84d4\",\"license\":\"MIT\"},\"src/proxy/UUPSProxy.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n// Adapted from <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/ERC1967/ERC1967Proxy.sol>\\n\\n/**\\n *  @authors: [@malatrax]\\n *  @reviewers: []\\n *  @auditors: []\\n *  @bounties: []\\n *  @deployments: []\\n */\\npragma solidity 0.8.24;\\n\\n/**\\n * @title UUPS Proxy\\n * @author Simon Malatrait <simon.malatrait@grenoble-inp.org>\\n * @dev This contract implements a UUPS Proxy compliant with ERC-1967 & ERC-1822.\\n * @dev This contract delegates all calls to another contract (UUPS Proxiable) through a fallback function and the use of the `delegatecall` EVM instruction.\\n * @dev We refer to the Proxiable contract (as per ERC-1822) with `implementation`.\\n */\\ncontract UUPSProxy {\\n    /**\\n     * @dev Storage slot with the address of the current implementation.\\n     * This is the keccak-256 hash of \\\"eip1967.proxy.implementation\\\" subtracted by 1, and is\\n     * validated in the constructor.\\n     * NOTE: bytes32(uint256(keccak256('eip1967.proxy.implementation')) - 1)\\n     */\\n    bytes32 private constant IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;\\n\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Initializes the upgradeable proxy with an initial implementation specified by `_implementation`.\\n     *\\n     * If `_data` is nonempty, it's used as data in a delegate call to `_implementation`. This will typically be an encoded\\n     * function call, and allows initializing the storage of the proxy like a Solidity constructor.\\n     */\\n    constructor(address _implementation, bytes memory _data) {\\n        assembly {\\n            sstore(IMPLEMENTATION_SLOT, _implementation)\\n        }\\n\\n        if (_data.length != 0) {\\n            (bool success, ) = _implementation.delegatecall(_data);\\n            require(success, \\\"Proxy Constructor failed\\\");\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Delegates the current call to `implementation`.\\n     *\\n     * NOTE: This function does not return to its internal call site, it will return directly to the external caller.\\n     */\\n    function _delegate(address implementation) internal {\\n        assembly {\\n            // Copy msg.data. We take full control of memory in this inline assembly\\n            // block because it will not return to Solidity code. We overwrite the\\n            // Solidity scratch pad at memory position 0.\\n            calldatacopy(0, 0, calldatasize())\\n\\n            // Call the implementation.\\n            // out and outsize are 0 because we don't know the size yet.\\n            let result := delegatecall(gas(), implementation, 0, calldatasize(), 0, 0)\\n\\n            // Copy the returned data.\\n            returndatacopy(0, 0, returndatasize())\\n\\n            switch result\\n            // delegatecall returns 0 on error.\\n            case 0 {\\n                revert(0, returndatasize())\\n            }\\n            default {\\n                return(0, returndatasize())\\n            }\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Internal Views            * //\\n    // ************************************* //\\n\\n    function _getImplementation() internal view returns (address implementation) {\\n        assembly {\\n            implementation := sload(IMPLEMENTATION_SLOT)\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Fallback                * //\\n    // ************************************* //\\n\\n    /**\\n     * @dev Fallback function that delegates calls to the address returned by `_implementation()`. Will run if no other\\n     * function in the contract matches the call data.\\n     */\\n    fallback() external payable {\\n        _delegate(_getImplementation());\\n    }\\n\\n    receive() external payable {\\n        _delegate(_getImplementation());\\n    }\\n}\\n\",\"keccak256\":\"0x7aa5f14ce351299722ac1a1afca9e65e1c795f32ea3e9702b0d5faaf7ca822a0\",\"license\":\"MIT\"}},\"version\":1}",
-  "bytecode": "0x608060405234801561001057600080fd5b5060405161030238038061030283398101604081905261002f91610151565b8181817f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc55805160001461010e576000826001600160a01b031682604051610077919061021f565b600060405180830381855af49150503d80600081146100b2576040519150601f19603f3d011682016040523d82523d6000602084013e6100b7565b606091505b505090508061010c5760405162461bcd60e51b815260206004820152601860248201527f50726f787920436f6e7374727563746f72206661696c65640000000000000000604482015260640160405180910390fd5b505b5050505061023b565b634e487b7160e01b600052604160045260246000fd5b60005b83811015610148578181015183820152602001610130565b50506000910152565b6000806040838503121561016457600080fd5b82516001600160a01b038116811461017b57600080fd5b60208401519092506001600160401b038082111561019857600080fd5b818501915085601f8301126101ac57600080fd5b8151818111156101be576101be610117565b604051601f8201601f19908116603f011681019083821181831017156101e6576101e6610117565b816040528281528860208487010111156101ff57600080fd5b61021083602083016020880161012d565b80955050505050509250929050565b6000825161023181846020870161012d565b9190910192915050565b60b9806102496000396000f3fe608060405236603757603560317f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5490565b6060565b005b603560317f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5490565b3660008037600080366000845af43d6000803e808015607e573d6000f35b3d6000fdfea2646970667358221220cbf6c95b71e3c03306025a1af7f6aa4f021b4a8c8f5a8c68988b35c4442edb4964736f6c63430008180033",
-  "deployedBytecode": "0x608060405236603757603560317f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5490565b6060565b005b603560317f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5490565b3660008037600080366000845af43d6000803e808015607e573d6000f35b3d6000fdfea2646970667358221220cbf6c95b71e3c03306025a1af7f6aa4f021b4a8c8f5a8c68988b35c4442edb4964736f6c63430008180033",
+  "solcInputHash": "d547d738900bce1310e91a5d1adfc179",
+  "metadata": "{\"compiler\":{\"version\":\"0.8.30+commit.73712a01\"},\"language\":\"Solidity\",\"output\":{\"abi\":[{\"inputs\":[{\"internalType\":\"address\",\"name\":\"_implementation\",\"type\":\"address\"},{\"internalType\":\"bytes\",\"name\":\"_data\",\"type\":\"bytes\"}],\"stateMutability\":\"nonpayable\",\"type\":\"constructor\"},{\"stateMutability\":\"payable\",\"type\":\"fallback\"},{\"stateMutability\":\"payable\",\"type\":\"receive\"}],\"devdoc\":{\"kind\":\"dev\",\"methods\":{},\"version\":1},\"userdoc\":{\"kind\":\"user\",\"methods\":{},\"version\":1}},\"settings\":{\"compilationTarget\":{\"src/proxy/KlerosProxies.sol\":\"SortitionModuleUniversityProxy\"},\"evmVersion\":\"cancun\",\"libraries\":{},\"metadata\":{\"bytecodeHash\":\"ipfs\",\"useLiteralContent\":true},\"optimizer\":{\"enabled\":true,\"runs\":1000},\"remappings\":[],\"viaIR\":true},\"sources\":{\"src/proxy/KlerosProxies.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\nimport \\\"./UUPSProxy.sol\\\";\\n\\n/// Workaround to get meaningful names for the proxy contracts\\n/// Otherwise all the contracts are called `UUPSProxy` on the chain explorers\\n\\ncontract DisputeKitClassicUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitClassicProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitGatedProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitGatedShutterProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitShutterProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeKitSybilResistantProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract DisputeTemplateRegistryProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract EvidenceModuleProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract ForeignGatewayOnEthereumProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract HomeGatewayToEthereumProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreRulerProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract KlerosCoreProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract PolicyRegistryProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract RandomizerRNGProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleUniversityProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\\ncontract SortitionModuleProxy is UUPSProxy {\\n    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}\\n}\\n\",\"keccak256\":\"0x3160bd320b23c6ec0c21862b455c3044a9b33654ae84a1b6cd76255626c9154b\",\"license\":\"MIT\"},\"src/proxy/UUPSProxy.sol\":{\"content\":\"//SPDX-License-Identifier: MIT\\n\\npragma solidity ^0.8.24;\\n\\n/// @title UUPS Proxy\\n/// @author Simon Malatrait <simon.malatrait@grenoble-inp.org>\\n/// @notice This contract implements a UUPS Proxy compliant with ERC-1967 & ERC-1822.\\n///\\n/// @dev This contract delegates all calls to another contract (UUPS Proxiable) through a fallback function and the use of the `delegatecall` EVM instruction.\\n/// We refer to the Proxiable contract (as per ERC-1822) with `implementation`.\\n/// Adapted from <https://github.com/OpenZeppelin/openzeppelin-contracts/blob/v4.9.0/contracts/proxy/ERC1967/ERC1967Proxy.sol>\\ncontract UUPSProxy {\\n    /// @dev Storage slot with the address of the current implementation.\\n    /// This is the keccak-256 hash of \\\"eip1967.proxy.implementation\\\" subtracted by 1, and is\\n    /// validated in the constructor.\\n    /// NOTE: bytes32(uint256(keccak256('eip1967.proxy.implementation')) - 1)\\n    bytes32 private constant IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;\\n\\n    // ************************************* //\\n    // *            Constructor            * //\\n    // ************************************* //\\n\\n    /// @notice Initializes the upgradeable proxy with an initial implementation specified by `_implementation`.\\n    /// @dev If `_data` is nonempty, it's used as data in a delegate call to `_implementation`.\\n    /// This will typically be an encoded function call, and allows initializing the storage of the proxy like a Solidity constructor.\\n    constructor(address _implementation, bytes memory _data) {\\n        assembly {\\n            sstore(IMPLEMENTATION_SLOT, _implementation)\\n        }\\n\\n        if (_data.length != 0) {\\n            (bool success, ) = _implementation.delegatecall(_data);\\n            require(success, \\\"Proxy Constructor failed\\\");\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *         State Modifiers           * //\\n    // ************************************* //\\n\\n    /// @dev Delegates the current call to `implementation`.\\n    /// NOTE: This function does not return to its internal call site, it will return directly to the external caller.\\n    function _delegate(address implementation) internal {\\n        assembly {\\n            // Copy msg.data. We take full control of memory in this inline assembly\\n            // block because it will not return to Solidity code. We overwrite the\\n            // Solidity scratch pad at memory position 0.\\n            calldatacopy(0, 0, calldatasize())\\n\\n            // Call the implementation.\\n            // out and outsize are 0 because we don't know the size yet.\\n            let result := delegatecall(gas(), implementation, 0, calldatasize(), 0, 0)\\n\\n            // Copy the returned data.\\n            returndatacopy(0, 0, returndatasize())\\n\\n            switch result\\n            // delegatecall returns 0 on error.\\n            case 0 {\\n                revert(0, returndatasize())\\n            }\\n            default {\\n                return(0, returndatasize())\\n            }\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Internal Views            * //\\n    // ************************************* //\\n\\n    function _getImplementation() internal view returns (address implementation) {\\n        assembly {\\n            implementation := sload(IMPLEMENTATION_SLOT)\\n        }\\n    }\\n\\n    // ************************************* //\\n    // *           Fallback                * //\\n    // ************************************* //\\n\\n    /// @dev Fallback function that delegates calls to the address returned by `_implementation()`.\\n    /// @dev Will run if no other function in the contract matches the call data.\\n    fallback() external payable {\\n        _delegate(_getImplementation());\\n    }\\n\\n    receive() external payable {\\n        _delegate(_getImplementation());\\n    }\\n}\\n\",\"keccak256\":\"0x2d7b1f81e525787f1b8b033ce381a81cb5f39e411ff31490e019113205a661cd\",\"license\":\"MIT\"}},\"version\":1}",
+  "bytecode": "0x608060405234610144576102148038038061001981610148565b928339810190604081830312610144578051906001600160a01b0382168203610144576020810151906001600160401b038211610144570182601f8201121561014457805161006f61006a82610181565b610148565b9181835260208301946020838301011161014457815f926020809301875e83010152817f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc5551806100c9575b6040516077908161019d8239f35b5f9283925af43d1561013f573d6100e261006a82610181565b9081525f60203d92013e5b156100fa575f80806100bb565b60405162461bcd60e51b815260206004820152601860248201527f50726f787920436f6e7374727563746f72206661696c656400000000000000006044820152606490fd5b6100ed565b5f80fd5b6040519190601f01601f191682016001600160401b0381118382101761016d57604052565b634e487b7160e01b5f52604160045260245ffd5b6001600160401b03811161016d57601f01601f19166020019056fe60806040525f807f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc54368280378136915af43d5f803e15603d573d5ff35b3d5ffdfea2646970667358221220cebc238294db6f217e59b4194d65c951358927be9872c8bda288fff77348423e64736f6c634300081e0033",
+  "deployedBytecode": "0x60806040525f807f360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc54368280378136915af43d5f803e15603d573d5ff35b3d5ffdfea2646970667358221220cebc238294db6f217e59b4194d65c951358927be9872c8bda288fff77348423e64736f6c634300081e0033",
   "devdoc": {
     "kind": "dev",
     "methods": {},
diff --git a/contracts/deployments/contractsEthers.ts b/contracts/deployments/contractsEthers.ts
index b5da4705e..dbddee21e 100644
--- a/contracts/deployments/contractsEthers.ts
+++ b/contracts/deployments/contractsEthers.ts
@@ -18,6 +18,7 @@ import {
   klerosCoreUniversityConfig as devnetCoreUniversityConfig,
   sortitionModuleUniversityConfig as devnetSortitionUniversityConfig,
   disputeKitClassicUniversityConfig as devnetDkClassicUniversityConfig,
+  disputeTemplateRegistryUniversityConfig as devnetDtrUniversityConfig,
   disputeResolverUniversityConfig as devnetDrUniversityConfig,
 } from "./devnet.viem";
 import {
@@ -206,7 +207,7 @@ export const getContracts = async (provider: ethers.Provider, deployment: Deploy
         {
           dkClassicConfig: devnetDkClassicUniversityConfig,
           drConfig: devnetDrUniversityConfig,
-          dtrConfig: devnetDtrConfig,
+          dtrConfig: devnetDtrUniversityConfig,
           evidenceConfig: devnetEvidenceConfig,
           policyRegistryConfig: devnetPolicyRegistryConfig,
           batcherConfig: devnetBatcherConfig,
diff --git a/contracts/deployments/contractsViem.ts b/contracts/deployments/contractsViem.ts
index 7a7338d71..f072acd9f 100644
--- a/contracts/deployments/contractsViem.ts
+++ b/contracts/deployments/contractsViem.ts
@@ -19,6 +19,7 @@ import {
   klerosCoreUniversityConfig as devnetCoreUniversityConfig,
   sortitionModuleUniversityConfig as devnetSortitionUniversityConfig,
   disputeKitClassicUniversityConfig as devnetDkClassicUniversityConfig,
+  disputeTemplateRegistryUniversityConfig as devnetDtrUniversityConfig,
   disputeResolverUniversityConfig as devnetDrUniversityConfig,
 } from "./devnet.viem";
 import {
@@ -172,7 +173,7 @@ export const getConfigs = ({ deployment }: { deployment: DeploymentName }): Cont
         sortition: getContractConfig({ config: devnetSortitionUniversityConfig, chainId }),
         disputeKitClassic: getContractConfig({ config: devnetDkClassicUniversityConfig, chainId }),
         disputeResolver: getContractConfig({ config: devnetDrUniversityConfig, chainId }),
-        disputeTemplateRegistry: getContractConfig({ config: devnetDtrConfig, chainId }), // FIXME: should not be shared with devnet
+        disputeTemplateRegistry: getContractConfig({ config: devnetDtrUniversityConfig, chainId }),
         evidence: getContractConfig({ config: devnetEvidenceConfig, chainId }), // Not arbitrator specific
         policyRegistry: getContractConfig({ config: devnetPolicyRegistryConfig, chainId }), // Not arbitrator specific
         transactionBatcher: getContractConfig({ config: devnetBatcherConfig, chainId }), // Not arbitrator specific
diff --git a/contracts/deployments/devnet.viem.ts b/contracts/deployments/devnet.viem.ts
index f7a7214bd..9cfb583b9 100644
--- a/contracts/deployments/devnet.viem.ts
+++ b/contracts/deployments/devnet.viem.ts
@@ -2630,25 +2630,43 @@ export const disputeKitClassicConfig = {
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xd6E96b7c993763B5CDDa1139C7387B82A7c8B8B5)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x82F2089442979A6b56c80274D144575980092F91)
  */
 export const disputeKitClassicUniversityAbi = [
   { type: "fallback", stateMutability: "payable" },
   { type: "receive", stateMutability: "payable" },
   { type: "error", inputs: [], name: "AlreadyInitialized" },
+  { type: "error", inputs: [], name: "AppealFeeIsAlreadyPaid" },
+  { type: "error", inputs: [], name: "AppealPeriodIsOver" },
+  { type: "error", inputs: [], name: "AppealPeriodIsOverForLoser" },
+  { type: "error", inputs: [], name: "ChoiceOutOfBounds" },
+  { type: "error", inputs: [], name: "CoreIsPaused" },
+  { type: "error", inputs: [], name: "DisputeJumpedToParentDK" },
+  { type: "error", inputs: [], name: "DisputeNotResolved" },
+  { type: "error", inputs: [], name: "EmptyCommit" },
+  { type: "error", inputs: [], name: "EmptyVoteIDs" },
   { type: "error", inputs: [], name: "FailedDelegateCall" },
+  { type: "error", inputs: [], name: "HashDoesNotMatchHiddenVoteCommitment" },
   {
     type: "error",
     inputs: [{ name: "implementation", internalType: "address", type: "address" }],
     name: "InvalidImplementation",
   },
+  { type: "error", inputs: [], name: "JurorHasToOwnTheVote" },
+  { type: "error", inputs: [], name: "KlerosCoreOnly" },
+  { type: "error", inputs: [], name: "NotActiveForCoreDisputeID" },
+  { type: "error", inputs: [], name: "NotCommitPeriod" },
   { type: "error", inputs: [], name: "NotInitializing" },
+  { type: "error", inputs: [], name: "NotVotePeriod" },
+  { type: "error", inputs: [], name: "OwnerOnly" },
   { type: "error", inputs: [], name: "UUPSUnauthorizedCallContext" },
   {
     type: "error",
     inputs: [{ name: "slot", internalType: "bytes32", type: "bytes32" }],
     name: "UUPSUnsupportedProxiableUUID",
   },
+  { type: "error", inputs: [], name: "UnsuccessfulCall" },
+  { type: "error", inputs: [], name: "VoteAlreadyCast" },
   {
     type: "event",
     anonymous: false,
@@ -2881,13 +2899,6 @@ export const disputeKitClassicUniversityAbi = [
     outputs: [{ name: "", internalType: "uint256", type: "uint256" }],
     stateMutability: "view",
   },
-  {
-    type: "function",
-    inputs: [],
-    name: "ONE_BASIS_POINT",
-    outputs: [{ name: "", internalType: "uint256", type: "uint256" }],
-    stateMutability: "view",
-  },
   {
     type: "function",
     inputs: [],
@@ -2942,8 +2953,15 @@ export const disputeKitClassicUniversityAbi = [
   },
   {
     type: "function",
-    inputs: [{ name: "_governor", internalType: "address payable", type: "address" }],
-    name: "changeGovernor",
+    inputs: [{ name: "_jumpDisputeKitID", internalType: "uint256", type: "uint256" }],
+    name: "changeJumpDisputeKitID",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
+  {
+    type: "function",
+    inputs: [{ name: "_owner", internalType: "address payable", type: "address" }],
+    name: "changeOwner",
     outputs: [],
     stateMutability: "nonpayable",
   },
@@ -2954,6 +2972,13 @@ export const disputeKitClassicUniversityAbi = [
     outputs: [{ name: "", internalType: "contract KlerosCore", type: "address" }],
     stateMutability: "view",
   },
+  {
+    type: "function",
+    inputs: [{ name: "coreDisputeID", internalType: "uint256", type: "uint256" }],
+    name: "coreDisputeIDToActive",
+    outputs: [{ name: "", internalType: "bool", type: "bool" }],
+    stateMutability: "view",
+  },
   {
     type: "function",
     inputs: [{ name: "", internalType: "uint256", type: "uint256" }],
@@ -2967,7 +2992,7 @@ export const disputeKitClassicUniversityAbi = [
       { name: "_coreDisputeID", internalType: "uint256", type: "uint256" },
       { name: "_numberOfChoices", internalType: "uint256", type: "uint256" },
       { name: "_extraData", internalType: "bytes", type: "bytes" },
-      { name: "_nbVotes", internalType: "uint256", type: "uint256" },
+      { name: "", internalType: "uint256", type: "uint256" },
     ],
     name: "createDispute",
     outputs: [],
@@ -3002,9 +3027,19 @@ export const disputeKitClassicUniversityAbi = [
       { name: "_nonce", internalType: "uint256", type: "uint256" },
     ],
     name: "draw",
-    outputs: [{ name: "drawnAddress", internalType: "address", type: "address" }],
+    outputs: [
+      { name: "drawnAddress", internalType: "address", type: "address" },
+      { name: "fromSubcourtID", internalType: "uint96", type: "uint96" },
+    ],
     stateMutability: "nonpayable",
   },
+  {
+    type: "function",
+    inputs: [{ name: "", internalType: "uint256", type: "uint256" }],
+    name: "earlyCourtJump",
+    outputs: [{ name: "", internalType: "bool", type: "bool" }],
+    stateMutability: "pure",
+  },
   {
     type: "function",
     inputs: [
@@ -3012,7 +3047,7 @@ export const disputeKitClassicUniversityAbi = [
       { name: "_amount", internalType: "uint256", type: "uint256" },
       { name: "_data", internalType: "bytes", type: "bytes" },
     ],
-    name: "executeGovernorProposal",
+    name: "executeOwnerProposal",
     outputs: [],
     stateMutability: "nonpayable",
   },
@@ -3045,8 +3080,24 @@ export const disputeKitClassicUniversityAbi = [
       { name: "", internalType: "uint256", type: "uint256" },
       { name: "", internalType: "uint256", type: "uint256" },
     ],
-    name: "getDegreeOfCoherence",
-    outputs: [{ name: "", internalType: "uint256", type: "uint256" }],
+    name: "getDegreeOfCoherencePenalty",
+    outputs: [{ name: "pnkCoherence", internalType: "uint256", type: "uint256" }],
+    stateMutability: "view",
+  },
+  {
+    type: "function",
+    inputs: [
+      { name: "_coreDisputeID", internalType: "uint256", type: "uint256" },
+      { name: "_coreRoundID", internalType: "uint256", type: "uint256" },
+      { name: "_voteID", internalType: "uint256", type: "uint256" },
+      { name: "", internalType: "uint256", type: "uint256" },
+      { name: "", internalType: "uint256", type: "uint256" },
+    ],
+    name: "getDegreeOfCoherenceReward",
+    outputs: [
+      { name: "pnkCoherence", internalType: "uint256", type: "uint256" },
+      { name: "feeCoherence", internalType: "uint256", type: "uint256" },
+    ],
     stateMutability: "view",
   },
   {
@@ -3056,6 +3107,43 @@ export const disputeKitClassicUniversityAbi = [
     outputs: [{ name: "fundedChoices", internalType: "uint256[]", type: "uint256[]" }],
     stateMutability: "view",
   },
+  {
+    type: "function",
+    inputs: [],
+    name: "getJumpDisputeKitID",
+    outputs: [{ name: "", internalType: "uint256", type: "uint256" }],
+    stateMutability: "view",
+  },
+  {
+    type: "function",
+    inputs: [
+      { name: "_coreDisputeID", internalType: "uint256", type: "uint256" },
+      { name: "_coreRoundID", internalType: "uint256", type: "uint256" },
+    ],
+    name: "getLocalDisputeRoundID",
+    outputs: [
+      { name: "localDisputeID", internalType: "uint256", type: "uint256" },
+      { name: "localRoundID", internalType: "uint256", type: "uint256" },
+    ],
+    stateMutability: "view",
+  },
+  {
+    type: "function",
+    inputs: [
+      { name: "", internalType: "contract IDisputeKit", type: "address" },
+      { name: "_currentNbVotes", internalType: "uint256", type: "uint256" },
+    ],
+    name: "getNbVotesAfterAppeal",
+    outputs: [{ name: "", internalType: "uint256", type: "uint256" }],
+    stateMutability: "pure",
+  },
+  {
+    type: "function",
+    inputs: [{ name: "_localDisputeID", internalType: "uint256", type: "uint256" }],
+    name: "getNumberOfRounds",
+    outputs: [{ name: "", internalType: "uint256", type: "uint256" }],
+    stateMutability: "view",
+  },
   {
     type: "function",
     inputs: [
@@ -3068,7 +3156,7 @@ export const disputeKitClassicUniversityAbi = [
       { name: "winningChoice", internalType: "uint256", type: "uint256" },
       { name: "tied", internalType: "bool", type: "bool" },
       { name: "totalVoted", internalType: "uint256", type: "uint256" },
-      { name: "totalCommited", internalType: "uint256", type: "uint256" },
+      { name: "totalCommitted", internalType: "uint256", type: "uint256" },
       { name: "nbVoters", internalType: "uint256", type: "uint256" },
       { name: "choiceCount", internalType: "uint256", type: "uint256" },
     ],
@@ -3092,21 +3180,34 @@ export const disputeKitClassicUniversityAbi = [
   },
   {
     type: "function",
-    inputs: [],
-    name: "governor",
-    outputs: [{ name: "", internalType: "address", type: "address" }],
+    inputs: [
+      { name: "_choice", internalType: "uint256", type: "uint256" },
+      { name: "_salt", internalType: "uint256", type: "uint256" },
+      { name: "", internalType: "string", type: "string" },
+    ],
+    name: "hashVote",
+    outputs: [{ name: "", internalType: "bytes32", type: "bytes32" }],
     stateMutability: "view",
   },
   {
     type: "function",
     inputs: [
-      { name: "_governor", internalType: "address", type: "address" },
+      { name: "_owner", internalType: "address", type: "address" },
       { name: "_core", internalType: "contract KlerosCore", type: "address" },
+      { name: "_wNative", internalType: "address", type: "address" },
+      { name: "_jumpDisputeKitID", internalType: "uint256", type: "uint256" },
     ],
     name: "initialize",
     outputs: [],
     stateMutability: "nonpayable",
   },
+  {
+    type: "function",
+    inputs: [{ name: "_coreDisputeID", internalType: "uint256", type: "uint256" }],
+    name: "isAppealFunded",
+    outputs: [{ name: "", internalType: "bool", type: "bool" }],
+    stateMutability: "view",
+  },
   {
     type: "function",
     inputs: [
@@ -3118,6 +3219,20 @@ export const disputeKitClassicUniversityAbi = [
     outputs: [{ name: "", internalType: "bool", type: "bool" }],
     stateMutability: "view",
   },
+  {
+    type: "function",
+    inputs: [],
+    name: "jumpDisputeKitID",
+    outputs: [{ name: "", internalType: "uint256", type: "uint256" }],
+    stateMutability: "view",
+  },
+  {
+    type: "function",
+    inputs: [],
+    name: "owner",
+    outputs: [{ name: "", internalType: "address", type: "address" }],
+    stateMutability: "view",
+  },
   {
     type: "function",
     inputs: [],
@@ -3125,6 +3240,13 @@ export const disputeKitClassicUniversityAbi = [
     outputs: [{ name: "", internalType: "bytes32", type: "bytes32" }],
     stateMutability: "view",
   },
+  {
+    type: "function",
+    inputs: [],
+    name: "singleDrawPerJuror",
+    outputs: [{ name: "", internalType: "bool", type: "bool" }],
+    stateMutability: "view",
+  },
   {
     type: "function",
     inputs: [
@@ -3135,6 +3257,20 @@ export const disputeKitClassicUniversityAbi = [
     outputs: [],
     stateMutability: "payable",
   },
+  {
+    type: "function",
+    inputs: [],
+    name: "version",
+    outputs: [{ name: "", internalType: "string", type: "string" }],
+    stateMutability: "view",
+  },
+  {
+    type: "function",
+    inputs: [],
+    name: "wNative",
+    outputs: [{ name: "", internalType: "address", type: "address" }],
+    stateMutability: "view",
+  },
   {
     type: "function",
     inputs: [
@@ -3162,14 +3298,14 @@ export const disputeKitClassicUniversityAbi = [
 ] as const;
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xd6E96b7c993763B5CDDa1139C7387B82A7c8B8B5)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x82F2089442979A6b56c80274D144575980092F91)
  */
 export const disputeKitClassicUniversityAddress = {
-  421614: "0xd6E96b7c993763B5CDDa1139C7387B82A7c8B8B5",
+  421614: "0x82F2089442979A6b56c80274D144575980092F91",
 } as const;
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xd6E96b7c993763B5CDDa1139C7387B82A7c8B8B5)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x82F2089442979A6b56c80274D144575980092F91)
  */
 export const disputeKitClassicUniversityConfig = {
   address: disputeKitClassicUniversityAddress,
@@ -3181,24 +3317,42 @@ export const disputeKitClassicUniversityConfig = {
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x87e863b94d2CB79A8aB53bD87Dc4A10E11C0918B)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x602ADa1cE706404BFb5417e497cdDae934436081)
  */
 export const disputeKitClassicUniversityImplementationAbi = [
   { type: "constructor", inputs: [], stateMutability: "nonpayable" },
   { type: "error", inputs: [], name: "AlreadyInitialized" },
+  { type: "error", inputs: [], name: "AppealFeeIsAlreadyPaid" },
+  { type: "error", inputs: [], name: "AppealPeriodIsOver" },
+  { type: "error", inputs: [], name: "AppealPeriodIsOverForLoser" },
+  { type: "error", inputs: [], name: "ChoiceOutOfBounds" },
+  { type: "error", inputs: [], name: "CoreIsPaused" },
+  { type: "error", inputs: [], name: "DisputeJumpedToParentDK" },
+  { type: "error", inputs: [], name: "DisputeNotResolved" },
+  { type: "error", inputs: [], name: "EmptyCommit" },
+  { type: "error", inputs: [], name: "EmptyVoteIDs" },
   { type: "error", inputs: [], name: "FailedDelegateCall" },
+  { type: "error", inputs: [], name: "HashDoesNotMatchHiddenVoteCommitment" },
   {
     type: "error",
     inputs: [{ name: "implementation", internalType: "address", type: "address" }],
     name: "InvalidImplementation",
   },
+  { type: "error", inputs: [], name: "JurorHasToOwnTheVote" },
+  { type: "error", inputs: [], name: "KlerosCoreOnly" },
+  { type: "error", inputs: [], name: "NotActiveForCoreDisputeID" },
+  { type: "error", inputs: [], name: "NotCommitPeriod" },
   { type: "error", inputs: [], name: "NotInitializing" },
+  { type: "error", inputs: [], name: "NotVotePeriod" },
+  { type: "error", inputs: [], name: "OwnerOnly" },
   { type: "error", inputs: [], name: "UUPSUnauthorizedCallContext" },
   {
     type: "error",
     inputs: [{ name: "slot", internalType: "bytes32", type: "bytes32" }],
     name: "UUPSUnsupportedProxiableUUID",
   },
+  { type: "error", inputs: [], name: "UnsuccessfulCall" },
+  { type: "error", inputs: [], name: "VoteAlreadyCast" },
   {
     type: "event",
     anonymous: false,
@@ -3431,13 +3585,6 @@ export const disputeKitClassicUniversityImplementationAbi = [
     outputs: [{ name: "", internalType: "uint256", type: "uint256" }],
     stateMutability: "view",
   },
-  {
-    type: "function",
-    inputs: [],
-    name: "ONE_BASIS_POINT",
-    outputs: [{ name: "", internalType: "uint256", type: "uint256" }],
-    stateMutability: "view",
-  },
   {
     type: "function",
     inputs: [],
@@ -3492,8 +3639,15 @@ export const disputeKitClassicUniversityImplementationAbi = [
   },
   {
     type: "function",
-    inputs: [{ name: "_governor", internalType: "address payable", type: "address" }],
-    name: "changeGovernor",
+    inputs: [{ name: "_jumpDisputeKitID", internalType: "uint256", type: "uint256" }],
+    name: "changeJumpDisputeKitID",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
+  {
+    type: "function",
+    inputs: [{ name: "_owner", internalType: "address payable", type: "address" }],
+    name: "changeOwner",
     outputs: [],
     stateMutability: "nonpayable",
   },
@@ -3504,6 +3658,13 @@ export const disputeKitClassicUniversityImplementationAbi = [
     outputs: [{ name: "", internalType: "contract KlerosCore", type: "address" }],
     stateMutability: "view",
   },
+  {
+    type: "function",
+    inputs: [{ name: "coreDisputeID", internalType: "uint256", type: "uint256" }],
+    name: "coreDisputeIDToActive",
+    outputs: [{ name: "", internalType: "bool", type: "bool" }],
+    stateMutability: "view",
+  },
   {
     type: "function",
     inputs: [{ name: "", internalType: "uint256", type: "uint256" }],
@@ -3517,7 +3678,7 @@ export const disputeKitClassicUniversityImplementationAbi = [
       { name: "_coreDisputeID", internalType: "uint256", type: "uint256" },
       { name: "_numberOfChoices", internalType: "uint256", type: "uint256" },
       { name: "_extraData", internalType: "bytes", type: "bytes" },
-      { name: "_nbVotes", internalType: "uint256", type: "uint256" },
+      { name: "", internalType: "uint256", type: "uint256" },
     ],
     name: "createDispute",
     outputs: [],
@@ -3552,9 +3713,19 @@ export const disputeKitClassicUniversityImplementationAbi = [
       { name: "_nonce", internalType: "uint256", type: "uint256" },
     ],
     name: "draw",
-    outputs: [{ name: "drawnAddress", internalType: "address", type: "address" }],
+    outputs: [
+      { name: "drawnAddress", internalType: "address", type: "address" },
+      { name: "fromSubcourtID", internalType: "uint96", type: "uint96" },
+    ],
     stateMutability: "nonpayable",
   },
+  {
+    type: "function",
+    inputs: [{ name: "", internalType: "uint256", type: "uint256" }],
+    name: "earlyCourtJump",
+    outputs: [{ name: "", internalType: "bool", type: "bool" }],
+    stateMutability: "pure",
+  },
   {
     type: "function",
     inputs: [
@@ -3562,7 +3733,7 @@ export const disputeKitClassicUniversityImplementationAbi = [
       { name: "_amount", internalType: "uint256", type: "uint256" },
       { name: "_data", internalType: "bytes", type: "bytes" },
     ],
-    name: "executeGovernorProposal",
+    name: "executeOwnerProposal",
     outputs: [],
     stateMutability: "nonpayable",
   },
@@ -3595,8 +3766,24 @@ export const disputeKitClassicUniversityImplementationAbi = [
       { name: "", internalType: "uint256", type: "uint256" },
       { name: "", internalType: "uint256", type: "uint256" },
     ],
-    name: "getDegreeOfCoherence",
-    outputs: [{ name: "", internalType: "uint256", type: "uint256" }],
+    name: "getDegreeOfCoherencePenalty",
+    outputs: [{ name: "pnkCoherence", internalType: "uint256", type: "uint256" }],
+    stateMutability: "view",
+  },
+  {
+    type: "function",
+    inputs: [
+      { name: "_coreDisputeID", internalType: "uint256", type: "uint256" },
+      { name: "_coreRoundID", internalType: "uint256", type: "uint256" },
+      { name: "_voteID", internalType: "uint256", type: "uint256" },
+      { name: "", internalType: "uint256", type: "uint256" },
+      { name: "", internalType: "uint256", type: "uint256" },
+    ],
+    name: "getDegreeOfCoherenceReward",
+    outputs: [
+      { name: "pnkCoherence", internalType: "uint256", type: "uint256" },
+      { name: "feeCoherence", internalType: "uint256", type: "uint256" },
+    ],
     stateMutability: "view",
   },
   {
@@ -3606,6 +3793,43 @@ export const disputeKitClassicUniversityImplementationAbi = [
     outputs: [{ name: "fundedChoices", internalType: "uint256[]", type: "uint256[]" }],
     stateMutability: "view",
   },
+  {
+    type: "function",
+    inputs: [],
+    name: "getJumpDisputeKitID",
+    outputs: [{ name: "", internalType: "uint256", type: "uint256" }],
+    stateMutability: "view",
+  },
+  {
+    type: "function",
+    inputs: [
+      { name: "_coreDisputeID", internalType: "uint256", type: "uint256" },
+      { name: "_coreRoundID", internalType: "uint256", type: "uint256" },
+    ],
+    name: "getLocalDisputeRoundID",
+    outputs: [
+      { name: "localDisputeID", internalType: "uint256", type: "uint256" },
+      { name: "localRoundID", internalType: "uint256", type: "uint256" },
+    ],
+    stateMutability: "view",
+  },
+  {
+    type: "function",
+    inputs: [
+      { name: "", internalType: "contract IDisputeKit", type: "address" },
+      { name: "_currentNbVotes", internalType: "uint256", type: "uint256" },
+    ],
+    name: "getNbVotesAfterAppeal",
+    outputs: [{ name: "", internalType: "uint256", type: "uint256" }],
+    stateMutability: "pure",
+  },
+  {
+    type: "function",
+    inputs: [{ name: "_localDisputeID", internalType: "uint256", type: "uint256" }],
+    name: "getNumberOfRounds",
+    outputs: [{ name: "", internalType: "uint256", type: "uint256" }],
+    stateMutability: "view",
+  },
   {
     type: "function",
     inputs: [
@@ -3618,7 +3842,7 @@ export const disputeKitClassicUniversityImplementationAbi = [
       { name: "winningChoice", internalType: "uint256", type: "uint256" },
       { name: "tied", internalType: "bool", type: "bool" },
       { name: "totalVoted", internalType: "uint256", type: "uint256" },
-      { name: "totalCommited", internalType: "uint256", type: "uint256" },
+      { name: "totalCommitted", internalType: "uint256", type: "uint256" },
       { name: "nbVoters", internalType: "uint256", type: "uint256" },
       { name: "choiceCount", internalType: "uint256", type: "uint256" },
     ],
@@ -3642,21 +3866,34 @@ export const disputeKitClassicUniversityImplementationAbi = [
   },
   {
     type: "function",
-    inputs: [],
-    name: "governor",
-    outputs: [{ name: "", internalType: "address", type: "address" }],
+    inputs: [
+      { name: "_choice", internalType: "uint256", type: "uint256" },
+      { name: "_salt", internalType: "uint256", type: "uint256" },
+      { name: "", internalType: "string", type: "string" },
+    ],
+    name: "hashVote",
+    outputs: [{ name: "", internalType: "bytes32", type: "bytes32" }],
     stateMutability: "view",
   },
   {
     type: "function",
     inputs: [
-      { name: "_governor", internalType: "address", type: "address" },
+      { name: "_owner", internalType: "address", type: "address" },
       { name: "_core", internalType: "contract KlerosCore", type: "address" },
+      { name: "_wNative", internalType: "address", type: "address" },
+      { name: "_jumpDisputeKitID", internalType: "uint256", type: "uint256" },
     ],
     name: "initialize",
     outputs: [],
     stateMutability: "nonpayable",
   },
+  {
+    type: "function",
+    inputs: [{ name: "_coreDisputeID", internalType: "uint256", type: "uint256" }],
+    name: "isAppealFunded",
+    outputs: [{ name: "", internalType: "bool", type: "bool" }],
+    stateMutability: "view",
+  },
   {
     type: "function",
     inputs: [
@@ -3671,24 +3908,59 @@ export const disputeKitClassicUniversityImplementationAbi = [
   {
     type: "function",
     inputs: [],
-    name: "proxiableUUID",
-    outputs: [{ name: "", internalType: "bytes32", type: "bytes32" }],
+    name: "jumpDisputeKitID",
+    outputs: [{ name: "", internalType: "uint256", type: "uint256" }],
     stateMutability: "view",
   },
   {
     type: "function",
-    inputs: [
-      { name: "newImplementation", internalType: "address", type: "address" },
-      { name: "data", internalType: "bytes", type: "bytes" },
-    ],
-    name: "upgradeToAndCall",
-    outputs: [],
-    stateMutability: "payable",
+    inputs: [],
+    name: "owner",
+    outputs: [{ name: "", internalType: "address", type: "address" }],
+    stateMutability: "view",
   },
   {
     type: "function",
-    inputs: [
-      { name: "_coreDisputeID", internalType: "uint256", type: "uint256" },
+    inputs: [],
+    name: "proxiableUUID",
+    outputs: [{ name: "", internalType: "bytes32", type: "bytes32" }],
+    stateMutability: "view",
+  },
+  {
+    type: "function",
+    inputs: [],
+    name: "singleDrawPerJuror",
+    outputs: [{ name: "", internalType: "bool", type: "bool" }],
+    stateMutability: "view",
+  },
+  {
+    type: "function",
+    inputs: [
+      { name: "newImplementation", internalType: "address", type: "address" },
+      { name: "data", internalType: "bytes", type: "bytes" },
+    ],
+    name: "upgradeToAndCall",
+    outputs: [],
+    stateMutability: "payable",
+  },
+  {
+    type: "function",
+    inputs: [],
+    name: "version",
+    outputs: [{ name: "", internalType: "string", type: "string" }],
+    stateMutability: "view",
+  },
+  {
+    type: "function",
+    inputs: [],
+    name: "wNative",
+    outputs: [{ name: "", internalType: "address", type: "address" }],
+    stateMutability: "view",
+  },
+  {
+    type: "function",
+    inputs: [
+      { name: "_coreDisputeID", internalType: "uint256", type: "uint256" },
       {
         name: "_beneficiary",
         internalType: "address payable",
@@ -3704,14 +3976,14 @@ export const disputeKitClassicUniversityImplementationAbi = [
 ] as const;
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x87e863b94d2CB79A8aB53bD87Dc4A10E11C0918B)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x602ADa1cE706404BFb5417e497cdDae934436081)
  */
 export const disputeKitClassicUniversityImplementationAddress = {
-  421614: "0x87e863b94d2CB79A8aB53bD87Dc4A10E11C0918B",
+  421614: "0x602ADa1cE706404BFb5417e497cdDae934436081",
 } as const;
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x87e863b94d2CB79A8aB53bD87Dc4A10E11C0918B)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x602ADa1cE706404BFb5417e497cdDae934436081)
  */
 export const disputeKitClassicUniversityImplementationConfig = {
   address: disputeKitClassicUniversityImplementationAddress,
@@ -3723,7 +3995,7 @@ export const disputeKitClassicUniversityImplementationConfig = {
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xd6E96b7c993763B5CDDa1139C7387B82A7c8B8B5)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x82F2089442979A6b56c80274D144575980092F91)
  */
 export const disputeKitClassicUniversityProxyAbi = [
   {
@@ -3739,14 +4011,14 @@ export const disputeKitClassicUniversityProxyAbi = [
 ] as const;
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xd6E96b7c993763B5CDDa1139C7387B82A7c8B8B5)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x82F2089442979A6b56c80274D144575980092F91)
  */
 export const disputeKitClassicUniversityProxyAddress = {
-  421614: "0xd6E96b7c993763B5CDDa1139C7387B82A7c8B8B5",
+  421614: "0x82F2089442979A6b56c80274D144575980092F91",
 } as const;
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xd6E96b7c993763B5CDDa1139C7387B82A7c8B8B5)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x82F2089442979A6b56c80274D144575980092F91)
  */
 export const disputeKitClassicUniversityProxyConfig = {
   address: disputeKitClassicUniversityProxyAddress,
@@ -9062,7 +9334,7 @@ export const disputeResolverRulerConfig = {
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x2Aa1a94307E772BeE42E9EfbD137b1053F1fCfd4)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x8a7902Ef9a5308C7DF0A68A28EEDd6D83436993D)
  */
 export const disputeResolverUniversityAbi = [
   {
@@ -9081,6 +9353,11 @@ export const disputeResolverUniversityAbi = [
     ],
     stateMutability: "nonpayable",
   },
+  { type: "error", inputs: [], name: "ArbitratorOnly" },
+  { type: "error", inputs: [], name: "DisputeAlreadyRuled" },
+  { type: "error", inputs: [], name: "OwnerOnly" },
+  { type: "error", inputs: [], name: "RulingOutOfBounds" },
+  { type: "error", inputs: [], name: "ShouldBeAtLeastTwoRulingOptions" },
   {
     type: "event",
     anonymous: false,
@@ -9109,12 +9386,6 @@ export const disputeResolverUniversityAbi = [
         type: "uint256",
         indexed: false,
       },
-      {
-        name: "_templateUri",
-        internalType: "string",
-        type: "string",
-        indexed: false,
-      },
     ],
     name: "DisputeRequest",
   },
@@ -9172,8 +9443,8 @@ export const disputeResolverUniversityAbi = [
   },
   {
     type: "function",
-    inputs: [{ name: "_governor", internalType: "address", type: "address" }],
-    name: "changeGovernor",
+    inputs: [{ name: "_owner", internalType: "address", type: "address" }],
+    name: "changeOwner",
     outputs: [],
     stateMutability: "nonpayable",
   },
@@ -9210,21 +9481,6 @@ export const disputeResolverUniversityAbi = [
     outputs: [{ name: "disputeID", internalType: "uint256", type: "uint256" }],
     stateMutability: "payable",
   },
-  {
-    type: "function",
-    inputs: [
-      { name: "_arbitratorExtraData", internalType: "bytes", type: "bytes" },
-      { name: "_disputeTemplateUri", internalType: "string", type: "string" },
-      {
-        name: "_numberOfRulingOptions",
-        internalType: "uint256",
-        type: "uint256",
-      },
-    ],
-    name: "createDisputeForTemplateUri",
-    outputs: [{ name: "disputeID", internalType: "uint256", type: "uint256" }],
-    stateMutability: "payable",
-  },
   {
     type: "function",
     inputs: [{ name: "", internalType: "uint256", type: "uint256" }],
@@ -9244,7 +9500,7 @@ export const disputeResolverUniversityAbi = [
   {
     type: "function",
     inputs: [],
-    name: "governor",
+    name: "owner",
     outputs: [{ name: "", internalType: "address", type: "address" }],
     stateMutability: "view",
   },
@@ -9278,14 +9534,14 @@ export const disputeResolverUniversityAbi = [
 ] as const;
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x2Aa1a94307E772BeE42E9EfbD137b1053F1fCfd4)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x8a7902Ef9a5308C7DF0A68A28EEDd6D83436993D)
  */
 export const disputeResolverUniversityAddress = {
-  421614: "0x2Aa1a94307E772BeE42E9EfbD137b1053F1fCfd4",
+  421614: "0x8a7902Ef9a5308C7DF0A68A28EEDd6D83436993D",
 } as const;
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x2Aa1a94307E772BeE42E9EfbD137b1053F1fCfd4)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x8a7902Ef9a5308C7DF0A68A28EEDd6D83436993D)
  */
 export const disputeResolverUniversityConfig = {
   address: disputeResolverUniversityAddress,
@@ -9473,14 +9729,15 @@ export const disputeTemplateRegistryConfig = {
 } as const;
 
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-// DisputeTemplateRegistry_Implementation
+// DisputeTemplateRegistryUniversity
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xBc9B5643C9B1C478DAe1b950e886CC50D8d868b1)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x75A5D16e9A699162506E4d79D68CF646e6600ba1)
  */
-export const disputeTemplateRegistryImplementationAbi = [
-  { type: "constructor", inputs: [], stateMutability: "nonpayable" },
+export const disputeTemplateRegistryUniversityAbi = [
+  { type: "fallback", stateMutability: "payable" },
+  { type: "receive", stateMutability: "payable" },
   { type: "error", inputs: [], name: "AlreadyInitialized" },
   { type: "error", inputs: [], name: "FailedDelegateCall" },
   {
@@ -9489,6 +9746,7 @@ export const disputeTemplateRegistryImplementationAbi = [
     name: "InvalidImplementation",
   },
   { type: "error", inputs: [], name: "NotInitializing" },
+  { type: "error", inputs: [], name: "OwnerOnly" },
   { type: "error", inputs: [], name: "UUPSUnauthorizedCallContext" },
   {
     type: "error",
@@ -9554,21 +9812,14 @@ export const disputeTemplateRegistryImplementationAbi = [
   },
   {
     type: "function",
-    inputs: [{ name: "_governor", internalType: "address", type: "address" }],
-    name: "changeGovernor",
+    inputs: [{ name: "_owner", internalType: "address", type: "address" }],
+    name: "changeOwner",
     outputs: [],
     stateMutability: "nonpayable",
   },
   {
     type: "function",
-    inputs: [],
-    name: "governor",
-    outputs: [{ name: "", internalType: "address", type: "address" }],
-    stateMutability: "view",
-  },
-  {
-    type: "function",
-    inputs: [{ name: "_governor", internalType: "address", type: "address" }],
+    inputs: [{ name: "_owner", internalType: "address", type: "address" }],
     name: "initialize",
     outputs: [],
     stateMutability: "nonpayable",
@@ -9576,9 +9827,9 @@ export const disputeTemplateRegistryImplementationAbi = [
   {
     type: "function",
     inputs: [],
-    name: "initialize2",
-    outputs: [],
-    stateMutability: "nonpayable",
+    name: "owner",
+    outputs: [{ name: "", internalType: "address", type: "address" }],
+    stateMutability: "view",
   },
   {
     type: "function",
@@ -9622,31 +9873,6 @@ export const disputeTemplateRegistryImplementationAbi = [
     outputs: [{ name: "", internalType: "string", type: "string" }],
     stateMutability: "view",
   },
-] as const;
-
-/**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xBc9B5643C9B1C478DAe1b950e886CC50D8d868b1)
- */
-export const disputeTemplateRegistryImplementationAddress = {
-  421614: "0xBc9B5643C9B1C478DAe1b950e886CC50D8d868b1",
-} as const;
-
-/**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xBc9B5643C9B1C478DAe1b950e886CC50D8d868b1)
- */
-export const disputeTemplateRegistryImplementationConfig = {
-  address: disputeTemplateRegistryImplementationAddress,
-  abi: disputeTemplateRegistryImplementationAbi,
-} as const;
-
-//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-// DisputeTemplateRegistry_Proxy
-//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-
-/**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xc852F94f90E3B06Da6eCfB61d76561ECfb94613f)
- */
-export const disputeTemplateRegistryProxyAbi = [
   {
     type: "constructor",
     inputs: [
@@ -9655,35 +9881,32 @@ export const disputeTemplateRegistryProxyAbi = [
     ],
     stateMutability: "nonpayable",
   },
-  { type: "fallback", stateMutability: "payable" },
-  { type: "receive", stateMutability: "payable" },
 ] as const;
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xc852F94f90E3B06Da6eCfB61d76561ECfb94613f)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x75A5D16e9A699162506E4d79D68CF646e6600ba1)
  */
-export const disputeTemplateRegistryProxyAddress = {
-  421614: "0xc852F94f90E3B06Da6eCfB61d76561ECfb94613f",
+export const disputeTemplateRegistryUniversityAddress = {
+  421614: "0x75A5D16e9A699162506E4d79D68CF646e6600ba1",
 } as const;
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xc852F94f90E3B06Da6eCfB61d76561ECfb94613f)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x75A5D16e9A699162506E4d79D68CF646e6600ba1)
  */
-export const disputeTemplateRegistryProxyConfig = {
-  address: disputeTemplateRegistryProxyAddress,
-  abi: disputeTemplateRegistryProxyAbi,
+export const disputeTemplateRegistryUniversityConfig = {
+  address: disputeTemplateRegistryUniversityAddress,
+  abi: disputeTemplateRegistryUniversityAbi,
 } as const;
 
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-// EvidenceModule
+// DisputeTemplateRegistryUniversity_Implementation
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xA1F72e0445fc395A393247F5B8c958Ec9b7C0B49)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xC3f638389635bF33E019c845FdaF2ed9bca3DF67)
  */
-export const evidenceModuleAbi = [
-  { type: "fallback", stateMutability: "payable" },
-  { type: "receive", stateMutability: "payable" },
+export const disputeTemplateRegistryUniversityImplementationAbi = [
+  { type: "constructor", inputs: [], stateMutability: "nonpayable" },
   { type: "error", inputs: [], name: "AlreadyInitialized" },
   { type: "error", inputs: [], name: "FailedDelegateCall" },
   {
@@ -9692,6 +9915,7 @@ export const evidenceModuleAbi = [
     name: "InvalidImplementation",
   },
   { type: "error", inputs: [], name: "NotInitializing" },
+  { type: "error", inputs: [], name: "OwnerOnly" },
   { type: "error", inputs: [], name: "UUPSUnauthorizedCallContext" },
   {
     type: "error",
@@ -9703,25 +9927,31 @@ export const evidenceModuleAbi = [
     anonymous: false,
     inputs: [
       {
-        name: "_externalDisputeID",
+        name: "_templateId",
         internalType: "uint256",
         type: "uint256",
         indexed: true,
       },
       {
-        name: "_party",
-        internalType: "address",
-        type: "address",
+        name: "_templateTag",
+        internalType: "string",
+        type: "string",
         indexed: true,
       },
       {
-        name: "_evidence",
+        name: "_templateData",
+        internalType: "string",
+        type: "string",
+        indexed: false,
+      },
+      {
+        name: "_templateDataMappings",
         internalType: "string",
         type: "string",
         indexed: false,
       },
     ],
-    name: "Evidence",
+    name: "DisputeTemplate",
   },
   {
     type: "event",
@@ -9751,14 +9981,14 @@ export const evidenceModuleAbi = [
   },
   {
     type: "function",
-    inputs: [],
-    name: "governor",
-    outputs: [{ name: "", internalType: "address", type: "address" }],
-    stateMutability: "view",
+    inputs: [{ name: "_owner", internalType: "address", type: "address" }],
+    name: "changeOwner",
+    outputs: [],
+    stateMutability: "nonpayable",
   },
   {
     type: "function",
-    inputs: [{ name: "_governor", internalType: "address", type: "address" }],
+    inputs: [{ name: "_owner", internalType: "address", type: "address" }],
     name: "initialize",
     outputs: [],
     stateMutability: "nonpayable",
@@ -9766,9 +9996,9 @@ export const evidenceModuleAbi = [
   {
     type: "function",
     inputs: [],
-    name: "initialize2",
-    outputs: [],
-    stateMutability: "nonpayable",
+    name: "owner",
+    outputs: [{ name: "", internalType: "address", type: "address" }],
+    stateMutability: "view",
   },
   {
     type: "function",
@@ -9780,13 +10010,21 @@ export const evidenceModuleAbi = [
   {
     type: "function",
     inputs: [
-      { name: "_externalDisputeID", internalType: "uint256", type: "uint256" },
-      { name: "_evidence", internalType: "string", type: "string" },
+      { name: "_templateTag", internalType: "string", type: "string" },
+      { name: "_templateData", internalType: "string", type: "string" },
+      { name: "_templateDataMappings", internalType: "string", type: "string" },
     ],
-    name: "submitEvidence",
-    outputs: [],
+    name: "setDisputeTemplate",
+    outputs: [{ name: "templateId", internalType: "uint256", type: "uint256" }],
     stateMutability: "nonpayable",
   },
+  {
+    type: "function",
+    inputs: [],
+    name: "templates",
+    outputs: [{ name: "", internalType: "uint256", type: "uint256" }],
+    stateMutability: "view",
+  },
   {
     type: "function",
     inputs: [
@@ -9804,6 +10042,31 @@ export const evidenceModuleAbi = [
     outputs: [{ name: "", internalType: "string", type: "string" }],
     stateMutability: "view",
   },
+] as const;
+
+/**
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xC3f638389635bF33E019c845FdaF2ed9bca3DF67)
+ */
+export const disputeTemplateRegistryUniversityImplementationAddress = {
+  421614: "0xC3f638389635bF33E019c845FdaF2ed9bca3DF67",
+} as const;
+
+/**
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xC3f638389635bF33E019c845FdaF2ed9bca3DF67)
+ */
+export const disputeTemplateRegistryUniversityImplementationConfig = {
+  address: disputeTemplateRegistryUniversityImplementationAddress,
+  abi: disputeTemplateRegistryUniversityImplementationAbi,
+} as const;
+
+//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+// DisputeTemplateRegistryUniversity_Proxy
+//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+
+/**
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x75A5D16e9A699162506E4d79D68CF646e6600ba1)
+ */
+export const disputeTemplateRegistryUniversityProxyAbi = [
   {
     type: "constructor",
     inputs: [
@@ -9812,31 +10075,33 @@ export const evidenceModuleAbi = [
     ],
     stateMutability: "nonpayable",
   },
+  { type: "fallback", stateMutability: "payable" },
+  { type: "receive", stateMutability: "payable" },
 ] as const;
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xA1F72e0445fc395A393247F5B8c958Ec9b7C0B49)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x75A5D16e9A699162506E4d79D68CF646e6600ba1)
  */
-export const evidenceModuleAddress = {
-  421614: "0xA1F72e0445fc395A393247F5B8c958Ec9b7C0B49",
+export const disputeTemplateRegistryUniversityProxyAddress = {
+  421614: "0x75A5D16e9A699162506E4d79D68CF646e6600ba1",
 } as const;
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xA1F72e0445fc395A393247F5B8c958Ec9b7C0B49)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x75A5D16e9A699162506E4d79D68CF646e6600ba1)
  */
-export const evidenceModuleConfig = {
-  address: evidenceModuleAddress,
-  abi: evidenceModuleAbi,
+export const disputeTemplateRegistryUniversityProxyConfig = {
+  address: disputeTemplateRegistryUniversityProxyAddress,
+  abi: disputeTemplateRegistryUniversityProxyAbi,
 } as const;
 
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-// EvidenceModule_Implementation
+// DisputeTemplateRegistry_Implementation
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x450Aa35da0ad8B282C5d910254055651417C2200)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xBc9B5643C9B1C478DAe1b950e886CC50D8d868b1)
  */
-export const evidenceModuleImplementationAbi = [
+export const disputeTemplateRegistryImplementationAbi = [
   { type: "constructor", inputs: [], stateMutability: "nonpayable" },
   { type: "error", inputs: [], name: "AlreadyInitialized" },
   { type: "error", inputs: [], name: "FailedDelegateCall" },
@@ -9857,25 +10122,31 @@ export const evidenceModuleImplementationAbi = [
     anonymous: false,
     inputs: [
       {
-        name: "_externalDisputeID",
+        name: "_templateId",
         internalType: "uint256",
         type: "uint256",
         indexed: true,
       },
       {
-        name: "_party",
-        internalType: "address",
-        type: "address",
+        name: "_templateTag",
+        internalType: "string",
+        type: "string",
         indexed: true,
       },
       {
-        name: "_evidence",
+        name: "_templateData",
+        internalType: "string",
+        type: "string",
+        indexed: false,
+      },
+      {
+        name: "_templateDataMappings",
         internalType: "string",
         type: "string",
         indexed: false,
       },
     ],
-    name: "Evidence",
+    name: "DisputeTemplate",
   },
   {
     type: "event",
@@ -9903,6 +10174,13 @@ export const evidenceModuleImplementationAbi = [
     ],
     name: "Upgraded",
   },
+  {
+    type: "function",
+    inputs: [{ name: "_governor", internalType: "address", type: "address" }],
+    name: "changeGovernor",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
   {
     type: "function",
     inputs: [],
@@ -9934,13 +10212,21 @@ export const evidenceModuleImplementationAbi = [
   {
     type: "function",
     inputs: [
-      { name: "_externalDisputeID", internalType: "uint256", type: "uint256" },
-      { name: "_evidence", internalType: "string", type: "string" },
+      { name: "_templateTag", internalType: "string", type: "string" },
+      { name: "_templateData", internalType: "string", type: "string" },
+      { name: "_templateDataMappings", internalType: "string", type: "string" },
     ],
-    name: "submitEvidence",
-    outputs: [],
+    name: "setDisputeTemplate",
+    outputs: [{ name: "templateId", internalType: "uint256", type: "uint256" }],
     stateMutability: "nonpayable",
   },
+  {
+    type: "function",
+    inputs: [],
+    name: "templates",
+    outputs: [{ name: "", internalType: "uint256", type: "uint256" }],
+    stateMutability: "view",
+  },
   {
     type: "function",
     inputs: [
@@ -9961,14 +10247,350 @@ export const evidenceModuleImplementationAbi = [
 ] as const;
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x450Aa35da0ad8B282C5d910254055651417C2200)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xBc9B5643C9B1C478DAe1b950e886CC50D8d868b1)
  */
-export const evidenceModuleImplementationAddress = {
-  421614: "0x450Aa35da0ad8B282C5d910254055651417C2200",
+export const disputeTemplateRegistryImplementationAddress = {
+  421614: "0xBc9B5643C9B1C478DAe1b950e886CC50D8d868b1",
 } as const;
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x450Aa35da0ad8B282C5d910254055651417C2200)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xBc9B5643C9B1C478DAe1b950e886CC50D8d868b1)
+ */
+export const disputeTemplateRegistryImplementationConfig = {
+  address: disputeTemplateRegistryImplementationAddress,
+  abi: disputeTemplateRegistryImplementationAbi,
+} as const;
+
+//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+// DisputeTemplateRegistry_Proxy
+//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+
+/**
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xc852F94f90E3B06Da6eCfB61d76561ECfb94613f)
+ */
+export const disputeTemplateRegistryProxyAbi = [
+  {
+    type: "constructor",
+    inputs: [
+      { name: "_implementation", internalType: "address", type: "address" },
+      { name: "_data", internalType: "bytes", type: "bytes" },
+    ],
+    stateMutability: "nonpayable",
+  },
+  { type: "fallback", stateMutability: "payable" },
+  { type: "receive", stateMutability: "payable" },
+] as const;
+
+/**
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xc852F94f90E3B06Da6eCfB61d76561ECfb94613f)
+ */
+export const disputeTemplateRegistryProxyAddress = {
+  421614: "0xc852F94f90E3B06Da6eCfB61d76561ECfb94613f",
+} as const;
+
+/**
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xc852F94f90E3B06Da6eCfB61d76561ECfb94613f)
+ */
+export const disputeTemplateRegistryProxyConfig = {
+  address: disputeTemplateRegistryProxyAddress,
+  abi: disputeTemplateRegistryProxyAbi,
+} as const;
+
+//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+// EvidenceModule
+//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+
+/**
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xA1F72e0445fc395A393247F5B8c958Ec9b7C0B49)
+ */
+export const evidenceModuleAbi = [
+  { type: "fallback", stateMutability: "payable" },
+  { type: "receive", stateMutability: "payable" },
+  { type: "error", inputs: [], name: "AlreadyInitialized" },
+  { type: "error", inputs: [], name: "FailedDelegateCall" },
+  {
+    type: "error",
+    inputs: [{ name: "implementation", internalType: "address", type: "address" }],
+    name: "InvalidImplementation",
+  },
+  { type: "error", inputs: [], name: "NotInitializing" },
+  { type: "error", inputs: [], name: "UUPSUnauthorizedCallContext" },
+  {
+    type: "error",
+    inputs: [{ name: "slot", internalType: "bytes32", type: "bytes32" }],
+    name: "UUPSUnsupportedProxiableUUID",
+  },
+  {
+    type: "event",
+    anonymous: false,
+    inputs: [
+      {
+        name: "_externalDisputeID",
+        internalType: "uint256",
+        type: "uint256",
+        indexed: true,
+      },
+      {
+        name: "_party",
+        internalType: "address",
+        type: "address",
+        indexed: true,
+      },
+      {
+        name: "_evidence",
+        internalType: "string",
+        type: "string",
+        indexed: false,
+      },
+    ],
+    name: "Evidence",
+  },
+  {
+    type: "event",
+    anonymous: false,
+    inputs: [
+      {
+        name: "version",
+        internalType: "uint64",
+        type: "uint64",
+        indexed: false,
+      },
+    ],
+    name: "Initialized",
+  },
+  {
+    type: "event",
+    anonymous: false,
+    inputs: [
+      {
+        name: "newImplementation",
+        internalType: "address",
+        type: "address",
+        indexed: true,
+      },
+    ],
+    name: "Upgraded",
+  },
+  {
+    type: "function",
+    inputs: [],
+    name: "governor",
+    outputs: [{ name: "", internalType: "address", type: "address" }],
+    stateMutability: "view",
+  },
+  {
+    type: "function",
+    inputs: [{ name: "_governor", internalType: "address", type: "address" }],
+    name: "initialize",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
+  {
+    type: "function",
+    inputs: [],
+    name: "initialize2",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
+  {
+    type: "function",
+    inputs: [],
+    name: "proxiableUUID",
+    outputs: [{ name: "", internalType: "bytes32", type: "bytes32" }],
+    stateMutability: "view",
+  },
+  {
+    type: "function",
+    inputs: [
+      { name: "_externalDisputeID", internalType: "uint256", type: "uint256" },
+      { name: "_evidence", internalType: "string", type: "string" },
+    ],
+    name: "submitEvidence",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
+  {
+    type: "function",
+    inputs: [
+      { name: "newImplementation", internalType: "address", type: "address" },
+      { name: "data", internalType: "bytes", type: "bytes" },
+    ],
+    name: "upgradeToAndCall",
+    outputs: [],
+    stateMutability: "payable",
+  },
+  {
+    type: "function",
+    inputs: [],
+    name: "version",
+    outputs: [{ name: "", internalType: "string", type: "string" }],
+    stateMutability: "view",
+  },
+  {
+    type: "constructor",
+    inputs: [
+      { name: "_implementation", internalType: "address", type: "address" },
+      { name: "_data", internalType: "bytes", type: "bytes" },
+    ],
+    stateMutability: "nonpayable",
+  },
+] as const;
+
+/**
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xA1F72e0445fc395A393247F5B8c958Ec9b7C0B49)
+ */
+export const evidenceModuleAddress = {
+  421614: "0xA1F72e0445fc395A393247F5B8c958Ec9b7C0B49",
+} as const;
+
+/**
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xA1F72e0445fc395A393247F5B8c958Ec9b7C0B49)
+ */
+export const evidenceModuleConfig = {
+  address: evidenceModuleAddress,
+  abi: evidenceModuleAbi,
+} as const;
+
+//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+// EvidenceModule_Implementation
+//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+
+/**
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x450Aa35da0ad8B282C5d910254055651417C2200)
+ */
+export const evidenceModuleImplementationAbi = [
+  { type: "constructor", inputs: [], stateMutability: "nonpayable" },
+  { type: "error", inputs: [], name: "AlreadyInitialized" },
+  { type: "error", inputs: [], name: "FailedDelegateCall" },
+  {
+    type: "error",
+    inputs: [{ name: "implementation", internalType: "address", type: "address" }],
+    name: "InvalidImplementation",
+  },
+  { type: "error", inputs: [], name: "NotInitializing" },
+  { type: "error", inputs: [], name: "UUPSUnauthorizedCallContext" },
+  {
+    type: "error",
+    inputs: [{ name: "slot", internalType: "bytes32", type: "bytes32" }],
+    name: "UUPSUnsupportedProxiableUUID",
+  },
+  {
+    type: "event",
+    anonymous: false,
+    inputs: [
+      {
+        name: "_externalDisputeID",
+        internalType: "uint256",
+        type: "uint256",
+        indexed: true,
+      },
+      {
+        name: "_party",
+        internalType: "address",
+        type: "address",
+        indexed: true,
+      },
+      {
+        name: "_evidence",
+        internalType: "string",
+        type: "string",
+        indexed: false,
+      },
+    ],
+    name: "Evidence",
+  },
+  {
+    type: "event",
+    anonymous: false,
+    inputs: [
+      {
+        name: "version",
+        internalType: "uint64",
+        type: "uint64",
+        indexed: false,
+      },
+    ],
+    name: "Initialized",
+  },
+  {
+    type: "event",
+    anonymous: false,
+    inputs: [
+      {
+        name: "newImplementation",
+        internalType: "address",
+        type: "address",
+        indexed: true,
+      },
+    ],
+    name: "Upgraded",
+  },
+  {
+    type: "function",
+    inputs: [],
+    name: "governor",
+    outputs: [{ name: "", internalType: "address", type: "address" }],
+    stateMutability: "view",
+  },
+  {
+    type: "function",
+    inputs: [{ name: "_governor", internalType: "address", type: "address" }],
+    name: "initialize",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
+  {
+    type: "function",
+    inputs: [],
+    name: "initialize2",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
+  {
+    type: "function",
+    inputs: [],
+    name: "proxiableUUID",
+    outputs: [{ name: "", internalType: "bytes32", type: "bytes32" }],
+    stateMutability: "view",
+  },
+  {
+    type: "function",
+    inputs: [
+      { name: "_externalDisputeID", internalType: "uint256", type: "uint256" },
+      { name: "_evidence", internalType: "string", type: "string" },
+    ],
+    name: "submitEvidence",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
+  {
+    type: "function",
+    inputs: [
+      { name: "newImplementation", internalType: "address", type: "address" },
+      { name: "data", internalType: "bytes", type: "bytes" },
+    ],
+    name: "upgradeToAndCall",
+    outputs: [],
+    stateMutability: "payable",
+  },
+  {
+    type: "function",
+    inputs: [],
+    name: "version",
+    outputs: [{ name: "", internalType: "string", type: "string" }],
+    stateMutability: "view",
+  },
+] as const;
+
+/**
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x450Aa35da0ad8B282C5d910254055651417C2200)
+ */
+export const evidenceModuleImplementationAddress = {
+  421614: "0x450Aa35da0ad8B282C5d910254055651417C2200",
+} as const;
+
+/**
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x450Aa35da0ad8B282C5d910254055651417C2200)
  */
 export const evidenceModuleImplementationConfig = {
   address: evidenceModuleImplementationAddress,
@@ -10945,12 +11567,6 @@ export const iHomeGatewayAbi = [
         type: "uint256",
         indexed: false,
       },
-      {
-        name: "_templateUri",
-        internalType: "string",
-        type: "string",
-        indexed: false,
-      },
     ],
     name: "CrossChainDisputeIncoming",
   },
@@ -10982,12 +11598,6 @@ export const iHomeGatewayAbi = [
         type: "uint256",
         indexed: false,
       },
-      {
-        name: "_templateUri",
-        internalType: "string",
-        type: "string",
-        indexed: false,
-      },
     ],
     name: "DisputeRequest",
   },
@@ -11081,16 +11691,14 @@ export const iHomeGatewayAbi = [
             type: "uint256",
           },
           { name: "templateId", internalType: "uint256", type: "uint256" },
-          { name: "templateUri", internalType: "string", type: "string" },
           { name: "choices", internalType: "uint256", type: "uint256" },
           { name: "extraData", internalType: "bytes", type: "bytes" },
         ],
       },
-      { name: "_feeAmount", internalType: "uint256", type: "uint256" },
     ],
     name: "relayCreateDispute",
     outputs: [],
-    stateMutability: "nonpayable",
+    stateMutability: "payable",
   },
   {
     type: "function",
@@ -11122,15 +11730,15 @@ export const iHomeGatewayAbi = [
             type: "uint256",
           },
           { name: "templateId", internalType: "uint256", type: "uint256" },
-          { name: "templateUri", internalType: "string", type: "string" },
           { name: "choices", internalType: "uint256", type: "uint256" },
           { name: "extraData", internalType: "bytes", type: "bytes" },
         ],
       },
+      { name: "_feeAmount", internalType: "uint256", type: "uint256" },
     ],
     name: "relayCreateDispute",
     outputs: [],
-    stateMutability: "payable",
+    stateMutability: "nonpayable",
   },
   {
     type: "function",
@@ -14457,7 +15065,7 @@ export const klerosCoreSnapshotProxyConfig = {
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x5AB37F38778Bc175852fA353056591D91c744ce6)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xA34dBBD0E5e1d09bd683455f9dbC393797BC558f)
  */
 export const klerosCoreUniversityAbi = [
   { type: "fallback", stateMutability: "payable" },
@@ -14467,10 +15075,8 @@ export const klerosCoreUniversityAbi = [
   { type: "error", inputs: [], name: "AppealFeesNotEnough" },
   { type: "error", inputs: [], name: "AppealPeriodNotPassed" },
   { type: "error", inputs: [], name: "ArbitrationFeesNotEnough" },
-  { type: "error", inputs: [], name: "ArraysLengthMismatch" },
   { type: "error", inputs: [], name: "CannotDisableClassicDK" },
   { type: "error", inputs: [], name: "CommitPeriodNotPassed" },
-  { type: "error", inputs: [], name: "DepthLevelMax" },
   { type: "error", inputs: [], name: "DisputeKitNotSupportedByCourt" },
   { type: "error", inputs: [], name: "DisputeKitOnly" },
   { type: "error", inputs: [], name: "DisputeNotAppealable" },
@@ -14478,8 +15084,6 @@ export const klerosCoreUniversityAbi = [
   { type: "error", inputs: [], name: "DisputeStillDrawing" },
   { type: "error", inputs: [], name: "EvidenceNotPassedAndNotAppeal" },
   { type: "error", inputs: [], name: "FailedDelegateCall" },
-  { type: "error", inputs: [], name: "GovernorOnly" },
-  { type: "error", inputs: [], name: "GovernorOrInstructorOnly" },
   { type: "error", inputs: [], name: "InstructorOnly" },
   { type: "error", inputs: [], name: "InvalidDisputKitParent" },
   { type: "error", inputs: [], name: "InvalidForkingCourtAsParent" },
@@ -14494,12 +15098,15 @@ export const klerosCoreUniversityAbi = [
   { type: "error", inputs: [], name: "NotEvidencePeriod" },
   { type: "error", inputs: [], name: "NotExecutionPeriod" },
   { type: "error", inputs: [], name: "NotInitializing" },
+  { type: "error", inputs: [], name: "OwnerOnly" },
+  { type: "error", inputs: [], name: "OwnerOrInstructorOnly" },
   { type: "error", inputs: [], name: "RulingAlreadyExecuted" },
   { type: "error", inputs: [], name: "SortitionModuleOnly" },
   { type: "error", inputs: [], name: "StakingInTooManyCourts" },
   { type: "error", inputs: [], name: "StakingLessThanCourtMinStake" },
-  { type: "error", inputs: [], name: "StakingNotPossibeInThisCourt" },
+  { type: "error", inputs: [], name: "StakingNotPossibleInThisCourt" },
   { type: "error", inputs: [], name: "StakingTransferFailed" },
+  { type: "error", inputs: [], name: "StakingZeroWhenNoStake" },
   { type: "error", inputs: [], name: "TokenNotAccepted" },
   { type: "error", inputs: [], name: "TransferFailed" },
   { type: "error", inputs: [], name: "UUPSUnauthorizedCallContext" },
@@ -14571,8 +15178,8 @@ export const klerosCoreUniversityAbi = [
     inputs: [
       {
         name: "_courtID",
-        internalType: "uint256",
-        type: "uint256",
+        internalType: "uint96",
+        type: "uint96",
         indexed: true,
       },
       {
@@ -14843,6 +15450,12 @@ export const klerosCoreUniversityAbi = [
     type: "event",
     anonymous: false,
     inputs: [
+      {
+        name: "_account",
+        internalType: "address",
+        type: "address",
+        indexed: true,
+      },
       {
         name: "_disputeID",
         internalType: "uint256",
@@ -14856,13 +15469,62 @@ export const klerosCoreUniversityAbi = [
         indexed: true,
       },
       {
-        name: "_pnkAmount",
+        name: "_degreeOfCoherencyPnk",
         internalType: "uint256",
         type: "uint256",
         indexed: false,
       },
       {
-        name: "_feeAmount",
+        name: "_degreeOfCoherencyFee",
+        internalType: "uint256",
+        type: "uint256",
+        indexed: false,
+      },
+      {
+        name: "_amountPnk",
+        internalType: "int256",
+        type: "int256",
+        indexed: false,
+      },
+      {
+        name: "_amountFee",
+        internalType: "int256",
+        type: "int256",
+        indexed: false,
+      },
+      {
+        name: "_feeToken",
+        internalType: "contract IERC20",
+        type: "address",
+        indexed: false,
+      },
+    ],
+    name: "JurorRewardPenalty",
+  },
+  {
+    type: "event",
+    anonymous: false,
+    inputs: [
+      {
+        name: "_disputeID",
+        internalType: "uint256",
+        type: "uint256",
+        indexed: true,
+      },
+      {
+        name: "_roundID",
+        internalType: "uint256",
+        type: "uint256",
+        indexed: true,
+      },
+      {
+        name: "_amountPnk",
+        internalType: "uint256",
+        type: "uint256",
+        indexed: false,
+      },
+      {
+        name: "_amountFee",
         internalType: "uint256",
         type: "uint256",
         indexed: false,
@@ -14945,55 +15607,6 @@ export const klerosCoreUniversityAbi = [
     ],
     name: "Ruling",
   },
-  {
-    type: "event",
-    anonymous: false,
-    inputs: [
-      {
-        name: "_account",
-        internalType: "address",
-        type: "address",
-        indexed: true,
-      },
-      {
-        name: "_disputeID",
-        internalType: "uint256",
-        type: "uint256",
-        indexed: true,
-      },
-      {
-        name: "_roundID",
-        internalType: "uint256",
-        type: "uint256",
-        indexed: true,
-      },
-      {
-        name: "_degreeOfCoherency",
-        internalType: "uint256",
-        type: "uint256",
-        indexed: false,
-      },
-      {
-        name: "_pnkAmount",
-        internalType: "int256",
-        type: "int256",
-        indexed: false,
-      },
-      {
-        name: "_feeAmount",
-        internalType: "int256",
-        type: "int256",
-        indexed: false,
-      },
-      {
-        name: "_feeToken",
-        internalType: "contract IERC20",
-        type: "address",
-        indexed: false,
-      },
-    ],
-    name: "TokenAndETHShift",
-  },
   {
     type: "event",
     anonymous: false,
@@ -15105,13 +15718,6 @@ export const klerosCoreUniversityAbi = [
     outputs: [],
     stateMutability: "nonpayable",
   },
-  {
-    type: "function",
-    inputs: [{ name: "_governor", internalType: "address payable", type: "address" }],
-    name: "changeGovernor",
-    outputs: [],
-    stateMutability: "nonpayable",
-  },
   {
     type: "function",
     inputs: [{ name: "_instructor", internalType: "address", type: "address" }],
@@ -15132,6 +15738,13 @@ export const klerosCoreUniversityAbi = [
     outputs: [],
     stateMutability: "nonpayable",
   },
+  {
+    type: "function",
+    inputs: [{ name: "_owner", internalType: "address payable", type: "address" }],
+    name: "changeOwner",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
   {
     type: "function",
     inputs: [{ name: "_pinakion", internalType: "contract IERC20", type: "address" }],
@@ -15173,7 +15786,6 @@ export const klerosCoreUniversityAbi = [
       { name: "alpha", internalType: "uint256", type: "uint256" },
       { name: "feeForJuror", internalType: "uint256", type: "uint256" },
       { name: "jurorsForCourtJump", internalType: "uint256", type: "uint256" },
-      { name: "disabled", internalType: "bool", type: "bool" },
     ],
     stateMutability: "view",
   },
@@ -15312,7 +15924,7 @@ export const klerosCoreUniversityAbi = [
       { name: "_amount", internalType: "uint256", type: "uint256" },
       { name: "_data", internalType: "bytes", type: "bytes" },
     ],
-    name: "executeGovernorProposal",
+    name: "executeOwnerProposal",
     outputs: [],
     stateMutability: "nonpayable",
   },
@@ -15344,6 +15956,16 @@ export const klerosCoreUniversityAbi = [
     outputs: [{ name: "", internalType: "uint256", type: "uint256" }],
     stateMutability: "view",
   },
+  {
+    type: "function",
+    inputs: [
+      { name: "_disputeID", internalType: "uint256", type: "uint256" },
+      { name: "_round", internalType: "uint256", type: "uint256" },
+    ],
+    name: "getPnkAtStakePerJuror",
+    outputs: [{ name: "", internalType: "uint256", type: "uint256" }],
+    stateMutability: "view",
+  },
   {
     type: "function",
     inputs: [
@@ -15372,6 +15994,11 @@ export const klerosCoreUniversityAbi = [
           { name: "repartitions", internalType: "uint256", type: "uint256" },
           { name: "pnkPenalties", internalType: "uint256", type: "uint256" },
           { name: "drawnJurors", internalType: "address[]", type: "address[]" },
+          {
+            name: "drawnJurorFromCourtIDs",
+            internalType: "uint96[]",
+            type: "uint96[]",
+          },
           {
             name: "sumFeeRewardPaid",
             internalType: "uint256",
@@ -15388,6 +16015,7 @@ export const klerosCoreUniversityAbi = [
             type: "address",
           },
           { name: "drawIterations", internalType: "uint256", type: "uint256" },
+          { name: "__gap", internalType: "uint256[10]", type: "uint256[10]" },
         ],
       },
     ],
@@ -15406,17 +16034,10 @@ export const klerosCoreUniversityAbi = [
     ],
     stateMutability: "view",
   },
-  {
-    type: "function",
-    inputs: [],
-    name: "governor",
-    outputs: [{ name: "", internalType: "address", type: "address" }],
-    stateMutability: "view",
-  },
   {
     type: "function",
     inputs: [
-      { name: "_governor", internalType: "address", type: "address" },
+      { name: "_owner", internalType: "address", type: "address" },
       { name: "_instructor", internalType: "address", type: "address" },
       { name: "_pinakion", internalType: "contract IERC20", type: "address" },
       {
@@ -15481,6 +16102,13 @@ export const klerosCoreUniversityAbi = [
     outputs: [{ name: "", internalType: "address", type: "address" }],
     stateMutability: "view",
   },
+  {
+    type: "function",
+    inputs: [],
+    name: "owner",
+    outputs: [{ name: "", internalType: "address", type: "address" }],
+    stateMutability: "view",
+  },
   {
     type: "function",
     inputs: [{ name: "_disputeID", internalType: "uint256", type: "uint256" }],
@@ -15518,7 +16146,6 @@ export const klerosCoreUniversityAbi = [
       { name: "_account", internalType: "address", type: "address" },
       { name: "_courtID", internalType: "uint96", type: "uint96" },
       { name: "_newStake", internalType: "uint256", type: "uint256" },
-      { name: "_alreadyTransferred", internalType: "bool", type: "bool" },
     ],
     name: "setStakeBySortitionModule",
     outputs: [],
@@ -15537,6 +16164,16 @@ export const klerosCoreUniversityAbi = [
     ],
     stateMutability: "view",
   },
+  {
+    type: "function",
+    inputs: [
+      { name: "_account", internalType: "address", type: "address" },
+      { name: "_amount", internalType: "uint256", type: "uint256" },
+    ],
+    name: "transferBySortitionModule",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
   {
     type: "function",
     inputs: [
@@ -15547,6 +16184,13 @@ export const klerosCoreUniversityAbi = [
     outputs: [],
     stateMutability: "payable",
   },
+  {
+    type: "function",
+    inputs: [],
+    name: "version",
+    outputs: [{ name: "", internalType: "string", type: "string" }],
+    stateMutability: "view",
+  },
   {
     type: "constructor",
     inputs: [
@@ -15558,14 +16202,14 @@ export const klerosCoreUniversityAbi = [
 ] as const;
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x5AB37F38778Bc175852fA353056591D91c744ce6)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xA34dBBD0E5e1d09bd683455f9dbC393797BC558f)
  */
 export const klerosCoreUniversityAddress = {
-  421614: "0x5AB37F38778Bc175852fA353056591D91c744ce6",
+  421614: "0xA34dBBD0E5e1d09bd683455f9dbC393797BC558f",
 } as const;
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x5AB37F38778Bc175852fA353056591D91c744ce6)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xA34dBBD0E5e1d09bd683455f9dbC393797BC558f)
  */
 export const klerosCoreUniversityConfig = {
   address: klerosCoreUniversityAddress,
@@ -15577,7 +16221,7 @@ export const klerosCoreUniversityConfig = {
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xF74DaBfC5F5dbdBD07636637204d9C35326D2906)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xb75b0cc01af4aD0D65D50082ae0717004D479Aa0)
  */
 export const klerosCoreUniversityImplementationAbi = [
   { type: "constructor", inputs: [], stateMutability: "nonpayable" },
@@ -15586,10 +16230,8 @@ export const klerosCoreUniversityImplementationAbi = [
   { type: "error", inputs: [], name: "AppealFeesNotEnough" },
   { type: "error", inputs: [], name: "AppealPeriodNotPassed" },
   { type: "error", inputs: [], name: "ArbitrationFeesNotEnough" },
-  { type: "error", inputs: [], name: "ArraysLengthMismatch" },
   { type: "error", inputs: [], name: "CannotDisableClassicDK" },
   { type: "error", inputs: [], name: "CommitPeriodNotPassed" },
-  { type: "error", inputs: [], name: "DepthLevelMax" },
   { type: "error", inputs: [], name: "DisputeKitNotSupportedByCourt" },
   { type: "error", inputs: [], name: "DisputeKitOnly" },
   { type: "error", inputs: [], name: "DisputeNotAppealable" },
@@ -15597,8 +16239,6 @@ export const klerosCoreUniversityImplementationAbi = [
   { type: "error", inputs: [], name: "DisputeStillDrawing" },
   { type: "error", inputs: [], name: "EvidenceNotPassedAndNotAppeal" },
   { type: "error", inputs: [], name: "FailedDelegateCall" },
-  { type: "error", inputs: [], name: "GovernorOnly" },
-  { type: "error", inputs: [], name: "GovernorOrInstructorOnly" },
   { type: "error", inputs: [], name: "InstructorOnly" },
   { type: "error", inputs: [], name: "InvalidDisputKitParent" },
   { type: "error", inputs: [], name: "InvalidForkingCourtAsParent" },
@@ -15613,12 +16253,15 @@ export const klerosCoreUniversityImplementationAbi = [
   { type: "error", inputs: [], name: "NotEvidencePeriod" },
   { type: "error", inputs: [], name: "NotExecutionPeriod" },
   { type: "error", inputs: [], name: "NotInitializing" },
+  { type: "error", inputs: [], name: "OwnerOnly" },
+  { type: "error", inputs: [], name: "OwnerOrInstructorOnly" },
   { type: "error", inputs: [], name: "RulingAlreadyExecuted" },
   { type: "error", inputs: [], name: "SortitionModuleOnly" },
   { type: "error", inputs: [], name: "StakingInTooManyCourts" },
   { type: "error", inputs: [], name: "StakingLessThanCourtMinStake" },
-  { type: "error", inputs: [], name: "StakingNotPossibeInThisCourt" },
+  { type: "error", inputs: [], name: "StakingNotPossibleInThisCourt" },
   { type: "error", inputs: [], name: "StakingTransferFailed" },
+  { type: "error", inputs: [], name: "StakingZeroWhenNoStake" },
   { type: "error", inputs: [], name: "TokenNotAccepted" },
   { type: "error", inputs: [], name: "TransferFailed" },
   { type: "error", inputs: [], name: "UUPSUnauthorizedCallContext" },
@@ -15690,8 +16333,8 @@ export const klerosCoreUniversityImplementationAbi = [
     inputs: [
       {
         name: "_courtID",
-        internalType: "uint256",
-        type: "uint256",
+        internalType: "uint96",
+        type: "uint96",
         indexed: true,
       },
       {
@@ -15962,6 +16605,12 @@ export const klerosCoreUniversityImplementationAbi = [
     type: "event",
     anonymous: false,
     inputs: [
+      {
+        name: "_account",
+        internalType: "address",
+        type: "address",
+        indexed: true,
+      },
       {
         name: "_disputeID",
         internalType: "uint256",
@@ -15975,13 +16624,62 @@ export const klerosCoreUniversityImplementationAbi = [
         indexed: true,
       },
       {
-        name: "_pnkAmount",
+        name: "_degreeOfCoherencyPnk",
         internalType: "uint256",
         type: "uint256",
         indexed: false,
       },
       {
-        name: "_feeAmount",
+        name: "_degreeOfCoherencyFee",
+        internalType: "uint256",
+        type: "uint256",
+        indexed: false,
+      },
+      {
+        name: "_amountPnk",
+        internalType: "int256",
+        type: "int256",
+        indexed: false,
+      },
+      {
+        name: "_amountFee",
+        internalType: "int256",
+        type: "int256",
+        indexed: false,
+      },
+      {
+        name: "_feeToken",
+        internalType: "contract IERC20",
+        type: "address",
+        indexed: false,
+      },
+    ],
+    name: "JurorRewardPenalty",
+  },
+  {
+    type: "event",
+    anonymous: false,
+    inputs: [
+      {
+        name: "_disputeID",
+        internalType: "uint256",
+        type: "uint256",
+        indexed: true,
+      },
+      {
+        name: "_roundID",
+        internalType: "uint256",
+        type: "uint256",
+        indexed: true,
+      },
+      {
+        name: "_amountPnk",
+        internalType: "uint256",
+        type: "uint256",
+        indexed: false,
+      },
+      {
+        name: "_amountFee",
         internalType: "uint256",
         type: "uint256",
         indexed: false,
@@ -16064,55 +16762,6 @@ export const klerosCoreUniversityImplementationAbi = [
     ],
     name: "Ruling",
   },
-  {
-    type: "event",
-    anonymous: false,
-    inputs: [
-      {
-        name: "_account",
-        internalType: "address",
-        type: "address",
-        indexed: true,
-      },
-      {
-        name: "_disputeID",
-        internalType: "uint256",
-        type: "uint256",
-        indexed: true,
-      },
-      {
-        name: "_roundID",
-        internalType: "uint256",
-        type: "uint256",
-        indexed: true,
-      },
-      {
-        name: "_degreeOfCoherency",
-        internalType: "uint256",
-        type: "uint256",
-        indexed: false,
-      },
-      {
-        name: "_pnkAmount",
-        internalType: "int256",
-        type: "int256",
-        indexed: false,
-      },
-      {
-        name: "_feeAmount",
-        internalType: "int256",
-        type: "int256",
-        indexed: false,
-      },
-      {
-        name: "_feeToken",
-        internalType: "contract IERC20",
-        type: "address",
-        indexed: false,
-      },
-    ],
-    name: "TokenAndETHShift",
-  },
   {
     type: "event",
     anonymous: false,
@@ -16224,13 +16873,6 @@ export const klerosCoreUniversityImplementationAbi = [
     outputs: [],
     stateMutability: "nonpayable",
   },
-  {
-    type: "function",
-    inputs: [{ name: "_governor", internalType: "address payable", type: "address" }],
-    name: "changeGovernor",
-    outputs: [],
-    stateMutability: "nonpayable",
-  },
   {
     type: "function",
     inputs: [{ name: "_instructor", internalType: "address", type: "address" }],
@@ -16251,6 +16893,13 @@ export const klerosCoreUniversityImplementationAbi = [
     outputs: [],
     stateMutability: "nonpayable",
   },
+  {
+    type: "function",
+    inputs: [{ name: "_owner", internalType: "address payable", type: "address" }],
+    name: "changeOwner",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
   {
     type: "function",
     inputs: [{ name: "_pinakion", internalType: "contract IERC20", type: "address" }],
@@ -16292,7 +16941,6 @@ export const klerosCoreUniversityImplementationAbi = [
       { name: "alpha", internalType: "uint256", type: "uint256" },
       { name: "feeForJuror", internalType: "uint256", type: "uint256" },
       { name: "jurorsForCourtJump", internalType: "uint256", type: "uint256" },
-      { name: "disabled", internalType: "bool", type: "bool" },
     ],
     stateMutability: "view",
   },
@@ -16431,7 +17079,7 @@ export const klerosCoreUniversityImplementationAbi = [
       { name: "_amount", internalType: "uint256", type: "uint256" },
       { name: "_data", internalType: "bytes", type: "bytes" },
     ],
-    name: "executeGovernorProposal",
+    name: "executeOwnerProposal",
     outputs: [],
     stateMutability: "nonpayable",
   },
@@ -16463,6 +17111,16 @@ export const klerosCoreUniversityImplementationAbi = [
     outputs: [{ name: "", internalType: "uint256", type: "uint256" }],
     stateMutability: "view",
   },
+  {
+    type: "function",
+    inputs: [
+      { name: "_disputeID", internalType: "uint256", type: "uint256" },
+      { name: "_round", internalType: "uint256", type: "uint256" },
+    ],
+    name: "getPnkAtStakePerJuror",
+    outputs: [{ name: "", internalType: "uint256", type: "uint256" }],
+    stateMutability: "view",
+  },
   {
     type: "function",
     inputs: [
@@ -16491,6 +17149,11 @@ export const klerosCoreUniversityImplementationAbi = [
           { name: "repartitions", internalType: "uint256", type: "uint256" },
           { name: "pnkPenalties", internalType: "uint256", type: "uint256" },
           { name: "drawnJurors", internalType: "address[]", type: "address[]" },
+          {
+            name: "drawnJurorFromCourtIDs",
+            internalType: "uint96[]",
+            type: "uint96[]",
+          },
           {
             name: "sumFeeRewardPaid",
             internalType: "uint256",
@@ -16507,6 +17170,7 @@ export const klerosCoreUniversityImplementationAbi = [
             type: "address",
           },
           { name: "drawIterations", internalType: "uint256", type: "uint256" },
+          { name: "__gap", internalType: "uint256[10]", type: "uint256[10]" },
         ],
       },
     ],
@@ -16525,17 +17189,10 @@ export const klerosCoreUniversityImplementationAbi = [
     ],
     stateMutability: "view",
   },
-  {
-    type: "function",
-    inputs: [],
-    name: "governor",
-    outputs: [{ name: "", internalType: "address", type: "address" }],
-    stateMutability: "view",
-  },
   {
     type: "function",
     inputs: [
-      { name: "_governor", internalType: "address", type: "address" },
+      { name: "_owner", internalType: "address", type: "address" },
       { name: "_instructor", internalType: "address", type: "address" },
       { name: "_pinakion", internalType: "contract IERC20", type: "address" },
       {
@@ -16600,6 +17257,13 @@ export const klerosCoreUniversityImplementationAbi = [
     outputs: [{ name: "", internalType: "address", type: "address" }],
     stateMutability: "view",
   },
+  {
+    type: "function",
+    inputs: [],
+    name: "owner",
+    outputs: [{ name: "", internalType: "address", type: "address" }],
+    stateMutability: "view",
+  },
   {
     type: "function",
     inputs: [{ name: "_disputeID", internalType: "uint256", type: "uint256" }],
@@ -16637,7 +17301,6 @@ export const klerosCoreUniversityImplementationAbi = [
       { name: "_account", internalType: "address", type: "address" },
       { name: "_courtID", internalType: "uint96", type: "uint96" },
       { name: "_newStake", internalType: "uint256", type: "uint256" },
-      { name: "_alreadyTransferred", internalType: "bool", type: "bool" },
     ],
     name: "setStakeBySortitionModule",
     outputs: [],
@@ -16656,6 +17319,16 @@ export const klerosCoreUniversityImplementationAbi = [
     ],
     stateMutability: "view",
   },
+  {
+    type: "function",
+    inputs: [
+      { name: "_account", internalType: "address", type: "address" },
+      { name: "_amount", internalType: "uint256", type: "uint256" },
+    ],
+    name: "transferBySortitionModule",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
   {
     type: "function",
     inputs: [
@@ -16666,17 +17339,24 @@ export const klerosCoreUniversityImplementationAbi = [
     outputs: [],
     stateMutability: "payable",
   },
+  {
+    type: "function",
+    inputs: [],
+    name: "version",
+    outputs: [{ name: "", internalType: "string", type: "string" }],
+    stateMutability: "view",
+  },
 ] as const;
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xF74DaBfC5F5dbdBD07636637204d9C35326D2906)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xb75b0cc01af4aD0D65D50082ae0717004D479Aa0)
  */
 export const klerosCoreUniversityImplementationAddress = {
-  421614: "0xF74DaBfC5F5dbdBD07636637204d9C35326D2906",
+  421614: "0xb75b0cc01af4aD0D65D50082ae0717004D479Aa0",
 } as const;
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xF74DaBfC5F5dbdBD07636637204d9C35326D2906)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xb75b0cc01af4aD0D65D50082ae0717004D479Aa0)
  */
 export const klerosCoreUniversityImplementationConfig = {
   address: klerosCoreUniversityImplementationAddress,
@@ -16688,7 +17368,7 @@ export const klerosCoreUniversityImplementationConfig = {
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x5AB37F38778Bc175852fA353056591D91c744ce6)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xA34dBBD0E5e1d09bd683455f9dbC393797BC558f)
  */
 export const klerosCoreUniversityProxyAbi = [
   {
@@ -16704,14 +17384,14 @@ export const klerosCoreUniversityProxyAbi = [
 ] as const;
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x5AB37F38778Bc175852fA353056591D91c744ce6)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xA34dBBD0E5e1d09bd683455f9dbC393797BC558f)
  */
 export const klerosCoreUniversityProxyAddress = {
-  421614: "0x5AB37F38778Bc175852fA353056591D91c744ce6",
+  421614: "0xA34dBBD0E5e1d09bd683455f9dbC393797BC558f",
 } as const;
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x5AB37F38778Bc175852fA353056591D91c744ce6)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0xA34dBBD0E5e1d09bd683455f9dbC393797BC558f)
  */
 export const klerosCoreUniversityProxyConfig = {
   address: klerosCoreUniversityProxyAddress,
@@ -19560,7 +20240,7 @@ export const sortitionModuleConfig = {
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x4B2c2d048921f694cCE3AEa35698c6B1f5fcbb79)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x9f55804177e7E44E558616cD7d06B865788214cA)
  */
 export const sortitionModuleUniversityAbi = [
   { type: "fallback", stateMutability: "payable" },
@@ -19572,7 +20252,10 @@ export const sortitionModuleUniversityAbi = [
     inputs: [{ name: "implementation", internalType: "address", type: "address" }],
     name: "InvalidImplementation",
   },
+  { type: "error", inputs: [], name: "KlerosCoreOnly" },
+  { type: "error", inputs: [], name: "NotEligibleForWithdrawal" },
   { type: "error", inputs: [], name: "NotInitializing" },
+  { type: "error", inputs: [], name: "OwnerOnly" },
   { type: "error", inputs: [], name: "UUPSUnauthorizedCallContext" },
   {
     type: "error",
@@ -19592,6 +20275,44 @@ export const sortitionModuleUniversityAbi = [
     ],
     name: "Initialized",
   },
+  {
+    type: "event",
+    anonymous: false,
+    inputs: [
+      {
+        name: "_account",
+        internalType: "address",
+        type: "address",
+        indexed: true,
+      },
+      {
+        name: "_amount",
+        internalType: "uint256",
+        type: "uint256",
+        indexed: false,
+      },
+    ],
+    name: "LeftoverPNK",
+  },
+  {
+    type: "event",
+    anonymous: false,
+    inputs: [
+      {
+        name: "_account",
+        internalType: "address",
+        type: "address",
+        indexed: true,
+      },
+      {
+        name: "_amount",
+        internalType: "uint256",
+        type: "uint256",
+        indexed: false,
+      },
+    ],
+    name: "LeftoverPNKWithdrawn",
+  },
   {
     type: "event",
     anonymous: false,
@@ -19647,6 +20368,12 @@ export const sortitionModuleUniversityAbi = [
         type: "uint256",
         indexed: false,
       },
+      {
+        name: "_amountAllCourts",
+        internalType: "uint256",
+        type: "uint256",
+        indexed: false,
+      },
     ],
     name: "StakeSet",
   },
@@ -19689,7 +20416,7 @@ export const sortitionModuleUniversityAbi = [
   {
     type: "function",
     inputs: [
-      { name: "_key", internalType: "bytes32", type: "bytes32" },
+      { name: "_courtID", internalType: "uint96", type: "uint96" },
       { name: "_extraData", internalType: "bytes", type: "bytes" },
     ],
     name: "createTree",
@@ -19705,14 +20432,41 @@ export const sortitionModuleUniversityAbi = [
   },
   {
     type: "function",
-    inputs: [
-      { name: "", internalType: "bytes32", type: "bytes32" },
-      { name: "", internalType: "uint256", type: "uint256" },
-      { name: "", internalType: "uint256", type: "uint256" },
-    ],
-    name: "draw",
-    outputs: [{ name: "drawnAddress", internalType: "address", type: "address" }],
-    stateMutability: "view",
+    inputs: [
+      { name: "", internalType: "uint96", type: "uint96" },
+      { name: "", internalType: "uint256", type: "uint256" },
+      { name: "", internalType: "uint256", type: "uint256" },
+    ],
+    name: "draw",
+    outputs: [
+      { name: "drawnAddress", internalType: "address", type: "address" },
+      { name: "fromSubcourtID", internalType: "uint96", type: "uint96" },
+    ],
+    stateMutability: "view",
+  },
+  {
+    type: "function",
+    inputs: [{ name: "_iterations", internalType: "uint256", type: "uint256" }],
+    name: "executeDelayedStakes",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
+  {
+    type: "function",
+    inputs: [
+      { name: "_account", internalType: "address", type: "address" },
+      { name: "_courtID", internalType: "uint96", type: "uint96" },
+    ],
+    name: "forcedUnstake",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
+  {
+    type: "function",
+    inputs: [{ name: "_account", internalType: "address", type: "address" }],
+    name: "forcedUnstakeAllCourts",
+    outputs: [],
+    stateMutability: "nonpayable",
   },
   {
     type: "function",
@@ -19738,15 +20492,15 @@ export const sortitionModuleUniversityAbi = [
   },
   {
     type: "function",
-    inputs: [],
-    name: "governor",
-    outputs: [{ name: "", internalType: "address", type: "address" }],
+    inputs: [{ name: "_juror", internalType: "address", type: "address" }],
+    name: "getJurorLeftoverPNK",
+    outputs: [{ name: "", internalType: "uint256", type: "uint256" }],
     stateMutability: "view",
   },
   {
     type: "function",
     inputs: [
-      { name: "_governor", internalType: "address", type: "address" },
+      { name: "_owner", internalType: "address", type: "address" },
       {
         name: "_core",
         internalType: "contract KlerosCoreUniversity",
@@ -19786,18 +20540,15 @@ export const sortitionModuleUniversityAbi = [
   },
   {
     type: "function",
-    inputs: [{ name: "_randomNumber", internalType: "uint256", type: "uint256" }],
-    name: "notifyRandomNumber",
-    outputs: [],
-    stateMutability: "nonpayable",
+    inputs: [],
+    name: "owner",
+    outputs: [{ name: "", internalType: "address", type: "address" }],
+    stateMutability: "view",
   },
   {
     type: "function",
-    inputs: [
-      { name: "_account", internalType: "address", type: "address" },
-      { name: "_relativeAmount", internalType: "uint256", type: "uint256" },
-    ],
-    name: "penalizeStake",
+    inputs: [],
+    name: "passPhase",
     outputs: [],
     stateMutability: "nonpayable",
   },
@@ -19820,8 +20571,14 @@ export const sortitionModuleUniversityAbi = [
   },
   {
     type: "function",
-    inputs: [{ name: "_account", internalType: "address", type: "address" }],
-    name: "setJurorInactive",
+    inputs: [
+      { name: "_account", internalType: "address", type: "address" },
+      { name: "_courtID", internalType: "uint96", type: "uint96" },
+      { name: "_pnkDeposit", internalType: "uint256", type: "uint256" },
+      { name: "_pnkWithdrawal", internalType: "uint256", type: "uint256" },
+      { name: "_newStake", internalType: "uint256", type: "uint256" },
+    ],
+    name: "setStake",
     outputs: [],
     stateMutability: "nonpayable",
   },
@@ -19830,19 +20587,25 @@ export const sortitionModuleUniversityAbi = [
     inputs: [
       { name: "_account", internalType: "address", type: "address" },
       { name: "_courtID", internalType: "uint96", type: "uint96" },
-      { name: "_newStake", internalType: "uint256", type: "uint256" },
-      { name: "_alreadyTransferred", internalType: "bool", type: "bool" },
+      { name: "_penalty", internalType: "uint256", type: "uint256" },
     ],
-    name: "setStake",
+    name: "setStakePenalty",
     outputs: [
-      { name: "pnkDeposit", internalType: "uint256", type: "uint256" },
-      { name: "pnkWithdrawal", internalType: "uint256", type: "uint256" },
-      {
-        name: "stakingResult",
-        internalType: "enum StakingResult",
-        type: "uint8",
-      },
+      { name: "pnkBalance", internalType: "uint256", type: "uint256" },
+      { name: "newCourtStake", internalType: "uint256", type: "uint256" },
+      { name: "availablePenalty", internalType: "uint256", type: "uint256" },
+    ],
+    stateMutability: "nonpayable",
+  },
+  {
+    type: "function",
+    inputs: [
+      { name: "_account", internalType: "address", type: "address" },
+      { name: "_courtID", internalType: "uint96", type: "uint96" },
+      { name: "_reward", internalType: "uint256", type: "uint256" },
     ],
+    name: "setStakeReward",
+    outputs: [{ name: "success", internalType: "bool", type: "bool" }],
     stateMutability: "nonpayable",
   },
   {
@@ -19872,6 +20635,40 @@ export const sortitionModuleUniversityAbi = [
     outputs: [],
     stateMutability: "payable",
   },
+  {
+    type: "function",
+    inputs: [
+      { name: "_account", internalType: "address", type: "address" },
+      { name: "_courtID", internalType: "uint96", type: "uint96" },
+      { name: "_newStake", internalType: "uint256", type: "uint256" },
+      { name: "", internalType: "bool", type: "bool" },
+    ],
+    name: "validateStake",
+    outputs: [
+      { name: "pnkDeposit", internalType: "uint256", type: "uint256" },
+      { name: "pnkWithdrawal", internalType: "uint256", type: "uint256" },
+      {
+        name: "stakingResult",
+        internalType: "enum StakingResult",
+        type: "uint8",
+      },
+    ],
+    stateMutability: "view",
+  },
+  {
+    type: "function",
+    inputs: [],
+    name: "version",
+    outputs: [{ name: "", internalType: "string", type: "string" }],
+    stateMutability: "view",
+  },
+  {
+    type: "function",
+    inputs: [{ name: "_account", internalType: "address", type: "address" }],
+    name: "withdrawLeftoverPNK",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
   {
     type: "constructor",
     inputs: [
@@ -19883,14 +20680,14 @@ export const sortitionModuleUniversityAbi = [
 ] as const;
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x4B2c2d048921f694cCE3AEa35698c6B1f5fcbb79)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x9f55804177e7E44E558616cD7d06B865788214cA)
  */
 export const sortitionModuleUniversityAddress = {
-  421614: "0x4B2c2d048921f694cCE3AEa35698c6B1f5fcbb79",
+  421614: "0x9f55804177e7E44E558616cD7d06B865788214cA",
 } as const;
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x4B2c2d048921f694cCE3AEa35698c6B1f5fcbb79)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x9f55804177e7E44E558616cD7d06B865788214cA)
  */
 export const sortitionModuleUniversityConfig = {
   address: sortitionModuleUniversityAddress,
@@ -19902,7 +20699,7 @@ export const sortitionModuleUniversityConfig = {
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x5CAD621D69E0535422aCFaCC0017bC32beC7A486)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x270e3D63d3d275604df0a1Bd312E1255DCd96936)
  */
 export const sortitionModuleUniversityImplementationAbi = [
   { type: "constructor", inputs: [], stateMutability: "nonpayable" },
@@ -19913,7 +20710,10 @@ export const sortitionModuleUniversityImplementationAbi = [
     inputs: [{ name: "implementation", internalType: "address", type: "address" }],
     name: "InvalidImplementation",
   },
+  { type: "error", inputs: [], name: "KlerosCoreOnly" },
+  { type: "error", inputs: [], name: "NotEligibleForWithdrawal" },
   { type: "error", inputs: [], name: "NotInitializing" },
+  { type: "error", inputs: [], name: "OwnerOnly" },
   { type: "error", inputs: [], name: "UUPSUnauthorizedCallContext" },
   {
     type: "error",
@@ -19933,6 +20733,44 @@ export const sortitionModuleUniversityImplementationAbi = [
     ],
     name: "Initialized",
   },
+  {
+    type: "event",
+    anonymous: false,
+    inputs: [
+      {
+        name: "_account",
+        internalType: "address",
+        type: "address",
+        indexed: true,
+      },
+      {
+        name: "_amount",
+        internalType: "uint256",
+        type: "uint256",
+        indexed: false,
+      },
+    ],
+    name: "LeftoverPNK",
+  },
+  {
+    type: "event",
+    anonymous: false,
+    inputs: [
+      {
+        name: "_account",
+        internalType: "address",
+        type: "address",
+        indexed: true,
+      },
+      {
+        name: "_amount",
+        internalType: "uint256",
+        type: "uint256",
+        indexed: false,
+      },
+    ],
+    name: "LeftoverPNKWithdrawn",
+  },
   {
     type: "event",
     anonymous: false,
@@ -19988,6 +20826,12 @@ export const sortitionModuleUniversityImplementationAbi = [
         type: "uint256",
         indexed: false,
       },
+      {
+        name: "_amountAllCourts",
+        internalType: "uint256",
+        type: "uint256",
+        indexed: false,
+      },
     ],
     name: "StakeSet",
   },
@@ -20030,7 +20874,7 @@ export const sortitionModuleUniversityImplementationAbi = [
   {
     type: "function",
     inputs: [
-      { name: "_key", internalType: "bytes32", type: "bytes32" },
+      { name: "_courtID", internalType: "uint96", type: "uint96" },
       { name: "_extraData", internalType: "bytes", type: "bytes" },
     ],
     name: "createTree",
@@ -20047,14 +20891,41 @@ export const sortitionModuleUniversityImplementationAbi = [
   {
     type: "function",
     inputs: [
-      { name: "", internalType: "bytes32", type: "bytes32" },
+      { name: "", internalType: "uint96", type: "uint96" },
       { name: "", internalType: "uint256", type: "uint256" },
       { name: "", internalType: "uint256", type: "uint256" },
     ],
     name: "draw",
-    outputs: [{ name: "drawnAddress", internalType: "address", type: "address" }],
+    outputs: [
+      { name: "drawnAddress", internalType: "address", type: "address" },
+      { name: "fromSubcourtID", internalType: "uint96", type: "uint96" },
+    ],
     stateMutability: "view",
   },
+  {
+    type: "function",
+    inputs: [{ name: "_iterations", internalType: "uint256", type: "uint256" }],
+    name: "executeDelayedStakes",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
+  {
+    type: "function",
+    inputs: [
+      { name: "_account", internalType: "address", type: "address" },
+      { name: "_courtID", internalType: "uint96", type: "uint96" },
+    ],
+    name: "forcedUnstake",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
+  {
+    type: "function",
+    inputs: [{ name: "_account", internalType: "address", type: "address" }],
+    name: "forcedUnstakeAllCourts",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
   {
     type: "function",
     inputs: [
@@ -20079,15 +20950,15 @@ export const sortitionModuleUniversityImplementationAbi = [
   },
   {
     type: "function",
-    inputs: [],
-    name: "governor",
-    outputs: [{ name: "", internalType: "address", type: "address" }],
+    inputs: [{ name: "_juror", internalType: "address", type: "address" }],
+    name: "getJurorLeftoverPNK",
+    outputs: [{ name: "", internalType: "uint256", type: "uint256" }],
     stateMutability: "view",
   },
   {
     type: "function",
     inputs: [
-      { name: "_governor", internalType: "address", type: "address" },
+      { name: "_owner", internalType: "address", type: "address" },
       {
         name: "_core",
         internalType: "contract KlerosCoreUniversity",
@@ -20127,18 +20998,15 @@ export const sortitionModuleUniversityImplementationAbi = [
   },
   {
     type: "function",
-    inputs: [{ name: "_randomNumber", internalType: "uint256", type: "uint256" }],
-    name: "notifyRandomNumber",
-    outputs: [],
-    stateMutability: "nonpayable",
+    inputs: [],
+    name: "owner",
+    outputs: [{ name: "", internalType: "address", type: "address" }],
+    stateMutability: "view",
   },
   {
     type: "function",
-    inputs: [
-      { name: "_account", internalType: "address", type: "address" },
-      { name: "_relativeAmount", internalType: "uint256", type: "uint256" },
-    ],
-    name: "penalizeStake",
+    inputs: [],
+    name: "passPhase",
     outputs: [],
     stateMutability: "nonpayable",
   },
@@ -20161,8 +21029,14 @@ export const sortitionModuleUniversityImplementationAbi = [
   },
   {
     type: "function",
-    inputs: [{ name: "_account", internalType: "address", type: "address" }],
-    name: "setJurorInactive",
+    inputs: [
+      { name: "_account", internalType: "address", type: "address" },
+      { name: "_courtID", internalType: "uint96", type: "uint96" },
+      { name: "_pnkDeposit", internalType: "uint256", type: "uint256" },
+      { name: "_pnkWithdrawal", internalType: "uint256", type: "uint256" },
+      { name: "_newStake", internalType: "uint256", type: "uint256" },
+    ],
+    name: "setStake",
     outputs: [],
     stateMutability: "nonpayable",
   },
@@ -20171,19 +21045,25 @@ export const sortitionModuleUniversityImplementationAbi = [
     inputs: [
       { name: "_account", internalType: "address", type: "address" },
       { name: "_courtID", internalType: "uint96", type: "uint96" },
-      { name: "_newStake", internalType: "uint256", type: "uint256" },
-      { name: "_alreadyTransferred", internalType: "bool", type: "bool" },
+      { name: "_penalty", internalType: "uint256", type: "uint256" },
     ],
-    name: "setStake",
+    name: "setStakePenalty",
     outputs: [
-      { name: "pnkDeposit", internalType: "uint256", type: "uint256" },
-      { name: "pnkWithdrawal", internalType: "uint256", type: "uint256" },
-      {
-        name: "stakingResult",
-        internalType: "enum StakingResult",
-        type: "uint8",
-      },
+      { name: "pnkBalance", internalType: "uint256", type: "uint256" },
+      { name: "newCourtStake", internalType: "uint256", type: "uint256" },
+      { name: "availablePenalty", internalType: "uint256", type: "uint256" },
+    ],
+    stateMutability: "nonpayable",
+  },
+  {
+    type: "function",
+    inputs: [
+      { name: "_account", internalType: "address", type: "address" },
+      { name: "_courtID", internalType: "uint96", type: "uint96" },
+      { name: "_reward", internalType: "uint256", type: "uint256" },
     ],
+    name: "setStakeReward",
+    outputs: [{ name: "success", internalType: "bool", type: "bool" }],
     stateMutability: "nonpayable",
   },
   {
@@ -20213,17 +21093,51 @@ export const sortitionModuleUniversityImplementationAbi = [
     outputs: [],
     stateMutability: "payable",
   },
+  {
+    type: "function",
+    inputs: [
+      { name: "_account", internalType: "address", type: "address" },
+      { name: "_courtID", internalType: "uint96", type: "uint96" },
+      { name: "_newStake", internalType: "uint256", type: "uint256" },
+      { name: "", internalType: "bool", type: "bool" },
+    ],
+    name: "validateStake",
+    outputs: [
+      { name: "pnkDeposit", internalType: "uint256", type: "uint256" },
+      { name: "pnkWithdrawal", internalType: "uint256", type: "uint256" },
+      {
+        name: "stakingResult",
+        internalType: "enum StakingResult",
+        type: "uint8",
+      },
+    ],
+    stateMutability: "view",
+  },
+  {
+    type: "function",
+    inputs: [],
+    name: "version",
+    outputs: [{ name: "", internalType: "string", type: "string" }],
+    stateMutability: "view",
+  },
+  {
+    type: "function",
+    inputs: [{ name: "_account", internalType: "address", type: "address" }],
+    name: "withdrawLeftoverPNK",
+    outputs: [],
+    stateMutability: "nonpayable",
+  },
 ] as const;
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x5CAD621D69E0535422aCFaCC0017bC32beC7A486)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x270e3D63d3d275604df0a1Bd312E1255DCd96936)
  */
 export const sortitionModuleUniversityImplementationAddress = {
-  421614: "0x5CAD621D69E0535422aCFaCC0017bC32beC7A486",
+  421614: "0x270e3D63d3d275604df0a1Bd312E1255DCd96936",
 } as const;
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x5CAD621D69E0535422aCFaCC0017bC32beC7A486)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x270e3D63d3d275604df0a1Bd312E1255DCd96936)
  */
 export const sortitionModuleUniversityImplementationConfig = {
   address: sortitionModuleUniversityImplementationAddress,
@@ -20235,7 +21149,7 @@ export const sortitionModuleUniversityImplementationConfig = {
 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x4B2c2d048921f694cCE3AEa35698c6B1f5fcbb79)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x9f55804177e7E44E558616cD7d06B865788214cA)
  */
 export const sortitionModuleUniversityProxyAbi = [
   {
@@ -20251,14 +21165,14 @@ export const sortitionModuleUniversityProxyAbi = [
 ] as const;
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x4B2c2d048921f694cCE3AEa35698c6B1f5fcbb79)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x9f55804177e7E44E558616cD7d06B865788214cA)
  */
 export const sortitionModuleUniversityProxyAddress = {
-  421614: "0x4B2c2d048921f694cCE3AEa35698c6B1f5fcbb79",
+  421614: "0x9f55804177e7E44E558616cD7d06B865788214cA",
 } as const;
 
 /**
- * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x4B2c2d048921f694cCE3AEa35698c6B1f5fcbb79)
+ * [__View Contract on Arbitrum Sepolia Arbiscan__](https://sepolia.arbiscan.io/address/0x9f55804177e7E44E558616cD7d06B865788214cA)
  */
 export const sortitionModuleUniversityProxyConfig = {
   address: sortitionModuleUniversityProxyAddress,
diff --git a/contracts/scripts/utils/contracts.ts b/contracts/scripts/utils/contracts.ts
index 50bcac2f6..fcfb91ac8 100644
--- a/contracts/scripts/utils/contracts.ts
+++ b/contracts/scripts/utils/contracts.ts
@@ -41,6 +41,7 @@ export const getContractNames = (coreType: Core) => {
       disputeKitShutter: "DisputeKitShutter",
       disputeKitGated: "DisputeKitGated",
       disputeKitGatedShutter: "DisputeKitGatedShutter",
+      disputeTemplateRegistry: "DisputeTemplateRegistry",
       disputeResolver: "DisputeResolver",
     },
     [Cores.UNIVERSITY]: {
@@ -50,6 +51,7 @@ export const getContractNames = (coreType: Core) => {
       disputeKitShutter: "DisputeKitShutterUniversity",
       disputeKitGated: "DisputeKitGatedUniversity",
       disputeKitGatedShutter: "DisputeKitGatedShutterUniversity",
+      disputeTemplateRegistry: "DisputeTemplateRegistryUniversity",
       disputeResolver: "DisputeResolverUniversity",
     },
   };
@@ -59,7 +61,6 @@ export const getContractNames = (coreType: Core) => {
   return {
     ...coreSpecificNames[coreType],
     evidence: "EvidenceModule",
-    disputeTemplateRegistry: "DisputeTemplateRegistry",
     policyRegistry: "PolicyRegistry",
     batcher: "TransactionBatcher",
     chainlinkRng: "ChainlinkRNG",
diff --git a/contracts/scripts/utils/execution.ts b/contracts/scripts/utils/execution.ts
index b35709d5d..763eb9191 100644
--- a/contracts/scripts/utils/execution.ts
+++ b/contracts/scripts/utils/execution.ts
@@ -5,7 +5,7 @@ import { type BuilderTransaction, template, transaction, transactionBuilderUrl }
 const governableAbi = [
   {
     inputs: [],
-    name: "owner",
+    name: "governor",
     outputs: [
       {
         internalType: "address",
@@ -25,7 +25,7 @@ export const execute = async (tx: ContractTransaction) => {
   const { ethers } = hre;
 
   const contract = await ethers.getContractAt(governableAbi, tx.to);
-  const owner = await contract.owner();
+  const owner = await contract.governor();
   const isContract = (await ethers.provider.getCode(owner)).length > 2;
   if (isContract) {
     // Don't execute, just log the tx. It must be submitted for execution separately.
diff --git a/contracts/src/proxy/KlerosProxies.sol b/contracts/src/proxy/KlerosProxies.sol
index 7db79b67c..9eb9f8ffc 100644
--- a/contracts/src/proxy/KlerosProxies.sol
+++ b/contracts/src/proxy/KlerosProxies.sol
@@ -31,6 +31,10 @@ contract DisputeKitSybilResistantProxy is UUPSProxy {
     constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}
 }
 
+contract DisputeTemplateRegistryUniversityProxy is UUPSProxy {
+    constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}
+}
+
 contract DisputeTemplateRegistryProxy is UUPSProxy {
     constructor(address _implementation, bytes memory _data) UUPSProxy(_implementation, _data) {}
 }
diff --git a/contracts/test/integration/getContractsEthers.test.ts b/contracts/test/integration/getContractsEthers.test.ts
index 8bd2b9cf5..40ff2b8f4 100644
--- a/contracts/test/integration/getContractsEthers.test.ts
+++ b/contracts/test/integration/getContractsEthers.test.ts
@@ -86,7 +86,7 @@ const universityContractMapping: ContractMapping = {
   disputeKitGated: { name: "DisputeKitGatedUniversity", optional: true },
   disputeKitGatedShutter: { name: "DisputeKitGatedShutterUniversity", optional: true },
   disputeResolver: { name: "DisputeResolverUniversity" },
-  disputeTemplateRegistry: { name: "DisputeTemplateRegistry" },
+  disputeTemplateRegistry: { name: "DisputeTemplateRegistryUniversity" },
   evidence: { name: "EvidenceModule" },
   policyRegistry: { name: "PolicyRegistry" },
   transactionBatcher: { name: "TransactionBatcher" },
diff --git a/contracts/test/integration/getContractsViem.test.ts b/contracts/test/integration/getContractsViem.test.ts
index 67c5a92af..b9813a404 100644
--- a/contracts/test/integration/getContractsViem.test.ts
+++ b/contracts/test/integration/getContractsViem.test.ts
@@ -66,7 +66,7 @@ const universityContractMapping: ContractMapping = {
   disputeKitGated: { name: "DisputeKitGatedUniversity", optional: true },
   disputeKitGatedShutter: { name: "DisputeKitGatedShutterUniversity", optional: true },
   disputeResolver: { name: "DisputeResolverUniversity" },
-  disputeTemplateRegistry: { name: "DisputeTemplateRegistry" },
+  disputeTemplateRegistry: { name: "DisputeTemplateRegistryUniversity" },
   evidence: { name: "EvidenceModule" },
   policyRegistry: { name: "PolicyRegistry" },
   transactionBatcher: { name: "TransactionBatcher" },

From e59e79babe2a316cf9a9de8f35d124cc5d63ae05 Mon Sep 17 00:00:00 2001
From: kemuru <102478601+kemuru@users.noreply.github.com>
Date: Mon, 15 Sep 2025 15:43:10 +0900
Subject: [PATCH 130/175] feat: markdown editor and markdown renderer

---
 web/package.json                              |    1 +
 web/src/components/EvidenceCard.tsx           |   22 +-
 web/src/components/MarkdownEditor.tsx         |  223 ++
 web/src/components/MarkdownRenderer.tsx       |  196 ++
 .../Evidence/SubmitEvidenceModal.tsx          |   24 +-
 .../CaseDetails/Voting/Classic/Reveal.tsx     |    5 +-
 .../CaseDetails/Voting/JustificationArea.tsx  |   37 -
 .../CaseDetails/Voting/OptionsContainer.tsx   |    9 +-
 .../CaseDetails/Voting/VotesDetails/index.tsx |   12 +-
 yarn.lock                                     | 2498 ++++++++++++++++-
 10 files changed, 2905 insertions(+), 122 deletions(-)
 create mode 100644 web/src/components/MarkdownEditor.tsx
 create mode 100644 web/src/components/MarkdownRenderer.tsx
 delete mode 100644 web/src/pages/Cases/CaseDetails/Voting/JustificationArea.tsx

diff --git a/web/package.json b/web/package.json
index 11d688844..35e5f6f29 100644
--- a/web/package.json
+++ b/web/package.json
@@ -91,6 +91,7 @@
     "@kleros/ui-components-library": "^2.20.0",
     "@lifi/wallet-management": "^3.7.1",
     "@lifi/widget": "^3.18.1",
+    "@mdxeditor/editor": "^3.44.2",
     "@reown/appkit": "^1.7.1",
     "@reown/appkit-adapter-wagmi": "^1.7.1",
     "@sentry/react": "^7.120.0",
diff --git a/web/src/components/EvidenceCard.tsx b/web/src/components/EvidenceCard.tsx
index f17d97e26..90ea42f00 100644
--- a/web/src/components/EvidenceCard.tsx
+++ b/web/src/components/EvidenceCard.tsx
@@ -1,7 +1,6 @@
 import React, { useMemo } from "react";
 import styled, { css } from "styled-components";
 
-import ReactMarkdown from "react-markdown";
 import { useParams } from "react-router-dom";
 
 import { Card } from "@kleros/ui-components-library";
@@ -18,9 +17,11 @@ import { hoverShortTransitionTiming } from "styles/commonStyles";
 import { landscapeStyle } from "styles/landscapeStyle";
 import { responsiveSize } from "styles/responsiveSize";
 
+import JurorTitle from "pages/Home/TopJurors/JurorCard/JurorTitle";
+
 import { ExternalLink } from "./ExternalLink";
 import { InternalLink } from "./InternalLink";
-import JurorTitle from "pages/Home/TopJurors/JurorCard/JurorTitle";
+import MarkdownRenderer from "./MarkdownRenderer";
 
 const StyledCard = styled(Card)`
   width: 100%;
@@ -66,17 +67,6 @@ const Index = styled.p`
 `;
 
 const ReactMarkdownWrapper = styled.div``;
-const StyledReactMarkdown = styled(ReactMarkdown)`
-  a {
-    font-size: 16px;
-  }
-  code {
-    color: ${({ theme }) => theme.secondaryText};
-  }
-  p {
-    margin: 0;
-  }
-`;
 
 const BottomShade = styled.div`
   background-color: ${({ theme }) => theme.lightBlue};
@@ -227,10 +217,12 @@ const EvidenceCard: React.FC<IEvidenceCard> = ({
         </IndexAndName>
         {name && description ? (
           <ReactMarkdownWrapper dir="auto">
-            <StyledReactMarkdown>{description}</StyledReactMarkdown>
+            <MarkdownRenderer content={description} />
           </ReactMarkdownWrapper>
         ) : (
-          <p>{evidence}</p>
+          <ReactMarkdownWrapper dir="auto">
+            <MarkdownRenderer content={evidence} />
+          </ReactMarkdownWrapper>
         )}
       </TopContent>
       <BottomShade>
diff --git a/web/src/components/MarkdownEditor.tsx b/web/src/components/MarkdownEditor.tsx
new file mode 100644
index 000000000..2a3fdb54e
--- /dev/null
+++ b/web/src/components/MarkdownEditor.tsx
@@ -0,0 +1,223 @@
+import React, { useRef } from "react";
+import styled from "styled-components";
+
+import {
+  MDXEditor,
+  type MDXEditorMethods,
+  type MDXEditorProps,
+  headingsPlugin,
+  listsPlugin,
+  quotePlugin,
+  thematicBreakPlugin,
+  markdownShortcutPlugin,
+  linkPlugin,
+  linkDialogPlugin,
+  tablePlugin,
+  toolbarPlugin,
+  UndoRedo,
+  BoldItalicUnderlineToggles,
+  CodeToggle,
+  ListsToggle,
+  CreateLink,
+  InsertTable,
+  BlockTypeSelect,
+  Separator,
+} from "@mdxeditor/editor";
+
+import "@mdxeditor/editor/style.css";
+
+import InfoIcon from "svgs/icons/info-circle.svg";
+
+const Container = styled.div<{ isEmpty: boolean }>`
+  width: 100%;
+
+  [class*="mdxeditor"] {
+    background-color: ${({ theme }) => theme.whiteBackground} !important;
+    border: 1px solid ${({ theme }) => theme.stroke} !important;
+    border-radius: 3px;
+    font-family: "Open Sans", sans-serif;
+  }
+
+  [class*="toolbar"] {
+    background-color: ${({ theme }) => theme.lightGrey} !important;
+    border-bottom: none !important;
+
+    button {
+      color: ${({ theme }) => theme.whiteBackground} !important;
+    }
+
+    svg {
+      fill: ${({ theme }) => theme.whiteBackground} !important;
+    }
+
+    select {
+      background-color: ${({ theme }) => theme.whiteBackground} !important;
+      color: ${({ theme }) => theme.primaryText} !important;
+    }
+  }
+
+  [class*="contentEditable"] {
+    background-color: ${({ theme }) => theme.whiteBackground} !important;
+    color: ${({ theme }) => theme.primaryText} !important;
+    min-height: 200px;
+    padding: 16px;
+    font-size: 16px;
+    line-height: 1.5;
+
+    p {
+      color: ${({ theme, isEmpty }) => (isEmpty ? theme.secondaryText : theme.primaryText)} !important;
+      margin: 0 0 12px 0;
+    }
+
+    p:empty::before {
+      color: ${({ theme }) => theme.secondaryText} !important;
+      opacity: 0.6 !important;
+    }
+
+    h1,
+    h2,
+    h3,
+    h4,
+    h5,
+    h6 {
+      color: ${({ theme }) => theme.primaryText} !important;
+      font-weight: 600;
+      margin: 16px 0 8px 0;
+    }
+
+    blockquote {
+      color: ${({ theme }) => theme.secondaryText} !important;
+      border-left: 3px solid ${({ theme }) => theme.mediumBlue} !important;
+      font-style: italic;
+      margin: 16px 0;
+      padding-left: 12px;
+    }
+
+    code {
+      background-color: ${({ theme }) => theme.lightGrey} !important;
+      color: ${({ theme }) => theme.primaryText} !important;
+    }
+
+    pre {
+      background-color: ${({ theme }) => theme.lightGrey} !important;
+      color: ${({ theme }) => theme.primaryText} !important;
+    }
+
+    a {
+      color: ${({ theme }) => theme.primaryBlue} !important;
+    }
+
+    th {
+      background-color: ${({ theme }) => theme.lightGrey} !important;
+      color: ${({ theme }) => theme.primaryText} !important;
+    }
+
+    td {
+      color: ${({ theme }) => theme.primaryText} !important;
+    }
+  }
+`;
+
+const MessageContainer = styled.div`
+  display: flex;
+  align-items: flex-start;
+  gap: 8px;
+  margin-top: 8px;
+`;
+
+const MessageText = styled.small`
+  font-size: 14px;
+  font-weight: 400;
+  color: ${({ theme }) => theme.secondaryText};
+  hyphens: auto;
+  line-height: 1.4;
+`;
+
+const StyledInfoIcon = styled(InfoIcon)`
+  width: 16px;
+  height: 16px;
+  fill: ${({ theme }) => theme.secondaryText} !important;
+  flex-shrink: 0;
+  margin-top: 2px;
+
+  path {
+    fill: ${({ theme }) => theme.secondaryText} !important;
+  }
+
+  * {
+    fill: ${({ theme }) => theme.secondaryText} !important;
+  }
+`;
+
+interface IMarkdownEditor {
+  value: string;
+  onChange: (value: string) => void;
+  placeholder?: string;
+  showMessage?: boolean;
+}
+
+const MarkdownEditor: React.FC<IMarkdownEditor> = ({
+  value,
+  onChange,
+  placeholder = "Justify your vote...",
+  showMessage = true,
+}) => {
+  const editorRef = useRef<MDXEditorMethods>(null);
+
+  const handleChange = (markdown: string) => {
+    onChange(markdown);
+  };
+
+  const isEmpty = !value || value.trim() === "";
+
+  const editorProps: MDXEditorProps = {
+    markdown: value,
+    onChange: handleChange,
+    placeholder,
+    plugins: [
+      headingsPlugin(),
+      listsPlugin(),
+      quotePlugin(),
+      thematicBreakPlugin(),
+      markdownShortcutPlugin(),
+      linkPlugin(),
+      linkDialogPlugin(),
+      tablePlugin(),
+      toolbarPlugin({
+        toolbarContents: () => (
+          <>
+            <UndoRedo />
+            <Separator />
+            <BoldItalicUnderlineToggles />
+            <CodeToggle />
+            <Separator />
+            <BlockTypeSelect />
+            <Separator />
+            <ListsToggle />
+            <Separator />
+            <CreateLink />
+            <InsertTable />
+          </>
+        ),
+      }),
+    ],
+  };
+
+  return (
+    <Container isEmpty={isEmpty}>
+      <MDXEditor ref={editorRef} {...editorProps} />
+      {showMessage && (
+        <MessageContainer>
+          <StyledInfoIcon />
+          <MessageText>
+            Please provide a comprehensive justification for your decision. Quality explanations are essential for the
+            parties involved and may be eligible for additional compensation in accordance with our justification
+            policy.
+          </MessageText>
+        </MessageContainer>
+      )}
+    </Container>
+  );
+};
+
+export default MarkdownEditor;
diff --git a/web/src/components/MarkdownRenderer.tsx b/web/src/components/MarkdownRenderer.tsx
new file mode 100644
index 000000000..8df425279
--- /dev/null
+++ b/web/src/components/MarkdownRenderer.tsx
@@ -0,0 +1,196 @@
+import React from "react";
+import styled from "styled-components";
+
+import {
+  MDXEditor,
+  type MDXEditorProps,
+  headingsPlugin,
+  listsPlugin,
+  quotePlugin,
+  thematicBreakPlugin,
+  markdownShortcutPlugin,
+  linkPlugin,
+  tablePlugin,
+} from "@mdxeditor/editor";
+
+import "@mdxeditor/editor/style.css";
+
+const Container = styled.div`
+  width: 100%;
+
+  [class*="mdxeditor"] {
+    background: transparent !important;
+    border: none !important;
+  }
+
+  [class*="toolbar"] {
+    display: none !important;
+  }
+
+  [class*="contentEditable"] {
+    background: transparent !important;
+    border: none !important;
+    padding: 0 !important;
+    font-size: 16px;
+    line-height: 1.5;
+
+    p {
+      margin: 0 0 12px 0;
+      color: ${({ theme }) => theme.primaryText} !important;
+    }
+
+    p:last-child {
+      margin-bottom: 0;
+    }
+
+    h1,
+    h2,
+    h3,
+    h4,
+    h5,
+    h6 {
+      margin: 16px 0 8px 0;
+      font-weight: 600;
+      color: ${({ theme }) => theme.primaryText} !important;
+    }
+
+    h1 {
+      font-size: 24px;
+    }
+    h2 {
+      font-size: 20px;
+    }
+    h3 {
+      font-size: 18px;
+    }
+    h4 {
+      font-size: 16px;
+    }
+    h5 {
+      font-size: 14px;
+    }
+    h6 {
+      font-size: 12px;
+    }
+
+    ul,
+    ol {
+      margin: 8px 0;
+      padding-left: 24px;
+    }
+
+    li {
+      margin: 4px 0;
+      color: ${({ theme }) => theme.primaryText} !important;
+    }
+
+    blockquote {
+      border-left: 3px solid ${({ theme }) => theme.mediumBlue} !important;
+      padding-left: 12px;
+      margin: 16px 0;
+      color: ${({ theme }) => theme.secondaryText} !important;
+      font-style: italic;
+    }
+
+    code {
+      background-color: ${({ theme }) => theme.lightGrey} !important;
+      color: ${({ theme }) => theme.primaryText} !important;
+      padding: 2px 4px;
+      border-radius: 3px;
+      font-family: "Monaco", "Consolas", monospace;
+      font-size: 14px;
+    }
+
+    pre {
+      background-color: ${({ theme }) => theme.lightGrey} !important;
+      color: ${({ theme }) => theme.primaryText} !important;
+      padding: 12px;
+      border-radius: 3px;
+      overflow-x: auto;
+      margin: 16px 0;
+    }
+
+    pre code {
+      background: transparent !important;
+      padding: 0;
+    }
+
+    table {
+      border-collapse: collapse;
+      width: 100%;
+      margin: 16px 0;
+    }
+
+    th,
+    td {
+      border: 1px solid ${({ theme }) => theme.stroke} !important;
+      padding: 8px 12px;
+      text-align: left;
+      color: ${({ theme }) => theme.primaryText} !important;
+    }
+
+    th {
+      background-color: ${({ theme }) => theme.lightGrey} !important;
+      font-weight: 600;
+    }
+
+    a {
+      color: ${({ theme }) => theme.primaryBlue} !important;
+      text-decoration: none;
+    }
+
+    a:hover {
+      text-decoration: underline;
+      color: ${({ theme }) => theme.secondaryBlue} !important;
+    }
+
+    hr {
+      border: none;
+      border-top: 1px solid ${({ theme }) => theme.stroke} !important;
+      margin: 24px 0;
+    }
+
+    img {
+      max-width: 100%;
+      height: auto;
+    }
+
+    * {
+      cursor: default !important;
+      user-select: text !important;
+    }
+  }
+`;
+
+interface IMarkdownRenderer {
+  content: string;
+  className?: string;
+}
+
+const MarkdownRenderer: React.FC<IMarkdownRenderer> = ({ content, className }) => {
+  if (!content || content.trim() === "") {
+    return null;
+  }
+
+  const editorProps: MDXEditorProps = {
+    markdown: content,
+    readOnly: true,
+    plugins: [
+      headingsPlugin(),
+      listsPlugin(),
+      quotePlugin(),
+      thematicBreakPlugin(),
+      markdownShortcutPlugin(),
+      linkPlugin(),
+      tablePlugin(),
+    ],
+  };
+
+  return (
+    <Container className={className}>
+      <MDXEditor {...editorProps} />
+    </Container>
+  );
+};
+
+export default MarkdownRenderer;
diff --git a/web/src/pages/Cases/CaseDetails/Evidence/SubmitEvidenceModal.tsx b/web/src/pages/Cases/CaseDetails/Evidence/SubmitEvidenceModal.tsx
index 12916f302..e163d77a9 100644
--- a/web/src/pages/Cases/CaseDetails/Evidence/SubmitEvidenceModal.tsx
+++ b/web/src/pages/Cases/CaseDetails/Evidence/SubmitEvidenceModal.tsx
@@ -5,7 +5,7 @@ import Modal from "react-modal";
 import { useWalletClient, usePublicClient, useConfig } from "wagmi";
 
 import { Roles, useAtlasProvider } from "@kleros/kleros-app";
-import { Textarea, Button, FileUploader } from "@kleros/ui-components-library";
+import { Button, FileUploader } from "@kleros/ui-components-library";
 
 import { simulateEvidenceModuleSubmitEvidence } from "hooks/contracts/generated";
 import { wrapWithToast, errorToast, infoToast, successToast } from "utils/wrapWithToast";
@@ -14,6 +14,7 @@ import { getFileUploaderMsg, isEmpty } from "src/utils";
 
 import EnsureAuth from "components/EnsureAuth";
 import { EnsureChain } from "components/EnsureChain";
+import MarkdownEditor from "components/MarkdownEditor";
 
 const StyledModal = styled(Modal)`
   position: absolute;
@@ -36,9 +37,12 @@ const StyledModal = styled(Modal)`
   gap: 16px;
 `;
 
-const StyledTextArea = styled(Textarea)`
+const EditorContainer = styled.div`
   width: 100%;
-  height: 200px;
+
+  [class*="contentEditable"] {
+    min-height: 200px;
+  }
 `;
 
 const StyledFileUploader = styled(FileUploader)`
@@ -93,12 +97,14 @@ const SubmitEvidenceModal: React.FC<{
   return (
     <StyledModal {...{ isOpen }} shouldCloseOnEsc shouldCloseOnOverlayClick onRequestClose={close}>
       <h1>Submit New Evidence</h1>
-      <StyledTextArea
-        dir="auto"
-        value={message}
-        onChange={(e) => setMessage(e.target.value)}
-        placeholder="Your Arguments"
-      />
+      <EditorContainer>
+        <MarkdownEditor
+          value={message}
+          onChange={setMessage}
+          placeholder="Describe your evidence in detail..."
+          showMessage={false}
+        />
+      </EditorContainer>
       <StyledFileUploader
         callback={(file: File) => setFile(file)}
         msg={getFileUploaderMsg(Roles.Evidence, roleRestrictions)}
diff --git a/web/src/pages/Cases/CaseDetails/Voting/Classic/Reveal.tsx b/web/src/pages/Cases/CaseDetails/Voting/Classic/Reveal.tsx
index 3bea21339..e95ee1bd3 100644
--- a/web/src/pages/Cases/CaseDetails/Voting/Classic/Reveal.tsx
+++ b/web/src/pages/Cases/CaseDetails/Voting/Classic/Reveal.tsx
@@ -20,8 +20,7 @@ import { useDisputeDetailsQuery } from "queries/useDisputeDetailsQuery";
 
 import { EnsureChain } from "components/EnsureChain";
 import InfoCard from "components/InfoCard";
-
-import JustificationArea from "../JustificationArea";
+import MarkdownEditor from "components/MarkdownEditor";
 
 const Container = styled.div`
   width: 100%;
@@ -114,7 +113,7 @@ const Reveal: React.FC<IReveal> = ({ arbitrable, voteIDs, setIsOpen, commit, isR
           <ReactMarkdownWrapper dir="auto">
             <ReactMarkdown>{disputeDetails?.question ?? ""}</ReactMarkdown>
           </ReactMarkdownWrapper>
-          <JustificationArea {...{ justification, setJustification }} />
+          <MarkdownEditor value={justification} onChange={setJustification} />
           <StyledEnsureChain>
             <StyledButton
               variant="secondary"
diff --git a/web/src/pages/Cases/CaseDetails/Voting/JustificationArea.tsx b/web/src/pages/Cases/CaseDetails/Voting/JustificationArea.tsx
deleted file mode 100644
index d92b036a1..000000000
--- a/web/src/pages/Cases/CaseDetails/Voting/JustificationArea.tsx
+++ /dev/null
@@ -1,37 +0,0 @@
-import React from "react";
-import styled from "styled-components";
-
-import { Textarea } from "@kleros/ui-components-library";
-
-const StyledTextarea = styled(Textarea)`
-  width: 100%;
-  height: auto;
-  textarea {
-    height: 200px;
-    border-color: ${({ theme }) => theme.stroke};
-  }
-  small {
-    font-weight: 400;
-    hyphens: auto;
-  }
-`;
-
-interface IJustificationArea {
-  justification: string;
-  setJustification: (arg0: string) => void;
-}
-
-const JustificationArea: React.FC<IJustificationArea> = ({ justification, setJustification }) => (
-  <StyledTextarea
-    dir="auto"
-    value={justification}
-    onChange={(e) => setJustification(e.target.value)}
-    placeholder="Justify your vote..."
-    message={
-      "A good justification contributes to case comprehension. " + "Low quality justifications can be challenged."
-    }
-    variant="info"
-  />
-);
-
-export default JustificationArea;
diff --git a/web/src/pages/Cases/CaseDetails/Voting/OptionsContainer.tsx b/web/src/pages/Cases/CaseDetails/Voting/OptionsContainer.tsx
index f58d132b0..2e8a5ecf1 100644
--- a/web/src/pages/Cases/CaseDetails/Voting/OptionsContainer.tsx
+++ b/web/src/pages/Cases/CaseDetails/Voting/OptionsContainer.tsx
@@ -4,16 +4,15 @@ import styled from "styled-components";
 import ReactMarkdown from "react-markdown";
 import { useParams } from "react-router-dom";
 
+import { Answer } from "@kleros/kleros-sdk";
+import { RefuseToArbitrateAnswer } from "@kleros/kleros-sdk/src/dataMappings/utils/disputeDetailsSchema";
 import { Button, Tooltip } from "@kleros/ui-components-library";
 
 import { usePopulatedDisputeData } from "hooks/queries/usePopulatedDisputeData";
 import { isUndefined } from "utils/index";
 
 import { EnsureChain } from "components/EnsureChain";
-
-import JustificationArea from "./JustificationArea";
-import { Answer } from "@kleros/kleros-sdk";
-import { RefuseToArbitrateAnswer } from "@kleros/kleros-sdk/src/dataMappings/utils/disputeDetailsSchema";
+import MarkdownEditor from "components/MarkdownEditor";
 
 const MainContainer = styled.div`
   width: 100%;
@@ -87,7 +86,7 @@ const Options: React.FC<IOptions> = ({ arbitrable, handleSelection, justificatio
       <MainContainer dir="auto">
         <ReactMarkdown>{disputeDetails?.question ?? ""}</ReactMarkdown>
         {!isUndefined(justification) && !isUndefined(setJustification) ? (
-          <JustificationArea {...{ justification, setJustification }} />
+          <MarkdownEditor value={justification} onChange={setJustification} />
         ) : null}
         {isUndefined(disputeDetails?.answers) ? null : (
           <StyledEnsureChain>
diff --git a/web/src/pages/Cases/CaseDetails/Voting/VotesDetails/index.tsx b/web/src/pages/Cases/CaseDetails/Voting/VotesDetails/index.tsx
index 7396d610e..d380be531 100644
--- a/web/src/pages/Cases/CaseDetails/Voting/VotesDetails/index.tsx
+++ b/web/src/pages/Cases/CaseDetails/Voting/VotesDetails/index.tsx
@@ -14,6 +14,7 @@ import { landscapeStyle } from "styles/landscapeStyle";
 
 import { ExternalLink } from "components/ExternalLink";
 import InfoCard from "components/InfoCard";
+import MarkdownRenderer from "components/MarkdownRenderer";
 
 import AccordionTitle from "./AccordionTitle";
 
@@ -84,10 +85,13 @@ const VotedText = styled.label`
   }
 `;
 
-const JustificationText = styled(VotedText)`
+const JustificationContainer = styled.div`
   line-height: 1.25;
-  ::before {
+
+  &::before {
     content: "Justification: ";
+    color: ${({ theme }) => theme.primaryText};
+    font-size: 16px;
   }
 `;
 
@@ -117,7 +121,9 @@ const AccordionContent: React.FC<{
       {!isUndefined(choice) && <VotedText dir="auto">{getVoteChoice(choice, answers)}</VotedText>}
 
       {justification ? (
-        <JustificationText dir="auto">{justification}</JustificationText>
+        <JustificationContainer dir="auto">
+          <MarkdownRenderer content={justification} />
+        </JustificationContainer>
       ) : (
         <SecondaryTextLabel>No justification provided</SecondaryTextLabel>
       )}
diff --git a/yarn.lock b/yarn.lock
index c2cb4f2d5..ebb0d8076 100644
--- a/yarn.lock
+++ b/yarn.lock
@@ -1811,6 +1811,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@babel/runtime@npm:^7.14.8":
+  version: 7.28.4
+  resolution: "@babel/runtime@npm:7.28.4"
+  checksum: 10/6c9a70452322ea80b3c9b2a412bcf60771819213a67576c8cec41e88a95bb7bf01fc983754cda35dc19603eef52df22203ccbf7777b9d6316932f9fb77c25163
+  languageName: node
+  linkType: hard
+
 "@babel/runtime@npm:^7.26.10":
   version: 7.27.0
   resolution: "@babel/runtime@npm:7.27.0"
@@ -2271,6 +2278,18 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@codemirror/autocomplete@npm:^6.0.0, @codemirror/autocomplete@npm:^6.3.2, @codemirror/autocomplete@npm:^6.4.0, @codemirror/autocomplete@npm:^6.7.1":
+  version: 6.18.7
+  resolution: "@codemirror/autocomplete@npm:6.18.7"
+  dependencies:
+    "@codemirror/language": "npm:^6.0.0"
+    "@codemirror/state": "npm:^6.0.0"
+    "@codemirror/view": "npm:^6.17.0"
+    "@lezer/common": "npm:^1.0.0"
+  checksum: 10/e50e3345d7d33e762d9abd2e6b1ea4ff54afe1630310464a5ddb42cab52fd5bac783ec0dc8a328cb746be6a7f9f711b6fcd8ef311af123511e8307b4c056cb9d
+  languageName: node
+  linkType: hard
+
 "@codemirror/autocomplete@npm:^6.18.1":
   version: 6.18.6
   resolution: "@codemirror/autocomplete@npm:6.18.6"
@@ -2283,7 +2302,7 @@ __metadata:
   languageName: node
   linkType: hard
 
-"@codemirror/commands@npm:^6.7.1":
+"@codemirror/commands@npm:^6.0.0, @codemirror/commands@npm:^6.1.3, @codemirror/commands@npm:^6.2.4, @codemirror/commands@npm:^6.7.1":
   version: 6.8.1
   resolution: "@codemirror/commands@npm:6.8.1"
   dependencies:
@@ -2295,6 +2314,108 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@codemirror/lang-angular@npm:^0.1.0":
+  version: 0.1.4
+  resolution: "@codemirror/lang-angular@npm:0.1.4"
+  dependencies:
+    "@codemirror/lang-html": "npm:^6.0.0"
+    "@codemirror/lang-javascript": "npm:^6.1.2"
+    "@codemirror/language": "npm:^6.0.0"
+    "@lezer/common": "npm:^1.2.0"
+    "@lezer/highlight": "npm:^1.0.0"
+    "@lezer/lr": "npm:^1.3.3"
+  checksum: 10/94f8e03a7636918a74cb18cb695538b8609732c0c39ac255b822dfd06cc55238bc488146e16b9f051e88949208e032045882f1feabac78e2968d2890056b08c7
+  languageName: node
+  linkType: hard
+
+"@codemirror/lang-cpp@npm:^6.0.0":
+  version: 6.0.3
+  resolution: "@codemirror/lang-cpp@npm:6.0.3"
+  dependencies:
+    "@codemirror/language": "npm:^6.0.0"
+    "@lezer/cpp": "npm:^1.0.0"
+  checksum: 10/982b9a9624367a0086520e1d499b7ad2fba2a14bdd57df88520bac279bd980e12154fd281659226fbcfa530edb5dd72edd114481365e6224bf53e97bc972f3b8
+  languageName: node
+  linkType: hard
+
+"@codemirror/lang-css@npm:^6.0.0, @codemirror/lang-css@npm:^6.0.1, @codemirror/lang-css@npm:^6.2.0":
+  version: 6.3.1
+  resolution: "@codemirror/lang-css@npm:6.3.1"
+  dependencies:
+    "@codemirror/autocomplete": "npm:^6.0.0"
+    "@codemirror/language": "npm:^6.0.0"
+    "@codemirror/state": "npm:^6.0.0"
+    "@lezer/common": "npm:^1.0.2"
+    "@lezer/css": "npm:^1.1.7"
+  checksum: 10/709994b0a787fe06ebac7a47c6a6a92c9680fe2b4479bbe2a72b27ad4d863953ad64a61b36f15098d00bd9a655bc9b3a3ecf2877354351ff873a01186fb38386
+  languageName: node
+  linkType: hard
+
+"@codemirror/lang-go@npm:^6.0.0":
+  version: 6.0.1
+  resolution: "@codemirror/lang-go@npm:6.0.1"
+  dependencies:
+    "@codemirror/autocomplete": "npm:^6.0.0"
+    "@codemirror/language": "npm:^6.6.0"
+    "@codemirror/state": "npm:^6.0.0"
+    "@lezer/common": "npm:^1.0.0"
+    "@lezer/go": "npm:^1.0.0"
+  checksum: 10/6e361bddb35683b225e1367807f598044b861c6858c9a011227fb73a872735985141746b3c410dcd8ef11b4c0e54819e720c5e663201a6a5e69ba8a9519fa287
+  languageName: node
+  linkType: hard
+
+"@codemirror/lang-html@npm:^6.0.0, @codemirror/lang-html@npm:^6.4.0":
+  version: 6.4.10
+  resolution: "@codemirror/lang-html@npm:6.4.10"
+  dependencies:
+    "@codemirror/autocomplete": "npm:^6.0.0"
+    "@codemirror/lang-css": "npm:^6.0.0"
+    "@codemirror/lang-javascript": "npm:^6.0.0"
+    "@codemirror/language": "npm:^6.4.0"
+    "@codemirror/state": "npm:^6.0.0"
+    "@codemirror/view": "npm:^6.17.0"
+    "@lezer/common": "npm:^1.0.0"
+    "@lezer/css": "npm:^1.1.0"
+    "@lezer/html": "npm:^1.3.0"
+  checksum: 10/258ba6f90dee9fb7cefe32926b59cc4a9223b8c7bac8fea14518daa5195cffb8383efac2102f7769c50c45d0d93c17c67cdcebaea43c81511b61447f743ffc2d
+  languageName: node
+  linkType: hard
+
+"@codemirror/lang-java@npm:^6.0.0":
+  version: 6.0.2
+  resolution: "@codemirror/lang-java@npm:6.0.2"
+  dependencies:
+    "@codemirror/language": "npm:^6.0.0"
+    "@lezer/java": "npm:^1.0.0"
+  checksum: 10/ed884f5e1a90c0d487bc4e5073c6154f3abf51b0b652c3d015e8cb322e171a38307427a85ecc16d5be82bd3243577e77e202325d84394a9c5ac356ee358c56c9
+  languageName: node
+  linkType: hard
+
+"@codemirror/lang-javascript@npm:^6.0.0, @codemirror/lang-javascript@npm:^6.1.2":
+  version: 6.2.4
+  resolution: "@codemirror/lang-javascript@npm:6.2.4"
+  dependencies:
+    "@codemirror/autocomplete": "npm:^6.0.0"
+    "@codemirror/language": "npm:^6.6.0"
+    "@codemirror/lint": "npm:^6.0.0"
+    "@codemirror/state": "npm:^6.0.0"
+    "@codemirror/view": "npm:^6.17.0"
+    "@lezer/common": "npm:^1.0.0"
+    "@lezer/javascript": "npm:^1.0.0"
+  checksum: 10/7d0b7fdacc90f89d1a5f2b9c575c61b6ee7813005cde32c1f35aedb0da71ad298998e116126ba19ca0bb02cdb14064945c31e24c57ef60bcbd5c19dae955ccb6
+  languageName: node
+  linkType: hard
+
+"@codemirror/lang-json@npm:^6.0.0":
+  version: 6.0.2
+  resolution: "@codemirror/lang-json@npm:6.0.2"
+  dependencies:
+    "@codemirror/language": "npm:^6.0.0"
+    "@lezer/json": "npm:^1.0.0"
+  checksum: 10/a8e57ad5c6cc53edd0d8bce4c26fa189dd5a95c371e72d32957d4a5c857f814761d9dfab81361f8e8ae9da7bcf657e7e1343f39694f9cffb1c144dd3ef7092a0
+  languageName: node
+  linkType: hard
+
 "@codemirror/lang-json@npm:^6.0.1":
   version: 6.0.1
   resolution: "@codemirror/lang-json@npm:6.0.1"
@@ -2305,6 +2426,198 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@codemirror/lang-less@npm:^6.0.0":
+  version: 6.0.2
+  resolution: "@codemirror/lang-less@npm:6.0.2"
+  dependencies:
+    "@codemirror/lang-css": "npm:^6.2.0"
+    "@codemirror/language": "npm:^6.0.0"
+    "@lezer/common": "npm:^1.2.0"
+    "@lezer/highlight": "npm:^1.0.0"
+    "@lezer/lr": "npm:^1.0.0"
+  checksum: 10/233aa03e0bfb57e4f23fdb2a8d52ad3143a52553895b97cb2901f66d59fc40246b525a21b7be72d873efa98783f6da5f4e8e042da442b092fab9eb63c69524c8
+  languageName: node
+  linkType: hard
+
+"@codemirror/lang-liquid@npm:^6.0.0":
+  version: 6.3.0
+  resolution: "@codemirror/lang-liquid@npm:6.3.0"
+  dependencies:
+    "@codemirror/autocomplete": "npm:^6.0.0"
+    "@codemirror/lang-html": "npm:^6.0.0"
+    "@codemirror/language": "npm:^6.0.0"
+    "@codemirror/state": "npm:^6.0.0"
+    "@codemirror/view": "npm:^6.0.0"
+    "@lezer/common": "npm:^1.0.0"
+    "@lezer/highlight": "npm:^1.0.0"
+    "@lezer/lr": "npm:^1.3.1"
+  checksum: 10/da6bd8108598db397bb11fe13e81b0517cf63181d8e3f10d7e7c7775cbe0c32e3babd1d0c96e96640952c94e9dc4c0d0242dce1acc445b837044c7d5dcf17729
+  languageName: node
+  linkType: hard
+
+"@codemirror/lang-markdown@npm:^6.0.0, @codemirror/lang-markdown@npm:^6.2.3":
+  version: 6.3.4
+  resolution: "@codemirror/lang-markdown@npm:6.3.4"
+  dependencies:
+    "@codemirror/autocomplete": "npm:^6.7.1"
+    "@codemirror/lang-html": "npm:^6.0.0"
+    "@codemirror/language": "npm:^6.3.0"
+    "@codemirror/state": "npm:^6.0.0"
+    "@codemirror/view": "npm:^6.0.0"
+    "@lezer/common": "npm:^1.2.1"
+    "@lezer/markdown": "npm:^1.0.0"
+  checksum: 10/8e23721a6c113cd56eca183a1089a01b19ad8cfe16b0604c0d9d825f285e2a3dc8de18a763c6a1aaf37947a890fc3ddd3cac3d25e912a506d310e4a01ceb8ab0
+  languageName: node
+  linkType: hard
+
+"@codemirror/lang-php@npm:^6.0.0":
+  version: 6.0.2
+  resolution: "@codemirror/lang-php@npm:6.0.2"
+  dependencies:
+    "@codemirror/lang-html": "npm:^6.0.0"
+    "@codemirror/language": "npm:^6.0.0"
+    "@codemirror/state": "npm:^6.0.0"
+    "@lezer/common": "npm:^1.0.0"
+    "@lezer/php": "npm:^1.0.0"
+  checksum: 10/ae697fa8101f034244467ffc812a0de9c944bab1b141da2c55a4a80e5cedfd2fcbe9d1dcd36d4d3593ff9fb8e1963d7c3fb4fa307d652a73aa7607322aec1ce7
+  languageName: node
+  linkType: hard
+
+"@codemirror/lang-python@npm:^6.0.0":
+  version: 6.2.1
+  resolution: "@codemirror/lang-python@npm:6.2.1"
+  dependencies:
+    "@codemirror/autocomplete": "npm:^6.3.2"
+    "@codemirror/language": "npm:^6.8.0"
+    "@codemirror/state": "npm:^6.0.0"
+    "@lezer/common": "npm:^1.2.1"
+    "@lezer/python": "npm:^1.1.4"
+  checksum: 10/8651972fcfc194c0da028bea0162eb070f8f9b6241a9ec7771b3061bd7f3c4122ca0eed2e5fcf4c46e731cb31d4af1fb7f1d2949387ba9133826aa0253a9dddb
+  languageName: node
+  linkType: hard
+
+"@codemirror/lang-rust@npm:^6.0.0":
+  version: 6.0.2
+  resolution: "@codemirror/lang-rust@npm:6.0.2"
+  dependencies:
+    "@codemirror/language": "npm:^6.0.0"
+    "@lezer/rust": "npm:^1.0.0"
+  checksum: 10/4cb7528c723ec3f421bd82a5324c56d836f3675e3b28e2b2d3c9d251e8f206bf9d932d52696c310dca51d71644063441fb8330d5ad1278c68002f8598b4bc067
+  languageName: node
+  linkType: hard
+
+"@codemirror/lang-sass@npm:^6.0.0":
+  version: 6.0.2
+  resolution: "@codemirror/lang-sass@npm:6.0.2"
+  dependencies:
+    "@codemirror/lang-css": "npm:^6.2.0"
+    "@codemirror/language": "npm:^6.0.0"
+    "@codemirror/state": "npm:^6.0.0"
+    "@lezer/common": "npm:^1.0.2"
+    "@lezer/sass": "npm:^1.0.0"
+  checksum: 10/de5c72f62714960961b616c8fe25b4f127906b0c05ec2e8e633d0b896fb2da979732cad0f51b1c0bc058494db5447664234b7910a3345fb5080d8222d4011818
+  languageName: node
+  linkType: hard
+
+"@codemirror/lang-sql@npm:^6.0.0":
+  version: 6.9.1
+  resolution: "@codemirror/lang-sql@npm:6.9.1"
+  dependencies:
+    "@codemirror/autocomplete": "npm:^6.0.0"
+    "@codemirror/language": "npm:^6.0.0"
+    "@codemirror/state": "npm:^6.0.0"
+    "@lezer/common": "npm:^1.2.0"
+    "@lezer/highlight": "npm:^1.0.0"
+    "@lezer/lr": "npm:^1.0.0"
+  checksum: 10/2fa0f61d8253f9dd28c255fa13ac27181fd42782160aeadfb72fdded426820c2ca49cf5057cfa92fc1016318bdf1008d0c33e23522f555ed802694ae73f3a137
+  languageName: node
+  linkType: hard
+
+"@codemirror/lang-vue@npm:^0.1.1":
+  version: 0.1.3
+  resolution: "@codemirror/lang-vue@npm:0.1.3"
+  dependencies:
+    "@codemirror/lang-html": "npm:^6.0.0"
+    "@codemirror/lang-javascript": "npm:^6.1.2"
+    "@codemirror/language": "npm:^6.0.0"
+    "@lezer/common": "npm:^1.2.0"
+    "@lezer/highlight": "npm:^1.0.0"
+    "@lezer/lr": "npm:^1.3.1"
+  checksum: 10/f08c04c47671de0b65568cbc0f9e517c7c443bd097eb0ca63ecdc1b81f842dbfd0b81b208ee5c31e3293ebc377b4b271c89cf18bf04bb898ecac538df22aff3a
+  languageName: node
+  linkType: hard
+
+"@codemirror/lang-wast@npm:^6.0.0":
+  version: 6.0.2
+  resolution: "@codemirror/lang-wast@npm:6.0.2"
+  dependencies:
+    "@codemirror/language": "npm:^6.0.0"
+    "@lezer/common": "npm:^1.2.0"
+    "@lezer/highlight": "npm:^1.0.0"
+    "@lezer/lr": "npm:^1.0.0"
+  checksum: 10/c7f9820191ca8d8877b38a6205f7e46721c0deeb552c3f234a7166bfd4581e071718cbf395749f271bd5c0da879285a7829a5843c052dd52e8a4e41509777e35
+  languageName: node
+  linkType: hard
+
+"@codemirror/lang-xml@npm:^6.0.0":
+  version: 6.1.0
+  resolution: "@codemirror/lang-xml@npm:6.1.0"
+  dependencies:
+    "@codemirror/autocomplete": "npm:^6.0.0"
+    "@codemirror/language": "npm:^6.4.0"
+    "@codemirror/state": "npm:^6.0.0"
+    "@codemirror/view": "npm:^6.0.0"
+    "@lezer/common": "npm:^1.0.0"
+    "@lezer/xml": "npm:^1.0.0"
+  checksum: 10/f5e54668c30efbb8a78a51e49ccec92a06931f2b98dce35c90be94ded30da02dac525124ce3c40f65c7b071f8db72d16b10a5a1795ccbf10e69939c0a9c1cac8
+  languageName: node
+  linkType: hard
+
+"@codemirror/lang-yaml@npm:^6.0.0":
+  version: 6.1.2
+  resolution: "@codemirror/lang-yaml@npm:6.1.2"
+  dependencies:
+    "@codemirror/autocomplete": "npm:^6.0.0"
+    "@codemirror/language": "npm:^6.0.0"
+    "@codemirror/state": "npm:^6.0.0"
+    "@lezer/common": "npm:^1.2.0"
+    "@lezer/highlight": "npm:^1.2.0"
+    "@lezer/lr": "npm:^1.0.0"
+    "@lezer/yaml": "npm:^1.0.0"
+  checksum: 10/1a1ad16554b27d9f66ad2a342170e7c7e51781876280727790e763e9a770163772d4880a9c344705ca65acc2b5fb228962dc3281ba05a71d2c071515541258ae
+  languageName: node
+  linkType: hard
+
+"@codemirror/language-data@npm:^6.5.1":
+  version: 6.5.1
+  resolution: "@codemirror/language-data@npm:6.5.1"
+  dependencies:
+    "@codemirror/lang-angular": "npm:^0.1.0"
+    "@codemirror/lang-cpp": "npm:^6.0.0"
+    "@codemirror/lang-css": "npm:^6.0.0"
+    "@codemirror/lang-go": "npm:^6.0.0"
+    "@codemirror/lang-html": "npm:^6.0.0"
+    "@codemirror/lang-java": "npm:^6.0.0"
+    "@codemirror/lang-javascript": "npm:^6.0.0"
+    "@codemirror/lang-json": "npm:^6.0.0"
+    "@codemirror/lang-less": "npm:^6.0.0"
+    "@codemirror/lang-liquid": "npm:^6.0.0"
+    "@codemirror/lang-markdown": "npm:^6.0.0"
+    "@codemirror/lang-php": "npm:^6.0.0"
+    "@codemirror/lang-python": "npm:^6.0.0"
+    "@codemirror/lang-rust": "npm:^6.0.0"
+    "@codemirror/lang-sass": "npm:^6.0.0"
+    "@codemirror/lang-sql": "npm:^6.0.0"
+    "@codemirror/lang-vue": "npm:^0.1.1"
+    "@codemirror/lang-wast": "npm:^6.0.0"
+    "@codemirror/lang-xml": "npm:^6.0.0"
+    "@codemirror/lang-yaml": "npm:^6.0.0"
+    "@codemirror/language": "npm:^6.0.0"
+    "@codemirror/legacy-modes": "npm:^6.4.0"
+  checksum: 10/a46f4015da2c213ebe7cc685b5c657b92a340e3f12ed26a9f8c3a04cf3e46063c86141c6f9dca4faeaaf6de068b4e797d40c9a572ca317a122f84ad7ceb5e684
+  languageName: node
+  linkType: hard
+
 "@codemirror/language@npm:^6.0.0":
   version: 6.10.3
   resolution: "@codemirror/language@npm:6.10.3"
@@ -2333,7 +2646,30 @@ __metadata:
   languageName: node
   linkType: hard
 
-"@codemirror/lint@npm:^6.8.2":
+"@codemirror/language@npm:^6.3.0, @codemirror/language@npm:^6.3.2, @codemirror/language@npm:^6.4.0, @codemirror/language@npm:^6.6.0, @codemirror/language@npm:^6.8.0":
+  version: 6.11.3
+  resolution: "@codemirror/language@npm:6.11.3"
+  dependencies:
+    "@codemirror/state": "npm:^6.0.0"
+    "@codemirror/view": "npm:^6.23.0"
+    "@lezer/common": "npm:^1.1.0"
+    "@lezer/highlight": "npm:^1.0.0"
+    "@lezer/lr": "npm:^1.0.0"
+    style-mod: "npm:^4.0.0"
+  checksum: 10/8538a2835c1de6ca2d520ff66449185f2ea3a93e7d69382d9db3b4db6460f4c46b44f19724458c50230abfa87cf2c225834d39c3fe3119c48370db6b3de0b772
+  languageName: node
+  linkType: hard
+
+"@codemirror/legacy-modes@npm:^6.4.0":
+  version: 6.5.1
+  resolution: "@codemirror/legacy-modes@npm:6.5.1"
+  dependencies:
+    "@codemirror/language": "npm:^6.0.0"
+  checksum: 10/585de2a47a4ac10b3f96ef1616c849167cc6bae2a337a58a9a85c094cb95c4c27b8429c6bf2edf6a072946eb65b8169d090333003592c0b1ad0a51bc5a438c2a
+  languageName: node
+  linkType: hard
+
+"@codemirror/lint@npm:^6.0.0, @codemirror/lint@npm:^6.8.2":
   version: 6.8.5
   resolution: "@codemirror/lint@npm:6.8.5"
   dependencies:
@@ -2344,6 +2680,30 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@codemirror/merge@npm:^6.4.0":
+  version: 6.10.2
+  resolution: "@codemirror/merge@npm:6.10.2"
+  dependencies:
+    "@codemirror/language": "npm:^6.0.0"
+    "@codemirror/state": "npm:^6.0.0"
+    "@codemirror/view": "npm:^6.17.0"
+    "@lezer/highlight": "npm:^1.0.0"
+    style-mod: "npm:^4.1.0"
+  checksum: 10/b19b9fb4ae7dca94d87d7884c1ec7c33835b0a87081aa733deeb37c2930589222eb431f5a2e2c61f7d791ba2e73e002076480342790d0f64ab76033acb8ff98b
+  languageName: node
+  linkType: hard
+
+"@codemirror/search@npm:^6.0.0":
+  version: 6.5.11
+  resolution: "@codemirror/search@npm:6.5.11"
+  dependencies:
+    "@codemirror/state": "npm:^6.0.0"
+    "@codemirror/view": "npm:^6.0.0"
+    crelt: "npm:^1.0.5"
+  checksum: 10/d057f37cb369460b25625d7eb72f40636bf78ecd140608da53010cf3660f982a9e613826e38d85d87c9c2ff11e45c9482429987bfd4f29cbbd192f1ee3fd2695
+  languageName: node
+  linkType: hard
+
 "@codemirror/search@npm:^6.5.6":
   version: 6.5.7
   resolution: "@codemirror/search@npm:6.5.7"
@@ -2397,6 +2757,72 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@codemirror/view@npm:^6.7.1":
+  version: 6.38.2
+  resolution: "@codemirror/view@npm:6.38.2"
+  dependencies:
+    "@codemirror/state": "npm:^6.5.0"
+    crelt: "npm:^1.0.6"
+    style-mod: "npm:^4.1.0"
+    w3c-keyname: "npm:^2.2.4"
+  checksum: 10/300608850a29215d7b47fe8ade183fc2241457a924335bd127e29e1af11da9314369c65ec0da968177086f3529abbcd71a609c1af673ea8951c32a523cab358c
+  languageName: node
+  linkType: hard
+
+"@codesandbox/nodebox@npm:0.1.8":
+  version: 0.1.8
+  resolution: "@codesandbox/nodebox@npm:0.1.8"
+  dependencies:
+    outvariant: "npm:^1.4.0"
+    strict-event-emitter: "npm:^0.4.3"
+  checksum: 10/3de00d306ae0236524c436b8640c442a4541f0eb696820aa5f6fc66018dc66431d8d78edd9305986aa2877befca292a3906bb4c6af2ecba5f15dbd587d1c916d
+  languageName: node
+  linkType: hard
+
+"@codesandbox/sandpack-client@npm:^2.19.8":
+  version: 2.19.8
+  resolution: "@codesandbox/sandpack-client@npm:2.19.8"
+  dependencies:
+    "@codesandbox/nodebox": "npm:0.1.8"
+    buffer: "npm:^6.0.3"
+    dequal: "npm:^2.0.2"
+    mime-db: "npm:^1.52.0"
+    outvariant: "npm:1.4.0"
+    static-browser-server: "npm:1.0.3"
+  checksum: 10/7913fa4a7bbaf925f4ab0ad1969a4da1f52c093b1b71229dd8ecf3f50462bd004fcf3fddccdb15225b55737305d3f6727a187353f12cb39a75336fa7229eb4dd
+  languageName: node
+  linkType: hard
+
+"@codesandbox/sandpack-react@npm:^2.20.0":
+  version: 2.20.0
+  resolution: "@codesandbox/sandpack-react@npm:2.20.0"
+  dependencies:
+    "@codemirror/autocomplete": "npm:^6.4.0"
+    "@codemirror/commands": "npm:^6.1.3"
+    "@codemirror/lang-css": "npm:^6.0.1"
+    "@codemirror/lang-html": "npm:^6.4.0"
+    "@codemirror/lang-javascript": "npm:^6.1.2"
+    "@codemirror/language": "npm:^6.3.2"
+    "@codemirror/state": "npm:^6.2.0"
+    "@codemirror/view": "npm:^6.7.1"
+    "@codesandbox/sandpack-client": "npm:^2.19.8"
+    "@lezer/highlight": "npm:^1.1.3"
+    "@react-hook/intersection-observer": "npm:^3.1.1"
+    "@stitches/core": "npm:^1.2.6"
+    anser: "npm:^2.1.1"
+    clean-set: "npm:^1.1.2"
+    dequal: "npm:^2.0.2"
+    escape-carriage: "npm:^1.3.1"
+    lz-string: "npm:^1.4.4"
+    react-devtools-inline: "npm:4.4.0"
+    react-is: "npm:^17.0.2"
+  peerDependencies:
+    react: ^16.8.0 || ^17 || ^18 || ^19
+    react-dom: ^16.8.0 || ^17 || ^18 || ^19
+  checksum: 10/313c937dacaafcc18622f54a274835aa3a444ff697e9e511c52d548d7ba4e233d19ef8bb1da081668251020bd9afd480641194032504b4b3d20ac3cb0cbcd03b
+  languageName: node
+  linkType: hard
+
 "@coinbase/wallet-sdk@npm:4.3.0":
   version: 4.3.0
   resolution: "@coinbase/wallet-sdk@npm:4.3.0"
@@ -4583,6 +5009,58 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@floating-ui/core@npm:^1.7.3":
+  version: 1.7.3
+  resolution: "@floating-ui/core@npm:1.7.3"
+  dependencies:
+    "@floating-ui/utils": "npm:^0.2.10"
+  checksum: 10/a8952ff2673ddf28f12feeb86d90c54949e45bcb1af5758b7672850ac0dadb36d4bd61aa45dad1b6a35ba40d4756d3573afac6610b90502639d7266b91e0864e
+  languageName: node
+  linkType: hard
+
+"@floating-ui/dom@npm:^1.7.4":
+  version: 1.7.4
+  resolution: "@floating-ui/dom@npm:1.7.4"
+  dependencies:
+    "@floating-ui/core": "npm:^1.7.3"
+    "@floating-ui/utils": "npm:^0.2.10"
+  checksum: 10/d3d6a23e7b9804ba56338c7c666590258683af14b6026270d32afc1202f72b5b82cca359004bdc7830bf2463a045da6c7bd4e7d5351218cf270ff94206197971
+  languageName: node
+  linkType: hard
+
+"@floating-ui/react-dom@npm:^2.0.0, @floating-ui/react-dom@npm:^2.1.6":
+  version: 2.1.6
+  resolution: "@floating-ui/react-dom@npm:2.1.6"
+  dependencies:
+    "@floating-ui/dom": "npm:^1.7.4"
+  peerDependencies:
+    react: ">=16.8.0"
+    react-dom: ">=16.8.0"
+  checksum: 10/fbfd3319b42edb9c156e4e872f500d2edb112bc9cfd1b45892bff16ccf21c2484ddc9c416f7631c2aaaadec1b2f98b205db8a3f89eb78ca870905fcfe3917c35
+  languageName: node
+  linkType: hard
+
+"@floating-ui/react@npm:^0.27.8":
+  version: 0.27.16
+  resolution: "@floating-ui/react@npm:0.27.16"
+  dependencies:
+    "@floating-ui/react-dom": "npm:^2.1.6"
+    "@floating-ui/utils": "npm:^0.2.10"
+    tabbable: "npm:^6.0.0"
+  peerDependencies:
+    react: ">=17.0.0"
+    react-dom: ">=17.0.0"
+  checksum: 10/b9baedee124035323a8f74794ec782678faf52af1c88731ce7d2641b7e7c97748fda1e711a3c4db007a0153d93158d867f4726ee632d713d3de76ec4bdfd84e1
+  languageName: node
+  linkType: hard
+
+"@floating-ui/utils@npm:^0.2.10":
+  version: 0.2.10
+  resolution: "@floating-ui/utils@npm:0.2.10"
+  checksum: 10/b635ea865a8be2484b608b7157f5abf9ed439f351011a74b7e988439e2898199a9a8b790f52291e05bdcf119088160dc782d98cff45cc98c5a271bc6f51327ae
+  languageName: node
+  linkType: hard
+
 "@fortawesome/fontawesome-common-types@npm:6.7.2":
   version: 6.7.2
   resolution: "@fortawesome/fontawesome-common-types@npm:6.7.2"
@@ -6313,6 +6791,7 @@ __metadata:
     "@kleros/ui-components-library": "npm:^2.20.0"
     "@lifi/wallet-management": "npm:^3.7.1"
     "@lifi/widget": "npm:^3.18.1"
+    "@mdxeditor/editor": "npm:^3.44.2"
     "@reown/appkit": "npm:^1.7.1"
     "@reown/appkit-adapter-wagmi": "npm:^1.7.1"
     "@sentry/react": "npm:^7.120.0"
@@ -6416,23 +6895,315 @@ __metadata:
   languageName: node
   linkType: hard
 
-"@lezer/common@npm:^1.0.0, @lezer/common@npm:^1.1.0, @lezer/common@npm:^1.2.0":
-  version: 1.2.1
-  resolution: "@lezer/common@npm:1.2.1"
-  checksum: 10/b362ed2e97664e4b36b3dbff49b52d1bfc5accc0152b577fefd46e585d012ff685d1fd336d75d80066e01c0505b1135d4cf69be5e330b5bfec2e2650c437bcae
+"@lexical/clipboard@npm:0.35.0, @lexical/clipboard@npm:^0.35.0":
+  version: 0.35.0
+  resolution: "@lexical/clipboard@npm:0.35.0"
+  dependencies:
+    "@lexical/html": "npm:0.35.0"
+    "@lexical/list": "npm:0.35.0"
+    "@lexical/selection": "npm:0.35.0"
+    "@lexical/utils": "npm:0.35.0"
+    lexical: "npm:0.35.0"
+  checksum: 10/acde7547e5ad3ffa60f339a697952e3dc785c90f638bcd0e996221174a09209d584ac22ae6fe3f92814cd1cf4991546d82ce6d401ccc2084b4f0aac8b480bb88
   languageName: node
   linkType: hard
 
-"@lezer/highlight@npm:^1.0.0":
-  version: 1.2.0
-  resolution: "@lezer/highlight@npm:1.2.0"
+"@lexical/code@npm:0.35.0":
+  version: 0.35.0
+  resolution: "@lexical/code@npm:0.35.0"
+  dependencies:
+    "@lexical/utils": "npm:0.35.0"
+    lexical: "npm:0.35.0"
+    prismjs: "npm:^1.30.0"
+  checksum: 10/4eea3cd640b33af2971d1e6ea893046b93c686873fa450c442837a03277b31c217a37e17d115be5e6ea8a1a9fe3a00df495403918b9fff68aef873f66413def1
+  languageName: node
+  linkType: hard
+
+"@lexical/devtools-core@npm:0.35.0":
+  version: 0.35.0
+  resolution: "@lexical/devtools-core@npm:0.35.0"
+  dependencies:
+    "@lexical/html": "npm:0.35.0"
+    "@lexical/link": "npm:0.35.0"
+    "@lexical/mark": "npm:0.35.0"
+    "@lexical/table": "npm:0.35.0"
+    "@lexical/utils": "npm:0.35.0"
+    lexical: "npm:0.35.0"
+  peerDependencies:
+    react: ">=17.x"
+    react-dom: ">=17.x"
+  checksum: 10/d14ef05df4c7b0ec67b8da820904db695747548e45064e2bd8af25c42b44b4d5835964402b1830396587acdd79a43e98224c650193bc04798225815ca273c580
+  languageName: node
+  linkType: hard
+
+"@lexical/dragon@npm:0.35.0":
+  version: 0.35.0
+  resolution: "@lexical/dragon@npm:0.35.0"
+  dependencies:
+    lexical: "npm:0.35.0"
+  checksum: 10/6c89b2c79e1aa59188d01561a59107f3816f31587e21be38f98a8508f2f4caeabf4fd54acc6aca42b27ee4ad49ce44d952f517a0bac25d9e7c1411db375b6698
+  languageName: node
+  linkType: hard
+
+"@lexical/hashtag@npm:0.35.0":
+  version: 0.35.0
+  resolution: "@lexical/hashtag@npm:0.35.0"
+  dependencies:
+    "@lexical/utils": "npm:0.35.0"
+    lexical: "npm:0.35.0"
+  checksum: 10/ed12a1b61ad05bc7288beb5a3e89fb88e55f7710c2ba22c27aea7e26078756e8c2d69f32856bb5dca64f383dd47b028206b0d36d8ffc7ec979b8ed23df8b32fb
+  languageName: node
+  linkType: hard
+
+"@lexical/history@npm:0.35.0":
+  version: 0.35.0
+  resolution: "@lexical/history@npm:0.35.0"
+  dependencies:
+    "@lexical/utils": "npm:0.35.0"
+    lexical: "npm:0.35.0"
+  checksum: 10/7cecef8407a7cdd478c82d9314aecbaa7fef8bc9c6993bfbad7edc80658a35c1b7061132c9d876edafdd066dd40b6a2ca1bdba5eda05bed2f22729356e7bdc15
+  languageName: node
+  linkType: hard
+
+"@lexical/html@npm:0.35.0":
+  version: 0.35.0
+  resolution: "@lexical/html@npm:0.35.0"
+  dependencies:
+    "@lexical/selection": "npm:0.35.0"
+    "@lexical/utils": "npm:0.35.0"
+    lexical: "npm:0.35.0"
+  checksum: 10/458beee56f4ea157d8bb56b1f8c74fe58da87b6b5a64e666f7356247f7cf62e9fab643f4c3d84f1043539c1c3165be604bbf30bc8d002443d067801a32ef8cac
+  languageName: node
+  linkType: hard
+
+"@lexical/link@npm:0.35.0, @lexical/link@npm:^0.35.0":
+  version: 0.35.0
+  resolution: "@lexical/link@npm:0.35.0"
+  dependencies:
+    "@lexical/utils": "npm:0.35.0"
+    lexical: "npm:0.35.0"
+  checksum: 10/670ae6d2b24b56bcefacb2fd6159c17bf07a6bd2fe84e3f5a6a002cab4359c90f2e1478284bca108650be9f9c52d070d0a3a09601fc6682cb834e7119633a026
+  languageName: node
+  linkType: hard
+
+"@lexical/list@npm:0.35.0, @lexical/list@npm:^0.35.0":
+  version: 0.35.0
+  resolution: "@lexical/list@npm:0.35.0"
+  dependencies:
+    "@lexical/selection": "npm:0.35.0"
+    "@lexical/utils": "npm:0.35.0"
+    lexical: "npm:0.35.0"
+  checksum: 10/8ad774ffc041cb6d2277cc160e1f04ef0cbcfee1b74dc9888c316ebf00675c68c583961993a2a3ea506674f947896adc6c2d07fa7512eedfb1caa6009b8f3af4
+  languageName: node
+  linkType: hard
+
+"@lexical/mark@npm:0.35.0":
+  version: 0.35.0
+  resolution: "@lexical/mark@npm:0.35.0"
+  dependencies:
+    "@lexical/utils": "npm:0.35.0"
+    lexical: "npm:0.35.0"
+  checksum: 10/e20244127316f03d0383dd3f3762d5d3daf904aeab28a49b54c826210ef03077ee9004304bba643735b0bc451c93f95b085b8ab2a62d8382e40636868f6acc91
+  languageName: node
+  linkType: hard
+
+"@lexical/markdown@npm:0.35.0, @lexical/markdown@npm:^0.35.0":
+  version: 0.35.0
+  resolution: "@lexical/markdown@npm:0.35.0"
+  dependencies:
+    "@lexical/code": "npm:0.35.0"
+    "@lexical/link": "npm:0.35.0"
+    "@lexical/list": "npm:0.35.0"
+    "@lexical/rich-text": "npm:0.35.0"
+    "@lexical/text": "npm:0.35.0"
+    "@lexical/utils": "npm:0.35.0"
+    lexical: "npm:0.35.0"
+  checksum: 10/79a72aa37cc66ab8878a594cc74251b0755ead239364194177c9f34ac4eaa1c3864bbd11d19733771bdb92bbf6a5a764bda43e4f182838d54666724b0a1db7d0
+  languageName: node
+  linkType: hard
+
+"@lexical/offset@npm:0.35.0":
+  version: 0.35.0
+  resolution: "@lexical/offset@npm:0.35.0"
+  dependencies:
+    lexical: "npm:0.35.0"
+  checksum: 10/588bf20540e69138cd30a441a374d6248b97a618026c3afe1d3e75a45cb47623d8010faa86491ed3bbdd57f0ae95f39372fbfb406fb7b97d663ee029b8028590
+  languageName: node
+  linkType: hard
+
+"@lexical/overflow@npm:0.35.0":
+  version: 0.35.0
+  resolution: "@lexical/overflow@npm:0.35.0"
+  dependencies:
+    lexical: "npm:0.35.0"
+  checksum: 10/05b0700d96d3a43614278fa11a3834881a1c37d4904c5731b59cc3483bffe558b6e307e2363067c59457e16776756ebb792912f3eb1c9896b5755b30eb2843a4
+  languageName: node
+  linkType: hard
+
+"@lexical/plain-text@npm:0.35.0, @lexical/plain-text@npm:^0.35.0":
+  version: 0.35.0
+  resolution: "@lexical/plain-text@npm:0.35.0"
+  dependencies:
+    "@lexical/clipboard": "npm:0.35.0"
+    "@lexical/selection": "npm:0.35.0"
+    "@lexical/utils": "npm:0.35.0"
+    lexical: "npm:0.35.0"
+  checksum: 10/2dfa06123fc93a41fa8c53f87e162f04e92fa38db5107c4680ff80049a1b7fc3516252fd993163235cc58a5f007d374642aaa5cb039269e31c0eb73b5c708670
+  languageName: node
+  linkType: hard
+
+"@lexical/react@npm:^0.35.0":
+  version: 0.35.0
+  resolution: "@lexical/react@npm:0.35.0"
+  dependencies:
+    "@floating-ui/react": "npm:^0.27.8"
+    "@lexical/devtools-core": "npm:0.35.0"
+    "@lexical/dragon": "npm:0.35.0"
+    "@lexical/hashtag": "npm:0.35.0"
+    "@lexical/history": "npm:0.35.0"
+    "@lexical/link": "npm:0.35.0"
+    "@lexical/list": "npm:0.35.0"
+    "@lexical/mark": "npm:0.35.0"
+    "@lexical/markdown": "npm:0.35.0"
+    "@lexical/overflow": "npm:0.35.0"
+    "@lexical/plain-text": "npm:0.35.0"
+    "@lexical/rich-text": "npm:0.35.0"
+    "@lexical/table": "npm:0.35.0"
+    "@lexical/text": "npm:0.35.0"
+    "@lexical/utils": "npm:0.35.0"
+    "@lexical/yjs": "npm:0.35.0"
+    lexical: "npm:0.35.0"
+    react-error-boundary: "npm:^3.1.4"
+  peerDependencies:
+    react: ">=17.x"
+    react-dom: ">=17.x"
+  checksum: 10/a1a9a174c12b2df338355fab6a7d8995f3ef082c11fd7f6eaea728885c2d1e53881cf3df3977cb2a798c296b9ae91a9ef71db893bf12ed723897949f3707b860
+  languageName: node
+  linkType: hard
+
+"@lexical/rich-text@npm:0.35.0, @lexical/rich-text@npm:^0.35.0":
+  version: 0.35.0
+  resolution: "@lexical/rich-text@npm:0.35.0"
+  dependencies:
+    "@lexical/clipboard": "npm:0.35.0"
+    "@lexical/selection": "npm:0.35.0"
+    "@lexical/utils": "npm:0.35.0"
+    lexical: "npm:0.35.0"
+  checksum: 10/d06e08bb441c991a4729720d6e974e7e427271cacd79268e7a92bb820c6ff5f682a76eaaab837f1057a028c3d592a28dc31d27e3436f99a28ad8cc0a974432eb
+  languageName: node
+  linkType: hard
+
+"@lexical/selection@npm:0.35.0, @lexical/selection@npm:^0.35.0":
+  version: 0.35.0
+  resolution: "@lexical/selection@npm:0.35.0"
+  dependencies:
+    lexical: "npm:0.35.0"
+  checksum: 10/36285d042e5f883197a2e05e39159b7515926622eaf489ba28249565eaaccd2415e94e1b888a376cbda0556f8073438736c222433d4d499f534af449ce24d89a
+  languageName: node
+  linkType: hard
+
+"@lexical/table@npm:0.35.0":
+  version: 0.35.0
+  resolution: "@lexical/table@npm:0.35.0"
+  dependencies:
+    "@lexical/clipboard": "npm:0.35.0"
+    "@lexical/utils": "npm:0.35.0"
+    lexical: "npm:0.35.0"
+  checksum: 10/ace388cfe706860e789421d192eb30183c63afb01d90c1b2f328b3f3ed7ce032ae45698bf94f2e5e4e340a73c53fed7a27cbf3b72a3d91ef5382e879a1df26bf
+  languageName: node
+  linkType: hard
+
+"@lexical/text@npm:0.35.0":
+  version: 0.35.0
+  resolution: "@lexical/text@npm:0.35.0"
+  dependencies:
+    lexical: "npm:0.35.0"
+  checksum: 10/6de985ca932d141d79cf47f0678ab40363d2a3be326e61d2dc25b9abff1b012aab299b819c489ede92f1bb72bc4bce37a1c563e9a44ffef5ebb05d0285a0e0e0
+  languageName: node
+  linkType: hard
+
+"@lexical/utils@npm:0.35.0, @lexical/utils@npm:^0.35.0":
+  version: 0.35.0
+  resolution: "@lexical/utils@npm:0.35.0"
+  dependencies:
+    "@lexical/list": "npm:0.35.0"
+    "@lexical/selection": "npm:0.35.0"
+    "@lexical/table": "npm:0.35.0"
+    lexical: "npm:0.35.0"
+  checksum: 10/be81f3e809285ebf3838200d6c00a787ba216097672555a8cab00edf8c401be9f6004032562b6432bd52a6ab5dc552486488d21636661795bcf8694ac46f51c6
+  languageName: node
+  linkType: hard
+
+"@lexical/yjs@npm:0.35.0":
+  version: 0.35.0
+  resolution: "@lexical/yjs@npm:0.35.0"
+  dependencies:
+    "@lexical/offset": "npm:0.35.0"
+    "@lexical/selection": "npm:0.35.0"
+    lexical: "npm:0.35.0"
+  peerDependencies:
+    yjs: ">=13.5.22"
+  checksum: 10/7a926fffa929e757dbf7da9d058e7ef315ff3691f3656f00d18ac1aeba5bceb357ac3dd4d2baeb74c16033802b7087f524bd3e7666f25840c88a98245590c13e
+  languageName: node
+  linkType: hard
+
+"@lezer/common@npm:^1.0.0, @lezer/common@npm:^1.1.0, @lezer/common@npm:^1.2.0":
+  version: 1.2.1
+  resolution: "@lezer/common@npm:1.2.1"
+  checksum: 10/b362ed2e97664e4b36b3dbff49b52d1bfc5accc0152b577fefd46e585d012ff685d1fd336d75d80066e01c0505b1135d4cf69be5e330b5bfec2e2650c437bcae
+  languageName: node
+  linkType: hard
+
+"@lezer/common@npm:^1.0.2, @lezer/common@npm:^1.2.1":
+  version: 1.2.3
+  resolution: "@lezer/common@npm:1.2.3"
+  checksum: 10/dad24e353e4e67d88b203191361ca1dff26c01c2b7b4ae829b668a1d115929334d077217367683e39180c0556510ed2066ea8ddba2b079be7c08a7152208cc87
+  languageName: node
+  linkType: hard
+
+"@lezer/cpp@npm:^1.0.0":
+  version: 1.1.3
+  resolution: "@lezer/cpp@npm:1.1.3"
+  dependencies:
+    "@lezer/common": "npm:^1.2.0"
+    "@lezer/highlight": "npm:^1.0.0"
+    "@lezer/lr": "npm:^1.0.0"
+  checksum: 10/4ffe11d08a142fd1cf710e7a01222ab63ecd3da9a3de954f462bac55db22cce1ce7667055295149bd386afd698228f355b07b0335745579fe659c7af4978d645
+  languageName: node
+  linkType: hard
+
+"@lezer/css@npm:^1.1.0, @lezer/css@npm:^1.1.7":
+  version: 1.3.0
+  resolution: "@lezer/css@npm:1.3.0"
+  dependencies:
+    "@lezer/common": "npm:^1.2.0"
+    "@lezer/highlight": "npm:^1.0.0"
+    "@lezer/lr": "npm:^1.3.0"
+  checksum: 10/142609b690b9fef139ea947faf43253df596834805c0805c69bc8866c4366790eb1b392d65a25dae5f840ff3de676768cc3b808013435c82db20d6a0f3917e97
+  languageName: node
+  linkType: hard
+
+"@lezer/go@npm:^1.0.0":
+  version: 1.0.1
+  resolution: "@lezer/go@npm:1.0.1"
+  dependencies:
+    "@lezer/common": "npm:^1.2.0"
+    "@lezer/highlight": "npm:^1.0.0"
+    "@lezer/lr": "npm:^1.3.0"
+  checksum: 10/1b96969679a16973fc112027fb28301328454e739621e0695f0011b1e5f159bc792e829dd8d586b8fd1c34218be4d9dee2ae73fa8802dcba98da9219a38a92d9
+  languageName: node
+  linkType: hard
+
+"@lezer/highlight@npm:^1.0.0":
+  version: 1.2.0
+  resolution: "@lezer/highlight@npm:1.2.0"
   dependencies:
     "@lezer/common": "npm:^1.0.0"
   checksum: 10/14a80cbfb0cd1ce716decb4f3a045d42e7146f539cfd483b62ce46c4586a26d2f4fbdc35ace1cad81645304be4d30eafb95a2b057c34dfd471d56c7fbd82df3a
   languageName: node
   linkType: hard
 
-"@lezer/highlight@npm:^1.2.1":
+"@lezer/highlight@npm:^1.1.3, @lezer/highlight@npm:^1.2.0, @lezer/highlight@npm:^1.2.1":
   version: 1.2.1
   resolution: "@lezer/highlight@npm:1.2.1"
   dependencies:
@@ -6441,6 +7212,39 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@lezer/html@npm:^1.3.0":
+  version: 1.3.10
+  resolution: "@lezer/html@npm:1.3.10"
+  dependencies:
+    "@lezer/common": "npm:^1.2.0"
+    "@lezer/highlight": "npm:^1.0.0"
+    "@lezer/lr": "npm:^1.0.0"
+  checksum: 10/b69f796492c0a2c000ebba88e1b1f0dc0885ed3392c11b46a9d7c638da1a325d6a288375fbeec52d0d05437b801302299e0e57359f95a494db1e251b3d66d29c
+  languageName: node
+  linkType: hard
+
+"@lezer/java@npm:^1.0.0":
+  version: 1.1.3
+  resolution: "@lezer/java@npm:1.1.3"
+  dependencies:
+    "@lezer/common": "npm:^1.2.0"
+    "@lezer/highlight": "npm:^1.0.0"
+    "@lezer/lr": "npm:^1.0.0"
+  checksum: 10/52865205f67c9d00630c72028d2d6bbb734da04f80e6febe6edb9bbd3ba55a3c0d6cfbdfa7db0ccf7e090b59040047aa9b752ff2d4ab714f3a0139c4d45e0f80
+  languageName: node
+  linkType: hard
+
+"@lezer/javascript@npm:^1.0.0":
+  version: 1.5.3
+  resolution: "@lezer/javascript@npm:1.5.3"
+  dependencies:
+    "@lezer/common": "npm:^1.2.0"
+    "@lezer/highlight": "npm:^1.1.3"
+    "@lezer/lr": "npm:^1.3.0"
+  checksum: 10/1cc3a719b7edda14bd816b9e4efab51fcf7392b7800ccdc0f135fb9652349b93c8f3bec50b82a200ac037ee8b9387efbe2d00c9870f7e0cb62ae8036635d6115
+  languageName: node
+  linkType: hard
+
 "@lezer/json@npm:^1.0.0":
   version: 1.0.2
   resolution: "@lezer/json@npm:1.0.2"
@@ -6461,6 +7265,91 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@lezer/lr@npm:^1.1.0, @lezer/lr@npm:^1.3.0, @lezer/lr@npm:^1.3.1, @lezer/lr@npm:^1.3.3, @lezer/lr@npm:^1.4.0":
+  version: 1.4.2
+  resolution: "@lezer/lr@npm:1.4.2"
+  dependencies:
+    "@lezer/common": "npm:^1.0.0"
+  checksum: 10/f7b505906c8d8df14c07866553cf3dae1e065b1da8b28fbb4193fd67ab8d187eb45f92759e29a2cfe4283296f0aa864b38a0a91708ecfc3e24b8f662d626e0c6
+  languageName: node
+  linkType: hard
+
+"@lezer/markdown@npm:^1.0.0":
+  version: 1.4.3
+  resolution: "@lezer/markdown@npm:1.4.3"
+  dependencies:
+    "@lezer/common": "npm:^1.0.0"
+    "@lezer/highlight": "npm:^1.0.0"
+  checksum: 10/5a638b0caa0a38007de1900196059f1f165a6684e050e7187e05c45c94cbbf90ad44eb82e5f45df3a7b69022dc4b5d9162e61232ba6f0759f5620328a6e0216e
+  languageName: node
+  linkType: hard
+
+"@lezer/php@npm:^1.0.0":
+  version: 1.0.4
+  resolution: "@lezer/php@npm:1.0.4"
+  dependencies:
+    "@lezer/common": "npm:^1.2.0"
+    "@lezer/highlight": "npm:^1.0.0"
+    "@lezer/lr": "npm:^1.1.0"
+  checksum: 10/d76ea8459958aac41abf53d9dd3e1899d663690134042f4b0095abbb2e404c3841dabbab27edfe29c32c3856c33ab62a238576c7e48701ccbf69bf9bf5e12a04
+  languageName: node
+  linkType: hard
+
+"@lezer/python@npm:^1.1.4":
+  version: 1.1.18
+  resolution: "@lezer/python@npm:1.1.18"
+  dependencies:
+    "@lezer/common": "npm:^1.2.0"
+    "@lezer/highlight": "npm:^1.0.0"
+    "@lezer/lr": "npm:^1.0.0"
+  checksum: 10/9570c661fe2cee649a6aca2ae528e75ee9fccd828eab0987b64702d7057b2e8ec2be71abd274059decb51c6a4b3748c6242c2cabc83d71f94f751362550d90c6
+  languageName: node
+  linkType: hard
+
+"@lezer/rust@npm:^1.0.0":
+  version: 1.0.2
+  resolution: "@lezer/rust@npm:1.0.2"
+  dependencies:
+    "@lezer/common": "npm:^1.2.0"
+    "@lezer/highlight": "npm:^1.0.0"
+    "@lezer/lr": "npm:^1.0.0"
+  checksum: 10/ea6152f65e42afed45e780c4adc87e19e33586de6790ac8dd2012309f22721f87454e6bfee1690e222ce30436ae380270e93cdfc9eb8cdda52930d86e1eb0c07
+  languageName: node
+  linkType: hard
+
+"@lezer/sass@npm:^1.0.0":
+  version: 1.1.0
+  resolution: "@lezer/sass@npm:1.1.0"
+  dependencies:
+    "@lezer/common": "npm:^1.2.0"
+    "@lezer/highlight": "npm:^1.0.0"
+    "@lezer/lr": "npm:^1.0.0"
+  checksum: 10/2f42dfaf5a328d4626a0a8ff8cd5973b7f52e8112541281cf1cbb1970acdc52c7c9f55c71f635bcff75a6151a55f7653d277306a15494b23b652e87d16df9ce3
+  languageName: node
+  linkType: hard
+
+"@lezer/xml@npm:^1.0.0":
+  version: 1.0.6
+  resolution: "@lezer/xml@npm:1.0.6"
+  dependencies:
+    "@lezer/common": "npm:^1.2.0"
+    "@lezer/highlight": "npm:^1.0.0"
+    "@lezer/lr": "npm:^1.0.0"
+  checksum: 10/ffdc3fd587c992f86de84bd828e1d92216484a571423b6edb7b0b1f2eb495ff14e9a234ce5fcba4bce1cb00683af50c0e7f5dfb017a0d3da77607b42e77548a2
+  languageName: node
+  linkType: hard
+
+"@lezer/yaml@npm:^1.0.0":
+  version: 1.0.3
+  resolution: "@lezer/yaml@npm:1.0.3"
+  dependencies:
+    "@lezer/common": "npm:^1.2.0"
+    "@lezer/highlight": "npm:^1.0.0"
+    "@lezer/lr": "npm:^1.4.0"
+  checksum: 10/6697b964403dc5dec9186732c5997675e5140ef5dddc8371dd28fa194d8431d8a7d5f18670be47b81a0b4ad6cbfe82e4f7c9c6f06e6f763bd100f7a38908baf5
+  languageName: node
+  linkType: hard
+
 "@libp2p/crypto@npm:^5.0.0, @libp2p/crypto@npm:^5.0.9":
   version: 5.0.9
   resolution: "@libp2p/crypto@npm:5.0.9"
@@ -6746,6 +7635,83 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@mdxeditor/editor@npm:^3.44.2":
+  version: 3.45.0
+  resolution: "@mdxeditor/editor@npm:3.45.0"
+  dependencies:
+    "@codemirror/commands": "npm:^6.2.4"
+    "@codemirror/lang-markdown": "npm:^6.2.3"
+    "@codemirror/language-data": "npm:^6.5.1"
+    "@codemirror/merge": "npm:^6.4.0"
+    "@codemirror/state": "npm:^6.4.0"
+    "@codemirror/view": "npm:^6.23.0"
+    "@codesandbox/sandpack-react": "npm:^2.20.0"
+    "@lexical/clipboard": "npm:^0.35.0"
+    "@lexical/link": "npm:^0.35.0"
+    "@lexical/list": "npm:^0.35.0"
+    "@lexical/markdown": "npm:^0.35.0"
+    "@lexical/plain-text": "npm:^0.35.0"
+    "@lexical/react": "npm:^0.35.0"
+    "@lexical/rich-text": "npm:^0.35.0"
+    "@lexical/selection": "npm:^0.35.0"
+    "@lexical/utils": "npm:^0.35.0"
+    "@mdxeditor/gurx": "npm:^1.2.4"
+    "@radix-ui/colors": "npm:^3.0.0"
+    "@radix-ui/react-dialog": "npm:^1.1.11"
+    "@radix-ui/react-icons": "npm:^1.3.2"
+    "@radix-ui/react-popover": "npm:^1.1.11"
+    "@radix-ui/react-popper": "npm:^1.2.4"
+    "@radix-ui/react-select": "npm:^2.2.2"
+    "@radix-ui/react-toggle-group": "npm:^1.1.7"
+    "@radix-ui/react-toolbar": "npm:^1.1.7"
+    "@radix-ui/react-tooltip": "npm:^1.2.4"
+    classnames: "npm:^2.3.2"
+    cm6-theme-basic-light: "npm:^0.2.0"
+    codemirror: "npm:^6.0.1"
+    downshift: "npm:^7.6.0"
+    js-yaml: "npm:4.1.0"
+    lexical: "npm:^0.35.0"
+    mdast-util-directive: "npm:^3.0.0"
+    mdast-util-from-markdown: "npm:^2.0.0"
+    mdast-util-frontmatter: "npm:^2.0.1"
+    mdast-util-gfm-strikethrough: "npm:^2.0.0"
+    mdast-util-gfm-table: "npm:^2.0.0"
+    mdast-util-gfm-task-list-item: "npm:^2.0.0"
+    mdast-util-highlight-mark: "npm:^1.2.2"
+    mdast-util-mdx: "npm:^3.0.0"
+    mdast-util-mdx-jsx: "npm:^3.0.0"
+    mdast-util-to-markdown: "npm:^2.1.0"
+    micromark-extension-directive: "npm:^3.0.0"
+    micromark-extension-frontmatter: "npm:^2.0.0"
+    micromark-extension-gfm-strikethrough: "npm:^2.0.0"
+    micromark-extension-gfm-table: "npm:^2.0.0"
+    micromark-extension-gfm-task-list-item: "npm:^2.0.1"
+    micromark-extension-highlight-mark: "npm:^1.2.0"
+    micromark-extension-mdx-jsx: "npm:^3.0.0"
+    micromark-extension-mdx-md: "npm:^2.0.0"
+    micromark-extension-mdxjs: "npm:^3.0.0"
+    micromark-factory-space: "npm:^2.0.0"
+    micromark-util-character: "npm:^2.0.1"
+    micromark-util-symbol: "npm:^2.0.0"
+    react-hook-form: "npm:^7.56.1"
+    unidiff: "npm:^1.0.2"
+  peerDependencies:
+    react: ">= 18 || >= 19"
+    react-dom: ">= 18 || >= 19"
+  checksum: 10/5d6a661721a1e5570480e8dc981758d5816e516deaa31aebf70d0a198a8bc0c4cdfa1fa843ce98786910f8c93ef818f963cd1857fe1e26332aeca1c2241fe7d1
+  languageName: node
+  linkType: hard
+
+"@mdxeditor/gurx@npm:^1.2.4":
+  version: 1.2.4
+  resolution: "@mdxeditor/gurx@npm:1.2.4"
+  peerDependencies:
+    react: ">= 18 || >= 19"
+    react-dom: ">= 18 || >= 19"
+  checksum: 10/b3c46bb20781cf20592f3ca830227d40290e5ecf2f972ceeae8fd136b868e7bff301ac52eb2757b009eefd7f9f11e4571a0d424c8a7ad414a95e914032ab8cfa
+  languageName: node
+  linkType: hard
+
 "@metamask/eth-json-rpc-provider@npm:^1.0.0":
   version: 1.0.1
   resolution: "@metamask/eth-json-rpc-provider@npm:1.0.1"
@@ -7938,6 +8904,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@open-draft/deferred-promise@npm:^2.1.0":
+  version: 2.2.0
+  resolution: "@open-draft/deferred-promise@npm:2.2.0"
+  checksum: 10/bc3bb1668a555bb87b33383cafcf207d9561e17d2ca0d9e61b7ce88e82b66e36a333d3676c1d39eb5848022c03c8145331fcdc828ba297f88cb1de9c5cef6c19
+  languageName: node
+  linkType: hard
+
 "@openzeppelin/contracts-upgradeable@npm:4.9.6":
   version: 4.9.6
   resolution: "@openzeppelin/contracts-upgradeable@npm:4.9.6"
@@ -8199,46 +9172,743 @@ __metadata:
   languageName: node
   linkType: hard
 
-"@pnpm/network.ca-file@npm:^1.0.1":
-  version: 1.0.2
-  resolution: "@pnpm/network.ca-file@npm:1.0.2"
+"@pnpm/network.ca-file@npm:^1.0.1":
+  version: 1.0.2
+  resolution: "@pnpm/network.ca-file@npm:1.0.2"
+  dependencies:
+    graceful-fs: "npm:4.2.10"
+  checksum: 10/d8d0884646500576bd5390464d13db1bb9a62e32a1069293e5bddb2ad8354b354b7e2d2a35e12850025651e795e6a80ce9e601c66312504667b7e3ee7b52becc
+  languageName: node
+  linkType: hard
+
+"@pnpm/npm-conf@npm:^2.1.0":
+  version: 2.3.1
+  resolution: "@pnpm/npm-conf@npm:2.3.1"
+  dependencies:
+    "@pnpm/config.env-replace": "npm:^1.1.0"
+    "@pnpm/network.ca-file": "npm:^1.0.1"
+    config-chain: "npm:^1.1.11"
+  checksum: 10/44fbb0b166eee3e3631ef0e92b1bed6489aa6975e3e722c16577cc0181b81374f5ae90c6e4da183c8160f996e6b4863325525b00542f42d1b757b51ef62bc4e7
+  languageName: node
+  linkType: hard
+
+"@polka/url@npm:^1.0.0-next.24":
+  version: 1.0.0-next.24
+  resolution: "@polka/url@npm:1.0.0-next.24"
+  checksum: 10/00baec4458ac86ca27edf7ce807ccfad97cd1d4b67bdedaf3401a9e755757588f3331e891290d1deea52d88df2bf2387caf8d94a6835b614d5b37b638a688273
+  languageName: node
+  linkType: hard
+
+"@popperjs/core@npm:^2.11.8":
+  version: 2.11.8
+  resolution: "@popperjs/core@npm:2.11.8"
+  checksum: 10/ddd16090cde777aaf102940f05d0274602079a95ad9805bd20bc55dcc7c3a2ba1b99dd5c73e5cc2753c3d31250ca52a67d58059459d7d27debb983a9f552936c
+  languageName: node
+  linkType: hard
+
+"@prettier/sync@npm:^0.3.0":
+  version: 0.3.0
+  resolution: "@prettier/sync@npm:0.3.0"
+  peerDependencies:
+    prettier: ^3.0.0
+  checksum: 10/10520d2479830c18256bf2b18349a15a8964f968059f7ccaa1f6d455c133a26e6c96bd7aea7c64ef6701700e8007ad68619b16ec83391b356b5d4a741cbae504
+  languageName: node
+  linkType: hard
+
+"@radix-ui/colors@npm:^3.0.0":
+  version: 3.0.0
+  resolution: "@radix-ui/colors@npm:3.0.0"
+  checksum: 10/bc9ffb01b3964f16482dc278cf6d86d85b73eae7cb94a77018fbd53b103b3d5ec1ecf77882cfbf8892f28c2c6057db8e19bf4d66234ed330a430373b092c5cfe
+  languageName: node
+  linkType: hard
+
+"@radix-ui/number@npm:1.1.1":
+  version: 1.1.1
+  resolution: "@radix-ui/number@npm:1.1.1"
+  checksum: 10/58717faf3f7aa180fdfcde7083cae0bc06677cbd08fd2bed5a3f8820deeb6f514f7d475f1fbb61e1f9a16cb2e7daf1000b2c614b0de3520fccfc04e3576e4566
+  languageName: node
+  linkType: hard
+
+"@radix-ui/primitive@npm:1.1.3":
+  version: 1.1.3
+  resolution: "@radix-ui/primitive@npm:1.1.3"
+  checksum: 10/ee27abbff0d6d305816e9314655eb35e72478ba47416bc9d5cb0581728be35e3408cfc0748313837561d635f0cb7dfaae26e61831f0e16c0fd7d669a612f2cb0
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-arrow@npm:1.1.7":
+  version: 1.1.7
+  resolution: "@radix-ui/react-arrow@npm:1.1.7"
+  dependencies:
+    "@radix-ui/react-primitive": "npm:2.1.3"
+  peerDependencies:
+    "@types/react": "*"
+    "@types/react-dom": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+    react-dom: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+    "@types/react-dom":
+      optional: true
+  checksum: 10/6cdf74f06090f8994cdf6d3935a44ea3ac309163a4f59c476482c4907e8e0775f224045030abf10fa4f9e1cb7743db034429249b9e59354988e247eeb0f4fdcf
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-collection@npm:1.1.7":
+  version: 1.1.7
+  resolution: "@radix-ui/react-collection@npm:1.1.7"
+  dependencies:
+    "@radix-ui/react-compose-refs": "npm:1.1.2"
+    "@radix-ui/react-context": "npm:1.1.2"
+    "@radix-ui/react-primitive": "npm:2.1.3"
+    "@radix-ui/react-slot": "npm:1.2.3"
+  peerDependencies:
+    "@types/react": "*"
+    "@types/react-dom": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+    react-dom: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+    "@types/react-dom":
+      optional: true
+  checksum: 10/cd53e2a2be82be7bc4014164cac0b42948401a203e5d0294d3947a5193f1d56bd23eb60e878a98dba50d08283254e79c3b873de5f935276b849686a868d51dd5
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-compose-refs@npm:1.1.2":
+  version: 1.1.2
+  resolution: "@radix-ui/react-compose-refs@npm:1.1.2"
+  peerDependencies:
+    "@types/react": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+  checksum: 10/9a91f0213014ffa40c5b8aae4debb993be5654217e504e35aa7422887eb2d114486d37e53c482d0fffb00cd44f51b5269fcdf397b280c71666fa11b7f32f165d
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-context@npm:1.1.2":
+  version: 1.1.2
+  resolution: "@radix-ui/react-context@npm:1.1.2"
+  peerDependencies:
+    "@types/react": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+  checksum: 10/156088367de42afa3c7e3acf5f0ba7cad6b359f3d17485585e80c2418434a6ed7cac2602eb73bca265d0091a1ad380f9405c069f103983e53497097ff35ba8f2
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-dialog@npm:^1.1.11":
+  version: 1.1.15
+  resolution: "@radix-ui/react-dialog@npm:1.1.15"
+  dependencies:
+    "@radix-ui/primitive": "npm:1.1.3"
+    "@radix-ui/react-compose-refs": "npm:1.1.2"
+    "@radix-ui/react-context": "npm:1.1.2"
+    "@radix-ui/react-dismissable-layer": "npm:1.1.11"
+    "@radix-ui/react-focus-guards": "npm:1.1.3"
+    "@radix-ui/react-focus-scope": "npm:1.1.7"
+    "@radix-ui/react-id": "npm:1.1.1"
+    "@radix-ui/react-portal": "npm:1.1.9"
+    "@radix-ui/react-presence": "npm:1.1.5"
+    "@radix-ui/react-primitive": "npm:2.1.3"
+    "@radix-ui/react-slot": "npm:1.2.3"
+    "@radix-ui/react-use-controllable-state": "npm:1.2.2"
+    aria-hidden: "npm:^1.2.4"
+    react-remove-scroll: "npm:^2.6.3"
+  peerDependencies:
+    "@types/react": "*"
+    "@types/react-dom": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+    react-dom: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+    "@types/react-dom":
+      optional: true
+  checksum: 10/90ad9ea36d927a05bcc2701b471c2965f6d5d4f446511cd471e62235fc674186997dea081f52e18cb17a1e593828d94da3848e68864fa3acebe29df9b068b240
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-direction@npm:1.1.1":
+  version: 1.1.1
+  resolution: "@radix-ui/react-direction@npm:1.1.1"
+  peerDependencies:
+    "@types/react": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+  checksum: 10/8cc330285f1d06829568042ca9aabd3295be4690ae93683033fc8632b5c4dfc60f5c1312f6e2cae27c196189c719de3cfbcf792ff74800f9ccae0ab4abc1bc92
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-dismissable-layer@npm:1.1.11":
+  version: 1.1.11
+  resolution: "@radix-ui/react-dismissable-layer@npm:1.1.11"
+  dependencies:
+    "@radix-ui/primitive": "npm:1.1.3"
+    "@radix-ui/react-compose-refs": "npm:1.1.2"
+    "@radix-ui/react-primitive": "npm:2.1.3"
+    "@radix-ui/react-use-callback-ref": "npm:1.1.1"
+    "@radix-ui/react-use-escape-keydown": "npm:1.1.1"
+  peerDependencies:
+    "@types/react": "*"
+    "@types/react-dom": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+    react-dom: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+    "@types/react-dom":
+      optional: true
+  checksum: 10/c20772588423379dee47fbe1d45c238c45a3bbe612eaf64a86576bf81821975e256d92ac71f9151e91b94a73068656143a11da9a3e77de7564d2a9926468e37a
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-focus-guards@npm:1.1.3":
+  version: 1.1.3
+  resolution: "@radix-ui/react-focus-guards@npm:1.1.3"
+  peerDependencies:
+    "@types/react": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+  checksum: 10/b57878f6cf0ebc3e8d7c5c6bbaad44598daac19c921551ca541c104201048a9a902f3d69196e7a09995fd46e998c309aab64dc30fa184b3609d67d187a6a9c24
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-focus-scope@npm:1.1.7":
+  version: 1.1.7
+  resolution: "@radix-ui/react-focus-scope@npm:1.1.7"
+  dependencies:
+    "@radix-ui/react-compose-refs": "npm:1.1.2"
+    "@radix-ui/react-primitive": "npm:2.1.3"
+    "@radix-ui/react-use-callback-ref": "npm:1.1.1"
+  peerDependencies:
+    "@types/react": "*"
+    "@types/react-dom": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+    react-dom: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+    "@types/react-dom":
+      optional: true
+  checksum: 10/2a7cd00e39e01756999ebf0bdb3401d6a8efa489a7b19e6b629b40bad3022b7b1f616555ccb4b0505bc0ba53e13a1fb51be905db138b16ec39c4fe319fe701d3
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-icons@npm:^1.3.2":
+  version: 1.3.2
+  resolution: "@radix-ui/react-icons@npm:1.3.2"
+  peerDependencies:
+    react: ^16.x || ^17.x || ^18.x || ^19.0.0 || ^19.0.0-rc
+  checksum: 10/cf6c694a400677890d0d83cd30ac01fa638c04eefe6194cd4e3c9edff49269e97dccc01e7bb480e2dcc249b27ee4eafa5d82d72d15c5119d66f4c26db6128f36
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-id@npm:1.1.1":
+  version: 1.1.1
+  resolution: "@radix-ui/react-id@npm:1.1.1"
+  dependencies:
+    "@radix-ui/react-use-layout-effect": "npm:1.1.1"
+  peerDependencies:
+    "@types/react": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+  checksum: 10/8d68e200778eb3038906870fc869b3d881f4a46715fb20cddd9c76cba42fdaaa4810a3365b6ec2daf0f185b9201fc99d009167f59c7921bc3a139722c2e976db
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-popover@npm:^1.1.11":
+  version: 1.1.15
+  resolution: "@radix-ui/react-popover@npm:1.1.15"
+  dependencies:
+    "@radix-ui/primitive": "npm:1.1.3"
+    "@radix-ui/react-compose-refs": "npm:1.1.2"
+    "@radix-ui/react-context": "npm:1.1.2"
+    "@radix-ui/react-dismissable-layer": "npm:1.1.11"
+    "@radix-ui/react-focus-guards": "npm:1.1.3"
+    "@radix-ui/react-focus-scope": "npm:1.1.7"
+    "@radix-ui/react-id": "npm:1.1.1"
+    "@radix-ui/react-popper": "npm:1.2.8"
+    "@radix-ui/react-portal": "npm:1.1.9"
+    "@radix-ui/react-presence": "npm:1.1.5"
+    "@radix-ui/react-primitive": "npm:2.1.3"
+    "@radix-ui/react-slot": "npm:1.2.3"
+    "@radix-ui/react-use-controllable-state": "npm:1.2.2"
+    aria-hidden: "npm:^1.2.4"
+    react-remove-scroll: "npm:^2.6.3"
+  peerDependencies:
+    "@types/react": "*"
+    "@types/react-dom": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+    react-dom: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+    "@types/react-dom":
+      optional: true
+  checksum: 10/0ea7c8bb827e44d5c02b3f7193d9ac8085c71a01bf601b1afeb2bb0ec0124756e03db3471606e89e4d014e4de7c7066c8e2e9b81bb4b31ea321890ec33421f31
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-popper@npm:1.2.8, @radix-ui/react-popper@npm:^1.2.4":
+  version: 1.2.8
+  resolution: "@radix-ui/react-popper@npm:1.2.8"
+  dependencies:
+    "@floating-ui/react-dom": "npm:^2.0.0"
+    "@radix-ui/react-arrow": "npm:1.1.7"
+    "@radix-ui/react-compose-refs": "npm:1.1.2"
+    "@radix-ui/react-context": "npm:1.1.2"
+    "@radix-ui/react-primitive": "npm:2.1.3"
+    "@radix-ui/react-use-callback-ref": "npm:1.1.1"
+    "@radix-ui/react-use-layout-effect": "npm:1.1.1"
+    "@radix-ui/react-use-rect": "npm:1.1.1"
+    "@radix-ui/react-use-size": "npm:1.1.1"
+    "@radix-ui/rect": "npm:1.1.1"
+  peerDependencies:
+    "@types/react": "*"
+    "@types/react-dom": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+    react-dom: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+    "@types/react-dom":
+      optional: true
+  checksum: 10/01366054e1e63dd9394f77afb9da3367709478a5adf4436c080fc5bbe9456170192ff9d1425d9fae5b246e1ba95173848f84b6f2a06b21b47d966367ec7cb997
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-portal@npm:1.1.9":
+  version: 1.1.9
+  resolution: "@radix-ui/react-portal@npm:1.1.9"
+  dependencies:
+    "@radix-ui/react-primitive": "npm:2.1.3"
+    "@radix-ui/react-use-layout-effect": "npm:1.1.1"
+  peerDependencies:
+    "@types/react": "*"
+    "@types/react-dom": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+    react-dom: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+    "@types/react-dom":
+      optional: true
+  checksum: 10/bd6be39bf021d5c917e2474ecba411e2625171f7ef96862b9af04bbd68833bb3662a7f1fbdeb5a7a237111b10e811e76d2cd03e957dadd6e668ef16541bfbd68
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-presence@npm:1.1.5":
+  version: 1.1.5
+  resolution: "@radix-ui/react-presence@npm:1.1.5"
+  dependencies:
+    "@radix-ui/react-compose-refs": "npm:1.1.2"
+    "@radix-ui/react-use-layout-effect": "npm:1.1.1"
+  peerDependencies:
+    "@types/react": "*"
+    "@types/react-dom": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+    react-dom: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+    "@types/react-dom":
+      optional: true
+  checksum: 10/4cdb05844c18877efb4b9739b46b7e5850b81d7ede994e75b5d62e8153a43c6e16b3ff9e55ff716e20b74b99b9415a94e97fd636bcb8698d5bbf7ab7b8663f9b
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-primitive@npm:2.1.3":
+  version: 2.1.3
+  resolution: "@radix-ui/react-primitive@npm:2.1.3"
+  dependencies:
+    "@radix-ui/react-slot": "npm:1.2.3"
+  peerDependencies:
+    "@types/react": "*"
+    "@types/react-dom": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+    react-dom: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+    "@types/react-dom":
+      optional: true
+  checksum: 10/1dbbf932a3527f4e62f210bb72944eff605c3e38c8d3275ed5a5c570c02820ab156169756a65ad9a638d2089a828a04a7903795377384e98c87d0ca456303253
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-roving-focus@npm:1.1.11":
+  version: 1.1.11
+  resolution: "@radix-ui/react-roving-focus@npm:1.1.11"
+  dependencies:
+    "@radix-ui/primitive": "npm:1.1.3"
+    "@radix-ui/react-collection": "npm:1.1.7"
+    "@radix-ui/react-compose-refs": "npm:1.1.2"
+    "@radix-ui/react-context": "npm:1.1.2"
+    "@radix-ui/react-direction": "npm:1.1.1"
+    "@radix-ui/react-id": "npm:1.1.1"
+    "@radix-ui/react-primitive": "npm:2.1.3"
+    "@radix-ui/react-use-callback-ref": "npm:1.1.1"
+    "@radix-ui/react-use-controllable-state": "npm:1.2.2"
+  peerDependencies:
+    "@types/react": "*"
+    "@types/react-dom": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+    react-dom: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+    "@types/react-dom":
+      optional: true
+  checksum: 10/0eddafa942332c95622ab8b53cce2fa25fd0dcaf4797218e9e6725da0734a81a438852cdcb3f588521018f68d38c6c5e50c64fda78c655f4e69dd45681ecc5e7
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-select@npm:^2.2.2":
+  version: 2.2.6
+  resolution: "@radix-ui/react-select@npm:2.2.6"
+  dependencies:
+    "@radix-ui/number": "npm:1.1.1"
+    "@radix-ui/primitive": "npm:1.1.3"
+    "@radix-ui/react-collection": "npm:1.1.7"
+    "@radix-ui/react-compose-refs": "npm:1.1.2"
+    "@radix-ui/react-context": "npm:1.1.2"
+    "@radix-ui/react-direction": "npm:1.1.1"
+    "@radix-ui/react-dismissable-layer": "npm:1.1.11"
+    "@radix-ui/react-focus-guards": "npm:1.1.3"
+    "@radix-ui/react-focus-scope": "npm:1.1.7"
+    "@radix-ui/react-id": "npm:1.1.1"
+    "@radix-ui/react-popper": "npm:1.2.8"
+    "@radix-ui/react-portal": "npm:1.1.9"
+    "@radix-ui/react-primitive": "npm:2.1.3"
+    "@radix-ui/react-slot": "npm:1.2.3"
+    "@radix-ui/react-use-callback-ref": "npm:1.1.1"
+    "@radix-ui/react-use-controllable-state": "npm:1.2.2"
+    "@radix-ui/react-use-layout-effect": "npm:1.1.1"
+    "@radix-ui/react-use-previous": "npm:1.1.1"
+    "@radix-ui/react-visually-hidden": "npm:1.2.3"
+    aria-hidden: "npm:^1.2.4"
+    react-remove-scroll: "npm:^2.6.3"
+  peerDependencies:
+    "@types/react": "*"
+    "@types/react-dom": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+    react-dom: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+    "@types/react-dom":
+      optional: true
+  checksum: 10/ef6df1a6411a965d30f8e14387058ece020469897ad2089d1e1019d8e37487e6b3c0f9683d7c6ec217698fa85fedd419738cab089a5ebc49a04405e63aac0bf0
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-separator@npm:1.1.7":
+  version: 1.1.7
+  resolution: "@radix-ui/react-separator@npm:1.1.7"
+  dependencies:
+    "@radix-ui/react-primitive": "npm:2.1.3"
+  peerDependencies:
+    "@types/react": "*"
+    "@types/react-dom": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+    react-dom: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+    "@types/react-dom":
+      optional: true
+  checksum: 10/c5c19b7991bf5395eb2b849145deeb9aa307d9fcf220380497992ff2a301753ab477d0329af51b6d500cd3c1d777edbd2504b544d9254542fb5f829ac5ddbcf3
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-slot@npm:1.2.3":
+  version: 1.2.3
+  resolution: "@radix-ui/react-slot@npm:1.2.3"
+  dependencies:
+    "@radix-ui/react-compose-refs": "npm:1.1.2"
+  peerDependencies:
+    "@types/react": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+  checksum: 10/fe484c2741e31d9c20a8fb53c5790a73c0664e2bea35e27f4d484a90c42135fcfffe11a08abfcacb7a8ee2faf013471f0e856818f3ddac8ac51ceb8869e0fd08
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-toggle-group@npm:1.1.11, @radix-ui/react-toggle-group@npm:^1.1.7":
+  version: 1.1.11
+  resolution: "@radix-ui/react-toggle-group@npm:1.1.11"
+  dependencies:
+    "@radix-ui/primitive": "npm:1.1.3"
+    "@radix-ui/react-context": "npm:1.1.2"
+    "@radix-ui/react-direction": "npm:1.1.1"
+    "@radix-ui/react-primitive": "npm:2.1.3"
+    "@radix-ui/react-roving-focus": "npm:1.1.11"
+    "@radix-ui/react-toggle": "npm:1.1.10"
+    "@radix-ui/react-use-controllable-state": "npm:1.2.2"
+  peerDependencies:
+    "@types/react": "*"
+    "@types/react-dom": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+    react-dom: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+    "@types/react-dom":
+      optional: true
+  checksum: 10/b20e2aa2580624621b62e72d2e44585427807e6629186dc8a46909a3bd35d9122fb4837f8e8fa9856a24b54bb2a7aa8983007da8b459303495d0d55b14396b35
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-toggle@npm:1.1.10":
+  version: 1.1.10
+  resolution: "@radix-ui/react-toggle@npm:1.1.10"
+  dependencies:
+    "@radix-ui/primitive": "npm:1.1.3"
+    "@radix-ui/react-primitive": "npm:2.1.3"
+    "@radix-ui/react-use-controllable-state": "npm:1.2.2"
+  peerDependencies:
+    "@types/react": "*"
+    "@types/react-dom": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+    react-dom: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+    "@types/react-dom":
+      optional: true
+  checksum: 10/ece154bd7a0ca765040fafbe4131f753457a3d37f73dec3ae94f08f17f3889272d06f33f305ad34c986925ce8a40532ee43f6bdb7e8b99fd8bac299b01d69204
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-toolbar@npm:^1.1.7":
+  version: 1.1.11
+  resolution: "@radix-ui/react-toolbar@npm:1.1.11"
+  dependencies:
+    "@radix-ui/primitive": "npm:1.1.3"
+    "@radix-ui/react-context": "npm:1.1.2"
+    "@radix-ui/react-direction": "npm:1.1.1"
+    "@radix-ui/react-primitive": "npm:2.1.3"
+    "@radix-ui/react-roving-focus": "npm:1.1.11"
+    "@radix-ui/react-separator": "npm:1.1.7"
+    "@radix-ui/react-toggle-group": "npm:1.1.11"
+  peerDependencies:
+    "@types/react": "*"
+    "@types/react-dom": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+    react-dom: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+    "@types/react-dom":
+      optional: true
+  checksum: 10/da022ae96f0a02da2c5890af3350f622425c8bb8564b1cae51ca28cfeb5dc73a8bb597bb762dfef2f738d497d207792e22231aec050c8d05071518b9c58f1f8b
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-tooltip@npm:^1.2.4":
+  version: 1.2.8
+  resolution: "@radix-ui/react-tooltip@npm:1.2.8"
+  dependencies:
+    "@radix-ui/primitive": "npm:1.1.3"
+    "@radix-ui/react-compose-refs": "npm:1.1.2"
+    "@radix-ui/react-context": "npm:1.1.2"
+    "@radix-ui/react-dismissable-layer": "npm:1.1.11"
+    "@radix-ui/react-id": "npm:1.1.1"
+    "@radix-ui/react-popper": "npm:1.2.8"
+    "@radix-ui/react-portal": "npm:1.1.9"
+    "@radix-ui/react-presence": "npm:1.1.5"
+    "@radix-ui/react-primitive": "npm:2.1.3"
+    "@radix-ui/react-slot": "npm:1.2.3"
+    "@radix-ui/react-use-controllable-state": "npm:1.2.2"
+    "@radix-ui/react-visually-hidden": "npm:1.2.3"
+  peerDependencies:
+    "@types/react": "*"
+    "@types/react-dom": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+    react-dom: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+    "@types/react-dom":
+      optional: true
+  checksum: 10/e31857628d998b69616b8994f9627d387ed7bfa453b94e3b18ad2c04de83caf5fcca0ef2f304b1d343e00f183e937d883247d81e386dcc76c7c7c268484bc47c
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-use-callback-ref@npm:1.1.1":
+  version: 1.1.1
+  resolution: "@radix-ui/react-use-callback-ref@npm:1.1.1"
+  peerDependencies:
+    "@types/react": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+  checksum: 10/cde8c40f1d4e79e6e71470218163a746858304bad03758ac84dc1f94247a046478e8e397518350c8d6609c84b7e78565441d7505bb3ed573afce82cfdcd19faf
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-use-controllable-state@npm:1.2.2":
+  version: 1.2.2
+  resolution: "@radix-ui/react-use-controllable-state@npm:1.2.2"
+  dependencies:
+    "@radix-ui/react-use-effect-event": "npm:0.0.2"
+    "@radix-ui/react-use-layout-effect": "npm:1.1.1"
+  peerDependencies:
+    "@types/react": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+  checksum: 10/a100bff3ddecb753dab17444147273c9f70046c5949712c52174b259622eaef12acbf7ebcf289bae4e714eb84d0a7317c1aa44064cd997f327d77b62bc732a7c
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-use-effect-event@npm:0.0.2":
+  version: 0.0.2
+  resolution: "@radix-ui/react-use-effect-event@npm:0.0.2"
+  dependencies:
+    "@radix-ui/react-use-layout-effect": "npm:1.1.1"
+  peerDependencies:
+    "@types/react": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+  checksum: 10/5a1950a30a399ea7e4b98154da9f536737a610de80189b7aacd4f064a89a3cd0d2a48571d527435227252e72e872bdb544ff6ffcfbdd02de2efd011be4aaa902
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-use-escape-keydown@npm:1.1.1":
+  version: 1.1.1
+  resolution: "@radix-ui/react-use-escape-keydown@npm:1.1.1"
+  dependencies:
+    "@radix-ui/react-use-callback-ref": "npm:1.1.1"
+  peerDependencies:
+    "@types/react": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+  checksum: 10/0eb0756c2c55ddcde9ff01446ab01c085ab2bf799173e97db7ef5f85126f9e8600225570801a1f64740e6d14c39ffe8eed7c14d29737345a5797f4622ac96f6f
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-use-layout-effect@npm:1.1.1":
+  version: 1.1.1
+  resolution: "@radix-ui/react-use-layout-effect@npm:1.1.1"
+  peerDependencies:
+    "@types/react": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+  checksum: 10/bad2ba4f206e6255263582bedfb7868773c400836f9a1b423c0b464ffe4a17e13d3f306d1ce19cf7a19a492e9d0e49747464f2656451bb7c6a99f5a57bd34de2
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-use-previous@npm:1.1.1":
+  version: 1.1.1
+  resolution: "@radix-ui/react-use-previous@npm:1.1.1"
+  peerDependencies:
+    "@types/react": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+  checksum: 10/ea6ea13523a0561dda9b14b9d44e299484816a6762d7fb50b91b27b6aec89f78c85245b69d5a904750d43919dbb7ef6ce6d3823639346675aa3a5cb9de32d984
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-use-rect@npm:1.1.1":
+  version: 1.1.1
+  resolution: "@radix-ui/react-use-rect@npm:1.1.1"
+  dependencies:
+    "@radix-ui/rect": "npm:1.1.1"
+  peerDependencies:
+    "@types/react": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+  checksum: 10/116461bebc49472f7497e66a9bd413541181b3d00c5e0aaeef45d790dc1fbd7c8dcea80b169ea273306228b9a3c2b70067e902d1fd5004b3057e3bbe35b9d55d
+  languageName: node
+  linkType: hard
+
+"@radix-ui/react-use-size@npm:1.1.1":
+  version: 1.1.1
+  resolution: "@radix-ui/react-use-size@npm:1.1.1"
   dependencies:
-    graceful-fs: "npm:4.2.10"
-  checksum: 10/d8d0884646500576bd5390464d13db1bb9a62e32a1069293e5bddb2ad8354b354b7e2d2a35e12850025651e795e6a80ce9e601c66312504667b7e3ee7b52becc
+    "@radix-ui/react-use-layout-effect": "npm:1.1.1"
+  peerDependencies:
+    "@types/react": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+  checksum: 10/64e61f65feb67ffc80e1fc4a8d5e32480fb6d68475e2640377e021178dead101568cba5f936c9c33e6c142c7cf2fb5d76ad7b23ef80e556ba142d56cf306147b
   languageName: node
   linkType: hard
 
-"@pnpm/npm-conf@npm:^2.1.0":
-  version: 2.3.1
-  resolution: "@pnpm/npm-conf@npm:2.3.1"
+"@radix-ui/react-visually-hidden@npm:1.2.3":
+  version: 1.2.3
+  resolution: "@radix-ui/react-visually-hidden@npm:1.2.3"
   dependencies:
-    "@pnpm/config.env-replace": "npm:^1.1.0"
-    "@pnpm/network.ca-file": "npm:^1.0.1"
-    config-chain: "npm:^1.1.11"
-  checksum: 10/44fbb0b166eee3e3631ef0e92b1bed6489aa6975e3e722c16577cc0181b81374f5ae90c6e4da183c8160f996e6b4863325525b00542f42d1b757b51ef62bc4e7
+    "@radix-ui/react-primitive": "npm:2.1.3"
+  peerDependencies:
+    "@types/react": "*"
+    "@types/react-dom": "*"
+    react: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+    react-dom: ^16.8 || ^17.0 || ^18.0 || ^19.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+    "@types/react-dom":
+      optional: true
+  checksum: 10/42296bde1ddf4af4e7445e914c35d6bc8406d6ede49f0a959a553e75b3ed21da09fda80a81c48d8ec058ed8129ce7137499d02ee26f90f0d3eaa2417922d6509
   languageName: node
   linkType: hard
 
-"@polka/url@npm:^1.0.0-next.24":
-  version: 1.0.0-next.24
-  resolution: "@polka/url@npm:1.0.0-next.24"
-  checksum: 10/00baec4458ac86ca27edf7ce807ccfad97cd1d4b67bdedaf3401a9e755757588f3331e891290d1deea52d88df2bf2387caf8d94a6835b614d5b37b638a688273
+"@radix-ui/rect@npm:1.1.1":
+  version: 1.1.1
+  resolution: "@radix-ui/rect@npm:1.1.1"
+  checksum: 10/b6c5eb787640775b53dd52fa47218a089f0a0d8220d3ebff079c0b754e1fb82d89b6bdf08a82fd0d59549bdeb52678c0cca091c302da49dcf74c3c989cb55678
   languageName: node
   linkType: hard
 
-"@popperjs/core@npm:^2.11.8":
-  version: 2.11.8
-  resolution: "@popperjs/core@npm:2.11.8"
-  checksum: 10/ddd16090cde777aaf102940f05d0274602079a95ad9805bd20bc55dcc7c3a2ba1b99dd5c73e5cc2753c3d31250ca52a67d58059459d7d27debb983a9f552936c
+"@react-hook/intersection-observer@npm:^3.1.1":
+  version: 3.1.2
+  resolution: "@react-hook/intersection-observer@npm:3.1.2"
+  dependencies:
+    "@react-hook/passive-layout-effect": "npm:^1.2.0"
+    intersection-observer: "npm:^0.10.0"
+  peerDependencies:
+    react: ">=16.8"
+  checksum: 10/fee587ca06bdfe02aa3a30b95bb9fb63cc745aafa74a34e68b2c1938b6b34e8807f02e8a9f3d656ab4b399f30cd6aaa88ef7b486ec1ee1f848e6e726d73f256d
   languageName: node
   linkType: hard
 
-"@prettier/sync@npm:^0.3.0":
-  version: 0.3.0
-  resolution: "@prettier/sync@npm:0.3.0"
+"@react-hook/passive-layout-effect@npm:^1.2.0":
+  version: 1.2.1
+  resolution: "@react-hook/passive-layout-effect@npm:1.2.1"
   peerDependencies:
-    prettier: ^3.0.0
-  checksum: 10/10520d2479830c18256bf2b18349a15a8964f968059f7ccaa1f6d455c133a26e6c96bd7aea7c64ef6701700e8007ad68619b16ec83391b356b5d4a741cbae504
+    react: ">=16.8"
+  checksum: 10/217cb8aa90fb8e677672319a9a466d7752890cf4357c76df000b207696e9cc717cf2ee88080671cc9dae238a82f92093ab4f61ab2f6032d2a8db958fc7d99b5d
   languageName: node
   linkType: hard
 
@@ -9437,6 +11107,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@stitches/core@npm:^1.2.6":
+  version: 1.2.8
+  resolution: "@stitches/core@npm:1.2.8"
+  checksum: 10/bdee1772f033b20bfb1081a3bb8c3e85f2a44f381379d4c2ae21408336025e2d2578f79eec74db26824b852ebcc72de3edfc8c51418608f189aa5ffc26df667a
+  languageName: node
+  linkType: hard
+
 "@surma/rollup-plugin-off-main-thread@npm:^2.2.3":
   version: 2.2.3
   resolution: "@surma/rollup-plugin-off-main-thread@npm:2.2.3"
@@ -12063,7 +13740,7 @@ __metadata:
   languageName: node
   linkType: hard
 
-"acorn-jsx@npm:^5.3.2":
+"acorn-jsx@npm:^5.0.0, acorn-jsx@npm:^5.3.2":
   version: 5.3.2
   resolution: "acorn-jsx@npm:5.3.2"
   peerDependencies:
@@ -12095,6 +13772,15 @@ __metadata:
   languageName: node
   linkType: hard
 
+"acorn@npm:^8.0.0":
+  version: 8.15.0
+  resolution: "acorn@npm:8.15.0"
+  bin:
+    acorn: bin/acorn
+  checksum: 10/77f2de5051a631cf1729c090e5759148459cdb76b5f5c70f890503d629cf5052357b0ce783c0f976dd8a93c5150f59f6d18df1def3f502396a20f81282482fa4
+  languageName: node
+  linkType: hard
+
 "acorn@npm:^8.1.0, acorn@npm:^8.10.0, acorn@npm:^8.14.0, acorn@npm:^8.2.4, acorn@npm:^8.4.1, acorn@npm:^8.7.1, acorn@npm:^8.8.0, acorn@npm:^8.8.1, acorn@npm:^8.8.2":
   version: 8.14.0
   resolution: "acorn@npm:8.14.0"
@@ -12322,6 +14008,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"anser@npm:^2.1.1":
+  version: 2.3.2
+  resolution: "anser@npm:2.3.2"
+  checksum: 10/2bfb5fc96533919060bd2f2c199d22011f58e3d0ca48156cec7508ca5f741ea08e38fe634ae3d6902ae44b445148438f2ebcaf09f08ff3b2be20687c19cf4419
+  languageName: node
+  linkType: hard
+
 "ansi-align@npm:^3.0.0":
   version: 3.0.1
   resolution: "ansi-align@npm:3.0.1"
@@ -12543,6 +14236,15 @@ __metadata:
   languageName: node
   linkType: hard
 
+"aria-hidden@npm:^1.2.4":
+  version: 1.2.6
+  resolution: "aria-hidden@npm:1.2.6"
+  dependencies:
+    tslib: "npm:^2.0.0"
+  checksum: 10/1914e5a36225dccdb29f0b88cc891eeca736cdc5b0c905ab1437b90b28b5286263ed3a221c75b7dc788f25b942367be0044b2ac8ccf073a72e07a50b1d964202
+  languageName: node
+  linkType: hard
+
 "aria-query@npm:^5.3.1, aria-query@npm:^5.3.2":
   version: 5.3.2
   resolution: "aria-query@npm:5.3.2"
@@ -14392,6 +16094,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"classnames@npm:^2.3.2":
+  version: 2.5.1
+  resolution: "classnames@npm:2.5.1"
+  checksum: 10/58eb394e8817021b153bb6e7d782cfb667e4ab390cb2e9dac2fc7c6b979d1cc2b2a733093955fc5c94aa79ef5c8c89f11ab77780894509be6afbb91dddd79d15
+  languageName: node
+  linkType: hard
+
 "clean-css@npm:^5.2.2":
   version: 5.3.2
   resolution: "clean-css@npm:5.3.2"
@@ -14401,6 +16110,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"clean-set@npm:^1.1.2":
+  version: 1.1.2
+  resolution: "clean-set@npm:1.1.2"
+  checksum: 10/b460b59c82a11945052b59efa1d51405c0ba11d227f2c2140e9f7803d702b4a36354bfee0077d46a758979891aa4322211ce392c86961f11bf57e2ff774d5506
+  languageName: node
+  linkType: hard
+
 "clean-stack@npm:^2.0.0":
   version: 2.2.0
   resolution: "clean-stack@npm:2.2.0"
@@ -14596,6 +16312,18 @@ __metadata:
   languageName: node
   linkType: hard
 
+"cm6-theme-basic-light@npm:^0.2.0":
+  version: 0.2.0
+  resolution: "cm6-theme-basic-light@npm:0.2.0"
+  peerDependencies:
+    "@codemirror/language": ^6.0.0
+    "@codemirror/state": ^6.0.0
+    "@codemirror/view": ^6.0.0
+    "@lezer/highlight": ^1.0.0
+  checksum: 10/8eb28ac7d8d7abdd8e5e4589d6abe459f1fe841940e49ea6431135c446b93af67bccab3981627c8e6377d1199f64879691570d6d1d409f9df9627bf4edceb1fc
+  languageName: node
+  linkType: hard
+
 "co@npm:^4.6.0":
   version: 4.6.0
   resolution: "co@npm:4.6.0"
@@ -14625,6 +16353,21 @@ __metadata:
   languageName: node
   linkType: hard
 
+"codemirror@npm:^6.0.1":
+  version: 6.0.2
+  resolution: "codemirror@npm:6.0.2"
+  dependencies:
+    "@codemirror/autocomplete": "npm:^6.0.0"
+    "@codemirror/commands": "npm:^6.0.0"
+    "@codemirror/language": "npm:^6.0.0"
+    "@codemirror/lint": "npm:^6.0.0"
+    "@codemirror/search": "npm:^6.0.0"
+    "@codemirror/state": "npm:^6.0.0"
+    "@codemirror/view": "npm:^6.0.0"
+  checksum: 10/bd73c9ebbd8cb709a697fa4e2484c188c44aafce4b4d2a342807a5648c6be5bd5876f0caac47db0c1181f1ec8d86e38bd2b6efe51b971bf240fd3382bef0b371
+  languageName: node
+  linkType: hard
+
 "collect-v8-coverage@npm:^1.0.0":
   version: 1.0.1
   resolution: "collect-v8-coverage@npm:1.0.1"
@@ -14859,6 +16602,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"compute-scroll-into-view@npm:^2.0.4":
+  version: 2.0.4
+  resolution: "compute-scroll-into-view@npm:2.0.4"
+  checksum: 10/a9015cbf464ed852d3c459c1777d5890e26925dd2e99ad438dc8cb6a0154f33f0ce6856f6c50de9dd176168d315e7223d08c4bae1e5dbe82b056dd5216c0bcc6
+  languageName: node
+  linkType: hard
+
 "computeds@npm:^0.0.1":
   version: 0.0.1
   resolution: "computeds@npm:0.0.1"
@@ -15383,7 +17133,7 @@ __metadata:
   languageName: node
   linkType: hard
 
-"crelt@npm:^1.0.5":
+"crelt@npm:^1.0.5, crelt@npm:^1.0.6":
   version: 1.0.6
   resolution: "crelt@npm:1.0.6"
   checksum: 10/5ed326ca6bd243b1dba6b943f665b21c2c04be03271824bc48f20dba324b0f8233e221f8c67312526d24af2b1243c023dc05a41bd8bd05d1a479fd2c72fb39c3
@@ -15833,6 +17583,16 @@ __metadata:
   languageName: node
   linkType: hard
 
+"d@npm:1, d@npm:^1.0.1, d@npm:^1.0.2":
+  version: 1.0.2
+  resolution: "d@npm:1.0.2"
+  dependencies:
+    es5-ext: "npm:^0.10.64"
+    type: "npm:^2.7.2"
+  checksum: 10/a3f45ef964622f683f6a1cb9b8dcbd75ce490cd2f4ac9794099db3d8f0e2814d412d84cd3fe522e58feb1f273117bb480f29c5381f6225f0abca82517caaa77a
+  languageName: node
+  linkType: hard
+
 "dag-jose@npm:^5.0.0":
   version: 5.1.1
   resolution: "dag-jose@npm:5.1.1"
@@ -16274,7 +18034,7 @@ __metadata:
   languageName: node
   linkType: hard
 
-"dequal@npm:^2.0.0, dequal@npm:^2.0.3":
+"dequal@npm:^2.0.0, dequal@npm:^2.0.2, dequal@npm:^2.0.3":
   version: 2.0.3
   resolution: "dequal@npm:2.0.3"
   checksum: 10/6ff05a7561f33603df87c45e389c9ac0a95e3c056be3da1a0c4702149e3a7f6fe5ffbb294478687ba51a9e95f3a60e8b6b9005993acd79c292c7d15f71964b6b
@@ -16358,6 +18118,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"detect-node-es@npm:^1.1.0":
+  version: 1.1.0
+  resolution: "detect-node-es@npm:1.1.0"
+  checksum: 10/e46307d7264644975b71c104b9f028ed1d3d34b83a15b8a22373640ce5ea630e5640b1078b8ea15f202b54641da71e4aa7597093bd4b91f113db520a26a37449
+  languageName: node
+  linkType: hard
+
 "detect-node@npm:^2.0.4":
   version: 2.1.0
   resolution: "detect-node@npm:2.1.0"
@@ -16415,7 +18182,7 @@ __metadata:
   languageName: node
   linkType: hard
 
-"diff@npm:^5.0.0, diff@npm:^5.2.0":
+"diff@npm:^5.0.0, diff@npm:^5.1.0, diff@npm:^5.2.0":
   version: 5.2.0
   resolution: "diff@npm:5.2.0"
   checksum: 10/01b7b440f83a997350a988e9d2f558366c0f90f15be19f4aa7f1bb3109a4e153dfc3b9fbf78e14ea725717017407eeaa2271e3896374a0181e8f52445740846d
@@ -16732,13 +18499,28 @@ __metadata:
   languageName: node
   linkType: hard
 
-"dotenv@npm:^16.6.1":
+"dotenv@npm:^16.0.3, dotenv@npm:^16.6.1":
   version: 16.6.1
   resolution: "dotenv@npm:16.6.1"
   checksum: 10/1d1897144344447ffe62aa1a6d664f4cd2e0784e0aff787eeeec1940ded32f8e4b5b506d665134fc87157baa086fce07ec6383970a2b6d2e7985beaed6a4cc14
   languageName: node
   linkType: hard
 
+"downshift@npm:^7.6.0":
+  version: 7.6.2
+  resolution: "downshift@npm:7.6.2"
+  dependencies:
+    "@babel/runtime": "npm:^7.14.8"
+    compute-scroll-into-view: "npm:^2.0.4"
+    prop-types: "npm:^15.7.2"
+    react-is: "npm:^17.0.2"
+    tslib: "npm:^2.3.0"
+  peerDependencies:
+    react: ">=16.12.0"
+  checksum: 10/4ffca012d185a6eb57d5543650401323c932ae5f7227f92419aba4f04d5de2ca4f0270aa398caa289622f60ebb5f831fddf11e5d6d56981a89f7fbd7ed0a1f48
+  languageName: node
+  linkType: hard
+
 "dset@npm:^3.1.2":
   version: 3.1.2
   resolution: "dset@npm:3.1.2"
@@ -17197,6 +18979,29 @@ __metadata:
   languageName: node
   linkType: hard
 
+"es5-ext@npm:^0.10.35, es5-ext@npm:^0.10.62, es5-ext@npm:^0.10.64, es5-ext@npm:~0.10.14":
+  version: 0.10.64
+  resolution: "es5-ext@npm:0.10.64"
+  dependencies:
+    es6-iterator: "npm:^2.0.3"
+    es6-symbol: "npm:^3.1.3"
+    esniff: "npm:^2.0.1"
+    next-tick: "npm:^1.1.0"
+  checksum: 10/0c5d8657708b1695ddc4b06f4e0b9fbdda4d2fe46d037b6bedb49a7d1931e542ec9eecf4824d59e1d357e93229deab014bb4b86485db2d41b1d68e54439689ce
+  languageName: node
+  linkType: hard
+
+"es6-iterator@npm:^2.0.3":
+  version: 2.0.3
+  resolution: "es6-iterator@npm:2.0.3"
+  dependencies:
+    d: "npm:1"
+    es5-ext: "npm:^0.10.35"
+    es6-symbol: "npm:^3.1.1"
+  checksum: 10/dbadecf3d0e467692815c2b438dfa99e5a97cbbecf4a58720adcb467a04220e0e36282399ba297911fd472c50ae4158fffba7ed0b7d4273fe322b69d03f9e3a5
+  languageName: node
+  linkType: hard
+
 "es6-promise@npm:^4.0.3":
   version: 4.2.8
   resolution: "es6-promise@npm:4.2.8"
@@ -17213,6 +19018,16 @@ __metadata:
   languageName: node
   linkType: hard
 
+"es6-symbol@npm:^3, es6-symbol@npm:^3.1.1, es6-symbol@npm:^3.1.3":
+  version: 3.1.4
+  resolution: "es6-symbol@npm:3.1.4"
+  dependencies:
+    d: "npm:^1.0.2"
+    ext: "npm:^1.7.0"
+  checksum: 10/3743119fe61f89e2f049a6ce52bd82fab5f65d13e2faa72453b73f95c15292c3cb9bdf3747940d504517e675e45fd375554c6b5d35d2bcbefd35f5489ecba546
+  languageName: node
+  linkType: hard
+
 "esbuild@npm:^0.19.0":
   version: 0.19.12
   resolution: "esbuild@npm:0.19.12"
@@ -17476,6 +19291,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"escape-carriage@npm:^1.3.1":
+  version: 1.3.1
+  resolution: "escape-carriage@npm:1.3.1"
+  checksum: 10/6d7613a5875977b04eb4651f3fa14eb8f54c72aa198b603c823502fcfef9f5969afc4c76d27b2f2fc008d88764fbf4c3a6e04d549d6134e2ff7f705c99e3ddb9
+  languageName: node
+  linkType: hard
+
 "escape-html@npm:~1.0.3":
   version: 1.0.3
   resolution: "escape-html@npm:1.0.3"
@@ -17504,6 +19326,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"escape-string-regexp@npm:^5.0.0":
+  version: 5.0.0
+  resolution: "escape-string-regexp@npm:5.0.0"
+  checksum: 10/20daabe197f3cb198ec28546deebcf24b3dbb1a5a269184381b3116d12f0532e06007f4bc8da25669d6a7f8efb68db0758df4cd981f57bc5b57f521a3e12c59e
+  languageName: node
+  linkType: hard
+
 "escodegen@npm:1.8.x":
   version: 1.8.1
   resolution: "escodegen@npm:1.8.1"
@@ -18056,6 +19885,18 @@ __metadata:
   languageName: node
   linkType: hard
 
+"esniff@npm:^2.0.1":
+  version: 2.0.1
+  resolution: "esniff@npm:2.0.1"
+  dependencies:
+    d: "npm:^1.0.1"
+    es5-ext: "npm:^0.10.62"
+    event-emitter: "npm:^0.3.5"
+    type: "npm:^2.7.2"
+  checksum: 10/f6a2abd2f8c5fe57c5fcf53e5407c278023313d0f6c3a92688e7122ab9ac233029fd424508a196ae5bc561aa1f67d23f4e2435b1a0d378030f476596129056ac
+  languageName: node
+  linkType: hard
+
 "espree@npm:^10.0.1, espree@npm:^10.3.0":
   version: 10.3.0
   resolution: "espree@npm:10.3.0"
@@ -18153,6 +19994,16 @@ __metadata:
   languageName: node
   linkType: hard
 
+"estree-util-visit@npm:^2.0.0":
+  version: 2.0.0
+  resolution: "estree-util-visit@npm:2.0.0"
+  dependencies:
+    "@types/estree-jsx": "npm:^1.0.0"
+    "@types/unist": "npm:^3.0.0"
+  checksum: 10/e3c39d34c8b42fc2067dfa64d460f754b43cca4b573b031a5e5bb185e02c4efc753353197815bbb094b8149a781ab76f18116bec8056b5ff375162e68bffa0bd
+  languageName: node
+  linkType: hard
+
 "estree-walker@npm:^1.0.1":
   version: 1.0.1
   resolution: "estree-walker@npm:1.0.1"
@@ -18440,6 +20291,16 @@ __metadata:
   languageName: node
   linkType: hard
 
+"event-emitter@npm:^0.3.5":
+  version: 0.3.5
+  resolution: "event-emitter@npm:0.3.5"
+  dependencies:
+    d: "npm:1"
+    es5-ext: "npm:~0.10.14"
+  checksum: 10/a7f5ea80029193f4869782d34ef7eb43baa49cd397013add1953491b24588468efbe7e3cc9eb87d53f33397e7aab690fd74c079ec440bf8b12856f6bdb6e9396
+  languageName: node
+  linkType: hard
+
 "event-target-shim@npm:^5.0.0":
   version: 5.0.1
   resolution: "event-target-shim@npm:5.0.1"
@@ -18618,6 +20479,15 @@ __metadata:
   languageName: node
   linkType: hard
 
+"ext@npm:^1.7.0":
+  version: 1.7.0
+  resolution: "ext@npm:1.7.0"
+  dependencies:
+    type: "npm:^2.7.2"
+  checksum: 10/666a135980b002df0e75c8ac6c389140cdc59ac953db62770479ee2856d58ce69d2f845e5f2586716350b725400f6945e51e9159573158c39f369984c72dcd84
+  languageName: node
+  linkType: hard
+
 "extend@npm:^3.0.0":
   version: 3.0.2
   resolution: "extend@npm:3.0.2"
@@ -18818,6 +20688,15 @@ __metadata:
   languageName: node
   linkType: hard
 
+"fault@npm:^2.0.0":
+  version: 2.0.1
+  resolution: "fault@npm:2.0.1"
+  dependencies:
+    format: "npm:^0.2.0"
+  checksum: 10/c9b30f47d95769177130a9409976a899ed31eb598450fbad5b0d39f2f5f56d5f4a9ff9257e0bee8407cb0fc3ce37165657888c6aa6d78472e403893104329b72
+  languageName: node
+  linkType: hard
+
 "faye-websocket@npm:^0.11.3":
   version: 0.11.4
   resolution: "faye-websocket@npm:0.11.4"
@@ -19211,6 +21090,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"format@npm:^0.2.0":
+  version: 0.2.2
+  resolution: "format@npm:0.2.2"
+  checksum: 10/5f878b8fc1a672c8cbefa4f293bdd977c822862577d70d53456a48b4169ec9b51677c0c995bf62c633b4e5cd673624b7c273f57923b28735a6c0c0a72c382a4a
+  languageName: node
+  linkType: hard
+
 "forwarded@npm:0.2.0":
   version: 0.2.0
   resolution: "forwarded@npm:0.2.0"
@@ -19474,6 +21360,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"get-nonce@npm:^1.0.0":
+  version: 1.0.1
+  resolution: "get-nonce@npm:1.0.1"
+  checksum: 10/ad5104871d114a694ecc506a2d406e2331beccb961fe1e110dc25556b38bcdbf399a823a8a375976cd8889668156a9561e12ebe3fa6a4c6ba169c8466c2ff868
+  languageName: node
+  linkType: hard
+
 "get-own-enumerable-property-symbols@npm:^3.0.0":
   version: 3.0.2
   resolution: "get-own-enumerable-property-symbols@npm:3.0.2"
@@ -21197,6 +23090,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"intersection-observer@npm:^0.10.0":
+  version: 0.10.0
+  resolution: "intersection-observer@npm:0.10.0"
+  checksum: 10/d9ffce291459a2c4ada9e45f23ef805361691f93e9a41a2afe801d29e6c9b1d0054f7faddafd79ecc341d7008e1f921a2e67cadeae9692d9831af903f23fc644
+  languageName: node
+  linkType: hard
+
 "invariant@npm:^2.2.4":
   version: 2.2.4
   resolution: "invariant@npm:2.2.4"
@@ -23431,6 +25331,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"lexical@npm:0.35.0, lexical@npm:^0.35.0":
+  version: 0.35.0
+  resolution: "lexical@npm:0.35.0"
+  checksum: 10/31cb0b683c50826f70c6ef1ca1e3a5eb276a736c6e217789c1d38a12bfef93c9f9a16ed0b8747517742067e87145365589a6e133562619777aed58501a53d7b1
+  languageName: node
+  linkType: hard
+
 "lie@npm:3.1.1":
   version: 3.1.1
   resolution: "lie@npm:3.1.1"
@@ -24120,6 +26027,15 @@ __metadata:
   languageName: node
   linkType: hard
 
+"lz-string@npm:^1.4.4":
+  version: 1.5.0
+  resolution: "lz-string@npm:1.5.0"
+  bin:
+    lz-string: bin/bin.js
+  checksum: 10/e86f0280e99a8d8cd4eef24d8601ddae15ce54e43ac9990dfcb79e1e081c255ad24424a30d78d2ad8e51a8ce82a66a930047fed4b4aa38c6f0b392ff9300edfc
+  languageName: node
+  linkType: hard
+
 "magic-string@npm:^0.25.0, magic-string@npm:^0.25.7":
   version: 0.25.9
   resolution: "magic-string@npm:0.25.9"
@@ -24239,6 +26155,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"markdown-table@npm:^3.0.0":
+  version: 3.0.4
+  resolution: "markdown-table@npm:3.0.4"
+  checksum: 10/bc699819e6a15607e5def0f21aa862aa061cf1f49877baa93b0185574f6ab143591afe0e18b94d9b15ea80c6a693894150dbccfacf4f6767160dc32ae393dfe0
+  languageName: node
+  linkType: hard
+
 "marked@npm:^4.1.1":
   version: 4.3.0
   resolution: "marked@npm:4.3.0"
@@ -24286,6 +26209,23 @@ __metadata:
   languageName: node
   linkType: hard
 
+"mdast-util-directive@npm:^3.0.0":
+  version: 3.1.0
+  resolution: "mdast-util-directive@npm:3.1.0"
+  dependencies:
+    "@types/mdast": "npm:^4.0.0"
+    "@types/unist": "npm:^3.0.0"
+    ccount: "npm:^2.0.0"
+    devlop: "npm:^1.0.0"
+    mdast-util-from-markdown: "npm:^2.0.0"
+    mdast-util-to-markdown: "npm:^2.0.0"
+    parse-entities: "npm:^4.0.0"
+    stringify-entities: "npm:^4.0.0"
+    unist-util-visit-parents: "npm:^6.0.0"
+  checksum: 10/5aabd777ae8752cb9d09c7827a6690887536da8a9f85e833d5399ab8f47e5aadaa3eea78985efd041f50c658bf91b4579800dae79b20549240f52bbc2bc26335
+  languageName: node
+  linkType: hard
+
 "mdast-util-from-markdown@npm:^1.0.0":
   version: 1.3.1
   resolution: "mdast-util-from-markdown@npm:1.3.1"
@@ -24326,6 +26266,65 @@ __metadata:
   languageName: node
   linkType: hard
 
+"mdast-util-frontmatter@npm:^2.0.1":
+  version: 2.0.1
+  resolution: "mdast-util-frontmatter@npm:2.0.1"
+  dependencies:
+    "@types/mdast": "npm:^4.0.0"
+    devlop: "npm:^1.0.0"
+    escape-string-regexp: "npm:^5.0.0"
+    mdast-util-from-markdown: "npm:^2.0.0"
+    mdast-util-to-markdown: "npm:^2.0.0"
+    micromark-extension-frontmatter: "npm:^2.0.0"
+  checksum: 10/afd9486af6ea74a94d84a225c367ab810ad4439683ecafc1ce9fc7bb0ecacaafac82e0af529974489c145824b242509f9387f833fc01a14a83a978049772ef80
+  languageName: node
+  linkType: hard
+
+"mdast-util-gfm-strikethrough@npm:^2.0.0":
+  version: 2.0.0
+  resolution: "mdast-util-gfm-strikethrough@npm:2.0.0"
+  dependencies:
+    "@types/mdast": "npm:^4.0.0"
+    mdast-util-from-markdown: "npm:^2.0.0"
+    mdast-util-to-markdown: "npm:^2.0.0"
+  checksum: 10/b1abc137d78270540585ad94a7a4ed1630683312690b902389dae0ede50a6832e26d1be053687f49728e14fa8a379da9384342725d3beb4480fc30b12866ab37
+  languageName: node
+  linkType: hard
+
+"mdast-util-gfm-table@npm:^2.0.0":
+  version: 2.0.0
+  resolution: "mdast-util-gfm-table@npm:2.0.0"
+  dependencies:
+    "@types/mdast": "npm:^4.0.0"
+    devlop: "npm:^1.0.0"
+    markdown-table: "npm:^3.0.0"
+    mdast-util-from-markdown: "npm:^2.0.0"
+    mdast-util-to-markdown: "npm:^2.0.0"
+  checksum: 10/a043d60d723a86f79c49cbdd1d98b80c89f4a8f9f5fa84b3880c53e132f40150972460aba9be1f44a612ef5abd6810d122c5e7e5d9c54f3ac7560cce8c305c75
+  languageName: node
+  linkType: hard
+
+"mdast-util-gfm-task-list-item@npm:^2.0.0":
+  version: 2.0.0
+  resolution: "mdast-util-gfm-task-list-item@npm:2.0.0"
+  dependencies:
+    "@types/mdast": "npm:^4.0.0"
+    devlop: "npm:^1.0.0"
+    mdast-util-from-markdown: "npm:^2.0.0"
+    mdast-util-to-markdown: "npm:^2.0.0"
+  checksum: 10/679a3ff09b52015c0088cd0616ccecc7cc9d250d56a8762aafdffc640f3f607bbd9fe047d3e7e7078e6a996e83f677be3bfcad7ac7260563825fa80a04f8e09d
+  languageName: node
+  linkType: hard
+
+"mdast-util-highlight-mark@npm:^1.2.2":
+  version: 1.2.2
+  resolution: "mdast-util-highlight-mark@npm:1.2.2"
+  dependencies:
+    micromark-extension-highlight-mark: "npm:1.2.0"
+  checksum: 10/92f62acb2958e1f9e280350f707e0254f9f6363618fde528bc738c74143e5735f6393e0b0d08cce2e9f416c4f9e673d485e375bbcf1e861de055f3e50dab09b5
+  languageName: node
+  linkType: hard
+
 "mdast-util-mdx-expression@npm:^2.0.0":
   version: 2.0.1
   resolution: "mdast-util-mdx-expression@npm:2.0.1"
@@ -24352,11 +26351,24 @@ __metadata:
     devlop: "npm:^1.1.0"
     mdast-util-from-markdown: "npm:^2.0.0"
     mdast-util-to-markdown: "npm:^2.0.0"
-    parse-entities: "npm:^4.0.0"
-    stringify-entities: "npm:^4.0.0"
-    unist-util-stringify-position: "npm:^4.0.0"
-    vfile-message: "npm:^4.0.0"
-  checksum: 10/6c14f271f1380fd512038247f45887b7aa71bbf4acd8881651a317b61706b114f2582f62f7777d0eacd42c4a7b979802825c2a2fd8bb7c46a1ab931ccb1ddf3e
+    parse-entities: "npm:^4.0.0"
+    stringify-entities: "npm:^4.0.0"
+    unist-util-stringify-position: "npm:^4.0.0"
+    vfile-message: "npm:^4.0.0"
+  checksum: 10/6c14f271f1380fd512038247f45887b7aa71bbf4acd8881651a317b61706b114f2582f62f7777d0eacd42c4a7b979802825c2a2fd8bb7c46a1ab931ccb1ddf3e
+  languageName: node
+  linkType: hard
+
+"mdast-util-mdx@npm:^3.0.0":
+  version: 3.0.0
+  resolution: "mdast-util-mdx@npm:3.0.0"
+  dependencies:
+    mdast-util-from-markdown: "npm:^2.0.0"
+    mdast-util-mdx-expression: "npm:^2.0.0"
+    mdast-util-mdx-jsx: "npm:^3.0.0"
+    mdast-util-mdxjs-esm: "npm:^2.0.0"
+    mdast-util-to-markdown: "npm:^2.0.0"
+  checksum: 10/547d928f0d1e60d9087cd8ad301cdf2e1d14b094d2662a00292874b923bcb59323bdad3a29804c7f323ad78f4d3954361bfdaf4a9be765c4e6fe47a815df50c2
   languageName: node
   linkType: hard
 
@@ -24417,7 +26429,7 @@ __metadata:
   languageName: node
   linkType: hard
 
-"mdast-util-to-markdown@npm:^2.0.0":
+"mdast-util-to-markdown@npm:^2.0.0, mdast-util-to-markdown@npm:^2.1.0":
   version: 2.1.2
   resolution: "mdast-util-to-markdown@npm:2.1.2"
   dependencies:
@@ -24681,6 +26693,163 @@ __metadata:
   languageName: node
   linkType: hard
 
+"micromark-extension-directive@npm:^3.0.0":
+  version: 3.0.2
+  resolution: "micromark-extension-directive@npm:3.0.2"
+  dependencies:
+    devlop: "npm:^1.0.0"
+    micromark-factory-space: "npm:^2.0.0"
+    micromark-factory-whitespace: "npm:^2.0.0"
+    micromark-util-character: "npm:^2.0.0"
+    micromark-util-symbol: "npm:^2.0.0"
+    micromark-util-types: "npm:^2.0.0"
+    parse-entities: "npm:^4.0.0"
+  checksum: 10/63dbaa209722c1a77ffea6c6d5ea0f873f5e795ef08a2039f3d795320c889e5ce10fe1162500b0ff3063f8ceb1f7d727ec1d29d2df6271cbe90ec0646e061c8d
+  languageName: node
+  linkType: hard
+
+"micromark-extension-frontmatter@npm:^2.0.0":
+  version: 2.0.0
+  resolution: "micromark-extension-frontmatter@npm:2.0.0"
+  dependencies:
+    fault: "npm:^2.0.0"
+    micromark-util-character: "npm:^2.0.0"
+    micromark-util-symbol: "npm:^2.0.0"
+    micromark-util-types: "npm:^2.0.0"
+  checksum: 10/55873937494e9bfe1cc8cba3c8710e14e85ad0c9f3bb859d367268fc2204f3fe2eb70f9f83e496de0d3ea79c468fe6df879f9d475c716644c2daa90056cc8374
+  languageName: node
+  linkType: hard
+
+"micromark-extension-gfm-strikethrough@npm:^2.0.0":
+  version: 2.1.0
+  resolution: "micromark-extension-gfm-strikethrough@npm:2.1.0"
+  dependencies:
+    devlop: "npm:^1.0.0"
+    micromark-util-chunked: "npm:^2.0.0"
+    micromark-util-classify-character: "npm:^2.0.0"
+    micromark-util-resolve-all: "npm:^2.0.0"
+    micromark-util-symbol: "npm:^2.0.0"
+    micromark-util-types: "npm:^2.0.0"
+  checksum: 10/eaf2c7b1e3eb2a7d7f405e8abe561be083cc52b8e027225ed286490939f527d18c120df59c8d8e17fdcf284f8d014502bf3db45d8e36e3109457ece8fb1db29b
+  languageName: node
+  linkType: hard
+
+"micromark-extension-gfm-table@npm:^2.0.0":
+  version: 2.1.1
+  resolution: "micromark-extension-gfm-table@npm:2.1.1"
+  dependencies:
+    devlop: "npm:^1.0.0"
+    micromark-factory-space: "npm:^2.0.0"
+    micromark-util-character: "npm:^2.0.0"
+    micromark-util-symbol: "npm:^2.0.0"
+    micromark-util-types: "npm:^2.0.0"
+  checksum: 10/0391ead408d79a183a9bba325b0e660b85aef2cd6e442a9214afc4e0bdc3105cd7dbf41fc75465acf152883a4050b6203107c2a80bcadb304235581a1340fd8c
+  languageName: node
+  linkType: hard
+
+"micromark-extension-gfm-task-list-item@npm:^2.0.1":
+  version: 2.1.0
+  resolution: "micromark-extension-gfm-task-list-item@npm:2.1.0"
+  dependencies:
+    devlop: "npm:^1.0.0"
+    micromark-factory-space: "npm:^2.0.0"
+    micromark-util-character: "npm:^2.0.0"
+    micromark-util-symbol: "npm:^2.0.0"
+    micromark-util-types: "npm:^2.0.0"
+  checksum: 10/c5f72929f0dca77df01442b721356624de6657364e2264ef50fc7226305976f302a49b670836f9494ce70a9b0335d974b5ef8e6457553c4c200bfc06d6951964
+  languageName: node
+  linkType: hard
+
+"micromark-extension-highlight-mark@npm:1.2.0, micromark-extension-highlight-mark@npm:^1.2.0":
+  version: 1.2.0
+  resolution: "micromark-extension-highlight-mark@npm:1.2.0"
+  dependencies:
+    micromark-util-chunked: "npm:^2.0.0"
+    micromark-util-classify-character: "npm:^2.0.0"
+    micromark-util-resolve-all: "npm:^2.0.0"
+    micromark-util-symbol: "npm:^2.0.0"
+    micromark-util-types: "npm:^2.0.0"
+    uvu: "npm:^0.5.6"
+  checksum: 10/18474254eb7bf347ff68cc1953aa702527c8d710856d2b2252a3e59dda2fb3b7f34c0780ef18090f257270a00182380d731a7f705e5834e5795e8790aa3ea696
+  languageName: node
+  linkType: hard
+
+"micromark-extension-mdx-expression@npm:^3.0.0":
+  version: 3.0.1
+  resolution: "micromark-extension-mdx-expression@npm:3.0.1"
+  dependencies:
+    "@types/estree": "npm:^1.0.0"
+    devlop: "npm:^1.0.0"
+    micromark-factory-mdx-expression: "npm:^2.0.0"
+    micromark-factory-space: "npm:^2.0.0"
+    micromark-util-character: "npm:^2.0.0"
+    micromark-util-events-to-acorn: "npm:^2.0.0"
+    micromark-util-symbol: "npm:^2.0.0"
+    micromark-util-types: "npm:^2.0.0"
+  checksum: 10/a185e1787fe6d49d0e435690affd4b83ce319f88a08c57d2460d37d5c0a75ea64aa49a4a116b6d37f91389dc04351e1826aa834519a9f25fc31e1424962c6eb7
+  languageName: node
+  linkType: hard
+
+"micromark-extension-mdx-jsx@npm:^3.0.0":
+  version: 3.0.2
+  resolution: "micromark-extension-mdx-jsx@npm:3.0.2"
+  dependencies:
+    "@types/estree": "npm:^1.0.0"
+    devlop: "npm:^1.0.0"
+    estree-util-is-identifier-name: "npm:^3.0.0"
+    micromark-factory-mdx-expression: "npm:^2.0.0"
+    micromark-factory-space: "npm:^2.0.0"
+    micromark-util-character: "npm:^2.0.0"
+    micromark-util-events-to-acorn: "npm:^2.0.0"
+    micromark-util-symbol: "npm:^2.0.0"
+    micromark-util-types: "npm:^2.0.0"
+    vfile-message: "npm:^4.0.0"
+  checksum: 10/a85cdb7c972fbb2cc8f0a64adc808b2b62bc2d79dbdd31fcd3208ff15aafa0198b002022840b2c65b5bff6f2a8c2c4a59a32a89f3482e6e183114b476e98e25c
+  languageName: node
+  linkType: hard
+
+"micromark-extension-mdx-md@npm:^2.0.0":
+  version: 2.0.0
+  resolution: "micromark-extension-mdx-md@npm:2.0.0"
+  dependencies:
+    micromark-util-types: "npm:^2.0.0"
+  checksum: 10/8b364a69b23196075258143c8c19fa58d7d5a91f6811ec0f881b75cf024a4869994be29f84f4d281147275c5a104af8b6a7fcd98abd8fde9f5b534a1acb254e8
+  languageName: node
+  linkType: hard
+
+"micromark-extension-mdxjs-esm@npm:^3.0.0":
+  version: 3.0.0
+  resolution: "micromark-extension-mdxjs-esm@npm:3.0.0"
+  dependencies:
+    "@types/estree": "npm:^1.0.0"
+    devlop: "npm:^1.0.0"
+    micromark-core-commonmark: "npm:^2.0.0"
+    micromark-util-character: "npm:^2.0.0"
+    micromark-util-events-to-acorn: "npm:^2.0.0"
+    micromark-util-symbol: "npm:^2.0.0"
+    micromark-util-types: "npm:^2.0.0"
+    unist-util-position-from-estree: "npm:^2.0.0"
+    vfile-message: "npm:^4.0.0"
+  checksum: 10/f2e0977f9a65284b0c765d1175d55ec5d1928dae3ae90f65cc36f293cda152a97fe2007977aaf5595b1bc02298b34c96e8ce8b647c9c647c75f1ea53e92d14d2
+  languageName: node
+  linkType: hard
+
+"micromark-extension-mdxjs@npm:^3.0.0":
+  version: 3.0.0
+  resolution: "micromark-extension-mdxjs@npm:3.0.0"
+  dependencies:
+    acorn: "npm:^8.0.0"
+    acorn-jsx: "npm:^5.0.0"
+    micromark-extension-mdx-expression: "npm:^3.0.0"
+    micromark-extension-mdx-jsx: "npm:^3.0.0"
+    micromark-extension-mdx-md: "npm:^2.0.0"
+    micromark-extension-mdxjs-esm: "npm:^3.0.0"
+    micromark-util-combine-extensions: "npm:^2.0.0"
+    micromark-util-types: "npm:^2.0.0"
+  checksum: 10/66e0df7b2db05b9c88796600e354e0753594f06760abfddcac706afcd5754586c9085adb89e15447ce1450e6a5f2fa66a75f6da394e0eceb919e9c364475593e
+  languageName: node
+  linkType: hard
+
 "micromark-factory-destination@npm:^1.0.0":
   version: 1.1.0
   resolution: "micromark-factory-destination@npm:1.1.0"
@@ -24727,6 +26896,23 @@ __metadata:
   languageName: node
   linkType: hard
 
+"micromark-factory-mdx-expression@npm:^2.0.0":
+  version: 2.0.3
+  resolution: "micromark-factory-mdx-expression@npm:2.0.3"
+  dependencies:
+    "@types/estree": "npm:^1.0.0"
+    devlop: "npm:^1.0.0"
+    micromark-factory-space: "npm:^2.0.0"
+    micromark-util-character: "npm:^2.0.0"
+    micromark-util-events-to-acorn: "npm:^2.0.0"
+    micromark-util-symbol: "npm:^2.0.0"
+    micromark-util-types: "npm:^2.0.0"
+    unist-util-position-from-estree: "npm:^2.0.0"
+    vfile-message: "npm:^4.0.0"
+  checksum: 10/afadae88a18f31afa564747101e076011c56457454b30294ae55aeea7efee8626ddc3bad0f0f43649008f89b8784782b5adec143fdf477fb352354d76f08db55
+  languageName: node
+  linkType: hard
+
 "micromark-factory-space@npm:^1.0.0":
   version: 1.1.0
   resolution: "micromark-factory-space@npm:1.1.0"
@@ -24805,7 +26991,7 @@ __metadata:
   languageName: node
   linkType: hard
 
-"micromark-util-character@npm:^2.0.0":
+"micromark-util-character@npm:^2.0.0, micromark-util-character@npm:^2.0.1":
   version: 2.1.1
   resolution: "micromark-util-character@npm:2.1.1"
   dependencies:
@@ -24931,6 +27117,21 @@ __metadata:
   languageName: node
   linkType: hard
 
+"micromark-util-events-to-acorn@npm:^2.0.0":
+  version: 2.0.3
+  resolution: "micromark-util-events-to-acorn@npm:2.0.3"
+  dependencies:
+    "@types/estree": "npm:^1.0.0"
+    "@types/unist": "npm:^3.0.0"
+    devlop: "npm:^1.0.0"
+    estree-util-visit: "npm:^2.0.0"
+    micromark-util-symbol: "npm:^2.0.0"
+    micromark-util-types: "npm:^2.0.0"
+    vfile-message: "npm:^4.0.0"
+  checksum: 10/0d87e49b897636dc0e84b4bd06b6fa9e6abcd40ab90c9431e36737c85c444d3db1e4f9b8f51433422b1bedc46f086890ce96671b5a795230c6b7b09cb53d9aba
+  languageName: node
+  linkType: hard
+
 "micromark-util-html-tag-name@npm:^1.0.0":
   version: 1.2.0
   resolution: "micromark-util-html-tag-name@npm:1.2.0"
@@ -25144,6 +27345,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"mime-db@npm:^1.52.0":
+  version: 1.54.0
+  resolution: "mime-db@npm:1.54.0"
+  checksum: 10/9e7834be3d66ae7f10eaa69215732c6d389692b194f876198dca79b2b90cbf96688d9d5d05ef7987b20f749b769b11c01766564264ea5f919c88b32a29011311
+  languageName: node
+  linkType: hard
+
 "mime-types@npm:^2.1.12, mime-types@npm:^2.1.27, mime-types@npm:^2.1.31, mime-types@npm:~2.1.17, mime-types@npm:~2.1.24, mime-types@npm:~2.1.34":
   version: 2.1.35
   resolution: "mime-types@npm:2.1.35"
@@ -25775,6 +27983,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"next-tick@npm:^1.1.0":
+  version: 1.1.0
+  resolution: "next-tick@npm:1.1.0"
+  checksum: 10/83b5cf36027a53ee6d8b7f9c0782f2ba87f4858d977342bfc3c20c21629290a2111f8374d13a81221179603ffc4364f38374b5655d17b6a8f8a8c77bdea4fe8b
+  languageName: node
+  linkType: hard
+
 "next@npm:14.2.28":
   version: 14.2.28
   resolution: "next@npm:14.2.28"
@@ -26502,6 +28717,20 @@ __metadata:
   languageName: node
   linkType: hard
 
+"outvariant@npm:1.4.0":
+  version: 1.4.0
+  resolution: "outvariant@npm:1.4.0"
+  checksum: 10/07b9bcb9b3a2ff1b3db02af6b07d70e663082b30ddc08ff475d7c85fc623fdcc4433a4ab5b88f6902b62dbb284eef1be386aa537e14cef0519fad887ec483054
+  languageName: node
+  linkType: hard
+
+"outvariant@npm:^1.3.0, outvariant@npm:^1.4.0":
+  version: 1.4.3
+  resolution: "outvariant@npm:1.4.3"
+  checksum: 10/3a7582745850cb344d49641867a4c080858c54f4091afd91b9c0765ba6e471c2bc841348f0fff344845ddd0a4db42fd5d68c6f7ebaf32d4b676a3a9987b2488a
+  languageName: node
+  linkType: hard
+
 "overlayscrollbars-react@npm:^0.5.6":
   version: 0.5.6
   resolution: "overlayscrollbars-react@npm:0.5.6"
@@ -28395,6 +30624,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"prismjs@npm:^1.30.0":
+  version: 1.30.0
+  resolution: "prismjs@npm:1.30.0"
+  checksum: 10/6b48a2439a82e5c6882f48ebc1564c3890e16463ba17ac10c3ad4f62d98dea5b5c915b172b63b83023a70ad4f5d7be3e8a60304420db34a161fae69dd4e3e2da
+  languageName: node
+  linkType: hard
+
 "process-nextick-args@npm:~2.0.0":
   version: 2.0.1
   resolution: "process-nextick-args@npm:2.0.1"
@@ -28969,6 +31205,15 @@ __metadata:
   languageName: node
   linkType: hard
 
+"react-devtools-inline@npm:4.4.0":
+  version: 4.4.0
+  resolution: "react-devtools-inline@npm:4.4.0"
+  dependencies:
+    es6-symbol: "npm:^3"
+  checksum: 10/316a03bd21eb34f511e74e4e969e6a7d75d299800a4158ff59081457f024dc3aebc0c471938fd7e1c4676823fdcb546ca0d7c2d7ab74e34a9c1bdac31f2284b2
+  languageName: node
+  linkType: hard
+
 "react-dom@npm:^18.0.0, react-dom@npm:^18.3.1":
   version: 18.3.1
   resolution: "react-dom@npm:18.3.1"
@@ -28981,6 +31226,17 @@ __metadata:
   languageName: node
   linkType: hard
 
+"react-error-boundary@npm:^3.1.4":
+  version: 3.1.4
+  resolution: "react-error-boundary@npm:3.1.4"
+  dependencies:
+    "@babel/runtime": "npm:^7.12.5"
+  peerDependencies:
+    react: ">=16.13.1"
+  checksum: 10/7418637bf352b88f35ff3798e6faa094ee046df9d422fc08f54c017892c3c0738dac661ba3d64d97209464e7a60e7fbbeffdbeaee5edc38f3aaf5f1f4a8bf610
+  languageName: node
+  linkType: hard
+
 "react-error-boundary@npm:^4.1.2":
   version: 4.1.2
   resolution: "react-error-boundary@npm:4.1.2"
@@ -28999,6 +31255,15 @@ __metadata:
   languageName: node
   linkType: hard
 
+"react-hook-form@npm:^7.56.1":
+  version: 7.62.0
+  resolution: "react-hook-form@npm:7.62.0"
+  peerDependencies:
+    react: ^16.8.0 || ^17 || ^18 || ^19
+  checksum: 10/092dcf0317ed3e314b124ed9df3f3494cf3447326078cd857f6fdc47aad0504e466ab2fb593bbb8e79c247b8772159f83aebe54a7e5799926b00d7e401d127a6
+  languageName: node
+  linkType: hard
+
 "react-i18next@npm:^15.4.1":
   version: 15.4.1
   resolution: "react-i18next@npm:15.4.1"
@@ -29047,7 +31312,7 @@ __metadata:
   languageName: node
   linkType: hard
 
-"react-is@npm:^17.0.1":
+"react-is@npm:^17.0.1, react-is@npm:^17.0.2":
   version: 17.0.2
   resolution: "react-is@npm:17.0.2"
   checksum: 10/73b36281e58eeb27c9cc6031301b6ae19ecdc9f18ae2d518bdb39b0ac564e65c5779405d623f1df9abf378a13858b79442480244bd579968afc1faf9a2ce5e05
@@ -29185,6 +31450,41 @@ __metadata:
   languageName: node
   linkType: hard
 
+"react-remove-scroll-bar@npm:^2.3.7":
+  version: 2.3.8
+  resolution: "react-remove-scroll-bar@npm:2.3.8"
+  dependencies:
+    react-style-singleton: "npm:^2.2.2"
+    tslib: "npm:^2.0.0"
+  peerDependencies:
+    "@types/react": "*"
+    react: ^16.8.0 || ^17.0.0 || ^18.0.0 || ^19.0.0
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+  checksum: 10/6c0f8cff98b9f49a4ee2263f1eedf12926dced5ce220fbe83bd93544460e2a7ec8ec39b35d1b2a75d2fced0b2d64afeb8e66f830431ca896e05a20585f9fc350
+  languageName: node
+  linkType: hard
+
+"react-remove-scroll@npm:^2.6.3":
+  version: 2.7.1
+  resolution: "react-remove-scroll@npm:2.7.1"
+  dependencies:
+    react-remove-scroll-bar: "npm:^2.3.7"
+    react-style-singleton: "npm:^2.2.3"
+    tslib: "npm:^2.1.0"
+    use-callback-ref: "npm:^1.3.3"
+    use-sidecar: "npm:^1.1.3"
+  peerDependencies:
+    "@types/react": "*"
+    react: ^16.8.0 || ^17.0.0 || ^18.0.0 || ^19.0.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+  checksum: 10/5e571ba35ba527047c54c9c4a271363167770556fb85ee45ead8310673197719425cc8f7a2b7f672abf530294c41c8c34bdae325a571994cc1e694b664b52734
+  languageName: node
+  linkType: hard
+
 "react-router-dom@npm:^6.28.0":
   version: 6.28.0
   resolution: "react-router-dom@npm:6.28.0"
@@ -29316,6 +31616,22 @@ __metadata:
   languageName: node
   linkType: hard
 
+"react-style-singleton@npm:^2.2.2, react-style-singleton@npm:^2.2.3":
+  version: 2.2.3
+  resolution: "react-style-singleton@npm:2.2.3"
+  dependencies:
+    get-nonce: "npm:^1.0.0"
+    tslib: "npm:^2.0.0"
+  peerDependencies:
+    "@types/react": "*"
+    react: ^16.8.0 || ^17.0.0 || ^18.0.0 || ^19.0.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+  checksum: 10/62498094ff3877a37f351b29e6cad9e38b2eb1ac3c0cb27ebf80aee96554f80b35e17bdb552bcd7ac8b7cb9904fea93ea5668f2057c73d38f90b5d46bb9b27ab
+  languageName: node
+  linkType: hard
+
 "react-toastify@npm:^10.0.6":
   version: 10.0.6
   resolution: "react-toastify@npm:10.0.6"
@@ -31631,6 +33947,18 @@ __metadata:
   languageName: node
   linkType: hard
 
+"static-browser-server@npm:1.0.3":
+  version: 1.0.3
+  resolution: "static-browser-server@npm:1.0.3"
+  dependencies:
+    "@open-draft/deferred-promise": "npm:^2.1.0"
+    dotenv: "npm:^16.0.3"
+    mime-db: "npm:^1.52.0"
+    outvariant: "npm:^1.3.0"
+  checksum: 10/d047c6c8a667a054db23c3d9770cf5e9d558694f052be81886f606ccc1c6dab034eb1fc5b35d1e3bf23a8dc6ca6f9cd7e4349bfb7b5cad1c2af13058c32dea86
+  languageName: node
+  linkType: hard
+
 "statuses@npm:2.0.1":
   version: 2.0.1
   resolution: "statuses@npm:2.0.1"
@@ -31697,6 +34025,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"strict-event-emitter@npm:^0.4.3":
+  version: 0.4.6
+  resolution: "strict-event-emitter@npm:0.4.6"
+  checksum: 10/abdbf59b6c45b599cc2f227fa473765d1510d155ebd22533e8ecb06110dfacb2ff07aece7fd528dde2b4f9e379d60f2687eee8af3fa2877c3ed88ee5b7ed2707
+  languageName: node
+  linkType: hard
+
 "strict-uri-encode@npm:^2.0.0":
   version: 2.0.0
   resolution: "strict-uri-encode@npm:2.0.0"
@@ -32336,6 +34671,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"tabbable@npm:^6.0.0":
+  version: 6.2.0
+  resolution: "tabbable@npm:6.2.0"
+  checksum: 10/980fa73476026e99dcacfc0d6e000d41d42c8e670faf4682496d30c625495e412c4369694f2a15cf1e5252d22de3c396f2b62edbe8d60b5dadc40d09e3f2dde3
+  languageName: node
+  linkType: hard
+
 "table-layout@npm:^1.0.2":
   version: 1.0.2
   resolution: "table-layout@npm:1.0.2"
@@ -32962,7 +35304,7 @@ __metadata:
   languageName: node
   linkType: hard
 
-"tslib@npm:^2.0.0, tslib@npm:^2.0.3, tslib@npm:^2.1.0, tslib@npm:^2.3.1, tslib@npm:^2.4.0, tslib@npm:^2.5.0, tslib@npm:^2.6.0, tslib@npm:^2.6.2, tslib@npm:^2.6.3, tslib@npm:^2.8.1":
+"tslib@npm:^2.0.0, tslib@npm:^2.0.3, tslib@npm:^2.1.0, tslib@npm:^2.3.0, tslib@npm:^2.3.1, tslib@npm:^2.4.0, tslib@npm:^2.5.0, tslib@npm:^2.6.0, tslib@npm:^2.6.2, tslib@npm:^2.6.3, tslib@npm:^2.8.1":
   version: 2.8.1
   resolution: "tslib@npm:2.8.1"
   checksum: 10/3e2e043d5c2316461cb54e5c7fe02c30ef6dccb3384717ca22ae5c6b5bc95232a6241df19c622d9c73b809bea33b187f6dbc73030963e29950c2141bc32a79f7
@@ -33101,6 +35443,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"type@npm:^2.7.2":
+  version: 2.7.3
+  resolution: "type@npm:2.7.3"
+  checksum: 10/82e99e7795b3de3ecfe685680685e79a77aea515fad9f60b7c55fbf6d43a5c360b1e6e9443354ec8906b38cdf5325829c69f094cb7cd2a1238e85bef9026dc04
+  languageName: node
+  linkType: hard
+
 "typechain@npm:^8.3.2":
   version: 8.3.2
   resolution: "typechain@npm:8.3.2"
@@ -33445,6 +35794,15 @@ __metadata:
   languageName: node
   linkType: hard
 
+"unidiff@npm:^1.0.2":
+  version: 1.0.4
+  resolution: "unidiff@npm:1.0.4"
+  dependencies:
+    diff: "npm:^5.1.0"
+  checksum: 10/c0771d3107c79ef63446f34c9a3574df9889486fba4f9ce50c1beb51d441d1fbc42b84c9889af68a3806f60560633f1c26a81378b5469e00ec223c99fb238f27
+  languageName: node
+  linkType: hard
+
 "unified@npm:^10.0.0":
   version: 10.1.2
   resolution: "unified@npm:10.1.2"
@@ -33527,6 +35885,15 @@ __metadata:
   languageName: node
   linkType: hard
 
+"unist-util-position-from-estree@npm:^2.0.0":
+  version: 2.0.0
+  resolution: "unist-util-position-from-estree@npm:2.0.0"
+  dependencies:
+    "@types/unist": "npm:^3.0.0"
+  checksum: 10/d3b3048a5727c2367f64ef6dcc5b20c4717215ef8b1372ff9a7c426297c5d1e5776409938acd01531213e2cd2543218d16e73f9f862f318e9496e2c73bb18354
+  languageName: node
+  linkType: hard
+
 "unist-util-position@npm:^4.0.0":
   version: 4.0.4
   resolution: "unist-util-position@npm:4.0.4"
@@ -33801,6 +36168,37 @@ __metadata:
   languageName: node
   linkType: hard
 
+"use-callback-ref@npm:^1.3.3":
+  version: 1.3.3
+  resolution: "use-callback-ref@npm:1.3.3"
+  dependencies:
+    tslib: "npm:^2.0.0"
+  peerDependencies:
+    "@types/react": "*"
+    react: ^16.8.0 || ^17.0.0 || ^18.0.0 || ^19.0.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+  checksum: 10/adf06a7b6a27d3651c325ac9b66d2b82ccacaed7450b85b211d123e91d9a23cb5a587fcc6db5b4fd07ac7233e5abf024d30cf02ddc2ec46bca712151c0836151
+  languageName: node
+  linkType: hard
+
+"use-sidecar@npm:^1.1.3":
+  version: 1.1.3
+  resolution: "use-sidecar@npm:1.1.3"
+  dependencies:
+    detect-node-es: "npm:^1.1.0"
+    tslib: "npm:^2.0.0"
+  peerDependencies:
+    "@types/react": "*"
+    react: ^16.8.0 || ^17.0.0 || ^18.0.0 || ^19.0.0 || ^19.0.0-rc
+  peerDependenciesMeta:
+    "@types/react":
+      optional: true
+  checksum: 10/2fec05eb851cdfc4a4657b1dfb434e686f346c3265ffc9db8a974bb58f8128bd4a708a3cc00e8f51655fccf81822ed4419ebed42f41610589e3aab0cf2492edb
+  languageName: node
+  linkType: hard
+
 "use-sync-external-store@npm:1.2.0":
   version: 1.2.0
   resolution: "use-sync-external-store@npm:1.2.0"
@@ -33919,7 +36317,7 @@ __metadata:
   languageName: node
   linkType: hard
 
-"uvu@npm:^0.5.0":
+"uvu@npm:^0.5.0, uvu@npm:^0.5.6":
   version: 0.5.6
   resolution: "uvu@npm:0.5.6"
   dependencies:

From e7971b869e7f6d4d64d9549762e04cef72a42888 Mon Sep 17 00:00:00 2001
From: kemuru <102478601+kemuru@users.noreply.github.com>
Date: Mon, 15 Sep 2025 19:28:49 +0900
Subject: [PATCH 131/175] fix: styling fixes, hack to make the text flicker
 appear

---
 web/package.json                      |  2 +-
 web/src/components/MarkdownEditor.tsx | 54 ++++++++++++++++++++-------
 yarn.lock                             |  4 +-
 3 files changed, 43 insertions(+), 17 deletions(-)

diff --git a/web/package.json b/web/package.json
index 35e5f6f29..67e989f72 100644
--- a/web/package.json
+++ b/web/package.json
@@ -91,7 +91,7 @@
     "@kleros/ui-components-library": "^2.20.0",
     "@lifi/wallet-management": "^3.7.1",
     "@lifi/widget": "^3.18.1",
-    "@mdxeditor/editor": "^3.44.2",
+    "@mdxeditor/editor": "^3.45.0",
     "@reown/appkit": "^1.7.1",
     "@reown/appkit-adapter-wagmi": "^1.7.1",
     "@sentry/react": "^7.120.0",
diff --git a/web/src/components/MarkdownEditor.tsx b/web/src/components/MarkdownEditor.tsx
index 2a3fdb54e..3bc082c69 100644
--- a/web/src/components/MarkdownEditor.tsx
+++ b/web/src/components/MarkdownEditor.tsx
@@ -31,33 +31,47 @@ import InfoIcon from "svgs/icons/info-circle.svg";
 const Container = styled.div<{ isEmpty: boolean }>`
   width: 100%;
 
-  [class*="mdxeditor"] {
-    background-color: ${({ theme }) => theme.whiteBackground} !important;
+  [class*="mdxeditor-toolbar"] {
+    background-color: ${({ theme }) => theme.lightGrey};
     border: 1px solid ${({ theme }) => theme.stroke} !important;
     border-radius: 3px;
     font-family: "Open Sans", sans-serif;
-  }
 
-  [class*="toolbar"] {
-    background-color: ${({ theme }) => theme.lightGrey} !important;
-    border-bottom: none !important;
+    * svg {
+      color: ${({ theme }) => theme.primaryText} !important;
+    }
 
-    button {
-      color: ${({ theme }) => theme.whiteBackground} !important;
+    [class*="selectTrigger"] {
+      background-color: ${({ theme }) => theme.whiteBackground} !important;
+      color: ${({ theme }) => theme.primaryText} !important;
+      cursor: pointer !important;
     }
 
-    svg {
-      fill: ${({ theme }) => theme.whiteBackground} !important;
+    button:hover {
+      background-color: ${({ theme }) => theme.lightGrey}80 !important;
+      cursor: pointer;
     }
 
-    select {
+    button[data-state="on"],
+    button[aria-pressed="true"] {
       background-color: ${({ theme }) => theme.whiteBackground} !important;
-      color: ${({ theme }) => theme.primaryText} !important;
+    }
+
+    button:disabled,
+    button[data-disabled="true"] {
+      opacity: 0.4 !important;
+      cursor: not-allowed !important;
+
+      svg {
+        color: ${({ theme }) => theme.secondaryText} !important;
+      }
     }
   }
 
   [class*="contentEditable"] {
     background-color: ${({ theme }) => theme.whiteBackground} !important;
+    border: 1px solid ${({ theme }) => theme.stroke} !important;
+    border-radius: 3px;
     color: ${({ theme }) => theme.primaryText} !important;
     min-height: 200px;
     padding: 16px;
@@ -165,7 +179,19 @@ const MarkdownEditor: React.FC<IMarkdownEditor> = ({
   const editorRef = useRef<MDXEditorMethods>(null);
 
   const handleChange = (markdown: string) => {
-    onChange(markdown);
+    const cleanedMarkdown = markdown === "\u200B" ? "" : markdown.replace(/^\u200B/, "");
+    onChange(cleanedMarkdown);
+  };
+
+  const handleContainerClick = () => {
+    if (isEmpty && editorRef.current) {
+      editorRef.current.setMarkdown("\u200B");
+      setTimeout(() => {
+        if (editorRef.current) {
+          editorRef.current.focus();
+        }
+      }, 0);
+    }
   };
 
   const isEmpty = !value || value.trim() === "";
@@ -204,7 +230,7 @@ const MarkdownEditor: React.FC<IMarkdownEditor> = ({
   };
 
   return (
-    <Container isEmpty={isEmpty}>
+    <Container isEmpty={isEmpty} onClick={handleContainerClick}>
       <MDXEditor ref={editorRef} {...editorProps} />
       {showMessage && (
         <MessageContainer>
diff --git a/yarn.lock b/yarn.lock
index ebb0d8076..216a85060 100644
--- a/yarn.lock
+++ b/yarn.lock
@@ -6791,7 +6791,7 @@ __metadata:
     "@kleros/ui-components-library": "npm:^2.20.0"
     "@lifi/wallet-management": "npm:^3.7.1"
     "@lifi/widget": "npm:^3.18.1"
-    "@mdxeditor/editor": "npm:^3.44.2"
+    "@mdxeditor/editor": "npm:^3.45.0"
     "@reown/appkit": "npm:^1.7.1"
     "@reown/appkit-adapter-wagmi": "npm:^1.7.1"
     "@sentry/react": "npm:^7.120.0"
@@ -7635,7 +7635,7 @@ __metadata:
   languageName: node
   linkType: hard
 
-"@mdxeditor/editor@npm:^3.44.2":
+"@mdxeditor/editor@npm:^3.45.0":
   version: 3.45.0
   resolution: "@mdxeditor/editor@npm:3.45.0"
   dependencies:

From 835eea4b21a200d1bf9617f79b0de0841de30b6b Mon Sep 17 00:00:00 2001
From: Harman-singh-waraich <Waraichharman68@gmail.com>
Date: Tue, 16 Sep 2025 15:39:09 +0530
Subject: [PATCH 132/175] chore: deploy-university-subgraph

---
 subgraph/core-university/subgraph.template.yaml |  2 +-
 subgraph/core-university/subgraph.yaml          | 12 +++++++-----
 2 files changed, 8 insertions(+), 6 deletions(-)

diff --git a/subgraph/core-university/subgraph.template.yaml b/subgraph/core-university/subgraph.template.yaml
index 9e83ab0ee..64d26223d 100644
--- a/subgraph/core-university/subgraph.template.yaml
+++ b/subgraph/core-university/subgraph.template.yaml
@@ -157,6 +157,6 @@ dataSources:
       eventHandlers:
         - event: StakeLocked(indexed address,uint256,bool)
           handler: handleStakeLocked
-        - event: StakeSet(indexed address,uint256,uint256,uint256)
+        - event: StakeSet(indexed address,uint256,uint256)
           handler: handleStakeSet
       file: ./src/SortitionModule.ts
diff --git a/subgraph/core-university/subgraph.yaml b/subgraph/core-university/subgraph.yaml
index d820954c8..38b181ffd 100644
--- a/subgraph/core-university/subgraph.yaml
+++ b/subgraph/core-university/subgraph.yaml
@@ -1,5 +1,7 @@
 # THIS FILE IS AUTO-GENERATED BY update.sh FROM subgraph.template.yaml, ANY CHANGES WILL BE LOST.
 specVersion: 0.0.5
+description: Kleros v2 Core University
+repository: https://github.com/kleros/kleros-v2/tree/dev/subgraph/core-university
 schema:
   file: ./schema.graphql
 features:
@@ -65,9 +67,9 @@ dataSources:
     name: PolicyRegistry
     network: arbitrum-sepolia
     source:
-      address: "0x31d067405184d7FaA64b0834511cBcFAF32CdC4b"
+      address: "0xd8681dBF525ecBda2F799BFddB96840065075e8A"
       abi: PolicyRegistry
-      startBlock: 141215158
+      startBlock: 175286057
     mapping:
       kind: ethereum/events
       apiVersion: 0.0.7
@@ -120,9 +122,9 @@ dataSources:
     name: EvidenceModule
     network: arbitrum-sepolia
     source:
-      address: "0x990f44d19a5F46889801B31bf58e0536fBECf27C"
+      address: "0xA1F72e0445fc395A393247F5B8c958Ec9b7C0B49"
       abi: EvidenceModule
-      startBlock: 141215177
+      startBlock: 175286065
     mapping:
       kind: ethereum/events
       apiVersion: 0.0.7
@@ -156,6 +158,6 @@ dataSources:
       eventHandlers:
         - event: StakeLocked(indexed address,uint256,bool)
           handler: handleStakeLocked
-        - event: StakeSet(indexed address,uint256,uint256,uint256)
+        - event: StakeSet(indexed address,uint256,uint256)
           handler: handleStakeSet
       file: ./src/SortitionModule.ts

From d82188a59446ef23c03216238cb589f92fef63dc Mon Sep 17 00:00:00 2001
From: kemuru <102478601+kemuru@users.noreply.github.com>
Date: Tue, 16 Sep 2025 20:08:55 +0900
Subject: [PATCH 133/175] feat: style improvements

---
 web/src/components/MarkdownEditor.tsx   | 138 +++-----------
 web/src/components/MarkdownRenderer.tsx | 160 +----------------
 web/src/styles/mdxEditorTheme.ts        | 230 ++++++++++++++++++++++++
 web/src/utils/markdownSanitization.ts   |  25 +++
 web/src/utils/urlValidation.ts          |  35 ++++
 5 files changed, 321 insertions(+), 267 deletions(-)
 create mode 100644 web/src/styles/mdxEditorTheme.ts
 create mode 100644 web/src/utils/markdownSanitization.ts
 create mode 100644 web/src/utils/urlValidation.ts

diff --git a/web/src/components/MarkdownEditor.tsx b/web/src/components/MarkdownEditor.tsx
index 3bc082c69..5080f69ba 100644
--- a/web/src/components/MarkdownEditor.tsx
+++ b/web/src/components/MarkdownEditor.tsx
@@ -24,113 +24,15 @@ import {
   Separator,
 } from "@mdxeditor/editor";
 
-import "@mdxeditor/editor/style.css";
-
 import InfoIcon from "svgs/icons/info-circle.svg";
 
-const Container = styled.div<{ isEmpty: boolean }>`
-  width: 100%;
+import { sanitizeMarkdown } from "utils/markdownSanitization";
 
-  [class*="mdxeditor-toolbar"] {
-    background-color: ${({ theme }) => theme.lightGrey};
-    border: 1px solid ${({ theme }) => theme.stroke} !important;
-    border-radius: 3px;
-    font-family: "Open Sans", sans-serif;
+import { MDXEditorContainer, MDXEditorGlobalStyles } from "styles/mdxEditorTheme";
 
-    * svg {
-      color: ${({ theme }) => theme.primaryText} !important;
-    }
-
-    [class*="selectTrigger"] {
-      background-color: ${({ theme }) => theme.whiteBackground} !important;
-      color: ${({ theme }) => theme.primaryText} !important;
-      cursor: pointer !important;
-    }
-
-    button:hover {
-      background-color: ${({ theme }) => theme.lightGrey}80 !important;
-      cursor: pointer;
-    }
-
-    button[data-state="on"],
-    button[aria-pressed="true"] {
-      background-color: ${({ theme }) => theme.whiteBackground} !important;
-    }
-
-    button:disabled,
-    button[data-disabled="true"] {
-      opacity: 0.4 !important;
-      cursor: not-allowed !important;
-
-      svg {
-        color: ${({ theme }) => theme.secondaryText} !important;
-      }
-    }
-  }
-
-  [class*="contentEditable"] {
-    background-color: ${({ theme }) => theme.whiteBackground} !important;
-    border: 1px solid ${({ theme }) => theme.stroke} !important;
-    border-radius: 3px;
-    color: ${({ theme }) => theme.primaryText} !important;
-    min-height: 200px;
-    padding: 16px;
-    font-size: 16px;
-    line-height: 1.5;
-
-    p {
-      color: ${({ theme, isEmpty }) => (isEmpty ? theme.secondaryText : theme.primaryText)} !important;
-      margin: 0 0 12px 0;
-    }
-
-    p:empty::before {
-      color: ${({ theme }) => theme.secondaryText} !important;
-      opacity: 0.6 !important;
-    }
-
-    h1,
-    h2,
-    h3,
-    h4,
-    h5,
-    h6 {
-      color: ${({ theme }) => theme.primaryText} !important;
-      font-weight: 600;
-      margin: 16px 0 8px 0;
-    }
-
-    blockquote {
-      color: ${({ theme }) => theme.secondaryText} !important;
-      border-left: 3px solid ${({ theme }) => theme.mediumBlue} !important;
-      font-style: italic;
-      margin: 16px 0;
-      padding-left: 12px;
-    }
-
-    code {
-      background-color: ${({ theme }) => theme.lightGrey} !important;
-      color: ${({ theme }) => theme.primaryText} !important;
-    }
-
-    pre {
-      background-color: ${({ theme }) => theme.lightGrey} !important;
-      color: ${({ theme }) => theme.primaryText} !important;
-    }
-
-    a {
-      color: ${({ theme }) => theme.primaryBlue} !important;
-    }
-
-    th {
-      background-color: ${({ theme }) => theme.lightGrey} !important;
-      color: ${({ theme }) => theme.primaryText} !important;
-    }
+import "@mdxeditor/editor/style.css";
 
-    td {
-      color: ${({ theme }) => theme.primaryText} !important;
-    }
-  }
-`;
+const Container = styled(MDXEditorContainer)<{ isEmpty: boolean }>``;
 
 const MessageContainer = styled.div`
   display: flex;
@@ -180,7 +82,8 @@ const MarkdownEditor: React.FC<IMarkdownEditor> = ({
 
   const handleChange = (markdown: string) => {
     const cleanedMarkdown = markdown === "\u200B" ? "" : markdown.replace(/^\u200B/, "");
-    onChange(cleanedMarkdown);
+    const sanitizedMarkdown = sanitizeMarkdown(cleanedMarkdown);
+    onChange(sanitizedMarkdown);
   };
 
   const handleContainerClick = () => {
@@ -230,19 +133,22 @@ const MarkdownEditor: React.FC<IMarkdownEditor> = ({
   };
 
   return (
-    <Container isEmpty={isEmpty} onClick={handleContainerClick}>
-      <MDXEditor ref={editorRef} {...editorProps} />
-      {showMessage && (
-        <MessageContainer>
-          <StyledInfoIcon />
-          <MessageText>
-            Please provide a comprehensive justification for your decision. Quality explanations are essential for the
-            parties involved and may be eligible for additional compensation in accordance with our justification
-            policy.
-          </MessageText>
-        </MessageContainer>
-      )}
-    </Container>
+    <>
+      <MDXEditorGlobalStyles />
+      <Container isEmpty={isEmpty} onClick={handleContainerClick} role="region" aria-label="Markdown editor">
+        <MDXEditor ref={editorRef} {...editorProps} aria-label="Rich text editor for markdown content" />
+        {showMessage && (
+          <MessageContainer>
+            <StyledInfoIcon />
+            <MessageText>
+              Please provide a comprehensive justification for your decision. Quality explanations are essential for the
+              parties involved and may be eligible for additional compensation in accordance with our justification
+              policy.
+            </MessageText>
+          </MessageContainer>
+        )}
+      </Container>
+    </>
   );
 };
 
diff --git a/web/src/components/MarkdownRenderer.tsx b/web/src/components/MarkdownRenderer.tsx
index 8df425279..1bfe2d0a4 100644
--- a/web/src/components/MarkdownRenderer.tsx
+++ b/web/src/components/MarkdownRenderer.tsx
@@ -1,5 +1,4 @@
 import React from "react";
-import styled from "styled-components";
 
 import {
   MDXEditor,
@@ -13,154 +12,11 @@ import {
   tablePlugin,
 } from "@mdxeditor/editor";
 
-import "@mdxeditor/editor/style.css";
-
-const Container = styled.div`
-  width: 100%;
-
-  [class*="mdxeditor"] {
-    background: transparent !important;
-    border: none !important;
-  }
-
-  [class*="toolbar"] {
-    display: none !important;
-  }
-
-  [class*="contentEditable"] {
-    background: transparent !important;
-    border: none !important;
-    padding: 0 !important;
-    font-size: 16px;
-    line-height: 1.5;
-
-    p {
-      margin: 0 0 12px 0;
-      color: ${({ theme }) => theme.primaryText} !important;
-    }
-
-    p:last-child {
-      margin-bottom: 0;
-    }
-
-    h1,
-    h2,
-    h3,
-    h4,
-    h5,
-    h6 {
-      margin: 16px 0 8px 0;
-      font-weight: 600;
-      color: ${({ theme }) => theme.primaryText} !important;
-    }
-
-    h1 {
-      font-size: 24px;
-    }
-    h2 {
-      font-size: 20px;
-    }
-    h3 {
-      font-size: 18px;
-    }
-    h4 {
-      font-size: 16px;
-    }
-    h5 {
-      font-size: 14px;
-    }
-    h6 {
-      font-size: 12px;
-    }
-
-    ul,
-    ol {
-      margin: 8px 0;
-      padding-left: 24px;
-    }
-
-    li {
-      margin: 4px 0;
-      color: ${({ theme }) => theme.primaryText} !important;
-    }
+import { sanitizeMarkdown } from "utils/markdownSanitization";
 
-    blockquote {
-      border-left: 3px solid ${({ theme }) => theme.mediumBlue} !important;
-      padding-left: 12px;
-      margin: 16px 0;
-      color: ${({ theme }) => theme.secondaryText} !important;
-      font-style: italic;
-    }
+import { MDXRendererContainer } from "styles/mdxEditorTheme";
 
-    code {
-      background-color: ${({ theme }) => theme.lightGrey} !important;
-      color: ${({ theme }) => theme.primaryText} !important;
-      padding: 2px 4px;
-      border-radius: 3px;
-      font-family: "Monaco", "Consolas", monospace;
-      font-size: 14px;
-    }
-
-    pre {
-      background-color: ${({ theme }) => theme.lightGrey} !important;
-      color: ${({ theme }) => theme.primaryText} !important;
-      padding: 12px;
-      border-radius: 3px;
-      overflow-x: auto;
-      margin: 16px 0;
-    }
-
-    pre code {
-      background: transparent !important;
-      padding: 0;
-    }
-
-    table {
-      border-collapse: collapse;
-      width: 100%;
-      margin: 16px 0;
-    }
-
-    th,
-    td {
-      border: 1px solid ${({ theme }) => theme.stroke} !important;
-      padding: 8px 12px;
-      text-align: left;
-      color: ${({ theme }) => theme.primaryText} !important;
-    }
-
-    th {
-      background-color: ${({ theme }) => theme.lightGrey} !important;
-      font-weight: 600;
-    }
-
-    a {
-      color: ${({ theme }) => theme.primaryBlue} !important;
-      text-decoration: none;
-    }
-
-    a:hover {
-      text-decoration: underline;
-      color: ${({ theme }) => theme.secondaryBlue} !important;
-    }
-
-    hr {
-      border: none;
-      border-top: 1px solid ${({ theme }) => theme.stroke} !important;
-      margin: 24px 0;
-    }
-
-    img {
-      max-width: 100%;
-      height: auto;
-    }
-
-    * {
-      cursor: default !important;
-      user-select: text !important;
-    }
-  }
-`;
+import "@mdxeditor/editor/style.css";
 
 interface IMarkdownRenderer {
   content: string;
@@ -172,8 +28,10 @@ const MarkdownRenderer: React.FC<IMarkdownRenderer> = ({ content, className }) =
     return null;
   }
 
+  const sanitizedContent = sanitizeMarkdown(content);
+
   const editorProps: MDXEditorProps = {
-    markdown: content,
+    markdown: sanitizedContent,
     readOnly: true,
     plugins: [
       headingsPlugin(),
@@ -187,9 +45,9 @@ const MarkdownRenderer: React.FC<IMarkdownRenderer> = ({ content, className }) =
   };
 
   return (
-    <Container className={className}>
-      <MDXEditor {...editorProps} />
-    </Container>
+    <MDXRendererContainer className={className} role="region" aria-label="Markdown content">
+      <MDXEditor {...editorProps} aria-label="Rendered markdown content" />
+    </MDXRendererContainer>
   );
 };
 
diff --git a/web/src/styles/mdxEditorTheme.ts b/web/src/styles/mdxEditorTheme.ts
new file mode 100644
index 000000000..16546c6a4
--- /dev/null
+++ b/web/src/styles/mdxEditorTheme.ts
@@ -0,0 +1,230 @@
+import styled, { createGlobalStyle, css } from "styled-components";
+
+const sharedContentStyles = css`
+  .mdxeditor-root-contenteditable p {
+    color: ${({ theme }) => theme.primaryText} !important;
+    margin: 0 0 12px 0;
+  }
+
+  .mdxeditor-root-contenteditable h1,
+  .mdxeditor-root-contenteditable h2,
+  .mdxeditor-root-contenteditable h3,
+  .mdxeditor-root-contenteditable h4,
+  .mdxeditor-root-contenteditable h5,
+  .mdxeditor-root-contenteditable h6 {
+    color: ${({ theme }) => theme.primaryText} !important;
+    font-weight: 600;
+    margin: 16px 0 8px 0;
+  }
+
+  .mdxeditor-root-contenteditable blockquote {
+    color: ${({ theme }) => theme.primaryText} !important;
+    border-left: 3px solid ${({ theme }) => theme.mediumBlue} !important;
+    font-style: italic;
+    margin: 16px 0;
+    padding-left: 12px;
+  }
+
+  .mdxeditor-root-contenteditable pre {
+    background-color: ${({ theme }) => theme.lightGrey} !important;
+    color: ${({ theme }) => theme.primaryText} !important;
+  }
+
+  .mdxeditor-root-contenteditable a {
+    color: ${({ theme }) => theme.primaryBlue} !important;
+  }
+
+  .mdxeditor-root-contenteditable span[class*="_code_"] {
+    background-color: ${({ theme }) => theme.lightGrey} !important;
+    color: ${({ theme }) => theme.secondaryText} !important;
+    padding: 2px 4px;
+    border-radius: 3px;
+    font-size: 0.9em;
+  }
+
+  .mdxeditor-root-contenteditable th {
+    background-color: ${({ theme }) => theme.lightGrey} !important;
+    color: ${({ theme }) => theme.primaryText} !important;
+  }
+
+  .mdxeditor-root-contenteditable td {
+    color: ${({ theme }) => theme.primaryText} !important;
+  }
+`;
+
+export const MDXEditorContainer = styled.div`
+  width: 100%;
+
+  .mdxeditor-toolbar {
+    background-color: ${({ theme }) => theme.lightGrey} !important;
+    border: 1px solid ${({ theme }) => theme.stroke} !important;
+    border-radius: 3px;
+    font-family: "Open Sans", sans-serif;
+  }
+
+  .mdxeditor-toolbar button {
+    color: ${({ theme }) => theme.primaryText} !important;
+  }
+
+  .mdxeditor-toolbar button:hover {
+    background-color: ${({ theme }) => theme.whiteBackground} !important;
+    cursor: pointer !important;
+  }
+
+  .mdxeditor-toolbar button[data-state="on"],
+  .mdxeditor-toolbar button[aria-pressed="true"] {
+    background-color: ${({ theme }) => theme.whiteBackground} !important;
+  }
+
+  .mdxeditor-toolbar button:disabled,
+  .mdxeditor-toolbar button[data-disabled="true"] {
+    opacity: 0.4 !important;
+    cursor: not-allowed !important;
+  }
+
+  .mdxeditor-toolbar button svg {
+    color: ${({ theme }) => theme.primaryText} !important;
+  }
+
+  .mdxeditor-toolbar button:disabled svg,
+  .mdxeditor-toolbar button[data-disabled="true"] svg {
+    color: ${({ theme }) => theme.secondaryText} !important;
+  }
+
+  .mdxeditor-root-contenteditable {
+    background-color: ${({ theme }) => theme.whiteBackground} !important;
+    border: 1px solid ${({ theme }) => theme.stroke} !important;
+    border-radius: 3px;
+    color: ${({ theme }) => theme.primaryText} !important;
+    height: 220px;
+    overflow-y: auto;
+    overflow-x: hidden;
+    padding: 16px;
+    font-size: 16px;
+    line-height: 1.5;
+  }
+
+  [class*="placeholder"] {
+    color: ${({ theme }) => theme.secondaryText} !important;
+    opacity: 0.6 !important;
+    margin-top: 16px;
+  }
+
+  ${sharedContentStyles}
+
+  [class*="tableColumnEditorPopoverContent"],
+  [class*="addRowButton"],
+  [class*="addColumnButton"],
+  [class*="deleteRowButton"],
+  [class*="deleteColumnButton"],
+  [class*="tableEditor"],
+  [class*="tableToolbar"],
+  [class*="tablePopover"] {
+    background-color: ${({ theme }) => theme.whiteBackground} !important;
+
+    svg,
+    path {
+      color: ${({ theme }) => theme.primaryText} !important;
+    }
+  }
+`;
+
+export const MDXEditorGlobalStyles = createGlobalStyle`
+  /* Global styles for all MDXEditor popups and overlays */
+  [class*="linkDialogPopoverContent"],
+  [class*="selectTrigger"],
+  [class*="selectContent"],
+  [class*="tableColumnEditorPopoverContent"],
+  [class*="tablePopover"],
+  [data-radix-popper-content-wrapper] [class*="linkDialog"],
+  [data-radix-popper-content-wrapper] [class*="select"],
+  [data-radix-popper-content-wrapper] [class*="table"],
+  [data-radix-portal] [class*="linkDialog"],
+  [data-radix-portal] [class*="select"],
+  [data-radix-portal] [class*="table"],
+  [data-radix-portal] div[class*="mdx"],
+  [data-radix-popper-content-wrapper] div[class*="mdx"] {
+    background-color: ${({ theme }) => theme.whiteBackground} !important;
+    border: 1px solid ${({ theme }) => theme.stroke} !important;
+    color: ${({ theme }) => theme.primaryText} !important;
+
+    input,
+    select {
+      background-color: ${({ theme }) => theme.whiteBackground} !important;
+      border: 1px solid ${({ theme }) => theme.stroke} !important;
+      color: ${({ theme }) => theme.primaryText} !important;
+
+      &:hover {
+        background-color: ${({ theme }) => theme.lightGrey} !important;
+      }
+    }
+
+    button {
+      background-color: ${({ theme }) => theme.lightGrey} !important;
+      color: ${({ theme }) => theme.primaryText} !important;
+      border: 1px solid ${({ theme }) => theme.stroke} !important;
+      cursor: pointer !important;
+      transition: background-color 0.2s ease !important;
+
+      &:hover {
+        background-color: ${({ theme }) => theme.lightBackground} !important;
+      }
+
+      &:active {
+        background-color: ${({ theme }) => theme.stroke} !important;
+      }
+    }
+
+    label,
+    span,
+    div {
+      color: ${({ theme }) => theme.primaryText} !important;
+    }
+
+    svg,
+    path {
+      color: ${({ theme }) => theme.primaryText} !important;
+    }
+  }
+
+  [class*="mdx"] button,
+  [class*="select"] button,
+  [class*="trigger"],
+  [role="button"],
+  [data-radix-portal] [role="button"],
+  [data-radix-popper-content-wrapper] [role="button"],
+  [data-radix-portal] [data-state],
+  [data-radix-popper-content-wrapper] [data-state] {
+    cursor: pointer !important;
+    transition: all 0.1s ease !important;
+    &:hover {
+      background-color: ${({ theme }) => theme.lightGrey} !important;
+    }
+  }
+`;
+
+export const MDXRendererContainer = styled.div`
+  width: 100%;
+
+  .mdxeditor-toolbar {
+    display: none !important;
+  }
+
+  .mdxeditor-root-contenteditable {
+    background: transparent !important;
+    border: none !important;
+    padding: 0 !important;
+    font-size: 16px;
+    line-height: 1.5;
+  }
+
+  .mdxeditor-root-contenteditable span[class*="_code_"] {
+    background-color: ${({ theme }) => theme.lightGrey} !important;
+    color: ${({ theme }) => theme.secondaryText} !important;
+    padding: 2px 4px;
+    border-radius: 3px;
+    font-size: 0.9em;
+  }
+
+  ${sharedContentStyles}
+`;
diff --git a/web/src/utils/markdownSanitization.ts b/web/src/utils/markdownSanitization.ts
new file mode 100644
index 000000000..39df8da58
--- /dev/null
+++ b/web/src/utils/markdownSanitization.ts
@@ -0,0 +1,25 @@
+import { sanitizeUrl } from "./urlValidation";
+
+export const sanitizeMarkdown = (markdown: string): string => {
+  if (!markdown || typeof markdown !== "string") {
+    return "";
+  }
+
+  return markdown
+    .replace(/\[([^\]]*)\]\(([^)]+)\)/g, (match, text, url) => {
+      const sanitizedUrl = sanitizeUrl(url);
+      return `[${text}](${sanitizedUrl})`;
+    })
+    .replace(/<a\s+href="([^"]*)"[^>]*>([^<]*)<\/a>/gi, (match, url, text) => {
+      const sanitizedUrl = sanitizeUrl(url);
+      return `[${text}](${sanitizedUrl})`;
+    })
+    .replace(/<script[^>]*>.*?<\/script>/gis, "")
+    .replace(/<iframe[^>]*>.*?<\/iframe>/gis, "")
+    .replace(/<object[^>]*>.*?<\/object>/gis, "")
+    .replace(/<embed[^>]*\/?>/gi, "")
+    .replace(/javascript:/gi, "")
+    .replace(/vbscript:/gi, "")
+    .replace(/data:/gi, "")
+    .replace(/on\w+\s*=/gi, "");
+};
diff --git a/web/src/utils/urlValidation.ts b/web/src/utils/urlValidation.ts
new file mode 100644
index 000000000..641490e82
--- /dev/null
+++ b/web/src/utils/urlValidation.ts
@@ -0,0 +1,35 @@
+const DANGEROUS_PROTOCOLS = ["javascript:", "data:", "vbscript:", "file:", "about:"];
+
+const ALLOWED_PROTOCOLS = ["http:", "https:", "mailto:", "tel:", "ftp:"];
+
+export const isValidUrl = (url: string): boolean => {
+  if (!url || typeof url !== "string") {
+    return false;
+  }
+
+  const trimmedUrl = url.trim().toLowerCase();
+
+  if (trimmedUrl.length === 0) {
+    return false;
+  }
+
+  for (const protocol of DANGEROUS_PROTOCOLS) {
+    if (trimmedUrl.startsWith(protocol)) {
+      return false;
+    }
+  }
+
+  try {
+    const urlObj = new URL(url);
+    return ALLOWED_PROTOCOLS.includes(urlObj.protocol);
+  } catch {
+    return false;
+  }
+};
+
+export const sanitizeUrl = (url: string): string => {
+  if (!isValidUrl(url)) {
+    return "#";
+  }
+  return url;
+};

From 79e421002d65dad5ce5ff6c757795e1f67a73d12 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Tue, 16 Sep 2025 15:56:36 +0100
Subject: [PATCH 134/175] fix: university deploy script

---
 .../deploy/00-home-chain-arbitration-university.ts   | 12 ++----------
 1 file changed, 2 insertions(+), 10 deletions(-)

diff --git a/contracts/deploy/00-home-chain-arbitration-university.ts b/contracts/deploy/00-home-chain-arbitration-university.ts
index 5f862575a..057e69cfe 100644
--- a/contracts/deploy/00-home-chain-arbitration-university.ts
+++ b/contracts/deploy/00-home-chain-arbitration-university.ts
@@ -24,15 +24,13 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
 
   await getContractOrDeploy(hre, "TransactionBatcher", { from: deployer, args: [], log: true });
 
-  await deployUpgradable(deployments, "DisputeTemplateRegistryUniversity", {
+  const disputeTemplateRegistry = await deployUpgradable(deployments, "DisputeTemplateRegistryUniversity", {
     from: deployer,
     contract: "DisputeTemplateRegistry",
     args: [deployer],
     log: true,
   });
 
-  return;
-
   const disputeKit = await deployUpgradable(deployments, "DisputeKitClassicUniversity", {
     from: deployer,
     contract: "DisputeKitClassic",
@@ -89,16 +87,10 @@ const deployArbitration: DeployFunction = async (hre: HardhatRuntimeEnvironment)
     console.error("Failed to change currency rates for token, with error:", e);
   }
 
-  const disputeTemplateRegistry = await getContractOrDeployUpgradable(hre, "DisputeTemplateRegistry", {
-    from: deployer,
-    args: [deployer],
-    log: true,
-  });
-
   await deploy("DisputeResolverUniversity", {
     from: deployer,
     contract: "DisputeResolver",
-    args: [core.target, disputeTemplateRegistry.target],
+    args: [core.target, disputeTemplateRegistry.address],
     log: true,
   });
 };

From e1a3d053495048ca49c0a535c74a9d6c5f898bd2 Mon Sep 17 00:00:00 2001
From: kemuru <102478601+kemuru@users.noreply.github.com>
Date: Wed, 17 Sep 2025 01:51:12 +0900
Subject: [PATCH 135/175] chore: comments from ai reviews

---
 .../FileViewer/Viewers/MarkdownViewer.tsx     | 23 ++-----
 web/src/components/MarkdownEditor.tsx         |  6 +-
 web/src/components/MarkdownRenderer.tsx       |  8 ++-
 web/src/utils/markdownSanitization.ts         | 66 ++++++++++++++-----
 web/src/utils/urlValidation.ts                | 20 +++++-
 5 files changed, 87 insertions(+), 36 deletions(-)

diff --git a/web/src/components/FileViewer/Viewers/MarkdownViewer.tsx b/web/src/components/FileViewer/Viewers/MarkdownViewer.tsx
index 0ee77ac37..e7cc14079 100644
--- a/web/src/components/FileViewer/Viewers/MarkdownViewer.tsx
+++ b/web/src/components/FileViewer/Viewers/MarkdownViewer.tsx
@@ -2,23 +2,14 @@ import React from "react";
 import styled from "styled-components";
 
 import { type DocRenderer } from "@cyntler/react-doc-viewer";
-import ReactMarkdown from "react-markdown";
+
+import MarkdownRenderer from "../../MarkdownRenderer";
 
 const Container = styled.div`
   padding: 16px;
 `;
 
-const StyledMarkdown = styled(ReactMarkdown)`
-  background-color: ${({ theme }) => theme.whiteBackground};
-  a {
-    font-size: 16px;
-  }
-  code {
-    color: ${({ theme }) => theme.secondaryText};
-  }
-`;
-
-const MarkdownRenderer: DocRenderer = ({ mainState: { currentDocument } }) => {
+const MarkdownDocRenderer: DocRenderer = ({ mainState: { currentDocument } }) => {
   if (!currentDocument) return null;
   const base64String = (currentDocument.fileData as string).split(",")[1];
 
@@ -27,12 +18,12 @@ const MarkdownRenderer: DocRenderer = ({ mainState: { currentDocument } }) => {
 
   return (
     <Container id="md-renderer">
-      <StyledMarkdown>{decodedData}</StyledMarkdown>
+      <MarkdownRenderer content={decodedData} />
     </Container>
   );
 };
 
-MarkdownRenderer.fileTypes = ["md", "text/plain"];
-MarkdownRenderer.weight = 1;
+MarkdownDocRenderer.fileTypes = ["md", "text/plain"];
+MarkdownDocRenderer.weight = 1;
 
-export default MarkdownRenderer;
+export default MarkdownDocRenderer;
diff --git a/web/src/components/MarkdownEditor.tsx b/web/src/components/MarkdownEditor.tsx
index 5080f69ba..002dd0aa2 100644
--- a/web/src/components/MarkdownEditor.tsx
+++ b/web/src/components/MarkdownEditor.tsx
@@ -27,6 +27,7 @@ import {
 import InfoIcon from "svgs/icons/info-circle.svg";
 
 import { sanitizeMarkdown } from "utils/markdownSanitization";
+import { isValidUrl } from "utils/urlValidation";
 
 import { MDXEditorContainer, MDXEditorGlobalStyles } from "styles/mdxEditorTheme";
 
@@ -103,13 +104,16 @@ const MarkdownEditor: React.FC<IMarkdownEditor> = ({
     markdown: value,
     onChange: handleChange,
     placeholder,
+    suppressHtmlProcessing: true,
     plugins: [
       headingsPlugin(),
       listsPlugin(),
       quotePlugin(),
       thematicBreakPlugin(),
       markdownShortcutPlugin(),
-      linkPlugin(),
+      linkPlugin({
+        validateUrl: (url) => isValidUrl(url),
+      }),
       linkDialogPlugin(),
       tablePlugin(),
       toolbarPlugin({
diff --git a/web/src/components/MarkdownRenderer.tsx b/web/src/components/MarkdownRenderer.tsx
index 1bfe2d0a4..6ddcbe97e 100644
--- a/web/src/components/MarkdownRenderer.tsx
+++ b/web/src/components/MarkdownRenderer.tsx
@@ -10,9 +10,11 @@ import {
   markdownShortcutPlugin,
   linkPlugin,
   tablePlugin,
+  codeBlockPlugin,
 } from "@mdxeditor/editor";
 
 import { sanitizeMarkdown } from "utils/markdownSanitization";
+import { isValidUrl } from "utils/urlValidation";
 
 import { MDXRendererContainer } from "styles/mdxEditorTheme";
 
@@ -33,14 +35,18 @@ const MarkdownRenderer: React.FC<IMarkdownRenderer> = ({ content, className }) =
   const editorProps: MDXEditorProps = {
     markdown: sanitizedContent,
     readOnly: true,
+    suppressHtmlProcessing: true,
     plugins: [
       headingsPlugin(),
       listsPlugin(),
       quotePlugin(),
       thematicBreakPlugin(),
       markdownShortcutPlugin(),
-      linkPlugin(),
+      linkPlugin({
+        validateUrl: (url) => isValidUrl(url),
+      }),
       tablePlugin(),
+      codeBlockPlugin({ defaultCodeBlockLanguage: "text" }),
     ],
   };
 
diff --git a/web/src/utils/markdownSanitization.ts b/web/src/utils/markdownSanitization.ts
index 39df8da58..36178a2d7 100644
--- a/web/src/utils/markdownSanitization.ts
+++ b/web/src/utils/markdownSanitization.ts
@@ -1,25 +1,57 @@
 import { sanitizeUrl } from "./urlValidation";
 
+const sanitizeRepeated = (text: string, pattern: RegExp, replacement: string): string => {
+  let result = text;
+  let previousResult;
+  do {
+    previousResult = result;
+    result = result.replace(pattern, replacement);
+  } while (result !== previousResult);
+  return result;
+};
+
 export const sanitizeMarkdown = (markdown: string): string => {
   if (!markdown || typeof markdown !== "string") {
     return "";
   }
 
-  return markdown
-    .replace(/\[([^\]]*)\]\(([^)]+)\)/g, (match, text, url) => {
-      const sanitizedUrl = sanitizeUrl(url);
-      return `[${text}](${sanitizedUrl})`;
-    })
-    .replace(/<a\s+href="([^"]*)"[^>]*>([^<]*)<\/a>/gi, (match, url, text) => {
-      const sanitizedUrl = sanitizeUrl(url);
-      return `[${text}](${sanitizedUrl})`;
-    })
-    .replace(/<script[^>]*>.*?<\/script>/gis, "")
-    .replace(/<iframe[^>]*>.*?<\/iframe>/gis, "")
-    .replace(/<object[^>]*>.*?<\/object>/gis, "")
-    .replace(/<embed[^>]*\/?>/gi, "")
-    .replace(/javascript:/gi, "")
-    .replace(/vbscript:/gi, "")
-    .replace(/data:/gi, "")
-    .replace(/on\w+\s*=/gi, "");
+  let sanitized = markdown;
+
+  sanitized = sanitized.replace(/\[([^\]]*)\]\(([^)]+)\)/g, (match, text, url) => {
+    const sanitizedUrl = sanitizeUrl(url);
+    return `[${text}](${sanitizedUrl})`;
+  });
+
+  sanitized = sanitized.replace(/<a\s+href="([^"]*)"[^>]*>([^<]*)<\/a>/gi, (match, url, text) => {
+    const sanitizedUrl = sanitizeUrl(url);
+    return `[${text}](${sanitizedUrl})`;
+  });
+
+  sanitized = sanitizeRepeated(sanitized, /<script[^>]*>.*?<\/script>/gis, "");
+  sanitized = sanitizeRepeated(sanitized, /<iframe[^>]*>.*?<\/iframe>/gis, "");
+  sanitized = sanitizeRepeated(sanitized, /<object[^>]*>.*?<\/object>/gis, "");
+  sanitized = sanitizeRepeated(sanitized, /<embed[^>]*\/?>/gi, "");
+  sanitized = sanitizeRepeated(sanitized, /<form[^>]*>.*?<\/form>/gis, "");
+  sanitized = sanitizeRepeated(sanitized, /<input[^>]*\/?>/gi, "");
+  sanitized = sanitizeRepeated(sanitized, /<button[^>]*>.*?<\/button>/gis, "");
+  sanitized = sanitizeRepeated(sanitized, /<applet[^>]*>.*?<\/applet>/gis, "");
+  sanitized = sanitizeRepeated(sanitized, /<audio[^>]*>.*?<\/audio>/gis, "");
+  sanitized = sanitizeRepeated(sanitized, /<video[^>]*>.*?<\/video>/gis, "");
+  sanitized = sanitizeRepeated(sanitized, /<svg[^>]*>.*?<\/svg>/gis, "");
+  sanitized = sanitizeRepeated(sanitized, /<canvas[^>]*>.*?<\/canvas>/gis, "");
+
+  sanitized = sanitizeRepeated(sanitized, /javascript:/gi, "");
+  sanitized = sanitizeRepeated(sanitized, /vbscript:/gi, "");
+
+  sanitized = sanitizeRepeated(sanitized, /on\w+\s*=/gi, "");
+  sanitized = sanitizeRepeated(sanitized, /style\s*=/gi, "");
+
+  sanitized = sanitizeRepeated(sanitized, /<meta[^>]*\/?>/gi, "");
+  sanitized = sanitizeRepeated(sanitized, /<link[^>]*\/?>/gi, "");
+  sanitized = sanitizeRepeated(sanitized, /<base[^>]*\/?>/gi, "");
+
+  sanitized = sanitized.replace(/&#x[0-9a-f]+;/gi, "");
+  sanitized = sanitized.replace(/&#[0-9]+;/gi, "");
+
+  return sanitized;
 };
diff --git a/web/src/utils/urlValidation.ts b/web/src/utils/urlValidation.ts
index 641490e82..115f5bef8 100644
--- a/web/src/utils/urlValidation.ts
+++ b/web/src/utils/urlValidation.ts
@@ -1,7 +1,21 @@
-const DANGEROUS_PROTOCOLS = ["javascript:", "data:", "vbscript:", "file:", "about:"];
+const DANGEROUS_PROTOCOLS = ["javascript:", "vbscript:", "file:", "about:", "blob:", "filesystem:"];
 
 const ALLOWED_PROTOCOLS = ["http:", "https:", "mailto:", "tel:", "ftp:"];
 
+const ALLOWED_DATA_TYPES = ["image/jpeg", "image/png", "image/gif", "image/webp", "image/svg+xml"];
+
+const isValidDataUri = (url: string): boolean => {
+  const dataUriRegex = /^data:([^;,]+)(;base64)?,/i;
+  const match = url.match(dataUriRegex);
+
+  if (!match) {
+    return false;
+  }
+
+  const mimeType = match[1].toLowerCase();
+  return ALLOWED_DATA_TYPES.includes(mimeType);
+};
+
 export const isValidUrl = (url: string): boolean => {
   if (!url || typeof url !== "string") {
     return false;
@@ -13,6 +27,10 @@ export const isValidUrl = (url: string): boolean => {
     return false;
   }
 
+  if (trimmedUrl.startsWith("data:")) {
+    return isValidDataUri(trimmedUrl);
+  }
+
   for (const protocol of DANGEROUS_PROTOCOLS) {
     if (trimmedUrl.startsWith(protocol)) {
       return false;

From 9d4b2868dd2bf13338efa0b1f013268f8cca7186 Mon Sep 17 00:00:00 2001
From: kemuru <102478601+kemuru@users.noreply.github.com>
Date: Wed, 17 Sep 2025 03:06:19 +0900
Subject: [PATCH 136/175] feat: link popup warning, clean up codes

---
 web/src/components/ExternalLinkWarning.tsx | 168 +++++++++++++++++++++
 web/src/components/MarkdownRenderer.tsx    |  93 +++++++++++-
 web/src/utils/linkUtils.ts                 |  28 ++++
 3 files changed, 281 insertions(+), 8 deletions(-)
 create mode 100644 web/src/components/ExternalLinkWarning.tsx
 create mode 100644 web/src/utils/linkUtils.ts

diff --git a/web/src/components/ExternalLinkWarning.tsx b/web/src/components/ExternalLinkWarning.tsx
new file mode 100644
index 000000000..96efe70c6
--- /dev/null
+++ b/web/src/components/ExternalLinkWarning.tsx
@@ -0,0 +1,168 @@
+import React from "react";
+import styled, { css } from "styled-components";
+
+import Modal from "react-modal";
+
+import { Button } from "@kleros/ui-components-library";
+
+import WarningIcon from "svgs/icons/warning-outline.svg";
+
+import { landscapeStyle } from "styles/landscapeStyle";
+
+const StyledModal = styled(Modal)`
+  position: absolute;
+  top: 50%;
+  left: 50%;
+  right: auto;
+  bottom: auto;
+  margin-right: -50%;
+  transform: translate(-50%, -50%);
+  height: auto;
+  width: min(90%, 480px);
+  border: 1px solid ${({ theme }) => theme.stroke};
+  border-radius: 8px;
+  background-color: ${({ theme }) => theme.whiteBackground};
+  padding: 32px;
+  box-shadow: 0 4px 16px rgba(0, 0, 0, 0.1);
+  z-index: 10002;
+`;
+
+const Overlay = styled.div`
+  position: fixed;
+  top: 0;
+  left: 0;
+  right: 0;
+  bottom: 0;
+  background-color: rgba(0, 0, 0, 0.5);
+  z-index: 10001;
+`;
+
+const Header = styled.div`
+  display: flex;
+  align-items: center;
+  gap: 12px;
+  margin-bottom: 16px;
+`;
+
+const StyledWarningIcon = styled(WarningIcon)`
+  width: 24px;
+  height: 24px;
+  fill: ${({ theme }) => theme.warning};
+`;
+
+const Title = styled.h3`
+  color: ${({ theme }) => theme.primaryText};
+  font-size: 18px;
+  font-weight: 600;
+  margin: 0;
+`;
+
+const Message = styled.p`
+  color: ${({ theme }) => theme.primaryText};
+  font-size: 14px;
+  line-height: 1.5;
+  margin: 0 0 16px 0;
+`;
+
+const UrlContainer = styled.div`
+  background-color: ${({ theme }) => theme.lightGrey};
+  border: 1px solid ${({ theme }) => theme.stroke};
+  border-radius: 4px;
+  padding: 12px;
+  margin: 16px 0;
+  word-break: break-all;
+`;
+
+const Url = styled.code`
+  color: ${({ theme }) => theme.secondaryText};
+  font-size: 13px;
+  font-family: monospace;
+`;
+
+const ButtonContainer = styled.div`
+  display: flex;
+  gap: 12px;
+  justify-content: center;
+  flex-wrap: wrap;
+  margin-top: 24px;
+
+  ${landscapeStyle(
+    () => css`
+      justify-content: flex-end;
+    `
+  )}
+`;
+
+const CancelButton = styled(Button)`
+  background-color: ${({ theme }) => theme.whiteBackground};
+  border: 1px solid ${({ theme }) => theme.stroke};
+
+  p {
+    color: ${({ theme }) => theme.primaryText} !important;
+  }
+
+  &:hover {
+    background-color: ${({ theme }) => theme.mediumBlue};
+  }
+`;
+
+const ConfirmButton = styled(Button)`
+  background-color: ${({ theme }) => theme.warning};
+  color: ${({ theme }) => theme.whiteBackground};
+  border: 1px solid ${({ theme }) => theme.warning};
+
+  &:hover {
+    background-color: ${({ theme }) => theme.warning}BB;
+  }
+`;
+
+interface IExternalLinkWarning {
+  isOpen: boolean;
+  url: string;
+  onConfirm: () => void;
+  onCancel: () => void;
+}
+
+const ExternalLinkWarning: React.FC<IExternalLinkWarning> = ({ isOpen, url, onConfirm, onCancel }) => {
+  return (
+    <StyledModal
+      isOpen={isOpen}
+      onRequestClose={onCancel}
+      overlayElement={(props, contentElement) => <Overlay {...props}>{contentElement}</Overlay>}
+      ariaHideApp={false}
+      role="dialog"
+      aria-labelledby="external-link-title"
+      aria-describedby="external-link-description"
+    >
+      <Header>
+        <StyledWarningIcon />
+        <Title id="external-link-title">External Link Warning</Title>
+      </Header>
+
+      <Message id="external-link-description">
+        You are about to navigate to an external website. Please verify the URL before proceeding to ensure it&apos;s
+        safe and legitimate.
+      </Message>
+
+      <UrlContainer>
+        <Url>{url}</Url>
+      </UrlContainer>
+
+      <Message>
+        <strong>Safety Tips:</strong>
+        <br />
+        • Verify the domain name is correct
+        <br />
+        • Check for suspicious characters or typos
+        <br />• Only proceed if you trust this destination
+      </Message>
+
+      <ButtonContainer>
+        <CancelButton text="Cancel" onClick={onCancel} />
+        <ConfirmButton text="Continue to External Site" onClick={onConfirm} />
+      </ButtonContainer>
+    </StyledModal>
+  );
+};
+
+export default ExternalLinkWarning;
diff --git a/web/src/components/MarkdownRenderer.tsx b/web/src/components/MarkdownRenderer.tsx
index 6ddcbe97e..b885acce5 100644
--- a/web/src/components/MarkdownRenderer.tsx
+++ b/web/src/components/MarkdownRenderer.tsx
@@ -1,4 +1,5 @@
-import React from "react";
+import React, { useCallback, useEffect, useRef, useState } from "react";
+import styled from "styled-components";
 
 import {
   MDXEditor,
@@ -13,11 +14,33 @@ import {
   codeBlockPlugin,
 } from "@mdxeditor/editor";
 
+import { isExternalLink } from "utils/linkUtils";
 import { sanitizeMarkdown } from "utils/markdownSanitization";
 import { isValidUrl } from "utils/urlValidation";
 
 import { MDXRendererContainer } from "styles/mdxEditorTheme";
 
+import ExternalLinkWarning from "components/ExternalLinkWarning";
+
+const LinkInterceptorContainer = styled(MDXRendererContainer)`
+  a {
+    pointer-events: none;
+    cursor: pointer;
+    position: relative;
+
+    &::after {
+      content: "";
+      position: absolute;
+      top: 0;
+      left: 0;
+      width: 100%;
+      height: 100%;
+      pointer-events: auto;
+      cursor: pointer;
+    }
+  }
+`;
+
 import "@mdxeditor/editor/style.css";
 
 interface IMarkdownRenderer {
@@ -26,6 +49,54 @@ interface IMarkdownRenderer {
 }
 
 const MarkdownRenderer: React.FC<IMarkdownRenderer> = ({ content, className }) => {
+  const [isWarningOpen, setIsWarningOpen] = useState(false);
+  const [pendingUrl, setPendingUrl] = useState("");
+  const containerRef = useRef<HTMLDivElement>(null);
+
+  const handleExternalLink = useCallback((url: string) => {
+    setPendingUrl(url);
+    setIsWarningOpen(true);
+  }, []);
+
+  const handleConfirmNavigation = useCallback(() => {
+    if (pendingUrl) {
+      window.open(pendingUrl, "_blank", "noopener,noreferrer");
+    }
+    setIsWarningOpen(false);
+    setPendingUrl("");
+  }, [pendingUrl]);
+
+  const handleCancelNavigation = useCallback(() => {
+    setIsWarningOpen(false);
+    setPendingUrl("");
+  }, []);
+
+  useEffect(() => {
+    const container = containerRef.current;
+    if (!container) return;
+
+    const handleClick = (event: Event) => {
+      const linkElement = (event.target as HTMLElement).closest("a") as HTMLAnchorElement | null;
+
+      if (linkElement) {
+        const href = linkElement.getAttribute("href") || linkElement.href;
+        if (href && isValidUrl(href) && isExternalLink(href)) {
+          event.preventDefault();
+          event.stopImmediatePropagation();
+          handleExternalLink(href);
+        }
+      }
+    };
+
+    container.addEventListener("click", handleClick, true);
+    document.addEventListener("click", handleClick, true);
+
+    return () => {
+      container.removeEventListener("click", handleClick, true);
+      document.removeEventListener("click", handleClick, true);
+    };
+  }, [handleExternalLink]);
+
   if (!content || content.trim() === "") {
     return null;
   }
@@ -35,25 +106,31 @@ const MarkdownRenderer: React.FC<IMarkdownRenderer> = ({ content, className }) =
   const editorProps: MDXEditorProps = {
     markdown: sanitizedContent,
     readOnly: true,
-    suppressHtmlProcessing: true,
+    suppressHtmlProcessing: false,
     plugins: [
       headingsPlugin(),
       listsPlugin(),
       quotePlugin(),
       thematicBreakPlugin(),
       markdownShortcutPlugin(),
-      linkPlugin({
-        validateUrl: (url) => isValidUrl(url),
-      }),
+      linkPlugin({ validateUrl: isValidUrl }),
       tablePlugin(),
       codeBlockPlugin({ defaultCodeBlockLanguage: "text" }),
     ],
   };
 
   return (
-    <MDXRendererContainer className={className} role="region" aria-label="Markdown content">
-      <MDXEditor {...editorProps} aria-label="Rendered markdown content" />
-    </MDXRendererContainer>
+    <>
+      <LinkInterceptorContainer ref={containerRef} className={className} role="region" aria-label="Markdown content">
+        <MDXEditor {...editorProps} aria-label="Rendered markdown content" />
+      </LinkInterceptorContainer>
+      <ExternalLinkWarning
+        isOpen={isWarningOpen}
+        url={pendingUrl}
+        onConfirm={handleConfirmNavigation}
+        onCancel={handleCancelNavigation}
+      />
+    </>
   );
 };
 
diff --git a/web/src/utils/linkUtils.ts b/web/src/utils/linkUtils.ts
new file mode 100644
index 000000000..e926d70f0
--- /dev/null
+++ b/web/src/utils/linkUtils.ts
@@ -0,0 +1,28 @@
+export const isExternalLink = (url: string): boolean => {
+  if (!url || typeof url !== "string") {
+    return false;
+  }
+
+  const trimmedUrl = url.trim();
+
+  if (trimmedUrl.startsWith("/") || trimmedUrl.startsWith("./") || trimmedUrl.startsWith("../")) {
+    return false;
+  }
+
+  if (trimmedUrl.startsWith("#")) {
+    return false;
+  }
+
+  if (trimmedUrl.startsWith("mailto:") || trimmedUrl.startsWith("tel:")) {
+    return true;
+  }
+
+  try {
+    const currentOrigin = window.location.origin;
+    const linkUrl = new URL(trimmedUrl, currentOrigin);
+
+    return linkUrl.origin !== currentOrigin;
+  } catch {
+    return true;
+  }
+};

From e3dc195c367f64c3680383ce6a8d31dbbdeaa1da Mon Sep 17 00:00:00 2001
From: Marino <102478601+kemuru@users.noreply.github.com>
Date: Wed, 17 Sep 2025 13:28:42 +0900
Subject: [PATCH 137/175] Potential fix for code scanning alert no. 96: Bad
 HTML filtering regexp

Co-authored-by: Copilot Autofix powered by AI <62310815+github-advanced-security[bot]@users.noreply.github.com>
---
 web/package.json                      |  4 ++-
 web/src/utils/markdownSanitization.ts | 41 +++++++++++++--------------
 2 files changed, 22 insertions(+), 23 deletions(-)

diff --git a/web/package.json b/web/package.json
index 67e989f72..51a386fd2 100644
--- a/web/package.json
+++ b/web/package.json
@@ -131,6 +131,8 @@
     "styled-components": "^5.3.3",
     "subgraph-status": "^1.2.4",
     "viem": "^2.24.1",
-    "wagmi": "^2.14.15"
+    "wagmi": "^2.14.15",
+    "dompurify": "^3.2.6",
+    "@types/dompurify": "^3.2.0"
   }
 }
diff --git a/web/src/utils/markdownSanitization.ts b/web/src/utils/markdownSanitization.ts
index 36178a2d7..d8e5d1cd0 100644
--- a/web/src/utils/markdownSanitization.ts
+++ b/web/src/utils/markdownSanitization.ts
@@ -1,4 +1,5 @@
 import { sanitizeUrl } from "./urlValidation";
+import DOMPurify from "dompurify";
 
 const sanitizeRepeated = (text: string, pattern: RegExp, replacement: string): string => {
   let result = text;
@@ -27,29 +28,25 @@ export const sanitizeMarkdown = (markdown: string): string => {
     return `[${text}](${sanitizedUrl})`;
   });
 
-  sanitized = sanitizeRepeated(sanitized, /<script[^>]*>.*?<\/script>/gis, "");
-  sanitized = sanitizeRepeated(sanitized, /<iframe[^>]*>.*?<\/iframe>/gis, "");
-  sanitized = sanitizeRepeated(sanitized, /<object[^>]*>.*?<\/object>/gis, "");
-  sanitized = sanitizeRepeated(sanitized, /<embed[^>]*\/?>/gi, "");
-  sanitized = sanitizeRepeated(sanitized, /<form[^>]*>.*?<\/form>/gis, "");
-  sanitized = sanitizeRepeated(sanitized, /<input[^>]*\/?>/gi, "");
-  sanitized = sanitizeRepeated(sanitized, /<button[^>]*>.*?<\/button>/gis, "");
-  sanitized = sanitizeRepeated(sanitized, /<applet[^>]*>.*?<\/applet>/gis, "");
-  sanitized = sanitizeRepeated(sanitized, /<audio[^>]*>.*?<\/audio>/gis, "");
-  sanitized = sanitizeRepeated(sanitized, /<video[^>]*>.*?<\/video>/gis, "");
-  sanitized = sanitizeRepeated(sanitized, /<svg[^>]*>.*?<\/svg>/gis, "");
-  sanitized = sanitizeRepeated(sanitized, /<canvas[^>]*>.*?<\/canvas>/gis, "");
-
-  sanitized = sanitizeRepeated(sanitized, /javascript:/gi, "");
-  sanitized = sanitizeRepeated(sanitized, /vbscript:/gi, "");
-
-  sanitized = sanitizeRepeated(sanitized, /on\w+\s*=/gi, "");
-  sanitized = sanitizeRepeated(sanitized, /style\s*=/gi, "");
-
-  sanitized = sanitizeRepeated(sanitized, /<meta[^>]*\/?>/gi, "");
-  sanitized = sanitizeRepeated(sanitized, /<link[^>]*\/?>/gi, "");
-  sanitized = sanitizeRepeated(sanitized, /<base[^>]*\/?>/gi, "");
+  // Use DOMPurify to sanitize dangerous HTML tags and attributes
+  sanitized = DOMPurify.sanitize(sanitized, {
+    ALLOWED_TAGS: [
+      // Allow only safe tags that are valid in Markdown output;
+      // Configure to disallow script, iframe, object, embed, form, input, button, applet, audio, video, svg, canvas, meta, link, base
+      "b", "i", "em", "strong", "a", "p", "ul", "ol", "li", "blockquote", "code", "pre", "span", "br", "hr", "img"
+    ],
+    ALLOWED_ATTR: ["href", "src", "alt", "title"], // No style, no event handlers
+    FORBID_TAGS: [
+      "script", "iframe", "object", "embed", "form", "input", "button", "applet", "audio", "video", "svg", "canvas", "meta", "link", "base"
+    ],
+    FORBID_ATTR: [
+      "onerror", "onload", "onclick", "style"
+    ]
+  });
 
+  // Optional: Remove encoded protocols/entities as before
+  sanitized = sanitized.replace(/javascript:/gi, "");
+  sanitized = sanitized.replace(/vbscript:/gi, "");
   sanitized = sanitized.replace(/&#x[0-9a-f]+;/gi, "");
   sanitized = sanitized.replace(/&#[0-9]+;/gi, "");
 

From 942fa9e0e08c62674246cea64fbc1f36e004d52a Mon Sep 17 00:00:00 2001
From: kemuru <102478601+kemuru@users.noreply.github.com>
Date: Wed, 17 Sep 2025 14:05:06 +0900
Subject: [PATCH 138/175] chore: dompurify in packagejson

---
 web/package.json |  6 +++---
 yarn.lock        | 25 ++++++++++++++++++++++++-
 2 files changed, 27 insertions(+), 4 deletions(-)

diff --git a/web/package.json b/web/package.json
index 51a386fd2..7dc2aeb14 100644
--- a/web/package.json
+++ b/web/package.json
@@ -100,6 +100,7 @@
     "@solana/wallet-adapter-react": "^0.15.36",
     "@solana/web3.js": "^1.98.0",
     "@tanstack/react-query": "^5.69.0",
+    "@types/dompurify": "^3.2.0",
     "@types/react-modal": "^3.16.3",
     "@wagmi/connectors": "^5.7.11",
     "@wagmi/core": "^2.16.7",
@@ -108,6 +109,7 @@
     "chartjs-adapter-moment": "^1.0.1",
     "chartjs-plugin-datalabels": "^2.2.0",
     "core-js": "^3.39.0",
+    "dompurify": "^3.2.6",
     "ethers": "^5.8.0",
     "graphql": "^16.9.0",
     "graphql-request": "^7.1.2",
@@ -131,8 +133,6 @@
     "styled-components": "^5.3.3",
     "subgraph-status": "^1.2.4",
     "viem": "^2.24.1",
-    "wagmi": "^2.14.15",
-    "dompurify": "^3.2.6",
-    "@types/dompurify": "^3.2.0"
+    "wagmi": "^2.14.15"
   }
 }
diff --git a/yarn.lock b/yarn.lock
index 216a85060..9d8559478 100644
--- a/yarn.lock
+++ b/yarn.lock
@@ -6801,6 +6801,7 @@ __metadata:
     "@solana/web3.js": "npm:^1.98.0"
     "@tanstack/react-query": "npm:^5.69.0"
     "@types/busboy": "npm:^1.5.4"
+    "@types/dompurify": "npm:^3.2.0"
     "@types/react": "npm:^18.3.12"
     "@types/react-dom": "npm:^18.3.1"
     "@types/react-modal": "npm:^3.16.3"
@@ -6816,6 +6817,7 @@ __metadata:
     chartjs-adapter-moment: "npm:^1.0.1"
     chartjs-plugin-datalabels: "npm:^2.2.0"
     core-js: "npm:^3.39.0"
+    dompurify: "npm:^3.2.6"
     eslint: "npm:^9.15.0"
     eslint-config-prettier: "npm:^9.1.0"
     eslint-import-resolver-typescript: "npm:^3.6.3"
@@ -11750,6 +11752,15 @@ __metadata:
   languageName: node
   linkType: hard
 
+"@types/dompurify@npm:^3.2.0":
+  version: 3.2.0
+  resolution: "@types/dompurify@npm:3.2.0"
+  dependencies:
+    dompurify: "npm:*"
+  checksum: 10/0194dd9024e76e856f3373e8b080c7a5ac9910543ac1ee85db45277efbbea820b2f27fe22c8a6f02bb51833e0a8540d732be0d11d156efd16cb0b97f88e41ebf
+  languageName: node
+  linkType: hard
+
 "@types/eslint-scope@npm:^3.7.3":
   version: 3.7.4
   resolution: "@types/eslint-scope@npm:3.7.4"
@@ -12291,7 +12302,7 @@ __metadata:
   languageName: node
   linkType: hard
 
-"@types/trusted-types@npm:*, @types/trusted-types@npm:^2.0.2":
+"@types/trusted-types@npm:*, @types/trusted-types@npm:^2.0.2, @types/trusted-types@npm:^2.0.7":
   version: 2.0.7
   resolution: "@types/trusted-types@npm:2.0.7"
   checksum: 10/8e4202766a65877efcf5d5a41b7dd458480b36195e580a3b1085ad21e948bc417d55d6f8af1fd2a7ad008015d4117d5fdfe432731157da3c68678487174e4ba3
@@ -18413,6 +18424,18 @@ __metadata:
   languageName: node
   linkType: hard
 
+"dompurify@npm:*, dompurify@npm:^3.2.6":
+  version: 3.2.6
+  resolution: "dompurify@npm:3.2.6"
+  dependencies:
+    "@types/trusted-types": "npm:^2.0.7"
+  dependenciesMeta:
+    "@types/trusted-types":
+      optional: true
+  checksum: 10/b91631ed0e4d17fae950ef53613cc009ed7e73adc43ac94a41dd52f35483f7538d13caebdafa7626e0da145fc8184e7ac7935f14f25b7e841b32fda777e40447
+  languageName: node
+  linkType: hard
+
 "dompurify@npm:2.5.7":
   version: 2.5.7
   resolution: "dompurify@npm:2.5.7"

From 20ae3a4188784edd4b3cc9aaed1887b040b241a7 Mon Sep 17 00:00:00 2001
From: Marino <102478601+kemuru@users.noreply.github.com>
Date: Wed, 17 Sep 2025 14:06:24 +0900
Subject: [PATCH 139/175] Potential fix for code scanning alert no. 97:
 Incomplete URL scheme check

Co-authored-by: Copilot Autofix powered by AI <62310815+github-advanced-security[bot]@users.noreply.github.com>
---
 web/src/utils/markdownSanitization.ts | 1 +
 1 file changed, 1 insertion(+)

diff --git a/web/src/utils/markdownSanitization.ts b/web/src/utils/markdownSanitization.ts
index d8e5d1cd0..6e21f8eda 100644
--- a/web/src/utils/markdownSanitization.ts
+++ b/web/src/utils/markdownSanitization.ts
@@ -47,6 +47,7 @@ export const sanitizeMarkdown = (markdown: string): string => {
   // Optional: Remove encoded protocols/entities as before
   sanitized = sanitized.replace(/javascript:/gi, "");
   sanitized = sanitized.replace(/vbscript:/gi, "");
+  sanitized = sanitized.replace(/data:/gi, "");
   sanitized = sanitized.replace(/&#x[0-9a-f]+;/gi, "");
   sanitized = sanitized.replace(/&#[0-9]+;/gi, "");
 

From e2d7c8157b4a4d1858cbdc4102f8c1599cbb0e24 Mon Sep 17 00:00:00 2001
From: kemuru <102478601+kemuru@users.noreply.github.com>
Date: Wed, 17 Sep 2025 15:21:19 +0900
Subject: [PATCH 140/175] feat: max height and scrollable on mobile

---
 web/src/components/ExternalLinkWarning.tsx | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/web/src/components/ExternalLinkWarning.tsx b/web/src/components/ExternalLinkWarning.tsx
index 96efe70c6..ce2373dab 100644
--- a/web/src/components/ExternalLinkWarning.tsx
+++ b/web/src/components/ExternalLinkWarning.tsx
@@ -18,6 +18,7 @@ const StyledModal = styled(Modal)`
   margin-right: -50%;
   transform: translate(-50%, -50%);
   height: auto;
+  max-height: 90vh;
   width: min(90%, 480px);
   border: 1px solid ${({ theme }) => theme.stroke};
   border-radius: 8px;
@@ -25,6 +26,7 @@ const StyledModal = styled(Modal)`
   padding: 32px;
   box-shadow: 0 4px 16px rgba(0, 0, 0, 0.1);
   z-index: 10002;
+  overflow-y: auto;
 `;
 
 const Overlay = styled.div`

From 859834bc091787764d46c396e1ea33f2e563442c Mon Sep 17 00:00:00 2001
From: kemuru <102478601+kemuru@users.noreply.github.com>
Date: Mon, 22 Sep 2025 17:12:07 +0900
Subject: [PATCH 141/175] feat: switch to reactmarkdown, remark gfm, rehype raw
 and rehype sanitize

---
 web/package.json                              |   5 +-
 .../DisputePreview/DisputeContext.tsx         |  17 +-
 web/src/components/MarkdownEditor.tsx         |  23 +-
 web/src/components/MarkdownRenderer.tsx       | 351 ++++++++++++--
 web/src/components/ReactMarkdown.tsx          |  16 -
 .../CaseDetails/Voting/Classic/Reveal.tsx     |  10 +-
 .../CaseDetails/Voting/OptionsContainer.tsx   |   4 +-
 .../CaseDetails/Voting/VotingHistory.tsx      |  14 +-
 .../pages/Courts/CourtDetails/Description.tsx |   7 +-
 .../pages/Resolver/Briefing/Description.tsx   |  25 +-
 web/src/styles/mdxEditorTheme.ts              |  86 ++--
 web/src/utils/markdownSanitization.ts         |  55 ---
 web/src/utils/urlValidation.ts                |   7 -
 yarn.lock                                     | 448 ++++++++++++++++--
 14 files changed, 826 insertions(+), 242 deletions(-)
 delete mode 100644 web/src/components/ReactMarkdown.tsx
 delete mode 100644 web/src/utils/markdownSanitization.ts

diff --git a/web/package.json b/web/package.json
index 7dc2aeb14..d17e27f70 100644
--- a/web/package.json
+++ b/web/package.json
@@ -100,7 +100,6 @@
     "@solana/wallet-adapter-react": "^0.15.36",
     "@solana/web3.js": "^1.98.0",
     "@tanstack/react-query": "^5.69.0",
-    "@types/dompurify": "^3.2.0",
     "@types/react-modal": "^3.16.3",
     "@wagmi/connectors": "^5.7.11",
     "@wagmi/core": "^2.16.7",
@@ -109,7 +108,6 @@
     "chartjs-adapter-moment": "^1.0.1",
     "chartjs-plugin-datalabels": "^2.2.0",
     "core-js": "^3.39.0",
-    "dompurify": "^3.2.6",
     "ethers": "^5.8.0",
     "graphql": "^16.9.0",
     "graphql-request": "^7.1.2",
@@ -130,6 +128,9 @@
     "react-scripts": "^5.0.1",
     "react-toastify": "^9.1.3",
     "react-use": "^17.5.1",
+    "rehype-raw": "^7.0.0",
+    "rehype-sanitize": "^6.0.0",
+    "remark-gfm": "^3.0.1",
     "styled-components": "^5.3.3",
     "subgraph-status": "^1.2.4",
     "viem": "^2.24.1",
diff --git a/web/src/components/DisputePreview/DisputeContext.tsx b/web/src/components/DisputePreview/DisputeContext.tsx
index 435bc47a8..70111de69 100644
--- a/web/src/components/DisputePreview/DisputeContext.tsx
+++ b/web/src/components/DisputePreview/DisputeContext.tsx
@@ -1,26 +1,27 @@
 import React, { useMemo } from "react";
 import styled from "styled-components";
 
-import { DisputeDetails } from "@kleros/kleros-sdk/src/dataMappings/utils/disputeDetailsTypes";
 import { useAccount } from "wagmi";
 
+import { DisputeDetails } from "@kleros/kleros-sdk/src/dataMappings/utils/disputeDetailsTypes";
+
 import { INVALID_DISPUTE_DATA_ERROR, RPC_ERROR } from "consts/index";
 import { Answer as IAnswer } from "context/NewDisputeContext";
 import { isUndefined } from "utils/index";
 
-import { responsiveSize } from "styles/responsiveSize";
-
 import { DisputeDetailsQuery, VotingHistoryQuery } from "src/graphql/graphql";
 
-import ReactMarkdown from "components/ReactMarkdown";
+import { responsiveSize } from "styles/responsiveSize";
+
+import MarkdownRenderer from "components/MarkdownRenderer";
 import { StyledSkeleton } from "components/StyledSkeleton";
 
+import CardLabel from "../DisputeView/CardLabels";
 import { Divider } from "../Divider";
 import { ExternalLink } from "../ExternalLink";
+import RulingAndRewardsIndicators from "../Verdict/RulingAndRewardsIndicators";
 
 import AliasDisplay from "./Alias";
-import RulingAndRewardsIndicators from "../Verdict/RulingAndRewardsIndicators";
-import CardLabel from "../DisputeView/CardLabels";
 
 const StyledH1 = styled.h1`
   margin: 0;
@@ -134,12 +135,12 @@ export const DisputeContext: React.FC<IDisputeContext> = ({
         <div>
           {disputeDetails?.question?.trim() ? (
             <ReactMarkdownWrapper dir="auto">
-              <ReactMarkdown>{disputeDetails.question}</ReactMarkdown>
+              <MarkdownRenderer content={disputeDetails.question} />
             </ReactMarkdownWrapper>
           ) : null}
           {disputeDetails?.description?.trim() ? (
             <ReactMarkdownWrapper dir="auto">
-              <ReactMarkdown>{disputeDetails.description}</ReactMarkdown>
+              <MarkdownRenderer content={disputeDetails.description} />
             </ReactMarkdownWrapper>
           ) : null}
         </div>
diff --git a/web/src/components/MarkdownEditor.tsx b/web/src/components/MarkdownEditor.tsx
index 002dd0aa2..e49c4ffa2 100644
--- a/web/src/components/MarkdownEditor.tsx
+++ b/web/src/components/MarkdownEditor.tsx
@@ -13,20 +13,21 @@ import {
   linkPlugin,
   linkDialogPlugin,
   tablePlugin,
+  codeBlockPlugin,
+  codeMirrorPlugin,
   toolbarPlugin,
   UndoRedo,
   BoldItalicUnderlineToggles,
-  CodeToggle,
   ListsToggle,
   CreateLink,
   InsertTable,
+  InsertCodeBlock,
   BlockTypeSelect,
   Separator,
 } from "@mdxeditor/editor";
 
 import InfoIcon from "svgs/icons/info-circle.svg";
 
-import { sanitizeMarkdown } from "utils/markdownSanitization";
 import { isValidUrl } from "utils/urlValidation";
 
 import { MDXEditorContainer, MDXEditorGlobalStyles } from "styles/mdxEditorTheme";
@@ -82,9 +83,13 @@ const MarkdownEditor: React.FC<IMarkdownEditor> = ({
   const editorRef = useRef<MDXEditorMethods>(null);
 
   const handleChange = (markdown: string) => {
-    const cleanedMarkdown = markdown === "\u200B" ? "" : markdown.replace(/^\u200B/, "");
-    const sanitizedMarkdown = sanitizeMarkdown(cleanedMarkdown);
-    onChange(sanitizedMarkdown);
+    let cleanedMarkdown = markdown === "\u200B" ? "" : markdown.replace(/^\u200B/, "");
+    // Remove ALL escape characters - no exceptions
+    cleanedMarkdown = cleanedMarkdown.replace(/\\([`[]*_#|>-+=~^{}()!&<$%\\])/g, "$1");
+    // Also handle multiple consecutive backslashes that might accumulate
+    cleanedMarkdown = cleanedMarkdown.replace(/\\+/g, "");
+
+    onChange(cleanedMarkdown);
   };
 
   const handleContainerClick = () => {
@@ -116,13 +121,19 @@ const MarkdownEditor: React.FC<IMarkdownEditor> = ({
       }),
       linkDialogPlugin(),
       tablePlugin(),
+      codeBlockPlugin({ defaultCodeBlockLanguage: "text" }),
+      codeMirrorPlugin({
+        codeBlockLanguages: {
+          text: "Code",
+        },
+      }),
       toolbarPlugin({
         toolbarContents: () => (
           <>
             <UndoRedo />
             <Separator />
             <BoldItalicUnderlineToggles />
-            <CodeToggle />
+            <InsertCodeBlock />
             <Separator />
             <BlockTypeSelect />
             <Separator />
diff --git a/web/src/components/MarkdownRenderer.tsx b/web/src/components/MarkdownRenderer.tsx
index b885acce5..4c6c47acf 100644
--- a/web/src/components/MarkdownRenderer.tsx
+++ b/web/src/components/MarkdownRenderer.tsx
@@ -1,28 +1,25 @@
 import React, { useCallback, useEffect, useRef, useState } from "react";
 import styled from "styled-components";
 
-import {
-  MDXEditor,
-  type MDXEditorProps,
-  headingsPlugin,
-  listsPlugin,
-  quotePlugin,
-  thematicBreakPlugin,
-  markdownShortcutPlugin,
-  linkPlugin,
-  tablePlugin,
-  codeBlockPlugin,
-} from "@mdxeditor/editor";
+import ReactMarkdown from "react-markdown";
+import rehypeRaw from "rehype-raw";
+import rehypeSanitize from "rehype-sanitize";
+import remarkGfm from "remark-gfm";
 
 import { isExternalLink } from "utils/linkUtils";
-import { sanitizeMarkdown } from "utils/markdownSanitization";
 import { isValidUrl } from "utils/urlValidation";
 
-import { MDXRendererContainer } from "styles/mdxEditorTheme";
-
 import ExternalLinkWarning from "components/ExternalLinkWarning";
 
-const LinkInterceptorContainer = styled(MDXRendererContainer)`
+const MarkdownContainer = styled.div`
+  font-size: 16px;
+  line-height: 1.6;
+
+  *,
+  ** {
+    font-size: 16px;
+  }
+
   a {
     pointer-events: none;
     cursor: pointer;
@@ -39,9 +36,203 @@ const LinkInterceptorContainer = styled(MDXRendererContainer)`
       cursor: pointer;
     }
   }
-`;
 
-import "@mdxeditor/editor/style.css";
+  pre {
+    background-color: ${({ theme }) => theme.lightBackground};
+    border-radius: 8px;
+    padding: 16px;
+    overflow-x: auto;
+  }
+
+  code {
+    background-color: ${({ theme }) => theme.lightBackground};
+    padding: 2px 4px;
+    border-radius: 4px;
+    font-family: "Fira Code", monospace;
+  }
+
+  pre code {
+    background-color: transparent;
+    padding: 0;
+  }
+
+  blockquote {
+    border-left: 4px solid ${({ theme }) => theme.primaryBlue};
+    margin: 16px 0;
+    padding-left: 16px;
+    color: ${({ theme }) => theme.secondaryText};
+  }
+
+  ul,
+  ol {
+    padding-left: 20px;
+  }
+
+  input[type="checkbox"] {
+    margin-right: 8px;
+    margin-top: 4px;
+    accent-color: ${({ theme }) => theme.primaryBlue};
+    cursor: default;
+    vertical-align: top;
+  }
+
+  h1,
+  h2,
+  h3,
+  h4,
+  h5,
+  h6 {
+    color: ${({ theme }) => theme.primaryText};
+    margin: 16px 0 8px 0;
+    line-height: 1.3;
+  }
+
+  h1 {
+    font-size: 2em;
+    font-weight: 700;
+  }
+
+  h2 {
+    font-size: 1.5em;
+    font-weight: 600;
+  }
+
+  h3 {
+    font-size: 1.25em;
+    font-weight: 600;
+  }
+
+  h4 {
+    font-size: 1.125em;
+    font-weight: 600;
+  }
+
+  h5 {
+    font-size: 1em;
+    font-weight: 600;
+  }
+
+  h6 {
+    font-size: 0.875em;
+    font-weight: 600;
+  }
+
+  pre {
+    color: ${({ theme }) => theme.primaryText};
+  }
+
+  pre code {
+    color: inherit;
+  }
+
+  code {
+    color: ${({ theme }) => theme.primaryText};
+  }
+
+  table {
+    border-collapse: collapse;
+    width: 100%;
+    margin: 16px 0;
+    border: 1px solid ${({ theme }) => theme.stroke};
+  }
+
+  th,
+  td {
+    border: 1px solid ${({ theme }) => theme.stroke};
+    padding: 8px 12px;
+    text-align: left;
+  }
+
+  th {
+    background-color: ${({ theme }) => theme.lightBackground};
+    color: ${({ theme }) => theme.primaryText};
+    font-weight: 600;
+  }
+
+  td {
+    color: ${({ theme }) => theme.primaryText};
+  }
+
+  tbody tr:nth-child(even) {
+    background-color: ${({ theme }) => theme.lightGrey};
+  }
+
+  details {
+    border: 1px solid ${({ theme }) => theme.stroke};
+    border-radius: 8px;
+    padding: 8px 12px;
+    margin: 16px 0;
+    background-color: ${({ theme }) => theme.lightBackground};
+  }
+
+  summary {
+    font-weight: 600;
+    cursor: pointer;
+    color: ${({ theme }) => theme.primaryText};
+    padding: 4px 0;
+    outline: none;
+  }
+
+  summary:hover {
+    color: ${({ theme }) => theme.primaryBlue};
+  }
+
+  details[open] summary {
+    margin-bottom: 8px;
+    border-bottom: 1px solid ${({ theme }) => theme.stroke};
+    padding-bottom: 8px;
+  }
+
+  u {
+    text-decoration: underline;
+    text-decoration-color: ${({ theme }) => theme.primaryText};
+  }
+
+  del,
+  s {
+    text-decoration: line-through;
+    text-decoration-color: ${({ theme }) => theme.secondaryText};
+  }
+
+  mark {
+    background-color: ${({ theme }) => theme.warning};
+    color: ${({ theme }) => theme.primaryText};
+    padding: 2px 4px;
+    border-radius: 2px;
+  }
+
+  sub,
+  sup {
+    font-size: 0.75em;
+    line-height: 0;
+    position: relative;
+    vertical-align: baseline;
+  }
+
+  sup {
+    top: -0.5em;
+  }
+
+  sub {
+    bottom: -0.25em;
+  }
+
+  kbd {
+    background-color: ${({ theme }) => theme.lightBackground};
+    border: 1px solid ${({ theme }) => theme.stroke};
+    border-radius: 4px;
+    box-shadow: 0 1px 1px ${({ theme }) => theme.stroke};
+    color: ${({ theme }) => theme.primaryText};
+    font-family: "Fira Code", monospace;
+    font-size: 0.875em;
+    padding: 2px 6px;
+  }
+
+  abbr {
+    text-decoration: underline dotted;
+    cursor: help;
+  }
+`;
 
 interface IMarkdownRenderer {
   content: string;
@@ -76,7 +267,13 @@ const MarkdownRenderer: React.FC<IMarkdownRenderer> = ({ content, className }) =
     if (!container) return;
 
     const handleClick = (event: Event) => {
-      const linkElement = (event.target as HTMLElement).closest("a") as HTMLAnchorElement | null;
+      const target = event.target as HTMLElement;
+
+      if (!container.contains(target)) {
+        return;
+      }
+
+      const linkElement = target.closest("a") as HTMLAnchorElement | null;
 
       if (linkElement) {
         const href = linkElement.getAttribute("href") || linkElement.href;
@@ -89,11 +286,9 @@ const MarkdownRenderer: React.FC<IMarkdownRenderer> = ({ content, className }) =
     };
 
     container.addEventListener("click", handleClick, true);
-    document.addEventListener("click", handleClick, true);
 
     return () => {
       container.removeEventListener("click", handleClick, true);
-      document.removeEventListener("click", handleClick, true);
     };
   }, [handleExternalLink]);
 
@@ -101,29 +296,101 @@ const MarkdownRenderer: React.FC<IMarkdownRenderer> = ({ content, className }) =
     return null;
   }
 
-  const sanitizedContent = sanitizeMarkdown(content);
-
-  const editorProps: MDXEditorProps = {
-    markdown: sanitizedContent,
-    readOnly: true,
-    suppressHtmlProcessing: false,
-    plugins: [
-      headingsPlugin(),
-      listsPlugin(),
-      quotePlugin(),
-      thematicBreakPlugin(),
-      markdownShortcutPlugin(),
-      linkPlugin({ validateUrl: isValidUrl }),
-      tablePlugin(),
-      codeBlockPlugin({ defaultCodeBlockLanguage: "text" }),
-    ],
-  };
-
   return (
     <>
-      <LinkInterceptorContainer ref={containerRef} className={className} role="region" aria-label="Markdown content">
-        <MDXEditor {...editorProps} aria-label="Rendered markdown content" />
-      </LinkInterceptorContainer>
+      <MarkdownContainer ref={containerRef} className={className} role="region" aria-label="Markdown content">
+        <ReactMarkdown
+          remarkPlugins={[remarkGfm]}
+          rehypePlugins={[
+            rehypeRaw,
+            [
+              rehypeSanitize,
+              {
+                tagNames: [
+                  "p",
+                  "br",
+                  "hr",
+                  "h1",
+                  "h2",
+                  "h3",
+                  "h4",
+                  "h5",
+                  "h6",
+                  "ul",
+                  "ol",
+                  "li",
+                  "input",
+                  "strong",
+                  "b",
+                  "em",
+                  "i",
+                  "u",
+                  "del",
+                  "s",
+                  "mark",
+                  "small",
+                  "sub",
+                  "sup",
+                  "code",
+                  "pre",
+                  "kbd",
+                  "samp",
+                  "var",
+                  "a",
+                  "img",
+                  "table",
+                  "thead",
+                  "tbody",
+                  "tfoot",
+                  "tr",
+                  "th",
+                  "td",
+                  "caption",
+                  "blockquote",
+                  "div",
+                  "span",
+                  "section",
+                  "article",
+                  "aside",
+                  "nav",
+                  "main",
+                  "header",
+                  "footer",
+                  "details",
+                  "summary",
+                  "abbr",
+                  "cite",
+                  "dfn",
+                  "time",
+                  "address",
+                ],
+                attributes: {
+                  "*": ["className", "id", "style"],
+                  a: ["href", "title", "target", "rel"],
+                  img: ["src", "alt", "title", "width", "height"],
+                  input: ["type", "checked", "disabled"],
+                  th: ["scope", "colspan", "rowspan"],
+                  td: ["colspan", "rowspan"],
+                  details: ["open"],
+                  time: ["dateTime"],
+                  abbr: ["title"],
+                },
+              },
+            ],
+          ]}
+          components={{
+            a: ({ href, children, ...props }) => {
+              return (
+                <a href={href} {...props}>
+                  {children}
+                </a>
+              );
+            },
+          }}
+        >
+          {content}
+        </ReactMarkdown>
+      </MarkdownContainer>
       <ExternalLinkWarning
         isOpen={isWarningOpen}
         url={pendingUrl}
diff --git a/web/src/components/ReactMarkdown.tsx b/web/src/components/ReactMarkdown.tsx
deleted file mode 100644
index f7b52bb90..000000000
--- a/web/src/components/ReactMarkdown.tsx
+++ /dev/null
@@ -1,16 +0,0 @@
-import React from "react";
-import styled from "styled-components";
-
-import Reactmkdwn from "react-markdown";
-
-const StyledMarkdown = styled(Reactmkdwn)`
-  font-size: 16px;
-  *,
-  ** {
-    font-size: 16px;
-  }
-`;
-
-const ReactMarkdown: React.FC<{ children: string }> = ({ children }) => <StyledMarkdown>{children}</StyledMarkdown>;
-
-export default ReactMarkdown;
diff --git a/web/src/pages/Cases/CaseDetails/Voting/Classic/Reveal.tsx b/web/src/pages/Cases/CaseDetails/Voting/Classic/Reveal.tsx
index e95ee1bd3..f4ce45368 100644
--- a/web/src/pages/Cases/CaseDetails/Voting/Classic/Reveal.tsx
+++ b/web/src/pages/Cases/CaseDetails/Voting/Classic/Reveal.tsx
@@ -1,7 +1,6 @@
 import React, { useCallback, useMemo, useState } from "react";
 import styled from "styled-components";
 
-import ReactMarkdown from "react-markdown";
 import { useParams } from "react-router-dom";
 import { useLocalStorage } from "react-use";
 import { encodePacked, keccak256, PrivateKeyAccount } from "viem";
@@ -21,6 +20,7 @@ import { useDisputeDetailsQuery } from "queries/useDisputeDetailsQuery";
 import { EnsureChain } from "components/EnsureChain";
 import InfoCard from "components/InfoCard";
 import MarkdownEditor from "components/MarkdownEditor";
+import MarkdownRenderer from "components/MarkdownRenderer";
 
 const Container = styled.div`
   width: 100%;
@@ -39,7 +39,7 @@ const StyledEnsureChain = styled(EnsureChain)`
   margin: 8px auto;
 `;
 
-const ReactMarkdownWrapper = styled.div``;
+const MarkdownWrapper = styled.div``;
 interface IReveal {
   arbitrable?: `0x${string}`;
   voteIDs: string[];
@@ -110,9 +110,9 @@ const Reveal: React.FC<IReveal> = ({ arbitrable, voteIDs, setIsOpen, commit, isR
         <StyledInfoCard msg="Failed to commit on time." />
       ) : isRevealPeriod ? (
         <>
-          <ReactMarkdownWrapper dir="auto">
-            <ReactMarkdown>{disputeDetails?.question ?? ""}</ReactMarkdown>
-          </ReactMarkdownWrapper>
+          <MarkdownWrapper dir="auto">
+            <MarkdownRenderer content={disputeDetails?.question ?? ""} />
+          </MarkdownWrapper>
           <MarkdownEditor value={justification} onChange={setJustification} />
           <StyledEnsureChain>
             <StyledButton
diff --git a/web/src/pages/Cases/CaseDetails/Voting/OptionsContainer.tsx b/web/src/pages/Cases/CaseDetails/Voting/OptionsContainer.tsx
index 2e8a5ecf1..9f4d5d6be 100644
--- a/web/src/pages/Cases/CaseDetails/Voting/OptionsContainer.tsx
+++ b/web/src/pages/Cases/CaseDetails/Voting/OptionsContainer.tsx
@@ -1,7 +1,6 @@
 import React, { useCallback, useMemo, useState } from "react";
 import styled from "styled-components";
 
-import ReactMarkdown from "react-markdown";
 import { useParams } from "react-router-dom";
 
 import { Answer } from "@kleros/kleros-sdk";
@@ -13,6 +12,7 @@ import { isUndefined } from "utils/index";
 
 import { EnsureChain } from "components/EnsureChain";
 import MarkdownEditor from "components/MarkdownEditor";
+import MarkdownRenderer from "components/MarkdownRenderer";
 
 const MainContainer = styled.div`
   width: 100%;
@@ -84,7 +84,7 @@ const Options: React.FC<IOptions> = ({ arbitrable, handleSelection, justificatio
   return id ? (
     <>
       <MainContainer dir="auto">
-        <ReactMarkdown>{disputeDetails?.question ?? ""}</ReactMarkdown>
+        <MarkdownRenderer content={disputeDetails?.question ?? ""} />
         {!isUndefined(justification) && !isUndefined(setJustification) ? (
           <MarkdownEditor value={justification} onChange={setJustification} />
         ) : null}
diff --git a/web/src/pages/Cases/CaseDetails/Voting/VotingHistory.tsx b/web/src/pages/Cases/CaseDetails/Voting/VotingHistory.tsx
index da02108bf..e6421b1c4 100644
--- a/web/src/pages/Cases/CaseDetails/Voting/VotingHistory.tsx
+++ b/web/src/pages/Cases/CaseDetails/Voting/VotingHistory.tsx
@@ -2,7 +2,6 @@ import React, { useEffect, useMemo, useState } from "react";
 import styled from "styled-components";
 
 import Skeleton from "react-loading-skeleton";
-import ReactMarkdown from "react-markdown";
 import { useParams } from "react-router-dom";
 import { useToggle } from "react-use";
 
@@ -19,6 +18,7 @@ import { useVotingHistory } from "queries/useVotingHistory";
 import { responsiveSize } from "styles/responsiveSize";
 
 import HowItWorks from "components/HowItWorks";
+import MarkdownRenderer from "components/MarkdownRenderer";
 import BinaryVoting from "components/Popup/MiniGuides/BinaryVoting";
 
 import PendingVotesBox from "./PendingVotesBox";
@@ -47,8 +47,8 @@ const StyledTitle = styled.h1`
   margin-bottom: 0;
   font-size: ${responsiveSize(18, 24)};
 `;
-const ReactMarkdownWrapper = styled.div``;
-const StyledReactMarkDown = styled(ReactMarkdown)`
+const MarkdownWrapper = styled.div``;
+const StyledMarkdownRenderer = styled(MarkdownRenderer)`
   max-width: inherit;
   word-wrap: break-word;
   p {
@@ -95,11 +95,11 @@ const VotingHistory: React.FC<{ arbitrable?: `0x${string}`; isQuestion: boolean
           {isQuestion && (
             <>
               {disputeDetails.question ? (
-                <ReactMarkdownWrapper dir="auto">
-                  <StyledReactMarkDown>{disputeDetails.question}</StyledReactMarkDown>
-                </ReactMarkdownWrapper>
+                <MarkdownWrapper dir="auto">
+                  <StyledMarkdownRenderer content={disputeDetails.question} />
+                </MarkdownWrapper>
               ) : (
-                <StyledReactMarkDown>{isError ? RPC_ERROR : INVALID_DISPUTE_DATA_ERROR}</StyledReactMarkDown>
+                <StyledMarkdownRenderer content={isError ? RPC_ERROR : INVALID_DISPUTE_DATA_ERROR} />
               )}
             </>
           )}
diff --git a/web/src/pages/Courts/CourtDetails/Description.tsx b/web/src/pages/Courts/CourtDetails/Description.tsx
index b8ff78dbb..c860cdd0e 100644
--- a/web/src/pages/Courts/CourtDetails/Description.tsx
+++ b/web/src/pages/Courts/CourtDetails/Description.tsx
@@ -1,12 +1,13 @@
 import React, { useEffect } from "react";
 import styled from "styled-components";
 
-import ReactMarkdown from "react-markdown";
 import { Routes, Route, Navigate, useParams, useNavigate, useLocation, useSearchParams } from "react-router-dom";
+
 import { Tabs } from "@kleros/ui-components-library";
 
 import { useCourtPolicy } from "queries/useCourtPolicy";
 
+import MarkdownRenderer from "components/MarkdownRenderer";
 import { StyledSkeleton } from "components/StyledSkeleton";
 
 const Container = styled.div`
@@ -18,7 +19,7 @@ const TextContainer = styled.div`
   padding: 12px 0;
 `;
 
-const StyledReactMarkdown = styled(ReactMarkdown)`
+const StyledMarkdownRenderer = styled(MarkdownRenderer)`
   p {
     word-break: break-word;
   }
@@ -127,6 +128,6 @@ const Description: React.FC = () => {
 };
 
 const formatMarkdown = (markdown?: string) =>
-  markdown ? <StyledReactMarkdown>{markdown.replace(/\n/g, "  \n")}</StyledReactMarkdown> : <StyledSkeleton />;
+  markdown ? <StyledMarkdownRenderer content={markdown} /> : <StyledSkeleton />;
 
 export default Description;
diff --git a/web/src/pages/Resolver/Briefing/Description.tsx b/web/src/pages/Resolver/Briefing/Description.tsx
index 91efc9415..4a9318f98 100644
--- a/web/src/pages/Resolver/Briefing/Description.tsx
+++ b/web/src/pages/Resolver/Briefing/Description.tsx
@@ -1,13 +1,12 @@
 import React, { useRef, useEffect } from "react";
 import styled, { css } from "styled-components";
 
-import { Textarea } from "@kleros/ui-components-library";
-
 import { useNewDisputeContext } from "context/NewDisputeContext";
 
 import { landscapeStyle } from "styles/landscapeStyle";
 import { responsiveSize } from "styles/responsiveSize";
 
+import MarkdownEditor from "components/MarkdownEditor";
 import Header from "pages/Resolver/Header";
 
 import NavigationButtons from "../NavigationButtons";
@@ -18,9 +17,8 @@ const Container = styled.div`
   align-items: center;
 `;
 
-const StyledTextArea = styled(Textarea)`
+const StyledMarkdownEditor = styled(MarkdownEditor)`
   width: 84vw;
-  height: 300px;
   ${landscapeStyle(
     () => css`
       width: ${responsiveSize(442, 700, 900)};
@@ -32,15 +30,18 @@ const Description: React.FC = () => {
   const { disputeData, setDisputeData } = useNewDisputeContext();
   const containerRef = useRef<HTMLDivElement>(null);
 
-  const handleWrite = (event: React.ChangeEvent<HTMLTextAreaElement>) => {
-    setDisputeData({ ...disputeData, description: event.target.value });
+  const handleWrite = (value: string) => {
+    setDisputeData({ ...disputeData, description: value });
   };
 
   useEffect(() => {
     if (containerRef.current) {
-      const textareaElement = containerRef.current.querySelector("textarea");
-      if (textareaElement) {
-        textareaElement.focus();
+      const editorElement = containerRef.current.querySelector('[role="region"]');
+      if (editorElement) {
+        const contentEditable = editorElement.querySelector('[contenteditable="true"]');
+        if (contentEditable) {
+          (contentEditable as HTMLElement).focus();
+        }
       }
     }
   }, []);
@@ -48,11 +49,11 @@ const Description: React.FC = () => {
   return (
     <Container ref={containerRef}>
       <Header text="Describe the case" />
-      <StyledTextArea
-        dir="auto"
-        onChange={handleWrite}
+      <StyledMarkdownEditor
         value={disputeData.description}
+        onChange={handleWrite}
         placeholder="eg. Bob hired Alice to develop a website for him. Bob claims the contract was not fully respected, and the website was delivered incomplete. For that reason, he wants to pay part of the agreed payment: 150 DAI. On the other hand, Alice claims she should receive the full payment: 250 DAI."
+        showMessage={false}
       />
       <NavigationButtons prevRoute="/resolver/title" nextRoute="/resolver/court" />
     </Container>
diff --git a/web/src/styles/mdxEditorTheme.ts b/web/src/styles/mdxEditorTheme.ts
index 16546c6a4..315aaaeca 100644
--- a/web/src/styles/mdxEditorTheme.ts
+++ b/web/src/styles/mdxEditorTheme.ts
@@ -1,6 +1,10 @@
 import styled, { createGlobalStyle, css } from "styled-components";
 
 const sharedContentStyles = css`
+  .mdxeditor-root-contenteditable div {
+    padding: 0;
+  }
+
   .mdxeditor-root-contenteditable p {
     color: ${({ theme }) => theme.primaryText} !important;
     margin: 0 0 12px 0;
@@ -26,20 +30,29 @@ const sharedContentStyles = css`
   }
 
   .mdxeditor-root-contenteditable pre {
-    background-color: ${({ theme }) => theme.lightGrey} !important;
+    background-color: ${({ theme }) => theme.lightBackground} !important;
     color: ${({ theme }) => theme.primaryText} !important;
+    border: 1px solid ${({ theme }) => theme.stroke} !important;
+    border-radius: 6px !important;
+    padding: 12px !important;
+    margin: 12px 0 !important;
+    font-family: "Fira Code", monospace !important;
+    font-size: 14px !important;
   }
 
   .mdxeditor-root-contenteditable a {
     color: ${({ theme }) => theme.primaryBlue} !important;
   }
 
-  .mdxeditor-root-contenteditable span[class*="_code_"] {
-    background-color: ${({ theme }) => theme.lightGrey} !important;
-    color: ${({ theme }) => theme.secondaryText} !important;
-    padding: 2px 4px;
-    border-radius: 3px;
-    font-size: 0.9em;
+  .mdxeditor-root-contenteditable span[class*="_code_"],
+  .mdxeditor-root-contenteditable code {
+    background-color: ${({ theme }) => theme.lightBackground} !important;
+    color: ${({ theme }) => theme.primaryText} !important;
+    padding: 2px 6px !important;
+    border-radius: 4px !important;
+    font-size: 14px !important;
+    font-family: "Fira Code", monospace !important;
+    border: 1px solid ${({ theme }) => theme.stroke} !important;
   }
 
   .mdxeditor-root-contenteditable th {
@@ -130,6 +143,39 @@ export const MDXEditorContainer = styled.div`
 `;
 
 export const MDXEditorGlobalStyles = createGlobalStyle`
+  .cm-editor {
+    background-color: ${({ theme }) => theme.lightBackground} !important;
+    border: 1px solid ${({ theme }) => theme.stroke} !important;
+    border-radius: 6px !important;
+  }
+
+  .cm-content {
+    color: ${({ theme }) => theme.primaryText} !important;
+    font-family: "Fira Code", monospace !important;
+    font-size: 14px !important;
+    padding: 12px !important;
+  }
+
+  .cm-focused {
+    outline: none !important;
+  }
+
+  [class*="codeMirrorToolbar"] {
+    background-color: transparent !important;
+  }
+
+  [class*="cm-gutterElement"] {
+    color: ${({ theme }) => theme.secondaryText} !important;
+  }
+
+  [class*="codeMirrorWrapper"] {
+    border: 1px solid ${({ theme }) => theme.stroke} !important;
+  }
+
+  [class*="activeLineGutter"] {
+    background-color: transparent !important;
+  }
+
   /* Global styles for all MDXEditor popups and overlays */
   [class*="linkDialogPopoverContent"],
   [class*="selectTrigger"],
@@ -202,29 +248,3 @@ export const MDXEditorGlobalStyles = createGlobalStyle`
     }
   }
 `;
-
-export const MDXRendererContainer = styled.div`
-  width: 100%;
-
-  .mdxeditor-toolbar {
-    display: none !important;
-  }
-
-  .mdxeditor-root-contenteditable {
-    background: transparent !important;
-    border: none !important;
-    padding: 0 !important;
-    font-size: 16px;
-    line-height: 1.5;
-  }
-
-  .mdxeditor-root-contenteditable span[class*="_code_"] {
-    background-color: ${({ theme }) => theme.lightGrey} !important;
-    color: ${({ theme }) => theme.secondaryText} !important;
-    padding: 2px 4px;
-    border-radius: 3px;
-    font-size: 0.9em;
-  }
-
-  ${sharedContentStyles}
-`;
diff --git a/web/src/utils/markdownSanitization.ts b/web/src/utils/markdownSanitization.ts
deleted file mode 100644
index 6e21f8eda..000000000
--- a/web/src/utils/markdownSanitization.ts
+++ /dev/null
@@ -1,55 +0,0 @@
-import { sanitizeUrl } from "./urlValidation";
-import DOMPurify from "dompurify";
-
-const sanitizeRepeated = (text: string, pattern: RegExp, replacement: string): string => {
-  let result = text;
-  let previousResult;
-  do {
-    previousResult = result;
-    result = result.replace(pattern, replacement);
-  } while (result !== previousResult);
-  return result;
-};
-
-export const sanitizeMarkdown = (markdown: string): string => {
-  if (!markdown || typeof markdown !== "string") {
-    return "";
-  }
-
-  let sanitized = markdown;
-
-  sanitized = sanitized.replace(/\[([^\]]*)\]\(([^)]+)\)/g, (match, text, url) => {
-    const sanitizedUrl = sanitizeUrl(url);
-    return `[${text}](${sanitizedUrl})`;
-  });
-
-  sanitized = sanitized.replace(/<a\s+href="([^"]*)"[^>]*>([^<]*)<\/a>/gi, (match, url, text) => {
-    const sanitizedUrl = sanitizeUrl(url);
-    return `[${text}](${sanitizedUrl})`;
-  });
-
-  // Use DOMPurify to sanitize dangerous HTML tags and attributes
-  sanitized = DOMPurify.sanitize(sanitized, {
-    ALLOWED_TAGS: [
-      // Allow only safe tags that are valid in Markdown output;
-      // Configure to disallow script, iframe, object, embed, form, input, button, applet, audio, video, svg, canvas, meta, link, base
-      "b", "i", "em", "strong", "a", "p", "ul", "ol", "li", "blockquote", "code", "pre", "span", "br", "hr", "img"
-    ],
-    ALLOWED_ATTR: ["href", "src", "alt", "title"], // No style, no event handlers
-    FORBID_TAGS: [
-      "script", "iframe", "object", "embed", "form", "input", "button", "applet", "audio", "video", "svg", "canvas", "meta", "link", "base"
-    ],
-    FORBID_ATTR: [
-      "onerror", "onload", "onclick", "style"
-    ]
-  });
-
-  // Optional: Remove encoded protocols/entities as before
-  sanitized = sanitized.replace(/javascript:/gi, "");
-  sanitized = sanitized.replace(/vbscript:/gi, "");
-  sanitized = sanitized.replace(/data:/gi, "");
-  sanitized = sanitized.replace(/&#x[0-9a-f]+;/gi, "");
-  sanitized = sanitized.replace(/&#[0-9]+;/gi, "");
-
-  return sanitized;
-};
diff --git a/web/src/utils/urlValidation.ts b/web/src/utils/urlValidation.ts
index 115f5bef8..ba4cc7b36 100644
--- a/web/src/utils/urlValidation.ts
+++ b/web/src/utils/urlValidation.ts
@@ -44,10 +44,3 @@ export const isValidUrl = (url: string): boolean => {
     return false;
   }
 };
-
-export const sanitizeUrl = (url: string): string => {
-  if (!isValidUrl(url)) {
-    return "#";
-  }
-  return url;
-};
diff --git a/yarn.lock b/yarn.lock
index 9d8559478..0c287d75a 100644
--- a/yarn.lock
+++ b/yarn.lock
@@ -2520,8 +2520,8 @@ __metadata:
   linkType: hard
 
 "@codemirror/lang-sql@npm:^6.0.0":
-  version: 6.9.1
-  resolution: "@codemirror/lang-sql@npm:6.9.1"
+  version: 6.10.0
+  resolution: "@codemirror/lang-sql@npm:6.10.0"
   dependencies:
     "@codemirror/autocomplete": "npm:^6.0.0"
     "@codemirror/language": "npm:^6.0.0"
@@ -2529,7 +2529,7 @@ __metadata:
     "@lezer/common": "npm:^1.2.0"
     "@lezer/highlight": "npm:^1.0.0"
     "@lezer/lr": "npm:^1.0.0"
-  checksum: 10/2fa0f61d8253f9dd28c255fa13ac27181fd42782160aeadfb72fdded426820c2ca49cf5057cfa92fc1016318bdf1008d0c33e23522f555ed802694ae73f3a137
+  checksum: 10/23b9f4f1283bf63a41e7e8455f33fb528769bcc277ab0981b1bf7b8a589041883f9e2dcb0d64e0de0964577a7a6a30921ed3109c7fa0d85405716236ddc97d45
   languageName: node
   linkType: hard
 
@@ -2758,14 +2758,14 @@ __metadata:
   linkType: hard
 
 "@codemirror/view@npm:^6.7.1":
-  version: 6.38.2
-  resolution: "@codemirror/view@npm:6.38.2"
+  version: 6.38.3
+  resolution: "@codemirror/view@npm:6.38.3"
   dependencies:
     "@codemirror/state": "npm:^6.5.0"
     crelt: "npm:^1.0.6"
     style-mod: "npm:^4.1.0"
     w3c-keyname: "npm:^2.2.4"
-  checksum: 10/300608850a29215d7b47fe8ade183fc2241457a924335bd127e29e1af11da9314369c65ec0da968177086f3529abbcd71a609c1af673ea8951c32a523cab358c
+  checksum: 10/2df41450399cbac0eaf06dba822418dd6926e48344b9255902248075ef040c957dfe97fe842a755e284a2fd4a66dc17b9638385f46ad74e926baac2e797335a2
   languageName: node
   linkType: hard
 
@@ -6801,7 +6801,6 @@ __metadata:
     "@solana/web3.js": "npm:^1.98.0"
     "@tanstack/react-query": "npm:^5.69.0"
     "@types/busboy": "npm:^1.5.4"
-    "@types/dompurify": "npm:^3.2.0"
     "@types/react": "npm:^18.3.12"
     "@types/react-dom": "npm:^18.3.1"
     "@types/react-modal": "npm:^3.16.3"
@@ -6817,7 +6816,6 @@ __metadata:
     chartjs-adapter-moment: "npm:^1.0.1"
     chartjs-plugin-datalabels: "npm:^2.2.0"
     core-js: "npm:^3.39.0"
-    dompurify: "npm:^3.2.6"
     eslint: "npm:^9.15.0"
     eslint-config-prettier: "npm:^9.1.0"
     eslint-import-resolver-typescript: "npm:^3.6.3"
@@ -6846,6 +6844,9 @@ __metadata:
     react-scripts: "npm:^5.0.1"
     react-toastify: "npm:^9.1.3"
     react-use: "npm:^17.5.1"
+    rehype-raw: "npm:^7.0.0"
+    rehype-sanitize: "npm:^6.0.0"
+    remark-gfm: "npm:^3.0.1"
     rimraf: "npm:^6.0.1"
     styled-components: "npm:^5.3.3"
     subgraph-status: "npm:^1.2.4"
@@ -7237,13 +7238,13 @@ __metadata:
   linkType: hard
 
 "@lezer/javascript@npm:^1.0.0":
-  version: 1.5.3
-  resolution: "@lezer/javascript@npm:1.5.3"
+  version: 1.5.4
+  resolution: "@lezer/javascript@npm:1.5.4"
   dependencies:
     "@lezer/common": "npm:^1.2.0"
     "@lezer/highlight": "npm:^1.1.3"
     "@lezer/lr": "npm:^1.3.0"
-  checksum: 10/1cc3a719b7edda14bd816b9e4efab51fcf7392b7800ccdc0f135fb9652349b93c8f3bec50b82a200ac037ee8b9387efbe2d00c9870f7e0cb62ae8036635d6115
+  checksum: 10/e3cf0b57b131e163aa6ce8a66469e5c39da4db6e83cbefa3bc864575f999229ad02d5d69af56d8aa05b21db22de284c13cfbc9b8b5bb7a628b5599330cf1ef39
   languageName: node
   linkType: hard
 
@@ -7638,8 +7639,8 @@ __metadata:
   linkType: hard
 
 "@mdxeditor/editor@npm:^3.45.0":
-  version: 3.45.0
-  resolution: "@mdxeditor/editor@npm:3.45.0"
+  version: 3.46.0
+  resolution: "@mdxeditor/editor@npm:3.46.0"
   dependencies:
     "@codemirror/commands": "npm:^6.2.4"
     "@codemirror/lang-markdown": "npm:^6.2.3"
@@ -7700,7 +7701,7 @@ __metadata:
   peerDependencies:
     react: ">= 18 || >= 19"
     react-dom: ">= 18 || >= 19"
-  checksum: 10/5d6a661721a1e5570480e8dc981758d5816e516deaa31aebf70d0a198a8bc0c4cdfa1fa843ce98786910f8c93ef818f963cd1857fe1e26332aeca1c2241fe7d1
+  checksum: 10/6b6b61e4e1b373ae1a0d14de392ee0cf5e017fa5e71d7d4d574e9bb5ca27a89f006b2cfd9761041c130a0b1ce01b43c8b4e46efafe8a500aab1f6b75e7af63c0
   languageName: node
   linkType: hard
 
@@ -11752,15 +11753,6 @@ __metadata:
   languageName: node
   linkType: hard
 
-"@types/dompurify@npm:^3.2.0":
-  version: 3.2.0
-  resolution: "@types/dompurify@npm:3.2.0"
-  dependencies:
-    dompurify: "npm:*"
-  checksum: 10/0194dd9024e76e856f3373e8b080c7a5ac9910543ac1ee85db45277efbbea820b2f27fe22c8a6f02bb51833e0a8540d732be0d11d156efd16cb0b97f88e41ebf
-  languageName: node
-  linkType: hard
-
 "@types/eslint-scope@npm:^3.7.3":
   version: 3.7.4
   resolution: "@types/eslint-scope@npm:3.7.4"
@@ -12103,13 +12095,20 @@ __metadata:
   languageName: node
   linkType: hard
 
-"@types/prop-types@npm:*, @types/prop-types@npm:^15.0.0":
+"@types/prop-types@npm:*":
   version: 15.7.12
   resolution: "@types/prop-types@npm:15.7.12"
   checksum: 10/ac16cc3d0a84431ffa5cfdf89579ad1e2269549f32ce0c769321fdd078f84db4fbe1b461ed5a1a496caf09e637c0e367d600c541435716a55b1d9713f5035dfe
   languageName: node
   linkType: hard
 
+"@types/prop-types@npm:^15.0.0":
+  version: 15.7.15
+  resolution: "@types/prop-types@npm:15.7.15"
+  checksum: 10/31aa2f59b28f24da6fb4f1d70807dae2aedfce090ec63eaf9ea01727a9533ef6eaf017de5bff99fbccad7d1c9e644f52c6c2ba30869465dd22b1a7221c29f356
+  languageName: node
+  linkType: hard
+
 "@types/prop-types@npm:^15.7.14":
   version: 15.7.14
   resolution: "@types/prop-types@npm:15.7.14"
@@ -12302,7 +12301,7 @@ __metadata:
   languageName: node
   linkType: hard
 
-"@types/trusted-types@npm:*, @types/trusted-types@npm:^2.0.2, @types/trusted-types@npm:^2.0.7":
+"@types/trusted-types@npm:*, @types/trusted-types@npm:^2.0.2":
   version: 2.0.7
   resolution: "@types/trusted-types@npm:2.0.7"
   checksum: 10/8e4202766a65877efcf5d5a41b7dd458480b36195e580a3b1085ad21e948bc417d55d6f8af1fd2a7ad008015d4117d5fdfe432731157da3c68678487174e4ba3
@@ -12316,7 +12315,14 @@ __metadata:
   languageName: node
   linkType: hard
 
-"@types/unist@npm:^2, @types/unist@npm:^2.0.0":
+"@types/unist@npm:^2":
+  version: 2.0.11
+  resolution: "@types/unist@npm:2.0.11"
+  checksum: 10/6d436e832bc35c6dde9f056ac515ebf2b3384a1d7f63679d12358766f9b313368077402e9c1126a14d827f10370a5485e628bf61aa91117cf4fc882423191a4e
+  languageName: node
+  linkType: hard
+
+"@types/unist@npm:^2.0.0":
   version: 2.0.10
   resolution: "@types/unist@npm:2.0.10"
   checksum: 10/e2924e18dedf45f68a5c6ccd6015cd62f1643b1b43baac1854efa21ae9e70505db94290434a23da1137d9e31eb58e54ca175982005698ac37300a1c889f6c4aa
@@ -18424,18 +18430,6 @@ __metadata:
   languageName: node
   linkType: hard
 
-"dompurify@npm:*, dompurify@npm:^3.2.6":
-  version: 3.2.6
-  resolution: "dompurify@npm:3.2.6"
-  dependencies:
-    "@types/trusted-types": "npm:^2.0.7"
-  dependenciesMeta:
-    "@types/trusted-types":
-      optional: true
-  checksum: 10/b91631ed0e4d17fae950ef53613cc009ed7e73adc43ac94a41dd52f35483f7538d13caebdafa7626e0da145fc8184e7ac7935f14f25b7e841b32fda777e40447
-  languageName: node
-  linkType: hard
-
 "dompurify@npm:2.5.7":
   version: 2.5.7
   resolution: "dompurify@npm:2.5.7"
@@ -18804,6 +18798,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"entities@npm:^6.0.0":
+  version: 6.0.1
+  resolution: "entities@npm:6.0.1"
+  checksum: 10/62af1307202884349d2867f0aac5c60d8b57102ea0b0e768b16246099512c28e239254ad772d6834e7e14cb1b6f153fc3d0c031934e3183b086c86d3838d874a
+  languageName: node
+  linkType: hard
+
 "env-paths@npm:^2.2.0":
   version: 2.2.1
   resolution: "env-paths@npm:2.2.1"
@@ -22353,6 +22354,63 @@ __metadata:
   languageName: node
   linkType: hard
 
+"hast-util-from-parse5@npm:^8.0.0":
+  version: 8.0.3
+  resolution: "hast-util-from-parse5@npm:8.0.3"
+  dependencies:
+    "@types/hast": "npm:^3.0.0"
+    "@types/unist": "npm:^3.0.0"
+    devlop: "npm:^1.0.0"
+    hastscript: "npm:^9.0.0"
+    property-information: "npm:^7.0.0"
+    vfile: "npm:^6.0.0"
+    vfile-location: "npm:^5.0.0"
+    web-namespaces: "npm:^2.0.0"
+  checksum: 10/539c945c550cfef394a89dcff6e4de26768a748a7288ddce6f59554dd271b663b8398d58ace434264e965aaf3828fdbff86f9109d7fa639b3fe34dedcad4a5df
+  languageName: node
+  linkType: hard
+
+"hast-util-parse-selector@npm:^4.0.0":
+  version: 4.0.0
+  resolution: "hast-util-parse-selector@npm:4.0.0"
+  dependencies:
+    "@types/hast": "npm:^3.0.0"
+  checksum: 10/76087670d3b0b50b23a6cb70bca53a6176d6608307ccdbb3ed18b650b82e7c3513bfc40348f1389dc0c5ae872b9a768851f4335f44654abd7deafd6974c52402
+  languageName: node
+  linkType: hard
+
+"hast-util-raw@npm:^9.0.0":
+  version: 9.1.0
+  resolution: "hast-util-raw@npm:9.1.0"
+  dependencies:
+    "@types/hast": "npm:^3.0.0"
+    "@types/unist": "npm:^3.0.0"
+    "@ungap/structured-clone": "npm:^1.0.0"
+    hast-util-from-parse5: "npm:^8.0.0"
+    hast-util-to-parse5: "npm:^8.0.0"
+    html-void-elements: "npm:^3.0.0"
+    mdast-util-to-hast: "npm:^13.0.0"
+    parse5: "npm:^7.0.0"
+    unist-util-position: "npm:^5.0.0"
+    unist-util-visit: "npm:^5.0.0"
+    vfile: "npm:^6.0.0"
+    web-namespaces: "npm:^2.0.0"
+    zwitch: "npm:^2.0.0"
+  checksum: 10/fa304d08a9fce0f54b2baa18d15c45cb5cac695cbee3567b8ccbd9a57fa295c0fb23d238daca1cf0135ad8d538bb341dcd7d9da03f8b7d12e6980a9f8c4340ae
+  languageName: node
+  linkType: hard
+
+"hast-util-sanitize@npm:^5.0.0":
+  version: 5.0.2
+  resolution: "hast-util-sanitize@npm:5.0.2"
+  dependencies:
+    "@types/hast": "npm:^3.0.0"
+    "@ungap/structured-clone": "npm:^1.0.0"
+    unist-util-position: "npm:^5.0.0"
+  checksum: 10/920d4d78c8f73962e2440e626c02f65e832de3be5c49ddd101eee2269982489efa5aac7780e487bdebfcc407b1cb20ceea21fb48b690dd686d9a18273bffb817
+  languageName: node
+  linkType: hard
+
 "hast-util-to-jsx-runtime@npm:^2.0.0":
   version: 2.3.2
   resolution: "hast-util-to-jsx-runtime@npm:2.3.2"
@@ -22376,6 +22434,21 @@ __metadata:
   languageName: node
   linkType: hard
 
+"hast-util-to-parse5@npm:^8.0.0":
+  version: 8.0.0
+  resolution: "hast-util-to-parse5@npm:8.0.0"
+  dependencies:
+    "@types/hast": "npm:^3.0.0"
+    comma-separated-tokens: "npm:^2.0.0"
+    devlop: "npm:^1.0.0"
+    property-information: "npm:^6.0.0"
+    space-separated-tokens: "npm:^2.0.0"
+    web-namespaces: "npm:^2.0.0"
+    zwitch: "npm:^2.0.0"
+  checksum: 10/ba59d0913ba7e914d8b0a50955c06806a6868445c56796ac9129d58185e86d7ff24037246767aba2ea904d9dee8c09b8ff303630bcd854431fdc1bbee2164c36
+  languageName: node
+  linkType: hard
+
 "hast-util-whitespace@npm:^2.0.0":
   version: 2.0.1
   resolution: "hast-util-whitespace@npm:2.0.1"
@@ -22392,6 +22465,19 @@ __metadata:
   languageName: node
   linkType: hard
 
+"hastscript@npm:^9.0.0":
+  version: 9.0.1
+  resolution: "hastscript@npm:9.0.1"
+  dependencies:
+    "@types/hast": "npm:^3.0.0"
+    comma-separated-tokens: "npm:^2.0.0"
+    hast-util-parse-selector: "npm:^4.0.0"
+    property-information: "npm:^7.0.0"
+    space-separated-tokens: "npm:^2.0.0"
+  checksum: 10/9aa8135faf0307807cca4075bef4e3403ae1ce959ad4b9e6720892ba957d58ff98b2f60b5eb3ac67d88ae897dc918997299cd4249d7ac602a0066dd46442c5d4
+  languageName: node
+  linkType: hard
+
 "he@npm:^1.2.0":
   version: 1.2.0
   resolution: "he@npm:1.2.0"
@@ -22577,6 +22663,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"html-void-elements@npm:^3.0.0":
+  version: 3.0.0
+  resolution: "html-void-elements@npm:3.0.0"
+  checksum: 10/59be397525465a7489028afa064c55763d9cccd1d7d9f630cca47137317f0e897a9ca26cef7e745e7cff1abc44260cfa407742b243a54261dfacd42230e94fce
+  languageName: node
+  linkType: hard
+
 "html-webpack-plugin@npm:^5.5.0":
   version: 5.5.3
   resolution: "html-webpack-plugin@npm:5.5.3"
@@ -26249,6 +26342,18 @@ __metadata:
   languageName: node
   linkType: hard
 
+"mdast-util-find-and-replace@npm:^2.0.0":
+  version: 2.2.2
+  resolution: "mdast-util-find-and-replace@npm:2.2.2"
+  dependencies:
+    "@types/mdast": "npm:^3.0.0"
+    escape-string-regexp: "npm:^5.0.0"
+    unist-util-is: "npm:^5.0.0"
+    unist-util-visit-parents: "npm:^5.0.0"
+  checksum: 10/59e11e853b74d8f6083950327df39e27287b383930ff836298a5100aeda5568282bb45046c27886d2156ea101580bb0689b890c29623cefa5adc74e95d9ca9ff
+  languageName: node
+  linkType: hard
+
 "mdast-util-from-markdown@npm:^1.0.0":
   version: 1.3.1
   resolution: "mdast-util-from-markdown@npm:1.3.1"
@@ -26303,6 +26408,39 @@ __metadata:
   languageName: node
   linkType: hard
 
+"mdast-util-gfm-autolink-literal@npm:^1.0.0":
+  version: 1.0.3
+  resolution: "mdast-util-gfm-autolink-literal@npm:1.0.3"
+  dependencies:
+    "@types/mdast": "npm:^3.0.0"
+    ccount: "npm:^2.0.0"
+    mdast-util-find-and-replace: "npm:^2.0.0"
+    micromark-util-character: "npm:^1.0.0"
+  checksum: 10/272d075cdc7937bec0179af4052bd9032a6fbb05608b387b1b075b0491c73ce012f3ff1c718cdb5fb0ed1032c1fa7570d955b59c0ab3c3c72609928754774529
+  languageName: node
+  linkType: hard
+
+"mdast-util-gfm-footnote@npm:^1.0.0":
+  version: 1.0.2
+  resolution: "mdast-util-gfm-footnote@npm:1.0.2"
+  dependencies:
+    "@types/mdast": "npm:^3.0.0"
+    mdast-util-to-markdown: "npm:^1.3.0"
+    micromark-util-normalize-identifier: "npm:^1.0.0"
+  checksum: 10/825f207afc98fd1daa0acc8adcb5754d1f0d577ccb1749245289bee7c892557668d8ee3a5ab618f42e710646cf018dcda84f3c0c608ae11718e9014e5bf4f9dc
+  languageName: node
+  linkType: hard
+
+"mdast-util-gfm-strikethrough@npm:^1.0.0":
+  version: 1.0.3
+  resolution: "mdast-util-gfm-strikethrough@npm:1.0.3"
+  dependencies:
+    "@types/mdast": "npm:^3.0.0"
+    mdast-util-to-markdown: "npm:^1.3.0"
+  checksum: 10/a9c2dc3ef46be7952d13b7063a16171bba8aa266bffe6b1e7267df02a60b4fa3734115cca311e9127db8cfcbbcd68fdd92aa26152bcd0c14372c79b254e4df2f
+  languageName: node
+  linkType: hard
+
 "mdast-util-gfm-strikethrough@npm:^2.0.0":
   version: 2.0.0
   resolution: "mdast-util-gfm-strikethrough@npm:2.0.0"
@@ -26314,6 +26452,18 @@ __metadata:
   languageName: node
   linkType: hard
 
+"mdast-util-gfm-table@npm:^1.0.0":
+  version: 1.0.7
+  resolution: "mdast-util-gfm-table@npm:1.0.7"
+  dependencies:
+    "@types/mdast": "npm:^3.0.0"
+    markdown-table: "npm:^3.0.0"
+    mdast-util-from-markdown: "npm:^1.0.0"
+    mdast-util-to-markdown: "npm:^1.3.0"
+  checksum: 10/167f7f7a9dc17ce852f4f9bd155d7be179588e2ccf4ce3c4f23b12c1c9db5de904cdacc6f41b2d635cb84eb09a7ff5a33497585f2664a7f1e6bd6f7ab7e1197a
+  languageName: node
+  linkType: hard
+
 "mdast-util-gfm-table@npm:^2.0.0":
   version: 2.0.0
   resolution: "mdast-util-gfm-table@npm:2.0.0"
@@ -26327,6 +26477,16 @@ __metadata:
   languageName: node
   linkType: hard
 
+"mdast-util-gfm-task-list-item@npm:^1.0.0":
+  version: 1.0.2
+  resolution: "mdast-util-gfm-task-list-item@npm:1.0.2"
+  dependencies:
+    "@types/mdast": "npm:^3.0.0"
+    mdast-util-to-markdown: "npm:^1.3.0"
+  checksum: 10/958417a7d7690728b44d65127ab9189c7feaa17aea924dd56a888c781ab3abaa4eb0c209f05c4dbf203da3d0c4df8fdace4c9471b644268bfc7fc792a018a171
+  languageName: node
+  linkType: hard
+
 "mdast-util-gfm-task-list-item@npm:^2.0.0":
   version: 2.0.0
   resolution: "mdast-util-gfm-task-list-item@npm:2.0.0"
@@ -26339,6 +26499,21 @@ __metadata:
   languageName: node
   linkType: hard
 
+"mdast-util-gfm@npm:^2.0.0":
+  version: 2.0.2
+  resolution: "mdast-util-gfm@npm:2.0.2"
+  dependencies:
+    mdast-util-from-markdown: "npm:^1.0.0"
+    mdast-util-gfm-autolink-literal: "npm:^1.0.0"
+    mdast-util-gfm-footnote: "npm:^1.0.0"
+    mdast-util-gfm-strikethrough: "npm:^1.0.0"
+    mdast-util-gfm-table: "npm:^1.0.0"
+    mdast-util-gfm-task-list-item: "npm:^1.0.0"
+    mdast-util-to-markdown: "npm:^1.0.0"
+  checksum: 10/70e6cd32af94181d409f171f984f83fc18b3efe316844c62f31816f5c1612a92517b8ed766340f23e0a6d6cb0f27a8b07d288bab6619cbdbb0c5341006bcdc4d
+  languageName: node
+  linkType: hard
+
 "mdast-util-highlight-mark@npm:^1.2.2":
   version: 1.2.2
   resolution: "mdast-util-highlight-mark@npm:1.2.2"
@@ -26409,6 +26584,16 @@ __metadata:
   languageName: node
   linkType: hard
 
+"mdast-util-phrasing@npm:^3.0.0":
+  version: 3.0.1
+  resolution: "mdast-util-phrasing@npm:3.0.1"
+  dependencies:
+    "@types/mdast": "npm:^3.0.0"
+    unist-util-is: "npm:^5.0.0"
+  checksum: 10/c5b616d9b1eb76a6b351d195d94318494722525a12a89d9c8a3b091af7db3dd1fc55d294f9d29266d8159a8267b0df4a7a133bda8a3909d5331c383e1e1ff328
+  languageName: node
+  linkType: hard
+
 "mdast-util-phrasing@npm:^4.0.0":
   version: 4.1.0
   resolution: "mdast-util-phrasing@npm:4.1.0"
@@ -26452,6 +26637,22 @@ __metadata:
   languageName: node
   linkType: hard
 
+"mdast-util-to-markdown@npm:^1.0.0, mdast-util-to-markdown@npm:^1.3.0":
+  version: 1.5.0
+  resolution: "mdast-util-to-markdown@npm:1.5.0"
+  dependencies:
+    "@types/mdast": "npm:^3.0.0"
+    "@types/unist": "npm:^2.0.0"
+    longest-streak: "npm:^3.0.0"
+    mdast-util-phrasing: "npm:^3.0.0"
+    mdast-util-to-string: "npm:^3.0.0"
+    micromark-util-decode-string: "npm:^1.0.0"
+    unist-util-visit: "npm:^4.0.0"
+    zwitch: "npm:^2.0.0"
+  checksum: 10/713f674588a01969a2ce524a69985bd57e507377eea2c4ba69800fb305414468b30144ae9b837fbdde8c609877673140e4f56f6cabe9e0e2bc1487291e3c5144
+  languageName: node
+  linkType: hard
+
 "mdast-util-to-markdown@npm:^2.0.0, mdast-util-to-markdown@npm:^2.1.0":
   version: 2.1.2
   resolution: "mdast-util-to-markdown@npm:2.1.2"
@@ -26469,7 +26670,7 @@ __metadata:
   languageName: node
   linkType: hard
 
-"mdast-util-to-string@npm:^3.1.0":
+"mdast-util-to-string@npm:^3.0.0, mdast-util-to-string@npm:^3.1.0":
   version: 3.2.0
   resolution: "mdast-util-to-string@npm:3.2.0"
   dependencies:
@@ -26668,7 +26869,7 @@ __metadata:
   languageName: node
   linkType: hard
 
-"micromark-core-commonmark@npm:^1.0.1":
+"micromark-core-commonmark@npm:^1.0.0, micromark-core-commonmark@npm:^1.0.1":
   version: 1.1.0
   resolution: "micromark-core-commonmark@npm:1.1.0"
   dependencies:
@@ -26743,6 +26944,48 @@ __metadata:
   languageName: node
   linkType: hard
 
+"micromark-extension-gfm-autolink-literal@npm:^1.0.0":
+  version: 1.0.5
+  resolution: "micromark-extension-gfm-autolink-literal@npm:1.0.5"
+  dependencies:
+    micromark-util-character: "npm:^1.0.0"
+    micromark-util-sanitize-uri: "npm:^1.0.0"
+    micromark-util-symbol: "npm:^1.0.0"
+    micromark-util-types: "npm:^1.0.0"
+  checksum: 10/1e0ccc758baef3cd0478ba84ff86fa1ec2b389042421c7cade9485b775456c1a9c3bd797393002b2c6f6abd9bdf829cb114874557bbcb8e43d16d06a464811c0
+  languageName: node
+  linkType: hard
+
+"micromark-extension-gfm-footnote@npm:^1.0.0":
+  version: 1.1.2
+  resolution: "micromark-extension-gfm-footnote@npm:1.1.2"
+  dependencies:
+    micromark-core-commonmark: "npm:^1.0.0"
+    micromark-factory-space: "npm:^1.0.0"
+    micromark-util-character: "npm:^1.0.0"
+    micromark-util-normalize-identifier: "npm:^1.0.0"
+    micromark-util-sanitize-uri: "npm:^1.0.0"
+    micromark-util-symbol: "npm:^1.0.0"
+    micromark-util-types: "npm:^1.0.0"
+    uvu: "npm:^0.5.0"
+  checksum: 10/8777073fb76d2fd01f6b2405106af6c349c1e25660c4d37cadcc61c187d71c8444870f73cefaaa67f12884d5e45c78ee3c5583561a0b330bd91c6d997113584a
+  languageName: node
+  linkType: hard
+
+"micromark-extension-gfm-strikethrough@npm:^1.0.0":
+  version: 1.0.7
+  resolution: "micromark-extension-gfm-strikethrough@npm:1.0.7"
+  dependencies:
+    micromark-util-chunked: "npm:^1.0.0"
+    micromark-util-classify-character: "npm:^1.0.0"
+    micromark-util-resolve-all: "npm:^1.0.0"
+    micromark-util-symbol: "npm:^1.0.0"
+    micromark-util-types: "npm:^1.0.0"
+    uvu: "npm:^0.5.0"
+  checksum: 10/8411ef1aa5dc83f662e8b45b085f70ddff29deb3c4259269e8a1ff656397abb755d8ea841a14be23e8585a31d3c0a5de1bd2c05f3453b66670e499d4a0004f5e
+  languageName: node
+  linkType: hard
+
 "micromark-extension-gfm-strikethrough@npm:^2.0.0":
   version: 2.1.0
   resolution: "micromark-extension-gfm-strikethrough@npm:2.1.0"
@@ -26757,6 +27000,19 @@ __metadata:
   languageName: node
   linkType: hard
 
+"micromark-extension-gfm-table@npm:^1.0.0":
+  version: 1.0.7
+  resolution: "micromark-extension-gfm-table@npm:1.0.7"
+  dependencies:
+    micromark-factory-space: "npm:^1.0.0"
+    micromark-util-character: "npm:^1.0.0"
+    micromark-util-symbol: "npm:^1.0.0"
+    micromark-util-types: "npm:^1.0.0"
+    uvu: "npm:^0.5.0"
+  checksum: 10/f05d86a099c941a2a309d60bf4839d16a00a93cb880cda4ab8faeb831647763fff6e03197ec15b80e1f195002afcca6afe2b95c3622b049b82d7ff8ef1c1c776
+  languageName: node
+  linkType: hard
+
 "micromark-extension-gfm-table@npm:^2.0.0":
   version: 2.1.1
   resolution: "micromark-extension-gfm-table@npm:2.1.1"
@@ -26770,6 +27026,28 @@ __metadata:
   languageName: node
   linkType: hard
 
+"micromark-extension-gfm-tagfilter@npm:^1.0.0":
+  version: 1.0.2
+  resolution: "micromark-extension-gfm-tagfilter@npm:1.0.2"
+  dependencies:
+    micromark-util-types: "npm:^1.0.0"
+  checksum: 10/55c7d9019d6a39efaaed2c2e40b0aaa137d2c4f9c94cac82e93f509a806c3a775e4c815b5d8e986617450b68861a19776e4b886307e83db452b393f15a837b39
+  languageName: node
+  linkType: hard
+
+"micromark-extension-gfm-task-list-item@npm:^1.0.0":
+  version: 1.0.5
+  resolution: "micromark-extension-gfm-task-list-item@npm:1.0.5"
+  dependencies:
+    micromark-factory-space: "npm:^1.0.0"
+    micromark-util-character: "npm:^1.0.0"
+    micromark-util-symbol: "npm:^1.0.0"
+    micromark-util-types: "npm:^1.0.0"
+    uvu: "npm:^0.5.0"
+  checksum: 10/46bb1baa10bfb785a2e3e2f975e5509260b9995d5c3aeddf77051957d218ce1af4ea737bcb6a56a930e62d42b05307b20632a400eff25cdb290789ff3170cad5
+  languageName: node
+  linkType: hard
+
 "micromark-extension-gfm-task-list-item@npm:^2.0.1":
   version: 2.1.0
   resolution: "micromark-extension-gfm-task-list-item@npm:2.1.0"
@@ -26783,6 +27061,22 @@ __metadata:
   languageName: node
   linkType: hard
 
+"micromark-extension-gfm@npm:^2.0.0":
+  version: 2.0.3
+  resolution: "micromark-extension-gfm@npm:2.0.3"
+  dependencies:
+    micromark-extension-gfm-autolink-literal: "npm:^1.0.0"
+    micromark-extension-gfm-footnote: "npm:^1.0.0"
+    micromark-extension-gfm-strikethrough: "npm:^1.0.0"
+    micromark-extension-gfm-table: "npm:^1.0.0"
+    micromark-extension-gfm-tagfilter: "npm:^1.0.0"
+    micromark-extension-gfm-task-list-item: "npm:^1.0.0"
+    micromark-util-combine-extensions: "npm:^1.0.0"
+    micromark-util-types: "npm:^1.0.0"
+  checksum: 10/3ffd06ced4314abd0f0c72ec227f034f38dd47facbb62439ef3216d42f32433f3901d14675cf806e8d73689802a11849958b330bb5b55dd4fd5cdc64ebaf345c
+  languageName: node
+  linkType: hard
+
 "micromark-extension-highlight-mark@npm:1.2.0, micromark-extension-highlight-mark@npm:^1.2.0":
   version: 1.2.0
   resolution: "micromark-extension-highlight-mark@npm:1.2.0"
@@ -29171,6 +29465,15 @@ __metadata:
   languageName: node
   linkType: hard
 
+"parse5@npm:^7.0.0":
+  version: 7.3.0
+  resolution: "parse5@npm:7.3.0"
+  dependencies:
+    entities: "npm:^6.0.0"
+  checksum: 10/b0e48be20b820c655b138b86fa6fb3a790de6c891aa2aba536524f8027b4dca4fe538f11a0e5cf2f6f847d120dbb9e4822dcaeb933ff1e10850a2ef0154d1d88
+  languageName: node
+  linkType: hard
+
 "parse5@npm:^7.1.1":
   version: 7.1.2
   resolution: "parse5@npm:7.1.2"
@@ -30763,6 +31066,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"property-information@npm:^7.0.0":
+  version: 7.1.0
+  resolution: "property-information@npm:7.1.0"
+  checksum: 10/896d38a52ad7170de73f832d277c69e76a9605d941ebb3f0d6e56271414a7fdf95ff6d2819e68036b8a0c7d2d4d88bf1d4a5765c032cb19c2343567ee3a14b15
+  languageName: node
+  linkType: hard
+
 "proto-list@npm:~1.2.1":
   version: 1.2.4
   resolution: "proto-list@npm:1.2.4"
@@ -31279,11 +31589,11 @@ __metadata:
   linkType: hard
 
 "react-hook-form@npm:^7.56.1":
-  version: 7.62.0
-  resolution: "react-hook-form@npm:7.62.0"
+  version: 7.63.0
+  resolution: "react-hook-form@npm:7.63.0"
   peerDependencies:
     react: ^16.8.0 || ^17 || ^18 || ^19
-  checksum: 10/092dcf0317ed3e314b124ed9df3f3494cf3447326078cd857f6fdc47aad0504e466ab2fb593bbb8e79c247b8772159f83aebe54a7e5799926b00d7e401d127a6
+  checksum: 10/df07de6fce42bbcd65ed100aaea7d0e907c555c2635c253517225c84f06eab0ebd278578ada4f479ad582c18a52898c4f1cabca327a12a74b8b7e6e54718edbe
   languageName: node
   linkType: hard
 
@@ -32063,6 +32373,27 @@ __metadata:
   languageName: node
   linkType: hard
 
+"rehype-raw@npm:^7.0.0":
+  version: 7.0.0
+  resolution: "rehype-raw@npm:7.0.0"
+  dependencies:
+    "@types/hast": "npm:^3.0.0"
+    hast-util-raw: "npm:^9.0.0"
+    vfile: "npm:^6.0.0"
+  checksum: 10/65dd5809f95410ca5056efe50f5b16cb08a69c0785c6d4ec80c9280487efbaec81d342084f6cfdca5624134c1c4018705d97c37b5c0a21d9625ed8a3c88700f1
+  languageName: node
+  linkType: hard
+
+"rehype-sanitize@npm:^6.0.0":
+  version: 6.0.0
+  resolution: "rehype-sanitize@npm:6.0.0"
+  dependencies:
+    "@types/hast": "npm:^3.0.0"
+    hast-util-sanitize: "npm:^5.0.0"
+  checksum: 10/976e928b4f9da6c515e4fde7e4ae873f815c50ab1a268a3c442468eaa981d117492f991926858d69467f7b131358e441ca6d0be0f60a0034b72b3ce6dc69a387
+  languageName: node
+  linkType: hard
+
 "relateurl@npm:^0.2.7":
   version: 0.2.7
   resolution: "relateurl@npm:0.2.7"
@@ -32081,6 +32412,18 @@ __metadata:
   languageName: node
   linkType: hard
 
+"remark-gfm@npm:^3.0.1":
+  version: 3.0.1
+  resolution: "remark-gfm@npm:3.0.1"
+  dependencies:
+    "@types/mdast": "npm:^3.0.0"
+    mdast-util-gfm: "npm:^2.0.0"
+    micromark-extension-gfm: "npm:^2.0.0"
+    unified: "npm:^10.0.0"
+  checksum: 10/8ec301f5fb1f52c548b5a6d7ca6a3422d55db73cd703f147c979d16dca003f065181f55404d6f3f49d33f1faca3fe56ae731ed7fe0acc00cd945a8e605f155f2
+  languageName: node
+  linkType: hard
+
 "remark-parse@npm:^10.0.0":
   version: 10.0.2
   resolution: "remark-parse@npm:10.0.2"
@@ -35953,7 +36296,7 @@ __metadata:
   languageName: node
   linkType: hard
 
-"unist-util-visit-parents@npm:^5.1.1":
+"unist-util-visit-parents@npm:^5.0.0, unist-util-visit-parents@npm:^5.1.1":
   version: 5.1.3
   resolution: "unist-util-visit-parents@npm:5.1.3"
   dependencies:
@@ -36497,6 +36840,16 @@ __metadata:
   languageName: node
   linkType: hard
 
+"vfile-location@npm:^5.0.0":
+  version: 5.0.3
+  resolution: "vfile-location@npm:5.0.3"
+  dependencies:
+    "@types/unist": "npm:^3.0.0"
+    vfile: "npm:^6.0.0"
+  checksum: 10/f481d592fd507fe242da9a00d7400ded3c91587931f24e64c54f24752d7b30321721a1c99c0d949be1f6ed5fa7f8b169054fd07c744705b65dbdd10a9e4ebfe0
+  languageName: node
+  linkType: hard
+
 "vfile-message@npm:^3.0.0":
   version: 3.1.4
   resolution: "vfile-message@npm:3.1.4"
@@ -37072,6 +37425,13 @@ __metadata:
   languageName: node
   linkType: hard
 
+"web-namespaces@npm:^2.0.0":
+  version: 2.0.1
+  resolution: "web-namespaces@npm:2.0.1"
+  checksum: 10/b6d9f02f1a43d0ef0848a812d89c83801d5bbad57d8bb61f02eb6d7eb794c3736f6cc2e1191664bb26136594c8218ac609f4069722c6f56d9fc2d808fa9271c6
+  languageName: node
+  linkType: hard
+
 "web3-errors@npm:^1.2.0, web3-errors@npm:^1.3.0":
   version: 1.3.0
   resolution: "web3-errors@npm:1.3.0"

From 56aaca87b3c278cecf73894829b1f4520f8d6dfa Mon Sep 17 00:00:00 2001
From: kemuru <102478601+kemuru@users.noreply.github.com>
Date: Mon, 22 Sep 2025 17:49:54 +0900
Subject: [PATCH 142/175] chore: style impros resolver description

---
 web/src/pages/Resolver/Briefing/Description.tsx | 17 +++++++++--------
 web/src/styles/mdxEditorTheme.ts                |  2 ++
 2 files changed, 11 insertions(+), 8 deletions(-)

diff --git a/web/src/pages/Resolver/Briefing/Description.tsx b/web/src/pages/Resolver/Briefing/Description.tsx
index 4a9318f98..55a924621 100644
--- a/web/src/pages/Resolver/Briefing/Description.tsx
+++ b/web/src/pages/Resolver/Briefing/Description.tsx
@@ -17,8 +17,7 @@ const Container = styled.div`
   align-items: center;
 `;
 
-const StyledMarkdownEditor = styled(MarkdownEditor)`
-  width: 84vw;
+const MarkdownEditorContainer = styled.div`
   ${landscapeStyle(
     () => css`
       width: ${responsiveSize(442, 700, 900)};
@@ -49,12 +48,14 @@ const Description: React.FC = () => {
   return (
     <Container ref={containerRef}>
       <Header text="Describe the case" />
-      <StyledMarkdownEditor
-        value={disputeData.description}
-        onChange={handleWrite}
-        placeholder="eg. Bob hired Alice to develop a website for him. Bob claims the contract was not fully respected, and the website was delivered incomplete. For that reason, he wants to pay part of the agreed payment: 150 DAI. On the other hand, Alice claims she should receive the full payment: 250 DAI."
-        showMessage={false}
-      />
+      <MarkdownEditorContainer>
+        <MarkdownEditor
+          value={disputeData.description}
+          onChange={handleWrite}
+          placeholder="eg. Bob hired Alice to develop a website for him, but Bob failed to deliver..."
+          showMessage={false}
+        />
+      </MarkdownEditorContainer>
       <NavigationButtons prevRoute="/resolver/title" nextRoute="/resolver/court" />
     </Container>
   );
diff --git a/web/src/styles/mdxEditorTheme.ts b/web/src/styles/mdxEditorTheme.ts
index 315aaaeca..dede51b07 100644
--- a/web/src/styles/mdxEditorTheme.ts
+++ b/web/src/styles/mdxEditorTheme.ts
@@ -69,6 +69,8 @@ export const MDXEditorContainer = styled.div`
   width: 100%;
 
   .mdxeditor-toolbar {
+    display: flex;
+    flex-wrap: wrap;
     background-color: ${({ theme }) => theme.lightGrey} !important;
     border: 1px solid ${({ theme }) => theme.stroke} !important;
     border-radius: 3px;

From 94e47834f9df7a388ba59a837f702d1f46114228 Mon Sep 17 00:00:00 2001
From: kemuru <102478601+kemuru@users.noreply.github.com>
Date: Mon, 22 Sep 2025 18:02:35 +0900
Subject: [PATCH 143/175] chore: slight transition and coloring

---
 web/src/styles/mdxEditorTheme.ts | 7 +++++--
 1 file changed, 5 insertions(+), 2 deletions(-)

diff --git a/web/src/styles/mdxEditorTheme.ts b/web/src/styles/mdxEditorTheme.ts
index dede51b07..7bbfe2687 100644
--- a/web/src/styles/mdxEditorTheme.ts
+++ b/web/src/styles/mdxEditorTheme.ts
@@ -1,8 +1,11 @@
 import styled, { createGlobalStyle, css } from "styled-components";
 
 const sharedContentStyles = css`
-  .mdxeditor-root-contenteditable div {
-    padding: 0;
+  .mdxeditor-root-contenteditable {
+    transition: background-color 0.1s ease !important;
+    :hover {
+      background-color: ${({ theme }) => theme.lightGrey}60 !important;
+    }
   }
 
   .mdxeditor-root-contenteditable p {

From a8d32b8977adb5ce1974593ea54a77cfc0b59a0e Mon Sep 17 00:00:00 2001
From: kemuru <102478601+kemuru@users.noreply.github.com>
Date: Mon, 22 Sep 2025 18:23:36 +0900
Subject: [PATCH 144/175] chore: small styling issue

---
 web/src/styles/mdxEditorTheme.ts | 1 +
 1 file changed, 1 insertion(+)

diff --git a/web/src/styles/mdxEditorTheme.ts b/web/src/styles/mdxEditorTheme.ts
index 7bbfe2687..0ef1d8b21 100644
--- a/web/src/styles/mdxEditorTheme.ts
+++ b/web/src/styles/mdxEditorTheme.ts
@@ -175,6 +175,7 @@ export const MDXEditorGlobalStyles = createGlobalStyle`
 
   [class*="codeMirrorWrapper"] {
     border: 1px solid ${({ theme }) => theme.stroke} !important;
+    padding: 0 !important;
   }
 
   [class*="activeLineGutter"] {

From 6752cadba741b98f46c802a7b3b945410af63dee Mon Sep 17 00:00:00 2001
From: unknownunknown1 <danil@kleros.io>
Date: Wed, 24 Sep 2025 04:01:00 +1000
Subject: [PATCH 145/175] feat: fuzzing tests

---
 .../arbitrables/ArbitrableExample.sol         |   8 +-
 .../test/foundry/KlerosCore_Appeals.t.sol     | 126 ++++++++++++
 .../test/foundry/KlerosCore_Disputes.t.sol    |  47 ++++-
 .../test/foundry/KlerosCore_Drawing.t.sol     |  86 +++++++++
 .../test/foundry/KlerosCore_Execution.t.sol   |  99 ++++++++++
 .../test/foundry/KlerosCore_Staking.t.sol     | 179 +++++++++++++++++-
 .../test/foundry/KlerosCore_Voting.t.sol      |  57 +++++-
 7 files changed, 597 insertions(+), 5 deletions(-)

diff --git a/contracts/src/arbitration/arbitrables/ArbitrableExample.sol b/contracts/src/arbitration/arbitrables/ArbitrableExample.sol
index c0f052202..1282876e5 100644
--- a/contracts/src/arbitration/arbitrables/ArbitrableExample.sol
+++ b/contracts/src/arbitration/arbitrables/ArbitrableExample.sol
@@ -40,6 +40,8 @@ contract ArbitrableExample is IArbitrableV2 {
     mapping(uint256 => uint256) public externalIDtoLocalID; // Maps external (arbitrator side) dispute IDs to local dispute IDs.
     DisputeStruct[] public disputes; // Stores the disputes' info. disputes[disputeID].
 
+    uint256 public numberOfRulingOptions = 2;
+
     // ************************************* //
     // *        Function Modifiers         * //
     // ************************************* //
@@ -100,6 +102,10 @@ contract ArbitrableExample is IArbitrableV2 {
         templateId = templateRegistry.setDisputeTemplate("", _templateData, _templateDataMappings);
     }
 
+    function changeNumberOfRulingOptions(uint256 _numberOfRulingOptions) external onlyByOwner {
+        numberOfRulingOptions = _numberOfRulingOptions;
+    }
+
     // ************************************* //
     // *         State Modifiers           * //
     // ************************************* //
@@ -111,7 +117,6 @@ contract ArbitrableExample is IArbitrableV2 {
     function createDispute(string calldata _action) external payable returns (uint256 disputeID) {
         emit Action(_action);
 
-        uint256 numberOfRulingOptions = 2;
         uint256 localDisputeID = disputes.length;
         disputes.push(DisputeStruct({isRuled: false, ruling: 0, numberOfRulingOptions: numberOfRulingOptions}));
 
@@ -130,7 +135,6 @@ contract ArbitrableExample is IArbitrableV2 {
     function createDispute(string calldata _action, uint256 _feeInWeth) external returns (uint256 disputeID) {
         emit Action(_action);
 
-        uint256 numberOfRulingOptions = 2;
         uint256 localDisputeID = disputes.length;
         disputes.push(DisputeStruct({isRuled: false, ruling: 0, numberOfRulingOptions: numberOfRulingOptions}));
 
diff --git a/contracts/test/foundry/KlerosCore_Appeals.t.sol b/contracts/test/foundry/KlerosCore_Appeals.t.sol
index c5016f23c..79e575e81 100644
--- a/contracts/test/foundry/KlerosCore_Appeals.t.sol
+++ b/contracts/test/foundry/KlerosCore_Appeals.t.sol
@@ -500,4 +500,130 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
         emit KlerosCore.NewPeriod(disputeID, KlerosCore.Period.execution);
         core.passPeriod(disputeID);
     }
+
+    function testFuzz_appeal(uint256 numberOfOptions, uint256 choice1, uint256 choice2, uint256 choice3) public {
+        uint256 disputeID = 0;
+
+        arbitrable.changeNumberOfRulingOptions(numberOfOptions);
+
+        // Have only 2 options for 3 jurors to create a majority
+        vm.assume(choice1 <= numberOfOptions);
+        vm.assume(choice2 <= numberOfOptions);
+        vm.assume(choice3 <= numberOfOptions); // Will be used for appeal
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 2000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+
+        (uint256 numberOfChoices, , ) = disputeKit.disputes(disputeID);
+
+        assertEq(numberOfChoices, numberOfOptions, "Wrong numberOfChoices");
+
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        // Split the stakers' votes. The first staker will get VoteID 0 and the second will take the rest.
+        core.draw(disputeID, 1);
+
+        vm.warp(block.timestamp + maxDrawingTime);
+        sortitionModule.passPhase(); // Staking phase to stake the 2nd voter
+        vm.prank(staker2);
+        core.setStake(GENERAL_COURT, 20000);
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        core.draw(disputeID, 2); // Assign leftover votes to staker2
+
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Vote
+
+        uint256[] memory voteIDs = new uint256[](1);
+        voteIDs[0] = 0;
+        vm.prank(staker1);
+        disputeKit.castVote(disputeID, voteIDs, choice1, 0, "XYZ"); // Staker1 only got 1 vote because of low stake
+
+        voteIDs = new uint256[](2);
+        voteIDs[0] = 1;
+        voteIDs[1] = 2;
+        vm.prank(staker2);
+        disputeKit.castVote(disputeID, voteIDs, choice2, 0, "XYZ");
+        core.passPeriod(disputeID); // Appeal
+
+        vm.assume(choice3 != choice2);
+        vm.prank(crowdfunder1);
+        disputeKit.fundAppeal{value: 0.63 ether}(disputeID, choice3); // Fund the losing choice. Total cost will be 0.63 (0.21 + 0.21 * (20000/10000))
+
+        assertEq((disputeKit.getFundedChoices(disputeID)).length, 1, "1 choice should be funded");
+
+        vm.prank(crowdfunder1);
+        disputeKit.fundAppeal{value: 0.42 ether}(disputeID, choice2); // Fund the winning choice. Total cost will be 0.42 (0.21 + 0.21 * (10000/10000))
+
+        assertEq((disputeKit.getFundedChoices(disputeID)).length, 0, "No funded choices in a fresh round");
+    }
+
+    function testFuzz_fundAppeal_msgValue(uint256 appealValue) public {
+        uint256 disputeID = 0;
+
+        vm.assume(appealValue <= 10 ether);
+        vm.deal(crowdfunder1, 10 ether);
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 2000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        // Split the stakers' votes. The first staker will get VoteID 0 and the second will take the rest.
+        core.draw(disputeID, 1);
+
+        vm.warp(block.timestamp + maxDrawingTime);
+        sortitionModule.passPhase(); // Staking phase to stake the 2nd voter
+        vm.prank(staker2);
+        core.setStake(GENERAL_COURT, 20000);
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        core.draw(disputeID, 2); // Assign leftover votes to staker2
+
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Vote
+
+        uint256[] memory voteIDs = new uint256[](1);
+        voteIDs[0] = 0;
+        vm.prank(staker1);
+        disputeKit.castVote(disputeID, voteIDs, 1, 0, "XYZ"); // Staker1 only got 1 vote because of low stake
+
+        voteIDs = new uint256[](2);
+        voteIDs[0] = 1;
+        voteIDs[1] = 2;
+        vm.prank(staker2);
+        disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
+        core.passPeriod(disputeID); // Appeal
+
+        vm.prank(crowdfunder1);
+        disputeKit.fundAppeal{value: appealValue}(disputeID, 1); // Fund the losing choice
+
+        if (appealValue >= 0.63 ether) {
+            // 0.63 eth is the required amount for losing side.
+            assertEq((disputeKit.getFundedChoices(disputeID)).length, 1, "One choice should be funded");
+            // Dispute kit shouldn't demand more value than necessary
+            assertEq(crowdfunder1.balance, 9.37 ether, "Wrong balance of the crowdfunder");
+            assertEq(address(disputeKit).balance, 0.63 ether, "Wrong balance of the DK");
+        } else {
+            assertEq((disputeKit.getFundedChoices(disputeID)).length, 0, "No choices should be funded");
+            assertEq(crowdfunder1.balance, 10 ether - appealValue, "Wrong balance of the crowdfunder");
+            assertEq(address(disputeKit).balance, appealValue, "Wrong balance of the DK");
+        }
+    }
 }
diff --git a/contracts/test/foundry/KlerosCore_Disputes.t.sol b/contracts/test/foundry/KlerosCore_Disputes.t.sol
index 5b61c93cb..2d029ddcf 100644
--- a/contracts/test/foundry/KlerosCore_Disputes.t.sol
+++ b/contracts/test/foundry/KlerosCore_Disputes.t.sol
@@ -94,7 +94,7 @@ contract KlerosCore_DisputesTest is KlerosCore_TestBase {
         assertEq(jumped, false, "jumped should be false");
         assertEq(extraData, newExtraData, "Wrong extra data");
         assertEq(disputeKit.coreDisputeIDToLocal(0), disputeID, "Wrong local disputeID");
-        assertEq(disputeKit.coreDisputeIDToActive(0), true, "Wrong disputes length");
+        assertEq(disputeKit.coreDisputeIDToActive(0), true, "Dispute should be active in this DK");
 
         (
             uint256 winningChoice,
@@ -146,4 +146,49 @@ contract KlerosCore_DisputesTest is KlerosCore_TestBase {
         assertEq(feeToken.balanceOf(address(core)), 0.18 ether, "Wrong token balance of the core");
         assertEq(feeToken.balanceOf(disputer), 0.82 ether, "Wrong token balance of the disputer");
     }
+
+    function testFuzz_createDispute_msgValue(uint256 disputeValue) public {
+        uint256 disputeID = 0;
+        uint256 arbitrationCost = core.arbitrationCost(arbitratorExtraData);
+
+        // Cap it to 10 eth, so the number of jurors is not astronomical.
+        vm.assume(disputeValue >= arbitrationCost && disputeValue <= 10 ether);
+        vm.deal(disputer, 10 ether);
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 2000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: disputeValue}("Action");
+
+        KlerosCore.Round memory round = core.getRoundInfo(disputeID, 0);
+        assertEq(round.totalFeesForJurors, disputeValue, "Wrong totalFeesForJurors");
+        assertEq(round.nbVotes, disputeValue / feeForJuror, "Wrong nbVotes");
+
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        core.draw(disputeID, disputeValue / feeForJuror);
+
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Vote
+
+        uint256[] memory voteIDs = new uint256[](disputeValue / feeForJuror);
+        for (uint256 i = 0; i < voteIDs.length; i++) {
+            voteIDs[i] = i;
+        }
+
+        vm.prank(staker1);
+        disputeKit.castVote(disputeID, voteIDs, 1, 0, "XYZ");
+
+        core.passPeriod(disputeID); // Appeal
+
+        vm.warp(block.timestamp + timesPerPeriod[3]);
+        core.passPeriod(disputeID); // Execution
+
+        vm.expectEmit(true, true, true, true);
+        emit IArbitrableV2.Ruling(IArbitratorV2(address(core)), disputeID, 1);
+        core.executeRuling(disputeID);
+    }
 }
diff --git a/contracts/test/foundry/KlerosCore_Drawing.t.sol b/contracts/test/foundry/KlerosCore_Drawing.t.sol
index 9bffbc27d..2db69e612 100644
--- a/contracts/test/foundry/KlerosCore_Drawing.t.sol
+++ b/contracts/test/foundry/KlerosCore_Drawing.t.sol
@@ -121,4 +121,90 @@ contract KlerosCore_DrawingTest is KlerosCore_TestBase {
         (, , , , uint256 nbVoters, ) = disputeKit.getRoundInfo(disputeID, roundID, 0);
         assertEq(nbVoters, 3, "nbVoters should be 3");
     }
+
+    function testFuzz_drawIterations(uint256 iterations) public {
+        uint256 disputeID = 0;
+        uint256 roundID = 0;
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 2000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        core.draw(disputeID, iterations);
+
+        uint256 iterationsCount;
+        uint256 disputesWithoutJurors;
+        if (iterations < DEFAULT_NB_OF_JURORS) {
+            iterationsCount = iterations;
+            disputesWithoutJurors = 1;
+        } else {
+            iterationsCount = DEFAULT_NB_OF_JURORS;
+            disputesWithoutJurors = 0;
+        }
+
+        KlerosCore.Round memory round = core.getRoundInfo(disputeID, roundID);
+        assertEq(round.drawIterations, iterationsCount, "Wrong drawIterations number");
+        assertEq(round.nbVotes, DEFAULT_NB_OF_JURORS, "Wrong nbVotes");
+
+        (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, ) = sortitionModule.getJurorBalance(
+            staker1,
+            GENERAL_COURT
+        );
+        uint256 pnkAtStake = (minStake * alpha) / ONE_BASIS_POINT;
+        assertEq(totalStaked, 2000, "Wrong amount total staked");
+        assertEq(totalLocked, pnkAtStake * iterationsCount, "Wrong amount locked"); // 1000 per draw
+        assertEq(stakedInCourt, 2000, "Wrong amount staked in court");
+        assertEq(sortitionModule.disputesWithoutJurors(), disputesWithoutJurors, "Wrong disputesWithoutJurors count");
+    }
+
+    function testFuzz_drawIterations_nbJurors(uint256 iterations, uint256 disputeValue) public {
+        uint256 disputeID = 0;
+        uint256 roundID = 0;
+
+        uint256 arbitrationCost = core.arbitrationCost(arbitratorExtraData);
+        // Cap it to 10 eth, so the number of jurors is not astronomical.
+        vm.assume(disputeValue >= arbitrationCost && disputeValue <= 10 ether);
+        vm.deal(disputer, 10 ether);
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 2000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: disputeValue}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        core.draw(disputeID, iterations);
+
+        KlerosCore.Round memory round = core.getRoundInfo(disputeID, roundID);
+        assertEq(round.totalFeesForJurors, disputeValue, "Wrong totalFeesForJurors");
+        assertEq(round.nbVotes, disputeValue / feeForJuror, "Wrong nbVotes");
+
+        uint256 iterationsCount;
+        uint256 disputesWithoutJurors;
+        if (iterations < round.nbVotes) {
+            iterationsCount = iterations;
+            disputesWithoutJurors = 1;
+        } else {
+            iterationsCount = round.nbVotes;
+            disputesWithoutJurors = 0;
+        }
+
+        assertEq(round.drawIterations, iterationsCount, "Wrong drawIterations number");
+        (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, ) = sortitionModule.getJurorBalance(
+            staker1,
+            GENERAL_COURT
+        );
+        uint256 pnkAtStake = (minStake * alpha) / ONE_BASIS_POINT;
+        assertEq(totalStaked, 2000, "Wrong amount total staked");
+        assertEq(totalLocked, pnkAtStake * iterationsCount, "Wrong amount locked");
+        assertEq(stakedInCourt, 2000, "Wrong amount staked in court");
+        assertEq(sortitionModule.disputesWithoutJurors(), disputesWithoutJurors, "Wrong disputesWithoutJurors count");
+    }
 }
diff --git a/contracts/test/foundry/KlerosCore_Execution.t.sol b/contracts/test/foundry/KlerosCore_Execution.t.sol
index c6f03ac49..bbce3234a 100644
--- a/contracts/test/foundry/KlerosCore_Execution.t.sol
+++ b/contracts/test/foundry/KlerosCore_Execution.t.sol
@@ -748,4 +748,103 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
         assertEq(crowdfunder2.balance, 10 ether, "Wrong balance of the crowdfunder2");
         assertEq(address(disputeKit).balance, 0, "Wrong balance of the DK");
     }
+
+    function testFuzz_executeIterations(uint256 iterations) public {
+        uint256 disputeID = 0;
+        uint256 roundID = 0;
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 2000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        core.draw(disputeID, 3);
+
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Vote
+
+        uint256[] memory voteIDs = new uint256[](3);
+        voteIDs[0] = 0;
+        voteIDs[1] = 1;
+        voteIDs[2] = 2;
+        vm.prank(staker1);
+        disputeKit.castVote(disputeID, voteIDs, 1, roundID, "XYZ");
+
+        core.passPeriod(disputeID); // Appeal
+
+        vm.warp(block.timestamp + timesPerPeriod[3]);
+        core.passPeriod(disputeID); // Execution
+
+        core.execute(disputeID, roundID, iterations);
+
+        uint256 iterationsCount = iterations < DEFAULT_NB_OF_JURORS * 2 ? iterations : DEFAULT_NB_OF_JURORS * 2;
+
+        KlerosCore.Round memory round = core.getRoundInfo(disputeID, roundID);
+        assertEq(round.repartitions, iterationsCount, "Wrong repartitions");
+    }
+
+    function testFuzz_executeIterations_nbJurors(uint256 iterations, uint256 disputeValue) public {
+        uint256 disputeID = 0;
+        uint256 roundID = 0;
+
+        uint256 arbitrationCost = core.arbitrationCost(arbitratorExtraData);
+        // Cap it to 10 eth, so the number of jurors is not astronomical.
+        vm.assume(disputeValue >= arbitrationCost && disputeValue <= 10 ether);
+        vm.deal(disputer, 10 ether);
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 2000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: disputeValue}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        uint256 nbJurors = disputeValue / feeForJuror;
+
+        core.draw(disputeID, nbJurors);
+
+        KlerosCore.Round memory round = core.getRoundInfo(disputeID, roundID);
+        assertEq(round.totalFeesForJurors, disputeValue, "Wrong totalFeesForJurors");
+        assertEq(round.nbVotes, nbJurors, "Wrong nbVotes");
+
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Vote
+
+        uint256[] memory voteIDs = new uint256[](nbJurors);
+        for (uint256 i = 0; i < voteIDs.length; i++) {
+            voteIDs[i] = i;
+        }
+
+        vm.prank(staker1);
+        disputeKit.castVote(disputeID, voteIDs, 1, 0, "XYZ");
+
+        core.passPeriod(disputeID); // Appeal
+
+        vm.warp(block.timestamp + timesPerPeriod[3]);
+        core.passPeriod(disputeID); // Execution
+
+        core.execute(disputeID, roundID, iterations);
+
+        uint256 iterationsCount = iterations < nbJurors * 2 ? iterations : nbJurors * 2;
+        round = core.getRoundInfo(disputeID, roundID);
+
+        assertEq(round.repartitions, iterationsCount, "Wrong repartitions");
+
+        (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, ) = sortitionModule.getJurorBalance(
+            staker1,
+            GENERAL_COURT
+        );
+
+        uint256 pnkAtStake = (minStake * alpha) / ONE_BASIS_POINT;
+        uint256 unlockedTokens = iterationsCount < nbJurors ? 0 : (iterationsCount - nbJurors) * pnkAtStake;
+        assertEq(totalStaked, 2000, "Wrong amount total staked");
+        assertEq(totalLocked, (pnkAtStake * nbJurors) - unlockedTokens, "Wrong amount locked");
+        assertEq(stakedInCourt, 2000, "Wrong amount staked in court");
+    }
 }
diff --git a/contracts/test/foundry/KlerosCore_Staking.t.sol b/contracts/test/foundry/KlerosCore_Staking.t.sol
index a7cb96bef..b44bbfab2 100644
--- a/contracts/test/foundry/KlerosCore_Staking.t.sol
+++ b/contracts/test/foundry/KlerosCore_Staking.t.sol
@@ -7,6 +7,7 @@ import {SortitionModule} from "../../src/arbitration/SortitionModule.sol";
 import {ISortitionModule} from "../../src/arbitration/interfaces/ISortitionModule.sol";
 import {IKlerosCore, KlerosCoreSnapshotProxy} from "../../src/arbitration/view/KlerosCoreSnapshotProxy.sol";
 import "../../src/libraries/Constants.sol";
+import {console} from "forge-std/console.sol";
 
 /// @title KlerosCore_StakingTest
 /// @dev Tests for KlerosCore staking mechanics and stake management
@@ -370,7 +371,7 @@ contract KlerosCore_StakingTest is KlerosCore_TestBase {
         assertEq(stakedInCourt, 0, "Wrong amount staked in court");
         assertEq(nbCourts, 0, "Wrong number of courts");
 
-        vm.warp(block.timestamp + minStakingTime);
+        vm.warp(block.timestamp + maxDrawingTime);
         sortitionModule.passPhase(); // Staking. Delayed stakes can be executed now
 
         vm.prank(address(core));
@@ -441,4 +442,180 @@ contract KlerosCore_StakingTest is KlerosCore_TestBase {
         snapshotProxy.changeOwner(other);
         assertEq(snapshotProxy.owner(), other, "Wrong owner after change");
     }
+
+    function testFuzz_setStake(uint256 firstStake, uint256 secondStake) public {
+        uint256 stakerSupply = totalSupply / 10;
+
+        vm.prank(owner);
+        pinakion.transfer(staker1, stakerSupply - 1 ether); // 1 eth was transferred in the initial setup so offset that value.
+        vm.assume(firstStake >= minStake && firstStake <= stakerSupply);
+        vm.assume(secondStake >= minStake && secondStake <= stakerSupply);
+
+        vm.prank(staker1);
+        pinakion.approve(address(core), firstStake);
+
+        vm.prank(staker1);
+        vm.expectEmit(true, true, true, true);
+        emit SortitionModule.StakeSet(staker1, GENERAL_COURT, firstStake, firstStake);
+        core.setStake(GENERAL_COURT, firstStake);
+
+        (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts) = sortitionModule
+            .getJurorBalance(staker1, GENERAL_COURT);
+        assertEq(totalStaked, firstStake, "Wrong amount total staked");
+        assertEq(totalLocked, 0, "Wrong amount locked");
+        assertEq(stakedInCourt, firstStake, "Wrong amount staked in court");
+        assertEq(nbCourts, 1, "Wrong number of courts");
+
+        uint96[] memory courts = sortitionModule.getJurorCourtIDs(staker1);
+        assertEq(courts.length, 1, "Wrong courts count");
+        assertEq(courts[0], GENERAL_COURT, "Wrong court id");
+        assertEq(sortitionModule.isJurorStaked(staker1), true, "Juror should be staked");
+
+        assertEq(pinakion.balanceOf(address(core)), firstStake, "Wrong token balance of the core");
+        assertEq(pinakion.balanceOf(staker1), stakerSupply - firstStake, "Wrong token balance of staker1");
+        assertEq(pinakion.allowance(staker1, address(core)), 0, "Allowance should be spent for staker1");
+
+        // Change the stake and see if everything is correct.
+        vm.prank(staker1);
+        pinakion.approve(address(core), secondStake);
+
+        vm.prank(staker1);
+        vm.expectEmit(true, true, true, true);
+        emit SortitionModule.StakeSet(staker1, GENERAL_COURT, secondStake, secondStake);
+        core.setStake(GENERAL_COURT, secondStake);
+
+        (totalStaked, totalLocked, stakedInCourt, nbCourts) = sortitionModule.getJurorBalance(staker1, GENERAL_COURT);
+        assertEq(totalStaked, secondStake, "Wrong amount total staked secondStake");
+        assertEq(totalLocked, 0, "Wrong amount locked secondStake");
+        assertEq(stakedInCourt, secondStake, "Wrong amount staked in court secondStake");
+        assertEq(nbCourts, 1, "Number of courts should not increase secondStake");
+
+        assertEq(pinakion.balanceOf(address(core)), secondStake, "Wrong token balance of the core secondStake");
+        assertEq(pinakion.balanceOf(staker1), stakerSupply - secondStake, "Wrong token balance of staker1 secondStake");
+
+        bool stakeIncrease = secondStake > firstStake;
+        // If stake decrease new allowance won't be spent, if it increases it will only spent (secondStake - firstStake) difference.
+        uint256 newAllowance = stakeIncrease ? firstStake : secondStake;
+        assertEq(pinakion.allowance(staker1, address(core)), newAllowance, "Incorrect allowance secondStake");
+    }
+
+    function testFuzz_setStake_differentCourts(uint256 firstStake, uint256 secondStake) public {
+        uint256 stakerSupply = totalSupply / 10;
+
+        vm.prank(owner);
+        uint256[] memory supportedDK = new uint256[](1);
+        supportedDK[0] = DISPUTE_KIT_CLASSIC;
+        core.createCourt(
+            GENERAL_COURT,
+            hiddenVotes,
+            minStake,
+            alpha,
+            feeForJuror,
+            jurorsForCourtJump,
+            timesPerPeriod, // Times per period
+            sortitionExtraData, // Sortition extra data
+            supportedDK
+        );
+
+        uint96 newCourtID = 2;
+
+        vm.prank(owner);
+        pinakion.transfer(staker1, stakerSupply - 1 ether); // 1 eth was transferred in the initial setup so offset that value.
+        vm.assume(firstStake >= minStake && firstStake <= stakerSupply / 2); // Split the supply into two because courts are different now
+        vm.assume(secondStake >= minStake && secondStake <= stakerSupply / 2);
+
+        vm.prank(staker1);
+        pinakion.approve(address(core), firstStake);
+
+        vm.prank(staker1);
+        vm.expectEmit(true, true, true, true);
+        emit SortitionModule.StakeSet(staker1, GENERAL_COURT, firstStake, firstStake);
+        core.setStake(GENERAL_COURT, firstStake);
+
+        (uint256 totalStaked, uint256 totalLocked, uint256 stakedInCourt, uint256 nbCourts) = sortitionModule
+            .getJurorBalance(staker1, GENERAL_COURT);
+        assertEq(totalStaked, firstStake, "Wrong amount total staked");
+        assertEq(totalLocked, 0, "Wrong amount locked");
+        assertEq(stakedInCourt, firstStake, "Wrong amount staked in court");
+        assertEq(nbCourts, 1, "Wrong number of courts");
+
+        uint96[] memory courts = sortitionModule.getJurorCourtIDs(staker1);
+        assertEq(courts.length, 1, "Wrong courts count");
+        assertEq(courts[0], GENERAL_COURT, "Wrong court id");
+        assertEq(sortitionModule.isJurorStaked(staker1), true, "Juror should be staked");
+
+        assertEq(pinakion.balanceOf(address(core)), firstStake, "Wrong token balance of the core");
+        assertEq(pinakion.balanceOf(staker1), stakerSupply - firstStake, "Wrong token balance of staker1");
+        assertEq(pinakion.allowance(staker1, address(core)), 0, "Allowance should be spent for staker1");
+
+        // Stake the juror in a different court.
+        vm.prank(staker1);
+        pinakion.approve(address(core), secondStake);
+
+        vm.prank(staker1);
+        vm.expectEmit(true, true, true, true);
+        emit SortitionModule.StakeSet(staker1, newCourtID, secondStake, firstStake + secondStake);
+        core.setStake(newCourtID, secondStake);
+
+        (totalStaked, totalLocked, stakedInCourt, nbCourts) = sortitionModule.getJurorBalance(staker1, newCourtID);
+        assertEq(totalStaked, secondStake + firstStake, "Wrong amount total staked secondStake");
+        assertEq(totalLocked, 0, "Wrong amount locked secondStake");
+        assertEq(stakedInCourt, secondStake, "Wrong amount staked in court secondStake");
+        assertEq(nbCourts, 2, "Number of courts should increase");
+
+        assertEq(
+            pinakion.balanceOf(address(core)),
+            secondStake + firstStake,
+            "Wrong token balance of the core secondStake"
+        );
+        assertEq(
+            pinakion.balanceOf(staker1),
+            stakerSupply - secondStake - firstStake,
+            "Wrong token balance of staker1 secondStake"
+        );
+
+        assertEq(pinakion.allowance(staker1, address(core)), 0, "Allowance should be spent for staker1 secondStake");
+    }
+
+    function testFuzz_delayedStakes(uint256 iterations) public {
+        // Test with large numbers but do not trigger possible overflow
+        vm.assume(iterations < 2 ** 128);
+
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+        uint256 disputeID = 0;
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
+
+        // Create delayed stakes
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 1500);
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 2500);
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 3500);
+
+        // Create delayed stake for another staker
+        vm.prank(staker2);
+        core.setStake(GENERAL_COURT, 1000);
+
+        assertEq(sortitionModule.delayedStakeWriteIndex(), 4, "Wrong delayedStakeWriteIndex");
+        assertEq(sortitionModule.delayedStakeReadIndex(), 1, "Wrong delayedStakeReadIndex");
+
+        vm.warp(block.timestamp + maxDrawingTime);
+        sortitionModule.passPhase(); // Staking. Delayed stakes can be executed now
+
+        sortitionModule.executeDelayedStakes(iterations);
+
+        uint256 actualIterations = iterations > 4 ? sortitionModule.delayedStakeWriteIndex() : iterations;
+        uint256 newDelayedStakeReadIndex = 1 + actualIterations;
+
+        assertEq(sortitionModule.delayedStakeWriteIndex(), 4, "Wrong delayedStakeWriteIndex");
+        assertEq(sortitionModule.delayedStakeReadIndex(), newDelayedStakeReadIndex, "Wrong delayedStakeReadIndex");
+    }
 }
diff --git a/contracts/test/foundry/KlerosCore_Voting.t.sol b/contracts/test/foundry/KlerosCore_Voting.t.sol
index 504c9c644..41f8e3973 100644
--- a/contracts/test/foundry/KlerosCore_Voting.t.sol
+++ b/contracts/test/foundry/KlerosCore_Voting.t.sol
@@ -2,7 +2,7 @@
 pragma solidity ^0.8.24;
 
 import {KlerosCore_TestBase} from "./KlerosCore_TestBase.sol";
-import {KlerosCore} from "../../src/arbitration/KlerosCore.sol";
+import {KlerosCore, IArbitratorV2, IArbitrableV2} from "../../src/arbitration/KlerosCore.sol";
 import {DisputeKitClassic, DisputeKitClassicBase} from "../../src/arbitration/dispute-kits/DisputeKitClassic.sol";
 import {IDisputeKit} from "../../src/arbitration/interfaces/IDisputeKit.sol";
 import {UUPSProxy} from "../../src/proxy/UUPSProxy.sol";
@@ -483,4 +483,59 @@ contract KlerosCore_VotingTest is KlerosCore_TestBase {
         assertEq(totalCommited, 0, "totalCommited should be 0");
         assertEq(choiceCount, 3, "choiceCount should be 3");
     }
+
+    function testFuzz_castVote(uint256 numberOfOptions, uint256 choice1, uint256 choice2) public {
+        uint256 disputeID = 0;
+
+        arbitrable.changeNumberOfRulingOptions(numberOfOptions);
+
+        // Have only 2 options for 3 jurors to create a majority
+        vm.assume(choice1 <= numberOfOptions);
+        vm.assume(choice2 <= numberOfOptions);
+
+        vm.prank(staker1);
+        core.setStake(GENERAL_COURT, 2000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        // Split the stakers' votes. The first staker will get VoteID 0 and the second will take the rest.
+        core.draw(disputeID, 1);
+
+        vm.warp(block.timestamp + maxDrawingTime);
+        sortitionModule.passPhase(); // Staking phase to stake the 2nd voter
+        vm.prank(staker2);
+        core.setStake(GENERAL_COURT, 20000);
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        core.draw(disputeID, 2); // Assign leftover votes to staker2
+
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Vote
+
+        uint256[] memory voteIDs = new uint256[](1);
+        voteIDs[0] = 0;
+        vm.prank(staker1);
+        disputeKit.castVote(disputeID, voteIDs, choice1, 0, "XYZ"); // Staker1 only got 1 vote because of low stake
+
+        voteIDs = new uint256[](2);
+        voteIDs[0] = 1;
+        voteIDs[1] = 2;
+        vm.prank(staker2);
+        disputeKit.castVote(disputeID, voteIDs, choice2, 0, "XYZ");
+        core.passPeriod(disputeID); // Appeal
+
+        vm.warp(block.timestamp + timesPerPeriod[3]);
+        core.passPeriod(disputeID); // Execution
+
+        vm.expectEmit(true, true, true, true);
+        emit IArbitrableV2.Ruling(IArbitratorV2(address(core)), disputeID, choice2);
+        core.executeRuling(disputeID);
+    }
 }

From 65f84cfa783fd8891b6a6a60027ce5327cd3377b Mon Sep 17 00:00:00 2001
From: Harman-singh-waraich <Waraichharman68@gmail.com>
Date: Wed, 24 Sep 2025 19:11:38 +0530
Subject: [PATCH 146/175] feat: clear-choice-button

---
 .../components/DisputeFeatures/GroupsUI.tsx   | 33 ++++++++++++++++---
 .../Court/FeatureSelection/index.tsx          | 13 ++++++++
 2 files changed, 41 insertions(+), 5 deletions(-)

diff --git a/web/src/components/DisputeFeatures/GroupsUI.tsx b/web/src/components/DisputeFeatures/GroupsUI.tsx
index ca28c05a4..63b1b2e1b 100644
--- a/web/src/components/DisputeFeatures/GroupsUI.tsx
+++ b/web/src/components/DisputeFeatures/GroupsUI.tsx
@@ -3,6 +3,8 @@ import styled from "styled-components";
 
 import { Group } from "consts/disputeFeature";
 
+import LightButton from "../LightButton";
+
 const Container = styled.div`
   width: 100%;
   display: flex;
@@ -18,9 +20,12 @@ const HeaderContainer = styled.div`
 `;
 
 const Header = styled.h2`
+  display: flex;
   font-size: 16px;
   font-weight: 600;
   margin: 0;
+  align-items: center;
+  gap: 8px;
 `;
 
 const SubTitle = styled.p`
@@ -30,21 +35,39 @@ const SubTitle = styled.p`
   margin: 0;
 `;
 
-export type GroupUI = (props: { children: JSX.Element }) => JSX.Element;
+const StyledLightButton = styled(LightButton)`
+  padding: 0 !important;
+  .button-text {
+    color: ${({ theme }) => theme.primaryBlue};
+    font-size: 14px;
+  }
+  :hover {
+    background-color: transparent !important;
+    .button-text {
+      color: ${({ theme }) => theme.secondaryBlue};
+    }
+  }
+`;
+
+export type GroupUI = (props: { children: JSX.Element; clearAll: () => void }) => JSX.Element;
 export const GroupsUI: Record<Group, GroupUI> = {
-  [Group.Voting]: ({ children }) => (
+  [Group.Voting]: ({ children, clearAll }) => (
     <Container key={Group.Voting}>
       <HeaderContainer>
-        <Header>Shielded Voting</Header>
+        <Header>
+          Shielded Voting <StyledLightButton text="Clear" onClick={clearAll} />
+        </Header>
         <SubTitle>This feature hides the jurors votes until the end of the voting period.</SubTitle>
       </HeaderContainer>
       {children}
     </Container>
   ),
-  [Group.Eligibility]: ({ children }) => (
+  [Group.Eligibility]: ({ children, clearAll }) => (
     <Container key={Group.Eligibility}>
       <HeaderContainer>
-        <Header>Jurors Eligibility</Header>
+        <Header>
+          Jurors Eligibility <StyledLightButton text="Clear" onClick={clearAll} />
+        </Header>
         <SubTitle>This feature determines who can be selected as a juror.</SubTitle>
       </HeaderContainer>
       {children}
diff --git a/web/src/pages/Resolver/Parameters/Court/FeatureSelection/index.tsx b/web/src/pages/Resolver/Parameters/Court/FeatureSelection/index.tsx
index 5444836c3..8c0d342ae 100644
--- a/web/src/pages/Resolver/Parameters/Court/FeatureSelection/index.tsx
+++ b/web/src/pages/Resolver/Parameters/Court/FeatureSelection/index.tsx
@@ -11,6 +11,7 @@ import {
   findMatchingKits,
   getDisabledOptions,
   getVisibleFeaturesForCourt,
+  Group,
   toggleFeature,
 } from "consts/disputeFeature";
 import { IGatedDisputeData, useNewDisputeContext } from "context/NewDisputeContext";
@@ -101,6 +102,17 @@ const FeatureSelection: React.FC = () => {
     });
   };
 
+  const handleGroupDisable = (group: Group) => {
+    const groupFeatures = courtGroups[group];
+    // we have a feature selected from this group
+    for (const feature of groupFeatures) {
+      if (selected.includes(feature)) {
+        // turn off this feature
+        handleToggle(feature);
+      }
+    }
+  };
+
   // if each group only has one feature, select them by default
   // This should not clash with the initial selection logic,
   // as it only runs when there's one disputeKit and featureSet to pick
@@ -140,6 +152,7 @@ const FeatureSelection: React.FC = () => {
         Object.entries(courtGroups).map(([groupName, features], index) => (
           <>
             {GroupsUI[groupName]({
+              clearAll: () => handleGroupDisable(groupName as Group),
               children: (
                 <Fragment key={groupName}>
                   {features.map((feature) =>

From 6b74ebcb87373d00758d00f91a8d3db7cce58958 Mon Sep 17 00:00:00 2001
From: unknownunknown1 <danil@kleros.io>
Date: Thu, 25 Sep 2025 05:24:29 +1000
Subject: [PATCH 147/175] fix(DK): multiple commit fix

---
 .../src/arbitration/dispute-kits/DisputeKitClassicBase.sol    | 2 ++
 contracts/test/foundry/KlerosCore_Voting.t.sol                | 4 ++++
 2 files changed, 6 insertions(+)

diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index 912155986..6168c7b43 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -275,6 +275,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];
         Round storage round = dispute.rounds[dispute.rounds.length - 1];
         for (uint256 i = 0; i < _voteIDs.length; i++) {
+            if (round.votes[_voteIDs[i]].commit != bytes32(0)) revert AlreadyCommittedThisVote();
             if (round.votes[_voteIDs[i]].account != msg.sender) revert JurorHasToOwnTheVote();
             round.votes[_voteIDs[i]].commit = _commit;
         }
@@ -759,4 +760,5 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     error AppealFeeIsAlreadyPaid();
     error DisputeNotResolved();
     error CoreIsPaused();
+    error AlreadyCommittedThisVote();
 }
diff --git a/contracts/test/foundry/KlerosCore_Voting.t.sol b/contracts/test/foundry/KlerosCore_Voting.t.sol
index 504c9c644..50bd00d03 100644
--- a/contracts/test/foundry/KlerosCore_Voting.t.sol
+++ b/contracts/test/foundry/KlerosCore_Voting.t.sol
@@ -97,6 +97,10 @@ contract KlerosCore_VotingTest is KlerosCore_TestBase {
             assertEq(commitStored, keccak256(abi.encodePacked(YES, salt)), "Incorrect commit");
         }
 
+        vm.prank(staker1);
+        vm.expectRevert(DisputeKitClassicBase.AlreadyCommittedThisVote.selector);
+        disputeKit.castCommit(disputeID, voteIDs, commit);
+
         // Check reveal in the next period
         vm.warp(block.timestamp + timesPerPeriod[1]);
         core.passPeriod(disputeID);

From df07fbb11099bf823c97c866bc359cc678d2eb6d Mon Sep 17 00:00:00 2001
From: unknownunknown1 <danil@kleros.io>
Date: Wed, 1 Oct 2025 03:09:20 +1000
Subject: [PATCH 148/175] fix(DK): allow recommits without changing counter

---
 .../dispute-kits/DisputeKitClassicBase.sol        |  9 ++++++---
 contracts/test/foundry/KlerosCore_Voting.t.sol    | 15 +++++++++++----
 2 files changed, 17 insertions(+), 7 deletions(-)

diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index 6168c7b43..464e848d6 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -274,12 +274,16 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
 
         Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];
         Round storage round = dispute.rounds[dispute.rounds.length - 1];
+        // Introduce a counter so we don't count a re-commited votes.
+        uint256 commitCount;
         for (uint256 i = 0; i < _voteIDs.length; i++) {
-            if (round.votes[_voteIDs[i]].commit != bytes32(0)) revert AlreadyCommittedThisVote();
             if (round.votes[_voteIDs[i]].account != msg.sender) revert JurorHasToOwnTheVote();
+            if (round.votes[_voteIDs[i]].commit == bytes32(0)) {
+                commitCount++;
+            }
             round.votes[_voteIDs[i]].commit = _commit;
         }
-        round.totalCommitted += _voteIDs.length;
+        round.totalCommitted += commitCount;
         emit CommitCast(_coreDisputeID, msg.sender, _voteIDs, _commit);
     }
 
@@ -760,5 +764,4 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     error AppealFeeIsAlreadyPaid();
     error DisputeNotResolved();
     error CoreIsPaused();
-    error AlreadyCommittedThisVote();
 }
diff --git a/contracts/test/foundry/KlerosCore_Voting.t.sol b/contracts/test/foundry/KlerosCore_Voting.t.sol
index 50bd00d03..f09ee903f 100644
--- a/contracts/test/foundry/KlerosCore_Voting.t.sol
+++ b/contracts/test/foundry/KlerosCore_Voting.t.sol
@@ -35,6 +35,7 @@ contract KlerosCore_VotingTest is KlerosCore_TestBase {
         sortitionModule.passPhase(); // Drawing phase
         core.draw(disputeID, DEFAULT_NB_OF_JURORS);
 
+        uint256 NO = 0;
         uint256 YES = 1;
         uint256 salt = 123455678;
         uint256[] memory voteIDs = new uint256[](1);
@@ -79,6 +80,16 @@ contract KlerosCore_VotingTest is KlerosCore_TestBase {
         (, bytes32 commitStored, , ) = disputeKit.getVoteInfo(0, 0, 0);
         assertEq(commitStored, keccak256(abi.encodePacked(YES, salt)), "Incorrect commit");
 
+        // Cast again with the same voteID to check that the count doesn't increase.
+        bytes32 newCommit = keccak256(abi.encodePacked(NO, salt));
+        vm.prank(staker1);
+        disputeKit.castCommit(disputeID, voteIDs, newCommit);
+
+        (, , , totalCommited, , ) = disputeKit.getRoundInfo(disputeID, 0, 0);
+        assertEq(totalCommited, 1, "totalCommited should still be 1");
+        (, commitStored, , ) = disputeKit.getVoteInfo(0, 0, 0);
+        assertEq(commitStored, keccak256(abi.encodePacked(NO, salt)), "Incorrect commit after recommitting");
+
         voteIDs = new uint256[](2); // Create the leftover votes subset
         voteIDs[0] = 1;
         voteIDs[1] = 2;
@@ -97,10 +108,6 @@ contract KlerosCore_VotingTest is KlerosCore_TestBase {
             assertEq(commitStored, keccak256(abi.encodePacked(YES, salt)), "Incorrect commit");
         }
 
-        vm.prank(staker1);
-        vm.expectRevert(DisputeKitClassicBase.AlreadyCommittedThisVote.selector);
-        disputeKit.castCommit(disputeID, voteIDs, commit);
-
         // Check reveal in the next period
         vm.warp(block.timestamp + timesPerPeriod[1]);
         core.passPeriod(disputeID);

From 615effc4df991a48ab98f583005a3716cc8bc7b3 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 2 Oct 2025 16:23:45 +0100
Subject: [PATCH 149/175] refactor: renamed error AppealPeriodIsOver into
 NotAppealPeriod

---
 .../arbitration/dispute-kits/DisputeKitClassicBase.sol    | 8 ++++----
 contracts/test/foundry/KlerosCore_Appeals.t.sol           | 6 +++---
 2 files changed, 7 insertions(+), 7 deletions(-)

diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index 464e848d6..698a9a547 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -370,7 +370,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         if (!coreDisputeIDToActive[_coreDisputeID]) revert NotActiveForCoreDisputeID();
 
         (uint256 appealPeriodStart, uint256 appealPeriodEnd) = core.appealPeriod(_coreDisputeID);
-        if (block.timestamp < appealPeriodStart || block.timestamp >= appealPeriodEnd) revert AppealPeriodIsOver();
+        if (block.timestamp < appealPeriodStart || block.timestamp >= appealPeriodEnd) revert NotAppealPeriod();
 
         uint256 multiplier;
         (uint256 ruling, , ) = this.currentRuling(_coreDisputeID);
@@ -381,7 +381,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
                 block.timestamp - appealPeriodStart >=
                 ((appealPeriodEnd - appealPeriodStart) * LOSER_APPEAL_PERIOD_MULTIPLIER) / ONE_BASIS_POINT
             ) {
-                revert AppealPeriodIsOverForLoser();
+                revert NotAppealPeriodForLoser();
             }
             multiplier = LOSER_STAKE_MULTIPLIER;
         }
@@ -759,8 +759,8 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     error ChoiceOutOfBounds();
     error HashDoesNotMatchHiddenVoteCommitment();
     error VoteAlreadyCast();
-    error AppealPeriodIsOver();
-    error AppealPeriodIsOverForLoser();
+    error NotAppealPeriod();
+    error NotAppealPeriodForLoser();
     error AppealFeeIsAlreadyPaid();
     error DisputeNotResolved();
     error CoreIsPaused();
diff --git a/contracts/test/foundry/KlerosCore_Appeals.t.sol b/contracts/test/foundry/KlerosCore_Appeals.t.sol
index 79e575e81..9a88bb1b2 100644
--- a/contracts/test/foundry/KlerosCore_Appeals.t.sol
+++ b/contracts/test/foundry/KlerosCore_Appeals.t.sol
@@ -127,7 +127,7 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
         disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
 
         vm.prank(crowdfunder1);
-        vm.expectRevert(DisputeKitClassicBase.AppealPeriodIsOver.selector);
+        vm.expectRevert(DisputeKitClassicBase.NotAppealPeriod.selector);
         disputeKit.fundAppeal{value: 0.1 ether}(disputeID, 1);
         core.passPeriod(disputeID);
 
@@ -135,14 +135,14 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
 
         vm.prank(crowdfunder1);
         vm.warp(block.timestamp + ((end - start) / 2 + 1));
-        vm.expectRevert(DisputeKitClassicBase.AppealPeriodIsOverForLoser.selector);
+        vm.expectRevert(DisputeKitClassicBase.NotAppealPeriodForLoser.selector);
         disputeKit.fundAppeal{value: 0.1 ether}(disputeID, 1); // Losing choice
 
         disputeKit.fundAppeal(disputeID, 2); // Winning choice funding should not revert yet
 
         vm.prank(crowdfunder1);
         vm.warp(block.timestamp + (end - start) / 2); // Warp one more to cover the whole period
-        vm.expectRevert(DisputeKitClassicBase.AppealPeriodIsOver.selector);
+        vm.expectRevert(DisputeKitClassicBase.NotAppealPeriod.selector);
         disputeKit.fundAppeal{value: 0.1 ether}(disputeID, 2);
     }
 

From 11f84f7fbdd0fac2e9a4e57ba41c77030525cd2a Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 2 Oct 2025 16:46:56 +0100
Subject: [PATCH 150/175] fix: typos, natspec, small gas optimisation

---
 contracts/src/arbitration/KlerosCore.sol                      | 2 +-
 contracts/src/arbitration/SortitionModule.sol                 | 4 ++--
 contracts/src/arbitration/interfaces/IArbitratorV2.sol        | 2 +-
 contracts/src/arbitration/interfaces/ISortitionModule.sol     | 2 +-
 contracts/src/arbitration/university/KlerosCoreUniversity.sol | 2 +-
 5 files changed, 6 insertions(+), 6 deletions(-)

diff --git a/contracts/src/arbitration/KlerosCore.sol b/contracts/src/arbitration/KlerosCore.sol
index 08653e057..46067854c 100644
--- a/contracts/src/arbitration/KlerosCore.sol
+++ b/contracts/src/arbitration/KlerosCore.sol
@@ -1398,7 +1398,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
     error DisputeKitOnly();
     error SortitionModuleOnly();
     error UnsuccessfulCall();
-    error InvalidDisputKitParent();
+    error InvalidDisputeKitParent();
     error MinStakeLowerThanParentCourt();
     error UnsupportedDisputeKit();
     error InvalidForkingCourtAsParent();
diff --git a/contracts/src/arbitration/SortitionModule.sol b/contracts/src/arbitration/SortitionModule.sol
index e46753f0a..ddba2501a 100644
--- a/contracts/src/arbitration/SortitionModule.sol
+++ b/contracts/src/arbitration/SortitionModule.sol
@@ -343,14 +343,14 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
 
         if (availablePenalty == 0) return (juror.stakedPnk, newCourtStake, 0); // No penalty to apply.
 
-        uint256 currentStake = _stakeOf(_account, _courtID);
+        uint256 currentStake = newCourtStake;
         uint256 newStake = 0;
         if (currentStake >= availablePenalty) {
             newStake = currentStake - availablePenalty;
         }
         _setStake(_account, _courtID, 0, availablePenalty, newStake);
         pnkBalance = juror.stakedPnk; // updated by _setStake()
-        newCourtStake = _stakeOf(_account, _courtID); // updated by _setStake()
+        newCourtStake = newStake;
     }
 
     /// @inheritdoc ISortitionModule
diff --git a/contracts/src/arbitration/interfaces/IArbitratorV2.sol b/contracts/src/arbitration/interfaces/IArbitratorV2.sol
index 125baab92..41c7e48c5 100644
--- a/contracts/src/arbitration/interfaces/IArbitratorV2.sol
+++ b/contracts/src/arbitration/interfaces/IArbitratorV2.sol
@@ -50,7 +50,7 @@ interface IArbitratorV2 {
     ) external payable returns (uint256 disputeID);
 
     /// @notice Create a dispute and pay for the fees in a supported ERC20 token.
-    /// @dev Must be called by the arbitrable contract and pay at least `arbitrationCost(_extraData)` in the supported ERC20 token.
+    /// @dev Must be called by the arbitrable contract and pay at least `arbitrationCost(_extraData, _feeToken)` in the supported ERC20 token.
     /// @param _numberOfChoices The number of choices the arbitrator can choose from in this dispute.
     /// @param _extraData Additional info about the dispute. We use it to pass the ID of the dispute's court (first 32 bytes), the minimum number of jurors required (next 32 bytes) and the ID of the specific dispute kit (last 32 bytes).
     /// @param _feeToken The ERC20 token used to pay fees.
diff --git a/contracts/src/arbitration/interfaces/ISortitionModule.sol b/contracts/src/arbitration/interfaces/ISortitionModule.sol
index 0803666ff..ccc66a2f5 100644
--- a/contracts/src/arbitration/interfaces/ISortitionModule.sol
+++ b/contracts/src/arbitration/interfaces/ISortitionModule.sol
@@ -78,7 +78,7 @@ interface ISortitionModule {
         uint256 _newStake
     ) external;
 
-    /// @notice Update the state of the stakes with a PNK reward deposit, called by KC during rewards execution.
+    /// @notice Update the state of the stakes with a PNK penalty, called by KC during rewards execution.
     ///
     /// @dev `O(n + p * log_k(j))` where
     /// `n` is the number of courts the juror has staked in,
diff --git a/contracts/src/arbitration/university/KlerosCoreUniversity.sol b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
index bf27dfbb2..37098d7e1 100644
--- a/contracts/src/arbitration/university/KlerosCoreUniversity.sol
+++ b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
@@ -1173,7 +1173,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
     error DisputeKitOnly();
     error SortitionModuleOnly();
     error UnsuccessfulCall();
-    error InvalidDisputKitParent();
+    error InvalidDisputeKitParent();
     error MinStakeLowerThanParentCourt();
     error UnsupportedDisputeKit();
     error InvalidForkingCourtAsParent();

From ec9e89cdb04f472e81c86f8c1e12b09a29efa536 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Mon, 6 Oct 2025 11:39:26 +0100
Subject: [PATCH 151/175] fix: minor KlerosCore improvements from reviews

---
 contracts/src/arbitration/KlerosCore.sol       | 18 ++++++++++--------
 .../test/foundry/KlerosCore_Governance.t.sol   |  2 +-
 2 files changed, 11 insertions(+), 9 deletions(-)

diff --git a/contracts/src/arbitration/KlerosCore.sol b/contracts/src/arbitration/KlerosCore.sol
index 46067854c..8292a9f6e 100644
--- a/contracts/src/arbitration/KlerosCore.sol
+++ b/contracts/src/arbitration/KlerosCore.sol
@@ -424,7 +424,8 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         sortitionModule = _sortitionModule;
     }
 
-    /// @notice Add a new supported dispute kit module to the court.
+    /// @notice Add a new supported dispute kit, without enabling it.
+    /// Use `enableDisputeKits()` to enable the dispute kit for a specific court.
     /// @param _disputeKitAddress The address of the dispute kit contract.
     function addNewDisputeKit(IDisputeKit _disputeKitAddress) external onlyByOwner {
         uint256 disputeKitID = disputeKits.length;
@@ -461,7 +462,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         Court storage court = courts.push();
 
         for (uint256 i = 0; i < _supportedDisputeKits.length; i++) {
-            if (_supportedDisputeKits[i] == 0 || _supportedDisputeKits[i] >= disputeKits.length) {
+            if (_supportedDisputeKits[i] == NULL_DISPUTE_KIT || _supportedDisputeKits[i] >= disputeKits.length) {
                 revert WrongDisputeKitIndex();
             }
             _enableDisputeKit(uint96(courtID), _supportedDisputeKits[i], true);
@@ -483,7 +484,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         // Update the parent.
         courts[_parent].children.push(courtID);
         emit CourtCreated(
-            uint96(courtID),
+            courtID,
             _parent,
             _hiddenVotes,
             _minStake,
@@ -518,7 +519,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         }
         for (uint256 i = 0; i < court.children.length; i++) {
             if (courts[court.children[i]].minStake < _minStake) {
-                revert MinStakeLowerThanParentCourt();
+                revert MinStakeHigherThanChildCourt(court.children[i]);
             }
         }
         court.minStake = _minStake;
@@ -544,10 +545,10 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
     /// @param _enable Whether add or remove the dispute kits from the court.
     function enableDisputeKits(uint96 _courtID, uint256[] memory _disputeKitIDs, bool _enable) external onlyByOwner {
         for (uint256 i = 0; i < _disputeKitIDs.length; i++) {
+            if (_disputeKitIDs[i] == NULL_DISPUTE_KIT || _disputeKitIDs[i] >= disputeKits.length) {
+                revert WrongDisputeKitIndex();
+            }
             if (_enable) {
-                if (_disputeKitIDs[i] == 0 || _disputeKitIDs[i] >= disputeKits.length) {
-                    revert WrongDisputeKitIndex();
-                }
                 _enableDisputeKit(_courtID, _disputeKitIDs[i], true);
             } else {
                 // Classic dispute kit must be supported by all courts.
@@ -940,7 +941,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         }
 
         if (pnkBalance == 0 || !disputeKit.isVoteActive(_params.disputeID, _params.round, _params.repartition)) {
-            // The juror is inactive or their balance is can't cover penalties anymore, unstake them from all courts.
+            // The juror is inactive or their balance can't cover penalties anymore, unstake them from all courts.
             sortitionModule.forcedUnstakeAllCourts(account);
         } else if (newCourtStake < courts[penalizedInCourtID].minStake) {
             // The juror's balance fell below the court minStake, unstake them from the court.
@@ -1400,6 +1401,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
     error UnsuccessfulCall();
     error InvalidDisputeKitParent();
     error MinStakeLowerThanParentCourt();
+    error MinStakeHigherThanChildCourt(uint256 _childCourtID);
     error UnsupportedDisputeKit();
     error InvalidForkingCourtAsParent();
     error WrongDisputeKitIndex();
diff --git a/contracts/test/foundry/KlerosCore_Governance.t.sol b/contracts/test/foundry/KlerosCore_Governance.t.sol
index c95ba123f..7c803c058 100644
--- a/contracts/test/foundry/KlerosCore_Governance.t.sol
+++ b/contracts/test/foundry/KlerosCore_Governance.t.sol
@@ -310,7 +310,7 @@ contract KlerosCore_GovernanceTest is KlerosCore_TestBase {
             50, // jurors for jump
             [uint256(10), uint256(20), uint256(30), uint256(40)] // Times per period
         );
-        vm.expectRevert(KlerosCore.MinStakeLowerThanParentCourt.selector);
+        vm.expectRevert(abi.encodeWithSelector(KlerosCore.MinStakeHigherThanChildCourt.selector, newCourtID));
         vm.prank(owner);
         // Min stake of a parent became higher than of a child
         core.changeCourtParameters(

From 40d2240a8de93adb951f3b7b4e6c121d7ec9c09d Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Mon, 6 Oct 2025 12:00:01 +0100
Subject: [PATCH 152/175] docs: natspec fixes

---
 contracts/src/arbitration/KlerosCore.sol      |  4 ++--
 contracts/src/arbitration/SortitionModule.sol | 10 +++++-----
 2 files changed, 7 insertions(+), 7 deletions(-)

diff --git a/contracts/src/arbitration/KlerosCore.sol b/contracts/src/arbitration/KlerosCore.sol
index 8292a9f6e..7b1013a64 100644
--- a/contracts/src/arbitration/KlerosCore.sol
+++ b/contracts/src/arbitration/KlerosCore.sol
@@ -1366,7 +1366,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
     function _extraDataToCourtIDMinJurorsDisputeKit(
         bytes memory _extraData
     ) internal view returns (uint96 courtID, uint256 minJurors, uint256 disputeKitID) {
-        // Note that if the extradata doesn't contain 32 bytes for the dispute kit ID it'll return the default 0 index.
+        // Note that if the _extraData doesn't contain 32 bytes, default values are used.
         if (_extraData.length >= 64) {
             assembly {
                 // solium-disable-line security/no-inline-assembly
@@ -1381,7 +1381,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
                 minJurors = DEFAULT_NB_OF_JURORS;
             }
             if (disputeKitID == NULL_DISPUTE_KIT || disputeKitID >= disputeKits.length) {
-                disputeKitID = DISPUTE_KIT_CLASSIC; // 0 index is not used.
+                disputeKitID = DISPUTE_KIT_CLASSIC;
             }
         } else {
             courtID = GENERAL_COURT;
diff --git a/contracts/src/arbitration/SortitionModule.sol b/contracts/src/arbitration/SortitionModule.sol
index ddba2501a..125c44c3a 100644
--- a/contracts/src/arbitration/SortitionModule.sol
+++ b/contracts/src/arbitration/SortitionModule.sol
@@ -53,9 +53,9 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
     mapping(TreeKey key => SortitionTrees.Tree) sortitionSumTrees; // The mapping of sortition trees by keys.
     mapping(address account => Juror) public jurors; // The jurors.
     mapping(uint256 => DelayedStake) public delayedStakes; // Stores the stakes that were changed during Drawing phase, to update them when the phase is switched to Staking.
-    uint256 public maxStakePerJuror; // The maximum amount of PNK a juror can stake in a court.
-    uint256 public maxTotalStaked; // The maximum amount of PNK that can be staked in all courts.
-    uint256 public totalStaked; // The amount that is currently staked in all courts.
+    uint256 public maxStakePerJuror; // The maximum amount of PNK that a juror can stake across the courts.
+    uint256 public maxTotalStaked; // The maximum amount of PNK that all the jurors can stake across the courts.
+    uint256 public totalStaked; // The amount of PNK that is currently staked across the courts.
 
     // ************************************* //
     // *              Events               * //
@@ -105,8 +105,8 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
     /// @param _minStakingTime Minimal time to stake
     /// @param _maxDrawingTime Time after which the drawing phase can be switched
     /// @param _rng The random number generator.
-    /// @param _maxStakePerJuror The maximum amount of PNK a juror can stake in a court.
-    /// @param _maxTotalStaked The maximum amount of PNK that can be staked in all courts.
+    /// @param _maxStakePerJuror The maximum amount of PNK a juror can stake across the courts.
+    /// @param _maxTotalStaked The maximum amount of PNK that all the jurors can stake across the courts.
     function initialize(
         address _owner,
         KlerosCore _core,

From 45bcd0f89964ae2896c30b5f3796b9155b81ca67 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Mon, 6 Oct 2025 12:43:58 +0100
Subject: [PATCH 153/175] docs: natspec fixes

---
 contracts/src/arbitration/interfaces/IEvidence.sol | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/contracts/src/arbitration/interfaces/IEvidence.sol b/contracts/src/arbitration/interfaces/IEvidence.sol
index 4b6477ff2..f27ce8447 100644
--- a/contracts/src/arbitration/interfaces/IEvidence.sol
+++ b/contracts/src/arbitration/interfaces/IEvidence.sol
@@ -6,7 +6,7 @@ pragma solidity >=0.8.0 <0.9.0;
 interface IEvidence {
     /// @notice To be raised when evidence is submitted. Should point to the resource (evidences are not to be stored on chain due to gas considerations).
     /// @param _externalDisputeID Unique identifier for this dispute outside Kleros. It's the submitter responsibility to submit the right external dispute ID.
-    /// @param _party The address of the party submiting the evidence. Note that 0x0 refers to evidence not submitted by any party.
+    /// @param _party The address of the party submitting the evidence.
     /// @param _evidence Stringified evidence object, example: '{"name" : "Justification", "description" : "Description", "fileURI" : "/ipfs/QmWQV5ZFFhEJiW8Lm7ay2zLxC2XS4wx1b2W7FfdrLMyQQc"}'.
     event Evidence(uint256 indexed _externalDisputeID, address indexed _party, string _evidence);
 }

From 06cccaa17e10f9064cb325a97d33c41e1edbd415 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Mon, 6 Oct 2025 12:53:27 +0100
Subject: [PATCH 154/175] refactor: minor improvement to the DisputeResolver

---
 .../arbitrables/DisputeResolver.sol           | 19 +++++++++++++------
 1 file changed, 13 insertions(+), 6 deletions(-)

diff --git a/contracts/src/arbitration/arbitrables/DisputeResolver.sol b/contracts/src/arbitration/arbitrables/DisputeResolver.sol
index 64fef2ee6..691178cd7 100644
--- a/contracts/src/arbitration/arbitrables/DisputeResolver.sol
+++ b/contracts/src/arbitration/arbitrables/DisputeResolver.sol
@@ -30,12 +30,22 @@ contract DisputeResolver is IArbitrableV2 {
     DisputeStruct[] public disputes; // Local disputes.
     mapping(uint256 => uint256) public arbitratorDisputeIDToLocalID; // Maps arbitrator-side dispute IDs to local dispute IDs.
 
+    // ************************************* //
+    // *        Function Modifiers         * //
+    // ************************************* //
+
+    modifier onlyByOwner() {
+        if (owner != msg.sender) revert OwnerOnly();
+        _;
+    }
+
     // ************************************* //
     // *            Constructor            * //
     // ************************************* //
 
     /// @notice Constructor
     /// @param _arbitrator Target global arbitrator for any disputes.
+    /// @param _templateRegistry The dispute template registry.
     constructor(IArbitratorV2 _arbitrator, IDisputeTemplateRegistry _templateRegistry) {
         owner = msg.sender;
         arbitrator = _arbitrator;
@@ -48,18 +58,15 @@ contract DisputeResolver is IArbitrableV2 {
 
     /// @notice Changes the owner.
     /// @param _owner The address of the new owner.
-    function changeOwner(address _owner) external {
-        if (owner != msg.sender) revert OwnerOnly();
+    function changeOwner(address _owner) external onlyByOwner {
         owner = _owner;
     }
 
-    function changeArbitrator(IArbitratorV2 _arbitrator) external {
-        if (owner != msg.sender) revert OwnerOnly();
+    function changeArbitrator(IArbitratorV2 _arbitrator) external onlyByOwner {
         arbitrator = _arbitrator;
     }
 
-    function changeTemplateRegistry(IDisputeTemplateRegistry _templateRegistry) external {
-        if (owner != msg.sender) revert OwnerOnly();
+    function changeTemplateRegistry(IDisputeTemplateRegistry _templateRegistry) external onlyByOwner {
         templateRegistry = _templateRegistry;
     }
 

From bc906e529812623187570f21646eaedd5a7d855c Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Tue, 7 Oct 2025 17:50:04 +0100
Subject: [PATCH 155/175] fix: autostake the token rewards in the court where
 the stake originates from

---
 contracts/src/arbitration/KlerosCore.sol | 9 ++++++---
 1 file changed, 6 insertions(+), 3 deletions(-)

diff --git a/contracts/src/arbitration/KlerosCore.sol b/contracts/src/arbitration/KlerosCore.sol
index 7b1013a64..8030db65b 100644
--- a/contracts/src/arbitration/KlerosCore.sol
+++ b/contracts/src/arbitration/KlerosCore.sol
@@ -969,12 +969,13 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         Dispute storage dispute = disputes[_params.disputeID];
         Round storage round = dispute.rounds[_params.round];
         IDisputeKit disputeKit = disputeKits[round.disputeKitID];
+        uint256 repartition = _params.repartition % _params.numberOfVotesInRound;
 
         // [0, 1] value that determines how coherent the juror was in this round, in basis points.
         (uint256 pnkCoherence, uint256 feeCoherence) = disputeKit.getDegreeOfCoherenceReward(
             _params.disputeID,
             _params.round,
-            _params.repartition % _params.numberOfVotesInRound,
+            repartition,
             _params.feePerJurorInRound,
             _params.pnkAtStakePerJurorInRound
         );
@@ -987,7 +988,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
             feeCoherence = ONE_BASIS_POINT;
         }
 
-        address account = round.drawnJurors[_params.repartition % _params.numberOfVotesInRound];
+        address account = round.drawnJurors[repartition];
         uint256 pnkLocked = _applyCoherence(round.pnkAtStakePerJuror, pnkCoherence);
 
         // Release the rest of the PNKs of the juror for this round.
@@ -1004,8 +1005,10 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
             _transferFeeToken(round.feeToken, payable(account), feeReward);
         }
         if (pnkReward != 0) {
+            uint96 rewardedInCourtID = round.drawnJurorFromCourtIDs[repartition];
+
             // Stake the PNK reward if possible, bypasses delayed stakes and other checks done by validateStake()
-            if (!sortitionModule.setStakeReward(account, dispute.courtID, pnkReward)) {
+            if (!sortitionModule.setStakeReward(account, rewardedInCourtID, pnkReward)) {
                 pinakion.safeTransfer(account, pnkReward);
             }
         }

From e21d26112a31f03305bf9849ae26fedd3fab93c7 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 8 Oct 2025 18:23:29 +0100
Subject: [PATCH 156/175] docs: natspec

---
 contracts/src/rng/ChainlinkRNG.sol | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/contracts/src/rng/ChainlinkRNG.sol b/contracts/src/rng/ChainlinkRNG.sol
index b493bfc0d..09e7e4855 100644
--- a/contracts/src/rng/ChainlinkRNG.sol
+++ b/contracts/src/rng/ChainlinkRNG.sol
@@ -131,9 +131,9 @@ contract ChainlinkRNG is IRNG, VRFConsumerBaseV2Plus {
     // ************************************* //
 
     /// @notice Request a random number.
+    /// @dev Ensure that the subscription is set and funded.
     /// @dev Consumer only.
     function requestRandomness() external override onlyByConsumer {
-        // Will revert if subscription is not set and funded.
         uint256 requestId = s_vrfCoordinator.requestRandomWords(
             VRFV2PlusClient.RandomWordsRequest({
                 keyHash: keyHash,

From cf59b868d5edb4105913e94d1b68b148bf8ddb20 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 8 Oct 2025 19:39:36 +0100
Subject: [PATCH 157/175] feat: removal of externalDisputeID, pre-dispute
 evidence submission is not needed

---
 contracts/src/arbitration/KlerosGovernor.sol  |  2 +-
 .../arbitrables/ArbitrableExample.sol         |  6 ++--
 .../arbitrables/DisputeResolver.sol           |  2 +-
 .../devtools/DisputeResolverRuler.sol         |  2 +-
 .../arbitration/evidence/EvidenceModule.sol   |  6 ++--
 .../evidence/ModeratedEvidenceModule.sol      | 13 +++----
 .../arbitration/interfaces/IArbitrableV2.sol  |  8 +----
 .../src/arbitration/interfaces/IEvidence.sol  |  4 +--
 contracts/src/gateway/HomeGateway.sol         |  6 ++--
 .../src/gateway/interfaces/IHomeGateway.sol   |  3 --
 contracts/test/arbitration/draw.ts            |  3 +-
 contracts/test/arbitration/ruler.ts           |  6 ++--
 contracts/test/evidence/index.ts              | 12 +++----
 contracts/test/integration/index.ts           | 36 +++++++------------
 14 files changed, 38 insertions(+), 71 deletions(-)

diff --git a/contracts/src/arbitration/KlerosGovernor.sol b/contracts/src/arbitration/KlerosGovernor.sol
index 37f857c80..783a65164 100644
--- a/contracts/src/arbitration/KlerosGovernor.sol
+++ b/contracts/src/arbitration/KlerosGovernor.sol
@@ -303,7 +303,7 @@ contract KlerosGovernor is IArbitrableV2 {
             // Check in case arbitration cost increased after the submission. It's unlikely that its increase won't be covered by the base deposit, but technically possible.
             session.sumDeposit = session.sumDeposit > arbitrationCost ? session.sumDeposit - arbitrationCost : 0;
             reservedETH = reservedETH > arbitrationCost ? reservedETH - arbitrationCost : 0;
-            emit DisputeRequest(arbitrator, session.disputeID, sessions.length - 1, templateId);
+            emit DisputeRequest(arbitrator, session.disputeID, templateId);
         }
     }
 
diff --git a/contracts/src/arbitration/arbitrables/ArbitrableExample.sol b/contracts/src/arbitration/arbitrables/ArbitrableExample.sol
index 1282876e5..ff4b49932 100644
--- a/contracts/src/arbitration/arbitrables/ArbitrableExample.sol
+++ b/contracts/src/arbitration/arbitrables/ArbitrableExample.sol
@@ -123,8 +123,7 @@ contract ArbitrableExample is IArbitrableV2 {
         disputeID = arbitrator.createDispute{value: msg.value}(numberOfRulingOptions, arbitratorExtraData);
         externalIDtoLocalID[disputeID] = localDisputeID;
 
-        uint256 externalDisputeID = uint256(keccak256(abi.encodePacked(_action)));
-        emit DisputeRequest(arbitrator, disputeID, externalDisputeID, templateId);
+        emit DisputeRequest(arbitrator, disputeID, templateId);
     }
 
     /// @notice Calls createDispute function of the specified arbitrator to create a dispute.
@@ -144,8 +143,7 @@ contract ArbitrableExample is IArbitrableV2 {
         disputeID = arbitrator.createDispute(numberOfRulingOptions, arbitratorExtraData, weth, _feeInWeth);
         externalIDtoLocalID[disputeID] = localDisputeID;
 
-        uint256 externalDisputeID = uint256(keccak256(abi.encodePacked(_action)));
-        emit DisputeRequest(arbitrator, disputeID, externalDisputeID, templateId);
+        emit DisputeRequest(arbitrator, disputeID, templateId);
     }
 
     /// @inheritdoc IArbitrableV2
diff --git a/contracts/src/arbitration/arbitrables/DisputeResolver.sol b/contracts/src/arbitration/arbitrables/DisputeResolver.sol
index 691178cd7..282914883 100644
--- a/contracts/src/arbitration/arbitrables/DisputeResolver.sol
+++ b/contracts/src/arbitration/arbitrables/DisputeResolver.sol
@@ -134,7 +134,7 @@ contract DisputeResolver is IArbitrableV2 {
         );
         arbitratorDisputeIDToLocalID[arbitratorDisputeID] = localDisputeID;
         uint256 templateId = templateRegistry.setDisputeTemplate("", _disputeTemplate, _disputeTemplateDataMappings);
-        emit DisputeRequest(arbitrator, arbitratorDisputeID, localDisputeID, templateId);
+        emit DisputeRequest(arbitrator, arbitratorDisputeID, templateId);
     }
 
     // ************************************* //
diff --git a/contracts/src/arbitration/devtools/DisputeResolverRuler.sol b/contracts/src/arbitration/devtools/DisputeResolverRuler.sol
index 3ca5607ea..d3870dc71 100644
--- a/contracts/src/arbitration/devtools/DisputeResolverRuler.sol
+++ b/contracts/src/arbitration/devtools/DisputeResolverRuler.sol
@@ -46,7 +46,7 @@ contract DisputeResolverRuler is DisputeResolver {
         arbitratorDisputeID = IKlerosCoreRulerFragment(address(arbitrator)).getNextDisputeID();
         arbitratorDisputeIDToLocalID[arbitratorDisputeID] = localDisputeID;
         uint256 templateId = templateRegistry.setDisputeTemplate("", _disputeTemplate, _disputeTemplateDataMappings);
-        emit DisputeRequest(arbitrator, arbitratorDisputeID, localDisputeID, templateId);
+        emit DisputeRequest(arbitrator, arbitratorDisputeID, templateId);
 
         arbitrator.createDispute{value: msg.value}(_numberOfRulingOptions, _arbitratorExtraData);
     }
diff --git a/contracts/src/arbitration/evidence/EvidenceModule.sol b/contracts/src/arbitration/evidence/EvidenceModule.sol
index e29e3a6ac..489b6c704 100644
--- a/contracts/src/arbitration/evidence/EvidenceModule.sol
+++ b/contracts/src/arbitration/evidence/EvidenceModule.sol
@@ -58,10 +58,10 @@ contract EvidenceModule is IEvidence, Initializable, UUPSProxiable {
     // ************************************* //
 
     /// @notice Submits evidence for a dispute.
-    /// @param _externalDisputeID Unique identifier for this dispute outside Kleros. It's the submitter responsibility to submit the right evidence group ID.
+    /// @param _arbitratorDisputeID The identifier of the dispute in the Arbitrator contract.
     /// @param _evidence Stringified evidence object, example: `{"name" : "Justification", "description" : "Description", "fileURI" : "/ipfs/QmWQV5ZFFhEJiW8Lm7ay2zLxC2XS4wx1b2W7FfdrLMyQQc"}`.
-    function submitEvidence(uint256 _externalDisputeID, string calldata _evidence) external {
-        emit Evidence(_externalDisputeID, msg.sender, _evidence);
+    function submitEvidence(uint256 _arbitratorDisputeID, string calldata _evidence) external {
+        emit Evidence(_arbitratorDisputeID, msg.sender, _evidence);
     }
 
     // ************************************* //
diff --git a/contracts/src/arbitration/evidence/ModeratedEvidenceModule.sol b/contracts/src/arbitration/evidence/ModeratedEvidenceModule.sol
index 2ffd0b30b..524f2ec3e 100644
--- a/contracts/src/arbitration/evidence/ModeratedEvidenceModule.sol
+++ b/contracts/src/arbitration/evidence/ModeratedEvidenceModule.sol
@@ -72,12 +72,12 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
 
     /// @notice To be raised when a moderated evidence is submitted. Should point to the resource (evidences are not to be stored on chain due to gas considerations).
     /// @param _arbitrator The arbitrator of the contract.
-    /// @param _externalDisputeID Unique identifier for this dispute outside Kleros. It's the submitter responsibility to submit the right evidence group ID.
+    /// @param _arbitratorDisputeID The identifier of the dispute in the Arbitrator contract.
     /// @param _party The address of the party submiting the evidence. Note that 0x0 refers to evidence not submitted by any party.
     /// @param _evidence Stringified evidence object, example: '{"name" : "Justification", "description" : "Description", "fileURI" : "/ipfs/QmWQV5ZFFhEJiW8Lm7ay2zLxC2XS4wx1b2W7FfdrLMyQQc"}'.
     event ModeratedEvidence(
         IArbitratorV2 indexed _arbitrator,
-        uint256 indexed _externalDisputeID,
+        uint256 indexed _arbitratorDisputeID,
         address indexed _party,
         string _evidence
     );
@@ -214,7 +214,7 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
         moderation.arbitratorDataID = arbitratorDataList.length - 1;
 
         // When evidence is submitted for a foreign arbitrable, the arbitrator field of Evidence is ignored.
-        emit ModeratedEvidence(arbitrator, _evidenceGroupID, msg.sender, _evidence);
+        emit ModeratedEvidence(arbitrator, evidenceData.disputeID, msg.sender, _evidence);
     }
 
     /// @notice Moderates an evidence submission. Requires the contester to at least double the accumulated stake of the oposing party.
@@ -265,12 +265,7 @@ contract ModeratedEvidenceModule is IArbitrableV2 {
             );
             disputeIDtoEvidenceID[evidenceData.disputeID] = _evidenceID;
 
-            emit DisputeRequest(
-                arbitrator,
-                evidenceData.disputeID,
-                uint256(_evidenceID),
-                arbitratorData.disputeTemplateId
-            );
+            emit DisputeRequest(arbitrator, evidenceData.disputeID, arbitratorData.disputeTemplateId);
             evidenceData.disputed = true;
             moderation.bondDeadline = 0;
             moderation.currentWinner = Party.None;
diff --git a/contracts/src/arbitration/interfaces/IArbitrableV2.sol b/contracts/src/arbitration/interfaces/IArbitrableV2.sol
index b371aa867..9235f059c 100644
--- a/contracts/src/arbitration/interfaces/IArbitrableV2.sol
+++ b/contracts/src/arbitration/interfaces/IArbitrableV2.sol
@@ -17,14 +17,8 @@ interface IArbitrableV2 {
     /// @notice To be emitted when a dispute is created to link the correct template to the disputeID.
     /// @param _arbitrator The arbitrator of the contract.
     /// @param _arbitratorDisputeID The identifier of the dispute in the Arbitrator contract.
-    /// @param _externalDisputeID An identifier created outside Kleros by the protocol requesting arbitration.
     /// @param _templateId The identifier of the dispute template.
-    event DisputeRequest(
-        IArbitratorV2 indexed _arbitrator,
-        uint256 indexed _arbitratorDisputeID,
-        uint256 _externalDisputeID,
-        uint256 _templateId
-    );
+    event DisputeRequest(IArbitratorV2 indexed _arbitrator, uint256 indexed _arbitratorDisputeID, uint256 _templateId);
 
     /// @notice To be raised when a ruling is given.
     /// @param _arbitrator The arbitrator giving the ruling.
diff --git a/contracts/src/arbitration/interfaces/IEvidence.sol b/contracts/src/arbitration/interfaces/IEvidence.sol
index f27ce8447..5acf10d27 100644
--- a/contracts/src/arbitration/interfaces/IEvidence.sol
+++ b/contracts/src/arbitration/interfaces/IEvidence.sol
@@ -5,8 +5,8 @@ pragma solidity >=0.8.0 <0.9.0;
 /// @title IEvidence
 interface IEvidence {
     /// @notice To be raised when evidence is submitted. Should point to the resource (evidences are not to be stored on chain due to gas considerations).
-    /// @param _externalDisputeID Unique identifier for this dispute outside Kleros. It's the submitter responsibility to submit the right external dispute ID.
+    /// @param _arbitratorDisputeID The identifier of the dispute in the Arbitrator contract.
     /// @param _party The address of the party submitting the evidence.
     /// @param _evidence Stringified evidence object, example: '{"name" : "Justification", "description" : "Description", "fileURI" : "/ipfs/QmWQV5ZFFhEJiW8Lm7ay2zLxC2XS4wx1b2W7FfdrLMyQQc"}'.
-    event Evidence(uint256 indexed _externalDisputeID, address indexed _party, string _evidence);
+    event Evidence(uint256 indexed _arbitratorDisputeID, address indexed _party, string _evidence);
 }
diff --git a/contracts/src/gateway/HomeGateway.sol b/contracts/src/gateway/HomeGateway.sol
index 19a2e4337..56b1c835f 100644
--- a/contracts/src/gateway/HomeGateway.sol
+++ b/contracts/src/gateway/HomeGateway.sol
@@ -151,7 +151,7 @@ contract HomeGateway is IHomeGateway, UUPSProxiable, Initializable {
         disputeHashtoID[disputeHash] = disputeID;
         relayedData.relayer = msg.sender;
 
-        emit DisputeRequest(arbitrator, disputeID, _params.externalDisputeID, _params.templateId);
+        emit DisputeRequest(arbitrator, disputeID, _params.templateId);
 
         emit CrossChainDisputeIncoming(
             arbitrator,
@@ -159,7 +159,6 @@ contract HomeGateway is IHomeGateway, UUPSProxiable, Initializable {
             _params.foreignArbitrable,
             _params.foreignDisputeID,
             disputeID,
-            _params.externalDisputeID,
             _params.templateId
         );
     }
@@ -192,7 +191,7 @@ contract HomeGateway is IHomeGateway, UUPSProxiable, Initializable {
         relayedData.relayer = msg.sender;
 
         // Not strictly necessary for functionality, only to satisfy IArbitrableV2
-        emit DisputeRequest(arbitrator, disputeID, _params.externalDisputeID, _params.templateId);
+        emit DisputeRequest(arbitrator, disputeID, _params.templateId);
 
         emit CrossChainDisputeIncoming(
             arbitrator,
@@ -200,7 +199,6 @@ contract HomeGateway is IHomeGateway, UUPSProxiable, Initializable {
             _params.foreignArbitrable,
             _params.foreignDisputeID,
             disputeID,
-            _params.externalDisputeID,
             _params.templateId
         );
     }
diff --git a/contracts/src/gateway/interfaces/IHomeGateway.sol b/contracts/src/gateway/interfaces/IHomeGateway.sol
index 407d7b1ce..c2142e405 100644
--- a/contracts/src/gateway/interfaces/IHomeGateway.sol
+++ b/contracts/src/gateway/interfaces/IHomeGateway.sol
@@ -18,14 +18,12 @@ interface IHomeGateway is IArbitrableV2, ISenderGateway {
     /// @param _arbitrable The address of the Arbitrable contract.
     /// @param _arbitrableDisputeID The identifier of the dispute in the Arbitrable contract.
     /// @param _arbitratorDisputeID The identifier of the dispute in the Arbitrator contract.
-    /// @param _externalDisputeID An identifier created outside Kleros by the protocol requesting arbitration.
     event CrossChainDisputeIncoming(
         IArbitratorV2 _arbitrator,
         uint256 _arbitrableChainId,
         address indexed _arbitrable,
         uint256 indexed _arbitrableDisputeID,
         uint256 indexed _arbitratorDisputeID,
-        uint256 _externalDisputeID,
         uint256 _templateId
     );
 
@@ -39,7 +37,6 @@ interface IHomeGateway is IArbitrableV2, ISenderGateway {
         uint256 foreignChainID;
         address foreignArbitrable;
         uint256 foreignDisputeID;
-        uint256 externalDisputeID;
         uint256 templateId;
         uint256 choices;
         bytes extraData;
diff --git a/contracts/test/arbitration/draw.ts b/contracts/test/arbitration/draw.ts
index 3c0b9fac4..ad216bdc7 100644
--- a/contracts/test/arbitration/draw.ts
+++ b/contracts/test/arbitration/draw.ts
@@ -154,13 +154,12 @@ describe("Draw Benchmark", async () => {
     // Relayer tx
     await homeGateway
       .connect(await ethers.getSigner(relayer))
-      ["relayCreateDispute((bytes32,uint256,address,uint256,uint256,uint256,uint256,bytes))"](
+      ["relayCreateDispute((bytes32,uint256,address,uint256,uint256,uint256,bytes))"](
         {
           foreignBlockHash: lastBlock?.hash,
           foreignChainID: 31337,
           foreignArbitrable: arbitrable.target,
           foreignDisputeID: disputeId,
-          externalDisputeID: ethers.keccak256(ethers.toUtf8Bytes("future of france")),
           templateId: 0,
           choices: 2,
           extraData: `0x000000000000000000000000000000000000000000000000000000000000000${createDisputeCourtId}0000000000000000000000000000000000000000000000000000000000000003`,
diff --git a/contracts/test/arbitration/ruler.ts b/contracts/test/arbitration/ruler.ts
index 9defca63e..1c7fb379b 100644
--- a/contracts/test/arbitration/ruler.ts
+++ b/contracts/test/arbitration/ruler.ts
@@ -97,7 +97,7 @@ describe("KlerosCoreRuler", async () => {
       .and.to.emit(core, "JurorRewardPenalty")
       .withArgs(dev.address, disputeID, 0, 10000, 10000, 0, anyValue, ZeroAddress)
       .and.to.emit(resolver, "DisputeRequest")
-      .withArgs(core.target, disputeID, localDisputeID, templateId)
+      .withArgs(core.target, disputeID, templateId)
       .and.to.emit(resolver, "Ruling")
       .withArgs(core.target, disputeID, anyValue);
   });
@@ -121,7 +121,7 @@ describe("KlerosCoreRuler", async () => {
       .and.to.emit(core, "JurorRewardPenalty")
       .withArgs(dev.address, disputeID, 0, 10000, 10000, 0, anyValue, ZeroAddress)
       .and.to.emit(resolver, "DisputeRequest")
-      .withArgs(core.target, disputeID, localDisputeID, templateId)
+      .withArgs(core.target, disputeID, templateId)
       .and.to.emit(resolver, "Ruling")
       .withArgs(core.target, disputeID, 2);
   });
@@ -139,7 +139,7 @@ describe("KlerosCoreRuler", async () => {
       .to.emit(core, "DisputeCreation")
       .withArgs(disputeID, resolver.target)
       .and.to.emit(resolver, "DisputeRequest")
-      .withArgs(core.target, disputeID, localDisputeID, templateId);
+      .withArgs(core.target, disputeID, templateId);
 
     await expect(core.connect(deployer).executeRuling(disputeID, 3, true, true)).revertedWithCustomError(
       core,
diff --git a/contracts/test/evidence/index.ts b/contracts/test/evidence/index.ts
index 60c1cb0f5..aa1cd0fbf 100644
--- a/contracts/test/evidence/index.ts
+++ b/contracts/test/evidence/index.ts
@@ -154,9 +154,9 @@ describe("Home Evidence contract", async () => {
       if (receipt === null) throw new Error("Receipt is null");
       const evidenceID = ethers.solidityPackedKeccak256(["uint", "string"], [1234, newEvidence]);
 
-      const [_arbitrator, _externalDisputeID, _party, _evidence] = getEmittedEvent("ModeratedEvidence", receipt).args;
+      const [_arbitrator, _disputeID, _party, _evidence] = getEmittedEvent("ModeratedEvidence", receipt).args;
       expect(_arbitrator).to.equal(arbitrator.target, "Wrong arbitrator.");
-      expect(_externalDisputeID).to.equal(1234, "Wrong external dispute ID.");
+      expect(_disputeID).to.equal(0, "Wrong dispute ID.");
       expect(_party).to.equal(user1.address, "Wrong submitter.");
       expect(_evidence).to.equal(newEvidence, "Wrong evidence message.");
 
@@ -261,14 +261,10 @@ describe("Home Evidence contract", async () => {
       });
       let receipt = await tx.wait();
       if (receipt === null) throw new Error("Receipt is null");
-      let [_arbitrator, _arbitrableDisputeID, _externalDisputeID, _templateId, _templateUri] = getEmittedEvent(
-        "DisputeRequest",
-        receipt
-      ).args;
+      let [_arbitrator, _disputeID, _templateId, _templateUri] = getEmittedEvent("DisputeRequest", receipt).args;
       expect(_arbitrator).to.equal(arbitrator.target, "Wrong arbitrator.");
-      expect(_arbitrableDisputeID).to.equal(0, "Wrong dispute ID.");
+      expect(_disputeID).to.equal(0, "Wrong dispute ID.");
       expect(_templateId).to.equal(1, "Wrong template ID.");
-      expect(_externalDisputeID).to.equal(evidenceID, "Wrong external dispute ID.");
 
       await expect(
         evidenceModule.connect(user2).moderate(evidenceID, Party.Moderator, {
diff --git a/contracts/test/integration/index.ts b/contracts/test/integration/index.ts
index cc7dd2b13..897dbff58 100644
--- a/contracts/test/integration/index.ts
+++ b/contracts/test/integration/index.ts
@@ -111,14 +111,7 @@ describe("Integration tests", async () => {
     await expect(tx)
       .to.emit(foreignGateway, "CrossChainDisputeOutgoing")
       .withArgs(anyValue, arbitrable.target, 1, 2, "0x00");
-    await expect(tx)
-      .to.emit(arbitrable, "DisputeRequest")
-      .withArgs(
-        foreignGateway.target,
-        1,
-        46619385602526556702049273755915206310773794210139929511467397410441395547901n,
-        0
-      );
+    await expect(tx).to.emit(arbitrable, "DisputeRequest").withArgs(foreignGateway.target, 1, 0);
     if (tx.blockNumber === null) throw new Error("tx.blockNumber is null");
     const lastBlock = await ethers.provider.getBlock(tx.blockNumber - 1);
     if (lastBlock === null) throw new Error("lastBlock is null");
@@ -132,21 +125,18 @@ describe("Integration tests", async () => {
     }
     // Relayer tx
     await expect(
-      homeGateway
-        .connect(relayer)
-        ["relayCreateDispute((bytes32,uint256,address,uint256,uint256,uint256,uint256,bytes))"](
-          {
-            foreignBlockHash: ethers.toBeHex(lastBlock.hash),
-            foreignChainID: 31337,
-            foreignArbitrable: arbitrable.target,
-            foreignDisputeID: disputeId,
-            externalDisputeID: ethers.keccak256(ethers.toUtf8Bytes("future of france")),
-            templateId: 0,
-            choices: 2,
-            extraData: "0x00",
-          },
-          { value: arbitrationCost }
-        )
+      homeGateway.connect(relayer)["relayCreateDispute((bytes32,uint256,address,uint256,uint256,uint256,bytes))"](
+        {
+          foreignBlockHash: ethers.toBeHex(lastBlock.hash),
+          foreignChainID: 31337,
+          foreignArbitrable: arbitrable.target,
+          foreignDisputeID: disputeId,
+          templateId: 0,
+          choices: 2,
+          extraData: "0x00",
+        },
+        { value: arbitrationCost }
+      )
     ).to.emit(homeGateway, "DisputeRequest");
 
     await network.provider.send("evm_increaseTime", [2000]); // Wait for minStakingTime

From decd3e75b62305ec4494c06d028464918b4fa18f Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Fri, 10 Oct 2025 17:47:31 +0100
Subject: [PATCH 158/175] chore: metrics script

---
 contracts/scripts/generateMetrics.sh | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/contracts/scripts/generateMetrics.sh b/contracts/scripts/generateMetrics.sh
index 4e7bea4be..52c56d8f7 100755
--- a/contracts/scripts/generateMetrics.sh
+++ b/contracts/scripts/generateMetrics.sh
@@ -14,10 +14,11 @@ yarn dlx solidity-code-metrics \
     "$SOURCE_DIR"/arbitration/evidence/EvidenceModule.sol \
     "$SOURCE_DIR"/arbitration/interfaces/* \
     "$SOURCE_DIR"/libraries/Constants.sol \
+    "$SOURCE_DIR"/libraries/SortitionTrees.sol \
     "$SOURCE_DIR"/libraries/Safe* \
     "$SOURCE_DIR"/rng/RNGWithFallback.sol \
     "$SOURCE_DIR"/rng/ChainlinkRNG.sol \
     "$SOURCE_DIR"/rng/IRNG.sol \
     "$SOURCE_DIR"/proxy/UUPSProx* \
     "$SOURCE_DIR"/proxy/Initializable.sol \
->METRICS.md
+--html >METRICS.html

From 00be694745ad1faba3d51956dc9b3a6f0e1b8ba7 Mon Sep 17 00:00:00 2001
From: unknownunknown1 <danil@kleros.io>
Date: Mon, 6 Oct 2025 21:03:45 +1000
Subject: [PATCH 159/175] fix(DK): allow recurring DK

---
 .../dispute-kits/DisputeKitClassicBase.sol    |  20 +-
 .../test/foundry/KlerosCore_Appeals.t.sol     | 283 ++++++++++++++++++
 2 files changed, 297 insertions(+), 6 deletions(-)

diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index 698a9a547..fddf384e4 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -206,20 +206,28 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         bytes calldata _extraData,
         uint256 /*_nbVotes*/
     ) external override onlyByCore {
-        uint256 localDisputeID = disputes.length;
-        Dispute storage dispute = disputes.push();
+        uint256 localDisputeID;
+        Dispute storage dispute;
+        // Check if this dk wasn't already active before. Can happen if DK1 jumps to DK2 and then back to DK1.
+        if (coreDisputeIDToActive[_coreDisputeID]) {
+            localDisputeID = coreDisputeIDToLocal[_coreDisputeID];
+            dispute = disputes[localDisputeID];
+            dispute.jumped = false;
+        } else {
+            localDisputeID = disputes.length;
+            dispute = disputes.push();
+            coreDisputeIDToLocal[_coreDisputeID] = localDisputeID;
+            coreDisputeIDToActive[_coreDisputeID] = true;
+        }
+
         dispute.numberOfChoices = _numberOfChoices;
         dispute.extraData = _extraData;
-        dispute.jumped = false; // Possibly true if this DK has jumped in a previous round.
-
         // New round in the Core should be created before the dispute creation in DK.
         dispute.coreRoundIDToLocal[core.getNumberOfRounds(_coreDisputeID) - 1] = dispute.rounds.length;
 
         Round storage round = dispute.rounds.push();
         round.tied = true;
 
-        coreDisputeIDToLocal[_coreDisputeID] = localDisputeID;
-        coreDisputeIDToActive[_coreDisputeID] = true;
         emit DisputeCreation(_coreDisputeID, _numberOfChoices, _extraData);
     }
 
diff --git a/contracts/test/foundry/KlerosCore_Appeals.t.sol b/contracts/test/foundry/KlerosCore_Appeals.t.sol
index 9a88bb1b2..98b89346e 100644
--- a/contracts/test/foundry/KlerosCore_Appeals.t.sol
+++ b/contracts/test/foundry/KlerosCore_Appeals.t.sol
@@ -467,6 +467,289 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
         assertEq(account, staker1, "Wrong drawn account in the classic DK");
     }
 
+    function test_appeal_recurringDK() public {
+        // Test the behaviour when dispute jumps from DK3 to DK2 and then back to DK3 again.
+
+        // Setup: create 2 more courts to facilitate appeal jump. Create 2 more DK.
+        // Set General Court as parent to court2, and court2 as parent to court3. dk2 as jump DK for dk3, and dk3 as jump DK for dk2.
+        // Ensure DK2 is supported by Court2 and DK3 is supported by court3.
+        // Preemptively add DK3 support for General court.
+
+        // Initial dispute starts with Court3, DK3.
+        // Jumps to Court2, DK2.
+        // Then jumps to General Court, DK3.
+        uint256 disputeID = 0;
+
+        uint96 courtID2 = 2;
+        uint96 courtID3 = 3;
+
+        uint256 dkID2 = 2;
+        uint256 dkID3 = 3;
+
+        DisputeKitClassic dkLogic = new DisputeKitClassic();
+
+        bytes memory initDataDk2 = abi.encodeWithSignature(
+            "initialize(address,address,address,uint256)",
+            owner,
+            address(core),
+            address(wNative),
+            dkID3
+        );
+        UUPSProxy proxyDk2 = new UUPSProxy(address(dkLogic), initDataDk2);
+        DisputeKitClassic disputeKit2 = DisputeKitClassic(address(proxyDk2));
+
+        bytes memory initDataDk3 = abi.encodeWithSignature(
+            "initialize(address,address,address,uint256)",
+            owner,
+            address(core),
+            address(wNative),
+            dkID2
+        );
+        UUPSProxy proxyDk3 = new UUPSProxy(address(dkLogic), initDataDk3);
+        DisputeKitClassic disputeKit3 = DisputeKitClassic(address(proxyDk3));
+
+        vm.prank(owner);
+        core.addNewDisputeKit(disputeKit2);
+        vm.prank(owner);
+        core.addNewDisputeKit(disputeKit3);
+
+        uint256[] memory supportedDK = new uint256[](2);
+        supportedDK[0] = DISPUTE_KIT_CLASSIC;
+        supportedDK[1] = dkID2;
+        vm.prank(owner);
+        core.createCourt(
+            GENERAL_COURT,
+            hiddenVotes,
+            minStake,
+            alpha,
+            feeForJuror,
+            7, // jurors for jump. Minimal number to ensure jump after the first appeal
+            [uint256(60), uint256(120), uint256(180), uint256(240)], // Times per period
+            sortitionExtraData,
+            supportedDK
+        );
+        assertEq(core.isSupported(courtID2, dkID2), true, "dkID2 should be supported by Court2");
+
+        (uint96 courtParent, , , , , uint256 courtJurorsForCourtJump) = core.courts(courtID2);
+        assertEq(courtParent, GENERAL_COURT, "Wrong court parent for court2");
+        assertEq(courtJurorsForCourtJump, 7, "Wrong jurors for jump value for court2");
+
+        supportedDK = new uint256[](2);
+        supportedDK[0] = DISPUTE_KIT_CLASSIC;
+        supportedDK[1] = dkID3;
+        vm.prank(owner);
+        core.createCourt(
+            courtID2,
+            hiddenVotes,
+            minStake,
+            alpha,
+            feeForJuror,
+            3, // jurors for jump. Minimal number to ensure jump after the first appeal
+            [uint256(60), uint256(120), uint256(180), uint256(240)], // Times per period
+            sortitionExtraData,
+            supportedDK
+        );
+        assertEq(core.isSupported(courtID3, dkID3), true, "dkID3 should be supported by Court3");
+
+        (courtParent, , , , , courtJurorsForCourtJump) = core.courts(courtID3);
+        assertEq(courtParent, courtID2, "Wrong court parent for court3");
+        assertEq(courtJurorsForCourtJump, 3, "Wrong jurors for jump value for court3");
+
+        vm.prank(owner);
+        supportedDK[0] = DISPUTE_KIT_CLASSIC;
+        supportedDK[1] = dkID3;
+        core.enableDisputeKits(GENERAL_COURT, supportedDK, true);
+        assertEq(core.isSupported(GENERAL_COURT, dkID3), true, "dkID3 should be supported by GENERAL_COURT");
+
+        bytes memory newExtraData = abi.encodePacked(uint256(courtID3), DEFAULT_NB_OF_JURORS, dkID3);
+        arbitrable.changeArbitratorExtraData(newExtraData);
+
+        vm.prank(staker1);
+        core.setStake(courtID3, 20000);
+        vm.prank(disputer);
+        arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
+        vm.warp(block.timestamp + minStakingTime);
+        sortitionModule.passPhase(); // Generating
+        vm.warp(block.timestamp + rngLookahead);
+        sortitionModule.passPhase(); // Drawing phase
+
+        // Round1 //
+
+        KlerosCore.Round memory round = core.getRoundInfo(disputeID, 0);
+        assertEq(round.disputeKitID, dkID3, "Wrong DK ID");
+
+        assertEq(disputeKit3.coreDisputeIDToActive(disputeID), true, "Should be true for dk3");
+        assertEq(disputeKit3.coreDisputeIDToLocal(disputeID), 0, "Wrong local dispute ID to core dispute ID");
+        assertEq(disputeKit3.getNumberOfRounds(0), 1, "Wrong number of rounds dk3"); // local dispute id
+        (, uint256 localRoundID) = disputeKit3.getLocalDisputeRoundID(disputeID, 0);
+        assertEq(localRoundID, 0, "Wrong local round ID dk3");
+
+        (, bool jumped, ) = disputeKit3.disputes(0);
+        assertEq(jumped, false, "jumped should be false in dk3");
+
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS);
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Vote
+
+        uint256[] memory voteIDs = new uint256[](3);
+        voteIDs[0] = 0;
+        voteIDs[1] = 1;
+        voteIDs[2] = 2;
+
+        vm.prank(staker1);
+        disputeKit3.castVote(disputeID, voteIDs, 2, 0, "XYZ");
+
+        core.passPeriod(disputeID); // Appeal
+
+        vm.prank(crowdfunder1);
+        disputeKit3.fundAppeal{value: 0.63 ether}(disputeID, 1);
+
+        assertEq(core.isDisputeKitJumping(disputeID), true, "Should be jumping");
+
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCore.CourtJump(disputeID, 1, courtID3, courtID2);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCore.DisputeKitJump(disputeID, 1, dkID3, dkID2);
+        vm.expectEmit(true, true, true, true);
+        emit DisputeKitClassicBase.DisputeCreation(disputeID, 2, newExtraData);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCore.AppealDecision(disputeID, arbitrable);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCore.NewPeriod(disputeID, KlerosCore.Period.evidence);
+        vm.prank(crowdfunder2);
+        disputeKit3.fundAppeal{value: 0.42 ether}(disputeID, 2);
+
+        // Round2 //
+
+        (, jumped, ) = disputeKit3.disputes(0);
+        assertEq(jumped, true, "jumped should be true in dk3");
+        assertEq(
+            (disputeKit3.getFundedChoices(disputeID)).length,
+            2,
+            "No fresh round created so the number of funded choices should be 2"
+        );
+
+        assertEq(disputeKit3.coreDisputeIDToActive(disputeID), true, "Should still be true for dk3");
+        assertEq(disputeKit3.coreDisputeIDToLocal(disputeID), 0, "core to local ID should not change for dk3");
+        assertEq(disputeKit3.getNumberOfRounds(0), 1, "Wrong number of rounds dk3"); // local dispute id
+        (, localRoundID) = disputeKit3.getLocalDisputeRoundID(disputeID, 0);
+        assertEq(localRoundID, 0, "Local round ID should not change dk3");
+
+        round = core.getRoundInfo(disputeID, 1);
+        assertEq(round.disputeKitID, dkID2, "Wrong DK ID");
+        assertEq(sortitionModule.disputesWithoutJurors(), 1, "Wrong disputesWithoutJurors count");
+        (uint96 courtID, , , , ) = core.disputes(disputeID);
+        assertEq(courtID, courtID2, "Wrong court ID after jump");
+
+        (, jumped, ) = disputeKit2.disputes(0);
+        assertEq(jumped, false, "jumped should be false in the DK that dispute jumped to");
+
+        assertEq(disputeKit2.coreDisputeIDToActive(disputeID), true, "Should be true for dk2");
+        assertEq(disputeKit2.coreDisputeIDToLocal(disputeID), 0, "Wrong local dispute ID to core dispute ID dk2");
+        assertEq(disputeKit2.getNumberOfRounds(0), 1, "Wrong number of rounds dk2"); // local dispute id
+        (, localRoundID) = disputeKit2.getLocalDisputeRoundID(disputeID, 1);
+        assertEq(localRoundID, 0, "Wrong local round ID for dk2");
+
+        vm.prank(address(core));
+        vm.expectRevert(DisputeKitClassicBase.DisputeJumpedToParentDK.selector);
+        disputeKit3.draw(disputeID, 1);
+
+        core.draw(disputeID, 7); // New round requires 7 jurors
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Vote
+
+        voteIDs = new uint256[](7);
+        for (uint256 i = 0; i < voteIDs.length; i++) {
+            voteIDs[i] = i;
+        }
+
+        vm.prank(staker1);
+        vm.expectRevert(DisputeKitClassicBase.DisputeJumpedToParentDK.selector);
+        disputeKit3.castVote(disputeID, voteIDs, 2, 0, "XYZ");
+
+        vm.prank(staker1);
+        disputeKit2.castVote(disputeID, voteIDs, 2, 0, "XYZ");
+
+        core.passPeriod(disputeID); // Appeal
+
+        vm.prank(crowdfunder1);
+        vm.expectRevert(DisputeKitClassicBase.DisputeJumpedToParentDK.selector);
+        disputeKit3.fundAppeal{value: 1.35 ether}(disputeID, 1);
+
+        assertEq(core.isDisputeKitJumping(disputeID), true, "Should be jumping");
+
+        vm.prank(crowdfunder1);
+        // appealCost is 0.45. (0.03 * 15)
+        disputeKit2.fundAppeal{value: 1.35 ether}(disputeID, 1); // 0.45 + (0.45 * 20000/10000).
+
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCore.CourtJump(disputeID, 2, courtID2, GENERAL_COURT);
+        vm.expectEmit(true, true, true, true);
+        emit KlerosCore.DisputeKitJump(disputeID, 2, dkID2, dkID3);
+        vm.prank(crowdfunder2);
+        disputeKit2.fundAppeal{value: 0.9 ether}(disputeID, 2); // 0.45 + (0.45 * 10000/10000).
+
+        // Round3 //
+
+        (, jumped, ) = disputeKit2.disputes(0);
+        assertEq(jumped, true, "jumped should be true in dk2");
+        assertEq(
+            (disputeKit2.getFundedChoices(disputeID)).length,
+            2,
+            "No fresh round created so the number of funded choices should be 2 for dk2"
+        );
+        assertEq(
+            disputeKit3.getFundedChoices(disputeID).length,
+            0,
+            "Should be 0 funded choices in dk3 because fresh round"
+        );
+
+        assertEq(disputeKit3.coreDisputeIDToActive(disputeID), true, "Should be true for dk3 round3");
+        assertEq(disputeKit3.coreDisputeIDToLocal(disputeID), 0, "core to local ID should stay the same for dk3");
+        assertEq(disputeKit3.getNumberOfRounds(0), 2, "Wrong number of rounds dk3 round3"); // local dispute id
+        (, localRoundID) = disputeKit3.getLocalDisputeRoundID(disputeID, 2);
+        assertEq(localRoundID, 1, "Wrong local round id for dk3 round3");
+
+        round = core.getRoundInfo(disputeID, 2);
+        assertEq(round.disputeKitID, dkID3, "Wrong DK ID");
+        assertEq(sortitionModule.disputesWithoutJurors(), 1, "Wrong disputesWithoutJurors count");
+        (courtID, , , , ) = core.disputes(disputeID);
+        assertEq(courtID, GENERAL_COURT, "Wrong court ID after jump");
+
+        (, jumped, ) = disputeKit3.disputes(0); // local dispute id
+        assertEq(jumped, false, "jumped should be false in the DK that dispute jumped to");
+
+        assertEq(disputeKit2.coreDisputeIDToActive(disputeID), true, "Should be true for dk2 round3");
+        assertEq(
+            disputeKit2.coreDisputeIDToLocal(disputeID),
+            0,
+            "Wrong local dispute ID to core dispute ID dk2 round3"
+        );
+        assertEq(disputeKit2.getNumberOfRounds(0), 1, "Wrong number of rounds dk2 round3"); // local dispute id
+        (, localRoundID) = disputeKit2.getLocalDisputeRoundID(disputeID, 1);
+        assertEq(localRoundID, 0, "Wrong local round ID for dk2 round3");
+
+        vm.prank(address(core));
+        vm.expectRevert(DisputeKitClassicBase.DisputeJumpedToParentDK.selector);
+        disputeKit2.draw(disputeID, 1);
+
+        core.draw(disputeID, 15); // New round requires 15 jurors
+        vm.warp(block.timestamp + timesPerPeriod[0]);
+        core.passPeriod(disputeID); // Vote
+
+        voteIDs = new uint256[](15);
+        for (uint256 i = 0; i < voteIDs.length; i++) {
+            voteIDs[i] = i;
+        }
+
+        vm.prank(staker1);
+        vm.expectRevert(DisputeKitClassicBase.DisputeJumpedToParentDK.selector);
+        disputeKit2.castVote(disputeID, voteIDs, 2, 0, "XYZ");
+
+        vm.prank(staker1);
+        disputeKit3.castVote(disputeID, voteIDs, 2, 0, "XYZ");
+    }
+
     function test_appeal_quickPassPeriod() public {
         uint256 disputeID = 0;
 

From 536e61ce049f262ad77e7f26f19824399e8d560a Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 8 Oct 2025 21:24:29 +0100
Subject: [PATCH 160/175] test: withdrawFeesAndRewards() coverage for complex
 DK jump sequence

---
 .../test/foundry/KlerosCore_Appeals.t.sol     | 42 +++++++++++++++++++
 1 file changed, 42 insertions(+)

diff --git a/contracts/test/foundry/KlerosCore_Appeals.t.sol b/contracts/test/foundry/KlerosCore_Appeals.t.sol
index 98b89346e..295128d37 100644
--- a/contracts/test/foundry/KlerosCore_Appeals.t.sol
+++ b/contracts/test/foundry/KlerosCore_Appeals.t.sol
@@ -748,6 +748,48 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
 
         vm.prank(staker1);
         disputeKit3.castVote(disputeID, voteIDs, 2, 0, "XYZ");
+
+        vm.warp(block.timestamp + timesPerPeriod[2]);
+        core.passPeriod(disputeID); // Appeal
+
+        vm.warp(block.timestamp + timesPerPeriod[3]);
+        core.passPeriod(disputeID); // Execution
+
+        core.executeRuling(disputeID); // winning choice is 2
+
+        // Appeal Rewards for Round 1 //
+        disputeKit3.withdrawFeesAndRewards(disputeID, payable(crowdfunder1), 0, 1); // wrong side, no reward
+        vm.expectEmit();
+        emit DisputeKitClassicBase.Withdrawal(disputeID, 0, 2, payable(crowdfunder2), 0.84 ether);
+        disputeKit3.withdrawFeesAndRewards(disputeID, payable(crowdfunder2), 0, 2); // REWARDS
+        disputeKit2.withdrawFeesAndRewards(disputeID, payable(crowdfunder1), 0, 1); // wrong DK, no reward
+        disputeKit2.withdrawFeesAndRewards(disputeID, payable(crowdfunder2), 0, 2); // wrong DK, no reward
+        vm.expectRevert(DisputeKitClassicBase.NotActiveForCoreDisputeID.selector);
+        disputeKit.withdrawFeesAndRewards(disputeID, payable(crowdfunder1), 0, 1); // wrong DK, no reward
+        vm.expectRevert(DisputeKitClassicBase.NotActiveForCoreDisputeID.selector);
+        disputeKit.withdrawFeesAndRewards(disputeID, payable(crowdfunder2), 0, 2); // wrong DK, no reward
+
+        // Appeal Rewards for Round 2 //
+        disputeKit3.withdrawFeesAndRewards(disputeID, payable(crowdfunder1), 1, 1); // wrong DK, no reward
+        disputeKit3.withdrawFeesAndRewards(disputeID, payable(crowdfunder2), 1, 2); // wrong DK, no reward
+        disputeKit2.withdrawFeesAndRewards(disputeID, payable(crowdfunder1), 1, 1); // wrong side, no reward
+        vm.expectEmit();
+        emit DisputeKitClassicBase.Withdrawal(disputeID, 1, 2, payable(crowdfunder2), 1.8 ether);
+        disputeKit2.withdrawFeesAndRewards(disputeID, payable(crowdfunder2), 1, 2); // REWARDS
+        vm.expectRevert(DisputeKitClassicBase.NotActiveForCoreDisputeID.selector);
+        disputeKit.withdrawFeesAndRewards(disputeID, payable(crowdfunder1), 1, 1); // wrong DK, no reward
+        vm.expectRevert(DisputeKitClassicBase.NotActiveForCoreDisputeID.selector);
+        disputeKit.withdrawFeesAndRewards(disputeID, payable(crowdfunder2), 1, 2); // wrong DK, no reward
+
+        // Appeal Rewards for Round 3 //
+        disputeKit3.withdrawFeesAndRewards(disputeID, payable(crowdfunder1), 2, 1); // no appeal, no reward
+        disputeKit3.withdrawFeesAndRewards(disputeID, payable(crowdfunder2), 2, 2); // no appeal, no reward
+        disputeKit2.withdrawFeesAndRewards(disputeID, payable(crowdfunder1), 2, 1); // no appeal, no reward
+        disputeKit2.withdrawFeesAndRewards(disputeID, payable(crowdfunder2), 2, 2); // no appeal, no reward
+        vm.expectRevert(DisputeKitClassicBase.NotActiveForCoreDisputeID.selector);
+        disputeKit.withdrawFeesAndRewards(disputeID, payable(crowdfunder1), 2, 1); // wrong DK, no reward
+        vm.expectRevert(DisputeKitClassicBase.NotActiveForCoreDisputeID.selector);
+        disputeKit.withdrawFeesAndRewards(disputeID, payable(crowdfunder2), 2, 2); // wrong DK, no reward
     }
 
     function test_appeal_quickPassPeriod() public {

From 374b4f28884d3e5a269bbdda62ab26d043987894 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Mon, 13 Oct 2025 23:42:54 +0100
Subject: [PATCH 161/175] refactor: active/jump checks, no more _round param in
 withdrawFeesAndRewards(), DK errors renamed

---
 .../dispute-kits/DisputeKitClassicBase.sol    | 100 ++++++++--------
 .../dispute-kits/DisputeKitGatedShutter.sol   |   2 +-
 .../dispute-kits/DisputeKitShutter.sol        |   2 +-
 .../arbitration/interfaces/IDisputeKit.sol    |   1 +
 .../test/foundry/KlerosCore_Appeals.t.sol     | 112 ++++++++----------
 .../test/foundry/KlerosCore_Disputes.t.sol    |  10 +-
 .../test/foundry/KlerosCore_Execution.t.sol   |  12 +-
 .../test/foundry/KlerosCore_Voting.t.sol      |  11 +-
 8 files changed, 117 insertions(+), 133 deletions(-)

diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index fddf384e4..859b3b0f5 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -24,7 +24,6 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     struct Dispute {
         Round[] rounds; // Rounds of the dispute. 0 is the default round, and [1, ..n] are the appeal rounds.
         uint256 numberOfChoices; // The number of choices jurors have when voting. This does not include choice `0` which is reserved for "refuse to arbitrate".
-        bool jumped; // True if dispute jumped to a parent dispute kit and won't be handled by this DK anymore.
         mapping(uint256 => uint256) coreRoundIDToLocal; // Maps id of the round in the core contract to the index of the round of related local dispute.
         bytes extraData; // Extradata for the dispute.
         uint256[10] __gap; // Reserved slots for future upgrades.
@@ -54,6 +53,11 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         uint256[10] __gap; // Reserved slots for future upgrades.
     }
 
+    struct Active {
+        bool dispute; // True if at least one round in the dispute has been active on this Dispute Kit. False if the dispute is unknown to this Dispute Kit.
+        bool currentRound; // True if the dispute's current round is active on this Dispute Kit. False if the dispute has jumped to another Dispute Kit.
+    }
+
     // ************************************* //
     // *             Storage               * //
     // ************************************* //
@@ -67,7 +71,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     Dispute[] public disputes; // Array of the locally created disputes.
     mapping(uint256 => uint256) public coreDisputeIDToLocal; // Maps the dispute ID in Kleros Core to the local dispute ID.
     bool public singleDrawPerJuror; // Whether each juror can only draw once per dispute, false by default.
-    mapping(uint256 coreDisputeID => bool) public coreDisputeIDToActive; // True if this dispute kit is active for this core dispute ID.
+    mapping(uint256 coreDisputeID => Active) public coreDisputeIDToActive; // Active status of the dispute and the current round.
     address public wNative; // The wrapped native token for safeSend().
     uint256 public jumpDisputeKitID; // The ID of the dispute kit in Kleros Core disputeKits array that the dispute should switch to after the court jump, in case the new court doesn't support this dispute kit.
 
@@ -106,17 +110,10 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
 
     /// @notice To be emitted when the contributed funds are withdrawn.
     /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.
-    /// @param _coreRoundID The identifier of the round in the Arbitrator contract.
     /// @param _choice The choice that is being funded.
     /// @param _contributor The address of the contributor.
     /// @param _amount The amount withdrawn.
-    event Withdrawal(
-        uint256 indexed _coreDisputeID,
-        uint256 indexed _coreRoundID,
-        uint256 _choice,
-        address indexed _contributor,
-        uint256 _amount
-    );
+    event Withdrawal(uint256 indexed _coreDisputeID, uint256 _choice, address indexed _contributor, uint256 _amount);
 
     /// @notice To be emitted when a choice is fully funded for an appeal.
     /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.
@@ -138,8 +135,9 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         _;
     }
 
-    modifier notJumped(uint256 _coreDisputeID) {
-        if (disputes[coreDisputeIDToLocal[_coreDisputeID]].jumped) revert DisputeJumpedToParentDK();
+    modifier isActive(uint256 _coreDisputeID) {
+        if (!coreDisputeIDToActive[_coreDisputeID].dispute) revert DisputeUnknownInThisDisputeKit();
+        if (!coreDisputeIDToActive[_coreDisputeID].currentRound) revert DisputeJumpedToAnotherDisputeKit();
         _;
     }
 
@@ -208,25 +206,26 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     ) external override onlyByCore {
         uint256 localDisputeID;
         Dispute storage dispute;
-        // Check if this dk wasn't already active before. Can happen if DK1 jumps to DK2 and then back to DK1.
-        if (coreDisputeIDToActive[_coreDisputeID]) {
+        Active storage active = coreDisputeIDToActive[_coreDisputeID];
+        if (active.dispute) {
+            // The dispute has already been created in this DK in a previous round. E.g. if DK1 jumps to DK2 and then back to DK1.
             localDisputeID = coreDisputeIDToLocal[_coreDisputeID];
             dispute = disputes[localDisputeID];
-            dispute.jumped = false;
         } else {
+            // The dispute has not been created in this DK yet.
             localDisputeID = disputes.length;
             dispute = disputes.push();
             coreDisputeIDToLocal[_coreDisputeID] = localDisputeID;
-            coreDisputeIDToActive[_coreDisputeID] = true;
         }
 
+        active.dispute = true;
+        active.currentRound = true;
         dispute.numberOfChoices = _numberOfChoices;
         dispute.extraData = _extraData;
-        // New round in the Core should be created before the dispute creation in DK.
-        dispute.coreRoundIDToLocal[core.getNumberOfRounds(_coreDisputeID) - 1] = dispute.rounds.length;
 
-        Round storage round = dispute.rounds.push();
-        round.tied = true;
+        // KlerosCore.Round must have been already created.
+        dispute.coreRoundIDToLocal[core.getNumberOfRounds(_coreDisputeID) - 1] = dispute.rounds.length;
+        dispute.rounds.push().tied = true;
 
         emit DisputeCreation(_coreDisputeID, _numberOfChoices, _extraData);
     }
@@ -235,7 +234,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     function draw(
         uint256 _coreDisputeID,
         uint256 _nonce
-    ) external override onlyByCore notJumped(_coreDisputeID) returns (address drawnAddress, uint96 fromSubcourtID) {
+    ) external override onlyByCore isActive(_coreDisputeID) returns (address drawnAddress, uint96 fromSubcourtID) {
         uint256 localDisputeID = coreDisputeIDToLocal[_coreDisputeID];
         Dispute storage dispute = disputes[localDisputeID];
         uint256 localRoundID = dispute.rounds.length - 1;
@@ -274,11 +273,10 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         uint256 _coreDisputeID,
         uint256[] calldata _voteIDs,
         bytes32 _commit
-    ) internal notJumped(_coreDisputeID) {
+    ) internal isActive(_coreDisputeID) {
         (, , KlerosCore.Period period, , ) = core.disputes(_coreDisputeID);
         if (period != KlerosCore.Period.commit) revert NotCommitPeriod();
         if (_commit == bytes32(0)) revert EmptyCommit();
-        if (!coreDisputeIDToActive[_coreDisputeID]) revert NotActiveForCoreDisputeID();
 
         Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];
         Round storage round = dispute.rounds[dispute.rounds.length - 1];
@@ -321,11 +319,10 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         uint256 _salt,
         string memory _justification,
         address _juror
-    ) internal notJumped(_coreDisputeID) {
+    ) internal isActive(_coreDisputeID) {
         (, , KlerosCore.Period period, , ) = core.disputes(_coreDisputeID);
         if (period != KlerosCore.Period.vote) revert NotVotePeriod();
         if (_voteIDs.length == 0) revert EmptyVoteIDs();
-        if (!coreDisputeIDToActive[_coreDisputeID]) revert NotActiveForCoreDisputeID();
 
         uint256 localDisputeID = coreDisputeIDToLocal[_coreDisputeID];
         Dispute storage dispute = disputes[localDisputeID];
@@ -372,10 +369,9 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     /// Note that the surplus deposit will be reimbursed.
     /// @param _coreDisputeID Index of the dispute in Kleros Core.
     /// @param _choice A choice that receives funding.
-    function fundAppeal(uint256 _coreDisputeID, uint256 _choice) external payable notJumped(_coreDisputeID) {
+    function fundAppeal(uint256 _coreDisputeID, uint256 _choice) external payable isActive(_coreDisputeID) {
         Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];
         if (_choice > dispute.numberOfChoices) revert ChoiceOutOfBounds();
-        if (!coreDisputeIDToActive[_coreDisputeID]) revert NotActiveForCoreDisputeID();
 
         (uint256 appealPeriodStart, uint256 appealPeriodEnd) = core.appealPeriod(_coreDisputeID);
         if (block.timestamp < appealPeriodStart || block.timestamp >= appealPeriodEnd) revert NotAppealPeriod();
@@ -425,7 +421,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
 
             if (core.isDisputeKitJumping(_coreDisputeID)) {
                 // Don't create a new round in case of a jump, and remove local dispute from the flow.
-                dispute.jumped = true;
+                coreDisputeIDToActive[_coreDisputeID].currentRound = false;
             } else {
                 // Don't subtract 1 from length since both round arrays haven't been updated yet.
                 dispute.coreRoundIDToLocal[coreRoundID + 1] = dispute.rounds.length;
@@ -441,48 +437,50 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
 
     /// @notice Allows those contributors who attempted to fund an appeal round to withdraw any reimbursable fees or rewards after the dispute gets resolved.
     /// @dev Withdrawals are not possible if the core contract is paused.
+    /// @dev It can be called after the dispute has jumped to another dispute kit.
     /// @param _coreDisputeID Index of the dispute in Kleros Core contract.
     /// @param _beneficiary The address whose rewards to withdraw.
-    /// @param _coreRoundID The round in the Kleros Core contract the caller wants to withdraw from.
     /// @param _choice The ruling option that the caller wants to withdraw from.
     /// @return amount The withdrawn amount.
     function withdrawFeesAndRewards(
         uint256 _coreDisputeID,
         address payable _beneficiary,
-        uint256 _coreRoundID,
         uint256 _choice
     ) external returns (uint256 amount) {
         (, , , bool isRuled, ) = core.disputes(_coreDisputeID);
         if (!isRuled) revert DisputeNotResolved();
         if (core.paused()) revert CoreIsPaused();
-        if (!coreDisputeIDToActive[_coreDisputeID]) revert NotActiveForCoreDisputeID();
+        if (!coreDisputeIDToActive[_coreDisputeID].dispute) revert DisputeUnknownInThisDisputeKit();
 
         Dispute storage dispute = disputes[coreDisputeIDToLocal[_coreDisputeID]];
-        Round storage round = dispute.rounds[dispute.coreRoundIDToLocal[_coreRoundID]];
         (uint256 finalRuling, , ) = core.currentRuling(_coreDisputeID);
 
-        if (!round.hasPaid[_choice]) {
-            // Allow to reimburse if funding was unsuccessful for this ruling option.
-            amount = round.contributions[_beneficiary][_choice];
-        } else {
-            // Funding was successful for this ruling option.
-            if (_choice == finalRuling) {
-                // This ruling option is the ultimate winner.
-                amount = round.paidFees[_choice] > 0
-                    ? (round.contributions[_beneficiary][_choice] * round.feeRewards) / round.paidFees[_choice]
-                    : 0;
-            } else if (!round.hasPaid[finalRuling]) {
-                // The ultimate winner was not funded in this round. In this case funded ruling option(s) are reimbursed.
-                amount =
-                    (round.contributions[_beneficiary][_choice] * round.feeRewards) /
-                    (round.paidFees[round.fundedChoices[0]] + round.paidFees[round.fundedChoices[1]]);
+        for (uint256 i = 0; i < dispute.rounds.length; i++) {
+            Round storage round = dispute.rounds[i];
+
+            if (!round.hasPaid[_choice]) {
+                // Allow to reimburse if funding was unsuccessful for this ruling option.
+                amount += round.contributions[_beneficiary][_choice];
+            } else {
+                // Funding was successful for this ruling option.
+                if (_choice == finalRuling) {
+                    // This ruling option is the ultimate winner.
+                    amount += round.paidFees[_choice] > 0
+                        ? (round.contributions[_beneficiary][_choice] * round.feeRewards) / round.paidFees[_choice]
+                        : 0;
+                } else if (!round.hasPaid[finalRuling]) {
+                    // The ultimate winner was not funded in this round. In this case funded ruling option(s) are reimbursed.
+                    amount +=
+                        (round.contributions[_beneficiary][_choice] * round.feeRewards) /
+                        (round.paidFees[round.fundedChoices[0]] + round.paidFees[round.fundedChoices[1]]);
+                }
             }
+            round.contributions[_beneficiary][_choice] = 0;
         }
-        round.contributions[_beneficiary][_choice] = 0;
 
         if (amount != 0) {
             _beneficiary.safeSend(amount, wNative);
-            emit Withdrawal(_coreDisputeID, _coreRoundID, _choice, _beneficiary, amount);
+            emit Withdrawal(_coreDisputeID, _choice, _beneficiary, amount);
         }
     }
 
@@ -756,11 +754,11 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
 
     error OwnerOnly();
     error KlerosCoreOnly();
-    error DisputeJumpedToParentDK();
+    error DisputeJumpedToAnotherDisputeKit();
+    error DisputeUnknownInThisDisputeKit();
     error UnsuccessfulCall();
     error NotCommitPeriod();
     error EmptyCommit();
-    error NotActiveForCoreDisputeID();
     error JurorHasToOwnTheVote();
     error NotVotePeriod();
     error EmptyVoteIDs();
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
index dbcde618c..fe53dff92 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
@@ -118,7 +118,7 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
         bytes32 _recoveryCommit,
         bytes32 _identity,
         bytes calldata _encryptedVote
-    ) external notJumped(_coreDisputeID) {
+    ) external isActive(_coreDisputeID) {
         if (_recoveryCommit == bytes32(0)) revert EmptyRecoveryCommit();
 
         uint256 localDisputeID = coreDisputeIDToLocal[_coreDisputeID];
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol b/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
index 0ea8bdb41..47ff78166 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
@@ -102,7 +102,7 @@ contract DisputeKitShutter is DisputeKitClassicBase {
         bytes32 _recoveryCommit,
         bytes32 _identity,
         bytes calldata _encryptedVote
-    ) external notJumped(_coreDisputeID) {
+    ) external isActive(_coreDisputeID) {
         if (_recoveryCommit == bytes32(0)) revert EmptyRecoveryCommit();
 
         uint256 localDisputeID = coreDisputeIDToLocal[_coreDisputeID];
diff --git a/contracts/src/arbitration/interfaces/IDisputeKit.sol b/contracts/src/arbitration/interfaces/IDisputeKit.sol
index 20e42a0d2..88467d83f 100644
--- a/contracts/src/arbitration/interfaces/IDisputeKit.sol
+++ b/contracts/src/arbitration/interfaces/IDisputeKit.sol
@@ -32,6 +32,7 @@ interface IDisputeKit {
 
     /// @notice Creates a local dispute and maps it to the dispute ID in the Core contract.
     /// @dev Access restricted to Kleros Core only.
+    /// @dev The new `KlerosCore.Round` must be created before calling this function.
     /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
     /// @param _numberOfChoices Number of choices of the dispute
     /// @param _extraData Additional info about the dispute, for possible use in future dispute kits.
diff --git a/contracts/test/foundry/KlerosCore_Appeals.t.sol b/contracts/test/foundry/KlerosCore_Appeals.t.sol
index 295128d37..c14ccfb43 100644
--- a/contracts/test/foundry/KlerosCore_Appeals.t.sol
+++ b/contracts/test/foundry/KlerosCore_Appeals.t.sol
@@ -298,8 +298,8 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
         vm.prank(crowdfunder2);
         newDisputeKit.fundAppeal{value: 0.42 ether}(disputeID, 2);
 
-        (, bool jumped, ) = newDisputeKit.disputes(disputeID);
-        assertEq(jumped, true, "jumped should be true");
+        (, bool currentRound) = newDisputeKit.coreDisputeIDToActive(disputeID);
+        assertEq(currentRound, false, "round should be jumped");
         assertEq(
             (newDisputeKit.getFundedChoices(disputeID)).length,
             2,
@@ -312,12 +312,12 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
         (uint96 courtID, , , , ) = core.disputes(disputeID);
         assertEq(courtID, GENERAL_COURT, "Wrong court ID");
 
-        (, jumped, ) = disputeKit.disputes(disputeID);
-        assertEq(jumped, false, "jumped should be false in the DK that dispute jumped to");
+        (, currentRound) = disputeKit.coreDisputeIDToActive(disputeID);
+        assertEq(currentRound, true, "round should be active in the DK that dispute jumped to");
 
         // Check jump modifier
         vm.prank(address(core));
-        vm.expectRevert(DisputeKitClassicBase.DisputeJumpedToParentDK.selector);
+        vm.expectRevert(DisputeKitClassicBase.DisputeJumpedToAnotherDisputeKit.selector);
         newDisputeKit.draw(disputeID, 1);
 
         // And check that draw in the new round works
@@ -436,8 +436,8 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
         vm.prank(crowdfunder2);
         disputeKit3.fundAppeal{value: 0.42 ether}(disputeID, 2);
 
-        (, bool jumped, ) = disputeKit3.disputes(disputeID);
-        assertEq(jumped, true, "jumped should be true");
+        (, bool currentRound) = disputeKit3.coreDisputeIDToActive(disputeID);
+        assertEq(currentRound, false, "round should be jumped");
         assertEq(
             (disputeKit3.getFundedChoices(disputeID)).length,
             2,
@@ -450,12 +450,12 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
         (uint96 courtID, , , , ) = core.disputes(disputeID);
         assertEq(courtID, GENERAL_COURT, "Wrong court ID");
 
-        (, jumped, ) = disputeKit2.disputes(disputeID);
-        assertEq(jumped, false, "jumped should be false in the DK that dispute jumped to");
+        (, currentRound) = disputeKit2.coreDisputeIDToActive(disputeID);
+        assertEq(currentRound, true, "round should be active in the DK that dispute jumped to");
 
         // Check jump modifier
         vm.prank(address(core));
-        vm.expectRevert(DisputeKitClassicBase.DisputeJumpedToParentDK.selector);
+        vm.expectRevert(DisputeKitClassicBase.DisputeJumpedToAnotherDisputeKit.selector);
         disputeKit3.draw(disputeID, 1);
 
         // And check that draw in the new round works
@@ -578,14 +578,14 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
         KlerosCore.Round memory round = core.getRoundInfo(disputeID, 0);
         assertEq(round.disputeKitID, dkID3, "Wrong DK ID");
 
-        assertEq(disputeKit3.coreDisputeIDToActive(disputeID), true, "Should be true for dk3");
         assertEq(disputeKit3.coreDisputeIDToLocal(disputeID), 0, "Wrong local dispute ID to core dispute ID");
         assertEq(disputeKit3.getNumberOfRounds(0), 1, "Wrong number of rounds dk3"); // local dispute id
         (, uint256 localRoundID) = disputeKit3.getLocalDisputeRoundID(disputeID, 0);
         assertEq(localRoundID, 0, "Wrong local round ID dk3");
 
-        (, bool jumped, ) = disputeKit3.disputes(0);
-        assertEq(jumped, false, "jumped should be false in dk3");
+        (bool disputeActive, bool currentRound) = disputeKit3.coreDisputeIDToActive(0);
+        assertEq(disputeActive, true, "dispute should be active for dk3");
+        assertEq(currentRound, true, "round should be active in dk3");
 
         core.draw(disputeID, DEFAULT_NB_OF_JURORS);
         vm.warp(block.timestamp + timesPerPeriod[0]);
@@ -621,15 +621,14 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
 
         // Round2 //
 
-        (, jumped, ) = disputeKit3.disputes(0);
-        assertEq(jumped, true, "jumped should be true in dk3");
+        (disputeActive, currentRound) = disputeKit3.coreDisputeIDToActive(0);
+        assertEq(disputeActive, true, "dispute should still be active for dk3");
+        assertEq(currentRound, false, "round should be jumped in dk3");
         assertEq(
             (disputeKit3.getFundedChoices(disputeID)).length,
             2,
             "No fresh round created so the number of funded choices should be 2"
         );
-
-        assertEq(disputeKit3.coreDisputeIDToActive(disputeID), true, "Should still be true for dk3");
         assertEq(disputeKit3.coreDisputeIDToLocal(disputeID), 0, "core to local ID should not change for dk3");
         assertEq(disputeKit3.getNumberOfRounds(0), 1, "Wrong number of rounds dk3"); // local dispute id
         (, localRoundID) = disputeKit3.getLocalDisputeRoundID(disputeID, 0);
@@ -641,17 +640,16 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
         (uint96 courtID, , , , ) = core.disputes(disputeID);
         assertEq(courtID, courtID2, "Wrong court ID after jump");
 
-        (, jumped, ) = disputeKit2.disputes(0);
-        assertEq(jumped, false, "jumped should be false in the DK that dispute jumped to");
-
-        assertEq(disputeKit2.coreDisputeIDToActive(disputeID), true, "Should be true for dk2");
+        (disputeActive, currentRound) = disputeKit2.coreDisputeIDToActive(0);
+        assertEq(disputeActive, true, "dispute should be active for dk2");
+        assertEq(currentRound, true, "round should be active in the DK that dispute jumped to");
         assertEq(disputeKit2.coreDisputeIDToLocal(disputeID), 0, "Wrong local dispute ID to core dispute ID dk2");
         assertEq(disputeKit2.getNumberOfRounds(0), 1, "Wrong number of rounds dk2"); // local dispute id
         (, localRoundID) = disputeKit2.getLocalDisputeRoundID(disputeID, 1);
         assertEq(localRoundID, 0, "Wrong local round ID for dk2");
 
         vm.prank(address(core));
-        vm.expectRevert(DisputeKitClassicBase.DisputeJumpedToParentDK.selector);
+        vm.expectRevert(DisputeKitClassicBase.DisputeJumpedToAnotherDisputeKit.selector);
         disputeKit3.draw(disputeID, 1);
 
         core.draw(disputeID, 7); // New round requires 7 jurors
@@ -664,7 +662,7 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
         }
 
         vm.prank(staker1);
-        vm.expectRevert(DisputeKitClassicBase.DisputeJumpedToParentDK.selector);
+        vm.expectRevert(DisputeKitClassicBase.DisputeJumpedToAnotherDisputeKit.selector);
         disputeKit3.castVote(disputeID, voteIDs, 2, 0, "XYZ");
 
         vm.prank(staker1);
@@ -673,7 +671,7 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
         core.passPeriod(disputeID); // Appeal
 
         vm.prank(crowdfunder1);
-        vm.expectRevert(DisputeKitClassicBase.DisputeJumpedToParentDK.selector);
+        vm.expectRevert(DisputeKitClassicBase.DisputeJumpedToAnotherDisputeKit.selector);
         disputeKit3.fundAppeal{value: 1.35 ether}(disputeID, 1);
 
         assertEq(core.isDisputeKitJumping(disputeID), true, "Should be jumping");
@@ -691,8 +689,9 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
 
         // Round3 //
 
-        (, jumped, ) = disputeKit2.disputes(0);
-        assertEq(jumped, true, "jumped should be true in dk2");
+        (disputeActive, currentRound) = disputeKit2.coreDisputeIDToActive(0);
+        assertEq(disputeActive, true, "dispute should still be active for dk2");
+        assertEq(currentRound, false, "round should be jumped in dk2");
         assertEq(
             (disputeKit2.getFundedChoices(disputeID)).length,
             2,
@@ -703,8 +702,6 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
             0,
             "Should be 0 funded choices in dk3 because fresh round"
         );
-
-        assertEq(disputeKit3.coreDisputeIDToActive(disputeID), true, "Should be true for dk3 round3");
         assertEq(disputeKit3.coreDisputeIDToLocal(disputeID), 0, "core to local ID should stay the same for dk3");
         assertEq(disputeKit3.getNumberOfRounds(0), 2, "Wrong number of rounds dk3 round3"); // local dispute id
         (, localRoundID) = disputeKit3.getLocalDisputeRoundID(disputeID, 2);
@@ -716,10 +713,10 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
         (courtID, , , , ) = core.disputes(disputeID);
         assertEq(courtID, GENERAL_COURT, "Wrong court ID after jump");
 
-        (, jumped, ) = disputeKit3.disputes(0); // local dispute id
-        assertEq(jumped, false, "jumped should be false in the DK that dispute jumped to");
+        (disputeActive, currentRound) = disputeKit3.coreDisputeIDToActive(0); // local dispute id
+        assertEq(disputeActive, true, "dispute should still be active for dk3");
+        assertEq(currentRound, true, "round should be active in the DK that dispute jumped to");
 
-        assertEq(disputeKit2.coreDisputeIDToActive(disputeID), true, "Should be true for dk2 round3");
         assertEq(
             disputeKit2.coreDisputeIDToLocal(disputeID),
             0,
@@ -730,7 +727,7 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
         assertEq(localRoundID, 0, "Wrong local round ID for dk2 round3");
 
         vm.prank(address(core));
-        vm.expectRevert(DisputeKitClassicBase.DisputeJumpedToParentDK.selector);
+        vm.expectRevert(DisputeKitClassicBase.DisputeJumpedToAnotherDisputeKit.selector);
         disputeKit2.draw(disputeID, 1);
 
         core.draw(disputeID, 15); // New round requires 15 jurors
@@ -743,7 +740,7 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
         }
 
         vm.prank(staker1);
-        vm.expectRevert(DisputeKitClassicBase.DisputeJumpedToParentDK.selector);
+        vm.expectRevert(DisputeKitClassicBase.DisputeJumpedToAnotherDisputeKit.selector);
         disputeKit2.castVote(disputeID, voteIDs, 2, 0, "XYZ");
 
         vm.prank(staker1);
@@ -757,39 +754,24 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
 
         core.executeRuling(disputeID); // winning choice is 2
 
-        // Appeal Rewards for Round 1 //
-        disputeKit3.withdrawFeesAndRewards(disputeID, payable(crowdfunder1), 0, 1); // wrong side, no reward
+        // Appeal Rewards //
+        disputeKit3.withdrawFeesAndRewards(disputeID, payable(crowdfunder1), 1); // wrong side, no reward
+
         vm.expectEmit();
-        emit DisputeKitClassicBase.Withdrawal(disputeID, 0, 2, payable(crowdfunder2), 0.84 ether);
-        disputeKit3.withdrawFeesAndRewards(disputeID, payable(crowdfunder2), 0, 2); // REWARDS
-        disputeKit2.withdrawFeesAndRewards(disputeID, payable(crowdfunder1), 0, 1); // wrong DK, no reward
-        disputeKit2.withdrawFeesAndRewards(disputeID, payable(crowdfunder2), 0, 2); // wrong DK, no reward
-        vm.expectRevert(DisputeKitClassicBase.NotActiveForCoreDisputeID.selector);
-        disputeKit.withdrawFeesAndRewards(disputeID, payable(crowdfunder1), 0, 1); // wrong DK, no reward
-        vm.expectRevert(DisputeKitClassicBase.NotActiveForCoreDisputeID.selector);
-        disputeKit.withdrawFeesAndRewards(disputeID, payable(crowdfunder2), 0, 2); // wrong DK, no reward
-
-        // Appeal Rewards for Round 2 //
-        disputeKit3.withdrawFeesAndRewards(disputeID, payable(crowdfunder1), 1, 1); // wrong DK, no reward
-        disputeKit3.withdrawFeesAndRewards(disputeID, payable(crowdfunder2), 1, 2); // wrong DK, no reward
-        disputeKit2.withdrawFeesAndRewards(disputeID, payable(crowdfunder1), 1, 1); // wrong side, no reward
+        emit DisputeKitClassicBase.Withdrawal(disputeID, 2, payable(crowdfunder2), 0.84 ether);
+        disputeKit3.withdrawFeesAndRewards(disputeID, payable(crowdfunder2), 2); // REWARDS
+
+        disputeKit2.withdrawFeesAndRewards(disputeID, payable(crowdfunder1), 1); // wrong DK, no reward
+
         vm.expectEmit();
-        emit DisputeKitClassicBase.Withdrawal(disputeID, 1, 2, payable(crowdfunder2), 1.8 ether);
-        disputeKit2.withdrawFeesAndRewards(disputeID, payable(crowdfunder2), 1, 2); // REWARDS
-        vm.expectRevert(DisputeKitClassicBase.NotActiveForCoreDisputeID.selector);
-        disputeKit.withdrawFeesAndRewards(disputeID, payable(crowdfunder1), 1, 1); // wrong DK, no reward
-        vm.expectRevert(DisputeKitClassicBase.NotActiveForCoreDisputeID.selector);
-        disputeKit.withdrawFeesAndRewards(disputeID, payable(crowdfunder2), 1, 2); // wrong DK, no reward
-
-        // Appeal Rewards for Round 3 //
-        disputeKit3.withdrawFeesAndRewards(disputeID, payable(crowdfunder1), 2, 1); // no appeal, no reward
-        disputeKit3.withdrawFeesAndRewards(disputeID, payable(crowdfunder2), 2, 2); // no appeal, no reward
-        disputeKit2.withdrawFeesAndRewards(disputeID, payable(crowdfunder1), 2, 1); // no appeal, no reward
-        disputeKit2.withdrawFeesAndRewards(disputeID, payable(crowdfunder2), 2, 2); // no appeal, no reward
-        vm.expectRevert(DisputeKitClassicBase.NotActiveForCoreDisputeID.selector);
-        disputeKit.withdrawFeesAndRewards(disputeID, payable(crowdfunder1), 2, 1); // wrong DK, no reward
-        vm.expectRevert(DisputeKitClassicBase.NotActiveForCoreDisputeID.selector);
-        disputeKit.withdrawFeesAndRewards(disputeID, payable(crowdfunder2), 2, 2); // wrong DK, no reward
+        emit DisputeKitClassicBase.Withdrawal(disputeID, 2, payable(crowdfunder2), 1.8 ether);
+        disputeKit2.withdrawFeesAndRewards(disputeID, payable(crowdfunder2), 2); // REWARDS
+
+        vm.expectRevert(DisputeKitClassicBase.DisputeUnknownInThisDisputeKit.selector);
+        disputeKit.withdrawFeesAndRewards(disputeID, payable(crowdfunder1), 1); // wrong DK, no reward
+
+        vm.expectRevert(DisputeKitClassicBase.DisputeUnknownInThisDisputeKit.selector);
+        disputeKit.withdrawFeesAndRewards(disputeID, payable(crowdfunder2), 2); // wrong DK, no reward
     }
 
     function test_appeal_quickPassPeriod() public {
@@ -841,7 +823,7 @@ contract KlerosCore_AppealsTest is KlerosCore_TestBase {
         vm.prank(disputer);
         arbitrable.createDispute{value: feeForJuror * DEFAULT_NB_OF_JURORS}("Action");
 
-        (uint256 numberOfChoices, , ) = disputeKit.disputes(disputeID);
+        (uint256 numberOfChoices, ) = disputeKit.disputes(disputeID);
 
         assertEq(numberOfChoices, numberOfOptions, "Wrong numberOfChoices");
 
diff --git a/contracts/test/foundry/KlerosCore_Disputes.t.sol b/contracts/test/foundry/KlerosCore_Disputes.t.sol
index 2d029ddcf..93c4c0757 100644
--- a/contracts/test/foundry/KlerosCore_Disputes.t.sol
+++ b/contracts/test/foundry/KlerosCore_Disputes.t.sol
@@ -88,13 +88,15 @@ contract KlerosCore_DisputesTest is KlerosCore_TestBase {
         assertEq(address(round.feeToken), address(0), "feeToken should be 0");
         assertEq(round.drawIterations, 0, "drawIterations should be 0");
 
-        (uint256 numberOfChoices, bool jumped, bytes memory extraData) = disputeKit.disputes(disputeID);
-
+        (uint256 numberOfChoices, bytes memory extraData) = disputeKit.disputes(disputeID);
         assertEq(numberOfChoices, 2, "Wrong numberOfChoices");
-        assertEq(jumped, false, "jumped should be false");
         assertEq(extraData, newExtraData, "Wrong extra data");
+
+        (bool dispute, bool currentRound) = disputeKit.coreDisputeIDToActive(0);
+        assertEq(dispute, true, "Dispute should be active in this DK");
+        assertEq(currentRound, true, "Current round should be active in this DK");
+
         assertEq(disputeKit.coreDisputeIDToLocal(0), disputeID, "Wrong local disputeID");
-        assertEq(disputeKit.coreDisputeIDToActive(0), true, "Dispute should be active in this DK");
 
         (
             uint256 winningChoice,
diff --git a/contracts/test/foundry/KlerosCore_Execution.t.sol b/contracts/test/foundry/KlerosCore_Execution.t.sol
index bbce3234a..81dd723a0 100644
--- a/contracts/test/foundry/KlerosCore_Execution.t.sol
+++ b/contracts/test/foundry/KlerosCore_Execution.t.sol
@@ -721,14 +721,14 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
         core.passPeriod(disputeID); // Execution
 
         vm.expectRevert(DisputeKitClassicBase.DisputeNotResolved.selector);
-        disputeKit.withdrawFeesAndRewards(disputeID, payable(staker1), 0, 1);
+        disputeKit.withdrawFeesAndRewards(disputeID, payable(staker1), 1);
 
         core.executeRuling(disputeID);
 
         vm.prank(owner);
         core.pause();
         vm.expectRevert(DisputeKitClassicBase.CoreIsPaused.selector);
-        disputeKit.withdrawFeesAndRewards(disputeID, payable(staker1), 0, 1);
+        disputeKit.withdrawFeesAndRewards(disputeID, payable(staker1), 1);
         vm.prank(owner);
         core.unpause();
 
@@ -737,12 +737,12 @@ contract KlerosCore_ExecutionTest is KlerosCore_TestBase {
         assertEq(address(disputeKit).balance, 1.04 ether, "Wrong balance of the DK");
 
         vm.expectEmit(true, true, true, true);
-        emit DisputeKitClassicBase.Withdrawal(disputeID, 0, 1, crowdfunder1, 0.63 ether);
-        disputeKit.withdrawFeesAndRewards(disputeID, payable(crowdfunder1), 0, 1);
+        emit DisputeKitClassicBase.Withdrawal(disputeID, 1, crowdfunder1, 0.63 ether);
+        disputeKit.withdrawFeesAndRewards(disputeID, payable(crowdfunder1), 1);
 
         vm.expectEmit(true, true, true, true);
-        emit DisputeKitClassicBase.Withdrawal(disputeID, 0, 2, crowdfunder2, 0.41 ether);
-        disputeKit.withdrawFeesAndRewards(disputeID, payable(crowdfunder2), 0, 2);
+        emit DisputeKitClassicBase.Withdrawal(disputeID, 2, crowdfunder2, 0.41 ether);
+        disputeKit.withdrawFeesAndRewards(disputeID, payable(crowdfunder2), 2);
 
         assertEq(crowdfunder1.balance, 10 ether, "Wrong balance of the crowdfunder1");
         assertEq(crowdfunder2.balance, 10 ether, "Wrong balance of the crowdfunder2");
diff --git a/contracts/test/foundry/KlerosCore_Voting.t.sol b/contracts/test/foundry/KlerosCore_Voting.t.sol
index 961d0741d..689df3a7d 100644
--- a/contracts/test/foundry/KlerosCore_Voting.t.sol
+++ b/contracts/test/foundry/KlerosCore_Voting.t.sol
@@ -456,13 +456,14 @@ contract KlerosCore_VotingTest is KlerosCore_TestBase {
         core.passPeriod(disputeID); // Vote
 
         // Check that the new DK has the info but not the old one.
-
-        assertEq(disputeKit.coreDisputeIDToActive(disputeID), false, "Should be false for old DK");
+        (bool disputeActive, ) = disputeKit.coreDisputeIDToActive(disputeID);
+        assertEq(disputeActive, false, "Should be false for old DK");
 
         // This is the DK where dispute was created. Core dispute points to index 1 because new DK has two disputes.
+        (disputeActive, ) = newDisputeKit.coreDisputeIDToActive(disputeID);
+        assertEq(disputeActive, true, "Should be active for new DK");
         assertEq(newDisputeKit.coreDisputeIDToLocal(disputeID), 1, "Wrong local dispute ID for new DK");
-        assertEq(newDisputeKit.coreDisputeIDToActive(disputeID), true, "Should be active for new DK");
-        (uint256 numberOfChoices, , bytes memory extraData) = newDisputeKit.disputes(1);
+        (uint256 numberOfChoices, bytes memory extraData) = newDisputeKit.disputes(1);
         assertEq(numberOfChoices, 2, "Wrong numberOfChoices in new DK");
         assertEq(extraData, newExtraData, "Wrong extra data");
 
@@ -473,7 +474,7 @@ contract KlerosCore_VotingTest is KlerosCore_TestBase {
 
         // Deliberately cast votes using the old DK to see if the exception will be caught.
         vm.prank(staker1);
-        vm.expectRevert(DisputeKitClassicBase.NotActiveForCoreDisputeID.selector);
+        vm.expectRevert(DisputeKitClassicBase.DisputeUnknownInThisDisputeKit.selector);
         disputeKit.castVote(disputeID, voteIDs, 2, 0, "XYZ");
 
         // And check the new DK.

From f9fd9445b8cf2ff7b5f547d8751f2a6bfb6b5f0c Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Tue, 14 Oct 2025 15:38:50 +0100
Subject: [PATCH 162/175] fix: removed unnecessary isActive modifier on the
 shutter DKs

---
 .../src/arbitration/dispute-kits/DisputeKitGatedShutter.sol   | 4 ++--
 contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol  | 4 ++--
 2 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
index fe53dff92..a4ec2f8dc 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
@@ -118,7 +118,7 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
         bytes32 _recoveryCommit,
         bytes32 _identity,
         bytes calldata _encryptedVote
-    ) external isActive(_coreDisputeID) {
+    ) external {
         if (_recoveryCommit == bytes32(0)) revert EmptyRecoveryCommit();
 
         uint256 localDisputeID = coreDisputeIDToLocal[_coreDisputeID];
@@ -128,7 +128,7 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
             recoveryCommitments[localDisputeID][localRoundID][_voteIDs[i]] = _recoveryCommit;
         }
 
-        // `_castCommit()` ensures that the caller owns the vote
+        // `_castCommit()` ensures that the caller owns the vote and that dispute is active
         _castCommit(_coreDisputeID, _voteIDs, _commit);
         emit CommitCastShutter(_coreDisputeID, msg.sender, _commit, _recoveryCommit, _identity, _encryptedVote);
     }
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol b/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
index 47ff78166..fe2c0eb7b 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
@@ -102,7 +102,7 @@ contract DisputeKitShutter is DisputeKitClassicBase {
         bytes32 _recoveryCommit,
         bytes32 _identity,
         bytes calldata _encryptedVote
-    ) external isActive(_coreDisputeID) {
+    ) external {
         if (_recoveryCommit == bytes32(0)) revert EmptyRecoveryCommit();
 
         uint256 localDisputeID = coreDisputeIDToLocal[_coreDisputeID];
@@ -112,7 +112,7 @@ contract DisputeKitShutter is DisputeKitClassicBase {
             recoveryCommitments[localDisputeID][localRoundID][_voteIDs[i]] = _recoveryCommit;
         }
 
-        // `_castCommit()` ensures that the caller owns the vote
+        // `_castCommit()` ensures that the caller owns the vote and that dispute is active
         _castCommit(_coreDisputeID, _voteIDs, _commit);
         emit CommitCastShutter(_coreDisputeID, msg.sender, _commit, _recoveryCommit, _identity, _encryptedVote);
     }

From 6b7e3655814a4d4c31e37f8f88594f976c4c3195 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Tue, 14 Oct 2025 16:19:13 +0100
Subject: [PATCH 163/175] feat: removed an external call to Core in
 DK.createDispute()

---
 contracts/src/arbitration/KlerosCore.sol                  | 8 +++++---
 .../arbitration/dispute-kits/DisputeKitClassicBase.sol    | 3 ++-
 contracts/src/arbitration/interfaces/IDisputeKit.sol      | 2 ++
 .../src/arbitration/university/KlerosCoreUniversity.sol   | 8 +++++---
 contracts/test/arbitration/index.ts                       | 2 +-
 5 files changed, 15 insertions(+), 8 deletions(-)

diff --git a/contracts/src/arbitration/KlerosCore.sol b/contracts/src/arbitration/KlerosCore.sol
index 8030db65b..cd0741a65 100644
--- a/contracts/src/arbitration/KlerosCore.sol
+++ b/contracts/src/arbitration/KlerosCore.sol
@@ -683,7 +683,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
 
         sortitionModule.createDisputeHook(disputeID, 0); // Default round ID.
 
-        disputeKit.createDispute(disputeID, _numberOfChoices, _extraData, round.nbVotes);
+        disputeKit.createDispute(disputeID, 0, _numberOfChoices, _extraData, round.nbVotes);
         emit DisputeCreation(disputeID, IArbitrableV2(msg.sender));
     }
 
@@ -782,6 +782,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
 
         // Warning: the extra round must be created before calling disputeKit.createDispute()
         Round storage extraRound = dispute.rounds.push();
+        uint256 extraRoundID = dispute.rounds.length - 1;
 
         (uint96 newCourtID, uint256 newDisputeKitID, bool courtJump, ) = _getCourtAndDisputeKitJumps(
             dispute,
@@ -790,7 +791,7 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
             _disputeID
         );
         if (courtJump) {
-            emit CourtJump(_disputeID, dispute.rounds.length - 1, dispute.courtID, newCourtID);
+            emit CourtJump(_disputeID, extraRoundID, dispute.courtID, newCourtID);
         }
 
         dispute.courtID = newCourtID;
@@ -803,13 +804,14 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
         extraRound.totalFeesForJurors = msg.value;
         extraRound.disputeKitID = newDisputeKitID;
 
-        sortitionModule.createDisputeHook(_disputeID, dispute.rounds.length - 1);
+        sortitionModule.createDisputeHook(_disputeID, extraRoundID);
 
         // Dispute kit was changed, so create a dispute in the new DK contract.
         if (extraRound.disputeKitID != round.disputeKitID) {
             emit DisputeKitJump(_disputeID, dispute.rounds.length - 1, round.disputeKitID, extraRound.disputeKitID);
             disputeKits[extraRound.disputeKitID].createDispute(
                 _disputeID,
+                extraRoundID,
                 _numberOfChoices,
                 _extraData,
                 extraRound.nbVotes
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index 859b3b0f5..7bd0ccebe 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -200,6 +200,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     /// @inheritdoc IDisputeKit
     function createDispute(
         uint256 _coreDisputeID,
+        uint256 _coreRoundID,
         uint256 _numberOfChoices,
         bytes calldata _extraData,
         uint256 /*_nbVotes*/
@@ -224,7 +225,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         dispute.extraData = _extraData;
 
         // KlerosCore.Round must have been already created.
-        dispute.coreRoundIDToLocal[core.getNumberOfRounds(_coreDisputeID) - 1] = dispute.rounds.length;
+        dispute.coreRoundIDToLocal[_coreRoundID] = dispute.rounds.length;
         dispute.rounds.push().tied = true;
 
         emit DisputeCreation(_coreDisputeID, _numberOfChoices, _extraData);
diff --git a/contracts/src/arbitration/interfaces/IDisputeKit.sol b/contracts/src/arbitration/interfaces/IDisputeKit.sol
index 88467d83f..f5de3d8ec 100644
--- a/contracts/src/arbitration/interfaces/IDisputeKit.sol
+++ b/contracts/src/arbitration/interfaces/IDisputeKit.sol
@@ -34,11 +34,13 @@ interface IDisputeKit {
     /// @dev Access restricted to Kleros Core only.
     /// @dev The new `KlerosCore.Round` must be created before calling this function.
     /// @param _coreDisputeID The ID of the dispute in Kleros Core, not in the Dispute Kit.
+    /// @param _coreRoundID The ID of the round in Kleros Core, not in the Dispute Kit.
     /// @param _numberOfChoices Number of choices of the dispute
     /// @param _extraData Additional info about the dispute, for possible use in future dispute kits.
     /// @param _nbVotes Maximal number of votes this dispute can get. Added for future-proofing.
     function createDispute(
         uint256 _coreDisputeID,
+        uint256 _coreRoundID,
         uint256 _numberOfChoices,
         bytes calldata _extraData,
         uint256 _nbVotes
diff --git a/contracts/src/arbitration/university/KlerosCoreUniversity.sol b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
index 37098d7e1..43a63d9f9 100644
--- a/contracts/src/arbitration/university/KlerosCoreUniversity.sol
+++ b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
@@ -531,7 +531,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
 
         sortitionModule.createDisputeHook(disputeID, 0); // Default round ID.
 
-        disputeKit.createDispute(disputeID, _numberOfChoices, _extraData, round.nbVotes);
+        disputeKit.createDispute(disputeID, 0, _numberOfChoices, _extraData, round.nbVotes);
         emit DisputeCreation(disputeID, IArbitrableV2(msg.sender));
     }
 
@@ -634,6 +634,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
 
         // Warning: the extra round must be created before calling disputeKit.createDispute()
         Round storage extraRound = dispute.rounds.push();
+        uint256 extraRoundID = dispute.rounds.length - 1;
 
         if (round.nbVotes >= courts[newCourtID].jurorsForCourtJump) {
             // Jump to parent court.
@@ -645,7 +646,7 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
             }
 
             if (newCourtID != dispute.courtID) {
-                emit CourtJump(_disputeID, dispute.rounds.length - 1, dispute.courtID, newCourtID);
+                emit CourtJump(_disputeID, extraRoundID, dispute.courtID, newCourtID);
             }
         }
 
@@ -659,13 +660,14 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
         extraRound.totalFeesForJurors = msg.value;
         extraRound.disputeKitID = newDisputeKitID;
 
-        sortitionModule.createDisputeHook(_disputeID, dispute.rounds.length - 1);
+        sortitionModule.createDisputeHook(_disputeID, extraRoundID);
 
         // Dispute kit was changed, so create a dispute in the new DK contract.
         if (extraRound.disputeKitID != round.disputeKitID) {
             emit DisputeKitJump(_disputeID, dispute.rounds.length - 1, round.disputeKitID, extraRound.disputeKitID);
             disputeKits[extraRound.disputeKitID].createDispute(
                 _disputeID,
+                extraRoundID,
                 _numberOfChoices,
                 _extraData,
                 extraRound.nbVotes
diff --git a/contracts/test/arbitration/index.ts b/contracts/test/arbitration/index.ts
index 127fa2500..be13e1e0c 100644
--- a/contracts/test/arbitration/index.ts
+++ b/contracts/test/arbitration/index.ts
@@ -74,7 +74,7 @@ describe("DisputeKitClassic", async () => {
 
   it("Should create a dispute", async () => {
     await expect(
-      disputeKit.connect(deployer).createDispute(0, 0, ethers.toBeHex(3), "0x00")
+      disputeKit.connect(deployer).createDispute(0, 0, 0, ethers.toBeHex(3), "0x00")
     ).to.be.revertedWithCustomError(disputeKit, "KlerosCoreOnly");
 
     const tx = await core

From 5a4653670a4a85b3881d92234f99a2bbe03ce142 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Tue, 14 Oct 2025 17:12:00 +0100
Subject: [PATCH 164/175] fix: token whitelist for DisputeKitGated and
 DisputeKitGatedShutter

---
 .../dispute-kits/DisputeKitClassicBase.sol    |  2 +-
 .../dispute-kits/DisputeKitGated.sol          | 42 ++++++++++++++++++-
 .../dispute-kits/DisputeKitGatedShutter.sol   | 30 ++++++++++++-
 .../test/arbitration/dispute-kit-gated.ts     | 22 ++++++++--
 4 files changed, 88 insertions(+), 8 deletions(-)

diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index 7bd0ccebe..fa8548a6b 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -204,7 +204,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         uint256 _numberOfChoices,
         bytes calldata _extraData,
         uint256 /*_nbVotes*/
-    ) external override onlyByCore {
+    ) public virtual override onlyByCore {
         uint256 localDisputeID;
         Dispute storage dispute;
         Active storage active = coreDisputeIDToActive[_coreDisputeID];
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol b/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol
index 309f5c566..d41287b26 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol
@@ -29,6 +29,12 @@ interface IBalanceHolderERC1155 {
 contract DisputeKitGated is DisputeKitClassicBase {
     string public constant override version = "2.0.0";
 
+    // ************************************* //
+    // *             Storage               * //
+    // ************************************* //
+
+    mapping(address token => bool supported) public supportedTokens; // Whether the token is supported or not.
+
     // ************************************* //
     // *            Constructor            * //
     // ************************************* //
@@ -62,6 +68,34 @@ contract DisputeKitGated is DisputeKitClassicBase {
         // NOP
     }
 
+    /// @notice Changes the supported tokens.
+    /// @param _tokens The tokens to support.
+    /// @param _supported Whether the tokens are supported or not.
+    function changeSupportedTokens(address[] memory _tokens, bool _supported) external onlyByOwner {
+        for (uint256 i = 0; i < _tokens.length; i++) {
+            supportedTokens[_tokens[i]] = _supported;
+        }
+    }
+
+    // ************************************* //
+    // *         State Modifiers           * //
+    // ************************************* //
+
+    /// @inheritdoc DisputeKitClassicBase
+    function createDispute(
+        uint256 _coreDisputeID,
+        uint256 _coreRoundID,
+        uint256 _numberOfChoices,
+        bytes calldata _extraData,
+        uint256 _nbVotes
+    ) public override {
+        (address tokenGate, , ) = _extraDataToTokenInfo(_extraData);
+        if (!supportedTokens[tokenGate]) revert TokenNotSupported(tokenGate);
+
+        // super.createDispute() ensures access control onlyByCore.
+        super.createDispute(_coreDisputeID, _coreRoundID, _numberOfChoices, _extraData, _nbVotes);
+    }
+
     // ************************************* //
     // *            Internal               * //
     // ************************************* //
@@ -78,7 +112,7 @@ contract DisputeKitGated is DisputeKitClassicBase {
     /// @return tokenId The token ID for ERC-1155 tokens (ignored for ERC-20/ERC-721).
     function _extraDataToTokenInfo(
         bytes memory _extraData
-    ) public pure returns (address tokenGate, bool isERC1155, uint256 tokenId) {
+    ) internal pure returns (address tokenGate, bool isERC1155, uint256 tokenId) {
         // Need at least 160 bytes to safely read the parameters
         if (_extraData.length < 160) return (address(0), false, 0);
 
@@ -116,4 +150,10 @@ contract DisputeKitGated is DisputeKitClassicBase {
             return IBalanceHolder(tokenGate).balanceOf(_juror) > 0;
         }
     }
+
+    // ************************************* //
+    // *              Errors               * //
+    // ************************************* //
+
+    error TokenNotSupported(address tokenGate);
 }
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
index a4ec2f8dc..dd8bc7eae 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
@@ -34,6 +34,7 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
     // *             Storage               * //
     // ************************************* //
 
+    mapping(address token => bool supported) public supportedTokens; // Whether the token is supported or not.
     mapping(uint256 localDisputeID => mapping(uint256 localRoundID => mapping(uint256 voteID => bytes32 recoveryCommitment)))
         public recoveryCommitments;
 
@@ -96,10 +97,34 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
         // NOP
     }
 
+    /// @notice Changes the supported tokens.
+    /// @param _tokens The tokens to support.
+    /// @param _supported Whether the tokens are supported or not.
+    function changeSupportedTokens(address[] memory _tokens, bool _supported) external onlyByOwner {
+        for (uint256 i = 0; i < _tokens.length; i++) {
+            supportedTokens[_tokens[i]] = _supported;
+        }
+    }
+
     // ************************************* //
     // *         State Modifiers           * //
     // ************************************* //
 
+    /// @inheritdoc DisputeKitClassicBase
+    function createDispute(
+        uint256 _coreDisputeID,
+        uint256 _coreRoundID,
+        uint256 _numberOfChoices,
+        bytes calldata _extraData,
+        uint256 _nbVotes
+    ) public override {
+        (address tokenGate, , ) = _extraDataToTokenInfo(_extraData);
+        if (!supportedTokens[tokenGate]) revert TokenNotSupported(tokenGate);
+
+        // super.createDispute() ensures access control onlyByCore.
+        super.createDispute(_coreDisputeID, _coreRoundID, _numberOfChoices, _extraData, _nbVotes);
+    }
+
     /// @notice Sets the caller's commit for the specified votes.
     ///
     /// @dev It can be called multiple times during the commit period, each call overrides the commits of the previous one.
@@ -209,7 +234,7 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
     /// @return tokenGate The address of the token contract used for gating access.
     /// @return isERC1155 True if the token is an ERC-1155, false for ERC-20/ERC-721.
     /// @return tokenId The token ID for ERC-1155 tokens (ignored for ERC-20/ERC-721).
-    function __extraDataToTokenInfo(
+    function _extraDataToTokenInfo(
         bytes memory _extraData
     ) internal pure returns (address tokenGate, bool isERC1155, uint256 tokenId) {
         // Need at least 160 bytes to safely read the parameters
@@ -237,7 +262,7 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
         // Get the local dispute and extract token info from extraData
         uint256 localDisputeID = coreDisputeIDToLocal[_coreDisputeID];
         Dispute storage dispute = disputes[localDisputeID];
-        (address tokenGate, bool isERC1155, uint256 tokenId) = __extraDataToTokenInfo(dispute.extraData);
+        (address tokenGate, bool isERC1155, uint256 tokenId) = _extraDataToTokenInfo(dispute.extraData);
 
         // If no token gate is specified, allow all jurors
         if (tokenGate == address(0)) return true;
@@ -254,5 +279,6 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
     // *              Errors               * //
     // ************************************* //
 
+    error TokenNotSupported(address tokenGate);
     error EmptyRecoveryCommit();
 }
diff --git a/contracts/test/arbitration/dispute-kit-gated.ts b/contracts/test/arbitration/dispute-kit-gated.ts
index a6db6e473..5bc6c6bcb 100644
--- a/contracts/test/arbitration/dispute-kit-gated.ts
+++ b/contracts/test/arbitration/dispute-kit-gated.ts
@@ -5,7 +5,7 @@ import {
   KlerosCore,
   SortitionModule,
   IncrementalNG,
-  DisputeKitGated,
+  DisputeKitGatedMock,
   TestERC20,
   TestERC721,
   TestERC1155,
@@ -14,6 +14,7 @@ import { expect } from "chai";
 import { Courts } from "../../deploy/utils";
 import { HardhatEthersSigner } from "@nomicfoundation/hardhat-ethers/signers";
 import { deployERC1155, deployERC721 } from "../../deploy/utils/deployTokens";
+import { deployUpgradable } from "../../deploy/utils/deployUpgradable";
 
 /* eslint-disable no-unused-vars */
 /* eslint-disable no-unused-expressions */ // https://github.com/standard/standard/issues/690#issuecomment-278533482
@@ -26,7 +27,7 @@ describe("DisputeKitGated", async () => {
   let deployer: string;
   let juror1: HardhatEthersSigner;
   let juror2: HardhatEthersSigner;
-  let disputeKitGated: DisputeKitGated;
+  let disputeKitGated: DisputeKitGatedMock;
   let pnk: PNK;
   let dai: TestERC20;
   let core: KlerosCore;
@@ -47,12 +48,25 @@ describe("DisputeKitGated", async () => {
       fallbackToGlobal: true,
       keepExistingDeployments: false,
     });
-    disputeKitGated = await ethers.getContract<DisputeKitGated>("DisputeKitGated");
+
     pnk = await ethers.getContract<PNK>("PNK");
     dai = await ethers.getContract<TestERC20>("DAI");
+    const weth = await ethers.getContract<TestERC20>("WETH");
     core = await ethers.getContract<KlerosCore>("KlerosCore");
     sortitionModule = await ethers.getContract<SortitionModule>("SortitionModule");
 
+    const deploymentResult = await deployUpgradable(deployments, "DisputeKitGatedMock", {
+      from: deployer,
+      proxyAlias: "UUPSProxy",
+      args: [deployer, core.target, weth.target, 1],
+      log: true,
+    });
+    await core.addNewDisputeKit(deploymentResult.address);
+    const disputeKitGatedID = (await core.getDisputeKitsLength()) - 1n;
+    await core.enableDisputeKits(Courts.GENERAL, [disputeKitGatedID], true); // enable disputeKitGated on the General Court
+
+    disputeKitGated = await ethers.getContract<DisputeKitGatedMock>("DisputeKitGatedMock");
+
     // Make the tests more deterministic with this dummy RNG
     await deployments.deploy("IncrementalNG", {
       from: deployer,
@@ -123,7 +137,7 @@ describe("DisputeKitGated", async () => {
     const extraData = encodeExtraData(courtId, minJurors, disputeKitId, tokenGate, isERC1155, tokenId);
     // console.log("extraData", extraData);
 
-    const tokenInfo = await disputeKitGated._extraDataToTokenInfo(extraData);
+    const tokenInfo = await disputeKitGated.extraDataToTokenInfo(extraData);
     expect(tokenInfo[0]).to.equal(tokenGate);
     expect(tokenInfo[1]).to.equal(isERC1155);
     expect(tokenInfo[2]).to.equal(tokenId);

From 87e57590ccbb7b4dbb24716a439f388ddaa9fd4d Mon Sep 17 00:00:00 2001
From: unknownunknown1 <danil@kleros.io>
Date: Wed, 15 Oct 2025 02:28:08 +1000
Subject: [PATCH 165/175] fix(ShutterDK): replace recovery with justification
 commit

---
 .../dispute-kits/DisputeKitClassicBase.sol    |  15 ++
 .../dispute-kits/DisputeKitGatedShutter.sol   |  76 +++-----
 .../dispute-kits/DisputeKitShutter.sol        |  82 ++++----
 .../test/arbitration/dispute-kit-shutter.ts   | 181 +++++++++---------
 4 files changed, 168 insertions(+), 186 deletions(-)

diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index 7bd0ccebe..f92ac2e88 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -341,6 +341,8 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
                 if (round.votes[_voteIDs[i]].account != _juror) revert JurorHasToOwnTheVote();
                 if (hiddenVotes && _getExpectedVoteHash(localDisputeID, localRoundID, _voteIDs[i]) != actualVoteHash)
                     revert HashDoesNotMatchHiddenVoteCommitment();
+                if (!_checkJustification(localDisputeID, localRoundID, _voteIDs[i], _justification, _salt))
+                    revert WrongJustification();
                 if (round.votes[_voteIDs[i]].voted) revert VoteAlreadyCast();
                 round.votes[_voteIDs[i]].choice = _choice;
                 round.votes[_voteIDs[i]].voted = true;
@@ -724,6 +726,18 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         return disputes[_localDisputeID].rounds[_localRoundID].votes[_voteID].commit;
     }
 
+    /// @notice Returns true if submitted justification matches. Only used by specific Dispute Kits (eg Shutter).
+    /// @return Whether justification matches or not.
+    function _checkJustification(
+        uint256 /*_localDisputeID*/,
+        uint256 /*_localRoundID*/,
+        uint256 /*_voteID*/,
+        string memory /*_justification*/,
+        uint256 /*_salt*/
+    ) internal view virtual returns (bool) {
+        return true;
+    }
+
     /// @notice Checks that the chosen address satisfies certain conditions for being drawn.
     ///
     /// @dev No need to check the minStake requirement here because of the implicit staking in parent courts.
@@ -771,4 +785,5 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     error AppealFeeIsAlreadyPaid();
     error DisputeNotResolved();
     error CoreIsPaused();
+    error WrongJustification();
 }
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
index a4ec2f8dc..0c4b066d6 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
@@ -34,8 +34,8 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
     // *             Storage               * //
     // ************************************* //
 
-    mapping(uint256 localDisputeID => mapping(uint256 localRoundID => mapping(uint256 voteID => bytes32 recoveryCommitment)))
-        public recoveryCommitments;
+    mapping(uint256 localDisputeID => mapping(uint256 localRoundID => mapping(uint256 voteID => bytes32 justificationCommitment)))
+        public justificationCommitments;
 
     // ************************************* //
     // *        Transient Storage          * //
@@ -50,15 +50,15 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
     /// @dev Emitted when a vote is cast.
     /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.
     /// @param _juror The address of the juror casting the vote commitment.
-    /// @param _commit The commitment hash.
-    /// @param _recoveryCommit The commitment hash without the justification.
+    /// @param _choiceCommit The commitment hash without the justification.
+    /// @param _justificationCommit The commitment hash for the justification.
     /// @param _identity The Shutter identity used for encryption.
     /// @param _encryptedVote The Shutter encrypted vote.
     event CommitCastShutter(
         uint256 indexed _coreDisputeID,
         address indexed _juror,
-        bytes32 indexed _commit,
-        bytes32 _recoveryCommit,
+        bytes32 indexed _choiceCommit,
+        bytes32 _justificationCommit,
         bytes32 _identity,
         bytes _encryptedVote
     );
@@ -107,30 +107,37 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
     ///
     /// @param _coreDisputeID The ID of the dispute in Kleros Core.
     /// @param _voteIDs The IDs of the votes.
-    /// @param _commit The commitment hash including the justification.
-    /// @param _recoveryCommit The commitment hash without the justification.
+    /// @param _choiceCommit The commitment hash without the justification.
+    /// @param _justificationCommit The commitment hash for justification.
     /// @param _identity The Shutter identity used for encryption.
     /// @param _encryptedVote The Shutter encrypted vote.
     function castCommitShutter(
         uint256 _coreDisputeID,
         uint256[] calldata _voteIDs,
-        bytes32 _commit,
-        bytes32 _recoveryCommit,
+        bytes32 _choiceCommit,
+        bytes32 _justificationCommit,
         bytes32 _identity,
         bytes calldata _encryptedVote
     ) external {
-        if (_recoveryCommit == bytes32(0)) revert EmptyRecoveryCommit();
+        if (_justificationCommit == bytes32(0)) revert EmptyJustificationCommit();
 
         uint256 localDisputeID = coreDisputeIDToLocal[_coreDisputeID];
         Dispute storage dispute = disputes[localDisputeID];
         uint256 localRoundID = dispute.rounds.length - 1;
         for (uint256 i = 0; i < _voteIDs.length; i++) {
-            recoveryCommitments[localDisputeID][localRoundID][_voteIDs[i]] = _recoveryCommit;
+            justificationCommitments[localDisputeID][localRoundID][_voteIDs[i]] = _justificationCommit;
         }
 
         // `_castCommit()` ensures that the caller owns the vote and that dispute is active
-        _castCommit(_coreDisputeID, _voteIDs, _commit);
-        emit CommitCastShutter(_coreDisputeID, msg.sender, _commit, _recoveryCommit, _identity, _encryptedVote);
+        _castCommit(_coreDisputeID, _voteIDs, _choiceCommit);
+        emit CommitCastShutter(
+            _coreDisputeID,
+            msg.sender,
+            _choiceCommit,
+            _justificationCommit,
+            _identity,
+            _encryptedVote
+        );
     }
 
     /// @notice Version of the `castVote` function designed specifically for Shutter.
@@ -158,44 +165,23 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
         callerIsJuror = false;
     }
 
-    // ************************************* //
-    // *           Public Views            * //
-    // ************************************* //
-
-    /// @notice Computes the hash of a vote using ABI encoding
-    /// @param _choice The choice being voted for
-    /// @param _salt A random salt for commitment
-    /// @param _justification The justification for the vote
-    /// @return bytes32 The hash of the encoded vote parameters
-    function hashVote(
-        uint256 _choice,
-        uint256 _salt,
-        string memory _justification
-    ) public view override returns (bytes32) {
-        if (callerIsJuror) {
-            // Caller is the juror, hash without `_justification` to facilitate recovery.
-            return keccak256(abi.encodePacked(_choice, _salt));
-        } else {
-            // Caller is not the juror, hash with `_justification`.
-            bytes32 justificationHash = keccak256(bytes(_justification));
-            return keccak256(abi.encode(_choice, _salt, justificationHash));
-        }
-    }
-
     // ************************************* //
     // *            Internal               * //
     // ************************************* //
 
     /// @inheritdoc DisputeKitClassicBase
-    function _getExpectedVoteHash(
+    function _checkJustification(
         uint256 _localDisputeID,
         uint256 _localRoundID,
-        uint256 _voteID
-    ) internal view override returns (bytes32) {
-        if (callerIsJuror) {
-            return recoveryCommitments[_localDisputeID][_localRoundID][_voteID];
+        uint256 _voteID,
+        string memory _justification,
+        uint256 _salt
+    ) internal view override returns (bool) {
+        if (!callerIsJuror) {
+            bytes32 justificationCommit = justificationCommitments[_localDisputeID][_localRoundID][_voteID];
+            return justificationCommit == keccak256(abi.encode(_salt, keccak256(bytes(_justification))));
         } else {
-            return disputes[_localDisputeID].rounds[_localRoundID].votes[_voteID].commit;
+            return true;
         }
     }
 
@@ -254,5 +240,5 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
     // *              Errors               * //
     // ************************************* //
 
-    error EmptyRecoveryCommit();
+    error EmptyJustificationCommit();
 }
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol b/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
index fe2c0eb7b..e78ca6cf9 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
@@ -18,8 +18,8 @@ contract DisputeKitShutter is DisputeKitClassicBase {
     // *             Storage               * //
     // ************************************* //
 
-    mapping(uint256 localDisputeID => mapping(uint256 localRoundID => mapping(uint256 voteID => bytes32 recoveryCommitment)))
-        public recoveryCommitments;
+    mapping(uint256 localDisputeID => mapping(uint256 localRoundID => mapping(uint256 voteID => bytes32 justificationCommitment)))
+        public justificationCommitments;
 
     // ************************************* //
     // *        Transient Storage          * //
@@ -34,15 +34,15 @@ contract DisputeKitShutter is DisputeKitClassicBase {
     /// @notice Emitted when a vote is cast.
     /// @param _coreDisputeID The identifier of the dispute in the Arbitrator contract.
     /// @param _juror The address of the juror casting the vote commitment.
-    /// @param _commit The commitment hash.
-    /// @param _recoveryCommit The commitment hash without the justification.
+    /// @param _choiceCommit The commitment hash without the justification.
+    /// @param _justificationCommit The commitment hash for the justification.
     /// @param _identity The Shutter identity used for encryption.
     /// @param _encryptedVote The Shutter encrypted vote.
     event CommitCastShutter(
         uint256 indexed _coreDisputeID,
         address indexed _juror,
-        bytes32 indexed _commit,
-        bytes32 _recoveryCommit,
+        bytes32 indexed _choiceCommit,
+        bytes32 _justificationCommit,
         bytes32 _identity,
         bytes _encryptedVote
     );
@@ -91,30 +91,37 @@ contract DisputeKitShutter is DisputeKitClassicBase {
     ///
     /// @param _coreDisputeID The ID of the dispute in Kleros Core.
     /// @param _voteIDs The IDs of the votes.
-    /// @param _commit The commitment hash including the justification.
-    /// @param _recoveryCommit The commitment hash without the justification.
+    /// @param _choiceCommit The commitment hash without the justification.
+    /// @param _justificationCommit The commitment hash for justification.
     /// @param _identity The Shutter identity used for encryption.
     /// @param _encryptedVote The Shutter encrypted vote.
     function castCommitShutter(
         uint256 _coreDisputeID,
         uint256[] calldata _voteIDs,
-        bytes32 _commit,
-        bytes32 _recoveryCommit,
+        bytes32 _choiceCommit,
+        bytes32 _justificationCommit,
         bytes32 _identity,
         bytes calldata _encryptedVote
     ) external {
-        if (_recoveryCommit == bytes32(0)) revert EmptyRecoveryCommit();
+        if (_justificationCommit == bytes32(0)) revert EmptyJustificationCommit();
 
         uint256 localDisputeID = coreDisputeIDToLocal[_coreDisputeID];
         Dispute storage dispute = disputes[localDisputeID];
         uint256 localRoundID = dispute.rounds.length - 1;
         for (uint256 i = 0; i < _voteIDs.length; i++) {
-            recoveryCommitments[localDisputeID][localRoundID][_voteIDs[i]] = _recoveryCommit;
+            justificationCommitments[localDisputeID][localRoundID][_voteIDs[i]] = _justificationCommit;
         }
 
         // `_castCommit()` ensures that the caller owns the vote and that dispute is active
-        _castCommit(_coreDisputeID, _voteIDs, _commit);
-        emit CommitCastShutter(_coreDisputeID, msg.sender, _commit, _recoveryCommit, _identity, _encryptedVote);
+        _castCommit(_coreDisputeID, _voteIDs, _choiceCommit);
+        emit CommitCastShutter(
+            _coreDisputeID,
+            msg.sender,
+            _choiceCommit,
+            _justificationCommit,
+            _identity,
+            _encryptedVote
+        );
     }
 
     /// @notice Version of `castVote` function designed specifically for Shutter.
@@ -142,48 +149,23 @@ contract DisputeKitShutter is DisputeKitClassicBase {
         callerIsJuror = false;
     }
 
-    // ************************************* //
-    // *           Public Views            * //
-    // ************************************* //
-
-    /// @notice Computes the hash of a vote using ABI encoding
-    /// @param _choice The choice being voted for
-    /// @param _salt A random salt for commitment
-    /// @param _justification The justification for the vote
-    /// @return bytes32 The hash of the encoded vote parameters
-    function hashVote(
-        uint256 _choice,
-        uint256 _salt,
-        string memory _justification
-    ) public view override returns (bytes32) {
-        if (callerIsJuror) {
-            // Caller is the juror, hash without `_justification` to facilitate recovery.
-            return keccak256(abi.encodePacked(_choice, _salt));
-        } else {
-            // Caller is not the juror, hash with `_justification`.
-            bytes32 justificationHash = keccak256(bytes(_justification));
-            return keccak256(abi.encode(_choice, _salt, justificationHash));
-        }
-    }
-
     // ************************************* //
     // *            Internal               * //
     // ************************************* //
 
-    /// @notice Returns the expected vote hash for a given vote.
-    /// @param _localDisputeID The ID of the dispute in the Dispute Kit.
-    /// @param _localRoundID The ID of the round in the Dispute Kit.
-    /// @param _voteID The ID of the vote.
-    /// @return The expected vote hash.
-    function _getExpectedVoteHash(
+    /// @inheritdoc DisputeKitClassicBase
+    function _checkJustification(
         uint256 _localDisputeID,
         uint256 _localRoundID,
-        uint256 _voteID
-    ) internal view override returns (bytes32) {
-        if (callerIsJuror) {
-            return recoveryCommitments[_localDisputeID][_localRoundID][_voteID];
+        uint256 _voteID,
+        string memory _justification,
+        uint256 _salt
+    ) internal view override returns (bool) {
+        if (!callerIsJuror) {
+            bytes32 justificationCommit = justificationCommitments[_localDisputeID][_localRoundID][_voteID];
+            return justificationCommit == keccak256(abi.encode(_salt, keccak256(bytes(_justification))));
         } else {
-            return disputes[_localDisputeID].rounds[_localRoundID].votes[_voteID].commit;
+            return true;
         }
     }
 
@@ -191,5 +173,5 @@ contract DisputeKitShutter is DisputeKitClassicBase {
     // *              Errors               * //
     // ************************************* //
 
-    error EmptyRecoveryCommit();
+    error EmptyJustificationCommit();
 }
diff --git a/contracts/test/arbitration/dispute-kit-shutter.ts b/contracts/test/arbitration/dispute-kit-shutter.ts
index aab7efa58..c739cb49d 100644
--- a/contracts/test/arbitration/dispute-kit-shutter.ts
+++ b/contracts/test/arbitration/dispute-kit-shutter.ts
@@ -93,18 +93,18 @@ describe("DisputeKitShutter", async () => {
     ethers.AbiCoder.defaultAbiCoder().encode(["uint256", "uint256", "uint256"], [courtId, minJurors, disputeKitId]);
 
   const generateCommitments = (choice: bigint, salt: bigint, justification: string) => {
-    // Recovery commitment: hash(choice, salt) - no justification
-    const recoveryCommit = ethers.keccak256(
-      ethers.AbiCoder.defaultAbiCoder().encode(["uint256", "uint256"], [choice, salt])
+    // Choice commitment: hash(choice, salt)
+    const justificationHash = ethers.keccak256(ethers.toUtf8Bytes(justification));
+    // Justification commitment: hash(salt, justificationHash)
+    const justificationCommit = ethers.keccak256(
+      ethers.AbiCoder.defaultAbiCoder().encode(["uint256", "bytes32"], [salt, justificationHash])
     );
 
-    // Full commitment: hash(choice, salt, justificationHash)
-    const justificationHash = ethers.keccak256(ethers.toUtf8Bytes(justification));
-    const fullCommit = ethers.keccak256(
-      ethers.AbiCoder.defaultAbiCoder().encode(["uint256", "uint256", "bytes32"], [choice, salt, justificationHash])
+    const choiceCommit = ethers.keccak256(
+      ethers.AbiCoder.defaultAbiCoder().encode(["uint256", "uint256"], [choice, salt])
     );
 
-    return { fullCommit, recoveryCommit };
+    return { choiceCommit, justificationCommit };
   };
 
   const createDisputeAndDraw = async (courtId: BigNumberish, minJurors: BigNumberish, disputeKitId: number) => {
@@ -208,7 +208,7 @@ describe("DisputeKitShutter", async () => {
 
   describe("Commit Phase - castCommitShutter()", () => {
     describe("Successful commits", () => {
-      it("Should allow juror to commit vote with recovery commitment", async () => {
+      it("Should allow juror to commit vote with justification commitment", async () => {
         // Use the court with hidden votes (court ID 2)
         const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
         await advanceToCommitPeriod(disputeId);
@@ -216,20 +216,24 @@ describe("DisputeKitShutter", async () => {
         const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
         expect(voteIDs.length).to.be.greaterThan(0);
 
-        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+        const { choiceCommit, justificationCommit } = generateCommitments(choice, salt, justification);
 
         await expect(
           disputeKitShutter
             .connect(juror1)
-            .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote)
+            .castCommitShutter(disputeId, voteIDs, choiceCommit, justificationCommit, identity, encryptedVote)
         )
           .to.emit(disputeKitShutter, "CommitCastShutter")
-          .withArgs(disputeId, juror1.address, fullCommit, recoveryCommit, identity, encryptedVote);
+          .withArgs(disputeId, juror1.address, choiceCommit, justificationCommit, identity, encryptedVote);
 
-        // Verify recovery commitment was stored
+        // Verify justification commitment was stored
         const localDisputeId = await disputeKitShutter.coreDisputeIDToLocal(disputeId);
-        const storedRecoveryCommit = await disputeKitShutter.recoveryCommitments(localDisputeId, 0, voteIDs[0]);
-        expect(storedRecoveryCommit).to.equal(recoveryCommit);
+        const storedJustificationCommit = await disputeKitShutter.justificationCommitments(
+          localDisputeId,
+          0,
+          voteIDs[0]
+        );
+        expect(storedJustificationCommit).to.equal(justificationCommit);
       });
 
       it("Should allow juror to update commitment multiple times", async () => {
@@ -240,47 +244,55 @@ describe("DisputeKitShutter", async () => {
         const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
 
         // First commitment
-        const { fullCommit: commit1, recoveryCommit: recovery1 } = generateCommitments(1n, 111n, "First justification");
+        const { choiceCommit: commit1, justificationCommit: justification1 } = generateCommitments(
+          1n,
+          111n,
+          "First justification"
+        );
         await disputeKitShutter
           .connect(juror1)
-          .castCommitShutter(disputeId, voteIDs, commit1, recovery1, identity, encryptedVote);
+          .castCommitShutter(disputeId, voteIDs, commit1, justification1, identity, encryptedVote);
 
         // Second commitment (overwrites first)
-        const { fullCommit: commit2, recoveryCommit: recovery2 } = generateCommitments(
+        const { choiceCommit: commit2, justificationCommit: justification2 } = generateCommitments(
           2n,
           222n,
           "Second justification"
         );
         await disputeKitShutter
           .connect(juror1)
-          .castCommitShutter(disputeId, voteIDs, commit2, recovery2, identity, encryptedVote);
+          .castCommitShutter(disputeId, voteIDs, commit2, justification2, identity, encryptedVote);
 
         // Verify only the second commitment is stored
         const localDisputeId = await disputeKitShutter.coreDisputeIDToLocal(disputeId);
-        const storedRecoveryCommit = await disputeKitShutter.recoveryCommitments(localDisputeId, 0, voteIDs[0]);
-        expect(storedRecoveryCommit).to.equal(recovery2);
+        const storedJustificationCommit = await disputeKitShutter.justificationCommitments(
+          localDisputeId,
+          0,
+          voteIDs[0]
+        );
+        expect(storedJustificationCommit).to.equal(justification2);
       });
     });
 
     describe("Failed commits", () => {
-      it("Should revert if recovery commitment is empty", async () => {
+      it("Should revert if justification commitment is empty", async () => {
         // Use the court with hidden votes (court ID 2)
         const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
         await advanceToCommitPeriod(disputeId);
 
         const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-        const { fullCommit } = generateCommitments(choice, salt, justification);
+        const { choiceCommit } = generateCommitments(choice, salt, justification);
 
         await expect(
           disputeKitShutter.connect(juror1).castCommitShutter(
             disputeId,
             voteIDs,
-            fullCommit,
-            ethers.ZeroHash, // Empty recovery commit
+            choiceCommit,
+            ethers.ZeroHash, // Empty justification commit
             identity,
             encryptedVote
           )
-        ).to.be.revertedWithCustomError(disputeKitShutter, "EmptyRecoveryCommit");
+        ).to.be.revertedWithCustomError(disputeKitShutter, "EmptyJustificationCommit");
       });
 
       it("Should revert if not in commit period", async () => {
@@ -289,12 +301,12 @@ describe("DisputeKitShutter", async () => {
         // Still in evidence period
 
         const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+        const { choiceCommit, justificationCommit } = generateCommitments(choice, salt, justification);
 
         await expect(
           disputeKitShutter
             .connect(juror1)
-            .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote)
+            .castCommitShutter(disputeId, voteIDs, choiceCommit, justificationCommit, identity, encryptedVote)
         ).to.be.revertedWithCustomError(disputeKitShutter, "NotCommitPeriod");
       });
 
@@ -304,14 +316,14 @@ describe("DisputeKitShutter", async () => {
         await advanceToCommitPeriod(disputeId);
 
         const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+        const { choiceCommit, justificationCommit } = generateCommitments(choice, salt, justification);
 
         await expect(
           disputeKitShutter.connect(juror2).castCommitShutter(
             disputeId,
             voteIDs, // Using juror1's vote IDs
-            fullCommit,
-            recoveryCommit,
+            choiceCommit,
+            justificationCommit,
             identity,
             encryptedVote
           )
@@ -328,12 +340,12 @@ describe("DisputeKitShutter", async () => {
         await advanceToCommitPeriod(disputeId);
 
         const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+        const { choiceCommit, justificationCommit } = generateCommitments(choice, salt, justification);
 
         // Juror commits
         await disputeKitShutter
           .connect(juror1)
-          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
+          .castCommitShutter(disputeId, voteIDs, choiceCommit, justificationCommit, identity, encryptedVote);
 
         await advanceToVotePeriod(disputeId);
 
@@ -356,11 +368,11 @@ describe("DisputeKitShutter", async () => {
         await advanceToCommitPeriod(disputeId);
 
         const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+        const { choiceCommit, justificationCommit } = generateCommitments(choice, salt, justification);
 
         await disputeKitShutter
           .connect(juror1)
-          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
+          .castCommitShutter(disputeId, voteIDs, choiceCommit, justificationCommit, identity, encryptedVote);
 
         await advanceToVotePeriod(disputeId);
 
@@ -382,11 +394,11 @@ describe("DisputeKitShutter", async () => {
         await advanceToCommitPeriod(disputeId);
 
         const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+        const { choiceCommit, justificationCommit } = generateCommitments(choice, salt, justification);
 
         await disputeKitShutter
           .connect(juror1)
-          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
+          .castCommitShutter(disputeId, voteIDs, choiceCommit, justificationCommit, identity, encryptedVote);
 
         await advanceToVotePeriod(disputeId);
 
@@ -408,11 +420,11 @@ describe("DisputeKitShutter", async () => {
         await advanceToCommitPeriod(disputeId);
 
         const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+        const { choiceCommit, justificationCommit } = generateCommitments(choice, salt, justification);
 
         await disputeKitShutter
           .connect(juror1)
-          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
+          .castCommitShutter(disputeId, voteIDs, choiceCommit, justificationCommit, identity, encryptedVote);
 
         await advanceToVotePeriod(disputeId);
 
@@ -425,7 +437,7 @@ describe("DisputeKitShutter", async () => {
             salt,
             wrongJustification // Wrong justification
           )
-        ).to.be.revertedWithCustomError(disputeKitShutter, "HashDoesNotMatchHiddenVoteCommitment");
+        ).to.be.revertedWithCustomError(disputeKitShutter, "WrongJustification");
       });
 
       it("Should revert if vote already cast", async () => {
@@ -434,11 +446,11 @@ describe("DisputeKitShutter", async () => {
         await advanceToCommitPeriod(disputeId);
 
         const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+        const { choiceCommit, justificationCommit } = generateCommitments(choice, salt, justification);
 
         await disputeKitShutter
           .connect(juror1)
-          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
+          .castCommitShutter(disputeId, voteIDs, choiceCommit, justificationCommit, identity, encryptedVote);
 
         await advanceToVotePeriod(disputeId);
 
@@ -453,20 +465,20 @@ describe("DisputeKitShutter", async () => {
     });
   });
 
-  describe("Recovery Flow - Juror Reveals", () => {
-    describe("Successful recovery reveals", () => {
+  describe("Juror Reveals justification", () => {
+    describe("Successful justification reveals", () => {
       it("Should allow juror to recover vote without justification", async () => {
         // Use the court with hidden votes (court ID 2)
         const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
         await advanceToCommitPeriod(disputeId);
 
         const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+        const { choiceCommit, justificationCommit } = generateCommitments(choice, salt, justification);
 
         // Juror commits
         await disputeKitShutter
           .connect(juror1)
-          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
+          .castCommitShutter(disputeId, voteIDs, choiceCommit, justificationCommit, identity, encryptedVote);
 
         await advanceToVotePeriod(disputeId);
 
@@ -490,17 +502,17 @@ describe("DisputeKitShutter", async () => {
         expect(voteInfo[2]).to.equal(choice); // choice is at index 2
       });
 
-      it("Should validate against recovery commitment when juror reveals", async () => {
+      it("Should validate against justification commitment when juror reveals", async () => {
         // Use the court with hidden votes (court ID 2)
         const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
         await advanceToCommitPeriod(disputeId);
 
         const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+        const { choiceCommit, justificationCommit } = generateCommitments(choice, salt, justification);
 
         await disputeKitShutter
           .connect(juror1)
-          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
+          .castCommitShutter(disputeId, voteIDs, choiceCommit, justificationCommit, identity, encryptedVote);
 
         await advanceToVotePeriod(disputeId);
 
@@ -525,11 +537,11 @@ describe("DisputeKitShutter", async () => {
         await advanceToCommitPeriod(disputeId);
 
         const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+        const { choiceCommit, justificationCommit } = generateCommitments(choice, salt, justification);
 
         await disputeKitShutter
           .connect(juror1)
-          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
+          .castCommitShutter(disputeId, voteIDs, choiceCommit, justificationCommit, identity, encryptedVote);
 
         await advanceToVotePeriod(disputeId);
 
@@ -551,11 +563,11 @@ describe("DisputeKitShutter", async () => {
         await advanceToCommitPeriod(disputeId);
 
         const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+        const { choiceCommit, justificationCommit } = generateCommitments(choice, salt, justification);
 
         await disputeKitShutter
           .connect(juror1)
-          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
+          .castCommitShutter(disputeId, voteIDs, choiceCommit, justificationCommit, identity, encryptedVote);
 
         await advanceToVotePeriod(disputeId);
 
@@ -577,11 +589,11 @@ describe("DisputeKitShutter", async () => {
         await advanceToCommitPeriod(disputeId);
 
         const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+        const { choiceCommit, justificationCommit } = generateCommitments(choice, salt, justification);
 
         await disputeKitShutter
           .connect(juror1)
-          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
+          .castCommitShutter(disputeId, voteIDs, choiceCommit, justificationCommit, identity, encryptedVote);
 
         await advanceToVotePeriod(disputeId);
 
@@ -594,7 +606,7 @@ describe("DisputeKitShutter", async () => {
             salt,
             "" // No justification - would work for juror but not for others
           )
-        ).to.be.revertedWithCustomError(disputeKitShutter, "HashDoesNotMatchHiddenVoteCommitment");
+        ).to.be.revertedWithCustomError(disputeKitShutter, "WrongJustification");
       });
     });
   });
@@ -605,33 +617,16 @@ describe("DisputeKitShutter", async () => {
       await advanceToCommitPeriod(disputeId);
 
       const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-      const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+      const { choiceCommit, justificationCommit } = generateCommitments(choice, salt, justification);
 
       await disputeKitShutter
         .connect(juror1)
-        .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
+        .castCommitShutter(disputeId, voteIDs, choiceCommit, justificationCommit, identity, encryptedVote);
 
       await advanceToVotePeriod(disputeId);
 
-      // During castVoteShutter, the contract should use different hash logic
-      // For juror: hash(choice, salt)
-      // For non-juror: hash(choice, salt, justificationHash)
-
-      // This is tested implicitly by the recovery flow tests above
       // The juror can reveal with any justification, while non-juror must provide exact justification
     });
-
-    it("Should correctly compute hash for normal flow", async () => {
-      // Test hashVote function directly
-      const justificationHash = ethers.keccak256(ethers.toUtf8Bytes(justification));
-      const expectedHash = ethers.keccak256(
-        ethers.AbiCoder.defaultAbiCoder().encode(["uint256", "uint256", "bytes32"], [choice, salt, justificationHash])
-      );
-
-      // When called by non-juror (normal case), should include justification
-      const computedHash = await disputeKitShutter.hashVote(choice, salt, justification);
-      expect(computedHash).to.equal(expectedHash);
-    });
   });
 
   describe("Edge Cases and Security", () => {
@@ -642,28 +637,32 @@ describe("DisputeKitShutter", async () => {
       const voteIDsJuror1 = await getVoteIDsForJuror(disputeId, juror1);
       const voteIDsJuror2 = await getVoteIDsForJuror(disputeId, juror2);
 
-      const { fullCommit: commit1, recoveryCommit: recovery1 } = generateCommitments(1n, 111n, "Juror 1 justification");
-      const { fullCommit: commit2, recoveryCommit: recovery2 } = generateCommitments(2n, 222n, "Juror 2 justification");
+      const { choiceCommit: commit1, justificationCommit: justification1 } = generateCommitments(
+        1n,
+        111n,
+        "Juror 1 justification"
+      );
+      const { choiceCommit: commit2, justificationCommit: justification2 } = generateCommitments(
+        2n,
+        222n,
+        "Juror 2 justification"
+      );
 
       // Both jurors commit
       await disputeKitShutter
         .connect(juror1)
-        .castCommitShutter(disputeId, voteIDsJuror1, commit1, recovery1, identity, encryptedVote);
+        .castCommitShutter(disputeId, voteIDsJuror1, commit1, justification1, identity, encryptedVote);
 
       await disputeKitShutter
         .connect(juror2)
-        .castCommitShutter(disputeId, voteIDsJuror2, commit2, recovery2, identity, encryptedVote);
+        .castCommitShutter(disputeId, voteIDsJuror2, commit2, justification2, identity, encryptedVote);
 
       await advanceToVotePeriod(disputeId);
 
-      // Juror1 uses recovery flow (Shutter failed for them)
-      await disputeKitShutter.connect(juror1).castVoteShutter(
-        disputeId,
-        voteIDsJuror1,
-        1n,
-        111n,
-        "Different justification" // Recovery doesn't check this
-      );
+      // Juror1 casts the vote directly (Shutter failed for them)
+      await disputeKitShutter
+        .connect(juror1)
+        .castVoteShutter(disputeId, voteIDsJuror1, 1n, 111n, "Different justification");
 
       // Bot reveals juror2's vote normally
       await disputeKitShutter.connect(bot).castVoteShutter(
@@ -689,16 +688,16 @@ describe("DisputeKitShutter", async () => {
       await advanceToCommitPeriod(disputeId);
 
       const voteIDsJuror1 = await getVoteIDsForJuror(disputeId, juror1);
-      const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
+      const { choiceCommit, justificationCommit } = generateCommitments(choice, salt, justification);
 
       await disputeKitShutter
         .connect(juror1)
-        .castCommitShutter(disputeId, voteIDsJuror1, fullCommit, recoveryCommit, identity, encryptedVote);
+        .castCommitShutter(disputeId, voteIDsJuror1, choiceCommit, justificationCommit, identity, encryptedVote);
 
       // Juror2 commits with a different choice
       const differentChoice = 2n;
       const voteIDsJuror2 = await getVoteIDsForJuror(disputeId, juror2);
-      const { fullCommit: commit2, recoveryCommit: recovery2 } = generateCommitments(
+      const { choiceCommit: commit2, justificationCommit: justification2 } = generateCommitments(
         differentChoice,
         salt,
         justification
@@ -706,7 +705,7 @@ describe("DisputeKitShutter", async () => {
 
       await disputeKitShutter
         .connect(juror2)
-        .castCommitShutter(disputeId, voteIDsJuror2, commit2, recovery2, identity, encryptedVote);
+        .castCommitShutter(disputeId, voteIDsJuror2, commit2, justification2, identity, encryptedVote);
 
       await advanceToVotePeriod(disputeId);
 

From bcbe2281e93b2f3a02a6c8ee3977d91cec35d521 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Tue, 14 Oct 2025 17:49:49 +0100
Subject: [PATCH 166/175] test: updated with token whitelist coverage

---
 contracts/src/test/DisputeKitGatedMock.sol    |  15 ++
 .../test/arbitration/dispute-kit-gated.ts     | 227 +++++++++++++++++-
 2 files changed, 233 insertions(+), 9 deletions(-)
 create mode 100644 contracts/src/test/DisputeKitGatedMock.sol

diff --git a/contracts/src/test/DisputeKitGatedMock.sol b/contracts/src/test/DisputeKitGatedMock.sol
new file mode 100644
index 000000000..f08862efb
--- /dev/null
+++ b/contracts/src/test/DisputeKitGatedMock.sol
@@ -0,0 +1,15 @@
+// SPDX-License-Identifier: MIT
+
+pragma solidity ^0.8.24;
+
+import "../arbitration/dispute-kits/DisputeKitGated.sol";
+
+/// @title KlerosCoreMock
+/// KlerosCore with view functions to use in Foundry tests.
+contract DisputeKitGatedMock is DisputeKitGated {
+    function extraDataToTokenInfo(
+        bytes memory _extraData
+    ) public pure returns (address tokenGate, bool isERC1155, uint256 tokenId) {
+        (tokenGate, isERC1155, tokenId) = _extraDataToTokenInfo(_extraData);
+    }
+}
diff --git a/contracts/test/arbitration/dispute-kit-gated.ts b/contracts/test/arbitration/dispute-kit-gated.ts
index 5bc6c6bcb..ce7fe8ef0 100644
--- a/contracts/test/arbitration/dispute-kit-gated.ts
+++ b/contracts/test/arbitration/dispute-kit-gated.ts
@@ -19,7 +19,18 @@ import { deployUpgradable } from "../../deploy/utils/deployUpgradable";
 /* eslint-disable no-unused-vars */
 /* eslint-disable no-unused-expressions */ // https://github.com/standard/standard/issues/690#issuecomment-278533482
 
+/**
+ * Test suite for DisputeKitGated - a dispute kit that requires jurors to hold
+ * specific tokens (ERC20, ERC721, or ERC1155) to participate in disputes.
+ *
+ * Tests cover:
+ * - Token whitelist management and access control
+ * - Error handling for unsupported tokens
+ * - Token gating functionality for different token types
+ * - Integration between whitelist and dispute creation
+ */
 describe("DisputeKitGated", async () => {
+  // Constants for token amounts
   const ONE_THOUSAND_PNK = 10n ** 21n;
   const thousandPNK = (amount: BigNumberish) => toBigInt(amount) * ONE_THOUSAND_PNK;
   const PNK = (amount: BigNumberish) => toBigInt(amount) * 10n ** 18n;
@@ -35,8 +46,8 @@ describe("DisputeKitGated", async () => {
   let rng: IncrementalNG;
   let nft721: TestERC721;
   let nft1155: TestERC1155;
+  let gatedDisputeKitID: number;
   const RANDOM = 424242n;
-  const GATED_DK_ID = 3;
   const TOKEN_ID = 888;
   const minStake = PNK(200);
 
@@ -62,8 +73,8 @@ describe("DisputeKitGated", async () => {
       log: true,
     });
     await core.addNewDisputeKit(deploymentResult.address);
-    const disputeKitGatedID = (await core.getDisputeKitsLength()) - 1n;
-    await core.enableDisputeKits(Courts.GENERAL, [disputeKitGatedID], true); // enable disputeKitGated on the General Court
+    gatedDisputeKitID = Number((await core.getDisputeKitsLength()) - 1n);
+    await core.enableDisputeKits(Courts.GENERAL, [gatedDisputeKitID], true); // enable disputeKitGated on the General Court
 
     disputeKitGated = await ethers.getContract<DisputeKitGatedMock>("DisputeKitGatedMock");
 
@@ -84,8 +95,14 @@ describe("DisputeKitGated", async () => {
     await deployERC1155(hre, deployer, "TestERC1155", "Nft1155");
     nft1155 = await ethers.getContract<TestERC1155>("Nft1155");
     await nft1155.mint(deployer, TOKEN_ID, 1, "0x00");
+
+    // Whitelist all tokens by default to make existing tests work
+    await whitelistTokens([dai.target, nft721.target, nft1155.target], true);
   });
 
+  // Helper Functions
+
+  /** Encodes extra data for dispute creation with token gating parameters */
   const encodeExtraData = (
     courtId: number,
     minJurors: BigNumberish,
@@ -103,6 +120,29 @@ describe("DisputeKitGated", async () => {
     );
   };
 
+  /** Adds or removes tokens from the whitelist */
+  const whitelistTokens = async (tokens: (string | Addressable)[], supported: boolean = true) => {
+    const tokenAddresses = tokens.map((token) => (typeof token === "string" ? token : token.toString()));
+    return disputeKitGated.changeSupportedTokens(tokenAddresses, supported);
+  };
+
+  /** Creates a dispute with the specified token gate */
+  const createDisputeWithToken = async (
+    token: string | Addressable,
+    isERC1155: boolean = false,
+    tokenId: BigNumberish = 0
+  ) => {
+    const extraData = encodeExtraData(Courts.GENERAL, 3, gatedDisputeKitID, token, isERC1155, tokenId);
+    const arbitrationCost = await core["arbitrationCost(bytes)"](extraData);
+    return core["createDispute(uint256,bytes)"](2, extraData, { value: arbitrationCost });
+  };
+
+  /** Asserts whether a token is supported or not */
+  const expectTokenSupported = async (token: string | Addressable, supported: boolean) => {
+    const tokenAddress = typeof token === "string" ? token : token.toString();
+    expect(await disputeKitGated.supportedTokens(tokenAddress)).to.equal(supported);
+  };
+
   const stakeAndDraw = async (
     courtId: number,
     minJurors: BigNumberish,
@@ -159,10 +199,122 @@ describe("DisputeKitGated", async () => {
     return core.draw(disputeId, 70, { gasLimit: 10000000 });
   };
 
+  describe("Token Whitelist Management", async () => {
+    describe("changeSupportedTokens function", async () => {
+      it("Should allow owner to whitelist single token", async () => {
+        await whitelistTokens([dai.target], true);
+        await expectTokenSupported(dai.target, true);
+      });
+
+      it("Should allow owner to whitelist multiple tokens", async () => {
+        await whitelistTokens([dai.target, nft721.target, nft1155.target], true);
+        await expectTokenSupported(dai.target, true);
+        await expectTokenSupported(nft721.target, true);
+        await expectTokenSupported(nft1155.target, true);
+      });
+
+      it("Should allow owner to remove single token from whitelist", async () => {
+        await whitelistTokens([dai.target], true);
+        await expectTokenSupported(dai.target, true);
+
+        await whitelistTokens([dai.target], false);
+        await expectTokenSupported(dai.target, false);
+      });
+
+      it("Should allow owner to remove multiple tokens from whitelist", async () => {
+        await whitelistTokens([dai.target, nft721.target], true);
+        await expectTokenSupported(dai.target, true);
+        await expectTokenSupported(nft721.target, true);
+
+        await whitelistTokens([dai.target, nft721.target], false);
+        await expectTokenSupported(dai.target, false);
+        await expectTokenSupported(nft721.target, false);
+      });
+
+      it("Should handle mixed operations (add some, remove some)", async () => {
+        await whitelistTokens([dai.target, nft721.target], true);
+        await expectTokenSupported(dai.target, true);
+        await expectTokenSupported(nft721.target, true);
+
+        await whitelistTokens([dai.target], false);
+        await whitelistTokens([nft1155.target], true);
+
+        await expectTokenSupported(dai.target, false);
+        await expectTokenSupported(nft721.target, true);
+        await expectTokenSupported(nft1155.target, true);
+      });
+
+      it("Should handle duplicate operations correctly", async () => {
+        // Whitelist token twice - should not revert
+        await whitelistTokens([dai.target], true);
+        await whitelistTokens([dai.target], true);
+        await expectTokenSupported(dai.target, true);
+
+        // Remove token twice - should not revert
+        await whitelistTokens([dai.target], false);
+        await whitelistTokens([dai.target], false);
+        await expectTokenSupported(dai.target, false);
+      });
+    });
+
+    describe("Access Control", async () => {
+      it("Should revert when non-owner tries to change supported tokens", async () => {
+        await expect(disputeKitGated.connect(juror1).changeSupportedTokens([dai.target], true)).to.be.reverted;
+      });
+
+      it("Should revert when non-owner tries to remove supported tokens", async () => {
+        // First whitelist as owner
+        await whitelistTokens([dai.target], true);
+
+        // Then try to remove as non-owner
+        await expect(disputeKitGated.connect(juror1).changeSupportedTokens([dai.target], false)).to.be.reverted;
+      });
+    });
+  });
+
+  describe("Error Handling - Unsupported Tokens", async () => {
+    it("Should revert with TokenNotSupported when creating dispute with unsupported ERC20", async () => {
+      await whitelistTokens([dai.target], false);
+
+      await expect(createDisputeWithToken(dai.target))
+        .to.be.revertedWithCustomError(disputeKitGated, "TokenNotSupported")
+        .withArgs(dai.target);
+    });
+
+    it("Should revert with TokenNotSupported when creating dispute with unsupported ERC721", async () => {
+      await whitelistTokens([nft721.target], false);
+
+      await expect(createDisputeWithToken(nft721.target))
+        .to.be.revertedWithCustomError(disputeKitGated, "TokenNotSupported")
+        .withArgs(nft721.target);
+    });
+
+    it("Should revert with TokenNotSupported when creating dispute with unsupported ERC1155", async () => {
+      await whitelistTokens([nft1155.target], false);
+
+      await expect(createDisputeWithToken(nft1155.target, true, TOKEN_ID))
+        .to.be.revertedWithCustomError(disputeKitGated, "TokenNotSupported")
+        .withArgs(nft1155.target);
+    });
+
+    it("Should allow dispute creation after token is whitelisted", async () => {
+      await whitelistTokens([dai.target], false);
+
+      await expect(createDisputeWithToken(dai.target)).to.be.revertedWithCustomError(
+        disputeKitGated,
+        "TokenNotSupported"
+      );
+
+      await whitelistTokens([dai.target], true);
+
+      await expect(createDisputeWithToken(dai.target)).to.not.be.reverted;
+    });
+  });
+
   describe("When gating with DAI token", async () => {
     it("Should draw no juror if they don't have any DAI balance", async () => {
       const nbOfJurors = 15n;
-      const tx = await stakeAndDraw(Courts.GENERAL, nbOfJurors, GATED_DK_ID, dai.target, false, 0).then((tx) =>
+      const tx = await stakeAndDraw(Courts.GENERAL, nbOfJurors, gatedDisputeKitID, dai.target, false, 0).then((tx) =>
         tx.wait()
       );
 
@@ -176,7 +328,7 @@ describe("DisputeKitGated", async () => {
       dai.transfer(juror1.address, 1);
 
       const nbOfJurors = 15n;
-      const tx = await stakeAndDraw(Courts.GENERAL, nbOfJurors, GATED_DK_ID, dai.target, false, 0).then((tx) =>
+      const tx = await stakeAndDraw(Courts.GENERAL, nbOfJurors, gatedDisputeKitID, dai.target, false, 0).then((tx) =>
         tx.wait()
       );
 
@@ -209,7 +361,7 @@ describe("DisputeKitGated", async () => {
   describe("When gating with ERC721 token", async () => {
     it("Should draw no juror if they don't own the ERC721 token", async () => {
       const nbOfJurors = 15n;
-      const tx = await stakeAndDraw(Courts.GENERAL, nbOfJurors, GATED_DK_ID, nft721.target, false, 0).then((tx) =>
+      const tx = await stakeAndDraw(Courts.GENERAL, nbOfJurors, gatedDisputeKitID, nft721.target, false, 0).then((tx) =>
         tx.wait()
       );
 
@@ -223,7 +375,7 @@ describe("DisputeKitGated", async () => {
       await nft721.safeMint(juror2.address);
 
       const nbOfJurors = 15n;
-      const tx = await stakeAndDraw(Courts.GENERAL, nbOfJurors, GATED_DK_ID, nft721.target, false, 0).then((tx) =>
+      const tx = await stakeAndDraw(Courts.GENERAL, nbOfJurors, gatedDisputeKitID, nft721.target, false, 0).then((tx) =>
         tx.wait()
       );
 
@@ -256,7 +408,7 @@ describe("DisputeKitGated", async () => {
   describe("When gating with ERC1155 token", async () => {
     it("Should draw no juror if they don't own the ERC1155 token", async () => {
       const nbOfJurors = 15n;
-      const tx = await stakeAndDraw(Courts.GENERAL, nbOfJurors, GATED_DK_ID, nft1155.target, true, TOKEN_ID).then(
+      const tx = await stakeAndDraw(Courts.GENERAL, nbOfJurors, gatedDisputeKitID, nft1155.target, true, TOKEN_ID).then(
         (tx) => tx.wait()
       );
 
@@ -270,7 +422,7 @@ describe("DisputeKitGated", async () => {
       await nft1155.mint(juror2.address, TOKEN_ID, 1, "0x00");
 
       const nbOfJurors = 15n;
-      const tx = await stakeAndDraw(Courts.GENERAL, nbOfJurors, GATED_DK_ID, nft1155.target, true, TOKEN_ID).then(
+      const tx = await stakeAndDraw(Courts.GENERAL, nbOfJurors, gatedDisputeKitID, nft1155.target, true, TOKEN_ID).then(
         (tx) => tx.wait()
       );
 
@@ -299,4 +451,61 @@ describe("DisputeKitGated", async () => {
       ]);
     });
   });
+
+  describe("Whitelist Integration Tests", async () => {
+    it("Should allow new disputes after whitelisting a token", async () => {
+      // Whitelist DAI token
+      await whitelistTokens([dai.target], true);
+
+      // Transfer DAI to juror1 for token gating
+      await dai.transfer(juror1.address, 1);
+
+      const nbOfJurors = 3n;
+      const tx = await stakeAndDraw(Courts.GENERAL, nbOfJurors, gatedDisputeKitID, dai.target, false, 0).then((tx) =>
+        tx.wait()
+      );
+
+      // Verify dispute was created and juror drawn
+      const drawLogs =
+        tx?.logs.filter((log: any) => log.fragment?.name === "Draw" && log.address === core.target) || [];
+      expect(drawLogs).to.have.length(nbOfJurors);
+    });
+
+    it("Should prevent new disputes after removing token from whitelist", async () => {
+      await whitelistTokens([dai.target], true);
+      await dai.transfer(juror1.address, 1);
+
+      // Create first dispute (should work)
+      await expect(createDisputeWithToken(dai.target)).to.not.be.reverted;
+
+      // Remove token from whitelist
+      await whitelistTokens([dai.target], false);
+
+      // Try to create another dispute (should fail)
+      await expect(createDisputeWithToken(dai.target))
+        .to.be.revertedWithCustomError(disputeKitGated, "TokenNotSupported")
+        .withArgs(dai.target);
+    });
+
+    it("Should maintain whitelist state correctly across multiple operations", async () => {
+      const tokens = [dai.target, nft721.target, nft1155.target];
+
+      // All tokens should already be supported from the main setup
+      for (const token of tokens) {
+        await expectTokenSupported(token, true);
+      }
+
+      // Remove middle token
+      await whitelistTokens([nft721.target], false);
+      await expectTokenSupported(dai.target, true);
+      await expectTokenSupported(nft721.target, false);
+      await expectTokenSupported(nft1155.target, true);
+
+      // Re-add middle token
+      await whitelistTokens([nft721.target], true);
+      for (const token of tokens) {
+        await expectTokenSupported(token, true);
+      }
+    });
+  });
 });

From 83a8ba69eef205cf4843bd492d139cfaf6c1573f Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Tue, 14 Oct 2025 19:12:12 +0100
Subject: [PATCH 167/175] fix: support disputes with no token gate address
 specified

---
 contracts/src/arbitration/dispute-kits/DisputeKitGated.sol   | 5 ++++-
 .../src/arbitration/dispute-kits/DisputeKitGatedShutter.sol  | 5 ++++-
 2 files changed, 8 insertions(+), 2 deletions(-)

diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol b/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol
index d41287b26..2b5131d81 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitGated.sol
@@ -29,6 +29,8 @@ interface IBalanceHolderERC1155 {
 contract DisputeKitGated is DisputeKitClassicBase {
     string public constant override version = "2.0.0";
 
+    address private constant NO_TOKEN_GATE = address(0);
+
     // ************************************* //
     // *             Storage               * //
     // ************************************* //
@@ -56,6 +58,7 @@ contract DisputeKitGated is DisputeKitClassicBase {
         uint256 _jumpDisputeKitID
     ) external initializer {
         __DisputeKitClassicBase_initialize(_owner, _core, _wNative, _jumpDisputeKitID);
+        supportedTokens[NO_TOKEN_GATE] = true; // Allows disputes without token gating
     }
 
     // ************************ //
@@ -141,7 +144,7 @@ contract DisputeKitGated is DisputeKitClassicBase {
         (address tokenGate, bool isERC1155, uint256 tokenId) = _extraDataToTokenInfo(dispute.extraData);
 
         // If no token gate is specified, allow all jurors
-        if (tokenGate == address(0)) return true;
+        if (tokenGate == NO_TOKEN_GATE) return true;
 
         // Check juror's token balance
         if (isERC1155) {
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
index dd8bc7eae..f5835e2a5 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
@@ -30,6 +30,8 @@ interface IBalanceHolderERC1155 {
 contract DisputeKitGatedShutter is DisputeKitClassicBase {
     string public constant override version = "2.0.0";
 
+    address private constant NO_TOKEN_GATE = address(0);
+
     // ************************************* //
     // *             Storage               * //
     // ************************************* //
@@ -85,6 +87,7 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
         uint256 _jumpDisputeKitID
     ) external initializer {
         __DisputeKitClassicBase_initialize(_owner, _core, _wNative, _jumpDisputeKitID);
+        supportedTokens[NO_TOKEN_GATE] = true; // Allows disputes without token gating
     }
 
     // ************************ //
@@ -265,7 +268,7 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
         (address tokenGate, bool isERC1155, uint256 tokenId) = _extraDataToTokenInfo(dispute.extraData);
 
         // If no token gate is specified, allow all jurors
-        if (tokenGate == address(0)) return true;
+        if (tokenGate == NO_TOKEN_GATE) return true;
 
         // Check juror's token balance
         if (isERC1155) {

From 700738e38daab7d42eac2473e377c272cc73252c Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Tue, 14 Oct 2025 19:14:24 +0100
Subject: [PATCH 168/175] test: refactored to cover both shutter and gated DK
 combinations without duplicating the tests

---
 .../src/test/DisputeKitGatedShutterMock.sol   |  15 +
 .../arbitration/dispute-kit-gated-shutter.ts  |  72 ++
 .../test/arbitration/dispute-kit-gated.ts     | 512 +---------
 .../test/arbitration/dispute-kit-shutter.ts   | 755 +--------------
 .../helpers/dispute-kit-gated-common.ts       | 625 +++++++++++++
 .../helpers/dispute-kit-shutter-common.ts     | 875 ++++++++++++++++++
 6 files changed, 1638 insertions(+), 1216 deletions(-)
 create mode 100644 contracts/src/test/DisputeKitGatedShutterMock.sol
 create mode 100644 contracts/test/arbitration/dispute-kit-gated-shutter.ts
 create mode 100644 contracts/test/arbitration/helpers/dispute-kit-gated-common.ts
 create mode 100644 contracts/test/arbitration/helpers/dispute-kit-shutter-common.ts

diff --git a/contracts/src/test/DisputeKitGatedShutterMock.sol b/contracts/src/test/DisputeKitGatedShutterMock.sol
new file mode 100644
index 000000000..79f56455a
--- /dev/null
+++ b/contracts/src/test/DisputeKitGatedShutterMock.sol
@@ -0,0 +1,15 @@
+// SPDX-License-Identifier: MIT
+
+pragma solidity ^0.8.24;
+
+import "../arbitration/dispute-kits/DisputeKitGatedShutter.sol";
+
+/// @title DisputeKitGatedShutterMock
+/// DisputeKitGatedShutter with view functions to use in Foundry tests.
+contract DisputeKitGatedShutterMock is DisputeKitGatedShutter {
+    function extraDataToTokenInfo(
+        bytes memory _extraData
+    ) public pure returns (address tokenGate, bool isERC1155, uint256 tokenId) {
+        (tokenGate, isERC1155, tokenId) = _extraDataToTokenInfo(_extraData);
+    }
+}
diff --git a/contracts/test/arbitration/dispute-kit-gated-shutter.ts b/contracts/test/arbitration/dispute-kit-gated-shutter.ts
new file mode 100644
index 000000000..1a3c41312
--- /dev/null
+++ b/contracts/test/arbitration/dispute-kit-gated-shutter.ts
@@ -0,0 +1,72 @@
+import {
+  setupTokenGatedTest,
+  testTokenWhitelistManagement,
+  testAccessControl,
+  testUnsupportedTokenErrors,
+  testERC20Gating,
+  testERC721Gating,
+  testERC1155Gating,
+  testWhitelistIntegration,
+  TokenGatedTestContext,
+} from "./helpers/dispute-kit-gated-common";
+import {
+  setupShutterTest,
+  testCommitPhase,
+  testNormalFlowBotReveals,
+  testRecoveryFlowJurorReveals,
+  testHashFunctionBehavior,
+  testEdgeCasesAndSecurity,
+  ShutterTestContext,
+} from "./helpers/dispute-kit-shutter-common";
+
+/* eslint-disable no-unused-vars */
+/* eslint-disable no-unused-expressions */
+
+/**
+ * Test suite for DisputeKitGatedShutter - a dispute kit that requires jurors to hold
+ * specific tokens (ERC20, ERC721, or ERC1155) to participate in disputes, with additional
+ * Shutter functionality for commit-reveal voting.
+ *
+ * Tests cover:
+ * - All DisputeKitGated functionality (via shared tests)
+ * - Shutter-specific commit/reveal mechanism
+ * - Recovery commits for juror vote recovery
+ * - Integration between token gating and Shutter features
+ */
+describe("DisputeKitGatedShutter", async () => {
+  describe("Token Gating Features", async () => {
+    let tokenContext: TokenGatedTestContext;
+
+    beforeEach("Setup", async () => {
+      tokenContext = await setupTokenGatedTest({ contractName: "DisputeKitGatedShutterMock" });
+    });
+
+    // Run all shared token gating tests
+    testTokenWhitelistManagement(() => tokenContext);
+    testAccessControl(() => tokenContext);
+    testUnsupportedTokenErrors(() => tokenContext);
+    testERC20Gating(() => tokenContext);
+    testERC721Gating(() => tokenContext);
+    testERC1155Gating(() => tokenContext);
+    testWhitelistIntegration(() => tokenContext);
+  });
+
+  describe("Shutter Features", async () => {
+    let shutterContext: ShutterTestContext;
+
+    beforeEach("Setup", async () => {
+      // Setup DisputeKitGatedShutter with token gating enabled
+      shutterContext = await setupShutterTest({
+        contractName: "DisputeKitGatedShutter",
+        isGated: true, // Enable token gating for DAI
+      });
+    });
+
+    // Run all shared Shutter tests
+    testCommitPhase(() => shutterContext);
+    testNormalFlowBotReveals(() => shutterContext);
+    testRecoveryFlowJurorReveals(() => shutterContext);
+    testHashFunctionBehavior(() => shutterContext);
+    testEdgeCasesAndSecurity(() => shutterContext);
+  });
+});
diff --git a/contracts/test/arbitration/dispute-kit-gated.ts b/contracts/test/arbitration/dispute-kit-gated.ts
index ce7fe8ef0..86f4320ea 100644
--- a/contracts/test/arbitration/dispute-kit-gated.ts
+++ b/contracts/test/arbitration/dispute-kit-gated.ts
@@ -1,23 +1,17 @@
-import { deployments, ethers, getNamedAccounts, network } from "hardhat";
-import { toBigInt, BigNumberish, Addressable } from "ethers";
 import {
-  PNK,
-  KlerosCore,
-  SortitionModule,
-  IncrementalNG,
-  DisputeKitGatedMock,
-  TestERC20,
-  TestERC721,
-  TestERC1155,
-} from "../../typechain-types";
-import { expect } from "chai";
-import { Courts } from "../../deploy/utils";
-import { HardhatEthersSigner } from "@nomicfoundation/hardhat-ethers/signers";
-import { deployERC1155, deployERC721 } from "../../deploy/utils/deployTokens";
-import { deployUpgradable } from "../../deploy/utils/deployUpgradable";
+  setupTokenGatedTest,
+  testTokenWhitelistManagement,
+  testAccessControl,
+  testUnsupportedTokenErrors,
+  testERC20Gating,
+  testERC721Gating,
+  testERC1155Gating,
+  testWhitelistIntegration,
+  TokenGatedTestContext,
+} from "./helpers/dispute-kit-gated-common";
 
 /* eslint-disable no-unused-vars */
-/* eslint-disable no-unused-expressions */ // https://github.com/standard/standard/issues/690#issuecomment-278533482
+/* eslint-disable no-unused-expressions */
 
 /**
  * Test suite for DisputeKitGated - a dispute kit that requires jurors to hold
@@ -30,482 +24,18 @@ import { deployUpgradable } from "../../deploy/utils/deployUpgradable";
  * - Integration between whitelist and dispute creation
  */
 describe("DisputeKitGated", async () => {
-  // Constants for token amounts
-  const ONE_THOUSAND_PNK = 10n ** 21n;
-  const thousandPNK = (amount: BigNumberish) => toBigInt(amount) * ONE_THOUSAND_PNK;
-  const PNK = (amount: BigNumberish) => toBigInt(amount) * 10n ** 18n;
-
-  let deployer: string;
-  let juror1: HardhatEthersSigner;
-  let juror2: HardhatEthersSigner;
-  let disputeKitGated: DisputeKitGatedMock;
-  let pnk: PNK;
-  let dai: TestERC20;
-  let core: KlerosCore;
-  let sortitionModule: SortitionModule;
-  let rng: IncrementalNG;
-  let nft721: TestERC721;
-  let nft1155: TestERC1155;
-  let gatedDisputeKitID: number;
-  const RANDOM = 424242n;
-  const TOKEN_ID = 888;
-  const minStake = PNK(200);
+  let context: TokenGatedTestContext;
 
   beforeEach("Setup", async () => {
-    ({ deployer } = await getNamedAccounts());
-    [, juror1, juror2] = await ethers.getSigners();
-
-    await deployments.fixture(["Arbitration", "VeaMock"], {
-      fallbackToGlobal: true,
-      keepExistingDeployments: false,
-    });
-
-    pnk = await ethers.getContract<PNK>("PNK");
-    dai = await ethers.getContract<TestERC20>("DAI");
-    const weth = await ethers.getContract<TestERC20>("WETH");
-    core = await ethers.getContract<KlerosCore>("KlerosCore");
-    sortitionModule = await ethers.getContract<SortitionModule>("SortitionModule");
-
-    const deploymentResult = await deployUpgradable(deployments, "DisputeKitGatedMock", {
-      from: deployer,
-      proxyAlias: "UUPSProxy",
-      args: [deployer, core.target, weth.target, 1],
-      log: true,
-    });
-    await core.addNewDisputeKit(deploymentResult.address);
-    gatedDisputeKitID = Number((await core.getDisputeKitsLength()) - 1n);
-    await core.enableDisputeKits(Courts.GENERAL, [gatedDisputeKitID], true); // enable disputeKitGated on the General Court
-
-    disputeKitGated = await ethers.getContract<DisputeKitGatedMock>("DisputeKitGatedMock");
-
-    // Make the tests more deterministic with this dummy RNG
-    await deployments.deploy("IncrementalNG", {
-      from: deployer,
-      args: [RANDOM],
-      log: true,
-    });
-    rng = await ethers.getContract<IncrementalNG>("IncrementalNG");
-
-    await sortitionModule.changeRandomNumberGenerator(rng.target).then((tx) => tx.wait());
-
-    const hre = require("hardhat");
-    await deployERC721(hre, deployer, "TestERC721", "Nft721");
-    nft721 = await ethers.getContract<TestERC721>("Nft721");
-
-    await deployERC1155(hre, deployer, "TestERC1155", "Nft1155");
-    nft1155 = await ethers.getContract<TestERC1155>("Nft1155");
-    await nft1155.mint(deployer, TOKEN_ID, 1, "0x00");
-
-    // Whitelist all tokens by default to make existing tests work
-    await whitelistTokens([dai.target, nft721.target, nft1155.target], true);
-  });
-
-  // Helper Functions
-
-  /** Encodes extra data for dispute creation with token gating parameters */
-  const encodeExtraData = (
-    courtId: number,
-    minJurors: BigNumberish,
-    disputeKitId: number,
-    tokenGate: string | Addressable,
-    isERC1155: boolean,
-    tokenId: BigNumberish
-  ) => {
-    // Packing of tokenGate and isERC1155
-    // uint88 (padding 11 bytes) + bool (1 byte) + address (20 bytes) = 32 bytes
-    const packed = ethers.solidityPacked(["uint88", "bool", "address"], [0, isERC1155, tokenGate]);
-    return ethers.AbiCoder.defaultAbiCoder().encode(
-      ["uint256", "uint256", "uint256", "bytes32", "uint256"],
-      [courtId, minJurors, disputeKitId, packed, tokenId]
-    );
-  };
-
-  /** Adds or removes tokens from the whitelist */
-  const whitelistTokens = async (tokens: (string | Addressable)[], supported: boolean = true) => {
-    const tokenAddresses = tokens.map((token) => (typeof token === "string" ? token : token.toString()));
-    return disputeKitGated.changeSupportedTokens(tokenAddresses, supported);
-  };
-
-  /** Creates a dispute with the specified token gate */
-  const createDisputeWithToken = async (
-    token: string | Addressable,
-    isERC1155: boolean = false,
-    tokenId: BigNumberish = 0
-  ) => {
-    const extraData = encodeExtraData(Courts.GENERAL, 3, gatedDisputeKitID, token, isERC1155, tokenId);
-    const arbitrationCost = await core["arbitrationCost(bytes)"](extraData);
-    return core["createDispute(uint256,bytes)"](2, extraData, { value: arbitrationCost });
-  };
-
-  /** Asserts whether a token is supported or not */
-  const expectTokenSupported = async (token: string | Addressable, supported: boolean) => {
-    const tokenAddress = typeof token === "string" ? token : token.toString();
-    expect(await disputeKitGated.supportedTokens(tokenAddress)).to.equal(supported);
-  };
-
-  const stakeAndDraw = async (
-    courtId: number,
-    minJurors: BigNumberish,
-    disputeKitId: number,
-    tokenGate: string | Addressable,
-    isERC1155: boolean,
-    tokenId: BigNumberish
-  ) => {
-    // Stake jurors
-    for (const juror of [juror1, juror2]) {
-      await pnk.transfer(juror.address, thousandPNK(10)).then((tx) => tx.wait());
-      expect(await pnk.balanceOf(juror.address)).to.equal(thousandPNK(10));
-
-      await pnk
-        .connect(juror)
-        .approve(core.target, thousandPNK(10), { gasLimit: 300000 })
-        .then((tx) => tx.wait());
-
-      await core
-        .connect(juror)
-        .setStake(Courts.GENERAL, thousandPNK(10), { gasLimit: 500000 })
-        .then((tx) => tx.wait());
-
-      expect(await sortitionModule.getJurorBalance(juror.address, 1)).to.deep.equal([
-        thousandPNK(10), // totalStaked
-        0, // totalLocked
-        thousandPNK(10), // stakedInCourt
-        1, // nbOfCourts
-      ]);
-    }
-
-    const extraData = encodeExtraData(courtId, minJurors, disputeKitId, tokenGate, isERC1155, tokenId);
-    // console.log("extraData", extraData);
-
-    const tokenInfo = await disputeKitGated.extraDataToTokenInfo(extraData);
-    expect(tokenInfo[0]).to.equal(tokenGate);
-    expect(tokenInfo[1]).to.equal(isERC1155);
-    expect(tokenInfo[2]).to.equal(tokenId);
-
-    const arbitrationCost = await core["arbitrationCost(bytes)"](extraData);
-
-    // Warning: this dispute cannot be executed, in reality it should be created by an arbitrable contract, not an EOA.
-    const tx = await core["createDispute(uint256,bytes)"](2, extraData, { value: arbitrationCost }).then((tx) =>
-      tx.wait()
-    );
-    const disputeId = 0;
-    // console.log(tx?.logs);
-
-    await network.provider.send("evm_increaseTime", [2000]); // Wait for minStakingTime
-    await network.provider.send("evm_mine");
-    await sortitionModule.passPhase().then((tx) => tx.wait()); // Staking -> Generating
-
-    await sortitionModule.passPhase().then((tx) => tx.wait()); // Generating -> Drawing
-    return core.draw(disputeId, 70, { gasLimit: 10000000 });
-  };
-
-  describe("Token Whitelist Management", async () => {
-    describe("changeSupportedTokens function", async () => {
-      it("Should allow owner to whitelist single token", async () => {
-        await whitelistTokens([dai.target], true);
-        await expectTokenSupported(dai.target, true);
-      });
-
-      it("Should allow owner to whitelist multiple tokens", async () => {
-        await whitelistTokens([dai.target, nft721.target, nft1155.target], true);
-        await expectTokenSupported(dai.target, true);
-        await expectTokenSupported(nft721.target, true);
-        await expectTokenSupported(nft1155.target, true);
-      });
-
-      it("Should allow owner to remove single token from whitelist", async () => {
-        await whitelistTokens([dai.target], true);
-        await expectTokenSupported(dai.target, true);
-
-        await whitelistTokens([dai.target], false);
-        await expectTokenSupported(dai.target, false);
-      });
-
-      it("Should allow owner to remove multiple tokens from whitelist", async () => {
-        await whitelistTokens([dai.target, nft721.target], true);
-        await expectTokenSupported(dai.target, true);
-        await expectTokenSupported(nft721.target, true);
-
-        await whitelistTokens([dai.target, nft721.target], false);
-        await expectTokenSupported(dai.target, false);
-        await expectTokenSupported(nft721.target, false);
-      });
-
-      it("Should handle mixed operations (add some, remove some)", async () => {
-        await whitelistTokens([dai.target, nft721.target], true);
-        await expectTokenSupported(dai.target, true);
-        await expectTokenSupported(nft721.target, true);
-
-        await whitelistTokens([dai.target], false);
-        await whitelistTokens([nft1155.target], true);
-
-        await expectTokenSupported(dai.target, false);
-        await expectTokenSupported(nft721.target, true);
-        await expectTokenSupported(nft1155.target, true);
-      });
-
-      it("Should handle duplicate operations correctly", async () => {
-        // Whitelist token twice - should not revert
-        await whitelistTokens([dai.target], true);
-        await whitelistTokens([dai.target], true);
-        await expectTokenSupported(dai.target, true);
-
-        // Remove token twice - should not revert
-        await whitelistTokens([dai.target], false);
-        await whitelistTokens([dai.target], false);
-        await expectTokenSupported(dai.target, false);
-      });
-    });
-
-    describe("Access Control", async () => {
-      it("Should revert when non-owner tries to change supported tokens", async () => {
-        await expect(disputeKitGated.connect(juror1).changeSupportedTokens([dai.target], true)).to.be.reverted;
-      });
-
-      it("Should revert when non-owner tries to remove supported tokens", async () => {
-        // First whitelist as owner
-        await whitelistTokens([dai.target], true);
-
-        // Then try to remove as non-owner
-        await expect(disputeKitGated.connect(juror1).changeSupportedTokens([dai.target], false)).to.be.reverted;
-      });
-    });
+    context = await setupTokenGatedTest({ contractName: "DisputeKitGatedMock" });
   });
 
-  describe("Error Handling - Unsupported Tokens", async () => {
-    it("Should revert with TokenNotSupported when creating dispute with unsupported ERC20", async () => {
-      await whitelistTokens([dai.target], false);
-
-      await expect(createDisputeWithToken(dai.target))
-        .to.be.revertedWithCustomError(disputeKitGated, "TokenNotSupported")
-        .withArgs(dai.target);
-    });
-
-    it("Should revert with TokenNotSupported when creating dispute with unsupported ERC721", async () => {
-      await whitelistTokens([nft721.target], false);
-
-      await expect(createDisputeWithToken(nft721.target))
-        .to.be.revertedWithCustomError(disputeKitGated, "TokenNotSupported")
-        .withArgs(nft721.target);
-    });
-
-    it("Should revert with TokenNotSupported when creating dispute with unsupported ERC1155", async () => {
-      await whitelistTokens([nft1155.target], false);
-
-      await expect(createDisputeWithToken(nft1155.target, true, TOKEN_ID))
-        .to.be.revertedWithCustomError(disputeKitGated, "TokenNotSupported")
-        .withArgs(nft1155.target);
-    });
-
-    it("Should allow dispute creation after token is whitelisted", async () => {
-      await whitelistTokens([dai.target], false);
-
-      await expect(createDisputeWithToken(dai.target)).to.be.revertedWithCustomError(
-        disputeKitGated,
-        "TokenNotSupported"
-      );
-
-      await whitelistTokens([dai.target], true);
-
-      await expect(createDisputeWithToken(dai.target)).to.not.be.reverted;
-    });
-  });
-
-  describe("When gating with DAI token", async () => {
-    it("Should draw no juror if they don't have any DAI balance", async () => {
-      const nbOfJurors = 15n;
-      const tx = await stakeAndDraw(Courts.GENERAL, nbOfJurors, gatedDisputeKitID, dai.target, false, 0).then((tx) =>
-        tx.wait()
-      );
-
-      // Ensure that no juror is drawn
-      const drawLogs =
-        tx?.logs.filter((log: any) => log.fragment?.name === "Draw" && log.address === core.target) || [];
-      expect(drawLogs).to.have.length(0);
-    });
-
-    it("Should draw only the jurors who have some DAI balance", async () => {
-      dai.transfer(juror1.address, 1);
-
-      const nbOfJurors = 15n;
-      const tx = await stakeAndDraw(Courts.GENERAL, nbOfJurors, gatedDisputeKitID, dai.target, false, 0).then((tx) =>
-        tx.wait()
-      );
-
-      // Ensure that only juror1 is drawn
-      const drawLogs =
-        tx?.logs.filter((log: any) => log.fragment?.name === "Draw" && log.address === core.target) || [];
-      expect(drawLogs).to.have.length(nbOfJurors);
-      drawLogs.forEach((log: any) => {
-        expect(log.args[0]).to.equal(juror1.address);
-      });
-
-      // Ensure that juror1 has PNK locked
-      expect(await sortitionModule.getJurorBalance(juror1.address, Courts.GENERAL)).to.deep.equal([
-        thousandPNK(10), // totalStaked
-        minStake * nbOfJurors, // totalLocked
-        thousandPNK(10), // stakedInCourt
-        1, // nbOfCourts
-      ]);
-
-      // Ensure that juror2 has no PNK locked
-      expect(await sortitionModule.getJurorBalance(juror2.address, Courts.GENERAL)).to.deep.equal([
-        thousandPNK(10), // totalStaked
-        0, // totalLocked
-        thousandPNK(10), // stakedInCourt
-        1, // nbOfCourts
-      ]);
-    });
-  });
-
-  describe("When gating with ERC721 token", async () => {
-    it("Should draw no juror if they don't own the ERC721 token", async () => {
-      const nbOfJurors = 15n;
-      const tx = await stakeAndDraw(Courts.GENERAL, nbOfJurors, gatedDisputeKitID, nft721.target, false, 0).then((tx) =>
-        tx.wait()
-      );
-
-      // Ensure that no juror is drawn
-      const drawLogs =
-        tx?.logs.filter((log: any) => log.fragment?.name === "Draw" && log.address === core.target) || [];
-      expect(drawLogs).to.have.length(0);
-    });
-
-    it("Should draw only the jurors owning the ERC721 token", async () => {
-      await nft721.safeMint(juror2.address);
-
-      const nbOfJurors = 15n;
-      const tx = await stakeAndDraw(Courts.GENERAL, nbOfJurors, gatedDisputeKitID, nft721.target, false, 0).then((tx) =>
-        tx.wait()
-      );
-
-      // Ensure that only juror2 is drawn
-      const drawLogs =
-        tx?.logs.filter((log: any) => log.fragment?.name === "Draw" && log.address === core.target) || [];
-      expect(drawLogs).to.have.length(nbOfJurors);
-      drawLogs.forEach((log: any) => {
-        expect(log.args[0]).to.equal(juror2.address);
-      });
-
-      // Ensure that juror1 is has no PNK locked
-      expect(await sortitionModule.getJurorBalance(juror1.address, Courts.GENERAL)).to.deep.equal([
-        thousandPNK(10), // totalStaked
-        0, // totalLocked
-        thousandPNK(10), // stakedInCourt
-        1, // nbOfCourts
-      ]);
-
-      // Ensure that juror2 has PNK locked
-      expect(await sortitionModule.getJurorBalance(juror2.address, Courts.GENERAL)).to.deep.equal([
-        thousandPNK(10), // totalStaked
-        minStake * nbOfJurors, // totalLocked
-        thousandPNK(10), // stakedInCourt
-        1, // nbOfCourts
-      ]);
-    });
-  });
-
-  describe("When gating with ERC1155 token", async () => {
-    it("Should draw no juror if they don't own the ERC1155 token", async () => {
-      const nbOfJurors = 15n;
-      const tx = await stakeAndDraw(Courts.GENERAL, nbOfJurors, gatedDisputeKitID, nft1155.target, true, TOKEN_ID).then(
-        (tx) => tx.wait()
-      );
-
-      // Ensure that no juror is drawn
-      const drawLogs =
-        tx?.logs.filter((log: any) => log.fragment?.name === "Draw" && log.address === core.target) || [];
-      expect(drawLogs).to.have.length(0);
-    });
-
-    it("Should draw only the jurors owning the ERC1155 token", async () => {
-      await nft1155.mint(juror2.address, TOKEN_ID, 1, "0x00");
-
-      const nbOfJurors = 15n;
-      const tx = await stakeAndDraw(Courts.GENERAL, nbOfJurors, gatedDisputeKitID, nft1155.target, true, TOKEN_ID).then(
-        (tx) => tx.wait()
-      );
-
-      // Ensure that only juror2 is drawn
-      const drawLogs =
-        tx?.logs.filter((log: any) => log.fragment?.name === "Draw" && log.address === core.target) || [];
-      expect(drawLogs).to.have.length(nbOfJurors);
-      drawLogs.forEach((log: any) => {
-        expect(log.args[0]).to.equal(juror2.address);
-      });
-
-      // Ensure that juror1 is has no PNK locked
-      expect(await sortitionModule.getJurorBalance(juror1.address, Courts.GENERAL)).to.deep.equal([
-        thousandPNK(10), // totalStaked
-        0, // totalLocked
-        thousandPNK(10), // stakedInCourt
-        1, // nbOfCourts
-      ]);
-
-      // Ensure that juror2 has PNK locked
-      expect(await sortitionModule.getJurorBalance(juror2.address, Courts.GENERAL)).to.deep.equal([
-        thousandPNK(10), // totalStaked
-        minStake * nbOfJurors, // totalLocked
-        thousandPNK(10), // stakedInCourt
-        1, // nbOfCourts
-      ]);
-    });
-  });
-
-  describe("Whitelist Integration Tests", async () => {
-    it("Should allow new disputes after whitelisting a token", async () => {
-      // Whitelist DAI token
-      await whitelistTokens([dai.target], true);
-
-      // Transfer DAI to juror1 for token gating
-      await dai.transfer(juror1.address, 1);
-
-      const nbOfJurors = 3n;
-      const tx = await stakeAndDraw(Courts.GENERAL, nbOfJurors, gatedDisputeKitID, dai.target, false, 0).then((tx) =>
-        tx.wait()
-      );
-
-      // Verify dispute was created and juror drawn
-      const drawLogs =
-        tx?.logs.filter((log: any) => log.fragment?.name === "Draw" && log.address === core.target) || [];
-      expect(drawLogs).to.have.length(nbOfJurors);
-    });
-
-    it("Should prevent new disputes after removing token from whitelist", async () => {
-      await whitelistTokens([dai.target], true);
-      await dai.transfer(juror1.address, 1);
-
-      // Create first dispute (should work)
-      await expect(createDisputeWithToken(dai.target)).to.not.be.reverted;
-
-      // Remove token from whitelist
-      await whitelistTokens([dai.target], false);
-
-      // Try to create another dispute (should fail)
-      await expect(createDisputeWithToken(dai.target))
-        .to.be.revertedWithCustomError(disputeKitGated, "TokenNotSupported")
-        .withArgs(dai.target);
-    });
-
-    it("Should maintain whitelist state correctly across multiple operations", async () => {
-      const tokens = [dai.target, nft721.target, nft1155.target];
-
-      // All tokens should already be supported from the main setup
-      for (const token of tokens) {
-        await expectTokenSupported(token, true);
-      }
-
-      // Remove middle token
-      await whitelistTokens([nft721.target], false);
-      await expectTokenSupported(dai.target, true);
-      await expectTokenSupported(nft721.target, false);
-      await expectTokenSupported(nft1155.target, true);
-
-      // Re-add middle token
-      await whitelistTokens([nft721.target], true);
-      for (const token of tokens) {
-        await expectTokenSupported(token, true);
-      }
-    });
-  });
+  // Run all shared tests with the context
+  testTokenWhitelistManagement(() => context);
+  testAccessControl(() => context);
+  testUnsupportedTokenErrors(() => context);
+  testERC20Gating(() => context);
+  testERC721Gating(() => context);
+  testERC1155Gating(() => context);
+  testWhitelistIntegration(() => context);
 });
diff --git a/contracts/test/arbitration/dispute-kit-shutter.ts b/contracts/test/arbitration/dispute-kit-shutter.ts
index aab7efa58..facf932e3 100644
--- a/contracts/test/arbitration/dispute-kit-shutter.ts
+++ b/contracts/test/arbitration/dispute-kit-shutter.ts
@@ -1,733 +1,38 @@
-import { deployments, ethers, getNamedAccounts, network } from "hardhat";
-import { toBigInt, BigNumberish } from "ethers";
-import { PNK, KlerosCore, SortitionModule, IncrementalNG, DisputeKitShutter } from "../../typechain-types";
-import { expect } from "chai";
-import { Courts } from "../../deploy/utils";
-import { HardhatEthersSigner } from "@nomicfoundation/hardhat-ethers/signers";
+import {
+  setupShutterTest,
+  testCommitPhase,
+  testNormalFlowBotReveals,
+  testRecoveryFlowJurorReveals,
+  testHashFunctionBehavior,
+  testEdgeCasesAndSecurity,
+  ShutterTestContext,
+} from "./helpers/dispute-kit-shutter-common";
 
 /* eslint-disable no-unused-vars */
-/* eslint-disable no-unused-expressions */ // https://github.com/standard/standard/issues/690#issuecomment-278533482
-
+/* eslint-disable no-unused-expressions */
+
+/**
+ * Test suite for DisputeKitShutter - implements shielded voting with commit-reveal mechanism
+ * using the Shutter protocol for encrypted vote storage and decryption.
+ *
+ * Tests cover:
+ * - Commit phase with recovery commitments
+ * - Normal flow where bot reveals votes
+ * - Recovery flow where jurors reveal their own votes
+ * - Hash function behavior for different callers
+ * - Edge cases and security considerations
+ */
 describe("DisputeKitShutter", async () => {
-  const ONE_THOUSAND_PNK = 10n ** 21n;
-  const thousandPNK = (amount: BigNumberish) => toBigInt(amount) * ONE_THOUSAND_PNK;
-
-  let deployer: string;
-  let juror1: HardhatEthersSigner;
-  let juror2: HardhatEthersSigner;
-  let bot: HardhatEthersSigner;
-  let attacker: HardhatEthersSigner;
-  let disputeKitShutter: DisputeKitShutter;
-  let pnk: PNK;
-  let core: KlerosCore;
-  let sortitionModule: SortitionModule;
-  let rng: IncrementalNG;
-  const RANDOM = 424242n;
-  const SHUTTER_DK_ID = 2;
-  const SHUTTER_COURT_ID = 2; // Court with hidden votes for testing
-
-  // Test data
-  const choice = 1n;
-  const salt = 12345n;
-  const justification = "This is my justification for the vote";
-  const identity = ethers.keccak256(ethers.toUtf8Bytes("shutter-identity"));
-  const encryptedVote = ethers.toUtf8Bytes("encrypted-vote-data");
+  let context: ShutterTestContext;
 
   beforeEach("Setup", async () => {
-    ({ deployer } = await getNamedAccounts());
-    [, juror1, juror2, bot, attacker] = await ethers.getSigners();
-
-    await deployments.fixture(["Arbitration", "VeaMock"], {
-      fallbackToGlobal: true,
-      keepExistingDeployments: false,
-    });
-    disputeKitShutter = await ethers.getContract<DisputeKitShutter>("DisputeKitShutter");
-    pnk = await ethers.getContract<PNK>("PNK");
-    core = await ethers.getContract<KlerosCore>("KlerosCore");
-    sortitionModule = await ethers.getContract<SortitionModule>("SortitionModule");
-
-    // Make the tests more deterministic with this dummy RNG
-    await deployments.deploy("IncrementalNG", {
-      from: deployer,
-      args: [RANDOM],
-      log: true,
-    });
-    rng = await ethers.getContract<IncrementalNG>("IncrementalNG");
-
-    await sortitionModule.changeRandomNumberGenerator(rng.target).then((tx) => tx.wait());
-
-    // Create a court with hidden votes enabled for testing DisputeKitShutter
-    // Parameters: parent, hiddenVotes, minStake, alpha, feeForJuror, jurorsForCourtJump, timesPerPeriod, sortitionExtraData, supportedDisputeKits
-    await core.createCourt(
-      Courts.GENERAL, // parent
-      true, // hiddenVotes - MUST be true for DisputeKitShutter
-      ethers.parseEther("200"), // minStake
-      10000, // alpha
-      ethers.parseEther("0.1"), // feeForJuror
-      16, // jurorsForCourtJump
-      [300, 300, 300, 300], // timesPerPeriod for evidence, commit, vote, appeal
-      ethers.toBeHex(5), // sortitionExtraData
-      [1, SHUTTER_DK_ID] // supportedDisputeKits - must include Classic (1) and Shutter (2)
-    );
-
-    // The new court ID should be 2 (after GENERAL court which is 1)
+    context = await setupShutterTest({ contractName: "DisputeKitShutter" });
   });
 
-  // ************************************* //
-  // *              Constants            * //
-  // ************************************* //
-
-  const enum Period {
-    evidence = 0,
-    commit = 1,
-    vote = 2,
-    appeal = 3,
-    execution = 4,
-  }
-
-  // ************************************* //
-  // *          Helper Functions         * //
-  // ************************************* //
-
-  const encodeExtraData = (courtId: BigNumberish, minJurors: BigNumberish, disputeKitId: number) =>
-    ethers.AbiCoder.defaultAbiCoder().encode(["uint256", "uint256", "uint256"], [courtId, minJurors, disputeKitId]);
-
-  const generateCommitments = (choice: bigint, salt: bigint, justification: string) => {
-    // Recovery commitment: hash(choice, salt) - no justification
-    const recoveryCommit = ethers.keccak256(
-      ethers.AbiCoder.defaultAbiCoder().encode(["uint256", "uint256"], [choice, salt])
-    );
-
-    // Full commitment: hash(choice, salt, justificationHash)
-    const justificationHash = ethers.keccak256(ethers.toUtf8Bytes(justification));
-    const fullCommit = ethers.keccak256(
-      ethers.AbiCoder.defaultAbiCoder().encode(["uint256", "uint256", "bytes32"], [choice, salt, justificationHash])
-    );
-
-    return { fullCommit, recoveryCommit };
-  };
-
-  const createDisputeAndDraw = async (courtId: BigNumberish, minJurors: BigNumberish, disputeKitId: number) => {
-    // Stake jurors
-    for (const juror of [juror1, juror2]) {
-      await pnk.transfer(juror.address, thousandPNK(10)).then((tx) => tx.wait());
-      expect(await pnk.balanceOf(juror.address)).to.equal(thousandPNK(10));
-
-      await pnk
-        .connect(juror)
-        .approve(core.target, thousandPNK(10), { gasLimit: 300000 })
-        .then((tx) => tx.wait());
-
-      await core
-        .connect(juror)
-        .setStake(SHUTTER_COURT_ID, thousandPNK(10), { gasLimit: 500000 })
-        .then((tx) => tx.wait());
-
-      expect(await sortitionModule.getJurorBalance(juror.address, SHUTTER_COURT_ID)).to.deep.equal([
-        thousandPNK(10), // totalStaked
-        0, // totalLocked
-        thousandPNK(10), // stakedInCourt
-        1, // nbOfCourts
-      ]);
-    }
-
-    const extraData = encodeExtraData(courtId, minJurors, disputeKitId);
-    const arbitrationCost = await core["arbitrationCost(bytes)"](extraData);
-
-    // Create dispute via core contract
-    await core["createDispute(uint256,bytes)"](2, extraData, { value: arbitrationCost }).then((tx) => tx.wait());
-    const disputeId = 0;
-
-    await network.provider.send("evm_increaseTime", [2000]); // Wait for minStakingTime
-    await network.provider.send("evm_mine");
-    await sortitionModule.passPhase().then((tx) => tx.wait()); // Staking -> Generating
-
-    await sortitionModule.passPhase().then((tx) => tx.wait()); // Generating -> Drawing
-    await core.draw(disputeId, 70, { gasLimit: 10000000 });
-
-    return disputeId;
-  };
-
-  const advanceToCommitPeriod = async (disputeId: number) => {
-    // Advance from evidence to commit period
-    await core.passPeriod(disputeId).then((tx) => tx.wait());
-
-    // Verify we're in commit period
-    const dispute = await core.disputes(disputeId);
-    expect(dispute[2]).to.equal(Period.commit); // period is at index 2
-  };
-
-  const advanceToVotePeriod = async (disputeId: number) => {
-    // Advance from commit to vote period
-    const dispute = await core.disputes(disputeId);
-    const courtId = dispute[0]; // courtID is at index 0
-    const court = await core.courts(courtId);
-    // Court struct: parent, hiddenVotes, children[], minStake, alpha, feeForJuror, jurorsForCourtJump, disabled, timesPerPeriod[]
-    // timesPerPeriod is a mapping, we need to check the actual structure
-    const timesPerPeriod = [300, 300, 300, 300]; // Default times from deployment
-    const commitPeriod = timesPerPeriod[Period.commit];
-
-    await network.provider.send("evm_increaseTime", [Number(commitPeriod)]);
-    await network.provider.send("evm_mine");
-
-    await core.passPeriod(disputeId).then((tx) => tx.wait());
-
-    // Verify we're in vote period
-    const updatedDispute = await core.disputes(disputeId);
-    expect(updatedDispute[2]).to.equal(Period.vote); // period is at index 2
-  };
-
-  const getVoteIDsForJuror = async (disputeId: number, juror: HardhatEthersSigner) => {
-    const localDisputeId = await disputeKitShutter.coreDisputeIDToLocal(disputeId);
-    const nbRounds = await disputeKitShutter.getNumberOfRounds(localDisputeId);
-    const roundIndex = Number(nbRounds) - 1;
-
-    // Get all votes for this round and filter by juror
-    const voteIDs: bigint[] = [];
-    const maxVotes = 10; // Reasonable limit for testing
-
-    for (let i = 0; i < maxVotes; i++) {
-      try {
-        const voteInfo = await disputeKitShutter.getVoteInfo(disputeId, roundIndex, i);
-        if (voteInfo[0] === juror.address) {
-          // account is at index 0
-          voteIDs.push(BigInt(i));
-        }
-      } catch {
-        // No more votes
-        break;
-      }
-    }
-
-    return voteIDs;
-  };
-
-  // ************************************* //
-  // *              Tests                * //
-  // ************************************* //
-
-  describe("Commit Phase - castCommitShutter()", () => {
-    describe("Successful commits", () => {
-      it("Should allow juror to commit vote with recovery commitment", async () => {
-        // Use the court with hidden votes (court ID 2)
-        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
-        await advanceToCommitPeriod(disputeId);
-
-        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-        expect(voteIDs.length).to.be.greaterThan(0);
-
-        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
-
-        await expect(
-          disputeKitShutter
-            .connect(juror1)
-            .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote)
-        )
-          .to.emit(disputeKitShutter, "CommitCastShutter")
-          .withArgs(disputeId, juror1.address, fullCommit, recoveryCommit, identity, encryptedVote);
-
-        // Verify recovery commitment was stored
-        const localDisputeId = await disputeKitShutter.coreDisputeIDToLocal(disputeId);
-        const storedRecoveryCommit = await disputeKitShutter.recoveryCommitments(localDisputeId, 0, voteIDs[0]);
-        expect(storedRecoveryCommit).to.equal(recoveryCommit);
-      });
-
-      it("Should allow juror to update commitment multiple times", async () => {
-        // Use the court with hidden votes (court ID 2)
-        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
-        await advanceToCommitPeriod(disputeId);
-
-        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-
-        // First commitment
-        const { fullCommit: commit1, recoveryCommit: recovery1 } = generateCommitments(1n, 111n, "First justification");
-        await disputeKitShutter
-          .connect(juror1)
-          .castCommitShutter(disputeId, voteIDs, commit1, recovery1, identity, encryptedVote);
-
-        // Second commitment (overwrites first)
-        const { fullCommit: commit2, recoveryCommit: recovery2 } = generateCommitments(
-          2n,
-          222n,
-          "Second justification"
-        );
-        await disputeKitShutter
-          .connect(juror1)
-          .castCommitShutter(disputeId, voteIDs, commit2, recovery2, identity, encryptedVote);
-
-        // Verify only the second commitment is stored
-        const localDisputeId = await disputeKitShutter.coreDisputeIDToLocal(disputeId);
-        const storedRecoveryCommit = await disputeKitShutter.recoveryCommitments(localDisputeId, 0, voteIDs[0]);
-        expect(storedRecoveryCommit).to.equal(recovery2);
-      });
-    });
-
-    describe("Failed commits", () => {
-      it("Should revert if recovery commitment is empty", async () => {
-        // Use the court with hidden votes (court ID 2)
-        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
-        await advanceToCommitPeriod(disputeId);
-
-        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-        const { fullCommit } = generateCommitments(choice, salt, justification);
-
-        await expect(
-          disputeKitShutter.connect(juror1).castCommitShutter(
-            disputeId,
-            voteIDs,
-            fullCommit,
-            ethers.ZeroHash, // Empty recovery commit
-            identity,
-            encryptedVote
-          )
-        ).to.be.revertedWithCustomError(disputeKitShutter, "EmptyRecoveryCommit");
-      });
-
-      it("Should revert if not in commit period", async () => {
-        // Use the court with hidden votes (court ID 2)
-        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
-        // Still in evidence period
-
-        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
-
-        await expect(
-          disputeKitShutter
-            .connect(juror1)
-            .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote)
-        ).to.be.revertedWithCustomError(disputeKitShutter, "NotCommitPeriod");
-      });
-
-      it("Should revert if juror doesn't own the vote", async () => {
-        // Use the court with hidden votes (court ID 2)
-        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
-        await advanceToCommitPeriod(disputeId);
-
-        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
-
-        await expect(
-          disputeKitShutter.connect(juror2).castCommitShutter(
-            disputeId,
-            voteIDs, // Using juror1's vote IDs
-            fullCommit,
-            recoveryCommit,
-            identity,
-            encryptedVote
-          )
-        ).to.be.revertedWithCustomError(disputeKitShutter, "JurorHasToOwnTheVote");
-      });
-    });
-  });
-
-  describe("Normal Flow - Bot Reveals", () => {
-    describe("Successful reveals", () => {
-      it("Should allow bot to reveal vote with full justification", async () => {
-        // Use the court with hidden votes (court ID 2)
-        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
-        await advanceToCommitPeriod(disputeId);
-
-        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
-
-        // Juror commits
-        await disputeKitShutter
-          .connect(juror1)
-          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
-
-        await advanceToVotePeriod(disputeId);
-
-        // Bot reveals vote
-        await expect(disputeKitShutter.connect(bot).castVoteShutter(disputeId, voteIDs, choice, salt, justification))
-          .to.emit(disputeKitShutter, "VoteCast")
-          .withArgs(disputeId, juror1.address, voteIDs, choice, justification);
-
-        // Verify vote was counted
-        const voteInfo = await disputeKitShutter.getVoteInfo(disputeId, 0, Number(voteIDs[0]));
-        expect(voteInfo[3]).to.be.true; // voted is at index 3
-        expect(voteInfo[2]).to.equal(choice); // choice is at index 2
-      });
-    });
-
-    describe("Failed reveals", () => {
-      it("Should revert if wrong choice provided", async () => {
-        // Use the court with hidden votes (court ID 2)
-        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
-        await advanceToCommitPeriod(disputeId);
-
-        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
-
-        await disputeKitShutter
-          .connect(juror1)
-          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
-
-        await advanceToVotePeriod(disputeId);
-
-        const wrongChoice = 2n;
-        await expect(
-          disputeKitShutter.connect(bot).castVoteShutter(
-            disputeId,
-            voteIDs,
-            wrongChoice, // Wrong choice
-            salt,
-            justification
-          )
-        ).to.be.revertedWithCustomError(disputeKitShutter, "HashDoesNotMatchHiddenVoteCommitment");
-      });
-
-      it("Should revert if wrong salt provided", async () => {
-        // Use the court with hidden votes (court ID 2)
-        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
-        await advanceToCommitPeriod(disputeId);
-
-        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
-
-        await disputeKitShutter
-          .connect(juror1)
-          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
-
-        await advanceToVotePeriod(disputeId);
-
-        const wrongSalt = 99999n;
-        await expect(
-          disputeKitShutter.connect(bot).castVoteShutter(
-            disputeId,
-            voteIDs,
-            choice,
-            wrongSalt, // Wrong salt
-            justification
-          )
-        ).to.be.revertedWithCustomError(disputeKitShutter, "HashDoesNotMatchHiddenVoteCommitment");
-      });
-
-      it("Should revert if wrong justification provided", async () => {
-        // Use the court with hidden votes (court ID 2)
-        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
-        await advanceToCommitPeriod(disputeId);
-
-        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
-
-        await disputeKitShutter
-          .connect(juror1)
-          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
-
-        await advanceToVotePeriod(disputeId);
-
-        const wrongJustification = "Wrong justification";
-        await expect(
-          disputeKitShutter.connect(bot).castVoteShutter(
-            disputeId,
-            voteIDs,
-            choice,
-            salt,
-            wrongJustification // Wrong justification
-          )
-        ).to.be.revertedWithCustomError(disputeKitShutter, "HashDoesNotMatchHiddenVoteCommitment");
-      });
-
-      it("Should revert if vote already cast", async () => {
-        // Use the court with hidden votes (court ID 2)
-        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
-        await advanceToCommitPeriod(disputeId);
-
-        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
-
-        await disputeKitShutter
-          .connect(juror1)
-          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
-
-        await advanceToVotePeriod(disputeId);
-
-        // First vote succeeds
-        await disputeKitShutter.connect(bot).castVoteShutter(disputeId, voteIDs, choice, salt, justification);
-
-        // Second vote fails
-        await expect(
-          disputeKitShutter.connect(bot).castVoteShutter(disputeId, voteIDs, choice, salt, justification)
-        ).to.be.revertedWithCustomError(disputeKitShutter, "VoteAlreadyCast");
-      });
-    });
-  });
-
-  describe("Recovery Flow - Juror Reveals", () => {
-    describe("Successful recovery reveals", () => {
-      it("Should allow juror to recover vote without justification", async () => {
-        // Use the court with hidden votes (court ID 2)
-        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
-        await advanceToCommitPeriod(disputeId);
-
-        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
-
-        // Juror commits
-        await disputeKitShutter
-          .connect(juror1)
-          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
-
-        await advanceToVotePeriod(disputeId);
-
-        // Juror reveals vote (Shutter failed, so juror must reveal)
-        // Note: justification can be anything as it won't be validated
-        await expect(
-          disputeKitShutter.connect(juror1).castVoteShutter(
-            disputeId,
-            voteIDs,
-            choice,
-            salt,
-            "" // Empty justification is fine for recovery
-          )
-        )
-          .to.emit(disputeKitShutter, "VoteCast")
-          .withArgs(disputeId, juror1.address, voteIDs, choice, "");
-
-        // Verify vote was counted
-        const voteInfo = await disputeKitShutter.getVoteInfo(disputeId, 0, Number(voteIDs[0]));
-        expect(voteInfo[3]).to.be.true; // voted is at index 3
-        expect(voteInfo[2]).to.equal(choice); // choice is at index 2
-      });
-
-      it("Should validate against recovery commitment when juror reveals", async () => {
-        // Use the court with hidden votes (court ID 2)
-        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
-        await advanceToCommitPeriod(disputeId);
-
-        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
-
-        await disputeKitShutter
-          .connect(juror1)
-          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
-
-        await advanceToVotePeriod(disputeId);
-
-        // Juror can provide any justification - it won't be validated
-        const differentJustification = "This is a different justification that won't be checked";
-        await expect(
-          disputeKitShutter.connect(juror1).castVoteShutter(
-            disputeId,
-            voteIDs,
-            choice,
-            salt,
-            differentJustification // Different justification is OK for recovery
-          )
-        ).to.not.be.reverted;
-      });
-    });
-
-    describe("Failed recovery reveals", () => {
-      it("Should revert if wrong choice in recovery", async () => {
-        // Use the court with hidden votes (court ID 2)
-        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
-        await advanceToCommitPeriod(disputeId);
-
-        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
-
-        await disputeKitShutter
-          .connect(juror1)
-          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
-
-        await advanceToVotePeriod(disputeId);
-
-        const wrongChoice = 2n;
-        await expect(
-          disputeKitShutter.connect(juror1).castVoteShutter(
-            disputeId,
-            voteIDs,
-            wrongChoice, // Wrong choice
-            salt,
-            ""
-          )
-        ).to.be.revertedWithCustomError(disputeKitShutter, "HashDoesNotMatchHiddenVoteCommitment");
-      });
-
-      it("Should revert if wrong salt in recovery", async () => {
-        // Use the court with hidden votes (court ID 2)
-        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
-        await advanceToCommitPeriod(disputeId);
-
-        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
-
-        await disputeKitShutter
-          .connect(juror1)
-          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
-
-        await advanceToVotePeriod(disputeId);
-
-        const wrongSalt = 99999n;
-        await expect(
-          disputeKitShutter.connect(juror1).castVoteShutter(
-            disputeId,
-            voteIDs,
-            choice,
-            wrongSalt, // Wrong salt
-            ""
-          )
-        ).to.be.revertedWithCustomError(disputeKitShutter, "HashDoesNotMatchHiddenVoteCommitment");
-      });
-
-      it("Should revert if non-juror tries to reveal without correct full commitment", async () => {
-        // Use the court with hidden votes (court ID 2)
-        const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
-        await advanceToCommitPeriod(disputeId);
-
-        const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-        const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
-
-        await disputeKitShutter
-          .connect(juror1)
-          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
-
-        await advanceToVotePeriod(disputeId);
-
-        // Attacker tries to reveal with only choice and salt (no justification)
-        await expect(
-          disputeKitShutter.connect(attacker).castVoteShutter(
-            disputeId,
-            voteIDs,
-            choice,
-            salt,
-            "" // No justification - would work for juror but not for others
-          )
-        ).to.be.revertedWithCustomError(disputeKitShutter, "HashDoesNotMatchHiddenVoteCommitment");
-      });
-    });
-  });
-
-  describe("Hash Function Behavior", () => {
-    it("Should return different hashes for juror vs non-juror callers", async () => {
-      const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
-      await advanceToCommitPeriod(disputeId);
-
-      const voteIDs = await getVoteIDsForJuror(disputeId, juror1);
-      const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
-
-      await disputeKitShutter
-        .connect(juror1)
-        .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, identity, encryptedVote);
-
-      await advanceToVotePeriod(disputeId);
-
-      // During castVoteShutter, the contract should use different hash logic
-      // For juror: hash(choice, salt)
-      // For non-juror: hash(choice, salt, justificationHash)
-
-      // This is tested implicitly by the recovery flow tests above
-      // The juror can reveal with any justification, while non-juror must provide exact justification
-    });
-
-    it("Should correctly compute hash for normal flow", async () => {
-      // Test hashVote function directly
-      const justificationHash = ethers.keccak256(ethers.toUtf8Bytes(justification));
-      const expectedHash = ethers.keccak256(
-        ethers.AbiCoder.defaultAbiCoder().encode(["uint256", "uint256", "bytes32"], [choice, salt, justificationHash])
-      );
-
-      // When called by non-juror (normal case), should include justification
-      const computedHash = await disputeKitShutter.hashVote(choice, salt, justification);
-      expect(computedHash).to.equal(expectedHash);
-    });
-  });
-
-  describe("Edge Cases and Security", () => {
-    it("Should handle mixed normal and recovery reveals in same dispute", async () => {
-      const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
-      await advanceToCommitPeriod(disputeId);
-
-      const voteIDsJuror1 = await getVoteIDsForJuror(disputeId, juror1);
-      const voteIDsJuror2 = await getVoteIDsForJuror(disputeId, juror2);
-
-      const { fullCommit: commit1, recoveryCommit: recovery1 } = generateCommitments(1n, 111n, "Juror 1 justification");
-      const { fullCommit: commit2, recoveryCommit: recovery2 } = generateCommitments(2n, 222n, "Juror 2 justification");
-
-      // Both jurors commit
-      await disputeKitShutter
-        .connect(juror1)
-        .castCommitShutter(disputeId, voteIDsJuror1, commit1, recovery1, identity, encryptedVote);
-
-      await disputeKitShutter
-        .connect(juror2)
-        .castCommitShutter(disputeId, voteIDsJuror2, commit2, recovery2, identity, encryptedVote);
-
-      await advanceToVotePeriod(disputeId);
-
-      // Juror1 uses recovery flow (Shutter failed for them)
-      await disputeKitShutter.connect(juror1).castVoteShutter(
-        disputeId,
-        voteIDsJuror1,
-        1n,
-        111n,
-        "Different justification" // Recovery doesn't check this
-      );
-
-      // Bot reveals juror2's vote normally
-      await disputeKitShutter.connect(bot).castVoteShutter(
-        disputeId,
-        voteIDsJuror2,
-        2n,
-        222n,
-        "Juror 2 justification" // Must match exactly
-      );
-
-      // Verify both votes were counted
-      const vote1Info = await disputeKitShutter.getVoteInfo(disputeId, 0, Number(voteIDsJuror1[0]));
-      const vote2Info = await disputeKitShutter.getVoteInfo(disputeId, 0, Number(voteIDsJuror2[0]));
-
-      expect(vote1Info[3]).to.be.true; // voted is at index 3
-      expect(vote1Info[2]).to.equal(1n); // choice is at index 2
-      expect(vote2Info[3]).to.be.true;
-      expect(vote2Info[2]).to.equal(2n);
-    });
-
-    it("Should allow anyone to reveal vote with correct data only", async () => {
-      const disputeId = await createDisputeAndDraw(2, 3, SHUTTER_DK_ID);
-      await advanceToCommitPeriod(disputeId);
-
-      const voteIDsJuror1 = await getVoteIDsForJuror(disputeId, juror1);
-      const { fullCommit, recoveryCommit } = generateCommitments(choice, salt, justification);
-
-      await disputeKitShutter
-        .connect(juror1)
-        .castCommitShutter(disputeId, voteIDsJuror1, fullCommit, recoveryCommit, identity, encryptedVote);
-
-      // Juror2 commits with a different choice
-      const differentChoice = 2n;
-      const voteIDsJuror2 = await getVoteIDsForJuror(disputeId, juror2);
-      const { fullCommit: commit2, recoveryCommit: recovery2 } = generateCommitments(
-        differentChoice,
-        salt,
-        justification
-      );
-
-      await disputeKitShutter
-        .connect(juror2)
-        .castCommitShutter(disputeId, voteIDsJuror2, commit2, recovery2, identity, encryptedVote);
-
-      await advanceToVotePeriod(disputeId);
-
-      // In normal Shutter operation, anyone (bot/attacker) can reveal the vote if they have the correct data
-      // This is by design - the security comes from the fact that only Shutter knows the decryption key
-      await expect(
-        disputeKitShutter.connect(attacker).castVoteShutter(disputeId, voteIDsJuror1, choice, salt, justification)
-      )
-        .to.emit(disputeKitShutter, "VoteCast")
-        .withArgs(disputeId, juror1.address, voteIDsJuror1, choice, justification);
-
-      // Attacker cannot change juror2's vote to a different choice
-      await expect(
-        disputeKitShutter.connect(attacker).castVoteShutter(
-          disputeId,
-          voteIDsJuror2,
-          1n, // Wrong choice
-          salt,
-          justification
-        )
-      ).to.be.revertedWithCustomError(disputeKitShutter, "HashDoesNotMatchHiddenVoteCommitment");
-    });
-  });
+  // Run all shared Shutter tests with the context
+  testCommitPhase(() => context);
+  testNormalFlowBotReveals(() => context);
+  testRecoveryFlowJurorReveals(() => context);
+  testHashFunctionBehavior(() => context);
+  testEdgeCasesAndSecurity(() => context);
 });
diff --git a/contracts/test/arbitration/helpers/dispute-kit-gated-common.ts b/contracts/test/arbitration/helpers/dispute-kit-gated-common.ts
new file mode 100644
index 000000000..2b829b2d9
--- /dev/null
+++ b/contracts/test/arbitration/helpers/dispute-kit-gated-common.ts
@@ -0,0 +1,625 @@
+import { deployments, ethers, getNamedAccounts, network } from "hardhat";
+import { toBigInt, BigNumberish, Addressable } from "ethers";
+import {
+  PNK,
+  KlerosCore,
+  SortitionModule,
+  IncrementalNG,
+  DisputeKitGatedMock,
+  DisputeKitGatedShutterMock,
+  TestERC20,
+  TestERC721,
+  TestERC1155,
+} from "../../../typechain-types";
+import { expect } from "chai";
+import { Courts } from "../../../deploy/utils";
+import { HardhatEthersSigner } from "@nomicfoundation/hardhat-ethers/signers";
+import { deployERC1155, deployERC721 } from "../../../deploy/utils/deployTokens";
+import { deployUpgradable } from "../../../deploy/utils/deployUpgradable";
+
+/* eslint-disable no-unused-vars */
+/* eslint-disable no-unused-expressions */ // https://github.com/standard/standard/issues/690#issuecomment-278533482
+
+// Type for the dispute kit (either DisputeKitGated or DisputeKitGatedShutter)
+export type DisputeKitGatedType = DisputeKitGatedMock | DisputeKitGatedShutterMock;
+
+// Test context interface that holds all the test state
+export interface TokenGatedTestContext {
+  deployer: string;
+  juror1: HardhatEthersSigner;
+  juror2: HardhatEthersSigner;
+  disputeKit: DisputeKitGatedType;
+  pnk: PNK;
+  dai: TestERC20;
+  core: KlerosCore;
+  sortitionModule: SortitionModule;
+  rng: IncrementalNG;
+  nft721: TestERC721;
+  nft1155: TestERC1155;
+  gatedDisputeKitID: number;
+  minStake: bigint;
+  RANDOM: bigint;
+  TOKEN_ID: number;
+  ONE_THOUSAND_PNK: bigint;
+  thousandPNK: (amount: BigNumberish) => bigint;
+  PNK: (amount: BigNumberish) => bigint;
+}
+
+// Configuration for setting up a token gated test
+export interface TokenGatedTestConfig {
+  contractName: string; // "DisputeKitGatedMock" or "DisputeKitGatedShutterMock"
+}
+
+// Constants for token amounts
+const ONE_THOUSAND_PNK = 10n ** 21n;
+const thousandPNK = (amount: BigNumberish) => toBigInt(amount) * ONE_THOUSAND_PNK;
+const PNK_AMOUNT = (amount: BigNumberish) => toBigInt(amount) * 10n ** 18n;
+
+// Helper function to encode extra data for dispute creation with token gating parameters
+export const encodeExtraData = (
+  courtId: BigNumberish,
+  minJurors: BigNumberish,
+  disputeKitId: number,
+  tokenGate: string | Addressable,
+  isERC1155: boolean,
+  tokenId: BigNumberish
+) => {
+  // Packing of tokenGate and isERC1155
+  // uint88 (padding 11 bytes) + bool (1 byte) + address (20 bytes) = 32 bytes
+  const packed = ethers.solidityPacked(["uint88", "bool", "address"], [0, isERC1155, tokenGate]);
+  return ethers.AbiCoder.defaultAbiCoder().encode(
+    ["uint256", "uint256", "uint256", "bytes32", "uint256"],
+    [courtId, minJurors, disputeKitId, packed, tokenId]
+  );
+};
+
+// Helper function to add or remove tokens from the whitelist
+export const whitelistTokens = async (
+  context: TokenGatedTestContext,
+  tokens: (string | Addressable)[],
+  supported: boolean = true
+) => {
+  const tokenAddresses = tokens.map((token) => (typeof token === "string" ? token : token.toString()));
+  return context.disputeKit.changeSupportedTokens(tokenAddresses, supported);
+};
+
+// Helper function to create a dispute with the specified token gate
+export const createDisputeWithToken = async (
+  context: TokenGatedTestContext,
+  token: string | Addressable,
+  isERC1155: boolean = false,
+  tokenId: BigNumberish = 0
+) => {
+  const extraData = encodeExtraData(Courts.GENERAL, 3, context.gatedDisputeKitID, token, isERC1155, tokenId);
+  const arbitrationCost = await context.core["arbitrationCost(bytes)"](extraData);
+  return context.core["createDispute(uint256,bytes)"](2, extraData, { value: arbitrationCost });
+};
+
+// Helper function to assert whether a token is supported or not
+export const expectTokenSupported = async (
+  context: TokenGatedTestContext,
+  token: string | Addressable,
+  supported: boolean
+) => {
+  const tokenAddress = typeof token === "string" ? token : token.toString();
+  expect(await context.disputeKit.supportedTokens(tokenAddress)).to.equal(supported);
+};
+
+// Helper function to stake and draw jurors
+export const stakeAndDraw = async (
+  context: TokenGatedTestContext,
+  courtId: number,
+  minJurors: BigNumberish,
+  disputeKitId: number,
+  tokenGate: string | Addressable,
+  isERC1155: boolean,
+  tokenId: BigNumberish
+) => {
+  // Stake jurors
+  for (const juror of [context.juror1, context.juror2]) {
+    await context.pnk.transfer(juror.address, context.thousandPNK(10)).then((tx) => tx.wait());
+    expect(await context.pnk.balanceOf(juror.address)).to.equal(context.thousandPNK(10));
+
+    await context.pnk
+      .connect(juror)
+      .approve(context.core.target, context.thousandPNK(10), { gasLimit: 300000 })
+      .then((tx) => tx.wait());
+
+    await context.core
+      .connect(juror)
+      .setStake(Courts.GENERAL, context.thousandPNK(10), { gasLimit: 500000 })
+      .then((tx) => tx.wait());
+
+    expect(await context.sortitionModule.getJurorBalance(juror.address, 1)).to.deep.equal([
+      context.thousandPNK(10), // totalStaked
+      0, // totalLocked
+      context.thousandPNK(10), // stakedInCourt
+      1, // nbOfCourts
+    ]);
+  }
+
+  const extraData = encodeExtraData(courtId, minJurors, disputeKitId, tokenGate, isERC1155, tokenId);
+
+  const tokenInfo = await context.disputeKit.extraDataToTokenInfo(extraData);
+  expect(tokenInfo[0]).to.equal(tokenGate);
+  expect(tokenInfo[1]).to.equal(isERC1155);
+  expect(tokenInfo[2]).to.equal(tokenId);
+
+  const arbitrationCost = await context.core["arbitrationCost(bytes)"](extraData);
+
+  // Warning: this dispute cannot be executed, in reality it should be created by an arbitrable contract, not an EOA.
+  const tx = await context.core["createDispute(uint256,bytes)"](2, extraData, { value: arbitrationCost }).then((tx) =>
+    tx.wait()
+  );
+  const disputeId = 0;
+
+  await network.provider.send("evm_increaseTime", [2000]); // Wait for minStakingTime
+  await network.provider.send("evm_mine");
+  await context.sortitionModule.passPhase().then((tx) => tx.wait()); // Staking -> Generating
+
+  await context.sortitionModule.passPhase().then((tx) => tx.wait()); // Generating -> Drawing
+  return context.core.draw(disputeId, 70, { gasLimit: 10000000 });
+};
+
+// Setup function that creates the test context
+export async function setupTokenGatedTest(config: TokenGatedTestConfig): Promise<TokenGatedTestContext> {
+  const { deployer } = await getNamedAccounts();
+  const [, juror1, juror2] = await ethers.getSigners();
+
+  await deployments.fixture(["Arbitration", "VeaMock"], {
+    fallbackToGlobal: true,
+    keepExistingDeployments: false,
+  });
+
+  const pnk = await ethers.getContract<PNK>("PNK");
+  const dai = await ethers.getContract<TestERC20>("DAI");
+  const weth = await ethers.getContract<TestERC20>("WETH");
+  const core = await ethers.getContract<KlerosCore>("KlerosCore");
+  const sortitionModule = await ethers.getContract<SortitionModule>("SortitionModule");
+
+  const deploymentResult = await deployUpgradable(deployments, config.contractName, {
+    from: deployer,
+    proxyAlias: "UUPSProxy",
+    args: [deployer, core.target, weth.target, 1],
+    log: true,
+  });
+  await core.addNewDisputeKit(deploymentResult.address);
+  const gatedDisputeKitID = Number((await core.getDisputeKitsLength()) - 1n);
+  await core.enableDisputeKits(Courts.GENERAL, [gatedDisputeKitID], true);
+
+  const disputeKit = await ethers.getContract<DisputeKitGatedType>(config.contractName);
+
+  // Make the tests more deterministic with this dummy RNG
+  await deployments.deploy("IncrementalNG", {
+    from: deployer,
+    args: [424242n],
+    log: true,
+  });
+  const rng = await ethers.getContract<IncrementalNG>("IncrementalNG");
+
+  await sortitionModule.changeRandomNumberGenerator(rng.target).then((tx) => tx.wait());
+
+  const hre = require("hardhat");
+  await deployERC721(hre, deployer, "TestERC721", "Nft721");
+  const nft721 = await ethers.getContract<TestERC721>("Nft721");
+
+  await deployERC1155(hre, deployer, "TestERC1155", "Nft1155");
+  const nft1155 = await ethers.getContract<TestERC1155>("Nft1155");
+  const TOKEN_ID = 888;
+  await nft1155.mint(deployer, TOKEN_ID, 1, "0x00");
+
+  const context: TokenGatedTestContext = {
+    deployer,
+    juror1,
+    juror2,
+    disputeKit,
+    pnk,
+    dai,
+    core,
+    sortitionModule,
+    rng,
+    nft721,
+    nft1155,
+    gatedDisputeKitID,
+    minStake: PNK_AMOUNT(200),
+    RANDOM: 424242n,
+    TOKEN_ID,
+    ONE_THOUSAND_PNK,
+    thousandPNK,
+    PNK: PNK_AMOUNT,
+  };
+
+  // Whitelist all tokens by default to make existing tests work
+  await whitelistTokens(context, [dai.target, nft721.target, nft1155.target], true);
+
+  return context;
+}
+
+// Test suites as functions that accept context
+
+export function testTokenWhitelistManagement(context: () => TokenGatedTestContext) {
+  describe("Token Whitelist Management", async () => {
+    describe("changeSupportedTokens function", async () => {
+      it("Should allow owner to whitelist single token", async () => {
+        const ctx = context();
+        await whitelistTokens(ctx, [ctx.dai.target], true);
+        await expectTokenSupported(ctx, ctx.dai.target, true);
+      });
+
+      it("Should allow owner to whitelist multiple tokens", async () => {
+        const ctx = context();
+        await whitelistTokens(ctx, [ctx.dai.target, ctx.nft721.target, ctx.nft1155.target], true);
+        await expectTokenSupported(ctx, ctx.dai.target, true);
+        await expectTokenSupported(ctx, ctx.nft721.target, true);
+        await expectTokenSupported(ctx, ctx.nft1155.target, true);
+      });
+
+      it("Should allow owner to remove single token from whitelist", async () => {
+        const ctx = context();
+        await whitelistTokens(ctx, [ctx.dai.target], true);
+        await expectTokenSupported(ctx, ctx.dai.target, true);
+
+        await whitelistTokens(ctx, [ctx.dai.target], false);
+        await expectTokenSupported(ctx, ctx.dai.target, false);
+      });
+
+      it("Should allow owner to remove multiple tokens from whitelist", async () => {
+        const ctx = context();
+        await whitelistTokens(ctx, [ctx.dai.target, ctx.nft721.target], true);
+        await expectTokenSupported(ctx, ctx.dai.target, true);
+        await expectTokenSupported(ctx, ctx.nft721.target, true);
+
+        await whitelistTokens(ctx, [ctx.dai.target, ctx.nft721.target], false);
+        await expectTokenSupported(ctx, ctx.dai.target, false);
+        await expectTokenSupported(ctx, ctx.nft721.target, false);
+      });
+
+      it("Should handle mixed operations (add some, remove some)", async () => {
+        const ctx = context();
+        await whitelistTokens(ctx, [ctx.dai.target, ctx.nft721.target], true);
+        await expectTokenSupported(ctx, ctx.dai.target, true);
+        await expectTokenSupported(ctx, ctx.nft721.target, true);
+
+        await whitelistTokens(ctx, [ctx.dai.target], false);
+        await whitelistTokens(ctx, [ctx.nft1155.target], true);
+
+        await expectTokenSupported(ctx, ctx.dai.target, false);
+        await expectTokenSupported(ctx, ctx.nft721.target, true);
+        await expectTokenSupported(ctx, ctx.nft1155.target, true);
+      });
+
+      it("Should handle duplicate operations correctly", async () => {
+        const ctx = context();
+        // Whitelist token twice - should not revert
+        await whitelistTokens(ctx, [ctx.dai.target], true);
+        await whitelistTokens(ctx, [ctx.dai.target], true);
+        await expectTokenSupported(ctx, ctx.dai.target, true);
+
+        // Remove token twice - should not revert
+        await whitelistTokens(ctx, [ctx.dai.target], false);
+        await whitelistTokens(ctx, [ctx.dai.target], false);
+        await expectTokenSupported(ctx, ctx.dai.target, false);
+      });
+    });
+  });
+}
+
+export function testAccessControl(context: () => TokenGatedTestContext) {
+  describe("Access Control", async () => {
+    it("Should revert when non-owner tries to change supported tokens", async () => {
+      const ctx = context();
+      await expect(ctx.disputeKit.connect(ctx.juror1).changeSupportedTokens([ctx.dai.target], true)).to.be.reverted;
+    });
+
+    it("Should revert when non-owner tries to remove supported tokens", async () => {
+      const ctx = context();
+      // First whitelist as owner
+      await whitelistTokens(ctx, [ctx.dai.target], true);
+
+      // Then try to remove as non-owner
+      await expect(ctx.disputeKit.connect(ctx.juror1).changeSupportedTokens([ctx.dai.target], false)).to.be.reverted;
+    });
+  });
+}
+
+export function testUnsupportedTokenErrors(context: () => TokenGatedTestContext) {
+  describe("Error Handling - Unsupported Tokens", async () => {
+    it("Should revert with TokenNotSupported when creating dispute with unsupported ERC20", async () => {
+      const ctx = context();
+      await whitelistTokens(ctx, [ctx.dai.target], false);
+
+      await expect(createDisputeWithToken(ctx, ctx.dai.target))
+        .to.be.revertedWithCustomError(ctx.disputeKit, "TokenNotSupported")
+        .withArgs(ctx.dai.target);
+    });
+
+    it("Should revert with TokenNotSupported when creating dispute with unsupported ERC721", async () => {
+      const ctx = context();
+      await whitelistTokens(ctx, [ctx.nft721.target], false);
+
+      await expect(createDisputeWithToken(ctx, ctx.nft721.target))
+        .to.be.revertedWithCustomError(ctx.disputeKit, "TokenNotSupported")
+        .withArgs(ctx.nft721.target);
+    });
+
+    it("Should revert with TokenNotSupported when creating dispute with unsupported ERC1155", async () => {
+      const ctx = context();
+      await whitelistTokens(ctx, [ctx.nft1155.target], false);
+
+      await expect(createDisputeWithToken(ctx, ctx.nft1155.target, true, ctx.TOKEN_ID))
+        .to.be.revertedWithCustomError(ctx.disputeKit, "TokenNotSupported")
+        .withArgs(ctx.nft1155.target);
+    });
+
+    it("Should allow dispute creation after token is whitelisted", async () => {
+      const ctx = context();
+      await whitelistTokens(ctx, [ctx.dai.target], false);
+
+      await expect(createDisputeWithToken(ctx, ctx.dai.target)).to.be.revertedWithCustomError(
+        ctx.disputeKit,
+        "TokenNotSupported"
+      );
+
+      await whitelistTokens(ctx, [ctx.dai.target], true);
+
+      await expect(createDisputeWithToken(ctx, ctx.dai.target)).to.not.be.reverted;
+    });
+  });
+}
+
+export function testERC20Gating(context: () => TokenGatedTestContext) {
+  describe("When gating with DAI token", async () => {
+    it("Should draw no juror if they don't have any DAI balance", async () => {
+      const ctx = context();
+      const nbOfJurors = 15n;
+      const tx = await stakeAndDraw(
+        ctx,
+        Courts.GENERAL,
+        nbOfJurors,
+        ctx.gatedDisputeKitID,
+        ctx.dai.target,
+        false,
+        0
+      ).then((tx) => tx.wait());
+
+      // Ensure that no juror is drawn
+      const drawLogs =
+        tx?.logs.filter((log: any) => log.fragment?.name === "Draw" && log.address === ctx.core.target) || [];
+      expect(drawLogs).to.have.length(0);
+    });
+
+    it("Should draw only the jurors who have some DAI balance", async () => {
+      const ctx = context();
+      ctx.dai.transfer(ctx.juror1.address, 1);
+
+      const nbOfJurors = 15n;
+      const tx = await stakeAndDraw(
+        ctx,
+        Courts.GENERAL,
+        nbOfJurors,
+        ctx.gatedDisputeKitID,
+        ctx.dai.target,
+        false,
+        0
+      ).then((tx) => tx.wait());
+
+      // Ensure that only juror1 is drawn
+      const drawLogs =
+        tx?.logs.filter((log: any) => log.fragment?.name === "Draw" && log.address === ctx.core.target) || [];
+      expect(drawLogs).to.have.length(nbOfJurors);
+      drawLogs.forEach((log: any) => {
+        expect(log.args[0]).to.equal(ctx.juror1.address);
+      });
+
+      // Ensure that juror1 has PNK locked
+      expect(await ctx.sortitionModule.getJurorBalance(ctx.juror1.address, Courts.GENERAL)).to.deep.equal([
+        ctx.thousandPNK(10), // totalStaked
+        ctx.minStake * nbOfJurors, // totalLocked
+        ctx.thousandPNK(10), // stakedInCourt
+        1, // nbOfCourts
+      ]);
+
+      // Ensure that juror2 has no PNK locked
+      expect(await ctx.sortitionModule.getJurorBalance(ctx.juror2.address, Courts.GENERAL)).to.deep.equal([
+        ctx.thousandPNK(10), // totalStaked
+        0, // totalLocked
+        ctx.thousandPNK(10), // stakedInCourt
+        1, // nbOfCourts
+      ]);
+    });
+  });
+}
+
+export function testERC721Gating(context: () => TokenGatedTestContext) {
+  describe("When gating with ERC721 token", async () => {
+    it("Should draw no juror if they don't own the ERC721 token", async () => {
+      const ctx = context();
+      const nbOfJurors = 15n;
+      const tx = await stakeAndDraw(
+        ctx,
+        Courts.GENERAL,
+        nbOfJurors,
+        ctx.gatedDisputeKitID,
+        ctx.nft721.target,
+        false,
+        0
+      ).then((tx) => tx.wait());
+
+      // Ensure that no juror is drawn
+      const drawLogs =
+        tx?.logs.filter((log: any) => log.fragment?.name === "Draw" && log.address === ctx.core.target) || [];
+      expect(drawLogs).to.have.length(0);
+    });
+
+    it("Should draw only the jurors owning the ERC721 token", async () => {
+      const ctx = context();
+      await ctx.nft721.safeMint(ctx.juror2.address);
+
+      const nbOfJurors = 15n;
+      const tx = await stakeAndDraw(
+        ctx,
+        Courts.GENERAL,
+        nbOfJurors,
+        ctx.gatedDisputeKitID,
+        ctx.nft721.target,
+        false,
+        0
+      ).then((tx) => tx.wait());
+
+      // Ensure that only juror2 is drawn
+      const drawLogs =
+        tx?.logs.filter((log: any) => log.fragment?.name === "Draw" && log.address === ctx.core.target) || [];
+      expect(drawLogs).to.have.length(nbOfJurors);
+      drawLogs.forEach((log: any) => {
+        expect(log.args[0]).to.equal(ctx.juror2.address);
+      });
+
+      // Ensure that juror1 has no PNK locked
+      expect(await ctx.sortitionModule.getJurorBalance(ctx.juror1.address, Courts.GENERAL)).to.deep.equal([
+        ctx.thousandPNK(10), // totalStaked
+        0, // totalLocked
+        ctx.thousandPNK(10), // stakedInCourt
+        1, // nbOfCourts
+      ]);
+
+      // Ensure that juror2 has PNK locked
+      expect(await ctx.sortitionModule.getJurorBalance(ctx.juror2.address, Courts.GENERAL)).to.deep.equal([
+        ctx.thousandPNK(10), // totalStaked
+        ctx.minStake * nbOfJurors, // totalLocked
+        ctx.thousandPNK(10), // stakedInCourt
+        1, // nbOfCourts
+      ]);
+    });
+  });
+}
+
+export function testERC1155Gating(context: () => TokenGatedTestContext) {
+  describe("When gating with ERC1155 token", async () => {
+    it("Should draw no juror if they don't own the ERC1155 token", async () => {
+      const ctx = context();
+      const nbOfJurors = 15n;
+      const tx = await stakeAndDraw(
+        ctx,
+        Courts.GENERAL,
+        nbOfJurors,
+        ctx.gatedDisputeKitID,
+        ctx.nft1155.target,
+        true,
+        ctx.TOKEN_ID
+      ).then((tx) => tx.wait());
+
+      // Ensure that no juror is drawn
+      const drawLogs =
+        tx?.logs.filter((log: any) => log.fragment?.name === "Draw" && log.address === ctx.core.target) || [];
+      expect(drawLogs).to.have.length(0);
+    });
+
+    it("Should draw only the jurors owning the ERC1155 token", async () => {
+      const ctx = context();
+      await ctx.nft1155.mint(ctx.juror2.address, ctx.TOKEN_ID, 1, "0x00");
+
+      const nbOfJurors = 15n;
+      const tx = await stakeAndDraw(
+        ctx,
+        Courts.GENERAL,
+        nbOfJurors,
+        ctx.gatedDisputeKitID,
+        ctx.nft1155.target,
+        true,
+        ctx.TOKEN_ID
+      ).then((tx) => tx.wait());
+
+      // Ensure that only juror2 is drawn
+      const drawLogs =
+        tx?.logs.filter((log: any) => log.fragment?.name === "Draw" && log.address === ctx.core.target) || [];
+      expect(drawLogs).to.have.length(nbOfJurors);
+      drawLogs.forEach((log: any) => {
+        expect(log.args[0]).to.equal(ctx.juror2.address);
+      });
+
+      // Ensure that juror1 has no PNK locked
+      expect(await ctx.sortitionModule.getJurorBalance(ctx.juror1.address, Courts.GENERAL)).to.deep.equal([
+        ctx.thousandPNK(10), // totalStaked
+        0, // totalLocked
+        ctx.thousandPNK(10), // stakedInCourt
+        1, // nbOfCourts
+      ]);
+
+      // Ensure that juror2 has PNK locked
+      expect(await ctx.sortitionModule.getJurorBalance(ctx.juror2.address, Courts.GENERAL)).to.deep.equal([
+        ctx.thousandPNK(10), // totalStaked
+        ctx.minStake * nbOfJurors, // totalLocked
+        ctx.thousandPNK(10), // stakedInCourt
+        1, // nbOfCourts
+      ]);
+    });
+  });
+}
+
+export function testWhitelistIntegration(context: () => TokenGatedTestContext) {
+  describe("Whitelist Integration Tests", async () => {
+    it("Should allow new disputes after whitelisting a token", async () => {
+      const ctx = context();
+      // Whitelist DAI token
+      await whitelistTokens(ctx, [ctx.dai.target], true);
+
+      // Transfer DAI to juror1 for token gating
+      await ctx.dai.transfer(ctx.juror1.address, 1);
+
+      const nbOfJurors = 3n;
+      const tx = await stakeAndDraw(
+        ctx,
+        Courts.GENERAL,
+        nbOfJurors,
+        ctx.gatedDisputeKitID,
+        ctx.dai.target,
+        false,
+        0
+      ).then((tx) => tx.wait());
+
+      // Verify dispute was created and juror drawn
+      const drawLogs =
+        tx?.logs.filter((log: any) => log.fragment?.name === "Draw" && log.address === ctx.core.target) || [];
+      expect(drawLogs).to.have.length(nbOfJurors);
+    });
+
+    it("Should prevent new disputes after removing token from whitelist", async () => {
+      const ctx = context();
+      await whitelistTokens(ctx, [ctx.dai.target], true);
+      await ctx.dai.transfer(ctx.juror1.address, 1);
+
+      // Create first dispute (should work)
+      await expect(createDisputeWithToken(ctx, ctx.dai.target)).to.not.be.reverted;
+
+      // Remove token from whitelist
+      await whitelistTokens(ctx, [ctx.dai.target], false);
+
+      // Try to create another dispute (should fail)
+      await expect(createDisputeWithToken(ctx, ctx.dai.target))
+        .to.be.revertedWithCustomError(ctx.disputeKit, "TokenNotSupported")
+        .withArgs(ctx.dai.target);
+    });
+
+    it("Should maintain whitelist state correctly across multiple operations", async () => {
+      const ctx = context();
+      const tokens = [ctx.dai.target, ctx.nft721.target, ctx.nft1155.target];
+
+      // All tokens should already be supported from the main setup
+      for (const token of tokens) {
+        await expectTokenSupported(ctx, token, true);
+      }
+
+      // Remove middle token
+      await whitelistTokens(ctx, [ctx.nft721.target], false);
+      await expectTokenSupported(ctx, ctx.dai.target, true);
+      await expectTokenSupported(ctx, ctx.nft721.target, false);
+      await expectTokenSupported(ctx, ctx.nft1155.target, true);
+
+      // Re-add middle token
+      await whitelistTokens(ctx, [ctx.nft721.target], true);
+      for (const token of tokens) {
+        await expectTokenSupported(ctx, token, true);
+      }
+    });
+  });
+}
diff --git a/contracts/test/arbitration/helpers/dispute-kit-shutter-common.ts b/contracts/test/arbitration/helpers/dispute-kit-shutter-common.ts
new file mode 100644
index 000000000..2c939d3fd
--- /dev/null
+++ b/contracts/test/arbitration/helpers/dispute-kit-shutter-common.ts
@@ -0,0 +1,875 @@
+import { deployments, ethers, getNamedAccounts, network } from "hardhat";
+import { toBigInt, BigNumberish } from "ethers";
+import {
+  PNK,
+  KlerosCore,
+  SortitionModule,
+  IncrementalNG,
+  DisputeKitShutter,
+  DisputeKitGatedShutterMock,
+  TestERC20,
+} from "../../../typechain-types";
+import { expect } from "chai";
+import { Courts } from "../../../deploy/utils";
+import { HardhatEthersSigner } from "@nomicfoundation/hardhat-ethers/signers";
+import { deployUpgradable } from "../../../deploy/utils/deployUpgradable";
+import { encodeExtraData as encodeGatedExtraData } from "./dispute-kit-gated-common";
+
+/* eslint-disable no-unused-vars */
+/* eslint-disable no-unused-expressions */
+
+// Type for the dispute kit (either DisputeKitShutter or DisputeKitGatedShutter)
+export type DisputeKitShutterType = DisputeKitShutter | DisputeKitGatedShutterMock;
+
+// Test context interface that holds all the test state
+export interface ShutterTestContext {
+  deployer: string;
+  juror1: HardhatEthersSigner;
+  juror2: HardhatEthersSigner;
+  bot: HardhatEthersSigner;
+  attacker: HardhatEthersSigner;
+  disputeKit: DisputeKitShutterType;
+  pnk: PNK;
+  core: KlerosCore;
+  sortitionModule: SortitionModule;
+  rng: IncrementalNG;
+  shutterDKID: number;
+  shutterCourtID: number;
+  RANDOM: bigint;
+  ONE_THOUSAND_PNK: bigint;
+  thousandPNK: (amount: BigNumberish) => bigint;
+  // Shutter test data
+  choice: bigint;
+  salt: bigint;
+  justification: string;
+  identity: string;
+  encryptedVote: Uint8Array;
+  // Token gating support (optional)
+  dai?: TestERC20;
+  isGated?: boolean;
+}
+
+// Configuration for setting up a Shutter test
+export interface ShutterTestConfig {
+  contractName: string; // "DisputeKitShutter" or "DisputeKitGatedShutter"
+  isGated?: boolean; // Whether to setup token gating
+}
+
+// Constants
+export const enum Period {
+  evidence = 0,
+  commit = 1,
+  vote = 2,
+  appeal = 3,
+  execution = 4,
+}
+
+const ONE_THOUSAND_PNK = 10n ** 21n;
+const thousandPNK = (amount: BigNumberish) => toBigInt(amount) * ONE_THOUSAND_PNK;
+
+// Helper function to encode extra data for dispute creation
+export const encodeExtraData = (courtId: BigNumberish, minJurors: BigNumberish, disputeKitId: number) =>
+  ethers.AbiCoder.defaultAbiCoder().encode(["uint256", "uint256", "uint256"], [courtId, minJurors, disputeKitId]);
+
+// Helper function to generate full and recovery commitments
+export const generateCommitments = (choice: bigint, salt: bigint, justification: string) => {
+  // Recovery commitment: hash(choice, salt) - no justification
+  const recoveryCommit = ethers.keccak256(
+    ethers.AbiCoder.defaultAbiCoder().encode(["uint256", "uint256"], [choice, salt])
+  );
+
+  // Full commitment: hash(choice, salt, justificationHash)
+  const justificationHash = ethers.keccak256(ethers.toUtf8Bytes(justification));
+  const fullCommit = ethers.keccak256(
+    ethers.AbiCoder.defaultAbiCoder().encode(["uint256", "uint256", "bytes32"], [choice, salt, justificationHash])
+  );
+
+  return { fullCommit, recoveryCommit };
+};
+
+// Helper to create dispute and draw jurors
+export const createDisputeAndDraw = async (
+  context: ShutterTestContext,
+  courtId: BigNumberish,
+  minJurors: BigNumberish,
+  disputeKitId: number
+) => {
+  // Stake jurors
+  for (const juror of [context.juror1, context.juror2]) {
+    await context.pnk.transfer(juror.address, context.thousandPNK(10)).then((tx) => tx.wait());
+    expect(await context.pnk.balanceOf(juror.address)).to.equal(context.thousandPNK(10));
+
+    await context.pnk
+      .connect(juror)
+      .approve(context.core.target, context.thousandPNK(10), { gasLimit: 300000 })
+      .then((tx) => tx.wait());
+
+    await context.core
+      .connect(juror)
+      .setStake(context.shutterCourtID, context.thousandPNK(10), { gasLimit: 500000 })
+      .then((tx) => tx.wait());
+
+    expect(await context.sortitionModule.getJurorBalance(juror.address, context.shutterCourtID)).to.deep.equal([
+      context.thousandPNK(10), // totalStaked
+      0, // totalLocked
+      context.thousandPNK(10), // stakedInCourt
+      1, // nbOfCourts
+    ]);
+
+    // If gated, give tokens to jurors
+    if (context.isGated && context.dai) {
+      await context.dai.transfer(juror.address, 1);
+    }
+  }
+
+  // Use gated extra data if this is a gated dispute kit with DAI token
+  let extraData: string;
+  if (context.isGated && context.dai) {
+    extraData = encodeGatedExtraData(courtId, minJurors, disputeKitId, context.dai.target, false, 0);
+  } else {
+    extraData = encodeExtraData(courtId, minJurors, disputeKitId);
+  }
+
+  const arbitrationCost = await context.core["arbitrationCost(bytes)"](extraData);
+
+  // Create dispute via core contract
+  await context.core["createDispute(uint256,bytes)"](2, extraData, { value: arbitrationCost }).then((tx) => tx.wait());
+  const disputeId = 0;
+
+  await network.provider.send("evm_increaseTime", [2000]); // Wait for minStakingTime
+  await network.provider.send("evm_mine");
+  await context.sortitionModule.passPhase().then((tx) => tx.wait()); // Staking -> Generating
+
+  await context.sortitionModule.passPhase().then((tx) => tx.wait()); // Generating -> Drawing
+  await context.core.draw(disputeId, 70, { gasLimit: 10000000 });
+
+  return disputeId;
+};
+
+// Helper to advance to commit period
+export const advanceToCommitPeriod = async (context: ShutterTestContext, disputeId: number) => {
+  // Advance from evidence to commit period
+  await context.core.passPeriod(disputeId).then((tx) => tx.wait());
+
+  // Verify we're in commit period
+  const dispute = await context.core.disputes(disputeId);
+  expect(dispute[2]).to.equal(Period.commit); // period is at index 2
+};
+
+// Helper to advance to vote period
+export const advanceToVotePeriod = async (context: ShutterTestContext, disputeId: number) => {
+  // Advance from commit to vote period
+  const timesPerPeriod = [300, 300, 300, 300]; // Default times from deployment
+  const commitPeriod = timesPerPeriod[Period.commit];
+
+  await network.provider.send("evm_increaseTime", [Number(commitPeriod)]);
+  await network.provider.send("evm_mine");
+
+  await context.core.passPeriod(disputeId).then((tx) => tx.wait());
+
+  // Verify we're in vote period
+  const updatedDispute = await context.core.disputes(disputeId);
+  expect(updatedDispute[2]).to.equal(Period.vote); // period is at index 2
+};
+
+// Helper to get vote IDs for a juror
+export const getVoteIDsForJuror = async (
+  context: ShutterTestContext,
+  disputeId: number,
+  juror: HardhatEthersSigner
+) => {
+  const localDisputeId = await context.disputeKit.coreDisputeIDToLocal(disputeId);
+  const nbRounds = await context.disputeKit.getNumberOfRounds(localDisputeId);
+  const roundIndex = Number(nbRounds) - 1;
+
+  // Get all votes for this round and filter by juror
+  const voteIDs: bigint[] = [];
+  const maxVotes = 10; // Reasonable limit for testing
+
+  for (let i = 0; i < maxVotes; i++) {
+    try {
+      const voteInfo = await context.disputeKit.getVoteInfo(disputeId, roundIndex, i);
+      if (voteInfo[0] === juror.address) {
+        // account is at index 0
+        voteIDs.push(BigInt(i));
+      }
+    } catch {
+      // No more votes
+      break;
+    }
+  }
+
+  return voteIDs;
+};
+
+// Setup function that creates the test context
+export async function setupShutterTest(config: ShutterTestConfig): Promise<ShutterTestContext> {
+  const { deployer } = await getNamedAccounts();
+  const [, juror1, juror2, bot, attacker] = await ethers.getSigners();
+
+  await deployments.fixture(["Arbitration", "VeaMock"], {
+    fallbackToGlobal: true,
+    keepExistingDeployments: false,
+  });
+
+  const pnk = await ethers.getContract<PNK>("PNK");
+  const core = await ethers.getContract<KlerosCore>("KlerosCore");
+  const sortitionModule = await ethers.getContract<SortitionModule>("SortitionModule");
+
+  let disputeKit: DisputeKitShutterType;
+  let shutterDKID: number;
+  let shutterCourtID: number;
+  let dai: TestERC20 | undefined;
+
+  if (config.contractName === "DisputeKitShutter") {
+    disputeKit = await ethers.getContract<DisputeKitShutter>("DisputeKitShutter");
+    shutterDKID = 2;
+    shutterCourtID = 2; // Court with hidden votes
+
+    // Create a court with hidden votes enabled for testing DisputeKitShutter
+    await core.createCourt(
+      Courts.GENERAL, // parent
+      true, // hiddenVotes - MUST be true for DisputeKitShutter
+      ethers.parseEther("200"), // minStake
+      10000, // alpha
+      ethers.parseEther("0.1"), // feeForJuror
+      16, // jurorsForCourtJump
+      [300, 300, 300, 300], // timesPerPeriod for evidence, commit, vote, appeal
+      ethers.toBeHex(5), // sortitionExtraData
+      [1, shutterDKID] // supportedDisputeKits - must include Classic (1) and Shutter (2)
+    );
+  } else if (config.contractName === "DisputeKitGatedShutter") {
+    // For gated shutter, we need to deploy it if not already deployed
+    const weth = await ethers.getContract<TestERC20>("WETH");
+    dai = await ethers.getContract<TestERC20>("DAI");
+
+    const deploymentResult = await deployUpgradable(deployments, "DisputeKitGatedShutterMock", {
+      from: deployer,
+      proxyAlias: "UUPSProxy",
+      args: [deployer, core.target, weth.target, 1],
+      log: true,
+    });
+    await core.addNewDisputeKit(deploymentResult.address);
+    shutterDKID = Number((await core.getDisputeKitsLength()) - 1n);
+
+    // For gated shutter, we use the General Court but with hidden votes enabled
+    shutterCourtID = Courts.GENERAL;
+
+    // Enable hidden votes on the General Court
+    await core.changeCourtParameters(
+      Courts.GENERAL,
+      true, // hiddenVotes
+      ethers.parseEther("200"), // minStake
+      10000, // alpha
+      ethers.parseEther("0.1"), // feeForJuror
+      16, // jurorsForCourtJump
+      [300, 300, 300, 300] // timesPerPeriod
+    );
+
+    await core.enableDisputeKits(Courts.GENERAL, [shutterDKID], true);
+
+    disputeKit = await ethers.getContract<DisputeKitGatedShutterMock>("DisputeKitGatedShutterMock");
+
+    // If gated, whitelist DAI token
+    if (config.isGated) {
+      const gatedKit = disputeKit as DisputeKitGatedShutterMock;
+      await gatedKit.changeSupportedTokens([dai.target], true);
+    }
+  } else {
+    throw new Error(`Unknown contract name: ${config.contractName}`);
+  }
+
+  // Make the tests more deterministic with this dummy RNG
+  const RANDOM = 424242n;
+  await deployments.deploy("IncrementalNG", {
+    from: deployer,
+    args: [RANDOM],
+    log: true,
+  });
+  const rng = await ethers.getContract<IncrementalNG>("IncrementalNG");
+  await sortitionModule.changeRandomNumberGenerator(rng.target).then((tx) => tx.wait());
+
+  // Test data
+  const choice = 1n;
+  const salt = 12345n;
+  const justification = "This is my justification for the vote";
+  const identity = ethers.keccak256(ethers.toUtf8Bytes("shutter-identity"));
+  const encryptedVote = ethers.toUtf8Bytes("encrypted-vote-data");
+
+  const context: ShutterTestContext = {
+    deployer,
+    juror1,
+    juror2,
+    bot,
+    attacker,
+    disputeKit,
+    pnk,
+    core,
+    sortitionModule,
+    rng,
+    shutterDKID,
+    shutterCourtID,
+    RANDOM,
+    ONE_THOUSAND_PNK,
+    thousandPNK,
+    choice,
+    salt,
+    justification,
+    identity,
+    encryptedVote,
+    dai,
+    isGated: config.isGated,
+  };
+
+  return context;
+}
+
+// Test suites as functions that accept context
+
+export function testCommitPhase(context: () => ShutterTestContext) {
+  describe("Commit Phase - castCommitShutter()", () => {
+    describe("Successful commits", () => {
+      it("Should allow juror to commit vote with recovery commitment", async () => {
+        const ctx = context();
+        const disputeId = await createDisputeAndDraw(ctx, ctx.shutterCourtID, 3, ctx.shutterDKID);
+        await advanceToCommitPeriod(ctx, disputeId);
+
+        const voteIDs = await getVoteIDsForJuror(ctx, disputeId, ctx.juror1);
+        expect(voteIDs.length).to.be.greaterThan(0);
+
+        const { fullCommit, recoveryCommit } = generateCommitments(ctx.choice, ctx.salt, ctx.justification);
+
+        await expect(
+          ctx.disputeKit
+            .connect(ctx.juror1)
+            .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, ctx.identity, ctx.encryptedVote)
+        )
+          .to.emit(ctx.disputeKit, "CommitCastShutter")
+          .withArgs(disputeId, ctx.juror1.address, fullCommit, recoveryCommit, ctx.identity, ctx.encryptedVote);
+
+        // Verify recovery commitment was stored
+        const localDisputeId = await ctx.disputeKit.coreDisputeIDToLocal(disputeId);
+        const storedRecoveryCommit = await ctx.disputeKit.recoveryCommitments(localDisputeId, 0, voteIDs[0]);
+        expect(storedRecoveryCommit).to.equal(recoveryCommit);
+      });
+
+      it("Should allow juror to update commitment multiple times", async () => {
+        const ctx = context();
+        const disputeId = await createDisputeAndDraw(ctx, ctx.shutterCourtID, 3, ctx.shutterDKID);
+        await advanceToCommitPeriod(ctx, disputeId);
+
+        const voteIDs = await getVoteIDsForJuror(ctx, disputeId, ctx.juror1);
+
+        // First commitment
+        const { fullCommit: commit1, recoveryCommit: recovery1 } = generateCommitments(1n, 111n, "First justification");
+        await ctx.disputeKit
+          .connect(ctx.juror1)
+          .castCommitShutter(disputeId, voteIDs, commit1, recovery1, ctx.identity, ctx.encryptedVote);
+
+        // Second commitment (overwrites first)
+        const { fullCommit: commit2, recoveryCommit: recovery2 } = generateCommitments(
+          2n,
+          222n,
+          "Second justification"
+        );
+        await ctx.disputeKit
+          .connect(ctx.juror1)
+          .castCommitShutter(disputeId, voteIDs, commit2, recovery2, ctx.identity, ctx.encryptedVote);
+
+        // Verify only the second commitment is stored
+        const localDisputeId = await ctx.disputeKit.coreDisputeIDToLocal(disputeId);
+        const storedRecoveryCommit = await ctx.disputeKit.recoveryCommitments(localDisputeId, 0, voteIDs[0]);
+        expect(storedRecoveryCommit).to.equal(recovery2);
+      });
+    });
+
+    describe("Failed commits", () => {
+      it("Should revert if recovery commitment is empty", async () => {
+        const ctx = context();
+        const disputeId = await createDisputeAndDraw(ctx, ctx.shutterCourtID, 3, ctx.shutterDKID);
+        await advanceToCommitPeriod(ctx, disputeId);
+
+        const voteIDs = await getVoteIDsForJuror(ctx, disputeId, ctx.juror1);
+        const { fullCommit } = generateCommitments(ctx.choice, ctx.salt, ctx.justification);
+
+        await expect(
+          ctx.disputeKit.connect(ctx.juror1).castCommitShutter(
+            disputeId,
+            voteIDs,
+            fullCommit,
+            ethers.ZeroHash, // Empty recovery commit
+            ctx.identity,
+            ctx.encryptedVote
+          )
+        ).to.be.revertedWithCustomError(ctx.disputeKit, "EmptyRecoveryCommit");
+      });
+
+      it("Should revert if not in commit period", async () => {
+        const ctx = context();
+        const disputeId = await createDisputeAndDraw(ctx, ctx.shutterCourtID, 3, ctx.shutterDKID);
+        // Still in evidence period
+
+        const voteIDs = await getVoteIDsForJuror(ctx, disputeId, ctx.juror1);
+        const { fullCommit, recoveryCommit } = generateCommitments(ctx.choice, ctx.salt, ctx.justification);
+
+        await expect(
+          ctx.disputeKit
+            .connect(ctx.juror1)
+            .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, ctx.identity, ctx.encryptedVote)
+        ).to.be.revertedWithCustomError(ctx.disputeKit, "NotCommitPeriod");
+      });
+
+      it("Should revert if juror doesn't own the vote", async () => {
+        const ctx = context();
+        const disputeId = await createDisputeAndDraw(ctx, ctx.shutterCourtID, 3, ctx.shutterDKID);
+        await advanceToCommitPeriod(ctx, disputeId);
+
+        const voteIDs = await getVoteIDsForJuror(ctx, disputeId, ctx.juror1);
+        const { fullCommit, recoveryCommit } = generateCommitments(ctx.choice, ctx.salt, ctx.justification);
+
+        await expect(
+          ctx.disputeKit.connect(ctx.juror2).castCommitShutter(
+            disputeId,
+            voteIDs, // Using juror1's vote IDs
+            fullCommit,
+            recoveryCommit,
+            ctx.identity,
+            ctx.encryptedVote
+          )
+        ).to.be.revertedWithCustomError(ctx.disputeKit, "JurorHasToOwnTheVote");
+      });
+    });
+  });
+}
+
+export function testNormalFlowBotReveals(context: () => ShutterTestContext) {
+  describe("Normal Flow - Bot Reveals", () => {
+    describe("Successful reveals", () => {
+      it("Should allow bot to reveal vote with full justification", async () => {
+        const ctx = context();
+        const disputeId = await createDisputeAndDraw(ctx, ctx.shutterCourtID, 3, ctx.shutterDKID);
+        await advanceToCommitPeriod(ctx, disputeId);
+
+        const voteIDs = await getVoteIDsForJuror(ctx, disputeId, ctx.juror1);
+        const { fullCommit, recoveryCommit } = generateCommitments(ctx.choice, ctx.salt, ctx.justification);
+
+        // Juror commits
+        await ctx.disputeKit
+          .connect(ctx.juror1)
+          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, ctx.identity, ctx.encryptedVote);
+
+        await advanceToVotePeriod(ctx, disputeId);
+
+        // Bot reveals vote
+        await expect(
+          ctx.disputeKit.connect(ctx.bot).castVoteShutter(disputeId, voteIDs, ctx.choice, ctx.salt, ctx.justification)
+        )
+          .to.emit(ctx.disputeKit, "VoteCast")
+          .withArgs(disputeId, ctx.juror1.address, voteIDs, ctx.choice, ctx.justification);
+
+        // Verify vote was counted
+        const voteInfo = await ctx.disputeKit.getVoteInfo(disputeId, 0, Number(voteIDs[0]));
+        expect(voteInfo[3]).to.be.true; // voted is at index 3
+        expect(voteInfo[2]).to.equal(ctx.choice); // choice is at index 2
+      });
+    });
+
+    describe("Failed reveals", () => {
+      it("Should revert if wrong choice provided", async () => {
+        const ctx = context();
+        const disputeId = await createDisputeAndDraw(ctx, ctx.shutterCourtID, 3, ctx.shutterDKID);
+        await advanceToCommitPeriod(ctx, disputeId);
+
+        const voteIDs = await getVoteIDsForJuror(ctx, disputeId, ctx.juror1);
+        const { fullCommit, recoveryCommit } = generateCommitments(ctx.choice, ctx.salt, ctx.justification);
+
+        await ctx.disputeKit
+          .connect(ctx.juror1)
+          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, ctx.identity, ctx.encryptedVote);
+
+        await advanceToVotePeriod(ctx, disputeId);
+
+        const wrongChoice = 2n;
+        await expect(
+          ctx.disputeKit.connect(ctx.bot).castVoteShutter(
+            disputeId,
+            voteIDs,
+            wrongChoice, // Wrong choice
+            ctx.salt,
+            ctx.justification
+          )
+        ).to.be.revertedWithCustomError(ctx.disputeKit, "HashDoesNotMatchHiddenVoteCommitment");
+      });
+
+      it("Should revert if wrong salt provided", async () => {
+        const ctx = context();
+        const disputeId = await createDisputeAndDraw(ctx, ctx.shutterCourtID, 3, ctx.shutterDKID);
+        await advanceToCommitPeriod(ctx, disputeId);
+
+        const voteIDs = await getVoteIDsForJuror(ctx, disputeId, ctx.juror1);
+        const { fullCommit, recoveryCommit } = generateCommitments(ctx.choice, ctx.salt, ctx.justification);
+
+        await ctx.disputeKit
+          .connect(ctx.juror1)
+          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, ctx.identity, ctx.encryptedVote);
+
+        await advanceToVotePeriod(ctx, disputeId);
+
+        const wrongSalt = 99999n;
+        await expect(
+          ctx.disputeKit.connect(ctx.bot).castVoteShutter(
+            disputeId,
+            voteIDs,
+            ctx.choice,
+            wrongSalt, // Wrong salt
+            ctx.justification
+          )
+        ).to.be.revertedWithCustomError(ctx.disputeKit, "HashDoesNotMatchHiddenVoteCommitment");
+      });
+
+      it("Should revert if wrong justification provided", async () => {
+        const ctx = context();
+        const disputeId = await createDisputeAndDraw(ctx, ctx.shutterCourtID, 3, ctx.shutterDKID);
+        await advanceToCommitPeriod(ctx, disputeId);
+
+        const voteIDs = await getVoteIDsForJuror(ctx, disputeId, ctx.juror1);
+        const { fullCommit, recoveryCommit } = generateCommitments(ctx.choice, ctx.salt, ctx.justification);
+
+        await ctx.disputeKit
+          .connect(ctx.juror1)
+          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, ctx.identity, ctx.encryptedVote);
+
+        await advanceToVotePeriod(ctx, disputeId);
+
+        const wrongJustification = "Wrong justification";
+        await expect(
+          ctx.disputeKit.connect(ctx.bot).castVoteShutter(
+            disputeId,
+            voteIDs,
+            ctx.choice,
+            ctx.salt,
+            wrongJustification // Wrong justification
+          )
+        ).to.be.revertedWithCustomError(ctx.disputeKit, "HashDoesNotMatchHiddenVoteCommitment");
+      });
+
+      it("Should revert if vote already cast", async () => {
+        const ctx = context();
+        const disputeId = await createDisputeAndDraw(ctx, ctx.shutterCourtID, 3, ctx.shutterDKID);
+        await advanceToCommitPeriod(ctx, disputeId);
+
+        const voteIDs = await getVoteIDsForJuror(ctx, disputeId, ctx.juror1);
+        const { fullCommit, recoveryCommit } = generateCommitments(ctx.choice, ctx.salt, ctx.justification);
+
+        await ctx.disputeKit
+          .connect(ctx.juror1)
+          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, ctx.identity, ctx.encryptedVote);
+
+        await advanceToVotePeriod(ctx, disputeId);
+
+        // First vote succeeds
+        await ctx.disputeKit
+          .connect(ctx.bot)
+          .castVoteShutter(disputeId, voteIDs, ctx.choice, ctx.salt, ctx.justification);
+
+        // Second vote fails
+        await expect(
+          ctx.disputeKit.connect(ctx.bot).castVoteShutter(disputeId, voteIDs, ctx.choice, ctx.salt, ctx.justification)
+        ).to.be.revertedWithCustomError(ctx.disputeKit, "VoteAlreadyCast");
+      });
+    });
+  });
+}
+
+export function testRecoveryFlowJurorReveals(context: () => ShutterTestContext) {
+  describe("Recovery Flow - Juror Reveals", () => {
+    describe("Successful recovery reveals", () => {
+      it("Should allow juror to recover vote without justification", async () => {
+        const ctx = context();
+        const disputeId = await createDisputeAndDraw(ctx, ctx.shutterCourtID, 3, ctx.shutterDKID);
+        await advanceToCommitPeriod(ctx, disputeId);
+
+        const voteIDs = await getVoteIDsForJuror(ctx, disputeId, ctx.juror1);
+        const { fullCommit, recoveryCommit } = generateCommitments(ctx.choice, ctx.salt, ctx.justification);
+
+        // Juror commits
+        await ctx.disputeKit
+          .connect(ctx.juror1)
+          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, ctx.identity, ctx.encryptedVote);
+
+        await advanceToVotePeriod(ctx, disputeId);
+
+        // Juror reveals vote (Shutter failed, so juror must reveal)
+        // Note: justification can be anything as it won't be validated
+        await expect(
+          ctx.disputeKit.connect(ctx.juror1).castVoteShutter(
+            disputeId,
+            voteIDs,
+            ctx.choice,
+            ctx.salt,
+            "" // Empty justification is fine for recovery
+          )
+        )
+          .to.emit(ctx.disputeKit, "VoteCast")
+          .withArgs(disputeId, ctx.juror1.address, voteIDs, ctx.choice, "");
+
+        // Verify vote was counted
+        const voteInfo = await ctx.disputeKit.getVoteInfo(disputeId, 0, Number(voteIDs[0]));
+        expect(voteInfo[3]).to.be.true; // voted is at index 3
+        expect(voteInfo[2]).to.equal(ctx.choice); // choice is at index 2
+      });
+
+      it("Should validate against recovery commitment when juror reveals", async () => {
+        const ctx = context();
+        const disputeId = await createDisputeAndDraw(ctx, ctx.shutterCourtID, 3, ctx.shutterDKID);
+        await advanceToCommitPeriod(ctx, disputeId);
+
+        const voteIDs = await getVoteIDsForJuror(ctx, disputeId, ctx.juror1);
+        const { fullCommit, recoveryCommit } = generateCommitments(ctx.choice, ctx.salt, ctx.justification);
+
+        await ctx.disputeKit
+          .connect(ctx.juror1)
+          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, ctx.identity, ctx.encryptedVote);
+
+        await advanceToVotePeriod(ctx, disputeId);
+
+        // Juror can provide any justification - it won't be validated
+        const differentJustification = "This is a different justification that won't be checked";
+        await expect(
+          ctx.disputeKit.connect(ctx.juror1).castVoteShutter(
+            disputeId,
+            voteIDs,
+            ctx.choice,
+            ctx.salt,
+            differentJustification // Different justification is OK for recovery
+          )
+        ).to.not.be.reverted;
+      });
+    });
+
+    describe("Failed recovery reveals", () => {
+      it("Should revert if wrong choice in recovery", async () => {
+        const ctx = context();
+        const disputeId = await createDisputeAndDraw(ctx, ctx.shutterCourtID, 3, ctx.shutterDKID);
+        await advanceToCommitPeriod(ctx, disputeId);
+
+        const voteIDs = await getVoteIDsForJuror(ctx, disputeId, ctx.juror1);
+        const { fullCommit, recoveryCommit } = generateCommitments(ctx.choice, ctx.salt, ctx.justification);
+
+        await ctx.disputeKit
+          .connect(ctx.juror1)
+          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, ctx.identity, ctx.encryptedVote);
+
+        await advanceToVotePeriod(ctx, disputeId);
+
+        const wrongChoice = 2n;
+        await expect(
+          ctx.disputeKit.connect(ctx.juror1).castVoteShutter(
+            disputeId,
+            voteIDs,
+            wrongChoice, // Wrong choice
+            ctx.salt,
+            ""
+          )
+        ).to.be.revertedWithCustomError(ctx.disputeKit, "HashDoesNotMatchHiddenVoteCommitment");
+      });
+
+      it("Should revert if wrong salt in recovery", async () => {
+        const ctx = context();
+        const disputeId = await createDisputeAndDraw(ctx, ctx.shutterCourtID, 3, ctx.shutterDKID);
+        await advanceToCommitPeriod(ctx, disputeId);
+
+        const voteIDs = await getVoteIDsForJuror(ctx, disputeId, ctx.juror1);
+        const { fullCommit, recoveryCommit } = generateCommitments(ctx.choice, ctx.salt, ctx.justification);
+
+        await ctx.disputeKit
+          .connect(ctx.juror1)
+          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, ctx.identity, ctx.encryptedVote);
+
+        await advanceToVotePeriod(ctx, disputeId);
+
+        const wrongSalt = 99999n;
+        await expect(
+          ctx.disputeKit.connect(ctx.juror1).castVoteShutter(
+            disputeId,
+            voteIDs,
+            ctx.choice,
+            wrongSalt, // Wrong salt
+            ""
+          )
+        ).to.be.revertedWithCustomError(ctx.disputeKit, "HashDoesNotMatchHiddenVoteCommitment");
+      });
+
+      it("Should revert if non-juror tries to reveal without correct full commitment", async () => {
+        const ctx = context();
+        const disputeId = await createDisputeAndDraw(ctx, ctx.shutterCourtID, 3, ctx.shutterDKID);
+        await advanceToCommitPeriod(ctx, disputeId);
+
+        const voteIDs = await getVoteIDsForJuror(ctx, disputeId, ctx.juror1);
+        const { fullCommit, recoveryCommit } = generateCommitments(ctx.choice, ctx.salt, ctx.justification);
+
+        await ctx.disputeKit
+          .connect(ctx.juror1)
+          .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, ctx.identity, ctx.encryptedVote);
+
+        await advanceToVotePeriod(ctx, disputeId);
+
+        // Attacker tries to reveal with only choice and salt (no justification)
+        await expect(
+          ctx.disputeKit.connect(ctx.attacker).castVoteShutter(
+            disputeId,
+            voteIDs,
+            ctx.choice,
+            ctx.salt,
+            "" // No justification - would work for juror but not for others
+          )
+        ).to.be.revertedWithCustomError(ctx.disputeKit, "HashDoesNotMatchHiddenVoteCommitment");
+      });
+    });
+  });
+}
+
+export function testHashFunctionBehavior(context: () => ShutterTestContext) {
+  describe("Hash Function Behavior", () => {
+    it("Should return different hashes for juror vs non-juror callers", async () => {
+      const ctx = context();
+      const disputeId = await createDisputeAndDraw(ctx, ctx.shutterCourtID, 3, ctx.shutterDKID);
+      await advanceToCommitPeriod(ctx, disputeId);
+
+      const voteIDs = await getVoteIDsForJuror(ctx, disputeId, ctx.juror1);
+      const { fullCommit, recoveryCommit } = generateCommitments(ctx.choice, ctx.salt, ctx.justification);
+
+      await ctx.disputeKit
+        .connect(ctx.juror1)
+        .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, ctx.identity, ctx.encryptedVote);
+
+      await advanceToVotePeriod(ctx, disputeId);
+
+      // During castVoteShutter, the contract should use different hash logic
+      // For juror: hash(choice, salt)
+      // For non-juror: hash(choice, salt, justificationHash)
+
+      // This is tested implicitly by the recovery flow tests above
+      // The juror can reveal with any justification, while non-juror must provide exact justification
+    });
+
+    it("Should correctly compute hash for normal flow", async () => {
+      const ctx = context();
+      // Test hashVote function directly
+      const justificationHash = ethers.keccak256(ethers.toUtf8Bytes(ctx.justification));
+      const expectedHash = ethers.keccak256(
+        ethers.AbiCoder.defaultAbiCoder().encode(
+          ["uint256", "uint256", "bytes32"],
+          [ctx.choice, ctx.salt, justificationHash]
+        )
+      );
+
+      // When called by non-juror (normal case), should include justification
+      const computedHash = await ctx.disputeKit.hashVote(ctx.choice, ctx.salt, ctx.justification);
+      expect(computedHash).to.equal(expectedHash);
+    });
+  });
+}
+
+export function testEdgeCasesAndSecurity(context: () => ShutterTestContext) {
+  describe("Edge Cases and Security", () => {
+    it("Should handle mixed normal and recovery reveals in same dispute", async () => {
+      const ctx = context();
+      const disputeId = await createDisputeAndDraw(ctx, ctx.shutterCourtID, 3, ctx.shutterDKID);
+      await advanceToCommitPeriod(ctx, disputeId);
+
+      const voteIDsJuror1 = await getVoteIDsForJuror(ctx, disputeId, ctx.juror1);
+      const voteIDsJuror2 = await getVoteIDsForJuror(ctx, disputeId, ctx.juror2);
+
+      const { fullCommit: commit1, recoveryCommit: recovery1 } = generateCommitments(1n, 111n, "Juror 1 justification");
+      const { fullCommit: commit2, recoveryCommit: recovery2 } = generateCommitments(2n, 222n, "Juror 2 justification");
+
+      // Both jurors commit
+      await ctx.disputeKit
+        .connect(ctx.juror1)
+        .castCommitShutter(disputeId, voteIDsJuror1, commit1, recovery1, ctx.identity, ctx.encryptedVote);
+
+      await ctx.disputeKit
+        .connect(ctx.juror2)
+        .castCommitShutter(disputeId, voteIDsJuror2, commit2, recovery2, ctx.identity, ctx.encryptedVote);
+
+      await advanceToVotePeriod(ctx, disputeId);
+
+      // Juror1 uses recovery flow (Shutter failed for them)
+      await ctx.disputeKit.connect(ctx.juror1).castVoteShutter(
+        disputeId,
+        voteIDsJuror1,
+        1n,
+        111n,
+        "Different justification" // Recovery doesn't check this
+      );
+
+      // Bot reveals juror2's vote normally
+      await ctx.disputeKit.connect(ctx.bot).castVoteShutter(
+        disputeId,
+        voteIDsJuror2,
+        2n,
+        222n,
+        "Juror 2 justification" // Must match exactly
+      );
+
+      // Verify both votes were counted
+      const vote1Info = await ctx.disputeKit.getVoteInfo(disputeId, 0, Number(voteIDsJuror1[0]));
+      const vote2Info = await ctx.disputeKit.getVoteInfo(disputeId, 0, Number(voteIDsJuror2[0]));
+
+      expect(vote1Info[3]).to.be.true; // voted is at index 3
+      expect(vote1Info[2]).to.equal(1n); // choice is at index 2
+      expect(vote2Info[3]).to.be.true;
+      expect(vote2Info[2]).to.equal(2n);
+    });
+
+    it("Should allow anyone to reveal vote with correct data only", async () => {
+      const ctx = context();
+      const disputeId = await createDisputeAndDraw(ctx, ctx.shutterCourtID, 3, ctx.shutterDKID);
+      await advanceToCommitPeriod(ctx, disputeId);
+
+      const voteIDsJuror1 = await getVoteIDsForJuror(ctx, disputeId, ctx.juror1);
+      const { fullCommit, recoveryCommit } = generateCommitments(ctx.choice, ctx.salt, ctx.justification);
+
+      await ctx.disputeKit
+        .connect(ctx.juror1)
+        .castCommitShutter(disputeId, voteIDsJuror1, fullCommit, recoveryCommit, ctx.identity, ctx.encryptedVote);
+
+      // Juror2 commits with a different choice
+      const differentChoice = 2n;
+      const voteIDsJuror2 = await getVoteIDsForJuror(ctx, disputeId, ctx.juror2);
+      const { fullCommit: commit2, recoveryCommit: recovery2 } = generateCommitments(
+        differentChoice,
+        ctx.salt,
+        ctx.justification
+      );
+
+      await ctx.disputeKit
+        .connect(ctx.juror2)
+        .castCommitShutter(disputeId, voteIDsJuror2, commit2, recovery2, ctx.identity, ctx.encryptedVote);
+
+      await advanceToVotePeriod(ctx, disputeId);
+
+      // In normal Shutter operation, anyone (bot/attacker) can reveal the vote if they have the correct data
+      // This is by design - the security comes from the fact that only Shutter knows the decryption key
+      await expect(
+        ctx.disputeKit
+          .connect(ctx.attacker)
+          .castVoteShutter(disputeId, voteIDsJuror1, ctx.choice, ctx.salt, ctx.justification)
+      )
+        .to.emit(ctx.disputeKit, "VoteCast")
+        .withArgs(disputeId, ctx.juror1.address, voteIDsJuror1, ctx.choice, ctx.justification);
+
+      // Attacker cannot change juror2's vote to a different choice
+      await expect(
+        ctx.disputeKit.connect(ctx.attacker).castVoteShutter(
+          disputeId,
+          voteIDsJuror2,
+          1n, // Wrong choice
+          ctx.salt,
+          ctx.justification
+        )
+      ).to.be.revertedWithCustomError(ctx.disputeKit, "HashDoesNotMatchHiddenVoteCommitment");
+    });
+  });
+}

From cefa0cb299efed8c9734b2a56812a8a1585581b8 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Tue, 14 Oct 2025 19:27:54 +0100
Subject: [PATCH 169/175] test: added coverage for missing token gate address
 in gated DKs

---
 .../arbitration/dispute-kit-gated-shutter.ts  |  2 +
 .../test/arbitration/dispute-kit-gated.ts     |  2 +
 .../helpers/dispute-kit-gated-common.ts       | 79 +++++++++++++++++++
 3 files changed, 83 insertions(+)

diff --git a/contracts/test/arbitration/dispute-kit-gated-shutter.ts b/contracts/test/arbitration/dispute-kit-gated-shutter.ts
index 1a3c41312..3078c2319 100644
--- a/contracts/test/arbitration/dispute-kit-gated-shutter.ts
+++ b/contracts/test/arbitration/dispute-kit-gated-shutter.ts
@@ -7,6 +7,7 @@ import {
   testERC721Gating,
   testERC1155Gating,
   testWhitelistIntegration,
+  testNoTokenGateAddress,
   TokenGatedTestContext,
 } from "./helpers/dispute-kit-gated-common";
 import {
@@ -49,6 +50,7 @@ describe("DisputeKitGatedShutter", async () => {
     testERC721Gating(() => tokenContext);
     testERC1155Gating(() => tokenContext);
     testWhitelistIntegration(() => tokenContext);
+    testNoTokenGateAddress(() => tokenContext);
   });
 
   describe("Shutter Features", async () => {
diff --git a/contracts/test/arbitration/dispute-kit-gated.ts b/contracts/test/arbitration/dispute-kit-gated.ts
index 86f4320ea..83637f988 100644
--- a/contracts/test/arbitration/dispute-kit-gated.ts
+++ b/contracts/test/arbitration/dispute-kit-gated.ts
@@ -7,6 +7,7 @@ import {
   testERC721Gating,
   testERC1155Gating,
   testWhitelistIntegration,
+  testNoTokenGateAddress,
   TokenGatedTestContext,
 } from "./helpers/dispute-kit-gated-common";
 
@@ -38,4 +39,5 @@ describe("DisputeKitGated", async () => {
   testERC721Gating(() => context);
   testERC1155Gating(() => context);
   testWhitelistIntegration(() => context);
+  testNoTokenGateAddress(() => context);
 });
diff --git a/contracts/test/arbitration/helpers/dispute-kit-gated-common.ts b/contracts/test/arbitration/helpers/dispute-kit-gated-common.ts
index 2b829b2d9..ba9050568 100644
--- a/contracts/test/arbitration/helpers/dispute-kit-gated-common.ts
+++ b/contracts/test/arbitration/helpers/dispute-kit-gated-common.ts
@@ -623,3 +623,82 @@ export function testWhitelistIntegration(context: () => TokenGatedTestContext) {
     });
   });
 }
+
+export function testNoTokenGateAddress(context: () => TokenGatedTestContext) {
+  describe("No Token Gate Edge Case (address(0))", async () => {
+    it("Should verify that address(0) is supported by default", async () => {
+      const ctx = context();
+      await expectTokenSupported(ctx, ethers.ZeroAddress, true);
+    });
+
+    it("Should allow dispute creation with address(0) as tokenGate", async () => {
+      const ctx = context();
+      // Create dispute with address(0) as tokenGate - should not revert
+      await expect(createDisputeWithToken(ctx, ethers.ZeroAddress, false, 0)).to.not.be.reverted;
+    });
+
+    it("Should draw all staked jurors when tokenGate is address(0)", async () => {
+      const ctx = context();
+      // Neither juror has any special tokens, but both are staked
+      const nbOfJurors = 15n;
+      const tx = await stakeAndDraw(
+        ctx,
+        Courts.GENERAL,
+        nbOfJurors,
+        ctx.gatedDisputeKitID,
+        ethers.ZeroAddress,
+        false,
+        0
+      ).then((tx) => tx.wait());
+
+      // Both jurors should be eligible for drawing since there's no token gate
+      const drawLogs =
+        tx?.logs.filter((log: any) => log.fragment?.name === "Draw" && log.address === ctx.core.target) || [];
+      expect(drawLogs.length).to.equal(nbOfJurors);
+
+      // Verify that draws include both jurors (not just one)
+      const drawnJurors = new Set(drawLogs.map((log: any) => log.args[0]));
+      expect(drawnJurors.size).to.be.greaterThan(1, "Should draw from multiple jurors");
+    });
+
+    it("Should behave like non-gated dispute kit when tokenGate is address(0)", async () => {
+      const ctx = context();
+      // Verify that with address(0), jurors don't need any token balance
+      const nbOfJurors = 3n;
+
+      // Ensure jurors have no DAI tokens
+      expect(await ctx.dai.balanceOf(ctx.juror1.address)).to.equal(0);
+      expect(await ctx.dai.balanceOf(ctx.juror2.address)).to.equal(0);
+
+      const tx = await stakeAndDraw(
+        ctx,
+        Courts.GENERAL,
+        nbOfJurors,
+        ctx.gatedDisputeKitID,
+        ethers.ZeroAddress,
+        false,
+        0
+      ).then((tx) => tx.wait());
+
+      // Jurors should still be drawn despite having no tokens
+      const drawLogs =
+        tx?.logs.filter((log: any) => log.fragment?.name === "Draw" && log.address === ctx.core.target) || [];
+      expect(drawLogs).to.have.length(nbOfJurors);
+    });
+
+    it("Should parse address(0) correctly from insufficient extraData", async () => {
+      const ctx = context();
+      // Create extraData that's too short (less than 160 bytes)
+      // This should return address(0) from _extraDataToTokenInfo
+      const shortExtraData = ethers.AbiCoder.defaultAbiCoder().encode(
+        ["uint256", "uint256", "uint256"],
+        [Courts.GENERAL, 3, ctx.gatedDisputeKitID]
+      );
+
+      const tokenInfo = await ctx.disputeKit.extraDataToTokenInfo(shortExtraData);
+      expect(tokenInfo[0]).to.equal(ethers.ZeroAddress);
+      expect(tokenInfo[1]).to.equal(false);
+      expect(tokenInfo[2]).to.equal(0);
+    });
+  });
+}

From 13f370862d2259f0792afabee7aafe2f46c5e434 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Wed, 15 Oct 2025 17:54:51 +0100
Subject: [PATCH 170/175] fix: coderabbit review, fixed a test not making any
 assertions

---
 contracts/src/test/DisputeKitGatedMock.sol    |  4 +--
 .../src/test/DisputeKitGatedShutterMock.sol   |  2 +-
 .../helpers/dispute-kit-gated-common.ts       |  4 +--
 .../helpers/dispute-kit-shutter-common.ts     | 31 +++++++++++--------
 4 files changed, 23 insertions(+), 18 deletions(-)

diff --git a/contracts/src/test/DisputeKitGatedMock.sol b/contracts/src/test/DisputeKitGatedMock.sol
index f08862efb..cc778c916 100644
--- a/contracts/src/test/DisputeKitGatedMock.sol
+++ b/contracts/src/test/DisputeKitGatedMock.sol
@@ -4,8 +4,8 @@ pragma solidity ^0.8.24;
 
 import "../arbitration/dispute-kits/DisputeKitGated.sol";
 
-/// @title KlerosCoreMock
-/// KlerosCore with view functions to use in Foundry tests.
+/// @title DisputeKitGatedMock
+/// DisputeKitGated with view functions to use in the tests.
 contract DisputeKitGatedMock is DisputeKitGated {
     function extraDataToTokenInfo(
         bytes memory _extraData
diff --git a/contracts/src/test/DisputeKitGatedShutterMock.sol b/contracts/src/test/DisputeKitGatedShutterMock.sol
index 79f56455a..4ed4c59b2 100644
--- a/contracts/src/test/DisputeKitGatedShutterMock.sol
+++ b/contracts/src/test/DisputeKitGatedShutterMock.sol
@@ -5,7 +5,7 @@ pragma solidity ^0.8.24;
 import "../arbitration/dispute-kits/DisputeKitGatedShutter.sol";
 
 /// @title DisputeKitGatedShutterMock
-/// DisputeKitGatedShutter with view functions to use in Foundry tests.
+/// DisputeKitGatedShutter with view functions to use in the tests.
 contract DisputeKitGatedShutterMock is DisputeKitGatedShutter {
     function extraDataToTokenInfo(
         bytes memory _extraData
diff --git a/contracts/test/arbitration/helpers/dispute-kit-gated-common.ts b/contracts/test/arbitration/helpers/dispute-kit-gated-common.ts
index ba9050568..4876093b3 100644
--- a/contracts/test/arbitration/helpers/dispute-kit-gated-common.ts
+++ b/contracts/test/arbitration/helpers/dispute-kit-gated-common.ts
@@ -229,7 +229,7 @@ export async function setupTokenGatedTest(config: TokenGatedTestConfig): Promise
     PNK: PNK_AMOUNT,
   };
 
-  // Whitelist all tokens by default to make existing tests work
+  // Whitelist all tokens by default
   await whitelistTokens(context, [dai.target, nft721.target, nft1155.target], true);
 
   return context;
@@ -390,7 +390,7 @@ export function testERC20Gating(context: () => TokenGatedTestContext) {
 
     it("Should draw only the jurors who have some DAI balance", async () => {
       const ctx = context();
-      ctx.dai.transfer(ctx.juror1.address, 1);
+      await ctx.dai.transfer(ctx.juror1.address, 1);
 
       const nbOfJurors = 15n;
       const tx = await stakeAndDraw(
diff --git a/contracts/test/arbitration/helpers/dispute-kit-shutter-common.ts b/contracts/test/arbitration/helpers/dispute-kit-shutter-common.ts
index 2c939d3fd..5bb98e204 100644
--- a/contracts/test/arbitration/helpers/dispute-kit-shutter-common.ts
+++ b/contracts/test/arbitration/helpers/dispute-kit-shutter-common.ts
@@ -731,26 +731,31 @@ export function testRecoveryFlowJurorReveals(context: () => ShutterTestContext)
 
 export function testHashFunctionBehavior(context: () => ShutterTestContext) {
   describe("Hash Function Behavior", () => {
-    it("Should return different hashes for juror vs non-juror callers", async () => {
+    it("Should compute different hashes for juror recovery vs non-juror normal flow", async () => {
       const ctx = context();
-      const disputeId = await createDisputeAndDraw(ctx, ctx.shutterCourtID, 3, ctx.shutterDKID);
-      await advanceToCommitPeriod(ctx, disputeId);
 
-      const voteIDs = await getVoteIDsForJuror(ctx, disputeId, ctx.juror1);
+      // Test 1: Verify hashVote matches generateCommitments for non-juror case
       const { fullCommit, recoveryCommit } = generateCommitments(ctx.choice, ctx.salt, ctx.justification);
+      const nonJurorHash = await ctx.disputeKit.hashVote(ctx.choice, ctx.salt, ctx.justification);
+      expect(nonJurorHash).to.equal(fullCommit, "Non-juror hash should match full commitment");
 
-      await ctx.disputeKit
-        .connect(ctx.juror1)
-        .castCommitShutter(disputeId, voteIDs, fullCommit, recoveryCommit, ctx.identity, ctx.encryptedVote);
+      // Test 2: Verify the two commitment types are different
+      expect(fullCommit).to.not.equal(recoveryCommit, "Full and recovery commitments should differ");
 
-      await advanceToVotePeriod(ctx, disputeId);
+      // Test 3: Calculate what the juror hash would be and verify it matches recovery commitment
+      const jurorExpectedHash = ethers.keccak256(
+        ethers.AbiCoder.defaultAbiCoder().encode(["uint256", "uint256"], [ctx.choice, ctx.salt])
+      );
+      expect(jurorExpectedHash).to.equal(recoveryCommit, "Juror hash calculation should match recovery commitment");
 
-      // During castVoteShutter, the contract should use different hash logic
-      // For juror: hash(choice, salt)
-      // For non-juror: hash(choice, salt, justificationHash)
+      // Test 4: Verify that changing justification affects non-juror hash but not juror hash
+      const differentJustification = "Different justification";
+      const { fullCommit: newFullCommit } = generateCommitments(ctx.choice, ctx.salt, differentJustification);
+      const newNonJurorHash = await ctx.disputeKit.hashVote(ctx.choice, ctx.salt, differentJustification);
 
-      // This is tested implicitly by the recovery flow tests above
-      // The juror can reveal with any justification, while non-juror must provide exact justification
+      expect(newNonJurorHash).to.equal(newFullCommit, "New non-juror hash should match new full commitment");
+      expect(newNonJurorHash).to.not.equal(nonJurorHash, "Non-juror hash should change with justification");
+      // Note: juror hash would remain the same (recoveryCommit) regardless of justification
     });
 
     it("Should correctly compute hash for normal flow", async () => {

From 3a930be6248baedc4c0f875bf7566d779b850c00 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Thu, 16 Oct 2025 12:12:00 +0100
Subject: [PATCH 171/175] refactor: hidden votes verification logic

---
 .../dispute-kits/DisputeKitClassicBase.sol    | 44 ++++++++-----------
 .../dispute-kits/DisputeKitGatedShutter.sol   | 34 ++++++++++----
 .../dispute-kits/DisputeKitShutter.sol        | 34 ++++++++++----
 3 files changed, 71 insertions(+), 41 deletions(-)

diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index f92ac2e88..b0e82e79e 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -334,15 +334,13 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         {
             (uint96 courtID, , , , ) = core.disputes(_coreDisputeID);
             (, bool hiddenVotes, , , , ) = core.courts(courtID);
-            bytes32 actualVoteHash = hashVote(_choice, _salt, _justification);
+            if (hiddenVotes) {
+                _verifyHiddenVoteCommitments(localDisputeID, localRoundID, _voteIDs, _choice, _justification, _salt);
+            }
 
             //  Save the votes.
             for (uint256 i = 0; i < _voteIDs.length; i++) {
                 if (round.votes[_voteIDs[i]].account != _juror) revert JurorHasToOwnTheVote();
-                if (hiddenVotes && _getExpectedVoteHash(localDisputeID, localRoundID, _voteIDs[i]) != actualVoteHash)
-                    revert HashDoesNotMatchHiddenVoteCommitment();
-                if (!_checkJustification(localDisputeID, localRoundID, _voteIDs[i], _justification, _salt))
-                    revert WrongJustification();
                 if (round.votes[_voteIDs[i]].voted) revert VoteAlreadyCast();
                 round.votes[_voteIDs[i]].choice = _choice;
                 round.votes[_voteIDs[i]].voted = true;
@@ -713,29 +711,26 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     // *            Internal               * //
     // ************************************* //
 
-    /// @notice Returns the expected vote hash for a given vote.
+    /// @notice Verifies that revealed choice and justification match the hidden vote commitments.
     /// @param _localDisputeID The ID of the dispute in the Dispute Kit.
     /// @param _localRoundID The ID of the round in the Dispute Kit.
-    /// @param _voteID The ID of the vote.
-    /// @return The expected vote hash.
-    function _getExpectedVoteHash(
+    /// @param _voteIDs The IDs of the votes.
+    /// @param _choice The choice.
+    /// @param _justification The justification.
+    /// @param _salt The salt.
+    function _verifyHiddenVoteCommitments(
         uint256 _localDisputeID,
         uint256 _localRoundID,
-        uint256 _voteID
-    ) internal view virtual returns (bytes32) {
-        return disputes[_localDisputeID].rounds[_localRoundID].votes[_voteID].commit;
-    }
-
-    /// @notice Returns true if submitted justification matches. Only used by specific Dispute Kits (eg Shutter).
-    /// @return Whether justification matches or not.
-    function _checkJustification(
-        uint256 /*_localDisputeID*/,
-        uint256 /*_localRoundID*/,
-        uint256 /*_voteID*/,
-        string memory /*_justification*/,
-        uint256 /*_salt*/
-    ) internal view virtual returns (bool) {
-        return true;
+        uint256[] calldata _voteIDs,
+        uint256 _choice,
+        string memory _justification,
+        uint256 _salt
+    ) internal view virtual {
+        bytes32 actualVoteHash = hashVote(_choice, _salt, _justification);
+        for (uint256 i = 0; i < _voteIDs.length; i++) {
+            if (disputes[_localDisputeID].rounds[_localRoundID].votes[i].commit != actualVoteHash)
+                revert HashDoesNotMatchHiddenVoteCommitment();
+        }
     }
 
     /// @notice Checks that the chosen address satisfies certain conditions for being drawn.
@@ -785,5 +780,4 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     error AppealFeeIsAlreadyPaid();
     error DisputeNotResolved();
     error CoreIsPaused();
-    error WrongJustification();
 }
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
index 0c4b066d6..0e4eb7007 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
@@ -165,23 +165,40 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
         callerIsJuror = false;
     }
 
+    // ************************************* //
+    // *           Public Views            * //
+    // ************************************* //
+
+    /// @notice Computes the hash of a justification using ABI encoding
+    /// @param _salt A random salt for commitment
+    /// @param _justification The justification for the vote
+    /// @return bytes32 The hash of the encoded justification
+    function hashJustification(uint256 _salt, string memory _justification) public pure returns (bytes32) {
+        return keccak256(abi.encode(_salt, keccak256(bytes(_justification))));
+    }
+
     // ************************************* //
     // *            Internal               * //
     // ************************************* //
 
     /// @inheritdoc DisputeKitClassicBase
-    function _checkJustification(
+    function _verifyHiddenVoteCommitments(
         uint256 _localDisputeID,
         uint256 _localRoundID,
-        uint256 _voteID,
+        uint256[] calldata _voteIDs,
+        uint256 _choice,
         string memory _justification,
         uint256 _salt
-    ) internal view override returns (bool) {
-        if (!callerIsJuror) {
-            bytes32 justificationCommit = justificationCommitments[_localDisputeID][_localRoundID][_voteID];
-            return justificationCommit == keccak256(abi.encode(_salt, keccak256(bytes(_justification))));
-        } else {
-            return true;
+    ) internal view override {
+        super._verifyHiddenVoteCommitments(_localDisputeID, _localRoundID, _voteIDs, _choice, _justification, _salt);
+
+        // The juror is allowed to reveal without verifying the justification commitment for recovery purposes.
+        if (callerIsJuror) return;
+
+        bytes32 actualJustificationHash = hashJustification(_salt, _justification);
+        for (uint256 i = 0; i < _voteIDs.length; i++) {
+            if (justificationCommitments[_localDisputeID][_localRoundID][_voteIDs[i]] != actualJustificationHash)
+                revert WrongJustification();
         }
     }
 
@@ -241,4 +258,5 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
     // ************************************* //
 
     error EmptyJustificationCommit();
+    error WrongJustification();
 }
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol b/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
index e78ca6cf9..8a63f9b68 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
@@ -149,23 +149,40 @@ contract DisputeKitShutter is DisputeKitClassicBase {
         callerIsJuror = false;
     }
 
+    // ************************************* //
+    // *           Public Views            * //
+    // ************************************* //
+
+    /// @notice Computes the hash of a justification using ABI encoding
+    /// @param _salt A random salt for commitment
+    /// @param _justification The justification for the vote
+    /// @return bytes32 The hash of the encoded justification
+    function hashJustification(uint256 _salt, string memory _justification) public pure returns (bytes32) {
+        return keccak256(abi.encode(_salt, keccak256(bytes(_justification))));
+    }
+
     // ************************************* //
     // *            Internal               * //
     // ************************************* //
 
     /// @inheritdoc DisputeKitClassicBase
-    function _checkJustification(
+    function _verifyHiddenVoteCommitments(
         uint256 _localDisputeID,
         uint256 _localRoundID,
-        uint256 _voteID,
+        uint256[] calldata _voteIDs,
+        uint256 _choice,
         string memory _justification,
         uint256 _salt
-    ) internal view override returns (bool) {
-        if (!callerIsJuror) {
-            bytes32 justificationCommit = justificationCommitments[_localDisputeID][_localRoundID][_voteID];
-            return justificationCommit == keccak256(abi.encode(_salt, keccak256(bytes(_justification))));
-        } else {
-            return true;
+    ) internal view override {
+        super._verifyHiddenVoteCommitments(_localDisputeID, _localRoundID, _voteIDs, _choice, _justification, _salt);
+
+        // The juror is allowed to reveal without verifying the justification commitment for recovery purposes.
+        if (callerIsJuror) return;
+
+        bytes32 actualJustificationHash = hashJustification(_salt, _justification);
+        for (uint256 i = 0; i < _voteIDs.length; i++) {
+            if (justificationCommitments[_localDisputeID][_localRoundID][_voteIDs[i]] != actualJustificationHash)
+                revert WrongJustification();
         }
     }
 
@@ -174,4 +191,5 @@ contract DisputeKitShutter is DisputeKitClassicBase {
     // ************************************* //
 
     error EmptyJustificationCommit();
+    error WrongJustification();
 }

From 613b8c35ff758141c45f1a2815e9e3c8ad18706d Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Fri, 17 Oct 2025 12:22:16 +0100
Subject: [PATCH 172/175] fix: vote index error

---
 .../src/arbitration/dispute-kits/DisputeKitClassicBase.sol      | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index b0e82e79e..054dba0b0 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -728,7 +728,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     ) internal view virtual {
         bytes32 actualVoteHash = hashVote(_choice, _salt, _justification);
         for (uint256 i = 0; i < _voteIDs.length; i++) {
-            if (disputes[_localDisputeID].rounds[_localRoundID].votes[i].commit != actualVoteHash)
+            if (disputes[_localDisputeID].rounds[_localRoundID].votes[_voteIDs[i]].commit != actualVoteHash)
                 revert HashDoesNotMatchHiddenVoteCommitment();
         }
     }

From 8ab5d63d12f8ebf2ce464fe17ebb4a03e7199ff1 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Fri, 17 Oct 2025 13:14:18 +0100
Subject: [PATCH 173/175] refactor: errors rename

---
 .../dispute-kits/DisputeKitClassicBase.sol         |  4 ++--
 .../dispute-kits/DisputeKitGatedShutter.sol        |  4 ++--
 .../arbitration/dispute-kits/DisputeKitShutter.sol |  4 ++--
 .../helpers/dispute-kit-shutter-common.ts          | 14 +++++++-------
 contracts/test/foundry/KlerosCore_Voting.t.sol     |  4 ++--
 5 files changed, 15 insertions(+), 15 deletions(-)

diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
index 5761302b0..9ed66cdfe 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitClassicBase.sol
@@ -729,7 +729,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
         bytes32 actualVoteHash = hashVote(_choice, _salt, _justification);
         for (uint256 i = 0; i < _voteIDs.length; i++) {
             if (disputes[_localDisputeID].rounds[_localRoundID].votes[_voteIDs[i]].commit != actualVoteHash)
-                revert HashDoesNotMatchHiddenVoteCommitment();
+                revert ChoiceCommitmentMismatch();
         }
     }
 
@@ -773,7 +773,7 @@ abstract contract DisputeKitClassicBase is IDisputeKit, Initializable, UUPSProxi
     error NotVotePeriod();
     error EmptyVoteIDs();
     error ChoiceOutOfBounds();
-    error HashDoesNotMatchHiddenVoteCommitment();
+    error ChoiceCommitmentMismatch();
     error VoteAlreadyCast();
     error NotAppealPeriod();
     error NotAppealPeriodForLoser();
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
index f57b9c23b..38b3a66e3 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitGatedShutter.sol
@@ -226,7 +226,7 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
         bytes32 actualJustificationHash = hashJustification(_salt, _justification);
         for (uint256 i = 0; i < _voteIDs.length; i++) {
             if (justificationCommitments[_localDisputeID][_localRoundID][_voteIDs[i]] != actualJustificationHash)
-                revert WrongJustification();
+                revert JustificationCommitmentMismatch();
         }
     }
 
@@ -287,5 +287,5 @@ contract DisputeKitGatedShutter is DisputeKitClassicBase {
 
     error TokenNotSupported(address tokenGate);
     error EmptyJustificationCommit();
-    error WrongJustification();
+    error JustificationCommitmentMismatch();
 }
diff --git a/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol b/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
index 8a63f9b68..53f89d895 100644
--- a/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
+++ b/contracts/src/arbitration/dispute-kits/DisputeKitShutter.sol
@@ -182,7 +182,7 @@ contract DisputeKitShutter is DisputeKitClassicBase {
         bytes32 actualJustificationHash = hashJustification(_salt, _justification);
         for (uint256 i = 0; i < _voteIDs.length; i++) {
             if (justificationCommitments[_localDisputeID][_localRoundID][_voteIDs[i]] != actualJustificationHash)
-                revert WrongJustification();
+                revert JustificationCommitmentMismatch();
         }
     }
 
@@ -191,5 +191,5 @@ contract DisputeKitShutter is DisputeKitClassicBase {
     // ************************************* //
 
     error EmptyJustificationCommit();
-    error WrongJustification();
+    error JustificationCommitmentMismatch();
 }
diff --git a/contracts/test/arbitration/helpers/dispute-kit-shutter-common.ts b/contracts/test/arbitration/helpers/dispute-kit-shutter-common.ts
index 76e4581f3..699968f9c 100644
--- a/contracts/test/arbitration/helpers/dispute-kit-shutter-common.ts
+++ b/contracts/test/arbitration/helpers/dispute-kit-shutter-common.ts
@@ -502,7 +502,7 @@ export function testNormalFlowBotReveals(context: () => ShutterTestContext) {
             ctx.salt,
             ctx.justification
           )
-        ).to.be.revertedWithCustomError(ctx.disputeKit, "HashDoesNotMatchHiddenVoteCommitment");
+        ).to.be.revertedWithCustomError(ctx.disputeKit, "ChoiceCommitmentMismatch");
       });
 
       it("Should revert if wrong salt provided", async () => {
@@ -528,7 +528,7 @@ export function testNormalFlowBotReveals(context: () => ShutterTestContext) {
             wrongSalt, // Wrong salt
             ctx.justification
           )
-        ).to.be.revertedWithCustomError(ctx.disputeKit, "HashDoesNotMatchHiddenVoteCommitment");
+        ).to.be.revertedWithCustomError(ctx.disputeKit, "ChoiceCommitmentMismatch");
       });
 
       it("Should revert if wrong justification provided", async () => {
@@ -554,7 +554,7 @@ export function testNormalFlowBotReveals(context: () => ShutterTestContext) {
             ctx.salt,
             wrongJustification // Wrong justification
           )
-        ).to.be.revertedWithCustomError(ctx.disputeKit, "WrongJustification");
+        ).to.be.revertedWithCustomError(ctx.disputeKit, "JustificationCommitmentMismatch");
       });
 
       it("Should revert if vote already cast", async () => {
@@ -675,7 +675,7 @@ export function testRecoveryFlowJurorReveals(context: () => ShutterTestContext)
             ctx.salt,
             ""
           )
-        ).to.be.revertedWithCustomError(ctx.disputeKit, "HashDoesNotMatchHiddenVoteCommitment");
+        ).to.be.revertedWithCustomError(ctx.disputeKit, "ChoiceCommitmentMismatch");
       });
 
       it("Should revert if wrong salt in recovery", async () => {
@@ -701,7 +701,7 @@ export function testRecoveryFlowJurorReveals(context: () => ShutterTestContext)
             wrongSalt, // Wrong salt
             ""
           )
-        ).to.be.revertedWithCustomError(ctx.disputeKit, "HashDoesNotMatchHiddenVoteCommitment");
+        ).to.be.revertedWithCustomError(ctx.disputeKit, "ChoiceCommitmentMismatch");
       });
 
       it("Should revert if non-juror tries to reveal without correct full commitment", async () => {
@@ -727,7 +727,7 @@ export function testRecoveryFlowJurorReveals(context: () => ShutterTestContext)
             ctx.salt,
             "" // No justification - would work for juror but not for others
           )
-        ).to.be.revertedWithCustomError(ctx.disputeKit, "WrongJustification");
+        ).to.be.revertedWithCustomError(ctx.disputeKit, "JustificationCommitmentMismatch");
       });
     });
   });
@@ -846,7 +846,7 @@ export function testEdgeCasesAndSecurity(context: () => ShutterTestContext) {
           ctx.salt,
           ctx.justification
         )
-      ).to.be.revertedWithCustomError(ctx.disputeKit, "HashDoesNotMatchHiddenVoteCommitment");
+      ).to.be.revertedWithCustomError(ctx.disputeKit, "ChoiceCommitmentMismatch");
     });
   });
 }
diff --git a/contracts/test/foundry/KlerosCore_Voting.t.sol b/contracts/test/foundry/KlerosCore_Voting.t.sol
index 689df3a7d..5a7b4c091 100644
--- a/contracts/test/foundry/KlerosCore_Voting.t.sol
+++ b/contracts/test/foundry/KlerosCore_Voting.t.sol
@@ -114,11 +114,11 @@ contract KlerosCore_VotingTest is KlerosCore_TestBase {
 
         // Check the require with the wrong choice and then with the wrong salt
         vm.prank(staker1);
-        vm.expectRevert(DisputeKitClassicBase.HashDoesNotMatchHiddenVoteCommitment.selector);
+        vm.expectRevert(DisputeKitClassicBase.ChoiceCommitmentMismatch.selector);
         disputeKit.castVote(disputeID, voteIDs, 2, salt, "XYZ");
 
         vm.prank(staker1);
-        vm.expectRevert(DisputeKitClassicBase.HashDoesNotMatchHiddenVoteCommitment.selector);
+        vm.expectRevert(DisputeKitClassicBase.ChoiceCommitmentMismatch.selector);
         disputeKit.castVote(disputeID, voteIDs, YES, salt - 1, "XYZ");
 
         vm.prank(staker1);

From 780e00a7e3e40e2f781a9a68b4c6d1262de95a66 Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Fri, 17 Oct 2025 13:42:43 +0100
Subject: [PATCH 174/175] feat: extra event StakeDelayedExecutionFailed for
 possible UX improvements

---
 contracts/hardhat.config.ts                            |  2 +-
 contracts/src/arbitration/KlerosCore.sol               |  5 +++--
 contracts/src/arbitration/SortitionModule.sol          | 10 +++++++++-
 .../arbitration/university/KlerosCoreUniversity.sol    |  5 +++--
 4 files changed, 16 insertions(+), 6 deletions(-)

diff --git a/contracts/hardhat.config.ts b/contracts/hardhat.config.ts
index 41a4fb63e..21a62a310 100644
--- a/contracts/hardhat.config.ts
+++ b/contracts/hardhat.config.ts
@@ -32,7 +32,7 @@ const config: HardhatUserConfig = {
           viaIR: process.env.VIA_IR !== "false", // Defaults to true
           optimizer: {
             enabled: true,
-            runs: 1000,
+            runs: 800, // Constrained by the size of the KlerosCore contract
           },
           outputSelection: {
             "*": {
diff --git a/contracts/src/arbitration/KlerosCore.sol b/contracts/src/arbitration/KlerosCore.sol
index cd0741a65..deb46afd8 100644
--- a/contracts/src/arbitration/KlerosCore.sol
+++ b/contracts/src/arbitration/KlerosCore.sol
@@ -613,9 +613,10 @@ contract KlerosCore is IArbitratorV2, Initializable, UUPSProxiable {
     /// @param _account The account whose stake is being set.
     /// @param _courtID The ID of the court.
     /// @param _newStake The new stake.
-    function setStakeBySortitionModule(address _account, uint96 _courtID, uint256 _newStake) external {
+    /// @return True if the stake was set successfully.
+    function setStakeBySortitionModule(address _account, uint96 _courtID, uint256 _newStake) external returns (bool) {
         if (msg.sender != address(sortitionModule)) revert SortitionModuleOnly();
-        _setStake(_account, _courtID, _newStake, true, OnError.Return);
+        return _setStake(_account, _courtID, _newStake, true, OnError.Return);
     }
 
     /// @notice Transfers PNK to the juror by SortitionModule.
diff --git a/contracts/src/arbitration/SortitionModule.sol b/contracts/src/arbitration/SortitionModule.sol
index 125c44c3a..8a73ac76e 100644
--- a/contracts/src/arbitration/SortitionModule.sol
+++ b/contracts/src/arbitration/SortitionModule.sol
@@ -74,6 +74,12 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
     /// @param _amount The amount of tokens staked in the court.
     event StakeDelayed(address indexed _address, uint96 indexed _courtID, uint256 _amount);
 
+    /// @notice Emitted when a juror's stake is delayed execution fails.
+    /// @param _address The address of the juror.
+    /// @param _courtID The ID of the court.
+    /// @param _amount The amount of tokens staked in the court.
+    event StakeDelayedExecutionFailed(address indexed _address, uint96 indexed _courtID, uint256 _amount);
+
     /// @notice Emitted when a juror's stake is locked.
     /// @param _address The address of the juror.
     /// @param _relativeAmount The amount of tokens locked.
@@ -235,7 +241,9 @@ contract SortitionModule is ISortitionModule, Initializable, UUPSProxiable {
 
         for (uint256 i = delayedStakeReadIndex; i < newDelayedStakeReadIndex; i++) {
             DelayedStake storage delayedStake = delayedStakes[i];
-            core.setStakeBySortitionModule(delayedStake.account, delayedStake.courtID, delayedStake.stake);
+            if (!core.setStakeBySortitionModule(delayedStake.account, delayedStake.courtID, delayedStake.stake)) {
+                emit StakeDelayedExecutionFailed(delayedStake.account, delayedStake.courtID, delayedStake.stake);
+            }
             delete delayedStakes[i];
         }
         delayedStakeReadIndex = newDelayedStakeReadIndex;
diff --git a/contracts/src/arbitration/university/KlerosCoreUniversity.sol b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
index 43a63d9f9..39f4414a4 100644
--- a/contracts/src/arbitration/university/KlerosCoreUniversity.sol
+++ b/contracts/src/arbitration/university/KlerosCoreUniversity.sol
@@ -462,9 +462,10 @@ contract KlerosCoreUniversity is IArbitratorV2, UUPSProxiable, Initializable {
     /// @param _account The account whose stake is being set.
     /// @param _courtID The ID of the court.
     /// @param _newStake The new stake.
-    function setStakeBySortitionModule(address _account, uint96 _courtID, uint256 _newStake) external {
+    /// @return True if the stake was set successfully.
+    function setStakeBySortitionModule(address _account, uint96 _courtID, uint256 _newStake) external returns (bool) {
         if (msg.sender != address(sortitionModule)) revert SortitionModuleOnly();
-        _setStake(_account, _courtID, _newStake, true, OnError.Return);
+        return _setStake(_account, _courtID, _newStake, true, OnError.Return);
     }
 
     /// @notice Transfers PNK to the juror by SortitionModule.

From c40c12c9c6c648b1e1f6eb63b032e4c8bbc9d3ab Mon Sep 17 00:00:00 2001
From: jaybuidl <jb@kleros.io>
Date: Fri, 17 Oct 2025 14:16:50 +0100
Subject: [PATCH 175/175] chore: hardhat bump, draw test edge case

---
 contracts/package.json                        |  6 ++--
 .../test/foundry/KlerosCore_Drawing.t.sol     | 17 +++++++++++
 yarn.lock                                     | 30 +++++++++----------
 3 files changed, 35 insertions(+), 18 deletions(-)

diff --git a/contracts/package.json b/contracts/package.json
index ad8174fb6..4f6014d53 100644
--- a/contracts/package.json
+++ b/contracts/package.json
@@ -129,14 +129,14 @@
     "gluegun": "^5.2.0",
     "graphql": "^16.9.0",
     "graphql-request": "^7.1.2",
-    "hardhat": "2.26.2",
-    "hardhat-contract-sizer": "^2.10.0",
+    "hardhat": "2.26.3",
+    "hardhat-contract-sizer": "^2.10.1",
     "hardhat-deploy": "^1.0.4",
     "hardhat-deploy-ethers": "^0.4.2",
     "hardhat-deploy-tenderly": "^0.2.1",
     "hardhat-docgen": "^1.3.0",
     "hardhat-gas-reporter": "^2.3.0",
-    "hardhat-tracer": "^3.2.1",
+    "hardhat-tracer": "^3.4.0",
     "hardhat-watcher": "^2.5.0",
     "pino": "^8.21.0",
     "pino-pretty": "^10.3.1",
diff --git a/contracts/test/foundry/KlerosCore_Drawing.t.sol b/contracts/test/foundry/KlerosCore_Drawing.t.sol
index 2db69e612..a1242009f 100644
--- a/contracts/test/foundry/KlerosCore_Drawing.t.sol
+++ b/contracts/test/foundry/KlerosCore_Drawing.t.sol
@@ -5,6 +5,7 @@ import {KlerosCore_TestBase} from "./KlerosCore_TestBase.sol";
 import {KlerosCore} from "../../src/arbitration/KlerosCore.sol";
 import {SortitionModule} from "../../src/arbitration/SortitionModule.sol";
 import {ISortitionModule} from "../../src/arbitration/interfaces/ISortitionModule.sol";
+import {Vm} from "forge-std/Vm.sol";
 import "../../src/libraries/Constants.sol";
 
 /// @title KlerosCore_DrawingTest
@@ -46,6 +47,22 @@ contract KlerosCore_DrawingTest is KlerosCore_TestBase {
             assertEq(choice, 0, "Choice should be empty");
             assertEq(voted, false, "Voted should be false");
         }
+
+        // Try drawing even more...
+        vm.recordLogs();
+        core.draw(disputeID, DEFAULT_NB_OF_JURORS); // Should not revert, nor draw any juror, nor change state.
+        Vm.Log[] memory entries = vm.getRecordedLogs();
+
+        // Verify no Draw events were emitted
+        bytes32 drawEventSignature = keccak256("Draw(address,uint256,uint256,uint256)");
+        for (uint256 i = 0; i < entries.length; i++) {
+            assertFalse(entries[i].topics[0] == drawEventSignature, "Draw event should not be emitted");
+        }
+
+        assertEq(totalStaked, 1500, "Wrong amount total staked");
+        assertEq(totalLocked, 3000, "Wrong amount locked");
+        assertEq(stakedInCourt, 1500, "Wrong amount staked in court");
+        assertEq(sortitionModule.disputesWithoutJurors(), 0, "Wrong disputesWithoutJurors count");
     }
 
     function test_draw_noEmptyAddresses() public {
diff --git a/yarn.lock b/yarn.lock
index 0c287d75a..8b05f14c9 100644
--- a/yarn.lock
+++ b/yarn.lock
@@ -6625,14 +6625,14 @@ __metadata:
     gluegun: "npm:^5.2.0"
     graphql: "npm:^16.9.0"
     graphql-request: "npm:^7.1.2"
-    hardhat: "npm:2.26.2"
-    hardhat-contract-sizer: "npm:^2.10.0"
+    hardhat: "npm:2.26.3"
+    hardhat-contract-sizer: "npm:^2.10.1"
     hardhat-deploy: "npm:^1.0.4"
     hardhat-deploy-ethers: "npm:^0.4.2"
     hardhat-deploy-tenderly: "npm:^0.2.1"
     hardhat-docgen: "npm:^1.3.0"
     hardhat-gas-reporter: "npm:^2.3.0"
-    hardhat-tracer: "npm:^3.2.1"
+    hardhat-tracer: "npm:^3.4.0"
     hardhat-watcher: "npm:^2.5.0"
     isomorphic-fetch: "npm:^3.0.0"
     pino: "npm:^8.21.0"
@@ -22033,16 +22033,16 @@ __metadata:
   languageName: node
   linkType: hard
 
-"hardhat-contract-sizer@npm:^2.10.0":
-  version: 2.10.0
-  resolution: "hardhat-contract-sizer@npm:2.10.0"
+"hardhat-contract-sizer@npm:^2.10.1":
+  version: 2.10.1
+  resolution: "hardhat-contract-sizer@npm:2.10.1"
   dependencies:
     chalk: "npm:^4.0.0"
     cli-table3: "npm:^0.6.0"
     strip-ansi: "npm:^6.0.0"
   peerDependencies:
     hardhat: ^2.0.0
-  checksum: 10/2b3011fe5333c2f1dbcfa6c73dcb1c61da9e2e045775c24bb773fe5f3ac14e9923907fef0e61fc2897e82a61997ce74e73baadb7f69dfdeccc86ae878cf67792
+  checksum: 10/521e985f0e6b5c1d06e38be8b374ae30f26ed6a72740ecfeeea1d8d5ee1341b98f699ed5587cc429e6de84da2c22df612e394ce492d393a4922702e82cc051f9
   languageName: node
   linkType: hard
 
@@ -22143,9 +22143,9 @@ __metadata:
   languageName: node
   linkType: hard
 
-"hardhat-tracer@npm:^3.2.1":
-  version: 3.2.1
-  resolution: "hardhat-tracer@npm:3.2.1"
+"hardhat-tracer@npm:^3.4.0":
+  version: 3.4.0
+  resolution: "hardhat-tracer@npm:3.4.0"
   dependencies:
     chalk: "npm:^4.1.2"
     debug: "npm:^4.3.4"
@@ -22154,7 +22154,7 @@ __metadata:
   peerDependencies:
     chai: 4.x
     hardhat: ">=2.22.5 <3.x"
-  checksum: 10/963afeb42c1ed30704877c3b521afc748e60042d218cef333fc11d3246f544267c303df0effc1e2a5cac9cc8a9ec744fda6ceb4e3fc156d3e17f4cfb766f6ab1
+  checksum: 10/cdbab3bc60b73156866b5fdc27486ef75894094f67382dad28f0868ab167116787c61d9ab430a61ac49fb1787a47da9281fb421e8dc6fefc9dd4fa7660ad3f60
   languageName: node
   linkType: hard
 
@@ -22169,9 +22169,9 @@ __metadata:
   languageName: node
   linkType: hard
 
-"hardhat@npm:2.26.2":
-  version: 2.26.2
-  resolution: "hardhat@npm:2.26.2"
+"hardhat@npm:2.26.3":
+  version: 2.26.3
+  resolution: "hardhat@npm:2.26.3"
   dependencies:
     "@ethereumjs/util": "npm:^9.1.0"
     "@ethersproject/abi": "npm:^5.1.2"
@@ -22222,7 +22222,7 @@ __metadata:
       optional: true
   bin:
     hardhat: internal/cli/bootstrap.js
-  checksum: 10/ef9f5f232264ed45a406a7053ccce71e67b0ce084de2de6fa2c24ff0bb1ec0d7b69f61769b3ac94a50445709b25bcf0d8ee135e1509e53331a3fea44d01cbb63
+  checksum: 10/77fabed0a9f5a5871bd071cd1eae3ce120ee878370a0d58e1a762fd49d01b68385b955c111d4a55147b1540333712ef36796fd5ee142e504aad17e2b2f746d6d
   languageName: node
   linkType: hard